{"mappings":"owCAA0B,WACqB,kBACS,gBAExC,yFACC,oCACK,yCACD,mDACQ,gDACV,sCACE,wCACD,kDAEdA,EAAAA,CAAAA,CACFC,KAAM,IAAKC,UAAAA,EAAAA,UACXD,KAAM,mBAAoBC,UAAAA,EAAAA,UAC1BD,KAAM,iBAAkBC,UAAAA,EAAAA,UACxBD,KAAM,iBAAkBC,UAAAA,EAAAA,UACxBD,KAAM,mBAAoBE,KAAM,WAAYD,UAAAA,EAAAA,UAE1CE,EAAAA,EAAAA,aAAAA,CACJC,QAAAA,EAAAA,mBACAL,OAAQA,IAGJM,EAAAA,EAAAA,UAAAA,EAAAA,SACHC,IAAIH,GACJG,IAAAA,EAAAA,SACAA,IAAAA,EAAAA,qBACAA,IAAAA,EAAAA,QAEHD,EAAIJ,UAAU,YAAAM,EAAAC,SACdH,EAAII,MAAM,2UChCV,aAGEC,EAAOC,QAAUC,EAAQ,wFCH3B,aAEAC,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAAC,EAAAJ,EAAA,qBACAK,EAAAL,EAAA,oBACAM,EAAAN,EAAA,eAEA,SAAAO,EAAAC,GACA,GAAAA,GAAAA,EAAAC,WAAA,OAAAD,EACA,IAAAE,EAAAT,OAAAU,OAAA,MAOA,OANAH,GACAP,OAAAW,KAAAJ,GAAAK,SAAA,SAAAC,GACAJ,EAAAI,GAAAN,EAAAM,MAGAJ,EAAA,QAAAF,EACAP,OAAAc,OAAAL,GAGA,IAAAM,EAAAT,EAAAF,GAGA,MAAAY,EAAAhB,OAAAU,OAAA,MACA,SAAAO,EAAAC,EAAAC,GACA,IAAAd,EAAAe,SAAAF,GAAA,CACA,IAAAA,EAAAG,SAIA,OAAAhB,EAAAiB,KAHAJ,EAAAA,EAAAK,UAMA,MAAAC,EAAAN,EACAO,EAAAT,EAAAQ,GACA,GAAAC,EACA,OAAAA,EAEA,GAAA,MAAAP,EAAA,GAAA,CACA,MAAAQ,EAAAC,SAAAC,cAAAV,GAKAA,EAAAQ,EAAAA,EAAAH,UAAA,GAEA,MAAAM,KAAAA,GAAA1B,EAAA2B,QAAAZ,EAAAb,EAAA0B,OAAA,CACAC,aAAA,EACAC,aAAAC,EACAC,OAAA9B,EAAAiB,MACAH,IAKAiB,EAAA,IAAAC,SAAA,MAAAR,EAAA,CAAAd,GAEA,OADAqB,EAAAE,KAAA,EACAtB,EAAAQ,GAAAY,EAEAhC,EAAAmC,wBAAAtB,GAEAjB,OAAAW,KAAAP,GAAAQ,SAAA,SAAAC,GACA,YAAAA,IAAAf,EAAAe,GAAAT,EAAAS,OAEAf,EAAAgC,QAAAb,4GChEA,aAGEpB,EAAOC,QAAUC,EAAQ,0GCH3B,aAEAC,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAAsC,EAAAzC,EAAA,sBACAM,EAAAN,EAAA,eAEA,MAAA0C,EAAAC,OAAA,IACAC,EAAAD,OAAA,IACAE,EAAAF,OAAA,IACAG,EAAAH,OAAA,IACAI,EAAAJ,OAAA,IACAK,EAAAL,OAAA,IACAM,EAAAN,OAAA,IACAO,EAAAP,OAAA,IACAQ,EAAAR,OAAA,IACAS,EAAAT,OAAA,IACAF,EAAAY,uBAAA,CACAC,CAAAZ,GAAA,cACAY,CAAAV,GAAA,iBACAU,CAAAT,GAAA,aACAS,CAAAR,GAAA,eACAQ,CAAAP,GAAA,gBACAO,CAAAN,GAAA,gBACAM,CAAAL,GAAA,WACAK,CAAAJ,GAAA,QACAI,CAAAH,GAAA,aACAG,CAAAF,GAAA,oBAGA,IAAAG,EAAA,CACAC,GAAA,IACAC,GAAA,IACAC,GAAA,IACAC,GAAA,IACAC,MAAA,IACAC,MAAA,IACAC,IAAA,IACAC,IAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,IAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,IAAA,IACAC,IAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,IAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,IAAA,IACAC,IAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,IAAA,IACAC,IAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,IAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,KAAA,IACAC,KAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,KAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,KAAA,IACAC,KAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,KAAA,IACAC,KAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,KAAA,IACAC,KAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,KAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,KAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,KAAA,IACAC,KAAA,IACAC,OAAA,IACAC,KAAA,IACAC,KAAA,IACAC,OAAA,IACAC,KAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,KAAA,IACAC,KAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,KAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,KAAA,IACAC,KAAA,IACAC,KAAA,IACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,KAAA,IACAC,KAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,OAAA,KACAC,OAAA,KACAC,OAAA,KACAC,OAAA,KACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,KACAC,KAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,KACAC,OAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,MAAA,IACAC,MAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,MAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,KACAC,MAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,MAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,MAAA,IACAC,MAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,MAAA,IACAC,MAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,IACAC,QAAA,KACAC,QAAA,KACAC,QAAA,KACAC,QAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,KACAC,SAAA,KACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,KACAC,SAAA,KACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,SAAA,IACAC,OAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,KACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,KACAC,UAAA,KACAC,UAAA,IACAC,UAAA,KACAC,UAAA,KACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,KACAC,UAAA,KACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,KACAC,UAAA,KACAC,UAAA,KACAC,UAAA,KACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,UAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,KACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,KACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,KACAC,WAAA,IACAC,WAAA,IACAC,WAAA,KACAC,WAAA,KACAC,WAAA,KACAC,WAAA,IACAC,WAAA,KACAC,WAAA,KACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,WAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,KACAC,YAAA,IACAC,YAAA,KACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,YAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,KACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,KACAC,aAAA,IACAC,aAAA,IACAC,aAAA,KACAC,aAAA,KACAC,aAAA,IACAC,aAAA,IACAC,aAAA,KACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,aAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,KACAC,cAAA,KACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,KACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,cAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,KACAC,eAAA,IACAC,eAAA,IACAC,eAAA,KACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,eAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,KACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,IACAC,gBAAA,KACAC,gBAAA,KACAC,gBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,KACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,iBAAA,KACAC,iBAAA,KACAC,iBAAA,IACAC,iBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,kBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,KACAC,mBAAA,IACAC,mBAAA,KACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,KACAC,oBAAA,IACAC,oBAAA,KACAC,oBAAA,KACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,oBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,KACAC,qBAAA,KACAC,qBAAA,KACAC,qBAAA,IACAC,qBAAA,KACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,qBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,KACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,sBAAA,IACAC,uBAAA,IACAC,uBAAA,IACAC,uBAAA,IACAC,uBAAA,IACAC,uBAAA,IACAC,uBAAA,KACAC,uBAAA,KACAC,uBAAA,IACAC,uBAAA,IACAC,wBAAA,IACAC,wBAAA,IACAC,wBAAA,IACAC,wBAAA,IACAC,wBAAA,IACAC,wBAAA,IACAC,wBAAA,KACAC,wBAAA,IACAC,wBAAA,IACAC,wBAAA,IACAC,wBAAA,IACAC,yBAAA,IACAC,yBAAA,IACAC,yBAAA,IACAC,yBAAA,IACAC,yBAAA,IACAC,yBAAA,IACAC,yBAAA,IACAC,0BAAA,IACAC,0BAAA,IACAC,2BAAA,KACAC,4BAAA,IACAC,4BAAA,IACAC,mCAAA,KAIA,IAAAC,EACA,MA0FAC,EAAA,CACAC,IAAA,KACAC,IAAA,KACAC,IAAA,IACAC,IAAA,KACAC,IAAA,KACAC,IAAA,KACAC,IAAA,KACAC,IAAA,IACAC,IAAA,KACAC,IAAA,IACAC,IAAA,KACAC,IAAA,IACAC,IAAA,IACAC,IAAA,KACAC,IAAA,KACAC,IAAA,KACAC,IAAA,KACAC,IAAA,KACAC,IAAA,KACAC,IAAA,KACAC,IAAA,IACAC,IAAA,KACAC,IAAA,IACAC,IAAA,KACAC,IAAA,IACAC,IAAA,IACAC,IAAA,KAGAC,EAAAtwE,EAAAuwE,QAAA,gCAAA,GACAC,EAAA,CACAC,UAAAzwE,EAAAywE,UACAC,YAAAC,GAAA3wE,EAAA4wE,UAAAD,IAAA3wE,EAAA6wE,SAAAF,GACAG,SAAAH,GAAA,QAAAA,EACAI,eA7HA,CAAAC,EAAAC,KACA,IAAAC,EAAA,EACA,MAAAC,EAAAH,EAAAI,OACA,IAAAC,EAAA,GACA,SAAAC,EAAAF,GACAF,GAAAE,EACAJ,EAAAA,EAAAO,MAAAH,GAEA,KAAAF,EAAAC,GAAA,CACA,MAAAK,EAAA,aAAAC,KAAAT,GACA,IAAAQ,GAAAN,EAAAM,EAAAE,OAAAP,EAAA,CACA,MAAAQ,EAAAR,EAAAD,EACAG,GAAAL,EAAAO,MAAA,EAAAI,GACAL,EAAAK,GACA,MAKA,GAFAN,GAAAL,EAAAO,MAAA,EAAAC,EAAAE,OACAJ,EAAAE,EAAAE,OACA,MAAAF,EAAA,GAAA,CAEA,IACA3xE,EADAb,EAAA,GAEA,GAAA,YAAA4yE,KAAAZ,EAAA,IAAA,CACAvC,IACAA,EAAA9uE,OAAAW,KAAA2C,GAAA4uE,QAAA,CAAAC,EAAA9yE,IAAA+yE,KAAAD,IAAAA,EAAA9yE,EAAAoyE,SAAA,IAEA,IAAA,IAAAA,EAAA3C,GAAA5uE,GAAAuxE,EAAA,IAAAA,EACApyE,EAAAgyE,EAAAgB,OAAA,EAAAZ,GACAvxE,EAAAoD,EAAAjE,GAEA,GAAAa,EAAA,CACA,MAAAoyE,EAAAjzE,EAAAkzE,SAAA,KACAjB,IACAgB,GACA,aAAAL,KAAAZ,EAAAhyE,EAAAoyE,OAAA,IAAA,KACAC,GAAA,IAAAryE,EACAsyE,EAAA,EAAAtyE,EAAAoyE,UAGAC,GAAAxxE,EACAyxE,EAAA,EAAAtyE,EAAAoyE,cAIAC,GAAA,IAAAryE,EACAsyE,EAAA,EAAAtyE,EAAAoyE,aAIAC,GAAA,IACAC,EAAA,OAGA,CAEA,MAAAa,EAAA,QAAAX,EAAA,GAEAY,GADAD,EAAA,qBAAA,iBACAV,KAAAT,GACA,GAAAoB,EAIA,CAEA,IAAAC,EAAAC,OAAAC,SAAAH,EAAA,GAAAD,EAAA,GAAA,IACA,IAAAE,GAGAA,EAAA,SAGAA,GAAA,OAAAA,GAAA,MALAA,EAAA,MAQAA,GAAA,OAAAA,GAAA,OAAA,QAAA,MAAAA,KACAA,GAAA,GAAAA,GAAA,GACA,KAAAA,GACAA,GAAA,IAAAA,GAAA,IACAA,GAAA,KAAAA,GAAA,OACAA,EAAA3D,EAAA2D,IAAAA,GAEAhB,GAAAmB,OAAAC,cAAAJ,GACAf,EAAAc,EAAA,GAAAhB,aAvBAC,GAAAG,EAAA,GACAF,EAAAE,EAAA,GAAAJ,SA0BA,OAAAC,GAuCAqB,mBAAA/B,GACAxuE,EAAAwwE,cAAAhC,EAAA,cACA9tE,EAEAV,EAAAwwE,cAAAhC,EAAA,mBACA7tE,OADA,EAKAE,aAAA2tE,EAAAiC,GACA,IAAAC,EAAAD,EAAAA,EAAAC,GAAA,EACA,GAAAD,GAAA,IAAAC,EACA,GAAA,mBAAAD,EAAAjC,IAAA,CACA,GAAA,QAAAA,EACA,OAAA,EAEAiC,EAAAE,MAAAC,MAAAC,GAAA,IAAAA,EAAAC,MACA,aAAAD,EAAAh0E,MACA,MAAAg0E,EAAAnzE,QACA,cAAAmzE,EAAAnzE,MAAAqzE,SACA,0BAAAF,EAAAnzE,MAAAqzE,aACAL,EAAA,OAGA,qBAAAjB,KAAAgB,EAAAjC,MACA,WAAAA,GACA,eAAAA,IACAkC,EAAA,QAGAD,GAAA,IAAAC,IACA,kBAAAD,EAAAjC,KACA,SAAAiC,EAAAjC,KACA,UAAAiC,EAAAjC,MACAkC,EAAA,IAGA,GAAA,IAAAA,EAAA,CACA,GAAA,QAAAlC,EACA,OAAA,EAEA,GAAA,SAAAA,EACA,OAAA,EAGA,OAAAkC,GAGA7vE,aAAA2tE,IAAAA,EAAAkC,GAAAA,IACA,GAAA,IAAAA,EAAA,CACA,GAAA,aAAAlC,GAAA,UAAAA,EACA,OAAA,EAEA,GAAAL,EAAAK,GACA,OAAA,EAGA,OAAA,IAUAwC,EAAAC,IACA,IAAAA,EAAAH,MACAG,EAAAN,MAAAvyE,SAAA,CAAA8yE,EAAAC,KACA,IAAAD,EAAAJ,MAAA,UAAAI,EAAAr0E,MAAAq0E,EAAAxzE,QAEAuzE,EAAAN,MAAAQ,GAAA,CACAL,KAAA,EACAj0E,KAAA,OACAu0E,IAAApxE,EAAAqxE,uBAAA,SAAA,EAAAH,EAAAI,KACAC,IAAAC,EAAAN,EAAAxzE,MAAAqzE,QAAAG,EAAAI,KACAG,UAAA,GACAH,IAAAJ,EAAAI,UAMAE,EAAA,CAAAE,EAAAJ,KACA,MAAAK,EAAA9zE,EAAA+zE,iBAAAF,GACA,OAAA1xE,EAAAqxE,uBAAAQ,KAAAC,UAAAH,IAAA,EAAAL,EAAA,IAGA,SAAAS,EAAA1yE,EAAAiyE,GACA,OAAAtxE,EAAAgyE,oBAAA3yE,EAAAiyE,EAAAW,GAEA,MAAAA,EAAA,CACAC,GAAA,gCACAC,GAAA,yCACAC,GAAA,gCACAC,GAAA,yCACAC,GAAA,yEACAC,GAAA,uDACAC,GAAA,sGACAC,GAAA,+FACAC,GAAA,gCACAC,GAAA,+DACAC,GAAA,2FAwGAC,EAAAh1E,EAAAuwE,QAAA,wBACA0E,EAAAj1E,EAAAuwE,QAEA,sDAMA2E,EAAAl1E,EAAAuwE,QAAA,cACA4E,EAAAn1E,EAAAuwE,QAAA,gCAAA,GAgDA6E,EAAA,CAAAj0E,EAAAk0E,IACAlzE,EAAAmzE,YAAAn0E,IAAA,YAAAA,EAAA+xE,QAAAqC,cAEApzE,EAAAqxE,uBAAA6B,GAAA,GACA,IAAAl0E,EAAA8xE,KACA9wE,EAAAqzE,yBAAA,CACA,IACAr0E,EACA,sBAAAk0E,SACAl0E,EACA,MAEAA,EA+EAs0E,EAAA,CAAAC,EAAAC,EAAA/C,KAEA,GAAA+C,EAAAC,OAAAC,MAAA,EACA,OAEA,IAAAC,EAAA,EACAC,EAAA,EACA,MAAAC,EAAA,GACAC,EAAAC,IACA,GAAAJ,GAAA,IACAC,GAAA,EAAA,CAEA,MAAAI,EAAAh0E,EAAAi0E,qBAAAT,EAAAU,OAAAl0E,EAAAm0E,eAAA,CACAtC,KAAAC,UAAA+B,EAAAO,KAAAnD,GAAAoD,EAAApD,EAAAuC,KAAAc,KAAA,KAGAjE,OAAAwD,EAAA5E,UAIA,GADAsF,EAAAV,EAAA,GAAAG,EAAAR,GACAK,EAAA5E,OAAA,EAAA,CACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA0C,EAAA5E,OAAAkC,IAEAoD,EAAAV,EAAA1C,GAAA,KAAAqC,GAGA,MAAAgB,EAAAX,EAAA5E,OAAA,EAEA,OADAsE,EAAAkB,OAAAV,EAAAF,EAAA5E,OAAA,EAAAuF,GACAA,GAGA,OAAA,GAEA,IAAArD,EAAA,EACA,KAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAnB,EAAApC,GAEA,GADAwD,EAAAD,GACA,CAEA,MAAAzD,EAAAyD,EACAE,EAAAC,EAAA5D,GACA,GAAA2D,EAAA,CAEAjB,GAAAiB,EAAA,GACAhB,GAAAgB,EAAA,GACAf,EAAAiB,KAAA7D,GACA,UAMAE,GAAA2C,EAAA3C,GAEAwC,EAAA,EACAC,EAAA,EACAC,EAAA5E,OAAA,EAGA6E,EAAA3C,IAEAwD,EAAA1D,IAAA,IAAAA,EAAAH,MAAA,IAAAG,EAAA8D,SACA,IAAA9D,EAAAH,OACAG,EAAA+D,aACA,IAAA/D,EAAA+D,YAAAlE,MACAG,EAAA+D,YAAAC,QACAC,EAAA,gBACAC,EAAAt4E,GACAgB,EAAAu3E,YAAAv4E,IAAAq4E,EAAAzF,KAAA5yE,GAEA03E,EAAA,CAAAtD,EAAAoE,EAAA7B,KACA,MAAA8B,EAAArE,EAAA+D,YAAAC,QACAzB,EAAA+B,OAAA/B,EAAA+B,OAAAC,QAAAF,IAAAD,GAEAI,EAAA53E,EAAAuwE,QAAA,mDAQA,SAAAyG,EAAA5D,GACA,GAAA,IAAAA,EAAAH,MAAA2E,EAAAxE,EAAAzC,KACA,OAAA,EAEA,GAAA,KAAAyC,EAAAH,KACA,MAAA,CAAA,EAAA,GAEA,IAAA6C,EAAA,EACAC,EAAA3C,EAAAN,MAAA1B,OAAA,EAAA,EAAA,EACAyG,GAAA,EACA,MAAAC,EAAA,KACAD,GAAA,GACA,GAqCA,QA/BA,SAAAE,EAAA3E,GACA,IAAA,IAAAE,EAAA,EAAAA,EAAAF,EAAAN,MAAA1B,OAAAkC,IAAA,CACA,MAAAD,EAAAD,EAAAN,MAAAQ,GAEA,GAAA,IAAAD,EAAAJ,OAAAqE,EAAAjE,EAAAr0E,MACA,OAAA84E,IAEA,GAAA,IAAAzE,EAAAJ,MAAA,SAAAI,EAAAr0E,MAEAq0E,EAAAE,MACA,IAAAF,EAAAE,IAAAN,MACAI,EAAAE,IAAAyE,WAAAV,EAAAjE,EAAAE,IAAAL,UACA,OAAA4E,IAIA,IAAA,IAAAxE,EAAA,EAAAA,EAAAF,EAAAsC,SAAAtE,OAAAkC,IAAA,CACAwC,IACA,MAAAe,EAAAzD,EAAAsC,SAAApC,GACA,GAAA,IAAAuD,EAAA5D,OACA4D,EAAA/D,MAAA1B,OAAA,GACA2E,IAEAgC,EAAAlB,GACAgB,GACA,OAAA,EAIA,OAAA,EAEAE,CAAA3E,IAAA,CAAA0C,EAAAC,GAEA,SAAAS,EAAApD,EAAAuC,GACA,GAAA31E,EAAAe,SAAAqyE,GACA,OAAAA,EAEA,GAAApzE,EAAAi4E,SAAA7E,GACA,MAAA,GAEA,OAAAA,EAAAH,MACA,KAAA,EACA,OAgBA,SAAAG,EAAAuC,GACA,IAAAuC,EAAA,IAAA9E,EAAAzC,MACA,IAAA,IAAA2C,EAAA,EAAAA,EAAAF,EAAAN,MAAA1B,OAAAkC,IAAA,CACA,MAAAD,EAAAD,EAAAN,MAAAQ,GACA,GAAA,IAAAD,EAAAJ,KACAiF,GAAA,IAAA7E,EAAAr0E,OACAq0E,EAAAxzE,QACAq4E,GAAA,KAAAl4E,EAAAm4E,WAAA9E,EAAAxzE,MAAAqzE,kBAGA,GAAA,IAAAG,EAAAJ,MAAA,SAAAI,EAAAr0E,KAAA,CAEA,IAAAo5E,EAAAC,EAAAhF,EAAAK,KACA,GAAA,MAAA0E,EAAA,CACA,MAAA7E,EAAAF,EAAAE,KAAAF,EAAAE,IAAAL,QACA,UAAAK,EACA6E,EAAAp4E,EAAAs4E,eAAAF,GAEA,UAAA7E,IACA6E,EAAAp4E,EAAAu4E,eAAAv4E,EAAAw4E,eAAAJ,KAEAF,GAAA,IAAA7E,EAAAE,IAAAL,YAAAlzE,EAAAm4E,WAAAC,QAIAzC,EAAA8C,UACAP,GAAA,IAAAvC,EAAA8C,WAEAP,GAAA,IACA,IAAA,IAAA5E,EAAA,EAAAA,EAAAF,EAAAsC,SAAAtE,OAAAkC,IACA4E,GAAA1B,EAAApD,EAAAsC,SAAApC,GAAAqC,GAEA31E,EAAAywE,UAAA2C,EAAAzC,OACAuH,GAAA,KAAA9E,EAAAzC,QAEA,OAAAuH,EAnDAQ,CAAAtF,EAAAuC,GACA,KAAA,EACA,OAAA31E,EAAAm4E,WAAA/E,EAAAF,SACA,KAAA,EACA,MAAA,UAAAlzE,EAAAm4E,WAAA/E,EAAAF,iBACA,KAAA,EACA,OAAAlzE,EAAAm4E,WAAAn4E,EAAA24E,gBAAAN,EAAAjF,EAAAF,WACA,KAAA,EACA,OAAAlzE,EAAAm4E,WAAAE,EAAAjF,IACA,KAAA,GACA,OAAAoD,EAAApD,EAAAF,QAAAyC,GACA,QAEA,MAAA,IA+CA,SAAA0C,EAAA3E,GACA,GAAA,IAAAA,EAAAT,KACA,OAAA,IAAAjxE,SAAA,UAAA0xE,EAAAR,UAAA,GAEA,CAEA,IAAAgF,EAAA,GAeA,OAdAxE,EAAAgC,SAAAn1E,SAAAq4E,IACA54E,EAAAe,SAAA63E,IAAA54E,EAAAi4E,SAAAW,KAGA,IAAAA,EAAA3F,KACAiF,GAAAU,EAAA1F,QAEA,IAAA0F,EAAA3F,KACAiF,GAAAl4E,EAAA24E,gBAAAN,EAAAO,EAAA1F,UAGAgF,GAAAG,EAAAO,OAGAV,GAIA,MAAAW,EAAA,CAAAzF,EAAAuC,KACA,IAAAvC,EAAAH,MACA,IAAAG,EAAA8D,SACA,WAAA9D,EAAAzC,KAAA,UAAAyC,EAAAzC,MACAgF,EAAA/zE,QAAAsyE,EAAA,GAAAd,EAAAK,MACAkC,EAAAmD,eAIAC,EAAA,CACA5F,GAGA6F,EAAA,CACAC,MAAA92E,EAAA+2E,uBACAC,KA5eA,CAAAC,EAAAhG,EAAAuC,KACA,MAAAjC,IAAAA,EAAAD,IAAAA,GAAA2F,EAQA,OAPA1F,GACAiC,EAAA/zE,QAAAsyE,EAAA,GAAAT,IAEAL,EAAAsC,SAAAtE,SACAuE,EAAA/zE,QAAAsyE,EAAA,GAAAT,IACAL,EAAAsC,SAAAtE,OAAA,GAEA,CACA0B,MAAA,CACA3wE,EAAAk3E,qBAAAl3E,EAAAqxE,uBAAA,aAAA,EAAAC,GAAAC,GAAAvxE,EAAAqxE,uBAAA,IAAA,OAkeA8F,KA7dA,CAAAF,EAAAhG,EAAAuC,KACA,MAAAjC,IAAAA,EAAAD,IAAAA,GAAA2F,EAQA,OAPA1F,GACAiC,EAAA/zE,QAAAsyE,EAAA,GAAAT,IAEAL,EAAAsC,SAAAtE,SACAuE,EAAA/zE,QAAAsyE,EAAA,GAAAT,IACAL,EAAAsC,SAAAtE,OAAA,GAEA,CACA0B,MAAA,CACA3wE,EAAAk3E,qBAAAl3E,EAAAqxE,uBAAA,eAAA,GAAAE,EACAvxE,EAAAi0E,qBAAAT,EAAA4D,aAAAp3E,EAAAq3E,mBAAA,CAAA9F,GAAAD,GACAtxE,EAAAqxE,uBAAA,IAAA,OAidAiG,MA5cA,CAAAL,EAAAhG,EAAAuC,KACA,MAAA+D,EAAAv3E,EAAAw3E,eAAAP,EAAAhG,EAAAuC,GAEA,IAAA+D,EAAA5G,MAAA1B,QAAA,IAAAgC,EAAA8D,QACA,OAAAwC,EAEAN,EAAA7F,KACAoC,EAAA/zE,QAAAsyE,EAAA,GAAAkF,EAAA7F,IAAAE,MAEA,MAAA9C,IAAAA,GAAAyC,EACAwG,EAAAjE,EAAAiE,gBAAAjJ,GACA,GAAA,UAAAA,GACA,aAAAA,GACA,WAAAA,GACAiJ,EAAA,CACA,IAAAC,EAAAt3E,EACAu3E,GAAA,EACA,GAAA,UAAAnJ,GAAAiJ,EAAA,CACA,MAAA3G,EAAA9wE,EAAA43E,SAAA3G,EAAA,QACA,GAAAH,GACA,GAAA,IAAAA,EAAAA,KAEA4G,EAAAp3E,OAEA,GAAAwwE,EAAApzE,MACA,OAAAozE,EAAApzE,MAAAqzE,SACA,IAAA,QACA2G,EAAAz3E,EACA,MACA,IAAA,WACAy3E,EAAAv3E,EACA,MACA,IAAA,OACAw3E,GAAA,EACAnE,EAAA/zE,QAAAsyE,EAAA,GAAAkF,EAAA3F,YAKAtxE,EAAA63E,mBAAA5G,KAGAyG,EAAAp3E,OAIA,WAAAkuE,IACAkJ,EAAAr3E,GAMAs3E,IACAJ,EAAAO,YAAAtE,EAAAU,OAAAwD,SAIAlE,EAAA/zE,QAAAsyE,EAAA,GAAAkF,EAAA3F,MAMA,OAFAiG,EAAA5G,MAAA4G,EAAA5G,MAAAoH,QAAA7G,KAAA,IAAAA,EAAAlyE,IAAA8xE,MACA,eAAAI,EAAAlyE,IAAA+xE,WACAwG,GA6YAS,GAlUA,CAAAf,EAAAhG,EAAAuC,IACAxzE,EAAAi4E,YAAAhB,EAAAhG,EAAAuC,GAAA+D,IACA,MAAA9F,UAAAA,GAAAwF,EACA,IAAAxF,EAAAxC,OACA,OAAAsI,EACA,IAAAv4E,IAAAA,EAAAtB,MAAAw6E,GAAAX,EAAA5G,MAAA,GACA,MAAAwH,aAAAA,EAAAC,gBAAAA,EAAAC,qBAAAA,GAnEA,EAAAr5E,EAAAyyE,EAAA+B,EAAAlC,KACA,MAAA6G,EAAA,GACAC,EAAA,GACAC,EAAA,GACA,IAAA,IAAAlH,EAAA,EAAAA,EAAAM,EAAAxC,OAAAkC,IAAA,CACA,MAAAmH,EAAA7G,EAAAN,GACA,WAAAmH,GACAt4E,EAAAu4E,mBAAA,uBAAA/E,EAAAlC,IAGAuB,EAAAyF,GAFAD,EAAAvD,KAAAwD,GASAvF,EAAAuF,GACAt4E,EAAAmzE,YAAAn0E,GACAg0E,EAAAh0E,EAAA+xE,SACAoH,EAAArD,KAAAwD,GAGAF,EAAAtD,KAAAwD,IAIAH,EAAArD,KAAAwD,GACAF,EAAAtD,KAAAwD,IAIAxF,EAAAwF,GACAF,EAAAtD,KAAAwD,GAGAH,EAAArD,KAAAwD,GAKA,MAAA,CACAH,aAAAA,EACAC,gBAAAA,EACAC,qBAAAA,IAuBAG,CAAAx5E,EAAAyyE,EAAA+B,EAAAyD,EAAA3F,KAsBA,GApBA8G,EAAAK,SAAA,WACAz5E,EAAAi0E,EAAAj0E,EAAA,kBAEAo5E,EAAAK,SAAA,YACAz5E,EAAAi0E,EAAAj0E,EAAA,cAEAo5E,EAAAnJ,SACAiJ,EAAAl4E,EAAAi0E,qBAAAT,EAAAU,OAAA3zE,GAAA,CACA23E,EACArG,KAAAC,UAAAsG,OAGAD,EAAAlJ,QAEAjvE,EAAAmzE,YAAAn0E,KAAAg0E,EAAAh0E,EAAA+xE,WACAmH,EAAAl4E,EAAAi0E,qBAAAT,EAAAU,OAAA1zE,GAAA,CACA03E,EACArG,KAAAC,UAAAqG,MAGAE,EAAApJ,OAAA,CACA,MAAAyJ,EAAAL,EAAAjE,IAAAv2E,EAAA86E,YAAArE,KAAA,IACAt1E,EAAAgB,EAAAmzE,YAAAn0E,GACAgB,EAAAqxE,uBAAA,GAAAryE,EAAA+xE,UAAA2H,KAAA,GACA14E,EAAAqzE,yBAAA,CAAA,IAAAr0E,EAAA,QAAA05E,OAEA,MAAA,CACA/H,MAAA,CAAA3wE,EAAAk3E,qBAAAl4E,EAAAk5E,QAgSAU,KA3RA,CAAA3B,EAAAhG,EAAAuC,KACA,MAAAjC,IAAAA,EAAAD,IAAAA,GAAA2F,EAIA,OAHA1F,GACAiC,EAAA/zE,QAAAsyE,EAAA,GAAAT,IAEA,CACAX,MAAA,GACAmH,YAAAtE,EAAAU,OAAAzzE,MAwSAjD,OAAAW,KAAA6B,GAAA5B,SAAA,SAAAC,GACA,YAAAA,IAAAf,EAAAe,GAAA2B,EAAA3B,OAEAf,EAAAu5E,uBAAAA,EACAv5E,EAAAs5E,kBAAAA,EACAt5E,EAAAoD,WAAAA,EACApD,EAAAqD,iBAAAA,EACArD,EAAA6C,iBAAAA,EACA7C,EAAAgD,gBAAAA,EACAhD,EAAA2C,cAAAA,EACA3C,EAAA+C,eAAAA,EACA/C,EAAA8C,aAAAA,EACA9C,EAAAkD,eAAAA,EACAlD,EAAAiD,oBAAAA,EACAjD,EAAAmD,OAAAA,EACAnD,EAAAgC,QAjCA,SAAAZ,EAAAC,EAAA,IACA,OAAAqB,EAAA64E,YAAAn6E,EAAAb,EAAA0B,OAAA,GAAA8uE,EAAA1vE,EAAA,CACAm6E,eAAA,CAIApC,KACAE,KACAj4E,EAAAm6E,gBAAA,IAEAC,oBAAAl7E,EAAA0B,OAAA,GAAAs3E,EAAAl4E,EAAAo6E,qBAAA,IACAC,eAAA1F,MAuBAh2E,EAAAy0E,uBAAAA,EACAz0E,EAAA27E,MArBA,SAAAv6E,EAAAC,EAAA,IACA,OAAAqB,EAAAk5E,UAAAx6E,EAAAb,EAAA0B,OAAA,GAAA8uE,EAAA1vE,KAqBArB,EAAA+wE,cAAAA,EACA/wE,EAAA0zE,eAAAA,kFCz9FA,aAGE3zE,EAAOC,QAAUC,EAAQ,4GCH3B,aAEAC,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAAG,EAAAN,EAAA,eACA47E,EAAA57E,EAAA,cACA67E,EAAA77E,EAAA,iBACA87E,EAAA97E,EAAA,iBAEA,SAAA+7E,EAAAC,GACA,MAAAA,EAEA,SAAAC,EAAAC,IAEA,SAAAzH,EAAA3yE,EAAAiyE,EAAAoI,EAAAC,GACA,MAAAF,GAAAC,GAAAE,GAAAv6E,IAAAs6E,GAAA,IAEAJ,EAAA,IAAAM,YAAAxJ,OAAAoJ,IAGA,OAFAF,EAAAl6E,KAAAA,EACAk6E,EAAAjI,IAAAA,EACAiI,EAEA,MAAAK,EAAA,CAEAE,EAAA,mBACAC,EAAA,gDACAC,EAAA,uBACAC,EAAA,kCACAC,EAAA,uBACAC,EAAA,yBACAC,EAAA,mCACAC,EAAA,6BACAC,EAAA,4BACAC,EAAA,yBACAC,GAAA,8BACAC,GAAA,8BACAC,GAAA,6CACAC,GAAA,gCACAC,GAAA,6BACAC,GAAA,2BACAC,GAAA,mCACAC,GAAA,yEACAC,GAAA,2GACAC,GAAA,wCACAC,GAAA,uCACAC,GAAA,6BACAC,GAAA,uBAEAC,GAAA,mBACAC,GAAA,8BACAC,GAAA,wCACAC,GAAA,wHAGAC,GAAA,wCACAC,GAAA,2CACAC,GAAA,yCACAC,GAAA,+BACAC,GAAA,gCACAC,GAAA,+DACAC,GAAA,gCACAC,GAAA,8BACAC,GAAA,gDACAC,GAAA,uKAGAC,GAAA,+BACAC,GAAA,sHAEAC,GAAA,4DACAC,GAAA,iCACAC,GAAA,8DACAC,GAAA,2FACAC,GAAA,wCACAC,GAAA,mDAEAC,GAAA,yEACAC,GAAA,6DACAC,GAAA,2FACAC,GAAA,qDAEA5K,GAAA,IAGA6K,EAAA78E,OAAA,IACA88E,EAAA98E,OAAA,IACA+8E,EAAA/8E,OAAA,IACAg9E,EAAAh9E,OAAA,IACAi9E,EAAAj9E,OAAA,IACAk9E,EAAAl9E,OAAA,IACAm9E,EAAAn9E,OAAA,IACAo9E,EAAAp9E,OAAA,IACAq9E,EAAAr9E,OAAA,IACAs9E,EAAAt9E,OAAA,IACAi0E,EAAAj0E,OAAA,IACAu9E,EAAAv9E,OAAA,IACAw9E,EAAAx9E,OAAA,IACAy9E,EAAAz9E,OAAA,IACA09E,EAAA19E,OAAA,IACA29E,EAAA39E,OAAA,IACA49E,EAAA59E,OAAA,IACA69E,EAAA79E,OAAA,IACA89E,EAAA99E,OAAA,IACAm3E,EAAAn3E,OAAA,IACA+9E,EAAA/9E,OAAA,IACAg+E,EAAAh+E,OAAA,IACAi+E,EAAAj+E,OAAA,IACAk+E,EAAAl+E,OAAA,IACAm+E,EAAAn+E,OAAA,IACAo+E,EAAAp+E,OAAA,IACAq+E,EAAAr+E,OAAA,IACAs+E,EAAAt+E,OAAA,IACAu+E,EAAAv+E,OAAA,IACAw+E,EAAAx+E,OAAA,IACAy+E,EAAAz+E,OAAA,IACA0+E,EAAA1+E,OAAA,IAIA2+E,EAAA,CACAh+E,CAAAk8E,GAAA,WACAl8E,CAAAm8E,GAAA,WACAn8E,CAAAo8E,GAAA,WACAp8E,CAAAq8E,GAAA,YACAr8E,CAAAs8E,GAAA,iBACAt8E,CAAAu8E,GAAA,YACAv8E,CAAAw8E,GAAA,cACAx8E,CAAAy8E,GAAA,cACAz8E,CAAA08E,GAAA,qBACA18E,CAAA28E,GAAA,kBACA38E,CAAAszE,GAAA,oBACAtzE,CAAA48E,GAAA,mBACA58E,CAAA68E,GAAA,0BACA78E,CAAA88E,GAAA,mBACA98E,CAAA+8E,GAAA,gBACA/8E,CAAAg9E,GAAA,iBACAh9E,CAAAi9E,GAAA,aACAj9E,CAAAk9E,GAAA,aACAl9E,CAAAm9E,GAAA,cACAn9E,CAAAw2E,GAAA,kBACAx2E,CAAAo9E,GAAA,aACAp9E,CAAAq9E,GAAA,aACAr9E,CAAAs9E,GAAA,WACAt9E,CAAAu9E,GAAA,aACAv9E,CAAAw9E,GAAA,eACAx9E,CAAAy9E,GAAA,mBACAz9E,CAAA09E,GAAA,cACA19E,CAAA29E,GAAA,aACA39E,CAAA49E,GAAA,cACA59E,CAAA69E,GAAA,UACA79E,CAAA89E,GAAA,QACA99E,CAAA+9E,GAAA,SAYA,MAAAE,EAAA,CACAC,OAAA,GACAC,MAAA,CAAAC,KAAA,EAAAC,OAAA,EAAAnQ,OAAA,GACAC,IAAA,CAAAiQ,KAAA,EAAAC,OAAA,EAAAnQ,OAAA,IAEA,SAAAoQ,EAAA5L,EAAAjC,EAAAwN,GACA,MAAA,CACAhO,KAAA,EACAyC,SAAAA,EACA6L,QAAA,GACAC,WAAA,GACAC,WAAA,GACA/J,OAAA,GACAgK,QAAA,GACAtgF,OAAA,EACAugF,MAAA,EACAxK,iBAAAt1E,EACA4xE,IAAAA,GAGA,SAAAmO,EAAAjM,EAAAhF,EAAAmC,EAAA4C,EAAAmM,EAAAC,EAAAL,EAAAM,GAAA,EAAAC,GAAA,EAAAvO,EAAAwN,GAaA,OAZAtL,IACAoM,GACApM,EAAAU,OAAAkJ,GACA5J,EAAAU,OAAAmJ,IAGA7J,EAAAU,OAAAoJ,GAEAgC,GACA9L,EAAAU,OAAA2J,IAGA,CACA/M,KAAA,GACAtC,IAAAA,EACAmC,MAAAA,EACA4C,SAAAA,EACAmM,UAAAA,EACAC,aAAAA,EACAL,WAAAA,EACAM,QAAAA,EACAC,gBAAAA,EACAvO,IAAAA,GAGA,SAAAwO,EAAAC,EAAAzO,EAAAwN,GACA,MAAA,CACAhO,KAAA,GACAQ,IAAAA,EACAyO,SAAAA,GAGA,SAAAC,EAAAC,EAAA3O,EAAAwN,GACA,MAAA,CACAhO,KAAA,GACAQ,IAAAA,EACA2O,WAAAA,GAGA,SAAA/I,EAAAl4E,EAAAtB,GACA,MAAA,CACAozE,KAAA,GACAQ,IAAAwN,EACA9/E,IAAAnB,EAAAe,SAAAI,GAAAqyE,EAAAryE,GAAA,GAAAA,EACAtB,MAAAA,GAGA,SAAA2zE,EAAAN,EAAA8E,EAAAvE,EAAAwN,EAAAoB,EAAA,GACA,MAAA,CACApP,KAAA,EACAQ,IAAAA,EACAP,QAAAA,EACA8E,SAAAA,EACAqK,UAAArK,EAAA,EAAAqK,GAYA,SAAA7M,EAAAE,EAAAjC,EAAAwN,GACA,MAAA,CACAhO,KAAA,EACAQ,IAAAA,EACAiC,SAAAA,GAGA,SAAAU,EAAAkM,EAAAC,EAAA,GAAA9O,EAAAwN,GACA,MAAA,CACAhO,KAAA,GACAQ,IAAAA,EACA6O,OAAAA,EACAE,UAAAD,GAGA,SAAAE,EAAAC,EAAAC,EAAAC,GAAA,EAAAC,GAAA,EAAApP,EAAAwN,GACA,MAAA,CACAhO,KAAA,GACAyP,OAAAA,EACAC,QAAAA,EACAC,QAAAA,EACAC,OAAAA,EACApP,IAAAA,GAGA,SAAAqP,GAAAlR,EAAAmR,EAAAC,EAAAJ,GAAA,GACA,MAAA,CACA3P,KAAA,GACArB,KAAAA,EACAmR,WAAAA,EACAC,UAAAA,EACAJ,QAAAA,EACAnP,IAAAwN,GAGA,SAAAgC,GAAAvR,EAAA7xE,EAAAqjF,GAAA,GACA,MAAA,CACAjQ,KAAA,GACAvB,MAAAA,EACA7xE,MAAAA,EACAqjF,QAAAA,EACAzP,IAAAwN,GAiDA,MAAA3L,GAAAjC,GAAA,IAAAA,EAAAJ,MAAAI,EAAA2E,SACArF,GAAA,CAAAhC,EAAAwS,IAAAxS,IAAAwS,GAAAxS,IAAA3wE,EAAAojF,UAAAD,GACA,SAAAE,GAAA1S,GACA,OAAAgC,GAAAhC,EAAA,YACAwO,EAEAxM,GAAAhC,EAAA,YACAyO,EAEAzM,GAAAhC,EAAA,aACA0O,EAEA1M,GAAAhC,EAAA,kBACA2O,OADA,EAIA,MAAAgE,GAAA,cACAC,GAAAvkF,IAAAskF,GAAA1R,KAAA5yE,GACAwkF,GAAA,uGACAC,GAAA3kF,IACA,IAAAA,EACA,OAAA,EACA,MAAA4kF,EAAAF,GAAA/R,KAAA3yE,EAAA6kF,QACA,QAAAD,KAEAA,EAAA,MAEA,SAAA9R,KAAA8R,EAAA,KAEAD,GAAAC,EAAA,GAAAC,WAEA,SAAAC,GAAAnQ,EAAAvC,EAAAE,GACA,MACAyS,EAAA,CACA3C,OAFAzN,EAAAyN,OAAAlP,OAAAd,EAAAE,GAGA+P,MAAA2C,GAAArQ,EAAA0N,MAAA1N,EAAAyN,OAAAhQ,GACAC,IAAAsC,EAAAtC,KAKA,OAHA,MAAAC,IACAyS,EAAA1S,IAAA2S,GAAArQ,EAAA0N,MAAA1N,EAAAyN,OAAAhQ,EAAAE,IAEAyS,EAEA,SAAAC,GAAAC,EAAA7C,EAAA8C,EAAA9C,EAAA9P,QACA,OAAA6S,GAAAjkF,EAAA0B,OAAA,GAAAqiF,GAAA7C,EAAA8C,GAIA,SAAAC,GAAAF,EAAA7C,EAAA8C,EAAA9C,EAAA9P,QACA,IAAA8S,EAAA,EACAC,GAAA,EACA,IAAA,IAAA7Q,EAAA,EAAAA,EAAA0Q,EAAA1Q,IACA,KAAA4N,EAAAkD,WAAA9Q,KACA4Q,IACAC,EAAA7Q,GASA,OANAyQ,EAAA7S,QAAA8S,EACAD,EAAA3C,MAAA8C,EACAH,EAAA1C,QACA,IAAA8C,EACAJ,EAAA1C,OAAA2C,EACAA,EAAAG,EACAJ,EAQA,SAAAM,GAAAjR,EAAAp0E,EAAAslF,GAAA,GACA,IAAA,IAAAhR,EAAA,EAAAA,EAAAF,EAAAN,MAAA1B,OAAAkC,IAAA,CACA,MAAAD,EAAAD,EAAAN,MAAAQ,GACA,GAAA,IAAAD,EAAAJ,OACAqR,GAAAjR,EAAAK,OACA1zE,EAAAe,SAAA/B,GAAAq0E,EAAAr0E,OAAAA,EAAAA,EAAA4yE,KAAAyB,EAAAr0E,OACA,OAAAq0E,GAIA,SAAA0G,GAAA3G,EAAAp0E,EAAAulF,GAAA,EAAAD,GAAA,GACA,IAAA,IAAAhR,EAAA,EAAAA,EAAAF,EAAAN,MAAA1B,OAAAkC,IAAA,CACA,MAAAD,EAAAD,EAAAN,MAAAQ,GACA,GAAA,IAAAD,EAAAJ,KAAA,CACA,GAAAsR,EACA,SACA,GAAAlR,EAAAr0E,OAAAA,IAAAq0E,EAAAxzE,OAAAykF,GACA,OAAAjR,OAGA,GAAA,SAAAA,EAAAr0E,OACAq0E,EAAAK,KAAA4Q,IACAE,GAAAnR,EAAAE,IAAAv0E,GACA,OAAAq0E,GAIA,SAAAmR,GAAAjR,EAAAv0E,GACA,SAAAu0E,IAAA+B,GAAA/B,IAAAA,EAAAL,UAAAl0E,GAUA,SAAAylF,GAAArR,GACA,OAAA,IAAAA,EAAAH,MAAA,IAAAG,EAAAH,KAEA,SAAAyR,GAAArR,GACA,OAAA,IAAAA,EAAAJ,MAAA,SAAAI,EAAAr0E,KAEA,SAAA2lF,GAAAvR,GACA,OAAA,IAAAA,EAAAH,MAAA,IAAAG,EAAA8D,QAEA,SAAA0N,GAAAxR,GACA,OAAA,IAAAA,EAAAH,MAAA,IAAAG,EAAA8D,QAEA,SAAA2N,GAAAzR,EAAA0R,EAAAnP,GACA,IAAAoP,EACA,MAAAjS,EAAA,KAAAM,EAAAH,KAAAG,EAAAN,MAAAM,EAAAoP,UAAA,GACA,GAAA,MAAA1P,GAAA9yE,EAAAe,SAAA+xE,GACAiS,EAAA5C,EAAA,CAAA2C,SAEA,GAAA,KAAAhS,EAAAG,KAAA,CAIA,MAAA+R,EAAAlS,EAAA0P,UAAA,GACAxiF,EAAAe,SAAAikF,IAAA,KAAAA,EAAA/R,KAIAH,EAAAwP,SAAAjC,EAEA0E,EAAA3O,EAAAT,EAAAU,OAAA+J,GAAA,CACA+B,EAAA,CAAA2C,IACAhS,IAIAA,EAAA0P,UAAAyC,QAAA9C,EAAA,CAAA2C,KAXAE,EAAA5C,WAAA6C,QAAAH,IAcAC,IAAAA,EAAAjS,QAEA,GAAA,KAAAA,EAAAG,KAAA,CACA,IAAAiS,GAAA,EAEA,GAAA,IAAAJ,EAAA3jF,IAAA8xE,KAAA,CACA,MAAAkS,EAAAL,EAAA3jF,IAAA+xE,QACAgS,EAAApS,EAAAsP,WAAArP,MAAAM,GAAA,IAAAA,EAAAlyE,IAAA8xE,MACAI,EAAAlyE,IAAA+xE,UAAAiS,IAEAD,GACApS,EAAAsP,WAAA6C,QAAAH,GAEAC,EAAAjS,OAIAiS,EAAA3O,EAAAT,EAAAU,OAAA+J,GAAA,CACA+B,EAAA,CAAA2C,IACAhS,IAGA,KAAAM,EAAAH,KACAG,EAAAN,MAAAiS,EAGA3R,EAAAoP,UAAA,GAAAuC,EAGA,SAAAK,GAAApmF,EAAAi0E,GACA,MAAA,IAAAA,KAAAj0E,EAAAqmF,QAAA,SAAA,OAGA,SAAAC,GAAAlS,EAAAmS,GACA,IAAAnS,GAAA,IAAAzzE,OAAAW,KAAAilF,GAAAnU,OACA,OAAA,EAEA,OAAAgC,EAAAH,MACA,KAAA,EACA,IAAA,IAAAK,EAAA,EAAAA,EAAAF,EAAAN,MAAA1B,OAAAkC,IAAA,CACA,MAAAD,EAAAD,EAAAN,MAAAQ,GACA,GAAA,IAAAD,EAAAJ,OACAqS,GAAAjS,EAAAE,IAAAgS,IAAAD,GAAAjS,EAAAK,IAAA6R,IACA,OAAA,EAGA,OAAAnS,EAAAsC,SAAA3C,MAAA6F,GAAA0M,GAAA1M,EAAA2M,KACA,KAAA,GACA,QAAAD,GAAAlS,EAAA8N,OAAAqE,IAGAnS,EAAAsC,SAAA3C,MAAA6F,GAAA0M,GAAA1M,EAAA2M,KACA,KAAA,EACA,OAAAnS,EAAAoS,SAAAzS,MAAA0S,GAAAH,GAAAG,EAAAF,KACA,KAAA,GACA,QAAAD,GAAAlS,EAAAsS,UAAAH,IAGAnS,EAAAsC,SAAA3C,MAAA6F,GAAA0M,GAAA1M,EAAA2M,KACA,KAAA,EACA,OAAAnS,EAAA4E,UACAuL,GAAAnQ,EAAAF,YACAqS,EAAAnS,EAAAF,SACA,KAAA,EACA,OAAAE,EAAAsC,SAAA3C,MAAA6F,GAAA54E,EAAA2lF,SAAA/M,IAAA0M,GAAA1M,EAAA2M,KACA,KAAA,EACA,KAAA,GACA,OAAAD,GAAAlS,EAAAF,QAAAqS,GACA,KAAA,EACA,KAAA,EAEA,QACA,OAAA,GAIA,MAAAK,GAAA,CACAC,uBAAA,CACAC,QAAA,qJAGAC,KAAA,qEAEAC,qBAAA,CACAF,QAAA3kF,GACA,2FAAAA,2CACAA,OACA4kF,KAAA,qDAEAE,qBAAA,CACAH,QAAA,gJAGAI,6BAAA,CACAJ,QAAA,sUAKAC,KAAA,oDAEAI,qBAAA,CACAL,QAAA,wEACAC,KAAA,0EAEAK,+BAAA,CACAN,QAAA,0RAKAC,KAAA,wDAEAM,mBAAA,CACAP,QAAA,0IAEAC,KAAA,wDAEAO,yBAAA,CACAR,QAAA,yHAGAS,yBAAA,CACAT,QAAA,+CACAC,KAAA,uEAEAS,gBAAA,CACAV,QAAA,gKAGAC,KAAA,sDAGA,SAAAU,GAAAtlF,EAAAw0E,GACA,MAAA+Q,EAAA/Q,EAAA70E,QACA60E,EAAA70E,QAAA6lF,aACAhR,EAAAgR,aACA9mF,EAAA6mF,GAAAA,EAAAvlF,GACA,MAAA,SAAAA,EACAtB,GAAA,EAGAA,EAGA,SAAA+mF,GAAAzlF,EAAAw0E,GACA,MAAAkR,EAAAJ,GAAA,OAAA9Q,GACA91E,EAAA4mF,GAAAtlF,EAAAw0E,GAGA,OAAA,IAAAkR,GAAA,IAAAhnF,GAAA,IAAAA,EAEA,SAAA66E,GAAAv5E,EAAAw0E,EAAAlC,KAAA8O,GAEA,OADAqE,GAAAzlF,EAAAw0E,GAoBA,MAAAmR,GAAA,2BACAC,GAAA,CACA5jF,GAAA,IACAE,GAAA,IACAI,IAAA,IACAujF,KAAA,IACA30E,KAAA,KAEA40E,GAAA,CACAC,WAAA,CAAA,KAAA,MACAC,aAAA,IAAA,EACAC,YAAA,IAAA,EACA3W,UAAAzwE,EAAAqnF,GACAvW,SAAA9wE,EAAAqnF,GACAzN,gBAAA55E,EAAAqnF,GACAtW,eAAAC,GAAAA,EAAAqU,QAAAyB,IAAA,CAAAQ,EAAAC,IAAAR,GAAAQ,KACA3lF,QAAA65E,EACA35E,OAAA65E,EACA6L,UAAA,GAEA,SAAAnM,GAAAnI,EAAApyE,EAAA,IACA,MAAA60E,EAIA,SAAAzC,EAAAuU,GACA,MAAA3mF,EAAAd,EAAA0B,OAAA,GAAAulF,IACA,IAAA,MAAA9lF,KAAAsmF,EAEA3mF,EAAAK,GAAAsmF,EAAAtmF,IAAA8lF,GAAA9lF,GAEA,MAAA,CACAL,QAAAA,EACAugF,OAAA,EACAD,KAAA,EACAlQ,OAAA,EACAwW,eAAAxU,EACAgO,OAAAhO,EACAyU,OAAA,EACAC,QAAA,EACA9lF,OAAAhB,EAAAgB,QAnBA+lF,CAAA3U,EAAApyE,GACAqgF,EAAA2G,GAAAnS,GACA,OAAA2L,EAAAyG,GAAApS,EAAA,EAAA,IAAAqS,GAAArS,EAAAwL,IAoBA,SAAA4G,GAAApS,EAAAkR,EAAAoB,GACA,MAAArV,EAAAsV,GAAAD,GACApV,EAAAD,EAAAA,EAAAC,GAAA,EACAsV,EAAA,GACA,MAAAC,GAAAzS,EAAAkR,EAAAoB,IAAA,CACA,MAAAI,EAAA1S,EAAAuL,OACA,IAAA9N,EACA,GAAA,IAAAyT,GAAA,IAAAA,EACA,IAAAlR,EAAAiS,QAAAU,GAAAD,EAAA1S,EAAA70E,QAAAomF,WAAA,IAEA9T,EAAAmV,GAAA5S,EAAAkR,QAEA,GAAA,IAAAA,GAAA,MAAAwB,EAAA,GAEA,GAAA,IAAAA,EAAAjX,OACAoX,GAAA7S,EAAA,EAAA,QAEA,GAAA,MAAA0S,EAAA,GAEAC,GAAAD,EAAA,WACAjV,EAAAqV,GAAA9S,GAEA2S,GAAAD,EAAA,aAEAjV,EAAAsV,GAAA/S,GAEA2S,GAAAD,EAAA,aACA,IAAAxV,EACAO,EAAAuV,GAAAhT,EAAAsS,IAGAO,GAAA7S,EAAA,GACAvC,EAAAsV,GAAA/S,KAIA6S,GAAA7S,EAAA,IACAvC,EAAAsV,GAAA/S,SAGA,GAAA,MAAA0S,EAAA,GAEA,GAAA,IAAAA,EAAAjX,OACAoX,GAAA7S,EAAA,EAAA,OAEA,CAAA,GAAA,MAAA0S,EAAA,GAAA,CACAG,GAAA7S,EAAA,GAAA,GACAiT,GAAAjT,EAAA,GACA,SAEA,GAAA,SAAA/D,KAAAyW,EAAA,IAAA,CACAG,GAAA7S,EAAA,IACAkT,GAAAlT,EAAA,EAAA/C,GACA,SAGA4V,GAAA7S,EAAA,GAAA,GACAvC,EAAAsV,GAAA/S,OAGA,SAAA/D,KAAAyW,EAAA,KACAjV,EAAA0V,GAAAnT,EAAAsS,GAEArB,GAAA,2BAAAjR,IACAvC,GACA,aAAAA,EAAAzC,MACAyC,EAAAN,MAAAC,MAAAM,GAAA,IAAAA,EAAAJ,MACA8V,GAAA1V,EAAAr0E,UACAo0E,EAAAA,EAAAsC,WAGA,MAAA2S,EAAA,IACAG,GAAA7S,EAAA,GAAA,GACAvC,EAAAsV,GAAA/S,IAGA6S,GAAA7S,EAAA,GAAA,GAOA,GAHAvC,IACAA,EAAA4V,GAAArT,EAAAkR,IAEA7mF,EAAAipF,QAAA7V,GACA,IAAA,IAAAE,EAAA,EAAAA,EAAAF,EAAAhC,OAAAkC,IACA4V,GAAAf,EAAA/U,EAAAE,SAIA4V,GAAAf,EAAA/U,GAIA,IAAA+V,GAAA,EACA,GAAA,IAAAtC,GAAA,IAAAA,EAAA,CACA,MAAAuC,EAAA,aAAAzT,EAAA70E,QAAAuoF,WACA,IAAA,IAAA/V,EAAA,EAAAA,EAAA6U,EAAA/W,OAAAkC,IAAA,CACA,MAAAF,EAAA+U,EAAA7U,GACA,IAAAqC,EAAAgS,OAAA,IAAAvU,EAAAH,KACA,GAAA,eAAArB,KAAAwB,EAAAF,SAuBAkW,IAGAhW,EAAAF,QAAAE,EAAAF,QAAAmS,QAAA,gBAAA,UA1BA,CACA,MAAAiE,EAAAnB,EAAA7U,EAAA,GACAiW,EAAApB,EAAA7U,EAAA,IAKAgW,IACAC,IACAH,IACA,IAAAE,EAAArW,MACA,IAAAsW,EAAAtW,MACA,IAAAqW,EAAArW,MACA,IAAAsW,EAAAtW,MACA,SAAArB,KAAAwB,EAAAF,WACAiW,GAAA,EACAhB,EAAA7U,GAAA,MAIAF,EAAAF,QAAA,IAUA,IAAAE,EAAAH,MACA0C,EAAA70E,QAAA0mF,WACA2B,GAAA,EACAhB,EAAA7U,GAAA,MAGA,GAAAqC,EAAAgS,OAAA/U,GAAA+C,EAAA70E,QAAAgwE,SAAA8B,EAAAjC,KAAA,CAGA,MAAAqU,EAAAmD,EAAA,GACAnD,GAAA,IAAAA,EAAA/R,OACA+R,EAAA9R,QAAA8R,EAAA9R,QAAAmS,QAAA,SAAA,MAIA,OAAA8D,EAAAhB,EAAAjO,OAAAsP,SAAArB,EAEA,SAAAe,GAAAf,EAAA/U,GACA,GAAA,IAAAA,EAAAH,KAAA,CACA,MAAAqW,EAAApB,GAAAC,GAGA,GAAAmB,GACA,IAAAA,EAAArW,MACAqW,EAAA7V,IAAAtC,IAAAD,SAAAkC,EAAAK,IAAA0N,MAAAjQ,OAIA,OAHAoY,EAAApW,SAAAE,EAAAF,QACAoW,EAAA7V,IAAAtC,IAAAiC,EAAAK,IAAAtC,SACAmY,EAAA7V,IAAAyN,QAAA9N,EAAAK,IAAAyN,QAIAiH,EAAAlR,KAAA7D,GAEA,SAAAuV,GAAAhT,EAAAsS,GACAW,GAAAjT,EAAA,GACA,MAAAwS,EAAAJ,GAAApS,EAAA,EAAAsS,GAOA,OANA,IAAAtS,EAAAuL,OAAA9P,OACAoX,GAAA7S,EAAA,GAGAiT,GAAAjT,EAAA,GAEAwS,EAEA,SAAAM,GAAA9S,GACA,MAAAwL,EAAA2G,GAAAnS,GACA,IAAAzC,EAEA,MAAAuW,EAAA,WAAAhY,KAAAkE,EAAAuL,QACA,GAAAuI,EAKA,CACAA,EAAA/X,OAAA,GACA8W,GAAA7S,EAAA,GAEA8T,EAAA,IACAjB,GAAA7S,EAAA,IAEAzC,EAAAyC,EAAAuL,OAAA3P,MAAA,EAAAkY,EAAA/X,OAEA,MAAA2W,EAAA1S,EAAAuL,OAAA3P,MAAA,EAAAkY,EAAA/X,OACA,IAAAgY,EAAA,EAAAC,EAAA,EACA,MAAA,KAAAA,EAAAtB,EAAA1Q,QAAA,UAAA+R,KACAd,GAAAjT,EAAAgU,EAAAD,EAAA,GACAC,EAAA,EAAAtB,EAAAjX,QACAoX,GAAA7S,EAAA,IAEA+T,EAAAC,EAAA,EAEAf,GAAAjT,EAAA8T,EAAA/X,MAAA+X,EAAA,GAAArY,OAAAsY,EAAA,QAtBAxW,EAAAyC,EAAAuL,OAAA3P,MAAA,GACAqX,GAAAjT,EAAAA,EAAAuL,OAAA9P,QACAoX,GAAA7S,EAAA,GAsBA,MAAA,CACA1C,KAAA,EACAC,QAAAA,EACAO,IAAAuU,GAAArS,EAAAwL,IAGA,SAAAuH,GAAA/S,GACA,MAAAwL,EAAA2G,GAAAnS,GACAiU,EAAA,MAAAjU,EAAAuL,OAAA,GAAA,EAAA,EACA,IAAAhO,EACA,MAAA2W,EAAAlU,EAAAuL,OAAAvJ,QAAA,KASA,OARA,IAAAkS,GACA3W,EAAAyC,EAAAuL,OAAA3P,MAAAqY,GACAhB,GAAAjT,EAAAA,EAAAuL,OAAA9P,UAGA8B,EAAAyC,EAAAuL,OAAA3P,MAAAqY,EAAAC,GACAjB,GAAAjT,EAAAkU,EAAA,IAEA,CACA5W,KAAA,EACAC,QAAAA,EACAO,IAAAuU,GAAArS,EAAAwL,IAGA,SAAA2H,GAAAnT,EAAAsS,GAEA,MAAA6B,EAAAnU,EAAAgS,MACAoC,EAAApU,EAAAiS,OACAhV,EAAAsV,GAAAD,GACA+B,EAAAnB,GAAAlT,EAAA,EAAA/C,GACAqX,EAAAtU,EAAAgS,QAAAmC,EACAI,EAAAvU,EAAAiS,SAAAmC,EACA,GAAAC,EAAAG,eAAAxU,EAAA70E,QAAA2vE,UAAAuZ,EAAArZ,KACA,OAAAqZ,EAGA/B,EAAAhR,KAAA+S,GACA,MAAAnD,EAAAlR,EAAA70E,QAAAsmF,YAAA4C,EAAApX,GACA8C,EAAAqS,GAAApS,EAAAkR,EAAAoB,GACAA,EAAAmC,MAEA,CACA,MAAAC,EAAAL,EAAAlX,MAAAwX,MAAAjX,GAAA,IAAAA,EAAAJ,MAAA,oBAAAI,EAAAr0E,OACA,GAAAqrF,GACA3P,GAAA,2BAAA/E,EAAA0U,EAAA5W,KAAA,CACA,MAAAA,EAAAuU,GAAArS,EAAAqU,EAAAvW,IAAAtC,KACAkZ,EAAAxqF,MAAA,CACAozE,KAAA,EACAC,QAAAO,EAAAyN,OACAzN,IAAAA,IAMA,GAFAuW,EAAAtU,SAAAA,EAEA6U,GAAA5U,EAAAuL,OAAA8I,EAAArZ,KACAkY,GAAAlT,EAAA,EAAA/C,QAIA,GADA4V,GAAA7S,EAAA,GAAA,EAAAqU,EAAAvW,IAAA0N,OACA,IAAAxL,EAAAuL,OAAA9P,QAAA,WAAA4Y,EAAArZ,IAAA4E,cAAA,CACA,MAAAyP,EAAAtP,EAAA,GACAsP,GAAAsD,GAAAtD,EAAAvR,IAAAyN,OAAA,YACAsH,GAAA7S,EAAA,GAWA,OAPAqU,EAAAvW,IAAAuU,GAAArS,EAAAqU,EAAAvW,IAAA0N,OACA8I,IACAtU,EAAAgS,OAAA,GAEAuC,IACAvU,EAAAiS,QAAA,GAEAoC,EAEA,MAAAjB,GAAA/oF,EAAAuwE,QAAA,4BACA,SAAAsY,GAAAlT,EAAA1C,EAAAL,GAEA,MAAAuO,EAAA2G,GAAAnS,GACA8T,EAAA,+BAAAhY,KAAAkE,EAAAuL,QACAvQ,EAAA8Y,EAAA,GACA5W,EAAA8C,EAAA70E,QAAAqmF,aAAAxW,EAAAiC,GACAgW,GAAAjT,EAAA8T,EAAA,GAAArY,QACAoZ,GAAA7U,GAEA,MAAA8U,EAAA3C,GAAAnS,GACA+U,EAAA/U,EAAAuL,OAEA,IAAApO,EAAA6X,GAAAhV,EAAA1C,GAEA0C,EAAA70E,QAAAgwE,SAAAH,KACAgF,EAAAgS,OAAA,GAGA,IAAA1U,IACA0C,EAAAiS,QACA9U,EAAAC,MAAAM,GAAA,IAAAA,EAAAJ,MAAA,QAAAI,EAAAr0E,SACA22E,EAAAiS,QAAA,EAEA5nF,EAAA0B,OAAAi0E,EAAA8U,GACA9U,EAAAuL,OAAAwJ,EAEA5X,EAAA6X,GAAAhV,EAAA1C,GAAAiH,QAAA7G,GAAA,UAAAA,EAAAr0E,QAGA,IAAAmrF,GAAA,EAWA,GAVA,IAAAxU,EAAAuL,OAAA9P,OACAoX,GAAA7S,EAAA,IAGAwU,EAAA7B,GAAA3S,EAAAuL,OAAA,MACA,IAAAjO,GAAAkX,GACA3B,GAAA7S,EAAA,GAEAiT,GAAAjT,EAAAwU,EAAA,EAAA,IAEA,IAAAlX,EACA,OAEA,IAAAiE,EAAA,EACA,MAAAp2E,EAAA60E,EAAA70E,QACA,IAAA60E,EAAAiS,SAAA9mF,EAAA84E,gBAAAjJ,GAAA,CACA,MAAAia,EAAA9X,EAAAC,MAAAM,IACA,GAAA,OAAAA,EAAAr0E,KAGA,OAAA,IAAAq0E,EAAAJ,UAIAI,EAAAxzE,QAAAwzE,EAAAxzE,MAAAqzE,QAAAoV,WAAA,aAIA5N,GAAA,yBAAA/E,EAAAtC,EAAAI,WAAA,OAIA3yE,EAAA4vE,cAAAka,EACA9pF,EAAA4vE,YAAAC,KACAuG,EAAA,IAEA0T,GACAvH,GAAA1S,IACA7vE,EAAA4xE,oBAAA5xE,EAAA4xE,mBAAA/B,IACA,SAAAiB,KAAAjB,IACA,cAAAA,KACAuG,EAAA,GAEA,SAAAvG,EACAuG,EAAA,EAEA,aAAAvG,GACAmC,EAAAC,MAAAM,GAAA,IAAAA,EAAAJ,MAAA8V,GAAA1V,EAAAr0E,UACAk4E,EAAA,GAGA,MAAA,CACAjE,KAAA,EACAJ,GAAAA,EACAlC,IAAAA,EACAuG,QAAAA,EACApE,MAAAA,EACAqX,cAAAA,EACAzU,SAAA,GACAjC,IAAAuU,GAAArS,EAAAwL,GACAhK,iBAAAt1E,GAGA,SAAA8oF,GAAAhV,EAAA1C,GACA,MAAAH,EAAA,GACA+X,EAAA,IAAAC,IACA,KAAAnV,EAAAuL,OAAA9P,OAAA,IACAkX,GAAA3S,EAAAuL,OAAA,OACAoH,GAAA3S,EAAAuL,OAAA,OAAA,CACA,GAAAoH,GAAA3S,EAAAuL,OAAA,KAAA,CACAsH,GAAA7S,EAAA,IACAiT,GAAAjT,EAAA,GACA6U,GAAA7U,GACA,SAEA,IAAA1C,GACAuV,GAAA7S,EAAA,GAEA,MAAAoV,EAAAC,GAAArV,EAAAkV,GACA,IAAA5X,GACAH,EAAAmE,KAAA8T,GAEA,kBAAAnZ,KAAA+D,EAAAuL,SACAsH,GAAA7S,EAAA,IAEA6U,GAAA7U,GAEA,OAAA7C,EAEA,SAAAkY,GAAArV,EAAAsV,GAEA,MAAA9J,EAAA2G,GAAAnS,GAEA32E,EADA,kCAAAyyE,KAAAkE,EAAAuL,QACA,GACA+J,EAAAC,IAAAlsF,IACAwpF,GAAA7S,EAAA,GAEAsV,EAAAE,IAAAnsF,GACA,MAAAA,EAAA,IACAwpF,GAAA7S,EAAA,IAEA,CACA,MAAAyV,EAAA,SACA,IAAAC,EACA,KAAAA,EAAAD,EAAA3Z,KAAAzyE,IACAwpF,GAAA7S,EAAA,GAAA0V,EAAA3Z,OAKA,IAAA7xE,EAFA+oF,GAAAjT,EAAA32E,EAAAoyE,QAGA,iBAAAQ,KAAA+D,EAAAuL,UACAsJ,GAAA7U,GACAiT,GAAAjT,EAAA,GACA6U,GAAA7U,GACA91E,EAoFA,SAAA81E,GACA,MAAAwL,EAAA2G,GAAAnS,GACA,IAAAzC,EACA,MAAAoY,EAAA3V,EAAAuL,OAAA,GACAqK,EAAA,MAAAD,GAAA,MAAAA,EACA,GAAAC,EAAA,CAEA3C,GAAAjT,EAAA,GACA,MAAA6V,EAAA7V,EAAAuL,OAAAvJ,QAAA2T,IACA,IAAAE,EACAtY,EAAAuY,GAAA9V,EAAAA,EAAAuL,OAAA9P,OAAA,IAGA8B,EAAAuY,GAAA9V,EAAA6V,EAAA,GACA5C,GAAAjT,EAAA,QAGA,CAEA,MAAA8T,EAAA,kBAAAhY,KAAAkE,EAAAuL,QACA,IAAAuI,EACA,OAEA,MAAAiC,EAAA,WACA,IAAAL,EACA,KAAAA,EAAAK,EAAAja,KAAAgY,EAAA,KACAjB,GAAA7S,EAAA,GAAA0V,EAAA3Z,OAEAwB,EAAAuY,GAAA9V,EAAA8T,EAAA,GAAArY,OAAA,GAEA,MAAA,CAAA8B,QAAAA,EAAAqY,SAAAA,EAAA9X,IAAAuU,GAAArS,EAAAwL,IAlHAwK,CAAAhW,GACA91E,GACA2oF,GAAA7S,EAAA,KAGA,MAAAlC,EAAAuU,GAAArS,EAAAwL,GACA,IAAAxL,EAAAiS,QAAA,cAAAhW,KAAA5yE,GAAA,CACA,MAAAyqF,EAAA,iEAAAhY,KAAAzyE,GACA,IAEAu0E,EAFAqY,EAAAnC,EAAA,KACAnB,GAAAtpF,EAAA,KAAA,OAAAspF,GAAAtpF,EAAA,KAAA,KAAA,QAEA,GAAAyqF,EAAA,GAAA,CACA,MAAA5G,EAAA,SAAA+I,EACAC,EAAA7sF,EAAA8sF,YAAArC,EAAA,IACAhW,EAAAuU,GAAArS,EAAAoW,GAAApW,EAAAwL,EAAA0K,GAAAE,GAAApW,EAAAwL,EAAA0K,EAAApC,EAAA,GAAArY,QAAAyR,GAAA4G,EAAA,IAAA,IAAArY,SACA,IAAA8B,EAAAuW,EAAA,GACAzR,GAAA,EACA9E,EAAAoV,WAAA,MACAtQ,GAAA,EACA9E,EAAAhB,SAAA,MACAsW,GAAA7S,EAAA,IAEAzC,EAAAA,EAAAlB,OAAA,EAAAkB,EAAA9B,OAAA,IAEAyR,IAIA3P,GAAAuW,EAAA,IAAA,IAEAlW,EAAA,CACAN,KAAA,EACAC,QAAAA,EACA8E,SAAAA,EACAqK,UAAArK,EACA,EACA,EACAvE,IAAAA,GAGA,GAAA5zE,GAAAA,EAAA0rF,SAAA,CACA,MAAAS,EAAAnsF,EAAA4zE,IACAuY,EAAA7K,MAAAjQ,SACA8a,EAAA7K,MAAAE,SACA2K,EAAA7a,IAAA2S,GAAAkI,EAAA7K,MAAAthF,EAAAqzE,SACA8Y,EAAA9K,OAAA8K,EAAA9K,OAAA3P,MAAA,GAAA,GAEA,MAAAqC,EAAA6V,EAAA,GAAAA,EAAA,GAAAzX,OAAA,GAAAia,MAAA,KAAA,GASA,MAPA,SAAAL,GAAArY,GACAK,EAAAgH,SAAA,SACAF,GAAA,uBAAA/E,EAAAlC,EAAAF,EAAAE,IAAAyN,UACA0K,EAAA,QACAhY,EAAAgD,OAAAhD,EAAA+D,QAAA,QAAA,IAGA,CACA1E,KAAA,EACAj0E,KAAA4sF,EACAlY,IAAA7zE,GAAA,CACAozE,KAAA,EACAC,QAAArzE,EAAAqzE,QACA8E,UAAA,EAGAqK,UAAA,EACA5O,IAAA5zE,EAAA4zE,KAEAF,IAAAA,EACAK,UAAAA,EACAH,IAAAA,GAGA,MAAA,CACAR,KAAA,EACAj0E,KAAAA,EACAa,MAAAA,GAAA,CACAozE,KAAA,EACAC,QAAArzE,EAAAqzE,QACAO,IAAA5zE,EAAA4zE,KAEAA,IAAAA,GAmCA,SAAA8U,GAAA5S,EAAAkR,GACA,MAAAqF,EAAAC,GAAAxW,EAAA70E,QAAAomF,WACA2C,EAAAlU,EAAAuL,OAAAvJ,QAAAwU,EAAAD,EAAA9a,QACA,IAAA,IAAAyY,EAEA,YADArB,GAAA7S,EAAA,IAGA,MAAAwL,EAAA2G,GAAAnS,GACAiT,GAAAjT,EAAAuW,EAAA9a,QACA,MAAAgb,EAAAtE,GAAAnS,GACA0W,EAAAvE,GAAAnS,GACA2W,EAAAzC,EAAAqC,EAAA9a,OACAmb,EAAA5W,EAAAuL,OAAA3P,MAAA,EAAA+a,GACAE,EAAAf,GAAA9V,EAAA2W,EAAAzF,GACA3T,EAAAsZ,EAAA7I,OACAkI,EAAAW,EAAA7U,QAAAzE,GACA2Y,EAAA,GACA5H,GAAAmI,EAAAG,EAAAV,GAKA,OAFA5H,GAAAoI,EAAAE,EADAD,GAAAE,EAAApb,OAAA8B,EAAA9B,OAAAya,IAEAjD,GAAAjT,EAAAwW,EAAA/a,QACA,CACA6B,KAAA,EACAC,QAAA,CACAD,KAAA,EACA+E,UAAA,EAEAqK,UAAA,EACAnP,QAAAA,EACAO,IAAAuU,GAAArS,EAAAyW,EAAAC,IAEA5Y,IAAAuU,GAAArS,EAAAwL,IAGA,SAAA6H,GAAArT,EAAAkR,GACA,MAAA4F,EAAA,CAAA,IAAA9W,EAAA70E,QAAAomF,WAAA,IACA,IAAAL,GACA4F,EAAAxV,KAAA,OAEA,IAAAuU,EAAA7V,EAAAuL,OAAA9P,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAAmZ,EAAArb,OAAAkC,IAAA,CACA,MAAA5B,EAAAiE,EAAAuL,OAAAvJ,QAAA8U,EAAAnZ,GAAA,IACA,IAAA5B,GAAA8Z,EAAA9Z,IACA8Z,EAAA9Z,GAGA,MAAAyP,EAAA2G,GAAAnS,GAEA,MAAA,CACA1C,KAAA,EACAC,QAHAuY,GAAA9V,EAAA6V,EAAA3E,GAIApT,IAAAuU,GAAArS,EAAAwL,IAOA,SAAAsK,GAAA9V,EAAAvE,EAAAyV,GACA,MAAA7V,EAAA2E,EAAAuL,OAAA3P,MAAA,EAAAH,GAEA,OADAwX,GAAAjT,EAAAvE,GACA,IAAAyV,GACA,IAAAA,IACA,IAAA7V,EAAA2G,QAAA,KACA3G,EAIA2E,EAAA70E,QAAAiwE,eAAAC,EAAA,IAAA6V,GAGA,SAAAiB,GAAAnS,GACA,MAAA0L,OAAAA,EAAAD,KAAAA,EAAAlQ,OAAAA,GAAAyE,EACA,MAAA,CAAA0L,OAAAA,EAAAD,KAAAA,EAAAlQ,OAAAA,GAEA,SAAA8W,GAAArS,EAAAwL,EAAAhQ,GAEA,MAAA,CACAgQ,MAAAA,EACAhQ,IAHAA,EAAAA,GAAA2W,GAAAnS,GAIAuL,OAAAvL,EAAA+R,eAAAnW,MAAA4P,EAAAjQ,OAAAC,EAAAD,SAGA,SAAAgX,GAAAwE,GACA,OAAAA,EAAAA,EAAAtb,OAAA,GAEA,SAAAkX,GAAApH,EAAAyL,GACA,OAAAzL,EAAAoH,WAAAqE,GAEA,SAAA/D,GAAAjT,EAAAqO,GACA,MAAA9C,OAAAA,GAAAvL,EACAsO,GAAAtO,EAAAuL,EAAA8C,GACArO,EAAAuL,OAAAA,EAAA3P,MAAAyS,GAEA,SAAAwG,GAAA7U,GACA,MAAA8T,EAAA,gBAAAhY,KAAAkE,EAAAuL,QACAuI,GACAb,GAAAjT,EAAA8T,EAAA,GAAArY,QAGA,SAAA2a,GAAApW,EAAAwL,EAAA6C,GACA,OAAAF,GAAA3C,EAAAxL,EAAA+R,eAAAnW,MAAA4P,EAAAjQ,OAAA8S,GAAAA,GAEA,SAAAwE,GAAA7S,EAAAn0E,EAAA0vE,EAAAuC,EAAAqU,GAAAnS,IACAzE,IACAuC,EAAAvC,QAAAA,EACAuC,EAAA4N,QAAAnQ,GAEAyE,EAAA70E,QAAAc,QAAAuyE,EAAA3yE,EAAA,CACA2/E,MAAA1N,EACAtC,IAAAsC,EACAyN,OAAA,MAGA,SAAAkH,GAAAzS,EAAAkR,EAAAoB,GACA,MAAAI,EAAA1S,EAAAuL,OACA,OAAA2F,GACA,KAAA,EACA,GAAAyB,GAAAD,EAAA,MAEA,IAAA,IAAA/U,EAAA2U,EAAA7W,OAAA,EAAAkC,GAAA,IAAAA,EACA,GAAAiX,GAAAlC,EAAAJ,EAAA3U,GAAA3C,KACA,OAAA,EAIA,MACA,KAAA,EACA,KAAA,EAAA,CACA,MAAAiC,EAAAsV,GAAAD,GACA,GAAArV,GAAA2X,GAAAlC,EAAAzV,EAAAjC,KACA,OAAA,EAEA,MAEA,KAAA,EACA,GAAA2X,GAAAD,EAAA,OACA,OAAA,EAIA,OAAAA,EAEA,SAAAkC,GAAArJ,EAAAvQ,GACA,OAAA2X,GAAApH,EAAA,OACAA,EAAAlP,OAAA,EAAArB,EAAAS,QAAAmE,gBAAA5E,EAAA4E,eACA,gBAAA3D,KAAAsP,EAAA,EAAAvQ,EAAAS,SAAA,KAGA,SAAAzvE,GAAAirF,EAAAjX,GACAoC,GAAA6U,EAAAjX,EAGAkX,GAAAD,EAAAA,EAAAlX,SAAA,KAEA,SAAAmX,GAAAD,EAAA/V,GACA,MAAAnB,SAAAA,GAAAkX,EACA,OAAA,IAAAlX,EAAAtE,QACA,IAAAyF,EAAA5D,OACA2R,GAAA/N,GAEA,SAAAkB,GAAA3E,EAAAuC,EAAAmX,GAAA,GACA,IAAAC,GAAA,EASAC,GAAA,EACA,MAAAtX,SAAAA,GAAAtC,EACA,IAAA,IAAAE,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAnB,EAAApC,GAEA,GAAA,IAAAuD,EAAA5D,MACA,IAAA4D,EAAAK,QAAA,CACA,MAAA+V,EAAAH,EACA,EACAI,GAAArW,EAAAlB,GACA,GAAAsX,EAAA,GAIA,GAHAA,EAAA,IACAD,GAAA,GAEAC,GAAA,EAAA,CACApW,EAAAM,YAAA0K,UACA,KACAhL,EAAAM,YAAAxB,EAAAwX,MAAAtW,EAAAM,aACA4V,GAAA,EACA,cAGA,CAGA,MAAA5V,EAAAN,EAAAM,YACA,GAAA,KAAAA,EAAAlE,KAAA,CACA,MAAAma,EAAAC,GAAAlW,GACA,KAAAiW,GACA,MAAAA,GACA,IAAAA,IACAE,GAAAzW,EAAAlB,IACA,EAAA,CACA,MAAA7C,EAAAya,GAAA1W,GACA/D,IACAqE,EAAArE,MAAA6C,EAAAwX,MAAAra,YAMA,GAAA,KAAA+D,EAAA5D,KAAA,CACA,MAAAua,EAAAN,GAAArW,EAAA3D,QAAAyC,GACA6X,EAAA,IACAA,EAAA,IACAR,GAAA,GAEAQ,GAAA,IACA3W,EAAAM,YAAAxB,EAAAwX,MAAAtW,EAAAM,aACA4V,GAAA,IAKA,GAAA,IAAAlW,EAAA5D,KAAA,CACA,MAAAwa,EAAA,IAAA5W,EAAAK,QACAuW,GACA9X,EAAAC,OAAAC,QAEAkC,GAAAlB,EAAAlB,GACA8X,GACA9X,EAAAC,OAAAC,aAGA,GAAA,KAAAgB,EAAA5D,KAEA8E,GAAAlB,EAAAlB,EAAA,IAAAkB,EAAAnB,SAAAtE,aAEA,GAAA,IAAAyF,EAAA5D,KACA,IAAA,IAAAK,EAAA,EAAAA,EAAAuD,EAAA2O,SAAApU,OAAAkC,IAEAyE,GAAAlB,EAAA2O,SAAAlS,GAAAqC,EAAA,IAAAkB,EAAA2O,SAAAlS,GAAAoC,SAAAtE,QAIA4b,GAAAD,GAAApX,EAAAwF,gBACAxF,EAAAwF,eAAAzF,EAAAC,EAAAvC,GAGA,SAAA8Z,GAAA9Z,EAAAuC,GACA,MAAA+X,cAAAA,GAAA/X,EACA,OAAAvC,EAAAH,MACA,KAAA,EACA,GAAA,IAAAG,EAAA8D,QACA,OAAA,EAEA,MAAA91E,EAAAssF,EAAAC,IAAAva,GACA,QAAAvxE,IAAAT,EACA,OAAAA,EAEA,MAAA+1E,EAAA/D,EAAA+D,YACA,GAAA,KAAAA,EAAAlE,KACA,OAAA,EAGA,GADAoa,GAAAlW,GA4DA,OADAuW,EAAAE,IAAAxa,EAAA,GACA,EA3DA,CACA,IAAAya,EAAA,EAMA,MAAAC,EAAAR,GAAAla,EAAAuC,GACA,GAAA,IAAAmY,EAEA,OADAJ,EAAAE,IAAAxa,EAAA,GACA,EAEA0a,EAAAD,IACAA,EAAAC,GAGA,IAAA,IAAAxa,EAAA,EAAAA,EAAAF,EAAAsC,SAAAtE,OAAAkC,IAAA,CACA,MAAAya,EAAAb,GAAA9Z,EAAAsC,SAAApC,GAAAqC,GACA,GAAA,IAAAoY,EAEA,OADAL,EAAAE,IAAAxa,EAAA,GACA,EAEA2a,EAAAF,IACAA,EAAAE,GAOA,GAAAF,EAAA,EACA,IAAA,IAAAva,EAAA,EAAAA,EAAAF,EAAAN,MAAA1B,OAAAkC,IAAA,CACA,MAAAD,EAAAD,EAAAN,MAAAQ,GACA,GAAA,IAAAD,EAAAJ,MAAA,SAAAI,EAAAr0E,MAAAq0E,EAAAK,IAAA,CACA,MAAAsa,EAAAd,GAAA7Z,EAAAK,IAAAiC,GACA,GAAA,IAAAqY,EAEA,OADAN,EAAAE,IAAAxa,EAAA,GACA,EAEA4a,EAAAH,IACAA,EAAAG,IAeA,OAPA7W,EAAA4K,UACApM,EAAAsY,aAAA1O,GACA5J,EAAAsY,aAAAzO,GACArI,EAAA4K,SAAA,EACApM,EAAAU,OAAAoJ,IAEAiO,EAAAE,IAAAxa,EAAAya,GACAA,EAMA,KAAA,EACA,KAAA,EACA,OAAA,EACA,KAAA,EACA,KAAA,GACA,KAAA,GACA,OAAA,EACA,KAAA,EACA,KAAA,GACA,OAAAX,GAAA9Z,EAAAF,QAAAyC,GACA,KAAA,EACA,OAAAvC,EAAAiP,UACA,KAAA,EACA,IAAAwL,EAAA,EACA,IAAA,IAAAva,EAAA,EAAAA,EAAAF,EAAAsC,SAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAzD,EAAAsC,SAAApC,GACA,GAAAtzE,EAAAe,SAAA81E,IAAA72E,EAAAi4E,SAAApB,GACA,SAEA,MAAAkX,EAAAb,GAAArW,EAAAlB,GACA,GAAA,IAAAoY,EACA,OAAA,EAEAA,EAAAF,IACAA,EAAAE,GAGA,OAAAF,EACA,QACA,OAAA,GAGA,SAAAP,GAAAla,EAAAuC,GACA,IAAAkY,EAAA,EACA,MAAA/a,EAAAya,GAAAna,GACA,GAAAN,GAAA,KAAAA,EAAAG,KAAA,CACA,MAAAmP,WAAAA,GAAAtP,EACA,IAAA,IAAAQ,EAAA,EAAAA,EAAA8O,EAAAhR,OAAAkC,IAAA,CACA,MAAAnyE,IAAAA,EAAAtB,MAAAA,GAAAuiF,EAAA9O,GACA4a,EAAAhB,GAAA/rF,EAAAw0E,GACA,GAAA,IAAAuY,EACA,OAAAA,EAKA,GAHAA,EAAAL,IACAA,EAAAK,GAEA,IAAAruF,EAAAozE,KACA,OAAA,EAEA,MAAAkb,EAAAjB,GAAArtF,EAAA81E,GACA,GAAA,IAAAwY,EACA,OAAAA,EAEAA,EAAAN,IACAA,EAAAM,IAIA,OAAAN,EAEA,SAAAN,GAAAna,GACA,MAAA+D,EAAA/D,EAAA+D,YACA,GAAA,KAAAA,EAAAlE,KACA,OAAAkE,EAAArE,MAGA,SAAAua,GAAAja,GACA,MAAAga,EAAAha,EAAAyO,UACA,OAAAuL,EAAA7a,SAAA6a,EAAA,SAAAvrF,EAGA,SAAAusF,GAAAxB,GAAAyB,SAAAA,EAAA,GAAAC,kBAAAA,GAAA,EAAA3sF,YAAAA,GAAA,EAAA4sF,cAAAA,GAAA,EAAAtT,eAAAA,EAAA,GAAAC,oBAAAA,EAAA,GAAAC,eAAAA,EAAA,KAAAzI,mBAAAA,EAAA1yE,EAAAiB,KAAA24E,gBAAAA,EAAA55E,EAAAiB,KAAAutF,kBAAAA,EAAA,GAAA/V,QAAAA,EAAA,KAAAgW,QAAAA,GAAA,EAAAC,IAAAA,GAAA,EAAAC,WAAAA,EAAA,GAAAC,gBAAAA,EAAA5uF,EAAA6uF,UAAAC,OAAAA,GAAA,EAAAC,KAAAA,GAAA,EAAAntF,QAAAA,EAAA65E,EAAA35E,OAAAA,EAAA65E,EAAAgL,aAAAA,IACA,MAAAqI,EAAAX,EAAAhJ,QAAA,QAAA,IAAAoE,MAAA,mBACA9T,EAAA,CAEAsZ,SAAAD,GAAAhvF,EAAA86E,WAAA96E,EAAAkvF,SAAAF,EAAA,KACAV,kBAAAA,EACA3sF,YAAAA,EACA4sF,cAAAA,EACAtT,eAAAA,EACAC,oBAAAA,EACAC,eAAAA,EACAzI,mBAAAA,EACAkH,gBAAAA,EACA4U,kBAAAA,EACA/V,QAAAA,EACAgW,QAAAA,EACAC,IAAAA,EACAC,WAAAA,EACAC,gBAAAA,EACAE,OAAAA,EACAC,KAAAA,EACAntF,QAAAA,EACAE,OAAAA,EACA6kF,aAAAA,EAEAiG,KAAAA,EACArL,QAAA,IAAA4N,IACA3N,WAAA,IAAAsJ,IACArJ,WAAA,IAAAqJ,IACApT,OAAA,GACAgK,QAAA,GACAgM,cAAA,IAAAyB,IACAxN,MAAA,EACAvgF,OAAA,EACAguF,YAAAzvF,OAAAU,OAAA,MACAu1E,OAAA,CACAyZ,KAAA,EACAxZ,MAAA,EACAyZ,KAAA,EACAC,MAAA,GAEA3c,OAAA,KACA4c,YAAA5C,EACA6C,WAAA,EAEAzsF,OAAAhE,GACA,MAAA0wF,EAAA/Z,EAAA4L,QAAAoM,IAAA3uF,IAAA,EAEA,OADA22E,EAAA4L,QAAAqM,IAAA5uF,EAAA0wF,EAAA,GACA1wF,GAEAgE,aAAAhE,GACA,MAAA0wF,EAAA/Z,EAAA4L,QAAAoM,IAAA3uF,GACA,GAAA0wF,EAAA,CACA,MAAAC,EAAAD,EAAA,EACAC,EAIAha,EAAA4L,QAAAqM,IAAA5uF,EAAA2wF,GAHAha,EAAA4L,QAAAqO,OAAA5wF,KAOAu6E,aAAAv6E,GACA,IAAAgiF,EAAArL,EAAAU,OAAAr3E,MAEAgE,YAAAowE,GACAuC,EAAA/C,OAAA8C,SAAAC,EAAA8Z,YAAA9Z,EAAA6Z,YAAApc,GAEApwE,WAAAowE,GACA,MAAAyc,EAAAla,EAAA/C,OAAA8C,SACAoa,EAAA1c,EACAyc,EAAAlY,QAAAvE,GACAuC,EAAA6Z,YACA7Z,EAAA8Z,YACA,EACArc,GAAAA,IAAAuC,EAAA6Z,YAOA7Z,EAAA8Z,WAAAK,IACAna,EAAA8Z,aACA9Z,EAAAoa,kBAPApa,EAAA6Z,YAAA,KACA7Z,EAAAoa,iBASApa,EAAA/C,OAAA8C,SAAAkB,OAAAkZ,EAAA,IAEAC,cAAA,OACA/sF,eAAA0wE,GAGA1zE,EAAAe,SAAA2yE,GACAsc,EAAAtc,GAEAA,EAAA0b,YACA1b,EAAA0b,YAAA7uF,QAAAyvF,GAEA,IAAAtc,EAAAT,MACA+c,EAAAtc,EAAAR,UAIAlwE,kBAAA0wE,GAEA1zE,EAAAe,SAAA2yE,GACAuc,EAAAvc,GAEAA,EAAA0b,YACA1b,EAAA0b,YAAA7uF,QAAA0vF,GAEA,IAAAvc,EAAAT,MACAgd,EAAAvc,EAAAR,UAIAlwE,MAAA0wE,GACAiC,EAAA+B,OAAAT,KAAAvD,GACA,MAAAwc,EAAA1c,EAAA,YAAAmC,EAAA+B,OAAAtG,UAAA,EAAAsC,EAAAD,IAAA,GAEA,OADAyc,EAAA9Y,QAAA1D,EACAwc,GAEAC,MAAA,CAAAzc,EAAAwP,GAAA,IACAD,KAAAtN,EAAAv0E,OAAAsyE,EAAAwP,IAMA,SAAA8M,EAAAI,GACA,MAAAhB,YAAAA,GAAAzZ,OACA9zE,IAAAutF,EAAAgB,KACAhB,EAAAgB,GAAA,GAEAhB,EAAAgB,KAEA,SAAAH,EAAAG,GACAza,EAAAyZ,YAAAgB,KAEA,OAZAza,EAAA0a,QAAA,IAAAvF,IAYAnV,EAEA,SAAA2a,GAAA1D,EAAA9rF,GACA,MAAA60E,EAAAyY,GAAAxB,EAAA9rF,GACAyvF,GAAA3D,EAAAjX,GACA70E,EAAAa,aACAA,GAAAirF,EAAAjX,GAEA70E,EAAA4tF,KAeA,SAAA9B,EAAAjX,GACA,MAAAU,OAAAA,EAAA4X,aAAAA,GAAAtY,GACAD,SAAAA,GAAAkX,EACA,GAAA,IAAAlX,EAAAtE,OAAA,CACA,MAAAyF,EAAAnB,EAAA,GAEA,GAAAmX,GAAAD,EAAA/V,IAAAA,EAAAM,YAAA,CAGA,MAAAA,EAAAN,EAAAM,YACA,KAAAA,EAAAlE,OACAkE,EAAA4K,UACAkM,EAAAxO,GACAtI,EAAA4K,SAAA,EACA1L,EAAAkJ,GACAlJ,EAAAmJ,KAGAoN,EAAAzV,YAAAA,OAMAyV,EAAAzV,YAAAN,OAGA,GAAAnB,EAAAtE,OAAA,EAAA,CAEA,IAAAyQ,EAAA,GACA7hF,EAAAwwF,eAAA,IACA5D,EAAAzV,YAAAyK,EAAAjM,EAAAU,EAAA6I,QAAAr9E,EAAA+qF,EAAAlX,SAAAmM,EAAA,QAAAhgF,OAAAA,GAAA,IA7CA4uF,CAAA7D,EAAAjX,GAGAiX,EAAArL,QAAA,IAAA5L,EAAA4L,QAAAjhF,QACAssF,EAAApL,WAAA,IAAA7L,EAAA6L,YACAoL,EAAAnL,WAAA,IAAA9L,EAAA8L,YACAmL,EAAAlL,QAAA/L,EAAA+L,QACAkL,EAAAlV,OAAA/B,EAAA+B,OACAkV,EAAAjL,MAAAhM,EAAAgM,MACAiL,EAAAxrF,OAAAu0E,EAAAv0E,OAEAwrF,EAAAyD,QAAA,IAAA1a,EAAA0a,SAqDA,SAAAE,GAAAnd,EAAAuC,GACAA,EAAA6Z,YAAApc,EAEA,MAAA6H,eAAAA,GAAAtF,EACA+a,EAAA,GACA,IAAA,IAAApd,EAAA,EAAAA,EAAA2H,EAAA7J,OAAAkC,IAAA,CACA,MAAAqd,EAAA1V,EAAA3H,GAAAF,EAAAuC,GASA,GARAgb,IACA3wF,EAAAipF,QAAA0H,GACAD,EAAAzZ,QAAA0Z,GAGAD,EAAAzZ,KAAA0Z,KAGAhb,EAAA6Z,YAEA,OAIApc,EAAAuC,EAAA6Z,YAGA,OAAApc,EAAAH,MACA,KAAA,EACA0C,EAAA+Y,KAGA/Y,EAAAU,OAAAqJ,GAEA,MACA,KAAA,EAEA/J,EAAA+Y,KACA/Y,EAAAU,OAAAmD,GAEA,MAEA,KAAA,EACA,IAAA,IAAAlG,EAAA,EAAAA,EAAAF,EAAAoS,SAAApU,OAAAkC,IACAid,GAAAnd,EAAAoS,SAAAlS,GAAAqC,GAEA,MACA,KAAA,GACA,KAAA,GACA,KAAA,EACA,KAAA,GA9DA,SAAA/C,EAAA+C,GACA,IAAArC,EAAA,EACA,MAAAsd,EAAA,KACAtd,KAEA,KAAAA,EAAAV,EAAA8C,SAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAjE,EAAA8C,SAAApC,GACAtzE,EAAAe,SAAA81E,KAEAlB,EAAA/C,OAAAA,EACA+C,EAAA8Z,WAAAnc,EACAqC,EAAAoa,cAAAa,EACAL,GAAA1Z,EAAAlB,KAmDAkb,CAAAzd,EAAAuC,GAIAA,EAAA6Z,YAAApc,EACA,IAAAE,EAAAod,EAAAtf,OACA,KAAAkC,KACAod,EAAApd,KAGA,SAAAwd,GAAA9xF,EAAA+xF,GACA,MAAAC,EAAAhxF,EAAAe,SAAA/B,GACAoB,GAAAA,IAAApB,EACAoB,GAAApB,EAAA4yE,KAAAxxE,GACA,MAAA,CAAAgzE,EAAAuC,KACA,GAAA,IAAAvC,EAAAH,KAAA,CACA,MAAAH,MAAAA,GAAAM,EAGA,GAAA,IAAAA,EAAA8D,SAAApE,EAAAC,KAAA2R,IACA,OAEA,MAAAgM,EAAA,GACA,IAAA,IAAApd,EAAA,EAAAA,EAAAR,EAAA1B,OAAAkC,IAAA,CACA,MAAAwR,EAAAhS,EAAAQ,GACA,GAAA,IAAAwR,EAAA7R,MAAA+d,EAAAlM,EAAA9lF,MAAA,CAIA8zE,EAAA8D,OAAAtD,EAAA,GACAA,IACA,MAAAqd,EAAAI,EAAA3d,EAAA0R,EAAAnP,GACAgb,GACAD,EAAAzZ,KAAA0Z,IAGA,OAAAD,IAKA,MAAAO,GAAA,gBAEA,SAAAC,GAAAC,GAAAtK,KAAAA,EAAA,WAAAyH,kBAAAA,EAAA,WAAAzH,EAAAvL,UAAA8V,GAAA,EAAA/C,SAAAA,EAAA,oBAAA5V,QAAAA,EAAA,KAAA4Y,gBAAAA,GAAA,EAAAC,kBAAAA,EAAA,MAAAC,kBAAAA,EAAA,MAAA7C,IAAAA,GAAA,IACA,MAAA/Y,EAAA,CACAkR,KAAAA,EACAyH,kBAAAA,EACAhT,UAAA8V,EACA/C,SAAAA,EACA5V,QAAAA,EACA4Y,gBAAAA,EACAC,kBAAAA,EACAC,kBAAAA,EACA7C,IAAAA,EACAxN,OAAAiQ,EAAA1d,IAAAyN,OACA1/E,KAAA,GACA6/E,OAAA,EACAD,KAAA,EACAlQ,OAAA,EACAsgB,YAAA,EACAC,MAAA,EACAlb,SAAA10E,EACAw0E,OAAAl1E,GACA,IAAA6/E,EAAA7/E,KAEA6B,KAAAxB,EAAA4xE,GAEA,GADAuC,EAAAn0E,MAAAA,EACAm0E,EAAAY,IAAA,CACA,GAAAnD,EAAA,CACA,IAAAp0E,EACA,GAAA,IAAAo0E,EAAAH,OAAAG,EAAA4E,SAAA,CACA,MAAA9E,EAAAE,EAAAF,QAAAmS,QAAA,UAAA,IACAnS,IAAAE,EAAAF,SAAAqQ,GAAArQ,KACAl0E,EAAAk0E,GAGAwe,EAAAte,EAAAK,IAAA0N,MAAAniF,GAEAilF,GAAAtO,EAAAn0E,GACA4xE,GAAAA,EAAAK,MAAAwN,GACAyQ,EAAAte,EAAAK,IAAAtC,OAIAnuE,SACA4/E,IAAAjN,EAAA6b,cAEAxuF,SAAA2uF,GAAA,GACAA,IACAhc,EAAA6b,YAGA5O,IAAAjN,EAAA6b,cAGAxuF,UACA4/E,EAAAjN,EAAA6b,eAGA,SAAA5O,EAAAxiF,GACAu1E,EAAAsB,KAAA,KAAA,KAAA2a,OAAAxxF,IAEA,SAAAsxF,EAAAje,EAAAz0E,GACA22E,EAAAY,IAAAmb,WAAA,CACA1yF,KAAAA,EACAkiF,OAAAvL,EAAA0Y,SACAwD,SAAA,CACAzQ,KAAA3N,EAAA2N,KACAC,OAAA5N,EAAA4N,OAAA,GAEAyQ,UAAA,CACA1Q,KAAAzL,EAAAyL,KACAC,OAAA1L,EAAA0L,OAAA,KASA,OALA+P,IAEAzb,EAAAY,IAAA,IAAA+E,EAAAyW,mBACApc,EAAAY,IAAAyb,iBAAA3D,EAAA1Y,EAAAuL,SAEAvL,EAEA,SAAAsc,GAAAd,EAAArwF,EAAA,IACA,MAAA60E,EAAAub,GAAAC,EAAArwF,GACAA,EAAAoxF,kBACApxF,EAAAoxF,iBAAAvc,GACA,MAAAkR,KAAAA,EAAA5P,KAAAA,EAAAqX,kBAAAA,EAAA6D,OAAAA,EAAAC,SAAAA,EAAAxP,QAAAA,EAAAnK,QAAAA,EAAAiW,IAAAA,GAAA/Y,EACA0c,EAAAlB,EAAA5P,QAAAnQ,OAAA,EACAkhB,GAAAhE,GAAA,WAAAzH,EACA0L,EAAA,MAAA9Z,GAAA,WAAAoO,EACA2L,IAAA1xF,EAAAguF,OAIA2D,EAAAD,EACAtB,GAAAC,EAAArwF,GACA60E,EACA,WAAAkR,EAgJA,SAAAsK,EAAAxb,EAAA4c,EAAAzD,GACA,MAAA7X,KAAAA,EAAA2L,QAAAA,EAAAyO,gBAAAA,EAAAE,kBAAAA,EAAA9Y,QAAAA,EAAApC,OAAAA,GAAAV,EACA4c,IACApB,EAAA5P,QAAAtK,KAAA2J,GACAuQ,EAAAzZ,OAAAtG,QACA+f,EAAA5P,QAAAtK,KAAAyJ,EAAAC,IAIAwQ,EAAA5P,QAAAnQ,SACAigB,GAMApa,EAAA,YAAAka,EAAA5P,QACAhL,KAAA8R,GAAArH,EAAAqH,KACA5R,KAAA,gBAAAzC,KAAAC,UAAAsd,QACAta,EAAA,2DAAAka,EAAA5P,QACAhL,KAAA8R,GAAA,IAAArH,EAAAqH,QAAArH,EAAAqH,OACA5R,KAAA,YAGAQ,EAAA,YAAAka,EAAA5P,QACAhL,KAAA8R,GAAA,GAAArH,EAAAqH,UAAArH,EAAAqH,OACA5R,KAAA,gBAAAzC,KAAAC,UAAAsd,SAGAJ,EAAAuB,YAAAvB,EAAAuB,WAAAthB,QACA6F,EAAA,YAAAka,EAAAuB,WACAnc,KAAA8R,GAAA,GAAArH,EAAAqH,UAAArH,EAAAqH,OACA5R,KAAA,yCAEA0a,EAAAzP,QAAAtQ,UA+DA,SAAAuhB,EAAAhd,GACA,IAAAgd,EAAAvhB,OACA,OAEAuhB,EAAApyF,SAAAmhF,IACA/L,EAAAsB,KAAA,WACA2b,GAAAlR,EAAAhO,IAAAiC,GACAA,EAAAsB,KAAA,UAAAyK,EAAA5iF,SACA62E,EAAAiN,aAtEAiQ,CAAA1B,EAAAzP,QAAA/L,GACAiN,KAKA2P,IACAtb,EAAA,gCAAAZ,EAAAuK,OAAAnI,OACAmK,KAEAkQ,GAAA3B,EAAAzZ,OAAA/B,GACAiN,IACAkM,GACA7X,EAAA,WA/LA8b,CAAA5B,EAAAsB,EAAAF,EAAAC,GAiGA,SAAArB,EAAAxb,GACA,MAAA+Y,IAAAA,EAAAJ,kBAAAA,EAAArX,KAAAA,EAAA2L,QAAAA,EAAA2O,kBAAAA,EAAAD,kBAAAA,GAAA3b,EACAqd,EAAAtE,EACA,WAAA1a,KAAAC,UAAAsd,MACAD,EACA2B,EAAA5K,GAAA,GAAArH,EAAAqH,QAAArH,EAAAqH,KAKA,GAAA8I,EAAA5P,QAAAnQ,OAAA,EACA,GAAAkd,EACArX,EAAA,WAAAka,EAAA5P,QAAAhL,IAAA0c,GAAAxc,KAAA,aAAAuc,YASA,GAJA/b,EAAA,gBAAA+b,OAIA7B,EAAAzZ,OAAAtG,OAAA,CAUA6F,EAAA,WATA,CACAwI,EACAC,EACAC,EACArJ,GAEA4D,QAAA7D,GAAA8a,EAAA5P,QAAA3G,SAAAvE,KACAE,IAAA0c,GACAxc,KAAA,oBAMA0a,EAAAuB,YAAAvB,EAAAuB,WAAAthB,QAEA6F,EAAA,WAAAka,EAAAuB,WACAnc,IAAA0c,GACAxc,KAAA,+CAEAqc,GAAA3B,EAAAzZ,OAAA/B,GACAiN,IACA3L,EAAA,WA1IAic,CAAA/B,EAAAsB,GAGA,MAAAU,EAAAzE,EAAA,YAAA,SACAnM,EAAAmM,EAAA,CAAA,OAAA,QAAA,UAAA,UAAA,CAAA,OAAA,UACA5tF,EAAA8tF,kBAAA9tF,EAAAguF,QAEAvM,EAAAtL,KAAA,SAAA,SAAA,QAAA,YAEA,MAAAmc,EAAAtyF,EAAAiuF,KACAxM,EAAAhM,KAAAhD,GAAA,GAAAA,WAAAkD,KAAA,KACA8L,EAAA9L,KAAA,MA8CA,GA7CA8b,IAAAC,GAKAvb,EAAA,SAAAkc,6BAGAlc,EADAub,GAAAD,EACA,IAAAa,UAGA,YAAAD,KAAAC,QAEAjB,IACAG,IACArb,EAAA,iBACAkb,IAGAE,IACApb,EAAA,WAAAka,EAAA5P,QACAhL,KAAA8R,GAAA,GAAArH,EAAAqH,QAAArH,EAAAqH,OACA5R,KAAA,kBACAQ,EAAA,MACA2L,MAIAuO,EAAA3P,WAAApQ,SACAiiB,GAAAlC,EAAA3P,WAAA,YAAA7L,IACAwb,EAAA1P,WAAArQ,QAAA+f,EAAAxP,MAAA,IACAiB,KAGAuO,EAAA1P,WAAArQ,SACAiiB,GAAAlC,EAAA1P,WAAA,YAAA9L,GACAwb,EAAAxP,MAAA,GACAiB,KAGAuO,EAAAd,SAAAc,EAAAd,QAAAjf,SACAwR,IACAyQ,GAAAlC,EAAAd,QAAA,SAAA1a,GACAiN,KAEAuO,EAAAxP,MAAA,EAAA,CACA1K,EAAA,QACA,IAAA,IAAA3D,EAAA,EAAAA,EAAA6d,EAAAxP,MAAArO,IACA2D,EAAA,GAAA3D,EAAA,EAAA,KAAA,UAAAA,KA0BA,OAvBA6d,EAAA3P,WAAApQ,QAAA+f,EAAA1P,WAAArQ,QAAA+f,EAAAxP,SACA1K,EAAA,MACA2L,KAGA8L,GACAzX,EAAA,WAEAka,EAAAha,YACAyb,GAAAzB,EAAAha,YAAAxB,GAGAsB,EAAA,QAEAqb,IACAF,IACAnb,EAAA,MAEAmb,IACAnb,EAAA,KACAsb,IAAAC,GACAvb,EAAA,KAEA,CACAka,IAAAA,EACA3vF,KAAAm0E,EAAAn0E,KACA8xF,SAAAd,EAAAC,EAAAjxF,KAAA,GAEA+0E,IAAAZ,EAAAY,IAAAZ,EAAAY,IAAAgd,cAAA1xF,GAoGA,SAAAwxF,GAAAG,EAAAvgB,GAAAoD,OAAAA,EAAAY,KAAAA,EAAA2L,QAAAA,IACA,MAAA6Q,EAAApd,EAAA,WAAApD,EACA8M,EACA,cAAA9M,EACA2M,EACAE,GACA,IAAA,IAAAxM,EAAA,EAAAA,EAAAkgB,EAAApiB,OAAAkC,IAAA,CACA,IAAA8c,EAAAoD,EAAAlgB,GAEA,MAAAogB,EAAAtD,EAAAle,SAAA,UACAwhB,IACAtD,EAAAA,EAAA7e,MAAA,GAAA,IAEA0F,EAAA,SAAAmO,GAAAgL,EAAAnd,QAAAwgB,KAAAzf,KAAAC,UAAAmc,KAAAsD,EAAA,SAAA,OACApgB,EAAAkgB,EAAApiB,OAAA,GACAwR,KAIA,SAAAkQ,GAAApb,EAAA/B,GACA,IAAA+B,EAAAtG,OACA,OAEAuE,EAAA8b,MAAA,EACA,MAAAxa,KAAAA,EAAA2L,QAAAA,EAAAvM,OAAAA,EAAAoC,QAAAA,EAAAoO,KAAAA,GAAAlR,EACA4c,EAAA,MAAA9Z,GAAA,aAAAoO,EACAjE,IAGA2P,IACAtb,EAAA,GAAAZ,EAAAqK,OAAAjI,OACAmK,KAEAlL,EAAAn3E,SAAA,CAAAmzE,EAAAJ,KACAI,IACAuD,EAAA,kBAAA3D,EAAA,QACAsf,GAAAlf,EAAAiC,GACAiN,QAGA2P,IACAtb,EAAA,GAAAZ,EAAAsK,QACAiC,KAEAjN,EAAA8b,MAAA,EAoBA,SAAAkC,GAAAxL,EAAAxS,GACA,MAAAie,EAAAzL,EAAA/W,OAAA,GACA+W,EAAApV,MAAA3yE,GAAAJ,EAAAipF,QAAA7oF,KATA,SAAAA,GACA,OAAAJ,EAAAe,SAAAX,IACA,IAAAA,EAAA6yE,MACA,IAAA7yE,EAAA6yE,MACA,IAAA7yE,EAAA6yE,MACA,IAAA7yE,EAAA6yE,KAIA4gB,CAAAzzF,KACAu1E,EAAAsB,KAAA,KACA2c,GAAAje,EAAAwc,SACA2B,GAAA3L,EAAAxS,EAAAie,GACAA,GAAAje,EAAAyc,WACAzc,EAAAsB,KAAA,KAEA,SAAA6c,GAAA3L,EAAAxS,EAAAie,GAAA,EAAAG,GAAA,GACA,MAAA9c,KAAAA,EAAA2L,QAAAA,GAAAjN,EACA,IAAA,IAAArC,EAAA,EAAAA,EAAA6U,EAAA/W,OAAAkC,IAAA,CACA,MAAAF,EAAA+U,EAAA7U,GACAtzE,EAAAe,SAAAqyE,GACA6D,EAAA7D,GAEApzE,EAAAipF,QAAA7V,GACAugB,GAAAvgB,EAAAuC,GAGAid,GAAAxf,EAAAuC,GAEArC,EAAA6U,EAAA/W,OAAA,IACAwiB,GACAG,GAAA9c,EAAA,KACA2L,KAGAmR,GAAA9c,EAAA,QAKA,SAAA2b,GAAAxf,EAAAuC,GACA,GAAA31E,EAAAe,SAAAqyE,GACAuC,EAAAsB,KAAA7D,QAGA,GAAApzE,EAAAi4E,SAAA7E,GACAuC,EAAAsB,KAAAtB,EAAAU,OAAAjD,SAGA,OAAAA,EAAAH,MACA,KAAA,EACA,KAAA,EACA,KAAA,GACA2f,GAAAxf,EAAA+D,YAAAxB,GACA,MACA,KAAA,GA4DA,SAAAvC,EAAAuC,GACAA,EAAAsB,KAAAjD,KAAAC,UAAAb,EAAAF,SAAAE,GA5DA4gB,CAAA5gB,EAAAuC,GACA,MACA,KAAA,EACAse,GAAA7gB,EAAAuC,GACA,MACA,KAAA,GA6DA,SAAAvC,EAAAuC,GACA,MAAAsB,KAAAA,EAAAZ,OAAAA,EAAAob,KAAAA,GAAA9b,EACA8b,GACAxa,EAAAga,IACAha,EAAA,GAAAZ,EAAAmD,OACAoZ,GAAAxf,EAAAF,QAAAyC,GACAsB,EAAA,KAlEAid,CAAA9gB,EAAAuC,GACA,MACA,KAAA,GACAid,GAAAxf,EAAA+D,YAAAxB,GACA,MACA,KAAA,EACAwe,GAAA/gB,EAAAuC,GACA,MACA,KAAA,GAyFA,SAAAvC,EAAAuC,GACA,MAAAsB,KAAAA,EAAAZ,OAAAA,EAAAob,KAAAA,GAAA9b,EACA8b,GACAxa,EAAAga,IAEAha,EAAA,GAAAZ,EAAAqJ,MAAA1L,KAAAC,UAAAb,EAAAF,YAAAE,GA7FAghB,CAAAhhB,EAAAuC,GACA,MACA,KAAA,IA6FA,SAAAvC,EAAAuC,GACA,MAAAsB,KAAAA,EAAAZ,OAAAA,EAAAob,KAAAA,GAAA9b,GACAhF,IAAAA,EAAAmC,MAAAA,EAAA4C,SAAAA,EAAAmM,UAAAA,EAAAC,aAAAA,EAAAL,WAAAA,EAAAM,QAAAA,EAAAC,gBAAAA,GAAA5O,EACAqO,GACAxK,EAAAZ,EAAA2J,GAAA,KAEA+B,GACA9K,EAAA,IAAAZ,EAAAkJ,MAAAyC,EAAA,OAAA,SAEAyP,GACAxa,EAAAga,IAEAha,EAAAZ,EAAA0L,EAAAvC,EAAAC,GAAA,IAAArM,GACA0gB,GAWA,SAAAvR,GACA,IAAAjP,EAAAiP,EAAAnR,OACA,KAAAkC,KACA,MAAAiP,EAAAjP,KAGA,OAAAiP,EAAAhR,MAAA,EAAA+B,EAAA,GAAAiD,KAAAhD,GAAAA,GAAA,SAjBA8gB,CAAA,CAAA1jB,EAAAmC,EAAA4C,EAAAmM,EAAAC,IAAAnM,GACAsB,EAAA,KACA8K,GACA9K,EAAA,KAEAwK,IACAxK,EAAA,MACA2b,GAAAnR,EAAA9L,GACAsB,EAAA,MAjHAqd,CAAAlhB,EAAAuC,GACA,MACA,KAAA,IA2HA,SAAAvC,EAAAuC,GACA,MAAAsB,KAAAA,EAAAZ,OAAAA,EAAAob,KAAAA,GAAA9b,EACA2M,EAAAtiF,EAAAe,SAAAqyE,EAAAkP,QAAAlP,EAAAkP,OAAAjM,EAAAjD,EAAAkP,QACAmP,GACAxa,EAAAga,IAEAha,EAAAqL,EAAA,IAAAlP,GACA0gB,GAAA1gB,EAAAoP,UAAA7M,GACAsB,EAAA,KAlIAsd,CAAAnhB,EAAAuC,GACA,MACA,KAAA,IAkIA,SAAAvC,EAAAuC,GACA,MAAAsB,KAAAA,EAAAkb,OAAAA,EAAAC,SAAAA,EAAAxP,QAAAA,GAAAjN,GACAyM,WAAAA,GAAAhP,EACA,IAAAgP,EAAAhR,OAEA,YADA6F,EAAA,KAAA7D,GAGA,MAAAwgB,EAAAxR,EAAAhR,OAAA,GACAgR,EAAArP,MAAAM,GAAA,IAAAA,EAAAxzE,MAAAozE,OACAgE,EAAA2c,EAAA,IAAA,MACAA,GAAAzB,IACA,IAAA,IAAA7e,EAAA,EAAAA,EAAA8O,EAAAhR,OAAAkC,IAAA,CACA,MAAAnyE,IAAAA,EAAAtB,MAAAA,GAAAuiF,EAAA9O,GAEAkhB,GAAArzF,EAAAw0E,GACAsB,EAAA,MAEA2b,GAAA/yF,EAAA81E,GACArC,EAAA8O,EAAAhR,OAAA,IAEA6F,EAAA,KACA2L,KAGAgR,GAAAxB,IACAnb,EAAA2c,EAAA,IAAA,MA1JAa,CAAArhB,EAAAuC,GACA,MACA,KAAA,IA0JA,SAAAvC,EAAAuC,GACAge,GAAAvgB,EAAA8O,SAAAvM,GA1JA+e,CAAAthB,EAAAuC,GACA,MACA,KAAA,IA0JA,SAAAvC,EAAAuC,GACA,MAAAsB,KAAAA,EAAAkb,OAAAA,EAAAC,SAAAA,EAAA3Z,QAAAA,EAAAoO,KAAAA,GAAAlR,GACA+M,OAAAA,EAAAC,QAAAA,EAAAvQ,KAAAA,EAAAwQ,QAAAA,EAAAC,OAAAA,GAAAzP,EAEAmf,EAAA1P,GAAA,MAAApK,GAAA,aAAAoO,EACAhE,GAEA5L,EAAAsb,EAAA,WAAA,IAAAvR,EAAAH,OAEA5J,EAAA,IAAA7D,GACApzE,EAAAipF,QAAAvG,GACAoR,GAAApR,EAAA/M,GAEA+M,GACAkQ,GAAAlQ,EAAA/M,GAEAsB,EAAA,UACA2L,GAAAxQ,KACA6E,EAAA,KACAkb,KAEAxP,GACAC,GACA3L,EAAA,WAEAj3E,EAAAipF,QAAAtG,GACAgR,GAAAhR,EAAAhN,GAGAid,GAAAjQ,EAAAhN,IAGAvD,GACAwgB,GAAAxgB,EAAAuD,IAEAiN,GAAAxQ,KACAggB,IACAnb,EAAA,MAEA4L,IACAzP,EAAAuhB,iBACA1d,EAAA,qBAEAA,EAAA,MApMA2d,CAAAxhB,EAAAuC,GACA,MACA,KAAA,IAqMA,SAAAvC,EAAAuC,GACA,MAAA/D,KAAAA,EAAAmR,WAAAA,EAAAC,UAAAA,EAAAJ,QAAAiS,GAAAzhB,GACA6D,KAAAA,EAAAkb,OAAAA,EAAAC,SAAAA,EAAAxP,QAAAA,GAAAjN,EACA,GAAA,IAAA/D,EAAAqB,KAAA,CACA,MAAA6hB,GAAAvR,GAAA3R,EAAAsB,SACA4hB,GAAA7d,EAAA,KACAgd,GAAAriB,EAAA+D,GACAmf,GAAA7d,EAAA,UAGAA,EAAA,KACA2b,GAAAhhB,EAAA+D,GACAsB,EAAA,KAEA4d,GAAA1C,IACAxc,EAAA6b,cACAqD,GAAA5d,EAAA,KACAA,EAAA,MACA2b,GAAA7P,EAAApN,GACAA,EAAA6b,cACAqD,GAAAjS,IACAiS,GAAA5d,EAAA,KACAA,EAAA,MACA,MAAA8d,EAAA,KAAA/R,EAAA/P,KACA8hB,GACApf,EAAA6b,cAEAoB,GAAA5P,EAAArN,GACAof,GACApf,EAAA6b,cAEAqD,GAAAzC,GAAA,GAnOA4C,CAAA5hB,EAAAuC,GACA,MACA,KAAA,IAmOA,SAAAvC,EAAAuC,GACA,MAAAsB,KAAAA,EAAAZ,OAAAA,EAAA8b,OAAAA,EAAAC,SAAAA,EAAAxP,QAAAA,GAAAjN,EACAsB,EAAA,UAAA7D,EAAA1B,eACA0B,EAAA8P,UACAiP,IACAlb,EAAA,GAAAZ,EAAAoK,WACAmC,KAEA3L,EAAA,UAAA7D,EAAA1B,aACAkhB,GAAAxf,EAAAvzE,MAAA81E,GACAvC,EAAA8P,UACAjM,EAAA,KACA2L,IACA3L,EAAA,GAAAZ,EAAAoK,UACAmC,IACA3L,EAAA,UAAA7D,EAAA1B,UACA0gB,KAEAnb,EAAA,KApPAge,CAAA7hB,EAAAuC,GACA,MAEA,KAAA,GACAme,GAAA1gB,EAAAhB,KAAAuD,GAAA,GAAA,GACA,MACA,KAAA,IAgPA,SAAAvC,EAAAuC,GACA,MAAAsB,KAAAA,EAAAkb,OAAAA,EAAAC,SAAAA,GAAAzc,EACAsB,EAAA,KACA,MAAAie,EAAA9hB,EAAA8O,SAAA9Q,OACAwiB,EAAAsB,EAAA,EACA,IAAA,IAAA5hB,EAAA,EAAAA,EAAA4hB,EAAA5hB,IAAA,CACA,MAAApzE,EAAAkzE,EAAA8O,SAAA5O,GACAtzE,EAAAe,SAAAb,GACA+2E,EAAA/2E,EAAAmlF,QAAA,aAAA,UAGApO,EAAA,MACA2c,GACAzB,IACAS,GAAA1yF,EAAAy1E,GACAie,GACAxB,IACAnb,EAAA,MAGAA,EAAA,KAnQAke,CAAA/hB,EAAAuC,GACA,MACA,KAAA,GACAyf,GAAAhiB,EAAAuC,GACA,MACA,KAAA,IAwRA,SAAAvC,EAAAuC,GACAid,GAAAxf,EAAAiiB,KAAA1f,GACAA,EAAAsB,KAAA,OACA2b,GAAAxf,EAAAkiB,MAAA3f,GA1RA4f,CAAAniB,EAAAuC,GACA,MACA,KAAA,IA0RA,SAAAvC,EAAAuC,GACAA,EAAAsB,KAAA,KACA6c,GAAA1gB,EAAAoiB,YAAA7f,GACAA,EAAAsB,KAAA,KA5RAwe,CAAAriB,EAAAuC,GACA,MACA,KAAA,IA4RA,UAAAgN,QAAAA,GAAAhN,GACAA,EAAAsB,KAAA,WACAj3E,EAAAipF,QAAAtG,GACAgR,GAAAhR,EAAAhN,GAGAid,GAAAjQ,EAAAhN,GAjSA+f,CAAAtiB,EAAAuC,IAOA,SAAAse,GAAA7gB,EAAAuC,GACA,MAAAzC,QAAAA,EAAA8E,SAAAA,GAAA5E,EACAuC,EAAAsB,KAAAe,EAAAhE,KAAAC,UAAAf,GAAAA,EAAAE,GAUA,SAAA+gB,GAAA/gB,EAAAuC,GACA,IAAA,IAAArC,EAAA,EAAAA,EAAAF,EAAAsC,SAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAzD,EAAAsC,SAAApC,GACAtzE,EAAAe,SAAA81E,GACAlB,EAAAsB,KAAAJ,GAGA+b,GAAA/b,EAAAlB,IAIA,SAAA6e,GAAAphB,EAAAuC,GACA,MAAAsB,KAAAA,GAAAtB,EACA,GAAA,IAAAvC,EAAAH,KACAgE,EAAA,KACAkd,GAAA/gB,EAAAuC,GACAsB,EAAA,UAEA,GAAA7D,EAAA4E,SAAA,CAKAf,EAHAsM,GAAAnQ,EAAAF,SACAE,EAAAF,QACAc,KAAAC,UAAAb,EAAAF,SACAE,QAGA6D,EAAA,IAAA7D,EAAAF,WAAAE,GA4MA,SAAAgiB,GAAAhiB,EAAAuC,GACA,MAAAsB,KAAAA,EAAAkb,OAAAA,EAAAC,SAAAA,GAAAzc,GACA/D,KAAAA,EAAAmR,WAAAA,EAAAC,UAAAA,GAAA5P,EACA6D,EAAA,QACA2b,GAAAhhB,EAAA+D,GACAsB,EAAA,OACAkb,IACAS,GAAA7P,EAAApN,GACAyc,IACAnb,EAAA,KACA+L,IACA/L,EAAA,UACA,KAAA+L,EAAA/P,KACAmiB,GAAApS,EAAArN,IAGAsB,EAAA,KACAkb,IACAS,GAAA5P,EAAArN,GACAyc,IACAnb,EAAA,OAwBA,MAAA0e,GAAA31F,EAAAuwE,QAAA,wBACAqlB,GAAA,CAAAxiB,EAAAuC,KACA,GAAA,IAAAvC,EAAAH,KACAG,EAAAF,QAAA2iB,GAAAziB,EAAAF,QAAAyC,QAEA,GAAA,IAAAvC,EAAAH,KAEA,IAAA,IAAAK,EAAA,EAAAA,EAAAF,EAAAN,MAAA1B,OAAAkC,IAAA,CACA,MAAA8F,EAAAhG,EAAAN,MAAAQ,GAEA,GAAA,IAAA8F,EAAAnG,MAAA,QAAAmG,EAAAp6E,KAAA,CACA,MAAA00E,EAAA0F,EAAA1F,IACAH,EAAA6F,EAAA7F,KAGAG,GACA,IAAAA,EAAAT,MACA,OAAAmG,EAAAp6E,MAAAu0E,IACA6F,EAAA1F,IAAAmiB,GAAAniB,EAAAiC,EAEA,SAAAyD,EAAAp6E,OAEAu0E,GAAA,IAAAA,EAAAN,OAAAM,EAAAyE,WACAoB,EAAA7F,IAAAsiB,GAAAtiB,EAAAoC,OASA,SAAAkgB,GAAAziB,EAAAuC,EAGAmgB,GAAA,EAEAC,GAAA,GACA,IAAApgB,EAAA2Y,oBAAAlb,EAAAF,QAAAyQ,OACA,OAAAvQ,EAEA,MAAA0b,OAAAA,EAAAF,gBAAAA,GAAAjZ,EACAqgB,EAAA,CAAAC,EAAArjB,EAAAwd,KACA,MAAAnd,EAAAjzE,EAAAk2F,OAAAtH,EAAAqH,IAAArH,EAAAqH,GACA,GAAAnH,EAAA,CAEA,MAAAqH,EAAAvjB,GAAA,yBAAAA,EAAAK,MAAAL,EAAAyiB,OAAAjF,EAEAgG,EAAAxjB,GAAA,qBAAAA,EAAAK,MAAAL,EAAAyjB,WAAAjG,EAEAkG,EAAA1jB,GAAA2jB,GAAA3jB,EAAA4jB,GACA,GAAA,gBAAAvjB,EACA,OAAAgjB,EAEA,GAAA,cAAAhjB,EACA,MAAA,GAAAgjB,UAEA,GAAA,oBAAAhjB,EAKA,OAAAkjB,GAAAC,GAAAE,EACA,GAAAL,UACA,GAAAtgB,EAAA4D,aAAAuH,MAAAmV,KAEA,GAAA,cAAAhjB,EAAA,CACA,GAAAkjB,EAAA,CAMA,MAAAb,MAAAmB,EAAAC,SAAAA,GAAA9jB,EAEA+jB,EAAAC,GAAAf,GAAAriB,EADAqjB,EAAAtlB,MAAAklB,EAAAtV,MAAA,EAAAsV,EAAAtlB,IAAA,IACA,GAAAwE,IACA,MAAA,GAAAA,EAAA4D,aAAAwH,MAAAkV,KAAAtgB,EAAAoZ,KAAA,kBAAA,QAAAkH,WAAAS,KAAAC,OAAAV,IAEA,GAAAG,EAAA,CAGAhG,EAAAjP,MAAAvO,EAAAuO,MACAiP,EAAAjf,IAAAyB,EAAAzB,IACA,MAAA2lB,OAAAC,EAAAL,SAAAA,GAAA9jB,EACAkkB,EAAAC,EAAAL,EAAA,GACAM,EAAAD,EAAA,GAAAL,EAGA,MAAA,GAAA/gB,EAAA4D,aAAAwH,MAAAkV,KAAAtgB,EAAAoZ,KAAA,kBAAA,QAAA+H,IAAAb,UAAAe,OAAAF,IAAAb,IAAAe,IAEA,OAAAV,EAMAL,EAGA,GAAAtgB,EAAA4D,aAAAuH,MAAAmV,KAGA,GAAA,UAAAhjB,EAGA,MAAA,WAAAgjB,QAGA,CACA,GAAAhjB,GAAAA,EAAAqV,WAAA,SAEA,MAAA,UAAA2N,IAEA,GAAAhjB,EACA,MAAA,IAAAA,KAAAgjB,IAIA,MAAA,QAAAA,KAGAY,EAAAzjB,EAAAF,QAEA+jB,EAAAJ,EAAAlf,QAAA,MAAA,GAAAkf,EAAAlf,QAAA,KAAA,EACA,GAAA4L,GAAAsT,GAAA,CACA,MAAAK,EAAAvhB,EAAAyZ,YAAAyH,GACAM,EAAAn3F,EAAAo3F,sBAAAP,GACAQ,EAAA1B,GAAAkB,GAiBA,OAhBAf,GAAAoB,GAAAC,GAAAE,EAQAH,IAEA9jB,EAAAiP,UADAgV,EACA,EAGA,IAVA,gBAAAzI,EAAAxb,EAAAF,WACAE,EAAAiP,UAAA,GAEAjP,EAAAF,QAAA8iB,EAAAa,IAUAzjB,EAEA,IAAA+d,EAMA,MAAAjQ,EAAA6U,EACA,IAAAc,KACA,IAAAA,KAAAf,EAAA,OAAA,KACA,IACA3E,EAAA5V,EAAAH,MAAA8F,EAAA,CACAoW,QAAA,IAAA3hB,EAAA6Y,qBAAAxuF,EAAAu3F,6BACAC,QAEA,MAAAt3F,GAEA,OADAy1E,EAAA/zE,QAAAuyE,EAAA,GAAAf,EAAAK,SAAA5xE,EAAA3B,EAAA4lF,UACA1S,EAEA,MAAAmS,EAAA,GACAkS,EAAA93F,OAAAU,OAAAs1E,EAAAyZ,aAEAoH,EAAA,GACAhb,EAAAzD,KAAAoZ,EAAA,CACAnuF,MAAAowE,EAAAR,GAEA,GADAA,GAAA4jB,EAAAvf,KAAArE,GACA,eAAAQ,EAAAH,MACA,IANA,CAAAG,GAAAmS,EAAAxS,MAAAqd,GAAAA,EAAAjP,QAAA/N,EAAA+N,QAMAuW,CAAAtkB,GAAA,CAEA,GAAAA,EAAAp0E,KAAAspF,WAAA,YACA,OAEA,MAAAqP,EA4GA,SAAAvH,EAAAxd,EAAA4jB,GAEA,IAAA,uBAAA5jB,EAAAK,MACA,qBAAAL,EAAAK,OACAL,EAAAwd,KAAAA,EACA,OAAA,EAEA,GAAAwH,GAAAhlB,GAAA,CAEA,GAAAA,EAAAwd,KAAAA,EACA,OAAA,EAGA,GAAAxd,EAAA8P,OAAA9H,SAAAwV,GACA,OAAA,EAKA,GAAAyH,GAAAzH,EAAAxd,GACA,OAAA,EAGA,GAAA,iBAAAA,EAAAK,OACAsjB,GAAA3jB,EAAA4jB,GACA,OAAA,EAGA,IAAA,qBAAA5jB,EAAAK,MACA,6BAAAL,EAAAK,OACAL,EAAAklB,WAAA1H,IACAxd,EAAAmlB,SACA,OAAA,EAGA,GAAA,cAAA3H,EAAApxF,KACA,OAAA,EAGA,GAAAgB,EAAAo3F,sBAAAhH,EAAApxF,MACA,OAAA,EAGA,GAAA,YAAAoxF,EAAApxF,KACA,OAAA,EAEA,OAAA,EA1JAg5F,CAAA5kB,EAAAR,EAAA4jB,IACAiB,EAAArkB,EAAAp0E,OAAA24F,GACAM,GAAArlB,IAAAA,EAAAslB,YAGA9kB,EAAA0jB,OAAA,GAAA1jB,EAAAp0E,UAEAo0E,EAAAp0E,KAAAg3F,EAAA5iB,EAAAp0E,KAAA4zE,EAAAQ,GACAmS,EAAAtO,KAAA7D,IAEAykB,GAAAzkB,EAAAR,KAGA+kB,GAAAF,EAAArkB,EAAAp0E,OAAAi4F,IACA7jB,EAAA+kB,YAAA,GAIA5S,EAAAtO,KAAA7D,UAIAwkB,GAAAxkB,IAGAA,EAAAsP,OAAAniF,SAAA8yE,GAAAmI,EAAAzD,KAAA1E,EAAA,CACArwE,MAAA6zE,EAAAjE,GACA,KAAA,eAAAiE,EAAA5D,MAEA4kB,GAAAhhB,EAAAjE,IAGAA,GACA,sBAAAA,EAAAK,MACAL,EAAA0iB,QAAAze,GAAA,CACA,MAAA73E,KAAAA,GAAA63E,EACA,GAAAzD,EAAAglB,UAAAhlB,EAAAglB,SAAAlN,IAAAlsF,GACA,OAEAA,KAAAy4F,EACAA,EAAAz4F,KAGAy4F,EAAAz4F,GAAA,GAEAo0E,EAAAglB,WAAAhlB,EAAAglB,SAAA,IAAAtN,MAAAK,IAAAnsF,UAMAgE,MAAAowE,EAAAR,GACAA,GAAA4jB,EAAApM,MACAhX,IAAA+d,EAAA/e,KAAA,GAAAimB,YAAAjlB,EAAAglB,UACAhlB,EAAAglB,SAAA73F,SAAA6vF,IACAqH,EAAArH,KACA,IAAAqH,EAAArH,WACAqH,EAAArH,SAUA,MAAA1a,EAAA,GAqBA,IAAA4iB,EAWA,OA/BA/S,EAAAgT,MAAA,CAAAvlB,EAAAyS,IAAAzS,EAAAmO,MAAAsE,EAAAtE,QACAoE,EAAAhlF,SAAA,CAAA6vF,EAAA9c,KAEA,MAAA6N,EAAAiP,EAAAjP,MAAA,EACAhQ,EAAAif,EAAAjf,IAAA,EACA+W,EAAA3C,EAAAjS,EAAA,GACAklB,EAAA3B,EAAAtlB,MAAA2W,EAAAA,EAAA/W,IAAA,EAAA,EAAAgQ,IACAqX,EAAApnB,QAAAgf,EAAA0G,SACAphB,EAAAuB,KAAAuhB,GAAApI,EAAA0G,QAAA,KAEA,MAAA5V,EAAA2V,EAAAtlB,MAAA4P,EAAAhQ,GACAuE,EAAAuB,KAAAzD,EAAA4c,EAAApxF,MAAA,EAAA,CACAkiF,OAAAA,EACAC,MAAA2C,GAAA1Q,EAAAK,IAAA0N,MAAAD,EAAAC,GACAhQ,IAAA2S,GAAA1Q,EAAAK,IAAA0N,MAAAD,EAAA/P,IACAif,EAAA+H,WAAA,EAAA,IACA7kB,IAAAiS,EAAAnU,OAAA,GAAAD,EAAA0lB,EAAAzlB,QACAsE,EAAAuB,KAAA4f,EAAAtlB,MAAAJ,OAIAuE,EAAAtE,OACAknB,EAAA9iB,EAAAE,EAAAtC,EAAAK,MAGA6kB,EAAAllB,EACAklB,EAAAjW,UAAA4U,EACA,EACA,GAEAqB,EAAAlJ,YAAAzvF,OAAAW,KAAAm3F,GACAa,EAEA,MAAAV,GAAAxkB,GACA,8CAAAxB,KAAAwB,EAAAH,MAEAglB,GAAA7kB,GAAAA,IACA,mBAAAA,EAAAH,MAAA,iBAAAG,EAAAH,QACAG,EAAA2kB,SACAF,GAAA,CAAAzkB,EAAAR,IAAAqlB,GAAArlB,IAAAA,EAAAzxE,MAAAiyE,EAiDA,SAAAmjB,GAAA3jB,EAAA4jB,GACA,GAAA5jB,IACA,mBAAAA,EAAAK,MAAA,iBAAAL,EAAAK,MAAA,CACA,IAAAK,EAAAkjB,EAAAplB,OACA,KAAAkC,KAAA,CACA,MAAAD,EAAAmjB,EAAAljB,GACA,GAAA,yBAAAD,EAAAJ,KACA,OAAA,EAEA,GAAA,mBAAAI,EAAAJ,OAAAI,EAAAJ,KAAAf,SAAA,WACA,OAIA,OAAA,EAEA,SAAA0kB,GAAAljB,GACA,OAAA1zE,EAAAe,SAAA2yE,GACAA,EAEA,IAAAA,EAAAT,KACAS,EAAAR,QAGAQ,EAAAgC,SACAa,IAAAqgB,IACAngB,KAAA,IAIA,MAAAgiB,GAAA3H,GAAA,uBAAA,CAAA1d,EAAAgG,EAAAzD,IACA+iB,GAAAtlB,EAAAgG,EAAAzD,GAAA,CAAAgjB,EAAAC,EAAAC,KAIA,MAAAC,EAAAnjB,EAAA/C,OAAA8C,SACA,IAAApC,EAAAwlB,EAAAnhB,QAAAghB,GACAx3F,EAAA,EACA,KAAAmyE,MAAA,GAAA,CACA,MAAAylB,EAAAD,EAAAxlB,GACAylB,GAAA,IAAAA,EAAA9lB,OACA9xE,GAAA43F,EAAAvT,SAAApU,QAKA,MAAA,KACA,GAAAynB,EACAF,EAAAxhB,YAAA6hB,GAAAJ,EAAAz3F,EAAAw0E,OAEA,EAkKA,SAAAvC,GACA,OACA,GAAA,KAAAA,EAAAH,KAAA,CACA,GAAA,KAAAG,EAAA4P,UAAA/P,KAIA,OAAAG,EAHAA,EAAAA,EAAA4P,eAMA,KAAA5P,EAAAH,OACAG,EAAAA,EAAAvzE,OA3KAo5F,CAAAN,EAAAxhB,cACA6L,UAAAgW,GAAAJ,EAAAz3F,EAAAw3F,EAAAnT,SAAApU,OAAA,EAAAuE,UAMA,SAAA+iB,GAAAtlB,EAAAgG,EAAAzD,EAAAujB,GACA,KAAA,SAAA9f,EAAAp6E,MACAo6E,EAAA1F,KAAA0F,EAAA1F,IAAAR,QAAAyQ,QAAA,CACA,MAAAlQ,EAAA2F,EAAA1F,IAAA0F,EAAA1F,IAAAD,IAAAL,EAAAK,IACAkC,EAAA/zE,QAAAuyE,EAAA,GAAAiF,EAAA3F,MACA2F,EAAA1F,IAAAF,EAAA,QAAA,EAAAC,GAOA,GALAkC,EAAA2Y,mBAAAlV,EAAA1F,MAGA0F,EAAA1F,IAAAmiB,GAAAzc,EAAA1F,IAAAiC,IAEA,OAAAyD,EAAAp6E,KAAA,CACA,MAAA45F,EAAAO,GAAA/lB,EAAAgG,GACAuf,EAAA,CACA1lB,KAAA,EACAQ,IAAAL,EAAAK,IACA+R,SAAA,CAAAoT,IAGA,GADAjjB,EAAAyjB,YAAAT,GACAO,EACA,OAAAA,EAAAP,EAAAC,GAAA,OAGA,CAEA,MAAAE,EAAAnjB,EAAA/C,OAAA8C,SACA,IAAApC,EAAAwlB,EAAAnhB,QAAAvE,GACA,KAAAE,OAAA,GAAA,CACA,MAAAylB,EAAAD,EAAAxlB,GACA,IAAAylB,GACA,IAAAA,EAAA9lB,MACA8lB,EAAA7lB,QAAAyQ,OAAAvS,OAFA,CAMA,GAAA2nB,GAAA,IAAAA,EAAA9lB,KAAA,CAEA0C,EAAAmD,aACA,MAAA8f,EAAAO,GAAA/lB,EAAAgG,GAEA,CACA,MAAAj4E,EAAAy3F,EAAAS,QACAl4F,GACA43F,EAAAvT,SAAAjlF,SAAA,EAAA84F,QAAAA,MACAC,GAAAD,EAAAl4F,IACAw0E,EAAA/zE,QAAAuyE,EAAA,GAAAykB,EAAAS,QAAA5lB,SAKAslB,EAAAvT,SAAAvO,KAAA2hB,GACA,MAAAjI,EAAAuI,GAAAA,EAAAH,EAAAH,GAAA,GAGArI,GAAAqI,EAAAjjB,GAEAgb,GACAA,IAGAhb,EAAA6Z,YAAA,UAGA7Z,EAAA/zE,QAAAuyE,EAAA,GAAAf,EAAAK,MAEA,MAjCAkC,EAAAmD,WAAAigB,KAqCA,SAAAI,GAAA/lB,EAAAgG,GACA,MAAA,CACAnG,KAAA,GACAQ,IAAAL,EAAAK,IACAiS,UAAA,SAAAtM,EAAAp6E,UAAA6C,EAAAu3E,EAAA1F,IACAgC,SAAA,IAAAtC,EAAA8D,SAAAmN,GAAAjR,EAAA,OAEA,CAAAA,GADAA,EAAAsC,SAEA2jB,QAAAtf,GAAA3G,EAAA,QAGA,SAAA4lB,GAAAJ,EAAAW,EAAA5jB,GACA,OAAAijB,EAAAlT,UACA5C,GAAA8V,EAAAlT,UAAA8T,GAAAZ,EAAAW,EAAA5jB,GAGAS,EAAAT,EAAAU,OAAAqJ,GAAA,CACA,KACA,UAIA8Z,GAAAZ,EAAAW,EAAA5jB,GAGA,SAAA6jB,GAAAZ,EAAAW,EAAA5jB,GACA,MAAAU,OAAAA,EAAA4X,aAAAA,GAAAtY,EACA8jB,EAAApgB,EAAA,MAAA7F,EAAA,GAAA+lB,KAAA,EAAAtY,EAAA,KACAvL,SAAAA,GAAAkjB,EACAc,EAAAhkB,EAAA,GAEA,GADA,IAAAA,EAAAtE,QAAA,IAAAsoB,EAAAzmB,KACA,CACA,GAAA,IAAAyC,EAAAtE,QAAA,KAAAsoB,EAAAzmB,KAAA,CAEA,MAAA0mB,EAAAD,EAAAviB,YAEA,OADA0N,GAAA8U,EAAAF,EAAA9jB,GACAgkB,EAEA,CACA,IAAA9X,EAAA,GAEA,OADA7hF,EAAAwwF,eAAA,IACA5O,EAAAjM,EAAAU,EAAA6I,GAAAiD,EAAA,CAAAsX,IAAA/jB,EAAAmM,EAAA,QAAAhgF,OAAAA,GAAA,GAAA,EAAA+2F,EAAAnlB,MAGA,CACA,MAAAkmB,EAAAD,EACAviB,YAUA,OARA,KAAAwiB,EAAA1mB,MAAA0mB,EAAA5X,UACAkM,EAAAxO,GACAka,EAAA5X,SAAA,EACA1L,EAAAkJ,GACAlJ,EAAAmJ,IAGAqF,GAAA8U,EAAAF,EAAA9jB,GACAgkB,GAGA,SAAAL,GAAAtmB,EAAAyS,GACA,IAAAzS,GAAAA,EAAAC,OAAAwS,EAAAxS,KACA,OAAA,EAEA,GAAA,IAAAD,EAAAC,MACA,GAAAD,EAAAnzE,MAAAqzE,UAAAuS,EAAA5lF,MAAAqzE,QACA,OAAA,MAGA,CAEA,MAAAQ,EAAAV,EAAAU,IACAkmB,EAAAnU,EAAA/R,IACA,GAAAA,EAAAT,OAAA2mB,EAAA3mB,KACA,OAAA,EAEA,GAAA,IAAAS,EAAAT,MACAS,EAAAsE,WAAA4hB,EAAA5hB,UACAtE,EAAAR,UAAA0mB,EAAA1mB,QACA,OAAA,EAGA,OAAA,EAkBA,MAAA2mB,GAAA/I,GAAA,OAAA,CAAA1d,EAAAgG,EAAAzD,KACA,MAAAU,OAAAA,EAAA4X,aAAAA,GAAAtY,EACA,OAAAmkB,GAAA1mB,EAAAgG,EAAAzD,GAAAokB,IAGA,MAAAC,EAAA5jB,EAAAC,EAAA4J,GAAA,CACA8Z,EAAA7Y,SAEA+Y,EAAAlgB,GAAA3G,EAAA,OACAqmB,EAAAQ,EACA5gB,EAAA,MAAA,IAAA4gB,EAAAhnB,KACAO,EAAAymB,EAAAp6F,MAAAqzE,SAAA,GACA+mB,EAAAvmB,KACA,KACAiC,EAAA2Y,mBAAAmL,IAMAA,EAAA55F,MAAAg2F,GAAA4D,EAAA55F,MAAA81E,IAEA,MAAAukB,EAAA,IAAAH,EAAA7Y,OAAAjO,MACA8mB,EAAA7Y,OAAAmB,UAAA,EACA8X,EAAAD,EACA,GACAD,EACA,IACA,IAGA,OAFAF,EAAA5iB,YAAAyK,EAAAjM,EAAAU,EAAA6I,QAAAr9E,EAAAm4F,EAAAG,EACA,QAAAt4F,OAAAA,GAAA,GAAAq4F,EAAA9mB,EAAAK,KACA,KAEA,IAAA2mB,EACA,MAAAC,EAAA1V,GAAAvR,IACAsC,SAAAA,GAAAqkB,EAEAM,GACAjnB,EAAAsC,SAAA3C,MAAA6F,IACA,GAAA,IAAAA,EAAA3F,KAAA,CACA,MAAA9xE,EAAA44E,GAAAnB,EAAA,OACA,GAAAz3E,EAEA,OADAw0E,EAAA/zE,QAAAuyE,EAAA,GAAAhzE,EAAAsyE,OACA,MAKA,MAAA6mB,EAAA,IAAA5kB,EAAAtE,QAAA,IAAAsE,EAAA,GAAAzC,KACAsnB,EAAA3V,GAAAxR,GACAA,EACAinB,GACA,IAAAjnB,EAAAsC,SAAAtE,QACAwT,GAAAxR,EAAAsC,SAAA,IACAtC,EAAAsC,SAAA,GACA,KACA6kB,GAEAH,EAAAG,EAAApjB,YACAkjB,GAAAZ,GAIA5U,GAAAuV,EAAAX,EAAA9jB,IAGA2kB,EAGAF,EAAAxY,EAAAjM,EAAAU,EAAA6I,GAAAua,EAAAtX,EAAA,CAAAsX,SAAA53F,EAAAuxE,EAAAsC,SAAA,UACA7zE,OAAAA,GAAA,IAKAu4F,EAAA1kB,EAAA,GACAyB,YACAkjB,GAAAZ,GACA5U,GAAAuV,EAAAX,EAAA9jB,GAEAykB,EAAArY,WAAAmY,IACAE,EAAArY,SAEAkM,EAAA1O,GACA0O,EAAAzO,IAIAyO,EAAAxO,IAGA2a,EAAArY,SAAAmY,EACAE,EAAArY,SACA1L,EAAAkJ,GACAlJ,EAAAmJ,IAGAnJ,EAAAoJ,IAGAua,EAAAxX,UAAAvL,KAAAwL,EAAA+X,GAAAT,EAAAU,aAAAL,GAAA,WAKA,SAAAN,GAAA1mB,EAAAgG,EAAAzD,EAAAujB,GACA,IAAA9f,EAAA1F,IAEA,YADAiC,EAAA/zE,QAAAuyE,EAAA,GAAAiF,EAAA3F,MAGA,MAAAgnB,EAAAC,GAGAthB,EAAA1F,IAAAiC,GACA,IAAA8kB,EAEA,YADA9kB,EAAA/zE,QAAAuyE,EAAA,GAAAiF,EAAA3F,MAGA,MAAAknB,eAAAA,EAAAC,kBAAAA,EAAAhlB,OAAAA,GAAAD,GACAuL,OAAAA,EAAArhF,MAAAA,EAAAsB,IAAAA,EAAAuwE,MAAAA,GAAA+oB,EACAV,EAAA,CACA9mB,KAAA,GACAQ,IAAA2F,EAAA3F,IACAyN,OAAAA,EACA2Z,WAAAh7F,EACAi7F,SAAA35F,EACA45F,iBAAArpB,EACA+oB,YAAAA,EACA/kB,SAAAiP,GAAAvR,GAAAA,EAAAsC,SAAA,CAAAtC,IAEAuC,EAAAyjB,YAAAW,GAEAnkB,EAAAyZ,OACA1Z,EAAA2Y,oBAGAzuF,GAAA86F,EAAA96F,GACAsB,GAAAw5F,EAAAx5F,GACAuwE,GAAAipB,EAAAjpB,IAEA,MAAAif,EAAAuI,GAAAA,EAAAa,GACA,MAAA,KACAnkB,EAAAyZ,OACA1Z,EAAA2Y,oBACAzuF,GAAA+6F,EAAA/6F,GACAsB,GAAAy5F,EAAAz5F,GACAuwE,GAAAkpB,EAAAlpB,IAEAif,GACAA,KAGA,MAAAqK,GAAA,qCAGAC,GAAA,iCACAC,GAAA,WACA,SAAAR,GAAAS,EAAAxlB,GACA,MAAAlC,EAAA0nB,EAAA1nB,IACAC,EAAAynB,EAAAjoB,QACAkoB,EAAA1nB,EAAA+V,MAAAuR,IACA,IAAAI,EACA,OACA,MAAA,CAAAC,EAAAC,GAAAF,EACArkB,EAAA,CACAmK,OAAAqa,GAAA9nB,EAAA6nB,EAAA3X,OAAAjQ,EAAAiE,QAAA2jB,EAAAD,EAAAjqB,SACAvxE,WAAAgC,EACAV,SAAAU,EACA6vE,WAAA7vE,GAEA8zE,EAAA2Y,oBACAvX,EAAAmK,OAAA2U,GAAA9e,EAAAmK,OAAAvL,IAEA,IAAA6lB,EAAAH,EAAA1X,OACA0B,QAAA6V,GAAA,IACAvX,OACA,MAAA8X,EAAAJ,EAAA1jB,QAAA6jB,GACAE,EAAAF,EAAA/R,MAAAwR,IACA,GAAAS,EAAA,CACAF,EAAAA,EAAAnW,QAAA4V,GAAA,IAAAtX,OACA,MAAAgY,EAAAD,EAAA,GAAA/X,OACA,IAAAiY,EAQA,GAPAD,IACAC,EAAAloB,EAAAiE,QAAAgkB,EAAAF,EAAAD,EAAApqB,QACA2F,EAAA51E,IAAAo6F,GAAA9nB,EAAAkoB,EAAAC,GACAjmB,EAAA2Y,oBACAvX,EAAA51E,IAAA00F,GAAA9e,EAAA51E,IAAAw0E,GAAA,KAGA+lB,EAAA,GAAA,CACA,MAAAG,EAAAH,EAAA,GAAA/X,OACAkY,IACA9kB,EAAArF,MAAA6pB,GAAA9nB,EAAAooB,EAAAnoB,EAAAiE,QAAAkkB,EAAA9kB,EAAA51E,IACAy6F,EAAAD,EAAAvqB,OACAqqB,EAAAD,EAAApqB,SACAuE,EAAA2Y,oBACAvX,EAAArF,MAAAmkB,GAAA9e,EAAArF,MAAAiE,GAAA,MAWA,OANA6lB,IACAzkB,EAAAl3E,MAAA07F,GAAA9nB,EAAA+nB,EAAAC,GACA9lB,EAAA2Y,oBACAvX,EAAAl3E,MAAAg2F,GAAA9e,EAAAl3E,MAAA81E,GAAA,KAGAoB,EAEA,SAAAwkB,GAAAO,EAAA5oB,EAAAhC,GACA,OAAAsC,EAAAN,GAAA,EAAA0Q,GAAAkY,EAAA5qB,EAAAgC,EAAA9B,SAEA,SAAAopB,IAAA36F,MAAAA,EAAAsB,IAAAA,EAAAuwE,MAAAA,IACA,MAAAgR,EAAA,GAmBA,OAlBA7iF,GACA6iF,EAAAzL,KAAAp3E,GAEAsB,IACAtB,GACA6iF,EAAAzL,KAAAzD,EAAA,KAAA,IAEAkP,EAAAzL,KAAA91E,IAEAuwE,IACAvwE,IACAtB,GACA6iF,EAAAzL,KAAAzD,EAAA,KAAA,IAEAkP,EAAAzL,KAAAzD,EAAA,MAAA,KAEAkP,EAAAzL,KAAAvF,IAEAgR,EAGA,MAAAqZ,GAAAvoB,EAAA,aAAA,GAQAwoB,GAAA,CAAA5oB,EAAAuC,KACA,GAAA,IAAAvC,EAAAH,OACA,IAAAG,EAAA8D,SACA,IAAA9D,EAAA8D,SAAA,CAGA,MAAArB,EAAAwO,GAAAjR,EAAA,QACA,GAAAyC,EAAA,CACA,MAAAomB,EAAApmB,EAAAnC,IAKA,OAJAiC,EAAA2Y,mBACA2N,GAAAtmB,EAAAglB,eAAAsB,GAEAtmB,EAAAC,OAAAC,QACA,KACAF,EAAA2Y,mBACA2N,GAAAtmB,EAAAilB,kBAAAqB,GAEAtmB,EAAAC,OAAAC,YAOAqmB,GAAA,CAAA9oB,EAAAuC,KACA,IAAA0Z,EACA,GAAA1K,GAAAvR,IACAA,EAAAN,MAAAC,KAAA2R,MACA2K,EAAAhL,GAAAjR,EAAA,QAAA,CACA,MAAA2D,EAAAsY,EAAAoL,YAAAC,GAAArL,EAAA3b,IAAAiC,GACA,GAAAoB,EAAA,CACA,MAAAl3E,MAAAA,EAAAsB,IAAAA,EAAAuwE,MAAAA,GAAAqF,GACA4jB,eAAAA,EAAAC,kBAAAA,GAAAjlB,EAIA,OAHA91E,GAAA86F,EAAA96F,GACAsB,GAAAw5F,EAAAx5F,GACAuwE,GAAAipB,EAAAjpB,GACA,KACA7xE,GAAA+6F,EAAA/6F,GACAsB,GAAAy5F,EAAAz5F,GACAuwE,GAAAkpB,EAAAlpB,OAKAyqB,GAAA,CAAArpB,EAAA4C,EAAAjC,IAAAgP,EAAA3P,EAAA4C,GAAA,GAAA,EAAAA,EAAAtE,OAAAsE,EAAA,GAAAjC,IAAAA,GAGA,SAAA2oB,GAAAhpB,EAAAuC,EAAA0mB,EAAAF,IACAxmB,EAAAU,OAAAwK,GACA,MAAAnL,SAAAA,EAAAjC,IAAAA,GAAAL,EACAkpB,EAAA,GACAC,EAAA,GAGA,IAAAC,EAAA7mB,EAAAC,OAAAC,MAAA,GAAAF,EAAAC,OAAAyZ,KAAA,GAGA1Z,EAAA+Y,KAAA/Y,EAAA2Y,oBACAkO,EAAAlX,GAAAlS,EAAAuC,EAAAyZ,cAIA,MAAAqN,EAAApY,GAAAjR,EAAA,QAAA,GACA,GAAAqpB,EAAA,CACA,MAAAlpB,IAAAA,EAAAG,IAAAA,GAAA+oB,EACAlpB,IAAA+B,GAAA/B,KACAipB,GAAA,GAEAF,EAAArlB,KAAAoC,EAAA9F,GAAAC,EAAA,WAAA,GAAA6oB,EAAA3oB,EAAAgC,EAAAjC,KAIA,IAAAipB,GAAA,EACAC,GAAA,EACA,MAAAC,EAAA,GACAC,EAAA,IAAA/R,IACA,IAAA,IAAAxX,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAwpB,EAAApnB,EAAApC,GACA,IAAAypB,EACA,IAAApY,GAAAmY,MACAC,EAAA1Y,GAAAyY,EAAA,QAAA,IAAA,CAEA,IAAAA,EAAA7pB,MACA2pB,EAAA3lB,KAAA6lB,GAEA,SAEA,GAAAL,EAAA,CAEA9mB,EAAA/zE,QAAAuyE,EAAA,GAAA4oB,EAAAtpB,MACA,MAEAipB,GAAA,EACA,MAAAhnB,SAAAsnB,EAAAvpB,IAAAwpB,GAAAH,GACAvpB,IAAA2pB,EAAA1pB,EAAA,WAAA,GAAAE,IAAAuoB,EAAAxoB,IAAA0pB,GAAAJ,EAEA,IAAAK,EACA9nB,GAAA4nB,GACAE,EAAAF,EAAAA,EAAAhqB,QAAA,UAGAspB,GAAA,EAEA,MAAAa,EAAAhB,EAAAJ,EAAAe,EAAAC,GAEA,IAAAK,EACAC,EACAlO,EACA,GAAAiO,EAAAjZ,GAAAyY,EAAA,MACAN,GAAA,EACAD,EAAAtlB,KAAA6L,GAAAwa,EAAA5pB,IAAA8pB,GAAAN,EAAAG,GAAAtB,UAEA,GAAAwB,EAAAlZ,GAAAyY,EAAA,gBAAA,GAAA,CAEA,IACAxT,EADAmU,EAAAnqB,EAEA,KAAAmqB,MACAnU,EAAA5T,EAAA+nB,GACA,IAAAnU,EAAArW,QAIA,GAAAqW,GAAA3E,GAAA2E,IAAAjF,GAAAiF,EAAA,MAAA,CAEA5T,EAAAkB,OAAAtD,EAAA,GACAA,IAEA,IAAAoqB,EAAAnB,EAAAA,EAAAnrB,OAAA,GACA,KAAA,KAAAssB,EAAA1a,UAAA/P,MACAyqB,EAAAA,EAAA1a,UAEA0a,EAAA1a,UAAAua,EAAA7pB,IACAoP,GAAAya,EAAA7pB,IAAA8pB,GAAAN,EAAAG,GAAAtB,IACAyB,GAAAN,EAAAG,QAGA1nB,EAAA/zE,QAAAuyE,EAAA,GAAAopB,EAAA9pB,WAGA,GAAA4b,EAAAhL,GAAAyY,EAAA,OAAA,CACAN,GAAA,EACA,MAAA/B,EAAApL,EAAAoL,aACAC,GAAArL,EAAA3b,IAAAiC,GACA8kB,EAGA8B,EAAAtlB,KAAAb,EAAAT,EAAAU,OAAA4J,GAAA,CACAwa,EAAAvZ,OACAuB,EAAA+X,GAAAC,GAAA+C,GAAAN,EAAAG,IAAA,MAIA1nB,EAAA/zE,QAAAuyE,EAAA,GAAAkb,EAAA5b,UAGA,CAEA,GAAA2pB,EAAA,CACA,GAAAP,EAAA3R,IAAAkS,GAAA,CACAznB,EAAA/zE,QAAAuyE,EAAA,GAAAgpB,IACA,SAEAN,EAAA1R,IAAAiS,GACA,YAAAA,IACAT,GAAA,GAGAL,EAAArlB,KAAAoC,EAAA6jB,EAAAG,KAGA,IAAAZ,EAAA,CACA,MAAAkB,EAAA,CAAA7qB,EAAA4C,KACA,MAAAqb,EAAAsL,EAAAvpB,EAAA4C,EAAAjC,GAIA,OAHAkC,EAAAgR,eACAoK,EAAA4D,iBAAA,GAEAtb,EAAA,UAAA0X,IAEA2L,EAIAE,EAAAxrB,QAIAwrB,EAAA7pB,MAAAK,GAAAwqB,GAAAxqB,OAEAupB,EACAhnB,EAAA/zE,QAAAuyE,EAAA,GAAAyoB,EAAA,GAAAnpB,MAGA6oB,EAAArlB,KAAA0mB,OAAA97F,EAAA+6F,KAZAN,EAAArlB,KAAA0mB,OAAA97F,EAAA6zE,IAgBA,MAAAmoB,EAAArB,EACA,EACAsB,GAAA1qB,EAAAsC,UACA,EACA,EACA,IAAAqoB,EAAA5b,EAAAma,EAAA0B,OAAA3kB,EAAA,IAGA7F,EAAAqqB,EAAA,IAAA,KAAApqB,GAOA,OANA8oB,EAAAnrB,SACA2sB,EAAA3nB,EAAAT,EAAAU,OAAA8J,GAAA,CACA4d,EACA9b,EAAAsa,MAGA,CACAwB,MAAAA,EACAvB,gBAAAA,GAGA,SAAAgB,GAAAx+F,EAAA+xF,GACA,OAAA5O,EAAA,CACA9I,EAAA,OAAAr6E,GACAq6E,EAAA,KAAA0X,KAGA,SAAA+M,GAAApoB,GACA,IAAA,IAAApC,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAnB,EAAApC,GACA,OAAAuD,EAAA5D,MACA,KAAA,EACA,GAAA,IAAA4D,EAAAK,SACA,IAAAL,EAAAK,SACA4mB,GAAAjnB,EAAAnB,UACA,OAAA,EAEA,MACA,KAAA,EACA,GAAAooB,GAAAjnB,EAAA2O,UACA,OAAA,EACA,MACA,KAAA,GACA,KAAA,GACA,GAAAsY,GAAAjnB,EAAAnB,UACA,OAAA,GAIA,OAAA,EAEA,SAAAkoB,GAAAxqB,GACA,OAAA,IAAAA,EAAAH,MAAA,KAAAG,EAAAH,OAEA,IAAAG,EAAAH,OACAG,EAAAF,QAAAyQ,OACAia,GAAAxqB,EAAAF,UAKA,MAAA+qB,GAAA,IAAAC,QAEAC,GAAA,CAAA/qB,EAAAuC,IAGA,WAEA,GAAA,KADAvC,EAAAuC,EAAA6Z,aACAvc,MACA,IAAAG,EAAA8D,SACA,IAAA9D,EAAA8D,QACA,OAEA,MAAAvG,IAAAA,EAAAmC,MAAAA,GAAAM,EACAqa,EAAA,IAAAra,EAAA8D,QAGA,IAAAknB,EAAA3Q,EACA4Q,GAAAjrB,EAAAuC,GACA,IAAAhF,KAEA,IAAA2tB,EACAC,EACAC,EAEAC,EACAC,EACAC,EAHA9c,EAAA,EAIA+c,EARA5+F,EAAA2lF,SAAAyY,IAAAA,EAAA9b,SAAAzC,GAWAue,IAAAjf,GACAif,IAAAhf,IACAqO,IAKA,QAAA9c,GACA,kBAAAA,GAEAoJ,GAAA3G,EAAA,OAAA,IAEA,GAAAN,EAAA1B,OAAA,EAAA,CACA,MAAAytB,EAAAC,GAAA1rB,EAAAuC,GACA2oB,EAAAO,EAAA/rB,MACA+O,EAAAgd,EAAAhd,UACA6c,EAAAG,EAAAH,iBACA,MAAAjd,EAAAod,EAAApd,WACAkd,EACAld,GAAAA,EAAArQ,OACA6Q,EAAAR,EAAAlL,KAAA6C,GAmZA,SAAAA,EAAAzD,GACA,MAAAopB,EAAA,GACAC,EAAAf,GAAAtQ,IAAAvU,GACA,GAAA4lB,EAEAD,EAAA9nB,KAAAtB,EAAA4D,aAAAylB,QAEA,CAGA,MAAAC,EAAAC,GAAA9lB,EAAAp6E,KAAA22E,GACAspB,EACAF,EAAA9nB,KAAAgoB,IAIAtpB,EAAAU,OAAAyJ,GACAnK,EAAA8L,WAAA0J,IAAA/R,EAAAp6E,MACA+/F,EAAA9nB,KAAAmO,GAAAhM,EAAAp6E,KAAA,eAGA,MAAAy0E,IAAAA,GAAA2F,EACAA,EAAA1F,KACAqrB,EAAA9nB,KAAAmC,EAAA1F,KACA0F,EAAA7F,MACA6F,EAAA1F,KACAqrB,EAAA9nB,KAAA,UAEA8nB,EAAA9nB,KAAAmC,EAAA7F,MAEA,GAAA5zE,OAAAW,KAAA84E,EAAAxF,WAAAxC,OAAA,CACAgI,EAAA7F,MACA6F,EAAA1F,KACAqrB,EAAA9nB,KAAA,UAEA8nB,EAAA9nB,KAAA,WAEA,MAAAkoB,EAAA3rB,EAAA,QAAA,EAAAC,GACAsrB,EAAA9nB,KAAAkL,EAAA/I,EAAAxF,UAAA2C,KAAAkE,GAAApB,EAAAoB,EAAA0kB,KAAA1rB,IAEA,OAAAwO,EAAA8c,EAAA3lB,EAAA3F,KA3bA2rB,CAAAhmB,EAAAzD,WACA9zE,EAGA,GAAAuxE,EAAAsC,SAAAtE,OAAA,EAAA,CACAgtB,IAAA/e,IAOAuf,GAAA,EAEA/c,GAAA,MAOA,GALA4L,GAEA2Q,IAAAjf,GAEAif,IAAA/e,EACA,CACA,MAAA0e,MAAAA,EAAAvB,gBAAAA,GAAAJ,GAAAhpB,EAAAuC,GACA4oB,EAAAR,EACAvB,IACA3a,GAAA,WAGA,GAAA,IAAAzO,EAAAsC,SAAAtE,QAAAgtB,IAAAjf,EAAA,CACA,MAAAtI,EAAAzD,EAAAsC,SAAA,GACAzC,EAAA4D,EAAA5D,KAEAosB,EAAA,IAAApsB,GACA,IAAAA,EACAosB,GACA,IAAAnS,GAAArW,EAAAlB,KACAkM,GAAA,GAKA0c,EADAc,GAAA,IAAApsB,EACA4D,EAGAzD,EAAAsC,cAIA6oB,EAAAnrB,EAAAsC,SAIA,IAAAmM,IAEA2c,EAAAhsB,OAAAqP,GAEA6c,GAAAA,EAAAttB,SACAqtB,EAoYA,SAAA3rB,GACA,IAAAwsB,EAAA,IACA,IAAA,IAAAhsB,EAAA,EAAA4hB,EAAApiB,EAAA1B,OAAAkC,EAAA4hB,EAAA5hB,IACAgsB,GAAAtrB,KAAAC,UAAAnB,EAAAQ,IACAA,EAAA4hB,EAAA,IACAoK,GAAA,MAEA,OAAAA,EAAA,IA3YAC,CAAAb,KAGAtrB,EAAA+D,YAAAyK,EAAAjM,EAAAyoB,EAAAE,EAAAC,EAAAC,EAAAC,EAAAE,IAAAC,GAAA,EAAAxrB,EAAAK,MAGA,SAAA4qB,GAAAjrB,EAAAuC,EAAA+Y,GAAA,GACA,IAAA/d,IAAAA,GAAAyC,EAEA,MAAAosB,EAAAC,GAAA9uB,GACA+uB,EAAA3lB,GAAA3G,EAAA,QAAAosB,GAAAnb,GAAAjR,EAAA,MACA,GAAAssB,EACA,GAAAF,GAAA,IAAAE,EAAAzsB,KAOA,CACA,MAAAS,EAAA,IAAAgsB,EAAAzsB,KACAysB,EAAA7/F,OAAA2zE,EAAAksB,EAAA7/F,MAAAqzE,SAAA,GACAwsB,EAAAhsB,IACA,GAAAA,EACA,OAAA0C,EAAAT,EAAAU,OAAAwJ,GAAA,CACAnM,SARA/C,EAAA+uB,EAAA7/F,MAAAqzE,QAAAmS,QAAA,QAAA,IAcA,MAAAsa,EAAAtc,GAAA1S,IAAAgF,EAAAjD,mBAAA/B,GACA,GAAAgvB,EAKA,OAFAjR,GACA/Y,EAAAU,OAAAspB,GACAA,EAKA,CACA,MAAAV,EAAAC,GAAAvuB,EAAAgF,GACA,GAAAspB,EACA,OAAAA,EAIA,OAAAtpB,EAAAsZ,UACAjvF,EAAA86E,WAAA96E,EAAAkvF,SAAAve,MAAAgF,EAAAsZ,UACAtZ,EAAAU,OAAAuJ,GAIAjK,EAAA6L,WAAA2J,IAAAxa,EAAA,UACAyU,GAAAzU,EAAA,eAGAgF,EAAAU,OAAAuJ,GACAjK,EAAA6L,WAAA2J,IAAAxa,GACAyU,GAAAzU,EAAA,cAEA,SAAAuuB,GAAAlgG,EAAA22E,GACA,MAAAiqB,EAAAjqB,EAAAiZ,gBACA,IAAAgR,IAAA,IAAAA,EAAAC,gBACA,OAEA,MAAAC,EAAA9/F,EAAAkvF,SAAAlwF,GACA+gG,EAAA//F,EAAA86E,WAAAglB,GACAE,EAAA/sB,GACA2sB,EAAA5gG,KAAAi0E,EACAj0E,EAEA4gG,EAAAE,KAAA7sB,EACA6sB,EAEAF,EAAAG,KAAA9sB,EACA8sB,OADA,EAIAE,EAAAD,EAAA,eACA,GAAAC,EACA,OAAAtqB,EAAAmZ,OAEAmR,EACA,UAAAjsB,KAAAC,UAAAgsB,MAEA,MAAAC,EAAAF,EAAA,cACAA,EAAA,cACAA,EAAA,mBACA,OAAAE,EACAvqB,EAAAmZ,OAEA,GAAAnZ,EAAA4D,aAAAuH,MAAAof,KACA,UAAAlsB,KAAAC,UAAAisB,WAJA,EAOA,SAAApB,GAAA1rB,EAAAuC,EAAA7C,EAAAM,EAAAN,MAAA4b,GAAA,GACA,MAAA/d,IAAAA,EAAA8C,IAAA0sB,GAAA/sB,EACAqa,EAAA,IAAAra,EAAA8D,QACA,IAAAkL,EAAA,GACA,MAAAge,EAAA,GACAC,EAAA,GAEA,IAAAxe,EAAA,EACAye,GAAA,EACAC,GAAA,EACAC,GAAA,EACAC,GAAA,EACAC,GAAA,EACAC,GAAA,EACA,MAAAjC,EAAA,GACAkC,EAAA,EAAAz/F,IAAAA,EAAAtB,MAAAA,MACA,GAAAy1E,GAAAn0E,GAAA,CACA,MAAAnC,EAAAmC,EAAA+xE,QACA2tB,EAAA7gG,EAAA8gG,KAAA9hG,GAeA,GAdAyuF,IACAoT,GAGA,YAAA7hG,EAAAu2E,eAEA,wBAAAv2E,GAEAgB,EAAA+gG,eAAA/hG,KACAyhG,GAAA,GAEAI,GAAA7gG,EAAA+gG,eAAA/hG,KACA2hG,GAAA,GAEA,KAAA9gG,EAAAozE,OACA,IAAApzE,EAAAozE,MACA,IAAApzE,EAAAozE,OACAia,GAAArtF,EAAA81E,GAAA,EAEA,OAEA,QAAA32E,EACAshG,GAAA,EAEA,UAAAthG,GAAAyuF,EAGA,UAAAzuF,GAAAyuF,EAGA,QAAAzuF,GAAA0/F,EAAA9jB,SAAA57E,IACA0/F,EAAAznB,KAAAj4E,GAHAwhG,GAAA,EAHAD,GAAA,OAUAG,GAAA,GAGA,IAAA,IAAAptB,EAAA,EAAAA,EAAAR,EAAA1B,OAAAkC,IAAA,CAEA,MAAAwR,EAAAhS,EAAAQ,GACA,GAAA,IAAAwR,EAAA7R,KAAA,CACA,MAAAQ,IAAAA,EAAAz0E,KAAAA,EAAAa,MAAAA,GAAAilF,EACA,IAAA9M,GAAA,EAWA,GAVA,QAAAh5E,IACAshG,GAAA,EAIA3qB,EAAAmZ,SACA9W,GAAA,IAIA,OAAAh5E,IACAygG,GAAA9uB,IAAA9wE,GAAAA,EAAAqzE,QAAAoV,WAAA,SACA,SAEAlG,EAAAnL,KAAAoC,EAAA7F,EAAAx0E,GAAA,EAAA4kF,GAAAnQ,EAAA,EAAAz0E,EAAAoyE,SAAAoC,EAAA3zE,EAAAA,EAAAqzE,QAAA,GAAA8E,EAAAn4E,EAAAA,EAAA4zE,IAAAA,SAEA,CAEA,MAAAz0E,KAAAA,EAAAu0E,IAAAA,EAAAG,IAAAA,EAAAD,IAAAA,GAAAqR,EACAkc,EAAA,SAAAhiG,EACAiiG,EAAA,OAAAjiG,EAEA,GAAA,SAAAA,EAAA,CACAyuF,GACA9X,EAAA/zE,QAAAuyE,EAAA,GAAAV,IAEA,SAGA,GAAA,SAAAz0E,EACA,SAGA,GAAA,OAAAA,GACAgiG,GAAAvB,GAAA9uB,IAAA6T,GAAAjR,EAAA,MACA,SAGA,GAAA0tB,GAAAvS,EACA,SAGA,IAAAnb,IAAAytB,GAAAC,GAAA,CAEA,GADAP,GAAA,EACAhtB,EAKA,GAJA0O,EAAAhR,SACAgvB,EAAAnpB,KAAAkL,EAAA+e,GAAA9e,GAAA+d,IACA/d,EAAA,IAEA4e,EAAA,CAEA,GAAApa,GAAA,+BAAAjR,GAAA,CACAyqB,EAAAnb,QAAAvR,GACA,SAGA0sB,EAAAnpB,KAAAvD,QAIA0sB,EAAAnpB,KAAA,CACAhE,KAAA,GACAQ,IAAAA,EACA6O,OAAA3M,EAAAU,OAAAgK,GACAmC,UAAA,CAAA9O,UAKAiC,EAAA/zE,QAAAuyE,EAAA6sB,EACA,GACA,GAAAvtB,IAEA,SAEA,MAAA0tB,EAAAxrB,EAAAuF,oBAAAl8E,GACA,GAAAmiG,EAAA,CAEA,MAAAruB,MAAAA,EAAAmH,YAAAA,GAAAknB,EAAArc,EAAA1R,EAAAuC,IACA+Y,GAAA5b,EAAAvyE,QAAAqgG,GACAxe,EAAAnL,QAAAnE,GACAmH,IACAomB,EAAAppB,KAAA6N,GACA9kF,EAAAi4E,SAAAgC,IACAgkB,GAAArQ,IAAA9I,EAAA7K,SAMAomB,EAAAppB,KAAA6N,GAGA,IAAAA,EAAA7R,MACA,QAAA6R,EAAA9lF,MACA22E,EAAAC,OAAAyZ,KAAA,GACA3U,GAAA,qBAAA/E,EAAAmP,EAAArR,MACA2O,EAAAnL,KAAAoC,EAAA7F,EAAA,YAAA,GAAAA,EAAA,QAAA,KAGA,IAAA4tB,EAuCA,OArCAhB,EAAAhvB,QACAgR,EAAAhR,QACAgvB,EAAAnpB,KAAAkL,EAAA+e,GAAA9e,GAAA+d,IAGAiB,EADAhB,EAAAhvB,OAAA,EACAgF,EAAAT,EAAAU,OAAA+J,GAAAggB,EAAAD,GAIAC,EAAA,IAGAhe,EAAAhR,SACAgwB,EAAAjf,EAAA+e,GAAA9e,GAAA+d,IAGAO,EACA7e,GAAA,IAGA0e,IACA1e,GAAA,GAEA2e,IACA3e,GAAA,GAEA6c,EAAAttB,SACAyQ,GAAA,GAEA4e,IACA5e,GAAA,KAGA,IAAAA,GAAA,KAAAA,KACAye,GAAAK,GAAAN,EAAAjvB,OAAA,KACAyQ,GAAA,KAEA,CACA/O,MAAAsuB,EACA3f,WAAA4e,EACAxe,UAAAA,EACA6c,iBAAAA,GASA,SAAAwC,GAAA9e,GACA,MAAAif,EAAA,IAAAlS,IACAmS,EAAA,GACA,IAAA,IAAAhuB,EAAA,EAAAA,EAAA8O,EAAAhR,OAAAkC,IAAA,CACA,MAAAwR,EAAA1C,EAAA9O,GAEA,GAAA,IAAAwR,EAAA3jF,IAAA8xE,OAAA6R,EAAA3jF,IAAA62E,SAAA,CACAspB,EAAArqB,KAAA6N,GACA,SAEA,MAAA9lF,EAAA8lF,EAAA3jF,IAAA+xE,QACAquB,EAAAF,EAAA1T,IAAA3uF,GACAuiG,GACA,UAAAviG,GAAA,UAAAA,GAAAA,EAAAspF,WAAA,QACAkZ,GAAAD,EAAAzc,IAKAuc,EAAAzT,IAAA5uF,EAAA8lF,GACAwc,EAAArqB,KAAA6N,IAGA,OAAAwc,EAEA,SAAAE,GAAAD,EAAAE,GACA,KAAAF,EAAA1hG,MAAAozE,KACAsuB,EAAA1hG,MAAAqiF,SAAAjL,KAAAwqB,EAAA5hG,OAGA0hG,EAAA1hG,MAAAoiF,EAAA,CAAAsf,EAAA1hG,MAAA4hG,EAAA5hG,OAAA0hG,EAAA9tB,KAsDA,SAAAgsB,GAAA9uB,GACA,OAAAA,EAAA,GAAA4E,cAAA5E,EAAAY,MAAA,KAAA,YAGA,MAOAmwB,GAAA,SAIAxS,GAXA,CAAA6B,IACA,MAAAZ,EAAAxwF,OAAAU,OAAA,MACA,OAAAshG,GACAxR,EAAAwR,KACAxR,EAAAwR,GAAA5Q,EAAA4Q,KAOAC,EAAAD,GACAA,EAAAtc,QAAAqc,IAAA,CAAApa,EAAA1O,IAAAA,EAAAA,EAAAipB,cAAA,OAGAC,GAAA,CAAA1uB,EAAAuC,KACA,GAAAiP,GAAAxR,GAAA,CACA,MAAAsC,SAAAA,EAAAjC,IAAAA,GAAAL,GACA8pB,SAAAA,EAAAjB,UAAAA,GAAA8F,GAAA3uB,EAAAuC,GACAqsB,EAAA,CACArsB,EAAA2Y,kBAAA,cAAA,SACA4O,GAEAjB,GACA+F,EAAA/qB,KAAAglB,GAEAvmB,EAAAtE,SACA6qB,GACA+F,EAAA/qB,KAAA,MAEA+qB,EAAA/qB,KAAAwL,EAAA,GAAA/M,GAAA,GAAA,EAAAjC,KAEAkC,EAAA8C,UAAA9C,EAAA8Y,UACAwN,GACA+F,EAAA/qB,KAAA,MAEAvB,EAAAtE,QACA4wB,EAAA/qB,KAAA,aAEA+qB,EAAA/qB,KAAA,SAEA7D,EAAA+D,YAAAf,EAAAT,EAAAU,OAAA6J,GAAA8hB,EAAAvuB,KAGA,SAAAsuB,GAAA3uB,EAAAuC,GACA,IACAsmB,EADAiB,EAAA,YAEA,MAAA+E,EAAA,GACA,IAAA,IAAA3uB,EAAA,EAAAA,EAAAF,EAAAN,MAAA1B,OAAAkC,IAAA,CACA,MAAAD,EAAAD,EAAAN,MAAAQ,GACA,IAAAD,EAAAJ,KACAI,EAAAxzE,QACA,SAAAwzE,EAAAr0E,KACAk+F,EAAAlpB,KAAAC,UAAAZ,EAAAxzE,MAAAqzE,UAGAG,EAAAr0E,KAAAkwF,GAAA7b,EAAAr0E,MACAijG,EAAAhrB,KAAA5D,KAKA,SAAAA,EAAAr0E,MAAAwlF,GAAAnR,EAAAE,IAAA,QACAF,EAAAK,MACAwpB,EAAA7pB,EAAAK,MAGA,SAAAL,EAAAr0E,MAAAq0E,EAAAE,KAAA+B,GAAAjC,EAAAE,OACAF,EAAAE,IAAAL,QAAAgc,GAAA7b,EAAAE,IAAAL,UAEA+uB,EAAAhrB,KAAA5D,IAIA,GAAA4uB,EAAA7wB,OAAA,EAAA,CACA,MAAA0B,MAAAA,EAAA2O,WAAAA,GAAAqd,GAAA1rB,EAAAuC,EAAAssB,GACAhG,EAAAnpB,EACA2O,EAAArQ,QACAuE,EAAA/zE,QAAAuyE,EAAA,GAAAsN,EAAA,GAAAhO,MAGA,MAAA,CACAypB,SAAAA,EACAjB,UAAAA,GAIA,MAAAiG,GAAA,gEACA9nB,GAAA,CAAAhB,EAAAhG,EAAAuC,EAAAwsB,KACA,MAAA1uB,IAAAA,EAAAG,UAAAA,EAAAL,IAAAA,GAAA6F,EAIA,IAAAgpB,EACA,GAJAhpB,EAAA1F,KAAAE,EAAAxC,QACAuE,EAAA/zE,QAAAuyE,EAAA,GAAAV,IAGA,IAAAF,EAAAN,KACA,GAAAM,EAAAyE,SAAA,CACA,MAAAqqB,EAAA9uB,EAAAL,QAEAkvB,EAAA5uB,EAAAxzE,EAAAsiG,aAAAtiG,EAAAkvF,SAAAmT,KAAA,EAAA9uB,EAAAE,UAIA2uB,EAAA5sB,EAAA,CACA,GAAAG,EAAA4D,aAAAiH,MACAjN,EACA,WAMA6uB,EAAA7uB,EACA6uB,EAAA1sB,SAAAuP,QAAA,GAAAtP,EAAA4D,aAAAiH,OACA4hB,EAAA1sB,SAAAuB,KAAA,KAGA,IAAAvD,EAAA0F,EAAA1F,IACAA,IAAAA,EAAAR,QAAAyQ,SACAjQ,OAAA7xE,GAEA,IAAA0gG,EAAA5sB,EAAA4Y,gBAAA7a,EACA,GAAAA,EAAA,CACA,MAAA8uB,EAAA/e,GAAA/P,EAAAR,SACAuvB,IAAAD,GAAAN,GAAAtwB,KAAA8B,EAAAR,UACAwvB,EAAAhvB,EAAAR,QAAA0H,SAAA,KAEAjF,EAAA2Y,oBACAmU,GAAA9sB,EAAAglB,eAAA,UACAjnB,EAAA0F,EAAA1F,IAAAmiB,GAAAniB,EAAAiC,GAAA,EAAA+sB,GACAD,GAAA9sB,EAAAilB,kBAAA,UAGA2H,EACA5sB,EAAA4Y,iBAGA,IAAA7a,EAAAT,MAAAS,EAAA2O,UAAA,MAMAmgB,GAAA,IAAApvB,EAAA8D,WAGAoO,GAAA5R,EAAAiC,EAAAyZ,aAKAmT,GAAAC,IACA,IAAA9uB,EAAAT,KACAS,EAAAR,QAAA,GAAAQ,EAAAR,cAAAQ,EAAAR,mBAGAQ,EAAAgC,SAAA,IAAAhC,EAAAgC,SAAA,UAAAhC,EAAAgC,SAAA,gBAIA+sB,GAAAF,GAAAC,KAEA9uB,EAAA8B,EAAA,CACA,GAAAitB,EACA9sB,EAAAoZ,KACA,gBACA,UACApZ,EAAAoZ,KAAA,mBAAA,IAAA,kBAAA2T,EAAA,IAAA,MACAhvB,EACAgvB,EAAA,IAAA,OAIA,IAAApK,EAAA,CACAxlB,MAAA,CACAuG,EAAA+oB,EAAA1uB,GAAAF,EAAA,YAAA,EAAAC,MAaA,OATA0uB,IACA7J,EAAA6J,EAAA7J,IAEAiK,IAIAjK,EAAAxlB,MAAA,GAAAjzE,MAAA81E,EAAAwa,MAAAmI,EAAAxlB,MAAA,GAAAjzE,QAEAy4F,GAMAqK,GAAA,CAAAvpB,EAAAwpB,EAAAjtB,KACA,MAAAjC,IAAAA,EAAAE,UAAAA,EAAAH,IAAAA,GAAA2F,EACA7F,EAAA6F,EAAA7F,IAwBA,OAvBA,IAAAA,EAAAN,MACAM,EAAAmC,SAAAuP,QAAA,KACA1R,EAAAmC,SAAAuB,KAAA,YAEA1D,EAAAyE,WACAzE,EAAAL,QAAA,GAAAK,EAAAL,iBAIAU,EAAAgH,SAAA,WACA,IAAArH,EAAAN,KACAM,EAAAyE,SACAzE,EAAAL,QAAAlzE,EAAAkvF,SAAA3b,EAAAL,SAGAK,EAAAL,QAAA,GAAAyC,EAAA4D,aAAA+G,MAAA/M,EAAAL,YAIAK,EAAAmC,SAAAuP,QAAA,GAAAtP,EAAA4D,aAAA+G,OACA/M,EAAAmC,SAAAuB,KAAA,QAGAvD,GACA,IAAAA,EAAAT,OAAAS,EAAAR,QAAAyQ,QACAhO,EAAA/zE,QAAAuyE,EAAA,GAAAV,IACA,CACAX,MAAA,CAAAuG,EAAA9F,EAAAC,EAAA,IAAA,EAAAC,OAGA,CACAX,MAAA,CAAAuG,EAAA9F,EAAAG,MAMAmvB,GAAA,CAAAzvB,EAAAuC,KACA,GAAA,IAAAvC,EAAAH,MACA,IAAAG,EAAAH,MACA,KAAAG,EAAAH,MACA,KAAAG,EAAAH,KAGA,MAAA,KACA,MAAAyC,EAAAtC,EAAAsC,SACA,IAAAotB,EACAC,GAAA,EACA,IAAA,IAAAzvB,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAnB,EAAApC,GACA,GAAAmR,GAAA5N,GAAA,CACAksB,GAAA,EACA,IAAA,IAAAtF,EAAAnqB,EAAA,EAAAmqB,EAAA/nB,EAAAtE,OAAAqsB,IAAA,CACA,MAAAlU,EAAA7T,EAAA+nB,GACA,IAAAhZ,GAAA8E,GAaA,CACAuZ,OAAAjhG,EACA,MAdAihG,IACAA,EAAAptB,EAAApC,GAAA,CACAL,KAAA,EACAQ,IAAAoD,EAAApD,IACAiC,SAAA,CAAAmB,KAIAisB,EAAAptB,SAAAuB,KAAA,MAAAsS,GACA7T,EAAAkB,OAAA6mB,EAAA,GACAA,MASA,GAAAsF,IAKA,IAAArtB,EAAAtE,QACA,IAAAgC,EAAAH,OACA,IAAAG,EAAAH,MACA,IAAAG,EAAA8D,SAMA9D,EAAAN,MAAAwX,MAAAjX,GAAA,IAAAA,EAAAJ,OACA0C,EAAAuF,oBAAA7H,EAAAr0E,SAIA,aAAAo0E,EAAAzC,MAKA,IAAA,IAAA2C,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAnB,EAAApC,GACA,GAAAmR,GAAA5N,IAAA,IAAAA,EAAA5D,KAAA,CACA,MAAA+vB,EAAA,GAGA,IAAAnsB,EAAA5D,MAAA,MAAA4D,EAAA3D,SACA8vB,EAAA/rB,KAAAJ,GAGAlB,EAAA+Y,KACA,IAAAxB,GAAArW,EAAAlB,IACAqtB,EAAA/rB,KAAA,KAGAvB,EAAApC,GAAA,CACAL,KAAA,GACAC,QAAA2D,EACApD,IAAAoD,EAAApD,IACA0D,YAAAf,EAAAT,EAAAU,OAAAsJ,GAAAqjB,QAQAC,GAAA,IAAAC,QACAC,GAAA,CAAA/vB,EAAAuC,KACA,GAAA,IAAAvC,EAAAH,MAAAoR,GAAAjR,EAAA,QAAA,GAAA,CACA,GAAA6vB,GAAA/X,IAAA9X,GACA,OAIA,OAFA6vB,GAAA9X,IAAA/X,GACAuC,EAAAU,OAAAoK,GACA,KACA,MAAA2iB,EAAAztB,EAAA6Z,YACA4T,EAAAjsB,cACAisB,EAAAjsB,YAAAxB,EAAAwa,MAAAiT,EAAAjsB,aAAA,OAMAwC,GAAA,CAAAP,EAAAhG,EAAAuC,KACA,MAAAjC,IAAAA,EAAAH,IAAAA,GAAA6F,EACA,IAAA1F,EAEA,OADAiC,EAAA/zE,QAAAuyE,EAAA,GAAAiF,EAAA3F,MACA4vB,KAEA,MAAAxM,EAAAnjB,EAAAD,IAAAyN,OACAoiB,EAAA,IAAA5vB,EAAAT,KAAAS,EAAAR,QAAA2jB,EAGA0M,EAAA5tB,EAAAiZ,gBAAAiI,GACA2M,EAAA7tB,EAAAmZ,QACAyU,GACA,gBAAAA,EACA,IAAA9f,GAAA6f,KAAAE,EAEA,OADA7tB,EAAA/zE,QAAAuyE,EAAA,GAAAT,EAAAD,MACA4vB,KAEA,GAAA1tB,EAAA2Y,mBACA/K,GAAA+f,IACA3tB,EAAAyZ,YAAAkU,GAEA,OADA3tB,EAAA/zE,QAAAuyE,EAAA,GAAAT,EAAAD,MACA4vB,KAEA,MAAAI,EAAAlwB,GAAAC,EAAA,cAAA,GACA4uB,EAAA7uB,EACA+B,GAAA/B,GACA,YAAAA,EAAAL,UACAsC,EAAA,CAAA,iBAAAjC,IACA,sBACA,IAAAmwB,EACA,MAAAC,EAAAhuB,EAAAoZ,KAAA,gBAAA,SACA,GAAAyU,EACA,GAAA,cAAAD,EAEAG,EAAAluB,EAAA,CACA,GAAAmuB,SACAnwB,EAAAqjB,GAAA,EAAAnjB,EAAAD,KACA,yBAGA,CAGA,MAAAmwB,EAAA,cAAAL,EAAA,GAAA1M,aAAA,OACA6M,EAAAluB,EAAA,CACA,GAAAmuB,SAAAhuB,EAAA4D,aAAAwH,MAAA8V,QACArjB,EAAAqjB,GAAA,EAAAnjB,EAAAD,KACA,qBAAAmwB,YAKAF,EAAAluB,EAAA,CACA,GAAAmuB,SACAjwB,EACA,eAGA,MAAAZ,EAAA,CAEAuG,EAAAoqB,EAAArqB,EAAA1F,KAEA2F,EAAA+oB,EAAAsB,IASA,GANA/tB,EAAA2Y,mBACA3Y,EAAA4Y,gBACAjJ,GAAA5R,EAAAiC,EAAAyZ,eACAtc,EAAA,GAAAjzE,MAAA81E,EAAAwa,MAAArd,EAAA,GAAAjzE,QAGAu5E,EAAAxF,UAAAxC,QAAA,IAAAgC,EAAA8D,QAAA,CACA,MAAAtD,EAAAwF,EAAAxF,UACA2C,KAAA8U,IAAA9H,GAAA8H,GAAAA,EAAArX,KAAAC,UAAAoX,IAAA,WACA5U,KAAA,MACAotB,EAAAtwB,EACA+B,GAAA/B,GACA,GAAAA,EAAAL,mBACAsC,EAAA,CAAAjC,EAAA,mBACA,iBACAT,EAAAmE,KAAAoC,EAAAwqB,EAAArwB,EAAA,KAAAI,OAAA,EAAAwF,EAAA3F,IAAA,KAEA,OAAA4vB,GAAAvwB,IAEA,SAAAuwB,GAAAvwB,EAAA,IACA,MAAA,CAAAA,MAAAA,GAGA,MAAAgxB,GAAA,gBACAC,GAAA,CAAA3wB,EAAAuC,KACAiR,GAAA,kBAAAjR,KAGA,IAAAvC,EAAAH,MAGA+wB,GAAA5wB,EAAAF,QAAAyC,GAEA,IAAAvC,EAAAH,MACAG,EAAAN,MAAAvyE,SAAAukF,IACA,IAAAA,EAAA7R,MACA,QAAA6R,EAAA9lF,MACA8lF,EAAApR,KACAswB,GAAAlf,EAAApR,IAAAiC,QAKA,SAAAquB,GAAA5wB,EAAAuC,GACA,GAAA,IAAAvC,EAAAH,KACAgxB,GAAA7wB,EAAAuC,QAGA,IAAA,IAAArC,EAAA,EAAAA,EAAAF,EAAAsC,SAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAzD,EAAAsC,SAAApC,GACA,iBAAAuD,IAEA,IAAAA,EAAA5D,KACAgxB,GAAAptB,EAAAlB,GAEA,IAAAkB,EAAA5D,KACA+wB,GAAA5wB,EAAAuC,GAEA,IAAAkB,EAAA5D,MACA+wB,GAAAntB,EAAA3D,QAAAyC,KAKA,SAAAsuB,GAAA7wB,EAAAuC,GACA,MAAAjC,EAAAN,EAAAF,QACA,IAQA0F,EAAA0Q,EAAAhW,EAAA+kB,EARA6L,GAAA,EACAC,GAAA,EACAC,GAAA,EACAC,GAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACApU,EAAA,GACA,IAAA/c,EAAA,EAAAA,EAAAI,EAAAtC,OAAAkC,IAGA,GAFAgW,EAAA1Q,EACAA,EAAAlF,EAAA0Q,WAAA9Q,GACA4wB,EACA,KAAAtrB,GAAA,KAAA0Q,IACA4a,GAAA,QAEA,GAAAC,EACA,KAAAvrB,GAAA,KAAA0Q,IACA6a,GAAA,QAEA,GAAAC,EACA,KAAAxrB,GAAA,KAAA0Q,IACA8a,GAAA,QAEA,GAAAC,EACA,KAAAzrB,GAAA,KAAA0Q,IACA+a,GAAA,QAEA,GAAA,MAAAzrB,GACA,MAAAlF,EAAA0Q,WAAA9Q,EAAA,IACA,MAAAI,EAAA0Q,WAAA9Q,EAAA,IACAgxB,GACAC,GACAC,EAUA,CACA,OAAA5rB,GACA,KAAA,GACAurB,GAAA,EACA,MACA,KAAA,GACAD,GAAA,EACA,MACA,KAAA,GACAE,GAAA,EACA,MACA,KAAA,GACAI,IACA,MACA,KAAA,GACAA,IACA,MACA,KAAA,GACAD,IACA,MACA,KAAA,GACAA,IACA,MACA,KAAA,IACAD,IACA,MACA,KAAA,IACAA,IAGA,GAAA,KAAA1rB,EAAA,CAEA,IACAvF,EADAoqB,EAAAnqB,EAAA,EAGA,KAAAmqB,GAAA,IACApqB,EAAAK,EAAAgxB,OAAAjH,GACA,MAAApqB,GAFAoqB,KAKApqB,GAAAywB,GAAAlyB,KAAAyB,KACAgxB,GAAA,cAlDAxiG,IAAAw2F,GAEAoM,EAAAnxB,EAAA,EACA+kB,EAAA3kB,EAAAnC,MAAA,EAAA+B,GAAAqQ,QAGAghB,IAuDA,SAAAA,IACAtU,EAAApZ,KAAAvD,EAAAnC,MAAAkzB,EAAAnxB,GAAAqQ,QACA8gB,EAAAnxB,EAAA,EAEA,QAVAzxE,IAAAw2F,EACAA,EAAA3kB,EAAAnC,MAAA,EAAA+B,GAAAqQ,OAEA,IAAA8gB,GACAE,IAMAtU,EAAAjf,OAAA,CACA,IAAAkC,EAAA,EAAAA,EAAA+c,EAAAjf,OAAAkC,IACA+kB,EAAAuM,GAAAvM,EAAAhI,EAAA/c,GAAAqC,GAEAvC,EAAAF,QAAAmlB,GAGA,SAAAuM,GAAAlxB,EAAAwG,EAAAvE,GACAA,EAAAU,OAAA0J,GACA,MAAAzM,EAAA4G,EAAAvC,QAAA,KACA,GAAArE,EAAA,EAEA,OADAqC,EAAA0a,QAAAlF,IAAAjR,GACA,GAAAkL,GAAAlL,EAAA,aAAAxG,KAEA,CACA,MAAA10E,EAAAk7E,EAAA3I,MAAA,EAAA+B,GACAiP,EAAArI,EAAA3I,MAAA+B,EAAA,GAEA,OADAqC,EAAA0a,QAAAlF,IAAAnsF,GACA,GAAAomF,GAAApmF,EAAA,aAAA00E,IAAA,MAAA6O,EAAA,IAAAA,EAAAA,KAIA,SAAAsiB,GAAAvW,GACA,MAAA,CACA,CACA6U,GACA1K,GACAoB,GACAkK,MACAzV,EACA,CAEA4N,GACAtG,IAEA,GACAkM,GACA3D,GACAnC,GACA6G,IAEA,CACA1oB,GAAAC,GACA0qB,KAAAnC,GACAlpB,MAAAE,KAkCAl6E,EAAAslG,kBAAA/kG,EAAA+kG,kBACAtlG,EAAA6/E,gBAAAA,EACA7/E,EAAA6gF,SAAAA,EACA7gF,EAAA8gF,WAAAA,EACA9gF,EAAA+/E,aAAAA,EACA//E,EAAAigF,eAAAA,EACAjgF,EAAA0gF,aAAAA,EACA1gF,EAAA62E,cAAAA,EACA72E,EAAAkgF,YAAAA,EACAlgF,EAAAggF,aAAAA,EACAhgF,EAAAy/E,SAAAA,EACAz/E,EAAAshF,OAAAA,EACAthF,EAAA4/E,WAAAA,EACA5/E,EAAA2gF,YAAAA,EACA3gF,EAAA8/E,WAAAA,EACA9/E,EAAAkhF,aAAAA,EACAlhF,EAAAihF,cAAAA,EACAjhF,EAAAwgF,YAAAA,EACAxgF,EAAAygF,YAAAA,EACAzgF,EAAAmgF,kBAAAA,EACAngF,EAAAqgF,kBAAAA,EACArgF,EAAAogF,0BAAAA,EACApgF,EAAAsgF,eAAAA,EACAtgF,EAAAghF,mBAAAA,EACAhhF,EAAA2/E,SAAAA,EACA3/E,EAAA0/E,SAAAA,EACA1/E,EAAA+5E,kBAAAA,EACA/5E,EAAA4gF,YAAAA,EACA5gF,EAAA+gF,eAAAA,EACA/gF,EAAAqhF,MAAAA,EACArhF,EAAAohF,SAAAA,EACAphF,EAAAugF,gBAAAA,EACAvgF,EAAAmhF,cAAAA,EACAnhF,EAAAqkF,yBAAAA,GACArkF,EAAAwkF,4BAAAA,GACAxkF,EAAAulG,OAh8IA,SAAAtf,EAAA9J,GAEA,IAAA8J,EACA,MAAA,IAAAuf,MAAArpB,GAAA,kCA87IAn8E,EAAAu7E,YAhEA,SAAAn6E,EAAAC,EAAA,IACA,MAAAc,EAAAd,EAAAc,SAAA65E,EACAypB,EAAA,WAAApkG,EAAA+lF,KACAyH,GAAA,IAAAxtF,EAAAwtF,mBAAA4W,GACA5W,GAAAxtF,EAAAytF,eACA3sF,EAAAuyE,EAAA,KAEArzE,EAAA23E,UAAAysB,GACAtjG,EAAAuyE,EAAA,KAEA,MAAAgd,EAAAnxF,EAAAe,SAAAF,GAAAw6E,GAAAx6E,EAAAC,GAAAD,GACAo6E,EAAAC,GAAA2pB,GAAAvW,GAUA,OATAgC,GAAAa,EAAAnxF,EAAA0B,OAAA,GAAAZ,EAAA,CACAwtF,kBAAAA,EACArT,eAAA,IACAA,KACAn6E,EAAAm6E,gBAAA,IAEAC,oBAAAl7E,EAAA0B,OAAA,GAAAw5E,EAAAp6E,EAAAo6E,qBAAA,OAGA+W,GAAAd,EAAAnxF,EAAA0B,OAAA,GAAAZ,EAAA,CACAwtF,kBAAAA,MA2CA7uF,EAAA47E,UAAAA,GACA57E,EAAAq/F,WAAAA,GACAr/F,EAAA28F,WAAAA,GACA38F,EAAAi7E,mBAAAA,GACAj7E,EAAAwiF,sBAAAA,EACAxiF,EAAA0lG,2BA/hJA,SAAA9P,EAAAC,GACA,MAAA,CACAriB,KAAA,GACAoiB,KAAAA,EACAC,MAAAA,EACA7hB,IAAAwN,IA2hJAxhF,EAAA2lG,qBAvjJA,SAAAhzB,GACA,MAAA,CACAa,KAAA,GACAb,KAAAA,EACAqB,IAAAwN,IAojJAxhF,EAAAwjF,sBAAAA,GACAxjF,EAAA22E,qBAAAA,EACA32E,EAAA00E,oBAAAA,EACA10E,EAAA+1E,yBAAAA,EACA/1E,EAAAqjF,4BAAAA,GACArjF,EAAA+6F,oBAAAA,GACA/6F,EAAAgjF,yBAAAA,EACAhjF,EAAA4lG,kBAjjJA,SAAAzzB,EAAAmR,EAAAC,GACA,MAAA,CACA/P,KAAA,GACArB,KAAAA,EACAmR,WAAAA,EACAC,UAAAA,EACAvP,IAAAwN,IA4iJAxhF,EAAA6lG,oBArnJA,SAAApyB,EAAAO,GACA,MAAA,CACAR,KAAA,EACAQ,IAAAA,EACAP,QAAAlzE,EAAAe,SAAAmyE,GACAM,EAAAN,GAAA,EAAAO,GACAP,IAgnJAzzE,EAAA0iF,uBAAAA,EACA1iF,EAAA45E,qBAAAA,EACA55E,EAAA8lG,sBA7hJA,SAAA5iB,GACA,MAAA,CACA1P,KAAA,GACA0P,QAAAA,EACAlP,IAAAwN,IA0hJAxhF,EAAA6hF,WAAAA,EACA7hF,EAAA+lG,yBAtiJA,SAAAhQ,GACA,MAAA,CACAviB,KAAA,GACAuiB,YAAAA,EACA/hB,IAAAwN,IAmiJAxhF,EAAA+zE,uBAAAA,EACA/zE,EAAAqxF,mCAAAA,GACArxF,EAAAgmG,sBAjkJA,SAAAvjB,GACA,MAAA,CACAjP,KAAA,GACAiP,SAAAA,EACAzO,IAAAwN,IA8jJAxhF,EAAA2uF,uBAAAA,GACA3uF,EAAAmiF,gBAAAA,EACAniF,EAAA4kF,QAAAA,GACA5kF,EAAAs6E,SAAAA,GACAt6E,EAAAwyF,SAAAA,GACAxyF,EAAAolG,uBAAAA,GACAplG,EAAAmkF,cAAAA,GACAnkF,EAAAu6E,mBA77IA,SAAA5G,GACA,OAAAA,EAAAN,MAAAC,MAAAM,KAAA,IAAAA,EAAAJ,MACA,SAAAI,EAAAr0E,MACAq0E,EAAAE,KACA,IAAAF,EAAAE,IAAAN,MACAI,EAAAE,IAAAyE,aAy7IAv4E,EAAA6lF,YAAAA,GACA7lF,EAAAuhF,cAAAA,EACAvhF,EAAAolF,WAAAA,GACAplF,EAAA+kF,UAAAA,GACA/kF,EAAAkzE,cAAAA,GACAlzE,EAAA4jF,gBAAAA,GACA5jF,EAAAgkF,mBAAAA,GACAhkF,EAAA8jF,mBAAAA,GACA9jF,EAAAmlF,aAAAA,GACAnlF,EAAA61E,YAAAA,GACA71E,EAAAklF,eAAAA,GACAllF,EAAAglF,OAAAA,GACAhlF,EAAAilF,QAAAA,GACAjlF,EAAAwhF,QAAAA,EACAxhF,EAAAy5E,uBArFA,KAAA,CAAApG,MAAA,KAsFArzE,EAAAo2F,kBAAAA,GACAp2F,EAAAq6F,WAAAA,GACAr6F,EAAAi5F,UAAAA,GACAj5F,EAAAsiG,kBAAAA,GACAtiG,EAAAsD,uBAhvJA,SAAAw+E,GACA5hF,OAAA+lG,sBAAAnkB,GAAAhhF,SAAA8nF,IACArH,EAAAqH,GAAA9G,EAAA8G,OA+uJA5oF,EAAA4+F,qBAAAA,GACA5+F,EAAA2lF,eAAAA,GACA3lF,EAAAu8F,gBAAAA,GACAv8F,EAAAy8F,oBAAAA,GACAz8F,EAAA6wF,UAAAA,GACA7wF,EAAAkjG,cAAAA,GACAljG,EAAA0+F,iBAAAA,GACA1+F,EAAAm2F,oBAAAA,GACAn2F,EAAAk6E,eAAAA,GACAl6E,EAAA26E,YAAAA,GACA36E,EAAA8wF,aAAAA,GACA9wF,EAAAkmG,gBAnxIA,SAAAxkG,EAAAw0E,EAAAlC,KAAA8O,GAEA,GAAA,qBADAkE,GAAAtlF,EAAAw0E,GAEA,OAEA,MAAAmQ,QAAAA,EAAAC,KAAAA,GAAAH,GAAAzkF,GACAy6E,EAAA,gBAAAz6E,MAAA,mBAAA2kF,EAAAA,KAAAvD,GAAAuD,IAAAC,EAAA,gBAAAA,IAAA,KACA6f,EAAA,IAAA5pB,YAAAJ,GACAgqB,EAAApkG,KAAAL,EACAsyE,IACAmyB,EAAAnyB,IAAAA,GACAkC,EAAA7zE,OAAA8jG,4HC7oBA,aAGEpmG,EAAOC,QAAUC,EAAQ,8FCH3B,gCAWA,SAAA6wE,EAAiBoxB,EAAKkE,SACZtvB,EAAM52E,OAAOU,OAAO,MACpBwvF,EAAO8R,EAAI1V,MAAM,aACd3Y,EAAI,EAAGA,EAAIuc,EAAKze,OAAQkC,IAC7BiD,EAAIsZ,EAAKvc,KAAM,SAEZuyB,EAAmBC,KAASvvB,EAAIuvB,EAAIvwB,eAAiBuwB,KAASvvB,EAAIuvB,GAf7EnmG,OAAOC,eAAeH,EAAS,aAAA,CAAgBI,OAAO,UAqBhD2wF,EAAAA,8MAaA,eACA,WAMAuV,EAAAA,GACgB,WACC,YACE,aAGnBC,EAAuB,mMAGvB5O,EAAsC7mB,EAAQy1B,GAE9ClK,EAAQ,EACd,SAAAiJ,EAA2B7jB,EAAQC,EAAQ,EAAGhQ,EAAM+P,EAAO9P,cACjD60B,EAAQ/kB,EAAO+K,MAAM,aACvByD,EAAQ,QACNxX,EAAAA,WACG5E,EAAI,EAAGA,EAAI2yB,EAAM70B,OAAQkC,OAC9Boc,GAASuW,EAAM3yB,GAAGlC,OAAS,EACvBse,GAASvO,EAAAA,SACAsc,EAAInqB,EAAIwoB,EAAO2B,GAAKnqB,EAAIwoB,GAAS3qB,EAAMue,EAAO+N,IAAAA,IAC/CA,EAAI,GAAKA,GAAKwI,EAAM70B,OAAAA,eAElBgQ,EAAOqc,EAAI,EACjBvlB,EAAIjB,KAAAA,GAAQmK,IAAK,IAAMwQ,OAAO7f,KAAKD,IAAI,EAAIU,OAAO4O,GAAMhQ,OAAQ,SAAS60B,EAAMxI,YACzEyI,EAAaD,EAAMxI,GAAGrsB,UACxBqsB,IAAMnqB,EAAAA,OAEA6yB,EAAMhlB,GAASuO,EAAQwW,GAAc,EACrC90B,EAASW,KAAKD,IAAI,EAAGX,EAAMue,EAAQwW,EAAaC,EAAMh1B,EAAMgQ,GAClEjJ,EAAIjB,KAAAA,SAAM,IAAc2a,OAAOuU,GAAAA,IAAWvU,OAAOxgB,YAE5CqsB,EAAInqB,EAAAA,IACLnC,EAAMue,EAAAA,OACAte,EAASW,KAAKD,IAAIC,KAAKq0B,IAAIj1B,EAAMue,EAAOwW,GAAa,GAC3DhuB,EAAIjB,KAAAA,SAAM,IAAc2a,OAAOxgB,IAEnCse,GAASwW,EAAa,gBAM/BhuB,EAAIzB,KAAK,YAcd4vB,EAAAA,8EACAC,EAAqC/1B,EAAQ81B,GAI7CE,EAA8Bh2B,EAAQ81B,EAAAA,gJAItCG,EAAmB,kCACnBC,EAAAA,GACN,SAAAC,EAA2B1nG,MACnBynG,EAAoBE,eAAe3nG,UAC5BynG,EAAoBznG,SAEzB4nG,EAAWJ,EAAiB50B,KAAK5yE,UACnC4nG,GACAC,QAAQnrB,MAAAA,0BAAgC18E,KAEpCynG,EAAoBznG,IAAS4nG,QAEnCE,EAAAA,CACFC,cAAe,iBACfC,UAAW,QACXC,QAAS,MACTC,UAAW,cAKTC,EAAyC52B,EAAAA,yhBAezCgH,EAA4BhH,EAAAA,o+BAgBlC,SAAAiI,EAAwB34E,MAChBopF,EAAQppF,GAAAA,OACFq4E,EAAAA,WACG5E,EAAI,EAAGA,EAAIzzE,EAAMuxE,OAAQkC,IAAAA,OACxB8zB,EAAOvnG,EAAMyzE,GACbQ,EAAa0E,EAAez3E,GAASqmG,GAAQrzB,EAAiBqzB,GAAQA,MACxEtzB,YACW3yE,KAAO2yE,EACdoE,EAAI/2E,GAAO2yE,EAAW3yE,UAI3B+2E,KAEFyN,GAAS9lF,UACPA,QAGTwnG,EAAkB,gBAClBC,EAAsB,QAC5B,SAAAvzB,EAA0BF,SAChBykB,EAAAA,UACNzkB,EAAQoY,MAAMob,GAAiB9mG,SAAQ6mG,OAC/BA,EAAAA,OACMG,EAAMH,EAAKnb,MAAMqb,GACvBC,EAAIn2B,OAAS,IAAMknB,EAAIiP,EAAI,GAAG5jB,QAAU4jB,EAAI,GAAG5jB,YAGhD2U,EAEX,SAAA/f,EAAwBivB,OAChBlP,EAAM,OACLkP,SACMlP,YAEAn3F,KAAOqmG,EAAAA,OACR3nG,EAAQ2nG,EAAOrmG,GACfsmG,EAAgBtmG,EAAImnF,WAAAA,MAAmBnnF,EAAMiiF,GAAUjiF,IACzDJ,GAASlB,IACS,iBAAVA,GAAsBsnG,EAAyBM,MAEvDnP,GAAAA,GAAUmP,KAAiB5nG,aAG5By4F,EAEX,SAAAhgB,EAAwBz4E,OAChBq4E,EAAM,MACNn3E,GAASlB,GACTq4E,EAAMr4E,UAEDopF,EAAQppF,WACJyzE,EAAI,EAAGA,EAAIzzE,EAAMuxE,OAAQkC,IAAAA,OACxBQ,EAAawE,EAAez4E,EAAMyzE,IACpCQ,IACAoE,GAAOpE,EAAa,aAIvB6R,GAAS9lF,aACHb,KAAQa,EACXA,EAAMb,KACNk5E,GAAOl5E,EAAO,YAInBk5E,EAAIyL,aAKT+jB,EAAY,qlBAUZC,EAAW,qpBAUXC,EAAY,uEACZh3B,EAA0BL,EAAQm3B,GAClC72B,EAAyBN,EAAQo3B,GACjCl3B,EAA0BF,EAAQq3B,GAElCC,EAAW,UACjB,SAAA1vB,EAAoB2vB,SACVnG,EAAM,GAAKmG,EACXre,EAAQoe,EAASp2B,KAAKkwB,OACvBlY,SACMkY,MAGPoG,EACAr2B,EAFAyH,EAAO,GAGP6uB,EAAY,MACXt2B,EAAQ+X,EAAM/X,MAAOA,EAAQiwB,EAAIvwB,OAAQM,IAAAA,QAClCiwB,EAAIvd,WAAW1S,SACd,GACDq2B,EAAU,oBAET,GACDA,EAAU,mBAET,GACDA,EAAU,mBAET,GACDA,EAAU,kBAET,GACDA,EAAU,8BAKdC,IAAct2B,IACdyH,GAAQwoB,EAAIsG,UAAUD,EAAWt2B,IAErCs2B,EAAYt2B,EAAQ,EACpByH,GAAQ4uB,SAELC,IAAct2B,EAAQyH,EAAOwoB,EAAIsG,UAAUD,EAAWt2B,GAASyH,QAGpE+uB,EAAiB,2BACvB,SAAAC,EAA2BC,UAChBA,EAAI/iB,QAAQ6iB,EAAgB,IAGvC,SAAAG,EAA4Br1B,EAAGyS,MACvBzS,EAAE5B,SAAWqU,EAAErU,OAAAA,OACR,MACPk3B,GAAQ,UACHh1B,EAAI,EAAGg1B,GAASh1B,EAAIN,EAAE5B,OAAQkC,IACnCg1B,EAAQC,EAAWv1B,EAAEM,GAAImS,EAAEnS,WAExBg1B,EAEX,SAAAC,EAAoBv1B,EAAGyS,MACfzS,IAAMyS,EAAAA,OACC,MACP+iB,EAAaC,GAAOz1B,GACpB01B,EAAaD,GAAOhjB,MACpB+iB,GAAcE,WACPF,IAAcE,IAAa11B,EAAE21B,YAAcljB,EAAEkjB,aAExDH,EAAavf,EAAQjW,GACrB01B,EAAazf,EAAQxD,GACjB+iB,GAAcE,WACPF,IAAcE,IAAaL,EAAmBr1B,EAAGyS,MAE5D+iB,EAAa7iB,GAAS3S,GACtB01B,EAAa/iB,GAASF,GAClB+iB,GAAcE,EAAAA,KAETF,IAAeE,SACT,KAEQ/oG,OAAOW,KAAK0yE,GAAG5B,SACfzxE,OAAOW,KAAKmlF,GAAGrU,cAEvB,YAEAjwE,KAAO6xE,EAAAA,OACR41B,EAAU51B,EAAE2zB,eAAexlG,GAC3B0nG,EAAUpjB,EAAEkhB,eAAexlG,MAC5BynG,IAAYC,IACXD,GAAWC,IACZN,EAAWv1B,EAAE7xE,GAAMskF,EAAEtkF,WACf,UAIZqxE,OAAOQ,KAAOR,OAAOiT,GAEhC,SAAAqjB,EAAsBC,EAAKjD,UAChBiD,EAAIC,WAAU5B,GAAQmB,EAAWnB,EAAMtB,WAO5CntB,EAAmBmtB,GACP,MAAPA,EACD,GACAngB,GAASmgB,GACL9xB,KAAKC,UAAU6xB,EAAKmD,EAAU,GAC9Bz2B,OAAOszB,GAEfmD,EAAW,CAACC,EAAMpD,IAChBqD,GAAMrD,YAEMA,EAAIsD,SAAK,IAAStD,EAAIuD,WAAWx3B,QAAO,CAACw3B,GAAUloG,EAAK2kG,MAC5DuD,EAAAA,GAAWloG,QAAY2kG,EAChBuD,SAIVC,GAAMxD,YAECA,EAAIsD,SAAK,IAAStD,EAAIyD,YAG7B5jB,GAASmgB,IAAS7c,EAAQ6c,IAAS0D,GAAc1D,GAGnDA,EAFItzB,OAAOszB,GAWhBvO,EAAAA,CACF,SACA,mBACA,6BAEE1I,EAAAA,GACA4a,EAAAA,GACAxoG,EAAO,OAIPomF,EAAK,KAAM,EACXqiB,EAAO,YACP5I,EAAQ3/F,GAAQuoG,EAAK93B,KAAKzwE,GAC1BwoG,EAAmBxoG,GAAQA,EAAImnF,WAAW,aAC1C5mF,EAAS/B,OAAOiqG,OAChBC,EAAS,CAACd,EAAK1nG,WACXiyE,EAAIy1B,EAAIpxB,QAAQt2E,GAClBiyE,GAAK,GACLy1B,EAAInyB,OAAOtD,EAAG,IAGhBqzB,EAAiBhnG,OAAOmqG,UAAUnD,eAClCzQ,EAAS,CAAC4P,EAAK3kG,IAAQwlG,EAAeoD,KAAKjE,EAAK3kG,GAChD8nF,EAAU+gB,MAAM/gB,QAChBkgB,GAASrD,GAA8B,iBAAtBmE,GAAanE,GAC9BwD,GAASxD,GAA8B,iBAAtBmE,GAAanE,GAC9B2C,GAAU3C,GAAQA,aAAeoE,KACjCtS,GAAckO,GAAuB,mBAARA,EAC7B/kG,GAAY+kG,GAAuB,iBAARA,EAC3B7tB,GAAY6tB,GAAuB,iBAARA,EAC3BngB,GAAYmgB,GAAgB,OAARA,GAA+B,iBAARA,EAC3CqE,GAAarE,GACRngB,GAASmgB,IAAQlO,GAAWkO,EAAIsE,OAASxS,GAAWkO,EAAIuE,OAE7DC,GAAiB3qG,OAAOmqG,UAAUS,SAClCN,GAAgBpqG,GAAUyqG,GAAeP,KAAKlqG,GAC9C2qG,GAAa3qG,GAERoqG,GAAapqG,GAAO0xE,MAAM,GAAI,GAEnCi4B,GAAiB1D,GAA8B,oBAAtBmE,GAAanE,GACtC2E,GAAgBtpG,GAAQJ,GAASI,IAC3B,QAARA,GACW,MAAXA,EAAI,IACJ,GAAKoxE,SAASpxE,EAAK,MAAQA,EACzB4/F,GAA+BxwB,EAErC,uHAIMqxB,GAAuB7Q,UACnBZ,EAAQxwF,OAAOU,OAAO,aACnBshG,GACOxR,EAAMwR,KACHxR,EAAMwR,GAAO5Q,EAAG4Q,KAGjCD,GAAa,SAIbxS,GAAW0S,IAAqBD,GAC3BA,EAAItc,QAAQqc,IAAY,CAACpa,EAAG1O,IAAOA,EAAIA,EAAEipB,cAAgB,OAE9D6I,GAAc,aAIdtnB,GAAYwe,IAAqBD,GAAQA,EAAItc,QAAQqlB,GAAa,OAAOn1B,gBAIzEuF,GAAa8mB,IAAqBD,GAAQA,EAAI+C,OAAO,GAAG7C,cAAgBF,EAAIpwB,MAAM,KAIlF+wB,GAAeV,IAAqBD,GAASA,EAAAA,KAAW7mB,GAAW6mB,KAAK,KAExEgJ,GAAa,CAAC9qG,EAAO+qG,IAAa/qG,IAAU+qG,IAAa/qG,GAAUA,GAAS+qG,GAAaA,GACzFC,GAAiB,CAACC,EAAKv3B,aAChBD,EAAI,EAAGA,EAAIw3B,EAAI15B,OAAQkC,IAC5Bw3B,EAAIx3B,GAAGC,IAGTw3B,GAAM,CAACC,EAAK7pG,EAAKtB,KACnBF,OAAOC,eAAeorG,EAAK7pG,EAAAA,CACvB8pG,cAAc,EACdC,YAAY,EACZrrG,MAAAA,KAGFsrG,GAAYrF,UACR1lG,EAAIgrG,WAAWtF,UACduF,MAAMjrG,GAAK0lG,EAAM1lG,OAExBkrG,SACEC,GAAgB,IACVD,KACHA,GACyB,oBAAfE,WACDA,WACgB,oBAATC,KACHA,KACkB,oBAAXC,OACHA,YACkB,IAAXC,EACHA,EAAAA,IAI9BlsG,EAAQgqG,UAAYA,EACpBhqG,EAAQovF,UAAYA,EACpBpvF,EAAQ4nF,GAAKA,EACb5nF,EAAQwB,KAAOA,EACfxB,EAAQ+wF,eAAiBA,EACzB/wF,EAAQ83F,0BAA4BA,EACpC93F,EAAQyvF,SAAWA,GACnBzvF,EAAQq7E,WAAaA,GACrBr7E,EAAQsrG,IAAMA,GACdtrG,EAAQ04E,WAAaA,EACrB14E,EAAQ0oG,kBAAoBA,EAC5B1oG,EAAQiC,OAASA,EACjBjC,EAAQslG,kBAAoBA,EAC5BtlG,EAAQ8rG,cAAgBA,GACxB9rG,EAAQkrG,WAAaA,GACrBlrG,EAAQy2F,OAASA,EACjBz2F,EAAQ2jF,UAAYA,GACpB3jF,EAAQorG,eAAiBA,GACzBprG,EAAQwpF,QAAUA,EAClBxpF,EAAQ8mG,cAAgBA,EACxB9mG,EAAQgpG,OAASA,GACjBhpG,EAAQm4F,WAAaA,GACrBn4F,EAAQ23F,sBAAwBA,EAChC33F,EAAQmxE,UAAYA,EACpBnxE,EAAQgrG,aAAeA,GACvBhrG,EAAQ83E,YAAcA,EACtB93E,EAAQ0pG,MAAQA,GAChB1pG,EAAQkqG,gBAAkBA,EAC1BlqG,EAAQ0nG,yBAA2BA,EACnC1nG,EAAQkmF,SAAWA,GACnBlmF,EAAQqhG,KAAOA,EACfrhG,EAAQ+pG,cAAgBA,GACxB/pG,EAAQ0qG,UAAYA,GACpB1qG,EAAQshG,eAAiBA,GACzBthG,EAAQinG,kBAAoBA,EAC5BjnG,EAAQoxE,SAAWA,EACnBpxE,EAAQ6pG,MAAQA,GAChB7pG,EAAQ6mG,qBAAuBA,EAC/B7mG,EAAQsB,SAAWA,GACnBtB,EAAQw4E,SAAWA,GACnBx4E,EAAQgxE,UAAYA,EACpBhxE,EAAQ8oG,WAAaA,EACrB9oG,EAAQqpG,aAAeA,EACvBrpG,EAAQ8wE,QAAUA,EAClB9wE,EAAQ64E,eAAiBA,EACzB74E,EAAQ+4E,eAAiBA,EACzB/4E,EAAQ6qG,eAAiBA,GACzB7qG,EAAQs0E,iBAAmBA,EAC3Bt0E,EAAQqnG,eAAiBA,EACzBrnG,EAAQoqG,OAASA,EACjBpqG,EAAQsmG,cAAgBA,EACxBtmG,EAAQ84E,eAAiBA,EACzB94E,EAAQk5E,gBAAkBA,EAC1Bl5E,EAAQ6iG,aAAeA,GACvB7iG,EAAQ0rG,SAAWA,GACnB1rG,EAAQ+qG,UAAYA,GACpB/qG,EAAQwqG,aAAeA,iCCviBvBxqG,EAAAsyF,mBAAAryF,EAAA,8BAAAqyF,mBACAtyF,EAAAmsG,kBAAAlsG,EAAA,6BAAAksG,kBACAnsG,EAAAosG,WAAAnsG,EAAA,qBAAAmsG,6ICAA,IAAAC,EAAApsG,EAAA,gBACAqsG,EAAArsG,EAAA,UACAssG,EAAAtsG,EAAA,eAAAssG,SACAC,EAAAvsG,EAAA,kBAAAusG,YAUA,SAAAla,EAAAma,GACAA,IACAA,EAAA,IAEAC,KAAAC,MAAAL,EAAAM,OAAAH,EAAA,OAAA,MACAC,KAAAG,YAAAP,EAAAM,OAAAH,EAAA,aAAA,MACAC,KAAAI,gBAAAR,EAAAM,OAAAH,EAAA,kBAAA,GACAC,KAAAK,SAAA,IAAAR,EACAG,KAAAM,OAAA,IAAAT,EACAG,KAAAO,UAAA,IAAAT,EACAE,KAAAQ,iBAAA,KAGA5a,EAAA+X,UAAA8C,SAAA,EAOA7a,EAAA8a,cACA,SAAAC,GACA,IAAAC,EAAAD,EAAAC,WACAC,EAAA,IAAAjb,EAAA,CACAkb,KAAAH,EAAAG,KACAF,WAAAA,IA2CA,OAzCAD,EAAAI,aAAA,SAAAC,GACA,IAAAC,EAAA,CACAtb,UAAA,CACA1Q,KAAA+rB,EAAAE,cACAhsB,OAAA8rB,EAAAG,kBAIA,MAAAH,EAAAjsB,SACAksB,EAAAlsB,OAAAisB,EAAAjsB,OACA,MAAA6rB,IACAK,EAAAlsB,OAAA6qB,EAAAwB,SAAAR,EAAAK,EAAAlsB,SAGAksB,EAAAvb,SAAA,CACAzQ,KAAA+rB,EAAAK,aACAnsB,OAAA8rB,EAAAM,gBAGA,MAAAN,EAAAnuG,OACAouG,EAAApuG,KAAAmuG,EAAAnuG,OAIAguG,EAAAtb,WAAA0b,MAEAN,EAAAY,QAAAntG,SAAA,SAAAotG,GACA,IAAAC,EAAAD,EACA,OAAAZ,IACAa,EAAA7B,EAAAwB,SAAAR,EAAAY,IAGAX,EAAAR,SAAAthB,IAAA0iB,IACAZ,EAAAR,SAAArhB,IAAAyiB,GAGA,IAAA16B,EAAA45B,EAAAe,iBAAAF,GACA,MAAAz6B,GACA85B,EAAAhb,iBAAA2b,EAAAz6B,MAGA85B,GAaAjb,EAAA+X,UAAApY,WACA,SAAAwa,GACA,IAAApa,EAAAia,EAAAM,OAAAH,EAAA,aACAra,EAAAka,EAAAM,OAAAH,EAAA,WAAA,MACAhrB,EAAA6qB,EAAAM,OAAAH,EAAA,SAAA,MACAltG,EAAA+sG,EAAAM,OAAAH,EAAA,OAAA,MAEAC,KAAAI,iBACAJ,KAAA2B,iBAAAhc,EAAAD,EAAA3Q,EAAAliF,GAGA,MAAAkiF,IACAA,EAAA1O,OAAA0O,GACAirB,KAAAK,SAAAthB,IAAAhK,IACAirB,KAAAK,SAAArhB,IAAAjK,IAIA,MAAAliF,IACAA,EAAAwzE,OAAAxzE,GACAmtG,KAAAM,OAAAvhB,IAAAlsF,IACAmtG,KAAAM,OAAAthB,IAAAnsF,IAIAmtG,KAAAO,UAAAvhB,IAAA,CACAkiB,cAAAvb,EAAA1Q,KACAksB,gBAAAxb,EAAAzQ,OACAmsB,aAAA,MAAA3b,GAAAA,EAAAzQ,KACAqsB,eAAA,MAAA5b,GAAAA,EAAAxQ,OACAH,OAAAA,EACAliF,KAAAA,KAOA+yF,EAAA+X,UAAA9X,iBACA,SAAA+b,EAAAC,GACA,IAAA9sB,EAAA6sB,EACA,MAAA5B,KAAAG,cACAprB,EAAA6qB,EAAAwB,SAAApB,KAAAG,YAAAprB,IAGA,MAAA8sB,GAGA7B,KAAAQ,mBACAR,KAAAQ,iBAAAhtG,OAAAU,OAAA,OAEA8rG,KAAAQ,iBAAAZ,EAAAkC,YAAA/sB,IAAA8sB,GACA7B,KAAAQ,0BAGAR,KAAAQ,iBAAAZ,EAAAkC,YAAA/sB,IACA,IAAAvhF,OAAAW,KAAA6rG,KAAAQ,kBAAAv7B,SACA+6B,KAAAQ,iBAAA,QAqBA5a,EAAA+X,UAAAoE,eACA,SAAApB,EAAAiB,EAAAI,GACA,IAAAR,EAAAI,EAEA,GAAA,MAAAA,EAAA,CACA,GAAA,MAAAjB,EAAAG,KACA,MAAA,IAAAhI,MACA,iJAIA0I,EAAAb,EAAAG,KAEA,IAAAF,EAAAZ,KAAAG,YAEA,MAAAS,IACAY,EAAA5B,EAAAwB,SAAAR,EAAAY,IAIA,IAAAS,EAAA,IAAApC,EACAqC,EAAA,IAAArC,EAGAG,KAAAO,UAAA4B,iBAAA,SAAAnB,GACA,GAAAA,EAAAjsB,SAAAysB,GAAA,MAAAR,EAAAK,aAAA,CAEA,IAAA3b,EAAAib,EAAAyB,oBAAA,CACAntB,KAAA+rB,EAAAK,aACAnsB,OAAA8rB,EAAAM,iBAEA,MAAA5b,EAAA3Q,SAEAisB,EAAAjsB,OAAA2Q,EAAA3Q,OACA,MAAAitB,IACAhB,EAAAjsB,OAAA6qB,EAAAt1B,KAAA03B,EAAAhB,EAAAjsB,SAEA,MAAA6rB,IACAI,EAAAjsB,OAAA6qB,EAAAwB,SAAAR,EAAAI,EAAAjsB,SAEAisB,EAAAK,aAAA3b,EAAAzQ,KACA+rB,EAAAM,eAAA5b,EAAAxQ,OACA,MAAAwQ,EAAA7yF,OACAmuG,EAAAnuG,KAAA6yF,EAAA7yF,OAKA,IAAAkiF,EAAAisB,EAAAjsB,OACA,MAAAA,GAAAktB,EAAAljB,IAAAhK,IACAktB,EAAAjjB,IAAAjK,GAGA,IAAAliF,EAAAmuG,EAAAnuG,KACA,MAAAA,GAAAqvG,EAAAnjB,IAAAlsF,IACAqvG,EAAAljB,IAAAnsF,KAGAmtG,MACAA,KAAAK,SAAA4B,EACAjC,KAAAM,OAAA4B,EAGAvB,EAAAY,QAAAntG,SAAA,SAAAotG,GACA,IAAAz6B,EAAA45B,EAAAe,iBAAAF,GACA,MAAAz6B,IACA,MAAAi7B,IACAR,EAAA5B,EAAAt1B,KAAA03B,EAAAR,IAEA,MAAAZ,IACAY,EAAA5B,EAAAwB,SAAAR,EAAAY,IAEAxB,KAAAna,iBAAA2b,EAAAz6B,MAEAi5B,OAcApa,EAAA+X,UAAAgE,iBACA,SAAAU,EAAAC,EAAAC,EACAC,GAKA,GAAAF,GAAA,iBAAAA,EAAArtB,MAAA,iBAAAqtB,EAAAptB,OACA,MAAA,IAAA4jB,MACA,gPAMA,MAAAuJ,GAAA,SAAAA,GAAA,WAAAA,GACAA,EAAAptB,KAAA,GAAAotB,EAAAntB,QAAA,IACAotB,GAAAC,GAAAC,MAIAH,GAAA,SAAAA,GAAA,WAAAA,GACAC,GAAA,SAAAA,GAAA,WAAAA,GACAD,EAAAptB,KAAA,GAAAotB,EAAAntB,QAAA,GACAotB,EAAArtB,KAAA,GAAAqtB,EAAAptB,QAAA,GACAqtB,GAKA,MAAA,IAAAzJ,MAAA,oBAAAjxB,KAAAC,UAAA,CACA6d,UAAA0c,EACAttB,OAAAwtB,EACA7c,SAAA4c,EACAzvG,KAAA2vG,MASA5c,EAAA+X,UAAA8E,mBACA,WAcA,IAbA,IAOArlB,EACA4jB,EACA0B,EACAC,EAVAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAC,EAAA,EACAr4B,EAAA,GAMAs4B,EAAAlD,KAAAO,UAAA4C,UACAh8B,EAAA,EAAAi8B,EAAAF,EAAAj+B,OAAAkC,EAAAi8B,EAAAj8B,IAAA,CAIA,GAFAiW,EAAA,IADA4jB,EAAAkC,EAAA/7B,IAGA+5B,gBAAA2B,EAEA,IADAD,EAAA,EACA5B,EAAAE,gBAAA2B,GACAzlB,GAAA,IACAylB,SAIA,GAAA17B,EAAA,EAAA,CACA,IAAAy4B,EAAAyD,oCAAArC,EAAAkC,EAAA/7B,EAAA,IACA,SAEAiW,GAAA,IAIAA,GAAAuiB,EAAA2D,OAAAtC,EAAAG,gBACAyB,GACAA,EAAA5B,EAAAG,gBAEA,MAAAH,EAAAjsB,SACA4tB,EAAA3C,KAAAK,SAAA70B,QAAAw1B,EAAAjsB,QACAqI,GAAAuiB,EAAA2D,OAAAX,EAAAM,GACAA,EAAAN,EAGAvlB,GAAAuiB,EAAA2D,OAAAtC,EAAAK,aAAA,EACA0B,GACAA,EAAA/B,EAAAK,aAAA,EAEAjkB,GAAAuiB,EAAA2D,OAAAtC,EAAAM,eACAwB,GACAA,EAAA9B,EAAAM,eAEA,MAAAN,EAAAnuG,OACA6vG,EAAA1C,KAAAM,OAAA90B,QAAAw1B,EAAAnuG,MACAuqF,GAAAuiB,EAAA2D,OAAAZ,EAAAM,GACAA,EAAAN,IAIA93B,GAAAwS,EAGA,OAAAxS,GAGAgb,EAAA+X,UAAA4F,wBACA,SAAAC,EAAAC,GACA,OAAAD,EAAAp5B,KAAA,SAAA2K,GACA,IAAAirB,KAAAQ,iBACA,OAAA,KAEA,MAAAiD,IACA1uB,EAAA6qB,EAAAwB,SAAAqC,EAAA1uB,IAEA,IAAA//E,EAAA4qG,EAAAkC,YAAA/sB,GACA,OAAAvhF,OAAAmqG,UAAAnD,eAAAoD,KAAAoC,KAAAQ,iBAAAxrG,GACAgrG,KAAAQ,iBAAAxrG,GACA,OACAgrG,OAMApa,EAAA+X,UAAAvW,OACA,WACA,IAAAhd,EAAA,CACAs5B,QAAA1D,KAAAS,SACAc,QAAAvB,KAAAK,SAAA8C,UACAQ,MAAA3D,KAAAM,OAAA6C,UACAD,SAAAlD,KAAAyC,sBAYA,OAVA,MAAAzC,KAAAC,QACA71B,EAAA02B,KAAAd,KAAAC,OAEA,MAAAD,KAAAG,cACA/1B,EAAAw2B,WAAAZ,KAAAG,aAEAH,KAAAQ,mBACAp2B,EAAAw5B,eAAA5D,KAAAuD,wBAAAn5B,EAAAm3B,QAAAn3B,EAAAw2B,aAGAx2B,GAMAwb,EAAA+X,UAAAS,SACA,WACA,OAAAv2B,KAAAC,UAAAk4B,KAAA5Y,WAGA9zF,EAAAsyF,mBAAAA,sHCnYA,IAAAie,EAAAtwG,EAAA,YAsDAD,EAAAgwG,OAAA,SAAAQ,GACA,IACAC,EADAC,EAAA,GAGAC,EA3BA,SAAAH,GACA,OAAAA,EAAA,EACA,IAAAA,GAAA,GACA,GAAAA,GAAA,GAwBAI,CAAAJ,GAEA,GACAC,EAzCAI,GAyCAF,GACAA,KAhDA,GAiDA,IAGAF,GAjDA,IAmDAC,GAAAH,EAAAP,OAAAS,SACAE,EAAA,GAEA,OAAAD,GAOA1wG,EAAA8wG,OAAA,SAAAC,EAAAC,EAAAC,GACA,IAGAC,EAAAT,EAvCAD,EAEAW,EAkCAC,EAAAL,EAAAp/B,OACA2F,EAAA,EACA+5B,EAAA,EAGA,EAAA,CACA,GAAAL,GAAAI,EACA,MAAA,IAAA5L,MAAA,8CAIA,IAAA,KADAiL,EAAAF,EAAAO,OAAAC,EAAApsB,WAAAqsB,OAEA,MAAA,IAAAxL,MAAA,yBAAAuL,EAAA9L,OAAA+L,EAAA,IAGAE,KA7EA,GA6EAT,GAEAn5B,IADAm5B,GA3EAI,KA4EAQ,EACAA,GAnFA,QAoFAH,GAEAD,EAAA7wG,OAvDA+wG,GAFAX,EAyDAl5B,IAvDA,EADA,IAAA,EAAAk5B,IAGAW,EACAA,GAqDAF,EAAAK,KAAAN,mDCnIA,IAAAO,EAAA,mEAAA/kB,MAAA,IAKAxsF,EAAAgwG,OAAA,SAAAwB,GACA,GAAA,GAAAA,GAAAA,EAAAD,EAAA5/B,OACA,OAAA4/B,EAAAC,GAEA,MAAA,IAAAC,UAAA,6BAAAD,IAOAxxG,EAAA8wG,OAAA,SAAAY,GAiBA,OAhBA,IAgBAA,GAAAA,GAfA,GAgBAA,EAjBA,GAGA,IAkBAA,GAAAA,GAjBA,IAkBAA,EAnBA,GASA,GANA,IAoBAA,GAAAA,GAnBA,GAoBAA,EArBA,GAOA,GAJA,IAsBAA,EACA,GAtBA,IA0BAA,EACA,IAIA,iCCvCA1xG,EAAA4sG,OATA,SAAAH,EAAAyC,EAAAyC,GACA,GAAAzC,KAAAzC,EACA,OAAAA,EAAAyC,GACA,GAAA,IAAAnsB,UAAApR,OACA,OAAAggC,EAEA,MAAA,IAAAnM,MAAA,IAAA0J,EAAA,8BAKA,IAAA0C,EAAA,iEACAC,EAAA,gBAEA,SAAAC,EAAAC,GACA,IAAA/nB,EAAA+nB,EAAA/nB,MAAA4nB,GACA,OAAA5nB,EAGA,CACAgoB,OAAAhoB,EAAA,GACAioB,KAAAjoB,EAAA,GACAkoB,KAAAloB,EAAA,GACAmoB,KAAAnoB,EAAA,GACA3qF,KAAA2qF,EAAA,IAPA,KAYA,SAAAooB,EAAAC,GACA,IAAAC,EAAA,GAiBA,OAhBAD,EAAAL,SACAM,GAAAD,EAAAL,OAAA,KAEAM,GAAA,KACAD,EAAAJ,OACAK,GAAAD,EAAAJ,KAAA,KAEAI,EAAAH,OACAI,GAAAD,EAAAH,MAEAG,EAAAF,OACAG,GAAA,IAAAD,EAAAF,MAEAE,EAAAhzG,OACAizG,GAAAD,EAAAhzG,MAEAizG,EAeA,SAAAC,EAAAC,GACA,IAAAnzG,EAAAmzG,EACAF,EAAAR,EAAAU,GACA,GAAAF,EAAA,CACA,IAAAA,EAAAjzG,KACA,OAAAmzG,EAEAnzG,EAAAizG,EAAAjzG,KAKA,IAHA,IAGAozG,EAHAC,EAAA1yG,EAAA0yG,WAAArzG,GAEAszG,EAAAtzG,EAAAmtF,MAAA,OACAomB,EAAA,EAAA/+B,EAAA8+B,EAAAhhC,OAAA,EAAAkC,GAAA,EAAAA,IAEA,OADA4+B,EAAAE,EAAA9+B,IAEA8+B,EAAAx7B,OAAAtD,EAAA,GACA,OAAA4+B,EACAG,IACAA,EAAA,IACA,KAAAH,GAIAE,EAAAx7B,OAAAtD,EAAA,EAAA++B,GACAA,EAAA,IAEAD,EAAAx7B,OAAAtD,EAAA,GACA++B,MAUA,MAJA,MAFAvzG,EAAAszG,EAAA37B,KAAA,QAGA33E,EAAAqzG,EAAA,IAAA,KAGAJ,GACAA,EAAAjzG,KAAAA,EACA+yG,EAAAE,IAEAjzG,EAoBA,SAAA23E,EAAA67B,EAAAL,GACA,KAAAK,IACAA,EAAA,KAEA,KAAAL,IACAA,EAAA,KAEA,IAAAM,EAAAhB,EAAAU,GACAO,EAAAjB,EAAAe,GAMA,GALAE,IACAF,EAAAE,EAAA1zG,MAAA,KAIAyzG,IAAAA,EAAAd,OAIA,OAHAe,IACAD,EAAAd,OAAAe,EAAAf,QAEAI,EAAAU,GAGA,GAAAA,GAAAN,EAAAxoB,MAAA6nB,GACA,OAAAW,EAIA,GAAAO,IAAAA,EAAAb,OAAAa,EAAA1zG,KAEA,OADA0zG,EAAAb,KAAAM,EACAJ,EAAAW,GAGA,IAAAC,EAAA,MAAAR,EAAAvN,OAAA,GACAuN,EACAD,EAAAM,EAAAjtB,QAAA,OAAA,IAAA,IAAA4sB,GAEA,OAAAO,GACAA,EAAA1zG,KAAA2zG,EACAZ,EAAAW,IAEAC,EAvIAhzG,EAAA8xG,SAAAA,EAsBA9xG,EAAAoyG,YAAAA,EAwDApyG,EAAAuyG,UAAAA,EA2DAvyG,EAAAg3E,KAAAA,EAEAh3E,EAAA0yG,WAAA,SAAAF,GACA,MAAA,MAAAA,EAAAvN,OAAA,IAAA2M,EAAAz/B,KAAAqgC,IAyCAxyG,EAAA8tG,SAhCA,SAAA+E,EAAAL,GACA,KAAAK,IACAA,EAAA,KAGAA,EAAAA,EAAAjtB,QAAA,MAAA,IAOA,IADA,IAAAqtB,EAAA,EACA,IAAAT,EAAAt6B,QAAA26B,EAAA,MAAA,CACA,IAAA5gC,EAAA4gC,EAAAxmB,YAAA,KACA,GAAApa,EAAA,EACA,OAAAugC,EAOA,IADAK,EAAAA,EAAA/gC,MAAA,EAAAG,IACA+X,MAAA,qBACA,OAAAwoB,IAGAS,EAIA,OAAA1I,MAAA0I,EAAA,GAAAj8B,KAAA,OAAAw7B,EAAAjgC,OAAAsgC,EAAAlhC,OAAA,IAIA,IAAAuhC,IAEA,cADAhzG,OAAAU,OAAA,OAIA,SAAAuyG,EAAAvqB,GACA,OAAAA,EA8BA,SAAAwqB,EAAAxqB,GACA,IAAAA,EACA,OAAA,EAGA,IAAAjX,EAAAiX,EAAAjX,OAEA,GAAAA,EAAA,EACA,OAAA,EAGA,GAAA,KAAAiX,EAAAjE,WAAAhT,EAAA,IACA,KAAAiX,EAAAjE,WAAAhT,EAAA,IACA,MAAAiX,EAAAjE,WAAAhT,EAAA,IACA,MAAAiX,EAAAjE,WAAAhT,EAAA,IACA,MAAAiX,EAAAjE,WAAAhT,EAAA,IACA,MAAAiX,EAAAjE,WAAAhT,EAAA,IACA,MAAAiX,EAAAjE,WAAAhT,EAAA,IACA,KAAAiX,EAAAjE,WAAAhT,EAAA,IACA,KAAAiX,EAAAjE,WAAAhT,EAAA,GACA,OAAA,EAGA,IAAA,IAAAkC,EAAAlC,EAAA,GAAAkC,GAAA,EAAAA,IACA,GAAA,KAAA+U,EAAAjE,WAAA9Q,GACA,OAAA,EAIA,OAAA,EAgFA,SAAAw/B,EAAAC,EAAAC,GACA,OAAAD,IAAAC,EACA,EAGA,OAAAD,EACA,EAGA,OAAAC,GACA,EAGAD,EAAAC,EACA,GAGA,EAzIAvzG,EAAAwuG,YAAA0E,EAAAC,EAPA,SAAApC,GACA,OAAAqC,EAAArC,GACA,IAAAA,EAGAA,GAWA/wG,EAAAwzG,cAAAN,EAAAC,EAPA,SAAApC,GACA,OAAAqC,EAAArC,GACAA,EAAAj/B,MAAA,GAGAi/B,GAwEA/wG,EAAAyzG,2BA5BA,SAAAC,EAAAC,EAAAC,GACA,IAAAC,EAAAR,EAAAK,EAAAjyB,OAAAkyB,EAAAlyB,QACA,OAAA,IAAAoyB,GAKA,KADAA,EAAAH,EAAA3F,aAAA4F,EAAA5F,eAMA,KADA8F,EAAAH,EAAA1F,eAAA2F,EAAA3F,iBACA4F,GAKA,KADAC,EAAAH,EAAA7F,gBAAA8F,EAAA9F,kBAMA,KADAgG,EAAAH,EAAA9F,cAAA+F,EAAA/F,eAlBAiG,EAuBAR,EAAAK,EAAAn0G,KAAAo0G,EAAAp0G,OAyCAS,EAAA8zG,oCA5BA,SAAAJ,EAAAC,EAAAI,GACA,IAAAF,EAAAH,EAAA9F,cAAA+F,EAAA/F,cACA,OAAA,IAAAiG,GAKA,KADAA,EAAAH,EAAA7F,gBAAA8F,EAAA9F,kBACAkG,GAKA,KADAF,EAAAR,EAAAK,EAAAjyB,OAAAkyB,EAAAlyB,UAMA,KADAoyB,EAAAH,EAAA3F,aAAA4F,EAAA5F,eAMA,KADA8F,EAAAH,EAAA1F,eAAA2F,EAAA3F,gBAlBA6F,EAuBAR,EAAAK,EAAAn0G,KAAAo0G,EAAAp0G,OAwDAS,EAAA+vG,oCA5BA,SAAA2D,EAAAC,GACA,IAAAE,EAAAH,EAAA9F,cAAA+F,EAAA/F,cACA,OAAA,IAAAiG,GAKA,KADAA,EAAAH,EAAA7F,gBAAA8F,EAAA9F,kBAMA,KADAgG,EAAAR,EAAAK,EAAAjyB,OAAAkyB,EAAAlyB,UAMA,KADAoyB,EAAAH,EAAA3F,aAAA4F,EAAA5F,eAMA,KADA8F,EAAAH,EAAA1F,eAAA2F,EAAA3F,gBAlBA6F,EAuBAR,EAAAK,EAAAn0G,KAAAo0G,EAAAp0G,OAYAS,EAAAg0G,oBAHA,SAAA9R,GACA,OAAA3tB,KAAAoH,MAAAumB,EAAAtc,QAAA,iBAAA,MAuDA5lF,EAAAi0G,iBA/CA,SAAA3G,EAAA4G,EAAAC,GA8BA,GA7BAD,EAAAA,GAAA,GAEA5G,IAEA,MAAAA,EAAAA,EAAA37B,OAAA,IAAA,MAAAuiC,EAAA,KACA5G,GAAA,KAOA4G,EAAA5G,EAAA4G,GAiBAC,EAAA,CACA,IAAAC,EAAAtC,EAAAqC,GACA,IAAAC,EACA,MAAA,IAAA5O,MAAA,oCAEA,GAAA4O,EAAA/0G,KAAA,CAEA,IAAA4yE,EAAAmiC,EAAA/0G,KAAAgtF,YAAA,KACApa,GAAA,IACAmiC,EAAA/0G,KAAA+0G,EAAA/0G,KAAAmpG,UAAA,EAAAv2B,EAAA,IAGAiiC,EAAAl9B,EAAAo7B,EAAAgC,GAAAF,GAGA,OAAA3B,EAAA2B,kCC9dA,IAAA5H,EAAArsG,EAAA,UACAwrF,EAAAvrF,OAAAmqG,UAAAnD,eACAmN,EAAA,oBAAA3kB,IAQA,SAAA6c,IACAG,KAAA4H,OAAA,GACA5H,KAAA6H,KAAAF,EAAA,IAAA3kB,IAAAxvF,OAAAU,OAAA,MAMA2rG,EAAAiI,UAAA,SAAAC,EAAAC,GAEA,IADA,IAAAvmB,EAAA,IAAAoe,EACA14B,EAAA,EAAAi8B,EAAA2E,EAAA9iC,OAAAkC,EAAAi8B,EAAAj8B,IACAsa,EAAAzC,IAAA+oB,EAAA5gC,GAAA6gC,GAEA,OAAAvmB,GASAoe,EAAAlC,UAAAV,KAAA,WACA,OAAA0K,EAAA3H,KAAA6H,KAAA5K,KAAAzpG,OAAAy0G,oBAAAjI,KAAA6H,MAAA5iC,QAQA46B,EAAAlC,UAAA3e,IAAA,SAAAqlB,EAAA2D,GACA,IAAAE,EAAAP,EAAAtD,EAAAzE,EAAAkC,YAAAuC,GACA9Y,EAAAoc,EAAA3H,KAAAjhB,IAAAslB,GAAAtlB,EAAA6e,KAAAoC,KAAA6H,KAAAK,GACAC,EAAAnI,KAAA4H,OAAA3iC,OACAsmB,IAAAyc,GACAhI,KAAA4H,OAAA98B,KAAAu5B,GAEA9Y,IACAoc,EACA3H,KAAA6H,KAAApmB,IAAA4iB,EAAA8D,GAEAnI,KAAA6H,KAAAK,GAAAC,IAUAtI,EAAAlC,UAAA5e,IAAA,SAAAslB,GACA,GAAAsD,EACA,OAAA3H,KAAA6H,KAAA9oB,IAAAslB,GAEA,IAAA6D,EAAAtI,EAAAkC,YAAAuC,GACA,OAAAtlB,EAAA6e,KAAAoC,KAAA6H,KAAAK,IASArI,EAAAlC,UAAAnyB,QAAA,SAAA64B,GACA,GAAAsD,EAAA,CACA,IAAAQ,EAAAnI,KAAA6H,KAAArmB,IAAA6iB,GACA,GAAA8D,GAAA,EACA,OAAAA,MAEA,CACA,IAAAD,EAAAtI,EAAAkC,YAAAuC,GACA,GAAAtlB,EAAA6e,KAAAoC,KAAA6H,KAAAK,GACA,OAAAlI,KAAA6H,KAAAK,GAIA,MAAA,IAAApP,MAAA,IAAAuL,EAAA,yBAQAxE,EAAAlC,UAAAyK,GAAA,SAAAC,GACA,GAAAA,GAAA,GAAAA,EAAArI,KAAA4H,OAAA3iC,OACA,OAAA+6B,KAAA4H,OAAAS,GAEA,MAAA,IAAAvP,MAAA,yBAAAuP,IAQAxI,EAAAlC,UAAAwF,QAAA,WACA,OAAAnD,KAAA4H,OAAAxiC,SAGA9xE,EAAAusG,SAAAA,gDCjHA,IAAAD,EAAArsG,EAAA,UAqBA,SAAAusG,IACAE,KAAA4H,OAAA,GACA5H,KAAAsI,SAAA,EAEAtI,KAAAuI,MAAA,CAAArH,eAAA,EAAAC,gBAAA,GASArB,EAAAnC,UAAAwE,gBACA,SAAAqG,EAAAC,GACAzI,KAAA4H,OAAAxzG,QAAAo0G,EAAAC,IAQA3I,EAAAnC,UAAA3e,IAAA,SAAA0pB,GAtCA,IAAA1B,EAAAC,EAEA0B,EACAC,EACAC,EACAC,EALA9B,EAuCAhH,KAAAuI,MAvCAtB,EAuCAyB,EArCAC,EAAA3B,EAAA9F,cACA0H,EAAA3B,EAAA/F,cACA2H,EAAA7B,EAAA7F,gBACA2H,EAAA7B,EAAA9F,gBACAyH,EAAAD,GAAAC,GAAAD,GAAAG,GAAAD,GACAjJ,EAAAyD,oCAAA2D,EAAAC,IAAA,GAiCAjH,KAAAuI,MAAAG,EACA1I,KAAA4H,OAAA98B,KAAA49B,KAEA1I,KAAAsI,SAAA,EACAtI,KAAA4H,OAAA98B,KAAA49B,KAaA5I,EAAAnC,UAAAwF,QAAA,WAKA,OAJAnD,KAAAsI,UACAtI,KAAA4H,OAAAxb,KAAAwT,EAAAyD,qCACArD,KAAAsI,SAAA,GAEAtI,KAAA4H,QAGAt0G,EAAAwsG,YAAAA,gDCvEA,IAAAF,EAAArsG,EAAA,UACAw1G,EAAAx1G,EAAA,mBACAssG,EAAAtsG,EAAA,eAAAssG,SACAF,EAAApsG,EAAA,gBACAy1G,EAAAz1G,EAAA,gBAAAy1G,UAEA,SAAAvJ,EAAAwJ,EAAAC,GACA,IAAA/5B,EAAA85B,EAKA,MAJA,iBAAAA,IACA95B,EAAAywB,EAAA0H,oBAAA2B,IAGA,MAAA95B,EAAAg6B,SACA,IAAAC,EAAAj6B,EAAA+5B,GACA,IAAAG,EAAAl6B,EAAA+5B,GA0QA,SAAAG,EAAAJ,EAAAC,GACA,IAAA/5B,EAAA85B,EACA,iBAAAA,IACA95B,EAAAywB,EAAA0H,oBAAA2B,IAGA,IAAAvF,EAAA9D,EAAAM,OAAA/wB,EAAA,WACAoyB,EAAA3B,EAAAM,OAAA/wB,EAAA,WAGAw0B,EAAA/D,EAAAM,OAAA/wB,EAAA,QAAA,IACAyxB,EAAAhB,EAAAM,OAAA/wB,EAAA,aAAA,MACAy0B,EAAAhE,EAAAM,OAAA/wB,EAAA,iBAAA,MACA+zB,EAAAtD,EAAAM,OAAA/wB,EAAA,YACA2xB,EAAAlB,EAAAM,OAAA/wB,EAAA,OAAA,MAIA,GAAAu0B,GAAA1D,KAAAS,SACA,MAAA,IAAA3H,MAAA,wBAAA4K,GAGA9C,IACAA,EAAAhB,EAAAiG,UAAAjF,IAGAW,EAAAA,EACAn3B,IAAA/D,QAIA+D,IAAAw1B,EAAAiG,WAKAz7B,KAAA,SAAA2K,GACA,OAAA6rB,GAAAhB,EAAAoG,WAAApF,IAAAhB,EAAAoG,WAAAjxB,GACA6qB,EAAAwB,SAAAR,EAAA7rB,GACAA,KAOAirB,KAAAM,OAAAT,EAAAiI,UAAAnE,EAAAv5B,IAAA/D,SAAA,GACA25B,KAAAK,SAAAR,EAAAiI,UAAAvG,GAAA,GAEAvB,KAAAsJ,iBAAAtJ,KAAAK,SAAA8C,UAAA/4B,KAAA,SAAA8R,GACA,OAAA0jB,EAAA2H,iBAAA3G,EAAA1kB,EAAAgtB,MAGAlJ,KAAAY,WAAAA,EACAZ,KAAA4D,eAAAA,EACA5D,KAAAO,UAAA2C,EACAlD,KAAAuJ,cAAAL,EACAlJ,KAAAc,KAAAA,EA4GA,SAAA0I,IACAxJ,KAAAkB,cAAA,EACAlB,KAAAmB,gBAAA,EACAnB,KAAAjrB,OAAA,KACAirB,KAAAqB,aAAA,KACArB,KAAAsB,eAAA,KACAtB,KAAAntG,KAAA,KAkaA,SAAAu2G,EAAAH,EAAAC,GACA,IAAA/5B,EAAA85B,EACA,iBAAAA,IACA95B,EAAAywB,EAAA0H,oBAAA2B,IAGA,IAAAvF,EAAA9D,EAAAM,OAAA/wB,EAAA,WACAg6B,EAAAvJ,EAAAM,OAAA/wB,EAAA,YAEA,GAAAu0B,GAAA1D,KAAAS,SACA,MAAA,IAAA3H,MAAA,wBAAA4K,GAGA1D,KAAAK,SAAA,IAAAR,EACAG,KAAAM,OAAA,IAAAT,EAEA,IAAA4J,EAAA,CACAx0B,MAAA,EACAC,OAAA,GAEA8qB,KAAA0J,UAAAP,EAAA/+B,KAAA,SAAA8R,GACA,GAAAA,EAAA0pB,IAGA,MAAA,IAAA9M,MAAA,sDAEA,IAAA/zB,EAAA66B,EAAAM,OAAAhkB,EAAA,UACAytB,EAAA/J,EAAAM,OAAAn7B,EAAA,QACA6kC,EAAAhK,EAAAM,OAAAn7B,EAAA,UAEA,GAAA4kC,EAAAF,EAAAx0B,MACA00B,IAAAF,EAAAx0B,MAAA20B,EAAAH,EAAAv0B,OACA,MAAA,IAAA4jB,MAAA,wDAIA,OAFA2Q,EAAA1kC,EAEA,CACA8kC,gBAAA,CAGA3I,cAAAyI,EAAA,EACAxI,gBAAAyI,EAAA,GAEAE,SAAA,IAAArK,EAAAG,EAAAM,OAAAhkB,EAAA,OAAAgtB,OA/3BAzJ,EAAAiB,cAAA,SAAAuI,EAAAC,GACA,OAAAG,EAAA3I,cAAAuI,EAAAC,IAMAzJ,EAAA9B,UAAA8C,SAAA,EAgCAhB,EAAA9B,UAAAoM,oBAAA,KACAv2G,OAAAC,eAAAgsG,EAAA9B,UAAA,qBAAA,CACAmB,cAAA,EACAC,YAAA,EACAvd,IAAA,WAKA,OAJAwe,KAAA+J,qBACA/J,KAAAgK,eAAAhK,KAAAO,UAAAP,KAAAY,YAGAZ,KAAA+J,uBAIAtK,EAAA9B,UAAAsM,mBAAA,KACAz2G,OAAAC,eAAAgsG,EAAA9B,UAAA,oBAAA,CACAmB,cAAA,EACAC,YAAA,EACAvd,IAAA,WAKA,OAJAwe,KAAAiK,oBACAjK,KAAAgK,eAAAhK,KAAAO,UAAAP,KAAAY,YAGAZ,KAAAiK,sBAIAxK,EAAA9B,UAAAuM,wBACA,SAAA7F,EAAA9+B,GACA,IAAAkH,EAAA43B,EAAA9L,OAAAhzB,GACA,MAAA,MAAAkH,GAAA,MAAAA,GAQAgzB,EAAA9B,UAAAqM,eACA,SAAA3F,EAAAZ,GACA,MAAA,IAAA3K,MAAA,6CAGA2G,EAAA0K,gBAAA,EACA1K,EAAA2K,eAAA,EAEA3K,EAAA4K,qBAAA,EACA5K,EAAA6K,kBAAA,EAkBA7K,EAAA9B,UAAAoD,YACA,SAAAyH,EAAA+B,EAAAC,GACA,IAGAtH,EAHA15B,EAAA+gC,GAAA,KAIA,OAHAC,GAAA/K,EAAA0K,iBAIA,KAAA1K,EAAA0K,gBACAjH,EAAAlD,KAAAyK,mBACA,MACA,KAAAhL,EAAA2K,eACAlH,EAAAlD,KAAA0K,kBACA,MACA,QACA,MAAA,IAAA5R,MAAA,+BAGA,IAAA8H,EAAAZ,KAAAY,WACAsC,EAAA94B,KAAA,SAAA42B,GACA,IAAAjsB,EAAA,OAAAisB,EAAAjsB,OAAA,KAAAirB,KAAAK,SAAA+H,GAAApH,EAAAjsB,QAEA,MAAA,CACAA,OAFAA,EAAA6qB,EAAA2H,iBAAA3G,EAAA7rB,EAAAirB,KAAAuJ,eAGArI,cAAAF,EAAAE,cACAC,gBAAAH,EAAAG,gBACAE,aAAAL,EAAAK,aACAC,eAAAN,EAAAM,eACAzuG,KAAA,OAAAmuG,EAAAnuG,KAAA,KAAAmtG,KAAAM,OAAA8H,GAAApH,EAAAnuG,SAEAmtG,MAAA5rG,QAAAo0G,EAAAh/B,IAyBAi2B,EAAA9B,UAAAgN,yBACA,SAAA5K,GACA,IAAA9qB,EAAA2qB,EAAAM,OAAAH,EAAA,QAMA6K,EAAA,CACA71B,OAAA6qB,EAAAM,OAAAH,EAAA,UACAsB,aAAApsB,EACAqsB,eAAA1B,EAAAM,OAAAH,EAAA,SAAA,IAIA,GADA6K,EAAA71B,OAAAirB,KAAA6K,iBAAAD,EAAA71B,QACA61B,EAAA71B,OAAA,EACA,MAAA,GAGA,IAAAmuB,EAAA,GAEA39B,EAAAy6B,KAAA8K,aAAAF,EACA5K,KAAA0K,kBACA,eACA,iBACA9K,EAAAmH,2BACAgC,EAAAuB,mBACA,GAAA/kC,GAAA,EAAA,CACA,IAAAy7B,EAAAhB,KAAA0K,kBAAAnlC,GAEA,QAAA7vE,IAAAqqG,EAAA7qB,OAOA,IANA,IAAAmsB,EAAAL,EAAAK,aAMAL,GAAAA,EAAAK,eAAAA,GACA6B,EAAAp4B,KAAA,CACAmK,KAAA2qB,EAAAM,OAAAc,EAAA,gBAAA,MACA9rB,OAAA0qB,EAAAM,OAAAc,EAAA,kBAAA,MACA+J,WAAAnL,EAAAM,OAAAc,EAAA,sBAAA,QAGAA,EAAAhB,KAAA0K,oBAAAnlC,QASA,IANA,IAAA+7B,EAAAN,EAAAM,eAMAN,GACAA,EAAAK,eAAApsB,GACA+rB,EAAAM,gBAAAA,GACA4B,EAAAp4B,KAAA,CACAmK,KAAA2qB,EAAAM,OAAAc,EAAA,gBAAA,MACA9rB,OAAA0qB,EAAAM,OAAAc,EAAA,kBAAA,MACA+J,WAAAnL,EAAAM,OAAAc,EAAA,sBAAA,QAGAA,EAAAhB,KAAA0K,oBAAAnlC,GAKA,OAAA29B,GAGA5vG,EAAAmsG,kBAAAA,EAgGA4J,EAAA1L,UAAAnqG,OAAAU,OAAAurG,EAAA9B,WACA0L,EAAA1L,UAAAmM,SAAArK,EAMA4J,EAAA1L,UAAAkN,iBAAA,SAAAtI,GACA,IAWAp7B,EAXA6jC,EAAAzI,EAKA,GAJA,MAAAvC,KAAAY,aACAoK,EAAApL,EAAAwB,SAAApB,KAAAY,WAAAoK,IAGAhL,KAAAK,SAAAthB,IAAAisB,GACA,OAAAhL,KAAAK,SAAA70B,QAAAw/B,GAMA,IAAA7jC,EAAA,EAAAA,EAAA64B,KAAAsJ,iBAAArkC,SAAAkC,EACA,GAAA64B,KAAAsJ,iBAAAniC,IAAAo7B,EACA,OAAAp7B,EAIA,OAAA,GAYAkiC,EAAA3I,cACA,SAAAuI,EAAAC,GACA,IAAA+B,EAAAz3G,OAAAU,OAAAm1G,EAAA1L,WAEAgG,EAAAsH,EAAA3K,OAAAT,EAAAiI,UAAAmB,EAAA3I,OAAA6C,WAAA,GACA5B,EAAA0J,EAAA5K,SAAAR,EAAAiI,UAAAmB,EAAA5I,SAAA8C,WAAA,GACA8H,EAAArK,WAAAqI,EAAA9I,YACA8K,EAAArH,eAAAqF,EAAA1F,wBAAA0H,EAAA5K,SAAA8C,UACA8H,EAAArK,YACAqK,EAAAnK,KAAAmI,EAAAhJ,MACAgL,EAAA1B,cAAAL,EACA+B,EAAA3B,iBAAA2B,EAAA5K,SAAA8C,UAAA/4B,KAAA,SAAA8R,GACA,OAAA0jB,EAAA2H,iBAAA0D,EAAArK,WAAA1kB,EAAAgtB,MAYA,IAJA,IAAAgC,EAAAjC,EAAA1I,UAAA4C,UAAA/9B,QACA+lC,EAAAF,EAAAlB,oBAAA,GACAqB,EAAAH,EAAAhB,mBAAA,GAEA9iC,EAAA,EAAAlC,EAAAimC,EAAAjmC,OAAAkC,EAAAlC,EAAAkC,IAAA,CACA,IAAAkkC,EAAAH,EAAA/jC,GACAmkC,EAAA,IAAA9B,EACA8B,EAAApK,cAAAmK,EAAAnK,cACAoK,EAAAnK,gBAAAkK,EAAAlK,gBAEAkK,EAAAt2B,SACAu2B,EAAAv2B,OAAAwsB,EAAA/1B,QAAA6/B,EAAAt2B,QACAu2B,EAAAjK,aAAAgK,EAAAhK,aACAiK,EAAAhK,eAAA+J,EAAA/J,eAEA+J,EAAAx4G,OACAy4G,EAAAz4G,KAAA8wG,EAAAn4B,QAAA6/B,EAAAx4G,OAGAu4G,EAAAtgC,KAAAwgC,IAGAH,EAAArgC,KAAAwgC,GAKA,OAFAtC,EAAAiC,EAAAhB,mBAAArK,EAAAmH,4BAEAkE,GAMA5B,EAAA1L,UAAA8C,SAAA,EAKAjtG,OAAAC,eAAA41G,EAAA1L,UAAA,UAAA,CACAnc,IAAA,WACA,OAAAwe,KAAAsJ,iBAAAlkC,WAqBAikC,EAAA1L,UAAAqM,eACA,SAAA3F,EAAAZ,GAeA,IAdA,IAYAzC,EAAAxL,EAAA+V,EAAAvmC,EAAAtxE,EAZAwtG,EAAA,EACA0B,EAAA,EACAG,EAAA,EACAD,EAAA,EACAG,EAAA,EACAD,EAAA,EACA/9B,EAAAo/B,EAAAp/B,OACAM,EAAA,EACAimC,EAAA,GACAC,EAAA,GACAC,EAAA,GACAR,EAAA,GAGA3lC,EAAAN,GACA,GAAA,MAAAo/B,EAAA9L,OAAAhzB,GACA27B,IACA37B,IACAq9B,EAAA,OAEA,GAAA,MAAAyB,EAAA9L,OAAAhzB,GACAA,QAEA,CASA,KARAy7B,EAAA,IAAAwI,GACAtI,cAAAA,EAOAl8B,EAAAO,EAAAP,EAAAC,IACA+6B,KAAAkK,wBAAA7F,EAAAr/B,GADAA,KAQA,GADAumC,EAAAC,EAFAhW,EAAA6O,EAAAj/B,MAAAG,EAAAP,IAIAO,GAAAiwB,EAAAvwB,WACA,CAEA,IADAsmC,EAAA,GACAhmC,EAAAP,GACA26B,EAAAyE,OAAAC,EAAA9+B,EAAAkmC,GACA/3G,EAAA+3G,EAAA/3G,MACA6xE,EAAAkmC,EAAA7G,KACA2G,EAAAzgC,KAAAp3E,GAGA,GAAA,IAAA63G,EAAAtmC,OACA,MAAA,IAAA6zB,MAAA,0CAGA,GAAA,IAAAyS,EAAAtmC,OACA,MAAA,IAAA6zB,MAAA,0CAGA0S,EAAAhW,GAAA+V,EAIAvK,EAAAG,gBAAAyB,EAAA2I,EAAA,GACA3I,EAAA5B,EAAAG,gBAEAoK,EAAAtmC,OAAA,IAEA+7B,EAAAjsB,OAAAkuB,EAAAsI,EAAA,GACAtI,GAAAsI,EAAA,GAGAvK,EAAAK,aAAA0B,EAAAwI,EAAA,GACAxI,EAAA/B,EAAAK,aAEAL,EAAAK,cAAA,EAGAL,EAAAM,eAAAwB,EAAAyI,EAAA,GACAzI,EAAA9B,EAAAM,eAEAiK,EAAAtmC,OAAA,IAEA+7B,EAAAnuG,KAAAmwG,EAAAuI,EAAA,GACAvI,GAAAuI,EAAA,KAIAL,EAAApgC,KAAAk2B,GACA,iBAAAA,EAAAK,cACAqK,EAAA5gC,KAAAk2B,GAKAgI,EAAAkC,EAAAtL,EAAAwH,qCACApH,KAAA+J,oBAAAmB,EAEAlC,EAAA0C,EAAA9L,EAAAmH,4BACA/G,KAAAiK,mBAAAyB,GAOArC,EAAA1L,UAAAmN,aACA,SAAAa,EAAAC,EAAAC,EACAC,EAAAC,EAAAC,GAMA,GAAAL,EAAAE,IAAA,EACA,MAAA,IAAA9G,UAAA,gDACA4G,EAAAE,IAEA,GAAAF,EAAAG,GAAA,EACA,MAAA,IAAA/G,UAAA,kDACA4G,EAAAG,IAGA,OAAA/C,EAAAkD,OAAAN,EAAAC,EAAAG,EAAAC,IAOA3C,EAAA1L,UAAAuO,mBACA,WACA,IAAA,IAAA3mC,EAAA,EAAAA,EAAAy6B,KAAAyK,mBAAAxlC,SAAAM,EAAA,CACA,IAAAy7B,EAAAhB,KAAAyK,mBAAAllC,GAMA,GAAAA,EAAA,EAAAy6B,KAAAyK,mBAAAxlC,OAAA,CACA,IAAAknC,EAAAnM,KAAAyK,mBAAAllC,EAAA,GAEA,GAAAy7B,EAAAE,gBAAAiL,EAAAjL,cAAA,CACAF,EAAAoL,oBAAAD,EAAAhL,gBAAA,EACA,UAKAH,EAAAoL,oBAAAC,EAAAA,IA4BAhD,EAAA1L,UAAAyE,oBACA,SAAArC,GACA,IAAA6K,EAAA,CACA1J,cAAAtB,EAAAM,OAAAH,EAAA,QACAoB,gBAAAvB,EAAAM,OAAAH,EAAA,WAGAx6B,EAAAy6B,KAAA8K,aACAF,EACA5K,KAAAyK,mBACA,gBACA,kBACA7K,EAAAwH,oCACAxH,EAAAM,OAAAH,EAAA,OAAAN,EAAA4K,uBAGA,GAAA9kC,GAAA,EAAA,CACA,IAAAy7B,EAAAhB,KAAAyK,mBAAAllC,GAEA,GAAAy7B,EAAAE,gBAAA0J,EAAA1J,cAAA,CACA,IAAAnsB,EAAA6qB,EAAAM,OAAAc,EAAA,SAAA,MACA,OAAAjsB,IACAA,EAAAirB,KAAAK,SAAA+H,GAAArzB,GACAA,EAAA6qB,EAAA2H,iBAAAvH,KAAAY,WAAA7rB,EAAAirB,KAAAuJ,gBAEA,IAAA12G,EAAA+sG,EAAAM,OAAAc,EAAA,OAAA,MAIA,OAHA,OAAAnuG,IACAA,EAAAmtG,KAAAM,OAAA8H,GAAAv1G,IAEA,CACAkiF,OAAAA,EACAE,KAAA2qB,EAAAM,OAAAc,EAAA,eAAA,MACA9rB,OAAA0qB,EAAAM,OAAAc,EAAA,iBAAA,MACAnuG,KAAAA,IAKA,MAAA,CACAkiF,OAAA,KACAE,KAAA,KACAC,OAAA,KACAriF,KAAA,OAQAw2G,EAAA1L,UAAA2O,wBACA,WACA,QAAAtM,KAAA4D,iBAGA5D,KAAA4D,eAAA3+B,QAAA+6B,KAAAK,SAAApD,SACA+C,KAAA4D,eAAAh9B,MAAA,SAAA2lC,GAAA,OAAA,MAAAA,OAQAlD,EAAA1L,UAAA+D,iBACA,SAAAa,EAAAiK,GACA,IAAAxM,KAAA4D,eACA,OAAA,KAGA,IAAAr+B,EAAAy6B,KAAA6K,iBAAAtI,GACA,GAAAh9B,GAAA,EACA,OAAAy6B,KAAA4D,eAAAr+B,GAGA,IAKAqgC,EALAoF,EAAAzI,EAMA,GALA,MAAAvC,KAAAY,aACAoK,EAAApL,EAAAwB,SAAApB,KAAAY,WAAAoK,IAIA,MAAAhL,KAAAY,aACAgF,EAAAhG,EAAAwF,SAAApF,KAAAY,aAAA,CAKA,IAAA6L,EAAAzB,EAAA9xB,QAAA,aAAA,IACA,GAAA,QAAA0sB,EAAAN,QACAtF,KAAAK,SAAAthB,IAAA0tB,GACA,OAAAzM,KAAA4D,eAAA5D,KAAAK,SAAA70B,QAAAihC,IAGA,KAAA7G,EAAAjzG,MAAA,KAAAizG,EAAAjzG,OACAqtG,KAAAK,SAAAthB,IAAA,IAAAisB,GACA,OAAAhL,KAAA4D,eAAA5D,KAAAK,SAAA70B,QAAA,IAAAw/B,IAQA,GAAAwB,EACA,OAAA,KAGA,MAAA,IAAA1T,MAAA,IAAAkS,EAAA,+BA2BA3B,EAAA1L,UAAA+O,qBACA,SAAA3M,GACA,IAAAhrB,EAAA6qB,EAAAM,OAAAH,EAAA,UAEA,IADAhrB,EAAAirB,KAAA6K,iBAAA91B,IACA,EACA,MAAA,CACAE,KAAA,KACAC,OAAA,KACA61B,WAAA,MAIA,IAAAH,EAAA,CACA71B,OAAAA,EACAssB,aAAAzB,EAAAM,OAAAH,EAAA,QACAuB,eAAA1B,EAAAM,OAAAH,EAAA,WAGAx6B,EAAAy6B,KAAA8K,aACAF,EACA5K,KAAA0K,kBACA,eACA,iBACA9K,EAAAmH,2BACAnH,EAAAM,OAAAH,EAAA,OAAAN,EAAA4K,uBAGA,GAAA9kC,GAAA,EAAA,CACA,IAAAy7B,EAAAhB,KAAA0K,kBAAAnlC,GAEA,GAAAy7B,EAAAjsB,SAAA61B,EAAA71B,OACA,MAAA,CACAE,KAAA2qB,EAAAM,OAAAc,EAAA,gBAAA,MACA9rB,OAAA0qB,EAAAM,OAAAc,EAAA,kBAAA,MACA+J,WAAAnL,EAAAM,OAAAc,EAAA,sBAAA,OAKA,MAAA,CACA/rB,KAAA,KACAC,OAAA,KACA61B,WAAA,OAIAz3G,EAAA+1G,uBAAAA,EAmGAD,EAAAzL,UAAAnqG,OAAAU,OAAAurG,EAAA9B,WACAyL,EAAAzL,UAAAgP,YAAAlN,EAKA2J,EAAAzL,UAAA8C,SAAA,EAKAjtG,OAAAC,eAAA21G,EAAAzL,UAAA,UAAA,CACAnc,IAAA,WAEA,IADA,IAAA+f,EAAA,GACAp6B,EAAA,EAAAA,EAAA64B,KAAA0J,UAAAzkC,OAAAkC,IACA,IAAA,IAAAmqB,EAAA,EAAAA,EAAA0O,KAAA0J,UAAAviC,GAAA2iC,SAAAvI,QAAAt8B,OAAAqsB,IACAiQ,EAAAz2B,KAAAk1B,KAAA0J,UAAAviC,GAAA2iC,SAAAvI,QAAAjQ,IAGA,OAAAiQ,KAuBA6H,EAAAzL,UAAAyE,oBACA,SAAArC,GACA,IAAA6K,EAAA,CACA1J,cAAAtB,EAAAM,OAAAH,EAAA,QACAoB,gBAAAvB,EAAAM,OAAAH,EAAA,WAKA6M,EAAA7D,EAAAkD,OAAArB,EAAA5K,KAAA0J,WACA,SAAAkB,EAAAiC,GACA,IAAA1F,EAAAyD,EAAA1J,cAAA2L,EAAAhD,gBAAA3I,cACA,OAAAiG,GAIAyD,EAAAzJ,gBACA0L,EAAAhD,gBAAA1I,mBAEA0L,EAAA7M,KAAA0J,UAAAkD,GAEA,OAAAC,EASAA,EAAA/C,SAAA1H,oBAAA,CACAntB,KAAA21B,EAAA1J,eACA2L,EAAAhD,gBAAA3I,cAAA,GACAhsB,OAAA01B,EAAAzJ,iBACA0L,EAAAhD,gBAAA3I,gBAAA0J,EAAA1J,cACA2L,EAAAhD,gBAAA1I,gBAAA,EACA,GACA2L,KAAA/M,EAAA+M,OAfA,CACA/3B,OAAA,KACAE,KAAA,KACAC,OAAA,KACAriF,KAAA,OAmBAu2G,EAAAzL,UAAA2O,wBACA,WACA,OAAAtM,KAAA0J,UAAAqD,OAAA,SAAA7wB,GACA,OAAAA,EAAA4tB,SAAAwC,8BASAlD,EAAAzL,UAAA+D,iBACA,SAAAa,EAAAiK,GACA,IAAA,IAAArlC,EAAA,EAAAA,EAAA64B,KAAA0J,UAAAzkC,OAAAkC,IAAA,CACA,IAEAJ,EAFAi5B,KAAA0J,UAAAviC,GAEA2iC,SAAApI,iBAAAa,GAAA,GACA,GAAAx7B,EACA,OAAAA,EAGA,GAAAylC,EACA,OAAA,KAGA,MAAA,IAAA1T,MAAA,IAAAyJ,EAAA,+BAsBA6G,EAAAzL,UAAA+O,qBACA,SAAA3M,GACA,IAAA,IAAA54B,EAAA,EAAAA,EAAA64B,KAAA0J,UAAAzkC,OAAAkC,IAAA,CACA,IAAA0lC,EAAA7M,KAAA0J,UAAAviC,GAIA,IAAA,IAAA0lC,EAAA/C,SAAAe,iBAAAjL,EAAAM,OAAAH,EAAA,WAAA,CAGA,IAAAiN,EAAAH,EAAA/C,SAAA4C,qBAAA3M,GACA,GAAAiN,EASA,MARA,CACA/3B,KAAA+3B,EAAA/3B,MACA43B,EAAAhD,gBAAA3I,cAAA,GACAhsB,OAAA83B,EAAA93B,QACA23B,EAAAhD,gBAAA3I,gBAAA8L,EAAA/3B,KACA43B,EAAAhD,gBAAA1I,gBAAA,EACA,KAMA,MAAA,CACAlsB,KAAA,KACAC,OAAA,OASAk0B,EAAAzL,UAAAqM,eACA,SAAA3F,EAAAZ,GACAzD,KAAA+J,oBAAA,GACA/J,KAAAiK,mBAAA,GACA,IAAA,IAAA9iC,EAAA,EAAAA,EAAA64B,KAAA0J,UAAAzkC,OAAAkC,IAGA,IAFA,IAAA0lC,EAAA7M,KAAA0J,UAAAviC,GACA8lC,EAAAJ,EAAA/C,SAAAW,mBACAnZ,EAAA,EAAAA,EAAA2b,EAAAhoC,OAAAqsB,IAAA,CACA,IAAA0P,EAAAiM,EAAA3b,GAEAvc,EAAA83B,EAAA/C,SAAAzJ,SAAA+H,GAAApH,EAAAjsB,QACAA,EAAA6qB,EAAA2H,iBAAAsF,EAAA/C,SAAAlJ,WAAA7rB,EAAAirB,KAAAuJ,eACAvJ,KAAAK,SAAArhB,IAAAjK,GACAA,EAAAirB,KAAAK,SAAA70B,QAAAuJ,GAEA,IAAAliF,EAAA,KACAmuG,EAAAnuG,OACAA,EAAAg6G,EAAA/C,SAAAxJ,OAAA8H,GAAApH,EAAAnuG,MACAmtG,KAAAM,OAAAthB,IAAAnsF,GACAA,EAAAmtG,KAAAM,OAAA90B,QAAA34E,IAOA,IAAAq6G,EAAA,CACAn4B,OAAAA,EACAmsB,cAAAF,EAAAE,eACA2L,EAAAhD,gBAAA3I,cAAA,GACAC,gBAAAH,EAAAG,iBACA0L,EAAAhD,gBAAA3I,gBAAAF,EAAAE,cACA2L,EAAAhD,gBAAA1I,gBAAA,EACA,GACAE,aAAAL,EAAAK,aACAC,eAAAN,EAAAM,eACAzuG,KAAAA,GAGAmtG,KAAA+J,oBAAAj/B,KAAAoiC,GACA,iBAAAA,EAAA7L,cACArB,KAAAiK,mBAAAn/B,KAAAoiC,GAKAlE,EAAAhJ,KAAA+J,oBAAAnK,EAAAwH,qCACA4B,EAAAhJ,KAAAiK,mBAAArK,EAAAmH,6BAGAzzG,EAAA81G,yBAAAA,8ICjmCA,SAAA+D,EAAAC,EAAAC,EAAA1B,EAAA2B,EAAAC,EAAAvB,GAUA,IAAAwB,EAAA5nC,KAAA6nC,OAAAJ,EAAAD,GAAA,GAAAA,EACAjG,EAAAoG,EAAA5B,EAAA2B,EAAAE,IAAA,GACA,OAAA,IAAArG,EAEAqG,EAEArG,EAAA,EAEAkG,EAAAG,EAAA,EAEAL,EAAAK,EAAAH,EAAA1B,EAAA2B,EAAAC,EAAAvB,GAKAA,GAAA14G,EAAAg3G,kBACA+C,EAAAC,EAAAroC,OAAAooC,GAAA,EAEAG,EAKAA,EAAAJ,EAAA,EAEAD,EAAAC,EAAAI,EAAA7B,EAAA2B,EAAAC,EAAAvB,GAIAA,GAAA14G,EAAAg3G,kBACAkD,EAEAJ,EAAA,GAAA,EAAAA,EA1DA95G,EAAA+2G,qBAAA,EACA/2G,EAAAg3G,kBAAA,EAgFAh3G,EAAA24G,OAAA,SAAAN,EAAA2B,EAAAC,EAAAvB,GACA,GAAA,IAAAsB,EAAAroC,OACA,OAAA,EAGA,IAAAM,EAAA4nC,GAAA,EAAAG,EAAAroC,OAAA0mC,EAAA2B,EACAC,EAAAvB,GAAA14G,EAAA+2G,sBACA,GAAA9kC,EAAA,EACA,OAAA,EAMA,KAAAA,EAAA,GAAA,GACA,IAAAgoC,EAAAD,EAAA/nC,GAAA+nC,EAAA/nC,EAAA,IAAA,MAGAA,EAGA,OAAAA,iCClFA,SAAAmoC,EAAAC,EAAAC,EAAAC,GACA,IAAApC,EAAAkC,EAAAC,GACAD,EAAAC,GAAAD,EAAAE,GACAF,EAAAE,GAAApC,EA2BA,SAAAqC,EAAAH,EAAAI,EAAA7mC,EAAA8mC,GAKA,GAAA9mC,EAAA8mC,EAAA,CAYA,IACA7mC,EAAAD,EAAA,EAEAwmC,EAAAC,GApCAM,EAiCA/mC,EAjCAgnC,EAiCAF,EAhCApoC,KAAAuoC,MAAAF,EAAAroC,KAAAwoC,UAAAF,EAAAD,KAmCAD,GASA,IARA,IAAAK,EAAAV,EAAAK,GAQA1c,EAAApqB,EAAAoqB,EAAA0c,EAAA1c,IACAyc,EAAAJ,EAAArc,GAAA+c,IAAA,GAEAX,EAAAC,EADAxmC,GAAA,EACAmqB,GAIAoc,EAAAC,EAAAxmC,EAAA,EAAAmqB,GACA,IAAAgd,EAAAnnC,EAAA,EAIA2mC,EAAAH,EAAAI,EAAA7mC,EAAAonC,EAAA,GACAR,EAAAH,EAAAI,EAAAO,EAAA,EAAAN,GA1DA,IAAAC,EAAAC,EAsEA56G,EAAA01G,UAAA,SAAA2E,EAAAI,GACAD,EAAAH,EAAAI,EAAA,EAAAJ,EAAA1oC,OAAA,kCCzGA,IAAA2gB,EAAAryF,EAAA,0BAAAqyF,mBACAga,EAAArsG,EAAA,UAIAg7G,EAAA,UAQAC,EAAA,qBAcA,SAAA9O,EAAA+O,EAAAC,EAAAnM,EAAAoM,EAAAnM,GACAxC,KAAAz2B,SAAA,GACAy2B,KAAA4O,eAAA,GACA5O,KAAA/qB,KAAA,MAAAw5B,EAAA,KAAAA,EACAzO,KAAA9qB,OAAA,MAAAw5B,EAAA,KAAAA,EACA1O,KAAAjrB,OAAA,MAAAwtB,EAAA,KAAAA,EACAvC,KAAAntG,KAAA,MAAA2vG,EAAA,KAAAA,EACAxC,KAAAwO,IAAA,EACA,MAAAG,GAAA3O,KAAAhhB,IAAA2vB,GAWAjP,EAAAmP,wBACA,SAAAC,EAAAnO,EAAAoO,GAGA,IAAA9nC,EAAA,IAAAy4B,EAMAsP,EAAAF,EAAAhvB,MAAAyuB,GACAU,EAAA,EACAC,EAAA,WAIA,OAHAC,KAEAA,KAAA,IAGA,SAAAA,IACA,OAAAF,EAAAD,EAAA/pC,OACA+pC,EAAAC,UAAAv5G,IAKA05G,EAAA,EAAAhD,EAAA,EAKAiD,EAAA,KAgEA,OA9DA1O,EAAAI,aAAA,SAAAC,GACA,GAAA,OAAAqO,EAAA,CAGA,KAAAD,EAAApO,EAAAE,eAMA,CAIA,IACA7rG,GADAi6G,EAAAN,EAAAC,IAAA,IACAppC,OAAA,EAAAm7B,EAAAG,gBACAiL,GAOA,OANA4C,EAAAC,GAAAK,EAAAzpC,OAAAm7B,EAAAG,gBACAiL,GACAA,EAAApL,EAAAG,gBACAoO,EAAAF,EAAAh6G,QAEAg6G,EAAArO,GAhBAuO,EAAAF,EAAAH,KACAE,IACAhD,EAAA,EAqBA,KAAAgD,EAAApO,EAAAE,eACAj6B,EAAA+X,IAAAkwB,KACAE,IAEA,GAAAhD,EAAApL,EAAAG,gBAAA,CACA,IAAAmO,EAAAN,EAAAC,IAAA,GACAhoC,EAAA+X,IAAAswB,EAAAzpC,OAAA,EAAAm7B,EAAAG,kBACA6N,EAAAC,GAAAK,EAAAzpC,OAAAm7B,EAAAG,iBACAiL,EAAApL,EAAAG,gBAEAkO,EAAArO,IACAhB,MAEAiP,EAAAD,EAAA/pC,SACAoqC,GAEAE,EAAAF,EAAAH,KAGAjoC,EAAA+X,IAAAgwB,EAAAvkC,OAAAwkC,GAAA3kC,KAAA,MAIAq2B,EAAAY,QAAAntG,SAAA,SAAAotG,GACA,IAAAz6B,EAAA45B,EAAAe,iBAAAF,GACA,MAAAz6B,IACA,MAAAgoC,IACAvN,EAAA5B,EAAAt1B,KAAAykC,EAAAvN,IAEAv6B,EAAA4e,iBAAA2b,EAAAz6B,OAIAE,EAEA,SAAAsoC,EAAAvO,EAAA3rG,GACA,GAAA,OAAA2rG,QAAAtrG,IAAAsrG,EAAAjsB,OACA9N,EAAA+X,IAAA3pF,OACA,CACA,IAAA0/E,EAAAg6B,EACAnP,EAAAt1B,KAAAykC,EAAA/N,EAAAjsB,QACAisB,EAAAjsB,OACA9N,EAAA+X,IAAA,IAAA0gB,EAAAsB,EAAAK,aACAL,EAAAM,eACAvsB,EACA1/E,EACA2rG,EAAAnuG,UAWA6sG,EAAA/B,UAAA3e,IAAA,SAAAwwB,GACA,GAAA3R,MAAA/gB,QAAA0yB,GACAA,EAAAp7G,SAAA,SAAAq7G,GACAzP,KAAAhhB,IAAAywB,KACAzP,UAEA,CAAA,IAAAwP,EAAAhB,IAAA,iBAAAgB,EAMA,MAAA,IAAAzK,UACA,8EAAAyK,GANAA,GACAxP,KAAAz2B,SAAAuB,KAAA0kC,GAQA,OAAAxP,MASAN,EAAA/B,UAAA+R,QAAA,SAAAF,GACA,GAAA3R,MAAA/gB,QAAA0yB,GACA,IAAA,IAAAroC,EAAAqoC,EAAAvqC,OAAA,EAAAkC,GAAA,EAAAA,IACA64B,KAAA0P,QAAAF,EAAAroC,QAGA,CAAA,IAAAqoC,EAAAhB,IAAA,iBAAAgB,EAIA,MAAA,IAAAzK,UACA,8EAAAyK,GAJAxP,KAAAz2B,SAAAuP,QAAA02B,GAOA,OAAAxP,MAUAN,EAAA/B,UAAA/xB,KAAA,SAAA+jC,GAEA,IADA,IAAAF,EACAtoC,EAAA,EAAAi8B,EAAApD,KAAAz2B,SAAAtE,OAAAkC,EAAAi8B,EAAAj8B,KACAsoC,EAAAzP,KAAAz2B,SAAApC,IACAqnC,GACAiB,EAAA7jC,KAAA+jC,GAGA,KAAAF,GACAE,EAAAF,EAAA,CAAA16B,OAAAirB,KAAAjrB,OACAE,KAAA+qB,KAAA/qB,KACAC,OAAA8qB,KAAA9qB,OACAriF,KAAAmtG,KAAAntG,QAYA6sG,EAAA/B,UAAArzB,KAAA,SAAAslC,GACA,IAAAC,EACA1oC,EACAi8B,EAAApD,KAAAz2B,SAAAtE,OACA,GAAAm+B,EAAA,EAAA,CAEA,IADAyM,EAAA,GACA1oC,EAAA,EAAAA,EAAAi8B,EAAA,EAAAj8B,IACA0oC,EAAA/kC,KAAAk1B,KAAAz2B,SAAApC,IACA0oC,EAAA/kC,KAAA8kC,GAEAC,EAAA/kC,KAAAk1B,KAAAz2B,SAAApC,IACA64B,KAAAz2B,SAAAsmC,EAEA,OAAA7P,MAUAN,EAAA/B,UAAAmS,aAAA,SAAAC,EAAAC,GACA,IAAAC,EAAAjQ,KAAAz2B,SAAAy2B,KAAAz2B,SAAAtE,OAAA,GAUA,OATAgrC,EAAAzB,GACAyB,EAAAH,aAAAC,EAAAC,GAEA,iBAAAC,EACAjQ,KAAAz2B,SAAAy2B,KAAAz2B,SAAAtE,OAAA,GAAAgrC,EAAA/2B,QAAA62B,EAAAC,GAGAhQ,KAAAz2B,SAAAuB,KAAA,GAAAoO,QAAA62B,EAAAC,IAEAhQ,MAUAN,EAAA/B,UAAA9X,iBACA,SAAA+b,EAAAC,GACA7B,KAAA4O,eAAAhP,EAAAkC,YAAAF,IAAAC,GASAnC,EAAA/B,UAAAuS,mBACA,SAAAP,GACA,IAAA,IAAAxoC,EAAA,EAAAi8B,EAAApD,KAAAz2B,SAAAtE,OAAAkC,EAAAi8B,EAAAj8B,IACA64B,KAAAz2B,SAAApC,GAAAqnC,IACAxO,KAAAz2B,SAAApC,GAAA+oC,mBAAAP,GAIA,IAAApO,EAAA/tG,OAAAW,KAAA6rG,KAAA4O,gBACA,IAAAznC,EAAA,EAAAi8B,EAAA7B,EAAAt8B,OAAAkC,EAAAi8B,EAAAj8B,IACAwoC,EAAA/P,EAAAkH,cAAAvF,EAAAp6B,IAAA64B,KAAA4O,eAAArN,EAAAp6B,MAQAu4B,EAAA/B,UAAAS,SAAA,WACA,IAAA5I,EAAA,GAIA,OAHAwK,KAAAp0B,MAAA,SAAA6jC,GACAja,GAAAia,KAEAja,GAOAkK,EAAA/B,UAAAwS,sBAAA,SAAApQ,GACA,IAAApa,EAAA,CACAtwF,KAAA,GACA4/E,KAAA,EACAC,OAAA,GAEA9K,EAAA,IAAAwb,EAAAma,GACAqQ,GAAA,EACAC,EAAA,KACAC,EAAA,KACAC,EAAA,KACAC,EAAA,KAqEA,OApEAxQ,KAAAp0B,MAAA,SAAA6jC,EAAA/pB,GACAC,EAAAtwF,MAAAo6G,EACA,OAAA/pB,EAAA3Q,QACA,OAAA2Q,EAAAzQ,MACA,OAAAyQ,EAAAxQ,QACAm7B,IAAA3qB,EAAA3Q,QACAu7B,IAAA5qB,EAAAzQ,MACAs7B,IAAA7qB,EAAAxQ,QACAs7B,IAAA9qB,EAAA7yF,MACAu3E,EAAAmb,WAAA,CACAxQ,OAAA2Q,EAAA3Q,OACA2Q,SAAA,CACAzQ,KAAAyQ,EAAAzQ,KACAC,OAAAwQ,EAAAxQ,QAEAyQ,UAAA,CACA1Q,KAAA0Q,EAAA1Q,KACAC,OAAAyQ,EAAAzQ,QAEAriF,KAAA6yF,EAAA7yF,OAGAw9G,EAAA3qB,EAAA3Q,OACAu7B,EAAA5qB,EAAAzQ,KACAs7B,EAAA7qB,EAAAxQ,OACAs7B,EAAA9qB,EAAA7yF,KACAu9G,GAAA,GACAA,IACAhmC,EAAAmb,WAAA,CACAI,UAAA,CACA1Q,KAAA0Q,EAAA1Q,KACAC,OAAAyQ,EAAAzQ,UAGAm7B,EAAA,KACAD,GAAA,GAEA,IAAA,IAAAjI,EAAA,EAAAljC,EAAAwqC,EAAAxqC,OAAAkjC,EAAAljC,EAAAkjC,IA3WA,KA4WAsH,EAAAx3B,WAAAkwB,IACAxiB,EAAA1Q,OACA0Q,EAAAzQ,OAAA,EAEAizB,EAAA,IAAAljC,GACAorC,EAAA,KACAD,GAAA,GACAA,GACAhmC,EAAAmb,WAAA,CACAxQ,OAAA2Q,EAAA3Q,OACA2Q,SAAA,CACAzQ,KAAAyQ,EAAAzQ,KACAC,OAAAwQ,EAAAxQ,QAEAyQ,UAAA,CACA1Q,KAAA0Q,EAAA1Q,KACAC,OAAAyQ,EAAAzQ,QAEAriF,KAAA6yF,EAAA7yF,QAIA8yF,EAAAzQ,YAIA8qB,KAAAkQ,oBAAA,SAAA1O,EAAAiP,GACArmC,EAAAyb,iBAAA2b,EAAAiP,MAGA,CAAAp7G,KAAAswF,EAAAtwF,KAAA+0E,IAAAA,IAGA92E,EAAAosG,WAAAA,+ICpYA,MAAMgR,GAAa,EACbC,GAAa,EACbC,GAAS,EACTC,GAAW,EACXlmB,GAAS,EAeR,MAAMmmB,EAaXnE,YAAYoE,EAAeC,EAAqB,IAAIhR,KAZpD+Q,WAYoD,EAAA/Q,KAXpDiR,aAWoD,EAAAjR,KAVpD0Q,gBAUoD,EAAA1Q,KATpD2Q,gBASoD,EAAA3Q,KARpDkR,sBAQoD,EAAAlR,KAPpD4Q,YAOoD,EAAA5Q,KANpD6Q,cAMoD,EAAA7Q,KALpDrV,YAKoD,EAAAqV,KAJpDnV,aAIoD,EAAAmV,KAHpDmR,WAGoD,EAAAnR,KAFpDoR,mBAEoD,EAClDpR,KAAK+Q,MAAQA,EACb/Q,KAAKiR,QAAUD,EAAKC,QACpBjR,KAAK0Q,aAAeM,EAAKN,WACzB1Q,KAAK2Q,aAAeK,EAAKL,WACzB3Q,KAAKkR,mBAAqBF,EAAKE,iBAC/BlR,KAAK4Q,SAAWI,EAAKJ,OACrB5Q,KAAK6Q,WAAaG,EAAKH,SACvB7Q,KAAKrV,SAAWqmB,EAAKrmB,OACrBqV,KAAKnV,UAAYmmB,EAAKnmB,QACtBmV,KAAKmR,MAAsB,MAAdH,EAAKG,MAAgBH,EAAKG,MAAQ,KAC/CnR,KAAKoR,cAAgB,MAIlB,MAAMC,EAAW,IAAIruB,IAE5B,SAASsuB,EAAcz+G,EAAc8B,EAAwB,IAC3DA,EAAQs8G,QAAUp+G,EAClB,MAAM0+G,EAAQ,IAAIT,EAAUj+G,EAAM8B,GAElC,OADA08G,EAAS5vB,IAAI5uF,EAAM0+G,GACZA,EAGT,SAASC,EAAY3+G,EAAcs+G,GACjC,OAAO,IAAIL,EAAUj+G,EAAM,CAAE69G,WAAAA,EAAYS,MAAAA,UAG9BM,EAAuC,CAClDC,IAAK,IAAIZ,EAAU,MAAO,CAAEH,WAAAA,IAC5BgB,OAAQ,IAAIb,EAAU,SAAU,CAAEH,WAAAA,IAClCiB,QAAS,IAAId,EAAU,UAAW,CAAEH,WAAAA,IACpCkB,OAAQ,IAAIf,EAAU,SAAU,CAAEH,WAAAA,IAClChV,OAAQ,IAAImV,EAAU,SAAU,CAAEH,WAAAA,IAClC99G,KAAM,IAAIi+G,EAAU,OAAQ,CAAEH,WAAAA,IAC9BmB,YAAa,IAAIhB,EAAU,QAAS,CAAEH,WAAAA,IACtCoB,IAAK,IAAIjB,EAAU,OAGnBkB,SAAU,IAAIlB,EAAU,IAAK,CAAEJ,WAAAA,EAAYC,WAAAA,IAC3CsB,aAAc,IAAInB,EAAU,KAAM,CAAEJ,WAAAA,EAAYC,WAAAA,IAChDuB,YAAa,IAAIpB,EAAU,KAAM,CAAEJ,WAAAA,EAAYC,WAAAA,IAC/CwB,SAAU,IAAIrB,EAAU,KACxBsB,YAAa,IAAItB,EAAU,MAC3BuB,OAAQ,IAAIvB,EAAU,IAAK,CAAEJ,WAAAA,EAAYC,WAAAA,IACzC2B,UAAW,IAAIxB,EAAU,KAAM,CAAEJ,WAAAA,EAAYC,WAAAA,IAC7C4B,WAAY,IAAIzB,EAAU,KAAM,CAAEJ,WAAAA,EAAYC,WAAAA,IAC9C6B,OAAQ,IAAI1B,EAAU,IAAK,CAAEJ,WAAAA,IAC7B+B,UAAW,IAAI3B,EAAU,MACzB4B,OAAQ,IAAI5B,EAAU,IAAK,CAAEJ,WAAAA,EAAYC,WAAAA,IACzCgC,OAAQ,IAAI7B,EAAU,KACtBlpB,MAAO,IAAIkpB,EAAU,IAAK,CAAEJ,WAAAA,IAC5B5qC,KAAM,IAAIgrC,EAAU,IAAK,CAAEJ,WAAAA,IAC3BkC,MAAO,IAAI9B,EAAU,IAAK,CAAEJ,WAAAA,IAC5BmC,YAAa,IAAI/B,EAAU,KAAM,CAAEJ,WAAAA,IACnCoC,IAAK,IAAIhC,EAAU,KACnBiC,SAAU,IAAIjC,EAAU,IAAK,CAAEJ,WAAAA,IAC/BsC,YAAa,IAAIlC,EAAU,MAC3BmC,MAAO,IAAInC,EAAU,KAAM,CAAEJ,WAAAA,IAC7Bh8G,SAAU,IAAIo8G,EAAU,YACxBoC,SAAU,IAAIpC,EAAU,MAAO,CAAEJ,WAAAA,IACjCyC,UAAW,IAAIrC,EAAU,IAAK,CAAEH,WAAAA,IAChCyC,aAAc,IAAItC,EAAU,KAAM,CAAEJ,WAAAA,EAAYC,WAAAA,IAChDvI,GAAI,IAAI0I,EAAU,KAClBuC,KAAM,IAAIvC,EAAU,IAAK,CAAEH,WAAAA,IAG3B2C,qBAAsB,IAAIxC,EAAU,SAgBpCyC,GAAI,IAAIzC,EAAU,IAAK,CAAEJ,WAAAA,EAAYG,SAAAA,IACrCpT,OAAQ,IAAIqT,EAAU,KAAM,CAAEJ,WAAAA,EAAYG,SAAAA,IAC1C2C,YAAa,IAAI1C,EAAU,KAAM,CAAEJ,WAAAA,EAAYG,SAAAA,IAC/C4C,OAAQ,IAAI3C,EAAU,QAAS,CAAEnmB,OAAAA,EAAQE,SAjH3B,EAiHoC8lB,WAAAA,IAClD+C,KAAM,IAAI5C,EAAU,IAAK,CAAEJ,WAAAA,EAAY/lB,OAAAA,EAAQgmB,WAAAA,IAC/CgD,MAAO,IAAI7C,EAAU,IAAK,CAAEJ,WAAAA,EAAY/lB,OAAAA,EAAQgmB,WAAAA,IAChDiD,SAAUpC,EAAY,KAAM,GAC5BqC,kBAAmBrC,EAAY,KAAM,GACrCsC,UAAWtC,EAAY,KAAM,GAC7BuC,WAAYvC,EAAY,KAAM,GAC9BwC,UAAWxC,EAAY,IAAK,GAC5ByC,WAAYzC,EAAY,IAAK,GAC7B0C,WAAY1C,EAAY,IAAK,GAC7B2C,SAAU3C,EAAY,gBAAiB,GACvC4C,WAAY5C,EAAY,YAAa,GACrC6C,SAAU7C,EAAY,YAAa,GACnC8C,QAAS,IAAIxD,EAAU,MAAO,CAAEJ,WAAAA,EAAYS,MAAO,EAAGxmB,OAAAA,EAAQgmB,WAAAA,IAE9D4D,OAAQ,IAAIzD,EAAU,IAAK,CAAEJ,WAAAA,EAAYS,MAAO,GAAIR,WAAAA,IAEpD6D,KAAM,IAAI1D,EAAU,IAAK,CAAEK,MAAO,KAClCsD,MAAOjD,EAAY,IAAK,IACxBkD,SAAU,IAAI5D,EAAU,KAAM,CAC5BJ,WAAAA,EACAS,MAAO,GACPD,kBAAkB,IAMpByD,OAAQrD,EAAc,SACtBsD,MAAOtD,EAAc,OAAQ,CAAEZ,WAAAA,IAC/BmE,OAAQvD,EAAc,SACtBwD,UAAWxD,EAAc,YACzByD,UAAWzD,EAAc,YACzB0D,SAAU1D,EAAc,UAAW,CAAEZ,WAAAA,IACrCuE,IAAK3D,EAAc,KAAM,CAAEV,OAAAA,EAAQF,WAAAA,IACnCwE,MAAO5D,EAAc,OAAQ,CAAEZ,WAAAA,IAC/ByE,SAAU7D,EAAc,WACxB8D,KAAM9D,EAAc,MAAO,CAAEV,OAAAA,IAC7ByE,UAAW/D,EAAc,WAAY,CAAEX,WAAAA,IACvC2E,IAAKhE,EAAc,MACnBiE,QAASjE,EAAc,SAAU,CAAEZ,WAAAA,IACnC8E,QAASlE,EAAc,UACvBmE,OAAQnE,EAAc,QAAS,CAAEZ,WAAAA,EAAY/lB,OAAAA,EAAQgmB,WAAAA,IACrD+E,KAAMpE,EAAc,OACpBqE,KAAMrE,EAAc,OACpBsE,OAAQtE,EAAc,SACtBuE,OAAQvE,EAAc,QAAS,CAAEV,OAAAA,IACjCkF,MAAOxE,EAAc,QACrByE,KAAMzE,EAAc,MAAO,CAAEZ,WAAAA,EAAYC,WAAAA,IACzCqF,MAAO1E,EAAc,OAAQ,CAAEX,WAAAA,IAC/BsF,OAAQ3E,EAAc,QAAS,CAAEX,WAAAA,IACjCuF,OAAQ5E,EAAc,QAAS,CAAEX,WAAAA,IACjCwF,SAAU7E,EAAc,UAAW,CAAEZ,WAAAA,IACrC0F,QAAS9E,EAAc,UACvB+E,QAAS/E,EAAc,SAAU,CAAEX,WAAAA,IACnC2F,MAAOhF,EAAc,OAAQ,CAAEX,WAAAA,IAC/B4F,MAAOjF,EAAc,OAAQ,CAAEX,WAAAA,IAC/B6F,OAAQlF,EAAc,QAAS,CAAEX,WAAAA,IACjC8F,IAAKnF,EAAc,KAAM,CAAEZ,WAAAA,EAAYS,MAAO,IAC9CuF,YAAapF,EAAc,aAAc,CAAEZ,WAAAA,EAAYS,MAAO,IAC9DwF,QAASrF,EAAc,SAAU,CAAEZ,WAAAA,EAAY/lB,OAAAA,EAAQgmB,WAAAA,IACvDiG,MAAOtF,EAAc,OAAQ,CAAEZ,WAAAA,EAAY/lB,OAAAA,EAAQgmB,WAAAA,IACnDkG,QAASvF,EAAc,SAAU,CAAEZ,WAAAA,EAAY/lB,OAAAA,EAAQgmB,WAAAA,KCtM5CmG,EAAY,yBACZC,EAAa,IAAIC,OAAOF,EAAU/hC,OAAQ,KAGhD,SAASkiC,EAAU5hH,GACxB,OAAQA,GACN,KAAA,GACA,KAAA,GACA,KAAA,KACA,KAAA,KACE,OAAO,EAET,QACE,OAAO,GAIN,MAAM6hH,EAAiB,gCAGvB,SAASC,EAAa9hH,GAC3B,OAAQA,GACN,KAAK,EACL,KAAK,GACL,KAAK,GACL,KAAA,GACA,KAAA,IACA,KAAA,KACA,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,KACL,KAAK,MACL,KAAK,MACH,OAAO,EAET,QACE,OAAO,GCzCN,MAAM+hH,EAIXzK,YAAY13B,EAAcoiC,GAAarX,KAHvC/qB,UAGuC,EAAA+qB,KAFvC9qB,YAEuC,EACrC8qB,KAAK/qB,KAAOA,EACZ+qB,KAAK9qB,OAASmiC,GAIX,MAAMC,EAMX3K,YAAY33B,EAAiBhQ,GAAgBg7B,KAL7ChrB,WAK6C,EAAAgrB,KAJ7Ch7B,SAI6C,EAAAg7B,KAH7C9d,cAG6C,EAAA8d,KAF7CuX,oBAE6C,EAC3CvX,KAAKhrB,MAAQA,EAEbgrB,KAAKh7B,IAAMA,GCDf,SAAS+W,EAAQy7B,GACf,OAAOA,EAAMA,EAAMvyC,OAAS,GC5BvB,MAAMwyC,EAAajkH,OAAOc,OAAO,CACtCu7E,YAAa,4BACb6nC,sBAAuB,4CCOZC,EAAgBC,EAC3B,CACEC,oBAAqB,iCACrBC,iBACE,8DACFC,sCACE,2EACFC,uBACE,8DACFC,oCACE,2DACFC,+BACE,uDACFC,uBACE,mFACFC,wBAAyB,kDACzBC,eAAgB,uDAChBC,eAAgB,0DAChBC,uBACE,kEACFC,sBAAuB,oDACvBC,6BACE,6DACFC,sBAAuB,4CACvBC,mBAAoB,0CACpBC,uBAAwB,oCACxBC,8BAA+B,wCAC/BC,sBACE,oKACFC,qBACE,kFACFC,qBACE,mHACFC,mBAAoB,kDACpBC,qBAAsB,gDACtBC,mBAAoB,2CACpBC,uBACE,qGACFC,qBAAsB,2CACtBC,uBAAwB,8CACxBC,gBACE,uEACFC,eAAgB,sCAChBC,qBAAsB,qCACtBC,iBAAkB,qCAClBC,2BAA4B,0BAC5BC,sBACE,uIACFC,8BACE,iEACFC,uBACE,8DACFC,WAAY,0DACZC,SAAU,gEACVC,kCACE,sEACFC,qBAAsB,kBACtBC,6BACE,6EACFC,cAAe,gCACfC,sBACE,oGACFC,gCACE,6DACFC,gBAAiB,kCACjBC,2BAA4B,mCAC5BC,yBAA0B,sCAC1BC,qBAAsB,yBACtBC,iBAAkB,4BAClBC,eAAgB,mBAChBC,aAAc,+BACdC,sBAAuB,iCACvBC,8BAA+B,uCAC/BC,2BAA4B,iCAC5BC,kBAAmB,yBACnBC,WAAY,gCACZC,kBAAmB,wCACnBC,cAAe,kBACfC,yBACE,iEACFC,yBAA0B,6BAC1BC,+BAAgC,4CAChCC,8BAA+B,mCAC/BC,8BAA+B,6BAC/BC,sBACE,yEACFC,6BAA8B,oCAC9BC,mBAAoB,kCACpBC,oBACE,8EACFC,0BAA2B,wCAC3BC,qBAAsB,mCACtBC,iBAAkB,4BAClBC,sBACE,8DACFC,iBAAkB,qBAClBC,qBAAsB,6CACtBC,0BACE,sFACFC,iCACE,gDACFC,4BACE,+DACFC,kCACE,0DACFC,iCACE,iEACFC,sBAAuB,8BACvBC,yBAA0B,4BAC1BC,kBAAmB,+BACnBC,iBAAkB,mCAClBC,iBAAkB,oCAClBC,iCACE,8FACFC,kBACE,0FACFC,sBACE,2DACFC,2BACE,6DACFC,sBACE,kEACFC,UAAW,uBACXC,mBAAoB,iDACpBC,iBAAkB,wCAClBC,oBACE,oGACFC,+BACE,kEACFC,+BACE,qEACFC,oBACE,+DACFC,uBACE,uEACFC,kCACE,+FACFC,oBACE,yGACFC,yBAA0B,8BAC1BC,0CACE,oIACFC,4CACE,sIACFC,6CACE,uIACFC,cAAe,oDACfC,kBAAmB,gDACnBC,eACE,2HACFC,gBAAiB,wDACjBC,aAAc,0CACdC,oBAAqB,oCACrBC,2BAA4B,+BAC5BC,eACE,sFACFC,oBACE,yDACFC,mBAAoB,wDACpBC,WAAY,yBACZC,gBACE,oJACFC,kBAAmB,6CACnBC,kBAAmB,kDACnBC,yCACE,mIACFC,2CACE,qIACFC,4CACE,sIACFC,8BAA+B,mCAC/BC,iCACE,2FACFC,yBAA0B,qCAC1BC,uBACE,0DACFC,kBAAmB,2BACnBC,2BACE,8DACFC,6BACE,mEACFC,oBACE,kEACFC,2BACE,0DACFC,uBACE,0JACFC,uBAAwB,iCACxBC,gBAAiB,yDACjBC,gBAAiB,yBACjBC,mCACE,mFACFC,gBAAiB,kDACjBC,2BACE,sDACFC,yBACE,8EACFC,kBACE,4DACFC,wBAAyB,gDACzBC,8BACE,oDACFC,6BACE,mEACFC,iBACE,wHACFC,oBAAqB,wBACrBC,mBAAoB,mCACpBC,mBAAoB,gCACpBC,qBAAsB,yBACtBC,iBAAkB,6CAClBC,uBACE,wDACFC,iBAAkB,wDAClBC,0BACE,sDAEOtJ,EAAW5nC,aAGXmxC,EAAgCpJ,EAC3C,CACEqJ,wBAA0B,4DAC1BC,oBAAsB,uEAEbzJ,EAAWC,uBC9MjB,SAASE,EACdloC,EAGAr6E,GAEA,MAAM8rH,EAA4B,GAQlC,OAPA3tH,OAAOW,KAAKu7E,GAAUt7E,SAAQgtH,IAC5BD,EAAUC,GAAc5tH,OAAOc,OAAO,CACpCe,KAAAA,EACA+rH,WAAAA,EACA1sH,SAAUg7E,EAAS0xC,QAGhB5tH,OAAOc,OAAO6sH,GCpChB,MAAME,EACX1U,YAAY4E,EAAe+P,GAAyBthB,KAKpDuR,WALoD,EAAAvR,KAMpDshB,mBANoD,EAClDthB,KAAKuR,MAAQA,EACbvR,KAAKshB,gBAAkBA,GAOpB,MAAM7P,EAET,CACF8P,MAAO,IAAIF,EAAW,KACtBG,cAAe,IAAIH,EAAW,MAC9B3sH,SAAU,IAAI2sH,EAAW,KAAK,IAahCI,EAAGjP,OAAOpB,cAAgB5nC,IACpBA,EAAQvE,OAAS,GACnBuE,EAAQyU,OAKZwjC,EAAGpP,OAAOjB,cAAgBqQ,EAAGlP,WAAWnB,cAAgB5nC,IACtDA,EAAQsB,KAAK2mC,EAAM8P,QAGrBE,EAAGrO,aAAahC,cAAgB5nC,IAC9BA,EAAQsB,KAAK2mC,EAAM+P,gBAGrBC,EAAGtO,UAAU/B,cAAgB5nC,IACvBA,EAAQA,EAAQvE,OAAS,KAAOwsC,EAAM/8G,SACxC80E,EAAQyU,MAERzU,EAAQsB,KAAK2mC,EAAM/8G,WC5CvB,IAAIgtH,EAA+B,w6BAE/BC,EAA0B,kjBAE9B,MAAMC,EAA0B,IAAI5K,OAClC,IAAM0K,EAA+B,KAEjCG,EAAqB,IAAI7K,OAC7B,IAAM0K,EAA+BC,EAA0B,KAGjED,EAA+BC,EAA0B,KASzD,MAAMG,EAA6B,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,IAAI,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,EAAE,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,KAAK,GAAG,EAAE,KAAK,IAAI,GAAG,EAAE,GAAG,EAAE,EAAE,IAAI,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,GAAG,GAAG,EAAE,GAAG,EAAE,IAAI,GAAG,KAAK,IAAI,GAAG,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,MAAM,GAAG,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,KAAK,KAAK,IAAI,KAAK,MAEpyCC,EAAwB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,KAKnqB,SAASC,EAAc3sH,EAAcosF,GACnC,IAAI7J,EAAM,MACV,IAAK,IAAIzQ,EAAI,EAAGlC,EAASwc,EAAIxc,OAAQkC,EAAIlC,EAAQkC,GAAK,EAAG,CAEvD,GADAyQ,GAAO6J,EAAIta,GACPyQ,EAAMviF,EAAM,OAAO,EAGvB,GADAuiF,GAAO6J,EAAIta,EAAI,GACXyQ,GAAOviF,EAAM,OAAO,EAE1B,OAAO,EAKF,SAAS4sH,EAAkB5sH,GAChC,OAAIA,EAAI,GAAoC,KAAJA,EACpCA,GAAI,KACJA,EAAI,GAAoC,KAAJA,EACpCA,GAAI,MACJA,GAAQ,MAERA,GAAQ,KAAQusH,EAAwBn8C,KAAKY,OAAO67C,aAAa7sH,IAG9D2sH,EAAc3sH,EAAMysH,KAKtB,SAASK,EAAiB9sH,GAC/B,OAAIA,EAAI,GAAgC,KAAJA,EAChCA,EAAI,MACJA,EAAI,MACJA,GAAI,KACJA,EAAI,GAAoC,KAAJA,EACpCA,GAAI,MACJA,GAAQ,MACHA,GAAQ,KAAQwsH,EAAmBp8C,KAAKY,OAAO67C,aAAa7sH,IAGnE2sH,EAAc3sH,EAAMysH,IACpBE,EAAc3sH,EAAM0sH,MC/ExB,MAAMK,EAsCI,CACN,aACA,YACA,MACA,UACA,UACA,YACA,SACA,SACA,SA/CEA,EAiDQ,CAAC,OAAQ,aAEjB/Q,EAAW,IAAI1yB,IAlDV,CACP,QACA,OACA,QACA,WACA,WACA,UACA,KACA,OACA,UACA,MACA,WACA,KACA,SACA,SACA,QACA,MACA,MACA,QACA,QACA,OACA,MACA,OACA,QACA,QACA,UACA,SACA,SACA,OACA,OACA,QACA,KACA,aACA,SACA,OACA,WAgBE0jC,EAAyB,IAAI1jC,IAAIyjC,GACjCE,EAA6B,IAAI3jC,IAAIyjC,GAKpC,SAASG,EAAeC,EAAcC,GAC3C,OAAQA,GAAqB,UAATD,GAA8B,SAATA,EAQpC,SAASE,EAAqBF,EAAcC,GACjD,OAAOF,EAAeC,EAAMC,IAAaJ,EAAuBtjC,IAAIyjC,GAO/D,SAASG,EAA6BH,GAC3C,OAAOF,EAA2BvjC,IAAIyjC,GAQjC,SAASI,EACdJ,EACAC,GAEA,OACEC,EAAqBF,EAAMC,IAAaE,EAA6BH,GAIlE,SAASK,EAAUL,GACxB,OAAOnR,EAAStyB,IAAIyjC,GCjEtB,MAAMM,EAAsB,IAAInkC,IAAI,CAClC,QACA,OACA,QACA,WACA,WACA,UACA,KACA,OACA,UACA,MACA,WACA,KACA,SACA,SACA,QACA,MACA,MACA,QACA,QACA,OACA,MACA,OACA,QACA,QACA,UACA,SACA,SACA,OACA,OACA,QACA,KACA,aACA,SACA,OACA,SAEA,aACA,YACA,MACA,UACA,UACA,YACA,SACA,SACA,QAEA,OACA,YAEA,OACA,UC5EK,MAOMokC,EAAqB,GAErBC,EAAqB,IA2BrBC,EAA6B,IAG7BC,EAA6B,KAC7BC,EAA6B,KCtBnC,MAAMC,EASXzW,YAAY0W,GAAmBrjB,KAN/BsjB,IAAmB,IAAI3kC,IAMQqhB,KAJ/BujB,QAAuB,IAAI5kC,IAIIqhB,KAF/BwjB,UAAyB,IAAI7kC,IAG3BqhB,KAAKqjB,MAAQA,GAMF,MAAMI,EAOnB9W,YAAY+W,EAAsBjB,GAAmBziB,KANrD2jB,WAA4B,GAMyB3jB,KAHrD4jB,iBAAwC,IAAI5gC,IAGSgd,KAFrD6jB,sBAA6C,IAAI7gC,IAG/Cgd,KAAK0jB,MAAQA,EACb1jB,KAAKyiB,SAAWA,EAGJqB,iBACZ,OD7C8B,EC6CtB9jB,KAAK+jB,wBAA2C,EAE5CC,iBACZ,OD7C8B,GC6CtBhkB,KAAKikB,yBAAyC,EAEpCC,uBAClB,OD/C8B,GC+CtBlkB,KAAKikB,yBAAgD,EAEpDE,cACT,OAAQnkB,KAAKikB,wBAA0BlB,GAAe,EAErBqB,sCACjC,MAAMf,EAAQrjB,KAAKikB,wBACnB,OAAQZ,EAAQN,GAAe,GAAkC,ID1DnC,EC0DOM,GAEtBgB,oBACf,ODvD8B,ICuDtBrkB,KAAKikB,yBAAgD,EAEzCK,yBACpB,ODhE8B,ECgEtBtkB,KAAKikB,yBAA4C,EAEpCM,0BACrB,OAAOvkB,KAAKwkB,2BAA2BxkB,KAAKykB,gBAG9CC,YAAYrB,GACV,OAAO,IAAID,EAAMC,GAKnBsB,MAAMtB,GACJrjB,KAAK2jB,WAAW74C,KAAKk1B,KAAK0kB,YAAYrB,IAGxCuB,OACE5kB,KAAK2jB,WAAW1lC,MAMlBumC,2BAA2BK,GACzB,SDxF8B,ECyF5BA,EAAMxB,QACJrjB,KAAKyiB,UD3FqB,EC2FToC,EAAMxB,OAI7ByB,YAAYjyH,EAAcukG,EAA2Bxf,GACnD,IAAIitC,EAAQ7kB,KAAKykB,eACjB,GDpEsC,ECoElCrtB,GDnEkC,GCmEEA,EACtC4I,KAAK+kB,0BAA0BF,EAAOhyH,EAAMukG,EAAaxf,GDpErB,GCsEhCwf,EACFytB,EAAMrB,UAAUxkC,IAAInsF,GAEpBgyH,EAAMtB,QAAQvkC,IAAInsF,GD1EgB,EC6EhCukG,GACF4I,KAAKglB,mBAAmBH,EAAOhyH,QAE5B,GDjF+B,ECiF3BukG,EACT,IAAK,IAAIjwB,EAAI64B,KAAK2jB,WAAW1+C,OAAS,EAAGkC,GAAK,IAC5C09C,EAAQ7kB,KAAK2jB,WAAWx8C,GACxB64B,KAAK+kB,0BAA0BF,EAAOhyH,EAAMukG,EAAaxf,GACzDitC,EAAMvB,IAAItkC,IAAInsF,GACdmtG,KAAKglB,mBAAmBH,EAAOhyH,KDzGdoyH,IC2GbJ,EAAMxB,UANuCl8C,GASjD64B,KAAKyiB,UDvHqB,ECuHToC,EAAMxB,OACzBrjB,KAAK4jB,iBAAiBngC,OAAO5wF,GAIjCmyH,mBAAmBH,EAAehyH,GAC5BmtG,KAAKyiB,UD7HqB,EC6HToC,EAAMxB,OACzBrjB,KAAK4jB,iBAAiBngC,OAAO5wF,GAIjCkyH,0BACEF,EACAhyH,EACAukG,EACAxf,GAEIooB,KAAKklB,oBAAoBL,EAAOhyH,EAAMukG,IACxC4I,KAAK0jB,MAAM9rC,EAAKutC,EAAOvE,iBAAkB/tH,GAI7CqyH,oBACEL,EACAhyH,EACAukG,GAEA,SDzHsC,ECyHhCA,KDrHgC,ECuHlCA,EAEAytB,EAAMtB,QAAQxkC,IAAIlsF,IAClBgyH,EAAMrB,UAAUzkC,IAAIlsF,IACpBgyH,EAAMvB,IAAIvkC,IAAIlsF,GD1HoB,GC8HlCukG,EAEAytB,EAAMtB,QAAQxkC,IAAIlsF,KAChBmtG,KAAKwkB,2BAA2BK,IAAUA,EAAMvB,IAAIvkC,IAAIlsF,GAK3DgyH,EAAMtB,QAAQxkC,IAAIlsF,MDjKS,ECmKxBgyH,EAAMxB,OACNwB,EAAMtB,QAAQnmB,SAAShgB,OAAO1pF,QAAUb,KAE1CmtG,KAAKwkB,2BAA2BK,IAAUA,EAAMrB,UAAUzkC,IAAIlsF,IAIpEuyH,iBAAiBnhC,GACf,MAAMpxF,KAAEA,GAASoxF,EACXohC,EAAgBrlB,KAAK2jB,WAAW,GAEnC0B,EAAc9B,QAAQxkC,IAAIlsF,IAC1BwyH,EAAc/B,IAAIvkC,IAAIlsF,IAItBwyH,EAAc7B,UAAUzkC,IAAIlsF,IAE7BmtG,KAAK4jB,iBAAiBniC,IAAI5uF,EAAMoxF,EAAGjP,OAIvCyvC,eACE,OAAOzkB,KAAK2jB,WAAW3jB,KAAK2jB,WAAW1+C,OAAS,GAIlD8+C,uBACE,IAAK,IAAI58C,EAAI64B,KAAK2jB,WAAW1+C,OAAS,GAAKkC,IAAK,CAC9C,MAAMk8C,MAAEA,GAAUrjB,KAAK2jB,WAAWx8C,GAClC,GD3LmB89C,IC2Lf5B,EACF,OAAOA,GAObY,wBACE,IAAK,IAAI98C,EAAI64B,KAAK2jB,WAAW1+C,OAAS,GAAKkC,IAAK,CAC9C,MAAMk8C,MAAEA,GAAUrjB,KAAK2jB,WAAWx8C,GAClC,GAAS,IAALk8C,KD7MwB,EC6MeA,GACzC,OAAOA,IC1Mf,MAAMiC,WAAkBlC,EAAMvsH,eAAAu/E,GAAAmvC,SAAAnvC,GAAA4pB,KAE5BwlB,iBAAgC,IAAI7mC,KAGvB,MAAM8mC,WAAyBhC,EAC5CiB,YAAYrB,GACV,OAAO,IAAIiC,GAAUjC,GAGvByB,YAAYjyH,EAAcukG,EAA2Bxf,GACnD,MAAMitC,EAAQ7kB,KAAKykB,eACnB,GAAIrtB,EAAc+rB,EAIhB,OAHAnjB,KAAK+kB,0BAA0BF,EAAOhyH,EAAMukG,EAAaxf,GACzDooB,KAAKglB,mBAAmBH,EAAOhyH,QAC/BgyH,EAAMW,iBAAiBxmC,IAAInsF,GAI7B0yH,MAAMT,eAAezuC,WAGvB6uC,oBACEL,EACAhyH,EACAukG,GAEA,QAAImuB,MAAML,uBAAuB7uC,eAE7B+gB,EAAc+rB,MAEb0B,EAAMW,iBAAiBzmC,IAAIlsF,KAC3BgyH,EAAMtB,QAAQxkC,IAAIlsF,IAASgyH,EAAMrB,UAAUzkC,IAAIlsF,KAOtDuyH,iBAAiBnhC,GACV+b,KAAK2jB,WAAW,GAAG6B,iBAAiBzmC,IAAIkF,EAAGpxF,OAC9C0yH,MAAMH,iBAAiBnhC,ICxB7B,MAAMyhC,GAAgB,IAAI/mC,IAAI,CAC5B,IACA,MACA,OACA,UACA,QACA,UACA,QACA,YACA,QACA,OACA,SACA,SACA,SACA,OACA,SACA,SAKIgnC,GAAa/N,EACjB,CACEgO,0BACE,iFACFC,2BACE,yKACFC,mBAAoB,qCACpBC,oBACE,0DACFC,6BACE,sEACFC,8BACE,gDACFC,gCACE,sGACFC,wBACE,oGACFC,6BACE,+KACFC,wBACE,mGACFC,uCACE,uGACFC,wCACE,gFACFC,uCACE,qEACFC,wCACE,iHACFC,sBACE,2HACFC,+BACE,0EACFC,0CACE,8GACFC,0BAA2B,2CAC3BC,oCACE,yKACFC,mBACE,8EACFC,uBACE,2EACFC,gBAAiB,gDACjBC,oCACE,0FACFC,wBACE,0GACFC,oBACE,mEACFC,kBACE,0DACFC,uBACE,iFACFC,0BAA2B,2CAC3BC,eAAgB,0CAChBC,4BACE,0DACFC,6BACE,oGACFC,0BAA2B,2CAC3BC,qBACE,6DACFC,mBAAoB,qDACpBC,sBACE,oHACFC,kBACE,uEACFC,kCACE,uEACFC,uBAAwB,+BACxBC,6BACE,yDACFC,mCACE,wDACFC,qBACE,mEACFC,6BACE,mDACFC,kCACE,oEACFC,gDACE,oHACFC,6BACE,0DACFC,oCACE,oEACFC,wBAAyB,8BAEhBjR,EAAW5nC,aAcxB,SAAS84C,GAAkB1hD,GACzB,MAA2B,SAApBA,EAAK2hD,YAA6C,WAApB3hD,EAAK2hD,WAG5C,SAASC,GAAqBC,GAC5B,OACGA,EAAMhiD,OAAS26C,EAAG5uH,QAAUi2H,EAAMhiD,KAAKmqC,UAA4B,SAAhB6X,EAAMp1H,MAI9D,MAAMq1H,GAAoB,CACxBC,MAAO,qBACPC,IAAK,qBACLniD,KAAM,cACNoiD,UAAW,oBAgBb,MAAMC,GAAoB,yBCnL1B,MAAMC,GAAuC,CAC3CljH,KAAM,IACN5O,IAAK,IACLujF,KAAM,IACN3jF,GAAI,IACJF,GAAI,IACJ+L,KAAM,IACN2P,MAAO,IACPhW,KAAM,IACN4d,MAAO,IACPuP,OAAQ,IACR5uB,IAAK,IACL+sB,OAAQ,IACR9gB,KAAM,IACNtM,IAAK,IACLqC,KAAM,IACN4H,KAAM,IACNwP,MAAO,IACP3a,IAAK,IACLiB,IAAK,IACLJ,IAAK,IACL8H,KAAM,IACN3K,IAAK,IACL4/B,OAAQ,IACRrvB,KAAM,IACNC,KAAM,IACNuC,MAAO,IACPyL,MAAO,IACP/Q,KAAM,IACNstB,OAAQ,IACR1lB,MAAO,IACP/E,KAAM,IACNlD,KAAM,IACN0W,MAAO,IACPsR,OAAQ,IACRD,OAAQ,IACRE,OAAQ,IACRyC,OAAQ,IACRzL,OAAQ,IACRP,OAAQ,IACRjZ,MAAO,IACPwa,OAAQ,IACR/oB,KAAM,IACNmP,MAAO,IACPT,MAAO,IACP+d,OAAQ,IACR8C,OAAQ,IACRN,OAAQ,IACR7b,MAAO,IACPzQ,KAAM,IACN8vB,OAAQ,IACRL,OAAQ,IACR/b,MAAO,IACP3R,KAAM,IACN5I,IAAK,IACLm9B,OAAQ,IACRc,OAAQ,IACRR,OAAQ,IACR1c,MAAO,IACPke,OAAQ,IACR/xB,KAAM,IACNga,MAAO,IACP6X,OAAQ,IACRwG,OAAQ,IACRR,OAAQ,IACR/c,MAAO,IACP9W,KAAM,IACNm3B,OAAQ,IACRrhB,MAAO,IACPH,MAAO,IACPqF,OAAQ,IACRP,OAAQ,IACRjZ,MAAO,IACPwa,OAAQ,IACR/oB,KAAM,IACNmP,MAAO,IACPT,MAAO,IACP+d,OAAQ,IACR8C,OAAQ,IACRN,OAAQ,IACR7b,MAAO,IACPzQ,KAAM,IACN8vB,OAAQ,IACRL,OAAQ,IACR/b,MAAO,IACP3R,KAAM,IACN5I,IAAK,IACLm9B,OAAQ,IACRc,OAAQ,IACRR,OAAQ,IACR1c,MAAO,IACPke,OAAQ,IACR/xB,KAAM,IACN0lB,OAAQ,IACRmM,OAAQ,IACRwG,OAAQ,IACRR,OAAQ,IACR/c,MAAO,IACP9W,KAAM,IACNm3B,OAAQ,IACRrhB,MAAO,IACP9U,KAAM,IACNo/G,MAAO,IACPC,MAAO,IACPC,OAAQ,IACRC,OAAQ,IACRC,KAAM,IACNC,KAAM,IACNC,KAAM,IACNhW,MAAO,IACPiW,MAAO,IACPC,KAAM,IACNC,MAAO,IACPC,MAAO,IACPC,QAAS,IACTC,KAAM,IACNC,IAAK,IACLC,MAAO,IACPC,KAAM,IACNC,MAAO,IACPC,OAAQ,IACRC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,QAAS,IACTC,GAAI,IACJC,IAAK,IACLC,MAAO,IACPC,IAAK,IACLC,QAAS,IACTC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,MAAO,IACPC,MAAO,IACPC,KAAM,IACNC,MAAO,IACPC,MAAO,IACPC,QAAS,IACTC,KAAM,IACNC,IAAK,IACLC,MAAO,IACPC,KAAM,IACNC,MAAO,IACPC,OAAQ,IACRC,GAAI,IACJC,GAAI,IACJC,GAAI,IACJC,QAAS,IACTC,GAAI,IACJC,IAAK,IACLC,OAAQ,IACRC,MAAO,IACPC,IAAK,IACLC,QAAS,IACTC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,MAAO,IACPC,SAAU,IACVC,MAAO,IACPC,IAAK,IACLC,KAAM,IACNC,KAAM,IACNC,OAAQ,IACRC,KAAM,IACNC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,OAAQ,IACRC,OAAQ,IACRC,KAAM,IACNC,OAAQ,IACRC,OAAQ,IACRC,MAAO,IACPC,MAAO,IACPC,OAAQ,IACRC,OAAQ,IACRC,MAAO,IACPC,MAAO,IACPC,KAAM,IACNC,MAAO,IACPC,OAAQ,IACRC,KAAM,IACNC,MAAO,IACPC,QAAS,IACTC,KAAM,IACNC,KAAM,IACNC,KAAM,IACNC,KAAM,IACNC,KAAM,IACNC,MAAO,IACPC,KAAM,IACNC,KAAM,IACNC,KAAM,IACNC,KAAM,IACNC,KAAM,IACNC,OAAQ,IACR5pB,KAAM,IACN6pB,MAAO,IACPC,MAAO,IACPC,MAAO,IACPC,KAAM,IACNC,MAAO,IACPC,GAAI,IACJC,KAAM,IACNC,IAAK,IACLC,MAAO,IACPC,OAAQ,IACRC,MAAO,IACP33C,KAAM,IACN43C,MAAO,IACPC,IAAK,IACLC,IAAK,IACLC,GAAI,IACJC,IAAK,IACLC,IAAK,IACLC,IAAK,IACLC,OAAQ,IACRC,IAAK,IACLC,KAAM,IACNC,MAAO,IACPC,GAAI,IACJC,MAAO,IACPC,GAAI,IACJC,GAAI,IACJC,IAAK,IACLC,IAAK,IACLC,KAAM,IACNC,KAAM,IACNC,KAAM,IACNC,MAAO,IACPC,OAAQ,IACRC,KAAM,IACNC,KAAM,IACNC,MAAO,IACPC,MAAO,IACPC,OAAQ,IACRC,OAAQ,IACRC,KAAM,IACNC,KAAM,IACNC,IAAK,IACLC,OAAQ,IACRC,MAAO,IACPC,OAAQ,IACRC,MAAO,KCxOM,MAAMC,GAAM77H,cAAAmpG,KACzB2yB,YADyB,EAAA3yB,KAEzB4yB,aAFyB,EAAA5yB,KAMzB6yB,cANyB,EAAA7yB,KAOzB8yB,YAPyB,EAAA9yB,KAiBzB+yB,OAAyB,GAjBA/yB,KAoBzBgzB,kBAA4B,EApBHhzB,KA0BzBizB,UAAsB,GA1BGjzB,KAkCzBkzB,0BAAsC,GAlCblzB,KAqCzBmzB,wBAAkC,EArCTnzB,KAsCzBozB,YAAsB,EAtCGpzB,KAuCzBqzB,QAAkB,EAvCOrzB,KAwCzBszB,oBAA8B,EAxCLtzB,KAyCzBuzB,gBAA0B,EAzCDvzB,KA0CzBwzB,gBAA0B,EA1CDxzB,KA2CzByzB,kBAA4B,EA3CHzzB,KA4CzB0zB,iBAA2B,EA5CF1zB,KA+CzB2zB,aAAkC,CAChCC,yBAA0B,EAC1BC,cAAe,MAjDQ7zB,KAqDzB8zB,WAAqB,EArDI9zB,KAsDzB+zB,4BAAsC,EAtDb/zB,KAyDzBg0B,OAIK,GA7DoBh0B,KAkEzBi0B,eAA4C,CAAC,IAlEpBj0B,KAqEzB3kB,SAA6B,GArEJ2kB,KAwEzBk0B,iBAAqC,GAxEZl0B,KAyEzBm0B,gBAAoC,GAzEXn0B,KA0EzBo0B,aAKK,GA/EoBp0B,KAiFzBq0B,oBAA8B,KAjFLr0B,KAoFzBpoB,IAAc,EApFWooB,KAqFzBs0B,UAAoB,EArFKt0B,KAyFzBl5B,KAAkB26C,EAAG1P,IAzFI/R,KA4FzBtsG,MAAa,KA5FYssG,KA+FzBhrB,MAAgB,EA/FSgrB,KAgGzBh7B,IAAc,EAhGWg7B,KAoGzBu0B,cAA0B,KApGDv0B,KAsGzBw0B,gBAA4B,KAtGHx0B,KAuGzBy0B,aAAuB,EAvGEz0B,KAwGzB00B,WAAqB,EAxGI10B,KA6GzBx2B,QAA6B,CAACmrD,EAAGpT,OA7GRvhB,KA8GzB40B,aAAuB,EA9GE50B,KAmHzB60B,aAAuB,EAnHE70B,KA6HzB80B,aAA2C,IAAI9xC,IA7HtBgd,KAgIzB+0B,aAAuB,EAvHvBC,KAAKrgI,GACHqrG,KAAK2yB,QACoB,IAAvBh+H,EAAQsgI,YAAsD,WAAvBtgI,EAAQugI,WAEjDl1B,KAAK4yB,QAAUj+H,EAAQwgI,UACvBn1B,KAAK6yB,SAAW7yB,KAAK8yB,OAAS9yB,KAAKo1B,cAoHrCA,cACE,OAAO,IAAIhe,EAASpX,KAAK4yB,QAAS5yB,KAAKpoB,IAAMooB,KAAKs0B,WAGpDe,MAAMC,GACJ,MAAMxM,EAAQ,IAAI4J,GACZv+H,EAAOX,OAAOW,KAAK6rG,MACzB,IAAK,IAAI74B,EAAI,EAAGlC,EAAS9wE,EAAK8wE,OAAQkC,EAAIlC,EAAQkC,IAAK,CACrD,MAAMnyE,EAAMb,EAAKgzE,GAEjB,IAAIwyB,EAAMqG,KAAKhrG,IAEVsgI,GAAcz3B,MAAM/gB,QAAQ6c,KAC/BA,EAAMA,EAAIv0B,SAIZ0jD,EAAM9zH,GAAO2kG,EAGf,OAAOmvB,GCvJX,MAAMyM,GAAa,gBACbC,GAAiB,QAGjBC,GAAY7d,EAChB,CACE8d,iBACE,+DACFC,yBACE,mDACFC,0BAA2B,iDAC3BC,6BACE,2GACFC,oBACE,iEACFC,uBAAwB,6BACxBC,6BACE,oGAEOve,EAAW5nC,aAoBxB,SAASomD,GAAWC,GAClB,QAAOA,IACa,uBAAhBA,EAAOpvD,MACW,uBAAhBovD,EAAOpvD,MAMf,SAASqvD,GACPD,GAEA,GAAoB,kBAAhBA,EAAOpvD,KACT,OAAOovD,EAAOrjI,KAGhB,GAAoB,sBAAhBqjI,EAAOpvD,KACT,OAAOovD,EAAOE,UAAUvjI,KAAO,IAAMqjI,EAAOrjI,KAAKA,KAGnD,GAAoB,wBAAhBqjI,EAAOpvD,KACT,OACEqvD,GAAoBD,EAAOA,QAC3B,IACAC,GAAoBD,EAAOvqC,UAK/B,MAAM,IAAImN,MAAM,6BAA+Bo9B,EAAOpvD,MA3CxDuvD,EAAGC,OAAS,IAAIjV,EAAW,QAC3BgV,EAAGE,OAAS,IAAIlV,EAAW,SAC3BgV,EAAGG,OAAS,IAAInV,EAAW,kBAAkB,GAE7CI,EAAGgV,QAAU,IAAI3lB,EAAU,WAC3B2Q,EAAGiV,QAAU,IAAI5lB,EAAU,UAAW,CAAEJ,YAAY,IACpD+Q,EAAGkV,YAAc,IAAI7lB,EAAU,cAAe,CAAEH,YAAY,IAC5D8Q,EAAGmV,UAAY,IAAI9lB,EAAU,aAE7B2Q,EAAGkV,YAAYvlB,cAAgB5nC,IAC7BA,EAAQsB,KAAKurD,EAAGG,QAChBhtD,EAAQsB,KAAKurD,EAAGC,SC3ClB,MAAMO,WAAwBzT,EAAMvsH,eAAAu/E,GAAAmvC,SAAAnvC,GAAA4pB,KAClCyR,MAAqB,IAAI9yB,IADSqhB,KAIlC82B,MAAqB,IAAIn4C,IAJSqhB,KAOlC+2B,WAA0B,IAAIp4C,IAPIqhB,KAUlCg3B,QAAuB,IAAIr4C,IAVOqhB,KAgBlCi3B,mBAAkC,IAAIt4C,KAMzB,MAAMu4C,WAA+BzT,EAClDiB,YAAYrB,GACV,OAAO,IAAIwT,GAAgBxT,GAG7ByB,YAAYjyH,EAAcukG,EAA2Bxf,GACnD,MAAMitC,EAAQ7kB,KAAKykB,eACnB,GAAIrtB,EAAc8rB,EAGhB,OAFAljB,KAAKglB,mBAAmBH,EAAOhyH,QAC/BgyH,EAAMoS,mBAAmBj4C,IAAInsF,GAI/B0yH,MAAMT,eAAezuC,WPnBiB,EOqBlC+gB,IPtBkC,EOuB9BA,IAEJ4I,KAAK+kB,0BAA0BF,EAAOhyH,EAAMukG,EAAaxf,GACzDooB,KAAKglB,mBAAmBH,EAAOhyH,IAEjCgyH,EAAMpT,MAAMzyB,IAAInsF,IPjBoB,IOmBlCukG,GAAkCytB,EAAMiS,MAAM93C,IAAInsF,GPlBhB,IOmBlCukG,GAAwCytB,EAAMkS,WAAW/3C,IAAInsF,GAC7DukG,EAAc6rB,GAAkB4B,EAAMmS,QAAQh4C,IAAInsF,GAGxDqyH,oBACEL,EACAhyH,EACAukG,GAEA,GAAIytB,EAAMiS,MAAM/3C,IAAIlsF,GAAO,CACzB,GP9BoC,IO8BhCukG,EAAkC,CAKpC,SPlCkC,IOgCfA,KACFytB,EAAMkS,WAAWh4C,IAAIlsF,GAGxC,OAAO,EAET,OAAIukG,EAAc6rB,GAAoB4B,EAAMmS,QAAQj4C,IAAIlsF,KAClDgyH,EAAMtB,QAAQxkC,IAAIlsF,OPnDc,EOqDxBukG,MPpDwB,EO0DlCA,GAAgCytB,EAAMpT,MAAM1yB,IAAIlsF,KAI7C0yH,MAAML,uBAAuB7uC,WAGtC+uC,iBAAiBnhC,GACf,MAAMohC,EAAgBrlB,KAAK2jB,WAAW,IAChC9wH,KAAEA,GAASoxF,EAEdohC,EAAc5T,MAAM1yB,IAAIlsF,IACxBwyH,EAAc4R,mBAAmBl4C,IAAIlsF,IAEtC0yH,MAAMH,iBAAiBnhC,ICpEd,MAAMkzC,GAA2BtgI,cAAAmpG,KAC9Co3B,OAA2B,GAC3BzS,MAAMtB,GACJrjB,KAAKo3B,OAAOtsD,KAAKu4C,GAGnBuB,OACE5kB,KAAKo3B,OAAOn5C,MAGdo5C,eACE,OAAOr3B,KAAKo3B,OAAOp3B,KAAKo3B,OAAOnyD,OAAS,GAG9BqyD,eACV,OA/CY,EA+CJt3B,KAAKq3B,gBAAgC,EAGnCE,eACV,OApDY,EAoDJv3B,KAAKq3B,gBAAgC,EAGlCG,gBACX,OAtDa,EAsDLx3B,KAAKq3B,gBAAiC,EAGvCI,YACP,OAzDS,EAyDDz3B,KAAKq3B,gBAA6B,GAIvC,SAASK,GACdC,EACAC,GAEA,OAAQD,EAnEM,EAmEkB,IAAMC,EApExB,EAoEoD,GCxBpE,SAASC,GAAWjqB,GAClB,GAAS,MAALA,EAEF,MAAM,IAAI9U,MAAO,cAAa8U,YAEhC,OAAOA,EAGT,SAAS/U,GAAO+U,GACd,IAAKA,EACH,MAAM,IAAI9U,MAAM,eAYpB,MAAMg/B,GAAWlgB,EACf,CACEmgB,gCACE,2EACFC,kCACE,8DACFC,gCAAiC,2CACjCC,sBAAuB,oDACvBC,uBACE,qDACFC,6BACE,8DACFC,gBAAiB,sCACjBC,gCACE,oDACFC,iCACE,4DACFC,+BAAgC,uCAChCC,kBAAmB,4BACnBC,wBAAyB,6BACzBC,mBAAoB,sCACpBC,oBAAqB,uCACrBC,kCACE,+DACFC,yBAA0B,6CAC1BC,sBAAuB,mDACvBC,0BACE,wDACFC,+BACE,iEACFC,yBACE,uDACFC,0BACE,2DACFC,wBACE,sDACFC,4BACE,gDACFC,sBAAuB,4CACvBC,wBACE,0DACFC,iCACE,2DACFC,kCACE,6DACFC,yCACE,mFACFC,2BACE,wDACFC,sBACE,6GACFC,kBACE,iFACFC,0BACE,wDACFC,+BACE,iEACFC,2BACE,oFACFC,sCACE,sDACFC,kCACE,+CACFC,+BACE,yDACFC,8BACE,gDACFC,0BACE,oHACFC,uCACE,mFACFC,4BACE,wEACFC,mBACE,+EACFC,yBAA0B,yCAC1BC,8BACE,8CACFC,8BACE,sDACFC,iCACE,oEACFC,kCACE,6FAEOpjB,EAAW5nC,aAmCxB,SAASirD,GAAmBxsD,GAC1B,MACe,YAAbA,GAAuC,WAAbA,GAAsC,cAAbA,ECrLvDmzC,EAAGsZ,YAAc,IAAIjqB,EAAU,KAAM,CAAEH,YAAY,IAyCnD,MAAMqqB,GAAoBpjB,EACxB,CACEqjB,oBAAqB,6BAEZxjB,EAAW5nC,aC5CjB,SAASqrD,GAAU/vC,EAAqBt4F,GAC7C,OAAOs4F,EAAQvkB,MAAKu0D,GACdt9B,MAAM/gB,QAAQq+C,GACTA,EAAO,KAAOtoI,EAEdsoI,IAAWtoI,IAKjB,SAASuoI,GACdjwC,EACAt4F,EACAwoI,GAEA,MAAMF,EAAShwC,EAAQhN,MAAKg9C,GACtBt9B,MAAM/gB,QAAQq+C,GACTA,EAAO,KAAOtoI,EAEdsoI,IAAWtoI,IAItB,OAAIsoI,GAAUt9B,MAAM/gB,QAAQq+C,GACnBA,EAAO,GAAGE,GAGZ,KAGT,MAAMC,GAAqB,CAAC,UAAW,QAAS,UAC1CC,GAAgC,CAAC,OAAQ,OA4GxC,MAAMC,GAAgD,CAC3DC,OC7IcC,GACd,cAAcA,EACZC,oBAAmB18C,QAAEA,EAAFokC,MAAWA,IAC5B,IAAIuY,EAAQ,KACZ,IACEA,EAAQ,IAAI5kB,OAAO/3B,EAASokC,GAC5B,MAAOtvH,IAIT,MAAMkzE,EAAO+4B,KAAK67B,mBAA0CD,GAG5D,OAFA30D,EAAK20D,MAAQ,CAAE38C,QAAAA,EAASokC,MAAAA,GAEjBp8C,EAGT60D,mBAAmBpoI,GAEjB,IAAIqoI,EACJ,IAEEA,EAASC,OAAOtoI,GAChB,MAAAuoI,GACAF,EAAS,KAEX,MAAM90D,EAAO+4B,KAAK67B,mBAA0CE,GAG5D,OAFA90D,EAAK0qC,OAAStrC,OAAOY,EAAKvzE,OAASA,GAE5BuzE,EAGTi1D,oBAAoBxoI,GAGlB,MACMuzE,EAAO+4B,KAAK67B,mBADF,MAIhB,OAFA50D,EAAK2qC,QAAUvrC,OAAOY,EAAKvzE,OAASA,GAE7BuzE,EAGT40D,mBAA8BnoI,GAC5B,OAAOssG,KAAKm8B,aAAgBzoI,EAAO,WAGrC0oI,mBAAmB1oI,GACjB,OAAOssG,KAAK67B,mBAAmBnoI,GAGjC2oI,oBAAoB3oI,GAClB,OAAOssG,KAAK67B,mBAAmBnoI,GAGjC4oI,mBACE,OAAOt8B,KAAK67B,mBAAmB,MAGjCU,oBAAoB7oI,GAClB,OAAOssG,KAAK67B,mBAAmBnoI,GAGjC8oI,gBAAgBC,GACd,MAAMC,EAAmBD,EAAU/oI,MAE7BipI,EAAO38B,KAAK48B,YAAYH,EAAUznD,MAAOynD,EAAUn1D,IAAI0N,OACvDkX,EAAa8T,KAAK48B,YACtBF,EAAiB1nD,MACjB0nD,EAAiBp1D,IAAI0N,OAcvB,OAXAkX,EAAWx4F,MAAQgpI,EAAiBG,MAAMC,gBAC1C5wC,EAAWpC,IAAM4yC,EAAiBG,MAAM/yC,IAExC6yC,EAAKzwC,WAAa8T,KAAK+8B,aACrB7wC,EACA,UACAwwC,EAAiB13D,IACjB03D,EAAiBp1D,IAAItC,KAEvB23D,EAAKF,UAAYC,EAAiBG,MAAM/yC,IAAI1kB,MAAM,GAAI,GAE/C46B,KAAK+8B,aACVJ,EACA,sBACAF,EAAUz3D,IACVy3D,EAAUn1D,IAAItC,KAQlBg4D,aACE/1D,EACA0wD,GAEApS,MAAMyX,aAAa/1D,EAAM0wD,GACzB1wD,EAAKilB,YAAa,EAGpB+wC,iBAAiBh2D,GACH,MAARA,GAAgB+4B,KAAKk9B,iBAAiBj2D,GACxC+4B,KAAKi9B,iBAAmBh2D,EAA8BvzE,OAEtD6xH,MAAM0X,iBAAiBh2D,GAI3Bk2D,6BAA6BC,GAC3B,OAASA,EAA2D1pI,MACjE6iF,OAGL8mD,iBAAiBV,GAA4B,IAAAW,EAC3C,MACgB,wBAAdX,EAAK71D,MACoB,YAAzB61D,EAAKzwC,WAAWplB,MACiB,iBAA1B61D,EAAKzwC,WAAWx4F,SACvB,OAAA4pI,EAACX,EAAKzwC,WAAW2wC,QAAhBS,EAAuBC,eAI5BC,gBAAgBb,GACd,MAAMF,EAAYlX,MAAMiY,gBAAgBb,GAClCjpI,EAAQipI,EAAKzwC,WAAWx4F,MAO9B,OAFAssG,KAAKy9B,SAAShB,EAAU/oI,MAAO,kBAAmBA,GAE3C+oI,EAGTiB,eACEz2D,KACGmP,GAEHmvC,MAAMmY,eAAez2D,KAASmP,GAE9B,MAAMunD,EAAsB12D,EAAKqO,WAAWlL,KAAIwzD,GAC9C59B,KAAKw8B,gBAAgBoB,KAEvB32D,EAAKhB,KAAO03D,EAAoB9rC,OAAO5qB,EAAKhB,aAErCgB,EAAKqO,WAGduoD,gBACEC,EACAV,EACAxF,EACAD,EACAoG,EACAC,GAEAh+B,KAAKi+B,YACHb,EACAxF,EACAD,EACAoG,EACAC,EACA,eACA,GAEEZ,EAAOc,iBAETd,EAAO1pI,MAAMwqI,eAAiBd,EAAOc,sBAC9Bd,EAAOc,gBAEhBJ,EAAU73D,KAAK6E,KAAKsyD,GAGtBe,yBAAyB/nD,GACvB,MAAMnP,EAAOs+C,MAAM4Y,yBAAyB/nD,GAC5C,MACgB,gBAAdnP,EAAKH,MACLk5B,KAAKo7B,gBAAgB,SAAU,iBAExBp7B,KAAKo+B,sCAAsCn3D,GAE7CA,EAGTm3D,sCACEn3D,GAEA,MAAMp0E,EAAO0yH,MAAM8Y,iBAAiBp3D,GAKpC,cAJAA,EAAQA,GACIgd,GACZhd,EAAKp0E,KAAOA,EACZo0E,EAAKH,KAAO,oBACLG,EAGTq3D,cAAcr3D,GACZ,OAAK+4B,KAAKo7B,gBAAgB,SAAU,iBAGf,sBAAdn0D,EAAKH,KAFHy+C,MAAM+Y,cAAcr3D,GAK/Bo3D,iBAAiBp3D,GACf,OAAK+4B,KAAKo7B,gBAAgB,SAAU,iBAG7Bn0D,EAAKp0E,KAFH0yH,MAAM8Y,iBAAiBp3D,GAKlCk1D,aAAwBzoI,EAAYozE,GAClC,MAAMG,EAAOs+C,MAAM4W,aAAgBzoI,EAAOozE,GAI1C,OAHAG,EAAK6iB,IAAM7iB,EAAK41D,MAAM/yC,WACf7iB,EAAK41D,MAEL51D,EAGTs3D,kBACEt3D,EACAu3D,EACAC,GAAqB,GAErBlZ,MAAMgZ,kBAAkBt3D,EAAMu3D,EAAiBC,GAC/Cx3D,EAAKilB,WAAgC,mBAAnBjlB,EAAKhB,KAAKa,KAG9Bm3D,YACEh3D,EACA2wD,EACAD,EACAoG,EACA7Z,EACAp9C,EACA43D,GAAwB,GAExB,IAAIC,EAAW3+B,KAAK4+B,YAoBpB,OAnBAD,EAASE,KAAO53D,EAAK43D,KACrBF,EAAWpZ,MAAM0Y,YACfU,EACA/G,EACAD,EACAoG,EACA7Z,EACAp9C,EACA43D,GAEFC,EAAS73D,KAAO,4BACT63D,EAASE,KAEhB53D,EAAKvzE,MAAQirI,EACA,uBAAT73D,IAEFG,EAAK2kB,UAAW,GAElB9kB,EAAO,mBACAk5B,KAAK8+B,WAAW73D,EAAMH,GAG/Bi4D,sBAAsB3oD,GACpB,MAAM4oD,EAAgBzZ,MAAMwZ,sBAAsB3oD,GAIlD,OAHI4pB,KAAKo7B,gBAAgB,SAAU,mBACjC4D,EAAal4D,KAAO,sBAEdk4D,EAGVC,6BAA6B7oD,GAC3B,MAAM4oD,EAAgBzZ,MAAM0Z,6BAA6B7oD,GAKzD,OAJI4pB,KAAKo7B,gBAAgB,SAAU,mBACjC4D,EAAal4D,KAAO,qBACpBk4D,EAAapzC,UAAW,GAElBozC,EAGVE,kBACEvmD,EACAi/C,EACAD,EACAwH,EACAC,GAEA,MAAMn4D,EAA0Bs+C,MAAM2Z,kBACpCvmD,EACAi/C,EACAD,EACAwH,EACAC,GASF,OANIn4D,IACFA,EAAKH,KAAO,WAC8B,WAApCG,EAA2B43D,OAAmB53D,EAAK43D,KAAO,QAChE53D,EAAK8kB,WAAY,GAGX9kB,EAGVo4D,oBACE1mD,EACA2mD,EACAzM,EACAsM,EACAI,GAEA,MAAMt4D,EAA0Bs+C,MAAM8Z,oBACpC1mD,EACA2mD,EACAzM,EACAsM,EACAI,GAQF,OALIt4D,IACFA,EAAK43D,KAAO,OACZ53D,EAAKH,KAAO,YAGNG,EAGVu4D,aAAav4D,EAAcw4D,GAAiB,GAC1C,OAAY,MAARx4D,GAAgB+4B,KAAKk9B,iBAAiBj2D,IACxC+4B,KAAKw/B,aAAav4D,EAAKvzE,MAAO+rI,GAEvBx4D,GAGFs+C,MAAMia,aAAav4D,EAAMw4D,GAGlCC,iCAAiC/mD,KAAiBvC,GAC9B,QAAduC,EAAKkmD,MAAgC,QAAdlmD,EAAKkmD,KAC9B7+B,KAAK0jB,MAAM/qC,EAAK3jF,IAAIggF,MAAOmwC,EAAO/H,oBACzBzkC,EAAKykD,OACdp9B,KAAK0jB,MAAM/qC,EAAK3jF,IAAIggF,MAAOmwC,EAAO9H,kBAElCkI,MAAMma,iCAAiC/mD,KAASvC,GAIpDupD,qBACE14D,EACA24D,GAIA,GAFAra,MAAMoa,qBAAqB14D,EAAM24D,GAER,WAArB34D,EAAKkP,OAAOrP,KAAmB,CAGO,IAAA+4D,EAAxC,GAFE54D,EAAyCH,KAAO,mBAChDG,EAAyC8N,OAAS9N,EAAKoP,UAAU,GAC/D2pB,KAAKk7B,UAAU,oBACfj0D,EAAyC64D,WAA3C,OAAAD,EACE54D,EAAKoP,UAAU,IADjBwpD,EACuB,YAGlB54D,EAAKoP,iBAELpP,EAAKkP,OAGd,OAAOlP,EAGT84D,sBACE94D,GAOkB,qBAAdA,EAAKH,MAITy+C,MAAMwa,sBAAsB94D,GAG9B+4D,YAAY/4D,GAGV,OAFAs+C,MAAMya,YAAY/4D,GAEVA,EAAKH,MACX,IAAK,uBACHG,EAAKg5D,SAAW,KAChB,MAEF,IAAK,yBAE0B,IAA3Bh5D,EAAKi5D,WAAWj7D,QACY,6BAA5BgC,EAAKi5D,WAAW,GAAGp5D,OAEnBG,EAAKH,KAAO,uBACZG,EAAKg5D,SAAWh5D,EAAKi5D,WAAW,GAAGD,gBAC5Bh5D,EAAKi5D,YAMlB,OAAOj5D,EAGTk5D,eACEC,EACAd,EACAzM,EACAwN,EACAvX,GAEA,MAAM7hD,EAAOs+C,MAAM4a,eACjBC,EACAd,EACAzM,EACAwN,EACAvX,GAGF,GAAIA,EAAMwX,qBAQR,GALgB,6BAAdr5D,EAAKH,MACS,2BAAdG,EAAKH,OAELG,EAAKH,KAAOG,EAAKH,KAAKg1B,UAAU,IAE9BgtB,EAAMyX,KAAM,CACd,MAAMC,EAAQxgC,KAAKygC,gBAAgBx5D,GAEnC,OADAu5D,EAAMt0C,WAAajlB,EACZ+4B,KAAK8+B,WAAW0B,EAAO,wBAGlB,qBAAdv5D,EAAKH,MACS,mBAAdG,EAAKH,OAELG,EAAK24D,UAAW,GAGlB,OAAO34D,EAGTy5D,yBAAyBz5D,GAIvB,MAHkB,oBAAdA,EAAKH,OACPG,EAAOA,EAAKilB,YAEPq5B,MAAMmb,yBAAyBz5D,GAGxC05D,gBAAgB15D,GACd,MAAqB,oBAAdA,EAAKH,KAGdo2D,iBAAiBj2D,GACf,MAAqB,aAAdA,EAAKH,MAAqC,SAAdG,EAAK43D,OAAoB53D,EAAKm2D,OAGnEwD,eAAe35D,GACb,OAAOA,EAAKm2D,QAAwB,QAAdn2D,EAAK43D,MAAgC,QAAd53D,EAAK43D,OD5TtDgC,IL1DcnF,GACd,cAAcA,EAGZoF,eACE,IAAIC,EAAM,GACNC,EAAahhC,KAAK8oB,MAAMlxC,IAC5B,OAAS,CACP,GAAIooB,KAAK8oB,MAAMlxC,KAAOooB,KAAK/6B,OACzB,MAAM+6B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOygD,GAAUM,wBAG/C,MAAMkL,EAAKjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAE5C,OAAQqpD,GACN,KAAA,GACA,KAAA,IACE,OAAIjhC,KAAK8oB,MAAMlxC,MAAQooB,KAAK8oB,MAAM9zC,MAC1B,KAAFisD,GAA6BjhC,KAAK8oB,MAAM8L,eACxC50B,KAAK8oB,MAAMlxC,IACNooB,KAAKkhC,YAAYzf,EAAGkV,cAEtBpR,MAAM4b,iBAAiBF,IAEhCF,GAAO/gC,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,KACxCooB,KAAKkhC,YAAYzf,EAAGiV,QAASqK,IAEtC,KAAA,GACEA,GAAO/gC,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,KAC/CmpD,GAAO/gC,KAAKohC,gBACZJ,EAAahhC,KAAK8oB,MAAMlxC,IACxB,MAEF,KAAA,GACA,KAAA,IAaA,QACMq/B,EAAUgqB,IACZF,GAAO/gC,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,KAC/CmpD,GAAO/gC,KAAKqhC,gBAAe,GAC3BL,EAAahhC,KAAK8oB,MAAMlxC,OAEtBooB,KAAK8oB,MAAMlxC,MAMvBypD,eAAeC,GACb,MAAML,EAAKjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAC5C,IAAImpD,EAcJ,QAbE/gC,KAAK8oB,MAAMlxC,IAET,KAAFqpD,GACA,KAAAjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,QAE/BooB,KAAK8oB,MAAMlxC,IACbmpD,EAAMO,EAAgB,KAAO,QAE7BP,EAAM16D,OAAO67C,aAAa+e,KAE1BjhC,KAAK8oB,MAAM8J,QACb5yB,KAAK8oB,MAAMwL,UAAYt0B,KAAK8oB,MAAMlxC,IAE3BmpD,EAGTQ,cAAcpiD,GACZ,IAAI4hD,EAAM,GACNC,IAAehhC,KAAK8oB,MAAMlxC,IAC9B,OAAS,CACP,GAAIooB,KAAK8oB,MAAMlxC,KAAOooB,KAAK/6B,OACzB,MAAM+6B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOzE,oBAG5C,MAAMugB,EAAKjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAC5C,GAAIqpD,IAAO9hD,EAAO,MACZ,KAAF8hD,GACFF,GAAO/gC,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,KAC/CmpD,GAAO/gC,KAAKohC,gBACZJ,EAAahhC,KAAK8oB,MAAMlxC,KACfq/B,EAAUgqB,IACnBF,GAAO/gC,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,KAC/CmpD,GAAO/gC,KAAKqhC,gBAAe,GAC3BL,EAAahhC,KAAK8oB,MAAMlxC,OAEtBooB,KAAK8oB,MAAMlxC,IAIjB,OADAmpD,GAAO/gC,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,OACxCooB,KAAKkhC,YAAYzf,EAAG9lB,OAAQolC,GAGrCK,gBACE,IAEII,EAFAhsC,EAAM,GACNjS,EAAQ,EAER09C,EAAKjhC,KAAKhR,MAAMgR,KAAK8oB,MAAMlxC,KAE/B,MAAM0nD,IAAat/B,KAAK8oB,MAAMlxC,IAC9B,KAAOooB,KAAK8oB,MAAMlxC,IAAMooB,KAAK/6B,QAAUse,IAAU,IAAI,CAEnD,GADA09C,EAAKjhC,KAAKhR,MAAMgR,KAAK8oB,MAAMlxC,OAChB,MAAPqpD,EAAY,CACC,MAAXzrC,EAAI,GACS,MAAXA,EAAI,IACNA,EAAMA,EAAI3vB,OAAO,GACb0vD,GAAW9vD,KAAK+vB,KAClBgsC,EAASn7D,OAAOC,cAAcF,SAASovB,EAAK,QAG9CA,EAAMA,EAAI3vB,OAAO,GACb2vD,GAAe/vD,KAAK+vB,KACtBgsC,EAASn7D,OAAOC,cAAcF,SAASovB,EAAK,OAIhDgsC,EAASC,GAAcjsC,GAEzB,MAEFA,GAAOyrC,EAET,OAAKO,IACHxhC,KAAK8oB,MAAMlxC,IAAM0nD,EACV,KAYXoC,cACE,IAAIT,EACJ,MAAMjsD,EAAQgrB,KAAK8oB,MAAMlxC,IACzB,GACEqpD,EAAKjhC,KAAKhR,MAAM/W,aAAa+nB,KAAK8oB,MAAMlxC,WACjCuqC,EAAiB8e,IAAS,KAAFA,GACjC,OAAOjhC,KAAKkhC,YACVzf,EAAGgV,QACHz2B,KAAKhR,MAAM5pB,MAAM4P,EAAOgrB,KAAK8oB,MAAMlxC,MAMvC+pD,qBACE,MAAM16D,EAAO+4B,KAAK4+B,YASlB,OARI5+B,KAAK1iB,MAAMmkC,EAAGgV,SAChBxvD,EAAKp0E,KAAOmtG,KAAK8oB,MAAMp1H,MACdssG,KAAK8oB,MAAMhiD,KAAKmqC,QACzBhqC,EAAKp0E,KAAOmtG,KAAK8oB,MAAMhiD,KAAKmqC,QAE5BjR,KAAK4hC,aAEP5hC,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAM,iBAK/B46D,yBACE,MAAMvC,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SACtBhgI,EAAOmtG,KAAK2hC,qBAClB,IAAK3hC,KAAK8hC,IAAIrgB,EAAG7O,OAAQ,OAAO//G,EAEhC,MAAMo0E,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GAGxC,OAFA5rD,EAAKmvD,UAAYvjI,EACjBo0E,EAAKp0E,KAAOmtG,KAAK2hC,qBACV3hC,KAAK8+B,WAAW73D,EAAM,qBAM/B86D,sBAIE,MAAMzC,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAC5B,IAAI5rD,EAAO+4B,KAAK6hC,yBAChB,GAAkB,sBAAd56D,EAAKH,KACP,OAAOG,EAET,KAAO+4B,KAAK8hC,IAAIrgB,EAAG3O,MAAM,CACvB,MAAMkvB,EAAUhiC,KAAK48B,YAAY0C,EAAUzM,GAC3CmP,EAAQ9L,OAASjvD,EACjB+6D,EAAQr2C,SAAWqU,KAAK2hC,qBACxB16D,EAAO+4B,KAAK8+B,WAAWkD,EAAS,uBAElC,OAAO/6D,EAKTg7D,yBACE,IAAIh7D,EACJ,OAAQ+4B,KAAK8oB,MAAMhiD,MACjB,KAAK26C,EAAGpP,OAON,OANAprC,EAAO+4B,KAAK4+B,YACZ5+B,KAAK5iB,OACLnW,EAAO+4B,KAAKkiC,4BAA4Bj7D,GACX,uBAAzBA,EAAKilB,WAAWplB,MAClBk5B,KAAK0jB,MAAMz8C,EAAK+N,MAAOygD,GAAUC,kBAE5BzuD,EAET,KAAKw6C,EAAGkV,YACR,KAAKlV,EAAG9lB,OACN,OAAOqE,KAAKmiC,gBAEd,QACE,MAAMniC,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOygD,GAAUK,sBAQnDsM,0BACE,MAAMn7D,EAAO+4B,KAAK48B,YAChB58B,KAAK8oB,MAAM4L,WACX10B,KAAK8oB,MAAMyL,eAEb,OAAOv0B,KAAK+8B,aACV91D,EACA,qBACA+4B,KAAK8oB,MAAM9zC,MACXgrB,KAAK8oB,MAAM+J,UAMfwP,oBAAoBp7D,GAKlB,OAJA+4B,KAAK5iB,OACLnW,EAAKilB,WAAa8T,KAAKsiC,kBACvBtiC,KAAKuiC,OAAO9gB,EAAGjP,QAERxS,KAAK8+B,WAAW73D,EAAM,kBAK/Bi7D,4BACEj7D,GAEA,GAAI+4B,KAAK1iB,MAAMmkC,EAAGjP,QAChBvrC,EAAKilB,WAAa8T,KAAKoiC,8BAClB,CACL,MAAMl2C,EAAa8T,KAAKsiC,kBAcxBr7D,EAAKilB,WAAaA,EAIpB,OAFA8T,KAAKuiC,OAAO9gB,EAAGjP,QAERxS,KAAK8+B,WAAW73D,EAAM,0BAK/Bu7D,oBACE,MAAMv7D,EAAO+4B,KAAK4+B,YAClB,OAAI5+B,KAAK8hC,IAAIrgB,EAAGpP,SACdrS,KAAKuiC,OAAO9gB,EAAGvO,UACfjsC,EAAKijB,SAAW8V,KAAKyiC,0BACrBziC,KAAKuiC,OAAO9gB,EAAGjP,QACRxS,KAAK8+B,WAAW73D,EAAM,wBAE/BA,EAAKp0E,KAAOmtG,KAAK6hC,yBACjB56D,EAAKvzE,MAAQssG,KAAK8hC,IAAIrgB,EAAGlO,IAAMvT,KAAKiiC,yBAA2B,KACxDjiC,KAAK8+B,WAAW73D,EAAM,iBAK/By7D,yBACEpD,EACAzM,GAEA,MAAM5rD,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GACxC,OAAI7yB,KAAK1iB,MAAMmkC,EAAGmV,YAChB52B,KAAKuiC,OAAO9gB,EAAGmV,WACR52B,KAAK8+B,WAAW73D,EAAM,wBAE/BA,EAAKp0E,KAAOmtG,KAAK+hC,sBACV/hC,KAAK2iC,gCAAgC17D,IAG9C07D,gCACE17D,GAEA,MAAM64D,EAA+B,GACrC,MAAQ9/B,KAAK1iB,MAAMmkC,EAAGhN,SAAWzU,KAAK1iB,MAAMmkC,EAAGmV,YAC7CkJ,EAAWh1D,KAAKk1B,KAAKwiC,qBAKvB,OAHAv7D,EAAK64D,WAAaA,EAClB74D,EAAK27D,YAAc5iC,KAAK8hC,IAAIrgB,EAAGhN,OAC/BzU,KAAKuiC,OAAO9gB,EAAGmV,WACR52B,KAAK8+B,WAAW73D,EAAM,qBAK/B47D,yBACEvD,EACAzM,GAEA,MAAM5rD,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GACxC,OAAI7yB,KAAK1iB,MAAMmkC,EAAGmV,YAChB52B,KAAKuiC,OAAO9gB,EAAGmV,WACR52B,KAAK8+B,WAAW73D,EAAM,wBAE/BA,EAAKp0E,KAAOmtG,KAAK+hC,sBACjB/hC,KAAKuiC,OAAO9gB,EAAGmV,WACR52B,KAAK8+B,WAAW73D,EAAM,sBAM/B67D,kBAAkBxD,EAAkBzM,GAClC,MAAM5rD,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GAClCtpD,EAAW,GACXw5D,EAAiB/iC,KAAK0iC,yBAAyBpD,EAAUzM,GAC/D,IAAImQ,EAAiB,KAErB,IAAKD,EAAeH,YAAa,CAC/BK,EAAU,OACR,OAAQjjC,KAAK8oB,MAAMhiD,MACjB,KAAK26C,EAAGkV,YAIN,GAHA2I,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SACtB7yB,KAAK5iB,OACD4iB,KAAK8hC,IAAIrgB,EAAGhN,OAAQ,CACtBuuB,EAAiBhjC,KAAK6iC,yBACpBvD,EACAzM,GAEF,MAAMoQ,EAER15D,EAASuB,KAAKk1B,KAAK8iC,kBAAkBxD,EAAUzM,IAC/C,MAEF,KAAKpR,EAAGiV,QACNntD,EAASuB,KAAKk1B,KAAKmiC,iBACnB,MAEF,KAAK1gB,EAAGpP,OAAQ,CACd,MAAMprC,EAAO+4B,KAAK4+B,YAClB5+B,KAAK5iB,OACD4iB,KAAK1iB,MAAMmkC,EAAGvO,UAChB3pC,EAASuB,KAAKk1B,KAAKqiC,oBAAoBp7D,IAEvCsC,EAASuB,KAAKk1B,KAAKkiC,4BAA4Bj7D,IAGjD,MAGF,QACE,MAAM+4B,KAAK4hC,aAIb3L,GAAW8M,KAAoB9M,GAAW+M,GAC5ChjC,KAAK0jB,MAEHsf,EAAehuD,MACfygD,GAAUG,4BAEFK,GAAW8M,IAAmB9M,GAAW+M,GACnDhjC,KAAK0jB,MAEHsf,EAAehuD,MACfygD,GAAUE,yBACVQ,GAAoB4M,EAAelwI,OAE3BojI,GAAW8M,IAAoB9M,GAAW+M,IAGlD7M,GAAoB6M,EAAenwI,QACnCsjI,GAAoB4M,EAAelwI,OAEnCmtG,KAAK0jB,MAEHsf,EAAehuD,MACfygD,GAAUE,yBACVQ,GAAoB4M,EAAelwI,OAc3C,GARIojI,GAAW8M,IACb97D,EAAKi8D,gBAAkBH,EACvB97D,EAAKk8D,gBAAkBH,IAEvB/7D,EAAK87D,eAAiBA,EACtB97D,EAAK+7D,eAAiBA,GAExB/7D,EAAKsC,SAAWA,EACZy2B,KAAKojC,aAAa,KACpB,MAAMpjC,KAAK0jB,MACT1jB,KAAK8oB,MAAM9zC,MACXygD,GAAUO,8BAId,OAAOC,GAAW8M,GACd/iC,KAAK8+B,WAAW73D,EAAM,eACtB+4B,KAAK8+B,WAAW73D,EAAM,cAK5Bo8D,kBACE,MAAM/D,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAE5B,OADA7yB,KAAK5iB,OACE4iB,KAAK8iC,kBAAkBxD,EAAUzM,GAO1CsP,cAAc5C,GACZ,OAAIv/B,KAAK1iB,MAAMmkC,EAAGiV,SACT12B,KAAKm8B,aAAan8B,KAAK8oB,MAAMp1H,MAAO,WAClCssG,KAAK1iB,MAAMmkC,EAAGkV,aAChB32B,KAAKqjC,kBAEZrjC,KAAKojC,aAAa,MAClB,KAAApjC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,MAIjCooB,KAAKkhC,YAAYzf,EAAGkV,aACb32B,KAAKqjC,mBAEL9d,MAAM4c,cAAc5C,GAI/B+D,qBAAqBxa,GACnB,MAAMya,EAAmBhe,MAAM+d,qBAC7Bxa,GAGF,OADAya,EAAehQ,eAAiBzK,EAAMyK,eAC/BgQ,EAGTpC,iBAAiB9rI,GACf,GAAI2qG,KAAK8oB,MAAMyK,eAAgB,OAAOhO,MAAM4b,iBAAiB9rI,GAE7D,MAAMm0E,EAAUw2B,KAAKwjC,aAErB,GAAIh6D,IAAY6sD,EAAGG,OACjB,OAAOx2B,KAAK8gC,eAGd,GAAIt3D,IAAY6sD,EAAGC,QAAU9sD,IAAY6sD,EAAGE,OAAQ,CAClD,GAAItU,EAAkB5sH,GACpB,OAAO2qG,KAAK0hC,cAGd,GAAQ,KAAJrsI,EAEF,QADE2qG,KAAK8oB,MAAMlxC,IACNooB,KAAKkhC,YAAYzf,EAAGmV,WAG7B,IACO,KAAJvhI,GAAwC,KAAJA,IACrCm0E,IAAY6sD,EAAGC,OAEf,OAAOt2B,KAAKuhC,cAAclsI,GAI9B,OACM,KAAJA,GACA2qG,KAAK8oB,MAAM8L,aACX,KAAA50B,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,MAErCooB,KAAK8oB,MAAMlxC,IACNooB,KAAKkhC,YAAYzf,EAAGkV,cAGtBpR,MAAM4b,iBAAiB9rI,GAGhC+7G,cAAcqyB,GACZle,MAAMnU,cAAcqyB,GACpB,MAAMj6D,QAAEA,EAAF1C,KAAWA,GAASk5B,KAAK8oB,MAC/B,GAAIhiD,IAAS26C,EAAGpP,OAAQ,CACtB,MAAMmxB,EAAah6D,EAAQA,EAAQvE,OAAS,GACxCu+D,IAAenN,EAAGC,OACpB9sD,EAAQsB,KAAKurD,EAAG9U,OACPiiB,IAAenN,EAAGG,QAC3BhtD,EAAQsB,KAAKurD,EAAG7U,eAElBxhB,KAAK8oB,MAAM8L,aAAc,OACpB,GAAI9tD,IAAS26C,EAAGhN,OAASgvB,IAAahiB,EAAGkV,YAC9CntD,EAAQvE,QAAU,EAClBuE,EAAQsB,KAAKurD,EAAGE,QAChBv2B,KAAK8oB,MAAM8L,aAAc,OACpB,GAAI9tD,IAAS26C,EAAGmV,UAAW,CAChC,MAAMmK,EAAMv3D,EAAQyU,MACf8iD,IAAQ1K,EAAGC,QAAUmN,IAAahiB,EAAGhN,OAAUssB,IAAQ1K,EAAGE,QAC7D/sD,EAAQyU,MACR+hB,KAAK8oB,MAAM8L,YAAcprD,EAAQA,EAAQvE,OAAS,KAAOoxD,EAAGG,QAE5Dx2B,KAAK8oB,MAAM8L,aAAc,OAG3B9tD,EAAKmqC,SACJwyB,IAAahiB,EAAG3O,KAAO2wB,IAAahiB,EAAGzO,YAIxChT,KAAK8oB,MAAM8L,YAAc9tD,EAAK4pC,WAF9B1Q,KAAK8oB,MAAM8L,aAAc,IK1e/B8O,KR6CchI,GACd,cAAcA,EAAW7kI,eAAAu/E,GAAAmvC,SAAAnvC,GAAA4pB,KAIvB2jC,gBAA8CjuI,EAE9CkuI,kBACE,OAAOne,GAGToe,mBACE,OAAO7jC,KAAKo7B,gBAAgB,OAAQ,QAA8B,SAApBp7B,KAAK2jC,WAGrDG,mBACE,QAAS9jC,KAAKo7B,gBAAgB,OAAQ,SAGxC8F,YAAYp6D,EAAiB6yB,GAU3B,OARE7yB,IAAS26C,EAAG9lB,QACZ70B,IAAS26C,EAAG37C,MACZgB,IAAS26C,EAAGnO,2BAEY59G,IAApBsqG,KAAK2jC,aACP3jC,KAAK2jC,WAAa,MAGfpe,MAAM2b,YAAYp6D,EAAM6yB,GAGjCoqC,WAAWC,GACT,QAAwBtuI,IAApBsqG,KAAK2jC,WAA0B,CAEjC,MAAM9+C,EAAUskC,GAAkB7jD,KAAK0+D,EAAQtwI,OAC/C,GAAKmxF,EAEE,GAAmB,SAAfA,EAAQ,GACjBmb,KAAK2jC,WAAa,WACb,CAAA,GAAmB,WAAf9+C,EAAQ,GAGjB,MAAM,IAAIiU,MAAM,0BAFhBkH,KAAK2jC,WAAa,eAKtB,OAAOpe,MAAMwe,WAAWC,GAG1BC,yBAAyBC,GACvB,MAAMC,EAAYnkC,KAAK8oB,MAAMuK,OAC7BrzB,KAAK8oB,MAAMuK,QAAS,EACpBrzB,KAAKuiC,OAAO2B,GAAOziB,EAAG7O,OAEtB,MAAM9rC,EAAOk5B,KAAKokC,gBAElB,OADApkC,KAAK8oB,MAAMuK,OAAS8Q,EACbr9D,EAGTu9D,qBACE,MAAMp9D,EAAO+4B,KAAK4+B,YACZ0F,EAAYtkC,KAAK8oB,MAAM9zC,MAO7B,OANAgrB,KAAK5iB,OACL4iB,KAAKukC,iBAAiB,UAElBvkC,KAAK8oB,MAAM2L,aAAe6P,EAAY,GACxCtkC,KAAK0jB,MAAM4gB,EAAW3e,GAAWwC,oCAE/BnoB,KAAK8hC,IAAIrgB,EAAG/O,SACdzrC,EAAKvzE,MAAQssG,KAAKsiC,kBAClBtiC,KAAKuiC,OAAO9gB,EAAG9O,QACR3S,KAAK8+B,WAAW73D,EAAM,sBAEtB+4B,KAAK8+B,WAAW73D,EAAM,qBAIjCu9D,uCACE,MAAML,EAAYnkC,KAAK8oB,MAAMuK,OAC7BrzB,KAAK8oB,MAAMuK,QAAS,EACpBrzB,KAAKuiC,OAAO9gB,EAAG7O,OACf,IAAI9rC,EAAO,KACP29D,EAAY,KAWhB,OAVIzkC,KAAK1iB,MAAMmkC,EAAGlN,SAChBvU,KAAK8oB,MAAMuK,OAAS8Q,EACpBM,EAAYzkC,KAAKqkC,uBAEjBv9D,EAAOk5B,KAAKokC,gBACZpkC,KAAK8oB,MAAMuK,OAAS8Q,EAChBnkC,KAAK1iB,MAAMmkC,EAAGlN,UAChBkwB,EAAYzkC,KAAKqkC,uBAGd,CAACv9D,EAAM29D,GAGhBC,sBAAsBz9D,GAGpB,OAFA+4B,KAAK5iB,OACL4iB,KAAK2kC,sBAAsB19D,GAAkB,GACtC+4B,KAAK8+B,WAAW73D,EAAM,gBAG/B29D,yBACE39D,GAEA+4B,KAAK5iB,OAEL,MAAM6G,EAAMhd,EAAKgd,GAAK+b,KAAK6kC,kBAErBC,EAAW9kC,KAAK4+B,YAChBmG,EAAgB/kC,KAAK4+B,YAEvB5+B,KAAKojC,aAAa,KACpB0B,EAAS5G,eAAiBl+B,KAAKglC,oCAE/BF,EAAS5G,eAAiB,KAG5Bl+B,KAAKuiC,OAAO9gB,EAAG/O,QACf,MAAMtX,EAAM4E,KAAKilC,8BAyBjB,OAxBAH,EAASvuD,OAAS6kB,EAAI7kB,OACtBuuD,EAASlgC,KAAOxJ,EAAIwJ,KACpBkgC,EAAS9kC,KAAO5E,EAAI4a,MACpBhW,KAAKuiC,OAAO9gB,EAAG9O,SAIbmyB,EAASpjD,WAETza,EAAKw9D,WACHzkC,KAAKwkC,uCAETO,EAAcG,eAAiBllC,KAAK8+B,WAClCgG,EACA,0BAGF7gD,EAAGihD,eAAiBllC,KAAK8+B,WAAWiG,EAAe,kBAEnD/kC,KAAKmlC,iBAAiBlhD,GACtB+b,KAAKolC,YAELplC,KAAK6kB,MAAMC,YAAY79C,EAAKgd,GAAGpxF,KHlRDswH,KGkR6Bl8C,EAAKgd,GAAGjP,OAE5DgrB,KAAK8+B,WAAW73D,EAAM,mBAG/Bo+D,iBACEp+D,EACAq+D,GAEA,GAAItlC,KAAK1iB,MAAMmkC,EAAGvL,QAChB,OAAOlW,KAAK0kC,sBAAsBz9D,GAC7B,GAAI+4B,KAAK1iB,MAAMmkC,EAAGpM,WACvB,OAAOrV,KAAK4kC,yBAAyB39D,GAChC,GAAI+4B,KAAK1iB,MAAMmkC,EAAG9L,MACvB,OAAO3V,KAAKulC,yBAAyBt+D,GAChC,GAAI+4B,KAAKwlC,cAAc,UAC5B,OAAIxlC,KAAK1iB,MAAMmkC,EAAG3O,KACT9S,KAAKylC,8BAA8Bx+D,IAEtCq+D,GACFtlC,KAAK0jB,MAAM1jB,KAAK8oB,MAAM2L,aAAc9O,GAAWyB,qBAE1CpnB,KAAK0lC,uBAAuBz+D,IAEhC,GAAI+4B,KAAK2lC,aAAa,QAC3B,OAAO3lC,KAAK4lC,0BAA0B3+D,GACjC,GAAI+4B,KAAK2lC,aAAa,UAC3B,OAAO3lC,KAAK6lC,2BAA2B5+D,GAClC,GAAI+4B,KAAK2lC,aAAa,aAC3B,OAAO3lC,KAAK8lC,0BAA0B7+D,GACjC,GAAI+4B,KAAK1iB,MAAMmkC,EAAGrL,SACvB,OAAOpW,KAAK+lC,kCAAkC9+D,EAAMq+D,GAEpD,MAAMtlC,KAAK4hC,aAIf2D,yBACEt+D,GAQA,OANA+4B,KAAK5iB,OACLnW,EAAKgd,GAAK+b,KAAKgmC,oCACc,GAE7BhmC,KAAK6kB,MAAMC,YAAY79C,EAAKgd,GAAGpxF,KH5UHozI,EG4UmBh/D,EAAKgd,GAAGjP,OACvDgrB,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,mBAG/By+D,uBAAuBz+D,GACrB+4B,KAAK6kB,MAAMF,MHjYiB,GGmYxB3kB,KAAK1iB,MAAMmkC,EAAG9lB,QAChB10B,EAAKgd,GAAK+b,KAAKmiC,gBAEfl7D,EAAKgd,GAAK+b,KAAK6kC,kBAGjB,MAAMqB,EAAYj/D,EAAKhB,KAAO+5B,KAAK4+B,YAC7B34D,EAAQigE,EAASjgE,KAAO,GAE9B,IADA+5B,KAAKuiC,OAAO9gB,EAAGpP,SACPrS,KAAK1iB,MAAMmkC,EAAGjP,SAAS,CAC7B,IAAI0zB,EAAWlmC,KAAK4+B,YAEhB5+B,KAAK1iB,MAAMmkC,EAAGpL,UAChBrW,KAAK5iB,OACA4iB,KAAK2lC,aAAa,SAAY3lC,KAAK1iB,MAAMmkC,EAAG9K,UAC/C3W,KAAK0jB,MACH1jB,KAAK8oB,MAAM2L,aACX9O,GAAWuB,qCAGflnB,KAAKmmC,YAAYD,KAEjBlmC,KAAKukC,iBACH,UACA5e,GAAW8C,qCAGbyd,EAAWlmC,KAAKqlC,iBAAiBa,GAAU,IAG7CjgE,EAAK6E,KAAKo7D,GAGZlmC,KAAK6kB,MAAMD,OAEX5kB,KAAKuiC,OAAO9gB,EAAGjP,QAEfxS,KAAK8+B,WAAWoH,EAAU,kBAE1B,IAAIrH,EAAO,KACPuH,GAAkB,EA6BtB,OA5BAngE,EAAK7xE,SAAQiyI,KAnSnB,SAAwBA,GACtB,MACuB,gCAArBA,EAAYv/D,MACU,6BAArBu/D,EAAYv/D,QACTu/D,EAAYC,aACsB,cAAjCD,EAAYC,YAAYx/D,MACU,yBAAjCu/D,EAAYC,YAAYx/D,MA8RtBy/D,CAAeF,GAQa,yBAArBA,EAAYv/D,OACjBs/D,GACFpmC,KAAK0jB,MACH2iB,EAAYrxD,MACZ2wC,GAAWM,+BAGF,OAAT4Y,GACF7+B,KAAK0jB,MACH2iB,EAAYrxD,MACZ2wC,GAAWE,4BAGfgZ,EAAO,WACPuH,GAAkB,IArBL,aAATvH,GACF7+B,KAAK0jB,MACH2iB,EAAYrxD,MACZ2wC,GAAWE,4BAGfgZ,EAAO,SAmBX53D,EAAK43D,KAAOA,GAAQ,WACb7+B,KAAK8+B,WAAW73D,EAAM,iBAG/B8+D,kCACE9+D,EACAq+D,GAIA,GAFAtlC,KAAKuiC,OAAO9gB,EAAGrL,SAEXpW,KAAK8hC,IAAIrgB,EAAGzM,UAYd,OAXIhV,KAAK1iB,MAAMmkC,EAAGpM,YAAcrV,KAAK1iB,MAAMmkC,EAAGvL,QAG5CjvC,EAAKq/D,YAActmC,KAAKqlC,iBAAiBrlC,KAAK4+B,cAG9C33D,EAAKq/D,YAActmC,KAAKokC,gBACxBpkC,KAAKolC,aAEPn+D,EAAK9zE,SAAU,EAER6sG,KAAK8+B,WAAW73D,EAAM,4BAE7B,GACE+4B,KAAK1iB,MAAMmkC,EAAG7L,SACd5V,KAAKwmC,UACHxmC,KAAK2lC,aAAa,SAAW3lC,KAAK2lC,aAAa,gBAC9CL,EACH,CACA,MAAMv0B,EAAQ/Q,KAAK8oB,MAAMp1H,MACnB+yI,EAAa1d,GAAkBhY,GAErC,MAAM/Q,KAAK0jB,MACT1jB,KAAK8oB,MAAM9zC,MACX2wC,GAAW6C,6BACXzX,EACA01B,GAIJ,GACEzmC,KAAK1iB,MAAMmkC,EAAG9L,OACd3V,KAAK1iB,MAAMmkC,EAAGpM,YACdrV,KAAK1iB,MAAMmkC,EAAGvL,SACdlW,KAAK2lC,aAAa,UAKlB,OAHA1+D,EAAKq/D,YAActmC,KAAKqlC,iBAAiBrlC,KAAK4+B,aAC9C33D,EAAK9zE,SAAU,EAER6sG,KAAK8+B,WAAW73D,EAAM,4BACxB,GACL+4B,KAAK1iB,MAAMmkC,EAAGjN,OACdxU,KAAK1iB,MAAMmkC,EAAGpP,SACdrS,KAAK2lC,aAAa,cAClB3lC,KAAK2lC,aAAa,SAClB3lC,KAAK2lC,aAAa,UAelB,MAZkB,4BADlB1+D,EAAO+4B,KAAKggC,YAAY/4D,IACfH,OAGPG,EAAKH,KAAO,oBAEZG,EAAK9zE,SAAU,SACR8zE,EAAKy/D,YAIdz/D,EAAKH,KAAO,UAAYG,EAAKH,KAEtBG,EAIX,MAAM+4B,KAAK4hC,aAGb6D,8BACEx+D,GAOA,OALA+4B,KAAK5iB,OACL4iB,KAAKukC,iBAAiB,WACtBt9D,EAAKi+D,eAAiBllC,KAAK2mC,0BAC3B3mC,KAAKolC,YAEEplC,KAAK8+B,WAAW73D,EAAM,wBAG/B2+D,0BACE3+D,GAMA,OAJA+4B,KAAK5iB,OACL4iB,KAAK4mC,mBAAmB3/D,GAExBA,EAAKH,KAAO,mBACLG,EAGT4+D,2BACE5+D,GAMA,OAJA+4B,KAAK5iB,OACL4iB,KAAK6mC,oBAAoB5/D,GAAM,GAE/BA,EAAKH,KAAO,oBACLG,EAGT6+D,0BACE7+D,GAIA,OAFA+4B,KAAK5iB,OACL4iB,KAAK2kC,sBAAsB19D,GACpB+4B,KAAK8+B,WAAW73D,EAAM,oBAK/B09D,sBACE19D,EACA6/D,GAAoB,GAuBpB,GArBA7/D,EAAKgd,GAAK+b,KAAK+mC,+BACED,GACG,GAGpB9mC,KAAK6kB,MAAMC,YACT79C,EAAKgd,GAAGpxF,KACRi0I,EHzhB0Bb,GAFAA,EG4hB1Bh/D,EAAKgd,GAAGjP,OAGNgrB,KAAKojC,aAAa,KACpBn8D,EAAKi3D,eAAiBl+B,KAAKglC,oCAE3B/9D,EAAKi3D,eAAiB,KAGxBj3D,EAAK+/D,QAAU,GACf//D,EAAKggE,WAAa,GAClBhgE,EAAKigE,OAAS,GAEVlnC,KAAK8hC,IAAIrgB,EAAGtL,UACd,GACElvC,EAAK+/D,QAAQl8D,KAAKk1B,KAAKmnC,oCACfL,GAAW9mC,KAAK8hC,IAAIrgB,EAAG75B,QAGnC,GAAIoY,KAAK2lC,aAAa,UAAW,CAC/B3lC,KAAK5iB,OACL,GACEnW,EAAKigE,OAAOp8D,KAAKk1B,KAAKmnC,mCACfnnC,KAAK8hC,IAAIrgB,EAAG75B,QAGvB,GAAIoY,KAAK2lC,aAAa,cAAe,CACnC3lC,KAAK5iB,OACL,GACEnW,EAAKggE,WAAWn8D,KAAKk1B,KAAKmnC,mCACnBnnC,KAAK8hC,IAAIrgB,EAAG75B,QAGvB3gB,EAAKhB,KAAO+5B,KAAKonC,oBAAoB,CACnCC,YAAaP,EACbQ,YAAY,EACZC,aAAa,EACbC,WAAYV,EACZW,cAAc,IAIlBN,4BACE,MAAMlgE,EAAO+4B,KAAK4+B,YASlB,OAPA33D,EAAKgd,GAAK+b,KAAK0nC,mCACX1nC,KAAKojC,aAAa,KACpBn8D,EAAKi3D,eAAiBl+B,KAAK2nC,sCAE3B1gE,EAAKi3D,eAAiB,KAGjBl+B,KAAK8+B,WAAW73D,EAAM,oBAG/B2gE,mBAAmB3gE,GAEjB,OADA+4B,KAAK2kC,sBAAsB19D,GACpB+4B,KAAK8+B,WAAW73D,EAAM,wBAG/B4gE,mBAAmBrlB,GACJ,MAATA,GACFxiB,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAO2wC,GAAWuC,8BAI5C4f,kBAAkBtlB,EAAcqQ,EAAkByT,GAC3C5gB,GAAc3mC,IAAIyjC,IAEvBxiB,KAAK0jB,MACHmP,EACAyT,EACI3gB,GAAWG,mBACXH,GAAWsC,uBACfzF,GAIJukB,8BACEgB,EACAzB,GAGA,OADAtmC,KAAK8nC,kBAAkB9nC,KAAK8oB,MAAMp1H,MAAOssG,KAAK8oB,MAAM9zC,MAAOsxD,GACpDtmC,KAAK6kC,gBAAgBkD,GAK9BnB,mBAAmB3/D,GAgBjB,OAfAA,EAAKgd,GAAK+b,KAAK+mC,+BACC,GACI,GAEpB/mC,KAAK6kB,MAAMC,YAAY79C,EAAKgd,GAAGpxF,KHznBHozI,EGynBuBh/D,EAAKgd,GAAGjP,OAEvDgrB,KAAKojC,aAAa,KACpBn8D,EAAKi3D,eAAiBl+B,KAAKglC,oCAE3B/9D,EAAKi3D,eAAiB,KAGxBj3D,EAAKkiB,MAAQ6W,KAAKikC,yBAAyBxiB,EAAGlO,IAC9CvT,KAAKolC,YAEEplC,KAAK8+B,WAAW73D,EAAM,aAG/B4/D,oBACE5/D,EACA+gE,GA2BA,OAzBAhoC,KAAKukC,iBAAiB,QACtBt9D,EAAKgd,GAAK+b,KAAK+mC,+BACC,GACI,GAEpB/mC,KAAK6kB,MAAMC,YAAY79C,EAAKgd,GAAGpxF,KHhpBHozI,EGgpBuBh/D,EAAKgd,GAAGjP,OAEvDgrB,KAAKojC,aAAa,KACpBn8D,EAAKi3D,eAAiBl+B,KAAKglC,oCAE3B/9D,EAAKi3D,eAAiB,KAIxBj3D,EAAKghE,UAAY,KACbjoC,KAAK1iB,MAAMmkC,EAAG7O,SAChB3rC,EAAKghE,UAAYjoC,KAAKikC,yBAAyBxiB,EAAG7O,QAGpD3rC,EAAKihE,SAAW,KACXF,IACH/gE,EAAKihE,SAAWloC,KAAKikC,yBAAyBxiB,EAAGlO,KAEnDvT,KAAKolC,YAEEplC,KAAK8+B,WAAW73D,EAAM,cAK/BkhE,uBAAuBC,GAA2B,GAChD,MAAMC,EAAYroC,KAAK8oB,MAAM9zC,MAEvB/N,EAAO+4B,KAAK4+B,YAEZ0J,EAAWtoC,KAAKuoC,oBAEhBC,EAAQxoC,KAAKgmC,qCAcnB,OAbA/+D,EAAKp0E,KAAO21I,EAAM31I,KAClBo0E,EAAKqhE,SAAWA,EAChBrhE,EAAKwhE,MAAQD,EAAMtD,eAEfllC,KAAK1iB,MAAMmkC,EAAGlO,KAChBvT,KAAK8hC,IAAIrgB,EAAGlO,IACZtsC,EAAK9zE,QAAU6sG,KAAKokC,iBAEhBgE,GACFpoC,KAAK0jB,MAAM2kB,EAAW1iB,GAAWwB,yBAI9BnnB,KAAK8+B,WAAW73D,EAAM,iBAG/B+9D,oCACE,MAAMb,EAAYnkC,KAAK8oB,MAAMuK,OACvBpsD,EAAO+4B,KAAK4+B,YAClB33D,EAAKsP,OAAS,GAEdypB,KAAK8oB,MAAMuK,QAAS,EAGhBrzB,KAAKojC,aAAa,MAAQpjC,KAAK1iB,MAAMmkC,EAAGkV,aAC1C32B,KAAK5iB,OAEL4iB,KAAK4hC,aAGP,IAAI8G,GAAkB,EAEtB,EAAG,CACD,MAAMC,EAAgB3oC,KAAKmoC,uBAAuBO,GAElDzhE,EAAKsP,OAAOzL,KAAK69D,GAEbA,EAAcx1I,UAChBu1I,GAAkB,GAGf1oC,KAAKojC,aAAa,MACrBpjC,KAAKuiC,OAAO9gB,EAAG75B,cAEToY,KAAKojC,aAAa,MAK5B,OAJApjC,KAAK4oC,iBAAiB,KAEtB5oC,KAAK8oB,MAAMuK,OAAS8Q,EAEbnkC,KAAK8+B,WAAW73D,EAAM,4BAG/B0gE,sCACE,MAAM1gE,EAAO+4B,KAAK4+B,YACZuF,EAAYnkC,KAAK8oB,MAAMuK,OAC7BpsD,EAAKsP,OAAS,GAEdypB,KAAK8oB,MAAMuK,QAAS,EAEpBrzB,KAAK4oC,iBAAiB,KACtB,MAAMC,EAAwB7oC,KAAK8oB,MAAMwK,mBAEzC,IADAtzB,KAAK8oB,MAAMwK,oBAAqB,GACxBtzB,KAAKojC,aAAa,MACxBn8D,EAAKsP,OAAOzL,KAAKk1B,KAAKokC,iBACjBpkC,KAAKojC,aAAa,MACrBpjC,KAAKuiC,OAAO9gB,EAAG75B,OAQnB,OALAoY,KAAK8oB,MAAMwK,mBAAqBuV,EAChC7oC,KAAK4oC,iBAAiB,KAEtB5oC,KAAK8oB,MAAMuK,OAAS8Q,EAEbnkC,KAAK8+B,WAAW73D,EAAM,8BAG/B6hE,+CACE,MAAM7hE,EAAO+4B,KAAK4+B,YACZuF,EAAYnkC,KAAK8oB,MAAMuK,OAM7B,IALApsD,EAAKsP,OAAS,GAEdypB,KAAK8oB,MAAMuK,QAAS,EAEpBrzB,KAAK4oC,iBAAiB,MACd5oC,KAAKojC,aAAa,MACxBn8D,EAAKsP,OAAOzL,KAAKk1B,KAAK+oC,wCACjB/oC,KAAKojC,aAAa,MACrBpjC,KAAKuiC,OAAO9gB,EAAG75B,OAOnB,OAJAoY,KAAK4oC,iBAAiB,KAEtB5oC,KAAK8oB,MAAMuK,OAAS8Q,EAEbnkC,KAAK8+B,WAAW73D,EAAM,8BAG/B+hE,yBACE,MAAM/hE,EAAO+4B,KAAK4+B,YAIlB,GAHA5+B,KAAKukC,iBAAiB,aAEtBt9D,EAAK+/D,QAAU,GACXhnC,KAAK8hC,IAAIrgB,EAAGtL,UACd,GACElvC,EAAK+/D,QAAQl8D,KAAKk1B,KAAKmnC,mCAChBnnC,KAAK8hC,IAAIrgB,EAAG75B,QAWvB,OARA3gB,EAAKhB,KAAO+5B,KAAKonC,oBAAoB,CACnCC,aAAa,EACbC,YAAY,EACZC,aAAa,EACbC,YAAY,EACZC,cAAc,IAGTznC,KAAK8+B,WAAW73D,EAAM,2BAG/BgiE,6BACE,OAAOjpC,KAAK1iB,MAAMmkC,EAAG/P,MAAQ1R,KAAK1iB,MAAMmkC,EAAG9lB,QACvCqE,KAAKmiC,gBACLniC,KAAK6kC,iBAAgB,GAG3BqE,2BACEjiE,EACA4E,EACAy8D,GAgBA,OAdArhE,EAAKkiE,OAASt9D,EAGVm0B,KAAKopC,YAAYtiE,OAAS26C,EAAG7O,OAC/B3rC,EAAKgd,GAAK+b,KAAKipC,6BACfhiE,EAAKjyE,IAAMgrG,KAAKikC,6BAEhBh9D,EAAKgd,GAAK,KACVhd,EAAKjyE,IAAMgrG,KAAKokC,iBAElBpkC,KAAKuiC,OAAO9gB,EAAGtP,UACflrC,EAAKvzE,MAAQssG,KAAKikC,2BAClBh9D,EAAKqhE,SAAWA,EAETtoC,KAAK8+B,WAAW73D,EAAM,qBAG/BoiE,gCACEpiE,EACA4E,GAoBA,OAlBA5E,EAAKkiE,OAASt9D,EAEd5E,EAAKgd,GAAK+b,KAAKipC,6BACfjpC,KAAKuiC,OAAO9gB,EAAGtP,UACfnS,KAAKuiC,OAAO9gB,EAAGtP,UACXnS,KAAKojC,aAAa,MAAQpjC,KAAK1iB,MAAMmkC,EAAG/O,SAC1CzrC,EAAKm2D,QAAS,EACdn2D,EAAK24D,UAAW,EAChB34D,EAAKvzE,MAAQssG,KAAKspC,6BAChBtpC,KAAK48B,YAAY31D,EAAK+N,MAAO/N,EAAKK,IAAI0N,UAGxC/N,EAAKm2D,QAAS,EACVp9B,KAAK8hC,IAAIrgB,EAAG1O,YACd9rC,EAAK24D,UAAW,GAElB34D,EAAKvzE,MAAQssG,KAAKikC,4BAEbjkC,KAAK8+B,WAAW73D,EAAM,0BAG/BqiE,6BACEriE,GAoBA,IAlBAA,EAAKsP,OAAS,GACdtP,EAAK29B,KAAO,KACZ39B,EAAKi3D,eAAiB,KACtBj3D,EAAK+4B,KAAO,KAERA,KAAKojC,aAAa,OACpBn8D,EAAKi3D,eAAiBl+B,KAAKglC,qCAG7BhlC,KAAKuiC,OAAO9gB,EAAG/O,QACX1S,KAAK1iB,MAAMmkC,EAAGzL,SAChB/uC,EAAK+4B,KAAOA,KAAKupC,4BAAuC,GAExDtiE,EAAK+4B,KAAKntG,KAAO,KACZmtG,KAAK1iB,MAAMmkC,EAAG9O,SACjB3S,KAAKuiC,OAAO9gB,EAAG75B,SAGXoY,KAAK1iB,MAAMmkC,EAAG9O,UAAY3S,KAAK1iB,MAAMmkC,EAAGvO,WAC9CjsC,EAAKsP,OAAOzL,KAAKk1B,KAAKupC,4BAA2B,IAC5CvpC,KAAK1iB,MAAMmkC,EAAG9O,SACjB3S,KAAKuiC,OAAO9gB,EAAG75B,OAUnB,OANIoY,KAAK8hC,IAAIrgB,EAAGvO,YACdjsC,EAAK29B,KAAO5E,KAAKupC,4BAA2B,IAE9CvpC,KAAKuiC,OAAO9gB,EAAG9O,QACf1rC,EAAKya,WAAase,KAAKikC,2BAEhBjkC,KAAK8+B,WAAW73D,EAAM,0BAG/BuiE,gCACEviE,EACA4E,GAEA,MAAM49D,EAAYzpC,KAAK4+B,YAGvB,OAFA33D,EAAKkiE,OAASt9D,EACd5E,EAAKvzE,MAAQssG,KAAKspC,6BAA6BG,GACxCzpC,KAAK8+B,WAAW73D,EAAM,0BAG/BmgE,qBAAoBC,YAClBA,EADkBC,WAElBA,EAFkBC,YAGlBA,EAHkBC,WAIlBA,EAJkBC,aAKlBA,IAQA,MAAMtD,EAAYnkC,KAAK8oB,MAAMuK,OAC7BrzB,KAAK8oB,MAAMuK,QAAS,EAEpB,MAAMgV,EAAYroC,KAAK4+B,YAOvB,IAAI8K,EACAC,EANJtB,EAAUuB,eAAiB,GAC3BvB,EAAUpyD,WAAa,GACvBoyD,EAAUwB,SAAW,GACrBxB,EAAUyB,cAAgB,GAI1B,IAAIC,GAAU,EAad,IAZIzC,GAActnC,KAAK1iB,MAAMmkC,EAAGnP,YAC9BtS,KAAKuiC,OAAO9gB,EAAGnP,WACfo3B,EAAWjoB,EAAGhP,UACdk3B,GAAQ,IAER3pC,KAAKuiC,OAAO9gB,EAAGpP,QACfq3B,EAAWjoB,EAAGjP,OACdm3B,GAAQ,GAGVtB,EAAUsB,MAAQA,GAEV3pC,KAAK1iB,MAAMosD,IAAW,CAC5B,IAAI79D,GAAW,EACXm+D,EAAsB,KACtBC,EAAwB,KAC5B,MAAMhjE,EAAO+4B,KAAK4+B,YAElB,GAAI4I,GAAcxnC,KAAK2lC,aAAa,SAAU,CAC5C,MAAMyD,EAAYppC,KAAKopC,YAEnBA,EAAUtiE,OAAS26C,EAAG7O,OAASw2B,EAAUtiE,OAAS26C,EAAG1O,WACvD/S,KAAK5iB,OACL4sD,EAAahqC,KAAK8oB,MAAM9zC,MACxBqyD,GAAc,GAIlB,GAAIA,GAAernC,KAAK2lC,aAAa,UAAW,CAC9C,MAAMyD,EAAYppC,KAAKopC,YAGnBA,EAAUtiE,OAAS26C,EAAG7O,OAASw2B,EAAUtiE,OAAS26C,EAAG1O,WACvD/S,KAAK5iB,OACLvR,GAAW,GAIf,MAAMy8D,EAAWtoC,KAAKuoC,oBAEtB,GAAIvoC,KAAK8hC,IAAIrgB,EAAGzP,UACI,MAAdg4B,GACFhqC,KAAK4hC,WAAWoI,GAEdhqC,KAAK8hC,IAAIrgB,EAAGzP,WACVs2B,GACFtoC,KAAK4hC,WAAW0G,EAAStzD,OAE3BqzD,EAAUyB,cAAch/D,KACtBk1B,KAAKqpC,gCAAgCpiE,EAAM4E,KAG7Cw8D,EAAUwB,SAAS/+D,KACjBk1B,KAAKkpC,2BAA2BjiE,EAAM4E,EAAUy8D,SAG/C,GAAItoC,KAAK1iB,MAAMmkC,EAAG/O,SAAW1S,KAAKojC,aAAa,KAClC,MAAd4G,GACFhqC,KAAK4hC,WAAWoI,GAEd1B,GACFtoC,KAAK4hC,WAAW0G,EAAStzD,OAE3BqzD,EAAUuB,eAAe9+D,KACvBk1B,KAAKwpC,gCAAgCviE,EAAM4E,QAExC,CACL,IAAIgzD,EAAO,OAEX,GAAI7+B,KAAK2lC,aAAa,QAAU3lC,KAAK2lC,aAAa,OAAQ,CACxD,MAAMyD,EAAYppC,KAAKopC,YAErBA,EAAUtiE,OAAS26C,EAAG5uH,MACtBu2I,EAAUtiE,OAAS26C,EAAG9lB,QACtBytC,EAAUtiE,OAAS26C,EAAG/P,MAEtBmtB,EAAO7+B,KAAK8oB,MAAMp1H,MAClBssG,KAAK5iB,QAIT,MAAM8sD,EAAgBlqC,KAAKmqC,4BACzBljE,EACA4E,EACAm+D,EACA1B,EACAzJ,EACA0I,EANoB,MAOpBE,EAAAA,GAAiBkC,GAGG,OAAlBO,GACFH,GAAU,EACVE,EAAejqC,KAAK8oB,MAAM2L,cAE1B4T,EAAUpyD,WAAWnL,KAAKo/D,GAI9BlqC,KAAKoqC,2BAGHH,GACCjqC,KAAK1iB,MAAMmkC,EAAGjP,SACdxS,KAAK1iB,MAAMmkC,EAAGhP,YAEfzS,KAAK0jB,MACHumB,EACAtkB,GAAWqC,mCAKjBhoB,KAAKuiC,OAAOmH,GAORnC,IACFc,EAAU0B,QAAUA,GAGtB,MAAMhJ,EAAM/gC,KAAK8+B,WAAWuJ,EAAW,wBAIvC,OAFAroC,KAAK8oB,MAAMuK,OAAS8Q,EAEbpD,EAGToJ,4BACEljE,EACA4E,EACAm+D,EACA1B,EACAzJ,EACA0I,EACAE,GAEA,GAAIznC,KAAK8hC,IAAIrgB,EAAGvO,UAAW,CAOzB,OALElT,KAAK1iB,MAAMmkC,EAAG75B,QACdoY,KAAK1iB,MAAMmkC,EAAG37C,OACdk6B,KAAK1iB,MAAMmkC,EAAGjP,SACdxS,KAAK1iB,MAAMmkC,EAAGhP,YAGT80B,EAKOE,GACVznC,KAAK0jB,MAAM1jB,KAAK8oB,MAAM2L,aAAc9O,GAAWoB,oBAL/C/mB,KAAK0jB,MACH1jB,KAAK8oB,MAAM2L,aACX9O,GAAWqB,wBAKXshB,GACFtoC,KAAK0jB,MAAM4kB,EAAStzD,MAAO2wC,GAAWsB,iBAGjC,OAGJsgB,GACHvnC,KAAK0jB,MAAM1jB,KAAK8oB,MAAM2L,aAAc9O,GAAWyC,sBAE/B,MAAd4hB,GACFhqC,KAAK4hC,WAAWoI,GAEd1B,GACFtoC,KAAK0jB,MAAM4kB,EAAStzD,MAAO2wC,GAAW6B,gBAGxCvgD,EAAKijB,SAAW8V,KAAKokC,gBACdpkC,KAAK8+B,WAAW73D,EAAM,6BACxB,CACLA,EAAKjyE,IAAMgrG,KAAKipC,6BAChBhiE,EAAKkiE,OAASt9D,EACd5E,EAAKojE,MAAsB,MAAdL,EACb/iE,EAAK43D,KAAOA,EAEZ,IAAIe,GAAW,EA2Cf,OA1CI5/B,KAAKojC,aAAa,MAAQpjC,KAAK1iB,MAAMmkC,EAAG/O,SAE1CzrC,EAAKm2D,QAAS,EAEI,MAAd4M,GACFhqC,KAAK4hC,WAAWoI,GAEd1B,GACFtoC,KAAK4hC,WAAW0G,EAAStzD,OAG3B/N,EAAKvzE,MAAQssG,KAAKspC,6BAChBtpC,KAAK48B,YAAY31D,EAAK+N,MAAO/N,EAAKK,IAAI0N,QAE3B,QAAT6pD,GAA2B,QAATA,GACpB7+B,KAAKsqC,4BAA4BrjE,IAIhCsgE,GACiB,gBAAlBtgE,EAAKjyE,IAAInC,MACTo0E,EAAKvzE,MAAMssG,MAEXA,KAAK0jB,MACHz8C,EAAKvzE,MAAMssG,KAAKhrB,MAChB2wC,GAAW+B,gCAIF,SAATmX,GAAiB7+B,KAAK4hC,aAE1B36D,EAAKm2D,QAAS,EAEVp9B,KAAK8hC,IAAIrgB,EAAG1O,YACd6sB,GAAW,GAEb34D,EAAKvzE,MAAQssG,KAAKikC,2BAClBh9D,EAAKqhE,SAAWA,GAGlBrhE,EAAK24D,SAAWA,EAET5/B,KAAK8+B,WAAW73D,EAAM,uBAMjCqjE,4BACE3+C,GAEA,MAAM4+C,EAA+B,QAAlB5+C,EAASkzC,KAAiB,EAAI,EAC3C7pD,EAAQ2W,EAAS3W,MACjB/P,EACJ0mB,EAASj4F,MAAM6iF,OAAOtR,QAAU0mB,EAASj4F,MAAMkxG,KAAO,EAAI,GAExDjZ,EAASj4F,MAAMssG,MACjBA,KAAK0jB,MACH/3B,EAASj4F,MAAMssG,KAAKhrB,MACF,QAAlB2W,EAASkzC,KACLlZ,GAAWkB,0BACXlB,GAAW4B,2BAIftiD,IAAWslE,IACS,QAAlB5+C,EAASkzC,KACX7+B,KAAK0jB,MAAM1uC,EAAOmwC,EAAO9M,gBAEzBrY,KAAK0jB,MAAM1uC,EAAOmwC,EAAO7M,iBAIP,QAAlB3sB,EAASkzC,MAAkBlzC,EAASj4F,MAAMkxG,MAC5C5E,KAAK0jB,MAAM1uC,EAAOmwC,EAAO5M,wBAI7B6xB,0BAEKpqC,KAAK8hC,IAAIrgB,EAAG37C,OACZk6B,KAAK8hC,IAAIrgB,EAAG75B,QACZoY,KAAK1iB,MAAMmkC,EAAGjP,SACdxS,KAAK1iB,MAAMmkC,EAAGhP,YAEfzS,KAAK4hC,aAIT8F,iCACEpI,EACAzM,EACA5uC,GAEAq7C,EAAWA,GAAYt/B,KAAK8oB,MAAM9zC,MAClC69C,EAAWA,GAAY7yB,KAAK8oB,MAAM+J,SAClC,IAAI5rD,EAAOgd,GAAM+b,KAAK+mC,+BAA8B,GAEpD,KAAO/mC,KAAK8hC,IAAIrgB,EAAG3O,MAAM,CACvB,MAAM03B,EAAQxqC,KAAK48B,YAAY0C,EAAUzM,GACzC2X,EAAMC,cAAgBxjE,EACtBujE,EAAMvmD,GAAK+b,KAAK+mC,+BAA8B,GAC9C9/D,EAAO+4B,KAAK8+B,WAAW0L,EAAO,2BAGhC,OAAOvjE,EAGTyjE,qBACEpL,EACAzM,EACA5uC,GAEA,MAAMhd,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GASxC,OAPA5rD,EAAKi3D,eAAiB,KACtBj3D,EAAKgd,GAAK+b,KAAK0nC,iCAAiCpI,EAAUzM,EAAU5uC,GAEhE+b,KAAKojC,aAAa,OACpBn8D,EAAKi3D,eAAiBl+B,KAAK2nC,uCAGtB3nC,KAAK8+B,WAAW73D,EAAM,yBAG/B0jE,sBACE,MAAM1jE,EAAO+4B,KAAK4+B,YAGlB,OAFA5+B,KAAKuiC,OAAO9gB,EAAG9K,SACf1vC,EAAKijB,SAAW8V,KAAK4qC,uBACd5qC,KAAK8+B,WAAW73D,EAAM,wBAG/B4jE,qBACE,MAAM5jE,EAAO+4B,KAAK4+B,YAIlB,IAHA33D,EAAKwqC,MAAQ,GACbzR,KAAKuiC,OAAO9gB,EAAGzP,UAERhS,KAAK8oB,MAAMlxC,IAAMooB,KAAK/6B,SAAW+6B,KAAK1iB,MAAMmkC,EAAGtP,YACpDlrC,EAAKwqC,MAAM3mC,KAAKk1B,KAAKokC,kBACjBpkC,KAAK1iB,MAAMmkC,EAAGtP,YAClBnS,KAAKuiC,OAAO9gB,EAAG75B,OAGjB,OADAoY,KAAKuiC,OAAO9gB,EAAGtP,UACRnS,KAAK8+B,WAAW73D,EAAM,uBAG/BsiE,2BAA2B1wD,GACzB,IAAIhmF,EAAO,KACP+sI,GAAW,EACXsF,EAAiB,KACrB,MAAMj+D,EAAO+4B,KAAK4+B,YACZkM,EAAK9qC,KAAKopC,YACV2B,EAAS/qC,KAAK8oB,MAAMhiD,OAAS26C,EAAGzL,MAoBtC,OAlBI80B,EAAGhkE,OAAS26C,EAAG7O,OAASk4B,EAAGhkE,OAAS26C,EAAG1O,UACrCg4B,IAAWlyD,GACbmnB,KAAK0jB,MAAMz8C,EAAK+N,MAAO2wC,GAAWiC,sBAEpC/0H,EAAOmtG,KAAK6kC,gBAAgBkG,GACxB/qC,KAAK8hC,IAAIrgB,EAAG1O,YACd6sB,GAAW,EACPmL,GACF/qC,KAAK0jB,MAAMz8C,EAAK+N,MAAO2wC,GAAWgC,4BAGtCud,EAAiBllC,KAAKikC,4BAEtBiB,EAAiBllC,KAAKokC,gBAExBn9D,EAAKp0E,KAAOA,EACZo0E,EAAK24D,SAAWA,EAChB34D,EAAKi+D,eAAiBA,EACfllC,KAAK8+B,WAAW73D,EAAM,qBAG/B+jE,mCACElkE,GAEA,MAAMG,EAAO+4B,KAAK48B,YAAY91D,EAAKkO,MAAOlO,EAAKQ,IAAI0N,OAInD,OAHA/N,EAAKp0E,KAAO,KACZo0E,EAAK24D,UAAW,EAChB34D,EAAKi+D,eAAiBp+D,EACfk5B,KAAK8+B,WAAW73D,EAAM,qBAG/Bg+D,4BAA4B1uD,EAAoC,IAK9D,IAAIquB,EAAiC,KACjCoR,EAAkC,KAStC,IARIhW,KAAK1iB,MAAMmkC,EAAGzL,SAChBA,EAAQhW,KAAKupC,4BAAuC,GAEpDvzB,EAAMnjH,KAAO,KACRmtG,KAAK1iB,MAAMmkC,EAAG9O,SACjB3S,KAAKuiC,OAAO9gB,EAAG75B,SAGXoY,KAAK1iB,MAAMmkC,EAAG9O,UAAY3S,KAAK1iB,MAAMmkC,EAAGvO,WAC9C38B,EAAOzL,KAAKk1B,KAAKupC,4BAA2B,IACvCvpC,KAAK1iB,MAAMmkC,EAAG9O,SACjB3S,KAAKuiC,OAAO9gB,EAAG75B,OAMnB,OAHIoY,KAAK8hC,IAAIrgB,EAAGvO,YACdtO,EAAO5E,KAAKupC,4BAA2B,IAElC,CAAEhzD,OAAAA,EAAQquB,KAAAA,EAAMoR,MAAAA,GAGzBi1B,0BACE3L,EACAzM,EACA5rD,EACAgd,GAEA,OAAQA,EAAGpxF,MACT,IAAK,MACH,OAAOmtG,KAAK8+B,WAAW73D,EAAM,qBAE/B,IAAK,OACL,IAAK,UACH,OAAO+4B,KAAK8+B,WAAW73D,EAAM,yBAE/B,IAAK,QACH,OAAO+4B,KAAK8+B,WAAW73D,EAAM,uBAE/B,IAAK,QACH,OAAO+4B,KAAK8+B,WAAW73D,EAAM,uBAE/B,IAAK,SACH,OAAO+4B,KAAK8+B,WAAW73D,EAAM,wBAE/B,IAAK,SACH,OAAO+4B,KAAK8+B,WAAW73D,EAAM,wBAE/B,IAAK,SACH,OAAO+4B,KAAK8+B,WAAW73D,EAAM,wBAE/B,QAEE,OADA+4B,KAAK6nC,mBAAmB5jD,EAAGpxF,MACpBmtG,KAAK0qC,qBAAqBpL,EAAUzM,EAAU5uC,IAO3D2mD,uBACE,MAAMtL,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SACtB5rD,EAAO+4B,KAAK4+B,YAClB,IAAIxjC,EACAt0B,EACAokE,GAAgB,EACpB,MAAMrC,EAAwB7oC,KAAK8oB,MAAMwK,mBAEzC,OAAQtzB,KAAK8oB,MAAMhiD,MACjB,KAAK26C,EAAG5uH,KACN,OAAImtG,KAAK2lC,aAAa,aACb3lC,KAAKgpC,yBAGPhpC,KAAKirC,0BACV3L,EACAzM,EACA5rD,EACA+4B,KAAK6kC,mBAGT,KAAKpjB,EAAGpP,OACN,OAAOrS,KAAKonC,oBAAoB,CAC9BC,aAAa,EACbC,YAAY,EACZC,aAAa,EACbC,YAAY,EACZC,cAAc,IAGlB,KAAKhmB,EAAGnP,UACN,OAAOtS,KAAKonC,oBAAoB,CAC9BC,aAAa,EACbC,YAAY,EACZC,aAAa,EACbC,YAAY,EACZC,cAAc,IAGlB,KAAKhmB,EAAGzP,SAIN,OAHAhS,KAAK8oB,MAAMwK,oBAAqB,EAChCxsD,EAAOk5B,KAAK6qC,qBACZ7qC,KAAK8oB,MAAMwK,mBAAqBuV,EACzB/hE,EAET,KAAK26C,EAAGrN,WACN,GAAyB,MAArBpU,KAAK8oB,MAAMp1H,MAab,OAZAuzE,EAAKi3D,eAAiBl+B,KAAKglC,oCAC3BhlC,KAAKuiC,OAAO9gB,EAAG/O,QACftX,EAAM4E,KAAKilC,8BACXh+D,EAAKsP,OAAS6kB,EAAI7kB,OAClBtP,EAAK29B,KAAOxJ,EAAIwJ,KAChB39B,EAAK+4B,KAAO5E,EAAI4a,MAChBhW,KAAKuiC,OAAO9gB,EAAG9O,QAEf3S,KAAKuiC,OAAO9gB,EAAGxO,OAEfhsC,EAAKya,WAAase,KAAKokC,gBAEhBpkC,KAAK8+B,WAAW73D,EAAM,0BAE/B,MAEF,KAAKw6C,EAAG/O,OAIN,GAHA1S,KAAK5iB,QAGA4iB,KAAK1iB,MAAMmkC,EAAG9O,UAAY3S,KAAK1iB,MAAMmkC,EAAGvO,UAC3C,GAAIlT,KAAK1iB,MAAMmkC,EAAG5uH,OAASmtG,KAAK1iB,MAAMmkC,EAAGzL,OAAQ,CAC/C,MAAMzE,EAAQvR,KAAKopC,YAAYtiE,KAC/BokE,EAAgB35B,IAAUkQ,EAAG1O,UAAYxB,IAAUkQ,EAAG7O,WAEtDs4B,GAAgB,EAIpB,GAAIA,EAAe,CAMjB,GALAlrC,KAAK8oB,MAAMwK,oBAAqB,EAChCxsD,EAAOk5B,KAAKokC,gBACZpkC,KAAK8oB,MAAMwK,mBAAqBuV,EAI9B7oC,KAAK8oB,MAAMwK,sBAETtzB,KAAK1iB,MAAMmkC,EAAG75B,QACboY,KAAK1iB,MAAMmkC,EAAG9O,SAAW3S,KAAKopC,YAAYtiE,OAAS26C,EAAGxO,OAIzD,OADAjT,KAAKuiC,OAAO9gB,EAAG9O,QACR7rC,EAGPk5B,KAAK8hC,IAAIrgB,EAAG75B,OAwBhB,OAnBEwT,EADEt0B,EACIk5B,KAAKilC,4BAA4B,CACrCjlC,KAAKgrC,mCAAmClkE,KAGpCk5B,KAAKilC,8BAGbh+D,EAAKsP,OAAS6kB,EAAI7kB,OAClBtP,EAAK29B,KAAOxJ,EAAIwJ,KAChB39B,EAAK+4B,KAAO5E,EAAI4a,MAEhBhW,KAAKuiC,OAAO9gB,EAAG9O,QAEf3S,KAAKuiC,OAAO9gB,EAAGxO,OAEfhsC,EAAKya,WAAase,KAAKokC,gBAEvBn9D,EAAKi3D,eAAiB,KAEfl+B,KAAK8+B,WAAW73D,EAAM,0BAE/B,KAAKw6C,EAAG9lB,OACN,OAAOqE,KAAKm8B,aACVn8B,KAAK8oB,MAAMp1H,MACX,+BAGJ,KAAK+tH,EAAGlL,MACR,KAAKkL,EAAGjL,OAGN,OAFAvvC,EAAKvzE,MAAQssG,KAAK1iB,MAAMmkC,EAAGlL,OAC3BvW,KAAK5iB,OACE4iB,KAAK8+B,WACV73D,EACA,gCAGJ,KAAKw6C,EAAGnN,QACN,GAAyB,MAArBtU,KAAK8oB,MAAMp1H,MAAe,CAE5B,GADAssG,KAAK5iB,OACD4iB,KAAK1iB,MAAMmkC,EAAG/P,KAChB,OAAO1R,KAAKmrC,oBACTnrC,KAAK8oB,MAAMp1H,MACZ,8BACAuzE,GAIJ,GAAI+4B,KAAK1iB,MAAMmkC,EAAG9P,QAChB,OAAO3R,KAAKmrC,oBACTnrC,KAAK8oB,MAAMp1H,MACZ,8BACAuzE,GAIJ,MAAM+4B,KAAK0jB,MACT1jB,KAAK8oB,MAAM9zC,MACX2wC,GAAW0C,8BAIf,MAAMroB,KAAK4hC,aACb,KAAKngB,EAAG/P,IACN,OAAO1R,KAAKm8B,aACVn8B,KAAK8oB,MAAMp1H,MACX,+BAGJ,KAAK+tH,EAAG9P,OACN,OAAO3R,KAAKm8B,aACVn8B,KAAK8oB,MAAMp1H,MACX,+BAGJ,KAAK+tH,EAAG7K,MAEN,OADA5W,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAM,sBAE/B,KAAKw6C,EAAGnL,MAEN,OADAtW,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAM,6BAE/B,KAAKw6C,EAAGzL,MAEN,OADAhW,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAM,sBAE/B,KAAKw6C,EAAGjN,KAEN,OADAxU,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAM,wBAE/B,QACE,GAAgC,WAA5B+4B,KAAK8oB,MAAMhiD,KAAKmqC,QAClB,OAAOjR,KAAK2qC,sBACP,GAAI3qC,KAAK8oB,MAAMhiD,KAAKmqC,QAAS,CAClC,MAAMF,EAAQ/Q,KAAK8oB,MAAMhiD,KAAKiqC,MAE9B,OADA/Q,KAAK5iB,OACEmoC,MAAM6lB,iBAAiBnkE,EAAM8pC,IAI1C,MAAM/Q,KAAK4hC,aAGbyJ,uBACE,MAAM/L,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAC5B,IAAI/rD,EAAOk5B,KAAK4qC,uBACZU,GAA4B,EAChC,MACGtrC,KAAK1iB,MAAMmkC,EAAGzP,WAAahS,KAAK1iB,MAAMmkC,EAAGzO,gBACzChT,KAAKurC,sBACN,CACA,MAAMtkE,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GAClC+M,EAAW5/B,KAAK8hC,IAAIrgB,EAAGzO,aAC7Bs4B,EAA4BA,GAA6B1L,EACzD5/B,KAAKuiC,OAAO9gB,EAAGzP,WACV4tB,GAAY5/B,KAAK1iB,MAAMmkC,EAAGtP,WAC7BlrC,EAAKukE,YAAc1kE,EACnBk5B,KAAK5iB,OACLtW,EAAOk5B,KAAK8+B,WAAW73D,EAAM,yBAE7BA,EAAKwkE,WAAa3kE,EAClBG,EAAKykE,UAAY1rC,KAAKokC,gBACtBpkC,KAAKuiC,OAAO9gB,EAAGtP,UACXm5B,GACFrkE,EAAK24D,SAAWA,EAChB94D,EAAOk5B,KAAK8+B,WACV73D,EACA,8BAGFH,EAAOk5B,KAAK8+B,WACV73D,EACA,sBAKR,OAAOH,EAGT6kE,sBACE,MAAM1kE,EAAO+4B,KAAK4+B,YAClB,OAAI5+B,KAAK8hC,IAAIrgB,EAAG1O,WACd9rC,EAAKi+D,eAAiBllC,KAAK2rC,sBACpB3rC,KAAK8+B,WAAW73D,EAAM,2BAEtB+4B,KAAKqrC,uBAIhBO,qCACE,MAAMC,EAAQ7rC,KAAK2rC,sBACnB,IAAK3rC,KAAK8oB,MAAMwK,oBAAsBtzB,KAAK8hC,IAAIrgB,EAAGxO,OAAQ,CAExD,MAAMhsC,EAAO+4B,KAAK48B,YAAYiP,EAAM72D,MAAO62D,EAAMvkE,IAAI0N,OAMrD,OALA/N,EAAKsP,OAAS,CAACypB,KAAKgrC,mCAAmCa,IACvD5kE,EAAK29B,KAAO,KACZ39B,EAAK+4B,KAAO,KACZ/4B,EAAKya,WAAase,KAAKokC,gBACvBn9D,EAAKi3D,eAAiB,KACfl+B,KAAK8+B,WAAW73D,EAAM,0BAE/B,OAAO4kE,EAGTC,4BACE,MAAM7kE,EAAO+4B,KAAK4+B,YAClB5+B,KAAK8hC,IAAIrgB,EAAGvN,YACZ,MAAMptC,EAAOk5B,KAAK4rC,qCAElB,IADA3kE,EAAKwqC,MAAQ,CAAC3qC,GACPk5B,KAAK8hC,IAAIrgB,EAAGvN,aACjBjtC,EAAKwqC,MAAM3mC,KAAKk1B,KAAK4rC,sCAEvB,OAA6B,IAAtB3kE,EAAKwqC,MAAMxsC,OACd6B,EACAk5B,KAAK8+B,WAAW73D,EAAM,8BAG5B8kE,qBACE,MAAM9kE,EAAO+4B,KAAK4+B,YAClB5+B,KAAK8hC,IAAIrgB,EAAGzN,WACZ,MAAMltC,EAAOk5B,KAAK8rC,4BAElB,IADA7kE,EAAKwqC,MAAQ,CAAC3qC,GACPk5B,KAAK8hC,IAAIrgB,EAAGzN,YACjB/sC,EAAKwqC,MAAM3mC,KAAKk1B,KAAK8rC,6BAEvB,OAA6B,IAAtB7kE,EAAKwqC,MAAMxsC,OACd6B,EACAk5B,KAAK8+B,WAAW73D,EAAM,uBAG5Bm9D,gBACE,MAAMD,EAAYnkC,KAAK8oB,MAAMuK,OAC7BrzB,KAAK8oB,MAAMuK,QAAS,EACpB,MAAMvsD,EAAOk5B,KAAK+rC,qBAElB,OADA/rC,KAAK8oB,MAAMuK,OAAS8Q,EACbr9D,EAGTiiE,uCACE,GAAI/oC,KAAK8oB,MAAMhiD,OAAS26C,EAAG5uH,MAA6B,MAArBmtG,KAAK8oB,MAAMp1H,MAAe,CAC3D,MAAM4rI,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SACtB5rD,EAAO+4B,KAAK6kC,kBAClB,OAAO7kC,KAAK0qC,qBAAqBpL,EAAUzM,EAAU5rD,GAErD,OAAO+4B,KAAKokC,gBAIhBuC,0BACE,MAAM1/D,EAAO+4B,KAAK4+B,YAElB,OADA33D,EAAKi+D,eAAiBllC,KAAKikC,2BACpBjkC,KAAK8+B,WAAW73D,EAAM,kBAG/B++D,mCACEgG,GAEA,MAAMxD,EAAQwD,EACVhsC,KAAK6kC,kBACL7kC,KAAK+mC,gCAKT,OAJI/mC,KAAK1iB,MAAMmkC,EAAG7O,SAChB41B,EAAMtD,eAAiBllC,KAAK2mC,0BAC5B3mC,KAAKmlC,iBAAiBqD,IAEjBA,EAGTyD,oBAAoBhlE,GASlB,OARAA,EAAKilB,WAAWg5C,eAAiBj+D,EAAKi+D,eAEtCllC,KAAKmlC,iBACHl+D,EAAKilB,WACLjlB,EAAKi+D,eAAelgE,IACpBiC,EAAKi+D,eAAe59D,IAAItC,KAGnBiC,EAAKilB,WAGdq8C,oBACE,IAAID,EAAW,KAWf,OAVItoC,KAAK1iB,MAAMmkC,EAAGnN,WAChBg0B,EAAWtoC,KAAK4+B,YACS,MAArB5+B,KAAK8oB,MAAMp1H,MACb40I,EAASzJ,KAAO,OAEhByJ,EAASzJ,KAAO,QAElB7+B,KAAK5iB,OACL4iB,KAAK8+B,WAAWwJ,EAAU,aAErBA,EAOT/J,kBACEt3D,EACAilE,EACAzN,GAAqB,GAErB,OAAIyN,EACKlsC,KAAKmsC,iCAAiCllE,GAAM,IACjDs+C,MAAMgZ,kBAAkBt3D,GAAM,EAAMw3D,KAIjClZ,MAAMgZ,kBAAkBt3D,GAAM,EAAOw3D,GAG9C2N,2BACEnlE,EACAH,EACA23D,GAAqB,GAErB,GAAIz+B,KAAK1iB,MAAMmkC,EAAG7O,OAAQ,CACxB,MAAMkyB,EAAW9kC,KAAK4+B,aAIpBkG,EAASI,eAETj+D,EAAKw9D,WACHzkC,KAAKwkC,uCAETv9D,EAAKya,WAAaojD,EAASI,eACvBllC,KAAK8+B,WAAWgG,EAAU,kBAC1B,KAGNvf,MAAM6mB,2BAA2BnlE,EAAMH,EAAM23D,GAI/C4N,eAAe7iE,EAAkB8iE,GAE/B,GACEtsC,KAAK8oB,MAAM6J,QACX3yB,KAAK1iB,MAAMmkC,EAAG5uH,OACO,cAArBmtG,KAAK8oB,MAAMp1H,MACX,CACA,MAAM01I,EAAYppC,KAAKopC,YACvB,GAAIA,EAAUtiE,OAAS26C,EAAG5uH,MAAQgwH,EAAUumB,EAAU11I,OAAQ,CAC5D,MAAMuzE,EAAO+4B,KAAK4+B,YAElB,OADA5+B,KAAK5iB,OACE4iB,KAAK4nC,mBAAmB3gE,SAE5B,GAAI+4B,KAAK8jC,oBAAsB9jC,KAAK2lC,aAAa,QAAS,CAC/D,MAAM1+D,EAAO+4B,KAAK4+B,YAElB,OADA5+B,KAAK5iB,OACE4iB,KAAKusC,yBAAyBtlE,GAEvC,MAAM01D,EAAOpX,MAAM8mB,eAAe7iE,EAAS8iE,GAK3C,YAHwB52I,IAApBsqG,KAAK2jC,YAA6B3jC,KAAKq9B,iBAAiBV,KAC1D38B,KAAK2jC,WAAa,MAEbhH,EAIT6P,yBACEvlE,EACAwlE,GAEA,GAAkB,eAAdA,EAAK3lE,KACP,GAAkB,YAAd2lE,EAAK55I,MACP,GACEmtG,KAAK1iB,MAAMmkC,EAAGvL,SACdlW,KAAK1iB,MAAMmkC,EAAG5uH,OACdmtG,KAAK1iB,MAAMmkC,EAAGpM,YACdrV,KAAK1iB,MAAMmkC,EAAG9L,OACd3V,KAAK1iB,MAAMmkC,EAAGrL,SAEd,OAAOpW,KAAKqlC,iBAAiBp+D,QAE1B,GAAI+4B,KAAK1iB,MAAMmkC,EAAG5uH,MAAO,CAC9B,GAAkB,cAAd45I,EAAK55I,KACP,OAAOmtG,KAAK4nC,mBAAmB3gE,GAC1B,GAAkB,SAAdwlE,EAAK55I,KACd,OAAOmtG,KAAK4mC,mBAAmB3/D,GAC1B,GAAkB,WAAdwlE,EAAK55I,KACd,OAAOmtG,KAAK6mC,oBAAoB5/D,GAAM,GAK5C,OAAOs+C,MAAMinB,yBAAyBvlE,EAAMwlE,GAI9CC,+BACE,OACE1sC,KAAK2lC,aAAa,SAClB3lC,KAAK2lC,aAAa,cAClB3lC,KAAK2lC,aAAa,WACjB3lC,KAAK8jC,oBAAsB9jC,KAAK2lC,aAAa,SAC9CpgB,MAAMmnB,+BAIVC,2BACE,QACE3sC,KAAK1iB,MAAMmkC,EAAG5uH,SACQ,SAArBmtG,KAAK8oB,MAAMp1H,OACW,cAArBssG,KAAK8oB,MAAMp1H,OACU,WAArBssG,KAAK8oB,MAAMp1H,OACVssG,KAAK8jC,oBAA2C,SAArB9jC,KAAK8oB,MAAMp1H,SAKpC6xH,MAAMonB,2BAGfC,+BACE,GAAI5sC,KAAK8jC,oBAAsB9jC,KAAK2lC,aAAa,QAAS,CACxD,MAAM1+D,EAAO+4B,KAAK4+B,YAElB,OADA5+B,KAAK5iB,OACE4iB,KAAKusC,yBAAyBtlE,GAEvC,OAAOs+C,MAAMqnB,+BAGfC,iBACEJ,EACAnN,EACAzM,EACAia,GAEA,IAAK9sC,KAAK1iB,MAAMmkC,EAAG1O,UAAW,OAAO05B,EAIrC,GAAIK,EAAkB,CACpB,MAAMliE,EAASo1B,KAAK+sC,UAAS,IAC3BxnB,MAAMsnB,iBAAiBJ,EAAMnN,EAAUzM,KAGzC,OAAKjoD,EAAO3D,MAMR2D,EAAO2E,QAAOywB,KAAK8oB,MAAQl+C,EAAOoiE,WAC/BpiE,EAAO3D,OALZ6lE,EAAiB93D,MAAQpK,EAAO2E,MAAMqI,KAAOooB,KAAK8oB,MAAM9zC,MACjDy3D,GAOXzsC,KAAKuiC,OAAO9gB,EAAG1O,UACf,MAAM+V,EAAQ9oB,KAAK8oB,MAAMuM,QACnB4X,EAAoBjtC,KAAK8oB,MAAMmK,UAC/BhsD,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GACxC,IAAIj8C,WAAEA,EAAFs2D,OAAcA,GAAWltC,KAAKmtC,iCAC7BC,EAAOC,GAAWrtC,KAAKstC,wBAAwB12D,GAEpD,GAAIs2D,GAAUG,EAAQpoE,OAAS,EAAG,CAChC,MAAMguD,EAAY,IAAIga,GAEtB,GAAII,EAAQpoE,OAAS,EAAG,CACtB+6B,KAAK8oB,MAAQA,EACb9oB,KAAK8oB,MAAMmK,UAAYA,EAEvB,IAAK,IAAI9rD,EAAI,EAAGA,EAAIkmE,EAAQpoE,OAAQkC,IAClC8rD,EAAUnoD,KAAKuiE,EAAQlmE,GAAG6N,SAGzB4B,WAAAA,EAAYs2D,OAAAA,GAAWltC,KAAKmtC,kCAC9BC,EAAOC,GAAWrtC,KAAKstC,wBAAwB12D,GAG9Cs2D,GAAUE,EAAMnoE,OAAS,GAM3B+6B,KAAK0jB,MAAMoF,EAAM9zC,MAAO2wC,GAAWC,2BAGjCsnB,GAA2B,IAAjBE,EAAMnoE,SAClB+6B,KAAK8oB,MAAQA,EACb9oB,KAAK8oB,MAAMmK,UAAYA,EAAUphC,OAAOu7C,EAAM,GAAGp4D,SAC9C4B,WAAAA,EAAYs2D,OAAAA,GAAWltC,KAAKmtC,kCAenC,OAXAntC,KAAKstC,wBAAwB12D,GAAY,GAEzCopB,KAAK8oB,MAAMmK,UAAYga,EACvBjtC,KAAKuiC,OAAO9gB,EAAG7O,OAEf3rC,EAAKxB,KAAOgnE,EACZxlE,EAAK2P,WAAaA,EAClB3P,EAAK4P,UAAYmpB,KAAKmsC,iCAAiCllE,GAAM,IAC3D+4B,KAAKutC,sBAAiB73I,OAAWA,OAAWA,KAGvCsqG,KAAK8+B,WAAW73D,EAAM,yBAG/BkmE,gCAIEntC,KAAK8oB,MAAMoK,0BAA0BpoD,KAAKk1B,KAAK8oB,MAAM9zC,OAErD,MAAM4B,EAAaopB,KAAKyiC,0BAClByK,GAAUltC,KAAK1iB,MAAMmkC,EAAG7O,OAI9B,OAFA5S,KAAK8oB,MAAMoK,0BAA0Bj1C,MAE9B,CAAErH,WAAAA,EAAYs2D,OAAAA,GAUvBI,wBACErmE,EACAumE,GAEA,MAAMh2B,EAAQ,CAACvwC,GACTwmE,EAAsC,GAE5C,KAAwB,IAAjBj2B,EAAMvyC,QAAc,CACzB,MAAMgC,EAAOuwC,EAAMv5B,MACD,4BAAdhX,EAAKH,MACHG,EAAKi3D,iBAAmBj3D,EAAKya,WAE/Bse,KAAK0tC,sBAAsBzmE,GAE3BwmE,EAAO3iE,KAAK7D,GAEduwC,EAAM1sC,KAAK7D,EAAKhB,OACO,0BAAdgB,EAAKH,OACd0wC,EAAM1sC,KAAK7D,EAAK2P,YAChB4gC,EAAM1sC,KAAK7D,EAAK4P,YAIpB,OAAI22D,GACFC,EAAOr5I,SAAQ6yE,GAAQ+4B,KAAK0tC,sBAAsBzmE,KAC3C,CAACwmE,EAAQ,KAl0DxB,SACE/pD,EACAje,GAEA,MAAMkoE,EAAQ,GACRC,EAAQ,GACd,IAAK,IAAIzmE,EAAI,EAAGA,EAAIuc,EAAKze,OAAQkC,KAC9B1B,EAAKie,EAAKvc,GAAIA,EAAGuc,GAAQiqD,EAAQC,GAAO9iE,KAAK4Y,EAAKvc,IAErD,MAAO,CAACwmE,EAAOC,GA4zDJC,CAAUJ,GAAQxmE,GACvBA,EAAKsP,OAAOw2B,OAAM8+B,GAAS7rC,KAAK8tC,aAAajC,GAAO,OAIxD6B,sBAAsBzmE,GAAiC,IAAA8mE,EACrD/tC,KAAKguC,iBAGD/mE,EAAKsP,OAHT,OAAAw3D,EAIE9mE,EAAK41D,YAJP,EAIEkR,EAAYE,eACA,GAGdjuC,KAAK6kB,MAAMF,MAAMupB,GAEjB3oB,MAAM4oB,YAAYlnE,GAAM,GAAO,GAC/B+4B,KAAK6kB,MAAMD,OAGbunB,iCAAoCllE,EAAcgI,GAChD,IAAIrE,EASJ,OARkE,IAA9Do1B,KAAK8oB,MAAMoK,0BAA0B1nD,QAAQvE,EAAK+N,QACpDgrB,KAAK8oB,MAAMoK,0BAA0BpoD,KAAKk1B,KAAK8oB,MAAM9zC,OACrDpK,EAASqE,IACT+wB,KAAK8oB,MAAMoK,0BAA0Bj1C,OAErCrT,EAASqE,IAGJrE,EAGTwjE,eACEnnE,EACAq4D,EACAzM,GAWA,GATA5rD,EAAOs+C,MAAM6oB,eAAennE,EAAMq4D,EAAUzM,GACxC7yB,KAAK8hC,IAAIrgB,EAAG1O,YACd9rC,EAAK24D,UAAW,EAIhB5/B,KAAKmlC,iBAAiBl+D,IAGpB+4B,KAAK1iB,MAAMmkC,EAAG7O,OAAQ,CACxB,MAAMy7B,EAAeruC,KAAK48B,YAAY0C,EAAUzM,GAIhD,OAHAwb,EAAaniD,WAAajlB,EAC1BonE,EAAanJ,eAAiBllC,KAAK2mC,0BAE5B3mC,KAAK8+B,WAAWuP,EAAc,sBAGvC,OAAOpnE,EAGTqnE,wBAAwBrnE,GAEL,sBAAdA,EAAKH,OACiB,SAApBG,EAAK2hD,YAA6C,WAApB3hD,EAAK2hD,aACvB,2BAAd3hD,EAAKH,MACgB,SAApBG,EAAKy/D,YACQ,yBAAdz/D,EAAKH,MAAuD,SAApBG,EAAKy/D,YAOhDnhB,MAAM+oB,wBAAwBrnE,GAGhC+4D,YAAY/4D,GACV,MAAMsnE,EAAOhpB,MAAMya,YAAY/4D,GAO/B,MALgB,2BAAdsnE,EAAKznE,MACS,yBAAdynE,EAAKznE,OAELynE,EAAK7H,WAAa6H,EAAK7H,YAAc,SAEhC6H,EAGTC,uBAAuBvnE,GACrB,GAAI+4B,KAAK2lC,aAAa,QAAS,CAC7B1+D,EAAKy/D,WAAa,OAElB,MAAM+H,EAAkBzuC,KAAK4+B,YAG7B,OAFA5+B,KAAK5iB,OAED4iB,KAAK1iB,MAAMmkC,EAAGpP,SAEhBprC,EAAKi5D,WAAalgC,KAAK0uC,wBACvB1uC,KAAK2uC,gBAAgB1nE,GACd,MAGA+4B,KAAK4mC,mBAAmB6H,GAE5B,GAAIzuC,KAAK2lC,aAAa,UAAW,CACtC1+D,EAAKy/D,WAAa,OAElB,MAAM+H,EAAkBzuC,KAAK4+B,YAG7B,OAFA5+B,KAAK5iB,OAEE4iB,KAAK6mC,oBAAoB4H,GAAiB,GAC5C,GAAIzuC,KAAK2lC,aAAa,aAAc,CACzC1+D,EAAKy/D,WAAa,OAClB,MAAM+H,EAAkBzuC,KAAK4+B,YAE7B,OADA5+B,KAAK5iB,OACE4iB,KAAK4nC,mBAAmB6G,GAC1B,GAAIzuC,KAAK8jC,oBAAsB9jC,KAAK2lC,aAAa,QAAS,CAC/D1+D,EAAKy/D,WAAa,QAClB,MAAM+H,EAAkBzuC,KAAK4+B,YAE7B,OADA5+B,KAAK5iB,OACE4iB,KAAKusC,yBAAyBkC,GAErC,OAAOlpB,MAAMipB,uBAAuBvnE,GAIxC2nE,cAAc3nE,GACZ,QAAIs+C,MAAMqpB,iBAAiBv4D,eAEvB2pB,KAAK2lC,aAAa,SAAW3lC,KAAKopC,YAAYtiE,OAAS26C,EAAGjN,QAC5DvtC,EAAKy/D,WAAa,OAClB1mC,KAAK5iB,OACL4iB,KAAK5iB,QACE,GAMXyxD,mCAAmC5nE,GACjC,MAAM2Q,EAAMooB,KAAK8oB,MAAM9zC,MACjB85D,EAAevpB,MAAMspB,mCAAmC5nE,GAI9D,OAHI6nE,GAAoC,SAApB7nE,EAAKy/D,YACvB1mC,KAAK4hC,WAAWhqD,GAEXk3D,EAGTC,aAAa9nE,EAAe+nE,EAAsBC,GAChD1pB,MAAMwpB,aAAa9nE,EAAM+nE,EAAaC,GAClCjvC,KAAKojC,aAAa,OACpBn8D,EAAKi3D,eAAiBl+B,KAAKglC,qCAI/BkK,iBACEpR,EACAqR,EACArmB,GAEA,MAAMlxC,EAAMooB,KAAK8oB,MAAM9zC,MACvB,GAAIgrB,KAAK2lC,aAAa,WAAY,CAChC,GAAI3lC,KAAKovC,6BAA6BtR,EAAWqR,GAE/C,OAGFA,EAAOnH,SAAU,EAGnBziB,MAAM2pB,iBAAiBpR,EAAWqR,EAAQrmB,GAEtCqmB,EAAOnH,UAES,kBAAhBmH,EAAOroE,MACS,yBAAhBqoE,EAAOroE,MACS,uBAAhBqoE,EAAOroE,KAEPk5B,KAAK0jB,MAAM9rC,EAAK+tC,GAAWI,qBAClBopB,EAAOz7I,OAChBssG,KAAK0jB,MACHyrB,EAAOz7I,MAAMshF,MACb2wC,GAAWK,+BAMnBqpB,WAAW7sB,GACT,MAAgB,aAATA,GAAgC,kBAATA,EAGhC8sB,eACE,MAAM9sB,EAAO+C,MAAMgqB,YACbC,EAAW,KAAOhtB,EAGnBxiB,KAAKqvC,WAAW7sB,IAAUxiB,KAAK8oB,MAAMuK,QACxCrzB,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAOlK,kBAAmBu0B,GAGvDxvC,KAAKkhC,YAAYzf,EAAG5uH,KAAM28I,GAI5BrO,iBAAiB9rI,GACf,MAAM+nF,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GACpD,OAAQ,MAAJviF,GAAyC,MAAJ+nF,EAChC4iB,KAAKyvC,SAAShuB,EAAGnP,UAAW,IAEnCtS,KAAK8oB,MAAMuK,QACN,KAAJh+H,GAAsC,KAAJA,EAG1B2qG,KAAK8oB,MAAMuK,QAAc,KAAJh+H,EACtB,KAAJ+nF,EACK4iB,KAAKyvC,SAAShuB,EAAGzO,YAAa,GAGhChT,KAAKyvC,SAAShuB,EAAG1O,SAAU,GJlrEnC,SAAyB28B,EAAiBtyD,GAC/C,OAAc,KAAPsyD,GAAoC,KAAJtyD,EIkrExBuyD,CAAgBt6I,EAAM+nF,IAC/B4iB,KAAK8oB,MAAMlxC,KAAO,EACXooB,KAAKsvC,gBAEL/pB,MAAM4b,iBAAiB9rI,GAXvB2qG,KAAKyvC,SAAShuB,EAAGrN,WAAY,GAexC05B,aAAa7mE,EAAc2oE,GACzB,OAAQ3oE,EAAKH,MACX,IAAK,aACL,IAAK,gBACL,IAAK,eACL,IAAK,oBACH,OAAO,EAET,IAAK,mBAAoB,CACvB,MAAMiV,EAAO9U,EAAKgP,WAAWhR,OAAS,EACtC,OAAOgC,EAAKgP,WAAW82B,OAAM,CAACp0B,EAAMxR,IAElB,iBAAdwR,EAAK7R,OACJK,IAAM4U,GAAsB,kBAAdpD,EAAK7R,OACpBk5B,KAAK8tC,aAAan1D,KAKxB,IAAK,iBACH,OAAOqnB,KAAK8tC,aAAa7mE,EAAKvzE,OAEhC,IAAK,gBACH,OAAOssG,KAAK8tC,aAAa7mE,EAAKijB,UAEhC,IAAK,kBACH,OAAOjjB,EAAK8O,SAASg3B,OAAMlvB,GAAWmiB,KAAK8tC,aAAajwD,KAE1D,IAAK,uBACH,MAAyB,MAAlB5W,EAAKsjB,SAEd,IAAK,0BACL,IAAK,qBACH,OAAOyV,KAAK8tC,aAAa7mE,EAAKilB,YAEhC,IAAK,mBACL,IAAK,2BACH,OAAQ0jD,EAEV,QACE,OAAO,GAIbpQ,aAAav4D,EAAcw4D,GAAiB,GAC1C,MAAkB,uBAAdx4D,EAAKH,KACAy+C,MAAMia,aAAax/B,KAAKisC,oBAAoBhlE,GAAOw4D,GAEnDla,MAAMia,aAAav4D,EAAMw4D,GAKpCuO,iBACE6B,EACAC,EACArQ,GAEA,IAAK,IAAIt4D,EAAI,EAAGA,EAAI0oE,EAAS5qE,OAAQkC,IAAK,CACxC,MAAMslE,EAAOoD,EAAS1oE,GACH,wBAAX,MAAJslE,OAAA,EAAAA,EAAM3lE,QACR+oE,EAAS1oE,GAAK64B,KAAKisC,oBAAoBQ,IAG3C,OAAOlnB,MAAMyoB,iBAAiB6B,EAAUC,EAAkBrQ,GAK5DsQ,iBACEF,EACAG,GAEA,IAAK,IAAI7oE,EAAI,EAAGA,EAAI0oE,EAAS5qE,OAAQkC,IAAK,CAAA,IAAA8oE,EACxC,MAAMxD,EAAOoD,EAAS1oE,IAEpBslE,GACc,uBAAdA,EAAK3lE,MACL,OAAAmpE,EAACxD,EAAK5P,QAALoT,EAAY1S,iBACZsS,EAAS5qE,OAAS,IAAM+qE,GAEzBhwC,KAAK0jB,MAAM+oB,EAAKvH,eAAelwD,MAAO2wC,GAAWoC,mBAIrD,OAAO8nB,EAGTK,eACElwD,EACAmwD,EACAC,EACA7Q,GAEA,MAAMt4D,EAAOs+C,MAAM2qB,eACjBlwD,EACAmwD,EACAC,EACA7Q,GAYF,OAJI4Q,IAAiBnwC,KAAK8oB,MAAMqK,wBAC9BnzB,KAAK+vC,iBAAiB9oE,EAAK8O,UAGtB9O,EAGTopE,UACE5D,KACGr2D,GAUH,GAAkB,uBAAdq2D,EAAK3lE,KACP,OAAOy+C,MAAM8qB,UAAU5D,KAASr2D,GAKpC2oD,mBAAmB93D,GAIjB,OAHI+4B,KAAK1iB,MAAMmkC,EAAG7O,SAChB3rC,EAAKi+D,eAAiBllC,KAAK2mC,2BAEtBphB,MAAMwZ,mBAAmB93D,GAGlCg4D,0BACEh4D,GAKA,OAHI+4B,KAAK1iB,MAAMmkC,EAAG7O,SAChB3rC,EAAKi+D,eAAiBllC,KAAK2mC,2BAEtBphB,MAAM0Z,0BAA0Bh4D,GAIzCqpE,gBACE,OAAOtwC,KAAKojC,aAAa,MAAQ7d,MAAM+qB,gBAIzCC,kBACE,OAAOvwC,KAAK1iB,MAAMmkC,EAAG7O,QAAU2S,MAAMgrB,kBAGvCC,uBAAuBpT,GACrB,OAAQp9B,KAAK1iB,MAAMmkC,EAAG7O,QAAU2S,MAAMirB,uBAAuBpT,GAI/DS,gBACEC,EACAV,EACAxF,EACAD,EACAoG,EACAC,GAmBA,GAjBKZ,EAAoBkL,UACvBtoC,KAAK4hC,WAAYxE,EAAoBkL,SAAStzD,cAExCooD,EAAoBkL,SACxBtoC,KAAKojC,aAAa,OACpBhG,EAAOc,eAAiBl+B,KAAKglC,qCAG/Bzf,MAAMsY,gBACJC,EACAV,EACAxF,EACAD,EACAoG,EACAC,GAGEZ,EAAO7mD,QAAUwnD,EAAe,CAClC,MAAMxnD,EAAS6mD,EAAO7mD,OAClBA,EAAOtR,OAAS,GAAK+6B,KAAKywC,YAAYl6D,EAAO,KAC/CypB,KAAK0jB,MAAM0Z,EAAOpoD,MAAO2wC,GAAW+B,mCAGjC,GAEW,qBAAhB0V,EAAOt2D,MACPi3D,GACAX,EAAO1pI,MAAM6iF,OACb,CACA,MAAMA,EAAS6mD,EAAO1pI,MAAM6iF,OACxBA,EAAOtR,OAAS,GAAK+6B,KAAKywC,YAAYl6D,EAAO,KAC/CypB,KAAK0jB,MAAM0Z,EAAOpoD,MAAO2wC,GAAW+B,+BAK1CgpB,uBACE5S,EACAV,EACAxF,EACAD,GAEKyF,EAAoBkL,UACvBtoC,KAAK4hC,WAAYxE,EAAoBkL,SAAStzD,cAExCooD,EAAoBkL,SACxBtoC,KAAKojC,aAAa,OACpBhG,EAAOc,eAAiBl+B,KAAKglC,qCAG/Bzf,MAAMmrB,uBAAuB5S,EAAWV,EAAQxF,EAAaD,GAI/DgZ,gBAAgB1pE,GAKd,GAJAs+C,MAAMorB,gBAAgB1pE,GAClBA,EAAKy0D,YAAc17B,KAAKojC,aAAa,OACvCn8D,EAAK2pE,oBAAsB5wC,KAAK2nC,uCAE9B3nC,KAAK2lC,aAAa,cAAe,CACnC3lC,KAAK5iB,OACL,MAAMyzD,EAAwC5pE,EAAKggE,WAAa,GAChE,EAAG,CACD,MAAMhgE,EAAO+4B,KAAK4+B,YAClB33D,EAAKgd,GAAK+b,KAAK+mC,+BAA0C,GACrD/mC,KAAKojC,aAAa,KACpBn8D,EAAKi3D,eAAiBl+B,KAAK2nC,sCAE3B1gE,EAAKi3D,eAAiB,KAExB2S,EAAY/lE,KAAKk1B,KAAK8+B,WAAW73D,EAAM,0BAChC+4B,KAAK8hC,IAAIrgB,EAAG75B,SAIzBkpD,wBAAwB1T,GACtB7X,MAAMurB,wBAAwB1T,GAC9B,MAAM7mD,EAASypB,KAAKm9B,6BAA6BC,GACjD,GAAI7mD,EAAOtR,OAAS,EAAG,CACrB,MAAM4mE,EAAQt1D,EAAO,GACjBypB,KAAKywC,YAAY5E,IAA0B,QAAhBzO,EAAOyB,KACpC7+B,KAAK0jB,MAAMmoB,EAAM72D,MAAO2wC,GAAWkB,2BAC1B7mB,KAAKywC,YAAY5E,IAC1B7rC,KAAK0jB,MAAMmoB,EAAM72D,MAAO2wC,GAAW4B,4BAKzCwpB,kBACE9pE,EACA+pE,GAEA,MAAM1I,EAAWtoC,KAAKuoC,oBAChBvzI,EAAMuwH,MAAMwrB,kBAAkB9pE,EAAM+pE,GAG1C,OADA/pE,EAAKqhE,SAAWA,EACTtzI,EAITi8I,kBACEt4D,EACA2mD,EACAzM,EACA+E,EACAD,EACAwH,EACAC,EACAG,GAOA,IAAIrB,EALCvlD,EAAkB2vD,UACrBtoC,KAAK4hC,WAAYjpD,EAAkB2vD,SAAStzD,cAEtC2D,EAAkB2vD,SAKtBtoC,KAAKojC,aAAa,OAAShE,IAC7BlB,EAAiBl+B,KAAKglC,oCACjBhlC,KAAK1iB,MAAMmkC,EAAG/O,SAAS1S,KAAK4hC,cAGnCrc,MAAM0rB,kBACJt4D,EACA2mD,EACAzM,EACA+E,EACAD,EACAwH,EACAC,EACAG,GAIErB,KACDvlD,EAAKjlF,OAASilF,GAAMulD,eAAiBA,GAI1CgT,6BAA6BrF,GAsB3B,OArBI7rC,KAAK8hC,IAAIrgB,EAAG1O,YACK,eAAf84B,EAAM/kE,MACRk5B,KAAK0jB,MAAMmoB,EAAM72D,MAAO2wC,GAAW2B,wBAEjCtnB,KAAKywC,YAAY5E,IACnB7rC,KAAK0jB,MAAMmoB,EAAM72D,MAAO2wC,GAAWgC,2BAGnCkkB,EAA2BjM,UAAW,GAEtC5/B,KAAK1iB,MAAMmkC,EAAG7O,OAChBi5B,EAAM3G,eAAiBllC,KAAK2mC,0BACnB3mC,KAAKywC,YAAY5E,IAC1B7rC,KAAK0jB,MAAMmoB,EAAM72D,MAAO2wC,GAAW8B,6BAGjCznB,KAAK1iB,MAAMmkC,EAAGlO,KAAOvT,KAAKywC,YAAY5E,IACxC7rC,KAAK0jB,MAAMmoB,EAAM72D,MAAO2wC,GAAWkC,oBAGrC7nB,KAAKmlC,iBAAiB0G,GACfA,EAGTsF,kBACE7R,EACAzM,EACA3pC,GAEA,MAAMjiB,EAAOs+C,MAAM4rB,kBAAkB7R,EAAUzM,EAAU3pC,GAUzD,MAPgB,sBAAdjiB,EAAKH,MACLG,EAAKi+D,gBACLj+D,EAAKkiB,MAAMnU,MAAQ/N,EAAKi+D,eAAelwD,OAEvCgrB,KAAK0jB,MAAMz8C,EAAKi+D,eAAelwD,MAAO2wC,GAAWmC,uBAG5C7gD,EAGTmqE,yBAAyBnqE,GACvB,OAAK0hD,GAAkB1hD,GAIhB4hD,GAAqB7oB,KAAK8oB,OAHxBvD,MAAM6rB,yBAAyBnqE,GAM1CoqE,0BACEpqE,EACAqqE,EACAxqE,EACAyqE,GAEAD,EAAUE,MAAQ7oB,GAAkB1hD,GAChC+4B,KAAK+mC,+BACW,GACI,GAEpB/mC,KAAK6kC,kBAET7kC,KAAKqwC,UAAUiB,EAAUE,MAAOD,EHnhFJtL,GGohF5Bh/D,EAAKi5D,WAAWp1D,KAAKk1B,KAAK8+B,WAAWwS,EAAWxqE,IAIlD2qE,iCAAiCxqE,GAC/BA,EAAK2hD,WAAa,QAElB,IAAIiW,EAAO,KAMX,GALI7+B,KAAK1iB,MAAMmkC,EAAG9K,SAChBkoB,EAAO,SACE7+B,KAAK2lC,aAAa,UAC3B9G,EAAO,QAELA,EAAM,CACR,MAAMiM,EAAK9qC,KAAKopC,YAGH,SAATvK,GAAmBiM,EAAGhkE,OAAS26C,EAAGjN,MACpCxU,KAAK4hC,WAAWkJ,EAAG91D,QAInB6zC,GAAqBiiB,IACrBA,EAAGhkE,OAAS26C,EAAGpP,QACfy4B,EAAGhkE,OAAS26C,EAAGjN,QAEfxU,KAAK5iB,OACLnW,EAAK2hD,WAAaiW,GAItB,OAAOtZ,MAAMksB,iCAAiCxqE,GAIhDyqE,qBAAqBzqE,GACnB,MAAMqqE,EAAYtxC,KAAK4+B,YACjB+S,EAAqB3xC,KAAK1iB,MAAMmkC,EAAG9lB,QACnCi2C,EAAa5xC,KAAK6xC,wBAExB,IAAIC,EAAoB,KACA,eAApBF,EAAW9qE,OACW,SAApB8qE,EAAW/+I,KACbi/I,EAAoB,OACS,WAApBF,EAAW/+I,OACpBi/I,EAAoB,WAIxB,IAAIlC,GAAY,EAChB,GAAI5vC,KAAK2lC,aAAa,QAAU3lC,KAAK+xC,sBAAsB,MAAO,CAChE,MAAMC,EAAWhyC,KAAK6kC,iBAAgB,GAEd,OAAtBiN,GACC9xC,KAAK1iB,MAAMmkC,EAAG5uH,OACdmtG,KAAK8oB,MAAMhiD,KAAKmqC,SAQjBqgC,EAAUW,SAAWL,EACrBN,EAAU1oB,WAAa,KACvB0oB,EAAUE,MAAQxxC,KAAK6kC,oBAPvByM,EAAUW,SAAWD,EACrBV,EAAU1oB,WAAakpB,EACvBR,EAAUE,MAAQQ,EAASE,gBAOxB,GACiB,OAAtBJ,IACC9xC,KAAK1iB,MAAMmkC,EAAG5uH,OAASmtG,KAAK8oB,MAAMhiD,KAAKmqC,SAGxCqgC,EAAUW,SAAWjyC,KAAK6kC,iBAAgB,GAC1CyM,EAAU1oB,WAAakpB,EACnB9xC,KAAKwlC,cAAc,MACrB8L,EAAUE,MAAQxxC,KAAK6kC,mBAEvB+K,GAAY,EACZ0B,EAAUE,MAAQF,EAAUW,SAASC,eAElC,CACL,GAAIP,EAEF,MAAM3xC,KAAK0jB,MACT4tB,EAAUt8D,MACVmwC,EAAO9K,sBACPu3B,EAAWl+I,OAIfk8I,GAAY,EACZ0B,EAAUW,SAAWL,EACrBN,EAAU1oB,WAAa,KACvB0oB,EAAUE,MAAQF,EAAUW,SAASC,UAGvC,MAAMC,EAAmBxpB,GAAkB1hD,GACrCmrE,EAAwBzpB,GAAkB2oB,GAE5Ca,GAAoBC,GACtBpyC,KAAK0jB,MACH4tB,EAAUt8D,MACV2wC,GAAWmB,sCAIXqrB,GAAoBC,IACtBpyC,KAAK8nC,kBACHwJ,EAAUE,MAAM3+I,KAChBy+I,EAAUE,MAAMx8D,OACE,IAIlB46D,GAAcuC,GAAqBC,GACrCpyC,KAAKqyC,kBACHf,EAAUE,MAAM3+I,KAChBy+I,EAAUt8D,OACV,GACA,GAIJgrB,KAAKqwC,UAAUiB,EAAUE,MAAO,mBH/oFJvL,GGgpF5Bh/D,EAAKi5D,WAAWp1D,KAAKk1B,KAAK8+B,WAAWwS,EAAW,oBAGlDgB,mBACE,OAAQtyC,KAAK8oB,MAAMhiD,MACjB,KAAK26C,EAAGzL,MAEN,OAAOhW,KAAK6kC,iBAA8B,GAC5C,QACE,OAAOtf,MAAM+sB,oBAKnBC,oBAAoBtrE,EAAkBurE,GAEpC,MAAM3T,EAAO53D,EAAK43D,KACL,QAATA,GAA2B,QAATA,GAAkB7+B,KAAKojC,aAAa,OACxDn8D,EAAKi3D,eAAiBl+B,KAAKglC,qCAE7Bzf,MAAMgtB,oBAAoBtrE,EAAMurE,GAIlCC,WACElE,EACA1P,GAEAtZ,MAAMktB,WAAWlE,EAAM1P,GACnB7+B,KAAK1iB,MAAMmkC,EAAG7O,SAChB27B,EAAKtqD,GAAGihD,eAAiBllC,KAAK2mC,0BAC9B3mC,KAAKmlC,iBAAiBoJ,EAAKtqD,KAK/ByuD,kCACEzrE,EACA22B,GAEA,GAAIoC,KAAK1iB,MAAMmkC,EAAG7O,OAAQ,CACxB,MAAMi2B,EAAwB7oC,KAAK8oB,MAAMwK,mBACzCtzB,KAAK8oB,MAAMwK,oBAAqB,EAChCrsD,EAAKya,WAAase,KAAK2mC,0BACvB3mC,KAAK8oB,MAAMwK,mBAAqBuV,EAGlC,OAAOtjB,MAAMmtB,kCAAkCzrE,EAAM22B,GAIvD+0C,wBACE,OAAO3yC,KAAK1iB,MAAMmkC,EAAG7O,QAAU2S,MAAMotB,wBAavCpF,iBACEhO,EACAqT,EACA9F,GACc,IAAA+F,EACd,IAEIhS,EAFA/X,EAAQ,KAIZ,GACE9oB,KAAKk7B,UAAU,SACdl7B,KAAK1iB,MAAMmkC,EAAGkV,cAAgB32B,KAAKojC,aAAa,MACjD,CAcA,GAbAta,EAAQ9oB,KAAK8oB,MAAMuM,QAEnBwL,EAAM7gC,KAAK+sC,UACT,IACExnB,MAAMgoB,iBACJhO,EACAqT,EACA9F,IAEJhkB,IAIG+X,EAAItxD,MAAO,OAAOsxD,EAAI55D,KAK3B,MAAMuC,QAAEA,GAAYw2B,KAAK8oB,MACrBt/C,EAAQA,EAAQvE,OAAS,KAAOoxD,EAAGC,OACrC9sD,EAAQvE,QAAU,EACTuE,EAAQA,EAAQvE,OAAS,KAAOoxD,EAAGG,SAC5ChtD,EAAQvE,QAAU,GAItB,GAAO,OAAH4tE,EAAAhS,IAAAgS,EAAKtjE,OAASywB,KAAKojC,aAAa,KAAM,CAAA,IAAA0P,EAAAC,EAGxC,IAAI7U,EAFJpV,EAAQA,GAAS9oB,KAAK8oB,MAAMuM,QAI5B,MAAMpiB,EAAQjT,KAAK+sC,UAASiG,IAAS,IAAAC,EACnC/U,EAAiBl+B,KAAKglC,oCAEtB,MAAMkO,EAAkBlzC,KAAKmsC,iCAC3BjO,GACA,KACE,MAAMtzD,EAAS26C,MAAMgoB,iBACnBhO,EACAqT,EACA9F,GAKF,OAFA9sC,KAAKmzC,2BAA2BvoE,EAAQszD,GAEjCtzD,KAMgB,4BAAzBsoE,EAAgBpsE,MAAhB,OAAAmsE,EACAC,EAAgBrW,QAAhBoW,EAAuB1V,eAEvByV,IAKF,MAAMvG,EAAOzsC,KAAKozC,8BAA8BF,GAIhD,OAHAzG,EAAKvO,eAAiBA,EACtBl+B,KAAKmzC,2BAA2B1G,EAAMvO,GAE/BgV,IACNpqB,GAEH,IAAIoqB,EAGA,KAEJ,GACEjgC,EAAMhsC,MAEJ,4BADF+4B,KAAKozC,8BAA8BngC,EAAMhsC,MAAMH,KAE/C,CACA,IAAKmsC,EAAM1jC,QAAU0jC,EAAMogC,QAUzB,OARIpgC,EAAMhsC,KAAKqsE,OAEbtzC,KAAK0jB,MACHwa,EAAelpD,MACf2wC,GAAW4C,iDAIRtV,EAAMhsC,KAGfisE,EAAkBjgC,EAAMhsC,KAS1B,GAAA,OAAA6rE,EAAIjS,IAAAiS,EAAK7rE,KAGP,OADA+4B,KAAK8oB,MAAQ+X,EAAImM,UACVnM,EAAI55D,KAGb,GAAIisE,EAGF,OADAlzC,KAAK8oB,MAAQ7V,EAAM+5B,UACZkG,EAGT,GAAA,OAAAH,EAAIlS,IAAAkS,EAAKQ,OAAQ,MAAM1S,EAAItxD,MAC3B,GAAI0jC,EAAMsgC,OAAQ,MAAMtgC,EAAM1jC,MAG9B,MAAMywB,KAAK0jB,MACTwa,EAAelpD,MACf2wC,GAAW2C,mCAIf,OAAO/C,MAAMgoB,iBACXhO,EACAqT,EACA9F,GAKJ0G,WAAWvsE,GACT,GAAI+4B,KAAK1iB,MAAMmkC,EAAG7O,OAAQ,CACxB,MAAMhoC,EAASo1B,KAAK+sC,UAAS,KAC3B,MAAMlE,EAAwB7oC,KAAK8oB,MAAMwK,mBACzCtzB,KAAK8oB,MAAMwK,oBAAqB,EAEhC,MAAMwR,EAAW9kC,KAAK4+B,YActB,OAVEkG,EAASI,eAETj+D,EAAKw9D,WACHzkC,KAAKwkC,uCAETxkC,KAAK8oB,MAAMwK,mBAAqBuV,EAE5B7oC,KAAKurC,sBAAsBvrC,KAAK4hC,aAC/B5hC,KAAK1iB,MAAMmkC,EAAGxO,QAAQjT,KAAK4hC,aAEzBkD,KAGT,GAAIl6D,EAAO2oE,OAAQ,OAAO,KAGtB3oE,EAAO2E,QAAOywB,KAAK8oB,MAAQl+C,EAAOoiE,WAGtC/lE,EAAKya,WAAa9W,EAAO3D,KAAKi+D,eAC1BllC,KAAK8+B,WAAWl0D,EAAO3D,KAAM,kBAC7B,KAGN,OAAOs+C,MAAMiuB,WAAWvsE,GAG1BwsE,mBACE,OAAOzzC,KAAK1iB,MAAMmkC,EAAG7O,QAAU2S,MAAMkuB,mBAGvCC,2BACEzsE,EACAsP,IAEkE,IAA9DypB,KAAK8oB,MAAMoK,0BAA0B1nD,QAAQvE,EAAK+N,OACpD/N,EAAKsP,OAASA,EAEdgvC,MAAMmuB,2BAA2BzsE,EAAMsP,GAI3C43D,YACElnE,EACA0sE,EACAC,GAEA,IACEA,IAC8D,IAA9D5zC,KAAK8oB,MAAMoK,0BAA0B1nD,QAAQvE,EAAK+N,OAFpD,CAQA,IAAK,IAAI7N,EAAI,EAAGA,EAAIF,EAAKsP,OAAOtR,OAAQkC,IAClC64B,KAAKywC,YAAYxpE,EAAKsP,OAAOpP,KAAOA,EAAI,GAC1C64B,KAAK0jB,MAAMz8C,EAAKsP,OAAOpP,GAAG6N,MAAO2wC,GAAWiC,sBAIhD,OAAOrC,MAAM4oB,eAAe93D,YAG9Bw9D,mCAAmCC,GACjC,OAAOvuB,MAAMsuB,mCACXC,IAAkE,IAApD9zC,KAAK8oB,MAAMmK,UAAUznD,QAAQw0B,KAAK8oB,MAAM9zC,QAI1D++D,gBACE3T,EACAd,EACAzM,EACAwN,GAEA,GACgB,eAAdD,EAAKt5D,MACS,UAAds5D,EAAKvtI,OACuC,IAA5CmtG,KAAK8oB,MAAMmK,UAAUznD,QAAQ8zD,GAC7B,CACAt/B,KAAK5iB,OAEL,MAAMnW,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GACxC5rD,EAAKkP,OAASiqD,EACdn5D,EAAKoP,UAAY2pB,KAAKg0C,6BAA6BvyB,EAAG9O,QAAQ,GAC9DytB,EAAOpgC,KAAK8+B,WAAW73D,EAAM,uBACxB,GACS,eAAdm5D,EAAKt5D,MACS,UAAds5D,EAAKvtI,MACLmtG,KAAKojC,aAAa,KAClB,CACA,MAAMta,EAAQ9oB,KAAK8oB,MAAMuM,QACnBpiB,EAAQjT,KAAK+sC,UACjBiG,GACEhzC,KAAKi0C,kCAAkC3U,EAAUzM,IACjDmgB,KACFlqB,GAGF,IAAK7V,EAAM1jC,QAAU0jC,EAAMogC,QAAS,OAAOpgC,EAAMhsC,KAEjD,MAAM2D,EAASo1B,KAAK+sC,UAClB,IAAMxnB,MAAMwuB,gBAAgB3T,EAAMd,EAAUzM,EAAUwN,IACtDvX,GAGF,GAAIl+C,EAAO3D,OAAS2D,EAAO2E,MAAO,OAAO3E,EAAO3D,KAEhD,GAAIgsC,EAAMhsC,KAER,OADA+4B,KAAK8oB,MAAQ7V,EAAM+5B,UACZ/5B,EAAMhsC,KAGf,GAAI2D,EAAO3D,KAET,OADA+4B,KAAK8oB,MAAQl+C,EAAOoiE,UACbpiE,EAAO3D,KAGhB,MAAMgsC,EAAM1jC,OAAS3E,EAAO2E,MAG9B,OAAOg2C,MAAMwuB,gBAAgB3T,EAAMd,EAAUzM,EAAUwN,GAGzDF,eACEC,EACAd,EACAzM,EACAwN,EACA6T,GAEA,GAAIl0C,KAAK1iB,MAAMmkC,EAAGzO,cAAgBhT,KAAKm0C,sBAAuB,CAE5D,GADAD,EAAe5T,qBAAsB,EACjCD,EAEF,OADA6T,EAAe3T,MAAO,EACfH,EAETpgC,KAAK5iB,OACL,MAAMnW,EAAiC+4B,KAAK48B,YAC1C0C,EACAzM,GAQF,OANA5rD,EAAKkP,OAASiqD,EACdn5D,EAAKmtE,cAAgBp0C,KAAK2nC,sCAC1B3nC,KAAKuiC,OAAO9gB,EAAG/O,QAEfzrC,EAAKoP,UAAY2pB,KAAKg0C,6BAA6BvyB,EAAG9O,QAAQ,GAC9D1rC,EAAK24D,UAAW,EACT5/B,KAAK2/B,qBAAqB14D,GAAqB,GACjD,IACJo5D,GACDrgC,KAAK6jC,oBACL7jC,KAAKojC,aAAa,KAClB,CACA,MAAMn8D,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GACxC5rD,EAAKkP,OAASiqD,EAEd,MAAMx1D,EAASo1B,KAAK+sC,UAAS,KAC3B9lE,EAAKmtE,cACHp0C,KAAK8oC,+CACP9oC,KAAKuiC,OAAO9gB,EAAG/O,QACfzrC,EAAKoP,UAAY2pB,KAAKg0C,6BAA6BvyB,EAAG9O,QAAQ,GAC1DuhC,EAAe5T,sBAAqBr5D,EAAK24D,UAAW,GACjD5/B,KAAK2/B,qBACV14D,EACAitE,EAAe5T,wBAInB,GAAI11D,EAAO3D,KAET,OADI2D,EAAO2E,QAAOywB,KAAK8oB,MAAQl+C,EAAOoiE,WAC/BpiE,EAAO3D,KAIlB,OAAOs+C,MAAM4a,eACXC,EACAd,EACAzM,EACAwN,EACA6T,GAIJG,kBAAkBptE,GAChB,IAAIqtE,EAAQ,KACRt0C,KAAK6jC,oBAAsB7jC,KAAKojC,aAAa,OAC/CkR,EAAQt0C,KAAK+sC,UAAS,IACpB/sC,KAAK8oC,iDACL7hE,MAEJA,EAAKmtE,cAAgBE,EAErB/uB,MAAM8uB,kBAAkBptE,GAG1BgtE,kCACE3U,EACAzM,GAEA,MAAM5rD,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GAExC,GADA7yB,KAAKuyC,oBAAoBtrE,GACpB+4B,KAAKwzC,WAAWvsE,GACrB,OAAO+4B,KAAKu0C,qBACVttE,OACavxE,GACC,GAIlB8+I,sBAAsBn/I,GACpB,MAAM+nF,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GACpD,GACM,KAAJviF,GACI,KAAJ+nF,GACA4iB,KAAK8oB,MAAM0K,eAKX,OAHAxzB,KAAK8oB,MAAM0K,gBAAiB,EAC5BxzB,KAAK8oB,MAAMlxC,KAAO,OAClBooB,KAAKy0C,YAIPlvB,MAAMivB,sBAAsBn/I,GAG9Bq/I,mBAAmBr/I,GACjB,MAAM+nF,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAE9C,MAAJviF,GACI,MAAJ+nF,EAOFmoC,MAAMmvB,mBAAmBr/I,GAJvB2qG,KAAKyvC,SAAShuB,EAAGhP,UAAW,GAOhCkiC,cAAc7zC,EAAczV,GAC1B,MAAMupD,EAAWrvB,MAAMovB,cAAc7zC,EAAMzV,GAI3C,OAHI2U,KAAK8oB,MAAM0K,gBACbxzB,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAK+tC,GAAW+C,yBAEjCksB,EAGTC,mBACE,GAAI70C,KAAKk7B,UAAU,iBAAmBl7B,KAAK80C,kBAOzC,OANI90C,KAAK8oB,MAAM0K,gBACbxzB,KAAK4hC,WAAW,KAAMjc,GAAW0B,mBAEnCrnB,KAAK+0C,2BACL/0C,KAAK8oB,MAAMlxC,KAAOooB,KAAK80C,uBACvB90C,KAAK8oB,MAAM0K,gBAAiB,GAI9B,GAAIxzB,KAAK8oB,MAAM0K,eAAf,CACE,MAAMxuD,EAAMg7B,KAAKhR,MAAMxjB,QAAQ,MAAQw0B,KAAK8oB,MAAMlxC,KAAO,GACzD,IAAa,IAAT5S,EACF,MAAMg7B,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAM,EAAGutC,EAAO3E,qBAE9CxgB,KAAK8oB,MAAMlxC,IAAM5S,EAAM,OAIzBugD,MAAMsvB,mBAGRC,kBACE,MAAMl9D,IAAEA,GAAQooB,KAAK8oB,MACrB,IAAIksB,EAA4B,EAChC,KACE,CAAA,GAAA,GAAiCvmE,SAC/BuxB,KAAKhR,MAAM/W,WAAWL,EAAMo9D,KAG9BA,IAGF,MAAMC,EAAMj1C,KAAKhR,MAAM/W,WAAW+8D,EAA4Bp9D,GACxDs9D,EAAMl1C,KAAKhR,MAAM/W,WAAW+8D,EAA4Bp9D,EAAM,GAEpE,OAAO,KAAHq9D,GAA8B,KAAHC,EACtBF,EAA4B,EAM7B,iBAHNh1C,KAAKhR,MAAM5pB,MACT4vE,EAA4Bp9D,EAC5Bo9D,EAA4Bp9D,EAAM,IAG7Bo9D,EAA4B,GAE9B,KAAHC,GAA8B,KAAHC,GACtBF,EAKXD,2BAEE,IAAa,IADD/0C,KAAKhR,MAAMxjB,QAAQ,KAAMw0B,KAAK8oB,MAAMlxC,KAE9C,MAAMooB,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAO3E,qBAM5C20B,yCACEv9D,GACAw9D,SAAEA,EAAFC,WAAYA,IAEZr1C,KAAK0jB,MACH9rC,EACA+tC,GAAWO,gCACXmvB,EACAD,GAIJE,+BACE19D,GACAw9D,SAAEA,EAAFC,WAAYA,IAEZ,MAAM5O,EAAa4O,EAAW,GAAG3/C,cAAgB2/C,EAAWjwE,MAAM,GAClE46B,KAAK0jB,MACH9rC,EACA+tC,GAAWe,sBACX2uB,EACA5O,EACA2O,GAIJG,iCACE39D,GACAw9D,SAAEA,EAAFC,WAAYA,IAEZr1C,KAAK0jB,MAAM9rC,EAAK+tC,GAAWQ,wBAAyBkvB,EAAYD,GAGlEI,sCACE59D,GACAw9D,SAAEA,IAEFp1C,KAAK0jB,MAAM9rC,EAAK+tC,GAAWS,6BAA8BgvB,GAG3DK,iCACE79D,GACAw9D,SACEA,EADFM,aAEEA,IAGF,OAAO11C,KAAK0jB,MACV9rC,EACiB,OAAjB89D,EACI/vB,GAAWW,uCACXX,GAAWU,wBACf+uB,EACAM,GAIJC,sCACE/9D,GACAw9D,SAAEA,EAAFQ,aAAYA,EAAZP,WAA0BA,IAE1B,IAAI17D,EAAU,KACd,OAAQi8D,GACN,IAAK,UACL,IAAK,SACL,IAAK,SACHj8D,EAAUgsC,GAAWY,wCACrB,MACF,IAAK,SACH5sC,EAAUgsC,GAAWa,uCACrB,MACF,QAEE7sC,EAAUgsC,GAAWc,wCAEzB,OAAOzmB,KAAK0jB,MAAM9rC,EAAK+B,EAASy7D,EAAUC,EAAYO,GAGxDC,wCACEj+D,GACAw9D,SAAEA,EAAFC,WAAYA,IAEZr1C,KAAK0jB,MACH9rC,EACA+tC,GAAWgB,+BACXyuB,EACAC,GAIJS,mDACEl+D,GACAw9D,SAAEA,IAEFp1C,KAAK0jB,MACH9rC,EACA+tC,GAAWiB,0CACXwuB,GAIJW,qBACE,MAAMzW,EAAWt/B,KAAK8oB,MAAM9zC,MACtBghE,EAAY,IAAMh2C,KAAK1iB,MAAMmkC,EAAG75B,QAAUoY,KAAK1iB,MAAMmkC,EAAGjP,QAC9D,OAAQxS,KAAK8oB,MAAMhiD,MACjB,KAAK26C,EAAG/P,IAAK,CACX,MAAMukC,EAAUj2C,KAAKq8B,oBAAoBr8B,KAAK8oB,MAAMp1H,OACpD,OAAIsiJ,IACK,CAAElvE,KAAM,SAAU8Q,IAAKq+D,EAAQjhE,MAAOthF,MAAOuiJ,GAE/C,CAAEnvE,KAAM,UAAW8Q,IAAK0nD,GAEjC,KAAK7d,EAAG9lB,OAAQ,CACd,MAAMs6C,EAAUj2C,KAAKo8B,mBAAmBp8B,KAAK8oB,MAAMp1H,OACnD,OAAIsiJ,IACK,CAAElvE,KAAM,SAAU8Q,IAAKq+D,EAAQjhE,MAAOthF,MAAOuiJ,GAE/C,CAAEnvE,KAAM,UAAW8Q,IAAK0nD,GAEjC,KAAK7d,EAAGlL,MACR,KAAKkL,EAAGjL,OAAQ,CACd,MAAMy/B,EAAUj2C,KAAKu8B,oBAAoBv8B,KAAK1iB,MAAMmkC,EAAGlL,QACvD,OAAIy/B,IACK,CACLlvE,KAAM,UACN8Q,IAAKq+D,EAAQjhE,MACbthF,MAAOuiJ,GAGJ,CAAEnvE,KAAM,UAAW8Q,IAAK0nD,GAEjC,QACE,MAAO,CAAEx4D,KAAM,UAAW8Q,IAAK0nD,IAIrC4W,oBACE,MAAMt+D,EAAMooB,KAAK8oB,MAAM9zC,MAKvB,MAAO,CAAEiP,GAJE+b,KAAK6kC,iBAAgB,GAInB7P,KAHAh1B,KAAK8hC,IAAIrgB,EAAGlO,IACrBvT,KAAK+1C,qBACL,CAAEjvE,KAAM,OAAQ8Q,IAAAA,IAItBu+D,kCACEv+D,EACApO,EACA4sE,GAEA,MAAMR,aAAEA,GAAiBpsE,EACJ,OAAjBosE,GAGAA,IAAiBQ,GACnBp2C,KAAK21C,sCAAsC/9D,EAAKpO,GAIpD6sE,iBAAgBjB,SACdA,EADcQ,aAEdA,IAaA,MAAMU,EAAY,IAAI33D,IAChB43D,EAAU,CACdC,eAAgB,GAChBC,cAAe,GACfC,cAAe,GACfC,iBAAkB,IAEpB,IAAIC,GAAoB,EACxB,MAAQ52C,KAAK1iB,MAAMmkC,EAAGjP,SAAS,CAC7B,GAAIxS,KAAK8hC,IAAIrgB,EAAGvO,UAAW,CACzB0jC,GAAoB,EACpB,MAEF,MAAMC,EAAa72C,KAAK4+B,aAClB36C,GAAEA,EAAF+wC,KAAMA,GAASh1B,KAAKk2C,oBACpBb,EAAapxD,EAAGpxF,KACtB,GAAmB,KAAfwiJ,EACF,SAEE,SAAS5vE,KAAK4vE,IAChBr1C,KAAKs1C,+BAA+BrxD,EAAGjP,MAAO,CAC5CogE,SAAAA,EACAC,WAAAA,IAGAiB,EAAUv3D,IAAIs2D,IAChBr1C,KAAKu1C,iCAAiCtxD,EAAGjP,MAAO,CAC9CogE,SAAAA,EACAC,WAAAA,IAGJiB,EAAUt3D,IAAIq2D,GACd,MAAM7rE,EAAU,CAAE4rE,SAAAA,EAAUQ,aAAAA,EAAcP,WAAAA,GAE1C,OADAwB,EAAW5yD,GAAKA,EACR+wC,EAAKluD,MACX,IAAK,UACHk5B,KAAKm2C,kCACHnhB,EAAKp9C,IACLpO,EACA,WAEFqtE,EAAW7hB,KAAOA,EAAKthI,MACvB6iJ,EAAQC,eAAe1rE,KACrBk1B,KAAK8+B,WAAW+X,EAAY,sBAE9B,MAEF,IAAK,SACH72C,KAAKm2C,kCAAkCnhB,EAAKp9C,IAAKpO,EAAS,UAC1DqtE,EAAW7hB,KAAOA,EAAKthI,MACvB6iJ,EAAQE,cAAc3rE,KACpBk1B,KAAK8+B,WAAW+X,EAAY,qBAE9B,MAEF,IAAK,SACH72C,KAAKm2C,kCAAkCnhB,EAAKp9C,IAAKpO,EAAS,UAC1DqtE,EAAW7hB,KAAOA,EAAKthI,MACvB6iJ,EAAQG,cAAc5rE,KACpBk1B,KAAK8+B,WAAW+X,EAAY,qBAE9B,MAEF,IAAK,UACH,MAAM72C,KAAK21C,sCAAsC3gB,EAAKp9C,IAAKpO,GAE7D,IAAK,OACH,OAAQosE,GACN,IAAK,UACH51C,KAAKm1C,yCACHngB,EAAKp9C,IACLpO,GAEF,MACF,IAAK,SACHw2B,KAAK61C,wCAAwC7gB,EAAKp9C,IAAKpO,GACvD,MACF,QACE+sE,EAAQI,iBAAiB7rE,KACvBk1B,KAAK8+B,WAAW+X,EAAY,yBAMjC72C,KAAK1iB,MAAMmkC,EAAGjP,SACjBxS,KAAKuiC,OAAO9gB,EAAG75B,OAGnB,MAAO,CAAE2uD,QAAAA,EAASK,kBAAAA,GAGpBE,sBACEC,EACAJ,GACAvB,SAAEA,IAEF,GAAkC,IAA9B2B,EAAmB9xE,OACrB,OAAO0xE,EACF,GAAgC,IAA5BA,EAAiB1xE,OAC1B,OAAO8xE,EACF,GAAIJ,EAAiB1xE,OAAS8xE,EAAmB9xE,OAAQ,CAC9D,IAAK,MAAMkqE,KAAU4H,EACnB/2C,KAAK81C,mDACH3G,EAAOn6D,MACP,CAAEogE,SAAAA,IAGN,OAAOuB,EAEP,IAAK,MAAMxH,KAAUwH,EACnB32C,KAAK81C,mDACH3G,EAAOn6D,MACP,CAAEogE,SAAAA,IAGN,OAAO2B,EAIXC,2BAA0B5B,SACxBA,IAIA,GAAIp1C,KAAKwlC,cAAc,MAAO,CAC5B,IAAKxlC,KAAK1iB,MAAMmkC,EAAG5uH,MACjB,MAAMmtG,KAAKy1C,iCAAiCz1C,KAAK8oB,MAAM9zC,MAAO,CAC5DogE,SAAAA,EACAM,aAAc,OAIlB,MAAMhiJ,MAAEA,GAAUssG,KAAK8oB,MAevB,OAdA9oB,KAAK5iB,OAGO,YAAV1pF,GACU,WAAVA,GACU,WAAVA,GACU,WAAVA,GAEAssG,KAAKy1C,iCAAiCz1C,KAAK8oB,MAAM9zC,MAAO,CACtDogE,SAAAA,EACAM,aAAchiJ,IAIXA,EAET,OAAO,KAGTujJ,aAAahwE,GAAcmuE,SAAEA,EAAF8B,QAAYA,IACrC,MAAMtB,EAAe51C,KAAKg3C,0BAA0B,CAAE5B,SAAAA,IACtDp1C,KAAKuiC,OAAO9gB,EAAGpP,QACf,MAAMkkC,QAAEA,EAAFK,kBAAWA,GAAsB52C,KAAKq2C,gBAAgB,CAC1DjB,SAAAA,EACAQ,aAAAA,IAIF,OAFA3uE,EAAK2vE,kBAAoBA,EAEjBhB,GACN,IAAK,UAIH,OAHA3uE,EAAK2uE,cAAe,EACpB3uE,EAAKsvE,QAAUA,EAAQC,eACvBx2C,KAAKuiC,OAAO9gB,EAAGjP,QACRxS,KAAK8+B,WAAW73D,EAAM,mBAC/B,IAAK,SAIH,OAHAA,EAAK2uE,cAAe,EACpB3uE,EAAKsvE,QAAUA,EAAQE,cACvBz2C,KAAKuiC,OAAO9gB,EAAGjP,QACRxS,KAAK8+B,WAAW73D,EAAM,kBAC/B,IAAK,SAQH,OAPAA,EAAK2uE,cAAe,EACpB3uE,EAAKsvE,QAAUv2C,KAAK82C,sBAClBP,EAAQG,cACRH,EAAQI,iBACR,CAAEvB,SAAAA,IAEJp1C,KAAKuiC,OAAO9gB,EAAGjP,QACRxS,KAAK8+B,WAAW73D,EAAM,kBAC/B,IAAK,SAGH,OAFAA,EAAKsvE,QAAUA,EAAQI,iBACvB32C,KAAKuiC,OAAO9gB,EAAGjP,QACRxS,KAAK8+B,WAAW73D,EAAM,kBAC/B,QAAS,CAEP,MAAM4oD,EAAQ,KACZ5oD,EAAKsvE,QAAU,GACfv2C,KAAKuiC,OAAO9gB,EAAGjP,QACRxS,KAAK8+B,WAAW73D,EAAM,mBAE/BA,EAAK2uE,cAAe,EAEpB,MAAMuB,EAAWZ,EAAQC,eAAevxE,OAClCmyE,EAAUb,EAAQE,cAAcxxE,OAChCoyE,EAAUd,EAAQG,cAAczxE,OAChCqyE,EAAef,EAAQI,iBAAiB1xE,OAE9C,GAAKkyE,GAAaC,GAAYC,GAAYC,EAEnC,CAAA,GAAKH,GAAaC,EAQlB,CAAA,IAAKA,IAAYC,GAAWF,GAAYG,EAAc,CAC3D,IAAK,MAAMnI,KAAUoH,EAAQI,iBAC3B32C,KAAKm1C,yCAAyChG,EAAOn6D,MAAO,CAC1DogE,SAAAA,EACAC,WAAYlG,EAAOlrD,GAAGpxF,OAK1B,OAFAo0E,EAAKsvE,QAAUA,EAAQC,eACvBx2C,KAAKuiC,OAAO9gB,EAAGjP,QACRxS,KAAK8+B,WAAW73D,EAAM,mBACxB,IAAKkwE,IAAaE,GAAWD,GAAWE,EAAc,CAC3D,IAAK,MAAMnI,KAAUoH,EAAQI,iBAC3B32C,KAAK61C,wCAAwC1G,EAAOn6D,MAAO,CACzDogE,SAAAA,EACAC,WAAYlG,EAAOlrD,GAAGpxF,OAK1B,OAFAo0E,EAAKsvE,QAAUA,EAAQE,cACvBz2C,KAAKuiC,OAAO9gB,EAAGjP,QACRxS,KAAK8+B,WAAW73D,EAAM,kBAG7B,OADA+4B,KAAKw1C,sCAAsC0B,EAAS,CAAE9B,SAAAA,IAC/CvlB,IAvBP,OANA5oD,EAAKsvE,QAAUv2C,KAAK82C,sBAClBP,EAAQG,cACRH,EAAQI,iBACR,CAAEvB,SAAAA,IAEJp1C,KAAKuiC,OAAO9gB,EAAGjP,QACRxS,KAAK8+B,WAAW73D,EAAM,kBAR7B,OAAO4oD,MAqCf0c,yBAAyBtlE,GACvB,MAAMgd,EAAK+b,KAAK6kC,kBAMhB,OALA59D,EAAKgd,GAAKA,EACVhd,EAAKhB,KAAO+5B,KAAKi3C,aAAaj3C,KAAK4+B,YAAa,CAC9CwW,SAAUnxD,EAAGpxF,KACbqkJ,QAASjzD,EAAGjP,QAEPgrB,KAAK8+B,WAAW73D,EAAM,mBAI/BktE,sBACE,MAAM/2D,EAAO4iB,KAAKu3C,iBAClB,GAAI,KAAAv3C,KAAKhR,MAAM/W,WAAWmF,GAA8B,CACtD,MAAMo6D,EAAYx3C,KAAKhR,MAAM/W,WAAWmF,EAAO,GAC/C,OACW,KAATo6D,GAA6C,KAATA,EAGxC,OAAO,EAGTpE,8BAA8BnsE,GAC5B,MAAqB,uBAAdA,EAAKH,KAAgCG,EAAKilB,WAAajlB,IQ5+GlEwwE,WFyCc/b,GACd,cAAcA,EACZkI,kBACE,OAAO1M,GAGTwgB,iBAGE,OAAO13C,KAAK1iB,MAAMmkC,EAAG5uH,MAGvB8kJ,2BACE,OACG33C,KAAK1iB,MAAMmkC,EAAGzP,WACbhS,KAAK1iB,MAAMmkC,EAAGpP,SACdrS,KAAK1iB,MAAMmkC,EAAGjN,OACdxU,KAAK1iB,MAAMmkC,EAAGvO,WACdlT,KAAK1iB,MAAMmkC,EAAG3P,cACd9R,KAAK43C,2BACN53C,KAAK63C,wBAIVC,+BAME,OADA93C,KAAK5iB,OACE4iB,KAAK23C,2BAIdI,gBAA+BC,GAC7B,IAAKh4C,KAAK1iB,MAAMmkC,EAAG5uH,MACjB,OAGF,MAAMy7E,EAAW0xB,KAAK8oB,MAAMp1H,MAC5B,OAC0C,IAAxCskJ,EAAiBxsE,QAAQ8C,IACzB0xB,KAAKi4C,WAAWj4C,KAAK83C,6BAA6Bn/C,KAAKqH,OAEhD1xB,OAJT,EAcF4pE,iBACEC,EAIAH,EACAI,EACAC,GAEA,MAAMC,EAAe,CAAC1gE,EAAKtJ,EAAUiqE,EAAQC,KACvClqE,IAAaiqE,GAAUJ,EAASK,IAClCx4C,KAAK0jB,MAAM9rC,EAAKkgD,GAASwB,sBAAuBif,EAAQC,IAGtDC,EAAe,CAAC7gE,EAAKtJ,EAAUoqE,EAAMC,MAEtCR,EAASO,IAASpqE,IAAaqqE,GAC/BR,EAASQ,IAASrqE,IAAaoqE,IAEhC14C,KAAK0jB,MAAM9rC,EAAKkgD,GAASiB,sBAAuB2f,EAAMC,IAI1D,OAAS,CACP,MAAMrZ,EAAWt/B,KAAK8oB,MAAM9zC,MACtB1G,EAAwB0xB,KAAK+3C,gBACjCC,EAAiBnmD,OAAjB,MAAwBumD,EAAAA,EAAuB,KAGjD,IAAK9pE,EAAU,MAEXwsD,GAAmBxsD,GACjB6pE,EAASS,cACX54C,KAAK0jB,MAAM4b,EAAUxH,GAASU,iCAE9B8f,EAAahZ,EAAUhxD,EAAUA,EAAU,YAC3CgqE,EAAahZ,EAAUhxD,EAAUA,EAAU,UAE3C6pE,EAASS,cAAgBtqE,IAGvB96E,OAAOgnG,eAAeoD,KAAKu6C,EAAU7pE,GACvC0xB,KAAK0jB,MAAM4b,EAAUxH,GAASW,kBAAmBnqD,IAEjDgqE,EAAahZ,EAAUhxD,EAAU,SAAU,YAC3CgqE,EAAahZ,EAAUhxD,EAAU,SAAU,YAC3CgqE,EAAahZ,EAAUhxD,EAAU,WAAY,YAC7CgqE,EAAahZ,EAAUhxD,EAAU,WAAY,YAE7CmqE,EAAanZ,EAAUhxD,EAAU,UAAW,YAC5CmqE,EAAanZ,EAAUhxD,EAAU,SAAU,aAE7C6pE,EAAS7pE,IAAY,GAGvB,MAAI8pE,GAAAA,EAAqB3pE,SAASH,IAChC0xB,KAAK0jB,MACH4b,EAEA+Y,EACA/pE,IAMRuqE,mBAAmBha,GACjB,OAAQA,GACN,IAAK,cACL,IAAK,cACH,OAAO7+B,KAAK1iB,MAAMmkC,EAAGjP,QACvB,IAAK,wBACH,OAAOxS,KAAK1iB,MAAMmkC,EAAGpP,QACvB,IAAK,oBACH,OAAOrS,KAAK1iB,MAAMmkC,EAAGtP,UACvB,IAAK,4BACH,OAAOnS,KAAKojC,aAAa,KAG7B,MAAM,IAAItqC,MAAM,eAGlBggD,YAAuBja,EAAsBliD,GAC3C,MAAM/R,EAAc,GACpB,MAAQo1B,KAAK64C,mBAAmBha,IAE9Bj0D,EAAOE,KAAK6R,KAEd,OAAO/R,EAGTmuE,qBACEla,EACAliD,GAEA,OAAOk7C,GACL73B,KAAKg5C,2BACHna,EACAliD,GACoB,IAS1Bq8D,2BACEna,EACAliD,EACAs8D,GAEA,MAAMruE,EAAS,GAEf,MACMo1B,KAAK64C,mBAAmBha,IADrB,CAKP,MAAMhhD,EAAUlB,IAChB,GAAe,MAAXkB,EACF,OAIF,GAFAjT,EAAOE,KAAK+S,IAERmiB,KAAK8hC,IAAIrgB,EAAG75B,OAAhB,CAIA,GAAIoY,KAAK64C,mBAAmBha,GAC1B,MAOF,YAJIoa,GAEFj5C,KAAKuiC,OAAO9gB,EAAG75B,SAKnB,OAAOhd,EAGTsuE,qBACEra,EACAliD,EACAw8D,EACAC,GAEKA,IACCD,EACFn5C,KAAKuiC,OAAO9gB,EAAGzP,UAEfhS,KAAK4oC,iBAAiB,MAI1B,MAAMh+D,EAASo1B,KAAK+4C,qBAAqBla,EAAMliD,GAQ/C,OANIw8D,EACFn5C,KAAKuiC,OAAO9gB,EAAGtP,UAEfnS,KAAK4oC,iBAAiB,KAGjBh+D,EAGTyuE,oBACE,MAAMpyE,EAAuB+4B,KAAK4+B,YAiBlC,OAhBA5+B,KAAKuiC,OAAO9gB,EAAGpL,SACfrW,KAAKuiC,OAAO9gB,EAAG/O,QACV1S,KAAK1iB,MAAMmkC,EAAG9lB,SACjBqE,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAO8iD,GAAS6C,+BAIxC1zD,EAAKijB,SAAW8V,KAAKmiC,gBACrBniC,KAAKuiC,OAAO9gB,EAAG9O,QAEX3S,KAAK8hC,IAAIrgB,EAAG3O,OACd7rC,EAAKqyE,UAAYt5C,KAAKu5C,mBAA2C,IAE/Dv5C,KAAKojC,aAAa,OACpBn8D,EAAKi3D,eAAiBl+B,KAAKw5C,wBAEtBx5C,KAAK8+B,WAAW73D,EAAM,gBAG/BsyE,kBAAkBE,GAChB,IAAIjY,EAAyBxhC,KAAK6kC,kBAClC,KAAO7kC,KAAK8hC,IAAIrgB,EAAG3O,MAAM,CACvB,MAAM7rC,EAA0B+4B,KAAKygC,gBAAgBe,GACrDv6D,EAAKiiB,KAAOs4C,EACZv6D,EAAKkiB,MAAQ6W,KAAK6kC,gBAAgB4U,GAClCjY,EAASxhC,KAAK8+B,WAAW73D,EAAM,mBAEjC,OAAOu6D,EAGTkY,uBACE,MAAMzyE,EAA0B+4B,KAAK4+B,YAKrC,OAJA33D,EAAK0yE,SAAW35C,KAAKu5C,mBAA2C,IAC3Dv5C,KAAK63C,yBAA2B73C,KAAKojC,aAAa,OACrDn8D,EAAKi3D,eAAiBl+B,KAAKw5C,wBAEtBx5C,KAAK8+B,WAAW73D,EAAM,mBAG/B2yE,yBAAyBC,GACvB75C,KAAK5iB,OACL,MAAMnW,EAA0B+4B,KAAKygC,gBAAgBoZ,GAIrD,OAHA5yE,EAAK6yE,cAAgBD,EACrB5yE,EAAKi+D,eAAiBllC,KAAK+5C,uBAAqC,GAChE9yE,EAAK+yE,SAAU,EACRh6C,KAAK8+B,WAAW73D,EAAM,mBAG/BgzE,sBACE,MAAMhzE,EAAqB+4B,KAAK4+B,YAEhC,OADA5+B,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAM,cAG/BizE,mBACE,MAAMjzE,EAAsB+4B,KAAK4+B,YAOjC,OANA5+B,KAAKuiC,OAAO9gB,EAAG9K,SACX3W,KAAK1iB,MAAMmkC,EAAGpL,SAChBpvC,EAAKkzE,SAAWn6C,KAAKq5C,oBAErBpyE,EAAKkzE,SAAWn6C,KAAKu5C,mBAA2C,GAE3Dv5C,KAAK8+B,WAAW73D,EAAM,eAG/BmzE,uBACE,MAAMnzE,EAA0B+4B,KAAK4+B,YAIrC,OAHA33D,EAAKp0E,KAAOmtG,KAAKq6C,oBAAoBpzE,EAAK+N,OAC1C/N,EAAKqzE,WAAat6C,KAAKu6C,mBAAmB94B,EAAGtL,UAC7ClvC,EAAK9zE,QAAU6sG,KAAKu6C,mBAAmB94B,EAAGlO,IACnCvT,KAAK8+B,WAAW73D,EAAM,mBAG/BuzE,2BACE,GAAIx6C,KAAKojC,aAAa,KACpB,OAAOpjC,KAAKy6C,wBAIhBA,wBACE,MAAMxzE,EAAqC+4B,KAAK4+B,YAiBhD,OAfI5+B,KAAKojC,aAAa,MAAQpjC,KAAK1iB,MAAMmkC,EAAGkV,aAC1C32B,KAAK5iB,OAEL4iB,KAAK4hC,aAGP36D,EAAKsP,OAASypB,KAAKk5C,qBACjB,4BACAl5C,KAAKo6C,qBAAqBzhD,KAAKqH,OACjB,GACO,GAEI,IAAvB/4B,EAAKsP,OAAOtR,QACd+6B,KAAK0jB,MAAMz8C,EAAK+N,MAAO8iD,GAASc,qBAE3B54B,KAAK8+B,WAAW73D,EAAM,8BAG/ByzE,gCACE,OAAI16C,KAAKopC,YAAYtiE,OAAS26C,EAAG7L,QAC/B5V,KAAK5iB,OACE4iB,KAAK05C,wBAEP,KAKTiB,gBACEC,EACA3zD,GAGA,MAAM4zD,EAAsBD,IAAgBn5B,EAAGxO,MAC/ChsB,EAAUi3C,eAAiBl+B,KAAKw6C,2BAChCx6C,KAAKuiC,OAAO9gB,EAAG/O,QACfzrB,EAAU6zD,WAAa96C,KAAK+6C,kCACxBF,GAGO76C,KAAK1iB,MAAMs9D,MAFpB3zD,EAAUi+C,eACRllC,KAAKg7C,qCAAqCJ,IAOhDG,iCAGE,OAAO/6C,KAAKi7C,iBAAiBx5B,EAAG9O,OAAzB,IAA6DvoC,KAClE6U,IAEqB,eAAjBA,EAAQnY,MACS,gBAAjBmY,EAAQnY,MACS,kBAAjBmY,EAAQnY,MACS,iBAAjBmY,EAAQnY,MAERk5B,KAAK0jB,MACHzkC,EAAQjK,MACR8iD,GAAS+C,kCACT57C,EAAQnY,MAGJmY,KAKdi8D,6BACOl7C,KAAK8hC,IAAIrgB,EAAG75B,QAAWoY,KAAKm7C,oBAC/Bn7C,KAAKuiC,OAAO9gB,EAAG37C,MAInBs1E,uBACEvc,EACA53D,GAIA,OAFA+4B,KAAK26C,gBAAgBl5B,EAAG7O,MAAO3rC,GAC/B+4B,KAAKk7C,6BACEl7C,KAAK8+B,WAAW73D,EAAM43D,GAG/Bwc,kCAEE,OADAr7C,KAAK5iB,OACE4iB,KAAK8hC,IAAIrgB,EAAG5uH,OAASmtG,KAAK1iB,MAAMmkC,EAAG7O,OAG5C0oC,yBAAyBr0E,GACvB,IAEI+4B,KAAK1iB,MAAMmkC,EAAGzP,YACdhS,KAAKu7C,YAAYv7C,KAAKq7C,gCAAgC1iD,KAAKqH,OAG7D,OAGFA,KAAKuiC,OAAO9gB,EAAGzP,UACf,MAAM/tB,EAAK+b,KAAK6kC,kBAChB5gD,EAAGihD,eAAiBllC,KAAK+5C,wBACzB/5C,KAAKmlC,iBAAiBlhD,GAEtB+b,KAAKuiC,OAAO9gB,EAAGtP,UACflrC,EAAK6zE,WAAa,CAAC72D,GAEnB,MAAMnd,EAAOk5B,KAAKw7C,2BAGlB,OAFI10E,IAAMG,EAAKi+D,eAAiBp+D,GAChCk5B,KAAKk7C,6BACEl7C,KAAK8+B,WAAW73D,EAAM,oBAG/Bw0E,iCACEx0E,EACAy0E,GAEI17C,KAAK8hC,IAAIrgB,EAAG1O,YAAW9rC,EAAK24D,UAAW,GAC3C,MAAM+b,EAAe10E,EAErB,GAAI+4B,KAAK1iB,MAAMmkC,EAAG/O,SAAW1S,KAAKojC,aAAa,KAAM,CAC/CsY,GACF17C,KAAK0jB,MAAMz8C,EAAK+N,MAAO8iD,GAASkC,4BAElC,MAAMoD,EAA8Bue,EAMpC,GALIve,EAAOyB,MAAQ7+B,KAAKojC,aAAa,MACnCpjC,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKkgD,GAASG,iCAEtCj4B,KAAK26C,gBAAgBl5B,EAAG7O,MAAOwqB,GAC/Bp9B,KAAKk7C,6BACe,QAAhB9d,EAAOyB,KACLzB,EAAO0d,WAAW71E,OAAS,IAC7B+6B,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAO9M,gBAC9BrY,KAAKywC,YAAYrT,EAAO0d,WAAW,KACrC96C,KAAK0jB,MACH1jB,KAAK8oB,MAAMlxC,IACXkgD,GAASE,yCAIV,GAAoB,QAAhBoF,EAAOyB,KAAgB,CAChC,GAAiC,IAA7BzB,EAAO0d,WAAW71E,OACpB+6B,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAO7M,oBAC7B,CACL,MAAMsjC,EAAiBxe,EAAO0d,WAAW,GACrC96C,KAAKywC,YAAYmL,IACnB57C,KAAK0jB,MACH1jB,KAAK8oB,MAAMlxC,IACXkgD,GAASE,mCAIa,eAAxB4jB,EAAe90E,MACf80E,EAAehc,UAEf5/B,KAAK0jB,MACH1jB,KAAK8oB,MAAMlxC,IACXkgD,GAASmC,uCAGe,gBAAxB2hB,EAAe90E,MACjBk5B,KAAK0jB,MACH1jB,KAAK8oB,MAAMlxC,IACXkgD,GAASoC,mCAIXkD,EAAO8H,gBACTllC,KAAK0jB,MACH0Z,EAAO8H,eAAelwD,MACtB8iD,GAASqC,qCAIbiD,EAAOyB,KAAO,SAEhB,OAAO7+B,KAAK8+B,WAAW1B,EAAQ,qBAC1B,CACL,MAAMzxC,EAAkCgwD,EACpCD,IAAU/vD,EAAS+vD,UAAW,GAClC,MAAM50E,EAAOk5B,KAAKw7C,2BAGlB,OAFI10E,IAAM6kB,EAASu5C,eAAiBp+D,GACpCk5B,KAAKk7C,6BACEl7C,KAAK8+B,WAAWnzC,EAAU,wBAIrCkwD,oBACE,MAAM50E,EAAY+4B,KAAK4+B,YAEvB,GAAI5+B,KAAK1iB,MAAMmkC,EAAG/O,SAAW1S,KAAKojC,aAAa,KAC7C,OAAOpjC,KAAKo7C,uBAAuB,6BAA8Bn0E,GAGnE,GAAI+4B,KAAK1iB,MAAMmkC,EAAG1L,MAAO,CACvB,MAAM9xB,EAAmB+b,KAAK4+B,YAE9B,OADA5+B,KAAK5iB,OACD4iB,KAAK1iB,MAAMmkC,EAAG/O,SAAW1S,KAAKojC,aAAa,KACtCpjC,KAAKo7C,uBACV,kCACAn0E,IAGFA,EAAKjyE,IAAMgrG,KAAKorC,iBAAiBnnD,EAAI,OAC9B+b,KAAKy7C,iCAAiCx0E,GAAM,IAIvD+4B,KAAKk4C,iBACHjxE,EACA,CAAC,YACD,CACE,UACA,WACA,UACA,YACA,SACA,SACA,YAEF6wD,GAASuB,6BAGX,MAAMlxB,EAAMnI,KAAKs7C,yBAAyBr0E,GAC1C,OAAIkhC,IAIJnI,KAAK+wC,kBAAkB9pE,GAAiC,GAErDA,EAAK2kB,UACY,eAAlB3kB,EAAKjyE,IAAI8xE,MACU,QAAlBG,EAAKjyE,IAAInC,MAAoC,QAAlBo0E,EAAKjyE,IAAInC,OACrCmtG,KAAK23C,6BAEL1wE,EAAK43D,KAAO53D,EAAKjyE,IAAInC,KACrBmtG,KAAK+wC,kBAAkB9pE,GAAiC,IAEnD+4B,KAAKy7C,iCAAiCx0E,IAAQA,EAAKy0E,WAG5DI,qBACE,MAAM70E,EAAwB+4B,KAAK4+B,YAEnC,OADA33D,EAAKsvE,QAAUv2C,KAAK+7C,2BACb/7C,KAAK8+B,WAAW73D,EAAM,iBAG/B80E,2BACE/7C,KAAKuiC,OAAO9gB,EAAGpP,QACf,MAAMkkC,EAAUv2C,KAAK84C,YACnB,cACA94C,KAAK67C,kBAAkBljD,KAAKqH,OAG9B,OADAA,KAAKuiC,OAAO9gB,EAAGjP,QACR+jC,EAGTyF,wBAEE,OADAh8C,KAAK5iB,OACD4iB,KAAK8hC,IAAIrgB,EAAGnN,SACPtU,KAAK2lC,aAAa,aAEvB3lC,KAAK2lC,aAAa,aACpB3lC,KAAK5iB,SAEF4iB,KAAK1iB,MAAMmkC,EAAGzP,YAGnBhS,KAAK5iB,SACA4iB,KAAK03C,mBAGV13C,KAAK5iB,OACE4iB,KAAK1iB,MAAMmkC,EAAGhL,QAGvBwlC,6BACE,MAAMh1E,EAA0B+4B,KAAK4+B,YAGrC,OAFA33D,EAAKp0E,KAAOmtG,KAAKq6C,oBAAoBpzE,EAAK+N,OAC1C/N,EAAKqzE,WAAat6C,KAAKk8C,sBAAsBz6B,EAAGhL,KACzCzW,KAAK8+B,WAAW73D,EAAM,mBAG/Bk1E,oBACE,MAAMl1E,EAAuB+4B,KAAK4+B,YA8BlC,OA5BA5+B,KAAKuiC,OAAO9gB,EAAGpP,QAEXrS,KAAK1iB,MAAMmkC,EAAGnN,UAChBrtC,EAAKy0E,SAAW17C,KAAK8oB,MAAMp1H,MAC3BssG,KAAK5iB,OACL4iB,KAAKukC,iBAAiB,aACbvkC,KAAKwlC,cAAc,cAC5Bv+D,EAAKy0E,UAAW,GAGlB17C,KAAKuiC,OAAO9gB,EAAGzP,UACf/qC,EAAK0hE,cAAgB3oC,KAAKi8C,6BAC1Bh1E,EAAKm1E,SAAWp8C,KAAKwlC,cAAc,MAAQxlC,KAAKq8C,cAAgB,KAEhEr8C,KAAKuiC,OAAO9gB,EAAGtP,UAEXnS,KAAK1iB,MAAMmkC,EAAGnN,UAChBrtC,EAAK24D,SAAW5/B,KAAK8oB,MAAMp1H,MAC3BssG,KAAK5iB,OACL4iB,KAAKuiC,OAAO9gB,EAAG1O,WACN/S,KAAK8hC,IAAIrgB,EAAG1O,YACrB9rC,EAAK24D,UAAW,GAGlB34D,EAAKi+D,eAAiBllC,KAAKs8C,iBAC3Bt8C,KAAKolC,YACLplC,KAAKuiC,OAAO9gB,EAAGjP,QAERxS,KAAK8+B,WAAW73D,EAAM,gBAG/Bs1E,mBACE,MAAMt1E,EAAsB+4B,KAAK4+B,YACjC33D,EAAKu1E,aAAex8C,KAAKk5C,qBACvB,oBACAl5C,KAAKy8C,wBAAwB9jD,KAAKqH,OACpB,GACO,GAKvB,IAAI08C,GAAsB,EACtBC,EAAkB,KAoCtB,OAnCA11E,EAAKu1E,aAAapoJ,SAAQwoJ,IAAe,IAAAC,EACvC,IAAI/1E,KAAEA,GAAS81E,GAGbF,GACS,eAAT51E,GACS,mBAATA,GACW,uBAATA,GAAiC81E,EAAYhd,UAE/C5/B,KAAK0jB,MAAMk5B,EAAY5nE,MAAO8iD,GAAS6B,4BAIzC+iB,EACEA,GACU,uBAAT51E,GAAiC81E,EAAYhd,UACrC,mBAAT94D,EAGW,eAATA,IAEFA,GADA81E,EAAcA,EAAY1X,gBACPp+D,MAGrB,MAAMg2E,EAAqB,uBAATh2E,EAElB61E,EAAe,OAAAE,EAAGF,GAAHE,EAAsBC,EACjCH,IAAoBG,GACtB98C,KAAK0jB,MACHk5B,EAAY5nE,MACZ8iD,GAAS0B,qCAKRx5B,KAAK8+B,WAAW73D,EAAM,eAG/Bw1E,0BAGE,MAAQznE,MAAOsqD,EAATzM,SAAmBA,GAAa7yB,KAAK8oB,MAErClkB,EAAO5E,KAAK8hC,IAAIrgB,EAAGvO,UACzB,IAAIpsC,EAAOk5B,KAAKq8C,cAChB,MAAMzc,EAAW5/B,KAAK8hC,IAAIrgB,EAAG1O,UAG7B,GAFgB/S,KAAK8hC,IAAIrgB,EAAG7O,OAEf,CACX,MAAMmqC,EAAoC/8C,KAAKygC,gBAAgB35D,GAC/Di2E,EAAYnd,SAAWA,EAGP,oBAAd94D,EAAKA,MACJA,EAAKo3D,gBACiB,eAAvBp3D,EAAK6yE,SAAS7yE,MAIdk5B,KAAK0jB,MAAM58C,EAAKkO,MAAO8iD,GAASyB,yBAIhCwjB,EAAYhsC,MAAQjqC,GANpBi2E,EAAYhsC,MAASjqC,EAAK6yE,SAS5BoD,EAAYvR,YAAcxrC,KAAKq8C,cAC/Bv1E,EAAOk5B,KAAK8+B,WAAWie,EAAa,2BAC/B,GAAInd,EAAU,CACnB,MAAMod,EAAqCh9C,KAAKygC,gBAAgB35D,GAChEk2E,EAAiB9X,eAAiBp+D,EAClCA,EAAOk5B,KAAK8+B,WAAWke,EAAkB,kBAG3C,GAAIp4C,EAAM,CACR,MAAMq4C,EAAyBj9C,KAAK48B,YAAY0C,EAAUzM,GAC1DoqB,EAAS/X,eAAiBp+D,EAC1BA,EAAOk5B,KAAK8+B,WAAWme,EAAU,cAGnC,OAAOn2E,EAGTo2E,2BACE,MAAMj2E,EAAO+4B,KAAK4+B,YAIlB,OAHA5+B,KAAKuiC,OAAO9gB,EAAG/O,QACfzrC,EAAKi+D,eAAiBllC,KAAKq8C,cAC3Br8C,KAAKuiC,OAAO9gB,EAAG9O,QACR3S,KAAK8+B,WAAW73D,EAAM,uBAG/Bk2E,iCACEr2E,EACAs2E,GAEA,MAAMn2E,EAAsC+4B,KAAK4+B,YAQjD,MAPa,sBAAT93D,IAEFG,EAAKm2E,WAAaA,EACdA,GAAUp9C,KAAK5iB,OACnB4iB,KAAK5iB,QAEP4iB,KAAK26C,gBAAgBl5B,EAAGxO,MAAOhsC,GACxB+4B,KAAK8+B,WAAW73D,EAAMH,GAG/Bu2E,yBACE,MAAMp2E,EAAwB+4B,KAAK4+B,YAcnC,OAbA33D,EAAKgvE,QAAU,MACb,OAAQj2C,KAAK8oB,MAAMhiD,MACjB,KAAK26C,EAAG/P,IACR,KAAK+P,EAAG9P,OACR,KAAK8P,EAAG9lB,OACR,KAAK8lB,EAAGlL,MACR,KAAKkL,EAAGjL,OAEN,OAAOxW,KAAKmiC,gBACd,QACE,MAAMniC,KAAK4hC,eAVF,GAaR5hC,KAAK8+B,WAAW73D,EAAM,iBAG/Bq2E,6BACE,MAAMr2E,EAAwB+4B,KAAK4+B,YAEnC,OADA33D,EAAKgvE,QAAUj2C,KAAKu9C,eAAc,GAC3Bv9C,KAAK8+B,WAAW73D,EAAM,iBAG/Bu2E,4BACE,OAAIx9C,KAAK8oB,MAAMuK,OAAerzB,KAAKq8C,cAC5B92B,MAAMi4B,4BAGfC,qCACE,MAAMC,EAAc19C,KAAKi6C,sBACzB,OAAIj6C,KAAK2lC,aAAa,QAAU3lC,KAAK63C,wBAC5B73C,KAAK45C,yBAAyB8D,GAE9BA,EAIXC,sBACE,OAAQ39C,KAAK8oB,MAAMhiD,MACjB,KAAK26C,EAAG5uH,KACR,KAAK4uH,EAAG7K,MACR,KAAK6K,EAAGnL,MAAO,CACb,MAAMxvC,EAAOk5B,KAAK1iB,MAAMmkC,EAAG7K,OACvB,gBACA5W,KAAK1iB,MAAMmkC,EAAGnL,OACd,gBAvzBd,SACE5iH,GAEA,OAAQA,GACN,IAAK,MACH,MAAO,eACT,IAAK,UACH,MAAO,mBACT,IAAK,SACH,MAAO,kBACT,IAAK,QACH,MAAO,iBACT,IAAK,SACH,MAAO,kBACT,IAAK,SACH,MAAO,kBACT,IAAK,SACH,MAAO,kBACT,IAAK,SACH,MAAO,kBACT,IAAK,YACH,MAAO,qBACT,IAAK,UACH,MAAO,mBACT,QACE,QA+xBQkqJ,CAAoB59C,KAAK8oB,MAAMp1H,OACnC,QACWgC,IAAToxE,GACA,KAAAk5B,KAAK69C,oBACL,CACA,MAAM52E,EAAwB+4B,KAAK4+B,YAEnC,OADA5+B,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAMH,GAE/B,OAAOk5B,KAAK05C,uBAEd,KAAKj4B,EAAG9lB,OACR,KAAK8lB,EAAG/P,IACR,KAAK+P,EAAG9P,OACR,KAAK8P,EAAGlL,MACR,KAAKkL,EAAGjL,OACN,OAAOxW,KAAKq9C,yBACd,KAAK57B,EAAGnN,QACN,GAAyB,MAArBtU,KAAK8oB,MAAMp1H,MAAe,CAC5B,MAAMuzE,EAAwB+4B,KAAK4+B,YAC7B6V,EAAYz0C,KAAKopC,YACvB,GAAIqL,EAAU3tE,OAAS26C,EAAG/P,KAAO+iC,EAAU3tE,OAAS26C,EAAG9P,OACrD,MAAM3R,KAAK4hC,aAGb,OADA36D,EAAKgvE,QAAUj2C,KAAK89C,kBACb99C,KAAK8+B,WAAW73D,EAAM,iBAE/B,MACF,KAAKw6C,EAAGzL,MACN,OAAOhW,KAAKy9C,qCACd,KAAKh8B,EAAG9K,QACN,OAAO3W,KAAKk6C,mBACd,KAAKz4B,EAAGpL,QACN,OAAOrW,KAAKq5C,oBACd,KAAK53B,EAAGpP,OACN,OAAOrS,KAAKu7C,YAAYv7C,KAAKg8C,sBAAsBrjD,KAAKqH,OACpDA,KAAKm8C,oBACLn8C,KAAK87C,qBACX,KAAKr6B,EAAGzP,SACN,OAAOhS,KAAKu8C,mBACd,KAAK96B,EAAG/O,OAaN,OAAO1S,KAAKk9C,2BACd,KAAKz7B,EAAGtO,UACN,OAAOnT,KAAKs9C,6BAGhB,MAAMt9C,KAAK4hC,aAGbmc,2BACE,IAAIj3E,EAAOk5B,KAAK29C,sBAChB,MAAQ39C,KAAK63C,yBAA2B73C,KAAK8hC,IAAIrgB,EAAGzP,WAClD,GAAIhS,KAAK1iB,MAAMmkC,EAAGtP,UAAW,CAC3B,MAAMlrC,EAAsB+4B,KAAKygC,gBAAgB35D,GACjDG,EAAKukE,YAAc1kE,EACnBk5B,KAAKuiC,OAAO9gB,EAAGtP,UACfrrC,EAAOk5B,KAAK8+B,WAAW73D,EAAM,mBACxB,CACL,MAAMA,EAA8B+4B,KAAKygC,gBAAgB35D,GACzDG,EAAKwkE,WAAa3kE,EAClBG,EAAKykE,UAAY1rC,KAAKq8C,cACtBr8C,KAAKuiC,OAAO9gB,EAAGtP,UACfrrC,EAAOk5B,KAAK8+B,WAAW73D,EAAM,uBAGjC,OAAOH,EAGTk3E,oBACEzzD,GAEA,MAAMtjB,EAAyB+4B,KAAK4+B,YASpC,OARA5+B,KAAKukC,iBAAiBh6C,GACtBtjB,EAAKsjB,SAAWA,EAChBtjB,EAAKi+D,eAAiBllC,KAAKi+C,8BAEV,aAAb1zD,GACFyV,KAAKk+C,iCAAiCj3E,GAGjC+4B,KAAK8+B,WAAW73D,EAAM,kBAG/Bi3E,iCAAiCj3E,GAC/B,OAAQA,EAAKi+D,eAAep+D,MAC1B,IAAK,cACL,IAAK,cACH,OACF,QACEk5B,KAAK0jB,MAAMz8C,EAAK+N,MAAO8iD,GAAS0C,qBAItC2jB,mBACE,MAAMl3E,EAAO+4B,KAAK4+B,YAClB5+B,KAAKukC,iBAAiB,SACtB,MAAMoE,EAAgB3oC,KAAK4+B,YAG3B,OAFA+J,EAAc91I,KAAOmtG,KAAKq6C,oBAAoB1R,EAAc3zD,OAC5D/N,EAAK0hE,cAAgB3oC,KAAK8+B,WAAW6J,EAAe,mBAC7C3oC,KAAK8+B,WAAW73D,EAAM,eAG/Bg3E,8BACE,MAAM1zD,EAAW,CAAC,QAAS,SAAU,YAAYpM,MAAKigE,GACpDp+C,KAAK2lC,aAAayY,KAEpB,OAAO7zD,EACHyV,KAAKg+C,oBAAoBzzD,GACzByV,KAAK2lC,aAAa,SAClB3lC,KAAKm+C,mBACLn+C,KAAK+9C,2BAGXM,+BACExf,EACAyf,EACA/zD,GAEA,MAAMtjB,EAA6C+4B,KAAK4+B,YAClD2f,EAAqBv+C,KAAK8hC,IAAIv3C,GAC9BknB,EAAQ,GACd,GACEA,EAAM3mC,KAAKwzE,WACJt+C,KAAK8hC,IAAIv3C,IAClB,OAAqB,IAAjBknB,EAAMxsC,QAAiBs5E,GAG3Bt3E,EAAKwqC,MAAQA,EACNzR,KAAK8+B,WAAW73D,EAAM43D,IAHpBptB,EAAM,GAMjB+sC,kCACE,OAAOx+C,KAAKq+C,+BACV,qBACAr+C,KAAKi+C,4BAA4BtlD,KAAKqH,MACtCyhB,EAAGvN,YAIPuqC,2BACE,OAAOz+C,KAAKq+C,+BACV,cACAr+C,KAAKw+C,gCAAgC7lD,KAAKqH,MAC1CyhB,EAAGzN,WAIP0qC,0BACE,QAAI1+C,KAAKojC,aAAa,MAIpBpjC,KAAK1iB,MAAMmkC,EAAG/O,SACd1S,KAAKu7C,YAAYv7C,KAAK2+C,qCAAqChmD,KAAKqH,OAIpE4+C,uBACE,GAAI5+C,KAAK1iB,MAAMmkC,EAAG5uH,OAASmtG,KAAK1iB,MAAMmkC,EAAGzL,OAEvC,OADAhW,KAAK5iB,QACE,EAGT,GAAI4iB,KAAK1iB,MAAMmkC,EAAGpP,QAAS,CACzB,IAAIwsC,EAAoB,EAGxB,IAFA7+C,KAAK5iB,OAEEyhE,EAAoB,GACrB7+C,KAAK1iB,MAAMmkC,EAAGpP,UACdwsC,EACO7+C,KAAK1iB,MAAMmkC,EAAGjP,WACrBqsC,EAEJ7+C,KAAK5iB,OAEP,OAAO,EAGT,GAAI4iB,KAAK1iB,MAAMmkC,EAAGzP,UAAW,CAC3B,IAAI6sC,EAAoB,EAGxB,IAFA7+C,KAAK5iB,OAEEyhE,EAAoB,GACrB7+C,KAAK1iB,MAAMmkC,EAAGzP,YACd6sC,EACO7+C,KAAK1iB,MAAMmkC,EAAGtP,aACrB0sC,EAEJ7+C,KAAK5iB,OAEP,OAAO,EAGT,OAAO,EAGTuhE,uCAEE,GADA3+C,KAAK5iB,OACD4iB,KAAK1iB,MAAMmkC,EAAG9O,SAAW3S,KAAK1iB,MAAMmkC,EAAGvO,UAGzC,OAAO,EAET,GAAIlT,KAAK4+C,uBAAwB,CAC/B,GACE5+C,KAAK1iB,MAAMmkC,EAAG7O,QACd5S,KAAK1iB,MAAMmkC,EAAG75B,QACdoY,KAAK1iB,MAAMmkC,EAAG1O,WACd/S,KAAK1iB,MAAMmkC,EAAGlO,IAMd,OAAO,EAET,GAAIvT,KAAK1iB,MAAMmkC,EAAG9O,UAChB3S,KAAK5iB,OACD4iB,KAAK1iB,MAAMmkC,EAAGxO,QAEhB,OAAO,EAIb,OAAO,EAGT+nC,qCACEJ,GAEA,OAAO56C,KAAK8+C,UAAS,KACnB,MAAMC,EAAwB/+C,KAAK4+B,YACnC5+B,KAAKuiC,OAAOqY,GAEZ,MAAM3zE,EAAO+4B,KAAK4+B,YAEZob,IAAYh6C,KAAKi4C,WACrBj4C,KAAKg/C,4BAA4BrmD,KAAKqH,OAGxC,GAAIg6C,GAAWh6C,KAAK1iB,MAAMmkC,EAAGzL,OAAQ,CAGnC,IAAIipC,EAAoBj/C,KAAKy9C,qCAa7B,MAV+B,eAA3BwB,EAAkBn4E,MACpBG,EAAK6yE,cAAiBmF,EACtBh4E,EAAK+yE,SAAU,EACd/yE,EAAyBi+D,eAAiB,KAC3C+Z,EAAoBj/C,KAAK8+B,WAAW73D,EAAM,qBAE1C+4B,KAAKmzC,2BAA2B8L,EAAmBh4E,GAClDg4E,EAAsCjF,SAAU,GAEnD+E,EAAE7Z,eAAiB+Z,EACZj/C,KAAK8+B,WAAWigB,EAAG,oBAG5B,MAAMG,EACJl/C,KAAK03C,kBACL13C,KAAKi4C,WAAWj4C,KAAKm/C,2BAA2BxmD,KAAKqH,OAEvD,IAAKk/C,EACH,OAAKlF,GAML/yE,EAAK6yE,cAAgB95C,KAAK6kC,kBAC1B59D,EAAK+yE,QAAUA,EACd/yE,EAAyBi+D,eAAiB,KAC3C6Z,EAAE7Z,eAAiBllC,KAAK8+B,WAAW73D,EAAM,mBAClC+4B,KAAK8+B,WAAWigB,EAAG,qBARjB/+C,KAAK+5C,uBAAqC,EAAOgF,GAY5D,MAAMj4E,EAAOk5B,KAAK+5C,uBAAqC,GAKvD,OAJA9yE,EAAK6yE,cAAgBoF,EACrBj4E,EAAKi+D,eAAiBp+D,EACtBG,EAAK+yE,QAAUA,EACf+E,EAAE7Z,eAAiBllC,KAAK8+B,WAAW73D,EAAM,mBAClC+4B,KAAK8+B,WAAWigB,EAAG,uBAI9BK,0CACE,OAAOp/C,KAAK1iB,MAAMmkC,EAAG7O,OACjB5S,KAAKg7C,qCAAqCv5B,EAAG7O,YAC7Cl9G,EAGN8lJ,2BACE,OAAOx7C,KAAK1iB,MAAMmkC,EAAG7O,OAAS5S,KAAK+5C,6BAA0BrkJ,EAG/D4mJ,iBACE,OAAOt8C,KAAKu6C,mBAAmB94B,EAAG7O,OAGpCusC,6BACE,MAAMl7D,EAAK+b,KAAK6kC,kBAChB,GAAI7kC,KAAK2lC,aAAa,QAAU3lC,KAAK63C,wBAEnC,OADA73C,KAAK5iB,OACE6G,EAIX+6D,8BACE,IACGh/C,KAAK1iB,MAAMmkC,EAAG5uH,OACM,YAArBmtG,KAAK8oB,MAAMp1H,OACXssG,KAAK63C,wBAEL,OAAO,EAET,MAAMhjB,EAAc70B,KAAK8oB,MAAM+L,YAE/B,OADA70B,KAAK5iB,UACA4iB,KAAK1iB,MAAMmkC,EAAG5uH,QAAUmtG,KAAK1iB,MAAMmkC,EAAGzL,UAIvC6e,GACF70B,KAAK0jB,MACH1jB,KAAK8oB,MAAM2L,aACXtP,EAAOnK,2BACP,YAIG,GAGT++B,sBACEsF,GAAW,EACXN,EAAwB/+C,KAAK4+B,aAM7B,OAJA5+B,KAAK8+C,UAAS,KACRO,GAAUr/C,KAAKuiC,OAAO9gB,EAAG7O,OAC7BmsC,EAAE7Z,eAAiBllC,KAAKq8C,iBAEnBr8C,KAAK8+B,WAAWigB,EAAG,oBAI5B1C,cAEExjD,GAAOmH,KAAK8oB,MAAMuK,QAClB,MAAMvsD,EAAOk5B,KAAKs/C,4BAClB,GAAIt/C,KAAK63C,0BAA4B73C,KAAK8hC,IAAIrgB,EAAGtL,UAC/C,OAAOrvC,EAET,MAAMG,EAA4B+4B,KAAKygC,gBAAgB35D,GAOvD,OANAG,EAAK4sB,UAAY/sB,EACjBG,EAAKs4E,YAAcv/C,KAAKs/C,4BACxBt/C,KAAKuiC,OAAO9gB,EAAG1O,UACf9rC,EAAKu4E,SAAWx/C,KAAKq8C,cACrBr8C,KAAKuiC,OAAO9gB,EAAG7O,OACf3rC,EAAKw4E,UAAYz/C,KAAKq8C,cACfr8C,KAAK8+B,WAAW73D,EAAM,qBAG/By4E,iCACE,OAAO1/C,KAAK2lC,aAAa,aAAe3lC,KAAKopC,YAAYtiE,OAAS26C,EAAG1L,KAGvEupC,4BACE,OAAIt/C,KAAK0+C,0BACA1+C,KAAKm9C,iCAAiC,kBAE3Cn9C,KAAK1iB,MAAMmkC,EAAG1L,MAET/V,KAAKm9C,iCAAiC,qBACpCn9C,KAAK0/C,iCAEP1/C,KAAKm9C,iCACV,qBACe,GAGZn9C,KAAKy+C,2BAGdkB,uBACE,MAAM14E,EAA0B+4B,KAAK4+B,YAC/BhpB,EAAS5V,KAAK06C,gCAIpB,OAHAzzE,EAAKi+D,eAAiBtvB,GAAU5V,KAAK4/C,sBACrC5/C,KAAK4oC,iBAAiB,KACtB3hE,EAAKilB,WAAa8T,KAAK89C,kBAChB99C,KAAK8+B,WAAW73D,EAAM,mBAG/B44E,sBACEC,GAEA,MAAMC,EAAgB//C,KAAK8oB,MAAM9zC,MAE3BgrE,EAAgBhgD,KAAK+4C,qBACzB,wBACA/4C,KAAKigD,mCAAmCtnD,KAAKqH,OAO/C,OAJKggD,EAAc/6E,QACjB+6B,KAAK0jB,MAAMq8B,EAAejoB,GAASY,wBAAyBonB,GAGvDE,EAGTC,qCACE,MAAMh5E,EAAwC+4B,KAAK4+B,YAQnD,OALA33D,EAAKilB,WAAa8T,KAAKu5C,mBAA2C,GAC9Dv5C,KAAKojC,aAAa,OACpBn8D,EAAKi3D,eAAiBl+B,KAAKw5C,wBAGtBx5C,KAAK8+B,WAAW73D,EAAM,iCAG/Bi5E,4BACEj5E,GAEAA,EAAKgd,GAAK+b,KAAK6kC,kBACf7kC,KAAKqwC,UACHppE,EAAKgd,GACL,mCT11C0B,KS61C5Bhd,EAAKi3D,eAAiBl+B,KAAKw6C,2BACvBx6C,KAAK8hC,IAAIrgB,EAAGtL,YACdlvC,EAAK+/D,QAAUhnC,KAAK6/C,sBAAsB,YAE5C,MAAM55E,EAA0B+5B,KAAK4+B,YAGrC,OAFA34D,EAAKA,KAAO+5B,KAAK8+C,SAAS9+C,KAAK+7C,yBAAyBpjD,KAAKqH,OAC7D/4B,EAAKhB,KAAO+5B,KAAK8+B,WAAW74D,EAAM,mBAC3B+5B,KAAK8+B,WAAW73D,EAAM,0BAG/Bk5E,4BACEl5E,GAsBA,OApBAA,EAAKgd,GAAK+b,KAAK6kC,kBACf7kC,KAAKqwC,UAAUppE,EAAKgd,GAAI,wBT12CI,GS42C5Bhd,EAAKi3D,eAAiBl+B,KAAKw6C,2BAC3BvzE,EAAKi+D,eAAiBllC,KAAK8+C,UAAS,KAGlC,GAFA9+C,KAAKuiC,OAAO9gB,EAAGlO,IAGbvT,KAAK2lC,aAAa,cAClB3lC,KAAKopC,YAAYtiE,OAAS26C,EAAG3O,IAC7B,CACA,MAAM7rC,EAAwB+4B,KAAK4+B,YAEnC,OADA5+B,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAM,sBAG/B,OAAO+4B,KAAKq8C,iBAGdr8C,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,0BAG/Bm5E,cAAiBC,GACf,MAAMC,EAAatgD,KAAK8oB,MAAMt/C,QAC9Bw2B,KAAK8oB,MAAMt/C,QAAU,CAAC82E,EAAW,IACjC,IACE,OAAOD,IADT,QAGErgD,KAAK8oB,MAAMt/C,QAAU82E,GASzBxB,SAAYuB,GACV,MAAMlc,EAAYnkC,KAAK8oB,MAAMuK,OAC7BrzB,KAAK8oB,MAAMuK,QAAS,EACpB,IACE,OAAOgtB,IADT,QAGErgD,KAAK8oB,MAAMuK,OAAS8Q,GAIxBoW,mBAAmBhpC,GACjB,OAAQvR,KAAK1iB,MAAMi0B,GAAqBvR,KAAK4/C,2BAAjBlqJ,EAG9BwmJ,sBAAsB3qC,GACpB,OAAOvR,KAAKugD,mBAAkB,IAAMvgD,KAAKuiC,OAAOhxB,KAGlDquC,sBACE,OAAO5/C,KAAKugD,mBAAkB,IAAMvgD,KAAK5iB,SAG3CmjE,kBAAkBF,GAChB,OAAOrgD,KAAK8+C,UAAS,KACnBuB,IACOrgD,KAAKq8C,iBAIhBmE,oBACE,MAAMv5E,EAAuB+4B,KAAK4+B,YAQlC,OANA33D,EAAKgd,GAAK+b,KAAK1iB,MAAMmkC,EAAG9lB,QACpBqE,KAAKmiC,gBACLniC,KAAK6kC,iBAA8B,GACnC7kC,KAAK8hC,IAAIrgB,EAAGlO,MACdtsC,EAAKw5E,YAAczgD,KAAKyiC,2BAEnBziC,KAAK8+B,WAAW73D,EAAM,gBAG/By5E,uBACEz5E,EACA05E,GAgBA,OAdIA,IAAS15E,EAAK+hD,OAAQ,GAC1B/hD,EAAKgd,GAAK+b,KAAK6kC,kBACf7kC,KAAKqwC,UACHppE,EAAKgd,GACL,8BACA08D,ETz7C0BC,IAPA3a,KSm8C5BjmC,KAAKuiC,OAAO9gB,EAAGpP,QACfprC,EAAKsvE,QAAUv2C,KAAK+4C,qBAClB,cACA/4C,KAAKwgD,kBAAkB7nD,KAAKqH,OAE9BA,KAAKuiC,OAAO9gB,EAAGjP,QACRxS,KAAK8+B,WAAW73D,EAAM,qBAG/B45E,qBACE,MAAM55E,EAAwB+4B,KAAK4+B,YAYnC,OAXA5+B,KAAK6kB,MAAMF,MTjgDiB,GSmgD5B3kB,KAAKuiC,OAAO9gB,EAAGpP,QAEfrS,KAAK8gD,4BACF75E,EAAKhB,KAAO,QACIvwE,GACF,EACL+rH,EAAGjP,QAEfxS,KAAK6kB,MAAMD,OACJ5kB,KAAK8+B,WAAW73D,EAAM,iBAG/B85E,oCACE95E,EACA+5E,GAAmB,GAYnB,GAVA/5E,EAAKgd,GAAK+b,KAAK6kC,kBAEVmc,GACHhhD,KAAKqwC,UACHppE,EAAKgd,GACL,kCT79CwB,MSk+CxB+b,KAAK8hC,IAAIrgB,EAAG3O,KAAM,CACpB,MAAMmuC,EAAQjhD,KAAK4+B,YACnB5+B,KAAK+gD,oCAAoCE,GAAO,GAChDh6E,EAAKhB,KAAOg7E,OAEZjhD,KAAK6kB,MAAMF,MAAM3B,GACjBhjB,KAAKkhD,UAAUv8B,MDtiDF,GCuiDb19C,EAAKhB,KAAO+5B,KAAK6gD,qBACjB7gD,KAAKkhD,UAAUt8B,OACf5kB,KAAK6kB,MAAMD,OAEb,OAAO5kB,KAAK8+B,WAAW73D,EAAM,uBAG/Bk6E,wCACEl6E,GAoBA,OAlBI+4B,KAAK2lC,aAAa,WACpB1+D,EAAKu4B,QAAS,EACdv4B,EAAKgd,GAAK+b,KAAK6kC,mBACN7kC,KAAK1iB,MAAMmkC,EAAG9lB,QACvB10B,EAAKgd,GAAK+b,KAAKmiC,gBAEfniC,KAAK4hC,aAEH5hC,KAAK1iB,MAAMmkC,EAAGpP,SAChBrS,KAAK6kB,MAAMF,MAAM3B,GACjBhjB,KAAKkhD,UAAUv8B,MD3jDF,GC4jDb19C,EAAKhB,KAAO+5B,KAAK6gD,qBACjB7gD,KAAKkhD,UAAUt8B,OACf5kB,KAAK6kB,MAAMD,QAEX5kB,KAAKolC,YAGAplC,KAAK8+B,WAAW73D,EAAM,uBAG/Bm6E,+BACEn6E,EACAo6E,GAEAp6E,EAAKo6E,SAAWA,IAAY,EAC5Bp6E,EAAKgd,GAAK+b,KAAK6kC,kBACf7kC,KAAKqwC,UAAUppE,EAAKgd,GAAI,4BT3hDIgiD,GS4hD5BjmC,KAAKuiC,OAAO9gB,EAAGlO,IACf,MAAM+tC,EAAkBthD,KAAKuhD,yBAS7B,MAPsB,SAApBt6E,EAAK2hD,YACoB,8BAAzB04B,EAAgBx6E,MAEhBk5B,KAAK0jB,MAAM49B,EAAgBtsE,MAAO8iD,GAASgB,0BAE7C7xD,EAAKq6E,gBAAkBA,EACvBthD,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,6BAG/Bu6E,8BACE,OACExhD,KAAK2lC,aAAa,YAClB,KAAA3lC,KAAK69C,oBAIT0D,yBACE,OAAOvhD,KAAKwhD,8BACRxhD,KAAKyhD,iCACLzhD,KAAKu5C,mBAA2C,GAGtDkI,iCACE,MAAMx6E,EAAoC+4B,KAAK4+B,YAG/C,GAFA5+B,KAAKukC,iBAAiB,WACtBvkC,KAAKuiC,OAAO9gB,EAAG/O,SACV1S,KAAK1iB,MAAMmkC,EAAG9lB,QACjB,MAAMqE,KAAK4hC,aAKb,OAFA36D,EAAKilB,WAAa8T,KAAKmiC,gBACvBniC,KAAKuiC,OAAO9gB,EAAG9O,QACR3S,KAAK8+B,WAAW73D,EAAM,6BAK/Bs0E,YAAemG,GACb,MAAM54B,EAAQ9oB,KAAK8oB,MAAMuM,QACnBtpD,EAAM21E,IAEZ,OADA1hD,KAAK8oB,MAAQA,EACN/8C,EAGT41E,mBAAmCD,GACjC,MAAM92E,EAASo1B,KAAK+sC,UAASiG,GAAS0O,KAAO1O,MAE7C,IAAIpoE,EAAOyoE,SAAYzoE,EAAO3D,KAE9B,OADI2D,EAAO2E,QAAOywB,KAAK8oB,MAAQl+C,EAAOoiE,WAC/BpiE,EAAO3D,KAGhBgxE,WAAcyJ,GACZ,MAAM54B,EAAQ9oB,KAAK8oB,MAAMuM,QACnBzqD,EAAS82E,IACf,YAAehsJ,IAAXk1E,IAAmC,IAAXA,EACnBA,OAEPo1B,KAAK8oB,MAAQA,GAKjB84B,kBAAkBC,GAChB,GAAI7hD,KAAKm7C,mBACP,OAEF,IACItc,EADAijB,EAAY9hD,KAAK8oB,MAAMhiD,KAQ3B,OALIk5B,KAAK2lC,aAAa,SACpBmc,EAAYrgC,EAAG9L,KACfkpB,EAAO,OAGF7+B,KAAK+hD,oBAAmB,KAC7B,OAAQD,GACN,KAAKrgC,EAAGpM,UAEN,OADAwsC,EAAK7Z,SAAU,EACRhoC,KAAKgiD,uBACVH,GACY,GACc,GAE9B,KAAKpgC,EAAGvL,OAIN,OADA2rC,EAAK7Z,SAAU,EACRhoC,KAAKiiD,WACVJ,GACkB,GACD,GAErB,KAAKpgC,EAAG7L,OACN,GAAI5V,KAAK1iB,MAAMmkC,EAAG7L,SAAW5V,KAAK+xC,sBAAsB,QAItD,OAFA/xC,KAAKuiC,OAAO9gB,EAAG7L,QACf5V,KAAKukC,iBAAiB,QACfvkC,KAAK0gD,uBAAuBmB,GAAoB,GAG3D,KAAKpgC,EAAG9L,KAEN,OADAkpB,EAAOA,GAAQ7+B,KAAK8oB,MAAMp1H,MACnBssG,KAAKkiD,kBAAkBL,EAAMhjB,GACtC,KAAKpd,EAAG5uH,KAAM,CACZ,MAAMa,EAAQssG,KAAK8oB,MAAMp1H,MACzB,MAAc,WAAVA,EACKssG,KAAKmhD,wCAAwCU,GAE7C7hD,KAAKmiD,mBAAmBN,EAAMnuJ,GAAkB,QAQjE0uJ,8BACE,OAAOpiD,KAAKmiD,mBACVniD,KAAK4+B,YACL5+B,KAAK8oB,MAAMp1H,OACA,GAIf2uJ,2BAA2Bp7E,EAAWwlE,GACpC,OAAQA,EAAK55I,MACX,IAAK,UAAW,CACd,MAAMyzI,EAActmC,KAAK4hD,kBAAkB36E,GAC3C,GAAIq/D,EAEF,OADAA,EAAY0B,SAAU,EACf1B,EAET,MAEF,IAAK,SAGH,GAAItmC,KAAK1iB,MAAMmkC,EAAGpP,QAAS,CACzBrS,KAAK6kB,MAAMF,MAAM3B,GACjBhjB,KAAKkhD,UAAUv8B,MD7tDN,GC8tDT,MAAM29B,EAA6Br7E,EAMnC,OALAq7E,EAAI9iD,QAAS,EACb8iD,EAAIr+D,GAAKwoD,EACT6V,EAAIr8E,KAAO+5B,KAAK6gD,qBAChB7gD,KAAK6kB,MAAMD,OACX5kB,KAAKkhD,UAAUt8B,OACR5kB,KAAK8+B,WAAWwjB,EAAK,uBAE9B,MAEF,QACE,OAAOtiD,KAAKmiD,mBAAmBl7E,EAAMwlE,EAAK55I,MAAiB,IAKjEsvJ,mBACEl7E,EACAvzE,EACA0pF,GAGA,OAAQ1pF,GACN,IAAK,WACH,GACEssG,KAAKuiD,sBAAsBnlE,KAC1B4iB,KAAK1iB,MAAMmkC,EAAGvL,SAAWlW,KAAK1iB,MAAMmkC,EAAG5uH,OAExC,OAAOmtG,KAAKwiD,2BAA2Bv7E,GAEzC,MAEF,IAAK,OACH,GAAImW,GAAQ4iB,KAAK1iB,MAAMmkC,EAAG5uH,MAExB,OADIuqF,GAAM4iB,KAAK5iB,OACR4iB,KAAK0gD,uBAAuBz5E,GAAoB,GAEzD,MAEF,IAAK,YACH,GAAI+4B,KAAKuiD,sBAAsBnlE,IAAS4iB,KAAK1iB,MAAMmkC,EAAG5uH,MACpD,OAAOmtG,KAAKkgD,4BAA4Bj5E,GAE1C,MAEF,IAAK,SACH,GAAI+4B,KAAKuiD,sBAAsBnlE,GAAO,CACpC,GAAI4iB,KAAK1iB,MAAMmkC,EAAG9lB,QAChB,OAAOqE,KAAKmhD,wCAAwCl6E,GAC/C,GAAI+4B,KAAK1iB,MAAMmkC,EAAG5uH,MACvB,OAAOmtG,KAAK+gD,oCAAoC95E,GAGpD,MAEF,IAAK,YACH,GAAI+4B,KAAKuiD,sBAAsBnlE,IAAS4iB,KAAK1iB,MAAMmkC,EAAG5uH,MACpD,OAAOmtG,KAAK+gD,oCAAoC95E,GAElD,MAEF,IAAK,OACH,GAAI+4B,KAAKuiD,sBAAsBnlE,IAAS4iB,KAAK1iB,MAAMmkC,EAAG5uH,MACpD,OAAOmtG,KAAKmgD,4BAA4Bl5E,IAMhDs7E,sBAAsBnlE,GACpB,OAAIA,GACE4iB,KAAKyiD,0BACTziD,KAAK5iB,QACE,IAED4iB,KAAKm7C,mBAGfuH,oCACEpjB,EACAzM,GAEA,IAAK7yB,KAAKojC,aAAa,KACrB,OAGF,MAAMuf,EAA4B3iD,KAAK8oB,MAAMqK,uBAC7CnzB,KAAK8oB,MAAMqK,wBAAyB,EAEpC,MAAMpnD,EAAkCi0B,KAAK2hD,oBAAmB,KAC9D,MAAM16E,EAAkC+4B,KAAK48B,YAC3C0C,EACAzM,GAOF,OALA5rD,EAAKi3D,eAAiBl+B,KAAKy6C,wBAE3Bl1B,MAAMgtB,oBAAoBtrE,GAC1BA,EAAKya,WAAase,KAAKo/C,0CACvBp/C,KAAKuiC,OAAO9gB,EAAGxO,OACRhsC,KAKT,OAFA+4B,KAAK8oB,MAAMqK,uBAAyBwvB,EAE/B52E,EAIEi0B,KAAKu0C,qBACVxoE,EAC6B,MACjB,QAPd,EAWFytE,uBACE,MAAMvyE,EAAO+4B,KAAK4+B,YAelB,OAdA33D,EAAKsP,OAASypB,KAAK8+C,UAAS,IAE1B9+C,KAAKogD,eAAc,KACjBpgD,KAAK4oC,iBAAiB,KACf5oC,KAAK+4C,qBACV,4BACA/4C,KAAKq8C,YAAY1jD,KAAKqH,YAID,IAAvB/4B,EAAKsP,OAAOtR,QACd+6B,KAAK0jB,MAAMz8C,EAAK+N,MAAO8iD,GAASa,oBAElC34B,KAAK4oC,iBAAiB,KACf5oC,KAAK8+B,WAAW73D,EAAM,gCAG/B27E,uBACE,GAAI5iD,KAAK1iB,MAAMmkC,EAAG5uH,MAChB,OAAQmtG,KAAK8oB,MAAMp1H,OACjB,IAAK,WACL,IAAK,UACL,IAAK,OACL,IAAK,YACL,IAAK,SACL,IAAK,YACL,IAAK,OACH,OAAO,EAIb,OAAO,EAOTi5I,2BACE,OAAI3sC,KAAK4iD,wBACFr9B,MAAMonB,2BAGfkW,wBACErQ,EACAsQ,GAGA,MAAMxjB,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAE5B,IAAI+lB,EACA8C,GAAW,OACQhmJ,IAAnB88I,IACFoG,EAAgB54C,KAAK+iD,sBACrBrH,IAAa17C,KAAK+3C,gBAAgB,CAAC,cACZ,IAAnBvF,IAA6BoG,GAAiB8C,IAChD17C,KAAK0jB,MAAM4b,EAAUxH,GAASyC,8BAIlC,MAAMrxC,EAAO8W,KAAKmxC,oBAClBnxC,KAAKkxC,6BAA6BhoD,GAClC,MAAM85D,EAAMhjD,KAAKmxC,kBAAkBjoD,EAAKlU,MAAOkU,EAAK5hB,IAAI0N,MAAOkU,GAC/D,GAAI0vD,GAAiB8C,EAAU,CAC7B,MAAMuH,EAA4BjjD,KAAK48B,YAAY0C,EAAUzM,GAU7D,OATIiwB,EAAW79E,SACbg+E,EAAGH,WAAaA,GAEdlK,IAAeqK,EAAGrK,cAAgBA,GAClC8C,IAAUuH,EAAGvH,SAAWA,GACX,eAAbsH,EAAIl8E,MAAsC,sBAAbk8E,EAAIl8E,MACnCk5B,KAAK0jB,MAAMu/B,EAAGjuE,MAAO8iD,GAAS8C,kCAEhCqoB,EAAGC,UAAcF,EACVhjD,KAAK8+B,WAAWmkB,EAAI,uBAO7B,OAJIH,EAAW79E,SACbikB,EAAK45D,WAAaA,GAGbE,EAGT5W,2BACEnlE,EACAH,EACA23D,GAAqB,GAEjBz+B,KAAK1iB,MAAMmkC,EAAG7O,SAChB3rC,EAAKya,WAAase,KAAKg7C,qCAAqCv5B,EAAG7O,QAGjE,MAAMuwC,EACK,wBAATr8E,EACI,oBACS,gBAATA,EACA,uBACApxE,EACFytJ,IAAiBnjD,KAAK1iB,MAAMmkC,EAAGpP,SAAWrS,KAAKm7C,mBACjDn7C,KAAK8+B,WAAW73D,EAAMk8E,GAGH,sBAAjBA,GAAwCnjD,KAAK8oB,MAAM2K,mBACrDzzB,KAAK0jB,MAAMz8C,EAAK+N,MAAO8iD,GAASS,kCAG9BtxD,EAAK+gE,SAELziB,MAAM6mB,2BAA2BnlE,EAAMk8E,EAAc1kB,GAKzDlZ,MAAM6mB,2BAA2BnlE,EAAMH,EAAM23D,GAG/C2kB,4BAA4Bn8E,IACrBA,EAAKhB,MAAQgB,EAAKgd,GAGrB+b,KAAKqwC,UAAUppE,EAAKgd,GAAI,gBTt5DE,MSw5D1BshC,MAAM69B,+BAA+B/sE,WAIzCgtE,2BAA2BC,GACzBA,EAAMlvJ,SAAQ6yE,IACO,0BAAX,MAAJA,OAAA,EAAAA,EAAMH,OACRk5B,KAAK0jB,MACHz8C,EAAKi+D,eAAelwD,MACpB8iD,GAAS2C,6BAMjBsV,iBACEF,EACA0T,GAOA,OADAvjD,KAAKqjD,2BAA2BxT,GACzBA,EAGTK,kBAAkB95D,GAChB,MAAMnP,EAAOs+C,MAAM2qB,kBAAkB95D,GAMrC,MAJkB,oBAAdnP,EAAKH,MACPk5B,KAAKqjD,2BAA2Bp8E,EAAK8O,UAGhC9O,EAGTk5D,eACEC,EACAd,EACAzM,EACAwN,EACAvX,GAEA,IAAK9oB,KAAK63C,yBAA2B73C,KAAK1iB,MAAMmkC,EAAG/N,MAAO,CACxD1T,KAAK5iB,OAEL,MAAMomE,EAA2CxjD,KAAK48B,YACpD0C,EACAzM,GAGF,OADA2wB,EAAkBt3D,WAAak0C,EACxBpgC,KAAK8+B,WAAW0kB,EAAmB,uBAG5C,GAAIxjD,KAAKojC,aAAa,KAAM,CAI1B,MAAMx4D,EAASo1B,KAAK2hD,oBAAmB,KACrC,IAAKthB,GAAWrgC,KAAKyjD,qBAAqBrjB,GAAO,CAG/C,MAAMsjB,EAAe1jD,KAAK0iD,oCACxBpjB,EACAzM,GAEF,GAAI6wB,EACF,OAAOA,EAIX,MAAMz8E,EAAyB+4B,KAAK48B,YAAY0C,EAAUzM,GAC1D5rD,EAAKkP,OAASiqD,EAEd,MAAMgU,EAAgBp0C,KAAKw5C,uBAE3B,GAAIpF,EAAe,CACjB,IAAK/T,GAAWrgC,KAAK8hC,IAAIrgB,EAAG/O,QAgB1B,OAbAzrC,EAAKoP,UAAY2pB,KAAKg0C,6BACpBvyB,EAAG9O,QACiB,GAItB3S,KAAKqjD,2BAA2Bp8E,EAAKoP,WAErCpP,EAAKi3D,eAAiBkW,EAClBtrB,EAAMwX,sBAERr5D,EAAK24D,UAAW,GAEX5/B,KAAK2/B,qBAAqB14D,EAAM6hD,EAAMwX,qBACxC,GAAItgC,KAAK1iB,MAAMmkC,EAAGtO,WAAY,CACnC,MAAMvoC,EAASo1B,KAAK2jD,8BAClBvjB,EACAd,EACAzM,EACA/J,GAGF,OADAl+C,EAAOszD,eAAiBkW,EACjBxpE,GAIXo1B,KAAK4hC,gBAGP,GAAIh3D,EAAQ,OAAOA,EAGrB,OAAO26C,MAAM4a,eAAeC,EAAMd,EAAUzM,EAAUwN,EAASvX,GAGjEurB,kBAAkBptE,GAChB,GAAI+4B,KAAKojC,aAAa,KAAM,CAG1B,MAAMlF,EAAiBl+B,KAAK2hD,oBAAmB,KAC7C,MAAMvrE,EAAO4pB,KAAKw5C,uBAElB,OADKx5C,KAAK1iB,MAAMmkC,EAAG/O,SAAS1S,KAAK4hC,aAC1BxrD,KAEL8nD,IACFj3D,EAAKi3D,eAAiBA,GAI1B3Y,MAAM8uB,kBAAkBptE,GAG1B28E,YACE16D,EACA26D,EACAC,EACAC,GAEA,GACElsB,GAAQpW,EAAGhL,IAAItF,OAAS4yC,IACvB/jD,KAAK63C,yBACN73C,KAAK2lC,aAAa,MAClB,CACA,MAAM1+D,EAAyB+4B,KAAK48B,YAClCinB,EACAC,GAEF78E,EAAKilB,WAAahD,EAClB,MAAM0sB,EAAS5V,KAAK06C,gCASpB,OAPEzzE,EAAKi+D,eADHtvB,GAGoB5V,KAAK4/C,sBAE7B5/C,KAAK8+B,WAAW73D,EAAM,kBAEtB+4B,KAAKgkD,eACEhkD,KAAK4jD,YAAY38E,EAAM48E,EAAcC,EAAcC,GAG5D,OAAOx+B,MAAMq+B,YAAY16D,EAAM26D,EAAcC,EAAcC,GAG7D1R,kBACE7vB,EACAqQ,EACAoxB,EAEArU,IAgBFsU,yBAEA/d,YAAYl/D,GAEV,GADAA,EAAK2hD,WAAa,QACd5oB,KAAK1iB,MAAMmkC,EAAG5uH,OAASmtG,KAAK1iB,MAAMmkC,EAAGjN,OAASxU,KAAK1iB,MAAMmkC,EAAGpP,QAAS,CACvE,IAAI8xC,EAAQnkD,KAAKopC,YAgBjB,IAbEppC,KAAK2lC,aAAa,SAElBwe,EAAMr9E,OAAS26C,EAAG75B,OAEhBu8D,EAAMr9E,OAAS26C,EAAG5uH,MAAwB,SAAhBsxJ,EAAMzwJ,OAElCywJ,EAAMr9E,OAAS26C,EAAGlO,KAElBtsC,EAAK2hD,WAAa,OAClB5oB,KAAK5iB,OACL+mE,EAAQnkD,KAAKopC,aAGXppC,KAAK1iB,MAAMmkC,EAAG5uH,OAASsxJ,EAAMr9E,OAAS26C,EAAGlO,GAC3C,OAAOvT,KAAKohD,+BAA+Bn6E,GAI/C,MAAMm9E,EAAa7+B,MAAM4gB,YAAYl/D,GAgBrC,MAV4B,SAA1Bm9E,EAAWx7B,YACXw7B,EAAWlkB,WAAWj7D,OAAS,GACG,2BAAlCm/E,EAAWlkB,WAAW,GAAGp5D,MAEzBk5B,KAAK0jB,MACH0gC,EAAWpvE,MACX8iD,GAASwC,wCAIN8pB,EAGTpkB,YAAY/4D,GACV,GAAI+4B,KAAK1iB,MAAMmkC,EAAGpL,SAYhB,OAVArW,KAAK5iB,OAEH4iB,KAAK2lC,aAAa,SAClB,KAAA3lC,KAAK69C,qBAEL52E,EAAK2hD,WAAa,OAClB5oB,KAAK5iB,QAELnW,EAAK2hD,WAAa,QAEb5oB,KAAKohD,+BAA+Bn6E,GAAqB,GAC3D,GAAI+4B,KAAK8hC,IAAIrgB,EAAGlO,IAAK,CAE1B,MAAM9V,EAA+Bx2B,EAGrC,OAFAw2B,EAAOvR,WAAa8T,KAAKsiC,kBACzBtiC,KAAKolC,YACEplC,KAAK8+B,WAAWrhC,EAAQ,sBAC1B,GAAIuC,KAAKwlC,cAAc,MAAO,CAEnC,MAAM+I,EAAuCtnE,EAK7C,OAHA+4B,KAAKukC,iBAAiB,aACtBgK,EAAKtqD,GAAK+b,KAAK6kC,kBACf7kC,KAAKolC,YACEplC,KAAK8+B,WAAWyP,EAAM,gCAS7B,OAPIvuC,KAAK2lC,aAAa,SAAW3lC,KAAKopC,YAAYtiE,OAAS26C,EAAGpP,QAC5DrS,KAAK5iB,OACLnW,EAAKy/D,WAAa,QAElBz/D,EAAKy/D,WAAa,QAGbnhB,MAAMya,YAAY/4D,GAI7Bo9E,kBACE,OACErkD,KAAK2lC,aAAa,aAAe3lC,KAAKopC,YAAYtiE,OAAS26C,EAAGvL,OAIlE02B,+BACE,GAAI5sC,KAAKqkD,kBAAmB,CAC1B,MAAMC,EAAMtkD,KAAK4+B,YAIjB,OAHA5+B,KAAK5iB,OACLknE,EAAIlH,UAAW,EACfp9C,KAAKiiD,WAAWqC,GAAK,GAAM,GACpBA,EAKT,GAAyB,cAArBtkD,KAAK8oB,MAAMp1H,MAAuB,CACpC,MAAMk3E,EAASo1B,KAAKmiD,mBAClBniD,KAAK4+B,YACL5+B,KAAK8oB,MAAMp1H,OACX,GAGF,GAAIk3E,EAAQ,OAAOA,EAGrB,OAAO26C,MAAMqnB,+BAGf2X,sBAAsB/6E,EAAkB8iE,GACtC,GAAItsC,KAAK8oB,MAAMhiD,OAAS26C,EAAG7L,OAAQ,CACjC,MAAMuuC,EAAQnkD,KAAKopC,YACnB,GAAI+a,EAAMr9E,OAAS26C,EAAG5uH,MAAwB,SAAhBsxJ,EAAMzwJ,MAAkB,CACpD,MAAMuzE,EAA4B+4B,KAAK4+B,YAGvC,OAFA5+B,KAAKuiC,OAAO9gB,EAAG7L,QACf5V,KAAKukC,iBAAiB,QACfvkC,KAAK0gD,uBAAuBz5E,GAAoB,IAG3D,OAAOs+C,MAAMg/B,sBAAsB/6E,EAAS8iE,GAG9CyW,sBACE,OAAO/iD,KAAK+3C,gBAAgB,CAAC,SAAU,YAAa,YAGtDyM,mBAAmBrV,EAAa1nE,GAC9B,OAAOA,EAAUb,MAAK0H,GAChBwsD,GAAmBxsD,GACd6gE,EAAOyJ,gBAAkBtqE,IAEzB6gE,EAAO7gE,KAIpB4gE,iBACEpR,EACAqR,EACArmB,GAEA,MAAM27B,EAAiC,CACrC,UACA,UACA,SACA,YACA,WACA,WACA,YAEFzkD,KAAKk4C,iBACH/I,EACAsV,EAA+B5yD,OAAO,CAAC,YAGzC,MAAM6yD,EAAmC,KACvC,MAAM74E,IAAasjE,EAAOhG,OACtBt9D,GAAYm0B,KAAK8hC,IAAIrgB,EAAGpP,SACtBrS,KAAKwkD,mBAAmBrV,EAAQsV,IAClCzkD,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKkgD,GAASsC,+BAEtCp6B,KAAK2kD,sBAAsB7mB,EAAaqR,IAExCnvC,KAAK4kD,6BAA6B9mB,EAAWqR,EAAQrmB,EAAOj9C,IAG5DsjE,EAAOnH,QACThoC,KAAK+hD,mBAAmB2C,GAExBA,IAIJE,6BACE9mB,EACAqR,EACArmB,EACAj9C,GAEA,MAAMs8B,EAAMnI,KAAKs7C,yBAAyBnM,GAC1C,GAAIhnC,EAoBF,OAnBA21B,EAAU73D,KAAK6E,KAAKq9B,GAEfgnC,EAAaiO,UAChBp9C,KAAK0jB,MAAMyrB,EAAOn6D,MAAO8iD,GAASkB,2BAE/BmW,EAAayJ,eAChB54C,KAAK0jB,MACHyrB,EAAOn6D,MACP8iD,GAASmB,+BACRkW,EAAayJ,eAGbzJ,EAAanH,SAChBhoC,KAAK0jB,MAAMyrB,EAAOn6D,MAAO8iD,GAASoB,+BAE/BiW,EAAa0V,UAChB7kD,KAAK0jB,MAAMyrB,EAAOn6D,MAAO8iD,GAASqB,6BAMjCn5B,KAAK8oB,MAAM4K,iBAAoByb,EAAaiO,UAC/Cp9C,KAAK0jB,MAAMyrB,EAAOn6D,MAAO8iD,GAAS2B,mCAG/B0V,EAAa0V,WACX/7B,EAAMg8B,eACT9kD,KAAK0jB,MAAMyrB,EAAOn6D,MAAO8iD,GAAS8B,wBAMtCrU,MAAMq/B,6BAA6B9mB,EAAWqR,EAAQrmB,EAAOj9C,GAG/Dk5E,6BACEC,GAEiBhlD,KAAK8hC,IAAIrgB,EAAG1O,YACfiyC,EAAaplB,UAAW,GAEjColB,EAAmBtJ,UAAY17C,KAAK1iB,MAAMmkC,EAAG/O,SAChD1S,KAAK0jB,MAAMshC,EAAahwE,MAAO8iD,GAASK,wBAGrC6sB,EAAmBhd,SAAWhoC,KAAK1iB,MAAMmkC,EAAG/O,SAC/C1S,KAAK0jB,MAAMshC,EAAahwE,MAAO8iD,GAASI,uBAQ5CsU,yBACEvlE,EACAwlE,GAMA,OAHgB,eAAdA,EAAK3lE,KACDk5B,KAAKqiD,2BAA2Bp7E,EAAMwlE,QACtC/2I,IACS6vH,MAAMinB,yBAAyBvlE,EAAMwlE,GAKtDC,+BACE,QAAI1sC,KAAK4iD,wBACFr9B,MAAMmnB,+BAIfG,iBACEJ,EACAnN,EACAzM,EACAia,GAIA,IAAKA,IAAqB9sC,KAAK1iB,MAAMmkC,EAAG1O,UACtC,OAAOwS,MAAMsnB,iBACXJ,EACAnN,EACAzM,EACAia,GAIJ,MAAMliE,EAASo1B,KAAK+sC,UAAS,IAC3BxnB,MAAMsnB,iBAAiBJ,EAAMnN,EAAUzM,KAGzC,OAAKjoD,EAAO3D,MAKR2D,EAAO2E,QAAOywB,KAAK8oB,MAAQl+C,EAAOoiE,WAC/BpiE,EAAO3D,OAJZ6lE,EAAiB93D,MAAQpK,EAAO2E,MAAMqI,KAAOooB,KAAK8oB,MAAM9zC,MACjDy3D,GAQX2B,eACEnnE,EACAq4D,EACAzM,GAWA,GATA5rD,EAAOs+C,MAAM6oB,eAAennE,EAAMq4D,EAAUzM,GACxC7yB,KAAK8hC,IAAIrgB,EAAG1O,YACd9rC,EAAK24D,UAAW,EAIhB5/B,KAAKmlC,iBAAiBl+D,IAGpB+4B,KAAK1iB,MAAMmkC,EAAG7O,OAAQ,CACxB,MAAMy7B,EAAuCruC,KAAK48B,YAChD0C,EACAzM,GAKF,OAHAwb,EAAaniD,WAAajlB,EAC1BonE,EAAanJ,eAAiBllC,KAAK+5C,wBAE5B/5C,KAAK8+B,WAAWuP,EAAc,wBAGvC,OAAOpnE,EAGTunE,uBAAuBvnE,GAErB,MAAMq4D,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAGtBoyB,EAAYjlD,KAAKwlC,cAAc,WAErC,GACEyf,IACCjlD,KAAK2lC,aAAa,aAAe3lC,KAAK0sC,gCAEvC,MAAM1sC,KAAK0jB,MACT1jB,KAAK8oB,MAAM9zC,MACX8iD,GAASe,mCAIb,IAAIyN,EAwBJ,OAtBItmC,KAAK1iB,MAAMmkC,EAAG5uH,QAChByzI,EAActmC,KAAKoiD,+BAEhB9b,IACHA,EAAc/gB,MAAMipB,uBAAuBvnE,IAG3Cq/D,IACsB,2BAArBA,EAAYx/D,MACU,2BAArBw/D,EAAYx/D,MACZm+E,KAEFh+E,EAAKy/D,WAAa,QAGhBJ,GAAe2e,IAEjBjlD,KAAKklD,mBAAmB5e,EAAahH,EAAUzM,GAE/CyT,EAAY0B,SAAU,GAGjB1B,EAGTyI,aACE9nE,EACA+nE,EACAC,GAEA,KAAMD,GAAeC,IAAejvC,KAAK2lC,aAAa,cACpD,OAGFpgB,MAAMwpB,aACJ9nE,EACA+nE,EACAC,EACChoE,EAAW+gE,QT58Ec,KAPA/B,KSq9E5B,MAAM/H,EAAiBl+B,KAAKw6C,2BACxBtc,IAAgBj3D,EAAKi3D,eAAiBA,GAG5CinB,6BACEl+E,IAEKA,EAAK24D,UAAY5/B,KAAK8hC,IAAIrgB,EAAG/N,QAChCzsC,EAAKm+E,UAAW,GAGlB,MAAMt+E,EAAOk5B,KAAKw7C,2BACd10E,IAAMG,EAAKi+D,eAAiBp+D,GAGlCi4D,mBAAmB93D,GAOjB,OANA+4B,KAAKmlD,6BAA6Bl+E,GAE9B+4B,KAAK8oB,MAAM2K,kBAAoBzzB,KAAK1iB,MAAMmkC,EAAGlO,KAC/CvT,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAO8iD,GAASQ,iCAGjC/S,MAAMwZ,mBAAmB93D,GAGlCg4D,0BACEh4D,GAiBA,OAdIA,EAAKm2E,UACPp9C,KAAK0jB,MAAMz8C,EAAK+N,MAAO8iD,GAASgC,2BAI9B7yD,EAAK2xE,eACP54C,KAAK0jB,MACHz8C,EAAK+N,MACL8iD,GAASiC,+BACT9yD,EAAK2xE,eAIT54C,KAAKmlD,6BAA6Bl+E,GAC3Bs+C,MAAM0Z,0BAA0Bh4D,GAGzC42D,gBACEC,EACAV,EACAxF,EACAD,EACAoG,EACAC,GAEA,MAAME,EAAiBl+B,KAAKw6C,2BACxBtc,GAAkBH,GACpB/9B,KAAK0jB,MAAMwa,EAAelpD,MAAO8iD,GAASM,+BAIxCgF,EAAO4K,SAA4B,QAAhB5K,EAAOyB,MAAkC,QAAhBzB,EAAOyB,MACrD7+B,KAAK0jB,MAAM0Z,EAAOpoD,MAAO8iD,GAASO,gBAAiB+E,EAAOyB,MAExDX,IAAgBd,EAAOc,eAAiBA,GAC5C3Y,MAAMsY,gBACJC,EACAV,EACAxF,EACAD,EACAoG,EACAC,GAIJ0S,uBACE5S,EACAV,EACAxF,EACAD,GAEA,MAAMuG,EAAiBl+B,KAAKw6C,2BACxBtc,IAAgBd,EAAOc,eAAiBA,GAC5C3Y,MAAMmrB,uBAAuB5S,EAAWV,EAAQxF,EAAaD,GAG/DgZ,gBAAgB1pE,GACds+C,MAAMorB,gBAAgB1pE,GAClBA,EAAKy0D,YAAc17B,KAAKojC,aAAa,OACvCn8D,EAAK2pE,oBAAsB5wC,KAAKw5C,wBAE9Bx5C,KAAKwlC,cAAc,gBACrBv+D,EAAKggE,WAAajnC,KAAK6/C,sBAAsB,eAIjD5O,kBAAkBt4D,KAAyBvC,GACzC,MAAM8nD,EAAiBl+B,KAAKw6C,2BACxBtc,IAAgBvlD,EAAKulD,eAAiBA,GAE1C3Y,MAAM0rB,kBAAkBt4D,KAASvC,GAGnCm8D,oBAAoBtrE,EAAkBurE,GACpC,MAAMtU,EAAiBl+B,KAAKw6C,2BACxBtc,IAAgBj3D,EAAKi3D,eAAiBA,GAC1C3Y,MAAMgtB,oBAAoBtrE,EAAMurE,GAIlCC,WACElE,EACA1P,GAEAtZ,MAAMktB,WAAWlE,EAAM1P,GACF,eAAjB0P,EAAKtqD,GAAGnd,MAAyBk5B,KAAK8hC,IAAIrgB,EAAG/N,QAC/C66B,EAAK6W,UAAW,GAGlB,MAAMt+E,EAAOk5B,KAAKw7C,2BACd10E,IACFynE,EAAKtqD,GAAGihD,eAAiBp+D,EACzBk5B,KAAKmlC,iBAAiBoJ,EAAKtqD,KAK/ByuD,kCACEzrE,EACA22B,GAKA,OAHIoC,KAAK1iB,MAAMmkC,EAAG7O,SAChB3rC,EAAKya,WAAase,KAAK+5C,yBAElBx0B,MAAMmtB,kCAAkCzrE,EAAM22B,GAGvD2vC,oBAAoBn3D,GAAoB,IAAAy8D,EAAAC,EAAAuS,EAAAtS,EAAAuS,EAAAC,EAAAC,EAGtC,IAAI18B,EACA+X,EACA4kB,EA+BAvnB,EA7BJ,GACEl+B,KAAKk7B,UAAU,SACdl7B,KAAK1iB,MAAMmkC,EAAGkV,cAAgB32B,KAAKojC,aAAa,MACjD,CAOA,GALAta,EAAQ9oB,KAAK8oB,MAAMuM,QAEnBwL,EAAM7gC,KAAK+sC,UAAS,IAAMxnB,MAAMgoB,oBAAoBn3D,IAAO0yC,IAGtD+X,EAAItxD,MAAO,OAAOsxD,EAAI55D,KAK3B,MAAMuC,QAAEA,GAAYw2B,KAAK8oB,MACrBt/C,EAAQA,EAAQvE,OAAS,KAAO0vD,EAAG2B,OACrC9sD,EAAQvE,QAAU,EACTuE,EAAQA,EAAQvE,OAAS,KAAO0vD,EAAG6B,SAC5ChtD,EAAQvE,QAAU,GAItB,KAAI,OAAA4tE,EAAChS,IAAAgS,EAAKtjE,OAAUywB,KAAKojC,aAAa,MACpC,OAAO7d,MAAMgoB,oBAAoBn3D,GAMnC0yC,EAAQA,GAAS9oB,KAAK8oB,MAAMuM,QAE5B,MAAMpiB,EAAQjT,KAAK+sC,UAASiG,IAAS,IAAA/C,EAAAyV,EAEnCxnB,EAAiBl+B,KAAKy6C,wBACtB,MAAMhO,EAAOlnB,MAAMgoB,oBAAoBn3D,GAcvC,OAXgB,4BAAdq2D,EAAK3lE,MAAL,OAAAmpE,EACAxD,EAAK5P,QAALoT,EAAY1S,gBAEZyV,IAIoC,KAApB,OAAd0S,EAAAxnB,QAAA,EAAAwnB,EAAgBnvE,OAAOtR,SACzB+6B,KAAKmzC,2BAA2B1G,EAAMvO,GAExCuO,EAAKvO,eAAiBA,EACfuO,IACN3jB,GAEH,IAAK7V,EAAM1jC,QAAU0jC,EAAMogC,QAAS,OAAOpgC,EAAMhsC,KAEjD,IAAK45D,IAIHhoC,IAAQmH,KAAKk7B,UAAU,QAIvBuqB,EAAWzlD,KAAK+sC,UAAS,IAAMxnB,MAAMgoB,oBAAoBn3D,IAAO0yC,IAE3D28B,EAASl2E,OAAO,OAAOk2E,EAASx+E,KAGvC,GAAA,OAAA6rE,EAAIjS,IAAAiS,EAAK7rE,KAGP,OADA+4B,KAAK8oB,MAAQ+X,EAAImM,UACVnM,EAAI55D,KAGb,GAAIgsC,EAAMhsC,KAGR,OADA+4B,KAAK8oB,MAAQ7V,EAAM+5B,UACZ/5B,EAAMhsC,KAGf,GAAA,OAAAo+E,EAAII,IAAAJ,EAAUp+E,KAGZ,OADA+4B,KAAK8oB,MAAQ28B,EAASzY,UACfyY,EAASx+E,KAGlB,GAAA,OAAA8rE,EAAIlS,IAAAkS,EAAKQ,OAAQ,MAAM1S,EAAItxD,MAC3B,GAAI0jC,EAAMsgC,OAAQ,MAAMtgC,EAAM1jC,MAC9B,GAAA,OAAA+1E,EAAIG,IAAAH,EAAU/R,OAAQ,MAAMkS,EAASl2E,MAErC,MAAS,OAAHg2E,EAAA1kB,QAAA,EAAA0kB,EAAKh2E,QAAS0jC,EAAM1jC,QAApB,OAAAi2E,EAA6BC,QAA7B,EAA6BD,EAAUj2E,OAI/CuuE,gBAAgBve,GACd,OAAKv/B,KAAKk7B,UAAU,QAAUl7B,KAAKojC,aAAa,KACvCpjC,KAAK2/C,uBAELp6B,MAAMu4B,gBAAgBve,GAIjCiU,WAAWvsE,GACT,GAAI+4B,KAAK1iB,MAAMmkC,EAAG7O,OAAQ,CAIxB,MAAMhoC,EAASo1B,KAAK+sC,UAASiG,IAC3B,MAAMtxD,EAAase,KAAKg7C,qCACtBv5B,EAAG7O,OAGL,OADI5S,KAAKurC,sBAAyBvrC,KAAK1iB,MAAMmkC,EAAGxO,QAAQ+/B,IACjDtxD,KAGT,GAAI9W,EAAOyoE,QAAS,OAEfzoE,EAAO2oE,SACN3oE,EAAO2E,QAAOywB,KAAK8oB,MAAQl+C,EAAOoiE,WACtC/lE,EAAKya,WAAa9W,EAAO3D,MAI7B,OAAOs+C,MAAMiuB,WAAWvsE,GAI1BiqE,6BAA6BrF,GACvB7rC,KAAK8hC,IAAIrgB,EAAG1O,YAEG,eAAf84B,EAAM/kE,MACLk5B,KAAK8oB,MAAM2K,kBACXzzB,KAAK8oB,MAAMuK,QAEZrzB,KAAK0jB,MAAMmoB,EAAM72D,MAAO8iD,GAAS+B,mBAGjCgS,EAA2BjM,UAAW,GAE1C,MAAM94D,EAAOk5B,KAAKw7C,2BAIlB,OAHI10E,IAAM+kE,EAAM3G,eAAiBp+D,GACjCk5B,KAAKmlC,iBAAiB0G,GAEfA,EAGTrM,aAAav4D,EAAcw4D,GAAiB,GAC1C,OAAQx4D,EAAKH,MACX,IAAK,uBACH,OAAOy+C,MAAMia,aAAax/B,KAAKisC,oBAAoBhlE,GAAOw4D,GAC5D,IAAK,sBACH,OAAOla,MAAMia,aAAav4D,EAAMw4D,GAClC,IAAK,0BACH,OAAOz/B,KAAK2lD,oCAAoC1+E,EAAMw4D,GACxD,IAAK,iBACL,IAAK,sBACL,IAAK,kBAEH,OADAx4D,EAAKilB,WAAa8T,KAAKw/B,aAAav4D,EAAKilB,WAAYuzC,GAC9Cx4D,EACT,QACE,OAAOs+C,MAAMia,aAAav4D,EAAMw4D,IAItCkmB,oCAAoC1+E,EAAcw4D,GAChD,OAAQx4D,EAAKilB,WAAWplB,MACtB,IAAK,iBACL,IAAK,sBACL,IAAK,kBACL,IAAK,0BAEH,OADAG,EAAKilB,WAAa8T,KAAKw/B,aAAav4D,EAAKilB,WAAYuzC,GAC9Cx4D,EACT,QACE,OAAOs+C,MAAMia,aAAav4D,EAAMw4D,IAItC4Q,UACE5D,EACA8E,KACGn7D,GAGG,IAAAwvE,EACN,OAAQnZ,EAAK3lE,MACX,IAAK,uBAIH,OACF,IAAK,sBAEH,YADAk5B,KAAKqwC,UAAU5D,EAAKyW,UAAW,wBAAyB9sE,GAE1D,IAAK,iBACL,IAAK,kBACH,KACmBA,EAAK,IACC,6BAAvBm7D,GACA,OAAAqU,EAACnZ,EAAK5P,QAAL+oB,EAAYroB,eACb,CACAv9B,KAAK0jB,MAAM+oB,EAAKz3D,MAAOmwC,EAAOjK,WAAYq2B,GAC1C,MAGF,YADAvxC,KAAKqwC,UAAU5D,EAAKvgD,WAAY,8BAA+B9V,GAEjE,IAAK,sBAEH,YADA4pB,KAAKqwC,UAAU5D,EAAKvgD,WAAYqlD,KAAuBn7D,GAEzD,QAEE,YADAmvC,MAAM8qB,UAAU5D,EAAM8E,KAAuBn7D,IAKnDk8D,mBACE,OAAQtyC,KAAK8oB,MAAMhiD,MACjB,KAAK26C,EAAGzL,MAEN,OAAOhW,KAAK6kC,iBAA8B,GAC5C,QACE,OAAOtf,MAAM+sB,oBAInBuT,6BAA6BpZ,GAC3B,GAAIzsC,KAAKojC,aAAa,KAAM,CAC1B,MAAMgR,EAAgBp0C,KAAKw5C,uBAE3B,GAAIx5C,KAAK1iB,MAAMmkC,EAAG/O,QAAS,CACzB,MAAM9U,EAAO2nB,MAAMsgC,6BAA6BpZ,GAEhD,OADA7uC,EAAKsgC,eAAiBkW,EACfx2C,EAGToC,KAAK4hC,WAAW5hC,KAAK8oB,MAAM9zC,MAAOysC,EAAG/O,QAGvC,OAAO6S,MAAMsgC,6BAA6BpZ,GAG5CqZ,oBAAoB9lE,GAEhBggB,KAAK8oB,MAAM2K,kBACXzzB,KAAK1iB,MAAMmkC,EAAG75B,QACdoY,KAAK69C,sBAAwB79D,EAE7BggB,KAAK5iB,OAELmoC,MAAMugC,oBAAoB9lE,GAS9BswD,gBACE,OAAOtwC,KAAKojC,aAAa,MAAQ7d,MAAM+qB,gBAGzCC,kBACE,OACEvwC,KAAK1iB,MAAMmkC,EAAG/N,OAAS1T,KAAK1iB,MAAMmkC,EAAG7O,QAAU2S,MAAMgrB,kBAIzDY,qBAAqB/6D,GACnB,MAAMnP,EAAOs+C,MAAM4rB,qBAAqB/6D,GAaxC,MAVgB,sBAAdnP,EAAKH,MACLG,EAAKi+D,gBACLj+D,EAAKkiB,MAAMnU,MAAQ/N,EAAKi+D,eAAelwD,OAEvCgrB,KAAK0jB,MACHz8C,EAAKi+D,eAAelwD,MACpB8iD,GAASuC,2BAINpzD,EAITk6D,iBAAiB9rI,GACf,OACE2qG,KAAK8oB,MAAMuK,QACN,KAAJh+H,GAAsC,KAAJA,EAI5BkwH,MAAM4b,iBAAiB9rI,GAFvB2qG,KAAKyvC,SAAShuB,EAAGrN,WAAY,GAOxC4vC,eACE,GAAIhkD,KAAK1iB,MAAMmkC,EAAGrN,YAAa,CAC7B,MAAM/+G,EAAO2qG,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAM9zC,OACtC,KAAJ3/E,GAAmC,KAAJA,IACjC2qG,KAAK8oB,MAAMlxC,KAAO,EAClBooB,KAAK+lD,gBAAgB1wJ,KAK3B24I,iBAAiB6B,GACf,IAAK,IAAI1oE,EAAI,EAAGA,EAAI0oE,EAAS5qE,OAAQkC,IAAK,CACxC,MAAMslE,EAAOoD,EAAS1oE,GACtB,GAAKslE,EACL,OAAQA,EAAK3lE,MACX,IAAK,uBACH+oE,EAAS1oE,GAAK64B,KAAKisC,oBAAoBQ,GACvC,MACF,IAAK,iBACL,IAAK,kBACEzsC,KAAK8oB,MAAMqK,uBAGdnzB,KAAK0jB,MAAM+oB,EAAKz3D,MAAO8iD,GAAS4C,+BAFhCmV,EAAS1oE,GAAK64B,KAAKisC,oBAAoBQ,IAO/C,OAAOlnB,MAAMyoB,oBAAoB33D,WAGnC41D,oBAAoBhlE,GASlB,OARAA,EAAKilB,WAAWg5C,eAAiBj+D,EAAKi+D,eAEtCllC,KAAKmlC,iBACHl+D,EAAKilB,WACLjlB,EAAKi+D,eAAelgE,IACpBiC,EAAKi+D,eAAe59D,IAAItC,KAGnBiC,EAAKilB,WAGdunD,mBACE,OAAOzzC,KAAK1iB,MAAMmkC,EAAG7O,QAAU2S,MAAMkuB,mBAGvCd,wBACE,OAAO3yC,KAAK1iB,MAAMmkC,EAAG7O,QAAU2S,MAAMotB,wBAGvCqT,0BAEE,OAAOzgC,MAAMygC,2BAA6BhmD,KAAKqkD,kBAGjD1hB,gCACE17D,GAEA,GAAI+4B,KAAKojC,aAAa,KAAM,CAC1B,MAAMgR,EAAgBp0C,KAAK2hD,oBAAmB,IAC5C3hD,KAAKw5C,yBAEHpF,IAAentE,EAAKi3D,eAAiBkW,GAE3C,OAAO7uB,MAAMod,gCAAgC17D,GAG/Cg/E,kCACE7oB,GAEA,MAAM8oB,EAAY3gC,MAAM0gC,kCAAkC7oB,GAEpD+oB,EADSnmD,KAAKm9B,6BAA6BC,GACvB,GAG1B,OAFwB+oB,GAAcnmD,KAAKywC,YAAY0V,GAE9BD,EAAY,EAAIA,EAG3CE,wBACE,MAAMva,EAAQtmB,MAAM6gC,wBACdt/E,EAAOk5B,KAAKw7C,2BAOlB,OALI10E,IACF+kE,EAAM3G,eAAiBp+D,EACvBk5B,KAAKmlC,iBAAiB0G,IAGjBA,EAGTkW,mBAAsB1B,GACpB,MAAMgG,EAAsBrmD,KAAK8oB,MAAM2K,iBACvCzzB,KAAK8oB,MAAM2K,kBAAmB,EAC9B,IACE,OAAO4sB,IADT,QAGErgD,KAAK8oB,MAAM2K,iBAAmB4yB,GAIlCpE,WAAuBh7E,KAAYmP,GACjC,MAAMkwE,EAAqBtmD,KAAK8oB,MAAM4K,gBACtC1zB,KAAK8oB,MAAM4K,kBAAqBzsD,EAAWm2E,SAC3C,IACE,OAAO73B,MAAM08B,WAAWh7E,KAASmP,GADnC,QAGE4pB,KAAK8oB,MAAM4K,gBAAkB4yB,GAIjC9D,2BACEv7E,GAEA,GAAI+4B,KAAK1iB,MAAMmkC,EAAGvL,QAEhB,OADAjvC,EAAKm2E,UAAW,EACTp9C,KAAKiiD,WACTh7E,GACiB,GACD,GAEd,GAAI+4B,KAAK2lC,aAAa,cAM3B,IAAK3lC,KAAKyiD,wBAOR,OANAx7E,EAAKm2E,UAAW,EAChBp9C,KAAK0jB,MACHz8C,EAAK+N,MACL8iD,GAAS4B,0CAEX15B,KAAK5iB,OACE4iB,KAAKkgD,4BACTj5E,QAIL+4B,KAAK4hC,WAAW,KAAMngB,EAAGvL,QAI7B+nB,eAAe7nD,GACb,MAAMgnD,EAAS7X,MAAM0Y,eAAe7nD,GACpC,GAAIgnD,EAAOggB,SAAU,CAInB,GAHgBp9C,KAAKk7B,UAAU,YACzBkC,EAAO1pI,MAAMuyE,OACbm3D,EAAOn3D,KACA,CACX,MAAMjxE,IAAEA,GAAQooI,EAChBp9B,KAAK0jB,MACH0Z,EAAOpoD,MACP8iD,GAASC,gCACI,eAAb/iI,EAAI8xE,KACA9xE,EAAInC,KACH,IAAGmtG,KAAKhR,MAAM5pB,MAAMpwE,EAAIggF,MAAOhgF,EAAIgwE,UAI9C,OAAOo4D,EAGTmpB,8BACE,QAASvmD,KAAKo7B,gBAAgB,aAAc,OAG9CnsD,QAIE,OAHI+wB,KAAKumD,gCACPvmD,KAAK8oB,MAAM2K,kBAAmB,GAEzBlO,MAAMt2C,QAGfu3E,gBAIE,OAHIxmD,KAAKumD,gCACPvmD,KAAK8oB,MAAM2K,kBAAmB,GAEzBlO,MAAMihC,kBEr9FjBC,YEtJc/qB,GACd,cAAcA,EACZgrB,mBACE,GAAI1mD,KAAK1iB,MAAMmkC,EAAGlN,QAAS,CACzB,MAAMoyC,EAAmB3mD,KAAK8oB,MAAM9zC,MAE9B/N,EAAO+4B,KAAK4+B,YAElB,GADA5+B,KAAK8hC,IAAIrgB,EAAGlN,QACRvU,KAAK1iB,MAAMmkC,EAAG5uH,MAAO,CACvB,MAAMA,EAAOmtG,KAAKq6C,oBAAoBr6C,KAAK8oB,MAAM9zC,OAC3C+O,EAAaic,KAAKorC,iBAAiBnkE,EAAMp0E,GAE/C,GADAkxF,EAAWjd,KAAO,wBACdk5B,KAAK1iB,MAAMmkC,EAAG/O,QAChB,OAAO3uB,EAGXic,KAAK4hC,WAAW+kB,IAQpBxkB,gBACE,OAAOniC,KAAK0mD,oBAAsBnhC,MAAM4c,iBAAiB9rD,aF8H7DuwE,aDlGclrB,GACd,cAAcA,EACZmrB,iBACEC,GAEA,GAAI9mD,KAAK1iB,MAAMmkC,EAAGsZ,aAAc,CAC9B,MAAM9zD,EAAO+4B,KAAK4+B,YAUlB,OATA5+B,KAAK5iB,OACL4iB,KAAK+mD,cAAc,oCAInB9/E,EAAKp0E,KAAO0yH,MAAMsf,iBAA8B,GAEhD7kC,KAAK+mD,cAAc,oCACnB/mD,KAAKuiC,OAAO9gB,EAAGsZ,aACR/6B,KAAKgnD,kBAAkB//E,EAAM6/E,IAIxCE,kBACE//E,EACA6/E,GAEA,MAAMG,KAAgBhgF,EAAK6/E,cAA8B,gBAAd7/E,EAAKH,MAGhD,OAFAG,EAAK6/E,aAAeA,EAEbG,EAAahgF,EAAO+4B,KAAK8+B,WAAW73D,EAAM,eAOnDk6D,iBAAiB9rI,GACf,OACM,KAAJA,GACA,KAAA2qG,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAEhCooB,KAAKyvC,SAAShuB,EAAGsZ,YAAa,GAGhCxV,MAAM4b,oBAAoB9qD,WAOnC8rD,gBACE,OACEniC,KAAK6mD,iBAAiB,eAAiBthC,MAAM4c,iBAAiB9rD,WAIlEwuD,kBAKE,OACE7kC,KAAK6mD,iBAAiB,eACtBthC,MAAMsf,mBAAmBxuD,WAI7Bg8D,kBAAkB7vB,QAIH9sH,IAAT8sH,GAAoB+C,MAAM8sB,qBAAqBh8D,WAOrDi8D,mBACE,OACEtyC,KAAK6mD,iBAAiB,YAActhC,MAAM+sB,oBAAoBj8D,WAIlEg6D,UAAU5D,GACU,gBAAdA,EAAK3lE,MAAwBy+C,MAAM8qB,aAAah6D,WAGtDmpD,aAAav4D,GACX,OACEA,GACc,gBAAdA,EAAKH,MACiB,eAAtBG,EAAK6/E,cAEL7/E,EAAK6/E,aAAe,UACb7/E,GAEFs+C,MAAMia,gBAAgBnpD,WAO/BmwD,MAAMh9D,GACJ,GAAI+7C,MAAMihB,MAAMh9D,GACd,OAAO,EAKT,IAAKw2B,KAAK2lC,aAAa,OACrB,OAAO,EAET,GAAIn8D,EAAS,OAAO,EAKpB,OADkBw2B,KAAKopC,YACTtiE,OAAS26C,EAAGsZ,YAO5BmsB,oBAAoBjgF,GACdA,EAAK8pC,OAA6B,gBAApB9pC,EAAK8pC,MAAMjqC,MAC7By+C,MAAM2hC,uBAAuB7wE,WAG/Bm2D,yBACEvlE,EACAwlE,GAEA,GACgB,gBAAdA,EAAK3lE,MACJ2lE,EAAK5P,OAAS4P,EAAK5P,MAAMU,cAE1B,OAAOhY,MAAMinB,4BAA4Bn2D,WAG3C,GAAI2pB,KAAK1iB,MAAMmkC,EAAG7O,OAAQ,CACxB,MAAM+pB,EAA2B11D,EAIjC,OAHA01D,EAAK5rB,MAAQ/Q,KAAKgnD,kBAAkBva,EAAM,cAC1CzsC,KAAK5iB,OACLu/C,EAAK12D,KAAO+5B,KAAKqsC,eAAe,SACzBrsC,KAAK8+B,WAAWnC,EAAM,oBAM/B,OAHA38B,KAAKolC,YAELn+D,EAAKp0E,KAAO45I,EAAK55I,KACVmtG,KAAKgnD,kBAAkB//E,EAAM,aAGtCkgF,aACE,OACEnnD,KAAK6mD,iBAAiB,mBACtBthC,MAAM4hC,cAAc9wE,WAIxB+wE,kBACE,OACEpnD,KAAK6mD,iBAAiB,eACtBthC,MAAM6hC,mBAAmB/wE,WAI7B4rE,WACEh7E,EACA+nE,EACAC,GAEA,MAAMnoE,EAAOkoE,EAAc,mBAAqB,kBAEhDhvC,KAAK5iB,OACL4iB,KAAKqnD,eAAepgF,GACpB,MAAMqgF,EAAYtnD,KAAK8oB,MAAM6J,OAEvBoI,EAAc/6B,KAAK6mD,iBAAiB,cAC1C,GAAI9rB,EACF,GACE/6B,KAAK1iB,MAAMmkC,EAAGtL,WACdnW,KAAK1iB,MAAMmkC,EAAGsZ,cACd/6B,KAAK1iB,MAAMmkC,EAAGpP,QAEdprC,EAAKgd,GAAK82C,MACL,CAAA,GAAIkU,IAAeD,EAGxB,OAFA/nE,EAAKgd,GAAK,KACVhd,EAAKhB,KAAO+5B,KAAKgnD,kBAAkBjsB,EAAa,aACzC/6B,KAAK8+B,WAAW73D,EAAMH,GAE7Bk5B,KAAK4hC,WAAW,KAAM5G,GAAkBC,0BAG1Cj7B,KAAK+uC,aAAa9nE,EAAM+nE,EAAaC,GAOvC,OAJAjvC,KAAK2wC,gBAAgB1pE,GACrBA,EAAKhB,KACH+5B,KAAK6mD,iBAAiB,cACtB7mD,KAAKunD,iBAAiBtgF,EAAKy0D,WAAY4rB,GAClCtnD,KAAK8+B,WAAW73D,EAAMH,GAG/Bk5D,YAAY/4D,GACV,MAAM8zD,EAAc/6B,KAAK6mD,iBAAiB,cAC1C,IAAK9rB,EAAa,OAAOxV,MAAMya,eAAe3pD,WAE9C,IAAK2pB,KAAK2lC,aAAa,UAAY3lC,KAAK1iB,MAAMmkC,EAAG75B,OAK/C,OAHA3gB,EAAKi5D,WAAa,GAClBj5D,EAAK8N,OAAS,KACd9N,EAAKq/D,YAActmC,KAAKgnD,kBAAkBjsB,EAAa,eAChD/6B,KAAK8+B,WAAW73D,EAAM,0BAI/B+4B,KAAKwnD,aAAa,qBAClB,MAAMlW,EAAYtxC,KAAK4+B,YAIvB,OAHA0S,EAAUrR,SAAWlF,EACrB9zD,EAAKi5D,WAAa,CAAClgC,KAAK8+B,WAAWwS,EAAW,2BAEvC/rB,MAAMya,YAAY/4D,GAG3B0lE,2BACE,GAAI3sC,KAAK1iB,MAAMmkC,EAAGzM,UAAW,CAC3B,MAAM53B,EAAO4iB,KAAKu3C,iBAClB,GAAIv3C,KAAKynD,qBAAqBrqE,EAAM,SAEhC4iB,KAAKhR,MAAM7S,WACTslC,EAAGsZ,YAAYhqB,MACf/Q,KAAK0nD,oBAAoBtqE,EAAO,IAGlC,OAAO,EAIb,OAAOmoC,MAAMonB,2BAGfgb,iCAAiC1gF,GAC/B,SAAIA,EAAKi5D,YAAcj5D,EAAKi5D,WAAWj7D,OAAS,IAIzCsgD,MAAMoiC,oCAAoCtxE,WAGnDuxE,YAAY3gF,GACV,MAAMi5D,WAAEA,GAAej5D,EACvB,MAAIi5D,GAAAA,EAAYj7D,SACdgC,EAAKi5D,WAAaA,EAAWnyD,QAC3B9G,GAA+B,gBAAvBA,EAAKg5D,SAASn5D,QAG1By+C,MAAMqiC,YAAY3gF,GAClBA,EAAKi5D,WAAaA,EAGpBiG,YACEl/D,GAEA,MAAM8zD,EAAc/6B,KAAK6mD,iBAAiB,cAC1C,IAAK9rB,EAAa,OAAOxV,MAAM4gB,eAAe9vD,WAI9C,GAFApP,EAAKi5D,WAAa,IAEblgC,KAAK2lC,aAAa,UAAY3lC,KAAK1iB,MAAMmkC,EAAG75B,OAI/C,OAFA3gB,EAAK8N,OAASirB,KAAKgnD,kBAAkBjsB,EAAa,iBAClD/6B,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,qBAI/B,MAAMqqE,EAAYtxC,KAAKygC,gBAAgB1F,GAKvC,GAJAuW,EAAUE,MAAQzW,EAClB/6B,KAAK8+B,WAAWwS,EAAW,0BAC3BrqE,EAAKi5D,WAAWp1D,KAAKwmE,GAEjBtxC,KAAK8hC,IAAIrgB,EAAG75B,OAAQ,CAEAoY,KAAK6nD,8BAA8B5gF,IAGrC+4B,KAAK8nD,2BAA2B7gF,GAMtD,OAHA+4B,KAAKukC,iBAAiB,QACtBt9D,EAAK8N,OAASirB,KAAK+nD,oBACnB/nD,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,qBAG/B8gF,oBAGE,OACE/nD,KAAK6mD,iBAAiB,kBACtBthC,MAAMwiC,qBAAqB1xE,cC1MtB2xE,GACXx0J,OAAOW,KAAKqnI,IGrIDysB,GAA0B,CAErC/yB,WAAY,SAEZgzB,oBAAgBxyJ,EAGhBy/H,UAAW,EAGXgzB,2BAA2B,EAG3BC,4BAA4B,EAG5BC,6BAA6B,EAE7BC,yBAAyB,EAEzBC,wBAAwB,EAExBp9D,QAAS,GAET8pC,WAAY,KASZuzB,QAAQ,EAERC,QAAQ,EAGRC,gCAAgC,EAGhCC,eAAe,UCnEjB,SAAiBtzJ,GACf,OAAOA,GAAI,IAAcA,GAAI,IAsB/B,MAAMuzJ,GAAoB,IAAIjqE,IAAI,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,MAK3DkqE,GAAoC,CACxCC,UAAW,CAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,KAUX9iF,IAAK,CAAA,GAAA,GAAA,GAAA,MAQD+iF,GAAkC,CACxCA,IAAsC,CAAA,GAAA,KAKtCA,GAAgCC,IAAM,IAEjCD,GAAgCE,IAFC,GAAA,GAAA,GAAA,GAAA,GAAA,IAWtCF,GAAgCG,IAAM,IAEjCH,GAAgCC,IAFC,GAAA,IAQtCD,GAAgC/iF,IAAM,IAEjC+iF,GAAgCG,IAFC,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,KAuB/B,MAAMC,GACXx8C,YAAYmc,GACV9oB,KAAKl5B,KAAOgiD,EAAMhiD,KAClBk5B,KAAKtsG,MAAQo1H,EAAMp1H,MACnBssG,KAAKhrB,MAAQ8zC,EAAM9zC,MACnBgrB,KAAKh7B,IAAM8jD,EAAM9jD,IACjBg7B,KAAK14B,IAAM,IAAIgwC,EAAewR,EAAM+J,SAAU/J,EAAMgK,SC5FjD,MAAMs2B,GAAWvyJ,cAAAmpG,KAEtBqpD,aAA4B,IAAI1qE,IAFVqhB,KAKtBspD,cAAgD,IAAItmE,IAL9Bgd,KAStB6jB,sBAA6C,IAAI7gC,KAGpC,MAAMumE,GAKnB58C,YAAY+W,GAAsB1jB,KAJlCwX,MAA2B,GAIOxX,KAFlC6jB,sBAA6C,IAAI7gC,IAG/Cgd,KAAK0jB,MAAQA,EAGfgsB,UACE,OAAO1vC,KAAKwX,MAAMxX,KAAKwX,MAAMvyC,OAAS,GAGxC0/C,QACE3kB,KAAKwX,MAAM1sC,KAAK,IAAIs+E,IAGtBxkC,OACE,MAAM4kC,EAAgBxpD,KAAKwX,MAAMv5B,MAK3ByxD,EAAU1vC,KAAK0vC,UAGrB,IAAK,MAAO78I,EAAM+kF,KAAQimB,MAAM4rD,KAAKD,EAAc3lC,uBAC7C6rB,EACGA,EAAQ7rB,sBAAsB9kC,IAAIlsF,IACrC68I,EAAQ7rB,sBAAsBpiC,IAAI5uF,EAAM+kF,GAG1CooB,KAAK0jB,MAAM9rC,EAAKutC,EAAO3J,8BAA+B3oH,GAK5D62J,mBACE72J,EACA24I,EACA5zD,GAEA,MAAM+xE,EAAa3pD,KAAK0vC,UACxB,IAAIka,EAAYD,EAAWN,aAAatqE,IAAIlsF,GAE5C,GhBkBuCg3J,EgBlBnCre,EAA2C,CAC7C,MAAMse,EAAWF,GAAaD,EAAWL,cAAc9nE,IAAI3uF,GAC3D,GAAIi3J,EAAU,CACZ,MAAMC,EhBY2B,EgBZfD,EACZE,EhBW2B,EgBXfxe,EAQlBoe,GhBMmCC,EgBZnBC,MhBYmBD,EgBXnBre,IAKmBue,IAAcC,EAE5CJ,GAAWD,EAAWL,cAAc7lE,OAAO5wF,QACtC+2J,GACVD,EAAWL,cAAc7nE,IAAI5uF,EAAM24I,GAInCoe,GACF5pD,KAAK0jB,MAAM9rC,EAAKutC,EAAOtH,yBAA0BhrH,GAGnD82J,EAAWN,aAAarqE,IAAInsF,GAC5B82J,EAAW9lC,sBAAsBpgC,OAAO5wF,GAG1Co3J,eAAep3J,EAAc+kF,GAC3B,IAAI+xE,EACJ,IAAKA,KAAc3pD,KAAKwX,MACtB,GAAImyC,EAAWN,aAAatqE,IAAIlsF,GAAO,OAGrC82J,EACFA,EAAW9lC,sBAAsBpiC,IAAI5uF,EAAM+kF,GAG3CooB,KAAK0jB,MAAM9rC,EAAKutC,EAAO3J,8BAA+B3oH,IChD5D,MAAMq3J,GAGJv9C,YAAY7lC,EAVM,GAUmCk5B,KAFrDl5B,UAEqD,EACnDk5B,KAAKl5B,KAAOA,EAGdqjF,iCACE,OAbqC,IAcnCnqD,KAAKl5B,MAfyB,IAgB9Bk5B,KAAKl5B,KAITsjF,kCACE,OAnBsB,IAmBfpqD,KAAKl5B,MAIhB,MAAMujF,WAA8BH,GAElCv9C,YAAY7lC,GACVy+C,MAAMz+C,GADiBk5B,KADzB+yB,OAA6D,IAAI/vC,IAIjEsnE,uBAAuB1yE,EAAaljF,GAClCsrG,KAAK+yB,OAAOtxC,IAAI7J,EAAKljF,GAEvB61J,sBAAsB3yE,GACpBooB,KAAK+yB,OAAOtvC,OAAO7L,GAErB4yE,cAAcC,GACZzqD,KAAK+yB,OAAO3+H,QAAQq2J,IAIT,MAAMC,GAGnB/9C,YAAY+W,GAAsB1jB,KAFlCwX,MAAgC,CAAC,IAAI0yC,IAGnClqD,KAAK0jB,MAAQA,EAEfiB,MAAME,GACJ7kB,KAAKwX,MAAM1sC,KAAK+5C,GAGlBD,OACE5kB,KAAKwX,MAAMv5B,MAab0sE,gCAAgC/yE,EAAaljF,GAC3C,MAAM8iH,MAAEA,GAAUxX,KAClB,IAAI74B,EAAIqwC,EAAMvyC,OAAS,EACnB4/C,EAAyBrN,EAAMrwC,GACnC,MAAQ09C,EAAMulC,mCAAmC,CAC/C,IAAIvlC,EAAMslC,iCAMR,OAJAtlC,EAAMylC,uBAAuB1yE,EAAKljF,GAMpCmwH,EAAQrN,IAAQrwC,GAGlB64B,KAAK0jB,MAAM9rC,EAAKljF,GAwBlBk2J,mCACEhzE,EACAljF,GAEA,MAAM8iH,MAAEA,GAAUxX,KACZ6kB,EAAyBrN,EAAMA,EAAMvyC,OAAS,GACpD,GAAI4/C,EAAMulC,kCACRpqD,KAAK0jB,MAAM9rC,EAAKljF,OACX,CAAA,IAAImwH,EAAMslC,iCAIf,OAFAtlC,EAAMylC,uBAAuB1yE,EAAKljF,IAetCm2J,gCAAgCjzE,EAAaljF,GAC3C,MAAM8iH,MAAEA,GAAUxX,KAClB,IAAI74B,EAAIqwC,EAAMvyC,OAAS,EACnB4/C,EAAyBrN,EAAMrwC,GACnC,KAAO09C,EAAMslC,kCArIwB,IAsI/BtlC,EAAM/9C,MAER+9C,EAAMylC,uBAAuB1yE,EAAKljF,GAEpCmwH,EAAQrN,IAAQrwC,GAIpB2jF,oBACE,MAAMtzC,MAAEA,GAAUxX,KACZykB,EAAejN,EAAMA,EAAMvyC,OAAS,GACrCw/C,EAAa0lC,kCAElB1lC,EAAa+lC,eAAc,CAAC91J,EAAUkjF,KAEpCooB,KAAK0jB,MAAM9rC,EAAKljF,GAEhB,IAAIyyE,EAAIqwC,EAAMvyC,OAAS,EACnB4/C,EAAQrN,EAAMrwC,GAClB,KAAO09C,EAAMslC,kCAEXtlC,EAAM0lC,sBAAsB3yE,GAC5BitC,EAAQrN,IAAQrwC,OAkBjB,SAAS4jF,KACd,OAAO,IAAIb,GCoLN,MAAMc,GAAiBn0J,cAAAmpG,KAC5BirD,iBAAmB,EADSjrD,KAE5BkrD,aAAe,GC/YjB,MAAMC,GACJx+C,YAAYv9B,EAAgBwI,EAAatQ,GAAe04B,KASxDl5B,UATwD,EAAAk5B,KAUxDhrB,WAVwD,EAAAgrB,KAWxDh7B,SAXwD,EAAAg7B,KAYxD14B,SAZwD,EAAA04B,KAaxDrQ,WAbwD,EAAAqQ,KAcxDm0B,qBAdwD,EAAAn0B,KAexDk0B,sBAfwD,EAAAl0B,KAgBxDorD,mBAhBwD,EAAAprD,KAiBxD68B,WAjBwD,EACtD78B,KAAKl5B,KAAO,GACZk5B,KAAKhrB,MAAQ4C,EACbooB,KAAKh7B,IAAM,EACXg7B,KAAK14B,IAAM,IAAIgwC,EAAehwC,GAC9B,MAAI8H,GAAAA,EAAQz6E,QAAQ6zJ,SAAQxoD,KAAKrQ,MAAQ,CAAC/X,EAAK,IAC/C,MAAIxI,GAAAA,EAAQ8S,WAAU8d,KAAK14B,IAAI4a,SAAW9S,EAAO8S,UAanDgwD,UAEE,MAAMlQ,EAAe,IAAImpB,GACnBh3J,EAAOX,OAAOW,KAAK6rG,MACzB,IAAK,IAAI74B,EAAI,EAAGlC,EAAS9wE,EAAK8wE,OAAQkC,EAAIlC,EAAQkC,IAAK,CACrD,MAAMnyE,EAAMb,EAAKgzE,GAGP,oBAARnyE,GACQ,qBAARA,GACQ,kBAARA,IAGAgtI,EAAQhtI,GAAOgrG,KAAKhrG,IAIxB,OAAOgtI,GCnBX,MAAMqpB,GAAiCpkF,GAChB,4BAAdA,EAAKH,KACRukF,GAA8BpkF,EAAKilB,YACnCjlB,ECON,MAAMqkF,GAAY,CAAEzsB,KAAM,QACxB0sB,GAAc,CAAE1sB,KAAM,UAOlB2sB,GAAgB,mBAEhBC,GAA4B,mBCpCnB,MAAMC,WDgFN,cE3BA,cH/BA,cDiBR,cDpBQ,cHmFA,cpB1DA,cHtBA,cgCvBA,MAAiB70J,cAAAmpG,KAa9B2rD,mBAA6B,EAbC3rD,KAc9B4rD,6BAAuC,EASvC1wB,UAAUroI,GACR,OAAOmtG,KAAK7U,QAAQpM,IAAIlsF,GAG1BuoI,gBAAgBD,EAAgBtoI,GAE9B,GAAImtG,KAAKk7B,UAAUC,GAAS,OAAOn7B,KAAK7U,QAAQ3J,IAAI25C,GAAQtoI,KhCL9DkxI,WAAWC,GACLhkC,KAAK9d,WAAU8hD,EAAQ18D,IAAI4a,SAAW8d,KAAK9d,UAC/C8d,KAAK8oB,MAAMoL,iBAAiBppD,KAAKk5D,GACjChkC,KAAK8oB,MAAMqL,gBAAgBrpD,KAAKk5D,GAGlC6nB,iCACE5kF,EACA8O,EASA+1E,GAEA,GAA0C,IAAtC9rD,KAAK8oB,MAAMqL,gBAAgBlvD,OAC7B,OAGF,IAAI8mF,EAAc,KACd5kF,EAAI4O,EAAS9Q,OACjB,KAAuB,OAAhB8mF,GAAwB5kF,EAAI,GACjC4kF,EAAch2E,IAAW5O,GAE3B,GAAoB,OAAhB4kF,EACF,OAGF,IAAK,IAAIz6D,EAAI,EAAGA,EAAI0O,KAAK8oB,MAAMqL,gBAAgBlvD,OAAQqsB,IAEnD0O,KAAK8oB,MAAMqL,gBAAgB7iC,GAAGtsB,IAAMg7B,KAAK8oB,MAAMuL,oBAAoBrvD,MAEnEg7B,KAAK8oB,MAAMqL,gBAAgB1pD,OAAO6mB,EAAG,GACrCA,KAIJ,MAAM06D,EAAsB,GAC5B,IAAK,IAAI7kF,EAAI,EAAGA,EAAI64B,KAAK8oB,MAAMqL,gBAAgBlvD,OAAQkC,IAAK,CAC1D,MAAM8kF,EAAiBjsD,KAAK8oB,MAAMqL,gBAAgBhtD,GAC9C8kF,EAAejnF,IAAMiC,EAAKjC,KAC5BgnF,EAAoBlhF,KAAKmhF,GAGpBH,IACH9rD,KAAK8oB,MAAMqL,gBAAgB1pD,OAAOtD,EAAG,GACrCA,YAG4BzxE,IAA1BuxE,EAAKitD,mBACPjtD,EAAKitD,iBAAmB,IAE1BjtD,EAAKitD,iBAAiBppD,KAAKmhF,IAG3BH,IAAiB9rD,KAAK8oB,MAAMqL,gBAAkB,IAE9C63B,EAAoB/mF,OAAS,EAC/B8mF,EAAY73B,iBAAmB83B,OACWt2J,IAAjCq2J,EAAY73B,mBACrB63B,EAAY73B,iBAAmB,IAInCg4B,eAAejlF,GACb,GAAkB,YAAdA,EAAKH,MAAsBG,EAAKhB,KAAKhB,OAAS,EAAG,OAErD,MAAMuyC,EAAQxX,KAAK8oB,MAAMsL,aAEzB,IAAI7mC,EAAY0iB,EAAWikB,EAAkB/sD,EAAGmqB,EAEhD,GAAI0O,KAAK8oB,MAAMoL,iBAAiBjvD,OAAS,EAKnC+6B,KAAK8oB,MAAMoL,iBAAiB,GAAGl/C,OAAS/N,EAAKjC,KAC/CkvD,EAAmBl0B,KAAK8oB,MAAMoL,iBAC9Bl0B,KAAK8oB,MAAMoL,iBAAmB,IAQ9Bl0B,KAAK8oB,MAAMoL,iBAAiBjvD,OAAS,OAElC,GAAIuyC,EAAMvyC,OAAS,EAAG,CAC3B,MAAMknF,EAAcpwE,EAAKy7B,GAEvB20C,EAAYj4B,kBACZi4B,EAAYj4B,iBAAiB,GAAGl/C,OAAS/N,EAAKjC,MAE9CkvD,EAAmBi4B,EAAYj4B,wBACxBi4B,EAAYj4B,kBASvB,IAJI1c,EAAMvyC,OAAS,GAAK8W,EAAKy7B,GAAOxiC,OAAS/N,EAAK+N,QAChDuY,EAAaiqB,EAAMv5B,OAGdu5B,EAAMvyC,OAAS,GAAK8W,EAAKy7B,GAAOxiC,OAAS/N,EAAK+N,OACnDi7B,EAAYuH,EAAMv5B,MAQpB,IALKgyB,GAAa1iB,IAAY0iB,EAAY1iB,GAKtCA,EACF,OAAQtmB,EAAKH,MACX,IAAK,mBACHk5B,KAAK6rD,iCAAiC5kF,EAAMA,EAAKgP,YACjD,MACF,IAAK,gBACH+pB,KAAK6rD,iCAAiC5kF,EAAMA,EAAKgP,YAAY,GAC7D,MACF,IAAK,iBACH+pB,KAAK6rD,iCAAiC5kF,EAAMA,EAAKoP,WACjD,MACF,IAAK,kBACH2pB,KAAK6rD,iCAAiC5kF,EAAMA,EAAK8O,UACjD,MACF,IAAK,eACHiqB,KAAK6rD,iCAAiC5kF,EAAMA,EAAK8O,UAAU,QAI/DiqB,KAAK8oB,MAAMuL,sBAC+B,oBAAxCr0B,KAAK8oB,MAAMuL,oBAAoBvtD,MACjB,oBAAdG,EAAKH,MACoC,oBAAxCk5B,KAAK8oB,MAAMuL,oBAAoBvtD,MAChB,oBAAdG,EAAKH,OAETk5B,KAAK6rD,iCAAiC5kF,EAAM,CAC1C+4B,KAAK8oB,MAAMuL,sBAIf,GAAIpkB,GACF,GAAIA,EAAUkkB,gBACZ,GACElkB,IAAchpC,GACdgpC,EAAUkkB,gBAAgBlvD,OAAS,GACnC8W,EAAKk0B,EAAUkkB,iBAAiBnvD,KAAOiC,EAAK+N,MAE5C/N,EAAKktD,gBAAkBlkB,EAAUkkB,uBAC1BlkB,EAAUkkB,qBAKjB,IAAKhtD,EAAI8oC,EAAUkkB,gBAAgBlvD,OAAS,EAAGkC,GAAK,IAAKA,EACvD,GAAI8oC,EAAUkkB,gBAAgBhtD,GAAGnC,KAAOiC,EAAK+N,MAAO,CAClD/N,EAAKktD,gBAAkBlkB,EAAUkkB,gBAAgB1pD,OAAO,EAAGtD,EAAI,GAC/D,YAKH,GAAI64B,KAAK8oB,MAAMqL,gBAAgBlvD,OAAS,EAC7C,GAAI8W,EAAKikB,KAAK8oB,MAAMqL,iBAAiBnvD,KAAOiC,EAAK+N,MAAO,CACtD,GAAIgrB,KAAK8oB,MAAMuL,oBACb,IAAK/iC,EAAI,EAAGA,EAAI0O,KAAK8oB,MAAMqL,gBAAgBlvD,OAAQqsB,IAE/C0O,KAAK8oB,MAAMqL,gBAAgB7iC,GAAGtsB,IAC9Bg7B,KAAK8oB,MAAMuL,oBAAoBrvD,MAE/Bg7B,KAAK8oB,MAAMqL,gBAAgB1pD,OAAO6mB,EAAG,GACrCA,KAIF0O,KAAK8oB,MAAMqL,gBAAgBlvD,OAAS,IACtCgC,EAAKktD,gBAAkBn0B,KAAK8oB,MAAMqL,gBAClCn0B,KAAK8oB,MAAMqL,gBAAkB,QAE1B,CAYL,IAAKhtD,EAAI,EAAGA,EAAI64B,KAAK8oB,MAAMqL,gBAAgBlvD,UACrC+6B,KAAK8oB,MAAMqL,gBAAgBhtD,GAAGnC,IAAMiC,EAAK+N,OADI7N,KAUnD,MAAMgtD,EAAkBn0B,KAAK8oB,MAAMqL,gBAAgB/uD,MAAM,EAAG+B,GAExDgtD,EAAgBlvD,SAClBgC,EAAKktD,gBAAkBA,GAKzBD,EAAmBl0B,KAAK8oB,MAAMqL,gBAAgB/uD,MAAM+B,GACpB,IAA5B+sD,EAAiBjvD,SACnBivD,EAAmB,MAOzB,GAFAl0B,KAAK8oB,MAAMuL,oBAAsBptD,EAE7BitD,EACF,GACEA,EAAiBjvD,QACjBivD,EAAiB,GAAGl/C,OAAS/N,EAAK+N,OAClC+G,EAAKm4C,GAAkBlvD,KAAOiC,EAAKjC,IAEnCiC,EAAKmkF,cAAgBl3B,MAChB,CAEL,MAAMk4B,EAA4Bl4B,EAAiBr3B,WACjDmnC,GAAWA,EAAQh/D,KAAOiC,EAAKjC,MAG7BonF,EAA4B,GAC9BnlF,EAAKmkF,cAAgBl3B,EAAiB9uD,MACpC,EACAgnF,GAEFnlF,EAAKitD,iBAAmBA,EAAiB9uD,MACvCgnF,IAGFnlF,EAAKitD,iBAAmBA,EAK9B1c,EAAM1sC,KAAK7D,KGhObolF,uBAAuBz0E,GACrB,IAAItQ,EAOJ,OAN8BA,EAA1BsQ,IAAQooB,KAAK8oB,MAAM9zC,MAAagrB,KAAK8oB,MAAM+J,SACtCj7C,IAAQooB,KAAK8oB,MAAM2L,aAAoBz0B,KAAK8oB,MAAM0L,gBAClD58C,IAAQooB,KAAK8oB,MAAM9jD,IAAWg7B,KAAK8oB,MAAMgK,OACzCl7C,IAAQooB,KAAK8oB,MAAM4L,WAAkB10B,KAAK8oB,MAAMyL,cJ1BtD,SAAqBvlC,EAAejqB,GACzC,IAEIuY,EAFArI,EAAO,EACPq/C,EAAY,EAGhB,IADAvd,EAAWlb,UAAY,GACfve,EAAQy5B,EAAWzxC,KAAK0pB,KAAW1R,EAAM/X,MAAQR,GACvDkQ,IACAq/C,EAAYvd,EAAWlb,UAGzB,OAAO,IAAIub,EAASniC,EAAMlQ,EAASuvD,GIiBtBg4B,CAAYtsD,KAAKhR,MAAOpX,GAE5BtQ,EAGTo8C,MACE9rC,GACAviF,KAAEA,EAAF+rH,WAAQA,EAAR1sH,SAAoBA,MACjB6hF,GAEH,OAAOypB,KAAKusD,cAAc30E,EAAK,CAAEviF,KAAAA,EAAM+rH,WAAAA,GAAc1sH,KAAa6hF,GAepEi2E,eACE50E,GACAviF,KAAEA,EAAFX,SAAQA,MACL6hF,GAEH,MAAMjP,EAAM04B,KAAKqsD,uBAAuBz0E,GAClC+B,EACJjlF,EAASwkF,QAAQ,WAAW,CAACiC,EAAGhU,IAAcoP,EAAOpP,KACpD,KAAIG,EAAI2N,QAAQ3N,EAAI4N,UACvB,GAAI8qB,KAAKrrG,QAAQg0J,cAAe,CAC9B,MAAM51B,EAAS/yB,KAAK8oB,MAAMiK,OAC1B,IAAK,IAAI5rD,EAAI4rD,EAAO9tD,OAAS,EAAGkC,GAAK,EAAGA,IAAK,CAC3C,MAAMoI,EAAQwjD,EAAO5rD,GACrB,GAAIoI,EAAMqI,MAAQA,EAChB,OAAOpkF,OAAOiqG,OAAOluB,EAAO,CAAEoK,QAAAA,IACzB,GAAIpK,EAAMqI,IAAMA,EACrB,OAIN,OAAOooB,KAAKysD,OAAO,CAAEp3J,KAAAA,EAAMiyE,IAAAA,EAAKsQ,IAAAA,GAAO+B,GAGzC4yE,cACE30E,EACA80E,EAIArU,KACG9hE,GAEH,MAAMjP,EAAM04B,KAAKqsD,uBAAuBz0E,GAClC+B,EACJ0+D,EAAcn/D,QAAQ,WAAW,CAACiC,EAAGhU,IAAcoP,EAAOpP,KACzD,KAAIG,EAAI2N,QAAQ3N,EAAI4N,UACvB,OAAO8qB,KAAKysD,OAAOj5J,OAAOiqG,OAAQ,CAAEn2B,IAAAA,EAAKsQ,IAAAA,GAAgB80E,GAAO/yE,GAGlE8yE,OAAOE,EAA4BhzE,GAEjC,MAAM8f,EAAkC,IAAI5pB,YAAY8J,GAExD,GADAnmF,OAAOiqG,OAAOhE,EAAKkzD,GACf3sD,KAAKrrG,QAAQg0J,cAEf,OADK3oD,KAAK4sD,aAAa5sD,KAAK8oB,MAAMiK,OAAOjoD,KAAK2uB,GACvCA,EAEP,MAAMA,IoBZVkT,YAAYh4G,EAAkBq6F,GAC5Bu2B,QAD2CvlB,KAL7C4sD,iBAK6C,EAAA5sD,KAF7CyoD,OAAmC,GAIjCzoD,KAAK8oB,MAAQ,IAAI4J,GACjB1yB,KAAK8oB,MAAMkM,KAAKrgI,GAChBqrG,KAAKhR,MAAQA,EACbgR,KAAK/6B,OAAS+pB,EAAM/pB,OACpB+6B,KAAK4sD,aAAc,EAGrBC,UAAUt7C,GAGRvR,KAAKyoD,OAAOxjF,OAAS+6B,KAAK8oB,MAAMiM,aAChC/0B,KAAKyoD,OAAO39E,KAAKymC,KACfvR,KAAK8oB,MAAMiM,aAKf33C,OACE4iB,KAAK8sD,sBACD9sD,KAAKrrG,QAAQ8zJ,QACfzoD,KAAK6sD,UAAU,IAAI1D,GAAMnpD,KAAK8oB,QAGhC9oB,KAAK8oB,MAAM4L,WAAa10B,KAAK8oB,MAAM9jD,IACnCg7B,KAAK8oB,MAAM2L,aAAez0B,KAAK8oB,MAAM9zC,MACrCgrB,KAAK8oB,MAAMyL,cAAgBv0B,KAAK8oB,MAAMgK,OACtC9yB,KAAK8oB,MAAM0L,gBAAkBx0B,KAAK8oB,MAAM+J,SACxC7yB,KAAKy0C,YAKP3S,IAAIh7D,GACF,QAAIk5B,KAAK1iB,MAAMxW,KACbk5B,KAAK5iB,QACE,GAQXE,MAAMxW,GACJ,OAAOk5B,KAAK8oB,MAAMhiD,OAASA,EAU7Bw8D,qBAAqBxa,GACnB,MAAO,CACLlxC,IAAKkxC,EAAMlxC,IACXlkF,MAAO,KACPozE,KAAMgiD,EAAMhiD,KACZkO,MAAO8zC,EAAM9zC,MACbhQ,IAAK8jD,EAAM9jD,IACX0vD,WAAY5L,EAAM9jD,IAClBwE,QAAS,CAACw2B,KAAKwjC,cACfnQ,OAAQvK,EAAMuK,QAoBlB+V,YACE,MAAM2jB,EAAM/sD,KAAK8oB,MAGjB9oB,KAAK8oB,MAAQ9oB,KAAKsjC,qBAAqBypB,GAEvC/sD,KAAK4sD,aAAc,EACnB5sD,KAAKy0C,YACLz0C,KAAK4sD,aAAc,EAEnB,MAAMI,EAAOhtD,KAAK8oB,MAElB,OADA9oB,KAAK8oB,MAAQikC,EACNC,EAGTzV,iBACE,OAAOv3C,KAAK0nD,oBAAoB1nD,KAAK8oB,MAAMlxC,KAG7C8vE,oBAAoB9vE,GAClBs/B,EAAerb,UAAYjkB,EAG3B,OAAOA,EAFMs/B,EAAe5xC,KAAK06B,KAAKhR,OAEpB,GAAG/pB,OAGvB44E,oBACE,OAAO79C,KAAKhR,MAAM/W,WAAW+nB,KAAKu3C,kBAGpC0V,eAAer1E,GAKb,IAAI1R,EAAK85B,KAAKhR,MAAM/W,WAAWL,GAC/B,GAAsB,QAAZ,MAAL1R,MAA6B0R,EAAMooB,KAAKhR,MAAM/pB,OAAQ,CACzD,MAAMioF,EAAQltD,KAAKhR,MAAM/W,WAAWL,GACX,QAAZ,MAARs1E,KACHhnF,EAAK,QAAiB,KAALA,IAAe,KAAe,KAARgnF,IAG3C,OAAOhnF,EAMTinF,UAAUx6B,GACR3yB,KAAK8oB,MAAM6J,OAASA,EAChBA,IAKF3yB,KAAK8oB,MAAMgM,aAAa1gI,SAAQ,CAACulF,EAAS/B,IAExCooB,KAAK0jB,MAAM9rC,EAAK+B,KAElBqmB,KAAK8oB,MAAMgM,aAAas4B,SAI5B5pB,aACE,OAAOxjC,KAAK8oB,MAAMt/C,QAAQw2B,KAAK8oB,MAAMt/C,QAAQvE,OAAS,GAMxDwvE,YACE,MAAMjR,EAAaxjC,KAAKwjC,aACnBA,EAAWliB,eAAethB,KAAKqtD,YACpCrtD,KAAK8oB,MAAM9zC,MAAQgrB,KAAK8oB,MAAMlxC,IACzBooB,KAAK4sD,cAAa5sD,KAAK8oB,MAAM+J,SAAW7yB,KAAK8oB,MAAMsM,eACpDp1B,KAAK8oB,MAAMlxC,KAAOooB,KAAK/6B,OACzB+6B,KAAKkhC,YAAYzf,EAAG1P,KAIlByxB,IAAe7O,EAAGjgI,SACpBsrG,KAAKstD,gBAELttD,KAAKmhC,iBAAiBnhC,KAAKitD,eAAejtD,KAAK8oB,MAAMlxC,MAIzD21E,YACEC,EACArgF,EACA6H,EACAhQ,EACA6tD,EACAC,GAEA,MAAMkR,EAAU,CACdl9D,KAAM0mF,EAAQ,eAAiB,cAC/B95J,MAAOy5E,EACP6H,MAAOA,EACPhQ,IAAKA,EACLsC,IAAK,IAAIgwC,EAAeub,EAAUC,IAGhC9yB,KAAKrrG,QAAQ8zJ,QAAQzoD,KAAK6sD,UAAU7oB,GACxChkC,KAAK8oB,MAAMztC,SAASvQ,KAAKk5D,GACzBhkC,KAAK+jC,WAAWC,GAGlB6Q,mBACE,IAAIhiB,EACC7yB,KAAK4sD,cAAa/5B,EAAW7yB,KAAK8oB,MAAMsM,eAC7C,MAAMpgD,EAAQgrB,KAAK8oB,MAAMlxC,IACnB5S,EAAMg7B,KAAKhR,MAAMxjB,QAAQ,KAAMw0B,KAAK8oB,MAAMlxC,IAAM,GACtD,IAAa,IAAT5S,EAAY,MAAMg7B,KAAK0jB,MAAM1uC,EAAOmwC,EAAO3E,qBAI/C,IAAIljC,EACJ,IAHA0iB,KAAK8oB,MAAMlxC,IAAM5S,EAAM,EACvB+xC,EAAWlb,UAAY7mB,GAGpBsI,EAAQy5B,EAAWzxC,KAAK06B,KAAKhR,SAC9B1R,EAAM/X,MAAQy6B,KAAK8oB,MAAMlxC,OAEvBooB,KAAK8oB,MAAM8J,QACb5yB,KAAK8oB,MAAMwL,UAAYh3C,EAAM/X,MAAQ+X,EAAM,GAAGrY,OAK5C+6B,KAAK4sD,aAGT5sD,KAAKutD,aACH,EACAvtD,KAAKhR,MAAM5pB,MAAM4P,EAAQ,EAAGhQ,GAC5BgQ,EACAgrB,KAAK8oB,MAAMlxC,IACXi7C,EACA7yB,KAAK8oB,MAAMsM,eAIfq4B,gBAAgBC,GACd,MAAM14E,EAAQgrB,KAAK8oB,MAAMlxC,IACzB,IAAIi7C,EACC7yB,KAAK4sD,cAAa/5B,EAAW7yB,KAAK8oB,MAAMsM,eAC7C,IAAI6L,EAAKjhC,KAAKhR,MAAM/W,WAAY+nB,KAAK8oB,MAAMlxC,KAAO81E,GAClD,GAAI1tD,KAAK8oB,MAAMlxC,IAAMooB,KAAK/6B,OACxB,MAAQgyC,EAAUgqB,MAASjhC,KAAK8oB,MAAMlxC,IAAMooB,KAAK/6B,QAC/Cg8D,EAAKjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAMtCooB,KAAK4sD,aAGT5sD,KAAKutD,aACH,EACAvtD,KAAKhR,MAAM5pB,MAAM4P,EAAQ04E,EAAW1tD,KAAK8oB,MAAMlxC,KAC/C5C,EACAgrB,KAAK8oB,MAAMlxC,IACXi7C,EACA7yB,KAAK8oB,MAAMsM,eAOfi4B,YACEM,EAAM,KAAO3tD,KAAK8oB,MAAMlxC,IAAMooB,KAAK/6B,QAAQ,CACzC,MAAMg8D,EAAKjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAC5C,OAAQqpD,GACN,KAAA,GACA,KAAA,IACA,KAAA,IACIjhC,KAAK8oB,MAAMlxC,IACb,MACF,KAAA,GAEI,KAAAooB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,MAErCooB,KAAK8oB,MAAMlxC,IAGjB,KAAA,GACA,KAAA,KACA,KAAA,OACIooB,KAAK8oB,MAAMlxC,MACXooB,KAAK8oB,MAAM8J,QACb5yB,KAAK8oB,MAAMwL,UAAYt0B,KAAK8oB,MAAMlxC,IAClC,MAEF,KAAA,GACE,OAAQooB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,IAC7C,KAAA,GACEooB,KAAK60C,mBACL,MAEF,KAAA,GACE70C,KAAKytD,gBAAgB,GACrB,MAEF,QACE,MAAME,EAEV,MAEF,QACE,IAAIx2C,EAAa8pB,GAGf,MAAM0sB,IAFJ3tD,KAAK8oB,MAAMlxC,MAavBspD,YAAYp6D,EAAiB6yB,GAC3BqG,KAAK8oB,MAAM9jD,IAAMg7B,KAAK8oB,MAAMlxC,IAC5B,MAAM6rD,EAAWzjC,KAAK8oB,MAAMhiD,KAC5Bk5B,KAAK8oB,MAAMhiD,KAAOA,EAClBk5B,KAAK8oB,MAAMp1H,MAAQimG,EAEdqG,KAAK4sD,cACR5sD,KAAK8oB,MAAMgK,OAAS9yB,KAAK8oB,MAAMsM,cAC/Bp1B,KAAKoR,cAAcqyB,IAcvBmqB,uBACE,GAAuB,IAAnB5tD,KAAK8oB,MAAMlxC,KAAaooB,KAAK6tD,wBAC/B,OAGF,MAAMC,EAAU9tD,KAAK8oB,MAAMlxC,IAAM,EAC3BwF,EAAO4iB,KAAKitD,eAAea,GACjC,GAAI1wE,GAAI,IAAwBA,GAAI,GAClC,MAAM4iB,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAO/F,0BAG1C,GACM,MAAJhiC,GACK,KAAJA,GAAwC4iB,KAAKk7B,UAAU,kBACxD,CAMA,GADAl7B,KAAKwnD,aAAa,kBAC2C,SAAzDxnD,KAAKo7B,gBAAgB,iBAAkB,cACzC,MAAMp7B,KAAK0jB,MACT1jB,KAAK8oB,MAAMlxC,IACP,MAAJwF,EACI+nC,EAAOnH,6CACPmH,EAAOlG,6CAIfjf,KAAK8oB,MAAMlxC,KAAO,EACV,MAAJwF,EAEF4iB,KAAKkhC,YAAYzf,EAAGlP,YAGpBvS,KAAKkhC,YAAYzf,EAAGxP,mBAEbgQ,EAAkB7kC,MACzB4iB,KAAK8oB,MAAMlxC,IACbooB,KAAKkhC,YAAYzf,EAAG3P,YAAa9R,KAAKuvC,UAAUnyD,KACnC,KAAJA,KACP4iB,KAAK8oB,MAAMlxC,IACbooB,KAAKkhC,YAAYzf,EAAG3P,YAAa9R,KAAKuvC,cAEtCvvC,KAAKyvC,SAAShuB,EAAGpO,KAAM,GAI3B06C,gBACE,MAAM3wE,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAChDwF,GAAI,IAAwBA,GAAI,GAClC4iB,KAAKguD,YAAW,GAKZ,KAAJ5wE,GACA,KAAA4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,IAEvCooB,KAAK8oB,MAAMlxC,KAAO,EAClBooB,KAAKkhC,YAAYzf,EAAGvO,cAElBlT,KAAK8oB,MAAMlxC,IACbooB,KAAKkhC,YAAYzf,EAAG3O,MAIxBm7C,kBAEU,KADKjuD,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAElDooB,KAAKyvC,SAAShuB,EAAGjO,YAAa,GAE9BxT,KAAKyvC,SAAShuB,EAAGhN,MAAO,GAI5Bo5C,wBACE,GAAuB,IAAnB7tD,KAAK8oB,MAAMlxC,KAAaooB,KAAK/6B,OAAS,EAAG,OAAO,EAEpD,IAAIg8D,EAAKjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAChD,GAAM,KAAFqpD,EAAkC,OAAO,EAE7C,MAAMjsD,EAAQgrB,KAAK8oB,MAAMlxC,IAGzB,IAFAooB,KAAK8oB,MAAMlxC,KAAO,GAEVq/B,EAAUgqB,MAASjhC,KAAK8oB,MAAMlxC,IAAMooB,KAAK/6B,QAC/Cg8D,EAAKjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAGxC,MAAMlkF,EAAQssG,KAAKhR,MAAM5pB,MAAM4P,EAAQ,EAAGgrB,KAAK8oB,MAAMlxC,KAIrD,OAFAooB,KAAKkhC,YAAYzf,EAAGnO,qBAAsB5/G,IAEnC,EAGT8gJ,sBAAsBn/I,GAEpB,IAAIyxE,EAAW,KAAJzxE,EAA8BosH,EAAGjN,KAAOiN,EAAGlN,OAClD25C,EAAQ,EACR9wE,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAG1C,KAAJviF,GAAmC,KAAJ+nF,IACjC8wE,IACA9wE,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAC9C9Q,EAAO26C,EAAG/M,UAGJ,KAAJt3B,GAAgC4iB,KAAK8oB,MAAMuK,SAC7C66B,IACApnF,EAAO26C,EAAGhkB,QAGZuC,KAAKyvC,SAAS3oE,EAAMonF,GAGtBxZ,mBAAmBr/I,GAEjB,MAAM+nF,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAEpD,GAAIwF,IAAS/nF,EAAb,CAYA,GAAQ,MAAJA,EAAgC,CAElC,GAAQ,KAAJ+nF,EAEF,YADA4iB,KAAKyvC,SAAShuB,EAAG7N,SAAU,GAI7B,GACE5T,KAAKk7B,UAAU,mBACX,MAAJ99C,EACA,CACA,GAA6D,QAAzD4iB,KAAKo7B,gBAAgB,iBAAkB,cACzC,MAAMp7B,KAAK0jB,MACT1jB,KAAK8oB,MAAMlxC,IACXutC,EAAOrH,2CAKX,OAFA9d,KAAK8oB,MAAMlxC,KAAO,OAClBooB,KAAKkhC,YAAYzf,EAAGhP,WAKtB,GACEzS,KAAKk7B,UAAU,mBACX,KAAJ99C,EACA,CACA,GAA6D,QAAzD4iB,KAAKo7B,gBAAgB,iBAAkB,cACzC,MAAMp7B,KAAK0jB,MACT1jB,KAAK8oB,MAAMlxC,IACXutC,EAAOpG,0CAKX,OAFA/e,KAAK8oB,MAAMlxC,KAAO,OAClBooB,KAAKkhC,YAAYzf,EAAGrP,cAKhB,KAAJh1B,EAKJ4iB,KAAKyvC,SACC,MAAJp6I,EAAiCosH,EAAGzN,UAAYyN,EAAGvN,WACnD,GANAlU,KAAKyvC,SAAShuB,EAAGhkB,OAAQ,QAnDrB,KAAAuC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GACzCooB,KAAKyvC,SAAShuB,EAAGhkB,OAAQ,GAEzBuC,KAAKyvC,SACC,MAAJp6I,EAAiCosH,EAAG3N,UAAY2N,EAAG1N,WACnD,GAwDRo6C,kBAGU,KADKnuD,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAElDooB,KAAKyvC,SAAShuB,EAAGhkB,OAAQ,GAEzBuC,KAAKyvC,SAAShuB,EAAGxN,WAAY,GAIjCm6C,mBAAmB/4J,GAEjB,MAAM+nF,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAEpD,GAAIwF,IAAS/nF,EACX,OACM,KAAJ+nF,GACC4iB,KAAKyiB,UACN,KAAAziB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,IACZ,IAA1BooB,KAAK8oB,MAAM4L,aAAoB10B,KAAK63C,6BAQvC73C,KAAKyvC,SAAShuB,EAAGhO,OAAQ,IALvBzT,KAAKytD,gBAAgB,GACrBztD,KAAKqtD,iBACLrtD,KAAKy0C,aAOD,KAAJr3D,EACF4iB,KAAKyvC,SAAShuB,EAAGhkB,OAAQ,GAEzBuC,KAAKyvC,SAAShuB,EAAGnN,QAAS,GAI9ByxC,gBAAgB1wJ,GAEd,MAAM+nF,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GACpD,IAAIqlB,EAAO,EAEX,OAAI7f,IAAS/nF,GACX4nG,EACM,KAAJ5nG,GACA,KAAA2qG,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GACnC,EACA,EACF,KAAAooB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAMqlB,QACzC+C,KAAKyvC,SAAShuB,EAAGhkB,OAAQR,EAAO,QAGlC+C,KAAKyvC,SAAShuB,EAAGpN,SAAUpX,IAKvB,KAAJ7f,GACI,KAAJ/nF,GACC2qG,KAAKyiB,UACN,KAAAziB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,IACvC,KAAAooB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,IASjC,KAAJwF,IAEF6f,EAAO,QAGT+C,KAAKyvC,SAAShuB,EAAGrN,WAAYnX,KAX3B+C,KAAKytD,gBAAgB,GACrBztD,KAAKqtD,iBACLrtD,KAAKy0C,aAYT4Z,kBAAkBh5J,GAEhB,MAAM+nF,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GACpD,GAAQ,KAAJwF,EASJ,OAAQ,KAAJ/nF,GAAmC,KAAJ+nF,GAEjC4iB,KAAK8oB,MAAMlxC,KAAO,OAClBooB,KAAKkhC,YAAYzf,EAAGxO,aAGtBjT,KAAKyvC,SAAa,KAAJp6I,EAA8BosH,EAAGlO,GAAKkO,EAAG/N,KAAM,GAd3D1T,KAAKyvC,SACHhuB,EAAGtN,SACH,KAAAnU,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GACnC,EACA,GAaV02E,qBAEE,MAAMlxE,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAC9C22E,EAAQvuD,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAC7C,KAAJwF,EACO,KAALmxE,EAEFvuD,KAAKyvC,SAAShuB,EAAGhkB,OAAQ,GAGzBuC,KAAKyvC,SAAShuB,EAAG5N,kBAAmB,GAGlC,KAAJz2B,GACEmxE,GAAK,IAAwBA,GAAK,MAMlCvuD,KAAK8oB,MAAMlxC,IACbooB,KAAKkhC,YAAYzf,EAAG1O,YAJpB/S,KAAK8oB,MAAMlxC,KAAO,EAClBooB,KAAKkhC,YAAYzf,EAAGzO,cAOxBmuB,iBAAiB9rI,GACf,OAAQA,GAIN,KAAA,GAEE,YADA2qG,KAAK+tD,gBAIP,KAAA,GAGE,QAFE/tD,KAAK8oB,MAAMlxC,SACbooB,KAAKkhC,YAAYzf,EAAG/O,QAEtB,KAAA,GAGE,QAFE1S,KAAK8oB,MAAMlxC,SACbooB,KAAKkhC,YAAYzf,EAAG9O,QAEtB,KAAA,GAGE,QAFE3S,KAAK8oB,MAAMlxC,SACbooB,KAAKkhC,YAAYzf,EAAG37C,MAEtB,KAAA,GAGE,QAFEk6B,KAAK8oB,MAAMlxC,SACbooB,KAAKkhC,YAAYzf,EAAG75B,OAEtB,KAAA,GACE,GACEoY,KAAKk7B,UAAU,mBACf,MAAAl7B,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GACvC,CACA,GAA6D,QAAzDooB,KAAKo7B,gBAAgB,iBAAkB,cACzC,MAAMp7B,KAAK0jB,MACT1jB,KAAK8oB,MAAMlxC,IACXutC,EAAOnG,4CAKXhf,KAAK8oB,MAAMlxC,KAAO,EAClBooB,KAAKkhC,YAAYzf,EAAGvP,mBAElBlS,KAAK8oB,MAAMlxC,IACbooB,KAAKkhC,YAAYzf,EAAGzP,UAEtB,OACF,KAAA,GAGE,QAFEhS,KAAK8oB,MAAMlxC,SACbooB,KAAKkhC,YAAYzf,EAAGtP,UAEtB,KAAA,IACE,GACEnS,KAAKk7B,UAAU,mBACf,MAAAl7B,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GACvC,CACA,GAA6D,QAAzDooB,KAAKo7B,gBAAgB,iBAAkB,cACzC,MAAMp7B,KAAK0jB,MACT1jB,KAAK8oB,MAAMlxC,IACXutC,EAAOpH,6CAKX/d,KAAK8oB,MAAMlxC,KAAO,EAClBooB,KAAKkhC,YAAYzf,EAAGnP,iBAElBtS,KAAK8oB,MAAMlxC,IACbooB,KAAKkhC,YAAYzf,EAAGpP,QAEtB,OACF,KAAA,IAGE,QAFErS,KAAK8oB,MAAMlxC,SACbooB,KAAKkhC,YAAYzf,EAAGjP,QAGtB,KAAA,GAUE,YARExS,KAAKk7B,UAAU,iBACf,KAAAl7B,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAEvCooB,KAAKyvC,SAAShuB,EAAG5O,YAAa,MAE5B7S,KAAK8oB,MAAMlxC,IACbooB,KAAKkhC,YAAYzf,EAAG7O,SAIxB,KAAA,GAEE,YADA5S,KAAKsuD,qBAGP,KAAA,GAGE,QAFEtuD,KAAK8oB,MAAMlxC,SACbooB,KAAKkhC,YAAYzf,EAAGtO,WAGtB,KAAA,GAAuB,CACrB,MAAM/1B,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAEpD,GAAQ,MAAJwF,GAAqC,KAAJA,EAEnC,YADA4iB,KAAKwuD,gBAAgB,IAIvB,GAAQ,MAAJpxE,GAAqC,KAAJA,EAEnC,YADA4iB,KAAKwuD,gBAAgB,GAIvB,GAAQ,KAAJpxE,GAAqC,KAAJA,EAEnC,YADA4iB,KAAKwuD,gBAAgB,GAMzB,KAAA,GACA,KAAA,GACA,KAAA,GACA,KAAA,GACA,KAAA,GACA,KAAA,GACA,KAAA,GACA,KAAA,GACA,KAAA,GAEE,YADAxuD,KAAKguD,YAAW,GAIlB,KAAA,GACA,KAAA,GAEE,YADAhuD,KAAKyuD,WAAWp5J,GAQlB,KAAA,GAEE,YADA2qG,KAAKiuD,kBAGP,KAAA,GACA,KAAA,GAEE,YADAjuD,KAAKw0C,sBAAsBn/I,GAG7B,KAAA,IACA,KAAA,GAEE,YADA2qG,KAAK00C,mBAAmBr/I,GAG1B,KAAA,GAEE,YADA2qG,KAAKmuD,kBAGP,KAAA,GACA,KAAA,GAEE,YADAnuD,KAAKouD,mBAAmB/4J,GAG1B,KAAA,GACA,KAAA,GAEE,YADA2qG,KAAK+lD,gBAAgB1wJ,GAGvB,KAAA,GACA,KAAA,GAEE,YADA2qG,KAAKquD,kBAAkBh5J,GAGzB,KAAA,IAEE,YADA2qG,KAAKyvC,SAAShuB,EAAG9N,MAAO,GAG1B,KAAA,GAGE,QAFE3T,KAAK8oB,MAAMlxC,SACbooB,KAAKkhC,YAAYzf,EAAGrZ,IAGtB,KAAA,GAEE,YADApI,KAAK4tD,uBAGP,KAAA,GAEE,YADA5tD,KAAK0uD,WAGP,QACE,GAAIzsC,EAAkB5sH,GAEpB,YADA2qG,KAAK0uD,SAASr5J,GAKpB,MAAM2qG,KAAK0jB,MACT1jB,KAAK8oB,MAAMlxC,IACXutC,EAAO7J,yBACPj1C,OAAOC,cAAcjxE,IAIzBo6I,SAAS3oE,EAAiBm2B,GACxB,MAAMzH,EAAMwK,KAAKhR,MAAM5pB,MAAM46B,KAAK8oB,MAAMlxC,IAAKooB,KAAK8oB,MAAMlxC,IAAMqlB,GAC9D+C,KAAK8oB,MAAMlxC,KAAOqlB,EAClB+C,KAAKkhC,YAAYp6D,EAAM0uB,GAGzBm5D,aACE,MAAM35E,EAAQgrB,KAAK8oB,MAAM9zC,MAAQ,EACjC,IAAI4mB,EAASuoB,EACb,OAAS,CACP,GAAInkB,KAAK8oB,MAAMlxC,KAAOooB,KAAK/6B,OACzB,MAAM+6B,KAAK0jB,MAAM1uC,EAAOmwC,EAAO1E,oBAEjC,MAAMwgB,EAAKjhC,KAAKhR,MAAMuJ,OAAOyH,KAAK8oB,MAAMlxC,KACxC,GAAIk/B,EAAUrxC,KAAKw7D,GACjB,MAAMjhC,KAAK0jB,MAAM1uC,EAAOmwC,EAAO1E,oBAEjC,GAAI7kB,EACFA,GAAU,MACL,CACL,GAAW,MAAPqlC,EACF9c,GAAU,OACL,GAAW,MAAP8c,GAAc9c,EACvBA,GAAU,OACL,GAAW,MAAP8c,IAAe9c,EACxB,MAEFvoB,EAAiB,OAAPqlC,IAEVjhC,KAAK8oB,MAAMlxC,IAEf,MAAM7Q,EAAUi5B,KAAKhR,MAAM5pB,MAAM4P,EAAOgrB,KAAK8oB,MAAMlxC,OACjDooB,KAAK8oB,MAAMlxC,IAEb,IAAIg3E,EAAO,GAEX,KAAO5uD,KAAK8oB,MAAMlxC,IAAMooB,KAAK/6B,QAAQ,CACnC,MAAM4pF,EAAO7uD,KAAKhR,MAAMgR,KAAK8oB,MAAMlxC,KAC7BotB,EAAWhF,KAAKitD,eAAejtD,KAAK8oB,MAAMlxC,KAEhD,GAAIgxE,GAAkB7pE,IAAI8vE,GACpBD,EAAKpjF,QAAQqjF,IAAS,GACxB7uD,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAM,EAAGutC,EAAO1L,0BAEnC,CAAA,IACL0I,EAAiBnd,IACT,KAARA,EAIA,MAFAhF,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAM,EAAGutC,EAAOpJ,wBAKtC/b,KAAK8oB,MAAMlxC,IACbg3E,GAAQC,EAGV7uD,KAAKkhC,YAAYzf,EAAG5P,OAAQ,CAC1B5yB,QAASlY,EACTs8C,MAAOurC,IAaXE,QACEC,EACA3rD,EACA4rD,EACAC,GAA6B,GAE7B,MAAMj6E,EAAQgrB,KAAK8oB,MAAMlxC,IACnBs3E,EACM,KAAVH,EACIlG,GAAkC7iF,IAClC6iF,GAAkCC,UAClCqG,EACM,KAAVJ,EACIhG,GAAgC/iF,IACtB,KAAV+oF,EACAhG,GAAgCG,IACtB,IAAV6F,EACAhG,GAAgCC,IAChCD,GAAgCE,IAEtC,IAAI5b,GAAU,EACV+hB,EAAQ,EAEZ,IAAK,IAAIjoF,EAAI,EAAGpzE,EAAW,MAAPqvG,EAAciJ,EAAAA,EAAWjJ,EAAKj8B,EAAIpzE,IAAKozE,EAAG,CAC5D,MAAM9xE,EAAO2qG,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAC9C,IAAI+hB,EAEJ,GAAQ,KAAJtkG,EAAJ,CA+BA,GAREskG,EADEtkG,GAAI,GACAA,EAAI,GAAJ,GACGA,GAAI,GACPA,EAAI,GAAJ,GACGg6J,GAAkBh6J,GACrBA,EAAI,GAEJg3G,EAAAA,EAEJ1S,GAAOo1D,EAIT,GAAI/uD,KAAKrrG,QAAQg0J,eAAiBhvD,GAAO,EACvCA,EAAM,EACNqG,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAQ7N,EAAI,EAAGg+C,EAAOtK,aAAck0C,OACrD,CAAA,IAAIC,EAIT,MAHAr1D,EAAM,EACN0zC,GAAU,IAKZrtC,KAAK8oB,MAAMlxC,IACbw3E,EAAQA,EAAQL,EAAQp1D,MA9CxB,CACE,MAAMxc,EAAO6iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAC9CwF,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,KACb,IAAnCu3E,EAAgB3jF,QAAQ4R,IAG1B8xE,EAAkB1jF,QAAQ2R,IAAS,GACnC+xE,EAAkB1jF,QAAQ4R,IAAS,GACnCjX,OAAO+4B,MAAM9hB,KAJb4iB,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAOzF,4BAS/BuvC,GACHjvD,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAOrI,oCAIlC9c,KAAK8oB,MAAMlxC,KA8BjB,OACEooB,KAAK8oB,MAAMlxC,MAAQ5C,GACX,MAAPouB,GAAepD,KAAK8oB,MAAMlxC,IAAM5C,IAAUouB,GAC3CiqC,EAEO,KAGF+hB,EAGTZ,gBAAgBO,GACd,MAAM/5E,EAAQgrB,KAAK8oB,MAAMlxC,IACzB,IAAI03E,GAAW,EAEftvD,KAAK8oB,MAAMlxC,KAAO,EAClB,MAAM+hB,EAAMqG,KAAK8uD,QAAQC,GACd,MAAPp1D,GACFqG,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAQ,EAAGmwC,EAAOtK,aAAck0C,GAExD,MAAM3xE,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAE9C,GAAQ,MAAJwF,IACA4iB,KAAK8oB,MAAMlxC,IACb03E,GAAW,OACN,GAAQ,MAAJlyE,EACT,MAAM4iB,KAAK0jB,MAAM1uC,EAAOmwC,EAAOvK,gBAGjC,GAAIqH,EAAkBjiB,KAAKitD,eAAejtD,KAAK8oB,MAAMlxC,MACnD,MAAMooB,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAOtI,kBAG1C,GAAIyyC,EAAJ,CACE,MAAM95D,EAAMwK,KAAKhR,MAAM5pB,MAAM4P,EAAOgrB,KAAK8oB,MAAMlxC,KAAKsB,QAAQ,QAAS,IACrE8mB,KAAKkhC,YAAYzf,EAAG9P,OAAQnc,QAI9BwK,KAAKkhC,YAAYzf,EAAG/P,IAAK/X,GAK3Bq0D,WAAWuB,GACT,MAAMv6E,EAAQgrB,KAAK8oB,MAAMlxC,IACzB,IAAI43E,GAAU,EACVF,GAAW,EACXG,GAAY,EACZC,GAAc,EACdC,GAAU,EAETJ,GAAsC,OAArBvvD,KAAK8uD,QAAQ,KACjC9uD,KAAK0jB,MAAM1uC,EAAOmwC,EAAO/J,eAE3B,MAAMw0C,EACJ5vD,KAAK8oB,MAAMlxC,IAAM5C,GAAS,GAC1B,KAAAgrB,KAAKhR,MAAM/W,WAAWjD,GAExB,GAAI46E,EAAgB,CAClB,MAAMC,EAAU7vD,KAAKhR,MAAM5pB,MAAM4P,EAAOgrB,KAAK8oB,MAAMlxC,KAEnD,GADAooB,KAAK8vD,uBAAuB96E,EAAOmwC,EAAOzG,qBACrC1e,KAAK8oB,MAAM6J,OAAQ,CAEtB,MAAMo9B,EAAgBF,EAAQrkF,QAAQ,KAClCukF,EAAgB,GAClB/vD,KAAK0jB,MAAMqsC,EAAgB/6E,EAAOmwC,EAAOpE,2BAG7C4uC,EAAUC,IAAmB,OAAOnqF,KAAKoqF,GAG3C,IAAIzyE,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KA2C5C,GA1CQ,KAAJwF,GAA2BuyE,MAC3B3vD,KAAK8oB,MAAMlxC,IACbooB,KAAK8uD,QAAQ,IACbU,GAAU,EACVpyE,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,MAInC,KAAJwF,GAAqC,MAAJA,GACjCuyE,IAEDvyE,EAAO4iB,KAAKhR,MAAM/W,aAAa+nB,KAAK8oB,MAAMlxC,KAClC,KAAJwF,GAAmC,KAAJA,KAC/B4iB,KAAK8oB,MAAMlxC,IAEU,OAArBooB,KAAK8uD,QAAQ,KACf9uD,KAAK0jB,MAAM1uC,EAAOmwC,EAAO9J,0BAE3Bm0C,GAAU,EACVE,GAAc,EACdtyE,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,MAGlC,MAAJwF,KAGEoyE,GAAWI,IACb5vD,KAAK0jB,MAAM1uC,EAAOmwC,EAAOzK,wBAEzB1a,KAAK8oB,MAAMlxC,IACb03E,GAAW,GAGL,MAAJlyE,IACF4iB,KAAKwnD,aAAa,UAAWxnD,KAAK8oB,MAAMlxC,MACpC83E,GAAeE,IACjB5vD,KAAK0jB,MAAM1uC,EAAOmwC,EAAOvK,kBAEzB5a,KAAK8oB,MAAMlxC,IACb63E,GAAY,GAGVxtC,EAAkBjiB,KAAKitD,eAAejtD,KAAK8oB,MAAMlxC,MACnD,MAAMooB,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAOtI,kBAI1C,MAAMrnB,EAAMwK,KAAKhR,MAAM5pB,MAAM4P,EAAOgrB,KAAK8oB,MAAMlxC,KAAKsB,QAAQ,SAAU,IAEtE,GAAIo2E,EAEF,YADAtvD,KAAKkhC,YAAYzf,EAAG9P,OAAQnc,GAI9B,GAAIi6D,EAEF,YADAzvD,KAAKkhC,YAAYzf,EAAG7P,QAASpc,GAI/B,MAAMmE,EAAMg2D,EAAUvpF,SAASovB,EAAK,GAAKyJ,WAAWzJ,GACpDwK,KAAKkhC,YAAYzf,EAAG/P,IAAK/X,GAK3Bq2D,cAAcC,GAEZ,IAAI56J,EAEJ,GAAM,MAHK2qG,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAGP,CACnC,MAAMs4E,IAAYlwD,KAAK8oB,MAAMlxC,IAO7B,GANAviF,EAAO2qG,KAAKmwD,YACVnwD,KAAKhR,MAAMxjB,QAAQ,IAAKw0B,KAAK8oB,MAAMlxC,KAAOooB,KAAK8oB,MAAMlxC,KACrD,EACAq4E,KAEAjwD,KAAK8oB,MAAMlxC,IACA,OAATviF,GAAiBA,EAAO,QAAU,CACpC,IAAI46J,EAGF,OAAO,KAFPjwD,KAAK0jB,MAAMwsC,EAAS/qC,EAAOxK,wBAM/BtlH,EAAO2qG,KAAKmwD,YAAY,GAAG,EAAOF,GAEpC,OAAO56J,EAGTo5J,WAAWtvE,GACT,IAAI4hD,EAAM,GACRC,IAAehhC,KAAK8oB,MAAMlxC,IAC5B,OAAS,CACP,GAAIooB,KAAK8oB,MAAMlxC,KAAOooB,KAAK/6B,OACzB,MAAM+6B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOzE,oBAE5C,MAAMugB,EAAKjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAC5C,GAAIqpD,IAAO9hD,EAAO,MAClB,GAAM,KAAF8hD,EACFF,GAAO/gC,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,KAE/CmpD,GAAO/gC,KAAKowD,iBAAgB,GAC5BpvB,EAAahhC,KAAK8oB,MAAMlxC,SACnB,GACH,OAAFqpD,GACE,OAAFA,IAEEjhC,KAAK8oB,MAAMlxC,MACXooB,KAAK8oB,MAAM8J,QACb5yB,KAAK8oB,MAAMwL,UAAYt0B,KAAK8oB,MAAMlxC,QAC7B,CAAA,GAAIq/B,EAAUgqB,GACnB,MAAMjhC,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOzE,sBAExC1gB,KAAK8oB,MAAMlxC,KAGjBmpD,GAAO/gC,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,OAC/CooB,KAAKkhC,YAAYzf,EAAG9lB,OAAQolC,GAK9BusB,gBACE,IAAIvsB,EAAM,GACRC,EAAahhC,KAAK8oB,MAAMlxC,IACxBy4E,GAAkB,EACpB,OAAS,CACP,GAAIrwD,KAAK8oB,MAAMlxC,KAAOooB,KAAK/6B,OACzB,MAAM+6B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOxE,sBAE5C,MAAMsgB,EAAKjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAC5C,GACI,KAAFqpD,GACG,KAAFA,GACC,MAAAjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,IAAM,GAGzC,OAAIooB,KAAK8oB,MAAMlxC,MAAQooB,KAAK8oB,MAAM9zC,OAASgrB,KAAK1iB,MAAMmkC,EAAG/sH,UACjD,KAAFusI,GACFjhC,KAAK8oB,MAAMlxC,KAAO,OAClBooB,KAAKkhC,YAAYzf,EAAGrO,kBAGlBpT,KAAK8oB,MAAMlxC,SACbooB,KAAKkhC,YAAYzf,EAAGtO,aAIxB4tB,GAAO/gC,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,UAC/CooB,KAAKkhC,YAAYzf,EAAG/sH,SAAU27J,EAAkB,KAAOtvB,IAGzD,GAAM,KAAFE,EAA4B,CAC9BF,GAAO/gC,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,KAC/C,MAAMgkB,EAAUoE,KAAKowD,iBAAgB,GACrB,OAAZx0D,EACFy0D,GAAkB,EAElBtvB,GAAOnlC,EAETolC,EAAahhC,KAAK8oB,MAAMlxC,SACnB,GAAIq/B,EAAUgqB,GAAK,CAGxB,OAFAF,GAAO/gC,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,OAC7CooB,KAAK8oB,MAAMlxC,IACLqpD,GACN,KAAA,GACM,KAAAjhC,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,QACjCooB,KAAK8oB,MAAMlxC,IAGjB,KAAA,GACEmpD,GAAO,KACP,MACF,QACEA,GAAO16D,OAAO67C,aAAa+e,KAG7BjhC,KAAK8oB,MAAM8J,QACb5yB,KAAK8oB,MAAMwL,UAAYt0B,KAAK8oB,MAAMlxC,IAClCopD,EAAahhC,KAAK8oB,MAAMlxC,UAEtBooB,KAAK8oB,MAAMlxC,KAKnBk4E,uBAAuBl4E,EAAa+B,GAC9BqmB,KAAK8oB,MAAM6J,SAAW3yB,KAAK8oB,MAAMgM,aAAa/1C,IAAInH,GACpDooB,KAAK0jB,MAAM9rC,EAAK+B,GAEhBqmB,KAAK8oB,MAAMgM,aAAarzC,IAAI7J,EAAK+B,GAKrCy2E,gBAAgBE,GACd,MAAML,GAAkBK,EAClBrvB,EAAKjhC,KAAKhR,MAAM/W,aAAa+nB,KAAK8oB,MAAMlxC,KAE9C,SADEooB,KAAK8oB,MAAMlxC,IACLqpD,GACN,KAAA,IACE,MAAO,KACT,KAAA,IACE,MAAO,KACT,KAAA,IAA2B,CACzB,MAAM5rI,EAAO2qG,KAAKmwD,YAAY,GAAG,EAAOF,GACxC,OAAgB,OAAT56J,EAAgB,KAAOgxE,OAAO67C,aAAa7sH,GAEpD,KAAA,IAA2B,CACzB,MAAMA,EAAO2qG,KAAKgwD,cAAcC,GAChC,OAAgB,OAAT56J,EAAgB,KAAOgxE,OAAOC,cAAcjxE,GAErD,KAAA,IACE,MAAO,KACT,KAAA,GACE,MAAO,KACT,KAAA,IACE,MAAO,KACT,KAAA,IACE,MAAO,KACT,KAAA,GACM,KAAA2qG,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,QACjCooB,KAAK8oB,MAAMlxC,IAGjB,KAAA,GACEooB,KAAK8oB,MAAMwL,UAAYt0B,KAAK8oB,MAAMlxC,MAChCooB,KAAK8oB,MAAM8J,QAEf,KAAA,KACA,KAAA,KACE,MAAO,GACT,KAAA,GACA,KAAA,GACE,GAAI09B,EACF,OAAO,KAEPtwD,KAAK8vD,uBACH9vD,KAAK8oB,MAAMlxC,IAAM,EACjButC,EAAO1G,qBAIb,QACE,GAAIwiB,GAAE,IAAwBA,GAAE,GAAsB,CACpD,MAAMivB,EAAUlwD,KAAK8oB,MAAMlxC,IAAM,EAOjC,IAAI24E,EANUvwD,KAAKhR,MAChBnpB,OAAOm6B,KAAK8oB,MAAMlxC,IAAM,EAAG,GAC3B0F,MAAM,WAIY,GAEjBkzE,EAAQpqF,SAASmqF,EAAU,GAC3BC,EAAQ,MACVD,EAAWA,EAASnrF,MAAM,GAAI,GAC9BorF,EAAQpqF,SAASmqF,EAAU,IAE7BvwD,KAAK8oB,MAAMlxC,KAAO24E,EAAStrF,OAAS,EACpC,MAAMmY,EAAO4iB,KAAKhR,MAAM/W,WAAW+nB,KAAK8oB,MAAMlxC,KAC9C,GACe,MAAb24E,GACI,KAAJnzE,GACI,KAAJA,EACA,CACA,GAAIkzE,EACF,OAAO,KAEPtwD,KAAK8vD,uBAAuBI,EAAS/qC,EAAO1G,qBAIhD,OAAOp4C,OAAO67C,aAAasuC,GAG7B,OAAOnqF,OAAO67C,aAAa+e,IAMjCkvB,YACE/sD,EACA4rD,EACAiB,GAEA,MAAMC,EAAUlwD,KAAK8oB,MAAMlxC,IACrB3jF,EAAI+rG,KAAK8uD,QAAQ,GAAI1rD,EAAK4rD,GAAU,GAQ1C,OAPU,OAAN/6J,IACEg8J,EACFjwD,KAAK0jB,MAAMwsC,EAAS/qC,EAAOrK,uBAE3B9a,KAAK8oB,MAAMlxC,IAAMs4E,EAAU,GAGxBj8J,EAYTs7I,UAAUkhB,GACRzwD,KAAK8oB,MAAM+L,aAAc,EACzB,IAAIrS,EAAO,GACX,MAAMxtC,EAAQgrB,KAAK8oB,MAAMlxC,IACzB,IAAIopD,EAAahhC,KAAK8oB,MAAMlxC,IAK5B,SAJkBliF,IAAd+6J,IACFzwD,KAAK8oB,MAAMlxC,KAAO64E,GAAa,MAAS,EAAI,GAGvCzwD,KAAK8oB,MAAMlxC,IAAMooB,KAAK/6B,QAAQ,CACnC,MAAMg8D,EAAKjhC,KAAKitD,eAAejtD,KAAK8oB,MAAMlxC,KAC1C,GAAIuqC,EAAiB8e,GACnBjhC,KAAK8oB,MAAMlxC,KAAOqpD,GAAM,MAAS,EAAI,MAChC,CAAA,GAAM,KAAFA,EAyBT,MAzBqC,CACrCjhC,KAAK8oB,MAAM+L,aAAc,EAEzBrS,GAAQxiB,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,KAChD,MAAM84E,EAAW1wD,KAAK8oB,MAAMlxC,IACtB+4E,EACJ3wD,KAAK8oB,MAAMlxC,MAAQ5C,EAAQitC,EAAoBE,EAEjD,GAAI,MAAAniB,KAAKhR,MAAM/W,aAAa+nB,KAAK8oB,MAAMlxC,KAA+B,CACpEooB,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAOhJ,sBAClC6kB,EAAahhC,KAAK8oB,MAAMlxC,IAAM,EAC9B,WAGAooB,KAAK8oB,MAAMlxC,IACb,MAAMg5E,EAAM5wD,KAAKgwD,eAAc,GACnB,OAARY,IACGD,EAAgBC,IACnB5wD,KAAK0jB,MAAMgtC,EAAUvrC,EAAOxL,4BAG9B6I,GAAQn8C,OAAOC,cAAcsqF,IAE/B5vB,EAAahhC,KAAK8oB,MAAMlxC,MAK5B,OAAO4qC,EAAOxiB,KAAKhR,MAAM5pB,MAAM47D,EAAYhhC,KAAK8oB,MAAMlxC,KAMxD82E,SAAS+B,GACP,MAAMjuC,EAAOxiB,KAAKuvC,UAAUkhB,GACtB3pF,EAAO+pF,EAAarvE,IAAIghC,IAASf,EAAG5uH,KAC1CmtG,KAAKkhC,YAAYp6D,EAAM07C,GAGzBsqC,sBACE,MAAM1O,EAAKp+C,KAAK8oB,MAAMhiD,KAAKmqC,QACvBmtC,GAAMp+C,KAAK8oB,MAAM+L,aACnB70B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOnK,2BAA4BojC,GAMpEhtC,cAAcqyB,GAA2B,IAAAqtB,EAAAC,EACvC,OAAAD,GAAAC,EAAA/wD,KAAK8oB,MAAMhiD,MAAKsqC,gBAAhB0/C,EAAAlzD,KAAAmzD,EAAgC/wD,KAAK8oB,MAAMt/C,WGn/C7Ci0D,SAASx2D,EAAYjyE,EAAa2kG,GAChC,IAAK1yB,EAAM,QAEIA,EAAK41D,MAAQ51D,EAAK41D,OAAS,IACpC7nI,GAAO2kG,EAKfypC,aAAa4tB,GACX,OAAOhxD,KAAK1iB,MAAMmkC,EAAGrN,aAAepU,KAAK8oB,MAAMp1H,QAAUs9J,EAK3DpoB,iBAAiBooB,GACXhxD,KAAKojC,aAAa4tB,GACpBhxD,KAAK5iB,OAEL4iB,KAAK4hC,WAAW,KAAMngB,EAAGrN,YAM7BuxB,aAAa9yI,GACX,OACEmtG,KAAK1iB,MAAMmkC,EAAG5uH,OACdmtG,KAAK8oB,MAAMp1H,QAAUb,IACpBmtG,KAAK8oB,MAAM+L,YAIhB4yB,qBAAqBwJ,EAAmBp+J,GACtC,MAAMq+J,EAAUD,EAAYp+J,EAAKoyE,OACjC,GAAI+6B,KAAKhR,MAAM5pB,MAAM6rF,EAAWC,KAAar+J,EAAM,CACjD,MAAMs+J,EAASnxD,KAAKhR,MAAM/W,WAAWi5E,GACrC,QACE/uC,EAAiBgvC,IAIK,QAAZ,MAATA,IAGL,OAAO,EAGTpf,sBAAsBl/I,GACpB,MAAMuqF,EAAO4iB,KAAKu3C,iBAClB,OAAOv3C,KAAKynD,qBAAqBrqE,EAAMvqF,GAKzC2yI,cAAc3yI,GACZ,OAAOmtG,KAAK2lC,aAAa9yI,IAASmtG,KAAK8hC,IAAIrgB,EAAG5uH,MAKhD0xI,iBAAiB1xI,EAAc6B,GACxBsrG,KAAKwlC,cAAc3yI,IAAOmtG,KAAK4hC,WAAW,KAAMltI,GAKvD62I,qBACE,OACEvrC,KAAK1iB,MAAMmkC,EAAG1P,MACd/R,KAAK1iB,MAAMmkC,EAAGjP,SACdxS,KAAK63C,wBAITA,wBACE,OAAO/gC,EAAUrxC,KACfu6B,KAAKhR,MAAM5pB,MAAM46B,KAAK8oB,MAAM4L,WAAY10B,KAAK8oB,MAAM9zC,QAIvDytE,wBACE,OAAO3rC,EAAUrxC,KACfu6B,KAAKhR,MAAM5pB,MAAM46B,KAAK8oB,MAAM9jD,IAAKg7B,KAAKu3C,mBAM1C4D,mBACE,OAAOn7C,KAAK8hC,IAAIrgB,EAAG37C,OAASk6B,KAAKurC,qBAMnCnG,UAAUgsB,GAAoB,IACxBA,EAAWpxD,KAAKm7C,mBAAqBn7C,KAAK8hC,IAAIrgB,EAAG37C,QACrDk6B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM4L,WAAYvP,EAAOjJ,kBAM3CqmB,OAAOz7D,EAAiB8Q,GACtBooB,KAAK8hC,IAAIh7D,IAASk5B,KAAK4hC,WAAWhqD,EAAK9Q,GAIzCigF,cAAcptE,EAAkB,qBAC1BqmB,KAAK8oB,MAAM9zC,MAAQgrB,KAAK8oB,MAAM4L,YAEhC10B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM4L,WAAY,CAChCr/H,KAAMoiH,EAAW5nC,YACjBuxC,WAAY,kBACZ1sH,SAAUilF,IAShBioD,WACEhqD,EACAy5E,EAA2C,CACzCh8J,KAAMoiH,EAAW5nC,YACjBuxC,WAAY,kBACZ1sH,SAAU,qBAWZ,MARI28J,aAAyBvgD,IAC3BugD,EAAgB,CACdh8J,KAAMoiH,EAAW5nC,YACjBuxC,WAAY,kBACZ1sH,SAAW,+BAA8B28J,EAActgD,WAIrD/Q,KAAK0jB,MAAa,MAAP9rC,EAAcA,EAAMooB,KAAK8oB,MAAM9zC,MAAOq8E,GAIzD7J,aAAa30J,EAAc+kF,GACzB,IAAKooB,KAAKk7B,UAAUroI,GAClB,MAAMmtG,KAAKusD,cACF,MAAP30E,EAAcA,EAAMooB,KAAK8oB,MAAM9zC,MAC/B,CAAEs8E,cAAe,CAACz+J,IACjB,kEAAiEA,MAItE,OAAO,EAGT0+J,gBAAgB5tD,EAAsB/rB,GACpC,IAAK+rB,EAAM/8B,MAAK3yE,GAAK+rG,KAAKk7B,UAAUjnI,KAClC,MAAM+rG,KAAKusD,cACF,MAAP30E,EAAcA,EAAMooB,KAAK8oB,MAAM9zC,MAC/B,CAAEs8E,cAAe3tD,GAChB,sFAAqFA,EAAMr5B,KAC1F,UAQRyiE,SACEnoD,EACA4sE,EAAkBxxD,KAAK8oB,MAAMuM,SAK7B,MAAMo8B,EAAkC,CAAExqF,KAAM,MAChD,IACE,MAAMA,EAAO2d,GAAG,CAAC3d,EAAO,QAEtB,MADAwqF,EAAYxqF,KAAOA,EACbwqF,KAER,GAAIzxD,KAAK8oB,MAAMiK,OAAO9tD,OAASusF,EAASz+B,OAAO9tD,OAAQ,CACrD,MAAM+nE,EAAYhtC,KAAK8oB,MAMvB,OALA9oB,KAAK8oB,MAAQ0oC,EAIbxxD,KAAK8oB,MAAMiM,aAAeiY,EAAUjY,aAC7B,CACL9tD,KAAAA,EACAsI,MAAQy9D,EAAUja,OAAOy+B,EAASz+B,OAAO9tD,QACzCsuE,QAAQ,EACRF,SAAS,EACTrG,UAAAA,GAIJ,MAAO,CACL/lE,KAAAA,EACAsI,MAAO,KACPgkE,QAAQ,EACRF,SAAS,EACTrG,UAAW,MAEb,MAAOz9D,GACP,MAAMy9D,EAAYhtC,KAAK8oB,MAEvB,GADA9oB,KAAK8oB,MAAQ0oC,EACTjiF,aAAiBM,YACnB,MAAO,CAAE5I,KAAM,KAAMsI,MAAAA,EAAOgkE,QAAQ,EAAMF,SAAS,EAAOrG,UAAAA,GAE5D,GAAIz9D,IAAUkiF,EACZ,MAAO,CACLxqF,KAAMwqF,EAAYxqF,KAClBsI,MAAO,KACPgkE,QAAQ,EACRF,SAAS,EACTrG,UAAAA,GAIJ,MAAMz9D,GAIVmiF,sBACEnyB,EACAoyB,GAEA,IAAKpyB,EAAqB,OAAO,EACjC,MAAM0rB,gBAAEA,EAAFC,YAAmBA,GAAgB3rB,EACzC,IAAKoyB,EAAU,OAAO1G,GAAmB,GAAKC,GAAe,EACzDD,GAAmB,GACrBjrD,KAAK4hC,WAAWqpB,GAEdC,GAAe,GACjBlrD,KAAK0jB,MAAMwnC,EAAa/lC,EAAO3L,gBAanCo+B,wBACE,OACE53C,KAAK1iB,MAAMmkC,EAAG5uH,SACZmtG,KAAK8oB,MAAMhiD,KAAKmqC,SAClBjR,KAAK1iB,MAAMmkC,EAAG9lB,SACdqE,KAAK1iB,MAAMmkC,EAAG/P,MACd1R,KAAK1iB,MAAMmkC,EAAG9P,SACd3R,KAAK1iB,MAAMmkC,EAAG7P,SAQlB0sB,cAAcr3D,GACZ,MAAqB,gBAAdA,EAAKH,KAQdu3D,iBAAiBp3D,GACf,OAAOA,EAAKgd,GAAGpxF,KAQjB6tI,yBAAyBz5D,GACvB,OACiB,qBAAdA,EAAKH,MACU,6BAAdG,EAAKH,OACPk5B,KAAKs+B,cAAcr3D,EAAK0kB,UAI5Bg1C,gBAAgB15D,GACd,MACgB,6BAAdA,EAAKH,MACS,2BAAdG,EAAKH,KAITo2D,iBAAiBj2D,GACf,MAAqB,mBAAdA,EAAKH,KAGd85D,eAAe35D,GACb,MAAqB,iBAAdA,EAAKH,KAGd8qF,iBACEnvC,EAAgD,WAA5BziB,KAAKrrG,QAAQugI,YAGjC,MAAM28B,EAAY7xD,KAAK8oB,MAAMkL,OAC7Bh0B,KAAK8oB,MAAMkL,OAAS,GAEpB,MAAM89B,EAAyB9xD,KAAK+xD,oBACpC/xD,KAAK+xD,oBAAsB,IAAIpzE,IAG/B,MAAMqzE,EAAchyD,KAAKyiB,SACzBziB,KAAKyiB,SAAWA,EAEhB,MAAMwvC,EAAWjyD,KAAK6kB,MAChBpB,EAAezjB,KAAK4jC,kBAC1B5jC,KAAK6kB,MAAQ,IAAIpB,EAAazjB,KAAK0jB,MAAM/qB,KAAKqH,MAAOA,KAAKyiB,UAE1D,MAAMyvC,EAAelyD,KAAKkhD,UAC1BlhD,KAAKkhD,UAAY,IAAI/pB,GAErB,MAAMqyB,EAAgBxpD,KAAK2pD,WAC3B3pD,KAAK2pD,WAAa,IAAIJ,GAAkBvpD,KAAK0jB,MAAM/qB,KAAKqH,OAExD,MAAMmyD,EAAqBnyD,KAAKoyD,gBAGhC,OAFApyD,KAAKoyD,gBAAkB,IAAI1H,GAAuB1qD,KAAK0jB,MAAM/qB,KAAKqH,OAE3D,KAELA,KAAK8oB,MAAMkL,OAAS69B,EACpB7xD,KAAK+xD,oBAAsBD,EAG3B9xD,KAAKyiB,SAAWuvC,EAChBhyD,KAAK6kB,MAAQotC,EACbjyD,KAAKkhD,UAAYgR,EACjBlyD,KAAK2pD,WAAaH,EAClBxpD,KAAKoyD,gBAAkBD,GAI3BE,qBACE,IAAIC,EVjYa,EUkYbtyD,KAAKk7B,UAAU,kBAAoBl7B,KAAKyiB,WAC1C6vC,GVjYU,GUmYZtyD,KAAK6kB,MAAMF,MlBjYmB,GkBkY9B3kB,KAAKkhD,UAAUv8B,MAAM2tC,KCpVvB1zB,YAEE,OAAO,IAAIusB,GAAKnrD,KAAMA,KAAK8oB,MAAM9zC,MAAOgrB,KAAK8oB,MAAM+J,UAGrD+J,YAAyBhlD,EAAatQ,GAEpC,OAAO,IAAI6jF,GAAKnrD,KAAMpoB,EAAKtQ,GAI7Bm5D,gBAA6B35D,GAC3B,OAAOk5B,KAAK48B,YAAY91D,EAAKkO,MAAOlO,EAAKQ,IAAI0N,OAK/C8pD,WAAwB73D,EAASH,GAC/B,OAAOk5B,KAAK+8B,aACV91D,EACAH,EACAk5B,KAAK8oB,MAAM4L,WACX10B,KAAK8oB,MAAMyL,eAMfwI,aACE91D,EACAH,EACA8Q,EACAtQ,GAaA,OALAL,EAAKH,KAAOA,EACZG,EAAKjC,IAAM4S,EACX3Q,EAAKK,IAAItC,IAAMsC,EACX04B,KAAKrrG,QAAQ6zJ,SAAQvhF,EAAK0oB,MAAM,GAAK/X,GACzCooB,KAAKksD,eAAejlF,GACbA,EAGTi+E,mBAAmBj+E,EAAgB+N,EAAe69C,GAChD5rD,EAAK+N,MAAQA,EACb/N,EAAKK,IAAI0N,MAAQ69C,EACb7yB,KAAKrrG,QAAQ6zJ,SAAQvhF,EAAK0oB,MAAM,GAAK3a,GAG3CmwD,iBACEl+D,EACAjC,EAAeg7B,KAAK8oB,MAAM4L,WAC1B5B,EAAoB9yB,KAAK8oB,MAAMyL,eAE/BttD,EAAKjC,IAAMA,EACXiC,EAAKK,IAAItC,IAAM8tD,EACX9yB,KAAKrrG,QAAQ6zJ,SAAQvhF,EAAK0oB,MAAM,GAAK3qB,GAM3CmuE,2BAA2BlsE,EAAgBsrF,GACzCvyD,KAAKklD,mBAAmBj+E,EAAMsrF,EAAav9E,MAAOu9E,EAAajrF,IAAI0N,SC/CrEwqD,aAAav4D,EAAYw4D,GAAiB,GAAa,IAAAsO,EAAAykB,EACrD,IAAIj1B,EAwBJ,QAvBkB,4BAAdt2D,EAAKH,MAAL,OAAAinE,EAA2C9mE,EAAK41D,QAALkR,EAAYxQ,iBACzDA,EAAgB8tB,GAA8BpkF,GAC1Cw4D,EAKyB,eAAvBlC,EAAcz2D,KAChBk5B,KAAKoyD,gBAAgBxH,mCACnB3jF,EAAK+N,MACLmwC,EAAO5J,gCAEuB,qBAAvBgiB,EAAcz2D,MAIvBk5B,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAO5J,gCAGhCvb,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAO5J,iCAI1Bt0C,EAAKH,MACX,IAAK,aACL,IAAK,gBACL,IAAK,eACL,IAAK,oBACH,MAEF,IAAK,mBACHG,EAAKH,KAAO,gBACZ,IACE,IAAIK,EAAI,EAAGlC,EAASgC,EAAKgP,WAAWhR,OAAQ8W,EAAO9W,EAAS,EAC5DkC,EAAIlC,EACJkC,IACA,CAAA,IAAAsrF,EACA,MAAM95E,EAAO1R,EAAKgP,WAAW9O,GACvBurF,EAASvrF,IAAM4U,EACrBikB,KAAK0/B,iCAAiC/mD,EAAM+5E,EAAQjzB,GAGlDizB,GACc,gBAAd/5E,EAAK7R,MADL,OAAA2rF,EAEAxrF,EAAK41D,QAAL41B,EAAYxkB,eAEZjuC,KAAK2yD,iBAAiB1rF,EAAK41D,MAAMoR,eAGrC,MAEF,IAAK,iBACHjuC,KAAKw/B,aAAav4D,EAAKvzE,MAAO+rI,GAC9B,MAEF,IAAK,gBAAiB,CACpBz/B,KAAK4yD,sBAAsB3rF,GAE3BA,EAAKH,KAAO,cACZ,MAAMM,EAAMH,EAAKijB,SACjB8V,KAAKw/B,aAAap4D,EAAKq4D,GACvB,MAGF,IAAK,kBACHx4D,EAAKH,KAAO,eACZk5B,KAAKguC,iBAAiB/mE,EAAK8O,SAA3B,OAAAy8E,EAAqCvrF,EAAK41D,YAA1C,EAAqC21B,EAAYvkB,cAAexO,GAChE,MAEF,IAAK,uBACmB,MAAlBx4D,EAAKsjB,UACPyV,KAAK0jB,MAAMz8C,EAAKiiB,KAAKlkB,IAAKmgD,EAAOlJ,uBAGnCh1C,EAAKH,KAAO,2BACLG,EAAKsjB,SACZyV,KAAKw/B,aAAav4D,EAAKiiB,KAAMu2C,GAC7B,MAEF,IAAK,0BAEHz/B,KAAKw/B,aAAajC,EAAekC,GAOrC,OAAOx4D,EAGTy4D,iCACE/mD,EACA+5E,EACAjzB,GAEA,GAAkB,iBAAd9mD,EAAK7R,KAAyB,CAChC,MAAMyI,EACU,QAAdoJ,EAAKkmD,MAAgC,QAAdlmD,EAAKkmD,KACxB1Z,EAAO/H,mBACP+H,EAAO9H,iBAGbrd,KAAK0jB,MAAM/qC,EAAK3jF,IAAIggF,MAAOzF,OAEJ,kBAAdoJ,EAAK7R,MAA6B4rF,EAG3C1yD,KAAKw/B,aAAa7mD,EAAM8mD,GAFxBz/B,KAAK2yD,iBAAiBh6E,EAAK3D,OAQ/Bg5D,iBACE6B,EACAC,EACArQ,GAEA,IAAIz6D,EAAM6qE,EAAS5qE,OACnB,GAAID,EAAK,CACP,MAAM+W,EAAO8zD,EAAS7qE,EAAM,GAC5B,GAAmB,iBAAX,MAAJ+W,OAAA,EAAAA,EAAMjV,QACN9B,OACG,GAAmB,mBAAX,MAAJ+W,OAAA,EAAAA,EAAMjV,MAA0B,CACzCiV,EAAKjV,KAAO,cACZ,IAAIM,EAAM2U,EAAKmO,SACf8V,KAAKw/B,aAAap4D,EAAKq4D,GACvBr4D,EAAMikF,GAA8BjkF,GAErB,eAAbA,EAAIN,MACS,qBAAbM,EAAIN,MACS,iBAAbM,EAAIN,MACS,kBAAbM,EAAIN,MAEJk5B,KAAK4hC,WAAWx6D,EAAI4N,OAGlB86D,GACF9vC,KAAK6yD,4BAA4B/iB,KAGjC9qE,GAGN,IAAK,IAAImC,EAAI,EAAGA,EAAInC,EAAKmC,IAAK,CAC5B,MAAM67E,EAAMnT,EAAS1oE,GACjB67E,IACFhjD,KAAKw/B,aAAawjB,EAAKvjB,GACN,gBAAbujB,EAAIl8E,MACNk5B,KAAK2yD,iBAAiB3P,EAAIhuE,QAIhC,OAAO66D,EAKTE,iBACEF,EACAG,GAEA,OAAOH,EAGTijB,qBACEjjB,EACAG,GAEAhwC,KAAK+vC,iBAAiBF,EAAUG,GAEhC,IAAK,MAAMvD,KAAQoD,EACE,qBAAX,MAAJpD,OAAA,EAAAA,EAAM3lE,OACRk5B,KAAK8yD,qBAAqBrmB,EAAK12D,UAOrCg9E,YACExzB,EACAuN,GAEA,MAAM7lE,EAAO+4B,KAAK4+B,YAOlB,OANA5+B,KAAK5iB,OACLnW,EAAKijB,SAAW8V,KAAKyiC,wBACnBlD,OACA7pI,EACAo3I,GAEK9sC,KAAK8+B,WAAW73D,EAAM,iBAK/B+rF,mBACE,MAAM/rF,EAAO+4B,KAAK4+B,YAGlB,OAFA5+B,KAAK5iB,OACLnW,EAAKijB,SAAW8V,KAAKsyC,mBACdtyC,KAAK8+B,WAAW73D,EAAM,eAI/BqrE,mBAEE,OAAQtyC,KAAK8oB,MAAMhiD,MACjB,KAAK26C,EAAGzP,SAAU,CAChB,MAAM/qC,EAAO+4B,KAAK4+B,YAOlB,OANA5+B,KAAK5iB,OACLnW,EAAK8O,SAAWiqB,KAAKi7C,iBACnBx5B,EAAGtP,SADW,IAGd,GAEKnS,KAAK8+B,WAAW73D,EAAM,gBAG/B,KAAKw6C,EAAGpP,OACN,OAAOrS,KAAKizD,gBAAgBxxC,EAAGjP,QAAQ,GAI3C,OAAOxS,KAAK6kC,kBAIdoW,iBACEj7D,EACAkzE,EACA/6E,EACAq6D,GAEA,MAAM2gB,EAA6C,GACnD,IAAIt6E,GAAQ,EACZ,MAAQmnB,KAAK8hC,IAAI9hD,IAMf,GALInH,EACFA,GAAQ,EAERmnB,KAAKuiC,OAAO9gB,EAAG75B,OAEbzP,GAAc6nB,KAAK1iB,MAAMmkC,EAAG75B,OAE9BurE,EAAKroF,KAAK,UACL,CAAA,GAAIk1B,KAAK8hC,IAAI9hD,GAClB,MACK,GAAIggB,KAAK1iB,MAAMmkC,EAAGvO,UAAW,CAClCigD,EAAKroF,KAAKk1B,KAAKkxC,6BAA6BlxC,KAAKgzD,qBACjDhzD,KAAK8lD,oBAAoBoN,GACzBlzD,KAAKuiC,OAAOviD,GACZ,MACK,CACL,MAAM8iE,EAAa,GAKnB,IAJI9iD,KAAK1iB,MAAMmkC,EAAGrZ,KAAOpI,KAAKk7B,UAAU,eACtCl7B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAO9E,+BAG/BrgB,KAAK1iB,MAAMmkC,EAAGrZ,KACnB06C,EAAWh4E,KAAKk1B,KAAKozD,kBAEvBD,EAAKroF,KAAKk1B,KAAK6iD,wBAAwBrQ,EAAgBsQ,KAG3D,OAAOqQ,EAGTtQ,wBACErQ,EACAsQ,GAEA,MAAM55D,EAAO8W,KAAKmxC,oBAClBnxC,KAAKkxC,6BAA6BhoD,GAClC,MAAM85D,EAAMhjD,KAAKmxC,kBAAkBjoD,EAAKlU,MAAOkU,EAAK5hB,IAAI0N,MAAOkU,GAI/D,OAHI45D,EAAW79E,SACbikB,EAAK45D,WAAaA,GAEbE,EAIT9R,6BAA6BrF,GAC3B,OAAOA,EAKTsF,kBACE7R,EACAzM,EACA3pC,GACS,IAAAmqE,EAAAC,EAAAC,EAKT,GAJA1gC,EAAQ,OAAAwgC,EAAGxgC,GAAHwgC,EAAerzD,KAAK8oB,MAAM+J,SAClCyM,EAAQ,OAAAg0B,EAAGh0B,GAAHg0B,EAAetzD,KAAK8oB,MAAM9zC,MAElCkU,EAAI,OAAAqqE,EAAGrqE,GAAHqqE,EAAWvzD,KAAKsyC,oBACftyC,KAAK8hC,IAAIrgB,EAAGlO,IAAK,OAAOrqB,EAE7B,MAAMjiB,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GAGxC,OAFA5rD,EAAKiiB,KAAOA,EACZjiB,EAAKkiB,MAAQ6W,KAAKyiC,0BACXziC,KAAK8+B,WAAW73D,EAAM,qBAmB/BopE,UACE5D,EACA8E,EACAn6C,EpBlV8B,GoBmV9Bo8D,EACAC,EACAC,GAA8B,GAE9B,OAAQjnB,EAAK3lE,MACX,IAAK,aAAc,CACjB,MAAMj0E,KAAEA,GAAS45I,EAEfzsC,KAAK8oB,MAAM6J,SAIV+gC,EACG9wC,EAAyB/vH,EAAMmtG,KAAKyiB,UACpCE,EAA6B9vH,KAEjCmtG,KAAK0jB,MACH+oB,EAAKz3D,MpBpWiB,KoBqWtBoiB,EACI+tB,EAAO7G,oBACP6G,EAAO5G,2BACX1rH,GAIA2gK,IACEA,EAAaz0E,IAAIlsF,GACnBmtG,KAAK0jB,MAAM+oB,EAAKz3D,MAAOmwC,EAAOhI,WAE9Bq2C,EAAax0E,IAAInsF,IAGjB4gK,GAA+B,QAAT5gK,GACxBmtG,KAAK0jB,MAAM+oB,EAAKz3D,MAAOmwC,EAAOtJ,qBpBpXN,GoBsXpBzkB,GACJ4I,KAAK6kB,MAAMC,YAAYjyH,EAAMukG,EAAaq1C,EAAKz3D,OAEjD,MAGF,IAAK,mBpB5XuB,KoB6XtBoiB,GACF4I,KAAK0jB,MAAM+oB,EAAKz3D,MAAOmwC,EAAO1J,+BAEhC,MAEF,IAAK,gBACH,IAAK,IAAI9iC,KAAQ8zD,EAAKx2D,WAAY,CAChC,GAAI+pB,KAAKk9B,iBAAiBvkD,GAAOA,EAAOA,EAAKjlF,WAIxC,GAAIssG,KAAK4gC,eAAejoD,GAAO,SAEpCqnB,KAAKqwC,UACH13D,EACA,+BACAye,EACAo8D,EACAC,GAGJ,MAEF,IAAK,eACH,IAAK,MAAME,KAAQlnB,EAAK12D,SAClB49E,GACF3zD,KAAKqwC,UACHsjB,EACA,8BACAv8D,EACAo8D,EACAC,GAIN,MAEF,IAAK,oBACHzzD,KAAKqwC,UACH5D,EAAKvjD,KACL,qBACAkO,EACAo8D,GAEF,MAEF,IAAK,cACHxzD,KAAKqwC,UACH5D,EAAKviD,SACL,eACAkN,EACAo8D,GAEF,MAEF,IAAK,0BACHxzD,KAAKqwC,UACH5D,EAAKvgD,WACL,2BACAkL,EACAo8D,GAEF,MAEF,QACExzD,KAAK0jB,MACH+oB,EAAKz3D,MpB/bmB,KoBgcxBoiB,EACI+tB,EAAOjK,WACPiK,EAAOhK,kBACXo2B,IAMRqhB,sBAAsB3rF,GAEK,eAAvBA,EAAKijB,SAASpjB,MACS,qBAAvBG,EAAKijB,SAASpjB,MAEdk5B,KAAK0jB,MAAMz8C,EAAKijB,SAASlV,MAAOmwC,EAAOxJ,8BAI3CmqC,oBAAoB9lE,GACdggB,KAAK1iB,MAAMmkC,EAAG75B,SACZoY,KAAK69C,sBAAwB79D,EAC/BggB,KAAK6yD,4BAA4B7yD,KAAK8oB,MAAM9zC,OAE5CgrB,KAAK2yD,iBAAiB3yD,KAAK8oB,MAAM9zC,QAKvC29E,iBAAiB/6E,GACf,MAAMooB,KAAK0jB,MAAM9rC,EAAKutC,EAAOzL,kBAG/Bm5C,4BAA4Bj7E,GAC1BooB,KAAK0jB,MAAM9rC,EAAKutC,EAAOjH,qBGpbzB01C,WACEj7E,EACAk7E,EACAC,EACAv0B,GAEA,GACgB,kBAAd5mD,EAAK7R,MACLk5B,KAAK4gC,eAAejoD,IACpBA,EAAKiT,UAELjT,EAAKoT,UAEL,OAGF,MAAM/2F,EAAM2jF,EAAK3jF,IAIjB,GAAa,eAFa,eAAbA,EAAI8xE,KAAwB9xE,EAAInC,KAAOmC,EAAItB,OAE9B,CACxB,GAAImgK,EAEF,YADA7zD,KAAK0jB,MAAM1uH,EAAIggF,MAAOmwC,EAAOlH,eAG3B61C,EAASC,OACPx0B,GAGuC,IAArCA,EAAoB2rB,cACtB3rB,EAAoB2rB,YAAcl2J,EAAIggF,OAGxCgrB,KAAK0jB,MAAM1uH,EAAIggF,MAAOmwC,EAAO3L,iBAIjCs6C,EAASC,MAAO,GAIpBC,qBAAqBvnB,EAAoBzZ,GACvC,MACgB,4BAAdyZ,EAAK3lE,MAAsC2lE,EAAKz3D,QAAUg+C,EAK9DwzB,gBACE,IAAI8L,EfxJa,EeyJbtyD,KAAKk7B,UAAU,kBAAoBl7B,KAAKyiB,WAC1C6vC,GfxJU,Ge0JZtyD,KAAK6kB,MAAMF,MvBxJmB,GuByJ9B3kB,KAAKkhD,UAAUv8B,MAAM2tC,GACrBtyD,KAAKy0C,YACL,MAAMhI,EAAOzsC,KAAKsiC,kBASlB,OARKtiC,KAAK1iB,MAAMmkC,EAAG1P,MACjB/R,KAAK4hC,aAEP6K,EAAKpxD,SAAW2kB,KAAK8oB,MAAMztC,SAC3BoxD,EAAK1Z,OAAS/yB,KAAK8oB,MAAMiK,OACrB/yB,KAAKrrG,QAAQ8zJ,SACfhc,EAAKgc,OAASzoD,KAAKyoD,QAEdhc,EAsBTnK,gBACE2xB,EACA10B,GAEA,OAAI00B,EACKj0D,KAAKk0D,eAAc,IACxBl0D,KAAKm0D,oBAAoB50B,KAGtBv/B,KAAKo0D,YAAW,IAAMp0D,KAAKm0D,oBAAoB50B,KAIxD40B,oBAAoB50B,GAClB,MAAMD,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SACtB4Z,EAAOzsC,KAAKutC,iBAAiBhO,GACnC,GAAIv/B,KAAK1iB,MAAMmkC,EAAG75B,OAAQ,CACxB,MAAM3gB,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GAExC,IADA5rD,EAAKoiB,YAAc,CAACojD,GACbzsC,KAAK8hC,IAAIrgB,EAAG75B,QACjB3gB,EAAKoiB,YAAYve,KAAKk1B,KAAKutC,iBAAiBhO,IAG9C,OADAv/B,KAAK+vC,iBAAiB9oE,EAAKoiB,aACpB2W,KAAK8+B,WAAW73D,EAAM,sBAE/B,OAAOwlE,EAIT4nB,2BACE90B,EACAqT,EACA9F,GAEA,OAAO9sC,KAAKk0D,eAAc,IACxBl0D,KAAKutC,iBACHhO,EACAqT,EACA9F,KAMNrK,wBACElD,EACAqT,EACA9F,GAEA,OAAO9sC,KAAKo0D,YAAW,IACrBp0D,KAAKutC,iBACHhO,EACAqT,EACA9F,KASNS,iBACEhO,EACAqT,EACA9F,GAEA,MAAMxN,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAC5B,GAAI7yB,KAAK2lC,aAAa,UAChB3lC,KAAKkhD,UAAU3pB,SAAU,CAC3B,IAAIruC,EAAO8W,KAAKs0D,aAIhB,OAHI1hB,IACF1pD,EAAO0pD,EAAeh1C,KAAKoC,KAAM9W,EAAMo2C,EAAUzM,IAE5C3pC,EAIX,IAAIqrE,EACAh1B,EACFg1B,GAAsB,GAEtBh1B,EAAsB,IAAIyrB,GAC1BuJ,GAAsB,IAGpBv0D,KAAK1iB,MAAMmkC,EAAG/O,SAAW1S,KAAK1iB,MAAMmkC,EAAG5uH,SACzCmtG,KAAK8oB,MAAMkK,iBAAmBhzB,KAAK8oB,MAAM9zC,OAG3C,IAAIkU,EAAO8W,KAAKw0D,sBACdj1B,EACAuN,GAKF,GAHI8F,IACF1pD,EAAO0pD,EAAeh1C,KAAKoC,KAAM9W,EAAMo2C,EAAUzM,IAE/C7yB,KAAK8oB,MAAMhiD,KAAK+pC,SAAU,CAC5B,MAAM5pC,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GAClCtoC,EAAWyV,KAAK8oB,MAAMp1H,MAkB5B,OAjBAuzE,EAAKsjB,SAAWA,EAEZyV,KAAK1iB,MAAMmkC,EAAGlO,KAChBtsC,EAAKiiB,KAAO8W,KAAKw/B,aAAat2C,GAAkB,GAChDq2C,EAAoB2rB,aAAe,GAEnCjkF,EAAKiiB,KAAOA,EAGVq2C,EAAoB0rB,iBAAmBhkF,EAAKiiB,KAAKlU,QACnDuqD,EAAoB0rB,iBAAmB,GAGzCjrD,KAAKqwC,UAAUnnD,EAAM,yBAErB8W,KAAK5iB,OACLnW,EAAKkiB,MAAQ6W,KAAKutC,mBACXvtC,KAAK8+B,WAAW73D,EAAM,wBAK/B,OAJWstF,GACTv0D,KAAK0xD,sBAAsBnyB,GAAqB,GAG3Cr2C,EAMTsrE,sBACEj1B,EACAuN,GAEA,MAAMxN,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SACtBG,EAAmBhzB,KAAK8oB,MAAMkK,iBAC9ByZ,EAAOzsC,KAAKy0D,aAAal1B,GAE/B,OAAIv/B,KAAKg0D,qBAAqBvnB,EAAMzZ,GAC3ByZ,EAGFzsC,KAAK6sC,iBAAiBJ,EAAMnN,EAAUzM,EAAUia,GAGzDD,iBACEJ,EACAnN,EACAzM,EAGAia,GAEA,GAAI9sC,KAAK8hC,IAAIrgB,EAAG1O,UAAW,CACzB,MAAM9rC,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GAKxC,OAJA5rD,EAAKxB,KAAOgnE,EACZxlE,EAAK2P,WAAaopB,KAAKyiC,0BACvBziC,KAAKuiC,OAAO9gB,EAAG7O,OACf3rC,EAAK4P,UAAYmpB,KAAKutC,mBACfvtC,KAAK8+B,WAAW73D,EAAM,yBAE/B,OAAOwlE,EAMTgoB,aAAal1B,GACX,MAAMD,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SACtBG,EAAmBhzB,KAAK8oB,MAAMkK,iBAC9ByZ,EAAOzsC,KAAK89C,gBAAgBve,GAElC,OAAIv/B,KAAKg0D,qBAAqBvnB,EAAMzZ,GAC3ByZ,EAGFzsC,KAAK4jD,YAAYnX,EAAMnN,EAAUzM,GAAW,GASrD+wB,YACE16D,EACA26D,EACAC,EACAC,GAEA,IAAI2Q,EAAO10D,KAAK8oB,MAAMhiD,KAAKqqC,MAC3B,GAAY,MAARujD,IAAiB10D,KAAKkhD,UAAUzpB,QAAUz3B,KAAK1iB,MAAMmkC,EAAGhL,OACtDi+C,EAAO3Q,EAAS,CAClB,MAAMiN,EAAKhxD,KAAK8oB,MAAMhiD,KACtB,GAAIkqF,IAAOvvC,EAAG7N,SAAU,CAEtB,GADA5T,KAAKwnD,aAAa,oBACdxnD,KAAK8oB,MAAMiL,2BACb,OAAO7qC,EAET8W,KAAK8oB,MAAMsK,YAAa,EACxBpzB,KAAK20D,6BAA6BzrE,EAAM26D,GAE1C,MAAM58E,EAAO+4B,KAAK48B,YAAYinB,EAAcC,GAC5C78E,EAAKiiB,KAAOA,EACZjiB,EAAKsjB,SAAWyV,KAAK8oB,MAAMp1H,MAE3B,MAAMkhK,EAAU5D,IAAOvvC,EAAG3N,WAAak9C,IAAOvvC,EAAG1N,WAC3C8gD,EAAW7D,IAAOvvC,EAAG5N,kBAU3B,GARIghD,IAGFH,EAASjzC,EAAG1N,WAAqC5C,OAGnDnR,KAAK5iB,OAGH4zE,IAAOvvC,EAAG7N,UAC+C,YAAzD5T,KAAKo7B,gBAAgB,mBAAoB,aAGvCp7B,KAAK1iB,MAAMmkC,EAAG5uH,OACO,UAArBmtG,KAAK8oB,MAAMp1H,OACXssG,KAAKkhD,UAAU5pB,SAEf,MAAMt3B,KAAK0jB,MACT1jB,KAAK8oB,MAAM9zC,MACXmwC,EAAOhG,kCAKbl4C,EAAKkiB,MAAQ6W,KAAK80D,qBAAqB9D,EAAI0D,GAC3C10D,KAAK8+B,WACH73D,EACA2tF,GAAWC,EAAW,oBAAsB,oBAO9C,MAAME,EAAS/0D,KAAK8oB,MAAMhiD,KAC1B,GACG+tF,IAAaE,IAAWtzC,EAAG3N,WAAaihD,IAAWtzC,EAAG1N,aACtD6gD,GAAWG,IAAWtzC,EAAG5N,kBAE1B,MAAM7T,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAO/I,2BAG5C,OAAOpc,KAAK4jD,YAAY38E,EAAM48E,EAAcC,EAAcC,GAG9D,OAAO76D,EAMT4rE,qBAAqB9D,EAAe0D,GAClC,MAAMp1B,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAC5B,OAAQm+B,GACN,KAAKvvC,EAAG7N,SACN,OAAQ5T,KAAKo7B,gBAAgB,mBAAoB,aAC/C,IAAK,QACH,OAAOp7B,KAAKg1D,4BAA2B,IAC9Bh1D,KAAKi1D,uBACVj1D,KAAKk1D,yBAAyBlE,EAAI0D,GAClCp1B,EACAzM,KAGN,IAAK,SACH,OAAO7yB,KAAKm1D,gCAA+B,IAClCn1D,KAAKo1D,wBAAwBV,KAK5C,QACE,OAAO10D,KAAKk1D,yBAAyBlE,EAAI0D,IAO/CQ,yBAAyBlE,EAAe0D,GACtC,MAAMp1B,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAE5B,OAAO7yB,KAAK4jD,YACV5jD,KAAK89C,kBACLxe,EACAzM,EACAm+B,EAAG9/C,iBAAmBwjD,EAAO,EAAIA,GAIrCW,2BAA2BpuF,GACrB+4B,KAAK1iB,MAAMmkC,EAAG/M,WAChB1U,KAAK0jB,MACHz8C,EAAKijB,SAASlV,MACdmwC,EAAOpF,oCAOb+9B,gBACEve,EACA+1B,GAEA,MAAMh2B,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SACtB0iC,EAAUv1D,KAAK2lC,aAAa,SAElC,GAAI4vB,GAAWv1D,KAAKw1D,iBAAkB,CACpCx1D,KAAK5iB,OACL,MAAMqvD,EAAOzsC,KAAKy1D,WAAWn2B,EAAUzM,GAEvC,OADKyiC,GAAUt1D,KAAKq1D,2BAA2B5oB,GACxCA,EAET,GACEzsC,KAAK2lC,aAAa,WAClB,MAAA3lC,KAAK69C,sBACJ79C,KAAKyiD,wBAEN,OAAOziD,KAAK01D,wBAEd,MAAMC,EAAS31D,KAAK1iB,MAAMmkC,EAAGhO,QACvBxsC,EAAO+4B,KAAK4+B,YAClB,GAAI5+B,KAAK8oB,MAAMhiD,KAAK6jB,OAAQ,CAC1B1jB,EAAKsjB,SAAWyV,KAAK8oB,MAAMp1H,MAC3BuzE,EAAK0jB,QAAS,EAEVqV,KAAK1iB,MAAMmkC,EAAGhM,SAChBzV,KAAKwnD,aAAa,oBAEpB,MAAMoO,EAAW51D,KAAK1iB,MAAMmkC,EAAG5K,SAO/B,GANA7W,KAAK5iB,OAELnW,EAAKijB,SAAW8V,KAAK89C,gBAAgB,MAAM,GAE3C99C,KAAK0xD,sBAAsBnyB,GAAqB,GAE5Cv/B,KAAK8oB,MAAM6J,QAAUijC,EAAU,CACjC,MAAMxuF,EAAMH,EAAKijB,SAEA,eAAb9iB,EAAIN,KACNk5B,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAO9G,cACrBre,KAAK0gC,yBAAyBt5D,IACvC44B,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAOhM,oBAIlC,IAAKw8C,EAEH,OADKL,GAAUt1D,KAAKq1D,2BAA2BpuF,GACxC+4B,KAAK8+B,WAAW73D,EAAM,mBAIjC,MAAMwlE,EAAOzsC,KAAK61D,YAAY5uF,EAAM0uF,EAAQp2B,GAE5C,GAAIg2B,EAAS,CAIX,IAHmBv1D,KAAKk7B,UAAU,eAC9Bl7B,KAAK8oB,MAAMhiD,KAAK6pC,WAChB3Q,KAAK8oB,MAAMhiD,KAAK6pC,aAAe3Q,KAAK1iB,MAAMmkC,EAAGlN,WAC9BvU,KAAK81D,mBAOtB,OANA91D,KAAKwsD,eACHltB,EACAt/B,KAAKk7B,UAAU,iBACX/V,EAAOhN,uBACPgN,EAAO/M,yBAENpY,KAAKy1D,WAAWn2B,EAAUzM,GAIrC,OAAO4Z,EAITopB,YACE5uF,EACA0uF,EACAp2B,GAEA,GAAIo2B,EAEF,OADA31D,KAAKqwC,UAAUppE,EAAKijB,SAAU,oBACvB8V,KAAK8+B,WAAW73D,EAAM,oBAG/B,MAAMq4D,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAC5B,IAAI4Z,EAAOzsC,KAAK+1D,oBAAoBx2B,GACpC,GAAIv/B,KAAK0xD,sBAAsBnyB,GAAqB,GAAQ,OAAOkN,EACnE,KAAOzsC,KAAK8oB,MAAMhiD,KAAK+jB,UAAYmV,KAAKurC,sBAAsB,CAC5D,MAAMtkE,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GACxC5rD,EAAKsjB,SAAWyV,KAAK8oB,MAAMp1H,MAC3BuzE,EAAK0jB,QAAS,EACd1jB,EAAKijB,SAAWuiD,EAChBzsC,KAAKqwC,UAAU5D,EAAM,qBACrBzsC,KAAK5iB,OACLqvD,EAAOzsC,KAAK8+B,WAAW73D,EAAM,oBAE/B,OAAOwlE,EAKTspB,oBAAoBx2B,GAClB,MAAMD,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SACtBG,EAAmBhzB,KAAK8oB,MAAMkK,iBAC9ByZ,EAAOzsC,KAAKmiC,cAAc5C,GAEhC,OAAIv/B,KAAKg0D,qBAAqBvnB,EAAMzZ,GAC3ByZ,EAGFzsC,KAAK+zC,gBAAgBtH,EAAMnN,EAAUzM,GAG9CkhB,gBACE3T,EACAd,EACAzM,EACAwN,GAEA,MAAMvX,EAAQ,CACZwX,qBAAqB,EACrB01B,gBAAiBh2D,KAAKyjD,qBAAqBrjB,GAC3CG,MAAM,GAER,GACEH,EAAOpgC,KAAKmgC,eAAeC,EAAMd,EAAUzM,EAAUwN,EAASvX,GAG9DA,EAAMktC,iBAAkB,SAChBltC,EAAMyX,MAChB,OAAOH,EAOTD,eACEC,EACAd,EACAzM,EACAwN,EACAvX,GAEA,IAAKuX,GAAWrgC,KAAK8hC,IAAIrgB,EAAG5O,aAC1B,OAAO7S,KAAKi2D,UAAU71B,EAAMd,EAAUzM,EAAUwN,EAASvX,GACpD,GAAI9oB,KAAK1iB,MAAMmkC,EAAGtO,WACvB,OAAOnT,KAAK2jD,8BACVvjB,EACAd,EACAzM,EACA/J,GAIJ,IAAI8W,GAAW,EACf,GAAI5/B,KAAK1iB,MAAMmkC,EAAGzO,aAAc,CAC9B,GAAIqtB,GAAW,KAAArgC,KAAK69C,oBAGlB,OADA/0B,EAAMyX,MAAO,EACNH,EAETtX,EAAMwX,oBAAsBV,GAAW,EACvC5/B,KAAK5iB,OAGP,OAAKijD,GAAWrgC,KAAK1iB,MAAMmkC,EAAG/O,QACrB1S,KAAKk2D,gCACV91B,EACAd,EACAzM,EACA/J,EACA8W,GAEOA,GAAY5/B,KAAK1iB,MAAMmkC,EAAGzP,WAAahS,KAAK8hC,IAAIrgB,EAAG3O,KACrD9S,KAAKm2D,YAAY/1B,EAAMd,EAAUzM,EAAU/J,EAAO8W,IAEzD9W,EAAMyX,MAAO,EACNH,GAQX+1B,YACE/1B,EACAd,EACAzM,EACA/J,EACA8W,GAEA,MAAM34D,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GAClCjnC,EAAWoU,KAAK8hC,IAAIrgB,EAAGzP,UAC7B/qC,EAAKivD,OAASkK,EACdn5D,EAAK2kB,SAAWA,EAChB,MAAMkmB,GACHlmB,GAAYoU,KAAK1iB,MAAMmkC,EAAG3P,cAAgB9R,KAAK8oB,MAAMp1H,MAClDi4F,EAAWC,EACboU,KAAKsiC,kBACLxwB,EACA9R,KAAKo2D,mBACLp2D,KAAK6kC,iBAAgB,GAczB,OAZoB,IAAhB/yB,IACuB,UAArB7qC,EAAKivD,OAAOpvD,MACdk5B,KAAK0jB,MAAM4b,EAAUna,EAAOtG,mBAE9B7e,KAAK2pD,WAAWM,eAAen4C,EAAanmB,EAAS3W,QAEvD/N,EAAK0kB,SAAWA,EAEZC,GACFoU,KAAKuiC,OAAO9gB,EAAGtP,UAGb2W,EAAMwX,qBACRr5D,EAAK24D,SAAWA,EACT5/B,KAAK8+B,WAAW73D,EAAM,6BAEtB+4B,KAAK8+B,WAAW73D,EAAM,oBAKjCgvF,UACE71B,EACAd,EACAzM,EACAwN,EACAvX,GAEA,MAAM7hD,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GAIxC,OAHA5rD,EAAKivD,OAASkK,EACdn5D,EAAKkP,OAAS6pB,KAAKq2D,kBACnBvtC,EAAMyX,MAAO,EACNvgC,KAAK+zC,gBACV/zC,KAAK8+B,WAAW73D,EAAM,kBACtBq4D,EACAzM,EACAwN,GAQJ61B,gCACE91B,EACAd,EACAzM,EACA/J,EACA8W,GAEA,MAAM+iB,EAA4B3iD,KAAK8oB,MAAMqK,uBAC7C,IAAIoM,EAAsB,KAE1Bv/B,KAAK8oB,MAAMqK,wBAAyB,EACpCnzB,KAAK5iB,OAEL,IAAInW,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GA2CtC,OA1CA5rD,EAAKkP,OAASiqD,EAEVtX,EAAMktC,kBACRh2D,KAAKoyD,gBAAgBztC,MNxiBlB,IAAI0lC,GA3K4B,IMotBnC9qB,EAAsB,IAAIyrB,IAGxBliC,EAAMwX,sBACRr5D,EAAK24D,SAAWA,GAIhB34D,EAAKoP,UADHupD,EACe5/B,KAAKg0C,6BAA6BvyB,EAAG9O,QAErC3S,KAAKg0C,6BACpBvyB,EAAG9O,OACW,WAAdytB,EAAKt5D,KACS,UAAds5D,EAAKt5D,KACLG,EACAs4D,GAGJv/B,KAAK2/B,qBAAqB14D,EAAM6hD,EAAMwX,qBAElCxX,EAAMktC,iBAAmBh2D,KAAK2yC,0BAA4B/S,GAC5D9W,EAAMyX,MAAO,EACbvgC,KAAKoyD,gBAAgBtH,oBACrB9qD,KAAKoyD,gBAAgBxtC,OACrB39C,EAAO+4B,KAAK0yC,kCACV1yC,KAAK48B,YAAY0C,EAAUzM,GAC3B5rD,KAGE6hD,EAAMktC,kBACRh2D,KAAK0xD,sBAAsBnyB,GAAqB,GAChDv/B,KAAKoyD,gBAAgBxtC,QAEvB5kB,KAAK+/B,sBAAsB94D,IAG7B+4B,KAAK8oB,MAAMqK,uBAAyBwvB,EAE7B17E,EAGT84D,sBACE94D,EACA+oE,GAEAhwC,KAAK8yD,qBAAqB7rF,EAAKoP,UAAW25D,GAK5C2T,8BACEvjB,EACAd,EACAzM,EACA/J,GAEA,MAAM7hD,EAAmC+4B,KAAK48B,YAC5C0C,EACAzM,GAOF,OALA5rD,EAAKzC,IAAM47D,EACXn5D,EAAKqvF,MAAQt2D,KAAKu9C,eAAc,GAC5Bz0B,EAAMwX,qBACRtgC,KAAK0jB,MAAM4b,EAAUna,EAAOlI,4BAEvBjd,KAAK8+B,WAAW73D,EAAM,4BAG/Bw8E,qBAAqBrjB,GACnB,MACgB,eAAdA,EAAKt5D,MACS,UAAds5D,EAAKvtI,MACLmtG,KAAK8oB,MAAM4L,aAAe0L,EAAKp7D,MAC9Bg7B,KAAKurC,sBAENnL,EAAKp7D,IAAMo7D,EAAKprD,OAAU,GAC1BorD,EAAKprD,QAAUgrB,KAAK8oB,MAAMkK,iBAI9B2M,qBACE14D,EACA24D,GAEA,GAAyB,WAArB34D,EAAKkP,OAAOrP,KAUd,GAT8B,IAA1BG,EAAKoP,UAAUpR,SAIV+6B,KAAKk7B,UAAU,qBAClBl7B,KAAKwnD,aAAa,qBAIM,IAA1BvgF,EAAKoP,UAAUpR,QAAgBgC,EAAKoP,UAAUpR,OAAS,EACzD+6B,KAAK0jB,MACHz8C,EAAK+N,MACLmwC,EAAO5K,gBACPva,KAAKk7B,UAAU,qBACbl7B,KAAKk7B,UAAU,oBACb,uBACA,qBAGN,IAAK,MAAM9zD,KAAOH,EAAKoP,UACJ,kBAAbjP,EAAIN,MACNk5B,KAAK0jB,MAAMt8C,EAAI4N,MAAOmwC,EAAO1K,0BAKrC,OAAOza,KAAK8+B,WACV73D,EACA24D,EAAW,yBAA2B,kBAI1CoU,6BACEh0D,EACAu2E,EACAC,EACAC,EACAl3B,GAEA,MAAM4zB,EAAO,GACb,IAAIt6E,GAAQ,EACZ,MAAM69E,EAAgC12D,KAAK8oB,MAAMiL,2BAGjD,IAFA/zB,KAAK8oB,MAAMiL,4BAA6B,GAEhC/zB,KAAK8hC,IAAI9hD,IAAQ,CACvB,GAAInH,EACFA,GAAQ,OAGR,GADAmnB,KAAKuiC,OAAO9gB,EAAG75B,OACXoY,KAAK1iB,MAAM0C,GAAQ,EAEnBu2E,GACCv2D,KAAKk7B,UAAU,qBACfl7B,KAAKk7B,UAAU,qBAEhBl7B,KAAK0jB,MACH1jB,KAAK8oB,MAAM2L,aACXtP,EAAO7K,iCAGPm8C,GACFz2D,KAAKy9B,SACHg5B,EACA,gBACAz2D,KAAK8oB,MAAM2L,cAGfz0B,KAAK5iB,OACL,MAIJ+1E,EAAKroF,KACHk1B,KAAK22D,mBACH,EACAp3B,EACA,CAAEvqD,MAAO,GACTwhF,IAON,OAFAx2D,KAAK8oB,MAAMiL,2BAA6B2iC,EAEjCvD,EAGTxgB,wBACE,OAAO3yC,KAAK1iB,MAAMmkC,EAAGxO,SAAWjT,KAAKurC,qBAGvCmH,kCACEzrE,EACA22B,GAC2B,IAAAg5D,EAQ3B,OAPA52D,KAAKuiC,OAAO9gB,EAAGxO,OACfjT,KAAKu0C,qBACHttE,EACA22B,EAAKvnB,WACL,EAHF,OAAAugF,EAIEh5D,EAAKi/B,YAJP,EAIE+5B,EAAY3oB,eAEPhnE,EAKTovF,kBACE,MAAM/2B,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAC5B,OAAO7yB,KAAK+zC,gBAAgB/zC,KAAKmiC,gBAAiB7C,EAAUzM,GAAU,GAexEsP,cAAc5C,GACZ,IAAIt4D,EAEJ,OAAQ+4B,KAAK8oB,MAAMhiD,MACjB,KAAK26C,EAAGxL,OACN,OAAOjW,KAAK62D,aAEd,KAAKp1C,EAAGpL,QAIN,OAHApvC,EAAO+4B,KAAK4+B,YACZ5+B,KAAK5iB,OAED4iB,KAAK1iB,MAAMmkC,EAAG3O,KACT9S,KAAK82D,wBAAwB7vF,IAGjC+4B,KAAK1iB,MAAMmkC,EAAG/O,SACjB1S,KAAK0jB,MAAM1jB,KAAK8oB,MAAM2L,aAActP,EAAOhF,mBAEtCngB,KAAK8+B,WAAW73D,EAAM,WAC/B,KAAKw6C,EAAGzL,MAGN,OAFA/uC,EAAO+4B,KAAK4+B,YACZ5+B,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAM,kBAE/B,KAAKw6C,EAAG5uH,KAAM,CACZ,MAAMihJ,EAAa9zC,KAAK8oB,MAAMkK,mBAAqBhzB,KAAK8oB,MAAM9zC,MACxD6/C,EAAc70B,KAAK8oB,MAAM+L,YACzB5wC,EAAK+b,KAAK6kC,kBAEhB,IAAKhQ,GAA2B,UAAZ5wC,EAAGpxF,OAAqBmtG,KAAKurC,qBAAsB,CACrE,GAAIvrC,KAAK1iB,MAAMmkC,EAAGpM,WAEhB,OADArV,KAAK5iB,OACE4iB,KAAK+2D,cACV/2D,KAAKygC,gBAAgBx8C,QACrBvuF,GACA,GAEG,GAAIsqG,KAAK1iB,MAAMmkC,EAAG5uH,MAIvB,OAAI,KAAAmtG,KAAK69C,oBACA79C,KAAKg3D,6BAA6B/yE,GAIlCA,EAEJ,GAAI+b,KAAK1iB,MAAMmkC,EAAGxM,KACvB,OAAOjV,KAAKi3D,SAAQ,GAIxB,OAAInjB,GAAc9zC,KAAK1iB,MAAMmkC,EAAGxO,SAAWjT,KAAKurC,sBAC9CvrC,KAAK5iB,OACE4iB,KAAKu0C,qBACVv0C,KAAKygC,gBAAgBx8C,GACrB,CAACA,IACD,IAIGA,EAGT,KAAKw9B,EAAGxM,IACN,OAAOjV,KAAKi3D,SAAQ,GAGtB,KAAKx1C,EAAGhN,MACR,KAAKgN,EAAGjO,YAEN,OADAxT,KAAK2uD,aACE3uD,KAAK27B,mBAAmB37B,KAAK8oB,MAAMp1H,OAG5C,KAAK+tH,EAAG/P,IACN,OAAO1R,KAAKq8B,oBAAoBr8B,KAAK8oB,MAAMp1H,OAE7C,KAAK+tH,EAAG9P,OACN,OAAO3R,KAAK87B,mBAAmB97B,KAAK8oB,MAAMp1H,OAE5C,KAAK+tH,EAAG7P,QACN,OAAO5R,KAAKk8B,oBAAoBl8B,KAAK8oB,MAAMp1H,OAE7C,KAAK+tH,EAAG9lB,OACN,OAAOqE,KAAKo8B,mBAAmBp8B,KAAK8oB,MAAMp1H,OAE5C,KAAK+tH,EAAGnL,MACN,OAAOtW,KAAKs8B,mBAEd,KAAK7a,EAAGlL,MACN,OAAOvW,KAAKu8B,qBAAoB,GAClC,KAAK9a,EAAGjL,OACN,OAAOxW,KAAKu8B,qBAAoB,GAElC,KAAK9a,EAAG/O,OAAQ,CACd,MAAMohC,EAAa9zC,KAAK8oB,MAAMkK,mBAAqBhzB,KAAK8oB,MAAM9zC,MAC9D,OAAOgrB,KAAK6zC,mCAAmCC,GAGjD,KAAKryB,EAAGvP,YACR,KAAKuP,EAAGxP,aACN,OAAOjS,KAAKkwC,eACVlwC,KAAK8oB,MAAMhiD,OAAS26C,EAAGvP,YAAcuP,EAAGrP,YAAcqP,EAAGtP,UACtC,GACL,EACdotB,GAGJ,KAAK9d,EAAGzP,SACN,OAAOhS,KAAKkwC,eACVzuB,EAAGtP,UACgB,GACL,EACdotB,GAGJ,KAAK9d,EAAGnP,UACR,KAAKmP,EAAGlP,WACN,OAAOvS,KAAKizD,gBACVjzD,KAAK8oB,MAAMhiD,OAAS26C,EAAGnP,UAAYmP,EAAGhP,UAAYgP,EAAGjP,QACrC,GACD,EACf+sB,GAGJ,KAAK9d,EAAGpP,OACN,OAAOrS,KAAKizD,gBACVxxC,EAAGjP,QACa,GACD,EACf+sB,GAGJ,KAAK9d,EAAGpM,UACN,OAAOrV,KAAKk3D,8BAEd,KAAKz1C,EAAGrZ,GACNpI,KAAKm3D,kBAEP,KAAK11C,EAAGvL,OAGN,OAFAjvC,EAAO+4B,KAAK4+B,YACZ5+B,KAAKqnD,eAAepgF,GACb+4B,KAAKiiD,WAAWh7E,GAAM,GAE/B,KAAKw6C,EAAG1L,KACN,OAAO/V,KAAKo3D,sBAEd,KAAK31C,EAAGtO,UACN,OAAOnT,KAAKu9C,eAAc,GAI5B,KAAK97B,EAAG5O,YAAa,CACnB5rC,EAAO+4B,KAAK4+B,YACZ5+B,KAAK5iB,OACLnW,EAAKivD,OAAS,KACd,MAAM//C,EAAUlP,EAAKkP,OAAS6pB,KAAKq2D,kBACnC,GAAoB,qBAAhBlgF,EAAOrP,KACT,OAAOk5B,KAAK8+B,WAAW73D,EAAM,kBAE7B,MAAM+4B,KAAK0jB,MAAMvtC,EAAOnB,MAAOmwC,EAAOnF,iBAI1C,KAAKyB,EAAG3P,YAAa,CAInB,MAAM98B,EAAQgrB,KAAK8oB,MAAM9zC,MACnBthF,EAAQssG,KAAK8oB,MAAMp1H,MAEzB,GADAuzE,EAAO+4B,KAAKo2D,mBACRp2D,KAAK1iB,MAAMmkC,EAAGhL,KAChBzW,KAAKwnD,aAAa,aAClBxnD,KAAK2pD,WAAWM,eAAev2J,EAAOuzE,EAAK+N,WACtC,CAAA,IAAIgrB,KAAKk7B,UAAU,aAGxB,MAAMl7B,KAAK4hC,WAAW5sD,GAFtBgrB,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOvH,oBAAqBlqH,GAI3D,OAAOuzE,EAET,KAAKw6C,EAAGpO,KACN,GAAIrT,KAAK8oB,MAAMsK,WAgBb,OAfAnsD,EAAO+4B,KAAK4+B,YAG+C,UAAzD5+B,KAAKo7B,gBAAgB,mBAAoB,aAEzCp7B,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAOxH,mCAGhC3d,KAAK5iB,OAEA4iB,KAAKq3D,uDACRr3D,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAOzH,wBAGhC1d,KAAKs3D,yBACEt3D,KAAK8+B,WAAW73D,EAAM,iCAIjC,KAAKw6C,EAAGrN,WACN,GAAyB,MAArBpU,KAAK8oB,MAAMp1H,MAAe,CAC5B,MAAM6jK,EAAcv3D,KAAKhR,MAAMwoE,YAAYx3D,KAAKu3C,mBAE9Ct1B,EAAkBs1C,IACP,KAAXA,IAEAv3D,KAAKuxD,gBAAgB,CAAC,MAAO,OAAQ,eAK3C,QACE,MAAMvxD,KAAK4hC,cAKjBo1B,6BAA6B/yE,GAC3B,MAAMhd,EAAO+4B,KAAKygC,gBAAgBx8C,GAGlC+b,KAAKkhD,UAAUv8B,MAAM+S,IAAc,EAAM13B,KAAKkhD,UAAU3pB,WACxD,MAAMhhD,EAAS,CAACypB,KAAK6kC,mBAQrB,OAPA7kC,KAAKkhD,UAAUt8B,OACX5kB,KAAK63C,yBACP73C,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAOrJ,2BAEpC9b,KAAKuiC,OAAO9gB,EAAGxO,OAEfjT,KAAKu0C,qBAAqBttE,EAAMsP,GAAQ,GACjCtP,EAKTgwF,QAAQt/B,GACN33B,KAAKwnD,aAAa,iBACd7vB,GACF33B,KAAKwnD,aAAa,sBAEpB,MAAMvgF,EAAO+4B,KAAK4+B,YAClB33D,EAAKqsE,MAAQ3b,EACb33B,KAAK5iB,OACL,MAAMy0E,EAAY7xD,KAAK8oB,MAAMkL,OAa7B,OAZAh0B,KAAK8oB,MAAMkL,OAAS,GAChB2D,GAGF33B,KAAKkhD,UAAUv8B,MfltCL,GemtCV19C,EAAKhB,KAAO+5B,KAAKmnD,aACjBnnD,KAAKkhD,UAAUt8B,QAEf39C,EAAKhB,KAAO+5B,KAAKmnD,aAGnBnnD,KAAK8oB,MAAMkL,OAAS69B,EACb7xD,KAAK8+B,WAAW73D,EAAM,gBAI/B4vF,aACE,MAAM5vF,EAAO+4B,KAAK4+B,YAuBlB,OAtBA5+B,KAAK5iB,QAEH4iB,KAAK1iB,MAAMmkC,EAAG/O,SACb1S,KAAK6kB,MAAMX,kBACXlkB,KAAKrrG,QAAQ2zJ,wBAIbtoD,KAAK6kB,MAAMb,YACXhkB,KAAKrrG,QAAQ2zJ,yBAEdtoD,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAOtF,iBAL9B7f,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAOvG,iBAS7B5e,KAAK1iB,MAAMmkC,EAAG/O,SACd1S,KAAK1iB,MAAMmkC,EAAGzP,WACdhS,KAAK1iB,MAAMmkC,EAAG3O,MAEf9S,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAO5E,kBAGzBvgB,KAAK8+B,WAAW73D,EAAM,SAG/Bk3D,sBACE6S,GAIA,OAFkBhxC,KAAK1iB,MAAMmkC,EAAG3P,cAGzBk/B,GACHhxC,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAQ,EAAGmwC,EAAOxF,wBAEnC3f,KAAKo2D,oBAELp2D,KAAK6kC,iBAAgB,GAIhCuxB,mBACE,MAAMnvF,EAAO+4B,KAAK4+B,YACZ36C,EAAK+b,KAAK48B,YACd58B,KAAK8oB,MAAM9zC,MAAQ,EAGnB,IAAIoiC,EACFpX,KAAK8oB,MAAM8J,QACX5yB,KAAK8oB,MAAM9zC,MAAQ,EAAIgrB,KAAK8oB,MAAMwL,YAGhCzhI,EAAOmtG,KAAK8oB,MAAMp1H,MAGxB,OAFAssG,KAAK5iB,OACLnW,EAAKgd,GAAK+b,KAAKorC,iBAAiBnnD,EAAIpxF,GAC7BmtG,KAAK8+B,WAAW73D,EAAM,eAG/BiwF,8BACE,MAAMjwF,EAAO+4B,KAAK4+B,YASlB,GAFA5+B,KAAK5iB,OAED4iB,KAAKkhD,UAAU3pB,UAAYv3B,KAAK1iB,MAAMmkC,EAAG3O,KAAM,CACjD,MAAM2kD,EAAOz3D,KAAKorC,iBAChBprC,KAAKygC,gBAAgBx5D,GACrB,YAGF,OADA+4B,KAAK5iB,OACE4iB,KAAK03D,kBAAkBzwF,EAAMwwF,EAAM,QAE5C,OAAOz3D,KAAK+2D,cAAc9vF,GAG5BywF,kBACEzwF,EACAwwF,EACAE,GAEA1wF,EAAKwwF,KAAOA,EAEM,aAAdA,EAAK5kK,MAAwC,SAAjB8kK,IAE1B33D,KAAK2lC,aAAagyB,GACpB33D,KAAKwnD,aAAa,gBACRxnD,KAAKk7B,UAAU,iBAEzBl7B,KAAK4hC,cAIT,MAAM/M,EAAc70B,KAAK8oB,MAAM+L,YAa/B,OAXA5tD,EAAK0kB,SAAWqU,KAAK6kC,iBAAgB,IAEjC59D,EAAK0kB,SAAS94F,OAAS8kK,GAAgB9iC,IACzC70B,KAAK0jB,MACHz8C,EAAK0kB,SAAS3W,MACdmwC,EAAO/E,wBACPq3C,EAAK5kK,KACL8kK,GAIG33D,KAAK8+B,WAAW73D,EAAM,gBAI/B6vF,wBAAwB7vF,GACtB,MAAMgd,EAAK+b,KAAKorC,iBAAiBprC,KAAKygC,gBAAgBx5D,GAAO,UAU7D,OATA+4B,KAAK5iB,OAED4iB,KAAK2lC,aAAa,UACf3lC,KAAKyiB,UACRziB,KAAK0jB,MAAMz/B,EAAGjP,MAAO4iF,EAAuB32C,yBAE9CjhB,KAAK2rD,mBAAoB,GAGpB3rD,KAAK03D,kBAAkBzwF,EAAMgd,EAAI,QAG1CknD,mBACEz3I,EACAozE,EACAG,GAMA,OAJA+4B,KAAKy9B,SAASx2D,EAAM,WAAYvzE,GAChCssG,KAAKy9B,SAASx2D,EAAM,MAAO+4B,KAAKhR,MAAM5pB,MAAM6B,EAAK+N,MAAOgrB,KAAK8oB,MAAM9jD,MACnEiC,EAAKvzE,MAAQA,EACbssG,KAAK5iB,OACE4iB,KAAK8+B,WAAc73D,EAAMH,GAGlCq1D,aAAwBzoI,EAAYozE,GAClC,MAAMG,EAAO+4B,KAAK4+B,YAClB,OAAO5+B,KAAKmrC,mBAAmBz3I,EAAOozE,EAAMG,GAG9Cm1D,mBAAmB1oI,GACjB,OAAOssG,KAAKm8B,aAA8BzoI,EAAO,iBAGnD2oI,oBAAoB3oI,GAClB,OAAOssG,KAAKm8B,aAA+BzoI,EAAO,kBAGpDooI,mBAAmBpoI,GACjB,OAAOssG,KAAKm8B,aAA8BzoI,EAAO,iBAGnDwoI,oBAAoBxoI,GAClB,OAAOssG,KAAKm8B,aAA+BzoI,EAAO,kBAGpDioI,mBAAmBjoI,GACjB,MAAMuzE,EAAO+4B,KAAKm8B,aAChBzoI,EAAMA,MACN,iBAIF,OAFAuzE,EAAKgY,QAAUvrF,EAAMurF,QACrBhY,EAAKo8C,MAAQ3vH,EAAM2vH,MACZp8C,EAGTs1D,oBAAoB7oI,GAClB,MAAMuzE,EAAO+4B,KAAK4+B,YAGlB,OAFA33D,EAAKvzE,MAAQA,EACbssG,KAAK5iB,OACE4iB,KAAK8+B,WAA6B73D,EAAM,kBAGjDq1D,mBACE,MAAMr1D,EAAO+4B,KAAK4+B,YAElB,OADA5+B,KAAK5iB,OACE4iB,KAAK8+B,WAA0B73D,EAAM,eAI9C4sE,mCAAmCC,GACjC,MAAMxU,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAE5B,IAAIl5B,EACJqG,KAAK5iB,OACL4iB,KAAKoyD,gBAAgBztC,MNtsChB,IAAI0lC,GAxKuB,IMg3ChC,MAAM1H,EAA4B3iD,KAAK8oB,MAAMqK,uBACvCujC,EAAgC12D,KAAK8oB,MAAMiL,2BACjD/zB,KAAK8oB,MAAMqK,wBAAyB,EACpCnzB,KAAK8oB,MAAMiL,4BAA6B,EAExC,MAAM8jC,EAAgB73D,KAAK8oB,MAAM9zC,MAC3B8iF,EAAgB93D,KAAK8oB,MAAM+J,SAC3Bgd,EAAW,GACXtQ,EAAsB,IAAIyrB,GAC1Ble,EAAmB,CAAE93D,MAAO,GAClC,IACI+iF,EACAC,EAFAn/E,GAAQ,EAIZ,MAAQmnB,KAAK1iB,MAAMmkC,EAAG9O,SAAS,CAC7B,GAAI95B,EACFA,GAAQ,OAGR,GADAmnB,KAAKuiC,OAAO9gB,EAAG75B,MAAOklD,EAAiB93D,OAAS,MAC5CgrB,KAAK1iB,MAAMmkC,EAAG9O,QAAS,CACzBqlD,EAAqBh4D,KAAK8oB,MAAM9zC,MAChC,MAIJ,GAAIgrB,KAAK1iB,MAAMmkC,EAAGvO,UAAW,CAC3B,MAAM+kD,EAAqBj4D,KAAK8oB,MAAM9zC,MAChCkjF,EAAqBl4D,KAAK8oB,MAAM+J,SACtCklC,EAAc/3D,KAAK8oB,MAAM9zC,MACzB66D,EAAS/kE,KACPk1B,KAAKouC,eACHpuC,KAAKgzD,mBACLiF,EACAC,IAIJl4D,KAAK8lD,oBAAL,IAEA,MAEAjW,EAAS/kE,KACPk1B,KAAKyiC,wBACHlD,EACAv/B,KAAKouC,eACLtB,IAMR,MAAMqrB,EAAcn4D,KAAK8oB,MAAM4L,WACzB0jC,EAAcp4D,KAAK8oB,MAAMyL,cAC/Bv0B,KAAKuiC,OAAO9gB,EAAG9O,QAEf3S,KAAK8oB,MAAMqK,uBAAyBwvB,EACpC3iD,KAAK8oB,MAAMiL,2BAA6B2iC,EAExC,IAAI2B,EAAYr4D,KAAK48B,YAAY0C,EAAUzM,GAC3C,GACEihB,GACA9zC,KAAKyzC,qBACJ4kB,EAAYr4D,KAAKwzC,WAAW6kB,IAK7B,OAHAr4D,KAAKoyD,gBAAgBtH,oBACrB9qD,KAAKoyD,gBAAgBxtC,OACrB5kB,KAAKu0C,qBAAqB8jB,EAAWxoB,GAAU,GACxCwoB,EAqBT,GAnBAr4D,KAAKoyD,gBAAgBxtC,OAEhBirB,EAAS5qE,QACZ+6B,KAAK4hC,WAAW5hC,KAAK8oB,MAAM2L,cAEzBujC,GAAoBh4D,KAAK4hC,WAAWo2B,GACpCD,GAAa/3D,KAAK4hC,WAAWm2B,GACjC/3D,KAAK0xD,sBAAsBnyB,GAAqB,GAC5CuN,EAAiB93D,OAAOgrB,KAAK4hC,WAAWkL,EAAiB93D,OAE7DgrB,KAAK8yD,qBAAqBjjB,GAAoC,GAC1DA,EAAS5qE,OAAS,GACpB00B,EAAMqG,KAAK48B,YAAYi7B,EAAeC,GACtCn+D,EAAItQ,YAAcwmD,EAClB7vC,KAAK+8B,aAAapjC,EAAK,qBAAsBw+D,EAAaC,IAE1Dz+D,EAAMk2C,EAAS,IAGZ7vC,KAAKrrG,QAAQ+zJ,+BAGhB,OAFA1oD,KAAKy9B,SAAS9jC,EAAK,iBAAiB,GACpCqG,KAAKy9B,SAAS9jC,EAAK,aAAc2lC,GAC1B3lC,EAGT,MAAM2+D,EAAkBt4D,KAAK48B,YAAY0C,EAAUzM,GAGnD,OAFAylC,EAAgBpsE,WAAayN,EAC7BqG,KAAK8+B,WAAWw5B,EAAiB,2BAC1BA,EAGT7kB,mBACE,OAAQzzC,KAAKurC,qBAGfiI,WAAWvsE,GACT,GAAI+4B,KAAK8hC,IAAIrgB,EAAGxO,OACd,OAAOhsC,EAIXmnE,eACEnnE,EACAq4D,EACAzM,GAEA,OAAO5rD,EAGTmwF,sBACE,MAAMnwF,EAAO+4B,KAAK4+B,YAElB,GADA5+B,KAAK5iB,OACD4iB,KAAK1iB,MAAMmkC,EAAG3O,KAAM,CAEtB,MAAM2kD,EAAOz3D,KAAKorC,iBAAiBprC,KAAKygC,gBAAgBx5D,GAAO,OAC/D+4B,KAAK5iB,OACL,MAAMm7E,EAAWv4D,KAAK03D,kBAAkBzwF,EAAMwwF,EAAM,UAMpD,OAJKz3D,KAAK6kB,MAAMP,oBAAuBtkB,KAAK6kB,MAAMV,SAChDnkB,KAAK0jB,MAAM60C,EAASvjF,MAAOmwC,EAAO1F,qBAG7B84C,EAGT,OAAOv4D,KAAKw4D,SAASvxF,GASvBuxF,SAASvxF,GAWP,OAVAA,EAAKkP,OAAS6pB,KAAKq2D,kBACM,WAArBpvF,EAAKkP,OAAOrP,KACdk5B,KAAK0jB,MAAMz8C,EAAKkP,OAAOnB,MAAOmwC,EAAO3K,4BAC5Bxa,KAAK2gC,gBAAgB15D,EAAKkP,QACnC6pB,KAAK0jB,MAAM1jB,KAAK8oB,MAAM4L,WAAYvP,EAAOnI,uBAChChd,KAAK8hC,IAAIrgB,EAAGzO,cACrBhT,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOnI,uBAGtChd,KAAKq0C,kBAAkBptE,GAChB+4B,KAAK8+B,WAAW73D,EAAM,iBAG/BotE,kBAAkBptE,GAChB,GAAI+4B,KAAK8hC,IAAIrgB,EAAG/O,QAAS,CACvB,MAAMt8B,EAAO4pB,KAAKy4D,cAAch3C,EAAG9O,QACnC3S,KAAK+vC,iBAAiB35D,GAEtBnP,EAAKoP,UAAYD,OAEjBnP,EAAKoP,UAAY,GAMrBqiF,qBAAqBC,GACnB,MAAMhF,EAAO3zD,KAAK4+B,YAclB,OAbyB,OAArB5+B,KAAK8oB,MAAMp1H,QACRilK,GACH34D,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAQ,EAAGmwC,EAAOpK,gCAG5C44C,EAAKjgK,MAAQ,CACXo2F,IAAKkW,KAAKhR,MACP5pB,MAAM46B,KAAK8oB,MAAM9zC,MAAOgrB,KAAK8oB,MAAM9jD,KACnCkU,QAAQ,SAAU,MACrB0/E,OAAQ54D,KAAK8oB,MAAMp1H,OAErBssG,KAAK5iB,OACLu2E,EAAKkF,KAAO74D,KAAK1iB,MAAMmkC,EAAGtO,WACnBnT,KAAK8+B,WAAW60B,EAAM,mBAI/BpW,cAAcob,GACZ,MAAM1xF,EAAO+4B,KAAK4+B,YAClB5+B,KAAK5iB,OACLnW,EAAKoiB,YAAc,GACnB,IAAIyvE,EAAS94D,KAAK04D,qBAAqBC,GAEvC,IADA1xF,EAAK8xF,OAAS,CAACD,IACPA,EAAOD,MACb74D,KAAKuiC,OAAO9gB,EAAGrO,cACfnsC,EAAKoiB,YAAYve,KAAKk1B,KAAKw9C,6BAC3Bx9C,KAAKuiC,OAAO9gB,EAAGjP,QACfvrC,EAAK8xF,OAAOjuF,KAAMguF,EAAS94D,KAAK04D,qBAAqBC,IAGvD,OADA34D,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAM,mBAI/Bu2E,4BACE,OAAOx9C,KAAKsiC,kBAKd2wB,gBACEjzE,EACAm/C,EACA00B,EACAt0B,GAEIs0B,GACF7zD,KAAKwnD,aAAa,kBAEpB,MAAMkP,EAAgC12D,KAAK8oB,MAAMiL,2BACjD/zB,KAAK8oB,MAAMiL,4BAA6B,EACxC,MAAMilC,EAAgBxlK,OAAOU,OAAO,MACpC,IAAI2kF,GAAQ,EACZ,MAAM5R,EAAO+4B,KAAK4+B,YAKlB,IAHA33D,EAAKgP,WAAa,GAClB+pB,KAAK5iB,QAEG4iB,KAAK1iB,MAAM0C,IAAQ,CACzB,GAAInH,EACFA,GAAQ,OAGR,GADAmnB,KAAKuiC,OAAO9gB,EAAG75B,OACXoY,KAAK1iB,MAAM0C,GAAQ,CACrBggB,KAAKy9B,SAASx2D,EAAM,gBAAiB+4B,KAAK8oB,MAAM2L,cAChD,MAIJ,MAAM97C,EAAOqnB,KAAKi5D,wBAAwB95B,EAAWI,GAChDJ,GAEHn/B,KAAK4zD,WAAWj7E,EAAMk7E,EAAUmF,EAAUz5B,GAI1Cs0B,IACC7zD,KAAKk9B,iBAAiBvkD,IACT,kBAAdA,EAAK7R,MAELk5B,KAAK0jB,MAAM/qC,EAAK3D,MAAOmwC,EAAOzJ,uBAI5B/iC,EAAKoT,WACPiU,KAAKy9B,SAAS9kD,EAAM,aAAa,GAGnC1R,EAAKgP,WAAWnL,KAAK6N,GAGvBqnB,KAAK5iB,OAEL4iB,KAAK8oB,MAAMiL,2BAA6B2iC,EACxC,IAAI5vF,EAAO,mBAMX,OALIq4D,EACFr4D,EAAO,gBACE+sF,IACT/sF,EAAO,oBAEFk5B,KAAK8+B,WAAW73D,EAAMH,GAM/BoyF,yBAAyBvgF,GACvB,OACGA,EAAKiT,UACY,eAAlBjT,EAAK3jF,IAAI8xE,OACRk5B,KAAK43C,yBACJ53C,KAAK1iB,MAAMmkC,EAAGzP,WACdhS,KAAK1iB,MAAMmkC,EAAGjN,OAKpBykD,wBACE95B,EACAI,GAEA,IAAIujB,EAAa,GACjB,GAAI9iD,KAAK1iB,MAAMmkC,EAAGrZ,IAOhB,IANIpI,KAAKk7B,UAAU,eACjBl7B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAO7E,8BAK/BtgB,KAAK1iB,MAAMmkC,EAAGrZ,KACnB06C,EAAWh4E,KAAKk1B,KAAKozD,kBAIzB,MAAMz6E,EAAOqnB,KAAK4+B,YAClB,IAGIU,EACAzM,EAJA+E,GAAc,EACdD,GAAU,EACVyH,GAAa,EAIjB,GAAIp/B,KAAK1iB,MAAMmkC,EAAGvO,UAEhB,OADI4vC,EAAW79E,QAAQ+6B,KAAK4hC,aACxBzC,GACFn/B,KAAK5iB,OAELzE,EAAKuR,SAAW8V,KAAK6kC,kBACrB7kC,KAAK8lD,oBAAL,KACO9lD,KAAK8+B,WAAWnmD,EAAM,gBAGxBqnB,KAAK+yD,cAGVjQ,EAAW79E,SACb0T,EAAKmqE,WAAaA,EAClBA,EAAa,IAGfnqE,EAAKykD,QAAS,GAEV+B,GAAaI,KACfD,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,UAGnBsM,IACHvH,EAAc53B,KAAK8hC,IAAIrgB,EAAGjN,OAG5B,MAAMqgB,EAAc70B,KAAK8oB,MAAM+L,YACzB7/H,EAAMgrG,KAAK+wC,kBAAkBp4D,GAAiC,GAEpE,IACGwmD,IACAvH,IACA/C,GACD70B,KAAKk5D,yBAAyBvgF,GAC9B,CACA,MAAMwgF,EAAUnkK,EAAInC,KAGJ,UAAZsmK,GAAwBn5D,KAAK63C,0BAC/BlgB,GAAU,EACVC,EAAc53B,KAAK8hC,IAAIrgB,EAAGjN,MAC1BxU,KAAK+wC,kBAAkBp4D,GAAiC,IAI1C,QAAZwgF,GAAiC,QAAZA,IACvB/5B,GAAa,EACbzmD,EAAKkmD,KAAOs6B,EACRn5D,KAAK1iB,MAAMmkC,EAAGjN,QAChBojB,GAAc,EACd53B,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAOtN,oBAAqBshD,GACvDn5D,KAAK5iB,QAEP4iB,KAAK+wC,kBAAkBp4D,GAAiC,IAe5D,OAXAqnB,KAAKixC,kBACHt4D,EACA2mD,EACAzM,EACA+E,EACAD,EACAwH,EACAC,EACAG,GAGK5mD,EAGTstE,kCACE7oB,GAEA,MAAuB,QAAhBA,EAAOyB,KAAiB,EAAI,EAIrC1B,6BAA6BC,GAC3B,OAAOA,EAAO7mD,OAKhBu6D,wBAAwB1T,GAA8C,IAAAg8B,EACpE,MAAM7uB,EAAavqC,KAAKimD,kCAAkC7oB,GACpD7mD,EAASypB,KAAKm9B,6BAA6BC,GAE3CpoD,EAAQooD,EAAOpoD,MAEjBuB,EAAOtR,SAAWslE,IACA,QAAhBnN,EAAOyB,KACT7+B,KAAK0jB,MAAM1uC,EAAOmwC,EAAO9M,gBAEzBrY,KAAK0jB,MAAM1uC,EAAOmwC,EAAO7M,iBAKX,QAAhB8kB,EAAOyB,MAC6B,iBAApC,OAAAu6B,EAAA7iF,EAAOA,EAAOtR,OAAS,SAAvB,EAAAm0F,EAA2BtyF,OAE3Bk5B,KAAK0jB,MAAM1uC,EAAOmwC,EAAO5M,wBAK7B2mB,kBACEvmD,EACAi/C,EACAD,EACAwH,EACAC,GAEA,OAAIA,GAEFp/B,KAAKi+B,YACHtlD,EAGAi/C,GACc,GACM,GACpB,EACA,gBAEF53B,KAAK8wC,wBAAwBn4D,GACtBA,GAGLg/C,GAAWC,GAAe53B,KAAK1iB,MAAMmkC,EAAG/O,SACtCysB,GAAWn/B,KAAK4hC,aACpBjpD,EAAKkmD,KAAO,SACZlmD,EAAKykD,QAAS,EACPp9B,KAAKi+B,YACVtlD,EACAi/C,EACAD,GACoB,GACpB,EACA,sBAVJ,EAiBF0H,oBACE1mD,EACA2mD,EACAzM,EACAsM,EACAI,GAIA,OAFA5mD,EAAKoT,WAAY,EAEbiU,KAAK8hC,IAAIrgB,EAAG7O,QACdj6B,EAAKjlF,MAAQyrI,EACTn/B,KAAKmxC,kBAAkBnxC,KAAK8oB,MAAM9zC,MAAOgrB,KAAK8oB,MAAM+J,UACpD7yB,KAAKyiC,wBAAwBlD,GAE1Bv/B,KAAK8+B,WAAWnmD,EAAM,mBAG1BA,EAAKiT,UAA8B,eAAlBjT,EAAK3jF,IAAI8xE,UAA/B,GAKEk5B,KAAKqyC,kBAAkB15D,EAAK3jF,IAAInC,KAAM8lF,EAAK3jF,IAAIggF,OAAO,GAAM,GAExDmqD,EACFxmD,EAAKjlF,MAAQssG,KAAKmxC,kBAChB7R,EACAzM,EACAl6C,EAAK3jF,IAAIk9I,WAEFlyC,KAAK1iB,MAAMmkC,EAAGlO,KAAOgsB,IACe,IAAzCA,EAAoB0rB,kBACtB1rB,EAAoB0rB,gBAAkBjrD,KAAK8oB,MAAM9zC,OAEnD2D,EAAKjlF,MAAQssG,KAAKmxC,kBAChB7R,EACAzM,EACAl6C,EAAK3jF,IAAIk9I,YAGXv5D,EAAKjlF,MAAQilF,EAAK3jF,IAAIk9I,UAExBv5D,EAAKoT,WAAY,EAEViU,KAAK8+B,WAAWnmD,EAAM,mBAIjCs4D,kBACEt4D,EACA2mD,EACAzM,EACA+E,EACAD,EACAwH,EACAC,EACAG,GAEA,MAAMt4D,EACJ+4B,KAAKk/B,kBACHvmD,EACAi/C,EACAD,EACAwH,EACAC,IAEFp/B,KAAKq/B,oBACH1mD,EACA2mD,EACAzM,EACAsM,EACAI,GAMJ,OAHKt4D,GAAM+4B,KAAK4hC,aAGT36D,EAGT8pE,kBACEp4D,EACAq4D,GAEA,GAAIhxC,KAAK8hC,IAAIrgB,EAAGzP,UACbr5B,EAA2CiT,UAAW,EACvDjT,EAAK3jF,IAAMgrG,KAAKyiC,0BAChBziC,KAAKuiC,OAAO9gB,EAAGtP,cACV,CACL,MAAMknD,EAAoBr5D,KAAK8oB,MAAMyK,eACrCvzB,KAAK8oB,MAAMyK,gBAAiB,EAE5B,MAAMzsD,EAAOk5B,KAAK8oB,MAAMhiD,KACvB6R,EAAkB3jF,IACjB8xE,IAAS26C,EAAG/P,KACZ5qC,IAAS26C,EAAG9lB,QACZ70B,IAAS26C,EAAG9P,QACZ7qC,IAAS26C,EAAG7P,QACR5R,KAAKmiC,gBACLniC,KAAKm+B,sBAAsB6S,GAE7BlqE,IAAS26C,EAAG3P,cAEdn5B,EAAKiT,UAAW,GAGlBoU,KAAK8oB,MAAMyK,eAAiB8lC,EAG9B,OAAO1gF,EAAK3jF,IAKdgoI,aAAa/1D,EAAsC0wD,GACjD1wD,EAAKgd,GAAK,KACVhd,EAAK45B,WAAY,EACjB55B,EAAKqsE,QAAU3b,EAKjBsG,YACEh3D,EACA2wD,EACAD,EACAoG,EACA7Z,EACAp9C,EACA43D,GAAwB,GAExB1+B,KAAKg9B,aAAa/1D,EAAM0wD,GACxB1wD,EAAK45B,YAAc+2B,EACnB,MAAM4a,EAAiBzU,EAavB,OAZA/9B,KAAK6kB,MAAMF,MACTupB,IAEGxP,EAAe3b,EAAc,IAC7BmB,EvBj/DyB,GuBi/De,IAE7ClkB,KAAKkhD,UAAUv8B,MAAM+S,GAAcC,EAAS1wD,EAAK45B,YACjDb,KAAKuyC,oBAAqBtrE,EAAYurE,GACtCxyC,KAAKosC,2BAA2BnlE,EAAMH,GAAM,GAC5Ck5B,KAAKkhD,UAAUt8B,OACf5kB,KAAK6kB,MAAMD,OAEJ39C,EAMTipE,eACElwD,EACAmwD,EACAC,EACA7Q,GAEI6Q,GACFpwC,KAAKwnD,aAAa,kBAEpB,MAAMkP,EAAgC12D,KAAK8oB,MAAMiL,2BACjD/zB,KAAK8oB,MAAMiL,4BAA6B,EACxC,MAAM9sD,EAAO+4B,KAAK4+B,YASlB,OARA5+B,KAAK5iB,OACLnW,EAAK8O,SAAWiqB,KAAKy4D,cACnBz4E,GACkBowD,EAClB7Q,EACAt4D,GAEF+4B,KAAK8oB,MAAMiL,2BAA6B2iC,EACjC12D,KAAK8+B,WACV73D,EACAmpE,EAAU,kBAAoB,mBAOlCmE,qBACEttE,EACAsP,EACAohD,EACAmY,GAEA9vC,KAAK6kB,MAAMF,MAAMupB,GACjB,IAAI7qB,EAAQqU,GAAcC,GAAS,IAE9B33B,KAAK1iB,MAAMmkC,EAAGzP,WAAahS,KAAKkhD,UAAUzpB,QAC7CpU,Gf3iEO,Ge6iETrjB,KAAKkhD,UAAUv8B,MAAMtB,GACrBrjB,KAAKg9B,aAAa/1D,EAAM0wD,GACxB,MAAMgrB,EAA4B3iD,KAAK8oB,MAAMqK,uBAa7C,OAXI58C,IACFypB,KAAK8oB,MAAMqK,wBAAyB,EACpCnzB,KAAK0zC,2BAA2BzsE,EAAMsP,EAAQu5D,IAEhD9vC,KAAK8oB,MAAMqK,wBAAyB,EACpCnzB,KAAKu+B,kBAAkBt3D,GAAM,GAE7B+4B,KAAKkhD,UAAUt8B,OACf5kB,KAAK6kB,MAAMD,OACX5kB,KAAK8oB,MAAMqK,uBAAyBwvB,EAE7B3iD,KAAK8+B,WAAW73D,EAAM,2BAG/BysE,2BACEzsE,EACAsP,EACAu5D,GAEA7oE,EAAKsP,OAASypB,KAAKguC,iBAAiBz3D,EAAQu5D,GAAkB,GAGhE1D,2BACEnlE,EACAH,EACA23D,GAAqB,GAGrBz+B,KAAKu+B,kBAAkBt3D,GAAM,EAAOw3D,GACpCz+B,KAAK8+B,WAAW73D,EAAMH,GAIxBy3D,kBACEt3D,EACAu3D,EACAC,GAAqB,GAErB,MAAM66B,EAAe96B,IAAoBx+B,KAAK1iB,MAAMmkC,EAAGpP,QAGvD,GAFArS,KAAKoyD,gBAAgBztC,MAAMomC,MAEvBuO,EAEFryF,EAAKhB,KAAO+5B,KAAKutC,mBACjBvtC,KAAKmuC,YAAYlnE,GAAM,EAAOu3D,GAAiB,OAC1C,CACL,MAAM8oB,EAAYtnD,KAAK8oB,MAAM6J,OAGvBk/B,EAAY7xD,KAAK8oB,MAAMkL,OAC7Bh0B,KAAK8oB,MAAMkL,OAAS,GAIpBh0B,KAAKkhD,UAAUv8B,MfxmEJ,EewmEU3kB,KAAKkhD,UAAU7pB,gBACpCpwD,EAAKhB,KAAO+5B,KAAKmnD,YACf,GACA,GAECoS,IACC,MAAMC,GAAax5D,KAAKy5D,kBAAkBxyF,EAAKsP,QAE/C,GAAIgjF,GAA0BC,EAAW,CAEvC,MAAME,EAEW,WAAdzyF,EAAK43D,MAAmC,gBAAd53D,EAAK43D,OAE9B53D,EAAKjyE,IAEHiyE,EAAK+N,MADL/N,EAAKjyE,IAAIgwE,IAEfg7B,KAAK0jB,MAAMg2C,EAAUv0C,EAAOhL,8BAG9B,MAAMu5C,GAAqBpM,GAAatnD,KAAK8oB,MAAM6J,OAInD3yB,KAAKmuC,YACHlnE,IACC+4B,KAAK8oB,MAAM6J,QAAW6L,GAAoBC,GAAa+6B,GACxDh7B,EACAk1B,GAIE1zD,KAAK8oB,MAAM6J,QAAU1rD,EAAKgd,IAC5B+b,KAAKqwC,UACHppE,EAAKgd,GACL,gBvBnlEoBgiD,QuBqlEpBvwI,OACAA,EACAg+J,MAKR1zD,KAAKkhD,UAAUt8B,OACf5kB,KAAKoyD,gBAAgBxtC,OACrB5kB,KAAK8oB,MAAMkL,OAAS69B,GAIxB4H,kBACEljF,GAEA,IAAK,IAAIpP,EAAI,EAAGi8B,EAAM7sB,EAAOtR,OAAQkC,EAAIi8B,EAAKj8B,IAC5C,GAAuB,eAAnBoP,EAAOpP,GAAGL,KAAuB,OAAO,EAE9C,OAAO,EAGTqnE,YACElnE,EACA0sE,EAEAC,EACA8f,GAA8B,GAE9B,MAAMF,EAAe,IAAI70E,IACzB,IAAK,MAAMktD,KAAS5kE,EAAKsP,OACvBypB,KAAKqwC,UACHxE,EACA,0BvB/nE0B5F,EuBioE1B0N,EAAkB,KAAO6f,OACzB99J,EACAg+J,GAWN+E,cACEz4E,EACA7H,EACAonD,EACAk3B,GAEA,MAAMtD,EAAO,GACb,IAAIt6E,GAAQ,EAEZ,MAAQmnB,KAAK8hC,IAAI9hD,IAAQ,CACvB,GAAInH,EACFA,GAAQ,OAGR,GADAmnB,KAAKuiC,OAAO9gB,EAAG75B,OACXoY,KAAK1iB,MAAM0C,GAAQ,CACjBy2E,GACFz2D,KAAKy9B,SACHg5B,EACA,gBACAz2D,KAAK8oB,MAAM2L,cAGfz0B,KAAK5iB,OACL,MAIJ+1E,EAAKroF,KAAKk1B,KAAK22D,kBAAkBx+E,EAAYonD,IAE/C,OAAO4zB,EAGTwD,kBACEx+E,EACAonD,EACAuN,EACA0pB,GAEA,IAAIxT,EACJ,GAAIhjD,KAAK1iB,MAAMmkC,EAAG75B,OACXzP,GACH6nB,KAAK0jB,MAAM1jB,KAAK8oB,MAAMlxC,IAAKutC,EAAOrF,gBAAiB,KAErDkjC,EAAM,UACD,GAAIhjD,KAAK1iB,MAAMmkC,EAAGvO,UAAW,CAClC,MAAM+kD,EAAqBj4D,KAAK8oB,MAAM9zC,MAChCkjF,EAAqBl4D,KAAK8oB,MAAM+J,SACtCmwB,EAAMhjD,KAAKouC,eACTpuC,KAAK+yD,YAAYxzB,EAAqBuN,GACtCmrB,EACAC,QAEG,GAAIl4D,KAAK1iB,MAAMmkC,EAAG1O,UAAW,CAClC/S,KAAKwnD,aAAa,sBACbgP,GACHx2D,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOjG,+BAEtC,MAAMj4C,EAAO+4B,KAAK4+B,YAClB5+B,KAAK5iB,OACL4lE,EAAMhjD,KAAK8+B,WAAW73D,EAAM,4BAE5B+7E,EAAMhjD,KAAKyiC,wBACTlD,EACAv/B,KAAKouC,eACLtB,GAGJ,OAAOkW,EASTne,gBAAgBkD,GACd,MAAM9gE,EAAO+4B,KAAK4+B,YACZ/rI,EAAOmtG,KAAKq6C,oBAAoBpzE,EAAK+N,MAAO+yD,GAElD,OAAO/nC,KAAKorC,iBAAiBnkE,EAAMp0E,GAGrCu4I,iBAAiBnkE,EAAoBp0E,GAInC,OAHAo0E,EAAKp0E,KAAOA,EACZo0E,EAAKK,IAAIiwC,eAAiB1kH,EAEnBmtG,KAAK8+B,WAAW73D,EAAM,cAG/BozE,oBAAoBziE,EAAamwD,GAC/B,IAAIl1I,EAEJ,MAAMmiF,MAAEA,EAAFlO,KAASA,GAASk5B,KAAK8oB,MAE7B,GAAIhiD,IAAS26C,EAAG5uH,KACdA,EAAOmtG,KAAK8oB,MAAMp1H,UACb,CAAA,IAAIozE,EAAKmqC,QAgBd,MAAMjR,KAAK4hC,aAVX,GALA/uI,EAAOi0E,EAAKmqC,QAKRnqC,IAAS26C,EAAGvL,QAAUpvC,IAAS26C,EAAGpM,UAAW,CAC/C,MAAMmuB,EAAaxjC,KAAKwjC,aAEtBA,IAAe7O,EAAGglC,mBAClBn2B,IAAe7O,EAAGilC,oBAElB55D,KAAK8oB,MAAMt/C,QAAQyU,OAiBzB,OAVI8pD,EAGF/nC,KAAK8oB,MAAMhiD,KAAO26C,EAAG5uH,KAErBmtG,KAAKqyC,kBAAkBx/I,EAAMmiF,IAASlO,EAAKmqC,SAAS,GAGtDjR,KAAK5iB,OAEEvqF,EAGTw/I,kBACE7vB,EACAqQ,EACAoxB,EACArU,GAGA,GAAIptB,EAAKv9C,OAAS,GAChB,OAIF,IxB3vEG,SAA2Bu9C,GAChC,OAAOM,EAAoB/jC,IAAIyjC,GwB0vExBq3C,CAAkBr3C,GACrB,OAGF,GAAa,UAATA,GACF,GAAIxiB,KAAKkhD,UAAU3pB,SAEjB,YADAv3B,KAAK0jB,MAAMmP,EAAU1N,EAAOtE,6BAGzB,GAAa,UAAT2B,EAAkB,CAC3B,GAAIxiB,KAAKkhD,UAAU5pB,SAEjB,YADAt3B,KAAK0jB,MAAMmP,EAAU1N,EAAOnN,wBAEvB,GAAIhY,KAAK6kB,MAAMR,gBAAkBrkB,KAAK6kB,MAAMP,mBAEjD,YADAtkB,KAAK0jB,MAAMmP,EAAU1N,EAAOlN,qCAG5BjY,KAAKoyD,gBAAgBvH,gCACnBh4B,EACA1N,EAAOnN,6BAGN,GAAa,cAATwK,GACLxiB,KAAK6kB,MAAMT,gCAEb,YADApkB,KAAK0jB,MAAMmP,EAAU1N,EAAOrN,kBAKhC,GAAImsC,GAAiBphC,EAAUL,GAE7B,YADAxiB,KAAK0jB,MAAMmP,EAAU1N,EAAO7F,kBAAmBkD,IAI3BxiB,KAAK8oB,MAAM6J,OAE7Bid,EACAhtB,EACAF,EAHAH,GAKaC,EAAMxiB,KAAKyiB,WAC1BziB,KAAK0jB,MAAMmP,EAAU1N,EAAOvF,uBAAwB4C,GAIxDgzC,iBACE,QAAIx1D,KAAKkhD,UAAU5pB,aACft3B,KAAKrrG,QAAQwzJ,2BAA8BnoD,KAAK6kB,MAAMf,YAQ5D2xC,WAAWn2B,EAAkBzM,GAC3B,MAAM5rD,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GAuBxC,OArBA7yB,KAAKoyD,gBAAgBzH,gCACnB1jF,EAAK+N,MACLmwC,EAAOjN,gCAGLlY,KAAK8hC,IAAIrgB,EAAGjN,OACdxU,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAOpI,mBAG3B/c,KAAK6kB,MAAMf,YAAe9jB,KAAKrrG,QAAQwzJ,4BACtCnoD,KAAK81D,mBACP91D,KAAK4rD,6BAA8B,EAEnC5rD,KAAK2rD,mBAAoB,GAIxB3rD,KAAK8oB,MAAMgL,YACd7sD,EAAKijB,SAAW8V,KAAK89C,gBAAgB,MAAM,IAGtC99C,KAAK8+B,WAAW73D,EAAM,mBAG/B6uF,mBACE,OACE91D,KAAK63C,yBAGL73C,KAAK1iB,MAAMmkC,EAAGnN,UACdtU,KAAK1iB,MAAMmkC,EAAG/O,SACd1S,KAAK1iB,MAAMmkC,EAAGzP,WACdhS,KAAK1iB,MAAMmkC,EAAGtO,YAGdnT,KAAK1iB,MAAMmkC,EAAG5P,SACd7R,KAAK1iB,MAAMmkC,EAAGhN,QAGbzU,KAAKk7B,UAAU,gBAAkBl7B,KAAK1iB,MAAMmkC,EAAGlN,QAMpD+/C,aACE,MAAMrtF,EAAO+4B,KAAK4+B,YAElB5+B,KAAKoyD,gBAAgBzH,gCACnB1jF,EAAK+N,MACLmwC,EAAOrE,kBAGT9gB,KAAK5iB,OACL,IAAI08E,GAAa,EACb5vE,EAAW,KACf,IAAK8V,KAAK63C,wBAER,OADAiiB,EAAa95D,KAAK8hC,IAAIrgB,EAAGjN,MACjBxU,KAAK8oB,MAAMhiD,MACjB,KAAK26C,EAAG37C,KACR,KAAK27C,EAAG1P,IACR,KAAK0P,EAAGjP,OACR,KAAKiP,EAAG9O,OACR,KAAK8O,EAAGtP,SACR,KAAKsP,EAAGhP,UACR,KAAKgP,EAAG7O,MACR,KAAK6O,EAAG75B,MAIN,IAAKkyE,EAAY,MAEnB,QACE5vE,EAAW8V,KAAKutC,mBAKtB,OAFAtmE,EAAK8yF,SAAWD,EAChB7yF,EAAKijB,SAAWA,EACT8V,KAAK8+B,WAAW73D,EAAM,mBAM/B0tF,6BAA6BzrE,EAAoB26D,GACc,UAAzD7jD,KAAKo7B,gBAAgB,mBAAoB,aACzB,uBAAdlyC,EAAKpiB,MAGPk5B,KAAK0jB,MAAMmgC,EAAc1+B,EAAO3H,gCAKtCy3C,uBACE+E,EACA16B,EACAzM,GAIA,OAFA7yB,KAAKi6D,kCAAkCD,EAAiB16B,GAEjDt/B,KAAKk6D,8BACVF,EACA16B,EACAzM,GAIJonC,kCACED,EACA16B,GAEA,GAAIt/B,KAAK1iB,MAAMmkC,EAAGxO,OAGhB,MAAMjT,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAO7H,qBACR,uBAAzB08C,EAAgBlzF,MACzBk5B,KAAK0jB,MAAM4b,EAAUna,EAAO5H,gCAIhC28C,8BACEF,EACA16B,EACAzM,GAEA,MAAMqT,EAAWlmC,KAAK48B,YAAY0C,EAAUzM,GACtCsnC,EAAoBn6D,KAAKm6D,kBAAkBH,GASjD,OARIG,EACFj0B,EAAS/vD,OAAS6jF,GAEbh6D,KAAKo6D,8CACRp6D,KAAK0jB,MAAM4b,EAAUna,EAAO1H,qBAE9ByoB,EAASh6C,WAAa8tE,GAEjBh6D,KAAK8+B,WACVoH,EACAi0B,EAAoB,uBAAyB,2BAIjDA,kBAAkBjuE,GAChB,OAAQA,EAAWplB,MACjB,IAAK,mBACH,OACGolB,EAAWN,UAAYoU,KAAKm6D,kBAAkBjuE,EAAWgqC,QAE9D,IAAK,aACH,OAAO,EACT,QACE,OAAO,GAUb8+B,2BAA8BqF,GAC5B,MAAMC,EAAyBt6D,KAAK8oB,MAAM6K,aAC1C3zB,KAAK8oB,MAAM6K,aAAe,CAExBC,yBAA0B,EAE1BC,cAAe,MAGjB,IACE,OAAOwmC,IADT,QAGEr6D,KAAK8oB,MAAM6K,aAAe2mC,GAW9BC,2BAA8BF,GAC5B,MAAMC,EAAyBt6D,KAAK8oB,MAAM6K,aAC1C3zB,KAAK8oB,MAAM6K,aAAe,CAExBC,yBAA0B,EAE1BC,cAAe,MAGjB,IACE,OAAOwmC,IADT,QAGEr6D,KAAK8oB,MAAM6K,aAAe2mC,GAI9BnF,+BAAkCkF,GAChC,MAAMG,EAA6Bx6D,KAAK8oB,MAAMgL,UAC9C9zB,KAAK8oB,MAAMgL,WAAY,EAEvB,IACE,OAAOumC,IADT,QAGEr6D,KAAK8oB,MAAMgL,UAAY0mC,GAI3BpG,WAAciG,GACZ,MAAMh3C,EAAQrjB,KAAKkhD,UAAU7pB,eAE7B,GfzlFS,GewlF0BhU,EACf,CAClBrjB,KAAKkhD,UAAUv8B,Mf1lFR,Ee0lFctB,GACrB,IACE,OAAOg3C,IADT,QAGEr6D,KAAKkhD,UAAUt8B,QAGnB,OAAOy1C,IAGTnG,cAAiBmG,GACf,MAAMh3C,EAAQrjB,KAAKkhD,UAAU7pB,eAE7B,GfvmFS,EesmF2BhU,EACd,CACpBrjB,KAAKkhD,UAAUv8B,OAAc,EAARtB,GACrB,IACE,OAAOg3C,IADT,QAGEr6D,KAAKkhD,UAAUt8B,QAGnB,OAAOy1C,IAKT/C,yBACEt3D,KAAK8oB,MAAM6K,aAAaE,cAAgB,EAG1CwjC,sDACE,OAAOr3D,KAAK8oB,MAAM6K,aAAaC,0BAA4B,EAG7DwmC,6CACE,OAC2C,MAAzCp6D,KAAK8oB,MAAM6K,aAAaE,eACxB7zB,KAAK8oB,MAAM6K,aAAaE,eAAiB,EAI7CuhC,wBAAwBV,GACtB,MAAMp1B,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAE5B7yB,KAAK8oB,MAAMkK,iBAAmBhzB,KAAK8oB,MAAM9zC,MACzC,MAAM0hF,EAAgC12D,KAAK8oB,MAAMiL,2BACjD/zB,KAAK8oB,MAAMiL,4BAA6B,EAExC,MAAM5nC,EAAM6T,KAAK4jD,YACf5jD,KAAK89C,kBACLxe,EACAzM,EACA6hC,GAKF,OAFA10D,KAAK8oB,MAAMiL,2BAA6B2iC,EAEjCvqE,EAITupE,wBACE11D,KAAKwnD,aAAa,gBAClB,MAAMvgF,EAAO+4B,KAAK4+B,YAClB5+B,KAAK5iB,OACL4iB,KAAK8hC,IAAIrgB,EAAGpP,QAEZ,MAAMooD,EAAez6D,KAAK4xD,kBAAiC,GAC3D5xD,KAAKqyD,qBAEL,MAAMhnE,EAAU2U,KAAK4+B,YACrB,IACE33D,EAAKhB,KAAO+5B,KAAK06D,aAAarvE,EAASo2B,EAAGjP,OAAQ,UADpD,QAGEioD,IAGF,OADAz6D,KAAK8hC,IAAIrgB,EAAGjP,QACLxS,KAAK8+B,WAA+B73D,EAAM,sBF1kFnD0tE,cAAc7zC,EAAczV,GAM1B,OALAyV,EAAKzV,QAAU2U,KAAK06D,aAAarvE,GACjCyV,EAAKzlB,SAAW2kB,KAAK8oB,MAAMztC,SAEvB2kB,KAAKrrG,QAAQ8zJ,SAAQ3nD,EAAK2nD,OA/ClC,SAA4BA,GAExB,IAAK,IAAIthF,EAAI,EAAGA,EAAIshF,EAAOxjF,OAAQkC,IAAK,CACtC,MAAMoqC,EAAQk3C,EAAOthF,GACrB,GAAIoqC,EAAMzqC,OAAS26C,EAAG3P,YAAa,CACjC,MAAMxqC,IAAEA,EAAF0N,MAAOA,EAAPthF,MAAcA,EAAdsxE,IAAqBA,GAAQusC,EAC7BopD,EAAa3lF,EAAQ,EACrB4lF,EAAa,IAAIxjD,EAAS9vC,EAAI0N,MAAMC,KAAM3N,EAAI0N,MAAME,OAAS,GACnEuzE,EAAOh+E,OACLtD,EACA,EAEA,IAAIgiF,GAAM,CACRriF,KAAM26C,EAAGpO,KACT3/G,MAAO,IACPshF,MAAOA,EACPhQ,IAAK21F,EACL9nC,SAAUvrD,EAAI0N,MACd89C,OAAQ8nC,IAGV,IAAIzR,GAAM,CACRriF,KAAM26C,EAAG5uH,KACTa,MAAOA,EACPshF,MAAO2lF,EACP31F,IAAKA,EACL6tD,SAAU+nC,EACV9nC,OAAQxrD,EAAItC,QAMtB,OAAOyjF,EAckCoS,CAAmB76D,KAAKyoD,SAExDzoD,KAAK8+B,WAAWh+B,EAAM,QAG/B45D,aACErvE,EACArmB,EAAiBy8C,EAAG1P,IACpBmjB,EAAyBl1B,KAAKrrG,QAAQugI,YAKtC,GAHA7pC,EAAQ6pC,WAAaA,EACrB7pC,EAAQyvE,YAAc96D,KAAK+6D,4BAC3B/6D,KAAK09B,eAAeryC,GAAS,GAAM,EAAMrmB,GAEvCg7B,KAAKyiB,WACJziB,KAAKrrG,QAAQ4zJ,wBACdvoD,KAAK6kB,MAAMjB,iBAAiB3mB,KAAO,EAEnC,IAAK,MAAOpqG,KAASgrG,MAAM4rD,KAAKzpD,KAAK6kB,MAAMjB,kBAAmB,CAC5D,MAAMhsC,EAAMooB,KAAK6kB,MAAMjB,iBAAiBpiC,IAAI3uF,GAE5CmtG,KAAK0jB,MAAM9rC,EAAKutC,EAAO1I,sBAAuB5pH,GAGlD,OAAOmtG,KAAK8+B,WAAsBzzC,EAAS,WAK7CmyC,gBAAgBb,GACd,MAAM8P,EAAO9P,EAAKzwC,WAEZwwC,EAAmB18B,KAAK48B,YAAY6P,EAAKz3D,MAAOy3D,EAAKnlE,IAAI0N,OACzDynD,EAAYz8B,KAAK48B,YAAYD,EAAK3nD,MAAO2nD,EAAKr1D,IAAI0N,OAElD8U,EAAMkW,KAAKhR,MAAM5pB,MAAMqnE,EAAKz3D,MAAOy3D,EAAKznE,KACxC20B,EAAO+iC,EAAiBhpI,MAAQo2F,EAAI1kB,MAAM,GAAI,GAYpD,OAVA46B,KAAKy9B,SAASf,EAAkB,MAAO5yC,GACvCkW,KAAKy9B,SAASf,EAAkB,WAAY/iC,GAE5C8iC,EAAU/oI,MAAQssG,KAAK+8B,aACrBL,EACA,mBACA+P,EAAKznE,IACLynE,EAAKnlE,IAAItC,KAGJg7B,KAAK+8B,aAAaN,EAAW,YAAaE,EAAK33D,IAAK23D,EAAKr1D,IAAItC,KAGtE+1F,4BACE,IAAK/6D,KAAK1iB,MAAMmkC,EAAGnO,sBACjB,OAAO,KAGT,MAAMrsC,EAAO+4B,KAAK4+B,YAGlB,OAFA33D,EAAKvzE,MAAQssG,KAAK8oB,MAAMp1H,MACxBssG,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAM,wBAG/Bu/D,MAAMh9D,GACJ,QAAKw2B,KAAK2lC,aAAa,QAGhB3lC,KAAKg7D,aAAaxxF,GAY3BwxF,aAAaxxF,GACX,MAAM4T,EAAO4iB,KAAKu3C,iBACZ4Z,EAASnxD,KAAKitD,eAAe7vE,GAMnC,GACQ,KAAN+zE,GACM,KAANA,EAEA,OAAO,EAET,GAAI3nF,EAAS,OAAO,EAEpB,GAAU,MAAN2nF,EAAqC,OAAO,EAEhD,GAAIlvC,EAAkBkvC,GAAS,CAC7B1F,GAA0B5vD,UAAYze,EACtC,MAAM7F,EAAUk0E,GAA0BnmF,KAAK06B,KAAKhR,OACpD,GAAgB,OAAZzX,EAAkB,CAGpB,MAAM0jF,EAAQj7D,KAAKitD,eAAe7vE,EAAO7F,EAAQ,GAAGtS,QACpD,IAAKk9C,EAAiB84C,IAAe,KAALA,EAC9B,OAAO,EAGX,OAAO,EAET,OAAO,EAYT5uB,eAAe7iE,EAAkB8iE,GAI/B,OAHItsC,KAAK1iB,MAAMmkC,EAAGrZ,KAChBpI,KAAKm3D,iBAAgB,GAEhBn3D,KAAKukD,sBAAsB/6E,EAAS8iE,GAG7CiY,sBAAsB/6E,EAAkB8iE,GACtC,IAAIwV,EAAY9hD,KAAK8oB,MAAMhiD,KAC3B,MAAMG,EAAO+4B,KAAK4+B,YAClB,IAAIC,EAWJ,OATI7+B,KAAKwmC,MAAMh9D,KACbs4E,EAAYrgC,EAAG9L,KACfkpB,EAAO,OAODijB,GACN,KAAKrgC,EAAG9M,OACR,KAAK8M,EAAG3M,UAEN,OAAO9U,KAAKk7D,4BAA4Bj0F,EAAM66E,EAAU7wC,SAC1D,KAAKwQ,EAAG1M,UACN,OAAO/U,KAAKm7D,uBAAuBl0F,GACrC,KAAKw6C,EAAGxM,IACN,OAAOjV,KAAKo7D,iBAAiBn0F,GAC/B,KAAKw6C,EAAGrM,KACN,OAAOpV,KAAKq7D,kBAAkBp0F,GAChC,KAAKw6C,EAAGpM,UACN,GAAI,KAAArV,KAAK69C,oBAAuC,MAQhD,OAPIr0E,IACEw2B,KAAK8oB,MAAM6J,OACb3yB,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAO3G,gBACf,OAAZh1C,GAAgC,UAAZA,GAC7Bw2B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOhH,iBAGjCne,KAAKgiD,uBAAuB/6E,GAAM,GAAQuC,GAEnD,KAAKi4C,EAAGvL,OAEN,OADI1sC,GAASw2B,KAAK4hC,aACX5hC,KAAKiiD,WAAWh7E,GAAM,GAE/B,KAAKw6C,EAAGnM,IACN,OAAOtV,KAAKs7D,iBAAiBr0F,GAC/B,KAAKw6C,EAAGlM,QACN,OAAOvV,KAAKu7D,qBAAqBt0F,GACnC,KAAKw6C,EAAGjM,QACN,OAAOxV,KAAKw7D,qBAAqBv0F,GACnC,KAAKw6C,EAAGhM,OACN,OAAOzV,KAAKy7D,oBAAoBx0F,GAClC,KAAKw6C,EAAG/L,KACN,OAAO1V,KAAK07D,kBAAkBz0F,GAEhC,KAAKw6C,EAAG7L,OACR,KAAK6L,EAAG9L,KAKN,OAJAkpB,EAAOA,GAAQ7+B,KAAK8oB,MAAMp1H,MACtB81E,GAAoB,QAATq1D,GACb7+B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAO3F,8BAE/Bxf,KAAKkiD,kBAAkBj7E,EAAM43D,GAEtC,KAAKpd,EAAG5L,OACN,OAAO7V,KAAK27D,oBAAoB10F,GAClC,KAAKw6C,EAAG3L,MACN,OAAO9V,KAAK47D,mBAAmB30F,GACjC,KAAKw6C,EAAGpP,OACN,OAAOrS,KAAKmnD,aACd,KAAK1lC,EAAG37C,KACN,OAAOk6B,KAAK67D,oBAAoB50F,GAClC,KAAKw6C,EAAGpL,QAAS,CACf,MAAMylD,EAAoB97D,KAAK69C,oBAC/B,GACmB,KAAjBie,GACiB,KAAjBA,EAEA,MAIJ,KAAKr6C,EAAGrL,QAAS,CAOf,IAAIxrC,EA0BJ,OAhCKo1B,KAAKrrG,QAAQ0zJ,6BAAgC/b,GAChDtsC,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAO9F,wBAGtCrf,KAAK5iB,OAGD0kE,IAAcrgC,EAAGpL,SACnBzrC,EAASo1B,KAAKmmC,YAAYl/D,GAGR,sBAAhB2D,EAAO9D,MACL8D,EAAOg+C,YAAoC,UAAtBh+C,EAAOg+C,aAE9B5oB,KAAK2rD,mBAAoB,KAG3B/gF,EAASo1B,KAAKggC,YAAY/4D,IAGP,2BAAhB2D,EAAO9D,MACJ8D,EAAO87D,YAAoC,UAAtB97D,EAAO87D,cACf,yBAAhB97D,EAAO9D,MACJ8D,EAAO87D,YAAoC,UAAtB97D,EAAO87D,aAChB,6BAAhB97D,EAAO9D,OAEPk5B,KAAK2rD,mBAAoB,IAI7B3rD,KAAKsuC,wBAAwBrnE,GAEtB2D,EAGT,QACE,GAAIo1B,KAAK+7D,kBAQP,OAPIvyF,GACFw2B,KAAK0jB,MACH1jB,KAAK8oB,MAAM9zC,MACXmwC,EAAOpN,uCAGX/X,KAAK5iB,OACE4iB,KAAKgiD,uBAAuB/6E,GAAM,GAAOuC,GAUtD,MAAMwyF,EAAYh8D,KAAK8oB,MAAMp1H,MACvB+4I,EAAOzsC,KAAKsiC,kBAElB,OACEwf,IAAcrgC,EAAG5uH,MACH,eAAd45I,EAAK3lE,MACLk5B,KAAK8hC,IAAIrgB,EAAG7O,OAEL5S,KAAKi8D,sBAAsBh1F,EAAM+0F,EAAWvvB,EAAMjjE,GAElDw2B,KAAKwsC,yBAAyBvlE,EAAMwlE,GAI/C6B,wBAAwBrnE,GACjB+4B,KAAKrrG,QAAQ0zJ,6BAAgCroD,KAAKyiB,UACrDziB,KAAK0jB,MAAMz8C,EAAK+N,MAAO4iF,EAAuB12C,qBAIlDmmC,eAAepgF,GACb,MAAM67E,EACJ9iD,KAAK8oB,MAAMmL,eAAej0B,KAAK8oB,MAAMmL,eAAehvD,OAAS,GAC3D69E,EAAW79E,SACbgC,EAAK67E,WAAaA,EAClB9iD,KAAKmzC,2BAA2BlsE,EAAM67E,EAAW,IACjD9iD,KAAK8oB,MAAMmL,eAAej0B,KAAK8oB,MAAMmL,eAAehvD,OAAS,GAAK,IAItE+gF,0BACE,OAAOhmD,KAAK1iB,MAAMmkC,EAAGvL,QAGvBihD,gBAAgB+E,GACd,MAAMC,EACJn8D,KAAK8oB,MAAMmL,eAAej0B,KAAK8oB,MAAMmL,eAAehvD,OAAS,GAC/D,KAAO+6B,KAAK1iB,MAAMmkC,EAAGrZ,KAAK,CACxB,MAAMg0D,EAAYp8D,KAAKozD,iBACvB+I,EAAyBrxF,KAAKsxF,GAGhC,GAAIp8D,KAAK1iB,MAAMmkC,EAAGrL,SACX8lD,GACHl8D,KAAK4hC,aAIL5hC,KAAKk7B,UAAU,gBACdl7B,KAAKo7B,gBAAgB,aAAc,2BAEpCp7B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOnM,2BAEjC,IAAKhZ,KAAKgmD,0BACf,MAAMhmD,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAO5F,4BAI9C6zC,iBACEpzD,KAAKuxD,gBAAgB,CAAC,oBAAqB,eAE3C,MAAMtqF,EAAO+4B,KAAK4+B,YAGlB,GAFA5+B,KAAK5iB,OAED4iB,KAAKk7B,UAAU,cAAe,CAGhCl7B,KAAK8oB,MAAMmL,eAAenpD,KAAK,IAE/B,MAAMw0D,EAAWt/B,KAAK8oB,MAAM9zC,MACtB69C,EAAW7yB,KAAK8oB,MAAM+J,SAC5B,IAAI4Z,EAEJ,GAAIzsC,KAAK8hC,IAAIrgB,EAAG/O,QACd+5B,EAAOzsC,KAAKsiC,kBACZtiC,KAAKuiC,OAAO9gB,EAAG9O,aAIf,IAFA85B,EAAOzsC,KAAK6kC,iBAAgB,GAErB7kC,KAAK8hC,IAAIrgB,EAAG3O,MAAM,CACvB,MAAM7rC,EAAO+4B,KAAK48B,YAAY0C,EAAUzM,GACxC5rD,EAAKivD,OAASuW,EACdxlE,EAAK0kB,SAAWqU,KAAK6kC,iBAAgB,GACrC59D,EAAK2kB,UAAW,EAChB6gD,EAAOzsC,KAAK8+B,WAAW73D,EAAM,oBAIjCA,EAAKilB,WAAa8T,KAAK6lD,6BAA6BpZ,GACpDzsC,KAAK8oB,MAAMmL,eAAeh2C,WAE1BhX,EAAKilB,WAAa8T,KAAK+1D,sBAEzB,OAAO/1D,KAAK8+B,WAAW73D,EAAM,aAG/B4+E,6BAA6BpZ,GAC3B,GAAIzsC,KAAK8hC,IAAIrgB,EAAG/O,QAAS,CACvB,MAAMzrC,EAAO+4B,KAAKygC,gBAAgBgM,GAIlC,OAHAxlE,EAAKkP,OAASs2D,EACdxlE,EAAKoP,UAAY2pB,KAAKg0C,6BAA6BvyB,EAAG9O,QAAQ,GAC9D3S,KAAK+vC,iBAAiB9oE,EAAKoP,WACpB2pB,KAAK8+B,WAAW73D,EAAM,kBAG/B,OAAOwlE,EAGTyuB,4BACEj0F,EACAgqC,GAEA,MAAMorD,EAAsB,UAAZprD,EAYhB,OAXAjR,KAAK5iB,OAED4iB,KAAKm7C,mBACPl0E,EAAK8pC,MAAQ,MAEb9pC,EAAK8pC,MAAQ/Q,KAAK6kC,kBAClB7kC,KAAKolC,aAGPplC,KAAKknD,oBAAoBjgF,EAAMgqC,GAExBjR,KAAK8+B,WACV73D,EACAo1F,EAAU,iBAAmB,qBAIjCnV,oBACEjgF,EACAgqC,GAEA,MAAMorD,EAAsB,UAAZprD,EAChB,IAAI9pC,EACJ,IAAKA,EAAI,EAAGA,EAAI64B,KAAK8oB,MAAMkL,OAAO/uD,SAAUkC,EAAG,CAC7C,MAAMm1F,EAAMt8D,KAAK8oB,MAAMkL,OAAO7sD,GAC9B,GAAkB,MAAdF,EAAK8pC,OAAiBurD,EAAIzpK,OAASo0E,EAAK8pC,MAAMl+G,KAAM,CACtD,GAAgB,MAAZypK,EAAIz9B,OAAiBw9B,GAAwB,SAAbC,EAAIz9B,MAAkB,MAC1D,GAAI53D,EAAK8pC,OAASsrD,EAAS,OAG3Bl1F,IAAM64B,KAAK8oB,MAAMkL,OAAO/uD,QAC1B+6B,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAOjL,qBAAsBjJ,GAIxDkqD,uBAAuBl0F,GAGrB,OAFA+4B,KAAK5iB,OACL4iB,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,qBAG/Bs1F,wBACEv8D,KAAKuiC,OAAO9gB,EAAG/O,QACf,MAAM/Y,EAAMqG,KAAKsiC,kBAEjB,OADAtiC,KAAKuiC,OAAO9gB,EAAG9O,QACRhZ,EAGTyhE,iBAAiBn0F,GAkBf,OAjBA+4B,KAAK5iB,OACL4iB,KAAK8oB,MAAMkL,OAAOlpD,KAAKwgF,IAEvBrkF,EAAKhB,KAIH+5B,KAAKu6D,4BAA2B,IAE9Bv6D,KAAKqsC,eAAe,QAGxBrsC,KAAK8oB,MAAMkL,OAAO/1C,MAElB+hB,KAAKuiC,OAAO9gB,EAAG5L,QACf5uC,EAAKxB,KAAOu6B,KAAKu8D,wBACjBv8D,KAAK8hC,IAAIrgB,EAAG37C,MACLk6B,KAAK8+B,WAAW73D,EAAM,oBAW/Bo0F,kBAAkBp0F,GAChB+4B,KAAK5iB,OACL4iB,KAAK8oB,MAAMkL,OAAOlpD,KAAKwgF,IAEvB,IAAIkR,GAAW,EAOf,GANIx8D,KAAKw1D,kBAAoBx1D,KAAKwlC,cAAc,WAC9Cg3B,EAAUx8D,KAAK8oB,MAAM2L,cAEvBz0B,KAAK6kB,MAAMF,MrB7iBmB,GqB8iB9B3kB,KAAKuiC,OAAO9gB,EAAG/O,QAEX1S,KAAK1iB,MAAMmkC,EAAG37C,MAIhB,OAHI02F,GAAW,GACbx8D,KAAK4hC,WAAW46B,GAEXx8D,KAAKy8D,SAASx1F,EAAM,MAG7B,MAAMy1F,EAAgB18D,KAAK2lC,aAAa,OAClCa,EAAQk2B,GAAiB18D,KAAKg7D,eACpC,GAAIh7D,KAAK1iB,MAAMmkC,EAAG9L,OAAS3V,KAAK1iB,MAAMmkC,EAAG7L,SAAW4wB,EAAO,CACzD,MAAMxR,EAAOh1B,KAAK4+B,YACZC,EAAO2H,EAAQ,MAAQxmC,KAAK8oB,MAAMp1H,MAKxC,OAJAssG,KAAK5iB,OACL4iB,KAAK28D,SAAS3nC,GAAM,EAAM6J,GAC1B7+B,KAAK8+B,WAAW9J,EAAM,wBAGnBh1B,KAAK1iB,MAAMmkC,EAAGhL,MAAQzW,KAAK2lC,aAAa,QACZ,IAA7B3Q,EAAK4nC,aAAa33F,OAEX+6B,KAAK68D,WAAW51F,EAAM+tD,EAAMwnC,IAEjCA,GAAW,GACbx8D,KAAK4hC,WAAW46B,GAEXx8D,KAAKy8D,SAASx1F,EAAM+tD,IAK7B,MAAM8nC,EACJ98D,KAAK1iB,MAAMmkC,EAAG5uH,QAAUmtG,KAAK8oB,MAAM+L,YAE/B0K,EAAsB,IAAIyrB,GAC1Bh2B,EAAOh1B,KAAKsiC,iBAAgB,EAAM/C,GAClCw9B,EAAU/8D,KAAK2lC,aAAa,MAmBlC,GAlBIo3B,IAEEL,EACF18D,KAAK0jB,MAAMsR,EAAKhgD,MAAOmwC,EAAOnL,WAGjB,IAAbwiD,GACAM,GACc,eAAd9nC,EAAKluD,MACS,UAAdkuD,EAAKniI,MAMLmtG,KAAK0jB,MAAMsR,EAAKhgD,MAAOmwC,EAAOpL,aAG9BgjD,GAAW/8D,KAAK1iB,MAAMmkC,EAAGhL,KAAM,CACjCzW,KAAKw/B,aAAaxK,GAAkB,GACpC,MAAMgoC,EAAcD,EAAU,mBAAqB,mBAEnD,OADA/8D,KAAKqwC,UAAUrb,EAAMgoC,GACdh9D,KAAK68D,WAAW51F,EAAM+tD,EAAMwnC,GAOrC,OALEx8D,KAAK0xD,sBAAsBnyB,GAAqB,GAE9Ci9B,GAAW,GACbx8D,KAAK4hC,WAAW46B,GAEXx8D,KAAKy8D,SAASx1F,EAAM+tD,GAG7BgtB,uBACE/6E,EACA0wD,EACAslC,GAGA,OADAj9D,KAAK5iB,OACE4iB,KAAK+2D,cACV9vF,EAtlBa,GAulBKg2F,EAAsB,EAtlBnB,GAulBrBtlC,GAIJ2jC,iBAAiBr0F,GAKf,OAJA+4B,KAAK5iB,OACLnW,EAAKxB,KAAOu6B,KAAKu8D,wBACjBt1F,EAAK2P,WAAaopB,KAAKqsC,eAAe,MACtCplE,EAAK4P,UAAYmpB,KAAK8hC,IAAIrgB,EAAGvM,OAASlV,KAAKqsC,eAAe,MAAQ,KAC3DrsC,KAAK8+B,WAAW73D,EAAM,eAG/Bs0F,qBAAqBt0F,GAkBnB,OAjBK+4B,KAAKkhD,UAAU1pB,WAAcx3B,KAAKrrG,QAAQyzJ,4BAC7CpoD,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAO/K,eAGtCpa,KAAK5iB,OAMD4iB,KAAKm7C,mBACPl0E,EAAKijB,SAAW,MAEhBjjB,EAAKijB,SAAW8V,KAAKsiC,kBACrBtiC,KAAKolC,aAGAplC,KAAK8+B,WAAW73D,EAAM,mBAG/Bu0F,qBAAqBv0F,GACnB+4B,KAAK5iB,OACLnW,EAAKi2F,aAAel9D,KAAKu8D,wBACzB,MAAMY,EAASl2F,EAAKk2F,MAAQ,GAS5B,IAAIlmE,EACKmmE,EAAT,IATAp9D,KAAKuiC,OAAO9gB,EAAGpP,QACfrS,KAAK8oB,MAAMkL,OAAOlpD,KAAKygF,IACvBvrD,KAAK6kB,MAAMF,MrBpqBmB,IqB2qBR3kB,KAAK1iB,MAAMmkC,EAAGjP,SAClC,GAAIxS,KAAK1iB,MAAMmkC,EAAG7M,QAAU5U,KAAK1iB,MAAMmkC,EAAGzM,UAAW,CACnD,MAAMqoD,EAASr9D,KAAK1iB,MAAMmkC,EAAG7M,OACzB3d,GAAK+I,KAAK8+B,WAAW7nC,EAAK,cAC9BkmE,EAAMryF,KAAMmsB,EAAM+I,KAAK4+B,aACvB3nC,EAAIrgB,WAAa,GACjBopB,KAAK5iB,OACDigF,EACFpmE,EAAIxxB,KAAOu6B,KAAKsiC,mBAEZ86B,GACFp9D,KAAK0jB,MACH1jB,KAAK8oB,MAAM2L,aACXtP,EAAOzI,0BAGX0gD,GAAa,EACbnmE,EAAIxxB,KAAO,MAEbu6B,KAAKuiC,OAAO9gB,EAAG7O,YAEX3b,EACFA,EAAIrgB,WAAW9L,KAAKk1B,KAAKqsC,eAAe,OAExCrsC,KAAK4hC,aAQX,OAJA5hC,KAAK6kB,MAAMD,OACP3tB,GAAK+I,KAAK8+B,WAAW7nC,EAAK,cAC9B+I,KAAK5iB,OACL4iB,KAAK8oB,MAAMkL,OAAO/1C,MACX+hB,KAAK8+B,WAAW73D,EAAM,mBAG/Bw0F,oBAAoBx0F,GAOlB,OANA+4B,KAAK5iB,OACD4iB,KAAK63C,yBACP73C,KAAK0jB,MAAM1jB,KAAK8oB,MAAM4L,WAAYvP,EAAOxI,mBAE3C11C,EAAKijB,SAAW8V,KAAKsiC,kBACrBtiC,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,kBAG/Bm/E,wBACE,MAAMva,EAAQ7rC,KAAKsyC,mBAEbgrB,EAAwB,eAAfzxB,EAAM/kE,KAIrB,OAHAk5B,KAAK6kB,MAAMF,MAAM24C,ErBxtBa,EqBwtBiB,GAC/Ct9D,KAAKqwC,UAAUxE,EAAO,erB/qBQ5F,GqBirBvB4F,EAGT6vB,kBAAkBz0F,GAMhB,GALA+4B,KAAK5iB,OAELnW,EAAKumF,MAAQxtD,KAAKmnD,aAClBlgF,EAAKs2F,QAAU,KAEXv9D,KAAK1iB,MAAMmkC,EAAG5M,QAAS,CACzB,MAAM2oD,EAASx9D,KAAK4+B,YACpB5+B,KAAK5iB,OACD4iB,KAAK1iB,MAAMmkC,EAAG/O,SAChB1S,KAAKuiC,OAAO9gB,EAAG/O,QACf8qD,EAAO3xB,MAAQ7rC,KAAKomD,wBACpBpmD,KAAKuiC,OAAO9gB,EAAG9O,UAEf6qD,EAAO3xB,MAAQ,KACf7rC,KAAK6kB,MAAMF,MrBjvBe,IqBovB5B64C,EAAOv3F,KAGL+5B,KAAKu6D,4BAA2B,IAE9Bv6D,KAAKmnD,YAAW,GAAO,KAE3BnnD,KAAK6kB,MAAMD,OAEX39C,EAAKs2F,QAAUv9D,KAAK8+B,WAAW0+B,EAAQ,eASzC,OANAv2F,EAAKw2F,UAAYz9D,KAAK8hC,IAAIrgB,EAAGtM,UAAYnV,KAAKmnD,aAAe,KAExDlgF,EAAKs2F,SAAYt2F,EAAKw2F,WACzBz9D,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAOvI,kBAGzB5c,KAAK8+B,WAAW73D,EAAM,gBAG/Bi7E,kBACEj7E,EACA43D,GAKA,OAHA7+B,KAAK5iB,OACL4iB,KAAK28D,SAAS11F,GAAM,EAAO43D,GAC3B7+B,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,uBAG/B00F,oBAAoB10F,GAgBlB,OAfA+4B,KAAK5iB,OACLnW,EAAKxB,KAAOu6B,KAAKu8D,wBACjBv8D,KAAK8oB,MAAMkL,OAAOlpD,KAAKwgF,IAEvBrkF,EAAKhB,KAIH+5B,KAAKu6D,4BAA2B,IAE9Bv6D,KAAKqsC,eAAe,WAGxBrsC,KAAK8oB,MAAMkL,OAAO/1C,MAEX+hB,KAAK8+B,WAAW73D,EAAM,kBAG/B20F,mBAAmB30F,GAiBjB,OAhBI+4B,KAAK8oB,MAAM6J,QACb3yB,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOxG,YAEtC3e,KAAK5iB,OACLnW,EAAKivD,OAASl2B,KAAKu8D,wBAEnBt1F,EAAKhB,KAKH+5B,KAAKu6D,4BAA2B,IAE9Bv6D,KAAKqsC,eAAe,UAGjBrsC,KAAK8+B,WAAW73D,EAAM,iBAG/B40F,oBAAoB50F,GAElB,OADA+4B,KAAK5iB,OACE4iB,KAAK8+B,WAAW73D,EAAM,kBAG/Bg1F,sBACEh1F,EACA+0F,EACAvvB,EACAjjE,GAEA,IAAK,MAAMunC,KAAS/Q,KAAK8oB,MAAMkL,OACzBjjB,EAAMl+G,OAASmpK,GACjBh8D,KAAK0jB,MAAM+oB,EAAKz3D,MAAOmwC,EAAOvJ,mBAAoBogD,GAItD,MAAMn9B,EAAO7+B,KAAK8oB,MAAMhiD,KAAK8pC,OACzB,OACA5Q,KAAK1iB,MAAMmkC,EAAGjM,SACd,SACA,KACJ,IAAK,IAAIruC,EAAI64B,KAAK8oB,MAAMkL,OAAO/uD,OAAS,EAAGkC,GAAK,EAAGA,IAAK,CACtD,MAAM4pC,EAAQ/Q,KAAK8oB,MAAMkL,OAAO7sD,GAChC,GAAI4pC,EAAM2sD,iBAAmBz2F,EAAK+N,MAIhC,MAHA+7B,EAAM2sD,eAAiB19D,KAAK8oB,MAAM9zC,MAClC+7B,EAAM8tB,KAAOA,EAqBjB,OAfA7+B,KAAK8oB,MAAMkL,OAAOlpD,KAAK,CACrBj4E,KAAMmpK,EACNn9B,KAAMA,EACN6+B,eAAgB19D,KAAK8oB,MAAM9zC,QAE7B/N,EAAKhB,KAAO+5B,KAAKqsC,eACf7iE,GACkC,IAA9BA,EAAQgC,QAAQ,SACdhC,EAAU,QACVA,EACF,SAGNw2B,KAAK8oB,MAAMkL,OAAO/1C,MAClBhX,EAAK8pC,MAAQ07B,EACNzsC,KAAK8+B,WAAW73D,EAAM,oBAG/BulE,yBACEvlE,EACAwlE,GAIA,OAFAxlE,EAAKilB,WAAaugD,EAClBzsC,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,uBAO/BkgF,WACEwW,GAA4B,EAC5BC,GAAkC,EAClCC,GAEA,MAAM52F,EAAO+4B,KAAK4+B,YAkBlB,OAjBI++B,GACF39D,KAAK8oB,MAAMgM,aAAas4B,QAE1BptD,KAAKuiC,OAAO9gB,EAAGpP,QACXurD,GACF59D,KAAK6kB,MAAMF,MrBp4BiB,GqBs4B9B3kB,KAAK09B,eACHz2D,EACA02F,GACA,EACAl8C,EAAGjP,OACHqrD,GAEED,GACF59D,KAAK6kB,MAAMD,OAEN5kB,KAAK8+B,WAAW73D,EAAM,kBAG/Bo2D,iBAAiBV,GACf,MACgB,wBAAdA,EAAK71D,MACoB,kBAAzB61D,EAAKzwC,WAAWplB,OACf61D,EAAKzwC,WAAW2wC,MAAMU,cAI3BG,eACEz2D,EACA02F,EACArxB,EACAtnE,EACA64F,GAEA,MAAM53F,EAAQgB,EAAKhB,KAAO,GACpBqP,EAAcrO,EAAKqO,WAAa,GACtC0qB,KAAK8gD,4BACH76E,EACA03F,EAAkBroF,OAAa5/E,EAC/B42I,EACAtnE,EACA64F,GAOJ/c,4BACE76E,EACAqP,EACAg3D,EACAtnE,EACA64F,GAEA,MAAMvW,EAAYtnD,KAAK8oB,MAAM6J,OAC7B,IAAI4mC,GAAyB,EACzBuE,GAAqB,EAEzB,MAAQ99D,KAAK1iB,MAAMtY,IAAM,CACvB,MAAM23D,EAAO38B,KAAKqsC,eAAe,KAAMC,GAEvC,GAAIh3D,IAAewoF,EAAoB,CACrC,GAAI99D,KAAKq9B,iBAAiBV,GAAO,CAC/B,MAAMF,EAAYz8B,KAAKw9B,gBAAgBb,GACvCrnD,EAAWxK,KAAK2xD,GAGb88B,GACyB,eAA1B98B,EAAU/oI,MAAMA,QAEhB6lK,GAAyB,EACzBv5D,KAAKmtD,WAAU,IAGjB,SAEF2Q,GAAqB,EAErB99D,KAAK8oB,MAAMgM,aAAas4B,QAE1BnnF,EAAK6E,KAAK6xD,GAGRkhC,GACFA,EAAgBjgE,KAAKoC,KAAMu5D,GAGxBjS,GACHtnD,KAAKmtD,WAAU,GAGjBntD,KAAK5iB,OAOPq/E,SACEx1F,EACA+tD,GAqBA,OAnBA/tD,EAAK+tD,KAAOA,EACZh1B,KAAKolC,WAAyB,GAC9Bn+D,EAAKxB,KAAOu6B,KAAK1iB,MAAMmkC,EAAG37C,MAAQ,KAAOk6B,KAAKsiC,kBAC9CtiC,KAAKolC,WAAyB,GAC9Bn+D,EAAK0uF,OAAS31D,KAAK1iB,MAAMmkC,EAAG9O,QAAU,KAAO3S,KAAKsiC,kBAClDtiC,KAAKuiC,OAAO9gB,EAAG9O,QAEf1rC,EAAKhB,KAIH+5B,KAAKu6D,4BAA2B,IAE9Bv6D,KAAKqsC,eAAe,SAGxBrsC,KAAK6kB,MAAMD,OACX5kB,KAAK8oB,MAAMkL,OAAO/1C,MAEX+hB,KAAK8+B,WAAW73D,EAAM,gBAM/B41F,WACE51F,EACA+tD,EACAwnC,GAEA,MAAMuB,EAAU/9D,KAAK1iB,MAAMmkC,EAAGhL,KA4C9B,OA3CAzW,KAAK5iB,OAED2gF,EACEvB,GAAW,GAAGx8D,KAAK4hC,WAAW46B,GAElCv1F,EAAK+2F,MAAQxB,GAAW,EAIV,wBAAdxnC,EAAKluD,MACwB,MAA7BkuD,EAAK4nC,aAAa,GAAG5nC,MACnB+oC,IACA/9D,KAAK8oB,MAAM6J,QACG,QAAdqC,EAAK6J,MAC4B,eAAjC7J,EAAK4nC,aAAa,GAAG34E,GAAGnd,KAOH,sBAAdkuD,EAAKluD,MACdk5B,KAAK0jB,MAAMsR,EAAKhgD,MAAOmwC,EAAOjK,WAAY,YAN1Clb,KAAK0jB,MACHsR,EAAKhgD,MACLmwC,EAAOrL,uBACPikD,EAAU,SAAW,UAMzB92F,EAAKiiB,KAAO8rC,EACZ/tD,EAAKkiB,MAAQ40E,EACT/9D,KAAKsiC,kBACLtiC,KAAKyiC,0BACTziC,KAAKuiC,OAAO9gB,EAAG9O,QAEf1rC,EAAKhB,KAIH+5B,KAAKu6D,4BAA2B,IAE9Bv6D,KAAKqsC,eAAe,SAGxBrsC,KAAK6kB,MAAMD,OACX5kB,KAAK8oB,MAAMkL,OAAO/1C,MAEX+hB,KAAK8+B,WAAW73D,EAAM82F,EAAU,iBAAmB,kBAK5DpB,SACE11F,EACAg3F,EACAp/B,GAEA,MAAM+9B,EAAgB31F,EAAK21F,aAAe,GACpCsB,EAAel+D,KAAKk7B,UAAU,cAEpC,IADAj0D,EAAK43D,KAAOA,IACH,CACP,MAAM0P,EAAOvuC,KAAK4+B,YAiClB,GAhCA5+B,KAAKyyC,WAAWlE,EAAM1P,GAClB7+B,KAAK8hC,IAAIrgB,EAAGlO,IACdg7B,EAAKvZ,KAAOipC,EACRj+D,KAAKq0D,6BACLr0D,KAAKyiC,2BAGE,UAAT5D,GACE7+B,KAAK1iB,MAAMmkC,EAAGhL,MAAQzW,KAAK2lC,aAAa,MAYzB,eAAjB4I,EAAKtqD,GAAGnd,MACNm3F,IAAUj+D,KAAK1iB,MAAMmkC,EAAGhL,MAAQzW,KAAK2lC,aAAa,QAEpD3lC,KAAK0jB,MACH1jB,KAAK8oB,MAAM4L,WACXvP,EAAOtM,8BACP,4BAdGqlD,GACHl+D,KAAK0jB,MACH1jB,KAAK8oB,MAAM4L,WACXvP,EAAOtM,8BACP,sBAaN01B,EAAKvZ,KAAO,MAEd4nC,EAAa9xF,KAAKk1B,KAAK8+B,WAAWyP,EAAM,wBACnCvuC,KAAK8hC,IAAIrgB,EAAG75B,OAAQ,MAE3B,OAAO3gB,EAGTwrE,WAAWlE,EAA4B1P,GACrC0P,EAAKtqD,GAAK+b,KAAKsyC,mBACftyC,KAAKqwC,UACH9B,EAAKtqD,GACL,uBACS,QAAT46C,ErB3jC4BoH,EADAA,OqB6jC5BvwI,EACS,QAATmpI,GAOJk4B,cACE9vF,EACAk3F,EAjlCkB,EAklClBxmC,GAAoB,GAEpB,MAAMqX,EAnlCS,EAmlCKmvB,EACdC,EAnlCiB,EAmlCID,EACrBE,KAAcrvB,GAnlCH,EAmlCoBmvB,GAErCn+D,KAAKg9B,aAAa/1D,EAAM0wD,GAEpB33B,KAAK1iB,MAAMmkC,EAAGjN,OAAS4pD,GACzBp+D,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOlL,mCAEtChzC,EAAK45B,UAAYb,KAAK8hC,IAAIrgB,EAAGjN,MAEzBw6B,IACF/nE,EAAKgd,GAAK+b,KAAKonD,gBAAgBiX,IAGjC,MAAM1b,EAA4B3iD,KAAK8oB,MAAMqK,uBAiC7C,OAhCAnzB,KAAK8oB,MAAMqK,wBAAyB,EACpCnzB,KAAK6kB,MAAMF,MrBvoCmB,GqBwoC9B3kB,KAAKkhD,UAAUv8B,MAAM+S,GAAcC,EAAS1wD,EAAK45B,YAE5CmuC,IACH/nE,EAAKgd,GAAK+b,KAAKonD,mBAGjBpnD,KAAKuyC,oBAAoBtrE,GAA2B,GAKpD+4B,KAAKu6D,4BAA2B,KAE9Bv6D,KAAKosC,2BACHnlE,EACA+nE,EAAc,sBAAwB,yBAI1ChvC,KAAKkhD,UAAUt8B,OACf5kB,KAAK6kB,MAAMD,OAEPoqB,IAAgBovB,GAIlBp+D,KAAKojD,4BAA4Bn8E,GAGnC+4B,KAAK8oB,MAAMqK,uBAAyBwvB,EAC7B17E,EAGTmgF,gBAAgBiX,GACd,OAAOA,GAAar+D,KAAK1iB,MAAMmkC,EAAG5uH,MAAQmtG,KAAK6kC,kBAAoB,KAGrE0N,oBAAoBtrE,EAAkBurE,GACpCxyC,KAAKuiC,OAAO9gB,EAAG/O,QACf1S,KAAKoyD,gBAAgBztC,MJ/9BhB,IAAIulC,GAlKa,IIkoCtBjjF,EAAKsP,OAASypB,KAAKi7C,iBACjBx5B,EAAG9O,OADS,IAGK,EACjB6/B,GAGFxyC,KAAKoyD,gBAAgBxtC,OAGvBw+B,4BAA4Bn8E,GACrBA,EAAKgd,IAMV+b,KAAK6kB,MAAMC,YACT79C,EAAKgd,GAAGpxF,KACRmtG,KAAK8oB,MAAM6J,QAAU1rD,EAAK45B,WAAa55B,EAAKqsE,MACxCtzC,KAAK6kB,MAAMN,oBrBvpCa0hB,EADAA,EAEAA,GqB0pC5Bh/D,EAAKgd,GAAGjP,OAOZitE,WACEh7E,EACA+nE,EACAC,GAEAjvC,KAAK5iB,OACL4iB,KAAKqnD,eAAepgF,GAGpB,MAAMqgF,EAAYtnD,KAAK8oB,MAAM6J,OAQ7B,OAPA3yB,KAAK8oB,MAAM6J,QAAS,EAEpB3yB,KAAK+uC,aAAa9nE,EAAM+nE,EAAaC,GACrCjvC,KAAK2wC,gBAAgB1pE,GAErBA,EAAKhB,KAAO+5B,KAAKunD,iBAAiBtgF,EAAKy0D,WAAY4rB,GAE5CtnD,KAAK8+B,WACV73D,EACA+nE,EAAc,mBAAqB,mBAIvCuB,kBACE,OAAOvwC,KAAK1iB,MAAMmkC,EAAGlO,KAAOvT,KAAK1iB,MAAMmkC,EAAG37C,OAASk6B,KAAK1iB,MAAMmkC,EAAGjP,QAGnE89B,gBACE,OAAOtwC,KAAK1iB,MAAMmkC,EAAG/O,QAGvB89B,uBAAuBpT,GACrB,QACGA,EAAOxxC,UACPwxC,EAAO+L,QACa,gBAApB/L,EAAOpoI,IAAInC,MACW,gBAArBuqI,EAAOpoI,IAAItB,OAKjB6zJ,eAAezC,EAAwBwC,GACrCtnD,KAAK2pD,WAAWhlC,QAEhB,MAAMmE,EAAiC,CACrCw1C,gBAAgB,EAChBxZ,cAAAA,GAEF,IAAIhC,EAA4B,GAChC,MAAMhlB,EAAyB99B,KAAK4+B,YA8CpC,GA7CAd,EAAU73D,KAAO,GAEjB+5B,KAAKuiC,OAAO9gB,EAAGpP,QAIfrS,KAAKu6D,4BAA2B,KAC9B,MAAQv6D,KAAK1iB,MAAMmkC,EAAGjP,SAAS,CAC7B,GAAIxS,KAAK8hC,IAAIrgB,EAAG37C,MAAO,CACrB,GAAIg9E,EAAW79E,OAAS,EACtB,MAAM+6B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM4L,WAAYvP,EAAOlM,oBAEjD,SAGF,GAAIjZ,KAAK1iB,MAAMmkC,EAAGrZ,IAAK,CACrB06C,EAAWh4E,KAAKk1B,KAAKozD,kBACrB,SAGF,MAAMjkB,EAASnvC,KAAK4+B,YAGhBkkB,EAAW79E,SACbkqE,EAAO2T,WAAaA,EACpB9iD,KAAKmzC,2BAA2BhE,EAAQ2T,EAAW,IACnDA,EAAa,IAGf9iD,KAAKkvC,iBAAiBpR,EAAWqR,EAAQrmB,GAGvB,gBAAhBqmB,EAAOtQ,MACPsQ,EAAO2T,YACP3T,EAAO2T,WAAW79E,OAAS,GAE3B+6B,KAAK0jB,MAAMyrB,EAAOn6D,MAAOmwC,EAAOpM,0BAKtC/Y,KAAK8oB,MAAM6J,OAAS20B,EAEpBtnD,KAAK5iB,OAED0lE,EAAW79E,OACb,MAAM+6B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOrG,mBAK5C,OAFA9e,KAAK2pD,WAAW/kC,OAET5kB,KAAK8+B,WAAWhB,EAAW,aAKpCsR,6BACEtR,EACAqR,GAEA,MAAMn6I,EAAMgrG,KAAK6kC,iBAAgB,GAEjC,GAAI7kC,KAAKswC,gBAAiB,CACxB,MAAMlT,EAAyB+R,EAe/B,OAZA/R,EAAOyB,KAAO,SACdzB,EAAOxxC,UAAW,EAClBwxC,EAAOpoI,IAAMA,EACbooI,EAAO+L,QAAS,EAChBnpC,KAAK69B,gBACHC,EACAV,GACA,GACA,GACoB,GACpB,IAEK,EACF,GAAIp9B,KAAKuwC,kBAAmB,CACjC,MAAM53D,EAAyBw2D,EAO/B,OAJAx2D,EAAKiT,UAAW,EAChBjT,EAAK3jF,IAAMA,EACX2jF,EAAKwwD,QAAS,EACdrL,EAAU73D,KAAK6E,KAAKk1B,KAAK++B,mBAAmBpmD,KACrC,EAET,OAAO,EAGTu2D,iBACEpR,EACAqR,EACArmB,GAEA,MAAMj9C,EAAWm0B,KAAK2lC,aAAa,UAEnC,GAAI95D,EAAU,CACZ,GAAIm0B,KAAKovC,6BAA6BtR,EAAWqR,GAE/C,OAEF,GAAInvC,KAAK8hC,IAAIrgB,EAAGpP,QAEd,YADArS,KAAK2kD,sBAAsB7mB,EAAaqR,GAK5CnvC,KAAK4kD,6BAA6B9mB,EAAWqR,EAAQrmB,EAAOj9C,GAG9D+4E,6BACE9mB,EACAqR,EACArmB,EACAj9C,GAEA,MAAM0yF,EAA4CpvB,EAC5CqvB,EAAoDrvB,EACpDsvB,EAA0CtvB,EAC1CuvB,EAAkDvvB,EAElD/R,EAAqDmhC,EACrDI,EAAwDJ,EAI9D,GAFApvB,EAAOhG,OAASt9D,EAEZm0B,KAAK8hC,IAAIrgB,EAAGjN,MAAO,CAErB4oB,EAAOyB,KAAO,SACd,MAAMP,EAAgBt+B,KAAK1iB,MAAMmkC,EAAG3P,aAGpC,OAFA9R,KAAK4+D,sBAAsBxhC,GAEvBkB,OAEFt+B,KAAK0wC,uBAAuB5S,EAAW0gC,GAAe,GAAM,IAI1Dx+D,KAAKwwC,uBAAuB+tB,IAC9Bv+D,KAAK0jB,MAAM66C,EAAavpK,IAAIggF,MAAOmwC,EAAOvM,6BAG5C5Y,KAAK69B,gBACHC,EACAygC,GACA,GACA,GACoB,GACpB,IAMJ,MAAM1pC,EAAc70B,KAAK8oB,MAAM+L,YACzBgqC,EAAY7+D,KAAK1iB,MAAMmkC,EAAG3P,aAC1B98G,EAAMgrG,KAAK4+D,sBAAsBzvB,GAEjC2vB,EAAwB,eAAb9pK,EAAI8xE,KACfi4F,EAA0B/+D,KAAK8oB,MAAM9zC,MAI3C,GAFAgrB,KAAK+kD,6BAA6B4Z,GAE9B3+D,KAAKswC,gBAAiB,CAGxB,GAFAlT,EAAOyB,KAAO,SAEVggC,EAEF,YADA7+D,KAAK0wC,uBAAuB5S,EAAW0gC,GAAe,GAAO,GAK/D,MAAMzgC,EAAgB/9B,KAAKwwC,uBAAuB+tB,GAClD,IAAIvgC,GAAoB,EACpBD,IACFwgC,EAAa1/B,KAAO,cAGhB/V,EAAMw1C,iBAAmBt+D,KAAKk7B,UAAU,eAC1Cl7B,KAAK0jB,MAAM1uH,EAAIggF,MAAOmwC,EAAO9L,sBAE3B0kB,GAAiB/9B,KAAKk7B,UAAU,eAAiBiU,EAAO0V,UAC1D7kD,KAAK0jB,MAAM1uH,EAAIggF,MAAOmwC,EAAOjI,uBAE/B4L,EAAMw1C,gBAAiB,EACvBtgC,EAAoBlV,EAAMg8B,eAG5B9kD,KAAK69B,gBACHC,EACAygC,GACA,GACA,EACAxgC,EACAC,QAEG,GAAIh+B,KAAKuwC,kBACVsuB,EACF7+D,KAAKg/D,yBAAyBlhC,EAAW4gC,GAEzC1+D,KAAKi/D,kBAAkBnhC,EAAW2gC,QAE/B,IACLK,GACa,UAAb9pK,EAAInC,MACHgiI,GACA70B,KAAKm7C,mBAqCD,IACL2jB,GACc,QAAb9pK,EAAInC,MAA+B,QAAbmC,EAAInC,MAC1BgiI,GACC70B,KAAK1iB,MAAMmkC,EAAGjN,OAASxU,KAAKm7C,mBA2BrBn7C,KAAKm7C,mBAEV0jB,EACF7+D,KAAKg/D,yBAAyBlhC,EAAW4gC,GAEzC1+D,KAAKi/D,kBAAkBnhC,EAAW2gC,GAGpCz+D,KAAK4hC,iBAlCL,CAGAxE,EAAOyB,KAAO7pI,EAAInC,KAElB,MAAMgsK,EAAY7+D,KAAK1iB,MAAMmkC,EAAG3P,aAChC9R,KAAK4+D,sBAAsBL,GAEvBM,EAEF7+D,KAAK0wC,uBAAuB5S,EAAW0gC,GAAe,GAAO,IAEzDx+D,KAAKwwC,uBAAuB+tB,IAC9Bv+D,KAAK0jB,MAAM66C,EAAavpK,IAAIggF,MAAOmwC,EAAOzM,uBAE5C1Y,KAAK69B,gBACHC,EACAygC,GACA,GACA,GACoB,GACpB,IAIJv+D,KAAK8wC,wBAAwBytB,OAlE7B,CAEA,MAAM3mC,EAAc53B,KAAK8hC,IAAIrgB,EAAGjN,MAE5BmqD,EAAa/+B,UACf5/B,KAAK4hC,WAAWm9B,GAGlB3hC,EAAOyB,KAAO,SAEd,MAAMggC,EAAY7+D,KAAK1iB,MAAMmkC,EAAG3P,aAChC9R,KAAK4+D,sBAAsBxhC,GAC3Bp9B,KAAK+kD,6BAA6B4Z,GAE9BE,EAEF7+D,KAAK0wC,uBACH5S,EACA0gC,EACA5mC,GACA,IAGE53B,KAAKwwC,uBAAuB+tB,IAC9Bv+D,KAAK0jB,MAAM66C,EAAavpK,IAAIggF,MAAOmwC,EAAOxM,oBAG5C3Y,KAAK69B,gBACHC,EACAygC,EACA3mC,GACA,GACoB,GACpB,KA+CRgnC,sBAAsBzvB,GACpB,MAAMroE,KAAEA,EAAFpzE,MAAQA,EAARshF,MAAeA,GAAUgrB,KAAK8oB,MAapC,OAXGhiD,IAAS26C,EAAG5uH,MAAQi0E,IAAS26C,EAAG9lB,SACjCwzC,EAAOhG,QACG,cAAVz1I,GAEAssG,KAAK0jB,MAAM1uC,EAAOmwC,EAAO/G,iBAGvBt3C,IAAS26C,EAAG3P,aAAyB,gBAAVp+G,GAC7BssG,KAAK0jB,MAAM1uC,EAAOmwC,EAAO1M,8BAGpBzY,KAAK+wC,kBAAkB5B,GAAmC,GAGnEwV,sBACE7mB,EACAqR,GACA,IAAA+vB,EACAl/D,KAAKwnD,aAAa,mBAAoBrY,EAAOn6D,OAE7CgrB,KAAK6kB,MAAMF,MAAM5B,KAEjB,MAAM8uC,EAAY7xD,KAAK8oB,MAAMkL,OAC7Bh0B,KAAK8oB,MAAMkL,OAAS,GAGpBh0B,KAAKkhD,UAAUv8B,MbrkDE,GaskDjB,MAAM1+C,EAAQkpE,EAAOlpE,KAAO,GAC5B+5B,KAAK8gD,4BAA4B76E,OAAMvwE,GAAW,EAAO+rH,EAAGjP,QAC5DxS,KAAKkhD,UAAUt8B,OACf5kB,KAAK6kB,MAAMD,OACX5kB,KAAK8oB,MAAMkL,OAAS69B,EACpB/zB,EAAU73D,KAAK6E,KAAKk1B,KAAK8+B,WAA0BqQ,EAAQ,gBAC3D,OAAA+vB,EAAI/vB,EAAO2T,aAAPoc,EAAmBj6F,QACrB+6B,KAAK0jB,MAAMyrB,EAAOn6D,MAAOmwC,EAAOjM,sBAIpC+lD,kBAAkBnhC,EAAwBnlD,GAErCA,EAAKiT,UACa,gBAAlBjT,EAAK3jF,IAAInC,MAA6C,gBAAnB8lF,EAAK3jF,IAAItB,OAI7CssG,KAAK0jB,MAAM/qC,EAAK3jF,IAAIggF,MAAOmwC,EAAO3M,uBAGpCslB,EAAU73D,KAAK6E,KAAKk1B,KAAK++B,mBAAmBpmD,IAG9CqmF,yBACElhC,EACAnlD,GAEA,MAAM1R,EAAO+4B,KAAKi/B,0BAA0BtmD,GAC5CmlD,EAAU73D,KAAK6E,KAAK7D,GAEpB+4B,KAAK2pD,WAAWD,mBACd1pD,KAAKq+B,iBAAiBp3D,EAAKjyE,KrB5gDY,EqB8gDvCiyE,EAAKjyE,IAAIggF,OAIb6oD,gBACEC,EACAV,EACAxF,EACAD,EACAoG,EACAC,GAEAF,EAAU73D,KAAK6E,KACbk1B,KAAKi+B,YACHb,EACAxF,EACAD,EACAoG,EACAC,EACA,eACA,IAKN0S,uBACE5S,EACAV,EACAxF,EACAD,GAEA,MAAM1wD,EAAO+4B,KAAKi+B,YAChBb,EACAxF,EACAD,GACoB,GACpB,EACA,sBACA,GAEFmG,EAAU73D,KAAK6E,KAAK7D,GAEpB,MAAM43D,EACU,QAAd53D,EAAK43D,KACD53D,EAAKkiE,OrB9jD8B0gB,EALJ,EqBskDjB,QAAd5iF,EAAK43D,KACL53D,EAAKkiE,OrBjkD8Bg2B,EALJ,EAQI,EqBkkDzCn/D,KAAK2pD,WAAWD,mBACd1pD,KAAKq+B,iBAAiBp3D,EAAKjyE,KAC3B6pI,EACA53D,EAAKjyE,IAAIggF,OAKb+vE,6BAEEC,IAIF/lB,0BACEh4D,GAIA,OAFA+4B,KAAKo/D,iBAAiBn4F,GACtB+4B,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,wBAI/B83D,mBAAmB93D,GAGjB,OAFA+4B,KAAKo/D,iBAAiBn4F,GACtB+4B,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,iBAI/Bm4F,iBAAiBn4F,GACf+4B,KAAK6kB,MAAMF,MAAM5B,IACjB/iB,KAAKoyD,gBAAgBztC,MAAMomC,MAC3B/qD,KAAKkhD,UAAUv8B,Mb7rDE,Ga8rDjB19C,EAAKvzE,MAAQssG,KAAK8hC,IAAIrgB,EAAGlO,IAAMvT,KAAKyiC,0BAA4B,KAChEziC,KAAKoyD,gBAAgBxtC,OACrB5kB,KAAKkhD,UAAUt8B,OACf5kB,KAAK6kB,MAAMD,OAGbmqB,aACE9nE,EACA+nE,EACAC,EACA73C,ErBxpD8B6uC,KqB0pD1BjmC,KAAK1iB,MAAMmkC,EAAG5uH,OAChBo0E,EAAKgd,GAAK+b,KAAK6kC,kBACXmK,GACFhvC,KAAKqwC,UAAUppE,EAAKgd,GAAI,aAAcmT,IAGpC63C,IAAeD,EACjB/nE,EAAKgd,GAAK,KAEV+b,KAAK4hC,WAAW,KAAMzc,EAAOnJ,kBAMnC20B,gBAAgB1pE,GACdA,EAAKy0D,WAAa17B,KAAK8hC,IAAIrgB,EAAGtL,UAAYnW,KAAK+1D,sBAAwB,KAMzE/1B,YAAY/4D,GACV,MAAMo4F,EAAar/D,KAAK2nD,iCAAiC1gF,GACnDq4F,GAAqBD,GAAcr/D,KAAK8hC,IAAIrgB,EAAG75B,OAC/C23E,EAAUD,GAAqBt/D,KAAK4uC,cAAc3nE,GAClD6nE,EACJywB,GAAWv/D,KAAK6uC,mCAAmC5nE,GAC/Cu4F,EACJF,KAAuBxwB,GAAgB9uC,KAAK8hC,IAAIrgB,EAAG75B,QAC/C63E,EAAiBJ,GAAcE,EAErC,GAAIA,IAAYzwB,EAId,OAHIuwB,GAAYr/D,KAAK4hC,aACrB5hC,KAAK2uC,gBAAgB1nE,GAAM,GAEpB+4B,KAAK8+B,WAAW73D,EAAM,wBAG/B,MAAMy4F,EAAgB1/D,KAAK2/D,gCAAgC14F,GAE3D,GACGo4F,GAAcC,IAAsBC,IAAYG,GAChD5wB,GAAgB0wB,IAAwBE,EAEzC,MAAM1/D,KAAK4hC,WAAW,KAAMngB,EAAGpP,QAGjC,IAAIutD,EAQJ,GAPIH,GAAkBC,GACpBE,GAAiB,EACjB5/D,KAAK2uC,gBAAgB1nE,EAAMw4F,IAE3BG,EAAiB5/D,KAAK6/D,4BAA4B54F,GAGhDw4F,GAAkBC,GAAiBE,EAErC,OADA5/D,KAAK4nD,YAAY3gF,GAAM,GAAM,IAASA,EAAK8N,QACpCirB,KAAK8+B,WAAW73D,EAAM,0BAG/B,GAAI+4B,KAAK8hC,IAAIrgB,EAAGzM,UAKd,OAHA/tC,EAAKq/D,YAActmC,KAAK4sC,+BACxB5sC,KAAK4nD,YAAY3gF,GAAM,GAAM,GAEtB+4B,KAAK8+B,WAAW73D,EAAM,4BAG/B,MAAM+4B,KAAK4hC,WAAW,KAAMngB,EAAGpP,QAIjCu8B,cAAc3nE,GACZ,OAAO+4B,KAAK8hC,IAAIrgB,EAAGjN,MAGrBmzC,iCAAiC1gF,GAC/B,GAAI+4B,KAAK2sC,2BAA4B,CAEnC3sC,KAAKwnD,aAAa,qBAClB,MAAMlW,EAAYtxC,KAAK4+B,YAGvB,OAFA0S,EAAUrR,SAAWjgC,KAAK6kC,iBAAgB,GAC1C59D,EAAKi5D,WAAa,CAAClgC,KAAK8+B,WAAWwS,EAAW,4BACvC,EAET,OAAO,EAGTzC,mCAAmC5nE,GACjC,GAAI+4B,KAAK2lC,aAAa,MAAO,CACtB1+D,EAAKi5D,aAAYj5D,EAAKi5D,WAAa,IAExC,MAAMoR,EAAYtxC,KAAK48B,YACrB58B,KAAK8oB,MAAM2L,aACXz0B,KAAK8oB,MAAM0L,iBASb,OANAx0B,KAAK5iB,OAELk0D,EAAUrR,SAAWjgC,KAAK6xC,wBAC1B5qE,EAAKi5D,WAAWp1D,KACdk1B,KAAK8+B,WAAWwS,EAAW,8BAEtB,EAET,OAAO,EAGTquB,gCAAgC14F,GAC9B,QAAI+4B,KAAK1iB,MAAMmkC,EAAGpP,UACXprC,EAAKi5D,aAAYj5D,EAAKi5D,WAAa,IACxCj5D,EAAKi5D,WAAWp1D,QAAQk1B,KAAK0uC,yBAE7BznE,EAAK8N,OAAS,KACd9N,EAAKq/D,YAAc,MAEZ,GAKXu5B,4BAA4B54F,GAC1B,QAAI+4B,KAAK0sC,iCACPzlE,EAAKi5D,WAAa,GAClBj5D,EAAK8N,OAAS,KACd9N,EAAKq/D,YAActmC,KAAKwuC,uBAAuBvnE,IACxC,GAKX80F,kBACE,IAAK/7D,KAAK2lC,aAAa,SAAU,OAAO,EACxC,MAAMvoD,EAAO4iB,KAAKu3C,iBAClB,OACGzgC,EAAUrxC,KAAKu6B,KAAKhR,MAAM5pB,MAAM46B,KAAK8oB,MAAMlxC,IAAKwF,KACjD4iB,KAAKynD,qBAAqBrqE,EAAM,YAIpCwvD,+BACE,MAAMH,EAAOzsC,KAAK4+B,YAEZjH,EAAU33B,KAAK+7D,kBAErB,GAAI/7D,KAAK1iB,MAAMmkC,EAAGpM,YAAcsiB,EAM9B,OALA33B,KAAK5iB,OACDu6C,GACF33B,KAAK5iB,OAGA4iB,KAAK+2D,cACVtqB,EACAqzB,EACAnoC,GAEG,GAAI33B,KAAK1iB,MAAMmkC,EAAGvL,QACvB,OAAOlW,KAAKiiD,WAAWxV,GAAM,GAAM,GAC9B,GAAIzsC,KAAK1iB,MAAMmkC,EAAGrZ,IAQvB,OANEpI,KAAKk7B,UAAU,eACfl7B,KAAKo7B,gBAAgB,aAAc,2BAEnCp7B,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOrM,uBAEtC9Y,KAAKm3D,iBAAgB,GACdn3D,KAAKiiD,WAAWxV,GAAM,GAAM,GAC9B,GAAIzsC,KAAK1iB,MAAMmkC,EAAG7L,SAAW5V,KAAK1iB,MAAMmkC,EAAG9L,OAAS3V,KAAKwmC,QAC9D,MAAMxmC,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAOjF,0BACrC,CACL,MAAMn0C,EAAMi0B,KAAKyiC,0BAEjB,OADAziC,KAAKolC,YACEr5D,GAKXyiE,uBAAuBvnE,GACrB,OAAO+4B,KAAKqsC,eAAe,MAG7BM,2BACE,GAAI3sC,KAAK1iB,MAAMmkC,EAAG5uH,MAAO,CACvB,MAAMa,EAAQssG,KAAK8oB,MAAMp1H,MACzB,GAAe,UAAVA,IAAsBssG,KAAK8oB,MAAM+L,aAA0B,QAAVnhI,EACpD,OAAO,EAET,IACa,SAAVA,GAA8B,cAAVA,KACpBssG,KAAK8oB,MAAM+L,YACZ,CACA,MAAM9rC,EAAIiX,KAAKopC,YAKf,GACGrgD,EAAEjiB,OAAS26C,EAAG5uH,MAAoB,SAAZk2F,EAAEr1F,OACzBq1F,EAAEjiB,OAAS26C,EAAGpP,OAGd,OADArS,KAAKuxD,gBAAgB,CAAC,OAAQ,gBACvB,QAGN,IAAKvxD,KAAK1iB,MAAMmkC,EAAGzM,UACxB,OAAO,EAGT,MAAM53B,EAAO4iB,KAAKu3C,iBACZwoB,EAAU//D,KAAKynD,qBAAqBrqE,EAAM,QAChD,GACE,KAAA4iB,KAAKhR,MAAM/W,WAAWmF,IACrB4iB,KAAK1iB,MAAMmkC,EAAG5uH,OAASktK,EAExB,OAAO,EAGT,GAAI//D,KAAK1iB,MAAMmkC,EAAGzM,WAAa+qD,EAAS,CACtC,MAAMC,EAAgBhgE,KAAKhR,MAAM/W,WAC/B+nB,KAAK0nD,oBAAoBtqE,EAAO,IAElC,OACe,KAAb4iF,GACa,KAAbA,EAGJ,OAAO,EAGTrxB,gBAAgB1nE,EAAgCs7D,GAC9C,GAAIviC,KAAKwlC,cAAc,QAAS,CAC9Bv+D,EAAK8N,OAASirB,KAAK+nD,oBACnB/nD,KAAK4nD,YAAY3gF,GACjB,MAAMg5F,EAAajgE,KAAKkgE,6BACpBD,IACFh5F,EAAKg5F,WAAaA,QAGhB19B,EACFviC,KAAK4hC,aAEL36D,EAAK8N,OAAS,KAIlBirB,KAAKolC,YAGPsH,+BACE,GAAI1sC,KAAK1iB,MAAMmkC,EAAGrZ,MAChBpI,KAAKuxD,gBAAgB,CAAC,aAAc,sBAChCvxD,KAAKk7B,UAAU,eAAe,CAChC,IAAIl7B,KAAKo7B,gBAAgB,aAAc,0BAGrC,OAAO,EAFPp7B,KAAK4hC,WAAW5hC,KAAK8oB,MAAM9zC,MAAOmwC,EAAOrM,uBAO/C,MAC8B,QAA5B9Y,KAAK8oB,MAAMhiD,KAAKmqC,SACY,UAA5BjR,KAAK8oB,MAAMhiD,KAAKmqC,SACY,aAA5BjR,KAAK8oB,MAAMhiD,KAAKmqC,SACY,UAA5BjR,KAAK8oB,MAAMhiD,KAAKmqC,SAChBjR,KAAKwmC,SACLxmC,KAAK+7D,kBAITnU,YACE3gF,EACAk5F,EACAC,EACAC,GAEA,GAAIF,EAEF,GAAIC,GAGF,GADApgE,KAAKkkD,sBAAsBj9E,EAAM,WAC7B+4B,KAAKk7B,UAAU,qBAAsB,CAAA,IAAAolC,EACvC,MAAMh6B,EAAgBr/D,EACnBq/D,YAEoB,eAArBA,EAAYx/D,MACS,SAArBw/D,EAAYzzI,MACZyzI,EAAYthE,IAAMshE,EAAYtxD,OAAU,GACxC,OAAAsrF,EAACh6B,EAAYzJ,QAAZyjC,EAAmB/iC,eAEpBv9B,KAAK0jB,MAAM4iB,EAAYtxD,MAAOmwC,EAAOtL,qCAGpC,GAAI5yC,EAAKi5D,YAAcj5D,EAAKi5D,WAAWj7D,OAE5C,IAAK,MAAMqsE,KAAarqE,EAAKi5D,WAAY,CACvC,MAAMD,SAAEA,GAAaqR,EACfivB,EACc,eAAlBtgC,EAASn5D,KAAwBm5D,EAASptI,KAAOotI,EAASvsI,MAG5D,GAFAssG,KAAKkkD,sBAAsB5S,EAAWivB,IAEjCF,GAAU/uB,EAAUE,MAAO,CAC9B,MAAMA,MAAEA,GAAUF,EACC,eAAfE,EAAM1qE,KACRk5B,KAAK0jB,MACH4tB,EAAUt8D,MACVmwC,EAAOvL,sBACP43B,EAAM99I,MACN6sK,IAIFvgE,KAAKqyC,kBAAkBb,EAAM3+I,KAAM2+I,EAAMx8D,OAAO,GAAM,GAEtDgrB,KAAK6kB,MAAMO,iBAAiBosB,UAI7B,GAAIvqE,EAAKq/D,YAEd,GAC4B,wBAA1Br/D,EAAKq/D,YAAYx/D,MACS,qBAA1BG,EAAKq/D,YAAYx/D,KACjB,CACA,MAAMmd,EAAKhd,EAAKq/D,YAAYriD,GAC5B,IAAKA,EAAI,MAAM,IAAI6U,MAAM,qBAEzBkH,KAAKkkD,sBAAsBj9E,EAAMgd,EAAGpxF,WAC/B,GAA8B,wBAA1Bo0E,EAAKq/D,YAAYx/D,KAC1B,IAAK,MAAMw/D,KAAer/D,EAAKq/D,YAAYs2B,aACzC58D,KAAKi9B,iBAAiBqJ,EAAYriD,IAU1C,GAHE+b,KAAK8oB,MAAMmL,eAAej0B,KAAK8oB,MAAMmL,eAAehvD,OAAS,GAGlCA,OAC3B,MAAM+6B,KAAK0jB,MAAMz8C,EAAK+N,MAAOmwC,EAAOlF,4BAIxCgd,iBAAiBh2D,GACf,GAAkB,eAAdA,EAAKH,KACPk5B,KAAKkkD,sBAAsBj9E,EAAMA,EAAKp0E,WACjC,GAAkB,kBAAdo0E,EAAKH,KACd,IAAK,MAAM6R,KAAQ1R,EAAKgP,WACtB+pB,KAAKi9B,iBAAiBtkD,QAEnB,GAAkB,iBAAd1R,EAAKH,KACd,IAAK,MAAM6sF,KAAQ1sF,EAAK8O,SAClB49E,GACF3zD,KAAKi9B,iBAAiB02B,OAGH,mBAAd1sF,EAAKH,KACdk5B,KAAKi9B,iBAAiBh2D,EAAKvzE,OACJ,gBAAduzE,EAAKH,KACdk5B,KAAKi9B,iBAAiBh2D,EAAKijB,UACJ,sBAAdjjB,EAAKH,MACdk5B,KAAKi9B,iBAAiBh2D,EAAKiiB,MAI/Bg7D,sBACEj9E,EAMAp0E,GAEImtG,KAAK+xD,oBAAoBhzE,IAAIlsF,IAC/BmtG,KAAK0jB,MACHz8C,EAAK+N,MACI,YAATniF,EACIsyH,EAAO7L,uBACP6L,EAAO5L,gBACX1mH,GAGJmtG,KAAK+xD,oBAAoB/yE,IAAInsF,GAK/B67I,wBACE,MAAM1yD,EAAQ,GACd,IAAInD,GAAQ,EAKZ,IAFAmnB,KAAKuiC,OAAO9gB,EAAGpP,SAEPrS,KAAK8hC,IAAIrgB,EAAGjP,SAAS,CAC3B,GAAI35B,EACFA,GAAQ,OAGR,GADAmnB,KAAKuiC,OAAO9gB,EAAG75B,OACXoY,KAAK8hC,IAAIrgB,EAAGjP,QAAS,MAG3B,MAAMvrC,EAAO+4B,KAAK4+B,YAClB33D,EAAKuqE,MAAQxxC,KAAK6xC,wBAClB5qE,EAAKg5D,SAAWjgC,KAAKwlC,cAAc,MAC/BxlC,KAAK6xC,wBACL5qE,EAAKuqE,MAAMU,UACfl2D,EAAMlR,KAAKk1B,KAAK8+B,WAAW73D,EAAM,oBAGnC,OAAO+U,EAIT61D,wBACE,GAAI7xC,KAAK1iB,MAAMmkC,EAAG9lB,QAAS,CACzB,MAAM/wB,EAASo1B,KAAKo8B,mBAAmBp8B,KAAK8oB,MAAMp1H,OAC5C8sK,EAAY51F,EAAOl3E,MAAM4pF,MAAMkuE,IAQrC,OAPIgV,GACFxgE,KAAK0jB,MACH94C,EAAOoK,MACPmwC,EAAO3I,iCACPgkD,EAAU,GAAGvoF,WAAW,GAAGmmB,SAAS,KAGjCxzB,EAET,OAAOo1B,KAAK6kC,iBAAgB,GAM9BsB,YAAYl/D,GAGV,GADAA,EAAKi5D,WAAa,IACblgC,KAAK1iB,MAAMmkC,EAAG9lB,QAAS,CAG1B,MAOM8kE,GAPazgE,KAAKyxC,iCAAiCxqE,IAOxB+4B,KAAK8hC,IAAIrgB,EAAG75B,OAGvC23E,EAAUkB,GAAazgE,KAAK6nD,8BAA8B5gF,GAG5Dw5F,IAAclB,GAASv/D,KAAK8nD,2BAA2B7gF,GAC3D+4B,KAAKukC,iBAAiB,QAExBt9D,EAAK8N,OAASirB,KAAK+nD,oBAInB,MAAMkY,EAAajgE,KAAKkgE,6BACxB,GAAID,EACFh5F,EAAKg5F,WAAaA,MACsB,CACxC,MAAMngC,EAAa9/B,KAAK0gE,6BACpB5gC,IACF74D,EAAK64D,WAAaA,GAKtB,OADA9/B,KAAKolC,YACEplC,KAAK8+B,WAAW73D,EAAM,qBAG/B8gF,oBAEE,OADK/nD,KAAK1iB,MAAMmkC,EAAG9lB,SAASqE,KAAK4hC,aAC1B5hC,KAAKmiC,gBAIdiP,yBAAyBnqE,GACvB,OAAO+4B,KAAK1iB,MAAMmkC,EAAG5uH,MAGvBw+I,0BACEpqE,EACAqqE,EACAxqE,EACAyqE,GAEAD,EAAUE,MAAQxxC,KAAK6kC,kBACvB7kC,KAAKqwC,UAAUiB,EAAUE,MAAOD,ErBvoEFtL,GqBwoE9Bh/D,EAAKi5D,WAAWp1D,KAAKk1B,KAAK8+B,WAAWwS,EAAWxqE,IAUlD65F,qBACE,MAAMC,EAAQ,GACRC,EAAY,IAAIliF,IAEtB,EAAG,CACD,GAAIqhB,KAAK1iB,MAAMmkC,EAAGjP,QAChB,MAGF,MAAMvrC,EAAO+4B,KAAK4+B,YAGZu6B,EAAUn5D,KAAK8oB,MAAMp1H,MAmB3B,GAfImtK,EAAU9hF,IAAIo6E,IAChBn5D,KAAK0jB,MACH1jB,KAAK8oB,MAAM9zC,MACXmwC,EAAO5I,kCACP48C,GAGJ0H,EAAU7hF,IAAIm6E,GACVn5D,KAAK1iB,MAAMmkC,EAAG9lB,QAChB10B,EAAKjyE,IAAMgrG,KAAKo8B,mBAAmB+8B,GAEnClyF,EAAKjyE,IAAMgrG,KAAK6kC,iBAAgB,GAElC7kC,KAAKuiC,OAAO9gB,EAAG7O,QAEV5S,KAAK1iB,MAAMmkC,EAAG9lB,QACjB,MAAMqE,KAAK4hC,WACT5hC,KAAK8oB,MAAM9zC,MACXmwC,EAAO7I,6BAGXr1C,EAAKvzE,MAAQssG,KAAKo8B,mBAAmBp8B,KAAK8oB,MAAMp1H,OAChDssG,KAAK8+B,WAA8B73D,EAAM,mBACzC25F,EAAM91F,KAAK7D,SACJ+4B,KAAK8hC,IAAIrgB,EAAG75B,QAErB,OAAOg5E,EASTF,6BACE,IAAI1gE,KAAK1iB,MAAMmkC,EAAG3L,QAAW9V,KAAK63C,wBAIhC,OAAI73C,KAAKk7B,UAAU,oBAA4B,GACxC,KAJPl7B,KAAKwnD,aAAa,oBAClBxnD,KAAK5iB,OAKP,MAAMwjF,EAAQ,GACR9gC,EAAa,IAAInhD,IACvB,EAAG,CACD,MAAM1X,EAAO+4B,KAAK4+B,YAoBlB,GAnBA33D,EAAKjyE,IAAMgrG,KAAK6kC,iBAAgB,GAEV,SAAlB59D,EAAKjyE,IAAInC,MACXmtG,KAAK0jB,MACHz8C,EAAKjyE,IAAIggF,MACTmwC,EAAO9I,iCACPp1C,EAAKjyE,IAAInC,MAITitI,EAAW/gD,IAAI9X,EAAKjyE,IAAInC,OAC1BmtG,KAAK0jB,MACHz8C,EAAKjyE,IAAIggF,MACTmwC,EAAO5I,kCACPt1C,EAAKjyE,IAAInC,MAGbitI,EAAW9gD,IAAI/X,EAAKjyE,IAAInC,MACxBmtG,KAAKuiC,OAAO9gB,EAAG7O,QACV5S,KAAK1iB,MAAMmkC,EAAG9lB,QACjB,MAAMqE,KAAK4hC,WACT5hC,KAAK8oB,MAAM9zC,MACXmwC,EAAO7I,6BAGXr1C,EAAKvzE,MAAQssG,KAAKo8B,mBAAmBp8B,KAAK8oB,MAAMp1H,OAChDssG,KAAK8+B,WAAW73D,EAAM,mBACtB25F,EAAM91F,KAAK7D,SACJ+4B,KAAK8hC,IAAIrgB,EAAG75B,QAErB,OAAOg5E,EAGTV,6BAEE,IAAIlgE,KAAK2lC,aAAa,WAAc3lC,KAAK63C,wBAIvC,OAAI73C,KAAKk7B,UAAU,oBAA4B,GACxC,KAJPl7B,KAAKwnD,aAAa,oBAClBxnD,KAAK5iB,OAMP4iB,KAAK8hC,IAAIrgB,EAAGpP,QACZ,MAAMuuD,EAAQ5gE,KAAK2gE,qBAGnB,OAFA3gE,KAAK8hC,IAAIrgB,EAAGjP,QAELouD,EAGTnvB,iCAAiCxqE,GAC/B,QAAI+4B,KAAKoxC,yBAAyBnqE,KAEhC+4B,KAAKqxC,0BACHpqE,EACA+4B,KAAK4+B,YACL,yBACA,6BAEK,GAKXipB,8BAA8B5gF,GAC5B,GAAI+4B,KAAK1iB,MAAMmkC,EAAGjN,MAAO,CACvB,MAAM88B,EAAYtxC,KAAK4+B,YAUvB,OATA5+B,KAAK5iB,OACL4iB,KAAKukC,iBAAiB,MAEtBvkC,KAAKqxC,0BACHpqE,EACAqqE,EACA,2BACA,+BAEK,EAET,OAAO,EAGTwW,2BAA2B7gF,GACzB,IAAI4R,GAAQ,EAEZ,IADAmnB,KAAKuiC,OAAO9gB,EAAGpP,SACPrS,KAAK8hC,IAAIrgB,EAAGjP,SAAS,CAC3B,GAAI35B,EACFA,GAAQ,MACH,CAEL,GAAImnB,KAAK8hC,IAAIrgB,EAAG7O,OACd,MAAM5S,KAAK0jB,MAAM1jB,KAAK8oB,MAAM9zC,MAAOmwC,EAAO/L,wBAI5C,GADApZ,KAAKuiC,OAAO9gB,EAAG75B,OACXoY,KAAK8hC,IAAIrgB,EAAGjP,QAAS,MAG3BxS,KAAK0xC,qBAAqBzqE,IAK9ByqE,qBAAqBzqE,GACnB,MAAMqqE,EAAYtxC,KAAK4+B,YACjBkiC,EAAmB9gE,KAAK1iB,MAAMmkC,EAAG9lB,QAEvC,GADA21C,EAAUW,SAAWjyC,KAAK6xC,wBACtB7xC,KAAKwlC,cAAc,MACrB8L,EAAUE,MAAQxxC,KAAK6kC,sBAClB,CACL,MAAMoN,SAAEA,GAAaX,EACrB,GAAIwvB,EACF,MAAM9gE,KAAK0jB,MACT4tB,EAAUt8D,MACVmwC,EAAO9K,sBACP43B,EAASv+I,OAGbssG,KAAKqyC,kBAAkBJ,EAASp/I,KAAMy+I,EAAUt8D,OAAO,GAAM,GAC7Ds8D,EAAUE,MAAQS,EAASC,UAE7BlyC,KAAKqwC,UAAUiB,EAAUE,MAAO,mBrBz0EFvL,GqB00E9Bh/D,EAAKi5D,WAAWp1D,KAAKk1B,KAAK8+B,WAAWwS,EAAW,oBAKlDb,YACE5E,GAEA,MAAsB,eAAfA,EAAM/kE,MAAwC,SAAf+kE,EAAMh5I,OCj3E9C85G,YAAYh4G,EAAmBq6F,GAE7Bu2B,MADA5wH,ERoDG,SAAoBosK,GACzB,MAAMpsK,EAAe,GACrB,IAAK,MAAMK,KAAOxB,OAAOW,KAAK8zJ,IAC5BtzJ,EAAQK,GAAO+rK,GAAqB,MAAbA,EAAK/rK,GAAe+rK,EAAK/rK,GAAOizJ,GAAejzJ,GAExE,OAAOL,EQzDKqsK,CAAWrsK,GACNq6F,GAEfgR,KAAKrrG,QAAUA,EACfqrG,KAAK4xD,mBACL5xD,KAAK7U,QAqBT,SAAoBA,GAClB,MAAM81E,EAAwB,IAAIj+E,IAClC,IAAK,MAAMm4C,KAAUhwC,EAAS,CAC5B,MAAOt4F,EAAM8B,GAAWkpG,MAAM/gB,QAAQq+C,GAAUA,EAAS,CAACA,EAAQ,IAC7D8lC,EAAUliF,IAAIlsF,IAAOouK,EAAUx/E,IAAI5uF,EAAM8B,GAAW,IAE3D,OAAOssK,EA3BUC,CAAWlhE,KAAKrrG,QAAQw2F,SACvC6U,KAAK9d,SAAWvtF,EAAQuzJ,eAI1BtkB,kBACE,OAAOngB,EAGTx0C,QACE+wB,KAAKqyD,qBACL,MAAMvxD,EAAOd,KAAK4+B,YACZvzC,EAAU2U,KAAK4+B,YAKrB,OAJA5+B,KAAKy0C,YACL3zC,EAAKiyB,OAAS,KACd/yB,KAAK20C,cAAc7zC,EAAMzV,GACzByV,EAAKiyB,OAAS/yB,KAAK8oB,MAAMiK,OAClBjyB,GG6BX,SAASqgE,GAAUxsK,EAAmBq6F,GACpC,IAAIs1D,EAAMoH,GAMV,OALA,MAAI/2J,GAAAA,EAASw2F,Wd9BR,SAAyBA,GAC9B,GAAI+vC,GAAU/vC,EAAS,cAAe,CACpC,GAAI+vC,GAAU/vC,EAAS,qBACrB,MAAM,IAAI2N,MACR,mEAIJ,MAAMsoE,EAAyBhmC,GAC7BjwC,EACA,aACA,0BAEF,GAA8B,MAA1Bi2E,EACF,MAAM,IAAItoE,MACR,mQAKG,GAAsC,kBAA3BsoE,EAChB,MAAM,IAAItoE,MAAM,+CAIpB,GAAIoiC,GAAU/vC,EAAS,SAAW+vC,GAAU/vC,EAAS,cACnD,MAAM,IAAI2N,MAAM,+CAGlB,GAAIoiC,GAAU/vC,EAAS,iBAAmB+vC,GAAU/vC,EAAS,eAC3D,MAAM,IAAI2N,MAAM,wDAGlB,GACEoiC,GAAU/vC,EAAS,sBAClBmwC,GAAmB7sD,SAClB2sD,GAAgBjwC,EAAS,mBAAoB,aAG/C,MAAM,IAAI2N,MACR,+EACEwiC,GAAmBlxD,KAAIlD,GAAM,IAAGA,OAAMoD,KAAK,OAIjD,GAAI4wD,GAAU/vC,EAAS,oBAKd,CACL,GAAI+vC,GAAU/vC,EAAS,oBACrB,MAAM,IAAI2N,MACR,iEAQJ,GAA2C,aALAsiC,GACzCjwC,EACA,mBACA,WAGA,MAAM,IAAI2N,MACR,wJAQR,GACEoiC,GAAU/vC,EAAS,oBAClBowC,GAA8B9sD,SAC7B2sD,GAAgBjwC,EAAS,iBAAkB,eAG7C,MAAM,IAAI2N,MACR,+EACEyiC,GAA8BnxD,KAAIlD,GAAM,IAAGA,OAAMoD,KAAK,OAI5D,GACE4wD,GAAU/vC,EAAS,wBAClB+vC,GAAU/vC,EAAS,iBACpB,CACA,MAAM5b,EAAQ,IAAIupB,MAChB,gGAIF,MADAvpB,EAAM8xF,eAAiB,gBACjB9xF,Gc7DN+xF,CAAgB3sK,EAAQw2F,SACxBm5D,EASJ,SAAwBid,GACtB,MAAMC,EAAaxZ,GAAiBj6E,QAAOl7E,GACzCqoI,GAAUqmC,EAAoB1uK,KAG1BmC,EAAMwsK,EAAWl3F,KAAK,KAC5B,IAAIg6E,EAAMmd,GAAiBzsK,GAC3B,IAAKsvJ,EAAK,CACRA,EAAMoH,GACN,IAAK,MAAMvwB,KAAUqmC,EACnBld,EAAM9oB,GAAaL,GAAQmpB,GAE7Bmd,GAAiBzsK,GAAOsvJ,EAE1B,OAAOA,EAvBCod,CAAe/sK,EAAQw2F,UAGxB,IAAIm5D,EAAI3vJ,EAASq6F,GAG1B,MAAMyyE,GAAqD,WAhEpD,SAAezyE,EAAer6F,GAAyB,IAAAgtK,EAC5D,GAA4B,iBAAjB,OAAPA,EAAAhtK,QAAA,EAAAgtK,EAASzsC,YAuCX,OAAOisC,GAAUxsK,EAASq6F,GAAO/f,QAtCjCt6E,EAAOnB,OAAAiqG,OAAA,GACF9oG,GAEL,IACEA,EAAQugI,WAAa,SACrB,MAAM9lD,EAAS+xF,GAAUxsK,EAASq6F,GAC5BhK,EAAM5V,EAAOH,QAEnB,GAAIG,EAAOu8E,kBACT,OAAO3mE,EAGT,GAAI5V,EAAOw8E,4BAMT,IAEE,OADAj3J,EAAQugI,WAAa,SACdisC,GAAUxsK,EAASq6F,GAAO/f,QACjC,MAAAgtD,SAIFj3C,EAAIqG,QAAQ6pC,WAAa,SAG3B,OAAOlwC,EACP,MAAO48E,GACP,IAEE,OADAjtK,EAAQugI,WAAa,SACdisC,GAAUxsK,EAASq6F,GAAO/f,QACjC,MAAA4yF,IAEF,MAAMD,sBAOL,SAAyB5yE,EAAer6F,GAC7C,MAAMy6E,EAAS+xF,GAAUxsK,EAASq6F,GAIlC,OAHI5f,EAAOz6E,QAAQsgI,aACjB7lD,EAAO05C,MAAM6J,QAAS,GAEjBvjD,EAAOo3E,sEClELhnD,EAAQsiE,GACC,iBAAZxuK,QAA0C,IAAXD,EAAyByuK,EAAQxuK,GAE7CwuK,GAAzBtiE,EAASA,GAAUF,MAAqBjwB,aAAAA,KACxC2wB,MAAO,SAAU1sG,GAAW,aAW7B,MAAAyuK,EACCp1D,cAEC3M,KAAKgiE,aAAc,EAGnBhiE,KAAKiiE,eAAgB,EAGrBjiE,KAAK30B,YAAc,KAGnB20B,KAAKx2B,QAAAA,CACJ04F,KAAM,IAAOliE,KAAKgiE,aAAc,EAChCtkE,OAAQ,IAAOsC,KAAKiiE,eAAgB,EACpC/oF,QAAUjS,GAAU+4B,KAAK30B,YAAcpE,GAWzCiS,QAAQzS,EAAQkS,EAAMpT,EAAO0B,GACxBR,IACW,OAAVlB,EACHkB,EAAOkS,GAAMpT,GAAS0B,EAEtBR,EAAOkS,GAAQ1R,GAWlBy2B,OAAOj3B,EAAQkS,EAAMpT,GAChBkB,IACW,OAAVlB,EACHkB,EAAOkS,GAAMlO,OAAOlF,EAAO,UAEpBkB,EAAOkS,KAmBlB,MAAAwpF,UAAyBJ,EAMxBp1D,YAAYgY,EAAOy9C,GAClB78C,QAGAvlB,KAAK2kB,MAAQA,EAGb3kB,KAAKoiE,MAAQA,EAWdC,MAAMp7F,EAAMR,EAAQkS,EAAMpT,MACrB0B,EAAAA,IACC+4B,KAAK2kB,MAAAA,OACF29C,EAAetiE,KAAKgiE,YACpBO,EAAiBviE,KAAKiiE,cACtBO,EAAexiE,KAAK30B,YAC1B20B,KAAKgiE,aAAc,EACnBhiE,KAAKiiE,eAAgB,EACrBjiE,KAAK30B,YAAc,KAEnB20B,KAAK2kB,MAAM/mB,KAAKoC,KAAKx2B,QAASvC,EAAMR,EAAQkS,EAAMpT,GAE9Cy6B,KAAK30B,cACRpE,EAAO+4B,KAAK30B,YACZ20B,KAAK9mB,QAAQzS,EAAQkS,EAAMpT,EAAO0B,IAG/B+4B,KAAKiiE,eACRjiE,KAAKtC,OAAOj3B,EAAQkS,EAAMpT,SAGrBk9F,EAAUziE,KAAKgiE,YACfU,EAAU1iE,KAAKiiE,iBAErBjiE,KAAKgiE,YAAcM,EACnBtiE,KAAKiiE,cAAgBM,EACrBviE,KAAK30B,YAAcm3F,EAEfC,EAAAA,OAAgBx7F,KAChBy7F,EAAAA,OAAgB,eAGV1tK,KAAOiyE,EAAAA,OACXvzE,EAAQuzE,EAAKjyE,MAEE,iBAAVtB,KAEAmqG,MAAM/gB,QAAQppF,WACfyzE,EAAI,EAAGA,EAAIzzE,EAAMuxE,OAAQkC,GAAK,EACrB,OAAbzzE,EAAMyzE,IAAwC,iBAAlBzzE,EAAMyzE,GAAGL,OACnCk5B,KAAKqiE,MAAM3uK,EAAMyzE,GAAIF,EAAMjyE,EAAKmyE,IAEpCA,UAIiB,OAAVzzE,GAAwC,iBAAfA,EAAMozE,MACzCk5B,KAAKqiE,MAAM3uK,EAAOuzE,EAAMjyE,EAAK,SAI3BgrG,KAAKoiE,MAAAA,OACFI,EAAexiE,KAAK30B,YACpBk3F,EAAiBviE,KAAKiiE,cAC5BjiE,KAAK30B,YAAc,KACnB20B,KAAKiiE,eAAgB,EAErBjiE,KAAKoiE,MAAMxkE,KAAKoC,KAAKx2B,QAASvC,EAAMR,EAAQkS,EAAMpT,GAE9Cy6B,KAAK30B,cACRpE,EAAO+4B,KAAK30B,YACZ20B,KAAK9mB,QAAQzS,EAAQkS,EAAMpT,EAAO0B,IAG/B+4B,KAAKiiE,eACRjiE,KAAKtC,OAAOj3B,EAAQkS,EAAMpT,SAGrBm9F,EAAU1iE,KAAKiiE,iBAErBjiE,KAAK30B,YAAcm3F,EACnBxiE,KAAKiiE,cAAgBM,EAEjBG,EAAAA,OAAgB,aAIfz7F,GAiBT,MAAA07F,UAA0BZ,EAMzBp1D,YAAYgY,EAAOy9C,GAClB78C,QAGAvlB,KAAK2kB,MAAQA,EAGb3kB,KAAKoiE,MAAQA,cAWFn7F,EAAMR,EAAQkS,EAAMpT,MAC3B0B,EAAAA,IACC+4B,KAAK2kB,MAAAA,OACF29C,EAAetiE,KAAKgiE,YACpBO,EAAiBviE,KAAKiiE,cACtBO,EAAexiE,KAAK30B,YAC1B20B,KAAKgiE,aAAc,EACnBhiE,KAAKiiE,eAAgB,EACrBjiE,KAAK30B,YAAc,WAEb20B,KAAK2kB,MAAM/mB,KAAKoC,KAAKx2B,QAASvC,EAAMR,EAAQkS,EAAMpT,GAEpDy6B,KAAK30B,cACRpE,EAAO+4B,KAAK30B,YACZ20B,KAAK9mB,QAAQzS,EAAQkS,EAAMpT,EAAO0B,IAG/B+4B,KAAKiiE,eACRjiE,KAAKtC,OAAOj3B,EAAQkS,EAAMpT,SAGrBk9F,EAAUziE,KAAKgiE,YACfU,EAAU1iE,KAAKiiE,iBAErBjiE,KAAKgiE,YAAcM,EACnBtiE,KAAKiiE,cAAgBM,EACrBviE,KAAK30B,YAAcm3F,EAEfC,EAAAA,OAAgBx7F,KAChBy7F,EAAAA,OAAgB,eAGV1tK,KAAOiyE,EAAAA,OACXvzE,EAAQuzE,EAAKjyE,MAEE,iBAAVtB,KAEAmqG,MAAM/gB,QAAQppF,WACfyzE,EAAI,EAAGA,EAAIzzE,EAAMuxE,OAAQkC,GAAK,EACrB,OAAbzzE,EAAMyzE,IAAwC,iBAAlBzzE,EAAMyzE,GAAGL,aAC5Bk5B,KAAKqiE,MAAM3uK,EAAMyzE,GAAIF,EAAMjyE,EAAKmyE,IAE3CA,UAIiB,OAAVzzE,GAAwC,iBAAfA,EAAMozE,YACnCk5B,KAAKqiE,MAAM3uK,EAAOuzE,EAAMjyE,EAAK,SAIjCgrG,KAAKoiE,MAAAA,OACFI,EAAexiE,KAAK30B,YACpBk3F,EAAiBviE,KAAKiiE,cAC5BjiE,KAAK30B,YAAc,KACnB20B,KAAKiiE,eAAgB,QAEfjiE,KAAKoiE,MAAMxkE,KAAKoC,KAAKx2B,QAASvC,EAAMR,EAAQkS,EAAMpT,GAEpDy6B,KAAK30B,cACRpE,EAAO+4B,KAAK30B,YACZ20B,KAAK9mB,QAAQzS,EAAQkS,EAAMpT,EAAO0B,IAG/B+4B,KAAKiiE,eACRjiE,KAAKtC,OAAOj3B,EAAQkS,EAAMpT,SAGrBm9F,EAAU1iE,KAAKiiE,iBAErBjiE,KAAK30B,YAAcm3F,EACnBxiE,KAAKiiE,cAAgBM,EAEjBG,EAAAA,OAAgB,aAIfz7F,GAsCT3zE,EAAQsvK,UALRtvB,eAAyBtuD,GAAAA,MAAO2/B,EAAAA,MAAOy9C,UAChCS,EAAAA,IAAeF,EAAYh+C,EAAOy9C,gBAC3BS,EAASR,MAAMr9E,EAAK,OAIlC1xF,EAAQs4E,KApBR,SAAcoZ,GAAAA,MAAO2/B,EAAAA,MAAOy9C,WACrBS,IAAeV,EAAWx9C,EAAOy9C,GACvBC,MAAMr9E,EAAK,OAoB5BxxF,OAAOC,eAAeH,EAAS,aAAA,CAAgBI,OAAO,qCCrVvD,aAGEL,EAAOC,QAAUC,EAAQ,wGCH3B,aAEAC,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAAovK,EAAAvvK,EAAA,qBACAM,EAAAN,EAAA,eAEA,MAAAwvK,EAAA,6BACAC,EAAA,oBAAA7tK,SAAAA,SAAA,KACA,IAAA8tK,EACAC,EACA,MAAAC,EAAA,CACAC,OAAA,CAAA14F,EAAAjE,EAAA48F,KACA58F,EAAA68F,aAAA54F,EAAA24F,GAAA,OAEA3lE,OAAAhzB,IACA,MAAAjE,EAAAiE,EAAA64F,WACA98F,GACAA,EAAA+8F,YAAA94F,IAGA+4F,cAAA,CAAAj/F,EAAAk/F,EAAAC,EAAAh9F,KACA,MAAAzxE,EAAAwuK,EACAV,EAAAY,gBAAAb,EAAAv+F,GACAw+F,EAAAS,cAAAj/F,EAAAm/F,EAAA,CAAAA,GAAAA,QAAAjuK,GAIA,MAHA,WAAA8uE,GAAAmC,GAAA,MAAAA,EAAAk9F,UACA3uK,EAAA4uK,aAAA,WAAAn9F,EAAAk9F,UAEA3uK,GAEA6uK,WAAA52F,GAAA61F,EAAAgB,eAAA72F,GACA82F,cAAA92F,GAAA61F,EAAAiB,cAAA92F,GACA+2F,QAAA,CAAAj9F,EAAAkG,KACAlG,EAAAk9F,UAAAh3F,GAEAi3F,eAAA,CAAAlvK,EAAAi4E,KACAj4E,EAAAmvK,YAAAl3F,GAEAo2F,WAAAt8F,GAAAA,EAAAs8F,WACAe,YAAAr9F,GAAAA,EAAAq9F,YACAlvK,cAAAmvK,GAAAvB,EAAA5tK,cAAAmvK,GACA1tK,WAAA3B,EAAA+uF,GACA/uF,EAAA4uK,aAAA7/E,EAAA,KAEAptF,UAAA3B,GACA,MAAAsvK,EAAAtvK,EAAAuvK,WAAA,GAaA,MAHA,WAAAvvK,IACAsvK,EAAAE,OAAAxvK,EAAAwvK,QAEAF,GAMA3tK,oBAAAkwE,EAAAN,EAAA48F,EAAAK,GACA,MAAAj4D,EAAAi4D,EACAR,IACAA,EAAAF,EAAAY,gBAAAb,EAAA,QACAE,IAAAA,EAAAD,EAAAS,cAAA,QACAh4D,EAAA12G,UAAAgyE,EACA,MAAA8R,EAAA4yB,EAAAle,WACA,IAAAtmB,EAAA4R,EACAkD,EAAA9U,EACA,KAAAA,GACA8U,EAAA9U,EACAk8F,EAAAC,OAAAn8F,EAAAR,EAAA48F,GACAp8F,EAAAwkC,EAAAle,WAEA,MAAA,CAAA1U,EAAAkD,KAyDA,MAAA4oF,EAAA,iBACA,SAAAC,EAAAC,EAAAhyK,EAAA8mG,GACA,GAAA9lG,EAAAipF,QAAA6c,GACAA,EAAAvlG,SAAA0wK,GAAAF,EAAAC,EAAAhyK,EAAAiyK,UAGA,GAAAjyK,EAAAspF,WAAA,MAEA0oF,EAAAE,YAAAlyK,EAAA8mG,OAEA,CACA,MAAAqrE,EAaA,SAAAH,EAAA3uE,GACA,MAAAjhG,EAAAgwK,EAAA/uE,GACA,GAAAjhG,EACA,OAAAA,EAEA,IAAApC,EAAAiwK,EAAA//E,SAAAmT,GACA,GAAA,WAAArjG,GAAAA,KAAAgyK,EACA,OAAAI,EAAA/uE,GAAArjG,EAEAA,EAAAgB,EAAA86E,WAAA97E,GACA,IAAA,IAAAs0E,EAAA,EAAAA,EAAA+9F,EAAAjgG,OAAAkC,IAAA,CACA,MAAA69F,EAAAE,EAAA/9F,GAAAt0E,EACA,GAAAmyK,KAAAH,EACA,OAAAI,EAAA/uE,GAAA8uE,EAGA,OAAA9uE,EA7BAivE,CAAAN,EAAAhyK,GACA8xK,EAAAl/F,KAAAk0B,GAEAkrE,EAAAE,YAAAlxK,EAAAojF,UAAA+tF,GAAArrE,EAAAzgB,QAAAyrF,EAAA,IAAA,aAGAE,EAAAG,GAAArrE,GAKA,MAAAurE,EAAA,CAAA,SAAA,MAAA,MACAD,EAAA,GAoBA,MAAAG,EAAA,+BA+EA,IAAAC,EAAAtnE,KAAAunE,IACAC,GAAA,EACA,GAAA,oBAAAhmE,OAAA,CAKA8lE,IAAAlwK,SAAAqwK,YAAA,SAAAC,YAIAJ,EAAA,IAAAK,YAAAJ,OAIA,MAAAK,EAAAC,UAAAC,UAAAvoF,MAAA,mBACAioF,KAAAI,GAAAx/F,OAAAw/F,EAAA,KAAA,IAIA,IAAAG,EAAA,EACA,MAAA5+F,EAAA6+F,QAAAC,UACAC,EAAA,KACAH,EAAA,GAGA,SAAAI,EAAAhxK,EAAAg0E,EAAAq0F,EAAA5oK,GACAO,EAAAgxK,iBAAAh9F,EAAAq0F,EAAA5oK,GAKA,SAAAwxK,EAAAjxK,EAAAghG,EAAAkwE,EAAAC,EAAAxD,EAAA,MAEA,MAAAyD,EAAApxK,EAAAqxK,OAAArxK,EAAAqxK,KAAA,IACAC,EAAAF,EAAApwE,GACA,GAAAmwE,GAAAG,EAEAA,EAAA9yK,MAAA2yK,MAEA,CACA,MAAAxzK,EAAA8B,GAcA,SAAA9B,GACA,IAAA8B,EACA,GAAA8xK,EAAAhhG,KAAA5yE,GAAA,CAEA,IAAAqsF,EACA,IAFAvqF,EAAA,GAEAuqF,EAAArsF,EAAAyqF,MAAAmpF,IACA5zK,EAAAA,EAAAuyE,MAAA,EAAAvyE,EAAAoyE,OAAAia,EAAA,GAAAja,QACAtwE,EAAAuqF,EAAA,GAAA9V,gBAAA,EAGA,MAAA,CAAAv1E,EAAAojF,UAAApkF,EAAAuyE,MAAA,IAAAzwE,GAxBA+xK,CAAAxwE,GACA,GAAAmwE,EAAA,CAGAH,EAAAhxK,EAAArC,EADAyzK,EAAApwE,GAuBA,SAAAywE,EAAA9D,GACA,MAAA+D,EAAA7yK,IAOA,MAAA0xK,EAAA1xK,EAAA0xK,WAAAJ,KACAE,GAAAE,GAAAmB,EAAAC,SAAA,IACA/D,EAAAgE,2BAOA,SAAA/yK,EAAAL,GACA,GAAAG,EAAAipF,QAAAppF,GAAA,CACA,MAAAqzK,EAAAhzK,EAAAizK,yBAKA,OAJAjzK,EAAAizK,yBAAA,KACAD,EAAAnpE,KAAA7pG,GACAA,EAAAkzK,UAAA,GAEAvzK,EAAA02E,KAAAwa,GAAA7wF,IAAAA,EAAAkzK,UAAAriF,EAAA7wF,KAGA,OAAAL,EAjBAwzK,CAAAnzK,EAAA6yK,EAAAlzK,OAAAmvK,EAAA,EAAA,CAAA9uK,KAKA,OAFA6yK,EAAAlzK,MAAAizK,EACAC,EAAAC,SAxDA,KAAAf,IAAA5+F,EAAA+2B,KAAAgoE,GAAAH,EAAAT,KAwDA8B,GACAP,EAtCAQ,CAAAf,EAAAxD,GACAluK,QAEA6xK,KAlBA,SAAAtxK,EAAAg0E,EAAAq0F,EAAA5oK,GACAO,EAAAmyK,oBAAAn+F,EAAAq0F,EAAA5oK,GAmBA0yK,CAAAnyK,EAAArC,EAAA2zK,EAAA7xK,GACA2xK,EAAApwE,QAAAxgG,IAIA,MAAA+wK,EAAA,4BA4CA,MAAAa,EAAA,WA0GA,MAAA5wK,EAAA,aACA6wK,EAAA,YAGAC,EAAA,CAAA7gG,GAAAirB,MAAAA,KAAAkxE,EAAA2E,EAAA3E,EAAA4E,eAAAC,EAAAhhG,GAAAirB,GACA41E,EAAAI,YAAA,aACA,MAAAC,EAAA,CACAh1K,KAAAwzE,OACAS,KAAAT,OACAyhG,IAAA,CACAhhG,KAAAuW,QACAlqF,SAAA,GAEA40K,SAAA,CAAA1hG,OAAAF,OAAA3yE,QACAw0K,eAAA3hG,OACA4hG,iBAAA5hG,OACA6hG,aAAA7hG,OACA8hG,gBAAA9hG,OACA+hG,kBAAA/hG,OACAgiG,cAAAhiG,OACAiiG,eAAAjiG,OACAkiG,iBAAAliG,OACAmiG,aAAAniG,QAEAoiG,EAAAjB,EAAA7gG,MAAA9yE,EAAA0B,OAAA,GAAAutK,EAAA4E,eAAA/gG,MAAAkhG,GAKAa,EAAA,CAAAC,EAAAvyF,EAAA,MACAviF,EAAAipF,QAAA6rF,GACAA,EAAAv0K,SAAAqzK,GAAAA,KAAArxF,KAEAuyF,GACAA,KAAAvyF,IAOAwyF,EAAAD,KACAA,IACA90K,EAAAipF,QAAA6rF,GACAA,EAAA/hG,MAAA6gG,GAAAA,EAAAxiG,OAAA,IACA0jG,EAAA1jG,OAAA,GAGA,SAAA0iG,EAAAkB,GACA,MAAAC,EAAA,GACA,IAAA,MAAA9zK,KAAA6zK,EACA7zK,KAAA6yK,IACAiB,EAAA9zK,GAAA6zK,EAAA7zK,IAGA,IAAA,IAAA6zK,EAAAf,IACA,OAAAgB,EAEA,MAAAj2K,KAAAA,EAAA,IAAAi0E,KAAAA,EAAAihG,SAAAA,EAAAC,eAAAA,EAAA,GAAAn1K,eAAAo1K,iBAAAA,EAAA,GAAAp1K,iBAAAq1K,aAAAA,EAAA,GAAAr1K,aAAAs1K,gBAAAA,EAAAH,EAAAI,kBAAAA,EAAAH,EAAAI,cAAAA,EAAAH,EAAAI,eAAAA,EAAA,GAAAz1K,eAAA01K,iBAAAA,EAAA,GAAA11K,iBAAA21K,aAAAA,EAAA,GAAA31K,cAAAg2K,EACAE,EAsEA,SAAAhB,GACA,GAAA,MAAAA,EACA,OAAA,KAEA,GAAAl0K,EAAA2lF,SAAAuuF,GACA,MAAA,CAAAiB,EAAAjB,EAAApjD,OAAAqkD,EAAAjB,EAAA3F,QAEA,CACA,MAAAnuK,EAAA+0K,EAAAjB,GACA,MAAA,CAAA9zK,EAAAA,IA/EAg1K,CAAAlB,GACAmB,EAAAH,GAAAA,EAAA,GACAI,EAAAJ,GAAAA,EAAA,IACAK,cAAAA,EAAAC,QAAAA,EAAAC,iBAAAA,EAAAC,QAAAA,EAAAC,iBAAAA,EAAAC,eAAAA,EAAAL,EAAAM,SAAAA,EAAAL,EAAAM,kBAAAA,EAAAL,GAAAR,EACAc,EAAA,CAAA10K,EAAA20K,EAAAC,KACAC,EAAA70K,EAAA20K,EAAAxB,EAAAH,GACA6B,EAAA70K,EAAA20K,EAAAzB,EAAAH,GACA6B,GAAAA,KAEAE,EAAA,CAAA90K,EAAA40K,KACAC,EAAA70K,EAAAszK,GACAuB,EAAA70K,EAAAqzK,GACAuB,GAAAA,KAEAG,EAAAJ,GACA,CAAA30K,EAAA40K,KACA,MAAAnB,EAAAkB,EAAAH,EAAAL,EACArD,EAAA,IAAA4D,EAAA10K,EAAA20K,EAAAC,GACApB,EAAAC,EAAA,CAAAzzK,EAAA8wK,IACAkE,GAAA,KACAH,EAAA70K,EAAA20K,EAAA1B,EAAAH,GACAmC,EAAAj1K,EAAA20K,EAAAxB,EAAAH,GACAU,EAAAD,IACAyB,EAAAl1K,EAAA4xE,EAAAoiG,EAAAlD,OAKA,OAAAnyK,EAAA0B,OAAAuzK,EAAA,CACAjyK,cAAA3B,GACAwzK,EAAAU,EAAA,CAAAl0K,IACAi1K,EAAAj1K,EAAA8yK,GACAmC,EAAAj1K,EAAA+yK,IAEApxK,eAAA3B,GACAwzK,EAAAe,EAAA,CAAAv0K,IACAi1K,EAAAj1K,EAAAizK,GACAgC,EAAAj1K,EAAAkzK,IAEAiB,QAAAY,GAAA,GACAP,SAAAO,GAAA,GACApzK,QAAA3B,EAAA40K,GACA,MAAA9D,EAAA,IAAAgE,EAAA90K,EAAA40K,GACAK,EAAAj1K,EAAAozK,GAEA+B,IACAF,EAAAj1K,EAAAqzK,GACA2B,GAAA,KACAH,EAAA70K,EAAAozK,GACA6B,EAAAj1K,EAAAszK,GACAI,EAAAW,IACAa,EAAAl1K,EAAA4xE,EAAAqiG,EAAAnD,MAGA0C,EAAAa,EAAA,CAAAr0K,EAAA8wK,KAEAnvK,iBAAA3B,GACA00K,EAAA10K,GAAA,GACAwzK,EAAAY,EAAA,CAAAp0K,KAEA2B,kBAAA3B,GACA00K,EAAA10K,GAAA,GACAwzK,EAAAiB,EAAA,CAAAz0K,KAEA2B,iBAAA3B,GACA80K,EAAA90K,GACAwzK,EAAAc,EAAA,CAAAt0K,OAgBA,SAAA8zK,EAAArvE,GAEA,OADA9lG,EAAAmrG,SAAArF,GAGA,SAAAwwE,EAAAj1K,EAAAovJ,GACAA,EAAAxkE,MAAA,OAAA1rF,SAAAq4E,GAAAA,GAAAv3E,EAAAo1K,UAAAtrF,IAAAvS,MACAv3E,EAAAq1K,OACAr1K,EAAAq1K,KAAA,IAAA5rF,MAAAK,IAAAslE,GAEA,SAAAylB,EAAA70K,EAAAovJ,GACAA,EAAAxkE,MAAA,OAAA1rF,SAAAq4E,GAAAA,GAAAv3E,EAAAo1K,UAAA5sE,OAAAjxB,KACA,MAAA89F,KAAAA,GAAAr1K,EACAq1K,IACAA,EAAA9mF,OAAA6gE,GACAimB,EAAAttE,OACA/nG,EAAAq1K,UAAA70K,IAIA,SAAAw0K,EAAA7pB,GACAmqB,uBAAA,KACAA,sBAAAnqB,MAGA,IAAAoqB,EAAA,EACA,SAAAL,EAAAl1K,EAAAkhJ,EAAAs0B,EAAA1E,GACA,MAAA/hF,EAAA/uF,EAAAy1K,SAAAF,EACAG,EAAA,KACA3mF,IAAA/uF,EAAAy1K,QACA3E,KAGA,GAAA0E,EACA,OAAAG,WAAAD,EAAAF,GAEA,MAAA5jG,KAAAA,EAAAgkG,QAAAA,EAAAC,UAAAA,GAAAC,EAAA91K,EAAAkhJ,GACA,IAAAtvE,EACA,OAAAk/F,IAEA,MAAAiF,EAAAnkG,EAAA,MACA,IAAAokG,EAAA,EACA,MAAAlmG,EAAA,KACA9vE,EAAAmyK,oBAAA4D,EAAAE,GACAP,KAEAO,EAAAp3K,IACAA,EAAAq3K,SAAAl2K,KAAAg2K,GAAAH,GACA/lG,KAGA6lG,YAAA,KACAK,EAAAH,GACA/lG,MAEA8lG,EAAA,GACA51K,EAAAgxK,iBAAA+E,EAAAE,GAEA,SAAAH,EAAA91K,EAAAkhJ,GACA,MAAA/6C,EAAAkE,OAAA8rE,iBAAAn2K,GAEAo2K,EAAAt2K,IAAAqmG,EAAArmG,IAAA,IAAA8qF,MAAA,MACAyrF,EAAAD,EAAA50K,mBACA80K,EAAAF,EAAA50K,sBACA+0K,EAAAC,EAAAH,EAAAC,GACAG,EAAAL,EAAA/D,kBACAqE,EAAAN,EAAA/D,qBACAsE,EAAAH,EAAAC,EAAAC,GACA,IAAA9kG,EAAA,KACAgkG,EAAA,EACAC,EAAA,EAEA30B,IAAA1/I,EACA+0K,EAAA,IACA3kG,EAAApwE,EACAo0K,EAAAW,EACAV,EAAAS,EAAAvmG,QAGAmxE,IAAAmxB,EACAsE,EAAA,IACA/kG,EAAAygG,EACAuD,EAAAe,EACAd,EAAAa,EAAA3mG,SAIA6lG,EAAAllG,KAAAD,IAAA8lG,EAAAI,GACA/kG,EACAgkG,EAAA,EACAW,EAAAI,EACAn1K,EACA6wK,EACA,KACAwD,EAAAjkG,EACAA,IAAApwE,EACA80K,EAAAvmG,OACA2mG,EAAA3mG,OACA,GAIA,MAAA,CACA6B,KAAAA,EACAgkG,QAAAA,EACAC,UAAAA,EACAe,aANAhlG,IAAApwE,GACA,yBAAA+uE,KAAA41B,EAAA,qBAQA,SAAAqwE,EAAAK,EAAAhD,GACA,KAAAgD,EAAA9mG,OAAA8jG,EAAA9jG,QACA8mG,EAAAA,EAAAl6E,OAAAk6E,GAEA,OAAAnmG,KAAAD,OAAAojG,EAAA3+F,KAAA,CAAAwzD,EAAAz2D,IAAA6kG,EAAApuC,GAAAouC,EAAAD,EAAA5kG,OAMA,SAAA6kG,EAAA9vF,GACA,OAAA,IAAA/V,OAAA+V,EAAA9W,MAAA,GAAA,GAAA8T,QAAA,IAAA,MAGA,SAAAmxF,IACA,OAAAl1K,SAAA8wE,KAAAgmG,aAGA,MAAAC,EAAA,IAAAn6E,QACAo6E,EAAA,IAAAp6E,QAqEAq6E,EApEA,CACAv5K,KAAA,kBACA8zE,MAAA9yE,EAAA0B,OAAA,GAAAkzK,EAAA,CACAjkG,IAAA6B,OACAgmG,UAAAhmG,SAEAxvE,MAAA8vE,GAAAirB,MAAAA,IACA,MAAAixE,EAAAC,EAAAwJ,qBACAxjD,EAAAg6C,EAAAyJ,qBACA,IAAAC,EACAjjG,EAmCA,OAlCAu5F,EAAA2J,WAAA,KAEA,IAAAD,EAAAvnG,OACA,OAEA,MAAAonG,EAAA1lG,EAAA0lG,WAAA,GAAA1lG,EAAA9zE,MAAA,WACA,IA4EA,SAAAqC,EAAAurF,EAAA4rF,GAMA,MAAAh3C,EAAAngI,EAAAuvK,YACAvvK,EAAAq1K,MACAr1K,EAAAq1K,KAAAn2K,SAAAkwJ,IACAA,EAAAxkE,MAAA,OAAA1rF,SAAAq4E,GAAAA,GAAA4oD,EAAAi1C,UAAA5sE,OAAAjxB,QAGA4/F,EAAAvsF,MAAA,OAAA1rF,SAAAq4E,GAAAA,GAAA4oD,EAAAi1C,UAAAtrF,IAAAvS,KACA4oD,EAAAwvC,MAAA6H,QAAA,OACA,MAAAC,EAAA,IAAAlsF,EAAA5rF,SACA4rF,EACAA,EAAA8iF,WACAoJ,EAAAC,YAAAv3C,GACA,MAAAy2C,aAAAA,GAAAd,EAAA31C,GAEA,OADAs3C,EAAAnJ,YAAAnuC,GACAy2C,EAhGAe,CAAAL,EAAA,GAAAt3K,GAAA2tK,EAAAiK,MAAA53K,GAAAm3K,GACA,OAIAG,EAAAp4K,QAAA24K,GACAP,EAAAp4K,QAAA44K,GACA,MAAAC,EAAAT,EAAAz+F,OAAAm/F,GAEA7C,IACA4C,EAAA74K,SAAAq4E,IACA,MAAAv3E,EAAAu3E,EAAAv3E,GACA2vK,EAAA3vK,EAAA2vK,MACAsF,EAAAj1K,EAAAm3K,GACAxH,EAAA1gF,UAAA0gF,EAAAsI,gBAAAtI,EAAAuI,mBAAA,GACA,MAAA/sB,EAAAnrJ,EAAAm4K,QAAAt5K,IACAA,GAAAA,EAAAq3K,SAAAl2K,GAGAnB,IAAA,aAAA0xE,KAAA1xE,EAAA4jK,gBACAziK,EAAAmyK,oBAAA,gBAAAhnB,GACAnrJ,EAAAm4K,QAAA,KACAtD,EAAA70K,EAAAm3K,KAGAn3K,EAAAgxK,iBAAA,gBAAA7lB,SAGA,KACA,MAAAwoB,EAAA/F,EAAAwK,MAAA3mG,GACA4mG,EAAA5F,EAAAkB,GACA,IAAArkG,EAAAqkG,EAAArkG,KAAAs+F,EAAA0K,SACAhB,EAAAjjG,EACAA,EAAAqoB,EAAAz+F,QAAA2vK,EAAA2K,yBAAA77E,EAAAz+F,WAAA,GACA,IAAA,IAAAg0E,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAnB,EAAApC,GACA,MAAAuD,EAAA11E,KACA8tK,EAAA4K,mBAAAhjG,EAAAo4F,EAAA6K,uBAAAjjG,EAAA6iG,EAAAzkD,EAAA+5C,IAGA,GAAA2J,EACA,IAAA,IAAArlG,EAAA,EAAAA,EAAAqlG,EAAAvnG,OAAAkC,IAAA,CACA,MAAAuD,EAAA8hG,EAAArlG,GACA27F,EAAA4K,mBAAAhjG,EAAAo4F,EAAA6K,uBAAAjjG,EAAA6iG,EAAAzkD,EAAA+5C,IACAqJ,EAAAzqF,IAAA/W,EAAAA,EAAAx1E,GAAA04K,yBAGA,OAAA9K,EAAA+K,YAAArpG,EAAA,KAAA+E,MAKA,SAAAwjG,EAAAtgG,GACA,MAAAv3E,EAAAu3E,EAAAv3E,GACAA,EAAAm4K,SACAn4K,EAAAm4K,UAEAn4K,EAAA44K,UACA54K,EAAA44K,WAGA,SAAAd,EAAAvgG,GACA0/F,EAAA1qF,IAAAhV,EAAAA,EAAAv3E,GAAA04K,yBAEA,SAAAV,EAAAzgG,GACA,MAAAshG,EAAA7B,EAAA1qF,IAAA/U,GACAuhG,EAAA7B,EAAA3qF,IAAA/U,GACAwhG,EAAAF,EAAA7kF,KAAA8kF,EAAA9kF,KACAglF,EAAAH,EAAAI,IAAAH,EAAAG,IACA,GAAAF,GAAAC,EAAA,CACA,MAAAhyF,EAAAzP,EAAAv3E,GAAA2vK,MAGA,OAFA3oF,EAAAiI,UAAAjI,EAAAixF,gBAAA,aAAAc,OAAAC,OACAhyF,EAAAkxF,mBAAA,KACA3gG,GA0BA,MAAA2hG,EAAAtB,IACA,MAAAloF,EAAAkoF,EAAAnmG,MAAA,uBACA,OAAA9yE,EAAAipF,QAAA8H,GAAAlxF,GAAAG,EAAA6qG,eAAA9Z,EAAAlxF,GAAAkxF,GAEA,SAAAypF,EAAAt6K,GACAA,EAAAq3K,OAAAkD,WAAA,EAEA,SAAAC,EAAAx6K,GACA,MAAAq3K,EAAAr3K,EAAAq3K,OACAA,EAAAkD,YACAlD,EAAAkD,WAAA,EAIA,SAAAp5K,EAAA4xE,GACA,MAAA/yE,EAAAoB,SAAAqwK,YAAA,cACAzxK,EAAAy6K,UAAA1nG,GAAA,GAAA,GACA5xE,EAAAu5K,cAAA16K,GANA26K,CAAAtD,EAAA,UAUA,MAAAuD,EAAA,CACA93K,QAAA3B,GAAAuyE,WAAAmnG,KAAAA,EAAAp3F,KAAAA,EAAAstB,OAAAA,IAAAgoE,GACA53K,EAAA25K,QAAAT,EAAAtB,GACA,MAAAgC,EAAAhqE,GAAA,WAAA5vG,EAAA4xE,KACAo/F,EAAAhxK,EAAA05K,EAAA,SAAA,SAAA76K,IACA,GAAAA,EAAAq3K,OAAAkD,UACA,OACA,IAAAS,EAAA75K,EAAAxB,MACA8jF,EACAu3F,EAAAA,EAAAv3F,OAEAs3F,IACAC,EAAAl7K,EAAAmrG,SAAA+vE,IAEA75K,EAAA25K,QAAAE,MAEAv3F,GACA0uF,EAAAhxK,EAAA,UAAA,KACAA,EAAAxB,MAAAwB,EAAAxB,MAAA8jF,UAGAo3F,IACA1I,EAAAhxK,EAAA,mBAAAm5K,GACAnI,EAAAhxK,EAAA,iBAAAq5K,GAKArI,EAAAhxK,EAAA,SAAAq5K,KAIA13K,QAAA3B,GAAAxB,MAAAA,IACAwB,EAAAxB,MAAA,MAAAA,EAAA,GAAAA,GAEAmD,aAAA3B,GAAAxB,MAAAA,EAAA+zE,WAAA+P,KAAAA,EAAAstB,OAAAA,IAAAgoE,GAGA,GAFA53K,EAAA25K,QAAAT,EAAAtB,GAEA53K,EAAAo5K,UACA,OACA,GAAAn5K,SAAA65K,gBAAA95K,EAAA,CACA,GAAAsiF,GAAAtiF,EAAAxB,MAAA8jF,SAAA9jF,EACA,OAEA,IAAAoxG,GAAA,WAAA5vG,EAAA4xE,OAAAjzE,EAAAmrG,SAAA9pG,EAAAxB,SAAAA,EACA,OAGA,MAAAu7K,EAAA,MAAAv7K,EAAA,GAAAA,EACAwB,EAAAxB,QAAAu7K,IACA/5K,EAAAxB,MAAAu7K,KAIAC,EAAA,CACAr4K,QAAA3B,EAAAimF,EAAA2xF,GACA53K,EAAA25K,QAAAT,EAAAtB,GACA5G,EAAAhxK,EAAA,UAAA,KACA,MAAAi6K,EAAAj6K,EAAAk6K,YACAC,EAAAC,GAAAp6K,GACAq6K,EAAAr6K,EAAAq6K,QACA9xE,EAAAvoG,EAAA25K,QACA,GAAAh7K,EAAAipF,QAAAqyF,GAAA,CACA,MAAA5pG,EAAA1xE,EAAA8oG,aAAAwyE,EAAAE,GACAG,GAAA,IAAAjqG,EACA,GAAAgqG,IAAAC,EACA/xE,EAAA0xE,EAAAt9E,OAAAw9E,SAEA,IAAAE,GAAAC,EAAA,CACA,MAAAC,EAAA,IAAAN,GACAM,EAAAhlG,OAAAlF,EAAA,GACAk4B,EAAAgyE,SAGA,GAAA57K,EAAAspG,MAAAgyE,GAAA,CACA,MAAA3K,EAAA,IAAA7lF,IAAAwwF,GACAI,EACA/K,EAAAxlF,IAAAqwF,GAGA7K,EAAA/gF,OAAA4rF,GAEA5xE,EAAA+mE,QAGA/mE,EAAAiyE,GAAAx6K,EAAAq6K,QAKAI,QAAAC,EACA/4K,aAAA3B,EAAA26K,EAAA/C,GACA53K,EAAA25K,QAAAT,EAAAtB,GACA8C,EAAA16K,EAAA26K,EAAA/C,KAGA,SAAA8C,EAAA16K,GAAAxB,MAAAA,EAAA+qG,SAAAA,GAAAquE,GACA53K,EAAAk6K,YAAA17K,EACAG,EAAAipF,QAAAppF,GACAwB,EAAAq6K,QAAA17K,EAAA8oG,aAAAjpG,EAAAo5K,EAAAnmG,MAAAjzE,QAAA,EAEAG,EAAAspG,MAAAzpG,GACAwB,EAAAq6K,QAAA77K,EAAAqrF,IAAA+tF,EAAAnmG,MAAAjzE,OAEAA,IAAA+qG,IACAvpG,EAAAq6K,QAAA17K,EAAAuoG,WAAA1oG,EAAAg8K,GAAAx6K,GAAA,KAGA,MAAA46K,GAAA,CACAj5K,QAAA3B,GAAAxB,MAAAA,GAAAo5K,GACA53K,EAAAq6K,QAAA17K,EAAAuoG,WAAA1oG,EAAAo5K,EAAAnmG,MAAAjzE,OACAwB,EAAA25K,QAAAT,EAAAtB,GACA5G,EAAAhxK,EAAA,UAAA,KACAA,EAAA25K,QAAAS,GAAAp6K,QAGA2B,aAAA3B,GAAAxB,MAAAA,EAAA+qG,SAAAA,GAAAquE,GACA53K,EAAA25K,QAAAT,EAAAtB,GACAp5K,IAAA+qG,IACAvpG,EAAAq6K,QAAA17K,EAAAuoG,WAAA1oG,EAAAo5K,EAAAnmG,MAAAjzE,UAIAq8K,GAAA,CACAl5K,QAAA3B,GAAAxB,MAAAA,EAAA+zE,WAAAq9B,OAAAA,IAAAgoE,GACA,MAAAkD,EAAAn8K,EAAAspG,MAAAzpG,GACAwyK,EAAAhxK,EAAA,UAAA,KACA,MAAA+6K,EAAApyE,MAAAF,UAAA5vB,OACA6vB,KAAA1oG,EAAAP,SAAAu7K,GAAAA,EAAAC,WACA/lG,KAAA8lG,GAAAprE,EAAAjxG,EAAAmrG,SAAAswE,GAAAY,IAAAZ,GAAAY,KACAh7K,EAAA25K,QAAA35K,EAAA2uK,SACAmM,EACA,IAAArxF,IAAAsxF,GACAA,EACAA,EAAA,OAEA/6K,EAAA25K,QAAAT,EAAAtB,IAIAj2K,QAAA3B,GAAAxB,MAAAA,IACA08K,GAAAl7K,EAAAxB,IAEAmD,aAAA3B,EAAAm7K,EAAAvD,GACA53K,EAAA25K,QAAAT,EAAAtB,IAEAj2K,QAAA3B,GAAAxB,MAAAA,IACA08K,GAAAl7K,EAAAxB,KAGA,SAAA08K,GAAAl7K,EAAAxB,GACA,MAAA48K,EAAAp7K,EAAA2uK,SACA,IAAAyM,GAAAz8K,EAAAipF,QAAAppF,IAAAG,EAAAspG,MAAAzpG,GAAA,CAGA,IAAA,IAAAyzE,EAAA,EAAA4hB,EAAA7zF,EAAAP,QAAAswE,OAAAkC,EAAA4hB,EAAA5hB,IAAA,CACA,MAAAk0D,EAAAnmI,EAAAP,QAAAwyE,GACAopG,EAAAjB,GAAAj0C,GACA,GAAAi1C,EACAz8K,EAAAipF,QAAAppF,GACA2nI,EAAA80C,SAAAt8K,EAAA8oG,aAAAjpG,EAAA68K,IAAA,EAGAl1C,EAAA80C,SAAAz8K,EAAAqrF,IAAAwxF,QAIA,GAAA18K,EAAAuoG,WAAAkzE,GAAAj0C,GAAA3nI,GAGA,YAFAwB,EAAAs7K,gBAAArpG,IACAjyE,EAAAs7K,cAAArpG,IAKAmpG,IAAA,IAAAp7K,EAAAs7K,gBACAt7K,EAAAs7K,eAAA,IAIA,SAAAlB,GAAAp6K,GACA,MAAA,WAAAA,EAAAA,EAAAwvK,OAAAxvK,EAAAxB,MAGA,SAAAg8K,GAAAx6K,EAAAq6K,GACA,MAAAv6K,EAAAu6K,EAAA,aAAA,cACA,OAAAv6K,KAAAE,EAAAA,EAAAF,GAAAu6K,EAEA,MAAAkB,GAAA,CACA55K,QAAA3B,EAAA26K,EAAA/C,GACA4D,GAAAx7K,EAAA26K,EAAA/C,EAAA,KAAA,YAEAj2K,QAAA3B,EAAA26K,EAAA/C,GACA4D,GAAAx7K,EAAA26K,EAAA/C,EAAA,KAAA,YAEAj2K,aAAA3B,EAAA26K,EAAA/C,EAAA6D,GACAD,GAAAx7K,EAAA26K,EAAA/C,EAAA6D,EAAA,iBAEA95K,QAAA3B,EAAA26K,EAAA/C,EAAA6D,GACAD,GAAAx7K,EAAA26K,EAAA/C,EAAA6D,EAAA,aAGA,SAAAD,GAAAx7K,EAAA26K,EAAA/C,EAAA6D,EAAAhI,GACA,IAAAiI,EACA,OAAA17K,EAAA27K,SACA,IAAA,SACAD,EAAAb,GACA,MACA,IAAA,WACAa,EAAAjC,EACA,MACA,QACA,OAAA7B,EAAAnmG,OAAAmmG,EAAAnmG,MAAAG,MACA,IAAA,WACA8pG,EAAA1B,EACA,MACA,IAAA,QACA0B,EAAAd,GACA,MACA,QACAc,EAAAjC,GAGA,MAAA/pF,EAAAgsF,EAAAjI,GACA/jF,GAAAA,EAAA1vF,EAAA26K,EAAA/C,EAAA6D,GAIAhC,EAAAmC,YAAA,EAAAp9K,MAAAA,MAAA,CAAAA,MAAAA,IACAo8K,GAAAgB,YAAA,EAAAp9K,MAAAA,GAAAo5K,KACA,GAAAA,EAAAnmG,OAAA9yE,EAAAuoG,WAAA0wE,EAAAnmG,MAAAjzE,MAAAA,GACA,MAAA,CAAA67K,SAAA,IAGAL,EAAA4B,YAAA,EAAAp9K,MAAAA,GAAAo5K,KACA,GAAAj5K,EAAAipF,QAAAppF,IACA,GAAAo5K,EAAAnmG,OAAA9yE,EAAA8oG,aAAAjpG,EAAAo5K,EAAAnmG,MAAAjzE,QAAA,EACA,MAAA,CAAA67K,SAAA,QAGA,GAAA17K,EAAAspG,MAAAzpG,IACA,GAAAo5K,EAAAnmG,OAAAjzE,EAAAqrF,IAAA+tF,EAAAnmG,MAAAjzE,OACA,MAAA,CAAA67K,SAAA,QAGA,GAAA77K,EACA,MAAA,CAAA67K,SAAA,IAKA,MAAAwB,GAAA,CAAA,OAAA,QAAA,MAAA,QACAC,GAAA,CACAzwC,KAAAxsI,GAAAA,EAAAk9K,kBACAC,QAAAn9K,GAAAA,EAAAo9K,iBACA7xE,KAAAvrG,GAAAA,EAAAq3K,SAAAr3K,EAAAq9K,cACAC,KAAAt9K,IAAAA,EAAAu9K,QACA3sE,MAAA5wG,IAAAA,EAAAw9K,SACAC,IAAAz9K,IAAAA,EAAA09K,OACAha,KAAA1jK,IAAAA,EAAA29K,QACAxoF,KAAAn1F,GAAA,WAAAA,GAAA,IAAAA,EAAA49K,OACAC,OAAA79K,GAAA,WAAAA,GAAA,IAAAA,EAAA49K,OACAxoF,MAAAp1F,GAAA,WAAAA,GAAA,IAAAA,EAAA49K,OACAhoC,MAAA,CAAA51I,EAAA0zE,IAAAspG,GAAAnqG,MAAAsY,GAAAnrF,EAAA,GAAAmrF,UAAAzX,EAAAgH,SAAAyQ,MAiBA2yF,GAAA,CACAjhB,IAAA,SACAkhB,MAAA,IACA5rE,GAAA,WACAhd,KAAA,aACAC,MAAA,cACA4oF,KAAA,aACAtuF,OAAA,aAiBAuuF,GAAA,CACAn7K,YAAA3B,GAAAxB,MAAAA,IAAAu+K,WAAAA,IACA/8K,EAAAg9K,KAAA,SAAAh9K,EAAA2vK,MAAA6H,QAAA,GAAAx3K,EAAA2vK,MAAA6H,QACAuF,GAAAv+K,EACAu+K,EAAAE,YAAAj9K,GAGAk9K,GAAAl9K,EAAAxB,IAGAmD,QAAA3B,GAAAxB,MAAAA,IAAAu+K,WAAAA,IACAA,GAAAv+K,GACAu+K,EAAAttD,MAAAzvH,IAGA2B,QAAA3B,GAAAxB,MAAAA,EAAA+qG,SAAAA,IAAAwzE,WAAAA,KACAv+K,IAAA+qG,IAEAwzE,EACAv+K,GACAu+K,EAAAE,YAAAj9K,GACAk9K,GAAAl9K,GAAA,GACA+8K,EAAAttD,MAAAzvH,IAGA+8K,EAAA7P,MAAAltK,GAAA,KACAk9K,GAAAl9K,GAAA,MAKAk9K,GAAAl9K,EAAAxB,KAGAmD,cAAA3B,GAAAxB,MAAAA,IACA0+K,GAAAl9K,EAAAxB,KAUA,SAAA0+K,GAAAl9K,EAAAxB,GACAwB,EAAA2vK,MAAA6H,QAAAh5K,EAAAwB,EAAAg9K,KAAA,OAPAF,GAAAlB,YAAA,EAAAp9K,MAAAA,MACA,IAAAA,EACA,MAAA,CAAAmxK,MAAA,CAAA6H,QAAA,UAQA,MAAA2F,GAAAx+K,EAAA0B,OAAA,CAAA+8K,UA91BA,CAAAp9K,EAAAF,EAAAoxK,EAAAC,EAAA3C,GAAA,EAAA8I,EAAA+F,EAAAC,EAAAC,KACA,OAAAz9K,GAEA,IAAA,SApRA,SAAAE,EAAAxB,EAAAgwK,GAIA,GAHA,MAAAhwK,IACAA,EAAA,IAEAgwK,EACAxuK,EAAA4uK,aAAA,QAAApwK,OAEA,CAIA,MAAAg/K,EAAAx9K,EAAAq1K,KACAmI,IACAh/K,GAAAA,EACA,CAAAA,KAAAg/K,GACA,IAAAA,IAAApoG,KAAA,MAEAp1E,EAAA2lG,UAAAnnG,GAoQAi/K,CAAAz9K,EAAAmxK,EAAA3C,GACA,MACA,IAAA,SAlQA,SAAAxuK,EAAAioF,EAAAC,GACA,MAAAynF,EAAA3vK,EAAA2vK,MACA,GAAAznF,EAGA,GAAAvpF,EAAAe,SAAAwoF,IACA,GAAAD,IAAAC,EAAA,CACA,MAAAsyD,EAAAm1B,EAAA6H,QACA7H,EAAAn9F,QAAA0V,EAIA,SAAAloF,IACA2vK,EAAA6H,QAAAh9B,QAIA,CACA,IAAA,MAAA16I,KAAAooF,EACAwnF,EAAAC,EAAA7vK,EAAAooF,EAAApoF,IAEA,GAAAmoF,IAAAtpF,EAAAe,SAAAuoF,GACA,IAAA,MAAAnoF,KAAAmoF,EACA,MAAAC,EAAApoF,IACA4vK,EAAAC,EAAA7vK,EAAA,SArBAE,EAAA09K,gBAAA,SAgQAC,CAAA39K,EAAAkxK,EAAAC,GACA,MACA,QACAxyK,EAAA8gG,KAAA3/F,GAEAnB,EAAA2pG,gBAAAxoG,IACAmxK,EAAAjxK,EAAAF,EAAAoxK,EAAAC,EAAAkM,GAsBA,SAAAr9K,EAAAF,EAAAtB,EAAAgwK,GACA,GAAAA,EAGA,MAAA,cAAA1uK,MAIAA,KAAAE,GAAAoyK,EAAA7hG,KAAAzwE,IAAAnB,EAAA43F,WAAA/3F,IAWA,GAAA,eAAAsB,GAAA,cAAAA,EACA,OAAA,EAIA,GAAA,SAAAA,EACA,OAAA,EAGA,GAAA,SAAAA,GAAA,UAAAE,EAAA27K,QACA,OAAA,EAGA,GAAA,SAAA77K,GAAA,aAAAE,EAAA27K,QACA,OAAA,EAGA,GAAAvJ,EAAA7hG,KAAAzwE,IAAAnB,EAAAe,SAAAlB,GACA,OAAA,EAEA,OAAAsB,KAAAE,EA1DA49K,CAAA59K,EAAAF,EAAAqxK,EAAA3C,GA1KA,SAAAxuK,EAAAF,EAAAtB,EAIA84K,EAAA+F,EAAAC,EAAAC,GACA,GAAA,cAAAz9K,GAAA,gBAAAA,EAKA,OAJAw3K,GACAiG,EAAAjG,EAAA+F,EAAAC,QAEAt9K,EAAAF,GAAA,MAAAtB,EAAA,GAAAA,GAGA,GAAA,UAAAsB,GAAA,aAAAE,EAAA27K,QAAA,CAGA37K,EAAAwvK,OAAAhxK,EACA,MAAAu7K,EAAA,MAAAv7K,EAAA,GAAAA,EAOA,OANAwB,EAAAxB,QAAAu7K,IACA/5K,EAAAxB,MAAAu7K,QAEA,MAAAv7K,GACAwB,EAAA09K,gBAAA59K,IAIA,GAAA,KAAAtB,GAAA,MAAAA,EAAA,CACA,MAAAozE,SAAA5xE,EAAAF,GACA,GAAA,KAAAtB,GAAA,YAAAozE,EAGA,YADA5xE,EAAAF,IAAA,GAGA,GAAA,MAAAtB,GAAA,WAAAozE,EAIA,OAFA5xE,EAAAF,GAAA,QACAE,EAAA09K,gBAAA59K,GAGA,GAAA,WAAA8xE,EAIA,OAFA5xE,EAAAF,GAAA,OACAE,EAAA09K,gBAAA59K,GAKA,IACAE,EAAAF,GAAAtB,EAEA,MAAAK,KA0HAg/K,CAAA79K,EAAAF,EAAAqxK,EAAAmG,EAAA+F,EAAAC,EAAAC,IAOA,eAAAz9K,EACAE,EAAA89K,WAAA3M,EAEA,gBAAArxK,IACAE,EAAA+9K,YAAA5M,GA9MA,SAAAnxK,EAAAF,EAAAtB,EAAAgwK,EAAAb,GACA,GAAAa,GAAA1uK,EAAAmnF,WAAA,UACA,MAAAzoF,EACAwB,EAAAg+K,kBAAA9N,EAAApwK,EAAAowE,MAAA,EAAApwE,EAAAiwE,SAGA/vE,EAAAi+K,eAAA/N,EAAApwK,EAAAtB,OAGA,CAGA,MAAA0/K,EAAAv/K,EAAAsmG,qBAAAnlG,GACA,MAAAtB,GAAA0/K,IAAA,IAAA1/K,EACAwB,EAAA09K,gBAAA59K,GAGAE,EAAA4uK,aAAA9uK,EAAAo+K,EAAA,GAAA1/K,IA+LA2/K,CAAAn+K,EAAAF,EAAAqxK,EAAA3C,MAg0BA4P,eA/1BA,CAAAn4F,EAAAnmF,IAAA,UAAAA,GA+1BAmuK,GAGA,IAAAoQ,GACAC,IAAA,EACA,SAAAC,KACA,OAAAF,KAAAA,GAAAzQ,EAAA4Q,eAAArB,KAEA,SAAAsB,KAKA,OAJAJ,GAAAC,GACAD,GACAzQ,EAAA8Q,wBAAAvB,IACAmB,IAAA,EACAD,GA8CA,SAAAM,GAAAlH,GACA,GAAA94K,EAAAe,SAAA+3K,GAAA,CAEA,OADAx3K,SAAAC,cAAAu3K,GAGA,OAAAA,EAGAn5K,OAAAW,KAAA2uK,GAAA1uK,SAAA,SAAAC,GACA,YAAAA,IAAAf,EAAAe,GAAAyuK,EAAAzuK,OAEAf,EAAAk0K,WAAAA,EACAl0K,EAAA84K,gBAAAA,EACA94K,EAAAwgL,UAlDA,IAAA19F,KACA,MAAApjF,EAAAygL,KAAAK,aAAA19F,IACAhjF,MAAAA,GAAAJ,EAsBA,OArBAA,EAAAI,MAAA2gL,IACA,MAAApH,EAAAkH,GAAAE,GACA,IAAApH,EACA,OACA,MAAA/5K,EAAAI,EAAAghL,WACAngL,EAAA43F,WAAA74F,IAAAA,EAAAgD,QAAAhD,EAAA8B,WAKA9B,EAAA8B,SAAAi4K,EAAA53K,WAGA43K,EAAA53K,UAAA,GACA,MAAAk/K,EAAA7gL,EAAAu5K,GAAA,EAAAA,aAAAuH,YAKA,OAJAvH,aAAAwH,UACAxH,EAAAiG,gBAAA,WACAjG,EAAA7I,aAAA,aAAA,KAEAmQ,GAEAjhL,GA2BAM,EAAA8gL,aAzBA,IAAAh+F,KACA,MAAApjF,EAAA2gL,KAAAG,aAAA19F,IACAhjF,MAAAA,GAAAJ,EAOA,OANAA,EAAAI,MAAA2gL,IACA,MAAApH,EAAAkH,GAAAE,GACA,GAAApH,EACA,OAAAv5K,EAAAu5K,GAAA,EAAAA,aAAAuH,aAGAlhL,GAiBAM,EAAA+gL,QAvDA,IAAAj+F,KACAu9F,KAAAU,WAAAj+F,IAuDA9iF,EAAAsC,OA3DA,IAAAwgF,KACAq9F,KAAA79K,UAAAwgF,IA2DA9iF,EAAAghL,aA71BA,SAAAzhL,EAAA,UAEA,CACA,MAAAgwK,EAAAC,EAAAwJ,qBACA,IAAAzJ,EACA,OAAAhvK,EAAA6uF,UAEA,MAAA6xF,EAAA1R,EAAA/7F,KAAA0tG,aACA,IAAAD,EACA,OAAA1gL,EAAA6uF,UAEA,MAAA4/D,EAAAiyB,EAAA1hL,GACA,OAAAyvJ,GACAzuJ,EAAA6uF,YAi1BApvF,EAAAmhL,WAv0BA,SAAAC,KAw0BAphL,EAAA47K,eAAAA,EACA57K,EAAAm9K,cAAAA,GACAn9K,EAAAw8K,YAAAA,GACAx8K,EAAAy8K,aAAAA,GACAz8K,EAAAq7K,WAAAA,EACAr7K,EAAA0+K,MAAAA,GACA1+K,EAAAqhL,SAjJA,CAAA/vF,EAAAnd,IACAyB,IACA,KAAA,QAAAA,GACA,OAEA,MAAA0rG,EAAA/gL,EAAAojF,UAAA/N,EAAAl0E,KACA,OAAAyyE,EAAAb,MAAAvyE,GAAAA,IAAAugL,GAAA/C,GAAAx9K,KAAAugL,IACAhwF,EAAA1b,QADA,GA4IA51E,EAAAuhL,cA1KA,CAAAjwF,EAAAnd,IACA,CAAAyB,KAAAkN,KACA,IAAA,IAAAjP,EAAA,EAAAA,EAAAM,EAAAxC,OAAAkC,IAAA,CACA,MAAA2tG,EAAA9D,GAAAvpG,EAAAN,IACA,GAAA2tG,GAAAA,EAAA5rG,EAAAzB,GACA,OAEA,OAAAmd,EAAA1b,KAAAkN,mFCrnCA,aAGE/iF,EAAOC,QAAUC,EAAQ,0GCH3B,aAEAC,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAAqhL,EAAAxhL,EAAA,mBACAM,EAAAN,EAAA,eAEA,MAAAikH,EAAA,GACA,SAAAw9D,EAAAvlG,KAAA2G,GAGA2+F,EAAAE,gBACA,MAAApS,EAAArrD,EAAAvyC,OAAAuyC,EAAAA,EAAAvyC,OAAA,GAAAryE,UAAA,KACAsiL,EAAArS,GAAAA,EAAAsS,WAAA56F,OAAA66F,YACAC,EAuBA,WACA,IAAAC,EAAA99D,EAAAA,EAAAvyC,OAAA,GACA,IAAAqwG,EACA,MAAA,GAKA,MAAAC,EAAA,GACA,KAAAD,GAAA,CACA,MAAAv5F,EAAAw5F,EAAA,GACAx5F,GAAAA,EAAA+wF,QAAAwI,EACAv5F,EAAAy5F,eAGAD,EAAAzqG,KAAA,CACAgiG,MAAAwI,EACAE,aAAA,IAGA,MAAAC,EAAAH,EAAA1iL,WAAA0iL,EAAA1iL,UAAA6zE,OACA6uG,EAAAG,GAAAA,EAAA3I,MAEA,OAAAyI,EA9CAG,GACA,GAAAR,EACAS,EAAAT,EAAArS,EAAA,GAAA,CACApzF,EAAA2G,EAAA9L,KAAA,IACAu4F,GAAAA,EAAAoR,MACAoB,EACAjrG,KAAA,EAAA0iG,MAAAA,KAAA,OAAA8I,GAAA/S,EAAAiK,EAAAhmG,WACAwD,KAAA,MACA+qG,QAGA,CACA,MAAAQ,EAAA,CAAA,eAAApmG,OAAA2G,GAEAi/F,EAAApwG,QAGA4wG,EAAA/qG,KAAA,QAgCA,SAAAuqG,GACA,MAAAS,EAAA,GAIA,OAHAT,EAAAjhL,SAAA,CAAA2hL,EAAA5uG,KACA2uG,EAAAhrG,QAAA,IAAA3D,EAAA,GAAA,CAAA,SAIA,UAAA2lG,MAAAA,EAAA0I,aAAAA,IACA,MAAA3qF,EAAA2qF,EAAA,EAAA,QAAAA,qBAAA,GACA9oF,IAAAogF,EAAAl6K,WAAA,MAAAk6K,EAAAl6K,UAAA6zE,OACAsZ,EAAA,QAAA61F,GAAA9I,EAAAl6K,UAAAk6K,EAAAhmG,KAAA4lB,KACA1M,EAAA,IAAA6K,EACA,OAAAiiF,EAAAnmG,MACA,CAAAoZ,KAAAi2F,EAAAlJ,EAAAnmG,OAAAqZ,GACA,CAAAD,EAAAC,GAXAi2F,CAAAF,OAEAD,EArCAI,CAAAb,IAEA36E,QAAAs6E,QAAAa,GAEAd,EAAAoB,gBA6CA,SAAAH,EAAArvG,GACA,MAAAoF,EAAA,GACA53E,EAAAX,OAAAW,KAAAwyE,GAOA,OANAxyE,EAAAixE,MAAA,EAAA,GAAAhxE,SAAAY,IACA+2E,EAAAjB,QAAAsrG,EAAAphL,EAAA2xE,EAAA3xE,QAEAb,EAAA8wE,OAAA,GACA8G,EAAAjB,KAAA,QAEAiB,EAGA,SAAAqqG,EAAAphL,EAAAtB,EAAAo2F,GACA,OAAAj2F,EAAAe,SAAAlB,IACAA,EAAAm0E,KAAAC,UAAAp0E,GACAo2F,EAAAp2F,EAAA,CAAA,GAAAsB,KAAAtB,MAEA,iBAAAA,GACA,kBAAAA,GACA,MAAAA,EACAo2F,EAAAp2F,EAAA,CAAA,GAAAsB,KAAAtB,KAEAqhL,EAAAsB,MAAA3iL,IACAA,EAAA0iL,EAAAphL,EAAA+/K,EAAAzH,MAAA55K,EAAAA,QAAA,GACAo2F,EAAAp2F,EAAA,CAAA,GAAAsB,SAAAtB,EAAA,MAEAG,EAAA43F,WAAA/3F,GACA,CAAA,GAAAsB,OAAAtB,EAAAb,KAAA,IAAAa,EAAAb,QAAA,OAGAa,EAAAqhL,EAAAzH,MAAA55K,GACAo2F,EAAAp2F,EAAA,CAAA,GAAAsB,KAAAtB,IAIA,SAAAiiL,EAAA/wF,EAAAi+E,EAAA/7F,EAAAsP,GACA,IAAArK,EACA,IACAA,EAAAqK,EAAAwO,KAAAxO,GAAAwO,IAEA,MAAA6U,GACA68E,EAAA78E,EAAAopE,EAAA/7F,GAEA,OAAAiF,EAEA,SAAA+6F,EAAAliF,EAAAi+E,EAAA/7F,EAAAsP,GACA,GAAAviF,EAAA43F,WAAA7G,GAAA,CACA,MAAA7Y,EAAA4pG,EAAA/wF,EAAAi+E,EAAA/7F,EAAAsP,GAMA,OALArK,GAAAl4E,EAAAmqG,UAAAjyB,IACAA,EAAAmyB,OAAAzE,IACA68E,EAAA78E,EAAAopE,EAAA/7F,MAGAiF,EAEA,MAAAqxB,EAAA,GACA,IAAA,IAAAj2B,EAAA,EAAAA,EAAAyd,EAAA3f,OAAAkC,IACAi2B,EAAAtyB,KAAAg8F,EAAAliF,EAAAzd,GAAA07F,EAAA/7F,EAAAsP,IAEA,OAAAgnB,EAEA,SAAAk5E,EAAA78E,EAAAopE,EAAA/7F,EAAAyvG,GAAA,GACA1T,GAAAA,EAAAiK,MACA,GAAAjK,EAAA,CACA,IAAA5rE,EAAA4rE,EAAAp8F,OAEA,MAAA+vG,EAAA3T,EAAAoR,MAEAwC,EAAA3vG,EACA,KAAAmwB,GAAA,CACA,MAAAy/E,EAAAz/E,EAAArtB,GACA,GAAA8sG,EACA,IAAA,IAAAvvG,EAAA,EAAAA,EAAAuvG,EAAAzxG,OAAAkC,IACA,IAAA,IAAAuvG,EAAAvvG,GAAAsyB,EAAA+8E,EAAAC,GACA,OAIAx/E,EAAAA,EAAAxwB,OAGA,MAAAkwG,EAAA9T,EAAAsS,WAAA56F,OAAAq8F,aACA,GAAAD,EAEA,YADAhB,EAAAgB,EAAA,KAAA,GAAA,CAAAl9E,EAAA+8E,EAAAC,KAMA,SAAAh9E,EAAA3yB,EAAA+vG,EAAAN,GAAA,GAGA77E,QAAAnrB,MAAAkqB,GALAq9E,CAAAr9E,EAAA3yB,EAAA+vG,EAAAN,GASA,IAAAQ,GAAA,EACAC,GAAA,EACA,MAAAC,EAAA,GACA,IAAAC,EAAA,EACA,MAAAC,EAAA,GACA,IAAAC,EAAA,KACAC,EAAA,EACA,MAAAC,EAAA,GACA,IAAAC,EAAA,KACAC,EAAA,EACA,MAAAC,EAAA1R,QAAAC,UACA,IAAA0R,EAAA,KACAC,EAAA,KAEA,SAAAC,EAAAhzF,GACA,MAAA1d,EAAAwwG,GAAAD,EACA,OAAA7yF,EAAA1d,EAAA+2B,KAAA+B,KAAApb,EAAA+T,KAAAqH,MAAApb,GAAA1d,EAkBA,SAAA2wG,EAAAC,GAOA,KAAAb,EAAAhyG,QACAgyG,EAAAxoG,SAAAqpG,EAAAf,GAAAe,EAAAC,aAAAb,EAAA,EAAAA,IACAY,IAAAH,GAAA,CACA,MAAA//F,EAtBA,SAAAkgG,GAEA,IAAA9iG,EAAAkiG,EAAA,EACAlyG,EAAAiyG,EAAAhyG,OACA,MAAA+yG,EAAAC,EAAAH,GACA,KAAA9iG,EAAAhQ,GAAA,CACA,MAAA4sG,EAAA58F,EAAAhQ,IAAA,EACAizG,EAAAhB,EAAArF,IACAoG,EAAAhjG,EAAA48F,EAAA,EAAA5sG,EAAA4sG,EAEA,OAAA58F,EAYAkjG,CAAAJ,GACAlgG,GAAA,EACAq/F,EAAAxsG,OAAAmN,EAAA,EAAAkgG,GAGAb,EAAAnsG,KAAAgtG,GAEAK,KAGA,SAAAA,IACApB,GAAAC,IACAA,GAAA,EACAU,EAAAD,EAAAx5E,KAAAm6E,IASA,SAAAC,EAAAh4B,EAAAi4B,EAAAC,EAAAhzG,GACA1xE,EAAAipF,QAAAujE,GAUAk4B,EAAAztG,QAAAu1E,GATAi4B,GACAA,EAAA7pG,SAAA4xE,EAAAA,EAAA03B,aAAAxyG,EAAA,EAAAA,IACAgzG,EAAAztG,KAAAu1E,GASA83B,IAKA,SAAAK,EAAAn4B,GACAg4B,EAAAh4B,EAAAk3B,EAAAD,EAAAE,GAEA,SAAAiB,EAAA3hF,EAAA4hF,EAAA,MACA,GAAAvB,EAAAlyG,OAAA,CAIA,IAHA0yG,EAAAe,EACAtB,EAAA,IAAA,IAAAz4F,IAAAw4F,IACAA,EAAAlyG,OAAA,EACAoyG,EAAA,EAAAA,EAAAD,EAAAnyG,OAAAoyG,IACAD,EAAAC,KAEAD,EAAA,KACAC,EAAA,EACAM,EAAA,KAEAc,EAAA3hF,EAAA4hF,IAGA,SAAAC,EAAA7hF,GACA,GAAAwgF,EAAAryG,OAAA,CACA,MAAAkwB,EAAA,IAAA,IAAAxW,IAAA24F,IAGA,GAFAA,EAAAryG,OAAA,EAEAsyG,EAEA,YADAA,EAAAzsG,QAAAqqB,GAKA,IAFAoiF,EAAApiF,EACAoiF,EAAAnrF,MAAA,CAAAvlB,EAAAyS,IAAA2+F,EAAApxG,GAAAoxG,EAAA3+F,KACAk+F,EAAA,EAAAA,EAAAD,EAAAtyG,OAAAuyG,IACAD,EAAAC,KAEAD,EAAA,KACAC,EAAA,GAGA,MAAAS,EAAAH,GAAA,MAAAA,EAAA7zF,GAAAooB,EAAAA,EAAAyrE,EAAA7zF,GACA,SAAAm0F,EAAAthF,GACAkgF,GAAA,EACAD,GAAA,EACA0B,EAAA3hF,GAQAmgF,EAAA7qF,MAAA,CAAAvlB,EAAAyS,IAAA2+F,EAAApxG,GAAAoxG,EAAA3+F,KACA,IACA,IAAA49F,EAAA,EAAAA,EAAAD,EAAAhyG,OAAAiyG,IAAA,CACA,MAAAY,EAAAb,EAAAC,GACAY,IAAA,IAAAA,EAAAc,QAEAjD,EAAAmC,EAAA,KAAA,KAIA,QACAZ,EAAA,EACAD,EAAAhyG,OAAA,EACA0zG,IACA5B,GAAA,EACAW,EAAA,MAGAT,EAAAhyG,QACAkyG,EAAAlyG,QACAqyG,EAAAryG,SACAmzG,EAAAthF,IA+DA,SAAA+hF,EAAAhW,EAAA35F,KAAA4vG,GACA,MAAAnyG,EAAAk8F,EAAAiK,MAAAnmG,OAAA9yE,EAAA6uF,UACA,IAAAtM,EAAA0iG,EACA,MAAAt7E,EAAAt0B,EAAAiT,WAAA,WAEA48F,EAAAv7E,GAAAt0B,EAAA9D,MAAA,GACA,GAAA2zG,GAAAA,KAAApyG,EAAA,CACA,MAAA+wB,EAAA,GAAA,eAAAqhF,EAAA,QAAAA,cACAj0E,OAAAA,EAAAttB,KAAAA,GAAA7Q,EAAA+wB,IAAA7jG,EAAA6uF,UACAlL,EACApB,EAAA0iG,EAAA1uG,KAAAvD,GAAAA,EAAA2Q,SAEAstB,IACA1uB,EAAA0iG,EAAA1uG,IAAAv2E,EAAAmrG,WAGA,IAAAg6E,EACAzb,EAAA52F,EAAAqyG,EAAAnlL,EAAAsiG,aAAAjtB,KAEAvC,EAAAqyG,EAAAnlL,EAAAsiG,aAAAtiG,EAAAkvF,SAAA7Z,MAGAq0F,GAAA//D,IACA+/D,EAAA52F,EAAAqyG,EAAAnlL,EAAAsiG,aAAAtiG,EAAAojF,UAAA/N,MAEAq0F,GACAuJ,EAAAvJ,EAAAsF,EAAA,EAAAzsF,GAEA,MAAA6iG,EAAAtyG,EAAAqyG,EAAA,QACA,GAAAC,EAAA,CACA,GAAApW,EAAAqW,SAGA,GAAArW,EAAAqW,QAAAF,GACA,YAHAnW,EAAAqW,QAAA,IAAAF,IAAA,EAKAlS,EAAAmS,EAAApW,EAAA,EAAAzsF,IAGA,SAAA+iG,EAAAC,EAAAjE,EAAAkE,GAAA,GACA,MAAAr1F,EAAAmxF,EAAAmE,WACArkL,EAAA+uF,EAAAxC,IAAA43F,GACA,QAAA1jL,IAAAT,EACA,OAAAA,EAEA,MAAA60F,EAAAsvF,EAAAG,MACA,IAAA5xG,EAAA,GAEA6xG,GAAA,EACA,IAAA3lL,EAAA43F,WAAA2tF,GAAA,CACA,MAAAK,EAAA3vF,IACA,MAAA4vF,EAAAP,EAAArvF,EAAAqrF,GAAA,GACAuE,IACAF,GAAA,EACA3lL,EAAA0B,OAAAoyE,EAAA+xG,MAGAL,GAAAlE,EAAAjuC,OAAAjiE,QACAkwG,EAAAjuC,OAAA9yI,QAAAqlL,GAEAL,EAAApyC,SACAyyC,EAAAL,EAAApyC,SAEAoyC,EAAAlyC,QACAkyC,EAAAlyC,OAAA9yI,QAAAqlL,GAGA,OAAA3vF,GAAA0vF,GAIA3lL,EAAAipF,QAAAgN,GACAA,EAAA11F,SAAAY,GAAA2yE,EAAA3yE,GAAA,OAGAnB,EAAA0B,OAAAoyE,EAAAmiB,GAEA9F,EAAAvC,IAAA23F,EAAAzxG,GACAA,IAVAqc,EAAAvC,IAAA23F,EAAA,MACA,MAcA,SAAAO,EAAAhlL,EAAAK,GACA,SAAAL,IAAAd,EAAA8gG,KAAA3/F,MAGAA,EAAAA,EAAAowE,MAAA,GAAA8T,QAAA,QAAA,IACArlF,EAAAk2F,OAAAp1F,EAAAK,EAAA,GAAAo0E,cAAAp0E,EAAAowE,MAAA,KACAvxE,EAAAk2F,OAAAp1F,EAAAd,EAAAojF,UAAAjiF,KACAnB,EAAAk2F,OAAAp1F,EAAAK,IAOA,IAAA4kL,EAAA,KACAC,EAAA,KAWA,SAAAC,EAAAjX,GACA,MAAA1lF,EAAAy8F,EAGA,OAFAA,EAAA/W,EACAgX,EAAAhX,GAAAA,EAAA/7F,KAAAizG,WAAA,KACA58F,EA0BA,SAAA68F,EAAAp1F,EAAAq1F,EAAAL,EAAApxF,GAEA,IAAAyxF,EACA,OAAAr1F,EAEA,GAAAA,EAAAs1F,GACA,OAAAt1F,EAEA,MAAAu1F,EAAA,IAAA/jG,KAMA+jG,EAAAC,IACAC,IAAA,GAEA,MAAAC,EAAAR,EAAAG,GACAluG,EAAA6Y,KAAAxO,GAKA,OAJA0jG,EAAAQ,GACAH,EAAAC,IACAC,GAAA,GAEAtuG,GAUA,OAPAouG,EAAAD,IAAA,EAIAC,EAAAI,IAAA,EAEAJ,EAAAC,IAAA,EACAD,EAYA,SAAAK,EAAA3X,GACA,MAAA/7F,KAAA2zG,EAAA3N,MAAAA,EAAAmH,MAAAA,EAAAyG,UAAAA,EAAA/zG,MAAAA,EAAAg0G,cAAAA,GAAA/oF,MAAAA,EAAAgvE,MAAAA,EAAAiY,KAAAA,EAAAjjL,OAAAA,EAAAglL,YAAAA,EAAAluB,KAAAA,EAAAmuB,WAAAA,EAAAZ,IAAAA,EAAAa,aAAAA,GAAAjY,EACA,IAAAj4F,EACA,MAAAuS,EAAA28F,EAAAjX,GACA,IACA,IAAAkY,EACA,GAAA,EAAAjO,EAAAkO,UAAA,CAGA,MAAAC,EAAAP,GAAAzG,EACArpG,EAAAswG,GAAAtlL,EAAAgoG,KAAAq9E,EAAAA,EAAAL,EAAAj0G,EAAAk0G,EAAAnuB,EAAAutB,IACAc,EAAAna,MAEA,CAEA,MAAAhrK,EAAA6kL,EAEA,EACA7vG,EAAAswG,GAAAtlL,EAAAqvE,OAAA,EACArvE,EAAA+wE,EASA,CAAAi6F,MAAAA,EAAAhvE,MAAAA,EAAAinF,KAAAA,IACAjjL,EAAA+wE,EAAA,OACAo0G,EAAAN,EAAA9zG,MACAi6F,EACAua,EAAAva,GAKA,IAAAngF,EAAA7V,EAKA,GAAAmwG,IAAA,IAAAD,EAAA,CACA,MAAA3mL,EAAAX,OAAAW,KAAA4mL,IACAC,UAAAA,GAAAv6F,EACAtsF,EAAA8wE,SACA,EAAA+1G,GACA,EAAAA,KACAL,GAAAxmL,EAAAyyE,KAAA/yE,EAAA2pG,mBAKAu9E,EAAAK,EAAAL,EAAAJ,IAEAl6F,EAAA46F,GAAA56F,EAAAs6F,IAKA,EAMAjO,EAAAwO,OAEA76F,EAAA66F,KAAA76F,EAAA66F,KAAA76F,EAAA66F,KAAAzpF,OAAAi7E,EAAAwO,MAAAxO,EAAAwO,MAGAxO,EAAAmF,aAEAxxF,EAAAwxF,WAAAnF,EAAAmF,YAIArnG,EAAA6V,EAGA,MAAAgZ,GACA8hF,GAAAt2G,OAAA,EACAqxG,EAAA78E,EAAAopE,EAAA,GACAj4F,EAAAijG,GAAA2N,IAGA,OADA1B,EAAA38F,GACAvS,EA8BA,SAAA6wG,EAAAlyG,GACA,IAAAmyG,EACA,IAAA,IAAAv0G,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAnB,EAAApC,GACA,IAAA4P,GAAArM,GAaA,OAXA,GAAAA,EAAA5D,OAAA00G,IAAA,SAAA9wG,EAAAnB,SAAA,CACA,GAAAmyG,EAEA,OAGAA,EAAAhxG,GAQA,OAAAgxG,EAEA,MAAAP,EAAAva,IACA,IAAA70F,EACA,IAAA,MAAA/2E,KAAA4rK,GACA,UAAA5rK,GAAA,UAAAA,GAAAnB,EAAA8gG,KAAA3/F,OACA+2E,IAAAA,EAAA,KAAA/2E,GAAA4rK,EAAA5rK,IAGA,OAAA+2E,GAEAqvG,EAAA,CAAAxa,EAAAj6F,KACA,MAAAoF,EAAA,GACA,IAAA,MAAA/2E,KAAA4rK,EACA/sK,EAAA2pG,gBAAAxoG,IAAAA,EAAAowE,MAAA,KAAAuB,IACAoF,EAAA/2E,GAAA4rK,EAAA5rK,IAGA,OAAA+2E,GA6DA,SAAA4vG,EAAAC,EAAAC,EAAAC,GACA,MAAAC,EAAAvoL,OAAAW,KAAA0nL,GACA,GAAAE,EAAA92G,SAAAzxE,OAAAW,KAAAynL,GAAA32G,OACA,OAAA,EAEA,IAAA,IAAAkC,EAAA,EAAAA,EAAA40G,EAAA92G,OAAAkC,IAAA,CACA,MAAAnyE,EAAA+mL,EAAA50G,GACA,GAAA00G,EAAA7mL,KAAA4mL,EAAA5mL,KACA2kL,EAAAmC,EAAA9mL,GACA,OAAA,EAGA,OAAA,EAEA,SAAAgnL,GAAAlP,MAAAA,EAAArmG,OAAAA,GAAAvxE,GAEA,KAAAuxE,GAAAA,EAAAw1G,UAAAnP,IACAA,EAAArmG,EAAAqmG,OAAA53K,GAAAA,EACAuxE,EAAAA,EAAAA,OAIA,MA0BAy1G,EAtBA,CACArpL,KAAA,WAKAspL,cAAA,EACAtlL,QAAAulL,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,EAEAC,GACA,MAAAJ,EAcA,SAAAtP,EAAAH,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,EAAAC,GACA,MAAAt1G,EAAAu1G,EAAAvM,GAAAzM,cAAAA,IAAA+Y,EACAE,EAAAjZ,EAAA,OACAkZ,EAAA7P,EAAA6P,SAAAC,EAAA9P,EAAA0F,EAAAD,EAAA5F,EAAA+P,EAAArZ,EAAAK,EAAA4Y,EAAAC,EAAAC,GAEAC,EAAA,KAAAE,EAAAE,cAAA/P,EAAAgQ,UAAAJ,EAAA,KAAAnK,EAAAoK,EAAAjZ,EAAA4Y,GAEAK,EAAAI,KAAA,GAGAN,EAAA,KAAA3P,EAAAkQ,WAAArQ,EAAAtJ,EAAAkP,EAAA,KACA7O,EAAA4Y,GACAW,EAAAN,EAAA7P,EAAAkQ,aAIAL,EAAA3W,UA7BAkX,CAAAb,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,EAAAC,GAgCA,SAAAJ,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAA7O,EAAA4Y,EAAAC,GAAAr1G,EAAAu1G,EAAAU,GAAAC,EAAAlN,GAAAzM,cAAAA,KACA,MAAAkZ,EAAAN,EAAAM,SAAAP,EAAAO,SACAA,EAAA7P,MAAAuP,EACAA,EAAAnnL,GAAAknL,EAAAlnL,GACA,MAAAmoL,EAAAhB,EAAAS,UACAQ,EAAAjB,EAAAW,YACAO,aAAAA,EAAAV,cAAAA,EAAAW,aAAAA,EAAAC,YAAAA,GAAAd,EACA,GAAAE,EACAF,EAAAE,cAAAQ,EACAK,GAAAL,EAAAR,IAEAJ,EAAAI,EAAAQ,EAAAV,EAAAD,gBAAA,KAAAnK,EAAAoK,EAAAjZ,EAAA4Y,EAAAC,GACAI,EAAAI,MAAA,EACAJ,EAAA3W,UAEAwX,IACAf,EAAAc,EAAAD,EAAA3Q,EAAAtJ,EAAAkP,EAAA,KACA7O,EAAA4Y,EAAAC,GACAU,EAAAN,EAAAW,MAKAX,EAAAgB,YACAF,GAIAd,EAAAc,aAAA,EACAd,EAAAY,aAAAV,GAGAO,EAAAP,EAAAtK,EAAAoK,GAIAA,EAAAI,KAAA,EAEAJ,EAAAiB,QAAA34G,OAAA,EAEA03G,EAAAD,gBAAAjZ,EAAA,OACA+Z,GAEAf,EAAA,KAAAY,EAAAV,EAAAD,gBAAA,KAAAnK,EAAAoK,EAAAjZ,EAAA4Y,EAAAC,GACAI,EAAAI,MAAA,EACAJ,EAAA3W,WAGAyW,EAAAc,EAAAD,EAAA3Q,EAAAtJ,EAAAkP,EAAA,KACA7O,EAAA4Y,EAAAC,GACAU,EAAAN,EAAAW,KAGAC,GAAAG,GAAAL,EAAAE,IAEAd,EAAAc,EAAAF,EAAA1Q,EAAAtJ,EAAAkP,EAAAoK,EAAAjZ,EAAA4Y,EAAAC,GAEAI,EAAA3W,SAAA,KAIAyW,EAAA,KAAAY,EAAAV,EAAAD,gBAAA,KAAAnK,EAAAoK,EAAAjZ,EAAA4Y,EAAAC,GACAI,EAAAI,MAAA,GACAJ,EAAA3W,iBAMA,GAAAuX,GAAAG,GAAAL,EAAAE,GAEAd,EAAAc,EAAAF,EAAA1Q,EAAAtJ,EAAAkP,EAAAoK,EAAAjZ,EAAA4Y,EAAAC,GACAU,EAAAN,EAAAU,OAEA,CAGA,MAAAQ,EAAAxB,EAAA11G,OAAA01G,EAAA11G,MAAAk3G,UAQA,GAPAhqL,EAAA43F,WAAAoyF,IACAA,IAGAlB,EAAAE,cAAAQ,EACAV,EAAAgB,YACAlB,EAAA,KAAAY,EAAAV,EAAAD,gBAAA,KAAAnK,EAAAoK,EAAAjZ,EAAA4Y,EAAAC,GACAI,EAAAI,MAAA,EAEAJ,EAAA3W,cAEA,CACA,MAAA8E,QAAAA,EAAA6S,UAAAA,GAAAhB,EACA7R,EAAA,EACAD,YAAA,KACA8R,EAAAgB,YAAAA,GACAhB,EAAAmB,SAAAR,KAEAxS,GAEA,IAAAA,GACA6R,EAAAmB,SAAAR,KAhIAS,CAAA3B,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAA7O,EAAA4Y,EAAAC,EAAAC,IAGAnI,QAoTA,SAAAptG,EAAA6lG,EAAAyF,EAAAC,EAAA9O,EAAA4Y,EAAAC,EAAAC,EAAAwB,GAEA,MAAArB,EAAA7P,EAAA6P,SAAAC,EAAA9P,EAAA0F,EAAAD,EAAAtrG,EAAAs8F,WAAApuK,SAAAsuK,cAAA,OAAA,KAAAC,EAAA4Y,EAAAC,EAAAC,GAAA,GAOA5xG,EAAAozG,EAAA/2G,EAAA01G,EAAAE,cAAA/P,EAAAgQ,UAAAvK,EAAAoK,EAAAL,EAAAC,GACA,IAAAI,EAAAI,MACAJ,EAAA3W,UAEA,OAAAp7F,GAhUA12E,OAAA0oL,EACA/2E,UAkUA,SAAAinE,GACA,MAAAkO,UAAAA,EAAAzxG,SAAAA,GAAAujG,EACAmR,EAAA,GAAAjD,EACAlO,EAAAgQ,UAAAoB,EAAAD,EAAA10G,EAAAp2E,QAAAo2E,GACAujG,EAAAkQ,WAAAiB,EACAC,EAAA30G,EAAAu0G,UACAjQ,GAAAsQ,WAvMA,SAAAvB,EAAA9P,EAAArmG,EAAA8rG,EAAA5F,EAAA+P,EAAArZ,EAAAK,EAAA4Y,EAAAC,EAAAC,EAAAiB,GAAA,GACA,MAAAv2G,EAAAu1G,EAAAv9F,EAAAk/F,EAAAjB,GAAAC,EAAAnpL,EAAAmpF,EAAA8yF,GAAA3M,WAAAA,EAAA7lE,OAAAA,IAAA8+E,EACA1R,EAAAj3K,EAAAmrG,SAAA8tE,EAAAnmG,OAAAmmG,EAAAnmG,MAAAmkG,SACA6R,EAAA,CACA7P,MAAAA,EACArmG,OAAAA,EACA8rG,gBAAAA,EACA7O,MAAAA,EACAiJ,UAAAA,EACA+P,gBAAAA,EACArZ,OAAAA,EACA0Z,KAAA,EACAY,UAAA,EACA7S,QAAA,iBAAAA,EAAAA,GAAA,EACAyS,aAAA,KACAV,cAAA,KACAW,cAAA,EACAC,YAAAA,EACAY,aAAA,EACAT,QAAA,GACA/mL,QAAAynL,GAAA,GACA,MAAAxR,MAAAA,EAAAyQ,aAAAA,EAAAV,cAAAA,EAAAc,UAAAA,EAAAC,QAAAA,EAAArL,gBAAAA,EAAA5F,UAAAA,GAAAgQ,EACA,GAAAA,EAAAc,YACAd,EAAAc,aAAA,OAEA,IAAAa,EAAA,CACA,MAAAC,EAAAhB,GACAV,EAAA5K,YACA,WAAA4K,EAAA5K,WAAAv3F,KACA6jG,IACAhB,EAAAtL,WAAAuM,WAAA,KACAb,IAAAhB,EAAAgB,WACAS,EAAAvB,EAAAlQ,EAAAtJ,EAAA,KAKA,IAAAA,OAAAA,GAAAsZ,EAEAY,IAGAla,EAAAjmF,EAAAmgG,GACAH,EAAAG,EAAAhL,EAAAoK,GAAA,IAEA4B,GAEAH,EAAAvB,EAAAlQ,EAAAtJ,EAAA,GAGA4Z,EAAAN,EAAAE,GACAF,EAAAE,cAAA,KACAF,EAAAa,cAAA,EAGA,IAAA/2G,EAAAk2G,EAAAl2G,OACAg4G,GAAA,EACA,KAAAh4G,GAAA,CACA,GAAAA,EAAAo2G,cAAA,CAGAp2G,EAAAm3G,QAAA9yG,QAAA8yG,GACAa,GAAA,EACA,MAEAh4G,EAAAA,EAAAA,OAGAg4G,GACAjG,EAAAoF,GAEAjB,EAAAiB,QAAA,GAEA,MAAAc,EAAA5R,EAAAnmG,OAAAmmG,EAAAnmG,MAAA+3G,UACA7qL,EAAA43F,WAAAizF,IACAA,KAGA7nL,SAAA8nL,GACA,IAAAhC,EAAAE,cACA,OAEA,MAAA/P,MAAAA,EAAAyQ,aAAAA,EAAAhL,gBAAAA,EAAA5F,UAAAA,EAAAjJ,MAAAA,GAAAiZ,EAEAiC,EAAA9R,EAAAnmG,OAAAmmG,EAAAnmG,MAAAi4G,WACA/qL,EAAA43F,WAAAmzF,IACAA,IAEA,MAAAvb,EAAAjmF,EAAAmgG,GACAsB,EAAA,KACAlC,EAAAa,eAIAf,EAAA,KAAAkC,EAAAhS,EAAAtJ,EAAAkP,EAAA,KACA7O,EAAA4Y,EAAAC,GACAU,EAAAN,EAAAgC,KAEAJ,EAAAI,EAAA1M,YAAA,WAAA0M,EAAA1M,WAAAv3F,KACA6jG,IACAhB,EAAAtL,WAAAuM,WAAAK,GAGAzB,EAAAG,EAAAhL,EAAA,MACA,GAEAoK,EAAAa,cAAA,EACAe,GACAM,KAGAhoL,KAAA81K,EAAAtJ,EAAAv8F,GACA61G,EAAAY,cACAa,EAAAzB,EAAAY,aAAA5Q,EAAAtJ,EAAAv8F,GACA61G,EAAAhQ,UAAAA,GAEAvvF,KAAA,IACAu/F,EAAAY,cAAAngG,EAAAu/F,EAAAY,cAEA1mL,YAAAgsK,EAAAic,GACA,MAAAC,IAAApC,EAAAE,cACAkC,GACApC,EAAAI,OAEA,MAAAiC,EAAAnc,EAAAiK,MAAA53K,GACA2tK,EACAoc,SAAA/gF,OAAAzE,IACA68E,EAAA78E,EAAAopE,EAAA,MAEA5kE,MAAAihF,IAGA,GAAArc,EAAAwb,aACA1B,EAAA0B,aACA1B,EAAAgB,YAAA9a,EAAAsc,WACA,OAGAtc,EAAAuc,eAAA,EACA,MAAAtS,MAAAA,GAAAjK,EACAwc,GAAAxc,EAAAqc,GAAA,GACAF,IAGAlS,EAAA53K,GAAA8pL,GAEA,MAAAjkD,GAAAikD,GAAAnc,EAAAoZ,QAAA/mL,GACA4pL,EAAAjc,EAAAiK,EAIAvJ,EAAAyb,GAAAnc,EAAAoZ,QAAA/mL,IAGA8pL,EAAA,KAAA5hG,EAAAylF,EAAAoZ,SAAAU,EAAAjZ,EAAA6Y,GACAxhD,GACAr9B,EAAAq9B,GAEAihD,EAAAnZ,EAAAiK,EAAA53K,IAEA6pL,GAAA,KAAApC,EAAAI,MACAJ,EAAA3W,cAIAnvK,QAAA27K,EAAA8M,GACA3C,EAAA0B,aAAA,EACA1B,EAAAY,cACAH,EAAAT,EAAAY,aAAAhL,EAAAC,EAAA8M,GAEA3C,EAAAE,eACAO,EAAAT,EAAAE,cAAAtK,EAAAC,EAAA8M,KAIA,OAAA3C,EA0BA,SAAAuB,EAAAhiG,GACA,IAAAsxE,EACA,GAAA35J,EAAA43F,WAAAvP,GAAA,CACA,MAAAqjG,EAAArjG,EAAAq+F,GACAgF,IAIArjG,EAAAk+F,IAAA,EACAoF,MAEAtjG,EAAAA,IACAqjG,IACArjG,EAAAk+F,IAAA,EACA5sB,EAAAiyB,GACAC,MAGA,GAAA7rL,EAAAipF,QAAAZ,GAAA,CACA,MAAAyjG,EAAAlE,EAAAv/F,GACAA,EAAAyjG,EAMA,OAJAzjG,EAAAg/F,GAAAh/F,GACAsxE,IACAtxE,EAAA0jG,gBAAApyB,EAAAz/E,QAAAtB,GAAAA,IAAAyP,KAEAA,EAEA,SAAA2jG,EAAAj7F,EAAA+3F,GACAA,GAAAA,EAAAE,cACAhpL,EAAAipF,QAAA8H,GACA+3F,EAAAiB,QAAA9yG,QAAA8Z,GAGA+3F,EAAAiB,QAAA9yG,KAAA8Z,GAIA4zF,EAAA5zF,GAGA,SAAAq4F,EAAAN,EAAAlwF,GACAkwF,EAAAY,aAAA9wF,EACA,MAAAqgF,MAAAA,EAAAyF,gBAAAA,GAAAoK,EACAznL,EAAA43K,EAAA53K,GAAAu3F,EAAAv3F,GAGAq9K,GAAAA,EAAA0J,UAAAnP,IACAyF,EAAAzF,MAAA53K,GAAAA,EACA8mL,EAAAzJ,EAAAr9K,IAIA,SAAA4qL,EAAA9qL,EAAAtB,GACA,GAAAqsL,GACA,CACA,IAAAC,EAAAD,GAAAC,SAMA,MAAAC,EAAAF,GAAAt5G,QAAAs5G,GAAAt5G,OAAAu5G,SACAC,IAAAD,IACAA,EAAAD,GAAAC,SAAAxsL,OAAAU,OAAA+rL,IAGAD,EAAAhrL,GAAAtB,QAGA,SAAAwsL,EAAAlrL,EAAAmrL,EAAAC,GAAA,GAGA,MAAAvd,EAAAkd,IAAAnG,EACA,GAAA/W,EAAA,CAIA,MAAAmd,EAAA,MAAAnd,EAAAp8F,OACAo8F,EAAAiK,MAAAqI,YAAAtS,EAAAiK,MAAAqI,WAAA6K,SACAnd,EAAAp8F,OAAAu5G,SACA,GAAAA,GAAAhrL,KAAAgrL,EAEA,OAAAA,EAAAhrL,GAEA,GAAAqhF,UAAApR,OAAA,EACA,OAAAm7G,GAAAvsL,EAAA43F,WAAA00F,GACAA,IACAA,GAWA,MAAAE,GAAA,GAEA,SAAAC,GAAAvrG,EAAAsrE,EAAA1rJ,GACA,OAAA4rL,GAAAxrG,EAAAsrE,EAAA1rJ,GAEA,SAAA4rL,GAAAxrG,EAAAsrE,GAAAmgC,UAAAA,EAAAC,KAAAA,EAAAC,MAAAA,EAAAC,QAAAA,EAAAC,UAAAA,GAAA/sL,EAAA6uF,UAAAmgF,EAAAkd,IACA,IAAArL,EAoDAmM,EAnDAC,GAAA,EACAC,GAAA,EA8CA,GA7CAhM,EAAAsB,MAAAthG,IACA2/F,EAAA,IAAA3/F,EAAArhF,MACAotL,IAAA/rG,EAAAisG,UAEAjM,EAAAkM,WAAAlsG,IACA2/F,EAAA,IAAA3/F,EACA0rG,GAAA,GAEA5sL,EAAAipF,QAAA/H,IACAgsG,GAAA,EACAD,EAAA/rG,EAAAnO,KAAAmuG,EAAAkM,YACAvM,EAAA,IAAA3/F,EAAA3K,KAAA8R,GACA64F,EAAAsB,MAAAn6F,GACAA,EAAAxoF,MAEAqhL,EAAAkM,WAAA/kG,GACAglG,GAAAhlG,GAEAroF,EAAA43F,WAAAvP,GACAy5F,EAAAz5F,EAAA2mF,EAAA,QADA,KASA6R,EAHA7gL,EAAA43F,WAAA1W,GACAsrE,EAEA,IAAAs1B,EAAA5gG,EAAA8tF,EAAA,GAIA,KACA,IAAAA,IAAAA,EAAAwb,YAMA,OAHAwC,GACAA,IAEA/Z,EAAA/xF,EAAA8tF,EAAA,EAAA,CAAAse,KAKAttL,EAAAiB,KAEAurJ,GAAAogC,EAAA,CACA,MAAAW,EAAA1M,EACAA,EAAA,IAAAwM,GAAAE,KAGA,IAAAD,EAAAv8F,IACAi8F,EAAAQ,EAAA1sL,QAAA2sL,OAAA,KACA3L,EAAA/wF,EAAAi+E,EAAA,KAKA,GAAA0e,GAaA,OAXAJ,EAAAttL,EAAAiB,KACAurJ,EAGAmgC,GACA1Z,EAAAzmB,EAAAwiB,EAAA,EAAA,CACA6R,SACAh/K,EACAyrL,IANAzM,IASA7gL,EAAAiB,KAEA,IAAA2pG,EAAAsiF,EAAA,GAAAV,GACA,MAAAvI,EAAA,KACA,GAAAuJ,EAAAzI,OAGA,GAAAv4B,EAAA,CAEA,MAAA4uB,EAAAoS,KACAZ,GACAK,IACAC,EACA9R,EAAAroG,MAAA,CAAAk+F,EAAA39F,IAAAtzE,EAAA2qG,WAAAsmE,EAAArmE,EAAAt3B,MACAtzE,EAAA2qG,WAAAywE,EAAAxwE,OAGAoiF,GACAA,IAEA/Z,EAAAzmB,EAAAwiB,EAAA,EAAA,CACAoM,EAEAxwE,IAAA4hF,QAAA3qL,EAAA+oG,EACA0iF,IAEA1iF,EAAAwwE,QAKAoS,KAMA,IAAAG,EADA1J,EAAAC,eAAA13B,EAGAmhC,EADA,SAAAd,EACA5I,EAEA,SAAA4I,EACA,IAAAe,GAAA3J,EAAAjV,GAAAA,EAAA8Z,UAIA,MACA9Z,GAAAA,EAAA6e,UA9mCA,SAAArhC,GACAg4B,EAAAh4B,EAAA+2B,EAAAD,EAAAE,GA8mCAsK,CAAA7J,GAKAA,KAIA,MAAAuJ,EAAAtM,EAAA6M,OAAAlN,EAAA,CACA9F,MAAA,EACA+R,QAAAA,EACAC,UAAAA,EACAY,UAAAA,IAkBA,OAhBAK,GAAAR,EAAAxe,GAEAxiB,EACAmgC,EACA1I,IAGAr5E,EAAA4iF,IAGA,SAAAX,EACAe,GAAAJ,EAAAxe,GAAAA,EAAA8Z,UAGA0E,IAEA,KACAtM,EAAAx0C,KAAA8gD,GACAxe,GACAhvK,EAAA6pG,OAAAmlE,EAAA+a,QAAAyD,IAKA,SAAAS,GAAA/sG,EAAArhF,EAAAiB,GACA,MAAAotL,EAAA/hF,KAAAi0E,MACAS,EAAA7gL,EAAAe,SAAAmgF,GACAA,EAAAtG,SAAA,KACAuzG,GAAAD,EAAAhtG,GACA,IAAAgtG,EAAAhtG,GACAA,EAAA4jB,KAAAopF,EAAAA,GACA,IAAA1hC,EAQA,OAPAxsJ,EAAA43F,WAAA/3F,GACA2sJ,EAAA3sJ,GAGA2sJ,EAAA3sJ,EAAA6pK,QACA5oK,EAAAjB,GAEA6sL,GAAA7L,EAAAr0B,EAAA1nD,KAAAopF,GAAAptL,EAAAqrG,MAEA,SAAAgiF,GAAA/H,EAAAtnL,GACA,MAAAsvL,EAAAtvL,EAAAmtF,MAAA,KACA,MAAA,KACA,IAAAmX,EAAAgjF,EACA,IAAA,IAAA9yG,EAAA,EAAAA,EAAA86G,EAAAh9G,QAAAgyB,EAAA9vB,IACA8vB,EAAAA,EAAAgrF,EAAA96G,IAEA,OAAA8vB,GAGA,SAAAiqF,GAAAxtL,EAAAojG,EAAA,IAAAnY,KACA,IAAA9qF,EAAA2lF,SAAA9lF,IACAojG,EAAA/X,IAAArrF,IACAA,EAAA,SACA,OAAAA,EAGA,GADAojG,EAAA9X,IAAAtrF,GACAqhL,EAAAsB,MAAA3iL,GACAwtL,GAAAxtL,EAAAA,MAAAojG,QAEA,GAAAjjG,EAAAipF,QAAAppF,GACA,IAAA,IAAAyzE,EAAA,EAAAA,EAAAzzE,EAAAuxE,OAAAkC,IACA+5G,GAAAxtL,EAAAyzE,GAAA2vB,QAGA,GAAAjjG,EAAAspG,MAAAzpG,IAAAG,EAAAmpG,MAAAtpG,GACAA,EAAAU,SAAA0wK,IACAoc,GAAApc,EAAAhuE,WAGA,GAAAjjG,EAAAwpG,cAAA3pG,GACA,IAAA,MAAAsB,KAAAtB,EACAwtL,GAAAxtL,EAAAsB,GAAA8hG,GAGA,OAAApjG,EAGA,SAAA64K,KACA,MAAAzjD,EAAA,CACA44D,WAAA,EACAQ,WAAA,EACAC,cAAA,EACAC,cAAA,IAAAp/F,KAQA,OANAq/F,IAAA,KACAv5D,EAAA44D,WAAA,KAEAY,IAAA,KACAx5D,EAAAq5D,cAAA,KAEAr5D,EAEA,MAAAy5D,GAAA,CAAA1sL,SAAAgoG,OAoGA6pE,GAnGA,CACA70K,KAAA,iBACA8zE,MAAA,CACA+T,KAAArU,OACAm8G,OAAAnlG,QACAolG,UAAAplG,QAEA+rF,cAAAmZ,GACAlZ,QAAAkZ,GACAG,aAAAH,GACAjZ,iBAAAiZ,GAEAI,cAAAJ,GACAhZ,QAAAgZ,GACAK,aAAAL,GACA/Y,iBAAA+Y,GAEA9Y,eAAA8Y,GACA7Y,SAAA6Y,GACAM,cAAAN,GACA5Y,kBAAA4Y,IAEA1rL,MAAA8vE,GAAAirB,MAAAA,IACA,MAAAixE,EAAAyJ,KACAxjD,EAAAyjD,KACA,IAAAuW,EACA,MAAA,KACA,MAAAv5G,EAAAqoB,EAAAz+F,SAAAs6K,GAAA77E,EAAAz+F,WAAA,GACA,IAAAo2E,IAAAA,EAAAtE,OACA,OAIA,MAAA4jG,EAAAkM,EAAAzH,MAAA3mG,IACA+T,KAAAA,GAAAmuF,EAEAn+F,EAAAnB,EAAA,GACA,GAAAu/C,EAAAo5D,UACA,OAAAa,GAAAr4G,GAIA,MAAAs4G,EAAAC,GAAAv4G,GACA,IAAAs4G,EACA,OAAAD,GAAAr4G,GAEA,MAAAw4G,EAAAvV,GAAAqV,EAAAna,EAAA//C,EAAA+5C,GACA6K,GAAAsV,EAAAE,GACA,MAAAC,EAAAtgB,EAAAoZ,QACAmH,EAAAD,GAAAF,GAAAE,GACA,IAAAE,GAAA,EACA,MAAAC,iBAAAA,GAAAN,EAAAl8G,KACA,GAAAw8G,EAAA,CACA,MAAAtuL,EAAAsuL,SACA5tL,IAAAotL,EACAA,EAAA9tL,EAEAA,IAAA8tL,IACAA,EAAA9tL,EACAquL,GAAA,GAIA,GAAAD,GACAA,EAAAt8G,OAAA00G,MACAkC,GAAAsF,EAAAI,IAAAC,GAAA,CACA,MAAAE,EAAA5V,GAAAyV,EAAAva,EAAA//C,EAAA+5C,GAIA,GAFA6K,GAAA0V,EAAAG,GAEA,WAAA7oG,EAOA,OANAouC,EAAAo5D,WAAA,EAEAqB,EAAA/E,WAAA,KACA11D,EAAAo5D,WAAA,EACArf,EAAAlN,UAEAotB,GAAAr4G,GAEA,WAAAgQ,GAAAsoG,EAAAl8G,OAAA00G,KACA+H,EAAAC,WAAA,CAAAtuL,EAAAuuL,EAAAC,KACAC,GAAA76D,EAAAs6D,GACA/8G,OAAA+8G,EAAApuL,MAAAouL,EAEAluL,EAAA0uL,SAAA,KACAH,IACAvuL,EAAA0uL,cAAAluL,SACAwtL,EAAAQ,cAEAR,EAAAQ,aAAAA,IAIA,OAAAh5G,KAOA,SAAAi5G,GAAA76D,EAAAgkD,GACA,MAAAsV,cAAAA,GAAAt5D,EACA,IAAA+6D,EAAAzB,EAAA5gG,IAAAsrF,EAAAhmG,MAKA,OAJA+8G,IACAA,EAAArwL,OAAAU,OAAA,MACAkuL,EAAA3gG,IAAAqrF,EAAAhmG,KAAA+8G,IAEAA,EAIA,SAAAlW,GAAAb,EAAAnmG,EAAAmiD,EAAA+5C,GACA,MAAA2f,OAAAA,EAAA9nG,KAAAA,EAAA+nG,UAAAA,GAAA,EAAArZ,cAAAA,EAAAC,QAAAA,EAAAqZ,aAAAA,EAAApZ,iBAAAA,EAAAqZ,cAAAA,EAAApZ,QAAAA,EAAAqZ,aAAAA,EAAApZ,iBAAAA,EAAAC,eAAAA,EAAAC,SAAAA,EAAAmZ,cAAAA,EAAAlZ,kBAAAA,GAAAhjG,EACA3xE,EAAAqxE,OAAAymG,EAAA93K,KACA6uL,EAAAF,GAAA76D,EAAAgkD,GACApE,EAAA,CAAAC,EAAAvyF,KACAuyF,GACA7B,EAAA6B,EAAA9F,EAAA,EAAAzsF,IAEA0tG,EAAA,CACAppG,KAAAA,EACA+nG,UAAAA,EACA5rL,YAAA3B,GACA,IAAAyzK,EAAAS,EACA,IAAAtgD,EAAA44D,UAAA,CACA,IAAAc,EAIA,OAHA7Z,EAAAc,GAAAL,EAOAl0K,EAAA0uL,UACA1uL,EAAA0uL,UAAA,GAGA,MAAAG,EAAAF,EAAA7uL,GACA+uL,GACArG,GAAA5Q,EAAAiX,IACAA,EAAA7uL,GAAA0uL,UAEAG,EAAA7uL,GAAA0uL,WAEAlb,EAAAC,EAAA,CAAAzzK,KAEA2B,MAAA3B,GACA,IAAAyzK,EAAAU,EACA2a,EAAAtB,EACAuB,EAAA3a,EACA,IAAAxgD,EAAA44D,UAAA,CACA,IAAAc,EAMA,OALA7Z,EAAAe,GAAAL,EACA2a,EAAAnB,GAAAH,EACAuB,EAAAta,GAAAL,EAMA,IAAA4a,GAAA,EACA,MAAApa,EAAA50K,EAAA44K,SAAAqW,IACAD,IAEAA,GAAA,EAEAxb,EADAyb,EACAF,EAGAD,EAHA,CAAA9uL,IAKA4uL,EAAAJ,cACAI,EAAAJ,eAEAxuL,EAAA44K,cAAAp4K,IAEAizK,GACAA,EAAAzzK,EAAA40K,GACAnB,EAAA1jG,QAAA,GACA6kG,KAIAA,KAGAjzK,MAAA3B,EAAAwoG,GACA,MAAA1oG,EAAAqxE,OAAAymG,EAAA93K,KAIA,GAHAE,EAAA44K,UACA54K,EAAA44K,UAAA,GAEAhlD,EAAAq5D,aACA,OAAAzkF,IAEAgrE,EAAAia,EAAA,CAAAztL,IACA,IAAAgvL,GAAA,EACA,MAAApa,EAAA50K,EAAA0uL,SAAAO,IACAD,IAEAA,GAAA,EACAxmF,IAEAgrE,EADAyb,EACA3a,EAGAoZ,EAHA,CAAA1tL,IAKAA,EAAA0uL,cAAAluL,EACAmuL,EAAA7uL,KAAA83K,UACA+W,EAAA7uL,KAGA6uL,EAAA7uL,GAAA83K,EACAvD,GACAA,EAAAr0K,EAAA40K,GACAP,EAAAtkG,QAAA,GACA6kG,KAIAA,KAGAz0C,MAAAy3C,GACAa,GAAAb,EAAAnmG,EAAAmiD,EAAA+5C,IAGA,OAAAihB,EAMA,SAAAf,GAAAjW,GACA,GAAAsX,GAAAtX,GAGA,OAFAA,EAAAuO,GAAAvO,IACAvjG,SAAA,KACAujG,EAGA,SAAAmW,GAAAnW,GACA,OAAAsX,GAAAtX,GACAA,EAAAvjG,SACAujG,EAAAvjG,SAAA,QACA7zE,EACAo3K,EAEA,SAAAY,GAAAZ,EAAAgX,GACA,EAAAhX,EAAAkO,WAAAlO,EAAAl6K,UACA86K,GAAAZ,EAAAl6K,UAAAqpL,QAAA6H,GAEA,IAAAhX,EAAAkO,WACAlO,EAAAgQ,UAAA7K,WAAA6R,EAAAzuD,MAAAy3C,EAAAgQ,WACAhQ,EAAAkQ,WAAA/K,WAAA6R,EAAAzuD,MAAAy3C,EAAAkQ,aAGAlQ,EAAAmF,WAAA6R,EAGA,SAAArW,GAAAlkG,EAAA86G,GAAA,GACA,IAAAl4F,EAAA,GACAm4F,EAAA,EACA,IAAA,IAAAn9G,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAnB,EAAApC,GAEAuD,EAAA5D,OAAA0mG,IACA,IAAA9iG,EAAAgL,WACA4uG,IACAn4F,EAAAA,EAAA0F,OAAA47E,GAAA/iG,EAAAnB,SAAA86G,MAGAA,GAAA35G,EAAA5D,OAAA00G,KACArvF,EAAArhB,KAAAJ,GAOA,GAAA45G,EAAA,EACA,IAAA,IAAAn9G,EAAA,EAAAA,EAAAglB,EAAAlnB,OAAAkC,IACAglB,EAAAhlB,GAAAuO,WAAA,EAGA,OAAAyW,EAIA,SAAAo4F,GAAA5vL,GACA,OAAAd,EAAA43F,WAAA92F,GAAA,CAAA6vL,MAAA7vL,EAAA9B,KAAA8B,EAAA9B,MAAA8B,EAGA,MAAA8vL,GAAAt9G,KAAAA,EAAAL,KAAA49G,cA2HA,SAAAC,GAAAvL,GAAAtM,OAAA8X,IAAAA,EAAAj+G,MAAAA,EAAA4C,SAAAA,KACA,MAAAujG,EAAAe,GAAAuL,EAAAzyG,EAAA4C,GAGA,OADAujG,EAAA8X,IAAAA,EACA9X,EAGA,MAAAsX,GAAAtX,GAAAA,EAAAhmG,KAAA+9G,cAkMAC,GAjMA,CACAjyL,KAAA,YAIAgyL,eAAA,EACAl+G,MAAA,CACAo+G,QAAA,CAAA1+G,OAAA2wC,OAAAnZ,OACAmnF,QAAA,CAAA3+G,OAAA2wC,OAAAnZ,OACAl4B,IAAA,CAAAU,OAAAF,SAEAtvE,MAAA8vE,GAAAirB,MAAAA,IACA,MAAAixE,EAAAyJ,KAMA2Y,EAAApiB,EAAAoX,IAGA,IAAAgL,EAAA1R,SACA,OAAA3hF,EAAAz+F,QAEA,MAAA6wF,EAAA,IAAAhB,IACA7uF,EAAA,IAAAwqF,IACA,IAAA+wD,EAAA,KACA,MAAA8iC,EAAA3P,EAAA8Z,UACApJ,UAAArsG,EAAAu1G,EAAAv9F,EAAAk/F,EAAAjB,GAAA+H,EAAAhV,GAAAzM,cAAAA,KAAAwhB,EACAE,EAAA1hB,EAAA,OA+BA,SAAA2Z,EAAAtQ,GAEAsY,GAAAtY,GACAoY,EAAApY,EAAAjK,EAAA2P,GAEA,SAAA6S,EAAAt3G,GACAiW,EAAA5vF,SAAA,CAAA04K,EAAA93K,KACA,MAAAnC,EAAAyyL,GAAAxY,EAAAhmG,OACAj0E,GAAAk7E,GAAAA,EAAAl7E,IACA0yL,EAAAvwL,MAIA,SAAAuwL,EAAAvwL,GACA,MAAAC,EAAA+uF,EAAAxC,IAAAxsF,GACA06I,GAAAz6I,EAAA6xE,OAAA4oE,EAAA5oE,KAGA4oE,GAGA01C,GAAA11C,GALA0tC,EAAAnoL,GAOA+uF,EAAAP,OAAAzuF,GACAb,EAAAsvF,OAAAzuF,GAtDAiwL,EAAAO,SAAA,CAAA1Y,EAAAH,EAAAtJ,EAAAK,EAAA6Y,KACA,MAAA1Z,EAAAiK,EAAAl6K,UACAwrL,EAAAtR,EAAAH,EAAAtJ,EAAA,EAAAmP,GAEAiK,EAAA5Z,EAAAiK,MAAAA,EAAAH,EAAAtJ,EAAAR,EAAA2P,EAAA9O,EAAAoJ,EAAAwP,aAAAC,GACAkF,IAAA,KACA5e,EAAA4iB,eAAA,EACA5iB,EAAAh8F,GACAhzE,EAAA6qG,eAAAmkE,EAAAh8F,GAEA,MAAA6+G,EAAA5Y,EAAAnmG,OAAAmmG,EAAAnmG,MAAAg/G,eACAD,GACAE,GAAAF,EAAA7iB,EAAAp8F,OAAAqmG,KAEA0F,IAEAyS,EAAAY,WAAA/Y,IACA,MAAAjK,EAAAiK,EAAAl6K,UACAwrL,EAAAtR,EAAAqY,EAAA,KAAA,EAAA3S,GACAiP,IAAA,KACA5e,EAAAijB,IACAjyL,EAAA6qG,eAAAmkE,EAAAijB,IAEA,MAAAJ,EAAA5Y,EAAAnmG,OAAAmmG,EAAAnmG,MAAAo/G,iBACAL,GACAE,GAAAF,EAAA7iB,EAAAp8F,OAAAqmG,GAEAjK,EAAA4iB,eAAA,IACAjT,IA6BA8N,IAAA,IAAA,CAAA35G,EAAAo+G,QAAAp+G,EAAAq+G,WAAA,EAAAD,EAAAC,MACAD,GAAAM,GAAAxyL,GAAAgyF,GAAAkgG,EAAAlyL,KACAmyL,GAAAK,GAAAxyL,IAAAgyF,GAAAmgG,EAAAnyL,OAGA,CAAA6tL,MAAA,OAAAD,MAAA,IAEA,IAAAuF,EAAA,KACA,MAAAC,EAAA,KAEA,MAAAD,GACAhiG,EAAAvC,IAAAukG,EAAAE,GAAArjB,EAAAoZ,WAoBA,OAjBAoG,GAAA4D,GACAxZ,GAAAwZ,GACA3D,IAAA,KACAt+F,EAAA5vF,SAAAa,IACA,MAAAgnL,QAAAA,EAAAU,SAAAA,GAAA9Z,EACAiK,EAAAoZ,GAAAjK,GACA,GAAAhnL,EAAA6xE,OAAAgmG,EAAAhmG,KAQAs2G,EAAAnoL,OARA,CAEAmwL,GAAAtY,GAEA,MAAAgZ,EAAAhZ,EAAAl6K,UAAAkzL,GACAA,GAAArE,GAAAqE,EAAAnJ,UAMA,KAEA,GADAqJ,EAAA,MACAp0F,EAAAz+F,QACA,OAAA,KAEA,MAAAo2E,EAAAqoB,EAAAz+F,UACAgzL,EAAA58G,EAAA,GACA,GAAAA,EAAAtE,OAAA,EAEA,OADAyqE,EAAA,KACAnmE,EAEA,KAAAwN,GAAAovG,KACA,EAAAA,EAAAnL,WACA,IAAAmL,EAAAnL,YAEA,OADAtrC,EAAA,KACAy2C,EAEA,IAAArZ,EAAAoZ,GAAAC,GACA,MAAA/M,EAAAtM,EAAAhmG,KAGAj0E,EAAAyyL,GAAAb,GAAA3X,GACAA,EAAAhmG,KAAAs/G,iBAAA,GACAhN,IACA2L,QAAAA,EAAAC,QAAAA,EAAAr/G,IAAAA,GAAAgB,EACA,GAAAo+G,KAAAlyL,IAAAgyF,GAAAkgG,EAAAlyL,KACAmyL,GAAAnyL,GAAAgyF,GAAAmgG,EAAAnyL,GAEA,OADA68I,EAAAo9B,EACAqZ,EAEA,MAAAnxL,EAAA,MAAA83K,EAAA93K,IAAAokL,EAAAtM,EAAA93K,IACAqxL,EAAAriG,EAAAxC,IAAAxsF,GAsCA,OApCA83K,EAAA53K,KACA43K,EAAAuO,GAAAvO,GACA,IAAAqZ,EAAAnL,YACAmL,EAAArJ,UAAAhQ,IAQAkZ,EAAAhxL,EACAqxL,GAEAvZ,EAAA53K,GAAAmxL,EAAAnxL,GACA43K,EAAAl6K,UAAAyzL,EAAAzzL,UACAk6K,EAAAmF,YAEAvE,GAAAZ,EAAAA,EAAAmF,YAGAnF,EAAAkO,WAAA,IAEA7mL,EAAAsvF,OAAAzuF,GACAb,EAAA6qF,IAAAhqF,KAGAb,EAAA6qF,IAAAhqF,GAEA2wE,GAAAxxE,EAAA8oG,KAAA72B,SAAAT,EAAA,KACA4/G,EAAApxL,EAAAipG,SAAAhgB,OAAA1pF,QAIAo5K,EAAAkO,WAAA,IACAtrC,EAAAo9B,EACAqZ,KAOA,SAAAthG,GAAA5F,EAAApsF,GACA,OAAAgB,EAAAipF,QAAAmC,GACAA,EAAArY,MAAAM,GAAA2d,GAAA3d,EAAAr0E,KAEAgB,EAAAe,SAAAqqF,GACAA,EAAAa,MAAA,KAAAtU,QAAA34E,IAAA,IAEAosF,EAAAxZ,MACAwZ,EAAAxZ,KAAA5yE,GAKA,SAAAyzL,GAAA3d,EAAAyC,GACAmb,GAAA5d,EAAA,IAAAyC,GAEA,SAAAob,GAAA7d,EAAAyC,GACAmb,GAAA5d,EAAA,KAAAyC,GAEA,SAAAmb,GAAA5d,EAAA7hG,EAAAskG,EAAA2U,IAIA,MAAA0G,EAAA9d,EAAA+d,QACA/d,EAAA+d,MAAA,KAEA,IAAAh3C,EAAA07B,EACA,KAAA17B,GAAA,CACA,GAAAA,EAAA+1C,cACA,OAEA/1C,EAAAA,EAAAjpE,OAEAkiG,MAQA,GANAge,GAAA7/G,EAAA2/G,EAAArb,GAMAA,EAAA,CACA,IAAA17B,EAAA07B,EAAA3kG,OACA,KAAAipE,GAAAA,EAAAjpE,QACA29G,GAAA10C,EAAAjpE,OAAAqmG,QACA8Z,GAAAH,EAAA3/G,EAAAskG,EAAA17B,GAEAA,EAAAA,EAAAjpE,QAIA,SAAAmgH,GAAAje,EAAA7hG,EAAAskG,EAAAyb,GAGA,MAAAC,EAAAH,GAAA7/G,EAAA6hG,EAAAke,GAAA,GACAE,IAAA,KACAlzL,EAAA6pG,OAAAmpF,EAAA//G,GAAAggH,KACA1b,GAEA,SAAAga,GAAAtY,GACA,IAAAkO,EAAAlO,EAAAkO,UACA,IAAAA,IACAA,GAAA,KAEA,IAAAA,IACAA,GAAA,KAEAlO,EAAAkO,UAAAA,EAEA,SAAAkL,GAAApZ,GACA,OAAA,IAAAA,EAAAkO,UAAAlO,EAAAgQ,UAAAhQ,EAGA,SAAA6Z,GAAA7/G,EAAA6hG,EAAAyC,EAAA2U,GAAArwE,GAAA,GACA,GAAA07D,EAAA,CACA,MAAA0Y,EAAA1Y,EAAAtkG,KAAAskG,EAAAtkG,GAAA,IAIA2/G,EAAA9d,EAAAqe,QACAre,EAAAqe,MAAA,IAAA5wG,KACA,GAAAg1F,EAAAiT,YACA,OAIAtJ,EAAAE,gBAIAgS,GAAA7b,GACA,MAAAr/F,EAAA+6F,EAAA6B,EAAAyC,EAAAtkG,EAAAsP,GAGA,OAFA6wG,GAAA,MACAlS,EAAAoB,gBACApqG,IAQA,OANA2jC,EACAo0E,EAAAhrG,QAAA2tG,GAGA3C,EAAAh5G,KAAA27G,GAEAA,GAGA,MAAAS,GAAAC,GAAA,CAAAxe,EAAAyC,EAAA2U,OAEAwB,IAAA,OAAA4F,IACAR,GAAAQ,EAAAxe,EAAAyC,GACAgc,GAAAF,GAAA,MACA7E,GAAA6E,GAAA,KACAG,GAAAH,GAAA,MACAza,GAAAya,GAAA,KACA5E,GAAA4E,GAAA,OACAH,GAAAG,GAAA,MACAI,GAAAJ,GAAA,MACAK,GAAAL,GAAA,OACAM,GAAAN,GAAA,OACA,SAAAO,GAAA9e,EAAAyC,EAAA2U,IACA4G,GAAA,KAAAhe,EAAAyC,GAGA,IAAAsc,IAAA,EACA,SAAAC,GAAA9kB,GACA,MAAAluK,EAAAizL,GAAA/kB,GACAkf,EAAAlf,EAAAoR,MACAgG,EAAApX,EAAAoX,IAEAyN,IAAA,EAGA/yL,EAAAkzL,cACAnf,GAAA/zK,EAAAkzL,aAAAhlB,EAAA,MAEA,MAEAnW,KAAAo7B,EAAAl8F,SAAAm8F,EAAAC,QAAAA,EAAA1H,MAAA2H,EAAAnI,QAAAoI,EAAAhI,OAAAiI,EAAAC,QAEAA,EAAAC,YAAAA,EAAA1Y,QAAAA,EAAA2Y,aAAAA,EAAAC,QAAAA,EAAAC,UAAAA,EAAAC,YAAAA,EAAAC,cAAAA,EAAAC,cAAAA,EAAAC,UAAAA,EAAAC,UAAAA,EAAAjzL,OAAAA,EAAAkzL,cAAAA,EAAAC,gBAAAA,EAAAC,cAAAA,EAAAC,eAAAA,EAAAC,OAEAA,EAAApO,aAAAA,EAAAzlG,WAEAA,EAAAC,WAAAA,EAAA4O,QAAAA,GAAAvvF,EAYA,GAHAwzL,GA4GA,SAAAA,EAAAlO,EAAAkP,EAAAt1L,EAAAiB,MACAjB,EAAAipF,QAAAqrG,KACAA,EAAAiB,GAAAjB,IAEA,IAAA,MAAAnzL,KAAAmzL,EAAA,CACA,MAAAkB,EAAAlB,EAAAnzL,GACAnB,EAAA2lF,SAAA6vG,GAEApP,EAAAjlL,GADA,YAAAq0L,EACAnJ,EAAAmJ,EAAA5/B,MAAAz0J,EAAAq0L,EAAAl2L,SAAA,GAGA+sL,EAAAmJ,EAAA5/B,MAAAz0J,GAIAilL,EAAAjlL,GAAAkrL,EAAAmJ,IA1HAC,CAAAnB,EAAAlO,EATA,MAWA+N,EACA,IAAA,MAAAhzL,KAAAgzL,EAAA,CACA,MAAAuB,EAAAvB,EAAAhzL,GACAnB,EAAA43F,WAAA89F,KAIAtP,EAAAjlL,GAAAu0L,EAAA5wF,KAAAopF,IAKA,GAAA+F,EAAA,CACA,MAAAp7B,EAAAo7B,EAAAlqF,KAAAmkF,EAAAA,GACAluL,EAAA2lF,SAAAkzE,KAEAmW,EAAAnW,KAAAqoB,EAAAyU,SAAA98B,IAKA,GADAg7B,IAAA,EACAK,EACA,IAAA,MAAA/yL,KAAA+yL,EAAA,CACA,MAAAsB,EAAAtB,EAAA/yL,GASAy3E,EAAAmf,GAAA,CACApK,IATA3tF,EAAA43F,WAAA49F,GACAA,EAAA1wF,KAAAopF,EAAAA,GACAluL,EAAA43F,WAAA49F,EAAA7nG,KACA6nG,EAAA7nG,IAAAmX,KAAAopF,EAAAA,GACAluL,EAAAiB,KAMA2sF,KALA5tF,EAAA43F,WAAA49F,IAAAx1L,EAAA43F,WAAA49F,EAAA5nG,KACA4nG,EAAA5nG,IAAAkX,KAAAopF,GACAluL,EAAAiB,OAKAtB,OAAAC,eAAAwmL,EAAAjlL,EAAA,CACA+pG,YAAA,EACAD,cAAA,EACAtd,IAAA,IAAA/U,EAAA/4E,MACA+tF,IAAAqjF,GAAAr4F,EAAA/4E,MAAAoxK,IAIA,GAAAmjB,EACA,IAAA,MAAAjzL,KAAAizL,EACAwB,GAAAxB,EAAAjzL,GAAAilL,EAAA8H,EAAA/sL,GAGA,GAAAkzL,EAAA,CACA,MAAAlI,EAAAnsL,EAAA43F,WAAAy8F,GACAA,EAAAtqF,KAAAmkF,GACAmG,EACAwB,QAAAC,QAAA3J,GAAA5rL,SAAAY,IACA8qL,EAAA9qL,EAAAgrL,EAAAhrL,OAMA,SAAA40L,EAAAC,EAAAlhB,GACA90K,EAAAipF,QAAA6rF,GACAA,EAAAv0K,SAAA01L,GAAAD,EAAAC,EAAAnxF,KAAAopF,MAEApZ,GACAkhB,EAAAlhB,EAAAhwE,KAAAopF,IAeA,GAvBAqG,GACA1f,GAAA0f,EAAAvlB,EAAA,KAUA+mB,EAAAxC,GAAAiB,GACAuB,EAAAvH,GAAA1S,GACAia,EAAAvC,GAAAiB,GACAsB,EAAAnd,GAAA8b,GACAqB,EAAAtD,GAAAkC,GACAoB,EAAApD,GAAAiC,GACAmB,EAAAnC,GAAAuB,GACAY,EAAApC,GAAAsB,GACAc,EAAArC,GAAAwB,GACAa,EAAAtH,GAAAqG,GACAiB,EAAA7C,GAAA8B,GACAe,EAAAtC,GAAA2B,GACAp1L,EAAAipF,QAAAosG,GACA,GAAAA,EAAAjkH,OAAA,CACA,MAAA8kH,EAAAlnB,EAAAknB,UAAAlnB,EAAAknB,QAAAhV,EAAAiV,UAAA,KACAd,EAAA90L,SAAAY,IACA+0L,EAAA/0L,GAAA+/K,EAAAkV,MAAAlI,EAAA/sL,WAGA6tK,EAAAknB,UACAlnB,EAAAknB,QAAAl2L,EAAA6uF,WAKA9sF,GAAAitK,EAAAjtK,SAAA/B,EAAAiB,OACA+tK,EAAAjtK,OAAAA,GAEA,MAAAklL,IACAjY,EAAAiY,aAAAA,GAGAzlG,IACAwtF,EAAAxtF,WAAAA,GACAC,IACAutF,EAAAvtF,WAAAA,GAqBA,SAAAozF,GAAAC,EAAA9F,EAAA/7F,GACAggG,EAAAjzK,EAAAipF,QAAA6rF,GACAA,EAAAv+F,KAAAq9F,GAAAA,EAAA9uE,KAAAkqE,EAAAoR,SACAtL,EAAAhwE,KAAAkqE,EAAAoR,OAAApR,EAAA/7F,GAEA,SAAA2iH,GAAA3/F,EAAAmwF,EAAA8H,EAAA/sL,GACA,MAAA0/K,EAAA1/K,EAAAy5E,SAAA,KACAuzG,GAAAD,EAAA/sL,GACA,IAAA+sL,EAAA/sL,GACA,GAAAnB,EAAAe,SAAAk1F,GAAA,CACA,MAAAyzE,EAAA0c,EAAAnwF,GACAj2F,EAAA43F,WAAA8xE,IACA+iB,GAAA5L,EAAAnX,QAGA,GAAA1pK,EAAA43F,WAAA3B,GACAw2F,GAAA5L,EAAA5qF,EAAA6O,KAAAopF,SAEA,GAAAluL,EAAA2lF,SAAAsQ,GACA,GAAAj2F,EAAAipF,QAAAgN,GACAA,EAAA11F,SAAA45G,GAAAy7E,GAAAz7E,EAAAisE,EAAA8H,EAAA/sL,SAEA,CACA,MAAAuoK,EAAA1pK,EAAA43F,WAAA3B,EAAAyzE,SACAzzE,EAAAyzE,QAAA5kE,KAAAopF,GACA9H,EAAAnwF,EAAAyzE,SACA1pK,EAAA43F,WAAA8xE,IACA+iB,GAAA5L,EAAAnX,EAAAzzE,IAWA,SAAA89F,GAAA/kB,GACA,MAAAziC,EAAAyiC,EAAA/7F,MACAogE,OAAAA,EAAAF,QAAAkjD,GAAA9pD,GACA8G,OAAAijD,EAAAC,aAAApmG,EAAAzJ,QAAA8vG,sBAAAA,IAAAxnB,EAAAsS,WACAlgL,EAAA+uF,EAAAxC,IAAA4+C,GACA,IAAAkqD,EAiBA,OAhBAr1L,EACAq1L,EAAAr1L,EAEAk1L,EAAAllH,QAAAiiE,GAAAgjD,GAMAI,EAAA,GACAH,EAAAllH,QACAklH,EAAA/1L,SAAA8qF,GAAAqrG,GAAAD,EAAAprG,EAAAmrG,GAAA,KAEAE,GAAAD,EAAAlqD,EAAAiqD,IARAC,EAAAlqD,EAUAp8C,EAAAvC,IAAA2+C,EAAAkqD,GACAA,EAEA,SAAAC,GAAAC,EAAA/gC,EAAAghC,EAAApR,GAAA,GACA,MAAAnyC,OAAAA,EAAAF,QAAAkjD,GAAAzgC,EACAygC,GACAK,GAAAC,EAAAN,EAAAO,GAAA,GAEAvjD,GACAA,EAAA9yI,SAAA8qF,GAAAqrG,GAAAC,EAAAtrG,EAAAurG,GAAA,KAEA,IAAA,MAAAz1L,KAAAy0J,EACA,GAAA4vB,GAAA,WAAArkL,OACA,CACA,MAAA01L,EAAAC,GAAA31L,IAAAy1L,GAAAA,EAAAz1L,GACAw1L,EAAAx1L,GAAA01L,EAAAA,EAAAF,EAAAx1L,GAAAy0J,EAAAz0J,IAAAy0J,EAAAz0J,GAGA,OAAAw1L,EAEA,MAAAG,GAAA,CACAj+B,KAAAk+B,GACAjkH,MAAAkkH,GACAtR,MAAAsR,GAEA7C,QAAA6C,GACAj/F,SAAAi/F,GAEAhD,aAAAiD,GACA1C,QAAA0C,GACAzC,YAAAyC,GACAnb,QAAAmb,GACAxC,aAAAwC,GACAvC,QAAAuC,GACApC,cAAAoC,GACAlC,UAAAkC,GACAtC,UAAAsC,GACArC,YAAAqC,GACA9B,cAAA8B,GACA7B,eAAA6B,GAEAz1G,WAAAw1G,GACAv1G,WAAAu1G,GAIAvK,MAAAuK,GAEA/K,QAAA8K,GACA1K,OAaA,SAAAsK,EAAA/gC,GACA,OAAAohC,GAAAzB,GAAAoB,GAAApB,GAAA3/B,MAZA,SAAAmhC,GAAAJ,EAAA/gC,GACA,OAAAA,EAGA+gC,EAGA,WACA,OAAA32L,EAAA,OAAAA,EAAA43F,WAAA++F,GAAAA,EAAA5sF,KAAAoC,KAAAA,MAAAwqF,EAAA32L,EAAA43F,WAAAg+D,GAAAA,EAAA7rD,KAAAoC,KAAAA,MAAAypD,IAHAA,EAHA+gC,EAYA,SAAApB,GAAAt/F,GACA,GAAAj2F,EAAAipF,QAAAgN,GAAA,CACA,MAAA/d,EAAA,GACA,IAAA,IAAA5E,EAAA,EAAAA,EAAA2iB,EAAA7kB,OAAAkC,IACA4E,EAAA+d,EAAA3iB,IAAA2iB,EAAA3iB,GAEA,OAAA4E,EAEA,OAAA+d,EAEA,SAAAghG,GAAAN,EAAA/gC,GACA,OAAA+gC,EAAA,IAAA,IAAA7rG,IAAA,GAAAkT,OAAA24F,EAAA/gC,KAAAA,EAEA,SAAAohC,GAAAL,EAAA/gC,GACA,OAAA+gC,EAAA32L,EAAA0B,OAAA1B,EAAA0B,OAAA/B,OAAAU,OAAA,MAAAs2L,GAAA/gC,GAAAA,EAuHA,SAAAshC,GAAAloB,EAAAgG,EAAAliG,EAAAi6F,GACA,MAAAjsK,EAAAq2L,GAAAnoB,EAAA8X,aACA,IACAsQ,EADAC,GAAA,EAEA,GAAAriB,EACA,IAAA,IAAA7zK,KAAA6zK,EAAA,CAEA,GAAAh1K,EAAA+gG,eAAA5/F,GACA,SAEA,MAAAtB,EAAAm1K,EAAA7zK,GAGA,IAAAm2L,EACAx2L,GAAAd,EAAAk2F,OAAAp1F,EAAAw2L,EAAAt3L,EAAAkvF,SAAA/tF,IACAg2L,GAAAA,EAAAv8G,SAAA08G,IAIAF,IAAAA,EAAA,KAAAE,GAAAz3L,EAHAizE,EAAAwkH,GAAAz3L,EAMAimL,EAAA9W,EAAAiZ,aAAA9mL,IACAtB,IAAAktK,EAAA5rK,KACA4rK,EAAA5rK,GAAAtB,EACAw3L,GAAA,GAKA,GAAAF,EAAA,CACA,MAAAI,EAAArW,EAAAzH,MAAA3mG,GACA0kH,EAAAJ,GAAAp3L,EAAA6uF,UACA,IAAA,IAAAvb,EAAA,EAAAA,EAAA6jH,EAAA/lH,OAAAkC,IAAA,CACA,MAAAnyE,EAAAg2L,EAAA7jH,GACAR,EAAA3xE,GAAAs2L,GAAA32L,EAAAy2L,EAAAp2L,EAAAq2L,EAAAr2L,GAAA6tK,GAAAhvK,EAAAk2F,OAAAshG,EAAAr2L,KAGA,OAAAk2L,EAEA,SAAAI,GAAA32L,EAAAgyE,EAAA3xE,EAAAtB,EAAAmvK,EAAA0oB,GACA,MAAAlC,EAAA10L,EAAAK,GACA,GAAA,MAAAq0L,EAAA,CACA,MAAAhqB,EAAAxrK,EAAAk2F,OAAAs/F,EAAA,WAEA,GAAAhqB,QAAA3pK,IAAAhC,EAAA,CACA,MAAAysL,EAAAkJ,EAAAl2L,QACA,GAAAk2L,EAAAviH,OAAAjxE,UAAAhC,EAAA43F,WAAA00F,GAAA,CACA,MAAAqL,cAAAA,GAAA3oB,EACA7tK,KAAAw2L,EACA93L,EAAA83L,EAAAx2L,IAGAiyL,GAAApkB,GACAnvK,EAAA83L,EAAAx2L,GAAAmrL,EAAAviF,KAAA,KAAAj3B,GACAsgH,GAAA,YAIAvzL,EAAAysL,EAIAkJ,EAAA,KACAkC,IAAAlsB,EACA3rK,GAAA,GAEA21L,EAAA,IACA,KAAA31L,GAAAA,IAAAG,EAAAojF,UAAAjiF,KACAtB,GAAA,IAIA,OAAAA,EAEA,SAAA+3L,GAAArS,EAAAjE,EAAAkE,GAAA,GACA,MAAAr1F,EAAAmxF,EAAAuW,WACAz2L,EAAA+uF,EAAAxC,IAAA43F,GACA,GAAAnkL,EACA,OAAAA,EAEA,MAAA60F,EAAAsvF,EAAAzyG,MACAgB,EAAA,GACAqjH,EAAA,GAEA,IAAAxR,GAAA,EACA,IAAA3lL,EAAA43F,WAAA2tF,GAAA,CACA,MAAAuS,EAAA7hG,IACA0vF,GAAA,EACA,MAAA7yG,EAAAxyE,GAAAs3L,GAAA3hG,EAAAqrF,GAAA,GACAthL,EAAA0B,OAAAoyE,EAAAhB,GACAxyE,GACA62L,EAAAlgH,QAAA32E,KAEAklL,GAAAlE,EAAAjuC,OAAAjiE,QACAkwG,EAAAjuC,OAAA9yI,QAAAu3L,GAEAvS,EAAApyC,SACA2kD,EAAAvS,EAAApyC,SAEAoyC,EAAAlyC,QACAkyC,EAAAlyC,OAAA9yI,QAAAu3L,GAGA,IAAA7hG,IAAA0vF,EAEA,OADAx1F,EAAAvC,IAAA23F,EAAAvlL,EAAAypG,WACAzpG,EAAAypG,UAEA,GAAAzpG,EAAAipF,QAAAgN,GACA,IAAA,IAAA3iB,EAAA,EAAAA,EAAA2iB,EAAA7kB,OAAAkC,IAAA,CACA,MAAAm0B,EAAAznG,EAAAkvF,SAAA+G,EAAA3iB,IACAykH,GAAAtwF,KACA3zB,EAAA2zB,GAAAznG,EAAA6uF,gBAIA,GAAAoH,EACA,IAAA,MAAA90F,KAAA80F,EAAA,CACA,MAAAwR,EAAAznG,EAAAkvF,SAAA/tF,GACA,GAAA42L,GAAAtwF,GAAA,CACA,MAAA+tF,EAAAv/F,EAAA90F,GACA2jF,EAAAhR,EAAA2zB,GACAznG,EAAAipF,QAAAusG,IAAAx1L,EAAA43F,WAAA49F,GAAA,CAAAviH,KAAAuiH,GAAAA,EACA,GAAA1wG,EAAA,CACA,MAAAkzG,EAAAC,GAAAzuG,QAAA1E,EAAA7R,MACAilH,EAAAD,GAAAzlH,OAAAsS,EAAA7R,MACA6R,EAAA,GAAAkzG,GAAA,EACAlzG,EAAA,GACAozG,EAAA,GAAAF,EAAAE,GAEAF,GAAA,GAAAh4L,EAAAk2F,OAAApR,EAAA,aACAqyG,EAAAlgH,KAAAwwB,KAMA,MAAAvvB,EAAA,CAAApE,EAAAqjH,GAEA,OADAhnG,EAAAvC,IAAA23F,EAAArtG,GACAA,EAEA,SAAA6/G,GAAA52L,GACA,MAAA,MAAAA,EAAA,GAOA,SAAAg3L,GAAAC,GACA,MAAA3uG,EAAA2uG,GAAAA,EAAA7tF,WAAA9gB,MAAA,sBACA,OAAAA,EAAAA,EAAA,GAAA,GAEA,SAAA4uG,GAAArlH,EAAAyS,GACA,OAAA0yG,GAAAnlH,KAAAmlH,GAAA1yG,GAEA,SAAAwyG,GAAAhlH,EAAAqlH,GACA,OAAAt4L,EAAAipF,QAAAqvG,GACAA,EAAAtvF,WAAAkiD,GAAAmtC,GAAAntC,EAAAj4E,KAEAjzE,EAAA43F,WAAA0gG,IACAD,GAAAC,EAAArlH,GAAA,GAEA,EAGA,MAAAslH,GAAAp3L,GAAA,MAAAA,EAAA,IAAA,YAAAA,EACAq3L,GAAA34L,GAAAG,EAAAipF,QAAAppF,GACAA,EAAA02E,IAAA8wG,IACA,CAAAA,GAAAxnL,IACA44L,GAAA,CAAAt3L,EAAAu3L,EAAAtS,KACA,MAAAtyG,EAAAqyG,GAAArzG,GACA0lH,GAAAE,EAAA5lH,KACAszG,GAEA,OADAtyG,EAAA4yG,IAAA,EACA5yG,GAEA6kH,GAAA,CAAAC,EAAA76F,EAAAixE,KACA,MAAAoX,EAAAwS,EAAAC,KACA,IAAA,MAAA13L,KAAAy3L,EAAA,CACA,GAAAL,GAAAp3L,GACA,SACA,MAAAtB,EAAA+4L,EAAAz3L,GACA,GAAAnB,EAAA43F,WAAA/3F,GACAk+F,EAAA58F,GAAAs3L,GAAAt3L,EAAAtB,EAAAumL,QAEA,GAAA,MAAAvmL,EAAA,CACA,MAAAi0E,EAAA0kH,GAAA34L,GACAk+F,EAAA58F,GAAA,IAAA2yE,KAIAglH,GAAA,CAAA9pB,EAAAt5F,KACA,MAAA5B,EAAA0kH,GAAA9iH,GACAs5F,EAAAjxE,MAAAz+F,QAAA,IAAAw0E,GAgHA,SAAAilH,GAAA9f,EAAA6D,EAAA9N,EAAAhwK,GACA,MAAA4gG,EAAAq5E,EAAAwO,KACAuR,EAAAlc,GAAAA,EAAA2K,KACA,IAAA,IAAAn0G,EAAA,EAAAA,EAAAssB,EAAAxuB,OAAAkC,IAAA,CACA,MAAA0oG,EAAAp8E,EAAAtsB,GACA0lH,IACAhd,EAAApxE,SAAAouF,EAAA1lH,GAAAzzE,OAEA,IAAAi1K,EAAAkH,EAAA5iG,IAAAp6E,GACA81K,IAGAoM,EAAAE,gBACAnO,EAAA6B,EAAA9F,EAAA,EAAA,CACAiK,EAAA53K,GACA26K,EACA/C,EACA6D,IAEAoE,EAAAoB,kBAKA,SAAA2W,KACA,MAAA,CACA95L,IAAA,KACAunF,OAAA,CACAhW,YAAA1wE,EAAAqnF,GACAwqF,aAAA,EACAqnB,iBAAA,GACA1C,sBAAA,GACAzT,kBAAAlhL,EACA0/K,iBAAA1/K,EACAs3L,gBAAA,IAEA9lD,OAAA,GACA7xD,WAAA,GACAC,WAAA,GACA0qG,SAAAxsL,OAAAU,OAAA,MACAk2L,aAAA,IAAAr4F,QACA25F,WAAA,IAAA35F,QACAunF,WAAA,IAAAvnF,SAGA,IAAAk7F,GAAA,EACA,SAAAC,GAAAt3L,EAAAy+K,GACA,OAAA,SAAA8Y,EAAAC,EAAA,MACA,MAAAA,GAAAv5L,EAAA2lF,SAAA4zG,KACAA,EAAA,MAEA,MAAA5jH,EAAAsjH,KACAO,EAAA,IAAA1uG,IACA,IAAA+iG,GAAA,EACA,MAAA1uL,EAAAw2E,EAAAx2E,IAAA,CACAs6L,KAAAL,KACAjZ,WAAAmZ,EACAI,OAAAH,EACAI,WAAA,KACAC,SAAAjkH,EACAk6B,QAAAA,GACAnpB,aACA,OAAA/Q,EAAA+Q,QAEAA,WAAAuqF,KAEA7xK,IAAA,CAAAkoI,KAAAxmI,KACA04L,EAAAtuG,IAAAo8C,KACAA,GAAAtnI,EAAA43F,WAAA0vC,EAAAuyD,UACAL,EAAAruG,IAAAm8C,GACAA,EAAAuyD,QAAA16L,KAAA2B,IAEAd,EAAA43F,WAAA0vC,KACAkyD,EAAAruG,IAAAm8C,GACAA,EAAAnoI,KAAA2B,KAGA3B,GAEA26L,MAAAA,IAEAnkH,EAAA09D,OAAAz4D,SAAAk/G,IACAnkH,EAAA09D,OAAAp8D,KAAA6iH,GAGA36L,GAEAJ,UAAA,CAAAC,EAAAD,IACAA,GAGA42E,EAAA6L,WAAAxiF,GAAAD,EACAI,GAHAw2E,EAAA6L,WAAAxiF,GAKA4pI,UAAA,CAAA5pI,EAAA4pI,IACAA,GAGAjzD,EAAA8L,WAAAziF,GAAA4pI,EACAzpI,GAHAw2E,EAAA8L,WAAAziF,GAKAgE,MAAA+2L,EAAAC,EAAAnqB,GACA,IAAAge,EAAA,CACA,MAAA5U,EAAAe,GAAAsf,EAAAC,GAaA,OAVAtgB,EAAAqI,WAAA3rG,EACAqkH,GAAAxZ,EACAA,EAAAvH,EAAA8gB,GAGAh4L,EAAAk3K,EAAA8gB,EAAAlqB,GAEAge,GAAA,EACA1uL,EAAAw6L,WAAAI,EACAA,EAAAE,YAAA96L,EACA85K,EAAAl6K,UAAAqhL,QAGAp9K,UACA6qL,IACA9rL,EAAA,KAAA5C,EAAAw6L,mBACAx6L,EAAAw6L,WAAAM,cAGAhO,QAAA,CAAA9qL,EAAAtB,KAGA81E,EAAAw2G,SAAAhrL,GAAAtB,EACAV,IAGA,OAAAA,GAIA,IAAA+6L,IAAA,EACA,MAAAC,GAAArhB,GAAA,MAAAlnG,KAAAknG,EAAAshB,eAAA,kBAAAthB,EAAAkE,QACAqd,GAAAjnH,GAAA,IAAAA,EAAApyE,SAMA,SAAAs5L,GAAA3R,GACA,MAAA4R,GAAAC,EAAAnnH,EAAAu1G,EAAAvM,GAAAoC,UAAAA,EAAAhO,YAAAA,EAAAf,WAAAA,EAAA7lE,OAAAA,EAAA0lE,OAAAA,EAAAa,cAAAA,IAAAuY,EAUAwB,EAAA,CAAA/2G,EAAA6lG,EAAAyF,EAAAC,EAAA8J,EAAAC,GAAA,KACA,MAAA+R,EAAAJ,GAAAjnH,IAAA,MAAAA,EAAAylF,KACA6hC,EAAA,IAAAC,EAAAvnH,EAAA6lG,EAAAyF,EAAAC,EAAA8J,EAAAgS,IACAxnH,KAAAA,EAAA89G,IAAAA,EAAA5J,UAAAA,GAAAlO,EACA2hB,EAAAxnH,EAAApyE,SACAi4K,EAAA53K,GAAA+xE,EACA,IAAAynH,EAAA,KACA,OAAA5nH,GACA,KAAA6nH,GACA,IAAAF,EACAC,EAAAH,KAGAtnH,EAAAylF,OAAAogB,EAAAvjG,WACAwkH,IAAA,EACA9mH,EAAAylF,KAAAogB,EAAAvjG,UAEAmlH,EAAApqB,EAAAr9F,IAEA,MACA,KAAAu0G,GAEAkT,EADA,IAAAD,GAAAH,EACAC,IAGAjqB,EAAAr9F,GAEA,MACA,KAAA2nH,GACA,GAAA,IAAAH,EAGA,CAEAC,EAAAznH,EAGA,MAAA4nH,GAAA/hB,EAAAvjG,SAAAtE,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA2lG,EAAAgiB,YAAA3nH,IACA0nH,IACA/hB,EAAAvjG,UAAAmlH,EAAAK,WACA5nH,IAAA2lG,EAAAgiB,YAAA,IACAhiB,EAAAzJ,OAAAqrB,GAEAA,EAAApqB,EAAAoqB,GAEA,OAAAA,EAhBAA,EAAAH,IAkBA,MACA,KAAA/gB,GAKAkhB,EAJAJ,EAIAU,EAAA/nH,EAAA6lG,EAAAyF,EAAAC,EAAA8J,EAAAC,GAHAgS,IAKA,MACA,QACA,GAAA,EAAAvT,EAIA0T,EAHA,IAAAD,GACA3hB,EAAAhmG,KAAAsC,gBACAnC,EAAA4pG,QAAAznG,cACAmlH,IAGAU,EAAAhoH,EAAA6lG,EAAAyF,EAAAC,EAAA8J,EAAAC,QAGA,GAAA,EAAAvB,EAAA,CAIAlO,EAAAwP,aAAAA,EACA,MAAA3P,EAAApJ,EAAAt8F,GAYA,GAXAonH,EAAAvhB,EAAAH,EAAA,KAAA4F,EAAAC,EAAAwb,GAAArhB,GAAA4P,GAIAmS,EAAAJ,EACAY,EAAAjoH,GACAq9F,EAAAr9F,GAKAw9G,GAAA3X,GAAA,CACA,IAAAmP,EACAqS,GACArS,EAAApO,GAAAL,IACAyO,EAAA5Y,OAAAqrB,EACAA,EAAAS,gBACAxiB,EAAA18D,WAGAgsE,EACA,IAAAh1G,EAAApyE,SAAAu6L,GAAA,IAAAvhB,GAAA,OAEAoO,EAAA/mL,GAAA+xE,EACA6lG,EAAAl6K,UAAAqpL,QAAAA,QAGA,GAAAjB,EAEA0T,EADA,IAAAD,EACAF,IAGAzhB,EAAAhmG,KAAAutG,QAAAptG,EAAA6lG,EAAAyF,EAAAC,EAAA8J,EAAAC,EAAAC,EAAA6S,GAGA,IAAArU,IACA0T,EAAA5hB,EAAAhmG,KAAAutG,QAAAptG,EAAA6lG,EAAAyF,EAAAC,EAAAwb,GAAAzqB,EAAAt8F,IAAAq1G,EAAAC,EAAAC,EAAAwB,IAOA,OAHA,MAAA4G,GACA0K,GAAA1K,EAAA,KAAApS,EAAA1F,GAEA4hB,GAEAO,EAAA,CAAA/5L,EAAA43K,EAAAyF,EAAAC,EAAA8J,EAAAC,KACAA,EAAAA,KAAAzP,EAAA8S,gBACA,MAAAj5G,MAAAA,EAAA+O,UAAAA,EAAAslG,UAAAA,EAAAM,KAAAA,GAAAxO,EAEA,IAAA,IAAAp3F,EAAA,CAKA,GAJA4lG,GACAsR,GAAA9f,EAAA,KAAAyF,EAAA,WAGA5rG,EACA,IAAA41G,GACA,GAAA7mG,GACA,GAAAA,EACA,IAAA,MAAA1gF,KAAA2xE,GACA9yE,EAAA+gG,eAAA5/F,IAAAnB,EAAA8gG,KAAA3/F,IACAs9K,EAAAp9K,EAAAF,EAAA,KAAA2xE,EAAA3xE,SAIA2xE,EAAA4oH,SAGAjd,EAAAp9K,EAAA,UAAA,KAAAyxE,EAAA4oH,SAIA,IAAAC,EAcA,IAbAA,EAAA7oH,GAAAA,EAAA8oH,qBACA7J,GAAA4J,EAAAjd,EAAAzF,GAEAwO,GACAsR,GAAA9f,EAAA,KAAAyF,EAAA,iBAEAid,EAAA7oH,GAAAA,EAAAg/G,iBAAArK,IACAuE,GAAA,KACA2P,GAAA5J,GAAA4J,EAAAjd,EAAAzF,GACAwO,GAAAsR,GAAA9f,EAAA,KAAAyF,EAAA,aACAC,GAGA,GAAAwI,KAEAr0G,IAAAA,EAAA5xE,YAAA4xE,EAAA09F,aAAA,CACA,IAAAjnF,EAAAiyG,EAAAn6L,EAAAq4F,WAAAu/E,EAAA53K,EAAAq9K,EAAAC,EAAA8J,EAAAC,GACA,KAAAn/F,GAAA,CACA2wG,IAAA,EAEA,MAAA92F,EAAA7Z,EACAA,EAAAA,EAAAknF,YACA5mE,EAAAzG,SAGA,EAAA+jF,GACA9lL,EAAAmvK,cAAAyI,EAAAvjG,WACAwkH,IAAA,EACA74L,EAAAmvK,YAAAyI,EAAAvjG,UAIA,OAAAr0E,EAAAovK,aAEA+qB,EAAA,CAAApoH,EAAAyoH,EAAA/iB,EAAA4F,EAAAC,EAAA8J,EAAAC,KACAA,EAAAA,KAAAmT,EAAA9P,gBACA,MAAAr2G,EAAAmmH,EAAAnmH,SACAwf,EAAAxf,EAAAtE,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA4hB,EAAA5hB,IAAA,CACA,MAAA2lG,EAAAyP,EACAhzG,EAAApC,GACAoC,EAAApC,GAAA+zG,GAAA3xG,EAAApC,IACA,GAAAF,EACAA,EAAA+2G,EAAA/2G,EAAA6lG,EAAAyF,EAAAC,EAAA8J,EAAAC,OAEA,CAAA,GAAAzP,EAAAhmG,OAAA6nH,KAAA7hB,EAAAvjG,SACA,SAGAwkH,IAAA,EAEAtR,EAAA,KAAA3P,EAAAH,EAAA,KAAA4F,EAAAC,EAAAwb,GAAArhB,GAAA2P,IAGA,OAAAr1G,GAEA+nH,EAAA,CAAA/nH,EAAA6lG,EAAAyF,EAAAC,EAAA8J,EAAAC,KACA,MAAAD,aAAAqT,GAAA7iB,EACA6iB,IACArT,EAAAA,EACAA,EAAAzqF,OAAA89F,GACAA,GAEA,MAAAhjB,EAAApJ,EAAAt8F,GACAmW,EAAAiyG,EAAA/qB,EAAAr9F,GAAA6lG,EAAAH,EAAA4F,EAAAC,EAAA8J,EAAAC,GACA,OAAAn/F,GAAA8wG,GAAA9wG,IAAA,MAAAA,EAAAsvE,KACA4X,EAAAwI,EAAAzJ,OAAAjmF,IAKA2wG,IAAA,EAEA3qB,EAAA0J,EAAAzJ,OAAAY,EAAA,KAAA0I,EAAAvvF,GACAA,IAGAoxG,EAAA,CAAAvnH,EAAA6lG,EAAAyF,EAAAC,EAAA8J,EAAArmD,KAGA,GAFA83D,IAAA,EACAjhB,EAAA53K,GAAA,KACA+gI,EAAA,CAEA,MAAAjxD,EAAAkqH,EAAAjoH,GACA,OAAA,CACA,MAAAmW,EAAAknF,EAAAr9F,GACA,IAAAmW,GAAAA,IAAApY,EAIA,MAHA04B,EAAAtgB,IAOA,MAAAA,EAAAknF,EAAAr9F,GACA0lG,EAAApJ,EAAAt8F,GAGA,OAFAy2B,EAAAz2B,GACAw1G,EAAA,KAAA3P,EAAAH,EAAAvvF,EAAAm1F,EAAAC,EAAAwb,GAAArhB,GAAA2P,GACAl/F,GAEA8xG,EAAAjoH,IACA,IAAAqW,EAAA,EACA,KAAArW,GAEA,IADAA,EAAAq9F,EAAAr9F,KACAinH,GAAAjnH,KACA,MAAAA,EAAAylF,MACApvE,IACA,MAAArW,EAAAylF,MAAA,CACA,GAAA,IAAApvE,EACA,OAAAgnF,EAAAr9F,GAGAqW,IAKA,OAAArW,GAEA,MAAA,CAjRA,CAAA6lG,EAAAH,KACAohB,IAAA,EACA/P,EAAArR,EAAAp/E,WAAAu/E,EAAA,KAAA,KAAA,MACA6L,IACAoV,IAEArzF,QAAAnrB,MAAA,iDA2QAyuG,GAGA,MAAA4R,GAAA,CACApO,UAAA3J,EAEAE,cAAA,GAEA0J,GAAA5B,EAEAyP,GAAA,CAAAO,EAAAC,EAAAtd,EAAA1F,EAAAijB,GAAA,KACA,GAAAl8L,EAAAipF,QAAA+yG,GAEA,YADAA,EAAAz7L,SAAA,CAAA45G,EAAA7mC,IAAAmoH,GAAAthF,EAAA8hF,IAAAj8L,EAAAipF,QAAAgzG,GAAAA,EAAA3oH,GAAA2oH,GAAAtd,EAAA1F,EAAAijB,KAGA,GAAAtL,GAAA3X,KAAAijB,EAGA,OAEA,MAAAC,EAAA,EAAAljB,EAAAkO,UACAlO,EAAAl6K,UAAAm3L,SAAAjd,EAAAl6K,UAAAqhL,MACAnH,EAAA53K,GACAxB,EAAAq8L,EAAA,KAAAC,GACA7oH,EAAA8oH,EAAAjiF,EAAA42E,GAAAiL,EACAK,EAAAJ,GAAAA,EAAA9hF,EACAmiF,EAAAF,EAAAE,OAAAt8L,EAAA6uF,UAAAutG,EAAAE,KAAA,GAAAF,EAAAE,KACAtV,EAAAoV,EAAApV,WAaA,GAXA,MAAAqV,GAAAA,IAAAtL,IACA/wL,EAAAe,SAAAs7L,IACAC,EAAAD,GAAA,KACAr8L,EAAAk2F,OAAA8wF,EAAAqV,KACArV,EAAAqV,GAAA,OAGAnb,EAAAsB,MAAA6Z,KACAA,EAAAx8L,MAAA,OAGAG,EAAAe,SAAAgwL,GAAA,CACA,MAAAwL,EAAA,KAEAD,EAAAvL,GAAAlxL,EAEAG,EAAAk2F,OAAA8wF,EAAA+J,KACA/J,EAAA+J,GAAAlxL,IAMAA,GACA08L,EAAAnsG,IAAA,EACAw9F,GAAA2O,EAAA5d,IAGA4d,SAGA,GAAArb,EAAAsB,MAAAuO,GAAA,CACA,MAAAwL,EAAA,KACAxL,EAAAlxL,MAAAA,GAEAA,GACA08L,EAAAnsG,IAAA,EACAw9F,GAAA2O,EAAA5d,IAGA4d,SAGAv8L,EAAA43F,WAAAm5F,IACAjP,EAAAiP,EAAAqL,EAAA,GAAA,CAAAv8L,EAAAy8L,KA6BA,SAAAE,GAAA17L,EAAA27L,GACA,MAAAltB,OAAAmtB,EAAA7yF,OAAA8yF,EAAAle,UAAAme,EAAAnd,eAAAod,EAAAjtB,cAAAktB,EAAA5sB,WAAA6sB,EAAA3sB,cAAA4sB,EAAA3sB,QAAA4sB,EAAA1sB,eAAA2sB,EAAAxtB,WAAAytB,EAAA1sB,YAAA2sB,EAAAC,WAAAC,EAAAt9L,EAAAiB,KAAA2vK,UAAA2sB,EAAAC,oBAAAC,GAAA38L,EAGA8nL,EAAA,CAAAL,EAAAC,EAAA1P,EAAAtJ,EAAA,KAAAkP,EAAA,KAAAC,EAAA,KAAA9O,GAAA,EAAA4Y,EAAA,KAAAC,GAAA,KAEAH,IAAAsB,GAAAtB,EAAAC,KACAhZ,EAAAkuB,EAAAnV,GACAgB,EAAAhB,EAAA7J,EAAAC,GAAA,GACA4J,EAAA,OAEA,IAAAC,EAAA3mG,YACA6mG,GAAA,EACAF,EAAAuD,gBAAA,MAEA,MAAA94G,KAAAA,EAAA89G,IAAAA,EAAA5J,UAAAA,GAAAqB,EACA,OAAAv1G,GACA,KAAA6nH,GACA6C,EAAApV,EAAAC,EAAA1P,EAAAtJ,GACA,MACA,KAAAmY,GACAiW,EAAArV,EAAAC,EAAA1P,EAAAtJ,GACA,MACA,KAAAurB,GACA,MAAAxS,GACAsV,EAAArV,EAAA1P,EAAAtJ,EAAAK,GAEA,MACA,KAAA8J,GACAmkB,EAAAvV,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,GACA,MACA,QACA,EAAAvB,EACA4W,EAAAxV,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,GAEA,EAAAvB,EACA6W,EAAAzV,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,IAEA,GAAAvB,GAGA,IAAAA,IAFAl0G,EAAAgrH,QAAA1V,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,EAAAwV,IAQA,MAAAnN,GAAArS,GACA+c,GAAA1K,EAAAxI,GAAAA,EAAAwI,IAAApS,EAAA6J,GAAAD,GAAAC,IAGAmV,EAAA,CAAApV,EAAAC,EAAA1P,EAAAtJ,KACA,GAAA,MAAA+Y,EACAmU,EAAAlU,EAAAnnL,GAAA07L,EAAAvU,EAAA9yG,UAAAojG,EAAAtJ,OAEA,CACA,MAAAnuK,EAAAmnL,EAAAnnL,GAAAknL,EAAAlnL,GACAmnL,EAAA9yG,WAAA6yG,EAAA7yG,UACAunH,EAAA57L,EAAAmnL,EAAA9yG,YAIAkoH,EAAA,CAAArV,EAAAC,EAAA1P,EAAAtJ,KACA,MAAA+Y,EACAmU,EAAAlU,EAAAnnL,GAAA27L,EAAAxU,EAAA9yG,UAAA,IAAAojG,EAAAtJ,GAIAgZ,EAAAnnL,GAAAknL,EAAAlnL,IAGAw8L,EAAA,CAAArV,EAAA1P,EAAAtJ,EAAAK,MACA2Y,EAAAnnL,GAAAmnL,EAAAhZ,QAAAiuB,EAAAjV,EAAA9yG,SAAAojG,EAAAtJ,EAAAK,IAoBAkuB,EAAA,CAAAxV,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,KACA7Y,EAAAA,GAAA,QAAA2Y,EAAAv1G,KACA,MAAAs1G,EACA4V,EAAA3V,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,GAGA0V,EAAA7V,EAAAC,EAAA9J,EAAAC,EAAA9O,EAAA4Y,EAAAC,IAGAyV,EAAA,CAAAllB,EAAAH,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,KACA,IAAArnL,EACAwwL,EACA,MAAA5+G,KAAAA,EAAAH,MAAAA,EAAAq0G,UAAAA,EAAA/I,WAAAA,EAAAv8F,UAAAA,EAAA4lG,KAAAA,GAAAxO,EACA,GAAAA,EAAA53K,SACAQ,IAAA07L,IACA,IAAA17G,EAKAxgF,EAAA43K,EAAA53K,GAAAk8L,EAAAtkB,EAAA53K,QAEA,CAcA,GAbAA,EAAA43K,EAAA53K,GAAAy7L,EAAA7jB,EAAAhmG,KAAA48F,EAAA/8F,GAAAA,EAAAg9F,GAAAh9F,GAGA,EAAAq0G,EACA+V,EAAA77L,EAAA43K,EAAAvjG,UAEA,GAAAyxG,GACAkX,EAAAplB,EAAAvjG,SAAAr0E,EAAA,KAAAq9K,EAAAC,EAAA9O,GAAA,kBAAA58F,EAAAw1G,EAAAC,KAAAzP,EAAA8S,iBAEAtE,GACAsR,GAAA9f,EAAA,KAAAyF,EAAA,WAGA5rG,EAAA,CACA,IAAA,MAAA3xE,KAAA2xE,EACA9yE,EAAA+gG,eAAA5/F,IACAy7L,EAAAv7L,EAAAF,EAAA,KAAA2xE,EAAA3xE,GAAA0uK,EAAAoJ,EAAAvjG,SAAAgpG,EAAAC,EAAAC,IAGAiT,EAAA/+G,EAAA8oH,qBACA7J,GAAAF,EAAAnT,EAAAzF,GAIAokB,EAAAh8L,EAAA43K,EAAAA,EAAAxgG,QAAAgwG,EAAA/J,GAEA+I,GACAsR,GAAA9f,EAAA,KAAAyF,EAAA,eAIA,MAAA4f,IAAA3f,GAAAA,IAAAA,EAAAqK,gBACA5K,IACAA,EAAAwQ,UACA0P,GACAlgB,EAAAE,YAAAj9K,GAEAq7L,EAAAr7L,EAAAy3K,EAAAtJ,KACAqiB,EAAA/+G,GAAAA,EAAAg/G,iBACAwM,GACA7W,IACAmG,IAAA,KACAiE,GAAAE,GAAAF,EAAAnT,EAAAzF,GACAqlB,GAAAlgB,EAAAttD,MAAAzvH,GACAomL,GAAAsR,GAAA9f,EAAA,KAAAyF,EAAA,aACAC,IAGA0e,EAAA,CAAAh8L,EAAA43K,EAAAxgG,EAAAgwG,EAAA/J,KAIA,GAHAjmG,GACA6kH,EAAAj8L,EAAAo3E,GAEAgwG,EACA,IAAA,IAAAn1G,EAAA,EAAAA,EAAAm1G,EAAAr3G,OAAAkC,IACAgqH,EAAAj8L,EAAAonL,EAAAn1G,IAGA,GAAAorG,EAAA,CAEA,GAAAzF,IADAyF,EAAA0J,QACA,CACA,MAAAyT,EAAAnd,EAAAzF,MACAokB,EAAAh8L,EAAAw6L,EAAAA,EAAApjH,QAAAojH,EAAApT,aAAA/J,EAAA9rG,WAIAyrH,EAAA,CAAA3oH,EAAAojG,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,EAAAvnG,EAAA,KACA,IAAA,IAAA7N,EAAA6N,EAAA7N,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAnB,EAAApC,GAAAo1G,EACA6V,GAAA7oH,EAAApC,IACA+zG,GAAA3xG,EAAApC,IACAs1G,EAAA,KAAA/xG,EAAAiiG,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,KAGA0V,EAAA,CAAA7V,EAAAC,EAAA9J,EAAAC,EAAA9O,EAAA4Y,EAAAC,KACA,MAAArnL,EAAAmnL,EAAAnnL,GAAAknL,EAAAlnL,GACA,IAAAwgF,UAAAA,EAAAkqG,gBAAAA,EAAAtE,KAAAA,GAAAe,EAGA3mG,GAAA,GAAA0mG,EAAA1mG,UACA,MAAA28G,EAAAjW,EAAAz1G,OAAA9yE,EAAA6uF,UACA4vG,EAAAjW,EAAA11G,OAAA9yE,EAAA6uF,UACA,IAAAgjG,EAOA,IANAA,EAAA4M,EAAAC,sBACA3M,GAAAF,EAAAnT,EAAA8J,EAAAD,GAEAd,GACAsR,GAAAvQ,EAAAD,EAAA7J,EAAA,gBAEA78F,EAAA,EAAA,CAKA,GAAA,GAAAA,EAEA88G,EAAAt9L,EAAAmnL,EAAAgW,EAAAC,EAAA/f,EAAAC,EAAA9O,QAqBA,GAhBA,EAAAhuF,GACA28G,EAAAI,QAAAH,EAAAG,OACAhC,EAAAv7L,EAAA,QAAA,KAAAo9L,EAAAG,MAAA/uB,GAKA,EAAAhuF,GACA+6G,EAAAv7L,EAAA,QAAAm9L,EAAAxtB,MAAAytB,EAAAztB,MAAAnB,GAQA,EAAAhuF,EAAA,CAEA,MAAAg9G,EAAArW,EAAA1mG,aACA,IAAA,IAAAxO,EAAA,EAAAA,EAAAurH,EAAAztH,OAAAkC,IAAA,CACA,MAAAnyE,EAAA09L,EAAAvrH,GACAgW,EAAAk1G,EAAAr9L,GACAooF,EAAAk1G,EAAAt9L,IACAooF,IAAAD,GACAuzG,GAAAA,EAAAx7L,EAAAF,KACAy7L,EAAAv7L,EAAAF,EAAAmoF,EAAAC,EAAAsmF,EAAA0Y,EAAA7yG,SAAAgpG,EAAAC,EAAAC,IAOA,EAAA/8F,GACA0mG,EAAA7yG,WAAA8yG,EAAA9yG,UACAwnH,EAAA77L,EAAAmnL,EAAA9yG,eAIAgzG,GAAA,MAAAqD,GAEA4S,EAAAt9L,EAAAmnL,EAAAgW,EAAAC,EAAA/f,EAAAC,EAAA9O,GAEA,MAAAivB,EAAAjvB,GAAA,kBAAA2Y,EAAAv1G,KACA84G,EACAgT,EAAAxW,EAAAwD,gBAAAA,EAAA1qL,EAAAq9K,EAAAC,EAAAmgB,EAAArW,GAEAC,GAEAsW,EAAAzW,EAAAC,EAAAnnL,EAAA,KAAAq9K,EAAAC,EAAAmgB,EAAArW,GAAA,KAEAoJ,EAAA4M,EAAAQ,iBAAAxX,IACAmG,IAAA,KACAiE,GAAAE,GAAAF,EAAAnT,EAAA8J,EAAAD,GACAd,GAAAsR,GAAAvQ,EAAAD,EAAA7J,EAAA,aACAC,IAIAogB,EAAA,CAAAG,EAAAljF,EAAAmjF,EAAAzgB,EAAAC,EAAA9O,EAAA4Y,KACA,IAAA,IAAAn1G,EAAA,EAAAA,EAAA0oC,EAAA5qC,OAAAkC,IAAA,CACA,MAAA8rH,EAAAF,EAAA5rH,GACA+rH,EAAArjF,EAAA1oC,GAEAwlG,EAGAsmB,EAAA/9L,KAGA+9L,EAAAnsH,OAAA0mG,KAGAkQ,GAAAuV,EAAAC,IAEA,EAAAD,EAAAjY,WACA,GAAAiY,EAAAjY,WACAgW,EAAAiC,EAAA/9L,IAGA89L,EACAvW,EAAAwW,EAAAC,EAAAvmB,EAAA,KAAA4F,EAAAC,EAAA9O,EAAA4Y,GAAA,KAGAkW,EAAA,CAAAt9L,EAAA43K,EAAAulB,EAAAC,EAAA/f,EAAAC,EAAA9O,KACA,GAAA2uB,IAAAC,EAAA,CACA,IAAA,MAAAt9L,KAAAs9L,EAAA,CAEA,GAAAz+L,EAAA+gG,eAAA5/F,GACA,SACA,MAAAooF,EAAAk1G,EAAAt9L,GACAmoF,EAAAk1G,EAAAr9L,IACAooF,IAAAD,GACAuzG,GAAAA,EAAAx7L,EAAAF,KACAy7L,EAAAv7L,EAAAF,EAAAmoF,EAAAC,EAAAsmF,EAAAoJ,EAAAvjG,SAAAgpG,EAAAC,EAAAC,GAGA,GAAA4f,IAAAx+L,EAAA6uF,UACA,IAAA,MAAA1tF,KAAAq9L,EACAx+L,EAAA+gG,eAAA5/F,IAAAA,KAAAs9L,GACA7B,EAAAv7L,EAAAF,EAAAq9L,EAAAr9L,GAAA,KAAA0uK,EAAAoJ,EAAAvjG,SAAAgpG,EAAAC,EAAAC,KAMAkf,EAAA,CAAAvV,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,KACA,MAAA4W,EAAA9W,EAAAnnL,GAAAknL,EAAAA,EAAAlnL,GAAA07L,EAAA,IACAwC,EAAA/W,EAAAhZ,OAAA+Y,EAAAA,EAAA/Y,OAAAutB,EAAA,IACA,IAAAl7G,UAAAA,EAAAkqG,gBAAAA,EAAAtD,aAAAqT,GAAAtT,EACAuD,IACArD,GAAA,GAGAoT,IACArT,EAAAA,EACAA,EAAAzqF,OAAA89F,GACAA,GAEA,MAAAvT,GACAmU,EAAA4C,EAAAxmB,EAAAtJ,GACAktB,EAAA6C,EAAAzmB,EAAAtJ,GAIA6uB,EAAA7V,EAAA9yG,SAAAojG,EAAAymB,EAAA7gB,EAAAC,EAAA9O,EAAA4Y,EAAAC,IAGA7mG,EAAA,GACA,GAAAA,GACAkqG,GAGAxD,EAAAwD,iBAGAgT,EAAAxW,EAAAwD,gBAAAA,EAAAjT,EAAA4F,EAAAC,EAAA9O,EAAA4Y,IAMA,MAAAD,EAAArnL,KACAu9K,GAAA8J,IAAA9J,EAAA0J,UACAoX,GAAAjX,EAAAC,GAAA,IAQAwW,EAAAzW,EAAAC,EAAA1P,EAAAymB,EAAA7gB,EAAAC,EAAA9O,EAAA4Y,EAAAC,IAIAsV,EAAA,CAAAzV,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,KACAF,EAAAC,aAAAA,EACA,MAAAF,EACA,IAAAC,EAAArB,UACAzI,EAAA0H,IAAAuL,SAAAnJ,EAAA1P,EAAAtJ,EAAAK,EAAA6Y,GAGA8R,EAAAhS,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA6Y,GAIA+W,EAAAlX,EAAAC,EAAAE,IAGA8R,EAAA,CAAAkF,EAAA5mB,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA6Y,KACA,MAAA1Z,EAAA0wB,EAAA3gM,UAAA4gM,GAAAD,EAAAhhB,EAAAC,GAWA,GATA4R,GAAAmP,KACA1wB,EAAAoX,IAAA1G,SAAAwe,IAIA0B,GAAA5wB,GAIAA,EAAAoc,UAIA,GAHAzM,GAAAA,EAAAkhB,YAAA7wB,EAAAic,IAGAyU,EAAAr+L,GAAA,CACA,MAAA6lI,EAAA8nC,EAAAoZ,QAAApO,GAAA2N,IACAiW,EAAA,KAAA12D,EAAA4xC,EAAAtJ,SAIAyb,EAAAjc,EAAA0wB,EAAA5mB,EAAAtJ,EAAAmP,EAAA9O,EAAA6Y,IAEA+W,EAAA,CAAAlX,EAAAC,EAAAE,KACA,MAAA1Z,EAAAwZ,EAAAzpL,UAAAwpL,EAAAxpL,UACA,GAjlGA,SAAA+9K,EAAAgjB,EAAApX,GACA,MAAA51G,MAAAi1G,EAAAryG,SAAAijG,EAAA55K,UAAAA,GAAA+9K,GACAhqG,MAAAk1G,EAAAtyG,SAAAqqH,EAAAl+G,UAAAA,GAAAi+G,EACApa,EAAA3mL,EAAAkpL,aAEA,GAAA6X,EAAArY,MAAAqY,EAAA1hB,WACA,OAAA,EAEA,KAAAsK,GAAA7mG,GAAA,GA2BA,SAAA82F,IAAAonB,GACAA,GAAAA,EAAAC,UAIAjY,IAAAC,IAGAD,GAGAC,GAGAF,EAAAC,EAAAC,EAAAtC,KALAsC,GAnCA,GAAA,KAAAnmG,EAGA,OAAA,EAEA,GAAA,GAAAA,EACA,OAAAkmG,EAIAD,EAAAC,EAAAC,EAAAtC,KAHAsC,EAKA,GAAA,EAAAnmG,EAAA,CACA,MAAAC,EAAAg+G,EAAAh+G,aACA,IAAA,IAAAxO,EAAA,EAAAA,EAAAwO,EAAA1Q,OAAAkC,IAAA,CACA,MAAAnyE,EAAA2gF,EAAAxO,GACA,GAAA00G,EAAA7mL,KAAA4mL,EAAA5mL,KACA2kL,EAAAJ,EAAAvkL,GACA,OAAA,GAwBA,OAAA,EA8hGA8+L,CAAA1X,EAAAC,EAAAE,GAAA,CACA,GAAA1Z,EAAAoc,WACApc,EAAAuc,cAEA,YADA2U,EAAAlxB,EAAAwZ,EAAAE,GAKA1Z,EAAAzlF,KAAAi/F,EA/kHA,SAAAvE,GACA,MAAA3wG,EAAA8vG,EAAAzrG,QAAAssG,GACA3wG,EAAA+vG,GACAD,EAAAxsG,OAAAtD,EAAA,GA+kHA6sH,CAAAnxB,EAAAlN,QAEAkN,EAAAlN,cAKA0mB,EAAAzpL,UAAAwpL,EAAAxpL,UACAypL,EAAAnnL,GAAAknL,EAAAlnL,GACA2tK,EAAAiK,MAAAuP,GAGAyC,EAAA,CAAAjc,EAAA0wB,EAAA5mB,EAAAtJ,EAAAmP,EAAA9O,EAAA6Y,KAEA1Z,EAAAlN,OAAAof,EAAA6M,QAAA,WACA,GAAA/e,EAAA6e,UAsDA,CAIA,IAEAgE,GAFAtoG,KAAAA,EAAA62G,GAAAA,EAAAC,EAAAA,EAAAztH,OAAAA,EAAAqmG,MAAAA,GAAAjK,EACAsxB,EAAA/2G,EAEAA,GACAA,EAAAloF,GAAA43K,EAAA53K,GACA6+L,EAAAlxB,EAAAzlF,EAAAm/F,IAGAn/F,EAAA0vF,EAGAmnB,GACApgM,EAAA6qG,eAAAu1F,IAGAvO,EAAAtoG,EAAAzW,OAAAyW,EAAAzW,MAAA4rH,sBACA3M,GAAAF,EAAAj/G,EAAA2W,EAAA0vF,GAEA,MAAAsnB,EAAA5Z,EAAA3X,GACAwxB,EAAAxxB,EAAAoZ,QACApZ,EAAAoZ,QAAAmY,EACA3X,EAAA4X,EAAAD,EAEApD,EAAAqD,EAAAn/L,IAEAq8L,EAAA8C,GAAAxxB,EAAA2P,EAAA9O,GACAtmF,EAAAloF,GAAAk/L,EAAAl/L,GACA,OAAAi/L,GAIAnY,EAAAnZ,EAAAuxB,EAAAl/L,IAGAg/L,GACAzS,GAAAyS,EAAA1hB,IAGAkT,EAAAtoG,EAAAzW,OAAAyW,EAAAzW,MAAAmsH,iBACArR,IAAA,IAAAmE,GAAAF,EAAAj/G,EAAA2W,EAAA0vF,IAAA0F,OAjGA,CACA,IAAAkT,EACA,MAAAxwL,GAAAA,EAAAyxE,MAAAA,GAAA4sH,GACAe,GAAAA,EAAAp1G,EAAAA,EAAAzY,OAAAA,GAAAo8F,EASA,GAPAyxB,GACAzgM,EAAA6qG,eAAA41F,IAGA5O,EAAA/+G,GAAAA,EAAA8oH,qBACA7J,GAAAF,EAAAj/G,EAAA8sH,GAEAr+L,GAAA8oL,GAAA,CAEA,MAAAuW,EAAA,KACA1xB,EAAAoZ,QAAAzB,EAAA3X,GACAmb,GAAA9oL,EAAA2tK,EAAAoZ,QAAApZ,EAAA2P,EAAA,OAEAiS,GAAA8O,GACAA,EAAAzsH,KAAA49G,gBAAAzmF,MAKA,KAAA4kE,EAAAwb,aAAAkW,MAGAA,QAGA,CACA,MAAAtY,EAAApZ,EAAAoZ,QAAAzB,EAAA3X,GACA4Z,EAAA,KAAAR,EAAAtP,EAAAtJ,EAAAR,EAAA2P,EAAA9O,GACA6vB,EAAAr+L,GAAA+mL,EAAA/mL,GAOA,GAJAgqF,GACAuiG,GAAAviG,EAAAszF,GAGAkT,EAAA/+G,GAAAA,EAAAg/G,eAAA,CACA,MAAA6O,EAAAjB,EACA9R,IAAA,IAAAmE,GAAAF,EAAAj/G,EAAA+tH,IAAAhiB,GAKA,IAAA+gB,EAAAvY,WACAnY,EAAAh8F,GAAA46G,GAAA5e,EAAAh8F,EAAA2rG,GAEA3P,EAAA6e,WAAA,EAEA6R,EAAA5mB,EAAAtJ,EAAA,QAgDAusB,KAEAmE,EAAA,CAAAlxB,EAAA8wB,EAAApX,KACAoX,EAAA/gM,UAAAiwK,EACA,MAAA+Y,EAAA/Y,EAAAiK,MAAAnmG,MACAk8F,EAAAiK,MAAA6mB,EACA9wB,EAAAzlF,KAAA,KAh7CA,SAAAylF,EAAAgG,EAAA4rB,EAAAlY,GACA,MAAA51G,MAAAA,EAAAi6F,MAAAA,EAAAkM,OAAAp3F,UAAAA,IAAAmtF,EACAuoB,EAAArW,EAAAzH,MAAA3mG,IACAhyE,GAAAkuK,EAAA8X,aACA,IAAAuQ,GAAA,EACA,KAIA3O,GAAA7mG,EAAA,IACA,GAAAA,EAgCA,CAOA,IAAAg/G,EALA3J,GAAAloB,EAAAgG,EAAAliG,EAAAi6F,KACAsqB,GAAA,GAKA,IAAA,MAAAl2L,KAAAo2L,EACAviB,IAEAh1K,EAAAk2F,OAAA8+E,EAAA7zK,KAGA0/L,EAAA7gM,EAAAojF,UAAAjiF,MAAAA,GAAAnB,EAAAk2F,OAAA8+E,EAAA6rB,MACA//L,GACA8/L,QAEA/+L,IAAA++L,EAAAz/L,SAEAU,IAAA++L,EAAAC,KACA/tH,EAAA3xE,GAAAs2L,GAAA32L,EAAAy2L,EAAAp2L,OAAAU,EAAAmtK,GAAA,WAIAl8F,EAAA3xE,IAMA,GAAA4rK,IAAAwqB,EACA,IAAA,MAAAp2L,KAAA4rK,EACAiI,GAAAh1K,EAAAk2F,OAAA8+E,EAAA7zK,YACA4rK,EAAA5rK,GACAk2L,GAAA,QAlEA,GAAA,EAAAx1G,EAAA,CAGA,MAAAg9G,EAAA7vB,EAAAiK,MAAAn3F,aACA,IAAA,IAAAxO,EAAA,EAAAA,EAAAurH,EAAAztH,OAAAkC,IAAA,CACA,IAAAnyE,EAAA09L,EAAAvrH,GAEA,MAAAzzE,EAAAm1K,EAAA7zK,GACA,GAAAL,EAGA,GAAAd,EAAAk2F,OAAA62E,EAAA5rK,GACAtB,IAAAktK,EAAA5rK,KACA4rK,EAAA5rK,GAAAtB,EACAw3L,GAAA,OAGA,CACA,MAAAyJ,EAAA9gM,EAAAkvF,SAAA/tF,GACA2xE,EAAAguH,GAAArJ,GAAA32L,EAAAy2L,EAAAuJ,EAAAjhM,EAAAmvK,GAAA,QAIAnvK,IAAAktK,EAAA5rK,KACA4rK,EAAA5rK,GAAAtB,EACAw3L,GAAA,IA+CAA,GACAnW,EAAArG,QAAA7L,EAAA,MAAA,UA61CA+xB,CAAA/xB,EAAA8wB,EAAAhtH,MAAAi1G,EAAAW,GAhoCA,EAAA1Z,EAAAt5F,EAAAgzG,KACA,MAAAzP,MAAAA,EAAAl7E,MAAAA,GAAAixE,EACA,IAAAgyB,GAAA,EACAC,EAAAjhM,EAAA6uF,UACA,GAAA,GAAAoqF,EAAAkO,UAAA,CACA,MAAAl0G,EAAAyC,EAAA4R,EACArU,EAEAy1G,GAAA,IAAAz1G,EAGA+tH,GAAA,GAKAhhM,EAAA0B,OAAAq8F,EAAAroB,GAKAgzG,GAAA,IAAAz1G,UACA8qB,EAAAzW,IAKA05G,GAAAtrH,EAAAsqH,QACArH,GAAAjjH,EAAAqoB,IAEAkjG,EAAAvrH,OAEAA,IAEAojH,GAAA9pB,EAAAt5F,GACAurH,EAAA,CAAA3hM,QAAA,IAGA,GAAA0hM,EACA,IAAA,MAAA7/L,KAAA48F,EACAw6F,GAAAp3L,IAAAA,KAAA8/L,UACAljG,EAAA58F,IAwlCA+/L,CAAAlyB,EAAA8wB,EAAApqH,SAAAgzG,GACAxH,EAAAE,gBAGAwD,OAAA/iL,EAAAmtK,EAAAlN,QACAof,EAAAoB,iBAEA0c,EAAA,CAAAzW,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,GAAA,KACA,MAAAyY,EAAA5Y,GAAAA,EAAA7yG,SACA0rH,EAAA7Y,EAAAA,EAAApB,UAAA,EACAka,EAAA7Y,EAAA9yG,UACAmM,UAAAA,EAAAslG,UAAAA,GAAAqB,EAEA,GAAA3mG,EAAA,EAAA,CACA,GAAA,IAAAA,EAIA,YADAy/G,EAAAH,EAAAE,EAAAvoB,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,GAGA,GAAA,IAAA7mG,EAGA,YADA0/G,EAAAJ,EAAAE,EAAAvoB,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,GAKA,EAAAvB,GAEA,GAAAia,GACAxiB,EAAAuiB,EAAAziB,EAAAC,GAEA0iB,IAAAF,GACAjE,EAAApkB,EAAAuoB,IAIA,GAAAD,EAEA,GAAAja,EAEAma,EAAAH,EAAAE,EAAAvoB,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,GAIA9J,EAAAuiB,EAAAziB,EAAAC,GAAA,IAMA,EAAAyiB,GACAlE,EAAApkB,EAAA,IAGA,GAAAqO,GACAkX,EAAAgD,EAAAvoB,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,KAKA6Y,EAAA,CAAAJ,EAAAE,EAAAvoB,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,KACAyY,EAAAA,GAAAnhM,EAAAypG,UACA43F,EAAAA,GAAArhM,EAAAypG,UACA,MAAA+3F,EAAAL,EAAA/vH,OACAqwH,EAAAJ,EAAAjwH,OACAswH,EAAA3vH,KAAAq0B,IAAAo7F,EAAAC,GACA,IAAAnuH,EACA,IAAAA,EAAA,EAAAA,EAAAouH,EAAApuH,IAAA,CACA,MAAAquH,EAAAN,EAAA/tH,GAAAo1G,EACA6V,GAAA8C,EAAA/tH,IACA+zG,GAAAga,EAAA/tH,IACAs1G,EAAAuY,EAAA7tH,GAAAquH,EAAA7oB,EAAA,KAAA4F,EAAAC,EAAA9O,EAAA4Y,EAAAC,GAEA8Y,EAAAC,EAEA7iB,EAAAuiB,EAAAziB,EAAAC,GAAA,GAAA,EAAA+iB,GAIArD,EAAAgD,EAAAvoB,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,EAAAgZ,IAIAJ,EAAA,CAAAH,EAAAE,EAAAvoB,EAAA8oB,EAAAljB,EAAAC,EAAA9O,EAAA4Y,EAAAC,KACA,IAAAp1G,EAAA,EACA,MAAAuuH,EAAAR,EAAAjwH,OACA,IAAA0wH,EAAAX,EAAA/vH,OAAA,EACA2wH,EAAAF,EAAA,EAIA,KAAAvuH,GAAAwuH,GAAAxuH,GAAAyuH,GAAA,CACA,MAAAxZ,EAAA4Y,EAAA7tH,GACAk1G,EAAA6Y,EAAA/tH,GAAAo1G,EACA6V,GAAA8C,EAAA/tH,IACA+zG,GAAAga,EAAA/tH,IACA,IAAAu2G,GAAAtB,EAAAC,GAIA,MAHAI,EAAAL,EAAAC,EAAA1P,EAAA,KAAA4F,EAAAC,EAAA9O,EAAA4Y,EAAAC,GAKAp1G,IAKA,KAAAA,GAAAwuH,GAAAxuH,GAAAyuH,GAAA,CACA,MAAAxZ,EAAA4Y,EAAAW,GACAtZ,EAAA6Y,EAAAU,GAAArZ,EACA6V,GAAA8C,EAAAU,IACA1a,GAAAga,EAAAU,IACA,IAAAlY,GAAAtB,EAAAC,GAIA,MAHAI,EAAAL,EAAAC,EAAA1P,EAAA,KAAA4F,EAAAC,EAAA9O,EAAA4Y,EAAAC,GAKAoZ,IACAC,IASA,GAAAzuH,EAAAwuH,GACA,GAAAxuH,GAAAyuH,EAAA,CACA,MAAA9nC,EAAA8nC,EAAA,EACAvyB,EAAAvV,EAAA4nC,EAAAR,EAAApnC,GAAA54J,GAAAugM,EACA,KAAAtuH,GAAAyuH,GACAnZ,EAAA,KAAAyY,EAAA/tH,GAAAo1G,EACA6V,GAAA8C,EAAA/tH,IACA+zG,GAAAga,EAAA/tH,IAAAwlG,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,GACAp1G,UAWA,GAAAA,EAAAyuH,EACA,KAAAzuH,GAAAwuH,GACAvY,EAAA4X,EAAA7tH,GAAAorG,EAAAC,GAAA,GACArrG,QAOA,CACA,MAAA0uH,EAAA1uH,EACA2uH,EAAA3uH,EAEA4uH,EAAA,IAAA/yG,IACA,IAAA7b,EAAA2uH,EAAA3uH,GAAAyuH,EAAAzuH,IAAA,CACA,MAAAquH,EAAAN,EAAA/tH,GAAAo1G,EACA6V,GAAA8C,EAAA/tH,IACA+zG,GAAAga,EAAA/tH,IACA,MAAAquH,EAAAxgM,KACA+gM,EAAAt0G,IAAA+zG,EAAAxgM,IAAAmyE,GAKA,IAAAmqB,EACA0kG,EAAA,EACA,MAAAC,EAAAL,EAAAE,EAAA,EACA,IAAAI,GAAA,EAEAC,EAAA,EAMA,MAAAC,EAAA,IAAAv4F,MAAAo4F,GACA,IAAA9uH,EAAA,EAAAA,EAAA8uH,EAAA9uH,IACAivH,EAAAjvH,GAAA,EACA,IAAAA,EAAA0uH,EAAA1uH,GAAAwuH,EAAAxuH,IAAA,CACA,MAAAkvH,EAAArB,EAAA7tH,GACA,GAAA6uH,GAAAC,EAAA,CAEA7Y,EAAAiZ,EAAA9jB,EAAAC,GAAA,GACA,SAEA,IAAA8jB,EACA,GAAA,MAAAD,EAAArhM,IACAshM,EAAAP,EAAAv0G,IAAA60G,EAAArhM,UAIA,IAAAs8F,EAAAwkG,EAAAxkG,GAAAskG,EAAAtkG,IACA,GAAA,IAAA8kG,EAAA9kG,EAAAwkG,IACApY,GAAA2Y,EAAAnB,EAAA5jG,IAAA,CACAglG,EAAAhlG,EACA,WAIA57F,IAAA4gM,EACAlZ,EAAAiZ,EAAA9jB,EAAAC,GAAA,IAGA4jB,EAAAE,EAAAR,GAAA3uH,EAAA,EACAmvH,GAAAH,EACAA,EAAAG,EAGAJ,GAAA,EAEAzZ,EAAA4Z,EAAAnB,EAAAoB,GAAA3pB,EAAA,KAAA4F,EAAAC,EAAA9O,EAAA4Y,EAAAC,GACAyZ,KAKA,MAAAO,EAAAL,EAmTA,SAAAt5F,GACA,MAAA11B,EAAA01B,EAAAx3B,QACAwF,EAAA,CAAA,GACA,IAAAzD,EAAAmqB,EAAA4iG,EAAApvB,EAAAr4F,EACA,MAAA22B,EAAAxG,EAAA33B,OACA,IAAAkC,EAAA,EAAAA,EAAAi8B,EAAAj8B,IAAA,CACA,MAAAqvH,EAAA55F,EAAAz1B,GACA,GAAA,IAAAqvH,EAAA,CAEA,GADAllG,EAAA1mB,EAAAA,EAAA3F,OAAA,GACA23B,EAAAtL,GAAAklG,EAAA,CACAtvH,EAAAC,GAAAmqB,EACA1mB,EAAAE,KAAA3D,GACA,SAIA,IAFA+sH,EAAA,EACApvB,EAAAl6F,EAAA3F,OAAA,EACAivH,EAAApvB,GACAr4F,GAAAynH,EAAApvB,GAAA,EAAA,EACAloE,EAAAhyB,EAAA6B,IAAA+pH,EACAtC,EAAAznH,EAAA,EAGAq4F,EAAAr4F,EAGA+pH,EAAA55F,EAAAhyB,EAAAspH,MACAA,EAAA,IACAhtH,EAAAC,GAAAyD,EAAAspH,EAAA,IAEAtpH,EAAAspH,GAAA/sH,IAIA+sH,EAAAtpH,EAAA3F,OACA6/F,EAAAl6F,EAAAspH,EAAA,GACA,KAAAA,KAAA,GACAtpH,EAAAspH,GAAApvB,EACAA,EAAA59F,EAAA49F,GAEA,OAAAl6F,EAzVA6rH,CAAAL,GACAviM,EAAAypG,UAGA,IAFAhM,EAAAilG,EAAAtxH,OAAA,EAEAkC,EAAA8uH,EAAA,EAAA9uH,GAAA,EAAAA,IAAA,CACA,MAAAuvH,EAAAZ,EAAA3uH,EACAquH,EAAAN,EAAAwB,GACArzB,EAAAqzB,EAAA,EAAAhB,EAAAR,EAAAwB,EAAA,GAAAxhM,GAAAugM,EACA,IAAAW,EAAAjvH,GAEAs1G,EAAA,KAAA+Y,EAAA7oB,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,GAEA2Z,IAIA5kG,EAAA,GAAAnqB,IAAAovH,EAAAjlG,GACA8sF,EAAAoX,EAAA7oB,EAAAtJ,EAAA,GAGA/xE,QAMA8sF,EAAA,CAAAtR,EAAAH,EAAAtJ,EAAAszB,EAAAnkB,EAAA,QACA,MAAAt9K,GAAAA,EAAA4xE,KAAAA,EAAAmrG,WAAAA,EAAA1oG,SAAAA,EAAAyxG,UAAAA,GAAAlO,EACA,GAAA,EAAAkO,EAEA,YADAoD,EAAAtR,EAAAl6K,UAAAqpL,QAAAtP,EAAAtJ,EAAAszB,GAGA,GAAA,IAAA3b,EAEA,YADAlO,EAAA6P,SAAAyB,KAAAzR,EAAAtJ,EAAAszB,GAGA,GAAA,GAAA3b,EAEA,YADAl0G,EAAAs3G,KAAAtR,EAAAH,EAAAtJ,EAAA0uB,IAGA,GAAAjrH,IAAA0mG,GAAA,CACA+iB,EAAAr7L,EAAAy3K,EAAAtJ,GACA,IAAA,IAAAl8F,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IACAi3G,EAAA70G,EAAApC,GAAAwlG,EAAAtJ,EAAAszB,GAGA,YADApG,EAAAzjB,EAAAzJ,OAAAsJ,EAAAtJ,GAGA,GAAAv8F,IAAA8nH,GAEA,WA1uBA,GAAA15L,GAAAA,EAAAmuK,OAAAA,GAAAsJ,EAAArI,KACA,IAAAlnF,EACA,KAAAloF,GAAAA,IAAAmuK,GACAjmF,EAAA6zG,EAAA/7L,GACAq7L,EAAAr7L,EAAAy3K,EAAArI,GACApvK,EAAAkoF,EAEAmzG,EAAAltB,EAAAsJ,EAAArI,IAkuBAsyB,CAAA9pB,EAAAH,EAAAtJ,GAOA,GAHA,IAAAszB,GACA,EAAA3b,GACA/I,EAEA,GAAA,IAAA0kB,EACA1kB,EAAAE,YAAAj9K,GACAq7L,EAAAr7L,EAAAy3K,EAAAtJ,GACAoe,IAAA,IAAAxP,EAAAttD,MAAAzvH,IAAAs9K,OAEA,CACA,MAAApQ,MAAAA,EAAAohB,WAAAA,EAAAhF,WAAAA,GAAAvM,EACAv0E,EAAA,IAAA6yF,EAAAr7L,EAAAy3K,EAAAtJ,GACAwzB,EAAA,KACAz0B,EAAAltK,GAAA,KACAwoG,IACA8gF,GAAAA,QAGAgF,EACAA,EAAAtuL,EAAAwoG,EAAAm5F,GAGAA,SAKAtG,EAAAr7L,EAAAy3K,EAAAtJ,IAGA+Z,EAAA,CAAAtQ,EAAAyF,EAAAC,EAAA8M,GAAA,EAAA/C,GAAA,KACA,MAAAz1G,KAAAA,EAAAH,MAAAA,EAAAi+G,IAAAA,EAAAr7G,SAAAA,EAAAq2G,gBAAAA,EAAA5E,UAAAA,EAAAtlG,UAAAA,EAAA4lG,KAAAA,GAAAxO,EAKA,GAHA,MAAA8X,GACA0K,GAAA1K,EAAA,KAAApS,EAAA1F,GAAA,GAEA,IAAAkO,EAEA,YADAzI,EAAA0H,IAAA4L,WAAA/Y,GAGA,MAAAgqB,EAAA,EAAA9b,GAAAM,EACA,IAAAoK,EAIA,IAHAA,EAAA/+G,GAAAA,EAAAowH,uBACAnR,GAAAF,EAAAnT,EAAAzF,GAEA,EAAAkO,EACAgc,EAAAlqB,EAAAl6K,UAAA4/K,EAAA8M,OAEA,CACA,GAAA,IAAAtE,EAEA,YADAlO,EAAA6P,SAAAS,QAAA5K,EAAA8M,GAGAwX,GACAlK,GAAA9f,EAAA,KAAAyF,EAAA,iBAEA,GAAAyI,EACAlO,EAAAhmG,KAAA42B,OAAAovE,EAAAyF,EAAAC,EAAA+J,EAAAwV,GAAAzS,GAEAM,IAEA94G,IAAA0mG,IACA93F,EAAA,GAAA,GAAAA,GAEA+8F,EAAAmN,EAAArN,EAAAC,GAAA,GAAA,IAEA1rG,IAAA0mG,KACA,IAAA93F,GACA,IAAAA,KACA6mG,GAAA,GAAAvB,IACAvI,EAAAlpG,EAAAgpG,EAAAC,GAEA8M,GACA5hF,EAAAovE,KAGA4Y,EAAA/+G,GAAAA,EAAAo/G,mBAAA+Q,IACArV,IAAA,KACAiE,GAAAE,GAAAF,EAAAnT,EAAAzF,GACAgqB,GACAlK,GAAA9f,EAAA,KAAAyF,EAAA,eACAC,IAGA90E,EAAAovE,IACA,MAAAhmG,KAAAA,EAAA5xE,GAAAA,EAAAmuK,OAAAA,EAAA4O,WAAAA,GAAAnF,EACA,GAAAhmG,IAAA0mG,GAEA,YADAypB,EAAA/hM,EAAAmuK,GAGA,GAAAv8F,IAAA8nH,GAEA,WAh0BA,GAAA15L,GAAAA,EAAAmuK,OAAAA,MACA,IAAAjmF,EACA,KAAAloF,GAAAA,IAAAmuK,GACAjmF,EAAA6zG,EAAA/7L,GACAs7L,EAAAt7L,GACAA,EAAAkoF,EAEAozG,EAAAntB,IAwzBA6zB,CAAApqB,GAGA,MAAAqqB,EAAA,KACA3G,EAAAt7L,GACA+8K,IAAAA,EAAAwQ,WAAAxQ,EAAAuM,YACAvM,EAAAuM,cAGA,GAAA,EAAA1R,EAAAkO,WACA/I,IACAA,EAAAwQ,UAAA,CACA,MAAArgB,MAAAA,EAAAohB,WAAAA,GAAAvR,EACA4kB,EAAA,IAAAz0B,EAAAltK,EAAAiiM,GACA3T,EACAA,EAAA1W,EAAA53K,GAAAiiM,EAAAN,GAGAA,SAIAM,KAGAF,EAAA,CAAAhgG,EAAAjyB,KAGA,IAAAoY,EACA,KAAA6Z,IAAAjyB,GACAoY,EAAA6zG,EAAAh6F,GACAu5F,EAAAv5F,GACAA,EAAA7Z,EAEAozG,EAAAxrH,IAEAgyH,EAAA,CAAAn0B,EAAA2P,EAAA8M,KACA,MAAA8X,IAAAA,EAAAxZ,QAAAA,EAAAjoB,OAAAA,EAAAsmB,QAAAA,EAAAkB,GAAAA,GAAAta,EAKA,GAHAu0B,GACAvjM,EAAA6qG,eAAA04F,GAEAxZ,EACA,IAAA,IAAAz2G,EAAA,EAAAA,EAAAy2G,EAAA34G,OAAAkC,IACA4tG,EAAAx0C,KAAAq9C,EAAAz2G,IAKAwuF,IACAof,EAAAx0C,KAAAo1B,GACAynB,EAAAnB,EAAApZ,EAAA2P,EAAA8M,IAGAnC,GACAsE,GAAAtE,EAAA3K,GAEAiP,IAAA,KACA5e,EAAAwb,aAAA,IACA7L,GAIAA,GACAA,EAAAqK,gBACArK,EAAA6L,aACAxb,EAAAoc,WACApc,EAAAuc,eACAvc,EAAAsc,aAAA3M,EAAAmL,YACAnL,EAAAuK,OACA,IAAAvK,EAAAuK,MACAvK,EAAAxM,YAIAyM,EAAA,CAAAlpG,EAAAgpG,EAAAC,EAAA8M,GAAA,EAAA/C,GAAA,EAAAvnG,EAAA,KACA,IAAA,IAAA7N,EAAA6N,EAAA7N,EAAAoC,EAAAtE,OAAAkC,IACAi2G,EAAA7zG,EAAApC,GAAAorG,EAAAC,EAAA8M,EAAA/C,IAGAgV,EAAAzkB,GACA,EAAAA,EAAAkO,UACAuW,EAAAzkB,EAAAl6K,UAAAqpL,SAEA,IAAAnP,EAAAkO,UACAlO,EAAA6P,SAAAv/F,OAEA6zG,EAAAnkB,EAAAzJ,QAAAyJ,EAAA53K,IAEAU,EAAA,CAAAk3K,EAAAH,EAAAjJ,KACA,MAAAoJ,EACAH,EAAA0qB,QACAja,EAAAzQ,EAAA0qB,OAAA,KAAA,MAAA,GAIA5a,EAAA9P,EAAA0qB,QAAA,KAAAvqB,EAAAH,EAAA,KAAA,KAAA,KAAAjJ,GAEAiV,IACAhM,EAAA0qB,OAAAvqB,GAEAilB,GAAA,CACA7qH,EAAAu1G,EACAU,GAAAC,EACAl+F,EAAAk/F,EACApwE,EAAAtQ,EACA0wF,GAAAC,EACAiJ,GAAApF,EACAqF,GAAA1E,EACA2E,IAAA5E,EACA3+L,EAAAs9L,EACArhB,EAAAv7K,GAEA,IAAA0/K,GACA2J,GAIA,OAHAsS,KACAjc,GAAA2J,IAAAsS,EAAAyB,KAEA,CACAn8L,OAAAA,EACAy+K,QAAAA,GACAP,UAAAoZ,GAAAt3L,EAAAy+K,KAGA,SAAAuR,GAAAjd,EAAA9F,EAAAiK,EAAA6D,EAAA,MACA7J,EAAA6B,EAAA9F,EAAA,EAAA,CACAiK,EACA6D,IAcA,SAAA0iB,GAAAjX,EAAAC,EAAAob,GAAA,GACA,MAAAC,EAAAtb,EAAA7yG,SACA0rE,EAAAonC,EAAA9yG,SACA,GAAA11E,EAAAipF,QAAA46G,IAAA7jM,EAAAipF,QAAAm4D,GACA,IAAA,IAAA9tE,EAAA,EAAAA,EAAAuwH,EAAAzyH,OAAAkC,IAAA,CAGA,MAAA6tH,EAAA0C,EAAAvwH,GACA,IAAA+tH,EAAAjgD,EAAA9tE,GACA,EAAA+tH,EAAAla,YAAAka,EAAAtV,mBACAsV,EAAAx/G,WAAA,GAAA,KAAAw/G,EAAAx/G,aACAw/G,EAAAjgD,EAAA9tE,GAAAirH,GAAAn9C,EAAA9tE,IACA+tH,EAAAhgM,GAAA8/L,EAAA9/L,IAEAuiM,GACApE,GAAA2B,EAAAE,KAgDA,MACAyC,GAAAhxH,GAAAA,IAAAA,EAAAixH,UAAA,KAAAjxH,EAAAixH,UACAC,GAAAzsB,GAAA,oBAAA8I,YAAA9I,aAAA8I,WACA4jB,GAAA,CAAAnxH,EAAAoxH,KACA,MAAAC,EAAArxH,GAAAA,EAAA6jH,GACA,GAAA32L,EAAAe,SAAAojM,GAAA,CACA,GAAAD,EAGA,CAEA,OADAA,EAAAC,GAHA,OAAA,KAQA,OAAAA,GAmGA,SAAAC,GAAAnrB,EAAAH,EAAA8oB,GAAAvlB,GAAA9M,OAAAA,GAAAlkF,EAAAk/F,GAAAuY,EAAA,GAEA,IAAAA,GACAvzB,EAAA0J,EAAAorB,aAAAvrB,EAAA8oB,GAEA,MAAAvgM,GAAAA,EAAAmuK,OAAAA,EAAA2X,UAAAA,EAAAzxG,SAAAA,EAAA5C,MAAAA,GAAAmmG,EACAqrB,EAAA,IAAAxB,EAQA,GANAwB,GACA/0B,EAAAluK,EAAAy3K,EAAA8oB,KAKA0C,GAAAR,GAAAhxH,KAEA,GAAAq0G,EACA,IAAA,IAAA7zG,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IACAi3G,EAAA70G,EAAApC,GAAAwlG,EAAA8oB,EAAA,GAKA0C,GACA/0B,EAAAC,EAAAsJ,EAAA8oB,GAyBA,MAAA2C,GAjJA,CACAC,cAAA,EACAxhM,QAAAulL,EAAAC,EAAA1P,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,EAAAwV,GACA,MAAAuF,GAAApF,EAAAqF,GAAA1E,EAAA2E,IAAA5E,EAAA1iB,GAAA9M,OAAAA,EAAAhuK,cAAAA,EAAA2uK,WAAAA,EAAAE,cAAAA,IAAA8tB,EACA6F,EAAAD,GAAAtb,EAAA11G,OACA,IAAAq0G,UAAAA,EAAAzxG,SAAAA,EAAAq2G,gBAAAA,GAAAvD,EACA,GAAA,MAAAD,EAAA,CAEA,MAAArhD,EAAAshD,EAAAnnL,GAAA6uK,EAAA,IACAu0B,EAAAjc,EAAAhZ,OAAAU,EAAA,IACAX,EAAAroC,EAAA4xC,EAAAtJ,GACAD,EAAAk1B,EAAA3rB,EAAAtJ,GACA,MAAA+H,EAAAiR,EAAAjR,OAAA0sB,GAAAzb,EAAA11G,MAAAvxE,GACA8iM,EAAA7b,EAAA6b,aAAAn0B,EAAA,IACAqH,IACAhI,EAAA80B,EAAA9sB,GAEA1H,EAAAA,GAAAm0B,GAAAzsB,IAEA,MAAAh4K,EAAA,CAAAu5K,EAAAtJ,KAGA,GAAA2X,GACAkX,EAAA3oH,EAAAojG,EAAAtJ,EAAAkP,EAAAC,EAAA9O,EAAA4Y,EAAAC,IAGAqb,EACAxkM,EAAAu5K,EAAA2rB,GAEAltB,GACAh4K,EAAAg4K,EAAA8sB,OAGA,CAEA7b,EAAAnnL,GAAAknL,EAAAlnL,GACA,MAAAojM,EAAAjc,EAAAhZ,OAAA+Y,EAAA/Y,OACA+H,EAAAiR,EAAAjR,OAAAgR,EAAAhR,OACA8sB,EAAA7b,EAAA6b,aAAA9b,EAAA8b,aACAK,EAAAZ,GAAAvb,EAAAz1G,OACAgwB,EAAA4hG,EAAA5rB,EAAAvB,EACAotB,EAAAD,EAAAD,EAAAJ,EAaA,GAZAx0B,EAAAA,GAAAm0B,GAAAzsB,GACAwU,GAEAgT,EAAAxW,EAAAwD,gBAAAA,EAAAjpF,EAAA47E,EAAAC,EAAA9O,EAAA4Y,GAIA+W,GAAAjX,EAAAC,GAAA,IAEAE,GACAsW,EAAAzW,EAAAC,EAAA1lF,EAAA6hG,EAAAjmB,EAAAC,EAAA9O,EAAA4Y,GAAA,GAEAsb,EACAW,GAGAN,GAAA5b,EAAA1P,EAAA2rB,EAAAvG,EAAA,QAKA,IAAA1V,EAAA11G,OAAA01G,EAAA11G,MAAA6jH,OAAApO,EAAAz1G,OAAAy1G,EAAAz1G,MAAA6jH,IAAA,CACA,MAAAiO,EAAApc,EAAAjR,OAAA0sB,GAAAzb,EAAA11G,MAAAvxE,GACAqjM,GACAR,GAAA5b,EAAAoc,EAAA,KAAA1G,EAAA,QAGAwG,GAGAN,GAAA5b,EAAAjR,EAAA8sB,EAAAnG,EAAA,KAKAl7L,OAAAi2K,EAAAyF,EAAAC,EAAA+J,GAAAY,GAAAC,EAAAlN,GAAAxyE,OAAA8yF,IAAAlR,GACA,MAAAtE,UAAAA,EAAAzxG,SAAAA,EAAA85F,OAAAA,EAAA60B,aAAAA,EAAA9sB,OAAAA,EAAAzkG,MAAAA,GAAAmmG,EAKA,GAJA1B,GACAolB,EAAA0H,IAGA5Y,IAAAqY,GAAAhxH,MACA6pH,EAAAntB,GACA,GAAA2X,GACA,IAAA,IAAA7zG,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAnB,EAAApC,GACAi2G,EAAA1yG,EAAA6nG,EAAAC,GAAA,IAAA9nG,EAAAk1G,mBAKAxB,KAAA6Z,GACA5jB,QA6BA,SAAAptG,EAAA6lG,EAAAyF,EAAAC,EAAA8J,EAAAC,GAAArM,GAAA5L,YAAAA,EAAAf,WAAAA,EAAAnuK,cAAAA,IAAAi6L,GACA,MAAAjkB,EAAA0B,EAAA1B,OAAA0sB,GAAAhrB,EAAAnmG,MAAAvxE,GACA,GAAAg2K,EAAA,CAGA,MAAAstB,EAAAttB,EAAAutB,MAAAvtB,EAAA79E,WACA,GAAAu/E,EAAAkO,YACA2c,GAAA7qB,EAAAnmG,QACAmmG,EAAAzJ,OAAAgsB,EAAA/qB,EAAAr9F,GAAA6lG,EAAAvJ,EAAAt8F,GAAAsrG,EAAAC,EAAA8J,EAAAC,GACAzP,EAAAorB,aAAAQ,IAGA5rB,EAAAzJ,OAAAiB,EAAAr9F,GACA6lG,EAAAorB,aAAA7I,EAAAqJ,EAAA5rB,EAAA1B,EAAAmH,EAAAC,EAAA8J,EAAAC,IAEAnR,EAAAutB,KACA7rB,EAAAorB,cAAA5zB,EAAAwI,EAAAorB,eAGA,OAAAprB,EAAAzJ,QAAAiB,EAAAwI,EAAAzJ,UAKAu1B,GAAA,aAQA,MAAAC,GAAA3iM,SAoBA,SAAA4iM,GAAAhyH,EAAAj0E,EAAAkmM,GAAA,EAAAxxG,GAAA,GACA,MAAAs7E,EAAA+W,GAAAmG,GACA,GAAAld,EAAA,CACA,MAAA4X,EAAA5X,EAAA/7F,KAEA,GAAAA,IAAA8xH,GAAA,CACA,MAAA91G,EAAAwiG,GAAA7K,GACA,GAAA33F,IACAA,IAAAjwF,GACAiwF,IAAAjvF,EAAAkvF,SAAAlwF,IACAiwF,IAAAjvF,EAAA86E,WAAA96E,EAAAkvF,SAAAlwF,KACA,OAAA4nL,EAGA,MAAA1uG,EAGAi6F,GAAAnD,EAAA/7F,IAAA2zG,EAAA3zG,GAAAj0E,IAEAmzK,GAAAnD,EAAAsS,WAAAruG,GAAAj0E,GACA,OAAAk5E,GAAAwb,EAEAkzF,EAEA1uG,GAGA,SAAAi6F,GAAAgzB,EAAAnmM,GACA,OAAAmmM,IACAA,EAAAnmM,IACAmmM,EAAAnlM,EAAAkvF,SAAAlwF,KACAmmM,EAAAnlM,EAAA86E,WAAA96E,EAAAkvF,SAAAlwF,MAGA,MAAA26K,GAAAt3K,YAAAR,GACAi5L,GAAAz4L,YAAAR,GACA8lL,GAAAtlL,YAAAR,GACAk5L,GAAA14L,YAAAR,GAMA6lL,GAAA,GACA,IAAAkE,GAAA,KAiBA,SAAAD,GAAA3pG,GAAA,GACA0lG,GAAAzwG,KAAA20G,GAAA5pG,EAAA,KAAA,IAEA,SAAA6pG,KACAnE,GAAAt9F,MACAwhG,GAAAlE,GAAAA,GAAAt2G,OAAA,IAAA,KAMA,IAAAg0H,GAAA,EAiBA,SAAA5e,GAAA3mL,GACAulM,IAAAvlM,EASA,SAAAwlM,GAAApyH,EAAAH,EAAA4C,EAAAmM,EAAAC,GACA,MAAAm3F,EAAAe,GAAA/mG,EAAAH,EAAA4C,EAAAmM,EAAAC,GAAA,GAWA,OATAm3F,EAAA8S,gBACAqZ,GAAA,EAAAxZ,IAAA5rL,EAAAypG,UAAA,KAEAoiF,KAGAuZ,GAAA,GAAAxZ,IACAA,GAAA30G,KAAAgiG,GAEAA,EAEA,SAAA/1F,GAAArjF,GACA,QAAAA,IAAA,IAAAA,EAAAylM,YAEA,SAAAzb,GAAAtB,EAAAC,GACA,OAAAD,EAAAt1G,OAAAu1G,EAAAv1G,MAAAs1G,EAAApnL,MAAAqnL,EAAArnL,IAUA,MAAAokM,GAAA,cACAC,GAAA,EAAArkM,IAAAA,KAAA,MAAAA,EAAAA,EAAA,KACAskM,GAAA,EAAA1U,IAAAA,KACA,MAAAA,EACA/wL,EAAAe,SAAAgwL,IAAA7P,EAAAsB,MAAAuO,IAAA/wL,EAAA43F,WAAAm5F,GACA,CAAAz9G,EAAAyyG,EAAA5rE,EAAA42E,GACAA,EACA,KAEA/W,GACA,SAAA/mG,EAAAH,EAAA,KAAA4C,EAAA,KAAAmM,EAAA,EAAAC,EAAA,KAAA4jH,GAAA,GACAzyH,GAAAA,IAAA+xH,KACA/xH,EAAA00G,IAEA,GAAAzkG,GAAAjQ,GAAA,CAIA,MAAA09F,EAAA6W,GAAAv0G,EAAAH,GAAA,GAIA,OAHA4C,GACAiwH,GAAAh1B,EAAAj7F,GAEAi7F,EA+yBA9wK,EA5yBAozE,EA6yBAjzE,EAAA43F,WAAA/3F,IAAA,cAAAA,IA5yBAozE,EAAAA,EAAA2yH,WA2yBA,IAAA/lM,EAxyBA,GAAAizE,EAAA,EAEAouG,EAAA2kB,QAAA/yH,IAAAyyH,MAAAzyH,KACAA,EAAA9yE,EAAA0B,OAAA,GAAAoxE,IAEA,IAAA8rH,MAAAkH,EAAA90B,MAAAA,GAAAl+F,EACAgzH,IAAA9lM,EAAAe,SAAA+kM,KACAhzH,EAAA8rH,MAAA5+L,EAAAs4E,eAAAwtH,IAEA9lM,EAAA2lF,SAAAqrF,KAGAkQ,EAAA2kB,QAAA70B,KAAAhxK,EAAAipF,QAAA+nF,KACAA,EAAAhxK,EAAA0B,OAAA,GAAAsvK,IAEAl+F,EAAAk+F,MAAAhxK,EAAAw4E,eAAAw4F,IAIA,MAAAmW,EAAAnnL,EAAAe,SAAAkyE,GACA,EA3jIA,CAAAA,GAAAA,EAAAq1G,aA4jIAyd,CAAA9yH,GACA,IAnXA,CAAAA,GAAAA,EAAAuxH,aAoXAwB,CAAA/yH,GACA,GACAjzE,EAAA2lF,SAAA1S,GACA,EACAjzE,EAAA43F,WAAA3kB,GACA,EACA,EACAgmG,EAAA,CACAqsB,aAAA,EACAW,UAAA,EACAhzH,KAAAA,EACAH,MAAAA,EACA3xE,IAAA2xE,GAAA0yH,GAAA1yH,GACAi+G,IAAAj+G,GAAA2yH,GAAA3yH,GACA2F,QAAAutG,EACAyC,aAAA,KACA/yG,SAAA,KACA32E,UAAA,KACA+pL,SAAA,KACAG,UAAA,KACAE,WAAA,KACA1B,KAAA,KACArJ,WAAA,KACA/8K,GAAA,KACAmuK,OAAA,KACA+H,OAAA,KACA8sB,aAAA,KACApJ,YAAA,EACA9T,UAAAA,EACAtlG,UAAAA,EACAC,aAAAA,EACAiqG,gBAAA,KACAzK,WAAA,MAEAqkB,GAAA1sB,EAAAvjG,GAEA,IAAAyxG,GACAl0G,EAAA++B,UAAAinE,GAEAmsB,GAAA,IAEAM,GAEA9Z,KAKA/pG,EAAA,GAAA,EAAAslG,IAGA,KAAAtlG,GACA+pG,GAAA30G,KAAAgiG,GAEA,OAAAA,GAEA,SAAAuO,GAAAvO,EAAAitB,EAAAC,GAAA,GAGA,MAAArzH,MAAAA,EAAAi+G,IAAAA,EAAAlvG,UAAAA,EAAAnM,SAAAA,GAAAujG,EACAmtB,EAAAF,EAAAG,GAAAvzH,GAAA,GAAAozH,GAAApzH,EAiDA,MAhDA,CACAwyH,aAAA,EACAW,UAAA,EACAhzH,KAAAgmG,EAAAhmG,KACAH,MAAAszH,EACAjlM,IAAAilM,GAAAZ,GAAAY,GACArV,IAAAmV,GAAAA,EAAAnV,IAIAoV,GAAApV,EACA/wL,EAAAipF,QAAA8nG,GACAA,EAAA/yF,OAAAynG,GAAAS,IACA,CAAAnV,EAAA0U,GAAAS,IACAT,GAAAS,GACAnV,EACAt4G,QAAAwgG,EAAAxgG,QACAgwG,aAAAxP,EAAAwP,aACA/yG,SAAAA,EACA6hG,OAAA0B,EAAA1B,OACA8sB,aAAAprB,EAAAorB,aACApJ,YAAAhiB,EAAAgiB,YACA9T,UAAAlO,EAAAkO,UAKAtlG,UAAAqkH,GAAAjtB,EAAAhmG,OAAA0mG,IACA,IAAA93F,EACA,GACA,GAAAA,EACAA,EACAC,aAAAm3F,EAAAn3F,aACAiqG,gBAAA9S,EAAA8S,gBACAzK,WAAArI,EAAAqI,WACAmG,KAAAxO,EAAAwO,KACArJ,WAAAnF,EAAAmF,WAKAr/K,UAAAk6K,EAAAl6K,UACA+pL,SAAA7P,EAAA6P,SACAG,UAAAhQ,EAAAgQ,WAAAzB,GAAAvO,EAAAgQ,WACAE,WAAAlQ,EAAAkQ,YAAA3B,GAAAvO,EAAAkQ,YACA9nL,GAAA43K,EAAA53K,GACAmuK,OAAAyJ,EAAAzJ,QAOA,SAAA+rB,GAAAjiH,EAAA,IAAA8T,EAAA,GACA,OAAA4sF,GAAA8gB,GAAA,KAAAxhH,EAAA8T,GAuBA,SAAAi6F,GAAAxwG,GACA,OAAA,MAAAA,GAAA,kBAAAA,EAEAmjG,GAAA2N,IAEA3nL,EAAAipF,QAAApS,GAEAmjG,GAAAL,GAAA,KAEA9iG,EAAAtF,SAEA,iBAAAsF,EAGA0nH,GAAA1nH,GAIAmjG,GAAA8gB,GAAA,KAAAtoH,OAAAqE,IAIA,SAAA0nH,GAAA1nH,GACA,OAAA,OAAAA,EAAAx1E,GAAAw1E,EAAA2wG,GAAA3wG,GAEA,SAAA8uH,GAAA1sB,EAAAvjG,GACA,IAAAzC,EAAA,EACA,MAAAk0G,UAAAA,GAAAlO,EACA,GAAA,MAAAvjG,EACAA,EAAA,UAEA,GAAA11E,EAAAipF,QAAAvT,GACAzC,EAAA,QAEA,GAAA,iBAAAyC,EAAA,CACA,GAAA,EAAAyxG,GAAA,GAAAA,EAAA,CAEA,MAAAmf,EAAA5wH,EAAAp2E,QAOA,YANAgnM,IAEAA,EAAA5f,KAAA4f,EAAA/f,IAAA,GACAof,GAAA1sB,EAAAqtB,KACAA,EAAA5f,KAAA4f,EAAA/f,IAAA,KAIA,CACAtzG,EAAA,GACA,MAAA4qB,EAAAnoB,EAAA4R,EACAuW,GAAA0nG,MAAA7vH,EAGA,IAAAmoB,GAAAkoF,IAGA,IAAAA,EAAAhoF,MAAAzW,EACA5R,EAAA4R,EAAA,GAGA5R,EAAA4R,EAAA,EACA2xF,EAAAp3F,WAAA,OAVAnM,EAAAmjH,KAAA9S,QAeA/lL,EAAA43F,WAAAliB,IACAA,EAAA,CAAAp2E,QAAAo2E,EAAAmjH,KAAA9S,GACA9yG,EAAA,KAGAyC,EAAAlD,OAAAkD,GAEA,GAAAyxG,GACAl0G,EAAA,GACAyC,EAAA,CAAA6lH,GAAA7lH,KAGAzC,EAAA,GAGAgmG,EAAAvjG,SAAAA,EACAujG,EAAAkO,WAAAl0G,EAEA,SAAAozH,MAAA9jH,GACA,MAAA+V,EAAAt4F,EAAA0B,OAAA,GAAA6gF,EAAA,IACA,IAAA,IAAAjP,EAAA,EAAAA,EAAAiP,EAAAnR,OAAAkC,IAAA,CACA,MAAAizH,EAAAhkH,EAAAjP,GACA,IAAA,MAAAnyE,KAAAolM,EACA,GAAA,UAAAplM,EACAm3F,EAAAsmG,QAAA2H,EAAA3H,QACAtmG,EAAAsmG,MAAA5+L,EAAAs4E,eAAA,CAAAggB,EAAAsmG,MAAA2H,EAAA3H,cAGA,GAAA,UAAAz9L,EACAm3F,EAAA04E,MAAAhxK,EAAAw4E,eAAA,CAAA8f,EAAA04E,MAAAu1B,EAAAv1B,aAEA,GAAAhxK,EAAA8gG,KAAA3/F,GAAA,CACA,MAAAogG,EAAAjJ,EAAAn3F,GACAsgG,EAAA8kG,EAAAplM,GACAogG,IAAAE,IACAnJ,EAAAn3F,GAAAogG,EACA,GAAAvD,OAAAuD,EAAAE,GACAA,OAGA,KAAAtgG,IACAm3F,EAAAn3F,GAAAolM,EAAAplM,IAIA,OAAAm3F,EAyFA,SAAAkuG,GAAAC,GACA,OAAAA,EAAA1zH,MAAA8D,IACAqM,GAAArM,IAEAA,EAAA5D,OAAA00G,MAEA9wG,EAAA5D,OAAA0mG,KACA6sB,GAAA3vH,EAAAnB,aAIA+wH,EACA,KAoBA,MAAAC,GAAApzH,GACAA,EAEAqzH,GAAArzH,GACAA,EAAA4iH,QAAA5iH,EAAA4iH,QAAA5iH,EAAA8sG,MACAsmB,GAAApzH,EAAAV,QAHA,KAKAg0H,GAAA5mM,EAAA0B,OAAA/B,OAAAU,OAAA,MAAA,CACAwmM,EAAAvzH,GAAAA,EACAwzH,IAAAxzH,GAAAA,EAAA2lG,MAAA53K,GACA0lM,MAAAzzH,GAAAA,EAAAulF,KACAmuC,OAAA1zH,GAAAA,EAAA,MACA2zH,OAAA3zH,GAAAA,EAAA,MACA4zH,OAAA5zH,GAAAA,EAAA,MACA6zH,MAAA7zH,GAAAA,EAAA,KACA8zH,QAAA9zH,GAAAozH,GAAApzH,EAAAV,QACAy0H,MAAA/zH,GAAAozH,GAAApzH,EAAAsZ,MACA06G,MAAAh0H,GAAAA,EAAA0xG,KACAuiB,SAAAj0H,GAAAygH,GAAAzgH,GACAk0H,aAAAl0H,GAAA,IAAA0wG,EAAA1wG,EAAAwuF,QACA2lC,UAAAn0H,GAAAywG,EAAAj/E,KAAAxxB,EAAA8sG,OACAsnB,OAAAp0H,GAAA26G,GAAAnpF,KAAAxxB,KAEAq0H,GAAA,CACA3kM,KAAAskF,EAAA0nF,GAAA7tK,GACA,MAAAilL,IAAAA,EAAAY,WAAAA,EAAAnuB,KAAAA,EAAA/lF,MAAAA,EAAA80H,YAAAA,EAAA30H,KAAAA,EAAAquG,WAAAA,GAAAtS,EAEA,GAAA,aAAA7tK,EACA,OAAA,EAQA,IAAA0mM,EACA,GAAA,MAAA1mM,EAAA,GAAA,CACA,MAAAf,EAAAwnM,EAAAzmM,GACA,QAAAU,IAAAzB,EACA,OAAAA,GACA,KAAA,EACA,OAAA4mL,EAAA7lL,GACA,KAAA,EACA,OAAA03J,EAAA13J,GACA,KAAA,EACA,OAAAilL,EAAAjlL,GACA,KAAA,EACA,OAAA2xE,EAAA3xE,OAIA,CAAA,GAAA6lL,IAAAhnL,EAAA6uF,WAAA7uF,EAAAk2F,OAAA8wF,EAAA7lL,GAEA,OADAymM,EAAAzmM,GAAA,EACA6lL,EAAA7lL,GAEA,GAAA03J,IAAA74J,EAAA6uF,WAAA7uF,EAAAk2F,OAAA2iE,EAAA13J,GAEA,OADAymM,EAAAzmM,GAAA,EACA03J,EAAA13J,GAEA,IAGA0mM,EAAA74B,EAAA8X,aAAA,KACA9mL,EAAAk2F,OAAA2xG,EAAA1mM,GAEA,OADAymM,EAAAzmM,GAAA,EACA2xE,EAAA3xE,GAEA,GAAAilL,IAAApmL,EAAA6uF,WAAA7uF,EAAAk2F,OAAAkwF,EAAAjlL,GAEA,OADAymM,EAAAzmM,GAAA,EACAilL,EAAAjlL,GAEA0yL,KACA+T,EAAAzmM,GAAA,IAGA,MAAA2mM,EAAAlB,GAAAzlM,GACA,IAAA4mM,EAAA7O,EAEA,OAAA4O,GACA,WAAA3mM,GACA+/K,EAAA8mB,MAAAh5B,EAAA,MAAA7tK,GAEA2mM,EAAA94B,KAIA+4B,EAAA90H,EAAA0tG,gBACAonB,EAAAA,EAAA5mM,IACA4mM,EAEA3hB,IAAApmL,EAAA6uF,WAAA7uF,EAAAk2F,OAAAkwF,EAAAjlL,IAEAymM,EAAAzmM,GAAA,EACAilL,EAAAjlL,KAIA+3L,EAAA5X,EAAA56F,OAAAwyG,iBACAl5L,EAAAk2F,OAAAgjG,EAAA/3L,GAEA+3L,EAAA/3L,QALA,IAUA6B,KAAAskF,EAAA0nF,GAAA7tK,EAAAtB,GACA,MAAAg5J,KAAAA,EAAAmuB,WAAAA,EAAAZ,IAAAA,GAAApX,EACA,GAAAgY,IAAAhnL,EAAA6uF,WAAA7uF,EAAAk2F,OAAA8wF,EAAA7lL,GACA6lL,EAAA7lL,GAAAtB,OAEA,GAAAg5J,IAAA74J,EAAA6uF,WAAA7uF,EAAAk2F,OAAA2iE,EAAA13J,GACA03J,EAAA13J,GAAAtB,OAEA,GAAAG,EAAAk2F,OAAA84E,EAAAl8F,MAAA3xE,GACA,OAAA,EAEA,OAAA,MAAAA,EAAA,MAAAA,EAAAowE,MAAA,KAAAy9F,MAKAoX,EAAAjlL,GAAAtB,GAGA,IAEAmD,KAAAskF,GAAAuxE,KAAAA,EAAAmuB,WAAAA,EAAA4gB,YAAAA,EAAAxhB,IAAAA,EAAA9E,WAAAA,EAAAwF,aAAAA,IAAA3lL,GACA,IAAA0mM,EACA,YAAAhmM,IAAA+lM,EAAAzmM,IACA03J,IAAA74J,EAAA6uF,WAAA7uF,EAAAk2F,OAAA2iE,EAAA13J,IACA6lL,IAAAhnL,EAAA6uF,WAAA7uF,EAAAk2F,OAAA8wF,EAAA7lL,KACA0mM,EAAA/gB,EAAA,KAAA9mL,EAAAk2F,OAAA2xG,EAAA1mM,IACAnB,EAAAk2F,OAAAkwF,EAAAjlL,IACAnB,EAAAk2F,OAAA0wG,GAAAzlM,IACAnB,EAAAk2F,OAAAorF,EAAA56F,OAAAwyG,iBAAA/3L,KAGA8mM,GAAAjoM,EAAA0B,OAAA,GAAAimM,GAAA,CACA3kM,IAAAu0K,EAAAp2K,GAEA,GAAAA,IAAAkB,OAAA6lM,YAGA,OAAAP,GAAAh6G,IAAA4pF,EAAAp2K,EAAAo2K,IAEArsF,IAAA,CAAA5D,EAAAnmF,IACA,MAAAA,EAAA,KAAAnB,EAAAo3F,sBAAAj2F,KAKAgnM,GAAAlP,KACA,IAAAmP,GAAA,EACA,SAAAzI,GAAA1mB,EAAArmG,EAAAk2G,GACA,MAAA71G,EAAAgmG,EAAAhmG,KAEAquG,GAAA1uG,EAAAA,EAAA0uG,WAAArI,EAAAqI,aAAA6mB,GACAn5B,EAAA,CACAoqB,IAAAgP,KACAnvB,MAAAA,EACAhmG,KAAAA,EACAL,OAAAA,EACA0uG,WAAAA,EACA10F,KAAA,KACArD,KAAA,KACA6+F,QAAA,KACAtmB,OAAA,KACA//J,OAAA,KACAq+K,MAAA,KACA8V,QAAA,KACArP,UAAA,KACAkD,QAAA,KACAoC,SAAAv5G,EAAAA,EAAAu5G,SAAAxsL,OAAAU,OAAAihL,EAAA6K,UACAyb,YAAA,KACA7gB,YAAA,GAEAvlG,WAAA,KACAC,WAAA,KAEAqlG,aAAA8Q,GAAA3kH,EAAAquG,GACA2G,aAAA3C,EAAAryG,EAAAquG,GAEA0D,KAAA,KACAK,QAAA,KAEAsS,cAAA33L,EAAA6uF,UAEAo4F,aAAAh0G,EAAAg0G,aAEAb,IAAApmL,EAAA6uF,UACAgqE,KAAA74J,EAAA6uF,UACA/b,MAAA9yE,EAAA6uF,UACAk+E,MAAA/sK,EAAA6uF,UACAkP,MAAA/9F,EAAA6uF,UACAytG,KAAAt8L,EAAA6uF,UACAm4F,WAAAhnL,EAAA6uF,UACAw5G,aAAA,KAEAvf,SAAAA,EACAwC,WAAAxC,EAAAA,EAAAgB,UAAA,EACAsB,SAAA,KACAG,eAAA,EAGAsC,WAAA,EACArD,aAAA,EACAoH,eAAA,EACA0W,GAAA,KACA1vH,EAAA,KACA6nH,GAAA,KACAp1G,EAAA,KACA+0G,GAAA,KACAC,EAAA,KACA/W,GAAA,KACAia,IAAA,KACAtR,GAAA,KACAj/G,EAAA,KACAu1H,IAAA,KACAC,IAAA,KACAzyH,GAAA,KACA0yH,GAAA,MAOA,OAJAz5B,EAAAoX,IAAA,CAAA9+F,EAAA0nF,GAEAA,EAAApiF,KAAAha,EAAAA,EAAAga,KAAAoiF,EACAA,EAAAgW,KAAAA,EAAAlgF,KAAA,KAAAkqE,GACAA,EAEA,IAAAkd,GAAA,KACA,MAAAzT,GAAA,IAAAyT,IAAAnG,EACAqN,GAAApkB,IACAkd,GAAAld,GAEA,SAAA23B,GAAA33B,GACA,OAAA,EAAAA,EAAAiK,MAAAkO,UAEA,IAyEA1lL,GAzEAisL,IAAA,EACA,SAAAkS,GAAA5wB,EAAA05B,GAAA,GACAhb,GAAAgb,EACA,MAAA51H,MAAAA,EAAA4C,SAAAA,GAAAs5F,EAAAiK,MACA0vB,EAAAhC,GAAA33B,IAp+FA,SAAAA,EAAAgG,EAAA2zB,EACAD,GAAA,GACA,MAAA51H,EAAA,GACAi6F,EAAA,GACA/sK,EAAA+qG,IAAAgiE,EAAAw4B,GAAA,GACAv2B,EAAA2oB,cAAAh4L,OAAAU,OAAA,MACA62L,GAAAloB,EAAAgG,EAAAliG,EAAAi6F,GAEA,IAAA,MAAA5rK,KAAA6tK,EAAA8X,aAAA,GACA3lL,KAAA2xE,IACAA,EAAA3xE,QAAAU,GAGA8mM,EAEA35B,EAAAl8F,MAAA41H,EAAA51H,EAAAouG,EAAA0nB,gBAAA91H,GAGAk8F,EAAA/7F,KAAAH,MAMAk8F,EAAAl8F,MAAAA,EAJAk8F,EAAAl8F,MAAAi6F,EAOAiC,EAAAjC,MAAAA,EA08FA87B,CAAA75B,EAAAl8F,EAAA61H,EAAAD,GA7qFA,EAAA15B,EAAAt5F,KACA,GAAA,GAAAs5F,EAAAiK,MAAAkO,UAAA,CACA,MAAAl0G,EAAAyC,EAAA4R,EACArU,GAGA+7F,EAAAjxE,MAAAmjF,EAAAzH,MAAA/jG,GAEA11E,EAAA+qG,IAAAr1B,EAAA,IAAAzC,IAGA0lH,GAAAjjH,EAAAs5F,EAAAjxE,MAAA,SAIAixE,EAAAjxE,MAAA,GACAroB,GACAojH,GAAA9pB,EAAAt5F,GAGA11E,EAAA+qG,IAAAikE,EAAAjxE,MAAAwnG,GAAA,IA0pFAuD,CAAA95B,EAAAt5F,GACA,MAAAqzH,EAAAJ,EAMA,SAAA35B,EAAA05B,GACA,MAAA9hB,EAAA5X,EAAA/7F,KAEA+7F,EAAA44B,YAAAjoM,OAAAU,OAAA,MAGA2uK,EAAAoR,MAAA,IAAA4oB,MAAAh6B,EAAAoX,IAAAuhB,IAEA,MAAAhX,MAAAA,GAAA/J,EACA,GAAA+J,EAAA,CACA,MAAA0X,EAAAr5B,EAAAq5B,aACA1X,EAAAv/G,OAAA,EAAA63H,GAAAj6B,GAAA,KACAkd,GAAAld,EACAkS,EAAAE,gBACA,MAAA2nB,EAAAjnB,EAAA6O,EAAA3hB,EAAA,EAAA,CAAAA,EAAAl8F,MAAAu1H,IAGA,GAFAnnB,EAAAoB,gBACA4J,GAAA,KACAlsL,EAAAmqG,UAAA4+F,GAAA,CACA,GAAAL,EAEA,OAAAK,EACA3+F,MAAA8+F,IACA1d,GAAAxc,EAAAk6B,EAAAR,MAEAr+F,OAAAnqG,IACAuiL,EAAAviL,EAAA8uK,EAAA,MAMAA,EAAAoc,SAAA2d,OAIAvd,GAAAxc,EAAA+5B,EAAAL,QAIAS,GAAAn6B,EAAA05B,GA5CAU,CAAAp6B,EAAA05B,QACA7mM,EAEA,OADA6rL,IAAA,EACAqb,EA4CA,SAAAvd,GAAAxc,EAAA+5B,EAAAL,GACA1oM,EAAA43F,WAAAmxG,GAEA/5B,EAAA/7F,KAAAo2H,kBAGAr6B,EAAAs6B,UAAAP,EAGA/5B,EAAAjtK,OAAAgnM,EAGA/oM,EAAA2lF,SAAAojH,KACA/5B,EAAAgY,WAAA9F,EAAAiV,UAAA4S,IAGAI,GAAAn6B,EAAA05B,GAYA,SAAAS,GAAAn6B,EAAA05B,EAAAa,GACA,MAAA3iB,EAAA5X,EAAA/7F,KAEA,GAAAy1H,EAMA15B,EAAAjtK,OAAAitK,EAAAjtK,QACA6kL,EAAA7kL,QACA/B,EAAAiB,UAEA,IAAA+tK,EAAAjtK,OAAA,CAEA,GAAAN,KAAAmlL,EAAA7kL,OAAA,CACA,MAAAlB,EAAA+lL,EAAA/lL,SACA,GAAAA,EAAA,CACA,MAAA+4E,gBAAAA,EAAAu/G,gBAAAA,GAAAnqB,EAAAsS,WAAA56F,QACAQ,WAAAA,EAAAiyG,gBAAAqQ,GAAA5iB,EACA6iB,EAAAzpM,EAAA0B,OAAA1B,EAAA0B,OAAA,CACAk4E,gBAAAA,EACAsN,WAAAA,GACAiyG,GAAAqQ,GACA5iB,EAAA7kL,OAAAN,GAAAZ,EAAA4oM,IAGAz6B,EAAAjtK,OAAA6kL,EAAA7kL,QAAA/B,EAAAiB,KAIA+tK,EAAAjtK,OAAAE,MACA+sK,EAAA6X,UAAA,IAAAmiB,MAAAh6B,EAAAoX,IAAA6hB,KAKA/b,GAAAld,EACAkS,EAAAE,gBACA0S,GAAA9kB,GACAkS,EAAAoB,gBACA4J,GAAA,KAGA,SAAA+c,GAAAj6B,GACA,MAAAqmB,EAAAa,IACAlnB,EAAAknB,QAAAhV,EAAAiV,UAAAD,IAGA,MAAA,CACAnpB,MAAAiC,EAAAjC,MACAhvE,MAAAixE,EAAAjxE,MACAinF,KAAAhW,EAAAgW,KACAqQ,OAAAA,GAMA,SAAArH,GAAAD,EAAA/e,EAAAkd,IACAld,IACAA,EAAA+a,UAAA/a,EAAA+a,QAAA,KAAA9yG,KAAA82G,GAGA,MAAA2b,GAAA,kBAEA,SAAAjY,GAAA7K,GACA,OAAA5mL,EAAA43F,WAAAgvF,IACAA,EAAA7S,aACA6S,EAAA5nL,KAGA,SAAA+iL,GAAA/S,EAAA4X,EAAA/tF,GAAA,GACA,IAAA75F,EAAAyyL,GAAA7K,GACA,IAAA5nL,GAAA4nL,EAAA+iB,OAAA,CACA,MAAAlgH,EAAAm9F,EAAA+iB,OAAAlgH,MAAA,mBACAA,IACAzqF,EAAAyqF,EAAA,IAGA,IAAAzqF,GAAAgwK,GAAAA,EAAAp8F,OAAA,CAEA,MAAAg3H,EAAAzE,IACA,IAAA,MAAAhkM,KAAAgkM,EACA,GAAAA,EAAAhkM,KAAAylL,EACA,OAAAzlL,GAIAnC,EACA4qM,EAAA56B,EAAAxtF,YACAwtF,EAAAp8F,OAAAK,KAAAuO,aAAAooH,EAAA56B,EAAAsS,WAAA9/F,YAEA,OAAAxiF,EAAAA,EA5BAqmF,QAAAqkH,IAAA9wH,GAAAA,EAAAipB,gBAAAxc,QAAA,QAAA,IA4BAwT,EAAA,MAAA,YAMA,SAAAd,GAAA8xG,GACA,MAAAjxH,EAAAsoG,EAAAnpF,SAAA8xG,GAEA,OADA7b,GAAAp1G,EAAAm1G,QACAn1G,EA4CA,MAAAkxH,GAAAznM,OAAA,IAoBA,MAAAwtG,GAAA,QAaAk6F,GAZA,CACApK,wBAAAA,GACAC,eAAAA,GACAjZ,oBAAAA,EACAV,4BAAAA,EACA/iG,QAAAA,GACAmkG,eAAAA,IAgBA5nL,EAAAuqM,UAAA9oB,EAAA8oB,UACAvqM,EAAAomM,QAAA3kB,EAAA2kB,QACApmM,EAAA2tL,WAAAlM,EAAAkM,WACA3tL,EAAAwqM,WAAA/oB,EAAA+oB,WACAxqM,EAAA+iL,MAAAtB,EAAAsB,MACA/iL,EAAAyqM,QAAAhpB,EAAAgpB,QACAzqM,EAAA02L,UAAAjV,EAAAiV,UACA12L,EAAAk2L,SAAAzU,EAAAyU,SACAl2L,EAAAooJ,SAAAq5B,EAAAr5B,SACApoJ,EAAAsxL,IAAA7P,EAAA6P,IACAtxL,EAAAmpM,gBAAA1nB,EAAA0nB,gBACAnpM,EAAA0qM,gBAAAjpB,EAAAipB,gBACA1qM,EAAA2qM,WAAAlpB,EAAAkpB,WACA3qM,EAAAg6K,MAAAyH,EAAAzH,MACAh6K,EAAA22L,MAAAlV,EAAAkV,MACA32L,EAAA4qM,OAAAnpB,EAAAmpB,OACA5qM,EAAA6qM,WAAAppB,EAAAopB,WACA7qM,EAAA8qM,MAAArpB,EAAAqpB,MACA9qM,EAAAyvF,SAAAlvF,EAAAkvF,SACAzvF,EAAAq7E,WAAA96E,EAAA86E,WACAr7E,EAAAk5E,gBAAA34E,EAAA24E,gBACAl5E,EAAA6iG,aAAAtiG,EAAAsiG,aACA7iG,EAAAo0K,eAAAA,GACAp0K,EAAA6qL,QAAA3C,GACAloL,EAAAk6K,SAAAA,GACAl6K,EAAAwxL,UAAAA,GACAxxL,EAAAs7L,OAAAA,GACAt7L,EAAA4oL,SAAAA,EACA5oL,EAAA8kM,SAAAA,GACA9kM,EAAAq7L,KAAAA,GACAr7L,EAAAwzK,2BAAAA,EACAxzK,EAAAqiL,sBAAAA,EACAriL,EAAA+nL,WAAAA,GACA/nL,EAAA+qM,YAnCA,KAoCA/qM,EAAAs4F,SAAAA,GACAt4F,EAAA4lM,YAAAA,GACA5lM,EAAAgrM,mBAjxBA,SAAAnxH,EAAA,GAGAoxH,GAAA,GACA,OAAAA,GACA/e,KAAA0Z,GAAA1d,GAAA,KAAAruG,IACA0gG,GAAA2N,GAAA,KAAAruG,IA4wBA75E,EAAAsgL,wBA12EA,SAAAj/K,GACA,OAAA07L,GAAA17L,EAAAw5L,KA02EA76L,EAAAogL,eAj3EA,SAAA/+K,GACA,OAAA07L,GAAA17L,IAi3EArB,EAAAkrM,YAnnBA,SAAA5sG,EAAAxB,GACA,IAAA,IAAAjpB,EAAA,EAAAA,EAAAipB,EAAAnrB,OAAAkC,IAAA,CACA,MAAAgzH,EAAA/pG,EAAAjpB,GAEA,GAAAtzE,EAAAipF,QAAAq9G,GACA,IAAA,IAAA7oG,EAAA,EAAAA,EAAA6oG,EAAAl1H,OAAAqsB,IACAM,EAAAuoG,EAAA7oG,GAAAz+F,MAAAsnM,EAAA7oG,GAAA1M,QAGAu1G,IAEAvoG,EAAAuoG,EAAAtnM,MAAAsnM,EAAAv1G,IAGA,OAAAgN,GAsmBAt+F,EAAAmrM,kBA/xBA,SAAA13H,EAAA23H,GAGA,MAAA5xB,EAAAe,GAAA+gB,GAAA,KAAA7nH,GAEA,OADA+lG,EAAAgiB,YAAA4P,EACA5xB,GA2xBAx5K,EAAA87L,gBAAAA,GACA97L,EAAAu6K,YAAAA,GACAv6K,EAAAqrM,qBAlgIA,SAAA5pH,GACAlhF,EAAA43F,WAAA1W,KACAA,EAAA,CAAA6pH,OAAA7pH,IAEA,MAAA6pH,OAAAA,EAAAC,iBAAAA,EAAAC,eAAAA,EAAAC,MAAAA,EAAA,IAAAj0B,QAAAA,EAAAk0B,YACAA,GAAA,EAAAvpM,QAAAwpM,GAAAlqH,EACA,IACAmqH,EADAC,EAAA,KAEAC,EAAA,EACA,MAKAC,EAAA,KACA,IAAAC,EACA,OAAAH,IACAG,EAAAH,EAAAP,IACA1gG,OAAAzE,IAEA,GADAA,EAAAA,aAAAX,MAAAW,EAAA,IAAAX,MAAAzyB,OAAAozB,IACAwlG,EACA,OAAA,IAAAl5B,SAAA,CAAAC,EAAAu5B,KAGAN,EAAAxlG,GAFA,IAAAusE,GAZAo5B,IACAD,EAAA,KACAE,QAWA,IAAAE,EAAA9lG,IACA2lG,EAAA,MAIA,MAAA3lG,KAGAwE,MAAAm7E,GACAkmB,IAAAH,GAAAA,EACAA,GAGA/lB,IACAA,EAAAplL,YAAA,WAAAolL,EAAAljL,OAAAspM,gBACApmB,EAAAA,EAAAjmL,SAEA+rM,EAAA9lB,EACAA,OAGA,OAAAmL,GAAA,CACA1xL,KAAA,wBACA6xL,cAAA2a,EACAjZ,sBACA,OAAA8Y,GAEAroM,QACA,MAAAgsK,EAAAkd,GAEA,GAAAmf,EACA,MAAA,IAAAva,GAAAua,EAAAr8B,GAEA,MAAAptK,EAAAgkG,IACA0lG,EAAA,KACA7oB,EAAA78E,EAAAopE,EAAA,IAAAi8B,IAGA,GAAAE,GAAAn8B,EAAA8Z,UACA,GACA,OAAA0iB,IACAphG,MAAAm7E,GACA,IAAAuL,GAAAvL,EAAAvW,KAEA3kE,OAAAzE,IACAhkG,EAAAgkG,GACA,IAAAqlG,EACAjxB,GAAAixB,EAAA,CACAvvH,MAAAkqB,IAEA,QAGA,MAAAgmG,EAAA1qB,EAAA6P,KAAA,GACAr1G,EAAAwlG,EAAA6P,MACA8a,EAAA3qB,EAAA6P,MAAAma,GA4BA,OA3BAA,GACAl0B,YAAA,KACA60B,EAAAhsM,OAAA,IACAqrM,GAEA,MAAAj0B,GACAD,YAAA,KACA,IAAA40B,EAAA/rM,QAAA67E,EAAA77E,MAAA,CACA,MAAA+lG,EAAA,IAAAX,MAAA,mCAAAgyE,QACAr1K,EAAAgkG,GACAlqB,EAAA77E,MAAA+lG,KAEAqxE,GAEAu0B,IACAphG,MAAA,KACAwhG,EAAA/rM,OAAA,EACAmvK,EAAAp8F,QAAA29G,GAAAvhB,EAAAp8F,OAAAqmG,QAGA+K,EAAAhV,EAAAp8F,OAAAkvF,WAGAz3D,OAAAzE,IACAhkG,EAAAgkG,GACAlqB,EAAA77E,MAAA+lG,KAEA,IACAgmG,EAAA/rM,OAAAwrM,EACAva,GAAAua,EAAAr8B,GAEAtzF,EAAA77E,OAAAorM,EACAjxB,GAAAixB,EAAA,CACAvvH,MAAAA,EAAA77E,QAGAmrM,IAAAa,EAAAhsM,MACAm6K,GAAAgxB,QADA,MAg5HAvrM,EAAAixL,gBAAAA,GACAjxL,EAAAqsM,WA5HA,WACA,OAAA,MA4HArsM,EAAAssM,YAjIA,WACA,OAAA,MAiIAtsM,EAAAg5K,mBAAAA,GACAh5K,EAAAm6K,yBAAAA,GACAn6K,EAAAm0K,EAvHA,SAAA3gG,EAAA+4H,EAAAt2H,GACA,MAAAwf,EAAA1S,UAAApR,OACA,OAAA,IAAA8jB,EACAl1F,EAAA2lF,SAAAqmH,KAAAhsM,EAAAipF,QAAA+iH,GAEA9oH,GAAA8oH,GACAhyB,GAAA/mG,EAAA,KAAA,CAAA+4H,IAGAhyB,GAAA/mG,EAAA+4H,GAIAhyB,GAAA/mG,EAAA,KAAA+4H,IAIA92G,EAAA,EACAxf,EAAAs0B,MAAAF,UAAAv4B,MAAAw4B,KAAAvnB,UAAA,GAEA,IAAA0S,GAAAhS,GAAAxN,KACAA,EAAA,CAAAA,IAEAskG,GAAA/mG,EAAA+4H,EAAAt2H,KAiGAj2E,EAAAgjL,YAAAA,EACAhjL,EAAAwsM,oBAlFA,aAmFAxsM,EAAA4sL,OAAAA,EACA5sL,EAAAysM,cA1PA,KAAAzqM,GA2PAhC,EAAAyjF,QAAAA,GACAzjF,EAAA4mM,WAAAA,GACA5mM,EAAAskL,SAAAA,EACAtkL,EAAAgzL,YAAAA,GACAhzL,EAAA8zL,cAAAA,GACA9zL,EAAAgvL,gBAAAA,GACAhvL,EAAA+zL,eAAAA,GACA/zL,EAAAkzL,cAAAA,GACAlzL,EAAAm0L,gBAAAA,GACAn0L,EAAA+uL,UAAAA,GACA/uL,EAAAk0L,gBAAAA,GACAl0L,EAAAi0L,kBAAAA,GACAj0L,EAAAg0L,iBAAAA,GACAh0L,EAAAyzL,YAAAA,GACAzzL,EAAAm5K,UAAAA,GACAn5K,EAAAksL,UAAAA,GACAlsL,EAAA0sM,WAzxKA,WACAnmB,EAAA,MAyxKAvmL,EAAAwsL,QAAAA,EACAxsL,EAAA2sM,YAnyKA,SAAAh8G,GACA41F,EAAA51F,GAmyKA3wF,EAAAklL,iBAAAA,EACAllL,EAAAyC,wBA1QA,SAAAmqM,GACA5qM,GAAA4qM,GA0QA5sM,EAAA6sM,WA5rBA,SAAAprH,EAAAqrH,GACA,IAAAj0G,EACA,GAAAt4F,EAAAipF,QAAA/H,IAAAlhF,EAAAe,SAAAmgF,GAAA,CACAoX,EAAA,IAAA0R,MAAA9oB,EAAA9P,QACA,IAAA,IAAAkC,EAAA,EAAA4hB,EAAAhU,EAAA9P,OAAAkC,EAAA4hB,EAAA5hB,IACAglB,EAAAhlB,GAAAi5H,EAAArrH,EAAA5N,GAAAA,QAGA,GAAA,iBAAA4N,EAAA,CACAoX,EAAA,IAAA0R,MAAA9oB,GACA,IAAA,IAAA5N,EAAA,EAAAA,EAAA4N,EAAA5N,IACAglB,EAAAhlB,GAAAi5H,EAAAj5H,EAAA,EAAAA,QAGA,GAAAtzE,EAAA2lF,SAAAzE,GACA,GAAAA,EAAA7+E,OAAAu0J,UACAt+D,EAAA0R,MAAA4rD,KAAA10E,EAAAqrH,OAEA,CACA,MAAAjsM,EAAAX,OAAAW,KAAA4gF,GACAoX,EAAA,IAAA0R,MAAA1pG,EAAA8wE,QACA,IAAA,IAAAkC,EAAA,EAAA4hB,EAAA50F,EAAA8wE,OAAAkC,EAAA4hB,EAAA5hB,IAAA,CACA,MAAAnyE,EAAAb,EAAAgzE,GACAglB,EAAAhlB,GAAAi5H,EAAArrH,EAAA//E,GAAAA,EAAAmyE,SAKAglB,EAAA,GAEA,OAAAA,GA+pBA74F,EAAA+sM,WAnoBA,SAAAzuG,EAAA/+F,EAAA8zE,EAAA,GAGAm3G,EAAAwiB,GACA,IAAAnG,EAAAvoG,EAAA/+F,GAKAsnM,GAAAA,EAAA5f,KACA4f,EAAA/f,IAAA,GAEAoF,KACA,MAAA+gB,EAAApG,GAAAE,GAAAF,EAAAxzH,IACA65H,EAAAtH,GAAA1rB,GAAA,CAAAx4K,IAAA2xE,EAAA3xE,KAAA,IAAAnC,KAAA0tM,IAAAziB,EAAAA,IAAA,IAAAyiB,GAAA,IAAA3uG,EAAAzW,EACA,IACA,GAOA,OANAmlH,GAAAE,EAAAl0H,UACAk0H,EAAAlkB,aAAA,CAAAkkB,EAAAl0H,QAAA,OAEA6tH,GAAAA,EAAA5f,KACA4f,EAAA/f,IAAA,GAEAomB,GA6mBAltM,EAAAmtM,iBAtoCA,SAAA5tM,EAAA00F,GACA,OAAAuxG,GAAAF,GAAA/lM,GAAA,EAAA00F,IAAA10F,GAsoCAS,EAAAotM,iBApnCA,SAAA7tM,GACA,OAAAimM,GAxBA,aAwBAjmM,IAonCAS,EAAAqtM,wBAjoCA,SAAA/tM,GACA,OAAAiB,EAAAe,SAAAhC,GACAkmM,GAAAF,GAAAhmM,GAAA,IAAAA,EAIAA,GAAAimM,IA4nCAvlM,EAAAstM,cAtFA,KAuFAttM,EAAAq6K,uBAAAA,GACAr6K,EAAA+mL,iBAAAA,GACA/mL,EAAAutM,gBA18KA,SAAAl4B,GACAr1K,EAAAwtM,SAAAn4B,GA08KAr1K,EAAAo6K,mBAAAA,GACAp6K,EAAAqqM,cAAAA,GACArqM,EAAAsqM,SAAAA,GACAtqM,EAAAytM,WAlmBA,SAAAliG,GACA,MAAA1S,EAAA,GACA,IAAA,MAAAn3F,KAAA6pG,EACA1S,EAAAt4F,EAAAsiG,aAAAnhG,IAAA6pG,EAAA7pG,GAEA,OAAAm3F,GA8lBA74F,EAAA0tM,mBA7/BA,SAAAC,KA8/BA3tM,EAAA4tM,WArKA,WACA,MAAA/5H,EAAAmlG,KACA,OAAAnlG,EAAA+0H,eAAA/0H,EAAA+0H,aAAAY,GAAA31H,KAoKA7zE,EAAA6tM,cApIA,KACA,CACA,MAAAlnB,EAAAiG,EAAAyd,IAKA,OAJA1jB,GACAjF,EAAA,oHAGAiF,IA8HA3mL,EAAAi5K,mBAAAA,GACAj5K,EAAAowG,QAAAA,GACApwG,EAAA0hL,KAAAA,EACA1hL,EAAAgtL,MAAAA,GACAhtL,EAAA8tM,YA5kJA,SAAAxf,EAAAjtL,GACA,OAAA4rL,GAAAqB,EAAA,KAAAjtL,IA4kJArB,EAAA0mL,QAAAA,EACA1mL,EAAA+tM,eAr8FA,SAAAv0B,EAAAx3F,GAEA,GAAA,OADAskG,EAEA,OAAA9M,EAEA,MAAAjK,EAJA+W,EAIA3F,MACAxgF,EAAAq5E,EAAAwO,OAAAxO,EAAAwO,KAAA,IACA,IAAA,IAAAn0G,EAAA,EAAAA,EAAAmO,EAAArQ,OAAAkC,IAAA,CACA,IAAA8F,EAAAv5E,EAAA0zE,EAAAK,EAAA5zE,EAAA6uF,WAAApN,EAAAnO,GACAtzE,EAAA43F,WAAAxe,KACAA,EAAA,CACA0iG,QAAA1iG,EACAs7G,QAAAt7G,IAGAwmB,EAAA3oB,KAAA,CACAmC,IAAAA,EACA41F,SAAAA,EACAnvK,MAAAA,EACA+qG,cAAA,EACAr3B,IAAAA,EACAK,UAAAA,IAGA,OAAAqlG,GA86FAx5K,EAAAguM,YA9yKAC,GAAAvnB,+EC9gBA,aAGE3mL,EAAOC,QAAUC,EAAQ,sGCH3B,aAEAC,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAAG,EAAAN,EAAA,eAEA,MAAAiuM,EAAA,IAAAzvG,QACA0vG,EAAA,GACA,IAAAC,EACA,MAAAC,EAAAzrM,OAAA,IACA0rM,EAAA1rM,OAAA,IAIA,SAAA0rL,EAAAh9F,EAAAjwF,EAAAd,EAAA6uF,YAHA,SAAAkC,GACA,OAAAA,IAAA,IAAAA,EAAAi9G,WAGAC,CAAAl9G,KACAA,EAAAA,EAAAkF,KAEA,MAAA83F,EAgBA,SAAAh9F,EAAAjwF,GACA,MAAAitL,EAAA,WACA,IAAAA,EAAAhJ,OACA,OAAAh0F,IAEA,IAAA68G,EAAAhzH,SAAAmzG,GAAA,CACAf,EAAAe,GACA,IAIA,OAHAmgB,IACAN,EAAA32H,KAAA82G,GACA8f,EAAA9f,EACAh9F,IAEA,QACA68G,EAAAxjH,MACAk4F,IACAurB,EAAAD,EAAAA,EAAAx8H,OAAA,MAWA,OAPA28G,EAAA39F,GAAAgpG,IACArL,EAAA7J,eAAApjL,EAAAojL,aACA6J,EAAAigB,WAAA,EACAjgB,EAAAhJ,QAAA,EACAgJ,EAAA93F,IAAAlF,EACAg9F,EAAA7E,KAAA,GACA6E,EAAAjtL,QAAAA,EACAitL,EA3CAogB,CAAAp9G,EAAAjwF,GAIA,OAHAA,EAAAi6K,MACAgT,IAEAA,EAWA,IAAAqL,EAAA,EA8BA,SAAApM,EAAAe,GACA,MAAA7E,KAAAA,GAAA6E,EACA,GAAA7E,EAAA93G,OAAA,CACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA41G,EAAA93G,OAAAkC,IACA41G,EAAA51G,GAAAsc,OAAAm+F,GAEA7E,EAAA93G,OAAA,GAGA,IAAAg9H,GAAA,EACA,MAAAC,EAAA,GACA,SAAAjtB,IACAitB,EAAAp3H,KAAAm3H,GACAA,GAAA,EAEA,SAAAF,IACAG,EAAAp3H,KAAAm3H,GACAA,GAAA,EAEA,SAAA9rB,IACA,MAAAp6F,EAAAmmH,EAAAjkH,MACAgkH,OAAAvsM,IAAAqmF,GAAAA,EAEA,SAAA8/G,EAAAzwB,EAAAtkG,EAAA9xE,GACA,IAAAitM,QAAAvsM,IAAAgsM,EACA,OAEA,IAAAS,EAAAX,EAAAhgH,IAAA4pF,GACA+2B,GACAX,EAAA//G,IAAA2pF,EAAA+2B,EAAA,IAAAn/G,KAEA,IAAAo/G,EAAAD,EAAA3gH,IAAAxsF,GACAotM,GACAD,EAAA1gH,IAAAzsF,EAAAotM,EAAA,IAAAzjH,KAEAyjH,EAAArjH,IAAA2iH,KACAU,EAAApjH,IAAA0iH,GACAA,EAAA3kB,KAAAjyG,KAAAs3H,IAGA,SAAA1zB,EAAAtD,EAAAtkG,EAAA9xE,EAAAi6K,EAAAxwE,EAAA4jG,GACA,MAAAF,EAAAX,EAAAhgH,IAAA4pF,GACA,IAAA+2B,EAEA,OAEA,MAAAvkB,EAAA,IAAAj/F,IACAK,EAAAsjH,IACAA,GACAA,EAAAluM,SAAAwtL,KACAA,IAAA8f,GAAA9f,EAAA7J,eACA6F,EAAA5+F,IAAA4iG,OAKA,GAAA,UAAA96G,EAGAq7H,EAAA/tM,QAAA4qF,QAEA,GAAA,WAAAhqF,GAAAnB,EAAAipF,QAAAsuF,GACA+2B,EAAA/tM,SAAA,CAAAguM,EAAAptM,MACA,WAAAA,GAAAA,GAAAi6K,IACAjwF,EAAAojH,WAUA,YAJA,IAAAptM,GACAgqF,EAAAmjH,EAAA3gH,IAAAxsF,IAGA8xE,GACA,IAAA,MACAjzE,EAAAipF,QAAAsuF,GAMAv3K,EAAAyqG,aAAAtpG,IAEAgqF,EAAAmjH,EAAA3gH,IAAA,YAPAxC,EAAAmjH,EAAA3gH,IAAAmgH,IACA9tM,EAAAmpG,MAAAouE,IACApsF,EAAAmjH,EAAA3gH,IAAAogH,KAOA,MACA,IAAA,SACA/tM,EAAAipF,QAAAsuF,KACApsF,EAAAmjH,EAAA3gH,IAAAmgH,IACA9tM,EAAAmpG,MAAAouE,IACApsF,EAAAmjH,EAAA3gH,IAAAogH,KAGA,MACA,IAAA,MACA/tM,EAAAmpG,MAAAouE,IACApsF,EAAAmjH,EAAA3gH,IAAAmgH,IAaA/jB,EAAAxpL,SARAwtL,IACAA,EAAAjtL,QAAA6sL,UACAI,EAAAjtL,QAAA6sL,UAAAI,GAGAA,OAMA,MAAA2gB,EAAA1uM,EAAAuwE,QAAA,+BACAo+H,EAAA,IAAA7jH,IAAAnrF,OAAAy0G,oBAAA/xG,QACAk0E,KAAAp1E,GAAAkB,OAAAlB,KACA+4E,OAAAl6E,EAAAi4E,WACA0V,EAAAihH,IACAC,EAAAD,GAAA,GAAA,GACAE,EAAAF,GAAA,GACAG,EAAAH,GAAA,GAAA,GACAI,EAAA,GA4BA,SAAAJ,EAAA3E,GAAA,EAAArG,GAAA,GACA,OAAA,SAAArsB,EAAAp2K,EAAA8tM,GACA,GAAA,mBAAA9tM,EACA,OAAA8oM,EAEA,GAAA,mBAAA9oM,EACA,OAAA8oM,EAEA,GAAA,YAAA9oM,GACA8tM,KACAhF,EACArG,EACAsL,GACAC,GACAvL,EACAwL,GACAC,IAAA1hH,IAAA4pF,GACA,OAAAA,EAEA,MAAA+3B,EAAAtvM,EAAAipF,QAAAsuF,GACA,IAAA0yB,GAAAqF,GAAAtvM,EAAAk2F,OAAA84G,EAAA7tM,GACA,OAAA00L,QAAAloG,IAAAqhH,EAAA7tM,EAAA8tM,GAEA,MAAA/2H,EAAA29G,QAAAloG,IAAA4pF,EAAAp2K,EAAA8tM,GACA,GAAAjvM,EAAAi4E,SAAA92E,GAAAwtM,EAAAzjH,IAAA/pF,GAAAutM,EAAAvtM,GACA,OAAA+2E,EAKA,GAHA+xH,GACAjC,EAAAzwB,EAAA,EAAAp2K,GAEAyiM,EACA,OAAA1rH,EAEA,GAAAsqG,GAAAtqG,GAAA,CAGA,OADAo3H,IAAAtvM,EAAAyqG,aAAAtpG,GACA+2E,EAAAr4E,MAAAq4E,EAEA,OAAAl4E,EAAA2lF,SAAAzN,GAIA+xH,EAAApiD,GAAA3vE,GAAAy9G,GAAAz9G,GAEAA,GAvEA,CAAA,WAAA,UAAA,eAAA33E,SAAAY,IACA,MAAAooI,EAAAv/B,MAAAF,UAAA3oG,GACA6tM,EAAA7tM,GAAA,YAAAohF,GACA,MAAAwmB,EAAA0wE,GAAAttE,MACA,IAAA,IAAA74B,EAAA,EAAA4hB,EAAAiX,KAAA/6B,OAAAkC,EAAA4hB,EAAA5hB,IACA00H,EAAAj/F,EAAA,EAAAz1B,EAAA,IAGA,MAAA4E,EAAAqxD,EAAAgmE,MAAAxmG,EAAAxmB,GACA,OAAA,IAAArK,IAAA,IAAAA,EAEAqxD,EAAAgmE,MAAAxmG,EAAAxmB,EAAAhM,IAAAkjG,KAGAvhG,MAIA,CAAA,OAAA,MAAA,QAAA,UAAA,UAAA33E,SAAAY,IACA,MAAAooI,EAAAv/B,MAAAF,UAAA3oG,GACA6tM,EAAA7tM,GAAA,YAAAohF,GACA6+F,IACA,MAAAlpG,EAAAqxD,EAAAgmE,MAAApjG,KAAA5pB,GAEA,OADA+/F,IACApqG,MAkDA,MAAA0V,EAAA4hH,IACAC,EAAAD,GAAA,GACA,SAAAA,EAAA5L,GAAA,GACA,OAAA,SAAArsB,EAAAp2K,EAAAtB,EAAAovM,GACA,IAAArkG,EAAA2sE,EAAAp2K,GACA,IAAAyiM,IACA/jM,EAAA45K,GAAA55K,GACA+qG,EAAA6uE,GAAA7uE,IACA5qG,EAAAipF,QAAAsuF,IAAAiL,GAAA53E,KAAA43E,GAAA3iL,IAEA,OADA+qG,EAAA/qG,MAAAA,GACA,EAGA,MAAA6vM,EAAA1vM,EAAAipF,QAAAsuF,IAAAv3K,EAAAyqG,aAAAtpG,GACAmxE,OAAAnxE,GAAAo2K,EAAAnmG,OACApxE,EAAAk2F,OAAAqhF,EAAAp2K,GACA41E,EAAA8+G,QAAAjoG,IAAA2pF,EAAAp2K,EAAAtB,EAAAovM,GAUA,OARA13B,IAAAkC,GAAAw1B,KACAS,EAGA1vM,EAAA2qG,WAAA9qG,EAAA+qG,IACAiwE,EAAAtD,EAAA,MAAAp2K,EAAAtB,GAHAg7K,EAAAtD,EAAA,MAAAp2K,EAAAtB,IAMAk3E,GAuBA,MAAA44H,EAAA,CACAhiH,IAAAA,EACAC,IAAAA,EACAgiH,eAvBA,SAAAr4B,EAAAp2K,GACA,MAAAuuM,EAAA1vM,EAAAk2F,OAAAqhF,EAAAp2K,GACAo2K,EAAAp2K,GACA,MAAA41E,EAAA8+G,QAAA+Z,eAAAr4B,EAAAp2K,GAIA,OAHA41E,GAAA24H,GACA70B,EAAAtD,EAAA,SAAAp2K,OAAAU,GAEAk1E,GAiBAmU,IAfA,SAAAqsF,EAAAp2K,GACA,MAAA41E,EAAA8+G,QAAA3qG,IAAAqsF,EAAAp2K,GAIA,OAHAnB,EAAAi4E,SAAA92E,IAAAwtM,EAAAzjH,IAAA/pF,IACA6mM,EAAAzwB,EAAA,EAAAp2K,GAEA41E,GAWA++G,QATA,SAAAve,GAEA,OADAywB,EAAAzwB,EAAA,EAAAv3K,EAAAipF,QAAAsuF,GAAA,SAAAu2B,GACAjY,QAAAC,QAAAve,KASAs4B,EAAA,CACAliH,IAAAmhH,EACAlhH,IAAA,CAAA2pF,EAAAp2K,KACA,EAEAyuM,eAAA,CAAAr4B,EAAAp2K,KACA,GAGA2uM,EAAA9vM,EAAA0B,OAAA,GAAAiuM,EAAA,CACAhiH,IAAAkhH,EACAjhH,IAAA6hH,IAKAM,EAAA/vM,EAAA0B,OAAA,GAAAmuM,EAAA,CACAliH,IAAAohH,IAGAiB,EAAAnwM,GAAAG,EAAA2lF,SAAA9lF,GAAA81L,GAAA91L,GAAAA,EACAowM,EAAApwM,GAAAG,EAAA2lF,SAAA9lF,GAAAgoJ,GAAAhoJ,GAAAA,EACAqwM,EAAArwM,GAAAA,EACAswM,EAAAl/B,GAAA4kB,QAAAua,eAAAn/B,GACA,SAAAo/B,EAAA94B,EAAAp2K,EAAA8oM,GAAA,EAAAqG,GAAA,GAIA,MAAAC,EAAA92B,GADAlC,EAAAA,EAAA,SAEAi5B,EAAA/2B,GAAAt4K,GACAA,IAAAqvM,IACAvG,GAAAjC,EAAAuI,EAAA,EAAApvM,IAEA8oM,GAAAjC,EAAAuI,EAAA,EAAAC,GACA,MAAAtlH,IAAAA,GAAAilH,EAAAI,GACAE,EAAAH,EAAAJ,EAAAjG,EAAAgG,EAAAD,EACA,OAAA9kH,EAAA6e,KAAAwmG,EAAApvM,GACAsvM,EAAAl5B,EAAA5pF,IAAAxsF,IAEA+pF,EAAA6e,KAAAwmG,EAAAC,GACAC,EAAAl5B,EAAA5pF,IAAA6iH,SAEAj5B,IAAAg5B,GAGAh5B,EAAA5pF,IAAAxsF,IAGA,SAAAuvM,EAAAvvM,EAAA8oM,GAAA,GACA,MAAA1yB,EAAAprE,KAAA,QACAokG,EAAA92B,GAAAlC,GACAi5B,EAAA/2B,GAAAt4K,GAKA,OAJAA,IAAAqvM,IACAvG,GAAAjC,EAAAuI,EAAA,EAAApvM,IAEA8oM,GAAAjC,EAAAuI,EAAA,EAAAC,GACArvM,IAAAqvM,EACAj5B,EAAArsF,IAAA/pF,GACAo2K,EAAArsF,IAAA/pF,IAAAo2K,EAAArsF,IAAAslH,GAEA,SAAApnG,EAAAmuE,EAAA0yB,GAAA,GAGA,OAFA1yB,EAAAA,EAAA,SACA0yB,GAAAjC,EAAAvuB,GAAAlC,GAAA,EAAAu2B,GACAjY,QAAAloG,IAAA4pF,EAAA,OAAAA,GAEA,SAAApsF,EAAAtrF,GACAA,EAAA45K,GAAA55K,GACA,MAAA03K,EAAAkC,GAAAttE,MAOA,OANAgkG,EAAA54B,GACArsF,IAAA6e,KAAAwtE,EAAA13K,KAEA03K,EAAApsF,IAAAtrF,GACAg7K,EAAAtD,EAAA,MAAA13K,EAAAA,IAEAssG,KAEA,SAAAwkG,EAAAxvM,EAAAtB,GACAA,EAAA45K,GAAA55K,GACA,MAAA03K,EAAAkC,GAAAttE,OACAjhB,IAAAA,EAAAyC,IAAAA,GAAAwiH,EAAA54B,GACA,IAAAm4B,EAAAxkH,EAAA6e,KAAAwtE,EAAAp2K,GACAuuM,IACAvuM,EAAAs4K,GAAAt4K,GACAuuM,EAAAxkH,EAAA6e,KAAAwtE,EAAAp2K,IAEA,MAAAypG,EAAAjd,EAAAoc,KAAAwtE,EAAAp2K,GAQA,OAPAo2K,EAAA3pF,IAAAzsF,EAAAtB,GACA6vM,EAGA1vM,EAAA2qG,WAAA9qG,EAAA+qG,IACAiwE,EAAAtD,EAAA,MAAAp2K,EAAAtB,GAHAg7K,EAAAtD,EAAA,MAAAp2K,EAAAtB,GAKAssG,KAEA,SAAAykG,EAAAzvM,GACA,MAAAo2K,EAAAkC,GAAAttE,OACAjhB,IAAAA,EAAAyC,IAAAA,GAAAwiH,EAAA54B,GACA,IAAAm4B,EAAAxkH,EAAA6e,KAAAwtE,EAAAp2K,GACAuuM,IACAvuM,EAAAs4K,GAAAt4K,GACAuuM,EAAAxkH,EAAA6e,KAAAwtE,EAAAp2K,IAEAwsF,GAAAA,EAAAoc,KAAAwtE,EAAAp2K,GAEA,MAAA41E,EAAAwgG,EAAA3nF,OAAAzuF,GAIA,OAHAuuM,GACA70B,EAAAtD,EAAA,SAAAp2K,OAAAU,GAEAk1E,EAEA,SAAAwiF,IACA,MAAAge,EAAAkC,GAAAttE,MACA0kG,EAAA,IAAAt5B,EAAAnuE,KAEAryB,EAAAwgG,EAAAhe,QAIA,OAHAs3C,GACAh2B,EAAAtD,EAAA,aAAA11K,OAAAA,GAEAk1E,EAEA,SAAA+5H,EAAA7G,EAAAqG,GACA,OAAA,SAAA9pC,EAAAuqC,GACA,MAAAC,EAAA7kG,KACAorE,EAAAy5B,EAAA,QACAT,EAAA92B,GAAAlC,GACAk5B,EAAAH,EAAAJ,EAAAjG,EAAAgG,EAAAD,EAEA,OADA/F,GAAAjC,EAAAuI,EAAA,EAAAzC,GACAv2B,EAAAh3K,SAAA,CAAAV,EAAAsB,IAIAqlK,EAAAz8D,KAAAgnG,EAAAN,EAAA5wM,GAAA4wM,EAAAtvM,GAAA6vM,MAIA,SAAAC,EAAA1nE,EAAA0gE,EAAAqG,GACA,OAAA,YAAA/tH,GACA,MAAAg1F,EAAAprE,KAAA,QACAokG,EAAA92B,GAAAlC,GACA25B,EAAAlxM,EAAAmpG,MAAAonG,GACAY,EAAA,YAAA5nE,GAAAA,IAAAlnI,OAAAu0J,UAAAs6C,EACAE,EAAA,SAAA7nE,GAAA2nE,EACAG,EAAA95B,EAAAhuC,MAAAhnD,GACAkuH,EAAAH,EAAAJ,EAAAjG,EAAAgG,EAAAD,EAKA,OAJA/F,GACAjC,EAAAuI,EAAA,EAAAa,EAAArD,EAAAD,GAGA,CAEA9qM,OACA,MAAAnD,MAAAA,EAAAo2K,KAAAA,GAAAo7B,EAAA9nH,OACA,OAAA0sF,EACA,CAAAp2K,MAAAA,EAAAo2K,KAAAA,GACA,CACAp2K,MAAAsxM,EAAA,CAAAV,EAAA5wM,EAAA,IAAA4wM,EAAA5wM,EAAA,KAAA4wM,EAAA5wM,GACAo2K,KAAAA,IAIAjzK,CAAAX,OAAAu0J,YACA,OAAAzqD,QAKA,SAAAmlG,EAAAr+H,GACA,OAAA,YAAAsP,GACA,MAAA,WAAAtP,GAAAk5B,MAGA,MAAAolG,EAAA,CACAvuM,IAAA7B,GACA,OAAAkvM,EAAAlkG,KAAAhrG,IAEAioG,WACA,OAAAA,EAAA+C,OAEAjhB,IAAAwlH,EACAvlH,IAAAA,EACAyC,IAAA+iH,EACA/gH,OAAAghH,EACAr3C,MAAAA,EACAh5J,QAAAuwM,GAAA,GAAA,IAEAU,EAAA,CACAxuM,IAAA7B,GACA,OAAAkvM,EAAAlkG,KAAAhrG,GAAA,GAAA,IAEAioG,WACA,OAAAA,EAAA+C,OAEAjhB,IAAAwlH,EACAvlH,IAAAA,EACAyC,IAAA+iH,EACA/gH,OAAAghH,EACAr3C,MAAAA,EACAh5J,QAAAuwM,GAAA,GAAA,IAEAW,EAAA,CACAzuM,IAAA7B,GACA,OAAAkvM,EAAAlkG,KAAAhrG,GAAA,IAEAioG,WACA,OAAAA,EAAA+C,MAAA,IAEAnpG,IAAA7B,GACA,OAAAuvM,EAAA3mG,KAAAoC,KAAAhrG,GAAA,IAEAgqF,IAAAmmH,EAAA,OACA1jH,IAAA0jH,EAAA,OACA1hH,OAAA0hH,EAAA,UACA/3C,MAAA+3C,EAAA,SACA/wM,QAAAuwM,GAAA,GAAA,IAEAY,EAAA,CACA1uM,IAAA7B,GACA,OAAAkvM,EAAAlkG,KAAAhrG,GAAA,GAAA,IAEAioG,WACA,OAAAA,EAAA+C,MAAA,IAEAnpG,IAAA7B,GACA,OAAAuvM,EAAA3mG,KAAAoC,KAAAhrG,GAAA,IAEAgqF,IAAAmmH,EAAA,OACA1jH,IAAA0jH,EAAA,OACA1hH,OAAA0hH,EAAA,UACA/3C,MAAA+3C,EAAA,SACA/wM,QAAAuwM,GAAA,GAAA,IASA,SAAAa,EAAA1H,EAAArG,GACA,MAAAgO,EAAAhO,EACAqG,EACAyH,EACAF,EACAvH,EACAwH,EACAF,EACA,MAAA,CAAAh6B,EAAAp2K,EAAA8tM,IACA,mBAAA9tM,GACA8oM,EAEA,mBAAA9oM,EACA8oM,EAEA,YAAA9oM,EACAo2K,EAEAse,QAAAloG,IAAA3tF,EAAAk2F,OAAA07G,EAAAzwM,IAAAA,KAAAo2K,EACAq6B,EACAr6B,EAAAp2K,EAAA8tM,GA3BA,CAAA,OAAA,SAAA,UAAA5sM,OAAAu0J,UACAr2J,SAAAgpI,IACAgoE,EAAAhoE,GAAA0nE,EAAA1nE,GAAA,GAAA,GACAkoE,EAAAloE,GAAA0nE,EAAA1nE,GAAA,GAAA,GACAioE,EAAAjoE,GAAA0nE,EAAA1nE,GAAA,GAAA,GACAmoE,EAAAnoE,GAAA0nE,EAAA1nE,GAAA,GAAA,MAyBA,MAAAsoE,EAAA,CACAlkH,IAAAgkH,GAAA,GAAA,IAEAG,GAAA,CACAnkH,IAAAgkH,GAAA,GAAA,IAEAI,GAAA,CACApkH,IAAAgkH,GAAA,GAAA,IAEAK,GAAA,CACArkH,IAAAgkH,GAAA,GAAA,IAGAtC,GAAA,IAAAnxG,QACAkxG,GAAA,IAAAlxG,QACAixG,GAAA,IAAAjxG,QACAgxG,GAAA,IAAAhxG,QAoBA,SAAAy3F,GAAApe,GAEA,OAAAA,GAAAA,EAAA,eACAA,EAEA06B,GAAA16B,GAAA,EAAAo4B,EAAAkC,EAAAxC,IAcA,SAAAxnD,GAAA0vB,GACA,OAAA06B,GAAA16B,GAAA,EAAAs4B,EAAAkC,GAAA5C,IAWA,SAAA8C,GAAA16B,EAAA0yB,EAAAiI,EAAAC,EAAAC,GACA,IAAApyM,EAAA2lF,SAAA4xF,GACA,OAAAA,EAIA,GAAAA,EAAA,WACA0yB,IAAA1yB,EAAA,gBACA,OAAAA,EAGA,MAAA86B,EAAAD,EAAAzkH,IAAA4pF,GACA,GAAA86B,EACA,OAAAA,EAGA,MAAAC,GApDAzyM,EAoDA03K,GAnDA,WAAA53K,OAAA4yM,aAAA1yM,GACA,EAhBA,SAAA2yM,GACA,OAAAA,GACA,IAAA,SACA,IAAA,QACA,OAAA,EACA,IAAA,MACA,IAAA,MACA,IAAA,UACA,IAAA,UACA,OAAA,EACA,QACA,OAAA,GAMAC,CAAAzyM,EAAAwqG,UAAA3qG,IAHA,IAAAA,EAqDA,GAAA,IAAAyyM,EACA,OAAA/6B,EAEA,MAAA6I,EAAA,IAAA4oB,MAAAzxB,EAAA,IAAA+6B,EAAAH,EAAAD,GAEA,OADAE,EAAAxkH,IAAA2pF,EAAA6I,GACAA,EAEA,SAAAgN,GAAAvtL,GACA,OAAAoqM,GAAApqM,GACAutL,GAAAvtL,EAAA,YAEAA,IAAAA,EAAA,gBAEA,SAAAoqM,GAAApqM,GACA,SAAAA,IAAAA,EAAA,gBAKA,SAAA45K,GAAAu3B,GACA,OAAAA,GAAAv3B,GAAAu3B,EAAA,UAAAA,EAOA,MAAA0B,GAAA5sG,GAAA9lG,EAAA2lF,SAAAmgB,GAAA6vF,GAAA7vF,GAAAA,EACA,SAAA08E,GAAAroE,GACA,OAAA3wB,QAAA2wB,IAAA,IAAAA,EAAAw4F,WAQA,MAAAC,GACA5vM,YAAA6vM,EAAA1lB,GAAA,GACAhhF,KAAA0mG,UAAAA,EACA1mG,KAAAghF,SAAAA,EACAhhF,KAAAwmG,WAAA,EACAxmG,KAAA0kE,OAAAsc,EAAA0lB,EAAAH,GAAAG,GAEAhzM,YAEA,OADAmoM,EAAAvuB,GAAAttE,MAAA,EAAA,SACAA,KAAA0kE,OAEAhxK,UAAAizM,GACA9yM,EAAA2qG,WAAA8uE,GAAAq5B,GAAA3mG,KAAA0mG,aACA1mG,KAAA0mG,UAAAC,EACA3mG,KAAA0kE,OAAA1kE,KAAAghF,SAAA2lB,EAAAJ,GAAAI,GACAj4B,EAAApB,GAAAttE,MAAA,MAAA,QAAA2mG,KAIA,SAAAC,GAAAC,EAAApP,GAAA,GACA,OAAAphB,GAAAwwB,GACAA,EAEA,IAAAJ,GAAAI,EAAApP,GAKA,SAAA2G,GAAAxZ,GACA,OAAAvO,GAAAuO,GAAAA,EAAAlxL,MAAAkxL,EAEA,MAAAkiB,GAAA,CACAtlH,IAAA,CAAA4pF,EAAAp2K,EAAA8tM,IAAA1E,GAAA1U,QAAAloG,IAAA4pF,EAAAp2K,EAAA8tM,IACArhH,IAAA,CAAA2pF,EAAAp2K,EAAAtB,EAAAovM,KACA,MAAArkG,EAAA2sE,EAAAp2K,GACA,OAAAqhL,GAAA53E,KAAA43E,GAAA3iL,IACA+qG,EAAA/qG,MAAAA,GACA,GAGAg2L,QAAAjoG,IAAA2pF,EAAAp2K,EAAAtB,EAAAovM,KASA,MAAAiE,GACAlwM,YAAAirK,GACA9hE,KAAAwmG,WAAA,EACA,MAAAhlH,IAAAA,EAAAC,IAAAA,GAAAqgF,GAAA,IAAA+5B,EAAA77F,KAAA,EAAA,WAAA,IAAA0uE,EAAA1uE,KAAA,MAAA,WACAA,KAAAgnG,KAAAxlH,EACAwe,KAAA6H,KAAApmB,EAEA/tF,YACA,OAAAssG,KAAAgnG,OAEAtzM,UAAAizM,GACA3mG,KAAA6H,KAAA8+F,IAaA,MAAAM,GACApwM,YAAAqwM,EAAAnqG,GACAiD,KAAAknG,QAAAA,EACAlnG,KAAAjD,KAAAA,EACAiD,KAAAwmG,WAAA,EAEA9yM,YACA,OAAAssG,KAAAknG,QAAAlnG,KAAAjD,MAEArpG,UAAAizM,GACA3mG,KAAAknG,QAAAlnG,KAAAjD,MAAA4pG,GAGA,SAAA1c,GAAA/zD,EAAAlhI,GACA,OAAAqhL,GAAAngD,EAAAlhI,IACAkhI,EAAAlhI,GACA,IAAAiyM,GAAA/wE,EAAAlhI,GAGA,MAAAmyM,GACAtwM,YAAA69K,EAAA0yB,EAAAtJ,GACA99F,KAAAonG,QAAAA,EACApnG,KAAAqnG,QAAA,EACArnG,KAAAwmG,WAAA,EACAxmG,KAAA4hF,OAAAA,EAAAlN,EAAA,CACA9F,MAAA,EACA4S,UAAA,KACAxhF,KAAAqnG,SACArnG,KAAAqnG,QAAA,EACA34B,EAAApB,GAAAttE,MAAA,MAAA,aAIAA,KAAA,eAAA89F,EAEApqM,YAEA,MAAA4rG,EAAAguE,GAAAttE,MAMA,OALAV,EAAA+nG,SACA/nG,EAAAolE,OAAA1kE,KAAA4hF,SACAtiF,EAAA+nG,QAAA,GAEAxL,EAAAv8F,EAAA,EAAA,SACAA,EAAAolE,OAEAhxK,UAAAu7K,GACAjvE,KAAAonG,QAAAn4B,IAiBA37K,EAAAquM,YAAAA,EACAruM,EAAAs4F,SAfA,SAAA8xG,GACA,IAAAhpB,EACA4yB,EASA,OARAzzM,EAAA43F,WAAAiyG,IACAhpB,EAAAgpB,EACA4J,EAAAzzM,EAAAiB,OAGA4/K,EAAAgpB,EAAAl8G,IACA8lH,EAAA5J,EAAAj8G,KAEA,IAAA0lH,GAAAzyB,EAAA4yB,EAAAzzM,EAAA43F,WAAAiyG,KAAAA,EAAAj8G,MAKAnuF,EAAAuqM,UA3EA,SAAA/7B,GACA,OAAA,IAAAilC,GAAAjlC,IA2EAxuK,EAAAsuL,OAAAA,EACAtuL,EAAAyuM,eAAAA,EACAzuM,EAAAomM,QAlKA,SAAAhmM,GACA,OAAAutL,GAAAvtL,IAAAoqM,GAAApqM,IAkKAJ,EAAA2tL,WAAAA,GACA3tL,EAAAwqM,WAAAA,GACAxqM,EAAA+iL,MAAAA,GACA/iL,EAAAyqM,QAhKA,SAAArqM,GAEA,OADAG,EAAA+qG,IAAAlrG,EAAA,YAAA,GACAA,GA+JAJ,EAAA2hL,cAAAA,EACA3hL,EAAA02L,UAvGA,SAAAud,GACA,OAAAtmB,GAAAsmB,GACAA,EACA,IAAA1K,MAAA0K,EAAAT,KAqGAxzM,EAAAk2L,SAAAA,GACAl2L,EAAAooJ,SAAAA,GACApoJ,EAAAsxL,IA5JA,SAAAlxL,GACA,OAAAkzM,GAAAlzM,IA4JAJ,EAAA6iL,cAAAA,EACA7iL,EAAAmpM,gBAjOA,SAAArxB,GACA,OAAA06B,GAAA16B,GAAA,EAAAu4B,EAAAgC,GAAA1C,KAiOA3vM,EAAA0qM,gBAlNA,SAAA5yB,GACA,OAAA06B,GAAA16B,GAAA,EAAAw4B,EAAAiC,GAAA9C,KAkNAzvM,EAAA2qM,WA7JA,SAAAvqM,GACA,OAAAkzM,GAAAlzM,GAAA,IA6JAJ,EAAAitI,KA7zBA,SAAAqhD,GACAA,EAAAhJ,SACAiI,EAAAe,GACAA,EAAAjtL,QAAA2sL,QACAM,EAAAjtL,QAAA2sL,SAEAM,EAAAhJ,QAAA,IAwzBAtlL,EAAAg6K,MAAAA,GACAh6K,EAAA22L,MAAAA,GACA32L,EAAA4qM,OA5FA,SAAAhoE,GACA,MAAA/pC,EAAAt4F,EAAAipF,QAAAo5C,GAAA,IAAAr4B,MAAAq4B,EAAAjxD,QAAA,GACA,IAAA,MAAAjwE,KAAAkhI,EACA/pC,EAAAn3F,GAAAi1L,GAAA/zD,EAAAlhI,GAEA,OAAAm3F,GAwFA74F,EAAAuoM,MAAAA,EACAvoM,EAAAo7K,QAAAA,EACAp7K,EAAA6qM,WAxIA,SAAAvZ,GACAlW,EAAApB,GAAAsX,GAAA,MAAA,aAAA,IAwIAtxL,EAAA8qM,MAAAA;A;A;A;A;A;ACv1BA,aAEA5qM,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAA8zM,EAAAj0M,EAAA,OACAk0M,EAAAl0M,EAAA,qBAEA,MAAAm0M,EAAA,mBAAAxxM,QAAA,iBAAAA,OAAAspM,YACAmI,EAAA90M,GAEA60M,EACAxxM,OAAA,iBAAArD,GACA,iBAAAA,EASA+0M,EAAAD,EAAA,gCAOAE,EAAAF,EAAA,qBAOAG,EAAAH,EAAA,UAOAI,EAAAJ,EAAA,kBAOAK,EAAAL,EAAA,wBAEAM,EAAA,oBAAA1oG,OAKA,MAAA9B,EAAAjqG,OAAAiqG,OACA,SAAAyqG,EAAAtjH,EAAArO,GACA,MAAA4xH,EAAA,GACA,IAAA,MAAAnzM,KAAAuhF,EAAA,CACA,MAAA7iF,EAAA6iF,EAAAvhF,GACAmzM,EAAAnzM,GAAA6oG,MAAA/gB,QAAAppF,GAAAA,EAAA02E,IAAAwa,GAAAA,EAAAlxF,GAEA,OAAAy0M,EAEA,IAAAC,EAAA,OAEA,SAAApzB,EAAAvlG,GAEA,MAAA2G,EAAAynB,MAAA4rD,KAAApzE,WAAAjR,MAAA,GACAs1B,QAAAs6E,KAAAouB,MAAA1oG,QAAA,CAAA,sBAAAjrB,GAAAoiB,OAAAzb,IAGA,MAAAiyH,EAAA,MAWA,SAAAC,EAAAC,EAAAC,EAAAC,EAAA,KACA,IAAA91M,EAAA+1M,EAAA,GAAAloH,EAAA,GAAA6yB,EAAA,GAEA,MAAAs1F,EAAAH,EAAAh9H,QAAA,KACAo9H,EAAAJ,EAAAh9H,QAAA,IAAAm9H,GAAA,EAAAA,EAAA,GAcA,OAbAA,GAAA,IACAh2M,EAAA61M,EAAApjI,MAAA,EAAAujI,GACAnoH,EAAAgoH,EAAApjI,MAAAujI,EAAA,EAAAC,GAAA,EAAAA,EAAAJ,EAAAvjI,QACAyjI,EAAAH,EAAA/nH,IAEAooH,GAAA,IACAj2M,EAAAA,GAAA61M,EAAApjI,MAAA,EAAAwjI,GAEAv1F,EAAAm1F,EAAApjI,MAAAwjI,EAAAJ,EAAAvjI,SAGAtyE,EAiGA,SAAA63L,EAAA/gC,GACA,GAAA+gC,EAAAruG,WAAA,KACA,OAAAquG,EACA,IAAA/gC,EAAAttE,WAAA,KAEA,OADA64F,EAAA,mFAAAwV,YAAA/gC,6BAAAA,OACA+gC,EAEA,IAAAA,EACA,OAAA/gC,EACA,MAAAo/C,EAAAp/C,EAAA3pE,MAAA,KACAgpH,EAAAte,EAAA1qG,MAAA,KACA,IACAipH,EACAx9F,EAFAy9F,EAAAH,EAAA5jI,OAAA,EAGA,IAAA8jI,EAAA,EAAAA,EAAAD,EAAA7jI,OAAA8jI,IAGA,GAFAx9F,EAAAu9F,EAAAC,GAEA,IAAAC,GAAA,MAAAz9F,EAAA,CAEA,GAAA,OAAAA,EAIA,MAHAy9F,IAKA,OAAAH,EAAAzjI,MAAA,EAAA4jI,GAAA1+H,KAAA,KACA,IACAw+H,EACA1jI,MAAA2jI,GAAAA,IAAAD,EAAA7jI,OAAA,EAAA,IACAqF,KAAA,KA9HA2+H,CAAA,MAAAt2M,EAAAA,EAAA61M,EAAAC,GAEA,CACAS,SAAAv2M,GAAA6tF,GAAA,KAAAA,EAAA6yB,EACA1gH,KAAAA,EACA+1M,MAAAA,EACAr1F,KAAAA,GAoBA,SAAA81F,EAAAC,EAAAhpE,GAEA,OAAAA,GAAAgpE,EAAAhgI,cAAAoC,QAAA40D,EAAAh3D,eACAggI,EACAA,EAAAhkI,MAAAg7D,EAAAn7D,SAAA,IAUA,SAAAokI,EAAAC,EAAAziI,EAAAyS,GACA,IAAAiwH,EAAA1iI,EAAA0Q,QAAAtS,OAAA,EACAukI,EAAAlwH,EAAA/B,QAAAtS,OAAA,EACA,OAAAskI,GAAA,GACAA,IAAAC,GACAC,EAAA5iI,EAAA0Q,QAAAgyH,GAAAjwH,EAAA/B,QAAAiyH,KACAE,EAAA7iI,EAAA0P,OAAA+C,EAAA/C,SACA+yH,EAAAziI,EAAA6hI,SAAAY,EAAAhwH,EAAAovH,QACA7hI,EAAAwsC,OAAA/5B,EAAA+5B,KASA,SAAAo2F,EAAA5iI,EAAAyS,GAIA,OAAAzS,EAAA8iI,SAAA9iI,MAAAyS,EAAAqwH,SAAArwH,GAEA,SAAAowH,EAAA7iI,EAAAyS,GACA,GAAA9lF,OAAAW,KAAA0yE,GAAA5B,SAAAzxE,OAAAW,KAAAmlF,GAAArU,OACA,OAAA,EACA,IAAA,IAAAjwE,KAAA6xE,EACA,IAAA+iI,EAAA/iI,EAAA7xE,GAAAskF,EAAAtkF,IACA,OAAA,EAEA,OAAA,EAEA,SAAA40M,EAAA/iI,EAAAyS,GACA,OAAAukB,MAAA/gB,QAAAjW,GACAgjI,EAAAhjI,EAAAyS,GACAukB,MAAA/gB,QAAAxD,GACAuwH,EAAAvwH,EAAAzS,GACAA,IAAAyS,EASA,SAAAuwH,EAAAhjI,EAAAyS,GACA,OAAAukB,MAAA/gB,QAAAxD,GACAzS,EAAA5B,SAAAqU,EAAArU,QAAA4B,EAAAkmC,OAAA,CAAAr5G,EAAAyzE,IAAAzzE,IAAA4lF,EAAAnS,KACA,IAAAN,EAAA5B,QAAA4B,EAAA,KAAAyS,EAwCA,IAAAwwH,EAKAC,GAJA,SAAAD,GACAA,EAAA,IAAA,MACAA,EAAA,KAAA,OAFA,CAGAA,IAAAA,EAAA,KAEA,SAAAC,GACAA,EAAA,KAAA,OACAA,EAAA,QAAA,UACAA,EAAA,QAAA,GAHA,CAIAA,IAAAA,EAAA,KAYA,SAAAC,EAAA5pE,GACA,IAAAA,EACA,GAAA6nE,EAAA,CAEA,MAAAgC,EAAA90M,SAAAC,cAAA,QAGAgrI,GAFAA,EAAA6pE,GAAAA,EAAAC,aAAA,SAAA,KAEAhxH,QAAA,kBAAA,SAGAknD,EAAA,IAUA,MAJA,MAAAA,EAAA,IAAA,MAAAA,EAAA,KACAA,EAAA,IAAAA,GAGAA,EArMAlnD,QAAAmvH,EAAA,IAwMA,MAAA8B,EAAA,UACA,SAAAC,EAAAhqE,EAAAooE,GACA,OAAApoE,EAAAlnD,QAAAixH,EAAA,KAAA3B,EAYA,MAAA6B,EAAA,KAAA,CACAnhH,KAAAqW,OAAA+qG,YACAn8B,IAAA5uE,OAAAgrG,cAEA,SAAAC,EAAAxB,GACA,IAAAyB,EACA,GAAA,OAAAzB,EAAA,CACA,IAAA0B,EAAA1B,EAAA9zM,GACA,MAAAy1M,EAAA,iBAAAD,GAAAA,EAAAvuH,WAAA,KAsBA,KAAA,iBAAA6sH,EAAA9zM,IACAy1M,GAAAx1M,SAAAy1M,eAAA5B,EAAA9zM,GAAAkwE,MAAA,KACA,IACA,IAAAylI,EAAA11M,SAAAC,cAAA4zM,EAAA9zM,IACA,GAAAy1M,GAAAE,EAGA,YAFA71B,EAAA,iBAAAg0B,EAAA9zM,wDAAA8zM,EAAA9zM,qCAKA,MAAAukG,GAGA,YAFAu7E,EAAA,iBAAAg0B,EAAA9zM,gRAMA,MAAAA,EAAA,iBAAAw1M,EACAC,EACAx1M,SAAAy1M,eAAAF,EAAAtlI,MAAA,IACAjwE,SAAAC,cAAAs1M,GACAA,EACA,IAAAx1M,EAEA,YADA8/K,EAAA,yCAAAg0B,EAAA9zM,mCAGAu1M,EAjEA,SAAAv1M,EAAA6vE,GACA,MAAA+lI,EAAA31M,SAAA41M,gBAAAn9B,wBACAo9B,EAAA91M,EAAA04K,wBACA,MAAA,CACAq9B,SAAAlmI,EAAAkmI,SACA/hH,KAAA8hH,EAAA9hH,KAAA4hH,EAAA5hH,MAAAnkB,EAAAmkB,MAAA,GACAilF,IAAA68B,EAAA78B,IAAA28B,EAAA38B,KAAAppG,EAAAopG,KAAA,IA2DA+8B,CAAAh2M,EAAA8zM,QAGAyB,EAAAzB,EAEA,mBAAA7zM,SAAA41M,gBAAAlmC,MACAtlE,OAAA4rG,SAAAV,GAEAlrG,OAAA4rG,SAAA,MAAAV,EAAAvhH,KAAAuhH,EAAAvhH,KAAAqW,OAAA+qG,YAAA,MAAAG,EAAAt8B,IAAAs8B,EAAAt8B,IAAA5uE,OAAAgrG,aAGA,SAAAa,EAAAz4M,EAAA44H,GAEA,OADAx4H,QAAA+1H,MAAA/1H,QAAA+1H,MAAAkgF,SAAAz9E,GAAA,GACA54H,EAEA,MAAA04M,EAAA,IAAAroH,IA0BA,IAAAsoH,EAAA,IAAA9C,SAAA+C,SAAA,KAAA/C,SAAAhjG,KAKA,SAAAgmG,EAAAprE,EAAAooE,GACA,MAAAY,SAAAA,EAAAn9F,OAAAA,EAAAoH,KAAAA,GAAAm1F,EAEAI,EAAAxoE,EAAA50D,QAAA,KACA,GAAAo9H,GAAA,EAAA,CACA,IAAA6C,EAAAp4F,EAAA5kC,SAAA2xD,EAAAh7D,MAAAwjI,IACAxoE,EAAAh7D,MAAAwjI,GAAA3jI,OACA,EACAymI,EAAAr4F,EAAAjuC,MAAAqmI,GAIA,MAFA,MAAAC,EAAA,KACAA,EAAA,IAAAA,GACAvC,EAAAuC,EAAA,IAGA,OADAvC,EAAAC,EAAAhpE,GACAn0B,EAAAoH,EAmFA,SAAAs4F,EAAAC,EAAAl8D,EAAAm8D,EAAAC,GAAA,EAAAC,GAAA,GACA,MAAA,CACAH,KAAAA,EACAl8D,QAAAA,EACAm8D,QAAAA,EACAC,SAAAA,EACA9C,SAAAzpG,OAAAxsG,QAAAkyE,OACA+mI,OAAAD,EAAA1B,IAAA,MA8FA,SAAA4B,EAAA7rE,GAEA,MAAA8rE,EA7FA,SAAA9rE,GACA,MAAArtI,QAAAA,EAAAy1M,SAAAA,GAAAjpG,OAEA,IAAAkpG,EAAA,CACA/0M,MAAA83M,EAAAprE,EAAAooE,IAEA2D,EAAA,CAAAz4M,MAAAX,EAAA+1H,OAeA,SAAAsjF,EAAA5hB,EAAA1hE,EAAA5vC,GAUA,MAAAmzH,EAAAjsE,EAAA50D,QAAA,KACAo6B,EAAAymG,GAAA,GACA7D,EAAAhjG,MAAArwG,SAAAC,cAAA,QACAgrI,EACAA,EAAAh7D,MAAAinI,IAAA7hB,EACA8gB,IAAAlrE,EAAAoqD,EACA,IAGAz3L,EAAAmmF,EAAA,eAAA,aAAA4vC,EAAA,GAAAljB,GACAumG,EAAAz4M,MAAAo1H,EAEA,MAAArvB,GAEAu7E,EAAA,gCAAAv7E,GAGA+uG,EAAAtvH,EAAA,UAAA,UAAA0sB,IA+BA,OAvEAumG,EAAAz4M,OACA04M,EAAA3D,EAAA/0M,MAAA,CACAk4M,KAAA,KACAl8D,QAAA+4D,EAAA/0M,MACAm4M,QAAA,KAEA7C,SAAAj2M,EAAAkyE,OAAA,EACA6mI,UAAA,EAGAE,OAAA,OACA,GA4DA,CACAxD,SAAAC,EACA3/E,MAAAqjF,EACArhI,KAxBA,SAAA0/G,EAAA99B,GAGA,MAAA4/C,EAAA7uG,EAAA,GAIA0uG,EAAAz4M,MAAAX,EAAA+1H,MAAA,CACA+iF,QAAArhB,EACAwhB,OAAA3B,MAEAt3M,EAAA+1H,OACAksD,EAAA,yVAIAo3B,EAAAE,EAAA58D,QAAA48D,GAAA,GAEAF,EAAA5hB,EADA/sF,EAAA,GAAAkuG,EAAAlD,EAAA/0M,MAAA82L,EAAA,MAAA,CAAAwe,SAAAsD,EAAAtD,SAAA,GAAAt8C,IACA,GACA+7C,EAAA/0M,MAAA82L,GAMAtxG,QAhCA,SAAAsxG,EAAA99B,GAIA0/C,EAAA5hB,EAHA/sF,EAAA,GAAA1qG,EAAA+1H,MAAA6iF,EAAAQ,EAAAz4M,MAAAk4M,KAEAphB,EAAA2hB,EAAAz4M,MAAAm4M,SAAA,GAAAn/C,EAAA,CAAAs8C,SAAAmD,EAAAz4M,MAAAs1M,YACA,GACAP,EAAA/0M,MAAA82L,IAqCA+hB,CADAnsE,EAAA4pE,EAAA5pE,IAEAosE,EAzLA,SAAApsE,EAAA+rE,EAAA1D,EAAAvvH,GACA,IAAAuzH,EAAA,GACAC,EAAA,GAGAC,EAAA,KACA,MAAAC,EAAA,EAAA9jF,MAAAA,MACA,MAAA0hE,EAAAghB,EAAAprE,EAAAooE,UACA/+C,EAAAg/C,EAAA/0M,MACAm5M,EAAAV,EAAAz4M,MACA,IAAA63H,EAAA,EACA,GAAAzC,EAAA,CAIA,GAHA2/E,EAAA/0M,MAAA82L,EACA2hB,EAAAz4M,MAAAo1H,EAEA6jF,GAAAA,IAAAljD,EAEA,YADAkjD,EAAA,MAGAphF,EAAAshF,EAAA/jF,EAAAkgF,SAAA6D,EAAA7D,SAAA,OAGA9vH,EAAAsxG,GAQAiiB,EAAAr4M,SAAA04M,IACAA,EAAArE,EAAA/0M,MAAA+1J,EAAA,CACAl+B,MAAAA,EACAzkD,KAAAgjI,EAAA7rH,IACA8uH,UAAAxhF,EACAA,EAAA,EACAw+E,EAAA8B,QACA9B,EAAA6B,KACA7B,EAAAiD,cAkBA,SAAAC,IACA,MAAAl6M,QAAAA,GAAAwsG,OACAxsG,EAAA+1H,OAEA/1H,EAAAm6M,aAAAzvG,EAAA,GAAA1qG,EAAA+1H,MAAA,CAAAkjF,OAAA3B,MAAA,IAYA,OAFA9qG,OAAA2mE,iBAAA,WAAA0mC,GACArtG,OAAA2mE,iBAAA,eAAA+mC,GACA,CACAE,eA/BA,WACAR,EAAAlE,EAAA/0M,OA+BA05M,OA7BA,SAAA/yC,GAEAoyC,EAAA3hI,KAAAuvF,GACA,MAAAgzC,EAAA,KACA,MAAA9nI,EAAAknI,EAAAjhI,QAAA6uF,GACA90F,GAAA,GACAknI,EAAAhiI,OAAAlF,EAAA,IAGA,OADAmnI,EAAA5hI,KAAAuiI,GACAA,GAqBAC,QAbA,WACA,IAAA,MAAAD,KAAAX,EACAW,IACAX,EAAA,GACAntG,OAAA8nE,oBAAA,WAAAulC,GACArtG,OAAA8nE,oBAAA,eAAA4lC,KAsHAM,CAAAntE,EAAA8rE,EAAApjF,MAAAojF,EAAA1D,SAAA0D,EAAAhzH,SAMA,MAAAs0H,EAAA/vG,EAAA,CAEA+qG,SAAA,GACApoE,KAAAA,EACAqtE,GATA,SAAAliF,EAAAmiF,GAAA,GACAA,GACAlB,EAAAW,iBACAp6M,QAAA06M,GAAAliF,IAOA6+E,WAAAA,EAAAzxG,KAAA,KAAAynC,IACA8rE,EAAAM,GASA,OARAh5M,OAAAC,eAAA+5M,EAAA,WAAA,CACAzuG,YAAA,EACAvd,IAAA,IAAA0qH,EAAA1D,SAAA90M,QAEAF,OAAAC,eAAA+5M,EAAA,QAAA,CACAzuG,YAAA,EACAvd,IAAA,IAAA0qH,EAAApjF,MAAAp1H,QAEA85M,EAkIA,SAAAG,EAAA96M,GACA,MAAA,iBAAAA,GAAA,iBAAAA,EAkBA,MAAA+6M,EAAA,CACAj7M,KAAA,IACAE,UAAA6C,EACA6gF,OAAA,GACAmyH,MAAA,GACAr1F,KAAA,GACA61F,SAAA,IACA3xH,QAAA,GACAkgF,KAAA,GACAo2C,oBAAAn4M,GAGAo4M,EAAAnG,EAAA,sBAMA,IAAAoG,EADAz6M,EAAAy6M,2BAAA,GACAA,EAgBAz6M,EAAAy6M,wBAAAz6M,EAAAy6M,sBAAA,KAXAA,EAAA,QAAA,GAAA,UAKAA,EAAAA,EAAA,UAAA,GAAA,YAKAA,EAAAA,EAAA,WAAA,IAAA,aAGA,MAAAC,EAAA,CACAj+H,EAAA,EAAAy4H,SAAAA,EAAAC,gBAAAA,KACA,kBAAA5gI,KAAAC,UAAA0gI,KAAAC,EACA,qBAAA5gI,KAAAC,UAAA2gI,GACA,KAEAz4H,EAAA,EAAAy5E,KAAAA,EAAA+gC,GAAAA,KACA,oBAAA/gC,EAAAy/C,iBA2BA,SAAA1e,GACA,GAAA,iBAAAA,EACA,OAAAA,EACA,GAAA,SAAAA,EACA,OAAAA,EAAA73L,KACA,MAAA61M,EAAA,GACA,IAAA,MAAAxzM,KAAAi5M,EACAj5M,KAAAw1L,IACAge,EAAAxzM,GAAAw1L,EAAAx1L,IAEA,OAAA6yE,KAAAC,UAAA0gI,EAAA,KAAA,GArCA0F,CAAA1jB,8BAEAt6G,EAAA,EAAAu5E,KAAAA,EAAA+gC,GAAAA,KACA,4BAAA/gC,EAAAy/C,iBAAA1e,EAAA0e,oCAEA54H,EAAA,EAAAm5E,KAAAA,EAAA+gC,GAAAA,KACA,8BAAA/gC,EAAAy/C,iBAAA1e,EAAA0e,mCAEAp4H,GAAA,EAAA24E,KAAAA,EAAA+gC,GAAAA,KACA,sDAAA/gC,EAAAy/C,cAGA,SAAAiF,EAAArnI,EAAAyP,GAGA,OAAAknB,EAAA,IAAA3E,MAAAk1G,EAAAlnI,GAAAyP,IAAA,CACAzP,KAAAA,EACAjwE,CAAAi3M,IAAA,GACAv3H,GAGA,SAAA63H,EAAA7+H,EAAAzI,GACA,OAAAyI,aAAAupB,OACAg1G,KAAAv+H,IACA,MAAAzI,MAAAyI,EAAAzI,KAAAA,IAEA,MAAAmnI,EAAA,CAAA,SAAA,QAAA,QAeA,MAAAI,EAAA,SACAC,EAAA,CACAC,WAAA,EACA57E,QAAA,EACA39C,OAAA,EACAhQ,KAAA,GAGAwpI,EAAA,sBAmKA,SAAAC,EAAA5nI,EAAAyS,GACA,IAAAnS,EAAA,EACA,KAAAA,EAAAN,EAAA5B,QAAAkC,EAAAmS,EAAArU,QAAA,CACA,MAAAypI,EAAAp1H,EAAAnS,GAAAN,EAAAM,GAEA,GAAAunI,EACA,OAAAA,EACAvnI,IAIA,OAAAN,EAAA5B,OAAAqU,EAAArU,OACA,IAAA4B,EAAA5B,QAAA,KAAA4B,EAAA,IACA,EACA,EAEAA,EAAA5B,OAAAqU,EAAArU,OACA,IAAAqU,EAAArU,QAAA,KAAAqU,EAAA,GACA,GACA,EAEA,EAQA,SAAAq1H,EAAA9nI,EAAAyS,GACA,IAAAnS,EAAA,EACA,MAAAynI,EAAA/nI,EAAAgoI,MACAC,EAAAx1H,EAAAu1H,MACA,KAAA1nI,EAAAynI,EAAA3pI,QAAAkC,EAAA2nI,EAAA7pI,QAAA,CACA,MAAAm0G,EAAAq1B,EAAAG,EAAAznI,GAAA2nI,EAAA3nI,IAEA,GAAAiyG,EACA,OAAAA,EACAjyG,IAGA,OAAA2nI,EAAA7pI,OAAA2pI,EAAA3pI,OASA,MAAA8pI,EAAA,CACAjoI,KAAA,EACApzE,MAAA,IAEAs7M,EAAA,eAmJA,SAAAC,EAAAC,EAAAzoI,EAAA9xE,GACA,MAAAy6E,EArWA,SAAA6yG,EAAAktB,GACA,MAAAx6M,EAAA8oG,EAAA,GAAA6wG,EAAAa,GAEA,IAAAN,EAAA,GAEA5vH,EAAAtqF,EAAAqgF,MAAA,IAAA,GAEA,MAAA7gF,EAAA,GACA,IAAA,MAAAo3G,KAAA02E,EAAA,CAEA,MAAAmtB,EAAA7jG,EAAAtmC,OAAA,GAAA,CAAA,IAEAtwE,EAAAg+H,SAAApnB,EAAAtmC,SACAga,GAAA,KACA,IAAA,IAAAowH,EAAA,EAAAA,EAAA9jG,EAAAtmC,OAAAoqI,IAAA,CACA,MAAA99F,EAAAhG,EAAA8jG,GAEA,IAAAC,EAAA,IACA36M,EAAA45M,UAAA,IAAA,GACA,GAAA,IAAAh9F,EAAAzqC,KAEAuoI,IACApwH,GAAA,KACAA,GAAAsyB,EAAA79G,MAAAwlF,QAAAs1H,EAAA,QACAc,GAAA,QAEA,GAAA,IAAA/9F,EAAAzqC,KAAA,CACA,MAAApzE,MAAAA,EAAA67M,WAAAA,EAAA3vE,SAAAA,EAAA/tB,OAAAA,GAAAN,EACAp9G,EAAA22E,KAAA,CACAj4E,KAAAa,EACA67M,WAAAA,EACA3vE,SAAAA,IAEA,MAAA4vE,EAAA39F,GAAAw8F,EAEA,GAAAmB,IAAAnB,EAAA,CACAiB,GAAA,GAEA,IACA,IAAAt4F,OAAA,IAAAw4F,MAEA,MAAA/1G,GACA,MAAA,IAAAX,MAAA,oCAAAplG,OAAA87M,OACA/1G,EAAA9f,UAIA,IAAA81H,EAAAF,EAAA,OAAAC,YAAAA,QAAA,IAAAA,KAEAH,IACAI,EAGA7vE,GAAAr0B,EAAAtmC,OAAA,EACA,OAAAwqI,KACA,IAAAA,GACA7vE,IACA6vE,GAAA,KACAxwH,GAAAwwH,EACAH,GAAA,GACA1vE,IACA0vE,IAAA,GACAC,IACAD,IAAA,IACA,OAAAE,IACAF,IAAA,IAEAF,EAAAtkI,KAAAwkI,GAIAT,EAAA/jI,KAAAskI,GAGA,GAAAz6M,EAAAg+H,QAAAh+H,EAAAqwE,IAAA,CACA,MAAAmC,EAAA0nI,EAAA5pI,OAAA,EACA4pI,EAAA1nI,GAAA0nI,EAAA1nI,GAAAlC,OAAA,IAAA,kBAGAtwE,EAAAg+H,SACA1zC,GAAA,MACAtqF,EAAAqwE,IACAia,GAAA,IAEAtqF,EAAAg+H,SACA1zC,GAAA,WACA,MAAAuwH,EAAA,IAAAx4F,OAAA/3B,EAAAtqF,EAAA45M,UAAA,GAAA,KAqDA,MAAA,CACAiB,GAAAA,EACAX,MAAAA,EACA16M,KAAAA,EACA86E,MAxDA,SAAAt8E,GACA,MAAA2qF,EAAA3qF,EAAA2qF,MAAAkyH,GACAj5H,EAAA,GACA,IAAA+G,EACA,OAAA,KACA,IAAA,IAAAnW,EAAA,EAAAA,EAAAmW,EAAArY,OAAAkC,IAAA,CACA,MAAAzzE,EAAA4pF,EAAAnW,IAAA,GACAnyE,EAAAb,EAAAgzE,EAAA,GACAoP,EAAAvhF,EAAAnC,MAAAa,GAAAsB,EAAAu6M,WAAA77M,EAAAosF,MAAA,KAAApsF,EAEA,OAAA6iF,GA+CAzO,UA7CA,SAAAyO,GACA,IAAA5jF,EAAA,GAEA+8M,GAAA,EACA,IAAA,MAAAnkG,KAAA02E,EAAA,CACAytB,GAAA/8M,EAAAozE,SAAA,OACApzE,GAAA,KACA+8M,GAAA,EACA,IAAA,MAAAn+F,KAAAhG,EACA,GAAA,IAAAgG,EAAAzqC,KACAn0E,GAAA4+G,EAAA79G,WAEA,GAAA,IAAA69G,EAAAzqC,KAAA,CACA,MAAApzE,MAAAA,EAAA67M,WAAAA,EAAA3vE,SAAAA,GAAAruB,EACAs6B,EAAAn4I,KAAA6iF,EAAAA,EAAA7iF,GAAA,GACA,GAAAmqG,MAAA/gB,QAAA+uD,KAAA0jE,EACA,MAAA,IAAAz2G,MAAA,mBAAAplG,8DACA,MAAAy5E,EAAA0wB,MAAA/gB,QAAA+uD,GAAAA,EAAAvhE,KAAA,KAAAuhE,EACA,IAAA1+D,EAAA,CACA,IAAAyyD,EAaA,MAAA,IAAA9mC,MAAA,2BAAAplG,MAVA63G,EAAAtmC,OAAA,IAEAtyE,EAAAozE,SAAA,KACApzE,EAAAA,EAAAyyE,MAAA,GAAA,GAGAsqI,GAAA,GAMA/8M,GAAAw6E,GAIA,OAAAx6E,IA4NAg9M,CAhJA,SAAAh9M,GACA,IAAAA,EACA,MAAA,CAAA,IACA,GAAA,MAAAA,EACA,MAAA,CAAA,CAAAo8M,IACA,IAAAp8M,EAAAwpF,WAAA,KACA,MAAA,IAAA2c,MAAA,yCAAAnmG,kBAAAA,OAIA,SAAAi9M,EAAAj2H,GACA,MAAA,IAAAmf,MAAA,QAAAgwB,OAAA+mF,OAAAl2H,KAEA,IAAAmvC,EAAA,EACAgnF,EAAAhnF,EACA,MAAA2/B,EAAA,GAGA,IAAAl9C,EACA,SAAAwkG,IACAxkG,GACAk9C,EAAA39E,KAAAygC,GACAA,EAAA,GAGA,IAEAsjD,EAFA1nF,EAAA,EAIA0oI,EAAA,GAEAG,EAAA,GACA,SAAAC,IACAJ,IAEA,IAAA/mF,EACAvd,EAAAzgC,KAAA,CACAhE,KAAA,EACApzE,MAAAm8M,IAGA,IAAA/mF,GACA,IAAAA,GACA,IAAAA,GACAvd,EAAAtmC,OAAA,IAAA,MAAA4pF,GAAA,MAAAA,IACA+gD,EAAA,uBAAAC,iDACAtkG,EAAAzgC,KAAA,CACAhE,KAAA,EACApzE,MAAAm8M,EACAh+F,OAAAm+F,EACAT,WAAA,MAAA1gD,GAAA,MAAAA,EACAjvB,SAAA,MAAAivB,GAAA,MAAAA,KAIA+gD,EAAA,mCAEAC,EAAA,IAEA,SAAAK,IACAL,GAAAhhD,EAEA,KAAA1nF,EAAAx0E,EAAAsyE,QAEA,GADA4pF,EAAAl8J,EAAAw0E,KACA,OAAA0nF,GAAA,IAAA/lC,EAKA,OAAAA,GACA,KAAA,EACA,MAAA+lC,GACAghD,GACAI,IAEAF,KAEA,MAAAlhD,GACAohD,IACAnnF,EAAA,GAGAonF,IAEA,MACA,KAAA,EACAA,IACApnF,EAAAgnF,EACA,MACA,KAAA,EACA,MAAAjhD,EACA/lC,EAAA,EAEAkmF,EAAAvpI,KAAAopF,GACAqhD,KAGAD,IACAnnF,EAAA,EAEA,MAAA+lC,GAAA,MAAAA,GAAA,MAAAA,GACA1nF,KAEA,MACA,KAAA,EAMA,MAAA0nF,EAEA,MAAAmhD,EAAAA,EAAA/qI,OAAA,GACA+qI,EAAAA,EAAA5qI,MAAA,GAAA,GAAAypF,EAEA/lC,EAAA,EAGAknF,GAAAnhD,EAEA,MACA,KAAA,EAEAohD,IACAnnF,EAAA,EAEA,MAAA+lC,GAAA,MAAAA,GAAA,MAAAA,GACA1nF,IACA6oI,EAAA,GACA,MACA,QACAJ,EAAA,sBAlEAE,EAAAhnF,EACAA,EAAA,EA0EA,OALA,IAAAA,GACA8mF,EAAA,uCAAAC,MACAI,IACAF,IAEAtnD,EAIA0nD,CAAAjB,EAAAv8M,MAAAgC,GAEA,CACA,MAAAy7M,EAAA,IAAAzxH,IACA,IAAA,MAAA3pF,KAAAo6E,EAAAj7E,KACAi8M,EAAArxH,IAAA/pF,EAAAnC,OACAmiL,EAAA,sCAAAhgL,EAAAnC,mBAAAq8M,EAAAv8M,kEACAy9M,EAAApxH,IAAAhqF,EAAAnC,MAGA,MAAAw9M,EAAA5yG,EAAAruB,EAAA,CACA8/H,OAAAA,EACAzoI,OAAAA,EAEA8C,SAAA,GACA+mI,MAAA,KASA,OAPA7pI,IAIA4pI,EAAAnB,OAAAvF,UAAAljI,EAAAyoI,OAAAvF,SACAljI,EAAA8C,SAAAuB,KAAAulI,GAEAA,EAUA,SAAAE,GAAA79M,EAAA89M,GAEA,MAAAC,EAAA,GACAC,EAAA,IAAA1tH,IAKA,SAAA2tH,EAAAzB,EAAAzoI,EAAAmqI,GAEA,IAAAC,GAAAD,EACAE,EAoNA,SAAA5B,GACA,MAAA,CACAv8M,KAAAu8M,EAAAv8M,KACAo+M,SAAA7B,EAAA6B,SACAl+M,KAAAq8M,EAAAr8M,KACA4kK,KAAAy3C,EAAAz3C,MAAA,GACAkyC,aAAAj0M,EACAy8K,YAAA+8B,EAAA/8B,YACAxrG,MAAAqqI,GAAA9B,GACA3lI,SAAA2lI,EAAA3lI,UAAA,GACA0nI,UAAA,GACAC,YAAA,IAAAvyH,IACAwyH,aAAA,IAAAxyH,IACAyyH,eAAA,GACA/7H,WAAA,eAAA65H,EACAA,EAAA75H,YAAA,GACA,CAAAliF,QAAA+7M,EAAAt8M,YApOAy+M,CAAAnC,GAEA4B,EAAAnH,QAAAiH,GAAAA,EAAA1B,OACA,MAAAv6M,EAAA41L,GAAAimB,EAAAtB,GAEAoC,EAAA,CACAR,GAEA,GAAA,UAAA5B,EAAA,CACA,MAAAqC,EAAA,iBAAArC,EAAAoB,MAAA,CAAApB,EAAAoB,OAAApB,EAAAoB,MACA,IAAA,MAAAA,KAAAiB,EACAD,EAAAxmI,KAAA2yB,EAAA,GAAAqzG,EAAA,CAGAz7H,WAAAu7H,EACAA,EAAA1B,OAAA75H,WACAy7H,EAAAz7H,WACA1iF,KAAA29M,EAEA3G,QAAAiH,EACAA,EAAA1B,OACA4B,KAMA,IAAAT,EACAmB,EACA,IAAA,MAAAC,KAAAH,EAAA,CACA,IAAA3+M,KAAAA,GAAA8+M,EAIA,GAAAhrI,GAAA,MAAA9zE,EAAA,GAAA,CACA,IAAA++M,EAAAjrI,EAAAyoI,OAAAv8M,KACAg/M,EAAA,MAAAD,EAAAA,EAAAzsI,OAAA,GAAA,GAAA,IACAwsI,EAAA9+M,KACA8zE,EAAAyoI,OAAAv8M,MAAAA,GAAAg/M,EAAAh/M,GAEA,GAAA,MAAA8+M,EAAA9+M,KACA,MAAA,IAAAmmG,MAAA,gLAyBA,GArBAu3G,EAAApB,EAAAwC,EAAAhrI,EAAA9xE,GACA8xE,GAAA,MAAA9zE,EAAA,IACAi/M,GAAAvB,EAAA5pI,GAGAmqI,GACAA,EAAAN,MAAAxlI,KAAAulI,GAEAwB,GAAAjB,EAAAP,KAKAmB,EAAAA,GAAAnB,EACAmB,IAAAnB,GACAmB,EAAAlB,MAAAxlI,KAAAulI,GAGAQ,GAAA3B,EAAAr8M,OAAAi/M,GAAAzB,IACA0B,EAAA7C,EAAAr8M,OAEA,aAAAi+M,EAAA,CACA,IAAAvnI,EAAAunI,EAAAvnI,SACA,IAAA,IAAApC,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IACAwpI,EAAApnI,EAAApC,GAAAkpI,EAAAO,GAAAA,EAAArnI,SAAApC,IAKAypI,EAAAA,GAAAP,EAKA2B,EAAA3B,GAEA,OAAAmB,EACA,KAEAO,EAAAP,IAEApJ,EAEA,SAAA2J,EAAAE,GACA,GAAAtE,EAAAsE,GAAA,CACA,MAAA5B,EAAAK,EAAAlvH,IAAAywH,GACA5B,IACAK,EAAAjtH,OAAAwuH,GACAxB,EAAAhmI,OAAAgmI,EAAAjlI,QAAA6kI,GAAA,GACAA,EAAA9mI,SAAAn1E,QAAA29M,GACA1B,EAAAC,MAAAl8M,QAAA29M,QAGA,CACA,IAAAxsI,EAAAkrI,EAAAjlI,QAAAymI,GACA1sI,GAAA,IACAkrI,EAAAhmI,OAAAlF,EAAA,GACA0sI,EAAA/C,OAAAr8M,MACA69M,EAAAjtH,OAAAwuH,EAAA/C,OAAAr8M,MACAo/M,EAAA1oI,SAAAn1E,QAAA29M,GACAE,EAAA3B,MAAAl8M,QAAA29M,KAOA,SAAAC,EAAA3B,GACA,IAAAlpI,EAAA,EAEA,KAAAA,EAAAspI,EAAAxrI,QACA0pI,EAAA0B,EAAAI,EAAAtpI,KAAA,GACAA,IAGAspI,EAAAhmI,OAAAtD,EAAA,EAAAkpI,GAEAA,EAAAnB,OAAAr8M,OAAAi/M,GAAAzB,IACAK,EAAAjvH,IAAA4uH,EAAAnB,OAAAr8M,KAAAw9M,GAyEA,OA3MAG,EAAAjmB,GAAA,CAAA53D,QAAA,EAAA3tD,KAAA,EAAAupI,WAAA,GAAAiC,GA0MA99M,EAAA0B,SAAA89M,GAAAvB,EAAAuB,KACA,CAAAvB,SAAAA,EAAA3qC,QAvEA,SAAAwiC,EAAAC,GACA,IAAA4H,EAEA19M,EACAE,EAFA0jF,EAAA,GAGA,GAAA,SAAAiyH,GAAAA,EAAA31M,KAAA,CAEA,GADAw9M,EAAAK,EAAAlvH,IAAAgnH,EAAA31M,OACAw9M,EACA,MAAAlC,EAAA,EAAA,CACA3F,SAAAA,IAEA31M,EAAAw9M,EAAAnB,OAAAr8M,KACA0jF,EAAAknB,EA6DA,SAAAlnB,EAAApiF,GACA,IAAAg0M,EAAA,GACA,IAAA,IAAAnzM,KAAAb,EACAa,KAAAuhF,IACA4xH,EAAAnzM,GAAAuhF,EAAAvhF,IAEA,OAAAmzM,EAjEAgK,CAAA1J,EAAAlyH,OAGA85H,EAAAl8M,KAAA45E,QAAA15E,IAAAA,EAAAurI,WAAAx1D,KAAA/1E,GAAAA,EAAAxB,QAAA21M,EAAAjyH,QAEA5jF,EAAA09M,EAAAvoI,UAAAyO,QAEA,GAAA,SAAAiyH,EAGA71M,EAAA61M,EAAA71M,KACAA,EAAAwpF,WAAA,MACA64F,EAAA,2DAAAriL,qDAAAA,iIAEA09M,EAAAI,EAAAtyH,MAAAe,GAAAA,EAAAswH,GAAA/pI,KAAA9yE,KAEA09M,IAGA95H,EAAA85H,EAAAphI,MAAAt8E,GACAE,EAAAw9M,EAAAnB,OAAAr8M,UAIA,CAKA,GAHAw9M,EAAA5H,EAAA51M,KACA69M,EAAAlvH,IAAAinH,EAAA51M,MACA49M,EAAAtyH,MAAAe,GAAAA,EAAAswH,GAAA/pI,KAAAgjI,EAAA91M,SACA09M,EACA,MAAAlC,EAAA,EAAA,CACA3F,SAAAA,EACAC,gBAAAA,IAEA51M,EAAAw9M,EAAAnB,OAAAr8M,KAGA0jF,EAAAknB,EAAA,GAAAgrG,EAAAlyH,OAAAiyH,EAAAjyH,QACA5jF,EAAA09M,EAAAvoI,UAAAyO,GAEA,MAAAgB,EAAA,GACA,IAAA66H,EAAA/B,EACA,KAAA+B,GAEA76H,EAAAuB,QAAAs5H,EAAAlD,QACAkD,EAAAA,EAAA3rI,OAEA,MAAA,CACA5zE,KAAAA,EACAF,KAAAA,EACA4jF,OAAAA,EACAgB,QAAAA,EACAkgF,KAAA46C,GAAA96H,KAKAw6H,YAAAA,EAAAO,UAvFA,WACA,OAAA7B,GAsFA8B,iBA1MA,SAAA1/M,GACA,OAAA69M,EAAAlvH,IAAA3uF,KAiPA,SAAAm+M,GAAA9B,GACA,MAAAsD,EAAA,GAEA7rI,EAAAuoI,EAAAvoI,QAAA,EACA,GAAA,cAAAuoI,EACAsD,EAAAr/M,QAAAwzE,OAKA,IAAA,IAAA9zE,KAAAq8M,EAAA75H,WACAm9H,EAAA3/M,GAAA,kBAAA8zE,EAAAA,EAAAA,EAAA9zE,GAEA,OAAA2/M,EAMA,SAAAV,GAAA5C,GACA,KAAAA,GAAA,CACA,GAAAA,EAAAA,OAAAvF,QACA,OAAA,EACAuF,EAAAA,EAAAzoI,OAEA,OAAA,EAOA,SAAA4rI,GAAA96H,GACA,OAAAA,EAAA7R,QAAA,CAAA+xF,EAAAy3C,IAAAzxG,EAAAg6D,EAAAy3C,EAAAz3C,OAAA,IAEA,SAAA8yB,GAAAkoB,EAAAC,GACA,IAAA/9M,EAAA,GACA,IAAA,IAAAK,KAAAy9M,EACA99M,EAAAK,GACAA,KAAA09M,EAAAA,EAAA19M,GAAAy9M,EAAAz9M,GAEA,OAAAL,EAEA,SAAAg+M,GAAA9rI,EAAAyS,GACA,OAAAzS,EAAAh0E,OAAAymF,EAAAzmF,MACAg0E,EAAA+4D,WAAAtmD,EAAAsmD,UACA/4D,EAAA0oI,aAAAj2H,EAAAi2H,WAQA,SAAAsC,GAAAhrI,EAAAyS,GACA,IAAA,IAAAtkF,KAAA6xE,EAAA1yE,KACA,IAAAa,EAAA4qI,WAAAtmD,EAAAnlF,KAAAgqF,KAAAw0H,GAAAh6G,KAAA,KAAA3jG,IACA,OAAAggL,EAAA,UAAA17F,EAAA41H,OAAAv8M,mCAAAk0E,EAAAqoI,OAAAv8M,iDAAAqC,EAAAnC,SAEA,IAAA,IAAAmC,KAAAskF,EAAAnlF,KACA,IAAAa,EAAA4qI,WAAA/4D,EAAA1yE,KAAAgqF,KAAAw0H,GAAAh6G,KAAA,KAAA3jG,IACA,OAAAggL,EAAA,UAAA17F,EAAA41H,OAAAv8M,mCAAAk0E,EAAAqoI,OAAAv8M,iDAAAqC,EAAAnC,SAGA,SAAA++M,GAAA1C,EAAAzoI,GACA,IAAA,IAAAzxE,KAAAyxE,EAAAtyE,KACA,IAAA+6M,EAAA/6M,KAAAgqF,KAAAw0H,GAAAh6G,KAAA,KAAA3jG,IACA,OAAAggL,EAAA,kBAAAk6B,EAAAA,OAAAv8M,iDAAAqC,EAAAnC,wBAAA4zE,EAAAyoI,OAAAv8M,UAqBA,MAAAigN,GAAA,KACAC,GAAA,KACAC,GAAA,MACAC,GAAA,KACAC,GAAA,MACAC,GAAA,MAeAC,GAAA,OACAC,GAAA,OACAC,GAAA,OACAC,GAAA,OACAC,GAAA,OACAC,GAAA,OACAC,GAAA,OACAC,GAAA,OASA,SAAAC,GAAAvmI,GACA,OAAAwmI,UAAA,GAAAxmI,GACA+L,QAAAq6H,GAAA,KACAr6H,QAAAg6H,GAAA,KACAh6H,QAAAi6H,GAAA,KAqBA,SAAAS,GAAAzmI,GACA,OAAAumI,GAAAvmI,GAEA+L,QAAA+5H,GAAA,OACA/5H,QAAAu6H,GAAA,KACAv6H,QAAA05H,GAAA,OACA15H,QAAA25H,GAAA,OACA35H,QAAAm6H,GAAA,KACAn6H,QAAAo6H,GAAA,KACAp6H,QAAAs6H,GAAA,KACAt6H,QAAAk6H,GAAA,KA2BA,SAAAS,GAAA1mI,GACA,OAZA,SAAAA,GACA,OAAAumI,GAAAvmI,GAAA+L,QAAA05H,GAAA,OAAA15H,QAAA85H,GAAA,OAWAc,CAAA3mI,GAAA+L,QAAA45H,GAAA,OASA,SAAA1uG,GAAAj3B,GACA,IACA,OAAA4mI,mBAAA,GAAA5mI,GAEA,MAAAssB,GACAu7E,EAAA,mBAAA7nG,4BAEA,MAAA,GAAAA,EAYA,SAAAo7H,GAAAt8F,GACA,MAAAy8F,EAAA,GAGA,GAAA,KAAAz8F,GAAA,MAAAA,EACA,OAAAy8F,EACA,MACAsL,GADA,MAAA/nG,EAAA,GACAA,EAAA7mC,MAAA,GAAA6mC,GAAAnsB,MAAA,KACA,IAAA,IAAA3Y,EAAA,EAAAA,EAAA6sI,EAAA/uI,SAAAkC,EAAA,CAEA,MAAA8sI,EAAAD,EAAA7sI,GAAA+R,QAAA+5H,GAAA,KAEA,IAAAiB,EAAAD,EAAAzoI,QAAA,KACAx2E,EAAAovG,GAAA8vG,EAAA,EAAAD,EAAAA,EAAA7uI,MAAA,EAAA8uI,IAEA,GAAA1gN,OAAAmqG,UAAAnD,eAAAxlG,GACA,SAEA,IAAAtB,EAAAwgN,EAAA,EAAA,KAAA9vG,GAAA6vG,EAAA7uI,MAAA8uI,EAAA,IACA,GAAAl/M,KAAA0zM,EAAA,CAEA,IAAAyL,EAAAzL,EAAA1zM,GACA6oG,MAAA/gB,QAAAq3H,KACAA,EAAAzL,EAAA1zM,GAAA,CAAAm/M,IAEAA,EAAArpI,KAAAp3E,QAGAg1M,EAAA1zM,GAAAtB,EAGA,OAAAg1M,EAWA,SAAAY,GAAAZ,GACA,IAAAz8F,EAAA,GACA,IAAA,IAAAj3G,KAAA0zM,EAAA,CACA,MAAAh1M,EAAAg1M,EAAA1zM,GAEA,GADAA,EA9FA4+M,GA8FA5+M,GA9FAkkF,QAAA65H,GAAA,OA+FA,MAAAr/M,EAAA,MAEAgC,IAAAhC,IACAu4G,IAAAA,EAAAhnC,OAAA,IAAA,IAAAjwE,GAEA,UAGA6oG,MAAA/gB,QAAAppF,GACAA,EAAA02E,KAAA06F,GAAAA,GAAA8uC,GAAA9uC,KACA,CAAApxK,GAAAkgN,GAAAlgN,KACAU,SAAAV,SAGAgC,IAAAhC,IAEAu4G,IAAAA,EAAAhnC,OAAA,IAAA,IAAAjwE,EACA,MAAAtB,IACAu4G,GAAA,IAAAv4G,OAIA,OAAAu4G,EAUA,SAAAmoG,GAAA1L,GACA,MAAA2L,EAAA,GACA,IAAA,IAAAr/M,KAAA0zM,EAAA,CACA,IAAAh1M,EAAAg1M,EAAA1zM,QACAU,IAAAhC,IACA2gN,EAAAr/M,GAAA6oG,MAAA/gB,QAAAppF,GACAA,EAAA02E,KAAA06F,GAAA,MAAAA,EAAA,KAAA,GAAAA,IACA,MAAApxK,EACAA,EACA,GAAAA,GAGA,OAAA2gN,EAMA,SAAAC,KACA,IAAAC,EAAA,GAYA,MAAA,CACAv1H,IAZA,SAAAu+E,GAEA,OADAg3C,EAAAzpI,KAAAyyF,GACA,KACA,MAAAp2F,EAAAotI,EAAA/oI,QAAA+xF,GACAp2F,GAAA,GACAotI,EAAA9pI,OAAAtD,EAAA,KAQAuc,KAAA,IAAA6wH,EACAtuC,MANA,WACAsuC,EAAA,KASA,SAAAC,GAAAtF,EAAAr8M,EAAAiiL,GACA,MAAA2/B,EAAA,KACAvF,EAAAr8M,GAAA4wF,OAAAqxF,IAEA0yB,EAAAzgB,YAAA0tB,GACAjN,EAAAhhB,cAAAiuB,GACAjN,EAAAlhB,aAAA,KACA4oB,EAAAr8M,GAAAmsF,IAAA81F,MAEAo6B,EAAAr8M,GAAAmsF,IAAA81F,GAwCA,SAAA4/B,GAAA5/B,EAAA0V,EAAA/gC,EAAAylD,EAAAr8M,GAEA,MAAA8hN,EAAAzF,IAEAA,EAAAkC,eAAAv+M,GAAAq8M,EAAAkC,eAAAv+M,IAAA,IACA,MAAA,IAAA,IAAAkzK,SAAA,CAAAC,EAAAu5B,KACA,MAAAniH,EAAAgwD,IA3nCA,IAAA8kE,GA4nCA,IAAA9kE,EACAmyD,EAAA4O,EAAA,EAAA,CACA1kD,KAAAA,EACA+gC,GAAAA,KAEAp9C,aAAAt0C,MACAymG,EAAAnyD,GAjoCA,iBADA8kE,EAooCA9kE,IAnoCA8kE,GAAA,iBAAAA,EAooCA3S,EAAA4O,EAAA,EAAA,CACA1kD,KAAA+gC,EACAA,GAAAp9C,MAIAunE,GAEAzF,EAAAkC,eAAAv+M,KAAA8hN,GACA,mBAAAvnE,GACAunE,EAAA7pI,KAAAsiE,GACA44B,MAIA4uC,EAAA9/B,EAAAl3E,KAAAsxG,GAAAA,EAAA+B,UAAAp+M,GAAA23L,EAAA/gC,EA6BA,SAAArsE,EAAAotG,EAAA/gC,GACA,IAAAy6B,EAAA,EACA,OAAA,WACA,GAAAA,KACAlP,EAAA,0FAAAvrB,EAAAy/C,iBAAA1e,EAAA0e,2GAEA9rH,EAAAy3H,SAAA,EACA,IAAA3wB,GACA9mG,EAAAgmH,MAAA,KAAA/sH,YArCAy+H,CAAA13H,EAAAotG,EAAA/gC,IACA,IAAAsrD,EAAAhvC,QAAAC,QAAA4uC,GAGA,GAFA9/B,EAAA7vG,OAAA,IACA8vI,EAAAA,EAAA92G,KAAA7gB,IACA03F,EAAA7vG,OAAA,EAAA,CACA,MAAA0U,EAAA,kDAAAm7F,EAAAjiL,KAAA,IAAAiiL,EAAAjiL,KAAA,IAAA,QAAAiiL,EAAA12E,qIACA,GAAA,iBAAAw2G,GAAA,SAAAA,EACAG,EAAAA,EAAA92G,MAAA+2G,GAEA53H,EAAAy3H,QAIAG,GAHAhgC,EAAAr7F,GACAosF,QAAAw5B,OAAA,IAAAzmG,MAAA,qCAMA,QAAApjG,IAAAk/M,IAEAx3H,EAAAy3H,QAGA,OAFA7/B,EAAAr7F,QACA4lH,EAAA,IAAAzmG,MAAA,6BAKAi8G,EAAA72G,OAAAzE,GAAA8lG,EAAA9lG,QAcA,SAAAw7G,GAAA19H,EAAA29H,EAAA1qB,EAAA/gC,GACA,MAAA0rD,EAAA,GACA,IAAA,MAAAjG,KAAA33H,EACA,IAAA,MAAA1kF,KAAAq8M,EAAA75H,WAAA,CACA,IAAA+/H,EAAAlG,EAAA75H,WAAAxiF,GAEA,IAAAuiN,GACA,iBAAAA,GACA,mBAAAA,EAKA,MAJApgC,EAAA,cAAAniL,2BAAAq8M,EAAAv8M,6CACA0zE,OAAA+uI,QAGA,IAAAt8G,MAAA,2BAEA,GAAA,SAAAs8G,EAAA,CAGApgC,EAAA,cAAAniL,2BAAAq8M,EAAAv8M,mMAKA,IAAA0iN,EAAAD,EACAA,EAAA,IAAAC,OAEAD,EAAA1wB,gBAEA0wB,EAAAE,sBACAF,EAAAE,qBAAA,EACAtgC,EAAA,cAAAniL,2BAAAq8M,EAAAv8M,2JAOA,GAAA,qBAAAuiN,GAAAhG,EAAA+B,UAAAp+M,GAEA,GAwCA,iBADAD,EAvCAwiN,IAyCA,gBAAAxiN,GACA,UAAAA,GACA,cAAAA,EA3CA,CAGA,MAAAkiL,GADAsgC,EAAA3b,WAAA2b,GACAF,GACApgC,GAAAqgC,EAAArqI,KAAA4pI,GAAA5/B,EAAA0V,EAAA/gC,EAAAylD,EAAAr8M,QAEA,CAEA,IAAA0iN,EAAAH,IACA,UAAAG,EAMAA,EAAAA,EAAAr3G,MAAAxD,QAAAnrB,QALAylG,EAAA,cAAAniL,2BAAAq8M,EAAAv8M,kMACA4iN,EAAAxvC,QAAAC,QAAAuvC,IAMAJ,EAAArqI,MAAA,IAAAyqI,EAAAt3G,MAAAqsF,IACA,IAAAA,EACA,OAAAvkB,QAAAw5B,OAAA,IAAAzmG,MAAA,+BAAAjmG,UAAAq8M,EAAAv8M,UACA,MAAA6iN,GAt6DA32G,EAs6DAyrF,GAr6DAt2L,YAAA0zM,GAAA,WAAA7oG,EAAA3oG,OAAAspM,aAs6DAlV,EAAAn3L,QACAm3L,EAx6DA,IAAAzrF,EA06DAqwG,EAAA75H,WAAAxiF,GAAA2iN,EAGA,MAAA1gC,GADA0gC,EAAA/b,WAAA+b,GACAN,GACA,OAAApgC,GAAA4/B,GAAA5/B,EAAA0V,EAAA/gC,EAAAylD,EAAAr8M,EAAA6hN,SAWA,IAAA9hN,EANA,OAAAuiN,EAeA,SAAAM,GAAA9uI,GACA,MAAA7zE,EAAA00M,EAAAtnB,OAAA4nB,GACA4N,EAAAlO,EAAAtnB,OAAA6nB,GACAmK,EAAA1K,EAAA57G,UAAA,IAAA94F,EAAAkzK,QAAAwhC,EAAApJ,MAAAz3H,EAAA6jH,OACAmrB,EAAAnO,EAAA57G,UAAA,KACA,IAAArU,QAAAA,GAAA26H,EAAAx+M,OACAuxE,OAAAA,GAAAsS,EACA,MAAAq+H,EAAAr+H,EAAAtS,EAAA,GACA,IAAA4wI,EAAAH,EAAAn+H,QACA,IAAAq+H,IAAAC,EAAA5wI,OACA,OAAA,EACA,IAAAM,EAAAswI,EAAAh5G,UAAA4sG,EAAA9wG,KAAA,KAAAi9G,IACA,GAAArwI,GAAA,EACA,OAAAA,EAEA,IAAAuwI,EAAAC,GAAAx+H,EAAAtS,EAAA,IACA,OAEAA,EAAA,GAIA8wI,GAAAH,KAAAE,GAEAD,EAAAA,EAAA5wI,OAAA,GAAAtyE,OAAAmjN,EACAD,EAAAh5G,UAAA4sG,EAAA9wG,KAAA,KAAAphB,EAAAtS,EAAA,KACAM,KAEAywI,EAAAxO,EAAA57G,UAAA,IAAA+pH,EAAAjiN,OAAA,GA4GA,SAAAuiN,EAAAh1D,GACA,IAAA,IAAAjsJ,KAAAisJ,EAAA,CACA,IAAAi1D,EAAAj1D,EAAAjsJ,GACAmhN,EAAAF,EAAAjhN,GACA,GAAA,iBAAAkhN,GACA,GAAAA,IAAAC,EACA,OAAA,OAGA,IAAAt4G,MAAA/gB,QAAAq5H,IACAA,EAAAlxI,SAAAixI,EAAAjxI,QACAixI,EAAAtvI,MAAA,CAAAlzE,EAAAyzE,IAAAzzE,IAAAyiN,EAAAhvI,KACA,OAAA,EAGA,OAAA,EA1HAivI,CAAAV,EAAAn/H,OAAA27H,EAAAx+M,MAAA6iF,UACA8/H,EAAA7O,EAAA57G,UAAA,IAAA+pH,EAAAjiN,OAAA,GACAiiN,EAAAjiN,QAAAgiN,EAAAn+H,QAAAtS,OAAA,GACAykI,EAAAgM,EAAAn/H,OAAA27H,EAAAx+M,MAAA6iF,UAMA,MAAA,CACA27H,MAAAA,EACAoE,KAAA9O,EAAA57G,UAAA,IAAAsmH,EAAAx+M,MAAA4iN,OACAN,SAAAA,EACAK,cAAAA,EACAE,SAVA,SAAAxiN,EAAA,IACA,OA+EA,SAAAA,GAEA,GAAAA,EAAA29K,SAAA39K,EAAA09K,QAAA19K,EAAAu9K,SAAAv9K,EAAAw9K,SACA,OAEA,GAAAx9K,EAAAyiN,iBACA,OAEA,QAAA9gN,IAAA3B,EAAA49K,QAAA,IAAA59K,EAAA49K,OACA,OAGA,GAAA59K,EAAAq9K,eAAAr9K,EAAAq9K,cAAA84B,aAAA,CAEA,MAAA9+B,EAAAr3K,EAAAq9K,cAAA84B,aAAA,UACA,GAAA,cAAAzkI,KAAA2lG,GACA,OAGAr3K,EAAAo9K,gBACAp9K,EAAAo9K,iBACA,OAAA,EApGAslC,CAAA1iN,GACAjB,EAAA00M,EAAApJ,MAAAz3H,EAAAuS,SAAA,UAAA,QAAAsuH,EAAApJ,MAAAz3H,EAAA6jH,KACAzkB,QAAAC,YAUA,MAkEA0wC,GAlEAlP,EAAAjjB,gBAAA,CACA1xL,KAAA,aACA8zE,MAAA,CACA6jH,GAAA,CACA1jH,KAAA,CAAAT,OAAA7yE,QACAmjN,UAAA,GAEAz9H,QAAAmE,QACAu5H,YAAAvwI,OAEAwwI,iBAAAxwI,OACAywI,OAAAz5H,QACA05H,iBAAA,CACAjwI,KAAAT,OACAlzE,QAAA,SAGA0D,MAAA8vE,GAAAirB,MAAAA,IACA,MAAAhY,EAAA4tH,EAAAhe,SAAAisB,GAAA9uI,KACAhyE,QAAAA,GAAA6yM,EAAAtnB,OAAA4nB,GACAkP,EAAAxP,EAAA57G,UAAA,KAAA,CACA/0F,CAAAogN,GAAAtwI,EAAAiwI,YAAAjiN,EAAAuiN,gBAAA,uBAAAt9H,EAAAo8H,SAMAn/M,CAAAogN,GAAAtwI,EAAAkwI,iBAAAliN,EAAAwiN,qBAAA,6BAAAv9H,EAAAy8H,kBAGA,GAAApO,EAAA,CACA,MAAAplC,EAAA2kC,EAAAl7B,qBACAk7B,EAAApG,aAAA,KACAv+B,IAEAA,EAAAu0C,YAAAx9H,EAAAs4H,SACA,CAAAxxB,MAAA,SACA8mB,EAAApG,aAAA,KACAv+B,IAEAA,EAAAw0C,aAAAz9H,EAAAo8H,SACAnzC,EAAAy0C,kBAAA19H,EAAAy8H,iBACA,CAAA31B,MAAA,SAEA,MAAA,KACA,MAAAn3G,EAAAqoB,EAAAz+F,SAAAy+F,EAAAz+F,QAAAymF,GACA,OAAAjT,EAAAmwI,OACAvtI,EACAi+H,EAAA//B,EAAA,IAAA,CACA8vC,eAAA39H,EAAAy8H,cACA1vI,EAAAowI,iBACA,KACAT,KAAA18H,EAAA08H,KAGA/mB,QAAA31G,EAAA28H,SACA9jB,MAAAukB,EAAAtjN,OACA61E,OAsDA,SAAAwsI,GAAA7G,GACA,OAAAA,EAAAA,EAAAvF,QAAAuF,EAAAvF,QAAAh3M,KAAAu8M,EAAAv8M,KAAA,GAQA,MAAAskN,GAAA,CAAAO,EAAAC,EAAAC,IAAA,MAAAF,EACAA,EACA,MAAAC,EACAA,EACAC,EA4FA,SAAAprB,GAAA6N,EAAAztC,GACA,IAAAytC,EACA,OAAA,KACA,MAAAwd,EAAAxd,EAAAztC,GACA,OAAA,IAAAirD,EAAA1yI,OAAA0yI,EAAA,GAAAA,EAOA,MAAAC,GArGApQ,EAAAjjB,gBAAA,CACA1xL,KAAA,aAEAioL,cAAA,EACAn0G,MAAA,CACA9zE,KAAA,CACAi0E,KAAAT,OACAlzE,QAAA,WAEA++M,MAAA1+M,QAEAqD,MAAA8vE,GAAAi6F,MAAAA,EAAAhvE,MAAAA,KA6FA,WACA,MAAAixE,EAAA2kC,EAAAl7B,qBACAurC,EAAAh1C,EAAAp8F,QAAAo8F,EAAAp8F,OAAAK,KAAAj0E,KACA,GAAAglN,IACA,cAAAA,GAAAA,EAAAppI,SAAA,eAAA,CACA,MAAA2qG,EAAA,cAAAy+B,EAAA,aAAA,aACA7iC,EAGA,0JAAAoE,8CAEAA,uBAvGA0+B,GACA,MAAAC,EAAAvQ,EAAAtnB,OAAA8nB,GACAgQ,EAAAxQ,EAAA57G,UAAA,IAAAjlB,EAAAurI,OAAA6F,EAAArkN,QACAukN,EAAAzQ,EAAAtnB,OAAA2nB,EAAA,GACAqQ,EAAA1Q,EAAA57G,UAAA,IAAAosH,EAAAtkN,MAAA6jF,QAAA0gI,KACAzQ,EAAA1nB,QAAA+nB,EAAAoQ,EAAA,GACAzQ,EAAA1nB,QAAA8nB,EAAAsQ,GACA1Q,EAAA1nB,QAAAkoB,EAAAgQ,GACA,MAAAG,EAAA3Q,EAAA5iB,MAiCA,OA9BA4iB,EAAAlnB,OAAA,IAAA,CAAA63B,EAAAzkN,MAAAwkN,EAAAxkN,MAAAizE,EAAA9zE,QAAA,EAAAgwK,EAAA2nB,EAAA33L,IAAAulN,EAAA3uD,EAAA4uD,MAEA7tB,IAGAA,EAAAymB,UAAAp+M,GAAAgwK,EAOApZ,GAAAA,IAAA+gC,GAAA3nB,GAAAA,IAAAu1C,IACA5tB,EAAA0mB,YAAAj0G,OACAutF,EAAA0mB,YAAAznD,EAAAynD,aAEA1mB,EAAA2mB,aAAAl0G,OACAutF,EAAA2mB,aAAA1nD,EAAA0nD,iBAKAtuC,IACA2nB,GAGA/gC,GAAAggD,EAAAjf,EAAA/gC,IAAA2uD,IACA5tB,EAAA4mB,eAAAv+M,IAAA,IAAAuB,SAAAimK,GAAAA,EAAAwI,OAEA,CAAA6d,MAAA,SACA,KACA,MAAAwxB,EAAA8F,EAAAtkN,MACA4kN,EAAAJ,EAAAxkN,MACA6kN,EAAAD,GAAAA,EAAAjjI,WAAA1O,EAAA9zE,MAGA2lN,EAAA7xI,EAAA9zE,KACA,IAAA0lN,EACA,OAAAjsB,GAAA16F,EAAAz+F,QAAA,CAAAsnL,UAAA89B,EAAArG,MAAAA,IAGA,MAAAuG,EAAAH,EAAA3xI,MAAAA,EAAA9zE,MACA6lN,EAAAD,GACA,IAAAA,EACAvG,EAAA37H,OACA,mBAAAkiI,EACAA,EAAAvG,GACAuG,EACA,KAOA7lN,EAAA40M,EAAA//B,EAAA8wC,EAAA96G,EAAA,GAAAi7G,EAAA93C,EAAA,CACAmlB,iBAPAjZ,IAEAA,EAAAl6K,UAAAyrL,cACAi6B,EAAArH,UAAAuH,GAAA,OAKA5zB,IAAAuzB,KAEA,OAGA7rB,GAAA16F,EAAAz+F,QAAA,CAAAsnL,UAAA7nL,EAAAs/M,MAAAA,KACAt/M,MAkCA,SAAA+lN,GAAAC,EAAAC,GACA,MAAA57M,EAAAwgG,EAAA,GAAAm7G,EAAA,CAEArhI,QAAAqhI,EAAArhI,QAAAnN,KAAAmN,GAgZA,SAAAsnB,EAAA1qG,GACA,MAAAg4F,EAAA,GACA,IAAA,IAAAn3F,KAAA6pG,EACA1qG,EAAAs6E,SAAAz5E,KAEAm3F,EAAAn3F,GAAA6pG,EAAA7pG,IAGA,OAAAm3F,EAxZA2sH,CAAAvhI,EAAA,CAAA,YAAA,WAAA,gBAEA,MAAA,CACAwhI,QAAA,CACAjyI,KAAA,KACAkyI,UAAA,EACAtsC,QAAAksC,EAAA1P,SACA2P,QAAAA,EACAnlN,MAAAuJ,IAIA,SAAAg8M,GAAAvsC,GACA,MAAA,CACAqsC,QAAA,CACArsC,QAAAA,IAKA,IAAAwsC,GAAA,EACA,SAAAC,GAAAnmN,EAAAF,EAAAu9M,GAGA,GAAAv9M,EAAAsmN,cACA,OACAtmN,EAAAsmN,eAAA,EAEA,MAAAn1H,EAAAi1H,KACAzR,EAAA4R,oBAAA,CACAp1H,GAAA,oBAAAA,EAAA,IAAAA,EAAA,IACA8sB,MAAA,aACAuoG,YAAA,aACAC,SAAA,iCACAC,KAAA,mDACAC,oBAAA,CAAA,WACAzmN,IAAAA,IACA0mN,IAEAA,EAAA1rI,GAAA2rI,kBAAA,CAAAC,EAAA3/B,KACA2/B,EAAAC,cACAD,EAAAC,aAAA/wF,MAAAh+C,KAAA,CACAhE,KAAA,UACA9xE,IAAA,SACA8kN,UAAA,EACApmN,MAAAilN,GAAA7lN,EAAA4iN,aAAAhiN,MAAA,sBAKAgmN,EAAA1rI,GAAA+rI,oBAAA,EAAAC,SAAA/yI,EAAAgzI,kBAAAA,MACA,eAAAhzI,EAAAp0E,OACAonN,EAAA7C,aACAnwI,EAAAizI,KAAApvI,KAAA,CACAimC,MAAAkpG,EAAA7C,YAAAzkN,KACAwnN,UAAA,EACAC,gBAAAC,KAGAJ,EAAA3C,mBACArwI,EAAAizI,KAAApvI,KAAA,CACAimC,MAAA,QACAopG,UAAA,EACAC,gBAAAE,KAGAL,EAAA5C,cACApwI,EAAAizI,KAAApvI,KAAA,CACAimC,MAAA,SACAopG,UAAA,EACAC,gBAAAG,SAKA/S,EAAAlnB,MAAAxtL,EAAA4iN,cAAA,KAEA8E,IACAd,EAAAe,wBACAf,EAAAgB,kBAAAC,MAEA,MAAAC,EAAA,sBAAA32H,EACAy1H,EAAAmB,iBAAA,CACA52H,GAAA22H,EACA7pG,MAAA,SAAA9sB,EAAA,IAAAA,EAAA,iBACA62H,MAAA,UAQAhoN,EAAA2C,SAAA85E,IACAmqI,EAAAqB,iBAAA,CACAC,QAAAJ,EACA1xI,MAAA,CACA+xI,MAAA,QACAC,SAAA,+CACAC,QAAA,QACAC,KAAAr9G,KAAAunE,MACA5Y,KAAA,CAAAn9E,MAAAA,SAKA,IAAA8rI,EAAA,EACAvoN,EAAAwoN,YAAA,CAAA9wB,EAAA/gC,KACA,MAAAiD,EAAA,CACAooB,MAAAmkC,GAAA,cACAxvD,KAAAkvD,GAAAlvD,EAAA,2CACA+gC,GAAAmuB,GAAAnuB,EAAA,oBAGAh3L,OAAAC,eAAA+2L,EAAA/yB,KAAA,iBAAA,CACA/jK,MAAA2nN,MAEA3B,EAAAqB,iBAAA,CACAC,QAAAJ,EACA1xI,MAAA,CACAkyI,KAAAr9G,KAAAunE,MACA21C,MAAA,sBACAvuD,KAAAA,EACA6uD,QAAA/wB,EAAA/yB,KAAA+jD,qBAIA1oN,EAAA2oN,WAAA,CAAAjxB,EAAA/gC,EAAAiyD,KACA,MAAAhvD,EAAA,CACAooB,MAAAmkC,GAAA,cAEAyC,GACAhvD,EAAAgvD,QAAA,CACA3C,QAAA,CACAjyI,KAAAgyB,MACAkgH,UAAA,EACAtsC,QAAAgvC,EAAAA,EAAA/hI,QAAA,GACAk/H,QAAA,qBACAnlN,MAAAgoN,IAGAhvD,EAAAivD,OAAA1C,GAAA,MAGAvsD,EAAAivD,OAAA1C,GAAA,KAGAvsD,EAAAjD,KAAAkvD,GAAAlvD,EAAA,2CACAiD,EAAA89B,GAAAmuB,GAAAnuB,EAAA,mBACAkvB,EAAAqB,iBAAA,CACAC,QAAAJ,EACA1xI,MAAA,CACA+xI,MAAA,oBACAG,KAAAr9G,KAAAunE,MACA5Y,KAAAA,EACAyuD,QAAAO,EAAA,UAAA,UACAH,QAAA/wB,EAAA/yB,KAAA+jD,qBAOA,MAAAb,EAAA,oBAAA12H,EAOA,SAAAu2H,IAEA,IAAAoB,EACA,OACA,MAAAhC,EAAAgC,EAEA,IAAAlpN,EAAA29M,EAAAiC,YAAAvkI,QAAAmkI,IAAAA,EAAAzrI,SAEA/zE,EAAA0B,QAAAynN,IAEAjC,EAAA7rI,SACAr7E,EAAAA,EAAAq7E,QAAAmkI,GAEA4J,GAAA5J,EAAA0H,EAAA7rI,OAAA3E,kBAGA12E,EAAA0B,SAAA89M,GAAA6J,GAAA7J,EAAAp/M,EAAA4iN,aAAAhiN,SACAkmN,EAAAoC,UAAAtpN,EAAA03E,IAAA6xI,IAEA,IAAAL,EAzBAlC,EAAAwC,aAAA,CACAj4H,GAAA02H,EACA5pG,MAAA,UAAA9sB,EAAA,IAAAA,EAAA,IACAk4H,KAAA,OACAC,sBAAA,kBAsBA1C,EAAA1rI,GAAAquI,kBAAAzC,IACAgC,EAAAhC,EACAA,EAAA5mN,MAAAA,GAAA4mN,EAAA0C,cAAA3B,GACAH,OAMAd,EAAA1rI,GAAAuuI,mBAAA3C,IACA,GAAAA,EAAA5mN,MAAAA,GAAA4mN,EAAA0C,cAAA3B,EAAA,CACA,MACAzI,EADA7B,EAAAiC,YACAn0H,MAAA+zH,GAAAA,EAAAhD,OAAAsN,UAAA5C,EAAA6C,SACAvK,IACA0H,EAAA9wF,MAAA,CACAn0H,QAAA+nN,GAAAxK,SAKAwH,EAAAgB,kBAAAC,GACAjB,EAAAiD,mBAAAhC,MAWA,SAAA+B,GAAAxK,GACA,MAAAhD,OAAAA,GAAAgD,EACA0K,EAAA,CACA,CAAA9C,UAAA,EAAA9kN,IAAA,OAAAtB,MAAAw7M,EAAAv8M,OAsDA,OApDA,MAAAu8M,EAAAr8M,MACA+pN,EAAA9xI,KAAA,CACAgvI,UAAA,EACA9kN,IAAA,OACAtB,MAAAw7M,EAAAr8M,OAGA+pN,EAAA9xI,KAAA,CAAAgvI,UAAA,EAAA9kN,IAAA,SAAAtB,MAAAw+M,EAAA1C,KACA0C,EAAA/9M,KAAA8wE,QACA23I,EAAA9xI,KAAA,CACAgvI,UAAA,EACA9kN,IAAA,OACAtB,MAAA,CACAqlN,QAAA,CACAjyI,KAAA,KACAkyI,UAAA,EACAtsC,QAAAwlC,EAAA/9M,KACAi2E,KAAAp1E,GAAA,GAAAA,EAAAnC,OA9BA,SAAAmC,GACA,OAAAA,EAAA4qI,SACA5qI,EAAAu6M,WAAA,IAAA,IAGAv6M,EAAAu6M,WAAA,IAAA,GAyBAsN,CAAA7nN,OACAs1E,KAAA,KACAuuI,QAAA,aACAnlN,MAAAw+M,EAAA/9M,SAKA,MAAA+6M,EAAA6B,UACA6L,EAAA9xI,KAAA,CACAgvI,UAAA,EACA9kN,IAAA,WACAtB,MAAAw7M,EAAA6B,WAGAmB,EAAA5B,MAAArrI,QACA23I,EAAA9xI,KAAA,CACAgvI,UAAA,EACA9kN,IAAA,UACAtB,MAAAw+M,EAAA5B,MAAAlmI,KAAAkmI,GAAAA,EAAApB,OAAAv8M,SAGAiqN,EAAA9xI,KAAA,CACA91E,IAAA,QACA8kN,UAAA,EACApmN,MAAA,CACAqlN,QAAA,CACAjyI,KAAA,KACAkyI,UAAA,EACAtsC,QAAAwlC,EAAArD,MAAAzkI,KAAAykI,GAAAA,EAAAvkI,KAAA,QAAAA,KAAA,OACAuuI,QAAA,4BACAnlN,MAAAw+M,EAAArD,UAIA+N,EAKA,MACArC,GAAA,QACAD,GAAA,QAEAD,GAAA,SAGA,SAAA4B,GAAA/J,GACA,MAAAgI,EAAA,IACAhL,OAAAA,GAAAgD,EACA,MAAAhD,EAAAr8M,MACAqnN,EAAApvI,KAAA,CACAimC,MAAA1qC,OAAA6oI,EAAAr8M,MACAsnN,UAAA,EACAC,gBAXA,UAcAlL,EAAAvF,SACAuQ,EAAApvI,KAAA,CACAimC,MAAA,QACAopG,UAAA,EACAC,gBAAAC,KAGAnI,EAAA4K,YACA5C,EAAApvI,KAAA,CACAimC,MAAA,UACAopG,UAAA,EACAC,gBA5BA,WA+BAlI,EAAA6K,kBACA7C,EAAApvI,KAAA,CACAimC,MAAA,QACAopG,UAAA,EACAC,gBAAAE,KAGApI,EAAA8K,aACA9C,EAAApvI,KAAA,CACAimC,MAAA,SACAopG,UAAA,EACAC,gBAAAG,KAGArL,EAAA6B,UACAmJ,EAAApvI,KAAA,CACAimC,MAAA,cACA,iBAAAm+F,EAAA6B,SAAA7B,EAAA6B,SAAA,UACAoJ,UAAA,SACAC,gBA5CA,UAiDA,IAAAn2H,EAAAirH,EAAAsN,QAKA,OAJA,MAAAv4H,IACAA,EAAA5d,OAAA42I,MACA/N,EAAAsN,QAAAv4H,GAEA,CACAA,GAAAA,EACA8sB,MAAAm+F,EAAAv8M,KACAunN,KAAAA,EACA3wI,SAAA2oI,EAAA3oI,SAAAa,IAAA6xI,KAIA,IAAAgB,GAAA,EACA,MAAAC,GAAA,qBACA,SAAAnB,GAAA7J,EAAAwD,GAGA,MAAAW,EAAAX,EAAAn+H,QAAAtS,QACAwkI,EAAAiM,EAAAn+H,QAAAm+H,EAAAn+H,QAAAtS,OAAA,GAAAitI,EAAAhD,QACAgD,EAAA6K,iBAAA7K,EAAA8K,YAAA3G,EACAA,IACAnE,EAAA8K,YAAAtH,EAAAn+H,QAAA3Q,MAAA0W,GAAAmsH,EAAAnsH,EAAA40H,EAAAhD,WAEAgD,EAAA3oI,SAAAn1E,SAAA+oN,GAAApB,GAAAoB,EAAAzH,KAEA,SAAAmG,GAAA3J,GACAA,EAAA4K,YAAA,EACA5K,EAAA3oI,SAAAn1E,QAAAynN,IAEA,SAAAC,GAAA5J,EAAAnkI,GACA,MAAAyhG,EAAAnpG,OAAA6rI,EAAA1C,IAAAlyH,MAAA4/H,IAEA,GADAhL,EAAA4K,YAAA,GACAttC,GAAAA,EAAAvqG,OAAA,EACA,OAAA,EAIA,GADA,IAAA+xC,OAAAw4D,EAAA,GAAAt2F,QAAA,MAAA,IAAAs2F,EAAA,IACA/pG,KAAAsI,GAIA,OAFAmkI,EAAA3oI,SAAAn1E,SAAAs2E,GAAAoxI,GAAApxI,EAAAqD,MAEA,MAAAmkI,EAAAhD,OAAAv8M,MAAA,MAAAo7E,KACAmkI,EAAA4K,WAAA5K,EAAA1C,GAAA/pI,KAAAsI,IACA,GAKA,MAAAp7E,EAAAu/M,EAAAhD,OAAAv8M,KAAAy2E,cACAg0I,EAAAh5G,GAAAzxG,GAEA,QAAAo7E,EAAAoO,WAAA,OACAihI,EAAA3uI,SAAAV,KAAAp7E,EAAA87E,SAAAV,SAEAqvI,EAAAjhI,WAAApO,KAAAp7E,EAAAwpF,WAAApO,SAEAmkI,EAAAhD,OAAAr8M,OAAAwzE,OAAA6rI,EAAAhD,OAAAr8M,MAAA47E,SAAAV,KAEAmkI,EAAA3oI,SAAA3C,MAAA8D,GAAAoxI,GAAApxI,EAAAqD,OA0jBA,SAAAsvI,GAAAlI,GACA,OAAAA,EAAAzvI,QAAA,CAAA2vI,EAAAvgC,IAAAugC,EAAAp3G,MAAA,IAAA62E,OAAA/O,QAAAC,WAyCA1yK,EAAAojN,WAAAA,GACApjN,EAAAskN,WAAAA,GACAtkN,EAAAgqN,eAAA1P,EACAt6M,EAAAiqN,oBApqFA,SAAAn9E,EAAA,IACA,IAAAqsE,EAAA,GACAx1B,EAAA,CA9XA,IA+XA+xB,EAAA,EACA,SAAAwU,EAAAhV,GACAQ,IACAA,IAAA/xB,EAAAhyG,QAMAgyG,EAAAxsG,OAAAu+H,GAJA/xB,EAAAnsG,KAAA09H,GAkBA,MAAAgF,EAAA,CAEAhF,SAxZA,GA0ZA1/E,MAAA,GACAsX,KAAAA,EACAgqE,WAAAA,EAAAzxG,KAAA,KAAAynC,GACAvpI,QAAA2zL,GAEAvT,EAAAxsG,OAAAu+H,IAAA,GACAwU,EAAAhzB,IAEA3zL,KAAA2zL,EAAA99B,GACA8wD,EAAAhzB,IAEA4iB,OAAA/yC,IACAoyC,EAAA3hI,KAAAuvF,GACA,KACA,MAAA90F,EAAAknI,EAAAjhI,QAAA6uF,GACA90F,GAAA,GACAknI,EAAAhiI,OAAAlF,EAAA,KAGA1uE,UACA41M,EAAA,GACAx1B,EAAA,CA/aA,IAgbA+xB,EAAA,GAEAnyM,GAAA00H,EAAAkyF,GAAA,GACA,MAAAh0D,EAAAzpD,KAAAwoG,SACAuE,EAIAxhF,EAAA,EAAAw+E,EAAA6B,KAAA7B,EAAA8B,QACA7C,EAAApjI,KAAAD,IAAA,EAAAC,KAAAq0B,IAAA+uG,EAAAz9E,EAAA0rD,EAAAhyG,OAAA,IACAw4I,GA9CA,SAAAjzB,EAAA/gC,GAAAsjD,UAAAA,EAAAxhF,MAAAA,IACA,MAAAmyF,EAAA,CACA3Q,UAAAA,EACAxhF,MAAAA,EACAzkD,KAAAgjI,EAAA7rH,KAEA,IAAA,IAAAo8E,KAAAoyC,EACApyC,EAAAmwB,EAAA/gC,EAAAi0D,GAwCAhQ,CAAA1tG,KAAAwoG,SAAA/+C,EAAA,CACAsjD,UAAAA,EACAxhF,MAAAA,MASA,OAJA/3H,OAAAC,eAAA+5M,EAAA,WAAA,CACAzuG,YAAA,EACAvd,IAAA,IAAAy1F,EAAA+xB,KAEAwE,GA2lFAl6M,EAAAqqN,aAtlBA,SAAAhpN,GACA,MAAA07M,EAAAE,GAAA57M,EAAAjC,OAAAiC,GACA,IAAAipN,EAAAjpN,EAAA4zM,YAAAA,GACAsV,EAAAlpN,EAAA20M,gBAAAA,GACAkE,EAAA74M,EAAA5B,QACA,IAAAy6M,EACA,MAAA,IAAA10G,MAAA,2GAEA,MAAAglH,EAAAxJ,KACAyJ,EAAAzJ,KACA0J,EAAA1J,KACAoB,EAAAlO,EAAAvJ,WAAA2P,GACA,IAAAqQ,EAAArQ,EAEA3F,GAAAtzM,EAAAupN,gBAAA,sBAAAnrN,UACAA,QAAAorN,kBAAA,UAEA,MAAAC,EAAAlW,EAAAvvG,KAAA,MAAA0lH,GAAA,GAAAA,IACAC,EAAApW,EAAAvvG,KAAA,KAAAk7G,IACA0K,EAAArW,EAAAvvG,KAAA,KAAAyL,IA4BA,SAAA4hE,EAAAw4C,EAAA/V,GAIA,GADAA,EAAAhrG,EAAA,GAAAgrG,GAAAiN,EAAAhiN,OACA,iBAAA8qN,EAAA,CACA,IAAAC,EAAAnW,EAAAsV,EAAAY,EAAA/V,EAAA91M,MACA2lN,EAAAjI,EAAArqC,QAAA,CAAArzK,KAAA8rN,EAAA9rN,MAAA81M,GACA6N,EAAA9I,EAAApD,WAAAqU,EAAAvV,UASA,OAPAoN,EAAAn6H,WAAA,MACA64F,EAAA,aAAAwpC,mBAAAlI,+DACAgC,EAAA/gI,QAAAtS,QACA+vG,EAAA,0CAAAwpC,MAIA/gH,EAAAghH,EAAAnG,EAAA,CACA/hI,OAAAgoI,EAAAjG,EAAA/hI,QACA88B,KAAAjP,GAAAq6G,EAAAprG,MACAw6F,oBAAAn4M,EACA4gN,KAAAA,IAGA,IAAAoI,EAEA,SAAAF,GACA,WAAAA,KACA,SAAAA,IACAhrN,OAAAW,KAAAqqN,EAAAjoI,QAAAtR,QACA+vG,EAAA,SAAAwpC,EAAA7rN,sGAEA+rN,EAAAjhH,EAAA,GAAA+gH,EAAA,CACA7rN,KAAA21M,EAAAsV,EAAAY,EAAA7rN,KAAA81M,EAAA91M,MAAAA,SAKA+rN,EAAAjhH,EAAA,GAAA+gH,EAAA,CACAjoI,OAAA+nI,EAAAE,EAAAjoI,UAIAkyH,EAAAlyH,OAAA+nI,EAAA7V,EAAAlyH,SAEA,IAAA+hI,EAAAjI,EAAArqC,QAAA04C,EAAAjW,GACA,MAAAp1F,EAAAmrG,EAAAnrG,MAAA,GACAA,IAAAA,EAAAl3B,WAAA,MACA64F,EAAA,mEAAA3hE,aAAAA,OAIAilG,EAAA/hI,OAAA6nI,EAAAG,EAAAjG,EAAA/hI,SACA,MAAA2yH,EA9qFA,SAAAI,EAAAd,GACA,IAAAE,EAAAF,EAAAE,MAAAY,EAAAd,EAAAE,OAAA,GACA,OAAAF,EAAA71M,MAAA+1M,GAAA,KAAAA,GAAAF,EAAAn1F,MAAA,IA4qFAsrG,CAAAd,EAAApgH,EAAA,GAAA+gH,EAAA,CACAnrG,MA9rCAlmC,EA8rCAkmC,EA7rCAqgG,GAAAvmI,GACA+L,QAAAo6H,GAAA,KACAp6H,QAAAs6H,GAAA,KACAt6H,QAAAk6H,GAAA,MA2rCAzgN,KAAA2lN,EAAA3lN,QA/rCA,IAAAw6E,EAisCA,IAAAmpI,EAAA9I,EAAApD,WAAAlB,GASA,OAPAoN,EAAAn6H,WAAA,MACA64F,EAAA,aAAAwpC,mBAAAlI,+DAEAgC,EAAA/gI,QAAAtS,QACA+vG,EAAA,0CAAA,SAAAwpC,EAAAA,EAAA7rN,KAAA6rN,MAGA/gH,EAAA,CACAyrG,SAAAA,EAGA71F,KAAAA,EACAq1F,MAMAmV,IAAAvU,GACA8K,GAAAoK,EAAA9V,OACA8V,EAAA9V,OACA4P,EAAA,CACAzK,oBAAAn4M,EACA4gN,KAAAA,IAGA,SAAAsI,EAAAp0B,GACA,MAAA,iBAAAA,EACA8d,EAAAsV,EAAApzB,EAAAkrB,EAAAhiN,MAAAf,MACA8qG,EAAA,GAAA+sF,GAEA,SAAAq0B,EAAAr0B,EAAA/gC,GACA,GAAAw0D,IAAAzzB,EACA,OAAA2jB,EAAA,EAAA,CACA1kD,KAAAA,EACA+gC,GAAAA,IAIA,SAAA1/G,EAAA0/G,GACA,OAAAs0B,EAAAt0B,GAKA,SAAAu0B,EAAAv0B,GACA,MAAAw0B,EAAAx0B,EAAAjzG,QAAAizG,EAAAjzG,QAAAtS,OAAA,GACA,GAAA+5I,GAAAA,EAAAjO,SAAA,CACA,MAAAA,SAAAA,GAAAiO,EACA,IAAAC,EAAA,mBAAAlO,EAAAA,EAAAvmB,GAAAumB,EAQA,GAPA,iBAAAkO,IACAA,EACAA,EAAAzzI,QAAA,MAAA,GACAyzI,EAAAzzI,QAAA,MAAA,EACAyzI,EAAAL,EAAAK,GACA,CAAAtsN,KAAAssN,MAEA,SAAAA,MACA,SAAAA,GAEA,MADAjqC,EAAA,4BAAAntG,KAAAC,UAAAm3I,EAAA,KAAA,4BAAAz0B,EAAA0e,qFACA,IAAApwG,MAAA,oBAEA,OAAA2E,EAAA,CACAirG,MAAAle,EAAAke,MACAr1F,KAAAm3E,EAAAn3E,KACA98B,OAAAi0G,EAAAj0G,QACA0oI,IAGA,SAAAH,EAAAt0B,EAAAqjB,GACA,MAAAqR,EAAAjB,EAAAj4C,EAAAwkB,GACA/gC,EAAAisD,EAAAhiN,MACAg5J,EAAA89B,EAAA1hE,MACAq2F,EAAA30B,EAAA20B,MAEAjmI,GAAA,IAAAsxG,EAAAtxG,QACAkmI,EAAAL,EAAAG,GACA,GAAAE,EACA,OAAAN,EAAArhH,EAAAmhH,EAAAQ,GAAA,CACAt2F,MAAA4jC,EACAyyD,MAAAA,EACAjmI,QAAAA,IAGA20H,GAAAqR,GAEA,MAAAG,EAAAH,EAEA,IAAAxD,EAYA,OAbA2D,EAAAxR,eAAAA,GAEAsR,GAAA9V,EAAAwU,EAAAp0D,EAAAy1D,KACAxD,EAAAvN,EAAA,GAAA,CAAA3jB,GAAA60B,EAAA51D,KAAAA,IAEA61D,EAAA71D,EAAAA,GAGA,GAGA,KAEAiyD,EAAA31C,QAAAC,QAAA01C,GAAAnF,EAAA8I,EAAA51D,IACAvrD,OAAA3uB,GAAA6+H,EAAA7+H,GACAA,EAEAgwI,EAAAhwI,KACA0uB,MAAAy9G,IACA,GAAAA,GACA,GAAAtN,EAAAsN,EAAA,GACA,OACArS,EAAAwU,EAAA73C,EAAA01C,EAAAlxB,IAAA60B,IAEAxR,IAEAA,EAAA2R,OAAA3R,EAAA2R,OAEA3R,EAAA2R,OAAA,EACA,GAAA,IACAxqC,EAAA,2EAAAvrB,EAAAy/C,iBAAAmW,EAAAnW,8FACAnjC,QAAAw5B,OAAA,IAAAzmG,MAAA,2CAEAgmH,EAEArhH,EAAAmhH,EAAAlD,EAAAlxB,IAAA,CACA1hE,MAAA4jC,EACAyyD,MAAAA,EACAjmI,QAAAA,IAGA20H,GAAAwR,QAKA3D,EAAA+D,EAAAJ,EAAA51D,GAAA,EAAAvwE,EAAAwzE,GAGA,OADAgzD,EAAAL,EAAA51D,EAAAiyD,GACAA,KAQA,SAAAiE,EAAAn1B,EAAA/gC,GACA,MAAAl6E,EAAAsvI,EAAAr0B,EAAA/gC,GACA,OAAAl6E,EAAAw2F,QAAAw5B,OAAAhwH,GAAAw2F,QAAAC,UAGA,SAAAuwC,EAAA/rB,EAAA/gC,GACA,IAAA0rD,EACA,MAAAyK,EAAAC,EAAAC,GA2SA,SAAAt1B,EAAA/gC,GACA,MAAAm2D,EAAA,GACAC,EAAA,GACAC,EAAA,GACA18G,EAAAx9B,KAAAD,IAAA8jF,EAAAlyE,QAAAtS,OAAAulH,EAAAjzG,QAAAtS,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAAi8B,EAAAj8B,IAAA,CACA,MAAA44I,EAAAt2D,EAAAlyE,QAAApQ,GACA44I,IACAv1B,EAAAjzG,QAAA4G,MAAA+wH,GAAAzF,EAAAyF,EAAA6Q,KACAF,EAAA/0I,KAAAi1I,GAEAH,EAAA90I,KAAAi1I,IAEA,MAAAC,EAAAx1B,EAAAjzG,QAAApQ,GACA64I,IAEAv2D,EAAAlyE,QAAA4G,MAAA+wH,GAAAzF,EAAAyF,EAAA8Q,MACAF,EAAAh1I,KAAAk1I,IAIA,MAAA,CAAAJ,EAAAC,EAAAC,GAhUAG,CAAAz1B,EAAA/gC,GAEA0rD,EAAAF,GAAA2K,EAAAM,UAAA,mBAAA11B,EAAA/gC,GAEA,IAAA,MAAAylD,KAAA0Q,EACA1Q,EAAAgC,YAAA98M,SAAA0gL,IACAqgC,EAAArqI,KAAA4pI,GAAA5/B,EAAA0V,EAAA/gC,OAGA,MAAA02D,EAAAR,EAAAhnH,KAAA,KAAA6xF,EAAA/gC,GAGA,OAFA0rD,EAAArqI,KAAAq1I,GAEA9C,GAAAlI,GACAl3G,MAAA,KAEAk3G,EAAA,GACA,IAAA,MAAArgC,KAAAgpC,EAAAp6H,OACAyxH,EAAArqI,KAAA4pI,GAAA5/B,EAAA0V,EAAA/gC,IAGA,OADA0rD,EAAArqI,KAAAq1I,GACA9C,GAAAlI,MAEAl3G,MAAA,KAEAk3G,EAAAF,GAAA4K,EAAA,oBAAAr1B,EAAA/gC,GACA,IAAA,MAAAylD,KAAA2Q,EACA3Q,EAAAiC,aAAA/8M,SAAA0gL,IACAqgC,EAAArqI,KAAA4pI,GAAA5/B,EAAA0V,EAAA/gC,OAKA,OAFA0rD,EAAArqI,KAAAq1I,GAEA9C,GAAAlI,MAEAl3G,MAAA,KAEAk3G,EAAA,GACA,IAAA,MAAAjG,KAAA1kB,EAAAjzG,QAEA,GAAA23H,EAAA/8B,aAAA1oB,EAAAlyE,QAAA/L,QAAA0jI,GAAA,EACA,GAAArxG,MAAA/gB,QAAAoyH,EAAA/8B,aACA,IAAA,MAAAA,KAAA+8B,EAAA/8B,YACAgjC,EAAArqI,KAAA4pI,GAAAviC,EAAAqY,EAAA/gC,SAGA0rD,EAAArqI,KAAA4pI,GAAAxF,EAAA/8B,YAAAqY,EAAA/gC,IAMA,OAFA0rD,EAAArqI,KAAAq1I,GAEA9C,GAAAlI,MAEAl3G,MAAA,KAGAusF,EAAAjzG,QAAAnjF,SAAA86M,GAAAA,EAAAkC,eAAA,KAEA+D,EAAAF,GAAA6K,EAAA,mBAAAt1B,EAAA/gC,GACA0rD,EAAArqI,KAAAq1I,GAEA9C,GAAAlI,MAEAl3G,MAAA,KAEAk3G,EAAA,GACA,IAAA,MAAArgC,KAAAipC,EAAAr6H,OACAyxH,EAAArqI,KAAA4pI,GAAA5/B,EAAA0V,EAAA/gC,IAGA,OADA0rD,EAAArqI,KAAAq1I,GACA9C,GAAAlI,MAGAj3G,OAAAzE,GAAA20G,EAAA30G,EAAA,GACAA,EACAssE,QAAAw5B,OAAA9lG,KAEA,SAAAimH,EAAAl1B,EAAA/gC,EAAAiyD,GAGA,IAAA,MAAA5mC,KAAAkpC,EAAAt6H,OACAoxF,EAAA0V,EAAA/gC,EAAAiyD,GAOA,SAAA+D,EAAAJ,EAAA51D,EAAA22D,EAAAlnI,EAAAwzE,GAEA,MAAAn9E,EAAAsvI,EAAAQ,EAAA51D,GACA,GAAAl6E,EACA,OAAAA,EAEA,MAAA8wI,EAAA52D,IAAAmkD,EACA9kF,EAAAm/E,EAAAl1M,QAAA+1H,MAAA,GAGAs3F,IAGAlnI,GAAAmnI,EACA7S,EAAAt0H,QAAAmmI,EAAAnW,SAAAzrG,EAAA,CACAuuG,OAAAqU,GAAAv3F,GAAAA,EAAAkjF,QACAt/C,IAEA8gD,EAAA1iI,KAAAu0I,EAAAnW,SAAAx8C,IAGAgpD,EAAAhiN,MAAA2rN,EACAC,EAAAD,EAAA51D,EAAA22D,EAAAC,GACAC,IAEA,IAAAC,EAEA,SAAAC,IACAD,EAAA/S,EAAAJ,QAAA,CAAA5iB,EAAAi2B,EAAA/C,KAEA,IAAA2B,EAAAr5C,EAAAwkB,GAIA,MAAA40B,EAAAL,EAAAM,GACA,GAAAD,EAEA,YADAN,EAAArhH,EAAA2hH,EAAA,CAAAlmI,SAAA,IAAAmmI,GAAAnhH,MAAAkqG,GAGA6V,EAAAoB,EACA,MAAA51D,EAAAisD,EAAAhiN,MAttFA,IAAAsB,EAAA0rN,EAwtFAzY,IAxtFAjzM,EAytFAo2M,EAAA3hD,EAAAy/C,SAAAwU,EAAAnyF,OAztFAm1F,EAytFArW,IAxtFAgB,EAAA5pH,IAAAzsF,EAAA0rN,IA0tFAnK,EAAA8I,EAAA51D,GACAvrD,OAAA3uB,GACA6+H,EAAA7+H,EAAA,IACAA,EAEA6+H,EAAA7+H,EAAA,IAUAuvI,EAAAvvI,EAAAi7G,GAAA60B,GAEAnhH,MAAAkqG,GAEAriC,QAAAw5B,WAGAme,EAAAnyF,OACAiiF,EAAAC,IAAAiQ,EAAAnyF,OAAA,GAEAg0F,EAAAhwI,MAEA0uB,MAAAy9G,KACAA,EACAA,GACA+D,EAEAJ,EAAA51D,GAAA,KAEAi0D,EAAAnyF,OACAiiF,EAAAC,IAAAiQ,EAAAnyF,OAAA,GACAm0F,EAAAL,EAAA51D,EAAAiyD,MAEAx9G,MAAAkqG,MAIA,IAEAuY,EAFAC,EAAAtM,KACAuM,EAAAvM,KAOA,SAAAiL,EAAAhwI,GAGA,OAFA+wI,EAAA/wI,GACAsxI,EAAAn9H,OAAAtvF,SAAAmpK,GAAAA,EAAAhuF,KACAw2F,QAAAw5B,OAAAhwH,GAcA,SAAA+wI,EAAA7mH,GACAknH,IAEAA,GAAA,EACAH,IACAI,EACAl9H,OACAtvF,SAAA,EAAA4xK,EAAAu5B,KAAA9lG,EAAA8lG,EAAA9lG,GAAAusE,MACA46C,EAAA36C,SAGA,SAAAq5C,EAAA90B,EAAA/gC,EAAA22D,EAAAC,GACA,MAAAnC,eAAAA,GAAAvpN,EACA,IAAAszM,IAAAiW,EACA,OAAAn4C,QAAAC,UACA,IAAA06C,GAAAN,GA1yFA,SAAAprN,GACA,MAAAg3M,EAAAX,EAAA7pH,IAAAxsF,GAGA,OADAq2M,EAAA5nH,OAAAzuF,GACAg3M,EAsyFA8U,CAAA1V,EAAA5gB,EAAA0e,SAAA,MACAmX,IAAAD,IACArtN,QAAA+1H,OACA/1H,QAAA+1H,MAAAkjF,QACA,KACA,OAAAxE,EAAA5vB,WACA35E,MAAA,IAAAigH,EAAA1zB,EAAA/gC,EAAAi3D,KACAziH,MAAA+qG,GAAAA,GAAAwB,EAAAxB,KACA9qG,MAAAqhH,GAEA,MAAA9R,EAAAliF,GAAAiiF,EAAAC,GAAAliF,GACA,IAAAw1F,EACA,MAAAC,EAAA,IAAAriI,IAmEA,MAlEA,CACA+2H,aAAAA,EACA/E,SAldA,SAAAsQ,EAAA/O,GACA,IAAAzrI,EACAyoI,EAQA,OAPAvB,EAAAsT,IACAx6I,EAAA4pI,EAAAkC,iBAAA0O,GACA/R,EAAAgD,GAGAhD,EAAA+R,EAEA5Q,EAAAM,SAAAzB,EAAAzoI,IAycAsrI,YAvcA,SAAAl/M,GACA,IAAAquN,EAAA7Q,EAAAkC,iBAAA1/M,GACAquN,EACA7Q,EAAA0B,YAAAmP,GAGAlsC,EAAA,qCAAA3uG,OAAAxzE,QAkcAsuN,SA5bA,SAAAtuN,GACA,QAAAw9M,EAAAkC,iBAAA1/M,IA4bAy/M,UAhcA,WACA,OAAAjC,EAAAiC,YAAAloI,KAAAg3I,GAAAA,EAAAlS,UAgcAlpC,QAAAA,EACArxK,QAAAA,EACAm2E,KAAAA,EACAoO,QA1VA,SAAAsxG,GACA,OAAA1/G,EAAA2yB,EAAAmhH,EAAAp0B,GAAA,CAAAtxG,SAAA,MA0VAu0H,GAAAA,EACA7B,KAAA,IAAA6B,GAAA,GACA5B,QAAA,IAAA4B,EAAA,GACA6N,WAAAwC,EAAA9+H,IACAqiI,cAAAtD,EAAA/+H,IACAy8H,UAAAuC,EAAAh/H,IACAvpF,QAAAorN,EAAA7hI,IACAsiI,QAzDA,WACA,OAAAX,GAAAjL,EAAAhiN,QAAAk6M,EACA7nC,QAAAC,UACA,IAAAD,SAAA,CAAAC,EAAAu5B,KACAqhB,EAAA5hI,IAAA,CAAAgnF,EAAAu5B,QAsDA1oM,QAAA7D,GACA,MAAAF,EAAAktG,KACAhtG,EAAAJ,UAAA,aAAA8jN,IACA1jN,EAAAJ,UAAA,aAAAglN,IACA5kN,EAAAunF,OAAAwyG,iBAAAw0B,QAAAzuN,EACAU,OAAAC,eAAAT,EAAAunF,OAAAwyG,iBAAA,SAAA,CACAhuF,YAAA,EACAvd,IAAA,IAAAgmH,EAAApJ,MAAAsX,KAKAzN,IAGA8Y,GACArL,EAAAhiN,QAAAk6M,IAEAmT,GAAA,EACAj2I,EAAA0iI,EAAAhF,UAAAtqG,OAAAzE,IACAu7E,EAAA,6CAAAv7E,OAGA,MAAA+nH,EAAA,GACA,IAAA,IAAAxsN,KAAA44M,EAEA4T,EAAAxsN,GAAAwyM,EAAA57G,UAAA,IAAA8pH,EAAAhiN,MAAAsB,KAEAhC,EAAA8sL,QAAAgoB,EAAAh1M,GACAE,EAAA8sL,QAAAioB,EAAAP,EAAAhe,SAAAg4B,IACAxuN,EAAA8sL,QAAAkoB,EAAA0N,GACA,IAAA+L,EAAAzuN,EAAAoqL,QACA4jC,EAAAhiI,IAAAhsF,GACAA,EAAAoqL,QAAA,WACA4jC,EAAAv9H,OAAAzwF,GACAguN,EAAA/jH,KAAA,IACAsjH,IACA7K,EAAAhiN,MAAAk6M,EACAmT,GAAA,EACAJ,GAAA,GAEAc,KAEAxZ,GACAkR,GAAAnmN,EAAAF,EAAAu9M,MAqDA/8M,EAAAi9M,oBAAAA,GACAj9M,EAAAouN,qBAhkFA,SAAAthF,GAWA,OAPAA,EAAAooE,SAAAhjG,KAAA46B,GAAAooE,SAAAY,SAAAZ,SAAAv8F,OAAA,IAEAzgC,QAAA,KAAA,IACA40D,GAAA,KACAA,EAAAr6D,SAAA,OAAAq6D,EAAAr6D,SAAA,MACAivG,EAAA,sCAAA50C,iBAAAA,EAAAlnD,QAAA,OAAA,UAEA+yH,EAAA7rE,IAsjFA9sI,EAAA24M,iBAAAA,EACA34M,EAAA86M,oBAAAA,EACA96M,EAAAs0M,gBAAAA,EACAt0M,EAAAquN,mBAh+CA,SAAAC,GACA,IAAApa,EAAAl7B,qBAEA,YADA0I,EAAA,0GAGA,MAAA6sC,EAAAra,EAAAtnB,OAAA0nB,EAAA,IAAAl0M,MACAmuN,EAIArN,GAAAqN,EAAA,cAAAD,GAHA5sC,EAAA,iFA09CA1hL,EAAAwuN,oBA98CA,SAAAC,GACA,IAAAva,EAAAl7B,qBAEA,YADA0I,EAAA,2GAGA,MAAA6sC,EAAAra,EAAAtnB,OAAA0nB,EAAA,IAAAl0M,MACAmuN,EAIArN,GAAAqN,EAAA,eAAAE,GAHA/sC,EAAA,iFAw8CA1hL,EAAAi1M,WAAAA,GACAj1M,EAAAy0M,iBAAAA,EACAz0M,EAAAw0M,UAAAA,EACAx0M,EAAA00M,sBAAAA,EACA10M,EAAAg2M,eAAAA,GACAh2M,EAAAmiN,QAAAA,GACAniN,EAAA0uN,SAtBA,WACA,OAAAxa,EAAAtnB,OAAA6nB,IAsBAz0M,EAAA2uN,UA9BA,WACA,OAAAza,EAAAtnB,OAAA4nB,IA8BAx0M,EAAAu0M,aAAAA,yNCzyGiD,aACtB,eACb,SACP,SAAAwR,EAA6B6I,EAAkBC,SAC5Cx5C,EAAAA,EAAAA,2BACFA,EACAA,EAAKkQ,KAAAA,EAAAA,WAAiBqpC,EAAkBC,cAGlC/2C,EAAAA,EAAAA,aACOA,EAAOg3C,yBAA2Bh3C,EAAOg3C,0BAAAA,IACjDt3I,KAAAA,CACDo3I,iBAAAA,EACAC,QAAAA,4WCbL,SAAAE,WACIC,IAAYC,6BAEhB,SAAAD,UAEyB,oBAAd18C,UACRrmE,YACkB,IAAXC,EACHA,EAAAA,0FCRd,aAEAlsG,EAAAkvN,eAAA,SAAA37I,GACA,OAAAA,GAAAA,EAAA7yE,WAAA6yE,EAAA,CACA1zE,QAAA0zE,IAIAvzE,EAAAmvN,kBAAA,SAAA57I,GACArzE,OAAAC,eAAAozE,EAAA,aAAA,CACAnzE,OAAA,KAIAJ,EAAAovN,UAAA,SAAA3tI,EAAA4tI,GAkBA,OAjBAnvN,OAAAW,KAAA4gF,GAAA3gF,SAAA,SAAAY,GACA,YAAAA,GAAA,eAAAA,IAKAA,KAAA2tN,GAAAA,EAAA3tN,KAAA+/E,EAAA//E,IAIAxB,OAAAC,eAAAkvN,EAAA3tN,EAAA,CACA+pG,YAAA,EACAvd,IAAA,WACA,OAAAzM,EAAA//E,UAIA2tN,GAGArvN,EAAAsvN,OAAA,SAAAD,EAAAE,EAAArhI,GACAhuF,OAAAC,eAAAkvN,EAAAE,EAAA,CACA9jH,YAAA,EACAvd,IAAAA,0KCtCashI,EAAa,uMCAZ,kCACA,kCACA,wCACA,sCACA,oCACA,2hBCE4uSC,qDAAuB7jI,mDAAqB5F,uDAAmBg1B,4CAAuB00G,mDAAYplF,mDAAmBqlF,6CAAmBC,aAA1sS,aAAYtlF,EAAE,CAACmhB,EAAEhrJ,IAAI,CAACm8K,EAAEliE,SAAS/5G,GAAG,KAAK+5G,EAAEtoC,QAAQ,CAAC3xE,EAAEm8K,EAAEliE,WAAW9xB,EAAE6iE,EAAEhrJ,EAAEm8K,UAAUh0F,IAAInoF,GAAGE,EAAE+5G,EAAE9xB,GAAGnoF,IAAIA,GAAGE,GAAG,EAAA,OAASi8K,EAAEj8K,IAAIizE,EAAE02D,GAAG,CAACmhB,EAAEhrJ,WAAWkkN,MAAM/nC,GAAGn8K,SAASgrJ,GAAGmxB,EAAEnxB,EAAEmxB,EAAEnxB,SAAS7/D,EAAE1rF,OAAOc,OAAAA,CAAQ6uN,UAAU,KAAK3+B,MAAMzlC,QAAQhrJ,EAAE,KAAKgrJ,EAAEqkE,GAAAA,KAAQA,GAAGlzC,GAAGnxB,KAAKmxB,EAAEzpG,SAAS1yE,IAAIm8K,EAAEA,EAAEzpG,cAAcypG,GAAGA,EAAEzpG,QAAQypG,IAAIA,EAAEzvF,MAAMs+D,EAAEk5D,MAAMlkN,GAAGiyK,QAAQ9+F,UAAUoS,EAAAA,CAAGrT,KAAAA,CAAMzB,IAAI,SAASgmH,GAAG,QAAQpqD,KAAAA,CAAMijF,eAAe,QAAQC,QAAAA,CAAS9+I,IAAI,OAAO++I,UAAAA,EAAYF,eAAe,WAAWrmD,YAAAA,CAAax4F,IAAI,QAAQg/I,GAAAA,CAAIC,OAAAA,EAASC,qBAAAA,EAAuBl/I,IAAI,OAAOm/I,aAAa,YAAYC,QAAAA,CAASH,OAAAA,EAASC,qBAAAA,EAAuBl/I,IAAI,QAAQq/I,UAAAA,CAAWC,cAAc,QAAQC,UAAAA,CAAWD,cAAc,QAAQE,UAAAA,CAAWF,cAAc,SAASr8C,EAAAA,CAAGwzC,MAAAA,CAAOn7E,YAAAA,GAAeM,KAAAA,CAAM6jF,oBAAAA,EAAsBnkF,WAAAA,CAAY,OAAO,WAAW23B,KAAAA,CAAMwsD,oBAAAA,EAAsBN,aAAa,OAAO7jF,WAAAA,CAAY,UAAU,OAAO,aAAa,YAAYlmD,KAAAA,CAAMqqI,oBAAAA,EAAsBnkF,WAAAA,CAAY,OAAO,cAAc,MAAM,QAAQ,YAAY,WAAW,OAAO,iBAAiB,QAAQ,cAAc,aAAa,KAAK,UAAU+kC,MAAAA,CAAO/kC,WAAAA,CAAY,UAAUokF,OAAAA,CAAQpkF,WAAAA,CAAY,MAAM,OAAO,WAAW,QAAQ,QAAQ,cAAc,YAAY,mBAAmBqkF,SAAAA,CAAUrkF,YAAAA,IAAgBtsI,OAAOc,OAAAA,IAAWd,OAAOc,OAAAA,UAAiB8vN,EAAEvmH,MAAM/gB,QAAQ+wB,EAAEkxC,GAAG,mBAAmBA,EAAE+lB,EAAE/lB,GAAG,iBAAiBA,EAAEslE,EAAEtlE,GAAG,OAAOA,GAAG,iBAAiBA,EAAEulE,EAAE9wN,OAAOmqG,UAAUS,SAAS/pG,EAAE0qJ,GAAG,oBAAoBulE,EAAE1mH,KAAKmhD,GAAGwlE,EAAEruN,OAAO,YAAYo7F,EAAEp7F,OAAO,iBAAiBsuN,EAAEtuN,OAAO,gBAAgBuuN,EAAEvuN,OAAO,mBAAmB,SAAA03G,EAAWmxC,MAAMqlE,EAAErlE,GAAAA,OAAUA,EAAE30E,IAAIwjC,MAAMy2G,EAAEtlE,GAAAA,OAAUhrJ,EAAAA,aAAem8K,KAAKnxB,EAAEhrJ,EAAEm8K,GAAG,YAAYA,EAAEnxB,EAAEmxB,GAAGtiE,EAAEmxC,EAAEmxB,WAAWn8K,SAASgrJ,QAAQ2lE,EAAE,CAAC3lE,EAAEhrJ,EAAEm8K,WAAWliE,EAAAA,aAAe/5G,KAAK8qJ,EAAE9qJ,GAAGF,KAAKE,IAAI+5G,EAAEljC,KAAK72E,EAAEF,IAAIm8K,GAAGA,EAAEj8K,WAAW+5G,GAAG0sF,EAAE,CAAC37C,EAAEhrJ,EAAAA,GAAKm8K,EAAEliE,SAASkiE,IAAIliE,MAAM4qE,OAAO1I,EAAE3uE,QAAQyM,GAAG+wC,GAAGhrJ,EAAEkxE,QAAAA,IAAAA,IAAgB85E,EAAE,EAAEA,EAAEhrJ,EAAEkxE,OAAO85E,IAAAA,OAAW9qJ,EAAEF,EAAEgrJ,OAAOmxB,IAAIA,EAAEj8K,GAAAA,YAAeymG,QAAQnrB,MAAAA,sBAA4Bt7E,wBAAwBF,EAAEm8K,GAAGA,EAAEA,EAAEj8K,GAAG+5G,EAAEA,EAAE5jC,KAAK20E,GAAGA,EAAE9qJ,KAAK85E,OAAOsP,aAAa6yF,IAAIliE,EAAAA,aAAe/5G,EAAAA,EAAI8qJ,KAAKhrJ,WAAWm8K,EAAEnxB,EAAEvrJ,OAAOW,KAAK4qJ,GAAAA,MAAShrJ,EAAAA,IAAAA,MAAYgrJ,KAAKhrJ,EAAAA,GAAKgrJ,GAAGslE,EAAEtlE,GAAAA,IAAAA,MAAahrJ,KAAKgrJ,EAAEmxB,EAAEzhG,SAAS16E,IAAIm8K,EAAEplG,KAAK/2E,UAAUm8K,GAA5Hj8K,IAAmI+5G,GAAG9xB,EAAE1oF,OAAOW,KAAK+7K,aAAanxB,KAAK7iE,EAAEjoF,EAAEw6E,SAASswE,WAAWmxB,EAAEnxB,aAAa7iE,KAAKjoF,EAAAA,KAAOA,GAAAA,UAAa8qJ,EAAE,EAAEA,EAAE/wC,EAAE/oC,OAAO85E,IAAAA,OAAWhrJ,EAAEi6G,EAAE+wC,MAAMhrJ,GAAGmoF,KAAKnoF,QAAAA,IAAYA,EAAEmoF,GAAAA,CAAIjoF,EAAEI,EAAEN,EAAEmoF,cAAcjoF,EAAAA,CAAGi8K,EAAEh0F,KAAKg0F,EAAEh0F,GAAAA,UAAajoF,EAAAA,aAAe8qJ,KAAK/wC,EAAE9xB,KAAK6iE,GAAG9qJ,EAAE62E,KAAKi0E,EAAE7iE,IAAIw+G,EAAE37C,EAAAA,IAAMhrJ,EAAEmoF,GAAGg0F,EAAEh0F,GAAGjoF,aAAai8K,EAAEh0F,IAAIkoI,EAAEp2G,EAAE,GAAG9xB,MAAMg0F,EAAEh0F,GAAAA,UAAa/U,EAAAA,GAAKsF,EAAEi4I,EAAE12G,EAAE9xB,GAAG6iE,GAAG53E,EAAE2D,KAAKi0E,EAAE0lE,UAAU59I,EAAEk4E,EAAEinB,QAAQv5F,EAAEtF,EAAE+oG,EAAEh0F,GAAGA,EAAEnoF,GAAGM,EAAEwyE,KAAKA,EAAE+mC,EAAE/mC,IAAIqpG,EAAEh0F,GAAGrV,IAAI89I,EAAE,CAAC5wN,EAAEm8K,EAAEliE,EAAE/5G,EAAAA,YAAcioF,EAAE0oI,EAAE7wN,EAAEi6G,EAAE/5G,GAAGkzE,EAAAA,EAAAA,QAAAA,IAAQ01H,MAAM3sB,EAAEh0F,WAAWjoF,EAAEgxE,QAAQlxE,EAAEwtG,SAASxtG,EAAEwtG,QAAQz2B,KAAK3D,GAAGA,GAAGy9I,EAAE,CAAC7lE,EAAEhrJ,EAAEm8K,EAAAA,MAAAA,CAAS1uF,IAAI,CAACwsB,EAAE/5G,EAAEioF,QAAQjoF,IAAIswN,EAAAA,OAAAA,KAActwN,IAAIq9F,EAAAA,OAASytD,EAAEx9C,WAAWttG,IAAIuwN,EAAAA,OAASx2G,KAAK/5G,IAAIwwN,EAAAA,OAAS1wN,MAAMozE,EAAEuiH,QAAQloG,IAAIwsB,EAAE/5G,EAAEioF,OAAOmoI,EAAEl9I,GAAAA,OAAUA,MAAMA,EAAEo9I,GAAAA,OAAUroI,EAAAA,IAAMg0F,EAAEj8K,GAAGkzE,EAAEw9I,EAAE5lE,EAAE53E,EAAEpzE,EAAEmoF,GAAGwtG,QAAQjoG,IAAIusB,EAAE/5G,EAAEkzE,UAAUA,GAAGsa,IAAI,CAAC1tF,EAAEi6G,EAAE/5G,WAAWioF,EAAEwtG,QAAQjoG,IAAI1tF,EAAEi6G,EAAE/5G,MAAMioF,EAAAA,OAAS/U,EAAEi9I,EAAErwN,OAAO04E,EAAE5F,GAAAA,GAAM06B,QAAQ2yF,EAAEtb,OAAO7vF,GAAGg2D,EAAE2C,EAAE,YAAY3C,KAAKmxB,EAAAA,IAAMgkB,EAAEwwB,EAAExwB,EAAEn1C,GAAG53E,GAAGu6E,IAAIwuB,EAAEjrG,OAAO,EAAA,CAAGwH,EAAEsyE,QAAQqlE,EAAEr7H,KAAKliB,GAAAA,GAAMkiB,EAAEA,EAAEg2D,GAAG2C,OAAO76E,EAAAA,OAAS6zH,EAAE37C,GAAG7iE,KAAK7nF,EAAEJ,GAAAA,OAAUymM,EAAE37C,EAAEmxB,GAAGh0F,MAAM0hD,EAAE12D,EAAAA,GAAKC,GAAGy2D,EAAEs2D,EAAEhtH,EAAEgtH,EAAE9pH,KAAK20E,GAAGA,EAAE0lE,MAAM7mF,EAAE8mF,EAAExwB,EAAElmF,GAAG+wC,GAAG73E,EAAE4D,KAAKi0E,EAAE0lE,UAAUvlI,EAAE6/D,EAAEinB,QAAQpoC,EAAE12D,EAAE6hB,EAAEilB,EAAEkiE,GAAG77K,EAAE6qF,KAAKA,EAAE0uB,EAAE1uB,IAAI/X,GAAGsF,EAAEsc,EAAEtc,GAAGyS,EAAE6J,EAAEilB,GAAG9uB,SAAShD,GAAGunH,eAAe,CAAC1vM,EAAEi6G,WAAW/5G,EAAEy1L,QAAQ+Z,eAAe1vM,EAAEi6G,MAAM/5G,EAAAA,OAASA,EAAEmwN,EAAErwN,OAAOmoF,EAAE/U,EAAE43E,EAAEx9C,QAAQ90B,EAAEsyE,EAAE65B,OAAO/xG,EAAE,YAAYk4E,KAAKmxB,EAAAA,IAAM/oG,EAAEA,EAAEiD,KAAKr2E,GAAGA,GAAGA,EAAEgrJ,KAAK9qJ,GAAG4yE,IAAIqpG,EAAEjrG,OAAO,EAAA,CAAGiX,EAAE6iE,QAAQtyE,EAAEA,EAAEsyE,GAAGl4E,OAAOM,EAAEP,MAAMm4E,GAAGA,GAAG/wC,KAAK+wC,IAAAA,KAAShrJ,EAAE8yE,EAAAA,GAAK5yE,GAAGF,EAAEozE,EAAEN,EAAEM,EAAEiD,KAAK20E,GAAGA,EAAE0lE,MAAM1wN,EAAE2wN,EAAEv9I,EAAE6mC,GAAG+wC,GAAGl4E,EAAEiE,KAAKi0E,EAAE0lE,UAAUvwB,EAAEn1C,EAAEinB,QAAQjyK,EAAE8yE,EAAE4F,EAAEuhC,EAAEkiE,GAAG77K,EAAE6/L,KAAKA,EAAEtmF,EAAEsmF,IAAIjgM,GAAGioF,EAAEzP,EAAEyP,GAAGg4G,EAAEznH,EAAEuhC,GAAGkmF,cAAcznH,EAAEuhC,UAAU/5G,KAAK4wN,EAAAA,GAAK,SAAAC,EAAW/lE,EAAEmxB,EAAEliE,EAAE/5G,SAAS,kBAAkBA,EAAAA,SAAW8qJ,EAAEmxB,EAAEliE,EAAE/5G,SAAS6vN,cAAc5nI,GAAGjoF,MAAMioF,IAAI8xB,EAAAA,UAAY+wC,EAAEw9C,MAAAA,MAAAA,CAAa/R,GAAG,GAAG1d,MAAAA,EAAAA,EAAAA,OAAe5wF,IAAI8xB,QAAQ62G,EAAE3oI,GAAAA,OAAU6iE,EAAEhrJ,GAAG8pG,MAAM4rD,KAAKt0J,SAAS4vN,iBAAiB7oI,QAAQ6iE,EAAAA,YAAcrkD,QAAQnrB,MAAM,sCAAsC2M,EAAE,6BAA6BnoF,GAAG2mG,QAAQs6E,KAAK,uCAAuC94F,GAAG2oI,EAAE3oI,GAAAA,CAAIhnF,GAAG6pJ,EAAE6hB,MAAAA,UAAgB1rK,GAAGiyE,EAAEy5F,MAAMn0F,GAAGo4I,EAAE3oI,aAAanoF,KAAKi6G,EAAAA,KAAO/5G,EAAE+wN,EAAEjmE,EAAAA,GAAKmxB,KAAKn8K,KAAKi6G,EAAEj6G,GAAGi6G,GAAGo2G,EAAEnwN,KAAKA,EAAEA,EAAEq2E,KAAK,MAAMnD,EAAE28F,aAAa/vK,EAAEE,GAAG,IAAIw4E,EAAEgC,SAAS16E,IAAI04E,EAAE3B,KAAK/2E,SAAS8yE,EAAE4F,EAAEsB,QAAQgxE,IAAI/wC,EAAE+wC,eAAeA,KAAKl4E,EAAEM,EAAEyrG,gBAAgB7zB,GAAhjB9qJ,CAAojB8qJ,EAAEmxB,EAAEliE,EAAE/5G,GAAG,UAAUA,EAAAA,SAAW8qJ,EAAEhrJ,EAAEm8K,EAAEliE,UAAMo2G,EAAEl0C,IAAUx1E,QAAQs6E,KAAK,2DAAA,IAAqExhL,OAAOW,KAAK+7K,GAAG9lG,KAAKn2E,UAAUioF,EAAAA,CAAGunI,MAAM1vN,EAAE24J,KAAKwjB,MAAMliE,EAAEi3G,WAAW/oI,EAAEgpI,cAAAA,IAAkBl3G,EAAEi3G,WAAWlxN,EAAEi6G,EAAEi3G,gBAAAA,GAAmBj3G,EAAE01G,oBAAAA,OAA2B3kE,GAAAA,IAAO/wC,EAAE01G,oBAAoB3vN,EAAEi6G,EAAE01G,oBAAoBxnI,EAAEipI,SAAAA,GAAYpmE,KAAK9qJ,IAAIioF,EAAE6U,SAAAA,GAAYguD,KAAK9qJ,YAAYmxN,EAAErmE,EAAEhrJ,EAAEm8K,EAAEj8K,GAAG+5G,EAAE9xB,MAAMnO,OAAOsP,SAASgoI,OAAzZpxN,CAAia8qJ,EAAEmxB,EAAEliE,EAAE/5G,GAAGmxN,EAAErmE,EAAEmxB,EAAEliE,EAAE/5G,GAAG,SAAAmxN,EAAWrmE,EAAEmxB,EAAEliE,EAAE/5G,EAAAA,GAAKioF,SAAS/U,EAAAA,CAAG,UAAU,OAAO,cAAcsF,EAAEsyE,GAAAA,SAAYA,EAAEhrJ,aAAam8K,KAAKnxB,EAAAA,OAASA,EAAE0oB,EAAEyI,MAAMA,GAAGnxB,EAAAA,OAASA,EAAEhrJ,IAAjEgrJ,EAAuEl4E,EAAE5yE,EAAEuwE,KAAKu6E,MAAMqlE,EAAEp2G,GAAAA,OAAUA,EAAE5jC,KAAKr2E,GAAGqxN,EAAErmE,EAAEmxB,EAAEn8K,EAAEE,EAAEioF,KAAKnO,OAAOsP,SAASgoI,aAAa7gJ,IAAIqC,EAAE5yE,EAAEuwE,KAAK0rG,GAAGliE,MAAMkmF,EAAE,GAAGnrG,GAAAA,EAAK24D,GAAAA,KAAQojB,EAAE92D,GAAGkmF,EAAElmF,OAAAA,GAAUA,EAAEzkC,UAAU66I,EAAEp2G,EAAEzkC,UAAUwf,GAAAA,EAAKmrG,EAAElmF,EAAEzkC,SAASa,KAAKr2E,UAAUi6G,EAAEo3G,EAAErmE,EAAEmxB,EAAEn8K,EAAEE,EAAEioF,UAAUkoI,EAAEp2G,GAAGA,EAAE5jC,KAAK,EAAE0iG,MAAM/tB,KAAKA,IAAI/wC,GAAGA,EAAE8+D,kBAAkB/tB,EAAE,YAAYhrJ,KAAKozE,EAAAA,KAAO+sH,GAAGlmF,EAAEj6G,GAAAA,CAAImgM,EAAE,IAAIn1C,EAAEl3E,KAAKC,UAAUkmC,EAAEj6G,IAAIi6G,EAAEj6G,GAAG2tJ,EAAE3C,EAAE,QAAQA,WAAWnhB,EAAE1hD,GAAGA,EAAEipI,UAAUj1C,EAAEhpG,EAAEgV,GAAGA,EAAE6U,UAAUm/E,MAAMtP,MAAM1hF,GAAG8uB,KAAK9uB,GAAG,iBAAiB8uB,EAAE9uB,IAAIA,EAAAA,QAAAA,CAAWA,EAAAA,IAAM8uB,UAAU9uB,EAAE1a,WAAW0a,EAAE3V,gBAAgB2V,EAAEsrG,aAAazrC,KAAK53E,SAAS+X,EAAE6/D,MAAMh2D,EAAEmrG,EAAE8wB,EAAEjmE,EAAE73E,EAAEgtH,EAAElmF,OAAAA,OAAcj6G,IAAI04E,EAAE,0BAA0B42I,eAAenzC,GAAGj8K,MAAMi8K,GAAGn8K,EAAAA,OAASgrJ,GAAGtyE,EAAE,cAAcyjG,EAAEpL,EAAE/wK,GAAGA,EAAEgrJ,KAAKmxB,EAAAA,OAASqzC,SAASxvN,GAAGE,MAAMF,EAAAA,OAASgrJ,EAAE9qJ,EAAE0vN,cAAcl3I,EAAE,gBAAgBsyE,IAAI7/D,EAAE6/D,GAAGnhB,GAAG1+C,EAAEgxF,GAAG80C,EAAEjmE,EAAE73E,EAAEgY,EAAEgxF,IAAIgkB,EAAEh4G,GAAGg4G,EAAE,QAAQA,EAAE8wB,EAAEjmE,EAAE73E,EAAEgtH,EAAElmF,SAAS10B,EAAE4C,GAAGA,EAAEgpI,aAAAA,GAAgBhpI,EAAEgpI,gBAAgBr+I,IAAIA,KAAK,UAAUyS,IAAIylE,EAAEw9C,MAAAA,YAAkBpnM,SAAS8lN,MAAM/mB,GAAGxyC,GAAGwyC,IAAIh1G,EAAEnqF,UAAUm/L,SAASrmF,EAAAA,EAAAA,EAAIv0B,EAAE4F,EAAEg1G,QAAAA,UAAkB1J,GAAGx8E,EAAEw8E,GAAG1d,MAAMj/D,GAAG,SAAAm3G,GAAYM,SAASvmE,EAAEntD,MAAM79F,GAAGm8K,EAAEliE,EAAE/5G,SAASioF,EAAEnoF,GAAGA,EAAEm8K,OAAOh0F,IAAI2xB,EAAE3xB,GAAAA,OAAU8xB,QAAQ7mC,EAAAA,CAAGJ,QAAQinC,EAAEs3G,SAASvmE,MAAM9qJ,GAAGA,EAAEwvN,MAAAA,OAAaA,MAAM1kE,EAAE2N,KAAK34J,GAAGE,EAAEkzE,EAAE43E,GAAGhrJ,QAAQ04E,EAAEyP,EAAE/U,MAAMsF,GAAGA,EAAExH,OAAAA,OAAcsE,SAASw1E,GAAGtyE,EAAE,UAAUsyE,EAAEA,EAAE3gD,WAAW,UAAU4P,QAAQu3G,EAAE,mBAAmBrvN,QAAQ,iBAAiBA,OAAOspM,YAAYrkH,GAAG4jE,EAAgD,cAA7CwmE,EAAErvN,OAAO,eAAe6oJ,GAAG,eAAeA,GAAhD5jE,IAAG4jE,EAA+D,SAAAymE,EAAWzmE,EAAEhrJ,EAAEm8K,aAAaliE,KAAKj6G,EAAEi6G,KAAKkiE,EAAEm0C,EAAEtlE,EAAE/wC,IAAIw3G,EAAEzmE,EAAE/wC,GAAGj6G,EAAEi6G,GAAGkiE,EAAEliE,IAAIj6G,EAAEi6G,KAAKkiE,EAAEliE,KAAK+wC,EAAE/wC,GAAGj6G,EAAEi6G,IAAI+wC,EAAE/wC,GAAGj6G,EAAEi6G,aAAaA,KAAKkiE,EAAEn8K,GAAGi6G,KAAKj6G,UAAUgrJ,EAAE/wC,GAAG,SAAAM,EAAWywC,MAAMA,IAAIA,EAAAA,EAAAA,2BAAAA,GAAeA,EAAAA,OAASA,EAAEo2B,WAAW56F,OAAOwyG,iBAAiB04B,aAAa,SAAAvC,EAAWnkE,EAAEhrJ,SAASmoF,EAAAA,EAAAA,2BAAAA,MAAkBnoF,GAAGmoF,IAAInoF,EAAEu6G,EAAEpyB,KAAKnoF,EAAAA,MAAAA,IAAY+kG,MAAM,4CAAoCimD,KAAAA,EAAAA,MAAOA,GAAG,CAACA,EAAEhrJ,KAAKyxN,EAAEr+I,EAAEswF,KAAK1Y,EAAEhrJ,MAAMgrJ,EAAEA,EAAErrJ,aAAayzE,EAAEpzE,EAAE2xN,QAAQ3mE,EAAE7iE,UAAU/U,EAAE,SAAA87I,oBAAsB9nI,SAASwqI,EAAAA,EAAAA,gBAAAA,CAAK9yN,KAAK,WAAWioL,cAAAA,EAAgB0J,MAAM,CAACzlC,GAAGntD,MAAM79F,KAAK,WAAWgrJ,EAAEzwC,OAAOywC,EAAAA,OAASA,EAAEnpJ,OAAAA,CAAQg8F,MAAM79F,OAAO,SAAA6xN,EAAW7mE,EAAEhrJ,EAAEm8K,EAAEliE,SAAS/5G,EAAEmwN,EAAEp2G,GAAGA,EAAAA,CAAGA,GAAG+wC,EAAEmxB,EAAEnqG,SAAS,UAAU9xE,EAAEG,SAAS2qJ,IAAIA,EAAEp4E,QAAQo4E,EAAEp4E,MAAAA,IAAUo4E,EAAEp4E,MAAM,gBAAA,KAAqB1yE,EAAEG,SAAS,CAAC2qJ,EAAEhrJ,KAAKgrJ,EAAEj4E,OAAAA,EAAAA,SAAU7yE,EAAEw2E,OAAO12E,EAAE,MAAMA,EAAEm8K,KAAKn8K,EAAEm8K,GAAAA,IAAOn8K,EAAEm8K,GAAGplG,QAAQ72E,SAAS8uN,EAAE,CAAChkE,GAAAA,EAAKhrJ,EAAEm8K,IAAI21C,EAAE3xN,OAAO6qJ,EAAEhrJ,GAAGulF,EAAE42F,GAAGhxF,GAAG,MAAA2mI,EAAQtpB,OAAAA,EAAShiH,OAAO6wF,OAAO9jF,SAASw+H,cAAAA,EAAgBn5G,YAAYoyC,EAAEhrJ,EAAEm8K,EAAEliE,GAAGhO,KAAKu8F,MAAMx9C,EAAE/+C,KAAKzlB,OAAOxmF,EAAEisG,KAAKorE,OAAO8E,EAAEliE,GAAG,UAAUA,GAAGH,EAAEG,EAAEw2E,SAASxkF,KAAK1Y,SAAS0mB,iBAAiB,CAAC+wC,EAAEhrJ,EAAEm8K,WAAWliE,EAAAA,EAAI+wC,EAAEhrJ,WAAWm8K,EAAAA,GAAKliE,EAAAA,CAAG4qE,OAAO7kL,EAAEiyK,QAAQjnB,EAAEx9C,QAAQ2uE,GAAGj8K,EAAE,IAAIymM,EAAE1sF,UAAUxkC,QAAQwkC,EAAE+3G,QAAQ9xN,EAAE+xN,UAAU,CAACjnE,EAAEhrJ,EAAEm8K,GAAAA,WAAch0F,EAAEyoI,EAAE32G,EAAE+wC,EAAEhrJ,GAAAA,WAAcm8K,GAAGj8K,IAAIioF,GAAG+pI,UAAU,CAAClnE,EAAEhrJ,GAAAA,WAAci6G,EAAEkiE,EAAErzE,WAAW9oG,GAAGA,IAAIgrJ,GAAGhrJ,EAAEywN,KAAKzlE,WAAW/wC,GAAG,IAAIkiE,EAAEzlG,OAAOujC,EAAE,GAAGj6G,GAAGE,KAAAA,MAAxP+5G,EAAqQ,CAAC+wC,EAAEhrJ,EAAEi6G,EAAE/5G,EAAEioF,IAAI2xB,EAAEqiE,GAAGA,EAAEnxB,EAAEhrJ,EAAEi6G,EAAE/5G,EAAEioF,GAAGg0F,EAAElK,QAAQjnB,EAAEhrJ,EAAEi6G,EAAE/5G,EAAEioF,IAAAA,EAAAA,SAAAA,gBAAsB2pI,EAAE9mE,EAAEhrJ,EAAEi6G,EAAEkiE,IAAIwd,QAAQ3uC,GAAGA,EAAEnsJ,UAAU,WAAW+yN,GAAG5mE,EAAExkE,OAAOwyG,iBAAiB04B,aAAazlH,KAAK++C,EAAE+gC,QAAQ3kG,EAAE6kB,KAAKorE,OAAO5hG,QAAQovG,QAAQ8sC,QAAQ3mE,EAAEhrJ,GAAGA,IAAIA,EAAAA,EAAAA,2BAAAA,SAAqBi6G,EAAAA,CAAG00D,QAAAA,IAAYzuK,EAAAA,CAAGmvN,GAAGrvN,IAAIuzF,SAASpL,GAAG8jB,KAAK9jB,GAAGA,EAAEsoG,OAAOtoG,EAAEsoG,MAAMvwL,SAASkzE,EAAE64B,KAAKorE,OAAO46C,UAAUjnE,EAAE9qJ,GAAAA,GAAMw4E,EAAEsyE,GAAG/+C,KAAKo9E,UAAUr+B,EAAE53E,EAAE6mC,EAAEj6G,UAAUA,GAAAA,EAAAA,YAAK04E,GAAAA,CAAIgrF,KAAKtwF,EAAE++I,UAAUnnE,GAAG/wC,EAAE00D,QAAQ53F,KAAKi0E,GAAGq+B,QAAQ3wG,GAAG2wG,QAAQr+B,EAAEhrJ,EAAEm8K,EAAEliE,MAAMA,EAAAA,OAAS2sF,IAAI1mM,GAAG+5G,EAAEimE,SAAShgL,GAAGA,EAAEkyN,aAAAA,KAAkBn4G,EAAAA,IAAMo4G,kBAAkBlqI,cAAcmqI,aAAal/I,KAAK+U,EAAE/U,GAAGA,EAAE/yE,SAAS8nF,IAAIA,IAAIjoF,GAAG+5G,IAAIA,EAAEs4G,aAAat4G,OAAAA,EAAShO,KAAKumH,cAAcxnE,EAAEhrJ,EAAEm8K,sBAAsBliE,EAAEw4G,QAAQvyN,EAAEsvK,WAAAA,CAAYkjD,WAAAA,KAAgBzmH,KAAKumH,cAAcxnE,EAAEhrJ,EAAEm8K,uBAAuBnxB,EAAEhrJ,EAAEm8K,GAAGlwE,KAAKorE,OAAO66C,UAAUlyN,IAAIgrJ,GAAGmxB,SAASnK,QAAQ2gD,IAAIx2C,EAAExN,QAAQt4F,KAAK20E,GAAGA,OAAOnpJ,QAAQg8F,MAAMmtD,GAAAA,UAAamxB,EAAElwE,KAAKorE,OAAO5hG,QAAQovG,QAAQ2jB,MAAMvuF,GAAGhO,SAASgO,IAAIhO,KAAK8lH,aAAAA,CAAc9lH,KAAK8lH,cAAAA,QAAsB/mE,EAAE,WAAWA,EAAE5pJ,SAAS4vN,iBAAiB,iBAAiBhmE,GAAGA,EAAE95E,QAAQ85E,EAAE3qJ,SAAS2qJ,GAAGA,EAAEwkB,YAAYxkB,EAAEwkB,WAAWC,YAAYzkB,MAAM,YAAY5pJ,SAASwxN,WAAWpnH,OAAO2mE,iBAAiB,mBAAmBnnB,EAAAA,CAAG6nE,MAAAA,IAAU7nE,UAAU9qJ,EAAAA,aAAeF,KAAKm8K,EAAAA,OAASh0F,EAAE8jB,KAAKzlB,OAAOxmF,IAAAA,OAAWozE,EAAE29I,EAAAA,CAAGvoB,MAAMvuF,EAAEs3G,SAASp1C,EAAEt+E,MAAMmtD,GAAGhrJ,EAAEm8K,EAAEn8K,GAAGmoF,OAAO/U,EAAAA,SAAWi9I,EAAEj9I,KAAKA,EAAAA,CAAGA,QAAQsF,EAAE,SAAS14E,GAAGm8K,EAAEn8K,GAAGy2L,IAAI/9G,GAAG,OAAOyP,IAAIzP,EAAEyP,EAAEsuG,KAAK/9G,GAAG,kBAAkByP,IAAIzP,EAAE14E,aAAay2L,GAAGzrC,EAAE+tB,MAAM/4K,KAAKozE,EAAEy+I,EAAE5lH,KAAKu8F,MAAMtoM,EAAE8qJ,GAAGtyE,GAAG,OAAO14E,MAAMgrJ,EAAAA,IAAAA,MAAYhrJ,KAAKgrJ,EAAAA,OAAS/wC,EAAE,YAAYj6G,EAAE,OAAOA,KAAK,SAASi6G,GAAG,SAASA,EAAAA,eAAiB9xB,EAAE6iE,EAAEhrJ,GAAG85G,EAAE3xB,IAAI0pI,EAAE5lH,KAAKu8F,MAAMtoM,EAAE+5G,EAAE9xB,EAAAA,CAAGopI,SAASp1C,YAAY18K,OAAOW,KAAKF,GAAGm2E,KAAK20E,GAAAA,EAAAA,EAAAA,EAAAA,SAAAA,CAAQyrC,GAAGzrC,GAAG9qJ,EAAE8qJ,aAAa8nE,EAAAA,CAAG1tD,QAAQ,YAAY6pD,EAAE,CAACjkE,EAAEhrJ,EAAAA,YAAci6G,EAAEx6G,OAAOiqG,OAAAA,GAAUopH,EAAE9yN,GAAGgrJ,EAAE4uC,MAAAA,CAAO5uC,IAAAA,CAAKqpC,gBAAgBr0L,EAAAA,EAAAA,yBAAUA,GAAG+yE,QAAQi4E,EAAEoa,WAAWplK,EAAE+yE,MAAAA,aAAmBknC,EAAEj6G,EAAE+yE,KAAKi4E,EAAEoa,SAAStrD,EAAEG,GAAGk1G,EAAAA,EAAAA,SAAIl1G,IAAIk1G,EAAEl1G,MAAtH2/E,CAA6H3/E,2GCN1uSk2G,2EAEFA,EAAS3wN,EAAQ,oBACb2wN,EAAOlwN,aAAYkwN,EAASA,EAAO/wN,SACvC+wN,EAAOtuN,OAASrC,EAAQ,sBAAsBqC,OAE9CrC,EAAQ,oBAAoBJ,QAAQ+wN,GACpCA,EAAOnqC,UAAY,gBACnBmqC,EAAO1mB,OAAS,oBAIH0mB,oPAPS,uBAGtB4C,SAAA,MAEI7L,MAAO,oBACPj+C,YAAa,4fAXL+pD,GAAAC,EAAAn5C,YACeo5C,IAQxB,4LAPU/C,gGCFXA,2EAEFA,EAAS3wN,EAAQ,qBACb2wN,EAAOlwN,aAAYkwN,EAASA,EAAO/wN,SACvC+wN,EAAOtuN,OAASrC,EAAQ,uBAAuBqC,OAE/CrC,EAAQ,qBAAqBJ,QAAQ+wN,GACrCA,EAAOnqC,UAAY,gBACnBmqC,EAAO1mB,OAAS,qBAIH0mB,kjBAZRgD,EAAA,CAAAz0B,MAAM,WACT00B,EAAAH,EAAAn5C,YAAuD,KAAA,CAAnD4kB,MAAM,SAAQ,oCAAgC,GAClD20B,EAAAJ,EAAAn5C,YAOI,IAAA,KAAA,CAAAm5C,EAAA53B,gBAPD,8CAAA43B,EAAAn5C,YAIA,IAAA,CAFEyoC,KAAK,6CACL,2BAAA0Q,EAAA53B,gBACF,kGAIAi4B,EAAAL,EAAA53B,gBAAA,qEAGEk4B,EAAAN,EAAA53B,gBAAA,qBACFm4B,EAAAP,EAAA53B,gBAAA,QAGEo4B,EAAAR,EAAA53B,gBAAA,oBACFq4B,EAAAT,EAAA53B,gBAAA,MAEEs4B,EAAAV,EAAA53B,gBAAA,kBACFu4B,EAAAX,EAAA53B,gBAAA,UAEDw4B,EAAAZ,EAAAn5C,YAGC,IAAA,CAFCyoC,KAAK,oFACJ,gBAAY,GACduR,EAAAb,EAAA53B,gBAAA,MAEE04B,EAAAd,EAAA53B,gBAAA,kBACF24B,EAAAf,EAAA53B,gBAAA,aACD44B,EAAAhB,EAAAn5C,YAAsE,IAAA,CAAnEyoC,KAAK,iDAAgD,cAAU,GAAI2R,EAAAjB,EAAA53B,gBAAA,YAInE84B,EAAAlB,EAAA53B,gBAAA,KACF+4B,EAAAnB,EAAA53B,gBAAA,MAGEg5B,EAAApB,EAAA53B,gBAAA,KACFi5B,EAAArB,EAAA53B,gBAAA,MAGEk5B,EAAAtB,EAAA53B,gBAAA,KACFm5B,EAAAvB,EAAA53B,gBAAA,MAGAo5B,EAAA,CAAA/1B,MAAM,wuFADL,MA7CNy0B,EAAA,CACEC,EACAC,EAAAJ,EAAAn5C,YA0CI,IAAA,KAAA,iBA9BD46C,EAAA,CAFYj+B,GAAG,yDACbr3L,QAAAu1N,GAAA,IAAA,4BAKFD,EAAA,CAFCj+B,GAAG,mIACFr3L,QAAAu1N,GAAA,IAAA,4BAIFD,EAAA,CAFYj+B,GAAG,yDACbr3L,QAAAu1N,GAAA,IAAA,cAGHd,kBAMCa,EAAA,CAFYj+B,GAAG,yDACbr3L,QAAAu1N,GAAA,IAAA,cAEHV,kBAKCS,EAAA,CAFCj+B,GAAG,mFACFr3L,QAAAu1N,GAAA,IAAA,4BAKFD,EAAA,CAFCj+B,GAAG,oFACFr3L,QAAAu1N,GAAA,IAAA,4BAKFD,EAAA,CAFCj+B,GAAG,2FACFr3L,QAAAu1N,GAAA,IAAA,gCAMD,MAFNF,EAAA,CAAAxB,EAAAn5C,YACe86C,KAEfC,GAqDG,0LApGU1E,gGCFXA,2EAEFA,EAAS3wN,EAAQ,0BACb2wN,EAAOlwN,aAAYkwN,EAASA,EAAO/wN,SACvC+wN,EAAOtuN,OAASrC,EAAQ,4BAA4BqC,OAEpDrC,EAAQ,0BAA0BJ,QAAQ+wN,GAC1CA,EAAOnqC,UAAY,gBACnBmqC,EAAO1mB,OAAS,0BAIH0mB,8QACS,gBACC,oBAInB2E,GAAA,IAAYC,aAAcxlH,OAAO,SACrCylH,GAAA,IAAYD,aAAcxlH,OAAO,SACjC0lH,GAAA,IAAYF,aAAcxlH,OAAO,SACjC2lH,GAAA,IAAaH,aAAcxlH,OAAO,UAClC4lH,GAAA,IAAeJ,aAAcxlH,OAAO,YACpC6lH,GAAA,IAAaL,aAAcxlH,OAAO,QAClC8lH,EAAA,CAAiB,GAAM,IAAM,IAC7BC,EAAA,CAAiB,IAAM,EAAM,IAE/B,SAAAC,EAAyBC,EAAaxkJ,EAAQ2nF,UACrC68D,EAAYx8G,OAAM,SAAUr5G,EAAO6xE,UACjC7xE,IAAUg5J,EAAK3nF,EAASQ,MAGnC,SAAAikJ,EAA6B5+G,EAAQ6+G,OAC/BC,EAAaD,EAASj+I,QAAQo/B,EAAO,UAEnC0+G,EAAgB1+G,EAAQ8+G,EAAYD,UAC/B,EAETC,EAAaD,EAASj+I,QAAQo/B,EAAO,GAAI8+G,EAAa,SAC/CA,EAAa,UACf,EAET,SAAAC,EAA8BC,EAASH,WAC5BI,KAAeD,KAClBJ,EAAoBI,EAAQC,GAAcJ,UACrCI,EAMb,SAAAC,EAAsBC,OAGhBp9C,EAAY,aACdq9C,EAAS,SACLC,EAAA,CAAA,CACD,YAAa,EAAA,CAAI,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,GAAM,KAAA,CAC3D,YAAa,EAAA,CAAI,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,MAAA,CAC3D,YAAa,EAAA,CAAI,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,KAAA,CAC3D,aAAc,EAAA,CAAI,GAAM,GAAM,IAAM,OAEvCC,EAAaH,EAAK3kJ,MAAM,EAAG,eAElBkY,KAAS2sI,EAAA,OACZp3N,EAAOyqF,EAAM,GACjB6sI,EAAmB7sI,EAAM,MAEvBgsI,EADWhsI,EAAM,GACW6sI,EAAkBD,GAAA,CAChDv9C,EAAY95K,YAMC,cAAb85K,EAAa,OAMby9C,EAAA,CACEC,KAAMpB,EACNqB,OAAQpB,GAGZc,EAAA,CACEL,EAXI,CACFY,IAAK1B,EACL2B,IAAKzB,EACL0B,IAAKzB,GAQ6BkB,GACpCP,EAAqBS,EAAeF,IAEnCn8I,QAAQ5G,QAAYzxE,IAANyxE,IACdmD,KAAK,cACc,aAAbqiG,EAAa,OAKpBy9C,EAAA,CACEM,YAAavB,GAEjBa,EAAA,CACEL,EARI,CACFgB,cAAevB,EACfwB,cAAevB,GAMmBa,GACpCP,EAAqBS,EAAeF,IAEnCn8I,QAAQ5G,QAAYzxE,IAANyxE,IACdmD,KAAK,aAGN0/I,EAAO/kJ,OAAS,KACR0nG,cAAsBq9C,QAExBr9C,IAmEZ,SAAAk+C,EAAqB3Y,WACWx8M,IAA1Bw8M,EAAM37H,OAAOu0I,SAAa,OACtBC,EAAa7Y,EAAM37H,OAAOu0I,SAAS5Y,EAAM37H,OAAOu0I,SAAS7lJ,OAAS,UAEtEg2I,MAAO8P,EACP/tD,YAAA,8BAA2C+tD,aAI7C9P,MAAO,kCACPj+C,YAAa,8CAKfkjB,OAAA,CAAS,QACTrpL,cACQq7M,EAAA8Y,EAAAhJ,qBACE6I,EAAY3Y,KAEtBxlD,KAAA,IACOntD,OAAO0rH,aAOVtP,OAAQ,oBALNA,OAAQ,+DAQdhsC,QAAS,WACP3vE,KAAKkrH,aAEPt/H,SAAA,CACEqvH,MAAO,kBACE4P,EAAY7qH,KAAKmrH,QAAQlQ,OAElC6P,SAAU,uBAC4Bp1N,IAAhCsqG,KAAKmrH,OAAO50I,OAAOu0I,SACd9qH,KAAKmrH,OAAO50I,OAAOu0I,SAASxgJ,KAAK,KAEnC,KAGXg2G,MAAA,CACEzpL,SAASu0N,EAASC,QACA31N,IAAZ01N,GAAyBA,EAAQnmJ,QACnC+6B,KAAKkrH,cAIXljC,QAAA,yBAEUp1L,EAAYotG,eAEVsrH,QAAatrH,KAAKurH,MACtBT,EAAW9qH,KAAK8qH,uBAEVU,EAAAC,QAAcA,SAAkBH,EAAKrnI,KAC7C+b,KAAK27G,OAAS,UAEd+P,cAAgB1rH,KAAKg7F,MAAM,UACvB2wB,QA/HZr4E,eAA4Bg4E,EAAM34N,EAAMikL,OAClC+0C,EAAA,IAAkBV,YAwCtB,SAAAW,EAA6BC,UACpBv4E,eAAAw4E,EAA0BC,OAC3BC,EAAeD,EAAG3gD,OACpB37D,QAAco8G,EAAsBzuI,UAClCqyB,EAAMq6D,KACRkiD,EAAa3kD,oBAAoB,YAAaykD,GAC9CH,EAAYM,uBAGVD,EAAaE,aAAaz8G,EAAM/7G,aACzB6zE,GAEPmzB,QAAQnrB,MAAM,iCAAkChI,GAChDqvG,EAAA,mCAAgDrvG,OAChDykJ,EAAa3kD,oBAAoB,YAAaykD,YApDtDH,EAAYzlD,iBAAiB,cAE7B5yB,qCAEqBxyC,KAAQwqH,EAAK9pI,IAAI7uF,GAAA,IACf,OAAbmuG,EAAKh6B,iBACP8vG,EAAa,6BAA8B,UAGxC91E,EAAK/5B,oBACR6vG,EAAa,2CAGXszC,QAAmBppH,EAAK/5B,QAAQqW,OAChC+uI,EAAYrC,EAAaI,EAAWx2N,OACtCs4N,EAAeL,EAAYS,gBAAgBD,MAE7CzxH,QAAQ2xH,IAAI,wBAAyBF,IAChClB,YAAYqB,gBAAgBH,eAC/Bv1C,EAAa,iCAAmCu1C,GAGlDH,EAAa9lD,iBAAiB,SAAS,SAAU6lD,GAC/Cn1C,EAAam1C,MAEfC,EAAa9lD,iBAAiB,SAAS,SAAU6lD,GAC/Cn1C,EAAam1C,MAEfC,EAAa9lD,iBACX,YACA0lD,EAAoB9qH,EAAK/5B,UAE3BilJ,EAAaE,aAAahC,EAAWx2N,cAEhC+lG,GACPm9E,EAAan9E,OAuBVkyH,EAkEuBY,CACtBjB,EACAR,GACA,SAAsBr7I,EAAK+8I,GACzB55N,EAAU+oN,OAAA,gCAAyClsI,SACnC/5E,IAAZ82N,GACF55N,EAAU2uN,QAAQz2I,KAAA,IAAS0hJ,KAAW1B,aAIxBp1N,IAAhBi2N,IACFD,cAAczvH,IAAMsD,OAAOktH,IAAIC,gBAAgBf,GAC/CA,EAAYzlD,iBAAiB,eAAe,WAC1CtzK,EAAU+oN,OAAS,wBAErBgQ,EAAYzlD,iBAAiB,eAAe,WAC1CtzK,EAAU+oN,OAAS,yBAErBgQ,EAAYzlD,iBAAiB,cAAc,WACzCumD,IAAIE,gBAAgBjB,cAAczvH,eAG/BxC,GAEPuG,KAAK27G,OAAA,UAAmBliH,8VAzQzBytH,EAAA,CAAAz0B,MAAM,SACL00B,EAAA,CAAA10B,MAAM,YACH7N,IAAI,QAAQgoC,SAAA,GAASC,MAAA,GAAMC,SAAA,IAC/BzF,EAAA,CAAA50B,MAAM,kBAIN60B,EAAA,CAAA70B,MAAM,qJADL,MANNy0B,EAAA,CAAAF,EAAAn5C,YACoC,KAAlCs5C,EAAAH,EAAAx6I,gBAAqBkgH,EAAKuuB,OAAA,GAAA+L,EAAAn5C,YACmB,QAA7Cu5C,EAA6C,KAAA,KAAAJ,EAAAn5C,YAGzC,IAFJw5C,EAAA,CAAAL,EAAAn5C,YAC6B,QAAjB,KAAAm5C,EAAAx6I,gBAAAkgH,EAAMivB,QAAA,OAAAqL,EAAAn5C,YAKd,MAFNy5C,EAAA,CAAAN,EAAAn5C,YACe86C,MAqBZ,4LA3BUzE,gGCFXA,2EAEFA,EAAS3wN,EAAQ,yBACb2wN,EAAOlwN,aAAYkwN,EAASA,EAAO/wN,SACvC+wN,EAAOtuN,OAASrC,EAAQ,2BAA2BqC,OAEnDrC,EAAQ,yBAAyBJ,QAAQ+wN,GACzCA,EAAOnqC,UAAY,gBACnBmqC,EAAO1mB,OAAS,yBAIH0mB,8QAqCbrtN,WACMi0N,EAAW,eACqBp1N,IAAhCsqG,KAAKmrH,OAAO50I,OAAOu0I,WACrBA,EAAW9qH,KAAKmrH,OAAO50I,OAAOu0I,SAASxgJ,KAAK,OAG5CwgJ,SAAUA,IAGdl/H,SAAA,CACE/0F,gCAEsBnB,IAAlBsqG,KAAK8qH,UAA0B9qH,KAAK8qH,SAAS7lJ,OAf9B,KAmBrB+iH,QAAA,CACEnxL,UACEmpG,KAAKuhH,QAAQz2I,KAAA,SAAck1B,KAAK8qH,aAElCj0N,aACEmpG,KAAKuhH,QAAQz2I,KAAA,OAAYk1B,KAAK8qH,2TAtE7B5D,EAAA,CAAAz0B,MAAM,WACJ00B,EAAA,CAAA10B,MAAM,UACJ20B,EAAA,CAAA30B,MAAM,SACT40B,EAAAL,EAAAn5C,YAAsC,QAAA,CAA/B4kB,MAAM,SAAQ,aAAS,GACzB60B,EAAA,CAAA70B,MAAM,WAUR80B,EAAA,CAAA90B,MAAM,QAAO+0B,EAAAR,EAAA53B,gBAAA,4CAEMq4B,EAAAT,EAAA53B,gBAAA,6BAAuCs4B,EAAAV,EAAA53B,gBAAA,MAG1Du4B,EAAA,CAAAl1B,MAAM,oBACJm1B,EAAA,CAAAn1B,MAAM,WAUNo1B,EAAA,CAAAp1B,MAAM,0HAYX,MA1CNy0B,EAAA,CAAAF,EAAAn5C,YAyCQ,MAxCNs5C,EAAA,CAAAH,EAAAn5C,YAiBQ,MAhBNu5C,EAAA,CACEC,EAAAL,EAAAn5C,YAUM,MATNy5C,EAAA,CAAAN,EAAA3lB,eAAA2lB,EAAAn5C,YAQI,QAAA,CANA9yC,YAAY,mBACZ03D,MAAA,CAAM,gBAAA,CAEuBs6B,YAAArgC,EAAiBsgC,oBAD9CC,UAAU,KAEVnmJ,KAAK,OACSomJ,sBAAAC,EAAA,KAAAA,EAAA,GAAAC,GAAA1gC,EAAQo+B,SAAAsC,2BAAR1gC,EAAQo+B,cAAA,GAAtBtzI,MAAA,sBAMA,IAHJ+vI,EAAA,iBAE6DkB,EAAA,CAA9Cj+B,GAAG,MAAIr3L,QAAAu1N,GAAA,IAAA,gCAwBlB,MArBNf,EAAA,CAAAX,EAAAn5C,YAUQ,MATN+5C,EAAA,CAAAZ,EAAAn5C,YAQW,SAAA,CANN0hB,QAAO49B,EAAA,KAAAA,EAAA,GAAA,IAAA/2I,IAAAs2G,EAAO2gC,SAAA3gC,EAAA2gC,WAAAj3I,IACfq8G,MAAM,SACNwoB,MAAM,+BACCrjB,SAAUlL,EAAiBsgC,mBACnC,sBAED,EAAA,CAAA,eAAAhG,EAAAn5C,YAWI,MATNg6C,EAAA,CAAAb,EAAAn5C,YAQW,SAAA,CANN0hB,QAAO49B,EAAA,KAAAA,EAAA,GAAA,IAAA/2I,IAAAs2G,EAAU4gC,YAAA5gC,EAAA4gC,cAAAl3I,IAClBq8G,MAAM,SACNwoB,MAAM,+BACCrjB,SAAUlL,EAAiBsgC,mBACnC,wBAED,EAAA,CAAA,6MApCK9I,gGCFXA,2EAEFA,EAAS3wN,EAAQ,iCACb2wN,EAAOlwN,aAAYkwN,EAASA,EAAO/wN,SACvC+wN,EAAOtuN,OAASrC,EAAQ,mCAAmCqC,OAE3DrC,EAAQ,iCAAiCJ,QAAQ+wN,GACjDA,EAAOnqC,UAAY,gBACnBmqC,EAAO1mB,OAAS,iCAIH0mB,iSAES,gBACC,cAEzB,SAAA2G,EAAqB3Y,WACWx8M,IAA1Bw8M,EAAM37H,OAAOu0I,SAAa,OACtBC,EAAa7Y,EAAM37H,OAAOu0I,SAAS5Y,EAAM37H,OAAOu0I,SAAS7lJ,OAAS,UAEtEg2I,MAAO8P,EACP/tD,YAAA,8BAA2C+tD,oCAI7C9P,MAAO,qBACPj+C,YAAa,0DAKfnmK,cACQq7M,EAAA8Y,EAAAhJ,qBACE6I,EAAY3Y,KAGtBtmH,SAAA,CACEqvH,MAAO,kBACE4P,EAAY7qH,KAAKmrH,QAAQlQ,OAElCsS,oBAAqB,mBACiB73N,IAAhCsqG,KAAKmrH,OAAO50I,OAAOu0I,SAAa,qCACjB9qH,KAAKmrH,OAAO50I,OAAOu0I,SAASxgJ,KAAK,aAG7C,IAETkjJ,WAAY,mBAC0B93N,IAAhCsqG,KAAKmrH,OAAO50I,OAAOu0I,SAAa,+BACjB9qH,KAAKmrH,OAAO50I,OAAOu0I,SAASxgJ,KAAK,aAG7C,4VArDN48I,EAAA,CAAAz0B,MAAM,SACL00B,EAAA,CAAA10B,MAAM,SAEP20B,EAAAJ,EAAA53B,gBAAA,iBACqDi4B,EAAAL,EAAA53B,gBAAA,QACek4B,EAAAN,EAAA53B,gBAAA,MAGpEm4B,EAAA,CAAA90B,MAAM,qJADL,MAPNy0B,EAAA,CAAAF,EAAAn5C,YACoC,KAAlCs5C,EAAAH,EAAAx6I,gBAAqBkgH,EAAKuuB,OAAA,GAAA+L,EAAAn5C,YAC2C,QAAA,CAA9D+W,IAAI,QAAe3oF,IAAKywF,EAAU8gC,WAAEZ,SAAA,GAASC,MAAA,GAAMC,SAAA,kCAItD,IAAA,KAAA,iBAFoD,IAAA,CAAhCxW,KAAM5pB,EAAU8gC,YAAE,aAAU,EAAA,CAAA,yBACmB,IAAA,CAA3DlX,KAAM5pB,EAAmB6gC,oBAAEniD,OAAO,UAAS,eAAY,EAAA,CAAA,6BAK/D,MAFNm8C,EAAA,CAAAP,EAAAn5C,YACe86C,MA6BZ,4LApCUzE,gGCFXA,2EAEFA,EAAS3wN,EAAQ,uBACb2wN,EAAOlwN,aAAYkwN,EAASA,EAAO/wN,SACvC+wN,EAAOtuN,OAASrC,EAAQ,yBAAyBqC,OAEjDrC,EAAQ,uBAAuBJ,QAAQ+wN,GACvCA,EAAOnqC,UAAY,gBACnBmqC,EAAO1mB,OAAS,uBAIH0mB,wQAiCbhkC,OAAA,CAAS,QACTxzB,KAAA,MAEIivD,OAAQ,kBACRz+G,QAAA,KAGJyyE,QAAS,WACP3vE,KAAKytH,gBAEP7hI,SAAA,CACEk/H,SAAU,uBAC4Bp1N,IAAhCsqG,KAAKmrH,OAAO50I,OAAOu0I,SACd9qH,KAAKmrH,OAAO50I,OAAOu0I,SAASxgJ,KAAK,KAEnC,IAET2wI,MAAO,eACD8P,EAAa,2BACmBr1N,IAAhCsqG,KAAKmrH,OAAO50I,OAAOu0I,WACrBC,EACE/qH,KAAKmrH,OAAO50I,OAAOu0I,SAAS9qH,KAAKmrH,OAAO50I,OAAOu0I,SAAS7lJ,OAAS,GACnE9vE,SAAS8lN,MAAQ8P,EAAa,mBAEzBA,IAGX/iC,QAAA,gCAIYsjC,QAAatrH,KAAKurH,MACtBT,EAAW9qH,KAAK8qH,SAElB9qH,KAAK27G,OAAS,eAAiBmP,kBACdr7G,KAAS67G,EAAKoC,GAAG5C,GAChC9qH,KAAK9C,QAAQpyB,KA7CjB,CACFn4E,MAF0B66J,EA8CmB/9C,GA5CjC98G,KACZg7N,IAAKngE,EAAMmgE,IAAIhyH,OACf9oG,KAAM26J,EAAM36J,KACZoqG,KAAMuwD,EAAMvwD,OA2CR+C,KAAK27G,OAAS,SACPliH,GAEPuG,KAAK27G,OAAA,UAAmBliH,IAnDhC,IAA8B+zD,iTAnCvB05D,EAAA,CAAAz0B,MAAM,SACL00B,EAAA,CAAA10B,MAAM,SACV20B,EAAAJ,EAAAn5C,YAAsC,KAAA,CAAlC4kB,MAAM,YAAW,gBAAY,GAC1B40B,EAAA,CAAA50B,MAAM,SACX60B,EAAAN,EAAAn5C,YAMQ,QAAA,KAAA,CAAAm5C,EAAAn5C,YADD,KAAA,KAAA,CAAAm5C,EAAAn5C,YAHU,KAAT,KAAA,QAAAm5C,EAAAn5C,YACS,KAAT,KAAA,QAAAm5C,EAAAn5C,YACgD,KAAA,KAAA,CAAAm5C,EAAAn5C,YAAL,OAAA,CAArCotC,MAAM,sBAAqB,gBAiBxCsM,EAAA,CAAA90B,MAAM,kBAIN+0B,EAAA,CAAA/0B,MAAM,yLADL,MA5BNy0B,EAAA,CAAAF,EAAAn5C,YACoC,KAAlCs5C,EAAAH,EAAAx6I,gBAAqBkgH,EAAKuuB,OAAA,GAC1BmM,EAAAJ,EAAAn5C,YAsBQ,QArBRw5C,EAAA,CACEC,EAAAN,EAAAn5C,YAmBQ,QAAA,KAAA,EAAAm5C,EAAAxnC,WAXN,GAAAwnC,EAAA9tB,YAAA8tB,EAAAx5C,SAAoB,KAAAw5C,EAAA7mB,WAAAzT,EAAOxvF,SAAhB64E,gCAUN,KAAA,CAV+B/gL,IAAK+gL,EAAM43C,oBAKxC,KAAA,KAAA,CAAA3G,EAAAn5C,YADa46C,EAAA,CAFIj+B,GAAe,SAAAzU,EAAMpjL,OAAMQ,QAAAu1N,GAAA,IAAA,CAAA1B,EAAA53B,gBAAA43B,EAAAx6I,gBAC7CupG,EAAMljL,MAAI,wCAGW,KAAlB,KAAAm0N,EAAAx6I,gBAAAupG,EAAM94E,MAAI,GAAA+pH,EAAAn5C,YAGZ,KAAA,KAAA,CAAAm5C,EAAAn5C,YADyB,OAAnB,KAAAm5C,EAAAx6I,gBAAAupG,EAAM43C,KAAG,kCAOtB,IAFJpG,EAAA,CAAAP,EAAAn5C,YAC6B,QAAjB,KAAAm5C,EAAAx6I,gBAAAkgH,EAAMivB,QAAA,OAAAqL,EAAAn5C,YAKd,MAFN25C,EAAA,CAAAR,EAAAn5C,YACe86C,MA8BZ,4LA1DUzE,gGCFXA,2EAEFA,EAAS3wN,EAAQ,yBACb2wN,EAAOlwN,aAAYkwN,EAASA,EAAO/wN,SACvC+wN,EAAOtuN,OAASrC,EAAQ,2BAA2BqC,OAEnDrC,EAAQ,yBAAyBJ,QAAQ+wN,GACzCA,EAAOnqC,UAAY,gBACnBmqC,EAAO1mB,OAAS,yBAIH0mB,8QAJb4C,SAAA,CACK7L,MAAO,YACPj+C,YAAa,iUAVbkqD,EAAA,CAAAz0B,MAAM,SACT00B,EAAAH,EAAAn5C,YAAgC,KAAA,CAA5B4kB,MAAM,SAAQ,aAAS,GACJ20B,EAAAJ,EAAA53B,gBAAA,0HACnB,MAHN83B,EAAA,CACEC,EAAAH,EAAAn5C,YACgD,IAAA,KAAA,CAAAm5C,EAAAn5C,YAAJ46C,EAAA,CAA5Bj+B,GAAG,MAAIr3L,QAAAu1N,GAAA,IAAA,CAcjBtB,KAEFjsI,EAAG,gMAhBI+oI,qLCHE,oCAEX/oF,EAAAA,CACJuyD,QAAS,CAAC16L,EAAK2B,EAAAA,MACb3B,EAAIunF,OAAOwyG,iBAAiBw+B,MAAAA,EAAAA,QAAar3N,OAAOS,GAEhD3B,EAAI8sL,QAAQ,OAAQnrL,KAKF,oBAAX4qG,QAA0BA,OAAOquH,KAC1CruH,OAAOquH,IAAI36N,IAAIkoI,aAGFA,qGCff,aAMA9nI,EAAAC,QAAA,IAAAC,EAAA,+DCNA,aAEA,MAAAs6N,EAAAt6N,EAAA,oCACAu6N,EAAAv6N,EAAA,mCACAw6N,EAAAx6N,EAAA,WACAy6N,EAAAz6N,EAAA,iBACA06N,EAAA16N,EAAA,YACA26N,UAAAA,GAAA36N,EAAA,aACA46N,EAAA56N,EAAA,aACA66N,EAAA76N,EAAA,cACA86N,EAAA96N,EAAA,sBACA+6N,EAAAD,EAAAC,UACAC,EAAAh7N,EAAA,SACAW,OAAAA,GAAAX,EAAA,gBAOAF,EAAAC,QAAA,CACAY,OAAAA,EACA85N,OAAAA,EACAC,OAAAA,EACAM,IAAAA,EACAL,UAAAA,EACAC,UAAAA,EACAG,UAAAA,EACAD,aAAAA,EACAD,WAAAA,EACAL,OAAAA,EACAF,WAAAA,EACAC,UAAAA,wUChCA,aAEA,MAAAU,EAAAj7N,EAAA,WAqBA+/I,eAAAm7E,EAAA7oH,EAAAjxG,GACA,MAAA+5N,EAAA,IAAAF,EACAG,QAAAD,EAAAltI,IAAAokB,EAAAjxG,SAEAg6N,EAAAlkE,WAGAp3J,EAAAC,QApBA,CAAAsyG,EAAAjxG,KACA,CACAhC,KAAAohN,mBAAA,IAAA0Y,IAAA7mH,GAAAwjG,SAAAtpH,MAAA,KAAA7B,OAAA,IACAlX,QAAA0nJ,EAAA7oH,EAAAjxG,oDCZA,aAEA,MAAAi6N,MAAAA,EAAAC,QAAAA,EAAAC,QAAAA,GAAAv7N,EAAA,iBACAw7N,aAAAA,EAAAC,UAAAA,GAAAz7N,EAAA,gBACA07N,EAAA17N,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,KACAzC,IAAAA,EAAA0C,gBAAAA,GAAA57N,EAAA,YACA67N,gBAAAA,GAAA77N,EAAA,2BACA87N,EAAA97N,EAAA,cA6DAk/M,EAAA,CACA6c,iBAAA,EACAC,YAAA,eAGA,MAAAf,EAKA33N,YAAAlC,EAAA,IAEAqrG,KAAA+gE,KAAAkuD,EAAAxc,EAAA99M,GAUAkC,YAAA24N,EAAA76N,EAAA,IAEA,MAAAosK,EAAAkuD,EAAAjvH,KAAA+gE,KAAApsK,GACA86N,EAAA,IAAAX,EAAA/tD,EAAA0uD,SAGA,GAAA,iBAAAD,KAAAA,aAAA/C,GAAA+C,aAAAX,GACA,MAAA,IAAA9pH,UAAA,gDAGA,MAAAa,EAAA,IAAA6mH,EAAA+C,EAAApxH,WAAA2iE,EAAA3gC,OAEA4zE,aACAA,EAAA0b,sBACAA,EAAAC,KACAA,GACA5uD,EAEAizC,IAGApuG,EAAAqG,OAFA,mBAAAyjH,EAEAA,EAAA,IAAAP,EAAApuD,EAAAizC,eAGA,IAAAmb,EAAApuD,EAAAizC,eAIA2b,IACA5uD,EAAA96F,KAAA4B,KAAAC,UAAAi5F,EAAA4uD,MACAF,EAAAhuI,IAAA,eAAA,qBAGA,MAAAmuI,EAAA,IAAAR,EAEAS,EAAAR,EAAA,CAAAO,EAAAC,OAAA9uD,EAAA8uD,SAEAlB,OAzGA,EAAAtZ,EAAAya,EAAAF,KACA,QAAAl6N,IAAAo6N,EACA,OAAAza,EAGA,MAAArgI,EAAA+oB,KAAAunE,MAEAyqD,EAAA,IACAhyH,KAAAunE,MAAAtwF,GAEA86I,EAGA,OAAA,IAAA/pD,SAAA,CAAAC,EAAAu5B,KACA,MAAAywB,EAAAnlD,YAAA,KACAklD,MACAxwB,EAAA,IAAAwvB,GACAa,EAAA58E,WAEA88E,GAKAt3E,EAAAp7D,GAIArR,IACAkkJ,aAAAD,GAEAD,IACAxwB,EAAA,IAAAwvB,GAIA3xI,EAAArR,IAKAspI,EACAp3G,KAAAu6C,EAAAwtB,GAAAxtB,EAAA+mD,QA+DAz0B,CACA8jD,EACAhpH,EAAAxH,WACA,IACA2iE,EACA8uD,OAAAA,EACA/kD,aAAAp1K,EACA+5N,QAAAA,IAGA1uD,EAAA+J,QACA8kD,GAGA,IAAAjB,EAAAuB,IAAAnvD,EAAAuuD,gBAIA,MAHAvuD,EAAAuV,mBACAvV,EAAAuV,YAAAq4C,GAEA,IAAAK,EAAAL,GAiBA,OAdAA,EAAAlkE,SAAA,WACA,OAAA0lE,EAAAxB,EAAA1oJ,OAGA0oJ,EAAAyB,OAAA98E,kBACA,UAAA,MAAA7jC,KAAA2gH,EAAAzB,EAAAlkE,YACA91J,EAAAwvF,gBACAxvF,EAAAwvF,UAAAsrB,SAEAA,GAKAk/G,EAOA93N,KAAA24N,EAAA76N,EAAA,IACA,OAAAqrG,KAAA4uH,MAAAY,EAAA,IAAA76N,EAAAyoI,OAAA,SAOAvmI,IAAA24N,EAAA76N,EAAA,IACA,OAAAqrG,KAAA4uH,MAAAY,EAAA,IAAA76N,EAAAyoI,OAAA,QAOAvmI,IAAA24N,EAAA76N,EAAA,IACA,OAAAqrG,KAAA4uH,MAAAY,EAAA,IAAA76N,EAAAyoI,OAAA,QAOAvmI,OAAA24N,EAAA76N,EAAA,IACA,OAAAqrG,KAAA4uH,MAAAY,EAAA,IAAA76N,EAAAyoI,OAAA,WAOAvmI,QAAA24N,EAAA76N,EAAA,IACA,OAAAqrG,KAAA4uH,MAAAY,EAAA,IAAA76N,EAAAyoI,OAAA,aAUA,MAAAgzF,EAAA98E,gBAAAv+D,GACA,MAAAs7I,EAAA,IAAAC,YACA,IAAAC,EAAA,GAEA,UAAA,MAAA9gH,KAAA16B,EAAA,CACAw7I,GAAAF,EAAAjsH,OAAAqL,EAAA,CAAA+gH,QAAA,IACA,MAAA12H,EAAAy2H,EAAAzwI,MAAA,SAEA,IAAA,IAAA3Y,EAAA,EAAAA,EAAA2yB,EAAA70B,OAAA,EAAAkC,IAAA,CACA,MAAA4hB,EAAA+Q,EAAA3yB,GAAAqQ,OACAuR,EAAA9jB,OAAA,UACA4C,KAAAoH,MAAA8Z,IAGAwnI,EAAAz2H,EAAAA,EAAA70B,OAAA,GAEAsrJ,GAAAF,EAAAjsH,SACAmsH,EAAAA,EAAA/4I,OACA,IAAA+4I,EAAAtrJ,eACA4C,KAAAoH,MAAAshJ,KAWAJ,EAAAp7I,IAEA,GAAA07I,EAAA17I,GAAA,CACA,MAAA27I,EAAA37I,EAAA7+E,OAAAy6N,iBACA,MAAA,CACA95N,CAAAX,OAAAy6N,eAAA,KACA,CACAvzI,KAAAszI,EAAAtzI,KAAAub,KAAA+3H,GACAE,OAAAl9N,IACAqhF,EAAAu4H,UACA,mBAAAojB,EAAAE,OACAF,EAAAE,SAEA7qD,QAAAC,QAAA,CAAA8D,MAAA,EAAAp2K,MAAAA,QAOA,GAAAm9N,EAAA97I,GAAA,CACA,MAAA+7I,EAAA/7I,EAAAg8I,YACA,OAAA,kBACA,IACA,OAAA,CAEA,MAAAjnD,KAAAA,EAAAp2K,MAAAA,SAAAo9N,EAAAE,OAEA,GAAAlnD,EAAA,OAEAp2K,UACAA,IAGA,QACAo9N,EAAAG,eAbA,GAkBA,GAAAC,EAAAn8I,GACA,OAAAA,EAGA,MAAA,IAAAgwB,UAAA,6CAWAmsH,EAAAx9N,GACA,iBAAAA,GACA,OAAAA,GACA,mBAAA,EAAAwC,OAAAy6N,eAWAE,EAAAn9N,GACAA,GAAA,mBAAA,EAAAq9N,UAOAN,EAAA/8N,GACAF,OAAAmqG,UAAAnD,eAAAoD,KAAAlqG,EAAA,aACAF,OAAAmqG,UAAAnD,eAAAoD,KAAAlqG,EAAA,YAEA86N,EAAAQ,UAAAA,EACAR,EAAAO,aAAAA,EACAP,EAAA2C,sBAAAhB,EAMA3B,EAAA4C,KAAA,CAAA5B,EAAA76N,IAAA,IAAA65N,EAAA75N,GAAAy8N,KAAA5B,EAAA76N,GAMA65N,EAAAhtI,IAAA,CAAAguI,EAAA76N,IAAA,IAAA65N,EAAA75N,GAAA6sF,IAAAguI,EAAA76N,GAMA65N,EAAA6C,IAAA,CAAA7B,EAAA76N,IAAA,IAAA65N,EAAA75N,GAAA08N,IAAA7B,EAAA76N,GAMA65N,EAAA/qI,OAAA,CAAA+rI,EAAA76N,IAAA,IAAA65N,EAAA75N,GAAA8uF,OAAA+rI,EAAA76N,GAMA65N,EAAA75N,QAAA,CAAA66N,EAAA76N,IAAA,IAAA65N,EAAA75N,GAAAA,QAAA66N,EAAA76N,GAEAtB,EAAAC,QAAAk7N,8KCtWA,aAEA,MAAAO,aAAAA,EAAAuC,WAAAA,GAAA/9N,EAAA,YACAg+N,SAAAA,EAAA1C,QAAAA,EAAAC,QAAAA,EAAA37N,QAAAy7N,GAAAr7N,EAAA,YA2FAi+N,EAAA5C,EAiBA6C,EAAAziI,IACA,MAAAygI,EAAA,IAAAX,EACA,IAAA,MAAA75I,KAAA+Z,EAAAxX,OAAAsI,MAAA,WAAA,CACA,MAAAva,EAAA0P,EAAAzJ,QAAA,MACAjG,EAAA,GACAkqJ,EAAAhuI,IAAAxM,EAAA7P,MAAA,EAAAG,GAAA0P,EAAA7P,MAAAG,EAAA,IAIA,OAAAkqJ,GAGA,MAAAiC,UAAAH,EAMA16N,YAAA+uG,EAAA3/B,EAAAtxE,GACA4wH,MAAAt/C,EAAAtxE,GACAnB,OAAAC,eAAAusG,KAAA,MAAA,CAAAtsG,MAAAkyG,KAIAvyG,EAAAC,QAAA,CACAs7N,MApCA,CAAAhpH,EAAAjxG,EAAA,KACA,MAAAA,EAAAg9N,iBApFA,EAAA/rH,EAAAjxG,EAAA,MACA,MAAAi9N,EAAA,IAAAC,eACAD,EAAA7xI,KAAAprF,EAAAyoI,QAAA,MAAAx3B,EAAAxH,YAAA,GAEA,MAAA0sE,QAAAA,EAAA2kD,QAAAA,GAAA96N,EAUA,GARAm2K,GAAAA,EAAA,GAAAA,EAAAz+D,EAAAA,IACAulH,EAAA9mD,QAAAA,GAGA,MAAAn2K,EAAAm9N,kBACAF,EAAAE,iBAAAn9N,EAAAm9N,kBAGArC,EACA,IAAA,MAAA58N,EAAAa,KAAA,IAAAo7N,EAAAW,GACAmC,EAAAG,iBAAAl/N,EAAAa,GAmBA,OAfAiB,EAAAk7N,SACAl7N,EAAAk7N,OAAAmC,QAAA,IAAAJ,EAAA5+E,SAGAr+I,EAAAg9N,mBACAC,EAAAK,OAAAC,WAAAv9N,EAAAg9N,kBAQAC,EAAAO,aAAA,cAEA,IAAApsD,SAAA,CAAAC,EAAAu5B,KAIA,MAAA6yB,EAAAlpJ,IACA,OAAAA,EAAApC,MACA,IAAA,QACAk/F,EAAAurD,EAAAhiJ,SACA,MAEA,IAAA,OACAy2F,EACA,IAAA0rD,EAAAE,EAAAS,YAAAT,EAAAjD,SAAA,CACAhT,OAAAiW,EAAAjW,OACA2W,WAAAV,EAAAU,WACA7C,QAAAgC,EAAAG,EAAAW,4BAGA,MAEA,IAAA,UACAhzB,EAAA,IAAAwvB,GACA,MAEA,IAAA,QACAxvB,EAAA,IAAA+xB,KAQAM,EAAAY,QAAAJ,EACAR,EAAAa,OAAAL,EACAR,EAAAc,UAAAN,EACAR,EAAAI,QAAAI,EAEAR,EAAAe,KAAAh+N,EAAA,UAYAi+N,CAAAhtH,EAAAjxG,GACA68N,EAAA5rH,EAAAjxG,GAkCAk6N,QAAAA,EACAC,QAAAA,qEC1IA,aAEA,MAAAC,UAAAj2H,MACAjiG,YAAA8iF,EAAA,qBACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,gBAGAS,EAAAy7N,aAAAA,EAEA,MAAAuC,UAAAx4H,MACAjiG,YAAA8iF,EAAA,8BACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,cAGAS,EAAAg+N,WAAAA,EAEA,MAAAtC,UAAAl2H,MAIAjiG,YAAA83N,GACAppG,MAAAopG,EAAA2D,YACAtyH,KAAAntG,KAAA,YACAmtG,KAAA2uH,SAAAA,GAGAr7N,EAAA07N,UAAAA,gCC5BA,aAEA,MAAA6D,eAAAA,GAAAt/N,EAAA,SAGAF,EAAAC,QAAAC,EADAs/N,EACA,iBAGA,6GCRA,sCACMC,EAAav/N,EAAQ,eAErBw/N,EAAoC,iBAAXxzH,QAA2C,iBAAbpqG,UAA+C,IAAtBA,SAASN,SAEzFm+N,EAAcF,IACdG,EAAaF,IAAoBC,EACjCE,EAAmBF,IAAgBD,EACnCI,EAAuBH,GAAeD,EACtCK,EAA6B,mBAAZ7/N,QAA6C,IAAZu+L,QAAsD,IAApBA,EAAQuhC,SAAoD,SAAzBvhC,EAAQuhC,QAAQxgO,OAAoBmgO,EAE3JM,EAAwC,mBAAlBC,eAAgD,oBAATj0H,MAAqD,oBAAtBk0H,mBAAqCl0H,gBAAgBk0H,kBACjJC,OAA6B,IAAZ3hC,QAAkD,IAAhBA,EAAQ4hC,MAAQ,EACnEC,EAAuC,oBAAd/tD,WAAmD,gBAAtBA,UAAUguD,QAEtEvgO,EAAOC,QAAAA,CACLugO,OAAQJ,EACRX,WAAYE,EACZH,eAAgBK,EAChBY,mBAAoBX,EACpBY,OAAQX,EAIRnrB,UAAWgrB,EACXe,YAAaV,EACbW,aAAclB,EACdmB,cAAeP,wECnBbQ,EACAC,EARAtiC,EAAUz+L,EAAOC,QAAAA,GAUrB,SAAA+gO,cACcv7H,MAAM,mCAEpB,SAAAw7H,cACcx7H,MAAM,qCAsBpB,SAAAy7H,EAAoBC,MACZL,IAAqBtpD,kBAEdA,WAAW2pD,EAAK,OAGtBL,IAAqBE,IAAqBF,IAAqBtpD,kBAChEspD,EAAmBtpD,WACZA,WAAW2pD,EAAK,cAIhBL,EAAiBK,EAAK,SACzBzgO,cAGOogO,EAAiBv2H,KAAK,KAAM42H,EAAK,SACpCzgO,UAEGogO,EAAiBv2H,KAAKoC,KAAMw0H,EAAK,qBApCxCL,EADsB,mBAAftpD,WACYA,WAEAwpD,QAElBtgO,GACLogO,EAAmBE,MAIfD,EADwB,mBAAjBnE,aACcA,aAEAqE,QAEpBvgO,GACLqgO,EAAqBE,UAyDzBG,EAFAx9C,EAAAA,GACAy9C,GAAW,EAEXC,GAAc,EAElB,SAAAC,IACSF,GAAaD,IAGlBC,GAAW,EACPD,EAAaxvJ,OACbgyG,EAAQw9C,EAAa5iI,OAAOolF,GAE5B09C,GAAc,EAEd19C,EAAMhyG,QACN4vJ,KAIR,SAAAA,QACQH,OAGA5pD,EAAUypD,EAAWK,GACzBF,GAAW,UAEPtxH,EAAM6zE,EAAMhyG,OACVm+B,GAAAA,KACFqxH,EAAex9C,EACfA,EAAAA,KACS09C,EAAavxH,GACdqxH,GACAA,EAAaE,GAAYG,MAGjCH,GAAc,EACdvxH,EAAM6zE,EAAMhyG,OAEhBwvJ,EAAe,KACfC,GAAW,EAnEf,SAAyBK,MACjBX,IAAuBnE,oBAEhBA,aAAa8E,OAGnBX,IAAuBE,IAAwBF,IAAuBnE,oBACvEmE,EAAqBnE,aACdA,aAAa8E,OAIbX,EAAmBW,SACrBhhO,cAGMqgO,EAAmBx2H,KAAK,KAAMm3H,SAChChhO,UAGEqgO,EAAmBx2H,KAAKoC,KAAM+0H,KAgD7CC,CAAgBlqD,IAiBpB,SAAAmqD,EAAcT,EAAKU,GACfl1H,KAAKw0H,IAAMA,EACXx0H,KAAKk1H,MAAQA,EAYjB,SAAA9sB,KA5BAtW,EAAQla,SAAW,SAAU48C,OACrBp+I,EAAAA,IAAWynB,MAAMxnB,UAAUpR,OAAS,MACpCoR,UAAUpR,OAAS,UACVkC,EAAI,EAAGA,EAAIkP,UAAUpR,OAAQkC,IAClCiP,EAAKjP,EAAI,GAAKkP,UAAUlP,GAGhC8vG,EAAMnsG,KAAAA,IAASmqJ,EAAKT,EAAKp+I,IACJ,IAAjB6gG,EAAMhyG,QAAiByvJ,GACvBH,EAAWM,IASnBI,EAAKt3H,UAAUm3H,IAAM,WACjB90H,KAAKw0H,IAAIpxB,MAAM,KAAMpjG,KAAKk1H,QAE9BpjC,EAAQmpB,MAAQ,UAChBnpB,EAAQqjC,SAAAA,EACRrjC,EAAQ4hC,IAAAA,GACR5hC,EAAQsjC,KAAAA,GACRtjC,EAAQpuF,QAAU,GAClBouF,EAAQujC,SAAAA,GAIRvjC,EAAQ9jH,GAAKo6H,EACbtW,EAAQwjC,YAAcltB,EACtBtW,EAAQ80B,KAAOxe,EACftW,EAAQyjC,IAAMntB,EACdtW,EAAQ0jC,eAAiBptB,EACzBtW,EAAQ2jC,mBAAqBrtB,EAC7BtW,EAAQjZ,KAAOuvB,EACftW,EAAQ4jC,gBAAkBttB,EAC1BtW,EAAQ6jC,oBAAsBvtB,EAE9BtW,EAAQ2a,UAAY,SAAU55M,aAE9Bi/L,EAAQjiB,QAAU,SAAUh9K,aACdimG,MAAM,qCAGpBg5F,EAAQ8jC,IAAM,iBAAqB,KACnC9jC,EAAQ+jC,MAAQ,SAAU5oJ,aACZ6rB,MAAM,mCAEpBg5F,EAAQgkC,MAAQ,kBAAoB,oDCnKpCziO,EAAOC,QAnBP,iBAE0B,oBAAXisG,QAAoD,iBAAnBA,OAAOuyF,SAAgD,aAAxBvyF,OAAOuyF,QAAQhrH,cAKnE,IAAZgrH,GAAuD,iBAArBA,EAAQujC,WAA2BvjC,EAAQujC,SAASU,WAKxE,iBAAdnwD,WAAyD,iBAAxBA,UAAUC,WAA0BD,UAAUC,UAAUr6F,QAAQ,aAAe,iDCb/H,aAEA6zB,WAAAuvH,OAAAvvH,WAAAyvH,SAAAzvH,WAAAwvH,SAAAxvH,WAAAkyH,SACAl+N,EAAAC,QAAA,CACAH,QAAAksG,WAAAuvH,MACAE,QAAAzvH,WAAAyvH,QACAD,QAAAxvH,WAAAwvH,QACA0C,SAAAlyH,WAAAkyH,UAGAl+N,EAAAC,QAAA,CACAH,QAAAI,EAAA,cAAAJ,QACA27N,QAAAv7N,EAAA,cAAAu7N,QACAD,QAAAt7N,EAAA,cAAAs7N,QACA0C,SAAAh+N,EAAA,cAAAg+N,4DCdA,iBAaI/xH,EAVY,cAIK,oBAATF,YAA+BA,QACpB,oBAAXC,cAAiCA,eACtB,IAAXC,SAAiCA,YAClC1G,MAAM,kCAGJk9H,GAEb3iO,EAAOC,QAAUA,EAAUksG,EAAOovH,MAG9BpvH,EAAOovH,QACVt7N,EAAQH,QAAUqsG,EAAOovH,MAAMj2H,KAAK6G,IAGrClsG,EAAQw7N,QAAUtvH,EAAOsvH,QACzBx7N,EAAQu7N,QAAUrvH,EAAOqvH,QACzBv7N,EAAQi+N,SAAW/xH,EAAO+xH,uCCxB1B,aACA,MAAA0E,EAAA1iO,EAAA,iBAEAinG,eAAAA,GAAAhnG,OAAAmqG,WACAu4H,qBAAAA,GAAA1iO,OACAC,EAAA,CAAAyiI,EAAArjI,EAAAa,IAAAF,OAAAC,eAAAyiI,EAAArjI,EAAA,CACAa,MAAAA,EACAyiO,UAAA,EACAp3H,YAAA,EACAD,cAAA,IAGAO,EAAAW,KACAo2H,EAAA,CACAC,cAAA,EACAnH,iBAAA,GAGAoH,EAAA5iO,IACA,MAAAS,EAAA,GAEA,IAAA,MAAAa,KAAAtB,EACA8mG,EAAAoD,KAAAlqG,EAAAsB,IACAb,EAAA22E,KAAA91E,GAKA,GAAAxB,OAAA+lG,sBAAA,CACA,MAAAg9H,EAAA/iO,OAAA+lG,sBAAA7lG,GAEA,IAAA,MAAA8iO,KAAAD,EACAL,EAAAt4H,KAAAlqG,EAAA8iO,IACAriO,EAAA22E,KAAA0rJ,GAKA,OAAAriO,GAGA,SAAAkhI,EAAA3hI,GACA,OAAAmqG,MAAA/gB,QAAAppF,GAWA,SAAAwhO,GACA,MAAAtqJ,EAAAsqJ,EAAA9vJ,MAAA,EAAA,GAMA,OAJAkxJ,EAAApB,GAAA9gO,SAAAY,IACAvB,EAAAm3E,EAAA51E,EAAAqgI,EAAA6/F,EAAAlgO,QAGA41E,EAjBA6rJ,CAAA/iO,GAGAuiO,EAAAviO,GAiBA,SAAAwiI,GACA,MAAAtrD,EAAA,OAAAp3E,OAAAywM,eAAA/tE,GAAA1iI,OAAAU,OAAA,MAAA,GAMA,OAJAoiO,EAAApgG,GAAA9hI,SAAAY,IACAvB,EAAAm3E,EAAA51E,EAAAqgI,EAAAa,EAAAlhI,QAGA41E,EAvBA8rJ,CAAAhjO,GAGAA,EA8BA,MAAAijO,EAAA,CAAAC,EAAA7hJ,EAAA5gF,EAAAomF,KACApmF,EAAAC,SAAAY,SACA,IAAA+/E,EAAA//E,IAAAulF,EAAA20I,kBAKAl6N,KAAA4hO,GAAAA,EAAA5hO,KAAAxB,OAAAywM,eAAA2yB,GACAnjO,EAAAmjO,EAAA5hO,EAAAi6N,EAAA2H,EAAA5hO,GAAA+/E,EAAA//E,GAAAulF,IAEA9mF,EAAAmjO,EAAA5hO,EAAAqgI,EAAAtgD,EAAA//E,SAIA4hO,GA+CA,SAAA3H,EAAA2H,EAAA7hJ,EAAAwF,GACA,OAAAA,EAAA87I,cAAAx4H,MAAA/gB,QAAA85I,IAAA/4H,MAAA/gB,QAAA/H,GArCA,EAAA6hJ,EAAA7hJ,EAAAwF,KACA,IAAA3P,EAAAgsJ,EAAAxxJ,MAAA,EAAA,GACAyxJ,EAAA,EAyBA,MAvBA,CAAAD,EAAA7hJ,GAAA3gF,SAAA8gO,IACA,MAAA4B,EAAA,GAGA,IAAA,IAAAziO,EAAA,EAAAA,EAAA6gO,EAAAjwJ,OAAA5wE,IACAmmG,EAAAoD,KAAAs3H,EAAA7gO,KAIAyiO,EAAAhsJ,KAAAzE,OAAAhyE,IAIAZ,EAAAm3E,EAAAisJ,IAFA3B,IAAA0B,EAEA1B,EAAA7gO,GAEAghI,EAAA6/F,EAAA7gO,MAKAu2E,EAAA+rJ,EAAA/rJ,EAAAsqJ,EAAAoB,EAAApB,GAAAnnJ,QAAA/4E,IAAA8hO,EAAAroJ,SAAAz5E,KAAAulF,MAGA3P,GAWAyrJ,CAAAO,EAAA7hJ,EAAAwF,GAGA07I,EAAAlhJ,IAAAkhJ,EAAAW,GAIAD,EAAAC,EAAA7hJ,EAAAuhJ,EAAAvhJ,GAAAwF,GAHA86C,EAAAtgD,GAMA1hF,EAAAC,QAAA,YAAAqB,GACA,MAAA4lF,EAAA00I,EAAA55F,EAAA+gG,GAAAp2H,OAAAX,GAAAW,MAAA,GAAAo2H,GACA,IAAAQ,EAAA,CAAAz7I,EAAA,IAEA,IAAA,MAAAkgD,KAAA1mI,EACA,QAAAe,IAAA2lI,EAAA,CAIA,IAAA46F,EAAA56F,GACA,MAAA,IAAAt2B,UAAA,IAAAs2B,EAAA,6BAGAu7F,EAAA3H,EAAA2H,EAAA,CAAAz7I,EAAAkgD,GAAA9gD,GAGA,OAAAq8I,EAAAz7I,uDCzKA,aAEA9nF,EAAAC,QAAAI,IACA,GAAA,oBAAAF,OAAAmqG,UAAAS,SAAAR,KAAAlqG,GACA,OAAA,EAGA,MAAAiqG,EAAAnqG,OAAAywM,eAAAvwM,GACA,OAAA,OAAAiqG,GAAAA,IAAAnqG,OAAAmqG,yCCRA,aAEA,MAAAo5H,qBACAA,EAAAC,OACAA,EAAA7H,gBACAA,EAAA8H,YACAA,GACA1jO,EAAA,aACA6tG,EAAA7tG,EAAA,kBAEAF,EAAAC,QAAA,CACAm5N,IAAAsK,EACA5H,gBAAAA,EACA6H,OAAAA,EACA51H,SAAAA,EACA61H,YAAAA,6ECfA,aAEA,MAAA/C,EACA,oBAAAtuD,WACA,gBAAAA,UAAAguD,QAUA,MAAAnH,EAAAntH,KAAAmtH,IACAwK,EARA/C,EACA,mBAGA50H,KAAAkpG,SAAA+C,SAAA,KAAAjsG,KAAAkpG,SAAAhjG,KA0KAnyG,EAAAC,QAAA,CACAyjO,qBArKA,MACAlgO,YAAA+uG,EAAA,GAAAw6B,EAAA62F,GACAj3H,KAAAulB,MAAA,IAAAknG,EAAA7mH,EAAAw6B,GACApgC,KAAArtG,KAAAqtG,KAAAopG,SAAAppG,KAAAiM,OACAjM,KAAAuF,KACAvF,KAAAk3H,UAAAl3H,KAAAm3H,SACAn3H,KAAAk3H,SAAA,IAAAl3H,KAAAm3H,SACA,KAEAn3H,KAAA0oG,MACA1oG,KAAAiM,QAAAjM,KAAAiM,OAAA9vB,WAAA,KACA6jB,KAAAiM,OAAA7mC,MAAA,GACA,KAGAiuC,WACA,OAAArT,KAAAulB,MAAAlS,KAGA7N,WACA,OAAAxF,KAAAulB,MAAA/f,KAGA4xH,eACA,OAAAp3H,KAAAulB,MAAA6xG,SAGA9gB,WACA,OAAAt2G,KAAAulB,MAAA+wF,KAGA+gB,aACA,OAAAr3H,KAAAulB,MAAA8xG,OAGAF,eACA,OAAAn3H,KAAAulB,MAAA4xG,SAGA/tB,eACA,OAAAppG,KAAAulB,MAAA6jF,SAGA3jG,WACA,OAAAzF,KAAAulB,MAAA9f,KAGA8lG,eACA,OAAAvrG,KAAAulB,MAAAgmF,SAGAt/F,aACA,OAAAjM,KAAAulB,MAAAtZ,OAGA+nG,mBACA,OAAAh0G,KAAAulB,MAAAyuF,aAGAkjB,eACA,OAAAl3H,KAAAulB,MAAA2xG,SAGA7jH,SAAAA,GACArT,KAAAulB,MAAAlS,KAAAA,EAGA7N,SAAAA,GACAxF,KAAAulB,MAAA/f,KAAAA,EAGA4xH,aAAAA,GACAp3H,KAAAulB,MAAA6xG,SAAAA,EAGA9gB,SAAAA,GACAt2G,KAAAulB,MAAA+wF,KAAAA,EAGA6gB,aAAAA,GACAn3H,KAAAulB,MAAA4xG,SAAAA,EAGA/tB,aAAAA,GACAppG,KAAAulB,MAAA6jF,SAAAA,EAGA3jG,SAAAA,GACAzF,KAAAulB,MAAA9f,KAAAA,EAGA8lG,aAAAA,GACAvrG,KAAAulB,MAAAgmF,SAAAA,EAGAt/F,WAAAA,GACAjM,KAAAulB,MAAAtZ,OAAAA,EAGAirH,aAAAA,GACAl3H,KAAAulB,MAAA2xG,SAAAA,EAMArgO,uBAAAq5K,GACA,OAAAu8C,EAAAC,gBAAAx8C,GAMAr5K,uBAAAq5K,GACAu8C,EAAAE,gBAAAz8C,GAGAr5K,SACA,OAAAmpG,KAAAulB,MAAAn+B,SAGAvwF,WACA,OAAAmpG,KAAAulB,MAAAnnB,WAGAvnG,SACA,OAAAmpG,KAAA5B,aAwCA+wH,gBAAA7vH,KAAA6vH,gBACA8H,YAAAA,EACAD,OAnCA,SAAAn4H,GACA,GAAA,iBAAAA,EAAA,CAGA,OAFA,IAAA4tH,EAAA5tH,GAEAT,WAGA,KAAAS,aAAA4tH,GAAA,CACA,MAAA6K,EAEAz4H,EAAAq4H,UAAAr4H,EAAAs4H,SAEA,GAAAt4H,EAAAq4H,YAAAr4H,EAAAs4H,YACA,GACA5xH,EAAA1G,EAAA0G,KAAA1G,EAAA0G,KAAA,IAAA,GACAE,EAAA5G,EAAA4G,KAAA,IAAA5G,EAAA4G,KAAA,GACA8lG,EAAA1sG,EAAA0sG,SAAA1sG,EAAA0sG,SAAA,KAAA,GACA/lG,EAAA3G,EAAA2G,MAAA,GACA4xH,EAAAv4H,EAAAu4H,UAAA,GACAnrH,EAAApN,EAAAoN,SAAApN,EAAA6pG,MAAA,IAAA7pG,EAAA6pG,MAAA,IACAr1F,EAAAxU,EAAAwU,MAAA,GACA+1F,EAAAvqG,EAAAuqG,UAAA,GAIA,MAAA,GAAAmC,IAAA+rB,GAAA/xH,IACAC,GAAA4xH,EAAA3xH,IAHA5G,EAAAlsG,MAAAy2M,EAAAn9F,IAIAoH,qCCjLA,aAEA,MAAA0jH,qBAAAA,EAAAC,OAAAA,GAAAzjO,EAAA,SAQAF,EAAAC,QAAA,CAAAsyG,EAAA4iG,EAAA,GAAA+uB,EAAA,GAAAC,KACA,IAMAC,EANAlsB,EAAA/C,EAAA+C,SACA/C,EAAA+C,SAAAryH,QAAA,IAAA,IACA,OAGAqyH,GAAAgsB,EAAAhsB,IAAAisB,GAAAjsB,GAAA,IAGA,IACAksB,EAAA,IAAAV,EAAAnxH,GACA,MAAAnM,GACAg+H,EAAA,GAGA,MAAAr3F,EAAA5sI,OAAAiqG,OAAA,GAAA+qG,EAAA,CACA+C,SAAAA,GAAAksB,EAAAlsB,SACA/lG,KAAAgjG,EAAAhjG,MAAAiyH,EAAAjyH,OAGA,OAAA,IAAAuxH,EAAAnxH,EAAAoxH,EAAA52F,IAAAhiC,yDC9BA,aAEA,IAAAs5H,EAGAA,EADAr4H,WAAA+vH,iBAAA/vH,WAAAs4H,YACAt4H,WAEA9rG,EAAA,oBAGAF,EAAAC,QAAA,CACA87N,gBAAAsI,EAAAtI,gBACAuI,YAAAD,EAAAC,qECXA,aAGA,MAAAvI,gBAAAA,EAAAuI,YAAAA,GACA,oBAAAr4H,KAAAA,KACA,oBAAAC,OAAAA,YACA7pG,EAGArC,EAAAC,QAAA87N,EACA/7N,EAAAC,QAAAqkO,YAAAA,EACAtkO,EAAAC,QAAAH,QAAAi8N,gCCZA,MAAAA,gBAAAA,GAAA77N,EAAA,2BAQA,SAAA87N,EAAAuI,GACA,MAAAC,EAAA,IAAAzI,EAEA,SAAA0I,IACAD,EAAA7kF,QAEA,IAAA,MAAA68E,KAAA+H,EACA/H,GAAAA,EAAAxoD,qBACAwoD,EAAAxoD,oBAAA,QAAAywD,GAIA,IAAA,MAAAjI,KAAA+H,EACA,GAAA/H,GAAAA,EAAA3pD,iBAAA,CACA,GAAA2pD,EAAAx8E,QAAA,CACAykF,IACA,MAEAjI,EAAA3pD,iBAAA,QAAA4xD,GAGA,OAAAD,EAAAhI,OAGAx8N,EAAAC,QAAA+7N,EACAh8N,EAAAC,QAAA+7N,UAAAA,iEC7BA,aAEA,MAAA0I,EAAAxkO,EAAA,eACAg7N,EAAAh7N,EAAA,QACAykO,EAAAzkO,EAAA,0BACA0kO,EAAA1kO,EAAA,aACA2kO,YAAAA,GAAA3kO,EAAA,WACA4kO,EAAA5kO,EAAA,sBACA6kO,EAAA7kO,EAAA,2BACA8kO,EAAA9kO,EAAA,yBAiMA,MAAA+kO,EAAAL,EA/LA,MACAphO,YAAAotF,EAAAs0I,EAAAC,GACA,KAAAv0I,aAAAw0I,YACA,MAAA,IAAA3/H,MAAA,uBAGA,GAAAy/H,GAAAC,IAAAL,EAAAI,EAAAG,OAAAC,MAAAH,EAAAG,OACA,MAAA,IAAA7/H,MAAA,0BAGAkH,KAAAuhG,IAAAt9G,EACA+b,KAAA44H,aAAAb,EAAAc,YAAA74H,KAAA/b,IACA+b,KAAA84H,SAAAP,EACAv4H,KAAA+4H,QAAAP,EAGAv0I,SACA,OAAA+b,KAAAuhG,IAGAt9G,OAAA0V,GACA,MAAA,IAAAb,MAAA,mBAGAy/H,cACA,OAAAv4H,KAAA84H,SAGAP,YAAAA,GACAv4H,KAAA84H,SAAAP,EAGAC,aACA,GAAAx4H,KAAA+4H,QACA,OAAA/4H,KAAA+4H,QAGA,GAAA/4H,KAAA84H,SACA,OAAA94H,KAAA84H,SAAAJ,OAGA,IACA,MAAAM,EAAAjB,EAAA3zH,OAAApE,KAAA/b,IAEA,aAAA+0I,EAAAnmO,OACAmtG,KAAA+4H,QAAAf,EAAAiB,mBAAAD,EAAAE,SAEA,MAAA/9I,IAIA,OAAA6kB,KAAA+4H,QAGAP,WAAAA,GACAx4H,KAAA+4H,QAAAP,EAIA3hO,gBACA,GAAAmpG,KAAAw4H,OACA,OAAAR,EAAAmB,iBAAAn5H,KAAAw4H,QAKA3hO,iBACA,GAAAmpG,KAAAu4H,QACA,OAAAP,EAAAoB,kBAAAp5H,KAAAu4H,SAKA1hO,QAAAwiO,GACA,OAAAnB,EAAA50H,OAAA,CACArf,GAAA+b,KAAAs5H,UACAd,OAAAx4H,KAAAu5H,gBACAhB,QAAAc,EAAA,KAAAr5H,KAAAw5H,mBACAC,SAGA5iO,UACA,IAAA6iO,EAAA15H,KAAA64H,cAGAa,EAAAv9I,WAAA,QACAu9I,EAAAA,EAAAt0J,MAAA,IAEA,IAAAu0J,EAAA,EAKA,OAJAD,EAAAz0J,OAAA00J,IACAA,EAAAD,EAAAz0J,QAGA,YAAAy0J,EAAA7zJ,OAAA,EAAA8zJ,GAAA,IAKA9iO,SACA,MAAA,CACAotF,GAAA+b,KAAA64H,cACAN,QAAAqB,EAAA55H,KAAAw5H,kBACAhB,OAAAoB,EAAA55H,KAAAu5H,kBAKA1iO,cACA,OAAAkhO,EAAA8B,YAAA75H,KAAA/b,IAGAptF,UACA,OAAAmpG,KAAA/b,GAGAptF,cACA,OAAAmpG,KAAA44H,aAKA/hO,WACA,IAAAmpG,KAAA85H,aAAA,CACA,MAAAnM,EAAA,IAAAY,EAAA,EAAA,aAAAvuH,KAAA/b,GAAA,UAEAzwF,OAAAC,eAAAusG,KAAA,eAAA,CACAtsG,MAAAi6N,EAAAoM,oBAAA,UACAh7H,YAAA,IAGA,OAAAiB,KAAA85H,aASAjjO,OAAAotF,GACA,GAAAA,aAAAw0I,WACA,OAAAN,EAAAn4H,KAAA/b,GAAAA,GACA,GAAAA,EAAAA,GACA,OAAAk0I,EAAAn4H,KAAA/b,GAAAA,EAAAA,IAEA,MAAA,IAAA6U,MAAA,gBAWAjiG,QAAAotF,GACA,OAAA+b,KAAAg6H,OAAA/1I,GAMAptF,UAEA,OAAAwmF,QAAA2iB,KAAAu4H,SACAv4H,KAAAu4H,QAAAG,QACA14H,KAAAu4H,QAAAG,OAAAC,OACA34H,KAAAw4H,OAAAG,iBAAAF,YACAN,EAAAn4H,KAAAu4H,QAAAG,OAAAC,MAAA34H,KAAAw4H,OAAAG,QAQA9hO,qBACA,IAEA,GAAA,aADAkhO,EAAA3zH,OAAApE,KAAA/b,IACApxF,KACA,OAAA,EAEA,MAAAsoF,IAIA,OAAA,IAIA,CACA0f,UAAA,SACAo/H,WAAA,8BAGA3mO,EAAAD,EAAAC,QAAAglO,EAEA,MAAA4B,EAAA1B,GACAA,EAAAG,MAAA1zJ,QAAA,GACA8yJ,EAAAz0H,OAAAk1H,EAAAG,MAAA,YAEAH,EAAAnlH,OAIA8mH,EAAA7mF,MAAAilF,EAAAC,KACA,MAAAU,QAAAgB,EAAA1B,GACA,OAAA,IAAAF,EAAAY,EAAAX,EAAAC,IAIAllO,EAAAY,OAAAo/I,MAAAytB,KACAA,EAAAA,GAAA,IACAq5D,KAAAr5D,EAAAq5D,MAAA,KACAr5D,EAAAh/E,QAAAg/E,EAAAh/E,SAAA,MAEA,MAAA/sF,QAAAgjO,EAAAqC,gBAAAt5D,EAAAh/E,QAAAg/E,EAAAq5D,MACA,OAAAD,EAAAnlO,EAAAA,EAAA0jO,SAGAplO,EAAAgnO,oBAAA9kI,GACA,IAAA8iI,EAAAP,EAAAwC,cAAA/kI,IAGAliG,EAAAknO,gBAAAjK,GACA,IAAA+H,EAAA/H,GAGAj9N,EAAAmnO,oBAAAjlI,GACAliG,EAAAonO,cAAAllI,GA2HA,SAAAokI,EAAAjgI,GACA,GAAAA,EACA,OAAA0+H,EAAA1+H,EAAA,aArHArmG,EAAAonO,cAAA/M,IAEA,IAPA,CAAAA,GAEA,eAAAA,EAAAgN,OAAA,WAAAhN,EAAAgN,MAKAC,CADAjN,EAAAY,EAAAsM,MAAAlN,GAAAA,EAAA,IAAAY,EAAAZ,IACA,MAAA,IAAA70H,MAAA,+CAAA60H,EAAAgN,OACA,OAAA,IAAArC,EAAA3K,EAAAW,YAIAh7N,EAAAwnO,iBAAAxnF,MAAAt+I,IACA,IAAAu7N,EAAAv7N,EAMA,GAJA,iBAAAu7N,IACAA,EAAA6H,EAAApjO,EAAA,gBAGAu7N,aAAAkI,YACA,MAAA,IAAA3/H,MAAA,4DAGA,MAAA0/H,QAAAR,EAAAiB,mBAAA1I,GACA,OAAA4J,EAAA,KAAA3B,IAIAllO,EAAAynO,kBAAAznF,MAAAt+I,IAKA,GAJA,iBAAAA,IACAA,EAAAojO,EAAApjO,EAAA,gBAGAA,aAAAyjO,YACA,MAAA,IAAA3/H,MAAA,4DAGA,MAAAy/H,QAAAP,EAAAgD,oBAAAhmO,GACA,OAAAmlO,EAAA5B,EAAAA,EAAAG,SAGAplO,EAAA2nO,eAAA3nF,MAAAz0C,IACA,MAAA5a,EAAA8zI,EAAAmD,cAAAr8H,EAAA5a,IACAk3I,EAAAt8H,EAAA05H,SAAAH,EAAAv5H,EAAA05H,QAAA,aACA6C,EAAAv8H,EAAA25H,QAAAJ,EAAAv5H,EAAA25H,OAAA,aACA6C,EAAAD,SAAApD,EAAAiB,mBAAAmC,GAEA,IAAAD,EACA,OAAA,IAAA7C,EAAAr0I,EAAA,KAAAo3I,GAGA,MAAA9C,QAAAP,EAAAgD,oBAAAG,GACAG,QAAApB,EAAA3B,EAAAG,QAEA,IAAA6C,EAMA,GAJAF,IACAE,QAAArB,EAAAmB,IAGAA,IAAAlD,EAAAmD,EAAAC,GACA,MAAA,IAAAziI,MAAA,uCAGA,GAAA7U,IAAAk0I,EAAAmD,EAAAr3I,GACA,MAAA,IAAA6U,MAAA,mCAGA,OAAA,IAAAw/H,EAAAr0I,EAAAs0I,EAAA8C,IAGA/nO,EAAAkoO,mBAAAloF,MAAAi9E,IACA,iBAAAA,IACAA,EAAA6H,EAAA7H,EAAA,WAGA,IAKAgL,EACAD,GANAr3I,GAAAA,EAAAs0I,QAAAA,EAAAC,OAAAA,GAAAN,EAAA9zH,OAAAmsH,GAgBA,GAdAgI,IAAAA,SAAAP,EAAAgD,oBAAAzC,GACAC,IAAAA,SAAAR,EAAAiB,mBAAAT,GAKAD,IACA+C,QAAApB,EAAA3B,EAAAG,SAGAF,IACA+C,QAAArB,EAAA1B,IAGAD,EAAA,CACA,GAAAC,IACAL,EAAAmD,EAAAC,GACA,MAAA,IAAAziI,MAAA,uCAGA,OAAA,IAAAw/H,EAAAgD,EAAA/C,EAAAA,EAAAG,QAKA,GAAAF,EACA,OAAA,IAAAF,EAAAiD,EAAA,KAAA/C,GAGA,GAAAv0I,EACA,OAAA,IAAAq0I,EAAAr0I,GAGA,MAAA,IAAA6U,MAAA,qDAGAxlG,EAAAmoO,SAAAC,GACAr+I,QAAA,iBAAAq+I,GACAA,EAAAn6B,KACAm6B,EAAA9C,iPC1WA,aAEA,MAAAzK,EAAA56N,EAAA,aACAooO,EAAApoO,EAAA,WACAowG,MAAAA,GAAApwG,EAAA,eACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BACAqoO,EAAAroO,EAAA,sBAEAsoO,EAAA,GAGA,IAAA,MAAA7mO,KAAA2uG,EAAA,CACA,MAAA9wG,EAAA,EACAgpO,EAAAl4H,EAAA9wG,IAAAA,EA8DA,SAAAuxG,EAAAu0H,GACA,KAAAA,aAAAF,YACA,MAAA,IAAA3/H,MAAA,kCAGA,GAAA6/H,EAAA1zJ,OAAA,EACA,MAAA,IAAA6zB,MAAA,2CAGA,MAAAzjG,EAAAsmO,EAAAv3H,OAAAu0H,GACA,IAAAmD,EAAAzmO,GACA,MAAA,IAAAyjG,MAAA,sCAAAzjG,EAAA+oG,SAAA,OAEAu6H,EAAAA,EAAAvzJ,MAAAu2J,EAAAv3H,OAAAu0H,OAEA,MAAAv1H,EAAAu4H,EAAAv3H,OAAAu0H,GACA,GAAAv1H,EAAA,EACA,MAAA,IAAAtK,MAAA,6BAAAsK,KAIA,IAFAu1H,EAAAA,EAAAvzJ,MAAAu2J,EAAAv3H,OAAAu0H,QAEA1zJ,SAAAm+B,EACA,MAAA,IAAAtK,MAAA,oCAAAu/H,EAAAM,EAAA,aAGA,MAAA,CACAtjO,KAAAA,EACAxC,KAAAgpO,EAAAxmO,GACA4vE,OAAAm+B,EACA81H,OAAAP,GA8CA,SAAAoD,EAAAlpO,GACA,IAAAwC,EAAAxC,EAEA,GAAA,iBAAAA,EAAA,CACA,QAAA6C,IAAAiuG,EAAA9wG,GACA,MAAA,IAAAimG,MAAA,qCAAAjmG,KAEAwC,EAAAsuG,EAAA9wG,GAGA,GAAA,iBAAAwC,EACA,MAAA,IAAAyjG,MAAA,+CAAAzjG,KAIA,QAAAK,IAAAmmO,EAAAxmO,KAAA2mO,EAAA3mO,GACA,MAAA,IAAAyjG,MAAA,+BAAAzjG,KAGA,OAAAA,EASA,SAAA2mO,EAAA3mO,GACA,OAAAA,EAAA,GAAAA,EAAA,GASA,SAAAymO,EAAAzmO,GACA,QAAA2mO,EAAA3mO,MAIAwmO,EAAAxmO,GAcA,SAAA4mO,EAAA3N,GACAlqH,EAAAkqH,GAjMA96N,OAAAc,OAAAunO,GAiNAxoO,EAAAC,QAAA,CACAqwG,MAAAA,EACAk4H,MAAAA,EACAhC,YA5MA,SAAAxmH,GACA,KAAAA,aAAAolH,YACA,MAAA,IAAA3/H,MAAA,+BAGA,OAAAu/H,EAAAhlH,EAAA,WAwMAknH,cA/LA,SAAAlnH,GACA,OAAA+kH,EAAA/kH,EAAA,WA+LAwlH,YAtLA,SAAAxlH,GACA,KAAAA,aAAAolH,YACA,MAAA,IAAA3/H,MAAA,+BAGA,OAAAu/H,EAAAlK,EAAA7qH,OAAA,YAAA+P,IAAAjuC,MAAA,IAkLA81J,cAzKA,SAAA7nH,GACA,MAAArP,EAAAqP,aAAAolH,WACAJ,EAAAhlH,GACAA,EAEA,OAAA86G,EAAA/pH,OAAA,IAAAJ,IAqKAI,OAAAA,EACAd,OAlHA,SAAA41H,EAAA7jO,EAAA4vE,GACA,IAAAi0J,QAAAxjO,IAAAL,EACA,MAAA,IAAAyjG,MAAA,6DAIA,MAAAojI,EAAAH,EAAA1mO,GAEA,KAAA6jO,aAAAT,YACA,MAAA,IAAA3/H,MAAA,iCAOA,GAJA,MAAA7zB,IACAA,EAAAi0J,EAAAj0J,QAGAA,GAAAi0J,EAAAj0J,SAAAA,EACA,MAAA,IAAA6zB,MAAA,sDAGA,MAAAua,EAAAsoH,EAAAr4H,OAAA44H,GACA94H,EAAAu4H,EAAAr4H,OAAAr+B,GACA,OAAA22J,EAAA,CAAAvoH,EAAAjQ,EAAA81H,GAAA7lH,EAAApuC,OAAAm+B,EAAAn+B,OAAAi0J,EAAAj0J,SA6FA82J,WAAAA,EACAC,UAAAA,EACAC,SAAAA,EACAtxI,OAlBA,SAAA2jI,GAGA,OAFA2N,EAAA3N,GAEAA,EAAA6N,SAAA,EAAA,IAgBAL,YAAAA,sLC7OA,aAEA,MAAAM,EAAA7oO,EAAA,gBACA8oO,WAAAA,EAAAC,WAAAA,EAAAzqI,OAAAA,GAAAt+F,EAAA,UA2GA,SAAAgpO,EAAAC,GACA,GAAAhpO,OAAAmqG,UAAAnD,eAAAoD,KAAAw+H,EAAAz4H,MAAA,GACA,OAAAy4H,EAAAz4H,MAAA,GACA,GAAAnwG,OAAAmqG,UAAAnD,eAAAoD,KAAAw+H,EAAAP,MAAA,GACA,OAAAO,EAAAP,MAAA,GAEA,MAAA,IAAA/iI,MAAA,yBAAA0jI,MAmBAlpO,EAAAD,EAAAC,QArHA,SAAAkpO,EAAAjM,GACA,IAAAA,EACA,MAAA,IAAAz3H,MAAA,kCAEA,MAAAjmG,KAAAA,EAAA4pO,QAAAA,GAAAF,EAAAC,GAGA,OAyEA,SAAA3pO,EAAA09N,GACAgM,EAAA1pO,GACAuxG,OAAAk4H,EAAA/L,IA7EAmM,CAAA7pO,EAAA09N,GAEA1+H,EAAA,CAAA4qI,EAAAlM,GAAAkM,EAAAx3J,OAAAsrJ,EAAAtrJ,UA+GAq+B,OAnGA,SAAAk5H,EAAAjM,GACA,MAAAoM,EAAAJ,EAAAC,GACA9vE,EAAA2vE,EAAAM,EAAAr5H,OAAAitH,IAEA,OAAA1+H,EAAA,CAAA8qI,EAAAF,QAAA/vE,GAAAiwE,EAAAF,QAAAx3J,OAAAynF,EAAAznF,SAgGA3xE,EAAA8wG,OApFA,SAAAsoD,GACAA,aAAA+rE,aACA/rE,EAAA4vE,EAAA5vE,IAEA,MAAA/hE,EAAA+hE,EAAA,GAOA,MAJA,CAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,KAAAj+E,SAAAkc,KACA+hE,EAAAA,EAAAtjF,eAEAmzJ,EAAA7vE,EAAA,IACAtoD,OAAAsoD,EAAA5wD,UAAA,KA0EAxoG,EAAAspO,UAlEA,SAAAlwE,GAMA,GALAA,aAAA+rE,aACA/rE,EAAA4vE,EAAA5vE,IAIA,oBAAAl5J,OAAAmqG,UAAAS,SAAAR,KAAA8uD,GACA,OAAA,EAGA,IAEA,OADA6vE,EAAA7vE,EAAA,IACA75J,KACA,MAAA4mG,GACA,OAAA,IAqDAnmG,EAAAipO,SAAAA,EACAjpO,EAAAupO,iBAbA,SAAAnwE,GAKA,OAJAA,aAAA+rE,aACA/rE,EAAA4vE,EAAA5vE,IAGA6vE,EAAA7vE,EAAA,KASA,MAAA/oD,EAAAnwG,OAAAc,OAAA8nO,EAAAz4H,OACAk4H,EAAAroO,OAAAc,OAAA8nO,EAAAP,OACAvoO,EAAAqwG,MAAAA,EACArwG,EAAAuoO,MAAAA,sECpJA,aAEA,MAAAiB,EAAAvpO,EAAA,wBACAwpO,EAAAxpO,EAAA,cACAypO,QAAAA,GAAAzpO,EAAA,cACA+oO,WAAAA,EAAAD,WAAAA,GAAA9oO,EAAA,UAqBA6oO,EAAA,CACA,CAAA,WAAA,KAdA,KACA,CACA94H,OAAAg5H,EACAl4H,OAAAi4H,IAWA,IACA,CAAA,QAAA,IAAAW,EAAA,GAAA,MACA,CAAA,QAAA,IAAAA,EAAA,GAAA,YACA,CAAA,SAAA,IAAAF,EAAA,cACA,CAAA,SAAA,IAAAE,EAAA,GAAA,oBACA,CAAA,cAAA,IAAAA,EAAA,GAAA,oBACA,CAAA,YAAA,IAAAA,EAAA,GAAA,oCACA,CAAA,iBAAA,IAAAA,EAAA,GAAA,oCACA,CAAA,eAAA,IAAAA,EAAA,GAAA,qCACA,CAAA,oBAAA,IAAAA,EAAA,GAAA,qCACA,CAAA,SAAA,IAAAA,EAAA,GAAA,oCACA,CAAA,cAAA,IAAAA,EAAA,GAAA,oCACA,CAAA,YAAA,IAAAA,EAAA,GAAA,qCACA,CAAA,iBAAA,IAAAA,EAAA,GAAA,qCACA,CAAA,UAAA,IAAAA,EAAA,GAAA,oCACA,CAAA,SAAA,IAAAF,EAAA,wCACA,CAAA,cAAA,IAAAA,EAAA,wCACA,CAAA,YAAA,IAAAA,EAAA,8DACA,CAAA,eAAA,IAAAA,EAAA,8DACA,CAAA,SAAA,IAAAE,EAAA,GAAA,oEACA,CAAA,YAAA,IAAAA,EAAA,GAAA,qEACA,CAAA,YAAA,IAAAA,EAAA,GAAA,oEACA,CAAA,eAAA,IAAAA,EAAA,GAAA,sEAIAr5H,EAAAy4H,EAAA12J,QAAA,CAAAyX,EAAA8/I,KACA9/I,EAAA8/I,EAAA,IAAA,IAAAF,EAAAE,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,IACA9/I,IACA,IAGA0+I,EAAAO,EAAA12J,QAAA,CAAAyX,EAAA8/I,KACA9/I,EAAA8/I,EAAA,IAAAt5H,EAAAs5H,EAAA,IACA9/I,IACA,IAEA9pF,EAAAC,QAAA,CACAqwG,MAAAA,EACAk4H,MAAAA,wHClEA,aA4HAxoO,EAAAC,QAtHA,SAAA4pO,GACA,GAAAA,EAAAj4J,QAAA,IAAA,MAAA,IAAA8/B,UAAA,qBAEA,IADA,IAAAo4H,EAAA,IAAA1E,WAAA,KACAnnI,EAAA,EAAAA,EAAA6rI,EAAAl4J,OAAAqsB,IACA6rI,EAAA7rI,GAAA,IAEA,IAAA,IAAAnqB,EAAA,EAAAA,EAAA+1J,EAAAj4J,OAAAkC,IAAA,CACA,IAAAymC,EAAAsvH,EAAA3kI,OAAApxB,GACAi2J,EAAAxvH,EAAA31B,WAAA,GACA,GAAA,MAAAklJ,EAAAC,GAAA,MAAA,IAAAr4H,UAAA6I,EAAA,iBACAuvH,EAAAC,GAAAj2J,EAEA,IAAAk2J,EAAAH,EAAAj4J,OACAq4J,EAAAJ,EAAA3kI,OAAA,GACAglI,EAAA33J,KAAAymJ,IAAAgR,GAAAz3J,KAAAymJ,IAAA,KACAmR,EAAA53J,KAAAymJ,IAAA,KAAAzmJ,KAAAymJ,IAAAgR,GA8CA,SAAAI,EAAA1oJ,GACA,GAAA,iBAAAA,EAAA,MAAA,IAAAgwB,UAAA,mBACA,GAAA,IAAAhwB,EAAA9P,OAAA,OAAA,IAAAwzJ,WACA,IAAAiF,EAAA,EAEA,GAAA,MAAA3oJ,EAAA2oJ,GAAA,CAIA,IAFA,IAAAC,EAAA,EACA14J,EAAA,EACA8P,EAAA2oJ,KAAAJ,GACAK,IACAD,IAMA,IAHA,IAAAzgI,GAAAloB,EAAA9P,OAAAy4J,GAAAH,EAAA,IAAA,EACAK,EAAA,IAAAnF,WAAAx7H,GAEAloB,EAAA2oJ,IAAA,CAEA,IAAAG,EAAAV,EAAApoJ,EAAAkD,WAAAylJ,IAEA,GAAA,MAAAG,EAAA,OAEA,IADA,IAAA12J,EAAA,EACA22J,EAAA7gI,EAAA,GAAA,IAAA4gI,GAAA12J,EAAAlC,KAAA,IAAA64J,EAAAA,IAAA32J,IACA02J,GAAAR,EAAAO,EAAAE,KAAA,EACAF,EAAAE,GAAAD,EAAA,MAAA,EACAA,EAAAA,EAAA,MAAA,EAEA,GAAA,IAAAA,EAAA,MAAA,IAAA/kI,MAAA,kBACA7zB,EAAAkC,EACAu2J,IAGA,GAAA,MAAA3oJ,EAAA2oJ,GAAA,CAGA,IADA,IAAAK,EAAA9gI,EAAAh4B,EACA84J,IAAA9gI,GAAA,IAAA2gI,EAAAG,IACAA,IAIA,IAFA,IAAAC,EAAA,IAAAvF,WAAAkF,GAAA1gI,EAAA8gI,IACAzsI,EAAAqsI,EACAI,IAAA9gI,GACA+gI,EAAA1sI,KAAAssI,EAAAG,KAEA,OAAAC,IAOA,MAAA,CACA16H,OAjGA,SAAAvuB,GAOA,GANAA,aAAA0jJ,aACAwF,YAAAC,OAAAnpJ,GACAA,EAAA,IAAA0jJ,WAAA1jJ,EAAA86H,OAAA96H,EAAAopJ,WAAAppJ,EAAAqpJ,YACAvgI,MAAA/gB,QAAA/H,KACAA,EAAA0jJ,WAAAhvE,KAAA10E,OAEAA,aAAA0jJ,YAAA,MAAA,IAAA1zH,UAAA,uBACA,GAAA,IAAAhwB,EAAA9P,OAAA,MAAA,GAMA,IAJA,IAAA04J,EAAA,EACA14J,EAAA,EACAo5J,EAAA,EACAC,EAAAvpJ,EAAA9P,OACAo5J,IAAAC,GAAA,IAAAvpJ,EAAAspJ,IACAA,IACAV,IAMA,IAHA,IAAA1gI,GAAAqhI,EAAAD,GAAAb,EAAA,IAAA,EACAe,EAAA,IAAA9F,WAAAx7H,GAEAohI,IAAAC,GAAA,CAIA,IAHA,IAAAT,EAAA9oJ,EAAAspJ,GAEAl3J,EAAA,EACAq3J,EAAAvhI,EAAA,GAAA,IAAA4gI,GAAA12J,EAAAlC,KAAA,IAAAu5J,EAAAA,IAAAr3J,IACA02J,GAAA,IAAAU,EAAAC,KAAA,EACAD,EAAAC,GAAAX,EAAAR,IAAA,EACAQ,EAAAA,EAAAR,IAAA,EAEA,GAAA,IAAAQ,EAAA,MAAA,IAAA/kI,MAAA,kBACA7zB,EAAAkC,EACAk3J,IAIA,IADA,IAAAI,EAAAxhI,EAAAh4B,EACAw5J,IAAAxhI,GAAA,IAAAshI,EAAAE,IACAA,IAIA,IADA,IAAAjpI,EAAA8nI,EAAA73I,OAAAk4I,GACAc,EAAAxhI,IAAAwhI,EAAAjpI,GAAA0nI,EAAA3kI,OAAAgmI,EAAAE,IACA,OAAAjpI,GAuDAioI,aAAAA,EACAr5H,OARA,SAAAzI,GACA,IAAAk0G,EAAA4tB,EAAA9hI,GACA,GAAAk0G,EAAA,OAAAA,EACA,MAAA,IAAA/2G,MAAA,WAAAukI,EAAA,+CCpHA,aAEA,MAAAhB,WAAAA,GAAA9oO,EAAA,UA+CAF,EAAAC,QArCA,MAOAuD,YAAAhE,EAAAwC,EAAAysK,EAAA48D,GACA1+H,KAAAntG,KAAAA,EACAmtG,KAAA3qG,KAAAA,EACA2qG,KAAAy8H,QAAAJ,EAAAr8H,KAAA3qG,MACA2qG,KAAA0+H,SAAAA,EACA1+H,KAAA26H,MAAA74D,EAAA48D,GAOA7nO,OAAA05N,GACA,OAAAvwH,KAAA26H,MAAAr3H,OAAAitH,GAOA15N,OAAA8kG,GACA,IAAA,MAAAkzD,KAAAlzD,EACA,GAAAqE,KAAA0+H,UAAA1+H,KAAA0+H,SAAAlzJ,QAAAqjF,GAAA,EACA,MAAA,IAAA/1D,MAAA,sBAAA+1D,UAAAlzD,MAGA,OAAAqE,KAAA26H,MAAAv2H,OAAAzI,mDC7CA,aAEA,MAAAgjI,EAAA,IAAArO,YAOAsO,EAAA,IAAA9V,YA0BAz1N,EAAAC,QAAA,CAAAgpO,WA5BA3D,GAAAgG,EAAAv6H,OAAAu0H,GA4BA0D,WArBAlvJ,GAAAyxJ,EAAAt7H,OAAAn2B,GAqBA0kB,OAZA,SAAAgtI,EAAA55J,GACA,MAAA65J,EAAA,IAAArG,WAAAxzJ,GACA,IAAAF,EAAA,EAEA,IAAA,MAAA63B,KAAAiiI,EACAC,EAAAr9I,IAAAmb,EAAA73B,GACAA,GAAA63B,EAAA33B,OAGA,OAAA65J,kCChCA,aA0HAzrO,EAAAC,QAAA,CAAA0pO,QAnBA+B,GAAAL,IACA,CAKAp7H,OAAAtU,GA9CA,EAAA09D,EAAAgyE,EAAAK,KACA,MAAA/kI,EAAA,MAAA0kI,EAAAA,EAAAz5J,OAAA,GACA+5J,GAAA,GAAAD,GAAA,EACA,IAAAh+F,EAAA,GAEAq5F,EAAA,EACAvqB,EAAA,EACA,IAAA,IAAA1oI,EAAA,EAAAA,EAAAulF,EAAAznF,SAAAkC,EAMA,IAJA0oI,EAAAA,GAAA,EAAAnjD,EAAAvlF,GACAizJ,GAAA,EAGAA,EAAA2E,GACA3E,GAAA2E,EACAh+F,GAAA29F,EAAAM,EAAAnvB,GAAAuqB,GAUA,GALAA,IACAr5F,GAAA29F,EAAAM,EAAAnvB,GAAAkvB,EAAA3E,IAIApgI,EACA,KAAA+mC,EAAA97D,OAAA85J,EAAA,GACAh+F,GAAA,IAIA,OAAAA,GAgBAz9B,CAAAtU,EAAA0vI,EAAAK,GAMA36H,OAAApV,GA1GA,EAAA2M,EAAA+iI,EAAAK,KAGA,MAAAlD,EAAA,GACA,IAAA,IAAA10J,EAAA,EAAAA,EAAAu3J,EAAAz5J,SAAAkC,EACA00J,EAAA6C,EAAAv3J,IAAAA,EAIA,IAAAnC,EAAA22B,EAAA12B,OACA,KAAA,MAAA02B,EAAA32B,EAAA,MACAA,EAIA,MAAA+7D,EAAA,IAAA03F,WAAAzzJ,EAAA+5J,EAAA,EAAA,GAGA,IAAA3E,EAAA,EACAvqB,EAAA,EACAovB,EAAA,EACA,IAAA,IAAA93J,EAAA,EAAAA,EAAAnC,IAAAmC,EAAA,CAEA,MAAAzzE,EAAAmoO,EAAAlgI,EAAAx0B,IACA,QAAAzxE,IAAAhC,EACA,MAAA,IAAAm8E,YAAA,qBAAA8rB,EAAAx0B,IAIA0oI,EAAAA,GAAAkvB,EAAArrO,EACA0mO,GAAA2E,EAGA3E,GAAA,IACAA,GAAA,EACAr5F,EAAAk+F,KAAA,IAAApvB,GAAAuqB,GAKA,GAAAA,GAAA2E,GAAA,IAAAlvB,GAAA,EAAAuqB,EACA,MAAA,IAAAvqJ,YAAA,0BAGA,OAAAkxD,GA+DA38B,CAAApV,EAAA0vI,EAAAK,oCCrHA1rO,EAAAC,QAAA,CACAgwG,OAAA/vG,EAAA,eACA6wG,OAAA7wG,EAAA,eACA2rO,eAAA3rO,EAAA,+GCHAF,EAAAC,QAOA,SAAAgwG,EAAAoO,EAAAqvB,EAAAh8D,GACAg8D,EAAAA,GAAA,GAEA,IAAAo+F,EADAp6J,EAAAA,GAAA,EAGA,KAAA2sC,GAAA0tH,GACAr+F,EAAAh8D,KAAA,IAAA2sC,EAXA,IAYAA,GAAA,IAEA,MAZA,IAYAA,GACAqvB,EAAAh8D,KAAA,IAAA2sC,EAfA,IAgBAA,KAAA,EAMA,OAJAqvB,EAAAh8D,GAAA,EAAA2sC,EAEApO,EAAAq1H,MAAA5zJ,EAAAo6J,EAAA,EAEAp+F,GAtBA,IAGAq+F,EAAAx5J,KAAAy5J,IAAA,EAAA,gCCLAhsO,EAAAC,QAKA,SAAA09N,EAAAT,EAAAxrJ,GACA,IAIAuU,EAJAvN,EAAA,EAEA44B,EAAA,EACA26H,EAFAv6J,EAAAA,GAAA,EAIAgkB,EAAAwnI,EAAAtrJ,OAEA,EAAA,CACA,GAAAq6J,GAAAv2I,EAEA,MADAioI,EAAA2H,MAAA,EACA,IAAA4G,WAAA,2BAEAjmJ,EAAAi3I,EAAA+O,KACAvzJ,GAAA44B,EAAA,IAhBA,IAiBArrB,IAAAqrB,GAjBA,IAkBArrB,GAAA1T,KAAAy5J,IAAA,EAAA16H,GACAA,GAAA,QACArrB,GArBA,KAyBA,OAFA03I,EAAA2H,MAAA2G,EAAAv6J,EAEAgH,iCC1BA,IAAAyzJ,EAAA55J,KAAAy5J,IAAA,EAAA,GACAI,EAAA75J,KAAAy5J,IAAA,EAAA,IACAK,EAAA95J,KAAAy5J,IAAA,EAAA,IACAM,EAAA/5J,KAAAy5J,IAAA,EAAA,IACAO,EAAAh6J,KAAAy5J,IAAA,EAAA,IACAQ,EAAAj6J,KAAAy5J,IAAA,EAAA,IACAS,EAAAl6J,KAAAy5J,IAAA,EAAA,IACAU,EAAAn6J,KAAAy5J,IAAA,EAAA,IACAW,EAAAp6J,KAAAy5J,IAAA,EAAA,IAEAhsO,EAAAC,QAAA,SAAAI,GACA,OACAA,EAAA8rO,EAAA,EACA9rO,EAAA+rO,EAAA,EACA/rO,EAAAgsO,EAAA,EACAhsO,EAAAisO,EAAA,EACAjsO,EAAAksO,EAAA,EACAlsO,EAAAmsO,EAAA,EACAnsO,EAAAosO,EAAA,EACApsO,EAAAqsO,EAAA,EACArsO,EAAAssO,EAAA,EACA,kCCrBA,aAgBA,MAAAr8H,EAAAnwG,OAAAc,OAAA,CACAmyG,SAAA,EACAw5H,KAAA,GACAC,WAAA,GACAC,WAAA,GACAC,WAAA,GACAC,WAAA,GACAC,WAAA,GACAC,WAAA,GACAC,YAAA,GACAC,YAAA,GACAC,aAAA,GACAC,aAAA,GACAC,aAAA,GACAC,aAAA,GACAC,OAAA,GACAC,cAAA,GACAC,aAAA,GACAC,eAAA,GACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,2BAAA,KACAC,aAAA,KACAC,aAAA,KACAC,aAAA,KACAC,aAAA,KACAC,IAAA,KACAC,eAAA,KACAC,UAAA,MACAC,YAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,YAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,aAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,aAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,cAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,KACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,iBAAA,MACAC,iBAAA,MACAC,iBAAA,MACAC,iBAAA,MACAC,4BAAA,MACAC,+BAAA,QAGAziP,EAAAC,QAAA,CAAAqwG,MAAAA,iCCnXA,aAEA,MAAA44H,SAAAwZ,GAAAxiP,EAAA,aACAyiP,EAAA,IAAA1lB,YAAA,QA4CAj9N,EAAAC,QAZA,SAAA4hO,EAAAqH,EAAA,QACA,MAAA,SAAAA,GAAA,UAAAA,EACAyZ,EAAA5xI,OAAA8wH,GAGA,UAAAqH,EAzBA,SAAArH,GACA,IAAAv5H,EAAA,GAEA,IAAA,IAAAx0B,EAAA,EAAAA,EAAA+tJ,EAAAjwJ,OAAAkC,IACAw0B,GAAAt1B,OAAA67C,aAAAgzG,EAAA/tJ,IAEA,OAAAw0B,EAoBAs6I,CAAA/gB,GAGA6gB,EAAAxZ,GAAAj5H,OAAA4xH,mDC5CA,aAEA,MAAAqH,SAAAwZ,GAAAxiP,EAAA,aACA2iP,EAAA,IAAAptB,YA6CAz1N,EAAAC,QAZA,SAAAqoG,EAAA4gI,EAAA,QACA,MAAA,SAAAA,GAAA,UAAAA,EACA2Z,EAAA5yI,OAAA3H,GAGA,UAAA4gI,EA1BA,SAAA5gI,GACA,MAAAu5H,EAAA,IAAAuD,WAAA98H,EAAA12B,QAEA,IAAA,IAAAkC,EAAA,EAAAA,EAAAw0B,EAAA12B,OAAAkC,IACA+tJ,EAAA/tJ,GAAAw0B,EAAA1jB,WAAA9Q,GAGA,OAAA+tJ,EAoBAihB,CAAAx6I,GAGAo6I,EAAAxZ,GAAAn4H,OAAAzI,iDC7CA,aAwBAtoG,EAAAC,QAhBA,SAAA8iP,EAAAnxK,GACAA,IACAA,EAAAmxK,EAAA1wK,QAAA,CAAA2wK,EAAArpF,IAAAqpF,EAAArpF,EAAA/nF,QAAA,IAGA,MAAA65J,EAAA,IAAArG,WAAAxzJ,GACA,IAAAF,EAAA,EAEA,IAAA,MAAA63B,KAAAw5I,EACAtX,EAAAr9I,IAAAmb,EAAA73B,GACAA,GAAA63B,EAAA33B,OAGA,OAAA65J,iCCrBA,aAEA,MAAA/G,EAAAxkO,EAAA,eACA46N,EAAA56N,EAAA,aACA66N,EAAA76N,EAAA,cACA+iP,EAAA/iP,EAAA,cACAqoO,EAAAroO,EAAA,sBACA8kO,EAAA9kO,EAAA,yBACA4kO,EAAA5kO,EAAA,sBAEAy2N,EAAAoE,EAAAmoB,WACAC,EAAAhjP,OAAAW,KAAA61N,GAAAtkJ,QAAA,CAAAwB,EAAAr0E,KACAq0E,EAAA8iJ,EAAAn3N,IAAAA,EACAq0E,IACA,IAEAsvJ,EAAAtgO,OAAAugP,IAAA,oBAqBA,MAAAloB,EA+BA13N,YAAA6sG,EAAAi3H,EAAArM,EAAAooB,GA8BA,GApBA12I,KAAA0D,QASA1D,KAAA26H,MAQA36H,KAAAsuH,UAEA96N,OAAAC,eAAAusG,KAAAw2H,EAAA,CAAA9iO,OAAA,IACA66N,EAAAsM,MAAAn3H,GAAA,CAEA,MAAAiqH,EAAA,EAOA,OANA3tH,KAAA0D,QAAAiqH,EAAAjqH,QACA1D,KAAA26H,MAAAhN,EAAAgN,MACA36H,KAAAsuH,UAAAX,EAAAW,eAGAtuH,KAAA02I,cAAA/oB,EAAA+oB,gBAAA,IAAA/oB,EAAAjqH,QAAA,YAAA,WAIA,GAAA,iBAAAA,EAAA,CAEA,MAAAizI,EAAAxoB,EAAAyO,UAAAl5H,GACA,GAAAizI,EAAA,CAEA,MAAAhpB,EAAAQ,EAAA/pH,OAAAV,GACA1D,KAAA0D,QAAAt9B,SAAAunJ,EAAA,GAAAvvH,WAAA,IACA4B,KAAA26H,MAAAvM,EAAA2nB,SAAApoB,EAAAvoJ,MAAA,IACA46B,KAAAsuH,UAAAF,EAAAwoB,SAAAjpB,EAAAvoJ,MAAA,IACA46B,KAAA02I,cAAAC,OAGA32I,KAAA0D,QAAA,EACA1D,KAAA26H,MAAA,SACA36H,KAAAsuH,UAAAyJ,EAAAmD,cAAAx3H,GACA1D,KAAA02I,cAAA,YAIA,OAFAnoB,EAAAsoB,YAAA72I,WACAxsG,OAAAC,eAAAusG,KAAA,SAAA,CAAAtsG,MAAAgwG,IAIA,GAAAA,aAAA+0H,WAAA,CACA,MAAA3zD,EAAA1+F,SAAAs9B,EAAA,GAAAtF,WAAA,IACA,GAAA,IAAA0mE,EAAA,CAEA,MAAA6oD,EAAAjqH,EACA1D,KAAA0D,QAAAohE,EACA9kE,KAAA26H,MAAAvM,EAAA2nB,SAAApoB,EAAAvoJ,MAAA,IACA46B,KAAAsuH,UAAAF,EAAAwoB,SAAAjpB,EAAAvoJ,MAAA,IACA46B,KAAA02I,cAAA,cAGA12I,KAAA0D,QAAA,EACA1D,KAAA26H,MAAA,SACA36H,KAAAsuH,UAAA5qH,EACA1D,KAAA02I,cAAA,YAEAnoB,EAAAsoB,YAAA72I,WAMAA,KAAA0D,QAAAA,EAEA,iBAAAi3H,IAEAA,EAAA6b,EAAA7b,IAGA36H,KAAA26H,MAAA,EAEA36H,KAAAsuH,UAAA,EAQAtuH,KAAA02I,cAAAA,IAAA,IAAAhzI,EAAA,YAAA,UAEA6qH,EAAAsoB,YAAA72I,MASA24H,YAEA,IAAAA,EAAA34H,KAAA82I,OAEA,IAAAne,EAAA,CACA,GAAA,IAAA34H,KAAA0D,QACAi1H,EAAA34H,KAAAsuH,cACA,CAAA,GAAA,IAAAtuH,KAAA0D,QAMA,MAAA,IAAA5K,MAAA,uBANA,CACA,MAAA6hI,EAAAvM,EAAA2oB,cAAA/2I,KAAA26H,OACAhC,EAAAiD,EAAA,CACA,CAAA,GAAAjB,EAAA36H,KAAAsuH,WACA,EAAAqM,EAAAyD,WAAAp+H,KAAAsuH,UAAA8P,aAMA5qO,OAAAC,eAAAusG,KAAA,SAAA,CAAAtsG,MAAAilO,IAGA,OAAAA,EAQAhuI,aACA,MAAAgwI,EAAAvM,EAAA2oB,cAAA/2I,KAAA26H,OACArM,EAAAyJ,EAAAptI,OAAAqV,KAAAsuH,WAKA,OAJAsN,EAAA,CACA,CAAA57H,KAAA0D,SAAAi3H,EAAArM,GACA,EAAAqM,EAAAyD,WAAA9P,EAAA8P,YAUA/oO,WACA,OAAA20N,EAAAhqH,KAAA26H,OAQA9jO,OACA,GAAA,WAAAmpG,KAAA26H,MACA,MAAA,IAAA7hI,MAAA,4CAGA,MAAAjmG,KAAAA,EAAAoyE,OAAAA,GAAA8yJ,EAAA3zH,OAAApE,KAAAsuH,WAEA,GAAA,aAAAz7N,EACA,MAAA,IAAAimG,MAAA,sDAGA,GAAA,KAAA7zB,EACA,MAAA,IAAA6zB,MAAA,qDAGA,OAAA,IAAAy1H,EAAA,EAAAvuH,KAAA26H,MAAA36H,KAAAsuH,WAQAz3N,OACA,OAAA,IAAA03N,EAAA,EAAAvuH,KAAA26H,MAAA36H,KAAAsuH,WASAz3N,oBAAAupI,EAAApgC,KAAA02I,eAEA,GAAA12I,KAAArE,QAAA,IAAAqE,KAAArE,OAAA12B,QAAAm7D,IAAApgC,KAAA02I,cAEA,OAAA12I,KAAArE,OAEA,IAAAnG,EACA,GAAA,IAAAwK,KAAA0D,QAAA,CACA,GAAA,cAAA08B,EACA,MAAA,IAAAtnC,MAAA,kIAEAtD,EAAAuiI,EAAAc,YAAA74H,KAAAsuH,eACA,CAAA,GAAA,IAAAtuH,KAAA0D,QAGA,MAAA,IAAA5K,MAAA,uBAFAtD,EAAA6iI,EAAAlK,EAAA7qH,OAAA88B,EAAApgC,KAAA24H,QAQA,OAJAv4F,IAAApgC,KAAA02I,eAEAljP,OAAAC,eAAAusG,KAAA,SAAA,CAAAtsG,MAAA8hG,IAEAA,EAQA3+F,CAAAX,OAAAugP,IAAA,iCACA,MAAA,OAAAz2I,KAAA5B,WAAA,IASAvnG,SAAAupI,GACA,OAAApgC,KAAA+5H,oBAAA35F,GAQAvpI,SACA,MAAA,CACA8jO,MAAA36H,KAAA26H,MACAj3H,QAAA1D,KAAA0D,QACA2P,KAAArT,KAAAsuH,WAUAz3N,OAAAmgP,GACA,OAAAh3I,KAAA26H,QAAAqc,EAAArc,OACA36H,KAAA0D,UAAAszI,EAAAtzI,SACAy0H,EAAAn4H,KAAAsuH,UAAA0oB,EAAA1oB,WAUAz3N,mBAAAmgP,GACA,MAAAC,EAAAX,EAAAY,mBAAAF,GACA,GAAAC,EACA,MAAA,IAAAn+I,MAAAm+I,GAUApgP,aAAAnD,GACA,OAAAA,aAAA66N,GAAAlxI,QAAA3pF,GAAAA,EAAA8iO,KAIAjI,EAAAvE,OAAAA,EAEA32N,EAAAC,QAAAi7N,uMC/VA,aAKA,MAAAoN,EAAApoO,EAAA,UACAqoO,EAAAroO,EAAA,sBACAqsG,EAAArsG,EAAA,WACA4jP,aAAAA,EAAAC,eAAAA,EAAAb,WAAAA,EAAAc,WAAAA,GAAA9jP,EAAA,UA0CA,SAAA+jP,EAAAC,GACA,MAAAliP,EAAAsmO,EAAAv3H,OAAA,GACAvxG,EAAAwkP,EAAAhiP,GACA,QAAAK,IAAA7C,EACA,MAAA,IAAAimG,MAAA,SAAAzjG,gBAEA,OAAAxC,EASA,SAAA2kP,EAAA7c,GACA,OAAA0c,EAAA1c,GASA,SAAA8c,EAAA5kP,GACA,MAAAwC,EAAAkhP,EAAA1jP,GACA,QAAA6C,IAAAL,EACA,MAAA,IAAAyjG,MAAA,UAAAjmG,gBAEA,OAAAwC,EASA,SAAAqiP,EAAAH,GACA,OAAA5b,EAAAv3H,OAAA,GASA,SAAAuzI,EAAA9kP,GACA,MAAAwC,EAAA8hP,EAAAtkP,GACA,QAAA6C,IAAAL,EACA,MAAA,IAAAyjG,MAAA,UAAAjmG,gBAEA,OAAAwC,EASA,SAAAuiP,EAAAviP,GACA,OAAAuqG,EAAAi4I,aAAAxiP,GAqEAhC,EAAAC,QAAA,CACAwkP,UAvKA,SAAAC,EAAArrF,GACA,IAAA/hE,EAEA,GAAAotJ,aAAAtf,WACA9tI,EAAAiV,EAAAo4I,uBAAAD,OACA,CACA,IAAAZ,EAAAY,GAGA,MAAA,IAAAj/I,MAAA,6BAFAnO,EAAAwsJ,EAAAY,GAMA,OAAAnc,EAAA,CAAAjxI,EAAA+hE,GAAA/hE,EAAA1lB,OAAAynF,EAAAznF,SA2JA2xK,SAlJA,SAAAlqF,GAEA,OADAivE,EAAAv3H,OAAA,GACAsoD,EAAAtnF,MAAAu2J,EAAAv3H,OAAAu0H,QAiJA2e,gBAAAA,EACAE,gBAAAA,EACAC,gBAAAA,EACAC,gBAAAA,EACAC,kBAAAA,EACAC,kBAAAA,EAEA7B,SArEA,SAAAwB,GACA,OAAAD,EAAAC,IAqEAU,QA3DA,SAAAtd,GACA,OAAA6c,EAAA7c,IA2DAud,UAjDA,SAAArlP,GACA,OAAA4kP,EAAA5kP,IAiDAslP,QAvCA,SAAAZ,GACA,OAAAG,EAAAH,IAuCAR,cA7BA,SAAAlkP,GACA,OAAA8kP,EAAA9kP,IA6BAulP,UAnBA,SAAA/iP,GACA,OAAAwoG,MAAA4rD,KAAAmuF,EAAAviP,QAoBA+hP,EAEAD,aAAAA,EACAZ,WAAAA,EACAc,WAAAA,8GCvNAhkP,EAAAC,QAAA,CACAgwG,OAAA/vG,EAAA,eACA6wG,OAAA7wG,EAAA,eACA2rO,eAAA3rO,EAAA,+GCHAF,EAAAC,QAOA,SAAAgwG,EAAAoO,EAAAqvB,EAAAh8D,GACAg8D,EAAAA,GAAA,GAEA,IAAAo+F,EADAp6J,EAAAA,GAAA,EAGA,KAAA2sC,GAAA0tH,GACAr+F,EAAAh8D,KAAA,IAAA2sC,EAXA,IAYAA,GAAA,IAEA,MAZA,IAYAA,GACAqvB,EAAAh8D,KAAA,IAAA2sC,EAfA,IAgBAA,KAAA,EAMA,OAJAqvB,EAAAh8D,GAAA,EAAA2sC,EAEApO,EAAAq1H,MAAA5zJ,EAAAo6J,EAAA,EAEAp+F,GAtBA,IAGAq+F,EAAAx5J,KAAAy5J,IAAA,EAAA,kCCLAhsO,EAAAC,QAKA,SAAA09N,EAAAT,EAAAxrJ,GACA,IAIAuU,EAJAvN,EAAA,EAEA44B,EAAA,EACA26H,EAFAv6J,EAAAA,GAAA,EAIAgkB,EAAAwnI,EAAAtrJ,OAEA,EAAA,CACA,GAAAq6J,GAAAv2I,EAEA,MADAioI,EAAA2H,MAAA,EACA,IAAA4G,WAAA,2BAEAjmJ,EAAAi3I,EAAA+O,KACAvzJ,GAAA44B,EAAA,IAhBA,IAiBArrB,IAAAqrB,GAjBA,IAkBArrB,GAAA1T,KAAAy5J,IAAA,EAAA16H,GACAA,GAAA,QACArrB,GArBA,KAyBA,OAFA03I,EAAA2H,MAAA2G,EAAAv6J,EAEAgH,iCC1BA,IAAAyzJ,EAAA55J,KAAAy5J,IAAA,EAAA,GACAI,EAAA75J,KAAAy5J,IAAA,EAAA,IACAK,EAAA95J,KAAAy5J,IAAA,EAAA,IACAM,EAAA/5J,KAAAy5J,IAAA,EAAA,IACAO,EAAAh6J,KAAAy5J,IAAA,EAAA,IACAQ,EAAAj6J,KAAAy5J,IAAA,EAAA,IACAS,EAAAl6J,KAAAy5J,IAAA,EAAA,IACAU,EAAAn6J,KAAAy5J,IAAA,EAAA,IACAW,EAAAp6J,KAAAy5J,IAAA,EAAA,IAEAhsO,EAAAC,QAAA,SAAAI,GACA,OACAA,EAAA8rO,EAAA,EACA9rO,EAAA+rO,EAAA,EACA/rO,EAAAgsO,EAAA,EACAhsO,EAAAisO,EAAA,EACAjsO,EAAAksO,EAAA,EACAlsO,EAAAmsO,EAAA,EACAnsO,EAAAosO,EAAA,EACApsO,EAAAqsO,EAAA,EACArsO,EAAAssO,EAAA,EACA,kCCtBA,aAEA,MAAArE,EAAApoO,EAAA,UACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BAYA,SAAA8kP,EAAA9nB,GACA,OAAAnqJ,SAAAiyJ,EAAA9H,EAAA,UAAA,IAXAl9N,EAAAC,QAAA,CACAglP,mBAgBA,SAAA5mI,GACA,IAAA6mI,EAAA7mI,EAAAtT,SAAA,IACAm6I,EAAAtzK,OAAA,GAAA,IACAszK,EAAA,IAAAA,GAEA,OAAAngB,EAAAmgB,EAAA,WApBAF,mBAAAA,EACAL,uBAyBA,SAAAhpJ,GACA,OAAAypI,WAAAhvE,KAAAkyE,EAAAr4H,OAAA+0I,EAAArpJ,MAzBA6oJ,aA+BA,SAAAnmI,GACA,OAAA+mH,WAAAhvE,KAAAkyE,EAAAr4H,OAAAoO,oHC1CA,aAQA,MAAA8mI,UAAAA,GAAAjlP,EAAA,qBACAskP,EAAAtkP,EAAA,UAAAskP,aAEAV,EAAA,GACAC,EAAA,GACAC,EAAA,GAGA,IAAA,MAAAxkP,KAAA2lP,EAAA,CACA,MAAAC,EAAA,EACApjP,EAAAmjP,EAAAC,GACAtB,EAAAsB,GAAAZ,EAAAxiP,GAGA+hP,EADAqB,EAAA/iJ,cAAAxc,QAAA,KAAA,MACA7jF,EAEAgiP,EAAAhiP,KACAgiP,EAAAhiP,GAAAojP,GAIAjlP,OAAAc,OAAA6iP,GACA3jP,OAAAc,OAAA8iP,GACA5jP,OAAAc,OAAA+iP,GACA,MAAAd,EAAA/iP,OAAAc,OAAAkkP,GACAnlP,EAAAC,QAAA,CACA6jP,aAAAA,EACAC,eAAAA,EACAb,WAAAA,EACAc,WAAAA,6ECnCA,aAKA,MAAAmB,EAAAhlP,OAAAc,OAAA,CACAmyG,SAAA,EACAiyI,MAAA,EACAC,MAAA,EACAC,MAAA,EACAC,IAAA,EACAC,IAAA,EACA7Y,KAAA,GACAC,WAAA,GACAC,WAAA,GACAC,WAAA,GACAC,WAAA,GACAC,WAAA,GACAC,WAAA,GACAC,YAAA,GACAC,YAAA,GACAC,aAAA,GACAC,aAAA,GACAC,aAAA,GACAC,aAAA,GACAC,OAAA,GACAiY,KAAA,GACAhY,cAAA,GACAC,aAAA,GACAgY,IAAA,GACAC,QAAA,GACAtmP,KAAA,GACAy7N,WAAA,GACAE,UAAA,GACAJ,UAAA,GACAC,UAAA,GACA+qB,IAAA,GACAC,KAAA,GACAC,KAAA,GACAC,QAAA,GACAC,SAAA,GACAC,KAAA,GACAzvJ,IAAA,GACAm3I,eAAA,GACAuY,IAAA,GACAC,QAAA,GACAC,SAAA,IACAC,WAAA,IACAC,aAAA,IACAC,UAAA,IACAC,eAAA,IACAC,eAAA,IACAC,iBAAA,IACAC,cAAA,IACAC,cAAA,IACAC,KAAA,IACAC,WAAA,IACAC,WAAA,IACAC,YAAA,IACAC,iBAAA,IACAC,cAAA,IACAC,SAAA,IACAC,sBAAA,IACAC,iBAAA,IACAC,iBAAA,IACAC,uBAAA,IACAC,mBAAA,IACAC,gBAAA,IACAC,aAAA,IACAC,6BAAA,IACAC,cAAA,IACAC,WAAA,IACAC,MAAA,IACAC,gBAAA,IACAC,aAAA,IACApa,IAAA,IACAC,IAAA,IACAC,IAAA,IACAma,eAAA,IACAC,YAAA,IACAC,UAAA,IACAC,UAAA,IACAC,WAAA,IACAC,UAAA,IACAC,QAAA,IACAC,gBAAA,IACAC,mBAAA,IACAC,mBAAA,IACAC,aAAA,IACAC,cAAA,IACAC,qBAAA,IACAC,aAAA,IACAC,UAAA,IACAC,iBAAA,IACAC,aAAA,IACAC,IAAA,IACAC,kBAAA,IACAC,oBAAA,IACAC,eAAA,IACAC,cAAA,IACAC,WAAA,IACAC,IAAA,IACAC,IAAA,IACAC,KAAA,IACAC,OAAA,IACAC,IAAA,IACA5xB,KAAA,IACA6xB,MAAA,IACAC,MAAA,IACAC,OAAA,IACAC,SAAA,IACAC,SAAA,IACAC,IAAA,IACAC,KAAA,IACAC,GAAA,IACAC,IAAA,IACAC,qBAAA,IACAlvB,KAAA,IACAiB,KAAA,IACAkuB,YAAA,IACAC,qBAAA,IACAzc,2BAAA,KACAC,aAAA,KACAC,aAAA,KACAC,aAAA,KACAC,aAAA,KACAC,IAAA,KACAqc,WAAA,KACAC,WAAA,KACAC,WAAA,KACAC,YAAA,KACAC,WAAA,KACAC,eAAA,KACAzc,eAAA,KACAC,UAAA,MACAC,YAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,YAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,aAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,aAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,aAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,cAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,cAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,eAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,KACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,gBAAA,MACAC,iBAAA,MACAC,iBAAA,MACAC,iBAAA,MACAC,iBAAA,MACAC,4BAAA,MACAC,+BAAA,MACAuI,wBAAA,MACAC,0BAAA,MACAC,wBAAA,MACAC,mBAAA,QACAC,mBAAA,QACAC,mBAAA,QACAC,mBAAA,QACAC,mBAAA,SACAC,mBAAA,SACAC,YAAA,WAGAzrP,EAAAC,QAAA,CAAAklP,UAAAA,iCCvdA,aAEA,MAAAzgB,EAAAxkO,EAAA,eAEA+iP,EAAA,CASAY,mBAAA,SAAAF,GACA,GAAA,MAAAA,EACA,MAAA,iCAGA,GAAA,IAAAA,EAAAtzI,SAAA,IAAAszI,EAAAtzI,QACA,MAAA,oDAGA,GAAA,iBAAAszI,EAAArc,MACA,MAAA,uBAGA,GAAA,IAAAqc,EAAAtzI,QAAA,CACA,GAAA,WAAAszI,EAAArc,MACA,MAAA,mCAEA,GAAA,cAAAqc,EAAAN,cACA,MAAA,8CAIA,KAAAM,EAAA1oB,qBAAAmK,YACA,MAAA,iCAGA,IACAV,EAAAkE,SAAA+a,EAAA1oB,WACA,MAAA70H,GACA,IAAAw9I,EAAAx9I,EAAA9f,QAIA,OAHAs9J,IACAA,EAAA,+BAEAA,KAKA5jP,EAAAC,QAAAgjP,iDCnDA,aA0BAjjP,EAAAC,QAlBA,SAAAuzE,EAAAyS,GACA,GAAAzS,IAAAyS,EACA,OAAA,EAGA,GAAAzS,EAAAu3J,aAAA9kJ,EAAA8kJ,WACA,OAAA,EAGA,IAAA,IAAAj3J,EAAA,EAAAA,EAAAN,EAAAu3J,WAAAj3J,IACA,GAAAN,EAAAM,KAAAmS,EAAAnS,GACA,OAAA,EAIA,OAAA,iCCvBA,aAEA,MAAA43K,EAAAxrP,EAAA,UACAA,EAAA,uBACAA,EAAA,sBACA,MAAAyrP,EAAAzrP,EAAA,wBACA0rP,EAAA1rP,EAAA,YACA6kO,EAAA7kO,EAAA,2BAEA2rP,EAAA3rP,EAAA,cAEA4rP,EAAA,CACAC,IAAA7rP,EAAA,eACA8rP,QAAA9rP,EAAA,mBACA+rP,UAAA/rP,EAAA,oBAAAA,CAAAwrP,EAAAxrP,EAAA,qBAGAgsP,EACA,6DADAA,EAEA,sBAGA,SAAAC,EAAA14K,GACA,MAAA9xE,EAAAmqP,EAAAr4K,EAAAsC,eACA,IAAAp0E,EAAA,CACA,MAAAyqP,EAAAjsP,OAAAW,KAAAgrP,GAAA70K,KAAA,OACA,MAAA20K,EAAA,IAAAnmJ,MAAA,mCAAAhyB,cAAA24K,KAAA,4BAEA,OAAAzqP,EAIA,MA6CAgmO,EAAA1nF,MAAAi9E,IACA,MAAAyI,EAAA+lB,EAAAW,WAAAt7I,OAAAmsH,GACA7jE,EAAAssE,EAAA2mB,KAEA,OAAA3mB,EAAA4mB,MACA,KAAAb,EAAAc,QAAAC,IACA,OAAAX,EAAAC,IAAAW,uBAAArzF,GACA,KAAAqyF,EAAAc,QAAAG,QACA,OAAAb,EAAAE,QAAAY,2BAAAvzF,GACA,KAAAqyF,EAAAc,QAAAK,UACA,GAAAf,EAAAG,UACA,OAAAH,EAAAG,UAAAa,6BAAAzzF,GAEA,MAAAuyF,EAAA,IAAAnmJ,MAAAymJ,GAAAA,GAEA,QACAC,EAAAxmB,EAAA4mB,QAkCAvsP,EAAAC,QAAA,CACA6rP,cAAAA,EACAJ,QAAAA,EACAqB,aAAA7sP,EAAA,mBACA8sP,yBAAA9sP,EAAA,oBACA8mO,gBApGA/mF,MAAAxsE,EAAAszJ,IACAolB,EAAA14K,GAAAuzJ,gBAAAD,GAoGAkmB,wBA/FAhtG,MAAAxsE,EAAAy5K,EAAAnmB,KACA,MAAAplO,EAAAwqP,EAAA14K,GACA,GAAA,YAAAA,EAAAsC,cACA,MAAA61K,EAAA,IAAAnmJ,MAAA,6DAAA,uCAEA,OAAA9jG,EAAAsrP,wBAAAC,EAAAnmB,IA2FAnB,mBAtFA1I,IACA,MAAAyI,EAAA+lB,EAAAyB,UAAAp8I,OAAAmsH,GACA7jE,EAAAssE,EAAA2mB,KAEA,OAAA3mB,EAAA4mB,MACA,KAAAb,EAAAc,QAAAC,IACA,OAAAX,EAAAC,IAAAqB,sBAAA/zF,GACA,KAAAqyF,EAAAc,QAAAG,QACA,OAAAb,EAAAE,QAAAqB,0BAAAh0F,GACA,KAAAqyF,EAAAc,QAAAK,UACA,GAAAf,EAAAG,UACA,OAAAH,EAAAG,UAAAqB,4BAAAj0F,GAEA,MAAAuyF,EAAA,IAAAnmJ,MAAAymJ,GAAAA,GAEA,QACAC,EAAAxmB,EAAA4mB,QAuEAzmB,iBAlEA,CAAAnkO,EAAA8xE,KAEA04K,EADA14K,GAAAA,GAAA,OAAAsC,eAEAp0E,EAAA2jO,OAgEAqC,oBAAAA,EACA5B,kBAvCA,CAAApkO,EAAA8xE,KAEA04K,EADA14K,GAAAA,GAAA,OAAAsC,eAEAp0E,EAAA2jO,OAqCAioB,OA7BAttG,MAAAutG,EAAA1pB,KACA,IACA,MAAAniO,QAAAkqP,EAAA0B,OAAAC,EAAA1pB,GACA,OAAA6D,EAAAhmO,GACA,MAAAmmF,IAKA,MAAAnmF,EAAAgqP,EAAA8B,IAAAC,qBAAAF,EAAA1pB,GACA,GAAA,OAAAniO,EACA,MAAAiqP,EAAA,IAAAnmJ,MAAA,2EAAA,0BAEA,IAAAkoJ,EAAAhC,EAAAiC,KAAAC,MAAAlC,EAAA8B,IAAAK,iBAAAnsP,IAEA,OADAgsP,EAAA5oB,EAAA4oB,EAAAI,WAAA,SACAjC,EAAAC,IAAAW,uBAAAiB,kXC3HA,aAEA,IAiBAK,EAAAjkJ,EAjBAkkJ,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,wBAAAN,EAAAM,MAAA,sBAAA,IAUA1mD,EAAA2kD,SACAwB,EAAA,IAAAjkJ,EAAA5pG,OAAAU,OAAAmtP,IACAA,EAAA,GAAA,OAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,WAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,aAAA,EACAjkJ,GAGA89F,EAAAslD,UAAA,WAkBA,SAAAA,EAAAt5K,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAsJA,OA7IAq5K,EAAA7iJ,UAAAiiJ,KAAA,EAQAY,EAAA7iJ,UAAAgiJ,KAAAgC,EAAAG,UAAA,IAWAtB,EAAAl9I,OAAA,SAAApkB,EAAAulI,GAKA,OAJAA,IACAA,EAAAg9B,EAAAvtP,UACAuwN,EAAAs9B,OAAA,GAAAC,MAAA9iK,EAAA0gK,MACAn7B,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAygK,MACAl7B,GAcA+7B,EAAAp8I,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAslD,UACAxyI,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAA0gK,KAAA5xI,EAAAg0I,QACA,MACA,KAAA,EACA9iK,EAAAygK,KAAA3xI,EAAA2qH,QACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,IAAA7/D,EAAAsb,eAAA,QACA,MAAAmnJ,EAAAO,cAAA,0BAAA,CAAAr/E,SAAA3jF,IACA,IAAAA,EAAAsb,eAAA,QACA,MAAAmnJ,EAAAO,cAAA,0BAAA,CAAAr/E,SAAA3jF,IACA,OAAAA,GAWAshK,EAAA2B,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAslD,UACA,OAAA5iH,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAslD,UACA,OAAA5iH,EAAAgiH,MACA,IAAA,MACA,KAAA,EACA1gK,EAAA0gK,KAAA,EACA,MACA,IAAA,UACA,KAAA,EACA1gK,EAAA0gK,KAAA,EACA,MACA,IAAA,YACA,KAAA,EACA1gK,EAAA0gK,KAAA,EASA,OANA,MAAAhiH,EAAA+hH,OACA,iBAAA/hH,EAAA+hH,KACAgC,EAAA99I,OAAAO,OAAAw5B,EAAA+hH,KAAAzgK,EAAAygK,KAAAgC,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA+hH,OAAA,GACA/hH,EAAA+hH,KAAA16K,SACAia,EAAAygK,KAAA/hH,EAAA+hH,OAEAzgK,GAYAshK,EAAA4B,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAiBA,OAhBAsyC,EAAAuiC,WACA70E,EAAAgiH,KAAA1vE,EAAAp5C,QAAAzwD,OAAA,MAAA,EACA6pG,EAAAyoD,QAAAtyJ,OACAu3D,EAAA+hH,KAAA,IAEA/hH,EAAA+hH,KAAA,GACAzvE,EAAAyoD,QAAA96H,QACA+/B,EAAA+hH,KAAAgC,EAAAG,UAAAlkH,EAAA+hH,SAGA,MAAAzgK,EAAA0gK,MAAA1gK,EAAAsb,eAAA,UACAojC,EAAAgiH,KAAA1vE,EAAAp5C,QAAAzwD,OAAA60H,EAAA2kD,QAAA3gK,EAAA0gK,MAAA1gK,EAAA0gK,MAEA,MAAA1gK,EAAAygK,MAAAzgK,EAAAsb,eAAA,UACAojC,EAAA+hH,KAAAzvE,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAygK,KAAA,EAAAzgK,EAAAygK,KAAA16K,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAygK,MAAAzgK,EAAAygK,MAEA/hH,GAUA4iH,EAAA7iJ,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGA7B,EA5KA,GA+KAtlD,EAAAwkD,WAAA,WAkBA,SAAAA,EAAAx4K,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAsJA,OA7IAu4K,EAAA/hJ,UAAAiiJ,KAAA,EAQAF,EAAA/hJ,UAAAgiJ,KAAAgC,EAAAG,UAAA,IAWApC,EAAAp8I,OAAA,SAAApkB,EAAAulI,GAKA,OAJAA,IACAA,EAAAg9B,EAAAvtP,UACAuwN,EAAAs9B,OAAA,GAAAC,MAAA9iK,EAAA0gK,MACAn7B,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAygK,MACAl7B,GAcAi7B,EAAAt7I,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAwkD,WACA1xI,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAA0gK,KAAA5xI,EAAAg0I,QACA,MACA,KAAA,EACA9iK,EAAAygK,KAAA3xI,EAAA2qH,QACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,IAAA7/D,EAAAsb,eAAA,QACA,MAAAmnJ,EAAAO,cAAA,0BAAA,CAAAr/E,SAAA3jF,IACA,IAAAA,EAAAsb,eAAA,QACA,MAAAmnJ,EAAAO,cAAA,0BAAA,CAAAr/E,SAAA3jF,IACA,OAAAA,GAWAwgK,EAAAyC,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAwkD,WACA,OAAA9hH,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAwkD,WACA,OAAA9hH,EAAAgiH,MACA,IAAA,MACA,KAAA,EACA1gK,EAAA0gK,KAAA,EACA,MACA,IAAA,UACA,KAAA,EACA1gK,EAAA0gK,KAAA,EACA,MACA,IAAA,YACA,KAAA,EACA1gK,EAAA0gK,KAAA,EASA,OANA,MAAAhiH,EAAA+hH,OACA,iBAAA/hH,EAAA+hH,KACAgC,EAAA99I,OAAAO,OAAAw5B,EAAA+hH,KAAAzgK,EAAAygK,KAAAgC,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA+hH,OAAA,GACA/hH,EAAA+hH,KAAA16K,SACAia,EAAAygK,KAAA/hH,EAAA+hH,OAEAzgK,GAYAwgK,EAAA0C,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAiBA,OAhBAsyC,EAAAuiC,WACA70E,EAAAgiH,KAAA1vE,EAAAp5C,QAAAzwD,OAAA,MAAA,EACA6pG,EAAAyoD,QAAAtyJ,OACAu3D,EAAA+hH,KAAA,IAEA/hH,EAAA+hH,KAAA,GACAzvE,EAAAyoD,QAAA96H,QACA+/B,EAAA+hH,KAAAgC,EAAAG,UAAAlkH,EAAA+hH,SAGA,MAAAzgK,EAAA0gK,MAAA1gK,EAAAsb,eAAA,UACAojC,EAAAgiH,KAAA1vE,EAAAp5C,QAAAzwD,OAAA60H,EAAA2kD,QAAA3gK,EAAA0gK,MAAA1gK,EAAA0gK,MAEA,MAAA1gK,EAAAygK,MAAAzgK,EAAAsb,eAAA,UACAojC,EAAA+hH,KAAAzvE,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAygK,KAAA,EAAAzgK,EAAAygK,KAAA16K,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAygK,MAAAzgK,EAAAygK,MAEA/hH,GAUA8hH,EAAA/hJ,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGA3C,EA5KA,GA+KArsP,EAAAC,QAAA4nM,4DCvXA,aACA7nM,EAAAC,QAAAC,EAAA,kFCHA,aACA,IAAA+lP,EAAAhmP,EA2BA,SAAAgvP,IACAhJ,EAAA15I,KAAA2iJ,aACAjJ,EAAAoI,OAAAa,WAAAjJ,EAAAkJ,cACAlJ,EAAAkI,OAAAe,WAAAjJ,EAAAmJ,cAtBAnJ,EAAAoJ,MAAA,UAGApJ,EAAAoI,OAAAnuP,EAAA,YACA+lP,EAAAkJ,aAAAjvP,EAAA,mBACA+lP,EAAAkI,OAAAjuP,EAAA,YACA+lP,EAAAmJ,aAAAlvP,EAAA,mBAGA+lP,EAAA15I,KAAArsG,EAAA,kBACA+lP,EAAAqJ,IAAApvP,EAAA,SACA+lP,EAAAsI,MAAAruP,EAAA,WACA+lP,EAAAgJ,UAAAA,EAcAA,sLCnCA,aACAjvP,EAAAC,QAAAouP,EAEA,IAEAc,EAFA5iJ,EAAArsG,EAAA,kBAIAqvP,EAAAhjJ,EAAAgjJ,SACA/+I,EAAAjE,EAAAiE,OACAg/I,EAAAjjJ,EAAAijJ,KAWA,SAAAC,EAAAl+J,EAAAwe,EAAAzJ,GAMAqG,KAAApb,GAAAA,EAMAob,KAAAoD,IAAAA,EAMApD,KAAA5iB,UAAA1nF,EAMAsqG,KAAArG,IAAAA,EAIA,SAAAyuG,KAUA,SAAA11E,EAAAqwH,GAMA/iJ,KAAA36B,KAAA09K,EAAA19K,KAMA26B,KAAA64D,KAAAkqF,EAAAlqF,KAMA74D,KAAAoD,IAAA2/I,EAAA3/I,IAMApD,KAAA5iB,KAAA2lK,EAAAC,OAQA,SAAAtB,IAMA1hJ,KAAAoD,IAAA,EAMApD,KAAA36B,KAAA,IAAAy9K,EAAA16C,EAAA,EAAA,GAMApoG,KAAA64D,KAAA74D,KAAA36B,KAMA26B,KAAAgjJ,OAAA,KASA,IAAA9uP,EAAA,WACA,OAAA0rG,EAAAqjJ,OACA,WACA,OAAAvB,EAAAxtP,OAAA,WACA,OAAA,IAAAsuP,OAIA,WACA,OAAA,IAAAd,IAuCA,SAAAwB,EAAAvpJ,EAAA42H,EAAA34I,GACA24I,EAAA34I,GAAA,IAAA+hB,EAoBA,SAAAwpJ,EAAA//I,EAAAzJ,GACAqG,KAAAoD,IAAAA,EACApD,KAAA5iB,UAAA1nF,EACAsqG,KAAArG,IAAAA,EA8CA,SAAAypJ,EAAAzpJ,EAAA42H,EAAA34I,GACA,KAAA+hB,EAAA0pJ,IACA9yB,EAAA34I,KAAA,IAAA+hB,EAAA2pJ,GAAA,IACA3pJ,EAAA2pJ,IAAA3pJ,EAAA2pJ,KAAA,EAAA3pJ,EAAA0pJ,IAAA,MAAA,EACA1pJ,EAAA0pJ,MAAA,EAEA,KAAA1pJ,EAAA2pJ,GAAA,KACA/yB,EAAA34I,KAAA,IAAA+hB,EAAA2pJ,GAAA,IACA3pJ,EAAA2pJ,GAAA3pJ,EAAA2pJ,KAAA,EAEA/yB,EAAA34I,KAAA+hB,EAAA2pJ,GA2CA,SAAAC,EAAA5pJ,EAAA42H,EAAA34I,GACA24I,EAAA34I,GAAA,IAAA+hB,EACA42H,EAAA34I,EAAA,GAAA+hB,IAAA,EAAA,IACA42H,EAAA34I,EAAA,GAAA+hB,IAAA,GAAA,IACA42H,EAAA34I,EAAA,GAAA+hB,IAAA,GA7JA+nJ,EAAAxtP,OAAAA,IAOAwtP,EAAA8B,MAAA,SAAAvmJ,GACA,OAAA,IAAA2C,EAAA/B,MAAAZ,IAKA2C,EAAA/B,QAAAA,QACA6jJ,EAAA8B,MAAA5jJ,EAAA6jJ,KAAA/B,EAAA8B,MAAA5jJ,EAAA/B,MAAAF,UAAAw+H,WAUAulB,EAAA/jJ,UAAA+lJ,MAAA,SAAA9+J,EAAAwe,EAAAzJ,GAGA,OAFAqG,KAAA64D,KAAA74D,KAAA64D,KAAAz7E,KAAA,IAAA0lK,EAAAl+J,EAAAwe,EAAAzJ,GACAqG,KAAAoD,KAAAA,EACApD,MA8BAmjJ,EAAAxlJ,UAAAnqG,OAAAU,OAAA4uP,EAAAnlJ,WACAwlJ,EAAAxlJ,UAAA/Y,GAxBA,SAAA+U,EAAA42H,EAAA34I,GACA,KAAA+hB,EAAA,KACA42H,EAAA34I,KAAA,IAAA+hB,EAAA,IACAA,KAAA,EAEA42H,EAAA34I,GAAA+hB,GA0BA+nJ,EAAA/jJ,UAAAokJ,OAAA,SAAAruP,GAWA,OARAssG,KAAAoD,MAAApD,KAAA64D,KAAA74D,KAAA64D,KAAAz7E,KAAA,IAAA+lK,GACAzvP,KAAA,GACA,IAAA,EACAA,EAAA,MAAA,EACAA,EAAA,QAAA,EACAA,EAAA,UAAA,EACA,EACAA,IAAA0vG,IACApD,MASA0hJ,EAAA/jJ,UAAAqkJ,MAAA,SAAAtuP,GACA,OAAAA,EAAA,EACAssG,KAAA0jJ,MAAAN,EAAA,GAAAR,EAAAe,WAAAjwP,IACAssG,KAAA+hJ,OAAAruP,IAQAguP,EAAA/jJ,UAAAimJ,OAAA,SAAAlwP,GACA,OAAAssG,KAAA+hJ,QAAAruP,GAAA,EAAAA,GAAA,MAAA,IAsBAguP,EAAA/jJ,UAAAkmJ,OAAA,SAAAnwP,GACA,IAAA0mO,EAAAwoB,EAAAn5F,KAAA/1J,GACA,OAAAssG,KAAA0jJ,MAAAN,EAAAhpB,EAAAn1J,SAAAm1J,IAUAsnB,EAAA/jJ,UAAAmmJ,MAAApC,EAAA/jJ,UAAAkmJ,OAQAnC,EAAA/jJ,UAAAomJ,OAAA,SAAArwP,GACA,IAAA0mO,EAAAwoB,EAAAn5F,KAAA/1J,GAAAswP,WACA,OAAAhkJ,KAAA0jJ,MAAAN,EAAAhpB,EAAAn1J,SAAAm1J,IAQAsnB,EAAA/jJ,UAAAsmJ,KAAA,SAAAvwP,GACA,OAAAssG,KAAA0jJ,MAAAR,EAAA,EAAAxvP,EAAA,EAAA,IAeAguP,EAAA/jJ,UAAAumJ,QAAA,SAAAxwP,GACA,OAAAssG,KAAA0jJ,MAAAH,EAAA,EAAA7vP,IAAA,IASAguP,EAAA/jJ,UAAAwmJ,SAAAzC,EAAA/jJ,UAAAumJ,QAQAxC,EAAA/jJ,UAAAymJ,QAAA,SAAA1wP,GACA,IAAA0mO,EAAAwoB,EAAAn5F,KAAA/1J,GACA,OAAAssG,KAAA0jJ,MAAAH,EAAA,EAAAnpB,EAAAkpB,IAAAI,MAAAH,EAAA,EAAAnpB,EAAAipB,KAUA3B,EAAA/jJ,UAAA0mJ,SAAA3C,EAAA/jJ,UAAAymJ,QAQA1C,EAAA/jJ,UAAA2mJ,MAAA,SAAA5wP,GACA,OAAAssG,KAAA0jJ,MAAA9jJ,EAAA0kJ,MAAAC,aAAA,EAAA7wP,IASAguP,EAAA/jJ,UAAA6mJ,OAAA,SAAA9wP,GACA,OAAAssG,KAAA0jJ,MAAA9jJ,EAAA0kJ,MAAAG,cAAA,EAAA/wP,IAGA,IAAAgxP,EAAA9kJ,EAAA/B,MAAAF,UAAAlc,IACA,SAAAkY,EAAA42H,EAAA34I,GACA24I,EAAA9uI,IAAAkY,EAAA/hB,IAGA,SAAA+hB,EAAA42H,EAAA34I,GACA,IAAA,IAAAzQ,EAAA,EAAAA,EAAAwyB,EAAA10B,SAAAkC,EACAopJ,EAAA34I,EAAAzQ,GAAAwyB,EAAAxyB,IAQAu6K,EAAA/jJ,UAAAg7H,MAAA,SAAAjlO,GACA,IAAA0vG,EAAA1vG,EAAAuxE,SAAA,EACA,IAAAm+B,EACA,OAAApD,KAAA0jJ,MAAAR,EAAA,EAAA,GACA,GAAAtjJ,EAAAhrG,SAAAlB,GAAA,CACA,IAAA68N,EAAAmxB,EAAA8B,MAAApgJ,EAAAS,EAAA5+B,OAAAvxE,IACAmwG,EAAAO,OAAA1wG,EAAA68N,EAAA,GACA78N,EAAA68N,EAEA,OAAAvwH,KAAA+hJ,OAAA3+I,GAAAsgJ,MAAAgB,EAAAthJ,EAAA1vG,IAQAguP,EAAA/jJ,UAAAhC,OAAA,SAAAjoG,GACA,IAAA0vG,EAAAy/I,EAAA59K,OAAAvxE,GACA,OAAA0vG,EACApD,KAAA+hJ,OAAA3+I,GAAAsgJ,MAAAb,EAAA8B,MAAAvhJ,EAAA1vG,GACAssG,KAAA0jJ,MAAAR,EAAA,EAAA,IAQAxB,EAAA/jJ,UAAAinJ,KAAA,WAIA,OAHA5kJ,KAAAgjJ,OAAA,IAAAtwH,EAAA1yB,MACAA,KAAA36B,KAAA26B,KAAA64D,KAAA,IAAAiqF,EAAA16C,EAAA,EAAA,GACApoG,KAAAoD,IAAA,EACApD,MAOA0hJ,EAAA/jJ,UAAAsoE,MAAA,WAUA,OATAjmE,KAAAgjJ,QACAhjJ,KAAA36B,KAAA26B,KAAAgjJ,OAAA39K,KACA26B,KAAA64D,KAAA74D,KAAAgjJ,OAAAnqF,KACA74D,KAAAoD,IAAApD,KAAAgjJ,OAAA5/I,IACApD,KAAAgjJ,OAAAhjJ,KAAAgjJ,OAAA5lK,OAEA4iB,KAAA36B,KAAA26B,KAAA64D,KAAA,IAAAiqF,EAAA16C,EAAA,EAAA,GACApoG,KAAAoD,IAAA,GAEApD,MAOA0hJ,EAAA/jJ,UAAAknJ,OAAA,WACA,IAAAx/K,EAAA26B,KAAA36B,KACAwzF,EAAA74D,KAAA64D,KACAz1D,EAAApD,KAAAoD,IAOA,OANApD,KAAAimE,QAAA87E,OAAA3+I,GACAA,IACApD,KAAA64D,KAAAz7E,KAAA/X,EAAA+X,KACA4iB,KAAA64D,KAAAA,EACA74D,KAAAoD,KAAAA,GAEApD,MAOA0hJ,EAAA/jJ,UAAA87H,OAAA,WAIA,IAHA,IAAAp0J,EAAA26B,KAAA36B,KAAA+X,KACAmzI,EAAAvwH,KAAA2M,YAAA62I,MAAAxjJ,KAAAoD,KACAxrB,EAAA,EACAvS,GACAA,EAAAuf,GAAAvf,EAAAs0B,IAAA42H,EAAA34I,GACAA,GAAAvS,EAAA+9B,IACA/9B,EAAAA,EAAA+X,KAGA,OAAAmzI,GAGAmxB,EAAAa,WAAA,SAAAuC,GACAtC,EAAAsC,EACApD,EAAAxtP,OAAAA,IACAsuP,EAAAD,oEC/cA,gCACI3iJ,EAAOtsG,EA2OX,SAAA27N,EAAe81B,EAAK9oJ,EAAK+oJ,WACZ7wP,EAAOX,OAAOW,KAAK8nG,GAAM90B,EAAI,EAAGA,EAAIhzE,EAAK8wE,SAAUkC,OACnCzxE,IAAjBqvP,EAAI5wP,EAAKgzE,KAAsB69K,IAC/BD,EAAI5wP,EAAKgzE,IAAM80B,EAAI9nG,EAAKgzE,YACzB49K,EAoBX,SAAAE,EAAkBpyP,GAEd,SAAAqyP,EAAqBvrK,EAAS1D,QAEpB+pB,gBAAgBklJ,GAAAA,OAAAA,IACPA,EAAYvrK,EAAS1D,GAKpCziF,OAAOC,eAAeusG,KAAM,UAAA,CAAaxe,IAAK,kBAAoB7H,KAG9Dmf,MAAMqsJ,kBACNrsJ,MAAMqsJ,kBAAkBnlJ,KAAMklJ,GAE9B1xP,OAAOC,eAAeusG,KAAM,QAAA,CAAWtsG,OAAAA,IAAWolG,OAAQ0e,OAAS,KAEnEvhC,GACAg5I,EAAMjvH,KAAM/pB,UAGnBivK,EAAYvnJ,UAAYnqG,OAAOU,OAAO4kG,MAAM6E,YAAYgP,YAAcu4I,EAEvE1xP,OAAOC,eAAeyxP,EAAYvnJ,UAAW,OAAA,CAAUnc,IAAK,kBAAoB3uF,KAEhFqyP,EAAYvnJ,UAAUS,SAAW,kBACtB4B,KAAKntG,KAAO,KAAOmtG,KAAKrmB,SAG5BurK,EA9RXtlJ,EAAKwlJ,UAAY7xP,EAAQ,yBAGzBqsG,EAAKiE,OAAStwG,EAAQ,sBAGtBqsG,EAAKylJ,aAAe9xP,EAAQ,4BAG5BqsG,EAAK0kJ,MAAQ/wP,EAAQ,qBAGrBqsG,EAAK0lJ,QAAU/xP,EAAQ,uBAGvBqsG,EAAKijJ,KAAOtvP,EAAQ,oBAGpBqsG,EAAK6jJ,KAAOlwP,EAAQ,oBAGpBqsG,EAAKgjJ,SAAWrvP,EAAQ,cAOxBqsG,EAAKm0H,OAAS12I,aAA0B,IAAXmiB,GACPA,GACAA,EAAOsyF,SACPtyF,EAAOsyF,QAAQujC,UACf71H,EAAOsyF,QAAQujC,SAASpuJ,MAO9C24B,EAAKJ,OAASI,EAAKm0H,QAAUv0H,GACG,oBAAXD,QAA0BA,QACf,oBAAXD,MAA0BA,MACjCU,KAQdJ,EAAK2lJ,WAAa/xP,OAAOc,OAASd,OAAOc,OAAAA,OAOzCsrG,EAAK4lJ,YAAchyP,OAAOc,OAASd,OAAOc,OAAAA,OAQ1CsrG,EAAK6lJ,UAAYt/K,OAAOs/K,WAAAA,SAA2D/xP,SACvD,iBAAVA,GAAsBgyP,SAAShyP,IAAUkyE,KAAK6nC,MAAM/5G,KAAWA,GAQjFksG,EAAKhrG,SAAW,SAAkBlB,SACN,iBAAVA,GAAsBA,aAAiB2yE,QAQzDu5B,EAAKpmB,SAAW,SAAkB9lF,UACvBA,GAA0B,iBAAVA,GAW3BksG,EAAK+lJ,MAQL/lJ,EAAKzC,MAAQ,SAAe0B,EAAKlmB,OACzBjlF,EAAQmrG,EAAIlmB,WACH,MAATjlF,IAAiBmrG,EAAIrE,eAAe7hB,MACZ,iBAAVjlF,IAAuBmqG,MAAM/gB,QAAQppF,GAASA,EAAMuxE,OAASzxE,OAAOW,KAAKT,GAAOuxE,QAAU,IAehH26B,EAAKqjJ,OAAAA,mBAEOA,EAASrjJ,EAAK0lJ,QAAQ,UAAUrC,cAE7BA,EAAOtlJ,UAAUioJ,UAAY3C,EAAoC,WACnElvP,UAEE,MAPVkvP,GAYLrjJ,EAAKimJ,aAAe,KAGpBjmJ,EAAKkmJ,oBAAsB,KAO3BlmJ,EAAKkiJ,UAAY,SAAmBiE,SAEF,iBAAhBA,EACRnmJ,EAAKqjJ,OACDrjJ,EAAKkmJ,oBAAoBC,GAAAA,IACrBnmJ,EAAK/B,MAAMkoJ,GACnBnmJ,EAAKqjJ,OACDrjJ,EAAKimJ,aAAaE,GACI,oBAAfttB,WACHstB,EAAAA,IACIttB,WAAWstB,IAOjCnmJ,EAAK/B,MAA8B,oBAAf46H,WAA6BA,WAAwC56H,MAezF+B,EAAKomJ,KAAkCpmJ,EAAKJ,OAAOymJ,SAAsCrmJ,EAAKJ,OAAOymJ,QAAQD,MACtEpmJ,EAAKJ,OAAOwmJ,MACvCpmJ,EAAK0lJ,QAAQ,QAOzB1lJ,EAAKsmJ,OAAS,mBAOdtmJ,EAAKumJ,QAAU,wBAOfvmJ,EAAKwmJ,QAAU,6CAOfxmJ,EAAKymJ,WAAa,SAAoB3yP,UAC3BA,EACDksG,EAAKgjJ,SAASn5F,KAAK/1J,GAAO4yP,SAC1B1mJ,EAAKgjJ,SAAS2D,UASxB3mJ,EAAK4mJ,aAAe,SAAsBnzI,EAAMozI,OACxCrsB,EAAOx6H,EAAKgjJ,SAAS8D,SAASrzI,UAC9BzT,EAAKomJ,KACEpmJ,EAAKomJ,KAAKW,SAASvsB,EAAKkpB,GAAIlpB,EAAKipB,GAAIoD,GACzCrsB,EAAKp7H,SAAS3hB,QAAQopK,KAkBjC7mJ,EAAKqvH,MAAQA,EAObrvH,EAAKgnJ,QAAU,SAAiBpxJ,UACrBA,EAAI+C,OAAO,GAAGnvB,cAAgBosB,EAAIsG,UAAU,IA0CvD8D,EAAKqlJ,SAAWA,EAmBhBrlJ,EAAKsiJ,cAAgB+C,EAAS,iBAoB9BrlJ,EAAKinJ,YAAc,SAAkBC,WAC7BC,EAAAA,GACK5/K,EAAI,EAAGA,EAAI2/K,EAAW7hL,SAAUkC,EACrC4/K,EAASD,EAAW3/K,IAAM,SAOvB,mBACMhzE,EAAOX,OAAOW,KAAK6rG,MAAO74B,EAAIhzE,EAAK8wE,OAAS,EAAGkC,GAAK,IAAKA,EAAAA,GACpC,IAAtB4/K,EAAS5yP,EAAKgzE,UAA+BzxE,IAAlBsqG,KAAK7rG,EAAKgzE,KAAuC,OAAlB64B,KAAK7rG,EAAKgzE,IAAQ,OACrEhzE,EAAKgzE,KAiB5By4B,EAAKonJ,YAAc,SAAkBF,UAQ1B,SAASj0P,WACHs0E,EAAI,EAAGA,EAAI2/K,EAAW7hL,SAAUkC,EACjC2/K,EAAW3/K,KAAOt0E,UACXmtG,KAAK8mJ,EAAW3/K,MAoBvCy4B,EAAKyiJ,cAAAA,CACD4E,MAAO5gL,OACPywD,MAAOzwD,OACPsyJ,MAAOtyJ,OACPspJ,MAAM,GAIV/vH,EAAK2iJ,WAAa,eACVU,EAASrjJ,EAAKqjJ,OAEbA,GAMLrjJ,EAAKimJ,aAAe5C,EAAOx5F,OAASgvE,WAAWhvE,MAAQw5F,EAAOx5F,MAAAA,SAErC/1J,EAAO6oO,cACb0mB,EAAOvvP,EAAO6oO,IAEjC38H,EAAKkmJ,oBAAsB7C,EAAOiE,aAAAA,SAEFjqJ,cACbgmJ,EAAOhmJ,KAbtB2C,EAAKimJ,aAAejmJ,EAAKkmJ,oBAAsB,wQCrZvD,aACAzyP,EAAAC,QAmBA,SAAAsxF,EAAAq1F,GACA,IAAA1jG,EAAA,IAAAsnB,MAAAxnB,UAAApR,OAAA,GACAF,EAAA,EACAQ,EAAA,EACA4hL,GAAA,EACA,KAAA5hL,EAAA8Q,UAAApR,QACAsR,EAAAxR,KAAAsR,UAAA9Q,KACA,OAAA,IAAAwgG,SAAA,SAAAC,EAAAu5B,GACAhpH,EAAAxR,GAAA,SAAA00B,GACA,GAAA0tJ,EAEA,GADAA,GAAA,EACA1tJ,EACA8lG,EAAA9lG,OACA,CAGA,IAFA,IAAAljB,EAAA,IAAAsnB,MAAAxnB,UAAApR,OAAA,GACAF,EAAA,EACAA,EAAAwR,EAAAtR,QACAsR,EAAAxR,KAAAsR,UAAAtR,GACAihG,EAAAo9B,MAAA,KAAA7sH,KAIA,IACAqO,EAAAw+G,MAAAnpB,GAAA,KAAA1jG,GACA,MAAAkjB,GACA0tJ,IACAA,GAAA,EACA5nD,EAAA9lG,uCC/CA,aAOA,IAAAoK,EAAAvwG,EAOAuwG,EAAA5+B,OAAA,SAAA02B,GACA,IAAAz0B,EAAAy0B,EAAA12B,OACA,IAAAiC,EACA,OAAA,EAEA,IADA,IAAAjzE,EAAA,IACAizE,EAAA,EAAA,GAAA,MAAAy0B,EAAApD,OAAArxB,MACAjzE,EACA,OAAA2xE,KAAAwhL,KAAA,EAAAzrJ,EAAA12B,QAAA,EAAAhxE,GAUA,IANA,IAAAozP,EAAA,IAAAxpJ,MAAA,IAGAypJ,EAAA,IAAAzpJ,MAAA,KAGA12B,EAAA,EAAAA,EAAA,IACAmgL,EAAAD,EAAAlgL,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,GAAAA,EAAA,EAAAA,EAAA,GAAA,IAAAA,IASA08B,EAAAP,OAAA,SAAAusG,EAAA76H,EAAAhQ,GAMA,IALA,IAIA+5E,EAJA94C,EAAA,KACAwJ,EAAA,GACAtoC,EAAA,EACAmqB,EAAA,EAEAtc,EAAAhQ,GAAA,CACA,IAAAsU,EAAAu2H,EAAA76H,KACA,OAAAsc,GACA,KAAA,EACAme,EAAAtoC,KAAAkgL,EAAA/tK,GAAA,GACAylE,GAAA,EAAAzlE,IAAA,EACAgY,EAAA,EACA,MACA,KAAA,EACAme,EAAAtoC,KAAAkgL,EAAAtoG,EAAAzlE,GAAA,GACAylE,GAAA,GAAAzlE,IAAA,EACAgY,EAAA,EACA,MACA,KAAA,EACAme,EAAAtoC,KAAAkgL,EAAAtoG,EAAAzlE,GAAA,GACAm2B,EAAAtoC,KAAAkgL,EAAA,GAAA/tK,GACAgY,EAAA,EAGAnqB,EAAA,QACA8+B,IAAAA,EAAA,KAAAn7B,KAAAzE,OAAA67C,aAAAkhF,MAAA/8H,OAAAopC,IACAtoC,EAAA,GASA,OANAmqB,IACAme,EAAAtoC,KAAAkgL,EAAAtoG,GACAtvC,EAAAtoC,KAAA,GACA,IAAAmqB,IACAme,EAAAtoC,KAAA,KAEA8+B,GACA9+B,GACA8+B,EAAAn7B,KAAAzE,OAAA67C,aAAAkhF,MAAA/8H,OAAAopC,EAAArqC,MAAA,EAAA+B,KACA8+B,EAAA37B,KAAA,KAEAjE,OAAA67C,aAAAkhF,MAAA/8H,OAAAopC,EAAArqC,MAAA,EAAA+B,KAGA,IAAAogL,EAAA,mBAUA1jJ,EAAAO,OAAA,SAAAzI,EAAAk0G,EAAA9qI,GAIA,IAHA,IAEAg6E,EAFA/pE,EAAAjQ,EACAusB,EAAA,EAEAnqB,EAAA,EAAAA,EAAAw0B,EAAA12B,QAAA,CACA,IAAAwH,EAAAkvB,EAAA1jB,WAAA9Q,KACA,GAAA,KAAAsF,GAAA6kB,EAAA,EACA,MACA,QAAA57F,KAAA+2E,EAAA66K,EAAA76K,IACA,MAAAqsB,MAAAyuJ,GACA,OAAAj2J,GACA,KAAA,EACAytD,EAAAtyE,EACA6kB,EAAA,EACA,MACA,KAAA,EACAu+G,EAAA9qI,KAAAg6E,GAAA,GAAA,GAAAtyE,IAAA,EACAsyE,EAAAtyE,EACA6kB,EAAA,EACA,MACA,KAAA,EACAu+G,EAAA9qI,MAAA,GAAAg6E,IAAA,GAAA,GAAAtyE,IAAA,EACAsyE,EAAAtyE,EACA6kB,EAAA,EACA,MACA,KAAA,EACAu+G,EAAA9qI,MAAA,EAAAg6E,IAAA,EAAAtyE,EACA6kB,EAAA,GAIA,GAAA,IAAAA,EACA,MAAAwH,MAAAyuJ,GACA,OAAAxiL,EAAAiQ,GAQA6uB,EAAAp+B,KAAA,SAAAk2B,GACA,MAAA,mEAAAl2B,KAAAk2B,kCCzIA,aASA,SAAA0pJ,IAOArlJ,KAAAwnJ,WAAA,GAfAn0P,EAAAC,QAAA+xP,EAyBAA,EAAA1nJ,UAAA3vB,GAAA,SAAAy5K,EAAA7iK,EAAAq1F,GAKA,OAJAj6E,KAAAwnJ,WAAAC,KAAAznJ,KAAAwnJ,WAAAC,GAAA,KAAA38K,KAAA,CACA8Z,GAAAA,EACAq1F,IAAAA,GAAAj6E,OAEAA,MASAqlJ,EAAA1nJ,UAAA43H,IAAA,SAAAkyB,EAAA7iK,GACA,QAAAlvF,IAAA+xP,EACAznJ,KAAAwnJ,WAAA,QAEA,QAAA9xP,IAAAkvF,EACAob,KAAAwnJ,WAAAC,GAAA,QAGA,IADA,IAAAh7C,EAAAzsG,KAAAwnJ,WAAAC,GACAtgL,EAAA,EAAAA,EAAAslI,EAAAxnI,QACAwnI,EAAAtlI,GAAAyd,KAAAA,EACA6nH,EAAAhiI,OAAAtD,EAAA,KAEAA,EAGA,OAAA64B,MASAqlJ,EAAA1nJ,UAAAk7E,KAAA,SAAA4uE,GACA,IAAAh7C,EAAAzsG,KAAAwnJ,WAAAC,GACA,GAAAh7C,EAAA,CAGA,IAFA,IAAAr2H,EAAA,GACAjP,EAAA,EACAA,EAAAkP,UAAApR,QACAmR,EAAAtL,KAAAuL,UAAAlP,MACA,IAAAA,EAAA,EAAAA,EAAAslI,EAAAxnI,QACAwnI,EAAAtlI,GAAAyd,GAAAw+G,MAAAqJ,EAAAtlI,KAAA8yG,IAAA7jG,GAEA,OAAA4pB,oCC1EA,aAuFA,SAAA8hE,EAAAxuK,GAwNA,MArNA,oBAAAo0P,aAAA,WAEA,IAAAC,EAAA,IAAAD,aAAA,EAAA,IACAE,EAAA,IAAAnvB,WAAAkvB,EAAA93C,QACAz+E,EAAA,MAAAw2H,EAAA,GAEA,SAAAC,EAAAluJ,EAAA42H,EAAA34I,GACA+vK,EAAA,GAAAhuJ,EACA42H,EAAA34I,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GAGA,SAAAE,EAAAnuJ,EAAA42H,EAAA34I,GACA+vK,EAAA,GAAAhuJ,EACA42H,EAAA34I,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GAQA,SAAAG,EAAAx3B,EAAA34I,GAKA,OAJAgwK,EAAA,GAAAr3B,EAAA34I,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACA+vK,EAAA,GAGA,SAAAK,EAAAz3B,EAAA34I,GAKA,OAJAgwK,EAAA,GAAAr3B,EAAA34I,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACA+vK,EAAA,GAjBAr0P,EAAAixP,aAAAnzH,EAAAy2H,EAAAC,EAEAx0P,EAAA20P,aAAA72H,EAAA02H,EAAAD,EAmBAv0P,EAAA40P,YAAA92H,EAAA22H,EAAAC,EAEA10P,EAAA60P,YAAA/2H,EAAA42H,EAAAD,EA9CA,GAiDA,WAEA,SAAAK,EAAAC,EAAA1uJ,EAAA42H,EAAA34I,GACA,IAAA0wK,EAAA3uJ,EAAA,EAAA,EAAA,EAGA,GAFA2uJ,IACA3uJ,GAAAA,GACA,IAAAA,EACA0uJ,EAAA,EAAA1uJ,EAAA,EAAA,EAAA,WAAA42H,EAAA34I,QACA,GAAAsnB,MAAAvF,GACA0uJ,EAAA,WAAA93B,EAAA34I,QACA,GAAA+hB,EAAA,qBACA0uJ,GAAAC,GAAA,GAAA,cAAA,EAAA/3B,EAAA34I,QACA,GAAA+hB,EAAA,sBACA0uJ,GAAAC,GAAA,GAAA1iL,KAAAuoC,MAAAxU,EAAA,yBAAA,EAAA42H,EAAA34I,OACA,CACA,IAAA88B,EAAA9uC,KAAA6nC,MAAA7nC,KAAAymJ,IAAA1yH,GAAA/zB,KAAA2iL,KAEAF,GAAAC,GAAA,GAAA5zI,EAAA,KAAA,GADA,QAAA9uC,KAAAuoC,MAAAxU,EAAA/zB,KAAAy5J,IAAA,GAAA3qH,GAAA,YACA,EAAA67G,EAAA34I,IAOA,SAAA4wK,EAAAC,EAAAl4B,EAAA34I,GACA,IAAA8wK,EAAAD,EAAAl4B,EAAA34I,GACA0wK,EAAA,GAAAI,GAAA,IAAA,EACAh0I,EAAAg0I,IAAA,GAAA,IACAC,EAAA,QAAAD,EACA,OAAA,MAAAh0I,EACAi0I,EACAC,IACAN,GAAAj8I,EAAAA,GACA,IAAAqI,EACA,qBAAA4zI,EAAAK,EACAL,EAAA1iL,KAAAy5J,IAAA,EAAA3qH,EAAA,MAAAi0I,EAAA,SAdAr1P,EAAAixP,aAAA6D,EAAAzvJ,KAAA,KAAAkwJ,GACAv1P,EAAA20P,aAAAG,EAAAzvJ,KAAA,KAAAmwJ,GAgBAx1P,EAAA40P,YAAAM,EAAA7vJ,KAAA,KAAAowJ,GACAz1P,EAAA60P,YAAAK,EAAA7vJ,KAAA,KAAAqwJ,GAvCA,GA4CA,oBAAAC,aAAA,WAEA,IAAAC,EAAA,IAAAD,aAAA,EAAA,IACArB,EAAA,IAAAnvB,WAAAywB,EAAAr5C,QACAz+E,EAAA,MAAAw2H,EAAA,GAEA,SAAAuB,EAAAxvJ,EAAA42H,EAAA34I,GACAsxK,EAAA,GAAAvvJ,EACA42H,EAAA34I,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GAGA,SAAAwB,EAAAzvJ,EAAA42H,EAAA34I,GACAsxK,EAAA,GAAAvvJ,EACA42H,EAAA34I,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GACAr3B,EAAA34I,EAAA,GAAAgwK,EAAA,GAQA,SAAAyB,EAAA94B,EAAA34I,GASA,OARAgwK,EAAA,GAAAr3B,EAAA34I,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAsxK,EAAA,GAGA,SAAAI,EAAA/4B,EAAA34I,GASA,OARAgwK,EAAA,GAAAr3B,EAAA34I,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAgwK,EAAA,GAAAr3B,EAAA34I,EAAA,GACAsxK,EAAA,GAzBA51P,EAAAmxP,cAAArzH,EAAA+3H,EAAAC,EAEA91P,EAAAi2P,cAAAn4H,EAAAg4H,EAAAD,EA2BA71P,EAAAk2P,aAAAp4H,EAAAi4H,EAAAC,EAEAh2P,EAAAm2P,aAAAr4H,EAAAk4H,EAAAD,EA9DA,GAiEA,WAEA,SAAAK,EAAArB,EAAAsB,EAAAC,EAAAjwJ,EAAA42H,EAAA34I,GACA,IAAA0wK,EAAA3uJ,EAAA,EAAA,EAAA,EAGA,GAFA2uJ,IACA3uJ,GAAAA,GACA,IAAAA,EACA0uJ,EAAA,EAAA93B,EAAA34I,EAAA+xK,GACAtB,EAAA,EAAA1uJ,EAAA,EAAA,EAAA,WAAA42H,EAAA34I,EAAAgyK,QACA,GAAA1qJ,MAAAvF,GACA0uJ,EAAA,EAAA93B,EAAA34I,EAAA+xK,GACAtB,EAAA,WAAA93B,EAAA34I,EAAAgyK,QACA,GAAAjwJ,EAAA,sBACA0uJ,EAAA,EAAA93B,EAAA34I,EAAA+xK,GACAtB,GAAAC,GAAA,GAAA,cAAA,EAAA/3B,EAAA34I,EAAAgyK,OACA,CACA,IAAAjB,EACA,GAAAhvJ,EAAA,uBAEA0uJ,GADAM,EAAAhvJ,EAAA,UACA,EAAA42H,EAAA34I,EAAA+xK,GACAtB,GAAAC,GAAA,GAAAK,EAAA,cAAA,EAAAp4B,EAAA34I,EAAAgyK,OACA,CACA,IAAAl1I,EAAA9uC,KAAA6nC,MAAA7nC,KAAAymJ,IAAA1yH,GAAA/zB,KAAA2iL,KACA,OAAA7zI,IACAA,EAAA,MAEA2zI,EAAA,kBADAM,EAAAhvJ,EAAA/zB,KAAAy5J,IAAA,GAAA3qH,MACA,EAAA67G,EAAA34I,EAAA+xK,GACAtB,GAAAC,GAAA,GAAA5zI,EAAA,MAAA,GAAA,QAAAi0I,EAAA,WAAA,EAAAp4B,EAAA34I,EAAAgyK,KAQA,SAAAC,EAAApB,EAAAkB,EAAAC,EAAAr5B,EAAA34I,GACA,IAAA0rK,EAAAmF,EAAAl4B,EAAA34I,EAAA+xK,GACAtG,EAAAoF,EAAAl4B,EAAA34I,EAAAgyK,GACAtB,EAAA,GAAAjF,GAAA,IAAA,EACA3uI,EAAA2uI,IAAA,GAAA,KACAsF,EAAA,YAAA,QAAAtF,GAAAC,EACA,OAAA,OAAA5uI,EACAi0I,EACAC,IACAN,GAAAj8I,EAAAA,GACA,IAAAqI,EACA,OAAA4zI,EAAAK,EACAL,EAAA1iL,KAAAy5J,IAAA,EAAA3qH,EAAA,OAAAi0I,EAAA,kBAfAr1P,EAAAmxP,cAAAiF,EAAA/wJ,KAAA,KAAAkwJ,EAAA,EAAA,GACAv1P,EAAAi2P,cAAAG,EAAA/wJ,KAAA,KAAAmwJ,EAAA,EAAA,GAiBAx1P,EAAAk2P,aAAAK,EAAAlxJ,KAAA,KAAAowJ,EAAA,EAAA,GACAz1P,EAAAm2P,aAAAI,EAAAlxJ,KAAA,KAAAqwJ,EAAA,EAAA,GAnDA,GAuDA11P,EAKA,SAAAu1P,EAAAlvJ,EAAA42H,EAAA34I,GACA24I,EAAA34I,GAAA,IAAA+hB,EACA42H,EAAA34I,EAAA,GAAA+hB,IAAA,EAAA,IACA42H,EAAA34I,EAAA,GAAA+hB,IAAA,GAAA,IACA42H,EAAA34I,EAAA,GAAA+hB,IAAA,GAGA,SAAAmvJ,EAAAnvJ,EAAA42H,EAAA34I,GACA24I,EAAA34I,GAAA+hB,IAAA,GACA42H,EAAA34I,EAAA,GAAA+hB,IAAA,GAAA,IACA42H,EAAA34I,EAAA,GAAA+hB,IAAA,EAAA,IACA42H,EAAA34I,EAAA,GAAA,IAAA+hB,EAGA,SAAAovJ,EAAAx4B,EAAA34I,GACA,OAAA24I,EAAA34I,GACA24I,EAAA34I,EAAA,IAAA,EACA24I,EAAA34I,EAAA,IAAA,GACA24I,EAAA34I,EAAA,IAAA,MAAA,EAGA,SAAAoxK,EAAAz4B,EAAA34I,GACA,OAAA24I,EAAA34I,IAAA,GACA24I,EAAA34I,EAAA,IAAA,GACA24I,EAAA34I,EAAA,IAAA,EACA24I,EAAA34I,EAAA,MAAA,EA3UAvkF,EAAAC,QAAAwuK,EAAAA,kDCFA,aASA,SAAAwjF,QAAAwE,YACA,IACA,IAAAxnG,IAAAynG,KAAA,QAAA7wK,QAAA,IAAA,MAAA6wK,CAAAD,YACA,GAAAxnG,MAAAA,IAAAr9E,QAAAzxE,OAAAW,KAAAmuJ,KAAAr9E,QACA,OAAAq9E,IACA,MAAAvuJ,IACA,OAAA,KAdAV,OAAAC,QAAAgyP,sCCDA,aAOA,IAAAzC,EAAAvvP,EAOAuvP,EAAA59K,OAAA,SAAA02B,GAGA,IAFA,IAAAyH,EAAA,EACA32B,EAAA,EACAtF,EAAA,EAAAA,EAAAw0B,EAAA12B,SAAAkC,GACAsF,EAAAkvB,EAAA1jB,WAAA9Q,IACA,IACAi8B,GAAA,EACA32B,EAAA,KACA22B,GAAA,EACA,QAAA,MAAA32B,IAAA,QAAA,MAAAkvB,EAAA1jB,WAAA9Q,EAAA,OACAA,EACAi8B,GAAA,GAEAA,GAAA,EAEA,OAAAA,GAUAy/I,EAAA7xB,KAAA,SAAAnhB,EAAA76H,EAAAhQ,GAEA,GADAA,EAAAgQ,EACA,EACA,MAAA,GAKA,IAJA,IAGA+pE,EAHA94C,EAAA,KACAwJ,EAAA,GACAtoC,EAAA,EAEA6N,EAAAhQ,IACA+5E,EAAA8wD,EAAA76H,MACA,IACAy6B,EAAAtoC,KAAA43E,EACAA,EAAA,KAAAA,EAAA,IACAtvC,EAAAtoC,MAAA,GAAA43E,IAAA,EAAA,GAAA8wD,EAAA76H,KACA+pE,EAAA,KAAAA,EAAA,KACAA,IAAA,EAAAA,IAAA,IAAA,GAAA8wD,EAAA76H,OAAA,IAAA,GAAA66H,EAAA76H,OAAA,EAAA,GAAA66H,EAAA76H,MAAA,MACAy6B,EAAAtoC,KAAA,OAAA43E,GAAA,IACAtvC,EAAAtoC,KAAA,OAAA,KAAA43E,IAEAtvC,EAAAtoC,MAAA,GAAA43E,IAAA,IAAA,GAAA8wD,EAAA76H,OAAA,EAAA,GAAA66H,EAAA76H,KACA7N,EAAA,QACA8+B,IAAAA,EAAA,KAAAn7B,KAAAzE,OAAA67C,aAAAkhF,MAAA/8H,OAAAopC,IACAtoC,EAAA,GAGA,OAAA8+B,GACA9+B,GACA8+B,EAAAn7B,KAAAzE,OAAA67C,aAAAkhF,MAAA/8H,OAAAopC,EAAArqC,MAAA,EAAA+B,KACA8+B,EAAA37B,KAAA,KAEAjE,OAAA67C,aAAAkhF,MAAA/8H,OAAAopC,EAAArqC,MAAA,EAAA+B,KAUA07K,EAAA8B,MAAA,SAAAhpJ,EAAAk0G,EAAA9qI,GAIA,IAHA,IACAiwH,EACAE,EAFAlgH,EAAAjQ,EAGAoC,EAAA,EAAAA,EAAAw0B,EAAA12B,SAAAkC,GACA6tH,EAAAr5F,EAAA1jB,WAAA9Q,IACA,IACA0oI,EAAA9qI,KAAAiwH,EACAA,EAAA,MACA6a,EAAA9qI,KAAAiwH,GAAA,EAAA,IACA6a,EAAA9qI,KAAA,GAAAiwH,EAAA,KACA,QAAA,MAAAA,IAAA,QAAA,OAAAE,EAAAv5F,EAAA1jB,WAAA9Q,EAAA,MACA6tH,EAAA,QAAA,KAAAA,IAAA,KAAA,KAAAE,KACA/tH,EACA0oI,EAAA9qI,KAAAiwH,GAAA,GAAA,IACA6a,EAAA9qI,KAAAiwH,GAAA,GAAA,GAAA,IACA6a,EAAA9qI,KAAAiwH,GAAA,EAAA,GAAA,IACA6a,EAAA9qI,KAAA,GAAAiwH,EAAA,MAEA6a,EAAA9qI,KAAAiwH,GAAA,GAAA,IACA6a,EAAA9qI,KAAAiwH,GAAA,EAAA,GAAA,IACA6a,EAAA9qI,KAAA,GAAAiwH,EAAA,KAGA,OAAAjwH,EAAAiQ,iCCvGA,aACA3hF,EAAAC,QA6BA,SAAAkwP,EAAAp+K,EAAA63B,GACA,IAAA+sJ,EAAA/sJ,GAAA,KACAgtJ,EAAAD,IAAA,EACAE,EAAA,KACAnlL,EAAAilL,EACA,OAAA,SAAA/sJ,GACA,GAAAA,EAAA,GAAAA,EAAAgtJ,EACA,OAAAzG,EAAAvmJ,GACAl4B,EAAAk4B,EAAA+sJ,IACAE,EAAA1G,EAAAwG,GACAjlL,EAAA,GAEA,IAAAwrJ,EAAAnrJ,EAAAw4B,KAAAssJ,EAAAnlL,EAAAA,GAAAk4B,GAGA,OAFA,EAAAl4B,IACAA,EAAA,GAAA,EAAAA,IACAwrJ,gCC7CA,aACAl9N,EAAAC,QAAAsvP,EAEA,IAAAhjJ,EAAArsG,EAAA,mBAUA,SAAAqvP,EAAAU,EAAAD,GASArjJ,KAAAsjJ,GAAAA,IAAA,EAMAtjJ,KAAAqjJ,GAAAA,IAAA,EAQA,IAAA8G,EAAAvH,EAAAuH,KAAA,IAAAvH,EAAA,EAAA,GAEAuH,EAAAnrJ,SAAA,WAAA,OAAA,GACAmrJ,EAAAnG,SAAAmG,EAAAC,SAAA,WAAA,OAAApqJ,MACAmqJ,EAAAllL,OAAA,WAAA,OAAA,GAOA,IAAAshL,EAAA3D,EAAA2D,SAAA,mBAOA3D,EAAAe,WAAA,SAAAjwP,GACA,GAAA,IAAAA,EACA,OAAAy2P,EACA,IAAA7B,EAAA50P,EAAA,EACA40P,IACA50P,GAAAA,GACA,IAAA4vP,EAAA5vP,IAAA,EACA2vP,GAAA3vP,EAAA4vP,GAAA,aAAA,EAUA,OATAgF,IACAjF,GAAAA,IAAA,EACAC,GAAAA,IAAA,IACAA,EAAA,aACAA,EAAA,IACAD,EAAA,aACAA,EAAA,KAGA,IAAAT,EAAAU,EAAAD,IAQAT,EAAAn5F,KAAA,SAAA/1J,GACA,GAAA,iBAAAA,EACA,OAAAkvP,EAAAe,WAAAjwP,GACA,GAAAksG,EAAAhrG,SAAAlB,GAAA,CAEA,IAAAksG,EAAAomJ,KAGA,OAAApD,EAAAe,WAAAv9K,SAAA1yE,EAAA,KAFAA,EAAAksG,EAAAomJ,KAAAqE,WAAA32P,GAIA,OAAAA,EAAAu6G,KAAAv6G,EAAAw6G,KAAA,IAAA00I,EAAAlvP,EAAAu6G,MAAA,EAAAv6G,EAAAw6G,OAAA,GAAAi8I,GAQAvH,EAAAjlJ,UAAAqB,SAAA,SAAAynJ,GACA,IAAAA,GAAAzmJ,KAAAqjJ,KAAA,GAAA,CACA,IAAAC,EAAA,GAAAtjJ,KAAAsjJ,KAAA,EACAD,GAAArjJ,KAAAqjJ,KAAA,EAGA,OAFAC,IACAD,EAAAA,EAAA,IAAA,KACAC,EAAA,WAAAD,GAEA,OAAArjJ,KAAAsjJ,GAAA,WAAAtjJ,KAAAqjJ,IAQAT,EAAAjlJ,UAAA2sJ,OAAA,SAAA7D,GACA,OAAA7mJ,EAAAomJ,KACA,IAAApmJ,EAAAomJ,KAAA,EAAAhmJ,KAAAsjJ,GAAA,EAAAtjJ,KAAAqjJ,GAAAhmK,QAAAopK,IAEA,CAAAx4I,IAAA,EAAAjO,KAAAsjJ,GAAAp1I,KAAA,EAAAlO,KAAAqjJ,GAAAoD,SAAAppK,QAAAopK,KAGA,IAAAxuK,EAAA5R,OAAAs3B,UAAA1lB,WAOA2qK,EAAA8D,SAAA,SAAArzI,GACA,OAAAA,IAAAkzI,EACA4D,EACA,IAAAvH,GACA3qK,EAAA2lB,KAAAyV,EAAA,GACAp7B,EAAA2lB,KAAAyV,EAAA,IAAA,EACAp7B,EAAA2lB,KAAAyV,EAAA,IAAA,GACAp7B,EAAA2lB,KAAAyV,EAAA,IAAA,MAAA,GAEAp7B,EAAA2lB,KAAAyV,EAAA,GACAp7B,EAAA2lB,KAAAyV,EAAA,IAAA,EACAp7B,EAAA2lB,KAAAyV,EAAA,IAAA,GACAp7B,EAAA2lB,KAAAyV,EAAA,IAAA,MAAA,IAQAuvI,EAAAjlJ,UAAA2oJ,OAAA,WACA,OAAAjgL,OAAA67C,aACA,IAAAliB,KAAAsjJ,GACAtjJ,KAAAsjJ,KAAA,EAAA,IACAtjJ,KAAAsjJ,KAAA,GAAA,IACAtjJ,KAAAsjJ,KAAA,GACA,IAAAtjJ,KAAAqjJ,GACArjJ,KAAAqjJ,KAAA,EAAA,IACArjJ,KAAAqjJ,KAAA,GAAA,IACArjJ,KAAAqjJ,KAAA,KAQAT,EAAAjlJ,UAAAqmJ,SAAA,WACA,IAAAhlB,EAAAh/H,KAAAqjJ,IAAA,GAGA,OAFArjJ,KAAAqjJ,KAAArjJ,KAAAqjJ,IAAA,EAAArjJ,KAAAsjJ,KAAA,IAAAtkB,KAAA,EACAh/H,KAAAsjJ,IAAAtjJ,KAAAsjJ,IAAA,EAAAtkB,KAAA,EACAh/H,MAOA4iJ,EAAAjlJ,UAAAysJ,SAAA,WACA,IAAAprB,IAAA,EAAAh/H,KAAAsjJ,IAGA,OAFAtjJ,KAAAsjJ,KAAAtjJ,KAAAsjJ,KAAA,EAAAtjJ,KAAAqjJ,IAAA,IAAArkB,KAAA,EACAh/H,KAAAqjJ,IAAArjJ,KAAAqjJ,KAAA,EAAArkB,KAAA,EACAh/H,MAOA4iJ,EAAAjlJ,UAAA14B,OAAA,WACA,IAAAslL,EAAAvqJ,KAAAsjJ,GACAkH,GAAAxqJ,KAAAsjJ,KAAA,GAAAtjJ,KAAAqjJ,IAAA,KAAA,EACAoH,EAAAzqJ,KAAAqjJ,KAAA,GACA,OAAA,IAAAoH,EACA,IAAAD,EACAD,EAAA,MACAA,EAAA,IAAA,EAAA,EACAA,EAAA,QAAA,EAAA,EACAC,EAAA,MACAA,EAAA,IAAA,EAAA,EACAA,EAAA,QAAA,EAAA,EACAC,EAAA,IAAA,EAAA,2DCtMA,aACAp3P,EAAAC,QAAAkvP,EAGA,IAAAd,EAAAnuP,EAAA,aACAivP,EAAA7kJ,UAAAnqG,OAAAU,OAAAwtP,EAAA/jJ,YAAAgP,YAAA61I,EAEA,IAAA5iJ,EAAArsG,EAAA,kBAQA,SAAAivP,IACAd,EAAA9jJ,KAAAoC,MAwCA,SAAA0qJ,EAAA/wJ,EAAA42H,EAAA34I,GACA+hB,EAAA10B,OAAA,GACA26B,EAAAijJ,KAAA8B,MAAAhrJ,EAAA42H,EAAA34I,GACA24I,EAAAq1B,UACAr1B,EAAAq1B,UAAAjsJ,EAAA/hB,GAEA24I,EAAAo0B,MAAAhrJ,EAAA/hB,GA3CA4qK,EAAAD,WAAA,WAOAC,EAAAgB,MAAA5jJ,EAAAkmJ,oBAEAtD,EAAAmI,iBAAA/qJ,EAAAqjJ,QAAArjJ,EAAAqjJ,OAAAtlJ,qBAAA86H,YAAA,QAAA74H,EAAAqjJ,OAAAtlJ,UAAAlc,IAAA5uF,KACA,SAAA8mG,EAAA42H,EAAA34I,GACA24I,EAAA9uI,IAAAkY,EAAA/hB,IAIA,SAAA+hB,EAAA42H,EAAA34I,GACA,GAAA+hB,EAAA18F,KACA08F,EAAA18F,KAAAszN,EAAA34I,EAAA,EAAA+hB,EAAA10B,aACA,IAAA,IAAAkC,EAAA,EAAAA,EAAAwyB,EAAA10B,QACAsrJ,EAAA34I,KAAA+hB,EAAAxyB,OAQAq7K,EAAA7kJ,UAAAg7H,MAAA,SAAAjlO,GACAksG,EAAAhrG,SAAAlB,KACAA,EAAAksG,EAAAimJ,aAAAnyP,EAAA,WACA,IAAA0vG,EAAA1vG,EAAAuxE,SAAA,EAIA,OAHA+6B,KAAA+hJ,OAAA3+I,GACAA,GACApD,KAAA0jJ,MAAAlB,EAAAmI,iBAAAvnJ,EAAA1vG,GACAssG,MAeAwiJ,EAAA7kJ,UAAAhC,OAAA,SAAAjoG,GACA,IAAA0vG,EAAAxD,EAAAqjJ,OAAA7kB,WAAA1qO,GAIA,OAHAssG,KAAA+hJ,OAAA3+I,GACAA,GACApD,KAAA0jJ,MAAAgH,EAAAtnJ,EAAA1vG,GACAssG,MAWAwiJ,EAAAD,sFCpFA,aACAlvP,EAAAC,QAAAkuP,EAEA,IAEAiB,EAFA7iJ,EAAArsG,EAAA,kBAIAqvP,EAAAhjJ,EAAAgjJ,SACAC,EAAAjjJ,EAAAijJ,KAGA,SAAA+H,EAAA95B,EAAA+5B,GACA,OAAAtrB,WAAA,uBAAAzO,EAAAl5I,IAAA,OAAAizK,GAAA,GAAA,MAAA/5B,EAAA1tH,KASA,SAAAo+I,EAAA3xC,GAMA7vG,KAAAuwH,IAAA1gB,EAMA7vG,KAAApoB,IAAA,EAMAooB,KAAAoD,IAAAysG,EAAA5qI,OAGA,IA4CAvxE,EA5CAo3P,EAAA,oBAAAryB,WACA,SAAA5oB,GACA,GAAAA,aAAA4oB,YAAA56H,MAAA/gB,QAAA+yH,GACA,OAAA,IAAA2xC,EAAA3xC,GACA,MAAA/2G,MAAA,mBAGA,SAAA+2G,GACA,GAAAhyG,MAAA/gB,QAAA+yH,GACA,OAAA,IAAA2xC,EAAA3xC,GACA,MAAA/2G,MAAA,mBAGA5kG,EAAA,WACA,OAAA0rG,EAAAqjJ,OACA,SAAApzC,GACA,OAAA2xC,EAAAttP,OAAA,SAAA27M,GACA,OAAAjwG,EAAAqjJ,OAAA8H,SAAAl7C,GACA,IAAA4yC,EAAA5yC,GAEAi7C,EAAAj7C,KACAA,IAGAi7C,GAwDA,SAAAE,IAEA,IAAA5wB,EAAA,IAAAwoB,EAAA,EAAA,GACAz7K,EAAA,EACA,KAAA64B,KAAAoD,IAAApD,KAAApoB,IAAA,GAaA,CACA,KAAAzQ,EAAA,IAAAA,EAAA,CAEA,GAAA64B,KAAApoB,KAAAooB,KAAAoD,IACA,MAAAwnJ,EAAA5qJ,MAGA,GADAo6H,EAAAkpB,IAAAlpB,EAAAkpB,IAAA,IAAAtjJ,KAAAuwH,IAAAvwH,KAAApoB,OAAA,EAAAzQ,KAAA,EACA64B,KAAAuwH,IAAAvwH,KAAApoB,OAAA,IACA,OAAAwiJ,EAIA,OADAA,EAAAkpB,IAAAlpB,EAAAkpB,IAAA,IAAAtjJ,KAAAuwH,IAAAvwH,KAAApoB,SAAA,EAAAzQ,KAAA,EACAizJ,EAxBA,KAAAjzJ,EAAA,IAAAA,EAGA,GADAizJ,EAAAkpB,IAAAlpB,EAAAkpB,IAAA,IAAAtjJ,KAAAuwH,IAAAvwH,KAAApoB,OAAA,EAAAzQ,KAAA,EACA64B,KAAAuwH,IAAAvwH,KAAApoB,OAAA,IACA,OAAAwiJ,EAKA,GAFAA,EAAAkpB,IAAAlpB,EAAAkpB,IAAA,IAAAtjJ,KAAAuwH,IAAAvwH,KAAApoB,OAAA,MAAA,EACAwiJ,EAAAipB,IAAAjpB,EAAAipB,IAAA,IAAArjJ,KAAAuwH,IAAAvwH,KAAApoB,OAAA,KAAA,EACAooB,KAAAuwH,IAAAvwH,KAAApoB,OAAA,IACA,OAAAwiJ,EAgBA,GAfAjzJ,EAAA,EAeA64B,KAAAoD,IAAApD,KAAApoB,IAAA,GACA,KAAAzQ,EAAA,IAAAA,EAGA,GADAizJ,EAAAipB,IAAAjpB,EAAAipB,IAAA,IAAArjJ,KAAAuwH,IAAAvwH,KAAApoB,OAAA,EAAAzQ,EAAA,KAAA,EACA64B,KAAAuwH,IAAAvwH,KAAApoB,OAAA,IACA,OAAAwiJ,OAGA,KAAAjzJ,EAAA,IAAAA,EAAA,CAEA,GAAA64B,KAAApoB,KAAAooB,KAAAoD,IACA,MAAAwnJ,EAAA5qJ,MAGA,GADAo6H,EAAAipB,IAAAjpB,EAAAipB,IAAA,IAAArjJ,KAAAuwH,IAAAvwH,KAAApoB,OAAA,EAAAzQ,EAAA,KAAA,EACA64B,KAAAuwH,IAAAvwH,KAAApoB,OAAA,IACA,OAAAwiJ,EAIA,MAAAthI,MAAA,2BAkCA,SAAAmyJ,EAAA16B,EAAAvrJ,GACA,OAAAurJ,EAAAvrJ,EAAA,GACAurJ,EAAAvrJ,EAAA,IAAA,EACAurJ,EAAAvrJ,EAAA,IAAA,GACAurJ,EAAAvrJ,EAAA,IAAA,MAAA,EA+BA,SAAAkmL,IAGA,GAAAlrJ,KAAApoB,IAAA,EAAAooB,KAAAoD,IACA,MAAAwnJ,EAAA5qJ,KAAA,GAEA,OAAA,IAAA4iJ,EAAAqI,EAAAjrJ,KAAAuwH,IAAAvwH,KAAApoB,KAAA,GAAAqzK,EAAAjrJ,KAAAuwH,IAAAvwH,KAAApoB,KAAA,IA3KA4pK,EAAAttP,OAAAA,IAEAstP,EAAA7jJ,UAAAwtJ,OAAAvrJ,EAAA/B,MAAAF,UAAAw+H,UAAAv8H,EAAA/B,MAAAF,UAAAv4B,MAOAo8K,EAAA7jJ,UAAAokJ,QACAruP,EAAA,WACA,WACA,GAAAA,GAAA,IAAAssG,KAAAuwH,IAAAvwH,KAAApoB,QAAA,EAAAooB,KAAAuwH,IAAAvwH,KAAApoB,OAAA,IAAA,OAAAlkF,EACA,GAAAA,GAAAA,GAAA,IAAAssG,KAAAuwH,IAAAvwH,KAAApoB,OAAA,KAAA,EAAAooB,KAAAuwH,IAAAvwH,KAAApoB,OAAA,IAAA,OAAAlkF,EACA,GAAAA,GAAAA,GAAA,IAAAssG,KAAAuwH,IAAAvwH,KAAApoB,OAAA,MAAA,EAAAooB,KAAAuwH,IAAAvwH,KAAApoB,OAAA,IAAA,OAAAlkF,EACA,GAAAA,GAAAA,GAAA,IAAAssG,KAAAuwH,IAAAvwH,KAAApoB,OAAA,MAAA,EAAAooB,KAAAuwH,IAAAvwH,KAAApoB,OAAA,IAAA,OAAAlkF,EACA,GAAAA,GAAAA,GAAA,GAAAssG,KAAAuwH,IAAAvwH,KAAApoB,OAAA,MAAA,EAAAooB,KAAAuwH,IAAAvwH,KAAApoB,OAAA,IAAA,OAAAlkF,EAGA,IAAAssG,KAAApoB,KAAA,GAAAooB,KAAAoD,IAEA,MADApD,KAAApoB,IAAAooB,KAAAoD,IACAwnJ,EAAA5qJ,KAAA,IAEA,OAAAtsG,IAQA8tP,EAAA7jJ,UAAAqkJ,MAAA,WACA,OAAA,EAAAhiJ,KAAA+hJ,UAOAP,EAAA7jJ,UAAAimJ,OAAA,WACA,IAAAlwP,EAAAssG,KAAA+hJ,SACA,OAAAruP,IAAA,IAAA,EAAAA,GAAA,GAqFA8tP,EAAA7jJ,UAAAsmJ,KAAA,WACA,OAAA,IAAAjkJ,KAAA+hJ,UAcAP,EAAA7jJ,UAAAumJ,QAAA,WAGA,GAAAlkJ,KAAApoB,IAAA,EAAAooB,KAAAoD,IACA,MAAAwnJ,EAAA5qJ,KAAA,GAEA,OAAAirJ,EAAAjrJ,KAAAuwH,IAAAvwH,KAAApoB,KAAA,IAOA4pK,EAAA7jJ,UAAAwmJ,SAAA,WAGA,GAAAnkJ,KAAApoB,IAAA,EAAAooB,KAAAoD,IACA,MAAAwnJ,EAAA5qJ,KAAA,GAEA,OAAA,EAAAirJ,EAAAjrJ,KAAAuwH,IAAAvwH,KAAApoB,KAAA,IAmCA4pK,EAAA7jJ,UAAA2mJ,MAAA,WAGA,GAAAtkJ,KAAApoB,IAAA,EAAAooB,KAAAoD,IACA,MAAAwnJ,EAAA5qJ,KAAA,GAEA,IAAAtsG,EAAAksG,EAAA0kJ,MAAA4D,YAAAloJ,KAAAuwH,IAAAvwH,KAAApoB,KAEA,OADAooB,KAAApoB,KAAA,EACAlkF,GAQA8tP,EAAA7jJ,UAAA6mJ,OAAA,WAGA,GAAAxkJ,KAAApoB,IAAA,EAAAooB,KAAAoD,IACA,MAAAwnJ,EAAA5qJ,KAAA,GAEA,IAAAtsG,EAAAksG,EAAA0kJ,MAAAkF,aAAAxpJ,KAAAuwH,IAAAvwH,KAAApoB,KAEA,OADAooB,KAAApoB,KAAA,EACAlkF,GAOA8tP,EAAA7jJ,UAAAg7H,MAAA,WACA,IAAA1zJ,EAAA+6B,KAAA+hJ,SACA/sK,EAAAgrB,KAAApoB,IACA5S,EAAAg7B,KAAApoB,IAAA3S,EAGA,GAAAD,EAAAg7B,KAAAoD,IACA,MAAAwnJ,EAAA5qJ,KAAA/6B,GAGA,OADA+6B,KAAApoB,KAAA3S,EACA44B,MAAA/gB,QAAAkjB,KAAAuwH,KACAvwH,KAAAuwH,IAAAnrJ,MAAA4P,EAAAhQ,GACAgQ,IAAAhQ,EACA,IAAAg7B,KAAAuwH,IAAA5jH,YAAA,GACA3M,KAAAmrJ,OAAAvtJ,KAAAoC,KAAAuwH,IAAAv7I,EAAAhQ,IAOAw8K,EAAA7jJ,UAAAhC,OAAA,WACA,IAAAg9H,EAAA34H,KAAA24H,QACA,OAAAkqB,EAAA7xB,KAAA2H,EAAA,EAAAA,EAAA1zJ,SAQAu8K,EAAA7jJ,UAAAukE,KAAA,SAAAj9F,GACA,GAAA,iBAAAA,EAAA,CAEA,GAAA+6B,KAAApoB,IAAA3S,EAAA+6B,KAAAoD,IACA,MAAAwnJ,EAAA5qJ,KAAA/6B,GACA+6B,KAAApoB,KAAA3S,OAEA,GAEA,GAAA+6B,KAAApoB,KAAAooB,KAAAoD,IACA,MAAAwnJ,EAAA5qJ,YACA,IAAAA,KAAAuwH,IAAAvwH,KAAApoB,QAEA,OAAAooB,MAQAwhJ,EAAA7jJ,UAAAskJ,SAAA,SAAAmJ,GACA,OAAAA,GACA,KAAA,EACAprJ,KAAAkiE,OACA,MACA,KAAA,EACAliE,KAAAkiE,KAAA,GACA,MACA,KAAA,EACAliE,KAAAkiE,KAAAliE,KAAA+hJ,UACA,MACA,KAAA,EACA,KAAA,IAAAqJ,EAAA,EAAAprJ,KAAA+hJ,WACA/hJ,KAAAiiJ,SAAAmJ,GAEA,MACA,KAAA,EACAprJ,KAAAkiE,KAAA,GACA,MAGA,QACA,MAAAppE,MAAA,qBAAAsyJ,EAAA,cAAAprJ,KAAApoB,KAEA,OAAAooB,MAGAwhJ,EAAAe,WAAA,SAAA8I,GACA5I,EAAA4I,EACA7J,EAAAttP,OAAAA,IACAuuP,EAAAF,aAEA,IAAA39J,EAAAgb,EAAAomJ,KAAA,SAAA,WACApmJ,EAAAqvH,MAAAuyB,EAAA7jJ,UAAA,CAEAmmJ,MAAA,WACA,OAAAkH,EAAAptJ,KAAAoC,MAAApb,IAAA,IAGAi/J,OAAA,WACA,OAAAmH,EAAAptJ,KAAAoC,MAAApb,IAAA,IAGAm/J,OAAA,WACA,OAAAiH,EAAAptJ,KAAAoC,MAAAoqJ,WAAAxlK,IAAA,IAGAw/J,QAAA,WACA,OAAA8G,EAAAttJ,KAAAoC,MAAApb,IAAA,IAGAy/J,SAAA,WACA,OAAA6G,EAAAttJ,KAAAoC,MAAApb,IAAA,6DCtZA,aACAvxF,EAAAC,QAAAmvP,EAGA,IAAAjB,EAAAjuP,EAAA,aACAkvP,EAAA9kJ,UAAAnqG,OAAAU,OAAAstP,EAAA7jJ,YAAAgP,YAAA81I,EAEA,IAAA7iJ,EAAArsG,EAAA,kBASA,SAAAkvP,EAAA5yC,GACA2xC,EAAA5jJ,KAAAoC,KAAA6vG,GASA4yC,EAAAF,WAAA,WAEA3iJ,EAAAqjJ,SACAR,EAAA9kJ,UAAAwtJ,OAAAvrJ,EAAAqjJ,OAAAtlJ,UAAAv4B,QAOAq9K,EAAA9kJ,UAAAhC,OAAA,WACA,IAAAyH,EAAApD,KAAA+hJ,SACA,OAAA/hJ,KAAAuwH,IAAA+6B,UACAtrJ,KAAAuwH,IAAA+6B,UAAAtrJ,KAAApoB,IAAAooB,KAAApoB,IAAAhS,KAAAq0B,IAAA+F,KAAApoB,IAAAwrB,EAAApD,KAAAoD,MACApD,KAAAuwH,IAAAnyH,SAAA,QAAA4B,KAAApoB,IAAAooB,KAAApoB,IAAAhS,KAAAq0B,IAAA+F,KAAApoB,IAAAwrB,EAAApD,KAAAoD,OAUAq/I,EAAAF,sFClDA,aAMAjvP,EA6BAi4P,QAAAh4P,EAAA,oECnCA,aACAF,EAAAC,QAAAi4P,EAEA,IAAA3rJ,EAAArsG,EAAA,mBAsCA,SAAAg4P,EAAAC,EAAAC,EAAAC,GAEA,GAAA,mBAAAF,EACA,MAAAzmJ,UAAA,8BAEAnF,EAAAylJ,aAAAznJ,KAAAoC,MAMAA,KAAAwrJ,QAAAA,EAMAxrJ,KAAAyrJ,iBAAApuK,QAAAouK,GAMAzrJ,KAAA0rJ,kBAAAruK,QAAAquK,IA1DAH,EAAA5tJ,UAAAnqG,OAAAU,OAAA0rG,EAAAylJ,aAAA1nJ,YAAAgP,YAAA4+I,EAwEAA,EAAA5tJ,UAAAguJ,QAAA,SAAAA,EAAAvuH,EAAAwuH,EAAAC,EAAAj6B,EAAAv3D,GAEA,IAAAu3D,EACA,MAAA7sH,UAAA,6BAEA,IAAAzF,EAAAU,KACA,IAAAq6D,EACA,OAAAz6D,EAAAwlJ,UAAAuG,EAAArsJ,EAAA89B,EAAAwuH,EAAAC,EAAAj6B,GAEA,GAAAtyH,EAAAksJ,QAKA,IACA,OAAAlsJ,EAAAksJ,QACApuH,EACAwuH,EAAAtsJ,EAAAmsJ,iBAAA,kBAAA,UAAA75B,GAAA6H,UACA,SAAAhgI,EAAAk1H,GAEA,GAAAl1H,EAEA,OADA6F,EAAAu5E,KAAA,QAAAp/E,EAAA2jC,GACAi9B,EAAA5gE,GAGA,GAAA,OAAAk1H,EAAA,CAKA,KAAAA,aAAAk9B,GACA,IACAl9B,EAAAk9B,EAAAvsJ,EAAAosJ,kBAAA,kBAAA,UAAA/8B,GACA,MAAAl1H,GAEA,OADA6F,EAAAu5E,KAAA,QAAAp/E,EAAA2jC,GACAi9B,EAAA5gE,GAKA,OADA6F,EAAAu5E,KAAA,OAAA81C,EAAAvxF,GACAi9B,EAAA,KAAAs0D,GAdArvH,EAAAt6B,KAAA,MAiBA,MAAAy0B,GAGA,OAFA6F,EAAAu5E,KAAA,QAAAp/E,EAAA2jC,QACAytC,YAAA,WAAAxQ,EAAA5gE,KAAA,QAnCAoxE,YAAA,WAAAxQ,EAAAvhE,MAAA,oBAAA,IA6CAyyJ,EAAA5tJ,UAAA34B,IAAA,SAAA8mL,GAOA,OANA9rJ,KAAAwrJ,UACAM,GACA9rJ,KAAAwrJ,QAAA,KAAA,KAAA,MACAxrJ,KAAAwrJ,QAAA,KACAxrJ,KAAA64E,KAAA,OAAA08C,OAEAv1H,6DC5IA,aACA3sG,EAAAC,QAAA,iCCsIA,IAAA0rP,EAAAzrP,EAAA,WACAA,EAAA,UACAA,EAAA,UAGA,IAAA0tP,EAAA5tP,EAAAC,QAAA0rP,EAAAiC,KAAAjC,EAAAiC,MAAA,GAsNA,SAAA8K,EAAApzB,EAAAnzJ,EAAAvxE,GACA,GAAAA,EAAAuxE,EAAA,CACA,IAAA+J,EAAA,IAAAupB,MAAA,+BAIA,MAHAvpB,EAAAy8K,UAAArzB,EAAA1zJ,SACAsK,EAAA/J,UAAAA,EACA+J,EAAA08K,UAAAh4P,EACAs7E,GAvNA0xK,EAAAiL,MAAA,CACAC,UAAA,EACAC,YAAA,GACAC,iBAAA,IACAC,QAAA,KAOArL,EAAArB,KAAA,CACA2M,KAAA,EACAC,QAAA,EACAC,QAAA,EACAC,UAAA,EACAC,YAAA,EACAC,KAAA,EACAC,IAAA,EACAC,MAAA,EACAC,SAAA,EACAC,KAAA,EACAC,WAAA,GACAC,SAAA,GACAC,KAAA,GACAC,KAAA,GACAC,SAAA,GACAC,IAAA,GACAC,gBAAA,GACAC,UAAA,GACAC,QAAA,GACAC,gBAAA,GACAC,UAAA,IAgBA1M,EAAA/sP,OAAA,SAAA05P,EAAA9mL,EAAA+mL,EAAAn6P,EAAAiB,GAQA,GAAAqqP,EAAAp/I,KAAA9iB,QAAAppF,GAAA,CAEA,IADA,IAAA0nG,EAAA,GACAj0B,EAAA,EAAAA,EAAAzzE,EAAAuxE,SAAAkC,OACAzxE,IAAAhC,EAAAyzE,IACAi0B,EAAAtwB,KAAAp3E,EAAAyzE,IAGAzzE,EAAA0nG,EAGA,IAAAyD,EAAA,CACA+uJ,SAAAA,EACA9mL,KAAAA,EACA+mL,YAAAA,EACAC,SAAAD,GAAA7O,EAAAp/I,KAAA9iB,QAAAppF,GACAA,MAAAA,GASA,OAPAiB,GAAA,sBAAAA,IAEAkqG,EAAAkvJ,kBAAAp5P,EAAAo5P,kBAGAlvJ,EAAAnZ,SAAAu7J,EAAAhkP,KAAA4hG,IAEAA,GAYAoiJ,EAAAhkP,KAAA,SAAA4hG,EAAAlqG,GACA,IAAAsI,EAEA,GAAA+hP,EAAAp/I,KAAA9iB,QAAA+hB,GAAA,CACA5hG,EAAA,GACA,IAAA,IAAAkqE,EAAA,EAAAA,EAAA03B,EAAA55B,SAAAkC,EACAlqE,EAAA6tE,KAAAm2K,EAAAhkP,KAAA4hG,EAAA13B,GAAAxyE,IAEA,OAAAsI,EAGA,MAAA,iBAAA4hG,EAEAA,GAGA5hG,EAAA,CACA2wP,SAAA/uJ,EAAA+uJ,SACA9mL,KAAA+3B,EAAA/3B,KACA+mL,YAAAhvJ,EAAAgvJ,YACAC,SAAAjvJ,EAAAivJ,SACAp6P,MAAAutP,EAAAhkP,KAAA4hG,EAAAnrG,MAAAiB,IAEAA,IAAAA,EAAAq5P,2BAEA/wP,EAAA8wP,kBAAAlvJ,EAAAkvJ,mBAEA9wP,IAeAgkP,EAAAjnB,OAAA,SAAAi0B,EAAAC,EAAAv5P,GACA,GAAAqqP,EAAAp/I,KAAA9iB,QAAAmxK,GAAA,CACA,IAAAjP,EAAAp/I,KAAA9iB,QAAAoxK,GACA,OAAA,EAEA,GAAAD,EAAAhpL,SAAAipL,EAAAjpL,OACA,OAAA,EAEA,IAAA,IAAAkC,EAAA,EAAAA,EAAA8mL,EAAAhpL,SAAAkC,EACA,IAAA85K,EAAAjnB,OAAAi0B,EAAA9mL,GAAA+mL,EAAA/mL,IACA,OAAA,EAGA,OAAA,EAGA,UAAA8mL,UAAAC,EACA,OAAA,EAGA,GAAA,iBAAAD,EACA,OAAAA,IAAAC,EAGA,IAAA/xJ,EAAA8xJ,EAAAL,WAAAM,EAAAN,UACAK,EAAAnnL,OAAAonL,EAAApnL,MACAmnL,EAAAJ,cAAAK,EAAAL,aACAI,EAAAH,WAAAI,EAAAJ,UACA7M,EAAAjnB,OAAAi0B,EAAAv6P,MAAAw6P,EAAAx6P,OAKA,OAJAiB,GAAAA,EAAAw5P,2BACAhyJ,EAAAA,GAAA8xJ,EAAAF,oBAAAG,EAAAH,mBAGA5xJ,GAaA8kJ,EAAAmN,kBAAA,SAAA90K,GAGA,IAAA+0K,EAAA/0K,EAAAg1K,UACA,GAAA,MAAAD,EAeA,OATA,IAAAA,EAOA/0K,EAAAi1K,QAAA,IAAAF,IAAA,GAJAA,GA0HA,SAAAG,EAAA71B,EAAAnzJ,EAAAyyI,EAAAtjN,GAEA,IAAAqgF,EAGA+2K,EAAApzB,EAAAnzJ,EAAA,GAGA,IAAAipL,EAAA91B,EAAA21B,UAEA9oL,IAGA,IAAAooL,EAAA,IAAAa,EAGA3nL,EAAA,GAAA2nL,EAGAz5K,EAAA2jJ,EAAA1zJ,SACA,IAiBAvxE,EAEAq6P,EAnBA9oL,EA1GA,SAAA0zJ,EAAAnzJ,GAIA,IAAA6oL,EAAA11B,EAAA21B,UAEA,GADA9oL,IACA,MAAA6oL,EAAA,CAKA,IAAAppL,EAEA,GADA,IAAAopL,EAIA,CAGA,IAAAK,EAAA,IAAAL,EACAtC,EAAApzB,EAAAnzJ,EAAAkpL,GACAzpL,EAAA0zJ,EAAA41B,OAAAG,GAAA,QANAzpL,EAAAopL,EASA,GAAAppL,EAAA,EACA,MAAA,IAAA6zB,MAAA,oBAAA7zB,GAEA,OAAAA,GA+EA0pL,CAAAh2B,EAAAnzJ,GAIA,GAHAA,GAAAwP,EAAA2jJ,EAAA1zJ,cAGAvvE,IAAAuvE,GAAAA,EAAAO,EAAA,CACA,GAAA7wE,EAAAg+H,OAAA,CACA,IAAApjD,EAAA,IAAAupB,MAAA,sCAIA,MAHAvpB,EAAAy8K,UAAArzB,EAAA1zJ,SACAsK,EAAA/J,UAAAA,EACA+J,EAAA08K,UAAAhnL,EACAsK,EAGAtK,EAAAO,EASA,IAAAqoL,EAAA,KAAA,GAAAY,GACA,GAAAZ,EAGA,GADAn6P,EAAA,QACAgC,IAAAuvE,EAEA,OAAA,CAEA,GADA8mL,EAAApzB,EAAAnzJ,EAAA,GACAmzJ,EAAAA,MAAA,KAAAtyJ,OAAA67C,aAAA,EAAA,GAAA,CACAy2G,EAAAyoB,SAAA,GACA57K,GAAA,EACA,MAEAwP,EAAA2jJ,EAAA1zJ,SACAvxE,EAAAo3E,KAAA0jL,EAAA71B,EAAAnzJ,EAAAyyI,EAAA,EAAAtjN,IACA6wE,GAAAwP,EAAA2jJ,EAAA1zJ,cAIA,KAAAA,EAAA,GACA+P,EAAA2jJ,EAAA1zJ,SACAvxE,EAAAo3E,KAAA0jL,EAAA71B,EAAA1zJ,EAAAgzI,EAAA,EAAAtjN,IACA6wE,GAAAwP,EAAA2jJ,EAAA1zJ,SACAA,GAAA+P,EAAA2jJ,EAAA1zJ,SAcA,QARAvvE,IAAAhC,GAAAk6P,IAAA3M,EAAAiL,MAAAC,WACArlL,IAAAm6K,EAAArB,KAAA8M,YACAqB,EAAAp1B,EAAAA,MAAA1zJ,SAMAvvE,IAAAhC,GAAAiB,EAAAi6P,kBACAhB,IAAA3M,EAAAiL,MAAAC,WAGArlL,IAAAm6K,EAAArB,KAAA8M,WACAznL,EAAA,EAAA,CAEA,IAAA4pL,EAAAl2B,EAAA3H,KACA89B,EAAAtpL,EACAupL,EAAA,EAaA,GAZAjoL,IAAAm6K,EAAArB,KAAA8M,YAOAX,EAAApzB,EAAAnzJ,EAAA,GACAupL,EAAAp2B,EAAA21B,UACA9oL,KAGA,IAAAupL,EACA,IAGA/5K,EAAA2jJ,EAAA1zJ,SACA,IAMA6oL,EAAAU,EAAA71B,EAAAnzJ,EAAAyyI,EAAA,EANA,CAEA+2C,QAAAr6P,EAAAq6P,QACAr8H,QAAA,EACAi8H,kBAAA,IAGA76F,EAAA/+E,EAAA2jJ,EAAA1zJ,SACAO,GAAAuuF,EACAjtF,GAAAm6K,EAAArB,KAAA8M,WACA34F,IAKA,IAAA19B,EAAAy3H,EAAAF,SACA75F,IAAA9uF,GACAoxD,IAAA4qH,EAAAiL,MAAAC,WAAA91H,IAAA4qH,EAAAiL,MAAAG,mBACA34P,EAAA,CAAAo6P,IAEA,MAAAmB,SAGAv5P,IAAAhC,IAEAilO,EAAA3H,KAAA69B,EACArpL,EAAAspL,GAIA,QAAAp5P,IAAAhC,EAAA,CAIA,QAAAgC,IAAAuvE,EAAA,CACA,GAAAtwE,EAAAg+H,OACA,MAAA,IAAA75B,MAAA,sDAGA7zB,EAAAO,EAGA,GAAAsB,IAAAm6K,EAAArB,KAAA+N,UAEA,IADAj6P,EAAA,GACAuxE,EAAA,EAAAA,GAAA,EACA8mL,EAAApzB,EAAAnzJ,EAAA,GACA9xE,GAAA2yE,OAAA67C,aAAAy2G,EAAAu2B,YACA1pL,GAAA,OAGA9xE,EAAAilO,EAAAyoB,SAAAn8K,GAKA,IAAAkqL,OAAAz5P,IAAAq4P,EAAA,KAAA,CACAA,kBAAAA,GAIA,OAAA9M,EAAA/sP,OAAA05P,EAAA9mL,EAAA+mL,EAAAn6P,EAAAy7P,GA5MAlO,EAAAmO,QAAA,SAAAz2B,EAAAhkO,GAyBA,YAxBAe,IAAAf,IACAA,EAAA,CACAg+H,QAAA,EACAi8H,kBAAA,IAGA,kBAAAj6P,IACAA,EAAA,CACAg+H,OAAAh+H,EACAi6P,kBAAA,IAGA,WAAAj6P,IACAA,EAAAg+H,QAAA,GAEA,qBAAAh+H,IACAA,EAAAi6P,kBAAA,GAIA,iBAAAj2B,IACAA,EAAAqmB,EAAAp/I,KAAAyvJ,aAAA12B,IAGA61B,EAAA71B,EAAAA,EAAA1zJ,SAAA,EAAAtwE,IA6LAssP,EAAAC,MAAA,SAAAriJ,GACA,IAAA85H,EAAAqmB,EAAAp/I,KAAAyvJ,eAGAZ,EAAA5vJ,EAAA+uJ,SAAA/uJ,EAAA/3B,KAGApzE,EAAAsrP,EAAAp/I,KAAAyvJ,eAGAC,GAAA,EAQA,GAPA,sBAAAzwJ,IACAywJ,GAAA,EACAzwJ,EAAAnZ,WACA4pK,EAAArO,EAAAjnB,OAAAn7H,EAAAA,EAAAnZ,YAIA4pK,EACA57P,EAAA67P,SAAA1wJ,EAAAkvJ,wBACA,GAAAlvJ,EAAAivJ,SAAA,CAIAjvJ,EAAAgvJ,YACAY,GAAA,GAGA/6P,EAAA87P,QAAA,GAIA,IAAA,IAAAroL,EAAA,EAAAA,EAAA03B,EAAAnrG,MAAAuxE,SAAAkC,OACAzxE,IAAAmpG,EAAAnrG,MAAAyzE,IACAzzE,EAAA+7P,UAAAxO,EAAAC,MAAAriJ,EAAAnrG,MAAAyzE,UAKA,GAAA03B,EAAA/3B,OAAAm6K,EAAArB,KAAA+N,UACA,IAAAxmL,EAAA,EAAAA,EAAA03B,EAAAnrG,MAAAuxE,SAAAkC,EACAzzE,EAAAg8P,SAAA7wJ,EAAAnrG,MAAAukF,WAAA9Q,SAMA03B,EAAA/3B,OAAAm6K,EAAArB,KAAA6M,SACA5tJ,EAAAnrG,MAAAuxE,OAAA,IAEA,IAAA45B,EAAAnrG,MAAAukF,WAAA,IACA,IAAA,IAAA4mB,EAAAnrG,MAAAukF,WAAA,KAEA,MAAA4mB,EAAAnrG,MAAAukF,WAAA,IACA,MAAA,IAAA4mB,EAAAnrG,MAAAukF,WAAA,KACAvkF,EAAA67P,SAAA1wJ,EAAAnrG,MAAAmyE,OAAA,IAEAnyE,EAAA67P,SAAA1wJ,EAAAnrG,OASA,GAHAilO,EAAA62B,QAAAf,GAGA/6P,EAAAuxE,UAAA,IAGA0zJ,EAAA62B,QAAA,IAAA97P,EAAAuxE,cACA,CAKA,IAAAm+B,EAAA1vG,EAAAuxE,SACA0qL,EAAA,GACA,GACAA,GAAAtpL,OAAA67C,aAAA,IAAA9e,GACAA,KAAA,QACAA,EAAA,GAIAu1H,EAAA62B,QAAA,IAAAG,EAAA1qL,QAIA,IAAAkC,EAAAwoL,EAAA1qL,OAAA,EAAAkC,GAAA,IAAAA,EACAwxJ,EAAA62B,QAAAG,EAAA13K,WAAA9Q,IAMA,OADAwxJ,EAAA82B,UAAA/7P,GACAilO,GAWAsoB,EAAA2O,SAAA,SAAAC,GAEA,IAOA9zK,EAAA+zK,EAAAp8P,EAAA4lF,EAPA8jB,EAAAyyJ,EAAA/vK,MAAA,KACA64I,EAAAqmB,EAAAp/I,KAAAyvJ,eAGA12B,EAAA62B,QAAA,GAAAppL,SAAAg3B,EAAA,GAAA,IAAAh3B,SAAAg3B,EAAA,GAAA,KAIA,IAAA,IAAAj2B,EAAA,EAAAA,EAAAi2B,EAAAn4B,SAAAkC,EAAA,CAGA4U,GAAA,EACA+zK,EAAA,GACAp8P,EAAA0yE,SAAAg3B,EAAAj2B,GAAA,IACA,GACAmS,EAAA,IAAA5lF,EACAA,KAAA,EAEAqoF,IACAzC,GAAA,KAEAw2K,EAAAhlL,KAAAwO,GACAyC,GAAA,QACAroF,EAAA,GAGA,IAAA,IAAAO,EAAA67P,EAAA7qL,OAAA,EAAAhxE,GAAA,IAAAA,EACA0kO,EAAA62B,QAAAM,EAAA77P,IAIA,OAAA0kO,GAYAsoB,EAAA8O,SAAA,SAAAp3B,GACA,IAAAk3B,EAGA,iBAAAl3B,IACAA,EAAAqmB,EAAAp/I,KAAAyvJ,aAAA12B,IAIA,IAAAr/I,EAAAq/I,EAAA21B,UACAuB,EAAAjqL,KAAA6nC,MAAAn0B,EAAA,IAAA,IAAAA,EAAA,GAKA,IADA,IAAA5lF,EAAA,EACAilO,EAAA1zJ,SAAA,GAEAvxE,IAAA,EAEA,KAHA4lF,EAAAq/I,EAAA21B,WAIA56P,GAAA,IAAA4lF,GAGAu2K,GAAA,KAAAn8P,EAAA4lF,GACA5lF,EAAA,GAIA,OAAAm8P,GAaA5O,EAAA+O,cAAA,SAAAC,GAsBA,IAAAC,EAAA,IAAAnyJ,KAGAoyJ,EAAA/pL,SAAA6pL,EAAApqL,OAAA,EAAA,GAAA,IACAsqL,EAAAA,GAAA,GAAA,KAAAA,EAAA,IAAAA,EACA,IAAAC,EAAAhqL,SAAA6pL,EAAApqL,OAAA,EAAA,GAAA,IAAA,EACAwqL,EAAAjqL,SAAA6pL,EAAApqL,OAAA,EAAA,GAAA,IACAyqL,EAAAlqL,SAAA6pL,EAAApqL,OAAA,EAAA,GAAA,IACA0qL,EAAAnqL,SAAA6pL,EAAApqL,OAAA,EAAA,GAAA,IACA2qL,EAAA,EAGA,GAAAP,EAAAhrL,OAAA,GAAA,CAEA,IAAAwH,EAAAwjL,EAAA13J,OAAA,IACAvzB,EAAA,GAGA,MAAAyH,GAAA,MAAAA,IAEA+jL,EAAApqL,SAAA6pL,EAAApqL,OAAA,GAAA,GAAA,IACAb,GAAA,GAQA,GAHAkrL,EAAAO,eAAAN,EAAAC,EAAAC,GACAH,EAAAQ,YAAAJ,EAAAC,EAAAC,EAAA,GAEAxrL,IAGA,OADAyH,EAAAwjL,EAAA13J,OAAAvzB,KACA,MAAAyH,GAAA,CAEA,IAIA1H,EAAA,GAJAqB,SAAA6pL,EAAApqL,OAAAb,EAAA,EAAA,GAAA,IACAoB,SAAA6pL,EAAApqL,OAAAb,EAAA,EAAA,GAAA,IAIAD,GAAA,IAGA,MAAA0H,EACAyjL,EAAAS,SAAAT,EAAAnrL,GAEAmrL,EAAAS,SAAAT,EAAAnrL,GAKA,OAAAmrL,GAUAjP,EAAA2P,sBAAA,SAAAC,GAyBA,IAAAX,EAAA,IAAAnyJ,KAEA+yJ,EAAA1qL,SAAAyqL,EAAAhrL,OAAA,EAAA,GAAA,IACAuqL,EAAAhqL,SAAAyqL,EAAAhrL,OAAA,EAAA,GAAA,IAAA,EACAwqL,EAAAjqL,SAAAyqL,EAAAhrL,OAAA,EAAA,GAAA,IACAyqL,EAAAlqL,SAAAyqL,EAAAhrL,OAAA,EAAA,GAAA,IACA0qL,EAAAnqL,SAAAyqL,EAAAhrL,OAAA,GAAA,GAAA,IACA2qL,EAAApqL,SAAAyqL,EAAAhrL,OAAA,GAAA,GAAA,IACAkrL,EAAA,EACAhsL,EAAA,EACAisL,GAAA,EAEA,MAAAH,EAAAt4J,OAAAs4J,EAAA5rL,OAAA,KACA+rL,GAAA,GAGA,IAAAhsL,EAAA6rL,EAAA5rL,OAAA,EAAAwH,EAAAokL,EAAAt4J,OAAAvzB,GACA,MAAAyH,GAAA,MAAAA,IAMA1H,EAAA,GAJAqB,SAAAyqL,EAAAhrL,OAAAb,EAAA,EAAA,GAAA,IACAoB,SAAAyqL,EAAAhrL,OAAAb,EAAA,EAAA,GAAA,IAIAD,GAAA,IAGA,MAAA0H,IACA1H,IAAA,GAGAisL,GAAA,GAmBA,MAfA,MAAAH,EAAAt4J,OAAA,MACAw4J,EAAA,IAAA9xJ,WAAA4xJ,EAAAhrL,OAAA,IAAA,KAGAmrL,GACAd,EAAAO,eAAAK,EAAAV,EAAAC,GACAH,EAAAQ,YAAAJ,EAAAC,EAAAC,EAAAO,GAGAb,EAAAS,SAAAT,EAAAnrL,KAEAmrL,EAAAe,YAAAH,EAAAV,EAAAC,GACAH,EAAAgB,SAAAZ,EAAAC,EAAAC,EAAAO,IAGAb,GAcAjP,EAAAkQ,cAAA,SAAAjB,GAEA,GAAA,iBAAAA,EACA,OAAAA,EAGA,IAAAkB,EAAA,GAGAp6B,EAAA,GACAA,EAAAlsJ,MAAA,GAAAolL,EAAAmB,kBAAAxrL,OAAA,IACAmxJ,EAAAlsJ,KAAA,IAAAolL,EAAAoB,cAAA,IACAt6B,EAAAlsJ,KAAA,GAAAolL,EAAAqB,cACAv6B,EAAAlsJ,KAAA,GAAAolL,EAAAsB,eACAx6B,EAAAlsJ,KAAA,GAAAolL,EAAAuB,iBACAz6B,EAAAlsJ,KAAA,GAAAolL,EAAAwB,iBAGA,IAAA,IAAAvqL,EAAA,EAAAA,EAAA6vJ,EAAA/xJ,SAAAkC,EACA6vJ,EAAA7vJ,GAAAlC,OAAA,IACAmsL,GAAA,KAEAA,GAAAp6B,EAAA7vJ,GAIA,OAFAiqL,GAAA,KAYAnQ,EAAA0Q,sBAAA,SAAAzB,GAEA,GAAA,iBAAAA,EACA,OAAAA,EAGA,IAAAkB,EAAA,GAGAp6B,EAAA,GACAA,EAAAlsJ,KAAA,GAAAolL,EAAAmB,kBACAr6B,EAAAlsJ,KAAA,IAAAolL,EAAAoB,cAAA,IACAt6B,EAAAlsJ,KAAA,GAAAolL,EAAAqB,cACAv6B,EAAAlsJ,KAAA,GAAAolL,EAAAsB,eACAx6B,EAAAlsJ,KAAA,GAAAolL,EAAAuB,iBACAz6B,EAAAlsJ,KAAA,GAAAolL,EAAAwB,iBAGA,IAAA,IAAAvqL,EAAA,EAAAA,EAAA6vJ,EAAA/xJ,SAAAkC,EACA6vJ,EAAA7vJ,GAAAlC,OAAA,IACAmsL,GAAA,KAEAA,GAAAp6B,EAAA7vJ,GAIA,OAFAiqL,GAAA,KAaAnQ,EAAA2Q,aAAA,SAAAhkJ,GACA,IAAAwjJ,EAAApS,EAAAp/I,KAAAyvJ,eACA,GAAAzhJ,IAAA,KAAAA,EAAA,IACA,OAAAwjJ,EAAAS,aAAAjkJ,EAAA,GAEA,GAAAA,IAAA,OAAAA,EAAA,MACA,OAAAwjJ,EAAAS,aAAAjkJ,EAAA,IAEA,GAAAA,IAAA,SAAAA,EAAA,QACA,OAAAwjJ,EAAAS,aAAAjkJ,EAAA,IAEA,GAAAA,IAAA,YAAAA,EAAA,WACA,OAAAwjJ,EAAAS,aAAAjkJ,EAAA,IAEA,IAAAr+B,EAAA,IAAAupB,MAAA,sCAEA,MADAvpB,EAAAsgF,QAAAjiD,EACAr+B,GAWA0xK,EAAA6Q,aAAA,SAAAn5B,GAEA,iBAAAA,IACAA,EAAAqmB,EAAAp/I,KAAAyvJ,aAAA12B,IAGA,IAAA1kO,EAAA,EAAA0kO,EAAA1zJ,SACA,GAAAhxE,EAAA,GACA,MAAA,IAAA6kG,MAAA,sCAEA,OAAA6/H,EAAAo5B,aAAA99P,IA0BAgtP,EAAAhlB,SAAA,SAAAp9H,EAAAimE,EAAAktF,EAAAj/H,GACA,IAAAq+H,GAAA,EAGA,GAAAvyJ,EAAA+uJ,WAAA9oF,EAAA8oF,eAAA,IAAA9oF,EAAA,UACAjmE,EAAA/3B,OAAAg+F,EAAAh+F,WAAA,IAAAg+F,EAAA,KA6DA/xC,IACAl0B,EAAA+uJ,WAAA9oF,EAAA8oF,UACA76H,EAAAjoD,KACA,IAAAg6F,EAAAjyK,KAAA,yBACAiyK,EAAA8oF,SAAA,WACA/uJ,EAAA+uJ,SAAA,KAEA/uJ,EAAA/3B,OAAAg+F,EAAAh+F,MACAisD,EAAAjoD,KACA,IAAAg6F,EAAAjyK,KAAA,oBACAiyK,EAAAh+F,KAAA,WAAA+3B,EAAA/3B,KAAA,WArEA,GAAA+3B,EAAAgvJ,cAAA/oF,EAAA+oF,kBACA,IAAA/oF,EAAA,YAAA,CAIA,GAHAssF,GAAA,EAGAtsF,EAAApxK,OAAAsrP,EAAAp/I,KAAA9iB,QAAAgoF,EAAApxK,OAEA,IADA,IAAA49F,EAAA,EACAnqB,EAAA,EAAAiqL,GAAAjqL,EAAA29F,EAAApxK,MAAAuxE,SAAAkC,EACAiqL,EAAAtsF,EAAApxK,MAAAyzE,GAAAy4D,WAAA,EACA/gC,EAAAnrG,MAAA49F,MACA8/J,EAAAnQ,EAAAhlB,SAAAp9H,EAAAnrG,MAAA49F,GAAAwzE,EAAApxK,MAAAyzE,GAAA6qL,EAAAj/H,MAEAzhC,EACAwzE,EAAApxK,MAAAyzE,GAAAy4D,WACAwxH,GAAA,KAGAA,GAAAr+H,GACAA,EAAAjoD,KACA,IAAAg6F,EAAAjyK,KAAA,gBACAiyK,EAAA8oF,SAAA,YACA9oF,EAAAh+F,KAAA,4BACAg+F,EAAApxK,MAAAuxE,OAAA,WACA45B,EAAAnrG,MAAAuxE,OAAA,KAKA,GAAAmsL,GAAAY,EAUA,GATAltF,EAAAktF,UACAA,EAAAltF,EAAAktF,SAAAnzJ,EAAAnrG,OAEAoxK,EAAAmtF,cACAD,EAAAltF,EAAAmtF,aAAApzJ,GAEAimE,EAAAotF,0BAAA,sBAAArzJ,IACAmzJ,EAAAltF,EAAAotF,0BAAArzJ,EAAAkvJ,mBAEAjpF,EAAAqtF,uBAAA,sBAAAtzJ,EAEA,GAAAA,EAAAkvJ,kBAAA9oL,OAAA,EACA+sL,EAAAltF,EAAAqtF,uBAAA,OACA,CAGA,GAAA,IADAtzJ,EAAAkvJ,kBAAA91K,WAAA,GAEA,MAAA,IAAA6gB,MACA,6DAEAk5J,EAAAltF,EAAAqtF,uBAAAtzJ,EAAAkvJ,kBAAA3oL,MAAA,SAIA2tD,GACAA,EAAAjoD,KACA,IAAAg6F,EAAAjyK,KAAA,2BACAiyK,EAAA+oF,YAAA,WACAhvJ,EAAAgvJ,YAAA,KAeA,OAAAuD,GAIA,IAAAgB,EAAA,qBAWAnR,EAAAoR,YAAA,SAAAxzJ,EAAA0H,EAAA+rJ,GACA,IAAAlB,EAAA,GAIAkB,EAAAA,GAAA,GADA/rJ,EAAAA,GAAA,GAIA,IACA6qJ,GAAA,MAKA,IADA,IAAAprK,EAAA,GACA7e,EAAA,EAAAA,EAAAo/B,EAAA+rJ,IAAAnrL,EACA6e,GAAA,IAKA,OADAorK,GAAAprK,EAAA,QACA6Y,EAAA+uJ,UACA,KAAA3M,EAAAiL,MAAAC,UACAiF,GAAA,aACA,MACA,KAAAnQ,EAAAiL,MAAAE,YACAgF,GAAA,eACA,MACA,KAAAnQ,EAAAiL,MAAAG,iBACA+E,GAAA,oBACA,MACA,KAAAnQ,EAAAiL,MAAAI,QACA8E,GAAA,WAIA,GAAAvyJ,EAAA+uJ,WAAA3M,EAAAiL,MAAAC,UAIA,OAHAiF,GAAAvyJ,EAAA/3B,KAGA+3B,EAAA/3B,MACA,KAAAm6K,EAAArB,KAAA2M,KACA6E,GAAA,UACA,MACA,KAAAnQ,EAAArB,KAAA4M,QACA4E,GAAA,aACA,MACA,KAAAnQ,EAAArB,KAAA6M,QACA2E,GAAA,aACA,MACA,KAAAnQ,EAAArB,KAAA8M,UACA0E,GAAA,gBACA,MACA,KAAAnQ,EAAArB,KAAA+M,YACAyE,GAAA,kBACA,MACA,KAAAnQ,EAAArB,KAAAgN,KACAwE,GAAA,UACA,MACA,KAAAnQ,EAAArB,KAAAiN,IACAuE,GAAA,uBACA,MACA,KAAAnQ,EAAArB,KAAAkN,MACAsE,GAAA,uBACA,MACA,KAAAnQ,EAAArB,KAAAmN,SACAqE,GAAA,6BACA,MACA,KAAAnQ,EAAArB,KAAAoN,KACAoE,GAAA,UACA,MACA,KAAAnQ,EAAArB,KAAAqN,WACAmE,GAAA,gBACA,MACA,KAAAnQ,EAAArB,KAAAsN,SACAkE,GAAA,kBACA,MACA,KAAAnQ,EAAArB,KAAAuN,KACAiE,GAAA,UACA,MACA,KAAAnQ,EAAArB,KAAAwN,KACAgE,GAAA,gCACA,MACA,KAAAnQ,EAAArB,KAAAyN,SACA+D,GAAA,cACA,MACA,KAAAnQ,EAAArB,KAAA0N,IACA8D,GAAA,SACA,MACA,KAAAnQ,EAAArB,KAAA2N,gBACA6D,GAAA,sBACA,MACA,KAAAnQ,EAAArB,KAAA2S,UACAnB,GAAA,uBACA,MACA,KAAAnQ,EAAArB,KAAA6N,QACA2D,GAAA,cACA,MACA,KAAAnQ,EAAArB,KAAA8N,gBACA0D,GAAA,sBACA,MACA,KAAAnQ,EAAArB,KAAA+N,UACAyD,GAAA,qBAIAA,GAAAvyJ,EAAA/3B,KAMA,GAHAsqL,GAAA,KACAA,GAAAprK,EAAA,gBAAA6Y,EAAAgvJ,YAAA,KAEAhvJ,EAAAivJ,SAAA,CACA,IAAA0E,EAAA,EACAlhI,EAAA,GACA,IAAAnqD,EAAA,EAAAA,EAAA03B,EAAAnrG,MAAAuxE,SAAAkC,OACAzxE,IAAAmpG,EAAAnrG,MAAAyzE,KACAqrL,GAAA,EACAlhI,GAAA2vH,EAAAoR,YAAAxzJ,EAAAnrG,MAAAyzE,GAAAo/B,EAAA,EAAA+rJ,GACAnrL,EAAA,EAAA03B,EAAAnrG,MAAAuxE,SACAqsD,GAAA,MAIA8/H,GAAAprK,EAAA,eAAAwsK,EAAAlhI,MACA,CAEA,GADA8/H,GAAAprK,EAAA,UACA6Y,EAAA/3B,OAAAm6K,EAAArB,KAAAiN,IAAA,CACA,IAAAgD,EAAA5O,EAAA8O,SAAAlxJ,EAAAnrG,OACA09P,GAAAvB,EACA7Q,EAAA8B,KAAA9B,EAAA8B,IAAA2R,MACA5C,KAAA7Q,EAAA8B,IAAA2R,OACArB,GAAA,KAAApS,EAAA8B,IAAA2R,KAAA5C,GAAA,MAIA,GAAAhxJ,EAAA/3B,OAAAm6K,EAAArB,KAAA6M,QACA,IACA2E,GAAAnQ,EAAA6Q,aAAAjzJ,EAAAnrG,OACA,MAAAu7P,GACAmC,GAAA,KAAApS,EAAAp/I,KAAA8yJ,WAAA7zJ,EAAAnrG,YAEA,GAAAmrG,EAAA/3B,OAAAm6K,EAAArB,KAAA8M,WASA,GAPA7tJ,EAAAnrG,MAAAuxE,OAAA,EAEAmsL,GAAA,KAAApS,EAAAp/I,KAAA8yJ,WAAA7zJ,EAAAnrG,MAAA0xE,MAAA,IAEAgsL,GAAA,SAGAvyJ,EAAAnrG,MAAAuxE,OAAA,EAAA,CACA,IAAA8pL,EAAAlwJ,EAAAnrG,MAAAukF,WAAA,GACA,GAAA82K,EACAqC,GAAA,wBACArC,EAAA,IACAqC,GAAA,KAAArC,EAAA,6BAGAlwJ,EAAA/3B,OAAAm6K,EAAArB,KAAA+M,aACAyF,EAAA3sL,KAAAo5B,EAAAnrG,SACA09P,GAAA,IAAAvyJ,EAAAnrG,MAAA,MAEA09P,GAAA,KAAApS,EAAAp/I,KAAA8yJ,WAAA7zJ,EAAAnrG,QACAmrG,EAAA/3B,OAAAm6K,EAAArB,KAAAuN,KACAiE,GAAApS,EAAAp/I,KAAA+yJ,WAAA9zJ,EAAAnrG,OACAmrG,EAAA/3B,OAAAm6K,EAAArB,KAAA2N,iBACA1uJ,EAAA/3B,OAAAm6K,EAAArB,KAAA2S,UACAnB,GAAAvyJ,EAAAnrG,MACA0+P,EAAA3sL,KAAAo5B,EAAAnrG,OACA09P,GAAA,KAAApS,EAAAp/I,KAAA8yJ,WAAA7zJ,EAAAnrG,OACA,IAAAmrG,EAAAnrG,MAAAuxE,OACAmsL,GAAA,SAEAA,GAAAvyJ,EAAAnrG,MAIA,OAAA09P,oFCv3CA/9P,EAAAC,QAAA,CAEAqB,QAAA,CACAi+P,mBAAA,yFCHI5T,EAAQzrP,EAAQ,WAChBs/P,EAAQt/P,EAAQ,WAGhBqsG,EAAOvsG,EAAOC,QAAU0rP,EAAMp/I,KAAOo/I,EAAMp/I,MAAAA,GA0I/C,SAAAkzJ,EAAyB7+P,MACZ,IAANA,GAAiB,KAANA,GAAkB,KAANA,GAAkB,KAANA,YAC5B6kG,MAAM,yCAA2C7kG,GAe/D,SAAA8+P,EAA0Bz5K,MAIxB0mB,KAAK0sD,KAAO,GAEZ1sD,KAAKgxH,KAAO,EAEI,iBAAN13I,EACR0mB,KAAK0sD,KAAOpzE,UACJsmB,EAAKozJ,cAAc15K,IAAMsmB,EAAKqzJ,kBAAkB35K,WACnC,IAAX2pK,GAA0B3pK,aAAa2pK,EAC/CjjJ,KAAK0sD,KAAOpzE,EAAE8kB,SAAS,mBAInBxB,EAAAA,IAAU67H,WAAWn/I,OAEvB0mB,KAAK0sD,KAAOrmF,OAAO67C,aAAakhF,MAAM,KAAMxmG,SACtC7oG,WACEozE,EAAI,EAAGA,EAAIy1B,EAAI33B,SAAUkC,EAC/B64B,KAAKwvJ,QAAQ5yJ,EAAIz1B,UAIfmS,aAAay5K,GACP,iBAANz5K,GAAoC,iBAAXA,EAAEozE,MACjB,iBAAXpzE,EAAE03I,QAEThxH,KAAK0sD,KAAOpzE,EAAEozE,KACd1sD,KAAKgxH,KAAO13I,EAAE03I,MAIhBhxH,KAAKkzJ,yBAA2B,sBAtLV,IAAZphE,GAA2BA,EAAQla,SAalB,mBAAjBu7E,oBACRvzJ,EAAKuzJ,aAAe,kBAAoBA,aAAa/vD,WAAM1tM,EAAW2gF,iBACtEupB,EAAKg4E,SAAW,SAASvd,UAChB84F,aAAa94F,QAWxBz6D,EAAKuzJ,aAAe,SAAS94F,GAC3BwQ,WAAWxQ,EAAU,IAIF,oBAAX96D,QACsB,mBAAvBA,OAAO6zJ,YAAgB,KAC1B3jL,EAAM,qBACN4jL,EAAAA,GACJzzJ,EAAKuzJ,aAAe,SAAS94F,GAC3Bg5F,EAAUvoL,KAAKuvF,GAGS,IAArBg5F,EAAUpuL,QACXs6B,OAAO6zJ,YAAY3jL,EAAK,MAa5B8vB,OAAO2mE,iBAAiB,WAVxB,SAAiBh9F,MACZA,EAAM6L,SAAWwqB,QAAUr2B,EAAMwjF,OAASj9E,EAAAA,CAC3CvG,EAAM+nG,sBACFh0K,EAAOo2P,EAAUjuL,QACrBiuL,EAAUpuL,OAAS,EACnBhoE,EAAK7I,SAAQ,SAASimK,GACpBA,WAIsC,MAIf,oBAArB+rD,iBAAqB,KAEzB9gD,EAAMvnE,KAAKunE,MACX1mF,GAAO,EACP00K,EAAMn+P,SAASsuK,cAAc,OAC7B4vF,EAAAA,OACAjtC,kBAAiB,eACfnpN,EAAOo2P,EAAUjuL,QACrBiuL,EAAUpuL,OAAS,EACnBhoE,EAAK7I,SAAQ,SAASimK,GACpBA,UAEDmsD,QAAQ8sC,EAAAA,CAAMxzH,YAAY,QACzByzH,EAAkB3zJ,EAAKuzJ,aAC3BvzJ,EAAKuzJ,aAAe,SAAS94F,GACxBt8D,KAAKunE,MAAQA,EAAM,IACpBA,EAAMvnE,KAAKunE,MACXiuF,EAAgBl5F,KAEhBg5F,EAAUvoL,KAAKuvF,GAGS,IAArBg5F,EAAUpuL,QACXquL,EAAIxvF,aAAa,IAAKllF,GAAQA,KAMtCghB,EAAKg4E,SAAWh4E,EAAKuzJ,gBAIvBvzJ,EAAK4zJ,cACgB,IAAZ1hE,GAA2BA,EAAQujC,UAAYvjC,EAAQujC,SAASpuJ,KAOzE24B,EAAK6zJ,YACA7zJ,EAAK4zJ,SACCh0J,EAGc,oBAATF,KAAuBC,OAASD,KAIhDM,EAAK9iB,QAAU+gB,MAAM/gB,SAAAA,SAAoB8wB,SACM,mBAAtCp6G,OAAOmqG,UAAUS,SAASR,KAAKgQ,IAIxChO,EAAKozJ,cAAgB,SAASplJ,SACE,oBAAhBqwH,aAA+BrwH,aAAaqwH,aAI5Dr+H,EAAKqzJ,kBAAoB,SAASrlJ,UACzBA,GAAKhO,EAAKozJ,cAAcplJ,EAAEiiG,cAA4Bn6M,IAAjBk4G,EAAEwwH,YAmBhDx+H,EAAK8zJ,WAAaX,EA8ClBnzJ,EAAKmzJ,iBAAmBA,MAYpBY,EAAiC,KAwhBrC,SAAAC,EAAoBt6K,EAAG3kF,GAErBA,EAAUA,GAAAA,GAGVqrG,KAAKgxH,KAAOr8N,EAAQk/P,YAAc,EAClC7zJ,KAAK8zJ,SAAWn/P,EAAQm/P,UAAY,SAEhCd,EAAgBpzJ,EAAKozJ,cAAc15K,GACnC25K,EAAoBrzJ,EAAKqzJ,kBAAkB35K,MAC5C05K,GAAiBC,SAGhBjzJ,KAAK0sD,KADJsmG,EACItmG,IAAWqnG,SAASz6K,GAKpBozE,IAAWqnG,SAASz6K,EAAEu2H,OAAQv2H,EAAE6kJ,WAAY7kJ,EAAE8kJ,iBAErDp+H,KAAK2kJ,MAAS,gBAAiBhwP,EAC7BA,EAAQq/P,YAAch0J,KAAK0sD,KAAK0xE,YAKpCp+H,KAAK0sD,KAAAA,IAAWqnG,SAAAA,IAAa91B,YAAY,IACzCj+H,KAAK2kJ,MAAQ,EAEVrrK,MAAAA,GACD0mB,KAAKuvJ,SAASj2K,GAGb,gBAAiB3kF,IAClBqrG,KAAK2kJ,MAAQhwP,EAAQq/P,aAzjBzBp0J,EAAKmzJ,iBAAiBp1J,UAAUs2J,2BAA6B,SAASrmJ,GACpE5N,KAAKkzJ,0BAA4BtlJ,EAC9B5N,KAAKkzJ,yBAA2BS,IAEjC3zJ,KAAK0sD,KAAK7mF,OAAO,EAAG,GACpBm6B,KAAKkzJ,yBAA2B,IASpCtzJ,EAAKmzJ,iBAAiBp1J,UAAU14B,OAAS,kBAChC+6B,KAAK0sD,KAAKznF,OAAS+6B,KAAKgxH,MAQjCpxH,EAAKmzJ,iBAAiBp1J,UAAUu2J,QAAU,kBACjCl0J,KAAK/6B,UAAY,GAU1B26B,EAAKmzJ,iBAAiBp1J,UAAU6xJ,QAAU,SAASl2K,UAC1C0mB,KAAKuvJ,SAASlpL,OAAO67C,aAAa5oC,KAW3CsmB,EAAKmzJ,iBAAiBp1J,UAAUw2J,aAAe,SAAS76K,EAAGrlF,GACzDqlF,EAAIjT,OAAO67C,aAAa5oC,WACpBskD,EAAI59B,KAAK0sD,KACPz4J,EAAI,GACD,EAAJA,IACD2pI,GAAKtkD,IAEPrlF,KAAO,GACA,IACLqlF,GAAKA,UAGT0mB,KAAK0sD,KAAO9uB,EACZ59B,KAAKi0J,2BAA2BhgQ,GACzB+rG,MAUTJ,EAAKmzJ,iBAAiBp1J,UAAU4xJ,SAAW,SAAS52B,UAClD34H,KAAK0sD,MAAQisE,EACb34H,KAAKi0J,2BAA2Bt7B,EAAM1zJ,QAC/B+6B,MAUTJ,EAAKmzJ,iBAAiBp1J,UAAUy2J,UAAY,SAAS5+J,UAC5CwK,KAAKuvJ,SAAS3vJ,EAAKy0J,WAAW7+J,KAUvCoK,EAAKmzJ,iBAAiBp1J,UAAU+xJ,SAAW,SAASvoL,UAC3C64B,KAAKuvJ,SACVlpL,OAAO67C,aAAa/6C,GAAK,EAAI,KAC7Bd,OAAO67C,aAAiB,IAAJ/6C,KAUxBy4B,EAAKmzJ,iBAAiBp1J,UAAU22J,SAAW,SAASntL,UAC3C64B,KAAKuvJ,SACVlpL,OAAO67C,aAAa/6C,GAAK,GAAK,KAC9Bd,OAAO67C,aAAa/6C,GAAK,EAAI,KAC7Bd,OAAO67C,aAAiB,IAAJ/6C,KAUxBy4B,EAAKmzJ,iBAAiBp1J,UAAU42J,SAAW,SAASptL,UAC3C64B,KAAKuvJ,SACVlpL,OAAO67C,aAAa/6C,GAAK,GAAK,KAC9Bd,OAAO67C,aAAa/6C,GAAK,GAAK,KAC9Bd,OAAO67C,aAAa/6C,GAAK,EAAI,KAC7Bd,OAAO67C,aAAiB,IAAJ/6C,KAUxBy4B,EAAKmzJ,iBAAiBp1J,UAAU62J,WAAa,SAASrtL,UAC7C64B,KAAKuvJ,SACVlpL,OAAO67C,aAAiB,IAAJ/6C,GACpBd,OAAO67C,aAAa/6C,GAAK,EAAI,OAUjCy4B,EAAKmzJ,iBAAiBp1J,UAAU82J,WAAa,SAASttL,UAC7C64B,KAAKuvJ,SACVlpL,OAAO67C,aAAiB,IAAJ/6C,GACpBd,OAAO67C,aAAa/6C,GAAK,EAAI,KAC7Bd,OAAO67C,aAAa/6C,GAAK,GAAK,OAUlCy4B,EAAKmzJ,iBAAiBp1J,UAAU+2J,WAAa,SAASvtL,UAC7C64B,KAAKuvJ,SACVlpL,OAAO67C,aAAiB,IAAJ/6C,GACpBd,OAAO67C,aAAa/6C,GAAK,EAAI,KAC7Bd,OAAO67C,aAAa/6C,GAAK,GAAK,KAC9Bd,OAAO67C,aAAa/6C,GAAK,GAAK,OAWlCy4B,EAAKmzJ,iBAAiBp1J,UAAUg3J,OAAS,SAASxtL,EAAGlzE,GACnD6+P,EAAgB7+P,OACZ0kO,EAAQ,MAEV1kO,GAAK,EACL0kO,GAAStyJ,OAAO67C,aAAc/6C,GAAKlzE,EAAK,WAClCA,EAAI,UACL+rG,KAAKuvJ,SAAS52B,IAYvB/4H,EAAKmzJ,iBAAiBp1J,UAAUk0J,aAAe,SAAS1qL,EAAGlzE,UAEtDkzE,EAAI,IACLA,GAAK,GAAMlzE,EAAI,GAEV+rG,KAAK20J,OAAOxtL,EAAGlzE,IAUxB2rG,EAAKmzJ,iBAAiBp1J,UAAU8xJ,UAAY,SAAS5/C,UAC5C7vG,KAAKuvJ,SAAS1/C,EAAOuxC,aAQ9BxhJ,EAAKmzJ,iBAAiBp1J,UAAU2wJ,QAAU,kBACjCtuJ,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,SASnCpxH,EAAKmzJ,iBAAiBp1J,UAAUuxJ,SAAW,eACrCkC,EACFpxJ,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,OAAS,EACnChxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,UACnChxH,KAAKgxH,MAAQ,EACNogC,GASTxxJ,EAAKmzJ,iBAAiBp1J,UAAUi3J,SAAW,eACrCxD,EACFpxJ,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,OAAS,GACnChxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,IAAM,EACvChxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,UACnChxH,KAAKgxH,MAAQ,EACNogC,GASTxxJ,EAAKmzJ,iBAAiBp1J,UAAUk3J,SAAW,eACrCzD,EACFpxJ,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,OAAS,GACnChxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,IAAM,GACvChxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,IAAM,EACvChxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,UACnChxH,KAAKgxH,MAAQ,EACNogC,GASTxxJ,EAAKmzJ,iBAAiBp1J,UAAUm3J,WAAa,eACvC1D,EACFpxJ,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,MAC1BhxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,IAAM,SACzChxH,KAAKgxH,MAAQ,EACNogC,GASTxxJ,EAAKmzJ,iBAAiBp1J,UAAUo3J,WAAa,eACvC3D,EACFpxJ,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,MAC1BhxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,IAAM,EACvChxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,IAAM,UACzChxH,KAAKgxH,MAAQ,EACNogC,GASTxxJ,EAAKmzJ,iBAAiBp1J,UAAUq3J,WAAa,eACvC5D,EACFpxJ,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,MAC1BhxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,IAAM,EACvChxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,IAAM,GACvChxH,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO,IAAM,UACzChxH,KAAKgxH,MAAQ,EACNogC,GAWTxxJ,EAAKmzJ,iBAAiBp1J,UAAU4wJ,OAAS,SAASt6P,GAChD6+P,EAAgB7+P,OACZm9P,EAAO,KAGTA,GAAQA,GAAQ,GAAKpxJ,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,QAC/C/8N,GAAK,QACCA,EAAI,UACLm9P,GAWTxxJ,EAAKmzJ,iBAAiBp1J,UAAUo0J,aAAe,SAAS99P,OAElD25G,EAAI5N,KAAKuuJ,OAAOt6P,GAChB0xE,EAAM,GAAM1xE,EAAI,SACjB25G,GAAKjoC,IACNioC,GAAKjoC,GAAO,GAEPioC,GAYThO,EAAKmzJ,iBAAiBp1J,UAAUyjJ,SAAW,SAAS79J,OAC9C6tK,SACD7tK,GAEDA,EAAQ3d,KAAKq0B,IAAI+F,KAAK/6B,SAAUse,GAChC6tK,EAAOpxJ,KAAK0sD,KAAKtnF,MAAM46B,KAAKgxH,KAAMhxH,KAAKgxH,KAAOztI,GAC9Cyc,KAAKgxH,MAAQztI,GACK,IAAVA,EACR6tK,EAAO,IAGPA,EAAsB,IAAdpxJ,KAAKgxH,KAAchxH,KAAK0sD,KAAO1sD,KAAK0sD,KAAKtnF,MAAM46B,KAAKgxH,MAC5DhxH,KAAKotD,SAEAgkG,GAWTxxJ,EAAKmzJ,iBAAiBp1J,UAAUg7H,MAAQ,SAASp1I,eACrB,IAAXA,EACbyc,KAAK0sD,KAAKtnF,MAAM46B,KAAKgxH,MACrBhxH,KAAK0sD,KAAKtnF,MAAM46B,KAAKgxH,KAAMhxH,KAAKgxH,KAAOztI,IAU3Cqc,EAAKmzJ,iBAAiBp1J,UAAUyK,GAAK,SAASjhC,UACrC64B,KAAK0sD,KAAKz0E,WAAW+nB,KAAKgxH,KAAO7pJ,IAW1Cy4B,EAAKmzJ,iBAAiBp1J,UAAUs3J,MAAQ,SAAS9tL,EAAGmS,UAClD0mB,KAAK0sD,KAAO1sD,KAAK0sD,KAAK7mF,OAAO,EAAGm6B,KAAKgxH,KAAO7pJ,GAC1Cd,OAAO67C,aAAa5oC,GACpB0mB,KAAK0sD,KAAK7mF,OAAOm6B,KAAKgxH,KAAO7pJ,EAAI,GAC5B64B,MAQTJ,EAAKmzJ,iBAAiBp1J,UAAU5hB,KAAO,kBAC9BikB,KAAK0sD,KAAKz0E,WAAW+nB,KAAK0sD,KAAKznF,OAAS,IAQjD26B,EAAKmzJ,iBAAiBp1J,UAAU1gG,KAAO,eACjCwvE,EAAImzB,EAAKyvJ,aAAarvJ,KAAK0sD,aAC/BjgF,EAAEukJ,KAAOhxH,KAAKgxH,KACPvkJ,GAQTmzB,EAAKmzJ,iBAAiBp1J,UAAUu3J,QAAU,kBACrCl1J,KAAKgxH,KAAO,IACbhxH,KAAK0sD,KAAO1sD,KAAK0sD,KAAKtnF,MAAM46B,KAAKgxH,MACjChxH,KAAKgxH,KAAO,GAEPhxH,MAQTJ,EAAKmzJ,iBAAiBp1J,UAAUyvD,MAAQ,kBACtCptD,KAAK0sD,KAAO,GACZ1sD,KAAKgxH,KAAO,EACLhxH,MAUTJ,EAAKmzJ,iBAAiBp1J,UAAUw3J,SAAW,SAAS5xK,OAC9C6f,EAAMx9B,KAAKD,IAAI,EAAGq6B,KAAK/6B,SAAWse,UACtCyc,KAAK0sD,KAAO1sD,KAAK0sD,KAAK7mF,OAAOm6B,KAAKgxH,KAAM5tH,GACxCpD,KAAKgxH,KAAO,EACLhxH,MAQTJ,EAAKmzJ,iBAAiBp1J,UAAUy3J,MAAQ,mBAClChE,EAAO,GACHjqL,EAAI64B,KAAKgxH,KAAM7pJ,EAAI64B,KAAK0sD,KAAKznF,SAAUkC,EAAAA,KACzCmS,EAAI0mB,KAAK0sD,KAAKz0E,WAAW9Q,GAC1BmS,EAAI,KACL83K,GAAQ,KAEVA,GAAQ93K,EAAE8kB,SAAS,WAEdgzJ,GAQTxxJ,EAAKmzJ,iBAAiBp1J,UAAUS,SAAW,kBAClCwB,EAAK+yJ,WAAW3yJ,KAAK24H,UAwE9B/4H,EAAKg0J,WAAaA,EAOlBh0J,EAAKg0J,WAAWj2J,UAAU14B,OAAS,kBAC1B+6B,KAAK2kJ,MAAQ3kJ,KAAKgxH,MAQ3BpxH,EAAKg0J,WAAWj2J,UAAUu2J,QAAU,kBAC3Bl0J,KAAK/6B,UAAY,GAc1B26B,EAAKg0J,WAAWj2J,UAAU03J,YAAc,SAASC,EAAQxB,MACpD9zJ,KAAK/6B,UAAYqwL,SACXt1J,KAET8zJ,EAAWluL,KAAKD,IAAImuL,GAAY9zJ,KAAK8zJ,SAAUwB,OAG3Cr5J,EAAAA,IAAUw8H,WACZz4H,KAAK0sD,KAAKmjD,OAAQ7vG,KAAK0sD,KAAKyxE,WAAYn+H,KAAK0sD,KAAK0xE,YAChD2mB,EAAAA,IAAUtsB,WAAWz4H,KAAK/6B,SAAW6uL,UACzC/O,EAAItjK,IAAIwa,GACR+D,KAAK0sD,KAAAA,IAAWqnG,SAAShP,EAAIl1C,QAEtB7vG,MAUTJ,EAAKg0J,WAAWj2J,UAAU6xJ,QAAU,SAASl2K,UAC3C0mB,KAAKq1J,YAAY,GACjBr1J,KAAK0sD,KAAK6oG,SAASv1J,KAAK2kJ,QAASrrK,GAC1B0mB,MAWTJ,EAAKg0J,WAAWj2J,UAAUw2J,aAAe,SAAS76K,EAAGrlF,GACnD+rG,KAAKq1J,YAAYphQ,WACTkzE,EAAI,EAAGA,EAAIlzE,IAAKkzE,EACtB64B,KAAK0sD,KAAK6oG,SAASj8K,UAEd0mB,MAaTJ,EAAKg0J,WAAWj2J,UAAU4xJ,SAAW,SAAS52B,EAAO4D,MAChD38H,EAAKqzJ,kBAAkBt6B,GAAAA,KAEpBv1H,GADAnH,EAAAA,IAAUw8H,WAAWE,EAAM9oB,OAAQ8oB,EAAMwF,WAAYxF,EAAMyF,aACjDA,WAAaniI,EAAIkiI,kBAC/Bn+H,KAAKq1J,YAAYjyJ,GACb2hJ,IAAUtsB,WAAWz4H,KAAK0sD,KAAKmjD,OAAQ7vG,KAAK2kJ,OAC5CljK,IAAIwa,GACR+D,KAAK2kJ,OAASvhJ,EACPpD,QAGNJ,EAAKozJ,cAAcr6B,GAAAA,KAChB18H,EAAAA,IAAUw8H,WAAWE,UACzB34H,KAAKq1J,YAAYp5J,EAAImiI,YACjB2mB,IAAUtsB,WAAWz4H,KAAK0sD,KAAKmjD,QAC/BpuH,IAAIwa,EAAK+D,KAAK2kJ,OAClB3kJ,KAAK2kJ,OAAS1oJ,EAAImiI,WACXp+H,QAIN24H,aAAiB/4H,EAAKg0J,YACL,iBAAVj7B,GACc,iBAAfA,EAAM3H,MAA4C,iBAAhB2H,EAAMgsB,OAC/C/kJ,EAAKqzJ,kBAAkBt6B,EAAMjsE,MAAAA,CACzBzwD,EAAAA,IAAUw8H,WAAWE,EAAMjsE,KAAK0xE,WAAYzF,EAAM3H,KAAM2H,EAAM1zJ,iBAClE+6B,KAAKq1J,YAAYp5J,EAAImiI,YACjB2mB,IAAUtsB,WAAWE,EAAMjsE,KAAK0xE,WAAYp+H,KAAK2kJ,OACjDljK,IAAIwa,GACR+D,KAAK2kJ,OAAS1oJ,EAAImiI,WACXp+H,QAGN24H,aAAiB/4H,EAAKmzJ,mBAEvBp6B,EAAQA,EAAMjsE,KACd6vE,EAAW,UAIbA,EAAWA,GAAY,SACH,iBAAV5D,EAAU,KACd68B,KAGY,QAAbj5B,SACDv8H,KAAKq1J,YAAYzvL,KAAKwhL,KAAKzuB,EAAM1zJ,OAAS,IAC1CuwL,EAAAA,IAAW/8B,WAAWz4H,KAAK0sD,KAAKmjD,OAAQ7vG,KAAK2kJ,OAC7C3kJ,KAAK2kJ,OAAS/kJ,EAAK61J,OAAOzvL,IAAIo+B,OAAOu0H,EAAO68B,EAAMx1J,KAAK2kJ,OAChD3kJ,QAEO,WAAbu8H,SACDv8H,KAAKq1J,YAA0C,EAA9BzvL,KAAKwhL,KAAKzuB,EAAM1zJ,OAAS,IAC1CuwL,EAAAA,IAAW/8B,WAAWz4H,KAAK0sD,KAAKmjD,OAAQ7vG,KAAK2kJ,OAC7C3kJ,KAAK2kJ,OAAS/kJ,EAAK61J,OAAO5xJ,OAAOO,OAAOu0H,EAAO68B,EAAMx1J,KAAK2kJ,OACnD3kJ,QAIO,SAAbu8H,IAED5D,EAAQ/4H,EAAKy0J,WAAW17B,GACxB4D,EAAW,UAIG,WAAbA,GAAsC,QAAbA,SAE1Bv8H,KAAKq1J,YAAY18B,EAAM1zJ,QACvBuwL,EAAAA,IAAW/8B,WAAWz4H,KAAK0sD,KAAKmjD,OAAQ7vG,KAAK2kJ,OAC7C3kJ,KAAK2kJ,OAAS/kJ,EAAK61J,OAAO3rK,IAAIsa,OAAOoxJ,GAC9Bx1J,QAIO,UAAbu8H,SAEDv8H,KAAKq1J,YAA2B,EAAf18B,EAAM1zJ,QACvBuwL,EAAAA,IAAWE,YAAY11J,KAAK0sD,KAAKmjD,OAAQ7vG,KAAK2kJ,OAC9C3kJ,KAAK2kJ,OAAS/kJ,EAAKzyB,KAAKwoL,MAAMryJ,OAAOkyJ,GAC9Bx1J,eAGClH,MAAM,qBAAuByjI,SAGnCzjI,MAAM,sBAAwB6/H,IAUtC/4H,EAAKg0J,WAAWj2J,UAAU8xJ,UAAY,SAAS5/C,UAC7C7vG,KAAKuvJ,SAAS1/C,GACdA,EAAOziD,QACAptD,MAWTJ,EAAKg0J,WAAWj2J,UAAUy2J,UAAY,SAAS5+J,UACtCwK,KAAKuvJ,SAAS/5J,EAAK,UAU5BoK,EAAKg0J,WAAWj2J,UAAU+xJ,SAAW,SAASvoL,UAC5C64B,KAAKq1J,YAAY,GACjBr1J,KAAK0sD,KAAKkpG,SAAS51J,KAAK2kJ,MAAOx9K,GAC/B64B,KAAK2kJ,OAAS,EACP3kJ,MAUTJ,EAAKg0J,WAAWj2J,UAAU22J,SAAW,SAASntL,UAC5C64B,KAAKq1J,YAAY,GACjBr1J,KAAK0sD,KAAKkpG,SAAS51J,KAAK2kJ,MAAOx9K,GAAK,EAAI,OACxC64B,KAAK0sD,KAAKmpG,QAAQ71J,KAAK2kJ,MAAOx9K,GAAK,GAAK,KACxC64B,KAAK2kJ,OAAS,EACP3kJ,MAUTJ,EAAKg0J,WAAWj2J,UAAU42J,SAAW,SAASptL,UAC5C64B,KAAKq1J,YAAY,GACjBr1J,KAAK0sD,KAAKopG,SAAS91J,KAAK2kJ,MAAOx9K,GAC/B64B,KAAK2kJ,OAAS,EACP3kJ,MAUTJ,EAAKg0J,WAAWj2J,UAAU62J,WAAa,SAASrtL,UAC9C64B,KAAKq1J,YAAY,GACjBr1J,KAAK0sD,KAAKkpG,SAAS51J,KAAK2kJ,MAAOx9K,GAAG,GAClC64B,KAAK2kJ,OAAS,EACP3kJ,MAUTJ,EAAKg0J,WAAWj2J,UAAU82J,WAAa,SAASttL,UAC9C64B,KAAKq1J,YAAY,GACjBr1J,KAAK0sD,KAAKmpG,QAAQ71J,KAAK2kJ,MAAOx9K,GAAK,GAAK,KACxC64B,KAAK0sD,KAAKkpG,SAAS51J,KAAK2kJ,MAAOx9K,GAAK,EAAI,OAAQ,GAChD64B,KAAK2kJ,OAAS,EACP3kJ,MAUTJ,EAAKg0J,WAAWj2J,UAAU+2J,WAAa,SAASvtL,UAC9C64B,KAAKq1J,YAAY,GACjBr1J,KAAK0sD,KAAKopG,SAAS91J,KAAK2kJ,MAAOx9K,GAAG,GAClC64B,KAAK2kJ,OAAS,EACP3kJ,MAWTJ,EAAKg0J,WAAWj2J,UAAUg3J,OAAS,SAASxtL,EAAGlzE,GAC7C6+P,EAAgB7+P,GAChB+rG,KAAKq1J,YAAYphQ,EAAI,MAEnBA,GAAK,EACL+rG,KAAK0sD,KAAKmpG,QAAQ71J,KAAK2kJ,QAAUx9K,GAAKlzE,EAAK,WACrCA,EAAI,UACL+rG,MAYTJ,EAAKg0J,WAAWj2J,UAAUk0J,aAAe,SAAS1qL,EAAGlzE,UACnD6+P,EAAgB7+P,GAChB+rG,KAAKq1J,YAAYphQ,EAAI,GAClBkzE,EAAI,IACLA,GAAK,GAAMlzE,EAAI,GAEV+rG,KAAK20J,OAAOxtL,EAAGlzE,IAQxB2rG,EAAKg0J,WAAWj2J,UAAU2wJ,QAAU,kBAC3BtuJ,KAAK0sD,KAAKqpG,QAAQ/1J,KAAKgxH,SAShCpxH,EAAKg0J,WAAWj2J,UAAUuxJ,SAAW,eAC/BkC,EAAOpxJ,KAAK0sD,KAAKwiG,SAASlvJ,KAAKgxH,aACnChxH,KAAKgxH,MAAQ,EACNogC,GASTxxJ,EAAKg0J,WAAWj2J,UAAUi3J,SAAW,eAC/BxD,EACFpxJ,KAAK0sD,KAAKwiG,SAASlvJ,KAAKgxH,OAAS,EACjChxH,KAAK0sD,KAAKqpG,QAAQ/1J,KAAKgxH,KAAO,UAChChxH,KAAKgxH,MAAQ,EACNogC,GASTxxJ,EAAKg0J,WAAWj2J,UAAUk3J,SAAW,eAC/BzD,EAAOpxJ,KAAK0sD,KAAKmoG,SAAS70J,KAAKgxH,aACnChxH,KAAKgxH,MAAQ,EACNogC,GASTxxJ,EAAKg0J,WAAWj2J,UAAUm3J,WAAa,eACjC1D,EAAOpxJ,KAAK0sD,KAAKwiG,SAASlvJ,KAAKgxH,MAAM,UACzChxH,KAAKgxH,MAAQ,EACNogC,GASTxxJ,EAAKg0J,WAAWj2J,UAAUo3J,WAAa,eACjC3D,EACFpxJ,KAAK0sD,KAAKqpG,QAAQ/1J,KAAKgxH,MACvBhxH,KAAK0sD,KAAKwiG,SAASlvJ,KAAKgxH,KAAO,GAAG,IAAS,SAC7ChxH,KAAKgxH,MAAQ,EACNogC,GASTxxJ,EAAKg0J,WAAWj2J,UAAUq3J,WAAa,eACjC5D,EAAOpxJ,KAAK0sD,KAAKmoG,SAAS70J,KAAKgxH,MAAM,UACzChxH,KAAKgxH,MAAQ,EACNogC,GAWTxxJ,EAAKg0J,WAAWj2J,UAAU4wJ,OAAS,SAASt6P,GAC1C6+P,EAAgB7+P,OACZm9P,EAAO,KAGTA,GAAQA,GAAQ,GAAKpxJ,KAAK0sD,KAAKqpG,QAAQ/1J,KAAKgxH,QAC5C/8N,GAAK,QACCA,EAAI,UACLm9P,GAWTxxJ,EAAKg0J,WAAWj2J,UAAUo0J,aAAe,SAAS99P,OAE5C25G,EAAI5N,KAAKuuJ,OAAOt6P,GAChB0xE,EAAM,GAAM1xE,EAAI,SACjB25G,GAAKjoC,IACNioC,GAAKjoC,GAAO,GAEPioC,GAWThO,EAAKg0J,WAAWj2J,UAAUyjJ,SAAW,SAAS79J,OAIxC6tK,SACD7tK,GAEDA,EAAQ3d,KAAKq0B,IAAI+F,KAAK/6B,SAAUse,GAChC6tK,EAAOpxJ,KAAK0sD,KAAKtnF,MAAM46B,KAAKgxH,KAAMhxH,KAAKgxH,KAAOztI,GAC9Cyc,KAAKgxH,MAAQztI,GACK,IAAVA,EACR6tK,EAAO,IAGPA,EAAsB,IAAdpxJ,KAAKgxH,KAAchxH,KAAK0sD,KAAO1sD,KAAK0sD,KAAKtnF,MAAM46B,KAAKgxH,MAC5DhxH,KAAKotD,SAEAgkG,GAWTxxJ,EAAKg0J,WAAWj2J,UAAUg7H,MAAQ,SAASp1I,eAEf,IAAXA,EACbyc,KAAK0sD,KAAKtnF,MAAM46B,KAAKgxH,MACrBhxH,KAAK0sD,KAAKtnF,MAAM46B,KAAKgxH,KAAMhxH,KAAKgxH,KAAOztI,IAU3Cqc,EAAKg0J,WAAWj2J,UAAUyK,GAAK,SAASjhC,UAC/B64B,KAAK0sD,KAAKspG,SAASh2J,KAAKgxH,KAAO7pJ,IAWxCy4B,EAAKg0J,WAAWj2J,UAAUs3J,MAAQ,SAAS9tL,EAAGmS,UAC5C0mB,KAAK0sD,KAAK6oG,SAASpuL,EAAGmS,GACf0mB,MAQTJ,EAAKg0J,WAAWj2J,UAAU5hB,KAAO,kBACxBikB,KAAK0sD,KAAKspG,SAASh2J,KAAK2kJ,MAAQ,IAQzC/kJ,EAAKg0J,WAAWj2J,UAAU1gG,KAAO,sBACpB2iG,EAAKg0J,WAAW5zJ,OAQ7BJ,EAAKg0J,WAAWj2J,UAAUu3J,QAAU,cAC/Bl1J,KAAKgxH,KAAO,EAAA,KACT/0H,EAAAA,IAAUw8H,WAAWz4H,KAAK0sD,KAAKmjD,OAAQ7vG,KAAKgxH,MAC5C+zB,EAAAA,IAAUtsB,WAAWx8H,EAAImiI,YAC7B2mB,EAAItjK,IAAIwa,GACR+D,KAAK0sD,KAAAA,IAAWqnG,SAAShP,GACzB/kJ,KAAK2kJ,OAAS3kJ,KAAKgxH,KACnBhxH,KAAKgxH,KAAO,SAEPhxH,MAQTJ,EAAKg0J,WAAWj2J,UAAUyvD,MAAQ,kBAChCptD,KAAK0sD,KAAAA,IAAWqnG,SAAAA,IAAa91B,YAAY,IACzCj+H,KAAKgxH,KAAOhxH,KAAK2kJ,MAAQ,EAClB3kJ,MAUTJ,EAAKg0J,WAAWj2J,UAAUw3J,SAAW,SAAS5xK,UAC5Cyc,KAAK2kJ,MAAQ/+K,KAAKD,IAAI,EAAGq6B,KAAK/6B,SAAWse,GACzCyc,KAAKgxH,KAAOprJ,KAAKq0B,IAAI+F,KAAKgxH,KAAMhxH,KAAK2kJ,OAC9B3kJ,MAQTJ,EAAKg0J,WAAWj2J,UAAUy3J,MAAQ,mBAC5BhE,EAAO,GACHjqL,EAAI64B,KAAKgxH,KAAM7pJ,EAAI64B,KAAK0sD,KAAK0xE,aAAcj3J,EAAAA,KAC7CmS,EAAI0mB,KAAK0sD,KAAKspG,SAAS7uL,GACxBmS,EAAI,KACL83K,GAAQ,KAEVA,GAAQ93K,EAAE8kB,SAAS,WAEdgzJ,GAYTxxJ,EAAKg0J,WAAWj2J,UAAUS,SAAW,SAASm+H,OACxCi5B,EAAAA,IAAW/8B,WAAWz4H,KAAK0sD,KAAM1sD,KAAKgxH,KAAMhxH,KAAK/6B,aAIrC,YAHhBs3J,EAAWA,GAAY,SAGkB,QAAbA,SACnB38H,EAAK61J,OAAO3rK,IAAIwZ,OAAOkyJ,MAEhB,QAAbj5B,SACM38H,EAAK61J,OAAOzvL,IAAIs9B,OAAOkyJ,MAEhB,WAAbj5B,SACM38H,EAAK61J,OAAO5xJ,OAAOP,OAAOkyJ,MAInB,SAAbj5B,SACM38H,EAAKzyB,KAAK01K,KAAKz+I,OAAOoxJ,MAEf,UAAbj5B,SACM38H,EAAKzyB,KAAKwoL,MAAMvxJ,OAAOoxJ,aAGtB18J,MAAM,qBAAuByjI,IAezC38H,EAAKyvJ,aAAe,SAASrgK,EAAOutI,UAElCA,EAAWA,GAAY,WACV7mO,IAAVs5F,GAAoC,SAAbutI,IACxBvtI,EAAQ4Q,EAAKy0J,WAAWrlK,QAEf4Q,EAAK8zJ,WAAW1kK,IAa7B4Q,EAAKq2J,WAAa,SAASxpL,EAAGx4E,WACxBioF,EAAI,GACFjoF,EAAI,GACD,EAAJA,IACDioF,GAAKzP,IAEPx4E,KAAO,GACA,IACLw4E,GAAKA,UAGFyP,GAaT0jB,EAAKs2J,SAAW,SAASrgE,EAAIC,EAAI7hM,WAC3BkiQ,EAAK,GACL78K,EAAI,GACJylE,EAAI,GACJ53E,EAAI,EACJsF,EAAI,EACFx4E,EAAI,IAAKA,IAAKkzE,EAClBmS,EAAIu8G,EAAG59G,WAAW9Q,GAAK2uH,EAAG79G,WAAW9Q,GAClCsF,GAAK,KACN0pL,GAAMp3G,EACNA,EAAI,GACJtyE,EAAI,GAENsyE,GAAK14E,OAAO67C,aAAa5oC,KACvB7M,SAEJ0pL,GAAMp3G,GAWRn/C,EAAKw2J,WAAa,SAASpwL,OAErBorL,EAAO,GACPjqL,EAAI,OACQ,EAAbnB,EAAIf,SAELkC,EAAI,EACJiqL,GAAQ/qL,OAAO67C,aAAa97C,SAASJ,EAAI,GAAI,MAGzCmB,EAAInB,EAAIf,OAAQkC,GAAK,EACzBiqL,GAAQ/qL,OAAO67C,aAAa97C,SAASJ,EAAIH,OAAOsB,EAAG,GAAI,YAElDiqL,GAUTxxJ,EAAK8yJ,WAAa,SAAS/5B,UAElB/4H,EAAKyvJ,aAAa12B,GAAOy8B,SAUlCx1J,EAAKy2J,aAAe,SAASlvL,UAEzBd,OAAO67C,aAAa/6C,GAAK,GAAK,KAC9Bd,OAAO67C,aAAa/6C,GAAK,GAAK,KAC9Bd,OAAO67C,aAAa/6C,GAAK,EAAI,KAC7Bd,OAAO67C,aAAiB,IAAJ/6C,QAIpBmvL,EACF,oEACEC,EAAAA,CAGD,IAAK,GAAI,GAAI,EAAG,GAGhB,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAGpC,GAAI,GAAI,EAAG,IAAK,GAAI,GAAI,EAIxB,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAG,GAAI,GAAI,GAG/C,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAIhD,GAAI,GAAI,GAAI,GAAI,GAAI,EAIpB,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAGhD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAI/CC,EAAU,6DAWd52J,EAAK62J,SAAW,SAASznK,EAAO0nK,WAI1BC,EAAMC,EAAMC,EAFZ5hL,EAAO,GACP6pJ,EAAS,GAET33J,EAAI,EACFA,EAAI6nB,EAAM/pB,QACd0xL,EAAO3nK,EAAM/W,WAAW9Q,KACxByvL,EAAO5nK,EAAM/W,WAAW9Q,KACxB0vL,EAAO7nK,EAAM/W,WAAW9Q,KAGxB8N,GAAQqhL,EAAQ/9J,OAAOo+J,GAAQ,GAC/B1hL,GAAQqhL,EAAQ/9J,QAAgB,EAAPo+J,IAAa,EAAMC,GAAQ,GACjD13J,MAAM03J,GACP3hL,GAAQ,MAERA,GAAQqhL,EAAQ/9J,QAAgB,GAAPq+J,IAAc,EAAMC,GAAQ,GACrD5hL,GAAQiqB,MAAM23J,GAAQ,IAAMP,EAAQ/9J,OAAc,GAAPs+J,IAG1CH,GAAWzhL,EAAKhQ,OAASyxL,IAC1B53B,GAAU7pJ,EAAKpP,OAAO,EAAG6wL,GAAW,OACpCzhL,EAAOA,EAAKpP,OAAO6wL,WAGvB53B,GAAU7pJ,GAWZ2qB,EAAKk3J,SAAW,SAAS9nK,GAIvBA,EAAQA,EAAM9V,QAAQ,sBAAuB,YAGzC69K,EAAMC,EAAMC,EAAMC,EADlBp4B,EAAS,GAET33J,EAAI,EAEFA,EAAI6nB,EAAM/pB,QACd8xL,EAAOR,EAAWvnK,EAAM/W,WAAW9Q,KAAO,IAC1C6vL,EAAOT,EAAWvnK,EAAM/W,WAAW9Q,KAAO,IAC1C8vL,EAAOV,EAAWvnK,EAAM/W,WAAW9Q,KAAO,IAC1C+vL,EAAOX,EAAWvnK,EAAM/W,WAAW9Q,KAAO,IAE1C23J,GAAUz4J,OAAO67C,aAAc60I,GAAQ,EAAMC,GAAQ,GACzC,KAATC,IAEDn4B,GAAUz4J,OAAO67C,cAAsB,GAAP80I,IAAc,EAAMC,GAAQ,GAChD,KAATC,IAEDp4B,GAAUz4J,OAAO67C,cAAsB,EAAP+0I,IAAa,EAAKC,YAKjDp4B,GAaTl/H,EAAKy0J,WAAa,SAAS7+J,UAClB2hK,SAASC,mBAAmB5hK,KAYrCoK,EAAK+yJ,WAAa,SAASn9J,UAClBu+G,mBAAmBsjD,OAAO7hK,KAKnCoK,EAAK61J,OAAAA,CACH3rK,IAAAA,GACA9jB,IAAAA,GACA69B,OAAAA,GACAyzJ,OAAAA,GACAzE,MAAAA,CACEvvJ,OAAQuvJ,EAAMvvJ,OACdc,OAAQyuJ,EAAMzuJ,SAYlBxE,EAAK61J,OAAO3rK,IAAIwZ,OAAS,SAASq1H,UACzBtyJ,OAAO67C,aAAakhF,MAAM,KAAMu1B,IAczC/4H,EAAK61J,OAAO3rK,IAAIsa,OAAS,SAAS5O,EAAKspI,EAAQ/5J,OACzCg8D,EAAM+9F,EACN/9F,IACFA,EAAAA,IAAU03F,WAAWjjI,EAAIvwB,iBAGvBqsB,EADJvsB,EAASA,GAAU,EAEXoC,EAAI,EAAGA,EAAIquB,EAAIvwB,SAAUkC,EAC/B45D,EAAIzvC,KAAOkE,EAAIvd,WAAW9Q,UAErB23J,EAAUxtI,EAAIvsB,EAAUg8D,GAWjCnhC,EAAK61J,OAAOzvL,IAAIs9B,OAAS1D,EAAK8yJ,WAY9B9yJ,EAAK61J,OAAOzvL,IAAIo+B,OAAS,SAASp+B,EAAK84J,EAAQ/5J,OACzCg8D,EAAM+9F,EACN/9F,IACFA,EAAAA,IAAU03F,WAAW7yJ,KAAKwhL,KAAKphL,EAAIf,OAAS,SAG1CkC,EAAI,EAAGmqB,EADXvsB,EAASA,GAAU,MAEH,EAAbiB,EAAIf,SAELkC,EAAI,EACJ45D,EAAIzvC,KAAOlrB,SAASJ,EAAI,GAAI,KAGxBmB,EAAInB,EAAIf,OAAQkC,GAAK,EACzB45D,EAAIzvC,KAAOlrB,SAASJ,EAAIH,OAAOsB,EAAG,GAAI,WAEjC23J,EAAUxtI,EAAIvsB,EAAUg8D,GAYjCnhC,EAAK61J,OAAO5xJ,OAAOP,OAAS,SAAStU,EAAO0nK,WAGtCC,EAAMC,EAAMC,EAFZ5hL,EAAO,GACP6pJ,EAAS,GAET33J,EAAI,EACFA,EAAI6nB,EAAMovI,YACdu4B,EAAO3nK,EAAM7nB,KACbyvL,EAAO5nK,EAAM7nB,KACb0vL,EAAO7nK,EAAM7nB,KAGb8N,GAAQqhL,EAAQ/9J,OAAOo+J,GAAQ,GAC/B1hL,GAAQqhL,EAAQ/9J,QAAgB,EAAPo+J,IAAa,EAAMC,GAAQ,GACjD13J,MAAM03J,GACP3hL,GAAQ,MAERA,GAAQqhL,EAAQ/9J,QAAgB,GAAPq+J,IAAc,EAAMC,GAAQ,GACrD5hL,GAAQiqB,MAAM23J,GAAQ,IAAMP,EAAQ/9J,OAAc,GAAPs+J,IAG1CH,GAAWzhL,EAAKhQ,OAASyxL,IAC1B53B,GAAU7pJ,EAAKpP,OAAO,EAAG6wL,GAAW,OACpCzhL,EAAOA,EAAKpP,OAAO6wL,WAGvB53B,GAAU7pJ,GAcZ2qB,EAAK61J,OAAO5xJ,OAAOO,OAAS,SAASpV,EAAO8vI,EAAQ/5J,OAU9CgyL,EAAMC,EAAMC,EAAMC,EATlBn2H,EAAM+9F,EACN/9F,IACFA,EAAAA,IAAU03F,WAAyC,EAA9B7yJ,KAAKwhL,KAAKp4J,EAAM/pB,OAAS,KAIhD+pB,EAAQA,EAAM9V,QAAQ,sBAAuB,YAIzC/R,EAAI,EAAGmqB,EAFXvsB,EAASA,GAAU,EAIboC,EAAI6nB,EAAM/pB,QACd8xL,EAAOR,EAAWvnK,EAAM/W,WAAW9Q,KAAO,IAC1C6vL,EAAOT,EAAWvnK,EAAM/W,WAAW9Q,KAAO,IAC1C8vL,EAAOV,EAAWvnK,EAAM/W,WAAW9Q,KAAO,IAC1C+vL,EAAOX,EAAWvnK,EAAM/W,WAAW9Q,KAAO,IAE1C45D,EAAIzvC,KAAQylK,GAAQ,EAAMC,GAAQ,EACtB,KAATC,IAEDl2H,EAAIzvC,MAAgB,GAAP0lK,IAAc,EAAMC,GAAQ,EAC7B,KAATC,IAEDn2H,EAAIzvC,MAAgB,EAAP2lK,IAAa,EAAKC,WAM9Bp4B,EAAUxtI,EAAIvsB,EAAUg8D,EAAIo7F,SAAS,EAAG7qI,IAIjDsO,EAAK61J,OAAO6B,OAAOh0J,OAAS,SAAStU,EAAO0nK,UACnC92J,EAAK61J,OAAO5C,MAAMvvJ,OAAOtU,EAAOwnK,EAASE,IAElD92J,EAAK61J,OAAO6B,OAAOlzJ,OAAS,SAASpV,EAAO0nK,UACnC92J,EAAK61J,OAAO5C,MAAMzuJ,OAAOpV,EAAOwnK,EAASE,IAKlD92J,EAAKzyB,KAAAA,CACH01K,KAAAA,GACA8S,MAAAA,IAaF/1J,EAAKzyB,KAAK01K,KAAKv/I,OAAS,SAAS9N,EAAKspI,EAAQ/5J,GAC5CywB,EAAMoK,EAAKy0J,WAAW7+J,OAClBurC,EAAM+9F,EACN/9F,IACFA,EAAAA,IAAU03F,WAAWjjI,EAAIvwB,iBAGvBqsB,EADJvsB,EAASA,GAAU,EAEXoC,EAAI,EAAGA,EAAIquB,EAAIvwB,SAAUkC,EAC/B45D,EAAIzvC,KAAOkE,EAAIvd,WAAW9Q,UAErB23J,EAAUxtI,EAAIvsB,EAAUg8D,GAUjCnhC,EAAKzyB,KAAK01K,KAAKz+I,OAAS,SAASu0H,UACxB/4H,EAAK+yJ,WAAWtsL,OAAO67C,aAAakhF,MAAM,KAAMu1B,KAazD/4H,EAAKzyB,KAAKwoL,MAAMryJ,OAAS,SAAS9N,EAAKspI,EAAQ/5J,OACzCg8D,EAAM+9F,EACN/9F,IACFA,EAAAA,IAAU03F,WAAwB,EAAbjjI,EAAIvwB,iBAEvBuwL,EAAAA,IAAWE,YAAY30H,EAAI8uE,QAE3Bv+G,EADJvsB,EAASA,GAAU,EAEf1wE,EAAI0wE,EACAoC,EAAI,EAAGA,EAAIquB,EAAIvwB,SAAUkC,EAC/BquL,EAAKnhQ,KAAOmhG,EAAIvd,WAAW9Q,GAC3BmqB,GAAK,SAEAwtI,EAAUxtI,EAAIvsB,EAAUg8D,GAUjCnhC,EAAKzyB,KAAKwoL,MAAMvxJ,OAAS,SAASu0H,UACzBtyJ,OAAO67C,aAAakhF,MAAM,KAAA,IAAUsyD,YAAY/8B,EAAM9oB,UAa/DjwG,EAAK23J,QAAU,SAAS79C,EAAKif,EAAO7uI,MAClC6uI,EAAQ/4H,EAAKk3J,SAASp9C,EAAI69C,QAAQ33J,EAAK62J,SAAS99B,IAAQy4B,MAGrDtnK,EAAAA,KAIG9U,EAAQ,EAEH,GADC2jJ,EAAM1gJ,WAAW,KAEzBjD,EAAQ,GAGV2jJ,EAAQA,EAAM78H,UAAU9mB,EAAO2jJ,EAAM1zJ,OAAS,UAGzC0zJ,GAaT/4H,EAAK43J,QAAU,SAAS99C,EAAKif,EAAO7uI,OAE9BsnK,EAAO13C,EAAI89C,QAAQ53J,EAAK62J,SAAS99B,IAAQy4B,YAC5B,OAATA,EAAiB,KAAOxxJ,EAAKk3J,SAAS1F,QAU5CqG,EAAoB,SAAS/9C,EAAKz1H,EAAI4a,OACpC66G,YACQ5gH,MAAM,iCAGds4J,KACO,OAARvyJ,EACDuyJ,EAAO13C,EAAIg+C,WAAWzzK,IAGtB4a,EAAMe,EAAK62J,SAAS5uL,KAAKC,UAAU+2B,IACnCuyJ,EAAO13C,EAAIi+C,QAAQ1zK,EAAI4a,SAIL,IAAVuyJ,IAAuC,IAAdA,EAAKA,KAAS,KAC3C7hL,EAAAA,IAAYupB,MAAMs4J,EAAK7hL,MAAMoK,eACjCpK,EAAM0U,GAAKmtK,EAAK7hL,MAAM0U,GACtB1U,EAAM18E,KAAOu+P,EAAK7hL,MAAM18E,KAClB08E,IAYNqoL,EAAoB,SAASl+C,EAAKz1H,OAChCy1H,YACQ5gH,MAAM,iCAIds4J,EAAO13C,EAAIm+C,QAAQ5zK,MAQpBy1H,EAAI1kF,QACY,OAAdo8H,EAAKA,KAAS,IACZA,EAAK7hL,MAAAA,KACFA,EAAAA,IAAYupB,MAAMs4J,EAAK7hL,MAAMoK,eACjCpK,EAAM0U,GAAKmtK,EAAK7hL,MAAM0U,GACtB1U,EAAM18E,KAAOu+P,EAAK7hL,MAAM18E,KAClB08E,EAGR6hL,EAAO,UAEPA,EAAOA,EAAKA,YAKJ,OAATA,IAEDA,EAAOvpL,KAAKoH,MAAM2wB,EAAKk3J,SAAS1F,KAG3BA,GAWL0G,EAAW,SAASp+C,EAAKz1H,EAAIjvF,EAAK03J,OAEhC7tD,EAAM+4J,EAAkBl+C,EAAKz1H,GACtB,OAAR4a,IAEDA,EAAAA,IAGFA,EAAI7pG,GAAO03J,EAGX+qG,EAAkB/9C,EAAKz1H,EAAI4a,IAYzBk5J,EAAW,SAASr+C,EAAKz1H,EAAIjvF,OAE3Bo8P,EAAOwG,EAAkBl+C,EAAKz1H,UACtB,OAATmtK,IAEDA,EAAQp8P,KAAOo8P,EAAQA,EAAKp8P,GAAO,MAG9Bo8P,GAUL4G,EAAc,SAASt+C,EAAKz1H,EAAIjvF,OAE9B6pG,EAAM+4J,EAAkBl+C,EAAKz1H,MACtB,OAAR4a,GAAgB7pG,KAAO6pG,EAAAA,QAEjBA,EAAI7pG,OAGP66H,GAAQ,UACJl3C,KAAQkmB,EAAAA,CACdgxB,GAAQ,QAGPA,IAEDhxB,EAAM,MAIR44J,EAAkB/9C,EAAKz1H,EAAI4a,KAU3Bo5J,EAAc,SAASv+C,EAAKz1H,GAC9BwzK,EAAkB/9C,EAAKz1H,EAAI,OAYzBi0K,EAAuB,SAASC,EAAM/hL,EAAMoyH,OAS1C1hI,EARAsqL,EAAO,UAGa,IAAd5oD,IACRA,EAAAA,CAAY,MAAO,cAKjB1+B,GAAO,EACPsuF,EAAY,aACRjwJ,KAAOqgG,EAAAA,CACb1hI,EAAO0hI,EAASrgG,UAEF,UAATrhC,GAA6B,SAATA,EAAS,IACf,OAAZsP,EAAK,aACI0iB,MAAM,sCAElBs4J,EAAO+G,EAAK/0D,MAAMpjG,KAAM5pB,GACxB0zF,EAAiB,UAAThjG,EAEE,QAATA,GAA2B,SAATA,IACnBsP,EAAK,GAAKiiL,aACVjH,EAAO+G,EAAK/0D,MAAMpjG,KAAM5pB,GACxB0zF,GAAO,SAEHmlF,GACNmJ,EAAYnJ,KAEXnlF,YAKDA,QACIsuF,SAGDhH,GA+BTxxJ,EAAK+3J,QAAU,SAASj+C,EAAKz1H,EAAIjvF,EAAK03J,EAAM87C,GAC1C0vD,EAAqBJ,EAAUzhL,UAAWmyH,IAe5C5oG,EAAKi4J,QAAU,SAASn+C,EAAKz1H,EAAIjvF,EAAKwzM,UAC7B0vD,EAAqBH,EAAU1hL,UAAWmyH,IAanD5oG,EAAK83J,WAAa,SAASh+C,EAAKz1H,EAAIjvF,EAAKwzM,GACvC0vD,EAAqBF,EAAa3hL,UAAWmyH,IAY/C5oG,EAAK04J,WAAa,SAAS5+C,EAAKz1H,EAAIukH,GAClC0vD,EAAqBD,EAAa5hL,UAAWmyH,IAU/C5oG,EAAK24J,SAAW,SAAS/iK,OAEnBomC,EAAQ,yCACZA,EAAM//B,UAAY,MACd3c,EAAI08C,EAAMt2D,KAAKkwB,GACfoQ,EAAa,OAAN1mB,EAAc,KAAA,CACvBs5K,KAAMhjK,EACN8P,OAAQpmB,EAAE,GACVsmB,KAAMtmB,EAAE,GACRumB,KAAMvmB,EAAE,GACRvsF,KAAMusF,EAAE,WAEP0mB,IACDA,EAAI6yJ,SAAW7yJ,EAAIJ,KAChBI,EAAIH,MACW,KAAbG,EAAIH,MAA8B,SAAfG,EAAIN,QAEH,MAAbM,EAAIH,MAA+B,UAAfG,EAAIN,UADhCM,EAAI6yJ,UAAY,IAAM7yJ,EAAIH,MAIL,SAAfG,EAAIN,OACZM,EAAIH,KAAO,GACY,UAAfG,EAAIN,SACZM,EAAIH,KAAO,KAEbG,EAAI4yJ,KAAO5yJ,EAAIN,OAAS,MAAQM,EAAI6yJ,UAE/B7yJ,OAIL8yJ,EAAkB,KAyCtB94J,EAAK+4J,kBAAoB,SAASjwD,OA0B3B0oD,EAzBDniL,EAAQ,SAASq/B,WACf8iJ,EAAAA,GACAwH,EAAUtqJ,EAAExuB,MAAM,KACd3Y,EAAI,EAAGA,EAAIyxL,EAAQ3zL,OAAQkC,IAAAA,KAE7BnyE,EACA2kG,EAFA/hB,EAAMghL,EAAQzxL,GAAGqE,QAAQ,KAG1BoM,EAAM,GACP5iF,EAAM4jQ,EAAQzxL,GAAG20B,UAAU,EAAGlkB,GAC9B+hB,EAAMi/J,EAAQzxL,GAAG20B,UAAUlkB,EAAM,KAEjC5iF,EAAM4jQ,EAAQzxL,GACdwyB,EAAM,MAEH3kG,KAAOo8P,IACVA,EAAKp8P,GAAAA,IAGFA,KAAOxB,OAAOmqG,WAAsB,OAARhE,GAC/By3J,EAAKp8P,GAAK81E,KAAKqsL,SAASx9J,WAGrBy3J,eAIa,IAAX1oD,GAEe,OAApBgwD,IAGEA,EAFmB,oBAAZn5J,QAA2BA,OAAOipG,UAAYjpG,OAAOipG,SAASv8F,OAEnDh9B,EAAMswB,OAAOipG,SAASv8F,OAAOnQ,UAAU,IAGzD48J,IAGLtH,EAAOsH,GAGPtH,EAAOniL,EAAMy5H,GAER0oD,GAeVxxJ,EAAKi5J,cAAgB,SAASC,OAExBC,EAAKD,EACLE,EAAK,GAELphL,EAAMkhL,EAASttL,QAAQ,KACxBoM,EAAM,IACPmhL,EAAKD,EAASh9J,UAAU,EAAGlkB,GAC3BohL,EAAKF,EAASh9J,UAAUlkB,EAAM,QAG5BjlF,EAAOomQ,EAAGj5K,MAAM,YACjBntF,EAAKsyE,OAAS,GAAiB,KAAZtyE,EAAK,IACzBA,EAAKgyG,SAMLs0J,WAAYF,EACZG,YAAaF,EACbrmQ,KAAMA,EACN+1M,MANkB,KAAPswD,EAAO,GAAWp5J,EAAK+4J,kBAAkBK,KA6BxDp5J,EAAKu5J,YAAc,SAASC,OACtBC,EAAOz5J,EAAKi5J,cAAcO,GAC1BE,EAAAA,CAEF3mQ,KAAM0mQ,EAAKJ,WAEXvwD,MAAO2wD,EAAKH,YAQZK,QAAS,SAASpyL,eACM,IAAPA,EAAsBkyL,EAAK1mQ,KAAO0mQ,EAAK1mQ,KAAKw0E,IAU7DqyL,SAAU,SAASnlQ,EAAG8yE,OAChBiqL,cACa,IAAP/8P,EACR+8P,EAAOiI,EAAK3wD,OAEZ0oD,EAAOiI,EAAK3wD,MAAMr0M,UACO,IAAP8yE,IACfiqL,EAAOA,EAAKjqL,IAGViqL,GAETqI,aAAc,SAASplQ,EAAG2gH,OAEpB0kJ,EAAOJ,EAAIE,SAASnlQ,UACrBqlQ,EACMA,EAAKA,EAAKz0L,OAAS,GAEnB+vC,WAKNskJ,GAcT15J,EAAK+5J,SAAW,SAAShnQ,EAAM+1M,EAAOowD,GAEpCnmQ,EAAOinQ,OAAO98K,QAAQnqF,GAAQA,EAAK23E,KAAK,KAAO33E,MAE3CknQ,EAAOD,OAAO/tH,MAAM68D,GAAAA,WACxBowD,EAAWA,GAAY,GAChBnmQ,GACHknQ,EAAK50L,OAAS,EAAM,IAAM40L,EAAQ,KAClCf,EAAS7zL,OAAS,EAAM,IAAM6zL,EAAY,KAWhDl5J,EAAKs0J,QAAU,SAASr1J,WACdlmB,KAAQkmB,KACXA,EAAIrE,eAAe7hB,UACb,SAGJ,GAYTinB,EAAKo3H,OAAS,SAASA,WAGjB15I,EAEAyoB,EAJAypG,EAAK,MAMLsqD,EAAO,EAEP7zJ,EAAAA,GAEAlqB,EAAO,EAEJuB,EAAQkyH,EAAGlqI,KAAK0xJ,IAAAA,EACrBjxH,EAAOixH,EAAOl7H,UAAU/f,EAAMyzH,EAAG3zG,UAAY,IAErC52B,OAAS,GACfghC,EAAMn7B,KAAKi7B,GAEbhqB,EAAOyzH,EAAG3zG,cAENxmG,EAAOioF,EAAM,GAAG,UACbjoF,OACF,QACA,IAEAykQ,EAAOzjL,UAAUpR,OAClBghC,EAAMn7B,KAAKuL,UAAmB,EAATyjL,MAErB7zJ,EAAMn7B,KAAK,iBAMV,IACHm7B,EAAMn7B,KAAK,mBAGXm7B,EAAMn7B,KAAK,KAAOz1E,EAAO,cAI7B4wG,EAAMn7B,KAAKksJ,EAAOl7H,UAAU/f,IACrBkqB,EAAM37B,KAAK,KAQpBs1B,EAAKm6J,aAAe,SAASj1J,EAAQk1J,EAAUC,EAAWC,OAWpDjmQ,EAAI6wG,EAAQr4B,EAAIyyB,MAAM86J,EAAWp0L,KAAKu0L,IAAIH,IAAa,EAAIA,EAC3Dp8H,OAAkBloI,IAAdukQ,EAA0B,IAAMA,EACpCl7G,OAAsBrpJ,IAAlBwkQ,EACP,IAAMA,EAAeh+K,EAAIjoF,EAAI,EAAI,IAAM,GACpCkzE,EAAIf,SAAUnyE,EAAI2xE,KAAKu0L,KAAKlmQ,GAAK,GAAGmmQ,QAAQ3tL,GAAK,IAAM,GACvD6kB,EAAKnqB,EAAElC,OAAS,EAAKkC,EAAElC,OAAS,EAAI,SACjCiX,GAAKoV,EAAInqB,EAAEtB,OAAO,EAAGyrB,GAAKytD,EAAI,IACnC53E,EAAEtB,OAAOyrB,GAAGpY,QAAQ,iBAAkB,KAAO6lE,IAC5CtyE,EAAImxD,EAAIh4D,KAAKu0L,IAAIlmQ,EAAIkzE,GAAGizL,QAAQ3tL,GAAGrH,MAAM,GAAK,KAQnDw6B,EAAKy6J,WAAa,SAASp9J,UAEvBA,EADCA,GAAQ,WACF2C,EAAKm6J,aAAa98J,EAAO,WAAY,EAAG,IAAK,IAAM,OAClDA,GAAQ,QACT2C,EAAKm6J,aAAa98J,EAAO,QAAS,EAAG,IAAK,IAAM,OAC/CA,GAAQ,KACT2C,EAAKm6J,aAAa98J,EAAO,KAAM,GAAK,OAEpC2C,EAAKm6J,aAAa98J,EAAM,GAAK,UAaxC2C,EAAK06J,YAAc,SAASC,UACF,IAArBA,EAAG/uL,QAAQ,KACLo0B,EAAK46J,cAAcD,IAEJ,IAArBA,EAAG/uL,QAAQ,KACLo0B,EAAK66J,cAAcF,GAErB,MAUT36J,EAAK46J,cAAgB,SAASD,MAEX,KADjBA,EAAKA,EAAGz6K,MAAM,MACR7a,cACG,aAELqU,EAAIsmB,EAAKyvJ,eACLloL,EAAI,EAAGA,EAAIozL,EAAGt1L,SAAUkC,EAAAA,KAC1BuqC,EAAMtrC,SAASm0L,EAAGpzL,GAAI,OACvB+3B,MAAMwS,UACA,KAETp4B,EAAEk2K,QAAQ99I,UAELp4B,EAAE8nK,YAUXxhJ,EAAK66J,cAAgB,SAASF,WACxBG,EAAS,EAKTC,EAAmC,GAA1B,GAJbJ,EAAKA,EAAGz6K,MAAM,KAAK/R,QAAO,SAASh6E,UACjB,IAAbA,EAAEkxE,UAAgBy1L,GACd,MAEWz1L,OAASy1L,GACzBphL,EAAIsmB,EAAKyvJ,eACLloL,EAAI,EAAGA,EAAI,IAAKA,KAClBozL,EAAGpzL,IAAuB,IAAjBozL,EAAGpzL,GAAGlC,YAKf0zJ,EAAQ/4H,EAAKw2J,WAAWmE,EAAGpzL,IAC5BwxJ,EAAM1zJ,OAAS,GAChBqU,EAAEk2K,QAAQ,GAEZl2K,EAAEi2K,SAAS52B,QARTr/I,EAAE66K,aAAa,EAAGwG,GAClBA,EAAQ,SASLrhL,EAAE8nK,YAYXxhJ,EAAKg7J,UAAY,SAASjiC,UACJ,IAAjBA,EAAM1zJ,OACA26B,EAAKi7J,YAAYliC,GAEN,KAAjBA,EAAM1zJ,OACA26B,EAAKk7J,YAAYniC,GAEnB,MAWT/4H,EAAKi7J,YAAc,SAASliC,MACN,IAAjBA,EAAM1zJ,cACA,aAELs1L,EAAAA,GACIpzL,EAAI,EAAGA,EAAIwxJ,EAAM1zJ,SAAUkC,EACjCozL,EAAGzvL,KAAK6tJ,EAAM1gJ,WAAW9Q,WAEpBozL,EAAGjwL,KAAK,MAWjBs1B,EAAKk7J,YAAc,SAASniC,MACN,KAAjBA,EAAM1zJ,cACA,aAELs1L,EAAAA,GACAQ,EAAAA,GACAC,EAAe,EACX7zL,EAAI,EAAGA,EAAIwxJ,EAAM1zJ,OAAQkC,GAAK,EAAA,SAChCnB,EAAM45B,EAAK8yJ,WAAW/5B,EAAMxxJ,GAAKwxJ,EAAMxxJ,EAAI,IAE9B,MAAXnB,EAAI,IAAsB,MAARA,GACtBA,EAAMA,EAAIH,OAAO,MAER,MAARG,EAAQ,KACL+V,EAAOg/K,EAAWA,EAAW91L,OAAS,GACtCkjC,EAAMoyJ,EAAGt1L,OACT8W,GAAQosB,IAAQpsB,EAAK/W,IAAM,GAG7B+W,EAAK/W,IAAMmjC,EACPpsB,EAAK/W,IAAM+W,EAAK/G,MACjB+lL,EAAWC,GAAch2L,IAAM+1L,EAAWC,GAAchmL,QACzDgmL,EAAeD,EAAW91L,OAAS,IALrC81L,EAAWjwL,KAAAA,CAAMkK,MAAOmzB,EAAKnjC,IAAKmjC,IAStCoyJ,EAAGzvL,KAAK9E,MAEP+0L,EAAW91L,OAAS,EAAA,KACjBw+I,EAAQs3C,EAAWC,GAEpBv3C,EAAMz+I,IAAMy+I,EAAMzuI,MAAQ,IAC3BulL,EAAG9vL,OAAOg5I,EAAMzuI,MAAOyuI,EAAMz+I,IAAMy+I,EAAMzuI,MAAQ,EAAG,IACjC,IAAhByuI,EAAMzuI,OACPulL,EAAGzhL,QAAQ,IAEI,IAAd2qI,EAAMz+I,KACPu1L,EAAGzvL,KAAK,YAIPyvL,EAAGjwL,KAAK,MAYjBs1B,EAAKq7J,cAAgB,SAAStmQ,EAAS0lK,MACf,mBAAZ1lK,IACR0lK,EAAW1lK,EACXA,EAAAA,IAEFA,EAAUA,GAAAA,GACP,UAAWirG,IAASjrG,EAAQghK,cACtB0E,EAAS,KAAMz6D,EAAKs7J,UAEL,oBAAdt1F,WACR,wBAAyBA,WACzBA,UAAUu1F,oBAAsB,SAChCv7J,EAAKs7J,MAAQt1F,UAAUu1F,oBAChB9gG,EAAS,KAAMz6D,EAAKs7J,UAER,oBAAXE,cAERx7J,EAAKs7J,MAAQ,EACN7gG,EAAS,KAAMz6D,EAAKs7J,UAEV,oBAATG,YAERz7J,EAAKs7J,MAAQ,EACN7gG,EAAS,KAAMz6D,EAAKs7J,WAIzBI,EAAU7uC,IAAIC,gBAAAA,IAAoB2uC,KAAAA,CAAM,IAAA,WAExC/7J,KAAK4mE,iBAAiB,WAAW,SAASnyK,WAEpCwnQ,EAAKx9J,KAAKunE,MACVk2F,EAAKD,EAAK,EACRx9J,KAAKunE,MAAQk2F,IACnBl8J,KAAK8zJ,YAAAA,CAAamI,GAAIA,EAAIC,GAAIA,QAEhCp9J,WACJ,OAAA,CAASt3B,KAAM,6BAKf,SAAA20L,EAAgB91L,EAAK+1L,EAASC,MACb,IAAZD,EAAY,KAETE,EAAMh2L,KAAK6nC,MAAM9nC,EAAID,QAAO,SAASk2L,EAAKhuJ,UACrCguJ,EAAMhuJ,IACZ,GAAKjoC,EAAIV,eACZ26B,EAAKs7J,MAAQt1L,KAAKD,IAAI,EAAGi2L,GACzBnvC,IAAIE,gBAAgB2uC,GACbjhG,EAAS,KAAMz6D,EAAKs7J,QAQ/B,SAAaS,EAAYthG,WACnBwhG,EAAAA,GACAC,EAAAA,GACI30L,EAAI,EAAGA,EAAIw0L,IAAcx0L,EAAAA,KAC3B40L,EAAAA,IAAaX,OAAOE,GACxBS,EAAO71F,iBAAiB,WAAW,SAASnyK,MAC1C+nQ,EAAQhxL,KAAK/2E,EAAE24J,MACZovG,EAAQ72L,SAAW02L,EAAAA,SACZx0L,EAAI,EAAGA,EAAIw0L,IAAcx0L,EAC/B00L,EAAQ10L,GAAG60L,YAEb3hG,EAAS,KAAMyhG,OAGnBD,EAAQ/wL,KAAKixL,OAEP50L,EAAI,EAAGA,EAAIw0L,IAAcx0L,EAC/B00L,EAAQ10L,GAAGisL,YAAYjsL,GAvBzBiD,CAAIuxL,GAAY,SAASliK,EAAKqiK,GAC5Bn2L,EAAImF,KA0BR,SAAgB6wL,EAAYG,WAEtBG,EAAAA,GACIhoQ,EAAI,EAAGA,EAAI0nQ,IAAc1nQ,UAC3BioQ,EAAKJ,EAAQ7nQ,GACbkoQ,EAAUF,EAAShoQ,GAAAA,GACfkzE,EAAI,EAAGA,EAAIw0L,IAAcx0L,KAC5BlzE,IAAMkzE,OAGLi1L,EAAKN,EAAQ30L,IACb+0L,EAAGX,GAAKa,EAAGb,IAAMW,EAAGX,GAAKa,EAAGZ,IAC7BY,EAAGb,GAAKW,EAAGX,IAAMa,EAAGb,GAAKW,EAAGV,KAC7BW,EAAQrxL,KAAK3D,UAOZ80L,EAASv2L,QAAO,SAASC,EAAKw2L,UAC5Bv2L,KAAKD,IAAIA,EAAKw2L,EAAQl3L,UAC5B,GAhDQS,CAAOi2L,EAAYG,IAC5BL,EAAO91L,EAAK+1L,EAAU,EAAGC,MAd7BF,CAAAA,GAAW,EAAG,8HC7vFZ/hD,EAAAA,GACJrmN,EAAOC,QAAUomN,MAGb2iD,EAAAA,GAWJ3iD,EAAIp2G,OAAS,SAAStU,EAAO0vI,EAAUg4B,MACd,iBAAbh4B,YACE35H,UAAU,wCAEPrvG,IAAZghQ,GAA4C,iBAAZA,YACvB3xJ,UAAU,mCAGlB+5H,EAAS,MAER9vI,aAAiBypI,gBAIhBtxJ,EAAI,EACJi5D,EAAOs+F,EAASz5J,OAChB4T,EAAQ6lJ,EAASnmI,OAAO,GACxB+jK,EAAAA,CAAU,OACVn1L,EAAI,EAAGA,EAAI6nB,EAAM/pB,SAAUkC,EAAAA,SACrBmqB,EAAI,EAAGusI,EAAQ7uI,EAAM7nB,GAAImqB,EAAIgrK,EAAOr3L,SAAUqsB,EACpDusI,GAASy+B,EAAOhrK,IAAM,EACtBgrK,EAAOhrK,GAAKusI,EAAQz9F,EACpBy9F,EAASA,EAAQz9F,EAAQ,OAGrBy9F,EAAQ,GACZy+B,EAAOxxL,KAAK+yJ,EAAQz9F,GACpBy9F,EAASA,EAAQz9F,EAAQ,MAKzBj5D,EAAI,EAAgB,IAAb6nB,EAAM7nB,IAAYA,EAAI6nB,EAAM/pB,OAAS,IAAKkC,EACnD23J,GAAUjmJ,MAGR1R,EAAIm1L,EAAOr3L,OAAS,EAAGkC,GAAK,IAAKA,EACnC23J,GAAUJ,EAAS49B,EAAOn1L,SAzB5B23J,EAkGJ,SAA+B9vI,EAAO0vI,OAChCv3J,EAAI,EACJi5D,EAAOs+F,EAASz5J,OAChB4T,EAAQ6lJ,EAASnmI,OAAO,GACxB+jK,EAAAA,CAAU,OACVn1L,EAAI,EAAGA,EAAI6nB,EAAM/pB,WAAYkC,EAAAA,SACvBmqB,EAAI,EAAGusI,EAAQ7uI,EAAMoZ,GAAGjhC,GAAImqB,EAAIgrK,EAAOr3L,SAAUqsB,EACvDusI,GAASy+B,EAAOhrK,IAAM,EACtBgrK,EAAOhrK,GAAKusI,EAAQz9F,EACpBy9F,EAASA,EAAQz9F,EAAQ,OAGrBy9F,EAAQ,GACZy+B,EAAOxxL,KAAK+yJ,EAAQz9F,GACpBy9F,EAASA,EAAQz9F,EAAQ,MAIzB0+F,EAAS,OAGT33J,EAAI,EAAmB,IAAhB6nB,EAAMoZ,GAAGjhC,IAAYA,EAAI6nB,EAAM/pB,SAAW,IAAKkC,EACxD23J,GAAUjmJ,MAGR1R,EAAIm1L,EAAOr3L,OAAS,EAAGkC,GAAK,IAAKA,EACnC23J,GAAUJ,EAAS49B,EAAOn1L,WAGrB23J,EA/HIy9B,CAAsBvtK,EAAO0vI,MA6BrCg4B,EAAAA,KACG96H,EAAAA,IAAY5kB,OAAO,OAAS0/I,EAAU,IAAK,KAC/C53B,EAASA,EAAOxhJ,MAAMs+C,GAAOtxD,KAAK,eAG7Bw0J,GAWTplB,EAAIt1G,OAAS,SAASpV,EAAO0vI,MACP,iBAAV1vI,YACE+V,UAAU,gCAEC,iBAAb25H,YACE35H,UAAU,oCAGlBy3J,EAAQH,EAAkB39B,OAC1B89B,EAAAA,CAEFA,EAAQH,EAAkB39B,GAAAA,WAClBv3J,EAAI,EAAGA,EAAIu3J,EAASz5J,SAAUkC,EACpCq1L,EAAM99B,EAASzmJ,WAAW9Q,IAAMA,EAKpC6nB,EAAQA,EAAM9V,QAAQ,MAAO,QAEzBknD,EAAOs+F,EAASz5J,OAChB4T,EAAQ6lJ,EAASnmI,OAAO,GACxBogI,EAAAA,CAAS,OACLxxJ,EAAI,EAAGA,EAAI6nB,EAAM/pB,OAAQkC,IAAAA,KAC3BzzE,EAAQ8oQ,EAAMxtK,EAAM/W,WAAW9Q,YACtBzxE,IAAVhC,iBAIK49F,EAAI,EAAGusI,EAAQnqO,EAAO49F,EAAIqnI,EAAM1zJ,SAAUqsB,EAChDusI,GAASlF,EAAMrnI,GAAK8uC,EACpBu4F,EAAMrnI,GAAa,IAARusI,EACXA,IAAU,OAGNA,EAAQ,GACZlF,EAAM7tJ,KAAa,IAAR+yJ,GACXA,IAAU,UAKNxpO,EAAI,EAAG26F,EAAM36F,KAAOwkF,GAASxkF,EAAI26F,EAAM/pB,OAAS,IAAK5wE,EAC3DskO,EAAM7tJ,KAAK,eAGQ,IAAXm4K,EACDA,EAAOx5F,KAAKkvE,EAAMzY,eAGhBuY,WAAWE,EAAMzY,wDCjJ9B,IAAA8+B,EAAAzrP,EAAA,WAEAyrP,EAAA8B,IAAA9B,EAAA8B,KAAA,GACA,IAAA2R,EAAAp/P,EAAAC,QAAA0rP,EAAA8B,IAAA2R,KAAAzT,EAAAyT,KAAAzT,EAAAyT,MAAA,GAGA,SAAAgK,EAAAx4K,EAAApxF,GACA4/P,EAAAxuK,GAAApxF,EACA4/P,EAAA5/P,GAAAoxF,EAGA,SAAAy4K,EAAAz4K,EAAApxF,GACA4/P,EAAAxuK,GAAApxF,EAIA4pQ,EAAA,uBAAA,iBAIAA,EAAA,uBAAA,wBACAA,EAAA,uBAAA,yBACAA,EAAA,uBAAA,cACAA,EAAA,uBAAA,QACAA,EAAA,uBAAA,cACAA,EAAA,wBAAA,cACAA,EAAA,wBAAA,2BACAA,EAAA,wBAAA,2BACAA,EAAA,wBAAA,2BAEAA,EAAA,cAAA,cAEAA,EAAA,oBAAA,iBAEAA,EAAA,eAAA,UAEAA,EAAA,gBAAA,QACAA,EAAA,yBAAA,UACAA,EAAA,yBAAA,UACAA,EAAA,yBAAA,UACAA,EAAA,qBAAA,OAGAA,EAAA,uBAAA,QACAA,EAAA,uBAAA,cACAA,EAAA,uBAAA,iBACAA,EAAA,uBAAA,0BACAA,EAAA,uBAAA,gBACAA,EAAA,uBAAA,iBAGAA,EAAA,uBAAA,gBACAA,EAAA,uBAAA,oBACAA,EAAA,uBAAA,eACAA,EAAA,uBAAA,iBACAA,EAAA,uBAAA,eACAA,EAAA,uBAAA,oBACAA,EAAA,uBAAA,qBACAA,EAAA,uBAAA,uBACAA,EAAA,wBAAA,oBAEAA,EAAA,wBAAA,gBACAA,EAAA,wBAAA,cACAA,EAAA,0BAAA,mBAGAA,EAAA,6BAAA,UACAA,EAAA,6BAAA,uBACAA,EAAA,6BAAA,WACAA,EAAA,6BAAA,UACAA,EAAA,6BAAA,aACAA,EAAA,6BAAA,mBAGAA,EAAA,wBAAA,cACAA,EAAA,wBAAA,eAEAA,EAAA,0BAAA,0BACAA,EAAA,0BAAA,yBACAA,EAAA,0BAAA,mCACAA,EAAA,0BAAA,mCACAA,EAAA,0BAAA,8BACAA,EAAA,0BAAA,6BAGAA,EAAA,qBAAA,gBACAA,EAAA,qBAAA,kBACAA,EAAA,qBAAA,kBACAA,EAAA,sBAAA,kBACAA,EAAA,sBAAA,kBAGAA,EAAA,qBAAA,gBACAA,EAAA,yBAAA,cACAA,EAAA,0BAAA,cACAA,EAAA,0BAAA,cAGAA,EAAA,UAAA,cACAA,EAAA,UAAA,cACAA,EAAA,UAAA,eACAA,EAAA,UAAA,gBACAA,EAAA,UAAA,uBACAA,EAAA,UAAA,iBACAA,EAAA,WAAA,oBACAA,EAAA,WAAA,0BACAA,EAAA,WAAA,eACAA,EAAA,WAAA,oBACAA,EAAA,WAAA,cACAA,EAAA,2BAAA,kDACAA,EAAA,2BAAA,0CAGAA,EAAA,wBAAA,cACAA,EAAA,yBAAA,aACAC,EAAA,WAAA,0BACAA,EAAA,WAAA,iBACAA,EAAA,WAAA,uBACAA,EAAA,WAAA,uBACAA,EAAA,WAAA,iBACAA,EAAA,WAAA,sBACAA,EAAA,WAAA,kBACAA,EAAA,WAAA,iBACAA,EAAA,WAAA,8BACAA,EAAA,YAAA,oBACAA,EAAA,YAAA,mBACAA,EAAA,YAAA,qBACAA,EAAA,YAAA,oBACAD,EAAA,YAAA,wBACAA,EAAA,YAAA,YACAC,EAAA,YAAA,yBACAD,EAAA,YAAA,kBACAA,EAAA,YAAA,iBACAA,EAAA,YAAA,oBACAC,EAAA,YAAA,aACAA,EAAA,YAAA,aACAA,EAAA,YAAA,kBACAA,EAAA,YAAA,mBACAA,EAAA,YAAA,kBACAA,EAAA,YAAA,yBACAA,EAAA,YAAA,4BACAA,EAAA,YAAA,qBACAA,EAAA,YAAA,4BACAA,EAAA,YAAA,qBACAA,EAAA,YAAA,mBACAD,EAAA,YAAA,yBACAA,EAAA,YAAA,uBACAC,EAAA,YAAA,kBACAA,EAAA,YAAA,qBACAD,EAAA,YAAA,0BACAC,EAAA,YAAA,qBACAD,EAAA,YAAA,eACAC,EAAA,YAAA,eACAA,EAAA,YAAA,oBAGAD,EAAA,0BAAA,iBACAA,EAAA,oBAAA,uBACAA,EAAA,oBAAA,cACAA,EAAA,oBAAA,cACAA,EAAA,oBAAA,eACAA,EAAA,oBAAA,mBACAA,EAAA,oBAAA,+DCtJA,IAAAzd,EAAAzrP,EAAA,WAaA,GAZAA,EAAA,SACAA,EAAA,UACAA,EAAA,SACAA,EAAA,QACAA,EAAA,UACAA,EAAA,YACAA,EAAA,SACAA,EAAA,YACAA,EAAA,SACAA,EAAA,SACAA,EAAA,eAEA,IAAAopQ,EACA,IAAAA,EAAA3d,EAAA4d,KAAAD,WAIA,IAAA1b,EAAAjC,EAAAiC,KAGAH,EAAA9B,EAAA8B,IAAA9B,EAAA8B,KAAA,GACAztP,EAAAC,QAAAwtP,EAAA+b,IAAA7d,EAAA6d,IAAA7d,EAAA6d,KAAA,GACA,IAAApK,EAAA3R,EAAA2R,KAIAqK,EAAA,CACAjqQ,KAAA,0BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,8CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,gCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,iBACA,CACAn/P,KAAA,iCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAoE,YAAA,sBAEA,CAEAp/P,KAAA,wCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA+M,YACAkB,aAAA,EACAmE,QAAA,mBAMA+K,EAAA,CACAlqQ,KAAA,kBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,oCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,wCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,UACA,CACAn/P,KAAA,yBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,8BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA+M,YACAkB,aAAA,EACAmE,QAAA,WACA,CACAn/P,KAAA,wCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,qBACA,CACAn/P,KAAA,mCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAjuH,UAAA,EACAoyH,QAAA,aACA,CAEAn/P,KAAA,6BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAjuH,UAAA,EACAlsI,MAAA,CAAA,CACAb,KAAA,uCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,gBAIA,CACAn/P,KAAA,mCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,uCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,UACA,CACAn/P,KAAA,sCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA+M,YACAkB,aAAA,EACAmE,QAAA,aAKAgL,EAAA,CACAnqQ,KAAA,mBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,wBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA+M,YACAkB,aAAA,EACAmE,QAAA,QACA,CACAn/P,KAAA,8BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,gBAuwBA,SAAA3+I,EAAA4pJ,EAAAtkC,GACA,OAAAskC,EAAAjoL,QAAA2gF,OAAAgjE,GAAAO,SAAAkoB,WAGA,SAAA8b,EAAAC,GAEA,IAAAC,EACA,GAAAD,GAIA,KADAC,EAAAtc,EAAA2R,KAAAxR,EAAA8O,SAAAoN,KACA,CACA,IAAA5tL,EAAA,IAAAupB,MAAA,wBAKA,MAJAvpB,EAAAsgL,IAAAsN,EACA5tL,EAAAkwK,UAAA,CACA,eAAA,iBAAA,iBAAA,iBACA,kBACAlwK,QATA6tL,EAAA,eAYA,OAAAC,EAAAD,GAGA,SAAAC,EAAAD,GACA,IAAAt7F,EAAAk9E,EAAAie,GACA,OAAAG,GACA,IAAA,iBACAt7F,EAAAk9E,EAAAie,GAAAK,OACA,IAAA,eACA,IAAA,iBACA,IAAA,iBACA,IAAA,iBACAF,EAAAA,EAAAv3L,OAAA,GAAAuD,cACA,MACA,QACA,IAAAmG,EAAA,IAAAupB,MAAA,8BAKA,MAJAvpB,EAAAguL,UAAAH,EACA7tL,EAAAkwK,UAAA,CACA,eAAA,iBAAA,iBAAA,iBACA,kBACAlwK,EAEA,IAAAuyF,KAAAs7F,KAAAt7F,GACA,MAAA,IAAAhpE,MAAA,2BAAAskK,GAEA,OAAAt7F,EAAAs7F,GAAAlpQ,SAxwBA4sP,EAAA0c,sBAAA,SAAA3+J,EAAAs4H,EAAAxiO,IAEAA,EAAAA,GAAA,IACA8oQ,SAAA9oQ,EAAA8oQ,UAAA,EACA9oQ,EAAA4uF,MAAA5uF,EAAA4uF,OAAA,KACA5uF,EAAA4oQ,UAAA5oQ,EAAA4oQ,WAAA,SACA5oQ,EAAAyoQ,aAAAzoQ,EAAAyoQ,cAAA,OAGA,IAGAM,EACAC,EACAC,EALAC,EAAA7e,EAAA5wI,OAAA0vJ,aAAAnpQ,EAAA8oQ,UACAl6K,EAAA5uF,EAAA4uF,MACAw6K,EAAA9c,EAAA2Q,aAAAruK,GAIA,GAAA,IAAA5uF,EAAA4oQ,UAAA/xL,QAAA,QAAA,QAAA72E,EAAA4oQ,UAAA,CAEA,IAAAS,EAAAC,EAAAC,EACA,OAAAvpQ,EAAA4oQ,WACA,IAAA,SACAG,EAAA,GACAM,EAAA,GACAC,EAAAxL,EAAA,cACAyL,EAAAlf,EAAAmf,IAAAC,uBACA,MACA,IAAA,SACAV,EAAA,GACAM,EAAA,GACAC,EAAAxL,EAAA,cACAyL,EAAAlf,EAAAmf,IAAAC,uBACA,MACA,IAAA,SACAV,EAAA,GACAM,EAAA,GACAC,EAAAxL,EAAA,cACAyL,EAAAlf,EAAAmf,IAAAC,uBACA,MACA,IAAA,MACAV,EAAA,EACAM,EAAA,EACAC,EAAAxL,EAAA,OACAyL,EAAAlf,EAAAqf,IAAAD,uBACA,MACA,QAGA,MAFA7uL,EAAA,IAAAupB,MAAA,8DACAykK,UAAA5oQ,EAAA4oQ,UACAhuL,EAIA,IAAA6tL,EAAA,WAAAzoQ,EAAAyoQ,aAAA1nK,cACAunK,EAAAI,EAAAD,GAGAkB,EAAAtf,EAAAuf,MAAAC,OAAArnC,EAAA0mC,EAAAt6K,EAAAm6K,EAAAT,GACAwB,EAAAzf,EAAA5wI,OAAA0vJ,aAAAE,IACAU,EAAAR,EAAAI,IACAtpL,MAAAypL,GACAC,EAAA/oG,OAAAsrF,EAAAC,MAAAriJ,IACA6/J,EAAAjlC,SACAmkC,EAAAc,EAAA5/B,OAAAsiB,WAGA,IAAA7qK,EA4sBA,SAAAsnL,EAAAE,EAAAL,EAAAN,GACA,IAAA7mL,EAAA0qK,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EAAAkR,GAEA5c,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAsR,EAAA3c,cAGA,iBAAAgc,GACA7mL,EAAA7iF,MAAAo3E,KAEAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAzN,EAAAp/I,KAAAw2J,WAAAsH,EAAAt/J,SAAA,MAEA6iJ,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAA9O,EAAA2R,KAAA2K,IAAAhc,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAgN,MAAA,EAAA,OAGA,OAAAr2K,EApuBAooL,CAAAd,EAAAE,EAAAL,EAAAN,GAEAO,EAAA1c,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CACApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAA6C,EAAA,YAAArR,YACAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CACApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAA6C,EAAA,aAAArR,YAEA7qK,IAGA0qK,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CACApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAqO,GAAA7c,YAEAH,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EAAA8R,aAIA,CA2BA,IAAAlvL,EA3BA,GAAA,SAAA56E,EAAA4oQ,UA6BA,MAFAhuL,EAAA,IAAAupB,MAAA,8DACAykK,UAAA5oQ,EAAA4oQ,UACAhuL,EA3BAmuL,EAAA,GAEA,IAGAgB,EAHAE,EAAA,IAAA5f,EAAAp/I,KAAA8zJ,WAAAmK,GACAS,EAAAxd,EAAA+b,IAAAgC,kBAAA1nC,EAAAynC,EAAA,EAAAr7K,EAAAm6K,GACAe,EAAA3d,EAAA+b,IAAAgC,kBAAA1nC,EAAAynC,EAAA,EAAAr7K,EAAAm6K,IACAgB,EAAA1f,EAAAqf,IAAAD,uBAAAE,IACAtpL,MAAAypL,GACAC,EAAA/oG,OAAAsrF,EAAAC,MAAAriJ,IACA6/J,EAAAjlC,SACAmkC,EAAAc,EAAA5/B,OAAAsiB,WAEAuc,EAAA1c,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CACApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAA6C,EAAA,oCAAArR,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EAAAkR,GAEA5c,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAsR,EAAA3c,gBAiBA,OAPAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEAsQ,EAEA1c,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EAAAiR,MAaA9c,EAAAge,sBAAA,SAAAjgK,EAAAs4H,GACA,IAAAi6B,EAAA,KAGAY,EAAA,GACAj/H,EAAA,GACA,IAAAkuH,EAAAhlB,SAAAp9H,EAAAi+J,EAAA9K,EAAAj/H,GAAA,CACA,IAAAxjD,EAAA,IAAAupB,MAAA,+FAGA,MADAvpB,EAAAwjD,OAAAA,EACAxjD,EAIA,IAAAsgL,EAAA5O,EAAA8O,SAAAiC,EAAA+M,eACAL,EAAA5d,EAAA+b,IAAAmC,UAAAnP,EAAAmC,EAAAiN,iBAAA9nC,GAGA+nC,EAAAlgB,EAAAp/I,KAAAyvJ,aAAA2C,EAAA4L,eAOA,OALAc,EAAA/oG,OAAAupG,GACAR,EAAAjlC,WACA23B,EAAAnQ,EAAAmO,QAAAsP,EAAA5/B,SAGAsyB,GAWAtQ,EAAAqe,yBAAA,SAAAC,EAAA1I,GAEA,IAAAjnL,EAAA,CACA3I,KAAA,wBACAb,KAAAg7K,EAAAC,MAAAke,GAAAhe,YAEA,OAAApC,EAAAqgB,IAAA/7J,OAAA7zB,EAAA,CAAAinL,QAAAA,KAWA5V,EAAAwe,2BAAA,SAAAD,GACA,IAAA5vL,EAAAuvK,EAAAqgB,IAAAj7J,OAAAi7J,GAAA,GAEA,GAAA,0BAAA5vL,EAAA3I,KAAA,CACA,IAAAyI,EAAA,IAAAupB,MAAA,iGAGA,MADAvpB,EAAAgwL,WAAA9vL,EAAA3I,KACAyI,EAEA,GAAAE,EAAA+vL,UAAA,cAAA/vL,EAAA+vL,SAAA14L,KACA,MAAA,IAAAgyB,MAAA,uEAKA,OAAAmoJ,EAAAmO,QAAA3/K,EAAAxJ,OA6BA66K,EAAA2e,qBAAA,SAAAC,EAAAvoC,EAAAxiO,GAGA,KADAA,EAAAA,GAAA,IACAgrQ,OAAA,CAEA,IAAAvO,EAAAtQ,EAAA8e,kBAAA9e,EAAAK,iBAAAue,IAEA,OADAtO,EAAAtQ,EAAA0c,sBAAApM,EAAAj6B,EAAAxiO,GACAmsP,EAAAqe,yBAAA/N,GAIA,IAAAmM,EACAkB,EACAf,EACAQ,EACA,OAAAvpQ,EAAA4oQ,WACA,IAAA,SACAA,EAAA,cACAG,EAAA,GACAe,EAAAzf,EAAA5wI,OAAA0vJ,aAAA,IACAI,EAAAlf,EAAAmf,IAAAC,uBACA,MACA,IAAA,SACAb,EAAA,cACAG,EAAA,GACAe,EAAAzf,EAAA5wI,OAAA0vJ,aAAA,IACAI,EAAAlf,EAAAmf,IAAAC,uBACA,MACA,IAAA,SACAb,EAAA,cACAG,EAAA,GACAe,EAAAzf,EAAA5wI,OAAA0vJ,aAAA,IACAI,EAAAlf,EAAAmf,IAAAC,uBACA,MACA,IAAA,OACAb,EAAA,eACAG,EAAA,GACAe,EAAAzf,EAAA5wI,OAAA0vJ,aAAA,GACAI,EAAAlf,EAAAqf,IAAAD,uBACA,MACA,IAAA,MACAb,EAAA,UACAG,EAAA,EACAe,EAAAzf,EAAA5wI,OAAA0vJ,aAAA,GACAI,EAAAlf,EAAAqf,IAAAD,uBACA,MACA,QACA,IAAA7uL,EAAA,IAAAupB,MAAA,wEACAnkG,EAAA4oQ,UAAA,MAEA,MADAhuL,EAAAguL,UAAA5oQ,EAAA4oQ,UACAhuL,EAIA,IACAmvL,EAAAR,EADAlf,EAAA6d,IAAAgD,mBAAA1oC,EAAAsnC,EAAA54L,OAAA,EAAA,GAAA63L,IAEAgB,EAAA1pL,MAAAypL,GACAC,EAAA/oG,OAAAsrF,EAAAC,MAAAJ,EAAAK,iBAAAue,KACAhB,EAAAjlC,SAEA,IAAAhqJ,EAAA,CACA3I,KAAA,kBACA04L,SAAA,CACA97J,QAAA,IACA58B,KAAA,aAEAg5L,QAAA,CACAvC,UAAAA,EACAziH,WAAAkkG,EAAAp/I,KAAA8yJ,WAAA+L,GAAA/oK,eAEAzvB,KAAAy4L,EAAA5/B,OAAAsiB,YAEA,OAAApC,EAAAqgB,IAAA/7J,OAAA7zB,IAWAqxK,EAAAC,qBAAA,SAAAse,EAAAloC,GACA,IAAAi6B,EAAA,KAEA3hL,EAAAuvK,EAAAqgB,IAAAj7J,OAAAi7J,GAAA,GAEA,GAAA,0BAAA5vL,EAAA3I,MACA,gBAAA2I,EAAA3I,MACA,oBAAA2I,EAAA3I,KAIA,MAHAyI,EAAA,IAAAupB,MAAA,iIAEAymK,WAAAhwL,EACAA,EAGA,GAAAE,EAAA+vL,UAAA,cAAA/vL,EAAA+vL,SAAA14L,KAAA,CACA,IAAA42L,EACAQ,EACA,OAAAzuL,EAAAqwL,QAAAvC,WACA,IAAA,UACAG,EAAA,EACAQ,EAAAlf,EAAAqf,IAAA0B,uBACA,MACA,IAAA,eACArC,EAAA,GACAQ,EAAAlf,EAAAqf,IAAA0B,uBACA,MACA,IAAA,cACArC,EAAA,GACAQ,EAAAlf,EAAAmf,IAAA4B,uBACA,MACA,IAAA,cACArC,EAAA,GACAQ,EAAAlf,EAAAmf,IAAA4B,uBACA,MACA,IAAA,cACArC,EAAA,GACAQ,EAAAlf,EAAAmf,IAAA4B,uBACA,MACA,IAAA,aACArC,EAAA,EACAQ,EAAA,SAAAlpQ,GACA,OAAAgqP,EAAAghB,IAAAD,uBAAA/qQ,EAAA,KAEA,MACA,IAAA,aACA0oQ,EAAA,EACAQ,EAAA,SAAAlpQ,GACA,OAAAgqP,EAAAghB,IAAAD,uBAAA/qQ,EAAA,KAEA,MACA,IAAA,cACA0oQ,EAAA,GACAQ,EAAA,SAAAlpQ,GACA,OAAAgqP,EAAAghB,IAAAD,uBAAA/qQ,EAAA,MAEA,MACA,QACA,IAAAu6E,EAGA,MAHAA,EAAA,IAAAupB,MAAA,oEACArpB,EAAAqwL,QAAAvC,UAAA,OACAA,UAAA9tL,EAAAqwL,QAAAvC,UACAhuL,EAIA,IAAAkvL,EAAAzf,EAAAp/I,KAAAw2J,WAAA3mL,EAAAqwL,QAAAhlH,YAEA4jH,EAAAR,EADAlf,EAAA6d,IAAAgD,mBAAA1oC,EAAAsnC,EAAA54L,OAAA,EAAA,GAAA63L,IAIA,GAFAgB,EAAA1pL,MAAAypL,GACAC,EAAA/oG,OAAAqpF,EAAAp/I,KAAAyvJ,aAAA5/K,EAAAxJ,QACAy4L,EAAAjlC,SAGA,OAAA23B,EAFAA,EAAAsN,EAAA5/B,OAAAsiB,gBAKAgQ,EAAA3hL,EAAAxJ,KAcA,OAJA,QANAmrL,EADA,0BAAA3hL,EAAA3I,KACAg6K,EAAAge,sBAAA7d,EAAAmO,QAAAgC,GAAAj6B,GAGA8pB,EAAAmO,QAAAgC,MAIAA,EAAAtQ,EAAAmf,mBAAA7O,IAGAA,GAgBAtQ,EAAA+b,IAAAgC,kBAAA,SAAA1nC,EAAA0mC,EAAA55K,EAAAysI,EAAAz8N,EAAAgpQ,GACA,IAAA3rK,EAAAvI,EAEA,GAAA,MAAAk0K,EAAA,CACA,KAAA,SAAAje,EAAAie,IACA,MAAA,IAAAnkK,MAAA,sCAEAmkK,EAAAje,EAAAie,GAAAh9B,KAAA/rO,SAGA,IAAAggM,EAAA+oE,EAAAiD,aACAp7F,EAAAm4F,EAAAkD,YACAv1L,EAAA,IAAAo0K,EAAAp/I,KAAA8zJ,WAGA0M,EAAA,IAAAphB,EAAAp/I,KAAA8zJ,WACA,GAAAv8B,MAAAA,EAAA,CACA,IAAApuI,EAAA,EAAAA,EAAAouI,EAAAlyJ,OAAA8jB,IACAq3K,EAAA1Q,SAAAv4B,EAAAl/I,WAAA8Q,IAEAq3K,EAAA1Q,SAAA,GAIA,IAAAxoL,EAAAk5L,EAAAn7L,SACAiX,EAAA2hL,EAAA54L,SAIA2gJ,EAAA,IAAAo5B,EAAAp/I,KAAA8zJ,WACA9tC,EAAAuuC,aAAAlwK,EAAA6gF,GAMA,IAAAu7F,EAAAv7F,EAAAl/F,KAAAwhL,KAAAlrK,EAAA4oF,GACAu/C,EAAA,IAAA26B,EAAAp/I,KAAA8zJ,WACA,IAAA3qK,EAAA,EAAAA,EAAAs3K,EAAAt3K,IACAs7H,EAAAmrC,QAAAqO,EAAAz1J,GAAArf,EAAA7M,IAOA,IAAAokL,EAAAx7F,EAAAl/F,KAAAwhL,KAAAlgL,EAAA49F,GACA6/C,EAAA,IAAAq6B,EAAAp/I,KAAA8zJ,WACA,IAAA3qK,EAAA,EAAAA,EAAAu3K,EAAAv3K,IACA47H,EAAA6qC,QAAA4Q,EAAAh4J,GAAArf,EAAA7hB,IAIA,IAAA+7I,EAAAoB,EACApB,EAAAwsC,UAAA9qC,GAMA,IAHA,IAAAl4I,EAAA7G,KAAAwhL,KAAAnzP,EAAAigM,GAGA/sH,EAAA,EAAAA,GAAAsF,EAAAtF,IAAA,CAEA,IAAAopJ,EAAA,IAAAyuB,EAAAp/I,KAAA8zJ,WACAnjC,EAAAg/B,SAAA3pC,EAAA+S,SACApI,EAAAg/B,SAAAtsC,EAAA0V,SACA,IAAA,IAAAxqH,EAAA,EAAAA,EAAAuiH,EAAAviH,IACA8uJ,EAAAjoL,QACAioL,EAAAtnG,OAAA46D,EAAA6wB,YACA7wB,EAAA0sC,EAAA/jC,SAKA,IAAAhW,EAAA,IAAA87B,EAAAp/I,KAAA8zJ,WACA,IAAA3qK,EAAA,EAAAA,EAAA+7E,EAAA/7E,IACAm6H,EAAAssC,QAAAj/B,EAAAnoH,GAAArf,EAAAmrG,IAMA,IAAA7/L,EAAAuxE,KAAAwhL,KAAAlrK,EAAA4oF,GAAAl/F,KAAAwhL,KAAAlgL,EAAA49F,GACAy7F,EAAA,IAAAvhB,EAAAp/I,KAAA8zJ,WACA,IAAApiK,EAAA,EAAAA,EAAAj9F,EAAAi9F,IAAA,CACA,IAAAme,EAAA,IAAAuvI,EAAAp/I,KAAA8zJ,WAAAzwC,EAAAm+B,SAAAt8E,IACAl3D,EAAA,IACA,IAAA7kB,EAAAm6H,EAAAj+I,SAAA,EAAA8jB,GAAA,EAAAA,IACA6kB,IAAA,EACAA,GAAAs1G,EAAA96G,GAAArf,GAAA0mB,EAAArH,GAAArf,GACA0mB,EAAAwlJ,MAAAlsK,EAAA,IAAA6kB,GAEA2yJ,EAAA9Q,UAAAhgJ,GAEAwzG,EAAAs9C,EAGA31L,EAAA6kL,UAAAl/B,GAIA,OADA3lJ,EAAAuqL,SAAAvqL,EAAA3F,SAAAhxE,GACA22E,GAYAk2K,EAAA+b,IAAAmC,UAAA,SAAAnP,EAAAt5K,EAAA4gJ,GACA,OAAA04B,GACA,KAAA/O,EAAA2R,KAAA,WACA,OAAA3R,EAAA+b,IAAA2D,kBAAA3Q,EAAAt5K,EAAA4gJ,GAEA,KAAA2pB,EAAA2R,KAAA,mCACA,KAAA3R,EAAA2R,KAAA,6BACA,OAAA3R,EAAA+b,IAAA4D,sBAAA5Q,EAAAt5K,EAAA4gJ,GAEA,QACA,IAAA5nJ,EAAA,IAAAupB,MAAA,0DAOA,MANAvpB,EAAAsgL,IAAAA,EACAtgL,EAAAmxL,cAAA,CACA,aACA,kCACA,6BAEAnxL,IAgBAuxK,EAAA+b,IAAA2D,kBAAA,SAAA3Q,EAAAt5K,EAAA4gJ,GAEA,IAwBA5nJ,EAxBAyiL,EAAA,GACAj/H,EAAA,GACA,IAAAkuH,EAAAhlB,SAAA1lJ,EAAAwmL,EAAA/K,EAAAj/H,GAIA,MAHAxjD,EAAA,IAAAupB,MAAA,yHAEAi6B,OAAAA,EACAxjD,EAKA,IADAsgL,EAAA5O,EAAA8O,SAAAiC,EAAA2O,WACA7f,EAAA2R,KAAA,YAKA,MAJAljL,EAAA,IAAAupB,MAAA,gFAEA+2J,IAAAA,EACAtgL,EAAAmxL,cAAA,CAAA,eACAnxL,EAGA,IADAsgL,EAAA5O,EAAA8O,SAAAiC,EAAAiM,WACAnd,EAAA2R,KAAA,eACA5C,IAAA/O,EAAA2R,KAAA,eACA5C,IAAA/O,EAAA2R,KAAA,eACA5C,IAAA/O,EAAA2R,KAAA,iBACA5C,IAAA/O,EAAA2R,KAAA,OAMA,MALAljL,EAAA,IAAAupB,MAAA,0EAEA+2J,IAAAA,EACAtgL,EAAAmxL,cAAA,CACA,aAAA,aAAA,aAAA,eAAA,UACAnxL,EAIA,IAGAmuL,EACAQ,EAJAL,EAAA7L,EAAA4O,QACAr9K,EAAAy7J,EAAAp/I,KAAAyvJ,aAAA2C,EAAA6O,mBAIA,OAHAt9K,EAAAA,EAAAgrK,OAAAhrK,EAAAte,UAAA,GAGA67K,EAAA2R,KAAA5C,IACA,IAAA,aACA6N,EAAA,GACAQ,EAAAlf,EAAAmf,IAAA4B,uBACA,MACA,IAAA,aACArC,EAAA,GACAQ,EAAAlf,EAAAmf,IAAA4B,uBACA,MACA,IAAA,aACArC,EAAA,GACAQ,EAAAlf,EAAAmf,IAAA4B,uBACA,MACA,IAAA,eACArC,EAAA,GACAQ,EAAAlf,EAAAqf,IAAA0B,uBACA,MACA,IAAA,SACArC,EAAA,EACAQ,EAAAlf,EAAAqf,IAAA0B,uBAKA,IAAA9C,EAAAC,EAAAlL,EAAAmL,QAGAmB,EAAAtf,EAAAuf,MAAAC,OAAArnC,EAAA0mC,EAAAt6K,EAAAm6K,EAAAT,GACAwB,EAAAzM,EAAA8O,MACApC,EAAAR,EAAAI,GAGA,OAFAI,EAAA1pL,MAAAypL,GAEAC,GAeA5d,EAAA+b,IAAA4D,sBAAA,SAAA5Q,EAAAt5K,EAAA4gJ,GAEA,IAAA66B,EAAA,GACAj/H,EAAA,GACA,IAAAkuH,EAAAhlB,SAAA1lJ,EAAAymL,EAAAhL,EAAAj/H,GAIA,MAHAxjD,EAAA,IAAAupB,MAAA,yHAEAi6B,OAAAA,EACAxjD,EAGA,IAIAmuL,EAAAqD,EAAA7C,EAJAL,EAAA7e,EAAAp/I,KAAAyvJ,aAAA2C,EAAA6L,MACAt6K,EAAAy7J,EAAAp/I,KAAAyvJ,aAAA2C,EAAAgP,YAIA,OAHAz9K,EAAAA,EAAAgrK,OAAAhrK,EAAAte,UAAA,GAGA4qL,GACA,KAAA/O,EAAA2R,KAAA,mCACAiL,EAAA,GACAqD,EAAA,EACA7C,EAAAlf,EAAAqf,IAAA4C,gBACA,MAEA,KAAAngB,EAAA2R,KAAA,6BACAiL,EAAA,EACAqD,EAAA,EACA7C,EAAA,SAAAlpQ,EAAAypQ,GACA,IAAAC,EAAA1f,EAAAghB,IAAAD,uBAAA/qQ,EAAA,IAEA,OADA0pQ,EAAA1pL,MAAAypL,EAAA,MACAC,GAEA,MAEA,QACA,IAAAnvL,EAEA,MAFAA,EAAA,IAAAupB,MAAA,0DACA+2J,IAAAA,EACAtgL,EAIA,IAAA0tL,EAAAC,EAAAlL,EAAAmL,QACAnoQ,EAAA8rP,EAAA+b,IAAAgC,kBAAA1nC,EAAA0mC,EAAA,EAAAt6K,EAAAm6K,EAAAT,GAIA,OAHAA,EAAAjoL,QAGAkpL,EAAAlpQ,EAFA8rP,EAAA+b,IAAAgC,kBAAA1nC,EAAA0mC,EAAA,EAAAt6K,EAAAw9K,EAAA9D,KAgBAnc,EAAA+b,IAAAgD,mBAAA,SAAA1oC,EAAA0mC,EAAAH,EAAAT,GACA,GAAA,MAAAA,EAAA,CACA,KAAA,QAAAje,EAAAie,IACA,MAAA,IAAAnkK,MAAA,qCAEAmkK,EAAAje,EAAAie,GAAA97B,IAAAjtO,SAEA,OAAA2pQ,IACAA,EAAA,IAGA,IADA,IAAAqD,EAAA,CAAA7tJ,EAAA4pJ,EAAA9lC,EAAA0mC,IACA54L,EAAA,GAAAkC,EAAA,EAAAlC,EAAAy4L,IAAAv2L,EAAAlC,GAAA,GACAi8L,EAAAp2L,KAAAuoC,EAAA4pJ,EAAAiE,EAAA/5L,EAAA,GAAAgwJ,EAAA0mC,IAEA,OAAAqD,EAAA52L,KAAA,IAAAzE,OAAA,EAAA63L,2OCj6BA,IAAA1e,EAAAzrP,EAAA,WAmPA,SAAA4tQ,EAAAtuQ,EAAA6nF,GAIAskK,EAAA0f,OAAAyC,kBAAAtuQ,GAHA,WACA,OAAA,IAAAmsP,EAAAmf,IAAAiD,UAAAvuQ,EAAA6nF,MApPAnnF,EAAA,YACAA,EAAA,iBACAA,EAAA,UAGAF,EAAAC,QAAA0rP,EAAAmf,IAAAnf,EAAAmf,KAAA,GAqBAnf,EAAAmf,IAAAkD,gBAAA,SAAArsQ,EAAAypQ,EAAA3/B,EAAApkJ,GACA,IAAAgkL,EAAA4C,EAAA,CACAtsQ,IAAAA,EACA8pO,OAAAA,EACAyiC,SAAA,EACA7mL,KAAAA,IAGA,OADAgkL,EAAA1pL,MAAAypL,GACAC,GAkBA1f,EAAAmf,IAAAC,uBAAA,SAAAppQ,EAAA0lF,GACA,OAAA4mL,EAAA,CACAtsQ,IAAAA,EACA8pO,OAAA,KACAyiC,SAAA,EACA7mL,KAAAA,KAuBAskK,EAAAmf,IAAA8C,gBAAA,SAAAjsQ,EAAAypQ,EAAA3/B,EAAApkJ,GACA,IAAAgkL,EAAA4C,EAAA,CACAtsQ,IAAAA,EACA8pO,OAAAA,EACAyiC,SAAA,EACA7mL,KAAAA,IAGA,OADAgkL,EAAA1pL,MAAAypL,GACAC,GAkBA1f,EAAAmf,IAAA4B,uBAAA,SAAA/qQ,EAAA0lF,GACA,OAAA4mL,EAAA,CACAtsQ,IAAAA,EACA8pO,OAAA,KACAyiC,SAAA,EACA7mL,KAAAA,KAYAskK,EAAAmf,IAAAiD,UAAA,SAAAvuQ,EAAA6nF,GACAs6C,GACAwsI,IAEA,IAAAliK,EAAAU,KACAV,EAAAzsG,KAAAA,EACAysG,EAAA5kB,KAAA,IAAAA,EAAA,CACA+mL,UAAA,GACA/C,OAAA,CACAgD,QAAA,SAAAC,EAAAC,GACA,OAAAC,EAAAviK,EAAAwiK,GAAAH,EAAAC,GAAA,IAEAL,QAAA,SAAAI,EAAAC,GACA,OAAAC,EAAAviK,EAAAwiK,GAAAH,EAAAC,GAAA,OAIAtiK,EAAAyiK,OAAA,GAWA/iB,EAAAmf,IAAAiD,UAAAzjK,UAAA6jK,WAAA,SAAA7sQ,GACA,IAAAqrG,KAAA+hK,MAAA,CAIA,IACA3mK,EADApmG,EAAAL,EAAAK,IAQA,GAAA,iBAAAA,GACA,KAAAA,EAAAiwE,QAAA,KAAAjwE,EAAAiwE,QAAA,KAAAjwE,EAAAiwE,QAGA,GAAA+5K,EAAAp/I,KAAA9iB,QAAA9nF,KACA,KAAAA,EAAAiwE,QAAA,KAAAjwE,EAAAiwE,QAAA,KAAAjwE,EAAAiwE,QAAA,CAEAm2B,EAAApmG,EACAA,EAAAgqP,EAAAp/I,KAAAyvJ,eACA,IAAA,IAAAloL,EAAA,EAAAA,EAAAi0B,EAAAn2B,SAAAkC,EACAnyE,EAAAw6P,QAAAp0J,EAAAj0B,UAPAnyE,EAAAgqP,EAAAp/I,KAAAyvJ,aAAAr6P,GAYA,IAAAgqP,EAAAp/I,KAAA9iB,QAAA9nF,GAAA,CACAomG,EAAApmG,EACAA,EAAA,GAGA,IAAAouG,EAAAhI,EAAAn2B,SACA,GAAA,KAAAm+B,GAAA,KAAAA,GAAA,KAAAA,EAAA,CACAA,KAAA,EACA,IAAAj8B,EAAA,EAAAA,EAAAi8B,IAAAj8B,EACAnyE,EAAA81E,KAAAswB,EAAAy5J,aAMA,IAAA7V,EAAAp/I,KAAA9iB,QAAA9nF,IACA,IAAAA,EAAAiwE,QAAA,IAAAjwE,EAAAiwE,QAAA,IAAAjwE,EAAAiwE,OACA,MAAA,IAAA6zB,MAAA,0BAIA,IAAApe,EAAAslB,KAAAtlB,KAAA7nF,KACAmvQ,GAAA,IAAA,CAAA,MAAA,MAAA,MAAA,OAAAx2L,QAAAkP,GAGAslB,KAAA8hK,GAAAG,EAAAjtQ,EAAAL,EAAA4sQ,UAAAS,GACAhiK,KAAA+hK,OAAA,IAWA/iB,EAAAmf,IAAA8D,WAAA,SAAAjtQ,EAAAusQ,GAIA,OAHAvsI,GACAwsI,IAEAS,EAAAjtQ,EAAAusQ,IAWAviB,EAAAmf,IAAA0D,aAAAA,EAIAV,EAAA,UAAAniB,EAAA0f,OAAAwD,MAAAC,KACAhB,EAAA,UAAAniB,EAAA0f,OAAAwD,MAAAE,KACAjB,EAAA,UAAAniB,EAAA0f,OAAAwD,MAAAG,KACAlB,EAAA,UAAAniB,EAAA0f,OAAAwD,MAAAI,KACAnB,EAAA,UAAAniB,EAAA0f,OAAAwD,MAAAK,KACApB,EAAA,UAAAniB,EAAA0f,OAAAwD,MAAAM,KAWA,IAEAC,EACAC,EACAC,EACAC,EACAC,EANA7tI,GAAA,EA2KA,SAAAwsI,IACAxsI,GAAA,EAeA2tI,EAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,IAAA,GAAA,IAIA,IADA,IAAAG,EAAA,IAAAjlK,MAAA,KACA12B,EAAA,EAAAA,EAAA,MAAAA,EACA27L,EAAA37L,GAAAA,GAAA,EACA27L,EAAA37L,EAAA,KAAAA,EAAA,KAAA,EAAA,IAIAs7L,EAAA,IAAA5kK,MAAA,KACA6kK,EAAA,IAAA7kK,MAAA,KACA+kK,EAAA,IAAA/kK,MAAA,GACAglK,EAAA,IAAAhlK,MAAA,GACA,IAAA12B,EAAA,EAAAA,EAAA,IAAAA,EACAy7L,EAAAz7L,GAAA,IAAA02B,MAAA,KACAglK,EAAA17L,GAAA,IAAA02B,MAAA,KAEA,IAAA+3F,EAAAmtE,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAArvQ,EAAA,EAAAsvQ,EAAA,EACA,IAAAl8L,EAAA,EAAAA,EAAA,MAAAA,EAAA,CA8DA87L,GADAA,EAAAI,EAAAA,GAAA,EAAAA,GAAA,EAAAA,GAAA,EAAAA,GAAA,IACA,EAAA,IAAAJ,EAAA,GAGAR,EAAA1uQ,GAAAkvQ,EACAP,EAAAO,GAAAlvQ,EAoEAovQ,GAJAD,EAAAJ,EAAAG,KAKA,GACAA,GAAA,GACAA,GAAA,EACAA,EAAAC,EACAE,IARAxtE,EAAAktE,EAAA/uQ,KACAgvQ,EAAAD,EAAAltE,KACAotE,EAAAF,EAAAC,MAOA,IACAhvQ,EAAAivQ,IAAA,IACAjvQ,EAAAgvQ,EAAAC,IAAA,EACAjvQ,EAAA6hM,EAAAotE,EAEA,IAAA,IAAA/uQ,EAAA,EAAAA,EAAA,IAAAA,EACA2uQ,EAAA3uQ,GAAAF,GAAAovQ,EACAN,EAAA5uQ,GAAAgvQ,GAAAG,EAGAD,EAAAA,GAAA,GAAAA,IAAA,EACAC,EAAAA,GAAA,GAAAA,IAAA,EAIA,IAAArvQ,EAEAA,EAAAsvQ,EAAA,GAIAtvQ,EAAA6hM,EAAAktE,EAAAA,EAAAA,EAAAltE,EAAAotE,KACAK,GAAAP,EAAAA,EAAAO,MA6BA,SAAApB,EAAAjtQ,EAAAusQ,GAmBA,IAjBA,IAaA91J,EAbAg5G,EAAAzvN,EAAAowE,MAAA,GAaAk+L,EAAA,EACAC,EAAA9+C,EAAAx/I,OAEAD,EA9ZA,GA6ZAu+L,EAAA,EAAA,GAEAp8L,EAAAo8L,EAAAp8L,EAAAnC,IAAAmC,EACAskC,EAAAg5G,EAAAt9I,EAAA,GACAA,EAAAo8L,GAAA,GAEA93J,EACAg3J,EAAAh3J,IAAA,GAAA,MAAA,GACAg3J,EAAAh3J,IAAA,EAAA,MAAA,GACAg3J,EAAA,IAAAh3J,IAAA,EACAg3J,EAAAh3J,IAAA,IAAAk3J,EAAAW,IAAA,GACAA,KACAC,EAAA,GAAAp8L,EAAAo8L,GAAA,IAEA93J,EACAg3J,EAAAh3J,IAAA,KAAA,GACAg3J,EAAAh3J,IAAA,GAAA,MAAA,GACAg3J,EAAAh3J,IAAA,EAAA,MAAA,EACAg3J,EAAA,IAAAh3J,IAEAg5G,EAAAt9I,GAAAs9I,EAAAt9I,EAAAo8L,GAAA93J,EAkDA,GAAA81J,EAAA,CAQA,IAPA,IAAAnmK,EACAooK,EAAAX,EAAA,GACAY,EAAAZ,EAAA,GACAa,EAAAb,EAAA,GACAc,EAAAd,EAAA,GACAe,EAAAn/C,EAAAr/I,MAAA,GAEAy+L,GAAA18L,EAAA,GADAnC,EAAAy/I,EAAAx/I,QA1eA,GA2eAkC,EAAAnC,EAAAmC,GA3eA,EA2eA08L,GA3eA,EA+eA,GAAA,IAAA18L,GAAAA,IAAAnC,EA/eA,EAgfA4+L,EAAAz8L,GAAAs9I,EAAAo/C,GACAD,EAAAz8L,EAAA,GAAAs9I,EAAAo/C,EAAA,GACAD,EAAAz8L,EAAA,GAAAs9I,EAAAo/C,EAAA,GACAD,EAAAz8L,EAAA,GAAAs9I,EAAAo/C,EAAA,QAMA,IAAA,IAAA5vQ,EAAA,EAAAA,EAzfA,IAyfAA,EACAmnG,EAAAqpH,EAAAo/C,EAAA5vQ,GACA2vQ,EAAAz8L,GAAA,GAAAlzE,IACAuvQ,EAAAf,EAAArnK,IAAA,KACAqoK,EAAAhB,EAAArnK,IAAA,GAAA,MACAsoK,EAAAjB,EAAArnK,IAAA,EAAA,MACAuoK,EAAAlB,EAAA,IAAArnK,IAIAqpH,EAAAm/C,EAGA,OAAAn/C,EAYA,SAAAo9C,EAAAp9C,EAAAz1H,EAAA8vI,EAAAyiC,GAuCA,IACAiC,EAAAC,EAAAC,EAAAC,EAAAryI,EAcAzqD,EAAAyS,EAAA7M,EAAAmxD,EAAAkmI,EAAAzV,EAAAn5D,EAfA6uE,EAAAt/C,EAAAx/I,OAAA,EAAA,EAEAs8L,GACAiC,EAAAX,EAAA,GACAY,EAAAZ,EAAA,GACAa,EAAAb,EAAA,GACAc,EAAAd,EAAA,GACAvxI,EAAAoxI,IAEAc,EAAAZ,EAAA,GACAa,EAAAb,EAAA,GACAc,EAAAd,EAAA,GACAe,EAAAf,EAAA,GACAtxI,EAAAmxI,GAGA57L,EAAAmoB,EAAA,GAAAy1H,EAAA,GACAnrI,EAAA0V,EAAAuyK,EAAA,EAAA,GAAA98C,EAAA,GACAh4I,EAAAuiB,EAAA,GAAAy1H,EAAA,GACA7mF,EAAA5uC,EAAAuyK,EAAA,EAAA,GAAA98C,EAAA,GASA,IARA,IAAAt9I,EAAA,EAQAgnC,EAAA,EAAAA,EAAA41J,IAAA51J,EAoHA21J,EACAN,EAAA38L,IAAA,IACA48L,EAAAnqL,IAAA,GAAA,KACAoqL,EAAAj3L,IAAA,EAAA,KACAk3L,EAAA,IAAA/lI,GAAA6mF,IAAAt9I,GACAknL,EACAmV,EAAAlqL,IAAA,IACAmqL,EAAAh3L,IAAA,GAAA,KACAi3L,EAAA9lI,IAAA,EAAA,KACA+lI,EAAA,IAAA98L,GAAA49I,IAAAt9I,GACA+tH,EACAsuE,EAAA/2L,IAAA,IACAg3L,EAAA7lI,IAAA,GAAA,KACA8lI,EAAA78L,IAAA,EAAA,KACA88L,EAAA,IAAArqL,GAAAmrI,IAAAt9I,GACAy2D,EACA4lI,EAAA5lI,IAAA,IACA6lI,EAAA58L,IAAA,GAAA,KACA68L,EAAApqL,IAAA,EAAA,KACAqqL,EAAA,IAAAl3L,GAAAg4I,IAAAt9I,GACAN,EAAAi9L,EACAxqL,EAAA+0K,EACA5hL,EAAAyoH,EAeA4pC,EAAA,GACAxtG,EAAAzqD,IAAA,KAAA,GACAyqD,EAAAh4C,IAAA,GAAA,MAAA,GACAg4C,EAAA7kD,IAAA,EAAA,MAAA,EACA6kD,EAAA,IAAAsM,GAAA6mF,IAAAt9I,GACA23J,EAAAyiC,EAAA,EAAA,GACAjwI,EAAAh4C,IAAA,KAAA,GACAg4C,EAAA7kD,IAAA,GAAA,MAAA,GACA6kD,EAAAsM,IAAA,EAAA,MAAA,EACAtM,EAAA,IAAAzqD,GAAA49I,IAAAt9I,GACA23J,EAAA,GACAxtG,EAAA7kD,IAAA,KAAA,GACA6kD,EAAAsM,IAAA,GAAA,MAAA,GACAtM,EAAAzqD,IAAA,EAAA,MAAA,EACAyqD,EAAA,IAAAh4C,GAAAmrI,IAAAt9I,GACA23J,EAAAyiC,EAAA,EAAA,GACAjwI,EAAAsM,IAAA,KAAA,GACAtM,EAAAzqD,IAAA,GAAA,MAAA,GACAyqD,EAAAh4C,IAAA,EAAA,MAAA,EACAg4C,EAAA,IAAA7kD,GAAAg4I,IAAAt9I,GAuBA,SAAAm6L,EAAA3sQ,GAEA,IAGA+pQ,EAFAnB,EAAA,SAFA5oQ,EAAAA,GAAA,IACA+lF,MAAA,OAAAgb,cAWA1gB,GANA0pL,EADA/pQ,EAAA4sQ,QACAviB,EAAA0f,OAAAsF,eAAAzG,EAAA5oQ,EAAAK,KAEAgqP,EAAA0f,OAAAuF,aAAA1G,EAAA5oQ,EAAAK,MAIAggF,MAcA,OAbA0pL,EAAA1pL,MAAA,SAAAypL,EAAA9pQ,GAEA,IAAAmqO,EAAA,KACAnqO,aAAAqqP,EAAAp/I,KAAA8zJ,aACA50B,EAAAnqO,EACAA,EAAA,KAEAA,EAAAA,GAAA,IACAmqO,OAAAA,EACAnqO,EAAA8pQ,GAAAA,EACAzpL,EAAA4oB,KAAA8gK,EAAA/pQ,IAGA+pQ,4GC1jCA,IAAA1f,EAAAzrP,EAAA,WACAA,EAAA,UAEAF,EAAAC,QAAA0rP,EAAA0f,OAAA1f,EAAA0f,QAAA,GAGA1f,EAAA0f,OAAAwF,WAAAllB,EAAA0f,OAAAwF,YAAA,GAeAllB,EAAA0f,OAAAuF,aAAA,SAAA1G,EAAAvoQ,GACA,IAAA0kN,EAAA6jD,EAOA,GANA,iBAAA7jD,IACAA,EAAAslC,EAAA0f,OAAAyF,aAAAzqD,MAEAA,EAAAA,MAGAA,EACA,MAAA,IAAA5gH,MAAA,0BAAAykK,GAIA,OAAA,IAAAve,EAAA0f,OAAA0F,YAAA,CACA7G,UAAA7jD,EACA1kN,IAAAA,EACAusQ,SAAA,KAiBAviB,EAAA0f,OAAAsF,eAAA,SAAAzG,EAAAvoQ,GACA,IAAA0kN,EAAA6jD,EAOA,GANA,iBAAA7jD,IACAA,EAAAslC,EAAA0f,OAAAyF,aAAAzqD,MAEAA,EAAAA,MAGAA,EACA,MAAA,IAAA5gH,MAAA,0BAAAykK,GAIA,OAAA,IAAAve,EAAA0f,OAAA0F,YAAA,CACA7G,UAAA7jD,EACA1kN,IAAAA,EACAusQ,SAAA,KAWAviB,EAAA0f,OAAAyC,kBAAA,SAAAtuQ,EAAA0qQ,GACA1qQ,EAAAA,EAAA6iG,cACAspJ,EAAA0f,OAAAwF,WAAArxQ,GAAA0qQ,GAUAve,EAAA0f,OAAAyF,aAAA,SAAAtxQ,GAEA,OADAA,EAAAA,EAAA6iG,iBACAspJ,EAAA0f,OAAAwF,WACAllB,EAAA0f,OAAAwF,WAAArxQ,GAEA,MAGA,IAAAuxQ,EAAAplB,EAAA0f,OAAA0F,YAAA,SAAAzvQ,GACAqrG,KAAAu9J,UAAA5oQ,EAAA4oQ,UACAv9J,KAAAtlB,KAAAslB,KAAAu9J,UAAA7iL,KACAslB,KAAAyhK,UAAAzhK,KAAAtlB,KAAA+mL,UACAzhK,KAAAqkK,SAAA,EACArkK,KAAAskK,OAAA,KACAtkK,KAAA8+H,OAAA,KACA9+H,KAAAukK,IAAA5vQ,EAAA4sQ,QAAAvhK,KAAAtlB,KAAA6mL,QAAAvhK,KAAAtlB,KAAAgnL,QACA1hK,KAAAwkK,SAAA7vQ,EAAA4sQ,QACAvhK,KAAAu9J,UAAAiE,WAAA7sQ,IA8BAyvQ,EAAAzmK,UAAA3oB,MAAA,SAAArgF,GACAA,EAAAA,GAAA,GACA,IAAAosK,EAAA,GACA,IAAA,IAAA/rK,KAAAL,EACAosK,EAAA/rK,GAAAL,EAAAK,GAEA+rK,EAAAwgG,QAAAvhK,KAAAwkK,SACAxkK,KAAAqkK,SAAA,EACArkK,KAAAskK,OAAAtlB,EAAAp/I,KAAAyvJ,eACArvJ,KAAA8+H,OAAAnqO,EAAAmqO,QAAAkgB,EAAAp/I,KAAAyvJ,eACArvJ,KAAAtlB,KAAA1F,MAAA+rF,IAQAqjG,EAAAzmK,UAAAg4D,OAAA,SAAA3mE,GAOA,IANAA,GAEAgR,KAAAskK,OAAA7U,UAAAzgK,IAIAgR,KAAAukK,IAAA3mK,KAAAoC,KAAAtlB,KAAAslB,KAAAskK,OAAAtkK,KAAA8+H,OAAA9+H,KAAAqkK,WACArkK,KAAAqkK,UAGArkK,KAAAskK,OAAApP,WAWAkP,EAAAzmK,UAAA87H,OAAA,SAAAz/H,IAGAA,GAAA,QAAAgG,KAAAtlB,KAAA7nF,MAAA,QAAAmtG,KAAAtlB,KAAA7nF,OACAmtG,KAAAtlB,KAAAsf,IAAA,SAAAhL,GACA,OAAAgL,EAAAgG,KAAAyhK,UAAAzyK,GAAA,IAEAgR,KAAAtlB,KAAA+pL,MAAA,SAAA3lC,GACA,OAAA9kI,EAAAgG,KAAAyhK,UAAA3iC,GAAA,KAKA,IAAAnqO,EAAA,GAMA,OALAA,EAAA4sQ,QAAAvhK,KAAAwkK,SAGA7vQ,EAAA+vQ,SAAA1kK,KAAAskK,OAAAr/L,SAAA+6B,KAAAyhK,aAEAzhK,KAAAwkK,UAAAxkK,KAAAtlB,KAAAsf,MACAgG,KAAAtlB,KAAAsf,IAAAgG,KAAAskK,OAAA3vQ,MAMAqrG,KAAAqkK,SAAA,EACArkK,KAAA21D,WAEA31D,KAAAwkK,UAAAxkK,KAAAtlB,KAAA+pL,QACAzkK,KAAAtlB,KAAA+pL,MAAAzkK,KAAA8+H,OAAAnqO,OAKAqrG,KAAAtlB,KAAAiqL,cACA3kK,KAAAtlB,KAAAiqL,YAAA3kK,KAAA8+H,OAAAnqO,sECxNA,IAAAqqP,EAAAzrP,EAAA,WACAA,EAAA,UAEAyrP,EAAA0f,OAAA1f,EAAA0f,QAAA,GAGA,IAAAwD,EAAA7uQ,EAAAC,QAAA0rP,EAAA0f,OAAAwD,MAAAljB,EAAA0f,OAAAwD,OAAA,GA+6BA,SAAA0C,EAAAnG,EAAAgD,GAMA,GALA,iBAAAhD,IAEAA,EAAAzf,EAAAp/I,KAAAyvJ,aAAAoP,IAGAzf,EAAAp/I,KAAA9iB,QAAA2hL,IAAAA,EAAAx5L,OAAA,EAAA,CAEA,IAAAm2B,EAAAqjK,EACAA,EAAAzf,EAAAp/I,KAAAyvJ,eACA,IAAA,IAAAloL,EAAA,EAAAA,EAAAi0B,EAAAn2B,SAAAkC,EACAs3L,EAAAjP,QAAAp0J,EAAAj0B,IAIA,GAAAs3L,EAAAx5L,SAAAw8L,EACA,MAAA,IAAA3oK,MACA,0BAAA2lK,EAAAx5L,SACA,uBAAAw8L,EAAA,WAGA,IAAAziB,EAAAp/I,KAAA9iB,QAAA2hL,GAAA,CAEA,IAAAoG,EAAA,GACAC,EAAArD,EAAA,EACA,IAAAt6L,EAAA,EAAAA,EAAA29L,IAAA39L,EACA09L,EAAA/5L,KAAA2zL,EAAA5J,YAEA4J,EAAAoG,EAGA,OAAApG,EAGA,SAAAsG,EAAAv3G,GAEAA,EAAAA,EAAAvoF,OAAA,GAAAuoF,EAAAA,EAAAvoF,OAAA,GAAA,EAAA,WAGA,SAAA+/L,EAAAtzJ,GAEA,MAAA,CAAAA,EAAA,WAAA,EAAA,WAAAA,GAp9BAwwJ,EAAAC,IAAA,SAAAxtQ,GACAA,EAAAA,GAAA,GACAqrG,KAAAntG,KAAA,MACAmtG,KAAA0+J,OAAA/pQ,EAAA+pQ,OACA1+J,KAAAyhK,UAAA9sQ,EAAA8sQ,WAAA,GACAzhK,KAAAilK,MAAAjlK,KAAAyhK,UAAA,EACAzhK,KAAAklK,SAAA,IAAArnK,MAAAmC,KAAAilK,OACAjlK,KAAAmlK,UAAA,IAAAtnK,MAAAmC,KAAAilK,QAGA/C,EAAAC,IAAAxkK,UAAA3oB,MAAA,SAAArgF,KAEAutQ,EAAAC,IAAAxkK,UAAA+jK,QAAA,SAAA1yK,EAAA8vI,EAAArF,GAEA,GAAAzqI,EAAA/pB,SAAA+6B,KAAAyhK,aAAAhoC,GAAAzqI,EAAA/pB,SAAA,GACA,OAAA,EAIA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAklK,SAAA/9L,GAAA6nB,EAAA6lK,WAIA70J,KAAA0+J,OAAAgD,QAAA1hK,KAAAklK,SAAAllK,KAAAmlK,WAGA,IAAAh+L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA23J,EAAAy1B,SAAAv0J,KAAAmlK,UAAAh+L,KAIA+6L,EAAAC,IAAAxkK,UAAA4jK,QAAA,SAAAvyK,EAAA8vI,EAAArF,GAEA,GAAAzqI,EAAA/pB,SAAA+6B,KAAAyhK,aAAAhoC,GAAAzqI,EAAA/pB,SAAA,GACA,OAAA,EAIA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAklK,SAAA/9L,GAAA6nB,EAAA6lK,WAIA70J,KAAA0+J,OAAA6C,QAAAvhK,KAAAklK,SAAAllK,KAAAmlK,WAGA,IAAAh+L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA23J,EAAAy1B,SAAAv0J,KAAAmlK,UAAAh+L,KAIA+6L,EAAAC,IAAAxkK,UAAA3D,IAAA,SAAAhL,EAAAr6F,GAGA,IAAAywQ,EAAAp2K,EAAA/pB,WAAA+6B,KAAAyhK,UACAzhK,KAAAyhK,UAAAzhK,KAAAyhK,UAAAzyK,EAAA/pB,SAEA,OADA+pB,EAAAmlK,aAAAiR,EAAAA,IACA,GAGAlD,EAAAC,IAAAxkK,UAAA8mK,MAAA,SAAA3lC,EAAAnqO,GAEA,GAAAA,EAAA+vQ,SAAA,EACA,OAAA,EAIA,IAAAthK,EAAA07H,EAAA75J,SACAse,EAAAu7I,EAAA12H,GAAAhF,EAAA,GACA,QAAA7f,EAAAyc,KAAAyhK,WAAA,KAKA3iC,EAAAq2B,SAAA5xK,IACA,IAKA2+K,EAAAE,IAAA,SAAAztQ,GACAA,EAAAA,GAAA,GACAqrG,KAAAntG,KAAA,MACAmtG,KAAA0+J,OAAA/pQ,EAAA+pQ,OACA1+J,KAAAyhK,UAAA9sQ,EAAA8sQ,WAAA,GACAzhK,KAAAilK,MAAAjlK,KAAAyhK,UAAA,EACAzhK,KAAAklK,SAAA,IAAArnK,MAAAmC,KAAAilK,OACAjlK,KAAAmlK,UAAA,IAAAtnK,MAAAmC,KAAAilK,QAGA/C,EAAAE,IAAAzkK,UAAA3oB,MAAA,SAAArgF,GAGA,GAAA,OAAAA,EAAA8pQ,GAAA,CAEA,IAAAz+J,KAAAqlK,MACA,MAAA,IAAAvsK,MAAA,yBAEAkH,KAAAslK,IAAAtlK,KAAAqlK,MAAAjgM,MAAA,OACA,CAAA,KAAA,OAAAzwE,GACA,MAAA,IAAAmkG,MAAA,yBAGAkH,KAAAslK,IAAAV,EAAAjwQ,EAAA8pQ,GAAAz+J,KAAAyhK,WACAzhK,KAAAqlK,MAAArlK,KAAAslK,IAAAlgM,MAAA,KAIA88L,EAAAE,IAAAzkK,UAAA+jK,QAAA,SAAA1yK,EAAA8vI,EAAArF,GAEA,GAAAzqI,EAAA/pB,SAAA+6B,KAAAyhK,aAAAhoC,GAAAzqI,EAAA/pB,SAAA,GACA,OAAA,EAKA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAklK,SAAA/9L,GAAA64B,KAAAqlK,MAAAl+L,GAAA6nB,EAAA6lK,WAIA70J,KAAA0+J,OAAAgD,QAAA1hK,KAAAklK,SAAAllK,KAAAmlK,WAGA,IAAAh+L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA23J,EAAAy1B,SAAAv0J,KAAAmlK,UAAAh+L,IAEA64B,KAAAqlK,MAAArlK,KAAAmlK,WAGAjD,EAAAE,IAAAzkK,UAAA4jK,QAAA,SAAAvyK,EAAA8vI,EAAArF,GAEA,GAAAzqI,EAAA/pB,SAAA+6B,KAAAyhK,aAAAhoC,GAAAzqI,EAAA/pB,SAAA,GACA,OAAA,EAIA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAklK,SAAA/9L,GAAA6nB,EAAA6lK,WAIA70J,KAAA0+J,OAAA6C,QAAAvhK,KAAAklK,SAAAllK,KAAAmlK,WAIA,IAAAh+L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA23J,EAAAy1B,SAAAv0J,KAAAqlK,MAAAl+L,GAAA64B,KAAAmlK,UAAAh+L,IAEA64B,KAAAqlK,MAAArlK,KAAAklK,SAAA9/L,MAAA,IAGA88L,EAAAE,IAAAzkK,UAAA3D,IAAA,SAAAhL,EAAAr6F,GAGA,IAAAywQ,EAAAp2K,EAAA/pB,WAAA+6B,KAAAyhK,UACAzhK,KAAAyhK,UAAAzhK,KAAAyhK,UAAAzyK,EAAA/pB,SAEA,OADA+pB,EAAAmlK,aAAAiR,EAAAA,IACA,GAGAlD,EAAAE,IAAAzkK,UAAA8mK,MAAA,SAAA3lC,EAAAnqO,GAEA,GAAAA,EAAA+vQ,SAAA,EACA,OAAA,EAIA,IAAAthK,EAAA07H,EAAA75J,SACAse,EAAAu7I,EAAA12H,GAAAhF,EAAA,GACA,QAAA7f,EAAAyc,KAAAyhK,WAAA,KAKA3iC,EAAAq2B,SAAA5xK,IACA,IAKA2+K,EAAAG,IAAA,SAAA1tQ,GACAA,EAAAA,GAAA,GACAqrG,KAAAntG,KAAA,MACAmtG,KAAA0+J,OAAA/pQ,EAAA+pQ,OACA1+J,KAAAyhK,UAAA9sQ,EAAA8sQ,WAAA,GACAzhK,KAAAilK,MAAAjlK,KAAAyhK,UAAA,EACAzhK,KAAAklK,SAAA,KACAllK,KAAAmlK,UAAA,IAAAtnK,MAAAmC,KAAAilK,OACAjlK,KAAAulK,cAAA,IAAA1nK,MAAAmC,KAAAilK,OACAjlK,KAAAwlK,eAAAxmB,EAAAp/I,KAAAyvJ,eACArvJ,KAAAylK,cAAA,GAGAvD,EAAAG,IAAA1kK,UAAA3oB,MAAA,SAAArgF,GACA,KAAA,OAAAA,GACA,MAAA,IAAAmkG,MAAA,yBAGAkH,KAAAslK,IAAAV,EAAAjwQ,EAAA8pQ,GAAAz+J,KAAAyhK,WACAzhK,KAAAklK,SAAAllK,KAAAslK,IAAAlgM,MAAA,GACA46B,KAAAylK,cAAA,GAGAvD,EAAAG,IAAA1kK,UAAA+jK,QAAA,SAAA1yK,EAAA8vI,EAAArF,GAEA,IAAAisC,EAAA12K,EAAA/pB,SACA,GAAA,IAAAygM,EACA,OAAA,EAOA,GAHA1lK,KAAA0+J,OAAAgD,QAAA1hK,KAAAklK,SAAAllK,KAAAmlK,WAGA,IAAAnlK,KAAAylK,eAAAC,GAAA1lK,KAAAyhK,UAEA,IAAA,IAAAt6L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAklK,SAAA/9L,GAAA6nB,EAAA6lK,WAAA70J,KAAAmlK,UAAAh+L,GACA23J,EAAAy1B,SAAAv0J,KAAAklK,SAAA/9L,QAJA,CAUA,IAAAw+L,GAAA3lK,KAAAyhK,UAAAiE,GAAA1lK,KAAAyhK,UACAkE,EAAA,IACAA,EAAA3lK,KAAAyhK,UAAAkE,GAIA3lK,KAAAwlK,eAAAp4G,QACA,IAAAjmF,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAulK,cAAAp+L,GAAA6nB,EAAA6lK,WAAA70J,KAAAmlK,UAAAh+L,GACA64B,KAAAwlK,eAAAjR,SAAAv0J,KAAAulK,cAAAp+L,IAGA,GAAAw+L,EAAA,EAEA32K,EAAAgiI,MAAAhxH,KAAAyhK,eAGA,IAAAt6L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAklK,SAAA/9L,GAAA64B,KAAAulK,cAAAp+L,GASA,GAJA64B,KAAAylK,cAAA,GACAzlK,KAAAwlK,eAAApkB,SAAAphJ,KAAAylK,eAGAE,EAAA,IAAAlsC,EAIA,OAHAqF,EAAAywB,SAAAvvJ,KAAAwlK,eAAApkB,SACAukB,EAAA3lK,KAAAylK,gBACAzlK,KAAAylK,cAAAE,GACA,EAGA7mC,EAAAywB,SAAAvvJ,KAAAwlK,eAAApkB,SACAskB,EAAA1lK,KAAAylK,gBACAzlK,KAAAylK,cAAA,IAGAvD,EAAAG,IAAA1kK,UAAA4jK,QAAA,SAAAvyK,EAAA8vI,EAAArF,GAEA,IAAAisC,EAAA12K,EAAA/pB,SACA,GAAA,IAAAygM,EACA,OAAA,EAOA,GAHA1lK,KAAA0+J,OAAAgD,QAAA1hK,KAAAklK,SAAAllK,KAAAmlK,WAGA,IAAAnlK,KAAAylK,eAAAC,GAAA1lK,KAAAyhK,UAEA,IAAA,IAAAt6L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAklK,SAAA/9L,GAAA6nB,EAAA6lK,WACA/1B,EAAAy1B,SAAAv0J,KAAAklK,SAAA/9L,GAAA64B,KAAAmlK,UAAAh+L,QAJA,CAUA,IAAAw+L,GAAA3lK,KAAAyhK,UAAAiE,GAAA1lK,KAAAyhK,UACAkE,EAAA,IACAA,EAAA3lK,KAAAyhK,UAAAkE,GAIA3lK,KAAAwlK,eAAAp4G,QACA,IAAAjmF,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAulK,cAAAp+L,GAAA6nB,EAAA6lK,WACA70J,KAAAwlK,eAAAjR,SAAAv0J,KAAAulK,cAAAp+L,GAAA64B,KAAAmlK,UAAAh+L,IAGA,GAAAw+L,EAAA,EAEA32K,EAAAgiI,MAAAhxH,KAAAyhK,eAGA,IAAAt6L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAklK,SAAA/9L,GAAA64B,KAAAulK,cAAAp+L,GASA,GAJA64B,KAAAylK,cAAA,GACAzlK,KAAAwlK,eAAApkB,SAAAphJ,KAAAylK,eAGAE,EAAA,IAAAlsC,EAIA,OAHAqF,EAAAywB,SAAAvvJ,KAAAwlK,eAAApkB,SACAukB,EAAA3lK,KAAAylK,gBACAzlK,KAAAylK,cAAAE,GACA,EAGA7mC,EAAAywB,SAAAvvJ,KAAAwlK,eAAApkB,SACAskB,EAAA1lK,KAAAylK,gBACAzlK,KAAAylK,cAAA,IAKAvD,EAAAI,IAAA,SAAA3tQ,GACAA,EAAAA,GAAA,GACAqrG,KAAAntG,KAAA,MACAmtG,KAAA0+J,OAAA/pQ,EAAA+pQ,OACA1+J,KAAAyhK,UAAA9sQ,EAAA8sQ,WAAA,GACAzhK,KAAAilK,MAAAjlK,KAAAyhK,UAAA,EACAzhK,KAAAklK,SAAA,KACAllK,KAAAmlK,UAAA,IAAAtnK,MAAAmC,KAAAilK,OACAjlK,KAAAwlK,eAAAxmB,EAAAp/I,KAAAyvJ,eACArvJ,KAAAylK,cAAA,GAGAvD,EAAAI,IAAA3kK,UAAA3oB,MAAA,SAAArgF,GACA,KAAA,OAAAA,GACA,MAAA,IAAAmkG,MAAA,yBAGAkH,KAAAslK,IAAAV,EAAAjwQ,EAAA8pQ,GAAAz+J,KAAAyhK,WACAzhK,KAAAklK,SAAAllK,KAAAslK,IAAAlgM,MAAA,GACA46B,KAAAylK,cAAA,GAGAvD,EAAAI,IAAA3kK,UAAA+jK,QAAA,SAAA1yK,EAAA8vI,EAAArF,GAEA,IAAAisC,EAAA12K,EAAA/pB,SACA,GAAA,IAAA+pB,EAAA/pB,SACA,OAAA,EAOA,GAHA+6B,KAAA0+J,OAAAgD,QAAA1hK,KAAAklK,SAAAllK,KAAAmlK,WAGA,IAAAnlK,KAAAylK,eAAAC,GAAA1lK,KAAAyhK,UAEA,IAAA,IAAAt6L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA23J,EAAAy1B,SAAAvlK,EAAA6lK,WAAA70J,KAAAmlK,UAAAh+L,IACA64B,KAAAklK,SAAA/9L,GAAA64B,KAAAmlK,UAAAh+L,OAJA,CAUA,IAAAw+L,GAAA3lK,KAAAyhK,UAAAiE,GAAA1lK,KAAAyhK,UACAkE,EAAA,IACAA,EAAA3lK,KAAAyhK,UAAAkE,GAIA3lK,KAAAwlK,eAAAp4G,QACA,IAAAjmF,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAwlK,eAAAjR,SAAAvlK,EAAA6lK,WAAA70J,KAAAmlK,UAAAh+L,IAGA,GAAAw+L,EAAA,EAEA32K,EAAAgiI,MAAAhxH,KAAAyhK,eAGA,IAAAt6L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAklK,SAAA/9L,GAAA64B,KAAAmlK,UAAAh+L,GASA,GAJA64B,KAAAylK,cAAA,GACAzlK,KAAAwlK,eAAApkB,SAAAphJ,KAAAylK,eAGAE,EAAA,IAAAlsC,EAIA,OAHAqF,EAAAywB,SAAAvvJ,KAAAwlK,eAAApkB,SACAukB,EAAA3lK,KAAAylK,gBACAzlK,KAAAylK,cAAAE,GACA,EAGA7mC,EAAAywB,SAAAvvJ,KAAAwlK,eAAApkB,SACAskB,EAAA1lK,KAAAylK,gBACAzlK,KAAAylK,cAAA,IAGAvD,EAAAI,IAAA3kK,UAAA4jK,QAAAW,EAAAI,IAAA3kK,UAAA+jK,QAIAQ,EAAAK,IAAA,SAAA5tQ,GACAA,EAAAA,GAAA,GACAqrG,KAAAntG,KAAA,MACAmtG,KAAA0+J,OAAA/pQ,EAAA+pQ,OACA1+J,KAAAyhK,UAAA9sQ,EAAA8sQ,WAAA,GACAzhK,KAAAilK,MAAAjlK,KAAAyhK,UAAA,EACAzhK,KAAAklK,SAAA,KACAllK,KAAAmlK,UAAA,IAAAtnK,MAAAmC,KAAAilK,OACAjlK,KAAAwlK,eAAAxmB,EAAAp/I,KAAAyvJ,eACArvJ,KAAAylK,cAAA,GAGAvD,EAAAK,IAAA5kK,UAAA3oB,MAAA,SAAArgF,GACA,KAAA,OAAAA,GACA,MAAA,IAAAmkG,MAAA,yBAGAkH,KAAAslK,IAAAV,EAAAjwQ,EAAA8pQ,GAAAz+J,KAAAyhK,WACAzhK,KAAAklK,SAAAllK,KAAAslK,IAAAlgM,MAAA,GACA46B,KAAAylK,cAAA,GAGAvD,EAAAK,IAAA5kK,UAAA+jK,QAAA,SAAA1yK,EAAA8vI,EAAArF,GAEA,IAAAisC,EAAA12K,EAAA/pB,SACA,GAAA,IAAAygM,EACA,OAAA,EAOA,GAHA1lK,KAAA0+J,OAAAgD,QAAA1hK,KAAAklK,SAAAllK,KAAAmlK,WAGA,IAAAnlK,KAAAylK,eAAAC,GAAA1lK,KAAAyhK,UAEA,IAAA,IAAAt6L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA23J,EAAAy1B,SAAAvlK,EAAA6lK,WAAA70J,KAAAmlK,UAAAh+L,QAEA,CAEA,IAAAw+L,GAAA3lK,KAAAyhK,UAAAiE,GAAA1lK,KAAAyhK,UACAkE,EAAA,IACAA,EAAA3lK,KAAAyhK,UAAAkE,GAIA3lK,KAAAwlK,eAAAp4G,QACA,IAAAjmF,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAwlK,eAAAjR,SAAAvlK,EAAA6lK,WAAA70J,KAAAmlK,UAAAh+L,IAaA,GAVAw+L,EAAA,IAEA32K,EAAAgiI,MAAAhxH,KAAAyhK,WAIAzhK,KAAAylK,cAAA,GACAzlK,KAAAwlK,eAAApkB,SAAAphJ,KAAAylK,eAGAE,EAAA,IAAAlsC,EAIA,OAHAqF,EAAAywB,SAAAvvJ,KAAAwlK,eAAApkB,SACAukB,EAAA3lK,KAAAylK,gBACAzlK,KAAAylK,cAAAE,GACA,EAGA7mC,EAAAywB,SAAAvvJ,KAAAwlK,eAAApkB,SACAskB,EAAA1lK,KAAAylK,gBACAzlK,KAAAylK,cAAA,EAIAV,EAAA/kK,KAAAklK,WAGAhD,EAAAK,IAAA5kK,UAAA4jK,QAAAW,EAAAK,IAAA5kK,UAAA+jK,QAIAQ,EAAAM,IAAA,SAAA7tQ,GACAA,EAAAA,GAAA,GACAqrG,KAAAntG,KAAA,MACAmtG,KAAA0+J,OAAA/pQ,EAAA+pQ,OACA1+J,KAAAyhK,UAAA9sQ,EAAA8sQ,WAAA,GACAzhK,KAAAilK,MAAAjlK,KAAAyhK,UAAA,EACAzhK,KAAAklK,SAAA,IAAArnK,MAAAmC,KAAAilK,OACAjlK,KAAAmlK,UAAA,IAAAtnK,MAAAmC,KAAAilK,OACAjlK,KAAAwlK,eAAAxmB,EAAAp/I,KAAAyvJ,eACArvJ,KAAAylK,cAAA,EAKAzlK,KAAA4lK,GAAA,YAGA1D,EAAAM,IAAA7kK,UAAA3oB,MAAA,SAAArgF,GACA,KAAA,OAAAA,GACA,MAAA,IAAAmkG,MAAA,yBAGA,IAMA+sK,EANApH,EAAAzf,EAAAp/I,KAAAyvJ,aAAA16P,EAAA8pQ,IAsBA,GAnBAz+J,KAAA8lK,cAAA,EAKAD,EADA,mBAAAlxQ,EACAqqP,EAAAp/I,KAAAyvJ,aAAA16P,EAAAkxQ,gBAEA7mB,EAAAp/I,KAAAyvJ,eAKArvJ,KAAA+lK,WADA,cAAApxQ,EACAA,EAAAqxQ,UAEA,IAIAhmK,KAAAimK,KAAA,KACAtxQ,EAAA4sQ,UAEAvhK,KAAAimK,KAAAjnB,EAAAp/I,KAAAyvJ,aAAA16P,EAAA6vE,KAAA48K,WACAphJ,KAAAimK,KAAAhhM,SAAA+6B,KAAA+lK,WAAA,GACA,MAAA,IAAAjtK,MAAA,iDAKAkH,KAAAkmK,WAAA,IAAAroK,MAAAmC,KAAAilK,OAGAjlK,KAAAx7B,IAAA,KAIAw7B,KAAAmmK,YAAA,IAAAtoK,MAAAmC,KAAAilK,OACAjlK,KAAA0+J,OAAAgD,QAAA,CAAA,EAAA,EAAA,EAAA,GAAA1hK,KAAAmmK,aAMAnmK,KAAAomK,cAAA,EACApmK,KAAAqmK,GAAArmK,KAAAsmK,kBAAAtmK,KAAAmmK,YAAAnmK,KAAAomK,eAKA,IAAAG,EAAA9H,EAAAx5L,SACA,GAAA,KAAAshM,EAEAvmK,KAAAwmK,IAAA,CAAA/H,EAAA5J,WAAA4J,EAAA5J,WAAA4J,EAAA5J,WAAA,OACA,CAGA,IADA70J,KAAAwmK,IAAA,CAAA,EAAA,EAAA,EAAA,GACA/H,EAAAx5L,SAAA,GACA+6B,KAAAwmK,IAAAxmK,KAAAymK,MACAzmK,KAAAmmK,YAAAnmK,KAAAwmK,IACA,CAAA/H,EAAA5J,WAAA4J,EAAA5J,WAAA4J,EAAA5J,WAAA4J,EAAA5J,aAEA70J,KAAAwmK,IAAAxmK,KAAAymK,MACAzmK,KAAAmmK,YAAAnmK,KAAAwmK,IAAA,CAAA,EAAA,GAAA30K,OAAAmzK,EAAA,EAAAuB,KAIAvmK,KAAAklK,SAAAllK,KAAAwmK,IAAAphM,MAAA,GACA2/L,EAAA/kK,KAAAklK,UACAllK,KAAAylK,cAAA,EAGAI,EAAA7mB,EAAAp/I,KAAAyvJ,aAAAwW,GAEA7lK,KAAA0mK,aAAA1B,EAAA,EAAAa,EAAA5gM,UAEA,IAAAy/L,EAAAmB,EAAA5gM,SAAA+6B,KAAAyhK,UAKA,IAJAiD,GACAmB,EAAA1R,aAAA,EAAAn0J,KAAAyhK,UAAAiD,GAEA1kK,KAAA2mK,GAAA,CAAA,EAAA,EAAA,EAAA,GACAd,EAAA5gM,SAAA,GACA+6B,KAAA2mK,GAAA3mK,KAAAymK,MAAAzmK,KAAAmmK,YAAAnmK,KAAA2mK,GAAA,CACAd,EAAAhR,WACAgR,EAAAhR,WACAgR,EAAAhR,WACAgR,EAAAhR,cAKAqN,EAAAM,IAAA7kK,UAAA+jK,QAAA,SAAA1yK,EAAA8vI,EAAArF,GAEA,IAAAisC,EAAA12K,EAAA/pB,SACA,GAAA,IAAAygM,EACA,OAAA,EAOA,GAHA1lK,KAAA0+J,OAAAgD,QAAA1hK,KAAAklK,SAAAllK,KAAAmlK,WAGA,IAAAnlK,KAAAylK,eAAAC,GAAA1lK,KAAAyhK,UAAA,CAEA,IAAA,IAAAt6L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA23J,EAAAy1B,SAAAv0J,KAAAmlK,UAAAh+L,IAAA6nB,EAAA6lK,YAEA70J,KAAA8lK,eAAA9lK,KAAAyhK,cACA,CAEA,IAAAkE,GAAA3lK,KAAAyhK,UAAAiE,GAAA1lK,KAAAyhK,UACAkE,EAAA,IACAA,EAAA3lK,KAAAyhK,UAAAkE,GAIA3lK,KAAAwlK,eAAAp4G,QACA,IAAAjmF,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAwlK,eAAAjR,SAAAvlK,EAAA6lK,WAAA70J,KAAAmlK,UAAAh+L,IAGA,GAAAw+L,GAAA,GAAAlsC,EAAA,CAEA,GAAAA,EAAA,CAEA,IAAAirC,EAAAgB,EAAA1lK,KAAAyhK,UACAzhK,KAAA8lK,eAAApB,EAEA1kK,KAAAwlK,eAAArQ,SAAAn1J,KAAAyhK,UAAAiD,QAEA1kK,KAAA8lK,eAAA9lK,KAAAyhK,UAIA,IAAAt6L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAmlK,UAAAh+L,GAAA64B,KAAAwlK,eAAA3Q,WAEA70J,KAAAwlK,eAAAx0C,MAAAhxH,KAAAyhK,UAQA,GAJAzhK,KAAAylK,cAAA,GACAzlK,KAAAwlK,eAAApkB,SAAAphJ,KAAAylK,eAGAE,EAAA,IAAAlsC,EAOA,OAJAzqI,EAAAgiI,MAAAhxH,KAAAyhK,UACA3iC,EAAAywB,SAAAvvJ,KAAAwlK,eAAApkB,SACAukB,EAAA3lK,KAAAylK,gBACAzlK,KAAAylK,cAAAE,GACA,EAGA7mC,EAAAywB,SAAAvvJ,KAAAwlK,eAAApkB,SACAskB,EAAA1lK,KAAAylK,gBACAzlK,KAAAylK,cAAA,EAIAzlK,KAAA2mK,GAAA3mK,KAAAymK,MAAAzmK,KAAAmmK,YAAAnmK,KAAA2mK,GAAA3mK,KAAAmlK,WAGAJ,EAAA/kK,KAAAklK,WAGAhD,EAAAM,IAAA7kK,UAAA4jK,QAAA,SAAAvyK,EAAA8vI,EAAArF,GAEA,IAAAisC,EAAA12K,EAAA/pB,SACA,GAAAygM,EAAA1lK,KAAAyhK,aAAAhoC,GAAAisC,EAAA,GACA,OAAA,EAIA1lK,KAAA0+J,OAAAgD,QAAA1hK,KAAAklK,SAAAllK,KAAAmlK,WAGAJ,EAAA/kK,KAAAklK,UAGAllK,KAAAkmK,WAAA,GAAAl3K,EAAA6lK,WACA70J,KAAAkmK,WAAA,GAAAl3K,EAAA6lK,WACA70J,KAAAkmK,WAAA,GAAAl3K,EAAA6lK,WACA70J,KAAAkmK,WAAA,GAAAl3K,EAAA6lK,WACA70J,KAAA2mK,GAAA3mK,KAAAymK,MAAAzmK,KAAAmmK,YAAAnmK,KAAA2mK,GAAA3mK,KAAAkmK,YAGA,IAAA,IAAA/+L,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA23J,EAAAy1B,SAAAv0J,KAAAmlK,UAAAh+L,GAAA64B,KAAAkmK,WAAA/+L,IAIAu+L,EAAA1lK,KAAAyhK,UACAzhK,KAAA8lK,eAAAJ,EAAA1lK,KAAAyhK,UAEAzhK,KAAA8lK,eAAA9lK,KAAAyhK,WAIAS,EAAAM,IAAA7kK,UAAAgnK,YAAA,SAAA7lC,EAAAnqO,GACA,IAAAy8P,GAAA,EAGAz8P,EAAA4sQ,SAAA5sQ,EAAA+vQ,UACA5lC,EAAAq2B,SAAAn1J,KAAAyhK,UAAA9sQ,EAAA+vQ,UAIA1kK,KAAAx7B,IAAAw6K,EAAAp/I,KAAAyvJ,eAGA,IAAAuX,EAAA5mK,KAAA0mK,aAAA70K,OAAAmzK,EAAA,EAAAhlK,KAAA8lK,gBAGA9lK,KAAA2mK,GAAA3mK,KAAAymK,MAAAzmK,KAAAmmK,YAAAnmK,KAAA2mK,GAAAC,GAGA,IAAApiM,EAAA,GACAw7B,KAAA0+J,OAAAgD,QAAA1hK,KAAAwmK,IAAAhiM,GACA,IAAA,IAAA2C,EAAA,EAAAA,EAAA64B,KAAAilK,QAAA99L,EACA64B,KAAAx7B,IAAA+vL,SAAAv0J,KAAA2mK,GAAAx/L,GAAA3C,EAAA2C,IAWA,OAPA64B,KAAAx7B,IAAA2wL,SAAAn1J,KAAAx7B,IAAAS,UAAA+6B,KAAA+lK,WAAA,IAGApxQ,EAAA4sQ,SAAAvhK,KAAAx7B,IAAAm0J,UAAA34H,KAAAimK,OACA7U,GAAA,GAGAA,GA4BA8Q,EAAAM,IAAA7kK,UAAAkpK,SAAA,SAAAj5J,EAAAC,GAKA,IAJA,IAAAi5J,EAAA,CAAA,EAAA,EAAA,EAAA,GACAC,EAAAl5J,EAAAzoC,MAAA,GAGA+B,EAAA,EAAAA,EAAA,MAAAA,EAAA,CAIAymC,EAAAzmC,EAAA,GAAA,GAAA,GAAA,GAAAA,EAAA,KAEA2/L,EAAA,IAAAC,EAAA,GACAD,EAAA,IAAAC,EAAA,GACAD,EAAA,IAAAC,EAAA,GACAD,EAAA,IAAAC,EAAA,IAKA/mK,KAAAq/H,IAAA0nC,EAAAA,GAGA,OAAAD,GAGA5E,EAAAM,IAAA7kK,UAAA0hI,IAAA,SAAAzxH,EAAAmzB,GASA,IANA,IAAAimI,EAAA,EAAAp5J,EAAA,GAMAzmC,EAAA,EAAAA,EAAA,IAAAA,EACA45D,EAAA55D,GAAAymC,EAAAzmC,KAAA,GAAA,EAAAymC,EAAAzmC,EAAA,KAAA,GAGA45D,EAAA,GAAAnzB,EAAA,KAAA,EAKAo5J,IACAjmI,EAAA,IAAA/gC,KAAA4lK,KAIA1D,EAAAM,IAAA7kK,UAAAspK,cAAA,SAAAr5J,GAGA,IADA,IAAA23G,EAAA,CAAA,EAAA,EAAA,EAAA,GACAp+I,EAAA,EAAAA,EAAA,KAAAA,EAAA,CACA,IACA+/L,EAAAt5J,EADAzmC,EAAA,EAAA,KACA,GAAA,EAAAA,EAAA,GAAA,GACAggM,EAAAnnK,KAAAqmK,GAAAl/L,GAAA+/L,GACA3hD,EAAA,IAAA4hD,EAAA,GACA5hD,EAAA,IAAA4hD,EAAA,GACA5hD,EAAA,IAAA4hD,EAAA,GACA5hD,EAAA,IAAA4hD,EAAA,GAEA,OAAA5hD,GAcA28C,EAAAM,IAAA7kK,UAAA8oK,MAAA,SAAAh/F,EAAA55D,EAAAD,GAKA,OAJAC,EAAA,IAAAD,EAAA,GACAC,EAAA,IAAAD,EAAA,GACAC,EAAA,IAAAD,EAAA,GACAC,EAAA,IAAAD,EAAA,GACA5N,KAAAinK,cAAAp5J,IAmBAq0J,EAAAM,IAAA7kK,UAAA2oK,kBAAA,SAAA7+F,EAAA2yD,GAQA,IAJA,IAAAgtC,EAAA,EAAAhtC,EACAitC,EAAA,EAAAD,EACAnqK,EAAA,GAAAmqK,EACAloL,EAAA,IAAA2e,MAAAZ,GACA91B,EAAA,EAAAA,EAAA81B,IAAA91B,EAAA,CACA,IAAAi0B,EAAA,CAAA,EAAA,EAAA,EAAA,GAEAksK,GAAAD,EAAA,EAAAlgM,EAAAkgM,GAAAjtC,EACAh/H,EAFAj0B,EAAAkgM,EAAA,GAEA,GAAAjtC,EAAA,GAAAktC,EACApoL,EAAA/X,GAAA64B,KAAAunK,qBAAAvnK,KAAA6mK,SAAAzrK,EAAAqsE,GAAA2yD,GAEA,OAAAl7I,GAUAgjL,EAAAM,IAAA7kK,UAAA4pK,qBAAA,SAAA/5J,EAAA4sH,GAIA,IAAAn9H,EAAA,GAAAm9H,EACAotC,EAAAvqK,IAAA,EACA/d,EAAA,IAAA2e,MAAAZ,GACA/d,EAAAsoL,GAAAh6J,EAAApoC,MAAA,GAEA,IADA,IAAA+B,EAAAqgM,IAAA,EACArgM,EAAA,GAEA64B,KAAAq/H,IAAAngJ,EAAA,EAAA/X,GAAA+X,EAAA/X,GAAA,IACAA,IAAA,EAGA,IADAA,EAAA,EACAA,EAAAqgM,GAAA,CACA,IAAA,IAAAl2K,EAAA,EAAAA,EAAAnqB,IAAAmqB,EAAA,CACA,IAAAm2K,EAAAvoL,EAAA/X,GACAugM,EAAAxoL,EAAAoS,GACApS,EAAA/X,EAAAmqB,GAAA,CACAm2K,EAAA,GAAAC,EAAA,GACAD,EAAA,GAAAC,EAAA,GACAD,EAAA,GAAAC,EAAA,GACAD,EAAA,GAAAC,EAAA,IAGAvgM,GAAA,EAKA,IAHA+X,EAAA,GAAA,CAAA,EAAA,EAAA,EAAA,GAGA/X,EAAAqgM,EAAA,EAAArgM,EAAA81B,IAAA91B,EAAA,CACA,IAAAsF,EAAAyS,EAAA/X,EAAAqgM,GACAtoL,EAAA/X,GAAA,CAAAqmC,EAAA,GAAA/gC,EAAA,GAAA+gC,EAAA,GAAA/gC,EAAA,GAAA+gC,EAAA,GAAA/gC,EAAA,GAAA+gC,EAAA,GAAA/gC,EAAA,IAEA,OAAAyS,mECx5BA,IAAA8/J,EAAAzrP,EAAA,WAoLA,SAAA4tQ,EAAAtuQ,EAAA6nF,GAIAskK,EAAA0f,OAAAyC,kBAAAtuQ,GAHA,WACA,OAAA,IAAAmsP,EAAAqf,IAAA+C,UAAAvuQ,EAAA6nF,MArLAnnF,EAAA,YACAA,EAAA,iBACAA,EAAA,UAGAF,EAAAC,QAAA0rP,EAAAqf,IAAArf,EAAAqf,KAAA,GAsBArf,EAAAqf,IAAAgD,gBAAA,SAAArsQ,EAAAypQ,EAAA3/B,EAAApkJ,GACA,IAAAgkL,EAAA4C,EAAA,CACAtsQ,IAAAA,EACA8pO,OAAAA,EACAyiC,SAAA,EACA7mL,KAAAA,IAAA,OAAA+jL,EAAA,MAAA,SAGA,OADAC,EAAA1pL,MAAAypL,GACAC,GAiBA1f,EAAAqf,IAAAD,uBAAA,SAAAppQ,EAAA0lF,GACA,OAAA4mL,EAAA,CACAtsQ,IAAAA,EACA8pO,OAAA,KACAyiC,SAAA,EACA7mL,KAAAA,KAwBAskK,EAAAqf,IAAA4C,gBAAA,SAAAjsQ,EAAAypQ,EAAA3/B,EAAApkJ,GACA,IAAAgkL,EAAA4C,EAAA,CACAtsQ,IAAAA,EACA8pO,OAAAA,EACAyiC,SAAA,EACA7mL,KAAAA,IAAA,OAAA+jL,EAAA,MAAA,SAGA,OADAC,EAAA1pL,MAAAypL,GACAC,GAiBA1f,EAAAqf,IAAA0B,uBAAA,SAAA/qQ,EAAA0lF,GACA,OAAA4mL,EAAA,CACAtsQ,IAAAA,EACA8pO,OAAA,KACAyiC,SAAA,EACA7mL,KAAAA,KAYAskK,EAAAqf,IAAA+C,UAAA,SAAAvuQ,EAAA6nF,GACA,IAAA4kB,EAAAU,KACAV,EAAAzsG,KAAAA,EACAysG,EAAA5kB,KAAA,IAAAA,EAAA,CACA+mL,UAAA,EACA/C,OAAA,CACAgD,QAAA,SAAAC,EAAAC,GACA,OAAAC,EAAAviK,EAAAqoK,MAAAhG,EAAAC,GAAA,IAEAL,QAAA,SAAAI,EAAAC,GACA,OAAAC,EAAAviK,EAAAqoK,MAAAhG,EAAAC,GAAA,OAIAtiK,EAAAyiK,OAAA,GAWA/iB,EAAAqf,IAAA+C,UAAAzjK,UAAA6jK,WAAA,SAAA7sQ,GACA,IAAAqrG,KAAA+hK,MAAA,CAIA,IAAA/sQ,EAAAgqP,EAAAp/I,KAAAyvJ,aAAA16P,EAAAK,KACA,GAAA,IAAAgrG,KAAAntG,KAAA24E,QAAA,SACA,KAAAx2E,EAAAiwE,SACA,MAAA,IAAA6zB,MAAA,gCAAA,EAAA9jG,EAAAiwE,UAKA+6B,KAAA2nK,MA2CA,SAAA3yQ,GA2BA,IA1BA,IAyBAomG,EAzBAwsK,EAAA,CAAA,EAAA,EAAA,UAAA,UAAA,MAAA,MAAA,UAAA,UAAA,IAAA,IAAA,UAAA,UAAA,MAAA,MAAA,UAAA,WACAC,EAAA,CAAA,EAAA,EAAA,QAAA,QAAA,SAAA,SAAA,SAAA,SAAA,IAAA,IAAA,QAAA,QAAA,SAAA,SAAA,SAAA,UACAC,EAAA,CAAA,EAAA,EAAA,KAAA,KAAA,SAAA,SAAA,SAAA,SAAA,EAAA,EAAA,KAAA,KAAA,SAAA,SAAA,SAAA,UACAC,EAAA,CAAA,EAAA,QAAA,UAAA,UAAA,KAAA,QAAA,UAAA,UAAA,OAAA,QAAA,UAAA,UAAA,OAAA,QAAA,UAAA,WACAC,EAAA,CAAA,EAAA,OAAA,GAAA,OAAA,EAAA,OAAA,GAAA,OAAA,KAAA,OAAA,KAAA,OAAA,KAAA,OAAA,KAAA,QACAC,EAAA,CAAA,EAAA,KAAA,GAAA,KAAA,EAAA,KAAA,GAAA,KAAA,SAAA,SAAA,SAAA,SAAA,SAAA,SAAA,SAAA,UACAC,EAAA,CAAA,EAAA,UAAA,OAAA,UAAA,EAAA,UAAA,OAAA,UAAA,EAAA,UAAA,OAAA,UAAA,EAAA,UAAA,OAAA,WACAC,EAAA,CAAA,EAAA,MAAA,KAAA,MAAA,UAAA,UAAA,UAAA,UAAA,OAAA,OAAA,OAAA,OAAA,UAAA,UAAA,UAAA,WACAC,EAAA,CAAA,EAAA,OAAA,EAAA,OAAA,EAAA,OAAA,EAAA,OAAA,SAAA,SAAA,SAAA,SAAA,SAAA,SAAA,SAAA,UACAC,EAAA,CAAA,EAAA,UAAA,EAAA,UAAA,EAAA,UAAA,EAAA,UAAA,KAAA,UAAA,KAAA,UAAA,KAAA,UAAA,KAAA,WACAC,EAAA,CAAA,EAAA,GAAA,EAAA,GAAA,QAAA,QAAA,QAAA,QAAA,KAAA,KAAA,KAAA,KAAA,QAAA,QAAA,QAAA,SACAC,EAAA,CAAA,EAAA,SAAA,IAAA,SAAA,QAAA,SAAA,QAAA,SAAA,SAAA,SAAA,SAAA,SAAA,SAAA,SAAA,SAAA,UACAC,EAAA,CAAA,EAAA,KAAA,UAAA,UAAA,OAAA,OAAA,UAAA,UAAA,GAAA,KAAA,UAAA,UAAA,OAAA,OAAA,UAAA,WACAC,EAAA,CAAA,EAAA,EAAA,IAAA,IAAA,EAAA,EAAA,IAAA,IAAA,EAAA,EAAA,IAAA,IAAA,EAAA,EAAA,IAAA,KAIAzH,EAAAhsQ,EAAAiwE,SAAA,EAAA,EAAA,EAGA9wE,EAAA,GAGAu0Q,EAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAEAz0Q,EAAA,EACAq9F,EAAA,EAAAA,EAAA0vK,EAAA1vK,IAAA,CACA,IAAApI,EAAAl0F,EAAA6/P,WACA1rK,EAAAn0F,EAAA6/P,WAIA3rK,IAFAkS,EAAA,WAAAlS,IAAA,EAAAC,KAEA,EAGAD,GADAkS,EAAA,QAHAjS,GAAAiS,MAGA,GAAAlS,GAMAA,IAFAkS,EAAA,WAAAlS,IAAA,GAFAC,GAAAiS,IAAA,OAIA,EAGAlS,GADAkS,EAAA,QAHAjS,GAAAiS,MAGA,GAAAlS,GAMAA,IAFAkS,EAAA,YAAAlS,IAAA,GAFAC,GAAAiS,IAAA,OAIA,EAGAlS,GADAkS,EAAA,WAHAjS,GAAAiS,KAGA,EAAAlS,GASAkS,GAHAlS,IAFAkS,EAAA,YAAAlS,IAAA,GAFAC,GAAAiS,GAAA,MAIA,IAGA,GAJAjS,GAAAiS,KAIA,GAAA,IAGAlS,EAAAC,GAAA,GAAAA,GAAA,EAAA,SACAA,IAAA,EAAA,MAAAA,IAAA,GAAA,IACAA,EAAAiS,EAGA,IAAA,IAAAj0B,EAAA,EAAAA,EAAAuhM,EAAAzjM,SAAAkC,EAAA,CAEAuhM,EAAAvhM,IACA+hB,EAAAA,GAAA,EAAAA,IAAA,GACAC,EAAAA,GAAA,EAAAA,IAAA,KAEAD,EAAAA,GAAA,EAAAA,IAAA,GACAC,EAAAA,GAAA,EAAAA,IAAA,IAGAA,IAAA,GAOA,IAAAw/K,EACAf,GATA1+K,IAAA,MASA,IAAA2+K,EAAA3+K,IAAA,GAAA,IACA4+K,EAAA5+K,IAAA,GAAA,IAAA6+K,EAAA7+K,IAAA,GAAA,IACA8+K,EAAA9+K,IAAA,GAAA,IAAA++K,EAAA/+K,IAAA,EAAA,IACAg/K,EAAAh/K,IAAA,EAAA,IACA0/K,EACAT,EAAAh/K,IAAA,IAAAi/K,EAAAj/K,IAAA,GAAA,IACAk/K,EAAAl/K,IAAA,GAAA,IAAAm/K,EAAAn/K,IAAA,GAAA,IACAo/K,EAAAp/K,IAAA,GAAA,IAAAq/K,EAAAr/K,IAAA,EAAA,IACAs/K,EAAAt/K,IAAA,EAAA,IACAiS,EAAA,OAAAwtK,IAAA,GAAAD,GACAx0Q,EAAAF,KAAA00Q,EAAAvtK,EACAjnG,EAAAF,KAAA20Q,EAAAxtK,GAAA,IAIA,OAAAjnG,EAhJA00Q,CAAA7zQ,GACAgrG,KAAA+hK,OAAA,IAKAZ,EAAA,UAAAniB,EAAA0f,OAAAwD,MAAAC,KACAhB,EAAA,UAAAniB,EAAA0f,OAAAwD,MAAAE,KACAjB,EAAA,UAAAniB,EAAA0f,OAAAwD,MAAAG,KACAlB,EAAA,UAAAniB,EAAA0f,OAAAwD,MAAAI,KACAnB,EAAA,UAAAniB,EAAA0f,OAAAwD,MAAAK,KAEApB,EAAA,WAAAniB,EAAA0f,OAAAwD,MAAAC,KACAhB,EAAA,WAAAniB,EAAA0f,OAAAwD,MAAAE,KACAjB,EAAA,WAAAniB,EAAA0f,OAAAwD,MAAAG,KACAlB,EAAA,WAAAniB,EAAA0f,OAAAwD,MAAAI,KACAnB,EAAA,WAAAniB,EAAA0f,OAAAwD,MAAAK,KAWA,IAAAuG,EAAA,CAAA,SAAA,EAAA,MAAA,SAAA,SAAA,MAAA,EAAA,MAAA,KAAA,SAAA,SAAA,KAAA,SAAA,SAAA,SAAA,EAAA,KAAA,SAAA,SAAA,MAAA,MAAA,SAAA,SAAA,SAAA,MAAA,SAAA,SAAA,MAAA,EAAA,KAAA,MAAA,SAAA,MAAA,SAAA,EAAA,SAAA,SAAA,SAAA,SAAA,KAAA,SAAA,MAAA,MAAA,SAAA,KAAA,EAAA,SAAA,MAAA,SAAA,MAAA,SAAA,SAAA,SAAA,KAAA,MAAA,SAAA,KAAA,SAAA,SAAA,EAAA,MAAA,MAAA,EAAA,UACAC,EAAA,EAAA,YAAA,WAAA,MAAA,QAAA,QAAA,IAAA,YAAA,YAAA,YAAA,YAAA,YAAA,YAAA,WAAA,QAAA,IAAA,WAAA,QAAA,SAAA,WAAA,GAAA,WAAA,MAAA,SAAA,WAAA,SAAA,WAAA,EAAA,QAAA,OAAA,YAAA,WAAA,MAAA,EAAA,SAAA,WAAA,SAAA,YAAA,YAAA,WAAA,OAAA,YAAA,WAAA,IAAA,WAAA,QAAA,GAAA,OAAA,WAAA,OAAA,WAAA,SAAA,WAAA,SAAA,YAAA,WAAA,QAAA,QAAA,GAAA,WAAA,OAAA,YAAA,YAAA,WAAA,SACAC,EAAA,CAAA,IAAA,UAAA,EAAA,UAAA,UAAA,EAAA,OAAA,UAAA,OAAA,UAAA,UAAA,OAAA,UAAA,OAAA,UAAA,IAAA,UAAA,EAAA,UAAA,IAAA,OAAA,UAAA,UAAA,OAAA,UAAA,OAAA,OAAA,UAAA,EAAA,UAAA,IAAA,UAAA,UAAA,UAAA,OAAA,IAAA,OAAA,UAAA,UAAA,EAAA,IAAA,OAAA,UAAA,UAAA,UAAA,IAAA,EAAA,UAAA,UAAA,OAAA,UAAA,UAAA,EAAA,OAAA,OAAA,UAAA,UAAA,UAAA,IAAA,UAAA,OAAA,EAAA,UAAA,QACAC,EAAA,CAAA,QAAA,KAAA,KAAA,IAAA,QAAA,QAAA,QAAA,KAAA,EAAA,QAAA,QAAA,QAAA,IAAA,EAAA,QAAA,QAAA,EAAA,KAAA,QAAA,QAAA,IAAA,QAAA,KAAA,KAAA,QAAA,EAAA,KAAA,QAAA,KAAA,QAAA,QAAA,IAAA,QAAA,QAAA,QAAA,QAAA,IAAA,EAAA,EAAA,QAAA,KAAA,QAAA,QAAA,EAAA,QAAA,KAAA,KAAA,IAAA,QAAA,IAAA,EAAA,KAAA,QAAA,KAAA,QAAA,QAAA,KAAA,KAAA,QAAA,QAAA,IAAA,QAAA,KAAA,SACAC,EAAA,CAAA,IAAA,SAAA,SAAA,WAAA,OAAA,IAAA,WAAA,SAAA,WAAA,OAAA,SAAA,WAAA,WAAA,WAAA,OAAA,WAAA,SAAA,WAAA,WAAA,EAAA,WAAA,WAAA,WAAA,SAAA,WAAA,WAAA,EAAA,WAAA,SAAA,SAAA,WAAA,OAAA,OAAA,WAAA,IAAA,SAAA,WAAA,SAAA,WAAA,WAAA,SAAA,WAAA,WAAA,SAAA,WAAA,IAAA,SAAA,WAAA,WAAA,OAAA,WAAA,WAAA,SAAA,EAAA,WAAA,WAAA,OAAA,SAAA,WAAA,OAAA,EAAA,WAAA,SAAA,YACAC,EAAA,CAAA,UAAA,UAAA,MAAA,UAAA,UAAA,GAAA,UAAA,QAAA,UAAA,QAAA,QAAA,UAAA,QAAA,UAAA,UAAA,MAAA,EAAA,QAAA,UAAA,MAAA,QAAA,UAAA,GAAA,UAAA,UAAA,EAAA,QAAA,UAAA,MAAA,QAAA,UAAA,UAAA,UAAA,GAAA,UAAA,QAAA,UAAA,QAAA,MAAA,UAAA,QAAA,UAAA,UAAA,MAAA,UAAA,UAAA,QAAA,UAAA,QAAA,UAAA,EAAA,UAAA,GAAA,MAAA,UAAA,QAAA,MAAA,QAAA,UAAA,EAAA,UAAA,UAAA,QAAA,WACAC,EAAA,CAAA,QAAA,SAAA,SAAA,EAAA,KAAA,SAAA,QAAA,SAAA,SAAA,QAAA,EAAA,SAAA,EAAA,SAAA,SAAA,KAAA,SAAA,QAAA,QAAA,SAAA,SAAA,SAAA,SAAA,QAAA,SAAA,KAAA,KAAA,SAAA,QAAA,EAAA,SAAA,QAAA,SAAA,QAAA,QAAA,SAAA,SAAA,SAAA,SAAA,EAAA,QAAA,SAAA,SAAA,QAAA,SAAA,KAAA,QAAA,SAAA,KAAA,SAAA,SAAA,SAAA,QAAA,EAAA,EAAA,SAAA,EAAA,QAAA,SAAA,KAAA,SAAA,SAAA,KAAA,SACAC,EAAA,CAAA,UAAA,KAAA,OAAA,UAAA,UAAA,UAAA,GAAA,UAAA,OAAA,UAAA,UAAA,OAAA,UAAA,OAAA,KAAA,GAAA,UAAA,UAAA,UAAA,KAAA,OAAA,OAAA,UAAA,UAAA,KAAA,EAAA,EAAA,UAAA,UAAA,UAAA,OAAA,OAAA,OAAA,OAAA,UAAA,KAAA,GAAA,UAAA,KAAA,OAAA,UAAA,GAAA,UAAA,UAAA,UAAA,UAAA,OAAA,UAAA,EAAA,UAAA,OAAA,UAAA,UAAA,UAAA,UAAA,EAAA,UAAA,OAAA,OAAA,KAAA,KAAA,OAAA,UAAA,WA0HA,SAAAxH,EAAA1tQ,EAAA66F,EAAA8vI,EAAAyiC,GAEA,IACA+H,EASAluK,EAVA4lK,EAAA,KAAA7sQ,EAAA8wE,OAAA,EAAA,EAGAqkM,EADA,IAAAtI,EACAO,EAAA,CAAA,IAAA,GAAA,GAAA,CAAA,EAAA,GAAA,GAEAA,EACA,CAAA,GAAA,IAAA,EAAA,GAAA,GAAA,EAAA,IAAA,GAAA,GACA,CAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAKA,IAAAr4K,EAAA8F,EAAA,GACA7F,EAAA6F,EAAA,GAKA9F,IAFAkS,EAAA,WAAAlS,IAAA,EAAAC,KAEA,EAIAD,IAFAkS,EAAA,OAAAlS,IAAA,IAHAC,GAAAiS,MAKA,GAGAlS,GADAkS,EAAA,YAHAjS,GAAAiS,KAGA,EAAAlS,GAKAA,GADAkS,EAAA,WAFAjS,GAAAiS,GAAA,KAEA,EAAAlS,GASAA,GAHAA,IAFAkS,EAAA,YAAAlS,IAAA,GAFAC,GAAAiS,GAAA,MAIA,IAGA,EAAAlS,IAAA,GACAC,GALAA,GAAAiS,IAKA,EAAAjS,IAAA,GAEA,IAAA,IAAAmI,EAAA,EAAAA,EAAA0vK,EAAA1vK,GAAA,EAAA,CAKA,IAJA,IAAAi4K,EAAAD,EAAAh4K,EAAA,GACAk4K,EAAAF,EAAAh4K,EAAA,GAGAnqB,EAAAmiM,EAAAh4K,GAAAnqB,GAAAoiM,EAAApiM,GAAAqiM,EAAA,CACA,IAAAC,EAAAtgL,EAAAh1F,EAAAgzE,GACAuiM,GAAAvgL,IAAA,EAAAA,GAAA,IAAAh1F,EAAAgzE,EAAA,GAGAi0B,EAAAlS,EACAA,EAAAC,EACAA,EAAAiS,GACA2tK,EAAAU,IAAA,GAAA,IACAR,EAAAQ,IAAA,GAAA,IACAN,EAAAM,IAAA,EAAA,IACAJ,EAAA,GAAAI,GACAX,EAAAY,IAAA,GAAA,IACAV,EAAAU,IAAA,GAAA,IACAR,EAAAQ,IAAA,EAAA,IACAN,EAAA,GAAAM,IAGAtuK,EAAAlS,EACAA,EAAAC,EACAA,EAAAiS,EAKAjS,EAAAA,IAAA,EAAAA,GAAA,GAIAA,GADAiS,EAAA,aAJAlS,EAAAA,IAAA,EAAAA,GAAA,MAIA,EAAAC,GAMAA,IAFAiS,EAAA,UAAAjS,IAAA,GAFAD,GAAAkS,GAAA,MAIA,EAIAjS,IAFAiS,EAAA,WAAAjS,IAAA,GAHAD,GAAAkS,MAKA,EAGAjS,GADAiS,EAAA,QAHAlS,GAAAkS,KAGA,GAAAjS,GAKAA,GADAiS,EAAA,YAFAlS,GAAAkS,GAAA,MAEA,EAAAjS,GAEAD,GAAAkS,GAAA,EAEA0jI,EAAA,GAAA51I,EACA41I,EAAA,GAAA31I,EAsBA,SAAAm4K,EAAA3sQ,GAEA,IAGA+pQ,EAFAnB,EAAA,SAFA5oQ,EAAAA,GAAA,IACA+lF,MAAA,OAAAgb,cAWA1gB,GANA0pL,EADA/pQ,EAAA4sQ,QACAviB,EAAA0f,OAAAsF,eAAAzG,EAAA5oQ,EAAAK,KAEAgqP,EAAA0f,OAAAuF,aAAA1G,EAAA5oQ,EAAAK,MAIAggF,MAcA,OAbA0pL,EAAA1pL,MAAA,SAAAypL,EAAA9pQ,GAEA,IAAAmqO,EAAA,KACAnqO,aAAAqqP,EAAAp/I,KAAA8zJ,aACA50B,EAAAnqO,EACAA,EAAA,KAEAA,EAAAA,GAAA,IACAmqO,OAAAA,EACAnqO,EAAA8pQ,GAAAA,EACAzpL,EAAA4oB,KAAA8gK,EAAA/pQ,IAGA+pQ,8GCveA,IAAA1f,EAAAzrP,EAAA,WAEAF,EAAAC,QAAA0rP,EAAAie,GAAAje,EAAAie,IAAA,GACAje,EAAAie,GAAAiH,WAAAllB,EAAAie,GAAAiH,YAAA,2ECDIllB,EAAQzrP,EAAQ,WACpBA,EAAQ,UACRA,EAAQ,QACRA,EAAQ,cAIJy6N,EAFAuwC,EAAQvf,EAAMuf,MAAQvf,EAAMuf,OAAAA,GAG7Bvf,EAAMp/I,KAAK4zJ,WAAaxU,EAAMrqP,QAAQi+P,oBACvC5kC,EAASz6N,EAAQ,WAmBnBF,EAAOC,QAAU0rP,EAAMwf,OAASD,EAAMC,OAAS,SAC7Ct3L,EAAGgV,EAAGzP,EAAGixL,EAAOT,EAAI5iG,MACH,mBAAP4iG,IACR5iG,EAAW4iG,EACXA,EAAK,MAKJje,EAAMp/I,KAAK4zJ,WAAaxU,EAAMrqP,QAAQi+P,mBACvC5kC,EAAOwwC,SAAkB,OAAPvB,GAA6B,iBAAPA,KACvCjvC,EAAO27C,WAAW1kM,OAAS,IAAOg4L,GAAa,SAAPA,SACxB,iBAAPA,IAERA,EAAK,QAEP/1L,EAAI+7K,EAAOx5F,KAAKviF,EAAG,UACnBgV,EAAI+mK,EAAOx5F,KAAKvtE,EAAG,UACfm+E,EAM4B,IAA7B2zD,EAAO27C,WAAW1kM,OACZ+oJ,EAAOwwC,OAAOt3L,EAAGgV,EAAGzP,EAAGixL,GAAO,SAASjkK,EAAKzkG,MAC9CykG,SACM4gE,EAAS5gE,GAElB4gE,EAAS,KAAMrlK,EAAIopG,SAAS,cAGzB4vH,EAAOwwC,OAAOt3L,EAAGgV,EAAGzP,EAAGixL,EAAOT,GAAI,SAASxjK,EAAKzkG,MAClDykG,SACM4gE,EAAS5gE,GAElB4gE,EAAS,KAAMrlK,EAAIopG,SAAS,cAjBI,IAA7B4vH,EAAO27C,WAAW1kM,OACZ+oJ,EAAO27C,WAAWziM,EAAGgV,EAAGzP,EAAGixL,GAAOt/J,SAAS,UAE7C4vH,EAAO27C,WAAWziM,EAAGgV,EAAGzP,EAAGixL,EAAOT,GAAI7+J,SAAS,mBAkBhD6+J,IAERA,EAAK,QAEU,iBAAPA,EAAO,MACVA,KAAMje,EAAMie,GAAGiH,sBACRprK,MAAM,2BAA6BmkK,GAE/CA,EAAKje,EAAMie,GAAGA,GAAI/oQ,aAGhB01Q,EAAO3M,EAAGiD,gBAIXxC,EAAS,WAAakM,EAAAA,KACnBnwK,EAAAA,IAAUX,MAAM,+BACjBuhE,SACMA,EAAS5gE,SAEZA,MASJ2J,EAAMx9B,KAAKwhL,KAAKsW,EAAQkM,GACxB57J,EAAI0vJ,GAASt6J,EAAM,GAAKwmK,EA2BxBC,EAAM7qB,EAAM8qB,KAAK51Q,SACrB21Q,EAAI70L,MAAMioL,EAAI/1L,OAEV6iM,EAAKC,EAAKC,EADV3L,EAAK,OAILjkG,EAAAA,SACMlzF,EAAI,EAAGA,GAAKi8B,IAAOj8B,EAAAA,CAEzB0iM,EAAI70L,MAAM,KAAM,MAChB60L,EAAIl0G,OAAOz5E,GACX2tL,EAAIl0G,OAAOqpF,EAAMp/I,KAAKy2J,aAAalvL,IACnC4iM,EAAME,EAAOJ,EAAI3wC,SAASkoB,mBAGlB9vJ,EAAI,EAAGA,GAAK7kB,IAAK6kB,EACvBu4K,EAAI70L,MAAM,KAAM,MAChB60L,EAAIl0G,OAAOs0G,GACXD,EAAMH,EAAI3wC,SAASkoB,WAEnB2oB,EAAM/qB,EAAMp/I,KAAKs2J,SAAS6T,EAAKC,EAAKJ,GACpCK,EAAOD,EAOT1L,GAAOn3L,EAAIi8B,EAAO2mK,EAAMA,EAAIlkM,OAAO,EAAGmoC,UAGjCswJ,EAILn3L,EAAI,EACR,SAAA8uI,OACK9uI,EAAIi8B,SAEEi3D,EAAS,KAAMikG,GAIxBuL,EAAI70L,MAAM,KAAM,MAChB60L,EAAIl0G,OAAOz5E,GACX2tL,EAAIl0G,OAAOqpF,EAAMp/I,KAAKy2J,aAAalvL,IACnC4iM,EAAME,EAAOJ,EAAI3wC,SAASkoB,WAG1B9vJ,EAAI,EACJ2vD,IAGF,SAAAA,OACK3vD,GAAK7kB,SACNo9L,EAAI70L,MAAM,KAAM,MAChB60L,EAAIl0G,OAAOs0G,GACXD,EAAMH,EAAI3wC,SAASkoB,WAEnB2oB,EAAM/qB,EAAMp/I,KAAKs2J,SAAS6T,EAAKC,EAAKJ,GACpCK,EAAOD,IACL14K,EACK0tJ,EAAMp/I,KAAKuzJ,aAAalyG,GAOjCq9G,GAAOn3L,EAAIi8B,EAAO2mK,EAAMA,EAAIlkM,OAAO,EAAGmoC,KAEpC7mC,EACF8uI,IAGFA,mICxMF,IAAA+oC,EAAAzrP,EAAA,WACAA,EAAA,QACAA,EAAA,WAGAF,EAAAC,QAAA0rP,EAAA8qB,KAAA9qB,EAAA8qB,MAAA,IAOA51Q,OAAA,WAEA,IAAA6oG,EAAA,KAGAmtK,EAAA,KAGAC,EAAA,KAGAC,EAAA,KAGAnwF,EAAA,CAUAjlG,MAAA,SAAAioL,EAAAjoQ,GACA,GAAA,OAAAioQ,EACA,GAAA,iBAAAA,EAAA,CAGA,MADAA,EAAAA,EAAA7zL,iBACA41K,EAAAie,GAAAiH,YAGA,MAAA,IAAAprK,MAAA,2BAAAmkK,EAAA,KAFAiN,EAAAlrB,EAAAie,GAAAiH,WAAAjH,GAAA/oQ,cAMAg2Q,EAAAjN,EAIA,GAAA,OAAAjoQ,EAEAA,EAAA+nG,MACA,CACA,GAAA,iBAAA/nG,EAEAA,EAAAgqP,EAAAp/I,KAAAyvJ,aAAAr6P,QACA,GAAAgqP,EAAAp/I,KAAA9iB,QAAA9nF,GAAA,CAEA,IAAAomG,EAAApmG,EACAA,EAAAgqP,EAAAp/I,KAAAyvJ,eACA,IAAA,IAAAloL,EAAA,EAAAA,EAAAi0B,EAAAn2B,SAAAkC,EACAnyE,EAAAw6P,QAAAp0J,EAAAj0B,IAKA,IAAAkjM,EAAAr1Q,EAAAiwE,SACAolM,EAAAH,EAAA/J,cACA+J,EAAAl1L,QACAk1L,EAAAv0G,OAAA3gK,EAAA2jO,SACA3jO,EAAAk1Q,EAAAhxC,UAMAixC,EAAAnrB,EAAAp/I,KAAAyvJ,eACA+a,EAAAprB,EAAAp/I,KAAAyvJ,eACAgb,EAAAr1Q,EAAAiwE,SACA,IAAAkC,EAAA,EAAAA,EAAAkjM,IAAAljM,EAAA,CACAi0B,EAAApmG,EAAAozG,GAAAjhC,GACAgjM,EAAA3a,QAAA,GAAAp0J,GACAgvK,EAAA5a,QAAA,GAAAp0J,GAIA,GAAAivK,EAAAH,EAAA/J,YAEA,IADA/kK,EAAA8uK,EAAA/J,YAAAkK,EACAljM,EAAA,EAAAA,EAAAi0B,IAAAj0B,EACAgjM,EAAA3a,QAAA,IACA4a,EAAA5a,QAAA,IAGAzyJ,EAAA/nG,EACAm1Q,EAAAA,EAAAxxC,QACAyxC,EAAAA,EAAAzxC,QAOAuxC,EAAAl1L,QACAk1L,EAAAv0G,OAAAw0G,IAQAx0G,OAAA,SAAAgjE,GACAuxC,EAAAv0G,OAAAgjE,IAQA2xC,OAAA,WAGA,IAAArpH,EAAAipH,EAAAhxC,SAAAP,QAIA,OAHAuxC,EAAAl1L,QACAk1L,EAAAv0G,OAAAy0G,GACAF,EAAAv0G,OAAA1U,GACAipH,EAAAhxC,WAKA,OAFAj/C,EAAAi/C,OAAAj/C,EAAAqwF,OAEArwF,kFCpHA,IAAA+kE,EAAAzrP,EAAA,WACAA,EAAA,UAGA,IAAA8rQ,EAAAhsQ,EAAAC,QAAA0rP,EAAAqgB,IAAArgB,EAAAqgB,KAAA,GA8JA,SAAAkL,EAAAC,GAQA,IAPA,IAAApZ,EAAAoZ,EAAA33Q,KAAA,KAGAuqG,EAAA,GACAqtK,EAAA,SAAAntL,EAAAotL,GACA,MAAA,IAAAA,GAEAvjM,EAAA,EAAAA,EAAAqjM,EAAAptK,OAAAn4B,SAAAkC,EACAi2B,EAAAtyB,KAAA0/L,EAAAptK,OAAAj2B,GAAA+R,QAAA,aAAAuxL,IAEArZ,GAAAh0J,EAAA9yB,KAAA,KAAA,OAGA,IAAArF,EAAA,EACA0lM,GAAA,EACA,IAAAxjM,EAAA,EAAAA,EAAAiqL,EAAAnsL,SAAAkC,IAAAlC,EACA,GAAAA,EAAA,KAAA,IAAA0lM,EAAA,CACA,IAAAvnG,EAAAguF,EAAAuZ,GACA,MAAAvnG,KACAunG,EACAvZ,EAAAA,EAAAvrL,OAAA,EAAA8kM,GAAA,QAAAvZ,EAAAvrL,OAAA8kM,IAEAvZ,EAAAA,EAAAvrL,OAAA,EAAA8kM,GACA,OAAAvnG,EAAAguF,EAAAvrL,OAAA8kM,EAAA,GAEA1lM,EAAAkC,EAAAwjM,EAAA,EACAA,GAAA,IACAxjM,MACA,MAAAiqL,EAAAjqL,IAAA,OAAAiqL,EAAAjqL,IAAA,MAAAiqL,EAAAjqL,KACAwjM,EAAAxjM,GAIA,OAAAiqL,EAGA,SAAAwZ,EAAAp1K,GACA,OAAAA,EAAAtc,QAAA,OAAA,IAzLAmmL,EAAA/7J,OAAA,SAAA7zB,EAAA96E,GACAA,EAAAA,GAAA,GACA,IAGA61Q,EAHApZ,EAAA,cAAA3hL,EAAA3I,KAAA,YAuBA,GAnBA2I,EAAA+vL,WAKApO,GAAAmZ,EAJAC,EAAA,CACA33Q,KAAA,YACAuqG,OAAA,CAAA/2B,OAAAoJ,EAAA+vL,SAAA97J,SAAAj0B,EAAA+vL,SAAA14L,SAIA2I,EAAAo7L,gBAEAzZ,GAAAmZ,EADAC,EAAA,CAAA33Q,KAAA,iBAAAuqG,OAAA,CAAA3tB,EAAAo7L,kBAGAp7L,EAAAqwL,UACA0K,EAAA,CAAA33Q,KAAA,WAAAuqG,OAAA,CAAA3tB,EAAAqwL,QAAAvC,YACA9tL,EAAAqwL,QAAAhlH,YACA0vH,EAAAptK,OAAAtyB,KAAA2E,EAAAqwL,QAAAhlH,YAEAs2G,GAAAmZ,EAAAC,IAGA/6L,EAAAggJ,QAEA,IAAA,IAAAtoJ,EAAA,EAAAA,EAAAsI,EAAAggJ,QAAAxqJ,SAAAkC,EACAiqL,GAAAmZ,EAAA96L,EAAAggJ,QAAAtoJ,IAaA,OARAsI,EAAA+vL,WACApO,GAAA,QAIAA,GAAApS,EAAAp/I,KAAA62J,SAAAhnL,EAAAxJ,KAAAtxE,EAAA+hQ,SAAA,IAAA,OAEAtF,GAAA,YAAA3hL,EAAA3I,KAAA,aAWAu4L,EAAAj7J,OAAA,SAAA5O,GAQA,IAPA,IAMAlY,EANA8zK,EAAA,GAGA0Z,EAAA,gHACAC,EAAA,uCACAC,EAAA,QAGA1tL,EAAAwtL,EAAAxlM,KAAAkwB,IADA,CAMA,IAAA/lB,EAAA,CACA3I,KAAAwW,EAAA,GACAkiL,SAAA,KACAqL,cAAA,KACA/K,QAAA,KACArwC,QAAA,GACAxpJ,KAAA+4K,EAAAp/I,KAAAk3J,SAAAx5K,EAAA,KAKA,GAHA8zK,EAAAtmL,KAAA2E,GAGA6N,EAAA,GAAA,CAOA,IAFA,IAAAwc,EAAAxc,EAAA,GAAAwC,MAAAkrL,GACAC,EAAA,EACA3tL,GAAA2tL,EAAAnxK,EAAA70B,QAAA,CAKA,IAHA,IAAAgQ,EAAA6kB,EAAAmxK,GAAA/xL,QAAA,OAAA,IAGAgyL,EAAAD,EAAA,EAAAC,EAAApxK,EAAA70B,SAAAimM,EAAA,CACA,IAAA9tL,EAAA0c,EAAAoxK,GACA,IAAA,KAAAzlM,KAAA2X,EAAA,IACA,MAEAnI,GAAAmI,EACA6tL,EAAAC,EAKA,GADA5tL,EAAArI,EAAAqI,MAAAytL,GACA,CAGA,IAFA,IAAAP,EAAA,CAAA33Q,KAAAyqF,EAAA,GAAA8f,OAAA,IACAA,EAAA9f,EAAA,GAAAwC,MAAA,KACAqrL,EAAA,EAAAA,EAAA/tK,EAAAn4B,SAAAkmM,EACAX,EAAAptK,OAAAtyB,KAAA8/L,EAAAxtK,EAAA+tK,KAIA,GAAA17L,EAAA+vL,SASA,GAAA/vL,EAAAo7L,eAAA,mBAAAL,EAAA33Q,KAGA,GAAA48E,EAAAqwL,SAAA,aAAA0K,EAAA33Q,KAQA48E,EAAAggJ,QAAA3kJ,KAAA0/L,OARA,CAEA,GAAA,IAAAA,EAAAptK,OAAAn4B,OACA,MAAA,IAAA6zB,MAAA,yFAGArpB,EAAAqwL,QAAA,CAAAvC,UAAAngK,EAAA,GAAA09C,WAAA19C,EAAA,IAAA,WAPA3tB,EAAAo7L,cAAAztK,EAAA,IAAA,OAXA,CACA,GAAA,cAAAotK,EAAA33Q,KACA,MAAA,IAAAimG,MAAA,qFAEA,GAAA,IAAA0xK,EAAAptK,OAAAn4B,OACA,MAAA,IAAA6zB,MAAA,kFAGArpB,EAAA+vL,SAAA,CAAA97J,QAAAtG,EAAA,GAAAt2B,KAAAs2B,EAAA,OAgBA6tK,EAGA,GAAA,cAAAx7L,EAAA+vL,WAAA/vL,EAAAqwL,QACA,MAAA,IAAAhnK,MAAA,wGAKA,GAAA,IAAAs4J,EAAAnsL,OACA,MAAA,IAAA6zB,MAAA,kCAGA,OAAAs4J,mEC5KA,IAAApS,EAAAzrP,EAAA,WACAA,EAAA,SACAA,EAAA,YACAA,EAAA,UACAA,EAAA,UAKAyrP,EAAA5wI,QAAA4wI,EAAA5wI,OAAAgzI,SACA/tP,EAAAC,QAAA0rP,EAAA5wI,OAIA,SAAAwrJ,GAGA,IAAAwR,EAAA,GACAC,EAAA,IAAAxtK,MAAA,GACAytK,EAAAtsB,EAAAp/I,KAAAyvJ,eAyCA,SAAAkc,IACA,IAAAtxF,EAAA+kE,EAAAwsB,KAAAt3Q,OAAAk3Q,GAgCA,OAlBAnxF,EAAAmnE,SAAA,SAAA79J,EAAA82E,GACA,OAAA4f,EAAAn0F,SAAAvC,EAAA82E,IAaA4f,EAAA6jF,aAAA,SAAAv6K,GACA,OAAA02F,EAAAn0F,SAAAvC,IAGA02F,EAzEAmxF,EAAAK,UAAA,SAAAz2Q,GAEA,IAAAomG,EAAA4jJ,EAAAp/I,KAAAyvJ,aAAAr6P,GAQA,OAPAA,EAAA,IAAA6oG,MAAA,IACA,GAAAzC,EAAAy5J,WACA7/P,EAAA,GAAAomG,EAAAy5J,WACA7/P,EAAA,GAAAomG,EAAAy5J,WACA7/P,EAAA,GAAAomG,EAAAy5J,WAGA7V,EAAAmf,IAAA8D,WAAAjtQ,GAAA,IAEAo2Q,EAAAM,WAAA,SAAAnrB,GAEA,IAAAnlJ,EAAA4jJ,EAAAp/I,KAAAyvJ,aAAA9O,GAMA,OALAA,EAAA,IAAA1iJ,MAAA,IACA,GAAAzC,EAAAy5J,WACAtU,EAAA,GAAAnlJ,EAAAy5J,WACAtU,EAAA,GAAAnlJ,EAAAy5J,WACAtU,EAAA,GAAAnlJ,EAAAy5J,WACAtU,GAEA6qB,EAAA1M,OAAA,SAAA1pQ,EAAAurP,GAMA,OALAvB,EAAAmf,IAAA0D,aAAA7sQ,EAAAurP,EAAA8qB,GAAA,GACAC,EAAA/W,SAAA8W,EAAA,IACAC,EAAA/W,SAAA8W,EAAA,IACAC,EAAA/W,SAAA8W,EAAA,IACAC,EAAA/W,SAAA8W,EAAA,IACAC,EAAAlqB,YAEAgqB,EAAAO,UAAA,SAAAprB,GAGA,QADAA,EAAA,GACAA,GAEA6qB,EAAAnO,GAAAje,EAAAie,GAAA2O,OA0CA,IAAAl/E,EAAA6+E,IAIAM,EAAA,KACApY,EAAAzU,EAAAp/I,KAAA6zJ,YACAqY,EAAArY,EAAAzlC,QAAAylC,EAAAsY,SAOA,GANAD,GAAAA,EAAAD,kBACAA,EAAA,SAAAjvK,GACA,OAAAkvK,EAAAD,gBAAAjvK,KAIAoiJ,EAAArqP,QAAAi+P,oBACA5T,EAAAp/I,KAAA4zJ,WAAAqY,EAAA,CAWA,GARA,oBAAAtsK,QAAAA,OAAApqG,SAKAu3L,EAAAs/E,YAAA,IAAAjuK,KAAA,IAGA,oBAAA,UAAA,CACA,IAAAkuK,EAAA,GACA,IAAA,IAAAj3Q,KAAA4wK,UACA,IACA,iBAAAA,UAAA5wK,KACAi3Q,GAAArmG,UAAA5wK,IAEA,MAAAjB,IASA24L,EAAAw/E,QAAAD,GACAA,EAAA,KAIArS,IAEAA,IAAAuS,WAAA,SAAAp4Q,GAEA24L,EAAAs/E,WAAAj4Q,EAAAq4Q,QAAA,IACA1/E,EAAAs/E,WAAAj4Q,EAAAs4Q,QAAA,OAIAzS,IAAA0S,UAAA,SAAAv4Q,GACA24L,EAAAs/E,WAAAj4Q,EAAAixG,SAAA,OAMA,GAAAg6I,EAAA5wI,OAIA,IAAA,IAAAp5G,KAAA03L,EACAsyD,EAAA5wI,OAAAp5G,GAAA03L,EAAA13L,QAJAgqP,EAAA5wI,OAAAs+E,EASAsyD,EAAA5wI,OAAAm+J,eAAAhB,EAEAl4Q,EAAAC,QAAA0rP,EAAA5wI,OA7JA,CA+JA,oBAAA,OAAAwrJ,OAAA,0HCnLA,IAAA5a,EAAAzrP,EAAA,WACAA,EAAA,QACAA,EAAA,UAEA,IAAAq4Q,EAAAv4Q,EAAAC,QAAA0rP,EAAA4sB,OAAA5sB,EAAA4sB,QAAA,GACA5sB,EAAAie,GAAA2O,OAAA5sB,EAAAie,GAAAiH,WAAA0H,OAAAA,EAOAA,EAAA13Q,OAAA,WAEAs4Q,IA4LAC,EAAApmM,OAAA67C,aAAA,KACAuqJ,GAAAztB,EAAAp/I,KAAAq2J,WAAA5vL,OAAA67C,aAAA,GAAA,IAGAwqJ,EAAA,CACA,WAAA,WAAA,WAAA,WACA,UAAA,WAAA,WAAA,WACA,WAAA,UAAA,UAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,UAAA,UACA,UAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,UAAA,UACA,UAAA,UAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,UACA,UAAA,UAAA,UAAA,UACA,UAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,YAGAF,GAAA,GA9MA,IAAAG,EAAA,KAGArI,EAAAtlB,EAAAp/I,KAAAyvJ,eAGAyS,EAAA,IAAAjkK,MAAA,IAGAo/J,EAAA,CACAM,UAAA,SACA4C,YAAA,GACAD,aAAA,GAEA0M,cAAA,EAEAC,kBAAA,KAEAC,kBAAA,EAQA93L,MAAA,WAEAioL,EAAA2P,cAAA,EAGA3P,EAAA4P,kBAAA5P,EAAA8P,gBAAA,GAEA,IADA,IAAAC,EAAA/P,EAAA6P,kBAAA,EACA3lM,EAAA,EAAAA,EAAA6lM,IAAA7lM,EACA81L,EAAA4P,kBAAA/hM,KAAA,GAaA,OAXAw5L,EAAAtlB,EAAAp/I,KAAAyvJ,eACAsd,EAAA,CACAM,GAAA,WACAC,GAAA,WACAC,GAAA,WACAC,GAAA,WACAC,GAAA,WACAC,GAAA,WACAC,GAAA,UACAC,GAAA,YAEAvQ,IAyHA,OAtHAA,EAAAjoL,QAYAioL,EAAAtnG,OAAA,SAAAlmF,EAAA8sJ,GACA,SAAAA,IACA9sJ,EAAAuvK,EAAAp/I,KAAAy0J,WAAA5kL,IAIA,IAAA2zB,EAAA3zB,EAAAxK,OACAg4L,EAAA2P,eAAAxpK,EACAA,EAAA,CAAAA,EAAA,aAAA,EAAAA,IAAA,GACA,IAAA,IAAAj8B,EAAA81L,EAAA4P,kBAAA5nM,OAAA,EAAAkC,GAAA,IAAAA,EACA81L,EAAA4P,kBAAA1lM,IAAAi8B,EAAA,GACAA,EAAA,GAAAA,EAAA,IAAA65J,EAAA4P,kBAAA1lM,GAAA,aAAA,GACA81L,EAAA4P,kBAAA1lM,GAAA81L,EAAA4P,kBAAA1lM,KAAA,EACAi8B,EAAA,GAAAA,EAAA,GAAA,aAAA,EAcA,OAVAkhK,EAAA/U,SAAA9/K,GAGAg+L,EAAAd,EAAA7K,EAAAwC,IAGAA,EAAAtzC,KAAA,MAAA,IAAAszC,EAAAr/L,WACAq/L,EAAApP,UAGA+H,GAQAA,EAAA/jC,OAAA,WAqBA,IAAAw0C,EAAA1uB,EAAAp/I,KAAAyvJ,eACAqe,EAAAne,SAAA+U,EAAA3rC,SAGA,IAYAv7I,EALAsnL,EANAzH,EAAA4P,kBAAA5P,EAAA4P,kBAAA5nM,OAAA,GACAg4L,EAAA6P,kBAKA7P,EAAAkD,YAAA,EACAuN,EAAAne,SAAAkd,EAAA5mM,OAAA,EAAAo3L,EAAAkD,YAAAuE,IAMA,IADA,IAAAtqC,EAAA,EAAA6iC,EAAA4P,kBAAA,GACA1lM,EAAA,EAAAA,EAAA81L,EAAA4P,kBAAA5nM,OAAA,IAAAkC,EAGAizJ,IAFAh9I,EAAA,EAAA6/K,EAAA4P,kBAAA1lM,EAAA,IACA,aAAA,EAEAumM,EAAAnZ,SAAAn6B,IAAA,GACAA,EAAAh9I,IAAA,EAEAswL,EAAAnZ,SAAAn6B,GAEA,IAAAtkC,EAAA,CACAm3E,GAAAN,EAAAM,GACAC,GAAAP,EAAAO,GACAC,GAAAR,EAAAQ,GACAC,GAAAT,EAAAS,GACAC,GAAAV,EAAAU,GACAC,GAAAX,EAAAW,GACAC,GAAAZ,EAAAY,GACAC,GAAAb,EAAAa,IAEAC,EAAA33E,EAAAgsE,EAAA4L,GACA,IAAAtc,EAAApS,EAAAp/I,KAAAyvJ,eASA,OARA+B,EAAAmD,SAAAz+D,EAAAm3E,IACA7b,EAAAmD,SAAAz+D,EAAAo3E,IACA9b,EAAAmD,SAAAz+D,EAAAq3E,IACA/b,EAAAmD,SAAAz+D,EAAAs3E,IACAhc,EAAAmD,SAAAz+D,EAAAu3E,IACAjc,EAAAmD,SAAAz+D,EAAAw3E,IACAlc,EAAAmD,SAAAz+D,EAAAy3E,IACAnc,EAAAmD,SAAAz+D,EAAA03E,IACApc,GAGA6L,GAIA,IAAAwP,EAAA,KACAD,GAAA,EAGAE,EAAA,KAwCA,SAAAe,EAAAvxL,EAAAuoI,EAAAkU,GAIA,IAFA,IAAAg1C,EAAAC,EAAAC,EAAAC,EAAA3mM,EAAAN,EAAAyS,EAAA7M,EAAAmxD,EAAA7pI,EAAA2tJ,EAAA0iE,EAAA38C,EACArkE,EAAAu1H,EAAA1zJ,SACAm+B,GAAA,IAAA,CAGA,IAAAj8B,EAAA,EAAAA,EAAA,KAAAA,EACAs9I,EAAAt9I,GAAAwxJ,EAAAk8B,WAEA,KAAA1tL,EAAA,KAAAA,EAGAwmM,IADAA,EAAAlpD,EAAAt9I,EAAA,MAEA,GAAAwmM,GAAA,KACAA,IAAA,GAAAA,GAAA,IACAA,IAAA,GAGAC,IADAA,EAAAnpD,EAAAt9I,EAAA,OAEA,EAAAymM,GAAA,KACAA,IAAA,GAAAA,GAAA,IACAA,IAAA,EAEAnpD,EAAAt9I,GAAAwmM,EAAAlpD,EAAAt9I,EAAA,GAAAymM,EAAAnpD,EAAAt9I,EAAA,IAAA,EAcA,IAVAN,EAAAqV,EAAA+wL,GACA3zL,EAAA4C,EAAAgxL,GACAzgM,EAAAyP,EAAAixL,GACAvvI,EAAA1hD,EAAAkxL,GACAr5Q,EAAAmoF,EAAAmxL,GACA3rH,EAAAxlE,EAAAoxL,GACAlpD,EAAAloI,EAAAqxL,GACA9lG,EAAAvrF,EAAAsxL,GAGArmM,EAAA,EAAAA,EAAA,KAAAA,EASA0mM,GACAhnM,IAAA,EAAAA,GAAA,KACAA,IAAA,GAAAA,GAAA,KACAA,IAAA,GAAAA,GAAA,IAEAinM,EAAAjnM,EAAAyS,EAAA7M,GAAA5F,EAAAyS,GAGAq0L,EAAAlmG,IAdA1zK,IAAA,EAAAA,GAAA,KACAA,IAAA,GAAAA,GAAA,KACAA,IAAA,GAAAA,GAAA,KAEAqwN,EAAArwN,GAAA2tJ,EAAA0iE,IAUAsoD,EAAAvlM,GAAAs9I,EAAAt9I,GAEAsgG,EAAA28C,EACAA,EAAA1iE,EACAA,EAAA3tJ,EAGAA,EAAA6pI,EAAA+vI,IAAA,EACA/vI,EAAAnxD,EACAA,EAAA6M,EACAA,EAAAzS,EAGAA,EAAA8mM,GAZAC,EAAAC,EAAAC,KAYA,EAIA5xL,EAAA+wL,GAAA/wL,EAAA+wL,GAAApmM,EAAA,EACAqV,EAAAgxL,GAAAhxL,EAAAgxL,GAAA5zL,EAAA,EACA4C,EAAAixL,GAAAjxL,EAAAixL,GAAA1gM,EAAA,EACAyP,EAAAkxL,GAAAlxL,EAAAkxL,GAAAxvI,EAAA,EACA1hD,EAAAmxL,GAAAnxL,EAAAmxL,GAAAt5Q,EAAA,EACAmoF,EAAAoxL,GAAApxL,EAAAoxL,GAAA5rH,EAAA,EACAxlE,EAAAqxL,GAAArxL,EAAAqxL,GAAAnpD,EAAA,EACAloI,EAAAsxL,GAAAtxL,EAAAsxL,GAAA/lG,EAAA,EACArkE,GAAA,qGCzTI47I,EAAQzrP,EAAQ,WACpBA,EAAQ,cAEJu4Q,EAAU,MACX9sB,EAAMp/I,KAAK4zJ,UAAaxU,EAAMrqP,QAAQi+P,mBACtC9gE,EAAQujC,SAAS,iBAClBy2C,EAAUv4Q,EAAQ,YAITF,EAAOC,QAAU0rP,EAAMwsB,KAAOxsB,EAAMwsB,MAAAA,IAoB1Ct3Q,OAAS,SAASinI,WACjB8+C,EAAAA,CACF9+C,OAAQA,EACRnmI,IAAK,KACLurP,KAAM,KACNnlC,KAAM,KAEN2yD,QAAS,EAETpoL,UAAW,EAEXqoL,SAAU,IAIR/Q,EAAK9hI,EAAO8hI,GACZgR,EAAAA,IAAYpwK,MAAM,IACd12B,EAAI,EAAGA,EAAI,KAAMA,EACvB8mM,EAAM9mM,GAAK81L,EAAG/oQ,SAgJhB,SAAAg6Q,OACKj0F,EAAIg0F,MAAM,GAAGrB,eAAiB,UACxBuB,QAGLC,EAAU,GAAKn0F,EAAIg0F,MAAM,GAAGrB,eAAkB,EAClD3yF,EAAIiyF,QAAQjyF,EAAIo0F,aAAaD,IAC7BD,IAMF,SAAAA,IAEEl0F,EAAI8zF,QAA2B,aAAhB9zF,EAAI8zF,QAA0B,EAAI9zF,EAAI8zF,QAAU,MAO3D9Q,EAAKhjF,EAAI9+C,OAAO8hI,GAAG/oQ,SAGvB+oQ,EAAGtnG,OAAOskB,EAAI+zF,kBAIVM,EAAS,EACLj6Q,EAAI,EAAGA,EAAI,KAAMA,EACpB4lL,EAAI8zF,QAAUO,GAAW,IAC1BrR,EAAGtnG,OAAOskB,EAAIg0F,MAAM55Q,GAAG6kO,SAASkoB,YAChCnnE,EAAIg0F,MAAM55Q,GAAG2gF,SAEfs5L,IAAmB,EAIrBr0F,EAAI+zF,SAAW/Q,EAAG/jC,SAASkoB,WAM3B6b,EAAGjoL,QACHioL,EAAGtnG,OAAOskB,EAAI+zF,cACVO,EAAYtR,EAAG/jC,SAASkoB,WAG5BnnE,EAAIjlL,IAAMilL,EAAI9+C,OAAOswI,UAAUxxF,EAAI+zF,UACnC/zF,EAAIsmE,KAAOtmE,EAAI9+C,OAAOuwI,WAAW6C,GACjCt0F,EAAIt0F,UAAY,EAWlB,SAAA6oL,EAAyBJ,OAEnBvC,EAAkB,KAClBpY,EAAczU,EAAMp/I,KAAK6zJ,YACzBqY,EAAUrY,EAAYzlC,QAAUylC,EAAYsY,SAC7CD,GAAWA,EAAQD,kBACpBA,EAAkB,SAASjvK,UAClBkvK,EAAQD,gBAAgBjvK,SAI/BtjB,EAAI0lK,EAAMp/I,KAAKyvJ,kBAChBwc,OACKvyL,EAAErU,SAAWmpM,GAAAA,KAGb7qL,EAAQ3d,KAAKD,IAAI,EAAGC,KAAKq0B,IAAIm0K,EAAS90L,EAAErU,SAAU,OAAS,GAC3DwpM,EAAAA,IAAcC,YAAY9oM,KAAK6nC,MAAMlqB,QAEvCsoL,EAAgB4C,WACRtnM,EAAI,EAAGA,EAAIsnM,EAAQxpM,SAAUkC,EACnCmS,EAAEi7K,SAASka,EAAQtnM,UAEfpzE,QAE6B,oBAAvB46Q,oBACV56Q,aAAa46Q,0BACP56Q,MAOXulF,EAAErU,SAAWmpM,UAIV/qB,EAAIC,EAAIlmK,EACRmjK,EAAO36K,KAAK6nC,MAAsB,MAAhB7nC,KAAKwoC,UACrB90B,EAAErU,SAAWmpM,GAAAA,CACjB9qB,EAAK,OAAgB,MAAP/C,GAEd+C,IAAY,OADZD,EAAK,OAAS9C,GAAQ,OACC,GAGvBA,EAAY,YADZ+C,GAAW,YADXA,GAAMD,GAAM,MACcC,GAAM,SAIxBn8K,EAAI,EAAGA,EAAI,IAAKA,EAEtBiW,EAAOmjK,KAAUp5K,GAAK,GACtBiW,GAAQxX,KAAK6nC,MAAsB,IAAhB7nC,KAAKwoC,UACxB90B,EAAEk2K,QAAQnpL,OAAO67C,aAAoB,IAAP9kC,WAK7B9D,EAAE8nK,SAASgtB,UAvQpBn0F,EAAIg0F,MAAQA,EAGZh0F,EAAIwpE,KAAO,EAYXxpE,EAAIn0F,SAAW,SAASvC,EAAO82E,OAEzBA,SACK4f,EAAI20F,aAAarrL,OAItBm7K,EAASzkF,EAAI9+C,OAAOujI,OACpBiN,EAAY1xF,EAAI9+C,OAAOwwI,UACvBF,EAAYxxF,EAAI9+C,OAAOswI,UACvBC,EAAazxF,EAAI9+C,OAAOuwI,WACxBpyL,EAAI0lK,EAAMp/I,KAAKyvJ,eAOnBp1E,EAAIjlL,IAAM,KAIV,SAAA8wF,EAAkB2T,MACbA,SACM4gE,EAAS5gE,MAIfngB,EAAErU,UAAYse,SACR82E,EAAS,KAAM/gF,EAAE8nK,SAAS79J,IAIhC02F,EAAIt0F,UAAY,UACjBs0F,EAAIjlL,IAAM,SAGG,OAAZilL,EAAIjlL,WAEEgqP,EAAMp/I,KAAKg4E,UAAS,YAoEjC,SAAiBvd,MACZ4f,EAAIg0F,MAAM,GAAGrB,eAAiB,UAC/BuB,IACO9zG,QAGL+zG,EAAU,GAAKn0F,EAAIg0F,MAAM,GAAGrB,eAAkB,EAClD3yF,EAAI40F,SAAST,GAAQ,SAAS30K,EAAKk/H,MAC9Bl/H,SACM4gE,EAAS5gE,GAElBwgF,EAAIiyF,QAAQvzC,GACZw1C,IACA9zG,OAhFIy0G,CAAQhpL,UAKR6yI,EAAQ+lC,EAAOzkF,EAAIjlL,IAAKilL,EAAIsmE,MAChCtmE,EAAIt0F,WAAagzI,EAAM1zJ,OACvBqU,EAAEi2K,SAAS52B,GAGX1+C,EAAIjlL,IAAMy2Q,EAAU/M,EAAOzkF,EAAIjlL,IAAK22Q,EAAU1xF,EAAIsmE,QAClDtmE,EAAIsmE,KAAOmrB,EAAWhN,EAAOzkF,EAAIjlL,IAAKilL,EAAIsmE,OAE1CvB,EAAMp/I,KAAKuzJ,aAAartK,GAjC1BA,IA4CFm0F,EAAI20F,aAAe,SAASrrL,OAEtBm7K,EAASzkF,EAAI9+C,OAAOujI,OACpBiN,EAAY1xF,EAAI9+C,OAAOwwI,UACvBF,EAAYxxF,EAAI9+C,OAAOswI,UACvBC,EAAazxF,EAAI9+C,OAAOuwI,WAO5BzxF,EAAIjlL,IAAM,aAENskF,EAAI0lK,EAAMp/I,KAAKyvJ,eACb/1K,EAAErU,SAAWse,GAAAA,CAEd02F,EAAIt0F,UAAY,UACjBs0F,EAAIjlL,IAAM,MAGG,OAAZilL,EAAIjlL,KACLk5Q,QAIEv1C,EAAQ+lC,EAAOzkF,EAAIjlL,IAAKilL,EAAIsmE,MAChCtmE,EAAIt0F,WAAagzI,EAAM1zJ,OACvBqU,EAAEi2K,SAAS52B,GAGX1+C,EAAIjlL,IAAMy2Q,EAAU/M,EAAOzkF,EAAIjlL,IAAK22Q,EAAU1xF,EAAIsmE,QAClDtmE,EAAIsmE,KAAOmrB,EAAWhN,EAAOzkF,EAAIjlL,IAAKilL,EAAIsmE,cAGrCjnK,EAAE8nK,SAAS79J,IAwJjBuoL,GAED7xF,EAAI40F,SAAW,SAAST,EAAQ/zG,GAC9ByxG,EAAQiD,YAAYX,GAAQ,SAAS30K,EAAKk/H,MACrCl/H,SACM4gE,EAAS5gE,GAElB4gE,EAAS,KAAMs+D,EAAMv6H,gBAIzB67E,EAAIo0F,aAAe,SAASD,UACnBtC,EAAQiD,YAAYX,GAAQhwK,cAGrC67E,EAAI40F,SAAW,SAAST,EAAQ/zG,OAE5BA,EAAS,KAAMm0G,EAAgBJ,UACzBr6Q,GACNsmK,EAAStmK,KAGbkmL,EAAIo0F,aAAeG,GAQrBv0F,EAAIiyF,QAAU,SAASvzC,WAEjBp1I,EAAQo1I,EAAM1zJ,OACVkC,EAAI,EAAGA,EAAIoc,IAASpc,EAC1B8yG,EAAIg0F,MAAMh0F,EAAIwpE,MAAM9tF,OAAOgjE,EAAM9yJ,OAAOsB,EAAG,IAC3C8yG,EAAIwpE,KAAqB,KAAbxpE,EAAIwpE,KAAe,EAAIxpE,EAAIwpE,KAAO,GAUlDxpE,EAAI+xF,WAAa,SAAS7kM,EAAGlzE,WACvB0kO,EAAQ,GACJ/qH,EAAI,EAAGA,EAAI35G,EAAG25G,GAAK,EACzB+qH,GAAStyJ,OAAO67C,aAAc/6C,GAAKymC,EAAK,KAE1CqsE,EAAIiyF,QAAQvzC,IAWd1+C,EAAI+0F,eAAiB,SAASjT,MAEzBA,IAAWz8J,KACZ26E,EAAI40F,SAAW,SAAST,EAAQ/zG,GAQ9B/6D,KAAK4mE,iBAAiB,WAPtB,SAAA4mC,EAAkB/4M,OACZ24J,EAAO34J,EAAE24J,KACVA,EAAKsyF,OAAStyF,EAAKsyF,MAAMwsB,OAC1BlsK,KAAK+nE,oBAAoB,UAAWylC,GACpCzyC,EAAS3N,EAAKsyF,MAAMwsB,KAAK/xK,IAAKizD,EAAKsyF,MAAMwsB,KAAK7yC,WAIlDr5H,KAAK8zJ,YAAAA,CAAapU,MAAAA,CAAQwsB,KAAAA,CAAO4C,OAAQA,YAa3CrS,EAAO71F,iBAAiB,WATT,SAASnyK,OAClB24J,EAAO34J,EAAE24J,KACVA,EAAKsyF,OAAStyF,EAAKsyF,MAAMwsB,MAC1BvxF,EAAI40F,SAASniH,EAAKsyF,MAAMwsB,KAAK4C,QAAQ,SAAS30K,EAAKk/H,GACjDojC,EAAO3I,YAAAA,CAAapU,MAAAA,CAAQwsB,KAAAA,CAAO/xK,IAAKA,EAAKk/H,MAAOA,cASvD1+C,kGCvZT,IAAA+kE,EAAAzrP,EAAA,WACAA,EAAA,UAEA,IAAA07Q,EAAA,CACA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IACA,IAAA,IAAA,GAAA,IAAA,GAAA,IAAA,GAAA,IAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IACA,GAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,EAAA,IAAA,IAAA,GACA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,GAAA,GAAA,GAAA,IAAA,GAAA,IACA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,GAAA,IAAA,GAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IACA,GAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,GAAA,IAAA,GAAA,IAAA,GACA,IAAA,IAAA,GAAA,IAAA,GAAA,IAAA,EAAA,GAAA,GAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,EACA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,EAAA,IAAA,IAAA,GAAA,IAAA,IAAA,GAAA,IACA,EAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,GACA,IAAA,GAAA,IAAA,IAAA,GAAA,GAAA,GAAA,IAAA,GAAA,IAAA,IAAA,GAAA,EAAA,GAAA,IAAA,IACA,IAAA,IAAA,GAAA,IAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GACA,IAAA,IAAA,GAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,IAAA,GACA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IACA,IAAA,EAAA,IAAA,IAAA,IAAA,IAAA,IAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,IAAA,IACA,GAAA,GAAA,GAAA,GAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,GAAA,IAAA,IAAA,IAAA,GACA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,KAGA/yL,EAAA,CAAA,EAAA,EAAA,EAAA,GAYAgzL,EAAA,SAAA1sJ,EAAA43G,GACA,OAAA53G,GAAA43G,EAAA,OAAA,MAAA53G,IAAA,GAAA43G,GAaA+0C,EAAA,SAAA3sJ,EAAA43G,GACA,OAAA,MAAA53G,IAAA43G,EAAA53G,GAAA,GAAA43G,EAAA,OAIA/mO,EAAAC,QAAA0rP,EAAAghB,IAAAhhB,EAAAghB,KAAA,GASAhhB,EAAAghB,IAAAoP,UAAA,SAAAp6Q,EAAAq6Q,GACA,iBAAAr6Q,IACAA,EAAAgqP,EAAAp/I,KAAAyvJ,aAAAr6P,IAEAq6Q,EAAAA,GAAA,IAGA,IAKAloM,EALAq+I,EAAAxwN,EACA2wN,EAAA3wN,EAAAiwE,SACAqqM,EAAAD,EACAE,EAAA3pM,KAAAwhL,KAAAkoB,EAAA,GACAE,EAAA,MAAA,EAAAF,GAGA,IAAAnoM,EAAAw+I,EAAAx+I,EAAA,IAAAA,IACAq+I,EAAAgqC,QAAAyf,EAAAzpD,EAAAp9G,GAAAjhC,EAAA,GAAAq+I,EAAAp9G,GAAAjhC,EAAAw+I,GAAA,MAKA,IAFAH,EAAAyvC,MAAA,IAAAsa,EAAAN,EAAAzpD,EAAAp9G,GAAA,IAAAmnK,GAAAC,IAEAroM,EAAA,IAAAooM,EAAApoM,GAAA,EAAAA,IACAq+I,EAAAyvC,MAAA9tL,EAAA8nM,EAAAzpD,EAAAp9G,GAAAjhC,EAAA,GAAAq+I,EAAAp9G,GAAAjhC,EAAAooM,KAGA,OAAA/pD,GAYA,IAAAy+C,EAAA,SAAAjvQ,EAAAolO,EAAAsnC,GACA,IACA+N,EAAAC,EACAvoM,EAAAmqB,EAFA+yK,GAAA,EAAAC,EAAA,KAAAqL,EAAA,KAAArK,EAAA,KAEAsK,EAAA,GAIA,IADA56Q,EAAAgqP,EAAAghB,IAAAoP,UAAAp6Q,EAAAolO,GACAjzJ,EAAA,EAAAA,EAAA,GAAAA,IACAyoM,EAAA9kM,KAAA91E,EAAA8/P,cAGA4M,GAMA+N,EAAA,SAAAjrD,GACA,IAAAr9I,EAAA,EAAAA,EAAA,EAAAA,IACAq9I,EAAAr9I,IAAAyoM,EAAAt+K,IAAAkzH,GAAAr9I,EAAA,GAAA,GAAAq9I,GAAAr9I,EAAA,GAAA,MACAq9I,GAAAr9I,EAAA,GAAA,GAAAq9I,GAAAr9I,EAAA,GAAA,IACAq9I,EAAAr9I,GAAA+nM,EAAA1qD,EAAAr9I,GAAA+U,EAAA/U,IACAmqB,KASAo+K,EAAA,SAAAlrD,GACA,IAAAr9I,EAAA,EAAAA,EAAA,EAAAA,IACAq9I,EAAAr9I,IAAAyoM,EAAA,GAAAprD,GAAAr9I,EAAA,GAAA,OASAsoM,EAAA,SAAAjrD,GACA,IAAAr9I,EAAA,EAAAA,GAAA,EAAAA,IACAq9I,EAAAr9I,GAAAgoM,EAAA3qD,EAAAr9I,GAAA+U,EAAA/U,IACAq9I,EAAAr9I,IAAAyoM,EAAAt+K,IAAAkzH,GAAAr9I,EAAA,GAAA,GAAAq9I,GAAAr9I,EAAA,GAAA,MACAq9I,GAAAr9I,EAAA,GAAA,GAAAq9I,GAAAr9I,EAAA,GAAA,IACAmqB,KASAo+K,EAAA,SAAAlrD,GACA,IAAAr9I,EAAA,EAAAA,GAAA,EAAAA,IACAq9I,EAAAr9I,IAAAyoM,EAAA,GAAAprD,GAAAr9I,EAAA,GAAA,MAkBA,IAAA0oM,EAAA,SAAAC,GACA,IAAAtrD,EAAA,GAGA,IAAAr9I,EAAA,EAAAA,EAAA,EAAAA,IAAA,CACA,IAAAwyB,EAAA2qK,EAAAxP,aAEA,OAAAwQ,IACA5D,EAEA/nK,GAAA2rK,EAAAxQ,aAGAwQ,EAAA9Q,WAAA76J,IAIA6qH,EAAA15I,KAAA,MAAA6uB,GAIArI,EAAAowK,EAAA,EAAA,GAGA,IAAA,IAAAqO,EAAA,EAAAA,EAAAD,EAAA7qM,OAAA8qM,IACA,IAAA,IAAAxN,EAAA,EAAAA,EAAAuN,EAAAC,GAAA,GAAAxN,IACAuN,EAAAC,GAAA,GAAAvrD,GAKA,IAAAr9I,EAAA,EAAAA,EAAA,EAAAA,IACA,OAAAm+L,IACA5D,EAGA4D,EAAA9Q,WAAAhwC,EAAAr9I,IAEAq9I,EAAAr9I,IAAAm+L,EAAAxQ,cAIA6a,EAAAnb,WAAAhwC,EAAAr9I,KAKAu3L,EAAA,KAuGA,OAtGAA,EAAA,CAWA1pL,MAAA,SAAAypL,EAAA3/B,GACA2/B,GAEA,iBAAAA,IACAA,EAAAzf,EAAAp/I,KAAAyvJ,aAAAoP,IAIA4F,GAAA,EACAC,EAAAtlB,EAAAp/I,KAAAyvJ,eACAsgB,EAAA7wC,GAAA,IAAAkgB,EAAAp/I,KAAAyvJ,aACAiW,EAAA7G,EAEAC,EAAA5/B,OAAA6wC,GAQAh6G,OAAA,SAAA3mE,GAMA,IALAq1K,GAEAC,EAAA7U,UAAAzgK,GAGAs1K,EAAAr/L,UAAA,GACA4qM,EAAA,CACA,CAAA,EAAAJ,GACA,CAAA,EAAAC,GACA,CAAA,EAAAD,GACA,CAAA,EAAAC,GACA,CAAA,EAAAD,MAaAh2C,OAAA,SAAAz/H,GACA,IAAAo3J,GAAA,EAEA,GAAAsQ,EACA,GAAA1nK,EACAo3J,EAAAp3J,EAAA,EAAAsqK,GAAA5C,OACA,CAGA,IAAA0D,EAAA,IAAAd,EAAAr/L,SAAA,EAAA,EAAAq/L,EAAAr/L,SACAq/L,EAAAnQ,aAAAiR,EAAAA,GAUA,GANAhU,IAEAiT,GAAA,EACA3F,EAAA/oG,WAGA+rG,IAEAtQ,EAAA,IAAAkT,EAAAr/L,UAEA,GAAA+0B,EACAo3J,EAAAp3J,EAAA,EAAA21K,GAAAjO,OACA,CAEA,IAAAt+J,EAAAusK,EAAA1qM,SACAse,EAAAosL,EAAAvnK,GAAAhF,EAAA,GAEA7f,EAAA6f,EACAguJ,GAAA,EAGAue,EAAAxa,SAAA5xK,GAMA,OAAA6tK,KAqBApS,EAAAghB,IAAAqB,gBAAA,SAAArsQ,EAAAypQ,EAAA3/B,GACA,IAAA4/B,EAAA1f,EAAAghB,IAAA5B,uBAAAppQ,EAAA,KAEA,OADA0pQ,EAAA1pL,MAAAypL,EAAA3/B,GACA4/B,GAgBA1f,EAAAghB,IAAA5B,uBAAA,SAAAppQ,EAAAolO,GACA,OAAA6pC,EAAAjvQ,EAAAolO,GAAA,IAiBA4kB,EAAAghB,IAAAiB,gBAAA,SAAAjsQ,EAAAypQ,EAAA3/B,GACA,IAAA4/B,EAAA1f,EAAAghB,IAAAD,uBAAA/qQ,EAAA,KAEA,OADA0pQ,EAAA1pL,MAAAypL,EAAA3/B,GACA4/B,GAgBA1f,EAAAghB,IAAAD,uBAAA,SAAA/qQ,EAAAolO,GACA,OAAA6pC,EAAAjvQ,EAAAolO,GAAA,oECzVA,IAAA4kB,EAAAzrP,EAAA,WASA,GARAA,EAAA,UACAA,EAAA,UACAA,EAAA,UACAA,EAAA,WACAA,EAAA,WACAA,EAAA,YACAA,EAAA,eAEA,IAAAopQ,EACA,IAAAA,EAAA3d,EAAA4d,KAAAD,WAGA,IAAAmP,EAAA9sB,EAAAp/I,KAAA4zJ,SAAAjgQ,EAAA,UAAA,KAGA0tP,EAAAjC,EAAAiC,KAGArhJ,EAAAo/I,EAAAp/I,KAKAo/I,EAAA8B,IAAA9B,EAAA8B,KAAA,GACAztP,EAAAC,QAAA0rP,EAAA8B,IAAA1B,IAAAJ,EAAAI,IAAAJ,EAAAI,KAAA,GACA,IAAA0B,EAAA9B,EAAA8B,IAGAkvB,EAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAGAC,EAAA,CAEAp9Q,KAAA,iBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CAEAb,KAAA,yBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,qBACA,CAEAn/P,KAAA,qCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,gCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,mBAEA,CAEAn/P,KAAA,iBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA+M,YACAkB,aAAA,EACAmE,QAAA,gBAKAke,EAAA,CAEAr9Q,KAAA,gBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CAEAb,KAAA,wBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,qBACA,CAEAn/P,KAAA,wBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,qBACA,CAEAn/P,KAAA,+BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,4BACA,CAEAn/P,KAAA,gCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,6BACA,CAEAn/P,KAAA,uBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,oBACA,CAEAn/P,KAAA,uBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,oBACA,CAEAn/P,KAAA,0BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,uBACA,CAEAn/P,KAAA,0BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,uBACA,CAEAn/P,KAAA,4BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,2BAKAme,EAAA,CAEAt9Q,KAAA,eACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CAEAb,KAAA,uBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,oBACA,CAEAn/P,KAAA,wBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,uBAMAoe,EAAApxB,EAAA8B,IAAA1B,IAAAgxB,mBAAA,CACAv9Q,KAAA,uBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAoE,YAAA,uBACAv+P,MAAA,CAAA,CACAb,KAAA,2CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,gCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,kBAEA,CAEAn/P,KAAA,wCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA8M,UACAmB,aAAA,EACAn6P,MAAA,CAAA,CAEAb,KAAA,qDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAjuH,UAAA,EACAqyH,YAAA,oBAsBAoe,EAAA,SAAApT,GAEA,IAAApN,EACA,KAAAoN,EAAAM,aAAAzc,EAAA2R,MAEA,CACA,IAAAljL,EAAA,IAAAupB,MAAA,qCAEA,MADAvpB,EAAAguL,UAAAN,EAAAM,UACAhuL,EAJAsgL,EAAA/O,EAAA2R,KAAAwK,EAAAM,WAMA,IAAA+S,EAAArvB,EAAA2O,SAAAC,GAAAzO,WAGAmvB,EAAAtvB,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,IACAmjB,EAAAvvB,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,IACAmjB,EAAA98Q,MAAAo3E,KAAAm2K,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EAAAyjB,IACAE,EAAA98Q,MAAAo3E,KAAAm2K,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAgN,MAAA,EAAA,KACA,IAAA1zB,EAAA+nB,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aACA,EAAAsQ,EAAA/jC,SAAAkoB,YAKA,OAJAmvB,EAAA78Q,MAAAo3E,KAAA0lM,GACAD,EAAA78Q,MAAAo3E,KAAAouJ,GAGA+nB,EAAAC,MAAAqvB,GAAAnvB,YAYAqvB,EAAA,SAAA7iK,EAAA54G,EAAAqmO,GACA,GAAAA,EACA,OAAAztH,EAAA8iK,OAAA17Q,EAAAjB,EAAAiB,EAAAf,GAGA,IAAAe,EAAAkyE,IAAAlyE,EAAAs5G,EAEA,OAAAV,EAAA8iK,OAAA17Q,EAAA4oI,EAAA5oI,EAAAf,GAiGA,IAAA+5G,EA7FAh5G,EAAA27Q,KACA37Q,EAAA27Q,GAAA37Q,EAAA4oI,EAAA0kB,IAAAttJ,EAAAkyE,EAAA0pM,SAAAjU,EAAAkU,OAEA77Q,EAAA87Q,KACA97Q,EAAA87Q,GAAA97Q,EAAA4oI,EAAA0kB,IAAAttJ,EAAAs5G,EAAAsiK,SAAAjU,EAAAkU,OAEA77Q,EAAA+7Q,OACA/7Q,EAAA+7Q,KAAA/7Q,EAAAs5G,EAAA0iK,WAAAh8Q,EAAAkyE,IAuFA,GACA8mC,EAAA,IAAA2uJ,EACA3d,EAAAp/I,KAAA8yJ,WAAA1T,EAAA5wI,OAAAgzI,SAAApsP,EAAAf,EAAAg9Q,YAAA,IACA,UACAjjK,EAAAkjK,UAAAl8Q,EAAAf,IAAA,IAAA+5G,EAAAmjK,IAAAn8Q,EAAAf,GAAA+lO,OAAA2iC,EAAAkU,MAQA,IAJA,IAAAO,GAHAxjK,EAAAA,EAAAi5J,SAAA74J,EAAA0iK,OAAA17Q,EAAAjB,EAAAiB,EAAAf,IAAAquJ,IAAAttJ,EAAAf,IAGAquJ,IAAAttJ,EAAAkyE,GAAAwpM,OAAA17Q,EAAA27Q,GAAA37Q,EAAAkyE,GACAmqM,EAAAzjK,EAAA00C,IAAAttJ,EAAAs5G,GAAAoiK,OAAA17Q,EAAA87Q,GAAA97Q,EAAAs5G,GAGA8iK,EAAAF,UAAAG,GAAA,GACAD,EAAAA,EAAApyL,IAAAhqF,EAAAkyE,GAIA,IAAA2mC,EAAAujK,EAAAR,SAAAS,GACAxK,SAAA7xQ,EAAA+7Q,MAAAzuH,IAAAttJ,EAAAkyE,GACA2/L,SAAA7xQ,EAAAs5G,GAAAtvB,IAAAqyL,GAKA,OAFAxjK,EAAAA,EAAAg5J,SAAA74J,EAAAgjK,WAAAh8Q,EAAAf,IAAAquJ,IAAAttJ,EAAAf,IAo/BA,SAAAq9Q,EAAApyL,EAAAlqF,EAAAu8Q,GACA,IAAAC,EAAAxyB,EAAAp/I,KAAAyvJ,eAGAh7P,EAAAuxE,KAAAwhL,KAAApyP,EAAAf,EAAAg9Q,YAAA,GAGA,GAAA/xL,EAAAja,OAAA5wE,EAAA,GAAA,CACA,IAAAk7E,EAAA,IAAAupB,MAAA,gDAGA,MAFAvpB,EAAAtK,OAAAia,EAAAja,OACAsK,EAAA5J,IAAAtxE,EAAA,GACAk7E,EAoBAiiM,EAAAhiB,QAAA,GACAgiB,EAAAhiB,QAAA+hB,GAGA,IACAE,EADAC,EAAAr9Q,EAAA,EAAA6qF,EAAAja,OAGA,GAAA,IAAAssM,GAAA,IAAAA,EAAA,CACAE,EAAA,IAAAF,EAAA,EAAA,IACA,IAAA,IAAApqM,EAAA,EAAAA,EAAAuqM,IAAAvqM,EACAqqM,EAAAhiB,QAAAiiB,QAKA,KAAAC,EAAA,GAAA,CACA,IAAAC,EAAA,EACAC,EAAA5yB,EAAA5wI,OAAAgzI,SAAAswB,GACA,IAAAvqM,EAAA,EAAAA,EAAAuqM,IAAAvqM,EAEA,KADAsqM,EAAAG,EAAA35L,WAAA9Q,MAEAwqM,EAEAH,EAAAhiB,QAAAiiB,GAGAC,EAAAC,EAQA,OAHAH,EAAAhiB,QAAA,GACAgiB,EAAAjiB,SAAArwK,GAEAsyL,EAaA,SAAAK,EAAAC,EAAA98Q,EAAAqmO,EAAA02C,GAEA,IAAA19Q,EAAAuxE,KAAAwhL,KAAApyP,EAAAf,EAAAg9Q,YAAA,GAaAO,EAAAxyB,EAAAp/I,KAAAyvJ,aAAAyiB,GACAj5L,EAAA24L,EAAAljB,UACAijB,EAAAC,EAAAljB,UACA,GAAA,IAAAz1K,GACAwiJ,GAAA,IAAAk2C,GAAA,IAAAA,IACAl2C,GAAA,GAAAk2C,GACAl2C,GAAA,IAAAk2C,QAAA,IAAA,EACA,MAAA,IAAAz4K,MAAA,gCAGA,IAAA44K,EAAA,EACA,GAAA,IAAAH,EAAA,CAEAG,EAAAr9Q,EAAA,EAAA09Q,EACA,IAAA,IAAA5qM,EAAA,EAAAA,EAAAuqM,IAAAvqM,EACA,GAAA,IAAAqqM,EAAAljB,UACA,MAAA,IAAAx1J,MAAA,qCAGA,GAAA,IAAAy4K,EAGA,IADAG,EAAA,EACAF,EAAAvsM,SAAA,GAAA,CACA,GAAA,MAAAusM,EAAAljB,UAAA,GACAkjB,EAAAxgD,KACA,QAEA0gD,OAEA,GAAA,IAAAH,EAGA,IADAG,EAAA,EACAF,EAAAvsM,SAAA,GAAA,CACA,GAAA,IAAAusM,EAAAljB,UAAA,GACAkjB,EAAAxgD,KACA,QAEA0gD,EAMA,GAAA,IADAF,EAAAljB,WACAojB,IAAAr9Q,EAAA,EAAAm9Q,EAAAvsM,SACA,MAAA,IAAA6zB,MAAA,gCAGA,OAAA04K,EAAApwB,WAiBA,SAAA4wB,EAAAlpJ,EAAAn0H,EAAA0lK,GACA,mBAAA1lK,IACA0lK,EAAA1lK,EACAA,EAAA,IAIA,IAAAosK,EAAA,CACAw8F,UAAA,CACA1qQ,MAJA8B,EAAAA,GAAA,IAIA4oQ,WAAA,WACA5oQ,QAAA,CACAknQ,QAAAlnQ,EAAAknQ,SAAA,EACAoW,SAAAt9Q,EAAAs9Q,UAAA,IACAC,aAAAv9Q,EAAAu9Q,gBAUA,SAAApsL,IAEAqsL,EAAArpJ,EAAAspJ,OAAA,SAAA34K,EAAAiY,GACA,OAAAjY,EACA4gE,EAAA5gE,IAEAqvB,EAAA5hD,EAAAwqC,EACA,OAAAoX,EAAAxa,EACAmrH,EAAAhgI,EAAAqvB,EAAAxa,QAEA6jK,EAAArpJ,EAAAupJ,MAAA54C,OAIA,SAAA04C,EAAA/3C,EAAA//D,GACA2kF,EAAA5wH,MAAAkkJ,sBAAAl4C,EAAAr5D,EAAA1G,GAGA,SAAAo/D,EAAAhgI,EAAAiY,GACA,GAAAjY,EACA,OAAA4gE,EAAA5gE,GAOA,GAHAqvB,EAAAxa,EAAAoD,EAGAoX,EAAA5hD,EAAAgqM,UAAApoJ,EAAAxa,GAAA,EAAA,CACA,IAAAlT,EAAA0tB,EAAA5hD,EACA4hD,EAAA5hD,EAAA4hD,EAAAxa,EACAwa,EAAAxa,EAAAlT,EAIA,GACA,IADA0tB,EAAA5hD,EAAA0pM,SAAAjU,EAAAkU,KAAAM,IAAAroJ,EAAA/0H,GACAm9Q,UAAAvU,EAAAkU,KAGA,OAFA/nJ,EAAA5hD,EAAA,UACA4e,IAKA,GACA,IADAgjC,EAAAxa,EAAAsiK,SAAAjU,EAAAkU,KAAAM,IAAAroJ,EAAA/0H,GACAm9Q,UAAAvU,EAAAkU,KAGA,OAFA/nJ,EAAAxa,EAAA,UACA6jK,EAAArpJ,EAAAupJ,MAAA54C,GAUA,GALA3wG,EAAA1tC,GAAA0tC,EAAA5hD,EAAA0pM,SAAAjU,EAAAkU,KACA/nJ,EAAAypJ,GAAAzpJ,EAAAxa,EAAAsiK,SAAAjU,EAAAkU,KACA/nJ,EAAA2D,IAAA3D,EAAA1tC,GAAAyrL,SAAA/9I,EAAAypJ,IAGA,IAAAzpJ,EAAA2D,IAAA0kJ,IAAAroJ,EAAA/0H,GAAAm9Q,UAAAvU,EAAAkU,KAIA,OAFA/nJ,EAAA5hD,EAAA4hD,EAAAxa,EAAA,UACAxoB,IAMA,GADAgjC,EAAA70H,EAAA60H,EAAA5hD,EAAA2/L,SAAA/9I,EAAAxa,GACAwa,EAAA70H,EAAAg9Q,cAAAnoJ,EAAAsxG,KAIA,OAFAtxG,EAAAxa,EAAA,UACA6jK,EAAArpJ,EAAAupJ,MAAA54C,GAKA,IAAA77F,EAAA9U,EAAA/0H,EAAAi9Q,WAAAloJ,EAAA2D,KACA3D,EAAA30H,KAAA,CACAq+Q,WAAA1xB,EAAA1B,IAAAqzB,cACA3pJ,EAAA70H,EAAA60H,EAAA/0H,EAAA6pI,EAAA9U,EAAA5hD,EAAA4hD,EAAAxa,EACAsvB,EAAA0kB,IAAAx5B,EAAA1tC,IAAAwiD,EAAA0kB,IAAAx5B,EAAAypJ,IACAzpJ,EAAAxa,EAAA0iK,WAAAloJ,EAAA5hD,IACAwrM,UAAA5xB,EAAA1B,IAAAuzB,aAAA7pJ,EAAA70H,EAAA60H,EAAA/0H,IAGAsmK,EAAA,KAAAvxC,EAAA30H,MAvFA,SAAAQ,IACAosK,EAAAyqG,KAAA72Q,EAAA62Q,MAGA1lL,IA8FA,SAAA8sL,EAAAt5L,GAEA,IAAAtT,EAAAsT,EAAA8kB,SAAA,IACAp4B,EAAA,IAAA,MACAA,EAAA,KAAAA,GAEA,IAAA2yJ,EAAAqmB,EAAAp/I,KAAAw2J,WAAApwL,GAGA,OAAA2yJ,EAAA1zJ,OAAA,IAEA,IAAA0zJ,EAAA1gJ,WAAA,IACA,IAAA,IAAA0gJ,EAAA1gJ,WAAA,KAEA,MAAA0gJ,EAAA1gJ,WAAA,IACA,MAAA,IAAA0gJ,EAAA1gJ,WAAA,KACA0gJ,EAAA9yJ,OAAA,GAEA8yJ,EAaA,SAAAk6C,EAAAz4C,GACA,OAAAA,GAAA,IAAA,GACAA,GAAA,IAAA,GACAA,GAAA,IAAA,GACAA,GAAA,IAAA,GACAA,GAAA,IAAA,EACAA,GAAA,IAAA,EACAA,GAAA,IAAA,EACAA,GAAA,IAAA,EACAA,GAAA,IAAA,EACAA,GAAA,IAAA,EACAA,GAAA,KAAA,EACA,EAUA,SAAA04C,EAAAluL,GACA,OAAAo6J,EAAAp/I,KAAA4zJ,UAAA,mBAAAsY,EAAAlnL,GAUA,SAAAmuL,EAAAnuL,GACA,YAAA,IAAAgb,EAAA6zJ,aACA,iBAAA7zJ,EAAA6zJ,YAAAzlC,QACA,iBAAApuH,EAAA6zJ,YAAAzlC,OAAAglD,QACA,mBAAApzK,EAAA6zJ,YAAAzlC,OAAAglD,OAAApuL,GAYA,SAAAquL,EAAAruL,GACA,YAAA,IAAAgb,EAAA6zJ,aACA,iBAAA7zJ,EAAA6zJ,YAAAsY,UACA,iBAAAnsK,EAAA6zJ,YAAAsY,SAAAiH,QACA,mBAAApzK,EAAA6zJ,YAAAsY,SAAAiH,OAAApuL,GAGA,SAAAsuL,EAAAtlK,GAGA,IAFA,IAAA+qH,EAAAqmB,EAAAp/I,KAAAw2J,WAAAxoJ,EAAAxP,SAAA,KACAyxG,EAAA,IAAA4oB,WAAAE,EAAA1zJ,QACAkC,EAAA,EAAAA,EAAAwxJ,EAAA1zJ,SAAAkC,EACA0oI,EAAA1oI,GAAAwxJ,EAAA1gJ,WAAA9Q,GAEA,OAAA0oI,EAp0CAixC,EAAA1B,IAAAsiB,QAAA,SAAAxiL,EAAAlqF,EAAAu8Q,GACA,IACAC,EADAn2C,EAAAk2C,EAIAl9Q,EAAAuxE,KAAAwhL,KAAApyP,EAAAf,EAAAg9Q,YAAA,IAEA,IAAAM,IAAA,IAAAA,GAEAl2C,EAAA,IAAAk2C,EACAC,EAAAF,EAAApyL,EAAAlqF,EAAAu8Q,KAEAC,EAAAxyB,EAAAp/I,KAAAyvJ,gBACAE,SAAArwK,GAgBA,IAXA,IAAA0uB,EAAA,IAAA+uJ,EAAA6U,EAAApc,QAAA,IAQA+d,EALA1C,EAAA7iK,EAAA54G,EAAAqmO,GAKAj9H,SAAA,IACAg1K,EAAAp0B,EAAAp/I,KAAAyvJ,eACAsL,EAAAtmQ,EAAAuxE,KAAAwhL,KAAA+rB,EAAAluM,OAAA,GACA01L,EAAA,GACAyY,EAAA5jB,QAAA,KACAmL,EAGA,OADAyY,EAAA7jB,SAAAvQ,EAAAp/I,KAAAw2J,WAAA+c,IACAC,EAAAhyB,YAqBAN,EAAA1B,IAAAmiB,QAAA,SAAA6R,EAAAp+Q,EAAAqmO,EAAA02C,GAEA,IAAA19Q,EAAAuxE,KAAAwhL,KAAApyP,EAAAf,EAAAg9Q,YAAA,GAGA,GAAAmC,EAAAnuM,SAAA5wE,EAAA,CACA,IAAAk7E,EAAA,IAAAupB,MAAA,wCAGA,MAFAvpB,EAAAtK,OAAAmuM,EAAAnuM,OACAsK,EAAAyH,SAAA3iF,EACAk7E,EAKA,IAAAs+B,EAAA,IAAA8uJ,EAAA3d,EAAAp/I,KAAAyvJ,aAAA+jB,GAAAhe,QAAA,IAIA,GAAAvnJ,EAAAqjK,UAAAl8Q,EAAAf,IAAA,EACA,MAAA,IAAA6kG,MAAA,iCAYA,IARA,IAKAu6K,EALA5C,EAAA5iK,EAAA74G,EAAAqmO,GAKAj9H,SAAA,IACAozK,EAAAxyB,EAAAp/I,KAAAyvJ,eACAsL,EAAAtmQ,EAAAuxE,KAAAwhL,KAAAisB,EAAApuM,OAAA,GACA01L,EAAA,GACA6W,EAAAhiB,QAAA,KACAmL,EAIA,OAFA6W,EAAAjiB,SAAAvQ,EAAAp/I,KAAAw2J,WAAAid,KAEA,IAAAtB,EAEAF,EAAAL,EAAApwB,WAAApsP,EAAAqmO,GAIAm2C,EAAApwB,YAiBAN,EAAA1B,IAAAk0B,6BAAA,SAAAl5C,EAAArmO,EAAAY,GAIA,iBAAA,IACAylO,EAAAh0J,SAAAg0J,EAAA,KAEAA,EAAAA,GAAA,KAIA,IAcAg3B,EAdAoa,GADA72Q,EAAAA,GAAA,IACA62Q,MAAAxsB,EAAA5wI,OACAmlK,EAAA,CAEAC,UAAA,SAAA5lK,GAEA,IADA,IAAAt0B,EAAAkyL,EAAA1N,aAAAlwJ,EAAA3oC,QACAkC,EAAA,EAAAA,EAAAymC,EAAA3oC,SAAAkC,EACAymC,EAAAzmC,GAAAmS,EAAArB,WAAA9Q,KAKAo2L,EAAA5oQ,EAAA4oQ,WAAA,WAIA,GAAA,aAAAA,EAkBA,MAAA,IAAAzkK,MAAA,qCAAAykK,GAGA,OApBAnM,EAAA,CACAmM,UAAAA,EACAz0I,MAAA,EACAsxG,KAAAA,EACAm5C,IAAAA,EACAE,KAAA1/Q,GAAA,MACAA,EAAA,IAAA4oQ,EAAA,MACAz1L,EAAA,KACAonC,EAAA,KACA+jK,MAAAj4C,GAAA,EACAg4C,MAAAh4C,GAAAA,GAAA,GACAs5C,QAAA,EACAhiK,IAAA,KACAv9G,KAAA,OAEAJ,EAAA4/Q,QAAAviB,EAAAqiB,MAKAriB,GAgCAtQ,EAAA1B,IAAAw0B,2BAAA,SAAA9qJ,EAAA70H,GAEA,cAAA60H,IACAA,EAAAy0I,UAAA,YAUA,IAAAsW,EAAA,IAAAlX,EAAA,MACAkX,EAAAF,QAAA,IAQA,IAPA,IAKA/F,EALAkG,EAAA,EACAC,EAAA,SAAAnmK,EAAAC,GAAA,OAAAD,EAAAC,GAGA8/J,GAAA,IAAA5vK,KAEAqxD,EAAA,EACA,OAAAtmC,EAAA30H,OAAAF,GAAA,GAAAm7J,EAAAn7J,IAAA,CAEA,GAAA,IAAA60H,EAAAA,MAAA,CAQA,IAAAsxG,EAAA,OAAAtxG,EAAA5hD,EAAA4hD,EAAAspJ,MAAAtpJ,EAAAupJ,MACA2B,EAAA55C,EAAA,EAGA,IAAAtxG,EAAA4qJ,SACA5qJ,EAAApX,IAAA,IAAAirJ,EAAAviC,EAAAtxG,EAAAyqJ,KAEAzqJ,EAAApX,IAAAuiK,QAAAD,IACAlrJ,EAAApX,IAAAwiK,UACAvX,EAAAkU,IAAAsD,UAAAH,GAAAD,EAAAjrJ,EAAApX,KAGAoX,EAAApX,IAAA0iK,WAAA,GAAAtrJ,EAAApX,IAAA4wC,IAAAuxH,GAAAQ,YAAA,GACAP,EAAA,IAEAhrJ,EAAA4qJ,SACA,IAAA5qJ,EAAA4qJ,QAEA5qJ,EAAApX,IAAAu/J,YAAA72C,EAEAtxG,EAAA4qJ,QAAA,EAEA5qJ,EAAApX,IAAA4iK,gBACAzB,EAAA/pJ,EAAApX,IAAAu/J,gBACAnoJ,EAAA4qJ,QAGA5qJ,EAAApX,IAAA0iK,WAAApE,EAAA8D,IAAA,GAAA,GAEA,IAAAhrJ,EAAA4qJ,QAEA5qJ,EAAA4qJ,QAEA,IADA5qJ,EAAApX,IAAAk/J,SAAAjU,EAAAkU,KAAAM,IAAAroJ,EAAA/0H,GACAm9Q,UAAAvU,EAAAkU,KAAA,EAAA,EACA,IAAA/nJ,EAAA4qJ,UAEA5qJ,EAAA4qJ,QAAA,EACA,OAAA5qJ,EAAA5hD,EACA4hD,EAAA5hD,EAAA4hD,EAAApX,IAEAoX,EAAAxa,EAAAwa,EAAApX,IAIA,OAAAoX,EAAA5hD,GAAA,OAAA4hD,EAAAxa,KACAwa,EAAAA,MAEAA,EAAApX,IAAA,WAEA,GAAA,IAAAoX,EAAAA,MAEAA,EAAA5hD,EAAAgqM,UAAApoJ,EAAAxa,GAAA,IACAwa,EAAApX,IAAAoX,EAAA5hD,EACA4hD,EAAA5hD,EAAA4hD,EAAAxa,EACAwa,EAAAxa,EAAAwa,EAAApX,OAEAoX,EAAAA,WACA,GAAA,IAAAA,EAAAA,MAEAA,EAAA1tC,GAAA0tC,EAAA5hD,EAAA0pM,SAAAjU,EAAAkU,KACA/nJ,EAAAypJ,GAAAzpJ,EAAAxa,EAAAsiK,SAAAjU,EAAAkU,KACA/nJ,EAAA2D,IAAA3D,EAAA1tC,GAAAyrL,SAAA/9I,EAAAypJ,MACAzpJ,EAAAA,WACA,GAAA,IAAAA,EAAAA,MAEA,IAAAA,EAAA2D,IAAA0kJ,IAAAroJ,EAAA/0H,GAAAm9Q,UAAAvU,EAAAkU,OAEA/nJ,EAAAA,OAGAA,EAAA5hD,EAAA,KACA4hD,EAAAxa,EAAA,KACAwa,EAAAA,MAAA,QAEA,GAAA,IAAAA,EAAAA,MAEAA,EAAA70H,EAAA60H,EAAA5hD,EAAA2/L,SAAA/9I,EAAAxa,GAGAwa,EAAA70H,EAAAg9Q,cAAAnoJ,EAAAsxG,OAEAtxG,EAAAA,OAGAA,EAAAxa,EAAA,KACAwa,EAAAA,MAAA,QAEA,GAAA,IAAAA,EAAAA,MAAA,CAEA,IAAA8U,EAAA9U,EAAA/0H,EAAAi9Q,WAAAloJ,EAAA2D,KACA3D,EAAA30H,KAAA,CACAq+Q,WAAA1xB,EAAA1B,IAAAqzB,cACA3pJ,EAAA70H,EAAA60H,EAAA/0H,EAAA6pI,EAAA9U,EAAA5hD,EAAA4hD,EAAAxa,EACAsvB,EAAA0kB,IAAAx5B,EAAA1tC,IAAAwiD,EAAA0kB,IAAAx5B,EAAAypJ,IACAzpJ,EAAAxa,EAAA0iK,WAAAloJ,EAAA5hD,IACAwrM,UAAA5xB,EAAA1B,IAAAuzB,aAAA7pJ,EAAA70H,EAAA60H,EAAA/0H,IAMAq7J,IADAw+G,GAAA,IAAA7vK,MACA4vK,EACAA,EAAAC,EAGA,OAAA,OAAA9kJ,EAAA30H,MAiCA2sP,EAAA1B,IAAA/kB,gBAAA,SAAAD,EAAArmO,EAAAY,EAAA0lK,GAgDA,GA9CA,IAAAhkF,UAAApR,OACA,iBAAAm1J,GACAzlO,EAAAylO,EACAA,OAAA1kO,GACA,mBAAA0kO,IACA//D,EAAA+/D,EACAA,OAAA1kO,GAEA,IAAA2gF,UAAApR,OAEA,iBAAAm1J,EACA,mBAAArmO,GACAsmK,EAAAtmK,EACAA,OAAA2B,GACA,iBAAA3B,IACAY,EAAAZ,EACAA,OAAA2B,IAGAf,EAAAylO,EACA//D,EAAAtmK,EACAqmO,OAAA1kO,EACA3B,OAAA2B,GAEA,IAAA2gF,UAAApR,SAEA,iBAAAlxE,EACA,mBAAAY,IACA0lK,EAAA1lK,EACAA,OAAAe,IAGA2kK,EAAA1lK,EACAA,EAAAZ,EACAA,OAAA2B,IAGAf,EAAAA,GAAA,QACAe,IAAA0kO,IACAA,EAAAzlO,EAAAylO,MAAA,WAEA1kO,IAAA3B,IACAA,EAAAY,EAAAZ,GAAA,QAIAirP,EAAArqP,QAAAi+P,oBAAAj+P,EAAA62Q,MACApxC,GAAA,KAAAA,GAAA,QAAA,QAAArmO,GAAA,IAAAA,GACA,GAAAsmK,EAAA,CAEA,GAAAy4G,EAAA,mBACA,OAAAhH,EAAAzxC,gBAAA,MAAA,CACAk6C,cAAAn6C,EACAo6C,eAAAzgR,EACA0gR,kBAAA,CACA3tM,KAAA,OACAkwJ,OAAA,OAEA09C,mBAAA,CACA5tM,KAAA,QACAkwJ,OAAA,SAEA,SAAAv9H,EAAA4hI,EAAAs5C,GACA,GAAAl7K,EACA,OAAA4gE,EAAA5gE,GAEA4gE,EAAA,KAAA,CACAm4G,WAAA1xB,EAAA8zB,kBAAAD,GACAjC,UAAA5xB,EAAA+zB,iBAAAx5C,QAIA,GAAA03C,EAAA,gBACAA,EAAA,aAEA,OAAAnzK,EAAA6zJ,YAAAzlC,OAAAglD,OAAA8B,YAAA,CACAjiR,KAAA,oBACA0hR,cAAAn6C,EACAo6C,eAAAtB,EAAAn/Q,GACAs/G,KAAA,CAAAxgH,KAAA,aACA,EAAA,CAAA,OAAA,WACAorG,MAAA,SAAA82K,GACA,OAAAn1K,EAAA6zJ,YAAAzlC,OAAAglD,OAAAgC,UACA,QAAAD,EAAAvC,eAEAv0K,UAAAvoG,GAAA,SAAA+jG,GACA4gE,EAAA5gE,MACAwE,MAAA,SAAAg3K,GACA,GAAAA,EAAA,CACA,IAAAzC,EAAA1xB,EAAAmf,mBACAhf,EAAAmO,QAAApQ,EAAAp/I,KAAAyvJ,aAAA4lB,KACA56G,EAAA,KAAA,CACAm4G,WAAAA,EACAE,UAAA5xB,EAAAo0B,gBAAA1C,EAAAv+Q,EAAAu+Q,EAAAz+Q,SAKA,GAAAk/Q,EAAA,gBACAA,EAAA,aAAA,CACA,IAAAkC,EAAAv1K,EAAA6zJ,YAAAsY,SAAAiH,OAAA8B,YAAA,CACAjiR,KAAA,oBACA0hR,cAAAn6C,EACAo6C,eAAAtB,EAAAn/Q,GACAs/G,KAAA,CAAAxgH,KAAA,aACA,EAAA,CAAA,OAAA,WAqBA,OApBAsiR,EAAAC,WAAA,SAAArhR,GACA,IAAAghR,EAAAhhR,EAAAq3K,OAAAxgG,OACAyqM,EAAAz1K,EAAA6zJ,YAAAsY,SAAAiH,OAAAgC,UACA,QAAAD,EAAAvC,YACA6C,EAAAD,WAAA,SAAArhR,GACA,IAAAkhR,EAAAlhR,EAAAq3K,OAAAxgG,OACA4nM,EAAA1xB,EAAAmf,mBACAhf,EAAAmO,QAAApQ,EAAAp/I,KAAAyvJ,aAAA4lB,KACA56G,EAAA,KAAA,CACAm4G,WAAAA,EACAE,UAAA5xB,EAAAo0B,gBAAA1C,EAAAv+Q,EAAAu+Q,EAAAz+Q,MAGAshR,EAAA7iD,QAAA,SAAA/4H,GACA4gE,EAAA5gE,UAGA07K,EAAA3iD,QAAA,SAAA/4H,GACA4gE,EAAA5gE,WAMA,GAAAq5K,EAAA,uBAAA,CACA,IAAAwC,EAAAxJ,EAAAyJ,oBAAA,MAAA,CACAhB,cAAAn6C,EACAo6C,eAAAzgR,EACA0gR,kBAAA,CACA3tM,KAAA,OACAkwJ,OAAA,OAEA09C,mBAAA,CACA5tM,KAAA,QACAkwJ,OAAA,SAGA,MAAA,CACAw7C,WAAA1xB,EAAA8zB,kBAAAU,EAAA9C,YACAE,UAAA5xB,EAAA+zB,iBAAAS,EAAA5C,YAOA,IAAA5pJ,EAAAg4H,EAAA1B,IAAAk0B,6BAAAl5C,EAAArmO,EAAAY,GACA,IAAA0lK,EAEA,OADAymF,EAAA1B,IAAAw0B,2BAAA9qJ,EAAA,GACAA,EAAA30H,KAEA69Q,EAAAlpJ,EAAAn0H,EAAA0lK,IAWAymF,EAAAo0B,gBAAAp0B,EAAA1B,IAAAuzB,aAAA,SAAA1+Q,EAAAF,GACA,IAAAiB,EAAA,CACAf,EAAAA,EACAF,EAAAA,EAoBA2tQ,QAAA,SAAAh1G,EAAApnD,EAAAkwK,GAOA,GANA,iBAAAlwK,EACAA,EAAAA,EAAA5P,mBACAhgG,IAAA4vG,IACAA,EAAA,oBAGA,qBAAAA,EACAA,EAAA,CACAhC,OAAA,SAAApkB,EAAAlqF,EAAAqmO,GACA,OAAAi2C,EAAApyL,EAAAlqF,EAAA,GAAAosP,kBAGA,GAAA,aAAA97I,GAAA,eAAAA,EACAA,EAAA,CACAhC,OAAA,SAAApkB,EAAAlqF,GACA,OAAAgqP,EAAAy2B,MAAAC,gBAAA1gR,EAAAkqF,EAAAs2L,UAGA,IAAA,IAAA,CAAA,MAAA,OAAA,OAAA,MAAAhqM,QAAA85B,GACAA,EAAA,CAAAhC,OAAA,SAAAvvG,GAAA,OAAAA,SACA,GAAA,iBAAAuxG,EACA,MAAA,IAAAxM,MAAA,mCAAAwM,EAAA,MAIA,IAAAvxG,EAAAuxG,EAAAhC,OAAAopD,EAAA13J,GAAA,GACA,OAAA8rP,EAAA1B,IAAAsiB,QAAA3tQ,EAAAiB,GAAA,IAkCA2gR,OAAA,SAAAz8C,EAAAjyI,EAAAqe,GACA,iBAAAA,EACAA,EAAAA,EAAA5P,mBACAhgG,IAAA4vG,IACAA,EAAA,qBAGA,sBAAAA,EACAA,EAAA,CACAqwK,OAAA,SAAAz8C,EAAAt7F,GAMA,OAJAA,EAAAi0I,EAAAj0I,EAAA5oI,GAAA,GAIAkkO,IAFA+nB,EAAAmO,QAAAxxH,GAEAlqI,MAAA,GAAAA,QAGA,SAAA4xG,GAAA,SAAAA,GAAA,OAAAA,IACAA,EAAA,CACAqwK,OAAA,SAAAz8C,EAAAt7F,GAGA,OAAAs7F,KADAt7F,EAAAi0I,EAAAj0I,EAAA5oI,GAAA,OAOA,IAAA4oI,EAAAkjH,EAAA1B,IAAAmiB,QAAAt6K,EAAAjyF,GAAA,GAAA,GACA,OAAAswG,EAAAqwK,OAAAz8C,EAAAt7F,EAAA5oI,EAAAf,EAAAg9Q,eAGA,OAAAj8Q,GAkBA8rP,EAAA80B,iBAAA90B,EAAA1B,IAAAqzB,cAAA,SACAx+Q,EAAAF,EAAA6pI,EAAA12D,EAAAonC,EAAAqiK,EAAAG,EAAAC,GACA,IAAA/7Q,EAAA,CACAf,EAAAA,EACAF,EAAAA,EACA6pI,EAAAA,EACA12D,EAAAA,EACAonC,EAAAA,EACAqiK,GAAAA,EACAG,GAAAA,EACAC,KAAAA,EAgBAxP,QAAA,SAAA70G,EAAApnD,EAAAkwK,GACA,iBAAAlwK,EACAA,EAAAA,EAAA5P,mBACAhgG,IAAA4vG,IACAA,EAAA,oBAIA,IAAAs4B,EAAAkjH,EAAA1B,IAAAmiB,QAAA70G,EAAA13J,GAAA,GAAA,GAEA,GAAA,qBAAAswG,EACAA,EAAA,CAAAlB,OAAAytK,QACA,GAAA,aAAAvsK,GAAA,eAAAA,EACAA,EAAA,CACAlB,OAAA,SAAAw5B,EAAA5oI,GACA,OAAAgqP,EAAAy2B,MAAAI,gBAAA7gR,EAAA4oI,EAAA43I,SAGA,CAAA,IAAA,IAAA,CAAA,MAAA,OAAA,OAAA,MAAAhqM,QAAA85B,GAGA,MAAA,IAAAxM,MAAA,mCAAAwM,EAAA,MAFAA,EAAA,CAAAlB,OAAA,SAAAw5B,GAAA,OAAAA,IAMA,OAAAt4B,EAAAlB,OAAAw5B,EAAA5oI,GAAA,IAsBAszP,KAAA,SAAA2U,EAAA33J,GAOA,IAAAisK,GAAA,EAEA,iBAAAjsK,IACAA,EAAAA,EAAA5P,oBAGAhgG,IAAA4vG,GAAA,sBAAAA,GACAA,EAAA,CAAAhC,OAAA+sK,GACAkB,EAAA,GACA,SAAAjsK,GAAA,SAAAA,GAAA,OAAAA,IACAA,EAAA,CAAAhC,OAAA,WAAA,OAAA25J,IACAsU,EAAA,GAIA,IAAA3zI,EAAAt4B,EAAAhC,OAAA25J,EAAAjoQ,EAAAf,EAAAg9Q,aACA,OAAAnwB,EAAA1B,IAAAsiB,QAAA9jI,EAAA5oI,EAAAu8Q,KAGA,OAAAv8Q,GAUA8rP,EAAA8e,kBAAA,SAAAF,GAEA,OAAAze,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAxL,EAAA2Q,aAAA,GAAAxQ,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CACApM,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAA9O,EAAA2R,KAAAqjB,eAAA10B,YACAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAgN,MAAA,EAAA,MAGA3L,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EACA1L,EAAAC,MAAAwe,GAAAte,eAYAN,EAAAmf,mBAAA,SAAAphK,GAEA,IAmBA5qG,EAAAF,EAAA6pI,EAAA12D,EAAAonC,EAAAqiK,EAAAG,EAAAC,EAnBA/e,EAAA,GACAj/H,EAAA,GAQA,GAPAkuH,EAAAhlB,SAAAp9H,EAAAoxK,EAAAje,EAAAj/H,KACAl0B,EAAAoiJ,EAAAmO,QAAApQ,EAAAp/I,KAAAyvJ,aAAA2C,EAAAwgB,cAIAxgB,EAAA,GACAj/H,EAAA,IACAkuH,EAAAhlB,SAAAp9H,EAAAqxK,EAAAle,EAAAj/H,GAAA,CACA,IAAAxjD,EAAA,IAAAupB,MAAA,4EAGA,MADAvpB,EAAAwjD,OAAAA,EACAxjD,EAiBA,OAVAt7E,EAAA+qP,EAAAp/I,KAAAyvJ,aAAA2C,EAAA+jB,mBAAA3gB,QACArhQ,EAAAirP,EAAAp/I,KAAAyvJ,aAAA2C,EAAAgkB,0BAAA5gB,QACAx3H,EAAAohH,EAAAp/I,KAAAyvJ,aAAA2C,EAAAikB,2BAAA7gB,QACAluL,EAAA83K,EAAAp/I,KAAAyvJ,aAAA2C,EAAAkkB,kBAAA9gB,QACA9mJ,EAAA0wI,EAAAp/I,KAAAyvJ,aAAA2C,EAAAmkB,kBAAA/gB,QACAub,EAAA3xB,EAAAp/I,KAAAyvJ,aAAA2C,EAAAokB,qBAAAhhB,QACA0b,EAAA9xB,EAAAp/I,KAAAyvJ,aAAA2C,EAAAqkB,qBAAAjhB,QACA2b,EAAA/xB,EAAAp/I,KAAAyvJ,aAAA2C,EAAAskB,uBAAAlhB,QAGAtU,EAAA80B,iBACA,IAAAjZ,EAAA1oQ,EAAA,IACA,IAAA0oQ,EAAA5oQ,EAAA,IACA,IAAA4oQ,EAAA/+H,EAAA,IACA,IAAA++H,EAAAz1L,EAAA,IACA,IAAAy1L,EAAAruJ,EAAA,IACA,IAAAquJ,EAAAgU,EAAA,IACA,IAAAhU,EAAAmU,EAAA,IACA,IAAAnU,EAAAoU,EAAA,MAUAjwB,EAAAK,iBAAAL,EAAAy1B,0BAAA,SAAAvhR,GAEA,OAAAisP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAxL,EAAA2Q,aAAA,GAAAxQ,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAmmB,EAAA59Q,EAAAf,IAEAgtP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAmmB,EAAA59Q,EAAAjB,IAEAktP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAmmB,EAAA59Q,EAAA4oI,IAEAqjH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAmmB,EAAA59Q,EAAAkyE,IAEA+5K,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAmmB,EAAA59Q,EAAAs5G,IAEA2yI,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAmmB,EAAA59Q,EAAA27Q,KAEA1vB,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAmmB,EAAA59Q,EAAA87Q,KAEA7vB,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAmmB,EAAA59Q,EAAA+7Q,UAWAjwB,EAAA01B,kBAAA,SAAA33K,GAEA,IAAAmzJ,EAAA,GACAj/H,EAAA,GACA,GAAAkuH,EAAAhlB,SAAAp9H,EAAAuxK,EAAApe,EAAAj/H,GAAA,CAEA,IAEAxjD,EAFAsgL,EAAA5O,EAAA8O,SAAAiC,EAAAykB,cACA,GAAA5mB,IAAA/O,EAAA2R,KAAAqjB,cAGA,MAFAvmM,EAAA,IAAAupB,MAAA,yCACA+2J,IAAAA,EACAtgL,EAEAsvB,EAAAmzJ,EAAA0kB,aAKA,GADA3jJ,EAAA,IACAkuH,EAAAhlB,SAAAp9H,EAAAsxK,EAAAne,EAAAj/H,GAIA,MAHAxjD,EAAA,IAAAupB,MAAA,2EAEAi6B,OAAAA,EACAxjD,EAIA,IAAAt7E,EAAA+qP,EAAAp/I,KAAAyvJ,aAAA2C,EAAA2kB,kBAAAvhB,QACArhQ,EAAAirP,EAAAp/I,KAAAyvJ,aAAA2C,EAAA4kB,mBAAAxhB,QAGA,OAAAtU,EAAAo0B,gBACA,IAAAvY,EAAA1oQ,EAAA,IACA,IAAA0oQ,EAAA5oQ,EAAA,MAUA+sP,EAAA+1B,gBAAA/1B,EAAAg2B,gCAAA,SAAA9hR,GAEA,OAAAisP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAA9O,EAAA2R,KAAAqjB,eAAA10B,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAgN,MAAA,EAAA,MAGA3L,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA8M,WAAA,EAAA,CACA5L,EAAAi2B,wBAAA/hR,QAYA8rP,EAAAi2B,wBAAA,SAAA/hR,GAEA,OAAAisP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAmmB,EAAA59Q,EAAAf,IAEAgtP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAmmB,EAAA59Q,EAAAjB,gMCx3CA,IAKAijR,EALAh4B,EAAAzrP,EAAA,WAEAF,EAAAC,QAAA0rP,EAAA4d,KAAA5d,EAAA4d,MAAA,GAUA,SAAAD,EAAA91L,EAAAyS,EAAA7M,GACAuzB,KAAA0sD,KAAA,GACA,MAAA7lF,IACA,iBAAAA,EAAAm5B,KAAA2jJ,WAAA98K,EAAAyS,EAAA7M,GACA,MAAA6M,GAAA,iBAAAzS,EAAAm5B,KAAAqqJ,WAAAxjL,EAAA,KACAm5B,KAAAqqJ,WAAAxjL,EAAAyS,IAKA,SAAA29L,IAAA,OAAA,IAAAta,EAAA,MAmCA,SAAAua,EAAA/vM,EAAAymC,EAAA62G,EAAAnzH,EAAA7kB,EAAAx4E,GAEA,IADA,IAAAkjR,EAAA,MAAAvpK,EAAAwpK,EAAAxpK,GAAA,KACA35G,GAAA,GAAA,CACA,IAAA80F,EAAA,MAAAiX,KAAA0sD,KAAAvlF,GACAsgG,EAAAznE,KAAA0sD,KAAAvlF,MAAA,GACA+X,EAAAk4L,EAAAruL,EAAA0+E,EAAA0vG,EAEA1qM,IADAsc,EAAAouL,EAAApuL,IAAA,MAAA7J,IAAA,IAAAulI,EAAA/3D,KAAAp7D,GAAA7kB,IACA,KAAAyS,GAAA,IAAAk4L,EAAA3vG,EACAg9C,EAAA/3D,KAAAp7D,KAAA,UAAAvI,EAEA,OAAAtc,EAhDAuyK,EAAA4d,KAAAD,WAAAA,EAoDA,oBAAA,WAEAA,EAAAh/J,UAAA05K,GAAAH,EACAF,EAAA,IACA,+BAAApxG,UAAA0xG,SACA3a,EAAAh/J,UAAA05K,GAjCA,SAAAlwM,EAAAymC,EAAA62G,EAAAnzH,EAAA7kB,EAAAx4E,GAEA,IADA,IAAAkjR,EAAA,MAAAvpK,EAAAwpK,EAAAxpK,GAAA,KACA35G,GAAA,GAAA,CACA,IAAA80F,EAAA,MAAAiX,KAAA0sD,KAAAvlF,GACAsgG,EAAAznE,KAAA0sD,KAAAvlF,MAAA,GACA+X,EAAAk4L,EAAAruL,EAAA0+E,EAAA0vG,EAEA1qM,IADAsc,EAAAouL,EAAApuL,IAAA,MAAA7J,IAAA,IAAAulI,EAAA/3D,KAAAp7D,IAAA,WAAA7kB,MACA,KAAAyS,IAAA,IAAAk4L,EAAA3vG,GAAAh7F,IAAA,IACAg4I,EAAA/3D,KAAAp7D,KAAA,WAAAvI,EAEA,OAAAtc,GAwBAuqM,EAAA,IACA,YAAApxG,UAAA0xG,SACA3a,EAAAh/J,UAAA05K,GA/CA,SAAAlwM,EAAAymC,EAAA62G,EAAAnzH,EAAA7kB,EAAAx4E,GACA,OAAAA,GAAA,GAAA,CACA,IAAA6wK,EAAAl3D,EAAA5N,KAAA0sD,KAAAvlF,KAAAs9I,EAAA/3D,KAAAp7D,GAAA7kB,EACAA,EAAA7G,KAAA6nC,MAAAq3D,EAAA,UACA2/C,EAAA/3D,KAAAp7D,KAAA,SAAAwzE,EAEA,OAAAr4F,GA0CAuqM,EAAA,KAEAra,EAAAh/J,UAAA05K,GAAAH,EACAF,EAAA,IAGAra,EAAAh/J,UAAA45K,GAAAP,EACAra,EAAAh/J,UAAA65K,IAAA,GAAAR,GAAA,EACAra,EAAAh/J,UAAA85K,GAAA,GAAAT,EAGAra,EAAAh/J,UAAA+5K,GAAA9xM,KAAAy5J,IAAA,EADA,IAEAs9B,EAAAh/J,UAAAg6K,GAFA,GAEAX,EACAra,EAAAh/J,UAAAi6K,GAAA,EAAAZ,EAHA,GAMA,IAEAa,EAAAC,EADAC,EAAA,IAAAl6K,MAGA,IADAg6K,EAAA,IAAA5/L,WAAA,GACA6/L,EAAA,EAAAA,GAAA,IAAAA,EAAAC,EAAAF,KAAAC,EAEA,IADAD,EAAA,IAAA5/L,WAAA,GACA6/L,EAAA,GAAAA,EAAA,KAAAA,EAAAC,EAAAF,KAAAC,EAEA,IADAD,EAAA,IAAA5/L,WAAA,GACA6/L,EAAA,GAAAA,EAAA,KAAAA,EAAAC,EAAAF,KAAAC,EAEA,SAAAE,EAAA/jR,GAAA,MAVA,uCAUAskG,OAAAtkG,GACA,SAAAgkR,EAAA/7L,EAAA/U,GACA,IAAAsF,EAAAsrM,EAAA77L,EAAAjE,WAAA9Q,IACA,OAAA,MAAAsF,GAAA,EAAAA,EAoBA,SAAAyrM,EAAA/wM,GAAA,IAAA6mC,EAAAipK,IAAA,OAAAjpK,EAAA2lK,QAAAxsM,GAAA6mC,EA6FA,SAAAmqK,EAAAvqK,GACA,IAAAmxC,EAAA/wC,EAAA,EAMA,OALA,IAAA+wC,EAAAnxC,IAAA,MAAAA,EAAAmxC,EAAA/wC,GAAA,IACA,IAAA+wC,EAAAnxC,GAAA,KAAAA,EAAAmxC,EAAA/wC,GAAA,GACA,IAAA+wC,EAAAnxC,GAAA,KAAAA,EAAAmxC,EAAA/wC,GAAA,GACA,IAAA+wC,EAAAnxC,GAAA,KAAAA,EAAAmxC,EAAA/wC,GAAA,GACA,IAAA+wC,EAAAnxC,GAAA,KAAAA,EAAAmxC,EAAA/wC,GAAA,GACAA,EAmLA,SAAAoqK,EAAAl5L,GAAA8gB,KAAA9gB,EAAAA,EA0CA,SAAAm5L,EAAAn5L,GACA8gB,KAAA9gB,EAAAA,EACA8gB,KAAAs4K,GAAAp5L,EAAAq5L,WACAv4K,KAAAw4K,IAAA,MAAAx4K,KAAAs4K,GACAt4K,KAAAy4K,IAAAz4K,KAAAs4K,IAAA,GACAt4K,KAAAm9E,IAAA,GAAAj+F,EAAAq4L,GAAA,IAAA,EACAv3K,KAAA04K,IAAA,EAAAx5L,EAAA6/D,EAiQA,SAAA45H,EAAA/qK,EAAAC,GAAA,OAAAD,EAAAC,EAIA,SAAAkmK,EAAAnmK,EAAAC,GAAA,OAAAD,EAAAC,EAIA,SAAA+qK,EAAAhrK,EAAAC,GAAA,OAAAD,EAAAC,EAIA,SAAAgrK,EAAAjrK,EAAAC,GAAA,OAAAD,GAAAC,EA2BA,SAAAirK,EAAAlrK,GACA,GAAA,GAAAA,EAAA,OAAA,EACA,IAAAI,EAAA,EAMA,OALA,IAAA,MAAAJ,KAAAA,IAAA,GAAAI,GAAA,IACA,IAAA,IAAAJ,KAAAA,IAAA,EAAAI,GAAA,GACA,IAAA,GAAAJ,KAAAA,IAAA,EAAAI,GAAA,GACA,IAAA,EAAAJ,KAAAA,IAAA,EAAAI,GAAA,GACA,IAAA,EAAAJ,MAAAI,EACAA,EAYA,SAAA+qK,EAAAnrK,GAEA,IADA,IAAAI,EAAA,EACA,GAAAJ,GAAAA,GAAAA,EAAA,IAAAI,EACA,OAAAA,EA2GA,SAAAgrK,KACA,SAAAC,EAAArrK,GAAA,OAAAA,EAuCA,SAAAsrK,EAAAh6L,GAEA8gB,KAAAo8J,GAAA6a,IACAj3K,KAAAm5K,GAAAlC,IACAta,EAAAkU,IAAAuI,UAAA,EAAAl6L,EAAA6/D,EAAA/+C,KAAAo8J,IACAp8J,KAAA+rB,GAAA/rB,KAAAo8J,GAAAzxO,OAAAu0D,GACA8gB,KAAA9gB,EAAAA,EA9fAk5L,EAAAz6K,UAAA4oG,QATA,SAAA34F,GACA,OAAAA,EAAA1xB,EAAA,GAAA0xB,EAAAsjK,UAAAlxK,KAAA9gB,IAAA,EAAA0uB,EAAA00C,IAAAtiD,KAAA9gB,GACA0uB,GAQAwqK,EAAAz6K,UAAA07K,OANA,SAAAzrK,GAAA,OAAAA,GAOAwqK,EAAAz6K,UAAAj4B,OANA,SAAAkoC,GAAAA,EAAA0rK,SAAAt5K,KAAA9gB,EAAA,KAAA0uB,IAOAwqK,EAAAz6K,UAAA47K,MANA,SAAA3rK,EAAAC,EAAAG,GAAAJ,EAAA4rK,WAAA3rK,EAAAG,GAAAhO,KAAAt6B,OAAAsoC,IAOAoqK,EAAAz6K,UAAA87K,MANA,SAAA7rK,EAAAI,GAAAJ,EAAA8rK,SAAA1rK,GAAAhO,KAAAt6B,OAAAsoC,IAqFAqqK,EAAA16K,UAAA4oG,QAzCA,SAAA34F,GACA,IAAAI,EAAAipK,IAIA,OAHArpK,EAAAusJ,MAAAif,UAAAp5K,KAAA9gB,EAAA6/D,EAAA/wC,GACAA,EAAAsrK,SAAAt5K,KAAA9gB,EAAA,KAAA8uB,GACAJ,EAAA1xB,EAAA,GAAA8xB,EAAAkjK,UAAAvU,EAAAgd,MAAA,GAAA35K,KAAA9gB,EAAA06L,MAAA5rK,EAAAA,GACAA,GAqCAqqK,EAAA16K,UAAA07K,OAjCA,SAAAzrK,GACA,IAAAI,EAAAipK,IAGA,OAFArpK,EAAAisK,OAAA7rK,GACAhO,KAAAt6B,OAAAsoC,GACAA,GA8BAqqK,EAAA16K,UAAAj4B,OA1BA,SAAAkoC,GACA,KAAAA,EAAAmxC,GAAA/+C,KAAA04K,KACA9qK,EAAA8+C,KAAA9+C,EAAAmxC,KAAA,EACA,IAAA,IAAA53E,EAAA,EAAAA,EAAA64B,KAAA9gB,EAAA6/D,IAAA53E,EAAA,CAEA,IAAAmqB,EAAA,MAAAsc,EAAA8+C,KAAAvlF,GACA2yM,EAAAxoL,EAAA0O,KAAAw4K,MAAAlnL,EAAA0O,KAAAy4K,KAAA7qK,EAAA8+C,KAAAvlF,IAAA,IAAA64B,KAAAw4K,IAAAx4K,KAAAm9E,KAAA,IAAAvvE,EAAA4pK,GAKA,IAHAlmL,EAAAnqB,EAAA64B,KAAA9gB,EAAA6/D,EACAnxC,EAAA8+C,KAAAp7D,IAAA0O,KAAA9gB,EAAAm4L,GAAA,EAAAyC,EAAAlsK,EAAAzmC,EAAA,EAAA64B,KAAA9gB,EAAA6/D,GAEAnxC,EAAA8+C,KAAAp7D,IAAAsc,EAAA6pK,IAAA7pK,EAAA8+C,KAAAp7D,IAAAsc,EAAA6pK,GAAA7pK,EAAA8+C,OAAAp7D,KAEAsc,EAAAmsK,QACAnsK,EAAAosK,UAAAh6K,KAAA9gB,EAAA6/D,EAAAnxC,GACAA,EAAAsjK,UAAAlxK,KAAA9gB,IAAA,GAAA0uB,EAAAgsK,MAAA55K,KAAA9gB,EAAA0uB,IAYAyqK,EAAA16K,UAAA47K,MALA,SAAA3rK,EAAAC,EAAAG,GAAAJ,EAAA4rK,WAAA3rK,EAAAG,GAAAhO,KAAAt6B,OAAAsoC,IAMAqqK,EAAA16K,UAAA87K,MATA,SAAA7rK,EAAAI,GAAAJ,EAAA8rK,SAAA1rK,GAAAhO,KAAAt6B,OAAAsoC,IAmCA2uJ,EAAAh/J,UAAAk8K,OAlaA,SAAA7rK,GACA,IAAA,IAAA7mC,EAAA64B,KAAA++C,EAAA,EAAA53E,GAAA,IAAAA,EAAA6mC,EAAA0+C,KAAAvlF,GAAA64B,KAAA0sD,KAAAvlF,GACA6mC,EAAA+wC,EAAA/+C,KAAA++C,EACA/wC,EAAA9xB,EAAA8jB,KAAA9jB,GAgaAygL,EAAAh/J,UAAAg2K,QA5ZA,SAAA/lK,GACA5N,KAAA++C,EAAA,EACA/+C,KAAA9jB,EAAA0xB,EAAA,GAAA,EAAA,EACAA,EAAA,EAAA5N,KAAA0sD,KAAA,GAAA9+C,EACAA,GAAA,EAAA5N,KAAA0sD,KAAA,GAAA9+C,EAAA5N,KAAAy3K,GACAz3K,KAAA++C,EAAA,GAwZA49G,EAAAh/J,UAAA0sJ,WAjZA,SAAAnuK,EAAA5C,GACA,IAAAjlF,EACA,GAAA,IAAAilF,EAAAjlF,EAAA,OACA,GAAA,GAAAilF,EAAAjlF,EAAA,OACA,GAAA,KAAAilF,EAAAjlF,EAAA,OACA,GAAA,GAAAilF,EAAAjlF,EAAA,OACA,GAAA,IAAAilF,EAAAjlF,EAAA,MACA,CAAA,GAAA,GAAAilF,EACA,YAAA0mB,KAAAi6K,UAAA/9L,EAAA5C,GADAjlF,EAAA,EAEA2rG,KAAA++C,EAAA,EACA/+C,KAAA9jB,EAAA,EAEA,IADA,IAAA/U,EAAA+U,EAAAjX,OAAAi1M,GAAA,EAAAC,EAAA,IACAhzM,GAAA,GAAA,CACA,IAAAymC,EAAA,GAAAv5G,EAAA,IAAA6nF,EAAA/U,GAAA8wM,EAAA/7L,EAAA/U,GACAymC,EAAA,EACA,KAAA1xB,EAAAqc,OAAApxB,KAAA+yM,GAAA,IAGAA,GAAA,EACA,GAAAC,EACAn6K,KAAA0sD,KAAA1sD,KAAA++C,KAAAnxC,EACAusK,EAAA9lR,EAAA2rG,KAAAu3K,IACAv3K,KAAA0sD,KAAA1sD,KAAA++C,EAAA,KAAAnxC,GAAA,GAAA5N,KAAAu3K,GAAA4C,GAAA,IAAAA,EACAn6K,KAAA0sD,KAAA1sD,KAAA++C,KAAAnxC,GAAA5N,KAAAu3K,GAAA4C,GAEAn6K,KAAA0sD,KAAA1sD,KAAA++C,EAAA,IAAAnxC,GAAAusK,GACAA,GAAA9lR,IACA2rG,KAAAu3K,KAAA4C,GAAAn6K,KAAAu3K,KAEA,GAAAljR,GAAA,IAAA,IAAA6nF,EAAA,MACA8jB,KAAA9jB,GAAA,EACAi+L,EAAA,IAAAn6K,KAAA0sD,KAAA1sD,KAAA++C,EAAA,KAAA,GAAA/+C,KAAAu3K,GAAA4C,GAAA,GAAAA,IAEAn6K,KAAA+5K,QACAG,GAAAvd,EAAAgd,KAAAC,MAAA55K,KAAAA,OAgXA28J,EAAAh/J,UAAAo8K,MA5WA,WAEA,IADA,IAAAttM,EAAAuzB,KAAA9jB,EAAA8jB,KAAAw3K,GACAx3K,KAAA++C,EAAA,GAAA/+C,KAAA0sD,KAAA1sD,KAAA++C,EAAA,IAAAtyE,KAAAuzB,KAAA++C,GA2WA49G,EAAAh/J,UAAAy7K,UAxSA,SAAAnlR,EAAA+5G,GACA,IAAA7mC,EACA,IAAAA,EAAA64B,KAAA++C,EAAA,EAAA53E,GAAA,IAAAA,EAAA6mC,EAAA0+C,KAAAvlF,EAAAlzE,GAAA+rG,KAAA0sD,KAAAvlF,GACA,IAAAA,EAAAlzE,EAAA,EAAAkzE,GAAA,IAAAA,EAAA6mC,EAAA0+C,KAAAvlF,GAAA,EACA6mC,EAAA+wC,EAAA/+C,KAAA++C,EAAA9qJ,EACA+5G,EAAA9xB,EAAA8jB,KAAA9jB,GAoSAygL,EAAAh/J,UAAAq8K,UAhSA,SAAA/lR,EAAA+5G,GACA,IAAA,IAAA7mC,EAAAlzE,EAAAkzE,EAAA64B,KAAA++C,IAAA53E,EAAA6mC,EAAA0+C,KAAAvlF,EAAAlzE,GAAA+rG,KAAA0sD,KAAAvlF,GACA6mC,EAAA+wC,EAAAn5E,KAAAD,IAAAq6B,KAAA++C,EAAA9qJ,EAAA,GACA+5G,EAAA9xB,EAAA8jB,KAAA9jB,GA8RAygL,EAAAh/J,UAAAy8K,SA1RA,SAAAnmR,EAAA+5G,GACA,IAGA7mC,EAHAkzM,EAAApmR,EAAA+rG,KAAAu3K,GACA+C,EAAAt6K,KAAAu3K,GAAA8C,EACA/lF,GAAA,GAAAgmF,GAAA,EACAC,EAAA30M,KAAA6nC,MAAAx5G,EAAA+rG,KAAAu3K,IAAA9qM,EAAAuzB,KAAA9jB,GAAAm+L,EAAAr6K,KAAAw3K,GACA,IAAArwM,EAAA64B,KAAA++C,EAAA,EAAA53E,GAAA,IAAAA,EACA6mC,EAAA0+C,KAAAvlF,EAAAozM,EAAA,GAAAv6K,KAAA0sD,KAAAvlF,IAAAmzM,EAAA7tM,EACAA,GAAAuzB,KAAA0sD,KAAAvlF,GAAAmtH,IAAA+lF,EAEA,IAAAlzM,EAAAozM,EAAA,EAAApzM,GAAA,IAAAA,EAAA6mC,EAAA0+C,KAAAvlF,GAAA,EACA6mC,EAAA0+C,KAAA6tH,GAAA9tM,EACAuhC,EAAA+wC,EAAA/+C,KAAA++C,EAAAw7H,EAAA,EACAvsK,EAAA9xB,EAAA8jB,KAAA9jB,EACA8xB,EAAA+rK,SA8QApd,EAAAh/J,UAAA68K,SA1QA,SAAAvmR,EAAA+5G,GACAA,EAAA9xB,EAAA8jB,KAAA9jB,EACA,IAAAq+L,EAAA30M,KAAA6nC,MAAAx5G,EAAA+rG,KAAAu3K,IACA,GAAAgD,GAAAv6K,KAAA++C,EAAA/wC,EAAA+wC,EAAA,MAAA,CACA,IAAAs7H,EAAApmR,EAAA+rG,KAAAu3K,GACA+C,EAAAt6K,KAAAu3K,GAAA8C,EACA/lF,GAAA,GAAA+lF,GAAA,EACArsK,EAAA0+C,KAAA,GAAA1sD,KAAA0sD,KAAA6tH,IAAAF,EACA,IAAA,IAAAlzM,EAAAozM,EAAA,EAAApzM,EAAA64B,KAAA++C,IAAA53E,EACA6mC,EAAA0+C,KAAAvlF,EAAAozM,EAAA,KAAAv6K,KAAA0sD,KAAAvlF,GAAAmtH,IAAAgmF,EACAtsK,EAAA0+C,KAAAvlF,EAAAozM,GAAAv6K,KAAA0sD,KAAAvlF,IAAAkzM,EAEAA,EAAA,IAAArsK,EAAA0+C,KAAA1sD,KAAA++C,EAAAw7H,EAAA,KAAAv6K,KAAA9jB,EAAAo4G,IAAAgmF,GACAtsK,EAAA+wC,EAAA/+C,KAAA++C,EAAAw7H,EACAvsK,EAAA+rK,UA6PApd,EAAAh/J,UAAAi8K,MAzPA,SAAA/yM,EAAAmnC,GAEA,IADA,IAAA7mC,EAAA,EAAAsF,EAAA,EAAAyS,EAAAtZ,KAAAq0B,IAAApzB,EAAAk4E,EAAA/+C,KAAA++C,GACA53E,EAAA+X,GACAzS,GAAAuzB,KAAA0sD,KAAAvlF,GAAAN,EAAA6lF,KAAAvlF,GACA6mC,EAAA0+C,KAAAvlF,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA,GAAA1wM,EAAAk4E,EAAA/+C,KAAA++C,EAAA,CAEA,IADAtyE,GAAA5F,EAAAqV,EACA/U,EAAA64B,KAAA++C,GACAtyE,GAAAuzB,KAAA0sD,KAAAvlF,GACA6mC,EAAA0+C,KAAAvlF,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA9qM,GAAAuzB,KAAA9jB,MACA,CAEA,IADAzP,GAAAuzB,KAAA9jB,EACA/U,EAAAN,EAAAk4E,GACAtyE,GAAA5F,EAAA6lF,KAAAvlF,GACA6mC,EAAA0+C,KAAAvlF,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA9qM,GAAA5F,EAAAqV,EAEA8xB,EAAA9xB,EAAAzP,EAAA,GAAA,EAAA,EACAA,GAAA,EAAAuhC,EAAA0+C,KAAAvlF,KAAA64B,KAAAy3K,GAAAhrM,EACAA,EAAA,IAAAuhC,EAAA0+C,KAAAvlF,KAAAsF,GACAuhC,EAAA+wC,EAAA53E,EACA6mC,EAAA+rK,SA8NApd,EAAAh/J,UAAA67K,WAzNA,SAAA3yM,EAAAmnC,GACA,IAAAJ,EAAA5N,KAAAm6J,MAAAtsJ,EAAAhnC,EAAAszL,MACAhzL,EAAAymC,EAAAmxC,EAEA,IADA/wC,EAAA+wC,EAAA53E,EAAA0mC,EAAAkxC,IACA53E,GAAA,GAAA6mC,EAAA0+C,KAAAvlF,GAAA,EACA,IAAAA,EAAA,EAAAA,EAAA0mC,EAAAkxC,IAAA53E,EAAA6mC,EAAA0+C,KAAAvlF,EAAAymC,EAAAmxC,GAAAnxC,EAAAypK,GAAA,EAAAxpK,EAAA6+C,KAAAvlF,GAAA6mC,EAAA7mC,EAAA,EAAAymC,EAAAmxC,GACA/wC,EAAA9xB,EAAA,EACA8xB,EAAA+rK,QACA/5K,KAAA9jB,GAAArV,EAAAqV,GAAAygL,EAAAgd,KAAAC,MAAA5rK,EAAAA,IAkNA2uJ,EAAAh/J,UAAA+7K,SA9MA,SAAA1rK,GAGA,IAFA,IAAAJ,EAAA5N,KAAAm6J,MACAhzL,EAAA6mC,EAAA+wC,EAAA,EAAAnxC,EAAAmxC,IACA53E,GAAA,GAAA6mC,EAAA0+C,KAAAvlF,GAAA,EACA,IAAAA,EAAA,EAAAA,EAAAymC,EAAAmxC,EAAA,IAAA53E,EAAA,CACA,IAAAsF,EAAAmhC,EAAAypK,GAAAlwM,EAAAymC,EAAA8+C,KAAAvlF,GAAA6mC,EAAA,EAAA7mC,EAAA,EAAA,IACA6mC,EAAA0+C,KAAAvlF,EAAAymC,EAAAmxC,IAAAnxC,EAAAypK,GAAAlwM,EAAA,EAAA,EAAAymC,EAAA8+C,KAAAvlF,GAAA6mC,EAAA,EAAA7mC,EAAA,EAAAsF,EAAAmhC,EAAAmxC,EAAA53E,EAAA,KAAAymC,EAAA6pK,KACAzpK,EAAA0+C,KAAAvlF,EAAAymC,EAAAmxC,IAAAnxC,EAAA6pK,GACAzpK,EAAA0+C,KAAAvlF,EAAAymC,EAAAmxC,EAAA,GAAA,GAGA/wC,EAAA+wC,EAAA,IAAA/wC,EAAA0+C,KAAA1+C,EAAA+wC,EAAA,IAAAnxC,EAAAypK,GAAAlwM,EAAAymC,EAAA8+C,KAAAvlF,GAAA6mC,EAAA,EAAA7mC,EAAA,EAAA,IACA6mC,EAAA9xB,EAAA,EACA8xB,EAAA+rK,SAkMApd,EAAAh/J,UAAA27K,SA7LA,SAAAp6L,EAAAovB,EAAAN,GACA,IAAAysK,EAAAv7L,EAAAi7K,MACA,KAAAsgB,EAAA17H,GAAA,GAAA,CACA,IAAA27H,EAAA16K,KAAAm6J,MACA,GAAAugB,EAAA37H,EAAA07H,EAAA17H,EAGA,OAFA,MAAAzwC,GAAAA,EAAAqlK,QAAA,QACA,MAAA3lK,GAAAhO,KAAA65K,OAAA7rK,IAGA,MAAAA,IAAAA,EAAAipK,KACA,IAAAppK,EAAAopK,IAAA0D,EAAA36K,KAAA9jB,EAAA4zI,EAAA5wI,EAAAhD,EACA0+L,EAAA56K,KAAAu3K,GAAAY,EAAAsC,EAAA/tH,KAAA+tH,EAAA17H,EAAA,IACA67H,EAAA,GAAAH,EAAAL,SAAAQ,EAAA/sK,GAAA6sK,EAAAN,SAAAQ,EAAA5sK,KAAAysK,EAAAZ,OAAAhsK,GAAA6sK,EAAAb,OAAA7rK,IACA,IAAA6sK,EAAAhtK,EAAAkxC,EACA+7H,EAAAjtK,EAAA6+C,KAAAmuH,EAAA,GACA,GAAA,GAAAC,EAAA,CACA,IAAAC,EAAAD,GAAA,GAAA96K,KAAA23K,KAAAkD,EAAA,EAAAhtK,EAAA6+C,KAAAmuH,EAAA,IAAA76K,KAAA43K,GAAA,GACAoD,EAAAh7K,KAAA03K,GAAAqD,EAAAE,GAAA,GAAAj7K,KAAA23K,IAAAoD,EAAAhnR,EAAA,GAAAisG,KAAA43K,GACAzwM,EAAA6mC,EAAA+wC,EAAAztD,EAAAnqB,EAAA0zM,EAAA97H,EAAA,MAAAzwC,EAAA2oK,IAAA3oK,EAQA,IAPAT,EAAAurK,UAAA9nL,EAAAytD,GACA/wC,EAAAkjK,UAAAnyH,IAAA,IACA/wC,EAAA0+C,KAAA1+C,EAAA+wC,KAAA,EACA/wC,EAAA4rK,MAAA76H,EAAA/wC,IAEA2uJ,EAAAkU,IAAAuI,UAAAyB,EAAA97H,GACAA,EAAA66H,MAAA/rK,EAAAA,GACAA,EAAAkxC,EAAA87H,GAAAhtK,EAAA6+C,KAAA7+C,EAAAkxC,KAAA,EACA,OAAAztD,GAAA,GAAA,CAEA,IAAA4pL,EAAAltK,EAAA0+C,OAAAvlF,IAAA2zM,EAAA96K,KAAAw3K,GAAA5xM,KAAA6nC,MAAAO,EAAA0+C,KAAAvlF,GAAA6zM,GAAAhtK,EAAA0+C,KAAAvlF,EAAA,GAAApzE,GAAAknR,GACA,IAAAjtK,EAAA0+C,KAAAvlF,IAAA0mC,EAAAwpK,GAAA,EAAA6D,EAAAltK,EAAA1c,EAAA,EAAAupL,IAAAK,EAGA,IAFArtK,EAAAurK,UAAA9nL,EAAAytD,GACA/wC,EAAA4rK,MAAA76H,EAAA/wC,GACAA,EAAA0+C,KAAAvlF,KAAA+zM,GAAAltK,EAAA4rK,MAAA76H,EAAA/wC,GAGA,MAAAM,IACAN,EAAAgsK,UAAAa,EAAAvsK,GACAqsK,GAAA7qD,GAAA6sC,EAAAgd,KAAAC,MAAAtrK,EAAAA,IAEAN,EAAA+wC,EAAA87H,EACA7sK,EAAA+rK,QACAa,EAAA,GAAA5sK,EAAAwsK,SAAAI,EAAA5sK,GACA2sK,EAAA,GAAAhe,EAAAgd,KAAAC,MAAA5rK,EAAAA,MAmJA2uJ,EAAAh/J,UAAA46K,SA7GA,WACA,GAAAv4K,KAAA++C,EAAA,EAAA,OAAA,EACA,IAAAnxC,EAAA5N,KAAA0sD,KAAA,GACA,GAAA,IAAA,EAAA9+C,GAAA,OAAA,EACA,IAAAC,EAAA,EAAAD,EAQA,OAFAC,GAHAA,GADAA,GADAA,EAAAA,GAAA,GAAA,GAAAD,GAAAC,GAAA,KACA,GAAA,IAAAD,GAAAC,GAAA,MACA,IAAA,MAAAD,GAAAC,EAAA,QAAA,QAGA,EAAAD,EAAAC,EAAA7N,KAAAy3K,IAAAz3K,KAAAy3K,IAEA,EAAAz3K,KAAAy3K,GAAA5pK,GAAAA,GAkGA8uJ,EAAAh/J,UAAAw9K,OApCA,WAAA,OAAA,IAAAn7K,KAAA++C,EAAA,EAAA,EAAA/+C,KAAA0sD,KAAA,GAAA1sD,KAAA9jB,IAqCAygL,EAAAh/J,UAAAp2B,IAlCA,SAAAxzE,EAAAwxN,GACA,GAAAxxN,EAAA,YAAAA,EAAA,EAAA,OAAA4oQ,EAAAkU,IACA,IAAA7iK,EAAAipK,IAAA7a,EAAA6a,IAAA7yD,EAAAmB,EAAAhf,QAAAvmG,MAAA74B,EAAAgxM,EAAApkR,GAAA,EAEA,IADAqwN,EAAAy1D,OAAA7rK,KACA7mC,GAAA,GAEA,GADAo+I,EAAAk0D,MAAAzrK,EAAAouJ,IACAroQ,EAAA,GAAAozE,GAAA,EAAAo+I,EAAAg0D,MAAAnd,EAAAh4C,EAAAp2G,OACA,CAAA,IAAA+wC,EAAA/wC,EAAAA,EAAAouJ,EAAAA,EAAAr9G,EAEA,OAAAwmE,EAAA8zD,OAAArrK,IA4BA2uJ,EAAAh/J,UAAAS,SApXA,SAAA9kB,GACA,GAAA0mB,KAAA9jB,EAAA,EAAA,MAAA,IAAA8jB,KAAAo7K,SAAAh9K,SAAA9kB,GACA,IAAAjlF,EACA,GAAA,IAAAilF,EAAAjlF,EAAA,OACA,GAAA,GAAAilF,EAAAjlF,EAAA,OACA,GAAA,GAAAilF,EAAAjlF,EAAA,OACA,GAAA,IAAAilF,EAAAjlF,EAAA,MACA,CAAA,GAAA,GAAAilF,EACA,OAAA0mB,KAAAq7K,QAAA/hM,GADAjlF,EAAA,EAEA,IAAAupI,EAAA09I,GAAA,GAAAjnR,GAAA,EAAA6qF,GAAA,EAAA8uB,EAAA,GAAA7mC,EAAA64B,KAAA++C,EACA73E,EAAA84B,KAAAu3K,GAAApwM,EAAA64B,KAAAu3K,GAAAljR,EACA,GAAA8yE,KAAA,EAEA,IADAD,EAAA84B,KAAAu3K,KAAA35I,EAAA59B,KAAA0sD,KAAAvlF,IAAAD,GAAA,IAAAgY,GAAA,EAAA8uB,EAAAgqK,EAAAp6I,IACAz2D,GAAA,GACAD,EAAA7yE,GACAupI,GAAA59B,KAAA0sD,KAAAvlF,IAAA,GAAAD,GAAA,IAAA7yE,EAAA6yE,EACA02D,GAAA59B,KAAA0sD,OAAAvlF,KAAAD,GAAA84B,KAAAu3K,GAAAljR,KAEAupI,EAAA59B,KAAA0sD,KAAAvlF,KAAAD,GAAA7yE,GAAAinR,EACAp0M,GAAA,IAAAA,GAAA84B,KAAAu3K,KAAApwM,IAEAy2D,EAAA,IAAA1+C,GAAA,GACAA,IAAA8uB,GAAAgqK,EAAAp6I,IAGA,OAAA1+C,EAAA8uB,EAAA,KA4VA2uJ,EAAAh/J,UAAAy9K,OAxVA,WAAA,IAAAptK,EAAAipK,IAAA,OAAAta,EAAAgd,KAAAC,MAAA55K,KAAAgO,GAAAA,GAyVA2uJ,EAAAh/J,UAAAw8J,IAtVA,WAAA,OAAAn6J,KAAA9jB,EAAA,EAAA8jB,KAAAo7K,SAAAp7K,MAuVA28J,EAAAh/J,UAAAuzK,UApVA,SAAArqM,GACA,IAAAmnC,EAAAhO,KAAA9jB,EAAArV,EAAAqV,EACA,GAAA,GAAA8xB,EAAA,OAAAA,EACA,IAAA7mC,EAAA64B,KAAA++C,EAEA,GAAA,IADA/wC,EAAA7mC,EAAAN,EAAAk4E,GACA,OAAA/+C,KAAA9jB,EAAA,GAAA8xB,EAAAA,EACA,OAAA7mC,GAAA,MAAA,IAAA6mC,EAAAhO,KAAA0sD,KAAAvlF,GAAAN,EAAA6lF,KAAAvlF,IAAA,OAAA6mC,EACA,OAAA,GA8UA2uJ,EAAAh/J,UAAAszK,UA/TA,WACA,OAAAjxK,KAAA++C,GAAA,EAAA,EACA/+C,KAAAu3K,IAAAv3K,KAAA++C,EAAA,GAAAo5H,EAAAn4K,KAAA0sD,KAAA1sD,KAAA++C,EAAA,GAAA/+C,KAAA9jB,EAAA8jB,KAAAw3K,KA8TA7a,EAAAh/J,UAAA2kD,IAzJA,SAAAz7E,GACA,IAAAmnC,EAAAipK,IAGA,OAFAj3K,KAAAm6J,MAAAmf,SAAAzyM,EAAA,KAAAmnC,GACAhO,KAAA9jB,EAAA,GAAA8xB,EAAAkjK,UAAAvU,EAAAgd,MAAA,GAAA9yM,EAAA+yM,MAAA5rK,EAAAA,GACAA,GAsJA2uJ,EAAAh/J,UAAA49K,UA9BA,SAAAxnR,EAAAmrF,GACA,IAAAqmI,EAEA,OADAA,EAAAxxN,EAAA,KAAAmrF,EAAAi8L,SAAA,IAAA/C,EAAAl5L,GAAA,IAAAm5L,EAAAn5L,GACA8gB,KAAAz4B,IAAAxzE,EAAAwxN,IA8BAo3C,EAAAgd,KAAAzB,EAAA,GACAvb,EAAAkU,IAAAqH,EAAA,GAyUAc,EAAAr7K,UAAA4oG,QAAA0yE,EACAD,EAAAr7K,UAAA07K,OAAAJ,EACAD,EAAAr7K,UAAA47K,MALA,SAAA3rK,EAAAC,EAAAG,GAAAJ,EAAA4rK,WAAA3rK,EAAAG,IAMAgrK,EAAAr7K,UAAA87K,MALA,SAAA7rK,EAAAI,GAAAJ,EAAA8rK,SAAA1rK,IAuEAkrK,EAAAv7K,UAAA4oG,QAzBA,SAAA34F,GACA,GAAAA,EAAA1xB,EAAA,GAAA0xB,EAAAmxC,EAAA,EAAA/+C,KAAA9gB,EAAA6/D,EAAA,OAAAnxC,EAAA00C,IAAAtiD,KAAA9gB,GACA,GAAA0uB,EAAAsjK,UAAAlxK,KAAA9gB,GAAA,EAAA,OAAA0uB,EACA,IAAAI,EAAAipK,IAAA,OAAArpK,EAAAisK,OAAA7rK,GAAAhO,KAAAt6B,OAAAsoC,GAAAA,GAuBAkrK,EAAAv7K,UAAA07K,OApBA,SAAAzrK,GAAA,OAAAA,GAqBAsrK,EAAAv7K,UAAAj4B,OAlBA,SAAAkoC,GAKA,IAJAA,EAAAosK,UAAAh6K,KAAA9gB,EAAA6/D,EAAA,EAAA/+C,KAAAo8J,IACAxuJ,EAAAmxC,EAAA/+C,KAAA9gB,EAAA6/D,EAAA,IAAAnxC,EAAAmxC,EAAA/+C,KAAA9gB,EAAA6/D,EAAA,EAAAnxC,EAAAmsK,SACA/5K,KAAA+rB,GAAAyvJ,gBAAAx7K,KAAAo8J,GAAAp8J,KAAA9gB,EAAA6/D,EAAA,EAAA/+C,KAAAm5K,IACAn5K,KAAA9gB,EAAAu8L,gBAAAz7K,KAAAm5K,GAAAn5K,KAAA9gB,EAAA6/D,EAAA,EAAA/+C,KAAAo8J,IACAxuJ,EAAAsjK,UAAAlxK,KAAAo8J,IAAA,GAAAxuJ,EAAAwmK,WAAA,EAAAp0K,KAAA9gB,EAAA6/D,EAAA,GAEA,IADAnxC,EAAAgsK,MAAA55K,KAAAo8J,GAAAxuJ,GACAA,EAAAsjK,UAAAlxK,KAAA9gB,IAAA,GAAA0uB,EAAAgsK,MAAA55K,KAAA9gB,EAAA0uB,IAYAsrK,EAAAv7K,UAAA47K,MALA,SAAA3rK,EAAAC,EAAAG,GAAAJ,EAAA4rK,WAAA3rK,EAAAG,GAAAhO,KAAAt6B,OAAAsoC,IAMAkrK,EAAAv7K,UAAA87K,MATA,SAAA7rK,EAAAI,GAAAJ,EAAA8rK,SAAA1rK,GAAAhO,KAAAt6B,OAAAsoC,IAiJA,IAAA0tK,EAAA,CAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,KACAC,GAAA,GAAA,IAAAD,EAAAA,EAAAz2M,OAAA,GA8DA03L,EAAAh/J,UAAAi+K,UAxjBA,SAAA5tK,GAAA,OAAApoC,KAAA6nC,MAAA7nC,KAAA2iL,IAAAvoJ,KAAAu3K,GAAA3xM,KAAAymJ,IAAAr+G,KAyjBA2uJ,EAAAh/J,UAAA09K,QA/iBA,SAAA/hM,GAEA,GADA,MAAAA,IAAAA,EAAA,IACA,GAAA0mB,KAAA67K,UAAAviM,EAAA,GAAAA,EAAA,GAAA,MAAA,IACA,IAAAwiM,EAAA97K,KAAA47K,UAAAtiM,GACAzS,EAAAjB,KAAAy5J,IAAA/lJ,EAAAwiM,GACAl+I,EAAAs6I,EAAArxM,GAAAgnC,EAAAopK,IAAA1xD,EAAA0xD,IAAAjpK,EAAA,GAEA,IADAhO,KAAAs5K,SAAA17I,EAAA/vB,EAAA03G,GACA13G,EAAAguK,SAAA,GACA7tK,GAAAnnC,EAAA0+I,EAAAw2D,YAAA39K,SAAA9kB,GAAAzT,OAAA,GAAAmoC,EACAH,EAAAyrK,SAAA17I,EAAA/vB,EAAA03G,GAEA,OAAAA,EAAAw2D,WAAA39K,SAAA9kB,GAAA00B,GAqiBA2uJ,EAAAh/J,UAAAs8K,UAjiBA,SAAA/9L,EAAA5C,GACA0mB,KAAA2zK,QAAA,GACA,MAAAr6L,IAAAA,EAAA,IAGA,IAFA,IAAAwiM,EAAA97K,KAAA47K,UAAAtiM,GACAskD,EAAAh4D,KAAAy5J,IAAA/lJ,EAAAwiM,GAAA5B,GAAA,EAAA5oL,EAAA,EAAAmzH,EAAA,EACAt9I,EAAA,EAAAA,EAAA+U,EAAAjX,SAAAkC,EAAA,CACA,IAAAymC,EAAAqqK,EAAA/7L,EAAA/U,GACAymC,EAAA,EACA,KAAA1xB,EAAAqc,OAAApxB,IAAA,GAAA64B,KAAA67K,WAAA3B,GAAA,IAGAz1D,EAAAnrI,EAAAmrI,EAAA72G,IACAtc,GAAAwqL,IACA97K,KAAAg8K,UAAAp+I,GACA59B,KAAAo0K,WAAA3vD,EAAA,GACAnzH,EAAA,EACAmzH,EAAA,IAGAnzH,EAAA,IACA0O,KAAAg8K,UAAAp2M,KAAAy5J,IAAA/lJ,EAAAgY,IACA0O,KAAAo0K,WAAA3vD,EAAA,IAEAy1D,GAAAvd,EAAAgd,KAAAC,MAAA55K,KAAAA,OA2gBA28J,EAAAh/J,UAAAgmJ,WAvgBA,SAAA98K,EAAAyS,EAAA7M,GACA,GAAA,iBAAA6M,EAEA,GAAAzS,EAAA,EAAAm5B,KAAA2zK,QAAA,QAMA,IAJA3zK,KAAA2jJ,WAAA98K,EAAA4F,GACAuzB,KAAAi0K,QAAAptM,EAAA,IACAm5B,KAAAk0K,UAAAvX,EAAAkU,IAAAsD,UAAAttM,EAAA,GAAAktM,EAAA/zK,MACAA,KAAAm7K,UAAAn7K,KAAAo0K,WAAA,EAAA,IACAp0K,KAAAs0K,gBAAAh7L,IACA0mB,KAAAo0K,WAAA,EAAA,GACAp0K,KAAAixK,YAAApqM,GAAAm5B,KAAA45K,MAAAjd,EAAAkU,IAAAsD,UAAAttM,EAAA,GAAAm5B,UAGA,CAEA,IAAA4N,EAAA,IAAA/P,MAAAkhD,EAAA,EAAAl4E,EACA+mC,EAAA3oC,OAAA,GAAA4B,GAAA,GACAyS,EAAAk6L,UAAA5lK,GACAmxC,EAAA,EAAAnxC,EAAA,KAAA,GAAAmxC,GAAA,EAAAnxC,EAAA,GAAA,EACA5N,KAAAqqJ,WAAAz8I,EAAA,OAofA+uJ,EAAAh/J,UAAAu2K,UAndA,SAAArtM,EAAAmqF,EAAAhjD,GACA,IAAA7mC,EAAAu6E,EAAAxiE,EAAAtZ,KAAAq0B,IAAApzB,EAAAk4E,EAAA/+C,KAAA++C,GACA,IAAA53E,EAAA,EAAAA,EAAA+X,IAAA/X,EAAA6mC,EAAA0+C,KAAAvlF,GAAA6pF,EAAAhxD,KAAA0sD,KAAAvlF,GAAAN,EAAA6lF,KAAAvlF,IACA,GAAAN,EAAAk4E,EAAA/+C,KAAA++C,EAAA,CAEA,IADA2C,EAAA76E,EAAAqV,EAAA8jB,KAAAw3K,GACArwM,EAAA+X,EAAA/X,EAAA64B,KAAA++C,IAAA53E,EAAA6mC,EAAA0+C,KAAAvlF,GAAA6pF,EAAAhxD,KAAA0sD,KAAAvlF,GAAAu6E,GACA1zC,EAAA+wC,EAAA/+C,KAAA++C,MACA,CAEA,IADA2C,EAAA1hD,KAAA9jB,EAAA8jB,KAAAw3K,GACArwM,EAAA+X,EAAA/X,EAAAN,EAAAk4E,IAAA53E,EAAA6mC,EAAA0+C,KAAAvlF,GAAA6pF,EAAAtP,EAAA76E,EAAA6lF,KAAAvlF,IACA6mC,EAAA+wC,EAAAl4E,EAAAk4E,EAEA/wC,EAAA9xB,EAAA80E,EAAAhxD,KAAA9jB,EAAArV,EAAAqV,GACA8xB,EAAA+rK,SAucApd,EAAAh/J,UAAAs+K,UAnXA,SAAAhoR,EAAA+8J,GACA,IAAAhjD,EAAA2uJ,EAAAkU,IAAAsD,UAAAlgR,GAEA,OADA+rG,KAAAk0K,UAAAlmK,EAAAgjD,EAAAhjD,GACAA,GAiXA2uJ,EAAAh/J,UAAAu+K,MApWA,SAAAr1M,EAAAmnC,GAEA,IADA,IAAA7mC,EAAA,EAAAsF,EAAA,EAAAyS,EAAAtZ,KAAAq0B,IAAApzB,EAAAk4E,EAAA/+C,KAAA++C,GACA53E,EAAA+X,GACAzS,GAAAuzB,KAAA0sD,KAAAvlF,GAAAN,EAAA6lF,KAAAvlF,GACA6mC,EAAA0+C,KAAAvlF,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA,GAAA1wM,EAAAk4E,EAAA/+C,KAAA++C,EAAA,CAEA,IADAtyE,GAAA5F,EAAAqV,EACA/U,EAAA64B,KAAA++C,GACAtyE,GAAAuzB,KAAA0sD,KAAAvlF,GACA6mC,EAAA0+C,KAAAvlF,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA9qM,GAAAuzB,KAAA9jB,MACA,CAEA,IADAzP,GAAAuzB,KAAA9jB,EACA/U,EAAAN,EAAAk4E,GACAtyE,GAAA5F,EAAA6lF,KAAAvlF,GACA6mC,EAAA0+C,KAAAvlF,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA9qM,GAAA5F,EAAAqV,EAEA8xB,EAAA9xB,EAAAzP,EAAA,GAAA,EAAA,EACAA,EAAA,EAAAuhC,EAAA0+C,KAAAvlF,KAAAsF,EACAA,GAAA,IAAAuhC,EAAA0+C,KAAAvlF,KAAA64B,KAAAy3K,GAAAhrM,GACAuhC,EAAA+wC,EAAA53E,EACA6mC,EAAA+rK,SAyUApd,EAAAh/J,UAAAq+K,UA/SA,SAAA/nR,GACA+rG,KAAA0sD,KAAA1sD,KAAA++C,GAAA/+C,KAAAq3K,GAAA,EAAApjR,EAAA,EAAA+rG,KAAA,EAAA,EAAAA,KAAA++C,KACA/+C,KAAA++C,EACA/+C,KAAA+5K,SA6SApd,EAAAh/J,UAAAy2K,WAzSA,SAAAngR,EAAAwwN,GACA,GAAA,GAAAxwN,EAAA,CACA,KAAA+rG,KAAA++C,GAAA0lE,GAAAzkH,KAAA0sD,KAAA1sD,KAAA++C,KAAA,EAEA,IADA/+C,KAAA0sD,KAAA+3D,IAAAxwN,EACA+rG,KAAA0sD,KAAA+3D,IAAAzkH,KAAAy3K,IACAz3K,KAAA0sD,KAAA+3D,IAAAzkH,KAAAy3K,KACAhzD,GAAAzkH,KAAA++C,IAAA/+C,KAAA0sD,KAAA1sD,KAAA++C,KAAA,KACA/+C,KAAA0sD,KAAA+3D,KAmSAk4C,EAAAh/J,UAAA89K,gBA/QA,SAAA50M,EAAA5yE,EAAA+5G,GACA,IAIA1c,EAJAnqB,EAAAvB,KAAAq0B,IAAA+F,KAAA++C,EAAAl4E,EAAAk4E,EAAA9qJ,GAGA,IAFA+5G,EAAA9xB,EAAA,EACA8xB,EAAA+wC,EAAA53E,EACAA,EAAA,GAAA6mC,EAAA0+C,OAAAvlF,GAAA,EAEA,IAAAmqB,EAAA0c,EAAA+wC,EAAA/+C,KAAA++C,EAAA53E,EAAAmqB,IAAAnqB,EAAA6mC,EAAA0+C,KAAAvlF,EAAA64B,KAAA++C,GAAA/+C,KAAAq3K,GAAA,EAAAxwM,EAAA6lF,KAAAvlF,GAAA6mC,EAAA7mC,EAAA,EAAA64B,KAAA++C,GACA,IAAAztD,EAAA1rB,KAAAq0B,IAAApzB,EAAAk4E,EAAA9qJ,GAAAkzE,EAAAmqB,IAAAnqB,EAAA64B,KAAAq3K,GAAA,EAAAxwM,EAAA6lF,KAAAvlF,GAAA6mC,EAAA7mC,EAAA,EAAAlzE,EAAAkzE,GACA6mC,EAAA+rK,SAwQApd,EAAAh/J,UAAA69K,gBAnQA,SAAA30M,EAAA5yE,EAAA+5G,KACA/5G,EACA,IAAAkzE,EAAA6mC,EAAA+wC,EAAA/+C,KAAA++C,EAAAl4E,EAAAk4E,EAAA9qJ,EAEA,IADA+5G,EAAA9xB,EAAA,IACA/U,GAAA,GAAA6mC,EAAA0+C,KAAAvlF,GAAA,EACA,IAAAA,EAAAvB,KAAAD,IAAA1xE,EAAA+rG,KAAA++C,EAAA,GAAA53E,EAAAN,EAAAk4E,IAAA53E,EACA6mC,EAAA0+C,KAAA1sD,KAAA++C,EAAA53E,EAAAlzE,GAAA+rG,KAAAq3K,GAAApjR,EAAAkzE,EAAAN,EAAA6lF,KAAAvlF,GAAA6mC,EAAA,EAAA,EAAAhO,KAAA++C,EAAA53E,EAAAlzE,GACA+5G,EAAA+rK,QACA/rK,EAAAgsK,UAAA,EAAAhsK,IA4PA2uJ,EAAAh/J,UAAAw+K,OA1HA,SAAAloR,GACA,GAAAA,GAAA,EAAA,OAAA,EACA,IAAA2pI,EAAA59B,KAAAy3K,GAAAxjR,EAAA+5G,EAAAhO,KAAA9jB,EAAA,EAAAjoF,EAAA,EAAA,EACA,GAAA+rG,KAAA++C,EAAA,EACA,GAAA,GAAAnhB,EAAA5vB,EAAAhO,KAAA0sD,KAAA,GAAAz4J,OACA,IAAA,IAAAkzE,EAAA64B,KAAA++C,EAAA,EAAA53E,GAAA,IAAAA,EAAA6mC,GAAA4vB,EAAA5vB,EAAAhO,KAAA0sD,KAAAvlF,IAAAlzE,EACA,OAAA+5G,GAqHA2uJ,EAAAh/J,UAAAy+K,YApDA,SAAAr9H,GACA,IAAAq9B,EAAAp8E,KAAA4wK,SAAAjU,EAAAkU,KACAx8Q,EAAA+nL,EAAAigG,kBACA,GAAAhoR,GAAA,EAAA,OAAA,EAIA,IAHA,IAEAwyE,EAFAmnC,EAAAouE,EAAAkgG,WAAAjoR,GACAm3Q,EAwBA,CAEAgI,UAAA,SAAA5lK,GACA,IAAA,IAAAzmC,EAAA,EAAAA,EAAAymC,EAAA3oC,SAAAkC,EACAymC,EAAAzmC,GAAAvB,KAAA6nC,MAAA,IAAA7nC,KAAAwoC,YA1BAjnC,EAAA,EAAAA,EAAA43E,IAAA53E,EAAA,CAEA,GACAN,EAAA,IAAA81L,EAAA38J,KAAAixK,YAAAzF,SAEA3kM,EAAAqqM,UAAAvU,EAAAkU,MAAA,GAAAhqM,EAAAqqM,UAAA90F,IAAA,GACA,IAAAvuE,EAAAhnC,EAAA6pM,OAAA1iK,EAAAhO,MACA,GAAA,GAAA6N,EAAAqjK,UAAAvU,EAAAkU,MAAA,GAAAhjK,EAAAqjK,UAAA90F,GAAA,CAEA,IADA,IAAA9qF,EAAA,EACAA,IAAAj9F,GAAA,GAAAw5G,EAAAqjK,UAAA90F,IAEA,GAAA,IADAvuE,EAAAA,EAAA0tK,UAAA,EAAAv7K,OACAkxK,UAAAvU,EAAAkU,KAAA,OAAA,EAEA,GAAA,GAAAhjK,EAAAqjK,UAAA90F,GAAA,OAAA,GAGA,OAAA,GAgCAugF,EAAAh/J,UAAA03B,MA3lBA,WAAA,IAAArnB,EAAAipK,IAAA,OAAAj3K,KAAA65K,OAAA7rK,GAAAA,GA4lBA2uJ,EAAAh/J,UAAAo+K,SAzlBA,WACA,GAAA/7K,KAAA9jB,EAAA,EAAA,CACA,GAAA,GAAA8jB,KAAA++C,EAAA,OAAA/+C,KAAA0sD,KAAA,GAAA1sD,KAAAy3K,GACA,GAAA,GAAAz3K,KAAA++C,EAAA,OAAA,MACA,CAAA,GAAA,GAAA/+C,KAAA++C,EAAA,OAAA/+C,KAAA0sD,KAAA,GACA,GAAA,GAAA1sD,KAAA++C,EAAA,OAAA,EAEA,OAAA/+C,KAAA0sD,KAAA,IAAA,GAAA,GAAA1sD,KAAAu3K,IAAA,IAAAv3K,KAAAu3K,GAAAv3K,KAAA0sD,KAAA,IAmlBAiwG,EAAAh/J,UAAA02K,UA/kBA,WAAA,OAAA,GAAAr0K,KAAA++C,EAAA/+C,KAAA9jB,EAAA8jB,KAAA0sD,KAAA,IAAA,IAAA,IAglBAiwG,EAAAh/J,UAAA4+K,WA7kBA,WAAA,OAAA,GAAAv8K,KAAA++C,EAAA/+C,KAAA9jB,EAAA8jB,KAAA0sD,KAAA,IAAA,IAAA,IA8kBAiwG,EAAAh/J,UAAAk+K,OAxkBA,WACA,OAAA77K,KAAA9jB,EAAA,GAAA,EACA8jB,KAAA++C,GAAA,GAAA,GAAA/+C,KAAA++C,GAAA/+C,KAAA0sD,KAAA,IAAA,EAAA,EACA,GAskBAiwG,EAAAh/J,UAAA6+K,YA/fA,WACA,IAAAr1M,EAAA64B,KAAA++C,EAAA/wC,EAAA,IAAAnQ,MACAmQ,EAAA,GAAAhO,KAAA9jB,EACA,IAAA0hD,EAAA12D,EAAA84B,KAAAu3K,GAAApwM,EAAA64B,KAAAu3K,GAAA,EAAAljR,EAAA,EACA,GAAA8yE,KAAA,EAGA,IAFAD,EAAA84B,KAAAu3K,KAAA35I,EAAA59B,KAAA0sD,KAAAvlF,IAAAD,KAAA84B,KAAA9jB,EAAA8jB,KAAAw3K,KAAAtwM,IACA8mC,EAAA35G,KAAAupI,EAAA59B,KAAA9jB,GAAA8jB,KAAAu3K,GAAArwM,GACAC,GAAA,GACAD,EAAA,GACA02D,GAAA59B,KAAA0sD,KAAAvlF,IAAA,GAAAD,GAAA,IAAA,EAAAA,EACA02D,GAAA59B,KAAA0sD,OAAAvlF,KAAAD,GAAA84B,KAAAu3K,GAAA,KAEA35I,EAAA59B,KAAA0sD,KAAAvlF,KAAAD,GAAA,GAAA,IACAA,GAAA,IAAAA,GAAA84B,KAAAu3K,KAAApwM,IAEA,IAAA,IAAAy2D,KAAAA,IAAA,KACA,GAAAvpI,IAAA,IAAA2rG,KAAA9jB,KAAA,IAAA0hD,MAAAvpI,GACAA,EAAA,GAAAupI,GAAA59B,KAAA9jB,KAAA8xB,EAAA35G,KAAAupI,GAGA,OAAA5vB,GA4eA2uJ,EAAAh/J,UAAAq8H,OAzeA,SAAAnzJ,GAAA,OAAA,GAAAm5B,KAAAkxK,UAAArqM,IA0eA81L,EAAAh/J,UAAA1D,IAzeA,SAAApzB,GAAA,OAAAm5B,KAAAkxK,UAAArqM,GAAA,EAAAm5B,KAAAn5B,GA0eA81L,EAAAh/J,UAAAh4B,IAzeA,SAAAkB,GAAA,OAAAm5B,KAAAkxK,UAAArqM,GAAA,EAAAm5B,KAAAn5B,GA0eA81L,EAAAh/J,UAAA8yB,IArdA,SAAA5pD,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAk0K,UAAArtM,EAAA8xM,EAAA3qK,GAAAA,GAsdA2uJ,EAAAh/J,UAAA+yB,GAldA,SAAA7pD,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAk0K,UAAArtM,EAAAktM,EAAA/lK,GAAAA,GAmdA2uJ,EAAAh/J,UAAAosK,IA/cA,SAAAljM,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAk0K,UAAArtM,EAAA+xM,EAAA5qK,GAAAA,GAgdA2uJ,EAAAh/J,UAAA8+K,OA5cA,SAAA51M,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAk0K,UAAArtM,EAAAgyM,EAAA7qK,GAAAA,GA6cA2uJ,EAAAh/J,UAAAjkG,IA1cA,WAEA,IADA,IAAAs0G,EAAAipK,IACA9vM,EAAA,EAAAA,EAAA64B,KAAA++C,IAAA53E,EAAA6mC,EAAA0+C,KAAAvlF,GAAA64B,KAAAw3K,IAAAx3K,KAAA0sD,KAAAvlF,GAGA,OAFA6mC,EAAA+wC,EAAA/+C,KAAA++C,EACA/wC,EAAA9xB,GAAA8jB,KAAA9jB,EACA8xB,GAscA2uJ,EAAAh/J,UAAAw2K,UAlcA,SAAAlgR,GACA,IAAA+5G,EAAAipK,IAEA,OADAhjR,EAAA,EAAA+rG,KAAAw6K,UAAAvmR,EAAA+5G,GAAAhO,KAAAo6K,SAAAnmR,EAAA+5G,GACAA,GAgcA2uJ,EAAAh/J,UAAA2+K,WA5bA,SAAAroR,GACA,IAAA+5G,EAAAipK,IAEA,OADAhjR,EAAA,EAAA+rG,KAAAo6K,UAAAnmR,EAAA+5G,GAAAhO,KAAAw6K,SAAAvmR,EAAA+5G,GACAA,GA0bA2uJ,EAAAh/J,UAAA0+K,gBA1aA,WACA,IAAA,IAAAl1M,EAAA,EAAAA,EAAA64B,KAAA++C,IAAA53E,EACA,GAAA,GAAA64B,KAAA0sD,KAAAvlF,GAAA,OAAAA,EAAA64B,KAAAu3K,GAAAuB,EAAA94K,KAAA0sD,KAAAvlF,IACA,OAAA64B,KAAA9jB,EAAA,EAAA8jB,KAAA++C,EAAA/+C,KAAAu3K,IACA,GAuaA5a,EAAAh/J,UAAA++K,SA5ZA,WAEA,IADA,IAAA1uK,EAAA,EAAAJ,EAAA5N,KAAA9jB,EAAA8jB,KAAAw3K,GACArwM,EAAA,EAAAA,EAAA64B,KAAA++C,IAAA53E,EAAA6mC,GAAA+qK,EAAA/4K,KAAA0sD,KAAAvlF,GAAAymC,GACA,OAAAI,GA0ZA2uJ,EAAAh/J,UAAAs2K,QAtZA,SAAAhgR,GACA,IAAAq9F,EAAA1rB,KAAA6nC,MAAAx5G,EAAA+rG,KAAAu3K,IACA,OAAAjmL,GAAA0O,KAAA++C,EAAA,GAAA/+C,KAAA9jB,EACA,IAAA8jB,KAAA0sD,KAAAp7D,GAAA,GAAAr9F,EAAA+rG,KAAAu3K,KAoZA5a,EAAAh/J,UAAAg/K,OAzYA,SAAA1oR,GAAA,OAAA+rG,KAAAi8K,UAAAhoR,EAAA8/Q,IA0YApX,EAAAh/J,UAAAi/K,SAvYA,SAAA3oR,GAAA,OAAA+rG,KAAAi8K,UAAAhoR,EAAA4kR,IAwYAlc,EAAAh/J,UAAAk/K,QArYA,SAAA5oR,GAAA,OAAA+rG,KAAAi8K,UAAAhoR,EAAA2kR,IAsYAjc,EAAAh/J,UAAA3e,IAnWA,SAAAnY,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAk8K,MAAAr1M,EAAAmnC,GAAAA,GAoWA2uJ,EAAAh/J,UAAAizK,SAjWA,SAAA/pM,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAA45K,MAAA/yM,EAAAmnC,GAAAA,GAkWA2uJ,EAAAh/J,UAAAkpK,SA/VA,SAAAhgM,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAw5K,WAAA3yM,EAAAmnC,GAAAA,GAgWA2uJ,EAAAh/J,UAAAhzE,OA7VA,SAAAk8C,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAs5K,SAAAzyM,EAAAmnC,EAAA,MAAAA,GA8VA2uJ,EAAAh/J,UAAAm/K,UA3VA,SAAAj2M,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAs5K,SAAAzyM,EAAA,KAAAmnC,GAAAA,GA4VA2uJ,EAAAh/J,UAAAo/K,mBAzVA,SAAAl2M,GACA,IAAAynC,EAAA2oK,IAAAjpK,EAAAipK,IAEA,OADAj3K,KAAAs5K,SAAAzyM,EAAAynC,EAAAN,GACA,IAAAnQ,MAAAyQ,EAAAN,IAuVA2uJ,EAAAh/J,UAAA+yK,OA/OA,SAAA38Q,EAAAmrF,GACA,IAAA7qF,EAAAkxN,EAAAp+I,EAAApzE,EAAAk9Q,YAAAjjK,EAAAkqK,EAAA,GACA,GAAA/wM,GAAA,EAAA,OAAA6mC,EACA35G,EAAA8yE,EAAA,GAAA,EACAA,EAAA,GAAA,EACAA,EAAA,IAAA,EACAA,EAAA,IAAA,EACA,EAEAo+I,EADAp+I,EAAA,EACA,IAAAixM,EAAAl5L,GACAA,EAAAi8L,SACA,IAAAjC,EAAAh6L,GAEA,IAAAm5L,EAAAn5L,GAGA,IAAAklI,EAAA,IAAAvmH,MAAA5pG,EAAA,EAAA+oR,EAAA3oR,EAAA,EAAAinR,GAAA,GAAAjnR,GAAA,EAEA,GADA+vN,EAAA,GAAAmB,EAAAhf,QAAAvmG,MACA3rG,EAAA,EAAA,CACA,IAAA4oR,EAAAhG,IAEA,IADA1xD,EAAAk0D,MAAAr1D,EAAA,GAAA64D,GACAhpR,GAAAqnR,GACAl3D,EAAAnwN,GAAAgjR,IACA1xD,EAAAg0D,MAAA0D,EAAA74D,EAAAnwN,EAAA,GAAAmwN,EAAAnwN,IACAA,GAAA,EAIA,IAAAwwN,EAAA1lE,EAAAztD,EAAAv9F,EAAAgrJ,EAAA,EAAAm+H,GAAA,EAAA9gB,EAAA6a,IAEA,IADA9vM,EAAAgxM,EAAApkR,EAAA24J,KAAAp7D,IAAA,EACAA,GAAA,GAAA,CAQA,IAPAnqB,GAAA61M,EAAAv4D,EAAA1wN,EAAA24J,KAAAp7D,IAAAnqB,EAAA61M,EAAA1B,GAEA72D,GAAA1wN,EAAA24J,KAAAp7D,IAAA,GAAAnqB,EAAA,GAAA,IAAA61M,EAAA71M,EACAmqB,EAAA,IAAAmzH,GAAA1wN,EAAA24J,KAAAp7D,EAAA,IAAA0O,KAAAu3K,GAAApwM,EAAA61M,IAGA/oR,EAAAI,EACA,IAAA,EAAAowN,IAAAA,IAAA,IAAAxwN,EAEA,IADAkzE,GAAAlzE,GAAA,IAAAkzE,GAAA64B,KAAAu3K,KAAAjmL,GACA4rL,EACA94D,EAAAK,GAAAo1D,OAAA7rK,GACAkvK,GAAA,MACA,CACA,KAAAjpR,EAAA,GAAAsxN,EAAAk0D,MAAAzrK,EAAAouJ,GAAA72C,EAAAk0D,MAAArd,EAAApuJ,GAAA/5G,GAAA,EACAA,EAAA,EAAAsxN,EAAAk0D,MAAAzrK,EAAAouJ,IAAAr9G,EAAA/wC,EAAAA,EAAAouJ,EAAAA,EAAAr9G,GACAwmE,EAAAg0D,MAAAnd,EAAAh4C,EAAAK,GAAAz2G,GAGA,KAAA1c,GAAA,GAAA,IAAAv9F,EAAA24J,KAAAp7D,GAAA,GAAAnqB,IACAo+I,EAAAk0D,MAAAzrK,EAAAouJ,GAAAr9G,EAAA/wC,EAAAA,EAAAouJ,EAAAA,EAAAr9G,IACA53E,EAAA,IAAAA,EAAA64B,KAAAu3K,GAAA,IAAAjmL,GAGA,OAAAi0H,EAAA8zD,OAAArrK,IA0LA2uJ,EAAAh/J,UAAAqzK,WAjJA,SAAA9xL,GACA,IAAAi+L,EAAAj+L,EAAAi8L,SACA,GAAAn7K,KAAAm7K,UAAAgC,GAAA,GAAAj+L,EAAA28L,SAAA,OAAAlf,EAAAgd,KAGA,IAFA,IAAAzlF,EAAAh1G,EAAAm2C,QAAAyvC,EAAA9kE,KAAAq1B,QACAxuD,EAAAqxM,EAAA,GAAA5+L,EAAA4+L,EAAA,GAAAzrM,EAAAyrM,EAAA,GAAAt6I,EAAAs6I,EAAA,GACA,GAAAhkF,EAAA2nF,UAAA,CACA,KAAA3nF,EAAAinF,UACAjnF,EAAAsmF,SAAA,EAAAtmF,GACAipF,GACAt2M,EAAAs0M,UAAA7hM,EAAA6hM,WAAAt0M,EAAAq1M,MAAAl8K,KAAAn5B,GAAAyS,EAAAsgM,MAAA16L,EAAA5F,IACAzS,EAAA2zM,SAAA,EAAA3zM,IACAyS,EAAA6hM,UAAA7hM,EAAAsgM,MAAA16L,EAAA5F,GACAA,EAAAkhM,SAAA,EAAAlhM,GAEA,KAAAwrF,EAAAq2G,UACAr2G,EAAA01G,SAAA,EAAA11G,GACAq4G,GACA1wM,EAAA0uM,UAAAv9I,EAAAu9I,WAAA1uM,EAAAyvM,MAAAl8K,KAAAvzB,GAAAmxD,EAAAg8I,MAAA16L,EAAA0+C,IACAnxD,EAAA+tM,SAAA,EAAA/tM,IACAmxD,EAAAu9I,UAAAv9I,EAAAg8I,MAAA16L,EAAA0+C,GACAA,EAAA48I,SAAA,EAAA58I,GAEAs2D,EAAAg9E,UAAApsG,IAAA,GACAovB,EAAA0lF,MAAA90G,EAAAovB,GACAipF,GAAAt2M,EAAA+yM,MAAAntM,EAAA5F,GACAyS,EAAAsgM,MAAAh8I,EAAAtkD,KAEAwrF,EAAA80G,MAAA1lF,EAAApvB,GACAq4G,GAAA1wM,EAAAmtM,MAAA/yM,EAAA4F,GACAmxD,EAAAg8I,MAAAtgM,EAAAskD,IAGA,OAAA,GAAAknC,EAAAosG,UAAAvU,EAAAkU,KAAAlU,EAAAgd,KACA/7I,EAAAszI,UAAAhyL,IAAA,EAAA0+C,EAAAgzI,SAAA1xL,GACA0+C,EAAAi+I,SAAA,GAAAj+I,EAAAs+I,MAAAh9L,EAAA0+C,GACAA,EAAAi+I,SAAA,EAAAj+I,EAAA5+C,IAAAE,GAAA0+C,GADAA,GAgHA++H,EAAAh/J,UAAA0hI,IAvTA,SAAAtrO,GAAA,OAAAisG,KAAAz4B,IAAAxzE,EAAA,IAAAilR,IAwTArc,EAAAh/J,UAAAwzK,IAxLA,SAAAtqM,GACA,IAAA+mC,EAAA5N,KAAA9jB,EAAA,EAAA8jB,KAAAo7K,SAAAp7K,KAAAq1B,QACAxnB,EAAAhnC,EAAAqV,EAAA,EAAArV,EAAAu0M,SAAAv0M,EAAAwuD,QACA,GAAAznB,EAAAsjK,UAAArjK,GAAA,EAAA,CAAA,IAAAkxC,EAAAnxC,EAAAA,EAAAC,EAAAA,EAAAkxC,EACA,IAAA53E,EAAAymC,EAAAyuK,kBAAAj4D,EAAAv2G,EAAAwuK,kBACA,GAAAj4D,EAAA,EAAA,OAAAx2G,EAMA,IALAzmC,EAAAi9I,IAAAA,EAAAj9I,GACAi9I,EAAA,IACAx2G,EAAA4sK,SAAAp2D,EAAAx2G,GACAC,EAAA2sK,SAAAp2D,EAAAv2G,IAEAD,EAAAiuK,SAAA,IACA10M,EAAAymC,EAAAyuK,mBAAA,GAAAzuK,EAAA4sK,SAAArzM,EAAAymC,IACAzmC,EAAA0mC,EAAAwuK,mBAAA,GAAAxuK,EAAA2sK,SAAArzM,EAAA0mC,GACAD,EAAAsjK,UAAArjK,IAAA,GACAD,EAAAgsK,MAAA/rK,EAAAD,GACAA,EAAA4sK,SAAA,EAAA5sK,KAEAC,EAAA+rK,MAAAhsK,EAAAC,GACAA,EAAA2sK,SAAA,EAAA3sK,IAIA,OADAu2G,EAAA,GAAAv2G,EAAAusK,SAAAh2D,EAAAv2G,GACAA,GAkKA8uJ,EAAAh/J,UAAA22K,gBA1GA,SAAAv1H,GACA,IAAA53E,EAAAymC,EAAA5N,KAAAm6J,MACA,GAAA,GAAAvsJ,EAAAmxC,GAAAnxC,EAAA8+C,KAAA,IAAAgvH,EAAAA,EAAAz2M,OAAA,GAAA,CACA,IAAAkC,EAAA,EAAAA,EAAAu0M,EAAAz2M,SAAAkC,EACA,GAAAymC,EAAA8+C,KAAA,IAAAgvH,EAAAv0M,GAAA,OAAA,EACA,OAAA,EAEA,GAAAymC,EAAAutK,SAAA,OAAA,EAEA,IADAh0M,EAAA,EACAA,EAAAu0M,EAAAz2M,QAAA,CAEA,IADA,IAAAia,EAAAw8L,EAAAv0M,GAAAmqB,EAAAnqB,EAAA,EACAmqB,EAAAoqL,EAAAz2M,QAAAia,EAAAy8L,GAAAz8L,GAAAw8L,EAAApqL,KAEA,IADApS,EAAA0uB,EAAAuuK,OAAAj9L,GACA/X,EAAAmqB,MAAApS,EAAAw8L,EAAAv0M,MAAA,EAAA,OAAA,EAEA,OAAAymC,EAAAwuK,YAAAr9H,mDC9lCA,IAAAigG,EAAAzrP,EAAA,WACAA,EAAA,UACAA,EAAA,YACAA,EAAA,UAGA,IAAAkiR,EAAApiR,EAAAC,QAAA0rP,EAAAy2B,MAAAz2B,EAAAy2B,OAAA,GAiNA,SAAA2H,EAAA78B,EAAA88B,EAAAhqK,GAEAA,IACAA,EAAA2rI,EAAAie,GAAAh9B,KAAA/rO,UAIA,IAFA,IAAA6qJ,EAAA,GACAx7D,EAAA3d,KAAAwhL,KAAAi2B,EAAAhqK,EAAA6sJ,cACA/4L,EAAA,EAAAA,EAAAoc,IAAApc,EAAA,CACA,IAAAsF,EAAApG,OAAA67C,aACA/6C,GAAA,GAAA,IAAAA,GAAA,GAAA,IAAAA,GAAA,EAAA,IAAA,IAAAA,GACAksC,EAAAr+B,QACAq+B,EAAAsiD,OAAA4qF,EAAA9zK,GACAsyE,GAAA1rC,EAAA6lH,SAAAkoB,WAEA,OAAAriG,EAAAjjD,UAAA,EAAAuhL,GA3MA5H,EAAAC,gBAAA,SAAA1gR,EAAA2kF,EAAAhlF,GAEA,IAAAo8G,EACAwvI,EACA0c,EACAqgB,EAEA,iBAAA3oR,GACAo8G,EAAAp8G,EACA4rP,EAAAlqK,UAAA,SAAA3gF,EACAunQ,EAAA5mL,UAAA,SAAA3gF,GACAf,IACAo8G,EAAAp8G,EAAAo8G,YAAAr7G,EACA6qP,EAAA5rP,EAAA4rP,WAAA7qP,EACAunQ,EAAAtoQ,EAAAsoQ,SAAAvnQ,EACAf,EAAA4oR,MAAA5oR,EAAA4oR,KAAAtgB,KACAqgB,EAAA3oR,EAAA4oR,KAAAtgB,KAKAA,EAGAA,EAAAjoL,QAFAioL,EAAAje,EAAAie,GAAAh9B,KAAA/rO,SAMAopR,IACAA,EAAArgB,GAIA,IAAAugB,EAAA53M,KAAAwhL,KAAApyP,EAAAf,EAAAg9Q,YAAA,GACAwM,EAAAD,EAAA,EAAAvgB,EAAAiD,aAAA,EACA,GAAAvmL,EAAA1U,OAAAw4M,EAIA,MAHAluM,EAAA,IAAAupB,MAAA,iDACA7zB,OAAA0U,EAAA1U,OACAsK,EAAAkuM,UAAAA,EACAluM,EAGAwhC,IACAA,EAAA,IAEAksJ,EAAAtnG,OAAA5kD,EAAA,OAKA,IAJA,IAAA2sK,EAAAzgB,EAAA/jC,SAEAykD,EAAA,GACAC,EAAAH,EAAA9jM,EAAA1U,OACAkC,EAAA,EAAAA,EAAAy2M,EAAAz2M,IACAw2M,GAAA,KAGA,IAAApG,EAAAmG,EAAAt8B,WAAAu8B,EAAA,IAAAhkM,EAEA,GAAA4mK,GAEA,GAAAA,EAAAt7K,SAAAg4L,EAAAiD,aAAA,CACA,IAAA3wL,EAIA,MAJAA,EAAA,IAAAupB,MAAA,2EAEA+kL,WAAAt9B,EAAAt7K,OACAsK,EAAA2wL,aAAAjD,EAAAiD,aACA3wL,QANAgxK,EAAAvB,EAAA5wI,OAAAgzI,SAAA6b,EAAAiD,cASA,IAAA4d,EAAAV,EAAA78B,EAAAi9B,EAAAvgB,EAAAiD,aAAA,EAAAod,GACAS,EAAA/+B,EAAAp/I,KAAAs2J,SAAAqhB,EAAAuG,EAAAvG,EAAAtyM,QAEA+4M,EAAAZ,EAAAW,EAAA9gB,EAAAiD,aAAAod,GACAW,EAAAj/B,EAAAp/I,KAAAs2J,SAAA3V,EAAAy9B,EAAAz9B,EAAAt7K,QAGA,MAAA,KAAAg5M,EAAAF,GAoBAtI,EAAAI,gBAAA,SAAA7gR,EAAA88Q,EAAAn9Q,GAEA,IAAAo8G,EACAksJ,EACAqgB,EAEA,iBAAA3oR,GACAo8G,EAAAp8G,EACAsoQ,EAAA5mL,UAAA,SAAA3gF,GACAf,IACAo8G,EAAAp8G,EAAAo8G,YAAAr7G,EACAunQ,EAAAtoQ,EAAAsoQ,SAAAvnQ,EACAf,EAAA4oR,MAAA5oR,EAAA4oR,KAAAtgB,KACAqgB,EAAA3oR,EAAA4oR,KAAAtgB,KAKA,IAAAugB,EAAA53M,KAAAwhL,KAAApyP,EAAAf,EAAAg9Q,YAAA,GAEA,GAAAa,EAAA7sM,SAAAu4M,EAIA,MAHAjuM,EAAA,IAAAupB,MAAA,kDACA7zB,OAAA6sM,EAAA7sM,OACAsK,EAAA2uM,eAAAV,EACAjuM,EAeA,QAXA75E,IAAAunQ,EACAA,EAAAje,EAAAie,GAAAh9B,KAAA/rO,SAEA+oQ,EAAAjoL,QAIAsoM,IACAA,EAAArgB,GAGAugB,EAAA,EAAAvgB,EAAAiD,aAAA,EACA,MAAA,IAAApnK,MAAA,sDAGAiY,IACAA,EAAA,IAEAksJ,EAAAtnG,OAAA5kD,EAAA,OAoBA,IAnBA,IAAA2sK,EAAAzgB,EAAA/jC,SAAAkoB,WAGAvzI,EAAAikK,EAAAv5K,OAAA,GACA0lL,EAAAnM,EAAAh2K,UAAA,EAAAmhK,EAAAiD,aAAA,GACA6d,EAAAjM,EAAAh2K,UAAA,EAAAmhK,EAAAiD,cAEA8d,EAAAZ,EAAAW,EAAA9gB,EAAAiD,aAAAod,GACA/8B,EAAAvB,EAAAp/I,KAAAs2J,SAAA+nB,EAAAD,EAAAC,EAAAh5M,QAEA64M,EAAAV,EAAA78B,EAAAi9B,EAAAvgB,EAAAiD,aAAA,EAAAod,GACAa,EAAAn/B,EAAAp/I,KAAAs2J,SAAA6nB,EAAAD,EAAAC,EAAA94M,QAEAm5M,EAAAD,EAAAriL,UAAA,EAAAmhK,EAAAiD,cAGA3wL,EAAA,OAAAs+B,EAGA1mC,EAAA,EAAAA,EAAA81L,EAAAiD,eAAA/4L,EACAoI,GAAAmuM,EAAAnlL,OAAApxB,KAAAi3M,EAAA7lL,OAAApxB,GAQA,IAFA,IAAAk3M,EAAA,EACA94M,EAAA03L,EAAAiD,aACA5uK,EAAA2rK,EAAAiD,aAAA5uK,EAAA6sL,EAAAl5M,OAAAqsB,IAAA,CACA,IAAAj8F,EAAA8oR,EAAAlmM,WAAAqZ,GAEAgtL,EAAA,EAAAjpR,EAAA,EAGAkpR,EAAAF,EAAA,MAAA,EACA9uM,GAAAl6E,EAAAkpR,EAIAh5M,GADA84M,GAAAC,EAIA,GAAA/uM,GAAA,IAAA4uM,EAAAlmM,WAAA1S,GACA,MAAA,IAAAuzB,MAAA,+BAGA,OAAAqlL,EAAAriL,UAAAv2B,EAAA,wGC1PA,IAAAy5K,EAAAzrP,EAAA,WACAA,EAAA,QACAA,EAAA,UAEA,IAAA0sO,EAAA5sO,EAAAC,QAAA0rP,EAAA/e,KAAA+e,EAAA/e,MAAA,GACA+e,EAAAie,GAAAh9B,KAAA+e,EAAAie,GAAAiH,WAAAjkC,KAAAA,EAOAA,EAAA/rO,OAAA,WAEAs4Q,IAgLAC,EAAApmM,OAAA67C,aAAA,KACAuqJ,GAAAztB,EAAAp/I,KAAAq2J,WAAA5vL,OAAA67C,aAAA,GAAA,IAGAsqJ,GAAA,GA/KA,IAAAG,EAAA,KAGArI,EAAAtlB,EAAAp/I,KAAAyvJ,eAGAyS,EAAA,IAAAjkK,MAAA,IAGAo/J,EAAA,CACAM,UAAA,OACA4C,YAAA,GACAD,aAAA,GAEA0M,cAAA,EAEAC,kBAAA,KAEAC,kBAAA,EAQA93L,MAAA,WAEAioL,EAAA2P,cAAA,EAGA3P,EAAA4P,kBAAA5P,EAAA8P,gBAAA,GAEA,IADA,IAAAC,EAAA/P,EAAA6P,kBAAA,EACA3lM,EAAA,EAAAA,EAAA6lM,IAAA7lM,EACA81L,EAAA4P,kBAAA/hM,KAAA,GAUA,OARAw5L,EAAAtlB,EAAAp/I,KAAAyvJ,eACAsd,EAAA,CACAM,GAAA,WACAC,GAAA,WACAC,GAAA,WACAC,GAAA,UACAC,GAAA,YAEApQ,IAmHA,OAhHAA,EAAAjoL,QAYAioL,EAAAtnG,OAAA,SAAAlmF,EAAA8sJ,GACA,SAAAA,IACA9sJ,EAAAuvK,EAAAp/I,KAAAy0J,WAAA5kL,IAIA,IAAA2zB,EAAA3zB,EAAAxK,OACAg4L,EAAA2P,eAAAxpK,EACAA,EAAA,CAAAA,EAAA,aAAA,EAAAA,IAAA,GACA,IAAA,IAAAj8B,EAAA81L,EAAA4P,kBAAA5nM,OAAA,EAAAkC,GAAA,IAAAA,EACA81L,EAAA4P,kBAAA1lM,IAAAi8B,EAAA,GACAA,EAAA,GAAAA,EAAA,IAAA65J,EAAA4P,kBAAA1lM,GAAA,aAAA,GACA81L,EAAA4P,kBAAA1lM,GAAA81L,EAAA4P,kBAAA1lM,KAAA,EACAi8B,EAAA,GAAAA,EAAA,GAAA,aAAA,EAcA,OAVAkhK,EAAA/U,SAAA9/K,GAGAg+L,EAAAd,EAAA7K,EAAAwC,IAGAA,EAAAtzC,KAAA,MAAA,IAAAszC,EAAAr/L,WACAq/L,EAAApP,UAGA+H,GAQAA,EAAA/jC,OAAA,WAqBA,IAAAw0C,EAAA1uB,EAAAp/I,KAAAyvJ,eACAqe,EAAAne,SAAA+U,EAAA3rC,SAGA,IAYAv7I,EALAsnL,EANAzH,EAAA4P,kBAAA5P,EAAA4P,kBAAA5nM,OAAA,GACAg4L,EAAA6P,kBAKA7P,EAAAkD,YAAA,EACAuN,EAAAne,SAAAkd,EAAA5mM,OAAA,EAAAo3L,EAAAkD,YAAAuE,IAMA,IADA,IAAAtqC,EAAA,EAAA6iC,EAAA4P,kBAAA,GACA1lM,EAAA,EAAAA,EAAA81L,EAAA4P,kBAAA5nM,OAAA,IAAAkC,EAGAizJ,IAFAh9I,EAAA,EAAA6/K,EAAA4P,kBAAA1lM,EAAA,IACA,aAAA,EAEAumM,EAAAnZ,SAAAn6B,IAAA,GACAA,EAAAh9I,IAAA,EAEAswL,EAAAnZ,SAAAn6B,GAEA,IAAAtkC,EAAA,CACAm3E,GAAAN,EAAAM,GACAC,GAAAP,EAAAO,GACAC,GAAAR,EAAAQ,GACAC,GAAAT,EAAAS,GACAC,GAAAV,EAAAU,IAEAI,EAAA33E,EAAAgsE,EAAA4L,GACA,IAAAtc,EAAApS,EAAAp/I,KAAAyvJ,eAMA,OALA+B,EAAAmD,SAAAz+D,EAAAm3E,IACA7b,EAAAmD,SAAAz+D,EAAAo3E,IACA9b,EAAAmD,SAAAz+D,EAAAq3E,IACA/b,EAAAmD,SAAAz+D,EAAAs3E,IACAhc,EAAAmD,SAAAz+D,EAAAu3E,IACAjc,GAGA6L,GAIA,IAAAwP,EAAA,KACAD,GAAA,EAqBA,SAAAiB,EAAAvxL,EAAAuoI,EAAAkU,GAIA,IAFA,IAAA55E,EAAAl4E,EAAAyS,EAAA7M,EAAAmxD,EAAA7pI,EAAAozE,EACAi8B,EAAAu1H,EAAA1zJ,SACAm+B,GAAA,IAAA,CAaA,IAPAv8B,EAAAqV,EAAA+wL,GACA3zL,EAAA4C,EAAAgxL,GACAzgM,EAAAyP,EAAAixL,GACAvvI,EAAA1hD,EAAAkxL,GACAr5Q,EAAAmoF,EAAAmxL,GAGAlmM,EAAA,EAAAA,EAAA,KAAAA,EACA43E,EAAA45E,EAAAk8B,WACApwC,EAAAt9I,GAAA43E,EAEAA,GAAAl4E,GAAA,EAAAA,IAAA,KADA+2D,EAAAtkD,GAAA7M,EAAAmxD,IACA7pI,EAAA,WAAAgrJ,EACAhrJ,EAAA6pI,EACAA,EAAAnxD,EAEAA,GAAA6M,GAAA,GAAAA,IAAA,KAAA,EACAA,EAAAzS,EACAA,EAAAk4E,EAEA,KAAA53E,EAAA,KAAAA,EAEA43E,GADAA,EAAA0lE,EAAAt9I,EAAA,GAAAs9I,EAAAt9I,EAAA,GAAAs9I,EAAAt9I,EAAA,IAAAs9I,EAAAt9I,EAAA,MACA,EAAA43E,IAAA,GACA0lE,EAAAt9I,GAAA43E,EAEAA,GAAAl4E,GAAA,EAAAA,IAAA,KADA+2D,EAAAtkD,GAAA7M,EAAAmxD,IACA7pI,EAAA,WAAAgrJ,EACAhrJ,EAAA6pI,EACAA,EAAAnxD,EAEAA,GAAA6M,GAAA,GAAAA,IAAA,KAAA,EACAA,EAAAzS,EACAA,EAAAk4E,EAGA,KAAA53E,EAAA,KAAAA,EAEA43E,GADAA,EAAA0lE,EAAAt9I,EAAA,GAAAs9I,EAAAt9I,EAAA,GAAAs9I,EAAAt9I,EAAA,IAAAs9I,EAAAt9I,EAAA,MACA,EAAA43E,IAAA,GACA0lE,EAAAt9I,GAAA43E,EAEAA,GAAAl4E,GAAA,EAAAA,IAAA,KADAyS,EAAA7M,EAAAmxD,GACA7pI,EAAA,WAAAgrJ,EACAhrJ,EAAA6pI,EACAA,EAAAnxD,EAEAA,GAAA6M,GAAA,GAAAA,IAAA,KAAA,EACAA,EAAAzS,EACAA,EAAAk4E,EAEA,KAAA53E,EAAA,KAAAA,EAEA43E,GADAA,EAAA0lE,EAAAt9I,EAAA,GAAAs9I,EAAAt9I,EAAA,IAAAs9I,EAAAt9I,EAAA,IAAAs9I,EAAAt9I,EAAA,MACA,EAAA43E,IAAA,GACA0lE,EAAAt9I,GAAA43E,EAEAA,GAAAl4E,GAAA,EAAAA,IAAA,KADAyS,EAAA7M,EAAAmxD,GACA7pI,EAAA,WAAAgrJ,EACAhrJ,EAAA6pI,EACAA,EAAAnxD,EAEAA,GAAA6M,GAAA,GAAAA,IAAA,KAAA,EACAA,EAAAzS,EACAA,EAAAk4E,EAGA,KAAA53E,EAAA,KAAAA,EAEA43E,GADAA,EAAA0lE,EAAAt9I,EAAA,GAAAs9I,EAAAt9I,EAAA,IAAAs9I,EAAAt9I,EAAA,IAAAs9I,EAAAt9I,EAAA,MACA,EAAA43E,IAAA,GACA0lE,EAAAt9I,GAAA43E,EAEAA,GAAAl4E,GAAA,EAAAA,IAAA,KADAyS,EAAA7M,EAAAmxD,GAAAtkD,EAAA7M,IACA14E,EAAA,WAAAgrJ,EACAhrJ,EAAA6pI,EACAA,EAAAnxD,EAEAA,GAAA6M,GAAA,GAAAA,IAAA,KAAA,EACAA,EAAAzS,EACAA,EAAAk4E,EAGA,KAAA53E,EAAA,KAAAA,EAEA43E,GADAA,EAAA0lE,EAAAt9I,EAAA,GAAAs9I,EAAAt9I,EAAA,IAAAs9I,EAAAt9I,EAAA,IAAAs9I,EAAAt9I,EAAA,MACA,EAAA43E,IAAA,GACA0lE,EAAAt9I,GAAA43E,EAEAA,GAAAl4E,GAAA,EAAAA,IAAA,KADAyS,EAAA7M,EAAAmxD,GACA7pI,EAAA,WAAAgrJ,EACAhrJ,EAAA6pI,EACAA,EAAAnxD,EAEAA,GAAA6M,GAAA,GAAAA,IAAA,KAAA,EACAA,EAAAzS,EACAA,EAAAk4E,EAIA7iE,EAAA+wL,GAAA/wL,EAAA+wL,GAAApmM,EAAA,EACAqV,EAAAgxL,GAAAhxL,EAAAgxL,GAAA5zL,EAAA,EACA4C,EAAAixL,GAAAjxL,EAAAixL,GAAA1gM,EAAA,EACAyP,EAAAkxL,GAAAlxL,EAAAkxL,GAAAxvI,EAAA,EACA1hD,EAAAmxL,GAAAnxL,EAAAmxL,GAAAt5Q,EAAA,EAEAqvG,GAAA,oFCrTA,IAAA47I,EAAAzrP,EAAA,WACAA,EAAA,UACAA,EAAA,UACAA,EAAA,YAEA,WAGA,GAAAyrP,EAAA5wH,MACA/6H,EAAAC,QAAA0rP,EAAA5wH,UADA,CAMA,IAAAA,EAAA/6H,EAAAC,QAAA0rP,EAAA5wH,MAAA4wH,EAAA5wH,OAAA,GAEAuuI,EAAA3d,EAAA4d,KAAAD,WAGAqT,EAAA,CAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA6D,EAAA,IAAAlX,EAAA,MACAkX,EAAAF,QAAA,IACA,IAAAI,EAAA,SAAAnmK,EAAAC,GAAA,OAAAD,EAAAC,GA+BAugB,EAAAkkJ,sBAAA,SAAAl4C,EAAAzlO,EAAA0lK,GACA,mBAAA1lK,IACA0lK,EAAA1lK,EACAA,EAAA,IAKA,IAAA4oQ,GAHA5oQ,EAAAA,GAAA,IAGA4oQ,WAAA,WACA,iBAAAA,IACAA,EAAA,CAAA1qQ,KAAA0qQ,IAEAA,EAAA5oQ,QAAA4oQ,EAAA5oQ,SAAA,GAGA,IAAA62Q,EAAA72Q,EAAA62Q,MAAAxsB,EAAA5wI,OACAmlK,EAAA,CAEAC,UAAA,SAAA5lK,GAEA,IADA,IAAAt0B,EAAAkyL,EAAA1N,aAAAlwJ,EAAA3oC,QACAkC,EAAA,EAAAA,EAAAymC,EAAA3oC,SAAAkC,EACAymC,EAAAzmC,GAAAmS,EAAArB,WAAA9Q,KAKA,GAAA,aAAAo2L,EAAA1qQ,KACA,OAMA,SAAAunO,EAAAm5C,EAAA5+Q,EAAA0lK,GACA,GAAA,YAAA1lK,EACA,OA0DA,SAAAylO,EAAAm5C,EAAA5+Q,EAAA0lK,GAEA,GAAA,oBAAA+gG,OACA,OAAAojB,EAAApkD,EAAAm5C,EAAA5+Q,EAAA0lK,GAIA,IAAA3oD,EAAA+sK,EAAArkD,EAAAm5C,GAGA5X,EAAAhnQ,EAAAknQ,QACAoW,EAAAt9Q,EAAAs9Q,UAAA,IACAtiL,EAAA,GAAAsiL,EAAA,EACAC,EAAAv9Q,EAAAu9Q,cAAA,wBACA,IAAA,IAAAvW,EACA,OAAA3c,EAAAp/I,KAAAq7J,eAAA,SAAAxhK,EAAAyhK,GACAzhK,IAEAyhK,EAAA,GAEAS,EAAAT,EAAA,EACAp1K,OAKA,SAAAA,IAEA61K,EAAA/1L,KAAAD,IAAA,EAAAg2L,GAQA,IADA,IAAAE,EAAA,GACA10L,EAAA,EAAAA,EAAAw0L,IAAAx0L,EAEA00L,EAAA10L,GAAA,IAAAi0L,OAAA8W,GAKA,IAAA/qM,EAAA,EAAAA,EAAAw0L,IAAAx0L,EACA00L,EAAA10L,GAAA++F,iBAAA,UAAAw4G,GAiBA,IAAAlvG,GAAA,EACA,SAAAkvG,EAAA3qR,GAEA,IAAAy7K,EAAA,CAIA,EACA,IAAA9iB,EAAA34J,EAAA24J,KACA,GAAAA,EAAA8iB,MAAA,CAEA,IAAA,IAAAroG,EAAA,EAAAA,EAAA00L,EAAA52L,SAAAkC,EACA00L,EAAA10L,GAAA60L,YAGA,OADAxsF,GAAA,EACAnV,EAAA,KAAA,IAAAsiG,EAAAjwG,EAAAt+B,MAAA,KAIA1c,EAAAu/J,YAAA72C,IACA1oH,EAAA+sK,EAAArkD,EAAAm5C,IAIA,IAAAvtM,EAAA0rC,EAAAtT,SAAA,IAGArqG,EAAAq3K,OAAAgoF,YAAA,CACAptL,IAAAA,EACAisM,SAAAA,IAGAvgK,EAAA0iK,WAAAzkL,EAAA,KArEA7J,IAlFA64L,CAAAvkD,EAAAm5C,EAAA5+Q,EAAA0lK,GAEA,OAAAmkH,EAAApkD,EAAAm5C,EAAA5+Q,EAAA0lK,GAVAukH,CAAAxkD,EAAAm5C,EAAAhW,EAAA5oQ,QAAA0lK,GAGA,MAAA,IAAAvhE,MAAA,uCAAAykK,EAAA1qQ,OAUA,SAAA2rR,EAAApkD,EAAAm5C,EAAA5+Q,EAAA0lK,GAEA,IAAA3oD,EAAA+sK,EAAArkD,EAAAm5C,GASAsL,EA0KA,SAAAzkD,GACA,OAAAA,GAAA,IAAA,GACAA,GAAA,IAAA,GACAA,GAAA,IAAA,GACAA,GAAA,IAAA,GACAA,GAAA,IAAA,EACAA,GAAA,IAAA,EACAA,GAAA,IAAA,EACAA,GAAA,IAAA,EACAA,GAAA,IAAA,EACAA,GAAA,IAAA,EACAA,GAAA,KAAA,EACA,EAtLA0kD,CAAAptK,EAAAu/J,aACA,qBAAAt8Q,IACAkqR,EAAAlqR,EAAAoqR,kBAOA,IAAAC,EAAA,GACA,iBAAArqR,IACAqqR,EAAArqR,EAAAqqR,cAGAC,EAAAvtK,EAAA0oH,EAAAm5C,EAjBA,EAiBAsL,EAAAG,EAAA3kH,GAGA,SAAA4kH,EAAAvtK,EAAA0oH,EAAAm5C,EAAAO,EAAA+K,EAAAG,EAAA3kH,GACA,IAAArlF,GAAA,IAAA+oB,KACA,EAAA,CAMA,GAJA2T,EAAAu/J,YAAA72C,IACA1oH,EAAA+sK,EAAArkD,EAAAm5C,IAGA7hK,EAAA4iK,gBAAAuK,GACA,OAAAxkH,EAAA,KAAA3oD,GAGAA,EAAA0iK,WAAApE,EAAA8D,IAAA,GAAA,SACAkL,EAAA,IAAA,IAAAjhL,KAAA/oB,EAAAgqM,GAGAhgC,EAAAp/I,KAAAuzJ,cAAA,WACA8rB,EAAAvtK,EAAA0oH,EAAAm5C,EAAAO,EAAA+K,EAAAG,EAAA3kH,MAkHA,SAAAokH,EAAArkD,EAAAm5C,GACA,IAAA7hK,EAAA,IAAAirJ,EAAAviC,EAAAm5C,GAEAS,EAAA55C,EAAA,EAMA,OALA1oH,EAAAuiK,QAAAD,IACAtiK,EAAAwiK,UAAAvX,EAAAkU,IAAAsD,UAAAH,GAAAD,EAAAriK,GAGAA,EAAA0iK,WAAA,GAAA1iK,EAAA4wC,IAAAuxH,GAAAQ,YAAA,GACA3iK,GAhQA,uGCZA,aAcA,SAAAjU,EAAAoB,EAAAl4B,GACA,IAAA,MAAA3xE,KAAA2xE,EACAnzE,OAAAC,eAAAorG,EAAA7pG,EAAA,CACAtB,MAAAizE,EAAA3xE,GACA+pG,YAAA,EACAD,cAAA,IAIA,OAAAD,EA6CAxrG,EAAAC,QAnCA,SAAAmmG,EAAApkG,EAAAsxE,GACA,IAAA8yB,GAAA,iBAAAA,EACA,MAAA,IAAAsL,UAAA,oCAGAp+B,IACAA,EAAA,IAGA,iBAAAtxE,IACAsxE,EAAAtxE,EACAA,EAAA,IAGAA,IACAsxE,EAAAtxE,KAAAA,GAGA,IACA,OAAAooG,EAAAhE,EAAA9yB,GACA,MAAAwU,GACAxU,EAAAgT,QAAA8f,EAAA9f,QACAhT,EAAA6wC,MAAA/d,EAAA+d,MAEA,MAAA0nK,EAAA,aAEAA,EAAAvhL,UAAAnqG,OAAAU,OAAAV,OAAAywM,eAAAxqG,IAKA,OAFAgE,EAAA,IAAAyhL,EAAAv4M,iCC9DA,aAEA,MAAAwnJ,EAAA56N,EAAA,aACA4rR,EAAA5rR,EAAA,sBAEAF,EAAAC,QAAA,CAUAstP,OAAAttG,eAAAk/H,EAAAr7C,GACA,MACA0pB,EADA1yB,EAAAxqH,MAAAE,OACAO,OAAAouK,GACA9T,EAAAygB,EAAAjrR,SACA,aAAAwqQ,EAAA6C,QAAA1gB,EAAA1pB,iFCnBA,aAEA,MAAAtlI,EAAAt+F,EAAA,sBACA82P,EAAA92P,EAAA,2BAEA6rR,EAAA7rR,EAAA,gBAiFAF,EAAAC,QAAA,CACAY,OAnEA,UAAAqpQ,UACAA,EAAA,UAAA8hB,YACAA,EAAA,GAAA7B,UACAA,EAAA,GAAAtkD,OACAA,EAAA,UAAAomD,WACAA,EAAA,GAAAte,WACAA,EAAA,OACA,IACA,MAAAhzC,EAAAoxD,EAAA59L,MAoDA,OAnDAg8L,GAAA,EAmDA,CACA9b,QA1CApuH,eAAAoZ,EAAAyqE,GACA,MAAA0mC,EAAA7vC,EAAA69C,gBAAA,IAAApzC,WAAA6mD,IACAC,EAAAvxD,EAAA69C,gBAAA,IAAApzC,WAAA4mD,IACAG,EAAA,CAAA3sR,KAAA0qQ,EAAAkB,GAAA8gB,GAGAE,EAAA,CAAA5sR,KAAA,SAAAgrQ,KAAAA,EAAAmD,WAAAA,EAAA3tJ,KAAA,CAAAxgH,KAAAqmO,IACA70B,QAAA2pB,EAAAglD,OAAA0M,UAAA,MAAAr1B,EAAAlzB,GAAA,CAAAtkO,KAAA,WAAA,EAAA,CAAA,YAAA,eACA8sR,QAAA3xD,EAAAglD,OAAA4M,UAAAH,EAAAp7E,EAAA,CAAAxxM,KAAA0qQ,EAAAt4L,OAAAu4M,IAAA,EAAA,CAAA,YAGAqC,QAAA7xD,EAAAglD,OAAAtR,QAAA8d,EAAAG,EAAAjzH,GACA,OAAA76D,EAAA,CAAAgsK,EAAA2hB,EAAA/gB,GAAA,IAAAhmC,WAAAonD,MA+BAte,QAlBAjuH,eAAAoZ,EAAAyqE,GACA,MAAA0mC,EAAAnxG,EAAAtnF,MAAA,EAAAk6M,GACAC,EAAA7yH,EAAAtnF,MAAAk6M,EAAAA,EAAAD,GACAQ,EAAAnzH,EAAAtnF,MAAAk6M,EAAAD,GACAG,EAAA,CAAA3sR,KAAA0qQ,EAAAkB,GAAA8gB,GAGAE,EAAA,CAAA5sR,KAAA,SAAAgrQ,KAAAA,EAAAmD,WAAAA,EAAA3tJ,KAAA,CAAAxgH,KAAAqmO,IACA70B,QAAA2pB,EAAAglD,OAAA0M,UAAA,MAAAr1B,EAAAlzB,GAAA,CAAAtkO,KAAA,WAAA,EAAA,CAAA,YAAA,eACA8sR,QAAA3xD,EAAAglD,OAAA4M,UAAAH,EAAAp7E,EAAA,CAAAxxM,KAAA0qQ,EAAAt4L,OAAAu4M,IAAA,EAAA,CAAA,YAGAsC,QAAA9xD,EAAAglD,OAAAzR,QAAAie,EAAAG,EAAAE,GACA,OAAA,IAAApnD,WAAAqnD,wHC3EA,aAIAxsR,EAAAkuF,IAAA,CAAAu+L,EAAAzgL,QACA,MAAA0gL,EAAAD,EAAA/xD,QAAA+xD,EAAAhU,SAEA,IAAAiU,IAAAA,EAAAhN,OACA,MAAAx/Q,OAAAiqG,OACA,IAAA3E,MACA,gRAMA,CAAAzjG,KAAA,2BAIA,OAAA2qR,iCCtBA,aAEA,MAAAC,EAAA1sR,EAAA,8BACA0rP,EAAA1rP,EAAA,YACA4kO,EAAA5kO,EAAA,sBACA8kO,EAAA9kO,EAAA,yBAEAA,EAAA,yBACAA,EAAA,0BACA,MAAAyrP,EAAAzrP,EAAA,wBAEAy6N,EAAAz6N,EAAA,SACA2sR,EAAA3sR,EAAA,UACA4sR,EAAA5sR,EAAA,cAEA,MAAA6sR,EACAvpR,YAAA7B,GACAgrG,KAAAjD,KAAA/nG,EAGA6B,aAAA61J,EAAA2zH,GACA,OAAAryD,EAAAsyD,cAAAtgL,KAAAjD,KAAAsjL,EAAA3zH,GAGA71J,UACA,OAAAm3N,EAAAuyD,MAAAC,UAAAxgL,KAAAjD,MAGA47H,YACA,OAAAunD,EAAA1/B,UAAAl9I,OAAA,CACAs8I,KAAAsgC,EAAArgC,QAAAC,IACAH,KAAA3/I,KAAAygL,YACAhnD,SAGA5iO,QAAA8hO,GACA,OAAA3K,EAAA0zC,QAAA1hK,KAAAjD,KAAA47H,GAGA9hO,OAAA7B,GACA,OAAAmjO,EAAAn4H,KAAA24H,MAAA3jO,EAAA2jO,OAGA9hO,aACA,OAAAopR,EAAA5xD,aAAAruH,KAAA24H,MAAA,aAIA,MAAA+nD,EAGA7pR,YAAA7B,EAAA09Q,GACA1yK,KAAAjD,KAAA/nG,EACAgrG,KAAA2gL,WAAAjO,EAGA77Q,YACA,OAAAm3N,EAAA69C,gBAAA,IAGAh1Q,WAAA8iF,GACA,OAAAq0I,EAAA4yD,YAAA5gL,KAAAjD,KAAApjB,GAGA++I,aACA,IAAA14H,KAAA2gL,WACA,MAAA1hC,EAAA,IAAAnmJ,MAAA,2BAAA,2BAGA,OAAA,IAAAsnL,EAAApgL,KAAA2gL,YAGA9pR,QAAA8hO,GACA,OAAA3K,EAAAuzC,QAAAvhK,KAAAjD,KAAA47H,GAGA9hO,UACA,OAAAm3N,EAAAuyD,MAAAM,WAAA7gL,KAAAjD,MAGA47H,YACA,OAAAunD,EAAAxgC,WAAAp8I,OAAA,CACAs8I,KAAAsgC,EAAArgC,QAAAC,IACAH,KAAA3/I,KAAAygL,YACAhnD,SAGA5iO,OAAA7B,GACA,OAAAmjO,EAAAn4H,KAAA24H,MAAA3jO,EAAA2jO,OAGA9hO,aACA,OAAAopR,EAAA5xD,aAAAruH,KAAA24H,MAAA,YAYA9hO,WACA,MAAAw8G,QAAArT,KAAA04H,OAAArlH,OACA,OAAAglH,EAAAhlH,EAAA,aASAx8G,aAAAsgO,EAAAH,EAAA,UACA,GAAA,WAAAA,EAAA,CACA,MAAAnnB,EAAA,IAAAmvC,EAAAp/I,KAAA8zJ,WAAA1zJ,KAAAygL,WACAx/B,EAAAjC,EAAAiC,KAAAmO,QAAAv/C,GACA2iE,EAAAxzB,EAAA8B,IAAAmf,mBAAAhf,GAEAtsP,EAAA,CACA4oQ,UAAA,SACAh6K,MAAA,IACAk6K,SAAA,GACAL,aAAA,UAEA,OAAApe,EAAA8B,IAAA2e,qBAAA+S,EAAAr7C,EAAAxiO,GACA,GAAA,eAAAqiO,EACA,OAAAmpD,EAAAv9D,OAAA5iH,KAAA24H,MAAAxB,GAEA,MAAA8nB,EAAA,IAAAnmJ,MAAA,kBAAAk+H,uBAAA,8BA0BA3jO,EAAAC,QAAA,CACA8sR,aAAAA,EACAM,cAAAA,EACAjgC,sBAlBA,SAAA9nB,GACA,MAAAmoD,EAAA9yD,EAAAuyD,MAAAQ,UAAApoD,GACA,OAAA,IAAAynD,EAAAU,IAiBA/gC,uBAzBAzsG,eAAAqlF,GACA,MAAAmoD,EAAA9yD,EAAAuyD,MAAAS,WAAAroD,GACAxkO,QAAA65N,EAAAgN,oBAAA8lD,GACA,OAAA,IAAAJ,EAAAvsR,EAAAq+Q,WAAAr+Q,EAAAu+Q,YAuBAr4C,gBAVA/mF,eAAA8mF,GACA,MAAAjmO,QAAA65N,EAAA8mD,YAAA16C,GACA,OAAA,IAAAsmD,EAAAvsR,EAAAq+Q,WAAAr+Q,EAAAu+Q,YASAuO,QAhBA3tI,eAAAwtI,GACA,MAAA3sR,QAAA65N,EAAAgN,oBAAA8lD,GACA,OAAA,IAAAJ,EAAAvsR,EAAAq+Q,WAAAr+Q,EAAAu+Q,qTCpJA,aAEA,MAAApkD,EAAA/6N,EAAA,eASAy6N,EACA1uH,KAAA0uH,QAGA1uH,KAAA,SAQA45H,EAAA5lF,MAAAoZ,EAAAw0H,KACA,GAAA,oBAAA5hL,OAAA0uH,EACA,MAAA,IAAAl1H,MACA,6IAGA,OAAAooL,GACA,IAAA,OACA,OAAA,IAAAzoD,iBAAAzK,EAAAglD,OAAA95C,OAAA,CAAArmO,KAAA,SAAA65J,IACA,IAAA,WACA,OAAA,IAAA+rE,iBAAAzK,EAAAglD,OAAA95C,OAAA,CAAArmO,KAAA,WAAA65J,IACA,IAAA,WACA,OAAA,IAAA+rE,iBAAAzK,EAAAglD,OAAA95C,OAAA,CAAArmO,KAAA,WAAA65J,IACA,IAAA,eAAA,CACA,MAAA9uB,QAAAowF,EAAAglD,OAAA95C,OAAA,CAAArmO,KAAA,WAAA65J,GACA,OAAA,IAAA+rE,iBAAAzK,EAAAglD,OAAA95C,OAAA,CAAArmO,KAAA,WAAA+qI,IAEA,QACA,MAAA,IAAA9kC,MAAA,GAAAooL,oCAIA7tR,EAAAC,QAAA,CAKAwuK,QAAAo/G,GAAA5tI,MAAAoZ,GACAwsE,EAAAxsE,EAAAw0H,GAEAhoD,OAAAA,EAMA7K,aAAA/6E,MAAAi9E,EAAA2wD,EAAAj8M,KACA,MAAAwiG,QAAAyxD,EAAA3I,EAAA2wD,GACA,OAAA5yD,EAAAhrH,OAAAmkE,EAAAy5G,EAAAj8M,sDClDA,IAAA+5K,EAAAzrP,EAAA,WACAA,EAAA,QACAA,EAAA,UAEA,IAAA+pQ,EAAAjqQ,EAAAC,QAAA0rP,EAAAse,OAAAte,EAAAse,QAAA,GAGAte,EAAAie,GAAAK,OAAAte,EAAAie,GAAAiH,WAAA5G,OAAAA,EAGA,IAAA6jB,EAAAniC,EAAAmiC,OAAAniC,EAAAse,OAAA6jB,OAAAniC,EAAAse,OAAA6jB,QAAA,GACAA,EAAAjtR,OAAA,WACA,OAAAopQ,EAAAppQ,OAAA,YAEA8qP,EAAAie,GAAAkkB,OAAAniC,EAAAie,GAAAiH,WAAAid,OAAAA,EAGAniC,EAAAse,OAAAsO,OAAA5sB,EAAAse,OAAAsO,QAAA,CACA13Q,OAAA,WACA,OAAAopQ,EAAAppQ,OAAA,iBAGA8qP,EAAAie,GAAA,cAAAje,EAAAie,GAAAiH,WAAA,cACAllB,EAAAse,OAAAsO,OAGA5sB,EAAAse,OAAA8jB,OAAApiC,EAAAse,OAAA8jB,QAAA,CACAltR,OAAA,WACA,OAAAopQ,EAAAppQ,OAAA,iBAGA8qP,EAAAie,GAAA,cAAAje,EAAAie,GAAAiH,WAAA,cACAllB,EAAAse,OAAA8jB,OAUA9jB,EAAAppQ,OAAA,SAAAqpQ,GAUA,GARAiP,IAoNAC,EAAApmM,OAAA67C,aAAA,KACAuqJ,GAAAztB,EAAAp/I,KAAAq2J,WAAA5vL,OAAA67C,aAAA,GAAA,KAGAwqJ,EAAA,CACA,CAAA,WAAA,YAAA,CAAA,WAAA,WACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,UAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,UAAA,YACA,CAAA,UAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,WACA,CAAA,WAAA,WAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,WACA,CAAA,UAAA,YAAA,CAAA,UAAA,YACA,CAAA,UAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,WACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,UAAA,YAAA,CAAA,UAAA,WACA,CAAA,UAAA,YAAA,CAAA,UAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,WACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,WACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,UAAA,WACA,CAAA,UAAA,YAAA,CAAA,UAAA,YACA,CAAA,UAAA,YAAA,CAAA,UAAA,YACA,CAAA,UAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,WACA,CAAA,WAAA,WAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,WACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,UAAA,YAAA,CAAA,UAAA,YACA,CAAA,UAAA,YAAA,CAAA,UAAA,WACA,CAAA,UAAA,WAAA,CAAA,UAAA,YACA,CAAA,WAAA,WAAA,CAAA,WAAA,YACA,CAAA,WAAA,YAAA,CAAA,WAAA,YACA,CAAA,WAAA,WAAA,CAAA,WAAA,cAIA2U,EAAA,IACA,WAAA,CACA,CAAA,WAAA,YACA,CAAA,WAAA,YACA,CAAA,WAAA,YACA,CAAA,WAAA,YACA,CAAA,WAAA,YACA,CAAA,WAAA,WACA,CAAA,UAAA,YACA,CAAA,WAAA,YAEAA,EAAA,WAAA,CACA,CAAA,WAAA,YACA,CAAA,WAAA,WACA,CAAA,WAAA,WACA,CAAA,UAAA,YACA,CAAA,WAAA,YACA,CAAA,WAAA,YACA,CAAA,WAAA,YACA,CAAA,WAAA,aAEAA,EAAA,eAAA,CACA,CAAA,UAAA,YACA,CAAA,WAAA,YACA,CAAA,UAAA,YACA,CAAA,WAAA,YACA,CAAA,WAAA,YACA,CAAA,WAAA,YACA,CAAA,UAAA,WACA,CAAA,UAAA,aAEAA,EAAA,eAAA,CACA,CAAA,WAAA,WACA,CAAA,WAAA,YACA,CAAA,UAAA,WACA,CAAA,WAAA,YACA,CAAA,UAAA,YACA,CAAA,WAAA,UACA,CAAA,WAAA,YACA,CAAA,UAAA,aAIA7U,GAAA,QA3SA,IAAAjP,IACAA,EAAA,aAGAA,KAAA8jB,GACA,MAAA,IAAAvoL,MAAA,8BAAAykK,GAYA,IARA,IAAAoP,EAAA0U,EAAA9jB,GACA+jB,EAAA,KAGAhd,EAAAtlB,EAAAp/I,KAAAyvJ,eAGAyS,EAAA,IAAAjkK,MAAA,IACAgmK,EAAA,EAAAA,EAAA,KAAAA,EACA/B,EAAA+B,GAAA,IAAAhmK,MAAA,GAIA,IAAAqiK,EAAA,GACA,OAAA3C,GACA,IAAA,UACA2C,EAAA,GACA,MACA,IAAA,cACAA,EAAA,GACA,MACA,IAAA,cACAA,EAAA,GAKA,IAAAjD,EAAA,CAEAM,UAAAA,EAAArkL,QAAA,IAAA,IAAA9P,cACA+2L,YAAA,IACAD,aAAAA,EAEA0M,cAAA,EAEAC,kBAAA,KAEAC,kBAAA,GAQA93L,MAAA,WAEAioL,EAAA2P,cAAA,EAGA3P,EAAA4P,kBAAA5P,EAAAskB,iBAAA,GAEA,IADA,IAAAvU,EAAA/P,EAAA6P,kBAAA,EACA3lM,EAAA,EAAAA,EAAA6lM,IAAA7lM,EACA81L,EAAA4P,kBAAA/hM,KAAA,GAEAw5L,EAAAtlB,EAAAp/I,KAAAyvJ,eACAiyB,EAAA,IAAAzjL,MAAA8uK,EAAA1nM,QACA,IAAAkC,EAAA,EAAAA,EAAAwlM,EAAA1nM,SAAAkC,EACAm6M,EAAAn6M,GAAAwlM,EAAAxlM,GAAA/B,MAAA,GAEA,OAAA63L,IAyHA,OAtHAA,EAAAjoL,QAYAioL,EAAAtnG,OAAA,SAAAlmF,EAAA8sJ,GACA,SAAAA,IACA9sJ,EAAAuvK,EAAAp/I,KAAAy0J,WAAA5kL,IAIA,IAAA2zB,EAAA3zB,EAAAxK,OACAg4L,EAAA2P,eAAAxpK,EACAA,EAAA,CAAAA,EAAA,aAAA,EAAAA,IAAA,GACA,IAAA,IAAAj8B,EAAA81L,EAAA4P,kBAAA5nM,OAAA,EAAAkC,GAAA,IAAAA,EACA81L,EAAA4P,kBAAA1lM,IAAAi8B,EAAA,GACAA,EAAA,GAAAA,EAAA,IAAA65J,EAAA4P,kBAAA1lM,GAAA,aAAA,GACA81L,EAAA4P,kBAAA1lM,GAAA81L,EAAA4P,kBAAA1lM,KAAA,EACAi8B,EAAA,GAAAA,EAAA,GAAA,aAAA,EAcA,OAVAkhK,EAAA/U,SAAA9/K,GAGAg+L,EAAA6T,EAAAxf,EAAAwC,IAGAA,EAAAtzC,KAAA,MAAA,IAAAszC,EAAAr/L,WACAq/L,EAAApP,UAGA+H,GAQAA,EAAA/jC,OAAA,WAqBA,IAAAw0C,EAAA1uB,EAAAp/I,KAAAyvJ,eACAqe,EAAAne,SAAA+U,EAAA3rC,SAGA,IAYAv7I,EALAsnL,EANAzH,EAAA4P,kBAAA5P,EAAA4P,kBAAA5nM,OAAA,GACAg4L,EAAA6P,kBAKA7P,EAAAkD,YAAA,EACAuN,EAAAne,SAAAkd,EAAA5mM,OAAA,EAAAo3L,EAAAkD,YAAAuE,IAMA,IADA,IAAAtqC,EAAA,EAAA6iC,EAAA4P,kBAAA,GACA1lM,EAAA,EAAAA,EAAA81L,EAAA4P,kBAAA5nM,OAAA,IAAAkC,EAGAizJ,IAFAh9I,EAAA,EAAA6/K,EAAA4P,kBAAA1lM,EAAA,IACA,aAAA,EAEAumM,EAAAnZ,SAAAn6B,IAAA,GACAA,EAAAh9I,IAAA,EAEAswL,EAAAnZ,SAAAn6B,GAEA,IAAA3yD,EAAA,IAAA5pE,MAAAyjL,EAAAr8M,QACA,IAAAkC,EAAA,EAAAA,EAAAm6M,EAAAr8M,SAAAkC,EACAsgG,EAAAtgG,GAAAm6M,EAAAn6M,GAAA/B,MAAA,GAEAqoM,EAAAhmG,EAAAq6F,EAAA4L,GACA,IACA8T,EADApwB,EAAApS,EAAAp/I,KAAAyvJ,eAGAmyB,EADA,YAAAjkB,EACA91F,EAAAxiG,OACA,YAAAs4L,EACA91F,EAAAxiG,OAAA,EAEAwiG,EAAAxiG,OAAA,EAEA,IAAAkC,EAAA,EAAAA,EAAAq6M,IAAAr6M,EACAiqL,EAAAmD,SAAA9sF,EAAAtgG,GAAA,IACAA,IAAAq6M,EAAA,GAAA,gBAAAjkB,GACAnM,EAAAmD,SAAA9sF,EAAAtgG,GAAA,IAGA,OAAAiqL,GAGA6L,GAIA,IAAAwP,EAAA,KACAD,GAAA,EAGAE,EAAA,KAGA2U,EAAA,KA4GA,SAAA5T,EAAAvxL,EAAAuoI,EAAAkU,GAkBA,IAhBA,IAAA8oD,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EACAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACA/7M,EAAAk8K,EAAAC,EAAA6/B,EAAAC,EAAAC,EAAAC,EACAlgL,EAAAu1H,EAAA1zJ,SACAm+B,GAAA,KAAA,CAGA,IAAAj8B,EAAA,EAAAA,EAAA,KAAAA,EACAs9I,EAAAt9I,GAAA,GAAAwxJ,EAAAk8B,aAAA,EACApwC,EAAAt9I,GAAA,GAAAwxJ,EAAAk8B,aAAA,EAEA,KAAA1tL,EAAA,KAAAA,EAOAs6M,KAJAp+B,GADA8/B,EAAA1+D,EAAAt9I,EAAA,IACA,MAKA,IAJAm8K,EAAA6/B,EAAA,KAIA,KACA7/B,IAAA,GAAAD,GAAA,GACAA,IAAA,KAAA,EAEAq+B,IACAr+B,GAAA,GAAAC,IAAA,KACAA,GAAA,EAAAD,IAAA,KACAA,GAAA,GAAAC,IAAA,MAAA,EAQAq+B,KAJAt+B,GADAggC,EAAA5+D,EAAAt9I,EAAA,KACA,MAKA,GAJAm8K,EAAA+/B,EAAA,KAIA,KACAhgC,IAAA,EAAAC,GAAA,IACAD,IAAA,KAAA,EAEAu+B,IACAv+B,GAAA,GAAAC,IAAA,IACAD,GAAA,GAAAC,IAAA,IACAD,GAAA,GAAAC,IAAA,MAAA,EAGA8/B,EAAA3+D,EAAAt9I,EAAA,GACAm8M,EAAA7+D,EAAAt9I,EAAA,IACAm8K,EAAAo+B,EAAA0B,EAAA,GAAAxB,EAAA0B,EAAA,GACA7+D,EAAAt9I,GAAA,GAAAs6M,EAAA2B,EAAA,GAAAzB,EAAA2B,EAAA,IACAhgC,EAAA,aAAA,KAAA,EACA7+B,EAAAt9I,GAAA,GAAAm8K,IAAA,EAsBA,IAlBA6+B,EAAAjmM,EAAA,GAAA,GACAkmM,EAAAlmM,EAAA,GAAA,GACAmmM,EAAAnmM,EAAA,GAAA,GACAomM,EAAApmM,EAAA,GAAA,GACAqmM,EAAArmM,EAAA,GAAA,GACAsmM,EAAAtmM,EAAA,GAAA,GACAumM,EAAAvmM,EAAA,GAAA,GACAwmM,EAAAxmM,EAAA,GAAA,GACAymM,EAAAzmM,EAAA,GAAA,GACA0mM,EAAA1mM,EAAA,GAAA,GACA2mM,EAAA3mM,EAAA,GAAA,GACA4mM,EAAA5mM,EAAA,GAAA,GACA6mM,EAAA7mM,EAAA,GAAA,GACA8mM,EAAA9mM,EAAA,GAAA,GACA+mM,EAAA/mM,EAAA,GAAA,GACAgnM,EAAAhnM,EAAA,GAAA,GAGA/U,EAAA,EAAAA,EAAA,KAAAA,EAEA46M,IACAY,IAAA,GAAAC,GAAA,KACAD,IAAA,GAAAC,GAAA,KACAA,IAAA,EAAAD,GAAA,OAAA,EAOAX,GAAAe,EAAAJ,GAAAE,EAAAE,MAAA,EAIAlB,IACAM,IAAA,GAAAC,GAAA,IACAA,IAAA,EAAAD,GAAA,KACAC,IAAA,EAAAD,GAAA,OAAA,EACAL,IACAK,GAAA,EAAAC,IAAA,KACAA,GAAA,GAAAD,IAAA,IACAC,GAAA,GAAAD,IAAA,MAAA,EAGAF,GAAAE,EAAAE,EAAAE,GAAAJ,EAAAE,MAAA,EACAH,GAAAE,EAAAE,EAAAE,GAAAJ,EAAAE,MAAA,EAIAh/B,EAAA4/B,KAxBAP,GAAA,GAAAC,IAAA,KACAD,GAAA,GAAAC,IAAA,KACAA,GAAA,GAAAD,IAAA,MAAA,KAIAK,EAAAJ,GAAAE,EAAAE,MAAA,GAkBAtW,EAAAvlM,GAAA,GAAAs9I,EAAAt9I,GAAA,GACAs6M,EAAAwB,EAAAlB,EAAAC,EAAAtV,EAAAvlM,GAAA,GAAAs9I,EAAAt9I,GAAA,IACAm8K,EAAA,aAAA,KAAA,EACAo+B,EAAAp+B,IAAA,EAIAq+B,EAAAE,EAAAI,IADA3+B,EAAAw+B,EAAAI,GACA,aAAA,KAAA,EACAN,EAAAt+B,IAAA,EAEA2/B,EAAAF,EACAG,EAAAF,EAEAD,EAAAF,EACAG,EAAAF,EAEAD,EAAAF,EACAG,EAAAF,EAIAD,EAAAF,EAAAhB,IADAn+B,EAAAo/B,EAAAhB,GACA,aAAA,KAAA,EACAkB,EAAAt/B,IAAA,EAEAm/B,EAAAF,EACAG,EAAAF,EAEAD,EAAAF,EACAG,EAAAF,EAEAD,EAAAF,EACAG,EAAAF,EAIAD,EAAAV,EAAAE,IADAr+B,EAAAo+B,EAAAE,GACA,aAAA,KAAA,EACAQ,EAAA9+B,IAAA,EAIAA,EAAApnK,EAAA,GAAA,GAAAkmM,EACAlmM,EAAA,GAAA,GAAAA,EAAA,GAAA,GAAAimM,GAAA7+B,EAAA,aAAA,KAAA,EACApnK,EAAA,GAAA,GAAAonK,IAAA,EAEAA,EAAApnK,EAAA,GAAA,GAAAomM,EACApmM,EAAA,GAAA,GAAAA,EAAA,GAAA,GAAAmmM,GAAA/+B,EAAA,aAAA,KAAA,EACApnK,EAAA,GAAA,GAAAonK,IAAA,EAEAA,EAAApnK,EAAA,GAAA,GAAAsmM,EACAtmM,EAAA,GAAA,GAAAA,EAAA,GAAA,GAAAqmM,GAAAj/B,EAAA,aAAA,KAAA,EACApnK,EAAA,GAAA,GAAAonK,IAAA,EAEAA,EAAApnK,EAAA,GAAA,GAAAwmM,EACAxmM,EAAA,GAAA,GAAAA,EAAA,GAAA,GAAAumM,GAAAn/B,EAAA,aAAA,KAAA,EACApnK,EAAA,GAAA,GAAAonK,IAAA,EAEAA,EAAApnK,EAAA,GAAA,GAAA0mM,EACA1mM,EAAA,GAAA,GAAAA,EAAA,GAAA,GAAAymM,GAAAr/B,EAAA,aAAA,KAAA,EACApnK,EAAA,GAAA,GAAAonK,IAAA,EAEAA,EAAApnK,EAAA,GAAA,GAAA4mM,EACA5mM,EAAA,GAAA,GAAAA,EAAA,GAAA,GAAA2mM,GAAAv/B,EAAA,aAAA,KAAA,EACApnK,EAAA,GAAA,GAAAonK,IAAA,EAEAA,EAAApnK,EAAA,GAAA,GAAA8mM,EACA9mM,EAAA,GAAA,GAAAA,EAAA,GAAA,GAAA6mM,GAAAz/B,EAAA,aAAA,KAAA,EACApnK,EAAA,GAAA,GAAAonK,IAAA,EAEAA,EAAApnK,EAAA,GAAA,GAAAgnM,EACAhnM,EAAA,GAAA,GAAAA,EAAA,GAAA,GAAA+mM,GAAA3/B,EAAA,aAAA,KAAA,EACApnK,EAAA,GAAA,GAAAonK,IAAA,EAEAlgJ,GAAA,8GCpiBI47I,EAAQzrP,EAAQ,WACpBA,EAAQ,UACRA,EAAQ,YACRA,EAAQ,YACRA,EAAQ,cACJgwR,EAAgBhwR,EAAQ,oBACxB68Q,EAAqBmT,EAAcnT,mBACnCH,EAAsBsT,EAActT,4BAEf,IAAftT,MACJA,EAAa3d,EAAM4d,KAAKD,eAG1BjJ,EAAa1U,EAAMp/I,KAAK8zJ,WACxB8vB,OAAiC,IAAXvgC,EAAyBxqB,WAAawqB,EAMhEjE,EAAM8B,IAAM9B,EAAM8B,KAAAA,GAClBztP,EAAOC,QAAU0rP,EAAM8B,IAAIzB,QAAUL,EAAMK,QAAUL,EAAMK,SAAAA,OACvDA,EAAUL,EAAMK,QA+LpB,SAAAokC,EAA+B9uR,OACzBglF,EAAUhlF,EAAQglF,WACnBA,aAAmB8+I,YAAc9+I,aAAmB6pM,SAC9C7pM,MAGL4iJ,EAAW5nO,EAAQ4nO,iBACR7mO,IAAZikF,EAAYjkF,KACVf,EAAQsoQ,aAKCl4J,UAAU,oDAHpBprB,EAAUhlF,EAAQsoQ,GAAG/jC,SAASkoB,WAC9B7kB,EAAW,YAMO,iBAAZ5iJ,IAAyB4iJ,YACvBx3H,UAAU,qDAGA,iBAAZprB,EAAY,SACC,IAAXspK,SACDA,EAAOx5F,KAAK9vE,EAAS4iJ,GAE9B5iJ,EAAAA,IAAc+5K,EAAW/5K,EAAS4iJ,aACxB5iJ,aAAmB+5K,aACnB3uJ,UACR,sJAMA8qG,EAAAA,IAAa2zE,EAAa7pM,EAAQ1U,UAC9BkC,EAAI,EAAGA,EAAI0oI,EAAO5qI,SAAUkC,EAClC0oI,EAAO1oI,GAAKwS,EAAQyuB,GAAGjhC,UAElB0oI,EAnOTwvC,EAAQjjB,UAAAA,GACRijB,EAAQjjB,UAAUsnD,uBAAyB,GAC3CrkC,EAAQjjB,UAAUunD,wBAA0B,GAC5CtkC,EAAQjjB,UAAUwnD,iBAAmB,GACrCvkC,EAAQjjB,UAAUynD,iBAAmB,GACrCxkC,EAAQjjB,UAAU0nD,iBAAmB,GAErCzkC,EAAQhlB,gBAAkB,SAAS1lO,OAE7B4rP,GADJ5rP,EAAUA,GAAAA,IACS4rP,aACP7qP,IAAT6qP,EAEDA,EAAOvB,EAAM5wI,OAAO0vJ,aAAaze,EAAQjjB,UAAUwnD,0BAC3B,iBAATrjC,MACZA,EAAKt7K,SAAWo6K,EAAQjjB,UAAUwnD,2BACzB7+K,UACR,kBAAoBs6I,EAAQjjB,UAAUwnD,iBACtC,+BAEMrjC,aAAgB9nB,sBAChB1zH,UACR,oEAGJw7I,EAAOkjC,EAAAA,CAAuB9pM,QAAS4mK,EAAMhkB,SAAU,mBAEnDwnD,EAAAA,IAASP,EAAankC,EAAQjjB,UAAUsnD,wBACxCM,EAAAA,IAASR,EAAankC,EAAQjjB,UAAUunD,yBACpCx8M,EAAI,EAAGA,EAAI,KAAMA,EACvB68M,EAAG78M,GAAKo5K,EAAKp5K,UAiPjB,SAA6B48M,EAAIC,OAE3B78M,EADAD,EAAAA,CAAK+8M,IAAMA,IAAMA,IAAMA,KAGvBrmJ,EAAI0/H,EAAO0mB,EAAI,QACnBpmJ,EAAE,IAAM,IACRA,EAAE,KAAO,IACTA,EAAE,KAAO,GAETsmJ,EAAWh9M,EAAG02D,GACdumJ,EAAKJ,EAAI78M,GAELC,EAAI,EAAGA,EAAI,KAAMA,EACnB68M,EAAG78M,EAAI,IAAM48M,EAAG58M,GA5PlBi9M,CAAoBL,EAAIC,IAChBtR,UAAWqR,EAAIvR,WAAYwR,IAWrC3kC,EAAQ4gB,mBAAqB,SAASphK,OAChCmzJ,EAAAA,GACAj/H,EAAAA,OACQisH,EAAMiC,KAAKhlB,SAASp9H,EAAKoxK,EAAqBje,EAASj/H,GAC/Dqa,KACE79D,EAAAA,IAAYupB,MAAM,sBACtBvpB,EAAMwjD,OAASA,EACTxjD,MAEJsgL,EAAM7Q,EAAMiC,KAAK8O,SAASiC,EAAQqyB,eAClCC,EAAatlC,EAAMyT,KAAK8xB,cACzB10B,IAAQy0B,YACCxrL,MAAM,gBAAkB+2J,EAAM,mBACtCy0B,EAAa,UAEb9R,EAAaxgB,EAAQwgB,kBAUjBgS,gBAPcf,EAAAA,CACpB9pM,QAASqlK,EAAMiC,KAAKmO,QAAQojB,GAAY9+Q,MACxC6oO,SAAU,aAed8iB,EAAQm3B,kBAAoB,SAAS33K,OAE/BmzJ,EAAAA,GACAj/H,EAAAA,OACQisH,EAAMiC,KAAKhlB,SAASp9H,EAAKuxK,EAAoBpe,EAASj/H,GAC9Dqa,KACE79D,EAAAA,IAAYupB,MAAM,sBACtBvpB,EAAMwjD,OAASA,EACTxjD,MAEJsgL,EAAM7Q,EAAMiC,KAAK8O,SAASiC,EAAQykB,cAClC6N,EAAatlC,EAAMyT,KAAK8xB,cACzB10B,IAAQy0B,YACCxrL,MAAM,gBAAkB+2J,EAAM,mBACtCy0B,EAAa,UAEbG,EAAiBzyB,EAAQ0yB,oBAC1BD,EAAex/M,SAAWo6K,EAAQjjB,UAAUsnD,iCACnC5qL,MAAM,iCAEX2qL,EAAAA,CACL9pM,QAAS8qM,EACTloD,SAAU,YAId8iB,EAAQslC,wBAA0B,SAAShwR,OAErC69Q,EAAaiR,EAAAA,CACf9pM,SAFFhlF,EAAUA,GAAAA,IAES69Q,WAAYj2C,SAAU,cAEtCi2C,EAAWvtM,SAAWo6K,EAAQjjB,UAAUunD,kCAC/B5+K,UACR,mDACAs6I,EAAQjjB,UAAUunD,iCAGlBI,EAAAA,IAASP,EAAankC,EAAQjjB,UAAUsnD,wBACpCv8M,EAAI,EAAGA,EAAI48M,EAAG9+M,SAAUkC,EAC9B48M,EAAG58M,GAAKqrM,EAAW,GAAKrrM,UAEnB48M,GAGT1kC,EAAQiJ,KAAO,SAAS3zP,OAElB86E,EAAMg0M,EADV9uR,EAAUA,GAAAA,IAEN69Q,EAAaiR,EAAAA,CACf9pM,QAAShlF,EAAQ69Q,WACjBj2C,SAAU,cAETi2C,EAAWvtM,SAAWo6K,EAAQjjB,UAAUwnD,iBAEzCpR,EADcnzB,EAAQhlB,gBAAAA,CAAiBkmB,KAAMiyB,IACxBA,mBACbA,EAAWvtM,SAAWo6K,EAAQjjB,UAAUunD,kCACtC5+K,UACR,mDACAs6I,EAAQjjB,UAAUwnD,iBAAmB,OACrCvkC,EAAQjjB,UAAUunD,6BAGlBiB,EAAAA,IAAgBpB,EAClBnkC,EAAQjjB,UAAUynD,iBAAmBp0M,EAAIxK,SAqJ7C,SAAqB4/M,EAAI3lM,EAAGjrF,EAAG+vR,OACzB78M,EAAGmqB,EAAGsc,EAAAA,IAAQq7I,aAAa,IAC3B/hL,EAAAA,CAAK+8M,IAAMA,IAAMA,IAAMA,KAEvBrmJ,EAAI0/H,EAAO0mB,EAAI,IACnBpmJ,EAAE,IAAM,IACRA,EAAE,KAAO,IACTA,EAAE,KAAO,OAELknJ,EAAQ7wR,EAAI,OACZkzE,EAAI,EAAGA,EAAIlzE,IAAKkzE,EAClB09M,EAAG,GAAK19M,GAAK+X,EAAE/X,OAEbA,EAAI,EAAGA,EAAI,KAAMA,EACnB09M,EAAG,GAAK19M,GAAKy2D,EAAE,GAAKz2D,OAGlB6mC,EAAIsvJ,EAAOunB,EAAG1oD,SAAS,IAAKloO,EAAI,QACpCyxE,EAAOsoC,GACPk2K,EAAWh9M,EAAG8mC,GACdm2K,EAAKU,EAAI39M,GAELC,EAAI,GAAIA,EAAI,KAAMA,EACpB09M,EAAG19M,GAAK68M,EAAG78M,OAETsgG,EAAI61F,EAAOunB,EAAI5wR,EAAI,QACvByxE,EAAO+hG,GAEHtgG,EAAI,GAAIA,EAAI,KAAMA,EACpBymC,EAAEzmC,GAAK,MAELA,EAAI,EAAGA,EAAI,KAAMA,EACnBymC,EAAEzmC,GAAK6mC,EAAE7mC,OAEPA,EAAI,EAAGA,EAAI,KAAMA,MACfmqB,EAAI,EAAGA,EAAI,GAAIA,IACjBsc,EAAEzmC,EAAImqB,IAAMm2E,EAAEtgG,GAAKy2D,EAAEtsC,GAIzByzL,EAAKF,EAAG1oD,SAAS,IAAKvuH,GA5LtBo3K,CAAYJ,EAAWn1M,EAAKA,EAAIxK,OAAQutM,WAEpC6N,EAAAA,IAAUmD,EAAankC,EAAQjjB,UAAUynD,kBACrC18M,EAAI,EAAGA,EAAIk5M,EAAIp7M,SAAUkC,EAC/Bk5M,EAAIl5M,GAAKy9M,EAAUz9M,UAEdk5M,GAGThhC,EAAQs2B,OAAS,SAAShhR,OAEpB86E,EAAMg0M,EADV9uR,EAAUA,GAAAA,YAEee,IAAtBf,EAAQsyF,oBACC8d,UACR,2GAGAs7K,EAAMoD,EAAAA,CACR9pM,QAAShlF,EAAQsyF,UACjBs1I,SAAU,cAET8jD,EAAIp7M,SAAWo6K,EAAQjjB,UAAUynD,2BACxB9+K,UACR,kDACAs6I,EAAQjjB,UAAUynD,sBAElBnR,EAAY+Q,EAAAA,CACd9pM,QAAShlF,EAAQ+9Q,UACjBn2C,SAAU,cAETm2C,EAAUztM,SAAWo6K,EAAQjjB,UAAUsnD,iCAC9B3+K,UACR,kDACAs6I,EAAQjjB,UAAUsnD,4BAKlBv8M,EAFA09M,EAAAA,IAASrB,EAAankC,EAAQjjB,UAAUynD,iBAAmBp0M,EAAIxK,QAC/Dia,EAAAA,IAAQskM,EAAankC,EAAQjjB,UAAUynD,iBAAmBp0M,EAAIxK,YAE9DkC,EAAI,EAAGA,EAAIk4K,EAAQjjB,UAAUynD,mBAAoB18M,EACnD09M,EAAG19M,GAAKk5M,EAAIl5M,OAEVA,EAAI,EAAGA,EAAIsI,EAAIxK,SAAUkC,EAC3B09M,EAAG19M,EAAIk4K,EAAQjjB,UAAUynD,kBAAoBp0M,EAAItI,UAqJrD,SAA0B+X,EAAG2lM,EAAI5wR,EAAG8vR,OAC9B58M,EACA43E,EAAAA,IAAQykI,EAAa,IACrBt8M,EAAAA,CAAK+8M,IAAMA,IAAMA,IAAMA,KACvB31K,EAAAA,CAAK21K,IAAMA,IAAMA,IAAMA,SAEnB,EACLhwR,EAAI,UACG,KA2IZ,SAAmB+5G,EAAG9mC,OAChB63E,EAAIklI,IAAMgB,EAAMhB,IAAMvyK,EAAMuyK,IAC5BiB,EAAMjB,IAAMkB,EAAOlB,IAAMmB,EAAOnB,IAChCoB,EAAOpB,IAEXqB,EAASt3K,EAAE,GAAIu3K,GAuCjB,SAAqBr1G,EAAGj8K,OAClBkzE,MACAA,EAAI,EAAGA,EAAI,KAAMA,EACnB+oG,EAAE/oG,GAAKlzE,EAAE,EAAIkzE,IAAMlzE,EAAE,EAAIkzE,EAAI,IAAM,GAErC+oG,EAAE,KAAO,MA3CTs1G,CAAYx3K,EAAE,GAAI9mC,GAClBm9I,EAAE3yG,EAAK1D,EAAE,IACT62G,EAAEqgE,EAAKxzK,EAAKk0G,GACZ6/D,EAAE/zK,EAAKA,EAAK1D,EAAE,IACds2G,EAAE4gE,EAAKl3K,EAAE,GAAIk3K,GAEb7gE,EAAE8gE,EAAMD,GACR7gE,EAAE+gE,EAAMD,GACRtgE,EAAEwgE,EAAMD,EAAMD,GACdtgE,EAAE9lE,EAAGsmI,EAAM3zK,GACXmzG,EAAE9lE,EAAGA,EAAGmmI,GAoCV,SAAiBh1G,EAAG/oG,OAEdN,EADA4F,EAAIw3M,QAEJp9M,EAAI,EAAGA,EAAI,KAAMA,EACnB4F,EAAE5F,GAAKM,EAAEN,OAEPA,EAAI,IAAKA,GAAK,IAAKA,EACrBw9I,EAAE53I,EAAGA,GACI,IAAN5F,GACDg+I,EAAEp4I,EAAGA,EAAGtF,OAGRN,EAAI,EAAGA,EAAI,KAAMA,EACnBqpG,EAAErpG,GAAK4F,EAAE5F,GA/CX6+M,CAAQ3mI,EAAGA,GACX8lE,EAAE9lE,EAAGA,EAAGrtC,GACRmzG,EAAE9lE,EAAGA,EAAGmmI,GACRrgE,EAAE9lE,EAAGA,EAAGmmI,GACRrgE,EAAE72G,EAAE,GAAI+wC,EAAGmmI,GAEX7gE,EAAE4gE,EAAKj3K,EAAE,IACT62G,EAAEogE,EAAKA,EAAKC,GACTS,EAASV,EAAKvzK,IACfmzG,EAAE72G,EAAE,GAAIA,EAAE,GAAIi1G,MAGhBoB,EAAE4gE,EAAKj3K,EAAE,IACT62G,EAAEogE,EAAKA,EAAKC,GACTS,EAASV,EAAKvzK,UACP,EAGPk0K,EAAS53K,EAAE,MAAS9mC,EAAE,KAAO,GAC9Bu+M,EAAEz3K,EAAE,GAAI63K,EAAK73K,EAAE,WAGjB62G,EAAE72G,EAAE,GAAIA,EAAE,GAAIA,EAAE,IACT,EAjLJ83K,CAAUx3K,EAAGy1K,UACN,MAGN58M,EAAI,EAAGA,EAAIlzE,IAAKkzE,EAClB+X,EAAE/X,GAAK09M,EAAG19M,OAERA,EAAI,EAAGA,EAAI,KAAMA,EACnB+X,EAAE/X,EAAI,IAAM48M,EAAG58M,OAEbsgG,EAAI61F,EAAOp+K,EAAGjrF,MAClByxE,EAAO+hG,GACPs+G,EAAW7+M,EAAGonC,EAAGm5D,GAEjBy8G,EAAW51K,EAAGu2K,EAAG1oD,SAAS,KAC1Bn9I,EAAI9X,EAAGonC,GACP61K,EAAKplI,EAAG73E,GAERjzE,GAAK,GACF+xR,EAAiBnB,EAAI,EAAG9lI,EAAG,GAAA,KACxB53E,EAAI,EAAGA,EAAIlzE,IAAKkzE,EAClB+X,EAAE/X,GAAK,SAED,MAGNA,EAAI,EAAGA,EAAIlzE,IAAKkzE,EAClB+X,EAAE/X,GAAK09M,EAAG19M,EAAI,WAETlzE,EA3LCgyR,CAAiB/mM,EAAG2lM,EAAIA,EAAG5/M,OAAQytM,IAAc,OA4CvDmT,EAAM5B,IACNsB,EAAMtB,EAAAA,CAAI,IACVr+D,EAAIq+D,EAAAA,CACN,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,IACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,QACtDiC,EAAKjC,EAAAA,CACP,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,IACxD,MAAQ,MAAQ,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,OACtDkC,EAAIlC,EAAAA,CACN,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,OACtDmC,EAAInC,EAAAA,CACN,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,QACtDz+D,EAAAA,IAAQyjC,aAAAA,CACV,IAAM,IAAM,IAAM,GAAM,GAAM,GAAM,GAAM,GAC1C,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAC1C,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,KAC3ChmC,EAAIghE,EAAAA,CACN,MAAQ,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,KAAQ,MACxD,MAAQ,MAAQ,IAAQ,MAAQ,MAAQ,MAAQ,KAAQ,QAI1D,SAAA3mB,EAAgB7tL,EAAK42M,OAEfppB,EAAKje,EAAMie,GAAGK,OAAOppQ,SACrB27M,EAAAA,IAAa6jD,EAAWjkL,GAC5BwtL,EAAGtnG,OAAOk6C,EAAOuxC,SAASilC,GAAS,cAC/BhzK,EAAO4pJ,EAAG/jC,SAASkoB,mBACF,IAAX6B,SACDA,EAAOx5F,KAAKp2C,EAAM,kBAEvB0tB,EAAAA,IAAUyiJ,EAAankC,EAAQjjB,UAAU0nD,kBACrC38M,EAAI,EAAGA,EAAI,KAAMA,EACvB45D,EAAI55D,GAAKksC,EAAKp7B,WAAW9Q,UAEpB45D,EA8GT,SAAAgkJ,EAAc/2K,EAAGJ,OACXiwH,EAAO12J,EAAGmqB,EAAGj9F,MACb8yE,EAAI,GAAIA,GAAK,KAAMA,EAAAA,KACrB02J,EAAQ,EACJvsI,EAAInqB,EAAI,GAAI9yE,EAAI8yE,EAAI,GAAImqB,EAAIj9F,IAAKi9F,EACnCsc,EAAEtc,IAAMusI,EAAQ,GAAKjwH,EAAEzmC,GAAKq+I,EAAEl0H,GAAKnqB,EAAI,KACvC02J,EAASjwH,EAAEtc,GAAK,KAAQ,EACxBsc,EAAEtc,IAAc,IAARusI,EAEVjwH,EAAEtc,IAAMusI,EACRjwH,EAAEzmC,GAAK,MAET02J,EAAQ,EACJvsI,EAAI,EAAGA,EAAI,KAAMA,EACnBsc,EAAEtc,IAAMusI,GAASjwH,EAAE,KAAO,GAAK43G,EAAEl0H,GACjCusI,EAAQjwH,EAAEtc,IAAM,EAChBsc,EAAEtc,IAAM,QAENA,EAAI,EAAGA,EAAI,KAAMA,EACnBsc,EAAEtc,IAAMusI,EAAQrY,EAAEl0H,OAEhBnqB,EAAI,EAAGA,EAAI,KAAMA,EACnBymC,EAAEzmC,EAAI,IAAMymC,EAAEzmC,IAAM,EACpB6mC,EAAE7mC,GAAY,IAAPymC,EAAEzmC,GAIb,SAAAzB,EAAgBsoC,WACVJ,EAAAA,IAAQq7I,aAAa,IACjB9hL,EAAI,EAAGA,EAAI,KAAMA,EACvBymC,EAAEzmC,GAAK6mC,EAAE7mC,GACT6mC,EAAE7mC,GAAK,EAET49M,EAAK/2K,EAAGJ,GAGV,SAAA5uB,EAAa9X,EAAGonC,OACVznC,EAAIo9M,IAAM3qM,EAAI2qM,IAAMx3M,EAAIw3M,IACxBrmJ,EAAIqmJ,IAAMlwR,EAAIkwR,IAAMviI,EAAIuiI,IACxB7/D,EAAI6/D,IAAMx8G,EAAIw8G,IAAMllI,EAAIklI,IAE5BwB,EAAE5+M,EAAGK,EAAE,GAAIA,EAAE,IACbu+M,EAAE1mI,EAAGzwC,EAAE,GAAIA,EAAE,IACbu2G,EAAEh+I,EAAGA,EAAGk4E,GACRulE,EAAEhrI,EAAGpS,EAAE,GAAIA,EAAE,IACbo9I,EAAEvlE,EAAGzwC,EAAE,GAAIA,EAAE,IACbu2G,EAAEvrI,EAAGA,EAAGylE,GACR8lE,EAAEp4I,EAAGvF,EAAE,GAAIonC,EAAE,IACbu2G,EAAEp4I,EAAGA,EAAGy5M,GACRrhE,EAAEjnF,EAAG12D,EAAE,GAAIonC,EAAE,IACbg2G,EAAE1mF,EAAGA,EAAGA,GACR6nJ,EAAE1xR,EAAGulF,EAAGzS,GACR4+M,EAAE/jI,EAAG9jB,EAAGnxD,GACR63I,EAAEF,EAAGxmF,EAAGnxD,GACR63I,EAAE78C,EAAGnuF,EAAGzS,GAERg+I,EAAE39I,EAAE,GAAInzE,EAAG2tJ,GACXmjE,EAAE39I,EAAE,GAAIugG,EAAG28C,GACXS,EAAE39I,EAAE,GAAIk9I,EAAG1iE,GACXmjE,EAAE39I,EAAE,GAAInzE,EAAG0zK,GAGb,SAAA6+G,EAAep/M,EAAGonC,EAAGh1B,WACXnS,EAAI,EAAGA,EAAI,IAAKA,EACtBo/M,EAASr/M,EAAEC,GAAImnC,EAAEnnC,GAAImS,GAIzB,SAAA6qM,EAAcn2K,EAAG9mC,OACXs/M,EAAKvC,IAAMwC,EAAKxC,IAAMyC,EAAKzC,KAgKjC,SAAkB/zG,EAAG/oG,OAEfN,EADA4F,EAAIw3M,QAEJp9M,EAAI,EAAGA,EAAI,KAAMA,EACnB4F,EAAE5F,GAAKM,EAAEN,OAEPA,EAAI,IAAKA,GAAK,IAAKA,EACrBw9I,EAAE53I,EAAGA,GACI,IAAN5F,GAAiB,IAANA,GACZg+I,EAAEp4I,EAAGA,EAAGtF,OAGRN,EAAI,EAAGA,EAAI,KAAMA,EACnBqpG,EAAErpG,GAAK4F,EAAE5F,GA5KX8/M,CAASD,EAAIx/M,EAAE,IACf29I,EAAE2hE,EAAIt/M,EAAE,GAAIw/M,GACZ7hE,EAAE4hE,EAAIv/M,EAAE,GAAIw/M,GACZE,EAAU54K,EAAGy4K,GACbz4K,EAAE,KAAO43K,EAASY,IAAO,EAG3B,SAAAI,EAAmB12G,EAAGj8K,OAChBkzE,EAAGmqB,EAAGhY,EACN4F,EAAI+kM,IAAMllI,EAAIklI,QACd98M,EAAI,EAAGA,EAAI,KAAMA,EACnB43E,EAAE53E,GAAKlzE,EAAEkzE,OAEX0/M,EAAS9nI,GACT8nI,EAAS9nI,GACT8nI,EAAS9nI,GACLztD,EAAI,EAAGA,EAAI,IAAKA,EAAAA,KAClBpS,EAAE,GAAK6/D,EAAE,GAAK,MACV53E,EAAI,EAAGA,EAAI,KAAMA,EACnB+X,EAAE/X,GAAK43E,EAAE53E,GAAK,OAAW+X,EAAE/X,EAAI,IAAM,GAAM,GAC3C+X,EAAE/X,EAAE,IAAM,MAEZ+X,EAAE,IAAM6/D,EAAE,IAAM,OAAW7/D,EAAE,KAAO,GAAM,GAC1C5F,EAAK4F,EAAE,KAAO,GAAM,EACpBA,EAAE,KAAO,MACTqnM,EAASxnI,EAAG7/D,EAAG,EAAI5F,OAEhBnS,EAAI,EAAGA,EAAI,GAAIA,IAClB+oG,EAAE,EAAI/oG,GAAY,IAAP43E,EAAE53E,GACb+oG,EAAE,EAAI/oG,EAAI,GAAK43E,EAAE53E,IAAM,EAyE3B,SAAAw+M,EAAkB9+M,EAAGyS,OACf7M,EAAAA,IAAQ+2M,EAAa,IACrB5lJ,EAAAA,IAAQ4lJ,EAAa,WACzBoD,EAAUn6M,EAAG5F,GACb+/M,EAAUhpJ,EAAGtkD,GACN0sM,EAAiBv5M,EAAG,EAAGmxD,EAAG,GAGnC,SAAAooJ,EAA0Bp4K,EAAGqe,EAAIpe,EAAGi5K,UAIpC,SAAYl5K,EAAGqe,EAAIpe,EAAGi5K,EAAI7yR,OACpBkzE,EAAGy2D,EAAI,MACPz2D,EAAI,EAAGA,EAAIlzE,IAAKkzE,EAClBy2D,GAAKhwB,EAAEqe,EAAK9kD,GAAK0mC,EAAEi5K,EAAK3/M,UAElB,EAAMy2D,EAAI,IAAO,GAAM,EARxBmpJ,CAAGn5K,EAAGqe,EAAIpe,EAAGi5K,EAAI,IAW1B,SAAAlB,EAAkB/+M,OACZ+2D,EAAAA,IAAQ4lJ,EAAa,WACzBoD,EAAUhpJ,EAAG/2D,GACC,EAAP+2D,EAAE,GAGX,SAAAmoJ,EAAoB7+M,EAAGonC,EAAGpyB,OACpB5C,EAAGnS,MACPm+M,EAASp+M,EAAE,GAAI2+M,GACfP,EAASp+M,EAAE,GAAIq+M,GACfD,EAASp+M,EAAE,GAAIq+M,GACfD,EAASp+M,EAAE,GAAI2+M,GACX1+M,EAAI,IAAKA,GAAK,IAAKA,EAErBm/M,EAAMp/M,EAAGonC,EADTh1B,EAAK4C,EAAG/U,EAAI,EAAG,KAAW,EAAJA,GAAU,GAEhC6X,EAAIsvB,EAAGpnC,GACP8X,EAAI9X,EAAGA,GACPo/M,EAAMp/M,EAAGonC,EAAGh1B,GAIhB,SAAA4qM,EAAoBh9M,EAAGgV,OACjBoyB,EAAAA,CAAK21K,IAAMA,IAAMA,IAAMA,KAC3BqB,EAASh3K,EAAE,GAAI63K,GACfb,EAASh3K,EAAE,GAAI83K,GACfd,EAASh3K,EAAE,GAAIi3K,GACf1gE,EAAEv2G,EAAE,GAAI63K,EAAGC,GACXL,EAAW7+M,EAAGonC,EAAGpyB,GAGnB,SAAAopM,EAAkBt3K,EAAGnnC,OACfM,MACAA,EAAI,EAAGA,EAAI,GAAIA,IACjB6mC,EAAE7mC,GAAY,EAAPN,EAAEM,GAqBb,SAAA0/M,EAAkB32G,OACZ/oG,EAAG29F,EAAGr4F,EAAI,MACVtF,EAAI,EAAGA,EAAI,KAAMA,EACnB29F,EAAIoL,EAAE/oG,GAAKsF,EAAI,MACfA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,OACnBoL,EAAE/oG,GAAK29F,EAAQ,MAAJr4F,EAEbyjG,EAAE,IAAMzjG,EAAI,EAAI,IAAMA,EAAI,GAG5B,SAAA85M,EAAkBr/M,EAAGonC,EAAGh1B,WAClBylE,EAAGtyE,IAAM6M,EAAI,GACTnS,EAAI,EAAGA,EAAI,KAAMA,EACvB43E,EAAItyE,GAAKvF,EAAEC,GAAKmnC,EAAEnnC,IAClBD,EAAEC,IAAM43E,EACRzwC,EAAEnnC,IAAM43E,EAIZ,SAAAklI,EAAYjvJ,OACN7tD,EAAG6mC,EAAAA,IAAQi7I,aAAa,OACzBj0H,MACG7tD,EAAI,EAAGA,EAAI6tD,EAAK/vD,SAAUkC,EAC5B6mC,EAAE7mC,GAAK6tD,EAAK7tD,UAGT6mC,EAGT,SAAAs2G,EAAWp0C,EAAGrpG,EAAGyS,WACPnS,EAAI,EAAGA,EAAI,KAAMA,EACvB+oG,EAAE/oG,GAAKN,EAAEM,GAAKmS,EAAEnS,GAIpB,SAAAs+M,EAAWv1G,EAAGrpG,EAAGyS,WACPnS,EAAI,EAAGA,EAAI,KAAMA,EACvB+oG,EAAE/oG,GAAKN,EAAEM,GAAKmS,EAAEnS,GAIpB,SAAAk9I,EAAWn0C,EAAGrpG,GACZg+I,EAAE30C,EAAGrpG,EAAGA,GAGV,SAAAg+I,EAAW30C,EAAGrpG,EAAGyS,OACXwrF,EAAGr4F,EACJu6M,EAAK,EAAIrZ,EAAK,EAAIC,EAAK,EAAIqZ,EAAK,EAAIC,EAAK,EAAIC,EAAK,EAAIC,EAAK,EAAIC,EAAK,EACpEC,EAAK,EAAIC,EAAK,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EACrEC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EACrEC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAC5DC,EAAKvvM,EAAE,GACPm1K,EAAKn1K,EAAE,GACP+0K,EAAK/0K,EAAE,GACPwvM,EAAKxvM,EAAE,GACPyvM,EAAKzvM,EAAE,GACP0vM,EAAK1vM,EAAE,GACP2vM,EAAK3vM,EAAE,GACP4vM,EAAK5vM,EAAE,GACP6vM,EAAK7vM,EAAE,GACP8vM,EAAK9vM,EAAE,GACP+vM,EAAM/vM,EAAE,IACRgwM,EAAMhwM,EAAE,IACRiwM,EAAMjwM,EAAE,IACRkwM,EAAMlwM,EAAE,IACRmwM,EAAMnwM,EAAE,IACRowM,EAAMpwM,EAAE,IAGV0tM,IADAliH,EAAIj+F,EAAE,IACIgiN,EACVlb,GAAM7oG,EAAI2pF,EACVmf,GAAM9oG,EAAIupF,EACV44B,GAAMniH,EAAIgkH,EACV5B,GAAMpiH,EAAIikH,EACV5B,GAAMriH,EAAIkkH,EACV5B,GAAMtiH,EAAImkH,EACV5B,GAAMviH,EAAIokH,EACV5B,GAAMxiH,EAAIqkH,EACV5B,GAAMziH,EAAIskH,EACV5B,GAAO1iH,EAAIukH,EACX5B,GAAO3iH,EAAIwkH,EACX5B,GAAO5iH,EAAIykH,EACX5B,GAAO7iH,EAAI0kH,EACX5B,GAAO9iH,EAAI2kH,EACX5B,GAAO/iH,EAAI4kH,EAEX/b,IADA7oG,EAAIj+F,EAAE,IACIgiN,EACVjb,GAAM9oG,EAAI2pF,EACVw4B,GAAMniH,EAAIupF,EACV64B,GAAMpiH,EAAIgkH,EACV3B,GAAMriH,EAAIikH,EACV3B,GAAMtiH,EAAIkkH,EACV3B,GAAMviH,EAAImkH,EACV3B,GAAMxiH,EAAIokH,EACV3B,GAAMziH,EAAIqkH,EACV3B,GAAO1iH,EAAIskH,EACX3B,GAAO3iH,EAAIukH,EACX3B,GAAO5iH,EAAIwkH,EACX3B,GAAO7iH,EAAIykH,EACX3B,GAAO9iH,EAAI0kH,EACX3B,GAAO/iH,EAAI2kH,EACX3B,GAAOhjH,EAAI4kH,EAEX9b,IADA9oG,EAAIj+F,EAAE,IACIgiN,EACV5B,GAAMniH,EAAI2pF,EACVy4B,GAAMpiH,EAAIupF,EACV84B,GAAMriH,EAAIgkH,EACV1B,GAAMtiH,EAAIikH,EACV1B,GAAMviH,EAAIkkH,EACV1B,GAAMxiH,EAAImkH,EACV1B,GAAMziH,EAAIokH,EACV1B,GAAO1iH,EAAIqkH,EACX1B,GAAO3iH,EAAIskH,EACX1B,GAAO5iH,EAAIukH,EACX1B,GAAO7iH,EAAIwkH,EACX1B,GAAO9iH,EAAIykH,EACX1B,GAAO/iH,EAAI0kH,EACX1B,GAAOhjH,EAAI2kH,EACX1B,GAAOjjH,EAAI4kH,EAEXzC,IADAniH,EAAIj+F,EAAE,IACIgiN,EACV3B,GAAMpiH,EAAI2pF,EACV04B,GAAMriH,EAAIupF,EACV+4B,GAAMtiH,EAAIgkH,EACVzB,GAAMviH,EAAIikH,EACVzB,GAAMxiH,EAAIkkH,EACVzB,GAAMziH,EAAImkH,EACVzB,GAAO1iH,EAAIokH,EACXzB,GAAO3iH,EAAIqkH,EACXzB,GAAO5iH,EAAIskH,EACXzB,GAAO7iH,EAAIukH,EACXzB,GAAO9iH,EAAIwkH,EACXzB,GAAO/iH,EAAIykH,EACXzB,GAAOhjH,EAAI0kH,EACXzB,GAAOjjH,EAAI2kH,EACXzB,GAAOljH,EAAI4kH,EAEXxC,IADApiH,EAAIj+F,EAAE,IACIgiN,EACV1B,GAAMriH,EAAI2pF,EACV24B,GAAMtiH,EAAIupF,EACVg5B,GAAMviH,EAAIgkH,EACVxB,GAAMxiH,EAAIikH,EACVxB,GAAMziH,EAAIkkH,EACVxB,GAAO1iH,EAAImkH,EACXxB,GAAO3iH,EAAIokH,EACXxB,GAAO5iH,EAAIqkH,EACXxB,GAAO7iH,EAAIskH,EACXxB,GAAO9iH,EAAIukH,EACXxB,GAAO/iH,EAAIwkH,EACXxB,GAAOhjH,EAAIykH,EACXxB,GAAOjjH,EAAI0kH,EACXxB,GAAOljH,EAAI2kH,EACXxB,GAAOnjH,EAAI4kH,EAEXvC,IADAriH,EAAIj+F,EAAE,IACIgiN,EACVzB,GAAMtiH,EAAI2pF,EACV44B,GAAMviH,EAAIupF,EACVi5B,GAAMxiH,EAAIgkH,EACVvB,GAAMziH,EAAIikH,EACVvB,GAAO1iH,EAAIkkH,EACXvB,GAAO3iH,EAAImkH,EACXvB,GAAO5iH,EAAIokH,EACXvB,GAAO7iH,EAAIqkH,EACXvB,GAAO9iH,EAAIskH,EACXvB,GAAO/iH,EAAIukH,EACXvB,GAAOhjH,EAAIwkH,EACXvB,GAAOjjH,EAAIykH,EACXvB,GAAOljH,EAAI0kH,EACXvB,GAAOnjH,EAAI2kH,EACXvB,GAAOpjH,EAAI4kH,EAEXtC,IADAtiH,EAAIj+F,EAAE,IACIgiN,EACVxB,GAAMviH,EAAI2pF,EACV64B,GAAMxiH,EAAIupF,EACVk5B,GAAMziH,EAAIgkH,EACVtB,GAAO1iH,EAAIikH,EACXtB,GAAO3iH,EAAIkkH,EACXtB,GAAO5iH,EAAImkH,EACXtB,GAAO7iH,EAAIokH,EACXtB,GAAO9iH,EAAIqkH,EACXtB,GAAO/iH,EAAIskH,EACXtB,GAAOhjH,EAAIukH,EACXtB,GAAOjjH,EAAIwkH,EACXtB,GAAOljH,EAAIykH,EACXtB,GAAOnjH,EAAI0kH,EACXtB,GAAOpjH,EAAI2kH,EACXtB,GAAOrjH,EAAI4kH,EAEXrC,IADAviH,EAAIj+F,EAAE,IACIgiN,EACVvB,GAAMxiH,EAAI2pF,EACV84B,GAAMziH,EAAIupF,EACVm5B,GAAO1iH,EAAIgkH,EACXrB,GAAO3iH,EAAIikH,EACXrB,GAAO5iH,EAAIkkH,EACXrB,GAAO7iH,EAAImkH,EACXrB,GAAO9iH,EAAIokH,EACXrB,GAAO/iH,EAAIqkH,EACXrB,GAAOhjH,EAAIskH,EACXrB,GAAOjjH,EAAIukH,EACXrB,GAAOljH,EAAIwkH,EACXrB,GAAOnjH,EAAIykH,EACXrB,GAAOpjH,EAAI0kH,EACXrB,GAAOrjH,EAAI2kH,EACXrB,GAAOtjH,EAAI4kH,EAEXpC,IADAxiH,EAAIj+F,EAAE,IACIgiN,EACVtB,GAAMziH,EAAI2pF,EACV+4B,GAAO1iH,EAAIupF,EACXo5B,GAAO3iH,EAAIgkH,EACXpB,GAAO5iH,EAAIikH,EACXpB,GAAO7iH,EAAIkkH,EACXpB,GAAO9iH,EAAImkH,EACXpB,GAAO/iH,EAAIokH,EACXpB,GAAOhjH,EAAIqkH,EACXpB,GAAOjjH,EAAIskH,EACXpB,GAAOljH,EAAIukH,EACXpB,GAAOnjH,EAAIwkH,EACXpB,GAAOpjH,EAAIykH,EACXpB,GAAOrjH,EAAI0kH,EACXpB,GAAOtjH,EAAI2kH,EACXpB,GAAOvjH,EAAI4kH,EAEXnC,IADAziH,EAAIj+F,EAAE,IACIgiN,EACVrB,GAAO1iH,EAAI2pF,EACXg5B,GAAO3iH,EAAIupF,EACXq5B,GAAO5iH,EAAIgkH,EACXnB,GAAO7iH,EAAIikH,EACXnB,GAAO9iH,EAAIkkH,EACXnB,GAAO/iH,EAAImkH,EACXnB,GAAOhjH,EAAIokH,EACXnB,GAAOjjH,EAAIqkH,EACXnB,GAAOljH,EAAIskH,EACXnB,GAAOnjH,EAAIukH,EACXnB,GAAOpjH,EAAIwkH,EACXnB,GAAOrjH,EAAIykH,EACXnB,GAAOtjH,EAAI0kH,EACXnB,GAAOvjH,EAAI2kH,EACXnB,GAAOxjH,EAAI4kH,EAEXlC,IADA1iH,EAAIj+F,EAAE,KACKgiN,EACXpB,GAAO3iH,EAAI2pF,EACXi5B,GAAO5iH,EAAIupF,EACXs5B,GAAO7iH,EAAIgkH,EACXlB,GAAO9iH,EAAIikH,EACXlB,GAAO/iH,EAAIkkH,EACXlB,GAAOhjH,EAAImkH,EACXlB,GAAOjjH,EAAIokH,EACXlB,GAAOljH,EAAIqkH,EACXlB,GAAOnjH,EAAIskH,EACXlB,GAAOpjH,EAAIukH,EACXlB,GAAOrjH,EAAIwkH,EACXlB,GAAOtjH,EAAIykH,EACXlB,GAAOvjH,EAAI0kH,EACXlB,GAAOxjH,EAAI2kH,EACXlB,GAAOzjH,EAAI4kH,EAEXjC,IADA3iH,EAAIj+F,EAAE,KACKgiN,EACXnB,GAAO5iH,EAAI2pF,EACXk5B,GAAO7iH,EAAIupF,EACXu5B,GAAO9iH,EAAIgkH,EACXjB,GAAO/iH,EAAIikH,EACXjB,GAAOhjH,EAAIkkH,EACXjB,GAAOjjH,EAAImkH,EACXjB,GAAOljH,EAAIokH,EACXjB,GAAOnjH,EAAIqkH,EACXjB,GAAOpjH,EAAIskH,EACXjB,GAAOrjH,EAAIukH,EACXjB,GAAOtjH,EAAIwkH,EACXjB,GAAOvjH,EAAIykH,EACXjB,GAAOxjH,EAAI0kH,EACXjB,GAAOzjH,EAAI2kH,EACXjB,GAAO1jH,EAAI4kH,EAEXhC,IADA5iH,EAAIj+F,EAAE,KACKgiN,EACXlB,GAAO7iH,EAAI2pF,EACXm5B,GAAO9iH,EAAIupF,EACXw5B,GAAO/iH,EAAIgkH,EACXhB,GAAOhjH,EAAIikH,EACXhB,GAAOjjH,EAAIkkH,EACXhB,GAAOljH,EAAImkH,EACXhB,GAAOnjH,EAAIokH,EACXhB,GAAOpjH,EAAIqkH,EACXhB,GAAOrjH,EAAIskH,EACXhB,GAAOtjH,EAAIukH,EACXhB,GAAOvjH,EAAIwkH,EACXhB,GAAOxjH,EAAIykH,EACXhB,GAAOzjH,EAAI0kH,EACXhB,GAAO1jH,EAAI2kH,EACXhB,GAAO3jH,EAAI4kH,EAEX/B,IADA7iH,EAAIj+F,EAAE,KACKgiN,EACXjB,GAAO9iH,EAAI2pF,EACXo5B,GAAO/iH,EAAIupF,EACXy5B,GAAOhjH,EAAIgkH,EACXf,GAAOjjH,EAAIikH,EACXf,GAAOljH,EAAIkkH,EACXf,GAAOnjH,EAAImkH,EACXf,GAAOpjH,EAAIokH,EACXf,GAAOrjH,EAAIqkH,EACXf,GAAOtjH,EAAIskH,EACXf,GAAOvjH,EAAIukH,EACXf,GAAOxjH,EAAIwkH,EACXf,GAAOzjH,EAAIykH,EACXf,GAAO1jH,EAAI0kH,EACXf,GAAO3jH,EAAI2kH,EACXf,GAAO5jH,EAAI4kH,EAEX9B,IADA9iH,EAAIj+F,EAAE,KACKgiN,EACXhB,GAAO/iH,EAAI2pF,EACXq5B,GAAOhjH,EAAIupF,EACX05B,GAAOjjH,EAAIgkH,EACXd,GAAOljH,EAAIikH,EACXd,GAAOnjH,EAAIkkH,EACXd,GAAOpjH,EAAImkH,EACXd,GAAOrjH,EAAIokH,EACXd,GAAOtjH,EAAIqkH,EACXd,GAAOvjH,EAAIskH,EACXd,GAAOxjH,EAAIukH,EACXd,GAAOzjH,EAAIwkH,EACXd,GAAO1jH,EAAIykH,EACXd,GAAO3jH,EAAI0kH,EACXd,GAAO5jH,EAAI2kH,EACXd,GAAO7jH,EAAI4kH,EAEX7B,IADA/iH,EAAIj+F,EAAE,KACKgiN,EAkBXlb,GAAO,IAhBPoa,GAAOjjH,EAAIupF,GAiBXuf,GAAO,IAhBPoa,GAAOljH,EAAIgkH,GAiBX7B,GAAO,IAhBPgB,GAAOnjH,EAAIikH,GAiBX7B,GAAO,IAhBPgB,GAAOpjH,EAAIkkH,GAiBX7B,GAAO,IAhBPgB,GAAOrjH,EAAImkH,GAiBX7B,GAAO,IAhBPgB,GAAOtjH,EAAIokH,GAiBX7B,GAAO,IAhBPgB,GAAOvjH,EAAIqkH,GAiBX7B,GAAO,IAhBPgB,GAAOxjH,EAAIskH,GAiBX7B,GAAO,IAhBPgB,GAAOzjH,EAAIukH,GAiBX7B,GAAO,IAhBPgB,GAAO1jH,EAAIwkH,GAiBX7B,GAAO,IAhBPgB,GAAO3jH,EAAIykH,GAiBX7B,GAAO,IAhBPgB,GAAO5jH,EAAI0kH,GAiBX7B,GAAO,IAhBPgB,GAAO7jH,EAAI2kH,GAiBX7B,GAAO,IAhBPgB,GAAO9jH,EAAI4kH,GAqBsC1C,GAAjDliH,GAnBAkiH,GAAO,IAhBPc,GAAOhjH,EAAI2pF,KAkCXhiL,EAAI,GACU,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACS6oG,GAAjD7oG,EAAK6oG,EAAKlhM,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACS8oG,GAAjD9oG,EAAK8oG,EAAKnhM,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSmiH,GAAjDniH,EAAKmiH,EAAKx6M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSoiH,GAAjDpiH,EAAKoiH,EAAKz6M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSqiH,GAAjDriH,EAAKqiH,EAAK16M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSsiH,GAAjDtiH,EAAKsiH,EAAK36M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSuiH,GAAjDviH,EAAKuiH,EAAK56M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSwiH,GAAjDxiH,EAAKwiH,EAAK76M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSyiH,GAAjDziH,EAAKyiH,EAAK96M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ0iH,GAAhD1iH,EAAI0iH,EAAM/6M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ2iH,GAAhD3iH,EAAI2iH,EAAMh7M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ4iH,GAAhD5iH,EAAI4iH,EAAMj7M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ6iH,GAAhD7iH,EAAI6iH,EAAMl7M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ8iH,GAAhD9iH,EAAI8iH,EAAMn7M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ+iH,GAAhD/iH,EAAI+iH,EAAMp7M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QAKSkiH,GAAjDliH,GAJAkiH,GAAMv6M,EAAE,EAAI,IAAMA,EAAE,KAGpBA,EAAI,GACU,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACS6oG,GAAjD7oG,EAAK6oG,EAAKlhM,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACS8oG,GAAjD9oG,EAAK8oG,EAAKnhM,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSmiH,GAAjDniH,EAAKmiH,EAAKx6M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSoiH,GAAjDpiH,EAAKoiH,EAAKz6M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSqiH,GAAjDriH,EAAKqiH,EAAK16M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSsiH,GAAjDtiH,EAAKsiH,EAAK36M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSuiH,GAAjDviH,EAAKuiH,EAAK56M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSwiH,GAAjDxiH,EAAKwiH,EAAK76M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACSyiH,GAAjDziH,EAAKyiH,EAAK96M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ0iH,GAAhD1iH,EAAI0iH,EAAM/6M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ2iH,GAAhD3iH,EAAI2iH,EAAMh7M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ4iH,GAAhD5iH,EAAI4iH,EAAMj7M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ6iH,GAAhD7iH,EAAI6iH,EAAMl7M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ8iH,GAAhD9iH,EAAI8iH,EAAMn7M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACQ+iH,GAAhD/iH,EAAI+iH,EAAMp7M,EAAI,OAAgD,OAAzCA,EAAI7G,KAAK6nC,MAAMq3D,EAAI,QACxCkiH,GAAMv6M,EAAE,EAAI,IAAMA,EAAE,GAEpByjG,EAAG,GAAK82G,EACR92G,EAAG,GAAKy9F,EACRz9F,EAAG,GAAK09F,EACR19F,EAAG,GAAK+2G,EACR/2G,EAAG,GAAKg3G,EACRh3G,EAAG,GAAKi3G,EACRj3G,EAAG,GAAKk3G,EACRl3G,EAAG,GAAKm3G,EACRn3G,EAAG,GAAKo3G,EACRp3G,EAAG,GAAKq3G,EACRr3G,EAAE,IAAMs3G,EACRt3G,EAAE,IAAMu3G,EACRv3G,EAAE,IAAMw3G,EACRx3G,EAAE,IAAMy3G,EACRz3G,EAAE,IAAM03G,EACR13G,EAAE,IAAM23G,oKC1iCV,IAAA7oC,EAAAzrP,EAAA,WACAA,EAAA,UACA,IAAA0tP,EAAAjC,EAAAiC,KAEA3tP,EAAA28Q,oBAAA,CAEAp9Q,KAAA,iBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CAEAb,KAAA,yBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,qBACA,CAEAn/P,KAAA,qCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,gCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,mBAEA,CAEAn/P,KAAA,iBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA+M,YACAkB,aAAA,EACAmE,QAAA,gBAIA1+P,EAAA88Q,mBAAA,CACAv9Q,KAAA,uBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAoE,YAAA,uBACAv+P,MAAA,CAAA,CACAb,KAAA,2CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,gCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,kBAIA,CACApE,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA8M,UACAmB,aAAA,EACAC,UAAA,EACAqE,sBAAA,sFCrEA,aAEA,MAAAitB,EAAA7rR,EAAA,gBACAw7Q,EAAAx7Q,EAAA,mBACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BAgGA,SAAAyhR,EAAAD,GACA,OAAAhvG,QAAA2gD,IAAA,CACA04D,EAAA59L,MAAAwxL,OAAAgC,UAAA,MAAAD,EAAAvC,YACA4M,EAAA59L,MAAAwxL,OAAAgC,UAAA,MAAAD,EAAArC,aAjGAp/Q,EAAAitR,MAAAhtR,EAAA,eAEAD,EAAAwhR,YAAAxhI,eAAA8mF,GACA,MAAA26C,QAAAqK,EAAA59L,MAAAwxL,OAAA8B,YACA,CACAjiR,KAAA,oBACA0hR,cAAAn6C,EACAo6C,eAAA,IAAA/7C,WAAA,CAAA,EAAA,EAAA,IACAplH,KAAA,CAAAxgH,KAAA,aAEA,EACA,CAAA,OAAA,WAGAsB,QAAA6gR,EAAAD,GAEA,MAAA,CACAvC,WAAAr+Q,EAAA,GACAu+Q,UAAAv+Q,EAAA,KAKAb,EAAA0nO,oBAAA1nF,eAAAt+I,GACA,MAWA+/Q,EAAA,OAXAqK,EAAA59L,MAAAwxL,OAAA0M,UACA,MACA1qR,EACA,CACAnC,KAAA,oBACAwgH,KAAA,CAAAxgH,KAAA,aAEA,EACA,CAAA,eAqEA82R,EAhEA30R,EAiEAoqR,EAAA59L,MAAAwxL,OAAA0M,UACA,MACA,CACAkK,IAAAD,EAAAC,IACA31R,EAAA01R,EAAA11R,EACAF,EAAA41R,EAAA51R,GAEA,CACAlB,KAAA,oBACAwgH,KAAA,CAAAxgH,KAAA,aAEA,EACA,CAAA,aAbA,IAAA82R,EA7DA,MAAAx1R,QAAA6gR,EAAA,CACAxC,WAAAuC,EAAA,GACArC,UAAAqC,EAAA,KAGA,MAAA,CACAvC,WAAAr+Q,EAAA,GACAu+Q,UAAAv+Q,EAAA,KAIAb,EAAAu4Q,gBAAAkD,EAEAz7Q,EAAAstR,YAAAttI,eAAAt+I,EAAAy6E,GACA,MAAA+iM,QAAA4M,EAAA59L,MAAAwxL,OAAA0M,UACA,MACA1qR,EACA,CACAnC,KAAA,oBACAwgH,KAAA,CAAAxgH,KAAA,aAEA,EACA,CAAA,SAGAwtR,QAAAjB,EAAA59L,MAAAwxL,OAAA1qB,KACA,CAAAz1P,KAAA,qBACA2/Q,EACA/5C,WAAAhvE,KAAAh6E,IAGA,OAAA,IAAAgpJ,WAAA4nD,EAAAA,EAAAliD,WAAAkiD,EAAAjiD,aAGA9qO,EAAAgtR,cAAAhtI,eAAAt+I,EAAAqrR,EAAA5wM,GACA,MAAAijM,QAAA0M,EAAA59L,MAAAwxL,OAAA0M,UACA,MACA1qR,EACA,CACAnC,KAAA,oBACAwgH,KAAA,CAAAxgH,KAAA,aAEA,EACA,CAAA,WAGA,OAAAusR,EAAA59L,MAAAwxL,OAAA2C,OACA,CAAA9iR,KAAA,qBACA6/Q,EACA2N,EACA5wM,IAwCA,MAAAo6M,QAAAA,EAAAC,SAAAA,GAAAv2R,EAAA,aAEA,SAAAw2R,EAAA/0R,EAAAqmO,EAAA5rJ,EAAAu6M,GACA,MAAAC,EAAA5uD,EAAAwuD,EAAA70R,GAAA80R,EAAA90R,GAEAk1R,EAAAF,EADA3xD,EAAAI,WAAAhvE,KAAAh6E,GAAA,SACAw6M,GACA,OAAA7xD,EAAA8xD,EAAA,SAGA52R,EAAAouQ,QAAA,SAAA1sQ,EAAAy6E,GACA,OAAAs6M,EAAA/0R,GAAA,EAAAy6E,GAAA,CAAAA,EAAAz6E,IAAAA,EAAA0sQ,QAAAjyL,MAGAn8E,EAAAiuQ,QAAA,SAAAvsQ,EAAAy6E,GACA,OAAAs6M,EAAA/0R,GAAA,EAAAy6E,GAAA,CAAAA,EAAAz6E,IAAAA,EAAAusQ,QAAA9xL,gMCvJA,aACA,MAAAs/L,EAAAx7Q,EAAA,gCACA0rP,EAAA1rP,EAAA,YAEAF,EAAAC,QAAA,SAAA2xE,GACA,GAAAi6B,MAAAj6B,IAAAA,GAAA,EACA,MAAAg6K,EAAA,IAAAnmJ,MAAA,sDAAA,sBAEA,OAAAi2K,EAAA9pM,yFCRA,aAIA,MAAAklN,EAAA,MAiCA92R,EAAAC,QA5BA,SAAA2pG,GACA,MAAA07H,EAAA,IAAAF,WAAAx7H,GACA,IAAAtX,EAAA,EAEA,GAAAsX,EAAA,EAEA,GAAAA,EAAAktL,EACA,KAAAxkM,EAAAsX,GACAtX,EAAAwkM,EAAAltL,GACA+wH,OAAA69C,gBACAlzC,EAAAwD,SAAAx2I,EAAAA,GAAAsX,EAAAtX,KAEAA,GAAAsX,EAAAtX,IAEAqoI,OAAA69C,gBACAlzC,EAAAwD,SAAAx2I,EAAAA,EAAAwkM,IAEAxkM,GAAAwkM,QAIAn8D,OAAA69C,gBAAAlzC,GAIA,OAAAA,iCClCA,aAEAplO,EAAA,uBACAA,EAAA,sBACA,MAAAyrP,EAAAzrP,EAAA,yBACA62R,0BAAAA,EAAAC,sBAAAA,GAAA92R,EAAA,aACA6kO,EAAA7kO,EAAA,2BACA8kO,EAAA9kO,EAAA,yBAGAD,EAAA0tR,WAAA,SAAAroD,GACA,MAAAsoB,EAAAjC,EAAAiC,KAAAmO,QAAA/2B,EAAAM,EAAA,UACA65C,EAAAxzB,EAAA8B,IAAAmf,mBAAAhf,GAGA,MAAA,CACA2oC,IAAA,MACA31R,EAAAm2R,EAAA5X,EAAAv+Q,GACAF,EAAAq2R,EAAA5X,EAAAz+Q,GACA6pI,EAAAwsJ,EAAA5X,EAAA50I,GACA12D,EAAAkjN,EAAA5X,EAAAtrM,GACAonC,EAAA87K,EAAA5X,EAAAlkK,GACAg8K,GAAAF,EAAA5X,EAAA7B,IACA4Z,GAAAH,EAAA5X,EAAA1B,IACA0Z,GAAAJ,EAAA5X,EAAAzB,MACAmQ,IAAA,QACAuJ,IAAA,eAKAn3R,EAAAutR,WAAA,SAAAC,GACA,MAAA7/B,EAAAjC,EAAA8B,IAAAK,iBAAA,CACAltP,EAAAo2R,EAAAvJ,EAAA7sR,GACAF,EAAAs2R,EAAAvJ,EAAA/sR,GACA6pI,EAAAysJ,EAAAvJ,EAAAljJ,GACA12D,EAAAmjN,EAAAvJ,EAAA55M,GACAonC,EAAA+7K,EAAAvJ,EAAAxyK,GACAqiK,GAAA0Z,EAAAvJ,EAAAwJ,IACAxZ,GAAAuZ,EAAAvJ,EAAAyJ,IACAxZ,KAAAsZ,EAAAvJ,EAAA0J,MAGA,OAAApyD,EAAA4mB,EAAAiC,KAAAC,MAAAD,GAAAG,WAAA,UAIA9tP,EAAAytR,UAAA,SAAApoD,GACA,MAAAsoB,EAAAjC,EAAAiC,KAAAmO,QAAA/2B,EAAAM,EAAA,UACA+5C,EAAA1zB,EAAA8B,IAAA01B,kBAAAv1B,GAEA,MAAA,CACA2oC,IAAA,MACA31R,EAAAm2R,EAAA1X,EAAAz+Q,GACAF,EAAAq2R,EAAA1X,EAAA3+Q,GACAmtR,IAAA,QACAuJ,IAAA,eAKAn3R,EAAAktR,UAAA,SAAAM,GACA,MAAA7/B,EAAAjC,EAAA8B,IAAA+1B,gBAAA,CACA5iR,EAAAo2R,EAAAvJ,EAAA7sR,GACAF,EAAAs2R,EAAAvJ,EAAA/sR,KAGA,OAAAqkO,EAAA4mB,EAAAiC,KAAAC,MAAAD,GAAAG,WAAA,uNCnEA,aAEA7tP,EAAA,uBACAA,EAAA,uBACA,MAAAyrP,EAAAzrP,EAAA,wBACA6kO,EAAA7kO,EAAA,2BACA8kO,EAAA9kO,EAAA,yBACAqoO,EAAAroO,EAAA,sBAEAD,EAAA82R,0BAAA,CAAA14K,EAAAtO,KAEA,IAAAmtH,EAAAkI,WAAAhvE,KAAA/3C,EAAAyoJ,MAAAqiB,eAQA,GAFAjsD,EAAA,IAAAA,EAAA,GAAAA,EAAAnrJ,MAAA,GAAAmrJ,EAEA,MAAAntH,EAAA,CACA,GAAAmtH,EAAAtrJ,OAAAm+B,EAAA,MAAA,IAAAtK,MAAA,yCACAy3H,EAAAqL,EAAA,CAAA,IAAAnD,WAAAr1H,EAAAmtH,EAAAtrJ,QAAAsrJ,IAGA,OAAA8H,EAAA9H,EAAA,cAIAj9N,EAAA+2R,sBAAA70L,IACA,MAAA+6H,EAAAj9N,EAAAo3R,kBAAAl1L,GACA,OAAA,IAAAwpJ,EAAA4d,KAAAD,WAAAtkC,EAAA9H,EAAA,UAAA,KAGAj9N,EAAAo3R,kBAAA,CAAAl1L,EAAA4N,KACA,IAAAmtH,EAAA6H,EAAA5iI,EAAA,gBAEA,GAAA,MAAA4N,EAAA,CACA,GAAAmtH,EAAAtrJ,OAAAm+B,EAAA,MAAA,IAAAtK,MAAA,yCACAy3H,EAAAqL,EAAA,CAAA,IAAAnD,WAAAr1H,EAAAmtH,EAAAtrJ,QAAAsrJ,IAGA,OAAAA,0NCzCA,aAEAh9N,EAAA,sBACA,MAAAyrP,EAAAzrP,EAAA,yBACA82R,sBAAAA,GAAA92R,EAAA,WAEA,SAAAgzM,EAAAvxM,EAAAy8G,GACA,OAAAA,EAAArnC,KAAA20E,GAAAsrI,EAAAr1R,EAAA+pJ,MAWA1rJ,EAAAC,QAAA,CACAu2R,QALA,SAAA70R,GACA,OAAAgqP,EAAA8B,IAAAo0B,mBAAA3uE,EAAAvxM,EAAA,CAAA,IAAA,QAKA80R,SAVA,SAAA90R,GACA,OAAAgqP,EAAA8B,IAAA80B,oBAAArvE,EAAAvxM,EAAA,CAAA,IAAA,IAAA,IAAA,IAAA,IAAA,KAAA,KAAA,mHCXA,aAEA,MAAAm5N,EAAA56N,EAAA,aACA4rR,EAAA5rR,EAAA,sBAEAF,EAAAC,QAAA,CAUAsvN,OAAAtvE,eAAAk/H,EAAAr7C,GACA,MAAAunC,EAAAygB,EAAAjrR,SACA2sP,QAAA6d,EAAAgD,QAAA8Q,EAAAr7C,GAEA,OADAhJ,EAAAxqH,MAAAE,OACAP,OAAAu9I,iFCnBA,aAEA,MAAAo/B,EAAA1sR,EAAA,8BACA0rP,EAAA1rP,EAAA,YACA4kO,EAAA5kO,EAAA,sBACAwkO,EAAAxkO,EAAA,eACAy6N,EAAAz6N,EAAA,aACA2sR,EAAA3sR,EAAA,UACA4sR,EAAA5sR,EAAA,cAEA,MAAAo3R,EACA9zR,YAAA7B,GACAgrG,KAAAjD,KAAA6tL,EAAA51R,EAAAg5N,EAAA68D,iBAGAh0R,aAAA61J,EAAA2zH,GACA,OAAAryD,EAAAsyD,cAAAtgL,KAAAjD,KAAAsjL,EAAA3zH,GAGA71J,UACA,OAAAmpG,KAAAjD,KAGA47H,YACA,OAAAunD,EAAA1/B,UAAAl9I,OAAA,CACAs8I,KAAAsgC,EAAArgC,QAAAG,QACAL,KAAA3/I,KAAAygL,YACAhnD,SAGA5iO,OAAA7B,GACA,OAAAmjO,EAAAn4H,KAAA24H,MAAA3jO,EAAA2jO,OAGA9hO,aACA,OAAAopR,EAAA5xD,aAAAruH,KAAA24H,MAAA,aAIA,MAAAmyD,EAGAj0R,YAAA7B,EAAA09Q,GACA1yK,KAAAjD,KAAA6tL,EAAA51R,EAAAg5N,EAAA+8D,kBACA/qL,KAAA2gL,WAAAiK,EAAAlY,EAAA1kD,EAAA68D,iBAGAh0R,WAAA8iF,GACA,OAAAq0I,EAAA4yD,YAAA5gL,KAAAjD,KAAApjB,GAGA++I,aACA,OAAA,IAAAiyD,EAAA3qL,KAAA2gL,YAGA9pR,UACA,OAAAmpG,KAAAjD,KAGA47H,YACA,OAAAunD,EAAAxgC,WAAAp8I,OAAA,CACAs8I,KAAAsgC,EAAArgC,QAAAG,QACAL,KAAA3/I,KAAAygL,YACAhnD,SAGA5iO,OAAA7B,GACA,OAAAmjO,EAAAn4H,KAAA24H,MAAA3jO,EAAA2jO,OAGA9hO,aACA,OAAAopR,EAAA5xD,aAAAruH,KAAA24H,MAAA,YAYA9hO,WACA,MAAA0lO,EAAAxE,EAAAz0H,OAAAtD,KAAA04H,OAAAC,MAAA,YACA,aAAAZ,EAAAc,YAAA0D,GAUA1lO,aAAAsgO,EAAAH,EAAA,cACA,GAAA,eAAAA,EACA,OAAAmpD,EAAAv9D,OAAA5iH,KAAA24H,MAAAxB,GAEA,MAAA8nB,EAAA,IAAAnmJ,MAAA,kBAAAk+H,uBAAA,8BAmCA,SAAA4zD,EAAA51R,EAAAiwE,GAEA,IADAjwE,EAAAyjO,WAAAhvE,KAAAz0J,GAAA,KACAiwE,SAAAA,EACA,MAAAg6K,EAAA,IAAAnmJ,MAAA,sCAAA7zB,UAAAjwE,EAAAiwE,UAAA,wBAEA,OAAAjwE,EAGA3B,EAAAC,QAAA,CACAq3R,iBAAAA,EACAG,kBAAAA,EACA7qC,2BAzCA,SAAAtnB,GAEA,GAAAA,EAAA1zJ,OAAA+oJ,EAAA+8D,iBAAA,CAEA,MAAAvG,GADA7rD,EAAAiyD,EAAAjyD,EAAA3K,EAAA+8D,iBAAA/8D,EAAA68D,kBACAzlN,MAAA,EAAA4oJ,EAAA+8D,kBACAtG,EAAA9rD,EAAAvzJ,MAAA4oJ,EAAA+8D,iBAAApyD,EAAA1zJ,QACA,OAAA,IAAA6lN,EAAAtG,EAAAC,GAIA,MAAAD,GADA7rD,EAAAiyD,EAAAjyD,EAAA3K,EAAA+8D,mBACA3lN,MAAA,EAAA4oJ,EAAA+8D,kBACAtG,EAAA9rD,EAAAvzJ,MAAA4oJ,EAAA68D,iBACA,OAAA,IAAAC,EAAAtG,EAAAC,IA8BA/jC,0BA3BA,SAAA/nB,GAEA,OADAA,EAAAiyD,EAAAjyD,EAAA3K,EAAA68D,iBACA,IAAAF,EAAAhyD,IA0BA0B,gBAvBA/mF,iBACA,MAAAk/H,WAAAA,EAAAE,UAAAA,SAAA1kD,EAAA8mD,cACA,OAAA,IAAAgW,EAAAtY,EAAAE,IAsBApyB,wBAnBAhtG,eAAAitG,GACA,MAAAiyB,WAAAA,EAAAE,UAAAA,SAAA1kD,EAAAg9D,oBAAAzqC,GACA,OAAA,IAAAuqC,EAAAtY,EAAAE,qMCnIA,aAEAn/Q,EAAA,0BACA,MAAAyrP,EAAAzrP,EAAA,wBACAD,EAAAu3R,gBAAA7rC,EAAA8B,IAAAzB,QAAAjjB,UAAAsnD,uBACApwR,EAAAy3R,iBAAA/rC,EAAA8B,IAAAzB,QAAAjjB,UAAAunD,wBAEArwR,EAAAwhR,YAAAxhI,iBACA,OAAA0rG,EAAA8B,IAAAzB,QAAAhlB,mBAIA/mO,EAAA03R,oBAAA13I,eAAAitG,GACA,OAAAvB,EAAA8B,IAAAzB,QAAAhlB,gBAAA,CAAAkmB,KAAAA,KAGAjtP,EAAAstR,YAAAttI,eAAAt+I,EAAAy6E,GACA,OAAAuvK,EAAA8B,IAAAzB,QAAAiJ,KAAA,CAAA3uK,QAAAlK,EAAA+iM,WAAAx9Q,KAIA1B,EAAAgtR,cAAAhtI,eAAAt+I,EAAAqrR,EAAA5wM,GACA,OAAAuvK,EAAA8B,IAAAzB,QAAAs2B,OAAA,CAAA1uL,UAAAo5L,EAAA1mM,QAAAlK,EAAAijM,UAAA19Q,kGCtBA,aAEA,MAAAirR,EAAA1sR,EAAA,8BACA0rP,EAAA1rP,EAAA,YACA4kO,EAAA5kO,EAAA,sBACA8kO,EAAA9kO,EAAA,yBAEA4sR,EAAA5sR,EAAA,cAEAF,EAAAC,QAAA,CAAA23R,EAAAlc,EAAA/gD,KACAA,EAAAA,GAAAz6N,EAAA,cAAAA,CAAAw7Q,GAEA,MAAAmc,EACAr0R,YAAA7B,GACAg5N,EAAAm9D,kBAAAn2R,GACAgrG,KAAAjD,KAAA/nG,EAGA6B,OAAA61J,EAAA2zH,GACA,OAAAryD,EAAAsyD,cAAAtgL,KAAAjD,KAAAsjL,EAAA3zH,GAGA71J,UACA,OAAAm3N,EAAAo9D,kBAAAprL,KAAAjD,MAGA47H,YACA,OAAAsyD,EAAAzqC,UAAAl9I,OAAA,CACAs8I,KAAAqrC,EAAAprC,QAAAK,UACAP,KAAA3/I,KAAAygL,YACAhnD,SAGA5iO,OAAA7B,GACA,OAAAmjO,EAAAn4H,KAAA24H,MAAA3jO,EAAA2jO,OAGA9hO,OACA,OAAAopR,EAAA5xD,aAAAruH,KAAA24H,MAAA,aAIA,MAAA0yD,EACAx0R,YAAA7B,EAAA09Q,GACA1yK,KAAAjD,KAAA/nG,EACAgrG,KAAA2gL,WAAAjO,GAAA1kD,EAAAs9D,iBAAAt2R,GACAg5N,EAAAu9D,mBAAAvrL,KAAAjD,MACAixH,EAAAm9D,kBAAAnrL,KAAA2gL,YAGA9pR,KAAA8iF,GACA,OAAAq0I,EAAA4yD,YAAA5gL,KAAAjD,KAAApjB,GAGA++I,aACA,OAAA,IAAAwyD,EAAAlrL,KAAA2gL,YAGA9pR,UACA,OAAAmpG,KAAAjD,KAGA47H,YACA,OAAAsyD,EAAAvrC,WAAAp8I,OAAA,CACAs8I,KAAAqrC,EAAAprC,QAAAK,UACAP,KAAA3/I,KAAAygL,YACAhnD,SAGA5iO,OAAA7B,GACA,OAAAmjO,EAAAn4H,KAAA24H,MAAA3jO,EAAA2jO,OAGA9hO,OACA,OAAAopR,EAAA5xD,aAAAruH,KAAA24H,MAAA,YAYA9hO,WACA,MAAAw8G,QAAArT,KAAA04H,OAAArlH,OACA,OAAAglH,EAAAhlH,EAAA,aAUAx8G,aAAAsgO,EAAAH,EAAA,cACA,GAAA,eAAAA,EACA,OAAAmpD,EAAAv9D,OAAA5iH,KAAA24H,MAAAxB,GAEA,MAAA8nB,EAAA,IAAAnmJ,MAAA,kBAAAk+H,uBAAA,8BAkBA,MAAA,CACAk0D,mBAAAA,EACAG,oBAAAA,EACAlrC,6BAhBA,SAAAxnB,GACA,OAAA,IAAA0yD,EAAA1yD,IAgBAgoB,4BAbA,SAAAhoB,GACA,OAAA,IAAAuyD,EAAAvyD,IAaA0B,gBAVA/mF,iBACA,MAAAkxI,QAAAx2D,EAAA8mD,cACA,OAAA,IAAAuW,EAAA7G,mMCrHA,aAEA,MAAAllC,EAAA/rP,EAAA,aACA0sR,EAAA1sR,EAAA,8BACAi4R,EAAA,WAEAn4R,EAAAC,QAAAy7Q,IAkCA,SAAAwc,EAAAv2R,GACA,IAAAsqP,EAAAmsC,iBAAAz2R,GACA,MAAA,IAAA8jG,MAAA,uBAeA,MAAA,CACAg8K,YAjDA,WACA,IAAAtC,EACA,GACAA,EAAAzD,EAAA,WACAzvB,EAAAmsC,iBAAAjZ,IACA,OAAAA,GA6CAuY,iBApDA,GAqDAnK,YA3CAttI,eAAAt+I,EAAAy6E,GACA,MAAAypJ,QAAA+mD,EAAA/mD,OAAAzpJ,EAAA+7M,GACAnL,EAAA/gC,EAAAosC,UAAAxyD,EAAAlkO,GACA,OAAAsqP,EAAAqsC,gBAAAtL,EAAAp5L,YAyCAq5L,cAtCAhtI,eAAAt+I,EAAAqrR,EAAA5wM,GACA,MAAAypJ,QAAA+mD,EAAA/mD,OAAAzpJ,EAAA+7M,GAEA,OADAnL,EAAA/gC,EAAAssC,gBAAAvL,GACA/gC,EAAAusC,YAAAxL,EAAAnnD,EAAAlkO,IAoCAo2R,kBAjCA,SAAAp2R,GACA,IAAAsqP,EAAAwsC,gBAAA92R,GACA,MAAA,IAAA8jG,MAAA,sBAEA,OAAAwmJ,EAAAysC,iBAAA/2R,GAAA,IA8BAg3R,oBA3BA,SAAAh3R,GACA,OAAAsqP,EAAAysC,iBAAA/2R,GAAA,IA2BAu2R,mBAAAA,EACAJ,kBAnBA,SAAAn2R,GACA,IAAAsqP,EAAAwsC,gBAAA92R,GACA,MAAA,IAAA8jG,MAAA,uBAkBAwyL,iBAdA,SAAA9Y,GAEA,OADA+Y,EAAA/Y,GACAlzB,EAAA2sC,gBAAAzZ,0FCtDAn/Q,EAAAC,QAAAC,EAAA,QAAAA,CAAAA,EAAA,yFCAA,MAAAw/H,EACA,wCADAA,EAGA,oEAHAA,EAIA,8CAJAA,EAKA,wCALAA,EAMA,yBANAA,EAOA,iCAPAA,EAQA,iCARAA,EASA,0CATAA,EAUA,gCAVAA,EAWA,uEAXAA,EAYA,kCAZAA,EAaA,wCAGA,SAAAl6B,EAAAqzL,EAAAz8M,GACA,IAAAy8M,EAAA,MAAA,IAAApzL,MAAArpB,GAGA,SAAA08M,EAAAt5R,EAAAa,EAAAuxE,GAGA,GAFA4zB,EAAAnlG,aAAA+kO,WAAA,YAAA5lO,8BAEA6C,IAAAuvE,EACA,GAAA44B,MAAA/gB,QAAA7X,GAAA,CACA,MACAwK,EAAA,YAAA58E,sCADAoyE,EAAAqF,KAAA,SAEAuuB,EAAA5zB,EAAAwJ,SAAA/6E,EAAAuxE,QAAAwK,OACA,CACA,MAAAA,EAAA,YAAA58E,qCAAAoyE,IACA4zB,EAAAnlG,EAAAuxE,SAAAA,EAAAwK,IAKA,SAAA28M,EAAA14R,GACAmlG,EAAA,YAAAiF,EAAApqG,GAAA,uCAGA,SAAA24R,EAAAvtD,EAAA,CAAA17H,GAAA,IAAAq1H,WAAAr1H,IAAAn+B,GAGA,MAFA,mBAAA65J,IAAAA,EAAAA,EAAA75J,IACAknN,EAAA,SAAArtD,EAAA75J,GACA65J,EAGA,SAAAhhI,EAAApqG,GACA,OAAAF,OAAAmqG,UAAAS,SAAAR,KAAAlqG,GAAA0xE,MAAA,GAAA,GAGA/xE,EAAAC,QAAAgsP,IACA,CACAzoP,iBAAA0pP,GAOA,OANA1nJ,EACA,OAAA0nJ,GAAAA,aAAA9nB,WACA,6CAEA,OAAA8nB,GAAA4rC,EAAA,OAAA5rC,EAAA,IAEAjB,EAAAgtC,iBAAA/rC,IACA,KAAA,EACA,MAAA,IAAAznJ,MAAAi6B,KAIA04J,iBAAAc,IACAJ,EAAA,cAAAI,EAAA,IAEA,IAAAjtC,EAAAmsC,iBAAAc,IAGA11R,iBAAA01R,GAGA,OAFAJ,EAAA,cAAAI,EAAA,IAEAjtC,EAAAktC,iBAAAD,IACA,KAAA,EACA,OAAAA,EACA,KAAA,EACA,MAAA,IAAAzzL,MAAAi6B,KAIAl8H,mBAAA01R,EAAAE,GAIA,OAHAN,EAAA,cAAAI,EAAA,IACAJ,EAAA,QAAAM,EAAA,IAEAntC,EAAAotC,mBAAAH,EAAAE,IACA,KAAA,EACA,OAAAF,EACA,KAAA,EACA,MAAA,IAAAzzL,MAAAi6B,KAIAl8H,mBAAA01R,EAAAE,GAIA,OAHAN,EAAA,cAAAI,EAAA,IACAJ,EAAA,QAAAM,EAAA,IAEAntC,EAAAqtC,mBAAAJ,EAAAE,IACA,KAAA,EACA,OAAAF,EACA,KAAA,EACA,MAAA,IAAAzzL,MAAAi6B,KAIA+4J,gBAAAc,IACAT,EAAA,aAAAS,EAAA,CAAA,GAAA,KAEA,IAAAttC,EAAAwsC,gBAAAc,IAGA/1R,gBAAA01R,EAAAM,GAAA,EAAA/tD,GAKA,OAJAqtD,EAAA,cAAAI,EAAA,IACAH,EAAAS,GACA/tD,EAAAutD,EAAAvtD,EAAA+tD,EAAA,GAAA,IAEAvtC,EAAA2sC,gBAAAntD,EAAAytD,IACA,KAAA,EACA,OAAAztD,EACA,KAAA,EACA,MAAA,IAAAhmI,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,KAIAl8H,iBAAA+1R,EAAAC,GAAA,EAAA/tD,GAKA,OAJAqtD,EAAA,aAAAS,EAAA,CAAA,GAAA,KACAR,EAAAS,GACA/tD,EAAAutD,EAAAvtD,EAAA+tD,EAAA,GAAA,IAEAvtC,EAAAysC,iBAAAjtD,EAAA8tD,IACA,KAAA,EACA,OAAA9tD,EACA,KAAA,EACA,MAAA,IAAAhmI,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,KAIAl8H,gBAAA+1R,EAAAC,GAAA,EAAA/tD,GAKA,OAJAqtD,EAAA,aAAAS,EAAA,CAAA,GAAA,KACAR,EAAAS,GACA/tD,EAAAutD,EAAAvtD,EAAA+tD,EAAA,GAAA,IAEAvtC,EAAAwtC,gBAAAhuD,EAAA8tD,IACA,KAAA,EACA,OAAA9tD,EACA,KAAA,EACA,MAAA,IAAAhmI,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,KAIAl8H,iBAAAk2R,EAAAF,GAAA,EAAA/tD,GACAjmI,EAAAgF,MAAA/gB,QAAAiwM,GAAA,uCACAl0L,EAAAk0L,EAAA9nN,OAAA,EAAA,6DACA,IAAA,MAAA2nN,KAAAG,EACAZ,EAAA,aAAAS,EAAA,CAAA,GAAA,KAKA,OAHAR,EAAAS,GACA/tD,EAAAutD,EAAAvtD,EAAA+tD,EAAA,GAAA,IAEAvtC,EAAA0tC,iBAAAluD,EAAAiuD,IACA,KAAA,EACA,OAAAjuD,EACA,KAAA,EACA,MAAA,IAAAhmI,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,KAIAl8H,kBAAA+1R,EAAAH,EAAAI,GAAA,EAAA/tD,GAMA,OALAqtD,EAAA,aAAAS,EAAA,CAAA,GAAA,KACAT,EAAA,QAAAM,EAAA,IACAL,EAAAS,GACA/tD,EAAAutD,EAAAvtD,EAAA+tD,EAAA,GAAA,IAEAvtC,EAAA2tC,kBAAAnuD,EAAA8tD,EAAAH,IACA,KAAA,EACA,OAAA3tD,EACA,KAAA,EACA,MAAA,IAAAhmI,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,KAIAl8H,kBAAA+1R,EAAAH,EAAAI,GAAA,EAAA/tD,GAMA,OALAqtD,EAAA,aAAAS,EAAA,CAAA,GAAA,KACAT,EAAA,QAAAM,EAAA,IACAL,EAAAS,GACA/tD,EAAAutD,EAAAvtD,EAAA+tD,EAAA,GAAA,IAEAvtC,EAAA4tC,kBAAApuD,EAAA8tD,EAAAH,IACA,KAAA,EACA,OAAA3tD,EACA,KAAA,EACA,MAAA,IAAAhmI,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,KAIAl8H,mBAAAwpR,GAGA,OAFA8L,EAAA,YAAA9L,EAAA,IAEA/gC,EAAA6tC,mBAAA9M,IACA,KAAA,EACA,OAAAA,EACA,KAAA,EACA,MAAA,IAAAvnL,MAAAi6B,KAIAl8H,gBAAAwpR,EAAAvhD,GACAqtD,EAAA,YAAA9L,EAAA,IAGA,MAAAxhL,EAAA,CAAAigI,OAFAA,EAAAutD,EAAAvtD,EAAA,IAEAsuD,UAAA,IACA,OAAA9tC,EAAAqsC,gBAAA9sL,EAAAwhL,IACA,KAAA,EACA,OAAAvhD,EAAA15J,MAAA,EAAAy5B,EAAAuuL,WACA,KAAA,EACA,MAAA,IAAAt0L,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,KAIAl8H,gBAAAwpR,EAAAvhD,GAIA,OAHAqtD,EAAA,YAAA9L,GACAvhD,EAAAutD,EAAAvtD,EAAA,IAEAwgB,EAAAssC,gBAAA9sD,EAAAuhD,IACA,KAAA,EACA,OAAAvhD,EACA,KAAA,EACA,MAAA,IAAAhmI,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,KAIAl8H,UAAAw2R,EAAAd,EAAA53R,EAAA,GAAAmqO,GACAqtD,EAAA,UAAAkB,EAAA,IACAlB,EAAA,cAAAI,EAAA,IACA1zL,EAAA,WAAAiF,EAAAnpG,GAAA,yCACAe,IAAAf,EAAA+3J,MAAAy/H,EAAA,eAAAx3R,EAAA+3J,WACAh3J,IAAAf,EAAA24R,SAAAz0L,EAAA,aAAAiF,EAAAnpG,EAAA24R,SAAA,6CAGA,MAAAzuL,EAAA,CAAA5X,UAFA63I,EAAAutD,EAAAvtD,EAAA,IAEAyuD,MAAA,MACA,OAAAjuC,EAAAosC,UAAA7sL,EAAAwuL,EAAAd,EAAA53R,EAAA+3J,KAAA/3J,EAAA24R,UACA,KAAA,EACA,OAAAzuL,EACA,KAAA,EACA,MAAA,IAAA/F,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,KAIAl8H,YAAAwpR,EAAAgN,EAAAT,GAKA,OAJAT,EAAA,YAAA9L,EAAA,IACA8L,EAAA,UAAAkB,EAAA,IACAlB,EAAA,aAAAS,EAAA,CAAA,GAAA,KAEAttC,EAAAusC,YAAAxL,EAAAgN,EAAAT,IACA,KAAA,EACA,OAAA,EACA,KAAA,EACA,OAAA,EACA,KAAA,EACA,MAAA,IAAA9zL,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,KAIAl8H,aAAAwpR,EAAAkN,EAAAF,EAAAR,GAAA,EAAA/tD,GAYA,OAXAqtD,EAAA,YAAA9L,EAAA,IACAxnL,EACA,WAAAiF,EAAAyvL,IACAA,GAAA,GACAA,GAAA,EACA,8DAEApB,EAAA,UAAAkB,EAAA,IACAjB,EAAAS,GACA/tD,EAAAutD,EAAAvtD,EAAA+tD,EAAA,GAAA,IAEAvtC,EAAAkuC,aAAA1uD,EAAAuhD,EAAAkN,EAAAF,IACA,KAAA,EACA,OAAAvuD,EACA,KAAA,EACA,MAAA,IAAAhmI,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,KAIAl8H,KAAA+1R,EAAAL,EAAA53R,EAAA,GAAAmqO,GAcA,OAbAqtD,EAAA,aAAAS,EAAA,CAAA,GAAA,KACAT,EAAA,cAAAI,EAAA,IACA1zL,EAAA,WAAAiF,EAAAnpG,GAAA,yCACAe,IAAAf,EAAA+3J,MAAAy/H,EAAA,eAAAx3R,EAAA+3J,WACAh3J,IAAAf,EAAAunO,QACArjI,EAAA,aAAAiF,EAAAnpG,EAAAunO,QAAA,iDACAxmO,IAAAf,EAAA84R,MAAAtB,EAAA,eAAAx3R,EAAA84R,KAAA,SACA/3R,IAAAf,EAAA+4R,MAAAvB,EAAA,eAAAx3R,EAAA+4R,KAAA,IACAvB,EAAA,SAAArtD,IAEAA,EAAAutD,EAAAvtD,EAAA,IAGAwgB,EAAAquC,KAAA7uD,EAAA8tD,EAAAL,EAAA53R,EAAA+3J,KAAA/3J,EAAAunO,OAAAvnO,EAAA84R,KAAA94R,EAAA+4R,OACA,KAAA,EACA,OAAA5uD,EACA,KAAA,EACA,MAAA,IAAAhmI,MAAAi6B,GACA,KAAA,EACA,MAAA,IAAAj6B,MAAAi6B,qCC3UA,MAEAnpD,EAAA,IAAAgkN,EAFAr6R,EAAA,YAAAq2E,IAEA,aACAikN,EAAAjkN,EAAAkkN,MAIAC,EAAAF,EAAA55R,EAAA04G,YAoCA,SAAAqhL,EAAApB,GAEA,MAAA/zM,EAAA+zM,EAAA,GACA,OAAA/zM,GACA,KAAA,EACA,KAAA,EACA,OAAA,KAAA+zM,EAAA3nN,OAAA,KAxCA,SAAA4T,EAAA40M,GACA,IAAA7/K,EAAA,IAAAmgL,EAAAN,GAGA,GAAA7/K,EAAAzG,IAAA0mL,EAAA3mN,IAAA,EAAA,OAAA,KACA0mC,EAAAA,EAAAqgL,MAAAJ,EAAAK,KAGA,IAAArgL,EAAAD,EAAAugL,SAAAC,QAAAxgL,GAAAygL,QAAAR,EAAAv0M,GAAAg1M,UAGA,OAFA,IAAAz1M,IAAAg1B,EAAA0gL,UAAA1gL,EAAAA,EAAA2gL,UAEA5kN,EAAA6kN,QAAA,CAAApzD,IAAA,CAAAztH,EAAAA,EAAAC,EAAAA,KA8BA6gL,CAAA71M,EAAA+zM,EAAAzwD,SAAA,EAAA,KACA,KAAA,EACA,KAAA,EACA,KAAA,EACA,OAAA,KAAAywD,EAAA3nN,OAAA,KA/BA,SAAA4T,EAAA40M,EAAAC,GACA,IAAA9/K,EAAA,IAAAmgL,EAAAN,GACA5/K,EAAA,IAAAkgL,EAAAL,GAGA,GAAA9/K,EAAAzG,IAAA0mL,EAAA3mN,IAAA,GAAA2mC,EAAA1G,IAAA0mL,EAAA3mN,IAAA,EAAA,OAAA,KAMA,GAJA0mC,EAAAA,EAAAqgL,MAAAJ,EAAAK,KACArgL,EAAAA,EAAAogL,MAAAJ,EAAAK,MAGA,IAAAr1M,GAAA,IAAAA,IAAAg1B,EAAA0gL,WAAA,IAAA11M,GAAA,OAAA,KAGA,MAAA81M,EAAA/gL,EAAAugL,SAAAC,QAAAxgL,GACA,OAAAC,EAAAsgL,SAAAS,QAAAD,EAAAN,QAAAR,EAAAv0M,IAAAu1M,SAEAjlN,EAAA6kN,QAAA,CAAApzD,IAAA,CAAAztH,EAAAA,EAAAC,EAAAA,KAFA,KAiBAihL,CAAAj2M,EAAA+zM,EAAAzwD,SAAA,EAAA,IAAAywD,EAAAzwD,SAAA,GAAA,KACA,QACA,OAAA,MAIA,SAAA4yD,EAAAjwD,EAAAkwD,GACA,MAAApC,EAAAoC,EAAA1rL,OAAA,KAAA,KAAAw7H,EAAA75J,QAGA,IAAA,IAAAkC,EAAA,EAAAA,EAAA23J,EAAA75J,SAAAkC,EAAA23J,EAAA33J,GAAAylN,EAAAzlN,GAGA9zE,EAAAC,QAAA,CACAg5R,iBAAA,IACA,EAGAz1R,iBAAA01R,GACA,MAAA0C,EAAA,IAAAlB,EAAAxB,GACA,OAAA0C,EAAA9nL,IAAA0mL,EAAA55R,GAAA,IAAAg7R,EAAAJ,SAAA,EAAA,GAGAh4R,iBAAA01R,GACA,MAAA0C,EAAA,IAAAlB,EAAAxB,GACAnR,EAAAyS,EAAA55R,EAAAq9H,IAAA29J,GAAAC,KAAArB,EAAA55R,GAAAk7R,YAAA12D,WAAA,KAAA,IAEA,OADA8zD,EAAA9qM,IAAA25L,GACA,GAGAvkR,mBAAA01R,EAAAE,GACA,MAAAwC,EAAA,IAAAlB,EAAAtB,GACA,GAAAwC,EAAA9nL,IAAA0mL,EAAA55R,IAAA,EAAA,OAAA,EAIA,GAFAg7R,EAAAG,KAAA,IAAArB,EAAAxB,IACA0C,EAAA9nL,IAAA0mL,EAAA55R,IAAA,GAAAg7R,EAAAI,KAAAxB,EAAA55R,GACAg7R,EAAAJ,SAAA,OAAA,EAEA,MAAAS,EAAAL,EAAAE,YAAA12D,WAAA,KAAA,IAGA,OAFA8zD,EAAA9qM,IAAA6tM,GAEA,GAGAz4R,mBAAA01R,EAAAE,GACA,IAAAwC,EAAA,IAAAlB,EAAAtB,GACA,GAAAwC,EAAA9nL,IAAA0mL,EAAA55R,IAAA,GAAAg7R,EAAAJ,SAAA,OAAA,EAEAI,EAAAM,KAAA,IAAAxB,EAAAxB,IACA0C,EAAA9nL,IAAA0mL,EAAA55R,IAAA,IAAAg7R,EAAAA,EAAAC,KAAArB,EAAA55R,IAEA,MAAAq7R,EAAAL,EAAAE,YAAA12D,WAAA,KAAA,IAGA,OAFA8zD,EAAA9qM,IAAA6tM,GAEA,GAGAxD,gBAAAc,GAEA,OADAoB,EAAApB,GACA,EAAA,EAGA/1R,gBAAAioO,EAAAytD,GACA,MAAA0C,EAAA,IAAAlB,EAAAxB,GACA,GAAA0C,EAAA9nL,IAAA0mL,EAAA55R,IAAA,GAAAg7R,EAAAJ,SAAA,OAAA,EAKA,OAFAE,EAAAjwD,EADAl1J,EAAA4lN,eAAAjD,GAAAkD,aAGA,GAGA54R,iBAAAioO,EAAA8tD,GACA,MAAA7X,EAAAiZ,EAAApB,GACA,GAAA,OAAA7X,EAAA,OAAA,EAKA,OAFAga,EAAAjwD,EADAi2C,EAAA0a,aAGA,GAGA54R,gBAAAioO,EAAA8tD,GACA,MAAA7X,EAAAiZ,EAAApB,GACA,GAAA,OAAA7X,EAAA,OAAA,EAEA,MAAAia,EAAAja,EAAA0a,YAIA,OAHAT,EAAAnhL,EAAAmhL,EAAAnhL,EAAA2gL,SACAO,EAAAjwD,EAAAkwD,GAEA,GAGAn4R,iBAAAioO,EAAAiuD,GACA,MAAA2C,EAAA,IAAA7xL,MAAAkvL,EAAA9nN,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA4lN,EAAA9nN,SAAAkC,EAEA,GADAuoN,EAAAvoN,GAAA6mN,EAAAjB,EAAA5lN,IACA,OAAAuoN,EAAAvoN,GAAA,OAAA,EAGA,IAAA6nN,EAAAU,EAAA,GAAAD,YACA,IAAA,IAAAtoN,EAAA,EAAAA,EAAAuoN,EAAAzqN,SAAAkC,EAAA6nN,EAAAA,EAAAhwM,IAAA0wM,EAAAvoN,GAAAk0J,KACA,OAAA2zD,EAAAW,aAAA,GAEAZ,EAAAjwD,EAAAkwD,GAEA,IAGAn4R,kBAAAioO,EAAA8tD,EAAAH,GACA,MAAA1X,EAAAiZ,EAAApB,GACA,GAAA,OAAA7X,EAAA,OAAA,EAGA,IADA0X,EAAA,IAAAsB,EAAAtB,IACAtlL,IAAA0mL,EAAA55R,IAAA,EAAA,OAAA,EAEA,MAAA+6R,EAAAja,EAAA0a,YAAAzwM,IAAA6uM,EAAAzpE,EAAAwrE,IAAAnD,IACA,OAAAuC,EAAAW,aAAA,GAEAZ,EAAAjwD,EAAAkwD,GAEA,IAGAn4R,kBAAAioO,EAAA8tD,EAAAH,GACA,MAAA1X,EAAAiZ,EAAApB,GACA,GAAA,OAAA7X,EAAA,OAAA,EAGA,IADA0X,EAAA,IAAAsB,EAAAtB,IACAtlL,IAAA0mL,EAAA55R,IAAA,GAAAw4R,EAAAoC,SAAA,OAAA,EAKA,OAFAE,EAAAjwD,EADAi2C,EAAA0a,YAAAG,IAAAnD,IAGA,GAGA51R,mBAAAwpR,GACA,MAAAryK,EAAA,IAAA+/K,EAAA1N,EAAAlkD,SAAA,EAAA,KACAjgJ,EAAA,IAAA6xM,EAAA1N,EAAAlkD,SAAA,GAAA,KACA,OAAAnuH,EAAA7G,IAAA0mL,EAAA55R,IAAA,GAAAioF,EAAAirB,IAAA0mL,EAAA55R,IAAA,EAAA,GAEA,IAAAioF,EAAAirB,IAAAv9B,EAAAimN,KACAxP,EAAA5+L,IAAAosM,EAAA55R,EAAAq9H,IAAAp1C,GAAAizM,YAAA12D,WAAA,KAAA,IAAA,IAGA,IAKA5hO,gBAAAgoG,EAAAwhL,GACA,MAAAyP,EAAAzP,EAAAlkD,SAAA,EAAA,IACA4zD,EAAA1P,EAAAlkD,SAAA,GAAA,IACA,GAAA,IAAA4xD,EAAA+B,GAAA3oL,IAAA0mL,EAAA55R,IAAA,EAAA,OAAA,EACA,GAAA,IAAA85R,EAAAgC,GAAA5oL,IAAA0mL,EAAA55R,IAAA,EAAA,OAAA,EAEA,MAAA6qO,OAAAA,GAAAjgI,EAGA,IAAAmP,EAAA8wH,EAAA3C,SAAA,EAAA,IACAnuH,EAAA,GAAA,EACAA,EAAAvsB,IAAAquM,EAAA,GAEA,IAAAE,EAAA,GACAC,EAAA,EACA,KAAAD,EAAA,GAAA,IAAAhiL,EAAAiiL,MAAA,IAAAjiL,EAAAiiL,EAAA,MAAAD,IAAAC,GAGA,GADAjiL,EAAAA,EAAAmuH,SAAA8zD,GACA,IAAAjiL,EAAA,GAAA,OAAA,EACA,GAAAgiL,EAAA,GAAA,IAAAhiL,EAAA,MAAA,IAAAA,EAAA,IAAA,OAAA,EAGA,IAAA9xB,EAAA4iJ,EAAA3C,SAAA,GAAA,IACAjgJ,EAAA,GAAA,EACAA,EAAAuF,IAAAsuM,EAAA,GAEA,IAAAG,EAAA,GACAC,EAAA,EACA,KAAAD,EAAA,GAAA,IAAAh0M,EAAAi0M,MAAA,IAAAj0M,EAAAi0M,EAAA,MAAAD,IAAAC,GAGA,OADAj0M,EAAAA,EAAAigJ,SAAAg0D,GACA,IAAAj0M,EAAA,IACAg0M,EAAA,GAAA,IAAAh0M,EAAA,MAAA,IAAAA,EAAA,IADA,GAIA2iB,EAAAuuL,UAAA,EAAA4C,EAAAE,EAIApxD,EAAA,GAAA,GACAA,EAAA,GAAAjgI,EAAAuuL,UAAA,EACAtuD,EAAA,GAAA,EACAA,EAAA,GAAA9wH,EAAA/oC,OACA65J,EAAAr9I,IAAAusB,EAAA,GACA8wH,EAAA,EAAAkxD,GAAA,EACAlxD,EAAA,EAAAkxD,GAAA9zM,EAAAjX,OACA65J,EAAAr9I,IAAAvF,EAAA,EAAA8zM,GAEA,IAKAn5R,gBAAAioO,EAAAuhD,GACA,GAAAA,EAAAp7M,OAAA,EAAA,OAAA,EACA,GAAAo7M,EAAAp7M,OAAA,GAAA,OAAA,EACA,GAAA,KAAAo7M,EAAA,GAAA,OAAA,EACA,GAAAA,EAAA,KAAAA,EAAAp7M,OAAA,EAAA,OAAA,EACA,GAAA,IAAAo7M,EAAA,GAAA,OAAA,EAEA,MAAA2P,EAAA3P,EAAA,GACA,GAAA,IAAA2P,EAAA,OAAA,EACA,GAAA,EAAAA,GAAA3P,EAAAp7M,OAAA,OAAA,EACA,GAAA,IAAAo7M,EAAA,EAAA2P,GAAA,OAAA,EAEA,MAAAE,EAAA7P,EAAA,EAAA2P,GACA,GAAA,IAAAE,EAAA,OAAA,EACA,GAAA,EAAAF,EAAAE,IAAA7P,EAAAp7M,OAAA,OAAA,EAEA,GAAA,IAAAo7M,EAAA,GAAA,OAAA,EACA,GAAA2P,EAAA,GAAA,IAAA3P,EAAA,MAAA,IAAAA,EAAA,IAAA,OAAA,EAEA,GAAA,IAAAA,EAAA2P,EAAA,GAAA,OAAA,EACA,GAAAE,EAAA,GAAA,IAAA7P,EAAA2P,EAAA,MAAA,IAAA3P,EAAA2P,EAAA,IAAA,OAAA,EAEA,IAAAF,EAAAzP,EAAAlkD,SAAA,EAAA,EAAA6zD,GAEA,GADA,KAAAF,EAAA7qN,QAAA,IAAA6qN,EAAA,KAAAA,EAAAA,EAAA3zD,SAAA,IACA2zD,EAAA7qN,OAAA,GAAA,OAAA,EAEA,IAAA8qN,EAAA1P,EAAAlkD,SAAA,EAAA6zD,GAEA,GADA,KAAAD,EAAA9qN,QAAA,IAAA8qN,EAAA,KAAAA,EAAAA,EAAA3qN,MAAA,IACA2qN,EAAA9qN,OAAA,GAAA,MAAA,IAAA6zB,MAAA,wBAEA,IAAAkV,EAAA,IAAA+/K,EAAA+B,GACA9hL,EAAA7G,IAAA0mL,EAAA55R,IAAA,IAAA+5G,EAAA,IAAA+/K,EAAA,IAEA,IAAA7xM,EAAA,IAAA6xM,EAAA1N,EAAAlkD,SAAA,EAAA6zD,IAMA,OALA9zM,EAAAirB,IAAA0mL,EAAA55R,IAAA,IAAAioF,EAAA,IAAA6xM,EAAA,IAEAjvD,EAAAr9I,IAAAusB,EAAAmhL,YAAA12D,WAAA,KAAA,IAAA,GACAqG,EAAAr9I,IAAAvF,EAAAizM,YAAA12D,WAAA,KAAA,IAAA,IAEA,GAGA5hO,UAAAgoG,EAAAllB,EAAA4yM,EAAA7/H,EAAA4gI,GACA,GAAAA,EAAA,CACA,MAAA8C,EAAA9C,EACAA,EAAAhuD,IACA,MAAAigD,EAAA6Q,EAAAz2M,EAAA4yM,EAAA,KAAA7/H,EAAA4yE,GAGA,KADAigD,aAAA9mD,YAAA,KAAA8mD,EAAAt6M,QACA,MAAA,IAAA6zB,MAAA,mBAEA,OAAA,IAAAi1L,EAAAxO,IAIA,MAAA3hJ,EAAA,IAAAmwJ,EAAAxB,GACA,GAAA3uJ,EAAAz2B,IAAA0mL,EAAA55R,IAAA,GAAA2pI,EAAAixJ,SAAA,OAAA,EAEA,IAAAxO,EACA,IACAA,EAAAz2M,EAAA0+K,KAAA3uK,EAAA4yM,EAAA,CAAA8D,WAAA,EAAAh8R,EAAAi5R,EAAAgD,KAAA5jI,IACA,MAAAjzD,GACA,OAAA,EAOA,OAJAoF,EAAA5X,UAAAxF,IAAA4+L,EAAAryK,EAAAmhL,YAAA12D,WAAA,KAAA,IAAA,GACA55H,EAAA5X,UAAAxF,IAAA4+L,EAAAnkM,EAAAizM,YAAA12D,WAAA,KAAA,IAAA,IACA55H,EAAA0uL,MAAAlN,EAAAkQ,cAEA,GAGA15R,YAAAwpR,EAAAgN,EAAAT,GACA,MAAA4D,EAAA,CAAAxiL,EAAAqyK,EAAAlkD,SAAA,EAAA,IAAAjgJ,EAAAmkM,EAAAlkD,SAAA,GAAA,KAEAs0D,EAAA,IAAA1C,EAAAyC,EAAAxiL,GACA0iL,EAAA,IAAA3C,EAAAyC,EAAAt0M,GACA,GAAAu0M,EAAAtpL,IAAA0mL,EAAA55R,IAAA,GAAAy8R,EAAAvpL,IAAA0mL,EAAA55R,IAAA,EAAA,OAAA,EACA,GAAA,IAAAy8R,EAAAvpL,IAAAv9B,EAAAimN,KAAAY,EAAA5B,UAAA6B,EAAA7B,SAAA,OAAA,EAEA,MAAA9Z,EAAAiZ,EAAApB,GACA,GAAA,OAAA7X,EAAA,OAAA,EAEA,MAAAia,EAAAja,EAAA0a,YAEA,OADA7lN,EAAA+rM,OAAA0X,EAAAmD,EAAAxB,GACA,EAAA,GAGAn4R,aAAAioO,EAAAuhD,EAAAkN,EAAAF,GACA,MAAAmD,EAAA,CAAAxiL,EAAAqyK,EAAAj7M,MAAA,EAAA,IAAA8W,EAAAmkM,EAAAj7M,MAAA,GAAA,KAEAqrN,EAAA,IAAA1C,EAAAyC,EAAAxiL,GACA0iL,EAAA,IAAA3C,EAAAyC,EAAAt0M,GACA,GAAAu0M,EAAAtpL,IAAA0mL,EAAA55R,IAAA,GAAAy8R,EAAAvpL,IAAA0mL,EAAA55R,IAAA,EAAA,OAAA,EAEA,GAAAw8R,EAAA5B,UAAA6B,EAAA7B,SAAA,OAAA,EAGA,IAAAG,EACA,IACAA,EAAAplN,EAAA+mN,cAAAtD,EAAAmD,EAAAjD,GACA,MAAA9zL,GACA,OAAA,EAKA,OAFAs1L,EAAAjwD,EAAAkwD,GAEA,GAGAn4R,KAAAioO,EAAA8tD,EAAAL,EAAA7/H,EAAAwvE,EAAAuxD,EAAAC,GACA,MAAA3Y,EAAAiZ,EAAApB,GACA,GAAA,OAAA7X,EAAA,OAAA,EAEA,MAAA6b,EAAA,IAAA7C,EAAAxB,GACA,GAAAqE,EAAAzpL,IAAA0mL,EAAA55R,IAAA,GAAA28R,EAAA/B,SAAA,OAAA,EAEA,MAAAG,EAAAja,EAAA0a,YAAAG,IAAAgB,GAEA,QAAAl7R,IAAAwmO,EAAA,CACA,MAAAxvE,EAAAsiI,EAAA1rL,OAAA,MAAA,GACAsoK,EAAAhiM,EAAAypC,OAAAsiD,OAAAjJ,GAAAwsE,SACA,IAAA,IAAA/xJ,EAAA,EAAAA,EAAA,KAAAA,EAAA23J,EAAA33J,GAAAykM,EAAAzkM,OACA,CACAsmN,IAAAA,EAAA,IAAAh1D,WAAA,KACA,MAAA7qH,EAAAohL,EAAA6B,OAAA1tL,QAAA,KAAA,IACA,IAAA,IAAAh8B,EAAA,EAAAA,EAAA,KAAAA,EAAAsmN,EAAAtmN,GAAAymC,EAAAzmC,GAEAumN,IAAAA,EAAA,IAAAj1D,WAAA,KACA,MAAA5qH,EAAAmhL,EAAA8B,OAAA3tL,QAAA,KAAA,IACA,IAAA,IAAAh8B,EAAA,EAAAA,EAAA,KAAAA,EAAAumN,EAAAvmN,GAAA0mC,EAAA1mC,GAEA,MAAAksC,EAAA6oH,EAAAuxD,EAAAC,EAAAhhI,GAGA,KADAr5C,aAAAolH,YAAAplH,EAAApuC,SAAA65J,EAAA75J,QACA,OAAA,EAEA65J,EAAAr9I,IAAA4xB,GAGA,OAAA,kDC/YA,aAEA,IAAA09K,EAAAz9R,EAEAy9R,EAAArtL,QAAAnwG,EAAA,mBAAAmwG,QACAqtL,EAAAxQ,MAAAhtR,EAAA,oBACAw9R,EAAAC,KAAAz9R,EAAA,WACAw9R,EAAAjD,MAAAv6R,EAAA,oBACAw9R,EAAAE,OAAA19R,EAAA,qBAGAw9R,EAAAnnN,GAAAr2E,EAAA,iBACAw9R,EAAAG,MAAA39R,EAAA,y3CCZA,aAEA,IAAAgtR,EAAAjtR,EACAy6R,EAAAx6R,EAAA,SACA49R,EAAA59R,EAAA,uBACA69R,EAAA79R,EAAA,6BAEAgtR,EAAA1nL,OAAAs4L,EACA5Q,EAAAp9K,QAAAiuL,EAAAjuL,QACAo9K,EAAA8Q,MAAAD,EAAAC,MACA9Q,EAAAnrB,MAAAg8B,EAAAh8B,MACAmrB,EAAAj9K,OAAA8tL,EAAA9tL,OA6BAi9K,EAAA+Q,OA1BA,SAAA5/K,EAAA+yG,EAAA2V,GACA,IAAAm3D,EAAA,IAAA1zL,MAAAj4B,KAAAD,IAAA+rC,EAAAu/J,YAAA72C,GAAA,GACAm3D,EAAAC,KAAA,GAKA,IAHA,IAAA9zC,EAAA,GAAAj5B,EAAA,EACApwN,EAAAq9G,EAAA2jB,QAEAluD,EAAA,EAAAA,EAAAoqN,EAAAtsN,OAAAkC,IAAA,CACA,IAAAo+I,EACAjjE,EAAAjuJ,EAAAo9R,MAAA/zC,EAAA,GACArpP,EAAAk6R,SAEAhpE,EADAjjE,GAAAo7F,GAAA,GAAA,GACAA,GAAA,GAAAp7F,EAEAA,EACAjuJ,EAAAq9R,MAAAnsE,IAEAA,EAAA,EAGAgsE,EAAApqN,GAAAo+I,EACAlxN,EAAAs9R,OAAA,GAGA,OAAAJ,GA2DAhR,EAAAqR,OAtDA,SAAA5U,EAAA6U,GACA,IAAAC,EAAA,CACA,GACA,IAGA9U,EAAAA,EAAA3nJ,QACAw8J,EAAAA,EAAAx8J,QAIA,IAHA,IAEA08J,EAFA/W,EAAA,EACAC,EAAA,EAEA+B,EAAAgV,MAAAhX,GAAA,GAAA6W,EAAAG,MAAA/W,GAAA,GAAA,CAEA,IAMAgX,EAYAC,EAlBAC,EAAAnV,EAAAyU,MAAA,GAAAzW,EAAA,EACAoX,EAAAP,EAAAJ,MAAA,GAAAxW,EAAA,EACA,IAAAkX,IACAA,GAAA,GACA,IAAAC,IACAA,GAAA,GAGAH,EADA,IAAA,EAAAE,GACA,EAGA,KADAJ,EAAA/U,EAAAyU,MAAA,GAAAzW,EAAA,IACA,IAAA+W,GAAA,IAAAK,EAGAD,GAFAA,EAIAL,EAAA,GAAAhnN,KAAAmnN,GAIAC,EADA,IAAA,EAAAE,GACA,EAGA,KADAL,EAAAF,EAAAJ,MAAA,GAAAxW,EAAA,IACA,IAAA8W,GAAA,IAAAI,EAGAC,GAFAA,EAIAN,EAAA,GAAAhnN,KAAAonN,GAGA,EAAAlX,IAAAiX,EAAA,IACAjX,EAAA,EAAAA,GACA,EAAAC,IAAAiX,EAAA,IACAjX,EAAA,EAAAA,GACA+B,EAAA2U,OAAA,GACAE,EAAAF,OAAA,GAGA,OAAAG,GAWAvR,EAAA8R,eAPA,SAAAxzL,EAAAhsG,EAAAy/R,GACA,IAAAt9R,EAAA,IAAAnC,EACAgsG,EAAAlB,UAAA9qG,GAAA,WACA,YAAA6C,IAAAsqG,KAAAhrG,GAAAgrG,KAAAhrG,GACAgrG,KAAAhrG,GAAAs9R,EAAA10L,KAAAoC,QASAugL,EAAAgS,WAJA,SAAA55D,GACA,MAAA,iBAAAA,EAAA4nD,EAAAp9K,QAAAw1H,EAAA,OACAA,GAOA4nD,EAAAiS,UAHA,SAAA75D,GACA,OAAA,IAAAo1D,EAAAp1D,EAAA,MAAA,uHCnHA,SAAAtlO,EAAAC,GACA,aAGA,SAAAulG,EAAAc,EAAAlqB,GACA,IAAAkqB,EAAA,MAAA,IAAAb,MAAArpB,GAAA,oBAKA,SAAAgjN,EAAAxmG,EAAAymG,GACAzmG,EAAA0mG,OAAAD,EACA,IAAAE,EAAA,aACAA,EAAAj1L,UAAA+0L,EAAA/0L,UACAsuF,EAAAtuF,UAAA,IAAAi1L,EACA3mG,EAAAtuF,UAAAgP,YAAAs/E,EAKA,SAAA8hG,EAAAjpL,EAAAs7B,EAAAyyJ,GACA,GAAA9E,EAAA+E,KAAAhuL,GACA,OAAAA,EAGA9E,KAAA+yL,SAAA,EACA/yL,KAAAgzL,MAAA,KACAhzL,KAAA/6B,OAAA,EAGA+6B,KAAAkuL,IAAA,KAEA,OAAAppL,IACA,OAAAs7B,GAAA,OAAAA,IACAyyJ,EAAAzyJ,EACAA,EAAA,IAGApgC,KAAA+hK,MAAAj9J,GAAA,EAAAs7B,GAAA,GAAAyyJ,GAAA,OAYA,IAAA5vC,EATA,iBAAA5vP,EACAA,EAAAC,QAAAy6R,EAEAz6R,EAAAy6R,GAAAA,EAGAA,EAAAA,GAAAA,EACAA,EAAAkF,SAAA,GAGA,IAEAhwC,EADA,oBAAA1jJ,aAAA,IAAAA,OAAA0jJ,OACA1jJ,OAAA0jJ,OAEA1vP,EAAA,UAAA0vP,OAEA,MAAAlvP,IAgIA,SAAAm/R,EAAAv3L,EAAAp2B,GACA,IAAAkH,EAAAkvB,EAAA1jB,WAAA1S,GAEA,OAAAkH,GAAA,IAAAA,GAAA,GACAA,EAAA,GAEAA,GAAA,IAAAA,GAAA,IACAA,EAAA,GAGAA,EAAA,GAAA,GAIA,SAAA0mN,EAAAx3L,EAAAy3L,EAAA7tN,GACA,IAAAyoC,EAAAklL,EAAAv3L,EAAAp2B,GAIA,OAHAA,EAAA,GAAA6tN,IACAplL,GAAAklL,EAAAv3L,EAAAp2B,EAAA,IAAA,GAEAyoC,EA8CA,SAAAqlL,EAAA79L,EAAAxgB,EAAAhQ,EAAA4qN,GAGA,IAFA,IAAA5hL,EAAA,EACA5K,EAAAx9B,KAAAq0B,IAAAzE,EAAAvwB,OAAAD,GACAmC,EAAA6N,EAAA7N,EAAAi8B,EAAAj8B,IAAA,CACA,IAAAsF,EAAA+oB,EAAAvd,WAAA9Q,GAAA,GAEA6mC,GAAA4hL,EAIA5hL,GADAvhC,GAAA,GACAA,EAAA,GAAA,GAGAA,GAAA,GACAA,EAAA,GAAA,GAIAA,EAGA,OAAAuhC,EAnNA+/K,EAAA+E,KAAA,SAAAphL,GACA,OAAAA,aAAAq8K,GAIA,OAAAr8K,GAAA,iBAAAA,GACAA,EAAA/E,YAAAsmL,WAAAlF,EAAAkF,UAAAp1L,MAAA/gB,QAAA40B,EAAAshL,QAGAjF,EAAApoN,IAAA,SAAAujB,EAAAC,GACA,OAAAD,EAAAie,IAAAhe,GAAA,EAAAD,EACAC,GAGA4kM,EAAA9zL,IAAA,SAAA/Q,EAAAC,GACA,OAAAD,EAAAie,IAAAhe,GAAA,EAAAD,EACAC,GAGA4kM,EAAApwL,UAAAokK,MAAA,SAAAj9J,EAAAs7B,EAAAyyJ,GACA,GAAA,iBAAA/tL,EACA,OAAA9E,KAAAszL,YAAAxuL,EAAAs7B,EAAAyyJ,GAGA,GAAA,iBAAA/tL,EACA,OAAA9E,KAAAuzL,WAAAzuL,EAAAs7B,EAAAyyJ,GAGA,QAAAzyJ,IACAA,EAAA,IAEAvnC,EAAAunC,KAAA,EAAAA,IAAAA,GAAA,GAAAA,GAAA,IAGA,IAAAprD,EAAA,EACA,OAFA8vB,EAAAA,EAAA1G,WAAAllB,QAAA,OAAA,KAEA,KACAlE,IACAgrB,KAAA+yL,SAAA,GAGA/9M,EAAA8vB,EAAA7/B,SACA,KAAAm7D,EACApgC,KAAAwzL,UAAA1uL,EAAA9vB,EAAA69M,IAEA7yL,KAAAyzL,WAAA3uL,EAAAs7B,EAAAprD,GACA,OAAA69M,GACA7yL,KAAAuzL,WAAAvzL,KAAAmD,UAAAi9B,EAAAyyJ,MAMA9E,EAAApwL,UAAA21L,YAAA,SAAAxuL,EAAAs7B,EAAAyyJ,GACA/tL,EAAA,IACA9E,KAAA+yL,SAAA,EACAjuL,GAAAA,GAEAA,EAAA,UACA9E,KAAAgzL,MAAA,CAAA,SAAAluL,GACA9E,KAAA/6B,OAAA,GACA6/B,EAAA,kBACA9E,KAAAgzL,MAAA,CACA,SAAAluL,EACAA,EAAA,SAAA,UAEA9E,KAAA/6B,OAAA,IAEA4zB,EAAAiM,EAAA,kBACA9E,KAAAgzL,MAAA,CACA,SAAAluL,EACAA,EAAA,SAAA,SACA,GAEA9E,KAAA/6B,OAAA,GAGA,OAAA4tN,GAGA7yL,KAAAuzL,WAAAvzL,KAAAmD,UAAAi9B,EAAAyyJ,IAGA9E,EAAApwL,UAAA41L,WAAA,SAAAzuL,EAAAs7B,EAAAyyJ,GAGA,GADAh6L,EAAA,iBAAAiM,EAAA7/B,QACA6/B,EAAA7/B,QAAA,EAGA,OAFA+6B,KAAAgzL,MAAA,CAAA,GACAhzL,KAAA/6B,OAAA,EACA+6B,KAGAA,KAAA/6B,OAAAW,KAAAwhL,KAAAtiJ,EAAA7/B,OAAA,GACA+6B,KAAAgzL,MAAA,IAAAn1L,MAAAmC,KAAA/6B,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA,EAGA,IAAAmqB,EAAAmzH,EACA8Q,EAAA,EACA,GAAA,OAAAs9D,EACA,IAAA1rN,EAAA29B,EAAA7/B,OAAA,EAAAqsB,EAAA,EAAAnqB,GAAA,EAAAA,GAAA,EACAs9I,EAAA3/G,EAAA39B,GAAA29B,EAAA39B,EAAA,IAAA,EAAA29B,EAAA39B,EAAA,IAAA,GACA64B,KAAAgzL,MAAA1hM,IAAAmzH,GAAA8Q,EAAA,SACAv1H,KAAAgzL,MAAA1hM,EAAA,GAAAmzH,IAAA,GAAA8Q,EAAA,UACAA,GAAA,KACA,KACAA,GAAA,GACAjkI,UAGA,GAAA,OAAAuhM,EACA,IAAA1rN,EAAA,EAAAmqB,EAAA,EAAAnqB,EAAA29B,EAAA7/B,OAAAkC,GAAA,EACAs9I,EAAA3/G,EAAA39B,GAAA29B,EAAA39B,EAAA,IAAA,EAAA29B,EAAA39B,EAAA,IAAA,GACA64B,KAAAgzL,MAAA1hM,IAAAmzH,GAAA8Q,EAAA,SACAv1H,KAAAgzL,MAAA1hM,EAAA,GAAAmzH,IAAA,GAAA8Q,EAAA,UACAA,GAAA,KACA,KACAA,GAAA,GACAjkI,KAIA,OAAA0O,KAAA0zL,SAyBA3F,EAAApwL,UAAA61L,UAAA,SAAA1uL,EAAA9vB,EAAA69M,GAEA7yL,KAAA/6B,OAAAW,KAAAwhL,MAAAtiJ,EAAA7/B,OAAA+P,GAAA,GACAgrB,KAAAgzL,MAAA,IAAAn1L,MAAAmC,KAAA/6B,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA,EAIA,IAGAs9I,EAHA8Q,EAAA,EACAjkI,EAAA,EAGA,GAAA,OAAAuhM,EACA,IAAA1rN,EAAA29B,EAAA7/B,OAAA,EAAAkC,GAAA6N,EAAA7N,GAAA,EACAs9I,EAAA0uE,EAAAruL,EAAA9vB,EAAA7N,IAAAouJ,EACAv1H,KAAAgzL,MAAA1hM,IAAA,SAAAmzH,EACA8Q,GAAA,IACAA,GAAA,GACAjkI,GAAA,EACA0O,KAAAgzL,MAAA1hM,IAAAmzH,IAAA,IAEA8Q,GAAA,OAKA,IAAApuJ,GADA29B,EAAA7/B,OAAA+P,GACA,GAAA,EAAAA,EAAA,EAAAA,EAAA7N,EAAA29B,EAAA7/B,OAAAkC,GAAA,EACAs9I,EAAA0uE,EAAAruL,EAAA9vB,EAAA7N,IAAAouJ,EACAv1H,KAAAgzL,MAAA1hM,IAAA,SAAAmzH,EACA8Q,GAAA,IACAA,GAAA,GACAjkI,GAAA,EACA0O,KAAAgzL,MAAA1hM,IAAAmzH,IAAA,IAEA8Q,GAAA,EAKAv1H,KAAA0zL,SA2BA3F,EAAApwL,UAAA81L,WAAA,SAAA3uL,EAAAs7B,EAAAprD,GAEAgrB,KAAAgzL,MAAA,CAAA,GACAhzL,KAAA/6B,OAAA,EAGA,IAAA,IAAA0uN,EAAA,EAAAC,EAAA,EAAAA,GAAA,SAAAA,GAAAxzJ,EACAuzJ,IAEAA,IACAC,EAAAA,EAAAxzJ,EAAA,EAOA,IALA,IAAAgvB,EAAAtqD,EAAA7/B,OAAA+P,EACAstE,EAAA8M,EAAAukI,EACA3uN,EAAAY,KAAAq0B,IAAAm1D,EAAAA,EAAA9M,GAAAttE,EAEAwtC,EAAA,EACAr7C,EAAA6N,EAAA7N,EAAAnC,EAAAmC,GAAAwsN,EACAnxK,EAAA6wK,EAAAvuL,EAAA39B,EAAAA,EAAAwsN,EAAAvzJ,GAEApgC,KAAA6zL,MAAAD,GACA5zL,KAAAgzL,MAAA,GAAAxwK,EAAA,SACAxiB,KAAAgzL,MAAA,IAAAxwK,EAEAxiB,KAAA8zL,OAAAtxK,GAIA,GAAA,IAAA8/B,EAAA,CACA,IAAA+8E,EAAA,EAGA,IAFA78G,EAAA6wK,EAAAvuL,EAAA39B,EAAA29B,EAAA7/B,OAAAm7D,GAEAj5D,EAAA,EAAAA,EAAAm7E,EAAAn7E,IACAk4J,GAAAj/F,EAGApgC,KAAA6zL,MAAAx0D,GACAr/H,KAAAgzL,MAAA,GAAAxwK,EAAA,SACAxiB,KAAAgzL,MAAA,IAAAxwK,EAEAxiB,KAAA8zL,OAAAtxK,GAIAxiB,KAAA0zL,SAGA3F,EAAApwL,UAAA1gG,KAAA,SAAA0lN,GACAA,EAAAqwE,MAAA,IAAAn1L,MAAAmC,KAAA/6B,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACAw7I,EAAAqwE,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAEAw7I,EAAA19I,OAAA+6B,KAAA/6B,OACA09I,EAAAowE,SAAA/yL,KAAA+yL,SACApwE,EAAAurE,IAAAluL,KAAAkuL,KAGAH,EAAApwL,UAAA03B,MAAA,WACA,IAAArnB,EAAA,IAAA+/K,EAAA,MAEA,OADA/tL,KAAA/iG,KAAA+wG,GACAA,GAGA+/K,EAAApwL,UAAAo2L,QAAA,SAAA92L,GACA,KAAA+C,KAAA/6B,OAAAg4B,GACA+C,KAAAgzL,MAAAhzL,KAAA/6B,UAAA,EAEA,OAAA+6B,MAIA+tL,EAAApwL,UAAA+1L,MAAA,WACA,KAAA1zL,KAAA/6B,OAAA,GAAA,IAAA+6B,KAAAgzL,MAAAhzL,KAAA/6B,OAAA,IACA+6B,KAAA/6B,SAEA,OAAA+6B,KAAAg0L,aAGAjG,EAAApwL,UAAAq2L,UAAA,WAKA,OAHA,IAAAh0L,KAAA/6B,QAAA,IAAA+6B,KAAAgzL,MAAA,KACAhzL,KAAA+yL,SAAA,GAEA/yL,MAGA+tL,EAAApwL,UAAAs2L,QAAA,WACA,OAAAj0L,KAAAkuL,IAAA,UAAA,SAAAluL,KAAA5B,SAAA,IAAA,KAiCA,IAAAu8J,EAAA,CACA,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGAu5B,EAAA,CACA,EAAA,EACA,GAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAGAC,EAAA,CACA,EAAA,EACA,SAAA,SAAA,SAAA,SAAA,SAAA,SAAA,SACA,SAAA,IAAA,SAAA,SAAA,SAAA,QAAA,SACA,SAAA,SAAA,SAAA,SAAA,KAAA,QAAA,QACA,QAAA,QAAA,QAAA,SAAA,SAAA,SAAA,SACA,MAAA,SAAA,SAAA,SAAA,SAAA,SAAA,UAsjBA,SAAAC,EAAA90L,EAAAoS,EAAAqvB,GACAA,EAAAgyJ,SAAArhL,EAAAqhL,SAAAzzL,EAAAyzL,SACA,IAAA3vL,EAAA9D,EAAAr6B,OAAAysC,EAAAzsC,OAAA,EACA87D,EAAA97D,OAAAm+B,EACAA,EAAAA,EAAA,EAAA,EAGA,IAAAv8B,EAAA,EAAAy4B,EAAA0zL,MAAA,GACA15M,EAAA,EAAAo4B,EAAAshL,MAAA,GACAhlL,EAAAnnC,EAAAyS,EAEAgqK,EAAA,SAAAt1I,EACA6vH,EAAA7vH,EAAA,SAAA,EACA+yB,EAAAiyJ,MAAA,GAAA1vC,EAEA,IAAA,IAAAjvP,EAAA,EAAAA,EAAA+uG,EAAA/uG,IAAA,CAMA,IAHA,IAAAggS,EAAAx2D,IAAA,GACAy2D,EAAA,SAAAz2D,EACA02D,EAAA3uN,KAAAq0B,IAAA5lG,EAAAq9G,EAAAzsC,OAAA,GACAqsB,EAAA1rB,KAAAD,IAAA,EAAAtxE,EAAAirG,EAAAr6B,OAAA,GAAAqsB,GAAAijM,EAAAjjM,IAAA,CACA,IAAAnqB,EAAA9yE,EAAAi9F,EAAA,EAIA+iM,IADArmL,GAFAnnC,EAAA,EAAAy4B,EAAA0zL,MAAA7rN,KACAmS,EAAA,EAAAo4B,EAAAshL,MAAA1hM,IACAgjM,GACA,SAAA,EACAA,EAAA,SAAAtmL,EAEA+yB,EAAAiyJ,MAAA3+R,GAAA,EAAAigS,EACAz2D,EAAA,EAAAw2D,EAQA,OANA,IAAAx2D,EACA98F,EAAAiyJ,MAAA3+R,GAAA,EAAAwpO,EAEA98F,EAAA97D,SAGA87D,EAAA2yJ,QAzlBA3F,EAAApwL,UAAAS,SAAA,SAAAgiC,EAAAglI,GAIA,IAAArkI,EACA,GAHAqkI,EAAA,EAAAA,GAAA,EAGA,MAJAhlI,EAAAA,GAAA,KAIA,QAAAA,EAAA,CACAW,EAAA,GAGA,IAFA,IAAAw0F,EAAA,EACAsI,EAAA,EACA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs9I,EAAAzkH,KAAAgzL,MAAA7rN,GACAq7C,GAAA,UAAAiiG,GAAA8Q,EAAAsI,IAAAz/H,SAAA,IAGA2iC,EADA,KADA88F,EAAApZ,IAAA,GAAA8Q,EAAA,WACApuJ,IAAA64B,KAAA/6B,OAAA,EACA01L,EAAA,EAAAn4I,EAAAv9C,QAAAu9C,EAAAue,EAEAve,EAAAue,GAEAw0F,GAAA,IACA,KACAA,GAAA,GACApuJ,KAMA,IAHA,IAAA02J,IACA98F,EAAA88F,EAAAz/H,SAAA,IAAA2iC,GAEAA,EAAA97D,OAAAmgM,GAAA,GACArkI,EAAA,IAAAA,EAKA,OAHA,IAAA/gC,KAAA+yL,WACAhyJ,EAAA,IAAAA,GAEAA,EAGA,GAAAX,KAAA,EAAAA,IAAAA,GAAA,GAAAA,GAAA,GAAA,CAEA,IAAAo0J,EAAAN,EAAA9zJ,GAEAq0J,EAAAN,EAAA/zJ,GACAW,EAAA,GACA,IAAAt0D,EAAAuzB,KAAAq1B,QAEA,IADA5oD,EAAAsmN,SAAA,GACAtmN,EAAAoiN,UAAA,CACA,IAAA7gL,EAAAvhC,EAAAioN,KAAAD,GAAAr2L,SAAAgiC,GAMAW,GALAt0D,EAAAA,EAAAkoN,MAAAF,IAEA5F,SAGA7gL,EAAA+yB,EAFA45H,EAAA65B,EAAAxmL,EAAA/oC,QAAA+oC,EAAA+yB,EAQA,IAHA/gC,KAAA6uL,WACA9tJ,EAAA,IAAAA,GAEAA,EAAA97D,OAAAmgM,GAAA,GACArkI,EAAA,IAAAA,EAKA,OAHA,IAAA/gC,KAAA+yL,WACAhyJ,EAAA,IAAAA,GAEAA,EAGAloC,GAAA,EAAA,oCAGAk1L,EAAApwL,UAAAqB,SAAA,WACA,IAAA7S,EAAA6T,KAAAgzL,MAAA,GASA,OARA,IAAAhzL,KAAA/6B,OACAknB,GAAA,SAAA6T,KAAAgzL,MAAA,GACA,IAAAhzL,KAAA/6B,QAAA,IAAA+6B,KAAAgzL,MAAA,GAEA7mM,GAAA,iBAAA,SAAA6T,KAAAgzL,MAAA,GACAhzL,KAAA/6B,OAAA,GACA4zB,GAAA,EAAA,8CAEA,IAAAmH,KAAA+yL,UAAA5mM,EAAAA,GAGA4hM,EAAApwL,UAAAvW,OAAA,WACA,OAAA4Y,KAAA5B,SAAA,KAGA2vL,EAAApwL,UAAAi3L,SAAA,SAAA/B,EAAA5tN,GAEA,OADA4zB,OAAA,IAAAoqJ,GACAjjJ,KAAAmvL,YAAAlsC,EAAA4vC,EAAA5tN,IAGA8oN,EAAApwL,UAAAwF,QAAA,SAAA0vL,EAAA5tN,GACA,OAAA+6B,KAAAmvL,YAAAtxL,MAAAg1L,EAAA5tN,IAGA8oN,EAAApwL,UAAAwxL,YAAA,SAAA0F,EAAAhC,EAAA5tN,GACA,IAAAm5J,EAAAp+H,KAAAo+H,aACA02D,EAAA7vN,GAAAW,KAAAD,IAAA,EAAAy4J,GACAvlI,EAAAulI,GAAA02D,EAAA,yCACAj8L,EAAAi8L,EAAA,EAAA,+BAEA90L,KAAA0zL,QACA,IAGAp6M,EAAAnS,EAHA4tN,EAAA,OAAAlC,EACA9mN,EAAA,IAAA8oN,EAAAC,GAGAxmL,EAAAtO,KAAAq1B,QACA,GAAA0/J,EAYA,CACA,IAAA5tN,EAAA,GAAAmnC,EAAAugL,SAAA1nN,IACAmS,EAAAg1B,EAAAmjL,MAAA,KACAnjL,EAAAqjL,OAAA,GAEA5lN,EAAA5E,GAAAmS,EAGA,KAAAnS,EAAA2tN,EAAA3tN,IACA4E,EAAA5E,GAAA,MArBA,CAEA,IAAAA,EAAA,EAAAA,EAAA2tN,EAAA12D,EAAAj3J,IACA4E,EAAA5E,GAAA,EAGA,IAAAA,EAAA,GAAAmnC,EAAAugL,SAAA1nN,IACAmS,EAAAg1B,EAAAmjL,MAAA,KACAnjL,EAAAqjL,OAAA,GAEA5lN,EAAA+oN,EAAA3tN,EAAA,GAAAmS,EAeA,OAAAvN,GAGAnG,KAAAovN,MACAjH,EAAApwL,UAAAs3L,WAAA,SAAAxwE,GACA,OAAA,GAAA7+I,KAAAovN,MAAAvwE,IAGAspE,EAAApwL,UAAAs3L,WAAA,SAAAxwE,GACA,IAAA1lE,EAAA0lE,EACAz2G,EAAA,EAiBA,OAhBA+wC,GAAA,OACA/wC,GAAA,GACA+wC,KAAA,IAEAA,GAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEAA,GAAA,IACA/wC,GAAA,EACA+wC,KAAA,GAEAA,GAAA,IACA/wC,GAAA,EACA+wC,KAAA,GAEA/wC,EAAA+wC,GAIAgvI,EAAApwL,UAAAu3L,UAAA,SAAAzwE,GAEA,GAAA,IAAAA,EAAA,OAAA,GAEA,IAAA1lE,EAAA0lE,EACAz2G,EAAA,EAoBA,OAnBA,IAAA,KAAA+wC,KACA/wC,GAAA,GACA+wC,KAAA,IAEA,IAAA,IAAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEA,IAAA,GAAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEA,IAAA,EAAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEA,IAAA,EAAAA,IACA/wC,IAEAA,GAIA+/K,EAAApwL,UAAAszK,UAAA,WACA,IAAAxsD,EAAAzkH,KAAAgzL,MAAAhzL,KAAA/6B,OAAA,GACAo+K,EAAArjJ,KAAAi1L,WAAAxwE,GACA,OAAA,IAAAzkH,KAAA/6B,OAAA,GAAAo+K,GAiBA0qC,EAAApwL,UAAAw3L,SAAA,WACA,GAAAn1L,KAAA6uL,SAAA,OAAA,EAGA,IADA,IAAA7gL,EAAA,EACA7mC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAmS,EAAA0mB,KAAAk1L,UAAAl1L,KAAAgzL,MAAA7rN,IAEA,GADA6mC,GAAA10B,EACA,KAAAA,EAAA,MAEA,OAAA00B,GAGA+/K,EAAApwL,UAAAygI,WAAA,WACA,OAAAx4J,KAAAwhL,KAAApnJ,KAAAixK,YAAA,IAGA8c,EAAApwL,UAAAy3L,OAAA,SAAAlnI,GACA,OAAA,IAAAluD,KAAA+yL,SACA/yL,KAAAm6J,MAAAk7B,MAAAnnI,GAAAonI,MAAA,GAEAt1L,KAAAq1B,SAGA04J,EAAApwL,UAAA43L,SAAA,SAAArnI,GACA,OAAAluD,KAAAw1L,MAAAtnI,EAAA,GACAluD,KAAAy1L,KAAAvnI,GAAAonI,MAAA,GAAAI,OAEA11L,KAAAq1B,SAGA04J,EAAApwL,UAAAg4L,MAAA,WACA,OAAA,IAAA31L,KAAA+yL,UAIAhF,EAAApwL,UAAAi4L,IAAA,WACA,OAAA51L,KAAAq1B,QAAAqgK,QAGA3H,EAAApwL,UAAA+3L,KAAA,WAKA,OAJA11L,KAAA6uL,WACA7uL,KAAA+yL,UAAA,GAGA/yL,MAIA+tL,EAAApwL,UAAAk4L,KAAA,SAAAnkL,GACA,KAAA1R,KAAA/6B,OAAAysC,EAAAzsC,QACA+6B,KAAAgzL,MAAAhzL,KAAA/6B,UAAA,EAGA,IAAA,IAAAkC,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAAAuqC,EAAAshL,MAAA7rN,GAGA,OAAA64B,KAAA0zL,SAGA3F,EAAApwL,UAAAm4L,IAAA,SAAApkL,GAEA,OADA7Y,EAAA,IAAAmH,KAAA+yL,SAAArhL,EAAAqhL,WACA/yL,KAAA61L,KAAAnkL,IAIAq8K,EAAApwL,UAAA+yB,GAAA,SAAAhf,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAAygK,IAAApkL,GACAA,EAAA2jB,QAAAygK,IAAA91L,OAGA+tL,EAAApwL,UAAAo4L,IAAA,SAAArkL,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAAwgK,KAAAnkL,GACAA,EAAA2jB,QAAAwgK,KAAA71L,OAIA+tL,EAAApwL,UAAAq4L,MAAA,SAAAtkL,GAEA,IAAAp4B,EAEAA,EADA0mB,KAAA/6B,OAAAysC,EAAAzsC,OACAysC,EAEA1R,KAGA,IAAA,IAAA74B,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAAAuqC,EAAAshL,MAAA7rN,GAKA,OAFA64B,KAAA/6B,OAAAqU,EAAArU,OAEA+6B,KAAA0zL,SAGA3F,EAAApwL,UAAAs4L,KAAA,SAAAvkL,GAEA,OADA7Y,EAAA,IAAAmH,KAAA+yL,SAAArhL,EAAAqhL,WACA/yL,KAAAg2L,MAAAtkL,IAIAq8K,EAAApwL,UAAA8yB,IAAA,SAAA/e,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA4gK,KAAAvkL,GACAA,EAAA2jB,QAAA4gK,KAAAj2L,OAGA+tL,EAAApwL,UAAAu4L,KAAA,SAAAxkL,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA2gK,MAAAtkL,GACAA,EAAA2jB,QAAA2gK,MAAAh2L,OAIA+tL,EAAApwL,UAAAw4L,MAAA,SAAAzkL,GAEA,IAAA7qC,EACAyS,EACA0mB,KAAA/6B,OAAAysC,EAAAzsC,QACA4B,EAAAm5B,KACA1mB,EAAAo4B,IAEA7qC,EAAA6qC,EACAp4B,EAAA0mB,MAGA,IAAA,IAAA74B,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAAAmS,EAAA05M,MAAA7rN,GAGA,GAAA64B,OAAAn5B,EACA,KAAAM,EAAAN,EAAA5B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAMA,OAFA64B,KAAA/6B,OAAA4B,EAAA5B,OAEA+6B,KAAA0zL,SAGA3F,EAAApwL,UAAAy4L,KAAA,SAAA1kL,GAEA,OADA7Y,EAAA,IAAAmH,KAAA+yL,SAAArhL,EAAAqhL,WACA/yL,KAAAm2L,MAAAzkL,IAIAq8K,EAAApwL,UAAAosK,IAAA,SAAAr4J,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA+gK,KAAA1kL,GACAA,EAAA2jB,QAAA+gK,KAAAp2L,OAGA+tL,EAAApwL,UAAA04L,KAAA,SAAA3kL,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA8gK,MAAAzkL,GACAA,EAAA2jB,QAAA8gK,MAAAn2L,OAIA+tL,EAAApwL,UAAA03L,MAAA,SAAAnnI,GACAr1D,EAAA,iBAAAq1D,GAAAA,GAAA,GAEA,IAAAooI,EAAA,EAAA1wN,KAAAwhL,KAAAl5F,EAAA,IACAqoI,EAAAroI,EAAA,GAGAluD,KAAA+zL,QAAAuC,GAEAC,EAAA,GACAD,IAIA,IAAA,IAAAnvN,EAAA,EAAAA,EAAAmvN,EAAAnvN,IACA64B,KAAAgzL,MAAA7rN,GAAA,UAAA64B,KAAAgzL,MAAA7rN,GASA,OALAovN,EAAA,IACAv2L,KAAAgzL,MAAA7rN,IAAA64B,KAAAgzL,MAAA7rN,GAAA,UAAA,GAAAovN,GAIAv2L,KAAA0zL,SAGA3F,EAAApwL,UAAA83L,KAAA,SAAAvnI,GACA,OAAAluD,KAAAq1B,QAAAggK,MAAAnnI,IAIA6/H,EAAApwL,UAAA64L,KAAA,SAAAC,EAAA98L,GACAd,EAAA,iBAAA49L,GAAAA,GAAA,GAEA,IAAAlhE,EAAAkhE,EAAA,GAAA,EACAC,EAAAD,EAAA,GAUA,OARAz2L,KAAA+zL,QAAAx+D,EAAA,GAGAv1H,KAAAgzL,MAAAz9D,GADA57H,EACAqG,KAAAgzL,MAAAz9D,GAAA,GAAAmhE,EAEA12L,KAAAgzL,MAAAz9D,KAAA,GAAAmhE,GAGA12L,KAAA0zL,SAIA3F,EAAApwL,UAAAyxL,KAAA,SAAA19K,GACA,IAAA1D,EAkBAnnC,EAAAyS,EAfA,GAAA,IAAA0mB,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAIA,OAHA/yL,KAAA+yL,SAAA,EACA/kL,EAAAhO,KAAAqvL,KAAA39K,GACA1R,KAAA+yL,UAAA,EACA/yL,KAAAg0L,YAGA,GAAA,IAAAh0L,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAIA,OAHArhL,EAAAqhL,SAAA,EACA/kL,EAAAhO,KAAAqvL,KAAA39K,GACAA,EAAAqhL,SAAA,EACA/kL,EAAAgmL,YAKAh0L,KAAA/6B,OAAAysC,EAAAzsC,QACA4B,EAAAm5B,KACA1mB,EAAAo4B,IAEA7qC,EAAA6qC,EACAp4B,EAAA0mB,MAIA,IADA,IAAA69H,EAAA,EACA12J,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IACA6mC,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,KAAA,EAAAmS,EAAA05M,MAAA7rN,IAAA02J,EACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EACA6vH,EAAA7vH,IAAA,GAEA,KAAA,IAAA6vH,GAAA12J,EAAAN,EAAA5B,OAAAkC,IACA6mC,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,IAAA02J,EACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EACA6vH,EAAA7vH,IAAA,GAIA,GADAhO,KAAA/6B,OAAA4B,EAAA5B,OACA,IAAA44J,EACA79H,KAAAgzL,MAAAhzL,KAAA/6B,QAAA44J,EACA79H,KAAA/6B,cAEA,GAAA4B,IAAAm5B,KACA,KAAA74B,EAAAN,EAAA5B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAIA,OAAA64B,MAIA+tL,EAAApwL,UAAA3e,IAAA,SAAA0yB,GACA,IAAA3lC,EACA,OAAA,IAAA2lC,EAAAqhL,UAAA,IAAA/yL,KAAA+yL,UACArhL,EAAAqhL,SAAA,EACAhnN,EAAAi0B,KAAAsxB,IAAA5f,GACAA,EAAAqhL,UAAA,EACAhnN,GACA,IAAA2lC,EAAAqhL,UAAA,IAAA/yL,KAAA+yL,UACA/yL,KAAA+yL,SAAA,EACAhnN,EAAA2lC,EAAA4f,IAAAtxB,MACAA,KAAA+yL,SAAA,EACAhnN,GAGAi0B,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA+5J,KAAA19K,GAEAA,EAAA2jB,QAAA+5J,KAAApvL,OAIA+tL,EAAApwL,UAAA0xL,KAAA,SAAA39K,GAEA,GAAA,IAAAA,EAAAqhL,SAAA,CACArhL,EAAAqhL,SAAA,EACA,IAAA/kL,EAAAhO,KAAAovL,KAAA19K,GAEA,OADAA,EAAAqhL,SAAA,EACA/kL,EAAAgmL,YAGA,GAAA,IAAAh0L,KAAA+yL,SAIA,OAHA/yL,KAAA+yL,SAAA,EACA/yL,KAAAovL,KAAA19K,GACA1R,KAAA+yL,SAAA,EACA/yL,KAAAg0L,YAIA,IAWAntN,EAAAyS,EAXA6tB,EAAAnH,KAAAmH,IAAAuK,GAGA,GAAA,IAAAvK,EAIA,OAHAnH,KAAA+yL,SAAA,EACA/yL,KAAA/6B,OAAA,EACA+6B,KAAAgzL,MAAA,GAAA,EACAhzL,KAKAmH,EAAA,GACAtgC,EAAAm5B,KACA1mB,EAAAo4B,IAEA7qC,EAAA6qC,EACAp4B,EAAA0mB,MAIA,IADA,IAAA69H,EAAA,EACA12J,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IAEA02J,GADA7vH,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,KAAA,EAAAmS,EAAA05M,MAAA7rN,IAAA02J,IACA,GACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EAEA,KAAA,IAAA6vH,GAAA12J,EAAAN,EAAA5B,OAAAkC,IAEA02J,GADA7vH,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,IAAA02J,IACA,GACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EAIA,GAAA,IAAA6vH,GAAA12J,EAAAN,EAAA5B,QAAA4B,IAAAm5B,KACA,KAAA74B,EAAAN,EAAA5B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAUA,OANA64B,KAAA/6B,OAAAW,KAAAD,IAAAq6B,KAAA/6B,OAAAkC,GAEAN,IAAAm5B,OACAA,KAAA+yL,SAAA,GAGA/yL,KAAA0zL,SAIA3F,EAAApwL,UAAA2zB,IAAA,SAAA5f,GACA,OAAA1R,KAAAq1B,QAAAg6J,KAAA39K,IA+CA,IAAAilL,EAAA,SAAAr3L,EAAAoS,EAAAqvB,GACA,IAIAuiH,EACA91I,EACA61I,EANAx8K,EAAAy4B,EAAA0zL,MACA15M,EAAAo4B,EAAAshL,MACA9iH,EAAAnvC,EAAAiyJ,MACAvmN,EAAA,EAIAmqN,EAAA,EAAA/vN,EAAA,GACAgwN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAlwN,EAAA,GACAmwN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAjzB,EAAA,EAAAj9L,EAAA,GACAqwN,EAAA,KAAApzB,EACAqzB,EAAArzB,IAAA,GACAszB,EAAA,EAAAvwN,EAAA,GACAwwN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAA1wN,EAAA,GACA2wN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAA7wN,EAAA,GACA8wN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAhxN,EAAA,GACAixN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAnxN,EAAA,GACAoxN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAtxN,EAAA,GACAuxN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAzxN,EAAA,GACA0xN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAzP,EAAA,EAAAvvM,EAAA,GACAm/M,EAAA,KAAA5P,EACA6P,EAAA7P,IAAA,GACAp6B,EAAA,EAAAn1K,EAAA,GACAq/M,EAAA,KAAAlqC,EACAmqC,EAAAnqC,IAAA,GACAJ,EAAA,EAAA/0K,EAAA,GACAu/M,EAAA,KAAAxqC,EACAyqC,EAAAzqC,IAAA,GACAy6B,EAAA,EAAAxvM,EAAA,GACAy/M,EAAA,KAAAjQ,EACAkQ,EAAAlQ,IAAA,GACAC,EAAA,EAAAzvM,EAAA,GACA2/M,EAAA,KAAAlQ,EACAmQ,GAAAnQ,IAAA,GACAC,GAAA,EAAA1vM,EAAA,GACA6/M,GAAA,KAAAnQ,GACAoQ,GAAApQ,KAAA,GACAC,GAAA,EAAA3vM,EAAA,GACA+/M,GAAA,KAAApQ,GACAqQ,GAAArQ,KAAA,GACAC,GAAA,EAAA5vM,EAAA,GACAigN,GAAA,KAAArQ,GACAsQ,GAAAtQ,KAAA,GACAC,GAAA,EAAA7vM,EAAA,GACAmgN,GAAA,KAAAtQ,GACAuQ,GAAAvQ,KAAA,GACAC,GAAA,EAAA9vM,EAAA,GACAqgN,GAAA,KAAAvQ,GACAwQ,GAAAxQ,KAAA,GAEAroJ,EAAAgyJ,SAAAzzL,EAAAyzL,SAAArhL,EAAAqhL,SACAhyJ,EAAA97D,OAAA,GAMA,IAAA40N,IAAAptN,GAJA62K,EAAA19K,KAAA2pN,KAAAsH,EAAA4B,IAIA,KAAA,MAFAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA6B,IACA9yN,KAAA2pN,KAAAuH,EAAA2B,GAAA,KAEA,IAAA,EACAhsN,IAFA42K,EAAAz9K,KAAA2pN,KAAAuH,EAAA4B,KAEAlrL,IAAA,IAAA,IAAAqsL,KAAA,IAAA,EACAA,IAAA,SAEAv2C,EAAA19K,KAAA2pN,KAAAyH,EAAAyB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA0B,IACA9yN,KAAA2pN,KAAA0H,EAAAwB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA0H,EAAAyB,GAKA,IAAAoB,IAAArtN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA8B,GAAA,GAIA,KAAA,MAFAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA+B,GAAA,GACAhzN,KAAA2pN,KAAAuH,EAAA6B,GAAA,KAEA,IAAA,EACAlsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA8B,GAAA,IAEAprL,IAAA,IAAA,IAAAssL,KAAA,IAAA,EACAA,IAAA,SAEAx2C,EAAA19K,KAAA2pN,KAAA2H,EAAAuB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAwB,IACA9yN,KAAA2pN,KAAA4H,EAAAsB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA4H,EAAAuB,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA2B,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA4B,GAAA,GACAhzN,KAAA2pN,KAAA0H,EAAA0B,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA2B,GAAA,EAKA,IAAAzV,IAAA12M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAgC,GAAA,GAIA,KAAA,MAFArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAiC,GAAA,GACAlzN,KAAA2pN,KAAAuH,EAAA+B,GAAA,KAEA,IAAA,EACApsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAgC,GAAA,IAEAtrL,IAAA,IAAA,IAAA21K,KAAA,IAAA,EACAA,IAAA,SAEA7/B,EAAA19K,KAAA2pN,KAAA8H,EAAAoB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAqB,IACA9yN,KAAA2pN,KAAA+H,EAAAmB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA+H,EAAAoB,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAyB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA0B,GAAA,GACAhzN,KAAA2pN,KAAA4H,EAAAwB,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAyB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA6B,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA8B,GAAA,GACAlzN,KAAA2pN,KAAA0H,EAAA4B,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA6B,GAAA,EAKA,IAAAiB,IAAAttN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAkC,GAAA,GAIA,KAAA,MAFAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAmC,GAAA,GACApzN,KAAA2pN,KAAAuH,EAAAiC,GAAA,KAEA,IAAA,EACAtsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAkC,GAAA,IAEAxrL,IAAA,IAAA,IAAAusL,KAAA,IAAA,EACAA,IAAA,SAEAz2C,EAAA19K,KAAA2pN,KAAAiI,EAAAiB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAkB,IACA9yN,KAAA2pN,KAAAkI,EAAAgB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAkI,EAAAiB,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAsB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAuB,GAAA,GACAhzN,KAAA2pN,KAAA+H,EAAAqB,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAsB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAA2B,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA4B,GAAA,GACAlzN,KAAA2pN,KAAA4H,EAAA0B,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAA2B,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA+B,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAgC,GAAA,GACApzN,KAAA2pN,KAAA0H,EAAA8B,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA+B,GAAA,EAKA,IAAAgB,IAAAvtN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAoC,GAAA,GAIA,KAAA,MAFAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAqC,IAAA,GACAtzN,KAAA2pN,KAAAuH,EAAAmC,GAAA,KAEA,IAAA,EACAxsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAoC,IAAA,IAEA1rL,IAAA,IAAA,IAAAwsL,KAAA,IAAA,EACAA,IAAA,SAEA12C,EAAA19K,KAAA2pN,KAAAoI,EAAAc,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAe,IACA9yN,KAAA2pN,KAAAqI,EAAAa,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAqI,EAAAc,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAmB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAoB,GAAA,GACAhzN,KAAA2pN,KAAAkI,EAAAkB,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAmB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAwB,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAyB,GAAA,GACAlzN,KAAA2pN,KAAA+H,EAAAuB,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAwB,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAA6B,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA8B,GAAA,GACApzN,KAAA2pN,KAAA4H,EAAA4B,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAA6B,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAiC,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAkC,IAAA,GACAtzN,KAAA2pN,KAAA0H,EAAAgC,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAiC,IAAA,EAKA,IAAAe,IAAAxtN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAsC,IAAA,GAIA,KAAA,MAFA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAuC,IAAA,GACAxzN,KAAA2pN,KAAAuH,EAAAqC,IAAA,KAEA,IAAA,EACA1sN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAsC,IAAA,IAEA5rL,IAAA,IAAA,IAAAysL,KAAA,IAAA,EACAA,IAAA,SAEA32C,EAAA19K,KAAA2pN,KAAAuI,EAAAW,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAY,IACA9yN,KAAA2pN,KAAAwI,EAAAU,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAwI,EAAAW,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAgB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAiB,GAAA,GACAhzN,KAAA2pN,KAAAqI,EAAAe,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAgB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAqB,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAsB,GAAA,GACAlzN,KAAA2pN,KAAAkI,EAAAoB,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAqB,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAA0B,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAA2B,GAAA,GACApzN,KAAA2pN,KAAA+H,EAAAyB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAA0B,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAA+B,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAgC,IAAA,GACAtzN,KAAA2pN,KAAA4H,EAAA8B,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAA+B,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAmC,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAoC,IAAA,GACAxzN,KAAA2pN,KAAA0H,EAAAkC,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAmC,IAAA,EAKA,IAAAc,IAAAztN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAwC,IAAA,GAIA,KAAA,MAFA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAyC,IAAA,GACA1zN,KAAA2pN,KAAAuH,EAAAuC,IAAA,KAEA,IAAA,EACA5sN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAwC,IAAA,IAEA9rL,IAAA,IAAA,IAAA0sL,KAAA,IAAA,EACAA,IAAA,SAEA52C,EAAA19K,KAAA2pN,KAAA0I,EAAAQ,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAS,IACA9yN,KAAA2pN,KAAA2I,EAAAO,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA2I,EAAAQ,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAa,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAc,GAAA,GACAhzN,KAAA2pN,KAAAwI,EAAAY,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAa,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAkB,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAmB,GAAA,GACAlzN,KAAA2pN,KAAAqI,EAAAiB,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAkB,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAuB,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAwB,GAAA,GACApzN,KAAA2pN,KAAAkI,EAAAsB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAuB,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAA4B,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAA6B,IAAA,GACAtzN,KAAA2pN,KAAA+H,EAAA2B,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAA4B,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAiC,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAkC,IAAA,GACAxzN,KAAA2pN,KAAA4H,EAAAgC,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAiC,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAqC,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAsC,IAAA,GACA1zN,KAAA2pN,KAAA0H,EAAAoC,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAqC,IAAA,EAKA,IAAAlW,IAAA32M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA0C,IAAA,GAIA,KAAA,MAFA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA2C,IAAA,GACA5zN,KAAA2pN,KAAAuH,EAAAyC,IAAA,KAEA,IAAA,EACA9sN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA0C,IAAA,IAEAhsL,IAAA,IAAA,IAAA41K,KAAA,IAAA,EACAA,IAAA,SAEA9/B,EAAA19K,KAAA2pN,KAAA6I,EAAAK,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAM,IACA9yN,KAAA2pN,KAAA8I,EAAAI,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA8I,EAAAK,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAU,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAW,GAAA,GACAhzN,KAAA2pN,KAAA2I,EAAAS,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAU,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAe,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAgB,GAAA,GACAlzN,KAAA2pN,KAAAwI,EAAAc,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAe,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAoB,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAqB,GAAA,GACApzN,KAAA2pN,KAAAqI,EAAAmB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAoB,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAyB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAA0B,IAAA,GACAtzN,KAAA2pN,KAAAkI,EAAAwB,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAyB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAA8B,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAA+B,IAAA,GACAxzN,KAAA2pN,KAAA+H,EAAA6B,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAA8B,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAmC,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAoC,IAAA,GACA1zN,KAAA2pN,KAAA4H,EAAAkC,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAmC,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAuC,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAwC,IAAA,GACA5zN,KAAA2pN,KAAA0H,EAAAsC,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAuC,IAAA,EAKA,IAAAW,IAAA1tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA4C,IAAA,GAIA,KAAA,MAFAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA6C,IAAA,GACA9zN,KAAA2pN,KAAAuH,EAAA2C,IAAA,KAEA,IAAA,EACAhtN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA4C,IAAA,IAEAlsL,IAAA,IAAA,IAAA2sL,KAAA,IAAA,EACAA,IAAA,SAEA72C,EAAA19K,KAAA2pN,KAAAgJ,EAAAE,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAG,IACA9yN,KAAA2pN,KAAAiJ,EAAAC,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAE,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAO,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAQ,GAAA,GACAhzN,KAAA2pN,KAAA8I,EAAAM,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAO,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAY,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAa,GAAA,GACAlzN,KAAA2pN,KAAA2I,EAAAW,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAY,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAiB,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAkB,GAAA,GACApzN,KAAA2pN,KAAAwI,EAAAgB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAiB,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAsB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAuB,IAAA,GACAtzN,KAAA2pN,KAAAqI,EAAAqB,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAsB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAA2B,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAA4B,IAAA,GACAxzN,KAAA2pN,KAAAkI,EAAA0B,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAA2B,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAgC,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAiC,IAAA,GACA1zN,KAAA2pN,KAAA+H,EAAA+B,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAgC,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAqC,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAsC,IAAA,GACA5zN,KAAA2pN,KAAA4H,EAAAoC,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAqC,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAyC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA0C,IAAA,GACA9zN,KAAA2pN,KAAA0H,EAAAwC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAyC,IAAA,EAKA,IAAAU,IAAA3tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA8C,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA+C,IAAA,GACAh0N,KAAA2pN,KAAAuH,EAAA6C,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA8C,IAAA,IAEApsL,IAAA,IAAA,IAAA4sL,KAAA,IAAA,EACAA,IAAA,SAEA92C,EAAA19K,KAAA2pN,KAAAgJ,EAAAI,GAEAnrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAK,IACAhzN,KAAA2pN,KAAAiJ,EAAAG,GAAA,EACAt1C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAI,GACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAS,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAU,GAAA,GACAlzN,KAAA2pN,KAAA8I,EAAAQ,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAS,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAc,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAe,GAAA,GACApzN,KAAA2pN,KAAA2I,EAAAa,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAc,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAmB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAoB,IAAA,GACAtzN,KAAA2pN,KAAAwI,EAAAkB,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAmB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAwB,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAyB,IAAA,GACAxzN,KAAA2pN,KAAAqI,EAAAuB,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAwB,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAA6B,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAA8B,IAAA,GACA1zN,KAAA2pN,KAAAkI,EAAA4B,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAA6B,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAkC,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAmC,IAAA,GACA5zN,KAAA2pN,KAAA+H,EAAAiC,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAkC,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAuC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAwC,IAAA,GACA9zN,KAAA2pN,KAAA4H,EAAAsC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAuC,IAAA,EAKA,IAAAW,IAAA5tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA2C,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA4C,IAAA,GACAh0N,KAAA2pN,KAAA0H,EAAA0C,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA2C,IAAA,IAEApsL,IAAA,IAAA,IAAA6sL,KAAA,IAAA,EACAA,IAAA,SAEA/2C,EAAA19K,KAAA2pN,KAAAgJ,EAAAM,GAEArrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAO,IACAlzN,KAAA2pN,KAAAiJ,EAAAK,GAAA,EACAx1C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAM,GACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAW,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAY,GAAA,GACApzN,KAAA2pN,KAAA8I,EAAAU,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAW,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAgB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAiB,IAAA,GACAtzN,KAAA2pN,KAAA2I,EAAAe,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAgB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAqB,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAsB,IAAA,GACAxzN,KAAA2pN,KAAAwI,EAAAoB,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAqB,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAA0B,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAA2B,IAAA,GACA1zN,KAAA2pN,KAAAqI,EAAAyB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAA0B,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAA+B,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAgC,IAAA,GACA5zN,KAAA2pN,KAAAkI,EAAA8B,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAA+B,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAoC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAqC,IAAA,GACA9zN,KAAA2pN,KAAA+H,EAAAmC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAoC,IAAA,EAKA,IAAAY,IAAA7tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAyC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA0C,IAAA,GACAh0N,KAAA2pN,KAAA4H,EAAAwC,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAyC,IAAA,IAEApsL,IAAA,IAAA,IAAA8sL,KAAA,IAAA,EACAA,IAAA,SAEAh3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAQ,GAEAvrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAS,IACApzN,KAAA2pN,KAAAiJ,EAAAO,GAAA,EACA11C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAQ,GACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAa,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAc,IAAA,GACAtzN,KAAA2pN,KAAA8I,EAAAY,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAa,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAkB,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAmB,IAAA,GACAxzN,KAAA2pN,KAAA2I,EAAAiB,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAkB,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAuB,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAwB,IAAA,GACA1zN,KAAA2pN,KAAAwI,EAAAsB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAuB,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAA4B,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAA6B,IAAA,GACA5zN,KAAA2pN,KAAAqI,EAAA2B,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAA4B,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAiC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAkC,IAAA,GACA9zN,KAAA2pN,KAAAkI,EAAAgC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAiC,IAAA,EAKA,IAAAa,IAAA9tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAsC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAuC,IAAA,GACAh0N,KAAA2pN,KAAA+H,EAAAqC,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAsC,IAAA,IAEApsL,IAAA,IAAA,IAAA+sL,KAAA,IAAA,EACAA,IAAA,SAEAj3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAU,GAEAzrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAW,KACAtzN,KAAA2pN,KAAAiJ,EAAAS,GAAA,EACA51C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAU,IACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAe,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAgB,IAAA,GACAxzN,KAAA2pN,KAAA8I,EAAAc,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAe,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAoB,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAqB,IAAA,GACA1zN,KAAA2pN,KAAA2I,EAAAmB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAoB,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAyB,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAA0B,IAAA,GACA5zN,KAAA2pN,KAAAwI,EAAAwB,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAyB,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAA8B,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAA+B,IAAA,GACA9zN,KAAA2pN,KAAAqI,EAAA6B,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAA8B,IAAA,EAKA,IAAAc,IAAA/tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAmC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAoC,IAAA,GACAh0N,KAAA2pN,KAAAkI,EAAAkC,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAmC,IAAA,IAEApsL,IAAA,IAAA,IAAAgtL,KAAA,IAAA,EACAA,IAAA,SAEAl3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAY,IAEA3rL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAa,KACAxzN,KAAA2pN,KAAAiJ,EAAAW,IAAA,EACA91C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAY,IACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAiB,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAkB,IAAA,GACA1zN,KAAA2pN,KAAA8I,EAAAgB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAiB,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAsB,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAuB,IAAA,GACA5zN,KAAA2pN,KAAA2I,EAAAqB,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAsB,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAA2B,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAA4B,IAAA,GACA9zN,KAAA2pN,KAAAwI,EAAA0B,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAA2B,IAAA,EAKA,IAAAe,IAAAhuN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAgC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAiC,IAAA,GACAh0N,KAAA2pN,KAAAqI,EAAA+B,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAgC,IAAA,IAEApsL,IAAA,IAAA,IAAAitL,KAAA,IAAA,EACAA,IAAA,SAEAn3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAc,IAEA7rL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAe,KACA1zN,KAAA2pN,KAAAiJ,EAAAa,IAAA,EACAh2C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAc,IACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAmB,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAoB,IAAA,GACA5zN,KAAA2pN,KAAA8I,EAAAkB,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAmB,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAwB,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAyB,IAAA,GACA9zN,KAAA2pN,KAAA2I,EAAAuB,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAwB,IAAA,EAKA,IAAArW,IAAA52M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAA6B,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAA8B,IAAA,GACAh0N,KAAA2pN,KAAAwI,EAAA4B,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAA6B,IAAA,IAEApsL,IAAA,IAAA,IAAA61K,KAAA,IAAA,EACAA,IAAA,SAEA//B,EAAA19K,KAAA2pN,KAAAgJ,EAAAgB,IAEA/rL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAiB,KACA5zN,KAAA2pN,KAAAiJ,EAAAe,IAAA,EACAl2C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAgB,IACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAqB,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAsB,IAAA,GACA9zN,KAAA2pN,KAAA8I,EAAAoB,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAqB,IAAA,EAKA,IAAApW,IAAA72M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAA0B,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAA2B,IAAA,GACAh0N,KAAA2pN,KAAA2I,EAAAyB,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAA0B,IAAA,IAEApsL,IAAA,IAAA,IAAA81K,KAAA,IAAA,EACAA,IAAA,SAEAhgC,EAAA19K,KAAA2pN,KAAAgJ,EAAAkB,IAEAjsL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAmB,KACA9zN,KAAA2pN,KAAAiJ,EAAAiB,IAAA,EACAp2C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAkB,IAKA,IAAAgB,IAAAjuN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAuB,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAwB,IAAA,GACAh0N,KAAA2pN,KAAA8I,EAAAsB,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAuB,IAAA,IAEApsL,IAAA,IAAA,IAAAktL,KAAA,IAAA,EACAA,IAAA,SAMA,IAAAC,IAAAluN,GAJA62K,EAAA19K,KAAA2pN,KAAAgJ,EAAAoB,KAIA,KAAA,MAFAnsL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAqB,KACAh0N,KAAA2pN,KAAAiJ,EAAAmB,IAAA,KAEA,IAAA,EA0BA,OAzBAltN,IAFA42K,EAAAz9K,KAAA2pN,KAAAiJ,EAAAoB,MAEApsL,IAAA,IAAA,IAAAmtL,KAAA,IAAA,EACAA,IAAA,SACAzqH,EAAA,GAAA2pH,GACA3pH,EAAA,GAAA4pH,GACA5pH,EAAA,GAAAizG,GACAjzG,EAAA,GAAA6pH,GACA7pH,EAAA,GAAA8pH,GACA9pH,EAAA,GAAA+pH,GACA/pH,EAAA,GAAAgqH,GACAhqH,EAAA,GAAAkzG,GACAlzG,EAAA,GAAAiqH,GACAjqH,EAAA,GAAAkqH,GACAlqH,EAAA,IAAAmqH,GACAnqH,EAAA,IAAAoqH,GACApqH,EAAA,IAAAqqH,GACArqH,EAAA,IAAAsqH,GACAtqH,EAAA,IAAAuqH,GACAvqH,EAAA,IAAAmzG,GACAnzG,EAAA,IAAAozG,GACApzG,EAAA,IAAAwqH,GACAxqH,EAAA,IAAAyqH,GACA,IAAAluN,IACAyjG,EAAA,IAAAzjG,EACAs0D,EAAA97D,UAEA87D,GAiDA,SAAA65J,EAAAt7L,EAAAoS,EAAAqvB,GAEA,OADA,IAAA85J,GACAC,KAAAx7L,EAAAoS,EAAAqvB,GAsBA,SAAA85J,EAAAjtL,EAAAC,GACA7N,KAAA4N,EAAAA,EACA5N,KAAA6N,EAAAA,EAvEAjoC,KAAA2pN,OACAoH,EAAAvC,GAiDArG,EAAApwL,UAAA47K,MAAA,SAAA7nK,EAAAqvB,GACA,IACA39B,EAAApD,KAAA/6B,OAAAysC,EAAAzsC,OAWA,OAVA,KAAA+6B,KAAA/6B,QAAA,KAAAysC,EAAAzsC,OACA0xN,EAAA32L,KAAA0R,EAAAqvB,GACA39B,EAAA,GACAgxL,EAAAp0L,KAAA0R,EAAAqvB,GACA39B,EAAA,KArDA,SAAA9D,EAAAoS,EAAAqvB,GACAA,EAAAgyJ,SAAArhL,EAAAqhL,SAAAzzL,EAAAyzL,SACAhyJ,EAAA97D,OAAAq6B,EAAAr6B,OAAAysC,EAAAzsC,OAIA,IAFA,IAAA44J,EAAA,EACAk9D,EAAA,EACA1mS,EAAA,EAAAA,EAAA0sI,EAAA97D,OAAA,EAAA5wE,IAAA,CAGA,IAAAggS,EAAA0G,EACAA,EAAA,EAGA,IAFA,IAAAzG,EAAA,SAAAz2D,EACA02D,EAAA3uN,KAAAq0B,IAAA5lG,EAAAq9G,EAAAzsC,OAAA,GACAqsB,EAAA1rB,KAAAD,IAAA,EAAAtxE,EAAAirG,EAAAr6B,OAAA,GAAAqsB,GAAAijM,EAAAjjM,IAAA,CACA,IAAAnqB,EAAA9yE,EAAAi9F,EAGA0c,GAFA,EAAA1O,EAAA0zL,MAAA7rN,KACA,EAAAuqC,EAAAshL,MAAA1hM,IAGAgyJ,EAAA,SAAAt1I,EAGAsmL,EAAA,UADAhxC,EAAAA,EAAAgxC,EAAA,GAIAyG,IAFA1G,GAHAA,EAAAA,GAAArmL,EAAA,SAAA,GAAA,IAGAs1I,IAAA,IAAA,KAEA,GACA+wC,GAAA,SAEAtzJ,EAAAiyJ,MAAA3+R,GAAAigS,EACAz2D,EAAAw2D,EACAA,EAAA0G,EAQA,OANA,IAAAl9D,EACA98F,EAAAiyJ,MAAA3+R,GAAAwpO,EAEA98F,EAAA97D,SAGA87D,EAAA2yJ,QAgBAsH,CAAAh7L,KAAA0R,EAAAqvB,GAEA65J,EAAA56L,KAAA0R,EAAAqvB,IAcA85J,EAAAl9L,UAAAs9L,QAAA,SAAA12E,GAGA,IAFA,IAAAxlE,EAAA,IAAAlhD,MAAA0mH,GACAx7H,EAAAglM,EAAApwL,UAAAs3L,WAAA1wE,GAAA,EACAp9I,EAAA,EAAAA,EAAAo9I,EAAAp9I,IACA43E,EAAA53E,GAAA64B,KAAAk7L,OAAA/zN,EAAA4hB,EAAAw7H,GAGA,OAAAxlE,GAIA87I,EAAAl9L,UAAAu9L,OAAA,SAAAttL,EAAA7kB,EAAAw7H,GACA,GAAA,IAAA32G,GAAAA,IAAA22G,EAAA,EAAA,OAAA32G,EAGA,IADA,IAAAutL,EAAA,EACAh0N,EAAA,EAAAA,EAAA4hB,EAAA5hB,IACAg0N,IAAA,EAAAvtL,IAAA7kB,EAAA5hB,EAAA,EACAymC,IAAA,EAGA,OAAAutL,GAKAN,EAAAl9L,UAAAy9L,QAAA,SAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAl3E,GACA,IAAA,IAAAp9I,EAAA,EAAAA,EAAAo9I,EAAAp9I,IACAq0N,EAAAr0N,GAAAm0N,EAAAD,EAAAl0N,IACAs0N,EAAAt0N,GAAAo0N,EAAAF,EAAAl0N,KAIA0zN,EAAAl9L,UAAAxZ,UAAA,SAAAm3M,EAAAC,EAAAC,EAAAC,EAAAl3E,EAAA82E,GACAr7L,KAAAo7L,QAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAl3E,GAEA,IAAA,IAAAroI,EAAA,EAAAA,EAAAqoI,EAAAroI,IAAA,EAMA,IALA,IAAA6M,EAAA7M,GAAA,EAEAw/M,EAAA91N,KAAA+1N,IAAA,EAAA/1N,KAAAg2N,GAAA7yM,GACA8yM,EAAAj2N,KAAAk2N,IAAA,EAAAl2N,KAAAg2N,GAAA7yM,GAEA7hB,EAAA,EAAAA,EAAAq9I,EAAAr9I,GAAA6hB,EAIA,IAHA,IAAAgzM,EAAAL,EACAM,EAAAH,EAEAvqM,EAAA,EAAAA,EAAApV,EAAAoV,IAAA,CACA,IAAAk+G,EAAAgsF,EAAAt0N,EAAAoqB,GACA2qM,EAAAR,EAAAv0N,EAAAoqB,GAEA4qM,EAAAV,EAAAt0N,EAAAoqB,EAAApV,GACAigN,EAAAV,EAAAv0N,EAAAoqB,EAAApV,GAEAkgN,EAAAL,EAAAG,EAAAF,EAAAG,EAEAA,EAAAJ,EAAAI,EAAAH,EAAAE,EACAA,EAAAE,EAEAZ,EAAAt0N,EAAAoqB,GAAAk+G,EAAA0sF,EACAT,EAAAv0N,EAAAoqB,GAAA2qM,EAAAE,EAEAX,EAAAt0N,EAAAoqB,EAAApV,GAAAszH,EAAA0sF,EACAT,EAAAv0N,EAAAoqB,EAAApV,GAAA+/M,EAAAE,EAGA7qM,IAAAvI,IACAqzM,EAAAV,EAAAK,EAAAF,EAAAG,EAEAA,EAAAN,EAAAM,EAAAH,EAAAE,EACAA,EAAAK,KAOAvB,EAAAl9L,UAAA0+L,YAAA,SAAApoS,EAAAirF,GACA,IAAAqlI,EAAA,EAAA3+I,KAAAD,IAAAuZ,EAAAjrF,GACAqoS,EAAA,EAAA/3E,EACAp9I,EAAA,EACA,IAAAo9I,EAAAA,EAAA,EAAA,EAAAA,EAAAA,KAAA,EACAp9I,IAGA,OAAA,GAAAA,EAAA,EAAAm1N,GAGAzB,EAAAl9L,UAAA4+L,UAAA,SAAAjB,EAAAC,EAAAh3E,GACA,KAAAA,GAAA,GAEA,IAAA,IAAAp9I,EAAA,EAAAA,EAAAo9I,EAAA,EAAAp9I,IAAA,CACA,IAAA43E,EAAAu8I,EAAAn0N,GAEAm0N,EAAAn0N,GAAAm0N,EAAA/2E,EAAAp9I,EAAA,GACAm0N,EAAA/2E,EAAAp9I,EAAA,GAAA43E,EAEAA,EAAAw8I,EAAAp0N,GAEAo0N,EAAAp0N,IAAAo0N,EAAAh3E,EAAAp9I,EAAA,GACAo0N,EAAAh3E,EAAAp9I,EAAA,IAAA43E,IAIA87I,EAAAl9L,UAAA6+L,aAAA,SAAA9+C,EAAAn5B,GAEA,IADA,IAAAsZ,EAAA,EACA12J,EAAA,EAAAA,EAAAo9I,EAAA,EAAAp9I,IAAA,CACA,IAAAs9I,EAAA,KAAA7+I,KAAAuoC,MAAAuvI,EAAA,EAAAv2K,EAAA,GAAAo9I,GACA3+I,KAAAuoC,MAAAuvI,EAAA,EAAAv2K,GAAAo9I,GACAsZ,EAEA6f,EAAAv2K,GAAA,SAAAs9I,EAGAoZ,EADApZ,EAAA,SACA,EAEAA,EAAA,SAAA,EAIA,OAAAi5B,GAGAm9C,EAAAl9L,UAAA8+L,WAAA,SAAA/+C,EAAAt6I,EAAAk4L,EAAA/2E,GAEA,IADA,IAAAsZ,EAAA,EACA12J,EAAA,EAAAA,EAAAi8B,EAAAj8B,IACA02J,GAAA,EAAA6f,EAAAv2K,GAEAm0N,EAAA,EAAAn0N,GAAA,KAAA02J,EAAAA,KAAA,GACAy9D,EAAA,EAAAn0N,EAAA,GAAA,KAAA02J,EAAAA,KAAA,GAIA,IAAA12J,EAAA,EAAAi8B,EAAAj8B,EAAAo9I,IAAAp9I,EACAm0N,EAAAn0N,GAAA,EAGA0xB,EAAA,IAAAglI,GACAhlI,EAAA,KAAA,KAAAglI,KAGAg9D,EAAAl9L,UAAA++L,KAAA,SAAAn4E,GAEA,IADA,IAAAo4E,EAAA,IAAA9+L,MAAA0mH,GACAp9I,EAAA,EAAAA,EAAAo9I,EAAAp9I,IACAw1N,EAAAx1N,GAAA,EAGA,OAAAw1N,GAGA9B,EAAAl9L,UAAAm9L,KAAA,SAAAltL,EAAAC,EAAAkzB,GACA,IAAAwjF,EAAA,EAAAvkH,KAAAq8L,YAAAzuL,EAAA3oC,OAAA4oC,EAAA5oC,QAEAo2N,EAAAr7L,KAAAi7L,QAAA12E,GAEAppI,EAAA6kB,KAAA08L,KAAAn4E,GAEA+2E,EAAA,IAAAz9L,MAAA0mH,GACAq4E,EAAA,IAAA/+L,MAAA0mH,GACAs4E,EAAA,IAAAh/L,MAAA0mH,GAEAu4E,EAAA,IAAAj/L,MAAA0mH,GACAw4E,EAAA,IAAAl/L,MAAA0mH,GACAy4E,EAAA,IAAAn/L,MAAA0mH,GAEA04E,EAAAl8J,EAAAiyJ,MACAiK,EAAAh4N,OAAAs/I,EAEAvkH,KAAAy8L,WAAA7uL,EAAAolL,MAAAplL,EAAA3oC,OAAAq2N,EAAA/2E,GACAvkH,KAAAy8L,WAAA5uL,EAAAmlL,MAAAnlL,EAAA5oC,OAAA63N,EAAAv4E,GAEAvkH,KAAA7b,UAAAm3M,EAAAngN,EAAAyhN,EAAAC,EAAAt4E,EAAA82E,GACAr7L,KAAA7b,UAAA24M,EAAA3hN,EAAA4hN,EAAAC,EAAAz4E,EAAA82E,GAEA,IAAA,IAAAl0N,EAAA,EAAAA,EAAAo9I,EAAAp9I,IAAA,CACA,IAAAi1N,EAAAQ,EAAAz1N,GAAA41N,EAAA51N,GAAA01N,EAAA11N,GAAA61N,EAAA71N,GACA01N,EAAA11N,GAAAy1N,EAAAz1N,GAAA61N,EAAA71N,GAAA01N,EAAA11N,GAAA41N,EAAA51N,GACAy1N,EAAAz1N,GAAAi1N,EAUA,OAPAp8L,KAAAu8L,UAAAK,EAAAC,EAAAt4E,GACAvkH,KAAA7b,UAAAy4M,EAAAC,EAAAI,EAAA9hN,EAAAopI,EAAA82E,GACAr7L,KAAAu8L,UAAAU,EAAA9hN,EAAAopI,GACAvkH,KAAAw8L,aAAAS,EAAA14E,GAEAxjF,EAAAgyJ,SAAAnlL,EAAAmlL,SAAAllL,EAAAklL,SACAhyJ,EAAA97D,OAAA2oC,EAAA3oC,OAAA4oC,EAAA5oC,OACA87D,EAAA2yJ,SAIA3F,EAAApwL,UAAAiyL,IAAA,SAAAl+K,GACA,IAAAqvB,EAAA,IAAAgtJ,EAAA,MAEA,OADAhtJ,EAAAiyJ,MAAA,IAAAn1L,MAAAmC,KAAA/6B,OAAAysC,EAAAzsC,QACA+6B,KAAAu5K,MAAA7nK,EAAAqvB,IAIAgtJ,EAAApwL,UAAAu/L,KAAA,SAAAxrL,GACA,IAAAqvB,EAAA,IAAAgtJ,EAAA,MAEA,OADAhtJ,EAAAiyJ,MAAA,IAAAn1L,MAAAmC,KAAA/6B,OAAAysC,EAAAzsC,QACA21N,EAAA56L,KAAA0R,EAAAqvB,IAIAgtJ,EAAApwL,UAAA4xL,KAAA,SAAA79K,GACA,OAAA1R,KAAAq1B,QAAAkkJ,MAAA7nK,EAAA1R,OAGA+tL,EAAApwL,UAAAk2L,MAAA,SAAAniL,GACA7Y,EAAA,iBAAA6Y,GACA7Y,EAAA6Y,EAAA,UAIA,IADA,IAAAmsH,EAAA,EACA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs9I,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,IAAAuqC,EACA4xI,GAAA,SAAA7+B,IAAA,SAAAoZ,GACAA,IAAA,GACAA,GAAApZ,EAAA,SAAA,EAEAoZ,GAAAylB,IAAA,GACAtjJ,KAAAgzL,MAAA7rN,GAAA,SAAAm8K,EAQA,OALA,IAAAzlB,IACA79H,KAAAgzL,MAAA7rN,GAAA02J,EACA79H,KAAA/6B,UAGA+6B,MAGA+tL,EAAApwL,UAAAw/L,KAAA,SAAAzrL,GACA,OAAA1R,KAAAq1B,QAAAw+J,MAAAniL,IAIAq8K,EAAApwL,UAAAy/L,IAAA,WACA,OAAAp9L,KAAA4vL,IAAA5vL,OAIA+tL,EAAApwL,UAAA0/L,KAAA,WACA,OAAAr9L,KAAAuvL,KAAAvvL,KAAAq1B,UAIA04J,EAAApwL,UAAA0hI,IAAA,SAAA3tH,GACA,IAAA+yG,EAxxCA,SAAA/yG,GAGA,IAFA,IAAA+yG,EAAA,IAAA5mH,MAAA6T,EAAAu/J,aAEAwlB,EAAA,EAAAA,EAAAhyE,EAAAx/I,OAAAwxN,IAAA,CACA,IAAAlhE,EAAAkhE,EAAA,GAAA,EACAC,EAAAD,EAAA,GAEAhyE,EAAAgyE,IAAA/kL,EAAAshL,MAAAz9D,GAAA,GAAAmhE,KAAAA,EAGA,OAAAjyE,EA8wCA64E,CAAA5rL,GACA,GAAA,IAAA+yG,EAAAx/I,OAAA,OAAA,IAAA8oN,EAAA,GAIA,IADA,IAAAhiN,EAAAi0B,KACA74B,EAAA,EAAAA,EAAAs9I,EAAAx/I,QACA,IAAAw/I,EAAAt9I,GADAA,IAAA4E,EAAAA,EAAAqxN,OAIA,KAAAj2N,EAAAs9I,EAAAx/I,OACA,IAAA,IAAAqpC,EAAAviC,EAAAqxN,MAAAj2N,EAAAs9I,EAAAx/I,OAAAkC,IAAAmnC,EAAAA,EAAA8uL,MACA,IAAA34E,EAAAt9I,KAEA4E,EAAAA,EAAA6jN,IAAAthL,IAIA,OAAAviC,GAIAgiN,EAAApwL,UAAA4/L,OAAA,SAAAnjE,GACAvhI,EAAA,iBAAAuhI,GAAAA,GAAA,GACA,IAGAjzJ,EAHA6mC,EAAAosH,EAAA,GACAl+I,GAAAk+I,EAAApsH,GAAA,GACAwvL,EAAA,WAAA,GAAAxvL,GAAA,GAAAA,EAGA,GAAA,IAAAA,EAAA,CACA,IAAA6vH,EAAA,EAEA,IAAA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs2N,EAAAz9L,KAAAgzL,MAAA7rN,GAAAq2N,EACA/wN,GAAA,EAAAuzB,KAAAgzL,MAAA7rN,IAAAs2N,GAAAzvL,EACAhO,KAAAgzL,MAAA7rN,GAAAsF,EAAAoxJ,EACAA,EAAA4/D,IAAA,GAAAzvL,EAGA6vH,IACA79H,KAAAgzL,MAAA7rN,GAAA02J,EACA79H,KAAA/6B,UAIA,GAAA,IAAAiX,EAAA,CACA,IAAA/U,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IACA64B,KAAAgzL,MAAA7rN,EAAA+U,GAAA8jB,KAAAgzL,MAAA7rN,GAGA,IAAAA,EAAA,EAAAA,EAAA+U,EAAA/U,IACA64B,KAAAgzL,MAAA7rN,GAAA,EAGA64B,KAAA/6B,QAAAiX,EAGA,OAAA8jB,KAAA0zL,SAGA3F,EAAApwL,UAAA+/L,MAAA,SAAAtjE,GAGA,OADAvhI,EAAA,IAAAmH,KAAA+yL,UACA/yL,KAAAu9L,OAAAnjE,IAMA2zD,EAAApwL,UAAAg0L,OAAA,SAAAv3D,EAAAujE,EAAAC,GAEA,IAAAn2H,EADA5uE,EAAA,iBAAAuhI,GAAAA,GAAA,GAGA3yD,EADAk2H,GACAA,EAAAA,EAAA,IAAA,GAEA,EAGA,IAAA3vL,EAAAosH,EAAA,GACAl+I,EAAAtW,KAAAq0B,KAAAmgI,EAAApsH,GAAA,GAAAhO,KAAA/6B,QACA+5J,EAAA,SAAA,WAAAhxH,GAAAA,EACA6vL,EAAAD,EAMA,GAJAn2H,GAAAvrF,EACAurF,EAAA7hG,KAAAD,IAAA,EAAA8hG,GAGAo2H,EAAA,CACA,IAAA,IAAA12N,EAAA,EAAAA,EAAA+U,EAAA/U,IACA02N,EAAA7K,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAEA02N,EAAA54N,OAAAiX,EAGA,GAAA,IAAAA,QAEA,GAAA8jB,KAAA/6B,OAAAiX,EAEA,IADA8jB,KAAA/6B,QAAAiX,EACA/U,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,EAAA+U,QAGA8jB,KAAAgzL,MAAA,GAAA,EACAhzL,KAAA/6B,OAAA,EAGA,IAAA44J,EAAA,EACA,IAAA12J,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,IAAA,IAAA02J,GAAA12J,GAAAsgG,GAAAtgG,IAAA,CACA,IAAAq7C,EAAA,EAAAxiB,KAAAgzL,MAAA7rN,GACA64B,KAAAgzL,MAAA7rN,GAAA02J,GAAA,GAAA7vH,EAAAwU,IAAAxU,EACA6vH,EAAAr7G,EAAAw8G,EAaA,OATA6+D,GAAA,IAAAhgE,IACAggE,EAAA7K,MAAA6K,EAAA54N,UAAA44J,GAGA,IAAA79H,KAAA/6B,SACA+6B,KAAAgzL,MAAA,GAAA,EACAhzL,KAAA/6B,OAAA,GAGA+6B,KAAA0zL,SAGA3F,EAAApwL,UAAAmgM,MAAA,SAAA1jE,EAAAujE,EAAAC,GAGA,OADA/kM,EAAA,IAAAmH,KAAA+yL,UACA/yL,KAAA2xL,OAAAv3D,EAAAujE,EAAAC,IAIA7P,EAAApwL,UAAAogM,KAAA,SAAA3jE,GACA,OAAAp6H,KAAAq1B,QAAAqoK,MAAAtjE,IAGA2zD,EAAApwL,UAAAqgM,MAAA,SAAA5jE,GACA,OAAAp6H,KAAAq1B,QAAAkoK,OAAAnjE,IAIA2zD,EAAApwL,UAAAsgM,KAAA,SAAA7jE,GACA,OAAAp6H,KAAAq1B,QAAAyoK,MAAA1jE,IAGA2zD,EAAApwL,UAAAugM,MAAA,SAAA9jE,GACA,OAAAp6H,KAAAq1B,QAAAs8J,OAAAv3D,IAIA2zD,EAAApwL,UAAA63L,MAAA,SAAAiB,GACA59L,EAAA,iBAAA49L,GAAAA,GAAA,GACA,IAAAzoL,EAAAyoL,EAAA,GACAv6M,GAAAu6M,EAAAzoL,GAAA,GACAM,EAAA,GAAAN,EAGA,QAAAhO,KAAA/6B,QAAAiX,OAGA8jB,KAAAgzL,MAAA92M,GAEAoyB,IAIAy/K,EAAApwL,UAAAwgM,OAAA,SAAA/jE,GACAvhI,EAAA,iBAAAuhI,GAAAA,GAAA,GACA,IAAApsH,EAAAosH,EAAA,GACAl+I,GAAAk+I,EAAApsH,GAAA,GAIA,GAFAnV,EAAA,IAAAmH,KAAA+yL,SAAA,2CAEA/yL,KAAA/6B,QAAAiX,EACA,OAAA8jB,KAQA,GALA,IAAAgO,GACA9xB,IAEA8jB,KAAA/6B,OAAAW,KAAAq0B,IAAA/d,EAAA8jB,KAAA/6B,QAEA,IAAA+oC,EAAA,CACA,IAAAgxH,EAAA,SAAA,WAAAhxH,GAAAA,EACAhO,KAAAgzL,MAAAhzL,KAAA/6B,OAAA,IAAA+5J,EAGA,OAAAh/H,KAAA0zL,SAIA3F,EAAApwL,UAAAygM,MAAA,SAAAhkE,GACA,OAAAp6H,KAAAq1B,QAAA8oK,OAAA/jE,IAIA2zD,EAAApwL,UAAA23L,MAAA,SAAA5jL,GAGA,OAFA7Y,EAAA,iBAAA6Y,GACA7Y,EAAA6Y,EAAA,UACAA,EAAA,EAAA1R,KAAA0xL,OAAAhgL,GAGA,IAAA1R,KAAA+yL,SACA,IAAA/yL,KAAA/6B,SAAA,EAAA+6B,KAAAgzL,MAAA,IAAAthL,GACA1R,KAAAgzL,MAAA,GAAAthL,GAAA,EAAA1R,KAAAgzL,MAAA,IACAhzL,KAAA+yL,SAAA,EACA/yL,OAGAA,KAAA+yL,SAAA,EACA/yL,KAAA0xL,MAAAhgL,GACA1R,KAAA+yL,SAAA,EACA/yL,MAIAA,KAAA8zL,OAAApiL,IAGAq8K,EAAApwL,UAAAm2L,OAAA,SAAApiL,GACA1R,KAAAgzL,MAAA,IAAAthL,EAGA,IAAA,IAAAvqC,EAAA,EAAAA,EAAA64B,KAAA/6B,QAAA+6B,KAAAgzL,MAAA7rN,IAAA,SAAAA,IACA64B,KAAAgzL,MAAA7rN,IAAA,SACAA,IAAA64B,KAAA/6B,OAAA,EACA+6B,KAAAgzL,MAAA7rN,EAAA,GAAA,EAEA64B,KAAAgzL,MAAA7rN,EAAA,KAKA,OAFA64B,KAAA/6B,OAAAW,KAAAD,IAAAq6B,KAAA/6B,OAAAkC,EAAA,GAEA64B,MAIA+tL,EAAApwL,UAAA+zL,MAAA,SAAAhgL,GAGA,GAFA7Y,EAAA,iBAAA6Y,GACA7Y,EAAA6Y,EAAA,UACAA,EAAA,EAAA,OAAA1R,KAAAs1L,OAAA5jL,GAEA,GAAA,IAAA1R,KAAA+yL,SAIA,OAHA/yL,KAAA+yL,SAAA,EACA/yL,KAAAs1L,MAAA5jL,GACA1R,KAAA+yL,SAAA,EACA/yL,KAKA,GAFAA,KAAAgzL,MAAA,IAAAthL,EAEA,IAAA1R,KAAA/6B,QAAA+6B,KAAAgzL,MAAA,GAAA,EACAhzL,KAAAgzL,MAAA,IAAAhzL,KAAAgzL,MAAA,GACAhzL,KAAA+yL,SAAA,OAGA,IAAA,IAAA5rN,EAAA,EAAAA,EAAA64B,KAAA/6B,QAAA+6B,KAAAgzL,MAAA7rN,GAAA,EAAAA,IACA64B,KAAAgzL,MAAA7rN,IAAA,SACA64B,KAAAgzL,MAAA7rN,EAAA,IAAA,EAIA,OAAA64B,KAAA0zL,SAGA3F,EAAApwL,UAAA0gM,KAAA,SAAA3sL,GACA,OAAA1R,KAAAq1B,QAAAigK,MAAA5jL,IAGAq8K,EAAApwL,UAAA2gM,KAAA,SAAA5sL,GACA,OAAA1R,KAAAq1B,QAAAq8J,MAAAhgL,IAGAq8K,EAAApwL,UAAA4gM,KAAA,WAGA,OAFAv+L,KAAA+yL,SAAA,EAEA/yL,MAGA+tL,EAAApwL,UAAAw8J,IAAA,WACA,OAAAn6J,KAAAq1B,QAAAkpK,QAGAxQ,EAAApwL,UAAA6gM,aAAA,SAAA9sL,EAAAk+K,EAAAjrL,GACA,IACAx9B,EAIAs9I,EALArhH,EAAAsO,EAAAzsC,OAAA0/B,EAGA3E,KAAA+zL,QAAA3wL,GAGA,IAAAy6H,EAAA,EACA,IAAA12J,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IAAA,CACAs9I,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,EAAAw9B,IAAAk5H,EACA,IAAA10I,GAAA,EAAAuoB,EAAAshL,MAAA7rN,IAAAyoN,EAEA/xD,IADApZ,GAAA,SAAAt7H,IACA,KAAAA,EAAA,SAAA,GACA6W,KAAAgzL,MAAA7rN,EAAAw9B,GAAA,SAAA8/G,EAEA,KAAAt9I,EAAA64B,KAAA/6B,OAAA0/B,EAAAx9B,IAEA02J,GADApZ,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,EAAAw9B,IAAAk5H,IACA,GACA79H,KAAAgzL,MAAA7rN,EAAAw9B,GAAA,SAAA8/G,EAGA,GAAA,IAAAoZ,EAAA,OAAA79H,KAAA0zL,QAKA,IAFA76L,GAAA,IAAAglI,GACAA,EAAA,EACA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAEA02J,GADApZ,IAAA,EAAAzkH,KAAAgzL,MAAA7rN,IAAA02J,IACA,GACA79H,KAAAgzL,MAAA7rN,GAAA,SAAAs9I,EAIA,OAFAzkH,KAAA+yL,SAAA,EAEA/yL,KAAA0zL,SAGA3F,EAAApwL,UAAA8gM,SAAA,SAAA/sL,EAAAh3B,GACA,IAAAiqB,GAAA3E,KAAA/6B,OAAAysC,EAAAzsC,QAEA4B,EAAAm5B,KAAAq1B,QACA/7C,EAAAo4B,EAGAgtL,EAAA,EAAAplN,EAAA05M,MAAA15M,EAAArU,OAAA,GAGA,KADA0/B,EAAA,GADA3E,KAAAi1L,WAAAyJ,MAGAplN,EAAAA,EAAA0kN,MAAAr5L,GACA99B,EAAA02N,OAAA54L,GACA+5L,EAAA,EAAAplN,EAAA05M,MAAA15M,EAAArU,OAAA,IAIA,IACAqpC,EADApvB,EAAArY,EAAA5B,OAAAqU,EAAArU,OAGA,GAAA,QAAAyV,EAAA,EACA4zB,EAAA,IAAAy/K,EAAA,OACA9oN,OAAAia,EAAA,EACAovB,EAAA0kL,MAAA,IAAAn1L,MAAAyQ,EAAArpC,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAAmnC,EAAArpC,OAAAkC,IACAmnC,EAAA0kL,MAAA7rN,GAAA,EAIA,IAAAunI,EAAA7nI,EAAAwuD,QAAAmpK,aAAAllN,EAAA,EAAA4F,GACA,IAAAwvH,EAAAqkF,WACAlsN,EAAA6nI,EACApgG,IACAA,EAAA0kL,MAAA9zM,GAAA,IAIA,IAAA,IAAAoS,EAAApS,EAAA,EAAAoS,GAAA,EAAAA,IAAA,CACA,IAAAqtM,EAAA,UAAA,EAAA93N,EAAAmsN,MAAA15M,EAAArU,OAAAqsB,KACA,EAAAzqB,EAAAmsN,MAAA15M,EAAArU,OAAAqsB,EAAA,IAOA,IAHAqtM,EAAA/4N,KAAAq0B,IAAA0kM,EAAAD,EAAA,EAAA,UAEA73N,EAAA23N,aAAAllN,EAAAqlN,EAAArtM,GACA,IAAAzqB,EAAAksN,UACA4L,IACA93N,EAAAksN,SAAA,EACAlsN,EAAA23N,aAAAllN,EAAA,EAAAgY,GACAzqB,EAAAgoN,WACAhoN,EAAAksN,UAAA,GAGAzkL,IACAA,EAAA0kL,MAAA1hM,GAAAqtM,GAaA,OAVArwL,GACAA,EAAAolL,QAEA7sN,EAAA6sN,QAGA,QAAAh5M,GAAA,IAAAiqB,GACA99B,EAAA8qN,OAAAhtL,GAGA,CACA2uJ,IAAAhlJ,GAAA,KACAg0C,IAAAz7E,IAQAknN,EAAApwL,UAAAihM,OAAA,SAAAltL,EAAAh3B,EAAAmkN,GAGA,OAFAhmM,GAAA6Y,EAAAm9K,UAEA7uL,KAAA6uL,SACA,CACAv7B,IAAA,IAAAy6B,EAAA,GACAzrI,IAAA,IAAAyrI,EAAA,IAKA,IAAA/tL,KAAA+yL,UAAA,IAAArhL,EAAAqhL,UACAhnN,EAAAi0B,KAAA41L,MAAAgJ,OAAAltL,EAAAh3B,GAEA,QAAAA,IACA44K,EAAAvnL,EAAAunL,IAAAsiC,OAGA,QAAAl7M,IACA4nE,EAAAv2E,EAAAu2E,IAAAszI,MACAiJ,GAAA,IAAAv8I,EAAAywI,UACAzwI,EAAA8sI,KAAA19K,IAIA,CACA4hJ,IAAAA,EACAhxG,IAAAA,IAIA,IAAAtiD,KAAA+yL,UAAA,IAAArhL,EAAAqhL,UACAhnN,EAAAi0B,KAAA4+L,OAAAltL,EAAAkkL,MAAAl7M,GAEA,QAAAA,IACA44K,EAAAvnL,EAAAunL,IAAAsiC,OAGA,CACAtiC,IAAAA,EACAhxG,IAAAv2E,EAAAu2E,MAIA,IAAAtiD,KAAA+yL,SAAArhL,EAAAqhL,WACAhnN,EAAAi0B,KAAA41L,MAAAgJ,OAAAltL,EAAAkkL,MAAAl7M,GAEA,QAAAA,IACA4nE,EAAAv2E,EAAAu2E,IAAAszI,MACAiJ,GAAA,IAAAv8I,EAAAywI,UACAzwI,EAAA+sI,KAAA39K,IAIA,CACA4hJ,IAAAvnL,EAAAunL,IACAhxG,IAAAA,IAOA5wC,EAAAzsC,OAAA+6B,KAAA/6B,QAAA+6B,KAAAmH,IAAAuK,GAAA,EACA,CACA4hJ,IAAA,IAAAy6B,EAAA,GACAzrI,IAAAtiD,MAKA,IAAA0R,EAAAzsC,OACA,QAAAyV,EACA,CACA44K,IAAAtzJ,KAAA8+L,KAAAptL,EAAAshL,MAAA,IACA1wI,IAAA,MAIA,QAAA5nE,EACA,CACA44K,IAAA,KACAhxG,IAAA,IAAAyrI,EAAA/tL,KAAA00L,KAAAhjL,EAAAshL,MAAA,MAIA,CACA1/B,IAAAtzJ,KAAA8+L,KAAAptL,EAAAshL,MAAA,IACA1wI,IAAA,IAAAyrI,EAAA/tL,KAAA00L,KAAAhjL,EAAAshL,MAAA,MAIAhzL,KAAAy+L,SAAA/sL,EAAAh3B,GAlFA,IAAA44K,EAAAhxG,EAAAv2E,GAsFAgiN,EAAApwL,UAAA21J,IAAA,SAAA5hJ,GACA,OAAA1R,KAAA4+L,OAAAltL,EAAA,OAAA,GAAA4hJ,KAIAy6B,EAAApwL,UAAA2kD,IAAA,SAAA5wC,GACA,OAAA1R,KAAA4+L,OAAAltL,EAAA,OAAA,GAAA4wC,KAGAyrI,EAAApwL,UAAAuxL,KAAA,SAAAx9K,GACA,OAAA1R,KAAA4+L,OAAAltL,EAAA,OAAA,GAAA4wC,KAIAyrI,EAAApwL,UAAAohM,SAAA,SAAArtL,GACA,IAAAstL,EAAAh/L,KAAA4+L,OAAAltL,GAGA,GAAAstL,EAAA18I,IAAAusI,SAAA,OAAAmQ,EAAA1rC,IAEA,IAAAhxG,EAAA,IAAA08I,EAAA1rC,IAAAy/B,SAAAiM,EAAA18I,IAAA+sI,KAAA39K,GAAAstL,EAAA18I,IAEAklH,EAAA91J,EAAAwsL,MAAA,GACA9hC,EAAA1qJ,EAAA+/K,MAAA,GACAtqL,EAAAm7C,EAAAn7C,IAAAqgK,GAGA,OAAArgK,EAAA,GAAA,IAAAi1J,GAAA,IAAAj1J,EAAA63L,EAAA1rC,IAGA,IAAA0rC,EAAA1rC,IAAAy/B,SAAAiM,EAAA1rC,IAAAo+B,MAAA,GAAAsN,EAAA1rC,IAAAgiC,MAAA,IAGAvH,EAAApwL,UAAA+2L,KAAA,SAAAhjL,GACA7Y,EAAA6Y,GAAA,UAIA,IAHA,IAAAxqC,GAAA,GAAA,IAAAwqC,EAEA2kI,EAAA,EACAlvK,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IACAkvK,GAAAnvK,EAAAmvK,GAAA,EAAAr2I,KAAAgzL,MAAA7rN,KAAAuqC,EAGA,OAAA2kI,GAIA03C,EAAApwL,UAAAg3L,MAAA,SAAAjjL,GACA7Y,EAAA6Y,GAAA,UAGA,IADA,IAAAmsH,EAAA,EACA12J,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IAAA,CACA,IAAAs9I,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,IAAA,SAAA02J,EACA79H,KAAAgzL,MAAA7rN,GAAAs9I,EAAA/yG,EAAA,EACAmsH,EAAApZ,EAAA/yG,EAGA,OAAA1R,KAAA0zL,SAGA3F,EAAApwL,UAAAmhM,KAAA,SAAAptL,GACA,OAAA1R,KAAAq1B,QAAAs/J,MAAAjjL,IAGAq8K,EAAApwL,UAAAshM,KAAA,SAAA/3N,GACA2xB,EAAA,IAAA3xB,EAAA6rN,UACAl6L,GAAA3xB,EAAA2nN,UAEA,IAAAjhL,EAAA5N,KACA6N,EAAA3mC,EAAAmuD,QAGAznB,EADA,IAAAA,EAAAmlL,SACAnlL,EAAAshL,KAAAhoN,GAEA0mC,EAAAynB,QAaA,IATA,IAAAivF,EAAA,IAAAypE,EAAA,GACA7qE,EAAA,IAAA6qE,EAAA,GAGAnpE,EAAA,IAAAmpE,EAAA,GACAnoE,EAAA,IAAAmoE,EAAA,GAEA3pE,EAAA,EAEAx2G,EAAAutK,UAAAttK,EAAAstK,UACAvtK,EAAA+jL,OAAA,GACA9jL,EAAA8jL,OAAA,KACAvtE,EAMA,IAHA,IAAA86E,EAAArxL,EAAAwnB,QACA+7I,EAAAxjK,EAAAynB,SAEAznB,EAAAihL,UAAA,CACA,IAAA,IAAA1nN,EAAA,EAAAg4N,EAAA,EAAA,IAAAvxL,EAAAolL,MAAA,GAAAmM,IAAAh4N,EAAA,KAAAA,EAAAg4N,IAAA,GACA,GAAAh4N,EAAA,EAEA,IADAymC,EAAA+jL,OAAAxqN,GACAA,KAAA,IACAm9I,EAAAiqE,SAAArrE,EAAAqrE,WACAjqE,EAAA8qE,KAAA8P,GACAh8E,EAAAmsE,KAAAje,IAGA9sD,EAAAqtE,OAAA,GACAzuE,EAAAyuE,OAAA,GAIA,IAAA,IAAArgM,EAAA,EAAA8tM,EAAA,EAAA,IAAAvxL,EAAAmlL,MAAA,GAAAoM,IAAA9tM,EAAA,KAAAA,EAAA8tM,IAAA,GACA,GAAA9tM,EAAA,EAEA,IADAuc,EAAA8jL,OAAArgM,GACAA,KAAA,IACAszH,EAAA2pE,SAAA3oE,EAAA2oE,WACA3pE,EAAAwqE,KAAA8P,GACAt5E,EAAAypE,KAAAje,IAGAxsD,EAAA+sE,OAAA,GACA/rE,EAAA+rE,OAAA,GAIA/jL,EAAAzG,IAAA0G,IAAA,GACAD,EAAAyhL,KAAAxhL,GACAy2G,EAAA+qE,KAAAzqE,GACA1B,EAAAmsE,KAAAzpE,KAEA/3G,EAAAwhL,KAAAzhL,GACAg3G,EAAAyqE,KAAA/qE,GACAsB,EAAAypE,KAAAnsE,IAIA,MAAA,CACAr8I,EAAA+9I,EACAtrI,EAAAssI,EACAurD,IAAAtjK,EAAA0vL,OAAAn5E,KAOA2pE,EAAApwL,UAAA0hM,OAAA,SAAAn4N,GACA2xB,EAAA,IAAA3xB,EAAA6rN,UACAl6L,GAAA3xB,EAAA2nN,UAEA,IAAAhoN,EAAAm5B,KACA1mB,EAAApS,EAAAmuD,QAGAxuD,EADA,IAAAA,EAAAksN,SACAlsN,EAAAqoN,KAAAhoN,GAEAL,EAAAwuD,QAQA,IALA,IAuCAtpD,EAvCAuzN,EAAA,IAAAvR,EAAA,GACAwR,EAAA,IAAAxR,EAAA,GAEAxiK,EAAAjyC,EAAA+7C,QAEAxuD,EAAAmrN,KAAA,GAAA,GAAA14M,EAAA04M,KAAA,GAAA,GAAA,CACA,IAAA,IAAA7qN,EAAA,EAAAg4N,EAAA,EAAA,IAAAt4N,EAAAmsN,MAAA,GAAAmM,IAAAh4N,EAAA,KAAAA,EAAAg4N,IAAA,GACA,GAAAh4N,EAAA,EAEA,IADAN,EAAA8qN,OAAAxqN,GACAA,KAAA,GACAm4N,EAAA/Q,SACA+Q,EAAAlQ,KAAA7jK,GAGA+zK,EAAA3N,OAAA,GAIA,IAAA,IAAArgM,EAAA,EAAA8tM,EAAA,EAAA,IAAA9lN,EAAA05M,MAAA,GAAAoM,IAAA9tM,EAAA,KAAAA,EAAA8tM,IAAA,GACA,GAAA9tM,EAAA,EAEA,IADAhY,EAAAq4M,OAAArgM,GACAA,KAAA,GACAiuM,EAAAhR,SACAgR,EAAAnQ,KAAA7jK,GAGAg0K,EAAA5N,OAAA,GAIA9qN,EAAAsgC,IAAA7tB,IAAA,GACAzS,EAAAwoN,KAAA/1M,GACAgmN,EAAAjQ,KAAAkQ,KAEAjmN,EAAA+1M,KAAAxoN,GACA04N,EAAAlQ,KAAAiQ,IAeA,OATAvzN,EADA,IAAAlF,EAAAmrN,KAAA,GACAsN,EAEAC,GAGAvN,KAAA,GAAA,GACAjmN,EAAAqjN,KAAAloN,GAGA6E,GAGAgiN,EAAApwL,UAAAwzK,IAAA,SAAAz/J,GACA,GAAA1R,KAAA6uL,SAAA,OAAAn9K,EAAAyoJ,MACA,GAAAzoJ,EAAAm9K,SAAA,OAAA7uL,KAAAm6J,MAEA,IAAAtzL,EAAAm5B,KAAAq1B,QACA/7C,EAAAo4B,EAAA2jB,QACAxuD,EAAAksN,SAAA,EACAz5M,EAAAy5M,SAAA,EAGA,IAAA,IAAApuL,EAAA,EAAA99B,EAAAs0M,UAAA7hM,EAAA6hM,SAAAx2K,IACA99B,EAAA8qN,OAAA,GACAr4M,EAAAq4M,OAAA,GAGA,OAAA,CACA,KAAA9qN,EAAAs0M,UACAt0M,EAAA8qN,OAAA,GAEA,KAAAr4M,EAAA6hM,UACA7hM,EAAAq4M,OAAA,GAGA,IAAA3jL,EAAAnnC,EAAAsgC,IAAA7tB,GACA,GAAA00B,EAAA,EAAA,CAEA,IAAA+wC,EAAAl4E,EACAA,EAAAyS,EACAA,EAAAylE,OACA,GAAA,IAAA/wC,GAAA,IAAA10B,EAAA04M,KAAA,GACA,MAGAnrN,EAAAwoN,KAAA/1M,GAGA,OAAAA,EAAAikN,OAAA54L,IAIAopL,EAAApwL,UAAA6hM,KAAA,SAAA9tL,GACA,OAAA1R,KAAAi/L,KAAAvtL,GAAA7qC,EAAAqoN,KAAAx9K,IAGAq8K,EAAApwL,UAAAw9K,OAAA,WACA,OAAA,IAAA,EAAAn7K,KAAAgzL,MAAA,KAGAjF,EAAApwL,UAAA4wL,MAAA,WACA,OAAA,IAAA,EAAAvuL,KAAAgzL,MAAA,KAIAjF,EAAApwL,UAAA8zL,MAAA,SAAA//K,GACA,OAAA1R,KAAAgzL,MAAA,GAAAthL,GAIAq8K,EAAApwL,UAAA8hM,MAAA,SAAAhJ,GACA59L,EAAA,iBAAA49L,GACA,IAAAzoL,EAAAyoL,EAAA,GACAv6M,GAAAu6M,EAAAzoL,GAAA,GACAM,EAAA,GAAAN,EAGA,GAAAhO,KAAA/6B,QAAAiX,EAGA,OAFA8jB,KAAA+zL,QAAA73M,EAAA,GACA8jB,KAAAgzL,MAAA92M,IAAAoyB,EACAtO,KAKA,IADA,IAAA69H,EAAAvvH,EACAnnC,EAAA+U,EAAA,IAAA2hJ,GAAA12J,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs9I,EAAA,EAAAzkH,KAAAgzL,MAAA7rN,GAEA02J,GADApZ,GAAAoZ,KACA,GACApZ,GAAA,SACAzkH,KAAAgzL,MAAA7rN,GAAAs9I,EAMA,OAJA,IAAAoZ,IACA79H,KAAAgzL,MAAA7rN,GAAA02J,EACA79H,KAAA/6B,UAEA+6B,MAGA+tL,EAAApwL,UAAAkxL,OAAA,WACA,OAAA,IAAA7uL,KAAA/6B,QAAA,IAAA+6B,KAAAgzL,MAAA,IAGAjF,EAAApwL,UAAAq0L,KAAA,SAAAtgL,GACA,IAOA3lC,EAPAgnN,EAAArhL,EAAA,EAEA,GAAA,IAAA1R,KAAA+yL,WAAAA,EAAA,OAAA,EACA,GAAA,IAAA/yL,KAAA+yL,UAAAA,EAAA,OAAA,EAKA,GAHA/yL,KAAA0zL,QAGA1zL,KAAA/6B,OAAA,EACA8G,EAAA,MACA,CACAgnN,IACArhL,GAAAA,GAGA7Y,EAAA6Y,GAAA,SAAA,qBAEA,IAAA+yG,EAAA,EAAAzkH,KAAAgzL,MAAA,GACAjnN,EAAA04I,IAAA/yG,EAAA,EAAA+yG,EAAA/yG,GAAA,EAAA,EAEA,OAAA,IAAA1R,KAAA+yL,SAAA,GAAAhnN,EACAA,GAOAgiN,EAAApwL,UAAAwJ,IAAA,SAAAuK,GACA,GAAA,IAAA1R,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAAA,OAAA,EACA,GAAA,IAAA/yL,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAAA,OAAA,EAEA,IAAAhnN,EAAAi0B,KAAA0/L,KAAAhuL,GACA,OAAA,IAAA1R,KAAA+yL,SAAA,GAAAhnN,EACAA,GAIAgiN,EAAApwL,UAAA+hM,KAAA,SAAAhuL,GAEA,GAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA,OAAA,EACA,GAAA+6B,KAAA/6B,OAAAysC,EAAAzsC,OAAA,OAAA,EAGA,IADA,IAAA8G,EAAA,EACA5E,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IAAA,CACA,IAAAN,EAAA,EAAAm5B,KAAAgzL,MAAA7rN,GACAmS,EAAA,EAAAo4B,EAAAshL,MAAA7rN,GAEA,GAAAN,IAAAyS,EAAA,CACAzS,EAAAyS,EACAvN,GAAA,EACAlF,EAAAyS,IACAvN,EAAA,GAEA,OAEA,OAAAA,GAGAgiN,EAAApwL,UAAAgiM,IAAA,SAAAjuL,GACA,OAAA,IAAA1R,KAAAgyL,KAAAtgL,IAGAq8K,EAAApwL,UAAA3mG,GAAA,SAAA06G,GACA,OAAA,IAAA1R,KAAAmH,IAAAuK,IAGAq8K,EAAApwL,UAAAiiM,KAAA,SAAAluL,GACA,OAAA1R,KAAAgyL,KAAAtgL,IAAA,GAGAq8K,EAAApwL,UAAAkiM,IAAA,SAAAnuL,GACA,OAAA1R,KAAAmH,IAAAuK,IAAA,GAGAq8K,EAAApwL,UAAAmiM,IAAA,SAAApuL,GACA,OAAA,IAAA1R,KAAAgyL,KAAAtgL,IAGAq8K,EAAApwL,UAAAzmG,GAAA,SAAAw6G,GACA,OAAA,IAAA1R,KAAAmH,IAAAuK,IAGAq8K,EAAApwL,UAAAoiM,KAAA,SAAAruL,GACA,OAAA1R,KAAAgyL,KAAAtgL,IAAA,GAGAq8K,EAAApwL,UAAAqiM,IAAA,SAAAtuL,GACA,OAAA1R,KAAAmH,IAAAuK,IAAA,GAGAq8K,EAAApwL,UAAAsiM,IAAA,SAAAvuL,GACA,OAAA,IAAA1R,KAAAgyL,KAAAtgL,IAGAq8K,EAAApwL,UAAA4V,GAAA,SAAA7B,GACA,OAAA,IAAA1R,KAAAmH,IAAAuK,IAOAq8K,EAAAG,IAAA,SAAAx8K,GACA,OAAA,IAAAwuL,EAAAxuL,IAGAq8K,EAAApwL,UAAAswL,MAAA,SAAAh0G,GAGA,OAFAphF,GAAAmH,KAAAkuL,IAAA,yCACAr1L,EAAA,IAAAmH,KAAA+yL,SAAA,iCACA94G,EAAAkmH,UAAAngM,MAAAogM,UAAAnmH,IAGA8zG,EAAApwL,UAAA0iM,QAAA,WAEA,OADAxnM,EAAAmH,KAAAkuL,IAAA,wDACAluL,KAAAkuL,IAAAoS,YAAAtgM,OAGA+tL,EAAApwL,UAAAyiM,UAAA,SAAAnmH,GAEA,OADAj6E,KAAAkuL,IAAAj0G,EACAj6E,MAGA+tL,EAAApwL,UAAA4iM,SAAA,SAAAtmH,GAEA,OADAphF,GAAAmH,KAAAkuL,IAAA,yCACAluL,KAAAogM,UAAAnmH,IAGA8zG,EAAApwL,UAAA6iM,OAAA,SAAA9uL,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAAlvM,IAAAghB,KAAA0R,IAGAq8K,EAAApwL,UAAA0wL,QAAA,SAAA38K,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAAkB,KAAApvL,KAAA0R,IAGAq8K,EAAApwL,UAAA8iM,OAAA,SAAA/uL,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA58J,IAAAtxB,KAAA0R,IAGAq8K,EAAApwL,UAAAixL,QAAA,SAAAl9K,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAAmB,KAAArvL,KAAA0R,IAGAq8K,EAAApwL,UAAA+iM,OAAA,SAAAhvL,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAAyS,IAAA3gM,KAAA0R,IAGAq8K,EAAApwL,UAAAijM,OAAA,SAAAlvL,GAGA,OAFA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA2S,SAAA7gM,KAAA0R,GACA1R,KAAAkuL,IAAA0B,IAAA5vL,KAAA0R,IAGAq8K,EAAApwL,UAAAywL,QAAA,SAAA18K,GAGA,OAFA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA2S,SAAA7gM,KAAA0R,GACA1R,KAAAkuL,IAAAqB,KAAAvvL,KAAA0R,IAGAq8K,EAAApwL,UAAAwwL,OAAA,WAGA,OAFAt1L,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAAkP,IAAAp9L,OAGA+tL,EAAApwL,UAAAojM,QAAA,WAGA,OAFAloM,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAAmP,KAAAr9L,OAIA+tL,EAAApwL,UAAA2wL,QAAA,WAGA,OAFAz1L,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAA8S,KAAAhhM,OAGA+tL,EAAApwL,UAAAsjM,QAAA,WAGA,OAFApoM,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAAsR,KAAAx/L,OAIA+tL,EAAApwL,UAAA6wL,OAAA,WAGA,OAFA31L,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAA0H,IAAA51L,OAGA+tL,EAAApwL,UAAAujM,OAAA,SAAAxvL,GAGA,OAFA7Y,EAAAmH,KAAAkuL,MAAAx8K,EAAAw8K,IAAA,qBACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAA7uD,IAAAr/H,KAAA0R,IAIA,IAAAyvL,EAAA,CACAC,KAAA,KACAC,KAAA,KACAC,KAAA,KACAC,OAAA,MAIA,SAAAC,EAAA3uS,EAAAq0E,GAEA84B,KAAAntG,KAAAA,EACAmtG,KAAA94B,EAAA,IAAA6mN,EAAA7mN,EAAA,IACA84B,KAAA/rG,EAAA+rG,KAAA94B,EAAA+pM,YACAjxK,KAAA3rG,EAAA,IAAA05R,EAAA,GAAAwP,OAAAv9L,KAAA/rG,GAAAo7R,KAAArvL,KAAA94B,GAEA84B,KAAA5E,IAAA4E,KAAAyhM,OAiDA,SAAAC,IACAF,EAAA5jM,KACAoC,KACA,OACA,2EA+DA,SAAA2hM,IACAH,EAAA5jM,KACAoC,KACA,OACA,kEAIA,SAAA4hM,IACAJ,EAAA5jM,KACAoC,KACA,OACA,yDAIA,SAAA6hM,IAEAL,EAAA5jM,KACAoC,KACA,QACA,uEA8CA,SAAAkgM,EAAAhhN,GACA,GAAA,iBAAAA,EAAA,CACA,IAAAkvC,EAAA2/J,EAAA+T,OAAA5iN,GACA8gB,KAAA9gB,EAAAkvC,EAAAlnD,EACA84B,KAAAouB,MAAAA,OAEAv1B,EAAA3Z,EAAAygN,IAAA,GAAA,kCACA3/L,KAAA9gB,EAAAA,EACA8gB,KAAAouB,MAAA,KAkOA,SAAA2zK,EAAA7iN,GACAghN,EAAAtiM,KAAAoC,KAAA9gB,GAEA8gB,KAAA2E,MAAA3E,KAAA9gB,EAAA+xL,YACAjxK,KAAA2E,MAAA,IAAA,IACA3E,KAAA2E,OAAA,GAAA3E,KAAA2E,MAAA,IAGA3E,KAAAgO,EAAA,IAAA+/K,EAAA,GAAAwP,OAAAv9L,KAAA2E,OACA3E,KAAAo8J,GAAAp8J,KAAAgiM,KAAAhiM,KAAAgO,EAAAovL,OACAp9L,KAAAiiM,KAAAjiM,KAAAgO,EAAAqxL,OAAAr/L,KAAA9gB,GAEA8gB,KAAAkiM,KAAAliM,KAAAiiM,KAAArS,IAAA5vL,KAAAgO,GAAA0jL,MAAA,GAAAp+B,IAAAtzJ,KAAA9gB,GACA8gB,KAAAkiM,KAAAliM,KAAAkiM,KAAAhT,KAAAlvL,KAAAgO,GACAhO,KAAAkiM,KAAAliM,KAAAgO,EAAAsjB,IAAAtxB,KAAAkiM,MA5aAV,EAAA7jM,UAAA8jM,KAAA,WACA,IAAArmM,EAAA,IAAA2yL,EAAA,MAEA,OADA3yL,EAAA43L,MAAA,IAAAn1L,MAAAj4B,KAAAwhL,KAAApnJ,KAAA/rG,EAAA,KACAmnG,GAGAomM,EAAA7jM,UAAAwkM,QAAA,SAAAzwL,GAGA,IACA0wL,EADAp0L,EAAA0D,EAGA,GACA1R,KAAAlgB,MAAAkuB,EAAAhO,KAAA5E,KAGAgnM,GADAp0L,GADAA,EAAAhO,KAAAqiM,MAAAr0L,IACAohL,KAAApvL,KAAA5E,MACA61K,kBACAmxB,EAAApiM,KAAA/rG,GAEA,IAAAkzG,EAAAi7L,EAAApiM,KAAA/rG,GAAA,EAAA+5G,EAAA0xL,KAAA1/L,KAAA94B,GAgBA,OAfA,IAAAigC,GACA6G,EAAAglL,MAAA,GAAA,EACAhlL,EAAA/oC,OAAA,GACAkiC,EAAA,EACA6G,EAAAqhL,KAAArvL,KAAA94B,QAEAxxE,IAAAs4G,EAAA0lL,MAEA1lL,EAAA0lL,QAGA1lL,EAAAs0L,SAIAt0L,GAGAwzL,EAAA7jM,UAAA7d,MAAA,SAAAkP,EAAA+xC,GACA/xC,EAAA2iM,OAAA3xL,KAAA/rG,EAAA,EAAA8sI,IAGAygK,EAAA7jM,UAAA0kM,MAAA,SAAA3wL,GACA,OAAAA,EAAA69K,KAAAvvL,KAAA3rG,IASAo+R,EAAAiP,EAAAF,GAEAE,EAAA/jM,UAAA7d,MAAA,SAAAkP,EAAA8vI,GAKA,IAHA,IAAAE,EAAA,QAEAujE,EAAA38N,KAAAq0B,IAAAjL,EAAA/pB,OAAA,GACAkC,EAAA,EAAAA,EAAAo7N,EAAAp7N,IACA23J,EAAAk0D,MAAA7rN,GAAA6nB,EAAAgkM,MAAA7rN,GAIA,GAFA23J,EAAA75J,OAAAs9N,EAEAvzM,EAAA/pB,QAAA,EAGA,OAFA+pB,EAAAgkM,MAAA,GAAA,OACAhkM,EAAA/pB,OAAA,GAKA,IAAAkY,EAAA6R,EAAAgkM,MAAA,GAGA,IAFAl0D,EAAAk0D,MAAAl0D,EAAA75J,UAAAkY,EAAA6hJ,EAEA73J,EAAA,GAAAA,EAAA6nB,EAAA/pB,OAAAkC,IAAA,CACA,IAAAiW,EAAA,EAAA4R,EAAAgkM,MAAA7rN,GACA6nB,EAAAgkM,MAAA7rN,EAAA,KAAAiW,EAAA4hJ,IAAA,EAAA7hJ,IAAA,GACAA,EAAAC,EAEAD,KAAA,GACA6R,EAAAgkM,MAAA7rN,EAAA,IAAAgW,EACA,IAAAA,GAAA6R,EAAA/pB,OAAA,GACA+pB,EAAA/pB,QAAA,GAEA+pB,EAAA/pB,QAAA,GAIAy8N,EAAA/jM,UAAA0kM,MAAA,SAAA3wL,GAEAA,EAAAshL,MAAAthL,EAAAzsC,QAAA,EACAysC,EAAAshL,MAAAthL,EAAAzsC,OAAA,GAAA,EACAysC,EAAAzsC,QAAA,EAIA,IADA,IAAAq+K,EAAA,EACAn8K,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IAAA,CACA,IAAAs9I,EAAA,EAAA/yG,EAAAshL,MAAA7rN,GACAm8K,GAAA,IAAA7+B,EACA/yG,EAAAshL,MAAA7rN,GAAA,SAAAm8K,EACAA,EAAA,GAAA7+B,GAAA6+B,EAAA,SAAA,GAUA,OANA,IAAA5xI,EAAAshL,MAAAthL,EAAAzsC,OAAA,KACAysC,EAAAzsC,SACA,IAAAysC,EAAAshL,MAAAthL,EAAAzsC,OAAA,IACAysC,EAAAzsC,UAGAysC,GASA+gL,EAAAkP,EAAAH,GAQA/O,EAAAmP,EAAAJ,GASA/O,EAAAoP,EAAAL,GAEAK,EAAAlkM,UAAA0kM,MAAA,SAAA3wL,GAGA,IADA,IAAAmsH,EAAA,EACA12J,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IAAA,CACA,IAAAk8K,EAAA,IAAA,EAAA3xI,EAAAshL,MAAA7rN,IAAA02J,EACAylB,EAAA,SAAAD,EACAA,KAAA,GAEA3xI,EAAAshL,MAAA7rN,GAAAm8K,EACAzlB,EAAAwlB,EAKA,OAHA,IAAAxlB,IACAnsH,EAAAshL,MAAAthL,EAAAzsC,UAAA44J,GAEAnsH,GAIAq8K,EAAA+T,OAAA,SAAAjvS,GAEA,GAAAsuS,EAAAtuS,GAAA,OAAAsuS,EAAAtuS,GAEA,IAAAu7H,EACA,GAAA,SAAAv7H,EACAu7H,EAAA,IAAAszK,OACA,GAAA,SAAA7uS,EACAu7H,EAAA,IAAAuzK,OACA,GAAA,SAAA9uS,EACAu7H,EAAA,IAAAwzK,MACA,CAAA,GAAA,WAAA/uS,EAGA,MAAA,IAAAimG,MAAA,iBAAAjmG,GAFAu7H,EAAA,IAAAyzK,EAMA,OAFAV,EAAAtuS,GAAAu7H,EAEAA,GAkBA8xK,EAAAviM,UAAAmjM,SAAA,SAAAj6N,GACAgyB,EAAA,IAAAhyB,EAAAksN,SAAA,iCACAl6L,EAAAhyB,EAAAqnN,IAAA,oCAGAgS,EAAAviM,UAAAkjM,SAAA,SAAAh6N,EAAAyS,GACAuf,EAAA,IAAAhyB,EAAAksN,SAAAz5M,EAAAy5M,UAAA,iCACAl6L,EAAAhyB,EAAAqnN,KAAArnN,EAAAqnN,MAAA50M,EAAA40M,IACA,oCAGAgS,EAAAviM,UAAAqkM,KAAA,SAAAn7N,GACA,OAAAm5B,KAAAouB,MAAApuB,KAAAouB,MAAA+zK,QAAAt7N,GAAAu5N,UAAApgM,MACAn5B,EAAAqoN,KAAAlvL,KAAA9gB,GAAAkhN,UAAApgM,OAGAkgM,EAAAviM,UAAAi4L,IAAA,SAAA/uN,GACA,OAAAA,EAAAgoN,SACAhoN,EAAAwuD,QAGAr1B,KAAA9gB,EAAAoyC,IAAAzqD,GAAAu5N,UAAApgM,OAGAkgM,EAAAviM,UAAA3e,IAAA,SAAAnY,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAmY,IAAA1F,GAIA,OAHAvN,EAAAo7B,IAAAnH,KAAA9gB,IAAA,GACAnT,EAAAsjN,KAAArvL,KAAA9gB,GAEAnT,EAAAq0N,UAAApgM,OAGAkgM,EAAAviM,UAAAyxL,KAAA,SAAAvoN,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAuoN,KAAA91M,GAIA,OAHAvN,EAAAo7B,IAAAnH,KAAA9gB,IAAA,GACAnT,EAAAsjN,KAAArvL,KAAA9gB,GAEAnT,GAGAm0N,EAAAviM,UAAA2zB,IAAA,SAAAzqD,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAyqD,IAAAh4C,GAIA,OAHAvN,EAAAimN,KAAA,GAAA,GACAjmN,EAAAqjN,KAAApvL,KAAA9gB,GAEAnT,EAAAq0N,UAAApgM,OAGAkgM,EAAAviM,UAAA0xL,KAAA,SAAAxoN,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAwoN,KAAA/1M,GAIA,OAHAvN,EAAAimN,KAAA,GAAA,GACAjmN,EAAAqjN,KAAApvL,KAAA9gB,GAEAnT,GAGAm0N,EAAAviM,UAAAgjM,IAAA,SAAA95N,EAAA6qC,GAEA,OADA1R,KAAA8gM,SAAAj6N,GACAm5B,KAAAgiM,KAAAn7N,EAAAm3N,MAAAtsL,KAGAwuL,EAAAviM,UAAA4xL,KAAA,SAAA1oN,EAAAyS,GAEA,OADA0mB,KAAA6gM,SAAAh6N,EAAAyS,GACA0mB,KAAAgiM,KAAAn7N,EAAA0oN,KAAAj2M,KAGA4mN,EAAAviM,UAAAiyL,IAAA,SAAA/oN,EAAAyS,GAEA,OADA0mB,KAAA6gM,SAAAh6N,EAAAyS,GACA0mB,KAAAgiM,KAAAn7N,EAAA+oN,IAAAt2M,KAGA4mN,EAAAviM,UAAA0/L,KAAA,SAAAx2N,GACA,OAAAm5B,KAAAuvL,KAAA1oN,EAAAA,EAAAwuD,UAGA6qK,EAAAviM,UAAAy/L,IAAA,SAAAv2N,GACA,OAAAm5B,KAAA4vL,IAAA/oN,EAAAA,IAGAq5N,EAAAviM,UAAAqjM,KAAA,SAAAn6N,GACA,GAAAA,EAAAgoN,SAAA,OAAAhoN,EAAAwuD,QAEA,IAAAmtK,EAAAxiM,KAAA9gB,EAAAuyM,MAAA,GAIA,GAHA54L,EAAA2pM,EAAA,GAAA,GAGA,IAAAA,EAAA,CACA,IAAAnjE,EAAAr/H,KAAA9gB,EAAAF,IAAA,IAAA+uM,EAAA,IAAA4D,OAAA,GACA,OAAA3xL,KAAAq/H,IAAAx4J,EAAAw4J,GAQA,IAFA,IAAA/wH,EAAAtO,KAAA9gB,EAAAo/M,KAAA,GACApiN,EAAA,GACAoyB,EAAAugL,UAAA,IAAAvgL,EAAAmjL,MAAA,IACAv1M,IACAoyB,EAAAqjL,OAAA,GAEA94L,GAAAyV,EAAAugL,UAEA,IAAA4T,EAAA,IAAA1U,EAAA,GAAAE,MAAAjuL,MACA0iM,EAAAD,EAAAjU,SAIAmU,EAAA3iM,KAAA9gB,EAAAo/M,KAAA,GAAA3M,OAAA,GACApsE,EAAAvlH,KAAA9gB,EAAA+xL,YAGA,IAFA1rD,EAAA,IAAAwoE,EAAA,EAAAxoE,EAAAA,GAAA0oE,MAAAjuL,MAEA,IAAAA,KAAAq/H,IAAA9Z,EAAAo9E,GAAAx7L,IAAAu7L,IACAn9E,EAAA8oE,QAAAqU,GAOA,IAJA,IAAAj2N,EAAAuzB,KAAAq/H,IAAA9Z,EAAAj3G,GACAN,EAAAhO,KAAAq/H,IAAAx4J,EAAAynC,EAAA+vL,KAAA,GAAA1M,OAAA,IACA5yI,EAAA/+C,KAAAq/H,IAAAx4J,EAAAynC,GACApvB,EAAAhD,EACA,IAAA6iE,EAAA53C,IAAAs7L,IAAA,CAEA,IADA,IAAArnM,EAAA2jD,EACA53E,EAAA,EAAA,IAAAi0B,EAAA+L,IAAAs7L,GAAAt7N,IACAi0B,EAAAA,EAAA+yL,SAEAt1L,EAAA1xB,EAAA+X,GACA,IAAA5F,EAAA0mB,KAAAq/H,IAAA5yJ,EAAA,IAAAshN,EAAA,GAAAwP,OAAAr+M,EAAA/X,EAAA,IAEA6mC,EAAAA,EAAA4yL,OAAAtnN,GACA7M,EAAA6M,EAAA60M,SACApvI,EAAAA,EAAA6hJ,OAAAn0N,GACAyS,EAAA/X,EAGA,OAAA6mC,GAGAkyL,EAAAviM,UAAA6hM,KAAA,SAAA34N,GACA,IAAA+7N,EAAA/7N,EAAAw4N,OAAAr/L,KAAA9gB,GACA,OAAA,IAAA0jN,EAAA7P,UACA6P,EAAA7P,SAAA,EACA/yL,KAAAgiM,KAAAY,GAAApU,UAEAxuL,KAAAgiM,KAAAY,IAIA1C,EAAAviM,UAAA0hI,IAAA,SAAAx4J,EAAA6qC,GACA,GAAAA,EAAAm9K,SAAA,OAAA,IAAAd,EAAA,GAAAE,MAAAjuL,MACA,GAAA,IAAA0R,EAAAsgL,KAAA,GAAA,OAAAnrN,EAAAwuD,QAEA,IACAwtK,EAAA,IAAAhlM,MAAA,IACAglM,EAAA,GAAA,IAAA9U,EAAA,GAAAE,MAAAjuL,MACA6iM,EAAA,GAAAh8N,EACA,IAAA,IAAAM,EAAA,EAAAA,EAAA07N,EAAA59N,OAAAkC,IACA07N,EAAA17N,GAAA64B,KAAA4vL,IAAAiT,EAAA17N,EAAA,GAAAN,GAGA,IAAAkF,EAAA82N,EAAA,GACAnzJ,EAAA,EACAozJ,EAAA,EACA9tN,EAAA08B,EAAAu/J,YAAA,GAKA,IAJA,IAAAj8L,IACAA,EAAA,IAGA7N,EAAAuqC,EAAAzsC,OAAA,EAAAkC,GAAA,EAAAA,IAAA,CAEA,IADA,IAAAq7C,EAAA9Q,EAAAshL,MAAA7rN,GACAmqB,EAAAtc,EAAA,EAAAsc,GAAA,EAAAA,IAAA,CACA,IAAAmlM,EAAAj0K,GAAAlxB,EAAA,EACAvlB,IAAA82N,EAAA,KACA92N,EAAAi0B,KAAAo9L,IAAArxN,IAGA,IAAA0qN,GAAA,IAAA/mJ,GAKAA,IAAA,EACAA,GAAA+mJ,GA9BA,MA+BAqM,GACA,IAAA37N,GAAA,IAAAmqB,KAEAvlB,EAAAi0B,KAAA4vL,IAAA7jN,EAAA82N,EAAAnzJ,IACAozJ,EAAA,EACApzJ,EAAA,IAXAozJ,EAAA,EAaA9tN,EAAA,GAGA,OAAAjJ,GAGAm0N,EAAAviM,UAAAwiM,UAAA,SAAAzuL,GACA,IAAA1D,EAAA0D,EAAAw9K,KAAAlvL,KAAA9gB,GAEA,OAAA8uB,IAAA0D,EAAA1D,EAAAqnB,QAAArnB,GAGAkyL,EAAAviM,UAAA2iM,YAAA,SAAA5uL,GACA,IAAA3lC,EAAA2lC,EAAA2jB,QAEA,OADAtpD,EAAAmiN,IAAA,KACAniN,GAOAgiN,EAAAgV,KAAA,SAAArxL,GACA,OAAA,IAAAqwL,EAAArwL,IAmBA+gL,EAAAsP,EAAA7B,GAEA6B,EAAApkM,UAAAwiM,UAAA,SAAAzuL,GACA,OAAA1R,KAAAgiM,KAAAtwL,EAAAssL,MAAAh+L,KAAA2E,SAGAo9L,EAAApkM,UAAA2iM,YAAA,SAAA5uL,GACA,IAAA1D,EAAAhO,KAAAgiM,KAAAtwL,EAAAk+K,IAAA5vL,KAAAiiM,OAEA,OADAj0L,EAAAkgL,IAAA,KACAlgL,GAGA+zL,EAAApkM,UAAA4xL,KAAA,SAAA1oN,EAAAyS,GACA,GAAAzS,EAAAgoN,UAAAv1M,EAAAu1M,SAGA,OAFAhoN,EAAAmsN,MAAA,GAAA,EACAnsN,EAAA5B,OAAA,EACA4B,EAGA,IAAAk4E,EAAAl4E,EAAA0oN,KAAAj2M,GACA7M,EAAAsyE,EAAAq/I,MAAAp+L,KAAA2E,OAAAirL,IAAA5vL,KAAAkiM,MAAA/D,OAAAn+L,KAAA2E,OAAAirL,IAAA5vL,KAAA9gB,GACAg1G,EAAAn1C,EAAAswI,KAAA5iN,GAAAklN,OAAA3xL,KAAA2E,OACA54B,EAAAmoH,EAQA,OANAA,EAAA/sF,IAAAnH,KAAA9gB,IAAA,EACAnT,EAAAmoH,EAAAm7F,KAAArvL,KAAA9gB,GACAg1G,EAAA89F,KAAA,GAAA,IACAjmN,EAAAmoH,EAAAk7F,KAAApvL,KAAA9gB,IAGAnT,EAAAq0N,UAAApgM,OAGA+hM,EAAApkM,UAAAiyL,IAAA,SAAA/oN,EAAAyS,GACA,GAAAzS,EAAAgoN,UAAAv1M,EAAAu1M,SAAA,OAAA,IAAAd,EAAA,GAAAqS,UAAApgM,MAEA,IAAA++C,EAAAl4E,EAAA+oN,IAAAt2M,GACA7M,EAAAsyE,EAAAq/I,MAAAp+L,KAAA2E,OAAAirL,IAAA5vL,KAAAkiM,MAAA/D,OAAAn+L,KAAA2E,OAAAirL,IAAA5vL,KAAA9gB,GACAg1G,EAAAn1C,EAAAswI,KAAA5iN,GAAAklN,OAAA3xL,KAAA2E,OACA54B,EAAAmoH,EAOA,OANAA,EAAA/sF,IAAAnH,KAAA9gB,IAAA,EACAnT,EAAAmoH,EAAAm7F,KAAArvL,KAAA9gB,GACAg1G,EAAA89F,KAAA,GAAA,IACAjmN,EAAAmoH,EAAAk7F,KAAApvL,KAAA9gB,IAGAnT,EAAAq0N,UAAApgM,OAGA+hM,EAAApkM,UAAA6hM,KAAA,SAAA34N,GAGA,OADAm5B,KAAAgiM,KAAAn7N,EAAAw4N,OAAAr/L,KAAA9gB,GAAA0wM,IAAA5vL,KAAAo8J,KACAgkC,UAAApgM,OAn3GA,MAq3GA,IAAA3sG,GAAAA,EAAA2sG,kDCn3GA,SAAAnH,EAAAc,EAAAlqB,GACA,IAAAkqB,EACA,MAAA,IAAAb,MAAArpB,GAAA,oBAJAp8E,EAAAC,QAAAulG,EAOAA,EAAAsD,MAAA,SAAApT,EAAAilB,EAAAv+B,GACA,GAAAsZ,GAAAilB,EACA,MAAA,IAAAlV,MAAArpB,GAAA,qBAAAsZ,EAAA,OAAAilB,kCCTA,aAEA,IAAAuyK,EAAAjtR,EAkCA,SAAA+9R,EAAA7uK,GACA,OAAA,IAAAA,EAAAv9C,OACA,IAAAu9C,EAEAA,EAIA,SAAA4yI,EAAA3lL,GAEA,IADA,IAAA1D,EAAA,GACA5E,EAAA,EAAAA,EAAAsI,EAAAxK,OAAAkC,IACA4E,GAAAslN,EAAA5hN,EAAAtI,GAAAi3B,SAAA,KACA,OAAAryB,EAdAw0M,EAAAp9K,QA9BA,SAAA1zB,EAAAktJ,GACA,GAAA9+H,MAAA/gB,QAAArN,GACA,OAAAA,EAAArK,QACA,IAAAqK,EACA,MAAA,GACA,IAAA1D,EAAA,GACA,GAAA,iBAAA0D,EAAA,CACA,IAAA,IAAAtI,EAAA,EAAAA,EAAAsI,EAAAxK,OAAAkC,IACA4E,EAAA5E,GAAA,EAAAsI,EAAAtI,GACA,OAAA4E,EAEA,GAAA,QAAA4wJ,EAAA,EACAltJ,EAAAA,EAAAyJ,QAAA,eAAA,KACAjU,OAAA,GAAA,IACAwK,EAAA,IAAAA,GACA,IAAAtI,EAAA,EAAAA,EAAAsI,EAAAxK,OAAAkC,GAAA,EACA4E,EAAAjB,KAAA1E,SAAAqJ,EAAAtI,GAAAsI,EAAAtI,EAAA,GAAA,UAEA,IAAAA,EAAA,EAAAA,EAAAsI,EAAAxK,OAAAkC,IAAA,CACA,IAAAsF,EAAAgD,EAAAwI,WAAA9Q,GACAk8K,EAAA52K,GAAA,EACA62K,EAAA,IAAA72K,EACA42K,EACAt3K,EAAAjB,KAAAu4K,EAAAC,GAEAv3K,EAAAjB,KAAAw4K,GAGA,OAAAv3K,GAUAw0M,EAAA8Q,MAAAA,EAQA9Q,EAAAnrB,MAAAA,EAEAmrB,EAAAj9K,OAAA,SAAA1G,EAAA+/H,GACA,MAAA,QAAAA,EACAy4B,EAAAx4J,GAEAA,iCCxDA,IAAAoR,EASA,SAAAg1L,EAAAhS,GACAhxL,KAAAgxL,KAAAA,EAmBA,GA3BA39R,EAAAC,QAAA,SAAA8vG,GAIA,OAHA4K,IACAA,EAAA,IAAAg1L,EAAA,OAEAh1L,EAAAloB,SAAAsd,IAMA/vG,EAAAC,QAAA0vS,KAAAA,EAEAA,EAAArlM,UAAA7X,SAAA,SAAAsd,GACA,OAAApD,KAAAijM,MAAA7/L,IAIA4/L,EAAArlM,UAAAslM,MAAA,SAAAhvS,GACA,GAAA+rG,KAAAgxL,KAAA5vC,SACA,OAAAphJ,KAAAgxL,KAAA5vC,SAAAntP,GAGA,IADA,IAAA83E,EAAA,IAAA0sJ,WAAAxkO,GACAkzE,EAAA,EAAAA,EAAA4E,EAAA9G,OAAAkC,IACA4E,EAAA5E,GAAA64B,KAAAgxL,KAAA1iC,UACA,OAAAviL,GAGA,iBAAAuzB,KACAA,KAAA0uH,QAAA1uH,KAAA0uH,OAAA69C,gBAEAm3B,EAAArlM,UAAAslM,MAAA,SAAAhvS,GACA,IAAA2oG,EAAA,IAAA67H,WAAAxkO,GAEA,OADAqrG,KAAA0uH,OAAA69C,gBAAAjvK,GACAA,GAEA0C,KAAAysK,UAAAzsK,KAAAysK,SAAAF,gBAEAm3B,EAAArlM,UAAAslM,MAAA,SAAAhvS,GACA,IAAA2oG,EAAA,IAAA67H,WAAAxkO,GAEA,OADAqrG,KAAAysK,SAAAF,gBAAAjvK,GACAA,GAIA,iBAAA2C,SAEAyjM,EAAArlM,UAAAslM,MAAA,WACA,MAAA,IAAAnqM,MAAA,8BAKA,IACA,IAAAk1H,EAAAz6N,EAAA,UACA,GAAA,mBAAAy6N,EAAA+gD,YACA,MAAA,IAAAj2K,MAAA,iBAEAkqM,EAAArlM,UAAAslM,MAAA,SAAAhvS,GACA,OAAA+5N,EAAA+gD,YAAA96Q,IAEA,MAAAF,iDC9DA,aAEA,IAAA+5R,EAAAx6R,EAEAw6R,EAAA1tJ,KAAA7sI,EAAA,UACAu6R,EAAAoV,MAAA3vS,EAAA,WACAu6R,EAAAiV,KAAAxvS,EAAA,UACAu6R,EAAAqV,QAAA5vS,EAAA,kHCPA,aAEA,IAAAw6R,EAAAx6R,EAAA,SACAgtR,EAAAhtR,EAAA,YACA+9R,EAAA/Q,EAAA+Q,OACAM,EAAArR,EAAAqR,OACA/4L,EAAA0nL,EAAA1nL,OAEA,SAAAuqM,EAAAt8N,EAAAkqC,GACAhR,KAAAl5B,KAAAA,EACAk5B,KAAA94B,EAAA,IAAA6mN,EAAA/8K,EAAA9pC,EAAA,IAGA84B,KAAAkuL,IAAAl9K,EAAAod,MAAA2/J,EAAAG,IAAAl9K,EAAAod,OAAA2/J,EAAAgV,KAAA/iM,KAAA94B,GAGA84B,KAAAmqJ,KAAA,IAAA4jC,EAAA,GAAAE,MAAAjuL,KAAAkuL,KACAluL,KAAAyiM,IAAA,IAAA1U,EAAA,GAAAE,MAAAjuL,KAAAkuL,KACAluL,KAAAqjM,IAAA,IAAAtV,EAAA,GAAAE,MAAAjuL,KAAAkuL,KAGAluL,KAAA/rG,EAAA+8G,EAAA/8G,GAAA,IAAA85R,EAAA/8K,EAAA/8G,EAAA,IACA+rG,KAAAokH,EAAApzG,EAAAozG,GAAApkH,KAAAsjM,cAAAtyL,EAAAozG,EAAApzG,EAAAuyL,MAGAvjM,KAAAwjM,QAAA,IAAA3lM,MAAA,GACAmC,KAAAyjM,QAAA,IAAA5lM,MAAA,GACAmC,KAAA0jM,QAAA,IAAA7lM,MAAA,GACAmC,KAAA2jM,QAAA,IAAA9lM,MAAA,GAEAmC,KAAA4jM,WAAA5jM,KAAA/rG,EAAA+rG,KAAA/rG,EAAAg9Q,YAAA,EAGA,IAAA4yB,EAAA7jM,KAAA/rG,GAAA+rG,KAAA94B,EAAAosL,IAAAtzJ,KAAA/rG,IACA4vS,GAAAA,EAAA7R,KAAA,KAAA,EACAhyL,KAAA8jM,KAAA,MAEA9jM,KAAA+jM,eAAA,EACA/jM,KAAA8jM,KAAA9jM,KAAA/rG,EAAAg6R,MAAAjuL,KAAAkuL,MAwNA,SAAA8V,EAAAlW,EAAAhnN,GACAk5B,KAAA8tL,MAAAA,EACA9tL,KAAAl5B,KAAAA,EACAk5B,KAAAikM,YAAA,KAxNA5wS,EAAAC,QAAA8vS,EAEAA,EAAAzlM,UAAAqxL,MAAA,WACA,MAAA,IAAAl2L,MAAA,oBAGAsqM,EAAAzlM,UAAAs+H,SAAA,WACA,MAAA,IAAAnjI,MAAA,oBAGAsqM,EAAAzlM,UAAAumM,aAAA,SAAAh9N,EAAA7yE,GACAwkG,EAAA3xB,EAAA+8N,aACA,IAAAE,EAAAj9N,EAAAk9N,cAEA7S,EAAAD,EAAAj9R,EAAA,EAAA2rG,KAAA4jM,YACA3gF,GAAA,GAAAkhF,EAAAE,KAAA,IAAAF,EAAAE,KAAA,GAAA,EAAA,EAAA,GACAphF,GAAA,EAGA,IACA3xH,EACAgzM,EAFAC,EAAA,GAGA,IAAAjzM,EAAA,EAAAA,EAAAigM,EAAAtsN,OAAAqsB,GAAA6yM,EAAAE,KAAA,CACAC,EAAA,EACA,IAAA,IAAAv7M,EAAAuI,EAAA6yM,EAAAE,KAAA,EAAAt7M,GAAAuI,EAAAvI,IACAu7M,GAAAA,GAAA,GAAA/S,EAAAxoM,GACAw7M,EAAAz5N,KAAAw5N,GAKA,IAFA,IAAAz9N,EAAAm5B,KAAAwkM,OAAA,KAAA,KAAA,MACAlrN,EAAA0mB,KAAAwkM,OAAA,KAAA,KAAA,MACAr9N,EAAA87I,EAAA97I,EAAA,EAAAA,IAAA,CACA,IAAAmqB,EAAA,EAAAA,EAAAizM,EAAAt/N,OAAAqsB,KACAgzM,EAAAC,EAAAjzM,MACAnqB,EACAmS,EAAAA,EAAAmrN,SAAAN,EAAAO,OAAApzM,IACAgzM,KAAAn9N,IACAmS,EAAAA,EAAAmrN,SAAAN,EAAAO,OAAApzM,GAAAskM,QAEA/uN,EAAAA,EAAAmY,IAAA1F,GAEA,OAAAzS,EAAA89N,OAGAvB,EAAAzlM,UAAAinM,SAAA,SAAA19N,EAAA7yE,GACA,IAAAowN,EAAA,EAGAogF,EAAA39N,EAAA49N,cAAArgF,GACAA,EAAAogF,EAAAhC,IAQA,IAPA,IAAAA,EAAAgC,EAAAH,OAGAnT,EAAAD,EAAAj9R,EAAAowN,EAAAzkH,KAAA4jM,YAGAvtD,EAAAr2I,KAAAwkM,OAAA,KAAA,KAAA,MACAr9N,EAAAoqN,EAAAtsN,OAAA,EAAAkC,GAAA,EAAAA,IAAA,CAEA,IAAA,IAAA4hB,EAAA,EAAA5hB,GAAA,GAAA,IAAAoqN,EAAApqN,GAAAA,IACA4hB,IAKA,GAJA5hB,GAAA,GACA4hB,IACAstJ,EAAAA,EAAA0uD,KAAAh8M,GAEA5hB,EAAA,EACA,MACA,IAAAo+I,EAAAgsE,EAAApqN,GACA0xB,EAAA,IAAA0sH,GAIA8wB,EAHA,WAAAnvK,EAAAJ,KAEAy+I,EAAA,EACA8wB,EAAAouD,SAAA5B,EAAAt9E,EAAA,GAAA,IAEA8wB,EAAAouD,SAAA5B,GAAAt9E,EAAA,GAAA,GAAAqwE,OAGArwE,EAAA,EACA8wB,EAAAr3J,IAAA6jN,EAAAt9E,EAAA,GAAA,IAEA8wB,EAAAr3J,IAAA6jN,GAAAt9E,EAAA,GAAA,GAAAqwE,OAGA,MAAA,WAAA1uN,EAAAJ,KAAAuvK,EAAAsuD,MAAAtuD,GAGA+sD,EAAAzlM,UAAAqnM,YAAA,SAAAC,EACAP,EACAQ,EACA9hM,EACA+hM,GACA,IAMAh+N,EACAmqB,EACApqB,EARAk+N,EAAAplM,KAAAwjM,QACAX,EAAA7iM,KAAAyjM,QACAlS,EAAAvxL,KAAA0jM,QAGA/9N,EAAA,EAIA,IAAAwB,EAAA,EAAAA,EAAAi8B,EAAAj8B,IAAA,CAEA,IAAA09N,GADA39N,EAAAw9N,EAAAv9N,IACA29N,cAAAG,GACAG,EAAAj+N,GAAA09N,EAAAhC,IACAA,EAAA17N,GAAA09N,EAAAH,OAIA,IAAAv9N,EAAAi8B,EAAA,EAAAj8B,GAAA,EAAAA,GAAA,EAAA,CACA,IAAAN,EAAAM,EAAA,EACAmS,EAAAnS,EACA,GAAA,IAAAi+N,EAAAv+N,IAAA,IAAAu+N,EAAA9rN,GAAA,CAQA,IAAA+rN,EAAA,CACAX,EAAA79N,GACA,KACA,KACA69N,EAAAprN,IAIA,IAAAorN,EAAA79N,GAAAgnC,EAAA1G,IAAAu9L,EAAAprN,GAAAu0B,IACAw3L,EAAA,GAAAX,EAAA79N,GAAAmY,IAAA0lN,EAAAprN,IACA+rN,EAAA,GAAAX,EAAA79N,GAAAy+N,MAAAb,SAAAC,EAAAprN,GAAAs8M,QACA,IAAA8O,EAAA79N,GAAAgnC,EAAA1G,IAAAu9L,EAAAprN,GAAAu0B,EAAA2gL,WACA6W,EAAA,GAAAX,EAAA79N,GAAAy+N,MAAAb,SAAAC,EAAAprN,IACA+rN,EAAA,GAAAX,EAAA79N,GAAAmY,IAAA0lN,EAAAprN,GAAAs8M,SAEAyP,EAAA,GAAAX,EAAA79N,GAAAy+N,MAAAb,SAAAC,EAAAprN,IACA+rN,EAAA,GAAAX,EAAA79N,GAAAy+N,MAAAb,SAAAC,EAAAprN,GAAAs8M,QAGA,IAAArwN,EAAA,EACA,GACA,GACA,GACA,EACA,EACA,EACA,EACA,EACA,GAGAusN,EAAAF,EAAAsT,EAAAr+N,GAAAq+N,EAAA5rN,IAIA,IAHA3T,EAAAC,KAAAD,IAAAmsN,EAAA,GAAA7sN,OAAAU,GACA4rN,EAAA1qN,GAAA,IAAAg3B,MAAAl4B,GACA4rN,EAAAj4M,GAAA,IAAAukB,MAAAl4B,GACA2rB,EAAA,EAAAA,EAAA3rB,EAAA2rB,IAAA,CACA,IAAAi0M,EAAA,EAAAzT,EAAA,GAAAxgM,GACAk0M,EAAA,EAAA1T,EAAA,GAAAxgM,GAEAigM,EAAA1qN,GAAAyqB,GAAA/rB,EAAA,GAAAggO,EAAA,IAAAC,EAAA,IACAjU,EAAAj4M,GAAAgY,GAAA,EACAuxM,EAAAh8N,GAAAw+N,QAhDA9T,EAAA1qN,GAAAyqN,EAAA4T,EAAAr+N,GAAAu+N,EAAAv+N,GAAAm5B,KAAA4jM,YACArS,EAAAj4M,GAAAg4M,EAAA4T,EAAA5rN,GAAA8rN,EAAA9rN,GAAA0mB,KAAA4jM,YACAj+N,EAAAC,KAAAD,IAAA4rN,EAAA1qN,GAAA5B,OAAAU,GACAA,EAAAC,KAAAD,IAAA4rN,EAAAj4M,GAAArU,OAAAU,GAiDA,IAAA0wK,EAAAr2I,KAAAwkM,OAAA,KAAA,KAAA,MACAppM,EAAA4E,KAAA2jM,QACA,IAAAx8N,EAAAxB,EAAAwB,GAAA,EAAAA,IAAA,CAGA,IAFA,IAAA9yE,EAAA,EAEA8yE,GAAA,GAAA,CACA,IAAAgjL,GAAA,EACA,IAAA74J,EAAA,EAAAA,EAAA8R,EAAA9R,IACA8J,EAAA9J,GAAA,EAAAigM,EAAAjgM,GAAAnqB,GACA,IAAAi0B,EAAA9J,KACA64J,GAAA,GAEA,IAAAA,EACA,MACA91P,IACA8yE,IAKA,GAHAA,GAAA,GACA9yE,IACAgiP,EAAAA,EAAA0uD,KAAA1wS,GACA8yE,EAAA,EACA,MAEA,IAAAmqB,EAAA,EAAAA,EAAA8R,EAAA9R,IAAA,CACA,IAAAi0H,EAAAnqH,EAAA9J,GAEA,IAAAi0H,IAEAA,EAAA,EACAr+I,EAAA27N,EAAAvxM,GAAAi0H,EAAA,GAAA,GACAA,EAAA,IACAr+I,EAAA27N,EAAAvxM,IAAAi0H,EAAA,GAAA,GAAAqwE,OAGAv/C,EADA,WAAAnvK,EAAAJ,KACAuvK,EAAAouD,SAAAv9N,GAEAmvK,EAAAr3J,IAAA9X,KAIA,IAAAC,EAAA,EAAAA,EAAAi8B,EAAAj8B,IACA07N,EAAA17N,GAAA,KAEA,OAAAg+N,EACA9uD,EAEAA,EAAAsuD,OAQAvB,EAAAY,UAAAA,EAEAA,EAAArmM,UAAA4V,GAAA,WACA,MAAA,IAAAza,MAAA,oBAGAkrM,EAAArmM,UAAAs+H,SAAA,WACA,OAAAj8H,KAAA8tL,MAAA7xD,SAAAj8H,OAGAojM,EAAAzlM,UAAA8nM,YAAA,SAAA9sE,EAAAgE,GACAhE,EAAA4nD,EAAAp9K,QAAAw1H,EAAAgE,GAEA,IAAAv5H,EAAApD,KAAA94B,EAAAk3J,aAGA,IAAA,IAAAzF,EAAA,IAAA,IAAAA,EAAA,IAAA,IAAAA,EAAA,KACAA,EAAA1zJ,OAAA,GAAA,EAAAm+B,EASA,OARA,IAAAu1H,EAAA,GACA9/H,EAAA8/H,EAAAA,EAAA1zJ,OAAA,GAAA,GAAA,GACA,IAAA0zJ,EAAA,IACA9/H,EAAA8/H,EAAAA,EAAA1zJ,OAAA,GAAA,GAAA,GAEA+6B,KAAAgvL,MAAAr2D,EAAAvzJ,MAAA,EAAA,EAAAg+B,GACAu1H,EAAAvzJ,MAAA,EAAAg+B,EAAA,EAAA,EAAAA,IAGA,IAAA,IAAAu1H,EAAA,IAAA,IAAAA,EAAA,KACAA,EAAA1zJ,OAAA,IAAAm+B,EACA,OAAApD,KAAA0lM,WAAA/sE,EAAAvzJ,MAAA,EAAA,EAAAg+B,GAAA,IAAAu1H,EAAA,IAEA,MAAA,IAAA7/H,MAAA,yBAGAkrM,EAAArmM,UAAAgoM,iBAAA,SAAAhpE,GACA,OAAA38H,KAAAsD,OAAAq5H,GAAA,IAGAqnE,EAAArmM,UAAAioM,QAAA,SAAA1wC,GACA,IAAA9xJ,EAAApD,KAAA8tL,MAAA5mN,EAAAk3J,aACAxwH,EAAA5N,KAAA6wL,OAAA1tL,QAAA,KAAAC,GAEA,OAAA8xJ,EACA,CAAAl1J,KAAA8wL,OAAA3V,SAAA,EAAA,GAAAtpL,OAAA+b,GAEA,CAAA,GAAA/b,OAAA+b,EAAA5N,KAAA8wL,OAAA3tL,QAAA,KAAAC,KAGA4gM,EAAArmM,UAAA2F,OAAA,SAAAq5H,EAAAu4B,GACA,OAAAqrB,EAAAj9K,OAAAtD,KAAA4lM,QAAA1wC,GAAAv4B,IAGAqnE,EAAArmM,UAAAkoM,WAAA,SAAAC,GACA,GAAA9lM,KAAAikM,YACA,OAAAjkM,KAEA,IAAAikM,EAAA,CACAE,QAAA,KACA5S,IAAA,KACAlmK,KAAA,MAOA,OALA44K,EAAA1S,IAAAvxL,KAAA8kM,cAAA,GACAb,EAAAE,QAAAnkM,KAAAokM,YAAA,EAAA0B,GACA7B,EAAA54K,KAAArrB,KAAA+lM,WACA/lM,KAAAikM,YAAAA,EAEAjkM,MAGAgkM,EAAArmM,UAAAqoM,YAAA,SAAA3xS,GACA,IAAA2rG,KAAAikM,YACA,OAAA,EAEA,IAAAE,EAAAnkM,KAAAikM,YAAAE,QACA,QAAAA,GAGAA,EAAAO,OAAAz/N,QAAAW,KAAAwhL,MAAA/yP,EAAA48Q,YAAA,GAAAkzB,EAAAE,OAGAL,EAAArmM,UAAAymM,YAAA,SAAAC,EAAAyB,GACA,GAAA9lM,KAAAikM,aAAAjkM,KAAAikM,YAAAE,QACA,OAAAnkM,KAAAikM,YAAAE,QAIA,IAFA,IAAAA,EAAA,CAAAnkM,MACAq2I,EAAAr2I,KACA74B,EAAA,EAAAA,EAAA2+N,EAAA3+N,GAAAk9N,EAAA,CACA,IAAA,IAAA/yM,EAAA,EAAAA,EAAA+yM,EAAA/yM,IACA+kJ,EAAAA,EAAA4vD,MACA9B,EAAAr5N,KAAAurK,GAEA,MAAA,CACAguD,KAAAA,EACAK,OAAAP,IAIAH,EAAArmM,UAAAmnM,cAAA,SAAAjC,GACA,GAAA7iM,KAAAikM,aAAAjkM,KAAAikM,YAAA1S,IACA,OAAAvxL,KAAAikM,YAAA1S,IAKA,IAHA,IAAAxlN,EAAA,CAAAi0B,MACAr6B,GAAA,GAAAk9N,GAAA,EACAoD,EAAA,IAAAtgO,EAAA,KAAAq6B,KAAAimM,MACA9+N,EAAA,EAAAA,EAAAxB,EAAAwB,IACA4E,EAAA5E,GAAA4E,EAAA5E,EAAA,GAAA6X,IAAAinN,GACA,MAAA,CACApD,IAAAA,EACA6B,OAAA34N,IAIAi4N,EAAArmM,UAAAooM,SAAA,WACA,OAAA,MAGA/B,EAAArmM,UAAAonM,KAAA,SAAA1wS,GAEA,IADA,IAAA25G,EAAAhO,KACA74B,EAAA,EAAAA,EAAA9yE,EAAA8yE,IACA6mC,EAAAA,EAAAi4L,MACA,OAAAj4L,mEC3XA,aAEA,IAAAuyK,EAAAhtR,EAAA,YACAw6R,EAAAx6R,EAAA,SACAk/R,EAAAl/R,EAAA,YACAwpO,EAAAxpO,EAAA,UAEAslG,EAAA0nL,EAAA1nL,OAEA,SAAAqtM,EAAAl1L,GACA+rH,EAAAn/H,KAAAoC,KAAA,QAAAgR,GAEAhR,KAAAn5B,EAAA,IAAAknN,EAAA/8K,EAAAnqC,EAAA,IAAAonN,MAAAjuL,KAAAkuL,KACAluL,KAAA1mB,EAAA,IAAAy0M,EAAA/8K,EAAA13B,EAAA,IAAA20M,MAAAjuL,KAAAkuL,KACAluL,KAAAmmM,KAAAnmM,KAAAqjM,IAAApC,UAEAjhM,KAAAomM,MAAA,IAAApmM,KAAAn5B,EAAAw5N,UAAArO,KAAA,GACAhyL,KAAAqmM,OAAA,IAAArmM,KAAAn5B,EAAAw5N,UAAA/uK,IAAAtxB,KAAA94B,GAAA8qN,MAAA,GAGAhyL,KAAAsmM,KAAAtmM,KAAAumM,iBAAAv1L,GACAhR,KAAAwmM,YAAA,IAAA3oM,MAAA,GACAmC,KAAAymM,YAAA,IAAA5oM,MAAA,GAoOA,SAAA6oM,EAAA5Y,EAAAlgL,EAAAC,EAAA84L,GACA5pE,EAAAinE,UAAApmM,KAAAoC,KAAA8tL,EAAA,UACA,OAAAlgL,GAAA,OAAAC,GACA7N,KAAA4N,EAAA,KACA5N,KAAA6N,EAAA,KACA7N,KAAA4mM,KAAA,IAEA5mM,KAAA4N,EAAA,IAAAmgL,EAAAngL,EAAA,IACA5N,KAAA6N,EAAA,IAAAkgL,EAAAlgL,EAAA,IAEA84L,IACA3mM,KAAA4N,EAAA2yL,SAAAvgM,KAAA8tL,MAAAI,KACAluL,KAAA6N,EAAA0yL,SAAAvgM,KAAA8tL,MAAAI,MAEAluL,KAAA4N,EAAAsgL,MACAluL,KAAA4N,EAAA5N,KAAA4N,EAAAqgL,MAAAjuL,KAAA8tL,MAAAI,MACAluL,KAAA6N,EAAAqgL,MACAluL,KAAA6N,EAAA7N,KAAA6N,EAAAogL,MAAAjuL,KAAA8tL,MAAAI,MACAluL,KAAA4mM,KAAA,GA6NA,SAAAC,EAAA/Y,EAAAlgL,EAAAC,EAAA03G,GACAwX,EAAAinE,UAAApmM,KAAAoC,KAAA8tL,EAAA,YACA,OAAAlgL,GAAA,OAAAC,GAAA,OAAA03G,GACAvlH,KAAA4N,EAAA5N,KAAA8tL,MAAA2U,IACAziM,KAAA6N,EAAA7N,KAAA8tL,MAAA2U,IACAziM,KAAAulH,EAAA,IAAAwoE,EAAA,KAEA/tL,KAAA4N,EAAA,IAAAmgL,EAAAngL,EAAA,IACA5N,KAAA6N,EAAA,IAAAkgL,EAAAlgL,EAAA,IACA7N,KAAAulH,EAAA,IAAAwoE,EAAAxoE,EAAA,KAEAvlH,KAAA4N,EAAAsgL,MACAluL,KAAA4N,EAAA5N,KAAA4N,EAAAqgL,MAAAjuL,KAAA8tL,MAAAI,MACAluL,KAAA6N,EAAAqgL,MACAluL,KAAA6N,EAAA7N,KAAA6N,EAAAogL,MAAAjuL,KAAA8tL,MAAAI,MACAluL,KAAAulH,EAAA2oE,MACAluL,KAAAulH,EAAAvlH,KAAAulH,EAAA0oE,MAAAjuL,KAAA8tL,MAAAI,MAEAluL,KAAA8mM,KAAA9mM,KAAAulH,IAAAvlH,KAAA8tL,MAAA2U,IAneAhQ,EAAAyT,EAAAnpE,GACA1pO,EAAAC,QAAA4yS,EAEAA,EAAAvoM,UAAA4oM,iBAAA,SAAAv1L,GAEA,GAAAhR,KAAAomM,OAAApmM,KAAAokH,GAAApkH,KAAA/rG,GAAA,IAAA+rG,KAAA94B,EAAAwtN,KAAA,GAAA,CAIA,IAAArpK,EACAS,EACA,GAAA9a,EAAAqa,KACAA,EAAA,IAAA0iK,EAAA/8K,EAAAqa,KAAA,IAAA4iK,MAAAjuL,KAAAkuL,SACA,CACA,IAAA6Y,EAAA/mM,KAAAgnM,cAAAhnM,KAAA94B,GAGAmkD,GADAA,EAAA07K,EAAA,GAAA5/L,IAAA4/L,EAAA,IAAA,EAAAA,EAAA,GAAAA,EAAA,IACA9Y,MAAAjuL,KAAAkuL,KAEA,GAAAl9K,EAAA8a,OACAA,EAAA,IAAAiiK,EAAA/8K,EAAA8a,OAAA,QACA,CAEA,IAAAm7K,EAAAjnM,KAAAgnM,cAAAhnM,KAAA/rG,GACA,IAAA+rG,KAAAokH,EAAAwrE,IAAAqX,EAAA,IAAAr5L,EAAAzG,IAAAnH,KAAAokH,EAAAx2G,EAAAgzL,OAAAv1K,IACAS,EAAAm7K,EAAA,IAEAn7K,EAAAm7K,EAAA,GACApuM,EAAA,IAAAmH,KAAAokH,EAAAwrE,IAAA9jK,GAAAle,EAAAzG,IAAAnH,KAAAokH,EAAAx2G,EAAAgzL,OAAAv1K,MAiBA,MAAA,CACAA,KAAAA,EACAS,OAAAA,EACAo7K,MAdAl2L,EAAAk2L,MACAl2L,EAAAk2L,MAAA98N,KAAA,SAAA+8N,GACA,MAAA,CACAtgO,EAAA,IAAAknN,EAAAoZ,EAAAtgO,EAAA,IACAyS,EAAA,IAAAy0M,EAAAoZ,EAAA7tN,EAAA,QAIA0mB,KAAAonM,cAAAt7K,MAUAo6K,EAAAvoM,UAAAqpM,cAAA,SAAAt1L,GAIA,IAAAw8K,EAAAx8K,IAAA1R,KAAA94B,EAAA84B,KAAAkuL,IAAAH,EAAAgV,KAAArxL,GACAy0L,EAAA,IAAApY,EAAA,GAAAE,MAAAC,GAAA+S,UACAoG,EAAAlB,EAAA3X,SAEAtyM,EAAA,IAAA6xM,EAAA,GAAAE,MAAAC,GAAAM,SAAAF,UAAAsS,OAAAuF,GAIA,MAAA,CAFAkB,EAAA7G,OAAAtkN,GAAAmkN,UACAgH,EAAA5G,OAAAvkN,GAAAmkN,YAIA6F,EAAAvoM,UAAAypM,cAAA,SAAAt7K,GA2BA,IAzBA,IAYA8qK,EACA/N,EAEAkO,EACAtoC,EAEAqV,EACAzV,EAEAi5C,EAEAt5L,EACAJ,EAxBA25L,EAAAvnM,KAAA/rG,EAAAiqS,MAAAt4N,KAAA6nC,MAAAzN,KAAA/rG,EAAAg9Q,YAAA,IAIA/8E,EAAApoE,EACAg5C,EAAA9kE,KAAA/rG,EAAAohI,QACAiqK,EAAA,IAAAvR,EAAA,GACAyZ,EAAA,IAAAzZ,EAAA,GACAwR,EAAA,IAAAxR,EAAA,GACA0Z,EAAA,IAAA1Z,EAAA,GAaA5mN,EAAA,EAGA,IAAA+sH,EAAA89F,KAAA,IAAA,CACA,IAAA1jL,EAAAw2D,EAAAwuF,IAAAp/D,GACAlmF,EAAA82D,EAAAxzC,IAAAhjB,EAAAshL,IAAA17F,IACAtmF,EAAA2xL,EAAAjuK,IAAAhjB,EAAAshL,IAAA0P,IACA,IAAAzxL,EAAA45L,EAAAn2K,IAAAhjB,EAAAshL,IAAA4X,IAEA,IAAAzQ,GAAA/oL,EAAA7G,IAAAogM,GAAA,EACA3Q,EAAA0Q,EAAA1R,MACA/M,EAAAyW,EACAvI,EAAA/oL,EAAA4nL,MACAnnC,EAAA7gJ,OACA,GAAAmpL,GAAA,KAAA5vN,EACA,MAEAmgO,EAAAt5L,EAEA82D,EAAAovB,EACAA,EAAAlmF,EACAuxL,EAAAD,EACAA,EAAA1xL,EACA65L,EAAAD,EACAA,EAAA35L,EAEAi2J,EAAA91J,EAAA4nL,MACAvnC,EAAAzgJ,EAEA,IAAA85L,EAAA3Q,EAAAqG,MAAAp+M,IAAAyvK,EAAA2uC,OAiBA,OAhBAt5B,EAAAs5B,MAAAp+M,IAAAqvK,EAAA+uC,OACAj2L,IAAAugM,IAAA,IACA5jC,EAAA8yB,EACAvoC,EAAAw6B,GAIAkO,EAAAhE,WACAgE,EAAAA,EAAAnB,MACAnnC,EAAAA,EAAAmnC,OAEA9xB,EAAAivB,WACAjvB,EAAAA,EAAA8xB,MACAvnC,EAAAA,EAAAunC,OAGA,CACA,CAAA/uN,EAAAkwN,EAAAz9M,EAAAm1K,GACA,CAAA5nL,EAAAi9L,EAAAxqL,EAAA+0K,KAIA63C,EAAAvoM,UAAAgqM,WAAA,SAAAtzS,GACA,IAAA6yS,EAAAlnM,KAAAsmM,KAAAY,MACAU,EAAAV,EAAA,GACAW,EAAAX,EAAA,GAEAlyG,EAAA6yG,EAAAvuN,EAAAs2M,IAAAv7R,GAAA0qS,SAAA/+L,KAAA/rG,GACAihM,EAAA0yG,EAAAtuN,EAAAs8M,MAAAhG,IAAAv7R,GAAA0qS,SAAA/+L,KAAA/rG,GAEAmnF,EAAA45G,EAAA46F,IAAAgY,EAAA/gO,GACAihO,EAAA5yG,EAAA06F,IAAAiY,EAAAhhO,GACA0rM,EAAAv9E,EAAA46F,IAAAgY,EAAAtuN,GACAyuN,EAAA7yG,EAAA06F,IAAAiY,EAAAvuN,GAKA,MAAA,CAAA0jM,GAFA3oR,EAAAi9H,IAAAl2C,GAAAk2C,IAAAw2K,GAEAjW,GADAtf,EAAAvzL,IAAA+oN,GAAAnS,QAIAsQ,EAAAvoM,UAAA+nM,WAAA,SAAA93L,EAAA0uL,IACA1uL,EAAA,IAAAmgL,EAAAngL,EAAA,KACAsgL,MACAtgL,EAAAA,EAAAqgL,MAAAjuL,KAAAkuL,MAEA,IAAAuZ,EAAA75L,EAAAugL,SAAAyS,OAAAhzL,GAAAygL,QAAAzgL,EAAAgzL,OAAA5gM,KAAAn5B,IAAAwnN,QAAAruL,KAAA1mB,GACAu0B,EAAA45L,EAAAnZ,UACA,GAAA,IAAAzgL,EAAAsgL,SAAAsS,OAAAgH,GAAAtgM,IAAAnH,KAAAmqJ,MACA,MAAA,IAAArxJ,MAAA,iBAIA,IAAAy1L,EAAA1gL,EAAAwyL,UAAA9R,QAIA,OAHA+N,IAAA/N,IAAA+N,GAAA/N,KACA1gL,EAAAA,EAAA2gL,UAEAxuL,KAAAgvL,MAAAphL,EAAAC,IAGAq4L,EAAAvoM,UAAAs+H,SAAA,SAAA+yD,GACA,GAAAA,EAAA4X,IACA,OAAA,EAEA,IAAAh5L,EAAAohL,EAAAphL,EACAC,EAAAmhL,EAAAnhL,EAEAm6L,EAAAhoM,KAAAn5B,EAAA+5N,OAAAhzL,GACAq6L,EAAAr6L,EAAAugL,SAAAyS,OAAAhzL,GAAAygL,QAAA2Z,GAAA3Z,QAAAruL,KAAA1mB,GACA,OAAA,IAAAu0B,EAAAsgL,SAAAS,QAAAqZ,GAAAjW,KAAA,IAGAkU,EAAAvoM,UAAAuqM,gBACA,SAAAxD,EAAAQ,EAAAC,GAGA,IAFA,IAAAgD,EAAAnoM,KAAAwmM,YACA4B,EAAApoM,KAAAymM,YACAt/N,EAAA,EAAAA,EAAAu9N,EAAAz/N,OAAAkC,IAAA,CACA,IAAA2Y,EAAAkgB,KAAA2nM,WAAAzC,EAAA/9N,IACAD,EAAAw9N,EAAAv9N,GACAkkD,EAAAnkD,EAAA6+N,WAEAjmN,EAAAk9L,GAAA+V,WACAjzM,EAAAk9L,GAAA0Y,OACAxuN,EAAAA,EAAA0uN,KAAA,IAEA91M,EAAA+xM,GAAAkB,WACAjzM,EAAA+xM,GAAA6D,OACArqK,EAAAA,EAAAuqK,KAAA,IAGAuS,EAAA,EAAAhhO,GAAAD,EACAihO,EAAA,EAAAhhO,EAAA,GAAAkkD,EACA+8K,EAAA,EAAAjhO,GAAA2Y,EAAAk9L,GACAorB,EAAA,EAAAjhO,EAAA,GAAA2Y,EAAA+xM,GAKA,IAHA,IAAA9lN,EAAAi0B,KAAAglM,YAAA,EAAAmD,EAAAC,EAAA,EAAAjhO,EAAAg+N,GAGA7zM,EAAA,EAAAA,EAAA,EAAAnqB,EAAAmqB,IACA62M,EAAA72M,GAAA,KACA82M,EAAA92M,GAAA,KAEA,OAAAvlB,GAwBA0mN,EAAAiU,EAAA3pE,EAAAinE,WAEAkC,EAAAvoM,UAAAqxL,MAAA,SAAAphL,EAAAC,EAAA84L,GACA,OAAA,IAAAD,EAAA1mM,KAAA4N,EAAAC,EAAA84L,IAGAT,EAAAvoM,UAAA2lM,cAAA,SAAAzkM,EAAAqvL,GACA,OAAAwY,EAAA2B,SAAAroM,KAAAnB,EAAAqvL,IAGAwY,EAAA/oM,UAAAooM,SAAA,WACA,GAAA/lM,KAAA8tL,MAAAwY,KAAA,CAGA,IAAAgC,EAAAtoM,KAAAikM,YACA,GAAAqE,GAAAA,EAAAj9K,KACA,OAAAi9K,EAAAj9K,KAEA,IAAAA,EAAArrB,KAAA8tL,MAAAkB,MAAAhvL,KAAA4N,EAAAgzL,OAAA5gM,KAAA8tL,MAAAwY,KAAAj7K,MAAArrB,KAAA6N,GACA,GAAAy6L,EAAA,CACA,IAAAxa,EAAA9tL,KAAA8tL,MACAya,EAAA,SAAArhO,GACA,OAAA4mN,EAAAkB,MAAA9nN,EAAA0mC,EAAAgzL,OAAA9S,EAAAwY,KAAAj7K,MAAAnkD,EAAA2mC,IAEAy6L,EAAAj9K,KAAAA,EACAA,EAAA44K,YAAA,CACA54K,KAAA,KACAkmK,IAAA+W,EAAA/W,KAAA,CACAsR,IAAAyF,EAAA/W,IAAAsR,IACA6B,OAAA4D,EAAA/W,IAAAmT,OAAAt6N,IAAAm+N,IAEApE,QAAAmE,EAAAnE,SAAA,CACAE,KAAAiE,EAAAnE,QAAAE,KACAK,OAAA4D,EAAAnE,QAAAO,OAAAt6N,IAAAm+N,KAIA,OAAAl9K,IAGAq7K,EAAA/oM,UAAAvW,OAAA,WACA,OAAA4Y,KAAAikM,YAGA,CAAAjkM,KAAA4N,EAAA5N,KAAA6N,EAAA7N,KAAAikM,aAAA,CACAE,QAAAnkM,KAAAikM,YAAAE,SAAA,CACAE,KAAArkM,KAAAikM,YAAAE,QAAAE,KACAK,OAAA1kM,KAAAikM,YAAAE,QAAAO,OAAAt/N,MAAA,IAEAmsN,IAAAvxL,KAAAikM,YAAA1S,KAAA,CACAsR,IAAA7iM,KAAAikM,YAAA1S,IAAAsR,IACA6B,OAAA1kM,KAAAikM,YAAA1S,IAAAmT,OAAAt/N,MAAA,MATA,CAAA46B,KAAA4N,EAAA5N,KAAA6N,IAcA64L,EAAA2B,SAAA,SAAAva,EAAAjvL,EAAAqvL,GACA,iBAAArvL,IACAA,EAAAh3B,KAAAoH,MAAA4vB,IACA,IAAA9yB,EAAA+hN,EAAAkB,MAAAnwL,EAAA,GAAAA,EAAA,GAAAqvL,GACA,IAAArvL,EAAA,GACA,OAAA9yB,EAEA,SAAAy8N,EAAA3pM,GACA,OAAAivL,EAAAkB,MAAAnwL,EAAA,GAAAA,EAAA,GAAAqvL,GAGA,IAAAoa,EAAAzpM,EAAA,GAYA,OAXA9yB,EAAAk4N,YAAA,CACA54K,KAAA,KACA84K,QAAAmE,EAAAnE,SAAA,CACAE,KAAAiE,EAAAnE,QAAAE,KACAK,OAAA,CAAA34N,GAAA8lB,OAAAy2M,EAAAnE,QAAAO,OAAAt6N,IAAAo+N,KAEAjX,IAAA+W,EAAA/W,KAAA,CACAsR,IAAAyF,EAAA/W,IAAAsR,IACA6B,OAAA,CAAA34N,GAAA8lB,OAAAy2M,EAAA/W,IAAAmT,OAAAt6N,IAAAo+N,MAGAz8N,GAGA26N,EAAA/oM,UAAAs2L,QAAA,WACA,OAAAj0L,KAAA2vL,aACA,sBACA,gBAAA3vL,KAAA4N,EAAAyyL,UAAAjiM,SAAA,GAAA,GACA,OAAA4B,KAAA6N,EAAAwyL,UAAAjiM,SAAA,GAAA,GAAA,KAGAsoM,EAAA/oM,UAAAgyL,WAAA,WACA,OAAA3vL,KAAA4mM,KAGAF,EAAA/oM,UAAA3e,IAAA,SAAA9X,GAEA,GAAA84B,KAAA4mM,IACA,OAAA1/N,EAGA,GAAAA,EAAA0/N,IACA,OAAA5mM,KAGA,GAAAA,KAAAuT,GAAArsC,GACA,OAAA84B,KAAAimM,MAGA,GAAAjmM,KAAA41L,MAAAriL,GAAArsC,GACA,OAAA84B,KAAA8tL,MAAAkB,MAAA,KAAA,MAGA,GAAA,IAAAhvL,KAAA4N,EAAAzG,IAAAjgC,EAAA0mC,GACA,OAAA5N,KAAA8tL,MAAAkB,MAAA,KAAA,MAEA,IAAAviN,EAAAuzB,KAAA6N,EAAA4yL,OAAAv5N,EAAA2mC,GACA,IAAAphC,EAAAulN,KAAA,KACAvlN,EAAAA,EAAAm0N,OAAA5gM,KAAA4N,EAAA6yL,OAAAv5N,EAAA0mC,GAAAqzL,YACA,IAAAwH,EAAAh8N,EAAA0hN,SAAAS,QAAA5uL,KAAA4N,GAAAghL,QAAA1nN,EAAA0mC,GACA86L,EAAAj8N,EAAAm0N,OAAA5gM,KAAA4N,EAAA6yL,OAAAgI,IAAA7Z,QAAA5uL,KAAA6N,GACA,OAAA7N,KAAA8tL,MAAAkB,MAAAyZ,EAAAC,IAGAhC,EAAA/oM,UAAAsoM,IAAA,WACA,GAAAjmM,KAAA4mM,IACA,OAAA5mM,KAGA,IAAA2oM,EAAA3oM,KAAA6N,EAAA2yL,OAAAxgM,KAAA6N,GACA,GAAA,IAAA86L,EAAA3W,KAAA,GACA,OAAAhyL,KAAA8tL,MAAAkB,MAAA,KAAA,MAEA,IAAAnoN,EAAAm5B,KAAA8tL,MAAAjnN,EAEA04N,EAAAv/L,KAAA4N,EAAAugL,SACAya,EAAAD,EAAA1H,UACAx0N,EAAA8yN,EAAAiB,OAAAjB,GAAAlR,QAAAkR,GAAAlR,QAAAxnN,GAAA+5N,OAAAgI,GAEAH,EAAAh8N,EAAA0hN,SAAAS,QAAA5uL,KAAA4N,EAAA4yL,OAAAxgM,KAAA4N,IACA86L,EAAAj8N,EAAAm0N,OAAA5gM,KAAA4N,EAAA6yL,OAAAgI,IAAA7Z,QAAA5uL,KAAA6N,GACA,OAAA7N,KAAA8tL,MAAAkB,MAAAyZ,EAAAC,IAGAhC,EAAA/oM,UAAAkzL,KAAA,WACA,OAAA7wL,KAAA4N,EAAAyyL,WAGAqG,EAAA/oM,UAAAmzL,KAAA,WACA,OAAA9wL,KAAA6N,EAAAwyL,WAGAqG,EAAA/oM,UAAAiyL,IAAA,SAAAv7R,GAEA,OADAA,EAAA,IAAA05R,EAAA15R,EAAA,IACA2rG,KAAA2vL,aACA3vL,KACAA,KAAAgmM,YAAA3xS,GACA2rG,KAAA8tL,MAAAoW,aAAAlkM,KAAA3rG,GACA2rG,KAAA8tL,MAAAwY,KACAtmM,KAAA8tL,MAAAoa,gBAAA,CAAAloM,MAAA,CAAA3rG,IAEA2rG,KAAA8tL,MAAA8W,SAAA5kM,KAAA3rG,IAGAqyS,EAAA/oM,UAAAkrM,OAAA,SAAA7rB,EAAA8qB,EAAAjW,GACA,IAAA6S,EAAA,CAAA1kM,KAAA8nM,GACA5C,EAAA,CAAAloB,EAAA6U,GACA,OAAA7xL,KAAA8tL,MAAAwY,KACAtmM,KAAA8tL,MAAAoa,gBAAAxD,EAAAQ,GAEAllM,KAAA8tL,MAAAkX,YAAA,EAAAN,EAAAQ,EAAA,IAGAwB,EAAA/oM,UAAAmrM,QAAA,SAAA9rB,EAAA8qB,EAAAjW,GACA,IAAA6S,EAAA,CAAA1kM,KAAA8nM,GACA5C,EAAA,CAAAloB,EAAA6U,GACA,OAAA7xL,KAAA8tL,MAAAwY,KACAtmM,KAAA8tL,MAAAoa,gBAAAxD,EAAAQ,GAAA,GAEAllM,KAAA8tL,MAAAkX,YAAA,EAAAN,EAAAQ,EAAA,GAAA,IAGAwB,EAAA/oM,UAAA4V,GAAA,SAAArsC,GACA,OAAA84B,OAAA94B,GACA84B,KAAA4mM,MAAA1/N,EAAA0/N,MACA5mM,KAAA4mM,KAAA,IAAA5mM,KAAA4N,EAAAzG,IAAAjgC,EAAA0mC,IAAA,IAAA5N,KAAA6N,EAAA1G,IAAAjgC,EAAA2mC,KAGA64L,EAAA/oM,UAAAi4L,IAAA,SAAAmT,GACA,GAAA/oM,KAAA4mM,IACA,OAAA5mM,KAEA,IAAAj0B,EAAAi0B,KAAA8tL,MAAAkB,MAAAhvL,KAAA4N,EAAA5N,KAAA6N,EAAA2gL,UACA,GAAAua,GAAA/oM,KAAAikM,YAAA,CACA,IAAAqE,EAAAtoM,KAAAikM,YACA7oB,EAAA,SAAAl0M,GACA,OAAAA,EAAA0uN,OAEA7pN,EAAAk4N,YAAA,CACA1S,IAAA+W,EAAA/W,KAAA,CACAsR,IAAAyF,EAAA/W,IAAAsR,IACA6B,OAAA4D,EAAA/W,IAAAmT,OAAAt6N,IAAAgxM,IAEA+oB,QAAAmE,EAAAnE,SAAA,CACAE,KAAAiE,EAAAnE,QAAAE,KACAK,OAAA4D,EAAAnE,QAAAO,OAAAt6N,IAAAgxM,KAIA,OAAArvM,GAGA26N,EAAA/oM,UAAA2nM,IAAA,WACA,OAAAtlM,KAAA4mM,IACA5mM,KAAA8tL,MAAA0W,OAAA,KAAA,KAAA,MAEAxkM,KAAA8tL,MAAA0W,OAAAxkM,KAAA4N,EAAA5N,KAAA6N,EAAA7N,KAAA8tL,MAAA2U,MAwBAhQ,EAAAoU,EAAA9pE,EAAAinE,WAEAkC,EAAAvoM,UAAA6mM,OAAA,SAAA52L,EAAAC,EAAA03G,GACA,OAAA,IAAAshF,EAAA7mM,KAAA4N,EAAAC,EAAA03G,IAGAshF,EAAAlpM,UAAAgnM,IAAA,WACA,GAAA3kM,KAAA2vL,aACA,OAAA3vL,KAAA8tL,MAAAkB,MAAA,KAAA,MAEA,IAAAga,EAAAhpM,KAAAulH,EAAA07E,UACAgI,EAAAD,EAAA7a,SACA6Z,EAAAhoM,KAAA4N,EAAAgzL,OAAAqI,GACAC,EAAAlpM,KAAA6N,EAAA+yL,OAAAqI,GAAArI,OAAAoI,GAEA,OAAAhpM,KAAA8tL,MAAAkB,MAAAgZ,EAAAkB,IAGArC,EAAAlpM,UAAAi4L,IAAA,WACA,OAAA51L,KAAA8tL,MAAA0W,OAAAxkM,KAAA4N,EAAA5N,KAAA6N,EAAA2gL,SAAAxuL,KAAAulH,IAGAshF,EAAAlpM,UAAA3e,IAAA,SAAA9X,GAEA,GAAA84B,KAAA2vL,aACA,OAAAzoN,EAGA,GAAAA,EAAAyoN,aACA,OAAA3vL,KAGA,IAAAmpM,EAAAjiO,EAAAq+I,EAAA4oE,SACAib,EAAAppM,KAAAulH,EAAA4oE,SACA8D,EAAAjyL,KAAA4N,EAAAgzL,OAAAuI,GACAjX,EAAAhrN,EAAA0mC,EAAAgzL,OAAAwI,GACAvzG,EAAA71F,KAAA6N,EAAA+yL,OAAAuI,EAAAvI,OAAA15N,EAAAq+I,IACAzvB,EAAA5uH,EAAA2mC,EAAA+yL,OAAAwI,EAAAxI,OAAA5gM,KAAAulH,IAEA99C,EAAAwqH,EAAAwO,OAAAvO,GACAlkL,EAAA6nF,EAAA4qG,OAAA3qG,GACA,GAAA,IAAAruB,EAAAuqH,KAAA,GACA,OAAA,IAAAhkL,EAAAgkL,KAAA,GACAhyL,KAAA8tL,MAAA0W,OAAA,KAAA,KAAA,MAEAxkM,KAAAimM,MAGA,IAAA94B,EAAA1lG,EAAA0mH,SACA/gB,EAAAD,EAAAyzB,OAAAn5H,GACA3C,EAAAmtH,EAAA2O,OAAAzzB,GAEAs7B,EAAAz6L,EAAAmgL,SAAAE,QAAAjhB,GAAAwhB,QAAA9pH,GAAA8pH,QAAA9pH,GACA4jI,EAAA16L,EAAA4yL,OAAA97H,EAAA8pH,QAAA6Z,IAAA7Z,QAAA/4F,EAAA+qG,OAAAxzB,IACAi8B,EAAArpM,KAAAulH,EAAAq7E,OAAA15N,EAAAq+I,GAAAq7E,OAAAn5H,GAEA,OAAAznE,KAAA8tL,MAAA0W,OAAAiE,EAAAC,EAAAW,IAGAxC,EAAAlpM,UAAA8mM,SAAA,SAAAv9N,GAEA,GAAA84B,KAAA2vL,aACA,OAAAzoN,EAAAo+N,MAGA,GAAAp+N,EAAAyoN,aACA,OAAA3vL,KAGA,IAAAopM,EAAAppM,KAAAulH,EAAA4oE,SACA8D,EAAAjyL,KAAA4N,EACAskL,EAAAhrN,EAAA0mC,EAAAgzL,OAAAwI,GACAvzG,EAAA71F,KAAA6N,EACAioF,EAAA5uH,EAAA2mC,EAAA+yL,OAAAwI,GAAAxI,OAAA5gM,KAAAulH,GAEA99C,EAAAwqH,EAAAwO,OAAAvO,GACAlkL,EAAA6nF,EAAA4qG,OAAA3qG,GACA,GAAA,IAAAruB,EAAAuqH,KAAA,GACA,OAAA,IAAAhkL,EAAAgkL,KAAA,GACAhyL,KAAA8tL,MAAA0W,OAAA,KAAA,KAAA,MAEAxkM,KAAAimM,MAGA,IAAA94B,EAAA1lG,EAAA0mH,SACA/gB,EAAAD,EAAAyzB,OAAAn5H,GACA3C,EAAAmtH,EAAA2O,OAAAzzB,GAEAs7B,EAAAz6L,EAAAmgL,SAAAE,QAAAjhB,GAAAwhB,QAAA9pH,GAAA8pH,QAAA9pH,GACA4jI,EAAA16L,EAAA4yL,OAAA97H,EAAA8pH,QAAA6Z,IAAA7Z,QAAA/4F,EAAA+qG,OAAAxzB,IACAi8B,EAAArpM,KAAAulH,EAAAq7E,OAAAn5H,GAEA,OAAAznE,KAAA8tL,MAAA0W,OAAAiE,EAAAC,EAAAW,IAGAxC,EAAAlpM,UAAAonM,KAAA,SAAA1lE,GACA,GAAA,IAAAA,EACA,OAAAr/H,KACA,GAAAA,KAAA2vL,aACA,OAAA3vL,KACA,IAAAq/H,EACA,OAAAr/H,KAAAimM,MAEA,IAAA9+N,EACA,GAAA64B,KAAA8tL,MAAAsY,OAAApmM,KAAA8tL,MAAAuY,OAAA,CACA,IAAAr4L,EAAAhO,KACA,IAAA74B,EAAA,EAAAA,EAAAk4J,EAAAl4J,IACA6mC,EAAAA,EAAAi4L,MACA,OAAAj4L,EAKA,IAAAnnC,EAAAm5B,KAAA8tL,MAAAjnN,EACAs/N,EAAAnmM,KAAA8tL,MAAAqY,KAEAmD,EAAAtpM,KAAA4N,EACA27L,EAAAvpM,KAAA6N,EACA27L,EAAAxpM,KAAAulH,EACAkkF,EAAAD,EAAArb,SAAAA,SAGAub,EAAAH,EAAA/I,OAAA+I,GACA,IAAApiO,EAAA,EAAAA,EAAAk4J,EAAAl4J,IAAA,CACA,IAAAwiO,EAAAL,EAAAnb,SACAyb,EAAAF,EAAAvb,SACA0b,EAAAD,EAAAzb,SACA1hN,EAAAk9N,EAAAnJ,OAAAmJ,GAAAtb,QAAAsb,GAAAtb,QAAAxnN,EAAA+5N,OAAA6I,IAEA97B,EAAA27B,EAAA1I,OAAAgJ,GACAnB,EAAAh8N,EAAA0hN,SAAAS,QAAAjhB,EAAA6yB,OAAA7yB,IACAC,EAAAD,EAAAihB,QAAA6Z,GACAqB,EAAAr9N,EAAAm0N,OAAAhzB,GACAk8B,EAAAA,EAAAzb,QAAAyb,GAAAlb,QAAAib,GACA,IAAAR,EAAAK,EAAA9I,OAAA4I,GACAriO,EAAA,EAAAk4J,IACAoqE,EAAAA,EAAA7I,OAAAiJ,IAEAP,EAAAb,EACAe,EAAAH,EACAK,EAAAI,EAGA,OAAA9pM,KAAA8tL,MAAA0W,OAAA8E,EAAAI,EAAA9I,OAAAuF,GAAAqD,IAGA3C,EAAAlpM,UAAAsoM,IAAA,WACA,OAAAjmM,KAAA2vL,aACA3vL,KAEAA,KAAA8tL,MAAAsY,MACApmM,KAAA+pM,WACA/pM,KAAA8tL,MAAAuY,OACArmM,KAAAgqM,YAEAhqM,KAAAiqM,QAGApD,EAAAlpM,UAAAosM,SAAA,WACA,IAAAtB,EACAC,EACAW,EAEA,GAAArpM,KAAA8mM,KAAA,CAMA,IAAAoD,EAAAlqM,KAAA4N,EAAAugL,SAEAgc,EAAAnqM,KAAA6N,EAAAsgL,SAEAic,EAAAD,EAAAhc,SAEAjyM,EAAA8jB,KAAA4N,EAAA4yL,OAAA2J,GAAAhc,SAAAS,QAAAsb,GAAAtb,QAAAwb,GACAluN,EAAAA,EAAAmyM,QAAAnyM,GAEA,IAAAgD,EAAAgrN,EAAA1J,OAAA0J,GAAA7b,QAAA6b,GAEAnrJ,EAAA7/D,EAAAivM,SAAAS,QAAA1yM,GAAA0yM,QAAA1yM,GAGAmuN,EAAAD,EAAA/b,QAAA+b,GAEAC,GADAA,EAAAA,EAAAhc,QAAAgc,IACAhc,QAAAgc,GAGA5B,EAAA1pJ,EAEA2pJ,EAAAxpN,EAAA0hN,OAAA1kN,EAAA0yM,QAAA7vI,IAAA6vI,QAAAyb,GAEAhB,EAAArpM,KAAA6N,EAAA2yL,OAAAxgM,KAAA6N,OACA,CAMA,IAAAhnC,EAAAm5B,KAAA4N,EAAAugL,SAEA70M,EAAA0mB,KAAA6N,EAAAsgL,SAEA1hN,EAAA6M,EAAA60M,SAEAvwJ,EAAA59B,KAAA4N,EAAA4yL,OAAAlnN,GAAA60M,SAAAS,QAAA/nN,GAAA+nN,QAAAniN,GACAmxD,EAAAA,EAAAywJ,QAAAzwJ,GAEA,IAAA7pI,EAAA8yE,EAAA25N,OAAA35N,GAAAwnN,QAAAxnN,GAEA66E,EAAA3tJ,EAAAo6R,SAGAmc,EAAA79N,EAAA4hN,QAAA5hN,GAEA69N,GADAA,EAAAA,EAAAjc,QAAAic,IACAjc,QAAAic,GAGA7B,EAAA/mJ,EAAAktI,QAAAhxJ,GAAAgxJ,QAAAhxJ,GAEA8qK,EAAA30S,EAAA6sS,OAAAhjK,EAAAgxJ,QAAA6Z,IAAA7Z,QAAA0b,GAGAjB,GADAA,EAAArpM,KAAA6N,EAAA+yL,OAAA5gM,KAAAulH,IACA8oE,QAAAgb,GAGA,OAAArpM,KAAA8tL,MAAA0W,OAAAiE,EAAAC,EAAAW,IAGAxC,EAAAlpM,UAAAqsM,UAAA,WACA,IAAAvB,EACAC,EACAW,EAEA,GAAArpM,KAAA8mM,KAAA,CAMA,IAAAoD,EAAAlqM,KAAA4N,EAAAugL,SAEAgc,EAAAnqM,KAAA6N,EAAAsgL,SAEAic,EAAAD,EAAAhc,SAEAjyM,EAAA8jB,KAAA4N,EAAA4yL,OAAA2J,GAAAhc,SAAAS,QAAAsb,GAAAtb,QAAAwb,GACAluN,EAAAA,EAAAmyM,QAAAnyM,GAEA,IAAAgD,EAAAgrN,EAAA1J,OAAA0J,GAAA7b,QAAA6b,GAAA7b,QAAAruL,KAAA8tL,MAAAjnN,GAEAk4E,EAAA7/D,EAAAivM,SAAAS,QAAA1yM,GAAA0yM,QAAA1yM,GAEAusN,EAAA1pJ,EAEA,IAAAsrJ,EAAAD,EAAA/b,QAAA+b,GAEAC,GADAA,EAAAA,EAAAhc,QAAAgc,IACAhc,QAAAgc,GACA3B,EAAAxpN,EAAA0hN,OAAA1kN,EAAA0yM,QAAA7vI,IAAA6vI,QAAAyb,GAEAhB,EAAArpM,KAAA6N,EAAA2yL,OAAAxgM,KAAA6N,OACA,CAKA,IAAA0d,EAAAvrB,KAAAulH,EAAA4oE,SAEA7iK,EAAAtrB,KAAA6N,EAAAsgL,SAEA9iK,EAAArrB,KAAA4N,EAAAgzL,OAAAt1K,GAEAF,EAAAprB,KAAA4N,EAAA6yL,OAAAl1K,GAAAq1K,OAAA5gM,KAAA4N,EAAA4yL,OAAAj1K,IACAH,EAAAA,EAAAo1K,OAAAp1K,GAAAijK,QAAAjjK,GAEA,IAAAm/K,EAAAl/K,EAAAgjK,QAAAhjK,GAEAm/K,GADAD,EAAAA,EAAAlc,QAAAkc,IACA/J,OAAA+J,GACA9B,EAAAr9K,EAAA+iK,SAAAS,QAAA4b,GAEAnB,EAAArpM,KAAA6N,EAAA2yL,OAAAxgM,KAAAulH,GAAA4oE,SAAAS,QAAAtjK,GAAAsjK,QAAArjK,GAEA,IAAAk/K,EAAAn/K,EAAA6iK,SAGAsc,GADAA,GADAA,EAAAA,EAAApc,QAAAoc,IACApc,QAAAoc,IACApc,QAAAoc,GACA/B,EAAAt9K,EAAAw1K,OAAA2J,EAAA3b,QAAA6Z,IAAA7Z,QAAA6b,GAGA,OAAAzqM,KAAA8tL,MAAA0W,OAAAiE,EAAAC,EAAAW,IAGAxC,EAAAlpM,UAAAssM,KAAA,WACA,IAAApjO,EAAAm5B,KAAA8tL,MAAAjnN,EAGAyiO,EAAAtpM,KAAA4N,EACA27L,EAAAvpM,KAAA6N,EACA27L,EAAAxpM,KAAAulH,EACAkkF,EAAAD,EAAArb,SAAAA,SAEAwb,EAAAL,EAAAnb,SACAuc,EAAAnB,EAAApb,SAEA1hN,EAAAk9N,EAAAnJ,OAAAmJ,GAAAtb,QAAAsb,GAAAtb,QAAAxnN,EAAA+5N,OAAA6I,IAEAkB,EAAArB,EAAA9I,OAAA8I,GAEA37B,GADAg9B,EAAAA,EAAAtc,QAAAsc,IACA/J,OAAA8J,GACAjC,EAAAh8N,EAAA0hN,SAAAS,QAAAjhB,EAAA6yB,OAAA7yB,IACAC,EAAAD,EAAAihB,QAAA6Z,GAEAmC,EAAAF,EAAAvc,SAGAyc,GADAA,GADAA,EAAAA,EAAAvc,QAAAuc,IACAvc,QAAAuc,IACAvc,QAAAuc,GACA,IAAAlC,EAAAj8N,EAAAm0N,OAAAhzB,GAAAghB,QAAAgc,GACAvB,EAAAE,EAAA/I,OAAA+I,GAAA3I,OAAA4I,GAEA,OAAAxpM,KAAA8tL,MAAA0W,OAAAiE,EAAAC,EAAAW,IAGAxC,EAAAlpM,UAAAktM,KAAA,WACA,IAAA7qM,KAAA8tL,MAAAsY,MACA,OAAApmM,KAAAimM,MAAAjnN,IAAAghB,MAMA,IAAAkqM,EAAAlqM,KAAA4N,EAAAugL,SAEAgc,EAAAnqM,KAAA6N,EAAAsgL,SAEA2c,EAAA9qM,KAAAulH,EAAA4oE,SAEAic,EAAAD,EAAAhc,SAEAjvM,EAAAgrN,EAAA1J,OAAA0J,GAAA7b,QAAA6b,GAEA35C,EAAArxK,EAAAivM,SAEAp6R,EAAAisG,KAAA4N,EAAA4yL,OAAA2J,GAAAhc,SAAAS,QAAAsb,GAAAtb,QAAAwb,GAKAW,GAFAh3S,GADAA,GADAA,EAAAA,EAAAs6R,QAAAt6R,IACAysS,OAAAzsS,GAAAs6R,QAAAt6R,IACA66R,QAAAr+B,IAEA49B,SAEApvI,EAAAqrJ,EAAA/b,QAAA+b,GAGArrJ,GADAA,GADAA,EAAAA,EAAAsvI,QAAAtvI,IACAsvI,QAAAtvI,IACAsvI,QAAAtvI,GAEA,IAAAm1C,EAAAh1G,EAAAmvM,QAAAt6R,GAAAo6R,SAAAS,QAAAr+B,GAAAq+B,QAAAmc,GAAAnc,QAAA7vI,GAEAisJ,EAAAb,EAAAvJ,OAAA1sG,GAEA82G,GADAA,EAAAA,EAAA3c,QAAA2c,IACA3c,QAAA2c,GACA,IAAAvC,EAAAzoM,KAAA4N,EAAAgzL,OAAAmK,GAAAnc,QAAAoc,GAEAvC,GADAA,EAAAA,EAAApa,QAAAoa,IACApa,QAAAoa,GAEA,IAAAC,EAAA1oM,KAAA6N,EAAA+yL,OAAA1sG,EAAA0sG,OAAA7hJ,EAAA6vI,QAAA16F,IAAA06F,QAAA76R,EAAA6sS,OAAAmK,KAGArC,GADAA,GADAA,EAAAA,EAAAra,QAAAqa,IACAra,QAAAqa,IACAra,QAAAqa,GAEA,IAAAW,EAAArpM,KAAAulH,EAAAi7E,OAAAzsS,GAAAo6R,SAAAS,QAAAkc,GAAAlc,QAAAmc,GAEA,OAAA/qM,KAAA8tL,MAAA0W,OAAAiE,EAAAC,EAAAW,IAGAxC,EAAAlpM,UAAAiyL,IAAA,SAAAv7R,EAAA42S,GAGA,OAFA52S,EAAA,IAAA05R,EAAA15R,EAAA42S,GAEAjrM,KAAA8tL,MAAA8W,SAAA5kM,KAAA3rG,IAGAwyS,EAAAlpM,UAAA4V,GAAA,SAAArsC,GACA,GAAA,WAAAA,EAAAJ,KACA,OAAAk5B,KAAAuT,GAAArsC,EAAAo+N,OAEA,GAAAtlM,OAAA94B,EACA,OAAA,EAGA,IAAAkiO,EAAAppM,KAAAulH,EAAA4oE,SACAgb,EAAAjiO,EAAAq+I,EAAA4oE,SACA,GAAA,IAAAnuL,KAAA4N,EAAAgzL,OAAAuI,GAAAva,QAAA1nN,EAAA0mC,EAAAgzL,OAAAwI,IAAApX,KAAA,GACA,OAAA,EAGA,IAAAkZ,EAAA9B,EAAAxI,OAAA5gM,KAAAulH,GACA4lF,EAAAhC,EAAAvI,OAAA15N,EAAAq+I,GACA,OAAA,IAAAvlH,KAAA6N,EAAA+yL,OAAAuK,GAAAvc,QAAA1nN,EAAA2mC,EAAA+yL,OAAAsK,IAAAlZ,KAAA,IAGA6U,EAAAlpM,UAAAytM,OAAA,SAAAx9L,GACA,IAAAy9L,EAAArrM,KAAAulH,EAAA4oE,SACAiO,EAAAxuL,EAAAqgL,MAAAjuL,KAAA8tL,MAAAI,KAAA0S,OAAAyK,GACA,GAAA,IAAArrM,KAAA4N,EAAAzG,IAAAi1L,GACA,OAAA,EAIA,IAFA,IAAAh/D,EAAAxvH,EAAAynB,QACA0pB,EAAA/+C,KAAA8tL,MAAAgW,KAAAlD,OAAAyK,KACA,CAEA,GADAjuE,EAAAgyD,KAAApvL,KAAA8tL,MAAA75R,GACAmpO,EAAAj2H,IAAAnH,KAAA8tL,MAAA5mN,IAAA,EACA,OAAA,EAGA,GADAk1N,EAAA/N,QAAAtvI,GACA,IAAA/+C,KAAA4N,EAAAzG,IAAAi1L,GACA,OAAA,IAIAyK,EAAAlpM,UAAAs2L,QAAA,WACA,OAAAj0L,KAAA2vL,aACA,uBACA,iBAAA3vL,KAAA4N,EAAAxP,SAAA,GAAA,GACA,OAAA4B,KAAA6N,EAAAzP,SAAA,GAAA,GACA,OAAA4B,KAAAulH,EAAAnnH,SAAA,GAAA,GAAA,KAGAyoM,EAAAlpM,UAAAgyL,WAAA,WAEA,OAAA,IAAA3vL,KAAAulH,EAAAysE,KAAA,sGCx6BA,mBAAAx+R,OAAAU,OAEAb,EAAAC,QAAA,SAAA24L,EAAAymG,GACAA,IACAzmG,EAAA0mG,OAAAD,EACAzmG,EAAAtuF,UAAAnqG,OAAAU,OAAAw+R,EAAA/0L,UAAA,CACAgP,YAAA,CACAj5G,MAAAu4L,EACAltF,YAAA,EACAo3H,UAAA,EACAr3H,cAAA,OAOAzrG,EAAAC,QAAA,SAAA24L,EAAAymG,GACA,GAAAA,EAAA,CACAzmG,EAAA0mG,OAAAD,EACA,IAAAE,EAAA,aACAA,EAAAj1L,UAAA+0L,EAAA/0L,UACAsuF,EAAAtuF,UAAA,IAAAi1L,EACA3mG,EAAAtuF,UAAAgP,YAAAs/E,kCCvBA,aAEA,IAAA8hG,EAAAx6R,EAAA,SACAk/R,EAAAl/R,EAAA,YACAwpO,EAAAxpO,EAAA,UAEAgtR,EAAAhtR,EAAA,YAEA,SAAA+3S,EAAAt6L,GACA+rH,EAAAn/H,KAAAoC,KAAA,OAAAgR,GAEAhR,KAAAn5B,EAAA,IAAAknN,EAAA/8K,EAAAnqC,EAAA,IAAAonN,MAAAjuL,KAAAkuL,KACAluL,KAAA1mB,EAAA,IAAAy0M,EAAA/8K,EAAA13B,EAAA,IAAA20M,MAAAjuL,KAAAkuL,KACAluL,KAAAurM,GAAA,IAAAxd,EAAA,GAAAE,MAAAjuL,KAAAkuL,KAAA+S,UACAjhM,KAAAqjM,IAAA,IAAAtV,EAAA,GAAAE,MAAAjuL,KAAAkuL,KACAluL,KAAAwrM,IAAAxrM,KAAAurM,GAAA3K,OAAA5gM,KAAAn5B,EAAA25N,OAAAxgM,KAAAqjM,MAcA,SAAAqD,EAAA5Y,EAAAlgL,EAAA23G,GACAwX,EAAAinE,UAAApmM,KAAAoC,KAAA8tL,EAAA,cACA,OAAAlgL,GAAA,OAAA23G,GACAvlH,KAAA4N,EAAA5N,KAAA8tL,MAAA2U,IACAziM,KAAAulH,EAAAvlH,KAAA8tL,MAAA3jC,OAEAnqJ,KAAA4N,EAAA,IAAAmgL,EAAAngL,EAAA,IACA5N,KAAAulH,EAAA,IAAAwoE,EAAAxoE,EAAA,IACAvlH,KAAA4N,EAAAsgL,MACAluL,KAAA4N,EAAA5N,KAAA4N,EAAAqgL,MAAAjuL,KAAA8tL,MAAAI,MACAluL,KAAAulH,EAAA2oE,MACAluL,KAAAulH,EAAAvlH,KAAAulH,EAAA0oE,MAAAjuL,KAAA8tL,MAAAI,OAvBAuE,EAAA6Y,EAAAvuE,GACA1pO,EAAAC,QAAAg4S,EAEAA,EAAA3tM,UAAAs+H,SAAA,SAAA+yD,GACA,IAAAphL,EAAAohL,EAAAnpL,YAAA+H,EACA2xL,EAAA3xL,EAAAugL,SACA8Z,EAAA1I,EAAAqB,OAAAhzL,GAAA4yL,OAAAjB,EAAAqB,OAAA5gM,KAAAn5B,IAAA25N,OAAA5yL,GAGA,OAAA,IAFAq6L,EAAA3Z,UAEAH,SAAAhnL,IAAA8gM,IAiBAxV,EAAAiU,EAAA3pE,EAAAinE,WAEAsH,EAAA3tM,UAAA8nM,YAAA,SAAA9sE,EAAAgE,GACA,OAAA38H,KAAAgvL,MAAAzO,EAAAp9K,QAAAw1H,EAAAgE,GAAA,IAGA2uE,EAAA3tM,UAAAqxL,MAAA,SAAAphL,EAAA23G,GACA,OAAA,IAAAmhF,EAAA1mM,KAAA4N,EAAA23G,IAGA+lF,EAAA3tM,UAAA2lM,cAAA,SAAAzkM,GACA,OAAA6nM,EAAA2B,SAAAroM,KAAAnB,IAGA6nM,EAAA/oM,UAAAkoM,WAAA,aAIAa,EAAA/oM,UAAAioM,QAAA,WACA,OAAA5lM,KAAA6wL,OAAA1tL,QAAA,KAAAnD,KAAA8tL,MAAA5mN,EAAAk3J,eAGAsoE,EAAA2B,SAAA,SAAAva,EAAAjvL,GACA,OAAA,IAAA6nM,EAAA5Y,EAAAjvL,EAAA,GAAAA,EAAA,IAAAivL,EAAA2U,MAGAiE,EAAA/oM,UAAAs2L,QAAA,WACA,OAAAj0L,KAAA2vL,aACA,sBACA,gBAAA3vL,KAAA4N,EAAAyyL,UAAAjiM,SAAA,GAAA,GACA,OAAA4B,KAAAulH,EAAA86E,UAAAjiM,SAAA,GAAA,GAAA,KAGAsoM,EAAA/oM,UAAAgyL,WAAA,WAEA,OAAA,IAAA3vL,KAAAulH,EAAAysE,KAAA,IAGA0U,EAAA/oM,UAAAsoM,IAAA,WAKA,IAEAwF,EAFAzrM,KAAA4N,EAAA4yL,OAAAxgM,KAAAulH,GAEA4oE,SAIAud,EAFA1rM,KAAA4N,EAAA6yL,OAAAzgM,KAAAulH,GAEA4oE,SAEA1hN,EAAAg/N,EAAAhL,OAAAiL,GAEAjD,EAAAgD,EAAA7K,OAAA8K,GAEArC,EAAA58N,EAAAm0N,OAAA8K,EAAAlL,OAAAxgM,KAAA8tL,MAAA0d,IAAA5K,OAAAn0N,KACA,OAAAuzB,KAAA8tL,MAAAkB,MAAAyZ,EAAAY,IAGA3C,EAAA/oM,UAAA3e,IAAA,WACA,MAAA,IAAA8Z,MAAA,sCAGA4tM,EAAA/oM,UAAAguM,QAAA,SAAAzkO,EAAAwnI,GAKA,IAAA7nI,EAAAm5B,KAAA4N,EAAA4yL,OAAAxgM,KAAAulH,GAEAjsI,EAAA0mB,KAAA4N,EAAA6yL,OAAAzgM,KAAAulH,GAEA94I,EAAAvF,EAAA0mC,EAAA4yL,OAAAt5N,EAAAq+I,GAIAz/B,EAFA5+G,EAAA0mC,EAAA6yL,OAAAv5N,EAAAq+I,GAEAq7E,OAAA/5N,GAEAw5E,EAAA5zE,EAAAm0N,OAAAtnN,GAEAmvN,EAAA/5F,EAAA6W,EAAAq7E,OAAA96G,EAAA06G,OAAAngJ,GAAA8tI,UAEAkb,EAAA36F,EAAA9gG,EAAAgzL,OAAA96G,EAAA8oG,QAAAvuI,GAAA8tI,UACA,OAAAnuL,KAAA8tL,MAAAkB,MAAAyZ,EAAAY,IAGA3C,EAAA/oM,UAAAiyL,IAAA,SAAAv7R,GAMA,IALA,IAAA0qJ,EAAA1qJ,EAAAghI,QACAxuD,EAAAm5B,KACA1mB,EAAA0mB,KAAA8tL,MAAAkB,MAAA,KAAA,MAGA50D,EAAA,GAAA,IAAAr7E,EAAAizI,KAAA,GAAAjzI,EAAA4yI,OAAA,GACAv3D,EAAAtvJ,KAAAi0E,EAAA0yI,MAAA,IAEA,IAAA,IAAAtqN,EAAAizJ,EAAAn1J,OAAA,EAAAkC,GAAA,EAAAA,IACA,IAAAizJ,EAAAjzJ,IAEAN,EAAAA,EAAA8kO,QAAAryN,EARA0mB,MAUA1mB,EAAAA,EAAA2sN,QAGA3sN,EAAAzS,EAAA8kO,QAAAryN,EAbA0mB,MAeAn5B,EAAAA,EAAAo/N,OAGA,OAAA3sN,GAGAotN,EAAA/oM,UAAAkrM,OAAA,WACA,MAAA,IAAA/vM,MAAA,sCAGA4tM,EAAA/oM,UAAAiuM,QAAA,WACA,MAAA,IAAA9yM,MAAA,sCAGA4tM,EAAA/oM,UAAA4V,GAAA,SAAAyjI,GACA,OAAA,IAAAh3I,KAAA6wL,OAAA1pL,IAAA6vI,EAAA65C,SAGA6V,EAAA/oM,UAAAkI,UAAA,WAGA,OAFA7F,KAAA4N,EAAA5N,KAAA4N,EAAAgzL,OAAA5gM,KAAAulH,EAAA07E,WACAjhM,KAAAulH,EAAAvlH,KAAA8tL,MAAA2U,IACAziM,MAGA0mM,EAAA/oM,UAAAkzL,KAAA,WAIA,OAFA7wL,KAAA6F,YAEA7F,KAAA4N,EAAAyyL,6GChLA,aAEA,IAAA9f,EAAAhtR,EAAA,YACAw6R,EAAAx6R,EAAA,SACAk/R,EAAAl/R,EAAA,YACAwpO,EAAAxpO,EAAA,UAEAslG,EAAA0nL,EAAA1nL,OAEA,SAAAgzM,EAAA76L,GAEAhR,KAAA8rM,QAAA,IAAA,EAAA96L,EAAAnqC,GACAm5B,KAAA+rM,MAAA/rM,KAAA8rM,UAAA,IAAA,EAAA96L,EAAAnqC,GACAm5B,KAAA49L,SAAA59L,KAAA+rM,MAEAhvE,EAAAn/H,KAAAoC,KAAA,UAAAgR,GAEAhR,KAAAn5B,EAAA,IAAAknN,EAAA/8K,EAAAnqC,EAAA,IAAAqoN,KAAAlvL,KAAAkuL,IAAAhvM,GACA8gB,KAAAn5B,EAAAm5B,KAAAn5B,EAAAonN,MAAAjuL,KAAAkuL,KACAluL,KAAAvzB,EAAA,IAAAshN,EAAA/8K,EAAAvkC,EAAA,IAAAwhN,MAAAjuL,KAAAkuL,KACAluL,KAAAk1F,GAAAl1F,KAAAvzB,EAAA0hN,SACAnuL,KAAA49B,EAAA,IAAAmwJ,EAAA/8K,EAAA4sB,EAAA,IAAAqwJ,MAAAjuL,KAAAkuL,KACAluL,KAAAgsM,GAAAhsM,KAAA49B,EAAA4iK,OAAAxgM,KAAA49B,GAEA/kC,GAAAmH,KAAA8rM,SAAA,IAAA9rM,KAAAvzB,EAAA4zN,UAAArO,KAAA,IACAhyL,KAAAisM,KAAA,IAAA,EAAAj7L,EAAAvkC,GAwFA,SAAAi6N,EAAA5Y,EAAAlgL,EAAAC,EAAA03G,EAAAxmE,GACAg+E,EAAAinE,UAAApmM,KAAAoC,KAAA8tL,EAAA,cACA,OAAAlgL,GAAA,OAAAC,GAAA,OAAA03G,GACAvlH,KAAA4N,EAAA5N,KAAA8tL,MAAA3jC,KACAnqJ,KAAA6N,EAAA7N,KAAA8tL,MAAA2U,IACAziM,KAAAulH,EAAAvlH,KAAA8tL,MAAA2U,IACAziM,KAAA++C,EAAA/+C,KAAA8tL,MAAA3jC,KACAnqJ,KAAA8mM,MAAA,IAEA9mM,KAAA4N,EAAA,IAAAmgL,EAAAngL,EAAA,IACA5N,KAAA6N,EAAA,IAAAkgL,EAAAlgL,EAAA,IACA7N,KAAAulH,EAAAA,EAAA,IAAAwoE,EAAAxoE,EAAA,IAAAvlH,KAAA8tL,MAAA2U,IACAziM,KAAA++C,EAAAA,GAAA,IAAAgvI,EAAAhvI,EAAA,IACA/+C,KAAA4N,EAAAsgL,MACAluL,KAAA4N,EAAA5N,KAAA4N,EAAAqgL,MAAAjuL,KAAA8tL,MAAAI,MACAluL,KAAA6N,EAAAqgL,MACAluL,KAAA6N,EAAA7N,KAAA6N,EAAAogL,MAAAjuL,KAAA8tL,MAAAI,MACAluL,KAAAulH,EAAA2oE,MACAluL,KAAAulH,EAAAvlH,KAAAulH,EAAA0oE,MAAAjuL,KAAA8tL,MAAAI,MACAluL,KAAA++C,IAAA/+C,KAAA++C,EAAAmvI,MACAluL,KAAA++C,EAAA/+C,KAAA++C,EAAAkvI,MAAAjuL,KAAA8tL,MAAAI,MACAluL,KAAA8mM,KAAA9mM,KAAAulH,IAAAvlH,KAAA8tL,MAAA2U,IAGAziM,KAAA8tL,MAAA8P,WAAA59L,KAAA++C,IACA/+C,KAAA++C,EAAA/+C,KAAA4N,EAAAgzL,OAAA5gM,KAAA6N,GACA7N,KAAA8mM,OACA9mM,KAAA++C,EAAA/+C,KAAA++C,EAAA6hJ,OAAA5gM,KAAAulH,EAAA07E,cAjHAxO,EAAAoZ,EAAA9uE,GACA1pO,EAAAC,QAAAu4S,EAEAA,EAAAluM,UAAAuuM,MAAA,SAAAx6L,GACA,OAAA1R,KAAA+rM,MACAr6L,EAAA88K,SAEAxuL,KAAAn5B,EAAA+5N,OAAAlvL,IAGAm6L,EAAAluM,UAAAwuM,MAAA,SAAAz6L,GACA,OAAA1R,KAAAisM,KACAv6L,EAEA1R,KAAAvzB,EAAAm0N,OAAAlvL,IAIAm6L,EAAAluM,UAAA6mM,OAAA,SAAA52L,EAAAC,EAAA03G,EAAAxmE,GACA,OAAA/+C,KAAAgvL,MAAAphL,EAAAC,EAAA03G,EAAAxmE,IAGA8sJ,EAAAluM,UAAA+nM,WAAA,SAAA93L,EAAA0uL,IACA1uL,EAAA,IAAAmgL,EAAAngL,EAAA,KACAsgL,MACAtgL,EAAAA,EAAAqgL,MAAAjuL,KAAAkuL,MAEA,IAAAqR,EAAA3xL,EAAAugL,SACA8Z,EAAAjoM,KAAAk1F,GAAAurG,OAAAzgM,KAAAn5B,EAAA+5N,OAAArB,IACA1lJ,EAAA75C,KAAAyiM,IAAAhC,OAAAzgM,KAAAk1F,GAAA0rG,OAAA5gM,KAAA49B,GAAAgjK,OAAArB,IAEAkI,EAAAQ,EAAArH,OAAA/mJ,EAAAonJ,WACApzL,EAAA45L,EAAAnZ,UACA,GAAA,IAAAzgL,EAAAsgL,SAAAsS,OAAAgH,GAAAtgM,IAAAnH,KAAAmqJ,MACA,MAAA,IAAArxJ,MAAA,iBAEA,IAAAy1L,EAAA1gL,EAAAwyL,UAAA9R,QAIA,OAHA+N,IAAA/N,IAAA+N,GAAA/N,KACA1gL,EAAAA,EAAA2gL,UAEAxuL,KAAAgvL,MAAAphL,EAAAC,IAGAg+L,EAAAluM,UAAAyuM,WAAA,SAAAv+L,EAAAyuL,IACAzuL,EAAA,IAAAkgL,EAAAlgL,EAAA,KACAqgL,MACArgL,EAAAA,EAAAogL,MAAAjuL,KAAAkuL,MAGA,IAAAuZ,EAAA55L,EAAAsgL,SACAt0I,EAAA4tJ,EAAAhH,OAAAzgM,KAAAk1F,IACA+yG,EAAAR,EAAA7G,OAAA5gM,KAAA49B,GAAAgjK,OAAA5gM,KAAAk1F,IAAAurG,OAAAzgM,KAAAn5B,GACA04N,EAAA1lJ,EAAA+mJ,OAAAqH,EAAAhH,WAEA,GAAA,IAAA1B,EAAAp4L,IAAAnH,KAAAmqJ,MAAA,CACA,GAAAmyC,EACA,MAAA,IAAAxjM,MAAA,iBAEA,OAAAkH,KAAAgvL,MAAAhvL,KAAAmqJ,KAAAt8I,GAGA,IAAAD,EAAA2xL,EAAAjR,UACA,GAAA,IAAA1gL,EAAAugL,SAAAsS,OAAAlB,GAAAp4L,IAAAnH,KAAAmqJ,MACA,MAAA,IAAArxJ,MAAA,iBAKA,OAHA8U,EAAAyyL,UAAA9R,UAAA+N,IACA1uL,EAAAA,EAAA4gL,UAEAxuL,KAAAgvL,MAAAphL,EAAAC,IAGAg+L,EAAAluM,UAAAs+H,SAAA,SAAA+yD,GACA,GAAAA,EAAAW,aACA,OAAA,EAGAX,EAAAnpL,YAEA,IAAA05L,EAAAvQ,EAAAphL,EAAAugL,SACAsZ,EAAAzY,EAAAnhL,EAAAsgL,SACAt0I,EAAA0lJ,EAAAqB,OAAA5gM,KAAAn5B,GAAA25N,OAAAiH,GACAQ,EAAAjoM,KAAAk1F,GAAA0rG,OAAA5gM,KAAAyiM,IAAAjC,OAAAxgM,KAAA49B,EAAAgjK,OAAArB,GAAAqB,OAAA6G,KAEA,OAAA,IAAA5tJ,EAAA1yC,IAAA8gM,IAkCAxV,EAAAiU,EAAA3pE,EAAAinE,WAEA6H,EAAAluM,UAAA2lM,cAAA,SAAAzkM,GACA,OAAA6nM,EAAA2B,SAAAroM,KAAAnB,IAGAgtM,EAAAluM,UAAAqxL,MAAA,SAAAphL,EAAAC,EAAA03G,EAAAxmE,GACA,OAAA,IAAA2nJ,EAAA1mM,KAAA4N,EAAAC,EAAA03G,EAAAxmE,IAGA2nJ,EAAA2B,SAAA,SAAAva,EAAAjvL,GACA,OAAA,IAAA6nM,EAAA5Y,EAAAjvL,EAAA,GAAAA,EAAA,GAAAA,EAAA,KAGA6nM,EAAA/oM,UAAAs2L,QAAA,WACA,OAAAj0L,KAAA2vL,aACA,sBACA,gBAAA3vL,KAAA4N,EAAAyyL,UAAAjiM,SAAA,GAAA,GACA,OAAA4B,KAAA6N,EAAAwyL,UAAAjiM,SAAA,GAAA,GACA,OAAA4B,KAAAulH,EAAA86E,UAAAjiM,SAAA,GAAA,GAAA,KAGAsoM,EAAA/oM,UAAAgyL,WAAA,WAEA,OAAA,IAAA3vL,KAAA4N,EAAAokL,KAAA,KACA,IAAAhyL,KAAA6N,EAAA1G,IAAAnH,KAAAulH,IACAvlH,KAAA8mM,MAAA,IAAA9mM,KAAA6N,EAAA1G,IAAAnH,KAAA8tL,MAAArhN,KAGAi6N,EAAA/oM,UAAA0uM,QAAA,WAMA,IAAAxlO,EAAAm5B,KAAA4N,EAAAugL,SAEA70M,EAAA0mB,KAAA6N,EAAAsgL,SAEA1hN,EAAAuzB,KAAAulH,EAAA4oE,SACA1hN,EAAAA,EAAA4hN,QAAA5hN,GAEA,IAAAmxD,EAAA59B,KAAA8tL,MAAAoe,MAAArlO,GAEA9yE,EAAAisG,KAAA4N,EAAA4yL,OAAAxgM,KAAA6N,GAAAsgL,SAAAS,QAAA/nN,GAAA+nN,QAAAt1M,GAEA8qI,EAAAxmF,EAAA4iK,OAAAlnN,GAEAooE,EAAA0iE,EAAAq8E,OAAAh0N,GAEAg7F,EAAA7pC,EAAA6iK,OAAAnnN,GAEAmvN,EAAA10S,EAAA6sS,OAAAl/I,GAEAgnJ,EAAAtkF,EAAAw8E,OAAAn5H,GAEA6kI,EAAAv4S,EAAA6sS,OAAAn5H,GAEA4hI,EAAA3nJ,EAAAk/I,OAAAx8E,GACA,OAAApkH,KAAA8tL,MAAAkB,MAAAyZ,EAAAC,EAAAW,EAAAiD,IAGA5F,EAAA/oM,UAAA4uM,SAAA,WAQA,IAMA9D,EACAC,EACAW,EACAt1S,EACA0zK,EACAn2E,EAXAhY,EAAA0mB,KAAA4N,EAAA4yL,OAAAxgM,KAAA6N,GAAAsgL,SAEA1hN,EAAAuzB,KAAA4N,EAAAugL,SAEAvwJ,EAAA59B,KAAA6N,EAAAsgL,SAQA,GAAAnuL,KAAA8tL,MAAAge,QAAA,CAIA,IAAApqJ,GAFA3tJ,EAAAisG,KAAA8tL,MAAAoe,MAAAz/N,IAEA+zN,OAAA5iK,GACA59B,KAAA8mM,MAEA2B,EAAAnvN,EAAAmnN,OAAAh0N,GAAAg0N,OAAA7iK,GAAAgjK,OAAAl/I,EAAA++I,OAAAzgM,KAAA8tL,MAAAuV,MAEAqF,EAAAhnJ,EAAAk/I,OAAA7sS,EAAA0sS,OAAA7iK,IAEAyrK,EAAA3nJ,EAAAysI,SAAAsS,OAAA/+I,GAAA++I,OAAA/+I,KAGA+lB,EAAAznE,KAAAulH,EAAA4oE,SAEA78L,EAAAowD,EAAA++I,OAAAh5H,GAAAmnH,QAAAnnH,GAEAghI,EAAAnvN,EAAAmnN,OAAAh0N,GAAAmiN,QAAAhxJ,GAAAgjK,OAAAtvM,GAEAo3M,EAAAhnJ,EAAAk/I,OAAA7sS,EAAA0sS,OAAA7iK,IAEAyrK,EAAA3nJ,EAAAk/I,OAAAtvM,SAIAv9F,EAAA04E,EAAA+zN,OAAA5iK,GAEA6pC,EAAAznE,KAAA8tL,MAAAqe,MAAAnsM,KAAAulH,GAAA4oE,SAEA78L,EAAAv9F,EAAA0sS,OAAAh5H,GAAAg5H,OAAAh5H,GAEAghI,EAAAzoM,KAAA8tL,MAAAqe,MAAA7yN,EAAAs1M,QAAA76R,IAAA6sS,OAAAtvM,GAEAo3M,EAAA1oM,KAAA8tL,MAAAqe,MAAAp4S,GAAA6sS,OAAAn0N,EAAAmiN,QAAAhxJ,IAEAyrK,EAAAt1S,EAAA6sS,OAAAtvM,GAEA,OAAA0O,KAAA8tL,MAAAkB,MAAAyZ,EAAAC,EAAAW,IAGA3C,EAAA/oM,UAAAsoM,IAAA,WACA,OAAAjmM,KAAA2vL,aACA3vL,KAGAA,KAAA8tL,MAAA8P,SACA59L,KAAAqsM,UAEArsM,KAAAusM,YAGA7F,EAAA/oM,UAAA6uM,QAAA,SAAAtlO,GAMA,IAAAL,EAAAm5B,KAAA6N,EAAA4yL,OAAAzgM,KAAA4N,GAAAgzL,OAAA15N,EAAA2mC,EAAA4yL,OAAAv5N,EAAA0mC,IAEAt0B,EAAA0mB,KAAA6N,EAAA2yL,OAAAxgM,KAAA4N,GAAAgzL,OAAA15N,EAAA2mC,EAAA2yL,OAAAt5N,EAAA0mC,IAEAnhC,EAAAuzB,KAAA++C,EAAA6hJ,OAAA5gM,KAAA8tL,MAAAke,IAAApL,OAAA15N,EAAA63E,GAEAnhB,EAAA59B,KAAAulH,EAAAq7E,OAAA15N,EAAAq+I,EAAAi7E,OAAAt5N,EAAAq+I,IAEAxxN,EAAAulF,EAAAmnN,OAAA55N,GAEA66E,EAAA9jB,EAAA6iK,OAAAh0N,GAEA23I,EAAAxmF,EAAA4iK,OAAA/zN,GAEAg7F,EAAAnuF,EAAAknN,OAAA35N,GAEA4hO,EAAA10S,EAAA6sS,OAAAl/I,GAEAgnJ,EAAAtkF,EAAAw8E,OAAAn5H,GAEA6kI,EAAAv4S,EAAA6sS,OAAAn5H,GAEA4hI,EAAA3nJ,EAAAk/I,OAAAx8E,GACA,OAAApkH,KAAA8tL,MAAAkB,MAAAyZ,EAAAC,EAAAW,EAAAiD,IAGA5F,EAAA/oM,UAAA8uM,SAAA,SAAAvlO,GAOA,IAgBAwhO,EACAW,EAjBAxiO,EAAAm5B,KAAAulH,EAAAq7E,OAAA15N,EAAAq+I,GAEAjsI,EAAAzS,EAAAsnN,SAEA1hN,EAAAuzB,KAAA4N,EAAAgzL,OAAA15N,EAAA0mC,GAEAgwB,EAAA59B,KAAA6N,EAAA+yL,OAAA15N,EAAA2mC,GAEA95G,EAAAisG,KAAA8tL,MAAAlwJ,EAAAgjK,OAAAn0N,GAAAm0N,OAAAhjK,GAEA8jB,EAAApoE,EAAAmnN,OAAA1sS,GAEAqwN,EAAA9qI,EAAAknN,OAAAzsS,GAEAqnG,EAAA4E,KAAA4N,EAAA4yL,OAAAxgM,KAAA6N,GAAA+yL,OAAA15N,EAAA0mC,EAAA4yL,OAAAt5N,EAAA2mC,IAAA+gL,QAAAniN,GAAAmiN,QAAAhxJ,GACA6qK,EAAA5hO,EAAA+5N,OAAAl/I,GAAAk/I,OAAAxlM,GAcA,OAXA4E,KAAA8tL,MAAAge,SAEApD,EAAA7hO,EAAA+5N,OAAAx8E,GAAAw8E,OAAAhjK,EAAA6iK,OAAAzgM,KAAA8tL,MAAAoe,MAAAz/N,KAEA48N,EAAA3nJ,EAAAk/I,OAAAx8E,KAGAskF,EAAA7hO,EAAA+5N,OAAAx8E,GAAAw8E,OAAAhjK,EAAA6iK,OAAAh0N,IAEA48N,EAAArpM,KAAA8tL,MAAAqe,MAAAzqJ,GAAAk/I,OAAAx8E,IAEApkH,KAAA8tL,MAAAkB,MAAAyZ,EAAAC,EAAAW,IAGA3C,EAAA/oM,UAAA3e,IAAA,SAAA9X,GACA,OAAA84B,KAAA2vL,aACAzoN,EACAA,EAAAyoN,aACA3vL,KAEAA,KAAA8tL,MAAA8P,SACA59L,KAAAwsM,QAAAtlO,GAEA84B,KAAAysM,SAAAvlO,IAGAw/N,EAAA/oM,UAAAiyL,IAAA,SAAAv7R,GACA,OAAA2rG,KAAAgmM,YAAA3xS,GACA2rG,KAAA8tL,MAAAoW,aAAAlkM,KAAA3rG,GAEA2rG,KAAA8tL,MAAA8W,SAAA5kM,KAAA3rG,IAGAqyS,EAAA/oM,UAAAkrM,OAAA,SAAA7rB,EAAA91M,EAAA2qN,GACA,OAAA7xL,KAAA8tL,MAAAkX,YAAA,EAAA,CAAAhlM,KAAA94B,GAAA,CAAA81M,EAAA6U,GAAA,GAAA,IAGA6U,EAAA/oM,UAAAmrM,QAAA,SAAA9rB,EAAA91M,EAAA2qN,GACA,OAAA7xL,KAAA8tL,MAAAkX,YAAA,EAAA,CAAAhlM,KAAA94B,GAAA,CAAA81M,EAAA6U,GAAA,GAAA,IAGA6U,EAAA/oM,UAAAkI,UAAA,WACA,GAAA7F,KAAA8mM,KACA,OAAA9mM,KAGA,IAAA0mL,EAAA1mL,KAAAulH,EAAA07E,UAOA,OANAjhM,KAAA4N,EAAA5N,KAAA4N,EAAAgzL,OAAAla,GACA1mL,KAAA6N,EAAA7N,KAAA6N,EAAA+yL,OAAAla,GACA1mL,KAAA++C,IACA/+C,KAAA++C,EAAA/+C,KAAA++C,EAAA6hJ,OAAAla,IACA1mL,KAAAulH,EAAAvlH,KAAA8tL,MAAA2U,IACAziM,KAAA8mM,MAAA,EACA9mM,MAGA0mM,EAAA/oM,UAAAi4L,IAAA,WACA,OAAA51L,KAAA8tL,MAAAkB,MAAAhvL,KAAA4N,EAAA4gL,SACAxuL,KAAA6N,EACA7N,KAAAulH,EACAvlH,KAAA++C,GAAA/+C,KAAA++C,EAAAyvI,WAGAkY,EAAA/oM,UAAAkzL,KAAA,WAEA,OADA7wL,KAAA6F,YACA7F,KAAA4N,EAAAyyL,WAGAqG,EAAA/oM,UAAAmzL,KAAA,WAEA,OADA9wL,KAAA6F,YACA7F,KAAA6N,EAAAwyL,WAGAqG,EAAA/oM,UAAA4V,GAAA,SAAAyjI,GACA,OAAAh3I,OAAAg3I,GACA,IAAAh3I,KAAA6wL,OAAA1pL,IAAA6vI,EAAA65C,SACA,IAAA7wL,KAAA8wL,OAAA3pL,IAAA6vI,EAAA85C,SAGA4V,EAAA/oM,UAAAytM,OAAA,SAAAx9L,GACA,IAAAwuL,EAAAxuL,EAAAqgL,MAAAjuL,KAAA8tL,MAAAI,KAAA0S,OAAA5gM,KAAAulH,GACA,GAAA,IAAAvlH,KAAA4N,EAAAzG,IAAAi1L,GACA,OAAA,EAIA,IAFA,IAAAh/D,EAAAxvH,EAAAynB,QACA0pB,EAAA/+C,KAAA8tL,MAAAgW,KAAAlD,OAAA5gM,KAAAulH,KACA,CAEA,GADA6X,EAAAgyD,KAAApvL,KAAA8tL,MAAA75R,GACAmpO,EAAAj2H,IAAAnH,KAAA8tL,MAAA5mN,IAAA,EACA,OAAA,EAGA,GADAk1N,EAAA/N,QAAAtvI,GACA,IAAA/+C,KAAA4N,EAAAzG,IAAAi1L,GACA,OAAA,IAKAsK,EAAA/oM,UAAAgnM,IAAA+B,EAAA/oM,UAAAkI,UACA6gM,EAAA/oM,UAAA8mM,SAAAiC,EAAA/oM,UAAA3e,sGClbA,aAEA,IAsKAspN,EAtKArX,EAAA39R,EAEA+/G,EAAA9/G,EAAA,WACAu6R,EAAAv6R,EAAA,WAGAslG,EAFAtlG,EAAA,WAEAslG,OAEA,SAAA6zM,EAAA/3S,GACA,UAAAA,EAAAmyE,KACAk5B,KAAA8tL,MAAA,IAAAA,EAAAoV,MAAAvuS,GACA,YAAAA,EAAAmyE,KACAk5B,KAAA8tL,MAAA,IAAAA,EAAAqV,QAAAxuS,GAEAqrG,KAAA8tL,MAAA,IAAAA,EAAAiV,KAAApuS,GACAqrG,KAAAokH,EAAApkH,KAAA8tL,MAAA1pE,EACApkH,KAAA/rG,EAAA+rG,KAAA8tL,MAAA75R,EACA+rG,KAAAqT,KAAA1+G,EAAA0+G,KAEAxa,EAAAmH,KAAAokH,EAAA6X,WAAA,iBACApjI,EAAAmH,KAAAokH,EAAAwrE,IAAA5vL,KAAA/rG,GAAA07R,aAAA,2BAIA,SAAAgd,EAAA95S,EAAA8B,GACAnB,OAAAC,eAAAw9R,EAAAp+R,EAAA,CACAisG,cAAA,EACAC,YAAA,EACAvd,IAAA,WACA,IAAAssM,EAAA,IAAA4e,EAAA/3S,GAMA,OALAnB,OAAAC,eAAAw9R,EAAAp+R,EAAA,CACAisG,cAAA,EACAC,YAAA,EACArrG,MAAAo6R,IAEAA,KAbAmD,EAAAyb,YAAAA,EAkBAC,EAAA,OAAA,CACA7lO,KAAA,QACAsnD,MAAA,OACAlnD,EAAA,wDACAL,EAAA,wDACAyS,EAAA,wDACArlF,EAAA,wDACAo/G,KAAAA,EAAAu4J,OACA23B,MAAA,EACAn/E,EAAA,CACA,wDACA,2DAIAuoF,EAAA,OAAA,CACA7lO,KAAA,QACAsnD,MAAA,OACAlnD,EAAA,iEACAL,EAAA,iEACAyS,EAAA,iEACArlF,EAAA,iEACAo/G,KAAAA,EAAAu4J,OACA23B,MAAA,EACAn/E,EAAA,CACA,iEACA,oEAIAuoF,EAAA,OAAA,CACA7lO,KAAA,QACAsnD,MAAA,KACAlnD,EAAA,0EACAL,EAAA,0EACAyS,EAAA,0EACArlF,EAAA,0EACAo/G,KAAAA,EAAAu4J,OACA23B,MAAA,EACAn/E,EAAA,CACA,0EACA,6EAIAuoF,EAAA,OAAA,CACA7lO,KAAA,QACAsnD,MAAA,KACAlnD,EAAA,8GAEAL,EAAA,8GAEAyS,EAAA,8GAEArlF,EAAA,8GAEAo/G,KAAAA,EAAA8tK,OACAoiB,MAAA,EACAn/E,EAAA,CACA,8GAEA,iHAKAuoF,EAAA,OAAA,CACA7lO,KAAA,QACAsnD,MAAA,KACAlnD,EAAA,2JAGAL,EAAA,2JAGAyS,EAAA,2JAGArlF,EAAA,2JAGAo/G,KAAAA,EAAAiqJ,OACAimC,MAAA,EACAn/E,EAAA,CACA,2JAGA,8JAMAuoF,EAAA,aAAA,CACA7lO,KAAA,OACAsnD,MAAA,SACAlnD,EAAA,sEACAL,EAAA,QACAyS,EAAA,IACArlF,EAAA,sEACAo/G,KAAAA,EAAAu4J,OACA23B,MAAA,EACAn/E,EAAA,CACA,OAIAuoF,EAAA,UAAA,CACA7lO,KAAA,UACAsnD,MAAA,SACAlnD,EAAA,sEACAL,EAAA,KACA4F,EAAA,IAEAmxD,EAAA,sEACA3pI,EAAA,sEACAo/G,KAAAA,EAAAu4J,OACA23B,MAAA,EACAn/E,EAAA,CACA,mEAGA,sEAKA,IACAkkF,EAAA/0S,EAAA,2BACA,MAAAQ,GACAu0S,OAAA5yS,EAGAi3S,EAAA,YAAA,CACA7lO,KAAA,QACAsnD,MAAA,OACAlnD,EAAA,0EACAL,EAAA,IACAyS,EAAA,IACArlF,EAAA,0EACAwzK,EAAA,IACAp0D,KAAAA,EAAAu4J,OAGAvgJ,KAAA,mEACAS,OAAA,mEACAo7K,MAAA,CACA,CACArgO,EAAA,mCACAyS,EAAA,qCAEA,CACAzS,EAAA,oCACAyS,EAAA,qCAIAiqN,MAAA,EACAn/E,EAAA,CACA,mEACA,mEACAkkF,0HC3MA,IAAAj1L,EAAA//G,EAEA+/G,EAAAktK,MAAAhtR,EAAA,gBACA8/G,EAAAu5L,OAAAr5S,EAAA,iBACA8/G,EAAA4sK,IAAA1sR,EAAA,cACA8/G,EAAAw5L,OAAAt5S,EAAA,iBACA8/G,EAAAy2J,KAAAv2Q,EAAA,eAGA8/G,EAAA4sH,KAAA5sH,EAAA4sK,IAAAhgD,KACA5sH,EAAAu4J,OAAAv4J,EAAA4sK,IAAArU,OACAv4J,EAAA+tK,OAAA/tK,EAAA4sK,IAAAmB,OACA/tK,EAAA8tK,OAAA9tK,EAAA4sK,IAAAkB,OACA9tK,EAAAiqJ,OAAAjqJ,EAAA4sK,IAAA3iB,OACAjqJ,EAAAy5L,UAAAz5L,EAAAw5L,OAAAC,yJCdA,aAEA,IAAAj0M,EAAAtlG,EAAA,uBACAk/R,EAAAl/R,EAAA,YAIA,SAAAw5S,EAAAt9N,EAAAtI,GACA,OAAA,QAAA,MAAAsI,EAAAwI,WAAA9Q,QAGAA,EAAA,GAAAA,EAAA,GAAAsI,EAAAxK,SAGA,QAAA,MAAAwK,EAAAwI,WAAA9Q,EAAA,KA0DA,SAAA6lO,EAAAvoF,GAKA,OAJAA,IAAA,GACAA,IAAA,EAAA,MACAA,GAAA,EAAA,UACA,IAAAA,IAAA,MACA,EAgBA,SAAA4sE,EAAA7uK,GACA,OAAA,IAAAA,EAAAv9C,OACA,IAAAu9C,EAEAA,EAIA,SAAAyqL,EAAAzqL,GACA,OAAA,IAAAA,EAAAv9C,OACA,IAAAu9C,EACA,IAAAA,EAAAv9C,OACA,KAAAu9C,EACA,IAAAA,EAAAv9C,OACA,MAAAu9C,EACA,IAAAA,EAAAv9C,OACA,OAAAu9C,EACA,IAAAA,EAAAv9C,OACA,QAAAu9C,EACA,IAAAA,EAAAv9C,OACA,SAAAu9C,EACA,IAAAA,EAAAv9C,OACA,UAAAu9C,EAEAA,EAhHAlvH,EAAAm/R,SAAAA,EAyDAn/R,EAAA6vG,QA7CA,SAAA1zB,EAAAktJ,GACA,GAAA9+H,MAAA/gB,QAAArN,GACA,OAAAA,EAAArK,QACA,IAAAqK,EACA,MAAA,GACA,IAAA1D,EAAA,GACA,GAAA,iBAAA0D,EACA,GAAAktJ,GAyBA,GAAA,QAAAA,EAIA,KAHAltJ,EAAAA,EAAAyJ,QAAA,eAAA,KACAjU,OAAA,GAAA,IACAwK,EAAA,IAAAA,GACAtI,EAAA,EAAAA,EAAAsI,EAAAxK,OAAAkC,GAAA,EACA4E,EAAAjB,KAAA1E,SAAAqJ,EAAAtI,GAAAsI,EAAAtI,EAAA,GAAA,UAxBA,IADA,IAAAD,EAAA,EACAC,EAAA,EAAAA,EAAAsI,EAAAxK,OAAAkC,IAAA,CACA,IAAAsF,EAAAgD,EAAAwI,WAAA9Q,GACAsF,EAAA,IACAV,EAAA7E,KAAAuF,EACAA,EAAA,MACAV,EAAA7E,KAAAuF,GAAA,EAAA,IACAV,EAAA7E,KAAA,GAAAuF,EAAA,KACAsgO,EAAAt9N,EAAAtI,IACAsF,EAAA,QAAA,KAAAA,IAAA,KAAA,KAAAgD,EAAAwI,aAAA9Q,IACA4E,EAAA7E,KAAAuF,GAAA,GAAA,IACAV,EAAA7E,KAAAuF,GAAA,GAAA,GAAA,IACAV,EAAA7E,KAAAuF,GAAA,EAAA,GAAA,IACAV,EAAA7E,KAAA,GAAAuF,EAAA,MAEAV,EAAA7E,KAAAuF,GAAA,GAAA,IACAV,EAAA7E,KAAAuF,GAAA,EAAA,GAAA,IACAV,EAAA7E,KAAA,GAAAuF,EAAA,UAWA,IAAAtF,EAAA,EAAAA,EAAAsI,EAAAxK,OAAAkC,IACA4E,EAAA5E,GAAA,EAAAsI,EAAAtI,GAEA,OAAA4E,GAUAz4E,EAAA8hQ,MANA,SAAA3lL,GAEA,IADA,IAAA1D,EAAA,GACA5E,EAAA,EAAAA,EAAAsI,EAAAxK,OAAAkC,IACA4E,GAAAslN,EAAA5hN,EAAAtI,GAAAi3B,SAAA,KACA,OAAAryB,GAWAz4E,EAAA05S,MAAAA,EAYA15S,EAAA45S,QAVA,SAAAz9N,EAAAojN,GAEA,IADA,IAAA9mN,EAAA,GACA5E,EAAA,EAAAA,EAAAsI,EAAAxK,OAAAkC,IAAA,CACA,IAAAs9I,EAAAh1I,EAAAtI,GACA,WAAA0rN,IACApuE,EAAAuoF,EAAAvoF,IACA14I,GAAAkhO,EAAAxoF,EAAArmH,SAAA,KAEA,OAAAryB,GAUAz4E,EAAA+9R,MAAAA,EAoBA/9R,EAAA25S,MAAAA,EAgBA35S,EAAA65S,OAdA,SAAA19N,EAAAuF,EAAAhQ,EAAA6tN,GACA,IAAAzvL,EAAAp+B,EAAAgQ,EACA6jB,EAAAuK,EAAA,GAAA,GAEA,IADA,IAAAr3B,EAAA,IAAA8xB,MAAAuF,EAAA,GACAj8B,EAAA,EAAA9yE,EAAA2gF,EAAA7N,EAAA4E,EAAA9G,OAAAkC,IAAA9yE,GAAA,EAAA,CACA,IAAAowN,EAEAA,EADA,QAAAouE,EACApjN,EAAAp7E,IAAA,GAAAo7E,EAAAp7E,EAAA,IAAA,GAAAo7E,EAAAp7E,EAAA,IAAA,EAAAo7E,EAAAp7E,EAAA,GAEAo7E,EAAAp7E,EAAA,IAAA,GAAAo7E,EAAAp7E,EAAA,IAAA,GAAAo7E,EAAAp7E,EAAA,IAAA,EAAAo7E,EAAAp7E,GACA03E,EAAA5E,GAAAs9I,IAAA,EAEA,OAAA14I,GAsBAz4E,EAAA85S,QAlBA,SAAA39N,EAAAojN,GAEA,IADA,IAAA9mN,EAAA,IAAA8xB,MAAA,EAAApuB,EAAAxK,QACAkC,EAAA,EAAA9yE,EAAA,EAAA8yE,EAAAsI,EAAAxK,OAAAkC,IAAA9yE,GAAA,EAAA,CACA,IAAA6qF,EAAAzP,EAAAtI,GACA,QAAA0rN,GACA9mN,EAAA13E,GAAA6qF,IAAA,GACAnT,EAAA13E,EAAA,GAAA6qF,IAAA,GAAA,IACAnT,EAAA13E,EAAA,GAAA6qF,IAAA,EAAA,IACAnT,EAAA13E,EAAA,GAAA,IAAA6qF,IAEAnT,EAAA13E,EAAA,GAAA6qF,IAAA,GACAnT,EAAA13E,EAAA,GAAA6qF,IAAA,GAAA,IACAnT,EAAA13E,EAAA,GAAA6qF,IAAA,EAAA,IACAnT,EAAA13E,GAAA,IAAA6qF,GAGA,OAAAnT,GAOAz4E,EAAA+5S,OAHA,SAAA5oF,EAAAnrI,GACA,OAAAmrI,IAAAnrI,EAAAmrI,GAAA,GAAAnrI,GAOAhmF,EAAAg6S,OAHA,SAAA7oF,EAAAnrI,GACA,OAAAmrI,GAAAnrI,EAAAmrI,IAAA,GAAAnrI,GAOAhmF,EAAAi6S,MAHA,SAAA1mO,EAAAyS,GACA,OAAAzS,EAAAyS,IAAA,GAOAhmF,EAAAk6S,QAHA,SAAA3mO,EAAAyS,EAAA7M,GACA,OAAA5F,EAAAyS,EAAA7M,IAAA,GAOAn5E,EAAAm6S,QAHA,SAAA5mO,EAAAyS,EAAA7M,EAAAmxD,GACA,OAAA/2D,EAAAyS,EAAA7M,EAAAmxD,IAAA,GAOAtqI,EAAAo6S,QAHA,SAAA7mO,EAAAyS,EAAA7M,EAAAmxD,EAAA7pI,GACA,OAAA8yE,EAAAyS,EAAA7M,EAAAmxD,EAAA7pI,IAAA,GAaAT,EAAAq6S,MATA,SAAAp9E,EAAA34I,EAAAuvL,EAAAymC,GACA,IAAAC,EAAAt9E,EAAA34I,GAGA0rK,EAAAsqD,EAFAr9E,EAAA34I,EAAA,KAEA,EACAyrK,GAAAC,EAAAsqD,EAAA,EAAA,GAAAzmC,EAAA0mC,EACAt9E,EAAA34I,GAAAyrK,IAAA,EACA9yB,EAAA34I,EAAA,GAAA0rK,GASAhwP,EAAAw6S,SALA,SAAA3mC,EAAAymC,EAAAC,EAAAE,GAGA,OAFAH,EAAAG,IAAA,EACAH,EAAA,EAAA,GAAAzmC,EAAA0mC,IACA,GAQAv6S,EAAA06S,SAJA,SAAA7mC,EAAAymC,EAAAC,EAAAE,GAEA,OADAH,EAAAG,IACA,GAiBAz6S,EAAA26S,WAbA,SAAA9mC,EAAAymC,EAAAC,EAAAE,EAAA9sK,EAAAitK,EAAAC,EAAAC,GACA,IAAAvwE,EAAA,EACAylB,EAAAsqD,EASA,OAPA/vE,IADAylB,EAAAA,EAAAyqD,IAAA,GACAH,EAAA,EAAA,EAEA/vE,IADAylB,EAAAA,EAAA4qD,IAAA,GACAA,EAAA,EAAA,EAIA/mC,EAAA0mC,EAAA5sK,EAAAktK,GAFAtwE,IADAylB,EAAAA,EAAA8qD,IAAA,GACAA,EAAA,EAAA,KAGA,GAQA96S,EAAA+6S,WAJA,SAAAlnC,EAAAymC,EAAAC,EAAAE,EAAA9sK,EAAAitK,EAAAC,EAAAC,GAEA,OADAR,EAAAG,EAAAG,EAAAE,IACA,GAmBA96S,EAAAg7S,WAfA,SAAAnnC,EAAAymC,EAAAC,EAAAE,EAAA9sK,EAAAitK,EAAAC,EAAAC,EAAAG,EAAAr5S,GACA,IAAA2oO,EAAA,EACAylB,EAAAsqD,EAWA,OATA/vE,IADAylB,EAAAA,EAAAyqD,IAAA,GACAH,EAAA,EAAA,EAEA/vE,IADAylB,EAAAA,EAAA4qD,IAAA,GACAA,EAAA,EAAA,EAEArwE,IADAylB,EAAAA,EAAA8qD,IAAA,GACAA,EAAA,EAAA,EAIAjnC,EAAA0mC,EAAA5sK,EAAAktK,EAAAI,GAFA1wE,IADAylB,EAAAA,EAAApuP,IAAA,GACAA,EAAA,EAAA,KAGA,GASA5B,EAAAk7S,WALA,SAAArnC,EAAAymC,EAAAC,EAAAE,EAAA9sK,EAAAitK,EAAAC,EAAAC,EAAAG,EAAAr5S,GAGA,OAFA04S,EAAAG,EAAAG,EAAAE,EAAAl5S,IAEA,GAQA5B,EAAAm7S,UAJA,SAAAtnC,EAAAymC,EAAAl8L,GAEA,OADAk8L,GAAA,GAAAl8L,EAAAy1J,IAAAz1J,KACA,GAQAp+G,EAAAo7S,UAJA,SAAAvnC,EAAAymC,EAAAl8L,GAEA,OADAy1J,GAAA,GAAAz1J,EAAAk8L,IAAAl8L,KACA,GAOAp+G,EAAAq7S,SAHA,SAAAxnC,EAAAymC,EAAAl8L,GACA,OAAAy1J,IAAAz1J,GAQAp+G,EAAAs7S,SAJA,SAAAznC,EAAAymC,EAAAl8L,GAEA,OADAy1J,GAAA,GAAAz1J,EAAAk8L,IAAAl8L,KACA,+ECnRA,aAEA,IAAA6uK,EAAAhtR,EAAA,WACAslG,EAAAtlG,EAAA,uBAEA,SAAAs7S,IACA7uM,KAAAmnJ,QAAA,KACAnnJ,KAAA8uM,aAAA,EACA9uM,KAAAyhK,UAAAzhK,KAAA2M,YAAA80J,UACAzhK,KAAA+uM,QAAA/uM,KAAA2M,YAAAoiM,QACA/uM,KAAAgvM,aAAAhvM,KAAA2M,YAAAqiM,aACAhvM,KAAAivM,UAAAjvM,KAAA2M,YAAAsiM,UAAA,EACAjvM,KAAA6yL,OAAA,MAEA7yL,KAAAkvM,QAAAlvM,KAAAyhK,UAAA,EACAzhK,KAAAmvM,SAAAnvM,KAAAyhK,UAAA,GAEAnuQ,EAAAu7S,UAAAA,EAEAA,EAAAlxM,UAAAg4D,OAAA,SAAAlmF,EAAAktJ,GAUA,GARAltJ,EAAA8wM,EAAAp9K,QAAA1zB,EAAAktJ,GACA38H,KAAAmnJ,QAGAnnJ,KAAAmnJ,QAAAnnJ,KAAAmnJ,QAAAt1J,OAAApiB,GAFAuwB,KAAAmnJ,QAAA13K,EAGAuwB,KAAA8uM,cAAAr/N,EAAAxK,OAGA+6B,KAAAmnJ,QAAAliL,QAAA+6B,KAAAkvM,QAAA,CAIA,IAAAlhM,GAHAv+B,EAAAuwB,KAAAmnJ,SAGAliL,OAAA+6B,KAAAkvM,QACAlvM,KAAAmnJ,QAAA13K,EAAArK,MAAAqK,EAAAxK,OAAA+oC,EAAAv+B,EAAAxK,QACA,IAAA+6B,KAAAmnJ,QAAAliL,SACA+6B,KAAAmnJ,QAAA,MAEA13K,EAAA8wM,EAAA4sB,OAAA19N,EAAA,EAAAA,EAAAxK,OAAA+oC,EAAAhO,KAAA6yL,QACA,IAAA,IAAA1rN,EAAA,EAAAA,EAAAsI,EAAAxK,OAAAkC,GAAA64B,KAAAmvM,SACAnvM,KAAAytK,QAAAh+L,EAAAtI,EAAAA,EAAA64B,KAAAmvM,UAGA,OAAAnvM,MAGA6uM,EAAAlxM,UAAAu7H,OAAA,SAAAyD,GAIA,OAHA38H,KAAA21D,OAAA31D,KAAAovM,QACAv2M,EAAA,OAAAmH,KAAAmnJ,SAEAnnJ,KAAAqvM,QAAA1yE,IAGAkyE,EAAAlxM,UAAAyxM,KAAA,WACA,IAAAhsM,EAAApD,KAAA8uM,aACAn2E,EAAA34H,KAAAkvM,QACA76S,EAAAskO,GAAAv1H,EAAApD,KAAAivM,WAAAt2E,EACA5sJ,EAAA,IAAA8xB,MAAAxpG,EAAA2rG,KAAAivM,WACAljO,EAAA,GAAA,IACA,IAAA,IAAA5E,EAAA,EAAAA,EAAA9yE,EAAA8yE,IACA4E,EAAA5E,GAAA,EAIA,GADAi8B,IAAA,EACA,QAAApD,KAAA6yL,OAAA,CACA,IAAA,IAAA9zI,EAAA,EAAAA,EAAA/+C,KAAAivM,UAAAlwJ,IACAhzE,EAAA5E,KAAA,EAEA4E,EAAA5E,KAAA,EACA4E,EAAA5E,KAAA,EACA4E,EAAA5E,KAAA,EACA4E,EAAA5E,KAAA,EACA4E,EAAA5E,KAAAi8B,IAAA,GAAA,IACAr3B,EAAA5E,KAAAi8B,IAAA,GAAA,IACAr3B,EAAA5E,KAAAi8B,IAAA,EAAA,IACAr3B,EAAA5E,KAAA,IAAAi8B,OAWA,IATAr3B,EAAA5E,KAAA,IAAAi8B,EACAr3B,EAAA5E,KAAAi8B,IAAA,EAAA,IACAr3B,EAAA5E,KAAAi8B,IAAA,GAAA,IACAr3B,EAAA5E,KAAAi8B,IAAA,GAAA,IACAr3B,EAAA5E,KAAA,EACA4E,EAAA5E,KAAA,EACA4E,EAAA5E,KAAA,EACA4E,EAAA5E,KAAA,EAEA43E,EAAA,EAAAA,EAAA/+C,KAAAivM,UAAAlwJ,IACAhzE,EAAA5E,KAAA,EAGA,OAAA4E,gFC1FA,aAEAz4E,EAAA2sO,KAAA1sO,EAAA,WACAD,EAAA8tR,OAAA7tR,EAAA,aACAD,EAAAs4Q,OAAAr4Q,EAAA,aACAD,EAAA6tR,OAAA5tR,EAAA,aACAD,EAAAgqQ,OAAA/pQ,EAAA,4ICNA,aAEA,IAAAgtR,EAAAhtR,EAAA,YACAq5S,EAAAr5S,EAAA,aACA+7S,EAAA/7S,EAAA,YAEA+5S,EAAA/sB,EAAA+sB,OACAC,EAAAhtB,EAAAgtB,MACAG,EAAAntB,EAAAmtB,QACA6B,EAAAD,EAAAC,KACAV,EAAAjC,EAAAiC,UAEAW,EAAA,CACA,WAAA,WACA,WAAA,YAGA,SAAAC,IACA,KAAAzvM,gBAAAyvM,GACA,OAAA,IAAAA,EAEAZ,EAAAjxM,KAAAoC,MACAA,KAAAynE,EAAA,CACA,WAAA,WAAA,WACA,UAAA,YACAznE,KAAA6mH,EAAA,IAAAhpH,MAAA,IAGA0iL,EAAAkS,SAAAgd,EAAAZ,GACAx7S,EAAAC,QAAAm8S,EAEAA,EAAAhuC,UAAA,IACAguC,EAAAV,QAAA,IACAU,EAAAT,aAAA,GACAS,EAAAR,UAAA,GAEAQ,EAAA9xM,UAAA8vK,QAAA,SAAAh+L,EAAAuF,GAGA,IAFA,IAAA6xI,EAAA7mH,KAAA6mH,EAEA1/I,EAAA,EAAAA,EAAA,GAAAA,IACA0/I,EAAA1/I,GAAAsI,EAAAuF,EAAA7N,GAEA,KAAAA,EAAA0/I,EAAA5hJ,OAAAkC,IACA0/I,EAAA1/I,GAAAmmO,EAAAzmF,EAAA1/I,EAAA,GAAA0/I,EAAA1/I,EAAA,GAAA0/I,EAAA1/I,EAAA,IAAA0/I,EAAA1/I,EAAA,IAAA,GAEA,IAAAN,EAAAm5B,KAAAynE,EAAA,GACAnuF,EAAA0mB,KAAAynE,EAAA,GACAh7F,EAAAuzB,KAAAynE,EAAA,GACA7pC,EAAA59B,KAAAynE,EAAA,GACA1zK,EAAAisG,KAAAynE,EAAA,GAEA,IAAAtgG,EAAA,EAAAA,EAAA0/I,EAAA5hJ,OAAAkC,IAAA,CACA,IAAA+U,KAAA/U,EAAA,IACA43E,EAAA2uJ,EAAAJ,EAAAzmO,EAAA,GAAA0oO,EAAArzN,EAAA5C,EAAA7M,EAAAmxD,GAAA7pI,EAAA8yN,EAAA1/I,GAAAqoO,EAAAtzN,IACAnoF,EAAA6pI,EACAA,EAAAnxD,EACAA,EAAA6gO,EAAAh0N,EAAA,IACAA,EAAAzS,EACAA,EAAAk4E,EAGA/+C,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAA5gG,GACAm5B,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAAnuF,GACA0mB,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAAh7F,GACAuzB,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAA7pC,GACA59B,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAA1zK,IAGA07S,EAAA9xM,UAAA0xM,QAAA,SAAA1yE,GACA,MAAA,QAAAA,EACA4jD,EAAA2sB,QAAAltM,KAAAynE,EAAA,OAEA84G,EAAA6sB,QAAAptM,KAAAynE,EAAA,+FCxEA,aAEA,IACA4lI,EADA95S,EAAA,YACA85S,OAYA,SAAAqC,EAAA9hM,EAAAC,EAAA03G,GACA,OAAA33G,EAAAC,GAAAD,EAAA23G,EAIA,SAAAoqF,EAAA/hM,EAAAC,EAAA03G,GACA,OAAA33G,EAAAC,EAAAD,EAAA23G,EAAA13G,EAAA03G,EAIA,SAAAqqF,EAAAhiM,EAAAC,EAAA03G,GACA,OAAA33G,EAAAC,EAAA03G,EAbAjyN,EAAAi8S,KARA,SAAArzN,EAAA0xB,EAAAC,EAAA03G,GACA,OAAA,IAAArpI,EACAwzN,EAAA9hM,EAAAC,EAAA03G,GACA,IAAArpI,GAAA,IAAAA,EACA0zN,EAAAhiM,EAAAC,EAAA03G,GACA,IAAArpI,EACAyzN,EAAA/hM,EAAAC,EAAA03G,QADA,GAQAjyN,EAAAo8S,KAAAA,EAKAp8S,EAAAq8S,MAAAA,EAKAr8S,EAAAs8S,IAAAA,EAKAt8S,EAAAu8S,OAHA,SAAAjiM,GACA,OAAAy/L,EAAAz/L,EAAA,GAAAy/L,EAAAz/L,EAAA,IAAAy/L,EAAAz/L,EAAA,KAOAt6G,EAAAw8S,OAHA,SAAAliM,GACA,OAAAy/L,EAAAz/L,EAAA,GAAAy/L,EAAAz/L,EAAA,IAAAy/L,EAAAz/L,EAAA,KAOAt6G,EAAAy8S,OAHA,SAAAniM,GACA,OAAAy/L,EAAAz/L,EAAA,GAAAy/L,EAAAz/L,EAAA,IAAAA,IAAA,GAOAt6G,EAAA08S,OAHA,SAAApiM,GACA,OAAAy/L,EAAAz/L,EAAA,IAAAy/L,EAAAz/L,EAAA,IAAAA,IAAA,oDC9CA,aAEA,IAAA2yK,EAAAhtR,EAAA,YACA08S,EAAA18S,EAAA,SAEA,SAAA28S,IACA,KAAAlwM,gBAAAkwM,GACA,OAAA,IAAAA,EAEAD,EAAAryM,KAAAoC,MACAA,KAAAynE,EAAA,CACA,WAAA,UAAA,UAAA,WACA,WAAA,WAAA,WAAA,YAEA84G,EAAAkS,SAAAyd,EAAAD,GACA58S,EAAAC,QAAA48S,EAEAA,EAAAzuC,UAAA,IACAyuC,EAAAnB,QAAA,IACAmB,EAAAlB,aAAA,IACAkB,EAAAjB,UAAA,GAEAiB,EAAAvyM,UAAA0xM,QAAA,SAAA1yE,GAEA,MAAA,QAAAA,EACA4jD,EAAA2sB,QAAAltM,KAAAynE,EAAAriG,MAAA,EAAA,GAAA,OAEAm7M,EAAA6sB,QAAAptM,KAAAynE,EAAAriG,MAAA,EAAA,GAAA,wEC3BA,aAEA,IAAAm7M,EAAAhtR,EAAA,YACAq5S,EAAAr5S,EAAA,aACA+7S,EAAA/7S,EAAA,YACAslG,EAAAtlG,EAAA,uBAEAg6S,EAAAhtB,EAAAgtB,MACAE,EAAAltB,EAAAktB,QACAC,EAAAntB,EAAAmtB,QACAgC,EAAAJ,EAAAI,KACAC,EAAAL,EAAAK,MACAE,EAAAP,EAAAO,OACAC,EAAAR,EAAAQ,OACAC,EAAAT,EAAAS,OACAC,EAAAV,EAAAU,OAEAnB,EAAAjC,EAAAiC,UAEAsB,EAAA,CACA,WAAA,WAAA,WAAA,WACA,UAAA,WAAA,WAAA,WACA,WAAA,UAAA,UAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,UAAA,UACA,UAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,UAAA,UACA,UAAA,UAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,UACA,UAAA,UAAA,UAAA,UACA,UAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,YAGA,SAAAF,IACA,KAAAjwM,gBAAAiwM,GACA,OAAA,IAAAA,EAEApB,EAAAjxM,KAAAoC,MACAA,KAAAynE,EAAA,CACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,UAAA,YAEAznE,KAAA3rG,EAAA87S,EACAnwM,KAAA6mH,EAAA,IAAAhpH,MAAA,IAEA0iL,EAAAkS,SAAAwd,EAAApB,GACAx7S,EAAAC,QAAA28S,EAEAA,EAAAxuC,UAAA,IACAwuC,EAAAlB,QAAA,IACAkB,EAAAjB,aAAA,IACAiB,EAAAhB,UAAA,GAEAgB,EAAAtyM,UAAA8vK,QAAA,SAAAh+L,EAAAuF,GAGA,IAFA,IAAA6xI,EAAA7mH,KAAA6mH,EAEA1/I,EAAA,EAAAA,EAAA,GAAAA,IACA0/I,EAAA1/I,GAAAsI,EAAAuF,EAAA7N,GACA,KAAAA,EAAA0/I,EAAA5hJ,OAAAkC,IACA0/I,EAAA1/I,GAAAsmO,EAAAuC,EAAAnpF,EAAA1/I,EAAA,IAAA0/I,EAAA1/I,EAAA,GAAA4oO,EAAAlpF,EAAA1/I,EAAA,KAAA0/I,EAAA1/I,EAAA,KAEA,IAAAN,EAAAm5B,KAAAynE,EAAA,GACAnuF,EAAA0mB,KAAAynE,EAAA,GACAh7F,EAAAuzB,KAAAynE,EAAA,GACA7pC,EAAA59B,KAAAynE,EAAA,GACA1zK,EAAAisG,KAAAynE,EAAA,GACA/lB,EAAA1hD,KAAAynE,EAAA,GACA28C,EAAApkH,KAAAynE,EAAA,GACAA,EAAAznE,KAAAynE,EAAA,GAGA,IADA5uE,EAAAmH,KAAA3rG,EAAA4wE,SAAA4hJ,EAAA5hJ,QACAkC,EAAA,EAAAA,EAAA0/I,EAAA5hJ,OAAAkC,IAAA,CACA,IAAAmoM,EAAAo+B,EAAAjmI,EAAAqoI,EAAA/7S,GAAA27S,EAAA37S,EAAA2tJ,EAAA0iE,GAAApkH,KAAA3rG,EAAA8yE,GAAA0/I,EAAA1/I,IACAipO,EAAA7C,EAAAsC,EAAAhpO,GAAA8oO,EAAA9oO,EAAAyS,EAAA7M,IACAg7F,EAAA28C,EACAA,EAAA1iE,EACAA,EAAA3tJ,EACAA,EAAAw5S,EAAA3vK,EAAA0xI,GACA1xI,EAAAnxD,EACAA,EAAA6M,EACAA,EAAAzS,EACAA,EAAA0mO,EAAAj+B,EAAA8gC,GAGApwM,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAA5gG,GACAm5B,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAAnuF,GACA0mB,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAAh7F,GACAuzB,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAA7pC,GACA59B,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAA1zK,GACAisG,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAA/lB,GACA1hD,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAA28C,GACApkH,KAAAynE,EAAA,GAAA8lI,EAAAvtM,KAAAynE,EAAA,GAAAA,IAGAwoI,EAAAtyM,UAAA0xM,QAAA,SAAA1yE,GACA,MAAA,QAAAA,EACA4jD,EAAA2sB,QAAAltM,KAAAynE,EAAA,OAEA84G,EAAA6sB,QAAAptM,KAAAynE,EAAA,6HCvGA,aAEA,IAAA84G,EAAAhtR,EAAA,YAEA88S,EAAA98S,EAAA,SAEA,SAAA+8S,IACA,KAAAtwM,gBAAAswM,GACA,OAAA,IAAAA,EAEAD,EAAAzyM,KAAAoC,MACAA,KAAAynE,EAAA,CACA,WAAA,WACA,WAAA,UACA,WAAA,UACA,UAAA,WACA,WAAA,WACA,WAAA,WACA,WAAA,WACA,WAAA,YAEA84G,EAAAkS,SAAA6d,EAAAD,GACAh9S,EAAAC,QAAAg9S,EAEAA,EAAA7uC,UAAA,KACA6uC,EAAAvB,QAAA,IACAuB,EAAAtB,aAAA,IACAsB,EAAArB,UAAA,IAEAqB,EAAA3yM,UAAA0xM,QAAA,SAAA1yE,GACA,MAAA,QAAAA,EACA4jD,EAAA2sB,QAAAltM,KAAAynE,EAAAriG,MAAA,EAAA,IAAA,OAEAm7M,EAAA6sB,QAAAptM,KAAAynE,EAAAriG,MAAA,EAAA,IAAA,wECjCA,aAEA,IAAAm7M,EAAAhtR,EAAA,YACAq5S,EAAAr5S,EAAA,aACAslG,EAAAtlG,EAAA,uBAEAk7S,EAAAluB,EAAAkuB,UACAC,EAAAnuB,EAAAmuB,UACAC,EAAApuB,EAAAouB,SACAC,EAAAruB,EAAAquB,SACAjB,EAAAptB,EAAAotB,MACAG,EAAAvtB,EAAAutB,SACAE,EAAAztB,EAAAytB,SACAC,EAAA1tB,EAAA0tB,WACAI,EAAA9tB,EAAA8tB,WACAC,EAAA/tB,EAAA+tB,WACAE,EAAAjuB,EAAAiuB,WAEAK,EAAAjC,EAAAiC,UAEA0B,EAAA,CACA,WAAA,WAAA,WAAA,UACA,WAAA,WAAA,WAAA,WACA,UAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,UAAA,WACA,UAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,UACA,WAAA,UAAA,WAAA,WACA,WAAA,WAAA,WAAA,UACA,UAAA,WAAA,UAAA,WACA,UAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,UACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,UAAA,WAAA,UAAA,UACA,UAAA,WAAA,UAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,UACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,UACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,UAAA,UACA,UAAA,WAAA,UAAA,WACA,UAAA,WAAA,UAAA,WACA,UAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,UACA,WAAA,UAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,UACA,WAAA,WAAA,WAAA,WACA,UAAA,WAAA,UAAA,WACA,UAAA,WAAA,UAAA,UACA,UAAA,UAAA,UAAA,WACA,WAAA,UAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,UAAA,WAAA,YAGA,SAAAF,IACA,KAAArwM,gBAAAqwM,GACA,OAAA,IAAAA,EAEAxB,EAAAjxM,KAAAoC,MACAA,KAAAynE,EAAA,CACA,WAAA,WACA,WAAA,WACA,WAAA,WACA,WAAA,WACA,WAAA,WACA,WAAA,UACA,UAAA,WACA,WAAA,WACAznE,KAAA3rG,EAAAk8S,EACAvwM,KAAA6mH,EAAA,IAAAhpH,MAAA,KAyIA,SAAA2yM,EAAAp5B,EAAAD,EAAAs5B,EAAAC,EAAAC,GACA,IAAA3iM,EAAAopK,EAAAq5B,GAAAr5B,EAAAu5B,EAGA,OAFA3iM,EAAA,IACAA,GAAA,YACAA,EAGA,SAAA4iM,EAAAx5B,EAAAD,EAAAs5B,EAAAC,EAAAC,EAAAE,GACA,IAAA7iM,EAAAmpK,EAAAu5B,GAAAv5B,EAAA05B,EAGA,OAFA7iM,EAAA,IACAA,GAAA,YACAA,EAGA,SAAA8iM,EAAA15B,EAAAD,EAAAs5B,EAAAC,EAAAC,GACA,IAAA3iM,EAAAopK,EAAAq5B,EAAAr5B,EAAAu5B,EAAAF,EAAAE,EAGA,OAFA3iM,EAAA,IACAA,GAAA,YACAA,EAGA,SAAA+iM,EAAA35B,EAAAD,EAAAs5B,EAAAC,EAAAC,EAAAE,GACA,IAAA7iM,EAAAmpK,EAAAu5B,EAAAv5B,EAAA05B,EAAAH,EAAAG,EAGA,OAFA7iM,EAAA,IACAA,GAAA,YACAA,EAGA,SAAAgjM,EAAA55B,EAAAD,GACA,IAIAnpK,EAJAygM,EAAAr3B,EAAAD,EAAA,IACAs3B,EAAAt3B,EAAAC,EAAA,GACAq3B,EAAAt3B,EAAAC,EAAA,GAKA,OAFAppK,EAAA,IACAA,GAAA,YACAA,EAGA,SAAAijM,EAAA75B,EAAAD,GACA,IAIAnpK,EAJA0gM,EAAAt3B,EAAAD,EAAA,IACAu3B,EAAAv3B,EAAAC,EAAA,GACAs3B,EAAAv3B,EAAAC,EAAA,GAKA,OAFAppK,EAAA,IACAA,GAAA,YACAA,EAGA,SAAAkjM,EAAA95B,EAAAD,GACA,IAIAnpK,EAJAygM,EAAAr3B,EAAAD,EAAA,IACAs3B,EAAAr3B,EAAAD,EAAA,IACAs3B,EAAAt3B,EAAAC,EAAA,GAKA,OAFAppK,EAAA,IACAA,GAAA,YACAA,EAGA,SAAAmjM,EAAA/5B,EAAAD,GACA,IAIAnpK,EAJA0gM,EAAAt3B,EAAAD,EAAA,IACAu3B,EAAAt3B,EAAAD,EAAA,IACAu3B,EAAAv3B,EAAAC,EAAA,GAKA,OAFAppK,EAAA,IACAA,GAAA,YACAA,EAGA,SAAAojM,EAAAh6B,EAAAD,GACA,IAIAnpK,EAJAygM,EAAAr3B,EAAAD,EAAA,GACAs3B,EAAAr3B,EAAAD,EAAA,GACAw3B,EAAAv3B,EAAAD,EAAA,GAKA,OAFAnpK,EAAA,IACAA,GAAA,YACAA,EAGA,SAAAqjM,EAAAj6B,EAAAD,GACA,IAIAnpK,EAJA0gM,EAAAt3B,EAAAD,EAAA,GACAu3B,EAAAt3B,EAAAD,EAAA,GACAy3B,EAAAx3B,EAAAD,EAAA,GAKA,OAFAnpK,EAAA,IACAA,GAAA,YACAA,EAGA,SAAAsjM,EAAAl6B,EAAAD,GACA,IAIAnpK,EAJAygM,EAAAr3B,EAAAD,EAAA,IACAs3B,EAAAt3B,EAAAC,EAAA,IACAu3B,EAAAv3B,EAAAD,EAAA,GAKA,OAFAnpK,EAAA,IACAA,GAAA,YACAA,EAGA,SAAAujM,EAAAn6B,EAAAD,GACA,IAIAnpK,EAJA0gM,EAAAt3B,EAAAD,EAAA,IACAu3B,EAAAv3B,EAAAC,EAAA,IACAw3B,EAAAx3B,EAAAD,EAAA,GAKA,OAFAnpK,EAAA,IACAA,GAAA,YACAA,EAxPAuyK,EAAAkS,SAAA4d,EAAAxB,GACAx7S,EAAAC,QAAA+8S,EAEAA,EAAA5uC,UAAA,KACA4uC,EAAAtB,QAAA,IACAsB,EAAArB,aAAA,IACAqB,EAAApB,UAAA,IAEAoB,EAAA1yM,UAAA6zM,cAAA,SAAA/hO,EAAAuF,GAIA,IAHA,IAAA6xI,EAAA7mH,KAAA6mH,EAGA1/I,EAAA,EAAAA,EAAA,GAAAA,IACA0/I,EAAA1/I,GAAAsI,EAAAuF,EAAA7N,GACA,KAAAA,EAAA0/I,EAAA5hJ,OAAAkC,GAAA,EAAA,CACA,IAAAsqO,EAAAH,EAAAzqF,EAAA1/I,EAAA,GAAA0/I,EAAA1/I,EAAA,IACAuqO,EAAAH,EAAA1qF,EAAA1/I,EAAA,GAAA0/I,EAAA1/I,EAAA,IACAwqO,EAAA9qF,EAAA1/I,EAAA,IACAyqO,EAAA/qF,EAAA1/I,EAAA,IACA0qO,EAAAT,EAAAvqF,EAAA1/I,EAAA,IAAA0/I,EAAA1/I,EAAA,KACA2qO,EAAAT,EAAAxqF,EAAA1/I,EAAA,IAAA0/I,EAAA1/I,EAAA,KACA4qO,EAAAlrF,EAAA1/I,EAAA,IACA6qO,EAAAnrF,EAAA1/I,EAAA,IAEA0/I,EAAA1/I,GAAA8mO,EACAwD,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EAAAC,GACAnrF,EAAA1/I,EAAA,GAAAknO,EACAoD,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EAAAC,KAIA3B,EAAA1yM,UAAA8vK,QAAA,SAAAh+L,EAAAuF,GACAgrB,KAAAwxM,cAAA/hO,EAAAuF,GAEA,IAAA6xI,EAAA7mH,KAAA6mH,EAEAsgD,EAAAnnK,KAAAynE,EAAA,GACAmmI,EAAA5tM,KAAAynE,EAAA,GACAomI,EAAA7tM,KAAAynE,EAAA,GACAsmI,EAAA/tM,KAAAynE,EAAA,GACAxmC,EAAAjhC,KAAAynE,EAAA,GACAymI,EAAAluM,KAAAynE,EAAA,GACA0mI,EAAAnuM,KAAAynE,EAAA,GACA2mI,EAAApuM,KAAAynE,EAAA,GACA8mI,EAAAvuM,KAAAynE,EAAA,GACAvyK,EAAA8qG,KAAAynE,EAAA,GACAwqI,EAAAjyM,KAAAynE,EAAA,IACAyqI,EAAAlyM,KAAAynE,EAAA,IACA0qI,EAAAnyM,KAAAynE,EAAA,IACA2qI,EAAApyM,KAAAynE,EAAA,IACA6oF,EAAAtwJ,KAAAynE,EAAA,IACA4qI,EAAAryM,KAAAynE,EAAA,IAEA5uE,EAAAmH,KAAA3rG,EAAA4wE,SAAA4hJ,EAAA5hJ,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA0/I,EAAA5hJ,OAAAkC,GAAA,EAAA,CACA,IAAAsqO,EAAAnhD,EACAohD,EAAAW,EACAV,EAAAT,EAAA3C,EAAAr5S,GACA08S,EAAAT,EAAA5C,EAAAr5S,GACA28S,EAAArB,EAAAjC,EAAAr5S,EAAA+8S,EAAAC,EAAAC,GACAL,EAAAlB,EAAArC,EAAAr5S,EAAA+8S,EAAAC,EAAAC,EAAAC,GACAL,EAAA/xM,KAAA3rG,EAAA8yE,GACA6qO,EAAAhyM,KAAA3rG,EAAA8yE,EAAA,GACAmrO,EAAAzrF,EAAA1/I,GACAorO,EAAA1rF,EAAA1/I,EAAA,GAEAqrO,EAAAlE,EACAmD,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAM,EAAAC,GACAE,EAAAjE,EACAiD,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAC,EAAAC,EACAM,EAAAC,GAEAd,EAAAT,EAAA7pC,EAAAymC,GACA8D,EAAAT,EAAA9pC,EAAAymC,GACA+D,EAAAb,EAAA3pC,EAAAymC,EAAAC,EAAAE,EAAA9sK,GACA2wK,EAAAb,EAAA5pC,EAAAymC,EAAAC,EAAAE,EAAA9sK,EAAAitK,GAEA,IAAAwE,EAAA5E,EAAA2D,EAAAC,EAAAC,EAAAC,GACAe,EAAA3E,EAAAyD,EAAAC,EAAAC,EAAAC,GAEAthD,EAAA6hD,EACAE,EAAAD,EAEAD,EAAAF,EACAG,EAAAF,EAEAD,EAAA1D,EACA2D,EAAAh9S,EAEAq5S,EAAAT,EAAAK,EAAAC,EAAAoE,EAAAC,GACAv9S,EAAA84S,EAAAI,EAAAA,EAAAoE,EAAAC,GAEAtE,EAAAltK,EACAmtK,EAAAF,EAEAjtK,EAAA4sK,EACAK,EAAAH,EAEAF,EAAA1mC,EACA4mC,EAAAH,EAEAzmC,EAAA2mC,EAAA0E,EAAAC,EAAAC,EAAAC,GACA/E,EAAAI,EAAAwE,EAAAC,EAAAC,EAAAC,GAGAhF,EAAA3tM,KAAAynE,EAAA,EAAA0/F,EAAAymC,GACAD,EAAA3tM,KAAAynE,EAAA,EAAAomI,EAAAE,GACAJ,EAAA3tM,KAAAynE,EAAA,EAAAxmC,EAAAitK,GACAP,EAAA3tM,KAAAynE,EAAA,EAAA0mI,EAAAC,GACAT,EAAA3tM,KAAAynE,EAAA,EAAA8mI,EAAAr5S,GACAy4S,EAAA3tM,KAAAynE,EAAA,GAAAwqI,EAAAC,GACAvE,EAAA3tM,KAAAynE,EAAA,GAAA0qI,EAAAC,GACAzE,EAAA3tM,KAAAynE,EAAA,GAAA6oF,EAAA+hD,IAGAhC,EAAA1yM,UAAA0xM,QAAA,SAAA1yE,GACA,MAAA,QAAAA,EACA4jD,EAAA2sB,QAAAltM,KAAAynE,EAAA,OAEA84G,EAAA6sB,QAAAptM,KAAAynE,EAAA,0GCpNA,aAEA,IAAA84G,EAAAhtR,EAAA,WACAq5S,EAAAr5S,EAAA,YAEA+5S,EAAA/sB,EAAA+sB,OACAC,EAAAhtB,EAAAgtB,MACAC,EAAAjtB,EAAAitB,QACAC,EAAAltB,EAAAktB,QACAoB,EAAAjC,EAAAiC,UAEA,SAAA+D,IACA,KAAA5yM,gBAAA4yM,GACA,OAAA,IAAAA,EAEA/D,EAAAjxM,KAAAoC,MAEAA,KAAAynE,EAAA,CAAA,WAAA,WAAA,WAAA,UAAA,YACAznE,KAAA6yL,OAAA,SA0DA,SAAAnxI,EAAApwD,EAAAsc,EAAAC,EAAA03G,GACA,OAAAj0H,GAAA,GACAsc,EAAAC,EAAA03G,EACAj0H,GAAA,GACAsc,EAAAC,GAAAD,EAAA23G,EACAj0H,GAAA,IACAsc,GAAAC,GAAA03G,EACAj0H,GAAA,GACAsc,EAAA23G,EAAA13G,GAAA03G,EAEA33G,GAAAC,GAAA03G,GAGA,SAAAqqD,EAAAt+K,GACA,OAAAA,GAAA,GACA,EACAA,GAAA,GACA,WACAA,GAAA,GACA,WACAA,GAAA,GACA,WAEA,WAGA,SAAAuhN,EAAAvhN,GACA,OAAAA,GAAA,GACA,WACAA,GAAA,GACA,WACAA,GAAA,GACA,WACAA,GAAA,GACA,WAEA,EA5FAivL,EAAAkS,SAAAmgB,EAAA/D,GACAv7S,EAAAw5S,UAAA8F,EAEAA,EAAAnxC,UAAA,IACAmxC,EAAA7D,QAAA,IACA6D,EAAA5D,aAAA,IACA4D,EAAA3D,UAAA,GAEA2D,EAAAj1M,UAAA8vK,QAAA,SAAAh+L,EAAAuF,GAWA,IAVA,IAAAsvI,EAAAtkH,KAAAynE,EAAA,GACAy7C,EAAAljH,KAAAynE,EAAA,GACAm9C,EAAA5kH,KAAAynE,EAAA,GACAm+C,EAAA5lH,KAAAynE,EAAA,GACA29C,EAAAplH,KAAAynE,EAAA,GACAqrI,EAAAxuF,EACAyuF,EAAA7vF,EACA8vF,EAAApuF,EACAquF,EAAArtF,EACAstF,EAAA9tF,EACA9zH,EAAA,EAAAA,EAAA,GAAAA,IAAA,CACA,IAAAq0H,EAAA4nF,EACAD,EACAG,EAAAnpF,EAAA5iE,EAAApwD,EAAA4xH,EAAA0B,EAAAgB,GAAAn2I,EAAAu+B,EAAA1c,GAAAtc,GAAA46L,EAAAt+K,IACApV,EAAAoV,IACA8zH,GACAd,EAAAc,EACAA,EAAAQ,EACAA,EAAA0nF,EAAA1oF,EAAA,IACAA,EAAA1B,EACAA,EAAAyC,EACAA,EAAA4nF,EACAD,EACAG,EAAAqF,EAAApxJ,EAAA,GAAApwD,EAAAyhN,EAAAC,EAAAC,GAAAxjO,EAAA0jO,EAAA7hN,GAAAtc,GAAA69N,EAAAvhN,IACA6oL,EAAA7oL,IACA4hN,GACAJ,EAAAI,EACAA,EAAAD,EACAA,EAAA3F,EAAA0F,EAAA,IACAA,EAAAD,EACAA,EAAAptF,EAEAA,EAAA6nF,EAAAxtM,KAAAynE,EAAA,GAAAm9C,EAAAquF,GACAjzM,KAAAynE,EAAA,GAAA+lI,EAAAxtM,KAAAynE,EAAA,GAAAm+C,EAAAstF,GACAlzM,KAAAynE,EAAA,GAAA+lI,EAAAxtM,KAAAynE,EAAA,GAAA29C,EAAA0tF,GACA9yM,KAAAynE,EAAA,GAAA+lI,EAAAxtM,KAAAynE,EAAA,GAAA68C,EAAAyuF,GACA/yM,KAAAynE,EAAA,GAAA+lI,EAAAxtM,KAAAynE,EAAA,GAAAy7C,EAAA8vF,GACAhzM,KAAAynE,EAAA,GAAAk+C,GAGAitF,EAAAj1M,UAAA0xM,QAAA,SAAA1yE,GACA,MAAA,QAAAA,EACA4jD,EAAA2sB,QAAAltM,KAAAynE,EAAA,UAEA84G,EAAA6sB,QAAAptM,KAAAynE,EAAA,WA0CA,IAAAz5D,EAAA,CACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GACA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EACA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GACA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,IAGAmlM,EAAA,CACA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EACA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GACA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,IAGAj3N,EAAA,CACA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GACA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EACA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAGAi+L,EAAA,CACA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EACA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GACA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EACA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EACA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,sEChJA,aAEA,IAAAoG,EAAAhtR,EAAA,WACAslG,EAAAtlG,EAAA,uBAEA,SAAA6/S,EAAA//L,EAAAr+G,EAAA2nO,GACA,KAAA38H,gBAAAozM,GACA,OAAA,IAAAA,EAAA//L,EAAAr+G,EAAA2nO,GACA38H,KAAAqzM,KAAAhgM,EACArT,KAAAyhK,UAAApuJ,EAAAouJ,UAAA,EACAzhK,KAAA+uM,QAAA17L,EAAA07L,QAAA,EACA/uM,KAAAihD,MAAA,KACAjhD,KAAAi2G,MAAA,KAEAj2G,KAAA+hK,MAAAwe,EAAAp9K,QAAAnuG,EAAA2nO,IAEAtpO,EAAAC,QAAA8/S,EAEAA,EAAAz1M,UAAAokK,MAAA,SAAA/sQ,GAEAA,EAAAiwE,OAAA+6B,KAAAyhK,YACAzsQ,GAAA,IAAAgrG,KAAAqzM,MAAA19I,OAAA3gK,GAAAkkO,UACArgI,EAAA7jG,EAAAiwE,QAAA+6B,KAAAyhK,WAGA,IAAA,IAAAt6L,EAAAnyE,EAAAiwE,OAAAkC,EAAA64B,KAAAyhK,UAAAt6L,IACAnyE,EAAA81E,KAAA,GAEA,IAAA3D,EAAA,EAAAA,EAAAnyE,EAAAiwE,OAAAkC,IACAnyE,EAAAmyE,IAAA,GAIA,IAHA64B,KAAAihD,OAAA,IAAAjhD,KAAAqzM,MAAA19I,OAAA3gK,GAGAmyE,EAAA,EAAAA,EAAAnyE,EAAAiwE,OAAAkC,IACAnyE,EAAAmyE,IAAA,IACA64B,KAAAi2G,OAAA,IAAAj2G,KAAAqzM,MAAA19I,OAAA3gK,IAGAo+S,EAAAz1M,UAAAg4D,OAAA,SAAAlmF,EAAAktJ,GAEA,OADA38H,KAAAihD,MAAA0U,OAAAlmF,EAAAktJ,GACA38H,MAGAozM,EAAAz1M,UAAAu7H,OAAA,SAAAyD,GAEA,OADA38H,KAAAi2G,MAAAtgD,OAAA31D,KAAAihD,MAAAi4E,UACAl5H,KAAAi2G,MAAAijB,OAAAyD,iFC7CAtpO,EAAAC,QAAA,CACA6wS,QAAA,CACAE,KAAA,EACAK,OAAA,CACA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,kEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,kEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,kEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,kEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,kEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,sEAIAnT,IAAA,CACAsR,IAAA,EACA6B,OAAA,CACA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,kEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,kEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,kEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,kEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,iEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,kEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,mEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,oEAEA,CACA,mEACA,qGCvwBA,aAEA,IAAA3W,EAAAx6R,EAAA,SACA+/S,EAAA//S,EAAA,aACAgtR,EAAAhtR,EAAA,YACA09R,EAAA19R,EAAA,aACAy9R,EAAAz9R,EAAA,WACAslG,EAAA0nL,EAAA1nL,OAEA06M,EAAAhgT,EAAA,SACAigT,EAAAjgT,EAAA,eAEA,SAAAq6R,EAAAj5R,GACA,KAAAqrG,gBAAA4tL,GACA,OAAA,IAAAA,EAAAj5R,GAGA,iBAAAA,IACAkkG,EAAArlG,OAAAmqG,UAAAnD,eAAAoD,KAAAqzL,EAAAt8R,GACA,iBAAAA,GAEAA,EAAAs8R,EAAAt8R,IAIAA,aAAAs8R,EAAAyb,cACA/3S,EAAA,CAAAm5R,MAAAn5R,IAEAqrG,KAAA8tL,MAAAn5R,EAAAm5R,MAAAA,MACA9tL,KAAA/rG,EAAA+rG,KAAA8tL,MAAA75R,EACA+rG,KAAA6vL,GAAA7vL,KAAA/rG,EAAAiqS,MAAA,GACAl+L,KAAAokH,EAAApkH,KAAA8tL,MAAA1pE,EAGApkH,KAAAokH,EAAAzvN,EAAAm5R,MAAA1pE,EACApkH,KAAAokH,EAAAyhF,WAAAlxS,EAAAm5R,MAAA75R,EAAAg9Q,YAAA,GAGAjxK,KAAAqT,KAAA1+G,EAAA0+G,MAAA1+G,EAAAm5R,MAAAz6K,KAEAhgH,EAAAC,QAAAs6R,EAEAA,EAAAjwL,UAAA8wL,QAAA,SAAA95R,GACA,OAAA,IAAA4+S,EAAAvzM,KAAArrG,IAGAi5R,EAAAjwL,UAAA6xL,eAAA,SAAA7a,EAAAh4C,GACA,OAAA42E,EAAAE,YAAAzzM,KAAA20K,EAAAh4C,IAGAixD,EAAAjwL,UAAA+1M,cAAA,SAAAr4E,EAAAsB,GACA,OAAA42E,EAAAI,WAAA3zM,KAAAq7H,EAAAsB,IAGAixD,EAAAjwL,UAAAi2M,WAAA,SAAAj/S,GACAA,IACAA,EAAA,IAcA,IAXA,IAAAk/S,EAAA,IAAAP,EAAA,CACAjgM,KAAArT,KAAAqT,KACAi9K,KAAA37R,EAAA27R,KACAwjB,QAAAn/S,EAAAm/S,SAAA,OACArlC,QAAA95Q,EAAA85Q,SAAAuiB,EAAAhxL,KAAAqT,KAAA27L,cACA+E,WAAAp/S,EAAA85Q,SAAA95Q,EAAAo/S,YAAA,OACAx0B,MAAAv/K,KAAA/rG,EAAAkvG,YAGAw1H,EAAA34H,KAAA/rG,EAAAmqO,aACA41E,EAAAh0M,KAAA/rG,EAAAq9H,IAAA,IAAAy8J,EAAA,MACA,CACA,IAAApZ,EAAA,IAAAoZ,EAAA8lB,EAAA/tN,SAAA6yI,IACA,KAAAg8C,EAAAxtK,IAAA6sM,GAAA,GAIA,OADAr/B,EAAA2gB,MAAA,GACAt1L,KAAAwvL,eAAA7a,KAIAiZ,EAAAjwL,UAAAs2M,aAAA,SAAAxkO,EAAAykO,GACA,IAAA3oL,EAAA,EAAA97C,EAAA2uJ,aAAAp+H,KAAA/rG,EAAAg9Q,YAGA,OAFA1lJ,EAAA,IACA97C,EAAAA,EAAAyuN,MAAA3yK,KACA2oL,GAAAzkO,EAAA03B,IAAAnH,KAAA/rG,IAAA,EACAw7E,EAAA6hD,IAAAtxB,KAAA/rG,GAEAw7E,GAGAm+M,EAAAjwL,UAAA2qJ,KAAA,SAAA74K,EAAAz6E,EAAA2nO,EAAAhoO,GACA,iBAAAgoO,IACAhoO,EAAAgoO,EACAA,EAAA,MAEAhoO,IACAA,EAAA,IAEAK,EAAAgrG,KAAAwvL,eAAAx6R,EAAA2nO,GACAltJ,EAAAuwB,KAAAi0M,aAAA,IAAAlmB,EAAAt+M,EAAA,KAqBA,IAlBA,IAAAkpJ,EAAA34H,KAAA/rG,EAAAmqO,aACA+1E,EAAAn/S,EAAAo/S,aAAAjxM,QAAA,KAAAw1H,GAGA4mD,EAAA9vM,EAAA0zB,QAAA,KAAAw1H,GAGAk7E,EAAA,IAAAP,EAAA,CACAjgM,KAAArT,KAAAqT,KACAo7J,QAAA0lC,EACA50B,MAAAA,EACA+Q,KAAA37R,EAAA27R,KACAwjB,QAAAn/S,EAAAm/S,SAAA,SAIAO,EAAAr0M,KAAA/rG,EAAAq9H,IAAA,IAAAy8J,EAAA,IAEAr9D,EAAA,GAAAA,IAAA,CACA,IAAAr8N,EAAAM,EAAAN,EACAM,EAAAN,EAAAq8N,GACA,IAAAq9D,EAAA8lB,EAAA/tN,SAAAka,KAAA/rG,EAAAmqO,eAEA,MADA/pO,EAAA2rG,KAAAi0M,aAAA5/S,GAAA,IACA29R,KAAA,IAAA,GAAA39R,EAAA8yG,IAAAktM,IAAA,GAAA,CAGA,IAAAC,EAAAt0M,KAAAokH,EAAAwrE,IAAAv7R,GACA,IAAAigT,EAAA3kB,aAAA,CAGA,IAAA4kB,EAAAD,EAAAzjB,OACA7iL,EAAAumM,EAAArlB,KAAAlvL,KAAA/rG,GACA,GAAA,IAAA+5G,EAAAgkL,KAAA,GAAA,CAGA,IAAA91M,EAAA7nF,EAAAmrS,KAAAx/L,KAAA/rG,GAAA27R,IAAA5hL,EAAA4hL,IAAA56R,EAAAo/S,cAAAhlB,KAAA3/M,IAEA,GAAA,KADAyM,EAAAA,EAAAgzM,KAAAlvL,KAAA/rG,IACA+9R,KAAA,GAAA,CAGA,IAAAzB,GAAA+jB,EAAAxjB,OAAAvC,QAAA,EAAA,IACA,IAAAgmB,EAAAptM,IAAA6G,GAAA,EAAA,GAQA,OALAr5G,EAAA07R,WAAAn0M,EAAAirB,IAAAnH,KAAA6vL,IAAA,IACA3zM,EAAA8jB,KAAA/rG,EAAAq9H,IAAAp1C,GACAq0M,GAAA,GAGA,IAAAijB,EAAA,CAAAxlM,EAAAA,EAAA9xB,EAAAA,EAAAq0M,cAAAA,UAIA3C,EAAAjwL,UAAAg4K,OAAA,SAAAlmM,EAAAwX,EAAAjyF,EAAA2nO,GACAltJ,EAAAuwB,KAAAi0M,aAAA,IAAAlmB,EAAAt+M,EAAA,KACAz6E,EAAAgrG,KAAA0zM,cAAA1+S,EAAA2nO,GAIA,IAAA3uH,GAHA/mB,EAAA,IAAAusN,EAAAvsN,EAAA,QAGA+mB,EACA9xB,EAAA+K,EAAA/K,EACA,GAAA8xB,EAAAgkL,KAAA,GAAA,GAAAhkL,EAAA7G,IAAAnH,KAAA/rG,IAAA,EACA,OAAA,EACA,GAAAioF,EAAA81M,KAAA,GAAA,GAAA91M,EAAAirB,IAAAnH,KAAA/rG,IAAA,EACA,OAAA,EAGA,IAGAizE,EAHAstO,EAAAt4N,EAAAsjN,KAAAx/L,KAAA/rG,GACAg+R,EAAAuiB,EAAA5kB,IAAAngN,GAAAy/M,KAAAlvL,KAAA/rG,GACAi+R,EAAAsiB,EAAA5kB,IAAA5hL,GAAAkhL,KAAAlvL,KAAA/rG,GAGA,OAAA+rG,KAAA8tL,MAAAiW,gBAWA78N,EAAA84B,KAAAokH,EAAA0kF,QAAA7W,EAAAj9R,EAAAy6R,YAAAyC,IACAvC,cAMAzoN,EAAAkkO,OAAAp9L,KAjBA9mC,EAAA84B,KAAAokH,EAAAykF,OAAA5W,EAAAj9R,EAAAy6R,YAAAyC,IACAvC,cAGA,IAAAzoN,EAAA2pN,OAAA3B,KAAAlvL,KAAA/rG,GAAAkzG,IAAA6G,IAgBA4/K,EAAAjwL,UAAAgzL,cAAA,SAAAlhN,EAAAwX,EAAAqK,EAAAqrI,GACA9jI,GAAA,EAAAvH,KAAAA,EAAA,4CACArK,EAAA,IAAAusN,EAAAvsN,EAAA01I,GAEA,IAAA1oO,EAAA+rG,KAAA/rG,EACAF,EAAA,IAAAg6R,EAAAt+M,GACAu+B,EAAA/mB,EAAA+mB,EACA9xB,EAAA+K,EAAA/K,EAGAu4N,EAAA,EAAAnjN,EACAojN,EAAApjN,GAAA,EACA,GAAA0c,EAAA7G,IAAAnH,KAAA8tL,MAAA5mN,EAAAgoN,KAAAlvL,KAAA8tL,MAAA75R,KAAA,GAAAygT,EACA,MAAA,IAAA57M,MAAA,wCAIAkV,EADA0mM,EACA10M,KAAA8tL,MAAA4X,WAAA13L,EAAAhvB,IAAAghB,KAAA8tL,MAAA75R,GAAAwgT,GAEAz0M,KAAA8tL,MAAA4X,WAAA13L,EAAAymM,GAEA,IAAAE,EAAA1tN,EAAA+mB,EAAAwxL,KAAAvrS,GACA4hM,EAAA5hM,EAAAq9H,IAAAv9H,GAAA67R,IAAA+kB,GAAAzlB,KAAAj7R,GACA6hM,EAAA55G,EAAA0zM,IAAA+kB,GAAAzlB,KAAAj7R,GAIA,OAAA+rG,KAAAokH,EAAAykF,OAAAhzG,EAAA7nF,EAAA8nF,IAGA83F,EAAAjwL,UAAAi3M,oBAAA,SAAA7gT,EAAAkzF,EAAA4tN,EAAAl4E,GAEA,GAAA,QADA11I,EAAA,IAAAusN,EAAAvsN,EAAA01I,IACA4zD,cACA,OAAAtpM,EAAAspM,cAEA,IAAA,IAAAppN,EAAA,EAAAA,EAAA,EAAAA,IAAA,CACA,IAAA2tO,EACA,IACAA,EAAA90M,KAAA2wL,cAAA58R,EAAAkzF,EAAA9f,GACA,MAAApzE,GACA,SAGA,GAAA+gT,EAAAvhM,GAAAshM,GACA,OAAA1tO,EAEA,MAAA,IAAA2xB,MAAA,uMCjPA,aAEA,IAAAua,EAAA9/G,EAAA,WACAgtR,EAAAhtR,EAAA,6BACAslG,EAAAtlG,EAAA,uBAEA,SAAA+/S,EAAA3+S,GACA,KAAAqrG,gBAAAszM,GACA,OAAA,IAAAA,EAAA3+S,GACAqrG,KAAAqT,KAAA1+G,EAAA0+G,KACArT,KAAA+0M,aAAApgT,EAAAogT,WAEA/0M,KAAAuiM,OAAAviM,KAAAqT,KAAA07L,QACA/uM,KAAAg1M,WAAArgT,EAAAqgT,YAAAh1M,KAAAqT,KAAA27L,aAEAhvM,KAAA8uK,QAAA,KACA9uK,KAAAi1M,eAAA,KACAj1M,KAAA4vK,EAAA,KACA5vK,KAAAk1M,EAAA,KAEA,IAAAzmC,EAAA8R,EAAAp9K,QAAAxuG,EAAA85Q,QAAA95Q,EAAAo/S,YAAA,OACAx0B,EAAAgB,EAAAp9K,QAAAxuG,EAAA4qR,MAAA5qR,EAAAwgT,UAAA,OACA7kB,EAAA/P,EAAAp9K,QAAAxuG,EAAA27R,KAAA37R,EAAAm/S,SAAA,OACAj7M,EAAA41K,EAAAxpM,QAAA+6B,KAAAg1M,WAAA,EACA,mCAAAh1M,KAAAg1M,WAAA,SACAh1M,KAAA+hK,MAAA0M,EAAA8Q,EAAA+Q,GAEAj9R,EAAAC,QAAAggT,EAEAA,EAAA31M,UAAAokK,MAAA,SAAA0M,EAAA8Q,EAAA+Q,GACA,IAAA/vC,EAAAkuB,EAAA58K,OAAA0tL,GAAA1tL,OAAAy+L,GAEAtwL,KAAA4vK,EAAA,IAAA/xK,MAAAmC,KAAAuiM,OAAA,GACAviM,KAAAk1M,EAAA,IAAAr3M,MAAAmC,KAAAuiM,OAAA,GACA,IAAA,IAAAp7N,EAAA,EAAAA,EAAA64B,KAAAk1M,EAAAjwO,OAAAkC,IACA64B,KAAA4vK,EAAAzoM,GAAA,EACA64B,KAAAk1M,EAAA/tO,GAAA,EAGA64B,KAAAytK,QAAAltB,GACAvgJ,KAAA8uK,QAAA,EACA9uK,KAAAi1M,eAAA,iBAGA3B,EAAA31M,UAAAy3M,MAAA,WACA,OAAA,IAAA/hM,EAAAy2J,KAAA9pK,KAAAqT,KAAArT,KAAA4vK,IAGA0jC,EAAA31M,UAAA8vK,QAAA,SAAAltB,GACA,IAAA80D,EAAAr1M,KAAAo1M,QACAz/I,OAAA31D,KAAAk1M,GACAv/I,OAAA,CAAA,IACA4qF,IACA80D,EAAAA,EAAA1/I,OAAA4qF,IACAvgJ,KAAA4vK,EAAAylC,EAAAn8E,SACAl5H,KAAAk1M,EAAAl1M,KAAAo1M,QAAAz/I,OAAA31D,KAAAk1M,GAAAh8E,SACAqnB,IAGAvgJ,KAAA4vK,EAAA5vK,KAAAo1M,QACAz/I,OAAA31D,KAAAk1M,GACAv/I,OAAA,CAAA,IACAA,OAAA4qF,GACArnB,SACAl5H,KAAAk1M,EAAAl1M,KAAAo1M,QAAAz/I,OAAA31D,KAAAk1M,GAAAh8E,WAGAo6E,EAAA31M,UAAA23M,OAAA,SAAA7mC,EAAAslC,EAAA/0N,EAAAu2N,GAEA,iBAAAxB,IACAwB,EAAAv2N,EACAA,EAAA+0N,EACAA,EAAA,MAGAtlC,EAAA8R,EAAAp9K,QAAAsrK,EAAAslC,GACA/0N,EAAAuhM,EAAAp9K,QAAAnkB,EAAAu2N,GAEA18M,EAAA41K,EAAAxpM,QAAA+6B,KAAAg1M,WAAA,EACA,mCAAAh1M,KAAAg1M,WAAA,SAEAh1M,KAAAytK,QAAAgB,EAAA58K,OAAA7S,GAAA,KACAghB,KAAA8uK,QAAA,GAGAwkC,EAAA31M,UAAA7X,SAAA,SAAAsd,EAAAu5H,EAAA39I,EAAAu2N,GACA,GAAAv1M,KAAA8uK,QAAA9uK,KAAAi1M,eACA,MAAA,IAAAn8M,MAAA,sBAGA,iBAAA6jI,IACA44E,EAAAv2N,EACAA,EAAA29I,EACAA,EAAA,MAIA39I,IACAA,EAAAuhM,EAAAp9K,QAAAnkB,EAAAu2N,GAAA,OACAv1M,KAAAytK,QAAAzuL,IAIA,IADA,IAAAysB,EAAA,GACAA,EAAAxmC,OAAAm+B,GACApD,KAAAk1M,EAAAl1M,KAAAo1M,QAAAz/I,OAAA31D,KAAAk1M,GAAAh8E,SACAztH,EAAAA,EAAA5Z,OAAAmO,KAAAk1M,GAGA,IAAAnpO,EAAA0/B,EAAArmC,MAAA,EAAAg+B,GAGA,OAFApD,KAAAytK,QAAAzuL,GACAghB,KAAA8uK,UACAyR,EAAAj9K,OAAAv3B,EAAA4wJ,qHC/GA,aAEA,IAAAoxD,EAAAx6R,EAAA,SAEAslG,EADAtlG,EAAA,YACAslG,OAEA,SAAA06M,EAAA3pO,EAAAj1E,GACAqrG,KAAAp2B,GAAAA,EACAo2B,KAAA20K,KAAA,KACA30K,KAAAq7H,IAAA,KAGA1mO,EAAAggR,MACA30K,KAAAw1M,eAAA7gT,EAAAggR,KAAAhgR,EAAA8gT,SACA9gT,EAAA0mO,KACAr7H,KAAA01M,cAAA/gT,EAAA0mO,IAAA1mO,EAAAghT,QAEAtiT,EAAAC,QAAAigT,EAEAA,EAAAI,WAAA,SAAA/pO,EAAAyxJ,EAAAsB,GACA,OAAAtB,aAAAk4E,EACAl4E,EAEA,IAAAk4E,EAAA3pO,EAAA,CACAyxJ,IAAAA,EACAs6E,OAAAh5E,KAIA42E,EAAAE,YAAA,SAAA7pO,EAAA+qM,EAAAh4C,GACA,OAAAg4C,aAAA4+B,EACA5+B,EAEA,IAAA4+B,EAAA3pO,EAAA,CACA+qM,KAAAA,EACA8gC,QAAA94E,KAIA42E,EAAA51M,UAAAs+H,SAAA,WACA,IAAAZ,EAAAr7H,KAAAyvL,YAEA,OAAAp0D,EAAAs0D,aACA,CAAA/kN,QAAA,EAAAgrO,OAAA,sBACAv6E,EAAAY,WAEAZ,EAAAu0D,IAAA5vL,KAAAp2B,GAAAkkN,MAAA75R,GAAA07R,aAGA,CAAA/kN,QAAA,EAAAgrO,OAAA,MAFA,CAAAhrO,QAAA,EAAAgrO,OAAA,uBAFA,CAAAhrO,QAAA,EAAAgrO,OAAA,8BAOArC,EAAA51M,UAAA8xL,UAAA,SAAAv6B,EAAAv4B,GAUA,MARA,iBAAAu4B,IACAv4B,EAAAu4B,EACAA,EAAA,MAGAl1J,KAAAq7H,MACAr7H,KAAAq7H,IAAAr7H,KAAAp2B,GAAAw6I,EAAAwrE,IAAA5vL,KAAA20K,OAEAh4C,EAGA38H,KAAAq7H,IAAA/3H,OAAAq5H,EAAAu4B,GAFAl1J,KAAAq7H,KAKAk4E,EAAA51M,UAAAy2M,WAAA,SAAAz3E,GACA,MAAA,QAAAA,EACA38H,KAAA20K,KAAAv2K,SAAA,GAAA,GAEA4B,KAAA20K,MAGA4+B,EAAA51M,UAAA63M,eAAA,SAAAxgT,EAAA2nO,GACA38H,KAAA20K,KAAA,IAAAoZ,EAAA/4R,EAAA2nO,GAAA,IAIA38H,KAAA20K,KAAA30K,KAAA20K,KAAAua,KAAAlvL,KAAAp2B,GAAAkkN,MAAA75R,IAGAs/S,EAAA51M,UAAA+3M,cAAA,SAAA1gT,EAAA2nO,GACA,GAAA3nO,EAAA44G,GAAA54G,EAAA64G,EAWA,MAPA,SAAA7N,KAAAp2B,GAAAkkN,MAAAhnN,KACA+xB,EAAA7jG,EAAA44G,EAAA,qBACA,UAAA5N,KAAAp2B,GAAAkkN,MAAAhnN,MACA,YAAAk5B,KAAAp2B,GAAAkkN,MAAAhnN,MACA+xB,EAAA7jG,EAAA44G,GAAA54G,EAAA64G,EAAA,qCAEA7N,KAAAq7H,IAAAr7H,KAAAp2B,GAAAkkN,MAAAkB,MAAAh6R,EAAA44G,EAAA54G,EAAA64G,IAGA7N,KAAAq7H,IAAAr7H,KAAAp2B,GAAAkkN,MAAA2X,YAAAzwS,EAAA2nO,IAIA42E,EAAA51M,UAAAk4M,OAAA,SAAAx6E,GAIA,OAHAA,EAAAY,YACApjI,EAAAwiI,EAAAY,WAAA,8BAEAZ,EAAAu0D,IAAA5vL,KAAA20K,MAAAkc,QAIA0iB,EAAA51M,UAAA2qJ,KAAA,SAAA74K,EAAAktJ,EAAAhoO,GACA,OAAAqrG,KAAAp2B,GAAA0+K,KAAA74K,EAAAuwB,KAAA28H,EAAAhoO,IAGA4+S,EAAA51M,UAAAg4K,OAAA,SAAAlmM,EAAAwX,GACA,OAAA+Y,KAAAp2B,GAAA+rM,OAAAlmM,EAAAwX,EAAA+Y,OAGAuzM,EAAA51M,UAAAs2L,QAAA,WACA,MAAA,eAAAj0L,KAAA20K,MAAA30K,KAAA20K,KAAAv2K,SAAA,GAAA,IACA,UAAA4B,KAAAq7H,KAAAr7H,KAAAq7H,IAAA44D,WAAA,sECvHA,aAEA,IAAAlG,EAAAx6R,EAAA,SAEAgtR,EAAAhtR,EAAA,YACAslG,EAAA0nL,EAAA1nL,OAEA,SAAA26M,EAAA7+S,EAAAgoO,GACA,GAAAhoO,aAAA6+S,EACA,OAAA7+S,EAEAqrG,KAAA81M,WAAAnhT,EAAAgoO,KAGA9jI,EAAAlkG,EAAAq5G,GAAAr5G,EAAAunF,EAAA,4BACA8jB,KAAAgO,EAAA,IAAA+/K,EAAAp5R,EAAAq5G,EAAA,IACAhO,KAAA9jB,EAAA,IAAA6xM,EAAAp5R,EAAAunF,EAAA,SACAxmF,IAAAf,EAAA47R,cACAvwL,KAAAuwL,cAAA,KAEAvwL,KAAAuwL,cAAA57R,EAAA47R,eAIA,SAAAn5K,IACApX,KAAA+1M,MAAA,EAGA,SAAAC,EAAAzlF,EAAArpJ,GACA,IAAA+uO,EAAA1lF,EAAArpJ,EAAA6uO,SACA,KAAA,IAAAE,GACA,OAAAA,EAEA,IAAAC,EAAA,GAAAD,EAGA,GAAA,IAAAC,GAAAA,EAAA,EACA,OAAA,EAIA,IADA,IAAAv8M,EAAA,EACAxyB,EAAA,EAAAouJ,EAAAruJ,EAAA6uO,MAAA5uO,EAAA+uO,EAAA/uO,IAAAouJ,IACA57H,IAAA,EACAA,GAAA42H,EAAAgF,GACA57H,KAAA,EAIA,QAAAA,GAAA,OAIAzyB,EAAA6uO,MAAAxgF,EACA57H,GAGA,SAAAw8M,EAAA5lF,GAGA,IAFA,IAAAppJ,EAAA,EACAi8B,EAAAmtH,EAAAtrJ,OAAA,GACAsrJ,EAAAppJ,MAAA,IAAAopJ,EAAAppJ,EAAA,KAAAA,EAAAi8B,GACAj8B,IAEA,OAAA,IAAAA,EACAopJ,EAEAA,EAAAnrJ,MAAA+B,GA4DA,SAAAivO,EAAAx5M,EAAAwG,GACA,GAAAA,EAAA,IACAxG,EAAA9xB,KAAAs4B,OADA,CAIA,IAAAizM,EAAA,GAAAzwO,KAAAymJ,IAAAjpH,GAAAx9B,KAAA2iL,MAAA,GAEA,IADA3rJ,EAAA9xB,KAAA,IAAAurO,KACAA,GACAz5M,EAAA9xB,KAAAs4B,KAAAizM,GAAA,GAAA,KAEAz5M,EAAA9xB,KAAAs4B,IAjHA/vG,EAAAC,QAAAkgT,EA8CAA,EAAA71M,UAAAm4M,WAAA,SAAAppJ,EAAAiwE,GACAjwE,EAAA6zH,EAAAp9K,QAAAupD,EAAAiwE,GACA,IAAAz1J,EAAA,IAAAkwC,EACA,GAAA,KAAAs1C,EAAAxlF,EAAA6uO,SACA,OAAA,EAEA,IAAA3yM,EAAA4yM,EAAAtpJ,EAAAxlF,GACA,IAAA,IAAAk8B,EACA,OAAA,EAEA,GAAAA,EAAAl8B,EAAA6uO,QAAArpJ,EAAAznF,OACA,OAAA,EAEA,GAAA,IAAAynF,EAAAxlF,EAAA6uO,SACA,OAAA,EAEA,IAAA3T,EAAA4T,EAAAtpJ,EAAAxlF,GACA,IAAA,IAAAk7N,EACA,OAAA,EAEA,IAAAp0L,EAAA0+C,EAAAtnF,MAAA8B,EAAA6uO,MAAA3T,EAAAl7N,EAAA6uO,OAEA,GADA7uO,EAAA6uO,OAAA3T,EACA,IAAA11I,EAAAxlF,EAAA6uO,SACA,OAAA,EAEA,IAAAO,EAAAN,EAAAtpJ,EAAAxlF,GACA,IAAA,IAAAovO,EACA,OAAA,EAEA,GAAA5pJ,EAAAznF,SAAAqxO,EAAApvO,EAAA6uO,MACA,OAAA,EAEA,IAAA75N,EAAAwwE,EAAAtnF,MAAA8B,EAAA6uO,MAAAO,EAAApvO,EAAA6uO,OACA,GAAA,IAAA/nM,EAAA,GAAA,CACA,KAAA,IAAAA,EAAA,IAIA,OAAA,EAHAA,EAAAA,EAAA5oC,MAAA,GAMA,GAAA,IAAA8W,EAAA,GAAA,CACA,KAAA,IAAAA,EAAA,IAIA,OAAA,EAHAA,EAAAA,EAAA9W,MAAA,GAWA,OAJA46B,KAAAgO,EAAA,IAAA+/K,EAAA//K,GACAhO,KAAA9jB,EAAA,IAAA6xM,EAAA7xM,GACA8jB,KAAAuwL,cAAA,MAEA,GAgBAijB,EAAA71M,UAAA44M,MAAA,SAAA55E,GACA,IAAA3uH,EAAAhO,KAAAgO,EAAA7K,UACAjnB,EAAA8jB,KAAA9jB,EAAAinB,UAYA,IATA,IAAA6K,EAAA,KACAA,EAAA,CAAA,GAAAnc,OAAAmc,IAEA,IAAA9xB,EAAA,KACAA,EAAA,CAAA,GAAA2V,OAAA3V,IAEA8xB,EAAAmoM,EAAAnoM,GACA9xB,EAAAi6N,EAAAj6N,KAEAA,EAAA,IAAA,IAAAA,EAAA,KACAA,EAAAA,EAAA9W,MAAA,GAEA,IAAAw3B,EAAA,CAAA,GACAw5M,EAAAx5M,EAAAoR,EAAA/oC,SACA23B,EAAAA,EAAA/K,OAAAmc,IACAljC,KAAA,GACAsrO,EAAAx5M,EAAA1gB,EAAAjX,QACA,IAAAuxO,EAAA55M,EAAA/K,OAAA3V,GACAnQ,EAAA,CAAA,IAGA,OAFAqqO,EAAArqO,EAAAyqO,EAAAvxO,QACA8G,EAAAA,EAAA8lB,OAAA2kN,GACAj2B,EAAAj9K,OAAAv3B,EAAA4wJ,oECpKA,aAEA,IAAAtpH,EAAA9/G,EAAA,WACA09R,EAAA19R,EAAA,aACAgtR,EAAAhtR,EAAA,YACAslG,EAAA0nL,EAAA1nL,OACA05L,EAAAhS,EAAAgS,WACAghB,EAAAhgT,EAAA,SACAigT,EAAAjgT,EAAA,eAEA,SAAAkjT,EAAA3oB,GAGA,GAFAj1L,EAAA,YAAAi1L,EAAA,qCAEA9tL,gBAAAy2M,GACA,OAAA,IAAAA,EAAA3oB,GAEAA,EAAAmD,EAAAnD,GAAAA,MACA9tL,KAAA8tL,MAAAA,EACA9tL,KAAAokH,EAAA0pE,EAAA1pE,EACApkH,KAAAokH,EAAAyhF,WAAA/X,EAAA75R,EAAAg9Q,YAAA,GAEAjxK,KAAA02M,WAAA5oB,EAAAkB,QAAAriL,YACA3M,KAAAk/H,eAAAt5J,KAAAwhL,KAAA0mC,EAAA75R,EAAAg9Q,YAAA,GACAjxK,KAAAqT,KAAAA,EAAAiqJ,OAGAjqQ,EAAAC,QAAAmjT,EAOAA,EAAA94M,UAAA2qJ,KAAA,SAAA3uK,EAAAg9N,GACAh9N,EAAA44M,EAAA54M,GACA,IAAA3kF,EAAAgrG,KAAA42M,cAAAD,GACA3oM,EAAAhO,KAAA62M,QAAA7hT,EAAA8hT,gBAAAn9N,GACA6qI,EAAAxkH,KAAAokH,EAAAwrE,IAAA5hL,GACA+oM,EAAA/2M,KAAAg3M,YAAAxyF,GACAyyF,EAAAj3M,KAAA62M,QAAAE,EAAA/hT,EAAAkiT,WAAAv9N,GACAi2M,IAAA56R,EAAA2/Q,QACAtwD,EAAAr2G,EAAAhvB,IAAAi4N,GAAA/nB,KAAAlvL,KAAA8tL,MAAA75R,GACA,OAAA+rG,KAAAm3M,cAAA,CAAA3yF,EAAAA,EAAAH,EAAAA,EAAA0yF,SAAAA,KASAN,EAAA94M,UAAAg4K,OAAA,SAAAh8L,EAAA0mM,EAAAhlD,GACA1hJ,EAAA44M,EAAA54M,GACA0mM,EAAArgL,KAAAm3M,cAAA92B,GACA,IAAArrR,EAAAgrG,KAAA0zM,cAAAr4E,GACA5zD,EAAAznE,KAAA62M,QAAAx2B,EAAA02B,WAAA/hT,EAAAkiT,WAAAv9N,GACAy9N,EAAAp3M,KAAAokH,EAAAwrE,IAAAvP,EAAAh8D,KAEA,OADAg8D,EAAA77D,IAAAxlI,IAAAhqF,EAAAqmO,MAAAu0D,IAAAnoH,IACAl0D,GAAA6jM,IAGAX,EAAA94M,UAAAk5M,QAAA,WAEA,IADA,IAAAxjM,EAAArT,KAAAqT,OACAlsC,EAAA,EAAAA,EAAAkP,UAAApR,OAAAkC,IACAksC,EAAAsiD,OAAAt/E,UAAAlP,IACA,OAAAo5M,EAAAiS,UAAAn/K,EAAA6lH,UAAAg2D,KAAAlvL,KAAA8tL,MAAA75R,IAGAwiT,EAAA94M,UAAA+1M,cAAA,SAAAr4E,GACA,OAAAk4E,EAAAI,WAAA3zM,KAAAq7H,IAGAo7E,EAAA94M,UAAAi5M,cAAA,SAAAD,GACA,OAAApD,EAAA8D,WAAAr3M,KAAA22M,IAGAF,EAAA94M,UAAAw5M,cAAA,SAAA92B,GACA,OAAAA,aAAAmzB,EACAnzB,EACA,IAAAmzB,EAAAxzM,KAAAqgL,IAWAo2B,EAAA94M,UAAAq5M,YAAA,SAAAhoB,GACA,IAAAryD,EAAAqyD,EAAA8B,OAAA3tL,QAAA,KAAAnD,KAAAk/H,gBAEA,OADAvC,EAAA38H,KAAAk/H,eAAA,IAAA8vD,EAAA6B,OAAAtC,QAAA,IAAA,EACA5xD,GAGA85E,EAAA94M,UAAA8nM,YAAA,SAAA9sE,GAGA,IAAA2+E,GAFA3+E,EAAA4nD,EAAAgS,WAAA55D,IAEA1zJ,OAAA,EACAsyO,EAAA5+E,EAAAvzJ,MAAA,EAAAkyO,GAAAzlN,QAAA,IAAA8mI,EAAA2+E,IACAE,EAAA,IAAA,IAAA7+E,EAAA2+E,IAEAzpM,EAAA0yK,EAAAiS,UAAA+kB,GACA,OAAAv3M,KAAA8tL,MAAAse,WAAAv+L,EAAA2pM,IAGAf,EAAA94M,UAAA85M,UAAA,SAAA/lM,GACA,OAAAA,EAAAvO,QAAA,KAAAnD,KAAAk/H,iBAGAu3E,EAAA94M,UAAA+5M,UAAA,SAAA/+E,GACA,OAAA4nD,EAAAiS,UAAA75D,IAGA89E,EAAA94M,UAAAg6M,QAAA,SAAAh+M,GACA,OAAAA,aAAAqG,KAAA02M,wICpHA,aAEA,IAAAn2B,EAAAhtR,EAAA,YACAslG,EAAA0nL,EAAA1nL,OACA05L,EAAAhS,EAAAgS,WACAF,EAAA9R,EAAA8R,eAWA,SAAAkhB,EAAAriB,EAAA36M,GACAypB,KAAAkxL,MAAAA,EACAlxL,KAAA43M,QAAArlB,EAAAh8M,EAAAogO,QACAzlB,EAAAymB,QAAAphO,EAAA8kJ,KACAr7H,KAAA63M,KAAAthO,EAAA8kJ,IAEAr7H,KAAA83M,UAAAvlB,EAAAh8M,EAAA8kJ,KAGAk4E,EAAAI,WAAA,SAAAziB,EAAA71D,GACA,OAAAA,aAAAk4E,EACAl4E,EACA,IAAAk4E,EAAAriB,EAAA,CAAA71D,IAAAA,KAGAk4E,EAAA8D,WAAA,SAAAnmB,EAAAylB,GACA,OAAAA,aAAApD,EACAoD,EACA,IAAApD,EAAAriB,EAAA,CAAAylB,OAAAA,KAGApD,EAAA51M,UAAAg5M,OAAA,WACA,OAAA32M,KAAA43M,SAGAvlB,EAAAkhB,EAAA,YAAA,WACA,OAAAvzM,KAAAkxL,MAAA8lB,YAAAh3M,KAAAq7H,UAGAg3D,EAAAkhB,EAAA,OAAA,WACA,OAAAvzM,KAAA83M,UACA93M,KAAAkxL,MAAAuU,YAAAzlM,KAAA83M,WACA93M,KAAAkxL,MAAA9sE,EAAAwrE,IAAA5vL,KAAA20K,WAGA0d,EAAAkhB,EAAA,aAAA,WACA,IAAAriB,EAAAlxL,KAAAkxL,MACA79K,EAAArT,KAAAqT,OACAikM,EAAApmB,EAAAhyD,eAAA,EAEAr4J,EAAAwsC,EAAAjuC,MAAA,EAAA8rN,EAAAhyD,gBAKA,OAJAr4J,EAAA,IAAA,IACAA,EAAAywO,IAAA,IACAzwO,EAAAywO,IAAA,GAEAzwO,KAGAwrN,EAAAkhB,EAAA,QAAA,WACA,OAAAvzM,KAAAkxL,MAAAwmB,UAAA13M,KAAA+3M,gBAGA1lB,EAAAkhB,EAAA,QAAA,WACA,OAAAvzM,KAAAkxL,MAAA79K,OAAAsiD,OAAA31D,KAAA22M,UAAAz9E,YAGAm5D,EAAAkhB,EAAA,iBAAA,WACA,OAAAvzM,KAAAqT,OAAAjuC,MAAA46B,KAAAkxL,MAAAhyD,mBAGAq0E,EAAA51M,UAAA2qJ,KAAA,SAAA3uK,GAEA,OADAkf,EAAAmH,KAAA43M,QAAA,2BACA53M,KAAAkxL,MAAA5oC,KAAA3uK,EAAAqmB,OAGAuzM,EAAA51M,UAAAg4K,OAAA,SAAAh8L,EAAA0mM,GACA,OAAArgL,KAAAkxL,MAAAvb,OAAAh8L,EAAA0mM,EAAArgL,OAGAuzM,EAAA51M,UAAAq6M,UAAA,SAAAr7E,GAEA,OADA9jI,EAAAmH,KAAA43M,QAAA,0BACAr3B,EAAAj9K,OAAAtD,KAAA22M,SAAAh6E,IAGA42E,EAAA51M,UAAA8xL,UAAA,SAAA9yD,GACA,OAAA4jD,EAAAj9K,OAAAtD,KAAAk3M,WAAAv6E,IAGAtpO,EAAAC,QAAAigT,kDC9FA,aAEA,IAAAxlB,EAAAx6R,EAAA,SACAgtR,EAAAhtR,EAAA,YACAslG,EAAA0nL,EAAA1nL,OACAw5L,EAAA9R,EAAA8R,eACAE,EAAAhS,EAAAgS,WAUA,SAAAihB,EAAAtiB,EAAA7Q,GACArgL,KAAAkxL,MAAAA,EAEA,iBAAA7Q,IACAA,EAAAkS,EAAAlS,IAEAxiL,MAAA/gB,QAAAujM,KACAA,EAAA,CACA77D,EAAA67D,EAAAj7M,MAAA,EAAA8rN,EAAAhyD,gBACA7a,EAAAg8D,EAAAj7M,MAAA8rN,EAAAhyD,kBAIArmI,EAAAwnL,EAAA77D,GAAA67D,EAAAh8D,EAAA,4BAEA6sE,EAAAymB,QAAAt3B,EAAA77D,KACAxkH,KAAA4lK,GAAAya,EAAA77D,GACA67D,EAAAh8D,aAAA0pE,IACA/tL,KAAAi4M,GAAA53B,EAAAh8D,GAEArkH,KAAAk4M,UAAAr6M,MAAA/gB,QAAAujM,EAAA77D,GAAA67D,EAAA77D,EAAA67D,EAAA02B,SACA/2M,KAAAm4M,UAAAt6M,MAAA/gB,QAAAujM,EAAAh8D,GAAAg8D,EAAAh8D,EAAAg8D,EAAA+3B,SAGA/lB,EAAAmhB,EAAA,KAAA,WACA,OAAAxzM,KAAAkxL,MAAAwmB,UAAA13M,KAAAo4M,eAGA/lB,EAAAmhB,EAAA,KAAA,WACA,OAAAxzM,KAAAkxL,MAAAuU,YAAAzlM,KAAA+2M,eAGA1kB,EAAAmhB,EAAA,YAAA,WACA,OAAAxzM,KAAAkxL,MAAA8lB,YAAAh3M,KAAAwkH,QAGA6tE,EAAAmhB,EAAA,YAAA,WACA,OAAAxzM,KAAAkxL,MAAAumB,UAAAz3M,KAAAqkH,QAGAmvF,EAAA71M,UAAA27H,QAAA,WACA,OAAAt5H,KAAA+2M,WAAAllN,OAAAmO,KAAAo4M,aAGA5E,EAAA71M,UAAAy3J,MAAA,WACA,OAAAmrB,EAAAj9K,OAAAtD,KAAAs5H,UAAA,OAAA5jI,eAGAriG,EAAAC,QAAAkgT,kEChEA,aAEA,MAAAv0D,EAAA1rP,EAAA,YACAqoO,EAAAroO,EAAA,sBACA6kO,EAAA7kO,EAAA,2BACAu2Q,EAAAv2Q,EAAA,WAEA8kT,EAAA,CACAC,UAAA,CACAC,OAAA,GACAC,QAAA,IAEAC,UAAA,CACAF,OAAA,GACAC,QAAA,IAEAE,SAAA,CACAH,OAAA,EACAI,cAAA,KAMAtlT,EAAAC,QAAAggJ,MAAAslK,EAAAvlM,EAAAsjM,KACA,MAAAj4C,EAAA25C,EAAAO,GAEA,IAAAl6C,EAAA,CACA,MAAAm6C,EAAArlT,OAAAW,KAAAkkT,GAAA/tO,KAAA,OACA,MAAA20K,EAAA,IAAAnmJ,MAAA,wBAAA8/M,eAAAC,KAAA,2BAGA,IAAAxlM,EACA,MAAA4rI,EAAA,IAAAnmJ,MAAA,qBAAA,yBAGA,MAAA6/M,EAAAj6C,EAAA85C,QACAD,EAAA75C,EAAA65C,OAEAh4D,EAAAnoB,EAAA,iBACA0gF,EAAA,GAAAP,EAAAI,EAFA,IAIAz5N,QAAA4qL,EAAA51Q,OAAAm/G,EAAAsjM,GACA,IAAA9vO,QAAAqY,EAAAg6I,OAAAqnB,GAEA,MAAA31K,EAAA,GACA,IAAA0mB,EAAA,EAEA,KAAAA,EAAAwnN,GAAA,CACA,MAAAx/N,QAAA4F,EAAAg6I,OAAA0C,EAAA,CAAA/0J,EAAA05K,KACA,IAAAw4D,EAAAz/N,EAAArU,OAEAqsB,EAAAynN,EAAAD,IACAC,EAAAD,EAAAxnN,GAGA1mB,EAAAE,KAAAwO,GACAgY,GAAAynN,EACAlyO,QAAAqY,EAAAg6I,OAAAryJ,GAGA,MAAA2gM,EAAAsxC,EAAA,EACAE,EAAAp9E,EAAAhxJ,GACAsxL,EAAA88C,EAAA5zO,MAAA,EAAAoiM,GACApL,EAAA48C,EAAA5zO,MAAAoiM,EAAAsxC,GAEAG,EAAAltO,IAAA,CACA0yL,GAAA1yL,EAAA3G,MAAA,EAAAmzO,GACAW,UAAAntO,EAAA3G,MAAAmzO,EAAAA,EAAAI,GACAQ,OAAAptO,EAAA3G,MAAAmzO,EAAAI,KAGA,MAAA,CACA37B,GAAAi8B,EAAA/8C,GACA21B,GAAAonB,EAAA78C,sIC1EA,aAEA,MAAAgjB,EAAA7rR,EAAA,gBACAqzQ,EAAArzQ,EAAA,aAEA6lT,EAAA,CACA3J,KAAA,QACAQ,OAAA,UACAI,OAAA,WAQA/8S,EAAAY,OAAAo/I,eAAA+lK,EAAA1C,GACA,MAAAtjM,EAAA+lM,EAAAC,GAEArkT,QAAAoqR,EAAA59L,MAAAwxL,OAAA0M,UACA,MACAi3B,EACA,CACA9jT,KAAA,OACAwgH,KAAA,CAAAxgH,KAAAwgH,KAEA,EACA,CAAA,SAGA,MAAA,CACA6lH,OAAA,MAAAxsE,GApBApZ,OAAAt+I,EAAA03J,KACA,MAAA6jE,QAAA6uD,EAAA59L,MAAAwxL,OAAA1qB,KAAA,CAAAz1P,KAAA,QAAAmC,EAAA03J,GACA,OAAA,IAAA+rE,WAAAlI,EAAAA,EAAA4N,WAAA5N,EAAA6N,aAmBAkqB,CAAAtzP,EAAA03J,GAEAznF,OAAA2hM,EAAAyyC,6EClCA,aAEAhmT,EAAAC,QAAA,CACAm8S,KAAA,GACAQ,OAAA,GACAI,OAAA,gCCLA,aAEA,MAAA1iB,EAAAp6R,EAAA,UAMAF,EAAAC,QAAAggJ,MAAAw6I,GAAAH,EAAA2rB,wBAAAxrB,iDCRA,aAEA,MAAA7uC,EAAA1rP,EAAA,YACA6rR,EAAA7rR,EAAA,iBACAm3R,kBAAAA,GAAAn3R,EAAA,WACAgmT,EAAAhmT,EAAA,yBACA8kO,EAAA9kO,EAAA,yBACAqoO,EAAAroO,EAAA,sBACA4kO,EAAA5kO,EAAA,sBAEA6mO,EAAA,CACAo/E,QAAA,IACAC,QAAA,IACAC,QAAA,KAGApmT,EAAAgmT,wBAAAhmK,eAAAw6I,GACAyrB,EAAA/lT,OAAAW,KAAAimO,GAAA0zD,GACA,MAAA/Y,QAAAqK,EAAA59L,MAAAwxL,OAAA8B,YACA,CACAjiR,KAAA,OACA8mT,WAAA7rB,IAEA,EACA,CAAA,eAmDA,MAAA,CACA94R,IAAAmkO,QAHAimD,EAAA59L,MAAAwxL,OAAAgC,UAAA,MAAAD,EAAArC,YAIAknC,aAjDAtmK,MAAAumK,EAAAC,KACA,IAAAtnC,EAGAA,EADAsnC,QACA16B,EAAA59L,MAAAwxL,OAAA0M,UACA,MACA1kD,EAAA8yD,EAAAgsB,GACA,CACAjnT,KAAA,OACA8mT,WAAA7rB,IAEA,EACA,CAAA,eAGA/Y,EAAAvC,WAGA,MAAAr+Q,EAAA,OACAirR,EAAA59L,MAAAwxL,OAAA0M,UACA,MACAzmD,EAAA60D,EAAA+rB,GACA,CACAhnT,KAAA,OACA8mT,WAAA7rB,IAEA,EACA,IAEAtb,GAGA3iE,QAAAuvE,EAAA59L,MAAAwxL,OAAA+mC,WACA,CACAlnT,KAAA,OACA8mT,WAAA7rB,EACAp1D,OAAAvkO,EAAA,IAEAA,EAAA,GACAimO,EAAA0zD,IAGA,OAAA,IAAAr1D,WAAA5oB,EAAAA,EAAAsuB,WAAAtuB,EAAAuuB,eAWA,MAAA47E,EAAA,CACAR,QAAA,GACAC,QAAA,GACAC,QAAA,IAMA,SAAAvgF,EAAA2nD,GACA,MAAAm5B,EAAAD,EAAAl5B,EAAAo5B,KAEA,OAAAt+E,EAAA,CACAnD,WAAAhvE,KAAA,CAAA,IACAihI,EAAA5J,EAAAlzK,EAAAqsM,GACAvvB,EAAA5J,EAAAjzK,EAAAosM,IACA,EAAA,EAAAA,GAIA,SAAAhhF,EAAA60D,EAAA94R,GACA,MAAAilT,EAAAD,EAAAlsB,GAEA,GAAA31D,GAAAnjO,EAAAowE,MAAA,EAAA,GAAAqzJ,WAAAhvE,KAAA,CAAA,KACA,MAAAw1F,EAAA,IAAAnmJ,MAAA,oDAAA,0BAGA,MAAA,CACA8wL,IAAA,KACAswB,IAAApsB,EACAlgL,EAAAyqH,EAAArjO,EAAAowE,MAAA,EAAA60O,EAAA,GAAA,aACApsM,EAAAwqH,EAAArjO,EAAAowE,MAAA,EAAA60O,GAAA,aACAE,KAAA,GAIA,MAAAn/E,EAAA,CAAA8yD,EAAA94R,KAAA,IACAikO,EAAA60D,EAAA94R,EAAA0jO,QACA96F,EAAAy6F,EAAArjO,EAAAolT,QAAA,kOCvHA,aAEA,MAAAn7D,EAAA1rP,EAAA,YAEAF,EAAAC,QAAA,SAAA+mT,EAAAvzO,GACA,IAAAuzO,EAAA5rO,SAAA3H,GAAA,CACA,MAAA68B,EAAA02M,EAAA/vO,KAAA,OACA,MAAA20K,EAAA,IAAAnmJ,MAAA,kBAAAhyB,cAAA68B,KAAA,uECPA,aAgEAtwG,EAAAC,QA9DA,SAAA44P,GAAArxJ,UAAAA,EAAAo/H,WAAAA,IACA,MAAAzD,EAAAtgO,OAAAugP,IAAAxc,GAEAqgF,EAAA,CAOAzjT,CAAAgkG,GAAA,cAAAqxJ,EACAr1P,eAAAu/E,GACAmvC,SAAAnvC,GACA5iF,OAAAC,eAAAusG,KAAAw2H,EAAA,CAAA9iO,OAAA,IAGA8tF,IAAAtrF,OAAAspM,eACA,OAAA3kG,KAGAA,GAIA,OAFAy/M,EAAA,KAAAz/M,KAAAgE,MAAAA,IAAAA,EAAA23H,IAEA8jF,GAuCAjnT,EAAAC,QAAA+2I,MApCA,SAAA6hH,GAAArxJ,UAAAA,EAAAo/H,WAAAA,EAAAsgF,WAAAA,IACA,MAAA/jF,EAAAtgO,OAAAugP,IAAAxc,GAGAqgF,EAAA,CACAzjT,CAAAgkG,GAAA,YAAAzkB,GACA,GAAAmkO,KAAAv6M,gBAAAs6M,GACA,OAAA,IAAAA,KAAAlkO,GAGA,MAAA4/B,EAAAk2I,EAAAtuJ,KAAAoC,QAAA5pB,IAAA4pB,KAMA,OAJAgW,IAAAA,EAAAwgH,IACAhjO,OAAAC,eAAAuiH,EAAAwgH,EAAA,CAAA9iO,OAAA,IAGAsiH,IAEAnb,GAcA,OAXAy/M,EAAA38M,UAAAnqG,OAAAU,OAAAg4P,EAAAvuJ,WACA28M,EAAA38M,UAAAgP,YAAA2tM,EAEA9mT,OAAAC,eAAA6mT,EAAA38M,UAAAznG,OAAAspM,YAAA,CACAh+G,IAAA,IACAqZ,IAIAy/M,EAAA,KAAAz/M,KAAAgE,MAAAA,IAAAA,EAAA23H,IAEA8jF,+BC5DA,aAEA,IAAAh5D,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,oBAAAN,EAAAM,MAAA,kBAAA,IAEA1mD,EAAAg9B,YAAA,WAmBA,SAAAA,EAAAhxJ,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAgLA,OAvKA+wJ,EAAAv6H,UAAA1Z,GAAA09J,EAAAG,UAAA,IAQA5pB,EAAAv6H,UAAA66H,OAAAmpB,EAAAG,UAAA,IAQA5pB,EAAAv6H,UAAA46H,QAAAopB,EAAAG,UAAA,IAWA5pB,EAAA50H,OAAA,SAAApkB,EAAAulI,GAQA,OAPAA,IACAA,EAAAg9B,EAAAvtP,UACAuwN,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAA+E,IACA,MAAA/E,EAAAs5I,QAAAhlO,OAAAgnG,eAAAoD,KAAA1e,EAAA,WACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAs5I,QACA,MAAAt5I,EAAAq5I,SAAA/kO,OAAAgnG,eAAAoD,KAAA1e,EAAA,YACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAq5I,SACA9T,GAcAyT,EAAA9zH,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAg9B,YACAlqH,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAA+E,GAAA+pB,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAs5I,OAAAxqH,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAq5I,QAAAvqH,EAAA2qH,QACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,IAAA7/D,EAAAsb,eAAA,MACA,MAAAmnJ,EAAAO,cAAA,wBAAA,CAAAr/E,SAAA3jF,IACA,OAAAA,GAWAg5I,EAAAiqB,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAg9B,YACA,OAAAt6F,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAg9B,YAmBA,OAlBA,MAAAt6F,EAAA35C,KACA,iBAAA25C,EAAA35C,GACA09J,EAAA99I,OAAAO,OAAAw5B,EAAA35C,GAAA/E,EAAA+E,GAAA09J,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA35C,KAAA,GACA25C,EAAA35C,GAAAhf,SACAia,EAAA+E,GAAA25C,EAAA35C,KAEA,MAAA25C,EAAA46F,SACA,iBAAA56F,EAAA46F,OACAmpB,EAAA99I,OAAAO,OAAAw5B,EAAA46F,OAAAt5I,EAAAs5I,OAAAmpB,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA46F,SAAA,GACA56F,EAAA46F,OAAAvzJ,SACAia,EAAAs5I,OAAA56F,EAAA46F,SAEA,MAAA56F,EAAA26F,UACA,iBAAA36F,EAAA26F,QACAopB,EAAA99I,OAAAO,OAAAw5B,EAAA26F,QAAAr5I,EAAAq5I,QAAAopB,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA26F,UAAA,GACA36F,EAAA26F,QAAAtzJ,SACAia,EAAAq5I,QAAA36F,EAAA26F,UAEAr5I,GAYAg5I,EAAAkqB,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAiCA,OAhCAsyC,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA35C,GAAA,IAEA25C,EAAA35C,GAAA,GACAisF,EAAAyoD,QAAA96H,QACA+/B,EAAA35C,GAAA09J,EAAAG,UAAAlkH,EAAA35C,MAEAisF,EAAAyoD,QAAAtyJ,OACAu3D,EAAA46F,OAAA,IAEA56F,EAAA46F,OAAA,GACAtoD,EAAAyoD,QAAA96H,QACA+/B,EAAA46F,OAAAmpB,EAAAG,UAAAlkH,EAAA46F,UAEAtoD,EAAAyoD,QAAAtyJ,OACAu3D,EAAA26F,QAAA,IAEA36F,EAAA26F,QAAA,GACAroD,EAAAyoD,QAAA96H,QACA+/B,EAAA26F,QAAAopB,EAAAG,UAAAlkH,EAAA26F,YAGA,MAAAr5I,EAAA+E,IAAA/E,EAAAsb,eAAA,QACAojC,EAAA35C,GAAAisF,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAA+E,GAAA,EAAA/E,EAAA+E,GAAAhf,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAA+E,IAAA/E,EAAA+E,IAEA,MAAA/E,EAAAs5I,QAAAt5I,EAAAsb,eAAA,YACAojC,EAAA46F,OAAAtoD,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAs5I,OAAA,EAAAt5I,EAAAs5I,OAAAvzJ,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAs5I,QAAAt5I,EAAAs5I,QAEA,MAAAt5I,EAAAq5I,SAAAr5I,EAAAsb,eAAA,aACAojC,EAAA26F,QAAAroD,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAq5I,QAAA,EAAAr5I,EAAAq5I,QAAAtzJ,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAq5I,SAAAr5I,EAAAq5I,SAEA36F,GAUAs6F,EAAAv6H,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAnqB,EAvMA,GA0MA7kO,EAAAC,QAAA4nM,4DCrNA,aAEA,MAAA4uE,EAAAv2Q,EAAA,UACA4qQ,EAAA5qQ,EAAA,SACAY,EAAAZ,EAAA,UAEAD,EAAA6qQ,IAAAA,EACA7qQ,EAAAw2Q,KAAAA,EACAx2Q,EAAAa,KAAAA,EACAb,EAAAy7Q,YAAAx7Q,EAAA,kBACAD,EAAAkrQ,OAAAjrQ,EAAA,uICVA,aAEA,MAAA4rR,EAAA5rR,EAAA,aACAinT,EAAAjnT,EAAA,iBAEAD,EAAAY,OAAAo/I,eAAAt+I,EAAAypQ,GACA,MAAA/jL,EAAA8/N,EAAAxlT,GACA0pQ,EAAAygB,EAAAs7B,eAAA//N,EAAA1lF,EAAAypQ,GACAi8C,EAAAv7B,EAAAw7B,iBAAAjgO,EAAA1lF,EAAAypQ,GAYA,MAVA,CACAiD,QAAA,MAAAh1G,GACAgyG,EAAA/oG,OAAAjJ,GAGA60G,QAAA,MAAA70G,GACAguJ,EAAA/kJ,OAAAjJ,8EChBA,aAEAn5J,EAAA,sBACA,MAAAyrP,EAAAzrP,EAAA,wBACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BAEAF,EAAAC,QAAA,CACAmnT,eAAA,CAAA//N,EAAA1lF,EAAAypQ,KACA,MAAAm8C,EAAA57D,EAAA0f,OAAAuF,aAAA,UAAA5rC,EAAArjO,EAAA,UAEA,OADA4lT,EAAA5lO,MAAA,CAAAypL,GAAApmC,EAAAomC,EAAA,WACA,CACA9oG,OAAAjJ,IACAkuJ,EAAAjlJ,OAAAqpF,EAAAp/I,KAAAyvJ,aAAAh3B,EAAA3rE,EAAA,WACA0rE,EAAAwiF,EAAA97E,OAAAsiB,WAAA,YAIAu5D,iBAAA,CAAAjgO,EAAA1lF,EAAAypQ,KACA,MAAAm8C,EAAA57D,EAAA0f,OAAAsF,eAAA,UAAA3rC,EAAArjO,EAAA,UAEA,OADA4lT,EAAA5lO,MAAA,CAAAypL,GAAApmC,EAAAomC,EAAA,WACA,CACA9oG,OAAAjJ,IACAkuJ,EAAAjlJ,OAAAqpF,EAAAp/I,KAAAyvJ,aAAAh3B,EAAA3rE,EAAA,WACA0rE,EAAAwiF,EAAA97E,OAAAsiB,WAAA,wKCxBA,aAEA,MAAAnC,EAAA1rP,EAAA,YAEAsnT,EAAA,CACA/pO,GAAA,cACAgB,GAAA,eAGAz+E,EAAAC,QAAA,SAAA0B,GACA,MAAA0lF,EAAAmgO,EAAA7lT,EAAAiwE,QACA,IAAAyV,EAAA,CACA,MAAAwnL,EAAA1uQ,OAAA0pG,QAAA29M,GAAAzwO,KAAA,EAAA/1E,EAAAywK,KAAA,GAAAzwK,MAAAywK,OAAAx6F,KAAA,OACA,MAAA20K,EAAA,IAAAnmJ,MAAA,sBAAA9jG,EAAAiwE,yBAAAi9L,KAAA,0BAEA,OAAAxnL,mDCfA,aAEA,MAAAogO,EAAAvnT,EAAA,yBACAwnT,EAAAxnT,EAAA,uBACA0rP,EAAA1rP,EAAA,YASAynT,EAAA,CACA/6E,KAAA,OACAC,WAAA,SACAC,WAAA,UA4BA9sO,EAAAC,QAfA,SAAA6jO,EAAA0mC,EAAAmD,EAAAw3C,EAAAnlM,GACA,MAAA4nM,EAAAD,EAAA3nM,GACA,IAAA4nM,EAAA,CACA,MAAAxpM,EAAAj+G,OAAAW,KAAA6mT,GAAA1wO,KAAA,OACA,MAAA20K,EAAA,IAAAnmJ,MAAA,SAAAua,2CAAA5B,KAAA,6BAEA,MAAAypM,EAAAJ,EACA3jF,EACA0mC,EACAmD,EACAw3C,EACAyC,GACA,OAAAF,EAAAtkD,SAAAykD,kHCzCA,aAEA,MAAA5sF,EAAA/6N,EAAA,eACA46N,EAAA56N,EAAA,cACA4nT,UAAAA,GAAA5nT,EAAA,aACA6nT,EAAA7nT,EAAA,SACAg7N,EAAAh7N,EAAA,SACAk5N,IAAAA,GAAAl5N,EAAA,WACA8kO,EAAA9kO,EAAA,yBAEA8nT,EAAA,0CACAC,EAAA,0BAKAC,EAAA,yCAKAC,EAAA,oFA6BA,SAAA3gF,EAAAxnH,GACA,IAEA,OADA,IAAAk7G,EAAAl7G,IACA,EACA,MAAAt/G,GACA,OAAA,GAOA,SAAA0nT,EAAAzsN,GACA,IAAAA,EAAA,OAAA,EACA,GAAAmsN,EAAAM,YAAAzsN,GAAA,OAAA,EACA,IAEA,OADA,IAAAmsN,EAAAnsN,IACA,EACA,MAAAj7F,GACA,OAAA,GAiBA,SAAA2nT,EAAA1sN,EAAA/P,EAAA08N,EA1EA,EA0EAC,EAzEA,GA0EA,MAAAC,EAAAC,EAAA9sN,GACA,IAAA6sN,EACA,OAAA,EAGA,MAAAv+N,EAAAu+N,EAAAv+N,MAAA2B,GACA,IAAA3B,EACA,OAAA,EAGA,GAAA,SAAAA,EAAAq+N,GACA,OAAA,EAGA,IAAAtoM,EAAA/1B,EAAAs+N,GASA,OAPAvoM,GAAAp0B,IAAAs8N,IAIAloM,EAAAA,EAAAjqC,eAGAyxJ,EAAAxnH,GAUA,SAAA0oM,EAAA/sN,EAAA/P,EAAA08N,EA5GA,EA4GAC,EA3GA,GA4GA,MAAAC,EAAAC,EAAA9sN,GACA,IAAA6sN,EACA,OAAA,EAEA,MAAAv+N,EAAAu+N,EAAAv+N,MAAA2B,GACA,IAAA3B,EACA,OAAA,EAGA,GAAA,SAAAA,EAAAq+N,GACA,OAAA,EAGA,IAAAK,EAAA1+N,EAAAs+N,GAEA,GAAAI,GAAA/8N,IAAAs8N,EAAA,CAMA,GAFAS,EAAAA,EAAA5yO,cAEAyxJ,EAAAmhF,GAAA,OAAA,EAEA,KACAA,EAAAvtO,SAAA,MAAAutO,EAAAvtO,SAAA,OAIAutO,EAAAA,EAAA9iO,QAAA,MAAA,KAAAA,QAAA,KAAA,KAAAA,QAAA,KAAA,MAGA,MAAAk+I,SAAAA,GAAA,IAAA3K,EAAA,UAAAuvF,KAEA,OAAAR,EAAA/1O,KAAA2xJ,GACA,MAAArjO,GACA,OAAA,GAIA,OAAA,EAMA,SAAAa,EAAAo6F,GACA,MAAA,iBAAAA,EAMA,SAAA8sN,EAAA9sN,GACA,OAAAA,aAAAypI,WACAJ,EAAArpI,EAAA,eAGAp6F,EAAAo6F,IACAA,EASA,MAAAitN,EAAAr2M,GAAA81M,EAAA91M,EAAA21M,EA1KA,EADA,GA+KAW,EAAAt2M,GAAAm2M,EAAAn2M,EAAA21M,EA9KA,EADA,GAmLAY,EAAAv2M,GAAAq2M,EAAAr2M,IAAAs2M,EAAAt2M,GAKAw2M,EAAAx2M,GAAA81M,EAAA91M,EAAAy1M,IAAAY,EAAAr2M,GAIAy2M,EAAAz2M,GAAAm2M,EAAAn2M,EAAAy1M,IAAAa,EAAAt2M,GAIAA,EAAAA,GAAAw2M,EAAAx2M,IAAAy2M,EAAAz2M,IAAAu2M,EAAAv2M,GAKAjzG,EAAAA,GAAA+oT,EAAA/oT,EAAA2oT,IAAAS,EAAAppT,EAAA2oT,GAEAjoT,EAAAC,QAAA,CACAg7N,UA/LA,SAAAj7G,GACA,MAAAwoM,EAAAC,EAAAzoM,GACA,IAEA,OADAi7G,EAAAlqH,OAAA+pH,EAAA/pH,OAAA,IAAAy3M,KACA,EACA,MAAA9nT,GACA,OAAA,IA0LAm6N,UAAAutF,EACAa,cA/IA,SAAAttN,GACA,OAAAysN,EAAAzsN,IAAAosN,EAAAmB,IAAA13N,QAAAmK,IA+IA2+H,IAAAkN,EAIA2hF,UAAA7uF,GAAA,WAzLA,SAAAt6G,GACA,IACA,OAAA86G,EAAAyO,UAAAvpH,GACA,MAAAt/G,GACA,OAAA,GAqLA0oT,CAAA9uF,IAAAkN,EAAAlN,GACAsuF,cAAAA,EACAC,cAAAA,EACAC,UAAAA,EACAZ,wBAAAA,EACAa,QAAAA,EACAC,QAAAA,EACAz2M,IAAAA,EACAy1M,mBAAAA,EAIAvwF,SAAAn4N,GAAA+oT,EAAA/oT,EAAA2oT,GAIAoB,SAAA/pT,GAAAopT,EAAAppT,EAAA2oT,GACA3oT,KAAAA,EACA2oT,YAAAA,EAIAqB,UAAA/uM,GAAAhI,EAAAgI,IAAAj7G,EAAAi7G,GAIAgvM,QAAAjqT,GAAAiC,EAAAjC,KAAAkoO,EAAAloO,IAAA+oT,EAAA,SAAA/oT,IAAA2oT,oKC1PA,aAEA,MAAA3gF,EAAApnO,EAAA,WACAspT,EAAAtpT,EAAA,qBACAooO,EAAApoO,EAAA,UACAg7N,EAAAh7N,EAAA,QACAupT,EAAAvpT,EAAA,YACA0gS,EAAA/9R,OAAAugP,IAAA,8BACApe,EAAA9kO,EAAA,yBACA4kO,EAAA5kO,EAAA,sBAUAwpT,EAAA,IAAA/5N,IACAwzI,EAAAtgO,OAAAugP,IAAA,wCAQA,MAAA0kE,EAUAtkT,YAAAmmT,GASA,GAPA,MAAAA,IACAA,EAAA,IAIAxpT,OAAAC,eAAAusG,KAAAw2H,EAAA,CAAA9iO,OAAA,IAEAspT,aAAAvkF,WAEAz4H,KAAA24H,MAAAgC,EAAAsiF,UAAAD,QACA,GAAA,iBAAAA,EAAA,CACA,GAAAA,EAAA/3O,OAAA,GAAA,MAAA+3O,EAAAzkN,OAAA,GACA,MAAA,IAAAO,MAAA,cAAAkkN,4BAEAh9M,KAAA24H,MAAAgC,EAAA0vB,WAAA2yD,OACA,CAAA,IAAA7B,EAAAM,YAAAuB,GAGA,MAAA,IAAAlkN,MAAA,uDAFAkH,KAAA24H,MAAAgC,EAAAsiF,UAAAD,EAAArkF,QAeA9hO,WACA,OAAA8jO,EAAAuiF,cAAAl9M,KAAA24H,OAYA9hO,SACA,OAAAmpG,KAAA5B,WAYAvnG,YAEA,MAAAkqK,EAAA,GACAr5D,EAAA1H,KAAA5B,WAAAte,MAAA,KAKA,OAJAihF,EAAAo8I,OAAA,QAAAz1M,EAAA,GAAA,EAAA,EACAq5D,EAAAv7D,KAAAkC,EAAA,GACAq5D,EAAAq8I,UAAA11M,EAAA,GACAq5D,EAAAt7D,KAAAr/B,SAAAshC,EAAA,IACAq5D,EAkBAlqK,SACA,OAAAmpG,KAAAq9M,aAAAjzO,KAAA/0E,GAAA7B,OAAAiqG,OAAA,GAAAo/M,EAAAxnT,MAeAwB,aACA,MAAAglO,EAAA,GACAtL,EAAAvwH,KAAA24H,MACA,IAAAxxJ,EAAA,EACA,KAAAA,EAAAopJ,EAAAtrJ,QAAA,CACA,MAAA5vE,EAAAsmO,EAAAv3H,OAAAmsH,EAAAppJ,GACAlzE,EAAA0nO,EAAAv3H,OAAAu0H,MAEAzxJ,EAAA21O,EAAAxnT,GAGA8xE,GAFAwzJ,EAAA2iF,YAAAp2O,EAAAqpJ,EAAAnrJ,MAAA+B,EAAAlzE,IAEAA,EACA4nO,EAAA/wJ,KAAAz1E,GAGA,OAAAwmO,EAeAhlO,aACA,OAAAmpG,KAAAu9M,SAAAnzO,KAAAigE,GAAAA,EAAAx3I,OAYAgE,SACA,OAAA8jO,EAAA6iF,cAAAx9M,KAAA24H,OAcA9hO,eACA,MAAAkoJ,EAAA47E,EAAA6iF,cAAAx9M,KAAA24H,OACA,OAAAgC,EAAA8iF,qBAAA1+J,GAuBAloJ,YAAAmmT,GAEA,OADAA,EAAA,IAAA7B,EAAA6B,GACA,IAAA7B,EAAAn7M,KAAA5B,WAAA4+M,EAAA5+M,YAwBAvnG,YAAAmmT,GACA,MAAAU,EAAAV,EAAA5+M,WACAliB,EAAA8jB,KAAA5B,WACAj3B,EAAA+U,EAAAyD,YAAA+9N,GACA,GAAAv2O,EAAA,EACA,MAAA,IAAA2xB,MAAA,WAAAkH,KAAA,iCAAAg9M,GAEA,OAAA,IAAA7B,EAAAj/N,EAAA9W,MAAA,EAAA+B,IAwBAtwE,gBAAAxB,GACA,MAAAsoT,EAAA39M,KAAA29M,SACA,IAAA,IAAAx2O,EAAAw2O,EAAA14O,OAAA,EAAAkC,GAAA,EAAAA,IACA,GAAAw2O,EAAAx2O,GAAA,KAAA9xE,EACA,OAAA,IAAA8lT,EAAAxgF,EAAAijF,cAAAD,EAAAv4O,MAAA,EAAA+B,KAGA,OAAA64B,KAiBAnpG,YACA,IACA,MAQAgnT,EARA79M,KAAA89M,eAAA/vO,QAAA8vO,GACAA,EAAA,KAAAhB,EAAAl5M,MAAA2nH,KAAAj2N,OAOA4oF,MACA,OAAA4/N,GAAAA,EAAA,GAEAxlF,EAAA,IAAA9J,EAAAsvF,EAAA,IAAAvvF,UAAA,aAEA,KAEA,MAAAv6N,GACA,OAAA,MAkBA8C,UACA,IAAAlE,EAAA,KACA,IACAA,EAAAqtG,KAAA89M,eAAA/vO,QAAA8vO,KACAhB,EAAAgB,EAAA,IACAlrT,OAIA,GAAA,GAEAA,IACAA,EAAA,MAEA,MAAAoB,GACApB,EAAA,KAEA,OAAAA,EAwBAkE,OAAAmmT,GACA,OAAA7kF,EAAAn4H,KAAA24H,MAAAqkF,EAAArkF,OAoBA9hO,gBACA,MAAAknT,EAAA/9M,KAAAu9M,SAAAp/N,MAAAjX,GAAAA,EAAA82O,aAGA,IAAAD,EACA,MAAA,CAAA/9M,MAGA,MAAA1Y,EAAAy1N,EAAAv7N,IAAAu8N,EAAAlrT,MACA,IAAAy0F,EACA,MAAAw1N,EAAA,IAAAhkN,MAAA,6BAAAilN,EAAAlrT,QAAA,6BAIA,aADAy0F,EAAA0Y,OACA51B,KAAAvD,GAAA,IAAAs0O,EAAAt0O,KAmBAhwE,cACA,MAAAglO,EAAA77H,KAAAq9M,aACA15M,EAAA3D,KAAAi+M,aACAh4M,EAAAjG,KAAA5B,WAAAte,MAAA,KAAA1a,MAAA,GAEA,GAAA6gC,EAAAhhC,OAAA,EACA,MAAA,IAAA6zB,MAAA,8FACA,GAAA,IAAA+iI,EAAA,IAAA,KAAAA,EAAA,IAAA,KAAAA,EAAA,IAAA,KAAAA,EAAA,GACA,MAAA,IAAA/iI,MAAA,4BAAA6K,EAAA,kEACA,GAAA,QAAAsC,EAAA,IAAA,QAAAA,EAAA,GACA,MAAA,IAAAnN,MAAA,4BAAA6K,EAAA,6DAGA,MAAA,CACAw5M,OAAA,KAAAthF,EAAA,IAAA,KAAAA,EAAA,GAAA,EAAA,EACAqiF,QAAAj4M,EAAA,GACAR,KAAAr/B,SAAA6/B,EAAA,KAiCApvG,mBAAAmmT,GACA,MAAAO,GAAAP,GAAAh9M,MAAAu9M,SAEA,OAAA,IAAAA,EAAAt4O,UAIA,IAAAs4O,EAAA,GAAAloT,MAAA,KAAAkoT,EAAA,GAAAloT,QAGA,IAAAkoT,EAAA,GAAAloT,MAAA,MAAAkoT,EAAA,GAAAloT,OAkBAwB,uBAAAmmT,EAAAI,GACA,IAAAJ,EAAA,MAAA,IAAAlkN,MAAA,gCACA,IAAAskN,EAAA,MAAA,IAAAtkN,MAAA,+BACA,IAAAyhK,EACA,OAAAyiD,EAAAG,QACA,KAAA,EACA5iD,EAAA,MACA,MACA,KAAA,EACAA,EAAA,MACA,MACA,QACA,MAAAzhK,MAAA,6BAAAkkN,EAAAG,6BAEA,OAAA,IAAAhC,EAAA,IAAA,CAAA5gD,EAAAyiD,EAAAkB,QAAAd,EAAAJ,EAAAv3M,MAAAn7B,KAAA,MASAzzE,cAAAmmT,GACA,QAAA7B,EAAAM,YAAAuB,IAKAA,EAAAO,SAAA32O,MAAAyjE,GAAAA,EAAA2zK,aASAnnT,mBAAAnD,GACA,OAAAA,aAAAynT,GAAA99N,QAAA3pF,GAAAA,EAAA8iO,IAgBA3/N,CAAAo9R,KACA,MAAA,cACA57D,EAAAr4H,KAAA24H,MAAA,UAAA,MACAgC,EAAAuiF,cAAAl9M,KAAA24H,OAAA,IAgBA9hO,UACA,MAAA,cACAwhO,EAAAr4H,KAAA24H,MAAA,UAAA,MACAgC,EAAAuiF,cAAAl9M,KAAA24H,OAAA,KAaAwiF,EAAA0B,UAAAA,EAEA1B,EAAA4B,UAAAA,EAWA1pT,EAAAC,QAAA,CAAA6nT,UAAAA,EAAAjtF,UAJA,SAAA8uF,GACA,OAAA,IAAA7B,EAAA6B,IAGAH,UAAAA,EAAAE,UAAAA,0LCtmBA,aAEA,MAAAx2G,EAAAhzM,EAAA,aACAspT,EAAAtpT,EAAA,qBACAooO,EAAApoO,EAAA,UACAqoO,EAAAroO,EAAA,sBACA8kO,EAAA9kO,EAAA,yBAgCA,SAAA4qT,EAAA3oN,GACA,MAAAmoN,EAAA,GACA13M,EAAAzQ,EAAA1V,MAAA,KAAA1a,MAAA,GACA,GAAA,IAAA6gC,EAAAhhC,QAAA,KAAAghC,EAAA,GACA,MAAA,GAGA,IAAA,IAAA/+B,EAAA,EAAAA,EAAA++B,EAAAhhC,OAAAiC,IAAA,CACA,MAAA6+B,EAAAE,EAAA/+B,GACAmjE,EAAAwyK,EAAA92M,GAEA,GAAA,IAAAskC,EAAAptC,KAAA,CAMA,GADA/1B,IACAA,GAAA++B,EAAAhhC,OACA,MAAAm5O,EAAA,oBAAA5oN,GAIA,GAAA60C,EAAA13I,KAAA,CACAgrT,EAAA7yO,KAAA,CACAi7B,EAIAs4M,EAAAp4M,EAAA7gC,MAAA8B,GAAAoD,KAAA,QAEA,MAGAqzO,EAAA7yO,KAAA,CAAAi7B,EAAAE,EAAA/+B,UArBAy2O,EAAA7yO,KAAA,CAAAi7B,IAwBA,OAAA43M,EAOA,SAAAW,EAAAX,GAEA,MAAA13M,EAAA,GAUA,OATA03M,EAAAvzO,KAAAm0O,IACA,MAAAl0K,EAAAm0K,EAAAD,GAKA,OAJAt4M,EAAAn7B,KAAAu/D,EAAAx3I,MACA0rT,EAAAt5O,OAAA,GACAghC,EAAAn7B,KAAAyzO,EAAA,IAEA,QAGAF,EAAAp4M,EAAA37B,KAAA,MAQA,SAAAm0O,EAAAd,GACA,OAAAA,EAAAvzO,KAAAm0O,IACA1gN,MAAA/gB,QAAAyhO,KACAA,EAAA,CAAAA,IAEA,MAAAl0K,EAAAm0K,EAAAD,GACA,OAAAA,EAAAt5O,OAAA,EACA,CAAAolE,EAAAh1I,KAAAkxM,EAAA+yB,QAAAjvF,EAAAh1I,KAAAkpT,EAAA,KAEA,CAAAl0K,EAAAh1I,SAaA,SAAAooT,EAAAE,GACA,OAAAA,EAAAvzO,KAAAm0O,IACA,MAAAl0K,EAAAm0K,EAAAD,GACA,OAAAA,EAAA,GACA,CAAAl0K,EAAAh1I,KAAAkxM,EAAAnoG,SAAAisC,EAAAh1I,KAAAkpT,EAAA,KAEA,CAAAl0K,EAAAh1I,SAQA,SAAAuoT,EAAAD,GACA,OAAAV,EAAArhF,EAAA+hF,EAAAvzO,KAAAm0O,IACA,MAAAl0K,EAAAm0K,EAAAD,GACA,IAAAhuF,EAAAkI,WAAAhvE,KAAAkyE,EAAAr4H,OAAA+mC,EAAAh1I,OAMA,OAJAkpT,EAAAt5O,OAAA,IACAsrJ,EAAAqL,EAAA,CAAArL,EAAAguF,EAAA,MAGAhuF,OAQA,SAAA+sF,EAAAp2O,EAAA81O,GACA,GAAA91O,EAAA+1B,KAAA,EACA,OAAA/1B,EAAA+1B,KAAA,EACA,GAAA,IAAA/1B,EAAA+1B,KACA,OAAA,EAGA,OADA0+H,EAAAv3H,OAAA44M,GACArhF,EAAAv3H,OAAAu0H,MASA,SAAA6kF,EAAAjtF,GAEA,MAAAotF,EAAA,GACA,IAAAx2O,EAAA,EACA,KAAAA,EAAAopJ,EAAAtrJ,QAAA,CACA,MAAA5vE,EAAAsmO,EAAAv3H,OAAAmsH,EAAAppJ,GACAlzE,EAAA0nO,EAAAv3H,OAAAu0H,MAIA17H,EAAAqgN,EAFAT,EAAAxnT,GAEAk7N,EAAAnrJ,MAAA+B,EAAAlzE,IAEA,GAAA,IAAAgpG,EAAA,CACA0gN,EAAA7yO,KAAA,CAAAz1E,IACA8xE,GAAAlzE,EACA,SAGA,MAAA+oT,EAAAzsF,EAAAnrJ,MAAA+B,EAAAlzE,EAAAkzE,EAAAlzE,EAAAgpG,GAIA,GAFA91B,GAAA81B,EAAAhpG,EAEAkzE,EAAAopJ,EAAAtrJ,OACA,MAAAm5O,EAAA,+BAAA/lF,EAAA9H,EAAA,WAIAotF,EAAA7yO,KAAA,CAAAz1E,EAAA2nT,IAGA,OAAAW,EAiBA,SAAAe,EAAAlpN,GAKA,OAAAooN,EAFAa,EADAN,EADA3oN,EAAA6oN,EAAA7oN,MAmBA,SAAAynN,EAAA1sF,GACA,MAAA92H,EAAAklN,EAAApuF,GACA,GAAA92H,EAAA,MAAAA,EACA,OAAAg/H,WAAAhvE,KAAA8mE,GAMA,SAAAouF,EAAApuF,GACA,IACAitF,EAAAjtF,GACA,MAAA92H,GACA,OAAAA,GAcA,SAAA4kN,EAAA7oN,GACA,MAAA,IAAAA,EAAAhe,OAAAsI,MAAA,KAAA/R,QAAAlH,GAAAA,IAAAyD,KAAA,KAMA,SAAA8zO,EAAA5oN,GACA,OAAA,IAAAsD,MAAA,0BAAAtD,GAMA,SAAAgpN,EAAAD,GAEA,OADA1B,EAAA0B,EAAA,IA9QAlrT,EAAAC,QAAA,CACA6qT,qBAAAA,EACAG,qBAAAA,EAEAb,qBAAAA,EACAgB,qBAAAA,EAEAjB,cAAAA,EACAI,cAAAA,EAEAV,cA4LA,SAAA3sF,GACA,MAAA1pJ,EAAA22O,EAAAjtF,GAEA,OAAA+tF,EADAb,EAAA52O,KA7LA63O,cAAAA,EAEAr0D,WA+MA,SAAA70J,GACA,OAAAkpN,EAAAlpN,IA/MAynN,UAAAA,EACA0B,cAAAA,EACAC,aAwOA,SAAAruF,GACA,YAAA76N,IAAAipT,EAAApuF,IAxOA8tF,UAAAA,EAEAD,WAAAA,EACAI,eAAAA,EAEAlB,YAAAA,4JC/BA,aAEA,MAAA/iD,EAAAhnQ,EAAA,QACAspT,EAAAtpT,EAAA,qBACAg7N,EAAAh7N,EAAA,QACA46N,EAAA56N,EAAA,aACAooO,EAAApoO,EAAA,UACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BACAqoO,EAAAroO,EAAA,sBASA,SAAAsrT,EAAAx0K,EAAAxjE,GACA,OAAAA,aAAA4xJ,WACAomF,EAAAzgN,SAAAisC,EAAAxjE,GAEAg4O,EAAAvlF,QAAAjvF,EAAAxjE,GA+EA,SAAAi4O,EAAAC,GACA,IAAAxkD,EAAAykD,KAAAD,GACA,MAAA,IAAAjmN,MAAA,sBAEA,OAAAyhK,EAAAjhC,QAAAylF,GAiBA,SAAAE,EAAAx5M,GACA,MAAA8qH,EAAA,IAAA0N,YAAA,GAIA,OAHA,IAAA81B,SAAAxjC,GACA2uF,UAAA,EAAAz5M,GAEA,IAAAgzH,WAAAlI,GAMA,SAAA4uF,EAAA5uF,GAEA,OADA,IAAAwjC,SAAAxjC,EAAA1gB,QACAuvG,UAAA,GAuGA,SAAAC,EAAA9uF,GACA,MAAA+uF,EAAA/uF,EAAAnrJ,MAAA,EAAAmrJ,EAAAtrJ,OAAA,GACAs6O,EAAAhvF,EAAAnrJ,MAAAmrJ,EAAAtrJ,OAAA,GAGA,OAFAozJ,EAAAinF,EAAA,UAEA,IADAH,EAAAI,GAvOAlsT,EAAAC,QAAAurT,EAsBAA,EAAAzgN,SAAA,SAAAisC,EAAAkmF,GAEA,OADAssF,EAAAxyK,GACAh1I,MACA,KAAA,EACA,KAAA,GACA,OAyEA,SAAAmqT,GACA,MAAAT,EAAAxkD,EAAAn8J,SAAAohN,GACA,IAAAT,IAAAxkD,EAAAykD,KAAAD,GACA,MAAA,IAAAjmN,MAAA,sBAEA,OAAAimN,EA9EAU,CAAAlvF,GAEA,KAAA,EACA,KAAA,IACA,KAAA,GACA,KAAA,IACA,OAAA4uF,EAAA5uF,GAAAnyH,WAEA,KAAA,GACA,KAAA,GACA,KAAA,GACA,KAAA,GACA,KAAA,IACA,KAAA,IACA,OAkGA,SAAAmyH,GACA,MAAAtzH,EAAA0+H,EAAAv3H,OAAAmsH,GAGA,IAFAA,EAAAA,EAAAnrJ,MAAAu2J,EAAAv3H,OAAAu0H,QAEA1zJ,SAAAg4B,EACA,MAAA,IAAAnE,MAAA,wBAGA,OAAAu/H,EAAA9H,GA1GAmvF,CAAAnvF,GAEA,KAAA,IACA,OA0HA,SAAAA,GACA,MAAAtzH,EAAA0+H,EAAAv3H,OAAAmsH,GACA2tF,EAAA3tF,EAAAnrJ,MAAAu2J,EAAAv3H,OAAAu0H,OAEA,GAAAulF,EAAAj5O,SAAAg4B,EACA,MAAA,IAAAnE,MAAA,wBAGA,OAAAu/H,EAAA6lF,EAAA,aAlIAyB,CAAApvF,GACA,KAAA,IAEA,KAAA,IACA,OAAA8uF,EAAA9uF,GACA,QACA,OAAA8H,EAAA9H,EAAA,YAIAsuF,EAAAvlF,QAAA,SAAAjvF,EAAA70C,GAEA,OADAqnN,EAAAxyK,GACAh1I,MACA,KAAA,EAEA,KAAA,GACA,OAAAypT,EAAAtpN,GAEA,KAAA,EACA,KAAA,IACA,KAAA,GACA,KAAA,IACA,OAAAypN,EAAA74O,SAAAovB,EAAA,KAEA,KAAA,GACA,KAAA,GACA,KAAA,GACA,KAAA,GACA,KAAA,IACA,KAAA,IACA,OAwDA,SAAAA,GACA,MAAA+6H,EAAA6H,EAAA5iI,GACAyH,EAAAw7H,WAAAhvE,KAAAkyE,EAAAr4H,OAAAitH,EAAAtrJ,SACA,OAAA22J,EAAA,CAAA3+H,EAAAszH,GAAAtzH,EAAAh4B,OAAAsrJ,EAAAtrJ,QA3DA26O,CAAApqN,GAEA,KAAA,IACA,OA4EA,SAAA6d,GAEA,MAAA0kH,EAAA,IAAAxJ,EAAAl7G,GAAAi7G,UACArxH,EAAAw7H,WAAAhvE,KAAAkyE,EAAAr4H,OAAAy0H,EAAA9yJ,SACA,OAAA22J,EAAA,CAAA3+H,EAAA86H,GAAA96H,EAAAh4B,OAAA8yJ,EAAA9yJ,QAhFA46O,CAAArqN,GACA,KAAA,IACA,OAqGA,SAAAA,GACA,MAAAwnN,EAAAxnN,EAAA1V,MAAA,KACA,GAAA,IAAAk9N,EAAA/3O,OACA,MAAA,IAAA6zB,MAAA,+BAAAkkN,EAAA,mCAEA,GAAA,KAAAA,EAAA,GAAA/3O,OACA,MAAA,IAAA6zB,MAAA,+BAAAkkN,EAAA,GAAA,6BAIA,MAAAzsF,EAAApC,EAAA/pH,OAAA,IAAA44M,EAAA,IAGAv3M,EAAAr/B,SAAA42O,EAAA,GAAA,IACA,GAAAv3M,EAAA,GAAAA,EAAA,MACA,MAAA,IAAA3M,MAAA,yCAEA,MAAAgnN,EAAAb,EAAAx5M,GACA,OAAAm2H,EAAA,CAAArL,EAAAuvF,GAAAvvF,EAAAtrJ,OAAA66O,EAAA76O,QAvHA86O,CAAAvqN,GACA,KAAA,IACA,OA2HA,SAAAA,GACA,MAAAwnN,EAAAxnN,EAAA1V,MAAA,KACA,GAAA,IAAAk9N,EAAA/3O,OACA,MAAA,IAAA6zB,MAAA,+BAAAkkN,EAAA,mCAEA,GAAA,KAAAA,EAAA,GAAA/3O,OACA,MAAA,IAAA6zB,MAAA,+BAAAkkN,EAAA,GAAA,8BAGA,MAAAzsF,EAAApC,EAAA/pH,OAAA,IAAA44M,EAAA,IAGAv3M,EAAAr/B,SAAA42O,EAAA,GAAA,IACA,GAAAv3M,EAAA,GAAAA,EAAA,MACA,MAAA,IAAA3M,MAAA,yCAEA,MAAAgnN,EAAAb,EAAAx5M,GACA,OAAAm2H,EAAA,CAAArL,EAAAuvF,GAAAvvF,EAAAtrJ,OAAA66O,EAAA76O,QA5IA+6O,CAAAxqN,GACA,QACA,OAAA4iI,EAAA5iI,EAAA,iOC9FA,aAEA,MAAAyqN,EAAA1sT,EAAA,SACA8kO,EAAA9kO,EAAA,yBAEAyrT,EAAAiB,EACAC,EAAAD,EAAAE,GACAC,EAAAH,EAAAI,GAIA/mF,EAAA,SAAAihC,EAAA+lD,EAAAv7O,GAGA,IAAA6F,EAEA,GAJA7F,IAAAA,EAIAm7O,EAAA3lD,GACA3vL,EAAA01O,GAAA,IAAA7nF,WAAA1zJ,EAAA,GAGAw1L,EAAAz6K,MAAA,OAAA1V,KAAA,SAAAm2O,GACA31O,EAAA7F,KAAA,IAAAqB,SAAAm6O,EAAA,YAEA,GAAAH,EAAA7lD,GAAA,CACA,MAAApxJ,EAAAoxJ,EAAAz6K,MAAA,IAAA,GAEA,IAAA3Y,EACA,IAAAA,EAAA,EAAAA,EAAAgiC,EAAAlkC,OAAAkC,IAAA,CAEA,IAAAq5O,EADAN,EAAA/2M,EAAAhiC,MAIAq5O,EAAAlnF,EAAAnwH,EAAAhiC,IACAgiC,EAAAhiC,GAAAkxJ,EAAAmoF,EAAAp7O,MAAA,EAAA,GAAA,WAGAo7O,KAAAr5O,EAAA,GACAgiC,EAAA1+B,OAAAtD,EAAA,EAAAkxJ,EAAAmoF,EAAAp7O,MAAA,EAAA,GAAA,WAIA,GAAA,KAAA+jC,EAAA,GACA,KAAAA,EAAAlkC,OAAA,GAAAkkC,EAAArwB,QAAA,UACA,GAAA,KAAAqwB,EAAAA,EAAAlkC,OAAA,GACA,KAAAkkC,EAAAlkC,OAAA,GAAAkkC,EAAAr+B,KAAA,UACA,GAAAq+B,EAAAlkC,OAAA,EAAA,CACA,IAAAkC,EAAA,EAAAA,EAAAgiC,EAAAlkC,QAAA,KAAAkkC,EAAAhiC,GAAAA,KACA,MAAAiuJ,EAAA,CAAAjuJ,EAAA,KACA,IAAAA,EAAA,EAAAgiC,EAAAlkC,OAAAkC,EAAA,EAAAA,IACAiuJ,EAAAtqJ,KAAA,KAEAq+B,EAAA1+B,OAAA24H,MAAAj6F,EAAAisH,GAIA,IADAxqJ,EAAA01O,GAAA,IAAA7nF,WAAA1zJ,EAAA,IACAoC,EAAA,EAAAA,EAAAgiC,EAAAlkC,OAAAkC,IAAA,CACA,MAAAq7C,EAAAp8C,SAAA+iC,EAAAhiC,GAAA,IACAyD,EAAA7F,KAAAy9C,GAAA,EAAA,IACA53C,EAAA7F,KAAA,IAAAy9C,GAIA,IAAA53C,EACA,MAAAkuB,MAAA,uBAAAyhK,GAGA,OAAA3vL,GA+BAv3E,EAAAC,QAAA,CACA0rT,KAAAA,EACAkB,KAAAA,EACAE,KAAAA,EACA9mF,QAAAA,EACAl7H,SA/BA,SAAAkiN,EAAAv7O,EAAAE,GACAF,IAAAA,EACAE,EAAAA,GAAAq7O,EAAAr7O,OAAAF,EAEA,MAAA6F,EAAA,GACA,IAAA+wB,EACA,MAAA65J,EAAA,IAAAzB,SAAAusD,EAAAzwG,QACA,GAAA,IAAA5qI,EAAA,CAEA,IAAA,IAAAkC,EAAA,EAAAA,EAAAlC,EAAAkC,IACAyD,EAAAE,KAAAw1O,EAAAv7O,EAAAoC,IAEAw0B,EAAA/wB,EAAAN,KAAA,UACA,GAAA,KAAArF,EAAA,CAEA,IAAA,IAAAkC,EAAA,EAAAA,EAAAlC,EAAAkC,GAAA,EACAyD,EAAAE,KAAA0qL,EAAA4pD,UAAAr6O,EAAAoC,GAAAi3B,SAAA,KAEAzC,EAAA/wB,EAAAN,KAAA,KACAqxB,EAAAA,EAAAziB,QAAA,qBAAA,UACAyiB,EAAAA,EAAAziB,QAAA,SAAA,MAGA,OAAAyiB,iFC9FA,aACA,MAAA8kN,EAAAltT,EAAA,YAEA0sT,EAAAtkN,GAAA8kN,EAAA,CAAA92K,OAAA,IAAAlkE,KAAAk2B,GACAskN,EAAAE,GAAAxkN,GAAA8kN,EAAAN,GAAA,CAAAx2K,OAAA,IAAAlkE,KAAAk2B,GACAskN,EAAAI,GAAA1kN,GAAA8kN,EAAAJ,GAAA,CAAA12K,OAAA,IAAAlkE,KAAAk2B,GACAskN,EAAAv8M,QAAA/H,GAAAskN,EAAAtkN,GAAAskN,EAAAE,GAAAxkN,GAAA,EAAA,OAAAjmG,EAEArC,EAAAC,QAAA2sT,kDCRA,aAEA,MAAAz9L,EAAA,eACAlpC,EAAA3kF,GAAAA,GAAAA,EAAA+rT,kBACA,mBAAAl+L,UAAAA,eACA,GAEA29L,EAAA,iGAEAQ,EAAA,mBACAN,EAAA,aAEAM,YAAAA,oFACAA,YAAAR,MAAAQ,mHACAA,aAAAR,SAAAQ,+GACAA,gBAAAA,WAAAR,SAAAQ,6FACAA,gBAAAA,WAAAR,SAAAQ,6FACAA,gBAAAA,WAAAR,SAAAQ,6FACAA,gBAAAA,WAAAR,SAAAQ,qGACAA,WAAAR,SAAAQ,sLAEAznO,QAAA,eAAA,IAAAA,QAAA,MAAA,IAAA1B,OAGAopO,EAAA,IAAA5pM,OAAA,OAAAmpM,WAAAE,OACAQ,EAAA,IAAA7pM,OAAA,IAAAmpM,MACAW,EAAA,IAAA9pM,OAAA,IAAAqpM,MAEA9lD,EAAA5lQ,GAAAA,GAAAA,EAAAg1I,MACAi3K,EACA,IAAA5pM,OAAA,MAAA19B,EAAA3kF,KAAAwrT,IAAA7mO,EAAA3kF,UAAA2kF,EAAA3kF,KAAA0rT,IAAA/mO,EAAA3kF,MAAA,KAEA4lQ,EAAA4lD,GAAAxrT,GAAAA,GAAAA,EAAAg1I,MAAAk3K,EAAA,IAAA7pM,OAAA,GAAA19B,EAAA3kF,KAAAwrT,IAAA7mO,EAAA3kF,KAAA,KACA4lQ,EAAA8lD,GAAA1rT,GAAAA,GAAAA,EAAAg1I,MAAAm3K,EAAA,IAAA9pM,OAAA,GAAA19B,EAAA3kF,KAAA0rT,IAAA/mO,EAAA3kF,KAAA,KAEAtB,EAAAC,QAAAinQ,gCCnCA,aASA,SAAAwmD,EAAA12K,GACA,GAAA,iBAAA,EAAA,CACA,GAAA02K,EAAAllF,MAAAxxF,GACA,OAAA02K,EAAAllF,MAAAxxF,GAGA,MAAA,IAAAvxC,MAAA,0BAAAuxC,GACA,GAAA,iBAAA,EAAA,CACA,GAAA02K,EAAAp9M,MAAA0mC,GACA,OAAA02K,EAAAp9M,MAAA0mC,GAGA,MAAA,IAAAvxC,MAAA,0BAAAuxC,GAGA,MAAA,IAAAvxC,MAAA,6BAAAuxC,GAGA,MAAA6qK,GAAA,EAmEA,SAAAhuO,EAAA7xE,EAAA4nG,EAAApqG,EAAAmrT,EAAArrT,GACA,MAAA,CACA0C,KAAAA,EACA4nG,KAAAA,EACApqG,KAAAA,EACAmrT,WAAA3gO,QAAA2gO,GACArrT,KAAA0qF,QAAA1qF,IAxEAouT,EAAAC,sBAAA9L,EACA6L,EAAA7L,EAAAA,EAGA6L,EAAAvkD,MAAA,CACA,CAAA,EAAA,GAAA,OACA,CAAA,EAAA,GAAA,OACA,CAAA,GAAA,GAAA,QACA,CAAA,GAAA,IAAA,OACA,CAAA,GAAA04C,EAAA,WACA,CAAA,GAAAA,EAAA,MAAA,cACA,CAAA,GAAAA,EAAA,OAAA,cACA,CAAA,GAAAA,EAAA,OAAA,cACA,CAAA,GAAAA,EAAA,UAAA,cACA,CAAA,IAAA,GAAA,QACA,CAAA,IAAA,GAAA,OACA,CAAA,IAAA,EAAA,mBACA,CAAA,IAAA,EAAA,qBACA,CAAA,IAAA,EAAA,gBACA,CAAA,IAAA,EAAA,eACA,CAAA,IAAA,EAAA,OACA,CAAA,IAAA,EAAA,OACA,CAAA,IAAAA,EAAA,QAAA,EAAA,QAIA,CAAA,IAAAA,EAAA,QAEA,CAAA,IAAAA,EAAA,OACA,CAAA,IAAA,EAAA,SACA,CAAA,IAAA,GAAA,SACA,CAAA,IAAA,IAAA,UACA,CAAA,IAAAA,EAAA,YACA,CAAA,IAAA,EAAA,QACA,CAAA,IAAA,EAAA,MACA,CAAA,IAAA,EAAA,OACA,CAAA,IAAA,EAAA,sBACA,CAAA,IAAA,EAAA,QACA,CAAA,IAAAA,EAAA,WAGA6L,EAAAp9M,MAAA,GAEAo9M,EAAAllF,MAAA,GAGAklF,EAAAvkD,MAAApyL,KAAA62O,IACA,MAAA52K,EAAAnjE,EAAAk8H,MAAA,KAAA69G,GAGA,OAFAF,EAAAllF,MAAAxxF,EAAAh1I,MAAAg1I,EACA02K,EAAAp9M,MAAA0mC,EAAAx3I,MAAAw3I,EACA,QAGA02K,EAAA7qL,OAAAhvD,EAuBA7zE,EAAAC,QAAAytT,gCCxGA1tT,EAAAC,QAAA,CACAgwG,OAAA/vG,EAAA,eACA6wG,OAAA7wG,EAAA,eACA2rO,eAAA3rO,EAAA,+GCHAF,EAAAC,QAOA,SAAAgwG,EAAAoO,EAAAqvB,EAAAh8D,GACA,GAAAoB,OAAA+6O,kBAAAxvM,EAAAvrC,OAAA+6O,iBAEA,MADA59M,EAAAq1H,MAAA,EACA,IAAA4G,WAAA,2BAEAx+F,EAAAA,GAAA,GAEA,IAAAo+F,EADAp6J,EAAAA,GAAA,EAGA,KAAA2sC,GAAA0tH,GACAr+F,EAAAh8D,KAAA,IAAA2sC,EAfA,IAgBAA,GAAA,IAEA,MAhBA,IAgBAA,GACAqvB,EAAAh8D,KAAA,IAAA2sC,EAnBA,IAoBAA,KAAA,EAMA,OAJAqvB,EAAAh8D,GAAA,EAAA2sC,EAEApO,EAAAq1H,MAAA5zJ,EAAAo6J,EAAA,EAEAp+F,GA1BA,IAGAq+F,EAAAx5J,KAAAy5J,IAAA,EAAA,kCCLAhsO,EAAAC,QAKA,SAAA09N,EAAAT,EAAAxrJ,GACA,IAIAuU,EAJAvN,EAAA,EAEA44B,EAAA,EACA26H,EAFAv6J,EAAAA,GAAA,EAIAgkB,EAAAwnI,EAAAtrJ,OAEA,EAAA,CACA,GAAAq6J,GAAAv2I,GAAA4b,EAAA,GAEA,MADAqsH,EAAA2H,MAAA,EACA,IAAA4G,WAAA,2BAEAjmJ,EAAAi3I,EAAA+O,KACAvzJ,GAAA44B,EAAA,IAhBA,IAiBArrB,IAAAqrB,GAjBA,IAkBArrB,GAAA1T,KAAAy5J,IAAA,EAAA16H,GACAA,GAAA,QACArrB,GArBA,KAyBA,OAFA03I,EAAA2H,MAAA2G,EAAAv6J,EAEAgH,iCC1BA,IAAAyzJ,EAAA55J,KAAAy5J,IAAA,EAAA,GACAI,EAAA75J,KAAAy5J,IAAA,EAAA,IACAK,EAAA95J,KAAAy5J,IAAA,EAAA,IACAM,EAAA/5J,KAAAy5J,IAAA,EAAA,IACAO,EAAAh6J,KAAAy5J,IAAA,EAAA,IACAQ,EAAAj6J,KAAAy5J,IAAA,EAAA,IACAS,EAAAl6J,KAAAy5J,IAAA,EAAA,IACAU,EAAAn6J,KAAAy5J,IAAA,EAAA,IACAW,EAAAp6J,KAAAy5J,IAAA,EAAA,IAEAhsO,EAAAC,QAAA,SAAAI,GACA,OACAA,EAAA8rO,EAAA,EACA9rO,EAAA+rO,EAAA,EACA/rO,EAAAgsO,EAAA,EACAhsO,EAAAisO,EAAA,EACAjsO,EAAAksO,EAAA,EACAlsO,EAAAmsO,EAAA,EACAnsO,EAAAosO,EAAA,EACApsO,EAAAqsO,EAAA,EACArsO,EAAAssO,EAAA,EACA,kCCtBA,aAEA,MAAAm7E,UAAAA,GAAA5nT,EAAA,aAWA4tT,EAAA/gL,EAAA,QACAghL,EAAAhhL,EAAA,QACAihL,EAAAjhL,EAAA,WACAkhL,EAAA5wL,EACA0P,EAAA,OACAihL,EACAF,EACAC,GAGAG,EAAA7wL,EAAA0P,EAAA,OAAAA,EAAA,QACAohL,EAAA9wL,EACAD,EAAA8wL,EAAAnhL,EAAA,QACA3P,EAAA6wL,EAAAlhL,EAAA,SAEAqhL,EAAAhxL,EAAA8wL,EAAAnhL,EAAA,QACAshL,EAAAjxL,EAAAgxL,EAAArhL,EAAA,QAEAuhL,EAAAlxL,EAAAgxL,EAAArhL,EAAA,SAEAwhL,EAAAlxL,EACAD,EAAA+wL,EAAAphL,EAAA,OACA3P,EAAA6wL,EAAAlhL,EAAA,QAGAyhL,EAAAnxL,EACAD,EAAA+wL,EAAAphL,EAAA,QACA3P,EAAA6wL,EAAAlhL,EAAA,SAGAouF,EAAA99F,EACAD,EAAA+wL,EAAAphL,EAAA,SACA3P,EAAA8wL,EAAAnhL,EAAA,SACA3P,EAAA6wL,EAAAlhL,EAAA,UAGA0hL,EAAApxL,EACAD,EAAA+wL,EAAAphL,EAAA,UACA3P,EAAA8wL,EAAAnhL,EAAA,UACA3P,EAAA6wL,EAAAlhL,EAAA,WAGA2hL,EAAArxL,EACAD,EAAAmxL,EAAAxhL,EAAA,mBAAAA,EAAA,QACA3P,EAAAoxL,EAAAzhL,EAAA,mBAAAA,EAAA,QACA3P,EAAAmxL,EAAAxhL,EAAA,oBACA3P,EAAAoxL,EAAAzhL,EAAA,qBAGA4hL,EAAAtxL,EACAD,EAAAmxL,EAAAxhL,EAAA,sBAAAA,EAAA,QACA3P,EAAAoxL,EAAAzhL,EAAA,sBAAAA,EAAA,QACA3P,EAAAmxL,EAAAxhL,EAAA,uBACA3P,EAAAoxL,EAAAzhL,EAAA,wBAGA6hL,EAAAvxL,EACAD,EAAA+9F,EAAApuF,EAAA,qBAAAA,EAAA,QACA3P,EAAAqxL,EAAA1hL,EAAA,qBAAAA,EAAA,QACA3P,EAAA+9F,EAAApuF,EAAA,sBACA3P,EAAAqxL,EAAA1hL,EAAA,uBAGA8hL,EAAAxxL,EACAkxL,EACAC,EACArzF,EACAszF,EACAC,EACAE,EACAT,EACAE,EACAC,EACAL,GAIAa,EAAAzxL,EACAD,EAAAyxL,EAAA9hL,EAAA,gBAAAA,EAAA,QACA3P,EAAAyxL,EAAA9hL,EAAA,kBAGAgiL,EAAA1xL,EACAD,EAAAyxL,EAAA9hL,EAAA,QACA2hL,EACAE,EACA7hL,EAAA,QAGAiiL,EAAA3xL,EACAD,EAAA2xL,EAAAhiL,EAAA,eAAAgiL,GACA3xL,EAAA2xL,EAAAhiL,EAAA,gBACA3P,EAAA2P,EAAA,eAAAgiL,GACA3xL,EAAAyxL,EAAA9hL,EAAA,gBACA3P,EAAA2P,EAAA,eAAA8hL,GACA9hL,EAAA,gBAGAkiL,EAAA,IAAA5xL,EACAD,EAAA4xL,EAAAC,GACAD,GAGAE,EAAAD,IAEA/F,EAAA7rL,EACAD,EAAA8xL,EAAAH,EAAAG,GACA9xL,EAAA2xL,EAAAG,GACA9xL,EAAA8xL,EAAAH,GACAG,EACAH,GAkCA,SAAAI,EAAAC,GAwBA,OApBA,SAAA57O,GACA,IAAAs0O,EAAAM,YAAA50O,GACA,IACAA,EAAA,IAAAs0O,EAAAt0O,GACA,MAAA4yB,GACA,OAAA,EAGA,MAAAsnC,EAAA0hL,EAAA57O,EAAAo3O,cACA,OAAA,OAAAl9K,KAIA,IAAAA,IAAA,IAAAA,EACAA,EAGA,IAAAA,EAAA97D,SAUA,SAAAwrD,KAAAr6C,GAIA,SAAAqsO,EAAA57O,GACA,GAAAA,EAAA5B,OAAAmR,EAAAnR,OACA,OAAA,KAIA,IAAA87D,EAAAl6D,EAkBA,OAhBAuP,EAAAxP,MAAAQ,IACA25D,EAAA,mBAAA35D,EACAA,IAAAq7O,aAAA57O,GACAO,EAAAq7O,aAAA57O,GAEAg3B,MAAA/gB,QAAAikD,KACAl6D,EAAAk6D,GAGA,OAAAA,KAOAA,EAGA,MAAA,CACA3iC,SAAA,WAAA,MAAA,KAAAhoB,EAAA9L,KAAA,KAAA,MACA0kB,MAAA5Y,EACAyO,QAAA29N,EAAAC,GACAA,aAAAA,GAQA,SAAA/xL,KAAAt6C,GAIA,SAAAqsO,EAAA57O,GACA,IAAAk6D,EAAA,KAYA,OAXA3qD,EAAAxP,MAAAQ,IACA,MAAA2E,EAAA,mBAAA3E,EACAA,IAAAq7O,aAAA57O,GACAO,EAAAq7O,aAAA57O,GACA,QAAAkF,IACAg1D,EAAAh1D,GACA,MAKAg1D,EAUA,MAPA,CACA3iC,SAAA,WAAA,MAAA,KAAAhoB,EAAA9L,KAAA,KAAA,MACA0kB,MAAA5Y,EACAyO,QAAA29N,EAAAC,GACAA,aAAAA,GAUA,SAAAriL,EAAAnsI,GACA,MAAApB,EAAAoB,EAmCA,MAAA,CACAmqG,SAAA,WAAA,OAAAvrG,GACAgyF,QAhCA,SAAAhe,GACA,GAAA,iBAAAA,EACA,IACAA,EAAA,IAAAs0O,EAAAt0O,GACA,MAAA4yB,GACA,OAAA,EAIA,MAAAipN,EAAA77O,EAAAo3O,aACA,OAAA,IAAAyE,EAAAz9O,QAAAy9O,EAAA,KAAA7vT,GAuBA4vT,aAdA,SAAAlF,GACA,OAAA,IAAAA,EAAAt4O,OACA,KAGAs4O,EAAA,KAAA1qT,EACA0qT,EAAAn4O,MAAA,GAEA,OA5KA/xE,EAAAC,QAAA,CACAguT,IAAAA,EACAH,KAAAA,EACAC,KAAAA,EACAC,QAAAA,EACAE,GAAAA,EACAC,IAAAA,EACAC,IAAAA,EACAE,KAAAA,EACAD,IAAAA,EACAlzF,KAAAA,EACAszF,MAAAA,EACAF,WAAAA,EACAC,iBAAAA,EACAG,cAAAA,EACAD,WAAAA,EACAE,aAAAA,EACAC,SAAAA,EACAC,SAAAA,EACAI,QAAAA,EACAhG,IAAAA,EACAoG,KAAApG,kDCnJA,aAEA,MAAAt9D,EAAA1rP,EAAA,YACA+6N,EAAA/6N,EAAA,eACAy6N,EAAAz6N,EAAA,YACAymO,EAAAzmO,EAAA,sBAeA+/I,eAAAsvK,EAAAjqF,EAAAuoD,EAAAj8M,GACA,MAAAi0J,QAAA0pF,EAAA1pF,OAAAP,EAAAuoD,EAAAj8M,GACA,OAAAqpJ,EAAAhrH,OAAA41H,EAAAgoD,EAAAj8M,GAMA29O,EAAAt0F,UAAAA,EAQAs0F,EAAA1pF,OAAA5lF,MAAAqlF,EAAAuoD,EAAAj8M,KACA,MAAAouC,EAAAuvM,EAAAC,WAAA3hC,GACAhoD,QAAA7lH,EAAAslH,GACA,OAAA1zJ,EAAAi0J,EAAA9zJ,MAAA,EAAAH,GAAAi0J,GASA0pF,EAAAC,WAAA,SAAA3hC,GACA,IAAAA,EAAA,CAEA,MADAjiC,EAAA,IAAAnmJ,MAAA,oCAAA,oCAIA,MAAAzjG,EAAAi5N,EAAAyN,WAAAmlD,GACA,IAAA0hC,EAAAp/L,UAAAnuH,GACA,MAAA4pP,EAAA,IAAAnmJ,MAAA,uBAAAooL,wBAAA,oCAGA,OAAA0hC,EAAAp/L,UAAAnuH,IASAutT,EAAAp/L,UAAA,CAEA1zC,EAAAk+I,EAAAvnH,SAEA11B,GAAAi9I,EAAAiS,KAEAjvJ,GAAAg9I,EAAA80F,QAEA7xO,GAAA+8I,EAAA+0F,QAEA5xO,GAAA68I,EAAAg1F,QAEA9xO,GAAA88I,EAAAi1F,QAEA7xO,GAAA48I,EAAAk1F,QAEA7xO,GAAA28I,EAAAm1F,QAEA7xO,GAAA08I,EAAAo1F,SAEA7xO,GAAAy8I,EAAAq1F,SAEA7xO,GAAAw8I,EAAAs1F,UAEA7xO,GAAAu8I,EAAAu1F,UAEA7xO,GAAAs8I,EAAAw1F,UAEA7xO,GAAAq8I,EAAAy1F,UAEAzxO,GAAAg8I,EAAA01F,WAEAzxO,GAAA+7I,EAAA21F,UAEAC,GAAA51F,EAAA61F,YAIA71F,EAAA81F,SAAAlB,EAAAp/L,WAOAo/L,EAAA3mF,SAAA3oF,MAAAqlF,EAAAtlH,KACA,MAAA0wM,QAAAnB,EAAAjqF,EAAArK,EAAAlqH,OAAAiP,GAAAxgH,MAEA,OAAAmnO,EAAA3mH,EAAA0wM,IAGA1wT,EAAAC,QAAAsvT,sHCvHA,aAEA,MAAAoB,EAAAzwT,EAAA,WAEA0wT,EAAA1wT,EAAA,4BACAuuK,QAAAm+G,GAAA1sR,EAAA,UACA2wT,qBAAAA,GAAA3wT,EAAA,WACA6kO,EAAA7kO,EAAA,2BAUA8/G,EAAAkqJ,GAAAjqH,MAAAoZ,IACA,OAAA6wG,GACA,IAAA,WACA,OAAA,IAAA9kC,WAAAurF,EAAAG,SAAAC,YAAA13J,IACA,IAAA,WACA,OAAA,IAAA+rE,WAAAurF,EAAAK,SAAAD,YAAA13J,IACA,IAAA,WACA,OAAA,IAAA+rE,WAAAurF,EAAAM,SAAAF,YAAA13J,IACA,IAAA,WACA,OAAA,IAAA+rE,WAAAurF,EAAAO,SAAAH,YAAA13J,IACA,IAAA,YACA,OAAA,IAAA+rE,WAAAurF,EAAAZ,SAAAlvT,OAAA,KAAAyhK,OAAAjJ,GAAA03J,eACA,IAAA,YACA,OAAA,IAAA3rF,WAAAurF,EAAAX,SAAAnvT,OAAA,KAAAyhK,OAAAjJ,GAAA03J,eACA,IAAA,aACA,OAAA,IAAA3rF,WAAAurF,EAAAV,UAAAc,YAAA13J,IACA,IAAA,aACA,OAAA,IAAA+rE,WAAAurF,EAAAT,UAAAa,YAAA13J,IACA,IAAA,aACA,OAAA,IAAA+rE,WAAAurF,EAAAR,UAAAY,YAAA13J,IACA,IAAA,aACA,OAAA,IAAA+rE,WAAAurF,EAAAP,UAAAW,YAAA13J,IACA,IAAA,cACA,OAAA0rE,EAAA6rF,EAAAO,IAAAC,QAAA/3J,GAAA,UACA,IAAA,aACA,OAAAw3J,EAAAD,EAAAS,IAAAC,OAAAj4J,IAEA,QACA,MAAA,IAAA3nD,UAAA,GAAAw4J,oCAOAlqQ,EAAAC,QAAA,CACAmzG,SAHAimD,GAAAA,EAIAuzE,KAAAggD,EAAA,QACA6iC,QAAA7iC,EAAA,YACA8iC,QAAA9iC,EAAA,YACA4jC,WAAA5jC,EAAA,gBACAkjC,QAAA9vM,EAAA,YACA6vM,QAAA7vM,EAAA,YACA4vM,QAAA5vM,EAAA,YACA2vM,QAAA3vM,EAAA,YACA+vM,SAAA/vM,EAAA,aACAgwM,SAAAhwM,EAAA,aACAiwM,UAAAjwM,EAAA,cACAkwM,UAAAlwM,EAAA,cACAmwM,UAAAnwM,EAAA,cACAowM,UAAApwM,EAAA,cACAqwM,WAAArwM,EAAA,eACAswM,UAAAtwM,EAAA,cACAywM,SAAAvwT,EAAA;A;A;A;A;A;A;A;A;YC5DE,iBAEIqxT,EAAc,wBAEdC,EAA2B,iBAAXtlN,OAChB9e,EAAOokO,EAAStlN,OAAAA,GAChB9e,EAAKqkO,oBACPD,GAAS,OAEPE,GAAcF,GAA0B,iBAATvlN,MACpB7e,EAAKukO,oBAAyC,iBAAZlzH,GAAwBA,EAAQujC,UAAYvjC,EAAQujC,SAASpuJ,KAE5GwZ,EAAO+e,EACEulN,IACTtkO,EAAO6e,UAEL2lN,GAAaxkO,EAAKykO,sBAA0C,iBAAX7xT,GAAuBA,EAAOC,QAC/E6xT,EAAwB,mBAAXC,GAAyBA,EAAOC,IAC7CC,GAAgB7kO,EAAK8kO,yBAAkD,oBAAhBtnF,YACvDunF,EAAAA,mBAA+B1lO,MAAM,IAErC2lO,EAAAA,CAAkB,EAAG,KAAM,OAAQ,UAGnCC,EAAAA,CAAS,EAAG,EAAG,GAAI,IACnBC,EAAAA,CAAM,EAAG,EAAG,MAAO,EAAG,MAAO,WAAY,WAAY,WAAY,MAAO,EAAG,WAC7E,EAAG,WAAY,WAAY,MAAO,WAAY,IAAK,EAAG,IAAK,EAAG,WAAY,EAC1E,WAAY,EAAG,WAAY,EAAG,IAAK,WAAY,MAAO,WAAY,MAClE,WAAY,MAAO,WAAY,IAAK,WAAY,MAAO,EAAG,WAAY,WACtE,WAAY,WAAY,MAAO,WAAY,WAAY,EAAG,WAAY,YACpEC,EAAAA,CAAQ,IAAK,IAAK,IAAK,KACvBC,EAAAA,CAAc,IAAK,KACnBC,EAAAA,CAAgB,MAAO,SAAU,cAAe,QAAS,UACzDC,EAAAA,CACFvjP,IAAO,IACPwjP,IAAO,MAGLvlO,EAAKukO,oBAAuBnnN,MAAM/gB,UACpC+gB,MAAM/gB,QAAU,SAAU+hB,SACuB,mBAAxCrrG,OAAOmqG,UAAUS,SAASR,KAAKiB,MAItCymN,IAAiB7kO,EAAKwlO,iCAAoChoF,YAAYC,SACxED,YAAYC,OAAS,SAAUr/H,SACP,iBAARA,GAAoBA,EAAIgxG,QAAUhxG,EAAIgxG,OAAOljG,cAAgBsxH,sBAI3EioF,EAAqB,SAAU9rF,EAAMgrC,EAAS+gD,UACzC,SAAUxsO,cACJysO,EAAOhsF,EAAMgrC,EAAShrC,GAAMzkE,OAAOh8E,GAASwsO,OAIvDE,EAA0B,SAAUjsF,EAAMgrC,EAAS+gD,UAC9C,SAAUxsO,EAAS2sO,cACbF,EAAOhsF,EAAMgrC,EAASkhD,GAAY3wJ,OAAOh8E,GAASwsO,OAI7DI,EAA2B,SAAUnsF,EAAMgrC,EAAS+gD,UAC/C,SAAUxsO,EAAS2sO,EAAYryT,EAAGioF,UAChC8rG,EAAQ,SAAWoyC,GAAMzkE,OAAOh8E,EAAS2sO,EAAYryT,EAAGioF,GAAGiqO,OAIlEK,EAAyB,SAAUpsF,EAAMgrC,EAAS+gD,UAC7C,SAAUnxT,EAAK2kF,EAAS2sO,EAAYpqO,UAClC8rG,EAAQ,OAASoyC,GAAMzkE,OAAO3gK,EAAK2kF,EAAS2sO,EAAYpqO,GAAGiqO,OAIlEM,EAAsB,SAAUrpL,EAAQspL,EAActsF,EAAMgrC,WACrDj+L,EAAI,EAAGA,EAAI2+O,EAAa7gP,SAAUkC,EAAAA,KACrCL,EAAOg/O,EAAa3+O,GACxBi2D,EAAOt2D,GAAQ4/O,EAAatsF,EAAMgrC,EAASt+L,UAEtCs2D,GAGLspL,EAAe,SAAUtsF,EAAMgrC,OAC7BhoI,EAAS8oL,EAAmB9rF,EAAMgrC,EAAS,cAC/ChoI,EAAOlpI,OAAS,sBACHkyT,EAAOhsF,EAAMgrC,EAAShrC,IAEnCh9F,EAAOu4B,OAAS,SAAUh8E,UACjByjD,EAAOlpI,SAASyhK,OAAOh8E,IAEzB8sO,EAAoBrpL,EAAQ8oL,EAAoB9rF,EAAMgrC,IA0C3DlB,EAAAA,CAAAA,CACArxQ,KAAM,SAAUuyQ,QA/GhBuhD,CAAkB,EAAG,IAAK,MAAO,UA+GQvsF,KAAMwrF,EAAMc,aAAcA,IACnE7zT,KAAM,OAAQuyQ,QA/GdwhD,CAAW,EAAG,KAAM,OAAQ,WA+GIxsF,KAAMwrF,EAAMc,aAAcA,IAC1D7zT,KAAM,QAASuyQ,QAnHfyhD,CAAiB,GAAI,KAAM,QAAS,WAmHGzsF,KAAMyrF,EAAYa,aA1CrC,SAAUtsF,EAAMgrC,OAClChoI,EAASipL,EAAwBjsF,EAAMgrC,EAAS,cACpDhoI,EAAOlpI,OAAS,SAAUoyT,cACbF,EAAOhsF,EAAMgrC,EAASkhD,IAEnClpL,EAAOu4B,OAAS,SAAUh8E,EAAS2sO,UAC1BlpL,EAAOlpI,OAAOoyT,GAAY3wJ,OAAOh8E,IAEnC8sO,EAAoBrpL,EAAQipL,EAAyBjsF,EAAMgrC,MAmChEvyQ,KAAM,SAAUuyQ,QAASqgD,EAAgBrrF,KAAMyrF,EAAYa,aAhCtC,SAAUtsF,EAAMgrC,OACnC3gD,EAAIshG,EAAe3rF,GACnBh9F,EAASmpL,EAAyBnsF,EAAMgrC,EAAS,cACrDhoI,EAAOlpI,OAAS,SAAUoyT,EAAYryT,EAAGioF,UAClCjoF,GAAMioF,MAGEkqO,EAAOhsF,EAAMgrC,EAASkhD,GAAYQ,QAAAA,CAAS7yT,EAAGioF,GAAIuoI,GAFtDz8B,EAAQ,QAAUoyC,GAAMlmO,OAAOoyT,IAK1ClpL,EAAOu4B,OAAS,SAAUh8E,EAAS2sO,EAAYryT,EAAGioF,UACzCkhD,EAAOlpI,OAAOoyT,EAAYryT,EAAGioF,GAAGy5E,OAAOh8E,IAEzC8sO,EAAoBrpL,EAAQmpL,EAA0BnsF,EAAMgrC,MAoBjEvyQ,KAAM,OAAQuyQ,QAASqgD,EAAgBrrF,KAAMyrF,EAAYa,aAjBtC,SAAUtsF,EAAMgrC,OACjC3gD,EAAIshG,EAAe3rF,GACnBh9F,EAASopL,EAAuBpsF,EAAMgrC,EAAS,cACnDhoI,EAAOlpI,OAAS,SAAUc,EAAKsxT,EAAYpqO,cAC9B6qO,EAAK3sF,EAAMgrC,EAASkhD,GAAYQ,QAAAA,CAAS,OAAQ5qO,GAAIuoI,GAAGqiG,QAAAA,CAAS9xT,GAAMyvN,IAEpFrnF,EAAOu4B,OAAS,SAAU3gK,EAAK2kF,EAAS2sO,EAAYpqO,UAC3CkhD,EAAOlpI,OAAOc,EAAKsxT,EAAYpqO,GAAGy5E,OAAOh8E,IAE3C8sO,EAAoBrpL,EAAQopL,EAAwBpsF,EAAMgrC,MAW/Dp9E,EAAAA,GAAcg/H,EAAAA,GAET7/O,EAAI,EAAGA,EAAI+8L,EAAWj/L,SAAUkC,UACnCo2L,EAAY2G,EAAW/8L,GACvBizJ,EAAOmjC,EAAUnjC,KACZ9oI,EAAI,EAAGA,EAAI8oI,EAAKn1J,SAAUqsB,EAAAA,KAC7B21N,EAAa1pD,EAAU1qQ,KAAO,IAAMunO,EAAK9oI,MAC7C01N,EAAYl8O,KAAKm8O,GACjBj/H,EAAQi/H,GAAc1pD,EAAUmpD,aAAatsF,EAAK9oI,GAAIisK,EAAU6H,SACzC,SAAnB7H,EAAU1qQ,KAAS,KACjBq0T,EAAgB3pD,EAAU1qQ,KAAOunO,EAAK9oI,GAC1C01N,EAAYl8O,KAAKo8O,GACjBl/H,EAAQk/H,GAAiBl/H,EAAQi/H,IAKvC,SAAAb,EAAgBhsF,EAAMgrC,EAASkhD,GAC7BtmN,KAAK8kK,OAAAA,GACL9kK,KAAK9jB,EAAAA,GACL8jB,KAAKolK,QAAUA,EACfplK,KAAKsmN,WAAaA,EAClBtmN,KAAKimE,OAAQ,EACbjmE,KAAKmnN,WAAY,EACjBnnN,KAAKwtD,MAAQ,EACbxtD,KAAKhrB,MAAQ,EACbgrB,KAAKonN,WAAc,MAAQhtF,GAAQ,IAAO,EAC1Cp6H,KAAKqnN,UAAYrnN,KAAKonN,YAAc,EACpCpnN,KAAKsnN,aAAehB,GAAc,EAClCtmN,KAAKunN,YAA2B,GAAbjB,IAAoB,UAE9Bn/O,EAAI,EAAGA,EAAI,KAAMA,EACxB64B,KAAK9jB,EAAE/U,GAAK,EAyQhB,SAAA4/O,EAAc3sF,EAAMgrC,EAASkhD,GAC3BF,EAAOxoN,KAAKoC,KAAMo6H,EAAMgrC,EAASkhD,GAtQnCF,EAAOzoN,UAAUg4D,OAAS,SAAUh8E,MAC9BqmB,KAAKmnN,oBACGruN,MA/KO,+BAiLf0uN,EAAW1gP,SAAc6S,KAChB,WAAT7S,EAAS,IACE,WAATA,YAWQgyB,MAAM8rN,MAVA,OAAZjrO,YACQmf,MAAM8rN,MACPU,GAAgB3rO,EAAQgzB,cAAgBsxH,YACjDtkJ,EAAAA,IAAc8+I,WAAW9+I,aACfkkB,MAAM/gB,QAAQnD,IACnB2rO,GAAiBrnF,YAAYC,OAAOvkJ,cAC7Bmf,MAAM8rN,GAMtB4C,GAAY,UAGyCrgP,EAAG9xE,EADtDyvQ,EAAS9kK,KAAK8kK,OAAQuiD,EAAYrnN,KAAKqnN,UAAWpiP,EAAS0U,EAAQ1U,OACrEmiP,EAAapnN,KAAKonN,WAAY7hP,EAAQ,EAAG2W,EAAI8jB,KAAK9jB,EAE7C3W,EAAQN,GAAAA,IACT+6B,KAAKimE,UACPjmE,KAAKimE,OAAQ,EACb6+F,EAAO,GAAK9kK,KAAKwtD,MACZrmF,EAAI,EAAGA,EAAIigP,EAAa,IAAKjgP,EAChC29L,EAAO39L,GAAK,KAGZqgP,MACGrgP,EAAI64B,KAAKhrB,MAAOzP,EAAQN,GAAUkC,EAAIkgP,IAAa9hP,EACtDu/L,EAAO39L,GAAK,IAAMwS,EAAQpU,IAAUmgP,EAAY,EAANv+O,cAGvCA,EAAI64B,KAAKhrB,MAAOzP,EAAQN,GAAUkC,EAAIkgP,IAAa9hP,GACtDlwE,EAAOskF,EAAQ1B,WAAW1S,IACf,IACTu/L,EAAO39L,GAAK,IAAM9xE,GAAQqwT,EAAY,EAANv+O,KACvB9xE,EAAO,MAChByvQ,EAAO39L,GAAK,KAAO,IAAQ9xE,GAAQ,IAAOqwT,EAAY,EAANv+O,KAChD29L,EAAO39L,GAAK,KAAO,IAAe,GAAP9xE,IAAiBqwT,EAAY,EAANv+O,MACzC9xE,EAAO,OAAUA,GAAQ,OAClCyvQ,EAAO39L,GAAK,KAAO,IAAQ9xE,GAAQ,KAAQqwT,EAAY,EAANv+O,KACjD29L,EAAO39L,GAAK,KAAO,IAAS9xE,GAAQ,EAAK,KAAUqwT,EAAY,EAANv+O,KACzD29L,EAAO39L,GAAK,KAAO,IAAe,GAAP9xE,IAAiBqwT,EAAY,EAANv+O,OAElD9xE,EAAO,QAAoB,KAAPA,IAAiB,GAAqC,KAA9BskF,EAAQ1B,aAAa1S,IACjEu/L,EAAO39L,GAAK,KAAO,IAAQ9xE,GAAQ,KAAQqwT,EAAY,EAANv+O,KACjD29L,EAAO39L,GAAK,KAAO,IAAS9xE,GAAQ,GAAM,KAAUqwT,EAAY,EAANv+O,KAC1D29L,EAAO39L,GAAK,KAAO,IAAS9xE,GAAQ,EAAK,KAAUqwT,EAAY,EAANv+O,KACzD29L,EAAO39L,GAAK,KAAO,IAAe,GAAP9xE,IAAiBqwT,EAAY,EAANv+O,SAIxD64B,KAAKynN,cAAgBtgP,EACjBA,GAAKkgP,EAAAA,KACPrnN,KAAKhrB,MAAQ7N,EAAIkgP,EACjBrnN,KAAKwtD,MAAQs3G,EAAOsiD,GACfjgP,EAAI,EAAGA,EAAIigP,IAAcjgP,EAC5B+U,EAAE/U,IAAM29L,EAAO39L,GAEjBu6E,EAAExlE,GACF8jB,KAAKimE,OAAQ,OAEbjmE,KAAKhrB,MAAQ7N,SAGV64B,MAGTomN,EAAOzoN,UAAU2F,OAAS,SAAUsK,EAAGzkB,OACjC+mF,EAAQ,IAAJtiE,EAAS35G,EAAI,EACjB0kO,EAAAA,CAASzoD,OAEbA,EAAQ,KADRtiE,IAAS,GAEFsiE,EAAI,GACTyoD,EAAM7/I,QAAQo3F,GAEdA,EAAQ,KADRtiE,IAAS,KAEP35G,SAEAk1F,EACFwvI,EAAM7tJ,KAAK72E,GAEX0kO,EAAM7/I,QAAQ7kF,GAEhB+rG,KAAK21D,OAAOgjE,GACLA,EAAM1zJ,QAGfmhP,EAAOzoN,UAAU+pN,aAAe,SAAUlyN,OACpCgyN,EAAW1gP,SAAc0uB,KAChB,WAAT1uB,EAAS,IACE,WAATA,YAWQgyB,MAAM8rN,MAVJ,OAARpvN,YACQsD,MAAM8rN,MACPU,GAAgB9vN,EAAImX,cAAgBsxH,YAC7CzoI,EAAAA,IAAUijI,WAAWjjI,aACXqI,MAAM/gB,QAAQ0Y,IACnB8vN,GAAiBrnF,YAAYC,OAAO1oI,cAC7BsD,MAAM8rN,GAMtB4C,GAAY,MAEV7uF,EAAQ,EAAG1zJ,EAASuwB,EAAIvwB,UACxBuiP,EACF7uF,EAAQ1zJ,eAECkC,EAAI,EAAGA,EAAIquB,EAAIvwB,SAAUkC,EAAAA,KAC5B9xE,EAAOmgG,EAAIvd,WAAW9Q,GACtB9xE,EAAO,IACTsjO,GAAS,EACAtjO,EAAO,KAChBsjO,GAAS,EACAtjO,EAAO,OAAUA,GAAQ,MAClCsjO,GAAS,GAETtjO,EAAO,QAAoB,KAAPA,IAAiB,GAA6B,KAAtBmgG,EAAIvd,aAAa9Q,IAC7DwxJ,GAAS,UAIfA,GAAS34H,KAAKsD,OAAe,EAARq1H,GACrB34H,KAAK21D,OAAOngE,GACLmjI,GAGTytF,EAAOzoN,UAAUmpN,QAAU,SAAUa,EAAMljG,WACrCkU,EAAQ34H,KAAKsD,OAAOmhH,GACft9I,EAAI,EAAGA,EAAIwgP,EAAK1iP,SAAUkC,EACjCwxJ,GAAS34H,KAAK0nN,aAAaC,EAAKxgP,QAE9BygP,EAAenjG,EAAIkU,EAAQlU,EAC3Bk2C,EAAAA,UACJA,EAAM11L,OAAS2iP,EACf5nN,KAAK21D,OAAOglG,GACL36J,MAGTomN,EAAOzoN,UAAUkqN,SAAW,eACtB7nN,KAAKmnN,WAGTnnN,KAAKmnN,WAAY,MACbriD,EAAS9kK,KAAK8kK,OAAQ39L,EAAI64B,KAAKynN,cAAeL,EAAapnN,KAAKonN,WAAYlrO,EAAI8jB,KAAK9jB,KACzF4oL,EAAO39L,GAAK,IAAM64B,KAAKolK,QAAY,EAAJj+L,GAC3B64B,KAAKynN,gBAAkBznN,KAAKqnN,cAC9BviD,EAAO,GAAKA,EAAOsiD,GACdjgP,EAAI,EAAGA,EAAIigP,EAAa,IAAKjgP,EAChC29L,EAAO39L,GAAK,MAGhB29L,EAAOsiD,EAAa,IAAM,WACrBjgP,EAAI,EAAGA,EAAIigP,IAAcjgP,EAC5B+U,EAAE/U,IAAM29L,EAAO39L,GAEjBu6E,EAAExlE,KAGJkqO,EAAOzoN,UAAUS,SAAWgoN,EAAOzoN,UAAU33B,IAAM,WACjDg6B,KAAK6nN,mBAISr6J,EAFV45J,EAAapnN,KAAKonN,WAAYlrO,EAAI8jB,KAAK9jB,EAAGorO,EAAetnN,KAAKsnN,aAChEC,EAAavnN,KAAKunN,WAAYpgP,EAAI,EAAGmqB,EAAI,EACvCtrB,EAAM,GACHsrB,EAAIg2N,GAAAA,KACJngP,EAAI,EAAGA,EAAIigP,GAAc91N,EAAIg2N,IAAgBngP,IAAKmqB,EACrDk8D,EAAQtxE,EAAE/U,GACVnB,GAAOw/O,EAAWh4J,GAAS,EAAK,IAAQg4J,EAAkB,GAARh4J,GAChDg4J,EAAWh4J,GAAS,GAAM,IAAQg4J,EAAWh4J,GAAS,EAAK,IAC3Dg4J,EAAWh4J,GAAS,GAAM,IAAQg4J,EAAWh4J,GAAS,GAAM,IAC5Dg4J,EAAWh4J,GAAS,GAAM,IAAQg4J,EAAWh4J,GAAS,GAAM,IAE5Dl8D,EAAI81N,GAAe,IACrB1lK,EAAExlE,GACF/U,EAAI,UAGJogP,IACF/5J,EAAQtxE,EAAE/U,GACVnB,GAAOw/O,EAAWh4J,GAAS,EAAK,IAAQg4J,EAAkB,GAARh4J,GAC9C+5J,EAAa,IACfvhP,GAAOw/O,EAAWh4J,GAAS,GAAM,IAAQg4J,EAAWh4J,GAAS,EAAK,KAEhE+5J,EAAa,IACfvhP,GAAOw/O,EAAWh4J,GAAS,GAAM,IAAQg4J,EAAWh4J,GAAS,GAAM,MAGhExnF,GAGTogP,EAAOzoN,UAAUymN,YAAc,WAC7BpkN,KAAK6nN,eAKDh4G,EAHAu3G,EAAapnN,KAAKonN,WAAYlrO,EAAI8jB,KAAK9jB,EAAGorO,EAAetnN,KAAKsnN,aAChEC,EAAavnN,KAAKunN,WAAYpgP,EAAI,EAAGmqB,EAAI,EACvCqnI,EAAQ34H,KAAKsmN,YAAc,EAG7Bz2G,EADE03G,EACF13G,IAAaouB,YAAaqpF,EAAe,GAAM,GAE/Cz3G,IAAaouB,YAAYtF,WAEvBzD,EAAAA,IAAYw5C,YAAY7+D,GACrBv+G,EAAIg2N,GAAAA,KACJngP,EAAI,EAAGA,EAAIigP,GAAc91N,EAAIg2N,IAAgBngP,IAAKmqB,EACrD4jI,EAAM5jI,GAAKpV,EAAE/U,GAEXmqB,EAAI81N,GAAe,GACrB1lK,EAAExlE,UAGFqrO,IACFryF,EAAM/tJ,GAAK+U,EAAE/U,GACb0oI,EAASA,EAAOzqI,MAAM,EAAGuzJ,IAEpB9oB,GAGTu2G,EAAOzoN,UAAUkyG,OAASu2G,EAAOzoN,UAAUymN,YAE3CgC,EAAOzoN,UAAUu7H,OAASktF,EAAOzoN,UAAUu3H,MAAQ,WACjDl1H,KAAK6nN,mBAIW9iP,EAAQyoF,EAFpB45J,EAAapnN,KAAKonN,WAAYlrO,EAAI8jB,KAAK9jB,EAAGorO,EAAetnN,KAAKsnN,aAChEC,EAAavnN,KAAKunN,WAAYpgP,EAAI,EAAGmqB,EAAI,EACvC4jI,EAAAA,GACG5jI,EAAIg2N,GAAAA,KACJngP,EAAI,EAAGA,EAAIigP,GAAc91N,EAAIg2N,IAAgBngP,IAAKmqB,EACrDvsB,EAASusB,GAAK,EACdk8D,EAAQtxE,EAAE/U,GACV+tJ,EAAMnwJ,GAAkB,IAARyoF,EAChB0nE,EAAMnwJ,EAAS,GAAMyoF,GAAS,EAAK,IACnC0nE,EAAMnwJ,EAAS,GAAMyoF,GAAS,GAAM,IACpC0nE,EAAMnwJ,EAAS,GAAMyoF,GAAS,GAAM,IAElCl8D,EAAI81N,GAAe,GACrB1lK,EAAExlE,UAGFqrO,IACFxiP,EAASusB,GAAK,EACdk8D,EAAQtxE,EAAE/U,GACV+tJ,EAAMnwJ,GAAkB,IAARyoF,EACZ+5J,EAAa,IACfryF,EAAMnwJ,EAAS,GAAMyoF,GAAS,EAAK,KAEjC+5J,EAAa,IACfryF,EAAMnwJ,EAAS,GAAMyoF,GAAS,GAAM,MAGjC0nE,GAOT6xF,EAAKppN,UAAAA,IAAgByoN,EAErBW,EAAKppN,UAAUkqN,SAAW,kBACxB7nN,KAAKsD,OAAOtD,KAAKsmN,YAAY,GACtBF,EAAOzoN,UAAUkqN,SAASjqN,KAAKoC,WAGpC0hD,EAAI,SAAUxlE,OACZurF,EAAG1+E,EAAG90F,EAAG6zT,EAAI9yH,EAAIE,EAAI6yH,EAAIC,EAAIC,EAAIC,EAAIC,EAAI7d,EAAI8d,EAC/Cv/B,EAAIp6B,EAAIJ,EAAIy6B,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAK2+B,EAAKC,EAC3EC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAC3EC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,GAAKC,OACxEr2T,EAAI,EAAGA,EAAI,GAAIA,GAAK,EACvB6zT,EAAK5rO,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtC84G,EAAK94G,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCg5G,EAAKh5G,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtC6rO,EAAK7rO,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtC8rO,EAAK9rO,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtC+rO,EAAK/rO,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCgsO,EAAKhsO,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCisO,EAAKjsO,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAItCurF,GAHA6iI,EAAKpuN,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,MAG3Bg5G,GAAM,EAAM6yH,IAAO,IAC9Bh/N,GAHAq/N,EAAKlsO,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,MAG3B6rO,GAAM,EAAM7yH,IAAO,IAC9Bh5G,EAAE,IAAMurF,EACRvrF,EAAE,IAAM6M,EACR7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT0+E,EAAIqgJ,GAAOE,GAAM,EAAMC,IAAO,IAC9Bl/N,EAAIisG,GAAOizH,GAAM,EAAMD,IAAO,IAC9B9rO,EAAE,IAAMurF,EACRvrF,EAAE,IAAM6M,EACR7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT0+E,EAAIytB,GAAOgzH,GAAM,EAAMC,IAAO,IAC9Bp/N,EAAIg/N,GAAOI,GAAM,EAAMD,IAAO,IAC9BhsO,EAAE,IAAMurF,EACRvrF,EAAE,IAAM6M,EACR7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT0+E,EAAIugJ,GAAO1d,GAAM,EAAM8d,IAAO,IAC9Br/N,EAAIk/N,GAAOG,GAAM,EAAM9d,IAAO,IAC9BpuN,EAAE,IAAMurF,EACRvrF,EAAE,IAAM6M,EACR7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT0+E,EAAIygJ,GAAOJ,GAAM,EAAM9yH,IAAO,IAC9BjsG,EAAIo/N,GAAOnzH,GAAM,EAAM8yH,IAAO,IAC9B5rO,EAAE,IAAMurF,EACRvrF,EAAE,IAAM6M,EACR7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EACT7M,EAAE,KAAOurF,EACTvrF,EAAE,KAAO6M,EAET8/L,EAAK3sM,EAAE,GACPuyK,EAAKvyK,EAAE,GACPmtO,EAAOntO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCotO,EAAOptO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCutM,EAAOvtM,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCwtM,EAAOxtM,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCiuO,GAAOjuO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCkuO,GAAOluO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC+sO,EAAO/sO,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCgtO,EAAOhtO,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCusO,EAAOvsO,EAAE,IAAM,EAAMA,EAAE,KAAO,GAC9BwsO,EAAOxsO,EAAE,IAAM,EAAMA,EAAE,KAAO,GAC9BmyK,EAAMnyK,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChC4sM,EAAM5sM,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCqtO,EAAOrtO,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCstO,EAAOttO,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCmsO,EAAOnsO,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCosO,EAAOpsO,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCmuO,GAAOnuO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCouO,GAAOpuO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC2tO,GAAO3tO,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/B4tO,GAAO5tO,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BysO,EAAOzsO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC0sO,EAAO1sO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC6sM,EAAM7sM,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChC8sM,EAAM9sM,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCutO,EAAOvtO,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCwtO,EAAOxtO,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCqsO,EAAOrsO,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCssO,EAAOtsO,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCmtM,EAAOntM,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BotM,EAAOptM,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/B6tO,GAAO7tO,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjC8tO,GAAO9tO,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjC2sO,EAAO3sO,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjC4sO,EAAO5sO,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjC+sM,EAAM/sM,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCgtM,EAAMhtM,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCytO,EAAOztO,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjC0tO,GAAO1tO,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCitO,EAAOjtO,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BktO,EAAOltO,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BqtM,EAAOrtM,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCstM,EAAOttM,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC+tO,GAAO/tO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCguO,GAAOhuO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC6sO,EAAO7sO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC8sO,EAAO9sO,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCitM,EAAMjtM,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCktM,EAAMltM,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAEhCA,EAAE,GAAK2sM,GAAOx6B,EAAK06B,EACnB7sM,EAAE,GAAKuyK,GAAOq6B,EAAKE,EACnB9sM,EAAE,IAAMmtM,GAAQE,EAAME,EACtBvtM,EAAE,IAAMotM,GAAQE,EAAME,EACtBxtM,EAAE,IAAMusO,GAAQE,EAAME,EACtB3sO,EAAE,IAAMwsO,GAAQE,EAAME,EACtB5sO,EAAE,IAAMitO,GAAQE,EAAME,EACtBrtO,EAAE,IAAMktO,GAAQE,EAAME,EACtBttO,EAAE,IAAM2tO,IAAQE,GAAME,GACtB/tO,EAAE,IAAM4tO,IAAQE,GAAME,GACtBhuO,EAAE,GAAKmyK,GAAO06B,EAAKE,EACnB/sM,EAAE,GAAK4sM,GAAOE,EAAKE,EACnBhtM,EAAE,IAAMqtM,GAAQE,EAAM4+B,EACtBnsO,EAAE,IAAMstM,GAAQE,EAAM4+B,EACtBpsO,EAAE,IAAMysO,GAAQE,EAAME,EACtB7sO,EAAE,IAAM0sO,GAAQE,EAAME,EACtB9sO,EAAE,IAAMmtO,GAAQE,EAAME,EACtBvtO,EAAE,IAAMotO,GAAQE,EAAME,EACtBxtO,EAAE,IAAM6tO,IAAQE,GAAME,GACtBjuO,EAAE,IAAM8tO,IAAQE,GAAME,GACtBluO,EAAE,GAAK6sM,GAAOE,EAAKE,EACnBjtM,EAAE,GAAK8sM,GAAOE,EAAKE,EACnBltM,EAAE,IAAMutM,GAAQ4+B,EAAME,EACtBrsO,EAAE,IAAMwtM,GAAQ4+B,EAAME,EACtBtsO,EAAE,IAAM2sO,GAAQE,EAAME,EACtB/sO,EAAE,IAAM4sO,GAAQE,EAAME,EACtBhtO,EAAE,IAAMqtO,GAAQE,EAAME,EACtBztO,EAAE,IAAMstO,GAAQE,EAAME,GACtB1tO,EAAE,IAAM+tO,IAAQE,GAAME,GACtBnuO,EAAE,IAAMguO,IAAQE,GAAME,GACtBpuO,EAAE,GAAK+sM,GAAOE,EAAKN,EACnB3sM,EAAE,GAAKgtM,GAAOE,EAAK36B,EACnBvyK,EAAE,IAAMmsO,GAAQE,EAAMl/B,EACtBntM,EAAE,IAAMosO,GAAQE,EAAMl/B,EACtBptM,EAAE,IAAM6sO,GAAQE,EAAMR,EACtBvsO,EAAE,IAAM8sO,GAAQE,EAAMR,EACtBxsO,EAAE,IAAMutO,GAAQE,EAAMR,EACtBjtO,EAAE,IAAMwtO,GAAQE,GAAMR,EACtBltO,EAAE,IAAMiuO,IAAQE,GAAMR,GACtB3tO,EAAE,IAAMkuO,IAAQE,GAAMR,GACtB5tO,EAAE,GAAKitM,GAAON,EAAKx6B,EACnBnyK,EAAE,GAAKktM,GAAO36B,EAAKq6B,EACnB5sM,EAAE,IAAMqsO,GAAQl/B,EAAME,EACtBrtM,EAAE,IAAMssO,GAAQl/B,EAAME,EACtBttM,EAAE,IAAM+sO,GAAQR,EAAME,EACtBzsO,EAAE,IAAMgtO,GAAQR,EAAME,EACtB1sO,EAAE,IAAMytO,GAAQR,EAAME,EACtBntO,EAAE,IAAM0tO,IAAQR,EAAME,EACtBptO,EAAE,IAAMmuO,IAAQR,GAAME,GACtB7tO,EAAE,IAAMouO,IAAQR,GAAME,GAEtB9tO,EAAE,IAAMypO,EAAG1xT,GACXioF,EAAE,IAAMypO,EAAG1xT,EAAI,OAIfgxT,EACF5xT,EAAOC,QAAU00L,WAEZ7gH,EAAI,EAAGA,EAAI6/O,EAAY/hP,SAAUkC,EACpCsZ,EAAKumO,EAAY7/O,IAAM6gH,EAAQg/H,EAAY7/O,IAEzCg+O,GACFC,GAAO,kBACEp9H,sDC3oBf30L,EAAAC,QAAAC,EAAA,4FCUYktF,EAAM/qF,GACd,iBAGI60T,EAAAA,CACA7mN,QAAW,QACXghN,IAAA,GACAF,IAAA,GACAgG,iBAAmB,GAMvB,SAAAC,EAAqB9xF,OAEZ96H,MAAM/gB,QAAQ67I,KAAWsF,YAAYC,OAAOvF,UACtC,UAIFxxJ,EAAI,EAAGA,EAAIwxJ,EAAM1zJ,OAAQkC,QACzBhB,OAAOs/K,UAAU9sB,EAAMxxJ,KAAOwxJ,EAAMxxJ,GAAK,GAAKwxJ,EAAMxxJ,GAAK,WACnD,SAGR,EAGX,SAAAujP,EAAsBxrO,EAAGjrF,UAMR,MAAJirF,GAAcjrF,KAASirF,IAAM,IAAMjrF,EAAK,QAAW,IAGhE,SAAA02T,EAAkBzrO,EAAGjrF,UAMTirF,GAAKjrF,EAAMirF,IAAO,GAAKjrF,EAGnC,SAAA22T,EAAkBnjJ,UAMdA,EAAIijJ,EADJjjJ,GAAKA,IAAM,GACS,YAEpBA,EAAIijJ,EADJjjJ,GAAKA,IAAM,GACS,YACpBA,GAAKA,IAAM,GAKf,SAAAojJ,EAAiB3rO,EAAGjrF,GAMhBirF,EAAAA,CAAKA,EAAE,KAAO,GAAW,MAAPA,EAAE,GAAaA,EAAE,KAAO,GAAW,MAAPA,EAAE,IAChDjrF,EAAAA,CAAKA,EAAE,KAAO,GAAW,MAAPA,EAAE,GAAaA,EAAE,KAAO,GAAW,MAAPA,EAAE,QAC5Ci8K,EAAAA,CAAK,EAAG,EAAG,EAAG,UAElBA,EAAE,IAAMhxF,EAAE,GAAKjrF,EAAE,GACjBi8K,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAMhxF,EAAE,GAAKjrF,EAAE,GACjBi8K,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAMhxF,EAAE,GAAKjrF,EAAE,GACjBi8K,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAMhxF,EAAE,GAAKjrF,EAAE,GACjBi8K,EAAE,IAAM,OAECA,EAAE,IAAM,GAAMA,EAAE,GAAKA,EAAE,IAAM,GAAMA,EAAE,IAGlD,SAAA46I,EAAsB5rO,EAAGjrF,GAMrBirF,EAAAA,CAAKA,EAAE,KAAO,GAAW,MAAPA,EAAE,GAAaA,EAAE,KAAO,GAAW,MAAPA,EAAE,IAChDjrF,EAAAA,CAAKA,EAAE,KAAO,GAAW,MAAPA,EAAE,GAAaA,EAAE,KAAO,GAAW,MAAPA,EAAE,QAC5Ci8K,EAAAA,CAAK,EAAG,EAAG,EAAG,UAElBA,EAAE,IAAMhxF,EAAE,GAAKjrF,EAAE,GACjBi8K,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAMhxF,EAAE,GAAKjrF,EAAE,GACjBi8K,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAMhxF,EAAE,GAAKjrF,EAAE,GACjBi8K,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAMhxF,EAAE,GAAKjrF,EAAE,GACjBi8K,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAMhxF,EAAE,GAAKjrF,EAAE,GACjBi8K,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAMhxF,EAAE,GAAKjrF,EAAE,GACjBi8K,EAAE,IAAMA,EAAE,KAAO,GACjBA,EAAE,IAAM,MAERA,EAAE,IAAOhxF,EAAE,GAAKjrF,EAAE,GAAOirF,EAAE,GAAKjrF,EAAE,GAAOirF,EAAE,GAAKjrF,EAAE,GAAOirF,EAAE,GAAKjrF,EAAE,GAClEi8K,EAAE,IAAM,OAECA,EAAE,IAAM,GAAMA,EAAE,GAAKA,EAAE,IAAM,GAAMA,EAAE,IAGlD,SAAA66I,EAAkB7rO,EAAGjrF,UASP,MAFVA,GAAK,KAGOirF,EAAE,GAAIA,EAAE,IACTjrF,EAAI,IACFirF,EAAE,IAAMjrF,EAAMirF,EAAE,KAAQ,GAAKjrF,EAAMirF,EAAE,IAAMjrF,EAAMirF,EAAE,KAAQ,GAAKjrF,IAEzEA,GAAK,IACIirF,EAAE,IAAMjrF,EAAMirF,EAAE,KAAQ,GAAKjrF,EAAMirF,EAAE,IAAMjrF,EAAMirF,EAAE,KAAQ,GAAKjrF,IAIjF,SAAA+2T,EAAuB9rO,EAAGjrF,UASZ,KAFVA,GAAK,IAGMirF,EACAjrF,EAAI,IACFirF,EAAE,IAAMjrF,EAAMirF,EAAE,KAAQ,GAAKjrF,EAAKirF,EAAE,IAAMjrF,IAE3CirF,EAAE,IAAOjrF,EAAI,GAAK,GAIlC,SAAAg3T,EAAiB/rO,EAAGjrF,UAMRirF,EAAE,GAAKjrF,EAAE,GAAIirF,EAAE,GAAKjrF,EAAE,IAGlC,SAAAi3T,EAAkBzjJ,UAOdA,EAAIwjJ,EAAQxjJ,EAAAA,CAAI,EAAGA,EAAE,KAAO,IAE5BA,EAAIwjJ,EADJxjJ,EAAIqjJ,EAAarjJ,EAAAA,CAAI,WAAY,aACrBA,CAAI,EAAGA,EAAE,KAAO,IAE5BA,EAAIwjJ,EADJxjJ,EAAIqjJ,EAAarjJ,EAAAA,CAAI,WAAY,YACrBA,CAAI,EAAGA,EAAE,KAAO,IAQhC8iJ,EAAQ7F,IAAIC,OAAS,SAAUhsF,EAAO4nB,MAK9BgqE,EAAQC,kBAAoBC,EAAY9xF,UACjCjjO,EAEX6qP,EAAOA,GAAQ,UAEXu8B,EAAYnkD,EAAM1zJ,OAAS,EAC3B6/L,EAASnsC,EAAM1zJ,OAAS63M,EAExB5P,EAAK3sB,EAELy8B,EAAK,EAELhoF,EAAK,WACLE,EAAK,UAEA/tH,EAAI,EAAGA,EAAI29L,EAAQ39L,GAAQ,EAGhC61M,EAAK0tC,EAFL1tC,EAAMrkD,EAAMxxJ,GAAOwxJ,EAAMxxJ,EAAI,IAAM,EAAMwxJ,EAAMxxJ,EAAI,IAAM,GAAOwxJ,EAAMxxJ,EAAI,IAAM,GAE1D6tH,GAEtBgoF,EAAK0tC,EADL1tC,EAAK2tC,EAAS3tC,EAAI,IACI9nF,GAItBg4E,EAAKw9C,EADLx9C,EAAKy9C,EADLz9C,GAAM8P,EACY,IACI,GAAK,kBAG/BA,EAAK,EAEGF,QACC,EACDE,GAAMrkD,EAAMxxJ,EAAI,IAAM,QAErB,EACD61M,GAAMrkD,EAAMxxJ,EAAI,IAAM,OAErB,EAED61M,EAAK0tC,EADL1tC,GAAMrkD,EAAMxxJ,GACU6tH,GAGtBk4E,GADA8P,EAAK0tC,EADL1tC,EAAK2tC,EAAS3tC,EAAI,IACI9nF,UAK9Bg4E,EAAK09C,EADL19C,GAAMv0C,EAAM1zJ,WAGE,GAGlBslP,EAAQ7F,IAAID,QAAU,SAAU9rF,EAAO4nB,MAK/BgqE,EAAQC,kBAAoBC,EAAY9xF,UACjCjjO,EAGX6qP,EAAOA,GAAQ,UACXu8B,EAAYnkD,EAAM1zJ,OAAS,GAC3B6/L,EAASnsC,EAAM1zJ,OAAS63M,EAExB5P,EAAK3sB,EACL4sB,EAAK5sB,EACL6sB,EAAK7sB,EACL8sB,EAAK9sB,EAELy8B,EAAK,EACL6U,EAAK,EACLs5B,EAAK,EACLC,EAAK,EAELp2H,EAAK,UACLE,EAAK,WACL6yH,EAAK,UACLC,EAAK,WAEA7gP,EAAI,EAAGA,EAAI29L,EAAQ39L,GAAQ,GAChC61M,EAAMrkD,EAAMxxJ,GAAOwxJ,EAAMxxJ,EAAI,IAAM,EAAMwxJ,EAAMxxJ,EAAI,IAAM,GAAOwxJ,EAAMxxJ,EAAI,IAAM,GAChF0qN,EAAMl5D,EAAMxxJ,EAAI,GAAOwxJ,EAAMxxJ,EAAI,IAAM,EAAMwxJ,EAAMxxJ,EAAI,IAAM,GAAOwxJ,EAAMxxJ,EAAI,IAAM,GACpFgkP,EAAMxyF,EAAMxxJ,EAAI,GAAOwxJ,EAAMxxJ,EAAI,IAAM,EAAMwxJ,EAAMxxJ,EAAI,KAAO,GAAOwxJ,EAAMxxJ,EAAI,KAAO,GACtFikP,EAAMzyF,EAAMxxJ,EAAI,IAAQwxJ,EAAMxxJ,EAAI,KAAO,EAAMwxJ,EAAMxxJ,EAAI,KAAO,GAAOwxJ,EAAMxxJ,EAAI,KAAO,GAGxF61M,EAAK2tC,EADL3tC,EAAK0tC,EAAa1tC,EAAIhoF,GACJ,IAIlBk4E,EAAKy9C,EAFLz9C,GADA8P,EAAK0tC,EAAa1tC,EAAI9nF,GAGJ,IAElBg4E,EAAKw9C,EADLx9C,GAAMC,EACgB,GAAK,WAG3B0kB,EAAK84B,EADL94B,EAAK64B,EAAa74B,EAAI38F,GACJ,IAIlBi4E,EAAKw9C,EAFLx9C,GADA0kB,EAAK64B,EAAa74B,EAAIk2B,GAGJ,IAElB56C,EAAKu9C,EADLv9C,GAAMC,EACgB,GAAK,UAG3B+9C,EAAKR,EADLQ,EAAKT,EAAaS,EAAIpD,GACJ,IAIlB36C,EAAKu9C,EAFLv9C,GADA+9C,EAAKT,EAAaS,EAAInD,GAGJ,IAElB56C,EAAKs9C,EADLt9C,GAAMC,EACgB,GAAK,WAG3B+9C,EAAKT,EADLS,EAAKV,EAAaU,EAAIpD,GACJ,IAIlB36C,EAAKs9C,EAFLt9C,GADA+9C,EAAKV,EAAaU,EAAIp2H,GAGJ,IAElBq4E,EAAKq9C,EADLr9C,GAAMH,EACgB,GAAK,iBAG/B8P,EAAK,EACL6U,EAAK,EACLs5B,EAAK,EACLC,EAAK,EAEGtuC,QACC,GACDsuC,GAAMzyF,EAAMxxJ,EAAI,KAAO,QAEtB,GACDikP,GAAMzyF,EAAMxxJ,EAAI,KAAO,OAEtB,GAEDikP,EAAKV,EADLU,GAAMzyF,EAAMxxJ,EAAI,IACM6gP,GAGtB36C,GADA+9C,EAAKV,EADLU,EAAKT,EAASS,EAAI,IACIp2H,QAGrB,GACDm2H,GAAMxyF,EAAMxxJ,EAAI,KAAO,QAEtB,GACDgkP,GAAMxyF,EAAMxxJ,EAAI,KAAO,QAEtB,GACDgkP,GAAMxyF,EAAMxxJ,EAAI,IAAM,OAErB,EAEDgkP,EAAKT,EADLS,GAAMxyF,EAAMxxJ,EAAI,GACM4gP,GAGtB36C,GADA+9C,EAAKT,EADLS,EAAKR,EAASQ,EAAI,IACInD,QAGrB,EACDn2B,GAAMl5D,EAAMxxJ,EAAI,IAAM,QAErB,EACD0qN,GAAMl5D,EAAMxxJ,EAAI,IAAM,QAErB,EACD0qN,GAAMl5D,EAAMxxJ,EAAI,IAAM,OAErB,EAED0qN,EAAK64B,EADL74B,GAAMl5D,EAAMxxJ,EAAI,GACM+tH,GAGtBi4E,GADA0kB,EAAK64B,EADL74B,EAAK84B,EAAS94B,EAAI,IACIk2B,QAGrB,EACD/qC,GAAMrkD,EAAMxxJ,EAAI,IAAM,QAErB,EACD61M,GAAMrkD,EAAMxxJ,EAAI,IAAM,QAErB,EACD61M,GAAMrkD,EAAMxxJ,EAAI,IAAM,OAErB,EAED61M,EAAK0tC,EADL1tC,GAAMrkD,EAAMxxJ,GACU6tH,GAGtBk4E,GADA8P,EAAK0tC,EADL1tC,EAAK2tC,EAAS3tC,EAAI,IACI9nF,UAI9Bg4E,GAAMv0C,EAAM1zJ,OAKZioM,GAJAC,GAAMx0C,EAAM1zJ,OAKZioM,GAJAE,GAAMz0C,EAAM1zJ,OAMZkoM,GADAD,GAJAG,GAAM10C,EAAM1zJ,OAMZmoM,GAAMF,EACNG,GAAMH,EAENA,EAAK09C,EAAS19C,GAKdA,GAJAC,EAAKy9C,EAASz9C,GAKdD,GAJAE,EAAKw9C,EAASx9C,GAMdD,GADAD,GAJAG,EAAKu9C,EAASv9C,GAMdD,GAAMF,EACNG,GAAMH,GAEE,YAAcA,IAAO,GAAG9uK,SAAS,KAAKh5B,OAAO,IAAM,YAAc+nM,IAAO,GAAG/uK,SAAS,KAAKh5B,OAAO,IAAM,YAAcgoM,IAAO,GAAGhvK,SAAS,KAAKh5B,OAAO,IAAM,YAAcioM,IAAO,GAAGjvK,SAAS,KAAKh5B,OAAO,IAGlNmlP,EAAQ/F,IAAIC,QAAU,SAAU9rF,EAAO4nB,MAK/BgqE,EAAQC,kBAAoBC,EAAY9xF,UACjCjjO,EAEX6qP,EAAOA,GAAQ,UAEXu8B,EAAYnkD,EAAM1zJ,OAAS,GAC3B6/L,EAASnsC,EAAM1zJ,OAAS63M,EAExB5P,EAAAA,CAAM,EAAG3sB,GACT4sB,EAAAA,CAAM,EAAG5sB,GAETy8B,EAAAA,CAAM,EAAG,GACT6U,EAAAA,CAAM,EAAG,GAET78F,EAAAA,CAAM,WAAY,WAClBE,EAAAA,CAAM,WAAY,WAEb/tH,EAAI,EAAGA,EAAI29L,EAAQ39L,GAAQ,GAChC61M,EAAAA,CAAOrkD,EAAMxxJ,EAAI,GAAOwxJ,EAAMxxJ,EAAI,IAAM,EAAMwxJ,EAAMxxJ,EAAI,IAAM,GAAOwxJ,EAAMxxJ,EAAI,IAAM,GAAMwxJ,EAAMxxJ,GAC5FwxJ,EAAMxxJ,EAAI,IAAM,EAAMwxJ,EAAMxxJ,EAAI,IAAM,GAAOwxJ,EAAMxxJ,EAAI,IAAM,IAClE0qN,EAAAA,CAAOl5D,EAAMxxJ,EAAI,IAAQwxJ,EAAMxxJ,EAAI,KAAO,EAAMwxJ,EAAMxxJ,EAAI,KAAO,GAAOwxJ,EAAMxxJ,EAAI,KAAO,GAAMwxJ,EAAMxxJ,EAAI,GACpGwxJ,EAAMxxJ,EAAI,IAAM,EAAMwxJ,EAAMxxJ,EAAI,KAAO,GAAOwxJ,EAAMxxJ,EAAI,KAAO,IAGpE61M,EAAK+tC,EADL/tC,EAAK8tC,EAAa9tC,EAAIhoF,GACJ,IAKlBk4E,EAAK29C,EADL39C,EAAK69C,EAFL79C,EAAK+9C,EAAQ/9C,EADb8P,EAAK8tC,EAAa9tC,EAAI9nF,IAGJ,IACDi4E,GACjBD,EAAK29C,EAAQC,EAAa59C,EAAAA,CAAK,EAAG,IAAA,CAAM,EAAG,aAG3C2kB,EAAKk5B,EADLl5B,EAAKi5B,EAAaj5B,EAAI38F,GACJ,IAKlBi4E,EAAK09C,EADL19C,EAAK49C,EAFL59C,EAAK89C,EAAQ99C,EADb0kB,EAAKi5B,EAAaj5B,EAAI78F,IAGJ,IACDk4E,GACjBC,EAAK09C,EAAQC,EAAa39C,EAAAA,CAAK,EAAG,IAAA,CAAM,EAAG,mBAG/C6P,EAAAA,CAAM,EAAG,GACT6U,EAAAA,CAAM,EAAG,GAED/U,QACC,GACD+U,EAAKo5B,EAAQp5B,EAAIm5B,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,KAAM,UAElD,GACD0qN,EAAKo5B,EAAQp5B,EAAIm5B,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,KAAM,UAElD,GACD0qN,EAAKo5B,EAAQp5B,EAAIm5B,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,KAAM,UAElD,GACD0qN,EAAKo5B,EAAQp5B,EAAIm5B,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,KAAM,UAElD,GACD0qN,EAAKo5B,EAAQp5B,EAAIm5B,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,KAAM,UAElD,GACD0qN,EAAKo5B,EAAQp5B,EAAIm5B,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,IAAK,SAEjD,EAED0qN,EAAKi5B,EADLj5B,EAAKo5B,EAAQp5B,EAAAA,CAAK,EAAGl5D,EAAMxxJ,EAAI,KACT+tH,GAGtBi4E,EAAK89C,EAAQ99C,EADb0kB,EAAKi5B,EADLj5B,EAAKk5B,EAASl5B,EAAI,IACI78F,SAGrB,EACDgoF,EAAKiuC,EAAQjuC,EAAIguC,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,IAAK,UAEjD,EACD61M,EAAKiuC,EAAQjuC,EAAIguC,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,IAAK,UAEjD,EACD61M,EAAKiuC,EAAQjuC,EAAIguC,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,IAAK,UAEjD,EACD61M,EAAKiuC,EAAQjuC,EAAIguC,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,IAAK,UAEjD,EACD61M,EAAKiuC,EAAQjuC,EAAIguC,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,IAAK,UAEjD,EACD61M,EAAKiuC,EAAQjuC,EAAIguC,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,IAAK,UAEjD,EACD61M,EAAKiuC,EAAQjuC,EAAIguC,EAAAA,CAAe,EAAGryF,EAAMxxJ,EAAI,IAAK,SAEjD,EAED61M,EAAK8tC,EADL9tC,EAAKiuC,EAAQjuC,EAAAA,CAAK,EAAGrkD,EAAMxxJ,KACL6tH,GAGtBk4E,EAAK+9C,EAAQ/9C,EADb8P,EAAK8tC,EADL9tC,EAAK+tC,EAAS/tC,EAAI,IACI9nF,WAO9Bg4E,EAAK29C,EAHL39C,EAAK+9C,EAAQ/9C,EAAAA,CAAK,EAAGv0C,EAAM1zJ,SAC3BkoM,EAAK89C,EAAQ99C,EAAAA,CAAK,EAAGx0C,EAAM1zJ,UAG3BkoM,EAAK09C,EAAQ19C,EAAID,GAKjBA,EAAK29C,EAHL39C,EAAKg+C,EAASh+C,GACdC,EAAK+9C,EAAS/9C,IAGdA,EAAK09C,EAAQ19C,EAAID,IAET,YAAcA,EAAG,KAAO,GAAG9uK,SAAS,KAAKh5B,OAAO,IAAM,YAAc8nM,EAAG,KAAO,GAAG9uK,SAAS,KAAKh5B,OAAO,IAAM,YAAc+nM,EAAG,KAAO,GAAG/uK,SAAS,KAAKh5B,OAAO,IAAM,YAAc+nM,EAAG,KAAO,GAAG/uK,SAAS,KAAKh5B,OAAO,SAQvM,IAAZ9xE,QAEe,IAAXD,GAA0BA,EAAOC,UACxCA,EAAUD,EAAOC,QAAUi3T,GAG/Bj3T,EAAQ+3T,YAAcd,IAYtBA,EAAQe,aAAe7qO,EAAK4qO,YAE5Bd,EAAQgB,WAAa,kBACjB9qO,EAAK4qO,YAAcd,EAAQe,aAC3Bf,EAAQe,aAAe51T,EACvB60T,EAAQgB,WAAa71T,EAEd60T,GAGX9pO,EAAK4qO,YAAcd,IAExBvqN,oCCpkBH,aAiBA3sG,EAAAC,QAAA,CACA4wT,qBAZAp/M,IACA,MAAA6zH,EAAA,IAAAF,WAAA,GAEA,IAAA,IAAAtxJ,EAAA,EAAAA,EAAA,EAAAA,IACAwxJ,EAAAxxJ,GAAA,IAAA29B,EACAA,IAAA,EAGA,OAAA6zH,kCCdA,aAGA,MAAA6yF,EAAAj4T,EAAA,WAKAk4T,EAAA,CACAz2L,KAAAw2L,EAAAE,YACA/1J,OAAA61J,EAAAG,cACAzyF,OAAAsyF,EAAAI,cAGAC,EAAA,CACA72L,KAAAw2L,EAAAM,YACAn2J,OAAA61J,EAAAO,cACA7yF,OAAAsyF,EAAAQ,cAaAC,EAAA,CAAAhvN,EAAAivN,IAAA54K,MAAAoZ,IACA,MAAAutB,EAAAiyI,EAAAl3L,KAAA/3B,EAAA,MAEA,OADAivN,EAAAv2J,OAAAskB,EAAAvtB,GACAw/J,EAAAhzF,OAAAj/C,IAMA5mL,EAAAC,QAAAkpQ,IACA,IAAA,IAAAr1L,EAAA,EAAAA,EAAA,GAAAA,IACAq1L,EApCA,MAoCAr1L,GAAA8kP,EAAA9kP,EAAA,EAAAskP,GAEA,IAAA,IAAAtkP,EAAA,EAAAA,EAAA,GAAAA,IACAq1L,EAtCA,MAsCAr1L,GAAA8kP,EAAA9kP,EAAA,EAAA0kP,iDC5CA,IAAAM,EAAA54T,EAAA,aACA64T,EAAA74T,EAAA,aAEAF,EAAAC,QAAA,CACAm4T,QAAAU,EAAAV,QACAY,WAAAF,EAAAE,WACAX,YAAAS,EAAAT,YACAC,cAAAQ,EAAAR,cACAC,aAAAO,EAAAP,aACAC,QAAAO,EAAAP,QACAS,WAAAF,EAAAE,WACAR,YAAAM,EAAAN,YACAC,cAAAK,EAAAL,cACAC,aAAAI,EAAAJ,iFCTA,IAAApsN,EAAArsG,EAAA,UAKA,SAAAg5T,EAAAznJ,EAAAj+F,EAAAyS,GACA,IAAAkzO,EAAA1nJ,EAAAj+F,GAAAi+F,EAAAxrF,GACAmzO,EAAA3nJ,EAAAj+F,EAAA,GAAAi+F,EAAAxrF,EAAA,GACAkzO,GAAA,YACAC,IAEA3nJ,EAAAj+F,GAAA2lP,EACA1nJ,EAAAj+F,EAAA,GAAA4lP,EAMA,SAAAC,EAAA5nJ,EAAAj+F,EAAAgiN,EAAAp6B,GACA,IAAA+9D,EAAA1nJ,EAAAj+F,GAAAgiN,EACAA,EAAA,IACA2jC,GAAA,YAEA,IAAAC,EAAA3nJ,EAAAj+F,EAAA,GAAA4nL,EACA+9D,GAAA,YACAC,IAEA3nJ,EAAAj+F,GAAA2lP,EACA1nJ,EAAAj+F,EAAA,GAAA4lP,EAIA,SAAAE,EAAA/vN,EAAAz1B,GACA,OAAAy1B,EAAAz1B,GACAy1B,EAAAz1B,EAAA,IAAA,EACAy1B,EAAAz1B,EAAA,IAAA,GACAy1B,EAAAz1B,EAAA,IAAA,GAKA,SAAAylP,EAAA/lP,EAAAyS,EAAA7M,EAAAmxD,EAAAivL,EAAAC,GACA,IAAAC,EAAA7tO,EAAA2tO,GACAvtB,EAAApgN,EAAA2tO,EAAA,GACA/xC,EAAA57L,EAAA4tO,GACAtlB,EAAAtoN,EAAA4tO,EAAA,GAEAP,EAAAznJ,EAAAj+F,EAAAyS,GACAozO,EAAA5nJ,EAAAj+F,EAAAkmP,EAAAztB,GAGA,IAAA0tB,EAAAloJ,EAAAlnC,GAAAknC,EAAAj+F,GACAomP,EAAAnoJ,EAAAlnC,EAAA,GAAAknC,EAAAj+F,EAAA,GACAi+F,EAAAlnC,GAAAqvL,EACAnoJ,EAAAlnC,EAAA,GAAAovL,EAEAT,EAAAznJ,EAAAr4F,EAAAmxD,GAGAovL,EAAAloJ,EAAAxrF,GAAAwrF,EAAAr4F,GACAwgP,EAAAnoJ,EAAAxrF,EAAA,GAAAwrF,EAAAr4F,EAAA,GACAq4F,EAAAxrF,GAAA0zO,IAAA,GAAAC,GAAA,EACAnoJ,EAAAxrF,EAAA,GAAA2zO,IAAA,GAAAD,GAAA,EAEAT,EAAAznJ,EAAAj+F,EAAAyS,GACAozO,EAAA5nJ,EAAAj+F,EAAAi0M,EAAA0sB,GAGAwlB,EAAAloJ,EAAAlnC,GAAAknC,EAAAj+F,GACAomP,EAAAnoJ,EAAAlnC,EAAA,GAAAknC,EAAAj+F,EAAA,GACAi+F,EAAAlnC,GAAAovL,IAAA,GAAAC,GAAA,GACAnoJ,EAAAlnC,EAAA,GAAAqvL,IAAA,GAAAD,GAAA,GAEAT,EAAAznJ,EAAAr4F,EAAAmxD,GAGAovL,EAAAloJ,EAAAxrF,GAAAwrF,EAAAr4F,GACAwgP,EAAAnoJ,EAAAxrF,EAAA,GAAAwrF,EAAAr4F,EAAA,GACAq4F,EAAAxrF,GAAA2zO,IAAA,GAAAD,GAAA,EACAloJ,EAAAxrF,EAAA,GAAA0zO,IAAA,GAAAC,GAAA,EAIA,IAAAC,EAAA,IAAAx+C,YAAA,CACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,UAAA,WACA,WAAA,UAAA,UAAA,aAqBAy+C,EAAA,IAAA10F,WAlBA,CACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GACA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EACA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EACA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EACA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GACA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAMAruJ,KAAA,SAAAwjC,GAAA,OAAA,EAAAA,MAIAk3D,EAAA,IAAA4pG,YAAA,IACAxvL,EAAA,IAAAwvL,YAAA,IACA,SAAA0+C,EAAAnzI,EAAAl+F,GACA,IAAA5U,EAAA,EAGA,IAAAA,EAAA,EAAAA,EAAA,GAAAA,IACA29F,EAAA39F,GAAA8yG,EAAAxS,EAAAtgG,GACA29F,EAAA39F,EAAA,IAAA+lP,EAAA/lP,GAeA,IAXA29F,EAAA,IAAAA,EAAA,IAAAmV,EAAAl7B,EACA+lB,EAAA,IAAAA,EAAA,IAAAmV,EAAAl7B,EAAA,WAIAhjE,IACA+oF,EAAA,KAAAA,EAAA,IACAA,EAAA,KAAAA,EAAA,KAIA39F,EAAA,EAAAA,EAAA,GAAAA,IACA+X,EAAA/X,GAAAwlP,EAAA1yI,EAAA3gG,EAAA,EAAAnS,GAOA,IAAAA,EAAA,EAAAA,EAAA,GAAAA,IAEAylP,EAAA,EAAA,EAAA,GAAA,GAAAO,EAAA,GAAAhmP,EAAA,GAAAgmP,EAAA,GAAAhmP,EAAA,IACAylP,EAAA,EAAA,GAAA,GAAA,GAAAO,EAAA,GAAAhmP,EAAA,GAAAgmP,EAAA,GAAAhmP,EAAA,IACAylP,EAAA,EAAA,GAAA,GAAA,GAAAO,EAAA,GAAAhmP,EAAA,GAAAgmP,EAAA,GAAAhmP,EAAA,IACAylP,EAAA,EAAA,GAAA,GAAA,GAAAO,EAAA,GAAAhmP,EAAA,GAAAgmP,EAAA,GAAAhmP,EAAA,IACAylP,EAAA,EAAA,GAAA,GAAA,GAAAO,EAAA,GAAAhmP,EAAA,GAAAgmP,EAAA,GAAAhmP,EAAA,IACAylP,EAAA,EAAA,GAAA,GAAA,GAAAO,EAAA,GAAAhmP,EAAA,IAAAgmP,EAAA,GAAAhmP,EAAA,KACAylP,EAAA,EAAA,GAAA,GAAA,GAAAO,EAAA,GAAAhmP,EAAA,IAAAgmP,EAAA,GAAAhmP,EAAA,KACAylP,EAAA,EAAA,EAAA,GAAA,GAAAO,EAAA,GAAAhmP,EAAA,IAAAgmP,EAAA,GAAAhmP,EAAA,KAIA,IAAAA,EAAA,EAAAA,EAAA,GAAAA,IACA8yG,EAAAxS,EAAAtgG,GAAA8yG,EAAAxS,EAAAtgG,GAAA29F,EAAA39F,GAAA29F,EAAA39F,EAAA,IAQA,SAAAukP,EAAA2B,EAAAr4T,GACA,GAAA,IAAAq4T,GAAAA,EAAA,GACA,MAAA,IAAAv0N,MAAA,oDAEA,GAAA9jG,GAAAA,EAAAiwE,OAAA,GACA,MAAA,IAAA6zB,MAAA,0DAaA,IATA,IAAAmhF,EAAA,CACA3gG,EAAA,IAAAm/I,WAAA,KACAhxD,EAAA,IAAAinG,YAAA,IACA3vH,EAAA,EACAtyE,EAAA,EACA4gP,OAAAA,GAIAlmP,EAAA,EAAAA,EAAA,GAAAA,IACA8yG,EAAAxS,EAAAtgG,GAAA+lP,EAAA/lP,GAEA,IAAAkjM,EAAAr1Q,EAAAA,EAAAiwE,OAAA,EAUA,OATAg1G,EAAAxS,EAAA,IAAA,SAAA4iG,GAAA,EAAAgjD,EAGAr4T,IACA22T,EAAA1xI,EAAAjlL,GAEAilL,EAAAxtG,EAAA,KAGAwtG,EAKA,SAAA0xI,EAAA1xI,EAAAjrF,GACA,IAAA,IAAA7nB,EAAA,EAAAA,EAAA6nB,EAAA/pB,OAAAkC,IACA,MAAA8yG,EAAAxtG,IACAwtG,EAAAl7B,GAAAk7B,EAAAxtG,EACA2gP,EAAAnzI,GAAA,GACAA,EAAAxtG,EAAA,GAEAwtG,EAAA3gG,EAAA2gG,EAAAxtG,KAAAuiB,EAAA7nB,GAMA,SAAAykP,EAAA3xI,GAGA,IAFAA,EAAAl7B,GAAAk7B,EAAAxtG,EAEAwtG,EAAAxtG,EAAA,KACAwtG,EAAA3gG,EAAA2gG,EAAAxtG,KAAA,EAEA2gP,EAAAnzI,GAAA,GAIA,IADA,IAAAl5C,EAAA,IAAA03F,WAAAx+C,EAAAozI,QACAlmP,EAAA,EAAAA,EAAA8yG,EAAAozI,OAAAlmP,IACA45D,EAAA55D,GAAA8yG,EAAAxS,EAAAtgG,GAAA,IAAA,GAAA,EAAAA,GAEA,OAAA45D,EAWA,SAAA0qL,EAAAz8N,EAAAh6F,EAAAq4T,GAEAA,EAAAA,GAAA,GACAr+N,EAAA4Q,EAAA0tN,eAAAt+N,GAGA,IAAAirF,EAAAyxI,EAAA2B,EAAAr4T,GAEA,OADA22T,EAAA1xI,EAAAjrF,GACA48N,EAAA3xI,GAgBA5mL,EAAAC,QAAA,CACAm4T,QAAAA,EACAY,WAPA,SAAAr9N,EAAAh6F,EAAAq4T,GACA,IAAAvuF,EAAA2sF,EAAAz8N,EAAAh6F,EAAAq4T,GACA,OAAAztN,EAAAw1J,MAAAt2B,IAMA4sF,YAAAA,EACAC,cAAAA,EACAC,aAAAA,0ECrPA,SAAA2B,EAAsB5zN,UACZ,WAAcA,GAAKyE,SAAS,IAAItC,UAAU,GAgDpDzoG,EAAOC,QAAAA,CACLg6T,eAzEF,SAAyBt+N,OACnB7C,KACA6C,aAAiBypI,WACnBtsI,EAAM6C,UACGA,aAAiBi0J,EAC1B92J,EAAAA,IAAUssI,WAAWzpI,WACO,iBAAXA,YAGP8J,MAZQ,iDAUlB3M,EAAAA,IAAUssI,WAAWwqB,EAAOx5F,KAAKz6D,EAAO,gBAInC7C,GA+DPipK,MA1DF,SAAgBz8B,UACP96H,MAAMF,UAAUvzB,IAAIwzB,KAAK+6H,GAAO,SAAU1kO,UACvCA,EAAI,GAAK,IAAM,IAAMA,EAAEmqG,SAAS,OACvC9zB,KAAK,KAwDRkjP,WA9CF,SAAqBz8M,EAAOnU,EAAKK,WAC3BxtB,EAAM,KAAOshC,EAAQ,MAChB5pC,EAAI,EAAGA,EAAIy1B,EAAI33B,OAAQkC,GAAK,EAAA,IACtB,KAAT81B,EACFxtB,GAAO89O,EAAY3wN,EAAIz1B,IAAIuuB,cAC3BjmB,GAAO,IACPA,GAAO89O,EAAY3wN,EAAIz1B,EAAI,IAAIuuB,sBACb,KAATuH,YAGMnE,MAAM,gBAAkBmE,GAFvCxtB,GAAO89O,EAAY3wN,EAAIz1B,EAAI,IAAIuuB,cAC/BjmB,GAAO89O,EAAY3wN,EAAIz1B,IAAIuuB,cAEzBvuB,EAAI,GAAM,EACZsI,GAAO,KAAA,IAAWouB,MAAMkT,EAAM9rC,OAAS,GAAGqF,KAAK,KACtCnD,EAAIy1B,EAAI33B,OAAS,IAC1BwK,GAAO,KAGXirB,QAAQ2xH,IAAI58I,IA8BZg+O,UAzBF,SAAoBC,EAAQnpG,EAAGM,WACzB8oG,GAAAA,IAAc5vN,MAAOvB,UAErBxN,EAAAA,IAAYypI,WAAWlU,GAClBp9I,EAAI,EAAGA,EAAIo9I,EAAGp9I,IACrB6nB,EAAM7nB,GAAKA,EAAI,QAEbymP,GAAAA,IAAY7vN,MAAOvB,cACvB9B,QAAQ2xH,IAAI,8BAAgCuhG,EAAQD,GAAW,MAC/DA,EAAUC,EAELzmP,EAAI,EAAGA,EAAI09I,EAAG19I,IAAAA,KACb0mP,EAAUH,EAAO1+N,GACjB8+N,GAAAA,IAAa/vN,MAAOvB,UACpBszH,EAAKg+F,EAASH,EAClBA,EAAUG,EACVpzN,QAAQ2xH,IAAI,aAAeyD,EAAK,OAAS+9F,EAAQ/xN,UAAU,EAAG,IAAM,OACpEpB,QAAQ2xH,IAAIzmJ,KAAKuoC,MAAMo2G,GAAK,GAAK,KAAOuL,EAAK,KAAQ,KAAO,IAAM;A;A;A;A;A;A;AC/DtE,iBAEIjsH,EAAStwG,EAAQ,aACjBw6T,EAAUx6T,EAAQ,WAClBy6T,EACiB,mBAAX93T,QAAkD,mBAAlBA,OAAO,IAC3CA,OAAO,IAAO,8BACd,KAEN5C,EAAQ2vP,OAASA,EACjB3vP,EAAQ26T,WA2TR,SAAqBhpP,IACdA,GAAUA,IACbA,EAAS,UAEJg+K,EAAOO,OAAOv+K,IA9TvB3xE,EAAQ46T,kBAAoB,OAExBC,EAAe,WAwDnB,SAAA9+D,EAAuBpqL,MACjBA,EAASkpP,YACD5uF,WAAW,cAAgBt6J,EAAS,sCAG5CsrJ,EAAAA,IAAUkI,WAAWxzJ,UACzBzxE,OAAO46T,eAAe79F,EAAK0yB,EAAOtlJ,WAC3B4yH,EAaT,SAAA0yB,EAAiB77K,EAAKinP,EAAkBppP,MAEnB,iBAARmC,EAAQ,IACe,iBAArBinP,YACCtpN,UACR,6EAGGmiJ,EAAY9/K,UAEdqiF,EAAKriF,EAAKinP,EAAkBppP,GAKrC,SAAAwkF,EAAe/1J,EAAO26T,EAAkBppP,MACjB,iBAAVvxE,SAwHb,SAAqBioG,EAAQ4gI,GACH,iBAAbA,GAAsC,KAAbA,IAClCA,EAAW,YAGR0mB,EAAOqrE,WAAW/xF,aACXx3H,UAAU,qBAAuBw3H,OAGzCt3J,EAAwC,EAA/Bm5J,EAAWziI,EAAQ4gI,GAC5BhM,EAAM8+B,EAAapqL,GAEnBspP,EAASh+F,EAAIo0B,MAAMhpJ,EAAQ4gI,GAE3BgyF,IAAWtpP,IAIbsrJ,EAAMA,EAAInrJ,MAAM,EAAGmpP,WAGdh+F,EA5IE85B,CAAW32P,EAAO26T,MAGvBpwF,YAAYC,OAAOxqO,UAqJzB,SAAwB86T,MAClBC,EAAWD,EAAW/1F,YAAAA,KACpBx7N,EAAAA,IAAWw7N,WAAW+1F,UACnBE,EAAgBzxT,EAAK4yM,OAAQ5yM,EAAKkhO,WAAYlhO,EAAKmhO,mBAErDuwF,EAAcH,GAzJZI,CAAcl7T,MAGV,MAATA,YACQqxG,UACR,yHACiDrxG,MAIjD+6T,EAAW/6T,EAAOuqO,cACjBvqO,GAAS+6T,EAAW/6T,EAAMm8M,OAAQouB,oBAC9BywF,EAAgBh7T,EAAO26T,EAAkBppP,MAGjB,oBAAtB4pP,oBACNJ,EAAW/6T,EAAOm7T,oBAClBn7T,GAAS+6T,EAAW/6T,EAAMm8M,OAAQg/G,2BAC9BH,EAAgBh7T,EAAO26T,EAAkBppP,MAG7B,iBAAVvxE,YACCqxG,UACR,6EAIA+pN,EAAUp7T,EAAMo7T,SAAWp7T,EAAMo7T,aACtB,MAAXA,GAAmBA,IAAYp7T,SAC1BuvP,EAAOx5F,KAAKqlK,EAAST,EAAkBppP,OAG5CqU,EAoJN,SAAqBulB,MACfokJ,EAAO8H,SAASlsJ,GAAAA,KACduE,EAA4B,EAAtBmsE,EAAQ1wE,EAAI55B,QAClBsrJ,EAAM8+B,EAAajsJ,UAEJ,IAAfmtH,EAAItrJ,QAIR45B,EAAI5hG,KAAKszN,EAAK,EAAG,EAAGntH,GAHXmtH,UAOQ76N,IAAfmpG,EAAI55B,aACoB,iBAAf45B,EAAI55B,QAAuB8pP,EAAYlwN,EAAI55B,QAC7CoqL,EAAa,GAEfs/D,EAAc9vN,MAGN,WAAbA,EAAI/3B,MAAqB+2B,MAAM/gB,QAAQ+hB,EAAI6tD,aACtCiiK,EAAc9vN,EAAI6tD,MAzKnBy1F,CAAWzuP,MACf4lF,EAAAA,OAAUA,KAEQ,oBAAXpjF,QAAgD,MAAtBA,OAAO84T,aACH,mBAA9Bt7T,EAAMwC,OAAO84T,oBACf/rE,EAAOx5F,KACZ/1J,EAAMwC,OAAO84T,aAAa,UAAWX,EAAkBppP,aAIjD8/B,UACR,yHACiDrxG,GAqBrD,SAAAu7T,EAAqBhyN,MACC,iBAATA,YACC8H,UAAU,6CACX9H,EAAO,YACNsiI,WAAW,cAAgBtiI,EAAO,kCA4BhD,SAAAiqJ,EAAsBjqJ,UACpBgyN,EAAWhyN,GACJoyJ,EAAapyJ,EAAO,EAAI,EAAoB,EAAhBsyE,EAAQtyE,IAwC7C,SAAA0xN,EAAwBz5F,WAClBjwJ,EAASiwJ,EAAMjwJ,OAAS,EAAI,EAA4B,EAAxBsqG,EAAQ2lD,EAAMjwJ,QAC9CsrJ,EAAM8+B,EAAapqL,GACdkC,EAAI,EAAGA,EAAIlC,EAAQkC,GAAK,EAC/BopJ,EAAIppJ,GAAgB,IAAX+tJ,EAAM/tJ,UAEVopJ,EAWT,SAAAm+F,EAA0Bx5F,EAAOiJ,EAAYl5J,MACvCk5J,EAAa,GAAKjJ,EAAMkJ,WAAaD,YAC7BoB,WAAW,2CAGnBrK,EAAMkJ,WAAaD,GAAcl5J,GAAU,aACnCs6J,WAAW,4CAGnBhP,SAEFA,OADiB76N,IAAfyoO,QAAuCzoO,IAAXuvE,EAC9BsrJ,IAAUkI,WAAWvD,QACDx/N,IAAXuvE,EACTsrJ,IAAUkI,WAAWvD,EAAOiJ,GAE5B5N,IAAUkI,WAAWvD,EAAOiJ,EAAYl5J,GAI1CzxE,OAAO46T,eAAe79F,EAAK0yB,EAAOtlJ,WAE3B4yH,EA4BT,SAAAhhD,EAAkBtqG,MAGZA,GAAUkpP,YACF5uF,WAAW,0DACa4uF,EAAa/vN,SAAS,IAAM,iBAEhD,EAATn5B,EAsGT,SAAAm5J,EAAqBziI,EAAQ4gI,MACvB0mB,EAAO8H,SAASpvJ,UACXA,EAAO12B,UAEZg5J,YAAYC,OAAOviI,IAAW8yN,EAAW9yN,EAAQsiI,oBAC5CtiI,EAAOyiI,cAEM,iBAAXziI,YACCoJ,UACR,kGAC0BpJ,OAI1ByH,EAAMzH,EAAO12B,OACbiqP,EAAa74O,UAAUpR,OAAS,IAAsB,IAAjBoR,UAAU,OAC9C64O,GAAqB,IAAR9rN,EAAQ,OAAU,UAGhC+rN,GAAc,WAER5yF,OACD,YACA,aACA,gBACIn5H,MACJ,WACA,eACIgsN,EAAYzzN,GAAQ12B,WACxB,WACA,YACA,cACA,kBACU,EAANm+B,MACJ,aACIA,IAAQ,MACZ,gBACIisN,EAAc1zN,GAAQ12B,kBAEzBkqP,SACKD,GAAa,EAAIE,EAAYzzN,GAAQ12B,OAE9Cs3J,GAAY,GAAKA,GAAUnzJ,cAC3B+lP,GAAc,GAMtB,SAAAG,EAAuB/yF,EAAUvnJ,EAAOhQ,OAClCmqP,GAAc,WASJz5T,IAAVs/E,GAAuBA,EAAQ,KACjCA,EAAQ,GAINA,EAAQgrB,KAAK/6B,aACR,YAGGvvE,IAARsvE,GAAqBA,EAAMg7B,KAAK/6B,UAClCD,EAAMg7B,KAAK/6B,QAGTD,GAAO,QACF,OAITA,KAAS,KACTgQ,KAAW,SAGF,OAGJunJ,IAAUA,EAAW,iBAGhBA,OACD,aACIgzF,EAASvvN,KAAMhrB,EAAOhQ,OAE1B,WACA,eACIsmL,EAAUtrJ,KAAMhrB,EAAOhQ,OAE3B,eACIwqP,EAAWxvN,KAAMhrB,EAAOhQ,OAE5B,aACA,gBACIyqP,EAAYzvN,KAAMhrB,EAAOhQ,OAE7B,gBACI0qP,EAAY1vN,KAAMhrB,EAAOhQ,OAE7B,WACA,YACA,cACA,kBACI2qP,EAAa3vN,KAAMhrB,EAAOhQ,cAG7BmqP,EAAAA,MAAAA,IAAuBpqN,UAAU,qBAAuBw3H,GAC5DA,GAAYA,EAAW,IAAInzJ,cAC3B+lP,GAAc,GAatB,SAAAzhN,EAAep0B,EAAGrlF,EAAGirF,OACf/X,EAAImS,EAAErlF,GACVqlF,EAAErlF,GAAKqlF,EAAE4F,GACT5F,EAAE4F,GAAK/X,EA4IT,SAAAyoP,EAA+B//G,EAAQl2G,EAAKwkI,EAAY5B,EAAUtvJ,MAE1C,IAAlB4iI,EAAO5qI,OAAW,OAAW,KAGP,iBAAfk5J,GACT5B,EAAW4B,EACXA,EAAa,GACJA,EAAa,WACtBA,EAAa,WACJA,GAAc,aACvBA,GAAc,YAGZ4wF,EADJ5wF,GAAcA,KAGZA,EAAalxJ,EAAM,EAAK4iI,EAAO5qI,OAAS,GAItCk5J,EAAa,IAAGA,EAAatuB,EAAO5qI,OAASk5J,GAC7CA,GAActuB,EAAO5qI,OAAAA,IACnBgI,EAAAA,OAAa,EACZkxJ,EAAatuB,EAAO5qI,OAAS,UACzBk5J,EAAa,EAAA,KAClBlxJ,EAAkB,OACT,EADJkxJ,EAAa,KAKL,iBAARxkI,IACTA,EAAMspJ,EAAOx5F,KAAK9vD,EAAK4iI,IAIrB0mB,EAAO8H,SAASpxJ,UAEC,IAAfA,EAAI10B,QACE,EAEH4qP,EAAahgH,EAAQl2G,EAAKwkI,EAAY5B,EAAUtvJ,MAC/B,iBAAR0sB,SAChBA,GAAY,IACgC,mBAAjC8+H,WAAW96H,UAAUnyB,QAC1ByB,EACKwrJ,WAAW96H,UAAUnyB,QAAQoyB,KAAKiyG,EAAQl2G,EAAKwkI,GAE/C1F,WAAW96H,UAAUhe,YAAYie,KAAKiyG,EAAQl2G,EAAKwkI,GAGvD0xF,EAAahgH,EAAAA,CAASl2G,GAAMwkI,EAAY5B,EAAUtvJ,aAGjD83B,UAAU,wCAGtB,SAAA8qN,EAAuBjzN,EAAKjD,EAAKwkI,EAAY5B,EAAUtvJ,OA2BjD9F,EA1BA2oP,EAAY,EACZC,EAAYnzN,EAAI33B,OAChB+qP,EAAYr2N,EAAI10B,eAEHvvE,IAAb6mO,IAEe,UADjBA,EAAWl2J,OAAOk2J,GAAUnzJ,gBACY,UAAbmzJ,GACV,YAAbA,GAAuC,aAAbA,GAAa,IACrC3/H,EAAI33B,OAAS,GAAK00B,EAAI10B,OAAS,SACzB,EAEV6qP,EAAY,EACZC,GAAa,EACbC,GAAa,EACb7xF,GAAc,EAIlB,SAAAnN,EAAeT,EAAKppJ,UACA,IAAd2oP,EACKv/F,EAAIppJ,GAEJopJ,EAAI0/F,aAAa9oP,EAAI2oP,MAK5B7iP,EAAAA,KACEijP,GAAc,MACb/oP,EAAIg3J,EAAYh3J,EAAI4oP,EAAW5oP,OAC9B6pJ,EAAKp0H,EAAKz1B,KAAO6pJ,EAAKr3H,GAAqB,IAAhBu2N,EAAoB,EAAI/oP,EAAI+oP,QACrC,IAAhBA,IAAmBA,EAAa/oP,GAChCA,EAAI+oP,EAAa,IAAMF,EAAAA,OAAkBE,EAAaJ,OAEtC,IAAhBI,IAAmB/oP,GAAKA,EAAI+oP,GAChCA,GAAc,WAId/xF,EAAa6xF,EAAYD,IAAW5xF,EAAa4xF,EAAYC,GAC5D7oP,EAAIg3J,EAAYh3J,GAAK,EAAGA,IAAAA,SACvBqoG,GAAQ,EACHl+E,EAAI,EAAGA,EAAI0+N,EAAW1+N,OACzB0/H,EAAKp0H,EAAKz1B,EAAImqB,KAAO0/H,EAAKr3H,EAAKrI,GAAAA,CACjCk+E,GAAQ,WAIRA,EAAAA,OAAcroG,SAId,EAeV,SAAAgpP,EAAmB5/F,EAAK50H,EAAQ52B,EAAQE,GACtCF,EAASoB,OAAOpB,IAAW,MACvBS,EAAY+qJ,EAAItrJ,OAASF,EACxBE,GAGHA,EAASkB,OAAOlB,IACHO,IACXP,EAASO,GAJXP,EAASO,MAQPk/B,EAAS/I,EAAO12B,OAEhBA,EAASy/B,EAAS,IACpBz/B,EAASy/B,EAAS,WAEXv9B,EAAI,EAAGA,EAAIlC,IAAUkC,EAAAA,KACxBugC,EAASthC,SAASu1B,EAAO91B,OAAW,EAAJsB,EAAO,GAAI,OAC3C4nP,EAAYrnN,GAAAA,OAAgBvgC,EAChCopJ,EAAIxrJ,EAASoC,GAAKugC,SAEbvgC,EAGT,SAAAy+K,EAAoBr1B,EAAK50H,EAAQ52B,EAAQE,UAChCmrP,EAAWhB,EAAYzzN,EAAQ40H,EAAItrJ,OAASF,GAASwrJ,EAAKxrJ,EAAQE,GAG3E,SAAAorP,EAAqB9/F,EAAK50H,EAAQ52B,EAAQE,UACjCmrP,EAk4BT,SAAuB56N,WACjB86N,EAAAA,GACKnpP,EAAI,EAAGA,EAAIquB,EAAIvwB,SAAUkC,EAEhCmpP,EAAUxlP,KAAyB,IAApB0qB,EAAIvd,WAAW9Q,WAEzBmpP,EAx4BWC,CAAa50N,GAAS40H,EAAKxrJ,EAAQE,GAGvD,SAAAurP,EAAsBjgG,EAAK50H,EAAQ52B,EAAQE,UAClCmrP,EAAWf,EAAc1zN,GAAS40H,EAAKxrJ,EAAQE,GAGxD,SAAAwrP,EAAoBlgG,EAAK50H,EAAQ52B,EAAQE,UAChCmrP,EAm4BT,SAAyB56N,EAAKk7N,WACxBjkP,EAAG42K,EAAIC,EACPgtE,EAAAA,GACKnpP,EAAI,EAAGA,EAAIquB,EAAIvwB,WACjByrP,GAAS,GAAK,KADavpP,EAIhCk8K,GADA52K,EAAI+oB,EAAIvd,WAAW9Q,KACT,EACVm8K,EAAK72K,EAAI,IACT6jP,EAAUxlP,KAAKw4K,GACfgtE,EAAUxlP,KAAKu4K,UAGVitE,EAh5BWK,CAAeh1N,EAAQ40H,EAAItrJ,OAASF,GAASwrJ,EAAKxrJ,EAAQE,GA+E9E,SAAAyqP,EAAsBn/F,EAAKv7I,EAAOhQ,UAClB,IAAVgQ,GAAehQ,IAAQurJ,EAAItrJ,OACtB4+B,EAAO+sN,cAAcrgG,GAErB1sH,EAAO+sN,cAAcrgG,EAAInrJ,MAAM4P,EAAOhQ,IAIjD,SAAAsmL,EAAoB/6B,EAAKv7I,EAAOhQ,GAC9BA,EAAMY,KAAKq0B,IAAIs2H,EAAItrJ,OAAQD,WACvB+G,EAAAA,GAEA5E,EAAI6N,EACD7N,EAAInC,GAAAA,KAYH6rP,EAAYC,EAAWC,EAAYC,EAXrCC,EAAY1gG,EAAIppJ,GAChB+pP,EAAY,KACZC,EAAoBF,EAAY,IAChC,EACCA,EAAY,IACT,EACCA,EAAY,IACT,EACA,KAER9pP,EAAIgqP,GAAoBnsP,SAGlBmsP,QACD,EACCF,EAAY,MACdC,EAAYD,cAGX,EAEyB,MAAV,KADlBJ,EAAatgG,EAAIppJ,EAAI,OAEnB6pP,GAA6B,GAAZC,IAAqB,EAAoB,GAAbJ,GACzB,MAClBK,EAAYF,cAIb,EACHH,EAAatgG,EAAIppJ,EAAI,GACrB2pP,EAAYvgG,EAAIppJ,EAAI,GACQ,MAAV,IAAb0pP,IAAsD,MAAV,IAAZC,KACnCE,GAA6B,GAAZC,IAAoB,IAAoB,GAAbJ,IAAsB,EAAmB,GAAZC,GACrD,OAAUE,EAAgB,OAAUA,EAAgB,SACtEE,EAAYF,cAIb,EACHH,EAAatgG,EAAIppJ,EAAI,GACrB2pP,EAAYvgG,EAAIppJ,EAAI,GACpB4pP,EAAaxgG,EAAIppJ,EAAI,GACO,MAAV,IAAb0pP,IAAsD,MAAV,IAAZC,IAAsD,MAAV,IAAbC,KAClEC,GAA6B,GAAZC,IAAoB,IAAqB,GAAbJ,IAAsB,IAAmB,GAAZC,IAAqB,EAAoB,GAAbC,GAClF,OAAUC,EAAgB,UAC5CE,EAAYF,GAMJ,OAAdE,GAGFA,EAAY,MACZC,EAAmB,GACVD,EAAY,QAErBA,GAAa,MACbnlP,EAAIjB,KAAKomP,IAAc,GAAK,KAAQ,OACpCA,EAAY,MAAqB,KAAZA,GAGvBnlP,EAAIjB,KAAKomP,GACT/pP,GAAKgqP,SAWT,SAAgCC,OAC1BhuN,EAAMguN,EAAWnsP,UACjBm+B,GAAOiuN,SACFhrP,OAAO67C,aAAakhF,MAAM/8H,OAAQ+qP,OAIvCrlP,EAAM,GACN5E,EAAI,OACDA,EAAIi8B,GACTr3B,GAAO1F,OAAO67C,aAAakhF,MACzB/8H,OACA+qP,EAAWhsP,MAAM+B,EAAGA,GAAKkqP,WAGtBtlP,EAvBAulP,CAAsBvlP,GA1+B/Bz4E,EAAQi+T,WAAapD,EAgBrBlrE,EAAOuuE,oBAUP,mBAGQ50N,EAAAA,IAAU67H,WAAW,GACrBpuF,EAAAA,CAAUonL,IAAK,kBAAqB,YACxCj+T,OAAO46T,eAAe/jL,EAAOouF,WAAW96H,WACxCnqG,OAAO46T,eAAexxN,EAAKytC,GACN,KAAdztC,EAAI60N,YACJ19T,UACA,GAnBkB29T,GAExBzuE,EAAOuuE,qBAA0C,oBAAZ92N,SACb,mBAAlBA,QAAQnrB,OACjBmrB,QAAQnrB,MACN,iJAkBJ/7E,OAAOC,eAAewvP,EAAOtlJ,UAAW,SAAA,CACtCoB,YAAY,EACZvd,IAAK,cACEyhK,EAAO8H,SAAS/qJ,aACdA,KAAK6vG,UAIhBr8M,OAAOC,eAAewvP,EAAOtlJ,UAAW,SAAA,CACtCoB,YAAY,EACZvd,IAAK,cACEyhK,EAAO8H,SAAS/qJ,aACdA,KAAKm+H,cAqChB8kB,EAAO0uE,SAAW,KAgElB1uE,EAAOx5F,KAAO,SAAU/1J,EAAO26T,EAAkBppP,UACxCwkF,EAAK/1J,EAAO26T,EAAkBppP,IAKvCzxE,OAAO46T,eAAenrE,EAAOtlJ,UAAW86H,WAAW96H,WACnDnqG,OAAO46T,eAAenrE,EAAQxqB,YA8B9BwqB,EAAOO,MAAQ,SAAUvmJ,EAAMu0L,EAAMj1D,UApBrC,SAAgBt/H,EAAMu0L,EAAMj1D,UAC1B0yF,EAAWhyN,GACPA,GAAQ,EACHoyJ,EAAapyJ,QAETvnG,IAAT87R,EAIyB,iBAAbj1D,EACV8yB,EAAapyJ,GAAMu0L,KAAKA,EAAMj1D,GAC9B8yB,EAAapyJ,GAAMu0L,KAAKA,GAEvBniC,EAAapyJ,GAQbumJ,CAAMvmJ,EAAMu0L,EAAMj1D,IAW3B0mB,EAAOiE,YAAc,SAAUjqJ,UACtBiqJ,EAAYjqJ,IAKrBgmJ,EAAO2uE,gBAAkB,SAAU30N,UAC1BiqJ,EAAYjqJ,IA8GrBgmJ,EAAO8H,SAAW,SAAmBzxK,UACvB,MAALA,IAA6B,IAAhBA,EAAEu4O,WACpBv4O,IAAM2pK,EAAOtlJ,WAGjBslJ,EAAO6uE,QAAU,SAAkBjrP,EAAGyS,MAChCm1O,EAAW5nP,EAAG4xJ,cAAa5xJ,EAAIo8K,EAAOx5F,KAAK5iF,EAAGA,EAAE9B,OAAQ8B,EAAEu3J,aAC1DqwF,EAAWn1O,EAAGm/I,cAAan/I,EAAI2pK,EAAOx5F,KAAKnwE,EAAGA,EAAEvU,OAAQuU,EAAE8kJ,cACzD6kB,EAAO8H,SAASlkL,KAAOo8K,EAAO8H,SAASzxK,aAChCyrB,UACR,4EAIAl+B,IAAMyS,EAAAA,OAAU,UAEhBs0B,EAAI/mC,EAAE5B,OACN4oC,EAAIv0B,EAAErU,OAEDkC,EAAI,EAAGi8B,EAAMx9B,KAAKq0B,IAAI2T,EAAGC,GAAI1mC,EAAIi8B,IAAOj8B,KAC3CN,EAAEM,KAAOmS,EAAEnS,GAAAA,CACbymC,EAAI/mC,EAAEM,GACN0mC,EAAIv0B,EAAEnS,gBAKNymC,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,GAGTq1I,EAAOqrE,WAAa,SAAqB/xF,UAC/Bl2J,OAAOk2J,GAAUnzJ,mBAClB,UACA,WACA,YACA,YACA,aACA,aACA,aACA,WACA,YACA,cACA,kBACI,iBAEA,IAIb65K,EAAOpxJ,OAAS,SAAiBnO,EAAMze,OAChC44B,MAAM/gB,QAAQ4G,aACPqhB,UAAU,kDAGF,IAAhBrhB,EAAKze,cACAg+K,EAAOO,MAAM,OAGlBr8K,UACWzxE,IAAXuvE,MACFA,EAAS,EACJkC,EAAI,EAAGA,EAAIuc,EAAKze,SAAUkC,EAC7BlC,GAAUye,EAAKvc,GAAGlC,WAIlB4qI,EAASozC,EAAOiE,YAAYjiL,GAC5B2S,EAAM,MACLzQ,EAAI,EAAGA,EAAIuc,EAAKze,SAAUkC,EAAAA,KACzBopJ,EAAM7sI,EAAKvc,MACXsnP,EAAWl+F,EAAKkI,YACd7gJ,EAAM24I,EAAItrJ,OAAS4qI,EAAO5qI,OAC5Bg+K,EAAOx5F,KAAK8mE,GAAKtzN,KAAK4yM,EAAQj4H,GAE9B6gJ,WAAW96H,UAAUlc,IAAImc,KACvBiyG,EACA0gB,EACA34I,YAGMqrK,EAAO8H,SAASx6B,aAChBxrH,UAAU,+CAEpBwrH,EAAItzN,KAAK4yM,EAAQj4H,GAEnBA,GAAO24I,EAAItrJ,cAEN4qI,GAkDTozC,EAAO7kB,WAAaA,EA8EpB6kB,EAAOtlJ,UAAUk0N,WAAY,EAQ7B5uE,EAAOtlJ,UAAUo0N,OAAS,eACpB3uN,EAAMpD,KAAK/6B,UACXm+B,EAAM,GAAM,YACJm8H,WAAW,qDAEdp4J,EAAI,EAAGA,EAAIi8B,EAAKj8B,GAAK,EAC5BumC,EAAK1N,KAAM74B,EAAGA,EAAI,UAEb64B,MAGTijJ,EAAOtlJ,UAAUq0N,OAAS,eACpB5uN,EAAMpD,KAAK/6B,UACXm+B,EAAM,GAAM,YACJm8H,WAAW,qDAEdp4J,EAAI,EAAGA,EAAIi8B,EAAKj8B,GAAK,EAC5BumC,EAAK1N,KAAM74B,EAAGA,EAAI,GAClBumC,EAAK1N,KAAM74B,EAAI,EAAGA,EAAI,UAEjB64B,MAGTijJ,EAAOtlJ,UAAUs0N,OAAS,eACpB7uN,EAAMpD,KAAK/6B,UACXm+B,EAAM,GAAM,YACJm8H,WAAW,qDAEdp4J,EAAI,EAAGA,EAAIi8B,EAAKj8B,GAAK,EAC5BumC,EAAK1N,KAAM74B,EAAGA,EAAI,GAClBumC,EAAK1N,KAAM74B,EAAI,EAAGA,EAAI,GACtBumC,EAAK1N,KAAM74B,EAAI,EAAGA,EAAI,GACtBumC,EAAK1N,KAAM74B,EAAI,EAAGA,EAAI,UAEjB64B,MAGTijJ,EAAOtlJ,UAAUS,SAAW,eACtBn5B,EAAS+6B,KAAK/6B,cACH,IAAXA,EAAqB,GACA,IAArBoR,UAAUpR,OAAqBqmL,EAAUtrJ,KAAM,EAAG/6B,GAC/CqqP,EAAalsH,MAAMpjG,KAAM3pB,YAGlC4sK,EAAOtlJ,UAAUu0N,eAAiBjvE,EAAOtlJ,UAAUS,SAEnD6kJ,EAAOtlJ,UAAUq8H,OAAS,SAAiB1gJ,OACpC2pK,EAAO8H,SAASzxK,GAAAA,MAAAA,IAAcyrB,UAAU,oCACzC/E,OAAS1mB,GACsB,IAA5B2pK,EAAO6uE,QAAQ9xN,KAAM1mB,IAG9B2pK,EAAOtlJ,UAAUs2L,QAAU,eACrBz+L,EAAM,GACN7vB,EAAMryE,EAAQ46T,yBAClB14N,EAAMwK,KAAK5B,SAAS,MAAO,EAAGz4B,GAAKuT,QAAQ,UAAW,OAAO1B,OACzDwoB,KAAK/6B,OAASU,IAAK6vB,GAAO,SACvB,WAAaA,EAAM,KAExBw4N,IACF/qE,EAAOtlJ,UAAUqwN,GAAuB/qE,EAAOtlJ,UAAUs2L,SAG3DhxC,EAAOtlJ,UAAUm0N,QAAU,SAAkB1mJ,EAAQp2F,EAAOhQ,EAAKmtP,EAAWC,MACtE3D,EAAWrjJ,EAAQqtD,cACrBrtD,EAAS63E,EAAOx5F,KAAK2hB,EAAQA,EAAOrmG,OAAQqmG,EAAOgzD,cAEhD6kB,EAAO8H,SAAS3/E,aACTrmE,UACR,wFAC2BqmE,WAIjB11K,IAAVs/E,IACFA,EAAQ,QAEEt/E,IAARsvE,IACFA,EAAMomG,EAASA,EAAOnmG,OAAS,QAEfvvE,IAAdy8T,IACFA,EAAY,QAEEz8T,IAAZ08T,IACFA,EAAUpyN,KAAK/6B,QAGb+P,EAAQ,GAAKhQ,EAAMomG,EAAOnmG,QAAUktP,EAAY,GAAKC,EAAUpyN,KAAK/6B,iBAC5Ds6J,WAAW,yBAGnB4yF,GAAaC,GAAWp9O,GAAShQ,SAC5B,KAELmtP,GAAaC,SACP,KAENp9O,GAAShQ,SACJ,KAQLg7B,OAASorE,EAAAA,OAAe,UAExBx9D,GAJJwkN,KAAa,IADbD,KAAe,GAMXtkN,GAPJ7oC,KAAS,IADTgQ,KAAW,GASPouB,EAAMx9B,KAAKq0B,IAAI2T,EAAGC,GAElBwkN,EAAWryN,KAAK56B,MAAM+sP,EAAWC,GACjCE,EAAalnJ,EAAOhmG,MAAM4P,EAAOhQ,GAE5BmC,EAAI,EAAGA,EAAIi8B,IAAOj8B,KACrBkrP,EAASlrP,KAAOmrP,EAAWnrP,GAAAA,CAC7BymC,EAAIykN,EAASlrP,GACb0mC,EAAIykN,EAAWnrP,gBAKfymC,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,GA4HTq1I,EAAOtlJ,UAAUlvB,SAAW,SAAmBkrB,EAAKwkI,EAAY5B,UACV,IAA7Cv8H,KAAKx0B,QAAQmuB,EAAKwkI,EAAY5B,IAGvC0mB,EAAOtlJ,UAAUnyB,QAAU,SAAkBmuB,EAAKwkI,EAAY5B,UACrDqzF,EAAqB5vN,KAAMrG,EAAKwkI,EAAY5B,GAAU,IAG/D0mB,EAAOtlJ,UAAUhe,YAAc,SAAsBga,EAAKwkI,EAAY5B,UAC7DqzF,EAAqB5vN,KAAMrG,EAAKwkI,EAAY5B,GAAU,IA4C/D0mB,EAAOtlJ,UAAUgnJ,MAAQ,SAAgBhpJ,EAAQ52B,EAAQE,EAAQs3J,WAEhD7mO,IAAXqvE,EACFw3J,EAAW,OACXt3J,EAAS+6B,KAAK/6B,OACdF,EAAS,eAEWrvE,IAAXuvE,GAA0C,iBAAXF,EACxCw3J,EAAWx3J,EACXE,EAAS+6B,KAAK/6B,OACdF,EAAS,WAEA2gL,SAAS3gL,aAUR+zB,MACR,2EAVF/zB,KAAoB,EAChB2gL,SAASzgL,IACXA,KAAoB,OACHvvE,IAAb6mO,IAAwBA,EAAW,UAEvCA,EAAWt3J,EACXA,OAASvvE,OAQT8vE,EAAYw6B,KAAK/6B,OAASF,WACfrvE,IAAXuvE,GAAwBA,EAASO,KAAWP,EAASO,GAEpDm2B,EAAO12B,OAAS,IAAMA,EAAS,GAAKF,EAAS,IAAOA,EAASi7B,KAAK/6B,iBAC3Ds6J,WAAW,0CAGlBhD,IAAUA,EAAW,gBAEtB4yF,GAAc,WAER5yF,OACD,aACI4zF,EAASnwN,KAAMrE,EAAQ52B,EAAQE,OAEnC,WACA,eACI2gL,EAAU5lJ,KAAMrE,EAAQ52B,EAAQE,OAEpC,YACA,aACA,gBACIorP,EAAWrwN,KAAMrE,EAAQ52B,EAAQE,OAErC,gBAEIurP,EAAYxwN,KAAMrE,EAAQ52B,EAAQE,OAEtC,WACA,YACA,cACA,kBACIwrP,EAAUzwN,KAAMrE,EAAQ52B,EAAQE,cAGnCkqP,EAAAA,MAAAA,IAAuBpqN,UAAU,qBAAuBw3H,GAC5DA,GAAY,GAAKA,GAAUnzJ,cAC3B+lP,GAAc,IAKtBlsE,EAAOtlJ,UAAUvW,OAAS,kBAEtBtgB,KAAM,SACN4lF,KAAM7uD,MAAMF,UAAUv4B,MAAMw4B,KAAKoC,KAAKuyN,MAAQvyN,KAAM,SA2FpDqxN,EAAuB,KAoB3B,SAAA7B,EAAqBj/F,EAAKv7I,EAAOhQ,OAC3BmnB,EAAM,GACVnnB,EAAMY,KAAKq0B,IAAIs2H,EAAItrJ,OAAQD,WAElBmC,EAAI6N,EAAO7N,EAAInC,IAAOmC,EAC7BglB,GAAO9lB,OAAO67C,aAAsB,IAATquG,EAAIppJ,WAE1BglB,EAGT,SAAAsjO,EAAsBl/F,EAAKv7I,EAAOhQ,OAC5BmnB,EAAM,GACVnnB,EAAMY,KAAKq0B,IAAIs2H,EAAItrJ,OAAQD,WAElBmC,EAAI6N,EAAO7N,EAAInC,IAAOmC,EAC7BglB,GAAO9lB,OAAO67C,aAAaquG,EAAIppJ,WAE1BglB,EAGT,SAAAojO,EAAmBh/F,EAAKv7I,EAAOhQ,OACzBo+B,EAAMmtH,EAAItrJ,SAET+P,GAASA,EAAQ,KAAGA,EAAQ,KAC5BhQ,GAAOA,EAAM,GAAKA,EAAMo+B,KAAKp+B,EAAMo+B,WAEpC29B,EAAM,GACD55D,EAAI6N,EAAO7N,EAAInC,IAAOmC,EAC7B45D,GAAOyxL,EAAoBjiG,EAAIppJ,WAE1B45D,EAGT,SAAA4uL,EAAuBp/F,EAAKv7I,EAAOhQ,WAC7B2zJ,EAAQpI,EAAInrJ,MAAM4P,EAAOhQ,GACzB+G,EAAM,GAED5E,EAAI,EAAGA,EAAIwxJ,EAAM1zJ,OAAS,EAAGkC,GAAK,EACzC4E,GAAO1F,OAAO67C,aAAay2G,EAAMxxJ,GAAqB,IAAfwxJ,EAAMxxJ,EAAI,WAE5C4E,EAkCT,SAAA0mP,EAAsB1tP,EAAQo1O,EAAKl1O,MAC5BF,EAAS,GAAO,GAAKA,EAAS,EAAA,MAAA,IAAaw6J,WAAW,yBACvDx6J,EAASo1O,EAAMl1O,EAAAA,MAAAA,IAAkBs6J,WAAW,yCAoLlD,SAAAmzF,EAAmBniG,EAAK78N,EAAOqxE,EAAQo1O,EAAKx0O,EAAKs0B,OAC1CgpJ,EAAO8H,SAASx6B,GAAAA,MAAAA,IAAgBxrH,UAAU,kDAC3CrxG,EAAQiyE,GAAOjyE,EAAQumG,EAAAA,MAAAA,IAAeslI,WAAW,wCACjDx6J,EAASo1O,EAAM5pF,EAAItrJ,OAAAA,MAAAA,IAAkBs6J,WAAW,sBAgMtD,SAAAozF,EAAuBpiG,EAAK78N,EAAOqxE,EAAQo1O,EAAKx0O,EAAKs0B,MAC/Cl1B,EAASo1O,EAAM5pF,EAAItrJ,OAAAA,MAAAA,IAAkBs6J,WAAW,yBAChDx6J,EAAS,EAAA,MAAA,IAAaw6J,WAAW,sBAGvC,SAAAqzF,EAAqBriG,EAAK78N,EAAOqxE,EAAQgwN,EAAc89B,UACrDn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GACHF,EAAapiG,EAAK78N,EAAOqxE,EAAQ,GAEnCgpP,EAAQppE,MAAMp0B,EAAK78N,EAAOqxE,EAAQgwN,EAAc,GAAI,GAC7ChwN,EAAS,EAWlB,SAAA+tP,EAAsBviG,EAAK78N,EAAOqxE,EAAQgwN,EAAc89B,UACtDn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GACHF,EAAapiG,EAAK78N,EAAOqxE,EAAQ,GAEnCgpP,EAAQppE,MAAMp0B,EAAK78N,EAAOqxE,EAAQgwN,EAAc,GAAI,GAC7ChwN,EAAS,EAtblBk+K,EAAOtlJ,UAAUv4B,MAAQ,SAAgB4P,EAAOhQ,OAC1Co+B,EAAMpD,KAAK/6B,QACf+P,IAAUA,GAGE,GACVA,GAASouB,GACG,IAAGpuB,EAAQ,GACdA,EAAQouB,IACjBpuB,EAAQouB,IANVp+B,OAActvE,IAARsvE,EAAoBo+B,IAAQp+B,GASxB,GACRA,GAAOo+B,GACG,IAAGp+B,EAAM,GACVA,EAAMo+B,IACfp+B,EAAMo+B,GAGJp+B,EAAMgQ,IAAOhQ,EAAMgQ,OAEnB+9O,EAAS/yN,KAAKm8H,SAASnnJ,EAAOhQ,UAElCxxE,OAAO46T,eAAe2E,EAAQ9vE,EAAOtlJ,WAE9Bo1N,GAWT9vE,EAAOtlJ,UAAUorJ,WACjB9F,EAAOtlJ,UAAUq1N,WAAa,SAAqBjuP,EAAQq5J,EAAYy0F,GACrE9tP,KAAoB,EACpBq5J,KAA4B,EACvBy0F,GAAUJ,EAAY1tP,EAAQq5J,EAAYp+H,KAAK/6B,gBAEhD00B,EAAMqG,KAAKj7B,GACX6qN,EAAM,EACNzoN,EAAI,IACCA,EAAIi3J,IAAewxD,GAAO,MACjCj2L,GAAOqG,KAAKj7B,EAASoC,GAAKyoN,SAGrBj2L,GAGTspJ,EAAOtlJ,UAAUqrJ,WACjB/F,EAAOtlJ,UAAUs1N,WAAa,SAAqBluP,EAAQq5J,EAAYy0F,GACrE9tP,KAAoB,EACpBq5J,KAA4B,EACvBy0F,GACHJ,EAAY1tP,EAAQq5J,EAAYp+H,KAAK/6B,gBAGnC00B,EAAMqG,KAAKj7B,IAAWq5J,GACtBwxD,EAAM,EACHxxD,EAAa,IAAMwxD,GAAO,MAC/Bj2L,GAAOqG,KAAKj7B,IAAWq5J,GAAcwxD,SAGhCj2L,GAGTspJ,EAAOtlJ,UAAUu1N,UACjBjwE,EAAOtlJ,UAAUw1N,UAAY,SAAoBpuP,EAAQ8tP,UACvD9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,QACpC+6B,KAAKj7B,IAGdk+K,EAAOtlJ,UAAUy1N,aACjBnwE,EAAOtlJ,UAAU01N,aAAe,SAAuBtuP,EAAQ8tP,UAC7D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,QACpC+6B,KAAKj7B,GAAWi7B,KAAKj7B,EAAS,IAAM,GAG7Ck+K,EAAOtlJ,UAAU21N,aACjBrwE,EAAOtlJ,UAAUsyN,aAAe,SAAuBlrP,EAAQ8tP,UAC7D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,QACnC+6B,KAAKj7B,IAAW,EAAKi7B,KAAKj7B,EAAS,IAG7Ck+K,EAAOtlJ,UAAU41N,aACjBtwE,EAAOtlJ,UAAU61N,aAAe,SAAuBzuP,EAAQ8tP,UAC7D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,SAElC+6B,KAAKj7B,GACTi7B,KAAKj7B,EAAS,IAAM,EACpBi7B,KAAKj7B,EAAS,IAAM,IACD,SAAnBi7B,KAAKj7B,EAAS,IAGrBk+K,EAAOtlJ,UAAU81N,aACjBxwE,EAAOtlJ,UAAU+1N,aAAe,SAAuB3uP,EAAQ8tP,UAC7D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,QAEpB,SAAf+6B,KAAKj7B,IACTi7B,KAAKj7B,EAAS,IAAM,GACrBi7B,KAAKj7B,EAAS,IAAM,EACrBi7B,KAAKj7B,EAAS,KAGlBk+K,EAAOtlJ,UAAUg2N,UAAY,SAAoB5uP,EAAQq5J,EAAYy0F,GACnE9tP,KAAoB,EACpBq5J,KAA4B,EACvBy0F,GAAUJ,EAAY1tP,EAAQq5J,EAAYp+H,KAAK/6B,gBAEhD00B,EAAMqG,KAAKj7B,GACX6qN,EAAM,EACNzoN,EAAI,IACCA,EAAIi3J,IAAewxD,GAAO,MACjCj2L,GAAOqG,KAAKj7B,EAASoC,GAAKyoN,SAIxBj2L,IAFJi2L,GAAO,OAESj2L,GAAO/zB,KAAKy5J,IAAI,EAAG,EAAIjB,IAEhCzkI,GAGTspJ,EAAOtlJ,UAAUi2N,UAAY,SAAoB7uP,EAAQq5J,EAAYy0F,GACnE9tP,KAAoB,EACpBq5J,KAA4B,EACvBy0F,GAAUJ,EAAY1tP,EAAQq5J,EAAYp+H,KAAK/6B,gBAEhDkC,EAAIi3J,EACJwxD,EAAM,EACNj2L,EAAMqG,KAAKj7B,IAAWoC,GACnBA,EAAI,IAAMyoN,GAAO,MACtBj2L,GAAOqG,KAAKj7B,IAAWoC,GAAKyoN,SAI1Bj2L,IAFJi2L,GAAO,OAESj2L,GAAO/zB,KAAKy5J,IAAI,EAAG,EAAIjB,IAEhCzkI,GAGTspJ,EAAOtlJ,UAAUk2N,SAAW,SAAmB9uP,EAAQ8tP,UACrD9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,QACtB,IAAf+6B,KAAKj7B,IAC0B,GAA5B,IAAOi7B,KAAKj7B,GAAU,GADKi7B,KAAKj7B,IAI3Ck+K,EAAOtlJ,UAAUm2N,YAAc,SAAsB/uP,EAAQ8tP,GAC3D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,YACvC00B,EAAMqG,KAAKj7B,GAAWi7B,KAAKj7B,EAAS,IAAM,SAChC,MAAN40B,EAAsB,WAANA,EAAmBA,GAG7CspJ,EAAOtlJ,UAAUo2N,YAAc,SAAsBhvP,EAAQ8tP,GAC3D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,YACvC00B,EAAMqG,KAAKj7B,EAAS,GAAMi7B,KAAKj7B,IAAW,SAChC,MAAN40B,EAAsB,WAANA,EAAmBA,GAG7CspJ,EAAOtlJ,UAAUq2N,YAAc,SAAsBjvP,EAAQ8tP,UAC3D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,QAEnC+6B,KAAKj7B,GACVi7B,KAAKj7B,EAAS,IAAM,EACpBi7B,KAAKj7B,EAAS,IAAM,GACpBi7B,KAAKj7B,EAAS,IAAM,IAGzBk+K,EAAOtlJ,UAAUs2N,YAAc,SAAsBlvP,EAAQ8tP,UAC3D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,QAEnC+6B,KAAKj7B,IAAW,GACrBi7B,KAAKj7B,EAAS,IAAM,GACpBi7B,KAAKj7B,EAAS,IAAM,EACpBi7B,KAAKj7B,EAAS,IAGnBk+K,EAAOtlJ,UAAUuqJ,YAAc,SAAsBnjL,EAAQ8tP,UAC3D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,QACpC8oP,EAAQ/8F,KAAKhxH,KAAMj7B,GAAQ,EAAM,GAAI,IAG9Ck+K,EAAOtlJ,UAAUwqJ,YAAc,SAAsBpjL,EAAQ8tP,UAC3D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,QACpC8oP,EAAQ/8F,KAAKhxH,KAAMj7B,GAAQ,EAAO,GAAI,IAG/Ck+K,EAAOtlJ,UAAU6rJ,aAAe,SAAuBzkL,EAAQ8tP,UAC7D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,QACpC8oP,EAAQ/8F,KAAKhxH,KAAMj7B,GAAQ,EAAM,GAAI,IAG9Ck+K,EAAOtlJ,UAAU8rJ,aAAe,SAAuB1kL,EAAQ8tP,UAC7D9tP,KAAoB,EACf8tP,GAAUJ,EAAY1tP,EAAQ,EAAGi7B,KAAK/6B,QACpC8oP,EAAQ/8F,KAAKhxH,KAAMj7B,GAAQ,EAAO,GAAI,IAS/Ck+K,EAAOtlJ,UAAUkrJ,YACjB5F,EAAOtlJ,UAAUu2N,YAAc,SAAsBxgU,EAAOqxE,EAAQq5J,EAAYy0F,IAC9En/T,GAASA,EACTqxE,KAAoB,EACpBq5J,KAA4B,EACvBy0F,IAEHH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQq5J,EADfx4J,KAAKy5J,IAAI,EAAG,EAAIjB,GAAc,EACO,OAGlDwxD,EAAM,EACNzoN,EAAI,MACR64B,KAAKj7B,GAAkB,IAARrxE,IACNyzE,EAAIi3J,IAAewxD,GAAO,MACjC5vL,KAAKj7B,EAASoC,GAAMzzE,EAAQk8R,EAAO,WAG9B7qN,EAASq5J,GAGlB6kB,EAAOtlJ,UAAUmrJ,YACjB7F,EAAOtlJ,UAAUw2N,YAAc,SAAsBzgU,EAAOqxE,EAAQq5J,EAAYy0F,IAC9En/T,GAASA,EACTqxE,KAAoB,EACpBq5J,KAA4B,EACvBy0F,IAEHH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQq5J,EADfx4J,KAAKy5J,IAAI,EAAG,EAAIjB,GAAc,EACO,OAGlDj3J,EAAIi3J,EAAa,EACjBwxD,EAAM,MACV5vL,KAAKj7B,EAASoC,GAAa,IAARzzE,IACVyzE,GAAK,IAAMyoN,GAAO,MACzB5vL,KAAKj7B,EAASoC,GAAMzzE,EAAQk8R,EAAO,WAG9B7qN,EAASq5J,GAGlB6kB,EAAOtlJ,UAAUy2N,WACjBnxE,EAAOtlJ,UAAU02N,WAAa,SAAqB3gU,EAAOqxE,EAAQ8tP,UAChEn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GAAUH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQ,EAAG,IAAM,GACtDi7B,KAAKj7B,GAAmB,IAARrxE,EACTqxE,EAAS,GAGlBk+K,EAAOtlJ,UAAU22N,cACjBrxE,EAAOtlJ,UAAU42N,cAAgB,SAAwB7gU,EAAOqxE,EAAQ8tP,UACtEn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GAAUH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQ,EAAG,MAAQ,GACxDi7B,KAAKj7B,GAAmB,IAARrxE,EAChBssG,KAAKj7B,EAAS,GAAMrxE,IAAU,EACvBqxE,EAAS,GAGlBk+K,EAAOtlJ,UAAU62N,cACjBvxE,EAAOtlJ,UAAU82N,cAAgB,SAAwB/gU,EAAOqxE,EAAQ8tP,UACtEn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GAAUH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQ,EAAG,MAAQ,GACxDi7B,KAAKj7B,GAAWrxE,IAAU,EAC1BssG,KAAKj7B,EAAS,GAAc,IAARrxE,EACbqxE,EAAS,GAGlBk+K,EAAOtlJ,UAAU+2N,cACjBzxE,EAAOtlJ,UAAUg3N,cAAgB,SAAwBjhU,EAAOqxE,EAAQ8tP,UACtEn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GAAUH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQ,EAAG,WAAY,GAC5Di7B,KAAKj7B,EAAS,GAAMrxE,IAAU,GAC9BssG,KAAKj7B,EAAS,GAAMrxE,IAAU,GAC9BssG,KAAKj7B,EAAS,GAAMrxE,IAAU,EAC9BssG,KAAKj7B,GAAmB,IAARrxE,EACTqxE,EAAS,GAGlBk+K,EAAOtlJ,UAAUi3N,cACjB3xE,EAAOtlJ,UAAUk3N,cAAgB,SAAwBnhU,EAAOqxE,EAAQ8tP,UACtEn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GAAUH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQ,EAAG,WAAY,GAC5Di7B,KAAKj7B,GAAWrxE,IAAU,GAC1BssG,KAAKj7B,EAAS,GAAMrxE,IAAU,GAC9BssG,KAAKj7B,EAAS,GAAMrxE,IAAU,EAC9BssG,KAAKj7B,EAAS,GAAc,IAARrxE,EACbqxE,EAAS,GAGlBk+K,EAAOtlJ,UAAUm3N,WAAa,SAAqBphU,EAAOqxE,EAAQq5J,EAAYy0F,MAC5En/T,GAASA,EACTqxE,KAAoB,GACf8tP,EAAAA,KACCkC,EAAQnvP,KAAKy5J,IAAI,EAAI,EAAIjB,EAAc,GAE3Cs0F,EAAS1yN,KAAMtsG,EAAOqxE,EAAQq5J,EAAY22F,EAAQ,GAAIA,OAGpD5tP,EAAI,EACJyoN,EAAM,EACNt+J,EAAM,MACVtxB,KAAKj7B,GAAkB,IAARrxE,IACNyzE,EAAIi3J,IAAewxD,GAAO,MAC7Bl8R,EAAQ,GAAa,IAAR49H,GAAsC,IAAzBtxB,KAAKj7B,EAASoC,EAAI,KAC9CmqD,EAAM,GAERtxB,KAAKj7B,EAASoC,IAAOzzE,EAAQk8R,GAAQ,GAAKt+J,EAAM,WAG3CvsD,EAASq5J,GAGlB6kB,EAAOtlJ,UAAUq3N,WAAa,SAAqBthU,EAAOqxE,EAAQq5J,EAAYy0F,MAC5En/T,GAASA,EACTqxE,KAAoB,GACf8tP,EAAAA,KACCkC,EAAQnvP,KAAKy5J,IAAI,EAAI,EAAIjB,EAAc,GAE3Cs0F,EAAS1yN,KAAMtsG,EAAOqxE,EAAQq5J,EAAY22F,EAAQ,GAAIA,OAGpD5tP,EAAIi3J,EAAa,EACjBwxD,EAAM,EACNt+J,EAAM,MACVtxB,KAAKj7B,EAASoC,GAAa,IAARzzE,IACVyzE,GAAK,IAAMyoN,GAAO,MACrBl8R,EAAQ,GAAa,IAAR49H,GAAsC,IAAzBtxB,KAAKj7B,EAASoC,EAAI,KAC9CmqD,EAAM,GAERtxB,KAAKj7B,EAASoC,IAAOzzE,EAAQk8R,GAAQ,GAAKt+J,EAAM,WAG3CvsD,EAASq5J,GAGlB6kB,EAAOtlJ,UAAUs3N,UAAY,SAAoBvhU,EAAOqxE,EAAQ8tP,UAC9Dn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GAAUH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQ,EAAG,KAAO,KACnDrxE,EAAQ,IAAGA,EAAQ,IAAOA,EAAQ,GACtCssG,KAAKj7B,GAAmB,IAARrxE,EACTqxE,EAAS,GAGlBk+K,EAAOtlJ,UAAUu3N,aAAe,SAAuBxhU,EAAOqxE,EAAQ8tP,UACpEn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GAAUH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQ,EAAG,OAAS,OACzDi7B,KAAKj7B,GAAmB,IAARrxE,EAChBssG,KAAKj7B,EAAS,GAAMrxE,IAAU,EACvBqxE,EAAS,GAGlBk+K,EAAOtlJ,UAAUw3N,aAAe,SAAuBzhU,EAAOqxE,EAAQ8tP,UACpEn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GAAUH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQ,EAAG,OAAS,OACzDi7B,KAAKj7B,GAAWrxE,IAAU,EAC1BssG,KAAKj7B,EAAS,GAAc,IAARrxE,EACbqxE,EAAS,GAGlBk+K,EAAOtlJ,UAAUy3N,aAAe,SAAuB1hU,EAAOqxE,EAAQ8tP,UACpEn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GAAUH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQ,EAAG,YAAa,YAC7Di7B,KAAKj7B,GAAmB,IAARrxE,EAChBssG,KAAKj7B,EAAS,GAAMrxE,IAAU,EAC9BssG,KAAKj7B,EAAS,GAAMrxE,IAAU,GAC9BssG,KAAKj7B,EAAS,GAAMrxE,IAAU,GACvBqxE,EAAS,GAGlBk+K,EAAOtlJ,UAAU03N,aAAe,SAAuB3hU,EAAOqxE,EAAQ8tP,UACpEn/T,GAASA,EACTqxE,KAAoB,EACf8tP,GAAUH,EAAS1yN,KAAMtsG,EAAOqxE,EAAQ,EAAG,YAAa,YACzDrxE,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GAC5CssG,KAAKj7B,GAAWrxE,IAAU,GAC1BssG,KAAKj7B,EAAS,GAAMrxE,IAAU,GAC9BssG,KAAKj7B,EAAS,GAAMrxE,IAAU,EAC9BssG,KAAKj7B,EAAS,GAAc,IAARrxE,EACbqxE,EAAS,GAkBlBk+K,EAAOtlJ,UAAU4mJ,aAAe,SAAuB7wP,EAAOqxE,EAAQ8tP,UAC7DD,EAAW5yN,KAAMtsG,EAAOqxE,GAAQ,EAAM8tP,IAG/C5vE,EAAOtlJ,UAAUsqJ,aAAe,SAAuBv0P,EAAOqxE,EAAQ8tP,UAC7DD,EAAW5yN,KAAMtsG,EAAOqxE,GAAQ,EAAO8tP,IAahD5vE,EAAOtlJ,UAAU8mJ,cAAgB,SAAwB/wP,EAAOqxE,EAAQ8tP,UAC/DC,EAAY9yN,KAAMtsG,EAAOqxE,GAAQ,EAAM8tP,IAGhD5vE,EAAOtlJ,UAAU4rJ,cAAgB,SAAwB71P,EAAOqxE,EAAQ8tP,UAC/DC,EAAY9yN,KAAMtsG,EAAOqxE,GAAQ,EAAO8tP,IAIjD5vE,EAAOtlJ,UAAU1gG,KAAO,SAAemuK,EAAQkqJ,EAAatgP,EAAOhQ,OAC5Di+K,EAAO8H,SAAS3/E,GAAAA,MAAAA,IAAmBrmE,UAAU,kCAC7C/vB,IAAOA,EAAQ,GACfhQ,GAAe,IAARA,IAAWA,EAAMg7B,KAAK/6B,QAC9BqwP,GAAelqJ,EAAOnmG,SAAQqwP,EAAclqJ,EAAOnmG,QAClDqwP,IAAaA,EAAc,GAC5BtwP,EAAM,GAAKA,EAAMgQ,IAAOhQ,EAAMgQ,GAG9BhQ,IAAQgQ,EAAAA,OAAc,KACJ,IAAlBo2F,EAAOnmG,QAAgC,IAAhB+6B,KAAK/6B,OAAW,OAAU,KAGjDqwP,EAAc,YACN/1F,WAAW,gCAEnBvqJ,EAAQ,GAAKA,GAASgrB,KAAK/6B,OAAAA,MAAAA,IAAkBs6J,WAAW,yBACxDv6J,EAAM,EAAA,MAAA,IAAau6J,WAAW,2BAG9Bv6J,EAAMg7B,KAAK/6B,SAAQD,EAAMg7B,KAAK/6B,QAC9BmmG,EAAOnmG,OAASqwP,EAActwP,EAAMgQ,IACtChQ,EAAMomG,EAAOnmG,OAASqwP,EAActgP,OAGlCouB,EAAMp+B,EAAMgQ,SAEZgrB,OAASorE,GAAqD,mBAApCqtD,WAAW96H,UAAU43N,WAEjDv1N,KAAKu1N,WAAWD,EAAatgP,EAAOhQ,GAEpCyzJ,WAAW96H,UAAUlc,IAAImc,KACvBwtE,EACAprE,KAAKm8H,SAASnnJ,EAAOhQ,GACrBswP,GAIGlyN,GAOT6/I,EAAOtlJ,UAAU6zL,KAAO,SAAe73L,EAAK3kB,EAAOhQ,EAAKu3J,MAEnC,iBAAR5iI,EAAQ,IACI,iBAAV3kB,GACTunJ,EAAWvnJ,EACXA,EAAQ,EACRhQ,EAAMg7B,KAAK/6B,QACa,iBAARD,IAChBu3J,EAAWv3J,EACXA,EAAMg7B,KAAK/6B,aAEIvvE,IAAb6mO,GAA8C,iBAAbA,YACzBx3H,UAAU,gCAEE,iBAAbw3H,IAA0B0mB,EAAOqrE,WAAW/xF,aAC3Cx3H,UAAU,qBAAuBw3H,MAE1B,IAAf5iI,EAAI10B,OAAW,KACb5vE,EAAOskG,EAAI1hB,WAAW,IACR,SAAbskJ,GAAuBlnO,EAAO,KAClB,WAAbknO,KAEF5iI,EAAMtkG,QAGc,iBAARskG,EAChBA,GAAY,IACY,kBAARA,IAChBA,EAAMxzB,OAAOwzB,OAIX3kB,EAAQ,GAAKgrB,KAAK/6B,OAAS+P,GAASgrB,KAAK/6B,OAASD,YAC1Cu6J,WAAW,yBAGnBv6J,GAAOgQ,SACFgrB,SAQL74B,KALJ6N,KAAkB,EAClBhQ,OAActvE,IAARsvE,EAAoBg7B,KAAK/6B,OAASD,IAAQ,EAE3C20B,IAAKA,EAAM,GAGG,iBAARA,MACJxyB,EAAI6N,EAAO7N,EAAInC,IAAOmC,EACzB64B,KAAK74B,GAAKwyB,WAGRg/H,EAAQsqB,EAAO8H,SAASpxJ,GACxBA,EACAspJ,EAAOx5F,KAAK9vD,EAAK4iI,GACjBn5H,EAAMu1H,EAAM1zJ,UACJ,IAARm+B,YACQ2B,UAAU,cAAgBpL,EAClC,yCAECxyB,EAAI,EAAGA,EAAInC,EAAMgQ,IAAS7N,EAC7B64B,KAAK74B,EAAI6N,GAAS2jJ,EAAMxxJ,EAAIi8B,UAIzBpD,UAMLw1N,EAAoB,oBAgBxB,SAAApG,EAAsBzzN,EAAQ+0N,OAExBQ,EADJR,EAAQA,GAASrkN,EAAAA,UAEbpnC,EAAS02B,EAAO12B,OAChBwwP,EAAgB,KAChB98F,EAAAA,GAEKxxJ,EAAI,EAAGA,EAAIlC,IAAUkC,EAAAA,KAC5B+pP,EAAYv1N,EAAO1jB,WAAW9Q,IAGd,OAAU+pP,EAAY,MAAA,KAE/BuE,EAAAA,IAECvE,EAAY,MAAA,EAETR,GAAS,IAAM,GAAG/3F,EAAM7tJ,KAAK,IAAM,IAAM,iBAErC3D,EAAI,IAAMlC,EAAAA,EAEdyrP,GAAS,IAAM,GAAG/3F,EAAM7tJ,KAAK,IAAM,IAAM,cAKhD2qP,EAAgBvE,cAMdA,EAAY,MAAA,EACTR,GAAS,IAAM,GAAG/3F,EAAM7tJ,KAAK,IAAM,IAAM,KAC9C2qP,EAAgBvE,WAKlBA,EAAkE,OAArDuE,EAAgB,OAAU,GAAKvE,EAAY,YAC/CuE,IAEJ/E,GAAS,IAAM,GAAG/3F,EAAM7tJ,KAAK,IAAM,IAAM,QAGhD2qP,EAAgB,KAGZvE,EAAY,IAAA,KACTR,GAAS,GAAK,EAAA,MACnB/3F,EAAM7tJ,KAAKomP,WACFA,EAAY,KAAA,KAChBR,GAAS,GAAK,EAAA,MACnB/3F,EAAM7tJ,KACJomP,GAAa,EAAM,IACP,GAAZA,EAAmB,aAEZA,EAAY,MAAA,KAChBR,GAAS,GAAK,EAAA,MACnB/3F,EAAM7tJ,KACJomP,GAAa,GAAM,IACnBA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,eAEZA,EAAY,mBASXp4N,MAAM,0BARX43N,GAAS,GAAK,EAAA,MACnB/3F,EAAM7tJ,KACJomP,GAAa,GAAO,IACpBA,GAAa,GAAM,GAAO,IAC1BA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,aAOlBv4F,EA4BT,SAAA02F,EAAwB75N,UACfqO,EAAO24K,YAxHhB,SAAsBhnL,OAIpBA,GAFAA,EAAMA,EAAI1V,MAAM,KAAK,IAEXtI,OAAO0B,QAAQs8O,EAAmB,KAEpCvwP,OAAS,EAAA,MAAU,QAEpBuwB,EAAIvwB,OAAS,GAAM,GACxBuwB,GAAY,WAEPA,EA6GmBkgO,CAAYlgO,IAGxC,SAAA46N,EAAqBn0N,EAAK8oJ,EAAKhgL,EAAQE,WAC5BkC,EAAI,EAAGA,EAAIlC,KACbkC,EAAIpC,GAAUggL,EAAI9/K,QAAYkC,GAAK80B,EAAIh3B,UADhBkC,EAE5B49K,EAAI59K,EAAIpC,GAAUk3B,EAAI90B,UAEjBA,EAMT,SAAAsnP,EAAqB5vN,EAAK/3B,UACjB+3B,aAAe/3B,GACZ,MAAP+3B,GAAkC,MAAnBA,EAAI8N,aAA+C,MAAxB9N,EAAI8N,YAAY95G,MACzDgsG,EAAI8N,YAAY95G,OAASi0E,EAAKj0E,KAEpC,SAAAk8T,EAAsBlwN,UAEbA,GAAQA,MAKb2zN,EAAAA,mBACE9zF,EAAW,mBACX89B,EAAAA,IAAY3+J,MAAM,KACb12B,EAAI,EAAGA,EAAI,KAAMA,UACpBwuP,EAAU,GAAJxuP,EACDmqB,EAAI,EAAGA,EAAI,KAAMA,EACxBkrK,EAAMm5D,EAAMrkO,GAAKotI,EAASv3J,GAAKu3J,EAASptI,UAGrCkrK,EATLg2D,oEC9wDJ,aAEAl/T,EAAA8qO,WAuCA,SAAAipB,GACA,IAAAuuE,EAAAC,EAAAxuE,GACAyuE,EAAAF,EAAA,GACAG,EAAAH,EAAA,GACA,OAAA,GAAAE,EAAAC,GAAA,EAAAA,GA1CAziU,EAAAkpR,YAiDA,SAAAn1B,GACA,IAAAjsJ,EAcAj0B,EAbAyuP,EAAAC,EAAAxuE,GACAyuE,EAAAF,EAAA,GACAG,EAAAH,EAAA,GAEAh5N,EAAA,IAAAo5N,EAVA,SAAA3uE,EAAAyuE,EAAAC,GACA,OAAA,GAAAD,EAAAC,GAAA,EAAAA,EASAE,CAAA5uE,EAAAyuE,EAAAC,IAEAG,EAAA,EAGA9yN,EAAA2yN,EAAA,EACAD,EAAA,EACAA,EAGA,IAAA3uP,EAAA,EAAAA,EAAAi8B,EAAAj8B,GAAA,EACAi0B,EACA+6N,EAAA9uE,EAAApvK,WAAA9Q,KAAA,GACAgvP,EAAA9uE,EAAApvK,WAAA9Q,EAAA,KAAA,GACAgvP,EAAA9uE,EAAApvK,WAAA9Q,EAAA,KAAA,EACAgvP,EAAA9uE,EAAApvK,WAAA9Q,EAAA,IACAy1B,EAAAs5N,KAAA96N,GAAA,GAAA,IACAwB,EAAAs5N,KAAA96N,GAAA,EAAA,IACAwB,EAAAs5N,KAAA,IAAA96N,EAGA,IAAA26N,IACA36N,EACA+6N,EAAA9uE,EAAApvK,WAAA9Q,KAAA,EACAgvP,EAAA9uE,EAAApvK,WAAA9Q,EAAA,KAAA,EACAy1B,EAAAs5N,KAAA,IAAA96N,GAGA,IAAA26N,IACA36N,EACA+6N,EAAA9uE,EAAApvK,WAAA9Q,KAAA,GACAgvP,EAAA9uE,EAAApvK,WAAA9Q,EAAA,KAAA,EACAgvP,EAAA9uE,EAAApvK,WAAA9Q,EAAA,KAAA,EACAy1B,EAAAs5N,KAAA96N,GAAA,EAAA,IACAwB,EAAAs5N,KAAA,IAAA96N,GAGA,OAAAwB,GA3FAtpG,EAAAs9T,cAkHA,SAAAwF,GAQA,IAPA,IAAAh7N,EACAgI,EAAAgzN,EAAAnxP,OACAsiP,EAAAnkN,EAAA,EACA6C,EAAA,GACAowN,EAAA,MAGAlvP,EAAA,EAAAmvP,EAAAlzN,EAAAmkN,EAAApgP,EAAAmvP,EAAAnvP,GAAAkvP,EACApwN,EAAAn7B,KAAAyrP,EAAAH,EAAAjvP,EAAAA,EAAAkvP,EAAAC,EAAAA,EAAAnvP,EAAAkvP,IAIA,IAAA9O,GACAnsN,EAAAg7N,EAAAhzN,EAAA,GACA6C,EAAAn7B,KACA0rP,EAAAp7N,GAAA,GACAo7N,EAAAp7N,GAAA,EAAA,IACA,OAEA,IAAAmsN,IACAnsN,GAAAg7N,EAAAhzN,EAAA,IAAA,GAAAgzN,EAAAhzN,EAAA,GACA6C,EAAAn7B,KACA0rP,EAAAp7N,GAAA,IACAo7N,EAAAp7N,GAAA,EAAA,IACAo7N,EAAAp7N,GAAA,EAAA,IACA,MAIA,OAAA6K,EAAA37B,KAAA,KAzIA,IALA,IAAAksP,EAAA,GACAL,EAAA,GACAH,EAAA,oBAAAv9F,WAAAA,WAAA56H,MAEAxoG,EAAA,mEACA8xE,EAAA,EAAAi8B,EAAA/tG,EAAA4vE,OAAAkC,EAAAi8B,IAAAj8B,EACAqvP,EAAArvP,GAAA9xE,EAAA8xE,GACAgvP,EAAA9gU,EAAA4iF,WAAA9Q,IAAAA,EAQA,SAAA0uP,EAAAxuE,GACA,IAAAjkJ,EAAAikJ,EAAApiL,OAEA,GAAAm+B,EAAA,EAAA,EACA,MAAA,IAAAtK,MAAA,kDAKA,IAAAg9N,EAAAzuE,EAAA77K,QAAA,KAOA,OANA,IAAAsqP,IAAAA,EAAA1yN,GAMA,CAAA0yN,EAJAA,IAAA1yN,EACA,EACA,EAAA0yN,EAAA,GAsEA,SAAAS,EAAAH,EAAAphP,EAAAhQ,GAGA,IAFA,IAAAo2B,EARAsW,EASAotH,EAAA,GACA33J,EAAA6N,EAAA7N,EAAAnC,EAAAmC,GAAA,EACAi0B,GACAg7N,EAAAjvP,IAAA,GAAA,WACAivP,EAAAjvP,EAAA,IAAA,EAAA,QACA,IAAAivP,EAAAjvP,EAAA,IACA23J,EAAAh0J,KAdA0rP,GADA9kN,EAeAtW,IAdA,GAAA,IACAo7N,EAAA9kN,GAAA,GAAA,IACA8kN,EAAA9kN,GAAA,EAAA,IACA8kN,EAAA,GAAA9kN,IAaA,OAAAotH,EAAAx0J,KAAA,IAjGA6rP,EAAA,IAAAl+O,WAAA,IAAA,GACAk+O,EAAA,IAAAl+O,WAAA,IAAA;A;AClBA3kF,EAAA09N,KAAA,SAAAnhB,EAAA9qI,EAAA0xP,EAAAC,EAAAC,GACA,IAAA5iU,EAAAmrF,EACA03O,EAAA,EAAAD,EAAAD,EAAA,EACAG,GAAA,GAAAD,GAAA,EACAE,EAAAD,GAAA,EACAE,GAAA,EACA5vP,EAAAsvP,EAAAE,EAAA,EAAA,EACA/4L,EAAA64L,GAAA,EAAA,EACAv6O,EAAA2zH,EAAA9qI,EAAAoC,GAOA,IALAA,GAAAy2D,EAEA7pI,EAAAmoF,GAAA,IAAA66O,GAAA,EACA76O,KAAA66O,EACAA,GAAAH,EACAG,EAAA,EAAAhjU,EAAA,IAAAA,EAAA87M,EAAA9qI,EAAAoC,GAAAA,GAAAy2D,EAAAm5L,GAAA,GAKA,IAHA73O,EAAAnrF,GAAA,IAAAgjU,GAAA,EACAhjU,KAAAgjU,EACAA,GAAAL,EACAK,EAAA,EAAA73O,EAAA,IAAAA,EAAA2wH,EAAA9qI,EAAAoC,GAAAA,GAAAy2D,EAAAm5L,GAAA,GAEA,GAAA,IAAAhjU,EACAA,EAAA,EAAA+iU,MACA,CAAA,GAAA/iU,IAAA8iU,EACA,OAAA33O,EAAA0pK,IAAAv8I,EAAAA,GAAAnwB,GAAA,EAAA,GAEAgD,GAAAtZ,KAAAy5J,IAAA,EAAAq3F,GACA3iU,GAAA+iU,EAEA,OAAA56O,GAAA,EAAA,GAAAgD,EAAAtZ,KAAAy5J,IAAA,EAAAtrO,EAAA2iU,IAGApjU,EAAAqxP,MAAA,SAAA90C,EAAAn8M,EAAAqxE,EAAA0xP,EAAAC,EAAAC,GACA,IAAA5iU,EAAAmrF,EAAAzS,EACAmqP,EAAA,EAAAD,EAAAD,EAAA,EACAG,GAAA,GAAAD,GAAA,EACAE,EAAAD,GAAA,EACAG,EAAA,KAAAN,EAAA9wP,KAAAy5J,IAAA,GAAA,IAAAz5J,KAAAy5J,IAAA,GAAA,IAAA,EACAl4J,EAAAsvP,EAAA,EAAAE,EAAA,EACA/4L,EAAA64L,EAAA,GAAA,EACAv6O,EAAAxoF,EAAA,GAAA,IAAAA,GAAA,EAAAA,EAAA,EAAA,EAAA,EAmCA,IAjCAA,EAAAkyE,KAAAu0L,IAAAzmQ,GAEAwrG,MAAAxrG,IAAAA,IAAA24G,EAAAA,GACAntB,EAAAggB,MAAAxrG,GAAA,EAAA,EACAK,EAAA8iU,IAEA9iU,EAAA6xE,KAAA6nC,MAAA7nC,KAAAymJ,IAAA34N,GAAAkyE,KAAA2iL,KACA70P,GAAA+4E,EAAA7G,KAAAy5J,IAAA,GAAAtrO,IAAA,IACAA,IACA04E,GAAA,IAGA/4E,GADAK,EAAA+iU,GAAA,EACAE,EAAAvqP,EAEAuqP,EAAApxP,KAAAy5J,IAAA,EAAA,EAAAy3F,IAEArqP,GAAA,IACA14E,IACA04E,GAAA,GAGA14E,EAAA+iU,GAAAD,GACA33O,EAAA,EACAnrF,EAAA8iU,GACA9iU,EAAA+iU,GAAA,GACA53O,GAAAxrF,EAAA+4E,EAAA,GAAA7G,KAAAy5J,IAAA,EAAAq3F,GACA3iU,GAAA+iU,IAEA53O,EAAAxrF,EAAAkyE,KAAAy5J,IAAA,EAAAy3F,EAAA,GAAAlxP,KAAAy5J,IAAA,EAAAq3F,GACA3iU,EAAA,IAIA2iU,GAAA,EAAA7mH,EAAA9qI,EAAAoC,GAAA,IAAA+X,EAAA/X,GAAAy2D,EAAA1+C,GAAA,IAAAw3O,GAAA,GAIA,IAFA3iU,EAAAA,GAAA2iU,EAAAx3O,EACA03O,GAAAF,EACAE,EAAA,EAAA/mH,EAAA9qI,EAAAoC,GAAA,IAAApzE,EAAAozE,GAAAy2D,EAAA7pI,GAAA,IAAA6iU,GAAA,GAEA/mH,EAAA9qI,EAAAoC,EAAAy2D,IAAA,IAAA1hD,iCC/EA,IAAA0jB,EAAArsG,EAAA,UAKA,SAAA0jU,EAAAnyJ,EAAA39F,GACA,OAAA29F,EAAA39F,GAAA29F,EAAA39F,EAAA,IAAA,EAAA29F,EAAA39F,EAAA,IAAA,GAAA29F,EAAA39F,EAAA,IAAA,GAIA,SAAA+vP,EAAArwP,EAAAyS,EAAA7M,EAAAmxD,EAAAhwB,EAAAC,GACAi3D,EAAAj+F,GAAAi+F,EAAAj+F,GAAAi+F,EAAAxrF,GAAAs0B,EACAk3D,EAAAlnC,GAAAu5L,EAAAryJ,EAAAlnC,GAAAknC,EAAAj+F,GAAA,IACAi+F,EAAAr4F,GAAAq4F,EAAAr4F,GAAAq4F,EAAAlnC,GACAknC,EAAAxrF,GAAA69O,EAAAryJ,EAAAxrF,GAAAwrF,EAAAr4F,GAAA,IACAq4F,EAAAj+F,GAAAi+F,EAAAj+F,GAAAi+F,EAAAxrF,GAAAu0B,EACAi3D,EAAAlnC,GAAAu5L,EAAAryJ,EAAAlnC,GAAAknC,EAAAj+F,GAAA,GACAi+F,EAAAr4F,GAAAq4F,EAAAr4F,GAAAq4F,EAAAlnC,GACAknC,EAAAxrF,GAAA69O,EAAAryJ,EAAAxrF,GAAAwrF,EAAAr4F,GAAA,GAMA,SAAA0qP,EAAAvpN,EAAAC,GACA,OAAAD,IAAAC,EAAAD,GAAA,GAAAC,EAIA,IAAAupN,EAAA,IAAA1oD,YAAA,CACA,WAAA,WAAA,WAAA,WACA,WAAA,WAAA,UAAA,aAEA2oD,EAAA,IAAA5+F,WAAA,CACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GACA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EACA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EACA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EACA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAGA3zD,EAAA,IAAA4pG,YAAA,IACAxvL,EAAA,IAAAwvL,YAAA,IACA,SAAA4oD,EAAAr9I,EAAAl+F,GACA,IAAA5U,EAAA,EACA,IAAAA,EAAA,EAAAA,EAAA,EAAAA,IACA29F,EAAA39F,GAAA8yG,EAAAxS,EAAAtgG,GACA29F,EAAA39F,EAAA,GAAAiwP,EAAAjwP,GASA,IANA29F,EAAA,KAAAmV,EAAAl7B,EACA+lB,EAAA,KAAAmV,EAAAl7B,EAAA,WACAhjE,IACA+oF,EAAA,KAAAA,EAAA,KAGA39F,EAAA,EAAAA,EAAA,GAAAA,IACA+X,EAAA/X,GAAA8vP,EAAAh9I,EAAA3gG,EAAA,EAAAnS,GAOA,IAAAA,EAAA,EAAAA,EAAA,GAAAA,IAEA+vP,EAAA,EAAA,EAAA,EAAA,GAAAh4O,EAAAm4O,EAAA,GAAAlwP,EAAA,IAAA+X,EAAAm4O,EAAA,GAAAlwP,EAAA,KACA+vP,EAAA,EAAA,EAAA,EAAA,GAAAh4O,EAAAm4O,EAAA,GAAAlwP,EAAA,IAAA+X,EAAAm4O,EAAA,GAAAlwP,EAAA,KACA+vP,EAAA,EAAA,EAAA,GAAA,GAAAh4O,EAAAm4O,EAAA,GAAAlwP,EAAA,IAAA+X,EAAAm4O,EAAA,GAAAlwP,EAAA,KACA+vP,EAAA,EAAA,EAAA,GAAA,GAAAh4O,EAAAm4O,EAAA,GAAAlwP,EAAA,IAAA+X,EAAAm4O,EAAA,GAAAlwP,EAAA,KACA+vP,EAAA,EAAA,EAAA,GAAA,GAAAh4O,EAAAm4O,EAAA,GAAAlwP,EAAA,IAAA+X,EAAAm4O,EAAA,GAAAlwP,EAAA,KACA+vP,EAAA,EAAA,EAAA,GAAA,GAAAh4O,EAAAm4O,EAAA,GAAAlwP,EAAA,KAAA+X,EAAAm4O,EAAA,GAAAlwP,EAAA,MACA+vP,EAAA,EAAA,EAAA,EAAA,GAAAh4O,EAAAm4O,EAAA,GAAAlwP,EAAA,KAAA+X,EAAAm4O,EAAA,GAAAlwP,EAAA,MACA+vP,EAAA,EAAA,EAAA,EAAA,GAAAh4O,EAAAm4O,EAAA,GAAAlwP,EAAA,KAAA+X,EAAAm4O,EAAA,GAAAlwP,EAAA,MAIA,IAAAA,EAAA,EAAAA,EAAA,EAAAA,IACA8yG,EAAAxS,EAAAtgG,IAAA29F,EAAA39F,GAAA29F,EAAA39F,EAAA,GAQA,SAAA2kP,EAAAuB,EAAAr4T,GACA,KAAAq4T,EAAA,GAAAA,GAAA,IACA,MAAA,IAAAv0N,MAAA,iDAEA,IAAAuxK,EAAAr1Q,EAAAA,EAAAiwE,OAAA,EACA,GAAAjwE,KAAAq1Q,EAAA,GAAAA,GAAA,IACA,MAAA,IAAAvxK,MAAA,8CAGA,IAAAmhF,EAAA,CACAxS,EAAA,IAAAinG,YAAA0oD,GACA99O,EAAA,IAAAo1L,YAAA,IACAjiM,EAAA,EACAsyE,EAAA,EACAsuK,OAAAA,GASA,OAPApzI,EAAAxS,EAAA,IAAA,SAAA4iG,GAAA,EAAAgjD,EAEAhjD,EAAA,IACA0hD,EAAA9xI,EAAAjlL,GACAilL,EAAAxtG,EAAA,IAGAwtG,EAKA,SAAA8xI,EAAA9xI,EAAAjrF,GACA,IAAA,IAAA7nB,EAAA,EAAAA,EAAA6nB,EAAA/pB,OAAAkC,IACA,KAAA8yG,EAAAxtG,IACAwtG,EAAAl7B,GAAAk7B,EAAAxtG,EACA6qP,EAAAr9I,GAAA,GACAA,EAAAxtG,EAAA,GAEAwtG,EAAA3gG,EAAA2gG,EAAAxtG,KAAAuiB,EAAA7nB,GAMA,SAAA6kP,EAAA/xI,GAEA,IADAA,EAAAl7B,GAAAk7B,EAAAxtG,EACAwtG,EAAAxtG,EAAA,IACAwtG,EAAA3gG,EAAA2gG,EAAAxtG,KAAA,EAEA6qP,EAAAr9I,GAAA,GAIA,IADA,IAAAl5C,EAAA,IAAA03F,WAAAx+C,EAAAozI,QACAlmP,EAAA,EAAAA,EAAA8yG,EAAAozI,OAAAlmP,IACA45D,EAAA55D,GAAA8yG,EAAAxS,EAAAtgG,GAAA,IAAA,GAAA,EAAAA,GAAA,IAEA,OAAA45D,EAWA,SAAA8qL,EAAA78N,EAAAh6F,EAAAq4T,GAEAA,EAAAA,GAAA,GACAr+N,EAAA4Q,EAAA0tN,eAAAt+N,GAGA,IAAAirF,EAAA6xI,EAAAuB,EAAAr4T,GAEA,OADA+2T,EAAA9xI,EAAAjrF,GACAg9N,EAAA/xI,GAgBA5mL,EAAAC,QAAA,CACAu4T,QAAAA,EACAS,WAPA,SAAAt9N,EAAAh6F,EAAAq4T,GACA,IAAAvuF,EAAA+sF,EAAA78N,EAAAh6F,EAAAq4T,GACA,OAAAztN,EAAAw1J,MAAAt2B,IAMAgtF,YAAAA,EACAC,cAAAA,EACAC,aAAAA,iDC5LA,aAEA,MAAAzhI,aAAAA,GAAAh3L,EAAA,aACAsgO,OAAAA,GAAAtgO,EAAA,sBACA84N,EAAA94N,EAAA,QAAAA,CAAA,QACAupT,EAAAvpT,EAAA,aACAgkU,QAAAA,GAAAhkU,EAAA,gBACAikU,OAAAA,GAAAjkU,EAAA,eACAkkU,EAAAlkU,EAAA,kCACAmkU,wBAAAA,GAAAnkU,EAAA,aACA6kO,EAAA7kO,EAAA,2BAEAokU,EAAApkU,EAAA,WACAqkU,EAAArkU,EAAA,UACAskU,EAAAtkU,EAAA,SACAukU,EAAAvkU,EAAA,eACAwkU,EAAAxkU,EAAA,aACAykU,EAAAzkU,EAAA,SACA0kU,EAAA1kU,EAAA,UACA2kU,EAAA3kU,EAAA,UACA4kU,EAAA5kU,EAAA,UACA6kU,EAAA7kU,EAAA,gBACA8kU,EAAA9kU,EAAA,aACA+kU,EAAA/kU,EAAA,eACAglU,EAAAhlU,EAAA,WACAilU,EAAAjlU,EAAA,UACAklU,EAAAllU,EAAA,aACAmlU,EAAAnlU,EAAA,QACAolU,EAAAplU,EAAA,YACAqlU,EAAArlU,EAAA,SACAslU,EAAAtlU,EAAA,qBACAulU,EAAAvlU,EAAA,cACAwlU,EAAAxlU,EAAA,kBACAylU,EAAAzlU,EAAA,WACA0lU,EAAA1lU,EAAA,SACA2lU,EAAA3lU,EAAA,YACA4lU,EAAA5lU,EAAA,UACA6lU,EAAA7lU,EAAA,WACA8lU,EAAA9lU,EAAA,sBACA+lU,EAAA/lU,EAAA,UACAgmU,EAAAhmU,EAAA,aACAimU,EAAAjmU,EAAA,aACAg4P,EAAAh4P,EAAA,oBACAkmU,EAAAlmU,EAAA,WACAmmU,EAAAnmU,EAAA,aACAomU,EAAApmU,EAAA,UACAqmU,EAAArmU,EAAA,SACAsmU,EAAAtmU,EAAA,YAQA,MAAAovT,EAOA9rT,aAAAijU,MAAAA,EAAAC,QAAAA,EAAAplU,QAAAA,IACA,MAAA+mO,OAAAA,EAAAs+F,KAAAA,EAAAC,SAAAA,GAAAF,EACAG,EAAA3uE,EAAAr3P,OAAAslU,GAEAW,EAAArB,EAAAnkU,EAAAwlU,SAEAC,EAAA,IAAAf,EAAAU,EAAAC,MACAK,EAAAf,EAAA,CAAAc,aAAAA,EAAAzlU,QAAAA,EAAA0lU,OAEAC,EAAAZ,EAAA,CACA/mU,KAAAqnU,EAAArnU,KACA4nU,UAAA5lU,EAAA4lU,YAEArhF,EAAA2+E,IACA2C,EAAA1C,EAAA,CAAAoC,QAAAA,IAGAO,EAAA,IAAAxC,EAAAtjU,GAEA9B,EAAA,IAAAqlU,EAAA,CACAh/E,IAAAA,EACAuhF,KAAAA,EACAJ,KAAAA,EACA3+F,OAAAA,EACA8+F,SAAAA,EACAP,SAAAA,EACAtlU,QAAAA,IAEAqxK,EAAA+xJ,EAAA,CAAAsC,KAAAA,EAAAxnU,KAAAA,IACA6nU,EAAA,IAAA7B,EAAA,CAAAmB,KAAAA,EAAAK,KAAAA,IACAM,EAAA,IAAA3C,EAAA,CAAAsC,OAAAA,EAAAI,WAAAA,EAAAL,KAAAA,IACA7sK,GAAA,IAAA+qK,EAAA,CAAA6B,aAAAA,EAAAD,QAAAA,EAAAG,OAAAA,EAAAI,WAAAA,EAAAC,IAAAA,IACAC,GAAA,IAAAhC,EAAA,CAAAyB,KAAAA,EAAAF,QAAAA,EAAAG,OAAAA,EAAAK,IAAAA,IACAxqI,GAAA38L,OAAAiqG,OAAA06N,EAAA,CAAAkC,KAAAA,EAAAr0J,QAAAA,EAAAm0J,QAAAA,IAAA,CACA3oL,MAAA4mL,EAAA,CAAA4B,KAAAD,EAAAC,UAEAh7O,IAAAA,GAAA67O,OAAAA,GAAAC,IAAAA,GAAAt5O,IAAAA,GAAAksI,GAAAA,IAAA,IAAA8qG,EAAA,CACA8B,OAAAA,EACAH,QAAAA,EACAQ,IAAAA,EACAntK,MAAAA,GACA6sK,KAAAA,EACA1lU,QAAAA,EAAAomU,eAGAC,GAAAhC,EAAA,CACAqB,KAAAA,EACA7sK,MAAAA,GACA4sK,aAAAA,EACAJ,KAAAA,EACAG,QAAAA,EACAxlU,QAAAA,IAGAsmU,GAAAlC,EAAA,CACAiC,MAAAA,GACAb,QAAAA,EACAxlU,QAAAA,EAAAwlU,UAGAn6N,KAAAm6N,QAAAA,EACAn6N,KAAAntG,KAAAA,EACAmtG,KAAAq6N,KAAAA,EACAr6N,KAAAy6N,KAAAA,EACAz6N,KAAA26N,IAAAA,EACA36N,KAAAgmE,QAAAA,EACAhmE,KAAAwtD,MAAAA,GACAxtD,KAAAmwF,KAAAA,GAEAnwF,KAAAhrB,MAAA2iP,EAAA,CACAuC,QAAAA,EACAx+F,OAAAA,EACAs+F,KAAAA,EACAI,aAAAA,EACAD,QAAAA,EACAM,KAAAA,EACAQ,WAAAA,GACAnB,MAAAA,EACAG,SAAAA,EACAtlU,QAAAA,IAGAqrG,KAAAugC,KAAAq3L,EAAA,CACAsC,QAAAA,EACAC,QAAAA,EACAc,WAAAA,GACAb,aAAAA,EACAK,KAAAA,EACAT,KAAAA,IAGAh6N,KAAAk7N,IAAAtB,EAAA,CAAAM,QAAAA,EAAAF,KAAAA,IACAh6N,KAAAm7N,OAAAtB,EAAA,CAAAK,QAAAA,EAAA3/O,OAAA5lF,EAAA4lF,SACAylB,KAAAk5I,IAAAA,EACAl5I,KAAAw6N,SAAAA,EACAx6N,KAAA/b,GAAAy0O,EAAA,CAAAwB,QAAAA,EAAAx+F,OAAAA,IACA17H,KAAA0D,QAAA+0N,EAAA,CAAAuB,KAAAA,IACAh6N,KAAAo7N,QAAA,IAAA/C,EAAA,CAAA6B,QAAAA,IACAl6N,KAAAq7N,UAAA,IAAA/C,EAAA,CAAA0B,KAAAA,IACAh6N,KAAAzlB,OAAAo+O,EAAA,CAAAqB,KAAAA,IACAh6N,KAAAs7N,KAAA3B,EAAA,CAAAO,QAAAA,IAEAl6N,KAAAhhB,IAAAA,GACAghB,KAAA66N,OAAAA,GACA76N,KAAA86N,IAAAA,GACA96N,KAAAxe,IAAAA,GACAwe,KAAA0tH,GAAAA,GAEA1tH,KAAA46N,IAAAA,GACA56N,KAAAg7N,MAAAA,GACAh7N,KAAAhrG,IAAA,IAAAikU,EAAA,CAAAgB,SAAAA,IACAj6N,KAAAk2B,OAAA,IAAAgjM,EAAA,CAAAmB,KAAAA,EAAAF,QAAAA,EAAAG,OAAAA,IACAt6N,KAAAg6N,KAAA,IAAAb,EAAA,CAAAmB,OAAAA,EAAAK,IAAAA,EAAAX,KAAAA,EAAA7pI,KAAAA,KACAnwF,KAAAu7N,MAAA,IAAAnC,EAAA,CAAAY,KAAAA,EAAAE,QAAAA,IACAl6N,KAAAw7N,MAAA,IAAA/B,EAAA,CAAAS,QAAAA,IAGA1mU,OAAAC,eAAAusG,KAAA,SAAA,CACAnpG,MACA,MAAA4kU,EAAAvB,EAAAwB,MACA,OAAAD,EAAAA,EAAAE,YAAAjmU,KAKA,MAAAkmU,GAAA,IAAA71J,QAAAw5B,OAAAu9G,EAAA,IAAAhkN,MAAA,mBAAA,wBAEAkH,KAAA67N,SAAAD,GACA57N,KAAA87N,KAAA,CACAC,KAAAH,GACAH,IAAAG,GACAI,IAAAJ,IAEA57N,KAAAqsH,IAAA,CACA9lH,MAAAq1N,GACAluG,GAAAkuG,GACA/iK,KAVAvlB,kBAAA,MAAAwpK,EAAA,IAAAhkN,MAAA,mBAAA,yBAYAkH,KAAA5sG,MAAAwoU,GASA/kU,aACA,MAAA,IAAA6gU,EAMA7gU,oBAAAlC,EAAA,IAEA,MAAAsnU,GADAtnU,EAAA41L,EAAA2xI,IAAAvnU,IACAqgI,MAAA,GAGA8kM,EAAAnlU,EAAAwnU,OAAA9vG,EAAA3xH,QAAA2xH,IACA0tG,QAAAR,EAAAvkP,MAAA8kP,EAAAnlU,GACA4lF,QAAAw/O,EAAAC,KAAAz/O,OAAA6hP,SAEA9wG,EAAA,IAAAq3F,EAAA,CACAoX,QAAAA,EACAD,MAAAA,EACAnlU,QAAA,IAAAA,EAAA4lF,OAAAA,KAOA,SAJA+wI,EAAA6uG,QAAAnlP,QAEAs2I,EAAAmvG,KAAA4B,aAAAtC,GAEAA,EAAAuC,QAAAL,EAAAM,UAAA,CAEA,MAAA5uG,QAAA6uG,EAAAlxG,GAEAe,EAAA,+BACAorG,EAAA,CAAAoD,OAAAvvG,EAAAuvG,OAAAf,MAAAA,IAEAztG,EAAA,oCACAf,EAAAmvG,KAAAgC,mBAAA1C,EAAAr+F,OAAAnD,QAAAH,EAAA,SAAAzK,MAOA,OAJA,IAAAh5N,EAAAqgF,aACAs2I,EAAAt2I,QAGAs2I,GAIAj4N,EAAAC,QAAAqvT,EAKA,MAAA6Z,EAAAlpL,MAAAg4E,IACA,MAAArkJ,EAAA,IAAAswP,EAAA,IAAAC,EAAA,CAAA1wP,KAAA,cAAA25M,WACA9yD,QAAArC,EAAAsvG,IAAAvpG,IAAApqJ,EAAA,CACAy8B,QAAA,EACAszH,OAAA,SACA0lG,QAAA,WACAvC,SAAA,IAKA,aAFA7uG,EAAAqvG,IAAA37O,IAAA2uI,GAEAA,GAMAuuG,EAAA,KAAA,CACAlnP,OAAA,EACA+lP,aAAA,GACAZ,QAAA,CACAwC,SAAA9oG,EACA+oG,UAAA,CACA,oCACA,oCACA,oCACA,u9BC5RA,aAEA,MAAAlhB,EAAAnoT,EAAA,WACAg7N,EAAAh7N,EAAA,QACAspU,EAAAtpU,EAAA,uBAAAspU,IACA/f,EAAAvpT,EAAA,YACAupU,EAAAvpU,EAAA,2CAEAg3L,EAAAh3L,EAAA,iBACAyyK,EAAAzyK,EAAA,4BAMAD,EAAAi3L,aAAAA,EAIAj3L,EAAAypU,cAAA,4EACAzpU,EAAA0pU,aAAA,IAAAH,EAAA,oBACAvpU,EAAA2pU,mBAAA,OACA3pU,EAAA4pU,cAAA,IAUA,MA2GAC,EAAAL,GAOAxpL,MAAA+hE,EAAA1zC,UAAA0zC,IAGA/hN,EAAA8pU,cArHAC,IACA,GAAA3hB,EAAA/tF,IAAA0vG,IAAA9uG,EAAAsM,MAAAwiG,GACA,MAAA,SAAA,IAAA9uG,EAAA8uG,KACA,GAAA3hB,EAAA/oT,KAAA0qU,GACA,OAAAA,EAEA,MAAAvgB,EAAA,IAAAhkN,MAAA,iBAAAukO,KArBA,iBAqIA/pU,EAAAgqU,iBAtGA3qU,GACAA,aAAA8lO,WACA,IAAAlK,EAAA57N,GAAAyrG,WAEAmwH,EAAAsM,MAAAloO,GACAA,EAAAyrG,YAEA,IAAAzrG,EAAA64E,QAAA,YACA74E,EAAAA,EAAAmpG,UAAA,SAAA72B,SAEA,MAAAtyE,EAAA4lG,OAAA5lG,EAAAsyE,OAAA,KACAtyE,EAAAA,EAAAmpG,UAAA,EAAAnpG,EAAAsyE,OAAA,IAEAtyE,GA0FAW,EAAAiqU,YAxEAjqL,eAAA+mL,EAAAvvG,EAAAn2N,EAAA,IACA,MAAAwlU,EAAA,OACAA,EAAA55L,KAAA,OACA45L,EAAAnlP,MAAA,OAEA,MAAA24I,IAAAA,SAAA3nD,EAAA,CAAAq0J,KAAAA,EAAAF,QAAAA,GAAAn0J,CAAA8kD,EAAA,CAAAqvG,SAAA,IAEA,OAAAxsG,GAkEAr6N,EAAAkqU,QAxDA,CAAA18N,EAAAnsG,EAAA,MACA,GAAA,SAAAmsG,EAAAh6B,MAAA,cAAAg6B,EAAAh6B,MAAA,QAAAg6B,EAAAh6B,KAEA,MAAA,IAAAgyB,MAAA,sBAAAgI,EAAAh6B,SAIA,MAAAg4J,EAAA,CACAnR,IAAA7sH,EAAA6sH,IACAh7N,KAAAmuG,EAAAnuG,KACAE,KAAAiuG,EAAAjuG,KACAolN,MAAAn3G,EAAAnuG,KAAAmtF,MAAA,KAAA7a,OACAg4B,KAAA6D,EAAA7D,KACAn2B,KAAA,QA2BA,MAxBA,cAAAg6B,EAAAh6B,OAEAg4J,EAAAh4J,KAAA,OAGA,SAAAg6B,EAAAh6B,OACAg4J,EAAA7hI,KAAA6D,EAAA28N,OAAAC,YAGA,SAAA58N,EAAAh6B,MAAA,cAAAg6B,EAAAh6B,OACAg4J,EAAApkJ,KAAAomB,EAAA28N,OAAA/iP,UAEAhlF,IAAAorG,EAAA28N,OAAAE,QACA7+F,EAAA6+F,MAAA78N,EAAA28N,OAAAE,QAIAhpU,EAAAipU,iBACA,SAAA98N,EAAAh6B,MAAA,QAAAg6B,EAAAh6B,OAEAg4J,EAAA/3J,QAAA+5B,EAAA/5B,YAIA+3J,GAiBAxrO,EAAAwpU,kBAAAA,EACAxpU,EAAA6pU,YAAAA,4NC3JA,aAeA,MAAAN,EAAAtpU,EAAA,SACAsqU,EAAAtqU,EAAA,YACAgtR,EAAAhtR,EAAA,WACA4xH,EAAA5xH,EAAA,YACAuqU,EAAAvqU,EAAA,aAEAF,EAAAC,QAAA,CACAupU,IAAAA,EACAgB,gBAAAA,EACAt9C,MAAAA,EACAp7J,OAAAA,EACA24M,QAAAA,4HC1BA,aAEA,MAAAC,OAAAA,GAAAxqU,EAAA,UAEA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BAEAijO,EAAAtgO,OAAAugP,IAAA,iCACAunF,EAAA,IACAC,GAAA,IAAAn1G,aAAAxlH,OAAA06N,GACAE,EAAAD,EAAA,GAkBA,MAAApB,EAKAhmU,YAAAqlF,EAAAiiP,GACA,GAAA,iBAAAjiP,EACA8jB,KAAAo+N,KAAAhmG,EAAAl8I,OACA,CAAA,KAAAA,aAAAu8I,YAGA,MAAA,IAAA3/H,MAAA,+CAFAkH,KAAAo+N,KAAAliP,EAaA,GARA,MAAAiiP,IACAA,GAAA,GAGAA,GACAn+N,KAAAm+N,QAGA,IAAAn+N,KAAAo+N,KAAAhgG,YAAAp+H,KAAAo+N,KAAA,KAAAF,EACA,MAAA,IAAAplO,MAAA,eAUAjiG,SAAA0lO,EAAA,QACA,OAAAlE,EAAAr4H,KAAAo+N,KAAA7hG,GAQA1lO,aACA,OAAAmpG,KAAAo+N,KAGA5nG,IAAAA,KACA,OAAA,EAQAh1I,IAAAtrF,OAAAspM,eACA,MAAA,OAAAx/F,KAAA5B,cAeAvnG,sBAAA6sF,GACA,OAAA,IAAAm5O,EAAAn5O,EAAApZ,KAAA0zP,IAcAnnU,gBACA,OAAA,IAAAgmU,EAAAkB,IAAA7kP,QAAA,KAAA,KAQAriF,QAKA,GAJAmpG,KAAAo+N,MAAA,IAAAp+N,KAAAo+N,KAAAhgG,aACAp+H,KAAAo+N,KAAAH,GAGAj+N,KAAAo+N,KAAA,KAAAF,EAAA,CACA,MAAAvlG,EAAA,IAAAF,WAAAz4H,KAAAo+N,KAAAhgG,WAAA,GACAzF,EAAA64D,KAAA0sC,EAAA,EAAA,GACAvlG,EAAAl3I,IAAAue,KAAAo+N,KAAA,GACAp+N,KAAAo+N,KAAAzlG,EAIA,KAAA34H,KAAAo+N,KAAAhgG,WAAA,GAAAp+H,KAAAo+N,KAAAp+N,KAAAo+N,KAAAhgG,WAAA,KAAA8/F,GACAl+N,KAAAo+N,KAAAp+N,KAAAo+N,KAAAjiG,SAAA,GAAA,GAUAtlO,KAAA7B,GACA,MAAA24I,EAAA3tC,KAAAtc,OACAkqD,EAAA54I,EAAA0uF,OAEA,IAAA,IAAAvc,EAAA,EAAAA,EAAAwmE,EAAA1oE,OAAAkC,IAAA,CACA,GAAAymE,EAAA3oE,OAAAkC,EAAA,EACA,OAAA,EAGA,MAAA6tH,EAAArnD,EAAAxmE,GACA+tH,EAAAtnD,EAAAzmE,GAEA,GAAA6tH,EAAAE,EACA,OAAA,EACA,GAAAF,EAAAE,EACA,OAAA,EAIA,OAAAvnD,EAAA1oE,OAAA2oE,EAAA3oE,OAcApuE,UACA,OAAAgmU,EAAAwB,eAAAr+N,KAAAtc,OAAAte,QAAA86I,WAQArpN,aACA,OAAAmpG,KAAAtc,OAaA7sF,gBACA,MAAA6vE,EAAAs5B,KAAAs+N,aACA,OAAA53P,EAAAA,EAAAzB,OAAA,GAcApuE,OACA,OAAAmpG,KAAA5B,WAAAte,MAAAk+O,GAAA54P,MAAA,GAcAvuE,OACA,OA6KA,SAAA6vE,GACA,MAAAu/B,EAAAv/B,EAAAoZ,MAAA,KACA,GAAAmmB,EAAAhhC,OAAA,EACA,MAAA,GAEA,OAAAghC,EAAA7gC,MAAA,GAAA,GAAAkF,KAAA,KAlLAi0P,CAAAv+N,KAAAw+N,iBAcA3nU,OACA,OA4KA,SAAA6vE,GACA,MAAAu/B,EAAAv/B,EAAAoZ,MAAA,KACA,OAAAmmB,EAAAA,EAAAhhC,OAAA,GA9KAw5P,CAAAz+N,KAAAw+N,iBAeA3nU,SAAAqlF,GACA,OAAA,IAAA2gP,EAAA78N,KAAA5B,WAAA,IAAAliB,GAcArlF,OACA,IAAAqwE,EAAA84B,KAAAv5B,SAAA23B,WAKA,OAJAl3B,EAAAnB,SAAAi4P,KACA92P,GAAA82P,GAEA92P,GAAA84B,KAAAl5B,OACA,IAAA+1P,EAAA31P,GAcArwE,SACA,MAAA6sF,EAAAsc,KAAAtc,OACA,OAAA,IAAAA,EAAAze,OACA,IAAA43P,EAAAmB,GAGA,IAAAnB,EAAAn5O,EAAAte,MAAA,GAAA,GAAAkF,KAAA0zP,IAeAnnU,MAAA7B,GACA,OAAAgrG,KAAA5B,aAAA4/N,EACAhpU,EACAA,EAAAopG,aAAA4/N,EACAh+N,KAGA,IAAA68N,EAAA78N,KAAA5B,WAAAppG,EAAAopG,YAAA,GAeAvnG,aAAAmgP,GACA,OAAAA,EAAA54I,aAAA4B,KAAA5B,YAIA44I,EAAA54I,WAAAjiB,WAAA6jB,KAAA5B,YAeAvnG,cAAAmgP,GACA,OAAAA,EAAA54I,aAAA4B,KAAA5B,YAIA4B,KAAA5B,WAAAjiB,WAAA66J,EAAA54I,YASAvnG,aACA,OAAA,IAAAmpG,KAAAtc,OAAAze,OASApuE,UAAA1C,GACA,OAAA0oU,EAAAwB,eAAA,IAAAr+N,KAAAs+N,iBA8CA1hO,EA9CAzoG,EAAAi2E,KAAAp1E,GAAAA,EAAAspU,eA+CA,GAAAzsO,UAAA+K,MADA,IAAAA,EArCA/lG,aAAAnD,GACA,OAAAA,aAAAmpU,GAAAx/O,QAAA3pF,GAAAA,EAAA8iO,KAwCAnjO,EAAAC,QAAAupU,6ICtbI7uG,EAASz6N,EAAQ,uBAEfmrU,GAAgBnrU,EAAQ,gCAQ1BkwP,EAAMk7E,EAENvwN,EAASuqH,KACN8qB,GAAQA,EAAKx+K,OAAS0zJ,GACzB8qB,EAAOR,EAAOiE,YALW,GAKCvuB,GAC1B3K,EAAO4wG,eAAen7E,GACtBk7E,EAAa,GACJA,EAAahmG,EAAQ8qB,EAAKx+K,SACnC+oJ,EAAO4wG,eAAen7E,GACtBk7E,EAAa,OAGX5yP,EAAM03K,EAAKtnB,SAASwiG,EAAYA,EAAahmG,UACjDgmG,GAAchmG,EACP5sJ,GAGL8yP,EAAe,CAACngG,EAAUzhI,EAAM6hO,SAK9B9/F,GAAQ,GAAM,GAAKp5J,KAAKovN,MAAOt2D,EAASz5J,OAAS,EAAK,IAAO,EAa7Do/N,EAAOz+N,KAAKwhL,KAAM,IAAMpoB,EAAO/hI,EAAQyhI,EAASz5J,cAE7C,SACDgf,EAAK,UACF,KACD00I,EAAQmmG,EAAUz6B,GAElBl9N,EAAIk9N,OACDl9N,QAEL8c,GAAMy6I,EAAS/F,EAAMxxJ,GAAK63J,IAAS,GAC/B/6I,EAAGhf,SAAWg4B,EAAAA,OAAahZ,KAuBvC5wF,EAAOC,QAAAA,CAAYyqU,OAfN,CAAC9gO,EAAO,UACf07H,EAAQvqH,EAAOnR,GACfhZ,EAAK,QAEFgZ,KAMLhZ,GAAMy6O,EAA0B,GAAd/lG,EAAM17H,WAEnBhZ,GAGkB86O,eAjBN,CAACrgG,EAAUzhI,IAAS4hO,EAAangG,EAAUzhI,EAAMmR,GAiB3BywN,aAAAA,EAAcH,YAAAA,EAAatwN,OAAAA,iGC/EtE,aAEA96G,EAAAy7Q,YAAAz7Q,EAAAigR,IAAAjgR,EAAA0rU,kBAAA1rU,EAAAk4Q,KAAAj4Q,EAAA,eACAD,EAAAuvT,WAAAvvT,EAAA+/S,KAAA9/S,EAAA,eACAD,EAAA2rU,WAAA3rU,EAAA8/S,KAAA7/S,EAAA,eAEA,IAAA2rU,EAAA3rU,EAAA,yBACA4rU,EAAA3rU,OAAAW,KAAA+qU,GACAE,EAAA,CAAA,OAAA,SAAA,SAAA,SAAA,SAAA,MAAA,UAAAvtO,OAAAstO,GACA7rU,EAAA+rU,UAAA,WACA,OAAAD,GAGA,IAAAl4P,EAAA3zE,EAAA,UACAD,EAAAkrQ,OAAAt3L,EAAAs3L,OACAlrQ,EAAAq2Q,WAAAziM,EAAAyiM,WAEA,IAAAxL,EAAA5qQ,EAAA,qBAEAD,EAAAgsU,OAAAnhE,EAAAmhE,OACAhsU,EAAA2wQ,aAAA9F,EAAA8F,aACA3wQ,EAAAisU,SAAAphE,EAAAohE,SACAjsU,EAAAmnT,eAAAt8C,EAAAs8C,eACAnnT,EAAAksU,SAAArhE,EAAAqhE,SACAlsU,EAAA0wQ,eAAA7F,EAAA6F,eACA1wQ,EAAAmsU,WAAAthE,EAAAshE,WACAnsU,EAAAqnT,iBAAAx8C,EAAAw8C,iBACArnT,EAAAosU,WAAAvhE,EAAAuhE,WACApsU,EAAAqsU,YAAAxhE,EAAAwhE,YAEA,IAAAxxB,EAAA56S,EAAA,kBAEAD,EAAAssU,mBAAAzxB,EAAAyxB,mBACAtsU,EAAAusU,yBAAA1xB,EAAA0xB,yBACAvsU,EAAAwsU,iBAAA3xB,EAAA2xB,iBACAxsU,EAAAysU,oBAAA5xB,EAAA4xB,oBACAzsU,EAAA0sU,cAAA7xB,EAAA6xB,cAEA,IAAA13E,EAAA/0P,EAAA,mBAEAD,EAAA2sU,WAAA33E,EAAA23E,WACA3sU,EAAA4sU,KAAA53E,EAAA43E,KACA5sU,EAAA6sU,aAAA73E,EAAA63E,aACA7sU,EAAA8sU,OAAA93E,EAAA83E,OAEA9sU,EAAA+sU,WAAA9sU,EAAA,eAEA,IAAA+sU,EAAA/sU,EAAA,kBAEAD,EAAAgtU,cAAAA,EAAAA,cACAhtU,EAAAitU,eAAAD,EAAAC,eACAjtU,EAAAktU,cAAAF,EAAAE,cACAltU,EAAAmtU,eAAAH,EAAAG,eAeA,IAAAC,EAAAntU,EAAA,cAEAD,EAAAqtU,WAAAD,EAAAC,WACArtU,EAAAsrU,eAAA8B,EAAA9B,eAEAtrU,EAAAstU,kBAAA,WACA,MAAA,IAAA9nO,MAAA,CACA,kDACA,0BACA,0DACAxuB,KAAA,QAGAh3E,EAAA8oO,UAAA,CACAykG,0BAAA,EACAC,qBAAA,EACAC,6BAAA,EACAC,0BAAA,EACAC,YAAA,EACAC,aAAA,EACAC,kBAAA,EACAC,mBAAA,EACAC,eAAA,EACAC,uBAAA,EACAC,iBAAA,EACAC,sBAAA,EACAC,4BAAA,EACAC,8BAAA,EACAC,wBAAA,gSC/FA,+CAIIx3C,EAAY,MAIZy3C,EAAa,WAEjB,SAAAC,cACY/oO,MAAM,sHAGdmqJ,EAAS1vP,EAAQ,eAAe0vP,OAChCj1B,EAASxuH,EAAOwuH,QAAUxuH,EAAOusK,SAQrC,SAAAgD,EAAsB9xK,EAAMojD,MAEtBpjD,EAAO2kO,EAAAA,MAAAA,IAAsBriG,WAAW,uCAExC5G,EAAQsqB,EAAOiE,YAAYjqJ,MAE3BA,EAAO,KACLA,EAAOktL,UAEAxkM,EAAY,EAAGA,EAAYsX,EAAMtX,GAAawkM,EAGrDn8D,EAAO69C,gBAAgBlzC,EAAMvzJ,MAAMugB,EAAWA,EAAYwkM,SAG5Dn8D,EAAO69C,gBAAgBlzC,SAIT,mBAAPt4E,EACFyxC,EAAQla,UAAS,WACtBv3B,EAAG,KAAMs4E,MAINA,EA/BL3K,GAAUA,EAAO69C,gBACnBx4Q,EAAOC,QAAUy7Q,EAEjB17Q,EAAOC,QAAUuuU;A;IClBfhyH,EAASt8M,EAAQ,UACjB0vP,EAASpzC,EAAOozC,OAGpB,SAAA6+E,EAAoB7lO,EAAK8oJ,WACd/vP,KAAOinG,EACd8oJ,EAAI/vP,GAAOinG,EAAIjnG,GAWnB,SAAA+sU,EAAqB36P,EAAKinP,EAAkBppP,UACnCg+K,EAAO77K,EAAKinP,EAAkBppP,GATnCg+K,EAAOx5F,MAAQw5F,EAAOO,OAASP,EAAOiE,aAAejE,EAAO2uE,gBAC9Dv+T,EAAOC,QAAUu8M,GAGjBiyH,EAAUjyH,EAAQv8M,GAClBA,EAAQ2vP,OAAS8+E,GAOnBA,EAAWpkO,UAAYnqG,OAAOU,OAAO+uP,EAAOtlJ,WAG5CmkO,EAAU7+E,EAAQ8+E,GAElBA,EAAWt4K,KAAO,SAAUriF,EAAKinP,EAAkBppP,MAC9B,iBAARmC,YACC29B,UAAU,wCAEfk+I,EAAO77K,EAAKinP,EAAkBppP,IAGvC88P,EAAWv+E,MAAQ,SAAUvmJ,EAAMu0L,EAAMj1D,MACnB,iBAATt/H,YACC8H,UAAU,iCAElBwrH,EAAM0yB,EAAOhmJ,eACJvnG,IAAT87R,EACsB,iBAAbj1D,EACThM,EAAIihE,KAAKA,EAAMj1D,GAEfhM,EAAIihE,KAAKA,GAGXjhE,EAAIihE,KAAK,GAEJjhE,GAGTwxG,EAAW76E,YAAc,SAAUjqJ,MACb,iBAATA,YACC8H,UAAU,oCAEfk+I,EAAOhmJ,IAGhB8kO,EAAWnQ,gBAAkB,SAAU30N,MACjB,iBAATA,YACC8H,UAAU,oCAEf8qG,EAAOo+G,WAAWhxN,gDC/D3B,aACA,IAAAw1L,EAAAl/R,EAAA,YACAyuU,EAAAzuU,EAAA,UACAq/S,EAAAr/S,EAAA,aACA0sR,EAAA1sR,EAAA,UACAwpO,EAAAxpO,EAAA,eAEA,SAAA8/S,EAAAhgM,GACA0pH,EAAAn/H,KAAAoC,KAAA,UAEAA,KAAAiiO,MAAA5uN,EAGAo/K,EAAA4gB,EAAAt2E,GAEAs2E,EAAA11M,UAAA8vK,QAAA,SAAA/gH,GACA1sD,KAAAiiO,MAAAtsK,OAAAjJ,IAGA2mJ,EAAA11M,UAAAukO,OAAA,WACA,OAAAliO,KAAAiiO,MAAA/oG,UAGA7lO,EAAAC,QAAA,SAAA4tR,GAEA,MAAA,SADAA,EAAAA,EAAA93M,eACA,IAAA44P,EACA,WAAA9gD,GAAA,cAAAA,EAAA,IAAA0xB,EAEA,IAAAS,EAAApzB,EAAAiB,6HC5BA,iBACIuR,EAAWl/R,EAAQ,YACnB4uU,EAAW5uU,EAAQ,aACnB0vP,EAAS1vP,EAAQ,eAAe0vP,OAEhCm/E,EAAAA,IAAcvkO,MAAM,IAExB,SAAAmkO,IACEG,EAASvkO,KAAKoC,KAAM,IAGpBA,KAAKqiO,GAAK,WACVriO,KAAKsiO,GAAK,WACVtiO,KAAKu6E,GAAK,WACVv6E,KAAKo6E,GAAK,UA+GZ,SAAAmoJ,EAAe30N,EAAG35G,UACR25G,GAAK35G,EAAM25G,IAAO,GAAK35G,EAGjC,SAAAuuU,EAAc37P,EAAGyS,EAAG7M,EAAGmxD,EAAG1+C,EAAG7qF,EAAG6nF,UACtBqmP,EAAM17P,GAAMyS,EAAI7M,GAAQ6M,EAAKskD,GAAM1+C,EAAI7qF,EAAK,EAAG6nF,GAAK5C,EAAK,EAGnE,SAAAmpP,EAAc57P,EAAGyS,EAAG7M,EAAGmxD,EAAG1+C,EAAG7qF,EAAG6nF,UACtBqmP,EAAM17P,GAAMyS,EAAIskD,EAAMnxD,GAAMmxD,GAAO1+C,EAAI7qF,EAAK,EAAG6nF,GAAK5C,EAAK,EAGnE,SAAAopP,EAAc77P,EAAGyS,EAAG7M,EAAGmxD,EAAG1+C,EAAG7qF,EAAG6nF,UACtBqmP,EAAM17P,GAAKyS,EAAI7M,EAAImxD,GAAK1+C,EAAI7qF,EAAK,EAAG6nF,GAAK5C,EAAK,EAGxD,SAAAqpP,EAAc97P,EAAGyS,EAAG7M,EAAGmxD,EAAG1+C,EAAG7qF,EAAG6nF,UACtBqmP,EAAM17P,GAAM4F,GAAK6M,GAAMskD,IAAQ1+C,EAAI7qF,EAAK,EAAG6nF,GAAK5C,EAAK,EA7H/Dm5M,EAASuvC,EAAKG,GAEdH,EAAIrkO,UAAU8vK,QAAU,mBAClB5oD,EAAIu9G,EACCj7P,EAAI,EAAGA,EAAI,KAAMA,EAAG09I,EAAE19I,GAAK64B,KAAK4iO,OAAO5O,YAAgB,EAAJ7sP,OAExDN,EAAIm5B,KAAKqiO,GACT/oP,EAAI0mB,KAAKsiO,GACT71P,EAAIuzB,KAAKu6E,GACT38C,EAAI59B,KAAKo6E,GAEbvzG,EAAI27P,EAAI37P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,GAAI,WAAY,GACtCjnF,EAAI4kM,EAAI5kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,GAAI,WAAY,IACtCp4I,EAAI+1P,EAAI/1P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,GAAI,UAAY,IACtCvrI,EAAIkpP,EAAIlpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,GAAI,WAAY,IACtCh+I,EAAI27P,EAAI37P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,GAAI,WAAY,GACtCjnF,EAAI4kM,EAAI5kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,GAAI,WAAY,IACtCp4I,EAAI+1P,EAAI/1P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,GAAI,WAAY,IACtCvrI,EAAIkpP,EAAIlpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,GAAI,WAAY,IACtCh+I,EAAI27P,EAAI37P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,GAAI,WAAY,GACtCjnF,EAAI4kM,EAAI5kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,GAAI,WAAY,IACtCp4I,EAAI+1P,EAAI/1P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,IAAK,WAAY,IACvCvrI,EAAIkpP,EAAIlpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,IAAK,WAAY,IACvCh+I,EAAI27P,EAAI37P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,IAAK,WAAY,GACvCjnF,EAAI4kM,EAAI5kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,IAAK,WAAY,IACvCp4I,EAAI+1P,EAAI/1P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,IAAK,WAAY,IAGvCh+I,EAAI47P,EAAI57P,EAFRyS,EAAIkpP,EAAIlpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,IAAK,WAAY,IAEzBp4I,EAAGmxD,EAAGinF,EAAE,GAAI,WAAY,GACtCjnF,EAAI6kM,EAAI7kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,GAAI,WAAY,GACtCp4I,EAAIg2P,EAAIh2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,IAAK,UAAY,IACvCvrI,EAAImpP,EAAInpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,GAAI,WAAY,IACtCh+I,EAAI47P,EAAI57P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,GAAI,WAAY,GACtCjnF,EAAI6kM,EAAI7kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,IAAK,SAAY,GACvCp4I,EAAIg2P,EAAIh2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,IAAK,WAAY,IACvCvrI,EAAImpP,EAAInpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,GAAI,WAAY,IACtCh+I,EAAI47P,EAAI57P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,GAAI,UAAY,GACtCjnF,EAAI6kM,EAAI7kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,IAAK,WAAY,GACvCp4I,EAAIg2P,EAAIh2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,GAAI,WAAY,IACtCvrI,EAAImpP,EAAInpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,GAAI,WAAY,IACtCh+I,EAAI47P,EAAI57P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,IAAK,WAAY,GACvCjnF,EAAI6kM,EAAI7kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,GAAI,WAAY,GACtCp4I,EAAIg2P,EAAIh2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,GAAI,WAAY,IAGtCh+I,EAAI67P,EAAI77P,EAFRyS,EAAImpP,EAAInpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,IAAK,WAAY,IAEzBp4I,EAAGmxD,EAAGinF,EAAE,GAAI,WAAY,GACtCjnF,EAAI8kM,EAAI9kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,GAAI,WAAY,IACtCp4I,EAAIi2P,EAAIj2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,IAAK,WAAY,IACvCvrI,EAAIopP,EAAIppP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,IAAK,WAAY,IACvCh+I,EAAI67P,EAAI77P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,GAAI,WAAY,GACtCjnF,EAAI8kM,EAAI9kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,GAAI,WAAY,IACtCp4I,EAAIi2P,EAAIj2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,GAAI,WAAY,IACtCvrI,EAAIopP,EAAIppP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,IAAK,WAAY,IACvCh+I,EAAI67P,EAAI77P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,IAAK,UAAY,GACvCjnF,EAAI8kM,EAAI9kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,GAAI,WAAY,IACtCp4I,EAAIi2P,EAAIj2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,GAAI,WAAY,IACtCvrI,EAAIopP,EAAIppP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,GAAI,SAAY,IACtCh+I,EAAI67P,EAAI77P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,GAAI,WAAY,GACtCjnF,EAAI8kM,EAAI9kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,IAAK,WAAY,IACvCp4I,EAAIi2P,EAAIj2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,IAAK,UAAY,IAGvCh+I,EAAI87P,EAAI97P,EAFRyS,EAAIopP,EAAIppP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,GAAI,WAAY,IAExBp4I,EAAGmxD,EAAGinF,EAAE,GAAI,WAAY,GACtCjnF,EAAI+kM,EAAI/kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,GAAI,WAAY,IACtCp4I,EAAIk2P,EAAIl2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,IAAK,WAAY,IACvCvrI,EAAIqpP,EAAIrpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,GAAI,WAAY,IACtCh+I,EAAI87P,EAAI97P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,IAAK,WAAY,GACvCjnF,EAAI+kM,EAAI/kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,GAAI,WAAY,IACtCp4I,EAAIk2P,EAAIl2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,IAAK,WAAY,IACvCvrI,EAAIqpP,EAAIrpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,GAAI,WAAY,IACtCh+I,EAAI87P,EAAI97P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,GAAI,WAAY,GACtCjnF,EAAI+kM,EAAI/kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,IAAK,WAAY,IACvCp4I,EAAIk2P,EAAIl2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,GAAI,WAAY,IACtCvrI,EAAIqpP,EAAIrpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,IAAK,WAAY,IACvCh+I,EAAI87P,EAAI97P,EAAGyS,EAAG7M,EAAGmxD,EAAGinF,EAAE,GAAI,WAAY,GACtCjnF,EAAI+kM,EAAI/kM,EAAG/2D,EAAGyS,EAAG7M,EAAGo4I,EAAE,IAAK,WAAY,IACvCp4I,EAAIk2P,EAAIl2P,EAAGmxD,EAAG/2D,EAAGyS,EAAGurI,EAAE,GAAI,UAAY,IACtCvrI,EAAIqpP,EAAIrpP,EAAG7M,EAAGmxD,EAAG/2D,EAAGg+I,EAAE,GAAI,WAAY,IAEtC7kH,KAAKqiO,GAAMriO,KAAKqiO,GAAKx7P,EAAK,EAC1Bm5B,KAAKsiO,GAAMtiO,KAAKsiO,GAAKhpP,EAAK,EAC1B0mB,KAAKu6E,GAAMv6E,KAAKu6E,GAAK9tG,EAAK,EAC1BuzB,KAAKo6E,GAAMp6E,KAAKo6E,GAAKx8C,EAAK,GAG5BokM,EAAIrkO,UAAU0xM,QAAU,WAEtBrvM,KAAK4iO,OAAO5iO,KAAK6iO,gBAAkB,IAC/B7iO,KAAK6iO,aAAe,KACtB7iO,KAAK4iO,OAAOpxC,KAAK,EAAGxxL,KAAK6iO,aAAc,IACvC7iO,KAAKytK,UACLztK,KAAK6iO,aAAe,GAGtB7iO,KAAK4iO,OAAOpxC,KAAK,EAAGxxL,KAAK6iO,aAAc,IACvC7iO,KAAK4iO,OAAOjO,cAAc30N,KAAK8iO,QAAQ,GAAI,IAC3C9iO,KAAK4iO,OAAOjO,cAAc30N,KAAK8iO,QAAQ,GAAI,IAC3C9iO,KAAKytK,cAGD59D,EAASozC,EAAOiE,YAAY,WAChCr3C,EAAOulH,aAAap1N,KAAKqiO,GAAI,GAC7BxyH,EAAOulH,aAAap1N,KAAKsiO,GAAI,GAC7BzyH,EAAOulH,aAAap1N,KAAKu6E,GAAI,GAC7Bs1B,EAAOulH,aAAap1N,KAAKo6E,GAAI,IACtBy1B,GAuBTx8M,EAAOC,QAAU0uU,0FCjJjB,iBACI/+E,EAAS1vP,EAAQ,eAAe0vP,OAChC8/E,EAAYxvU,EAAQ,mBAAmBwvU,UAS3C,SAAAZ,EAAmB1gE,GACjBshE,EAAUnlO,KAAKoC,MAEfA,KAAK4iO,OAAS3/E,EAAOiE,YAAYua,GACjCzhK,KAAKgjO,WAAavhE,EAClBzhK,KAAK6iO,aAAe,EACpB7iO,KAAK8iO,QAAAA,CAAW,EAAG,EAAG,EAAG,GAEzB9iO,KAAKijO,YAAa,EAhBL1vU,EAAQ,WAmBvBk/R,CAAS0vC,EAAUY,GAEnBZ,EAASxkO,UAAUulO,WAAa,SAAUzzN,EAAO8sH,EAAUliE,OACrD9qF,EAAQ,SAEVywB,KAAK21D,OAAOlmD,EAAO8sH,SACZ9iI,GACPlqB,EAAQkqB,EAGV4gE,EAAS9qF,IAGX4yP,EAASxkO,UAAUwlO,OAAS,SAAU9oK,OAChC9qF,EAAQ,SAEVywB,KAAKl1B,KAAKk1B,KAAKk5H,gBACRz/H,GACPlqB,EAAQkqB,EAGV4gE,EAAS9qF,IAGX4yP,EAASxkO,UAAUg4D,OAAS,SAAUjJ,EAAM6vE,MAzC5C,SAAmC5iI,EAAKhP,OACjCs4J,EAAO8H,SAASpxJ,IAAuB,iBAARA,YACxBoL,UAAUpa,EAAS,iCAwC/By4O,CAAyB12K,EAAM,QAC3B1sD,KAAKijO,WAAAA,MAAAA,IAAsBnqO,MAAM,yBAChCmqJ,EAAO8H,SAASr+F,KAAOA,EAAOu2F,EAAOx5F,KAAKiD,EAAM6vE,YAGjD/uE,EAAQxtD,KAAK4iO,OACb79P,EAAS,EACNi7B,KAAK6iO,aAAen2K,EAAKznF,OAASF,GAAUi7B,KAAKgjO,YAAAA,SAC7C77P,EAAI64B,KAAK6iO,aAAc17P,EAAI64B,KAAKgjO,YAAax1K,EAAMrmF,KAAOulF,EAAK3nF,KACxEi7B,KAAKytK,UACLztK,KAAK6iO,aAAe,OAEf99P,EAAS2nF,EAAKznF,QAAQuoF,EAAMxtD,KAAK6iO,gBAAkBn2K,EAAK3nF,aAGtDusB,EAAI,EAAGusI,EAAsB,EAAdnxE,EAAKznF,OAAY44J,EAAQ,IAAKvsI,EACpD0O,KAAK8iO,QAAQxxO,IAAMusI,GACnBA,EAAS79H,KAAK8iO,QAAQxxO,GAAK,WAAgB,GAC/B,IAAG0O,KAAK8iO,QAAQxxO,IAAM,WAAeusI,UAG5C79H,MAGTmiO,EAASxkO,UAAU8vK,QAAU,qBACjB30K,MAAM,+BAGlBqpO,EAASxkO,UAAUu7H,OAAS,SAAUqD,MAChCv8H,KAAKijO,WAAAA,MAAAA,IAAsBnqO,MAAM,yBACrCkH,KAAKijO,YAAa,MAEd/pG,EAASl5H,KAAKqvM,eACD35S,IAAb6mO,IAAwBrD,EAASA,EAAO96H,SAASm+H,IAGrDv8H,KAAK4iO,OAAOpxC,KAAK,GACjBxxL,KAAK6iO,aAAe,UACX17P,EAAI,EAAGA,EAAI,IAAKA,EAAG64B,KAAK8iO,QAAQ37P,GAAK,SAEvC+xJ,GAGTipG,EAASxkO,UAAU0xM,QAAU,qBACjBv2M,MAAM,+BAGlBzlG,EAAOC,QAAU6uU,iGC9FjB7uU,EAAAD,EAAAC,QAAAC,EAAA,8BACA8vU,OAAA/vU,EACAA,EAAAgwU,SAAAhwU,EACAA,EAAAiwU,SAAAhwU,EAAA,6BACAD,EAAAkwU,OAAAjwU,EAAA,2BACAD,EAAAyvU,UAAAxvU,EAAA,8BACAD,EAAAmwU,YAAAlwU,EAAA,gCACAD,EAAAowU,SAAAnwU,EAAA,2CACAD,EAAAsgH,SAAArgH,EAAA,wVCYA,iBAKIiwU,gCAHJnwU,EAAOC,QAAUgwU,EAMjBA,EAASK,cAAgBA,EAGhBpwU,EAAQ,UAAU8xP,iBAEvBu+E,EAAkB,SAAyBC,EAAS/8P,UAC/C+8P,EAAQp3H,UAAU3lI,GAAM7B,QAO7Bo+P,EAAS9vU,EAAQ,6BAIjB0vP,EAAS1vP,EAAQ,UAAU0vP,OAE3B6gF,EAAgBtkO,EAAOi5H,YAAAA,aAE3B,SAAAsrG,EAA6Bt0N,UACpBwzI,EAAOx5F,KAAKh6C,GAGrB,SAAAu0N,EAAuBnlO,UACdokJ,EAAO8H,SAASlsJ,IAAQA,aAAeilO,MAO5CG,EAFAC,EAAY3wU,EAAQ,QAKtB0wU,EADEC,GAAaA,EAAUC,SACjBD,EAAUC,SAAS,UAEnB,iBAmBNC,EACAC,EACA56K,EAhBA66K,EAAa/wU,EAAQ,kCAErBgxU,EAAchxU,EAAQ,8BAEtBixU,EAAWjxU,EAAQ,4BACnBkxU,EAAmBD,EAASC,iBAE5BC,EAAiBnxU,EAAQ,aAAasoO,MACtC8oG,EAAuBD,EAAeC,qBACtCC,EAA4BF,EAAeE,0BAC3CC,EAA6BH,EAAeG,2BAC5CC,EAAqCJ,EAAeI,mCAOxDvxU,EAAQ,WAARA,CAAoB+vU,EAAUD,OAE1B0B,EAAiBR,EAAYQ,eAC7BC,EAAAA,CAAgB,QAAS,QAAS,UAAW,QAAS,UAE1D,SAAAtvG,EAAyBmuG,EAAS36P,EAAO0b,MAGA,mBAA5Bi/O,EAAQnuG,gBAAoB,OAAmBmuG,EAAQnuG,gBAAgBxsJ,EAAO0b,GAKpFi/O,EAAQoB,SAAYpB,EAAQoB,QAAQ/7P,GAAuC20B,MAAM/gB,QAAQ+mP,EAAQoB,QAAQ/7P,IAAS26P,EAAQoB,QAAQ/7P,GAAO4P,QAAQ8L,GAASi/O,EAAQoB,QAAQ/7P,GAAAA,CAAU0b,EAAIi/O,EAAQoB,QAAQ/7P,IAA5J26P,EAAQ71P,GAAG9E,EAAO0b,GAGrE,SAAA++O,EAAuBhvU,EAAS67N,EAAQ00G,GACtC1B,EAASA,GAAUjwU,EAAQ,oBAC3BoB,EAAUA,GAAAA,GAMc,kBAAbuwU,IAAwBA,EAAW10G,aAAkBgzG,GAGhExjO,KAAKmlO,aAAexwU,EAAQwwU,WACxBD,IAAUllO,KAAKmlO,WAAanlO,KAAKmlO,cAAgBxwU,EAAQywU,oBAG7DplO,KAAKqlO,cAAgBZ,EAAiBzkO,KAAMrrG,EAAS,wBAAyBuwU,GAI9EllO,KAAK6vG,OAAAA,IAAay0H,EAClBtkO,KAAK/6B,OAAS,EACd+6B,KAAKslO,MAAQ,KACbtlO,KAAKulO,WAAa,EAClBvlO,KAAKwlO,QAAU,KACfxlO,KAAKkrE,OAAQ,EACblrE,KAAKylO,YAAa,EAClBzlO,KAAK0lO,SAAU,EAKf1lO,KAAK2lO,MAAO,EAGZ3lO,KAAK4lO,cAAe,EACpB5lO,KAAK6lO,iBAAkB,EACvB7lO,KAAK8lO,mBAAoB,EACzB9lO,KAAK+lO,iBAAkB,EACvB/lO,KAAKgmO,QAAS,EAEdhmO,KAAKimO,WAAkC,IAAtBtxU,EAAQsxU,UAEzBjmO,KAAKkmO,cAAgBvxU,EAAQuxU,YAE7BlmO,KAAK4oF,WAAY,EAIjB5oF,KAAKmmO,gBAAkBxxU,EAAQwxU,iBAAmB,OAElDnmO,KAAKomO,WAAa,EAElBpmO,KAAKqmO,aAAc,EACnBrmO,KAAKqwH,QAAU,KACfrwH,KAAKu8H,SAAW,KAEZ5nO,EAAQ4nO,WACL6nG,IAAeA,EAAgB7wU,EAAQ,mBAAmB6wU,eAC/DpkO,KAAKqwH,QAAAA,IAAc+zG,EAAczvU,EAAQ4nO,UACzCv8H,KAAKu8H,SAAW5nO,EAAQ4nO,UAI5B,SAAA+mG,EAAkB3uU,MAChB6uU,EAASA,GAAUjwU,EAAQ,sBACrBysG,gBAAgBsjO,GAAAA,OAAAA,IAAsBA,EAAS3uU,OAGjDuwU,EAAWllO,gBAAgBwjO,EAC/BxjO,KAAKsmO,eAAAA,IAAqB3C,EAAchvU,EAASqrG,KAAMklO,GAEvDllO,KAAKumO,UAAW,EAEZ5xU,IAC0B,mBAAjBA,EAAQq8N,OAAqBhxH,KAAKwmO,MAAQ7xU,EAAQq8N,MAC9B,mBAApBr8N,EAAQ24M,UAAwBttG,KAAKymO,SAAW9xU,EAAQ24M,UAGrE+1H,EAAOzlO,KAAKoC,MAiEd,SAAA0mO,EAA0Bl2G,EAAQ/gH,EAAO8sH,EAAUoqG,EAAYC,GAC7D3C,EAAM,mBAAoBx0N,OAOpBo3N,EANF/9M,EAAQ0nG,EAAO81G,kBAEL,OAAV72N,EACFqZ,EAAM48M,SAAU,EAChBoB,EAAWt2G,EAAQ1nG,WAGd89M,IAAgBC,EAAKE,EAAaj+M,EAAOrZ,IAE1Co3N,EACF9B,EAAev0G,EAAQq2G,WACd/9M,EAAMq8M,YAAc11N,GAASA,EAAMxqC,OAAS,KAChC,iBAAVwqC,GAAuBqZ,EAAMq8M,YAAc3xU,OAAOywM,eAAex0F,KAAWwzI,EAAOtlJ,YAC5F8R,EAAQs0N,EAAoBt0N,IAG1Bk3N,EACE79M,EAAM28M,WAAYV,EAAev0G,EAAAA,IAAYs0G,GAA2CkC,EAASx2G,EAAQ1nG,EAAOrZ,GAAO,WAClHqZ,EAAMoiD,MACf65J,EAAev0G,EAAAA,IAAYo0G,WAClB97M,EAAM8/D,iBACR,EAEP9/D,EAAM48M,SAAU,EAEZ58M,EAAMunG,UAAYkM,GACpB9sH,EAAQqZ,EAAMunG,QAAQs0B,MAAMl1I,GACxBqZ,EAAMq8M,YAA+B,IAAjB11N,EAAMxqC,OAAc+hQ,EAASx2G,EAAQ1nG,EAAOrZ,GAAO,GAAYw3N,EAAcz2G,EAAQ1nG,IAE7Gk+M,EAASx2G,EAAQ1nG,EAAOrZ,GAAO,QAGzBk3N,IACV79M,EAAM48M,SAAU,EAChBuB,EAAcz2G,EAAQ1nG,WAOlBA,EAAMoiD,QAAUpiD,EAAM7jD,OAAS6jD,EAAMu8M,eAAkC,IAAjBv8M,EAAM7jD,QAGtE,SAAA+hQ,EAAkBx2G,EAAQ1nG,EAAOrZ,EAAOk3N,GAClC79M,EAAM08M,SAA4B,IAAjB18M,EAAM7jD,SAAiB6jD,EAAM68M,MAChD78M,EAAMs9M,WAAa,EACnB51G,EAAO33C,KAAK,OAAQppE,KAGpBqZ,EAAM7jD,QAAU6jD,EAAMq8M,WAAa,EAAI11N,EAAMxqC,OACzC0hQ,EAAY79M,EAAM+mF,OAAO/2H,QAAQ22B,GAAYqZ,EAAM+mF,OAAO/kI,KAAK2kC,GAC/DqZ,EAAM88M,cAAcsB,EAAa12G,IAGvCy2G,EAAcz2G,EAAQ1nG,GAGxB,SAAAi+M,EAAsBj+M,EAAOrZ,OACvBo3N,SAEC7C,EAAcv0N,IAA2B,iBAAVA,QAAgC/5G,IAAV+5G,GAAwBqZ,EAAMq8M,aACtF0B,EAAAA,IAASlC,EAAqB,QAAA,CAAU,SAAU,SAAU,cAAel1N,IAGtEo3N,EAjITrzU,OAAOC,eAAe6vU,EAAS3lO,UAAW,YAAA,CAIxCoB,YAAY,EACZvd,IAAK,uBACyB9rF,IAAxBsqG,KAAKsmO,gBAIFtmO,KAAKsmO,eAAe19I,WAE7BnnG,IAAK,SAAa/tF,GAGXssG,KAAKsmO,iBAMVtmO,KAAKsmO,eAAe19I,UAAYl1L,MAGpC4vU,EAAS3lO,UAAU2vG,QAAUi3H,EAAYj3H,QACzCg2H,EAAS3lO,UAAUwpO,WAAa5C,EAAY6C,UAE5C9D,EAAS3lO,UAAU8oO,SAAW,SAAUhtO,EAAK4mD,GAC3CA,EAAG5mD,IAOL6pO,EAAS3lO,UAAU7yB,KAAO,SAAU2kC,EAAO8sH,OAErCqqG,EADA99M,EAAQ9oB,KAAKsmO,sBAGZx9M,EAAMq8M,WAYTyB,GAAiB,EAXI,iBAAVn3N,KACT8sH,EAAWA,GAAYzzG,EAAMq9M,mBAEZr9M,EAAMyzG,WACrB9sH,EAAQwzI,EAAOx5F,KAAKh6C,EAAO8sH,GAC3BA,EAAW,IAGbqqG,GAAiB,GAMdF,EAAiB1mO,KAAMyP,EAAO8sH,GAAU,EAAOqqG,IAIxDtD,EAAS3lO,UAAU7kB,QAAU,SAAU22B,UAC9Bi3N,EAAiB1mO,KAAMyP,EAAO,MAAM,GAAM,IAyEnD6zN,EAAS3lO,UAAU0pO,SAAW,kBACW,IAAhCrnO,KAAKsmO,eAAed,SAI7BlC,EAAS3lO,UAAU2pO,YAAc,SAAU3qG,GACpCynG,IAAeA,EAAgB7wU,EAAQ,mBAAmB6wU,mBAC3D/zG,EAAAA,IAAc+zG,EAAcznG,GAChC38H,KAAKsmO,eAAej2G,QAAUA,EAE9BrwH,KAAKsmO,eAAe/pG,SAAWv8H,KAAKsmO,eAAej2G,QAAQkM,iBAEvDr1J,EAAI84B,KAAKsmO,eAAez2H,OAAOxqI,KAC/B0B,EAAU,GAED,OAANG,GACLH,GAAWspJ,EAAQs0B,MAAMz9K,EAAEwlF,MAC3BxlF,EAAIA,EAAEkW,YAGR4iB,KAAKsmO,eAAez2H,OAAOziD,QAEX,KAAZrmF,GAAgBi5B,KAAKsmO,eAAez2H,OAAO/kI,KAAK/D,GACpDi5B,KAAKsmO,eAAerhQ,OAAS8B,EAAQ9B,OAC9B+6B,UAILunO,EAAU,WAEd,SAAAC,EAAiCvzU,UAC3BA,GAAKszU,EAEPtzU,EAAIszU,GAIJtzU,IACAA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,GACXA,KAGKA,EAKT,SAAAwzU,EAAuBxzU,EAAG60H,UACpB70H,GAAK,GAAsB,IAAjB60H,EAAM7jD,QAAgB6jD,EAAMoiD,MAAc,EACpDpiD,EAAMq8M,WAAmB,EAEzBlxU,GAAMA,EAEJ60H,EAAM08M,SAAW18M,EAAM7jD,OAAe6jD,EAAM+mF,OAAOxqI,KAAKqnF,KAAKznF,OAAmB6jD,EAAM7jD,QAIxFhxE,EAAI60H,EAAMu8M,gBAAev8M,EAAMu8M,cAAgBmC,EAAwBvzU,IACvEA,GAAK60H,EAAM7jD,OAAehxE,EAEzB60H,EAAMoiD,MAKJpiD,EAAM7jD,QAJX6jD,EAAM88M,cAAe,EACd,IAsGX,SAAAkB,EAAoBt2G,EAAQ1nG,MAC1Bm7M,EAAM,eACFn7M,EAAMoiD,UAENpiD,EAAMunG,QAAAA,KACJ5gH,EAAQqZ,EAAMunG,QAAQrrJ,MAEtByqC,GAASA,EAAMxqC,SACjB6jD,EAAM+mF,OAAO/kI,KAAK2kC,GAClBqZ,EAAM7jD,QAAU6jD,EAAMq8M,WAAa,EAAI11N,EAAMxqC,QAIjD6jD,EAAMoiD,OAAQ,EAEVpiD,EAAM68M,KAIRuB,EAAa12G,IAGb1nG,EAAM88M,cAAe,EAEhB98M,EAAM+8M,kBACT/8M,EAAM+8M,iBAAkB,EACxB6B,EAAcl3G,MAQpB,SAAA02G,EAAsB12G,OAChB1nG,EAAQ0nG,EAAO81G,eACnBrC,EAAM,eAAgBn7M,EAAM88M,aAAc98M,EAAM+8M,iBAChD/8M,EAAM88M,cAAe,EAEhB98M,EAAM+8M,kBACT5B,EAAM,eAAgBn7M,EAAM08M,SAC5B18M,EAAM+8M,iBAAkB,EACxB/zI,EAAQla,SAAS8vJ,EAAel3G,IAIpC,SAAAk3G,EAAuBl3G,OACjB1nG,EAAQ0nG,EAAO81G,eACnBrC,EAAM,gBAAiBn7M,EAAM8/D,UAAW9/D,EAAM7jD,OAAQ6jD,EAAMoiD,OAEvDpiD,EAAM8/D,YAAc9/D,EAAM7jD,SAAU6jD,EAAMoiD,QAC7CslD,EAAO33C,KAAK,YACZ/vD,EAAM+8M,iBAAkB,GAS1B/8M,EAAM88M,cAAgB98M,EAAM08M,UAAY18M,EAAMoiD,OAASpiD,EAAM7jD,QAAU6jD,EAAMu8M,cAC7E3hM,EAAK8sF,GASP,SAAAy2G,EAAuBz2G,EAAQ1nG,GACxBA,EAAMu9M,cACTv9M,EAAMu9M,aAAc,EACpBv0I,EAAQla,SAAS+vJ,EAAgBn3G,EAAQ1nG,IAI7C,SAAA6+M,EAAwBn3G,EAAQ1nG,SAwBtBA,EAAM48M,UAAY58M,EAAMoiD,QAAUpiD,EAAM7jD,OAAS6jD,EAAMu8M,eAAiBv8M,EAAM08M,SAA4B,IAAjB18M,EAAM7jD,SAAW,KAC5Gm+B,EAAM0lB,EAAM7jD,UAChBg/P,EAAM,wBACNzzG,EAAOQ,KAAK,GACR5tH,IAAQ0lB,EAAM7jD,aAIpB6jD,EAAMu9M,aAAc,EAgJtB,SAAAuB,EAAqB3rO,UACZ,eACD6sB,EAAQ7sB,EAAIqqO,eAChBrC,EAAM,cAAen7M,EAAMs9M,YACvBt9M,EAAMs9M,YAAYt9M,EAAMs9M,aAEH,IAArBt9M,EAAMs9M,YAAoBxC,EAAgB3nO,EAAK,UACjD6sB,EAAM08M,SAAU,EAChB9hM,EAAKznC,KAqHX,SAAA4rO,EAAiCvoO,OAC3BwpB,EAAQxpB,EAAKgnO,eACjBx9M,EAAMg9M,kBAAoBxmO,EAAKwoO,cAAc,YAAc,EAEvDh/M,EAAMi9M,kBAAoBj9M,EAAMk9M,OAGlCl9M,EAAM08M,SAAU,EACPlmO,EAAKwoO,cAAc,QAAU,GACtCxoO,EAAKg/E,SAIT,SAAAypJ,EAA0BzoO,GACxB2kO,EAAM,4BACN3kO,EAAK0xH,KAAK,GAqBZ,SAAA1yC,EAAgBkyC,EAAQ1nG,GACjBA,EAAMi9M,kBACTj9M,EAAMi9M,iBAAkB,EACxBj0I,EAAQla,SAASowJ,EAASx3G,EAAQ1nG,IAItC,SAAAk/M,EAAiBx3G,EAAQ1nG,GACvBm7M,EAAM,SAAUn7M,EAAM48M,SAEjB58M,EAAM48M,SACTl1G,EAAOQ,KAAK,GAGdloG,EAAMi9M,iBAAkB,EACxBv1G,EAAO33C,KAAK,UACZn1C,EAAK8sF,GACD1nG,EAAM08M,UAAY18M,EAAM48M,SAASl1G,EAAOQ,KAAK,GAgBnD,SAAAttF,EAAc8sF,OACR1nG,EAAQ0nG,EAAO81G,mBACnBrC,EAAM,OAAQn7M,EAAM08M,SAEb18M,EAAM08M,SAA6B,OAAlBh1G,EAAOQ,UA4HjC,SAAAi3G,EAAkBh0U,EAAG60H,UAEE,IAAjBA,EAAM7jD,OAAqB,MAE3B6jD,EAAMq8M,WAAYh5O,EAAM28B,EAAM+mF,OAAOlrG,SAAkB1wG,GAAKA,GAAK60H,EAAM7jD,QAEtDknB,EAAf28B,EAAMunG,QAAevnG,EAAM+mF,OAAOvlI,KAAK,IAAqC,IAAxBw+C,EAAM+mF,OAAO5qI,OAAoB6jD,EAAM+mF,OAAOh3H,QAAmBiwC,EAAM+mF,OAAOh+G,OAAOi3B,EAAM7jD,QACnJ6jD,EAAM+mF,OAAOziD,SAGbjhE,EAAM28B,EAAM+mF,OAAOq4H,QAAQj0U,EAAG60H,EAAMunG,SAE/BlkI,OATHA,EAYN,SAAAg8O,EAAqB33G,OACf1nG,EAAQ0nG,EAAO81G,eACnBrC,EAAM,cAAen7M,EAAM28M,YAEtB38M,EAAM28M,aACT38M,EAAMoiD,OAAQ,EACd4mB,EAAQla,SAASwwJ,EAAet/M,EAAO0nG,IAI3C,SAAA43G,EAAuBt/M,EAAO0nG,MAC5ByzG,EAAM,gBAAiBn7M,EAAM28M,WAAY38M,EAAM7jD,SAE1C6jD,EAAM28M,YAA+B,IAAjB38M,EAAM7jD,SAC7B6jD,EAAM28M,YAAa,EACnBj1G,EAAO+1G,UAAW,EAClB/1G,EAAO33C,KAAK,OAER/vD,EAAMo9M,aAAAA,KAGJmC,EAAS73G,EAAO83G,iBAEfD,GAAUA,EAAOnC,aAAemC,EAAO3E,WAC1ClzG,EAAOljB,WAgBf,SAAA9hI,EAAiB+U,EAAIqtB,WACVzmC,EAAI,EAAG4hB,EAAIxI,EAAGtb,OAAQkC,EAAI4hB,EAAG5hB,OAChCoZ,EAAGpZ,KAAOymC,EAAAA,OAAUzmC,SAGlB,EA3tBVm8P,EAAS3lO,UAAUqzH,KAAO,SAAU/8N,GAClCgwU,EAAM,OAAQhwU,GACdA,EAAImyE,SAASnyE,EAAG,QACZ60H,EAAQ9oB,KAAKsmO,eACbiC,EAAQt0U,KACF,IAANA,IAAS60H,EAAM+8M,iBAAkB,GAI3B,IAAN5xU,GAAW60H,EAAM88M,gBAA0C,IAAxB98M,EAAMu8M,cAAsBv8M,EAAM7jD,QAAU6jD,EAAMu8M,cAAgBv8M,EAAM7jD,OAAS,IAAM6jD,EAAMoiD,cAClI+4J,EAAM,qBAAsBn7M,EAAM7jD,OAAQ6jD,EAAMoiD,OAC3B,IAAjBpiD,EAAM7jD,QAAgB6jD,EAAMoiD,MAAOi9J,EAAYnoO,MAAWknO,EAAalnO,MACpE,QAKC,KAFV/rG,EAAIwzU,EAAcxzU,EAAG60H,KAENA,EAAMoiD,aACE,IAAjBpiD,EAAM7jD,QAAckjQ,EAAYnoO,MAC7B,SAqDL7T,EA5BAq8O,EAAS1/M,EAAM88M,oBACnB3B,EAAM,gBAAiBuE,IAEF,IAAjB1/M,EAAM7jD,QAAgB6jD,EAAM7jD,OAAShxE,EAAI60H,EAAMu8M,gBAEjDpB,EAAM,6BADNuE,GAAS,GAMP1/M,EAAMoiD,OAASpiD,EAAM48M,QAEvBzB,EAAM,mBADNuE,GAAS,GAEAA,IACTvE,EAAM,WACNn7M,EAAM48M,SAAU,EAChB58M,EAAM68M,MAAO,EAEQ,IAAjB78M,EAAM7jD,SAAc6jD,EAAM88M,cAAe,GAE7C5lO,KAAKwmO,MAAM19M,EAAMu8M,eAEjBv8M,EAAM68M,MAAO,EAGR78M,EAAM48M,UAASzxU,EAAIwzU,EAAcc,EAAOz/M,KAMnC,QAFD38B,EAAPl4F,EAAI,EAASg0U,EAASh0U,EAAG60H,GAAkB,OAG7CA,EAAM88M,aAAe98M,EAAM7jD,QAAU6jD,EAAMu8M,cAC3CpxU,EAAI,IAEJ60H,EAAM7jD,QAAUhxE,EAChB60H,EAAMs9M,WAAa,GAGA,IAAjBt9M,EAAM7jD,SAGH6jD,EAAMoiD,QAAOpiD,EAAM88M,cAAe,GAEnC2C,IAAUt0U,GAAK60H,EAAMoiD,OAAOi9J,EAAYnoO,OAGlC,OAAR7T,GAAc6T,KAAK64E,KAAK,OAAQ1sF,GAC7BA,GAwHTm3O,EAAS3lO,UAAU6oO,MAAQ,SAAUvyU,GACnC8wU,EAAe/kO,KAAA,IAAU6kO,EAA2B,aAGtDvB,EAAS3lO,UAAU8qO,KAAO,SAAU9lH,EAAM+lH,OACpCzsO,EAAM+D,KACN8oB,EAAQ9oB,KAAKsmO,sBAETx9M,EAAMy8M,iBACP,EACHz8M,EAAMw8M,MAAQ3iH,aAGX,EACH75F,EAAMw8M,MAAAA,CAASx8M,EAAMw8M,MAAO3iH,iBAI5B75F,EAAMw8M,MAAMx6P,KAAK63I,GAIrB75F,EAAMy8M,YAAc,EACpBtB,EAAM,wBAAyBn7M,EAAMy8M,WAAYmD,OAE7CC,IADUD,IAA6B,IAAjBA,EAAS1jQ,MAAkB29I,IAAS7wB,EAAQ82I,QAAUjmH,IAAS7wB,EAAQ+2I,OAC7EC,EAAQC,EAI5B,SAAAC,EAAkBzC,EAAU0C,GAC1BhF,EAAM,YAEFsC,IAAatqO,GACXgtO,IAAwC,IAA1BA,EAAWC,aAC3BD,EAAWC,YAAa,EAoB5BjF,EAAM,WAENthH,EAAK6S,eAAe,QAAS2zG,GAC7BxmH,EAAK6S,eAAe,SAAU4zG,GAC9BzmH,EAAK6S,eAAe,QAAS6zG,GAC7B1mH,EAAK6S,eAAe,QAAShD,GAC7B7P,EAAK6S,eAAe,SAAUwzG,GAC9B/sO,EAAIu5H,eAAe,MAAOszG,GAC1B7sO,EAAIu5H,eAAe,MAAOuzG,GAC1B9sO,EAAIu5H,eAAe,OAAQ8zG,GAC3BC,GAAY,GAMRzgN,EAAMs9M,YAAgBzjH,EAAK2lH,iBAAkB3lH,EAAK2lH,eAAekB,WAAYH,KA9BnF,SAAAP,IACE7E,EAAM,SACNthH,EAAK39I,MAhBH8jD,EAAM28M,WAAY3zI,EAAQla,SAAS+wJ,GAAY1sO,EAAI2qH,KAAK,MAAO+hH,GACnEhmH,EAAK30I,GAAG,SAAUg7P,OAsBdK,EAAUzB,EAAY3rO,GAC1B0mH,EAAK30I,GAAG,QAASq7P,OACbE,GAAY,EAwBhB,SAAAD,EAAgB75N,GACdw0N,EAAM,cACF93O,EAAMw2H,EAAKgiC,MAAMl1I,GACrBw0N,EAAM,aAAc93O,IAER,IAARA,KAKwB,IAArB28B,EAAMy8M,YAAoBz8M,EAAMw8M,QAAU3iH,GAAQ75F,EAAMy8M,WAAa,IAAqC,IAAhC/5P,EAAQs9C,EAAMw8M,MAAO3iH,MAAkB4mH,IACpHtF,EAAM,8BAA+Bn7M,EAAMs9M,YAC3Ct9M,EAAMs9M,cAGRnqO,EAAIwtO,SAMR,SAAAj3G,EAAiBq0G,GACf5C,EAAM,UAAW4C,GACjBkC,IACApmH,EAAK6S,eAAe,QAAShD,GACU,IAAnCoxG,EAAgBjhH,EAAM,UAAgBoiH,EAAepiH,EAAMkkH,GAMjE,SAAAsC,IACExmH,EAAK6S,eAAe,SAAU4zG,GAC9BL,IAKF,SAAAK,IACEnF,EAAM,YACNthH,EAAK6S,eAAe,QAAS2zG,GAC7BJ,IAKF,SAAAA,IACE9E,EAAM,UACNhoO,EAAI8sO,OAAOpmH,UAlDb1mH,EAAIjuB,GAAG,OAAQs7P,GA+Bf5zG,EAAgB/S,EAAM,QAAS6P,GAO/B7P,EAAKiE,KAAK,QAASuiH,GAQnBxmH,EAAKiE,KAAK,SAAUwiH,GAQpBzmH,EAAK9pC,KAAK,OAAQ58E,GAEb6sB,EAAM08M,UACTvB,EAAM,eACNhoO,EAAIqiF,UAGCqkC,GAgBT2gH,EAAS3lO,UAAUorO,OAAS,SAAUpmH,OAChC75F,EAAQ9oB,KAAKsmO,eACb2C,EAAAA,CACFC,YAAY,MAGW,IAArBpgN,EAAMy8M,WAAe,OAAUvlO,QAEV,IAArB8oB,EAAMy8M,kBAEJ5iH,GAAQA,IAAS75F,EAAMw8M,QACtB3iH,IAAMA,EAAO75F,EAAMw8M,OAExBx8M,EAAMw8M,MAAQ,KACdx8M,EAAMy8M,WAAa,EACnBz8M,EAAM08M,SAAU,EACZ7iH,GAAMA,EAAK9pC,KAAK,SAAU74E,KAAMipO,IANKjpO,SAWtC2iH,EAAAA,KAEC+mH,EAAQ5gN,EAAMw8M,MACdliO,EAAM0lB,EAAMy8M,WAChBz8M,EAAMw8M,MAAQ,KACdx8M,EAAMy8M,WAAa,EACnBz8M,EAAM08M,SAAU,UAEPr+P,EAAI,EAAGA,EAAIi8B,EAAKj8B,IACvBuiQ,EAAMviQ,GAAG0xG,KAAK,SAAU74E,KAAA,CACtBkpO,YAAY,WAITlpO,SAILz6B,EAAQiG,EAAQs9C,EAAMw8M,MAAO3iH,UAClB,IAAXp9I,IACJujD,EAAMw8M,MAAM76P,OAAOlF,EAAO,GAC1BujD,EAAMy8M,YAAc,EACK,IAArBz8M,EAAMy8M,aAAkBz8M,EAAMw8M,MAAQx8M,EAAMw8M,MAAM,IACtD3iH,EAAK9pC,KAAK,SAAU74E,KAAMipO,IAJDjpO,MAU3BsjO,EAAS3lO,UAAU3vB,GAAK,SAAU+9I,EAAInnI,OAChC7Y,EAAMs3P,EAAO1lO,UAAU3vB,GAAG4vB,KAAKoC,KAAM+rH,EAAInnI,GACzCkkC,EAAQ9oB,KAAKsmO,qBAEN,SAAPv6G,GAGFjjG,EAAMg9M,kBAAoB9lO,KAAK8nO,cAAc,YAAc,GAErC,IAAlBh/M,EAAM08M,SAAmBxlO,KAAKs+E,UAClB,aAAPytC,IACJjjG,EAAM28M,YAAe38M,EAAMg9M,oBAC9Bh9M,EAAMg9M,kBAAoBh9M,EAAM88M,cAAe,EAC/C98M,EAAM08M,SAAU,EAChB18M,EAAM+8M,iBAAkB,EACxB5B,EAAM,cAAen7M,EAAM7jD,OAAQ6jD,EAAM48M,SAErC58M,EAAM7jD,OACRiiQ,EAAalnO,MACH8oB,EAAM48M,SAChB5zI,EAAQla,SAASmwJ,EAAkB/nO,QAKlCj0B,GAGTu3P,EAAS3lO,UAAU23H,YAAcguG,EAAS3lO,UAAU3vB,GAEpDs1P,EAAS3lO,UAAU63H,eAAiB,SAAUzJ,EAAInnI,OAC5C7Y,EAAMs3P,EAAO1lO,UAAU63H,eAAe53H,KAAKoC,KAAM+rH,EAAInnI,SAE9C,aAAPmnI,GAOFj6B,EAAQla,SAASiwJ,EAAyB7nO,MAGrCj0B,GAGTu3P,EAAS3lO,UAAU83H,mBAAqB,SAAU1J,OAC5ChgJ,EAAMs3P,EAAO1lO,UAAU83H,mBAAmBryB,MAAMpjG,KAAM3pB,iBAE/C,aAAP01I,QAA4Br2N,IAAPq2N,GAOvBj6B,EAAQla,SAASiwJ,EAAyB7nO,MAGrCj0B,GAuBTu3P,EAAS3lO,UAAU2gF,OAAS,eACtBx1D,EAAQ9oB,KAAKsmO,sBAEZx9M,EAAM08M,UACTvB,EAAM,UAINn7M,EAAM08M,SAAW18M,EAAMg9M,kBACvBxnJ,EAAOt+E,KAAM8oB,IAGfA,EAAMk9M,QAAS,EACRhmO,MAuBTsjO,EAAS3lO,UAAU8rO,MAAQ,kBACzBxF,EAAM,wBAAyBjkO,KAAKsmO,eAAed,UAEf,IAAhCxlO,KAAKsmO,eAAed,UACtBvB,EAAM,SACNjkO,KAAKsmO,eAAed,SAAU,EAC9BxlO,KAAK64E,KAAK,UAGZ74E,KAAKsmO,eAAeN,QAAS,EACtBhmO,MAeTsjO,EAAS3lO,UAAU2mG,KAAO,SAAUksB,OAC9Bx6G,EAAQhW,KAER8oB,EAAQ9oB,KAAKsmO,eACbN,GAAS,UA0BJ7+P,KAzBTqpJ,EAAOxiJ,GAAG,OAAO,cACfi2P,EAAM,eAEFn7M,EAAMunG,UAAYvnG,EAAMoiD,MAAAA,KACtBz7D,EAAQqZ,EAAMunG,QAAQrrJ,MACtByqC,GAASA,EAAMxqC,QAAQ+wC,EAAMlrC,KAAK2kC,GAGxCuG,EAAMlrC,KAAK,SAEb0lJ,EAAOxiJ,GAAG,QAAQ,SAAUyhC,IAC1Bw0N,EAAM,gBACFn7M,EAAMunG,UAAS5gH,EAAQqZ,EAAMunG,QAAQs0B,MAAMl1I,IAE3CqZ,EAAMq8M,YAAAA,MAAe11N,KAAyDqZ,EAAMq8M,YAAgB11N,GAAUA,EAAMxqC,UAE9G+wC,EAAMlrC,KAAK2kC,KAGnBu2N,GAAS,EACTx1G,EAAOi5G,aAKGj5G,OACI96N,IAAZsqG,KAAK74B,IAAyC,mBAAdqpJ,EAAOrpJ,KACzC64B,KAAK74B,GAAAA,SAAyBi2D,UACrB,kBACEozF,EAAOpzF,GAAQgmE,MAAMotB,EAAQn6I,YAFnClP,CAIHA,YAKGlzE,EAAI,EAAGA,EAAI+wU,EAAa//P,OAAQhxE,IACvCu8N,EAAOxiJ,GAAGg3P,EAAa/wU,GAAI+rG,KAAK64E,KAAKlgF,KAAKqH,KAAMglO,EAAa/wU,YAK/D+rG,KAAKwmO,MAAQ,SAAUvyU,GACrBgwU,EAAM,gBAAiBhwU,GAEnB+xU,IACFA,GAAS,EACTx1G,EAAOlyC,WAIJt+E,MAGa,mBAAX9pG,SACTotU,EAAS3lO,UAAUznG,OAAOy6N,eAAiB,uBACCj7N,IAAtC2uU,IACFA,EAAoC9wU,EAAQ,sCAGvC8wU,EAAkCrkO,QAI7CxsG,OAAOC,eAAe6vU,EAAS3lO,UAAW,wBAAA,CAIxCoB,YAAY,EACZvd,IAAK,kBACIwe,KAAKsmO,eAAejB,iBAG/B7xU,OAAOC,eAAe6vU,EAAS3lO,UAAW,iBAAA,CAIxCoB,YAAY,EACZvd,IAAK,kBACIwe,KAAKsmO,gBAAkBtmO,KAAKsmO,eAAez2H,UAGtDr8M,OAAOC,eAAe6vU,EAAS3lO,UAAW,kBAAA,CAIxCoB,YAAY,EACZvd,IAAK,kBACIwe,KAAKsmO,eAAed,SAE7B/jP,IAAK,SAAaqnC,GACZ9oB,KAAKsmO,iBACPtmO,KAAKsmO,eAAed,QAAU18M,MAKpCw6M,EAASqG,UAAY1B,EACrBz0U,OAAOC,eAAe6vU,EAAS3lO,UAAW,iBAAA,CAIxCoB,YAAY,EACZvd,IAAK,kBACIwe,KAAKsmO,eAAerhQ,UAoDT,mBAAX/uE,SACTotU,EAAS75K,KAAO,SAAUmgL,EAAU7oK,eACrBrrK,IAAT+zJ,IACFA,EAAOl2J,EAAQ,4BAGVk2J,EAAK65K,EAAUsG,EAAU7oK,0ZCpkCpC,aAEA,IAOA8oK,EAPArlH,EAAA,iBAAA96B,QAAAA,QAAA,KACAogJ,EAAAtlH,GAAA,mBAAAA,EAAAphB,MACAohB,EAAAphB,MACA,SAAAh4B,EAAA03B,EAAA1sH,GACA,OAAAvgF,SAAA8nG,UAAAylG,MAAAxlG,KAAAwtE,EAAA03B,EAAA1sH,IAKAyzP,EADArlH,GAAA,mBAAAA,EAAA76B,QACA66B,EAAA76B,QACAn2L,OAAA+lG,sBACA,SAAA6xE,GACA,OAAA53K,OAAAy0G,oBAAAmjE,GACAv5E,OAAAr+F,OAAA+lG,sBAAA6xE,KAGA,SAAAA,GACA,OAAA53K,OAAAy0G,oBAAAmjE,IAQA,IAAA2+J,EAAA5jQ,OAAA+4B,OAAA,SAAAxrG,GACA,OAAAA,GAAAA,GAGA,SAAA2xP,IACAA,EAAArwH,KAAAp3B,KAAAoC,MAEA3sG,EAAAC,QAAA+xP,EACAhyP,EAAAC,QAAAszN,KAwYA,SAAAi9G,EAAAhxU,GACA,OAAA,IAAAkzK,SAAA,SAAAC,EAAAu5B,GACA,SAAAyqI,EAAAvwO,GACAoqO,EAAAruG,eAAA3iO,EAAAy0F,GACAi4G,EAAA9lG,GAGA,SAAAnS,IACA,mBAAAu8O,EAAAruG,gBACAquG,EAAAruG,eAAA,QAAAw0G,GAEAhkK,EAAA,GAAA5gG,MAAAw4B,KAAAvnB,YAGA4zP,EAAApG,EAAAhxU,EAAAy0F,EAAA,CAAAs/H,MAAA,IACA,UAAA/zN,GAMA,SAAAgxU,EAAAtmK,EAAAl6C,GACA,mBAAAwgN,EAAA71P,IACAi8P,EAAApG,EAAA,QAAAtmK,EAAAl6C,GAPA6mN,CAAArG,EAAAmG,EAAA,CAAApjH,MAAA,QArZAy+B,EAAAA,aAAAA,EAEAA,EAAA1nJ,UAAAsnO,aAAAvvU,EACA2vP,EAAA1nJ,UAAAwsO,aAAA,EACA9kF,EAAA1nJ,UAAAysO,mBAAA10U,EAIA,IAAA20U,EAAA,GAEA,SAAAC,EAAAx9H,GACA,GAAA,mBAAAA,EACA,MAAA,IAAA/nG,UAAA,0EAAA+nG,GAsCA,SAAAy9H,EAAAC,GACA,YAAA90U,IAAA80U,EAAAJ,cACA/kF,EAAAglF,oBACAG,EAAAJ,cAmDA,SAAAK,EAAAr/J,EAAAtkG,EAAAgmI,EAAAp9F,GACA,IAAAxwB,EACAwrP,EACAt1O,EA1HAu1O,EAgJA,GApBAL,EAAAx9H,QAGAp3M,KADAg1U,EAAAt/J,EAAA65J,UAEAyF,EAAAt/J,EAAA65J,QAAAzxU,OAAAU,OAAA,MACAk3K,EAAA++J,aAAA,SAIAz0U,IAAAg1U,EAAAE,cACAx/J,EAAAyN,KAAA,cAAA/xG,EACAgmI,EAAAA,SAAAA,EAAAA,SAAAA,GAIA49H,EAAAt/J,EAAA65J,SAEA7vO,EAAAs1O,EAAA5jQ,SAGApxE,IAAA0/F,EAEAA,EAAAs1O,EAAA5jQ,GAAAgmI,IACA1hC,EAAA++J,kBAeA,GAbA,mBAAA/0O,EAEAA,EAAAs1O,EAAA5jQ,GACA4oC,EAAA,CAAAo9F,EAAA13G,GAAA,CAAAA,EAAA03G,GAEAp9F,EACAta,EAAAtc,QAAAg0H,GAEA13G,EAAAtqB,KAAAgiI,IAIA5tH,EAAAqrP,EAAAn/J,IACA,GAAAh2E,EAAAnwB,OAAAia,IAAAkW,EAAAy1O,OAAA,CACAz1O,EAAAy1O,QAAA,EAGA,IAAApmH,EAAA,IAAA3rH,MAAA,+CACA1D,EAAAnwB,OAAA,IAAAoB,OAAAS,GADA,qEAIA29I,EAAA5xN,KAAA,8BACA4xN,EAAAo/G,QAAAz4J,EACAq5C,EAAA39I,KAAAA,EACA29I,EAAAlhI,MAAA6R,EAAAnwB,OA7KA0lQ,EA8KAlmH,EA7KA/pH,SAAAA,QAAAs6E,MAAAt6E,QAAAs6E,KAAA21J,GAiLA,OAAAv/J,EAcA,SAAA0/J,IACA,IAAA9qO,KAAA+qO,MAGA,OAFA/qO,KAAAorE,OAAAoqD,eAAAx1H,KAAAl5B,KAAAk5B,KAAAgrO,QACAhrO,KAAA+qO,OAAA,EACA,IAAA10P,UAAApR,OACA+6B,KAAA8sG,SAAAlvG,KAAAoC,KAAAorE,QACAprE,KAAA8sG,SAAA1J,MAAApjG,KAAAorE,OAAA/0F,WAIA,SAAA40P,EAAA7/J,EAAAtkG,EAAAgmI,GACA,IAAAhkF,EAAA,CAAAiiN,OAAA,EAAAC,YAAAt1U,EAAA01K,OAAAA,EAAAtkG,KAAAA,EAAAgmI,SAAAA,GACAo+H,EAAAJ,EAAAnyO,KAAAmwB,GAGA,OAFAoiN,EAAAp+H,SAAAA,EACAhkF,EAAAkiN,OAAAE,EACAA,EA0HA,SAAA1jF,EAAAp8E,EAAAtkG,EAAAqkQ,GACA,IAAAT,EAAAt/J,EAAA65J,QAEA,QAAAvvU,IAAAg1U,EACA,MAAA,GAEA,IAAAU,EAAAV,EAAA5jQ,GACA,YAAApxE,IAAA01U,EACA,GAEA,mBAAAA,EACAD,EAAA,CAAAC,EAAAt+H,UAAAs+H,GAAA,CAAAA,GAEAD,EAsDA,SAAAvuO,GAEA,IADA,IAAAzQ,EAAA,IAAA0R,MAAAjB,EAAA33B,QACAkC,EAAA,EAAAA,EAAAglB,EAAAlnB,SAAAkC,EACAglB,EAAAhlB,GAAAy1B,EAAAz1B,GAAA2lI,UAAAlwG,EAAAz1B,GAEA,OAAAglB,EA1DAk/O,CAAAD,GAAAE,EAAAF,EAAAA,EAAAnmQ,QAoBA,SAAA6iQ,EAAAhhQ,GACA,IAAA4jQ,EAAA1qO,KAAAilO,QAEA,QAAAvvU,IAAAg1U,EAAA,CACA,IAAAU,EAAAV,EAAA5jQ,GAEA,GAAA,mBAAAskQ,EACA,OAAA,EACA,QAAA11U,IAAA01U,EACA,OAAAA,EAAAnmQ,OAIA,OAAA,EAOA,SAAAqmQ,EAAA1uO,EAAA3oG,GAEA,IADA,IAAAgJ,EAAA,IAAA4gG,MAAA5pG,GACAkzE,EAAA,EAAAA,EAAAlzE,IAAAkzE,EACAlqE,EAAAkqE,GAAAy1B,EAAAz1B,GACA,OAAAlqE,EA4CA,SAAAgtU,EAAApG,EAAAhxU,EAAAi6M,EAAAzpF,GACA,GAAA,mBAAAwgN,EAAA71P,GACAq1C,EAAAujG,KACAi9G,EAAAj9G,KAAA/zN,EAAAi6M,GAEA+2H,EAAA71P,GAAAn7E,EAAAi6M,OAEA,CAAA,GAAA,mBAAA+2H,EAAA39J,iBAYA,MAAA,IAAAnhE,UAAA,6EAAA8+N,GATAA,EAAA39J,iBAAArzK,GAAA,SAAA04U,EAAAnkQ,GAGAi8C,EAAAujG,MACAi9G,EAAAx8J,oBAAAx0K,EAAA04U,GAEAz+H,EAAA1lI,OAhaA5zE,OAAAC,eAAA4xP,EAAA,sBAAA,CACAtmJ,YAAA,EACAvd,IAAA,WACA,OAAA6oP,GAEA5oP,IAAA,SAAAra,GACA,GAAA,iBAAAA,GAAAA,EAAA,GAAA2iQ,EAAA3iQ,GACA,MAAA,IAAAm4J,WAAA,kGAAAn4J,EAAA,KAEAijQ,EAAAjjQ,KAIAi+K,EAAArwH,KAAA,gBAEAt/H,IAAAsqG,KAAAilO,SACAjlO,KAAAilO,UAAAzxU,OAAAywM,eAAAjkG,MAAAilO,UACAjlO,KAAAilO,QAAAzxU,OAAAU,OAAA,MACA8rG,KAAAmqO,aAAA,GAGAnqO,KAAAoqO,cAAApqO,KAAAoqO,oBAAA10U,GAKA2vP,EAAA1nJ,UAAA6tO,gBAAA,SAAAv3U,GACA,GAAA,iBAAAA,GAAAA,EAAA,GAAA81U,EAAA91U,GACA,MAAA,IAAAsrO,WAAA,gFAAAtrO,EAAA,KAGA,OADA+rG,KAAAoqO,cAAAn2U,EACA+rG,MASAqlJ,EAAA1nJ,UAAA8tO,gBAAA,WACA,OAAAlB,EAAAvqO,OAGAqlJ,EAAA1nJ,UAAAk7E,KAAA,SAAA/xG,GAEA,IADA,IAAAsP,EAAA,GACAjP,EAAA,EAAAA,EAAAkP,UAAApR,OAAAkC,IAAAiP,EAAAtL,KAAAuL,UAAAlP,IACA,IAAAukQ,EAAA,UAAA5kQ,EAEA4jQ,EAAA1qO,KAAAilO,QACA,QAAAvvU,IAAAg1U,EACAgB,EAAAA,QAAAh2U,IAAAg1U,EAAAn7P,WACA,IAAAm8P,EACA,OAAA,EAGA,GAAAA,EAAA,CACA,IAAA7E,EAGA,GAFAzwP,EAAAnR,OAAA,IACA4hQ,EAAAzwP,EAAA,IACAywP,aAAA/tO,MAGA,MAAA+tO,EAGA,IAAAptO,EAAA,IAAAX,MAAA,oBAAA+tO,EAAA,KAAAA,EAAAltP,QAAA,IAAA,KAEA,MADA8f,EAAAjwB,QAAAq9P,EACAptO,EAGA,IAAA8jE,EAAAmtK,EAAA5jQ,GAEA,QAAApxE,IAAA6nK,EACA,OAAA,EAEA,GAAA,mBAAAA,EACAusK,EAAAvsK,EAAAv9D,KAAA5pB,OAEA,CAAA,IAAAgtB,EAAAm6D,EAAAt4F,OACAwnI,EAAA6+H,EAAA/tK,EAAAn6D,GACA,IAAAj8B,EAAA,EAAAA,EAAAi8B,IAAAj8B,EACA2iQ,EAAAr9H,EAAAtlI,GAAA64B,KAAA5pB,GAGA,OAAA,GAiEAivK,EAAA1nJ,UAAA23H,YAAA,SAAAxuJ,EAAAgmI,GACA,OAAA29H,EAAAzqO,KAAAl5B,EAAAgmI,GAAA,IAGAu4C,EAAA1nJ,UAAA3vB,GAAAq3K,EAAA1nJ,UAAA23H,YAEA+vB,EAAA1nJ,UAAA+3H,gBACA,SAAA5uJ,EAAAgmI,GACA,OAAA29H,EAAAzqO,KAAAl5B,EAAAgmI,GAAA,IAqBAu4C,EAAA1nJ,UAAAipH,KAAA,SAAA9/I,EAAAgmI,GAGA,OAFAw9H,EAAAx9H,GACA9sG,KAAAhyB,GAAAlH,EAAAmkQ,EAAAjrO,KAAAl5B,EAAAgmI,IACA9sG,MAGAqlJ,EAAA1nJ,UAAAg4H,oBACA,SAAA7uJ,EAAAgmI,GAGA,OAFAw9H,EAAAx9H,GACA9sG,KAAA01H,gBAAA5uJ,EAAAmkQ,EAAAjrO,KAAAl5B,EAAAgmI,IACA9sG,MAIAqlJ,EAAA1nJ,UAAA63H,eACA,SAAA1uJ,EAAAgmI,GACA,IAAAppH,EAAAgnP,EAAA1hI,EAAA7hI,EAAAwkQ,EAKA,GAHArB,EAAAx9H,QAGAp3M,KADAg1U,EAAA1qO,KAAAilO,SAEA,OAAAjlO,KAGA,QAAAtqG,KADAguF,EAAAgnP,EAAA5jQ,IAEA,OAAAk5B,KAEA,GAAAtc,IAAAopH,GAAAppH,EAAAopH,WAAAA,EACA,KAAA9sG,KAAAmqO,aACAnqO,KAAAilO,QAAAzxU,OAAAU,OAAA,cAEAw2U,EAAA5jQ,GACA4jQ,EAAAl1G,gBACAx1H,KAAA64E,KAAA,iBAAA/xG,EAAA4c,EAAAopH,UAAAA,SAEA,GAAA,mBAAAppH,EAAA,CAGA,IAFAslH,GAAA,EAEA7hI,EAAAuc,EAAAze,OAAA,EAAAkC,GAAA,EAAAA,IACA,GAAAuc,EAAAvc,KAAA2lI,GAAAppH,EAAAvc,GAAA2lI,WAAAA,EAAA,CACA6+H,EAAAjoP,EAAAvc,GAAA2lI,SACA9D,EAAA7hI,EACA,MAIA,GAAA6hI,EAAA,EACA,OAAAhpG,KAEA,IAAAgpG,EACAtlH,EAAAihB,QAiIA,SAAAjhB,EAAAne,GACA,KAAAA,EAAA,EAAAme,EAAAze,OAAAM,IACAme,EAAAne,GAAAme,EAAAne,EAAA,GACAme,EAAAzF,MAlIA2tP,CAAAloP,EAAAslH,GAGA,IAAAtlH,EAAAze,SACAylQ,EAAA5jQ,GAAA4c,EAAA,SAEAhuF,IAAAg1U,EAAAl1G,gBACAx1H,KAAA64E,KAAA,iBAAA/xG,EAAA6kQ,GAAA7+H,GAGA,OAAA9sG,MAGAqlJ,EAAA1nJ,UAAA43H,IAAA8vB,EAAA1nJ,UAAA63H,eAEA6vB,EAAA1nJ,UAAA83H,mBACA,SAAA3uJ,GACA,IAAA2lI,EAAAi+H,EAAAvjQ,EAGA,QAAAzxE,KADAg1U,EAAA1qO,KAAAilO,SAEA,OAAAjlO,KAGA,QAAAtqG,IAAAg1U,EAAAl1G,eAUA,OATA,IAAAn/I,UAAApR,QACA+6B,KAAAilO,QAAAzxU,OAAAU,OAAA,MACA8rG,KAAAmqO,aAAA,QACAz0U,IAAAg1U,EAAA5jQ,KACA,KAAAk5B,KAAAmqO,aACAnqO,KAAAilO,QAAAzxU,OAAAU,OAAA,aAEAw2U,EAAA5jQ,IAEAk5B,KAIA,GAAA,IAAA3pB,UAAApR,OAAA,CACA,IACAjwE,EADAb,EAAAX,OAAAW,KAAAu2U,GAEA,IAAAvjQ,EAAA,EAAAA,EAAAhzE,EAAA8wE,SAAAkC,EAEA,oBADAnyE,EAAAb,EAAAgzE,KAEA64B,KAAAy1H,mBAAAzgO,GAKA,OAHAgrG,KAAAy1H,mBAAA,kBACAz1H,KAAAilO,QAAAzxU,OAAAU,OAAA,MACA8rG,KAAAmqO,aAAA,EACAnqO,KAKA,GAAA,mBAFAysG,EAAAi+H,EAAA5jQ,IAGAk5B,KAAAw1H,eAAA1uJ,EAAA2lI,QACA,QAAA/2M,IAAA+2M,EAEA,IAAAtlI,EAAAslI,EAAAxnI,OAAA,EAAAkC,GAAA,EAAAA,IACA64B,KAAAw1H,eAAA1uJ,EAAA2lI,EAAAtlI,IAIA,OAAA64B,MAoBAqlJ,EAAA1nJ,UAAA8uG,UAAA,SAAA3lI,GACA,OAAA0gL,EAAAxnJ,KAAAl5B,GAAA,IAGAu+K,EAAA1nJ,UAAAkuO,aAAA,SAAA/kQ,GACA,OAAA0gL,EAAAxnJ,KAAAl5B,GAAA,IAGAu+K,EAAAyiF,cAAA,SAAAjE,EAAA/8P,GACA,MAAA,mBAAA+8P,EAAAiE,cACAjE,EAAAiE,cAAAhhQ,GAEAghQ,EAAAlqO,KAAAimO,EAAA/8P,IAIAu+K,EAAA1nJ,UAAAmqO,cAAAA,EAiBAziF,EAAA1nJ,UAAAmuO,WAAA,WACA,OAAA9rO,KAAAmqO,aAAA,EAAAN,EAAA7pO,KAAAilO,SAAA,kCCxaA5xU,EAAAC,QAAAC,EAAA,UAAA8xP,yDCAA,aAEA,SAAA17D,EAAiBzzD,EAAQ61M,OAAsB53U,EAAOX,OAAOW,KAAK+hI,MAAa1iI,OAAO+lG,sBAAAA,KAA6Bg9H,EAAU/iO,OAAO+lG,sBAAsB28B,GAAa61M,IAAgBx1G,EAAUA,EAAQxoJ,QAAO,SAAUi+P,UAAcx4U,OAAOy4U,yBAAyB/1M,EAAQ81M,GAAKjtO,eAAgB5qG,EAAK22E,KAAKs4H,MAAMjvM,EAAMoiO,UAAmBpiO,EAI9U,SAAA+3U,EAAyBrtO,EAAK7pG,EAAKtB,UAAasB,KAAO6pG,EAAOrrG,OAAOC,eAAeorG,EAAK7pG,EAAAA,CAAOtB,MAAOA,EAAOqrG,YAAY,EAAMD,cAAc,EAAMq3H,UAAU,IAAkBt3H,EAAI7pG,GAAOtB,EAAgBmrG,EAI3M,SAAAstO,EAA2B/gK,EAAQzkG,WAAkBQ,EAAI,EAAGA,EAAIR,EAAM1B,OAAQkC,IAAAA,KAAW24E,EAAan5E,EAAMQ,GAAI24E,EAAW/gD,WAAa+gD,EAAW/gD,aAAc,EAAO+gD,EAAWhhD,cAAe,EAAU,UAAWghD,IAAYA,EAAWq2E,UAAW,GAAM3iO,OAAOC,eAAe23K,EAAQtrB,EAAW9qJ,IAAK8qJ,QAKzSmjG,EADW1vP,EAAQ,UACD0vP,OAGlBgxC,EADY1gS,EAAQ,QACA0gS,QAEpBn9E,EAASm9E,GAAWA,EAAQn9E,QAAU,UAM1CzjN,EAAOC,QAAAA,WAGL,SAAAgxU,KArBF,SAAyBzhK,EAAUupK,QAAqBvpK,aAAoBupK,aAA0BrnO,UAAU,qCAsB5GsnO,CAAgBrsO,KAAMskO,GAEtBtkO,KAAK36B,KAAO,KACZ26B,KAAK64D,KAAO,KACZ74D,KAAK/6B,OAAS,EAtBlB,IAAsBmnQ,EAAaE,EAAYC,SAAzBH,EAyBP9H,GAzBoBgI,EAyBpBhI,CAAAA,CACXtvU,IAAK,OACLtB,MAAO,SAAcoxK,OACfiR,EAAAA,CACFrpB,KAAMoY,EACN1nF,KAAM,MAEJ4iB,KAAK/6B,OAAS,EAAG+6B,KAAK64D,KAAKz7E,KAAO24F,EAAW/1E,KAAK36B,KAAO0wG,EAC7D/1E,KAAK64D,KAAOkd,IACV/1E,KAAK/6B,UAGTjwE,IAAK,UACLtB,MAAO,SAAiBoxK,OAClBiR,EAAAA,CACFrpB,KAAMoY,EACN1nF,KAAM4iB,KAAK36B,MAEO,IAAhB26B,KAAK/6B,SAAc+6B,KAAK64D,KAAOkd,GACnC/1E,KAAK36B,KAAO0wG,IACV/1E,KAAK/6B,UAGTjwE,IAAK,QACLtB,MAAO,cACe,IAAhBssG,KAAK/6B,YACLknB,EAAM6T,KAAK36B,KAAKqnF,YACA,IAAhB1sD,KAAK/6B,OAAc+6B,KAAK36B,KAAO26B,KAAK64D,KAAO,KAAU74D,KAAK36B,KAAO26B,KAAK36B,KAAK+X,OAC7E4iB,KAAK/6B,OACAknB,MAGTn3F,IAAK,QACLtB,MAAO,WACLssG,KAAK36B,KAAO26B,KAAK64D,KAAO,KACxB74D,KAAK/6B,OAAS,KAGhBjwE,IAAK,OACLtB,MAAO,SAAcwoF,MACC,IAAhB8jB,KAAK/6B,OAAW,MAAU,WAC1BiC,EAAI84B,KAAK36B,KACT8mB,EAAM,GAAKjlB,EAAEwlF,KAEVxlF,EAAIA,EAAEkW,MACX+O,GAAOjQ,EAAIhV,EAAEwlF,YAGRvgE,KAGTn3F,IAAK,SACLtB,MAAO,SAAgBO,MACD,IAAhB+rG,KAAK/6B,OAAW,OAAUg+K,EAAOO,MAAM,WApE7BvnJ,EAAKmvE,EAAQrmG,EAqEvBonB,EAAM82J,EAAOiE,YAAYjzP,IAAM,GAC/BizE,EAAI84B,KAAK36B,KACT8B,EAAI,EAEDD,GAzEO+0B,EA0ED/0B,EAAEwlF,KA1EI0e,EA0EEj/E,EA1EMpnB,EA0EDoC,EAzE9B87K,EAAOtlJ,UAAU1gG,KAAK2gG,KAAK3B,EAAKmvE,EAAQrmG,GA0ElCoC,GAAKD,EAAEwlF,KAAKznF,OACZiC,EAAIA,EAAEkW,YAGD+O,KAITn3F,IAAK,UACLtB,MAAO,SAAiBO,EAAGu4U,OACrBrgP,SAEAl4F,EAAI+rG,KAAK36B,KAAKqnF,KAAKznF,QAErBknB,EAAM6T,KAAK36B,KAAKqnF,KAAKtnF,MAAM,EAAGnxE,GAC9B+rG,KAAK36B,KAAKqnF,KAAO1sD,KAAK36B,KAAKqnF,KAAKtnF,MAAMnxE,IAGtCk4F,EAFSl4F,IAAM+rG,KAAK36B,KAAKqnF,KAAKznF,OAExB+6B,KAAK2E,QAGL6nO,EAAaxsO,KAAKysO,WAAWx4U,GAAK+rG,KAAK0sO,WAAWz4U,GAGnDk4F,KAGTn3F,IAAK,QACLtB,MAAO,kBACEssG,KAAK36B,KAAKqnF,QAInB13J,IAAK,aACLtB,MAAO,SAAoBO,OACrBizE,EAAI84B,KAAK36B,KACToH,EAAI,EACJ0f,EAAMjlB,EAAEwlF,SACZz4J,GAAKk4F,EAAIlnB,OAEFiC,EAAIA,EAAEkW,MAAAA,KACPoY,EAAMtuB,EAAEwlF,KACRigL,EAAK14U,EAAIuhG,EAAIvwB,OAASuwB,EAAIvwB,OAAShxE,KACnC04U,IAAOn3O,EAAIvwB,OAAQknB,GAAOqJ,EAASrJ,GAAOqJ,EAAIpwB,MAAM,EAAGnxE,GAGjD,IAFVA,GAAK04U,GAEK,CACJA,IAAOn3O,EAAIvwB,UACXwH,EACEvF,EAAEkW,KAAM4iB,KAAK36B,KAAO6B,EAAEkW,KAAU4iB,KAAK36B,KAAO26B,KAAK64D,KAAO,OAE5D74D,KAAK36B,KAAO6B,EACZA,EAAEwlF,KAAOl3D,EAAIpwB,MAAMunQ,YAMrBlgQ,SAGJuzB,KAAK/6B,QAAUwH,EACR0f,KAITn3F,IAAK,aACLtB,MAAO,SAAoBO,OACrBk4F,EAAM82J,EAAOiE,YAAYjzP,GACzBizE,EAAI84B,KAAK36B,KACToH,EAAI,MACRvF,EAAEwlF,KAAKzvJ,KAAKkvF,GACZl4F,GAAKizE,EAAEwlF,KAAKznF,OAELiC,EAAIA,EAAEkW,MAAAA,KACPmzI,EAAMrpJ,EAAEwlF,KACRigL,EAAK14U,EAAIs8N,EAAItrJ,OAASsrJ,EAAItrJ,OAAShxE,KACvCs8N,EAAItzN,KAAKkvF,EAAKA,EAAIlnB,OAAShxE,EAAG,EAAG04U,GAGvB,IAFV14U,GAAK04U,GAEK,CACJA,IAAOp8G,EAAItrJ,UACXwH,EACEvF,EAAEkW,KAAM4iB,KAAK36B,KAAO6B,EAAEkW,KAAU4iB,KAAK36B,KAAO26B,KAAK64D,KAAO,OAE5D74D,KAAK36B,KAAO6B,EACZA,EAAEwlF,KAAO6jE,EAAInrJ,MAAMunQ,YAMrBlgQ,SAGJuzB,KAAK/6B,QAAUwH,EACR0f,KAITn3F,IAAK8hN,EACLpjN,MAAO,SAAeynF,EAAGxmF,UAChBs/R,EAAQj0L,KAnMrB,SAAuBorE,WAAmBjkG,EAAI,EAAGA,EAAIkP,UAAUpR,OAAQkC,IAAAA,KAAW4N,EAAyB,MAAhBsB,UAAUlP,GAAakP,UAAUlP,GAAAA,GAAaA,EAAI,EAAKwiH,EAAQn2L,OAAOuhF,IAAS,GAAM3gF,SAAQ,SAAUY,GAAOk3U,EAAgB9gK,EAAQp2K,EAAK+/E,EAAO//E,OAAsBxB,OAAOo5U,0BAA6Bp5U,OAAOq5U,iBAAiBzhK,EAAQ53K,OAAOo5U,0BAA0B73P,IAAmB40G,EAAQn2L,OAAOuhF,IAAS3gF,SAAQ,SAAUY,GAAOxB,OAAOC,eAAe23K,EAAQp2K,EAAKxB,OAAOy4U,yBAAyBl3P,EAAQ//E,cAAsBo2K,EAmMlf0hK,CAAAA,GAAkBn4U,EAAAA,CAErCsjN,MAAO,EAEP80H,eAAe,UA/LuDZ,EAAkBC,EAAYzuO,UAAW2uO,GAAiBC,GAAaJ,EAAkBC,EAAaG,GAoM3KjI,EAtLFhxU,4DC1BP,gCAuDA,SAAA05U,EAA6B1tO,EAAM7F,GACjCwzO,EAAY3tO,EAAM7F,GAClByzO,EAAY5tO,GAGd,SAAA4tO,EAAqB5tO,GACfA,EAAKgpO,iBAAmBhpO,EAAKgpO,eAAerC,WAC5C3mO,EAAKgnO,iBAAmBhnO,EAAKgnO,eAAeL,WAChD3mO,EAAKu5E,KAAK,SAsBZ,SAAAo0J,EAAqB3tO,EAAM7F,GACzB6F,EAAKu5E,KAAK,QAASp/E,GAcrBpmG,EAAOC,QAAAA,CACLg6M,QAnGF,SAAiB7zG,EAAK4mD,OAChBrqC,EAAQhW,KAERmtO,EAAoBntO,KAAKsmO,gBAAkBtmO,KAAKsmO,eAAe19I,UAC/DwkJ,EAAoBptO,KAAKsoO,gBAAkBtoO,KAAKsoO,eAAe1/I,iBAE/DukJ,GAAqBC,GACnB/sL,EACFA,EAAG5mD,GACMA,IACJuG,KAAKsoO,eAEEtoO,KAAKsoO,eAAe+E,eAC9BrtO,KAAKsoO,eAAe+E,cAAe,EACnCv7I,EAAQla,SAASq1J,EAAajtO,KAAMvG,IAHpCq4F,EAAQla,SAASq1J,EAAajtO,KAAMvG,IAOjCuG,OAKLA,KAAKsmO,iBACPtmO,KAAKsmO,eAAe19I,WAAY,GAI9B5oF,KAAKsoO,iBACPtoO,KAAKsoO,eAAe1/I,WAAY,GAGlC5oF,KAAKymO,SAAShtO,GAAO,MAAM,SAAUA,IAC9B4mD,GAAM5mD,EACJuc,EAAMsyN,eAECtyN,EAAMsyN,eAAe+E,aAI/Bv7I,EAAQla,SAASs1J,EAAal3N,IAH9BA,EAAMsyN,eAAe+E,cAAe,EACpCv7I,EAAQla,SAASo1J,EAAqBh3N,EAAOvc,IAH7Cq4F,EAAQla,SAASo1J,EAAqBh3N,EAAOvc,GAOtC4mD,GACTyxC,EAAQla,SAASs1J,EAAal3N,GAC9BqqC,EAAG5mD,IAEHq4F,EAAQla,SAASs1J,EAAal3N,MAI3BhW,OAkDPonO,UApCF,WACMpnO,KAAKsmO,iBACPtmO,KAAKsmO,eAAe19I,WAAY,EAChC5oF,KAAKsmO,eAAeZ,SAAU,EAC9B1lO,KAAKsmO,eAAep7J,OAAQ,EAC5BlrE,KAAKsmO,eAAeb,YAAa,GAG/BzlO,KAAKsoO,iBACPtoO,KAAKsoO,eAAe1/I,WAAY,EAChC5oF,KAAKsoO,eAAep9J,OAAQ,EAC5BlrE,KAAKsoO,eAAegF,QAAS,EAC7BttO,KAAKsoO,eAAeiF,aAAc,EAClCvtO,KAAKsoO,eAAekF,aAAc,EAClCxtO,KAAKsoO,eAAe5E,UAAW,EAC/B1jO,KAAKsoO,eAAe+E,cAAe,IAsBrCtI,eAdF,SAAwBv0G,EAAQ/2H,OAM1Bg0O,EAASj9G,EAAO81G,eAChB+B,EAAS73G,EAAO83G,eAChBmF,GAAUA,EAAOvH,aAAemC,GAAUA,EAAOnC,YAAa11G,EAAOljB,QAAQ7zG,GAAU+2H,EAAO33C,KAAK,QAASp/E,kDCjGlH,aAEA,IAAAi0O,EAAAn6U,EAAA,mBAAAsoO,MAAA6xG,sBAsBAr6U,EAAAC,QAAA,CACAmxU,iBAjBA,SAAA37M,EAAAn0H,EAAAg5U,EAAAzI,GACA,IAAA0I,EALA,SAAAj5U,EAAAuwU,EAAAyI,GACA,OAAA,MAAAh5U,EAAA0wU,cAAA1wU,EAAA0wU,cAAAH,EAAAvwU,EAAAg5U,GAAA,KAIAE,CAAAl5U,EAAAuwU,EAAAyI,GAEA,GAAA,MAAAC,EAAA,CACA,IAAAloF,SAAAkoF,IAAAhoQ,KAAA6nC,MAAAmgO,KAAAA,GAAAA,EAAA,EAEA,MAAA,IAAAF,EADAxI,EAAAyI,EAAA,gBACAC,GAGA,OAAAhoQ,KAAA6nC,MAAAmgO,GAIA,OAAA9kN,EAAAq8M,WAAA,GAAA,+DCrBA,aAIA,IAAAtpG,EAAA,GAEA,SAAAiyG,EAAAz4U,EAAAskF,EAAAojJ,GACAA,IACAA,EAAAjkI,OAWA,IAAAi1O,EAEA,SAAAC,GAnBA,IAAAC,EAAAvyM,EAsBA,SAAAqyM,EAAAG,EAAAC,EAAAC,GACA,OAAAJ,EAAApwO,KAAAoC,KAdA,SAAAkuO,EAAAC,EAAAC,GACA,MAAA,iBAAAz0P,EACAA,EAEAA,EAAAu0P,EAAAC,EAAAC,GAUAC,CAAAH,EAAAC,EAAAC,KAAApuO,KAGA,OA1BA07B,EAoBAsyM,GApBAC,EAoBAF,GApBApwO,UAAAnqG,OAAAU,OAAAwnI,EAAA/9B,WAAAswO,EAAAtwO,UAAAgP,YAAAshO,EAAAA,EAAA9qH,UAAAznF,EA0BAqyM,EAPA,CAQAhxG,GAEAgxG,EAAApwO,UAAA9qG,KAAAkqO,EAAAlqO,KACAk7U,EAAApwO,UAAAtoG,KAAAA,EACAwmO,EAAAxmO,GAAA04U,EAIA,SAAAO,EAAAt3P,EAAAu3P,GACA,GAAA1wO,MAAA/gB,QAAA9F,GAAA,CACA,IAAAosB,EAAApsB,EAAA/R,OAKA,OAJA+R,EAAAA,EAAA5M,KAAA,SAAAjD,GACA,OAAAd,OAAAc,MAGAi8B,EAAA,EACA,UAAAvR,OAAA08O,EAAA,KAAA18O,OAAA7a,EAAA5R,MAAA,EAAAg+B,EAAA,GAAA94B,KAAA,MAAA,SAAA0M,EAAAosB,EAAA,GACA,IAAAA,EACA,UAAAvR,OAAA08O,EAAA,KAAA18O,OAAA7a,EAAA,GAAA,QAAA6a,OAAA7a,EAAA,IAEA,MAAA6a,OAAA08O,EAAA,KAAA18O,OAAA7a,EAAA,IAGA,MAAA,MAAA6a,OAAA08O,EAAA,KAAA18O,OAAAxrB,OAAA2Q,IA+BA82P,EAAA,yBAAA,SAAAj7U,EAAAa,GACA,MAAA,cAAAA,EAAA,4BAAAb,EAAA,MACAkyG,WACA+oO,EAAA,wBAAA,SAAAj7U,EAAAmkF,EAAAu3O,GAEA,IAAAigB,EA/BAviO,EAAAr0B,EAwCAnI,EAEA,GATA,iBAAAuH,IAjCAi1B,EAiCA,OAAAj1B,EAhCAnR,QAAA+R,GAAAA,EAAA,EAAA,GAAAA,EAAAq0B,EAAAhnC,UAAAgnC,IAiCAuiO,EAAA,cACAx3P,EAAAA,EAAAkC,QAAA,QAAA,KAEAs1P,EAAA,UAhCA,SAAAh5O,EAAAyW,EAAAwiO,GAKA,YAJA/4U,IAAA+4U,GAAAA,EAAAj5O,EAAAvwB,UACAwpQ,EAAAj5O,EAAAvwB,QAGAuwB,EAAAsG,UAAA2yO,EAAAxiO,EAAAhnC,OAAAwpQ,KAAAxiO,EAgCAlmC,CAAAlzE,EAAA,aAEA48E,EAAA,OAAAoiB,OAAAh/F,EAAA,KAAAg/F,OAAA28O,EAAA,KAAA38O,OAAAy8O,EAAAt3P,EAAA,aACA,CACA,IAAAlQ,EAhCA,SAAA0uB,EAAAyW,EAAAj3B,GAKA,MAJA,iBAAAA,IACAA,EAAA,KAGAA,EAAAi3B,EAAAhnC,OAAAuwB,EAAAvwB,UAGA,IAAAuwB,EAAAhqB,QAAAygC,EAAAj3B,GAwBAvG,CAAA57E,EAAA,KAAA,WAAA,WACA48E,EAAA,QAAAoiB,OAAAh/F,EAAA,MAAAg/F,OAAA/qB,EAAA,KAAA+qB,OAAA28O,EAAA,KAAA38O,OAAAy8O,EAAAt3P,EAAA,SAIA,OADAvH,GAAA,mBAAAoiB,cAAA08N,KAEAxpN,WACA+oO,EAAA,4BAAA,2BACAA,EAAA,8BAAA,SAAAj7U,GACA,MAAA,OAAAA,EAAA,gCAEAi7U,EAAA,6BAAA,mBACAA,EAAA,wBAAA,SAAAj7U,GACA,MAAA,eAAAA,EAAA,mCAEAi7U,EAAA,wBAAA,kCACAA,EAAA,yBAAA,6BACAA,EAAA,6BAAA,mBACAA,EAAA,yBAAA,sCAAA/oO,WACA+oO,EAAA,wBAAA,SAAA1mQ,GACA,MAAA,qBAAAA,IACA29B,WACA+oO,EAAA,qCAAA,oCACAz6U,EAAAC,QAAAuoO,MAAAA,8BCtGA,gCAGI6yG,EAAal7U,OAAOW,MAAAA,SAAkB0qG,OACpC1qG,EAAAA,WAEKa,KAAO6pG,EACd1qG,EAAK22E,KAAK91E,UAGLb,GAKTd,EAAOC,QAAUkwU,MAEbF,EAAW/vU,EAAQ,sBAEnBgwU,EAAWhwU,EAAQ,sBAEvBA,EAAQ,WAARA,CAAoBiwU,EAAQF,WAItBnvU,EAAOu6U,EAAWnL,EAAS5lO,WAEtBmnE,EAAI,EAAGA,EAAI3wK,EAAK8wE,OAAQ6/F,IAAAA,KAC3B1nC,EAASjpI,EAAK2wK,GACb0+J,EAAO7lO,UAAUy/B,KAASomM,EAAO7lO,UAAUy/B,GAAUmmM,EAAS5lO,UAAUy/B,IAIjF,SAAAomM,EAAgB7uU,QACRqrG,gBAAgBwjO,GAAAA,OAAAA,IAAoBA,EAAO7uU,GACjD2uU,EAAS1lO,KAAKoC,KAAMrrG,GACpB4uU,EAAS3lO,KAAKoC,KAAMrrG,GACpBqrG,KAAK2uO,eAAgB,EAEjBh6U,KACuB,IAArBA,EAAQ4xU,WAAoBvmO,KAAKumO,UAAW,IACvB,IAArB5xU,EAAQwhO,WAAoBn2H,KAAKm2H,UAAW,IAElB,IAA1BxhO,EAAQg6U,gBACV3uO,KAAK2uO,eAAgB,EACrB3uO,KAAK4mH,KAAK,MAAOkiH,KAiCvB,SAAAA,IAEM9oO,KAAKsoO,eAAep9J,OAGxB4mB,EAAQla,SAASg3J,EAAS5uO,MAG5B,SAAA4uO,EAAiBtvO,GACfA,EAAKt6B,MArCPxxE,OAAOC,eAAe+vU,EAAO7lO,UAAW,wBAAA,CAItCoB,YAAY,EACZvd,IAAK,kBACIwe,KAAKsoO,eAAejD,iBAG/B7xU,OAAOC,eAAe+vU,EAAO7lO,UAAW,iBAAA,CAItCoB,YAAY,EACZvd,IAAK,kBACIwe,KAAKsoO,gBAAkBtoO,KAAKsoO,eAAeuG,eAGtDr7U,OAAOC,eAAe+vU,EAAO7lO,UAAW,iBAAA,CAItCoB,YAAY,EACZvd,IAAK,kBACIwe,KAAKsoO,eAAerjQ,UAgB/BzxE,OAAOC,eAAe+vU,EAAO7lO,UAAW,YAAA,CAItCoB,YAAY,EACZvd,IAAK,uBACyB9rF,IAAxBsqG,KAAKsmO,qBAAwD5wU,IAAxBsqG,KAAKsoO,iBAIvCtoO,KAAKsmO,eAAe19I,WAAa5oF,KAAKsoO,eAAe1/I,YAE9DnnG,IAAK,SAAa/tF,QAGYgC,IAAxBsqG,KAAKsmO,qBAAwD5wU,IAAxBsqG,KAAKsoO,iBAM9CtoO,KAAKsmO,eAAe19I,UAAYl1L,EAChCssG,KAAKsoO,eAAe1/I,UAAYl1L,8HCjHpC,iBA6BI8vU,gCAfJ,SAAAsL,EAAuBhmN,OACjB9S,EAAQhW,KAEZA,KAAK5iB,KAAO,KACZ4iB,KAAK+1E,MAAQ,KAEb/1E,KAAKy5H,OAAS,WACZs1G,EAAe/4N,EAAO8S,IAnB1Bz1H,EAAOC,QAAUiwU,EA8BjBA,EAASyL,cAAgBA,MAGrBC,EAAAA,CACFC,UAAW37U,EAAQ,mBAMjB8vU,EAAS9vU,EAAQ,6BAIjB0vP,EAAS1vP,EAAQ,UAAU0vP,OAE3B6gF,EAAgBtkO,EAAOi5H,YAAAA,aAE3B,SAAAsrG,EAA6Bt0N,UACpBwzI,EAAOx5F,KAAKh6C,GAGrB,SAAAu0N,EAAuBnlO,UACdokJ,EAAO8H,SAASlsJ,IAAQA,aAAeilO,MAqI5CqL,EAlIA5K,EAAchxU,EAAQ,8BAEtBixU,EAAWjxU,EAAQ,4BACnBkxU,EAAmBD,EAASC,iBAE5BC,EAAiBnxU,EAAQ,aAAasoO,MACtC8oG,EAAuBD,EAAeC,qBACtCE,EAA6BH,EAAeG,2BAC5CuK,EAAwB1K,EAAe0K,sBACvCC,EAAyB3K,EAAe2K,uBACxCC,EAAuB5K,EAAe4K,qBACtCC,EAAyB7K,EAAe6K,uBACxCC,EAA6B9K,EAAe8K,2BAC5CC,EAAuB/K,EAAe+K,qBAEtC1K,EAAiBR,EAAYQ,eAIjC,SAAA2K,KAEA,SAAAV,EAAuBr6U,EAAS67N,EAAQ00G,GACtC1B,EAASA,GAAUjwU,EAAQ,oBAC3BoB,EAAUA,GAAAA,GAMc,kBAAbuwU,IAAwBA,EAAW10G,aAAkBgzG,GAGhExjO,KAAKmlO,aAAexwU,EAAQwwU,WACxBD,IAAUllO,KAAKmlO,WAAanlO,KAAKmlO,cAAgBxwU,EAAQg7U,oBAI7D3vO,KAAKqlO,cAAgBZ,EAAiBzkO,KAAMrrG,EAAS,wBAAyBuwU,GAE9EllO,KAAKutO,aAAc,EAEnBvtO,KAAKwpO,WAAY,EAEjBxpO,KAAKstO,QAAS,EAEdttO,KAAKkrE,OAAQ,EAEblrE,KAAK0jO,UAAW,EAEhB1jO,KAAK4oF,WAAY,MAIbgnJ,GAAqC,IAA1Bj7U,EAAQk7U,cACvB7vO,KAAK6vO,eAAiBD,EAItB5vO,KAAKmmO,gBAAkBxxU,EAAQwxU,iBAAmB,OAIlDnmO,KAAK/6B,OAAS,EAEd+6B,KAAK8vO,SAAU,EAEf9vO,KAAK+vO,OAAS,EAKd/vO,KAAK2lO,MAAO,EAIZ3lO,KAAKgwO,kBAAmB,EAExBhwO,KAAKiwO,QAAU,SAAUpJ,GACvBoJ,EAAQz/G,EAAQq2G,IAIlB7mO,KAAKkwO,QAAU,KAEflwO,KAAKmwO,SAAW,EAChBnwO,KAAKowO,gBAAkB,KACvBpwO,KAAKqwO,oBAAsB,KAG3BrwO,KAAKswO,UAAY,EAGjBtwO,KAAKwtO,aAAc,EAEnBxtO,KAAKqtO,cAAe,EAEpBrtO,KAAKimO,WAAkC,IAAtBtxU,EAAQsxU,UAEzBjmO,KAAKkmO,cAAgBvxU,EAAQuxU,YAE7BlmO,KAAKuwO,qBAAuB,EAG5BvwO,KAAKwwO,mBAAAA,IAAyB1B,EAAc9uO,MA4C9C,SAAAujO,EAAkB5uU,OAUZuwU,EAAWllO,gBATfwjO,EAASA,GAAUjwU,EAAQ,yBAUtB2xU,IAAaiK,EAAgBvxO,KAAK2lO,EAAUvjO,MAAA,OAAA,IAAkBujO,EAAS5uU,GAC5EqrG,KAAKsoO,eAAAA,IAAqB0G,EAAcr6U,EAASqrG,KAAMklO,GAEvDllO,KAAKm2H,UAAW,EAEZxhO,IAC2B,mBAAlBA,EAAQgwP,QAAsB3kJ,KAAKywO,OAAS97U,EAAQgwP,OACjC,mBAAnBhwP,EAAQ+7U,SAAuB1wO,KAAK2wO,QAAUh8U,EAAQ+7U,QAClC,mBAApB/7U,EAAQ24M,UAAwBttG,KAAKymO,SAAW9xU,EAAQ24M,SACtC,mBAAlB34M,EAAQi8U,QAAsB5wO,KAAKkiO,OAASvtU,EAAQi8U,QAGjEvN,EAAOzlO,KAAKoC,MAQd,SAAA6wO,EAAuBrgH,EAAQnwE,OACzBwmL,EAAAA,IAAS2I,EAEbzK,EAAev0G,EAAQq2G,GACvB/0I,EAAQla,SAASv3B,EAAIwmL,GAMvB,SAAAiK,EAAoBtgH,EAAQ1nG,EAAOrZ,EAAO4wC,OACpCwmL,SAEU,OAAVp3N,EACFo3N,EAAAA,IAAS0I,EACiB,iBAAV9/N,GAAuBqZ,EAAMq8M,aAC7C0B,EAAAA,IAASlC,EAAqB,QAAA,CAAU,SAAU,UAAWl1N,KAG3Do3N,IACF9B,EAAev0G,EAAQq2G,GACvB/0I,EAAQla,SAASv3B,EAAIwmL,IACd,GA6DX,SAAAkK,EAAqBjoN,EAAOrZ,EAAO8sH,UAC5BzzG,EAAMq8M,aAAsC,IAAxBr8M,EAAM+mN,eAA4C,iBAAVpgO,IAC/DA,EAAQwzI,EAAOx5F,KAAKh6C,EAAO8sH,IAGtB9sH,EAeT,SAAAuhO,EAAuBxgH,EAAQ1nG,EAAOmoN,EAAOxhO,EAAO8sH,EAAUl8E,OACvD4wL,EAAAA,KACCC,EAAWH,EAAYjoN,EAAOrZ,EAAO8sH,GAErC9sH,IAAUyhO,IACZD,GAAQ,EACR10G,EAAW,SACX9sH,EAAQyhO,OAIR9tO,EAAM0lB,EAAMq8M,WAAa,EAAI11N,EAAMxqC,OACvC6jD,EAAM7jD,QAAUm+B,MACZjX,EAAM28B,EAAM7jD,OAAS6jD,EAAMu8M,iBAE1Bl5O,IAAK28B,EAAM0gN,WAAY,GAExB1gN,EAAMgnN,SAAWhnN,EAAMinN,OAAAA,KACrBh0P,EAAO+sC,EAAMunN,oBACjBvnN,EAAMunN,oBAAAA,CACJ5gO,MAAOA,EACP8sH,SAAUA,EACV00G,MAAOA,EACP52K,SAAUha,EACVjjE,KAAM,MAGJrB,EACFA,EAAKqB,KAAO0rC,EAAMunN,oBAElBvnN,EAAMsnN,gBAAkBtnN,EAAMunN,oBAGhCvnN,EAAMynN,sBAAwB,OAE9BY,EAAQ3gH,EAAQ1nG,GAAO,EAAO1lB,EAAKqM,EAAO8sH,EAAUl8E,UAG/Cl0D,EAGT,SAAAglP,EAAiB3gH,EAAQ1nG,EAAO4nN,EAAQttO,EAAKqM,EAAO8sH,EAAUl8E,GAC5Dv3B,EAAMqnN,SAAW/sO,EACjB0lB,EAAMonN,QAAU7vL,EAChBv3B,EAAMgnN,SAAU,EAChBhnN,EAAM68M,MAAO,EACT78M,EAAM8/D,UAAW9/D,EAAMmnN,QAAAA,IAAYX,EAAqB,UAAmBoB,EAAQlgH,EAAOmgH,QAAQlhO,EAAOqZ,EAAMmnN,SAAcz/G,EAAOigH,OAAOhhO,EAAO8sH,EAAUzzG,EAAMmnN,SACtKnnN,EAAM68M,MAAO,EAGf,SAAAyL,EAAsB5gH,EAAQ1nG,EAAO68M,EAAMkB,EAAIxmL,KAC3Cv3B,EAAMwnN,UAEJ3K,GAGF7zI,EAAQla,SAASv3B,EAAIwmL,GAGrB/0I,EAAQla,SAASy5J,EAAa7gH,EAAQ1nG,GACtC0nG,EAAO83G,eAAe+E,cAAe,EACrCtI,EAAev0G,EAAQq2G,KAIvBxmL,EAAGwmL,GACHr2G,EAAO83G,eAAe+E,cAAe,EACrCtI,EAAev0G,EAAQq2G,GAGvBwK,EAAY7gH,EAAQ1nG,IAIxB,SAAAwoN,EAA4BxoN,GAC1BA,EAAMgnN,SAAU,EAChBhnN,EAAMonN,QAAU,KAChBpnN,EAAM7jD,QAAU6jD,EAAMqnN,SACtBrnN,EAAMqnN,SAAW,EAGnB,SAAAF,EAAiBz/G,EAAQq2G,OACnB/9M,EAAQ0nG,EAAO83G,eACf3C,EAAO78M,EAAM68M,KACbtlL,EAAKv3B,EAAMonN,WACG,mBAAP7vL,EAAO,MAAA,IAAsB+uL,KACxCkC,EAAmBxoN,GACf+9M,EAAIuK,EAAa5gH,EAAQ1nG,EAAO68M,EAAMkB,EAAIxmL,OAAAA,KAExCqjL,EAAW6N,EAAWzoN,IAAU0nG,EAAO5nC,UAEtC86I,GAAa56M,EAAMinN,QAAWjnN,EAAMknN,mBAAoBlnN,EAAMsnN,iBACjEoB,EAAYhhH,EAAQ1nG,GAGlB68M,EACF7zI,EAAQla,SAAS65J,EAAYjhH,EAAQ1nG,EAAO46M,EAAUrjL,GAEtDoxL,EAAWjhH,EAAQ1nG,EAAO46M,EAAUrjL,IAK1C,SAAAoxL,EAAoBjhH,EAAQ1nG,EAAO46M,EAAUrjL,GACtCqjL,GAAUgO,EAAalhH,EAAQ1nG,GACpCA,EAAMwnN,YACNjwL,IACAgxL,EAAY7gH,EAAQ1nG,GAMtB,SAAA4oN,EAAsBlhH,EAAQ1nG,GACP,IAAjBA,EAAM7jD,QAAgB6jD,EAAM0gN,YAC9B1gN,EAAM0gN,WAAY,EAClBh5G,EAAO33C,KAAK,UAKhB,SAAA24J,EAAqBhhH,EAAQ1nG,GAC3BA,EAAMknN,kBAAmB,MACrBj6J,EAAQjtD,EAAMsnN,mBAEd5/G,EAAOmgH,SAAW56J,GAASA,EAAM34F,KAAAA,KAE/B2L,EAAI+/B,EAAMynN,qBACV1gI,EAAAA,IAAahyG,MAAM9U,GACnB4oP,EAAS7oN,EAAM0nN,mBACnBmB,EAAO57J,MAAQA,UACXxyF,EAAQ,EACRquP,GAAa,EAEV77J,GACL85B,EAAOtsH,GAASwyF,EACXA,EAAMk7J,QAAOW,GAAa,GAC/B77J,EAAQA,EAAM34F,KACdmG,GAAS,EAGXssH,EAAO+hI,WAAaA,EACpBT,EAAQ3gH,EAAQ1nG,GAAO,EAAMA,EAAM7jD,OAAQ4qI,EAAQ,GAAI8hI,EAAOl4G,QAG9D3wG,EAAMwnN,YACNxnN,EAAMunN,oBAAsB,KAExBsB,EAAOv0P,MACT0rC,EAAM0nN,mBAAqBmB,EAAOv0P,KAClCu0P,EAAOv0P,KAAO,MAEd0rC,EAAM0nN,mBAAAA,IAAyB1B,EAAchmN,GAG/CA,EAAMynN,qBAAuB,YAGtBx6J,GAAAA,KACDtmE,EAAQsmE,EAAMtmE,MACd8sH,EAAWxmD,EAAMwmD,SACjBl8E,EAAK01B,EAAM1b,YAEf82K,EAAQ3gH,EAAQ1nG,GAAO,EADbA,EAAMq8M,WAAa,EAAI11N,EAAMxqC,OACJwqC,EAAO8sH,EAAUl8E,GACpD01B,EAAQA,EAAM34F,KACd0rC,EAAMynN,uBAKFznN,EAAMgnN,cAKE,OAAV/5J,IAAgBjtD,EAAMunN,oBAAsB,MAGlDvnN,EAAMsnN,gBAAkBr6J,EACxBjtD,EAAMknN,kBAAmB,EA2C3B,SAAAuB,EAAoBzoN,UACXA,EAAMwkN,QAA2B,IAAjBxkN,EAAM7jD,QAA0C,OAA1B6jD,EAAMsnN,kBAA6BtnN,EAAM46M,WAAa56M,EAAMgnN,QAG3G,SAAA+B,EAAmBrhH,EAAQ1nG,GACzB0nG,EAAO0xG,QAAO,SAAUzoO,GACtBqvB,EAAMwnN,YAEF72O,GACFsrO,EAAev0G,EAAQ/2H,GAGzBqvB,EAAM0kN,aAAc,EACpBh9G,EAAO33C,KAAK,aACZw4J,EAAY7gH,EAAQ1nG,MAIxB,SAAAgpN,EAAmBthH,EAAQ1nG,GACpBA,EAAM0kN,aAAgB1kN,EAAMykN,cACF,mBAAlB/8G,EAAO0xG,QAA0Bp5M,EAAM8/D,WAKhD9/D,EAAM0kN,aAAc,EACpBh9G,EAAO33C,KAAK,eALZ/vD,EAAMwnN,YACNxnN,EAAMykN,aAAc,EACpBz7I,EAAQla,SAASi6J,EAAWrhH,EAAQ1nG,KAQ1C,SAAAuoN,EAAqB7gH,EAAQ1nG,OACvBipN,EAAOR,EAAWzoN,MAElBipN,IACFD,EAAUthH,EAAQ1nG,GAEM,IAApBA,EAAMwnN,YACRxnN,EAAM46M,UAAW,EACjBlzG,EAAO33C,KAAK,UAER/vD,EAAMo9M,cAAAA,KAGJuH,EAASj9G,EAAO81G,iBAEfmH,GAAUA,EAAOvH,aAAeuH,EAAOhI,aAC1Cj1G,EAAOljB,iBAMRykI,EAGT,SAAAC,EAAqBxhH,EAAQ1nG,EAAOu3B,GAClCv3B,EAAMwkN,QAAS,EACf+D,EAAY7gH,EAAQ1nG,GAEhBu3B,IACEv3B,EAAM46M,SAAU5xI,EAAQla,SAASv3B,GAASmwE,EAAO5J,KAAK,SAAUvmE,IAGtEv3B,EAAMoiD,OAAQ,EACdslD,EAAO2F,UAAW,EAGpB,SAAA44G,EAAwBkD,EAASnpN,EAAOrvB,OAClCs8E,EAAQk8J,EAAQl8J,UACpBk8J,EAAQl8J,MAAQ,KAETA,GAAAA,KACD11B,EAAK01B,EAAM1b,SACfvxC,EAAMwnN,YACNjwL,EAAG5mD,GACHs8E,EAAQA,EAAM34F,KAIhB0rC,EAAM0nN,mBAAmBpzP,KAAO60P,EAtjBlC1+U,EAAQ,WAARA,CAAoBgwU,EAAUF,GAyF9B2L,EAAcrxO,UAAUkxO,UAAY,mBAC9Bn/L,EAAU1vC,KAAKowO,gBACfrvM,EAAAA,GAEG2O,GACL3O,EAAIj2D,KAAK4kE,GACTA,EAAUA,EAAQtyD,YAGb2jD,kBAKLvtI,OAAOC,eAAeu7U,EAAcrxO,UAAW,SAAA,CAC7Cnc,IAAKytP,EAAaC,WAAU,kBACnBlvO,KAAK6uO,cACX,6EAAmF,mBAEjF1zP,QAOW,mBAAXjlF,QAAyBA,OAAOg8U,aAAiE,mBAA3Cr8U,SAAS8nG,UAAUznG,OAAOg8U,cACzF/C,EAAkBt5U,SAAS8nG,UAAUznG,OAAOg8U,aAC5C1+U,OAAOC,eAAe8vU,EAAUrtU,OAAOg8U,YAAAA,CACrCx+U,MAAO,SAAewiI,WAChBi5M,EAAgBvxO,KAAKoC,KAAMk2B,IAC3Bl2B,OAASujO,IACNrtM,GAAUA,EAAOoyM,0BAA0B0G,OAItDG,EAAkB,SAAyBj5M,UAClCA,aAAkBl2B,MA+B7BujO,EAAS5lO,UAAU8qO,KAAO,WACxB1D,EAAe/kO,KAAA,IAAUqvO,IA+B3B9L,EAAS5lO,UAAUgnJ,MAAQ,SAAUl1I,EAAO8sH,EAAUl8E,OAChDv3B,EAAQ9oB,KAAKsoO,eACbn8O,GAAM,EAEN8kP,GAASnoN,EAAMq8M,YAAcnB,EAAcv0N,UAE3CwhO,IAAUhuF,EAAO8H,SAASt7I,KAC5BA,EAAQs0N,EAAoBt0N,IAGN,mBAAb8sH,IACTl8E,EAAKk8E,EACLA,EAAW,MAGT00G,EAAO10G,EAAW,SAAmBA,IAAUA,EAAWzzG,EAAMq9M,iBAClD,mBAAP9lL,IAAmBA,EAAKqvL,GAC/B5mN,EAAMwkN,OAAQuD,EAAc7wO,KAAMqgD,IAAa4wL,GAASH,EAAW9wO,KAAM8oB,EAAOrZ,EAAO4wC,MACzFv3B,EAAMwnN,YACNnkP,EAAM6kP,EAAchxO,KAAM8oB,EAAOmoN,EAAOxhO,EAAO8sH,EAAUl8E,IAEpDl0D,GAGTo3O,EAAS5lO,UAAUw0O,KAAO,WACxBnyO,KAAKsoO,eAAeyH,UAGtBxM,EAAS5lO,UAAUy0O,OAAS,eACtBtpN,EAAQ9oB,KAAKsoO,eAEbx/M,EAAMinN,SACRjnN,EAAMinN,SACDjnN,EAAMgnN,SAAYhnN,EAAMinN,QAAWjnN,EAAMknN,mBAAoBlnN,EAAMsnN,iBAAiBoB,EAAYxxO,KAAM8oB,KAI/Gy6M,EAAS5lO,UAAU00O,mBAAqB,SAA4B91G,MAE1C,iBAAbA,IAAuBA,EAAWA,EAASnzJ,kBAC/C,MAAO,OAAQ,QAAS,QAAS,SAAU,SAAU,OAAQ,QAAS,UAAW,WAAY,OAAOoC,SAAS+wJ,EAAW,IAAInzJ,gBAAkB,GAAA,MAAA,IAAcqmQ,EAAqBlzG,UACxLv8H,KAAKsoO,eAAenC,gBAAkB5pG,EAC/Bv8H,MAGTxsG,OAAOC,eAAe8vU,EAAS5lO,UAAW,iBAAA,CAIxCoB,YAAY,EACZvd,IAAK,kBACIwe,KAAKsoO,gBAAkBtoO,KAAKsoO,eAAeuG,eAYtDr7U,OAAOC,eAAe8vU,EAAS5lO,UAAW,wBAAA,CAIxCoB,YAAY,EACZvd,IAAK,kBACIwe,KAAKsoO,eAAejD,iBA4L/B9B,EAAS5lO,UAAU8yO,OAAS,SAAUhhO,EAAO8sH,EAAUl8E,GACrDA,EAAAA,IAAOwkL,EAA2B,cAGpCtB,EAAS5lO,UAAUgzO,QAAU,KAE7BpN,EAAS5lO,UAAU34B,IAAM,SAAUyqC,EAAO8sH,EAAUl8E,OAC9Cv3B,EAAQ9oB,KAAKsoO,qBAEI,mBAAV74N,GACT4wC,EAAK5wC,EACLA,EAAQ,KACR8sH,EAAW,MACkB,mBAAbA,IAChBl8E,EAAKk8E,EACLA,EAAW,MAGT9sH,MAAAA,GAAuCzP,KAAK2kJ,MAAMl1I,EAAO8sH,GAEzDzzG,EAAMinN,SACRjnN,EAAMinN,OAAS,EACf/vO,KAAKoyO,UAIFtpN,EAAMwkN,QAAQ0E,EAAYhyO,KAAM8oB,EAAOu3B,GACrCrgD,MAGTxsG,OAAOC,eAAe8vU,EAAS5lO,UAAW,iBAAA,CAIxCoB,YAAY,EACZvd,IAAK,kBACIwe,KAAKsoO,eAAerjQ,UAuF/BzxE,OAAOC,eAAe8vU,EAAS5lO,UAAW,YAAA,CAIxCoB,YAAY,EACZvd,IAAK,uBACyB9rF,IAAxBsqG,KAAKsoO,gBAIFtoO,KAAKsoO,eAAe1/I,WAE7BnnG,IAAK,SAAa/tF,GAGXssG,KAAKsoO,iBAMVtoO,KAAKsoO,eAAe1/I,UAAYl1L,MAGpC6vU,EAAS5lO,UAAU2vG,QAAUi3H,EAAYj3H,QACzCi2H,EAAS5lO,UAAUwpO,WAAa5C,EAAY6C,UAE5C7D,EAAS5lO,UAAU8oO,SAAW,SAAUhtO,EAAK4mD,GAC3CA,EAAG5mD,wRC9pBL,SAAAy1O,EAAoBtqP,EAAInV,MAClB8K,EAAO,wBACFqK,MAGLimP,GAAS,SACb,eACOA,EAAAA,IACCtwP,EAAO,8BACCue,MAAMrpB,GACP8K,EAAO,oBAChBmgB,QAAQ26E,MAAM5lG,GAEdirB,QAAQs6E,KAAKvlG,GAEfo7P,GAAS,SAEJjmP,EAAGw+G,MAAMpjG,KAAM3pB,YAc1B,SAAAkE,EAAiB1nF,WAGR2sG,EAAO64J,aAAAA,OAAqB,QAC1Bl9K,UACA,MAELwe,EAAM6F,EAAO64J,aAAaxlQ,UAC1B,MAAQ8mG,GACyB,SAA9BtzB,OAAOszB,GAAKvwB,cA5DrB/1E,EAAOC,QAAU47U,gCCgBjB,iBAIIjsF,EAAS1vP,EAAQ,eAAe0vP,OAGhCqrE,EAAarrE,EAAOqrE,YAAAA,SAAwB/xF,WAC9CA,EAAW,GAAKA,IACIA,EAASnzJ,mBACtB,UAAW,WAAY,YAAa,YAAa,aAAc,aAAc,WAAY,YAAa,cAAe,eAAgB,aACjI,iBAEA,IA4Cb,SAAAg7P,EAAuB7nG,OAEjBowG,SADJ3sO,KAAKu8H,SAXP,SAA2BI,OACrB21G,EA/BN,SAA4B31G,OACrBA,EAAAA,MAAY,eACb41G,WAEM51G,OACD,WACA,cACI,WACJ,WACA,YACA,cACA,iBACI,cACJ,aACA,eACI,aACJ,aACA,YACA,aACIA,aAEH41G,EAAAA,OACJ51G,GAAO,GAAKA,GAAKvzJ,cACjBmpQ,GAAU,GAQLC,CAAmB71G,MACV,iBAAT21G,IAAsBrvF,EAAOqrE,aAAeA,IAAeA,EAAW3xF,IAAAA,MAAAA,IAAiB7jI,MAAM,qBAAuB6jI,UACxH21G,GAAQ31G,EAQC81G,CAAkBl2G,GAE1Bv8H,KAAKu8H,cACN,UACHv8H,KAAK7yB,KAAOulQ,EACZ1yO,KAAKh7B,IAAM2tQ,EACXhG,EAAK,YAEF,OACH3sO,KAAK4yO,SAAWC,EAChBlG,EAAK,YAEF,SACH3sO,KAAK7yB,KAAO2lQ,EACZ9yO,KAAKh7B,IAAM+tQ,EACXpG,EAAK,uBAGL3sO,KAAK2kJ,MAAQquF,OACbhzO,KAAKh7B,IAAMiuQ,GAGfjzO,KAAKkzO,SAAW,EAChBlzO,KAAKmzO,UAAY,EACjBnzO,KAAKozO,SAAWnwF,EAAOiE,YAAYylF,GAoCrC,SAAA0G,EAAuB9yB,UACjBA,GAAQ,IAAa,EAAWA,GAAQ,GAAM,EAAa,EAAWA,GAAQ,GAAM,GAAa,EAAWA,GAAQ,GAAM,GAAa,EACpIA,GAAQ,GAAM,GAAQ,GAAK,EA2DpC,SAAAsyB,EAAsBtiH,OAChBrpJ,EAAI84B,KAAKmzO,UAAYnzO,KAAKkzO,SAC1BllO,EAtBN,SAA6B1O,EAAMixH,EAAKrpJ,MACd,MAAV,IAATqpJ,EAAI,WACPjxH,EAAK4zO,SAAW,EACT,OAEL5zO,EAAK4zO,SAAW,GAAK3iH,EAAItrJ,OAAS,EAAA,IACZ,MAAV,IAATsrJ,EAAI,WACPjxH,EAAK4zO,SAAW,EACT,OAEL5zO,EAAK4zO,SAAW,GAAK3iH,EAAItrJ,OAAS,GACZ,MAAV,IAATsrJ,EAAI,WACPjxH,EAAK4zO,SAAW,EACT,KASLI,CAAoBtzO,KAAMuwH,eACxB76N,IAANs4G,EAAwBA,EACxBhO,KAAKkzO,UAAY3iH,EAAItrJ,QACvBsrJ,EAAItzN,KAAK+iG,KAAKozO,SAAUlsQ,EAAG,EAAG84B,KAAKkzO,UAC5BlzO,KAAKozO,SAASh1O,SAAS4B,KAAKu8H,SAAU,EAAGv8H,KAAKmzO,aAEvD5iH,EAAItzN,KAAK+iG,KAAKozO,SAAUlsQ,EAAG,EAAGqpJ,EAAItrJ,aAClC+6B,KAAKkzO,UAAY3iH,EAAItrJ,SA2BvB,SAAAytQ,EAAmBniH,EAAKppJ,OACjBopJ,EAAItrJ,OAASkC,GAAK,GAAM,EAAA,KACvB6mC,EAAIuiH,EAAInyH,SAAS,UAAWj3B,MAC5B6mC,EAAAA,KACEvhC,EAAIuhC,EAAE/1B,WAAW+1B,EAAE/oC,OAAS,MAC5BwH,GAAK,OAAUA,GAAK,aACtBuzB,KAAKkzO,SAAW,EAChBlzO,KAAKmzO,UAAY,EACjBnzO,KAAKozO,SAAS,GAAK7iH,EAAIA,EAAItrJ,OAAS,GACpC+6B,KAAKozO,SAAS,GAAK7iH,EAAIA,EAAItrJ,OAAS,GAC7B+oC,EAAE5oC,MAAM,GAAI,UAGhB4oC,SAEThO,KAAKkzO,SAAW,EAChBlzO,KAAKmzO,UAAY,EACjBnzO,KAAKozO,SAAS,GAAK7iH,EAAIA,EAAItrJ,OAAS,GAC7BsrJ,EAAInyH,SAAS,UAAWj3B,EAAGopJ,EAAItrJ,OAAS,GAKjD,SAAA0tQ,EAAkBpiH,OACZviH,EAAIuiH,GAAOA,EAAItrJ,OAAS+6B,KAAK2kJ,MAAMp0B,GAAO,MAC1CvwH,KAAKkzO,SAAAA,KACHluQ,EAAMg7B,KAAKmzO,UAAYnzO,KAAKkzO,gBACzBllO,EAAIhO,KAAKozO,SAASh1O,SAAS,UAAW,EAAGp5B,UAE3CgpC,EAGT,SAAA8kO,EAAoBviH,EAAKppJ,OACnBlzE,GAAKs8N,EAAItrJ,OAASkC,GAAK,SACjB,IAANlzE,EAAgBs8N,EAAInyH,SAAS,SAAUj3B,IAC3C64B,KAAKkzO,SAAW,EAAIj/U,EACpB+rG,KAAKmzO,UAAY,EACP,IAANl/U,EACF+rG,KAAKozO,SAAS,GAAK7iH,EAAIA,EAAItrJ,OAAS,IAEpC+6B,KAAKozO,SAAS,GAAK7iH,EAAIA,EAAItrJ,OAAS,GACpC+6B,KAAKozO,SAAS,GAAK7iH,EAAIA,EAAItrJ,OAAS,IAE/BsrJ,EAAInyH,SAAS,SAAUj3B,EAAGopJ,EAAItrJ,OAAShxE,IAGhD,SAAA8+U,EAAmBxiH,OACbviH,EAAIuiH,GAAOA,EAAItrJ,OAAS+6B,KAAK2kJ,MAAMp0B,GAAO,UAC1CvwH,KAAKkzO,SAAiBllO,EAAIhO,KAAKozO,SAASh1O,SAAS,SAAU,EAAG,EAAI4B,KAAKkzO,UACpEllO,EAIT,SAAAglO,EAAqBziH,UACZA,EAAInyH,SAAS4B,KAAKu8H,UAG3B,SAAA02G,EAAmB1iH,UACVA,GAAOA,EAAItrJ,OAAS+6B,KAAK2kJ,MAAMp0B,GAAO,GAzN/Cj9N,EAAQ8wU,cAAgBA,EA6BxBA,EAAczmO,UAAUgnJ,MAAQ,SAAUp0B,MACrB,IAAfA,EAAItrJ,OAAW,MAAU,OACzB+oC,EACA7mC,KACA64B,KAAKkzO,SAAAA,SAEGx9U,KADVs4G,EAAIhO,KAAK4yO,SAASriH,IACR76N,MAAkB,GAC5ByxE,EAAI64B,KAAKkzO,SACTlzO,KAAKkzO,SAAW,OAEhB/rQ,EAAI,SAEFA,EAAIopJ,EAAItrJ,OAAe+oC,EAAIA,EAAIhO,KAAK7yB,KAAKojJ,EAAKppJ,GAAK64B,KAAK7yB,KAAKojJ,EAAKppJ,GAC/D6mC,GAAK,IAGdo2N,EAAczmO,UAAU34B,IAwGxB,SAAiBurJ,OACXviH,EAAIuiH,GAAOA,EAAItrJ,OAAS+6B,KAAK2kJ,MAAMp0B,GAAO,UAC1CvwH,KAAKkzO,SAAiBllO,EAAI,IACvBA,GAxGTo2N,EAAczmO,UAAUxwB,KA0FxB,SAAkBojJ,EAAKppJ,OACjBioF,EArEN,SAA6B9vD,EAAMixH,EAAKppJ,OAClCmqB,EAAIi/H,EAAItrJ,OAAS,KACjBqsB,EAAInqB,EAAAA,OAAU,MACdwlQ,EAAK0G,EAAc9iH,EAAIj/H,OACvBq7O,GAAM,SACJA,EAAK,IAAGrtO,EAAK4zO,SAAWvG,EAAK,GAC1BA,OAEHr7O,EAAInqB,IAAa,IAARwlQ,EAAQ,OAAU,MACjCA,EAAK0G,EAAc9iH,EAAIj/H,MACb,SACJq7O,EAAK,IAAGrtO,EAAK4zO,SAAWvG,EAAK,GAC1BA,OAEHr7O,EAAInqB,IAAa,IAARwlQ,EAAQ,OAAU,MACjCA,EAAK0G,EAAc9iH,EAAIj/H,MACb,SACJq7O,EAAK,IACI,IAAPA,EAAUA,EAAK,EAAOrtO,EAAK4zO,SAAWvG,EAAK,GAE1CA,SAEF,EA+CK4G,CAAoBvzO,KAAMuwH,EAAKppJ,OACtC64B,KAAKkzO,SAAAA,OAAiB3iH,EAAInyH,SAAS,OAAQj3B,GAChD64B,KAAKmzO,UAAY/jL,MACbpqF,EAAMurJ,EAAItrJ,QAAUmqF,EAAQpvD,KAAKkzO,iBACrC3iH,EAAItzN,KAAK+iG,KAAKozO,SAAU,EAAGpuQ,GACpBurJ,EAAInyH,SAAS,OAAQj3B,EAAGnC,IA7FjCo/P,EAAczmO,UAAUi1O,SAAW,SAAUriH,MACvCvwH,KAAKkzO,UAAY3iH,EAAItrJ,cACvBsrJ,EAAItzN,KAAK+iG,KAAKozO,SAAUpzO,KAAKmzO,UAAYnzO,KAAKkzO,SAAU,EAAGlzO,KAAKkzO,UACzDlzO,KAAKozO,SAASh1O,SAAS4B,KAAKu8H,SAAU,EAAGv8H,KAAKmzO,WAEvD5iH,EAAItzN,KAAK+iG,KAAKozO,SAAUpzO,KAAKmzO,UAAYnzO,KAAKkzO,SAAU,EAAG3iH,EAAItrJ,QAC/D+6B,KAAKkzO,UAAY3iH,EAAItrJ,2DCtIvB,iBAEIuuQ,iBAEJ,SAAAtH,EAAyBrtO,EAAK7pG,EAAKtB,UAAasB,KAAO6pG,EAAOrrG,OAAOC,eAAeorG,EAAK7pG,EAAAA,CAAOtB,MAAOA,EAAOqrG,YAAY,EAAMD,cAAc,EAAMq3H,UAAU,IAAkBt3H,EAAI7pG,GAAOtB,EAAgBmrG,MAEvM6kO,EAAWnwU,EAAQ,mBAEnBkgV,EAAev9U,OAAO,eACtBw9U,EAAcx9U,OAAO,cACrBy9U,EAASz9U,OAAO,SAChB09U,EAAS19U,OAAO,SAChB29U,EAAe39U,OAAO,eACtB49U,EAAiB59U,OAAO,iBACxB69U,EAAU79U,OAAO,UAErB,SAAA89U,EAA0BtgV,EAAOo2K,UAE7Bp2K,MAAOA,EACPo2K,KAAMA,GAIV,SAAAmqK,EAAwBvjH,OAClB1qD,EAAU0qD,EAAK+iH,MAEH,OAAZztK,EAAY,KACVtZ,EAAOgkE,EAAKqjH,GAAS/iH,OAIZ,OAATtkE,IACFgkE,EAAKmjH,GAAgB,KACrBnjH,EAAK+iH,GAAgB,KACrB/iH,EAAKgjH,GAAe,KACpB1tK,EAAQguK,EAAiBtnL,GAAM,MAKrC,SAAAwnL,EAAoBxjH,GAGlB5+B,EAAQla,SAASq8J,EAAgBvjH,OAgB/ByjH,EAAyB3gV,OAAOywM,gBAAe,eAC/CmwI,EAAuC5gV,OAAO46T,gBA4D/C8d,EA5D+DsH,EAAAA,qBAEvDxzO,KAAK+zO,IAGd32P,KAAM,eACA44B,EAAQhW,KAIRzwB,EAAQywB,KAAK2zO,MAEH,OAAVpkQ,SACKw2F,QAAQw5B,OAAOhwH,MAGpBywB,KAAK4zO,UACA7tK,QAAQC,QAAQguK,OAAiBt+U,GAAW,OAGjDsqG,KAAK+zO,GAASnrJ,qBAKL7iB,SAAQ,SAAUC,EAASu5B,GACpCzN,EAAQla,UAAS,WACX5hE,EAAM29N,GACRp0I,EAAOvpF,EAAM29N,IAEb3tK,EAAQguK,OAAiBt+U,GAAW,cAWxC2/M,EADAg/H,EAAcr0O,KAAK6zO,MAGnBQ,EACFh/H,EAAAA,IAActvC,QA1DpB,SAAqBsuK,EAAa3jH,UACzB,SAAU1qD,EAASu5B,GACxB80I,EAAYp2O,MAAK,WACXyyH,EAAKkjH,GACP5tK,EAAQguK,OAAiBt+U,GAAW,IAItCg7N,EAAKojH,GAAgB9tK,EAASu5B,KAC7BA,IAiDqB+0I,CAAYD,EAAar0O,gBAI3C0sD,EAAO1sD,KAAK+zO,GAAS/iH,UAEZ,OAATtkE,SACKqZ,QAAQC,QAAQguK,EAAiBtnL,GAAM,IAGhD2oD,EAAAA,IAActvC,QAAQ/lE,KAAK8zO,WAG7B9zO,KAAK6zO,GAAgBx+H,EACdA,IAE+Bn/M,OAAOy6N,eAAe,kBACvD3wH,QACLksO,EAAgBsH,EAAuB,UAAU,eAC/Ce,EAASv0O,gBAKF+lE,SAAQ,SAAUC,EAASu5B,GACpCg1I,EAAOR,GAASzmI,QAAQ,MAAM,SAAU7zG,GAClCA,EACF8lG,EAAO9lG,GAITusE,EAAQguK,OAAiBt+U,GAAW,aAGtC89U,GAAwBW,GAoE5B9gV,EAAOC,QAlEiC,SAA2Ck9N,OAC7EgkH,EAEA/pL,EAAWj3J,OAAOU,OAAOkgV,GAA4DlI,EAArBsI,EAAAA,GAAqDT,EAAAA,CACvHrgV,MAAO88N,EACP2F,UAAU,IACR+1G,EAAgBsI,EAAgBf,EAAAA,CAClC//U,MAAO,KACPyiO,UAAU,IACR+1G,EAAgBsI,EAAgBd,EAAAA,CAClChgV,MAAO,KACPyiO,UAAU,IACR+1G,EAAgBsI,EAAgBb,EAAAA,CAClCjgV,MAAO,KACPyiO,UAAU,IACR+1G,EAAgBsI,EAAgBZ,EAAAA,CAClClgV,MAAO88N,EAAO81G,eAAeb,WAC7BtvG,UAAU,IACR+1G,EAAgBsI,EAAgBV,EAAAA,CAClCpgV,MAAO,SAAesyK,EAASu5B,OACzB7yC,EAAOjC,EAASspL,GAAS/iH,OAEzBtkE,GACFjC,EAASopL,GAAgB,KACzBppL,EAASgpL,GAAgB,KACzBhpL,EAASipL,GAAe,KACxB1tK,EAAQguK,EAAiBtnL,GAAM,MAE/BjC,EAASgpL,GAAgBztK,EACzBvb,EAASipL,GAAen0I,IAG5B42B,UAAU,IACRq+G,WACJ/pL,EAASopL,GAAgB,KACzBnQ,EAASlzG,GAAQ,SAAU/2H,MACrBA,GAAoB,+BAAbA,EAAIpkG,KAAS,KAClBkqM,EAAS90C,EAASipL,UAGP,OAAXn0I,IACF90C,EAASopL,GAAgB,KACzBppL,EAASgpL,GAAgB,KACzBhpL,EAASipL,GAAe,KACxBn0I,EAAO9lG,SAGTgxD,EAASkpL,GAAUl6O,OAIjBusE,EAAUvb,EAASgpL,GAEP,OAAZztK,IACFvb,EAASopL,GAAgB,KACzBppL,EAASgpL,GAAgB,KACzBhpL,EAASipL,GAAe,KACxB1tK,EAAQguK,OAAiBt+U,GAAW,KAGtC+0J,EAASmpL,IAAU,KAErBpjH,EAAOxiJ,GAAG,WAAYkmQ,EAAWv7O,KAAK,KAAM8xD,IACrCA,0ECzMT,aAEA,IAAAgqL,EAAAlhV,EAAA,mBAAAsoO,MAAA44G,2BAgBA,SAAArsI,eAMA,SAAAssI,EAAAlkH,EAAAzvD,EAAA1G,GACA,GAAA,mBAAA0G,EAAA,OAAA2zK,EAAAlkH,EAAA,KAAAzvD,GACAA,IAAAA,EAAA,IACA1G,EAvBA,SAAAA,GACA,IAAA6pB,GAAA,EACA,OAAA,WACA,IAAAA,EAAA,CACAA,GAAA,EAEA,IAAA,IAAAywJ,EAAAt+P,UAAApR,OAAAmR,EAAA,IAAAynB,MAAA82O,GAAA53O,EAAA,EAAAA,EAAA43O,EAAA53O,IACA3mB,EAAA2mB,GAAA1mB,UAAA0mB,GAGAs9D,EAAA+oC,MAAApjG,KAAA5pB,KAaAwwI,CAAAvsD,GAAA+tC,GACA,IAAAm+H,EAAAxlK,EAAAwlK,WAAA,IAAAxlK,EAAAwlK,UAAA/1G,EAAA+1G,SACApwG,EAAAp1D,EAAAo1D,WAAA,IAAAp1D,EAAAo1D,UAAA3F,EAAA2F,SAEAy+G,EAAA,WACApkH,EAAA2F,UAAAizG,KAGAyL,EAAArkH,EAAA83G,gBAAA93G,EAAA83G,eAAA5E,SAEA0F,EAAA,WACAjzG,GAAA,EACA0+G,GAAA,EACAtO,GAAAlsK,EAAAz8D,KAAA4yH,IAGAskH,EAAAtkH,EAAA81G,gBAAA91G,EAAA81G,eAAAb,WAEAqD,EAAA,WACAvC,GAAA,EACAuO,GAAA,EACA3+G,GAAA97D,EAAAz8D,KAAA4yH,IAGAgC,EAAA,SAAA/4H,GACA4gE,EAAAz8D,KAAA4yH,EAAA/2H,IAGA0vO,EAAA,WACA,IAAA1vO,EAEA,OAAA8sO,IAAAuO,GACAtkH,EAAA81G,gBAAA91G,EAAA81G,eAAAp7J,QAAAzxE,EAAA,IAAAg7O,GACAp6K,EAAAz8D,KAAA4yH,EAAA/2H,IAGA08H,IAAA0+G,GACArkH,EAAA83G,gBAAA93G,EAAA83G,eAAAp9J,QAAAzxE,EAAA,IAAAg7O,GACAp6K,EAAAz8D,KAAA4yH,EAAA/2H,SAFA,GAMAs7O,EAAA,WACAvkH,EAAA8oC,IAAAtrL,GAAA,SAAAo7P,IAiBA,OAnEA,SAAA54G,GACA,OAAAA,EAAAwkH,WAAA,mBAAAxkH,EAAAx9E,MAoDAiiM,CAAAzkH,GAIA2F,IAAA3F,EAAA83G,iBAEA93G,EAAAxiJ,GAAA,MAAA4mQ,GACApkH,EAAAxiJ,GAAA,QAAA4mQ,KANApkH,EAAAxiJ,GAAA,WAAAo7P,GACA54G,EAAAxiJ,GAAA,QAAAm7P,GACA34G,EAAA8oC,IAAAy7E,IAAAvkH,EAAAxiJ,GAAA,UAAA+mQ,IAOAvkH,EAAAxiJ,GAAA,MAAA86P,GACAt4G,EAAAxiJ,GAAA,SAAAo7P,IACA,IAAAroK,EAAAxxF,OAAAihJ,EAAAxiJ,GAAA,QAAAwkJ,GACAhC,EAAAxiJ,GAAA,QAAAm7P,GACA,WACA34G,EAAAgF,eAAA,WAAA4zG,GACA54G,EAAAgF,eAAA,QAAA2zG,GACA34G,EAAAgF,eAAA,UAAAu/G,GACAvkH,EAAA8oC,KAAA9oC,EAAA8oC,IAAA9jC,eAAA,SAAA4zG,GACA54G,EAAAgF,eAAA,MAAAo/G,GACApkH,EAAAgF,eAAA,QAAAo/G,GACApkH,EAAAgF,eAAA,SAAA4zG,GACA54G,EAAAgF,eAAA,MAAAszG,GACAt4G,EAAAgF,eAAA,QAAAhD,GACAhC,EAAAgF,eAAA,QAAA2zG,4DCnGA91U,EAAAC,QAAA,WACA,MAAA,IAAAwlG,MAAA,gFC4DA,aAEAzlG,EAAAC,QAAAyvU,EAEA,IAAA2B,EAAAnxU,EAAA,aAAAsoO,MACAgpG,EAAAH,EAAAG,2BACAuK,EAAA1K,EAAA0K,sBACA8F,EAAAxQ,EAAAwQ,mCACAC,EAAAzQ,EAAAyQ,4BAEA3R,EAAAjwU,EAAA,oBAIA,SAAA6hV,EAAAvO,EAAAn6K,GACA,IAAAiuH,EAAA36K,KAAAq1O,gBACA16D,EAAA26D,cAAA,EACA,IAAAj1L,EAAAs6H,EAAAu1D,QAEA,GAAA,OAAA7vL,EACA,OAAArgD,KAAA64E,KAAA,QAAA,IAAAu2J,GAGAz0D,EAAA46D,WAAA,KACA56D,EAAAu1D,QAAA,KACA,MAAAxjL,GACA1sD,KAAAl1B,KAAA4hF,GACArM,EAAAwmL,GACA,IAAA2O,EAAAx1O,KAAAsmO,eACAkP,EAAA9P,SAAA,GAEA8P,EAAA5P,cAAA4P,EAAAvwQ,OAAAuwQ,EAAAnQ,gBACArlO,KAAAwmO,MAAAgP,EAAAnQ,eAIA,SAAAtC,EAAApuU,GACA,KAAAqrG,gBAAA+iO,GAAA,OAAA,IAAAA,EAAApuU,GACA6uU,EAAA5lO,KAAAoC,KAAArrG,GACAqrG,KAAAq1O,gBAAA,CACAD,eAAAA,EAAAz8O,KAAAqH,MACAy1O,eAAA,EACAH,cAAA,EACApF,QAAA,KACAqF,WAAA,KACAG,cAAA,MAGA11O,KAAAsmO,eAAAV,cAAA,EAIA5lO,KAAAsmO,eAAAX,MAAA,EAEAhxU,IACA,mBAAAA,EAAAwvF,YAAA6b,KAAAkjO,WAAAvuU,EAAAwvF,WACA,mBAAAxvF,EAAA+rL,QAAA1gF,KAAAmjO,OAAAxuU,EAAA+rL,QAIA1gF,KAAAhyB,GAAA,YAAA8jQ,GAGA,SAAAA,IACA,IAAA97N,EAAAhW,KAEA,mBAAAA,KAAAmjO,QAAAnjO,KAAAsmO,eAAA19I,UAKA9e,EAAA9pE,KAAA,KAAA,MAJAA,KAAAmjO,QAAA,SAAA0D,EAAAn6K,GACAod,EAAA9zD,EAAA6wN,EAAAn6K,MA6DA,SAAAod,EAAA0mD,EAAAq2G,EAAAn6K,GACA,GAAAm6K,EAAA,OAAAr2G,EAAA33C,KAAA,QAAAguJ,GAMA,GALA,MAAAn6K,GACA8jE,EAAA1lJ,KAAA4hF,GAIA8jE,EAAA83G,eAAArjQ,OAAA,MAAA,IAAAkwQ,EACA,GAAA3kH,EAAA6kH,gBAAAC,aAAA,MAAA,IAAAJ,EACA,OAAA1kH,EAAA1lJ,KAAA,MA9HAv3E,EAAA,WAAAA,CAAAwvU,EAAAS,GA+DAT,EAAAplO,UAAA7yB,KAAA,SAAA2kC,EAAA8sH,GAEA,OADAv8H,KAAAq1O,gBAAAI,eAAA,EACAjS,EAAA7lO,UAAA7yB,KAAA8yB,KAAAoC,KAAAyP,EAAA8sH,IAaAwmG,EAAAplO,UAAAulO,WAAA,SAAAzzN,EAAA8sH,EAAAl8E,GACAA,EAAA,IAAAwkL,EAAA,kBAGA9B,EAAAplO,UAAA8yO,OAAA,SAAAhhO,EAAA8sH,EAAAl8E,GACA,IAAAs6H,EAAA36K,KAAAq1O,gBAKA,GAJA16D,EAAAu1D,QAAA7vL,EACAs6H,EAAA46D,WAAA9lO,EACAkrK,EAAA+6D,cAAAn5G,GAEAo+C,EAAA26D,aAAA,CACA,IAAAE,EAAAx1O,KAAAsmO,gBACA3rD,EAAA86D,eAAAD,EAAA5P,cAAA4P,EAAAvwQ,OAAAuwQ,EAAAnQ,gBAAArlO,KAAAwmO,MAAAgP,EAAAnQ,iBAOAtC,EAAAplO,UAAA6oO,MAAA,SAAAvyU,GACA,IAAA0mR,EAAA36K,KAAAq1O,gBAEA,OAAA16D,EAAA46D,YAAA56D,EAAA26D,aAOA36D,EAAA86D,eAAA,GANA96D,EAAA26D,cAAA,EAEAt1O,KAAAkjO,WAAAvoD,EAAA46D,WAAA56D,EAAA+6D,cAAA/6D,EAAAy6D,kBAQArS,EAAAplO,UAAA8oO,SAAA,SAAAhtO,EAAA4mD,GACAmjL,EAAA7lO,UAAA8oO,SAAA7oO,KAAAoC,KAAAvG,GAAA,SAAAk8O,GACAt1L,EAAAs1L,kGCnKA,aAEAtiV,EAAAC,QAAAmwU,EAEA,IAAAV,EAAAxvU,EAAA,uBAIA,SAAAkwU,EAAA9uU,GACA,KAAAqrG,gBAAAyjO,GAAA,OAAA,IAAAA,EAAA9uU,GACAouU,EAAAnlO,KAAAoC,KAAArrG,GAJApB,EAAA,WAAAA,CAAAkwU,EAAAV,GAOAU,EAAA9lO,UAAAulO,WAAA,SAAAzzN,EAAA8sH,EAAAl8E,GACAA,EAAA,KAAA5wC,gFCnCA,aAEA,IAAAilO,EAWA,IAAAhQ,EAAAnxU,EAAA,mBAAAsoO,MACA+5G,EAAAlR,EAAAkR,iBACAtG,EAAA5K,EAAA4K,qBAEA,SAAAlnI,EAAA3uG,GAEA,GAAAA,EAAA,MAAAA,EAOA,SAAAo8O,EAAArlH,EAAAk1G,EAAAoK,EAAAz1K,GACAA,EAvBA,SAAAA,GACA,IAAA6pB,GAAA,EACA,OAAA,WACAA,IACAA,GAAA,EACA7pB,EAAA+oC,WAAA,EAAA/sH,aAkBAuwI,CAAAvsD,GACA,IAAAy7K,GAAA,EACAtlH,EAAAxiJ,GAAA,SAAA,WACA8nQ,GAAA,UAEApgV,IAAAg/U,IAAAA,EAAAnhV,EAAA,oBACAmhV,EAAAlkH,EAAA,CACA+1G,SAAAb,EACAvvG,SAAA25G,IACA,SAAAr2O,GACA,GAAAA,EAAA,OAAA4gE,EAAA5gE,GACAq8O,GAAA,EACAz7K,OAEA,IAAAuuB,GAAA,EACA,OAAA,SAAAnvF,GACA,IAAAq8O,IACAltJ,EAGA,OAFAA,GAAA,EAvBA,SAAA4nC,GACA,OAAAA,EAAAwkH,WAAA,mBAAAxkH,EAAAx9E,MAwBAiiM,CAAAzkH,GAAAA,EAAAx9E,QACA,mBAAAw9E,EAAAljB,QAAAkjB,EAAAljB,eACAjzC,EAAA5gE,GAAA,IAAA61O,EAAA,UAIA,SAAA1xO,EAAAhZ,GACAA,IAGA,SAAA6jP,EAAAh/K,EAAA+gC,GACA,OAAA/gC,EAAAg/K,KAAAj+I,GAGA,SAAAurJ,EAAAC,GACA,OAAAA,EAAA/wQ,OACA,mBAAA+wQ,EAAAA,EAAA/wQ,OAAA,GAAAmjI,EACA4tI,EAAA/3P,MAFAmqH,YAKA,WACA,IAAA,IAAAusI,EAAAt+P,UAAApR,OAAA+wQ,EAAA,IAAAn4O,MAAA82O,GAAA53O,EAAA,EAAAA,EAAA43O,EAAA53O,IACAi5O,EAAAj5O,GAAA1mB,UAAA0mB,GAGA,IAOAxtB,EAPA8qF,EAAA07K,EAAAC,GAGA,GAFAn4O,MAAA/gB,QAAAk5P,EAAA,MAAAA,EAAAA,EAAA,IAEAA,EAAA/wQ,OAAA,EACA,MAAA,IAAA2wQ,EAAA,WAIA,IAAAK,EAAAD,EAAA5rQ,KAAA,SAAAomJ,EAAArpJ,GACA,IAAAu+P,EAAAv+P,EAAA6uQ,EAAA/wQ,OAAA,EAEA,OAAA4wQ,EAAArlH,EAAAk1G,EADAv+P,EAAA,GACA,SAAAsyB,GACAlqB,IAAAA,EAAAkqB,GACAA,GAAAw8O,EAAA7hV,QAAAwpG,GACA8nO,IACAuQ,EAAA7hV,QAAAwpG,GACAy8D,EAAA9qF,UAGA,OAAAymQ,EAAAtwQ,OAAA+iQ,qFC7FA,iBACIxlF,EAAS1vP,EAAQ,UAAU0vP,OAC3BwvC,EAAWl/R,EAAQ,YACnB4uU,EAAW5uU,EAAQ,aAEnB6uU,EAAAA,IAAcvkO,MAAM,IAEpBgzM,EAAAA,CACF,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAClD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACnD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAClD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,IAGhDqlC,EAAAA,CACF,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAClD,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EACnD,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAClD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAClD,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,IAGhDC,EAAAA,CACF,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EACrD,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GACpD,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GACpD,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,GAGnDC,EAAAA,CACF,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EACrD,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GACpD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,EACrD,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EACrD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,IAGlD/jC,EAAAA,CAAM,EAAY,WAAY,WAAY,WAAY,YACtDgkC,EAAAA,CAAM,WAAY,WAAY,WAAY,WAAY,GAE1D,SAAAzjC,IACEuvB,EAASvkO,KAAKoC,KAAM,IAGpBA,KAAKqiO,GAAK,WACVriO,KAAKsiO,GAAK,WACVtiO,KAAKu6E,GAAK,WACVv6E,KAAKo6E,GAAK,UACVp6E,KAAKs2O,GAAK,WAwFZ,SAAA/T,EAAe30N,EAAG35G,UACR25G,GAAK35G,EAAM25G,IAAO,GAAK35G,EAGjC,SAAAsiV,EAAc1vQ,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAGmrF,EAAG7qF,EAAG6nF,UACzBqmP,EAAM17P,GAAKyS,EAAI7M,EAAImxD,GAAK1+C,EAAI7qF,EAAK,EAAG6nF,GAAKnoF,EAAK,EAGxD,SAAAyiV,EAAc3vQ,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAGmrF,EAAG7qF,EAAG6nF,UACzBqmP,EAAM17P,GAAMyS,EAAI7M,GAAQ6M,EAAKskD,GAAM1+C,EAAI7qF,EAAK,EAAG6nF,GAAKnoF,EAAK,EAGnE,SAAA0iV,EAAc5vQ,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAGmrF,EAAG7qF,EAAG6nF,UACzBqmP,EAAM17P,IAAMyS,GAAM7M,GAAMmxD,GAAK1+C,EAAI7qF,EAAK,EAAG6nF,GAAKnoF,EAAK,EAG7D,SAAA2iV,EAAc7vQ,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAGmrF,EAAG7qF,EAAG6nF,UACzBqmP,EAAM17P,GAAMyS,EAAIskD,EAAMnxD,GAAMmxD,GAAO1+C,EAAI7qF,EAAK,EAAG6nF,GAAKnoF,EAAK,EAGnE,SAAA4iV,EAAc9vQ,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAGmrF,EAAG7qF,EAAG6nF,UACzBqmP,EAAM17P,GAAKyS,GAAK7M,GAAMmxD,IAAO1+C,EAAI7qF,EAAK,EAAG6nF,GAAKnoF,EAAK,EA1G7D0+R,EAASmgB,EAAWuvB,GAEpBvvB,EAAUj1M,UAAU8vK,QAAU,mBACxBulB,EAAQovC,EACH9wO,EAAI,EAAGA,EAAI,KAAMA,EAAG0hM,EAAM1hM,GAAK0O,KAAK4iO,OAAO5O,YAAgB,EAAJ1iO,WAE5Ds8M,EAAe,EAAV5tM,KAAKqiO,GACVt0B,EAAe,EAAV/tM,KAAKsiO,GACVp0B,EAAe,EAAVluM,KAAKu6E,GACV6zH,EAAe,EAAVpuM,KAAKo6E,GACVllL,EAAe,EAAV8qG,KAAKs2O,GAEVM,EAAe,EAAV52O,KAAKqiO,GACVwU,EAAe,EAAV72O,KAAKsiO,GACVwU,EAAe,EAAV92O,KAAKu6E,GACVw8J,EAAe,EAAV/2O,KAAKo6E,GACVysJ,EAAe,EAAV7mO,KAAKs2O,GAGLnvQ,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAA,KACvB6vQ,EACAC,EACA9vQ,EAAI,IACN6vQ,EAAKT,EAAI3oC,EAAIG,EAAIG,EAAIE,EAAIl5S,EAAI89R,EAAM6d,EAAG1pO,IAAKkrO,EAAG,GAAI8jC,EAAGhvQ,IACrD8vQ,EAAKN,EAAIC,EAAIC,EAAIC,EAAIC,EAAIlQ,EAAI7zC,EAAMkjD,EAAG/uQ,IAAKkvQ,EAAG,GAAID,EAAGjvQ,KAC5CA,EAAI,IACb6vQ,EAAKR,EAAI5oC,EAAIG,EAAIG,EAAIE,EAAIl5S,EAAI89R,EAAM6d,EAAG1pO,IAAKkrO,EAAG,GAAI8jC,EAAGhvQ,IACrD8vQ,EAAKP,EAAIE,EAAIC,EAAIC,EAAIC,EAAIlQ,EAAI7zC,EAAMkjD,EAAG/uQ,IAAKkvQ,EAAG,GAAID,EAAGjvQ,KAC5CA,EAAI,IACb6vQ,EAAKP,EAAI7oC,EAAIG,EAAIG,EAAIE,EAAIl5S,EAAI89R,EAAM6d,EAAG1pO,IAAKkrO,EAAG,GAAI8jC,EAAGhvQ,IACrD8vQ,EAAKR,EAAIG,EAAIC,EAAIC,EAAIC,EAAIlQ,EAAI7zC,EAAMkjD,EAAG/uQ,IAAKkvQ,EAAG,GAAID,EAAGjvQ,KAC5CA,EAAI,IACb6vQ,EAAKN,EAAI9oC,EAAIG,EAAIG,EAAIE,EAAIl5S,EAAI89R,EAAM6d,EAAG1pO,IAAKkrO,EAAG,GAAI8jC,EAAGhvQ,IACrD8vQ,EAAKT,EAAII,EAAIC,EAAIC,EAAIC,EAAIlQ,EAAI7zC,EAAMkjD,EAAG/uQ,IAAKkvQ,EAAG,GAAID,EAAGjvQ,MAErD6vQ,EAAKL,EAAI/oC,EAAIG,EAAIG,EAAIE,EAAIl5S,EAAI89R,EAAM6d,EAAG1pO,IAAKkrO,EAAG,GAAI8jC,EAAGhvQ,IACrD8vQ,EAAKV,EAAIK,EAAIC,EAAIC,EAAIC,EAAIlQ,EAAI7zC,EAAMkjD,EAAG/uQ,IAAKkvQ,EAAG,GAAID,EAAGjvQ,KAGvDymO,EAAK14S,EACLA,EAAKk5S,EACLA,EAAKm0B,EAAKr0B,EAAI,IACdA,EAAKH,EACLA,EAAKipC,EAELJ,EAAK/P,EACLA,EAAKkQ,EACLA,EAAKxU,EAAKuU,EAAI,IACdA,EAAKD,EACLA,EAAKI,MAIHl4L,EAAK/+C,KAAKsiO,GAAKp0B,EAAK6oC,EAAM,EAC9B/2O,KAAKsiO,GAAMtiO,KAAKu6E,GAAK6zH,EAAKy4B,EAAM,EAChC7mO,KAAKu6E,GAAMv6E,KAAKo6E,GAAKllL,EAAK0hV,EAAM,EAChC52O,KAAKo6E,GAAMp6E,KAAKs2O,GAAK1oC,EAAKipC,EAAM,EAChC72O,KAAKs2O,GAAMt2O,KAAKqiO,GAAKt0B,EAAK+oC,EAAM,EAChC92O,KAAKqiO,GAAKtjL,GAGZ6zJ,EAAUj1M,UAAU0xM,QAAU,WAE5BrvM,KAAK4iO,OAAO5iO,KAAK6iO,gBAAkB,IAC/B7iO,KAAK6iO,aAAe,KACtB7iO,KAAK4iO,OAAOpxC,KAAK,EAAGxxL,KAAK6iO,aAAc,IACvC7iO,KAAKytK,UACLztK,KAAK6iO,aAAe,GAGtB7iO,KAAK4iO,OAAOpxC,KAAK,EAAGxxL,KAAK6iO,aAAc,IACvC7iO,KAAK4iO,OAAOjO,cAAc30N,KAAK8iO,QAAQ,GAAI,IAC3C9iO,KAAK4iO,OAAOjO,cAAc30N,KAAK8iO,QAAQ,GAAI,IAC3C9iO,KAAKytK,cAGD59D,EAASozC,EAAOO,MAAQP,EAAOO,MAAM,IAAA,IAAUP,EAAO,WAC1DpzC,EAAOulH,aAAap1N,KAAKqiO,GAAI,GAC7BxyH,EAAOulH,aAAap1N,KAAKsiO,GAAI,GAC7BzyH,EAAOulH,aAAap1N,KAAKu6E,GAAI,GAC7Bs1B,EAAOulH,aAAap1N,KAAKo6E,GAAI,IAC7By1B,EAAOulH,aAAap1N,KAAKs2O,GAAI,IACtBzmI,GA2BTx8M,EAAOC,QAAUs/S,oFClKjBt/S,EAAAD,EAAAC,QAAA,SAAAiqQ,GACAA,EAAAA,EAAAn0L,cAEA,IAAAg4L,EAAA9tQ,EAAAiqQ,GACA,IAAA6D,EAAA,MAAA,IAAAtoK,MAAAykK,EAAA,+CAEA,OAAA,IAAA6D,IAGA6e,IAAA1sR,EAAA,SACAD,EAAA2sO,KAAA1sO,EAAA,UACAD,EAAA8tR,OAAA7tR,EAAA,YACAD,EAAAs4Q,OAAAr4Q,EAAA,YACAD,EAAA6tR,OAAA5tR,EAAA,YACAD,EAAAgqQ,OAAA/pQ,EAAA,wJCNIk/R,EAAWl/R,EAAQ,YACnB8/S,EAAO9/S,EAAQ,UACf0vP,EAAS1vP,EAAQ,eAAe0vP,OAEhC2sB,EAAAA,CACF,WAAY,YAAY,YAAgB,WAGtC/oD,EAAAA,IAAQhpH,MAAM,IAElB,SAAAq5O,IACEl3O,KAAKg1B,OACLh1B,KAAK8hK,GAAKj7C,EAEVwsF,EAAKz1M,KAAKoC,KAAM,GAAI,IAmBtB,SAAAm3O,EAAiBzlO,UACPA,GAAO,GAAOA,IAAQ,EAGhC,SAAA0lO,EAAal7P,EAAG5C,EAAG7M,EAAGmxD,UACV,IAAN1hD,EAAiB5C,EAAI7M,GAAQ6M,EAAKskD,EAC5B,IAAN1hD,EAAiB5C,EAAI7M,EAAM6M,EAAIskD,EAAMnxD,EAAImxD,EACtCtkD,EAAI7M,EAAImxD,EAvBjB60J,EAASykD,EAAK7jC,GAEd6jC,EAAIv5O,UAAUq3B,KAAO,kBACnBh1B,KAAKqiO,GAAK,WACVriO,KAAKsiO,GAAK,WACVtiO,KAAKu6E,GAAK,WACVv6E,KAAKo6E,GAAK,UACVp6E,KAAKs2O,GAAK,WAEHt2O,MAiBTk3O,EAAIv5O,UAAU8vK,QAAU,SAAU5oD,WAdlBnzG,EAeVm1G,EAAI7mH,KAAK8hK,GAETj7L,EAAc,EAAVm5B,KAAKqiO,GACT/oP,EAAc,EAAV0mB,KAAKsiO,GACT71P,EAAc,EAAVuzB,KAAKu6E,GACT38C,EAAc,EAAV59B,KAAKo6E,GACTrmL,EAAc,EAAVisG,KAAKs2O,GAEJnvQ,EAAI,EAAGA,EAAI,KAAMA,EAAG0/I,EAAE1/I,GAAK09I,EAAEovG,YAAgB,EAAJ9sP,QAC3CA,EAAI,KAAMA,EAAG0/I,EAAE1/I,GAAK0/I,EAAE1/I,EAAI,GAAK0/I,EAAE1/I,EAAI,GAAK0/I,EAAE1/I,EAAI,IAAM0/I,EAAE1/I,EAAI,YAE1DmqB,EAAI,EAAGA,EAAI,KAAMA,EAAAA,KACpBpV,KAAOoV,EAAI,IACXytD,EAAoD,IA5B5CrtC,EA4BG7qC,IA3BF,EAAM6qC,IAAQ,IA2BP0lO,EAAGl7P,EAAG5C,EAAG7M,EAAGmxD,GAAK7pI,EAAI8yN,EAAEv1H,GAAKs+K,EAAE1zL,GAElDnoF,EAAI6pI,EACJA,EAAInxD,EACJA,EAAI0qQ,EAAO79P,GACXA,EAAIzS,EACJA,EAAIk4E,EAGN/+C,KAAKqiO,GAAMx7P,EAAIm5B,KAAKqiO,GAAM,EAC1BriO,KAAKsiO,GAAMhpP,EAAI0mB,KAAKsiO,GAAM,EAC1BtiO,KAAKu6E,GAAM9tG,EAAIuzB,KAAKu6E,GAAM,EAC1Bv6E,KAAKo6E,GAAMx8C,EAAI59B,KAAKo6E,GAAM,EAC1Bp6E,KAAKs2O,GAAMviV,EAAIisG,KAAKs2O,GAAM,GAG5BY,EAAIv5O,UAAUskO,MAAQ,eAChBl/G,EAAIkgC,EAAOiE,YAAY,WAE3BnkC,EAAEsyG,aAAuB,EAAVr1N,KAAKqiO,GAAQ,GAC5Bt/G,EAAEsyG,aAAuB,EAAVr1N,KAAKsiO,GAAQ,GAC5Bv/G,EAAEsyG,aAAuB,EAAVr1N,KAAKu6E,GAAQ,GAC5BwoC,EAAEsyG,aAAuB,EAAVr1N,KAAKo6E,GAAQ,IAC5B2oC,EAAEsyG,aAAuB,EAAVr1N,KAAKs2O,GAAQ,IAErBvzH,GAGT1vN,EAAOC,QAAU4jV,2FC7Fbj0F,EAAS1vP,EAAQ,eAAe0vP,OAGpC,SAAAowD,EAAe5xC,EAAW41E,GACxBr3O,KAAK4iO,OAAS3/E,EAAOO,MAAMie,GAC3BzhK,KAAKs3O,WAAaD,EAClBr3O,KAAKgjO,WAAavhE,EAClBzhK,KAAK20O,KAAO,EAGdthC,EAAK11M,UAAUg4D,OAAS,SAAUjJ,EAAMiwE,GAClB,iBAATjwE,IACTiwE,EAAMA,GAAO,OACbjwE,EAAOu2F,EAAOx5F,KAAKiD,EAAMiwE,YAGvBnvE,EAAQxtD,KAAK4iO,OACbnhE,EAAYzhK,KAAKgjO,WACjB/9P,EAASynF,EAAKznF,OACdsyQ,EAAQv3O,KAAK20O,KAER5vQ,EAAS,EAAGA,EAASE,GAAAA,SACxBuyQ,EAAWD,EAAQ91E,EACnBqb,EAAYl3M,KAAKq0B,IAAIh1B,EAASF,EAAQ08L,EAAY+1E,GAE7CrwQ,EAAI,EAAGA,EAAI21M,EAAW31M,IAC7BqmF,EAAMgqL,EAAWrwQ,GAAKulF,EAAK3nF,EAASoC,GAItCpC,GAAU+3M,GADVy6D,GAASz6D,GAGIrb,GAAe,GAC1BzhK,KAAKytK,QAAQjgH,UAIjBxtD,KAAK20O,MAAQ1vQ,EACN+6B,MAGTqzM,EAAK11M,UAAUu7H,OAAS,SAAUyD,OAC5B86G,EAAMz3O,KAAK20O,KAAO30O,KAAKgjO,WAE3BhjO,KAAK4iO,OAAO6U,GAAO,IAInBz3O,KAAK4iO,OAAOpxC,KAAK,EAAGimD,EAAM,GAEtBA,GAAOz3O,KAAKs3O,aACdt3O,KAAKytK,QAAQztK,KAAK4iO,QAClB5iO,KAAK4iO,OAAOpxC,KAAK,QAGfp3D,EAAmB,EAAZp6H,KAAK20O,QAGZv6G,GAAQ,WACVp6H,KAAK4iO,OAAO/N,cAAcz6F,EAAMp6H,KAAKgjO,WAAa,YAI9C0U,GAAkB,WAAPt9G,KAAuB,EAClCu9G,GAAYv9G,EAAOs9G,GAAW,WAElC13O,KAAK4iO,OAAO/N,cAAc8iB,EAAU33O,KAAKgjO,WAAa,GACtDhjO,KAAK4iO,OAAO/N,cAAc6iB,EAAS13O,KAAKgjO,WAAa,GAGvDhjO,KAAKytK,QAAQztK,KAAK4iO,YACdvvN,EAAOrT,KAAKiiO,eAETtlG,EAAMtpH,EAAKjV,SAASu+H,GAAOtpH,GAGpCggM,EAAK11M,UAAU8vK,QAAU,qBACb30K,MAAM,4CAGlBzlG,EAAOC,QAAU+/S,yDCvEb5gB,EAAWl/R,EAAQ,YACnB8/S,EAAO9/S,EAAQ,UACf0vP,EAAS1vP,EAAQ,eAAe0vP,OAEhC2sB,EAAAA,CACF,WAAY,YAAY,YAAgB,WAGtC/oD,EAAAA,IAAQhpH,MAAM,IAElB,SAAA+5O,IACE53O,KAAKg1B,OACLh1B,KAAK8hK,GAAKj7C,EAEVwsF,EAAKz1M,KAAKoC,KAAM,GAAI,IAmBtB,SAAA63O,EAAgBnmO,UACNA,GAAO,EAAMA,IAAQ,GAG/B,SAAAylO,EAAiBzlO,UACPA,GAAO,GAAOA,IAAQ,EAGhC,SAAA0lO,EAAal7P,EAAG5C,EAAG7M,EAAGmxD,UACV,IAAN1hD,EAAiB5C,EAAI7M,GAAQ6M,EAAKskD,EAC5B,IAAN1hD,EAAiB5C,EAAI7M,EAAM6M,EAAIskD,EAAMnxD,EAAImxD,EACtCtkD,EAAI7M,EAAImxD,EA3BjB60J,EAASmlD,EAAMvkC,GAEfukC,EAAKj6O,UAAUq3B,KAAO,kBACpBh1B,KAAKqiO,GAAK,WACVriO,KAAKsiO,GAAK,WACVtiO,KAAKu6E,GAAK,WACVv6E,KAAKo6E,GAAK,UACVp6E,KAAKs2O,GAAK,WAEHt2O,MAqBT43O,EAAKj6O,UAAU8vK,QAAU,SAAU5oD,WAlBnBnzG,EAmBVm1G,EAAI7mH,KAAK8hK,GAETj7L,EAAc,EAAVm5B,KAAKqiO,GACT/oP,EAAc,EAAV0mB,KAAKsiO,GACT71P,EAAc,EAAVuzB,KAAKu6E,GACT38C,EAAc,EAAV59B,KAAKo6E,GACTrmL,EAAc,EAAVisG,KAAKs2O,GAEJnvQ,EAAI,EAAGA,EAAI,KAAMA,EAAG0/I,EAAE1/I,GAAK09I,EAAEovG,YAAgB,EAAJ9sP,QAC3CA,EAAI,KAAMA,EAAG0/I,EAAE1/I,IA5BRuqC,EA4BmBm1G,EAAE1/I,EAAI,GAAK0/I,EAAE1/I,EAAI,GAAK0/I,EAAE1/I,EAAI,IAAM0/I,EAAE1/I,EAAI,MA3B1D,EAAMuqC,IAAQ,WA6BpBpgB,EAAI,EAAGA,EAAI,KAAMA,EAAAA,KACpBpV,KAAOoV,EAAI,IACXytD,EAAK84L,EAAMhxQ,GAAKuwQ,EAAGl7P,EAAG5C,EAAG7M,EAAGmxD,GAAK7pI,EAAI8yN,EAAEv1H,GAAKs+K,EAAE1zL,GAAM,EAExDnoF,EAAI6pI,EACJA,EAAInxD,EACJA,EAAI0qQ,EAAO79P,GACXA,EAAIzS,EACJA,EAAIk4E,EAGN/+C,KAAKqiO,GAAMx7P,EAAIm5B,KAAKqiO,GAAM,EAC1BriO,KAAKsiO,GAAMhpP,EAAI0mB,KAAKsiO,GAAM,EAC1BtiO,KAAKu6E,GAAM9tG,EAAIuzB,KAAKu6E,GAAM,EAC1Bv6E,KAAKo6E,GAAMx8C,EAAI59B,KAAKo6E,GAAM,EAC1Bp6E,KAAKs2O,GAAMviV,EAAIisG,KAAKs2O,GAAM,GAG5BsB,EAAKj6O,UAAUskO,MAAQ,eACjBl/G,EAAIkgC,EAAOiE,YAAY,WAE3BnkC,EAAEsyG,aAAuB,EAAVr1N,KAAKqiO,GAAQ,GAC5Bt/G,EAAEsyG,aAAuB,EAAVr1N,KAAKsiO,GAAQ,GAC5Bv/G,EAAEsyG,aAAuB,EAAVr1N,KAAKu6E,GAAQ,GAC5BwoC,EAAEsyG,aAAuB,EAAVr1N,KAAKo6E,GAAQ,IAC5B2oC,EAAEsyG,aAAuB,EAAVr1N,KAAKs2O,GAAQ,IAErBvzH,GAGT1vN,EAAOC,QAAUskV,2FC1FbnlD,EAAWl/R,EAAQ,YACnBukV,EAASvkV,EAAQ,YACjB8/S,EAAO9/S,EAAQ,UACf0vP,EAAS1vP,EAAQ,eAAe0vP,OAEhCp8B,EAAAA,IAAQhpH,MAAM,IAElB,SAAAk6O,IACE/3O,KAAKg1B,OAELh1B,KAAK8hK,GAAKj7C,EAEVwsF,EAAKz1M,KAAKoC,KAAM,GAAI,IAGtByyL,EAASslD,EAAQD,GAEjBC,EAAOp6O,UAAUq3B,KAAO,kBACtBh1B,KAAKqiO,GAAK,WACVriO,KAAKsiO,GAAK,UACVtiO,KAAKu6E,GAAK,UACVv6E,KAAKo6E,GAAK,WACVp6E,KAAKs2O,GAAK,WACVt2O,KAAKg4O,GAAK,WACVh4O,KAAKi4O,GAAK,WACVj4O,KAAKshL,GAAK,WAEHthL,MAGT+3O,EAAOp6O,UAAUskO,MAAQ,eACnBl/G,EAAIkgC,EAAOiE,YAAY,WAE3BnkC,EAAEsyG,aAAar1N,KAAKqiO,GAAI,GACxBt/G,EAAEsyG,aAAar1N,KAAKsiO,GAAI,GACxBv/G,EAAEsyG,aAAar1N,KAAKu6E,GAAI,GACxBwoC,EAAEsyG,aAAar1N,KAAKo6E,GAAI,IACxB2oC,EAAEsyG,aAAar1N,KAAKs2O,GAAI,IACxBvzH,EAAEsyG,aAAar1N,KAAKg4O,GAAI,IACxBj1H,EAAEsyG,aAAar1N,KAAKi4O,GAAI,IAEjBl1H,GAGT1vN,EAAOC,QAAUykV,8GC5CbtlD,EAAWl/R,EAAQ,YACnB8/S,EAAO9/S,EAAQ,UACf0vP,EAAS1vP,EAAQ,eAAe0vP,OAEhC2sB,EAAAA,CACF,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,UAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,YAGlC/oD,EAAAA,IAAQhpH,MAAM,IAElB,SAAAi6O,IACE93O,KAAKg1B,OAELh1B,KAAK8hK,GAAKj7C,EAEVwsF,EAAKz1M,KAAKoC,KAAM,GAAI,IAkBtB,SAAAihC,EAAarzB,EAAGC,EAAG03G,UACVA,EAAK33G,GAAKC,EAAI03G,GAGvB,SAAAuoD,EAAclgK,EAAGC,EAAG03G,UACV33G,EAAIC,EAAM03G,GAAK33G,EAAIC,GAG7B,SAAAqqO,EAAiBtqO,UACPA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,KAAOA,IAAM,GAAKA,GAAK,IAGvE,SAAAuqO,EAAiBvqO,UACPA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,KAAOA,IAAM,GAAKA,GAAK,GAGvE,SAAAwqO,EAAiBxqO,UACPA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,IAAOA,IAAM,EAhC7D6kL,EAASqlD,EAAQzkC,GAEjBykC,EAAOn6O,UAAUq3B,KAAO,kBACtBh1B,KAAKqiO,GAAK,WACVriO,KAAKsiO,GAAK,WACVtiO,KAAKu6E,GAAK,WACVv6E,KAAKo6E,GAAK,WACVp6E,KAAKs2O,GAAK,WACVt2O,KAAKg4O,GAAK,WACVh4O,KAAKi4O,GAAK,UACVj4O,KAAKshL,GAAK,WAEHthL,MA2BT83O,EAAOn6O,UAAU8vK,QAAU,SAAU5oD,WAJpBj3G,EAKXi5G,EAAI7mH,KAAK8hK,GAETj7L,EAAc,EAAVm5B,KAAKqiO,GACT/oP,EAAc,EAAV0mB,KAAKsiO,GACT71P,EAAc,EAAVuzB,KAAKu6E,GACT38C,EAAc,EAAV59B,KAAKo6E,GACTrmL,EAAc,EAAVisG,KAAKs2O,GACT50L,EAAc,EAAV1hD,KAAKg4O,GACT5zH,EAAc,EAAVpkH,KAAKi4O,GACTxwK,EAAc,EAAVznE,KAAKshL,GAEJn6M,EAAI,EAAGA,EAAI,KAAMA,EAAG0/I,EAAE1/I,GAAK09I,EAAEovG,YAAgB,EAAJ9sP,QAC3CA,EAAI,KAAMA,EAAG0/I,EAAE1/I,GAAqE,KAjB5EymC,EAiBoBi5G,EAAE1/I,EAAI,MAhB3B,GAAKymC,GAAK,KAAOA,IAAM,GAAKA,GAAK,IAAOA,IAAM,IAgBbi5G,EAAE1/I,EAAI,GAAKixQ,EAAOvxH,EAAE1/I,EAAI,KAAO0/I,EAAE1/I,EAAI,YAE3EmqB,EAAI,EAAGA,EAAI,KAAMA,EAAAA,KACpBg+K,EAAM7nG,EAAI0wK,EAAOpkV,GAAKktI,EAAGltI,EAAG2tJ,EAAG0iE,GAAKwrD,EAAEt+K,GAAKu1H,EAAEv1H,GAAM,EACnD8+M,EAAM8nC,EAAOrxQ,GAAKinM,EAAIjnM,EAAGyS,EAAG7M,GAAM,EAEtCg7F,EAAI28C,EACJA,EAAI1iE,EACJA,EAAI3tJ,EACJA,EAAK6pI,EAAI0xI,EAAM,EACf1xI,EAAInxD,EACJA,EAAI6M,EACJA,EAAIzS,EACJA,EAAKyoM,EAAK8gC,EAAM,EAGlBpwM,KAAKqiO,GAAMx7P,EAAIm5B,KAAKqiO,GAAM,EAC1BriO,KAAKsiO,GAAMhpP,EAAI0mB,KAAKsiO,GAAM,EAC1BtiO,KAAKu6E,GAAM9tG,EAAIuzB,KAAKu6E,GAAM,EAC1Bv6E,KAAKo6E,GAAMx8C,EAAI59B,KAAKo6E,GAAM,EAC1Bp6E,KAAKs2O,GAAMviV,EAAIisG,KAAKs2O,GAAM,EAC1Bt2O,KAAKg4O,GAAMt2L,EAAI1hD,KAAKg4O,GAAM,EAC1Bh4O,KAAKi4O,GAAM7zH,EAAIpkH,KAAKi4O,GAAM,EAC1Bj4O,KAAKshL,GAAM75G,EAAIznE,KAAKshL,GAAM,GAG5Bw2D,EAAOn6O,UAAUskO,MAAQ,eACnBl/G,EAAIkgC,EAAOiE,YAAY,WAE3BnkC,EAAEsyG,aAAar1N,KAAKqiO,GAAI,GACxBt/G,EAAEsyG,aAAar1N,KAAKsiO,GAAI,GACxBv/G,EAAEsyG,aAAar1N,KAAKu6E,GAAI,GACxBwoC,EAAEsyG,aAAar1N,KAAKo6E,GAAI,IACxB2oC,EAAEsyG,aAAar1N,KAAKs2O,GAAI,IACxBvzH,EAAEsyG,aAAar1N,KAAKg4O,GAAI,IACxBj1H,EAAEsyG,aAAar1N,KAAKi4O,GAAI,IACxBl1H,EAAEsyG,aAAar1N,KAAKshL,GAAI,IAEjBv+D,GAGT1vN,EAAOC,QAAUwkV,2FCtIbrlD,EAAWl/R,EAAQ,YACnB88S,EAAS98S,EAAQ,YACjB8/S,EAAO9/S,EAAQ,UACf0vP,EAAS1vP,EAAQ,eAAe0vP,OAEhCp8B,EAAAA,IAAQhpH,MAAM,KAElB,SAAAw6O,IACEr4O,KAAKg1B,OACLh1B,KAAK8hK,GAAKj7C,EAEVwsF,EAAKz1M,KAAKoC,KAAM,IAAK,KAGvByyL,EAAS4lD,EAAQhoC,GAEjBgoC,EAAO16O,UAAUq3B,KAAO,kBACtBh1B,KAAKs4O,IAAM,WACXt4O,KAAKu4O,IAAM,WACXv4O,KAAKw4O,IAAM,WACXx4O,KAAKy4O,IAAM,UACXz4O,KAAK04O,IAAM,WACX14O,KAAK24O,IAAM,WACX34O,KAAK44O,IAAM,WACX54O,KAAK64O,IAAM,WAEX74O,KAAK84O,IAAM,WACX94O,KAAK+4O,IAAM,UACX/4O,KAAKg5O,IAAM,UACXh5O,KAAKi5O,IAAM,WACXj5O,KAAKk5O,IAAM,WACXl5O,KAAKm5O,IAAM,WACXn5O,KAAKo5O,IAAM,WACXp5O,KAAKq5O,IAAM,WAEJr5O,MAGTq4O,EAAO16O,UAAUskO,MAAQ,eACnBl/G,EAAIkgC,EAAOiE,YAAY,IAE3B,SAAAoyF,EAAuB7xK,EAAG1+E,EAAGhkB,GAC3Bg+I,EAAEsyG,aAAa5tJ,EAAG1iG,GAClBg+I,EAAEsyG,aAAatsO,EAAGhkB,EAAS,UAG7Bu0Q,EAAat5O,KAAKs4O,IAAKt4O,KAAK84O,IAAK,GACjCQ,EAAat5O,KAAKu4O,IAAKv4O,KAAK+4O,IAAK,GACjCO,EAAat5O,KAAKw4O,IAAKx4O,KAAKg5O,IAAK,IACjCM,EAAat5O,KAAKy4O,IAAKz4O,KAAKi5O,IAAK,IACjCK,EAAat5O,KAAK04O,IAAK14O,KAAKk5O,IAAK,IACjCI,EAAat5O,KAAK24O,IAAK34O,KAAKm5O,IAAK,IAE1Bp2H,GAGT1vN,EAAOC,QAAU+kV,4GCxDb5lD,EAAWl/R,EAAQ,YACnB8/S,EAAO9/S,EAAQ,UACf0vP,EAAS1vP,EAAQ,eAAe0vP,OAEhC2sB,EAAAA,CACF,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,UAAY,UAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,UAAY,WAAY,YAGlC/oD,EAAAA,IAAQhpH,MAAM,KAElB,SAAA07O,IACEv5O,KAAKg1B,OACLh1B,KAAK8hK,GAAKj7C,EAEVwsF,EAAKz1M,KAAKoC,KAAM,IAAK,KA2BvB,SAAAgzM,EAAaplM,EAAGC,EAAG03G,UACVA,EAAK33G,GAAKC,EAAI03G,GAGvB,SAAAuoD,EAAclgK,EAAGC,EAAG03G,UACV33G,EAAIC,EAAM03G,GAAK33G,EAAIC,GAG7B,SAAAqqO,EAAiBtqO,EAAGupK,UACVvpK,IAAM,GAAKupK,GAAM,IAAMA,IAAO,EAAIvpK,GAAK,KAAOupK,IAAO,EAAIvpK,GAAK,IAGxE,SAAAuqO,EAAiBvqO,EAAGupK,UACVvpK,IAAM,GAAKupK,GAAM,KAAOvpK,IAAM,GAAKupK,GAAM,KAAOA,IAAO,EAAIvpK,GAAK,IAG1E,SAAA4rO,EAAiB5rO,EAAGupK,UACVvpK,IAAM,EAAIupK,GAAM,KAAOvpK,IAAM,EAAIupK,GAAM,IAAOvpK,IAAM,EAG9D,SAAA6rO,EAAkB7rO,EAAGupK,UACXvpK,IAAM,EAAIupK,GAAM,KAAOvpK,IAAM,EAAIupK,GAAM,KAAOvpK,IAAM,EAAIupK,GAAM,IAGxE,SAAAuiE,EAAiB9rO,EAAGupK,UACVvpK,IAAM,GAAKupK,GAAM,KAAOA,IAAO,GAAKvpK,GAAK,GAAMA,IAAM,EAG/D,SAAA+rO,EAAkB/rO,EAAGupK,UACXvpK,IAAM,GAAKupK,GAAM,KAAOA,IAAO,GAAKvpK,GAAK,IAAMA,IAAM,EAAIupK,GAAM,IAGzE,SAAAyiE,EAAmB/yQ,EAAGyS,UACZzS,IAAM,EAAMyS,IAAM,EAAK,EAAI,EAzDrCm5M,EAAS8mD,EAAQlmC,GAEjBkmC,EAAO57O,UAAUq3B,KAAO,kBACtBh1B,KAAKs4O,IAAM,WACXt4O,KAAKu4O,IAAM,WACXv4O,KAAKw4O,IAAM,WACXx4O,KAAKy4O,IAAM,WACXz4O,KAAK04O,IAAM,WACX14O,KAAK24O,IAAM,WACX34O,KAAK44O,IAAM,UACX54O,KAAK64O,IAAM,WAEX74O,KAAK84O,IAAM,WACX94O,KAAK+4O,IAAM,WACX/4O,KAAKg5O,IAAM,WACXh5O,KAAKi5O,IAAM,WACXj5O,KAAKk5O,IAAM,WACXl5O,KAAKm5O,IAAM,UACXn5O,KAAKo5O,IAAM,WACXp5O,KAAKq5O,IAAM,UAEJr5O,MAuCTu5O,EAAO57O,UAAU8vK,QAAU,SAAU5oD,WAC/BgC,EAAI7mH,KAAK8hK,GAETqF,EAAgB,EAAXnnK,KAAKs4O,IACVzqC,EAAgB,EAAX7tM,KAAKu4O,IACVt3M,EAAgB,EAAXjhC,KAAKw4O,IACVrqC,EAAgB,EAAXnuM,KAAKy4O,IACVlqC,EAAgB,EAAXvuM,KAAK04O,IACVzmC,EAAgB,EAAXjyM,KAAK24O,IACVxmC,EAAgB,EAAXnyM,KAAK44O,IACVtoF,EAAgB,EAAXtwJ,KAAK64O,IAEVjrC,EAAgB,EAAX5tM,KAAK84O,IACV/qC,EAAgB,EAAX/tM,KAAK+4O,IACV7qC,EAAgB,EAAXluM,KAAKg5O,IACV5qC,EAAgB,EAAXpuM,KAAKi5O,IACV/jV,EAAgB,EAAX8qG,KAAKk5O,IACVhnC,EAAgB,EAAXlyM,KAAKm5O,IACV/mC,EAAgB,EAAXpyM,KAAKo5O,IACV/mC,EAAgB,EAAXryM,KAAKq5O,IAELlyQ,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAC3B0/I,EAAE1/I,GAAK09I,EAAEovG,YAAgB,EAAJ9sP,GACrB0/I,EAAE1/I,EAAI,GAAK09I,EAAEovG,YAAgB,EAAJ9sP,EAAQ,QAE5BA,EAAI,IAAKA,GAAK,EAAA,KACfiwM,EAAKvwD,EAAE1/I,EAAI,IACXgwM,EAAKtwD,EAAE1/I,EAAI,GAAS,GACpBixQ,EAASoB,EAAOpiE,EAAID,GACpB0iE,EAAUJ,EAAQtiE,EAAIC,GAItB0iE,EAASJ,EAFbtiE,EAAKvwD,EAAE1/I,EAAI,GACXgwM,EAAKtwD,EAAE1/I,EAAI,EAAQ,IAEf4yQ,EAAUJ,EAAQxiE,EAAIC,GAGtB4iE,EAAOnzH,EAAE1/I,EAAI,IACb8yQ,EAAOpzH,EAAE1/I,EAAI,GAAQ,GAErB+yQ,EAAQrzH,EAAE1/I,EAAI,IACdgzQ,EAAQtzH,EAAE1/I,EAAI,GAAS,GAEvBizQ,EAAOP,EAAUI,EAAQ,EACzBI,EAAOjC,EAAS4B,EAAOJ,EAASQ,EAAKP,GAAY,EAIrDQ,GAFAA,EAAOA,EAAMP,EAASF,EADtBQ,EAAOA,EAAML,EAAW,EACYA,GAAY,GAEnCG,EAAQN,EADrBQ,EAAOA,EAAMD,EAAS,EACaA,GAAU,EAE7CtzH,EAAE1/I,GAAKkzQ,EACPxzH,EAAE1/I,EAAI,GAAKizQ,UAGJ9oP,EAAI,EAAGA,EAAI,IAAKA,GAAK,EAAA,CAC5B+oP,EAAMxzH,EAAEv1H,GACR8oP,EAAMvzH,EAAEv1H,EAAI,OAERgpP,EAAOxsE,EAAI3G,EAAI0mC,EAAI5sK,GACnBs5M,EAAOzsE,EAAI8/B,EAAIG,EAAIG,GAEnBssC,EAAUtC,EAAO/wE,EAAIymC,GACrB6sC,EAAUvC,EAAOtqC,EAAIzmC,GACrBuzE,EAAUvC,EAAO5pC,EAAIr5S,GACrBylV,EAAUxC,EAAOjjV,EAAIq5S,GAGrBqsC,EAAMhrE,EAAEt+K,GACRupP,EAAMjrE,EAAEt+K,EAAI,GAEZwpP,EAAM9nC,EAAGzE,EAAI0D,EAAIE,GACjB4oC,EAAM/nC,EAAG99S,EAAIg9S,EAAIE,GAEjB4oC,EAAO3oC,EAAKsoC,EAAW,EACvBM,EAAO3qF,EAAKoqF,EAAUd,EAASoB,EAAK3oC,GAAO,EAM/C4oC,GAFAA,GAFAA,EAAOA,EAAMH,EAAMlB,EADnBoB,EAAOA,EAAMD,EAAO,EACaA,GAAQ,GAE5BH,EAAMhB,EADnBoB,EAAOA,EAAMH,EAAO,EACaA,GAAQ,GAE5BR,EAAMT,EADnBoB,EAAOA,EAAMZ,EAAO,EACaA,GAAQ,MAGrCc,GAAOT,EAAUF,EAAQ,EACzBY,GAAOX,EAAUF,EAAOV,EAASsB,GAAKT,GAAY,EAEtDnqF,EAAK6hD,EACLE,EAAKD,EACLD,EAAKF,EACLG,EAAKF,EACLD,EAAK1D,EACL2D,EAAKh9S,EAELq5S,EAAMJ,EAAK8sC,EAAMrB,EADjB1kV,EAAMk5S,EAAK4sC,EAAO,EACY5sC,GAAO,EACrCD,EAAKltK,EACLmtK,EAAKF,EACLjtK,EAAK4sK,EACLK,EAAKH,EACLF,EAAK1mC,EACL4mC,EAAKH,EAELzmC,EAAM8zE,EAAME,GAAMvB,EADlBhsC,EAAMotC,EAAME,GAAO,EACYF,GAAQ,EAGzCh7O,KAAK84O,IAAO94O,KAAK84O,IAAMlrC,EAAM,EAC7B5tM,KAAK+4O,IAAO/4O,KAAK+4O,IAAMhrC,EAAM,EAC7B/tM,KAAKg5O,IAAOh5O,KAAKg5O,IAAM9qC,EAAM,EAC7BluM,KAAKi5O,IAAOj5O,KAAKi5O,IAAM7qC,EAAM,EAC7BpuM,KAAKk5O,IAAOl5O,KAAKk5O,IAAMhkV,EAAM,EAC7B8qG,KAAKm5O,IAAOn5O,KAAKm5O,IAAMjnC,EAAM,EAC7BlyM,KAAKo5O,IAAOp5O,KAAKo5O,IAAMhnC,EAAM,EAC7BpyM,KAAKq5O,IAAOr5O,KAAKq5O,IAAMhnC,EAAM,EAE7BryM,KAAKs4O,IAAOt4O,KAAKs4O,IAAMnxE,EAAKyyE,EAAS55O,KAAK84O,IAAKlrC,GAAO,EACtD5tM,KAAKu4O,IAAOv4O,KAAKu4O,IAAM1qC,EAAK+rC,EAAS55O,KAAK+4O,IAAKhrC,GAAO,EACtD/tM,KAAKw4O,IAAOx4O,KAAKw4O,IAAMv3M,EAAK24M,EAAS55O,KAAKg5O,IAAK9qC,GAAO,EACtDluM,KAAKy4O,IAAOz4O,KAAKy4O,IAAMtqC,EAAKyrC,EAAS55O,KAAKi5O,IAAK7qC,GAAO,EACtDpuM,KAAK04O,IAAO14O,KAAK04O,IAAMnqC,EAAKqrC,EAAS55O,KAAKk5O,IAAKhkV,GAAO,EACtD8qG,KAAK24O,IAAO34O,KAAK24O,IAAM1mC,EAAK2nC,EAAS55O,KAAKm5O,IAAKjnC,GAAO,EACtDlyM,KAAK44O,IAAO54O,KAAK44O,IAAMzmC,EAAKynC,EAAS55O,KAAKo5O,IAAKhnC,GAAO,EACtDpyM,KAAK64O,IAAO74O,KAAK64O,IAAMvoF,EAAKspF,EAAS55O,KAAKq5O,IAAKhnC,GAAO,GAGxDknC,EAAO57O,UAAUskO,MAAQ,eACnBl/G,EAAIkgC,EAAOiE,YAAY,IAE3B,SAAAoyF,EAAuB7xK,EAAG1+E,EAAGhkB,GAC3Bg+I,EAAEsyG,aAAa5tJ,EAAG1iG,GAClBg+I,EAAEsyG,aAAatsO,EAAGhkB,EAAS,UAG7Bu0Q,EAAat5O,KAAKs4O,IAAKt4O,KAAK84O,IAAK,GACjCQ,EAAat5O,KAAKu4O,IAAKv4O,KAAK+4O,IAAK,GACjCO,EAAat5O,KAAKw4O,IAAKx4O,KAAKg5O,IAAK,IACjCM,EAAat5O,KAAKy4O,IAAKz4O,KAAKi5O,IAAK,IACjCK,EAAat5O,KAAK04O,IAAK14O,KAAKk5O,IAAK,IACjCI,EAAat5O,KAAK24O,IAAK34O,KAAKm5O,IAAK,IACjCG,EAAat5O,KAAK44O,IAAK54O,KAAKo5O,IAAK,IACjCE,EAAat5O,KAAK64O,IAAK74O,KAAKq5O,IAAK,IAE1Bt2H,GAGT1vN,EAAOC,QAAUimV,2FCnQbt2F,EAAS1vP,EAAQ,eAAe0vP,OAChC8/E,EAAYxvU,EAAQ,UAAUwvU,UAC9BqB,EAAgB7wU,EAAQ,kBAAkB6wU,cAG9C,SAAAgX,EAAqBC,GACnBtY,EAAUnlO,KAAKoC,MACfA,KAAKq7O,SAA+B,iBAAbA,EACnBr7O,KAAKq7O,SACPr7O,KAAKq7O,GAAYr7O,KAAKs7O,eAEtBt7O,KAAK4wO,MAAQ5wO,KAAKs7O,eAEhBt7O,KAAKkiO,SACPliO,KAAKu7O,QAAUv7O,KAAKkiO,OACpBliO,KAAKkiO,OAAS,MAEhBliO,KAAKw7O,SAAW,KAChBx7O,KAAKy7O,UAAY,KAfJloV,EAAQ,WAiBvBk/R,CAAS2oD,EAAYrY,GAErBqY,EAAWz9O,UAAUg4D,OAAS,SAAUjJ,EAAMgvL,EAAUC,GAClC,iBAATjvL,IACTA,EAAOu2F,EAAOx5F,KAAKiD,EAAMgvL,QAGvBE,EAAU57O,KAAKytK,QAAQ/gH,UACvB1sD,KAAKq7O,SAAiBr7O,MAEtB27O,IACFC,EAAU57O,KAAK67O,UAAUD,EAASD,IAG7BC,IAGTR,EAAWz9O,UAAUm+O,eAAiB,aACtCV,EAAWz9O,UAAUo+O,WAAa,qBACtBjjP,MAAM,gDAGlBsiP,EAAWz9O,UAAUq+O,WAAa,qBACtBljP,MAAM,gDAGlBsiP,EAAWz9O,UAAUs+O,OAAS,qBAClBnjP,MAAM,2CAGlBsiP,EAAWz9O,UAAUulO,WAAa,SAAUx2K,EAAMvxE,EAAGiC,OAC/Cqc,MAEEuG,KAAKq7O,SACPr7O,KAAKytK,QAAQ/gH,GAEb1sD,KAAKl1B,KAAKk1B,KAAKytK,QAAQ/gH,UAElB34J,GACP0lG,EAAM1lG,UAENqpF,EAAKqc,KAGT2hP,EAAWz9O,UAAUwlO,OAAS,SAAUr5J,OAClCrwE,MAEFuG,KAAKl1B,KAAKk1B,KAAKu7O,iBACRxnV,GACP0lG,EAAM1lG,EAGR+1K,EAAKrwE,IAEP2hP,EAAWz9O,UAAU29O,eAAiB,SAAUK,OAC1CC,EAAU57O,KAAKu7O,WAAat4F,EAAOO,MAAM,UACzCm4F,IACFC,EAAU57O,KAAK67O,UAAUD,EAASD,GAAW,IAExCC,GAGTR,EAAWz9O,UAAUk+O,UAAY,SAAUnoV,EAAOipO,EAAKu/G,MAChDl8O,KAAKw7O,WACRx7O,KAAKw7O,SAAAA,IAAepX,EAAcznG,GAClC38H,KAAKy7O,UAAY9+G,GAGf38H,KAAKy7O,YAAc9+G,EAAAA,MAAAA,IAAe7jI,MAAM,8BAExCioC,EAAM/gC,KAAKw7O,SAAS72F,MAAMjxP,UAC1BwoV,IACFn7M,GAAO/gC,KAAKw7O,SAASx2Q,OAGhB+7D,GAGT1tI,EAAOC,QAAU8nV,4GClGjB,iBACI3oD,EAAWl/R,EAAQ,YACnB4oV,EAAS5oV,EAAQ,YACjBwpO,EAAOxpO,EAAQ,eACf0vP,EAAS1vP,EAAQ,eAAe0vP,OAChC9hB,EAAM5tO,EAAQ,mBACdq/S,EAAYr/S,EAAQ,aAEpB0sR,EAAM1sR,EAAQ,UAEd6oV,EAAQn5F,EAAOO,MAAM,KAEzB,SAAA4vD,EAAelyB,EAAKlsR,GAClB+nO,EAAKn/H,KAAKoC,KAAM,UACG,iBAARhrG,IACTA,EAAMiuP,EAAOx5F,KAAKz0J,QAGhBqnV,EAAqB,WAARn7D,GAA4B,WAARA,EAAoB,IAAM,IAE/DlhL,KAAKs8O,KAAOp7D,EACZlhL,KAAKjD,KAAO/nG,EACRA,EAAIiwE,OAASo3Q,GAEfrnV,GADmB,WAARksR,EAAQ,IAAe0xB,EAAc3yB,EAAIiB,IACzCvrH,OAAO3gK,GAAKkkO,SACdlkO,EAAIiwE,OAASo3Q,IACtBrnV,EAAMiuP,EAAOpxJ,OAAAA,CAAQ78F,EAAKonV,GAAQC,YAGhCE,EAAOv8O,KAAKw8O,MAAQv5F,EAAOiE,YAAYm1F,GACvCI,EAAOz8O,KAAK08O,MAAQz5F,EAAOiE,YAAYm1F,GAElCl1Q,EAAI,EAAGA,EAAIk1Q,EAAWl1Q,IAC7Bo1Q,EAAKp1Q,GAAc,GAATnyE,EAAImyE,GACds1Q,EAAKt1Q,GAAc,GAATnyE,EAAImyE,GAEhB64B,KAAKiiO,MAAgB,WAAR/gD,EAAQ,IAAe0xB,EAAc3yB,EAAIiB,GACtDlhL,KAAKiiO,MAAMtsK,OAAO4mL,GAGpB9pD,EAAS2gB,EAAMr2E,GAEfq2E,EAAKz1M,UAAU8vK,QAAU,SAAU/gH,GACjC1sD,KAAKiiO,MAAMtsK,OAAOjJ,IAGpB0mJ,EAAKz1M,UAAUukO,OAAS,eAClBz6J,EAAIznE,KAAKiiO,MAAM/oG,gBACM,WAAdl5H,KAAKs8O,KAAS,IAAe1pC,EAAc3yB,EAAIjgL,KAAKs8O,OACnD3mL,OAAO31D,KAAK08O,OAAO/mL,OAAO8R,GAAGyxD,UAG3C7lO,EAAOC,QAAU,SAAqB4tR,EAAKlsR,SAE7B,YADZksR,EAAMA,EAAI93M,gBACsB,cAAR83M,MACXkyB,EAAK,SAAUp+S,GAEhB,QAARksR,MACSi7D,EAAOh7G,EAAKnsO,OAEdo+S,EAAKlyB,EAAKlsR,8KC5DvB,iBACIy9R,EAAWl/R,EAAQ,YACnB0vP,EAAS1vP,EAAQ,eAAe0vP,OAEhClmB,EAAOxpO,EAAQ,eAEf6oV,EAAQn5F,EAAOO,MAAM,KACrB64F,EAAY,GAEhB,SAAAjpC,EAAelyB,EAAKlsR,GAClB+nO,EAAKn/H,KAAKoC,KAAM,UACG,iBAARhrG,IACTA,EAAMiuP,EAAOx5F,KAAKz0J,IAGpBgrG,KAAKs8O,KAAOp7D,EACZlhL,KAAKjD,KAAO/nG,EAERA,EAAIiwE,OAASo3Q,EACfrnV,EAAMksR,EAAIlsR,GACDA,EAAIiwE,OAASo3Q,IACtBrnV,EAAMiuP,EAAOpxJ,OAAAA,CAAQ78F,EAAKonV,GAAQC,YAGhCE,EAAOv8O,KAAKw8O,MAAQv5F,EAAOiE,YAAYm1F,GACvCI,EAAOz8O,KAAK08O,MAAQz5F,EAAOiE,YAAYm1F,GAElCl1Q,EAAI,EAAGA,EAAIk1Q,EAAWl1Q,IAC7Bo1Q,EAAKp1Q,GAAc,GAATnyE,EAAImyE,GACds1Q,EAAKt1Q,GAAc,GAATnyE,EAAImyE,GAGhB64B,KAAKiiO,MAAAA,CAASsa,GAGhB9pD,EAAS2gB,EAAMr2E,GAEfq2E,EAAKz1M,UAAU8vK,QAAU,SAAU/gH,GACjC1sD,KAAKiiO,MAAMn3P,KAAK4hF,IAGlB0mJ,EAAKz1M,UAAUukO,OAAS,eAClBz6J,EAAIznE,KAAKs8O,KAAKr5F,EAAOpxJ,OAAOmO,KAAKiiO,eAC9BjiO,KAAKs8O,KAAKr5F,EAAOpxJ,OAAAA,CAAQmO,KAAK08O,MAAOj1K,MAE9Cp0K,EAAOC,QAAU8/S,4FC7CjB,IAAA4uB,EAAAzuU,EAAA,UAEAF,EAAAC,QAAA,SAAAu8M,GACA,OAAA,IAAAmyH,GAAArsK,OAAAk6C,GAAAqpB,wDCHA7lO,EAAAC,QAAAC,EAAA,otECAAD,EAAAkrQ,OAAAjrQ,EAAA,eACAD,EAAAq2Q,WAAAp2Q,EAAA,0FCMIopV,EAkCA/kK,iBAzCAqrE,EAAS1vP,EAAQ,eAAe0vP,OAEhC25F,EAAkBrpV,EAAQ,kBAC1B4yU,EAAkB5yU,EAAQ,sBAC1BoyU,EAAOpyU,EAAQ,UACfqhS,EAAWrhS,EAAQ,eAGnBy/Q,EAASxzK,EAAOwuH,QAAUxuH,EAAOwuH,OAAOglD,OACxC6pE,EAAAA,CACF58D,IAAK,QACL68D,QAAS,QACT78G,KAAM,QACN2rC,OAAQ,UACRmxE,UAAW,UACX57D,OAAQ,UACR67D,UAAW,UACXC,UAAW,UACX3/E,OAAQ,WAEN4/E,EAAAA,GACJ,SAAAC,EAAsBC,MAChB59O,EAAOsyF,UAAYtyF,EAAOsyF,QAAQqjC,eAC7BpvD,QAAQC,SAAQ,OAEpBgtG,IAAWA,EAAO0M,YAAc1M,EAAO+mC,kBACnCh0I,QAAQC,SAAQ,WAEJtwK,IAAjBwnV,EAAOE,UACFF,EAAOE,OAGZC,EAAOC,EADXX,EAAWA,GAAY15F,EAAOO,MAAM,GACDm5F,EAAU,GAAI,IAAKS,GACnDn/O,MAAK,kBACG,KACNC,OAAM,kBACA,YAEXg/O,EAAOE,GAAQC,EACRA,EAGT,SAAAE,WACM3lK,IAIFA,EADEp4E,EAAOsyF,SAAWtyF,EAAOsyF,QAAQla,SACxBp4E,EAAOsyF,QAAQla,SACjBp4E,EAAOg+O,eACLh+O,EAAOg+O,eACTh+O,EAAO2zJ,aACL3zJ,EAAO2zJ,aAEP3zJ,EAAOqrE,YAItB,SAAAyyK,EAAwBnmH,EAAU0mC,EAAMmD,EAAY/7L,EAAQm4Q,UACnDpqE,EAAO0M,UACZ,MAAOvoD,EAAAA,CAAYtkO,KAAM,WAAY,EAAA,CAAQ,eAC7CorG,MAAK,SAAUjpG,UACRg+Q,EAAO+mC,WAAAA,CACZlnT,KAAM,SACNgrQ,KAAMA,EACNmD,WAAYA,EACZ3tJ,KAAAA,CACExgH,KAAMuqV,IAEPpoV,EAAKiwE,GAAU,MACjBg5B,MAAK,SAAUlyB,UACTk3K,EAAOx5F,KAAK19E,MAIvB,SAAA0xQ,EAAyBpoI,EAASh7C,GAChCg7C,EAAQp3G,MAAK,SAAU8iC,GACrBw8M,GAAAA,EAAc,WACZljL,EAAS,KAAMt5B,SAEhB,SAAUhtI,GACXwpV,GAAAA,EAAc,WACZljL,EAAStmK,SAIfV,EAAOC,QAAU,SAAU6jO,EAAU0mC,EAAMmD,EAAYqJ,EAAQnxC,EAAQ7+D,GAC/C,mBAAX6+D,IACT7+D,EAAW6+D,EACXA,OAASxjO,OAIP0nV,EAAOP,GADX3jH,EAASA,GAAU,QACS9vJ,kBAEvBg0Q,GAAkC,mBAAnB59O,EAAOumE,YAa3B62K,EAAgB57E,EAAYqJ,GAC5BlzC,EAAWy9D,EAASz9D,EAAUgvG,EAAiB,YAC/CtoE,EAAO+2B,EAAS/2B,EAAMsoE,EAAiB,QACf,mBAAb9rK,EAAa,MAAA,IAAsBvhE,MAAM,kCAEpD2kP,EAAeN,EAAYC,GAAMn/O,MAAK,SAAUy/O,UAC1CA,EAAaJ,EAAcnmH,EAAU0mC,EAAMmD,EAAYqJ,EAAQ+yE,GAE5DzX,EAAKxuG,EAAU0mC,EAAMmD,EAAYqJ,EAAQnxC,MAC9C7+D,QArBFkjL,GAAAA,EAAc,eACRx8M,MAEFA,EAAM4kM,EAAKxuG,EAAU0mC,EAAMmD,EAAYqJ,EAAQnxC,SACxCnlO,UACAsmK,EAAStmK,GAElBsmK,EAAS,KAAMt5B,uJCtGrB,IAAA48M,EAAA/3Q,KAAAy5J,IAAA,EAAA,IAAA,EAEAhsO,EAAAC,QAAA,SAAA0tQ,EAAAqJ,GACA,GAAA,iBAAArJ,EACA,MAAA,IAAAj8J,UAAA,2BAGA,GAAAi8J,EAAA,EACA,MAAA,IAAAj8J,UAAA,kBAGA,GAAA,iBAAAslK,EACA,MAAA,IAAAtlK,UAAA,2BAGA,GAAAslK,EAAA,GAAAA,EAAAszE,GAAAtzE,GAAAA,EACA,MAAA,IAAAtlK,UAAA,qDChBIohO,mCAEA3mO,EAAOsyF,SAAWtyF,EAAOsyF,QAAQqjC,QACnCgxG,EAAkB,gBACT3mO,EAAOsyF,SAAWtyF,EAAOsyF,QAAQpuF,QAAAA,KACtCk6O,EAAgBx3Q,SAAS0rH,EAAQpuF,QAAQ5jB,MAAM,KAAK,GAAG1a,MAAM,GAAI,IAErE+gQ,EAAkByX,GAAiB,EAAI,QAAU,cAEjDzX,EAAkB,QAEpB9yU,EAAOC,QAAU6yU,iDCXbhlG,EAAM5tO,EAAQ,mBACdq/S,EAAYr/S,EAAQ,aACpB0sR,EAAM1sR,EAAQ,UACd0vP,EAAS1vP,EAAQ,eAAe0vP,OAEhC25F,EAAkBrpV,EAAQ,kBAC1B4yU,EAAkB5yU,EAAQ,sBAC1BqhS,EAAWrhS,EAAQ,eAEnB6oV,EAAQn5F,EAAOO,MAAM,KACrBq6F,EAAAA,CACF18G,IAAK,GACLlB,KAAM,GACNmhD,OAAQ,GACRxV,OAAQ,GACRuV,OAAQ,GACR7jB,OAAQ,GACRwgF,OAAQ,GACRhxC,UAAW,IAGb,SAAAsG,EAAelyB,EAAKlsR,EAAK+oV,OACnB1qO,EAkCN,SAAoB6tK,GAClB,SAAA88D,EAAkBtxL,UACTuzH,EAAIiB,GAAKvrH,OAAOjJ,GAAMwsE,SAE/B,SAAA+kH,EAAqBvxL,cACRkmJ,GAAYj9I,OAAOjJ,GAAMwsE,eAG1B,WAARgoD,GAA4B,cAARA,EAA4B+8D,EACxC,QAAR/8D,EAAsB//C,EACnB68G,EA5CIE,CAAUh9D,GACjBm7D,EAAqB,WAARn7D,GAA4B,WAARA,EAAoB,IAAM,GAE3DlsR,EAAIiwE,OAASo3Q,EACfrnV,EAAMq+G,EAAKr+G,GACFA,EAAIiwE,OAASo3Q,IACtBrnV,EAAMiuP,EAAOpxJ,OAAAA,CAAQ78F,EAAKonV,GAAQC,YAGhCE,EAAOt5F,EAAOiE,YAAYm1F,EAAYwB,EAAM38D,IAC5Cu7D,EAAOx5F,EAAOiE,YAAYm1F,EAAYwB,EAAM38D,IACvC/5M,EAAI,EAAGA,EAAIk1Q,EAAWl1Q,IAC7Bo1Q,EAAKp1Q,GAAc,GAATnyE,EAAImyE,GACds1Q,EAAKt1Q,GAAc,GAATnyE,EAAImyE,OAGZg3Q,EAAQl7F,EAAOiE,YAAYm1F,EAAY0B,EAAU,GACrDxB,EAAKt/U,KAAKkhV,EAAO,EAAG,EAAG9B,GACvBr8O,KAAKm+O,MAAQA,EACbn+O,KAAKo+O,MAAQ7B,EACbv8O,KAAKy8O,KAAOA,EACZz8O,KAAKkhL,IAAMA,EACXlhL,KAAKq8O,UAAYA,EACjBr8O,KAAKqT,KAAOA,EACZrT,KAAK/C,KAAO4gP,EAAM38D,GAGpBkyB,EAAKz1M,UAAUm3H,IAAM,SAAUpoE,EAAM6vL,UACnC7vL,EAAKzvJ,KAAKs/U,EAAMv8O,KAAKq8O,WACbr8O,KAAKqT,KAAKkpO,GAChBt/U,KAAK+iG,KAAKy8O,KAAMz8O,KAAKq8O,WAChBr8O,KAAKqT,KAAKrT,KAAKy8O,OAmDxBppV,EAAOC,QAnCP,SAAiB6jO,EAAU0mC,EAAMmD,EAAYqJ,EAAQnxC,GACnD0jH,EAAgB57E,EAAYqJ,OAMxBP,EAAAA,IAAWspC,EAFfl6E,EAASA,GAAU,OAHnB/B,EAAWy9D,EAASz9D,EAAUgvG,EAAiB,aAC/CtoE,EAAO+2B,EAAS/2B,EAAMsoE,EAAiB,SAIIlhQ,QAEvCo5Q,EAAKp7F,EAAOiE,YAAYmjB,GACxBi0E,EAASr7F,EAAOiE,YAAY2W,EAAK54L,OAAS,GAC9C44L,EAAK5gQ,KAAKqhV,EAAQ,EAAG,EAAGzgF,EAAK54L,gBAEzBs5Q,EAAU,EACV30E,EAAOi0E,EAAM3kH,GACbnwI,EAAInjB,KAAKwhL,KAAKijB,EAAST,GAElBziM,EAAI,EAAGA,GAAK4hB,EAAG5hB,IAAAA,CACtBm3Q,EAAOzpB,cAAc1tP,EAAG02L,EAAK54L,gBAEzB0gJ,EAAImkD,EAAKh1C,IAAIwpH,EAAQx0E,EAAKq0E,OAC1Bn5H,EAAIW,EAECr0H,EAAI,EAAGA,EAAI0vK,EAAY1vK,IAAAA,CAC9B0zH,EAAI8kD,EAAKh1C,IAAI9P,EAAG8kD,EAAKs0E,eACZ/pV,EAAI,EAAGA,EAAIu1Q,EAAMv1Q,IAAKsxN,EAAEtxN,IAAM2wN,EAAE3wN,GAG3CsxN,EAAE1oN,KAAKohV,EAAIE,GACXA,GAAW30E,SAGNy0E,mMCrGLp7F,EAAS1vP,EAAQ,eAAe0vP,OAEpC5vP,EAAOC,QAAU,SAAUi7U,EAAOhyG,EAAU1pO,MACtCowP,EAAO8H,SAASwjF,UACXA,KACmB,iBAAVA,SACTtrF,EAAOx5F,KAAK8kL,EAAOhyG,MACjB0B,YAAYC,OAAOqwG,UACrBtrF,EAAOx5F,KAAK8kL,EAAM1+H,kBAEf9qG,UAAUlyG,EAAO,8GCV/B,IAAA2rV,EAAAjrV,EAAA,kBACA4qQ,EAAA5qQ,EAAA,0BACAkrV,EAAAlrV,EAAA,wBACAmrV,EAAAnrV,EAAA,wBACAorV,EAAAprV,EAAA,kBAsCA,SAAAknT,EAAAmkC,EAAA5pV,EAAAypQ,GAEA,GADAmgF,EAAAA,EAAAx1Q,cACAq1Q,EAAAG,GAAA,OAAAzgF,EAAAs8C,eAAAmkC,EAAA5pV,EAAAypQ,GACA,GAAAigF,EAAAE,GAAA,OAAA,IAAAJ,EAAA,CAAAxpV,IAAAA,EAAAypQ,GAAAA,EAAA/jL,KAAAkkQ,IAEA,MAAA,IAAA75O,UAAA,sBAGA,SAAA41M,EAAAikC,EAAA5pV,EAAAypQ,GAEA,GADAmgF,EAAAA,EAAAx1Q,cACAq1Q,EAAAG,GAAA,OAAAzgF,EAAAw8C,iBAAAikC,EAAA5pV,EAAAypQ,GACA,GAAAigF,EAAAE,GAAA,OAAA,IAAAJ,EAAA,CAAAxpV,IAAAA,EAAAypQ,GAAAA,EAAA/jL,KAAAkkQ,EAAAr9E,SAAA,IAEA,MAAA,IAAAx8J,UAAA,sBAOAzxG,EAAA2wQ,aAAA3wQ,EAAAgsU,OAxDA,SAAAsf,EAAAznH,GAGA,IAAA0nH,EAAA7gF,EACA,GAHA4gF,EAAAA,EAAAx1Q,cAGAq1Q,EAAAG,GACAC,EAAAJ,EAAAG,GAAA5pV,IACAgpQ,EAAAygF,EAAAG,GAAAngF,OACA,CAAA,IAAAigF,EAAAE,GAIA,MAAA,IAAA75O,UAAA,sBAHA85O,EAAA,EAAAH,EAAAE,GAAA5pV,IACAgpQ,EAAA0gF,EAAAE,GAAAngF,GAKA,IAAAtqQ,EAAAwqV,EAAAxnH,GAAA,EAAA0nH,EAAA7gF,GACA,OAAAy8C,EAAAmkC,EAAAzqV,EAAAa,IAAAb,EAAAsqQ,KA0CAnrQ,EAAAmnT,eAAAnnT,EAAAisU,SAAA9kB,EACAnnT,EAAA0wQ,eAAA1wQ,EAAAksU,SAxCA,SAAAof,EAAAznH,GAGA,IAAA0nH,EAAA7gF,EACA,GAHA4gF,EAAAA,EAAAx1Q,cAGAq1Q,EAAAG,GACAC,EAAAJ,EAAAG,GAAA5pV,IACAgpQ,EAAAygF,EAAAG,GAAAngF,OACA,CAAA,IAAAigF,EAAAE,GAIA,MAAA,IAAA75O,UAAA,sBAHA85O,EAAA,EAAAH,EAAAE,GAAA5pV,IACAgpQ,EAAA0gF,EAAAE,GAAAngF,GAKA,IAAAtqQ,EAAAwqV,EAAAxnH,GAAA,EAAA0nH,EAAA7gF,GACA,OAAA28C,EAAAikC,EAAAzqV,EAAAa,IAAAb,EAAAsqQ,KA0BAnrQ,EAAAqnT,iBAAArnT,EAAAmsU,WAAA9kB,EACArnT,EAAAqsU,YAAArsU,EAAAosU,WARA,WACA,OAAAlsU,OAAAW,KAAAuqV,GAAA7sP,OAAAssK,EAAAuhE,+LC3DI0b,EAAa7nV,EAAQ,eACrB8qQ,EAAM9qQ,EAAQ,UACdk/R,EAAWl/R,EAAQ,YACnB0vP,EAAS1vP,EAAQ,eAAe0vP,OAEhCif,EAAAA,CACF48E,eAAgBzgF,EAAI0gF,IAAIC,YAAY3gF,EAAI4gF,KACxCC,WAAY7gF,EAAI4gF,IAChBE,cAAe9gF,EAAI0gF,IAAIC,YAAY3gF,EAAI4gF,KACvCG,UAAW/gF,EAAI4gF,IACfI,UAAWhhF,EAAI0gF,IAAIC,YAAY3gF,EAAImgF,KACnCc,UAAWjhF,EAAImgF,KAMjB,SAAAA,EAAcz9K,GACZq6K,EAAWx9O,KAAKoC,UAGZl5B,EAFAy4Q,EAAWx+K,EAAKrmF,KAAKtR,cACrBsR,EAAOwnL,EAAMq9E,GAGfz4Q,EADEi6F,EAAKwgG,QACA,UAEA,cAELvsQ,EAAM+rK,EAAK/rK,IACViuP,EAAO8H,SAAS/1P,KACnBA,EAAMiuP,EAAOx5F,KAAKz0J,IAEH,YAAbuqV,GAAuC,gBAAbA,IAC5BvqV,EAAMiuP,EAAOpxJ,OAAAA,CAAQ78F,EAAKA,EAAIowE,MAAM,EAAG,UAErCq5L,EAAK19F,EAAK09F,GACTxb,EAAO8H,SAAS0T,KACnBA,EAAKxb,EAAOx5F,KAAKg1G,IAEnBz+J,KAAKw/O,KAAO9kQ,EAAKxmF,OAAAA,CACfc,IAAKA,EACLypQ,GAAIA,EACJ33L,KAAMA,IA5BVo7L,EAAM7D,IAAM6D,EAAM,WAClBA,EAAMu9E,KAAOv9E,EAAM,gBACnB7uQ,EAAOC,QAAUkrV,EACjB/rD,EAAS+rD,EAAKpD,GA4BdoD,EAAI7gP,UAAU8vK,QAAU,SAAU/gH,UACzBu2F,EAAOx5F,KAAKzpD,KAAKw/O,KAAK7pL,OAAOjJ,KAEtC8xL,EAAI7gP,UAAUukO,OAAS,kBACdj/E,EAAOx5F,KAAKzpD,KAAKw/O,KAAK5O,qHChD/B,aAEAt9U,EAAAitR,MAAAhtR,EAAA,eACAD,EAAAgsU,OAAA/rU,EAAA,gBACAD,EAAAkrV,IAAAjrV,EAAA,aACAD,EAAAyrV,IAAAxrV,EAAA,aACAD,EAAA2rV,IAAA1rV,EAAA,mJCNA,aAEAD,EAAAogU,aAAA,SAAA/6F,EAAApD,GAKA,OAJAoD,EAAA,EAAApD,IAAA,GACAoD,EAAA,EAAApD,IAAA,GACAoD,EAAA,EAAApD,IAAA,EACAoD,EAAA,EAAApD,MACA,GAGAjiO,EAAAuhU,cAAA,SAAAl8F,EAAAjlO,EAAA6hO,GACAoD,EAAA,EAAApD,GAAA7hO,IAAA,GACAilO,EAAA,EAAApD,GAAA7hO,IAAA,GAAA,IACAilO,EAAA,EAAApD,GAAA7hO,IAAA,EAAA,IACAilO,EAAA,EAAApD,GAAA,IAAA7hO,GAGAJ,EAAAinQ,GAAA,SAAAmlF,EAAAC,EAAA5+M,EAAAw0F,GAIA,IAHA,IAAAqqH,EAAA,EACAC,EAAA,EAEA14Q,EAAA,EAAAA,GAAA,EAAAA,GAAA,EAAA,CACA,IAAA,IAAAmqB,EAAA,EAAAA,GAAA,GAAAA,GAAA,EACAsuP,IAAA,EACAA,GAAAD,IAAAruP,EAAAnqB,EAAA,EAEA,IAAAmqB,EAAA,EAAAA,GAAA,GAAAA,GAAA,EACAsuP,IAAA,EACAA,GAAAF,IAAApuP,EAAAnqB,EAAA,EAIA,IAAAA,EAAA,EAAAA,GAAA,EAAAA,GAAA,EAAA,CACA,IAAAmqB,EAAA,EAAAA,GAAA,GAAAA,GAAA,EACAuuP,IAAA,EACAA,GAAAF,IAAAruP,EAAAnqB,EAAA,EAEA,IAAAmqB,EAAA,EAAAA,GAAA,GAAAA,GAAA,EACAuuP,IAAA,EACAA,GAAAH,IAAApuP,EAAAnqB,EAAA,EAIA45D,EAAAw0F,EAAA,GAAAqqH,IAAA,EACA7+M,EAAAw0F,EAAA,GAAAsqH,IAAA,GAGAvsV,EAAAwsV,IAAA,SAAAJ,EAAAC,EAAA5+M,EAAAw0F,GAIA,IAHA,IAAAqqH,EAAA,EACAC,EAAA,EAEA14Q,EAAA,EAAAA,EAAA,EAAAA,IACA,IAAA,IAAAmqB,EAAA,GAAAA,GAAA,EAAAA,GAAA,EACAsuP,IAAA,EACAA,GAAAD,IAAAruP,EAAAnqB,EAAA,EACAy4Q,IAAA,EACAA,GAAAF,IAAApuP,EAAAnqB,EAAA,EAGA,IAAAA,EAAA,EAAAA,EAAA,EAAAA,IACA,IAAAmqB,EAAA,GAAAA,GAAA,EAAAA,GAAA,EACAuuP,IAAA,EACAA,GAAAF,IAAAruP,EAAAnqB,EAAA,EACA04Q,IAAA,EACAA,GAAAH,IAAApuP,EAAAnqB,EAAA,EAIA45D,EAAAw0F,EAAA,GAAAqqH,IAAA,EACA7+M,EAAAw0F,EAAA,GAAAsqH,IAAA,GAGAvsV,EAAAysV,IAAA,SAAAL,EAAAC,EAAA5+M,EAAAw0F,GAQA,IAPA,IAAAqqH,EAAA,EACAC,EAAA,EAMA14Q,EAAA,EAAAA,GAAA,EAAAA,IAAA,CACA,IAAA,IAAAmqB,EAAA,EAAAA,GAAA,GAAAA,GAAA,EACAsuP,IAAA,EACAA,GAAAD,GAAAruP,EAAAnqB,EAAA,EAEA,IAAAmqB,EAAA,EAAAA,GAAA,GAAAA,GAAA,EACAsuP,IAAA,EACAA,GAAAF,GAAApuP,EAAAnqB,EAAA,EAGA,IAAAmqB,EAAA,EAAAA,GAAA,GAAAA,GAAA,EACAsuP,IAAA,EACAA,GAAAD,GAAAruP,EAAAnqB,EAAA,EAOA,IAAAA,EAAA,EAAAA,GAAA,EAAAA,IAAA,CACA,IAAAmqB,EAAA,EAAAA,GAAA,GAAAA,GAAA,EACAuuP,IAAA,EACAA,GAAAF,GAAAruP,EAAAnqB,EAAA,EAEA,IAAAmqB,EAAA,EAAAA,GAAA,GAAAA,GAAA,EACAuuP,IAAA,EACAA,GAAAH,GAAApuP,EAAAnqB,EAAA,EAGA,IAAAmqB,EAAA,EAAAA,GAAA,GAAAA,GAAA,EACAuuP,IAAA,EACAA,GAAAH,GAAApuP,EAAAnqB,EAAA,EAGA45D,EAAAw0F,EAAA,GAAAqqH,IAAA,EACA7+M,EAAAw0F,EAAA,GAAAsqH,IAAA,GAGAvsV,EAAA0sV,OAAA,SAAAtuO,EAAA/M,GACA,OAAA+M,GAAA/M,EAAA,UAAA+M,IAAA,GAAA/M,GAGA,IAAAs7O,EAAA,CAEA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EACA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GACA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAGA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GACA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EACA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAGA3sV,EAAA4sV,IAAA,SAAAR,EAAAC,EAAA5+M,EAAAw0F,GAKA,IAJA,IAAAqqH,EAAA,EACAC,EAAA,EAEAz8O,EAAA68O,EAAAh7Q,SAAA,EACAkC,EAAA,EAAAA,EAAAi8B,EAAAj8B,IACAy4Q,IAAA,EACAA,GAAAF,IAAAO,EAAA94Q,GAAA,EAEA,IAAAA,EAAAi8B,EAAAj8B,EAAA84Q,EAAAh7Q,OAAAkC,IACA04Q,IAAA,EACAA,GAAAF,IAAAM,EAAA94Q,GAAA,EAGA45D,EAAAw0F,EAAA,GAAAqqH,IAAA,EACA7+M,EAAAw0F,EAAA,GAAAsqH,IAAA,GAGAvsV,EAAA6sV,OAAA,SAAAnyO,EAAA+yB,EAAAw0F,GACA,IAAAqqH,EAAA,EACAC,EAAA,EAEAD,GAAA,EAAA5xO,IAAA,EAAAA,IAAA,GACA,IAAA,IAAA7mC,EAAA,GAAAA,GAAA,GAAAA,GAAA,EACAy4Q,IAAA,EACAA,GAAA5xO,IAAA7mC,EAAA,GAEA,IAAAA,EAAA,GAAAA,GAAA,EAAAA,GAAA,EACA04Q,GAAA7xO,IAAA7mC,EAAA,GACA04Q,IAAA,EAEAA,IAAA,GAAA7xO,IAAA,EAAAA,IAAA,GAEA+yB,EAAAw0F,EAAA,GAAAqqH,IAAA,EACA7+M,EAAAw0F,EAAA,GAAAsqH,IAAA,GAGA,IAAAO,EAAA,CACA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EACA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EACA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAEA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EACA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EACA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAEA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GACA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EACA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EACA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAEA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EACA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EACA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAEA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EACA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GACA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAEA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EACA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GACA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAEA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GACA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EACA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAEA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EACA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EACA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GACA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAGA9sV,EAAA+sV,WAAA,SAAAX,EAAAC,GAEA,IADA,IAAA5+M,EAAA,EACA55D,EAAA,EAAAA,EAAA,EAAAA,IAAA,CAIA45D,IAAA,EACAA,GAHAq/M,EAAA,GAAAj5Q,GADAu4Q,IAAA,GAAA,EAAAv4Q,EAAA,KAMA,IAAAA,EAAA,EAAAA,EAAA,EAAAA,IAAA,CAIA45D,IAAA,EACAA,GAHAq/M,EAAA,IAAA,GAAAj5Q,GADAw4Q,IAAA,GAAA,EAAAx4Q,EAAA,KAMA,OAAA45D,IAAA,GAGA,IAAAu/M,EAAA,CACA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GACA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAGAhtV,EAAA8nS,QAAA,SAAA1pL,GAEA,IADA,IAAAqvB,EAAA,EACA55D,EAAA,EAAAA,EAAAm5Q,EAAAr7Q,OAAAkC,IACA45D,IAAA,EACAA,GAAArvB,IAAA4uO,EAAAn5Q,GAAA,EAEA,OAAA45D,IAAA,GAGAztI,EAAAitV,SAAA,SAAA7uO,EAAAzU,EAAAwmH,GAEA,IADA,IAAAjuH,EAAAkc,EAAAtT,SAAA,GACA5I,EAAAvwB,OAAAg4B,GACAzH,EAAA,IAAAA,EAGA,IADA,IAAAurC,EAAA,GACA55D,EAAA,EAAAA,EAAA81B,EAAA91B,GAAAs8I,EACA1iF,EAAAj2D,KAAA0qB,EAAApwB,MAAA+B,EAAAA,EAAAs8I,IACA,OAAA1iF,EAAAz2D,KAAA,kCC9PA,aAEA,IAAAuuB,EAAAtlG,EAAA,uBAEA,SAAA+rU,EAAA3qU,GACAqrG,KAAArrG,QAAAA,EAEAqrG,KAAAl5B,KAAAk5B,KAAArrG,QAAAmyE,KACAk5B,KAAAyhK,UAAA,EACAzhK,KAAA+hK,QAEA/hK,KAAA6vG,OAAA,IAAAhyG,MAAAmC,KAAAyhK,WACAzhK,KAAAwgP,UAAA,EAEAntV,EAAAC,QAAAgsU,EAEAA,EAAA3hO,UAAAokK,MAAA,aAIAu9D,EAAA3hO,UAAAg4D,OAAA,SAAAjJ,GACA,OAAA,IAAAA,EAAAznF,OACA,GAEA,YAAA+6B,KAAAl5B,KACAk5B,KAAAygP,eAAA/zL,GAEA1sD,KAAA0gP,eAAAh0L,IAGA4yK,EAAA3hO,UAAAgjP,QAAA,SAAAj0L,EAAA6oE,GAGA,IADA,IAAAt7H,EAAAr0B,KAAAq0B,IAAA+F,KAAA6vG,OAAA5qI,OAAA+6B,KAAAwgP,UAAA9zL,EAAAznF,OAAAswJ,GACApuJ,EAAA,EAAAA,EAAA8yB,EAAA9yB,IACA64B,KAAA6vG,OAAA7vG,KAAAwgP,UAAAr5Q,GAAAulF,EAAA6oE,EAAApuJ,GAIA,OAHA64B,KAAAwgP,WAAAvmP,EAGAA,GAGAqlO,EAAA3hO,UAAAijP,aAAA,SAAA7/M,EAAAw0F,GAGA,OAFAv1H,KAAAytK,QAAAztK,KAAA6vG,OAAA,EAAA9uE,EAAAw0F,GACAv1H,KAAAwgP,UAAA,EACAxgP,KAAAyhK,WAGA69D,EAAA3hO,UAAA+iP,eAAA,SAAAh0L,GACA,IAAAm0L,EAAA,EACAC,EAAA,EAEAv9P,GAAAyc,KAAAwgP,UAAA9zL,EAAAznF,QAAA+6B,KAAAyhK,UAAA,EACA1gI,EAAA,IAAAljC,MAAAta,EAAAyc,KAAAyhK,WAEA,IAAAzhK,KAAAwgP,YACAK,GAAA7gP,KAAA2gP,QAAAj0L,EAAAm0L,GAEA7gP,KAAAwgP,YAAAxgP,KAAA6vG,OAAA5qI,SACA67Q,GAAA9gP,KAAA4gP,aAAA7/M,EAAA+/M,KAKA,IADA,IAAAn7Q,EAAA+mF,EAAAznF,QAAAynF,EAAAznF,OAAA47Q,GAAA7gP,KAAAyhK,UACAo/E,EAAAl7Q,EAAAk7Q,GAAA7gP,KAAAyhK,UACAzhK,KAAAytK,QAAA/gH,EAAAm0L,EAAA9/M,EAAA+/M,GACAA,GAAA9gP,KAAAyhK,UAIA,KAAAo/E,EAAAn0L,EAAAznF,OAAA47Q,IAAA7gP,KAAAwgP,YACAxgP,KAAA6vG,OAAA7vG,KAAAwgP,WAAA9zL,EAAAm0L,GAEA,OAAA9/M,GAGAu+L,EAAA3hO,UAAA8iP,eAAA,SAAA/zL,GAQA,IAPA,IAAAm0L,EAAA,EACAC,EAAA,EAEAv9P,EAAA3d,KAAAwhL,MAAApnJ,KAAAwgP,UAAA9zL,EAAAznF,QAAA+6B,KAAAyhK,WAAA,EACA1gI,EAAA,IAAAljC,MAAAta,EAAAyc,KAAAyhK,WAGAl+K,EAAA,EAAAA,IACAs9P,GAAA7gP,KAAA2gP,QAAAj0L,EAAAm0L,GACAC,GAAA9gP,KAAA4gP,aAAA7/M,EAAA+/M,GAMA,OAFAD,GAAA7gP,KAAA2gP,QAAAj0L,EAAAm0L,GAEA9/M,GAGAu+L,EAAA3hO,UAAAizO,MAAA,SAAA/gI,GACA,IAAAh3H,EAIAkD,EAMA,OATA8zH,IACAh3H,EAAAmnB,KAAA21D,OAAAk6C,IAIA9zH,EADA,YAAAikB,KAAAl5B,KACAk5B,KAAA+gP,gBAEA/gP,KAAAghP,gBAEAnoQ,EACAA,EAAAgZ,OAAA9V,GAEAA,GAGAujP,EAAA3hO,UAAAyxM,KAAA,SAAAv/F,EAAA0lB,GACA,GAAA,IAAAA,EACA,OAAA,EAEA,KAAAA,EAAA1lB,EAAA5qI,QACA4qI,EAAA0lB,KAAA,EAEA,OAAA,GAGA+pG,EAAA3hO,UAAAojP,cAAA,WACA,IAAA/gP,KAAAovM,KAAApvM,KAAA6vG,OAAA7vG,KAAAwgP,WACA,MAAA,GAEA,IAAAz/M,EAAA,IAAAljC,MAAAmC,KAAAyhK,WAEA,OADAzhK,KAAAytK,QAAAztK,KAAA6vG,OAAA,EAAA9uE,EAAA,GACAA,GAGAu+L,EAAA3hO,UAAAsjP,OAAA,SAAApxI,GACA,OAAAA,GAGAyvH,EAAA3hO,UAAAqjP,cAAA,WACAnoP,EAAAsD,MAAA6D,KAAAwgP,UAAAxgP,KAAAyhK,UAAA,8BACA,IAAA1gI,EAAA,IAAAljC,MAAAmC,KAAAyhK,WAGA,OAFAzhK,KAAA4gP,aAAA7/M,EAAA,GAEA/gC,KAAAihP,OAAAlgN,+DC3IA,aAEA,IAAAloC,EAAAtlG,EAAA,uBACAk/R,EAAAl/R,EAAA,YAEAgtR,EAAAhtR,EAAA,WACA+rU,EAAA/rU,EAAA,YAEA,SAAA2tV,IACAlhP,KAAA5E,IAAA,IAAAyC,MAAA,GACAmC,KAAA7rG,KAAA,KAGA,SAAAqqV,EAAA7pV,GACA2qU,EAAA1hO,KAAAoC,KAAArrG,GAEA,IAAAm0H,EAAA,IAAAo4N,EACAlhP,KAAAmhP,UAAAr4N,EAEA9oB,KAAAohP,WAAAt4N,EAAAn0H,EAAAK,KAEAy9R,EAAA+rD,EAAAlf,GACAjsU,EAAAC,QAAAkrV,EAEAA,EAAAtqV,OAAA,SAAAS,GACA,OAAA,IAAA6pV,EAAA7pV,IAGA,IAAA0sV,EAAA,CACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAGA7C,EAAA7gP,UAAAyjP,WAAA,SAAAt4N,EAAA9zH,GACA8zH,EAAA30H,KAAA,IAAA0pG,MAAA,IAEAhF,EAAAsD,MAAAnnG,EAAAiwE,OAAA+6B,KAAAyhK,UAAA,sBAEA,IAAA6/E,EAAA/gE,EAAAmzC,aAAA1+T,EAAA,GACAusV,EAAAhhE,EAAAmzC,aAAA1+T,EAAA,GAEAurR,EAAAw/D,IAAAuB,EAAAC,EAAAz4N,EAAA1tB,IAAA,GACAkmP,EAAAx4N,EAAA1tB,IAAA,GACAmmP,EAAAz4N,EAAA1tB,IAAA,GACA,IAAA,IAAAj0B,EAAA,EAAAA,EAAA2hD,EAAA30H,KAAA8wE,OAAAkC,GAAA,EAAA,CACA,IAAAw9B,EAAA08O,EAAAl6Q,IAAA,GACAm6Q,EAAA/gE,EAAAy/D,OAAAsB,EAAA38O,GACA48O,EAAAhhE,EAAAy/D,OAAAuB,EAAA58O,GACA47K,EAAA2/D,IAAAoB,EAAAC,EAAAz4N,EAAA30H,KAAAgzE,KAIAq3Q,EAAA7gP,UAAA8vK,QAAA,SAAA+zE,EAAAC,EAAA1gN,EAAA2gN,GACA,IAAA54N,EAAA9oB,KAAAmhP,UAEAp4P,EAAAw3L,EAAAmzC,aAAA8tB,EAAAC,GACAzzO,EAAAuyK,EAAAmzC,aAAA8tB,EAAAC,EAAA,GAGAlhE,EAAAhmB,GAAAxxK,EAAAilB,EAAA8a,EAAA1tB,IAAA,GACArS,EAAA+/B,EAAA1tB,IAAA,GACA4S,EAAA8a,EAAA1tB,IAAA,GAEA,YAAA4E,KAAAl5B,KACAk5B,KAAA2hP,SAAA74N,EAAA//B,EAAAilB,EAAA8a,EAAA1tB,IAAA,GAEA4E,KAAAwkK,SAAA17I,EAAA//B,EAAAilB,EAAA8a,EAAA1tB,IAAA,GAEArS,EAAA+/B,EAAA1tB,IAAA,GACA4S,EAAA8a,EAAA1tB,IAAA,GAEAmlL,EAAAs0C,cAAA9zL,EAAAh4C,EAAA24P,GACAnhE,EAAAs0C,cAAA9zL,EAAA/yB,EAAA0zO,EAAA,IAGAlD,EAAA7gP,UAAAyxM,KAAA,SAAAv/F,EAAA0lB,GAEA,IADA,IAAA7hO,EAAAm8M,EAAA5qI,OAAAswJ,EACApuJ,EAAAouJ,EAAApuJ,EAAA0oI,EAAA5qI,OAAAkC,IACA0oI,EAAA1oI,GAAAzzE,EAEA,OAAA,GAGA8qV,EAAA7gP,UAAAsjP,OAAA,SAAApxI,GAEA,IADA,IAAA71G,EAAA61G,EAAAA,EAAA5qI,OAAA,GACAkC,EAAA0oI,EAAA5qI,OAAA+0B,EAAA7yB,EAAA0oI,EAAA5qI,OAAAkC,IACA0xB,EAAAsD,MAAA0zG,EAAA1oI,GAAA6yB,GAEA,OAAA61G,EAAAzqI,MAAA,EAAAyqI,EAAA5qI,OAAA+0B,IAGAwkP,EAAA7gP,UAAAgkP,SAAA,SAAA74N,EAAA84N,EAAAC,EAAA9gN,EAAAw0F,GAKA,IAJA,IAAAxsI,EAAA64P,EACA5zO,EAAA6zO,EAGA16Q,EAAA,EAAAA,EAAA2hD,EAAA30H,KAAA8wE,OAAAkC,GAAA,EAAA,CACA,IAAA26Q,EAAAh5N,EAAA30H,KAAAgzE,GACA46Q,EAAAj5N,EAAA30H,KAAAgzE,EAAA,GAGAo5M,EAAA4/D,OAAAnyO,EAAA8a,EAAA1tB,IAAA,GAEA0mP,GAAAh5N,EAAA1tB,IAAA,GACA2mP,GAAAj5N,EAAA1tB,IAAA,GACA,IAAAlf,EAAAqkM,EAAA8/D,WAAAyB,EAAAC,GAGAhjM,EAAA/wC,EACAA,GAAAjlB,EAHAw3L,EAAA6a,QAAAl/M,MAGA,EACA6M,EAAAg2D,EAIAwhI,EAAAu/D,IAAA9xO,EAAAjlB,EAAAg4C,EAAAw0F,IAGAipH,EAAA7gP,UAAA6mK,SAAA,SAAA17I,EAAA84N,EAAAC,EAAA9gN,EAAAw0F,GAKA,IAJA,IAAAxsI,EAAA84P,EACA7zO,EAAA4zO,EAGAz6Q,EAAA2hD,EAAA30H,KAAA8wE,OAAA,EAAAkC,GAAA,EAAAA,GAAA,EAAA,CACA,IAAA26Q,EAAAh5N,EAAA30H,KAAAgzE,GACA46Q,EAAAj5N,EAAA30H,KAAAgzE,EAAA,GAGAo5M,EAAA4/D,OAAAp3P,EAAA+/B,EAAA1tB,IAAA,GAEA0mP,GAAAh5N,EAAA1tB,IAAA,GACA2mP,GAAAj5N,EAAA1tB,IAAA,GACA,IAAAlf,EAAAqkM,EAAA8/D,WAAAyB,EAAAC,GAGAhjM,EAAAh2D,EACAA,GAAAilB,EAHAuyK,EAAA6a,QAAAl/M,MAGA,EACA8xB,EAAA+wC,EAIAwhI,EAAAu/D,IAAA/2P,EAAAilB,EAAA+yB,EAAAw0F,qHC5IA,aAEA,IAAA18H,EAAAtlG,EAAA,uBACAk/R,EAAAl/R,EAAA,YAEA82I,EAAA,GAEA,SAAA23M,EAAAvjF,GACA5lK,EAAAsD,MAAAsiK,EAAAx5L,OAAA,EAAA,qBAEA+6B,KAAAy+J,GAAA,IAAA5gK,MAAA,GACA,IAAA,IAAA12B,EAAA,EAAAA,EAAA64B,KAAAy+J,GAAAx5L,OAAAkC,IACA64B,KAAAy+J,GAAAt3L,GAAAs3L,EAAAt3L,GAuBA7zE,EAAA0rV,YApBA,SAAAjiH,GACA,SAAAgiH,EAAApqV,GACAooO,EAAAn/H,KAAAoC,KAAArrG,GACAqrG,KAAAiiP,WAEAxvD,EAAAssD,EAAAhiH,GAGA,IADA,IAAA5oO,EAAAX,OAAAW,KAAAk2I,GACAljE,EAAA,EAAAA,EAAAhzE,EAAA8wE,OAAAkC,IAAA,CACA,IAAAnyE,EAAAb,EAAAgzE,GACA43Q,EAAAphP,UAAA3oG,GAAAq1I,EAAAr1I,GAOA,OAJA+pV,EAAA7qV,OAAA,SAAAS,GACA,OAAA,IAAAoqV,EAAApqV,IAGAoqV,GAKA10M,EAAA43M,SAAA,WACA,IAAAn5N,EAAA,IAAAk5N,EAAAhiP,KAAArrG,QAAA8pQ,IACAz+J,KAAAkiP,UAAAp5N,GAGAuhB,EAAAojI,QAAA,SAAA+zE,EAAAC,EAAA1gN,EAAA2gN,GACA,IAAA54N,EAAA9oB,KAAAkiP,UACAC,EAAAniP,KAAA2M,YAAAgmL,OAAAh1L,UAEA8gK,EAAA31I,EAAA21I,GACA,GAAA,YAAAz+J,KAAAl5B,KAAA,CACA,IAAA,IAAAK,EAAA,EAAAA,EAAA64B,KAAAyhK,UAAAt6L,IACAs3L,EAAAt3L,IAAAq6Q,EAAAC,EAAAt6Q,GAEAg7Q,EAAA10E,QAAA7vK,KAAAoC,KAAAy+J,EAAA,EAAA19H,EAAA2gN,GAEA,IAAAv6Q,EAAA,EAAAA,EAAA64B,KAAAyhK,UAAAt6L,IACAs3L,EAAAt3L,GAAA45D,EAAA2gN,EAAAv6Q,OACA,CACAg7Q,EAAA10E,QAAA7vK,KAAAoC,KAAAwhP,EAAAC,EAAA1gN,EAAA2gN,GAEA,IAAAv6Q,EAAA,EAAAA,EAAA64B,KAAAyhK,UAAAt6L,IACA45D,EAAA2gN,EAAAv6Q,IAAAs3L,EAAAt3L,GAEA,IAAAA,EAAA,EAAAA,EAAA64B,KAAAyhK,UAAAt6L,IACAs3L,EAAAt3L,GAAAq6Q,EAAAC,EAAAt6Q,iFC9DA,aAEA,IAAA0xB,EAAAtlG,EAAA,uBACAk/R,EAAAl/R,EAAA,YAEA+rU,EAAA/rU,EAAA,YACAirV,EAAAjrV,EAAA,SAEA,SAAA6uV,EAAAt7Q,EAAA9xE,GACA6jG,EAAAsD,MAAAnnG,EAAAiwE,OAAA,GAAA,sBAEA,IAAA+3M,EAAAhoR,EAAAowE,MAAA,EAAA,GACAysN,EAAA78R,EAAAowE,MAAA,EAAA,IACA+lP,EAAAn2T,EAAAowE,MAAA,GAAA,IAGA46B,KAAAm/K,QADA,YAAAr4M,EACA,CACA03Q,EAAAtqV,OAAA,CAAA4yE,KAAA,UAAA9xE,IAAAgoR,IACAwhE,EAAAtqV,OAAA,CAAA4yE,KAAA,UAAA9xE,IAAA68R,IACA2sD,EAAAtqV,OAAA,CAAA4yE,KAAA,UAAA9xE,IAAAm2T,KAGA,CACAqzB,EAAAtqV,OAAA,CAAA4yE,KAAA,UAAA9xE,IAAAm2T,IACAqzB,EAAAtqV,OAAA,CAAA4yE,KAAA,UAAA9xE,IAAA68R,IACA2sD,EAAAtqV,OAAA,CAAA4yE,KAAA,UAAA9xE,IAAAgoR,KAKA,SAAAiiE,EAAAtqV,GACA2qU,EAAA1hO,KAAAoC,KAAArrG,GAEA,IAAAm0H,EAAA,IAAAs5N,EAAApiP,KAAAl5B,KAAAk5B,KAAArrG,QAAAK,KACAgrG,KAAAqiP,UAAAv5N,EAEA2pK,EAAAwsD,EAAA3f,GAEAjsU,EAAAC,QAAA2rV,EAEAA,EAAA/qV,OAAA,SAAAS,GACA,OAAA,IAAAsqV,EAAAtqV,IAGAsqV,EAAAthP,UAAA8vK,QAAA,SAAA+zE,EAAAC,EAAA1gN,EAAA2gN,GACA,IAAA54N,EAAA9oB,KAAAqiP,UAEAv5N,EAAAq2J,QAAA,GAAA1R,QAAA+zE,EAAAC,EAAA1gN,EAAA2gN,GACA54N,EAAAq2J,QAAA,GAAA1R,QAAA1sI,EAAA2gN,EAAA3gN,EAAA2gN,GACA54N,EAAAq2J,QAAA,GAAA1R,QAAA1sI,EAAA2gN,EAAA3gN,EAAA2gN,IAGAzC,EAAAthP,UAAAyxM,KAAAovC,EAAA7gP,UAAAyxM,KACA6vC,EAAAthP,UAAAsjP,OAAAzC,EAAA7gP,UAAAsjP,sHCrDA,IAAA9hE,EAAA5rR,EAAA,eACA+uV,EAAA/uV,EAAA,eACA2uQ,EAAA3uQ,EAAA,qBAMAD,EAAA2wQ,aAAA3wQ,EAAAgsU,OAAAngD,EAAAlb,aACA3wQ,EAAAmnT,eAAAnnT,EAAAisU,SAAApgD,EAAAs7B,eACAnnT,EAAA0wQ,eAAA1wQ,EAAAksU,SAAA8iB,EAAAt+E,eACA1wQ,EAAAqnT,iBAAArnT,EAAAmsU,WAAA6iB,EAAA3nC,iBACArnT,EAAAqsU,YAAArsU,EAAAosU,WARA,WACA,OAAAlsU,OAAAW,KAAA+tQ,6GCLIqgF,EAAQhvV,EAAQ,WAChBivV,EAAajvV,EAAQ,gBACrB0vP,EAAS1vP,EAAQ,eAAe0vP,OAChCw/F,EAAelvV,EAAQ,kBACvBwvU,EAAYxvU,EAAQ,eACpB4qQ,EAAM5qQ,EAAQ,SACdorV,EAAOprV,EAAQ,kBAGnB,SAAA+rU,EAAiB5kP,EAAM1lF,EAAKypQ,GAC1BskE,EAAUnlO,KAAKoC,MAEfA,KAAKmtH,OAAAA,IAAau1H,EAClB1iP,KAAK2iP,QAAAA,IAAcxkF,EAAIykF,IAAI5tV,GAC3BgrG,KAAKqlK,MAAQpiB,EAAOx5F,KAAKg1G,GACzBz+J,KAAK6iP,MAAQnoQ,EACbslB,KAAK8iP,cAAe,EATPvvV,EAAQ,WAYvBk/R,CAAS6sC,EAAQyD,GAEjBzD,EAAO3hO,UAAU8vK,QAAU,SAAU/gH,OAE/Bj9C,EACA8+N,EAFJvuO,KAAKmtH,OAAOnuI,IAAI0tE,WAGZ3rB,EAAAA,GAEItxB,EAAQzP,KAAKmtH,OAAO3rI,OAC1B+sP,EAAQvuO,KAAK6iP,MAAMnhF,QAAQ1hK,KAAMyP,GACjCsxB,EAAIj2D,KAAKyjQ,UAGJtrF,EAAOpxJ,OAAOkvC,QAGnB6lL,EAAU3jE,EAAOO,MAAM,GAAI,IAqB/B,SAAAk/F,IACE1iP,KAAKhc,MAAQi/J,EAAOiE,YAAY,GA4BlC,SAAAuzD,EAAyBmkC,EAAOznH,EAAUsnC,OACpClkL,EAASgoQ,EAAM3D,EAAMx1Q,mBACpBmR,EAAAA,MAAAA,IAAkBwqB,UAAU,yBAET,iBAAboyH,IAAuBA,EAAW8rB,EAAOx5F,KAAK0tE,IACrDA,EAASlyJ,SAAWsV,EAAOvlF,IAAM,EAAA,MAAA,IAAa+vG,UAAU,sBAAwBoyH,EAASlyJ,WAE3E,iBAAPw5L,IAAiBA,EAAKxb,EAAOx5F,KAAKg1G,IACzB,QAAhBlkL,EAAOG,MAAkB+jL,EAAGx5L,SAAWsV,EAAOkkL,GAAAA,MAAAA,IAAc15J,UAAU,qBAAuB05J,EAAGx5L,cAEhF,WAAhBsV,EAAOzT,SACE27Q,EAAaloQ,EAAOlnF,OAAQ8jO,EAAUsnC,GACxB,SAAhBlkL,EAAOzT,SACL07Q,EAAWjoQ,EAAOlnF,OAAQ8jO,EAAUsnC,OAGtC6gE,EAAO/kP,EAAOlnF,OAAQ8jO,EAAUsnC,GAhE7C6gE,EAAO3hO,UAAUukO,OAAS,eACpBzyN,EAAQzP,KAAKmtH,OAAOzsC,WACpB1gF,KAAK8iP,oBACPrzO,EAAQzP,KAAK6iP,MAAMnhF,QAAQ1hK,KAAMyP,GACjCzP,KAAK2iP,QAAQI,QACNtzO,MAGJA,EAAMuqH,OAAO4sF,SAChB5mN,KAAK2iP,QAAQI,YACHjqP,MAAM,sCAIpBwmO,EAAO3hO,UAAUm+O,eAAiB,SAAUkH,UAC1ChjP,KAAK8iP,eAAiBE,EACfhjP,MAOT0iP,EAAS/kP,UAAU3e,IAAM,SAAU0tE,GACjC1sD,KAAKhc,MAAQi/J,EAAOpxJ,OAAAA,CAAQmO,KAAKhc,MAAO0oE,KAG1Cg2L,EAAS/kP,UAAUnc,IAAM,cACnBwe,KAAKhc,MAAM/e,OAAS,GAAA,KAClB87D,EAAM/gC,KAAKhc,MAAM5e,MAAM,EAAG,WAC9B46B,KAAKhc,MAAQgc,KAAKhc,MAAM5e,MAAM,IACvB27D,SAEF,MAGT2hN,EAAS/kP,UAAU+iF,MAAQ,mBACrBt9E,EAAM,GAAKpD,KAAKhc,MAAM/e,OACtBg+Q,EAAUhgG,EAAOiE,YAAY9jJ,GAE7Bj8B,GAAK,IACAA,EAAIi8B,GACX6/O,EAAQ5uB,WAAWjxN,EAAKj8B,UAGnB87K,EAAOpxJ,OAAAA,CAAQmO,KAAKhc,MAAOi/P,KA8BpC3vV,EAAQmnT,eAAiBA,EACzBnnT,EAAQ2wQ,aATR,SAAuB26E,EAAOznH,OACxB58I,EAASgoQ,EAAM3D,EAAMx1Q,mBACpBmR,EAAAA,MAAAA,IAAkBwqB,UAAU,0BAE7B5wG,EAAOwqV,EAAKxnH,GAAU,EAAO58I,EAAOvlF,IAAKulF,EAAOkkL,WAC7Cg8C,EAAemkC,EAAOzqV,EAAKa,IAAKb,EAAKsqQ,wMC7G9C,IAAAykF,EAAA,CACAC,IAAA5vV,EAAA,SACAwrV,IAAAxrV,EAAA,SACA6vV,IAAA7vV,EAAA,SACA8vV,KAAA9vV,EAAA,UACA+vV,KAAA/vV,EAAA,UACAgwV,IAAAhwV,EAAA,SACAiwV,IAAAjwV,EAAA,SACAkwV,IAAAlwV,EAAA,UAGA2uQ,EAAA3uQ,EAAA,eAEA,IAAA,IAAAyB,KAAAktQ,EACAA,EAAAltQ,GAAA3B,OAAA6vV,EAAAhhF,EAAAltQ,GAAA0lF,MAGArnF,EAAAC,QAAA4uQ,uKCjBA5uQ,EAAAouQ,QAAA,SAAApiK,EAAAkuD,GACA,OAAAluD,EAAAqjP,QAAAe,aAAAl2L,IAGAl6J,EAAAiuQ,QAAA,SAAAjiK,EAAAkuD,GACA,OAAAluD,EAAAqjP,QAAAgB,aAAAn2L,kCCLA,IAAAu8G,EAAAx2Q,EAAA,cAEAD,EAAAouQ,QAAA,SAAApiK,EAAAkuD,GACA,IAAAd,EAAAq9G,EAAAv8G,EAAAluD,EAAA+lK,OAGA,OADA/lK,EAAA+lK,MAAA/lK,EAAAqjP,QAAAe,aAAAh3L,GACAptD,EAAA+lK,OAGA/xQ,EAAAiuQ,QAAA,SAAAjiK,EAAAkuD,GACA,IAAAxzD,EAAAsF,EAAA+lK,MAEA/lK,EAAA+lK,MAAA73G,EACA,IAAAzsB,EAAAzhC,EAAAqjP,QAAAgB,aAAAn2L,GAEA,OAAAu8G,EAAAhpI,EAAA/mC,+ECfA3mG,EAAOC,QAAU,SAAcuzE,EAAGyS,WAC5BrU,EAASW,KAAKq0B,IAAIpzB,EAAE5B,OAAQqU,EAAErU,QAC9B4qI,EAAAA,IAAaozC,EAAOh+K,GAEfkC,EAAI,EAAGA,EAAIlC,IAAUkC,EAC5B0oI,EAAO1oI,GAAKN,EAAEM,GAAKmS,EAAEnS,UAGhB0oI,mDCRLozC,EAAS1vP,EAAQ,eAAe0vP,OAChC8mB,EAAMx2Q,EAAQ,cAElB,SAAAqwV,EAAuBtkP,EAAMotD,EAAM60G,OAC7Bn+J,EAAMspD,EAAKznF,OACX87D,EAAMgpI,EAAIr9G,EAAMptD,EAAK6tH,eACzB7tH,EAAK6tH,OAAS7tH,EAAK6tH,OAAO/nJ,MAAMg+B,GAChC9D,EAAK+lK,MAAQpiB,EAAOpxJ,OAAAA,CAAQyN,EAAK+lK,MAAO9D,EAAU70G,EAAO3rB,IAClDA,EAGTztI,EAAQouQ,QAAU,SAAUpiK,EAAMotD,EAAM60G,WAElCn+J,EADA29B,EAAMkiH,EAAOiE,YAAY,GAGtBx6F,EAAKznF,QAAAA,IACiB,IAAvBq6B,EAAK6tH,OAAOloJ,SACdq6B,EAAK6tH,OAAS7tH,EAAKqjP,QAAQe,aAAapkP,EAAK+lK,OAC7C/lK,EAAK+lK,MAAQpiB,EAAOiE,YAAY,MAG9B5nJ,EAAK6tH,OAAOloJ,QAAUynF,EAAKznF,SAK7B87D,EAAMkiH,EAAOpxJ,OAAAA,CAAQkvC,EAAK6iN,EAAatkP,EAAMotD,EAAM60G,WAJnDn+J,EAAM9D,EAAK6tH,OAAOloJ,OAClB87D,EAAMkiH,EAAOpxJ,OAAAA,CAAQkvC,EAAK6iN,EAAatkP,EAAMotD,EAAKtnF,MAAM,EAAGg+B,GAAMm+J,KACjE70G,EAAOA,EAAKtnF,MAAMg+B,UAOf29B,+EC/BLkiH,EAAS1vP,EAAQ,eAAe0vP,OAEpC,SAAA4gG,EAAsBvkP,EAAMwkP,EAAWviF,OAEjCxgI,EADMzhC,EAAKqjP,QAAQe,aAAapkP,EAAK+lK,OAC3B,GAAKy+E,SAEnBxkP,EAAK+lK,MAAQpiB,EAAOpxJ,OAAAA,CAClByN,EAAK+lK,MAAMjgM,MAAM,GACjB69K,EAAOx5F,KAAAA,CAAM83G,EAAUuiF,EAAY/iN,MAG9BA,EAGTztI,EAAQouQ,QAAU,SAAUpiK,EAAMmQ,EAAO8xJ,WACnCn+J,EAAMqM,EAAMxqC,OACZ87D,EAAMkiH,EAAOiE,YAAY9jJ,GACzBj8B,GAAK,IAEAA,EAAIi8B,GACX29B,EAAI55D,GAAK08Q,EAAYvkP,EAAMmQ,EAAMtoC,GAAIo6L,UAGhCxgI,wDCvBLkiH,EAAS1vP,EAAQ,eAAe0vP,OAEpC,SAAA4gG,EAAsBvkP,EAAMwkP,EAAWviF,WAKjCk1B,EAAK/iS,EAHLyzE,GAAK,EAEL45D,EAAM,IAED55D,EAHC,GAKRsvN,EAAOqtD,EAAa,GAAM,EAAI38Q,EAAO,IAAO,EAE5C45D,IAAiB,KADjBrtI,EAFM4rG,EAAKqjP,QAAQe,aAAapkP,EAAK+lK,OAEzB,GAAKoxB,KACUtvN,EAAI,EAC/Bm4B,EAAK+lK,MAAQ0+E,EAAQzkP,EAAK+lK,MAAO9D,EAAUk1B,EAAM/iS,UAE5CqtI,EAGT,SAAAgjN,EAAkBl0I,EAAQn8M,OACpB0vG,EAAMysG,EAAO5qI,OACbkC,GAAK,EACL45D,EAAMkiH,EAAOiE,YAAYr3C,EAAO5qI,YACpC4qI,EAASozC,EAAOpxJ,OAAAA,CAAQg+G,EAAQozC,EAAOx5F,KAAAA,CAAM/1J,QAEpCyzE,EAAIi8B,GACX29B,EAAI55D,GAAK0oI,EAAO1oI,IAAM,EAAI0oI,EAAO1oI,EAAI,IAAO,SAGvC45D,EAGTztI,EAAQouQ,QAAU,SAAUpiK,EAAMmQ,EAAO8xJ,WACnCn+J,EAAMqM,EAAMxqC,OACZ87D,EAAMkiH,EAAOiE,YAAY9jJ,GACzBj8B,GAAK,IAEAA,EAAIi8B,GACX29B,EAAI55D,GAAK08Q,EAAYvkP,EAAMmQ,EAAMtoC,GAAIo6L,UAGhCxgI,+ECxCLgpI,EAAMx2Q,EAAQ,cAElB,SAAAywV,EAAmB1kP,UACjBA,EAAK+lK,MAAQ/lK,EAAKqjP,QAAQe,aAAapkP,EAAK+lK,OACrC/lK,EAAK+lK,MAGd/xQ,EAAQouQ,QAAU,SAAUpiK,EAAMmQ,QACzBnQ,EAAK6tH,OAAOloJ,OAASwqC,EAAMxqC,QAChCq6B,EAAK6tH,OAAS81B,EAAOpxJ,OAAAA,CAAQyN,EAAK6tH,OAAQ62H,EAAS1kP,SAGjDtF,EAAMsF,EAAK6tH,OAAO/nJ,MAAM,EAAGqqC,EAAMxqC,eACrCq6B,EAAK6tH,OAAS7tH,EAAK6tH,OAAO/nJ,MAAMqqC,EAAMxqC,QAC/B8kM,EAAIt6J,EAAOzV,yECdhB+vK,EAAMx2Q,EAAQ,cACd0vP,EAAS1vP,EAAQ,eAAe0vP,OAChCghG,EAAS1wV,EAAQ,aAErB,SAAAywV,EAAmB1kP,OACbyhC,EAAMzhC,EAAKqjP,QAAQuB,gBAAgB5kP,EAAK+lK,cAC5C4+E,EAAO3kP,EAAK+lK,OACLtkI,EAITztI,EAAQouQ,QAAU,SAAUpiK,EAAMmQ,OAC5B00O,EAAWv+Q,KAAKwhL,KAAK33I,EAAMxqC,OAFjB,IAGV+P,EAAQsqB,EAAK6tH,OAAOloJ,OACxBq6B,EAAK6tH,OAAS81B,EAAOpxJ,OAAAA,CACnByN,EAAK6tH,OACL81B,EAAOiE,YANK,GAMOi9F,aAEZh9Q,EAAI,EAAGA,EAAIg9Q,EAAUh9Q,IAAAA,KACxB45D,EAAMijN,EAAS1kP,GACfv6B,EAASiQ,EAVD,GAUS7N,EACrBm4B,EAAK6tH,OAAO0nG,cAAc9zL,EAAI,GAAIh8D,EAAS,GAC3Cu6B,EAAK6tH,OAAO0nG,cAAc9zL,EAAI,GAAIh8D,EAAS,GAC3Cu6B,EAAK6tH,OAAO0nG,cAAc9zL,EAAI,GAAIh8D,EAAS,GAC3Cu6B,EAAK6tH,OAAO0nG,cAAc9zL,EAAI,GAAIh8D,EAAS,QAEzCi1B,EAAMsF,EAAK6tH,OAAO/nJ,MAAM,EAAGqqC,EAAMxqC,eACrCq6B,EAAK6tH,OAAS7tH,EAAK6tH,OAAO/nJ,MAAMqqC,EAAMxqC,QAC/B8kM,EAAIt6J,EAAOzV,gGCdpB3mG,EAAAC,QAdA,SAAAmrQ,GAGA,IAFA,IACAxjK,EADAmI,EAAAq7J,EAAAx5L,OAEAm+B,KAAA,CAEA,GAAA,OADAnI,EAAAwjK,EAAA00D,UAAA/vN,IAGA,CACAnI,IACAwjK,EAAA41D,WAAAp5N,EAAAmI,GACA,MAJAq7J,EAAA41D,WAAA,EAAAjxN,ooECNI+6J,EAAM5qQ,EAAQ,SACd0vP,EAAS1vP,EAAQ,eAAe0vP,OAChC8/E,EAAYxvU,EAAQ,eACpBk/R,EAAWl/R,EAAQ,YACnB6wV,EAAQ7wV,EAAQ,WAChBw2Q,EAAMx2Q,EAAQ,cACd0wV,EAAS1wV,EAAQ,YAqCrB,SAAAkvV,EAAuB/nQ,EAAM1lF,EAAKypQ,EAAI8C,GACpCwhE,EAAUnlO,KAAKoC,UAEXynE,EAAIw7E,EAAOO,MAAM,EAAG,GAExBxjJ,KAAK2iP,QAAAA,IAAcxkF,EAAIykF,IAAI5tV,OACvBqvV,EAAKrkP,KAAK2iP,QAAQe,aAAaj8K,GACnCznE,KAAKskP,OAAAA,IAAaF,EAAMC,GACxB5lF,EA/BF,SAAiBn/J,EAAMm/J,EAAI4lF,MACP,KAAd5lF,EAAGx5L,cACLq6B,EAAKilP,OAASthG,EAAOpxJ,OAAAA,CAAQ4sK,EAAIxb,EAAOx5F,KAAAA,CAAM,EAAG,EAAG,EAAG,MAChDw5F,EAAOpxJ,OAAAA,CAAQ4sK,EAAIxb,EAAOx5F,KAAAA,CAAM,EAAG,EAAG,EAAG,UAE9Cg9G,EAAAA,IAAY29E,EAAMC,GAClBjhP,EAAMq7J,EAAGx5L,OACTu/Q,EAAQphP,EAAM,GAClBqjK,EAAM9wG,OAAO8oG,GACT+lF,IACFA,EAAQ,GAAKA,EACb/9E,EAAM9wG,OAAOstF,EAAOO,MAAMghG,EAAO,KAEnC/9E,EAAM9wG,OAAOstF,EAAOO,MAAM,EAAG,QACzBihG,EAAe,EAANrhP,EACTy1D,EAAOoqF,EAAOO,MAAM,GACxB3qF,EAAKs7J,YAAYswB,EAAQ,EAAG,GAC5Bh+E,EAAM9wG,OAAOkD,GACbv5D,EAAKilP,OAAS99E,EAAM39I,UAChBiY,EAAMkiH,EAAOx5F,KAAKnqD,EAAKilP,eAC3BN,EAAOljN,GACAA,EAUF2jN,CAAO1kP,KAAMy+J,EAAI4lF,GAEtBrkP,KAAKqlK,MAAQpiB,EAAOx5F,KAAKg1G,GACzBz+J,KAAKmtH,OAAS81B,EAAOiE,YAAY,GACjClnJ,KAAK2kP,UAAY1hG,EAAOiE,YAAY,GACpClnJ,KAAKwkK,SAAWjD,EAChBvhK,KAAK4kP,MAAQ,EACb5kP,KAAK20O,KAAO,EACZ30O,KAAK6iP,MAAQnoQ,EAEbslB,KAAK6kP,SAAW,KAChB7kP,KAAK60G,SAAU,EAGjB49E,EAASgwD,EAAc1f,GAEvB0f,EAAa9kP,UAAU8vK,QAAU,SAAUh+J,OACpCzP,KAAK60G,SAAW70G,KAAK4kP,MAAAA,KACpBE,EAAO,GAAM9kP,KAAK4kP,MAAQ,GAC1BE,EAAO,KACTA,EAAO7hG,EAAOO,MAAMshG,EAAM,GAC1B9kP,KAAKskP,OAAO3uL,OAAOmvL,IAIvB9kP,KAAK60G,SAAU,MACX9zE,EAAM/gC,KAAK6iP,MAAMnhF,QAAQ1hK,KAAMyP,UAC/BzP,KAAKwkK,SACPxkK,KAAKskP,OAAO3uL,OAAOlmD,GAEnBzP,KAAKskP,OAAO3uL,OAAO50B,GAErB/gC,KAAK20O,MAAQllO,EAAMxqC,OACZ87D,GAGT0hN,EAAa9kP,UAAUukO,OAAS,cAC1BliO,KAAKwkK,WAAaxkK,KAAK6kP,SAAAA,MAAAA,IAAoB/rP,MAAM,wDAEjDt0B,EAAMulM,EAAI/pK,KAAKskP,OAAO1T,MAAmB,EAAb5wO,KAAK4kP,MAAuB,EAAZ5kP,KAAK20O,MAAW30O,KAAK2iP,QAAQe,aAAa1jP,KAAKukP,YAC3FvkP,KAAKwkK,UAnFX,SAAkB39L,EAAGyS,OACfynD,EAAM,EACNl6D,EAAE5B,SAAWqU,EAAErU,QAAQ87D,YAEvB39B,EAAMx9B,KAAKq0B,IAAIpzB,EAAE5B,OAAQqU,EAAErU,QACtBkC,EAAI,EAAGA,EAAIi8B,IAAOj8B,EACzB45D,GAAQl6D,EAAEM,GAAKmS,EAAEnS,UAGZ45D,EA0EcgkN,CAAQvgR,EAAKw7B,KAAK6kP,UAAAA,MAAAA,IAAqB/rP,MAAM,oDAElEkH,KAAK6kP,SAAWrgR,EAChBw7B,KAAK2iP,QAAQI,SAGfN,EAAa9kP,UAAUo+O,WAAa,cAC9B/7O,KAAKwkK,WAAavhB,EAAO8H,SAAS/qJ,KAAK6kP,UAAAA,MAAAA,IAAqB/rP,MAAM,0DAE/DkH,KAAK6kP,UAGdpC,EAAa9kP,UAAUq+O,WAAa,SAAqBx3Q,OAClDw7B,KAAKwkK,SAAAA,MAAAA,IAAoB1rK,MAAM,mDAEpCkH,KAAK6kP,SAAWrgR,GAGlBi+Q,EAAa9kP,UAAUs+O,OAAS,SAAiB1rH,MAC3CvwH,KAAK60G,QAAAA,MAAAA,IAAmB/7G,MAAM,8CAElCkH,KAAKskP,OAAO3uL,OAAO46D,GACnBvwH,KAAK4kP,OAASr0H,EAAItrJ,QAGpB5xE,EAAOC,QAAUmvV,0KC/Gbx/F,EAAS1vP,EAAQ,eAAe0vP,OAEpC,SAAA+hG,EAAwBz0H,GACjB0yB,EAAO8H,SAASx6B,KAAMA,EAAM0yB,EAAOx5F,KAAK8mE,YAEzCntH,EAAOmtH,EAAItrJ,OAAS,EAAK,EACzB87D,EAAAA,IAAUljC,MAAMuF,GAEXj8B,EAAI,EAAGA,EAAIi8B,EAAKj8B,IACvB45D,EAAI55D,GAAKopJ,EAAImjG,aAAiB,EAAJvsP,UAGrB45D,EAGT,SAAAkkN,EAAmBngL,QACJ,EAAOA,EAAE7/F,OAAQ6/F,IAC5BA,EADW,GACJ,EAIX,SAAAogL,EAAqBrgI,EAAGsgI,EAAaC,EAASC,EAAMC,WAU9Ct+D,EAAIrZ,EAAIC,EAAIqZ,EATZs+D,EAAWH,EAAQ,GACnBI,EAAWJ,EAAQ,GACnBK,EAAWL,EAAQ,GACnBM,EAAWN,EAAQ,GAEnBv3E,EAAKhpD,EAAE,GAAKsgI,EAAY,GACxBtvJ,EAAKgvB,EAAE,GAAKsgI,EAAY,GACxBrvJ,EAAK+uB,EAAE,GAAKsgI,EAAY,GACxBhvF,EAAKtxC,EAAE,GAAKsgI,EAAY,GAExBQ,EAAQ,EAEHx3O,EAAQ,EAAGA,EAAQm3O,EAASn3O,IACnC64K,EAAKu+D,EAAS13E,IAAO,IAAM23E,EAAU3vJ,IAAO,GAAM,KAAQ4vJ,EAAU3vJ,IAAO,EAAK,KAAQ4vJ,EAAc,IAALvvF,GAAagvF,EAAYQ,KAC1Hh4E,EAAK43E,EAAS1vJ,IAAO,IAAM2vJ,EAAU1vJ,IAAO,GAAM,KAAQ2vJ,EAAUtvF,IAAO,EAAK,KAAQuvF,EAAc,IAAL73E,GAAas3E,EAAYQ,KAC1H/3E,EAAK23E,EAASzvJ,IAAO,IAAM0vJ,EAAUrvF,IAAO,GAAM,KAAQsvF,EAAU53E,IAAO,EAAK,KAAQ63E,EAAc,IAAL7vJ,GAAasvJ,EAAYQ,KAC1H1+D,EAAKs+D,EAASpvF,IAAO,IAAMqvF,EAAU33E,IAAO,GAAM,KAAQ43E,EAAU5vJ,IAAO,EAAK,KAAQ6vJ,EAAc,IAAL5vJ,GAAaqvJ,EAAYQ,KAC1H93E,EAAKmZ,EACLnxF,EAAK83E,EACL73E,EAAK83E,EACLzX,EAAK8wB,SAGPD,GAAOq+D,EAAKx3E,IAAO,KAAO,GAAOw3E,EAAMxvJ,IAAO,GAAM,MAAS,GAAOwvJ,EAAMvvJ,IAAO,EAAK,MAAS,EAAKuvJ,EAAU,IAALlvF,IAAcgvF,EAAYQ,KACnIh4E,GAAO03E,EAAKxvJ,IAAO,KAAO,GAAOwvJ,EAAMvvJ,IAAO,GAAM,MAAS,GAAOuvJ,EAAMlvF,IAAO,EAAK,MAAS,EAAKkvF,EAAU,IAALx3E,IAAcs3E,EAAYQ,KACnI/3E,GAAOy3E,EAAKvvJ,IAAO,KAAO,GAAOuvJ,EAAMlvF,IAAO,GAAM,MAAS,GAAOkvF,EAAMx3E,IAAO,EAAK,MAAS,EAAKw3E,EAAU,IAALxvJ,IAAcsvJ,EAAYQ,KACnI1+D,GAAOo+D,EAAKlvF,IAAO,KAAO,GAAOkvF,EAAMx3E,IAAO,GAAM,MAAS,GAAOw3E,EAAMxvJ,IAAO,EAAK,MAAS,EAAKwvJ,EAAU,IAALvvJ,IAAcqvJ,EAAYQ,MACnI3+D,KAAY,EACZrZ,KAAY,EACZC,KAAY,EACZqZ,KAAY,OAMV2+D,EAAAA,CAAQ,EAAM,EAAM,EAAM,EAAM,EAAM,GAAM,GAAM,GAAM,IAAM,GAAM,IACpE5iI,EAAAA,mBAEEplF,EAAAA,IAAQ//B,MAAM,KACTvM,EAAI,EAAGA,EAAI,IAAKA,IAErBssC,EAAEtsC,GADAA,EAAI,IACCA,GAAK,EAEJA,GAAK,EAAK,YAIlB+zP,EAAAA,GACAQ,EAAAA,GACAT,EAAAA,CAAAA,GAAAA,GAAAA,GAAAA,IACAU,EAAAA,CAAAA,GAAAA,GAAAA,GAAAA,IAGAl4O,EAAI,EACJqe,EAAK,EACA9kD,EAAI,EAAGA,EAAI,MAAOA,EAAAA,KAErB87L,EAAKh3I,EAAMA,GAAM,EAAMA,GAAM,EAAMA,GAAM,EAAMA,GAAM,EACzDg3I,EAAMA,IAAO,EAAW,IAALA,EAAa,GAChCoiF,EAAKz3O,GAAKq1J,EACV4iF,EAAS5iF,GAAMr1J,MAGX2xL,EAAK3hK,EAAEhwB,GACPm4O,EAAKnoN,EAAE2hK,GACPymD,EAAKpoN,EAAEmoN,GAGPhnM,EAAa,IAARnhB,EAAEqlI,GAAqB,SAALA,EAC3BmiF,EAAQ,GAAGx3O,GAAMmxC,GAAK,GAAOA,IAAM,EACnCqmM,EAAQ,GAAGx3O,GAAMmxC,GAAK,GAAOA,IAAM,GACnCqmM,EAAQ,GAAGx3O,GAAMmxC,GAAK,EAAMA,IAAM,GAClCqmM,EAAQ,GAAGx3O,GAAKmxC,EAGhBA,EAAU,SAALinM,EAAwB,MAALD,EAAsB,IAALxmD,EAAmB,SAAJ3xL,EACxDk4O,EAAY,GAAG7iF,GAAOlkH,GAAK,GAAOA,IAAM,EACxC+mM,EAAY,GAAG7iF,GAAOlkH,GAAK,GAAOA,IAAM,GACxC+mM,EAAY,GAAG7iF,GAAOlkH,GAAK,EAAMA,IAAM,GACvC+mM,EAAY,GAAG7iF,GAAMlkH,EAEX,IAANnxC,EACFA,EAAIqe,EAAK,GAETre,EAAI2xL,EAAK3hK,EAAEA,EAAEA,EAAEooN,EAAKzmD,KACpBtzK,GAAM2R,EAAEA,EAAE3R,YAKZo5N,KAAMA,EACNQ,SAAUA,EACVT,QAASA,EACTU,YAAaA,GAzDb9iI,GA6DJ,SAAA4/H,EAAc5tV,GACZgrG,KAAKjD,KAAOioP,EAAchwV,GAC1BgrG,KAAKimP,SAGPrD,EAAInhF,UAAY,GAChBmhF,EAAIpqC,QAAU,GACdoqC,EAAIjlP,UAAU8jK,UAAYmhF,EAAInhF,UAC9BmhF,EAAIjlP,UAAU66M,QAAUoqC,EAAIpqC,QAC5BoqC,EAAIjlP,UAAUsoP,OAAS,mBACjBC,EAAWlmP,KAAKjD,KAChBy7M,EAAU0tC,EAASjhR,OACnBqgR,EAAU9sC,EAAU,EACpB2tC,EAAyB,GAAfb,EAAU,GAEpBH,EAAAA,GACK9wV,EAAI,EAAGA,EAAImkT,EAASnkT,IAC3B8wV,EAAY9wV,GAAK6xV,EAAS7xV,OAGvBA,EAAImkT,EAASnkT,EAAI8xV,EAAQ9xV,IAAAA,KACxB0qJ,EAAIomM,EAAY9wV,EAAI,GAEpBA,EAAImkT,GAAY,GAClBz5J,EAAKA,GAAK,EAAMA,IAAM,GACtBA,EACGikE,EAAEqiI,KAAKtmM,IAAM,KAAO,GACpBikE,EAAEqiI,KAAMtmM,IAAM,GAAM,MAAS,GAC7BikE,EAAEqiI,KAAMtmM,IAAM,EAAK,MAAS,EAC5BikE,EAAEqiI,KAAS,IAAJtmM,GAEVA,GAAK6mM,EAAMvxV,EAAImkT,EAAW,IAAM,IACvBA,EAAU,GAAKnkT,EAAImkT,GAAY,IACxCz5J,EACGikE,EAAEqiI,KAAKtmM,IAAM,KAAO,GACpBikE,EAAEqiI,KAAMtmM,IAAM,GAAM,MAAS,GAC7BikE,EAAEqiI,KAAMtmM,IAAM,EAAK,MAAS,EAC5BikE,EAAEqiI,KAAS,IAAJtmM,IAGZomM,EAAY9wV,GAAK8wV,EAAY9wV,EAAImkT,GAAWz5J,UAG1CqnM,EAAAA,GACKC,EAAK,EAAGA,EAAKF,EAAQE,IAAAA,KACxBC,EAAMH,EAASE,EACf5kO,EAAK0jO,EAAYmB,GAAOD,EAAK,EAAI,EAAI,IAGvCD,EAAeC,GADbA,EAAK,GAAKC,GAAO,EACE7kO,EAGnBuhG,EAAE8iI,YAAY,GAAG9iI,EAAEqiI,KAAK5jO,IAAO,KAC/BuhG,EAAE8iI,YAAY,GAAG9iI,EAAEqiI,KAAM5jO,IAAO,GAAM,MACtCuhG,EAAE8iI,YAAY,GAAG9iI,EAAEqiI,KAAM5jO,IAAO,EAAK,MACrCuhG,EAAE8iI,YAAY,GAAG9iI,EAAEqiI,KAAU,IAAL5jO,IAI9BzhB,KAAKumP,SAAWjB,EAChBtlP,KAAKwmP,aAAerB,EACpBnlP,KAAKymP,gBAAkBL,GAGzBxD,EAAIjlP,UAAUumP,gBAAkB,SAAUr/H,UAEjCqgI,EADPrgI,EAAImgI,EAAcngI,GACG7kH,KAAKwmP,aAAcxjI,EAAEoiI,QAASpiI,EAAEqiI,KAAMrlP,KAAKumP,WAGlE3D,EAAIjlP,UAAU+lP,aAAe,SAAU7+H,OACjC9jF,EAAM/gC,KAAKkkP,gBAAgBr/H,GAC3B0L,EAAM0yB,EAAOiE,YAAY,WAC7B32B,EAAIskG,cAAc9zL,EAAI,GAAI,GAC1BwvF,EAAIskG,cAAc9zL,EAAI,GAAI,GAC1BwvF,EAAIskG,cAAc9zL,EAAI,GAAI,GAC1BwvF,EAAIskG,cAAc9zL,EAAI,GAAI,IACnBwvF,GAGTqyH,EAAIjlP,UAAUgmP,aAAe,SAAU9+H,OAIjC4+C,GAHJ5+C,EAAImgI,EAAcngI,IAGP,GACXA,EAAE,GAAKA,EAAE,GACTA,EAAE,GAAK4+C,MAEH1iI,EAAMmkN,EAAWrgI,EAAG7kH,KAAKymP,gBAAiBzjI,EAAE8iI,YAAa9iI,EAAE6iI,SAAU7lP,KAAKumP,UAC1Eh2H,EAAM0yB,EAAOiE,YAAY,WAC7B32B,EAAIskG,cAAc9zL,EAAI,GAAI,GAC1BwvF,EAAIskG,cAAc9zL,EAAI,GAAI,GAC1BwvF,EAAIskG,cAAc9zL,EAAI,GAAI,GAC1BwvF,EAAIskG,cAAc9zL,EAAI,GAAI,IACnBwvF,GAGTqyH,EAAIjlP,UAAUolP,MAAQ,WACpBkC,EAASjlP,KAAKwmP,cACdvB,EAASjlP,KAAKymP,iBACdxB,EAASjlP,KAAKjD,OAGhB1pG,EAAOC,QAAQsvV,IAAMA,yDCnOjB3/F,EAAS1vP,EAAQ,eAAe0vP,OAChCyjG,EAASzjG,EAAOO,MAAM,GAAI,GAW9B,SAAA17I,EAAoBi5B,OACdwvF,EAAM0yB,EAAOiE,YAAY,WAC7B32B,EAAIskG,cAAc9zL,EAAI,KAAO,EAAG,GAChCwvF,EAAIskG,cAAc9zL,EAAI,KAAO,EAAG,GAChCwvF,EAAIskG,cAAc9zL,EAAI,KAAO,EAAG,GAChCwvF,EAAIskG,cAAc9zL,EAAI,KAAO,EAAG,IACzBwvF,EAGT,SAAA6zH,EAAgBpvV,GACdgrG,KAAKynE,EAAIzyK,EACTgrG,KAAK8oB,MAAQm6H,EAAOO,MAAM,GAAI,GAC9BxjJ,KAAKhc,MAAQi/J,EAAOiE,YAAY,GAKlCk9F,EAAMzmP,UAAU8oK,MAAQ,SAAUj5G,WAC5BrmF,GAAK,IACAA,EAAIqmF,EAAMvoF,QACjB+6B,KAAK8oB,MAAM3hD,IAAMqmF,EAAMrmF,GAEzB64B,KAAK2mP,aAGPvC,EAAMzmP,UAAUgpP,UAAY,mBAlCVp2H,EAqCZj/H,EAAOs1P,EAFPC,IAnCYt2H,EAmCCvwH,KAAKynE,GAjChBisJ,aAAa,GACjBnjG,EAAImjG,aAAa,GACjBnjG,EAAImjG,aAAa,GACjBnjG,EAAImjG,aAAa,KA+BfozB,EAAAA,CAAM,EAAG,EAAG,EAAG,GAEf3/Q,GAAK,IACAA,EAAI,KAAA,KAC6C,IAAlD64B,KAAK8oB,SAAS3hD,EAAI,IAAO,GAAM,EAAKA,EAAI,KAG5C2/Q,EAAG,IAAMD,EAAG,GACZC,EAAG,IAAMD,EAAG,GACZC,EAAG,IAAMD,EAAG,GACZC,EAAG,IAAMD,EAAG,IAIdD,EAAwB,IAAP,EAARC,EAAG,IAGPv1P,EAAI,EAAGA,EAAI,EAAGA,IACjBu1P,EAAGv1P,GAAMu1P,EAAGv1P,KAAO,GAAmB,EAAZu1P,EAAGv1P,EAAI,KAAW,GAE9Cu1P,EAAG,GAAKA,EAAG,KAAO,EAGdD,IACFC,EAAG,GAAKA,EAAG,GAAM,KAAQ,IAG7B7mP,KAAK8oB,MAAQhhB,EAAUg/O,IAGzB1C,EAAMzmP,UAAUg4D,OAAS,SAAU46D,OAE7B9gH,MADJzP,KAAKhc,MAAQi/J,EAAOpxJ,OAAAA,CAAQmO,KAAKhc,MAAOusI,IAEjCvwH,KAAKhc,MAAM/e,QAAU,IAC1BwqC,EAAQzP,KAAKhc,MAAM5e,MAAM,EAAG,IAC5B46B,KAAKhc,MAAQgc,KAAKhc,MAAM5e,MAAM,IAC9B46B,KAAKymK,MAAMh3J,IAIf20O,EAAMzmP,UAAUizO,MAAQ,SAAUmW,EAAKh5C,UACjC/tM,KAAKhc,MAAM/e,QACb+6B,KAAKymK,MAAMxjB,EAAOpxJ,OAAAA,CAAQmO,KAAKhc,MAAO0iQ,GAAS,KAGjD1mP,KAAKymK,MAAM3+J,EAAAA,CAAW,EAAGi/O,EAAK,EAAGh5C,KAC1B/tM,KAAK8oB,OAGdz1H,EAAOC,QAAU8wV,yDCxFbjmF,EAAM5qQ,EAAQ,SACd0vP,EAAS1vP,EAAQ,eAAe0vP,OAChC8/E,EAAYxvU,EAAQ,eAGxB,SAAAkvV,EAAuB/nQ,EAAM1lF,EAAKypQ,EAAI8C,GACpCwhE,EAAUnlO,KAAKoC,MAEfA,KAAK2iP,QAAAA,IAAcxkF,EAAIykF,IAAI5tV,GAC3BgrG,KAAKqlK,MAAQpiB,EAAOx5F,KAAKg1G,GACzBz+J,KAAKmtH,OAAS81B,EAAOiE,YAAY,GACjClnJ,KAAK2kP,UAAY1hG,EAAOiE,YAAY,GACpClnJ,KAAKwkK,SAAWjD,EAChBvhK,KAAK6iP,MAAQnoQ,EAVAnnF,EAAQ,WAavBk/R,CAASgwD,EAAc1f,GAEvB0f,EAAa9kP,UAAU8vK,QAAU,SAAUh+J,UAClCzP,KAAK6iP,MAAMnhF,QAAQ1hK,KAAMyP,EAAOzP,KAAKwkK,WAG9Ci+E,EAAa9kP,UAAUukO,OAAS,WAC9BliO,KAAK2iP,QAAQI,SAGf1vV,EAAOC,QAAUmvV,gHC1Bbx/F,EAAS1vP,EAAQ,eAAe0vP,OAChC++E,EAAMzuU,EAAQ,UA2ClBF,EAAOC,QAxCP,SAAyB6jO,EAAU0mC,EAAMmpF,EAAShpF,MAC3C/a,EAAO8H,SAAS5zB,KAAWA,EAAW8rB,EAAOx5F,KAAK0tE,EAAU,WAC7D0mC,IACG5a,EAAO8H,SAAS8S,KAAOA,EAAO5a,EAAOx5F,KAAKo0G,EAAM,WACjC,IAAhBA,EAAK54L,QAAW,MAAA,IAAas6J,WAAW,oDAG1Cs/G,EAASmI,EAAU,EACnBhyV,EAAMiuP,EAAOO,MAAMq7F,GACnBpgF,EAAKxb,EAAOO,MAAMwa,GAAS,GAC3B5iK,EAAM6nJ,EAAOO,MAAM,GAEhBq7F,EAAS,GAAK7gF,EAAQ,GAAA,KACvB3qJ,EAAAA,IAAW2uN,EACf3uN,EAAKsiD,OAAOv6D,GACZiY,EAAKsiD,OAAOwhE,GACR0mC,GAAMxqJ,EAAKsiD,OAAOkoG,GACtBziK,EAAMiY,EAAK6lH,aAEPnlE,EAAO,KAEP8qL,EAAS,EAAA,KACPoI,EAAWjyV,EAAIiwE,OAAS45Q,EAC5B9qL,EAAOnuF,KAAKq0B,IAAI4kP,EAAQzjP,EAAIn2B,QAC5Bm2B,EAAIn+F,KAAKjI,EAAKiyV,EAAU,EAAGlzL,GAC3B8qL,GAAU9qL,KAGRA,EAAO34D,EAAIn2B,QAAU+4L,EAAQ,EAAA,KAC3BkpF,EAAUzoF,EAAGx5L,OAAS+4L,EACtB/4L,EAASW,KAAKq0B,IAAI+jK,EAAO5iK,EAAIn2B,OAAS8uF,GAC1C34D,EAAIn+F,KAAKwhQ,EAAIyoF,EAASnzL,EAAMA,EAAO9uF,GACnC+4L,GAAS/4L,UAIbm2B,EAAIo2L,KAAK,IACAx8R,IAAKA,EAAKypQ,GAAIA,0ECzCrB+jF,EAAajvV,EAAQ,gBACrB0vP,EAAS1vP,EAAQ,eAAe0vP,OAChCs/F,EAAQhvV,EAAQ,WAChBkvV,EAAelvV,EAAQ,kBACvBwvU,EAAYxvU,EAAQ,eACpB4qQ,EAAM5qQ,EAAQ,SACdorV,EAAOprV,EAAQ,kBAGnB,SAAAisU,EAAmB9kP,EAAM1lF,EAAKypQ,GAC5BskE,EAAUnlO,KAAKoC,MAEfA,KAAKmtH,OAAAA,IAAau1H,EAClB1iP,KAAKuI,WAAAA,EACLvI,KAAK2iP,QAAAA,IAAcxkF,EAAIykF,IAAI5tV,GAC3BgrG,KAAKqlK,MAAQpiB,EAAOx5F,KAAKg1G,GACzBz+J,KAAK6iP,MAAQnoQ,EACbslB,KAAK8iP,cAAe,EA+BtB,SAAAJ,IACE1iP,KAAKhc,MAAQi/J,EAAOiE,YAAY,GA8ClC,SAAAyzD,EAA2BikC,EAAOznH,EAAUsnC,OACtClkL,EAASgoQ,EAAM3D,EAAMx1Q,mBACpBmR,EAAAA,MAAAA,IAAkBwqB,UAAU,yBAEf,iBAAP05J,IAAiBA,EAAKxb,EAAOx5F,KAAKg1G,IACzB,QAAhBlkL,EAAOG,MAAkB+jL,EAAGx5L,SAAWsV,EAAOkkL,GAAAA,MAAAA,IAAc15J,UAAU,qBAAuB05J,EAAGx5L,WAE5E,iBAAbkyJ,IAAuBA,EAAW8rB,EAAOx5F,KAAK0tE,IACrDA,EAASlyJ,SAAWsV,EAAOvlF,IAAM,EAAA,MAAA,IAAa+vG,UAAU,sBAAwBoyH,EAASlyJ,cAEzE,WAAhBsV,EAAOzT,SACE27Q,EAAaloQ,EAAOlnF,OAAQ8jO,EAAUsnC,GAAI,GAC5B,SAAhBlkL,EAAOzT,SACL07Q,EAAWjoQ,EAAOlnF,OAAQ8jO,EAAUsnC,GAAI,OAG1C+gE,EAASjlP,EAAOlnF,OAAQ8jO,EAAUsnC,GAxGhClrQ,EAAQ,WAavBk/R,CAAS+sC,EAAUuD,GAEnBvD,EAAS7hO,UAAU8vK,QAAU,SAAU/gH,OAEjCj9C,EACA8+N,EAFJvuO,KAAKmtH,OAAOnuI,IAAI0tE,WAGZ3rB,EAAAA,GACItxB,EAAQzP,KAAKmtH,OAAO3rI,IAAIwe,KAAK8iP,eACnCvU,EAAQvuO,KAAK6iP,MAAMthF,QAAQvhK,KAAMyP,GACjCsxB,EAAIj2D,KAAKyjQ,UAEJtrF,EAAOpxJ,OAAOkvC,IAGvBy+L,EAAS7hO,UAAUukO,OAAS,eACtBzyN,EAAQzP,KAAKmtH,OAAOzsC,WACpB1gF,KAAK8iP,oBA2CX,SAAgB/mQ,OACVorQ,EAASprQ,EAAK,OACdorQ,EAAS,GAAKA,EAAS,aACfruP,MAAM,8BAEd3xB,GAAK,SACAA,EAAIggR,MACPprQ,EAAM5U,GAAK,GAAKggR,MAAcA,YACtBruP,MAAM,6BAGL,KAAXquP,EAAW,cAERprQ,EAAK3W,MAAM,EAAG,GAAK+hR,GAvDjB1iF,CAAMzkK,KAAK6iP,MAAMthF,QAAQvhK,KAAMyP,OAC7BA,YACC3W,MAAM,sCAIpB0mO,EAAS7hO,UAAUm+O,eAAiB,SAAUkH,UAC5ChjP,KAAK8iP,eAAiBE,EACfhjP,MAOT0iP,EAAS/kP,UAAU3e,IAAM,SAAU0tE,GACjC1sD,KAAKhc,MAAQi/J,EAAOpxJ,OAAAA,CAAQmO,KAAKhc,MAAO0oE,KAG1Cg2L,EAAS/kP,UAAUnc,IAAM,SAAU4lQ,OAC7BrmN,KACAqmN,MACEpnP,KAAKhc,MAAM/e,OAAS,UACtB87D,EAAM/gC,KAAKhc,MAAM5e,MAAM,EAAG,IAC1B46B,KAAKhc,MAAQgc,KAAKhc,MAAM5e,MAAM,IACvB27D,UAGL/gC,KAAKhc,MAAM/e,QAAU,UACvB87D,EAAM/gC,KAAKhc,MAAM5e,MAAM,EAAG,IAC1B46B,KAAKhc,MAAQgc,KAAKhc,MAAM5e,MAAM,IACvB27D,SAIJ,MAGT2hN,EAAS/kP,UAAU+iF,MAAQ,cACrB1gF,KAAKhc,MAAM/e,OAAAA,OAAe+6B,KAAKhc,OA8CrC1wF,EAAQ0wQ,eARR,SAAyB46E,EAAOznH,OAC1B58I,EAASgoQ,EAAM3D,EAAMx1Q,mBACpBmR,EAAAA,MAAAA,IAAkBwqB,UAAU,0BAE7B5wG,EAAOwqV,EAAKxnH,GAAU,EAAO58I,EAAOvlF,IAAKulF,EAAOkkL,WAC7Ck8C,EAAiBikC,EAAOzqV,EAAKa,IAAKb,EAAKsqQ,KAIhDnrQ,EAAQqnT,iBAAmBA,qMC3H3BrnT,EAAA,WAAA,CACA0B,IAAA,EACAypQ,GAAA,GAEAnrQ,EAAA,WAAAA,EAAA+qQ,IAAA,CACArpQ,IAAA,EACAypQ,GAAA,GAEAnrQ,EAAA,gBAAAA,EAAAmsV,KAAA,CACAzqV,IAAA,GACAypQ,GAAA,GAEAnrQ,EAAA,YAAA,CACA0B,IAAA,GACAypQ,GAAA,GAEAnrQ,EAAA,eAAA,CACA0B,IAAA,GACAypQ,GAAA,GAEAnrQ,EAAA,WAAA,CACA0B,IAAA,GACAypQ,GAAA,0DCtBI4oF,EAAgB9zV,EAAQ,uBACxB4tS,EAAS5tS,EAAQ,qBAEjB+zV,EAAK/zV,EAAQ,gBASbg0V,EAAAA,CACF9xF,QAAU,EAAMzvL,KAAO,EAAM69B,QAAU,GA2BzCvwG,EAAQssU,mBAAqBtsU,EAAQusU,yBAA2BvsU,EAAQwsU,iBAnCxE,SAA2Bx9K,OACrBl0B,EAAAA,IAAY60H,EAAOk+C,EAAO7+I,GAAKl0B,MAAO,OACtCo5N,EAAAA,IAAUvkG,EAAOk+C,EAAO7+I,GAAKklM,IAAK,kBAE3BF,EAAGl5N,EAAOo5N,IAgCvBl0V,EAAQysU,oBAAsBzsU,EAAQ0sU,cAzBtC,SAAAD,EAA8B3xM,EAAOuuG,EAAK97H,EAAW4mP,UAC/CxkG,EAAO8H,SAASpuB,SAA2BjnO,IAAnB6xV,EAAU5qH,GAC7BojG,EAAoB3xM,EAAO,SAAUuuG,EAAK97H,IAGnD87H,EAAMA,GAAO,SACb8qH,EAAOA,GAAQ,SACf5mP,EAAYA,GAAAA,IAAiBoiJ,EAAAA,CAAQ,IAEhCA,EAAO8H,SAASlqJ,KACnBA,EAAAA,IAAgBoiJ,EAAOpiJ,EAAW4mP,IAGf,iBAAVr5N,MACEk5N,EAAGD,EAAcj5N,EAAOvtB,GAAYA,GAAW,IAGvDoiJ,EAAO8H,SAAS38H,KACnBA,EAAAA,IAAY60H,EAAO70H,EAAOuuG,QAGjB2qH,EAAGl5N,EAAOvtB,GAAW,+HCrClC,IAAAkuK,EAAAx7Q,EAAA,eACAF,EAAAC,QAAAo0V,EACAA,EAAAC,YAAAA,EACAD,EAAAE,WAAAA,EACA,IAAA75D,EAAAx6R,EAAA,SACAs0V,EAAA,IAAA95D,EAAA,IAEA3R,EAAA,IADA7oR,EAAA,iBAEAs9Q,EAAA,IAAAkd,EAAA,GACA+5D,EAAA,IAAA/5D,EAAA,GACAg6D,EAAA,IAAAh6D,EAAA,GAGAi6D,GAFA,IAAAj6D,EAAA,IACA,IAAAA,EAAA,GACA,IAAAA,EAAA,KACAk6D,EAAA,IAAAl6D,EAAA,GAEAm6D,GADA,IAAAn6D,EAAA,GACA,IAAAA,EAAA,KACAo6D,EAAA,IAAAp6D,EAAA,GAEAoT,GADA,IAAApT,EAAA,IACA,MAEA,SAAAq6D,IACA,GAAA,OAAAjnD,EACA,OAAAA,EAEA,IACAp1N,EAAA,GACAA,EAAA,GAAA,EACA,IAAA,IAAA5E,EAAA,EAAA9yE,EAAA,EAAAA,EAHA,QAGAA,GAAA,EAAA,CAEA,IADA,IAAA2sS,EAAAp7N,KAAAwhL,KAAAxhL,KAAAo7N,KAAA3sS,IACAi9F,EAAA,EAAAA,EAAAnqB,GAAA4E,EAAAulB,IAAA0vM,GACA3sS,EAAA03E,EAAAulB,IAAA,EADAA,KAIAnqB,IAAAmqB,GAAAvlB,EAAAulB,IAAA0vM,IAGAj1N,EAAA5E,KAAA9yE,GAGA,OADA8sS,EAAAp1N,EACAA,EAGA,SAAA47Q,EAAAzgR,GAGA,IAFA,IAAAi6N,EAAAinD,IAEAjhR,EAAA,EAAAA,EAAAg6N,EAAAl8N,OAAAkC,IACA,GAAA,IAAAD,EAAAwtN,KAAAyM,EAAAh6N,IACA,OAAA,IAAAD,EAAA8qN,KAAAmP,EAAAh6N,IAOA,OAAA,EAGA,SAAAygR,EAAA1gR,GACA,IAAAgnN,EAAAH,EAAAgV,KAAA77N,GACA,OAAA,IAAA4gR,EAAA75D,MAAAC,GAAAgT,OAAAh6N,EAAAo3N,KAAA,IAAA+B,UAAArO,KAAA,GAGA,SAAA01D,EAAAttH,EAAAotH,GACA,GAAAptH,EAAA,GAEA,OACA,IAAA2zD,EADA,IAAAy5D,GAAA,IAAAA,EACA,CAAA,IAAA,KAEA,CAAA,IAAA,KAKA,IAAA91O,EAAA2qE,EAEA,IAJAmrK,EAAA,IAAAz5D,EAAAy5D,KAIA,CAEA,IADA91O,EAAA,IAAAq8K,EAAAhf,EAAAnpM,KAAAwhL,KAAAhtB,EAAA,KACA1oH,EAAAu/J,YAAA72C,GACA1oH,EAAAosL,MAAA,GAQA,GANApsL,EAAAypK,UACAzpK,EAAA09K,KAAAve,GAEAn/J,EAAA8jL,MAAA,IACA9jL,EAAA09K,KAAA04D,GAEAN,EAAArgP,IAAA2gP,IAIA,IAAAN,EAAArgP,IAAA4gP,GACA,KAAAr2O,EAAA4wC,IAAA0lM,GAAA7gP,IAAA8gP,IACAv2O,EAAA09K,KAAA+4D,QALA,KAAAz2O,EAAA4wC,IAAAulM,GAAA1gP,IAAA+gP,IACAx2O,EAAA09K,KAAA+4D,GAQA,GAAAR,EADAtrK,EAAA3qE,EAAAusL,KAAA,KACA0pD,EAAAj2O,IACAk2O,EAAAvrK,IAAAurK,EAAAl2O,IACA0qK,EAAA32M,KAAA42G,IAAA+/F,EAAA32M,KAAAisC,GACA,OAAAA,4FCpGA,IAAAu9K,EAAA17R,EAAA,SACA80V,EAAA90V,EAAA,WAEA,SAAA+0V,EAAAt3D,GACAhxL,KAAAgxL,KAAAA,GAAA,IAAAq3D,EAAArlD,KAEA3vS,EAAAC,QAAAg1V,EAEAA,EAAAp0V,OAAA,SAAA88R,GACA,OAAA,IAAAs3D,EAAAt3D,IAGAs3D,EAAA3qP,UAAA4qP,WAAA,SAAAt0V,GACA,IAAAmvG,EAAAnvG,EAAAg9Q,YACAu3E,EAAA5iR,KAAAwhL,KAAAhkJ,EAAA,GAIA,GACA,IAAAv8B,EAAA,IAAAooN,EAAAjvL,KAAAgxL,KAAAlrM,SAAA0iQ,UACA3hR,EAAAsgC,IAAAlzG,IAAA,GAEA,OAAA4yE,GAGAyhR,EAAA3qP,UAAA8qP,WAAA,SAAAzzQ,EAAAurD,GAEA,IAAAtjC,EAAAsjC,EAAAjP,IAAAt8C,GACA,OAAAA,EAAAgK,IAAAghB,KAAAuoP,WAAAtrP,KAGAqrP,EAAA3qP,UAAAl4B,KAAA,SAAAxxE,EAAAI,EAAAgsJ,GACA,IAAAj9C,EAAAnvG,EAAAg9Q,YACAid,EAAAe,EAAA8T,KAAA9uS,GACAy0V,EAAA,IAAAz5D,EAAA,GAAAhB,MAAAC,GAEA75R,IACAA,EAAAuxE,KAAAD,IAAA,EAAAy9B,EAAA,GAAA,IAIA,IADA,IAAAg5E,EAAAnoL,EAAAqqS,KAAA,GACApiN,EAAA,GAAAkgG,EAAAo5G,MAAAt5M,GAAAA,KAMA,IALA,IAAA0hD,EAAA3pI,EAAAgqS,KAAA/hN,GAEAysQ,EAAAvsK,EAAA6xG,MAAAC,GAGA75R,EAAA,EAAAA,IAAA,CACA,IAAAwyE,EAAAm5B,KAAAyoP,WAAA,IAAAx5D,EAAA,GAAA7yG,GACA/7B,GACAA,EAAAx5E,GAEA,IAAA+mC,EAAA/mC,EAAAonN,MAAAC,GAAAgT,OAAAtjK,GACA,GAAA,IAAAhwB,EAAAzG,IAAAuhP,IAAA,IAAA96O,EAAAzG,IAAAwhP,GAAA,CAGA,IAAA,IAAAxhR,EAAA,EAAAA,EAAA+U,EAAA/U,IAAA,CAGA,GAAA,KAFAymC,EAAAA,EAAAugL,UAEAhnL,IAAAuhP,GACA,OAAA,EACA,GAAA,IAAA96O,EAAAzG,IAAAwhP,GACA,MAGA,GAAAxhR,IAAA+U,EACA,OAAA,GAGA,OAvBA,GA0BAosQ,EAAA3qP,UAAAirP,WAAA,SAAA30V,EAAAI,GACA,IAAA+uG,EAAAnvG,EAAAg9Q,YACAid,EAAAe,EAAA8T,KAAA9uS,GACAy0V,EAAA,IAAAz5D,EAAA,GAAAhB,MAAAC,GAEA75R,IACAA,EAAAuxE,KAAAD,IAAA,EAAAy9B,EAAA,GAAA,IAIA,IADA,IAAAg5E,EAAAnoL,EAAAqqS,KAAA,GACApiN,EAAA,GAAAkgG,EAAAo5G,MAAAt5M,GAAAA,KAKA,IAJA,IAAA0hD,EAAA3pI,EAAAgqS,KAAA/hN,GAEAysQ,EAAAvsK,EAAA6xG,MAAAC,GAEA75R,EAAA,EAAAA,IAAA,CACA,IAAAwyE,EAAAm5B,KAAAyoP,WAAA,IAAAx5D,EAAA,GAAA7yG,GAEAgoC,EAAAnwN,EAAAk9Q,IAAAtqM,GACA,GAAA,IAAAu9I,EAAA4tE,KAAA,GACA,OAAA5tE,EAEA,IAAAx2G,EAAA/mC,EAAAonN,MAAAC,GAAAgT,OAAAtjK,GACA,GAAA,IAAAhwB,EAAAzG,IAAAuhP,IAAA,IAAA96O,EAAAzG,IAAAwhP,GAAA,CAGA,IAAA,IAAAxhR,EAAA,EAAAA,EAAA+U,EAAA/U,IAAA,CAGA,GAAA,KAFAymC,EAAAA,EAAAugL,UAEAhnL,IAAAuhP,GACA,OAAA96O,EAAAyyL,UAAA/B,KAAA,GAAAntB,IAAAl9Q,GACA,GAAA,IAAA25G,EAAAzG,IAAAwhP,GACA,MAGA,GAAAxhR,IAAA+U,EAEA,OADA0xB,EAAAA,EAAAugL,UACAkS,UAAA/B,KAAA,GAAAntB,IAAAl9Q,IAIA,OAAA,s9NCjHI85R,EAAKx6R,EAAQ,SAEb6oR,EAAAA,IADc7oR,EAAQ,iBAEtBs0V,EAAAA,IAAiB95D,EAAG,IACpBm6D,EAAAA,IAAan6D,EAAG,IAChBi6D,EAAAA,IAAUj6D,EAAG,IACbk6D,EAAAA,IAAYl6D,EAAG,GACf86D,EAAAA,IAAY96D,EAAG,GACfoT,EAAS5tS,EAAQ,mBACjBw7Q,EAAcx7Q,EAAQ,eAG1B,SAAAo/Q,EAAsBt3C,EAAKsB,UACzBA,EAAMA,GAAO,OACRsmB,EAAO8H,SAAS1vB,KACnBA,EAAAA,IAAU4nB,EAAO5nB,EAAKsB,IAExB38H,KAAK63M,KAAAA,IAAW9pB,EAAG1yD,GACZr7H,KAGT,SAAAyyK,EAAuBkC,EAAMh4C,UAC3BA,EAAMA,GAAO,OACRsmB,EAAO8H,SAAS4pB,KACnBA,EAAAA,IAAW1xB,EAAO0xB,EAAMh4C,IAE1B38H,KAAK8oP,MAAAA,IAAY/6D,EAAGpZ,GACb30K,KAjBT3sG,EAAOC,QAAUg0V,MAoBbyB,EAAAA,GAsDJ,SAAAzB,EAAYl5N,EAAOvtB,EAAWmoP,GAC5BhpP,KAAKipP,aAAapoP,GAClBb,KAAKkpP,QAAAA,IAAcn7D,EAAG3/J,GACtBpuB,KAAK8hM,OAAS/T,EAAGgV,KAAK/iM,KAAKkpP,SAC3BlpP,KAAKmpP,UAAY/6N,EAAMnpD,OACvB+6B,KAAK63M,UAAOniT,EACZsqG,KAAK8oP,WAAQpzV,EACbsqG,KAAKopP,gBAAa1zV,EACdszV,GACFhpP,KAAK2yK,aAAeA,EACpB3yK,KAAKyyK,cAAgBA,GAErBzyK,KAAKopP,WAAa,EA4DtB,SAAAC,EAA2Bp6D,EAAItyD,OACzBpM,EAAAA,IAAU0yB,EAAOgsC,EAAG9rL,kBACnBw5H,EAGIpM,EAAInyH,SAASu+H,GAFbpM,EA5DX/8N,OAAOC,eAAe6zV,EAAG3pP,UAAW,cAAA,CAClCoB,YAAY,EACZvd,IAAK,iBAC4B,iBAApBwe,KAAKopP,aACdppP,KAAKopP,WAxEX,SAAoBh7N,EAAOvtB,OACrB2mP,EAAM3mP,EAAUzC,SAAS,OACzBp4B,EAAAA,CAAOwhR,EAAKp5N,EAAMhwB,SAAS,KAAK9zB,KAAK,QACrCtE,KAAO+iR,SACFA,EAAW/iR,OA2BhByxQ,EAzBAloQ,EAAQ,KAER6+C,EAAM+sJ,WACPgmB,EAAOwmD,cACPxmD,EAAOymD,WAAWx5N,KAClBguJ,EAAY32M,KAAK2oD,UAElB7+C,GAAS,EAKPA,GAHU,OAARi4Q,GAAwB,OAARA,EAGT,EAIA,EAEXuB,EAAW/iR,GAAOuJ,EACXA,SAEJ6sM,EAAY32M,KAAK2oD,EAAM6vK,KAAK,MAE/B1uN,GAAS,GAGHi4Q,OACD,KACCp5N,EAAMk0B,IAAIulM,GAAY1gP,IAAI+gP,KAE5B34Q,GAAS,aAGR,MACHkoQ,EAAMrpN,EAAMk0B,IAAI0lM,IACR7gP,IAAI8gP,IAAUxQ,EAAItwO,IAAI0hP,KAE5Bt5Q,GAAS,iBAIXA,GAAS,SAEbw5Q,EAAW/iR,GAAOuJ,EACXA,EAsBe+5Q,CAAWtpP,KAAKkpP,QAASlpP,KAAKupP,QAE3CvpP,KAAKopP,cAGhB9B,EAAG3pP,UAAU6rP,aAAe,kBACrBxpP,KAAK8oP,QACR9oP,KAAK8oP,MAAAA,IAAY/6D,EAAGhf,EAAY/uK,KAAKmpP,aAEvCnpP,KAAK63M,KAAO73M,KAAKypP,KAAKx7D,MAAMjuL,KAAK8hM,QAAQZ,OAAOlhM,KAAK8oP,OAAOzoD,UACrDrgM,KAAK0pP,gBAGdpC,EAAG3pP,UAAUgsP,cAAgB,SAAU3yG,OAGjC2/D,GADJ3/D,GADAA,EAAAA,IAAY+2C,EAAG/2C,IACDi3C,MAAMjuL,KAAK8hM,SACNZ,OAAOlhM,KAAK8oP,OAAOzoD,UAClCt/J,EAAAA,IAAUkiH,EAAO0zD,EAAOxzM,WACxBirB,EAAQpuB,KAAKmyK,cACbpxI,EAAI97D,OAASmpD,EAAMnpD,OAAAA,KACjB2kR,EAAAA,IAAY3mG,EAAO70H,EAAMnpD,OAAS87D,EAAI97D,QAC1C2kR,EAAMp4D,KAAK,GACXzwJ,EAAMkiH,EAAOpxJ,OAAAA,CAAQ+3P,EAAO7oN,WAEvBA,GAGTumN,EAAG3pP,UAAU+rP,aAAe,SAAsB/sH,UACzC0sH,EAAkBrpP,KAAK63M,KAAMl7E,IAGtC2qH,EAAG3pP,UAAUksP,cAAgB,SAAuBltH,UAC3C0sH,EAAkBrpP,KAAK8oP,MAAOnsH,IAGvC2qH,EAAG3pP,UAAUw0K,SAAW,SAAUx1C,UACzB0sH,EAAkBrpP,KAAKkpP,QAASvsH,IAGzC2qH,EAAG3pP,UAAUmsP,aAAe,SAAUntH,UAC7B0sH,EAAkBrpP,KAAKypP,KAAM9sH,IAGtC2qH,EAAG3pP,UAAUsrP,aAAe,SAAUzB,EAAK7qH,UACzCA,EAAMA,GAAO,OACRsmB,EAAO8H,SAASy8F,KACnBA,EAAAA,IAAUvkG,EAAOukG,EAAK7qH,IAExB38H,KAAKupP,MAAQ/B,EACbxnP,KAAKypP,KAAAA,IAAW17D,EAAGy5D,GACZxnP,2ICzJLijJ,EAAS1vP,EAAQ,eAAe0vP,OAChC4/D,EAAatvT,EAAQ,eACrBi9N,EAASj9N,EAAQ,mBACjBk/R,EAAWl/R,EAAQ,YACnB+0P,EAAO/0P,EAAQ,UACfoiR,EAASpiR,EAAQ,YAEjB2wQ,EAAa3wQ,EAAQ,qBAMzB,SAAA2sU,EAAe3iE,GACb/sC,EAAO+yG,SAAS3lO,KAAKoC,UAEjB0sD,EAAOw3G,EAAW3G,OACjB7wG,EAAAA,MAAAA,IAAgB5zD,MAAM,0BAE3BkH,KAAK+pP,UAAYr9L,EAAKr5C,KACtBrT,KAAKiiO,MAAQpf,EAAWn2J,EAAKr5C,MAC7BrT,KAAKimK,KAAOv5G,EAAKzoE,GACjB+b,KAAKgqP,UAAYt9L,EAAK47F,KAwBxB,SAAA83E,EAAiB7iE,GACf/sC,EAAO+yG,SAAS3lO,KAAKoC,UAEjB0sD,EAAOw3G,EAAW3G,OACjB7wG,EAAAA,MAAAA,IAAgB5zD,MAAM,0BAE3BkH,KAAKiiO,MAAQpf,EAAWn2J,EAAKr5C,MAC7BrT,KAAKimK,KAAOv5G,EAAKzoE,GACjB+b,KAAKgqP,UAAYt9L,EAAK47F,KAwBxB,SAAA23E,EAAqB1iE,cACR2iE,EAAK3iE,GAGlB,SAAA4iE,EAAuB5iE,cACV6iE,EAAO7iE,GA3EpB/pQ,OAAOW,KAAK+vQ,GAAY9vQ,SAAQ,SAAUY,GACxCkvQ,EAAWlvQ,GAAKivF,GAAKg/J,EAAOx5F,KAAKy6G,EAAWlvQ,GAAKivF,GAAI,OACrDigL,EAAWlvQ,EAAIo0E,eAAiB86L,EAAWlvQ,MAc7Cy9R,EAASytC,EAAM1vG,EAAO+yG,UAEtBrD,EAAKviO,UAAU8yO,OAAS,SAAiB/jL,EAAMvxE,EAAG2uF,GAChD9pE,KAAKiiO,MAAMtsK,OAAOjJ,GAClBod,KAGFo2J,EAAKviO,UAAUg4D,OAAS,SAAiBjJ,EAAMiwE,SACzB,iBAATjwE,IAAmBA,EAAOu2F,EAAOx5F,KAAKiD,EAAMiwE,IAEvD38H,KAAKiiO,MAAMtsK,OAAOjJ,GACX1sD,MAGTkgO,EAAKviO,UAAU2qJ,KAAO,SAAqBtzP,EAAK2nO,GAC9C38H,KAAKh7B,UACDquC,EAAOrT,KAAKiiO,MAAM/oG,SAClBmnD,EAAM/3B,EAAKj1I,EAAMr+G,EAAKgrG,KAAK+pP,UAAW/pP,KAAKgqP,UAAWhqP,KAAKimK,aAExDtpC,EAAM0jD,EAAIjiL,SAASu+H,GAAO0jD,GAanCoS,EAAS2tC,EAAQ5vG,EAAO+yG,UAExBnD,EAAOziO,UAAU8yO,OAAS,SAAiB/jL,EAAMvxE,EAAG2uF,GAClD9pE,KAAKiiO,MAAMtsK,OAAOjJ,GAClBod,KAGFs2J,EAAOziO,UAAUg4D,OAAS,SAAiBjJ,EAAMiwE,SAC3B,iBAATjwE,IAAmBA,EAAOu2F,EAAOx5F,KAAKiD,EAAMiwE,IAEvD38H,KAAKiiO,MAAMtsK,OAAOjJ,GACX1sD,MAGTogO,EAAOziO,UAAUg4K,OAAS,SAAuB3gR,EAAKqrR,EAAK1jD,GACtC,iBAAR0jD,IAAkBA,EAAMp9B,EAAOx5F,KAAK42H,EAAK1jD,IAEpD38H,KAAKh7B,UACDquC,EAAOrT,KAAKiiO,MAAM/oG,gBACfy8C,EAAO0K,EAAKhtK,EAAMr+G,EAAKgrG,KAAKgqP,UAAWhqP,KAAKimK,OAWrD5yQ,EAAOC,QAAAA,CACL4sU,KAAMD,EACNG,OAAQD,EACRF,WAAYA,EACZE,aAAcA,2LCzFZl9E,EAAS1vP,EAAQ,eAAe0vP,OAChCg8E,EAAa1rU,EAAQ,eACrB02V,EAAM12V,EAAQ,kBACdq6R,EAAKr6R,EAAQ,YAAYq2E,GACzBmkN,EAAKx6R,EAAQ,SACb22V,EAAY32V,EAAQ,cACpB09R,EAAS19R,EAAQ,iBAyErB,SAAA42V,EAAiBv8O,EAAGU,EAAG+E,EAAM+pO,OAC3BxvO,EAAIq1I,EAAOx5F,KAAK77C,EAAEzK,YACZl+B,OAASqpC,EAAE8vH,aAAAA,KACXu8B,EAAQ1X,EAAOO,MAAMl1I,EAAE8vH,aAAexwH,EAAE3oC,QAC5C2oC,EAAIq1I,EAAOpxJ,OAAAA,CAAQ8oK,EAAO/sJ,QAExB4zK,EAAOnuK,EAAKpuC,OACZmlR,EAkBN,SAAsBhwH,EAAM9rH,GAE1B8rH,GADAA,EAAOiwH,EAASjwH,EAAM9rH,IACVg0C,IAAIh0C,OACZyyB,EAAMkiH,EAAOx5F,KAAK2wE,EAAKj3H,cACvB49B,EAAI97D,OAASqpC,EAAE8vH,aAAAA,KACbu8B,EAAQ1X,EAAOO,MAAMl1I,EAAE8vH,aAAer9F,EAAI97D,QAC9C87D,EAAMkiH,EAAOpxJ,OAAAA,CAAQ8oK,EAAO55H,WAEvBA,EA1BKupN,CAAYj3O,EAAM/E,GAC1Bw2D,EAAIm+E,EAAOO,MAAMg+B,GACrB18G,EAAE0sH,KAAK,OACHn9R,EAAI4uP,EAAOO,MAAMg+B,UACrBntR,EAAI4qU,EAAWme,EAAM/oV,GAAGshK,OAAOmP,GAAGnP,OAAOstF,EAAOx5F,KAAAA,CAAM,KAAKkM,OAAO/nD,GAAG+nD,OAAOy0L,GAAOlxH,SACnFp0D,EAAIm6J,EAAWme,EAAM/oV,GAAGshK,OAAOmP,GAAGo0D,UAGzB7kO,EAFTA,EAAI4qU,EAAWme,EAAM/oV,GAAGshK,OAAOmP,GAAGnP,OAAOstF,EAAOx5F,KAAAA,CAAM,KAAKkM,OAAO/nD,GAAG+nD,OAAOy0L,GAAOlxH,SAEpEp0D,EADfA,EAAIm6J,EAAWme,EAAM/oV,GAAGshK,OAAOmP,GAAGo0D,UAIpC,SAAAmxH,EAAmBE,EAAOj8O,OACpB8rH,EAAAA,IAAW2zD,EAAGw8D,GACd5lP,GAAS4lP,EAAMtlR,QAAU,GAAKqpC,EAAE2iK,mBAChCtsK,EAAQ,GAAGy1H,EAAK0jE,MAAMn5L,GACnBy1H,EAcT,SAAAowH,EAAkBl8O,EAAGm8O,EAAIrN,OACnBr+L,EACA1qJ,SAGF0qJ,EAAIkkG,EAAOO,MAAM,GAEC,EAAXzkG,EAAE95E,OAAaqpC,EAAE2iK,aACtBw5E,EAAG3lL,EAAIm6J,EAAWme,EAAMqN,EAAGp2V,GAAGshK,OAAO80L,EAAG3lL,GAAGo0D,SAC3Cn6E,EAAIkkG,EAAOpxJ,OAAAA,CAAQktD,EAAG0rM,EAAG3lL,IAG3BzwK,EAAIg2V,EAAStrM,EAAGzwC,GAChBm8O,EAAGp2V,EAAI4qU,EAAWme,EAAMqN,EAAGp2V,GAAGshK,OAAO80L,EAAG3lL,GAAGnP,OAAOstF,EAAOx5F,KAAAA,CAAM,KAAKyvE,SACpEuxH,EAAG3lL,EAAIm6J,EAAWme,EAAMqN,EAAGp2V,GAAGshK,OAAO80L,EAAG3lL,GAAGo0D,gBACtB,IAAd7kO,EAAE8yG,IAAImH,WAERj6G,EAGT,SAAAq2V,EAAgBtmI,EAAG/vN,EAAG6yE,EAAGonC,UAChB81G,EAAE6pE,MAAMF,EAAGgV,KAAK77N,IAAIg6N,OAAO7sS,GAAGgsS,UAAU/9I,IAAIh0C,GAGrDj7G,EAAOC,QAnIP,SAAe+/G,EAAMr+G,EAAKqkT,EAAUsxC,EAAUnmR,OACxCmwM,EAAOu1E,EAAUl1V,MACjB2/Q,EAAKmZ,MAAAA,IAEU,UAAb68D,GAAqC,cAAbA,EAAa,MAAA,IAAuB7xP,MAAM,iCAoB1E,SAAiBua,EAAMshK,OACjBi2E,EAAU35D,EAAOtc,EAAKmZ,MAAMxjN,KAAK,UAChCsgR,EAAAA,MAAAA,IAAmB9xP,MAAM,iBAAmB67K,EAAKmZ,MAAMxjN,KAAK,UAI7Dy2D,EAFA+sJ,IAAYF,EAAGg9D,GACHp7D,eAAe7a,EAAKnC,YACtBlqB,KAAKj1I,UAEZ4vI,EAAOx5F,KAAK1oB,EAAIw1K,SA3Bds0C,CAAOx3O,EAAMshK,MACG,QAAdA,EAAK7tM,KAAS,IACN,QAAb6jR,EAAa,MAAA,IAAiB7xP,MAAM,iCA4B5C,SAAkBua,EAAMshK,EAAMyoE,OAMxB/oV,EALAu5G,EAAI+mK,EAAKp+L,OAAOu0Q,SAChB5jR,EAAIytM,EAAKp+L,OAAOrP,EAChBonC,EAAIqmK,EAAKp+L,OAAO+3B,EAChB81G,EAAIuwD,EAAKp+L,OAAO6tI,EAChBp2G,EAAAA,IAAQ+/K,EAAG,GAEXhrE,EAAIsnI,EAASh3O,EAAM/E,GAAGg0C,IAAIh0C,GAC1BpyB,GAAI,EACJuuQ,EAAKN,EAAOv8O,EAAGU,EAAG+E,EAAM+pO,SACf,IAANlhQ,GAEL8xB,EAAI08O,EAAMtmI,EADV/vN,EAAIm2V,EAAQl8O,EAAGm8O,EAAIrN,GACHl2Q,EAAGonC,GAED,KADlBpyB,EAAI7nF,EAAEmrS,KAAKlxL,GAAGihL,KAAKxsE,EAAE/jI,IAAI4uB,EAAEgiL,IAAI5hL,KAAKs0C,IAAIh0C,IAClC0jL,KAAK,KACT91M,GAAI,EACJ8xB,EAAAA,IAAQ+/K,EAAG,WAMjB,SAAgB//K,EAAG9xB,GACjB8xB,EAAIA,EAAE7K,UACNjnB,EAAIA,EAAEinB,UAGK,IAAP6K,EAAE,KAAWA,EAAAA,CAAK,GAAGnc,OAAOmc,IACrB,IAAP9xB,EAAE,KAAWA,EAAAA,CAAK,GAAG2V,OAAO3V,QAG5BnQ,EAAAA,CAAO,GADCiiC,EAAE/oC,OAASiX,EAAEjX,OAAS,EACV,EAAM+oC,EAAE/oC,eAChC8G,EAAMA,EAAI8lB,OAAOmc,EAAAA,CAAI,EAAM9xB,EAAEjX,QAASiX,GAC/B+mK,EAAOx5F,KAAK19E,GAdZwqO,CAAMvoM,EAAG9xB,GA9CP6uQ,CAAQ13O,EAAMshK,EAAM0kC,MAEV,QAAbsxC,GAAmC,cAAbA,EAAa,MAAA,IAAuB7xP,MAAM,0BAEtEua,EAAO4vI,EAAOpxJ,OAAAA,CAAQrtB,EAAK6uC,YACvBjQ,EAAMuxK,EAAKq2E,QAAQ5sH,aACnBpkI,EAAAA,CAAO,EAAG,GACPqZ,EAAKpuC,OAAS+0B,EAAI/0B,OAAS,EAAIm+B,GAAKpJ,EAAIlvB,KAAK,KACpDkvB,EAAIlvB,KAAK,WACL3D,GAAK,IACAA,EAAIksC,EAAKpuC,QAAQ+0B,EAAIlvB,KAAKuoC,EAAKlsC,WAE9B8iR,EAAIjwP,EAAK26K,IAgHrBthR,EAAOC,QAAQ62V,OAASA,EACxB92V,EAAOC,QAAQk3V,QAAUA,2MC9IrBz8D,EAAKx6R,EAAQ,SACbw7Q,EAAcx7Q,EAAQ,eAQ1B,SAAA03V,EAAet2E,OAET3mK,EADA5K,EAAMuxK,EAAKq2E,QAAQ5sH,gBAGrBpwH,EAAAA,IAAQ+/K,EAAGhf,EAAY3rK,UAChB4K,EAAE7G,IAAIwtK,EAAKq2E,UAAY,IAAMh9O,EAAEkhL,KAAKva,EAAKu2E,UAAYl9O,EAAEkhL,KAAKva,EAAKw2E,gBACnEn9O,EAGT,SAAAi8O,EAAcx6Q,EAAKklM,OACby2E,EAhBN,SAAgBz2E,OACV3mK,EAAIi9O,EAAKt2E,UAEJ02E,QADKr9O,EAAEigL,MAAMF,EAAGgV,KAAKpuB,EAAKq2E,UAAU9pD,OAAAA,IAAWnT,EAAGpZ,EAAKH,iBAAiB6rB,UACtDirD,UAAWt9O,EAAEwxL,KAAK7qB,EAAKq2E,UAarCO,CAAM52E,GACfvxK,EAAMuxK,EAAKq2E,QAAQ5sH,aACnBotH,EAAAA,IAAcz9D,EAAGt+M,GAAKmgN,IAAIw7D,EAAOC,SAASn8D,KAAKva,EAAKq2E,SACpDh2J,EAAKw2J,EAAQv9D,MAAMF,EAAGgV,KAAKpuB,EAAKu2E,SAChCh2J,EAAKs2J,EAAQv9D,MAAMF,EAAGgV,KAAKpuB,EAAKw2E,SAChCM,EAAO92E,EAAK+2E,YACZxkR,EAAIytM,EAAKu2E,OACT58O,EAAIqmK,EAAKw2E,OACT1nF,EAAKzuE,EAAGksG,OAAOvsB,EAAKg3E,WAAWtrD,UAC/B38B,EAAKxuE,EAAGgsG,OAAOvsB,EAAKi3E,WAAWvrD,UAC/B54H,EAAIg8F,EAAG4rB,KAAK3rB,GAAI6rB,KAAKk8D,GAAMv8D,KAAKhoN,GAAGqoN,KAAKjhL,UACrCo1J,EAAG0rB,KAAK3nH,GAAG8nH,KAAK67D,EAAOE,WAAWp8D,KAAKva,EAAKq2E,SAAS77D,YAAYlsC,EAAQ,KAAM7/I,GAExF6mP,EAAIgB,KAAOA,EAEX53V,EAAOC,QAAU22V,mFClCjB,SAAA52V,EAAAC,GACA,aAGA,SAAAulG,EAAAc,EAAAlqB,GACA,IAAAkqB,EAAA,MAAA,IAAAb,MAAArpB,GAAA,oBAKA,SAAAgjN,EAAAxmG,EAAAymG,GACAzmG,EAAA0mG,OAAAD,EACA,IAAAE,EAAA,aACAA,EAAAj1L,UAAA+0L,EAAA/0L,UACAsuF,EAAAtuF,UAAA,IAAAi1L,EACA3mG,EAAAtuF,UAAAgP,YAAAs/E,EAKA,SAAA8hG,EAAAjpL,EAAAs7B,EAAAyyJ,GACA,GAAA9E,EAAA+E,KAAAhuL,GACA,OAAAA,EAGA9E,KAAA+yL,SAAA,EACA/yL,KAAAgzL,MAAA,KACAhzL,KAAA/6B,OAAA,EAGA+6B,KAAAkuL,IAAA,KAEA,OAAAppL,IACA,OAAAs7B,GAAA,OAAAA,IACAyyJ,EAAAzyJ,EACAA,EAAA,IAGApgC,KAAA+hK,MAAAj9J,GAAA,EAAAs7B,GAAA,GAAAyyJ,GAAA,OAYA,IAAA5vC,EATA,iBAAA5vP,EACAA,EAAAC,QAAAy6R,EAEAz6R,EAAAy6R,GAAAA,EAGAA,EAAAA,GAAAA,EACAA,EAAAkF,SAAA,GAGA,IAEAhwC,EADA,oBAAA1jJ,aAAA,IAAAA,OAAA0jJ,OACA1jJ,OAAA0jJ,OAEA1vP,EAAA,UAAA0vP,OAEA,MAAAlvP,IAgIA,SAAAm/R,EAAAv3L,EAAAp2B,GACA,IAAAkH,EAAAkvB,EAAA1jB,WAAA1S,GAEA,OAAAkH,GAAA,IAAAA,GAAA,GACAA,EAAA,GAEAA,GAAA,IAAAA,GAAA,GACAA,EAAA,GAEAA,GAAA,IAAAA,GAAA,IACAA,EAAA,QAEAosB,GAAA,EAAA,wBAAA8C,GAIA,SAAAw3L,EAAAx3L,EAAAy3L,EAAA7tN,GACA,IAAAyoC,EAAAklL,EAAAv3L,EAAAp2B,GAIA,OAHAA,EAAA,GAAA6tN,IACAplL,GAAAklL,EAAAv3L,EAAAp2B,EAAA,IAAA,GAEAyoC,EA8CA,SAAAqlL,EAAA79L,EAAAxgB,EAAAhQ,EAAA4qN,GAIA,IAHA,IAAA5hL,EAAA,EACA10B,EAAA,EACA8pB,EAAAx9B,KAAAq0B,IAAAzE,EAAAvwB,OAAAD,GACAmC,EAAA6N,EAAA7N,EAAAi8B,EAAAj8B,IAAA,CACA,IAAAsF,EAAA+oB,EAAAvd,WAAA9Q,GAAA,GAEA6mC,GAAA4hL,EAIAt2M,EADA7M,GAAA,GACAA,EAAA,GAAA,GAGAA,GAAA,GACAA,EAAA,GAAA,GAIAA,EAEAosB,EAAApsB,GAAA,GAAA6M,EAAAs2M,EAAA,qBACA5hL,GAAA10B,EAEA,OAAA00B,EA4DA,SAAAowE,EAAAukC,EAAA1mH,GACA0mH,EAAAqwE,MAAA/2L,EAAA+2L,MACArwE,EAAA19I,OAAAg3B,EAAAh3B,OACA09I,EAAAowE,SAAA92L,EAAA82L,SACApwE,EAAAurE,IAAAjyL,EAAAiyL,IAsCA,GA9TAH,EAAA+E,KAAA,SAAAphL,GACA,OAAAA,aAAAq8K,GAIA,OAAAr8K,GAAA,iBAAAA,GACAA,EAAA/E,YAAAsmL,WAAAlF,EAAAkF,UAAAp1L,MAAA/gB,QAAA40B,EAAAshL,QAGAjF,EAAApoN,IAAA,SAAAujB,EAAAC,GACA,OAAAD,EAAAie,IAAAhe,GAAA,EAAAD,EACAC,GAGA4kM,EAAA9zL,IAAA,SAAA/Q,EAAAC,GACA,OAAAD,EAAAie,IAAAhe,GAAA,EAAAD,EACAC,GAGA4kM,EAAApwL,UAAAokK,MAAA,SAAAj9J,EAAAs7B,EAAAyyJ,GACA,GAAA,iBAAA/tL,EACA,OAAA9E,KAAAszL,YAAAxuL,EAAAs7B,EAAAyyJ,GAGA,GAAA,iBAAA/tL,EACA,OAAA9E,KAAAuzL,WAAAzuL,EAAAs7B,EAAAyyJ,GAGA,QAAAzyJ,IACAA,EAAA,IAEAvnC,EAAAunC,KAAA,EAAAA,IAAAA,GAAA,GAAAA,GAAA,IAGA,IAAAprD,EAAA,EACA,OAFA8vB,EAAAA,EAAA1G,WAAAllB,QAAA,OAAA,KAEA,KACAlE,IACAgrB,KAAA+yL,SAAA,GAGA/9M,EAAA8vB,EAAA7/B,SACA,KAAAm7D,EACApgC,KAAAwzL,UAAA1uL,EAAA9vB,EAAA69M,IAEA7yL,KAAAyzL,WAAA3uL,EAAAs7B,EAAAprD,GACA,OAAA69M,GACA7yL,KAAAuzL,WAAAvzL,KAAAmD,UAAAi9B,EAAAyyJ,MAMA9E,EAAApwL,UAAA21L,YAAA,SAAAxuL,EAAAs7B,EAAAyyJ,GACA/tL,EAAA,IACA9E,KAAA+yL,SAAA,EACAjuL,GAAAA,GAEAA,EAAA,UACA9E,KAAAgzL,MAAA,CAAA,SAAAluL,GACA9E,KAAA/6B,OAAA,GACA6/B,EAAA,kBACA9E,KAAAgzL,MAAA,CACA,SAAAluL,EACAA,EAAA,SAAA,UAEA9E,KAAA/6B,OAAA,IAEA4zB,EAAAiM,EAAA,kBACA9E,KAAAgzL,MAAA,CACA,SAAAluL,EACAA,EAAA,SAAA,SACA,GAEA9E,KAAA/6B,OAAA,GAGA,OAAA4tN,GAGA7yL,KAAAuzL,WAAAvzL,KAAAmD,UAAAi9B,EAAAyyJ,IAGA9E,EAAApwL,UAAA41L,WAAA,SAAAzuL,EAAAs7B,EAAAyyJ,GAGA,GADAh6L,EAAA,iBAAAiM,EAAA7/B,QACA6/B,EAAA7/B,QAAA,EAGA,OAFA+6B,KAAAgzL,MAAA,CAAA,GACAhzL,KAAA/6B,OAAA,EACA+6B,KAGAA,KAAA/6B,OAAAW,KAAAwhL,KAAAtiJ,EAAA7/B,OAAA,GACA+6B,KAAAgzL,MAAA,IAAAn1L,MAAAmC,KAAA/6B,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA,EAGA,IAAAmqB,EAAAmzH,EACA8Q,EAAA,EACA,GAAA,OAAAs9D,EACA,IAAA1rN,EAAA29B,EAAA7/B,OAAA,EAAAqsB,EAAA,EAAAnqB,GAAA,EAAAA,GAAA,EACAs9I,EAAA3/G,EAAA39B,GAAA29B,EAAA39B,EAAA,IAAA,EAAA29B,EAAA39B,EAAA,IAAA,GACA64B,KAAAgzL,MAAA1hM,IAAAmzH,GAAA8Q,EAAA,SACAv1H,KAAAgzL,MAAA1hM,EAAA,GAAAmzH,IAAA,GAAA8Q,EAAA,UACAA,GAAA,KACA,KACAA,GAAA,GACAjkI,UAGA,GAAA,OAAAuhM,EACA,IAAA1rN,EAAA,EAAAmqB,EAAA,EAAAnqB,EAAA29B,EAAA7/B,OAAAkC,GAAA,EACAs9I,EAAA3/G,EAAA39B,GAAA29B,EAAA39B,EAAA,IAAA,EAAA29B,EAAA39B,EAAA,IAAA,GACA64B,KAAAgzL,MAAA1hM,IAAAmzH,GAAA8Q,EAAA,SACAv1H,KAAAgzL,MAAA1hM,EAAA,GAAAmzH,IAAA,GAAA8Q,EAAA,UACAA,GAAA,KACA,KACAA,GAAA,GACAjkI,KAIA,OAAA0O,KAAAsiM,UA2BAvU,EAAApwL,UAAA61L,UAAA,SAAA1uL,EAAA9vB,EAAA69M,GAEA7yL,KAAA/6B,OAAAW,KAAAwhL,MAAAtiJ,EAAA7/B,OAAA+P,GAAA,GACAgrB,KAAAgzL,MAAA,IAAAn1L,MAAAmC,KAAA/6B,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA,EAIA,IAGAs9I,EAHA8Q,EAAA,EACAjkI,EAAA,EAGA,GAAA,OAAAuhM,EACA,IAAA1rN,EAAA29B,EAAA7/B,OAAA,EAAAkC,GAAA6N,EAAA7N,GAAA,EACAs9I,EAAA0uE,EAAAruL,EAAA9vB,EAAA7N,IAAAouJ,EACAv1H,KAAAgzL,MAAA1hM,IAAA,SAAAmzH,EACA8Q,GAAA,IACAA,GAAA,GACAjkI,GAAA,EACA0O,KAAAgzL,MAAA1hM,IAAAmzH,IAAA,IAEA8Q,GAAA,OAKA,IAAApuJ,GADA29B,EAAA7/B,OAAA+P,GACA,GAAA,EAAAA,EAAA,EAAAA,EAAA7N,EAAA29B,EAAA7/B,OAAAkC,GAAA,EACAs9I,EAAA0uE,EAAAruL,EAAA9vB,EAAA7N,IAAAouJ,EACAv1H,KAAAgzL,MAAA1hM,IAAA,SAAAmzH,EACA8Q,GAAA,IACAA,GAAA,GACAjkI,GAAA,EACA0O,KAAAgzL,MAAA1hM,IAAAmzH,IAAA,IAEA8Q,GAAA,EAKAv1H,KAAAsiM,UA8BAvU,EAAApwL,UAAA81L,WAAA,SAAA3uL,EAAAs7B,EAAAprD,GAEAgrB,KAAAgzL,MAAA,CAAA,GACAhzL,KAAA/6B,OAAA,EAGA,IAAA,IAAA0uN,EAAA,EAAAC,EAAA,EAAAA,GAAA,SAAAA,GAAAxzJ,EACAuzJ,IAEAA,IACAC,EAAAA,EAAAxzJ,EAAA,EAOA,IALA,IAAAgvB,EAAAtqD,EAAA7/B,OAAA+P,EACAstE,EAAA8M,EAAAukI,EACA3uN,EAAAY,KAAAq0B,IAAAm1D,EAAAA,EAAA9M,GAAAttE,EAEAwtC,EAAA,EACAr7C,EAAA6N,EAAA7N,EAAAnC,EAAAmC,GAAAwsN,EACAnxK,EAAA6wK,EAAAvuL,EAAA39B,EAAAA,EAAAwsN,EAAAvzJ,GAEApgC,KAAA6zL,MAAAD,GACA5zL,KAAAgzL,MAAA,GAAAxwK,EAAA,SACAxiB,KAAAgzL,MAAA,IAAAxwK,EAEAxiB,KAAA8zL,OAAAtxK,GAIA,GAAA,IAAA8/B,EAAA,CACA,IAAA+8E,EAAA,EAGA,IAFA78G,EAAA6wK,EAAAvuL,EAAA39B,EAAA29B,EAAA7/B,OAAAm7D,GAEAj5D,EAAA,EAAAA,EAAAm7E,EAAAn7E,IACAk4J,GAAAj/F,EAGApgC,KAAA6zL,MAAAx0D,GACAr/H,KAAAgzL,MAAA,GAAAxwK,EAAA,SACAxiB,KAAAgzL,MAAA,IAAAxwK,EAEAxiB,KAAA8zL,OAAAtxK,GAIAxiB,KAAAsiM,UAGAvU,EAAApwL,UAAA1gG,KAAA,SAAA0lN,GACAA,EAAAqwE,MAAA,IAAAn1L,MAAAmC,KAAA/6B,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACAw7I,EAAAqwE,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAEAw7I,EAAA19I,OAAA+6B,KAAA/6B,OACA09I,EAAAowE,SAAA/yL,KAAA+yL,SACApwE,EAAAurE,IAAAluL,KAAAkuL,KAUAH,EAAApwL,UAAAkuP,MAAA,SAAAlpI,GACAvkC,EAAAukC,EAAA3iH,OAGA+tL,EAAApwL,UAAA03B,MAAA,WACA,IAAArnB,EAAA,IAAA+/K,EAAA,MAEA,OADA/tL,KAAA/iG,KAAA+wG,GACAA,GAGA+/K,EAAApwL,UAAAo2L,QAAA,SAAA92L,GACA,KAAA+C,KAAA/6B,OAAAg4B,GACA+C,KAAAgzL,MAAAhzL,KAAA/6B,UAAA,EAEA,OAAA+6B,MAIA+tL,EAAApwL,UAAA2kM,OAAA,WACA,KAAAtiM,KAAA/6B,OAAA,GAAA,IAAA+6B,KAAAgzL,MAAAhzL,KAAA/6B,OAAA,IACA+6B,KAAA/6B,SAEA,OAAA+6B,KAAAg0L,aAGAjG,EAAApwL,UAAAq2L,UAAA,WAKA,OAHA,IAAAh0L,KAAA/6B,QAAA,IAAA+6B,KAAAgzL,MAAA,KACAhzL,KAAA+yL,SAAA,GAEA/yL,MAKA,oBAAA9pG,QAAA,mBAAAA,OAAAugP,IACA,IACAs3C,EAAApwL,UAAAznG,OAAAugP,IAAA,+BAAAw9C,EACA,MAAAlgS,GACAg6R,EAAApwL,UAAAs2L,QAAAA,OAGAlG,EAAApwL,UAAAs2L,QAAAA,EAGA,SAAAA,IACA,OAAAj0L,KAAAkuL,IAAA,UAAA,SAAAluL,KAAA5B,SAAA,IAAA,IAiCA,IAAAu8J,EAAA,CACA,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGAu5B,EAAA,CACA,EAAA,EACA,GAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAGAC,EAAA,CACA,EAAA,EACA,SAAA,SAAA,SAAA,SAAA,SAAA,SAAA,SACA,SAAA,IAAA,SAAA,SAAA,SAAA,QAAA,SACA,SAAA,SAAA,SAAA,SAAA,KAAA,QAAA,QACA,QAAA,QAAA,QAAA,SAAA,SAAA,SAAA,SACA,MAAA,SAAA,SAAA,SAAA,SAAA,SAAA,UAGApG,EAAApwL,UAAAS,SAAA,SAAAgiC,EAAAglI,GAIA,IAAArkI,EACA,GAHAqkI,EAAA,EAAAA,GAAA,EAGA,MAJAhlI,EAAAA,GAAA,KAIA,QAAAA,EAAA,CACAW,EAAA,GAGA,IAFA,IAAAw0F,EAAA,EACAsI,EAAA,EACA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs9I,EAAAzkH,KAAAgzL,MAAA7rN,GACAq7C,GAAA,UAAAiiG,GAAA8Q,EAAAsI,IAAAz/H,SAAA,IAGA2iC,EADA,KADA88F,EAAApZ,IAAA,GAAA8Q,EAAA,WACApuJ,IAAA64B,KAAA/6B,OAAA,EACA01L,EAAA,EAAAn4I,EAAAv9C,QAAAu9C,EAAAue,EAEAve,EAAAue,GAEAw0F,GAAA,IACA,KACAA,GAAA,GACApuJ,KAMA,IAHA,IAAA02J,IACA98F,EAAA88F,EAAAz/H,SAAA,IAAA2iC,GAEAA,EAAA97D,OAAAmgM,GAAA,GACArkI,EAAA,IAAAA,EAKA,OAHA,IAAA/gC,KAAA+yL,WACAhyJ,EAAA,IAAAA,GAEAA,EAGA,GAAAX,KAAA,EAAAA,IAAAA,GAAA,GAAAA,GAAA,GAAA,CAEA,IAAAo0J,EAAAN,EAAA9zJ,GAEAq0J,EAAAN,EAAA/zJ,GACAW,EAAA,GACA,IAAAt0D,EAAAuzB,KAAAq1B,QAEA,IADA5oD,EAAAsmN,SAAA,GACAtmN,EAAAoiN,UAAA,CACA,IAAA7gL,EAAAvhC,EAAAq/Q,MAAAr3D,GAAAr2L,SAAAgiC,GAMAW,GALAt0D,EAAAA,EAAAkoN,MAAAF,IAEA5F,SAGA7gL,EAAA+yB,EAFA45H,EAAA65B,EAAAxmL,EAAA/oC,QAAA+oC,EAAA+yB,EAQA,IAHA/gC,KAAA6uL,WACA9tJ,EAAA,IAAAA,GAEAA,EAAA97D,OAAAmgM,GAAA,GACArkI,EAAA,IAAAA,EAKA,OAHA,IAAA/gC,KAAA+yL,WACAhyJ,EAAA,IAAAA,GAEAA,EAGAloC,GAAA,EAAA,oCAGAk1L,EAAApwL,UAAAqB,SAAA,WACA,IAAA7S,EAAA6T,KAAAgzL,MAAA,GASA,OARA,IAAAhzL,KAAA/6B,OACAknB,GAAA,SAAA6T,KAAAgzL,MAAA,GACA,IAAAhzL,KAAA/6B,QAAA,IAAA+6B,KAAAgzL,MAAA,GAEA7mM,GAAA,iBAAA,SAAA6T,KAAAgzL,MAAA,GACAhzL,KAAA/6B,OAAA,GACA4zB,GAAA,EAAA,8CAEA,IAAAmH,KAAA+yL,UAAA5mM,EAAAA,GAGA4hM,EAAApwL,UAAAvW,OAAA,WACA,OAAA4Y,KAAA5B,SAAA,GAAA,IAGA6kJ,IACA8qC,EAAApwL,UAAAi3L,SAAA,SAAA/B,EAAA5tN,GACA,OAAA+6B,KAAAmvL,YAAAlsC,EAAA4vC,EAAA5tN,KAIA8oN,EAAApwL,UAAAwF,QAAA,SAAA0vL,EAAA5tN,GACA,OAAA+6B,KAAAmvL,YAAAtxL,MAAAg1L,EAAA5tN,IA4gBA,SAAAmvN,EAAA90L,EAAAoS,EAAAqvB,GACAA,EAAAgyJ,SAAArhL,EAAAqhL,SAAAzzL,EAAAyzL,SACA,IAAA3vL,EAAA9D,EAAAr6B,OAAAysC,EAAAzsC,OAAA,EACA87D,EAAA97D,OAAAm+B,EACAA,EAAAA,EAAA,EAAA,EAGA,IAAAv8B,EAAA,EAAAy4B,EAAA0zL,MAAA,GACA15M,EAAA,EAAAo4B,EAAAshL,MAAA,GACAhlL,EAAAnnC,EAAAyS,EAEAgqK,EAAA,SAAAt1I,EACA6vH,EAAA7vH,EAAA,SAAA,EACA+yB,EAAAiyJ,MAAA,GAAA1vC,EAEA,IAAA,IAAAjvP,EAAA,EAAAA,EAAA+uG,EAAA/uG,IAAA,CAMA,IAHA,IAAAggS,EAAAx2D,IAAA,GACAy2D,EAAA,SAAAz2D,EACA02D,EAAA3uN,KAAAq0B,IAAA5lG,EAAAq9G,EAAAzsC,OAAA,GACAqsB,EAAA1rB,KAAAD,IAAA,EAAAtxE,EAAAirG,EAAAr6B,OAAA,GAAAqsB,GAAAijM,EAAAjjM,IAAA,CACA,IAAAnqB,EAAA9yE,EAAAi9F,EAAA,EAIA+iM,IADArmL,GAFAnnC,EAAA,EAAAy4B,EAAA0zL,MAAA7rN,KACAmS,EAAA,EAAAo4B,EAAAshL,MAAA1hM,IACAgjM,GACA,SAAA,EACAA,EAAA,SAAAtmL,EAEA+yB,EAAAiyJ,MAAA3+R,GAAA,EAAAigS,EACAz2D,EAAA,EAAAw2D,EAQA,OANA,IAAAx2D,EACA98F,EAAAiyJ,MAAA3+R,GAAA,EAAAwpO,EAEA98F,EAAA97D,SAGA87D,EAAAuhK,SAxiBAvU,EAAApwL,UAAAwxL,YAAA,SAAA0F,EAAAhC,EAAA5tN,GACA+6B,KAAAsiM,SAEA,IAAAlkE,EAAAp+H,KAAAo+H,aACA02D,EAAA7vN,GAAAW,KAAAD,IAAA,EAAAy4J,GACAvlI,EAAAulI,GAAA02D,EAAA,yCACAj8L,EAAAi8L,EAAA,EAAA,+BAEA,IAAA/oN,EAfA,SAAA8oN,EAAA53L,GACA,OAAA43L,EAAA3tC,YACA2tC,EAAA3tC,YAAAjqJ,GAEA,IAAA43L,EAAA53L,GAWA8uP,CAAAl3D,EAAAC,GAGA,OADA90L,KAAA,gBADA,OAAA6yL,EAAA,KAAA,OACA9mN,EAAAqyJ,GACAryJ,GAGAgiN,EAAApwL,UAAAquP,eAAA,SAAAjgR,EAAAqyJ,GAIA,IAHA,IAAAp1B,EAAA,EACA60B,EAAA,EAEA12J,EAAA,EAAAw9B,EAAA,EAAAx9B,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAq7C,EAAAxiB,KAAAgzL,MAAA7rN,IAAAw9B,EAAAk5H,EAEA9xJ,EAAAi9H,KAAA,IAAAxmF,EACAwmF,EAAAj9H,EAAA9G,SACA8G,EAAAi9H,KAAAxmF,GAAA,EAAA,KAEAwmF,EAAAj9H,EAAA9G,SACA8G,EAAAi9H,KAAAxmF,GAAA,GAAA,KAGA,IAAA7d,GACAqkG,EAAAj9H,EAAA9G,SACA8G,EAAAi9H,KAAAxmF,GAAA,GAAA,KAEAq7G,EAAA,EACAl5H,EAAA,IAEAk5H,EAAAr7G,IAAA,GACA7d,GAAA,GAIA,GAAAqkG,EAAAj9H,EAAA9G,OAGA,IAFA8G,EAAAi9H,KAAA60B,EAEA70B,EAAAj9H,EAAA9G,QACA8G,EAAAi9H,KAAA,GAKA+kF,EAAApwL,UAAAsuP,eAAA,SAAAlgR,EAAAqyJ,GAIA,IAHA,IAAAp1B,EAAAj9H,EAAA9G,OAAA,EACA44J,EAAA,EAEA12J,EAAA,EAAAw9B,EAAA,EAAAx9B,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAq7C,EAAAxiB,KAAAgzL,MAAA7rN,IAAAw9B,EAAAk5H,EAEA9xJ,EAAAi9H,KAAA,IAAAxmF,EACAwmF,GAAA,IACAj9H,EAAAi9H,KAAAxmF,GAAA,EAAA,KAEAwmF,GAAA,IACAj9H,EAAAi9H,KAAAxmF,GAAA,GAAA,KAGA,IAAA7d,GACAqkG,GAAA,IACAj9H,EAAAi9H,KAAAxmF,GAAA,GAAA,KAEAq7G,EAAA,EACAl5H,EAAA,IAEAk5H,EAAAr7G,IAAA,GACA7d,GAAA,GAIA,GAAAqkG,GAAA,EAGA,IAFAj9H,EAAAi9H,KAAA60B,EAEA70B,GAAA,GACAj9H,EAAAi9H,KAAA,GAKApjI,KAAAovN,MACAjH,EAAApwL,UAAAs3L,WAAA,SAAAxwE,GACA,OAAA,GAAA7+I,KAAAovN,MAAAvwE,IAGAspE,EAAApwL,UAAAs3L,WAAA,SAAAxwE,GACA,IAAA1lE,EAAA0lE,EACAz2G,EAAA,EAiBA,OAhBA+wC,GAAA,OACA/wC,GAAA,GACA+wC,KAAA,IAEAA,GAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEAA,GAAA,IACA/wC,GAAA,EACA+wC,KAAA,GAEAA,GAAA,IACA/wC,GAAA,EACA+wC,KAAA,GAEA/wC,EAAA+wC,GAIAgvI,EAAApwL,UAAAu3L,UAAA,SAAAzwE,GAEA,GAAA,IAAAA,EAAA,OAAA,GAEA,IAAA1lE,EAAA0lE,EACAz2G,EAAA,EAoBA,OAnBA,IAAA,KAAA+wC,KACA/wC,GAAA,GACA+wC,KAAA,IAEA,IAAA,IAAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEA,IAAA,GAAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEA,IAAA,EAAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEA,IAAA,EAAAA,IACA/wC,IAEAA,GAIA+/K,EAAApwL,UAAAszK,UAAA,WACA,IAAAxsD,EAAAzkH,KAAAgzL,MAAAhzL,KAAA/6B,OAAA,GACAo+K,EAAArjJ,KAAAi1L,WAAAxwE,GACA,OAAA,IAAAzkH,KAAA/6B,OAAA,GAAAo+K,GAiBA0qC,EAAApwL,UAAAw3L,SAAA,WACA,GAAAn1L,KAAA6uL,SAAA,OAAA,EAGA,IADA,IAAA7gL,EAAA,EACA7mC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAmS,EAAA0mB,KAAAk1L,UAAAl1L,KAAAgzL,MAAA7rN,IAEA,GADA6mC,GAAA10B,EACA,KAAAA,EAAA,MAEA,OAAA00B,GAGA+/K,EAAApwL,UAAAygI,WAAA,WACA,OAAAx4J,KAAAwhL,KAAApnJ,KAAAixK,YAAA,IAGA8c,EAAApwL,UAAAy3L,OAAA,SAAAlnI,GACA,OAAA,IAAAluD,KAAA+yL,SACA/yL,KAAAm6J,MAAAk7B,MAAAnnI,GAAAonI,MAAA,GAEAt1L,KAAAq1B,SAGA04J,EAAApwL,UAAA43L,SAAA,SAAArnI,GACA,OAAAluD,KAAAw1L,MAAAtnI,EAAA,GACAluD,KAAAy1L,KAAAvnI,GAAAonI,MAAA,GAAAI,OAEA11L,KAAAq1B,SAGA04J,EAAApwL,UAAAg4L,MAAA,WACA,OAAA,IAAA31L,KAAA+yL,UAIAhF,EAAApwL,UAAAi4L,IAAA,WACA,OAAA51L,KAAAq1B,QAAAqgK,QAGA3H,EAAApwL,UAAA+3L,KAAA,WAKA,OAJA11L,KAAA6uL,WACA7uL,KAAA+yL,UAAA,GAGA/yL,MAIA+tL,EAAApwL,UAAAk4L,KAAA,SAAAnkL,GACA,KAAA1R,KAAA/6B,OAAAysC,EAAAzsC,QACA+6B,KAAAgzL,MAAAhzL,KAAA/6B,UAAA,EAGA,IAAA,IAAAkC,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAAAuqC,EAAAshL,MAAA7rN,GAGA,OAAA64B,KAAAsiM,UAGAvU,EAAApwL,UAAAm4L,IAAA,SAAApkL,GAEA,OADA7Y,EAAA,IAAAmH,KAAA+yL,SAAArhL,EAAAqhL,WACA/yL,KAAA61L,KAAAnkL,IAIAq8K,EAAApwL,UAAA+yB,GAAA,SAAAhf,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAAygK,IAAApkL,GACAA,EAAA2jB,QAAAygK,IAAA91L,OAGA+tL,EAAApwL,UAAAo4L,IAAA,SAAArkL,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAAwgK,KAAAnkL,GACAA,EAAA2jB,QAAAwgK,KAAA71L,OAIA+tL,EAAApwL,UAAAq4L,MAAA,SAAAtkL,GAEA,IAAAp4B,EAEAA,EADA0mB,KAAA/6B,OAAAysC,EAAAzsC,OACAysC,EAEA1R,KAGA,IAAA,IAAA74B,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAAAuqC,EAAAshL,MAAA7rN,GAKA,OAFA64B,KAAA/6B,OAAAqU,EAAArU,OAEA+6B,KAAAsiM,UAGAvU,EAAApwL,UAAAs4L,KAAA,SAAAvkL,GAEA,OADA7Y,EAAA,IAAAmH,KAAA+yL,SAAArhL,EAAAqhL,WACA/yL,KAAAg2L,MAAAtkL,IAIAq8K,EAAApwL,UAAA8yB,IAAA,SAAA/e,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA4gK,KAAAvkL,GACAA,EAAA2jB,QAAA4gK,KAAAj2L,OAGA+tL,EAAApwL,UAAAu4L,KAAA,SAAAxkL,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA2gK,MAAAtkL,GACAA,EAAA2jB,QAAA2gK,MAAAh2L,OAIA+tL,EAAApwL,UAAAw4L,MAAA,SAAAzkL,GAEA,IAAA7qC,EACAyS,EACA0mB,KAAA/6B,OAAAysC,EAAAzsC,QACA4B,EAAAm5B,KACA1mB,EAAAo4B,IAEA7qC,EAAA6qC,EACAp4B,EAAA0mB,MAGA,IAAA,IAAA74B,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAAAmS,EAAA05M,MAAA7rN,GAGA,GAAA64B,OAAAn5B,EACA,KAAAM,EAAAN,EAAA5B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAMA,OAFA64B,KAAA/6B,OAAA4B,EAAA5B,OAEA+6B,KAAAsiM,UAGAvU,EAAApwL,UAAAy4L,KAAA,SAAA1kL,GAEA,OADA7Y,EAAA,IAAAmH,KAAA+yL,SAAArhL,EAAAqhL,WACA/yL,KAAAm2L,MAAAzkL,IAIAq8K,EAAApwL,UAAAosK,IAAA,SAAAr4J,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA+gK,KAAA1kL,GACAA,EAAA2jB,QAAA+gK,KAAAp2L,OAGA+tL,EAAApwL,UAAA04L,KAAA,SAAA3kL,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA8gK,MAAAzkL,GACAA,EAAA2jB,QAAA8gK,MAAAn2L,OAIA+tL,EAAApwL,UAAA03L,MAAA,SAAAnnI,GACAr1D,EAAA,iBAAAq1D,GAAAA,GAAA,GAEA,IAAAooI,EAAA,EAAA1wN,KAAAwhL,KAAAl5F,EAAA,IACAqoI,EAAAroI,EAAA,GAGAluD,KAAA+zL,QAAAuC,GAEAC,EAAA,GACAD,IAIA,IAAA,IAAAnvN,EAAA,EAAAA,EAAAmvN,EAAAnvN,IACA64B,KAAAgzL,MAAA7rN,GAAA,UAAA64B,KAAAgzL,MAAA7rN,GASA,OALAovN,EAAA,IACAv2L,KAAAgzL,MAAA7rN,IAAA64B,KAAAgzL,MAAA7rN,GAAA,UAAA,GAAAovN,GAIAv2L,KAAAsiM,UAGAvU,EAAApwL,UAAA83L,KAAA,SAAAvnI,GACA,OAAAluD,KAAAq1B,QAAAggK,MAAAnnI,IAIA6/H,EAAApwL,UAAA64L,KAAA,SAAAC,EAAA98L,GACAd,EAAA,iBAAA49L,GAAAA,GAAA,GAEA,IAAAlhE,EAAAkhE,EAAA,GAAA,EACAC,EAAAD,EAAA,GAUA,OARAz2L,KAAA+zL,QAAAx+D,EAAA,GAGAv1H,KAAAgzL,MAAAz9D,GADA57H,EACAqG,KAAAgzL,MAAAz9D,GAAA,GAAAmhE,EAEA12L,KAAAgzL,MAAAz9D,KAAA,GAAAmhE,GAGA12L,KAAAsiM,UAIAvU,EAAApwL,UAAAyxL,KAAA,SAAA19K,GACA,IAAA1D,EAkBAnnC,EAAAyS,EAfA,GAAA,IAAA0mB,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAIA,OAHA/yL,KAAA+yL,SAAA,EACA/kL,EAAAhO,KAAAqvL,KAAA39K,GACA1R,KAAA+yL,UAAA,EACA/yL,KAAAg0L,YAGA,GAAA,IAAAh0L,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAIA,OAHArhL,EAAAqhL,SAAA,EACA/kL,EAAAhO,KAAAqvL,KAAA39K,GACAA,EAAAqhL,SAAA,EACA/kL,EAAAgmL,YAKAh0L,KAAA/6B,OAAAysC,EAAAzsC,QACA4B,EAAAm5B,KACA1mB,EAAAo4B,IAEA7qC,EAAA6qC,EACAp4B,EAAA0mB,MAIA,IADA,IAAA69H,EAAA,EACA12J,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IACA6mC,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,KAAA,EAAAmS,EAAA05M,MAAA7rN,IAAA02J,EACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EACA6vH,EAAA7vH,IAAA,GAEA,KAAA,IAAA6vH,GAAA12J,EAAAN,EAAA5B,OAAAkC,IACA6mC,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,IAAA02J,EACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EACA6vH,EAAA7vH,IAAA,GAIA,GADAhO,KAAA/6B,OAAA4B,EAAA5B,OACA,IAAA44J,EACA79H,KAAAgzL,MAAAhzL,KAAA/6B,QAAA44J,EACA79H,KAAA/6B,cAEA,GAAA4B,IAAAm5B,KACA,KAAA74B,EAAAN,EAAA5B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAIA,OAAA64B,MAIA+tL,EAAApwL,UAAA3e,IAAA,SAAA0yB,GACA,IAAA3lC,EACA,OAAA,IAAA2lC,EAAAqhL,UAAA,IAAA/yL,KAAA+yL,UACArhL,EAAAqhL,SAAA,EACAhnN,EAAAi0B,KAAAsxB,IAAA5f,GACAA,EAAAqhL,UAAA,EACAhnN,GACA,IAAA2lC,EAAAqhL,UAAA,IAAA/yL,KAAA+yL,UACA/yL,KAAA+yL,SAAA,EACAhnN,EAAA2lC,EAAA4f,IAAAtxB,MACAA,KAAA+yL,SAAA,EACAhnN,GAGAi0B,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA+5J,KAAA19K,GAEAA,EAAA2jB,QAAA+5J,KAAApvL,OAIA+tL,EAAApwL,UAAA0xL,KAAA,SAAA39K,GAEA,GAAA,IAAAA,EAAAqhL,SAAA,CACArhL,EAAAqhL,SAAA,EACA,IAAA/kL,EAAAhO,KAAAovL,KAAA19K,GAEA,OADAA,EAAAqhL,SAAA,EACA/kL,EAAAgmL,YAGA,GAAA,IAAAh0L,KAAA+yL,SAIA,OAHA/yL,KAAA+yL,SAAA,EACA/yL,KAAAovL,KAAA19K,GACA1R,KAAA+yL,SAAA,EACA/yL,KAAAg0L,YAIA,IAWAntN,EAAAyS,EAXA6tB,EAAAnH,KAAAmH,IAAAuK,GAGA,GAAA,IAAAvK,EAIA,OAHAnH,KAAA+yL,SAAA,EACA/yL,KAAA/6B,OAAA,EACA+6B,KAAAgzL,MAAA,GAAA,EACAhzL,KAKAmH,EAAA,GACAtgC,EAAAm5B,KACA1mB,EAAAo4B,IAEA7qC,EAAA6qC,EACAp4B,EAAA0mB,MAIA,IADA,IAAA69H,EAAA,EACA12J,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IAEA02J,GADA7vH,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,KAAA,EAAAmS,EAAA05M,MAAA7rN,IAAA02J,IACA,GACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EAEA,KAAA,IAAA6vH,GAAA12J,EAAAN,EAAA5B,OAAAkC,IAEA02J,GADA7vH,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,IAAA02J,IACA,GACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EAIA,GAAA,IAAA6vH,GAAA12J,EAAAN,EAAA5B,QAAA4B,IAAAm5B,KACA,KAAA74B,EAAAN,EAAA5B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAUA,OANA64B,KAAA/6B,OAAAW,KAAAD,IAAAq6B,KAAA/6B,OAAAkC,GAEAN,IAAAm5B,OACAA,KAAA+yL,SAAA,GAGA/yL,KAAAsiM,UAIAvU,EAAApwL,UAAA2zB,IAAA,SAAA5f,GACA,OAAA1R,KAAAq1B,QAAAg6J,KAAA39K,IA+CA,IAAAilL,EAAA,SAAAr3L,EAAAoS,EAAAqvB,GACA,IAIAuiH,EACA91I,EACA61I,EANAx8K,EAAAy4B,EAAA0zL,MACA15M,EAAAo4B,EAAAshL,MACA9iH,EAAAnvC,EAAAiyJ,MACAvmN,EAAA,EAIAmqN,EAAA,EAAA/vN,EAAA,GACAgwN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAlwN,EAAA,GACAmwN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAjzB,EAAA,EAAAj9L,EAAA,GACAqwN,EAAA,KAAApzB,EACAqzB,EAAArzB,IAAA,GACAszB,EAAA,EAAAvwN,EAAA,GACAwwN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAA1wN,EAAA,GACA2wN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAA7wN,EAAA,GACA8wN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAhxN,EAAA,GACAixN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAnxN,EAAA,GACAoxN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAtxN,EAAA,GACAuxN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAzxN,EAAA,GACA0xN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAzP,EAAA,EAAAvvM,EAAA,GACAm/M,EAAA,KAAA5P,EACA6P,EAAA7P,IAAA,GACAp6B,EAAA,EAAAn1K,EAAA,GACAq/M,EAAA,KAAAlqC,EACAmqC,EAAAnqC,IAAA,GACAJ,EAAA,EAAA/0K,EAAA,GACAu/M,EAAA,KAAAxqC,EACAyqC,EAAAzqC,IAAA,GACAy6B,EAAA,EAAAxvM,EAAA,GACAy/M,EAAA,KAAAjQ,EACAkQ,EAAAlQ,IAAA,GACAC,EAAA,EAAAzvM,EAAA,GACA2/M,EAAA,KAAAlQ,EACAmQ,GAAAnQ,IAAA,GACAC,GAAA,EAAA1vM,EAAA,GACA6/M,GAAA,KAAAnQ,GACAoQ,GAAApQ,KAAA,GACAC,GAAA,EAAA3vM,EAAA,GACA+/M,GAAA,KAAApQ,GACAqQ,GAAArQ,KAAA,GACAC,GAAA,EAAA5vM,EAAA,GACAigN,GAAA,KAAArQ,GACAsQ,GAAAtQ,KAAA,GACAC,GAAA,EAAA7vM,EAAA,GACAmgN,GAAA,KAAAtQ,GACAuQ,GAAAvQ,KAAA,GACAC,GAAA,EAAA9vM,EAAA,GACAqgN,GAAA,KAAAvQ,GACAwQ,GAAAxQ,KAAA,GAEAroJ,EAAAgyJ,SAAAzzL,EAAAyzL,SAAArhL,EAAAqhL,SACAhyJ,EAAA97D,OAAA,GAMA,IAAA40N,IAAAptN,GAJA62K,EAAA19K,KAAA2pN,KAAAsH,EAAA4B,IAIA,KAAA,MAFAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA6B,IACA9yN,KAAA2pN,KAAAuH,EAAA2B,GAAA,KAEA,IAAA,EACAhsN,IAFA42K,EAAAz9K,KAAA2pN,KAAAuH,EAAA4B,KAEAlrL,IAAA,IAAA,IAAAqsL,KAAA,IAAA,EACAA,IAAA,SAEAv2C,EAAA19K,KAAA2pN,KAAAyH,EAAAyB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA0B,IACA9yN,KAAA2pN,KAAA0H,EAAAwB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA0H,EAAAyB,GAKA,IAAAoB,IAAArtN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA8B,GAAA,GAIA,KAAA,MAFAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA+B,GAAA,GACAhzN,KAAA2pN,KAAAuH,EAAA6B,GAAA,KAEA,IAAA,EACAlsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA8B,GAAA,IAEAprL,IAAA,IAAA,IAAAssL,KAAA,IAAA,EACAA,IAAA,SAEAx2C,EAAA19K,KAAA2pN,KAAA2H,EAAAuB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAwB,IACA9yN,KAAA2pN,KAAA4H,EAAAsB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA4H,EAAAuB,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA2B,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA4B,GAAA,GACAhzN,KAAA2pN,KAAA0H,EAAA0B,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA2B,GAAA,EAKA,IAAAzV,IAAA12M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAgC,GAAA,GAIA,KAAA,MAFArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAiC,GAAA,GACAlzN,KAAA2pN,KAAAuH,EAAA+B,GAAA,KAEA,IAAA,EACApsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAgC,GAAA,IAEAtrL,IAAA,IAAA,IAAA21K,KAAA,IAAA,EACAA,IAAA,SAEA7/B,EAAA19K,KAAA2pN,KAAA8H,EAAAoB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAqB,IACA9yN,KAAA2pN,KAAA+H,EAAAmB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA+H,EAAAoB,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAyB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA0B,GAAA,GACAhzN,KAAA2pN,KAAA4H,EAAAwB,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAyB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA6B,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA8B,GAAA,GACAlzN,KAAA2pN,KAAA0H,EAAA4B,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA6B,GAAA,EAKA,IAAAiB,IAAAttN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAkC,GAAA,GAIA,KAAA,MAFAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAmC,GAAA,GACApzN,KAAA2pN,KAAAuH,EAAAiC,GAAA,KAEA,IAAA,EACAtsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAkC,GAAA,IAEAxrL,IAAA,IAAA,IAAAusL,KAAA,IAAA,EACAA,IAAA,SAEAz2C,EAAA19K,KAAA2pN,KAAAiI,EAAAiB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAkB,IACA9yN,KAAA2pN,KAAAkI,EAAAgB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAkI,EAAAiB,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAsB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAuB,GAAA,GACAhzN,KAAA2pN,KAAA+H,EAAAqB,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAsB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAA2B,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA4B,GAAA,GACAlzN,KAAA2pN,KAAA4H,EAAA0B,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAA2B,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA+B,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAgC,GAAA,GACApzN,KAAA2pN,KAAA0H,EAAA8B,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA+B,GAAA,EAKA,IAAAgB,IAAAvtN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAoC,GAAA,GAIA,KAAA,MAFAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAqC,IAAA,GACAtzN,KAAA2pN,KAAAuH,EAAAmC,GAAA,KAEA,IAAA,EACAxsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAoC,IAAA,IAEA1rL,IAAA,IAAA,IAAAwsL,KAAA,IAAA,EACAA,IAAA,SAEA12C,EAAA19K,KAAA2pN,KAAAoI,EAAAc,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAe,IACA9yN,KAAA2pN,KAAAqI,EAAAa,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAqI,EAAAc,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAmB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAoB,GAAA,GACAhzN,KAAA2pN,KAAAkI,EAAAkB,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAmB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAwB,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAyB,GAAA,GACAlzN,KAAA2pN,KAAA+H,EAAAuB,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAwB,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAA6B,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA8B,GAAA,GACApzN,KAAA2pN,KAAA4H,EAAA4B,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAA6B,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAiC,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAkC,IAAA,GACAtzN,KAAA2pN,KAAA0H,EAAAgC,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAiC,IAAA,EAKA,IAAAe,IAAAxtN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAsC,IAAA,GAIA,KAAA,MAFA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAuC,IAAA,GACAxzN,KAAA2pN,KAAAuH,EAAAqC,IAAA,KAEA,IAAA,EACA1sN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAsC,IAAA,IAEA5rL,IAAA,IAAA,IAAAysL,KAAA,IAAA,EACAA,IAAA,SAEA32C,EAAA19K,KAAA2pN,KAAAuI,EAAAW,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAY,IACA9yN,KAAA2pN,KAAAwI,EAAAU,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAwI,EAAAW,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAgB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAiB,GAAA,GACAhzN,KAAA2pN,KAAAqI,EAAAe,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAgB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAqB,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAsB,GAAA,GACAlzN,KAAA2pN,KAAAkI,EAAAoB,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAqB,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAA0B,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAA2B,GAAA,GACApzN,KAAA2pN,KAAA+H,EAAAyB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAA0B,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAA+B,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAgC,IAAA,GACAtzN,KAAA2pN,KAAA4H,EAAA8B,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAA+B,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAmC,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAoC,IAAA,GACAxzN,KAAA2pN,KAAA0H,EAAAkC,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAmC,IAAA,EAKA,IAAAc,IAAAztN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAwC,IAAA,GAIA,KAAA,MAFA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAyC,IAAA,GACA1zN,KAAA2pN,KAAAuH,EAAAuC,IAAA,KAEA,IAAA,EACA5sN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAwC,IAAA,IAEA9rL,IAAA,IAAA,IAAA0sL,KAAA,IAAA,EACAA,IAAA,SAEA52C,EAAA19K,KAAA2pN,KAAA0I,EAAAQ,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAS,IACA9yN,KAAA2pN,KAAA2I,EAAAO,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA2I,EAAAQ,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAa,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAc,GAAA,GACAhzN,KAAA2pN,KAAAwI,EAAAY,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAa,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAkB,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAmB,GAAA,GACAlzN,KAAA2pN,KAAAqI,EAAAiB,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAkB,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAuB,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAwB,GAAA,GACApzN,KAAA2pN,KAAAkI,EAAAsB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAuB,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAA4B,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAA6B,IAAA,GACAtzN,KAAA2pN,KAAA+H,EAAA2B,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAA4B,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAiC,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAkC,IAAA,GACAxzN,KAAA2pN,KAAA4H,EAAAgC,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAiC,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAqC,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAsC,IAAA,GACA1zN,KAAA2pN,KAAA0H,EAAAoC,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAqC,IAAA,EAKA,IAAAlW,IAAA32M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA0C,IAAA,GAIA,KAAA,MAFA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA2C,IAAA,GACA5zN,KAAA2pN,KAAAuH,EAAAyC,IAAA,KAEA,IAAA,EACA9sN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA0C,IAAA,IAEAhsL,IAAA,IAAA,IAAA41K,KAAA,IAAA,EACAA,IAAA,SAEA9/B,EAAA19K,KAAA2pN,KAAA6I,EAAAK,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAM,IACA9yN,KAAA2pN,KAAA8I,EAAAI,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA8I,EAAAK,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAU,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAW,GAAA,GACAhzN,KAAA2pN,KAAA2I,EAAAS,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAU,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAe,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAgB,GAAA,GACAlzN,KAAA2pN,KAAAwI,EAAAc,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAe,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAoB,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAqB,GAAA,GACApzN,KAAA2pN,KAAAqI,EAAAmB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAoB,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAyB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAA0B,IAAA,GACAtzN,KAAA2pN,KAAAkI,EAAAwB,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAyB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAA8B,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAA+B,IAAA,GACAxzN,KAAA2pN,KAAA+H,EAAA6B,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAA8B,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAmC,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAoC,IAAA,GACA1zN,KAAA2pN,KAAA4H,EAAAkC,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAmC,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAuC,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAwC,IAAA,GACA5zN,KAAA2pN,KAAA0H,EAAAsC,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAuC,IAAA,EAKA,IAAAW,IAAA1tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA4C,IAAA,GAIA,KAAA,MAFAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA6C,IAAA,GACA9zN,KAAA2pN,KAAAuH,EAAA2C,IAAA,KAEA,IAAA,EACAhtN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA4C,IAAA,IAEAlsL,IAAA,IAAA,IAAA2sL,KAAA,IAAA,EACAA,IAAA,SAEA72C,EAAA19K,KAAA2pN,KAAAgJ,EAAAE,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAG,IACA9yN,KAAA2pN,KAAAiJ,EAAAC,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAE,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAO,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAQ,GAAA,GACAhzN,KAAA2pN,KAAA8I,EAAAM,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAO,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAY,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAa,GAAA,GACAlzN,KAAA2pN,KAAA2I,EAAAW,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAY,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAiB,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAkB,GAAA,GACApzN,KAAA2pN,KAAAwI,EAAAgB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAiB,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAsB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAuB,IAAA,GACAtzN,KAAA2pN,KAAAqI,EAAAqB,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAsB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAA2B,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAA4B,IAAA,GACAxzN,KAAA2pN,KAAAkI,EAAA0B,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAA2B,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAgC,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAiC,IAAA,GACA1zN,KAAA2pN,KAAA+H,EAAA+B,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAgC,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAqC,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAsC,IAAA,GACA5zN,KAAA2pN,KAAA4H,EAAAoC,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAqC,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAyC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA0C,IAAA,GACA9zN,KAAA2pN,KAAA0H,EAAAwC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAyC,IAAA,EAKA,IAAAU,IAAA3tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA8C,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA+C,IAAA,GACAh0N,KAAA2pN,KAAAuH,EAAA6C,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA8C,IAAA,IAEApsL,IAAA,IAAA,IAAA4sL,KAAA,IAAA,EACAA,IAAA,SAEA92C,EAAA19K,KAAA2pN,KAAAgJ,EAAAI,GAEAnrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAK,IACAhzN,KAAA2pN,KAAAiJ,EAAAG,GAAA,EACAt1C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAI,GACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAS,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAU,GAAA,GACAlzN,KAAA2pN,KAAA8I,EAAAQ,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAS,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAc,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAe,GAAA,GACApzN,KAAA2pN,KAAA2I,EAAAa,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAc,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAmB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAoB,IAAA,GACAtzN,KAAA2pN,KAAAwI,EAAAkB,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAmB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAwB,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAyB,IAAA,GACAxzN,KAAA2pN,KAAAqI,EAAAuB,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAwB,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAA6B,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAA8B,IAAA,GACA1zN,KAAA2pN,KAAAkI,EAAA4B,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAA6B,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAkC,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAmC,IAAA,GACA5zN,KAAA2pN,KAAA+H,EAAAiC,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAkC,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAuC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAwC,IAAA,GACA9zN,KAAA2pN,KAAA4H,EAAAsC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAuC,IAAA,EAKA,IAAAW,IAAA5tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA2C,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA4C,IAAA,GACAh0N,KAAA2pN,KAAA0H,EAAA0C,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA2C,IAAA,IAEApsL,IAAA,IAAA,IAAA6sL,KAAA,IAAA,EACAA,IAAA,SAEA/2C,EAAA19K,KAAA2pN,KAAAgJ,EAAAM,GAEArrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAO,IACAlzN,KAAA2pN,KAAAiJ,EAAAK,GAAA,EACAx1C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAM,GACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAW,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAY,GAAA,GACApzN,KAAA2pN,KAAA8I,EAAAU,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAW,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAgB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAiB,IAAA,GACAtzN,KAAA2pN,KAAA2I,EAAAe,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAgB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAqB,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAsB,IAAA,GACAxzN,KAAA2pN,KAAAwI,EAAAoB,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAqB,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAA0B,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAA2B,IAAA,GACA1zN,KAAA2pN,KAAAqI,EAAAyB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAA0B,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAA+B,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAgC,IAAA,GACA5zN,KAAA2pN,KAAAkI,EAAA8B,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAA+B,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAoC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAqC,IAAA,GACA9zN,KAAA2pN,KAAA+H,EAAAmC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAoC,IAAA,EAKA,IAAAY,IAAA7tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAyC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA0C,IAAA,GACAh0N,KAAA2pN,KAAA4H,EAAAwC,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAyC,IAAA,IAEApsL,IAAA,IAAA,IAAA8sL,KAAA,IAAA,EACAA,IAAA,SAEAh3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAQ,GAEAvrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAS,IACApzN,KAAA2pN,KAAAiJ,EAAAO,GAAA,EACA11C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAQ,GACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAa,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAc,IAAA,GACAtzN,KAAA2pN,KAAA8I,EAAAY,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAa,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAkB,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAmB,IAAA,GACAxzN,KAAA2pN,KAAA2I,EAAAiB,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAkB,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAuB,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAwB,IAAA,GACA1zN,KAAA2pN,KAAAwI,EAAAsB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAuB,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAA4B,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAA6B,IAAA,GACA5zN,KAAA2pN,KAAAqI,EAAA2B,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAA4B,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAiC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAkC,IAAA,GACA9zN,KAAA2pN,KAAAkI,EAAAgC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAiC,IAAA,EAKA,IAAAa,IAAA9tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAsC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAuC,IAAA,GACAh0N,KAAA2pN,KAAA+H,EAAAqC,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAsC,IAAA,IAEApsL,IAAA,IAAA,IAAA+sL,KAAA,IAAA,EACAA,IAAA,SAEAj3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAU,GAEAzrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAW,KACAtzN,KAAA2pN,KAAAiJ,EAAAS,GAAA,EACA51C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAU,IACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAe,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAgB,IAAA,GACAxzN,KAAA2pN,KAAA8I,EAAAc,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAe,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAoB,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAqB,IAAA,GACA1zN,KAAA2pN,KAAA2I,EAAAmB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAoB,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAyB,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAA0B,IAAA,GACA5zN,KAAA2pN,KAAAwI,EAAAwB,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAyB,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAA8B,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAA+B,IAAA,GACA9zN,KAAA2pN,KAAAqI,EAAA6B,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAA8B,IAAA,EAKA,IAAAc,IAAA/tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAmC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAoC,IAAA,GACAh0N,KAAA2pN,KAAAkI,EAAAkC,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAmC,IAAA,IAEApsL,IAAA,IAAA,IAAAgtL,KAAA,IAAA,EACAA,IAAA,SAEAl3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAY,IAEA3rL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAa,KACAxzN,KAAA2pN,KAAAiJ,EAAAW,IAAA,EACA91C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAY,IACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAiB,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAkB,IAAA,GACA1zN,KAAA2pN,KAAA8I,EAAAgB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAiB,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAsB,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAuB,IAAA,GACA5zN,KAAA2pN,KAAA2I,EAAAqB,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAsB,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAA2B,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAA4B,IAAA,GACA9zN,KAAA2pN,KAAAwI,EAAA0B,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAA2B,IAAA,EAKA,IAAAe,IAAAhuN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAgC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAiC,IAAA,GACAh0N,KAAA2pN,KAAAqI,EAAA+B,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAgC,IAAA,IAEApsL,IAAA,IAAA,IAAAitL,KAAA,IAAA,EACAA,IAAA,SAEAn3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAc,IAEA7rL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAe,KACA1zN,KAAA2pN,KAAAiJ,EAAAa,IAAA,EACAh2C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAc,IACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAmB,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAoB,IAAA,GACA5zN,KAAA2pN,KAAA8I,EAAAkB,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAmB,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAwB,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAyB,IAAA,GACA9zN,KAAA2pN,KAAA2I,EAAAuB,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAwB,IAAA,EAKA,IAAArW,IAAA52M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAA6B,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAA8B,IAAA,GACAh0N,KAAA2pN,KAAAwI,EAAA4B,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAA6B,IAAA,IAEApsL,IAAA,IAAA,IAAA61K,KAAA,IAAA,EACAA,IAAA,SAEA//B,EAAA19K,KAAA2pN,KAAAgJ,EAAAgB,IAEA/rL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAiB,KACA5zN,KAAA2pN,KAAAiJ,EAAAe,IAAA,EACAl2C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAgB,IACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAqB,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAsB,IAAA,GACA9zN,KAAA2pN,KAAA8I,EAAAoB,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAqB,IAAA,EAKA,IAAApW,IAAA72M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAA0B,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAA2B,IAAA,GACAh0N,KAAA2pN,KAAA2I,EAAAyB,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAA0B,IAAA,IAEApsL,IAAA,IAAA,IAAA81K,KAAA,IAAA,EACAA,IAAA,SAEAhgC,EAAA19K,KAAA2pN,KAAAgJ,EAAAkB,IAEAjsL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAmB,KACA9zN,KAAA2pN,KAAAiJ,EAAAiB,IAAA,EACAp2C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAkB,IAKA,IAAAgB,IAAAjuN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAuB,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAwB,IAAA,GACAh0N,KAAA2pN,KAAA8I,EAAAsB,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAuB,IAAA,IAEApsL,IAAA,IAAA,IAAAktL,KAAA,IAAA,EACAA,IAAA,SAMA,IAAAC,IAAAluN,GAJA62K,EAAA19K,KAAA2pN,KAAAgJ,EAAAoB,KAIA,KAAA,MAFAnsL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAqB,KACAh0N,KAAA2pN,KAAAiJ,EAAAmB,IAAA,KAEA,IAAA,EA0BA,OAzBAltN,IAFA42K,EAAAz9K,KAAA2pN,KAAAiJ,EAAAoB,MAEApsL,IAAA,IAAA,IAAAmtL,KAAA,IAAA,EACAA,IAAA,SACAzqH,EAAA,GAAA2pH,GACA3pH,EAAA,GAAA4pH,GACA5pH,EAAA,GAAAizG,GACAjzG,EAAA,GAAA6pH,GACA7pH,EAAA,GAAA8pH,GACA9pH,EAAA,GAAA+pH,GACA/pH,EAAA,GAAAgqH,GACAhqH,EAAA,GAAAkzG,GACAlzG,EAAA,GAAAiqH,GACAjqH,EAAA,GAAAkqH,GACAlqH,EAAA,IAAAmqH,GACAnqH,EAAA,IAAAoqH,GACApqH,EAAA,IAAAqqH,GACArqH,EAAA,IAAAsqH,GACAtqH,EAAA,IAAAuqH,GACAvqH,EAAA,IAAAmzG,GACAnzG,EAAA,IAAAozG,GACApzG,EAAA,IAAAwqH,GACAxqH,EAAA,IAAAyqH,GACA,IAAAluN,IACAyjG,EAAA,IAAAzjG,EACAs0D,EAAA97D,UAEA87D,GAQA,SAAAi6J,EAAA17L,EAAAoS,EAAAqvB,GACAA,EAAAgyJ,SAAArhL,EAAAqhL,SAAAzzL,EAAAyzL,SACAhyJ,EAAA97D,OAAAq6B,EAAAr6B,OAAAysC,EAAAzsC,OAIA,IAFA,IAAA44J,EAAA,EACAk9D,EAAA,EACA1mS,EAAA,EAAAA,EAAA0sI,EAAA97D,OAAA,EAAA5wE,IAAA,CAGA,IAAAggS,EAAA0G,EACAA,EAAA,EAGA,IAFA,IAAAzG,EAAA,SAAAz2D,EACA02D,EAAA3uN,KAAAq0B,IAAA5lG,EAAAq9G,EAAAzsC,OAAA,GACAqsB,EAAA1rB,KAAAD,IAAA,EAAAtxE,EAAAirG,EAAAr6B,OAAA,GAAAqsB,GAAAijM,EAAAjjM,IAAA,CACA,IAAAnqB,EAAA9yE,EAAAi9F,EAGA0c,GAFA,EAAA1O,EAAA0zL,MAAA7rN,KACA,EAAAuqC,EAAAshL,MAAA1hM,IAGAgyJ,EAAA,SAAAt1I,EAGAsmL,EAAA,UADAhxC,EAAAA,EAAAgxC,EAAA,GAIAyG,IAFA1G,GAHAA,EAAAA,GAAArmL,EAAA,SAAA,GAAA,IAGAs1I,IAAA,IAAA,KAEA,GACA+wC,GAAA,SAEAtzJ,EAAAiyJ,MAAA3+R,GAAAigS,EACAz2D,EAAAw2D,EACAA,EAAA0G,EAQA,OANA,IAAAl9D,EACA98F,EAAAiyJ,MAAA3+R,GAAAwpO,EAEA98F,EAAA97D,SAGA87D,EAAAuhK,SAGA,SAAA1H,EAAAt7L,EAAAoS,EAAAqvB,GAIA,OAAAi6J,EAAA17L,EAAAoS,EAAAqvB,GAsBA,SAAA85J,EAAAjtL,EAAAC,GACA7N,KAAA4N,EAAAA,EACA5N,KAAA6N,EAAAA,EAzEAjoC,KAAA2pN,OACAoH,EAAAvC,GAmDArG,EAAApwL,UAAA47K,MAAA,SAAA7nK,EAAAqvB,GACA,IACA39B,EAAApD,KAAA/6B,OAAAysC,EAAAzsC,OAWA,OAVA,KAAA+6B,KAAA/6B,QAAA,KAAAysC,EAAAzsC,OACA0xN,EAAA32L,KAAA0R,EAAAqvB,GACA39B,EAAA,GACAgxL,EAAAp0L,KAAA0R,EAAAqvB,GACA39B,EAAA,KACA43L,EAAAh7L,KAAA0R,EAAAqvB,GAEA65J,EAAA56L,KAAA0R,EAAAqvB,IAcA85J,EAAAl9L,UAAAs9L,QAAA,SAAA12E,GAGA,IAFA,IAAAxlE,EAAA,IAAAlhD,MAAA0mH,GACAx7H,EAAAglM,EAAApwL,UAAAs3L,WAAA1wE,GAAA,EACAp9I,EAAA,EAAAA,EAAAo9I,EAAAp9I,IACA43E,EAAA53E,GAAA64B,KAAAk7L,OAAA/zN,EAAA4hB,EAAAw7H,GAGA,OAAAxlE,GAIA87I,EAAAl9L,UAAAu9L,OAAA,SAAAttL,EAAA7kB,EAAAw7H,GACA,GAAA,IAAA32G,GAAAA,IAAA22G,EAAA,EAAA,OAAA32G,EAGA,IADA,IAAAutL,EAAA,EACAh0N,EAAA,EAAAA,EAAA4hB,EAAA5hB,IACAg0N,IAAA,EAAAvtL,IAAA7kB,EAAA5hB,EAAA,EACAymC,IAAA,EAGA,OAAAutL,GAKAN,EAAAl9L,UAAAy9L,QAAA,SAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAl3E,GACA,IAAA,IAAAp9I,EAAA,EAAAA,EAAAo9I,EAAAp9I,IACAq0N,EAAAr0N,GAAAm0N,EAAAD,EAAAl0N,IACAs0N,EAAAt0N,GAAAo0N,EAAAF,EAAAl0N,KAIA0zN,EAAAl9L,UAAAxZ,UAAA,SAAAm3M,EAAAC,EAAAC,EAAAC,EAAAl3E,EAAA82E,GACAr7L,KAAAo7L,QAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAl3E,GAEA,IAAA,IAAAroI,EAAA,EAAAA,EAAAqoI,EAAAroI,IAAA,EAMA,IALA,IAAA6M,EAAA7M,GAAA,EAEAw/M,EAAA91N,KAAA+1N,IAAA,EAAA/1N,KAAAg2N,GAAA7yM,GACA8yM,EAAAj2N,KAAAk2N,IAAA,EAAAl2N,KAAAg2N,GAAA7yM,GAEA7hB,EAAA,EAAAA,EAAAq9I,EAAAr9I,GAAA6hB,EAIA,IAHA,IAAAgzM,EAAAL,EACAM,EAAAH,EAEAvqM,EAAA,EAAAA,EAAApV,EAAAoV,IAAA,CACA,IAAAk+G,EAAAgsF,EAAAt0N,EAAAoqB,GACA2qM,EAAAR,EAAAv0N,EAAAoqB,GAEA4qM,EAAAV,EAAAt0N,EAAAoqB,EAAApV,GACAigN,EAAAV,EAAAv0N,EAAAoqB,EAAApV,GAEAkgN,EAAAL,EAAAG,EAAAF,EAAAG,EAEAA,EAAAJ,EAAAI,EAAAH,EAAAE,EACAA,EAAAE,EAEAZ,EAAAt0N,EAAAoqB,GAAAk+G,EAAA0sF,EACAT,EAAAv0N,EAAAoqB,GAAA2qM,EAAAE,EAEAX,EAAAt0N,EAAAoqB,EAAApV,GAAAszH,EAAA0sF,EACAT,EAAAv0N,EAAAoqB,EAAApV,GAAA+/M,EAAAE,EAGA7qM,IAAAvI,IACAqzM,EAAAV,EAAAK,EAAAF,EAAAG,EAEAA,EAAAN,EAAAM,EAAAH,EAAAE,EACAA,EAAAK,KAOAvB,EAAAl9L,UAAA0+L,YAAA,SAAApoS,EAAAirF,GACA,IAAAqlI,EAAA,EAAA3+I,KAAAD,IAAAuZ,EAAAjrF,GACAqoS,EAAA,EAAA/3E,EACAp9I,EAAA,EACA,IAAAo9I,EAAAA,EAAA,EAAA,EAAAA,EAAAA,KAAA,EACAp9I,IAGA,OAAA,GAAAA,EAAA,EAAAm1N,GAGAzB,EAAAl9L,UAAA4+L,UAAA,SAAAjB,EAAAC,EAAAh3E,GACA,KAAAA,GAAA,GAEA,IAAA,IAAAp9I,EAAA,EAAAA,EAAAo9I,EAAA,EAAAp9I,IAAA,CACA,IAAA43E,EAAAu8I,EAAAn0N,GAEAm0N,EAAAn0N,GAAAm0N,EAAA/2E,EAAAp9I,EAAA,GACAm0N,EAAA/2E,EAAAp9I,EAAA,GAAA43E,EAEAA,EAAAw8I,EAAAp0N,GAEAo0N,EAAAp0N,IAAAo0N,EAAAh3E,EAAAp9I,EAAA,GACAo0N,EAAAh3E,EAAAp9I,EAAA,IAAA43E,IAIA87I,EAAAl9L,UAAA6+L,aAAA,SAAA9+C,EAAAn5B,GAEA,IADA,IAAAsZ,EAAA,EACA12J,EAAA,EAAAA,EAAAo9I,EAAA,EAAAp9I,IAAA,CACA,IAAAs9I,EAAA,KAAA7+I,KAAAuoC,MAAAuvI,EAAA,EAAAv2K,EAAA,GAAAo9I,GACA3+I,KAAAuoC,MAAAuvI,EAAA,EAAAv2K,GAAAo9I,GACAsZ,EAEA6f,EAAAv2K,GAAA,SAAAs9I,EAGAoZ,EADApZ,EAAA,SACA,EAEAA,EAAA,SAAA,EAIA,OAAAi5B,GAGAm9C,EAAAl9L,UAAA8+L,WAAA,SAAA/+C,EAAAt6I,EAAAk4L,EAAA/2E,GAEA,IADA,IAAAsZ,EAAA,EACA12J,EAAA,EAAAA,EAAAi8B,EAAAj8B,IACA02J,GAAA,EAAA6f,EAAAv2K,GAEAm0N,EAAA,EAAAn0N,GAAA,KAAA02J,EAAAA,KAAA,GACAy9D,EAAA,EAAAn0N,EAAA,GAAA,KAAA02J,EAAAA,KAAA,GAIA,IAAA12J,EAAA,EAAAi8B,EAAAj8B,EAAAo9I,IAAAp9I,EACAm0N,EAAAn0N,GAAA,EAGA0xB,EAAA,IAAAglI,GACAhlI,EAAA,KAAA,KAAAglI,KAGAg9D,EAAAl9L,UAAA++L,KAAA,SAAAn4E,GAEA,IADA,IAAAo4E,EAAA,IAAA9+L,MAAA0mH,GACAp9I,EAAA,EAAAA,EAAAo9I,EAAAp9I,IACAw1N,EAAAx1N,GAAA,EAGA,OAAAw1N,GAGA9B,EAAAl9L,UAAAm9L,KAAA,SAAAltL,EAAAC,EAAAkzB,GACA,IAAAwjF,EAAA,EAAAvkH,KAAAq8L,YAAAzuL,EAAA3oC,OAAA4oC,EAAA5oC,QAEAo2N,EAAAr7L,KAAAi7L,QAAA12E,GAEAppI,EAAA6kB,KAAA08L,KAAAn4E,GAEA+2E,EAAA,IAAAz9L,MAAA0mH,GACAq4E,EAAA,IAAA/+L,MAAA0mH,GACAs4E,EAAA,IAAAh/L,MAAA0mH,GAEAu4E,EAAA,IAAAj/L,MAAA0mH,GACAw4E,EAAA,IAAAl/L,MAAA0mH,GACAy4E,EAAA,IAAAn/L,MAAA0mH,GAEA04E,EAAAl8J,EAAAiyJ,MACAiK,EAAAh4N,OAAAs/I,EAEAvkH,KAAAy8L,WAAA7uL,EAAAolL,MAAAplL,EAAA3oC,OAAAq2N,EAAA/2E,GACAvkH,KAAAy8L,WAAA5uL,EAAAmlL,MAAAnlL,EAAA5oC,OAAA63N,EAAAv4E,GAEAvkH,KAAA7b,UAAAm3M,EAAAngN,EAAAyhN,EAAAC,EAAAt4E,EAAA82E,GACAr7L,KAAA7b,UAAA24M,EAAA3hN,EAAA4hN,EAAAC,EAAAz4E,EAAA82E,GAEA,IAAA,IAAAl0N,EAAA,EAAAA,EAAAo9I,EAAAp9I,IAAA,CACA,IAAAi1N,EAAAQ,EAAAz1N,GAAA41N,EAAA51N,GAAA01N,EAAA11N,GAAA61N,EAAA71N,GACA01N,EAAA11N,GAAAy1N,EAAAz1N,GAAA61N,EAAA71N,GAAA01N,EAAA11N,GAAA41N,EAAA51N,GACAy1N,EAAAz1N,GAAAi1N,EAUA,OAPAp8L,KAAAu8L,UAAAK,EAAAC,EAAAt4E,GACAvkH,KAAA7b,UAAAy4M,EAAAC,EAAAI,EAAA9hN,EAAAopI,EAAA82E,GACAr7L,KAAAu8L,UAAAU,EAAA9hN,EAAAopI,GACAvkH,KAAAw8L,aAAAS,EAAA14E,GAEAxjF,EAAAgyJ,SAAAnlL,EAAAmlL,SAAAllL,EAAAklL,SACAhyJ,EAAA97D,OAAA2oC,EAAA3oC,OAAA4oC,EAAA5oC,OACA87D,EAAAuhK,UAIAvU,EAAApwL,UAAAiyL,IAAA,SAAAl+K,GACA,IAAAqvB,EAAA,IAAAgtJ,EAAA,MAEA,OADAhtJ,EAAAiyJ,MAAA,IAAAn1L,MAAAmC,KAAA/6B,OAAAysC,EAAAzsC,QACA+6B,KAAAu5K,MAAA7nK,EAAAqvB,IAIAgtJ,EAAApwL,UAAAu/L,KAAA,SAAAxrL,GACA,IAAAqvB,EAAA,IAAAgtJ,EAAA,MAEA,OADAhtJ,EAAAiyJ,MAAA,IAAAn1L,MAAAmC,KAAA/6B,OAAAysC,EAAAzsC,QACA21N,EAAA56L,KAAA0R,EAAAqvB,IAIAgtJ,EAAApwL,UAAA4xL,KAAA,SAAA79K,GACA,OAAA1R,KAAAq1B,QAAAkkJ,MAAA7nK,EAAA1R,OAGA+tL,EAAApwL,UAAAk2L,MAAA,SAAAniL,GACA,IAAAw6O,EAAAx6O,EAAA,EACAw6O,IAAAx6O,GAAAA,GAEA7Y,EAAA,iBAAA6Y,GACA7Y,EAAA6Y,EAAA,UAIA,IADA,IAAAmsH,EAAA,EACA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs9I,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,IAAAuqC,EACA4xI,GAAA,SAAA7+B,IAAA,SAAAoZ,GACAA,IAAA,GACAA,GAAApZ,EAAA,SAAA,EAEAoZ,GAAAylB,IAAA,GACAtjJ,KAAAgzL,MAAA7rN,GAAA,SAAAm8K,EAQA,OALA,IAAAzlB,IACA79H,KAAAgzL,MAAA7rN,GAAA02J,EACA79H,KAAA/6B,UAGAinR,EAAAlsP,KAAA01L,OAAA11L,MAGA+tL,EAAApwL,UAAAw/L,KAAA,SAAAzrL,GACA,OAAA1R,KAAAq1B,QAAAw+J,MAAAniL,IAIAq8K,EAAApwL,UAAAy/L,IAAA,WACA,OAAAp9L,KAAA4vL,IAAA5vL,OAIA+tL,EAAApwL,UAAA0/L,KAAA,WACA,OAAAr9L,KAAAuvL,KAAAvvL,KAAAq1B,UAIA04J,EAAApwL,UAAA0hI,IAAA,SAAA3tH,GACA,IAAA+yG,EA7xCA,SAAA/yG,GAGA,IAFA,IAAA+yG,EAAA,IAAA5mH,MAAA6T,EAAAu/J,aAEAwlB,EAAA,EAAAA,EAAAhyE,EAAAx/I,OAAAwxN,IAAA,CACA,IAAAlhE,EAAAkhE,EAAA,GAAA,EACAC,EAAAD,EAAA,GAEAhyE,EAAAgyE,GAAA/kL,EAAAshL,MAAAz9D,KAAAmhE,EAAA,EAGA,OAAAjyE,EAmxCA64E,CAAA5rL,GACA,GAAA,IAAA+yG,EAAAx/I,OAAA,OAAA,IAAA8oN,EAAA,GAIA,IADA,IAAAhiN,EAAAi0B,KACA74B,EAAA,EAAAA,EAAAs9I,EAAAx/I,QACA,IAAAw/I,EAAAt9I,GADAA,IAAA4E,EAAAA,EAAAqxN,OAIA,KAAAj2N,EAAAs9I,EAAAx/I,OACA,IAAA,IAAAqpC,EAAAviC,EAAAqxN,MAAAj2N,EAAAs9I,EAAAx/I,OAAAkC,IAAAmnC,EAAAA,EAAA8uL,MACA,IAAA34E,EAAAt9I,KAEA4E,EAAAA,EAAA6jN,IAAAthL,IAIA,OAAAviC,GAIAgiN,EAAApwL,UAAA4/L,OAAA,SAAAnjE,GACAvhI,EAAA,iBAAAuhI,GAAAA,GAAA,GACA,IAGAjzJ,EAHA6mC,EAAAosH,EAAA,GACAl+I,GAAAk+I,EAAApsH,GAAA,GACAwvL,EAAA,WAAA,GAAAxvL,GAAA,GAAAA,EAGA,GAAA,IAAAA,EAAA,CACA,IAAA6vH,EAAA,EAEA,IAAA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs2N,EAAAz9L,KAAAgzL,MAAA7rN,GAAAq2N,EACA/wN,GAAA,EAAAuzB,KAAAgzL,MAAA7rN,IAAAs2N,GAAAzvL,EACAhO,KAAAgzL,MAAA7rN,GAAAsF,EAAAoxJ,EACAA,EAAA4/D,IAAA,GAAAzvL,EAGA6vH,IACA79H,KAAAgzL,MAAA7rN,GAAA02J,EACA79H,KAAA/6B,UAIA,GAAA,IAAAiX,EAAA,CACA,IAAA/U,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IACA64B,KAAAgzL,MAAA7rN,EAAA+U,GAAA8jB,KAAAgzL,MAAA7rN,GAGA,IAAAA,EAAA,EAAAA,EAAA+U,EAAA/U,IACA64B,KAAAgzL,MAAA7rN,GAAA,EAGA64B,KAAA/6B,QAAAiX,EAGA,OAAA8jB,KAAAsiM,UAGAvU,EAAApwL,UAAA+/L,MAAA,SAAAtjE,GAGA,OADAvhI,EAAA,IAAAmH,KAAA+yL,UACA/yL,KAAAu9L,OAAAnjE,IAMA2zD,EAAApwL,UAAAg0L,OAAA,SAAAv3D,EAAAujE,EAAAC,GAEA,IAAAn2H,EADA5uE,EAAA,iBAAAuhI,GAAAA,GAAA,GAGA3yD,EADAk2H,GACAA,EAAAA,EAAA,IAAA,GAEA,EAGA,IAAA3vL,EAAAosH,EAAA,GACAl+I,EAAAtW,KAAAq0B,KAAAmgI,EAAApsH,GAAA,GAAAhO,KAAA/6B,QACA+5J,EAAA,SAAA,WAAAhxH,GAAAA,EACA6vL,EAAAD,EAMA,GAJAn2H,GAAAvrF,EACAurF,EAAA7hG,KAAAD,IAAA,EAAA8hG,GAGAo2H,EAAA,CACA,IAAA,IAAA12N,EAAA,EAAAA,EAAA+U,EAAA/U,IACA02N,EAAA7K,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAEA02N,EAAA54N,OAAAiX,EAGA,GAAA,IAAAA,QAEA,GAAA8jB,KAAA/6B,OAAAiX,EAEA,IADA8jB,KAAA/6B,QAAAiX,EACA/U,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,EAAA+U,QAGA8jB,KAAAgzL,MAAA,GAAA,EACAhzL,KAAA/6B,OAAA,EAGA,IAAA44J,EAAA,EACA,IAAA12J,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,IAAA,IAAA02J,GAAA12J,GAAAsgG,GAAAtgG,IAAA,CACA,IAAAq7C,EAAA,EAAAxiB,KAAAgzL,MAAA7rN,GACA64B,KAAAgzL,MAAA7rN,GAAA02J,GAAA,GAAA7vH,EAAAwU,IAAAxU,EACA6vH,EAAAr7G,EAAAw8G,EAaA,OATA6+D,GAAA,IAAAhgE,IACAggE,EAAA7K,MAAA6K,EAAA54N,UAAA44J,GAGA,IAAA79H,KAAA/6B,SACA+6B,KAAAgzL,MAAA,GAAA,EACAhzL,KAAA/6B,OAAA,GAGA+6B,KAAAsiM,UAGAvU,EAAApwL,UAAAmgM,MAAA,SAAA1jE,EAAAujE,EAAAC,GAGA,OADA/kM,EAAA,IAAAmH,KAAA+yL,UACA/yL,KAAA2xL,OAAAv3D,EAAAujE,EAAAC,IAIA7P,EAAApwL,UAAAogM,KAAA,SAAA3jE,GACA,OAAAp6H,KAAAq1B,QAAAqoK,MAAAtjE,IAGA2zD,EAAApwL,UAAAqgM,MAAA,SAAA5jE,GACA,OAAAp6H,KAAAq1B,QAAAkoK,OAAAnjE,IAIA2zD,EAAApwL,UAAAsgM,KAAA,SAAA7jE,GACA,OAAAp6H,KAAAq1B,QAAAyoK,MAAA1jE,IAGA2zD,EAAApwL,UAAAugM,MAAA,SAAA9jE,GACA,OAAAp6H,KAAAq1B,QAAAs8J,OAAAv3D,IAIA2zD,EAAApwL,UAAA63L,MAAA,SAAAiB,GACA59L,EAAA,iBAAA49L,GAAAA,GAAA,GACA,IAAAzoL,EAAAyoL,EAAA,GACAv6M,GAAAu6M,EAAAzoL,GAAA,GACAM,EAAA,GAAAN,EAGA,QAAAhO,KAAA/6B,QAAAiX,OAGA8jB,KAAAgzL,MAAA92M,GAEAoyB,IAIAy/K,EAAApwL,UAAAwgM,OAAA,SAAA/jE,GACAvhI,EAAA,iBAAAuhI,GAAAA,GAAA,GACA,IAAApsH,EAAAosH,EAAA,GACAl+I,GAAAk+I,EAAApsH,GAAA,GAIA,GAFAnV,EAAA,IAAAmH,KAAA+yL,SAAA,2CAEA/yL,KAAA/6B,QAAAiX,EACA,OAAA8jB,KAQA,GALA,IAAAgO,GACA9xB,IAEA8jB,KAAA/6B,OAAAW,KAAAq0B,IAAA/d,EAAA8jB,KAAA/6B,QAEA,IAAA+oC,EAAA,CACA,IAAAgxH,EAAA,SAAA,WAAAhxH,GAAAA,EACAhO,KAAAgzL,MAAAhzL,KAAA/6B,OAAA,IAAA+5J,EAGA,OAAAh/H,KAAAsiM,UAIAvU,EAAApwL,UAAAygM,MAAA,SAAAhkE,GACA,OAAAp6H,KAAAq1B,QAAA8oK,OAAA/jE,IAIA2zD,EAAApwL,UAAA23L,MAAA,SAAA5jL,GAGA,OAFA7Y,EAAA,iBAAA6Y,GACA7Y,EAAA6Y,EAAA,UACAA,EAAA,EAAA1R,KAAA0xL,OAAAhgL,GAGA,IAAA1R,KAAA+yL,SACA,IAAA/yL,KAAA/6B,SAAA,EAAA+6B,KAAAgzL,MAAA,KAAAthL,GACA1R,KAAAgzL,MAAA,GAAAthL,GAAA,EAAA1R,KAAAgzL,MAAA,IACAhzL,KAAA+yL,SAAA,EACA/yL,OAGAA,KAAA+yL,SAAA,EACA/yL,KAAA0xL,MAAAhgL,GACA1R,KAAA+yL,SAAA,EACA/yL,MAIAA,KAAA8zL,OAAApiL,IAGAq8K,EAAApwL,UAAAm2L,OAAA,SAAApiL,GACA1R,KAAAgzL,MAAA,IAAAthL,EAGA,IAAA,IAAAvqC,EAAA,EAAAA,EAAA64B,KAAA/6B,QAAA+6B,KAAAgzL,MAAA7rN,IAAA,SAAAA,IACA64B,KAAAgzL,MAAA7rN,IAAA,SACAA,IAAA64B,KAAA/6B,OAAA,EACA+6B,KAAAgzL,MAAA7rN,EAAA,GAAA,EAEA64B,KAAAgzL,MAAA7rN,EAAA,KAKA,OAFA64B,KAAA/6B,OAAAW,KAAAD,IAAAq6B,KAAA/6B,OAAAkC,EAAA,GAEA64B,MAIA+tL,EAAApwL,UAAA+zL,MAAA,SAAAhgL,GAGA,GAFA7Y,EAAA,iBAAA6Y,GACA7Y,EAAA6Y,EAAA,UACAA,EAAA,EAAA,OAAA1R,KAAAs1L,OAAA5jL,GAEA,GAAA,IAAA1R,KAAA+yL,SAIA,OAHA/yL,KAAA+yL,SAAA,EACA/yL,KAAAs1L,MAAA5jL,GACA1R,KAAA+yL,SAAA,EACA/yL,KAKA,GAFAA,KAAAgzL,MAAA,IAAAthL,EAEA,IAAA1R,KAAA/6B,QAAA+6B,KAAAgzL,MAAA,GAAA,EACAhzL,KAAAgzL,MAAA,IAAAhzL,KAAAgzL,MAAA,GACAhzL,KAAA+yL,SAAA,OAGA,IAAA,IAAA5rN,EAAA,EAAAA,EAAA64B,KAAA/6B,QAAA+6B,KAAAgzL,MAAA7rN,GAAA,EAAAA,IACA64B,KAAAgzL,MAAA7rN,IAAA,SACA64B,KAAAgzL,MAAA7rN,EAAA,IAAA,EAIA,OAAA64B,KAAAsiM,UAGAvU,EAAApwL,UAAA0gM,KAAA,SAAA3sL,GACA,OAAA1R,KAAAq1B,QAAAigK,MAAA5jL,IAGAq8K,EAAApwL,UAAA2gM,KAAA,SAAA5sL,GACA,OAAA1R,KAAAq1B,QAAAq8J,MAAAhgL,IAGAq8K,EAAApwL,UAAA4gM,KAAA,WAGA,OAFAv+L,KAAA+yL,SAAA,EAEA/yL,MAGA+tL,EAAApwL,UAAAw8J,IAAA,WACA,OAAAn6J,KAAAq1B,QAAAkpK,QAGAxQ,EAAApwL,UAAA6gM,aAAA,SAAA9sL,EAAAk+K,EAAAjrL,GACA,IACAx9B,EAIAs9I,EALArhH,EAAAsO,EAAAzsC,OAAA0/B,EAGA3E,KAAA+zL,QAAA3wL,GAGA,IAAAy6H,EAAA,EACA,IAAA12J,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IAAA,CACAs9I,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,EAAAw9B,IAAAk5H,EACA,IAAA10I,GAAA,EAAAuoB,EAAAshL,MAAA7rN,IAAAyoN,EAEA/xD,IADApZ,GAAA,SAAAt7H,IACA,KAAAA,EAAA,SAAA,GACA6W,KAAAgzL,MAAA7rN,EAAAw9B,GAAA,SAAA8/G,EAEA,KAAAt9I,EAAA64B,KAAA/6B,OAAA0/B,EAAAx9B,IAEA02J,GADApZ,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,EAAAw9B,IAAAk5H,IACA,GACA79H,KAAAgzL,MAAA7rN,EAAAw9B,GAAA,SAAA8/G,EAGA,GAAA,IAAAoZ,EAAA,OAAA79H,KAAAsiM,SAKA,IAFAzpM,GAAA,IAAAglI,GACAA,EAAA,EACA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAEA02J,GADApZ,IAAA,EAAAzkH,KAAAgzL,MAAA7rN,IAAA02J,IACA,GACA79H,KAAAgzL,MAAA7rN,GAAA,SAAAs9I,EAIA,OAFAzkH,KAAA+yL,SAAA,EAEA/yL,KAAAsiM,UAGAvU,EAAApwL,UAAA8gM,SAAA,SAAA/sL,EAAAh3B,GACA,IAAAiqB,GAAA3E,KAAA/6B,OAAAysC,EAAAzsC,QAEA4B,EAAAm5B,KAAAq1B,QACA/7C,EAAAo4B,EAGAgtL,EAAA,EAAAplN,EAAA05M,MAAA15M,EAAArU,OAAA,GAGA,KADA0/B,EAAA,GADA3E,KAAAi1L,WAAAyJ,MAGAplN,EAAAA,EAAA0kN,MAAAr5L,GACA99B,EAAA02N,OAAA54L,GACA+5L,EAAA,EAAAplN,EAAA05M,MAAA15M,EAAArU,OAAA,IAIA,IACAqpC,EADApvB,EAAArY,EAAA5B,OAAAqU,EAAArU,OAGA,GAAA,QAAAyV,EAAA,EACA4zB,EAAA,IAAAy/K,EAAA,OACA9oN,OAAAia,EAAA,EACAovB,EAAA0kL,MAAA,IAAAn1L,MAAAyQ,EAAArpC,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAAmnC,EAAArpC,OAAAkC,IACAmnC,EAAA0kL,MAAA7rN,GAAA,EAIA,IAAAunI,EAAA7nI,EAAAwuD,QAAAmpK,aAAAllN,EAAA,EAAA4F,GACA,IAAAwvH,EAAAqkF,WACAlsN,EAAA6nI,EACApgG,IACAA,EAAA0kL,MAAA9zM,GAAA,IAIA,IAAA,IAAAoS,EAAApS,EAAA,EAAAoS,GAAA,EAAAA,IAAA,CACA,IAAAqtM,EAAA,UAAA,EAAA93N,EAAAmsN,MAAA15M,EAAArU,OAAAqsB,KACA,EAAAzqB,EAAAmsN,MAAA15M,EAAArU,OAAAqsB,EAAA,IAOA,IAHAqtM,EAAA/4N,KAAAq0B,IAAA0kM,EAAAD,EAAA,EAAA,UAEA73N,EAAA23N,aAAAllN,EAAAqlN,EAAArtM,GACA,IAAAzqB,EAAAksN,UACA4L,IACA93N,EAAAksN,SAAA,EACAlsN,EAAA23N,aAAAllN,EAAA,EAAAgY,GACAzqB,EAAAgoN,WACAhoN,EAAAksN,UAAA,GAGAzkL,IACAA,EAAA0kL,MAAA1hM,GAAAqtM,GAaA,OAVArwL,GACAA,EAAAg0L,SAEAz7N,EAAAy7N,SAGA,QAAA5nN,GAAA,IAAAiqB,GACA99B,EAAA8qN,OAAAhtL,GAGA,CACA2uJ,IAAAhlJ,GAAA,KACAg0C,IAAAz7E,IAQAknN,EAAApwL,UAAAihM,OAAA,SAAAltL,EAAAh3B,EAAAmkN,GAGA,OAFAhmM,GAAA6Y,EAAAm9K,UAEA7uL,KAAA6uL,SACA,CACAv7B,IAAA,IAAAy6B,EAAA,GACAzrI,IAAA,IAAAyrI,EAAA,IAKA,IAAA/tL,KAAA+yL,UAAA,IAAArhL,EAAAqhL,UACAhnN,EAAAi0B,KAAA41L,MAAAgJ,OAAAltL,EAAAh3B,GAEA,QAAAA,IACA44K,EAAAvnL,EAAAunL,IAAAsiC,OAGA,QAAAl7M,IACA4nE,EAAAv2E,EAAAu2E,IAAAszI,MACAiJ,GAAA,IAAAv8I,EAAAywI,UACAzwI,EAAA8sI,KAAA19K,IAIA,CACA4hJ,IAAAA,EACAhxG,IAAAA,IAIA,IAAAtiD,KAAA+yL,UAAA,IAAArhL,EAAAqhL,UACAhnN,EAAAi0B,KAAA4+L,OAAAltL,EAAAkkL,MAAAl7M,GAEA,QAAAA,IACA44K,EAAAvnL,EAAAunL,IAAAsiC,OAGA,CACAtiC,IAAAA,EACAhxG,IAAAv2E,EAAAu2E,MAIA,IAAAtiD,KAAA+yL,SAAArhL,EAAAqhL,WACAhnN,EAAAi0B,KAAA41L,MAAAgJ,OAAAltL,EAAAkkL,MAAAl7M,GAEA,QAAAA,IACA4nE,EAAAv2E,EAAAu2E,IAAAszI,MACAiJ,GAAA,IAAAv8I,EAAAywI,UACAzwI,EAAA+sI,KAAA39K,IAIA,CACA4hJ,IAAAvnL,EAAAunL,IACAhxG,IAAAA,IAOA5wC,EAAAzsC,OAAA+6B,KAAA/6B,QAAA+6B,KAAAmH,IAAAuK,GAAA,EACA,CACA4hJ,IAAA,IAAAy6B,EAAA,GACAzrI,IAAAtiD,MAKA,IAAA0R,EAAAzsC,OACA,QAAAyV,EACA,CACA44K,IAAAtzJ,KAAA8+L,KAAAptL,EAAAshL,MAAA,IACA1wI,IAAA,MAIA,QAAA5nE,EACA,CACA44K,IAAA,KACAhxG,IAAA,IAAAyrI,EAAA/tL,KAAA8rP,MAAAp6O,EAAAshL,MAAA,MAIA,CACA1/B,IAAAtzJ,KAAA8+L,KAAAptL,EAAAshL,MAAA,IACA1wI,IAAA,IAAAyrI,EAAA/tL,KAAA8rP,MAAAp6O,EAAAshL,MAAA,MAIAhzL,KAAAy+L,SAAA/sL,EAAAh3B,GAlFA,IAAA44K,EAAAhxG,EAAAv2E,GAsFAgiN,EAAApwL,UAAA21J,IAAA,SAAA5hJ,GACA,OAAA1R,KAAA4+L,OAAAltL,EAAA,OAAA,GAAA4hJ,KAIAy6B,EAAApwL,UAAA2kD,IAAA,SAAA5wC,GACA,OAAA1R,KAAA4+L,OAAAltL,EAAA,OAAA,GAAA4wC,KAGAyrI,EAAApwL,UAAAuxL,KAAA,SAAAx9K,GACA,OAAA1R,KAAA4+L,OAAAltL,EAAA,OAAA,GAAA4wC,KAIAyrI,EAAApwL,UAAAohM,SAAA,SAAArtL,GACA,IAAAstL,EAAAh/L,KAAA4+L,OAAAltL,GAGA,GAAAstL,EAAA18I,IAAAusI,SAAA,OAAAmQ,EAAA1rC,IAEA,IAAAhxG,EAAA,IAAA08I,EAAA1rC,IAAAy/B,SAAAiM,EAAA18I,IAAA+sI,KAAA39K,GAAAstL,EAAA18I,IAEAklH,EAAA91J,EAAAwsL,MAAA,GACA9hC,EAAA1qJ,EAAA+/K,MAAA,GACAtqL,EAAAm7C,EAAAn7C,IAAAqgK,GAGA,OAAArgK,EAAA,GAAA,IAAAi1J,GAAA,IAAAj1J,EAAA63L,EAAA1rC,IAGA,IAAA0rC,EAAA1rC,IAAAy/B,SAAAiM,EAAA1rC,IAAAo+B,MAAA,GAAAsN,EAAA1rC,IAAAgiC,MAAA,IAGAvH,EAAApwL,UAAAmuP,MAAA,SAAAp6O,GACA,IAAAw6O,EAAAx6O,EAAA,EACAw6O,IAAAx6O,GAAAA,GAEA7Y,EAAA6Y,GAAA,UAIA,IAHA,IAAAxqC,GAAA,GAAA,IAAAwqC,EAEA2kI,EAAA,EACAlvK,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IACAkvK,GAAAnvK,EAAAmvK,GAAA,EAAAr2I,KAAAgzL,MAAA7rN,KAAAuqC,EAGA,OAAAw6O,GAAA71G,EAAAA,GAIA03C,EAAApwL,UAAA+2L,KAAA,SAAAhjL,GACA,OAAA1R,KAAA8rP,MAAAp6O,IAIAq8K,EAAApwL,UAAAg3L,MAAA,SAAAjjL,GACA,IAAAw6O,EAAAx6O,EAAA,EACAw6O,IAAAx6O,GAAAA,GAEA7Y,EAAA6Y,GAAA,UAGA,IADA,IAAAmsH,EAAA,EACA12J,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IAAA,CACA,IAAAs9I,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,IAAA,SAAA02J,EACA79H,KAAAgzL,MAAA7rN,GAAAs9I,EAAA/yG,EAAA,EACAmsH,EAAApZ,EAAA/yG,EAIA,OADA1R,KAAAsiM,SACA4pD,EAAAlsP,KAAA01L,OAAA11L,MAGA+tL,EAAApwL,UAAAmhM,KAAA,SAAAptL,GACA,OAAA1R,KAAAq1B,QAAAs/J,MAAAjjL,IAGAq8K,EAAApwL,UAAAshM,KAAA,SAAA/3N,GACA2xB,EAAA,IAAA3xB,EAAA6rN,UACAl6L,GAAA3xB,EAAA2nN,UAEA,IAAAjhL,EAAA5N,KACA6N,EAAA3mC,EAAAmuD,QAGAznB,EADA,IAAAA,EAAAmlL,SACAnlL,EAAAshL,KAAAhoN,GAEA0mC,EAAAynB,QAaA,IATA,IAAAivF,EAAA,IAAAypE,EAAA,GACA7qE,EAAA,IAAA6qE,EAAA,GAGAnpE,EAAA,IAAAmpE,EAAA,GACAnoE,EAAA,IAAAmoE,EAAA,GAEA3pE,EAAA,EAEAx2G,EAAAutK,UAAAttK,EAAAstK,UACAvtK,EAAA+jL,OAAA,GACA9jL,EAAA8jL,OAAA,KACAvtE,EAMA,IAHA,IAAA86E,EAAArxL,EAAAwnB,QACA+7I,EAAAxjK,EAAAynB,SAEAznB,EAAAihL,UAAA,CACA,IAAA,IAAA1nN,EAAA,EAAAg4N,EAAA,EAAA,IAAAvxL,EAAAolL,MAAA,GAAAmM,IAAAh4N,EAAA,KAAAA,EAAAg4N,IAAA,GACA,GAAAh4N,EAAA,EAEA,IADAymC,EAAA+jL,OAAAxqN,GACAA,KAAA,IACAm9I,EAAAiqE,SAAArrE,EAAAqrE,WACAjqE,EAAA8qE,KAAA8P,GACAh8E,EAAAmsE,KAAAje,IAGA9sD,EAAAqtE,OAAA,GACAzuE,EAAAyuE,OAAA,GAIA,IAAA,IAAArgM,EAAA,EAAA8tM,EAAA,EAAA,IAAAvxL,EAAAmlL,MAAA,GAAAoM,IAAA9tM,EAAA,KAAAA,EAAA8tM,IAAA,GACA,GAAA9tM,EAAA,EAEA,IADAuc,EAAA8jL,OAAArgM,GACAA,KAAA,IACAszH,EAAA2pE,SAAA3oE,EAAA2oE,WACA3pE,EAAAwqE,KAAA8P,GACAt5E,EAAAypE,KAAAje,IAGAxsD,EAAA+sE,OAAA,GACA/rE,EAAA+rE,OAAA,GAIA/jL,EAAAzG,IAAA0G,IAAA,GACAD,EAAAyhL,KAAAxhL,GACAy2G,EAAA+qE,KAAAzqE,GACA1B,EAAAmsE,KAAAzpE,KAEA/3G,EAAAwhL,KAAAzhL,GACAg3G,EAAAyqE,KAAA/qE,GACAsB,EAAAypE,KAAAnsE,IAIA,MAAA,CACAr8I,EAAA+9I,EACAtrI,EAAAssI,EACAurD,IAAAtjK,EAAA0vL,OAAAn5E,KAOA2pE,EAAApwL,UAAA0hM,OAAA,SAAAn4N,GACA2xB,EAAA,IAAA3xB,EAAA6rN,UACAl6L,GAAA3xB,EAAA2nN,UAEA,IAAAhoN,EAAAm5B,KACA1mB,EAAApS,EAAAmuD,QAGAxuD,EADA,IAAAA,EAAAksN,SACAlsN,EAAAqoN,KAAAhoN,GAEAL,EAAAwuD,QAQA,IALA,IAuCAtpD,EAvCAuzN,EAAA,IAAAvR,EAAA,GACAwR,EAAA,IAAAxR,EAAA,GAEAxiK,EAAAjyC,EAAA+7C,QAEAxuD,EAAAmrN,KAAA,GAAA,GAAA14M,EAAA04M,KAAA,GAAA,GAAA,CACA,IAAA,IAAA7qN,EAAA,EAAAg4N,EAAA,EAAA,IAAAt4N,EAAAmsN,MAAA,GAAAmM,IAAAh4N,EAAA,KAAAA,EAAAg4N,IAAA,GACA,GAAAh4N,EAAA,EAEA,IADAN,EAAA8qN,OAAAxqN,GACAA,KAAA,GACAm4N,EAAA/Q,SACA+Q,EAAAlQ,KAAA7jK,GAGA+zK,EAAA3N,OAAA,GAIA,IAAA,IAAArgM,EAAA,EAAA8tM,EAAA,EAAA,IAAA9lN,EAAA05M,MAAA,GAAAoM,IAAA9tM,EAAA,KAAAA,EAAA8tM,IAAA,GACA,GAAA9tM,EAAA,EAEA,IADAhY,EAAAq4M,OAAArgM,GACAA,KAAA,GACAiuM,EAAAhR,SACAgR,EAAAnQ,KAAA7jK,GAGAg0K,EAAA5N,OAAA,GAIA9qN,EAAAsgC,IAAA7tB,IAAA,GACAzS,EAAAwoN,KAAA/1M,GACAgmN,EAAAjQ,KAAAkQ,KAEAjmN,EAAA+1M,KAAAxoN,GACA04N,EAAAlQ,KAAAiQ,IAeA,OATAvzN,EADA,IAAAlF,EAAAmrN,KAAA,GACAsN,EAEAC,GAGAvN,KAAA,GAAA,GACAjmN,EAAAqjN,KAAAloN,GAGA6E,GAGAgiN,EAAApwL,UAAAwzK,IAAA,SAAAz/J,GACA,GAAA1R,KAAA6uL,SAAA,OAAAn9K,EAAAyoJ,MACA,GAAAzoJ,EAAAm9K,SAAA,OAAA7uL,KAAAm6J,MAEA,IAAAtzL,EAAAm5B,KAAAq1B,QACA/7C,EAAAo4B,EAAA2jB,QACAxuD,EAAAksN,SAAA,EACAz5M,EAAAy5M,SAAA,EAGA,IAAA,IAAApuL,EAAA,EAAA99B,EAAAs0M,UAAA7hM,EAAA6hM,SAAAx2K,IACA99B,EAAA8qN,OAAA,GACAr4M,EAAAq4M,OAAA,GAGA,OAAA,CACA,KAAA9qN,EAAAs0M,UACAt0M,EAAA8qN,OAAA,GAEA,KAAAr4M,EAAA6hM,UACA7hM,EAAAq4M,OAAA,GAGA,IAAA3jL,EAAAnnC,EAAAsgC,IAAA7tB,GACA,GAAA00B,EAAA,EAAA,CAEA,IAAA+wC,EAAAl4E,EACAA,EAAAyS,EACAA,EAAAylE,OACA,GAAA,IAAA/wC,GAAA,IAAA10B,EAAA04M,KAAA,GACA,MAGAnrN,EAAAwoN,KAAA/1M,GAGA,OAAAA,EAAAikN,OAAA54L,IAIAopL,EAAApwL,UAAA6hM,KAAA,SAAA9tL,GACA,OAAA1R,KAAAi/L,KAAAvtL,GAAA7qC,EAAAqoN,KAAAx9K,IAGAq8K,EAAApwL,UAAAw9K,OAAA,WACA,OAAA,IAAA,EAAAn7K,KAAAgzL,MAAA,KAGAjF,EAAApwL,UAAA4wL,MAAA,WACA,OAAA,IAAA,EAAAvuL,KAAAgzL,MAAA,KAIAjF,EAAApwL,UAAA8zL,MAAA,SAAA//K,GACA,OAAA1R,KAAAgzL,MAAA,GAAAthL,GAIAq8K,EAAApwL,UAAA8hM,MAAA,SAAAhJ,GACA59L,EAAA,iBAAA49L,GACA,IAAAzoL,EAAAyoL,EAAA,GACAv6M,GAAAu6M,EAAAzoL,GAAA,GACAM,EAAA,GAAAN,EAGA,GAAAhO,KAAA/6B,QAAAiX,EAGA,OAFA8jB,KAAA+zL,QAAA73M,EAAA,GACA8jB,KAAAgzL,MAAA92M,IAAAoyB,EACAtO,KAKA,IADA,IAAA69H,EAAAvvH,EACAnnC,EAAA+U,EAAA,IAAA2hJ,GAAA12J,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs9I,EAAA,EAAAzkH,KAAAgzL,MAAA7rN,GAEA02J,GADApZ,GAAAoZ,KACA,GACApZ,GAAA,SACAzkH,KAAAgzL,MAAA7rN,GAAAs9I,EAMA,OAJA,IAAAoZ,IACA79H,KAAAgzL,MAAA7rN,GAAA02J,EACA79H,KAAA/6B,UAEA+6B,MAGA+tL,EAAApwL,UAAAkxL,OAAA,WACA,OAAA,IAAA7uL,KAAA/6B,QAAA,IAAA+6B,KAAAgzL,MAAA,IAGAjF,EAAApwL,UAAAq0L,KAAA,SAAAtgL,GACA,IAOA3lC,EAPAgnN,EAAArhL,EAAA,EAEA,GAAA,IAAA1R,KAAA+yL,WAAAA,EAAA,OAAA,EACA,GAAA,IAAA/yL,KAAA+yL,UAAAA,EAAA,OAAA,EAKA,GAHA/yL,KAAAsiM,SAGAtiM,KAAA/6B,OAAA,EACA8G,EAAA,MACA,CACAgnN,IACArhL,GAAAA,GAGA7Y,EAAA6Y,GAAA,SAAA,qBAEA,IAAA+yG,EAAA,EAAAzkH,KAAAgzL,MAAA,GACAjnN,EAAA04I,IAAA/yG,EAAA,EAAA+yG,EAAA/yG,GAAA,EAAA,EAEA,OAAA,IAAA1R,KAAA+yL,SAAA,GAAAhnN,EACAA,GAOAgiN,EAAApwL,UAAAwJ,IAAA,SAAAuK,GACA,GAAA,IAAA1R,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAAA,OAAA,EACA,GAAA,IAAA/yL,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAAA,OAAA,EAEA,IAAAhnN,EAAAi0B,KAAA0/L,KAAAhuL,GACA,OAAA,IAAA1R,KAAA+yL,SAAA,GAAAhnN,EACAA,GAIAgiN,EAAApwL,UAAA+hM,KAAA,SAAAhuL,GAEA,GAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA,OAAA,EACA,GAAA+6B,KAAA/6B,OAAAysC,EAAAzsC,OAAA,OAAA,EAGA,IADA,IAAA8G,EAAA,EACA5E,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IAAA,CACA,IAAAN,EAAA,EAAAm5B,KAAAgzL,MAAA7rN,GACAmS,EAAA,EAAAo4B,EAAAshL,MAAA7rN,GAEA,GAAAN,IAAAyS,EAAA,CACAzS,EAAAyS,EACAvN,GAAA,EACAlF,EAAAyS,IACAvN,EAAA,GAEA,OAEA,OAAAA,GAGAgiN,EAAApwL,UAAAgiM,IAAA,SAAAjuL,GACA,OAAA,IAAA1R,KAAAgyL,KAAAtgL,IAGAq8K,EAAApwL,UAAA3mG,GAAA,SAAA06G,GACA,OAAA,IAAA1R,KAAAmH,IAAAuK,IAGAq8K,EAAApwL,UAAAiiM,KAAA,SAAAluL,GACA,OAAA1R,KAAAgyL,KAAAtgL,IAAA,GAGAq8K,EAAApwL,UAAAkiM,IAAA,SAAAnuL,GACA,OAAA1R,KAAAmH,IAAAuK,IAAA,GAGAq8K,EAAApwL,UAAAmiM,IAAA,SAAApuL,GACA,OAAA,IAAA1R,KAAAgyL,KAAAtgL,IAGAq8K,EAAApwL,UAAAzmG,GAAA,SAAAw6G,GACA,OAAA,IAAA1R,KAAAmH,IAAAuK,IAGAq8K,EAAApwL,UAAAoiM,KAAA,SAAAruL,GACA,OAAA1R,KAAAgyL,KAAAtgL,IAAA,GAGAq8K,EAAApwL,UAAAqiM,IAAA,SAAAtuL,GACA,OAAA1R,KAAAmH,IAAAuK,IAAA,GAGAq8K,EAAApwL,UAAAsiM,IAAA,SAAAvuL,GACA,OAAA,IAAA1R,KAAAgyL,KAAAtgL,IAGAq8K,EAAApwL,UAAA4V,GAAA,SAAA7B,GACA,OAAA,IAAA1R,KAAAmH,IAAAuK,IAOAq8K,EAAAG,IAAA,SAAAx8K,GACA,OAAA,IAAAwuL,EAAAxuL,IAGAq8K,EAAApwL,UAAAswL,MAAA,SAAAh0G,GAGA,OAFAphF,GAAAmH,KAAAkuL,IAAA,yCACAr1L,EAAA,IAAAmH,KAAA+yL,SAAA,iCACA94G,EAAAkmH,UAAAngM,MAAAogM,UAAAnmH,IAGA8zG,EAAApwL,UAAA0iM,QAAA,WAEA,OADAxnM,EAAAmH,KAAAkuL,IAAA,wDACAluL,KAAAkuL,IAAAoS,YAAAtgM,OAGA+tL,EAAApwL,UAAAyiM,UAAA,SAAAnmH,GAEA,OADAj6E,KAAAkuL,IAAAj0G,EACAj6E,MAGA+tL,EAAApwL,UAAA4iM,SAAA,SAAAtmH,GAEA,OADAphF,GAAAmH,KAAAkuL,IAAA,yCACAluL,KAAAogM,UAAAnmH,IAGA8zG,EAAApwL,UAAA6iM,OAAA,SAAA9uL,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAAlvM,IAAAghB,KAAA0R,IAGAq8K,EAAApwL,UAAA0wL,QAAA,SAAA38K,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAAkB,KAAApvL,KAAA0R,IAGAq8K,EAAApwL,UAAA8iM,OAAA,SAAA/uL,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA58J,IAAAtxB,KAAA0R,IAGAq8K,EAAApwL,UAAAixL,QAAA,SAAAl9K,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAAmB,KAAArvL,KAAA0R,IAGAq8K,EAAApwL,UAAA+iM,OAAA,SAAAhvL,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAAyS,IAAA3gM,KAAA0R,IAGAq8K,EAAApwL,UAAAijM,OAAA,SAAAlvL,GAGA,OAFA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA2S,SAAA7gM,KAAA0R,GACA1R,KAAAkuL,IAAA0B,IAAA5vL,KAAA0R,IAGAq8K,EAAApwL,UAAAywL,QAAA,SAAA18K,GAGA,OAFA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA2S,SAAA7gM,KAAA0R,GACA1R,KAAAkuL,IAAAqB,KAAAvvL,KAAA0R,IAGAq8K,EAAApwL,UAAAwwL,OAAA,WAGA,OAFAt1L,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAAkP,IAAAp9L,OAGA+tL,EAAApwL,UAAAojM,QAAA,WAGA,OAFAloM,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAAmP,KAAAr9L,OAIA+tL,EAAApwL,UAAA2wL,QAAA,WAGA,OAFAz1L,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAA8S,KAAAhhM,OAGA+tL,EAAApwL,UAAAsjM,QAAA,WAGA,OAFApoM,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAAsR,KAAAx/L,OAIA+tL,EAAApwL,UAAA6wL,OAAA,WAGA,OAFA31L,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAA0H,IAAA51L,OAGA+tL,EAAApwL,UAAAujM,OAAA,SAAAxvL,GAGA,OAFA7Y,EAAAmH,KAAAkuL,MAAAx8K,EAAAw8K,IAAA,qBACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAA7uD,IAAAr/H,KAAA0R,IAIA,IAAAyvL,EAAA,CACAC,KAAA,KACAC,KAAA,KACAC,KAAA,KACAC,OAAA,MAIA,SAAAC,EAAA3uS,EAAAq0E,GAEA84B,KAAAntG,KAAAA,EACAmtG,KAAA94B,EAAA,IAAA6mN,EAAA7mN,EAAA,IACA84B,KAAA/rG,EAAA+rG,KAAA94B,EAAA+pM,YACAjxK,KAAA3rG,EAAA,IAAA05R,EAAA,GAAAwP,OAAAv9L,KAAA/rG,GAAAo7R,KAAArvL,KAAA94B,GAEA84B,KAAA5E,IAAA4E,KAAAyhM,OAiDA,SAAAC,IACAF,EAAA5jM,KACAoC,KACA,OACA,2EA+DA,SAAA2hM,IACAH,EAAA5jM,KACAoC,KACA,OACA,kEAIA,SAAA4hM,IACAJ,EAAA5jM,KACAoC,KACA,OACA,yDAIA,SAAA6hM,IAEAL,EAAA5jM,KACAoC,KACA,QACA,uEA8CA,SAAAkgM,EAAAhhN,GACA,GAAA,iBAAAA,EAAA,CACA,IAAAkvC,EAAA2/J,EAAA+T,OAAA5iN,GACA8gB,KAAA9gB,EAAAkvC,EAAAlnD,EACA84B,KAAAouB,MAAAA,OAEAv1B,EAAA3Z,EAAAygN,IAAA,GAAA,kCACA3/L,KAAA9gB,EAAAA,EACA8gB,KAAAouB,MAAA,KAoOA,SAAA2zK,EAAA7iN,GACAghN,EAAAtiM,KAAAoC,KAAA9gB,GAEA8gB,KAAA2E,MAAA3E,KAAA9gB,EAAA+xL,YACAjxK,KAAA2E,MAAA,IAAA,IACA3E,KAAA2E,OAAA,GAAA3E,KAAA2E,MAAA,IAGA3E,KAAAgO,EAAA,IAAA+/K,EAAA,GAAAwP,OAAAv9L,KAAA2E,OACA3E,KAAAo8J,GAAAp8J,KAAAgiM,KAAAhiM,KAAAgO,EAAAovL,OACAp9L,KAAAiiM,KAAAjiM,KAAAgO,EAAAqxL,OAAAr/L,KAAA9gB,GAEA8gB,KAAAkiM,KAAAliM,KAAAiiM,KAAArS,IAAA5vL,KAAAgO,GAAA0jL,MAAA,GAAAp+B,IAAAtzJ,KAAA9gB,GACA8gB,KAAAkiM,KAAAliM,KAAAkiM,KAAAhT,KAAAlvL,KAAAgO,GACAhO,KAAAkiM,KAAAliM,KAAAgO,EAAAsjB,IAAAtxB,KAAAkiM,MA9aAV,EAAA7jM,UAAA8jM,KAAA,WACA,IAAArmM,EAAA,IAAA2yL,EAAA,MAEA,OADA3yL,EAAA43L,MAAA,IAAAn1L,MAAAj4B,KAAAwhL,KAAApnJ,KAAA/rG,EAAA,KACAmnG,GAGAomM,EAAA7jM,UAAAwkM,QAAA,SAAAzwL,GAGA,IACA0wL,EADAp0L,EAAA0D,EAGA,GACA1R,KAAAlgB,MAAAkuB,EAAAhO,KAAA5E,KAGAgnM,GADAp0L,GADAA,EAAAhO,KAAAqiM,MAAAr0L,IACAohL,KAAApvL,KAAA5E,MACA61K,kBACAmxB,EAAApiM,KAAA/rG,GAEA,IAAAkzG,EAAAi7L,EAAApiM,KAAA/rG,GAAA,EAAA+5G,EAAA0xL,KAAA1/L,KAAA94B,GAgBA,OAfA,IAAAigC,GACA6G,EAAAglL,MAAA,GAAA,EACAhlL,EAAA/oC,OAAA,GACAkiC,EAAA,EACA6G,EAAAqhL,KAAArvL,KAAA94B,QAEAxxE,IAAAs4G,EAAA0lL,MAEA1lL,EAAA0lL,QAGA1lL,EAAAs0L,SAIAt0L,GAGAwzL,EAAA7jM,UAAA7d,MAAA,SAAAkP,EAAA+xC,GACA/xC,EAAA2iM,OAAA3xL,KAAA/rG,EAAA,EAAA8sI,IAGAygK,EAAA7jM,UAAA0kM,MAAA,SAAA3wL,GACA,OAAAA,EAAA69K,KAAAvvL,KAAA3rG,IASAo+R,EAAAiP,EAAAF,GAEAE,EAAA/jM,UAAA7d,MAAA,SAAAkP,EAAA8vI,GAKA,IAHA,IAAAE,EAAA,QAEAujE,EAAA38N,KAAAq0B,IAAAjL,EAAA/pB,OAAA,GACAkC,EAAA,EAAAA,EAAAo7N,EAAAp7N,IACA23J,EAAAk0D,MAAA7rN,GAAA6nB,EAAAgkM,MAAA7rN,GAIA,GAFA23J,EAAA75J,OAAAs9N,EAEAvzM,EAAA/pB,QAAA,EAGA,OAFA+pB,EAAAgkM,MAAA,GAAA,OACAhkM,EAAA/pB,OAAA,GAKA,IAAAkY,EAAA6R,EAAAgkM,MAAA,GAGA,IAFAl0D,EAAAk0D,MAAAl0D,EAAA75J,UAAAkY,EAAA6hJ,EAEA73J,EAAA,GAAAA,EAAA6nB,EAAA/pB,OAAAkC,IAAA,CACA,IAAAiW,EAAA,EAAA4R,EAAAgkM,MAAA7rN,GACA6nB,EAAAgkM,MAAA7rN,EAAA,KAAAiW,EAAA4hJ,IAAA,EAAA7hJ,IAAA,GACAA,EAAAC,EAEAD,KAAA,GACA6R,EAAAgkM,MAAA7rN,EAAA,IAAAgW,EACA,IAAAA,GAAA6R,EAAA/pB,OAAA,GACA+pB,EAAA/pB,QAAA,GAEA+pB,EAAA/pB,QAAA,GAIAy8N,EAAA/jM,UAAA0kM,MAAA,SAAA3wL,GAEAA,EAAAshL,MAAAthL,EAAAzsC,QAAA,EACAysC,EAAAshL,MAAAthL,EAAAzsC,OAAA,GAAA,EACAysC,EAAAzsC,QAAA,EAIA,IADA,IAAAq+K,EAAA,EACAn8K,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IAAA,CACA,IAAAs9I,EAAA,EAAA/yG,EAAAshL,MAAA7rN,GACAm8K,GAAA,IAAA7+B,EACA/yG,EAAAshL,MAAA7rN,GAAA,SAAAm8K,EACAA,EAAA,GAAA7+B,GAAA6+B,EAAA,SAAA,GAUA,OANA,IAAA5xI,EAAAshL,MAAAthL,EAAAzsC,OAAA,KACAysC,EAAAzsC,SACA,IAAAysC,EAAAshL,MAAAthL,EAAAzsC,OAAA,IACAysC,EAAAzsC,UAGAysC,GASA+gL,EAAAkP,EAAAH,GAQA/O,EAAAmP,EAAAJ,GASA/O,EAAAoP,EAAAL,GAEAK,EAAAlkM,UAAA0kM,MAAA,SAAA3wL,GAGA,IADA,IAAAmsH,EAAA,EACA12J,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IAAA,CACA,IAAAk8K,EAAA,IAAA,EAAA3xI,EAAAshL,MAAA7rN,IAAA02J,EACAylB,EAAA,SAAAD,EACAA,KAAA,GAEA3xI,EAAAshL,MAAA7rN,GAAAm8K,EACAzlB,EAAAwlB,EAKA,OAHA,IAAAxlB,IACAnsH,EAAAshL,MAAAthL,EAAAzsC,UAAA44J,GAEAnsH,GAIAq8K,EAAA+T,OAAA,SAAAjvS,GAEA,GAAAsuS,EAAAtuS,GAAA,OAAAsuS,EAAAtuS,GAEA,IAAAu7H,EACA,GAAA,SAAAv7H,EACAu7H,EAAA,IAAAszK,OACA,GAAA,SAAA7uS,EACAu7H,EAAA,IAAAuzK,OACA,GAAA,SAAA9uS,EACAu7H,EAAA,IAAAwzK,MACA,CAAA,GAAA,WAAA/uS,EAGA,MAAA,IAAAimG,MAAA,iBAAAjmG,GAFAu7H,EAAA,IAAAyzK,EAMA,OAFAV,EAAAtuS,GAAAu7H,EAEAA,GAkBA8xK,EAAAviM,UAAAmjM,SAAA,SAAAj6N,GACAgyB,EAAA,IAAAhyB,EAAAksN,SAAA,iCACAl6L,EAAAhyB,EAAAqnN,IAAA,oCAGAgS,EAAAviM,UAAAkjM,SAAA,SAAAh6N,EAAAyS,GACAuf,EAAA,IAAAhyB,EAAAksN,SAAAz5M,EAAAy5M,UAAA,iCACAl6L,EAAAhyB,EAAAqnN,KAAArnN,EAAAqnN,MAAA50M,EAAA40M,IACA,oCAGAgS,EAAAviM,UAAAqkM,KAAA,SAAAn7N,GACA,OAAAm5B,KAAAouB,MAAApuB,KAAAouB,MAAA+zK,QAAAt7N,GAAAu5N,UAAApgM,OAEAo+E,EAAAv3G,EAAAA,EAAAqoN,KAAAlvL,KAAA9gB,GAAAkhN,UAAApgM,OACAn5B,IAGAq5N,EAAAviM,UAAAi4L,IAAA,SAAA/uN,GACA,OAAAA,EAAAgoN,SACAhoN,EAAAwuD,QAGAr1B,KAAA9gB,EAAAoyC,IAAAzqD,GAAAu5N,UAAApgM,OAGAkgM,EAAAviM,UAAA3e,IAAA,SAAAnY,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAmY,IAAA1F,GAIA,OAHAvN,EAAAo7B,IAAAnH,KAAA9gB,IAAA,GACAnT,EAAAsjN,KAAArvL,KAAA9gB,GAEAnT,EAAAq0N,UAAApgM,OAGAkgM,EAAAviM,UAAAyxL,KAAA,SAAAvoN,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAuoN,KAAA91M,GAIA,OAHAvN,EAAAo7B,IAAAnH,KAAA9gB,IAAA,GACAnT,EAAAsjN,KAAArvL,KAAA9gB,GAEAnT,GAGAm0N,EAAAviM,UAAA2zB,IAAA,SAAAzqD,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAyqD,IAAAh4C,GAIA,OAHAvN,EAAAimN,KAAA,GAAA,GACAjmN,EAAAqjN,KAAApvL,KAAA9gB,GAEAnT,EAAAq0N,UAAApgM,OAGAkgM,EAAAviM,UAAA0xL,KAAA,SAAAxoN,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAwoN,KAAA/1M,GAIA,OAHAvN,EAAAimN,KAAA,GAAA,GACAjmN,EAAAqjN,KAAApvL,KAAA9gB,GAEAnT,GAGAm0N,EAAAviM,UAAAgjM,IAAA,SAAA95N,EAAA6qC,GAEA,OADA1R,KAAA8gM,SAAAj6N,GACAm5B,KAAAgiM,KAAAn7N,EAAAm3N,MAAAtsL,KAGAwuL,EAAAviM,UAAA4xL,KAAA,SAAA1oN,EAAAyS,GAEA,OADA0mB,KAAA6gM,SAAAh6N,EAAAyS,GACA0mB,KAAAgiM,KAAAn7N,EAAA0oN,KAAAj2M,KAGA4mN,EAAAviM,UAAAiyL,IAAA,SAAA/oN,EAAAyS,GAEA,OADA0mB,KAAA6gM,SAAAh6N,EAAAyS,GACA0mB,KAAAgiM,KAAAn7N,EAAA+oN,IAAAt2M,KAGA4mN,EAAAviM,UAAA0/L,KAAA,SAAAx2N,GACA,OAAAm5B,KAAAuvL,KAAA1oN,EAAAA,EAAAwuD,UAGA6qK,EAAAviM,UAAAy/L,IAAA,SAAAv2N,GACA,OAAAm5B,KAAA4vL,IAAA/oN,EAAAA,IAGAq5N,EAAAviM,UAAAqjM,KAAA,SAAAn6N,GACA,GAAAA,EAAAgoN,SAAA,OAAAhoN,EAAAwuD,QAEA,IAAAmtK,EAAAxiM,KAAA9gB,EAAAuyM,MAAA,GAIA,GAHA54L,EAAA2pM,EAAA,GAAA,GAGA,IAAAA,EAAA,CACA,IAAAnjE,EAAAr/H,KAAA9gB,EAAAF,IAAA,IAAA+uM,EAAA,IAAA4D,OAAA,GACA,OAAA3xL,KAAAq/H,IAAAx4J,EAAAw4J,GAQA,IAFA,IAAA/wH,EAAAtO,KAAA9gB,EAAAo/M,KAAA,GACApiN,EAAA,GACAoyB,EAAAugL,UAAA,IAAAvgL,EAAAmjL,MAAA,IACAv1M,IACAoyB,EAAAqjL,OAAA,GAEA94L,GAAAyV,EAAAugL,UAEA,IAAA4T,EAAA,IAAA1U,EAAA,GAAAE,MAAAjuL,MACA0iM,EAAAD,EAAAjU,SAIAmU,EAAA3iM,KAAA9gB,EAAAo/M,KAAA,GAAA3M,OAAA,GACApsE,EAAAvlH,KAAA9gB,EAAA+xL,YAGA,IAFA1rD,EAAA,IAAAwoE,EAAA,EAAAxoE,EAAAA,GAAA0oE,MAAAjuL,MAEA,IAAAA,KAAAq/H,IAAA9Z,EAAAo9E,GAAAx7L,IAAAu7L,IACAn9E,EAAA8oE,QAAAqU,GAOA,IAJA,IAAAj2N,EAAAuzB,KAAAq/H,IAAA9Z,EAAAj3G,GACAN,EAAAhO,KAAAq/H,IAAAx4J,EAAAynC,EAAA+vL,KAAA,GAAA1M,OAAA,IACA5yI,EAAA/+C,KAAAq/H,IAAAx4J,EAAAynC,GACApvB,EAAAhD,EACA,IAAA6iE,EAAA53C,IAAAs7L,IAAA,CAEA,IADA,IAAArnM,EAAA2jD,EACA53E,EAAA,EAAA,IAAAi0B,EAAA+L,IAAAs7L,GAAAt7N,IACAi0B,EAAAA,EAAA+yL,SAEAt1L,EAAA1xB,EAAA+X,GACA,IAAA5F,EAAA0mB,KAAAq/H,IAAA5yJ,EAAA,IAAAshN,EAAA,GAAAwP,OAAAr+M,EAAA/X,EAAA,IAEA6mC,EAAAA,EAAA4yL,OAAAtnN,GACA7M,EAAA6M,EAAA60M,SACApvI,EAAAA,EAAA6hJ,OAAAn0N,GACAyS,EAAA/X,EAGA,OAAA6mC,GAGAkyL,EAAAviM,UAAA6hM,KAAA,SAAA34N,GACA,IAAA+7N,EAAA/7N,EAAAw4N,OAAAr/L,KAAA9gB,GACA,OAAA,IAAA0jN,EAAA7P,UACA6P,EAAA7P,SAAA,EACA/yL,KAAAgiM,KAAAY,GAAApU,UAEAxuL,KAAAgiM,KAAAY,IAIA1C,EAAAviM,UAAA0hI,IAAA,SAAAx4J,EAAA6qC,GACA,GAAAA,EAAAm9K,SAAA,OAAA,IAAAd,EAAA,GAAAE,MAAAjuL,MACA,GAAA,IAAA0R,EAAAsgL,KAAA,GAAA,OAAAnrN,EAAAwuD,QAEA,IACAwtK,EAAA,IAAAhlM,MAAA,IACAglM,EAAA,GAAA,IAAA9U,EAAA,GAAAE,MAAAjuL,MACA6iM,EAAA,GAAAh8N,EACA,IAAA,IAAAM,EAAA,EAAAA,EAAA07N,EAAA59N,OAAAkC,IACA07N,EAAA17N,GAAA64B,KAAA4vL,IAAAiT,EAAA17N,EAAA,GAAAN,GAGA,IAAAkF,EAAA82N,EAAA,GACAnzJ,EAAA,EACAozJ,EAAA,EACA9tN,EAAA08B,EAAAu/J,YAAA,GAKA,IAJA,IAAAj8L,IACAA,EAAA,IAGA7N,EAAAuqC,EAAAzsC,OAAA,EAAAkC,GAAA,EAAAA,IAAA,CAEA,IADA,IAAAq7C,EAAA9Q,EAAAshL,MAAA7rN,GACAmqB,EAAAtc,EAAA,EAAAsc,GAAA,EAAAA,IAAA,CACA,IAAAmlM,EAAAj0K,GAAAlxB,EAAA,EACAvlB,IAAA82N,EAAA,KACA92N,EAAAi0B,KAAAo9L,IAAArxN,IAGA,IAAA0qN,GAAA,IAAA/mJ,GAKAA,IAAA,EACAA,GAAA+mJ,GA9BA,MA+BAqM,GACA,IAAA37N,GAAA,IAAAmqB,KAEAvlB,EAAAi0B,KAAA4vL,IAAA7jN,EAAA82N,EAAAnzJ,IACAozJ,EAAA,EACApzJ,EAAA,IAXAozJ,EAAA,EAaA9tN,EAAA,GAGA,OAAAjJ,GAGAm0N,EAAAviM,UAAAwiM,UAAA,SAAAzuL,GACA,IAAA1D,EAAA0D,EAAAw9K,KAAAlvL,KAAA9gB,GAEA,OAAA8uB,IAAA0D,EAAA1D,EAAAqnB,QAAArnB,GAGAkyL,EAAAviM,UAAA2iM,YAAA,SAAA5uL,GACA,IAAA3lC,EAAA2lC,EAAA2jB,QAEA,OADAtpD,EAAAmiN,IAAA,KACAniN,GAOAgiN,EAAAgV,KAAA,SAAArxL,GACA,OAAA,IAAAqwL,EAAArwL,IAmBA+gL,EAAAsP,EAAA7B,GAEA6B,EAAApkM,UAAAwiM,UAAA,SAAAzuL,GACA,OAAA1R,KAAAgiM,KAAAtwL,EAAAssL,MAAAh+L,KAAA2E,SAGAo9L,EAAApkM,UAAA2iM,YAAA,SAAA5uL,GACA,IAAA1D,EAAAhO,KAAAgiM,KAAAtwL,EAAAk+K,IAAA5vL,KAAAiiM,OAEA,OADAj0L,EAAAkgL,IAAA,KACAlgL,GAGA+zL,EAAApkM,UAAA4xL,KAAA,SAAA1oN,EAAAyS,GACA,GAAAzS,EAAAgoN,UAAAv1M,EAAAu1M,SAGA,OAFAhoN,EAAAmsN,MAAA,GAAA,EACAnsN,EAAA5B,OAAA,EACA4B,EAGA,IAAAk4E,EAAAl4E,EAAA0oN,KAAAj2M,GACA7M,EAAAsyE,EAAAq/I,MAAAp+L,KAAA2E,OAAAirL,IAAA5vL,KAAAkiM,MAAA/D,OAAAn+L,KAAA2E,OAAAirL,IAAA5vL,KAAA9gB,GACAg1G,EAAAn1C,EAAAswI,KAAA5iN,GAAAklN,OAAA3xL,KAAA2E,OACA54B,EAAAmoH,EAQA,OANAA,EAAA/sF,IAAAnH,KAAA9gB,IAAA,EACAnT,EAAAmoH,EAAAm7F,KAAArvL,KAAA9gB,GACAg1G,EAAA89F,KAAA,GAAA,IACAjmN,EAAAmoH,EAAAk7F,KAAApvL,KAAA9gB,IAGAnT,EAAAq0N,UAAApgM,OAGA+hM,EAAApkM,UAAAiyL,IAAA,SAAA/oN,EAAAyS,GACA,GAAAzS,EAAAgoN,UAAAv1M,EAAAu1M,SAAA,OAAA,IAAAd,EAAA,GAAAqS,UAAApgM,MAEA,IAAA++C,EAAAl4E,EAAA+oN,IAAAt2M,GACA7M,EAAAsyE,EAAAq/I,MAAAp+L,KAAA2E,OAAAirL,IAAA5vL,KAAAkiM,MAAA/D,OAAAn+L,KAAA2E,OAAAirL,IAAA5vL,KAAA9gB,GACAg1G,EAAAn1C,EAAAswI,KAAA5iN,GAAAklN,OAAA3xL,KAAA2E,OACA54B,EAAAmoH,EAOA,OANAA,EAAA/sF,IAAAnH,KAAA9gB,IAAA,EACAnT,EAAAmoH,EAAAm7F,KAAArvL,KAAA9gB,GACAg1G,EAAA89F,KAAA,GAAA,IACAjmN,EAAAmoH,EAAAk7F,KAAApvL,KAAA9gB,IAGAnT,EAAAq0N,UAAApgM,OAGA+hM,EAAApkM,UAAA6hM,KAAA,SAAA34N,GAGA,OADAm5B,KAAAgiM,KAAAn7N,EAAAw4N,OAAAr/L,KAAA9gB,GAAA0wM,IAAA5vL,KAAAo8J,KACAgkC,UAAApgM,OAx9GA,MA09GA,IAAA3sG,GAAAA,EAAA2sG,mDC19GA,SAAA3sG,EAAAC,GACA,aAGA,SAAAulG,EAAAc,EAAAlqB,GACA,IAAAkqB,EAAA,MAAA,IAAAb,MAAArpB,GAAA,oBAKA,SAAAgjN,EAAAxmG,EAAAymG,GACAzmG,EAAA0mG,OAAAD,EACA,IAAAE,EAAA,aACAA,EAAAj1L,UAAA+0L,EAAA/0L,UACAsuF,EAAAtuF,UAAA,IAAAi1L,EACA3mG,EAAAtuF,UAAAgP,YAAAs/E,EAKA,SAAA8hG,EAAAjpL,EAAAs7B,EAAAyyJ,GACA,GAAA9E,EAAA+E,KAAAhuL,GACA,OAAAA,EAGA9E,KAAA+yL,SAAA,EACA/yL,KAAAgzL,MAAA,KACAhzL,KAAA/6B,OAAA,EAGA+6B,KAAAkuL,IAAA,KAEA,OAAAppL,IACA,OAAAs7B,GAAA,OAAAA,IACAyyJ,EAAAzyJ,EACAA,EAAA,IAGApgC,KAAA+hK,MAAAj9J,GAAA,EAAAs7B,GAAA,GAAAyyJ,GAAA,OAYA,IAAA5vC,EATA,iBAAA5vP,EACAA,EAAAC,QAAAy6R,EAEAz6R,EAAAy6R,GAAAA,EAGAA,EAAAA,GAAAA,EACAA,EAAAkF,SAAA,GAGA,IAEAhwC,EADA,oBAAA1jJ,aAAA,IAAAA,OAAA0jJ,OACA1jJ,OAAA0jJ,OAEA1vP,EAAA,UAAA0vP,OAEA,MAAAlvP,IAgIA,SAAAm/R,EAAAv3L,EAAAp2B,GACA,IAAAkH,EAAAkvB,EAAA1jB,WAAA1S,GAEA,OAAAkH,GAAA,IAAAA,GAAA,GACAA,EAAA,GAEAA,GAAA,IAAAA,GAAA,GACAA,EAAA,GAEAA,GAAA,IAAAA,GAAA,IACAA,EAAA,QAEAosB,GAAA,EAAA,wBAAA8C,GAIA,SAAAw3L,EAAAx3L,EAAAy3L,EAAA7tN,GACA,IAAAyoC,EAAAklL,EAAAv3L,EAAAp2B,GAIA,OAHAA,EAAA,GAAA6tN,IACAplL,GAAAklL,EAAAv3L,EAAAp2B,EAAA,IAAA,GAEAyoC,EA8CA,SAAAqlL,EAAA79L,EAAAxgB,EAAAhQ,EAAA4qN,GAIA,IAHA,IAAA5hL,EAAA,EACA10B,EAAA,EACA8pB,EAAAx9B,KAAAq0B,IAAAzE,EAAAvwB,OAAAD,GACAmC,EAAA6N,EAAA7N,EAAAi8B,EAAAj8B,IAAA,CACA,IAAAsF,EAAA+oB,EAAAvd,WAAA9Q,GAAA,GAEA6mC,GAAA4hL,EAIAt2M,EADA7M,GAAA,GACAA,EAAA,GAAA,GAGAA,GAAA,GACAA,EAAA,GAAA,GAIAA,EAEAosB,EAAApsB,GAAA,GAAA6M,EAAAs2M,EAAA,qBACA5hL,GAAA10B,EAEA,OAAA00B,EA4DA,SAAAowE,EAAAukC,EAAA1mH,GACA0mH,EAAAqwE,MAAA/2L,EAAA+2L,MACArwE,EAAA19I,OAAAg3B,EAAAh3B,OACA09I,EAAAowE,SAAA92L,EAAA82L,SACApwE,EAAAurE,IAAAjyL,EAAAiyL,IAsCA,GA9TAH,EAAA+E,KAAA,SAAAphL,GACA,OAAAA,aAAAq8K,GAIA,OAAAr8K,GAAA,iBAAAA,GACAA,EAAA/E,YAAAsmL,WAAAlF,EAAAkF,UAAAp1L,MAAA/gB,QAAA40B,EAAAshL,QAGAjF,EAAApoN,IAAA,SAAAujB,EAAAC,GACA,OAAAD,EAAAie,IAAAhe,GAAA,EAAAD,EACAC,GAGA4kM,EAAA9zL,IAAA,SAAA/Q,EAAAC,GACA,OAAAD,EAAAie,IAAAhe,GAAA,EAAAD,EACAC,GAGA4kM,EAAApwL,UAAAokK,MAAA,SAAAj9J,EAAAs7B,EAAAyyJ,GACA,GAAA,iBAAA/tL,EACA,OAAA9E,KAAAszL,YAAAxuL,EAAAs7B,EAAAyyJ,GAGA,GAAA,iBAAA/tL,EACA,OAAA9E,KAAAuzL,WAAAzuL,EAAAs7B,EAAAyyJ,GAGA,QAAAzyJ,IACAA,EAAA,IAEAvnC,EAAAunC,KAAA,EAAAA,IAAAA,GAAA,GAAAA,GAAA,IAGA,IAAAprD,EAAA,EACA,OAFA8vB,EAAAA,EAAA1G,WAAAllB,QAAA,OAAA,KAEA,KACAlE,IACAgrB,KAAA+yL,SAAA,GAGA/9M,EAAA8vB,EAAA7/B,SACA,KAAAm7D,EACApgC,KAAAwzL,UAAA1uL,EAAA9vB,EAAA69M,IAEA7yL,KAAAyzL,WAAA3uL,EAAAs7B,EAAAprD,GACA,OAAA69M,GACA7yL,KAAAuzL,WAAAvzL,KAAAmD,UAAAi9B,EAAAyyJ,MAMA9E,EAAApwL,UAAA21L,YAAA,SAAAxuL,EAAAs7B,EAAAyyJ,GACA/tL,EAAA,IACA9E,KAAA+yL,SAAA,EACAjuL,GAAAA,GAEAA,EAAA,UACA9E,KAAAgzL,MAAA,CAAA,SAAAluL,GACA9E,KAAA/6B,OAAA,GACA6/B,EAAA,kBACA9E,KAAAgzL,MAAA,CACA,SAAAluL,EACAA,EAAA,SAAA,UAEA9E,KAAA/6B,OAAA,IAEA4zB,EAAAiM,EAAA,kBACA9E,KAAAgzL,MAAA,CACA,SAAAluL,EACAA,EAAA,SAAA,SACA,GAEA9E,KAAA/6B,OAAA,GAGA,OAAA4tN,GAGA7yL,KAAAuzL,WAAAvzL,KAAAmD,UAAAi9B,EAAAyyJ,IAGA9E,EAAApwL,UAAA41L,WAAA,SAAAzuL,EAAAs7B,EAAAyyJ,GAGA,GADAh6L,EAAA,iBAAAiM,EAAA7/B,QACA6/B,EAAA7/B,QAAA,EAGA,OAFA+6B,KAAAgzL,MAAA,CAAA,GACAhzL,KAAA/6B,OAAA,EACA+6B,KAGAA,KAAA/6B,OAAAW,KAAAwhL,KAAAtiJ,EAAA7/B,OAAA,GACA+6B,KAAAgzL,MAAA,IAAAn1L,MAAAmC,KAAA/6B,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA,EAGA,IAAAmqB,EAAAmzH,EACA8Q,EAAA,EACA,GAAA,OAAAs9D,EACA,IAAA1rN,EAAA29B,EAAA7/B,OAAA,EAAAqsB,EAAA,EAAAnqB,GAAA,EAAAA,GAAA,EACAs9I,EAAA3/G,EAAA39B,GAAA29B,EAAA39B,EAAA,IAAA,EAAA29B,EAAA39B,EAAA,IAAA,GACA64B,KAAAgzL,MAAA1hM,IAAAmzH,GAAA8Q,EAAA,SACAv1H,KAAAgzL,MAAA1hM,EAAA,GAAAmzH,IAAA,GAAA8Q,EAAA,UACAA,GAAA,KACA,KACAA,GAAA,GACAjkI,UAGA,GAAA,OAAAuhM,EACA,IAAA1rN,EAAA,EAAAmqB,EAAA,EAAAnqB,EAAA29B,EAAA7/B,OAAAkC,GAAA,EACAs9I,EAAA3/G,EAAA39B,GAAA29B,EAAA39B,EAAA,IAAA,EAAA29B,EAAA39B,EAAA,IAAA,GACA64B,KAAAgzL,MAAA1hM,IAAAmzH,GAAA8Q,EAAA,SACAv1H,KAAAgzL,MAAA1hM,EAAA,GAAAmzH,IAAA,GAAA8Q,EAAA,UACAA,GAAA,KACA,KACAA,GAAA,GACAjkI,KAIA,OAAA0O,KAAAsiM,UA2BAvU,EAAApwL,UAAA61L,UAAA,SAAA1uL,EAAA9vB,EAAA69M,GAEA7yL,KAAA/6B,OAAAW,KAAAwhL,MAAAtiJ,EAAA7/B,OAAA+P,GAAA,GACAgrB,KAAAgzL,MAAA,IAAAn1L,MAAAmC,KAAA/6B,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA,EAIA,IAGAs9I,EAHA8Q,EAAA,EACAjkI,EAAA,EAGA,GAAA,OAAAuhM,EACA,IAAA1rN,EAAA29B,EAAA7/B,OAAA,EAAAkC,GAAA6N,EAAA7N,GAAA,EACAs9I,EAAA0uE,EAAAruL,EAAA9vB,EAAA7N,IAAAouJ,EACAv1H,KAAAgzL,MAAA1hM,IAAA,SAAAmzH,EACA8Q,GAAA,IACAA,GAAA,GACAjkI,GAAA,EACA0O,KAAAgzL,MAAA1hM,IAAAmzH,IAAA,IAEA8Q,GAAA,OAKA,IAAApuJ,GADA29B,EAAA7/B,OAAA+P,GACA,GAAA,EAAAA,EAAA,EAAAA,EAAA7N,EAAA29B,EAAA7/B,OAAAkC,GAAA,EACAs9I,EAAA0uE,EAAAruL,EAAA9vB,EAAA7N,IAAAouJ,EACAv1H,KAAAgzL,MAAA1hM,IAAA,SAAAmzH,EACA8Q,GAAA,IACAA,GAAA,GACAjkI,GAAA,EACA0O,KAAAgzL,MAAA1hM,IAAAmzH,IAAA,IAEA8Q,GAAA,EAKAv1H,KAAAsiM,UA8BAvU,EAAApwL,UAAA81L,WAAA,SAAA3uL,EAAAs7B,EAAAprD,GAEAgrB,KAAAgzL,MAAA,CAAA,GACAhzL,KAAA/6B,OAAA,EAGA,IAAA,IAAA0uN,EAAA,EAAAC,EAAA,EAAAA,GAAA,SAAAA,GAAAxzJ,EACAuzJ,IAEAA,IACAC,EAAAA,EAAAxzJ,EAAA,EAOA,IALA,IAAAgvB,EAAAtqD,EAAA7/B,OAAA+P,EACAstE,EAAA8M,EAAAukI,EACA3uN,EAAAY,KAAAq0B,IAAAm1D,EAAAA,EAAA9M,GAAAttE,EAEAwtC,EAAA,EACAr7C,EAAA6N,EAAA7N,EAAAnC,EAAAmC,GAAAwsN,EACAnxK,EAAA6wK,EAAAvuL,EAAA39B,EAAAA,EAAAwsN,EAAAvzJ,GAEApgC,KAAA6zL,MAAAD,GACA5zL,KAAAgzL,MAAA,GAAAxwK,EAAA,SACAxiB,KAAAgzL,MAAA,IAAAxwK,EAEAxiB,KAAA8zL,OAAAtxK,GAIA,GAAA,IAAA8/B,EAAA,CACA,IAAA+8E,EAAA,EAGA,IAFA78G,EAAA6wK,EAAAvuL,EAAA39B,EAAA29B,EAAA7/B,OAAAm7D,GAEAj5D,EAAA,EAAAA,EAAAm7E,EAAAn7E,IACAk4J,GAAAj/F,EAGApgC,KAAA6zL,MAAAx0D,GACAr/H,KAAAgzL,MAAA,GAAAxwK,EAAA,SACAxiB,KAAAgzL,MAAA,IAAAxwK,EAEAxiB,KAAA8zL,OAAAtxK,GAIAxiB,KAAAsiM,UAGAvU,EAAApwL,UAAA1gG,KAAA,SAAA0lN,GACAA,EAAAqwE,MAAA,IAAAn1L,MAAAmC,KAAA/6B,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACAw7I,EAAAqwE,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAEAw7I,EAAA19I,OAAA+6B,KAAA/6B,OACA09I,EAAAowE,SAAA/yL,KAAA+yL,SACApwE,EAAAurE,IAAAluL,KAAAkuL,KAUAH,EAAApwL,UAAAkuP,MAAA,SAAAlpI,GACAvkC,EAAAukC,EAAA3iH,OAGA+tL,EAAApwL,UAAA03B,MAAA,WACA,IAAArnB,EAAA,IAAA+/K,EAAA,MAEA,OADA/tL,KAAA/iG,KAAA+wG,GACAA,GAGA+/K,EAAApwL,UAAAo2L,QAAA,SAAA92L,GACA,KAAA+C,KAAA/6B,OAAAg4B,GACA+C,KAAAgzL,MAAAhzL,KAAA/6B,UAAA,EAEA,OAAA+6B,MAIA+tL,EAAApwL,UAAA2kM,OAAA,WACA,KAAAtiM,KAAA/6B,OAAA,GAAA,IAAA+6B,KAAAgzL,MAAAhzL,KAAA/6B,OAAA,IACA+6B,KAAA/6B,SAEA,OAAA+6B,KAAAg0L,aAGAjG,EAAApwL,UAAAq2L,UAAA,WAKA,OAHA,IAAAh0L,KAAA/6B,QAAA,IAAA+6B,KAAAgzL,MAAA,KACAhzL,KAAA+yL,SAAA,GAEA/yL,MAKA,oBAAA9pG,QAAA,mBAAAA,OAAAugP,IACA,IACAs3C,EAAApwL,UAAAznG,OAAAugP,IAAA,+BAAAw9C,EACA,MAAAlgS,GACAg6R,EAAApwL,UAAAs2L,QAAAA,OAGAlG,EAAApwL,UAAAs2L,QAAAA,EAGA,SAAAA,IACA,OAAAj0L,KAAAkuL,IAAA,UAAA,SAAAluL,KAAA5B,SAAA,IAAA,IAiCA,IAAAu8J,EAAA,CACA,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGAu5B,EAAA,CACA,EAAA,EACA,GAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EACA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAGAC,EAAA,CACA,EAAA,EACA,SAAA,SAAA,SAAA,SAAA,SAAA,SAAA,SACA,SAAA,IAAA,SAAA,SAAA,SAAA,QAAA,SACA,SAAA,SAAA,SAAA,SAAA,KAAA,QAAA,QACA,QAAA,QAAA,QAAA,SAAA,SAAA,SAAA,SACA,MAAA,SAAA,SAAA,SAAA,SAAA,SAAA,UAGApG,EAAApwL,UAAAS,SAAA,SAAAgiC,EAAAglI,GAIA,IAAArkI,EACA,GAHAqkI,EAAA,EAAAA,GAAA,EAGA,MAJAhlI,EAAAA,GAAA,KAIA,QAAAA,EAAA,CACAW,EAAA,GAGA,IAFA,IAAAw0F,EAAA,EACAsI,EAAA,EACA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs9I,EAAAzkH,KAAAgzL,MAAA7rN,GACAq7C,GAAA,UAAAiiG,GAAA8Q,EAAAsI,IAAAz/H,SAAA,IAGA2iC,EADA,KADA88F,EAAApZ,IAAA,GAAA8Q,EAAA,WACApuJ,IAAA64B,KAAA/6B,OAAA,EACA01L,EAAA,EAAAn4I,EAAAv9C,QAAAu9C,EAAAue,EAEAve,EAAAue,GAEAw0F,GAAA,IACA,KACAA,GAAA,GACApuJ,KAMA,IAHA,IAAA02J,IACA98F,EAAA88F,EAAAz/H,SAAA,IAAA2iC,GAEAA,EAAA97D,OAAAmgM,GAAA,GACArkI,EAAA,IAAAA,EAKA,OAHA,IAAA/gC,KAAA+yL,WACAhyJ,EAAA,IAAAA,GAEAA,EAGA,GAAAX,KAAA,EAAAA,IAAAA,GAAA,GAAAA,GAAA,GAAA,CAEA,IAAAo0J,EAAAN,EAAA9zJ,GAEAq0J,EAAAN,EAAA/zJ,GACAW,EAAA,GACA,IAAAt0D,EAAAuzB,KAAAq1B,QAEA,IADA5oD,EAAAsmN,SAAA,GACAtmN,EAAAoiN,UAAA,CACA,IAAA7gL,EAAAvhC,EAAAq/Q,MAAAr3D,GAAAr2L,SAAAgiC,GAMAW,GALAt0D,EAAAA,EAAAkoN,MAAAF,IAEA5F,SAGA7gL,EAAA+yB,EAFA45H,EAAA65B,EAAAxmL,EAAA/oC,QAAA+oC,EAAA+yB,EAQA,IAHA/gC,KAAA6uL,WACA9tJ,EAAA,IAAAA,GAEAA,EAAA97D,OAAAmgM,GAAA,GACArkI,EAAA,IAAAA,EAKA,OAHA,IAAA/gC,KAAA+yL,WACAhyJ,EAAA,IAAAA,GAEAA,EAGAloC,GAAA,EAAA,oCAGAk1L,EAAApwL,UAAAqB,SAAA,WACA,IAAA7S,EAAA6T,KAAAgzL,MAAA,GASA,OARA,IAAAhzL,KAAA/6B,OACAknB,GAAA,SAAA6T,KAAAgzL,MAAA,GACA,IAAAhzL,KAAA/6B,QAAA,IAAA+6B,KAAAgzL,MAAA,GAEA7mM,GAAA,iBAAA,SAAA6T,KAAAgzL,MAAA,GACAhzL,KAAA/6B,OAAA,GACA4zB,GAAA,EAAA,8CAEA,IAAAmH,KAAA+yL,UAAA5mM,EAAAA,GAGA4hM,EAAApwL,UAAAvW,OAAA,WACA,OAAA4Y,KAAA5B,SAAA,GAAA,IAGA6kJ,IACA8qC,EAAApwL,UAAAi3L,SAAA,SAAA/B,EAAA5tN,GACA,OAAA+6B,KAAAmvL,YAAAlsC,EAAA4vC,EAAA5tN,KAIA8oN,EAAApwL,UAAAwF,QAAA,SAAA0vL,EAAA5tN,GACA,OAAA+6B,KAAAmvL,YAAAtxL,MAAAg1L,EAAA5tN,IA4gBA,SAAAmvN,EAAA90L,EAAAoS,EAAAqvB,GACAA,EAAAgyJ,SAAArhL,EAAAqhL,SAAAzzL,EAAAyzL,SACA,IAAA3vL,EAAA9D,EAAAr6B,OAAAysC,EAAAzsC,OAAA,EACA87D,EAAA97D,OAAAm+B,EACAA,EAAAA,EAAA,EAAA,EAGA,IAAAv8B,EAAA,EAAAy4B,EAAA0zL,MAAA,GACA15M,EAAA,EAAAo4B,EAAAshL,MAAA,GACAhlL,EAAAnnC,EAAAyS,EAEAgqK,EAAA,SAAAt1I,EACA6vH,EAAA7vH,EAAA,SAAA,EACA+yB,EAAAiyJ,MAAA,GAAA1vC,EAEA,IAAA,IAAAjvP,EAAA,EAAAA,EAAA+uG,EAAA/uG,IAAA,CAMA,IAHA,IAAAggS,EAAAx2D,IAAA,GACAy2D,EAAA,SAAAz2D,EACA02D,EAAA3uN,KAAAq0B,IAAA5lG,EAAAq9G,EAAAzsC,OAAA,GACAqsB,EAAA1rB,KAAAD,IAAA,EAAAtxE,EAAAirG,EAAAr6B,OAAA,GAAAqsB,GAAAijM,EAAAjjM,IAAA,CACA,IAAAnqB,EAAA9yE,EAAAi9F,EAAA,EAIA+iM,IADArmL,GAFAnnC,EAAA,EAAAy4B,EAAA0zL,MAAA7rN,KACAmS,EAAA,EAAAo4B,EAAAshL,MAAA1hM,IACAgjM,GACA,SAAA,EACAA,EAAA,SAAAtmL,EAEA+yB,EAAAiyJ,MAAA3+R,GAAA,EAAAigS,EACAz2D,EAAA,EAAAw2D,EAQA,OANA,IAAAx2D,EACA98F,EAAAiyJ,MAAA3+R,GAAA,EAAAwpO,EAEA98F,EAAA97D,SAGA87D,EAAAuhK,SAxiBAvU,EAAApwL,UAAAwxL,YAAA,SAAA0F,EAAAhC,EAAA5tN,GACA+6B,KAAAsiM,SAEA,IAAAlkE,EAAAp+H,KAAAo+H,aACA02D,EAAA7vN,GAAAW,KAAAD,IAAA,EAAAy4J,GACAvlI,EAAAulI,GAAA02D,EAAA,yCACAj8L,EAAAi8L,EAAA,EAAA,+BAEA,IAAA/oN,EAfA,SAAA8oN,EAAA53L,GACA,OAAA43L,EAAA3tC,YACA2tC,EAAA3tC,YAAAjqJ,GAEA,IAAA43L,EAAA53L,GAWA8uP,CAAAl3D,EAAAC,GAGA,OADA90L,KAAA,gBADA,OAAA6yL,EAAA,KAAA,OACA9mN,EAAAqyJ,GACAryJ,GAGAgiN,EAAApwL,UAAAquP,eAAA,SAAAjgR,EAAAqyJ,GAIA,IAHA,IAAAp1B,EAAA,EACA60B,EAAA,EAEA12J,EAAA,EAAAw9B,EAAA,EAAAx9B,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAq7C,EAAAxiB,KAAAgzL,MAAA7rN,IAAAw9B,EAAAk5H,EAEA9xJ,EAAAi9H,KAAA,IAAAxmF,EACAwmF,EAAAj9H,EAAA9G,SACA8G,EAAAi9H,KAAAxmF,GAAA,EAAA,KAEAwmF,EAAAj9H,EAAA9G,SACA8G,EAAAi9H,KAAAxmF,GAAA,GAAA,KAGA,IAAA7d,GACAqkG,EAAAj9H,EAAA9G,SACA8G,EAAAi9H,KAAAxmF,GAAA,GAAA,KAEAq7G,EAAA,EACAl5H,EAAA,IAEAk5H,EAAAr7G,IAAA,GACA7d,GAAA,GAIA,GAAAqkG,EAAAj9H,EAAA9G,OAGA,IAFA8G,EAAAi9H,KAAA60B,EAEA70B,EAAAj9H,EAAA9G,QACA8G,EAAAi9H,KAAA,GAKA+kF,EAAApwL,UAAAsuP,eAAA,SAAAlgR,EAAAqyJ,GAIA,IAHA,IAAAp1B,EAAAj9H,EAAA9G,OAAA,EACA44J,EAAA,EAEA12J,EAAA,EAAAw9B,EAAA,EAAAx9B,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAq7C,EAAAxiB,KAAAgzL,MAAA7rN,IAAAw9B,EAAAk5H,EAEA9xJ,EAAAi9H,KAAA,IAAAxmF,EACAwmF,GAAA,IACAj9H,EAAAi9H,KAAAxmF,GAAA,EAAA,KAEAwmF,GAAA,IACAj9H,EAAAi9H,KAAAxmF,GAAA,GAAA,KAGA,IAAA7d,GACAqkG,GAAA,IACAj9H,EAAAi9H,KAAAxmF,GAAA,GAAA,KAEAq7G,EAAA,EACAl5H,EAAA,IAEAk5H,EAAAr7G,IAAA,GACA7d,GAAA,GAIA,GAAAqkG,GAAA,EAGA,IAFAj9H,EAAAi9H,KAAA60B,EAEA70B,GAAA,GACAj9H,EAAAi9H,KAAA,GAKApjI,KAAAovN,MACAjH,EAAApwL,UAAAs3L,WAAA,SAAAxwE,GACA,OAAA,GAAA7+I,KAAAovN,MAAAvwE,IAGAspE,EAAApwL,UAAAs3L,WAAA,SAAAxwE,GACA,IAAA1lE,EAAA0lE,EACAz2G,EAAA,EAiBA,OAhBA+wC,GAAA,OACA/wC,GAAA,GACA+wC,KAAA,IAEAA,GAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEAA,GAAA,IACA/wC,GAAA,EACA+wC,KAAA,GAEAA,GAAA,IACA/wC,GAAA,EACA+wC,KAAA,GAEA/wC,EAAA+wC,GAIAgvI,EAAApwL,UAAAu3L,UAAA,SAAAzwE,GAEA,GAAA,IAAAA,EAAA,OAAA,GAEA,IAAA1lE,EAAA0lE,EACAz2G,EAAA,EAoBA,OAnBA,IAAA,KAAA+wC,KACA/wC,GAAA,GACA+wC,KAAA,IAEA,IAAA,IAAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEA,IAAA,GAAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEA,IAAA,EAAAA,KACA/wC,GAAA,EACA+wC,KAAA,GAEA,IAAA,EAAAA,IACA/wC,IAEAA,GAIA+/K,EAAApwL,UAAAszK,UAAA,WACA,IAAAxsD,EAAAzkH,KAAAgzL,MAAAhzL,KAAA/6B,OAAA,GACAo+K,EAAArjJ,KAAAi1L,WAAAxwE,GACA,OAAA,IAAAzkH,KAAA/6B,OAAA,GAAAo+K,GAiBA0qC,EAAApwL,UAAAw3L,SAAA,WACA,GAAAn1L,KAAA6uL,SAAA,OAAA,EAGA,IADA,IAAA7gL,EAAA,EACA7mC,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAmS,EAAA0mB,KAAAk1L,UAAAl1L,KAAAgzL,MAAA7rN,IAEA,GADA6mC,GAAA10B,EACA,KAAAA,EAAA,MAEA,OAAA00B,GAGA+/K,EAAApwL,UAAAygI,WAAA,WACA,OAAAx4J,KAAAwhL,KAAApnJ,KAAAixK,YAAA,IAGA8c,EAAApwL,UAAAy3L,OAAA,SAAAlnI,GACA,OAAA,IAAAluD,KAAA+yL,SACA/yL,KAAAm6J,MAAAk7B,MAAAnnI,GAAAonI,MAAA,GAEAt1L,KAAAq1B,SAGA04J,EAAApwL,UAAA43L,SAAA,SAAArnI,GACA,OAAAluD,KAAAw1L,MAAAtnI,EAAA,GACAluD,KAAAy1L,KAAAvnI,GAAAonI,MAAA,GAAAI,OAEA11L,KAAAq1B,SAGA04J,EAAApwL,UAAAg4L,MAAA,WACA,OAAA,IAAA31L,KAAA+yL,UAIAhF,EAAApwL,UAAAi4L,IAAA,WACA,OAAA51L,KAAAq1B,QAAAqgK,QAGA3H,EAAApwL,UAAA+3L,KAAA,WAKA,OAJA11L,KAAA6uL,WACA7uL,KAAA+yL,UAAA,GAGA/yL,MAIA+tL,EAAApwL,UAAAk4L,KAAA,SAAAnkL,GACA,KAAA1R,KAAA/6B,OAAAysC,EAAAzsC,QACA+6B,KAAAgzL,MAAAhzL,KAAA/6B,UAAA,EAGA,IAAA,IAAAkC,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAAAuqC,EAAAshL,MAAA7rN,GAGA,OAAA64B,KAAAsiM,UAGAvU,EAAApwL,UAAAm4L,IAAA,SAAApkL,GAEA,OADA7Y,EAAA,IAAAmH,KAAA+yL,SAAArhL,EAAAqhL,WACA/yL,KAAA61L,KAAAnkL,IAIAq8K,EAAApwL,UAAA+yB,GAAA,SAAAhf,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAAygK,IAAApkL,GACAA,EAAA2jB,QAAAygK,IAAA91L,OAGA+tL,EAAApwL,UAAAo4L,IAAA,SAAArkL,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAAwgK,KAAAnkL,GACAA,EAAA2jB,QAAAwgK,KAAA71L,OAIA+tL,EAAApwL,UAAAq4L,MAAA,SAAAtkL,GAEA,IAAAp4B,EAEAA,EADA0mB,KAAA/6B,OAAAysC,EAAAzsC,OACAysC,EAEA1R,KAGA,IAAA,IAAA74B,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAAAuqC,EAAAshL,MAAA7rN,GAKA,OAFA64B,KAAA/6B,OAAAqU,EAAArU,OAEA+6B,KAAAsiM,UAGAvU,EAAApwL,UAAAs4L,KAAA,SAAAvkL,GAEA,OADA7Y,EAAA,IAAAmH,KAAA+yL,SAAArhL,EAAAqhL,WACA/yL,KAAAg2L,MAAAtkL,IAIAq8K,EAAApwL,UAAA8yB,IAAA,SAAA/e,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA4gK,KAAAvkL,GACAA,EAAA2jB,QAAA4gK,KAAAj2L,OAGA+tL,EAAApwL,UAAAu4L,KAAA,SAAAxkL,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA2gK,MAAAtkL,GACAA,EAAA2jB,QAAA2gK,MAAAh2L,OAIA+tL,EAAApwL,UAAAw4L,MAAA,SAAAzkL,GAEA,IAAA7qC,EACAyS,EACA0mB,KAAA/6B,OAAAysC,EAAAzsC,QACA4B,EAAAm5B,KACA1mB,EAAAo4B,IAEA7qC,EAAA6qC,EACAp4B,EAAA0mB,MAGA,IAAA,IAAA74B,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAAAmS,EAAA05M,MAAA7rN,GAGA,GAAA64B,OAAAn5B,EACA,KAAAM,EAAAN,EAAA5B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAMA,OAFA64B,KAAA/6B,OAAA4B,EAAA5B,OAEA+6B,KAAAsiM,UAGAvU,EAAApwL,UAAAy4L,KAAA,SAAA1kL,GAEA,OADA7Y,EAAA,IAAAmH,KAAA+yL,SAAArhL,EAAAqhL,WACA/yL,KAAAm2L,MAAAzkL,IAIAq8K,EAAApwL,UAAAosK,IAAA,SAAAr4J,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA+gK,KAAA1kL,GACAA,EAAA2jB,QAAA+gK,KAAAp2L,OAGA+tL,EAAApwL,UAAA04L,KAAA,SAAA3kL,GACA,OAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA8gK,MAAAzkL,GACAA,EAAA2jB,QAAA8gK,MAAAn2L,OAIA+tL,EAAApwL,UAAA03L,MAAA,SAAAnnI,GACAr1D,EAAA,iBAAAq1D,GAAAA,GAAA,GAEA,IAAAooI,EAAA,EAAA1wN,KAAAwhL,KAAAl5F,EAAA,IACAqoI,EAAAroI,EAAA,GAGAluD,KAAA+zL,QAAAuC,GAEAC,EAAA,GACAD,IAIA,IAAA,IAAAnvN,EAAA,EAAAA,EAAAmvN,EAAAnvN,IACA64B,KAAAgzL,MAAA7rN,GAAA,UAAA64B,KAAAgzL,MAAA7rN,GASA,OALAovN,EAAA,IACAv2L,KAAAgzL,MAAA7rN,IAAA64B,KAAAgzL,MAAA7rN,GAAA,UAAA,GAAAovN,GAIAv2L,KAAAsiM,UAGAvU,EAAApwL,UAAA83L,KAAA,SAAAvnI,GACA,OAAAluD,KAAAq1B,QAAAggK,MAAAnnI,IAIA6/H,EAAApwL,UAAA64L,KAAA,SAAAC,EAAA98L,GACAd,EAAA,iBAAA49L,GAAAA,GAAA,GAEA,IAAAlhE,EAAAkhE,EAAA,GAAA,EACAC,EAAAD,EAAA,GAUA,OARAz2L,KAAA+zL,QAAAx+D,EAAA,GAGAv1H,KAAAgzL,MAAAz9D,GADA57H,EACAqG,KAAAgzL,MAAAz9D,GAAA,GAAAmhE,EAEA12L,KAAAgzL,MAAAz9D,KAAA,GAAAmhE,GAGA12L,KAAAsiM,UAIAvU,EAAApwL,UAAAyxL,KAAA,SAAA19K,GACA,IAAA1D,EAkBAnnC,EAAAyS,EAfA,GAAA,IAAA0mB,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAIA,OAHA/yL,KAAA+yL,SAAA,EACA/kL,EAAAhO,KAAAqvL,KAAA39K,GACA1R,KAAA+yL,UAAA,EACA/yL,KAAAg0L,YAGA,GAAA,IAAAh0L,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAIA,OAHArhL,EAAAqhL,SAAA,EACA/kL,EAAAhO,KAAAqvL,KAAA39K,GACAA,EAAAqhL,SAAA,EACA/kL,EAAAgmL,YAKAh0L,KAAA/6B,OAAAysC,EAAAzsC,QACA4B,EAAAm5B,KACA1mB,EAAAo4B,IAEA7qC,EAAA6qC,EACAp4B,EAAA0mB,MAIA,IADA,IAAA69H,EAAA,EACA12J,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IACA6mC,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,KAAA,EAAAmS,EAAA05M,MAAA7rN,IAAA02J,EACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EACA6vH,EAAA7vH,IAAA,GAEA,KAAA,IAAA6vH,GAAA12J,EAAAN,EAAA5B,OAAAkC,IACA6mC,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,IAAA02J,EACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EACA6vH,EAAA7vH,IAAA,GAIA,GADAhO,KAAA/6B,OAAA4B,EAAA5B,OACA,IAAA44J,EACA79H,KAAAgzL,MAAAhzL,KAAA/6B,QAAA44J,EACA79H,KAAA/6B,cAEA,GAAA4B,IAAAm5B,KACA,KAAA74B,EAAAN,EAAA5B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAIA,OAAA64B,MAIA+tL,EAAApwL,UAAA3e,IAAA,SAAA0yB,GACA,IAAA3lC,EACA,OAAA,IAAA2lC,EAAAqhL,UAAA,IAAA/yL,KAAA+yL,UACArhL,EAAAqhL,SAAA,EACAhnN,EAAAi0B,KAAAsxB,IAAA5f,GACAA,EAAAqhL,UAAA,EACAhnN,GACA,IAAA2lC,EAAAqhL,UAAA,IAAA/yL,KAAA+yL,UACA/yL,KAAA+yL,SAAA,EACAhnN,EAAA2lC,EAAA4f,IAAAtxB,MACAA,KAAA+yL,SAAA,EACAhnN,GAGAi0B,KAAA/6B,OAAAysC,EAAAzsC,OAAA+6B,KAAAq1B,QAAA+5J,KAAA19K,GAEAA,EAAA2jB,QAAA+5J,KAAApvL,OAIA+tL,EAAApwL,UAAA0xL,KAAA,SAAA39K,GAEA,GAAA,IAAAA,EAAAqhL,SAAA,CACArhL,EAAAqhL,SAAA,EACA,IAAA/kL,EAAAhO,KAAAovL,KAAA19K,GAEA,OADAA,EAAAqhL,SAAA,EACA/kL,EAAAgmL,YAGA,GAAA,IAAAh0L,KAAA+yL,SAIA,OAHA/yL,KAAA+yL,SAAA,EACA/yL,KAAAovL,KAAA19K,GACA1R,KAAA+yL,SAAA,EACA/yL,KAAAg0L,YAIA,IAWAntN,EAAAyS,EAXA6tB,EAAAnH,KAAAmH,IAAAuK,GAGA,GAAA,IAAAvK,EAIA,OAHAnH,KAAA+yL,SAAA,EACA/yL,KAAA/6B,OAAA,EACA+6B,KAAAgzL,MAAA,GAAA,EACAhzL,KAKAmH,EAAA,GACAtgC,EAAAm5B,KACA1mB,EAAAo4B,IAEA7qC,EAAA6qC,EACAp4B,EAAA0mB,MAIA,IADA,IAAA69H,EAAA,EACA12J,EAAA,EAAAA,EAAAmS,EAAArU,OAAAkC,IAEA02J,GADA7vH,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,KAAA,EAAAmS,EAAA05M,MAAA7rN,IAAA02J,IACA,GACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EAEA,KAAA,IAAA6vH,GAAA12J,EAAAN,EAAA5B,OAAAkC,IAEA02J,GADA7vH,GAAA,EAAAnnC,EAAAmsN,MAAA7rN,IAAA02J,IACA,GACA79H,KAAAgzL,MAAA7rN,GAAA,SAAA6mC,EAIA,GAAA,IAAA6vH,GAAA12J,EAAAN,EAAA5B,QAAA4B,IAAAm5B,KACA,KAAA74B,EAAAN,EAAA5B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAAN,EAAAmsN,MAAA7rN,GAUA,OANA64B,KAAA/6B,OAAAW,KAAAD,IAAAq6B,KAAA/6B,OAAAkC,GAEAN,IAAAm5B,OACAA,KAAA+yL,SAAA,GAGA/yL,KAAAsiM,UAIAvU,EAAApwL,UAAA2zB,IAAA,SAAA5f,GACA,OAAA1R,KAAAq1B,QAAAg6J,KAAA39K,IA+CA,IAAAilL,EAAA,SAAAr3L,EAAAoS,EAAAqvB,GACA,IAIAuiH,EACA91I,EACA61I,EANAx8K,EAAAy4B,EAAA0zL,MACA15M,EAAAo4B,EAAAshL,MACA9iH,EAAAnvC,EAAAiyJ,MACAvmN,EAAA,EAIAmqN,EAAA,EAAA/vN,EAAA,GACAgwN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAlwN,EAAA,GACAmwN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAjzB,EAAA,EAAAj9L,EAAA,GACAqwN,EAAA,KAAApzB,EACAqzB,EAAArzB,IAAA,GACAszB,EAAA,EAAAvwN,EAAA,GACAwwN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAA1wN,EAAA,GACA2wN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAA7wN,EAAA,GACA8wN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAhxN,EAAA,GACAixN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAnxN,EAAA,GACAoxN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAtxN,EAAA,GACAuxN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAG,EAAA,EAAAzxN,EAAA,GACA0xN,EAAA,KAAAD,EACAE,EAAAF,IAAA,GACAzP,EAAA,EAAAvvM,EAAA,GACAm/M,EAAA,KAAA5P,EACA6P,EAAA7P,IAAA,GACAp6B,EAAA,EAAAn1K,EAAA,GACAq/M,EAAA,KAAAlqC,EACAmqC,EAAAnqC,IAAA,GACAJ,EAAA,EAAA/0K,EAAA,GACAu/M,EAAA,KAAAxqC,EACAyqC,EAAAzqC,IAAA,GACAy6B,EAAA,EAAAxvM,EAAA,GACAy/M,EAAA,KAAAjQ,EACAkQ,EAAAlQ,IAAA,GACAC,EAAA,EAAAzvM,EAAA,GACA2/M,EAAA,KAAAlQ,EACAmQ,GAAAnQ,IAAA,GACAC,GAAA,EAAA1vM,EAAA,GACA6/M,GAAA,KAAAnQ,GACAoQ,GAAApQ,KAAA,GACAC,GAAA,EAAA3vM,EAAA,GACA+/M,GAAA,KAAApQ,GACAqQ,GAAArQ,KAAA,GACAC,GAAA,EAAA5vM,EAAA,GACAigN,GAAA,KAAArQ,GACAsQ,GAAAtQ,KAAA,GACAC,GAAA,EAAA7vM,EAAA,GACAmgN,GAAA,KAAAtQ,GACAuQ,GAAAvQ,KAAA,GACAC,GAAA,EAAA9vM,EAAA,GACAqgN,GAAA,KAAAvQ,GACAwQ,GAAAxQ,KAAA,GAEAroJ,EAAAgyJ,SAAAzzL,EAAAyzL,SAAArhL,EAAAqhL,SACAhyJ,EAAA97D,OAAA,GAMA,IAAA40N,IAAAptN,GAJA62K,EAAA19K,KAAA2pN,KAAAsH,EAAA4B,IAIA,KAAA,MAFAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA6B,IACA9yN,KAAA2pN,KAAAuH,EAAA2B,GAAA,KAEA,IAAA,EACAhsN,IAFA42K,EAAAz9K,KAAA2pN,KAAAuH,EAAA4B,KAEAlrL,IAAA,IAAA,IAAAqsL,KAAA,IAAA,EACAA,IAAA,SAEAv2C,EAAA19K,KAAA2pN,KAAAyH,EAAAyB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA0B,IACA9yN,KAAA2pN,KAAA0H,EAAAwB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA0H,EAAAyB,GAKA,IAAAoB,IAAArtN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA8B,GAAA,GAIA,KAAA,MAFAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA+B,GAAA,GACAhzN,KAAA2pN,KAAAuH,EAAA6B,GAAA,KAEA,IAAA,EACAlsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA8B,GAAA,IAEAprL,IAAA,IAAA,IAAAssL,KAAA,IAAA,EACAA,IAAA,SAEAx2C,EAAA19K,KAAA2pN,KAAA2H,EAAAuB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAwB,IACA9yN,KAAA2pN,KAAA4H,EAAAsB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA4H,EAAAuB,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA2B,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA4B,GAAA,GACAhzN,KAAA2pN,KAAA0H,EAAA0B,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA2B,GAAA,EAKA,IAAAzV,IAAA12M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAgC,GAAA,GAIA,KAAA,MAFArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAiC,GAAA,GACAlzN,KAAA2pN,KAAAuH,EAAA+B,GAAA,KAEA,IAAA,EACApsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAgC,GAAA,IAEAtrL,IAAA,IAAA,IAAA21K,KAAA,IAAA,EACAA,IAAA,SAEA7/B,EAAA19K,KAAA2pN,KAAA8H,EAAAoB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAqB,IACA9yN,KAAA2pN,KAAA+H,EAAAmB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA+H,EAAAoB,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAyB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA0B,GAAA,GACAhzN,KAAA2pN,KAAA4H,EAAAwB,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAyB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA6B,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA8B,GAAA,GACAlzN,KAAA2pN,KAAA0H,EAAA4B,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA6B,GAAA,EAKA,IAAAiB,IAAAttN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAkC,GAAA,GAIA,KAAA,MAFAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAmC,GAAA,GACApzN,KAAA2pN,KAAAuH,EAAAiC,GAAA,KAEA,IAAA,EACAtsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAkC,GAAA,IAEAxrL,IAAA,IAAA,IAAAusL,KAAA,IAAA,EACAA,IAAA,SAEAz2C,EAAA19K,KAAA2pN,KAAAiI,EAAAiB,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAkB,IACA9yN,KAAA2pN,KAAAkI,EAAAgB,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAkI,EAAAiB,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAsB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAuB,GAAA,GACAhzN,KAAA2pN,KAAA+H,EAAAqB,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAsB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAA2B,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA4B,GAAA,GACAlzN,KAAA2pN,KAAA4H,EAAA0B,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAA2B,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA+B,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAgC,GAAA,GACApzN,KAAA2pN,KAAA0H,EAAA8B,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA+B,GAAA,EAKA,IAAAgB,IAAAvtN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAoC,GAAA,GAIA,KAAA,MAFAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAqC,IAAA,GACAtzN,KAAA2pN,KAAAuH,EAAAmC,GAAA,KAEA,IAAA,EACAxsN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAoC,IAAA,IAEA1rL,IAAA,IAAA,IAAAwsL,KAAA,IAAA,EACAA,IAAA,SAEA12C,EAAA19K,KAAA2pN,KAAAoI,EAAAc,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAe,IACA9yN,KAAA2pN,KAAAqI,EAAAa,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAqI,EAAAc,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAmB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAoB,GAAA,GACAhzN,KAAA2pN,KAAAkI,EAAAkB,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAmB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAwB,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAyB,GAAA,GACAlzN,KAAA2pN,KAAA+H,EAAAuB,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAwB,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAA6B,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA8B,GAAA,GACApzN,KAAA2pN,KAAA4H,EAAA4B,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAA6B,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAiC,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAkC,IAAA,GACAtzN,KAAA2pN,KAAA0H,EAAAgC,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAiC,IAAA,EAKA,IAAAe,IAAAxtN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAsC,IAAA,GAIA,KAAA,MAFA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAuC,IAAA,GACAxzN,KAAA2pN,KAAAuH,EAAAqC,IAAA,KAEA,IAAA,EACA1sN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAsC,IAAA,IAEA5rL,IAAA,IAAA,IAAAysL,KAAA,IAAA,EACAA,IAAA,SAEA32C,EAAA19K,KAAA2pN,KAAAuI,EAAAW,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAY,IACA9yN,KAAA2pN,KAAAwI,EAAAU,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAwI,EAAAW,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAgB,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAiB,GAAA,GACAhzN,KAAA2pN,KAAAqI,EAAAe,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAgB,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAqB,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAsB,GAAA,GACAlzN,KAAA2pN,KAAAkI,EAAAoB,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAqB,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAA0B,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAA2B,GAAA,GACApzN,KAAA2pN,KAAA+H,EAAAyB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAA0B,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAA+B,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAgC,IAAA,GACAtzN,KAAA2pN,KAAA4H,EAAA8B,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAA+B,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAmC,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAoC,IAAA,GACAxzN,KAAA2pN,KAAA0H,EAAAkC,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAmC,IAAA,EAKA,IAAAc,IAAAztN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAAwC,IAAA,GAIA,KAAA,MAFA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAAyC,IAAA,GACA1zN,KAAA2pN,KAAAuH,EAAAuC,IAAA,KAEA,IAAA,EACA5sN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAAwC,IAAA,IAEA9rL,IAAA,IAAA,IAAA0sL,KAAA,IAAA,EACAA,IAAA,SAEA52C,EAAA19K,KAAA2pN,KAAA0I,EAAAQ,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAS,IACA9yN,KAAA2pN,KAAA2I,EAAAO,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA2I,EAAAQ,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAa,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAc,GAAA,GACAhzN,KAAA2pN,KAAAwI,EAAAY,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAa,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAkB,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAmB,GAAA,GACAlzN,KAAA2pN,KAAAqI,EAAAiB,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAkB,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAuB,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAwB,GAAA,GACApzN,KAAA2pN,KAAAkI,EAAAsB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAuB,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAA4B,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAA6B,IAAA,GACAtzN,KAAA2pN,KAAA+H,EAAA2B,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAA4B,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAiC,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAkC,IAAA,GACAxzN,KAAA2pN,KAAA4H,EAAAgC,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAiC,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAqC,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAsC,IAAA,GACA1zN,KAAA2pN,KAAA0H,EAAAoC,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAqC,IAAA,EAKA,IAAAlW,IAAA32M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA0C,IAAA,GAIA,KAAA,MAFA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA2C,IAAA,GACA5zN,KAAA2pN,KAAAuH,EAAAyC,IAAA,KAEA,IAAA,EACA9sN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA0C,IAAA,IAEAhsL,IAAA,IAAA,IAAA41K,KAAA,IAAA,EACAA,IAAA,SAEA9/B,EAAA19K,KAAA2pN,KAAA6I,EAAAK,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAM,IACA9yN,KAAA2pN,KAAA8I,EAAAI,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAA8I,EAAAK,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAU,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAW,GAAA,GACAhzN,KAAA2pN,KAAA2I,EAAAS,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAU,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAe,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAgB,GAAA,GACAlzN,KAAA2pN,KAAAwI,EAAAc,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAe,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAoB,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAqB,GAAA,GACApzN,KAAA2pN,KAAAqI,EAAAmB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAoB,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAyB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAA0B,IAAA,GACAtzN,KAAA2pN,KAAAkI,EAAAwB,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAyB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAA8B,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAA+B,IAAA,GACAxzN,KAAA2pN,KAAA+H,EAAA6B,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAA8B,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAmC,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAoC,IAAA,GACA1zN,KAAA2pN,KAAA4H,EAAAkC,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAmC,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAuC,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAAwC,IAAA,GACA5zN,KAAA2pN,KAAA0H,EAAAsC,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAuC,IAAA,EAKA,IAAAW,IAAA1tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA4C,IAAA,GAIA,KAAA,MAFAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA6C,IAAA,GACA9zN,KAAA2pN,KAAAuH,EAAA2C,IAAA,KAEA,IAAA,EACAhtN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA4C,IAAA,IAEAlsL,IAAA,IAAA,IAAA2sL,KAAA,IAAA,EACAA,IAAA,SAEA72C,EAAA19K,KAAA2pN,KAAAgJ,EAAAE,GAEAjrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAG,IACA9yN,KAAA2pN,KAAAiJ,EAAAC,GAAA,EACAp1C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAE,GACAp1C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAO,GAAA,EAEAnrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAQ,GAAA,GACAhzN,KAAA2pN,KAAA8I,EAAAM,GAAA,EACAt1C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAO,GAAA,EACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAY,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAa,GAAA,GACAlzN,KAAA2pN,KAAA2I,EAAAW,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAY,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAiB,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAkB,GAAA,GACApzN,KAAA2pN,KAAAwI,EAAAgB,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAiB,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAsB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAuB,IAAA,GACAtzN,KAAA2pN,KAAAqI,EAAAqB,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAsB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAA2B,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAA4B,IAAA,GACAxzN,KAAA2pN,KAAAkI,EAAA0B,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAA2B,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAgC,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAiC,IAAA,GACA1zN,KAAA2pN,KAAA+H,EAAA+B,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAgC,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAqC,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAsC,IAAA,GACA5zN,KAAA2pN,KAAA4H,EAAAoC,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAqC,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAAyC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA0C,IAAA,GACA9zN,KAAA2pN,KAAA0H,EAAAwC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAAyC,IAAA,EAKA,IAAAU,IAAA3tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAsH,EAAA8C,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAsH,EAAA+C,IAAA,GACAh0N,KAAA2pN,KAAAuH,EAAA6C,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAuH,EAAA8C,IAAA,IAEApsL,IAAA,IAAA,IAAA4sL,KAAA,IAAA,EACAA,IAAA,SAEA92C,EAAA19K,KAAA2pN,KAAAgJ,EAAAI,GAEAnrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAK,IACAhzN,KAAA2pN,KAAAiJ,EAAAG,GAAA,EACAt1C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAI,GACAt1C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAS,GAAA,EAEArrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAU,GAAA,GACAlzN,KAAA2pN,KAAA8I,EAAAQ,GAAA,EACAx1C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAS,GAAA,EACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAc,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAe,GAAA,GACApzN,KAAA2pN,KAAA2I,EAAAa,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAc,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAmB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAoB,IAAA,GACAtzN,KAAA2pN,KAAAwI,EAAAkB,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAmB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAwB,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAyB,IAAA,GACAxzN,KAAA2pN,KAAAqI,EAAAuB,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAwB,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAA6B,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAA8B,IAAA,GACA1zN,KAAA2pN,KAAAkI,EAAA4B,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAA6B,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAkC,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAmC,IAAA,GACA5zN,KAAA2pN,KAAA+H,EAAAiC,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAkC,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAuC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAAwC,IAAA,GACA9zN,KAAA2pN,KAAA4H,EAAAsC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAuC,IAAA,EAKA,IAAAW,IAAA5tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAyH,EAAA2C,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAyH,EAAA4C,IAAA,GACAh0N,KAAA2pN,KAAA0H,EAAA0C,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA0H,EAAA2C,IAAA,IAEApsL,IAAA,IAAA,IAAA6sL,KAAA,IAAA,EACAA,IAAA,SAEA/2C,EAAA19K,KAAA2pN,KAAAgJ,EAAAM,GAEArrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAO,IACAlzN,KAAA2pN,KAAAiJ,EAAAK,GAAA,EACAx1C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAM,GACAx1C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAW,GAAA,EAEAvrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAY,GAAA,GACApzN,KAAA2pN,KAAA8I,EAAAU,GAAA,EACA11C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAW,GAAA,EACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAgB,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAiB,IAAA,GACAtzN,KAAA2pN,KAAA2I,EAAAe,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAgB,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAqB,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAsB,IAAA,GACAxzN,KAAA2pN,KAAAwI,EAAAoB,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAqB,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAA0B,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAA2B,IAAA,GACA1zN,KAAA2pN,KAAAqI,EAAAyB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAA0B,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAA+B,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAgC,IAAA,GACA5zN,KAAA2pN,KAAAkI,EAAA8B,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAA+B,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAoC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAqC,IAAA,GACA9zN,KAAA2pN,KAAA+H,EAAAmC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAoC,IAAA,EAKA,IAAAY,IAAA7tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA2H,EAAAyC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA2H,EAAA0C,IAAA,GACAh0N,KAAA2pN,KAAA4H,EAAAwC,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA4H,EAAAyC,IAAA,IAEApsL,IAAA,IAAA,IAAA8sL,KAAA,IAAA,EACAA,IAAA,SAEAh3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAQ,GAEAvrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAS,IACApzN,KAAA2pN,KAAAiJ,EAAAO,GAAA,EACA11C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAQ,GACA11C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAa,GAAA,EAEAzrL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAc,IAAA,GACAtzN,KAAA2pN,KAAA8I,EAAAY,GAAA,EACA51C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAa,IAAA,EACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAkB,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAmB,IAAA,GACAxzN,KAAA2pN,KAAA2I,EAAAiB,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAkB,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAuB,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAAwB,IAAA,GACA1zN,KAAA2pN,KAAAwI,EAAAsB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAuB,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAA4B,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAA6B,IAAA,GACA5zN,KAAA2pN,KAAAqI,EAAA2B,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAA4B,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAiC,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAkC,IAAA,GACA9zN,KAAA2pN,KAAAkI,EAAAgC,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAiC,IAAA,EAKA,IAAAa,IAAA9tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA8H,EAAAsC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA8H,EAAAuC,IAAA,GACAh0N,KAAA2pN,KAAA+H,EAAAqC,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA+H,EAAAsC,IAAA,IAEApsL,IAAA,IAAA,IAAA+sL,KAAA,IAAA,EACAA,IAAA,SAEAj3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAU,GAEAzrL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAW,KACAtzN,KAAA2pN,KAAAiJ,EAAAS,GAAA,EACA51C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAU,IACA51C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAe,IAAA,EAEA3rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAgB,IAAA,GACAxzN,KAAA2pN,KAAA8I,EAAAc,IAAA,EACA91C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAe,IAAA,EACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAoB,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAqB,IAAA,GACA1zN,KAAA2pN,KAAA2I,EAAAmB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAoB,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAAyB,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAA0B,IAAA,GACA5zN,KAAA2pN,KAAAwI,EAAAwB,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAAyB,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAA8B,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAA+B,IAAA,GACA9zN,KAAA2pN,KAAAqI,EAAA6B,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAA8B,IAAA,EAKA,IAAAc,IAAA/tN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAiI,EAAAmC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAiI,EAAAoC,IAAA,GACAh0N,KAAA2pN,KAAAkI,EAAAkC,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAkI,EAAAmC,IAAA,IAEApsL,IAAA,IAAA,IAAAgtL,KAAA,IAAA,EACAA,IAAA,SAEAl3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAY,IAEA3rL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAa,KACAxzN,KAAA2pN,KAAAiJ,EAAAW,IAAA,EACA91C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAY,IACA91C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAiB,IAAA,EAEA7rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAkB,IAAA,GACA1zN,KAAA2pN,KAAA8I,EAAAgB,IAAA,EACAh2C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAiB,IAAA,EACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAsB,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAuB,IAAA,GACA5zN,KAAA2pN,KAAA2I,EAAAqB,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAsB,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAA2B,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAA4B,IAAA,GACA9zN,KAAA2pN,KAAAwI,EAAA0B,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAA2B,IAAA,EAKA,IAAAe,IAAAhuN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAoI,EAAAgC,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAoI,EAAAiC,IAAA,GACAh0N,KAAA2pN,KAAAqI,EAAA+B,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAqI,EAAAgC,IAAA,IAEApsL,IAAA,IAAA,IAAAitL,KAAA,IAAA,EACAA,IAAA,SAEAn3C,EAAA19K,KAAA2pN,KAAAgJ,EAAAc,IAEA7rL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAe,KACA1zN,KAAA2pN,KAAAiJ,EAAAa,IAAA,EACAh2C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAc,IACAh2C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAmB,IAAA,EAEA/rL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAoB,IAAA,GACA5zN,KAAA2pN,KAAA8I,EAAAkB,IAAA,EACAl2C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAmB,IAAA,EACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAAwB,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAAyB,IAAA,GACA9zN,KAAA2pN,KAAA2I,EAAAuB,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAAwB,IAAA,EAKA,IAAArW,IAAA52M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAAuI,EAAA6B,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAAuI,EAAA8B,IAAA,GACAh0N,KAAA2pN,KAAAwI,EAAA4B,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAAwI,EAAA6B,IAAA,IAEApsL,IAAA,IAAA,IAAA61K,KAAA,IAAA,EACAA,IAAA,SAEA//B,EAAA19K,KAAA2pN,KAAAgJ,EAAAgB,IAEA/rL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAiB,KACA5zN,KAAA2pN,KAAAiJ,EAAAe,IAAA,EACAl2C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAgB,IACAl2C,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAqB,IAAA,EAEAjsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAsB,IAAA,GACA9zN,KAAA2pN,KAAA8I,EAAAoB,IAAA,EACAp2C,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAqB,IAAA,EAKA,IAAApW,IAAA72M,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA0I,EAAA0B,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA0I,EAAA2B,IAAA,GACAh0N,KAAA2pN,KAAA2I,EAAAyB,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA2I,EAAA0B,IAAA,IAEApsL,IAAA,IAAA,IAAA81K,KAAA,IAAA,EACAA,IAAA,SAEAhgC,EAAA19K,KAAA2pN,KAAAgJ,EAAAkB,IAEAjsL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAmB,KACA9zN,KAAA2pN,KAAAiJ,EAAAiB,IAAA,EACAp2C,EAAAz9K,KAAA2pN,KAAAiJ,EAAAkB,IAKA,IAAAgB,IAAAjuN,GAJA62K,EAAAA,EAAA19K,KAAA2pN,KAAA6I,EAAAuB,IAAA,GAIA,KAAA,MAFAnsL,GADAA,EAAAA,EAAA5nC,KAAA2pN,KAAA6I,EAAAwB,IAAA,GACAh0N,KAAA2pN,KAAA8I,EAAAsB,IAAA,KAEA,IAAA,EACAltN,IAFA42K,EAAAA,EAAAz9K,KAAA2pN,KAAA8I,EAAAuB,IAAA,IAEApsL,IAAA,IAAA,IAAAktL,KAAA,IAAA,EACAA,IAAA,SAMA,IAAAC,IAAAluN,GAJA62K,EAAA19K,KAAA2pN,KAAAgJ,EAAAoB,KAIA,KAAA,MAFAnsL,GADAA,EAAA5nC,KAAA2pN,KAAAgJ,EAAAqB,KACAh0N,KAAA2pN,KAAAiJ,EAAAmB,IAAA,KAEA,IAAA,EA0BA,OAzBAltN,IAFA42K,EAAAz9K,KAAA2pN,KAAAiJ,EAAAoB,MAEApsL,IAAA,IAAA,IAAAmtL,KAAA,IAAA,EACAA,IAAA,SACAzqH,EAAA,GAAA2pH,GACA3pH,EAAA,GAAA4pH,GACA5pH,EAAA,GAAAizG,GACAjzG,EAAA,GAAA6pH,GACA7pH,EAAA,GAAA8pH,GACA9pH,EAAA,GAAA+pH,GACA/pH,EAAA,GAAAgqH,GACAhqH,EAAA,GAAAkzG,GACAlzG,EAAA,GAAAiqH,GACAjqH,EAAA,GAAAkqH,GACAlqH,EAAA,IAAAmqH,GACAnqH,EAAA,IAAAoqH,GACApqH,EAAA,IAAAqqH,GACArqH,EAAA,IAAAsqH,GACAtqH,EAAA,IAAAuqH,GACAvqH,EAAA,IAAAmzG,GACAnzG,EAAA,IAAAozG,GACApzG,EAAA,IAAAwqH,GACAxqH,EAAA,IAAAyqH,GACA,IAAAluN,IACAyjG,EAAA,IAAAzjG,EACAs0D,EAAA97D,UAEA87D,GAQA,SAAAi6J,EAAA17L,EAAAoS,EAAAqvB,GACAA,EAAAgyJ,SAAArhL,EAAAqhL,SAAAzzL,EAAAyzL,SACAhyJ,EAAA97D,OAAAq6B,EAAAr6B,OAAAysC,EAAAzsC,OAIA,IAFA,IAAA44J,EAAA,EACAk9D,EAAA,EACA1mS,EAAA,EAAAA,EAAA0sI,EAAA97D,OAAA,EAAA5wE,IAAA,CAGA,IAAAggS,EAAA0G,EACAA,EAAA,EAGA,IAFA,IAAAzG,EAAA,SAAAz2D,EACA02D,EAAA3uN,KAAAq0B,IAAA5lG,EAAAq9G,EAAAzsC,OAAA,GACAqsB,EAAA1rB,KAAAD,IAAA,EAAAtxE,EAAAirG,EAAAr6B,OAAA,GAAAqsB,GAAAijM,EAAAjjM,IAAA,CACA,IAAAnqB,EAAA9yE,EAAAi9F,EAGA0c,GAFA,EAAA1O,EAAA0zL,MAAA7rN,KACA,EAAAuqC,EAAAshL,MAAA1hM,IAGAgyJ,EAAA,SAAAt1I,EAGAsmL,EAAA,UADAhxC,EAAAA,EAAAgxC,EAAA,GAIAyG,IAFA1G,GAHAA,EAAAA,GAAArmL,EAAA,SAAA,GAAA,IAGAs1I,IAAA,IAAA,KAEA,GACA+wC,GAAA,SAEAtzJ,EAAAiyJ,MAAA3+R,GAAAigS,EACAz2D,EAAAw2D,EACAA,EAAA0G,EAQA,OANA,IAAAl9D,EACA98F,EAAAiyJ,MAAA3+R,GAAAwpO,EAEA98F,EAAA97D,SAGA87D,EAAAuhK,SAGA,SAAA1H,EAAAt7L,EAAAoS,EAAAqvB,GAIA,OAAAi6J,EAAA17L,EAAAoS,EAAAqvB,GAsBA,SAAA85J,EAAAjtL,EAAAC,GACA7N,KAAA4N,EAAAA,EACA5N,KAAA6N,EAAAA,EAzEAjoC,KAAA2pN,OACAoH,EAAAvC,GAmDArG,EAAApwL,UAAA47K,MAAA,SAAA7nK,EAAAqvB,GACA,IACA39B,EAAApD,KAAA/6B,OAAAysC,EAAAzsC,OAWA,OAVA,KAAA+6B,KAAA/6B,QAAA,KAAAysC,EAAAzsC,OACA0xN,EAAA32L,KAAA0R,EAAAqvB,GACA39B,EAAA,GACAgxL,EAAAp0L,KAAA0R,EAAAqvB,GACA39B,EAAA,KACA43L,EAAAh7L,KAAA0R,EAAAqvB,GAEA65J,EAAA56L,KAAA0R,EAAAqvB,IAcA85J,EAAAl9L,UAAAs9L,QAAA,SAAA12E,GAGA,IAFA,IAAAxlE,EAAA,IAAAlhD,MAAA0mH,GACAx7H,EAAAglM,EAAApwL,UAAAs3L,WAAA1wE,GAAA,EACAp9I,EAAA,EAAAA,EAAAo9I,EAAAp9I,IACA43E,EAAA53E,GAAA64B,KAAAk7L,OAAA/zN,EAAA4hB,EAAAw7H,GAGA,OAAAxlE,GAIA87I,EAAAl9L,UAAAu9L,OAAA,SAAAttL,EAAA7kB,EAAAw7H,GACA,GAAA,IAAA32G,GAAAA,IAAA22G,EAAA,EAAA,OAAA32G,EAGA,IADA,IAAAutL,EAAA,EACAh0N,EAAA,EAAAA,EAAA4hB,EAAA5hB,IACAg0N,IAAA,EAAAvtL,IAAA7kB,EAAA5hB,EAAA,EACAymC,IAAA,EAGA,OAAAutL,GAKAN,EAAAl9L,UAAAy9L,QAAA,SAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAl3E,GACA,IAAA,IAAAp9I,EAAA,EAAAA,EAAAo9I,EAAAp9I,IACAq0N,EAAAr0N,GAAAm0N,EAAAD,EAAAl0N,IACAs0N,EAAAt0N,GAAAo0N,EAAAF,EAAAl0N,KAIA0zN,EAAAl9L,UAAAxZ,UAAA,SAAAm3M,EAAAC,EAAAC,EAAAC,EAAAl3E,EAAA82E,GACAr7L,KAAAo7L,QAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAl3E,GAEA,IAAA,IAAAroI,EAAA,EAAAA,EAAAqoI,EAAAroI,IAAA,EAMA,IALA,IAAA6M,EAAA7M,GAAA,EAEAw/M,EAAA91N,KAAA+1N,IAAA,EAAA/1N,KAAAg2N,GAAA7yM,GACA8yM,EAAAj2N,KAAAk2N,IAAA,EAAAl2N,KAAAg2N,GAAA7yM,GAEA7hB,EAAA,EAAAA,EAAAq9I,EAAAr9I,GAAA6hB,EAIA,IAHA,IAAAgzM,EAAAL,EACAM,EAAAH,EAEAvqM,EAAA,EAAAA,EAAApV,EAAAoV,IAAA,CACA,IAAAk+G,EAAAgsF,EAAAt0N,EAAAoqB,GACA2qM,EAAAR,EAAAv0N,EAAAoqB,GAEA4qM,EAAAV,EAAAt0N,EAAAoqB,EAAApV,GACAigN,EAAAV,EAAAv0N,EAAAoqB,EAAApV,GAEAkgN,EAAAL,EAAAG,EAAAF,EAAAG,EAEAA,EAAAJ,EAAAI,EAAAH,EAAAE,EACAA,EAAAE,EAEAZ,EAAAt0N,EAAAoqB,GAAAk+G,EAAA0sF,EACAT,EAAAv0N,EAAAoqB,GAAA2qM,EAAAE,EAEAX,EAAAt0N,EAAAoqB,EAAApV,GAAAszH,EAAA0sF,EACAT,EAAAv0N,EAAAoqB,EAAApV,GAAA+/M,EAAAE,EAGA7qM,IAAAvI,IACAqzM,EAAAV,EAAAK,EAAAF,EAAAG,EAEAA,EAAAN,EAAAM,EAAAH,EAAAE,EACAA,EAAAK,KAOAvB,EAAAl9L,UAAA0+L,YAAA,SAAApoS,EAAAirF,GACA,IAAAqlI,EAAA,EAAA3+I,KAAAD,IAAAuZ,EAAAjrF,GACAqoS,EAAA,EAAA/3E,EACAp9I,EAAA,EACA,IAAAo9I,EAAAA,EAAA,EAAA,EAAAA,EAAAA,KAAA,EACAp9I,IAGA,OAAA,GAAAA,EAAA,EAAAm1N,GAGAzB,EAAAl9L,UAAA4+L,UAAA,SAAAjB,EAAAC,EAAAh3E,GACA,KAAAA,GAAA,GAEA,IAAA,IAAAp9I,EAAA,EAAAA,EAAAo9I,EAAA,EAAAp9I,IAAA,CACA,IAAA43E,EAAAu8I,EAAAn0N,GAEAm0N,EAAAn0N,GAAAm0N,EAAA/2E,EAAAp9I,EAAA,GACAm0N,EAAA/2E,EAAAp9I,EAAA,GAAA43E,EAEAA,EAAAw8I,EAAAp0N,GAEAo0N,EAAAp0N,IAAAo0N,EAAAh3E,EAAAp9I,EAAA,GACAo0N,EAAAh3E,EAAAp9I,EAAA,IAAA43E,IAIA87I,EAAAl9L,UAAA6+L,aAAA,SAAA9+C,EAAAn5B,GAEA,IADA,IAAAsZ,EAAA,EACA12J,EAAA,EAAAA,EAAAo9I,EAAA,EAAAp9I,IAAA,CACA,IAAAs9I,EAAA,KAAA7+I,KAAAuoC,MAAAuvI,EAAA,EAAAv2K,EAAA,GAAAo9I,GACA3+I,KAAAuoC,MAAAuvI,EAAA,EAAAv2K,GAAAo9I,GACAsZ,EAEA6f,EAAAv2K,GAAA,SAAAs9I,EAGAoZ,EADApZ,EAAA,SACA,EAEAA,EAAA,SAAA,EAIA,OAAAi5B,GAGAm9C,EAAAl9L,UAAA8+L,WAAA,SAAA/+C,EAAAt6I,EAAAk4L,EAAA/2E,GAEA,IADA,IAAAsZ,EAAA,EACA12J,EAAA,EAAAA,EAAAi8B,EAAAj8B,IACA02J,GAAA,EAAA6f,EAAAv2K,GAEAm0N,EAAA,EAAAn0N,GAAA,KAAA02J,EAAAA,KAAA,GACAy9D,EAAA,EAAAn0N,EAAA,GAAA,KAAA02J,EAAAA,KAAA,GAIA,IAAA12J,EAAA,EAAAi8B,EAAAj8B,EAAAo9I,IAAAp9I,EACAm0N,EAAAn0N,GAAA,EAGA0xB,EAAA,IAAAglI,GACAhlI,EAAA,KAAA,KAAAglI,KAGAg9D,EAAAl9L,UAAA++L,KAAA,SAAAn4E,GAEA,IADA,IAAAo4E,EAAA,IAAA9+L,MAAA0mH,GACAp9I,EAAA,EAAAA,EAAAo9I,EAAAp9I,IACAw1N,EAAAx1N,GAAA,EAGA,OAAAw1N,GAGA9B,EAAAl9L,UAAAm9L,KAAA,SAAAltL,EAAAC,EAAAkzB,GACA,IAAAwjF,EAAA,EAAAvkH,KAAAq8L,YAAAzuL,EAAA3oC,OAAA4oC,EAAA5oC,QAEAo2N,EAAAr7L,KAAAi7L,QAAA12E,GAEAppI,EAAA6kB,KAAA08L,KAAAn4E,GAEA+2E,EAAA,IAAAz9L,MAAA0mH,GACAq4E,EAAA,IAAA/+L,MAAA0mH,GACAs4E,EAAA,IAAAh/L,MAAA0mH,GAEAu4E,EAAA,IAAAj/L,MAAA0mH,GACAw4E,EAAA,IAAAl/L,MAAA0mH,GACAy4E,EAAA,IAAAn/L,MAAA0mH,GAEA04E,EAAAl8J,EAAAiyJ,MACAiK,EAAAh4N,OAAAs/I,EAEAvkH,KAAAy8L,WAAA7uL,EAAAolL,MAAAplL,EAAA3oC,OAAAq2N,EAAA/2E,GACAvkH,KAAAy8L,WAAA5uL,EAAAmlL,MAAAnlL,EAAA5oC,OAAA63N,EAAAv4E,GAEAvkH,KAAA7b,UAAAm3M,EAAAngN,EAAAyhN,EAAAC,EAAAt4E,EAAA82E,GACAr7L,KAAA7b,UAAA24M,EAAA3hN,EAAA4hN,EAAAC,EAAAz4E,EAAA82E,GAEA,IAAA,IAAAl0N,EAAA,EAAAA,EAAAo9I,EAAAp9I,IAAA,CACA,IAAAi1N,EAAAQ,EAAAz1N,GAAA41N,EAAA51N,GAAA01N,EAAA11N,GAAA61N,EAAA71N,GACA01N,EAAA11N,GAAAy1N,EAAAz1N,GAAA61N,EAAA71N,GAAA01N,EAAA11N,GAAA41N,EAAA51N,GACAy1N,EAAAz1N,GAAAi1N,EAUA,OAPAp8L,KAAAu8L,UAAAK,EAAAC,EAAAt4E,GACAvkH,KAAA7b,UAAAy4M,EAAAC,EAAAI,EAAA9hN,EAAAopI,EAAA82E,GACAr7L,KAAAu8L,UAAAU,EAAA9hN,EAAAopI,GACAvkH,KAAAw8L,aAAAS,EAAA14E,GAEAxjF,EAAAgyJ,SAAAnlL,EAAAmlL,SAAAllL,EAAAklL,SACAhyJ,EAAA97D,OAAA2oC,EAAA3oC,OAAA4oC,EAAA5oC,OACA87D,EAAAuhK,UAIAvU,EAAApwL,UAAAiyL,IAAA,SAAAl+K,GACA,IAAAqvB,EAAA,IAAAgtJ,EAAA,MAEA,OADAhtJ,EAAAiyJ,MAAA,IAAAn1L,MAAAmC,KAAA/6B,OAAAysC,EAAAzsC,QACA+6B,KAAAu5K,MAAA7nK,EAAAqvB,IAIAgtJ,EAAApwL,UAAAu/L,KAAA,SAAAxrL,GACA,IAAAqvB,EAAA,IAAAgtJ,EAAA,MAEA,OADAhtJ,EAAAiyJ,MAAA,IAAAn1L,MAAAmC,KAAA/6B,OAAAysC,EAAAzsC,QACA21N,EAAA56L,KAAA0R,EAAAqvB,IAIAgtJ,EAAApwL,UAAA4xL,KAAA,SAAA79K,GACA,OAAA1R,KAAAq1B,QAAAkkJ,MAAA7nK,EAAA1R,OAGA+tL,EAAApwL,UAAAk2L,MAAA,SAAAniL,GACA,IAAAw6O,EAAAx6O,EAAA,EACAw6O,IAAAx6O,GAAAA,GAEA7Y,EAAA,iBAAA6Y,GACA7Y,EAAA6Y,EAAA,UAIA,IADA,IAAAmsH,EAAA,EACA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs9I,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,IAAAuqC,EACA4xI,GAAA,SAAA7+B,IAAA,SAAAoZ,GACAA,IAAA,GACAA,GAAApZ,EAAA,SAAA,EAEAoZ,GAAAylB,IAAA,GACAtjJ,KAAAgzL,MAAA7rN,GAAA,SAAAm8K,EAQA,OALA,IAAAzlB,IACA79H,KAAAgzL,MAAA7rN,GAAA02J,EACA79H,KAAA/6B,UAGAinR,EAAAlsP,KAAA01L,OAAA11L,MAGA+tL,EAAApwL,UAAAw/L,KAAA,SAAAzrL,GACA,OAAA1R,KAAAq1B,QAAAw+J,MAAAniL,IAIAq8K,EAAApwL,UAAAy/L,IAAA,WACA,OAAAp9L,KAAA4vL,IAAA5vL,OAIA+tL,EAAApwL,UAAA0/L,KAAA,WACA,OAAAr9L,KAAAuvL,KAAAvvL,KAAAq1B,UAIA04J,EAAApwL,UAAA0hI,IAAA,SAAA3tH,GACA,IAAA+yG,EA7xCA,SAAA/yG,GAGA,IAFA,IAAA+yG,EAAA,IAAA5mH,MAAA6T,EAAAu/J,aAEAwlB,EAAA,EAAAA,EAAAhyE,EAAAx/I,OAAAwxN,IAAA,CACA,IAAAlhE,EAAAkhE,EAAA,GAAA,EACAC,EAAAD,EAAA,GAEAhyE,EAAAgyE,GAAA/kL,EAAAshL,MAAAz9D,KAAAmhE,EAAA,EAGA,OAAAjyE,EAmxCA64E,CAAA5rL,GACA,GAAA,IAAA+yG,EAAAx/I,OAAA,OAAA,IAAA8oN,EAAA,GAIA,IADA,IAAAhiN,EAAAi0B,KACA74B,EAAA,EAAAA,EAAAs9I,EAAAx/I,QACA,IAAAw/I,EAAAt9I,GADAA,IAAA4E,EAAAA,EAAAqxN,OAIA,KAAAj2N,EAAAs9I,EAAAx/I,OACA,IAAA,IAAAqpC,EAAAviC,EAAAqxN,MAAAj2N,EAAAs9I,EAAAx/I,OAAAkC,IAAAmnC,EAAAA,EAAA8uL,MACA,IAAA34E,EAAAt9I,KAEA4E,EAAAA,EAAA6jN,IAAAthL,IAIA,OAAAviC,GAIAgiN,EAAApwL,UAAA4/L,OAAA,SAAAnjE,GACAvhI,EAAA,iBAAAuhI,GAAAA,GAAA,GACA,IAGAjzJ,EAHA6mC,EAAAosH,EAAA,GACAl+I,GAAAk+I,EAAApsH,GAAA,GACAwvL,EAAA,WAAA,GAAAxvL,GAAA,GAAAA,EAGA,GAAA,IAAAA,EAAA,CACA,IAAA6vH,EAAA,EAEA,IAAA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs2N,EAAAz9L,KAAAgzL,MAAA7rN,GAAAq2N,EACA/wN,GAAA,EAAAuzB,KAAAgzL,MAAA7rN,IAAAs2N,GAAAzvL,EACAhO,KAAAgzL,MAAA7rN,GAAAsF,EAAAoxJ,EACAA,EAAA4/D,IAAA,GAAAzvL,EAGA6vH,IACA79H,KAAAgzL,MAAA7rN,GAAA02J,EACA79H,KAAA/6B,UAIA,GAAA,IAAAiX,EAAA,CACA,IAAA/U,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IACA64B,KAAAgzL,MAAA7rN,EAAA+U,GAAA8jB,KAAAgzL,MAAA7rN,GAGA,IAAAA,EAAA,EAAAA,EAAA+U,EAAA/U,IACA64B,KAAAgzL,MAAA7rN,GAAA,EAGA64B,KAAA/6B,QAAAiX,EAGA,OAAA8jB,KAAAsiM,UAGAvU,EAAApwL,UAAA+/L,MAAA,SAAAtjE,GAGA,OADAvhI,EAAA,IAAAmH,KAAA+yL,UACA/yL,KAAAu9L,OAAAnjE,IAMA2zD,EAAApwL,UAAAg0L,OAAA,SAAAv3D,EAAAujE,EAAAC,GAEA,IAAAn2H,EADA5uE,EAAA,iBAAAuhI,GAAAA,GAAA,GAGA3yD,EADAk2H,GACAA,EAAAA,EAAA,IAAA,GAEA,EAGA,IAAA3vL,EAAAosH,EAAA,GACAl+I,EAAAtW,KAAAq0B,KAAAmgI,EAAApsH,GAAA,GAAAhO,KAAA/6B,QACA+5J,EAAA,SAAA,WAAAhxH,GAAAA,EACA6vL,EAAAD,EAMA,GAJAn2H,GAAAvrF,EACAurF,EAAA7hG,KAAAD,IAAA,EAAA8hG,GAGAo2H,EAAA,CACA,IAAA,IAAA12N,EAAA,EAAAA,EAAA+U,EAAA/U,IACA02N,EAAA7K,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,GAEA02N,EAAA54N,OAAAiX,EAGA,GAAA,IAAAA,QAEA,GAAA8jB,KAAA/6B,OAAAiX,EAEA,IADA8jB,KAAA/6B,QAAAiX,EACA/U,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IACA64B,KAAAgzL,MAAA7rN,GAAA64B,KAAAgzL,MAAA7rN,EAAA+U,QAGA8jB,KAAAgzL,MAAA,GAAA,EACAhzL,KAAA/6B,OAAA,EAGA,IAAA44J,EAAA,EACA,IAAA12J,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,IAAA,IAAA02J,GAAA12J,GAAAsgG,GAAAtgG,IAAA,CACA,IAAAq7C,EAAA,EAAAxiB,KAAAgzL,MAAA7rN,GACA64B,KAAAgzL,MAAA7rN,GAAA02J,GAAA,GAAA7vH,EAAAwU,IAAAxU,EACA6vH,EAAAr7G,EAAAw8G,EAaA,OATA6+D,GAAA,IAAAhgE,IACAggE,EAAA7K,MAAA6K,EAAA54N,UAAA44J,GAGA,IAAA79H,KAAA/6B,SACA+6B,KAAAgzL,MAAA,GAAA,EACAhzL,KAAA/6B,OAAA,GAGA+6B,KAAAsiM,UAGAvU,EAAApwL,UAAAmgM,MAAA,SAAA1jE,EAAAujE,EAAAC,GAGA,OADA/kM,EAAA,IAAAmH,KAAA+yL,UACA/yL,KAAA2xL,OAAAv3D,EAAAujE,EAAAC,IAIA7P,EAAApwL,UAAAogM,KAAA,SAAA3jE,GACA,OAAAp6H,KAAAq1B,QAAAqoK,MAAAtjE,IAGA2zD,EAAApwL,UAAAqgM,MAAA,SAAA5jE,GACA,OAAAp6H,KAAAq1B,QAAAkoK,OAAAnjE,IAIA2zD,EAAApwL,UAAAsgM,KAAA,SAAA7jE,GACA,OAAAp6H,KAAAq1B,QAAAyoK,MAAA1jE,IAGA2zD,EAAApwL,UAAAugM,MAAA,SAAA9jE,GACA,OAAAp6H,KAAAq1B,QAAAs8J,OAAAv3D,IAIA2zD,EAAApwL,UAAA63L,MAAA,SAAAiB,GACA59L,EAAA,iBAAA49L,GAAAA,GAAA,GACA,IAAAzoL,EAAAyoL,EAAA,GACAv6M,GAAAu6M,EAAAzoL,GAAA,GACAM,EAAA,GAAAN,EAGA,QAAAhO,KAAA/6B,QAAAiX,OAGA8jB,KAAAgzL,MAAA92M,GAEAoyB,IAIAy/K,EAAApwL,UAAAwgM,OAAA,SAAA/jE,GACAvhI,EAAA,iBAAAuhI,GAAAA,GAAA,GACA,IAAApsH,EAAAosH,EAAA,GACAl+I,GAAAk+I,EAAApsH,GAAA,GAIA,GAFAnV,EAAA,IAAAmH,KAAA+yL,SAAA,2CAEA/yL,KAAA/6B,QAAAiX,EACA,OAAA8jB,KAQA,GALA,IAAAgO,GACA9xB,IAEA8jB,KAAA/6B,OAAAW,KAAAq0B,IAAA/d,EAAA8jB,KAAA/6B,QAEA,IAAA+oC,EAAA,CACA,IAAAgxH,EAAA,SAAA,WAAAhxH,GAAAA,EACAhO,KAAAgzL,MAAAhzL,KAAA/6B,OAAA,IAAA+5J,EAGA,OAAAh/H,KAAAsiM,UAIAvU,EAAApwL,UAAAygM,MAAA,SAAAhkE,GACA,OAAAp6H,KAAAq1B,QAAA8oK,OAAA/jE,IAIA2zD,EAAApwL,UAAA23L,MAAA,SAAA5jL,GAGA,OAFA7Y,EAAA,iBAAA6Y,GACA7Y,EAAA6Y,EAAA,UACAA,EAAA,EAAA1R,KAAA0xL,OAAAhgL,GAGA,IAAA1R,KAAA+yL,SACA,IAAA/yL,KAAA/6B,SAAA,EAAA+6B,KAAAgzL,MAAA,KAAAthL,GACA1R,KAAAgzL,MAAA,GAAAthL,GAAA,EAAA1R,KAAAgzL,MAAA,IACAhzL,KAAA+yL,SAAA,EACA/yL,OAGAA,KAAA+yL,SAAA,EACA/yL,KAAA0xL,MAAAhgL,GACA1R,KAAA+yL,SAAA,EACA/yL,MAIAA,KAAA8zL,OAAApiL,IAGAq8K,EAAApwL,UAAAm2L,OAAA,SAAApiL,GACA1R,KAAAgzL,MAAA,IAAAthL,EAGA,IAAA,IAAAvqC,EAAA,EAAAA,EAAA64B,KAAA/6B,QAAA+6B,KAAAgzL,MAAA7rN,IAAA,SAAAA,IACA64B,KAAAgzL,MAAA7rN,IAAA,SACAA,IAAA64B,KAAA/6B,OAAA,EACA+6B,KAAAgzL,MAAA7rN,EAAA,GAAA,EAEA64B,KAAAgzL,MAAA7rN,EAAA,KAKA,OAFA64B,KAAA/6B,OAAAW,KAAAD,IAAAq6B,KAAA/6B,OAAAkC,EAAA,GAEA64B,MAIA+tL,EAAApwL,UAAA+zL,MAAA,SAAAhgL,GAGA,GAFA7Y,EAAA,iBAAA6Y,GACA7Y,EAAA6Y,EAAA,UACAA,EAAA,EAAA,OAAA1R,KAAAs1L,OAAA5jL,GAEA,GAAA,IAAA1R,KAAA+yL,SAIA,OAHA/yL,KAAA+yL,SAAA,EACA/yL,KAAAs1L,MAAA5jL,GACA1R,KAAA+yL,SAAA,EACA/yL,KAKA,GAFAA,KAAAgzL,MAAA,IAAAthL,EAEA,IAAA1R,KAAA/6B,QAAA+6B,KAAAgzL,MAAA,GAAA,EACAhzL,KAAAgzL,MAAA,IAAAhzL,KAAAgzL,MAAA,GACAhzL,KAAA+yL,SAAA,OAGA,IAAA,IAAA5rN,EAAA,EAAAA,EAAA64B,KAAA/6B,QAAA+6B,KAAAgzL,MAAA7rN,GAAA,EAAAA,IACA64B,KAAAgzL,MAAA7rN,IAAA,SACA64B,KAAAgzL,MAAA7rN,EAAA,IAAA,EAIA,OAAA64B,KAAAsiM,UAGAvU,EAAApwL,UAAA0gM,KAAA,SAAA3sL,GACA,OAAA1R,KAAAq1B,QAAAigK,MAAA5jL,IAGAq8K,EAAApwL,UAAA2gM,KAAA,SAAA5sL,GACA,OAAA1R,KAAAq1B,QAAAq8J,MAAAhgL,IAGAq8K,EAAApwL,UAAA4gM,KAAA,WAGA,OAFAv+L,KAAA+yL,SAAA,EAEA/yL,MAGA+tL,EAAApwL,UAAAw8J,IAAA,WACA,OAAAn6J,KAAAq1B,QAAAkpK,QAGAxQ,EAAApwL,UAAA6gM,aAAA,SAAA9sL,EAAAk+K,EAAAjrL,GACA,IACAx9B,EAIAs9I,EALArhH,EAAAsO,EAAAzsC,OAAA0/B,EAGA3E,KAAA+zL,QAAA3wL,GAGA,IAAAy6H,EAAA,EACA,IAAA12J,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IAAA,CACAs9I,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,EAAAw9B,IAAAk5H,EACA,IAAA10I,GAAA,EAAAuoB,EAAAshL,MAAA7rN,IAAAyoN,EAEA/xD,IADApZ,GAAA,SAAAt7H,IACA,KAAAA,EAAA,SAAA,GACA6W,KAAAgzL,MAAA7rN,EAAAw9B,GAAA,SAAA8/G,EAEA,KAAAt9I,EAAA64B,KAAA/6B,OAAA0/B,EAAAx9B,IAEA02J,GADApZ,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,EAAAw9B,IAAAk5H,IACA,GACA79H,KAAAgzL,MAAA7rN,EAAAw9B,GAAA,SAAA8/G,EAGA,GAAA,IAAAoZ,EAAA,OAAA79H,KAAAsiM,SAKA,IAFAzpM,GAAA,IAAAglI,GACAA,EAAA,EACA12J,EAAA,EAAAA,EAAA64B,KAAA/6B,OAAAkC,IAEA02J,GADApZ,IAAA,EAAAzkH,KAAAgzL,MAAA7rN,IAAA02J,IACA,GACA79H,KAAAgzL,MAAA7rN,GAAA,SAAAs9I,EAIA,OAFAzkH,KAAA+yL,SAAA,EAEA/yL,KAAAsiM,UAGAvU,EAAApwL,UAAA8gM,SAAA,SAAA/sL,EAAAh3B,GACA,IAAAiqB,GAAA3E,KAAA/6B,OAAAysC,EAAAzsC,QAEA4B,EAAAm5B,KAAAq1B,QACA/7C,EAAAo4B,EAGAgtL,EAAA,EAAAplN,EAAA05M,MAAA15M,EAAArU,OAAA,GAGA,KADA0/B,EAAA,GADA3E,KAAAi1L,WAAAyJ,MAGAplN,EAAAA,EAAA0kN,MAAAr5L,GACA99B,EAAA02N,OAAA54L,GACA+5L,EAAA,EAAAplN,EAAA05M,MAAA15M,EAAArU,OAAA,IAIA,IACAqpC,EADApvB,EAAArY,EAAA5B,OAAAqU,EAAArU,OAGA,GAAA,QAAAyV,EAAA,EACA4zB,EAAA,IAAAy/K,EAAA,OACA9oN,OAAAia,EAAA,EACAovB,EAAA0kL,MAAA,IAAAn1L,MAAAyQ,EAAArpC,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAAmnC,EAAArpC,OAAAkC,IACAmnC,EAAA0kL,MAAA7rN,GAAA,EAIA,IAAAunI,EAAA7nI,EAAAwuD,QAAAmpK,aAAAllN,EAAA,EAAA4F,GACA,IAAAwvH,EAAAqkF,WACAlsN,EAAA6nI,EACApgG,IACAA,EAAA0kL,MAAA9zM,GAAA,IAIA,IAAA,IAAAoS,EAAApS,EAAA,EAAAoS,GAAA,EAAAA,IAAA,CACA,IAAAqtM,EAAA,UAAA,EAAA93N,EAAAmsN,MAAA15M,EAAArU,OAAAqsB,KACA,EAAAzqB,EAAAmsN,MAAA15M,EAAArU,OAAAqsB,EAAA,IAOA,IAHAqtM,EAAA/4N,KAAAq0B,IAAA0kM,EAAAD,EAAA,EAAA,UAEA73N,EAAA23N,aAAAllN,EAAAqlN,EAAArtM,GACA,IAAAzqB,EAAAksN,UACA4L,IACA93N,EAAAksN,SAAA,EACAlsN,EAAA23N,aAAAllN,EAAA,EAAAgY,GACAzqB,EAAAgoN,WACAhoN,EAAAksN,UAAA,GAGAzkL,IACAA,EAAA0kL,MAAA1hM,GAAAqtM,GAaA,OAVArwL,GACAA,EAAAg0L,SAEAz7N,EAAAy7N,SAGA,QAAA5nN,GAAA,IAAAiqB,GACA99B,EAAA8qN,OAAAhtL,GAGA,CACA2uJ,IAAAhlJ,GAAA,KACAg0C,IAAAz7E,IAQAknN,EAAApwL,UAAAihM,OAAA,SAAAltL,EAAAh3B,EAAAmkN,GAGA,OAFAhmM,GAAA6Y,EAAAm9K,UAEA7uL,KAAA6uL,SACA,CACAv7B,IAAA,IAAAy6B,EAAA,GACAzrI,IAAA,IAAAyrI,EAAA,IAKA,IAAA/tL,KAAA+yL,UAAA,IAAArhL,EAAAqhL,UACAhnN,EAAAi0B,KAAA41L,MAAAgJ,OAAAltL,EAAAh3B,GAEA,QAAAA,IACA44K,EAAAvnL,EAAAunL,IAAAsiC,OAGA,QAAAl7M,IACA4nE,EAAAv2E,EAAAu2E,IAAAszI,MACAiJ,GAAA,IAAAv8I,EAAAywI,UACAzwI,EAAA8sI,KAAA19K,IAIA,CACA4hJ,IAAAA,EACAhxG,IAAAA,IAIA,IAAAtiD,KAAA+yL,UAAA,IAAArhL,EAAAqhL,UACAhnN,EAAAi0B,KAAA4+L,OAAAltL,EAAAkkL,MAAAl7M,GAEA,QAAAA,IACA44K,EAAAvnL,EAAAunL,IAAAsiC,OAGA,CACAtiC,IAAAA,EACAhxG,IAAAv2E,EAAAu2E,MAIA,IAAAtiD,KAAA+yL,SAAArhL,EAAAqhL,WACAhnN,EAAAi0B,KAAA41L,MAAAgJ,OAAAltL,EAAAkkL,MAAAl7M,GAEA,QAAAA,IACA4nE,EAAAv2E,EAAAu2E,IAAAszI,MACAiJ,GAAA,IAAAv8I,EAAAywI,UACAzwI,EAAA+sI,KAAA39K,IAIA,CACA4hJ,IAAAvnL,EAAAunL,IACAhxG,IAAAA,IAOA5wC,EAAAzsC,OAAA+6B,KAAA/6B,QAAA+6B,KAAAmH,IAAAuK,GAAA,EACA,CACA4hJ,IAAA,IAAAy6B,EAAA,GACAzrI,IAAAtiD,MAKA,IAAA0R,EAAAzsC,OACA,QAAAyV,EACA,CACA44K,IAAAtzJ,KAAA8+L,KAAAptL,EAAAshL,MAAA,IACA1wI,IAAA,MAIA,QAAA5nE,EACA,CACA44K,IAAA,KACAhxG,IAAA,IAAAyrI,EAAA/tL,KAAA8rP,MAAAp6O,EAAAshL,MAAA,MAIA,CACA1/B,IAAAtzJ,KAAA8+L,KAAAptL,EAAAshL,MAAA,IACA1wI,IAAA,IAAAyrI,EAAA/tL,KAAA8rP,MAAAp6O,EAAAshL,MAAA,MAIAhzL,KAAAy+L,SAAA/sL,EAAAh3B,GAlFA,IAAA44K,EAAAhxG,EAAAv2E,GAsFAgiN,EAAApwL,UAAA21J,IAAA,SAAA5hJ,GACA,OAAA1R,KAAA4+L,OAAAltL,EAAA,OAAA,GAAA4hJ,KAIAy6B,EAAApwL,UAAA2kD,IAAA,SAAA5wC,GACA,OAAA1R,KAAA4+L,OAAAltL,EAAA,OAAA,GAAA4wC,KAGAyrI,EAAApwL,UAAAuxL,KAAA,SAAAx9K,GACA,OAAA1R,KAAA4+L,OAAAltL,EAAA,OAAA,GAAA4wC,KAIAyrI,EAAApwL,UAAAohM,SAAA,SAAArtL,GACA,IAAAstL,EAAAh/L,KAAA4+L,OAAAltL,GAGA,GAAAstL,EAAA18I,IAAAusI,SAAA,OAAAmQ,EAAA1rC,IAEA,IAAAhxG,EAAA,IAAA08I,EAAA1rC,IAAAy/B,SAAAiM,EAAA18I,IAAA+sI,KAAA39K,GAAAstL,EAAA18I,IAEAklH,EAAA91J,EAAAwsL,MAAA,GACA9hC,EAAA1qJ,EAAA+/K,MAAA,GACAtqL,EAAAm7C,EAAAn7C,IAAAqgK,GAGA,OAAArgK,EAAA,GAAA,IAAAi1J,GAAA,IAAAj1J,EAAA63L,EAAA1rC,IAGA,IAAA0rC,EAAA1rC,IAAAy/B,SAAAiM,EAAA1rC,IAAAo+B,MAAA,GAAAsN,EAAA1rC,IAAAgiC,MAAA,IAGAvH,EAAApwL,UAAAmuP,MAAA,SAAAp6O,GACA,IAAAw6O,EAAAx6O,EAAA,EACAw6O,IAAAx6O,GAAAA,GAEA7Y,EAAA6Y,GAAA,UAIA,IAHA,IAAAxqC,GAAA,GAAA,IAAAwqC,EAEA2kI,EAAA,EACAlvK,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IACAkvK,GAAAnvK,EAAAmvK,GAAA,EAAAr2I,KAAAgzL,MAAA7rN,KAAAuqC,EAGA,OAAAw6O,GAAA71G,EAAAA,GAIA03C,EAAApwL,UAAA+2L,KAAA,SAAAhjL,GACA,OAAA1R,KAAA8rP,MAAAp6O,IAIAq8K,EAAApwL,UAAAg3L,MAAA,SAAAjjL,GACA,IAAAw6O,EAAAx6O,EAAA,EACAw6O,IAAAx6O,GAAAA,GAEA7Y,EAAA6Y,GAAA,UAGA,IADA,IAAAmsH,EAAA,EACA12J,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IAAA,CACA,IAAAs9I,GAAA,EAAAzkH,KAAAgzL,MAAA7rN,IAAA,SAAA02J,EACA79H,KAAAgzL,MAAA7rN,GAAAs9I,EAAA/yG,EAAA,EACAmsH,EAAApZ,EAAA/yG,EAIA,OADA1R,KAAAsiM,SACA4pD,EAAAlsP,KAAA01L,OAAA11L,MAGA+tL,EAAApwL,UAAAmhM,KAAA,SAAAptL,GACA,OAAA1R,KAAAq1B,QAAAs/J,MAAAjjL,IAGAq8K,EAAApwL,UAAAshM,KAAA,SAAA/3N,GACA2xB,EAAA,IAAA3xB,EAAA6rN,UACAl6L,GAAA3xB,EAAA2nN,UAEA,IAAAjhL,EAAA5N,KACA6N,EAAA3mC,EAAAmuD,QAGAznB,EADA,IAAAA,EAAAmlL,SACAnlL,EAAAshL,KAAAhoN,GAEA0mC,EAAAynB,QAaA,IATA,IAAAivF,EAAA,IAAAypE,EAAA,GACA7qE,EAAA,IAAA6qE,EAAA,GAGAnpE,EAAA,IAAAmpE,EAAA,GACAnoE,EAAA,IAAAmoE,EAAA,GAEA3pE,EAAA,EAEAx2G,EAAAutK,UAAAttK,EAAAstK,UACAvtK,EAAA+jL,OAAA,GACA9jL,EAAA8jL,OAAA,KACAvtE,EAMA,IAHA,IAAA86E,EAAArxL,EAAAwnB,QACA+7I,EAAAxjK,EAAAynB,SAEAznB,EAAAihL,UAAA,CACA,IAAA,IAAA1nN,EAAA,EAAAg4N,EAAA,EAAA,IAAAvxL,EAAAolL,MAAA,GAAAmM,IAAAh4N,EAAA,KAAAA,EAAAg4N,IAAA,GACA,GAAAh4N,EAAA,EAEA,IADAymC,EAAA+jL,OAAAxqN,GACAA,KAAA,IACAm9I,EAAAiqE,SAAArrE,EAAAqrE,WACAjqE,EAAA8qE,KAAA8P,GACAh8E,EAAAmsE,KAAAje,IAGA9sD,EAAAqtE,OAAA,GACAzuE,EAAAyuE,OAAA,GAIA,IAAA,IAAArgM,EAAA,EAAA8tM,EAAA,EAAA,IAAAvxL,EAAAmlL,MAAA,GAAAoM,IAAA9tM,EAAA,KAAAA,EAAA8tM,IAAA,GACA,GAAA9tM,EAAA,EAEA,IADAuc,EAAA8jL,OAAArgM,GACAA,KAAA,IACAszH,EAAA2pE,SAAA3oE,EAAA2oE,WACA3pE,EAAAwqE,KAAA8P,GACAt5E,EAAAypE,KAAAje,IAGAxsD,EAAA+sE,OAAA,GACA/rE,EAAA+rE,OAAA,GAIA/jL,EAAAzG,IAAA0G,IAAA,GACAD,EAAAyhL,KAAAxhL,GACAy2G,EAAA+qE,KAAAzqE,GACA1B,EAAAmsE,KAAAzpE,KAEA/3G,EAAAwhL,KAAAzhL,GACAg3G,EAAAyqE,KAAA/qE,GACAsB,EAAAypE,KAAAnsE,IAIA,MAAA,CACAr8I,EAAA+9I,EACAtrI,EAAAssI,EACAurD,IAAAtjK,EAAA0vL,OAAAn5E,KAOA2pE,EAAApwL,UAAA0hM,OAAA,SAAAn4N,GACA2xB,EAAA,IAAA3xB,EAAA6rN,UACAl6L,GAAA3xB,EAAA2nN,UAEA,IAAAhoN,EAAAm5B,KACA1mB,EAAApS,EAAAmuD,QAGAxuD,EADA,IAAAA,EAAAksN,SACAlsN,EAAAqoN,KAAAhoN,GAEAL,EAAAwuD,QAQA,IALA,IAuCAtpD,EAvCAuzN,EAAA,IAAAvR,EAAA,GACAwR,EAAA,IAAAxR,EAAA,GAEAxiK,EAAAjyC,EAAA+7C,QAEAxuD,EAAAmrN,KAAA,GAAA,GAAA14M,EAAA04M,KAAA,GAAA,GAAA,CACA,IAAA,IAAA7qN,EAAA,EAAAg4N,EAAA,EAAA,IAAAt4N,EAAAmsN,MAAA,GAAAmM,IAAAh4N,EAAA,KAAAA,EAAAg4N,IAAA,GACA,GAAAh4N,EAAA,EAEA,IADAN,EAAA8qN,OAAAxqN,GACAA,KAAA,GACAm4N,EAAA/Q,SACA+Q,EAAAlQ,KAAA7jK,GAGA+zK,EAAA3N,OAAA,GAIA,IAAA,IAAArgM,EAAA,EAAA8tM,EAAA,EAAA,IAAA9lN,EAAA05M,MAAA,GAAAoM,IAAA9tM,EAAA,KAAAA,EAAA8tM,IAAA,GACA,GAAA9tM,EAAA,EAEA,IADAhY,EAAAq4M,OAAArgM,GACAA,KAAA,GACAiuM,EAAAhR,SACAgR,EAAAnQ,KAAA7jK,GAGAg0K,EAAA5N,OAAA,GAIA9qN,EAAAsgC,IAAA7tB,IAAA,GACAzS,EAAAwoN,KAAA/1M,GACAgmN,EAAAjQ,KAAAkQ,KAEAjmN,EAAA+1M,KAAAxoN,GACA04N,EAAAlQ,KAAAiQ,IAeA,OATAvzN,EADA,IAAAlF,EAAAmrN,KAAA,GACAsN,EAEAC,GAGAvN,KAAA,GAAA,GACAjmN,EAAAqjN,KAAAloN,GAGA6E,GAGAgiN,EAAApwL,UAAAwzK,IAAA,SAAAz/J,GACA,GAAA1R,KAAA6uL,SAAA,OAAAn9K,EAAAyoJ,MACA,GAAAzoJ,EAAAm9K,SAAA,OAAA7uL,KAAAm6J,MAEA,IAAAtzL,EAAAm5B,KAAAq1B,QACA/7C,EAAAo4B,EAAA2jB,QACAxuD,EAAAksN,SAAA,EACAz5M,EAAAy5M,SAAA,EAGA,IAAA,IAAApuL,EAAA,EAAA99B,EAAAs0M,UAAA7hM,EAAA6hM,SAAAx2K,IACA99B,EAAA8qN,OAAA,GACAr4M,EAAAq4M,OAAA,GAGA,OAAA,CACA,KAAA9qN,EAAAs0M,UACAt0M,EAAA8qN,OAAA,GAEA,KAAAr4M,EAAA6hM,UACA7hM,EAAAq4M,OAAA,GAGA,IAAA3jL,EAAAnnC,EAAAsgC,IAAA7tB,GACA,GAAA00B,EAAA,EAAA,CAEA,IAAA+wC,EAAAl4E,EACAA,EAAAyS,EACAA,EAAAylE,OACA,GAAA,IAAA/wC,GAAA,IAAA10B,EAAA04M,KAAA,GACA,MAGAnrN,EAAAwoN,KAAA/1M,GAGA,OAAAA,EAAAikN,OAAA54L,IAIAopL,EAAApwL,UAAA6hM,KAAA,SAAA9tL,GACA,OAAA1R,KAAAi/L,KAAAvtL,GAAA7qC,EAAAqoN,KAAAx9K,IAGAq8K,EAAApwL,UAAAw9K,OAAA,WACA,OAAA,IAAA,EAAAn7K,KAAAgzL,MAAA,KAGAjF,EAAApwL,UAAA4wL,MAAA,WACA,OAAA,IAAA,EAAAvuL,KAAAgzL,MAAA,KAIAjF,EAAApwL,UAAA8zL,MAAA,SAAA//K,GACA,OAAA1R,KAAAgzL,MAAA,GAAAthL,GAIAq8K,EAAApwL,UAAA8hM,MAAA,SAAAhJ,GACA59L,EAAA,iBAAA49L,GACA,IAAAzoL,EAAAyoL,EAAA,GACAv6M,GAAAu6M,EAAAzoL,GAAA,GACAM,EAAA,GAAAN,EAGA,GAAAhO,KAAA/6B,QAAAiX,EAGA,OAFA8jB,KAAA+zL,QAAA73M,EAAA,GACA8jB,KAAAgzL,MAAA92M,IAAAoyB,EACAtO,KAKA,IADA,IAAA69H,EAAAvvH,EACAnnC,EAAA+U,EAAA,IAAA2hJ,GAAA12J,EAAA64B,KAAA/6B,OAAAkC,IAAA,CACA,IAAAs9I,EAAA,EAAAzkH,KAAAgzL,MAAA7rN,GAEA02J,GADApZ,GAAAoZ,KACA,GACApZ,GAAA,SACAzkH,KAAAgzL,MAAA7rN,GAAAs9I,EAMA,OAJA,IAAAoZ,IACA79H,KAAAgzL,MAAA7rN,GAAA02J,EACA79H,KAAA/6B,UAEA+6B,MAGA+tL,EAAApwL,UAAAkxL,OAAA,WACA,OAAA,IAAA7uL,KAAA/6B,QAAA,IAAA+6B,KAAAgzL,MAAA,IAGAjF,EAAApwL,UAAAq0L,KAAA,SAAAtgL,GACA,IAOA3lC,EAPAgnN,EAAArhL,EAAA,EAEA,GAAA,IAAA1R,KAAA+yL,WAAAA,EAAA,OAAA,EACA,GAAA,IAAA/yL,KAAA+yL,UAAAA,EAAA,OAAA,EAKA,GAHA/yL,KAAAsiM,SAGAtiM,KAAA/6B,OAAA,EACA8G,EAAA,MACA,CACAgnN,IACArhL,GAAAA,GAGA7Y,EAAA6Y,GAAA,SAAA,qBAEA,IAAA+yG,EAAA,EAAAzkH,KAAAgzL,MAAA,GACAjnN,EAAA04I,IAAA/yG,EAAA,EAAA+yG,EAAA/yG,GAAA,EAAA,EAEA,OAAA,IAAA1R,KAAA+yL,SAAA,GAAAhnN,EACAA,GAOAgiN,EAAApwL,UAAAwJ,IAAA,SAAAuK,GACA,GAAA,IAAA1R,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAAA,OAAA,EACA,GAAA,IAAA/yL,KAAA+yL,UAAA,IAAArhL,EAAAqhL,SAAA,OAAA,EAEA,IAAAhnN,EAAAi0B,KAAA0/L,KAAAhuL,GACA,OAAA,IAAA1R,KAAA+yL,SAAA,GAAAhnN,EACAA,GAIAgiN,EAAApwL,UAAA+hM,KAAA,SAAAhuL,GAEA,GAAA1R,KAAA/6B,OAAAysC,EAAAzsC,OAAA,OAAA,EACA,GAAA+6B,KAAA/6B,OAAAysC,EAAAzsC,OAAA,OAAA,EAGA,IADA,IAAA8G,EAAA,EACA5E,EAAA64B,KAAA/6B,OAAA,EAAAkC,GAAA,EAAAA,IAAA,CACA,IAAAN,EAAA,EAAAm5B,KAAAgzL,MAAA7rN,GACAmS,EAAA,EAAAo4B,EAAAshL,MAAA7rN,GAEA,GAAAN,IAAAyS,EAAA,CACAzS,EAAAyS,EACAvN,GAAA,EACAlF,EAAAyS,IACAvN,EAAA,GAEA,OAEA,OAAAA,GAGAgiN,EAAApwL,UAAAgiM,IAAA,SAAAjuL,GACA,OAAA,IAAA1R,KAAAgyL,KAAAtgL,IAGAq8K,EAAApwL,UAAA3mG,GAAA,SAAA06G,GACA,OAAA,IAAA1R,KAAAmH,IAAAuK,IAGAq8K,EAAApwL,UAAAiiM,KAAA,SAAAluL,GACA,OAAA1R,KAAAgyL,KAAAtgL,IAAA,GAGAq8K,EAAApwL,UAAAkiM,IAAA,SAAAnuL,GACA,OAAA1R,KAAAmH,IAAAuK,IAAA,GAGAq8K,EAAApwL,UAAAmiM,IAAA,SAAApuL,GACA,OAAA,IAAA1R,KAAAgyL,KAAAtgL,IAGAq8K,EAAApwL,UAAAzmG,GAAA,SAAAw6G,GACA,OAAA,IAAA1R,KAAAmH,IAAAuK,IAGAq8K,EAAApwL,UAAAoiM,KAAA,SAAAruL,GACA,OAAA1R,KAAAgyL,KAAAtgL,IAAA,GAGAq8K,EAAApwL,UAAAqiM,IAAA,SAAAtuL,GACA,OAAA1R,KAAAmH,IAAAuK,IAAA,GAGAq8K,EAAApwL,UAAAsiM,IAAA,SAAAvuL,GACA,OAAA,IAAA1R,KAAAgyL,KAAAtgL,IAGAq8K,EAAApwL,UAAA4V,GAAA,SAAA7B,GACA,OAAA,IAAA1R,KAAAmH,IAAAuK,IAOAq8K,EAAAG,IAAA,SAAAx8K,GACA,OAAA,IAAAwuL,EAAAxuL,IAGAq8K,EAAApwL,UAAAswL,MAAA,SAAAh0G,GAGA,OAFAphF,GAAAmH,KAAAkuL,IAAA,yCACAr1L,EAAA,IAAAmH,KAAA+yL,SAAA,iCACA94G,EAAAkmH,UAAAngM,MAAAogM,UAAAnmH,IAGA8zG,EAAApwL,UAAA0iM,QAAA,WAEA,OADAxnM,EAAAmH,KAAAkuL,IAAA,wDACAluL,KAAAkuL,IAAAoS,YAAAtgM,OAGA+tL,EAAApwL,UAAAyiM,UAAA,SAAAnmH,GAEA,OADAj6E,KAAAkuL,IAAAj0G,EACAj6E,MAGA+tL,EAAApwL,UAAA4iM,SAAA,SAAAtmH,GAEA,OADAphF,GAAAmH,KAAAkuL,IAAA,yCACAluL,KAAAogM,UAAAnmH,IAGA8zG,EAAApwL,UAAA6iM,OAAA,SAAA9uL,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAAlvM,IAAAghB,KAAA0R,IAGAq8K,EAAApwL,UAAA0wL,QAAA,SAAA38K,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAAkB,KAAApvL,KAAA0R,IAGAq8K,EAAApwL,UAAA8iM,OAAA,SAAA/uL,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA58J,IAAAtxB,KAAA0R,IAGAq8K,EAAApwL,UAAAixL,QAAA,SAAAl9K,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAAmB,KAAArvL,KAAA0R,IAGAq8K,EAAApwL,UAAA+iM,OAAA,SAAAhvL,GAEA,OADA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAAyS,IAAA3gM,KAAA0R,IAGAq8K,EAAApwL,UAAAijM,OAAA,SAAAlvL,GAGA,OAFA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA2S,SAAA7gM,KAAA0R,GACA1R,KAAAkuL,IAAA0B,IAAA5vL,KAAA0R,IAGAq8K,EAAApwL,UAAAywL,QAAA,SAAA18K,GAGA,OAFA7Y,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA2S,SAAA7gM,KAAA0R,GACA1R,KAAAkuL,IAAAqB,KAAAvvL,KAAA0R,IAGAq8K,EAAApwL,UAAAwwL,OAAA,WAGA,OAFAt1L,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAAkP,IAAAp9L,OAGA+tL,EAAApwL,UAAAojM,QAAA,WAGA,OAFAloM,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAAmP,KAAAr9L,OAIA+tL,EAAApwL,UAAA2wL,QAAA,WAGA,OAFAz1L,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAA8S,KAAAhhM,OAGA+tL,EAAApwL,UAAAsjM,QAAA,WAGA,OAFApoM,EAAAmH,KAAAkuL,IAAA,uCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAAsR,KAAAx/L,OAIA+tL,EAAApwL,UAAA6wL,OAAA,WAGA,OAFA31L,EAAAmH,KAAAkuL,IAAA,sCACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAA0H,IAAA51L,OAGA+tL,EAAApwL,UAAAujM,OAAA,SAAAxvL,GAGA,OAFA7Y,EAAAmH,KAAAkuL,MAAAx8K,EAAAw8K,IAAA,qBACAluL,KAAAkuL,IAAA4S,SAAA9gM,MACAA,KAAAkuL,IAAA7uD,IAAAr/H,KAAA0R,IAIA,IAAAyvL,EAAA,CACAC,KAAA,KACAC,KAAA,KACAC,KAAA,KACAC,OAAA,MAIA,SAAAC,EAAA3uS,EAAAq0E,GAEA84B,KAAAntG,KAAAA,EACAmtG,KAAA94B,EAAA,IAAA6mN,EAAA7mN,EAAA,IACA84B,KAAA/rG,EAAA+rG,KAAA94B,EAAA+pM,YACAjxK,KAAA3rG,EAAA,IAAA05R,EAAA,GAAAwP,OAAAv9L,KAAA/rG,GAAAo7R,KAAArvL,KAAA94B,GAEA84B,KAAA5E,IAAA4E,KAAAyhM,OAiDA,SAAAC,IACAF,EAAA5jM,KACAoC,KACA,OACA,2EA+DA,SAAA2hM,IACAH,EAAA5jM,KACAoC,KACA,OACA,kEAIA,SAAA4hM,IACAJ,EAAA5jM,KACAoC,KACA,OACA,yDAIA,SAAA6hM,IAEAL,EAAA5jM,KACAoC,KACA,QACA,uEA8CA,SAAAkgM,EAAAhhN,GACA,GAAA,iBAAAA,EAAA,CACA,IAAAkvC,EAAA2/J,EAAA+T,OAAA5iN,GACA8gB,KAAA9gB,EAAAkvC,EAAAlnD,EACA84B,KAAAouB,MAAAA,OAEAv1B,EAAA3Z,EAAAygN,IAAA,GAAA,kCACA3/L,KAAA9gB,EAAAA,EACA8gB,KAAAouB,MAAA,KAoOA,SAAA2zK,EAAA7iN,GACAghN,EAAAtiM,KAAAoC,KAAA9gB,GAEA8gB,KAAA2E,MAAA3E,KAAA9gB,EAAA+xL,YACAjxK,KAAA2E,MAAA,IAAA,IACA3E,KAAA2E,OAAA,GAAA3E,KAAA2E,MAAA,IAGA3E,KAAAgO,EAAA,IAAA+/K,EAAA,GAAAwP,OAAAv9L,KAAA2E,OACA3E,KAAAo8J,GAAAp8J,KAAAgiM,KAAAhiM,KAAAgO,EAAAovL,OACAp9L,KAAAiiM,KAAAjiM,KAAAgO,EAAAqxL,OAAAr/L,KAAA9gB,GAEA8gB,KAAAkiM,KAAAliM,KAAAiiM,KAAArS,IAAA5vL,KAAAgO,GAAA0jL,MAAA,GAAAp+B,IAAAtzJ,KAAA9gB,GACA8gB,KAAAkiM,KAAAliM,KAAAkiM,KAAAhT,KAAAlvL,KAAAgO,GACAhO,KAAAkiM,KAAAliM,KAAAgO,EAAAsjB,IAAAtxB,KAAAkiM,MA9aAV,EAAA7jM,UAAA8jM,KAAA,WACA,IAAArmM,EAAA,IAAA2yL,EAAA,MAEA,OADA3yL,EAAA43L,MAAA,IAAAn1L,MAAAj4B,KAAAwhL,KAAApnJ,KAAA/rG,EAAA,KACAmnG,GAGAomM,EAAA7jM,UAAAwkM,QAAA,SAAAzwL,GAGA,IACA0wL,EADAp0L,EAAA0D,EAGA,GACA1R,KAAAlgB,MAAAkuB,EAAAhO,KAAA5E,KAGAgnM,GADAp0L,GADAA,EAAAhO,KAAAqiM,MAAAr0L,IACAohL,KAAApvL,KAAA5E,MACA61K,kBACAmxB,EAAApiM,KAAA/rG,GAEA,IAAAkzG,EAAAi7L,EAAApiM,KAAA/rG,GAAA,EAAA+5G,EAAA0xL,KAAA1/L,KAAA94B,GAgBA,OAfA,IAAAigC,GACA6G,EAAAglL,MAAA,GAAA,EACAhlL,EAAA/oC,OAAA,GACAkiC,EAAA,EACA6G,EAAAqhL,KAAArvL,KAAA94B,QAEAxxE,IAAAs4G,EAAA0lL,MAEA1lL,EAAA0lL,QAGA1lL,EAAAs0L,SAIAt0L,GAGAwzL,EAAA7jM,UAAA7d,MAAA,SAAAkP,EAAA+xC,GACA/xC,EAAA2iM,OAAA3xL,KAAA/rG,EAAA,EAAA8sI,IAGAygK,EAAA7jM,UAAA0kM,MAAA,SAAA3wL,GACA,OAAAA,EAAA69K,KAAAvvL,KAAA3rG,IASAo+R,EAAAiP,EAAAF,GAEAE,EAAA/jM,UAAA7d,MAAA,SAAAkP,EAAA8vI,GAKA,IAHA,IAAAE,EAAA,QAEAujE,EAAA38N,KAAAq0B,IAAAjL,EAAA/pB,OAAA,GACAkC,EAAA,EAAAA,EAAAo7N,EAAAp7N,IACA23J,EAAAk0D,MAAA7rN,GAAA6nB,EAAAgkM,MAAA7rN,GAIA,GAFA23J,EAAA75J,OAAAs9N,EAEAvzM,EAAA/pB,QAAA,EAGA,OAFA+pB,EAAAgkM,MAAA,GAAA,OACAhkM,EAAA/pB,OAAA,GAKA,IAAAkY,EAAA6R,EAAAgkM,MAAA,GAGA,IAFAl0D,EAAAk0D,MAAAl0D,EAAA75J,UAAAkY,EAAA6hJ,EAEA73J,EAAA,GAAAA,EAAA6nB,EAAA/pB,OAAAkC,IAAA,CACA,IAAAiW,EAAA,EAAA4R,EAAAgkM,MAAA7rN,GACA6nB,EAAAgkM,MAAA7rN,EAAA,KAAAiW,EAAA4hJ,IAAA,EAAA7hJ,IAAA,GACAA,EAAAC,EAEAD,KAAA,GACA6R,EAAAgkM,MAAA7rN,EAAA,IAAAgW,EACA,IAAAA,GAAA6R,EAAA/pB,OAAA,GACA+pB,EAAA/pB,QAAA,GAEA+pB,EAAA/pB,QAAA,GAIAy8N,EAAA/jM,UAAA0kM,MAAA,SAAA3wL,GAEAA,EAAAshL,MAAAthL,EAAAzsC,QAAA,EACAysC,EAAAshL,MAAAthL,EAAAzsC,OAAA,GAAA,EACAysC,EAAAzsC,QAAA,EAIA,IADA,IAAAq+K,EAAA,EACAn8K,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IAAA,CACA,IAAAs9I,EAAA,EAAA/yG,EAAAshL,MAAA7rN,GACAm8K,GAAA,IAAA7+B,EACA/yG,EAAAshL,MAAA7rN,GAAA,SAAAm8K,EACAA,EAAA,GAAA7+B,GAAA6+B,EAAA,SAAA,GAUA,OANA,IAAA5xI,EAAAshL,MAAAthL,EAAAzsC,OAAA,KACAysC,EAAAzsC,SACA,IAAAysC,EAAAshL,MAAAthL,EAAAzsC,OAAA,IACAysC,EAAAzsC,UAGAysC,GASA+gL,EAAAkP,EAAAH,GAQA/O,EAAAmP,EAAAJ,GASA/O,EAAAoP,EAAAL,GAEAK,EAAAlkM,UAAA0kM,MAAA,SAAA3wL,GAGA,IADA,IAAAmsH,EAAA,EACA12J,EAAA,EAAAA,EAAAuqC,EAAAzsC,OAAAkC,IAAA,CACA,IAAAk8K,EAAA,IAAA,EAAA3xI,EAAAshL,MAAA7rN,IAAA02J,EACAylB,EAAA,SAAAD,EACAA,KAAA,GAEA3xI,EAAAshL,MAAA7rN,GAAAm8K,EACAzlB,EAAAwlB,EAKA,OAHA,IAAAxlB,IACAnsH,EAAAshL,MAAAthL,EAAAzsC,UAAA44J,GAEAnsH,GAIAq8K,EAAA+T,OAAA,SAAAjvS,GAEA,GAAAsuS,EAAAtuS,GAAA,OAAAsuS,EAAAtuS,GAEA,IAAAu7H,EACA,GAAA,SAAAv7H,EACAu7H,EAAA,IAAAszK,OACA,GAAA,SAAA7uS,EACAu7H,EAAA,IAAAuzK,OACA,GAAA,SAAA9uS,EACAu7H,EAAA,IAAAwzK,MACA,CAAA,GAAA,WAAA/uS,EAGA,MAAA,IAAAimG,MAAA,iBAAAjmG,GAFAu7H,EAAA,IAAAyzK,EAMA,OAFAV,EAAAtuS,GAAAu7H,EAEAA,GAkBA8xK,EAAAviM,UAAAmjM,SAAA,SAAAj6N,GACAgyB,EAAA,IAAAhyB,EAAAksN,SAAA,iCACAl6L,EAAAhyB,EAAAqnN,IAAA,oCAGAgS,EAAAviM,UAAAkjM,SAAA,SAAAh6N,EAAAyS,GACAuf,EAAA,IAAAhyB,EAAAksN,SAAAz5M,EAAAy5M,UAAA,iCACAl6L,EAAAhyB,EAAAqnN,KAAArnN,EAAAqnN,MAAA50M,EAAA40M,IACA,oCAGAgS,EAAAviM,UAAAqkM,KAAA,SAAAn7N,GACA,OAAAm5B,KAAAouB,MAAApuB,KAAAouB,MAAA+zK,QAAAt7N,GAAAu5N,UAAApgM,OAEAo+E,EAAAv3G,EAAAA,EAAAqoN,KAAAlvL,KAAA9gB,GAAAkhN,UAAApgM,OACAn5B,IAGAq5N,EAAAviM,UAAAi4L,IAAA,SAAA/uN,GACA,OAAAA,EAAAgoN,SACAhoN,EAAAwuD,QAGAr1B,KAAA9gB,EAAAoyC,IAAAzqD,GAAAu5N,UAAApgM,OAGAkgM,EAAAviM,UAAA3e,IAAA,SAAAnY,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAmY,IAAA1F,GAIA,OAHAvN,EAAAo7B,IAAAnH,KAAA9gB,IAAA,GACAnT,EAAAsjN,KAAArvL,KAAA9gB,GAEAnT,EAAAq0N,UAAApgM,OAGAkgM,EAAAviM,UAAAyxL,KAAA,SAAAvoN,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAuoN,KAAA91M,GAIA,OAHAvN,EAAAo7B,IAAAnH,KAAA9gB,IAAA,GACAnT,EAAAsjN,KAAArvL,KAAA9gB,GAEAnT,GAGAm0N,EAAAviM,UAAA2zB,IAAA,SAAAzqD,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAyqD,IAAAh4C,GAIA,OAHAvN,EAAAimN,KAAA,GAAA,GACAjmN,EAAAqjN,KAAApvL,KAAA9gB,GAEAnT,EAAAq0N,UAAApgM,OAGAkgM,EAAAviM,UAAA0xL,KAAA,SAAAxoN,EAAAyS,GACA0mB,KAAA6gM,SAAAh6N,EAAAyS,GAEA,IAAAvN,EAAAlF,EAAAwoN,KAAA/1M,GAIA,OAHAvN,EAAAimN,KAAA,GAAA,GACAjmN,EAAAqjN,KAAApvL,KAAA9gB,GAEAnT,GAGAm0N,EAAAviM,UAAAgjM,IAAA,SAAA95N,EAAA6qC,GAEA,OADA1R,KAAA8gM,SAAAj6N,GACAm5B,KAAAgiM,KAAAn7N,EAAAm3N,MAAAtsL,KAGAwuL,EAAAviM,UAAA4xL,KAAA,SAAA1oN,EAAAyS,GAEA,OADA0mB,KAAA6gM,SAAAh6N,EAAAyS,GACA0mB,KAAAgiM,KAAAn7N,EAAA0oN,KAAAj2M,KAGA4mN,EAAAviM,UAAAiyL,IAAA,SAAA/oN,EAAAyS,GAEA,OADA0mB,KAAA6gM,SAAAh6N,EAAAyS,GACA0mB,KAAAgiM,KAAAn7N,EAAA+oN,IAAAt2M,KAGA4mN,EAAAviM,UAAA0/L,KAAA,SAAAx2N,GACA,OAAAm5B,KAAAuvL,KAAA1oN,EAAAA,EAAAwuD,UAGA6qK,EAAAviM,UAAAy/L,IAAA,SAAAv2N,GACA,OAAAm5B,KAAA4vL,IAAA/oN,EAAAA,IAGAq5N,EAAAviM,UAAAqjM,KAAA,SAAAn6N,GACA,GAAAA,EAAAgoN,SAAA,OAAAhoN,EAAAwuD,QAEA,IAAAmtK,EAAAxiM,KAAA9gB,EAAAuyM,MAAA,GAIA,GAHA54L,EAAA2pM,EAAA,GAAA,GAGA,IAAAA,EAAA,CACA,IAAAnjE,EAAAr/H,KAAA9gB,EAAAF,IAAA,IAAA+uM,EAAA,IAAA4D,OAAA,GACA,OAAA3xL,KAAAq/H,IAAAx4J,EAAAw4J,GAQA,IAFA,IAAA/wH,EAAAtO,KAAA9gB,EAAAo/M,KAAA,GACApiN,EAAA,GACAoyB,EAAAugL,UAAA,IAAAvgL,EAAAmjL,MAAA,IACAv1M,IACAoyB,EAAAqjL,OAAA,GAEA94L,GAAAyV,EAAAugL,UAEA,IAAA4T,EAAA,IAAA1U,EAAA,GAAAE,MAAAjuL,MACA0iM,EAAAD,EAAAjU,SAIAmU,EAAA3iM,KAAA9gB,EAAAo/M,KAAA,GAAA3M,OAAA,GACApsE,EAAAvlH,KAAA9gB,EAAA+xL,YAGA,IAFA1rD,EAAA,IAAAwoE,EAAA,EAAAxoE,EAAAA,GAAA0oE,MAAAjuL,MAEA,IAAAA,KAAAq/H,IAAA9Z,EAAAo9E,GAAAx7L,IAAAu7L,IACAn9E,EAAA8oE,QAAAqU,GAOA,IAJA,IAAAj2N,EAAAuzB,KAAAq/H,IAAA9Z,EAAAj3G,GACAN,EAAAhO,KAAAq/H,IAAAx4J,EAAAynC,EAAA+vL,KAAA,GAAA1M,OAAA,IACA5yI,EAAA/+C,KAAAq/H,IAAAx4J,EAAAynC,GACApvB,EAAAhD,EACA,IAAA6iE,EAAA53C,IAAAs7L,IAAA,CAEA,IADA,IAAArnM,EAAA2jD,EACA53E,EAAA,EAAA,IAAAi0B,EAAA+L,IAAAs7L,GAAAt7N,IACAi0B,EAAAA,EAAA+yL,SAEAt1L,EAAA1xB,EAAA+X,GACA,IAAA5F,EAAA0mB,KAAAq/H,IAAA5yJ,EAAA,IAAAshN,EAAA,GAAAwP,OAAAr+M,EAAA/X,EAAA,IAEA6mC,EAAAA,EAAA4yL,OAAAtnN,GACA7M,EAAA6M,EAAA60M,SACApvI,EAAAA,EAAA6hJ,OAAAn0N,GACAyS,EAAA/X,EAGA,OAAA6mC,GAGAkyL,EAAAviM,UAAA6hM,KAAA,SAAA34N,GACA,IAAA+7N,EAAA/7N,EAAAw4N,OAAAr/L,KAAA9gB,GACA,OAAA,IAAA0jN,EAAA7P,UACA6P,EAAA7P,SAAA,EACA/yL,KAAAgiM,KAAAY,GAAApU,UAEAxuL,KAAAgiM,KAAAY,IAIA1C,EAAAviM,UAAA0hI,IAAA,SAAAx4J,EAAA6qC,GACA,GAAAA,EAAAm9K,SAAA,OAAA,IAAAd,EAAA,GAAAE,MAAAjuL,MACA,GAAA,IAAA0R,EAAAsgL,KAAA,GAAA,OAAAnrN,EAAAwuD,QAEA,IACAwtK,EAAA,IAAAhlM,MAAA,IACAglM,EAAA,GAAA,IAAA9U,EAAA,GAAAE,MAAAjuL,MACA6iM,EAAA,GAAAh8N,EACA,IAAA,IAAAM,EAAA,EAAAA,EAAA07N,EAAA59N,OAAAkC,IACA07N,EAAA17N,GAAA64B,KAAA4vL,IAAAiT,EAAA17N,EAAA,GAAAN,GAGA,IAAAkF,EAAA82N,EAAA,GACAnzJ,EAAA,EACAozJ,EAAA,EACA9tN,EAAA08B,EAAAu/J,YAAA,GAKA,IAJA,IAAAj8L,IACAA,EAAA,IAGA7N,EAAAuqC,EAAAzsC,OAAA,EAAAkC,GAAA,EAAAA,IAAA,CAEA,IADA,IAAAq7C,EAAA9Q,EAAAshL,MAAA7rN,GACAmqB,EAAAtc,EAAA,EAAAsc,GAAA,EAAAA,IAAA,CACA,IAAAmlM,EAAAj0K,GAAAlxB,EAAA,EACAvlB,IAAA82N,EAAA,KACA92N,EAAAi0B,KAAAo9L,IAAArxN,IAGA,IAAA0qN,GAAA,IAAA/mJ,GAKAA,IAAA,EACAA,GAAA+mJ,GA9BA,MA+BAqM,GACA,IAAA37N,GAAA,IAAAmqB,KAEAvlB,EAAAi0B,KAAA4vL,IAAA7jN,EAAA82N,EAAAnzJ,IACAozJ,EAAA,EACApzJ,EAAA,IAXAozJ,EAAA,EAaA9tN,EAAA,GAGA,OAAAjJ,GAGAm0N,EAAAviM,UAAAwiM,UAAA,SAAAzuL,GACA,IAAA1D,EAAA0D,EAAAw9K,KAAAlvL,KAAA9gB,GAEA,OAAA8uB,IAAA0D,EAAA1D,EAAAqnB,QAAArnB,GAGAkyL,EAAAviM,UAAA2iM,YAAA,SAAA5uL,GACA,IAAA3lC,EAAA2lC,EAAA2jB,QAEA,OADAtpD,EAAAmiN,IAAA,KACAniN,GAOAgiN,EAAAgV,KAAA,SAAArxL,GACA,OAAA,IAAAqwL,EAAArwL,IAmBA+gL,EAAAsP,EAAA7B,GAEA6B,EAAApkM,UAAAwiM,UAAA,SAAAzuL,GACA,OAAA1R,KAAAgiM,KAAAtwL,EAAAssL,MAAAh+L,KAAA2E,SAGAo9L,EAAApkM,UAAA2iM,YAAA,SAAA5uL,GACA,IAAA1D,EAAAhO,KAAAgiM,KAAAtwL,EAAAk+K,IAAA5vL,KAAAiiM,OAEA,OADAj0L,EAAAkgL,IAAA,KACAlgL,GAGA+zL,EAAApkM,UAAA4xL,KAAA,SAAA1oN,EAAAyS,GACA,GAAAzS,EAAAgoN,UAAAv1M,EAAAu1M,SAGA,OAFAhoN,EAAAmsN,MAAA,GAAA,EACAnsN,EAAA5B,OAAA,EACA4B,EAGA,IAAAk4E,EAAAl4E,EAAA0oN,KAAAj2M,GACA7M,EAAAsyE,EAAAq/I,MAAAp+L,KAAA2E,OAAAirL,IAAA5vL,KAAAkiM,MAAA/D,OAAAn+L,KAAA2E,OAAAirL,IAAA5vL,KAAA9gB,GACAg1G,EAAAn1C,EAAAswI,KAAA5iN,GAAAklN,OAAA3xL,KAAA2E,OACA54B,EAAAmoH,EAQA,OANAA,EAAA/sF,IAAAnH,KAAA9gB,IAAA,EACAnT,EAAAmoH,EAAAm7F,KAAArvL,KAAA9gB,GACAg1G,EAAA89F,KAAA,GAAA,IACAjmN,EAAAmoH,EAAAk7F,KAAApvL,KAAA9gB,IAGAnT,EAAAq0N,UAAApgM,OAGA+hM,EAAApkM,UAAAiyL,IAAA,SAAA/oN,EAAAyS,GACA,GAAAzS,EAAAgoN,UAAAv1M,EAAAu1M,SAAA,OAAA,IAAAd,EAAA,GAAAqS,UAAApgM,MAEA,IAAA++C,EAAAl4E,EAAA+oN,IAAAt2M,GACA7M,EAAAsyE,EAAAq/I,MAAAp+L,KAAA2E,OAAAirL,IAAA5vL,KAAAkiM,MAAA/D,OAAAn+L,KAAA2E,OAAAirL,IAAA5vL,KAAA9gB,GACAg1G,EAAAn1C,EAAAswI,KAAA5iN,GAAAklN,OAAA3xL,KAAA2E,OACA54B,EAAAmoH,EAOA,OANAA,EAAA/sF,IAAAnH,KAAA9gB,IAAA,EACAnT,EAAAmoH,EAAAm7F,KAAArvL,KAAA9gB,GACAg1G,EAAA89F,KAAA,GAAA,IACAjmN,EAAAmoH,EAAAk7F,KAAApvL,KAAA9gB,IAGAnT,EAAAq0N,UAAApgM,OAGA+hM,EAAApkM,UAAA6hM,KAAA,SAAA34N,GAGA,OADAm5B,KAAAgiM,KAAAn7N,EAAAw4N,OAAAr/L,KAAA9gB,GAAA0wM,IAAA5vL,KAAAo8J,KACAgkC,UAAApgM,OAx9GA,MA09GA,IAAA3sG,GAAAA,EAAA2sG,sDC19GIihJ,EAAO1tP,EAAQ,UACf44V,EAAQ54V,EAAQ,gBAChB64V,EAAU74V,EAAQ,aAClB4rR,EAAU5rR,EAAQ,kBAClB84V,EAAS94V,EAAQ,UACjB0vP,EAAS1vP,EAAQ,eAAe0vP,OAGpC,SAAAinG,EAAoBr6I,OACdsnB,EACkB,iBAAXtnB,GAAwBozC,EAAO8H,SAASl7C,KACjDsnB,EAAWtnB,EAAOy8I,WAClBz8I,EAASA,EAAO76M,KAEI,iBAAX66M,IACTA,EAASozC,EAAOx5F,KAAKomD,QAOnB08I,EAASC,EAJTC,EAAWL,EAAQv8I,EAAQsnB,GAE3BrwJ,EAAO2lR,EAASjoR,IAChBkoF,EAAO+/L,EAAS//L,YAEZ5lF,OACD,cACH0lR,EAAQvrG,EAAKyrG,YAAYtoP,OAAOsoD,EAAM,OAAOigM,eAAeC,yBAEzD,oBACEJ,IACHA,EAAQvrG,EAAKT,UAAUp8I,OAAOsoD,EAAM,QAEtC6/L,EAAUC,EAAMjvF,UAAUA,UAAUjzL,KAAK,UAElC,8BACI22K,EAAK4rG,aAAazoP,OAAOooP,EAAMM,iBAAiBpgM,KAAM,WAC1D,2BACH8/L,EAAMO,kBAAoBP,EAAMM,kBAE9BhmR,KAAM,KACN4lF,KAAM8/L,OAEL,2BACHA,EAAMjvF,UAAUhnL,OAAOy2Q,QAAU/rG,EAAKgsG,SAAS7oP,OAAOooP,EAAMM,iBAAiBpgM,KAAM,QAEjF5lF,KAAM,MACN4lF,KAAM8/L,EAAMjvF,UAAUhnL,0BAEPuiB,MAAM,kBAAoByzP,OAG5C,wBAEH7/L,EAyCN,SAAkBA,EAAMyqE,OAClB0mC,EAAOnxG,EAAK6wG,UAAUgE,QAAQ2rF,IAAIC,UAAUtvF,KAC5CuvF,EAAQhnR,SAASsmF,EAAK6wG,UAAUgE,QAAQ2rF,IAAIC,UAAUC,MAAMhvP,WAAY,IACxEg/O,EAAO+O,EAAMz/L,EAAK6wG,UAAUgE,QAAQ7C,OAAO0+E,KAAK9yQ,KAAK,MACrDm0L,EAAK/xG,EAAK6wG,UAAUgE,QAAQ7C,OAAOD,GACnC4uF,EAAa3gM,EAAKqgM,kBAClB1iF,EAASjkM,SAASg3Q,EAAKt9P,MAAM,KAAK,GAAI,IAAM,EAC5C9qF,EAAMq3V,EAAO1iF,WAAWxyC,EAAU0mC,EAAMuvF,EAAO/iF,EAAQ,QACvD3L,EAASygB,EAAQw7B,iBAAiByiC,EAAMpoV,EAAKypQ,GAC7C19H,EAAAA,UACJA,EAAIj2D,KAAK4zL,EAAO/oG,OAAO03L,IACvBtsN,EAAIj2D,KAAK4zL,EAAOkyE,SACT3tF,EAAOpxJ,OAAOkvC,GArDVwgI,CADP70G,EAAOu0F,EAAKqsG,oBAAoBlpP,OAAOsoD,EAAM,OACxByqE,OAElB,qBAEHo1H,GADAC,EAAQvrG,EAAKvB,WAAWt7I,OAAOsoD,EAAM,QACrB6wG,UAAUA,UAAUjzL,KAAK,UAElC,8BACI22K,EAAKssG,cAAcnpP,OAAOooP,EAAMO,kBAAmB,WACvD,2BAEDj/D,MAAO0+D,EAAMjvF,UAAUuwB,MACvBtb,WAAYvxB,EAAKusG,aAAappP,OAAOooP,EAAMO,kBAAmB,OAAOv6E,gBAEpE,2BACHg6E,EAAMjvF,UAAUhnL,OAAOu0Q,SAAW7pG,EAAKgsG,SAAS7oP,OAAOooP,EAAMO,kBAAmB,QAE9EjmR,KAAM,MACNyP,OAAQi2Q,EAAMjvF,UAAUhnL,0BAETuiB,MAAM,kBAAoByzP,OAG5C,wBACItrG,EAAK4rG,aAAazoP,OAAOsoD,EAAM,WACnC,yBACIu0F,EAAKssG,cAAcnpP,OAAOsoD,EAAM,WACpC,yBAED5lF,KAAM,MACNyP,OAAQ0qK,EAAKwsG,cAAcrpP,OAAOsoD,EAAM,YAEvC,wBAGDohI,OAFFphI,EAAOu0F,EAAKusG,aAAappP,OAAOsoD,EAAM,QAExB5R,WAAWpnJ,MACvB8+Q,WAAY9lH,EAAK8lH,8BAEF15K,MAAM,oBAAsBhyB,IAnFnDzzE,EAAOC,QAAU42V,EAsFjBA,EAAUjjQ,UAAYg6J,EAAKh6J,iKC1F3B,aAEA,IAAAg6J,EAAA1tP,EAAA,WAEAD,EAAAo5V,YAAAn5V,EAAA,iBAEA,IAAAg6V,EAAAtsG,EAAAmkE,OAAA,iBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,WAAA67H,MACA7wB,KAAAhrG,IAAA,WAAA67H,MACA7wB,KAAAhrG,IAAA,kBAAA67H,MACA7wB,KAAAhrG,IAAA,mBAAA67H,MACA7wB,KAAAhrG,IAAA,UAAA67H,MACA7wB,KAAAhrG,IAAA,UAAA67H,MACA7wB,KAAAhrG,IAAA,aAAA67H,MACA7wB,KAAAhrG,IAAA,aAAA67H,MACA7wB,KAAAhrG,IAAA,eAAA67H,UAGAv9H,EAAAi6V,cAAAA,EAEA,IAAAV,EAAA5rG,EAAAmkE,OAAA,gBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,WAAA67H,MACA7wB,KAAAhrG,IAAA,kBAAA67H,UAGAv9H,EAAAu5V,aAAAA,EAEA,IAAArsG,EAAAS,EAAAmkE,OAAA,wBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,aAAA/B,IAAA06V,GACA3tP,KAAAhrG,IAAA,oBAAA44V,aAGAt6V,EAAAktP,UAAAA,EAEA,IAAAmtG,EAAA1sG,EAAAmkE,OAAA,uBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,aAAA64V,QACA7tP,KAAAhrG,IAAA,QAAA84V,QAAAluN,WACA5/B,KAAAhrG,IAAA,SAAA64V,QAAAjuN,WACA5/B,KAAAhrG,IAAA,UAAA04V,MAAA7uP,IACAmB,KAAAhrG,IAAA,KAAA67H,MACA7wB,KAAAhrG,IAAA,KAAA67H,MACA7wB,KAAAhrG,IAAA,KAAA67H,OACA+O,eAIAmuN,EAAA9sG,EAAAmkE,OAAA,kBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,WAAA67H,MACA7wB,KAAAhrG,IAAA,aAAA/B,IAAA06V,GACA3tP,KAAAhrG,IAAA,qBAAAg5V,aAGA16V,EAAAosP,WAAAquG,EACA,IAAAE,EAAAhtG,EAAAmkE,OAAA,2BAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,aAAA04V,MAAA7uP,IACAmB,KAAAhrG,IAAA,MAAA64V,QACA7tP,KAAAhrG,IAAA,WAAA04V,MAAA7uP,IACAmB,KAAAhrG,IAAA,OAAA04V,MAAA7uP,IACAmB,KAAAhrG,IAAA,MAAA64V,QACA7tP,KAAAhrG,IAAA,aAAA04V,MAAA7uP,IACAmB,KAAAhrG,IAAA,QAAAg5V,SACAhuP,KAAAhrG,IAAA,SAAA67H,QAGA7wB,KAAAhrG,IAAA,UAAA04V,MAAA7uP,IACAmB,KAAAhrG,IAAA,QAAA64V,QACA7tP,KAAAhrG,IAAA,MAAAg5V,YAIAhuP,KAAAhrG,IAAA,qBAAAg5V,aAIA16V,EAAAg6V,oBAAAW,EAEA,IAAAR,EAAAxsG,EAAAmkE,OAAA,iBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,WAAA67H,MACA7wB,KAAAhrG,IAAA,KAAA67H,MACA7wB,KAAAhrG,IAAA,KAAA67H,MACA7wB,KAAAhrG,IAAA,KAAA67H,MACA7wB,KAAAhrG,IAAA,WAAA67H,MACA7wB,KAAAhrG,IAAA,YAAA67H,UAGAv9H,EAAAm6V,cAAAA,EAEAn6V,EAAA25V,SAAAhsG,EAAAmkE,OAAA,YAAA,WACAplN,KAAA6wB,SAGA,IAAA28N,EAAAvsG,EAAAmkE,OAAA,gBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,WAAA67H,MACA7wB,KAAAhrG,IAAA,cAAAg5V,SACAhuP,KAAAhrG,IAAA,cAAA4qI,WAAAsuN,SAAA,GAAAj7V,IAAAk7V,GACAnuP,KAAAhrG,IAAA,aAAA4qI,WAAAsuN,SAAA,GAAAN,aAGAt6V,EAAAk6V,aAAAA,EAEA,IAAAW,EAAAltG,EAAAmkE,OAAA,gBAAA,WACAplN,KAAAouP,OAAA,CACAz0C,WAAA35M,KAAA6tP,aAIAv6V,EAAA2zF,UAAAg6J,EAAAmkE,OAAA,aAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,KAAA67H,MACA7wB,KAAAhrG,IAAA,KAAA67H,iFCvHA,aAEA,MAAAowH,EAAA3tP,EAEA2tP,EAAAotG,OAAA96V,EAAA,SAEA0tP,EAAAmkE,OAAA7xT,EAAA,cAAA6xT,OACAnkE,EAAA7gH,KAAA7sI,EAAA,eACA0tP,EAAA7kB,UAAA7oO,EAAA,oBACA0tP,EAAAqtG,SAAA/6V,EAAA,mBACA0tP,EAAAstG,SAAAh7V,EAAA,0LCVA,aAEA,MAAAg7V,EAAAh7V,EAAA,cACA+6V,EAAA/6V,EAAA,cACAk/R,EAAAl/R,EAAA,YAQA,SAAAi7V,EAAA37V,EAAAozE,GACA+5B,KAAAntG,KAAAA,EACAmtG,KAAA/5B,KAAAA,EAEA+5B,KAAAsuP,SAAA,GACAtuP,KAAAuuP,SAAA,GAXAj7V,EAEA8xT,OAAA,SAAAvyT,EAAAozE,GACA,OAAA,IAAAuoR,EAAA37V,EAAAozE,IAWAuoR,EAAA7wP,UAAA8wP,aAAA,SAAA1xH,GACA,MAAAlqO,EAAAmtG,KAAAntG,KAEA,SAAA67V,EAAAltN,GACAxhC,KAAA2uP,WAAAntN,EAAA3uI,GAOA,OALA4/R,EAAAi8D,EAAA3xH,GACA2xH,EAAA/wP,UAAAgxP,WAAA,SAAAntN,EAAA3uI,GACAkqO,EAAAn/H,KAAAoC,KAAAwhC,EAAA3uI,IAGA,IAAA67V,EAAA1uP,OAGAwuP,EAAA7wP,UAAAixP,YAAA,SAAAjyH,GAKA,OAJAA,EAAAA,GAAA,MAEA38H,KAAAsuP,SAAA9zP,eAAAmiI,KACA38H,KAAAsuP,SAAA3xH,GAAA38H,KAAAyuP,aAAAH,EAAA3xH,KACA38H,KAAAsuP,SAAA3xH,IAGA6xH,EAAA7wP,UAAAyG,OAAA,SAAAsoD,EAAAiwE,EAAAhoO,GACA,OAAAqrG,KAAA4uP,YAAAjyH,GAAAv4H,OAAAsoD,EAAA/3J,IAGA65V,EAAA7wP,UAAAkxP,YAAA,SAAAlyH,GAKA,OAJAA,EAAAA,GAAA,MAEA38H,KAAAuuP,SAAA/zP,eAAAmiI,KACA38H,KAAAuuP,SAAA5xH,GAAA38H,KAAAyuP,aAAAF,EAAA5xH,KACA38H,KAAAuuP,SAAA5xH,IAGA6xH,EAAA7wP,UAAA2F,OAAA,SAAAopD,EAAAiwE,EAAAmyH,GACA,OAAA9uP,KAAA6uP,YAAAlyH,GAAAr5H,OAAAopD,EAAAoiM,4FCvDA,aAEA,MAAAP,EAAAj7V,EAEAi7V,EAAAvtG,IAAAztP,EAAA,SACAg7V,EAAAlvF,IAAA9rQ,EAAA,sECLA,mBAEMk/R,EAAWl/R,EAAQ,YACnB0vP,EAAS1vP,EAAQ,gBAAgB0vP,OACjC93F,EAAO53J,EAAQ,gBAGfytP,EAAMztP,EAAQ,oBAEpB,SAAAw7V,EAAoBvtN,GAClBxhC,KAAK28H,IAAM,MACX38H,KAAKntG,KAAO2uI,EAAO3uI,KACnBmtG,KAAKwhC,OAASA,EAGdxhC,KAAKgvP,KAAAA,IAAWC,EAChBjvP,KAAKgvP,KAAKjtF,MAAMvgI,EAAOv7D,MAUzB,SAAAgpR,EAAiBxoR,GACf0kF,EAAKvtD,KAAKoC,KAAM,MAAOv5B,GAmHzB,SAAA48N,EAAa3xL,UACPA,EAAM,GACD,IAAMA,EAENA,EAhIXr+G,EAAOC,QAAUy7V,EAEjBA,EAAWpxP,UAAU2F,OAAS,SAAgBopD,EAAMoiM,UAC3C9uP,KAAKgvP,KAAKppD,QAAQl5I,EAAMoiM,GAAUxkR,QAQ3CmoN,EAASw8D,EAAS9jM,GAElB8jM,EAAQtxP,UAAUuxP,iBAAmB,SAAyB1qR,EAC5D2qR,EACA7qM,EACAv9E,SACMqoR,EA2OR,SAAmB5qR,EAAK2qR,EAAW7qM,EAAKwqM,OAClC/iR,EAEQ,UAARvH,EACFA,EAAM,MACS,UAARA,IACPA,EAAM,UAEJw8K,EAAIquG,UAAU70P,eAAeh2B,GAC/BuH,EAAMi1K,EAAIquG,UAAU7qR,OAAAA,CAAAA,GACE,iBAARA,IAA2B,EAANA,KAAaA,EAC1CA,OAECsqR,EAASv/Q,MAAM,gBAAkB/K,GAFxCuH,EAAMvH,KAIJuH,GAAO,GAAA,OACF+iR,EAASv/Q,MAAM,wCAEnB4/Q,IACHpjR,GAAO,WAETA,GAAQi1K,EAAIsuG,eAAehrM,GAAO,cAAgB,EAE3Cv4E,EAlQYwjR,CAAU/qR,EAAK2qR,EAAW7qM,EAAKtkD,KAAK8uP,aAGnD/nR,EAAQ9B,OAAS,IAAA,OACbulM,EAASvnB,EAAOO,MAAM,UAC5BgnB,EAAO,GAAK4kF,EACZ5kF,EAAO,GAAKzjM,EAAQ9B,OACb+6B,KAAKwvP,qBAAAA,CAAuBhlF,EAAQzjM,QAKzC0oR,EAAY,UACPtoR,EAAIJ,EAAQ9B,OAAQkC,GAAK,IAAOA,IAAM,EAC7CsoR,UAEIjlF,EAASvnB,EAAOO,MAAM,EAAQisG,GACpCjlF,EAAO,GAAK4kF,EACZ5kF,EAAO,GAAK,IAAOilF,UAEVtoR,EAAI,EAAIsoR,EAAWn+P,EAAIvqB,EAAQ9B,OAAQqsB,EAAI,EAAGnqB,IAAKmqB,IAAM,EAChEk5K,EAAOrjM,GAAS,IAAJmqB,SAEP0O,KAAKwvP,qBAAAA,CAAuBhlF,EAAQzjM,KAG7CkoR,EAAQtxP,UAAU+xP,WAAa,SAAmBl6P,EAAKhxB,MACzC,WAARA,SACKw7B,KAAKwvP,qBAAAA,CAAoC,EAAbh6P,EAAIu5J,OAAYv5J,EAAIk3D,UACtC,WAARloF,EAAQ,OACX+rJ,EAAM0yB,EAAOO,MAAmB,EAAbhuJ,EAAIvwB,gBACpBkC,EAAI,EAAGA,EAAIquB,EAAIvwB,OAAQkC,IAC9BopJ,EAAIkkG,cAAcj/N,EAAIvd,WAAW9Q,GAAQ,EAAJA,UAEhC64B,KAAKwvP,qBAAqBj/H,SAChB,WAAR/rJ,EACJw7B,KAAK2vP,UAAUn6P,GAIbwK,KAAKwvP,qBAAqBh6P,GAHxBwK,KAAK8uP,SAASv/Q,MAAM,kEAIZ,aAAR/K,EACJw7B,KAAK4vP,YAAYp6P,GAQfwK,KAAKwvP,qBAAqBh6P,GAPxBwK,KAAK8uP,SAASv/Q,MAAM,4NAQb9J,KAAKjB,IAEJ,YAARA,EADFw7B,KAAKwvP,qBAAqBh6P,GAI1BwK,KAAK8uP,SAASv/Q,MAAM,4BAA8B/K,EAC9B,iBAI/ByqR,EAAQtxP,UAAUkyP,aAAe,SAAqB5rQ,EAAImZ,EAAQgE,MAC9C,iBAAPnd,EAAO,KACXmZ,EAAAA,OACI4C,KAAK8uP,SAASv/Q,MAAM,mDACxB6tB,EAAO5C,eAAevW,GAAAA,OAClB+b,KAAK8uP,SAASv/Q,MAAM,iCAC7B0U,EAAKmZ,EAAOnZ,GAAInE,MAAM,mBACb3Y,EAAI,EAAGA,EAAI8c,EAAGhf,OAAQkC,IAC7B8c,EAAG9c,IAAM,UACF02B,MAAM/gB,QAAQmH,GAAAA,CACvBA,EAAKA,EAAG7e,gBACC+B,EAAI,EAAGA,EAAI8c,EAAGhf,OAAQkC,IAC7B8c,EAAG9c,IAAM,MAGR02B,MAAM/gB,QAAQmH,UACV+b,KAAK8uP,SAASv/Q,MAAM,kDACU1H,KAAKC,UAAUmc,QAGjDmd,EAAAA,IACCnd,EAAG,IAAM,GAAA,OACJ+b,KAAK8uP,SAASv/Q,MAAM,+BAC7B0U,EAAGxZ,OAAO,EAAG,EAAW,GAARwZ,EAAG,GAAUA,EAAG,QAI9BgZ,EAAO,UACF91B,EAAI,EAAGA,EAAI8c,EAAGhf,OAAQkC,IAAAA,KACzBqhE,EAAQvkD,EAAG9c,OACV81B,IAAQurC,GAAS,IAAMA,IAAU,EACpCvrC,UAGE4wP,EAAQ5qG,EAAOO,MAAMvmJ,OACvBl4B,EAAS8oR,EAAM5oR,OAAS,UACnBkC,EAAI8c,EAAGhf,OAAS,EAAGkC,GAAK,EAAGA,IAAAA,KAC9BqhE,EAAQvkD,EAAG9c,OACf0mR,EAAM9oR,KAAoB,IAARyjE,GACVA,IAAU,GAAK,GACrBqlN,EAAM9oR,KAAY,IAAgB,IAARyjE,SAGvBxoC,KAAKwvP,qBAAqB3B,IAUnCoB,EAAQtxP,UAAUmyP,YAAc,SAAoB10I,EAAM52I,OACpDgxB,QACE06J,EAAAA,IAAWnyJ,KAAKq9G,SAEV,YAAR52I,EACFgxB,EAAAA,CACE6tM,EAAInzC,EAAKmB,kBACTgyC,EAAInzC,EAAKoB,cAAgB,GACzB+xC,EAAInzC,EAAKqB,cACT8xC,EAAInzC,EAAKsB,eACT6xC,EAAInzC,EAAKuB,iBACT4xC,EAAInzC,EAAKwB,iBACT,KACApnL,KAAK,IACU,YAAR9F,EACTgxB,EAAAA,CACE6tM,EAAInzC,EAAKmB,iBAAmB,KAC5BgyC,EAAInzC,EAAKoB,cAAgB,GACzB+xC,EAAInzC,EAAKqB,cACT8xC,EAAInzC,EAAKsB,eACT6xC,EAAInzC,EAAKuB,iBACT4xC,EAAInzC,EAAKwB,iBACT,KACApnL,KAAK,IAEP01B,KAAK8uP,SAASv/Q,MAAM,YAAc/K,EAAM,8BAGnCw7B,KAAK0vP,WAAWl6P,EAAK,WAG9By5P,EAAQtxP,UAAUoyP,YAAc,kBACvB/vP,KAAKwvP,qBAAqB,KAGnCP,EAAQtxP,UAAUqyP,WAAa,SAAmBt+O,EAAKtU,MAClC,iBAARsU,EAAQ,KACZtU,EAAAA,OACI4C,KAAK8uP,SAASv/Q,MAAM,mDACxB6tB,EAAO5C,eAAekX,UAClB1R,KAAK8uP,SAASv/Q,MAAM,+BACA1H,KAAKC,UAAU4pC,IAE5CA,EAAMtU,EAAOsU,MAII,iBAARA,IAAqBuxI,EAAO8H,SAASr5I,GAAAA,OACxCu+O,EAAWv+O,EAAIvO,WAChBuO,EAAI42I,MAAsB,IAAd2nG,EAAS,IACxBA,EAASn3Q,QAAQ,GAEnB44B,EAAMuxI,EAAOx5F,KAAKwmM,MAGhBhtG,EAAO8H,SAASr5I,GAAAA,KACdzU,EAAOyU,EAAIzsC,OACI,IAAfysC,EAAIzsC,QACNg4B,UAEI8jC,EAAMkiH,EAAOO,MAAMvmJ,UACzByU,EAAIz0G,KAAK8jI,GACU,IAAfrvB,EAAIzsC,SACN87D,EAAI,GAAK,GACJ/gC,KAAKwvP,qBAAqBzuN,MAG/BrvB,EAAM,IAAA,OACD1R,KAAKwvP,qBAAqB99O,MAE/BA,EAAM,IAAA,OACD1R,KAAKwvP,qBAAAA,CAAsB,EAAG99O,QAEnCzU,EAAO,UACF91B,EAAIuqC,EAAKvqC,GAAK,IAAOA,IAAM,EAClC81B,UAEI8jC,EAAAA,IAAUljC,MAAMZ,WACb91B,EAAI45D,EAAI97D,OAAS,EAAGkC,GAAK,EAAGA,IACnC45D,EAAI55D,GAAW,IAANuqC,EACTA,IAAQ,SAEE,IAATqvB,EAAI,IACLA,EAAIjoD,QAAQ,GAGPknB,KAAKwvP,qBAAqBvsG,EAAOx5F,KAAK1oB,KAG/CkuN,EAAQtxP,UAAUuyP,YAAc,SAAoBx8V,UAC3CssG,KAAKwvP,qBAAqB97V,EAAQ,IAAO,IAGlDu7V,EAAQtxP,UAAUwyP,KAAO,SAAa3uN,EAAQ3iC,SACtB,mBAAX2iC,IACTA,EAASA,EAAO3iC,IACX2iC,EAAOqtN,YAAY,OAAOG,MAGnCC,EAAQtxP,UAAUyyP,aAAe,SAAqBC,EAAYvB,EAAUroR,SACpEqiD,EAAQ9oB,KAAKswP,eACfnpR,KACqB,OAArB2hD,EAAM,QAAe,OAChB,QAEH4jC,EAAO2jM,EAAW/lR,eACI50E,IAAxBozH,EAAMynO,gBACRznO,EAAMynO,cAAgBvwP,KAAKwwP,aAAa1nO,EAAM,QAAYgmO,EAAUroR,GAAQ6D,QAE1EoiF,EAAKznF,SAAW6jD,EAAMynO,cAActrR,OAAAA,OAC/B,MAEJkC,EAAE,EAAGA,EAAIulF,EAAKznF,OAAQkC,IAAAA,GACrBulF,EAAKvlF,KAAO2hD,EAAMynO,cAAcppR,GAAAA,OAC3B,SAEJ,0HCvQT,iBAOInyE,iBALA66M,EAASt8M,EAAQ,UACjB0vP,EAASpzC,EAAOozC,OAEhBwtG,EAAAA,OAICz7V,KAAO66M,EACLA,EAAOr1G,eAAexlG,IACf,eAARA,GAAgC,WAARA,IAC5By7V,EAAMz7V,GAAO66M,EAAO76M,QAGlB07V,EAAQD,EAAMxtG,OAAAA,OACbjuP,KAAOiuP,EACLA,EAAOzoJ,eAAexlG,IACf,gBAARA,GAAiC,oBAARA,IAC7B07V,EAAM17V,GAAOiuP,EAAOjuP,OAGtBy7V,EAAMxtG,OAAOtlJ,UAAYslJ,EAAOtlJ,UAE3B+yP,EAAMjnM,MAAQinM,EAAMjnM,OAASgvE,WAAWhvE,OAC3CinM,EAAMjnM,KAAO,SAAU/1J,EAAO26T,EAAkBppP,MACzB,iBAAVvxE,YACCqxG,UAAU,yEAA2ErxG,MAE7FA,QAAiC,IAAjBA,EAAMuxE,iBACd8/B,UAAU,yHAA2HrxG,UAE1IuvP,EAAOvvP,EAAO26T,EAAkBppP,KAItCyrR,EAAMltG,QACTktG,EAAMltG,MAAQ,SAAUvmJ,EAAMu0L,EAAMj1D,MACd,iBAATt/H,YACC8H,UAAU,oEAAsE9H,MAExFA,EAAO,GAAKA,GAAQ,GAAK,GAAK,cACtBsiI,WAAW,cAAgBtiI,EAAO,sCAE1CszH,EAAM0yB,EAAOhmJ,UACZu0L,GAAwB,IAAhBA,EAAKvsN,OAEa,iBAAbs3J,EAChBhM,EAAIihE,KAAKA,EAAMj1D,GAEfhM,EAAIihE,KAAKA,GAJTjhE,EAAIihE,KAAK,GAMJjhE,KAINkgI,EAAME,qBAEPF,EAAME,iBAAmB7+J,EAAQjiB,QAAQ,UAAU8gL,uBAC5C58V,IAMN08V,EAAMr0H,YACTq0H,EAAMr0H,UAAAA,CACJw0H,WAAYH,EAAMl/B,YAEhBk/B,EAAME,mBACRF,EAAMr0H,UAAUy0H,kBAAoBJ,EAAME,mBAI9Ct9V,EAAOC,QAAUm9V,8DC5EjB,aAEA,MAAAK,EAAAv9V,EAAA,oBAAAu9V,SACAC,EAAAx9V,EAAA,kBAAAw9V,cACAC,EAAAz9V,EAAA,kBAAAy9V,cACAn4P,EAAAtlG,EAAA,uBAGA2mN,EAAA,CACA,MAAA,QAAA,MAAA,QAAA,QAAA,OACA,UAAA,UAAA,QAAA,OAAA,MAAA,UACA,SAAA,SAAA,UAAA,SAAA,WAAA,SAAA,YACA,SAAA,SAAA,WAAA,SAAA,SAAA,UAAA,YAIAlyB,EAAA,CACA,MAAA,MAAA,MAAA,WAAA,WAAA,WAAA,MAAA,SACA,MAAA,YACAn2F,OAAAqoH,GAYA,SAAA/uD,EAAAwxE,EAAAl2J,EAAA5zE,GACA,MAAAi2H,EAAA,GACA9oB,KAAAswP,WAAAxnO,EAEAA,EAAAj2H,KAAAA,EACAi2H,EAAA6zG,IAAAA,EAEA7zG,EAAAriD,OAAAA,GAAA,KACAqiD,EAAAv/C,SAAA,KAGAu/C,EAAAtkD,IAAA,KACAskD,EAAA1yC,KAAA,KACA0yC,EAAAmoO,YAAA,KACAnoO,EAAAslO,OAAA,KACAtlO,EAAA8W,UAAA,EACA9W,EAAAooO,KAAA,EACApoO,EAAAjqB,KAAA,EACAiqB,EAAA71H,IAAA,KACA61H,EAAAqoO,WAAA,KACAroO,EAAA9zH,IAAA,KACA8zH,EAAA,QAAA,KACAA,EAAAolO,SAAA,KACAplO,EAAAsoO,SAAA,KACAtoO,EAAAuoO,SAAA,KAGAvoO,EAAAriD,SACAqiD,EAAAv/C,SAAA,GACAy2B,KAAAsxP,SAGAj+V,EAAAC,QAAA63J,EAEA,MAAAomM,EAAA,CACA,MAAA,SAAA,WAAA,MAAA,OAAA,cAAA,SACA,WAAA,MAAA,MAAA,MAAA,aAAA,MAAA,UAAA,WACA,WAAA,YAGApmM,EAAAxtD,UAAA03B,MAAA,WACA,MAAAvM,EAAA9oB,KAAAswP,WACAkB,EAAA,GACAD,EAAAn9V,SAAA,SAAAukF,GACA64Q,EAAA74Q,GAAAmwC,EAAAnwC,MAEA,MAAA5M,EAAA,IAAAi0B,KAAA2M,YAAA6kP,EAAA/qR,QAEA,OADAsF,EAAAukR,WAAAkB,EACAzlR,GAGAo/E,EAAAxtD,UAAA2zP,MAAA,WACA,MAAAxoO,EAAA9oB,KAAAswP,WACAtoK,EAAA5zL,SAAA,SAAAgpI,GACAp9B,KAAAo9B,GAAA,WACA,MAAA/H,EAAA,IAAAr1B,KAAA2M,YAAA3M,MAEA,OADA8oB,EAAAv/C,SAAAuB,KAAAuqD,GACAA,EAAA+H,GAAAgmE,MAAA/tE,EAAAh/C,cAEA2pB,OAGAmrD,EAAAxtD,UAAAokK,MAAA,SAAA97L,GACA,MAAA6iD,EAAA9oB,KAAAswP,WAEAz3P,EAAA,OAAAiwB,EAAAriD,QACAR,EAAA23B,KAAAoC,MAGA8oB,EAAAv/C,SAAAu/C,EAAAv/C,SAAAwE,QAAA,SAAArD,GACA,OAAAA,EAAA4lR,WAAA7pR,SAAAu5B,OACAA,MACAnH,EAAAsD,MAAA2sB,EAAAv/C,SAAAtE,OAAA,EAAA,sCAGAkmF,EAAAxtD,UAAA8zP,SAAA,SAAAr7Q,GACA,MAAA0yC,EAAA9oB,KAAAswP,WAGA/mR,EAAA6M,EAAArI,QAAA,SAAA3G,GACA,OAAAA,aAAA44B,KAAA2M,cACA3M,MACA5pB,EAAAA,EAAArI,QAAA,SAAA3G,GACA,QAAAA,aAAA44B,KAAA2M,eACA3M,MAEA,IAAAz2B,EAAAtE,SACA4zB,EAAA,OAAAiwB,EAAAv/C,UACAu/C,EAAAv/C,SAAAA,EAGAA,EAAAn1E,SAAA,SAAAs2E,GACAA,EAAA4lR,WAAA7pR,OAAAu5B,OACAA,OAEA,IAAA5pB,EAAAnR,SACA4zB,EAAA,OAAAiwB,EAAA1yC,MACA0yC,EAAA1yC,KAAAA,EACA0yC,EAAAmoO,YAAA76Q,EAAAhM,KAAA,SAAAhD,GACA,GAAA,iBAAAA,GAAAA,EAAAulC,cAAAn5G,OACA,OAAA4zE,EAEA,MAAA2E,EAAA,GAOA,OANAv4E,OAAAW,KAAAizE,GAAAhzE,SAAA,SAAAY,GACAA,IAAA,EAAAA,KACAA,GAAA,GACA,MAAAtB,EAAA0zE,EAAApyE,GACA+2E,EAAAr4E,GAAAsB,KAEA+2E,OAtHA,CACA,WAAA,aAAA,OACA,aAAA,eAAA,cACA,cAAA,aAAA,cAAA,cAEA,mBAAA,aAAA,eAAA,cACA,cAAA,aAAA,eAyHA33E,SAAA,SAAAgpI,GACA+tB,EAAAxtD,UAAAy/B,GAAA,WACA,MAAAtU,EAAA9oB,KAAAswP,WACA,MAAA,IAAAx3P,MAAAskC,EAAA,kCAAAtU,EAAA6zG,SAQAziB,EAAA9lN,SAAA,SAAAowE,GACA2mF,EAAAxtD,UAAAn5B,GAAA,WACA,MAAAskD,EAAA9oB,KAAAswP,WACAl6Q,EAAAynB,MAAAF,UAAAv4B,MAAAw4B,KAAAvnB,WAOA,OALAwiB,EAAA,OAAAiwB,EAAAtkD,KACAskD,EAAAtkD,IAAAA,EAEAw7B,KAAAyxP,SAAAr7Q,GAEA4pB,SAIAmrD,EAAAxtD,UAAA1qG,IAAA,SAAAgoG,GACApC,EAAAoC,GACA,MAAA6tB,EAAA9oB,KAAAswP,WAKA,OAHAz3P,EAAA,OAAAiwB,EAAA71H,KACA61H,EAAA71H,IAAAgoG,EAEA+E,MAGAmrD,EAAAxtD,UAAAiiC,SAAA,WAKA,OAJA5/B,KAAAswP,WAEA1wN,UAAA,EAEA5/B,MAGAmrD,EAAAxtD,UAAAiB,IAAA,SAAAjF,GACA,MAAAmvB,EAAA9oB,KAAAswP,WAMA,OAJAz3P,EAAA,OAAAiwB,EAAA,SACAA,EAAA,QAAAnvB,EACAmvB,EAAA8W,UAAA,EAEA5/B,MAGAmrD,EAAAxtD,UAAAuwP,SAAA,SAAAx8O,GACA,MAAAoX,EAAA9oB,KAAAswP,WAKA,OAHAz3P,EAAA,OAAAiwB,EAAAolO,UAAA,OAAAplO,EAAAsoO,UACAtoO,EAAAolO,SAAAx8O,EAEA1R,MAGAmrD,EAAAxtD,UAAAyzP,SAAA,SAAA1/O,GACA,MAAAoX,EAAA9oB,KAAAswP,WAKA,OAHAz3P,EAAA,OAAAiwB,EAAAolO,UAAA,OAAAplO,EAAAsoO,UACAtoO,EAAAsoO,SAAA1/O,EAEA1R,MAGAmrD,EAAAxtD,UAAAkB,IAAA,WACA,MAAAiqB,EAAA9oB,KAAAswP,WACAl6Q,EAAAynB,MAAAF,UAAAv4B,MAAAw4B,KAAAvnB,WAOA,OALAyyC,EAAAjqB,KAAA,EAEA,IAAAzoB,EAAAnR,QACA+6B,KAAAyxP,SAAAr7Q,GAEA4pB,MAGAmrD,EAAAxtD,UAAA3oG,IAAA,SAAA08V,GACA,MAAA5oO,EAAA9oB,KAAAswP,WAKA,OAHAz3P,EAAA,OAAAiwB,EAAA9zH,KACA8zH,EAAA9zH,IAAA08V,EAEA1xP,MAGAmrD,EAAAxtD,UAAAuzP,IAAA,WAKA,OAJAlxP,KAAAswP,WAEAY,KAAA,EAEAlxP,MAGAmrD,EAAAxtD,UAAAywP,OAAA,SAAAvvP,GACA,MAAAiqB,EAAA9oB,KAAAswP,WAQA,OANAz3P,EAAA,OAAAiwB,EAAAslO,QACAtlO,EAAAslO,OAAAvvP,EACAmB,KAAAyxP,SAAAj+V,OAAAW,KAAA0qG,GAAAz0B,KAAA,SAAAp1E,GACA,OAAA6pG,EAAA7pG,OAGAgrG,MAGAmrD,EAAAxtD,UAAA0zP,SAAA,SAAAp2P,GACA,MAAA6tB,EAAA9oB,KAAAswP,WAKA,OAHAz3P,EAAA,OAAAiwB,EAAA71H,KACA61H,EAAAuoO,SAAAp2P,EAEA+E,MAOAmrD,EAAAxtD,UAAAg0P,QAAA,SAAA3iQ,EAAAr6F,GACA,MAAAm0H,EAAA9oB,KAAAswP,WAGA,GAAA,OAAAxnO,EAAAriD,OACA,OAAAuoB,EAAA4iQ,WAAA9oO,EAAAv/C,SAAA,GAAAooR,QAAA3iQ,EAAAr6F,IAEA,IAuCAk9V,EAvCAjnR,EAAAk+C,EAAA,QACAgpO,GAAA,EAEAC,EAAA,KAKA,GAJA,OAAAjpO,EAAA9zH,MACA+8V,EAAA/iQ,EAAAgjQ,SAAAlpO,EAAA9zH,MAGA8zH,EAAA8W,SAAA,CACA,IAAAp7D,EAAA,KAQA,GAPA,OAAAskD,EAAAolO,SACA1pR,EAAAskD,EAAAolO,SACA,OAAAplO,EAAAsoO,SACA5sR,EAAAskD,EAAAsoO,SACA,OAAAtoO,EAAAtkD,MACAA,EAAAskD,EAAAtkD,KAEA,OAAAA,GAAAskD,EAAAooO,KAgBA,GAFAY,EAAA9xP,KAAAiyP,SAAAjjQ,EAAAxqB,EAAAskD,EAAAooO,KAEAliQ,EAAAkjQ,QAAAJ,GACA,OAAAA,MAjBA,CAEA,MAAAK,EAAAnjQ,EAAAmjQ,OACA,IACA,OAAArpO,EAAAslO,OACApuP,KAAAoyP,eAAAtpO,EAAAtkD,IAAAwqB,EAAAr6F,GAEAqrG,KAAAqyP,cAAArjQ,EAAAr6F,GACAm9V,GAAA,EACA,MAAA/9V,GACA+9V,GAAA,EAEA9iQ,EAAAsjQ,QAAAH,IAcA,GAHArpO,EAAAjqB,KAAAizP,IACAD,EAAA7iQ,EAAAujQ,eAEAT,EAAA,CAEA,GAAA,OAAAhpO,EAAAolO,SAAA,CACA,MAAAA,EAAAluP,KAAAwyP,WAAAxjQ,EAAA85B,EAAAolO,UACA,GAAAl/P,EAAAkjQ,QAAAhE,GACA,OAAAA,EACAl/P,EAAAk/P,EAGA,MAAAl5Q,EAAAga,EAAAjqB,OAGA,GAAA,OAAA+jD,EAAA71H,KAAA,OAAA61H,EAAAslO,OAAA,CACA,IAAA+D,EACArpO,EAAAooO,MACAiB,EAAAnjQ,EAAAmjQ,QACA,MAAAlsR,EAAA+5B,KAAAwyP,WACAxjQ,EACA,OAAA85B,EAAAsoO,SAAAtoO,EAAAsoO,SAAAtoO,EAAAtkD,IACAskD,EAAAooO,KAEA,GAAAliQ,EAAAkjQ,QAAAjsR,GACA,OAAAA,EAEA6iD,EAAAooO,IACAtmR,EAAAokB,EAAAlF,IAAAqoQ,GAEAnjQ,EAAA/oB,EAkBA,GAfAtxE,GAAAA,EAAAknM,OAAA,OAAA/yE,EAAAtkD,KACA7vE,EAAAknM,MAAA7sG,EAAAr8F,OAAAqiF,EAAAga,EAAA/pB,OAAA,UAEAtwE,GAAAA,EAAAknM,OAAA,OAAA/yE,EAAAtkD,KACA7vE,EAAAknM,MAAA7sG,EAAAr8F,OAAAq8F,EAAAjqB,OAAAiqB,EAAA/pB,OAAA,WAGA6jD,EAAAooO,MAGAtmR,EADA,OAAAk+C,EAAAslO,OACApuP,KAAAoyP,eAAAtpO,EAAAtkD,IAAAwqB,EAAAr6F,GAEAqrG,KAAAqyP,cAAArjQ,EAAAr6F,IAGAq6F,EAAAkjQ,QAAAtnR,GACA,OAAAA,EAYA,GATAk+C,EAAAooO,KAAA,OAAApoO,EAAAslO,QAAA,OAAAtlO,EAAAv/C,UACAu/C,EAAAv/C,SAAAn1E,SAAA,SAAAs2E,GAGAA,EAAAinR,QAAA3iQ,EAAAr6F,MAKAm0H,EAAAuoO,WAAA,WAAAvoO,EAAAtkD,KAAA,WAAAskD,EAAAtkD,KAAA,CACA,MAAAkoF,EAAA,IAAAskM,EAAApmR,GACAA,EAAAo1B,KAAAyyP,QAAA3pO,EAAAuoO,SAAAriQ,EAAA0jQ,eAAA7zP,KACA8yP,QAAAjlM,EAAA/3J,IAcA,OATAm0H,EAAAjqB,KAAAizP,IACAlnR,EAAAokB,EAAA2jQ,YAAAd,IAGA,OAAA/oO,EAAA9zH,KAAA,OAAA41E,IAAA,IAAAknR,EAEA,OAAAC,GACA/iQ,EAAA4jQ,QAAAb,GAFA/iQ,EAAA6jQ,SAAAd,EAAAjpO,EAAA9zH,IAAA41E,GAIAA,GAGAugF,EAAAxtD,UAAAy0P,eAAA,SAAA5tR,EAAAwqB,EAAAr6F,GACA,MAAAm0H,EAAA9oB,KAAAswP,WAEA,MAAA,QAAA9rR,GAAA,QAAAA,EACA,KACA,UAAAA,GAAA,UAAAA,EACAw7B,KAAA8yP,YAAA9jQ,EAAAxqB,EAAAskD,EAAA1yC,KAAA,GAAAzhF,GACA,OAAA8wE,KAAAjB,GACAw7B,KAAA+yP,WAAA/jQ,EAAAxqB,EAAA7vE,GACA,UAAA6vE,GAAAskD,EAAA1yC,KACA4pB,KAAAgzP,aAAAhkQ,EAAA85B,EAAA1yC,KAAA,GAAA0yC,EAAA1yC,KAAA,GAAAzhF,GACA,UAAA6vE,EACAw7B,KAAAgzP,aAAAhkQ,EAAA,KAAA,KAAAr6F,GACA,YAAA6vE,GAAA,YAAAA,EACAw7B,KAAAizP,YAAAjkQ,EAAAxqB,EAAA7vE,GACA,UAAA6vE,EACAw7B,KAAAkzP,YAAAlkQ,EAAAr6F,GACA,SAAA6vE,EACAw7B,KAAAmzP,YAAAnkQ,EAAAr6F,GACA,YAAA6vE,EACAw7B,KAAA+yP,WAAA/jQ,EAAAxqB,EAAA7vE,GACA,QAAA6vE,GAAA,SAAAA,EACAw7B,KAAAozP,WAAApkQ,EAAA85B,EAAA1yC,MAAA0yC,EAAA1yC,KAAA,GAAAzhF,GAEA,OAAAm0H,EAAA71H,IACA+sG,KAAAyyP,QAAA3pO,EAAA71H,IAAA+7F,EAAA0jQ,eAAA7zP,KACA8yP,QAAA3iQ,EAAAr6F,GAEAq6F,EAAAzf,MAAA,gBAAA/K,IAIA2mF,EAAAxtD,UAAA80P,QAAA,SAAAjxN,EAAA3iC,GAEA,MAAAiqB,EAAA9oB,KAAAswP,WASA,OAPAxnO,EAAAqoO,WAAAnxP,KAAAmwP,KAAA3uN,EAAA3iC,GACAhG,EAAA,OAAAiwB,EAAAqoO,WAAAb,WAAA7pR,QACAqiD,EAAAqoO,WAAAroO,EAAAqoO,WAAAb,WAAA/mR,SAAA,GACAu/C,EAAAsoO,WAAAtoO,EAAAqoO,WAAAb,WAAAc,WACAtoO,EAAAqoO,WAAAroO,EAAAqoO,WAAA97N,QACAvM,EAAAqoO,WAAAb,WAAAc,SAAAtoO,EAAAsoO,UAEAtoO,EAAAqoO,YAGAhmM,EAAAxtD,UAAA00P,cAAA,SAAArjQ,EAAAr6F,GACA,MAAAm0H,EAAA9oB,KAAAswP,WACA,IAAA1lR,EAAA,KACA0S,GAAA,EAmBA,OAjBA9pF,OAAAW,KAAA20H,EAAAslO,QAAAxnR,MAAA,SAAA5xE,GACA,MAAAm9V,EAAAnjQ,EAAAmjQ,OACAlrR,EAAA6hD,EAAAslO,OAAAp5V,GACA,IACA,MAAAtB,EAAAuzE,EAAA0qR,QAAA3iQ,EAAAr6F,GACA,GAAAq6F,EAAAkjQ,QAAAx+V,GACA,OAAA,EAEAk3E,EAAA,CAAA9D,KAAA9xE,EAAAtB,MAAAA,GACA4pF,GAAA,EACA,MAAAvpF,GAEA,OADAi7F,EAAAsjQ,QAAAH,IACA,EAEA,OAAA,IACAnyP,MAEA1iB,EAGA1S,EAFAokB,EAAAzf,MAAA,uBASA47E,EAAAxtD,UAAA6xP,qBAAA,SAAA9iM,GACA,OAAA,IAAAqkM,EAAArkM,EAAA1sD,KAAA8uP,WAGA3jM,EAAAxtD,UAAAioM,QAAA,SAAAl5I,EAAAoiM,EAAAroR,GACA,MAAAqiD,EAAA9oB,KAAAswP,WACA,GAAA,OAAAxnO,EAAA,SAAAA,EAAA,UAAA4jC,EACA,OAEA,MAAA9hF,EAAAo1B,KAAAwwP,aAAA9jM,EAAAoiM,EAAAroR,GACA,YAAA/wE,IAAAk1E,GAGAo1B,KAAAowP,aAAAxlR,EAAAkkR,EAAAroR,QAHA,EAMAmE,GAGAugF,EAAAxtD,UAAA6yP,aAAA,SAAA9jM,EAAAoiM,EAAAroR,GACA,MAAAqiD,EAAA9oB,KAAAswP,WAGA,GAAA,OAAAxnO,EAAAriD,OACA,OAAAqiD,EAAAv/C,SAAA,GAAAq8N,QAAAl5I,EAAAoiM,GAAA,IAAAgC,GAEA,IAAAlmR,EAAA,KAMA,GAHAo1B,KAAA8uP,SAAAA,EAGAhmO,EAAA8W,eAAAlqI,IAAAg3J,EAAA,CACA,GAAA,OAAA5jC,EAAA,QAGA,OAFA4jC,EAAA5jC,EAAA,QAMA,IAAA/hD,EAAA,KACAooR,GAAA,EACA,GAAArmO,EAAAooO,IAEAtmR,EAAAo1B,KAAAwvP,qBAAA9iM,QACA,GAAA5jC,EAAAslO,OACAxjR,EAAAo1B,KAAAqzP,cAAA3mM,EAAAoiM,QACA,GAAAhmO,EAAAuoO,SACAtqR,EAAAi5B,KAAAyyP,QAAA3pO,EAAAuoO,SAAA5qR,GAAAm/N,QAAAl5I,EAAAoiM,GACAK,GAAA,OACA,GAAArmO,EAAAv/C,SACAxC,EAAA+hD,EAAAv/C,SAAAa,KAAA,SAAAM,GACA,GAAA,UAAAA,EAAA4lR,WAAA9rR,IACA,OAAAkG,EAAAk7N,QAAA,KAAAkpD,EAAApiM,GAEA,GAAA,OAAAhiF,EAAA4lR,WAAAt7V,IACA,OAAA85V,EAAAv/Q,MAAA,2BACA,MAAAwiR,EAAAjD,EAAAkD,SAAAtnR,EAAA4lR,WAAAt7V,KAEA,GAAA,iBAAA03J,EACA,OAAAoiM,EAAAv/Q,MAAA,2CAEA,MAAAxD,EAAArB,EAAAk7N,QAAAl5I,EAAAhiF,EAAA4lR,WAAAt7V,KAAA85V,EAAApiM,GAGA,OAFAoiM,EAAA+D,SAAAd,GAEAhmR,IACAi0B,MAAAjyB,QAAA,SAAArD,GACA,OAAAA,KAEA3D,EAAAi5B,KAAAwvP,qBAAAzoR,QAEA,GAAA,UAAA+hD,EAAAtkD,KAAA,UAAAskD,EAAAtkD,IAAA,CAEA,IAAAskD,EAAA1yC,MAAA,IAAA0yC,EAAA1yC,KAAAnR,OACA,OAAA6pR,EAAAv/Q,MAAA,uBAAAu5C,EAAAtkD,KAEA,IAAAq5B,MAAA/gB,QAAA4vE,GACA,OAAAoiM,EAAAv/Q,MAAA,sCAEA,MAAA7E,EAAAs1B,KAAAq1B,QACA3qD,EAAA4lR,WAAAc,SAAA,KACArqR,EAAAi5B,KAAAwvP,qBAAA9iM,EAAAtiF,KAAA,SAAA6wB,GACA,MAAA6tB,EAAA9oB,KAAAswP,WAEA,OAAAtwP,KAAAyyP,QAAA3pO,EAAA1yC,KAAA,GAAAs2E,GAAAk5I,QAAA3qM,EAAA6zP,KACApkR,SACA,OAAAo+C,EAAA71H,IACA23E,EAAAo1B,KAAAyyP,QAAA3pO,EAAA71H,IAAAwzE,GAAAm/N,QAAAl5I,EAAAoiM,IAEA/nR,EAAAi5B,KAAAszP,iBAAAxqO,EAAAtkD,IAAAkoF,GACAyiM,GAAA,GAKA,IAAArmO,EAAAooO,KAAA,OAAApoO,EAAAslO,OAAA,CACA,MAAA5pR,EAAA,OAAAskD,EAAAsoO,SAAAtoO,EAAAsoO,SAAAtoO,EAAAtkD,IACA8/E,EAAA,OAAAx7B,EAAAsoO,SAAA,YAAA,UAEA,OAAA5sR,EACA,OAAAskD,EAAA71H,KACA67V,EAAAv/Q,MAAA,wCAEA,OAAAu5C,EAAA71H,MACA23E,EAAAo1B,KAAAkvP,iBAAA1qR,EAAA2qR,EAAA7qM,EAAAv9E,IAQA,OAHA,OAAA+hD,EAAAolO,WACAtjR,EAAAo1B,KAAAkvP,iBAAApmO,EAAAolO,UAAA,EAAA,UAAAtjR,IAEAA,GAGAugF,EAAAxtD,UAAA01P,cAAA,SAAA3mM,EAAAoiM,GACA,MAAAhmO,EAAA9oB,KAAAswP,WAEArpR,EAAA6hD,EAAAslO,OAAA1hM,EAAA5lF,MAOA,OANAG,GACA4xB,GACA,EACA6zD,EAAA5lF,KAAA,iBACAe,KAAAC,UAAAt0E,OAAAW,KAAA20H,EAAAslO,UAEAnnR,EAAA2+N,QAAAl5I,EAAAh5J,MAAAo7V,IAGA3jM,EAAAxtD,UAAA21P,iBAAA,SAAA9uR,EAAAkoF,GACA,MAAA5jC,EAAA9oB,KAAAswP,WAEA,GAAA,OAAA7qR,KAAAjB,GACA,OAAAw7B,KAAA0vP,WAAAhjM,EAAAloF,GACA,GAAA,UAAAA,GAAAskD,EAAA1yC,KACA,OAAA4pB,KAAA6vP,aAAAnjM,EAAA5jC,EAAAmoO,YAAA,GAAAnoO,EAAA1yC,KAAA,IACA,GAAA,UAAA5R,EACA,OAAAw7B,KAAA6vP,aAAAnjM,EAAA,KAAA,MACA,GAAA,YAAAloF,GAAA,YAAAA,EACA,OAAAw7B,KAAA8vP,YAAApjM,EAAAloF,GACA,GAAA,UAAAA,EACA,OAAAw7B,KAAA+vP,cACA,GAAA,QAAAvrR,GAAA,SAAAA,EACA,OAAAw7B,KAAAgwP,WAAAtjM,EAAA5jC,EAAA1yC,MAAA0yC,EAAAmoO,YAAA,IACA,GAAA,SAAAzsR,EACA,OAAAw7B,KAAAkwP,YAAAxjM,GACA,GAAA,YAAAloF,EACA,OAAAw7B,KAAA0vP,WAAAhjM,EAAAloF,GAEA,MAAA,IAAAs0B,MAAA,oBAAAt0B,IAGA2mF,EAAAxtD,UAAAgyP,UAAA,SAAAn6P,GACA,MAAA,YAAA/vB,KAAA+vB,IAGA21D,EAAAxtD,UAAAiyP,YAAA,SAAAp6P,GACA,MAAA,6BAAA/vB,KAAA+vB,mHC5nBA,aAEA,MAAAi9L,EAAAl/R,EAAA,YAEA,SAAAu9V,EAAAn8V,GACAqrG,KAAA0yP,eAAA,CACA7zP,IAAA,KACAlsG,KAAA,GACAgC,QAAAA,GAAA,GACAo+H,OAAA,IA6FA,SAAAwgO,EAAA5gW,EAAA88E,GACAuwB,KAAArtG,KAAAA,EACAqtG,KAAAwzP,QAAA/jR,GA5FAn8E,EAAAw9V,SAAAA,EAEAA,EAAAnzP,UAAAu0P,QAAA,SAAArzP,GACA,OAAAA,aAAA00P,GAGAzC,EAAAnzP,UAAAw0P,KAAA,WACA,MAAArpO,EAAA9oB,KAAA0yP,eAEA,MAAA,CAAA7zP,IAAAiqB,EAAAjqB,IAAA40P,QAAA3qO,EAAAn2H,KAAAsyE,SAGA6rR,EAAAnzP,UAAA20P,QAAA,SAAA5lM,GACA,MAAA5jC,EAAA9oB,KAAA0yP,eAEA5pO,EAAAjqB,IAAA6tD,EAAA7tD,IACAiqB,EAAAn2H,KAAAm2H,EAAAn2H,KAAAyyE,MAAA,EAAAsnF,EAAA+mM,UAGA3C,EAAAnzP,UAAAq0P,SAAA,SAAAh9V,GACA,OAAAgrG,KAAA0yP,eAAA//V,KAAAm4E,KAAA91E,IAGA87V,EAAAnzP,UAAAi1P,QAAA,SAAArtR,GACA,MAAAujD,EAAA9oB,KAAA0yP,eAEA5pO,EAAAn2H,KAAAm2H,EAAAn2H,KAAAyyE,MAAA,EAAAG,EAAA,IAGAurR,EAAAnzP,UAAAk1P,SAAA,SAAAttR,EAAAvwE,EAAAtB,GACA,MAAAo1H,EAAA9oB,KAAA0yP,eAEA1yP,KAAA4yP,QAAArtR,GACA,OAAAujD,EAAAjqB,MACAiqB,EAAAjqB,IAAA7pG,GAAAtB,IAGAo9V,EAAAnzP,UAAAhrG,KAAA,WACA,OAAAqtG,KAAA0yP,eAAA//V,KAAA23E,KAAA,MAGAwmR,EAAAnzP,UAAA40P,YAAA,WACA,MAAAzpO,EAAA9oB,KAAA0yP,eAEAv1Q,EAAA2rC,EAAAjqB,IAEA,OADAiqB,EAAAjqB,IAAA,GACA1hB,GAGA2zQ,EAAAnzP,UAAAg1P,YAAA,SAAAx1Q,GACA,MAAA2rC,EAAA9oB,KAAA0yP,eAEAptL,EAAAx8C,EAAAjqB,IAEA,OADAiqB,EAAAjqB,IAAA1hB,EACAmoF,GAGAwrL,EAAAnzP,UAAApuB,MAAA,SAAAE,GACA,IAAAgqB,EACA,MAAAqvB,EAAA9oB,KAAA0yP,eAEAgB,EAAAjkR,aAAA8jR,EASA,GAPA95P,EADAi6P,EACAjkR,EAEA,IAAA8jR,EAAAzqO,EAAAn2H,KAAAy3E,KAAA,SAAAupF,GACA,MAAA,IAAA9rF,KAAAC,UAAA6rF,GAAA,OACArpF,KAAA,IAAAmF,EAAAkK,SAAAlK,EAAAA,EAAA+nC,QAGAsR,EAAAn0H,QAAAg/V,QACA,MAAAl6P,EAKA,OAHAi6P,GACA5qO,EAAAiK,OAAAjoD,KAAA2uB,GAEAA,GAGAq3P,EAAAnzP,UAAAi0P,WAAA,SAAAhnR,GACA,MAAAk+C,EAAA9oB,KAAA0yP,eACA,OAAA5pO,EAAAn0H,QAAAg/V,QAGA,CACA/oR,OAAAo1B,KAAAkyP,QAAAtnR,GAAA,KAAAA,EACAmoD,OAAAjK,EAAAiK,QAJAnoD,GAYA6nN,EAAA8gE,EAAAz6P,OAEAy6P,EAAA51P,UAAA61P,QAAA,SAAA/jR,GAKA,GAJAuwB,KAAArmB,QAAAlK,EAAA,SAAAuwB,KAAArtG,MAAA,aACAmmG,MAAAqsJ,mBACArsJ,MAAAqsJ,kBAAAnlJ,KAAAuzP,IAEAvzP,KAAAwX,MACA,IAEA,MAAA,IAAA1e,MAAAkH,KAAArmB,SACA,MAAA5lF,GACAisG,KAAAwX,MAAAzjH,EAAAyjH,MAGA,OAAAxX,oDCzHA,mBAEMyyL,EAAWl/R,EAAQ,YACnBu9V,EAAWv9V,EAAQ,oBAAoBu9V,SACvC7tG,EAAS1vP,EAAQ,gBAAgB0vP,OAEvC,SAAA+tG,EAAuB5wN,EAAMzrI,GAC3Bm8V,EAASlzP,KAAKoC,KAAMrrG,GACfsuP,EAAO8H,SAAS3qH,IAKrBpgC,KAAKogC,KAAOA,EACZpgC,KAAKj7B,OAAS,EACdi7B,KAAK/6B,OAASm7D,EAAKn7D,QANjB+6B,KAAKzwB,MAAM,oBA8Ef,SAAAwhR,EAAuBr9V,EAAOo7V,MACxBjxP,MAAM/gB,QAAQppF,GAChBssG,KAAK/6B,OAAS,EACd+6B,KAAKtsG,MAAQA,EAAM02E,KAAI,SAAS6wB,UACzB81P,EAAc6C,gBAAgB34P,KACjCA,EAAAA,IAAW81P,EAAc91P,EAAM6zP,IACjC9uP,KAAK/6B,QAAUg2B,EAAKh2B,OACbg2B,IACN+E,cACuB,iBAAVtsG,EAAU,MACpB,GAAKA,GAASA,GAAS,KAAA,OACpBo7V,EAASv/Q,MAAM,gCACxBywB,KAAKtsG,MAAQA,EACbssG,KAAK/6B,OAAS,UACY,iBAAVvxE,EAChBssG,KAAKtsG,MAAQA,EACbssG,KAAK/6B,OAASg+K,EAAO7kB,WAAW1qO,YACvBuvP,EAAO8H,SAASr3P,UAIlBo7V,EAASv/Q,MAAM,4BAA8B77E,GAHpDssG,KAAKtsG,MAAQA,EACbssG,KAAK/6B,OAASvxE,EAAMuxE,QAzFxBwtN,EAASu+D,EAAeF,GACxBx9V,EAAQ09V,cAAgBA,EAExBA,EAAc6C,gBAAkB,SAAyBnnM,MACnDA,aAAgBskM,SACX,QAI4B,iBAATtkM,GAC1Bu2F,EAAO8H,SAASr+F,EAAKtsB,OACK,kBAA1BssB,EAAK//C,YAAY95G,MACM,iBAAhB65J,EAAK3nF,QACW,iBAAhB2nF,EAAKznF,QACS,mBAAdynF,EAAKylM,MACY,mBAAjBzlM,EAAK4lM,SACY,mBAAjB5lM,EAAKwnG,SACc,mBAAnBxnG,EAAKymK,WACS,mBAAdzmK,EAAKwV,MACQ,mBAAbxV,EAAK5iE,KAKhBknQ,EAAcrzP,UAAUw0P,KAAO,kBACpBptR,OAAQi7B,KAAKj7B,OAAQ+pR,SAAUgC,EAASnzP,UAAUw0P,KAAKv0P,KAAKoC,QAGvEgxP,EAAcrzP,UAAU20P,QAAU,SAAiBH,SAE3CpmR,EAAAA,IAAUilR,EAAchxP,KAAKogC,aACnCr0D,EAAIhH,OAASotR,EAAKptR,OAClBgH,EAAI9G,OAAS+6B,KAAKj7B,OAElBi7B,KAAKj7B,OAASotR,EAAKptR,OACnB+rR,EAASnzP,UAAU20P,QAAQ10P,KAAKoC,KAAMmyP,EAAKrD,UAEpC/iR,GAGTilR,EAAcrzP,UAAUu2J,QAAU,kBACzBl0J,KAAKj7B,SAAWi7B,KAAK/6B,QAG9B+rR,EAAcrzP,UAAUw1N,UAAY,SAAmB2gC,UACjD9zP,KAAKj7B,OAAS,GAAKi7B,KAAK/6B,OACnB+6B,KAAKogC,KAAK+yL,UAAUnzN,KAAKj7B,UAAU,GAEnCi7B,KAAKzwB,MAAMukR,GAAQ,0BAG9B9C,EAAcrzP,UAAUukE,KAAO,SAAcy2D,EAAOm7H,QAC5C9zP,KAAKj7B,OAAS4zJ,GAAS34H,KAAK/6B,QAAAA,OACzB+6B,KAAKzwB,MAAMukR,GAAQ,+BAEtB/nR,EAAAA,IAAUilR,EAAchxP,KAAKogC,aAGnCr0D,EAAI2mR,eAAiB1yP,KAAK0yP,eAE1B3mR,EAAIhH,OAASi7B,KAAKj7B,OAClBgH,EAAI9G,OAAS+6B,KAAKj7B,OAAS4zJ,EAC3B34H,KAAKj7B,QAAU4zJ,EACR5sJ,GAGTilR,EAAcrzP,UAAU7T,IAAM,SAAaqoQ,UAClCnyP,KAAKogC,KAAKh7D,MAAM+sR,EAAOA,EAAKptR,OAASi7B,KAAKj7B,OAAQi7B,KAAK/6B,SA2BhE3xE,EAAQy9V,cAAgBA,EAExBA,EAAc6C,gBAAkB,SAAyBlnM,MACnDA,aAAgBqkM,SACX,QAI4B,iBAATrkM,GACA,kBAA1BA,EAAK//C,YAAY95G,MACM,iBAAhB65J,EAAKznF,QACS,mBAAdynF,EAAKpiF,MAKhBymR,EAAcpzP,UAAUrzB,KAAO,SAAcy2D,EAAKh8D,UAC3Cg8D,IACHA,EAAMkiH,EAAOO,MAAMxjJ,KAAK/6B,SACrBF,IACHA,EAAS,GAES,IAAhBi7B,KAAK/6B,SAGL44B,MAAM/gB,QAAQkjB,KAAKtsG,OACrBssG,KAAKtsG,MAAMU,SAAQ,SAAS6mG,GAC1BA,EAAK3wB,KAAKy2D,EAAKh8D,GACfA,GAAUk2B,EAAKh2B,WAGS,iBAAf+6B,KAAKtsG,MACdqtI,EAAIh8D,GAAUi7B,KAAKtsG,MACU,iBAAfssG,KAAKtsG,MACnBqtI,EAAI4jH,MAAM3kJ,KAAKtsG,MAAOqxE,GACfk+K,EAAO8H,SAAS/qJ,KAAKtsG,QAC5BssG,KAAKtsG,MAAMuJ,KAAK8jI,EAAKh8D,GACvBA,GAAUi7B,KAAK/6B,SAdR87D,mGCtIX,aAGA,SAAAm/E,EAAA91I,GACA,MAAA2B,EAAA,GAWA,OATAv4E,OAAAW,KAAAi2E,GAAAh2E,SAAA,SAAAY,IAEA,EAAAA,IAAAA,IACAA,GAAA,GAEA,MAAAtB,EAAA02E,EAAAp1E,GACA+2E,EAAAr4E,GAAAsB,KAGA+2E,EAGAz4E,EAAAs6P,SAAA,CACA99K,EAAA,YACAC,EAAA,cACAC,EAAA,UACAC,EAAA,WAEA38E,EAAAg8V,eAAApvI,EAAA5sN,EAAAs6P,UAEAt6P,EAAAkxE,IAAA,CACAsL,EAAA,MACAC,EAAA,OACAC,EAAA,MACAC,EAAA,SACAC,EAAA,SACAC,EAAA,QACAC,EAAA,QACAC,EAAA,UACAC,EAAA,WACAC,EAAA,OACAC,GAAA,OACAC,GAAA,QACAC,GAAA,UACAC,GAAA,cACAG,GAAA,MACAC,GAAA,MACAC,GAAA,SACAC,GAAA,WACAE,GAAA,SACAD,GAAA,WACAE,GAAA,SACAC,GAAA,UACAC,GAAA,UACAC,GAAA,WACAC,GAAA,YACAC,GAAA,SACAC,GAAA,SACAC,GAAA,UACAC,GAAA,UAEAt+E,EAAA+7V,UAAAnvI,EAAA5sN,EAAAkxE,mCCzDA,aAEA,MAAAiuN,EAAAl/R,EAAA,YAEAw7V,EAAAx7V,EAAA,SAEA,SAAAwgW,EAAAvyN,GACAutN,EAAAnxP,KAAAoC,KAAAwhC,GACAxhC,KAAA28H,IAAA,MAEA81D,EAAAshE,EAAAhF,GACA17V,EAAAC,QAAAygW,EAEAA,EAAAp2P,UAAA2F,OAAA,SAAAopD,EAAA/3J,GACA,MAEAuyE,EAFA6nR,EAAApxP,UAAA2F,OAAA1F,KAAAoC,KAAA0sD,GAEAtuD,SAAA,UACA2iC,EAAA,CAAA,cAAApsI,EAAAo8G,MAAA,SACA,IAAA,IAAA5pC,EAAA,EAAAA,EAAAD,EAAAjC,OAAAkC,GAAA,GACA45D,EAAAj2D,KAAA5D,EAAA9B,MAAA+B,EAAAA,EAAA,KAEA,OADA45D,EAAAj2D,KAAA,YAAAn2E,EAAAo8G,MAAA,SACAgwB,EAAAz2D,KAAA,qECrBA,aAEA,MAAAgkR,EAAAh7V,EAEAg7V,EAAAttG,IAAAztP,EAAA,SACA+6V,EAAAjvF,IAAA9rQ,EAAA,oECLA,aAEA,MAAAk/R,EAAAl/R,EAAA,YAEA86V,EAAA96V,EAAA,SACAy9V,EAAAz9V,EAAA,kBAAAy9V,cACA7lM,EAAA53J,EAAA,gBAGAytP,EAAAztP,EAAA,oBAEA,SAAAygW,EAAAxyN,GACAxhC,KAAA28H,IAAA,MACA38H,KAAAntG,KAAA2uI,EAAA3uI,KACAmtG,KAAAwhC,OAAAA,EAGAxhC,KAAAgvP,KAAA,IAAAC,EACAjvP,KAAAgvP,KAAAjtF,MAAAvgI,EAAAv7D,MAcA,SAAAgpR,EAAAxoR,GACA0kF,EAAAvtD,KAAAoC,KAAA,MAAAv5B,GA8OA,SAAAwtR,EAAA1jI,EAAAujI,GACA,IAAAtvR,EAAA+rJ,EAAA4iG,UAAA2gC,GACA,GAAAvjI,EAAA2hI,QAAA1tR,GACA,OAAAA,EAEA,MAAA8/E,EAAA08F,EAAA4M,SAAAppL,GAAA,GACA2qR,EAAA,IAAA,GAAA3qR,GAGA,GAAA,KAAA,GAAAA,GAAA,CACA,IAAAwkF,EAAAxkF,EAEA,IADAA,EAAA,EACA,MAAA,IAAAwkF,IAAA,CAEA,GADAA,EAAAunE,EAAA4iG,UAAA2gC,GACAvjI,EAAA2hI,QAAAlpM,GACA,OAAAA,EAEAxkF,IAAA,EACAA,GAAA,IAAAwkF,QAGAxkF,GAAA,GAIA,MAAA,CACA8/E,IAAAA,EACA6qM,UAAAA,EACA3qR,IAAAA,EACA0vR,OANAlzG,EAAAx8K,IAAAA,IAUA,SAAA2vR,EAAA5jI,EAAA4+H,EAAA2E,GACA,IAAA1wP,EAAAmtH,EAAA4iG,UAAA2gC,GACA,GAAAvjI,EAAA2hI,QAAA9uP,GACA,OAAAA,EAGA,IAAA+rP,GAAA,MAAA/rP,EACA,OAAA,KAGA,GAAA,IAAA,IAAAA,GAEA,OAAAA,EAIA,MAAAsO,EAAA,IAAAtO,EACA,GAAAsO,EAAA,EACA,OAAA6+G,EAAAhhJ,MAAA,6BAEA6zB,EAAA,EACA,IAAA,IAAAj8B,EAAA,EAAAA,EAAAuqC,EAAAvqC,IAAA,CACAi8B,IAAA,EACA,MAAA9R,EAAAi/H,EAAA4iG,UAAA2gC,GACA,GAAAvjI,EAAA2hI,QAAA5gQ,GACA,OAAAA,EACA8R,GAAA9R,EAGA,OAAA8R,EAzTA/vG,EAAAC,QAAA0gW,EAEAA,EAAAr2P,UAAAyG,OAAA,SAAAsoD,EAAA/3J,GAKA,OAJAq8V,EAAA6C,gBAAAnnM,KACAA,EAAA,IAAAskM,EAAAtkM,EAAA/3J,IAGAqrG,KAAAgvP,KAAA2C,QAAAjlM,EAAA/3J,IAQA89R,EAAAw8D,EAAA9jM,GAEA8jM,EAAAtxP,UAAAs0P,SAAA,SAAApiJ,EAAArrI,EAAA0sR,GACA,GAAArhJ,EAAAqkD,UACA,OAAA,EAEA,MAAAprI,EAAA+mF,EAAAsiJ,OACAiC,EAAAH,EAAApkJ,EAAA,wBAAArrI,EAAA,KACA,OAAAqrI,EAAAqiJ,QAAAkC,GACAA,GAEAvkJ,EAAAyiJ,QAAAxpO,GAEAsrO,EAAA5vR,MAAAA,GAAA4vR,EAAAF,SAAA1vR,GACA4vR,EAAAF,OAAA,OAAA1vR,GAAA0sR,IAGAjC,EAAAtxP,UAAA60P,WAAA,SAAA3iJ,EAAArrI,EAAA0sR,GACA,MAAAkD,EAAAH,EAAApkJ,EACA,4BAAArrI,EAAA,KACA,GAAAqrI,EAAAqiJ,QAAAkC,GACA,OAAAA,EAEA,IAAAhxP,EAAA+wP,EAAAtkJ,EACAukJ,EAAAjF,UACA,4BAAA3qR,EAAA,KAGA,GAAAqrI,EAAAqiJ,QAAA9uP,GACA,OAAAA,EAEA,IAAA8tP,GACAkD,EAAA5vR,MAAAA,GACA4vR,EAAAF,SAAA1vR,GACA4vR,EAAAF,OAAA,OAAA1vR,EACA,OAAAqrI,EAAAtgI,MAAA,yBAAA/K,EAAA,KAGA,GAAA4vR,EAAAjF,WAAA,OAAA/rP,EACA,OAAAysG,EAAA3tC,KAAA9+D,EAAA,6BAAA5+B,EAAA,KAGA,MAAAskD,EAAA+mF,EAAAsiJ,OACApmR,EAAAi0B,KAAAq0P,cACAxkJ,EACA,2CAAA7vG,KAAAx7B,IAAA,KACA,OAAAqrI,EAAAqiJ,QAAAnmR,GACAA,GAEAq3B,EAAAysG,EAAA9qI,OAAA+jD,EAAA/jD,OACA8qI,EAAAyiJ,QAAAxpO,GACA+mF,EAAA3tC,KAAA9+D,EAAA,6BAAA5+B,EAAA,OAGAyqR,EAAAtxP,UAAA02P,cAAA,SAAAxkJ,EAAAikJ,GACA,OAAA,CACA,MAAAtvR,EAAAyvR,EAAApkJ,EAAAikJ,GACA,GAAAjkJ,EAAAqiJ,QAAA1tR,GACA,OAAAA,EACA,MAAA4+B,EAAA+wP,EAAAtkJ,EAAArrI,EAAA2qR,UAAA2E,GACA,GAAAjkJ,EAAAqiJ,QAAA9uP,GACA,OAAAA,EAEA,IAAAr3B,EAOA,GALAA,EADAvH,EAAA2qR,WAAA,OAAA/rP,EACAysG,EAAA3tC,KAAA9+D,GAEApD,KAAAq0P,cAAAxkJ,EAAAikJ,GAGAjkJ,EAAAqiJ,QAAAnmR,GACA,OAAAA,EAEA,GAAA,QAAAvH,EAAA0vR,OACA,QAIAjF,EAAAtxP,UAAAm1P,YAAA,SAAAjjJ,EAAArrI,EAAA6rJ,EACA17N,GACA,MAAAi2E,EAAA,GACA,MAAAilI,EAAAqkD,WAAA,CACA,MAAAogG,EAAAt0P,KAAAiyP,SAAApiJ,EAAA,OACA,GAAAA,EAAAqiJ,QAAAoC,GACA,OAAAA,EAEA,MAAAvoR,EAAAskJ,EAAAjsH,OAAAyrG,EAAA,MAAAl7M,GACA,GAAAk7M,EAAAqiJ,QAAAnmR,IAAAuoR,EACA,MACA1pR,EAAAE,KAAAiB,GAEA,OAAAnB,GAGAqkR,EAAAtxP,UAAAo1P,WAAA,SAAAljJ,EAAArrI,GACA,GAAA,WAAAA,EAAA,CACA,MAAAuqL,EAAAl/C,EAAAsjH,YACA,OAAAtjH,EAAAqiJ,QAAAnjG,GACAA,EACA,CAAAA,OAAAA,EAAAriG,KAAAmjD,EAAA/lH,OACA,GAAA,WAAAtlB,EAAA,CACA,MAAAslB,EAAA+lH,EAAA/lH,MACA,GAAAA,EAAA7kB,OAAA,GAAA,EACA,OAAA4qI,EAAAtgI,MAAA,mDAEA,IAAAimB,EAAA,GACA,IAAA,IAAAruB,EAAA,EAAAA,EAAA2iB,EAAA7kB,OAAA,EAAAkC,IACAquB,GAAAnvB,OAAA67C,aAAAp4B,EAAAmmO,aAAA,EAAA9oP,IAEA,OAAAquB,EACA,GAAA,WAAAhxB,EAAA,CACA,MAAA+vR,EAAA1kJ,EAAA/lH,MAAAsU,SAAA,SACA,OAAA4B,KAAA2vP,UAAA4E,GAIAA,EAHA1kJ,EAAAtgI,MAAA,0DAIA,GAAA,WAAA/K,EACA,OAAAqrI,EAAA/lH,MACA,GAAA,YAAAtlB,EACA,OAAAqrI,EAAA/lH,MACA,GAAA,aAAAtlB,EAAA,CACA,MAAAgwR,EAAA3kJ,EAAA/lH,MAAAsU,SAAA,SACA,OAAA4B,KAAA4vP,YAAA4E,GAIAA,EAHA3kJ,EAAAtgI,MAAA,4DAIA,MAAA,OAAA9J,KAAAjB,GACAqrI,EAAA/lH,MAAAsU,WAEAyxG,EAAAtgI,MAAA,4BAAA/K,EAAA,iBAIAyqR,EAAAtxP,UAAAq1P,aAAA,SAAAnjJ,EAAAzyG,EAAAgE,GACA,IAAAx2B,EACA,MAAAqY,EAAA,GACA,IAAAulD,EAAA,EACAisN,EAAA,EACA,MAAA5kJ,EAAAqkD,WACAugG,EAAA5kJ,EAAAsjH,YACA3qL,IAAA,EACAA,GAAA,IAAAisN,EACA,IAAA,IAAAA,KACAxxQ,EAAAnY,KAAA09D,GACAA,EAAA,GAGA,IAAAisN,GACAxxQ,EAAAnY,KAAA09D,GAEA,MAAA3vD,EAAAoK,EAAA,GAAA,GAAA,EACAyxQ,EAAAzxQ,EAAA,GAAA,GAOA,GAJArY,EADAw2B,EACAne,EAEA,CAAApK,EAAA67Q,GAAA7iQ,OAAA5O,EAAA7d,MAAA,IAEAg4B,EAAA,CACA,IAAAhC,EAAAgC,EAAAxyB,EAAAN,KAAA,WACA50E,IAAA0lG,IACAA,EAAAgC,EAAAxyB,EAAAN,KAAA,YACA50E,IAAA0lG,IACAxwB,EAAAwwB,GAGA,OAAAxwB,GAGAqkR,EAAAtxP,UAAAs1P,YAAA,SAAApjJ,EAAArrI,GACA,MAAAgxB,EAAAq6G,EAAA/lH,MAAAsU,WAEA,IAAA+xJ,EACAwkG,EACAC,EACAC,EACA56P,EACA66P,EACA,GAAA,YAAAtwR,EACA2rL,EAAA,EAAA36J,EAAApwB,MAAA,EAAA,GACAuvR,EAAA,EAAAn/P,EAAApwB,MAAA,EAAA,GACAwvR,EAAA,EAAAp/P,EAAApwB,MAAA,EAAA,GACAyvR,EAAA,EAAAr/P,EAAApwB,MAAA,EAAA,IACA60B,EAAA,EAAAzE,EAAApwB,MAAA,GAAA,IACA0vR,EAAA,EAAAt/P,EAAApwB,MAAA,GAAA,QACA,CAAA,GAAA,YAAAZ,EAYA,OAAAqrI,EAAAtgI,MAAA,YAAA/K,EAAA,8BAXA2rL,EAAA,EAAA36J,EAAApwB,MAAA,EAAA,GACAuvR,EAAA,EAAAn/P,EAAApwB,MAAA,EAAA,GACAwvR,EAAA,EAAAp/P,EAAApwB,MAAA,EAAA,GACAyvR,EAAA,EAAAr/P,EAAApwB,MAAA,EAAA,GACA60B,EAAA,EAAAzE,EAAApwB,MAAA,EAAA,IACA0vR,EAAA,EAAAt/P,EAAApwB,MAAA,GAAA,IAEA+qL,EADAA,EAAA,GACA,IAAAA,EAEA,KAAAA,EAKA,OAAApyJ,KAAAg3P,IAAA5kG,EAAAwkG,EAAA,EAAAC,EAAAC,EAAA56P,EAAA66P,EAAA,IAGA7F,EAAAtxP,UAAAu1P,YAAA,WACA,OAAA,MAGAjE,EAAAtxP,UAAAw1P,YAAA,SAAAtjJ,GACA,MAAA9jI,EAAA8jI,EAAAsjH,YACA,OAAAtjH,EAAAqiJ,QAAAnmR,GACAA,EAEA,IAAAA,GAGAkjR,EAAAtxP,UAAAy1P,WAAA,SAAAvjJ,EAAAzyG,GAEA,MAAAtT,EAAA+lH,EAAA/lH,MACA,IAAA/d,EAAA,IAAAsiR,EAAAvkQ,GAKA,OAHAsT,IACArxB,EAAAqxB,EAAArxB,EAAAqyB,SAAA,MAAAryB,GAEAA,GAGAkjR,EAAAtxP,UAAAwyP,KAAA,SAAA3uN,EAAA3iC,GAGA,MAFA,mBAAA2iC,IACAA,EAAAA,EAAA3iC,IACA2iC,EAAAotN,YAAA,OAAAI,+IC1QA,mBAEMv8D,EAAWl/R,EAAQ,YACnB0vP,EAAS1vP,EAAQ,gBAAgB0vP,OAEjC+wG,EAAazgW,EAAQ,SAE3B,SAAAyhW,EAAoBxzN,GAClBwyN,EAAWp2P,KAAKoC,KAAMwhC,GACtBxhC,KAAK28H,IAAM,MAEb81D,EAASuiE,EAAYhB,GACrB3gW,EAAOC,QAAU0hW,EAEjBA,EAAWr3P,UAAUyG,OAAS,SAAgBsoD,EAAM/3J,SAC5CmlG,EAAQ4yD,EAAKtuD,WAAWte,MAAM,YAE9BixB,EAAQp8G,EAAQo8G,MAAMrb,cAEtB85G,EAAK,sCACPx6H,GAAS,EACThQ,GAAO,UACFmC,EAAI,EAAGA,EAAI2yB,EAAM70B,OAAQkC,IAAAA,OAC1BmW,EAAQwc,EAAM3yB,GAAGmW,MAAMkyH,MACf,OAAVlyH,GAGAA,EAAM,KAAOyzB,OAGF,IAAX/7B,MAKe,QAAbsI,EAAM,GAAO,MAEjBtY,EAAMmC,WANW,UAAbmW,EAAM,GAAO,MAEjBtI,EAAQ7N,OAQG,IAAX6N,IAAyB,IAAThQ,EAAS,MAAA,IACjB8zB,MAAM,8BAAgCiY,SAE5ClN,EAAS/J,EAAM10B,MAAM4P,EAAQ,EAAGhQ,GAAKsF,KAAK,IAEhDu5B,EAAO3qB,QAAQ,kBAAmB,UAE5B8V,EAAQi0J,EAAOx5F,KAAK5lD,EAAQ,iBAC3BmwP,EAAWr2P,UAAUyG,OAAOxG,KAAKoC,KAAMhR,EAAOr6F,yFCjDvD,aAEA,MAAAyrI,EAAA9sI,EAEA8sI,EAAA0wN,SAAAv9V,EAAA,cAAAu9V,SACA1wN,EAAA4wN,cAAAz9V,EAAA,YAAAy9V,cACA5wN,EAAA2wN,cAAAx9V,EAAA,YAAAw9V,cACA3wN,EAAA+qB,KAAA53J,EAAA,gGCPA,aAEA,MAAA6oO,EAAA9oO,EAGA8oO,EAAA64H,SAAA,SAAA7qR,GACA,MAAA2B,EAAA,GAWA,OATAv4E,OAAAW,KAAAi2E,GAAAh2E,SAAA,SAAAY,IAEA,EAAAA,IAAAA,IACAA,GAAA,GAEA,MAAAtB,EAAA02E,EAAAp1E,GACA+2E,EAAAr4E,GAAAsB,KAGA+2E,GAGAqwJ,EAAA4kB,IAAAztP,EAAA,sDCjBA,aAEA,IAAA2hW,EAAA3hW,EAAA,WAEA4hW,EAAAD,EAAA9vC,OAAA,QAAA,WACAplN,KAAAouP,OAAA,CACAgH,QAAAp1P,KAAAq1P,UACAC,YAAAt1P,KAAA6wJ,eAIA0kG,EAAAL,EAAA9vC,OAAA,sBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,QAAA64V,QACA7tP,KAAAhrG,IAAA,SAAAk8V,UAIAvD,EAAAuH,EAAA9vC,OAAA,uBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,aAAA64V,QACA7tP,KAAAhrG,IAAA,cAAA4qI,WACA5/B,KAAAhrG,IAAA,SAAA64V,QAAAjuN,eAIA41N,EAAAN,EAAA9vC,OAAA,wBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,aAAA/B,IAAA06V,GACA3tP,KAAAhrG,IAAA,oBAAA44V,aAIA6H,EAAAP,EAAA9vC,OAAA,6BAAA,WACAplN,KAAA01P,MAAAH,MAGAI,EAAAT,EAAA9vC,OAAA,eAAA,WACAplN,KAAA41P,MAAAH,MAGAI,EAAAX,EAAA9vC,OAAA,QAAA,WACAplN,KAAAouP,OAAA,CACA0H,YAAA91P,KAAA/sG,IAAA0iW,QAIAI,EAAAb,EAAA9vC,OAAA,YAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,aAAA/B,IAAAkiW,GACAn1P,KAAAhrG,IAAA,YAAA/B,IAAAkiW,OAIAa,EAAAd,EAAA9vC,OAAA,aAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,UAAA64V,QACA7tP,KAAAhrG,IAAA,YAAAivP,OAAArlJ,KAAA,GACAoB,KAAAhrG,IAAA,aAAAg5V,aAIAiI,EAAAf,EAAA9vC,OAAA,kBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,WAAAk5V,SAAA,GAAAr9N,MAAA+O,WACA5/B,KAAAhrG,IAAA,gBAAA67H,MACA7wB,KAAAhrG,IAAA,aAAA/B,IAAA06V,GACA3tP,KAAAhrG,IAAA,UAAA/B,IAAA4iW,GACA71P,KAAAhrG,IAAA,YAAA/B,IAAA8iW,GACA/1P,KAAAhrG,IAAA,WAAA/B,IAAA4iW,GACA71P,KAAAhrG,IAAA,wBAAA/B,IAAAuiW,GACAx1P,KAAAhrG,IAAA,kBAAAo8V,SAAA,GAAAxD,SAAAhuN,WACA5/B,KAAAhrG,IAAA,mBAAAo8V,SAAA,GAAAxD,SAAAhuN,WACA5/B,KAAAhrG,IAAA,cAAAk5V,SAAA,GAAA0H,MAAAI,GAAAp2N,eAIAs2N,EAAAhB,EAAA9vC,OAAA,mBAAA,WACAplN,KAAA0tP,MAAA7uP,IACAmB,KAAAhrG,IAAA,kBAAA/B,IAAAgjW,GACAj2P,KAAAhrG,IAAA,sBAAA/B,IAAA06V,GACA3tP,KAAAhrG,IAAA,kBAAA44V,aAIAv6V,EAAAC,QAAA4iW,ukBCvFIC,EAAW,wHACXC,EAAa,8CACbC,EAAY,iFACZC,EAAM/iW,EAAQ,kBACd4rR,EAAU5rR,EAAQ,kBAClB0vP,EAAS1vP,EAAQ,eAAe0vP,OACpC5vP,EAAOC,QAAU,SAAUijW,EAAMp/H,OAG3Bq/H,EAFAxhW,EAAMuhW,EAAKn4P,WACX9gB,EAAQtoF,EAAIsoF,MAAM64Q,MAEjB74Q,OAICshQ,EAAQ,MAAQthQ,EAAM,GACtBmhL,EAAKxb,EAAOx5F,KAAKnsE,EAAM,GAAI,OAC3B+vQ,EAAapqG,EAAOx5F,KAAKnsE,EAAM,GAAGpE,QAAQ,UAAW,IAAK,UAC1DggO,EAAYo9C,EAAIn/H,EAAUsnC,EAAGr5L,MAAM,EAAG,GAAIgB,SAASkX,EAAM,GAAI,KAAKtoF,IAClE+rI,EAAAA,GACA29H,EAASygB,EAAQw7B,iBAAiBikC,EAAO1lC,EAAWz6C,GACxD19H,EAAIj2D,KAAK4zL,EAAO/oG,OAAO03L,IACvBtsN,EAAIj2D,KAAK4zL,EAAOkyE,SAChB4lB,EAAYvzG,EAAOpxJ,OAAOkvC,OAZvBzjD,KACCm5Q,EAASzhW,EAAIsoF,MAAM+4Q,GACvBG,EAAYvzG,EAAOx5F,KAAKgtM,EAAO,GAAGv9Q,QAAQ,UAAW,IAAK,iBAc1D1U,IAFQxvE,EAAIsoF,MAAM84Q,GAAY,GAG9B1pM,KAAM8pM,0TC3BNvzG,EAAS1vP,EAAQ,eAAe0vP,OAChC8qC,EAAKx6R,EAAQ,SACbq6R,EAAKr6R,EAAQ,YAAYq2E,GACzBsgR,EAAY32V,EAAQ,cACpB09R,EAAS19R,EAAQ,iBAyErB,SAAAmjW,EAAqBp9Q,EAAGg1B,MAClBh1B,EAAE04M,KAAK,IAAM,EAAA,MAAA,IAAal5L,MAAM,kBAChCxf,EAAE6tB,IAAImH,IAAMA,EAAAA,MAAAA,IAAaxV,MAAM,eAGrCzlG,EAAOC,QA5EP,SAAiB+sR,EAAKhtK,EAAMr+G,EAAK21V,EAAUnmR,OACrC62J,EAAM6uH,EAAUl1V,MACH,OAAbqmO,EAAIv0J,KAAS,IAEE,UAAb6jR,GAAqC,cAAbA,EAAa,MAAA,IAAuB7xP,MAAM,gCAoC1E,SAAmBunL,EAAKhtK,EAAMgoH,OACxBuvH,EAAU35D,EAAO51D,EAAI3uE,KAAK6wG,UAAUuwB,MAAMxjN,KAAK,UAC9CsgR,EAAAA,MAAAA,IAAmB9xP,MAAM,iBAAmBuiI,EAAI3uE,KAAK6wG,UAAUuwB,MAAMxjN,KAAK,UAE3EwjN,EAAAA,IAAYF,EAAGg9D,GACfh+D,EAASvxD,EAAI3uE,KAAKqgM,kBAAkBrgM,YAEjCohI,EAAMnY,OAAOtiK,EAAMgtK,EAAKuM,GA1CtB+pE,CAASt2E,EAAKhtK,EAAMgoH,MACL,QAAbA,EAAIv0J,KAAS,IACL,QAAb6jR,EAAa,MAAA,IAAiB7xP,MAAM,gCA2C5C,SAAoBunL,EAAKhtK,EAAMgoH,OACzBn0J,EAAIm0J,EAAI3uE,KAAKxlF,EACbonC,EAAI+sH,EAAI3uE,KAAKp+C,EACb81G,EAAIiX,EAAI3uE,KAAK03D,EACbv2G,EAAIwtH,EAAI3uE,KAAKsgM,QACb4J,EAAW1M,EAAUjjQ,UAAUmd,OAAOi8K,EAAK,OAC3CnkM,EAAI06Q,EAAS16Q,EACb8xB,EAAI4oP,EAAS5oP,EACjB0oP,EAAWx6Q,EAAGoyB,GACdooP,EAAW1oP,EAAGM,OACVuoP,EAAQ9oE,EAAGgV,KAAK77N,GAChBu9I,EAAIvoI,EAAEsjN,KAAKlxL,UAOK,IANZ81G,EAAE6pE,MAAM4oE,GACb31D,OAAAA,IAAWnT,EAAG16K,GAAMu8K,IAAInrE,GAAGniE,IAAIh0C,IAC/B+xL,UACAzQ,IAAI/hL,EAAEogL,MAAM4oE,GAAO31D,OAAOlzL,EAAE4hL,IAAInrE,GAAGniE,IAAIh0C,IAAI+xL,WAC3C/9I,IAAIp7E,GACJo7E,IAAIh0C,GACEnH,IAAI6G,GA5DJ8oP,CAAUz2E,EAAKhtK,EAAMgoH,MAEX,QAAbsvH,GAAmC,cAAbA,EAAa,MAAA,IAAuB7xP,MAAM,yBAEtEua,EAAO4vI,EAAOpxJ,OAAAA,CAAQrtB,EAAK6uC,YACvBjQ,EAAMi4H,EAAI2vH,QAAQ5sH,aAClBpkI,EAAAA,CAAO,GACP03K,EAAS,EACNr+J,EAAKpuC,OAAS+0B,EAAI/0B,OAAS,EAAIm+B,GACpCpJ,EAAIlvB,KAAK,KACT4mM,IAEF13K,EAAIlvB,KAAK,WACL3D,GAAK,IACAA,EAAIksC,EAAKpuC,QAChB+0B,EAAIlvB,KAAKuoC,EAAKlsC,IAEhB6yB,EAAMipJ,EAAOx5F,KAAKzvD,OACdk0L,EAAMH,EAAGgV,KAAK1nE,EAAI2vH,SAGtB3qE,GAFAA,EAAAA,IAAU0N,EAAG1N,GAAK4N,MAAMC,IAEdgT,OAAAA,IAAWnT,EAAG1yD,EAAIm5C,iBAC5B6L,EAAMp9B,EAAOx5F,KAAK42H,EAAIggB,UAAUl9L,eAC5B49B,EAAM2wI,EAAS,EAAI,EAAI,MAC3BtuK,EAAMx9B,KAAKq0B,IAAIomL,EAAIp7M,OAAQ+0B,EAAI/0B,QAC3Bo7M,EAAIp7M,SAAW+0B,EAAI/0B,SAAQ87D,EAAM,GAErC55D,GAAK,IACIA,EAAIi8B,GAAK29B,GAAOs/I,EAAIl5M,GAAK6yB,EAAI7yB,UACvB,IAAR45D,6JC5CLgwJ,EAAWx9R,EAAQ,YACnBw6R,EAAKx6R,EAAQ,SAEjBF,EAAOC,QAAU,SAAqBw6R,cACzBipE,EAAKjpE,QAGdv8E,EAAAA,CACF+tC,UAAAA,CACEzsP,KAAM,YACNurO,WAAY,IAEd44H,UAAAA,CACEnkW,KAAM,OACNurO,WAAY,IAEd64H,WAAAA,CACEpkW,KAAM,OACNurO,WAAY,IAEd84H,WAAAA,CACErkW,KAAM,OACNurO,WAAY,IAEdihB,QAAAA,CACExsP,KAAM,UACNurO,WAAY,IAEd+4H,UAAAA,CACEtkW,KAAM,OACNurO,WAAY,IAEdg5H,UAAAA,CACEvkW,KAAM,OACNurO,WAAY,KAUhB,SAAA24H,EAAejpE,GACb9tL,KAAKq3P,UAAY9lJ,EAAQu8E,GACpB9tL,KAAKq3P,YACRr3P,KAAKq3P,UAAAA,CACHxkW,KAAMi7R,IAGV9tL,KAAK8tL,MAAAA,IAAYiD,EAASnnN,GAAGo2B,KAAKq3P,UAAUxkW,MAC5CmtG,KAAK7rG,UAAAA,EAwDP,SAAAk1V,EAA4Bp6D,EAAItyD,EAAKv5H,GAC9BvF,MAAM/gB,QAAQmyM,KACjBA,EAAKA,EAAG9rL,eAENotH,EAAAA,IAAU0yB,EAAOgsC,MACjB7rL,GAAOmtH,EAAItrJ,OAASm+B,EAAAA,KAClBu3J,EAAAA,IAAY1X,EAAO7/I,EAAMmtH,EAAItrJ,QACjC01L,EAAM62B,KAAK,GACXjhE,EAAM0yB,EAAOpxJ,OAAAA,CAAQ8oK,EAAOpqC,WAEzBoM,EAGIpM,EAAInyH,SAASu+H,GAFbpM,EAjFXhf,EAAQ8vF,KAAO9vF,EAAQylJ,UACvBzlJ,EAAQ+lJ,KAAO/lJ,EAAQgmJ,UAAYhmJ,EAAQ0lJ,WAC3C1lJ,EAAQ+vF,KAAO/vF,EAAQimJ,UAAYjmJ,EAAQ2lJ,WAC3C3lJ,EAAQkmJ,KAAOlmJ,EAAQ4lJ,UACvB5lJ,EAAQmmJ,KAAOnmJ,EAAQ6lJ,UAavBL,EAAKp5P,UAAU6rP,aAAe,SAAU7sH,EAAK3F,UAC3Ch3H,KAAK7rG,KAAO6rG,KAAK8tL,MAAM8lB,aAChB5zM,KAAK0pP,aAAa/sH,EAAK3F,IAGhC+/H,EAAKp5P,UAAUgsP,cAAgB,SAAU3yG,EAAO2gH,EAAOh7H,UACrDg7H,EAAQA,GAAS,OACZ10G,EAAO8H,SAAS/T,KACnBA,EAAAA,IAAYiM,EAAOjM,EAAO2gH,IAIrBtO,EAFQrpP,KAAK8tL,MAAM4lB,cAAc18D,GAAOy4C,YAC5BG,IAAI5vL,KAAK7rG,KAAKigT,cAAcvjB,OACjBl0D,EAAK38H,KAAKq3P,UAAUj5H,aAGpD24H,EAAKp5P,UAAU+rP,aAAe,SAAU/sH,EAAK3F,OACvChiO,EAAMgrG,KAAK7rG,KAAKs7R,UAAqB,eAAXz4D,GAAyB,SACxC,WAAXA,IACEhiO,EAAIA,EAAIiwE,OAAS,GAAK,EACxBjwE,EAAI,GAAK,EAETA,EAAI,GAAK,GAGNq0V,EAAkBr0V,EAAK2nO,IAGhCo6H,EAAKp5P,UAAUksP,cAAgB,SAAUltH,UAChC0sH,EAAkBrpP,KAAK7rG,KAAKigT,aAAcz3E,IAGnDo6H,EAAKp5P,UAAUg1K,aAAe,SAAUt3C,EAAKsB,UAC3CA,EAAMA,GAAO,OACRsmB,EAAO8H,SAAS1vB,KACnBA,EAAAA,IAAU4nB,EAAO5nB,EAAKsB,IAExB38H,KAAK7rG,KAAKuhT,cAAcr6E,GACjBr7H,MAGT+2P,EAAKp5P,UAAU80K,cAAgB,SAAUkC,EAAMh4C,GAC7CA,EAAMA,GAAO,OACRsmB,EAAO8H,SAAS4pB,KACnBA,EAAAA,IAAW1xB,EAAO0xB,EAAMh4C,QAGtBmsH,EAAAA,IAAY/6D,EAAGpZ,UACnBm0E,EAAQA,EAAM1qP,SAAS,IACvB4B,KAAK7rG,KAAO6rG,KAAK8tL,MAAM8lB,aACvB5zM,KAAK7rG,KAAKqhT,eAAeszC,GAClB9oP,mFCzGT1sG,EAAAgtU,cAAA/sU,EAAA,mBACAD,EAAAmtU,eAAAltU,EAAA,oBAEAD,EAAAitU,eAAA,SAAAvrU,EAAAu7N,GACA,OAAAj9N,EAAAgtU,cAAAtrU,EAAAu7N,GAAA,IAGAj9N,EAAAktU,cAAA,SAAAxrU,EAAAu7N,GACA,OAAAj9N,EAAAmtU,eAAAzrU,EAAAu7N,GAAA,0FCRI25H,EAAY32V,EAAQ,cACpBw7Q,EAAcx7Q,EAAQ,eACtBsvT,EAAatvT,EAAQ,eACrBqkW,EAAMrkW,EAAQ,SACdw2Q,EAAMx2Q,EAAQ,SACdw6R,EAAKx6R,EAAQ,SACbskW,EAAatkW,EAAQ,gBACrB02V,EAAM12V,EAAQ,kBACd0vP,EAAS1vP,EAAQ,eAAe0vP,OAEpC5vP,EAAOC,QAAU,SAAwBo/Q,EAAWjjM,EAAKywI,OACnDklD,EAEFA,EADEsN,EAAUtN,QACFsN,EAAUtN,QACXllD,EACC,EAEA,MAGR43I,EADA9iW,EAAMk1V,EAAUx3E,MAEJ,IAAZtN,EACF0yF,EAkBJ,SAAe9iW,EAAKy6E,OACdp7E,EAAIW,EAAIg2V,QAAQ5sH,aAChBs4F,EAAOjnP,EAAIxK,OACX8yR,EAAQl1C,EAAW,QAAQltJ,OAAOstF,EAAOO,MAAM,IAAItqB,SACnD0wC,EAAOmuF,EAAM9yR,OACb+yR,EAAQ,EAAIpuF,KACZ8sD,EAAOriU,EAAI2jW,EAAQ,YACXl/P,MAAM,wBAEdm/P,EAAKh1G,EAAOO,MAAMnvP,EAAIqiU,EAAOshC,EAAQ,GACrCE,EAAQ7jW,EAAIu1Q,EAAO,EACnBrpB,EAAOwuB,EAAYnF,GACnBuuF,EAAWpuF,EAAI9mB,EAAOpxJ,OAAAA,CAAQkmQ,EAAOE,EAAIh1G,EAAOO,MAAM,EAAG,GAAI/zK,GAAMyoR,GAAQN,EAAIr3G,EAAM23G,IACrFj6E,EAAalU,EAAIxpB,EAAMq3G,EAAIO,EAAUvuF,eAC9BmkB,EAAG9qC,EAAOpxJ,OAAAA,CAAQoxJ,EAAOO,MAAM,GAAIy6B,EAAYk6E,GAAW9jW,IAhCvD+jW,CAAKpjW,EAAKy6E,WACD,IAAZ21L,EACT0yF,EAgCJ,SAAgB9iW,EAAKy6E,EAAKywI,OAMpB+3I,EALAvhC,EAAOjnP,EAAIxK,OACX5wE,EAAIW,EAAIg2V,QAAQ5sH,gBAChBs4F,EAAOriU,EAAI,aACHykG,MAAM,oBAIhBm/P,EADE/3I,EACG+iC,EAAOO,MAAMnvP,EAAIqiU,EAAO,EAAG,KAMpC,SAAkBtzN,OAKZsO,EAJAqvB,EAAMkiH,EAAOiE,YAAY9jJ,GACzBj8B,EAAI,EACJ6c,EAAQ+qL,EAAkB,EAAN3rK,GACpBnM,EAAM,OAEH9vB,EAAIi8B,GACLnM,IAAQjT,EAAM/e,SAChB+e,EAAQ+qL,EAAkB,EAAN3rK,GACpBnM,EAAM,IAERya,EAAM1tB,EAAMiT,QAEV8pC,EAAI55D,KAAOuqC,UAGRqvB,EApBAs3N,CAAQhkW,EAAIqiU,EAAO,cAEf3oC,EAAG9qC,EAAOpxJ,OAAAA,CAAQoxJ,EAAOx5F,KAAAA,CAAM,EAAGy2D,EAAU,EAAI,IAAK+3I,EAAIh1G,EAAOO,MAAM,GAAI/zK,GAAMp7E,IA5C7EohR,CAAMzgR,EAAKy6E,EAAKywI,WACP,IAAZklD,YAMCtsK,MAAM,uBALhBg/P,EAAAA,IAAgB/pE,EAAGt+M,IACL03B,IAAInyG,EAAIg2V,UAAY,YACtBlyP,MAAM,oCAKhBonH,EACK+pI,EAAI6N,EAAW9iW,GAEf6iW,EAAWC,EAAW9iW,0NCpC7B6tT,EAAatvT,EAAQ,eACrB0vP,EAAS1vP,EAAQ,eAAe0vP,OAapC,SAAAq1G,EAAgB7rR,OACVs0D,EAAMkiH,EAAOiE,YAAY,UAC7BnmH,EAAI8zL,cAAcpoP,EAAG,GACds0D,EAdT1tI,EAAOC,QAAU,SAAUitP,EAAMn9I,WAG3B32B,EAFAsyE,EAAIkkG,EAAOO,MAAM,GACjBr8K,EAAI,EAED43E,EAAE95E,OAASm+B,GAChB32B,EAAI6rR,EAAMnxR,KACV43E,EAAIkkG,EAAOpxJ,OAAAA,CAAQktD,EAAG8jK,EAAW,QAAQltJ,OAAO4qF,GAAM5qF,OAAOlpF,GAAGysJ,kBAE3Dn6E,EAAE35E,MAAM,EAAGg+B,6ECXpB/vG,EAAAC,QAAA,SAAAuzE,EAAAyS,GAGA,IAFA,IAAA8pB,EAAAv8B,EAAA5B,OACAkC,GAAA,IACAA,EAAAi8B,GACAv8B,EAAAM,IAAAmS,EAAAnS,GAEA,OAAAN,qCCNIknN,EAAKx6R,EAAQ,SACb0vP,EAAS1vP,EAAQ,eAAe0vP,OAUpC5vP,EAAOC,QARP,SAAqBwkW,EAAW9iW,UACvBiuP,EAAOx5F,KAAKquM,EAChB7pE,MAAMF,EAAGgV,KAAK/tS,EAAIg2V,UAClB9pD,OAAAA,IAAWnT,EAAG/4R,EAAIw/Q,iBAClB6rB,UACAl9L,mFCRD+mP,EAAY32V,EAAQ,cACpBqkW,EAAMrkW,EAAQ,SACdw2Q,EAAMx2Q,EAAQ,SACdw6R,EAAKx6R,EAAQ,SACb02V,EAAM12V,EAAQ,kBACdsvT,EAAatvT,EAAQ,eACrBskW,EAAatkW,EAAQ,gBACrB0vP,EAAS1vP,EAAQ,eAAe0vP,OAEpC5vP,EAAOC,QAAU,SAAyBk/Q,EAAY71C,EAAKzc,OACrDklD,EAEFA,EADEoN,EAAWpN,QACHoN,EAAWpN,QACZllD,EACC,EAEA,MAQRzwI,EALAz6E,EAAMk1V,EAAU13E,GAChBn+Q,EAAIW,EAAIg2V,QAAQ5sH,gBAChBzB,EAAI13J,OAAS5wE,GAAAA,IAAS05R,EAAGpxD,GAAKx1H,IAAInyG,EAAIg2V,UAAY,YAC1ClyP,MAAM,oBAIhBrpB,EADEywI,EACI23I,EAAAA,IAAe9pE,EAAGpxD,GAAM3nO,GAExBi1V,EAAIttH,EAAK3nO,OAEbujW,EAAUt1G,EAAOO,MAAMnvP,EAAIo7E,EAAIxK,WACnCwK,EAAMwzK,EAAOpxJ,OAAAA,CAAQ0mQ,EAAS9oR,GAAMp7E,GACpB,IAAZ+wQ,SAWN,SAAepwQ,EAAKy6E,OACdp7E,EAAIW,EAAIg2V,QAAQ5sH,aAChB25H,EAAQl1C,EAAW,QAAQltJ,OAAOstF,EAAOO,MAAM,IAAItqB,SACnD0wC,EAAOmuF,EAAM9yR,UACF,IAAXwK,EAAI,aACIqpB,MAAM,wBAEdmlL,EAAaxuM,EAAIrK,MAAM,EAAGwkM,EAAO,GACjCuuF,EAAW1oR,EAAIrK,MAAMwkM,EAAO,GAC5BrpB,EAAOwpB,EAAIkU,EAAY25E,EAAIO,EAAUvuF,IACrCuU,EAAKpU,EAAIouF,EAAUP,EAAIr3G,EAAMlsP,EAAIu1Q,EAAO,OAqC9C,SAAkB/iM,EAAGyS,GACnBzS,EAAIo8K,EAAOx5F,KAAK5iF,GAChByS,EAAI2pK,EAAOx5F,KAAKnwE,OACZk/Q,EAAM,EACNp1P,EAAMv8B,EAAE5B,OACR4B,EAAE5B,SAAWqU,EAAErU,SACjBuzR,IACAp1P,EAAMx9B,KAAKq0B,IAAIpzB,EAAE5B,OAAQqU,EAAErU,aAEzBkC,GAAK,SACAA,EAAIi8B,GACXo1P,GAAQ3xR,EAAEM,GAAKmS,EAAEnS,UAEZqxR,EAjDH1mC,CAAQimC,EAAO55E,EAAG/4M,MAAM,EAAGwkM,cACnB9wK,MAAM,wBAEd3xB,EAAIyiM,OACS,IAAVuU,EAAGh3M,IACRA,OAEc,IAAZg3M,EAAGh3M,eACK2xB,MAAM,2BAEXqlL,EAAG/4M,MAAM+B,GA/BPixR,CAAKpjW,EAAKy6E,MACI,IAAZ21L,SAiCb,SAAgBpwQ,EAAKy6E,EAAKywI,OACpB9kI,EAAK3L,EAAIrK,MAAM,EAAG,GAClB+B,EAAI,EACJw0I,EAAS,OACO,IAAblsI,EAAItI,SACLA,GAAKsI,EAAIxK,OAAAA,CACX02I,cAIAs8I,EAAKxoR,EAAIrK,MAAM,EAAG+B,EAAI,IAEE,SAAvBiU,EAAGgjB,SAAS,SAAsB8hH,GAAoC,SAAvB9kI,EAAGgjB,SAAS,QAAqB8hH,IACnFvE,IAEEs8I,EAAGhzR,OAAS,GACd02I,OAEEA,YACQ7iH,MAAM,2BAEXrpB,EAAIrK,MAAM+B,GArDRsuM,CAAMzgR,EAAKy6E,EAAKywI,MACF,IAAZklD,SACF31L,YAEGqpB,MAAM,kNCvCpB,+CAEA,SAAA+oO,cACY/oO,MAAM,kHAEd2/P,EAAallW,EAAQ,eAErB0vP,GADc1vP,EAAQ,eACbklW,EAAWx1G,QACpBy1G,EAAmBD,EAAWlnC,WAC9BvjG,EAASxuH,EAAOwuH,QAAUxuH,EAAOusK,SACjC4sF,EAAa/yR,KAAKy5J,IAAI,EAAG,IAAM,EACnC,SAAAu5H,EAAuB7zR,EAAQE,MACP,iBAAXF,GAAuBA,GAAWA,YACjCggC,UAAU,8BAGlBhgC,EAAS4zR,GAAc5zR,EAAS,YACxBggC,UAAU,8BAGlBhgC,EAAS2zR,GAAoB3zR,EAASE,YAC9Bs6J,WAAW,uBAIzB,SAAA0vF,EAAqBhyN,EAAMl4B,EAAQE,MACb,iBAATg4B,GAAqBA,GAASA,YAC7B8H,UAAU,4BAGlB9H,EAAO07P,GAAc17P,EAAO,YACpB8H,UAAU,4BAGlB9H,EAAOl4B,EAASE,GAAUg4B,EAAOy7P,YACzBn5H,WAAW,oBAUzB,SAAAohG,EAAqBpwG,EAAKxrJ,EAAQk4B,EAAMojD,QACjC4iG,EAAO8H,SAASx6B,IAAUA,aAAe/wH,EAAOi5H,sBACzC1zH,UAAU,oDAGA,mBAAXhgC,EACTs7E,EAAKt7E,EACLA,EAAS,EACTk4B,EAAOszH,EAAItrJ,eACc,mBAATg4B,EAChBojD,EAAKpjD,EACLA,EAAOszH,EAAItrJ,OAASF,UACG,mBAAPs7E,YACNt7C,UAAU,2CAEtB6zP,EAAa7zR,EAAQwrJ,EAAItrJ,QACzBgqP,EAAWhyN,EAAMl4B,EAAQwrJ,EAAItrJ,QACtB4zR,EAAWtoI,EAAKxrJ,EAAQk4B,EAAMojD,GAGvC,SAAAw4M,EAAqBtoI,EAAKxrJ,EAAQk4B,EAAMojD,OAEhCy4M,EAASvoI,EAAI1gB,OACb64C,EAAAA,IAAWjwB,WAAWqgI,EAAQ/zR,EAAQk4B,UAC1C+wH,EAAO69C,gBAAgBnjB,GACnBroG,OACFyxC,EAAQla,UAAS,WACfv3B,EAAG,KAAMkwE,MAINA,EAgBX,SAAAquG,EAAyBruG,EAAKxrJ,EAAQk4B,WACd,IAAXl4B,IACTA,EAAS,KAENk+K,EAAO8H,SAASx6B,IAAUA,aAAe/wH,EAAOi5H,sBACzC1zH,UAAU,wDAGtB6zP,EAAa7zR,EAAQwrJ,EAAItrJ,aAEZvvE,IAATunG,IAAoBA,EAAOszH,EAAItrJ,OAASF,GAE5CkqP,EAAWhyN,EAAMl4B,EAAQwrJ,EAAItrJ,QAEtB4zR,EAAWtoI,EAAKxrJ,EAAQk4B,GApE5B+wH,GAAUA,EAAO69C,iBACpBv4Q,EAAQqtU,WAAaA,EACrBrtU,EAAQsrU,eAAiBA,IAEzBtrU,EAAQqtU,WAAakB,EACrBvuU,EAAQsrU,eAAiBiD,0FCtC3BxuU,EAAAC,QAAA,CAAAorU,YAFA,kGCHA,aAEA,MAAA7B,EAAAtpU,EAAA,SACAuqU,EAAAvqU,EAAA,aACA4xH,EAAA5xH,EAAA,YAsEAF,EAAAC,QA1DA,cAAAwqU,EACAjnU,cACA0uH,QAGAvlB,KAAA0sD,KAAA,GAGA71J,OACA,OAAAkvK,QAAAC,UAGAnvK,QACA,OAAAkvK,QAAAC,UAOAnvK,UAAA7B,EAAA2kG,GACAqG,KAAA0sD,KAAA13J,EAAAopG,YAAAzE,EAMA9iG,UAAA7B,GAEA,UADAgrG,KAAAjhB,IAAA/pF,GACA,MAAAmwH,EAAA4zO,gBACA,OAAA/4P,KAAA0sD,KAAA13J,EAAAopG,YAMAvnG,UAAA7B,GACA,YAAAU,IAAAsqG,KAAA0sD,KAAA13J,EAAAopG,YAMAvnG,aAAA7B,UACAgrG,KAAA0sD,KAAA13J,EAAAopG,YAGAvnG,mBACArD,OAAA0pG,QAAA8C,KAAA0sD,MACAtiF,KAAA,EAAAp1E,EAAAtB,MAAA,CAAAsB,IAAA,IAAA6nU,EAAA7nU,GAAAtB,MAAAA,MAGAmD,uBACArD,OAAA0pG,QAAA8C,KAAA0sD,MACAtiF,KAAA,EAAAp1E,KAAA,IAAA6nU,EAAA7nU,yFCtEA,aAEA,MAAAgkW,QAAAA,GAAAzlW,EAAA,WACA0lW,EAAA1lW,EAAA,YACAw6E,EAAAx6E,EAAA,aACA2lW,EAAA3lW,EAAA,WAgOAF,EAAAC,QA5MA,MAIAuD,OACA,OAAAkvK,QAAAw5B,OAAA,IAAAzmG,MAAA,6BAMAjiG,QACA,OAAAkvK,QAAAw5B,OAAA,IAAAzmG,MAAA,8BASAjiG,IAAA7B,EAAA2kG,EAAAhlG,GACA,OAAAoxK,QAAAw5B,OAAA,IAAAzmG,MAAA,4BAQAjiG,IAAA7B,EAAAL,GACA,OAAAoxK,QAAAw5B,OAAA,IAAAzmG,MAAA,4BAQAjiG,IAAA7B,EAAAL,GACA,OAAAoxK,QAAAw5B,OAAA,IAAAzmG,MAAA,4BAQAjiG,OAAA7B,EAAAL,GACA,OAAAoxK,QAAAw5B,OAAA,IAAAzmG,MAAA,+BAQAjiG,cAAAk+E,EAAApgF,EAAA,IACA,UAAA,MAAAK,IAAAA,EAAAtB,MAAAA,KAAAqhF,QACAirB,KAAAqxH,IAAAr8N,EAAAtB,EAAAiB,QACA,CAAAK,IAAAA,EAAAtB,MAAAA,GASAmD,cAAAk+E,EAAApgF,EAAA,IACA,UAAA,MAAAK,KAAA+/E,QACAirB,KAAAxe,IAAAxsF,EAAAL,GASAkC,iBAAAk+E,EAAApgF,EAAA,IACA,UAAA,MAAAK,KAAA+/E,QACAirB,KAAAvc,OAAAzuF,EAAAL,SACAK,EAOA6B,QAEA,IAAAsiW,EAAA,GAEAC,EAAA,GAEA,MAAA,CACAviW,IAAA7B,EAAAtB,GACAylW,EAAAruR,KAAA,CAAA91E,IAAAA,EAAAtB,MAAAA,KAGAmD,OAAA7B,GACAokW,EAAAtuR,KAAA91E,IAEAqkW,OAAA/lN,MAAA3+I,UACAskW,EAAAj5P,KAAAs5P,QAAAH,EAAAxkW,IACAwkW,EAAA,SACAF,EAAAj5P,KAAAu5P,WAAAH,EAAAzkW,IACAykW,EAAA,KAaAviW,WAAAy3G,EAAA35G,GACA,MAAA,IAAAmkG,MAAA,4BAWAjiG,eAAAy3G,EAAA35G,GACA,MAAA,IAAAmkG,MAAA,gCAOAjiG,MAAAy3G,EAAA35G,GACA,IAAA6kW,EAAAx5P,KAAAy5P,KAAAnrP,EAAA35G,GAgBA,GAdA,MAAA25G,EAAA3jB,SACA6uQ,EAAAzrR,EAAAyrR,GAAAzlW,GACAA,EAAAiB,IAAAopG,WAAAjiB,WAAAmyB,EAAA,WAIAzQ,MAAA/gB,QAAAwxB,EAAApqB,WACAs1Q,EAAAlrP,EAAApqB,QAAAxe,QAAA,CAAA8zR,EAAA93M,IAAA3zE,EAAAyrR,EAAA93M,IAAA83M,IAGA37P,MAAA/gB,QAAAwxB,EAAAorP,UACAF,EAAAlrP,EAAAorP,OAAAh0R,QAAA,CAAA8zR,EAAA93M,IAAAs3M,EAAAQ,EAAA93M,IAAA83M,IAGA,MAAAlrP,EAAAvpC,OAAA,CACA,IAAAoC,EAAA,EACAqyR,EAAAzrR,EAAAyrR,GAAA,IAAAryR,KAAAmnC,EAAA,SAOA,OAJA,MAAAA,EAAAymN,QACAykC,EAAAN,EAAAM,EAAAlrP,EAAAymN,QAGAykC,EAOA3iW,UAAAy3G,EAAA35G,GACA,IAAA6kW,EAAAx5P,KAAA25P,SAAArrP,EAAA35G,GAgBA,GAdA,MAAA25G,EAAA3jB,SACA6uQ,EAAAzrR,EAAAyrR,GAAAxkW,GACAA,EAAAopG,WAAAjiB,WAAAmyB,EAAA,WAIAzQ,MAAA/gB,QAAAwxB,EAAApqB,WACAs1Q,EAAAlrP,EAAApqB,QAAAxe,QAAA,CAAA8zR,EAAA93M,IAAA3zE,EAAAyrR,EAAA93M,IAAA83M,IAGA37P,MAAA/gB,QAAAwxB,EAAAorP,UACAF,EAAAlrP,EAAAorP,OAAAh0R,QAAA,CAAA8zR,EAAA93M,IAAAs3M,EAAAQ,EAAA93M,IAAA83M,IAGA,MAAAlrP,EAAAvpC,OAAA,CACA,IAAAoC,EAAA,EACAqyR,EAAAzrR,EAAAyrR,GAAA,IAAAryR,KAAAmnC,EAAA,SAOA,OAJA,MAAAA,EAAAymN,QACAykC,EAAAN,EAAAM,EAAAlrP,EAAAymN,QAGAykC,4GCjOA,aAEA,MAAAI,EAAArmW,EAAA,2BACAmzN,EAAAnzN,EAAA,UA2BAF,EAAAC,QAAA,CACA0lW,QAjBA,CAAApvB,EAAAiwB,IACA,kBACA,MAAAz8P,QAAAspH,EAAAkjH,SACAxsO,EAAAhR,KAAAytQ,GAFA,GAiBAC,OAAAF,EACAG,iBARA,CAAA79Q,EAAA8xB,KACA,MAAAqiG,EAAA,IAAAr5F,OAAA,IAAAhJ,GACA,OAAA9xB,EAAAhD,QAAAm3H,EAAA,sFC3BA,aAEA,MAAA0tH,OAAAA,GAAAxqU,EAAA,UAYAF,EAAAC,QAJA,CAAA6wF,EAAAy5C,CAAAA,GAAAA,KACAz5C,EAAA45O,iDCXA,aAkBA1qU,EAAAC,QAVAggJ,MAAAv+D,IACA,MAAA6nB,EAAA,GAEA,UAAA,MAAAm5E,KAAAhhG,EACA6nB,EAAA9xB,KAAAirG,GAGA,OAAAn5E,iCCfA,aAcAvpG,EAAAC,QAJAggJ,MAAAv+D,IACA,UAAA,MAAAoG,KAAApG,mCCXA,aAiBA1hF,EAAAC,QARAggJ,gBAAAv+D,EAAA6P,GACA,UAAA,MAAAmxF,KAAAhhG,QACA6P,EAAAmxF,WACAA,kCCZA,aA4BA1iL,EAAAC,QAlBAggJ,gBAAAv+D,EAAAggP,GACA,IAAAzxK,EAAA,EAEA,KAAAyxK,EAAA,GAIA,UAAA,MAAAh/I,KAAAhhG,EAKA,SAJAghG,EAEAzyB,IAEAA,IAAAyxK,EACA,oCCvBA,aAEA,MAAAjY,EAAAvpT,EAAA,YA0CAF,EAAAC,QAAA,CACA0mW,kBAtCA,SAAAvgQ,GAEA,OADAA,EAAAA,GAAA,IAAAX,MAAA,wBACAgkN,EAAArjN,EAAA,uBAqCAwgQ,oBA/BA,SAAAxgQ,GAEA,OADAA,EAAAA,GAAA,IAAAX,MAAA,iBACAgkN,EAAArjN,EAAA,yBA8BAygQ,mBAxBA,SAAAzgQ,GAEA,OADAA,EAAAA,GAAA,IAAAX,MAAA,gBACAgkN,EAAArjN,EAAA,wBAuBAs/P,cAjBA,SAAAt/P,GAEA,OADAA,EAAAA,GAAA,IAAAX,MAAA,aACAgkN,EAAArjN,EAAA,kBAgBA0gQ,aAVA,SAAA1gQ,GAEA,OADAA,EAAAA,GAAA,IAAAX,MAAA,WACAgkN,EAAArjN,EAAA,iECxCA,aAGA,MAAA2gQ,EAAA7mW,EAAA,6BACA87N,UAAAA,GAAA97N,EAAA,eACAJ,QAAAknW,GAAA9mW,EAAA,mBACAw7N,aAAAA,GAAAx7N,EAAA,YAqGAF,EAAAC,QA5FA,SAAAsxF,EAAA01Q,GAEA,MAAA,IAAAlkR,KACA,MAAAzhF,EAAAyhF,EAAA,MAAAkkR,EAAAlkR,EAAAnR,OAAA,EAAAq1R,GACA,IAAA3lW,IAAAA,EAAAm2K,QAAA,OAAAlmF,KAAAxO,GAEA,MAAA00F,EAAA,iBAAAn2K,EAAAm2K,QACAuvL,EAAA1lW,EAAAm2K,SACAn2K,EAAAm2K,QAEA+sD,EAAA,IAAAuiI,EAAAtvL,GAEAn2K,EAAAk7N,OAAAR,EAAA,CAAA16N,EAAAk7N,OAAAgI,EAAAhI,SAEA,MAAA0qI,EAAA31Q,KAAAxO,GAEAokR,EAAA,IAAAz0L,SAAA,CAAA00L,EAAAl7J,KACAs4B,EAAAhI,OAAA3pD,iBAAA,SAAA,KACAq5B,EAAA,IAAAwvB,SAIA/5I,EAAA+oB,KAAAunE,MAEAo1L,EAAA,KACA,GAAA7iI,EAAAhI,OAAAx8E,QACA,MAAA,IAAA07E,EAQA,GALAhxH,KAAAunE,MAAAtwF,EAKA81F,EAEA,MADA+sD,EAAA7kF,QACA,IAAA+7E,GAKA,OAAAwrI,EAAArkW,OAAAy6N,eAEA,kBAEA,MAAA6oI,EAAAe,EAAArkW,OAAAy6N,iBAEA,IACA,OAAA,CACA,MAAAj9N,MAAAA,EAAAo2K,KAAAA,SAAA/D,QAAA40L,KAAA,CAAAnB,EAAAp8Q,OAAAo9Q,IAEA,GAAA1wL,EACA,MAGA4wL,UAEAhnW,GAEA,MAAA+lG,GAGA,MAFAihQ,IAEAjhQ,EACA,QACAo+H,EAAAzqE,QAEAosM,EAAA5oI,QACA4oI,EAAA5oI,UAxBA,GA+BA,WACA,IACA,MAAA7kJ,QAAAg6F,QAAA40L,KAAA,CAAAJ,EAAAC,IAIA,OAFAE,IAEA3uR,EACA,MAAA0tB,GAGA,MAFAihQ,IAEAjhQ,EACA,QACAo+H,EAAAzqE,UAZA,sICzFA,aAGA,MAAAgiE,gBAAAA,GACA,oBAAA9vH,KAAAA,KACA,oBAAAC,OAAAA,OACAhsG,EAAA,oBAEAqnW,EAAArnW,EAAA,WAEA,MAAA6mW,UAAAhrI,EAKAv4N,YAAAi5N,GACAvqG,QACAvlB,KAAA66P,IAAA/qI,EACA9vH,KAAA86P,OAAAF,GAAA,IAAA56P,KAAAgzC,SAAA88E,GAEAt8N,OAAA46T,eAAApuN,KAAAo6P,EAAAz8P,WAMA9mG,QAEA,OADAmpG,KAAA86P,OAAA1tM,QACA7nC,MAAAytB,QAMAn8I,QACAmpG,KAAA86P,OAAA1tM,QAMAv2J,QACAmpG,KAAA86P,OAAA1tM,QACAptD,KAAA86P,OAAAF,GAAA,IAAA56P,KAAAgzC,SAAAhzC,KAAA66P,MAIAxnW,EAAAC,QAAA8mW,EACA/mW,EAAAC,QAAA8mW,kBAAAA,0ECjDA,aAEA,IAAA59P,EAAAjpG,EAAA,UAEA,SAAAwnW,EAAA1gM,EAAAyQ,EAAA10F,GACA,IAAAo0P,EAAAxqO,KAEAA,KAAAg7P,SAAAx+P,IACAwD,KAAAi7P,aAAA,EACAj7P,KAAAk7P,WAAApwL,EACA9qE,KAAAm7P,MAAA/kR,EAEA4pB,KAAA86P,OAAAjwL,YAEA,SAAAuwL,IACA5wB,EAAAywB,aAAA,GACAzwB,EAAA0wB,WAAA1wB,EAAAywB,cAAAz+P,IAAAguO,EAAAwwB,UACAxwB,EAAAswB,OAAAjwL,WAAAuwL,EAAA5wB,EAAA0wB,YACA1wB,EAAAywB,aAAA,GAEA5gM,EAAA+oC,MAAA,KAAAonI,EAAA2wB,SARArwL,GAaAiwL,EAAAp9P,UAAA09P,WAAA,SAAAvwL,GACA,IAAAxF,EAAA9oE,IACA,QAAA8oE,EAAAwF,GAAA9qE,KAAAg7P,SAAAh7P,KAAAk7P,YAAA,KAGAl7P,KAAAg7P,SAAA11L,EACAtlE,KAAAi7P,aAAAnwL,GACA,IAIAiwL,EAAAp9P,UAAAyvD,MAAA,WACA6iE,aAAAjwH,KAAA86P,SAyBAznW,EAAAC,QAtBA,WACA,GAAA,mBAAA+iF,UAAA,GACA,MAAA,IAAAyiB,MAAA,mBAGA,GAAA,iBAAAziB,UAAA,GACA,MAAA,IAAAyiB,MAAA,kBAGA,IAAA1iB,EAEA,GAAAC,UAAApR,OAAA,EAAA,CACAmR,EAAA,IAAAynB,MAAAxnB,UAAApR,OAAA,GAEA,IAAA,IAAAkC,EAAA,EAAAA,EAAAiP,EAAAnR,OAAAkC,IACAiP,EAAAjP,GAAAkP,UAAAlP,EAAA,GAIA,OAAA,IAAA4zR,EAAA1kR,UAAA,GAAAA,UAAA,GAAAD,kDC3DA,aAEA/iF,EAAAC,QAAA,WACA,OAAAyqG,KAAAunE,qCCHA,aAEA,IAAAg2L,EAAA,4DAyDA,SAAArsR,EAAAumB,EAAA,GAAAwhI,EAAA,MACA,IAAApsJ,EAAA,KAQA,OANA4qB,GAAAA,EAAA,IAAAtc,QAAA,gBAAA,SACAA,QAAAoiR,GAAA,SAAAngR,EAAAlnF,EAAAy8T,IACAA,EAAA6qC,EAAA7qC,MACA9lP,GAAAA,GAAA,GAAAq0B,WAAAhrG,EAAA,IAAAy8T,MAGA9lP,GAAAA,GAAA2wR,EAAAvkI,IAAA,GAGA,SAAAukI,EAAA/lQ,GACA,OAAAvmB,EAAAumB,IAAAvmB,EAAAumB,EAAApsB,cAAA8P,QAAA,KAAA,KApEA7lF,EAAAC,QAAA27E,EAEA57E,EAAAC,QAAAH,QAAA87E,EAMAA,EAAAusR,WACAvsR,EAAAvI,GAAA,KAEAuI,EAAA,MACAA,EAAA,MACAA,EAAAwsR,GACAxsR,EAAAysR,YAAA,KAEAzsR,EAAA0sR,YACA1sR,EAAA6gJ,GACA7gJ,EAAA,IAAA,EAEAA,EAAAylR,OACAzlR,EAAA6lR,IACA7lR,EAAAiN,EAAA,IAAAjN,EAAA6gJ,GAEA7gJ,EAAA2sR,OACA3sR,EAAAgrB,IACAhrB,EAAAiQ,EAAA,GAAAjQ,EAAAiN,EAEAjN,EAAA4lR,KACA5lR,EAAAonQ,GACApnQ,EAAAw4F,EAAA,GAAAx4F,EAAAiQ,EAEAjQ,EAAA2lR,IACA3lR,EAAA2uD,EAAA,GAAA3uD,EAAAw4F,EAEAx4F,EAAA4sR,KACA5sR,EAAA6sR,GACA7sR,EAAAw1I,EAAA,EAAAx1I,EAAA2uD,EAEA3uD,EAAA8sR,MACA9sR,EAAAqK,EACA,QAAArK,EAAA2uD,EAEA3uD,EAAAkhL,KACAlhL,EAAA+sR,GACA/sR,EAAA4+B,EAAA,OAAA5+B,EAAA2uD,8BCjDA,aAEA,MAAAmxF,UAAAj2H,MACAjiG,YAAA8iF,EAAA,qBACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,eACAmtG,KAAA3qG,KAAA05N,EAAA15N,MAIA05N,EAAA15N,KAAA,cACA/B,EAAAy7N,aAAAA,gCCXA,aAEA,MAAAR,EAAAh7N,EAAA,QACAupU,EAAAvpU,EAAA,2CACA0oW,EAAA1oW,EAAA,uCAOAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAF,QAAAA,KAqDA2C,GAjDAxpL,eAAAw3E,EAAAn2N,EAAA,IACA,MAAAg5N,IACAA,EAAAh7N,KACAA,GACAspW,EAAAnxI,IAEA,IAAAn2N,EAAAwlU,SACAA,EAAAxsG,GAGAh7N,IACAgC,EAAAhC,KAAAA,GAGA,IAAAupW,EAAAvuI,EACAwuI,EAAAxnW,EAAAhC,MAAA,GAMA,GAJAwpW,EAAAhgR,WAAA,OACAggR,EAAAA,EAAArgQ,UAAA,IAGAnnG,EAAAhC,KACA,IACA,UAAA,MAAAe,MAAAA,EAAA0oW,cAAAA,KAAA/hC,EAAAr0J,QAAA2nD,EAAAh5N,EAAAhC,KAAA,CACAk9N,OAAAl7N,EAAAk7N,SACA,CACA,IAAAtB,EAAAsM,MAAAnnO,GACA,MAGAyoW,EAAAC,EACAF,EAAAxoW,GAEA,MAAA+lG,GAMA,MAJAA,EAAA9f,QAAAwC,WAAA,4BACAsd,EAAA9f,QAAA,kBAAAwiR,EAAAr8Q,MAAA,KAAA,aAAAo8Q,IACAziQ,EAAApkG,KAAA,eAEAokG,EAIA,MAAA,CACAk0H,IAAAuuI,EACAE,cAAAD,GAAA,iJC5DA,aAEA,MAAA5tI,EAAAh7N,EAAA,QACAupT,EAAAvpT,EAAA,YAEA8oW,EAAA,SA8CAhpW,EAAAC,QAxCAqoG,IACA,GAAAA,aAAA88H,WACA,IACA98H,EAAA,IAAA4yH,EAAA5yH,GACA,MAAAlC,GACA,MAAAqjN,EAAArjN,EAAA,mBAIA,GAAA80H,EAAAsM,MAAAl/H,GACA,MAAA,CACAgyH,IAAAhyH,EACAhpG,UAAA+C,GAIAimG,EAAAxf,WAAAkgR,KACA1gQ,EAAAA,EAAAG,UAAAugQ,EAAAp3R,SAGA,MAAAghC,EAAAtK,EAAA7b,MAAA,KACA,IAAA6tI,EACAh7N,EAEA,IACAg7N,EAAA,IAAAY,EAAAtoH,EAAAtB,SACA,MAAAlL,GACA,MAAAqjN,EAAArjN,EAAA,mBAOA,OAJAwM,EAAAhhC,SACAtyE,EAAA,IAAAszG,EAAA37B,KAAA,QAGA,CACAqjJ,IAAAA,EACAh7N,KAAAA,oFCzCAW,EAAQgpW,WA2IR,SAAoBlmR,MACnBA,EAAK,IAAM4pB,KAAKu8P,UAAY,KAAO,IAClCv8P,KAAKo2B,WACJp2B,KAAKu8P,UAAY,MAAQ,KAC1BnmR,EAAK,IACJ4pB,KAAKu8P,UAAY,MAAQ,KAC1B,IAAMlpW,EAAOC,QAAQkpW,SAASx8P,KAAK0uG,OAE/B1uG,KAAKu8P,uBAIJ9vR,EAAI,UAAYuzB,KAAK86G,MAC3B1kI,EAAK3L,OAAO,EAAG,EAAGgC,EAAG,sBAKjBlH,EAAQ,EACRk3R,EAAQ,EACZrmR,EAAK,GAAG8C,QAAQ,eAAeoE,IAChB,OAAVA,IAGJ/X,IACc,OAAV+X,IAGHm/Q,EAAQl3R,OAIV6Q,EAAK3L,OAAOgyR,EAAO,EAAGhwR,IA1KvBn5E,EAAQ6+V,KA6LR,SAAc7zB,OAERA,EACHhrU,EAAQymU,QAAQpiE,QAAQ,QAAS2mE,GAEjChrU,EAAQymU,QAAQriE,WAAW,eAEpBnoL,MAnMVj8E,EAAQ+rM,KA+MR,eACKrxF,MAEHA,EAAI16G,EAAQymU,QAAQliE,QAAQ,eACpBtoL,KAMJy+B,QAAwB,IAAZ8jF,GAA2B,QAASA,IACpD9jF,OAAAA,UAGMA,GA5NR16G,EAAQipW,UAyGR,cAIuB,oBAAXh9P,QAA0BA,OAAOuyF,UAAoC,aAAxBvyF,OAAOuyF,QAAQhrH,MAAuBy4B,OAAOuyF,QAAQ4qK,eACrG,KAIiB,oBAAd92L,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUz8F,cAAckU,MAAM,gCAC/F,QAKoB,oBAAbnoF,UAA4BA,SAAS41M,iBAAmB51M,SAAS41M,gBAAgBlmC,OAAS1vK,SAAS41M,gBAAgBlmC,MAAM83L,kBAEpH,oBAAXp9P,QAA0BA,OAAO7E,UAAY6E,OAAO7E,QAAQkiQ,SAAYr9P,OAAO7E,QAAQ09J,WAAa74J,OAAO7E,QAAQ8hK,QAGrG,oBAAd52F,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUz8F,cAAckU,MAAM,mBAAqBlX,SAAS4wC,OAAO0zJ,GAAI,KAAO,IAE9H,oBAAd9kG,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUz8F,cAAckU,MAAM,uBA9HtGhqF,EAAQymU,QAyOR,sBAIS1hE,mBACC9oL,KA9OQstR,GAClBvpW,EAAQg6M,QAAAA,UACHu9H,GAAS,QAEN,KACDA,IACJA,GAAS,EACTnwO,QAAQs6E,KAAK,4IANRs4B,GAeRh6M,EAAQwpW,OAAAA,CACP,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,WAsFDxpW,EAAQ+4N,IAAM3xH,QAAQupO,OAASvpO,QAAQ2xH,KAAAA,SAkEvCh5N,EAAOC,QAAUC,EAAQ,WAARA,CAAoBD,oBAE9BypW,GAAc1pW,EAAOC,QAM5BypW,EAAWzrQ,EAAI,SAAUwzE,cAEhBj9F,KAAKC,UAAUg9F,SACdv1F,SACD,+BAAiCA,EAAMoK,0ECNhDtmF,EAAAC,QA9PA,SAAAogO,GAqDA,SAAAspI,EAAA5mO,GACA,IAAA6mO,EACAC,EAAA,KAEA,SAAAj5B,KAAA7tP,GAEA,IAAA6tP,EAAAtH,QACA,OAGA,MAAAr9N,EAAA2kO,EAGAj3K,EAAA7mF,OAAA,IAAA43B,MACA+xH,EAAA9iE,GAAAiwM,GAAAjwM,GACA1tD,EAAAovG,KAAAohB,EACAxwH,EAAAniB,KAAA8/Q,EACA39P,EAAA0tD,KAAAA,EACAiwM,EAAAjwM,EAEA52E,EAAA,GAAA4mR,EAAAG,OAAA/mR,EAAA,IAEA,iBAAAA,EAAA,IAEAA,EAAA0C,QAAA,MAIA,IAAAvT,EAAA,EACA6Q,EAAA,GAAAA,EAAA,GAAA8C,QAAA,iBAAA,CAAAoE,EAAA05I,KAEA,GAAA,OAAA15I,EACA,MAAA,IAEA/X,IACA,MAAA63R,EAAAJ,EAAAD,WAAA/lI,GACA,GAAA,mBAAAomI,EAAA,CACA,MAAAzjQ,EAAAvjB,EAAA7Q,GACA+X,EAAA8/Q,EAAAx/P,KAAA0B,EAAA3F,GAGAvjB,EAAA3L,OAAAlF,EAAA,GACAA,IAEA,OAAA+X,KAIA0/Q,EAAAV,WAAA1+P,KAAA0B,EAAAlpB,IAEAkpB,EAAA+sH,KAAA2wI,EAAA3wI,KACAjpB,MAAA9jG,EAAAlpB,GAuBA,OApBA6tP,EAAA7tM,UAAAA,EACA6tM,EAAAs4B,UAAAS,EAAAT,YACAt4B,EAAAnpH,MAAAkiJ,EAAAK,YAAAjnO,GACA6tM,EAAA1uU,OAAAA,EACA0uU,EAAA32H,QAAA0vJ,EAAA1vJ,QAEA95M,OAAAC,eAAAwwU,EAAA,UAAA,CACAllO,YAAA,EACAD,cAAA,EACAtd,IAAA,IAAA,OAAA07Q,EAAAF,EAAArgC,QAAAvmM,GAAA8mO,EACAz7Q,IAAAqjF,IACAo4L,EAAAp4L,KAKA,mBAAAk4L,EAAAhoO,MACAgoO,EAAAhoO,KAAAivM,GAGAA,EAGA,SAAA1uU,EAAA6gI,EAAAknO,GACA,MAAAC,EAAAP,EAAAh9P,KAAAo2B,gBAAA,IAAAknO,EAAA,IAAAA,GAAAlnO,GAEA,OADAmnO,EAAAlxI,IAAArsH,KAAAqsH,IACAkxI,EAwFA,SAAAC,EAAA3rP,GACA,OAAAA,EAAAzT,WACAtC,UAAA,EAAA+V,EAAAzT,WAAAn5B,OAAA,GACAiU,QAAA,UAAA,KA2BA,OA1PA8jR,EAAA/4B,MAAA+4B,EACAA,EAAA7pW,QAAA6pW,EACAA,EAAAG,OAuOA,SAAAxjQ,GACA,GAAAA,aAAAb,MACA,OAAAa,EAAA6d,OAAA7d,EAAAhgB,QAEA,OAAAggB,GA1OAqjQ,EAAAS,QA2KA,WACA,MAAAn/B,EAAA,IACA0+B,EAAAr5P,MAAAv5B,IAAAozR,MACAR,EAAAU,MAAAtzR,IAAAozR,GAAApzR,KAAAgsD,GAAA,IAAAA,KACA9rD,KAAA,KAEA,OADA0yR,EAAAW,OAAA,IACAr/B,GAhLA0+B,EAAAW,OA0IA,SAAAr/B,GAMA,IAAAn3P,EALA61R,EAAA7K,KAAA7zB,GAEA0+B,EAAAr5P,MAAA,GACAq5P,EAAAU,MAAA,GAGA,MAAA59Q,GAAA,iBAAAw+O,EAAAA,EAAA,IAAAx+O,MAAA,UACAsjB,EAAAtjB,EAAA7a,OAEA,IAAAkC,EAAA,EAAAA,EAAAi8B,EAAAj8B,IACA2Y,EAAA3Y,KAOA,OAFAm3P,EAAAx+O,EAAA3Y,GAAA+R,QAAA,MAAA,QAEA,GACA8jR,EAAAU,MAAA5yR,KAAA,IAAAksC,OAAA,IAAAsnN,EAAAz4P,OAAA,GAAA,MAEAm3R,EAAAr5P,MAAA74B,KAAA,IAAAksC,OAAA,IAAAsnN,EAAA,QA9JA0+B,EAAArgC,QAyLA,SAAA9pU,GACA,GAAA,MAAAA,EAAAA,EAAAoyE,OAAA,GACA,OAAA,EAGA,IAAAkC,EACAi8B,EAEA,IAAAj8B,EAAA,EAAAi8B,EAAA45P,EAAAU,MAAAz4R,OAAAkC,EAAAi8B,EAAAj8B,IACA,GAAA61R,EAAAU,MAAAv2R,GAAA1B,KAAA5yE,GACA,OAAA,EAIA,IAAAs0E,EAAA,EAAAi8B,EAAA45P,EAAAr5P,MAAA1+B,OAAAkC,EAAAi8B,EAAAj8B,IACA,GAAA61R,EAAAr5P,MAAAx8B,GAAA1B,KAAA5yE,GACA,OAAA,EAIA,OAAA,GA5MAmqW,EAAAR,SAAAjpW,EAAA,MACAypW,EAAA1vJ,QA6OA,WACA5yG,QAAAs6E,KAAA,0IA5OAxhL,OAAAW,KAAAu/N,GAAAt/N,SAAAY,IACAgoW,EAAAhoW,GAAA0+N,EAAA1+N,MAOAgoW,EAAAr5P,MAAA,GACAq5P,EAAAU,MAAA,GAOAV,EAAAD,WAAA,GAkBAC,EAAAK,YAVA,SAAAjnO,GACA,IAAA/iB,EAAA,EAEA,IAAA,IAAAlsC,EAAA,EAAAA,EAAAivD,EAAAnxD,OAAAkC,IACAksC,GAAAA,GAAA,GAAAA,EAAA+iB,EAAAn+C,WAAA9Q,GACAksC,GAAA,EAGA,OAAA2pP,EAAAF,OAAAl3R,KAAAu0L,IAAA9mJ,GAAA2pP,EAAAF,OAAA73R,SA+MA+3R,EAAAW,OAAAX,EAAA39J,QAEA29J,2CC7PA,IAAA9gR,EAAA,IACAgD,EAAA,GAAAhD,EACAurF,EAAA,GAAAvoF,EACA0+C,EAAA,GAAA6pC,EACAg9C,EAAA,EAAA7mF,EACA/vB,EAAA,OAAA+vB,EAqJA,SAAAggO,EAAA9tI,EAAA+tI,EAAA5pW,EAAApB,GACA,IAAAirW,EAAAD,GAAA,IAAA5pW,EACA,OAAA2xE,KAAAuoC,MAAA2hH,EAAA77N,GAAA,IAAApB,GAAAirW,EAAA,IAAA,IAvIAzqW,EAAAC,QAAA,SAAAqmG,EAAAhlG,GACAA,EAAAA,GAAA,GACA,IAAAmyE,SAAA6yB,EACA,GAAA,WAAA7yB,GAAA6yB,EAAA10B,OAAA,EACA,OAkBA,SAAAuwB,GAEA,IADAA,EAAAnvB,OAAAmvB,IACAvwB,OAAA,IACA,OAEA,IAAAqY,EAAA,mIAAAhY,KACAkwB,GAEA,IAAAlY,EACA,OAEA,IAAArpF,EAAAgrG,WAAA3hB,EAAA,IAEA,QADAA,EAAA,IAAA,MAAAlU,eAEA,IAAA,QACA,IAAA,OACA,IAAA,MACA,IAAA,KACA,IAAA,IACA,OAAAn1E,EAAA45G,EACA,IAAA,QACA,IAAA,OACA,IAAA,IACA,OAAA55G,EAAAwwN,EACA,IAAA,OACA,IAAA,MACA,IAAA,IACA,OAAAxwN,EAAA2pI,EACA,IAAA,QACA,IAAA,OACA,IAAA,MACA,IAAA,KACA,IAAA,IACA,OAAA3pI,EAAAwzK,EACA,IAAA,UACA,IAAA,SACA,IAAA,OACA,IAAA,MACA,IAAA,IACA,OAAAxzK,EAAAirF,EACA,IAAA,UACA,IAAA,SACA,IAAA,OACA,IAAA,MACA,IAAA,IACA,OAAAjrF,EAAAioF,EACA,IAAA,eACA,IAAA,cACA,IAAA,QACA,IAAA,OACA,IAAA,KACA,OAAAjoF,EACA,QACA,QAvEAg7E,CAAA0qB,GACA,GAAA,WAAA7yB,GAAA4+K,SAAA/rJ,GACA,OAAAhlG,EAAAopW,KA0GA,SAAAjuI,GACA,IAAA+tI,EAAAj4R,KAAAu0L,IAAArqC,GACA,GAAA+tI,GAAAjgO,EACA,OAAAggO,EAAA9tI,EAAA+tI,EAAAjgO,EAAA,OAEA,GAAAigO,GAAAp2L,EACA,OAAAm2L,EAAA9tI,EAAA+tI,EAAAp2L,EAAA,QAEA,GAAAo2L,GAAA3+Q,EACA,OAAA0+Q,EAAA9tI,EAAA+tI,EAAA3+Q,EAAA,UAEA,GAAA2+Q,GAAA3hR,EACA,OAAA0hR,EAAA9tI,EAAA+tI,EAAA3hR,EAAA,UAEA,OAAA4zI,EAAA,MAxHAkuI,CAAArkQ,GAiFA,SAAAm2H,GACA,IAAA+tI,EAAAj4R,KAAAu0L,IAAArqC,GACA,GAAA+tI,GAAAjgO,EACA,OAAAh4D,KAAAuoC,MAAA2hH,EAAAlyF,GAAA,IAEA,GAAAigO,GAAAp2L,EACA,OAAA7hG,KAAAuoC,MAAA2hH,EAAAroD,GAAA,IAEA,GAAAo2L,GAAA3+Q,EACA,OAAAtZ,KAAAuoC,MAAA2hH,EAAA5wI,GAAA,IAEA,GAAA2+Q,GAAA3hR,EACA,OAAAtW,KAAAuoC,MAAA2hH,EAAA5zI,GAAA,IAEA,OAAA4zI,EAAA,KA/FAmuI,CAAAtkQ,GAEA,MAAA,IAAAb,MACA,wDACAjxB,KAAAC,UAAA6xB,mCCnCA,aAEA,MAAArS,EAAA/zF,EAAA,cACAqsG,EAAArsG,EAAA,UAcAyjO,EAAA,CACAugG,QAdAhkU,EAAA,sBAeA2qW,QAdA3qW,EAAA,sBAoBA+zF,SAAAA,EACAsY,KAAAA,EACA+6H,MAAA/6H,EAAA+6H,MACAwjI,eAAAv+P,EAAAu+P,gBAGA9qW,EAAAC,QAAA0jO,+HC/BA,aAEA,MAAAzI,EAAAh7N,EAAA,QAEAqsG,EAAArsG,EAAA,UAcAD,EAAA0yK,QAAA,CAAAo4L,EAAAzrW,EAAA,OACA,IAAAs0E,EAAA24B,EAAAy+P,YAAAD,GAEA,MAAAn4P,EAAAtzG,EAAAmtF,MAAA,KAAA/R,OAAAsP,SACA,KAAA4oB,EAAAhhC,QAAA,CACA,MAAAjwE,EAAAixG,EAAAtB,QAEA,QAAAjvG,IAAAuxE,EAAAjyE,GAAA,CAEA,IAAA,MAAA4kF,KAAA3S,EAAAq3R,MACA,GAAA1kR,EAAAi8Q,OAAA7gW,EACA,MAAA,CACAtB,MAAAkmF,EAAAy5N,KACA+oD,cAAAn2P,EAAA37B,KAAA,MAMA,MAAA,IAAAwuB,MAAA,2BAAA9jG,MAKA,GADAiyE,EAAAA,EAAAjyE,GACAu5N,EAAAsM,MAAA5zJ,GACA,MAAA,CACAvzE,MAAAuzE,EACAm1R,cAAAn2P,EAAA37B,KAAA,MAKA,MAAA,CACA52E,MAAAuzE,EACAm1R,cAAA,KAWA9oW,EAAA07V,KAAA,UAAAoP,GACA,MAAAn3R,EAAA24B,EAAAy+P,YAAAD,QAGA,YACA,QACA,IAAA,IAAAG,EAAA,EAAAA,EAAAt3R,EAAAq3R,MAAAr5R,OAAAs5R,SACA,SAAAA,SACA,SAAAA,cACA,SAAAA,eACA,SAAAA,qECzEA,aAEA,MAAAC,OACAA,GACAjrW,EAAA,SACA2qW,EAAA3qW,EAAA,sBACAgkU,EAAAhkU,EAAA,uBACAkrW,iBAAAA,EAAAC,qBAAAA,GAAAnrW,EAAA,eACAorW,EAAAprW,EAAA,YAsDAF,EAAAC,QAAA,CACAqnO,MAAAgkI,EAAAhkI,MACAwjI,eAAAQ,EAAAR,eACAS,UApCA33R,GACAA,aAAAswP,EACAknC,EAAAx3R,GAEAy3R,EAAAz3R,EAAA04K,KAAA14K,EAAAq3R,OAiCAD,YAxBAxuJ,IACA,MAAAl2H,EAAA6kR,EAAAp6P,OAAAyrG,GACAgvJ,EAAAL,EAAAp8G,SAAAzoK,EAAA,CACA84H,UAAA,EACA2jC,QAAA,EACA6Q,MAAA9gL,OACA24R,SAAA,IAIAC,EAAAF,EAAAP,MAAAl0R,KAAAwP,GAEA,IAAAskR,EAAAtkR,EAAAi8Q,KAAAj8Q,EAAAolR,MAAAplR,EAAAy5N,QAGA3mJ,EAAA,MAAAmyM,EAAAl/G,KAAA,IAAAlnB,WAAA,GAAAomI,EAAAl/G,KAEA,OAAA,IAAA43E,EAAA7qK,EAAAqyM,EAAAlvJ,EAAAuuB,aAQAzQ,IA/CA,CAAAywI,EAAAa,IACAN,EAAAhxI,IAAAywI,EAAAa,oJCpBA,aAEA,IAAA39G,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,UAAAN,EAAAM,MAAA,QAAA,IAEA1mD,EAAAgkK,OAAA,WAmBA,SAAAA,EAAAh4R,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA2KA,OAlKA+3R,EAAAvhQ,UAAA01M,KAAA1xD,EAAAG,UAAA,IAQAo9G,EAAAvhQ,UAAAk4P,KAAA,GAQAqJ,EAAAvhQ,UAAAqhQ,MAAAr9G,EAAAqE,KAAArE,EAAAqE,KAAAW,SAAA,EAAA,GAAA,GAAA,EAWAu4G,EAAA57P,OAAA,SAAApkB,EAAAulI,GASA,OARAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAm0N,MAAA7/S,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAm0N,MACA,MAAAn0N,EAAA22Q,MAAAriW,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAApmJ,OAAAzc,EAAA22Q,MACA,MAAA32Q,EAAA8/Q,OAAAxrW,OAAAgnG,eAAAoD,KAAA1e,EAAA,UACAulI,EAAAs9B,OAAA,IAAA8B,OAAA3kK,EAAA8/Q,OACAv6I,GAcAy6I,EAAA96P,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAgkK,OACAlxP,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAm0N,KAAArlM,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAA22Q,KAAA7nP,EAAArS,SACA,MACA,KAAA,EACAzc,EAAA8/Q,MAAAhxP,EAAA61I,SACA,MACA,QACA71I,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAggR,EAAA/8G,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAgkK,OACA,OAAAthO,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAgkK,OAoBA,OAnBA,MAAAthO,EAAAy1K,OACA,iBAAAz1K,EAAAy1K,KACA1xD,EAAA99I,OAAAO,OAAAw5B,EAAAy1K,KAAAn0N,EAAAm0N,KAAA1xD,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAy1K,OAAA,GACAz1K,EAAAy1K,KAAApuO,SACAia,EAAAm0N,KAAAz1K,EAAAy1K,OAEA,MAAAz1K,EAAAi4N,OACA32Q,EAAA22Q,KAAAxvR,OAAAu3D,EAAAi4N,OAEA,MAAAj4N,EAAAohO,QACAr9G,EAAAqE,MACA9mK,EAAA8/Q,MAAAr9G,EAAAqE,KAAAm5G,UAAAvhO,EAAAohO,QAAAv4G,UAAA,EACA,iBAAA7oH,EAAAohO,MACA9/Q,EAAA8/Q,MAAA54R,SAAAw3D,EAAAohO,MAAA,IACA,iBAAAphO,EAAAohO,MACA9/Q,EAAA8/Q,MAAAphO,EAAAohO,MACA,iBAAAphO,EAAAohO,QACA9/Q,EAAA8/Q,MAAA,IAAAr9G,EAAAiB,SAAAhlH,EAAAohO,MAAA/wP,MAAA,EAAA2vB,EAAAohO,MAAA9wP,OAAA,GAAAlP,UAAA,KAEA9f,GAYAggR,EAAA98G,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GACA,GAAAsyC,EAAAuiC,SASA,GARAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAAy1K,KAAA,IAEAz1K,EAAAy1K,KAAA,GACAnjI,EAAAyoD,QAAA96H,QACA+/B,EAAAy1K,KAAA1xD,EAAAG,UAAAlkH,EAAAy1K,QAEAz1K,EAAAi4N,KAAA,GACAl0G,EAAAqE,KAAA,CACA,IAAA/xP,EAAA,IAAA0tP,EAAAqE,KAAA,EAAA,GAAA,GACApoH,EAAAohO,MAAA9uL,EAAA+2E,QAAA5gL,OAAApyE,EAAAmqG,WAAA8xE,EAAA+2E,QAAA9gL,OAAAlyE,EAAA+qG,WAAA/qG,OAEA2pI,EAAAohO,MAAA9uL,EAAA+2E,QAAA5gL,OAAA,IAAA,EAcA,OAZA,MAAA6Y,EAAAm0N,MAAAn0N,EAAAsb,eAAA,UACAojC,EAAAy1K,KAAAnjI,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAm0N,KAAA,EAAAn0N,EAAAm0N,KAAApuO,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAm0N,MAAAn0N,EAAAm0N,MAEA,MAAAn0N,EAAA22Q,MAAA32Q,EAAAsb,eAAA,UACAojC,EAAAi4N,KAAA32Q,EAAA22Q,MAEA,MAAA32Q,EAAA8/Q,OAAA9/Q,EAAAsb,eAAA,WACA,iBAAAtb,EAAA8/Q,MACAphO,EAAAohO,MAAA9uL,EAAA+2E,QAAA5gL,OAAAA,OAAA6Y,EAAA8/Q,OAAA9/Q,EAAA8/Q,MAEAphO,EAAAohO,MAAA9uL,EAAA+2E,QAAA5gL,OAAAs7K,EAAAqE,KAAAroJ,UAAAS,SAAAR,KAAA1e,EAAA8/Q,OAAA9uL,EAAA+2E,QAAA9gL,OAAA,IAAAw7K,EAAAiB,SAAA1jK,EAAA8/Q,MAAA/wP,MAAA,EAAA/uB,EAAA8/Q,MAAA9wP,OAAA,GAAAlP,UAAA,GAAA9f,EAAA8/Q,OAEAphO,GAUAshO,EAAAvhQ,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGA68G,EAlMA,GAqMAhkK,EAAAsjK,OAAA,WAkBA,SAAAA,EAAAt3R,GAEA,GADA84B,KAAAs+P,MAAA,GACAp3R,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAyJA,OAhJAq3R,EAAA7gQ,UAAA2gQ,MAAA38G,EAAA4D,WAQAi5G,EAAA7gQ,UAAAgiJ,KAAAgC,EAAAG,UAAA,IAWA08G,EAAAl7P,OAAA,SAAApkB,EAAAulI,GAKA,GAJAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAygK,MAAAnsP,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAygK,MACA,MAAAzgK,EAAAo/Q,OAAAp/Q,EAAAo/Q,MAAAr5R,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAAo/Q,MAAAr5R,SAAAkC,EACA+zH,EAAAgkK,OAAA57P,OAAApkB,EAAAo/Q,MAAAn3R,GAAAs9I,EAAAs9B,OAAA,IAAA6C,QAAAC,SAEA,OAAApgC,GAcA+5I,EAAAp6P,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAsjK,OACAxwP,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAo/Q,OAAAp/Q,EAAAo/Q,MAAAr5R,SACAia,EAAAo/Q,MAAA,IACAp/Q,EAAAo/Q,MAAAxzR,KAAAowH,EAAAgkK,OAAA96P,OAAA4J,EAAAA,EAAA+zI,WACA,MACA,KAAA,EACA7iK,EAAAygK,KAAA3xI,EAAA2qH,QACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAs/Q,EAAAr8G,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAsjK,OACA,OAAA5gO,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAsjK,OACA,GAAA5gO,EAAA0gO,MAAA,CACA,IAAAzgQ,MAAA/gB,QAAA8gD,EAAA0gO,OACA,MAAAv5P,UAAA,iCACA7lB,EAAAo/Q,MAAA,GACA,IAAA,IAAAn3R,EAAA,EAAAA,EAAAy2D,EAAA0gO,MAAAr5R,SAAAkC,EAAA,CACA,GAAA,iBAAAy2D,EAAA0gO,MAAAn3R,GACA,MAAA49B,UAAA,kCACA7lB,EAAAo/Q,MAAAn3R,GAAA+zH,EAAAgkK,OAAA/8G,WAAAvkH,EAAA0gO,MAAAn3R,KASA,OANA,MAAAy2D,EAAA+hH,OACA,iBAAA/hH,EAAA+hH,KACAgC,EAAA99I,OAAAO,OAAAw5B,EAAA+hH,KAAAzgK,EAAAygK,KAAAgC,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA+hH,OAAA,GACA/hH,EAAA+hH,KAAA16K,SACAia,EAAAygK,KAAA/hH,EAAA+hH,OAEAzgK,GAYAs/Q,EAAAp8G,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAgBA,IAfAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAA0gO,MAAA,IAEApuL,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA+hH,KAAA,IAEA/hH,EAAA+hH,KAAA,GACAzvE,EAAAyoD,QAAA96H,QACA+/B,EAAA+hH,KAAAgC,EAAAG,UAAAlkH,EAAA+hH,SAGA,MAAAzgK,EAAAygK,MAAAzgK,EAAAsb,eAAA,UACAojC,EAAA+hH,KAAAzvE,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAygK,KAAA,EAAAzgK,EAAAygK,KAAA16K,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAygK,MAAAzgK,EAAAygK,MAEAzgK,EAAAo/Q,OAAAp/Q,EAAAo/Q,MAAAr5R,OAAA,CACA24D,EAAA0gO,MAAA,GACA,IAAA,IAAAhtQ,EAAA,EAAAA,EAAApS,EAAAo/Q,MAAAr5R,SAAAqsB,EACAssC,EAAA0gO,MAAAhtQ,GAAA4pG,EAAAgkK,OAAA98G,SAAAljK,EAAAo/Q,MAAAhtQ,GAAA4+E,GAGA,OAAAtyC,GAUA4gO,EAAA7gQ,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAm8G,EAhLA,GAmLAnrW,EAAAC,QAAA4nM,0DCnYA,aAEA,MAAAqzB,EAAAh7N,EAAA,QACA6kO,EAAA7kO,EAAA,2BAyDAF,EAAAC,QApDA,MAMAuD,YAAAhE,EAAAoqG,EAAA0wH,GACA,IAAAA,EACA,MAAA,IAAA70H,MAAA,qCAMAkH,KAAA61P,KAAAhjW,GAAA,GACAmtG,KAAAg/P,MAAA/hQ,EACA+C,KAAAqzM,KAAA,IAAA9kF,EAAAZ,GAEAn6N,OAAAq5U,iBAAA7sO,KAAA,CACAo/P,SAAA,CAAA1rW,MAAA,KAAAyiO,UAAA,EAAAp3H,YAAA,KAIAloG,WACA,MAAA,YAAAmpG,KAAAqzM,KAAAt5E,kCAAA/5H,KAAA61P,gBAAA71P,KAAAg/P,SAGAnoW,SASA,OARAmpG,KAAAq/P,QACAr/P,KAAAq/P,MAAA7rW,OAAAc,OAAA,CACAzB,KAAAmtG,KAAA61P,KACA54P,KAAA+C,KAAAg/P,MACArxI,IAAA3tH,KAAAqzM,KAAAt5E,yBAIAvmO,OAAAiqG,OAAA,GAAAuC,KAAAq/P,OAMAC,mBACA,OAAA,MAAAt/P,KAAAo/P,WAIAp/P,KAAAo/P,SAAAhnI,EAAAp4H,KAAA61P,OAHA71P,KAAAo/P,uFCpDA,aAEA,MAAAG,EAAAhsW,EAAA,eACA2qW,EAAA3qW,EAAA,wBACAisW,gCAAAA,GAAAjsW,EAAA,qBACAkrW,iBAAAA,GAAAlrW,EAAA,gBACAksW,EAAAlsW,EAAA,eACAmsW,EAAAnsW,EAAA,aACAosW,EAAApsW,EAAA,YACA6kO,EAAA7kO,EAAA,2BACA8kO,EAAA9kO,EAAA,yBAqHAF,EAAAC,QA9GA,MAMAuD,YAAA61J,EAAAqyM,EAAA,GAAAa,EAAA,MAQA,GAPAlzM,IACAA,EAAA,IAAA+rE,WAAA,IAEA,iBAAA/rE,IACAA,EAAA0rE,EAAA1rE,MAGAA,aAAA+rE,YACA,MAAA,IAAA3/H,MAAA,kDAGA,GAAA,OAAA8mQ,GAAA,iBAAAA,EACA,MAAA,IAAA9mQ,MAAA,6CAGA,MAAA+mQ,EAAAd,EAAA30R,KAAAwP,GACAA,aAAAskR,EACAtkR,EACA4lR,EAAA5lR,KAEA2lR,EAAAM,GAEA7/P,KAAA2/I,KAAAjzF,EACA1sD,KAAAs+P,MAAAuB,EAEArsW,OAAAq5U,iBAAA7sO,KAAA,CACA8/P,gBAAA,CAAApsW,MAAAksW,EAAAzpI,UAAA,EAAAp3H,YAAA,GACAghQ,MAAA,CAAArsW,MAAA,KAAAyiO,UAAA,EAAAp3H,YAAA,KAIAloG,SASA,OARAmpG,KAAAq/P,QACAr/P,KAAAq/P,MAAA7rW,OAAAc,OAAA,CACAo4J,KAAA1sD,KAAA2/I,KACAo/G,MAAA/+P,KAAAs+P,MAAAl0R,KAAA2e,GAAAA,EAAA3B,WACA6V,KAAA+C,KAAA/C,QAIAzpG,OAAAiqG,OAAA,GAAAuC,KAAAq/P,OAGAxoW,WACA,MAAA,mBAAAwhO,EAAAr4H,KAAA2/I,KAAA,4BAAA3/I,KAAAs+P,MAAAr5R,iBAAA+6B,KAAA/C,QAGApmG,oBACAmpG,KAAA8/P,gBAAA,KACA9/P,KAAA+/P,MAAA,KAMAlpW,QAAA+iF,GAEA,OADAomB,KAAAggQ,oBACAN,EAAA1/P,KAAApmB,GAMA/iF,OAAA+iF,GAEA,OADAomB,KAAAggQ,oBACAL,EAAA3/P,KAAApmB,GAMA/iF,UAAAlC,GACA,OAAA8qW,EAAAz/P,KAAArrG,GAGAkC,YACA,MAAA05N,EAAAkuI,EAAAz+P,MAIA,OAFAA,KAAA8/P,gBAAAvvI,EAAAtrJ,OAEAsrJ,EAGAtzH,WACA,GAAA,MAAA+C,KAAA+/P,MAAA,CACA,IAAAH,EAEA,MAAAA,IACA5/P,KAAA8/P,gBAAA9/P,KAAA4+P,YAAA35R,OACA26R,EAAA5/P,KAAA8/P,iBAGA9/P,KAAA+/P,MAAA//P,KAAAs+P,MAAA54R,QAAA,CAAAyqD,EAAApnC,IAAAonC,EAAApnC,EAAAi2Q,OAAAY,GAGA,OAAA5/P,KAAA+/P,MAGA9iQ,SAAAA,GACA,MAAA,IAAAnE,MAAA,+SC3HA,aAEA,MAAA1M,EAAA74F,EAAA,UACA0sW,EAAA1sW,EAAA,uBAWA2sW,EAAA,CAAAr5R,EAAAyS,KACA,MAAA6mR,EAAAt5R,EAAAy4R,aACAc,EAAA9mR,EAAAgmR,aAEA,OAAAW,EAAAE,EAAAC,IAaA/sW,EAAAC,QAJAyrW,IACA3yQ,EAAAi0Q,QAAAtB,EAAAmB,wFCzBW1gQ,EAAQsiE,GACE,iBAAZxuK,QAA0C,IAAXD,EAAyBA,EAAOC,QAAUwuK,IAE/EtiE,EAAO8gQ,OAASx+L,KACjB9hE,MAAO,WAAc,iBAKjBsgQ,EAAS,SAAU1jQ,EAAKw8E,UACnB9zG,EAAKs3B,EAAIx3B,QAASg0G,IAiB3B,SAAA9zG,EAAcs3B,EAAKw8E,GACI,mBAAVA,IACTA,EAAO,SAAUvyG,EAAGyS,UACXjT,OAAOQ,GAAG05R,cAAcjnR,SAK/B8pB,EAAMxG,EAAI33B,UACVm+B,GAAO,SACFxG,UAMLizG,EAAAA,IAAahyG,MAAMuF,GACd6hL,EAAM,EAAGA,EAAM7hL,EAAK6hL,GAAO,EAAA,CAClCu7E,EAAK5jQ,EAAKw8E,EAAM6rG,EAAKp1E,OAEjBz0G,EAAMwB,EACVA,EAAMizG,EACNA,EAASz0G,SAGJwB,EAvCT0jQ,EAAOD,QAAU,SAAUzjQ,EAAKw8E,OAC1BxuG,EAAStF,EAAKs3B,EAAKw8E,UAInBxuG,IAAWgyB,GACb4jQ,EAAK51R,EAAQ,KAAMgyB,EAAI33B,OAAQ23B,GAG1BA,OAkCL4jQ,EAAO,SAAU5jQ,EAAKw8E,EAAM6rG,EAAKr6M,OAM/Bme,EAAGilB,EAAGj6G,EAENk3Q,EAAIw1F,EAPJr9P,EAAMxG,EAAI33B,OACVkC,EAAI,EAEJ8+N,EAAY,EAANhhB,MAOLl8L,EAAI,EAAGA,EAAIqa,EAAKra,GAAKk9M,MAExBlyS,GADAi6G,EAAIjlB,EAAIk8L,GACAA,EACJj3K,EAAI5K,IAAK4K,EAAI5K,GACbrvG,EAAIqvG,IAAKrvG,EAAIqvG,GAGjB6nK,EAAKliL,EACL03Q,EAAKzyP,OAGCi9J,EAAKj9J,GAAKyyP,EAAK1sW,EAGbqlL,EAAKx8E,EAAIquK,GAAKruK,EAAI6jQ,KAAQ,EAC5B71R,EAAOzD,KAAOy1B,EAAIquK,KAGlBrgM,EAAOzD,KAAOy1B,EAAI6jQ,aAIbx1F,EAAKj9J,EACZpjC,EAAOzD,KAAOy1B,EAAIquK,eAEXw1F,EAAK1sW,SACZ62E,EAAOzD,KAAOy1B,EAAI6jQ,cAUnBH,mCC1GT,aA8BAjtW,EAAAC,QAtBA,SAAAuzE,EAAAyS,GACA,IAAA,IAAAnS,EAAA,EAAAA,EAAAN,EAAAu3J,WAAAj3J,IAAA,CACA,GAAAN,EAAAM,GAAAmS,EAAAnS,GACA,OAAA,EAGA,GAAAN,EAAAM,GAAAmS,EAAAnS,GACA,OAAA,EAIA,OAAAN,EAAAu3J,WAAA9kJ,EAAA8kJ,WACA,EAGAv3J,EAAAu3J,WAAA9kJ,EAAA8kJ,YACA,EAGA,iCC3BA,aAEA,MAAA8/H,EAAA3qW,EAAA,aAaAF,EAAAC,QAAA,CACAksW,gCATA,SAAA5lR,GACA,OAAA,IAAAskR,EACAtkR,EAAAi8Q,MAAAj8Q,EAAA/mF,MAAA,GACA+mF,EAAAolR,OAAAplR,EAAA8mR,MAAA9mR,EAAAqjB,MAAA,EACArjB,EAAAy5N,MAAAz5N,EAAAy5B,MAAAz5B,EAAA00I,WAAA10I,EAAA+zI,wDCXA,aAEA,MAAA2rB,EAAA/lP,EAAA,uBACA2rW,OACAA,GACA3rW,EAAA,UAEAisW,gCACAA,GACAjsW,EAAA,mBAaAotW,EAAA15R,IACA,MAAA43R,EAAA,GAqBA,OAnBA53R,EAAA04K,MAAA14K,EAAA04K,KAAAvhB,WAAA,EACAygI,EAAAl/G,KAAA14K,EAAA04K,KAIAk/G,EAAAl/G,KAAA,KAGA14K,EAAAq3R,OAAAr3R,EAAAq3R,MAAAr5R,OAAA,EACA45R,EAAAP,MAAAr3R,EAAAq3R,MACAl0R,KAAAwP,IAAA,CACAy5N,KAAAz5N,EAAAy5N,KAAA16E,MACAk9H,KAAAj8Q,EAAAi8Q,KACAmJ,MAAAplR,EAAAolR,UAGAH,EAAAP,MAAA,KAGAO,GA0CA,SAAAv7P,EAAAs9P,GACA,MAAA79G,EAAAzJ,EAAAoI,OAAAxtP,SAEA,GAAA,MAAA0sW,EAAAtC,MACA,IAAA,IAAAn3R,EAAA,EAAAA,EAAAy5R,EAAAtC,MAAAr5R,OAAAkC,IACA+3R,EAAA57P,OAAAs9P,EAAAtC,MAAAn3R,GAAA47K,EAAAhB,OAAA,IAAA6C,QAAAC,SAQA,OAJA,MAAA+7G,EAAAjhH,MACAoD,EAAAhB,OAAA,IAAAppB,MAAAioI,EAAAjhH,MAGAoD,EAAAtpB,SA1BApmO,EAAAC,QAAA,CACAmrW,iBAtBAx3R,GACAq8B,EAAAq9P,EAAA15R,IAsBAy3R,qBAbA,CAAAhyM,EAAAqyM,EAAA,MACA,MAAA93R,EAAA,CACA04K,KAAAjzF,EACA4xM,MAAAS,EAAA30R,KAAAwP,GACA4lR,EAAA5lR,MAIA,OAAA0pB,EAAAq9P,EAAA15R,0GCtEA,aAEA,MAAAi3R,EAAA3qW,EAAA,uBACAorW,EAAAprW,EAAA,aAqBAF,EAAAC,QANAggJ,MAAArsE,EAAAtyE,EAAA,MACA,MAAA47N,EAAAtpJ,EAAA23R,YACAiC,QAAAlC,EAAAhxI,IAAA4C,EAAA57N,GACA,OAAA,IAAAupW,EAAAvpW,EAAA9B,MAAA,GAAAo0E,EAAAg2B,KAAA4jQ,mFCrBA,aAEA,MAAAtyI,EAAAh7N,EAAA,QACA66N,EAAA76N,EAAA,cACA86N,EAAA96N,EAAA,uBACA+6N,UAAAA,GAAAD,EAEAsM,EAAAvM,EAAA0yI,OACA3C,EAAA7vI,EAAA3qH,MAAA,YA4BAtwG,EAAAC,QAAA,CACAqnO,MAAAA,EACAwjI,eAAAA,EACAxwI,IAjBAr6E,MAAA8qN,EAAAa,EAAA,MACA,MAAAtqW,EAAA,CACAosW,WAAA,MAAA9B,EAAA8B,WAAA,EAAA9B,EAAA8B,WACArkC,QAAA,MAAAuiC,EAAAviC,QAAAyhC,EAAAc,EAAAviC,SAGA1hB,EAAA1sF,EAAAuN,MAAAlnO,EAAA+nU,SACArpN,QAAAg7G,EAAA+vI,EAAApjD,GACAviE,EAAArqB,EAAAopB,gBAAA7c,GAGA,OAFA,IAAApM,EAAA55N,EAAAosW,WAAAtoH,EAAAplI,+FC/BA,aAEA,MAAAksP,EAAAhsW,EAAA,eACA2qW,EAAA3qW,EAAA,uBA2CAF,EAAAC,QANA,CAAA2zE,EAAA2S,KACA,MAAAonR,EA3BA,CAAApnR,IACA,GAAAA,aAAAskR,EAGA,OAAAtkR,EAMA,KAAA,QAAAA,GACA,SAAAA,GACA,SAAAA,GACA,cAAAA,GACA,MAAA,IAAAkf,MAAA,sGAKA,OAAA,IAAAolQ,EAAAtkR,EAAAi8Q,MAAAj8Q,EAAA/mF,KAAA+mF,EAAAolR,OAAAplR,EAAAqjB,KAAArjB,EAAAy5N,MAAAz5N,EAAA00I,WAAA10I,EAAAy5B,MAAAz5B,EAAA+zI,MAQAszI,CAAArnR,GACA3S,EAAAq3R,MAAAxzR,KAAAk2R,GACAzB,EAAAt4R,EAAAq3R,uFC3CA,aAEA,MAAA/vI,EAAAh7N,EAAA,QACA4kO,EAAA5kO,EAAA,sBAuCAF,EAAAC,QA5BA,CAAA4tW,EAAAC,KACA,IAAA18N,EAAA,KAWA,GARA,iBAAA08N,EACA18N,EAAA7qD,GAAAA,EAAAi8Q,OAAAsL,EACAA,aAAA1oI,WACAh0F,EAAA7qD,GAAAu+I,EAAAv+I,EAAAy5N,KAAA16E,MAAAwoI,GACA5yI,EAAAsM,MAAAsmI,KACA18N,EAAA7qD,GAAAu+I,EAAAv+I,EAAAy5N,KAAA16E,MAAAwoI,EAAAxoI,SAGAl0F,EAYA,MAAA,IAAA3rC,MAAA,wCAZA,CACA,MAAAimQ,EAAAmC,EAAA5C,MACA,IAAA/4R,EAAA,EACA,KAAAA,EAAAw5R,EAAA95R,QAAA,CAEAw/D,EADAs6N,EAAAx5R,IAEAw5R,EAAAt0R,OAAAlF,EAAA,GAEAA,8EClCA,aAEA,MACAo6K,KAAAyhH,GACA7tW,EAAA,YACA0rP,EAAA1rP,EAAA,YAOAk+G,EAAA,CACA,MACA,YACA,OACA,WACA,UACA,0BAGA4vP,EAAA,CACA,YACA,0BAGAC,EAAAl7R,SAAA,OAAA,GACAm7R,EAAAn7R,SAAA,OAAA,GAKA,SAAAo7R,EAAA9mR,GACA,GAAA,MAAAA,EAIA,MAAA,iBAAAA,EACA,KAAAA,EAKA,OAFAA,EAAAA,EAAA0jB,YAEAtC,UAAA,EAAA,GAEA,KAAA11B,SAAAsU,EAAA,GAIA,KAAAtU,SAAAsU,EAAA,IAMA,SAAA+mR,EAAAzyQ,GACA,GAAA,MAAAA,EACA,OAIA,IAAA2uO,EA2BA,GAxBA,MAAA3uO,EAAA0yQ,OACA/jC,EAAA,CACA+jC,KAAA1yQ,EAAA0yQ,KACAC,MAAA3yQ,EAAA2yQ,QAKA,MAAA3yQ,EAAA4yQ,UACAjkC,EAAA,CACA+jC,KAAA1yQ,EAAA4yQ,QACAD,MAAA3yQ,EAAA6yQ,wBAKAhkQ,MAAA/gB,QAAAkS,KACA2uO,EAAA,CACA+jC,KAAA1yQ,EAAA,GACA2yQ,MAAA3yQ,EAAA,KAKAA,aAAA+O,KAAA,CACA,MAAA+xH,EAAA9gI,EAAAwN,UACAklQ,EAAA97R,KAAA6nC,MAAAqiH,EAAA,KAEA6tG,EAAA,CACA+jC,KAAAA,EACAC,MAAA,KAAA7xI,EAAA,IAAA4xI,IAmBA,GAAAluW,OAAAmqG,UAAAnD,eAAAoD,KAAA+/N,EAAA,QAAA,CAIA,GAAA,MAAAA,GAAA,MAAAA,EAAAgkC,QAAAhkC,EAAAgkC,MAAA,GAAAhkC,EAAAgkC,MAAA,WACA,MAAA1iH,EAAA,IAAAnmJ,MAAA,sDAAA,2BAGA,OAAA6kO,GAGA,MAAAh+E,EAMA9oP,iBAAAirW,GACA,MAAAnoR,EAAAynR,EAAAh9P,OAAA09P,GACA9oI,EAAAooI,EAAAh/G,SAAAzoK,EAAA,CACA84H,UAAA,EACA2jC,QAAA,EACA6Q,MAAA9gL,OACA24R,SAAA,IAGApyM,EAAA,IAAAizF,EAAA,CACA74K,KAAA2qC,EAAAunH,EAAA4mB,MACAlzF,KAAAssE,EAAA2mB,KACAoiH,WAAA/oI,EAAAgpI,WACAtnR,KAAAs+I,EAAAt+I,KACAijP,MAAA3kG,EAAA2kG,MACA,CACA+jC,KAAA1oI,EAAA2kG,MAAAikC,QACAD,MAAA3oI,EAAA2kG,MAAAkkC,4BAEAnsW,IAMA,OAFAg3J,EAAAu1M,cAAAjpI,EAAAt+I,MAAA,EAEAgyE,EAaA71J,YAAAlC,EAAA,CACAmyE,KAAA,SAEA,MAAAA,KACAA,EAAA4lF,KACAA,EAAAq1M,WACAA,EAAA1oD,SACAA,EAAA6oD,OACAA,EAAAvkC,MACAA,EAAAjjP,KACAA,GACA/lF,EAEA,GAAAmyE,IAAA2qC,EAAAhjC,SAAA3H,GACA,MAAAm4K,EAAA,IAAAnmJ,MAAA,SAAAhyB,EAAA,iBAAA,oBAGAk5B,KAAAl5B,KAAAA,GAAA,OACAk5B,KAAA0sD,KAAAA,EACA1sD,KAAAq5M,SAAAA,EACAr5M,KAAAkiQ,OAAAA,EAGAliQ,KAAA+hQ,WAAAA,GAAA,GACA/hQ,KAAAiiQ,cAAA,EACAjiQ,KAAAtlB,KAAA8mR,EAAA9mR,GAEAijP,IACA39N,KAAA29N,MAAA8jC,EAAA9jC,GAEA39N,KAAA29N,QAAA39N,KAAA29N,MAAAgkC,QACA3hQ,KAAA29N,MAAAgkC,MAAA,IAQAjnR,SAAAA,GACAslB,KAAA6iP,MAAA7iP,KAAAmiQ,cAAAZ,EAAAD,EAEA,MAAAc,EAAAZ,EAAA9mR,QAEAhlF,IAAA0sW,IACApiQ,KAAA6iP,MAAAuf,GAOA1nR,WACA,OAAAslB,KAAA6iP,MAGAhsV,cACA,OAAAwmF,QAAA2iB,KAAAl5B,MAAAu6R,EAAA5yR,SAAAuxB,KAAAl5B,OAMAjwE,aAAAomG,GACA+C,KAAA+hQ,WAAAj3R,KAAAmyB,GAMApmG,gBAAA0uE,GACAy6B,KAAA+hQ,WAAAt3R,OAAAlF,EAAA,GAMA1uE,WACA,GAAAmpG,KAAAmiQ,cAEA,OAAA,EAGA,IAAAhyO,EAAA,EASA,OARAnwB,KAAA+hQ,WAAA3tW,SAAA6oG,IACAkzB,GAAAlzB,KAGA+C,KAAA0sD,OACAv8B,GAAAnwB,KAAA0sD,KAAAznF,QAGAkrD,EAMAt5H,UACA,IAAAiwE,EAEA,OAAAk5B,KAAAl5B,MACA,IAAA,MAAAA,EAAAs6R,EAAAiB,SAAAC,IAAA,MACA,IAAA,YAAAx7R,EAAAs6R,EAAAiB,SAAAE,UAAA,MACA,IAAA,OAAAz7R,EAAAs6R,EAAAiB,SAAAG,KAAA,MACA,IAAA,WAAA17R,EAAAs6R,EAAAiB,SAAAI,SAAA,MACA,IAAA,UAAA37R,EAAAs6R,EAAAiB,SAAAK,QAAA,MACA,IAAA,yBAAA57R,EAAAs6R,EAAAiB,SAAAM,UAAA,MACA,QACA,MAAA1jH,EAAA,IAAAnmJ,MAAA,SAAAhyB,EAAA,iBAAA,oBAGA,IAMA4T,EAcAijP,EApBAjxK,EAAA1sD,KAAA0sD,KAsBA,GApBA1sD,KAAA0sD,MAAA1sD,KAAA0sD,KAAAznF,SACAynF,OAAAh3J,GAKA,MAAAsqG,KAAAtlB,OACAA,EAAA,WAAAslB,KAAAiiQ,eAAAT,EAAAxhQ,KAAAtlB,OAAA,GAEAA,IAAA4mR,GAAAthQ,KAAAmiQ,gBACAznR,OAAAhlF,GAGAglF,IAAA6mR,GAAAvhQ,KAAAmiQ,gBACAznR,OAAAhlF,IAMA,MAAAsqG,KAAA29N,MAAA,CACA,MAAAj2N,EAAA+5P,EAAAzhQ,KAAA29N,OAEAj2N,IACAi2N,EAAA,CACAikC,QAAAl6P,EAAAg6P,KACAG,sBAAAn6P,EAAAi6P,OAGA,IAAAhkC,EAAAkkC,8BACAlkC,EAAAkkC,uBAKA,MAAAe,EAAA,CACAhjH,KAAA94K,EACA64K,KAAAjzF,EACAm2M,SAAA7iQ,KAAAmiQ,mBAAAzsW,EAAAsqG,KAAA09N,WACAskC,WAAAhiQ,KAAA+hQ,WACA1oD,SAAAr5M,KAAAq5M,SACA6oD,OAAAliQ,KAAAkiQ,OACAxnR,KAAAA,EACAijP,MAAAA,GAGA,OAAAyjC,EAAA99P,OAAAs/P,GAAAnpI,UAIApmO,EAAAC,QAAA,CACAkkU,OAAA73E,EACA6hH,UAAAA,EACAC,WAAAA,sEC9UA,aAEA,IAAAngH,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,iBAAAN,EAAAM,MAAA,eAAA,IAEA1mD,EAAAykD,KAAA,WAwBA,SAAAA,EAAAz4K,GAEA,GADA84B,KAAAgiQ,WAAA,GACA96R,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA6WA,IACAk6K,EAAAjkJ,EAUA,OA/WAuiJ,EAAAhiJ,UAAAiiJ,KAAA,EAQAD,EAAAhiJ,UAAAgiJ,KAAAgC,EAAAG,UAAA,IAQAnC,EAAAhiJ,UAAAklQ,SAAAlhH,EAAAqE,KAAArE,EAAAqE,KAAAW,SAAA,EAAA,GAAA,GAAA,EAQAhH,EAAAhiJ,UAAAqkQ,WAAArgH,EAAA4D,WAQA5F,EAAAhiJ,UAAA07M,SAAA13D,EAAAqE,KAAArE,EAAAqE,KAAAW,SAAA,EAAA,GAAA,GAAA,EAQAhH,EAAAhiJ,UAAAukQ,OAAAvgH,EAAAqE,KAAArE,EAAAqE,KAAAW,SAAA,EAAA,GAAA,GAAA,EAQAhH,EAAAhiJ,UAAAjjB,KAAA,EAQAilK,EAAAhiJ,UAAAggO,MAAA,KAWAh+E,EAAAr8I,OAAA,SAAApkB,EAAAulI,GAQA,GAPAA,IACAA,EAAAg9B,EAAAvtP,UACAuwN,EAAAs9B,OAAA,GAAAC,MAAA9iK,EAAA0gK,MACA,MAAA1gK,EAAAygK,MAAAnsP,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAygK,MACA,MAAAzgK,EAAA2jR,UAAArvW,OAAAgnG,eAAAoD,KAAA1e,EAAA,aACAulI,EAAAs9B,OAAA,IAAA8B,OAAA3kK,EAAA2jR,UACA,MAAA3jR,EAAA8iR,YAAA9iR,EAAA8iR,WAAA/8R,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAA8iR,WAAA/8R,SAAAkC,EACAs9I,EAAAs9B,OAAA,IAAA8B,OAAA3kK,EAAA8iR,WAAA76R,IAUA,OARA,MAAA+X,EAAAm6N,UAAA7lT,OAAAgnG,eAAAoD,KAAA1e,EAAA,aACAulI,EAAAs9B,OAAA,IAAA8B,OAAA3kK,EAAAm6N,UACA,MAAAn6N,EAAAgjR,QAAA1uW,OAAAgnG,eAAAoD,KAAA1e,EAAA,WACAulI,EAAAs9B,OAAA,IAAA8B,OAAA3kK,EAAAgjR,QACA,MAAAhjR,EAAAxE,MAAAlnF,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAAA,OAAA7iK,EAAAxE,MACA,MAAAwE,EAAAy+O,OAAAnqU,OAAAgnG,eAAAoD,KAAA1e,EAAA,UACAg8G,EAAA4nK,SAAAx/P,OAAApkB,EAAAy+O,MAAAl5G,EAAAs9B,OAAA,IAAA6C,QAAAC,SACApgC,GAcAk7B,EAAAv7I,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAykD,KACA3xI,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAA0gK,KAAA5xI,EAAAg0I,QACA,MACA,KAAA,EACA9iK,EAAAygK,KAAA3xI,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAA2jR,SAAA70P,EAAA61I,SACA,MACA,KAAA,EAGA,GAFA3kK,EAAA8iR,YAAA9iR,EAAA8iR,WAAA/8R,SACAia,EAAA8iR,WAAA,IACA,IAAA,EAAAjjN,GAEA,IADA,IAAAm2C,EAAAlnF,EAAA+zI,SAAA/zI,EAAAp2B,IACAo2B,EAAAp2B,IAAAs9G,GACAh2G,EAAA8iR,WAAAl3R,KAAAkjC,EAAA61I,eAEA3kK,EAAA8iR,WAAAl3R,KAAAkjC,EAAA61I,UACA,MACA,KAAA,EACA3kK,EAAAm6N,SAAArrM,EAAA61I,SACA,MACA,KAAA,EACA3kK,EAAAgjR,OAAAl0P,EAAA61I,SACA,MACA,KAAA,EACA3kK,EAAAxE,KAAAszB,EAAA+zI,SACA,MACA,KAAA,EACA7iK,EAAAy+O,MAAAziI,EAAA4nK,SAAA1+P,OAAA4J,EAAAA,EAAA+zI,UACA,MACA,QACA/zI,EAAAi0I,SAAA,EAAAljG,IAIA,IAAA7/D,EAAAsb,eAAA,QACA,MAAAmnJ,EAAAO,cAAA,0BAAA,CAAAr/E,SAAA3jF,IACA,OAAAA,GAWAygK,EAAAwC,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAykD,KACA,OAAA/hH,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAykD,KACA,OAAA/hH,EAAAgiH,MACA,IAAA,MACA,KAAA,EACA1gK,EAAA0gK,KAAA,EACA,MACA,IAAA,YACA,KAAA,EACA1gK,EAAA0gK,KAAA,EACA,MACA,IAAA,OACA,KAAA,EACA1gK,EAAA0gK,KAAA,EACA,MACA,IAAA,WACA,KAAA,EACA1gK,EAAA0gK,KAAA,EACA,MACA,IAAA,UACA,KAAA,EACA1gK,EAAA0gK,KAAA,EACA,MACA,IAAA,YACA,KAAA,EACA1gK,EAAA0gK,KAAA,EAmBA,GAhBA,MAAAhiH,EAAA+hH,OACA,iBAAA/hH,EAAA+hH,KACAgC,EAAA99I,OAAAO,OAAAw5B,EAAA+hH,KAAAzgK,EAAAygK,KAAAgC,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA+hH,OAAA,GACA/hH,EAAA+hH,KAAA16K,SACAia,EAAAygK,KAAA/hH,EAAA+hH,OAEA,MAAA/hH,EAAAilO,WACAlhH,EAAAqE,MACA9mK,EAAA2jR,SAAAlhH,EAAAqE,KAAAm5G,UAAAvhO,EAAAilO,WAAAp8G,UAAA,EACA,iBAAA7oH,EAAAilO,SACA3jR,EAAA2jR,SAAAz8R,SAAAw3D,EAAAilO,SAAA,IACA,iBAAAjlO,EAAAilO,SACA3jR,EAAA2jR,SAAAjlO,EAAAilO,SACA,iBAAAjlO,EAAAilO,WACA3jR,EAAA2jR,SAAA,IAAAlhH,EAAAiB,SAAAhlH,EAAAilO,SAAA50P,MAAA,EAAA2vB,EAAAilO,SAAA30P,OAAA,GAAAlP,UAAA,KAEA4+B,EAAAokO,WAAA,CACA,IAAAnkQ,MAAA/gB,QAAA8gD,EAAAokO,YACA,MAAAj9P,UAAA,oCACA7lB,EAAA8iR,WAAA,GACA,IAAA,IAAA76R,EAAA,EAAAA,EAAAy2D,EAAAokO,WAAA/8R,SAAAkC,EACAw6K,EAAAqE,MACA9mK,EAAA8iR,WAAA76R,GAAAw6K,EAAAqE,KAAAm5G,UAAAvhO,EAAAokO,WAAA76R,KAAAs/K,UAAA,EACA,iBAAA7oH,EAAAokO,WAAA76R,GACA+X,EAAA8iR,WAAA76R,GAAAf,SAAAw3D,EAAAokO,WAAA76R,GAAA,IACA,iBAAAy2D,EAAAokO,WAAA76R,GACA+X,EAAA8iR,WAAA76R,GAAAy2D,EAAAokO,WAAA76R,GACA,iBAAAy2D,EAAAokO,WAAA76R,KACA+X,EAAA8iR,WAAA76R,GAAA,IAAAw6K,EAAAiB,SAAAhlH,EAAAokO,WAAA76R,GAAA8mC,MAAA,EAAA2vB,EAAAokO,WAAA76R,GAAA+mC,OAAA,GAAAlP,UAAA,IA0BA,GAvBA,MAAA4+B,EAAAy7K,WACA13D,EAAAqE,MACA9mK,EAAAm6N,SAAA13D,EAAAqE,KAAAm5G,UAAAvhO,EAAAy7K,WAAA5yD,UAAA,EACA,iBAAA7oH,EAAAy7K,SACAn6N,EAAAm6N,SAAAjzO,SAAAw3D,EAAAy7K,SAAA,IACA,iBAAAz7K,EAAAy7K,SACAn6N,EAAAm6N,SAAAz7K,EAAAy7K,SACA,iBAAAz7K,EAAAy7K,WACAn6N,EAAAm6N,SAAA,IAAA13D,EAAAiB,SAAAhlH,EAAAy7K,SAAAprM,MAAA,EAAA2vB,EAAAy7K,SAAAnrM,OAAA,GAAAlP,UAAA,KAEA,MAAA4+B,EAAAskO,SACAvgH,EAAAqE,MACA9mK,EAAAgjR,OAAAvgH,EAAAqE,KAAAm5G,UAAAvhO,EAAAskO,SAAAz7G,UAAA,EACA,iBAAA7oH,EAAAskO,OACAhjR,EAAAgjR,OAAA97R,SAAAw3D,EAAAskO,OAAA,IACA,iBAAAtkO,EAAAskO,OACAhjR,EAAAgjR,OAAAtkO,EAAAskO,OACA,iBAAAtkO,EAAAskO,SACAhjR,EAAAgjR,OAAA,IAAAvgH,EAAAiB,SAAAhlH,EAAAskO,OAAAj0P,MAAA,EAAA2vB,EAAAskO,OAAAh0P,OAAA,GAAAlP,UAAA,KAEA,MAAA4+B,EAAAljD,OACAwE,EAAAxE,KAAAkjD,EAAAljD,OAAA,GAEA,MAAAkjD,EAAA+/L,MAAA,CACA,GAAA,iBAAA//L,EAAA+/L,MACA,MAAA54N,UAAA,gCACA7lB,EAAAy+O,MAAAziI,EAAA4nK,SAAA3gH,WAAAvkH,EAAA+/L,OAEA,OAAAz+O,GAYAygK,EAAAyC,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAIA,IAHAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAAokO,WAAA,IAEA9xL,EAAAuiC,SAAA,CASA,GARA70E,EAAAgiH,KAAA1vE,EAAAp5C,QAAAzwD,OAAA,MAAA,EACA6pG,EAAAyoD,QAAAtyJ,OACAu3D,EAAA+hH,KAAA,IAEA/hH,EAAA+hH,KAAA,GACAzvE,EAAAyoD,QAAA96H,QACA+/B,EAAA+hH,KAAAgC,EAAAG,UAAAlkH,EAAA+hH,QAEAgC,EAAAqE,KAAA,CACA,IAAA/xP,EAAA,IAAA0tP,EAAAqE,KAAA,EAAA,GAAA,GACApoH,EAAAilO,SAAA3yL,EAAA+2E,QAAA5gL,OAAApyE,EAAAmqG,WAAA8xE,EAAA+2E,QAAA9gL,OAAAlyE,EAAA+qG,WAAA/qG,OAEA2pI,EAAAilO,SAAA3yL,EAAA+2E,QAAA5gL,OAAA,IAAA,EACA,GAAAs7K,EAAAqE,KAAA,CACA/xP,EAAA,IAAA0tP,EAAAqE,KAAA,EAAA,GAAA,GACApoH,EAAAy7K,SAAAnpI,EAAA+2E,QAAA5gL,OAAApyE,EAAAmqG,WAAA8xE,EAAA+2E,QAAA9gL,OAAAlyE,EAAA+qG,WAAA/qG,OAEA2pI,EAAAy7K,SAAAnpI,EAAA+2E,QAAA5gL,OAAA,IAAA,EACA,GAAAs7K,EAAAqE,KAAA,CACA/xP,EAAA,IAAA0tP,EAAAqE,KAAA,EAAA,GAAA,GACApoH,EAAAskO,OAAAhyL,EAAA+2E,QAAA5gL,OAAApyE,EAAAmqG,WAAA8xE,EAAA+2E,QAAA9gL,OAAAlyE,EAAA+qG,WAAA/qG,OAEA2pI,EAAAskO,OAAAhyL,EAAA+2E,QAAA5gL,OAAA,IAAA,EACAu3D,EAAAljD,KAAA,EACAkjD,EAAA+/L,MAAA,KAcA,GAZA,MAAAz+O,EAAA0gK,MAAA1gK,EAAAsb,eAAA,UACAojC,EAAAgiH,KAAA1vE,EAAAp5C,QAAAzwD,OAAA60H,EAAAykD,KAAA0iH,SAAAnjR,EAAA0gK,MAAA1gK,EAAA0gK,MAEA,MAAA1gK,EAAAygK,MAAAzgK,EAAAsb,eAAA,UACAojC,EAAA+hH,KAAAzvE,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAygK,KAAA,EAAAzgK,EAAAygK,KAAA16K,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAygK,MAAAzgK,EAAAygK,MAEA,MAAAzgK,EAAA2jR,UAAA3jR,EAAAsb,eAAA,cACA,iBAAAtb,EAAA2jR,SACAjlO,EAAAilO,SAAA3yL,EAAA+2E,QAAA5gL,OAAAA,OAAA6Y,EAAA2jR,UAAA3jR,EAAA2jR,SAEAjlO,EAAAilO,SAAA3yL,EAAA+2E,QAAA5gL,OAAAs7K,EAAAqE,KAAAroJ,UAAAS,SAAAR,KAAA1e,EAAA2jR,UAAA3yL,EAAA+2E,QAAA9gL,OAAA,IAAAw7K,EAAAiB,SAAA1jK,EAAA2jR,SAAA50P,MAAA,EAAA/uB,EAAA2jR,SAAA30P,OAAA,GAAAlP,UAAA,GAAA9f,EAAA2jR,UAEA3jR,EAAA8iR,YAAA9iR,EAAA8iR,WAAA/8R,OAAA,CACA24D,EAAAokO,WAAA,GACA,IAAA,IAAA1wQ,EAAA,EAAAA,EAAApS,EAAA8iR,WAAA/8R,SAAAqsB,EACA,iBAAApS,EAAA8iR,WAAA1wQ,GACAssC,EAAAokO,WAAA1wQ,GAAA4+E,EAAA+2E,QAAA5gL,OAAAA,OAAA6Y,EAAA8iR,WAAA1wQ,IAAApS,EAAA8iR,WAAA1wQ,GAEAssC,EAAAokO,WAAA1wQ,GAAA4+E,EAAA+2E,QAAA5gL,OAAAs7K,EAAAqE,KAAAroJ,UAAAS,SAAAR,KAAA1e,EAAA8iR,WAAA1wQ,IAAA4+E,EAAA+2E,QAAA9gL,OAAA,IAAAw7K,EAAAiB,SAAA1jK,EAAA8iR,WAAA1wQ,GAAA2c,MAAA,EAAA/uB,EAAA8iR,WAAA1wQ,GAAA4c,OAAA,GAAAlP,UAAA,GAAA9f,EAAA8iR,WAAA1wQ,GAqBA,OAlBA,MAAApS,EAAAm6N,UAAAn6N,EAAAsb,eAAA,cACA,iBAAAtb,EAAAm6N,SACAz7K,EAAAy7K,SAAAnpI,EAAA+2E,QAAA5gL,OAAAA,OAAA6Y,EAAAm6N,UAAAn6N,EAAAm6N,SAEAz7K,EAAAy7K,SAAAnpI,EAAA+2E,QAAA5gL,OAAAs7K,EAAAqE,KAAAroJ,UAAAS,SAAAR,KAAA1e,EAAAm6N,UAAAnpI,EAAA+2E,QAAA9gL,OAAA,IAAAw7K,EAAAiB,SAAA1jK,EAAAm6N,SAAAprM,MAAA,EAAA/uB,EAAAm6N,SAAAnrM,OAAA,GAAAlP,UAAA,GAAA9f,EAAAm6N,UAEA,MAAAn6N,EAAAgjR,QAAAhjR,EAAAsb,eAAA,YACA,iBAAAtb,EAAAgjR,OACAtkO,EAAAskO,OAAAhyL,EAAA+2E,QAAA5gL,OAAAA,OAAA6Y,EAAAgjR,QAAAhjR,EAAAgjR,OAEAtkO,EAAAskO,OAAAhyL,EAAA+2E,QAAA5gL,OAAAs7K,EAAAqE,KAAAroJ,UAAAS,SAAAR,KAAA1e,EAAAgjR,QAAAhyL,EAAA+2E,QAAA9gL,OAAA,IAAAw7K,EAAAiB,SAAA1jK,EAAAgjR,OAAAj0P,MAAA,EAAA/uB,EAAAgjR,OAAAh0P,OAAA,GAAAlP,UAAA,GAAA9f,EAAAgjR,QAEA,MAAAhjR,EAAAxE,MAAAwE,EAAAsb,eAAA,UACAojC,EAAAljD,KAAAwE,EAAAxE,MAEA,MAAAwE,EAAAy+O,OAAAz+O,EAAAsb,eAAA,WACAojC,EAAA+/L,MAAAziI,EAAA4nK,SAAA1gH,SAAAljK,EAAAy+O,MAAAztJ,IAEAtyC,GAUA+hH,EAAAhiJ,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAcA1C,EAAA0iH,UACAhhH,EAAA,IAAAjkJ,EAAA5pG,OAAAU,OAAAmtP,IACAA,EAAA,GAAA,OAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,aAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,QAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,YAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,WAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,aAAA,EACAjkJ,GAGAuiJ,EArZA,GAwZAzkD,EAAA4nK,SAAA,WAkBA,SAAAA,EAAA57R,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA+IA,OAtIA27R,EAAAnlQ,UAAAikQ,QAAAjgH,EAAAqE,KAAArE,EAAAqE,KAAAW,SAAA,EAAA,GAAA,GAAA,EAQAm8G,EAAAnlQ,UAAAkkQ,sBAAA,EAWAiB,EAAAx/P,OAAA,SAAApkB,EAAAulI,GAMA,OALAA,IACAA,EAAAg9B,EAAAvtP,UACAuwN,EAAAs9B,OAAA,GAAA+B,MAAA5kK,EAAA0iR,SACA,MAAA1iR,EAAA2iR,uBAAAruW,OAAAgnG,eAAAoD,KAAA1e,EAAA,0BACAulI,EAAAs9B,OAAA,IAAAmC,QAAAhlK,EAAA2iR,uBACAp9I,GAcAq+I,EAAA1+P,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAA4nK,SACA90P,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAA0iR,QAAA5zP,EAAA81I,QACA,MACA,KAAA,EACA5kK,EAAA2iR,sBAAA7zP,EAAAk2I,UACA,MACA,QACAl2I,EAAAi0I,SAAA,EAAAljG,IAIA,IAAA7/D,EAAAsb,eAAA,WACA,MAAAmnJ,EAAAO,cAAA,6BAAA,CAAAr/E,SAAA3jF,IACA,OAAAA,GAWA4jR,EAAA3gH,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAA4nK,SACA,OAAAllO,EACA,IAAA1+C,EAAA,IAAAg8G,EAAA4nK,SAcA,OAbA,MAAAllO,EAAAgkO,UACAjgH,EAAAqE,MACA9mK,EAAA0iR,QAAAjgH,EAAAqE,KAAAm5G,UAAAvhO,EAAAgkO,UAAAn7G,UAAA,EACA,iBAAA7oH,EAAAgkO,QACA1iR,EAAA0iR,QAAAx7R,SAAAw3D,EAAAgkO,QAAA,IACA,iBAAAhkO,EAAAgkO,QACA1iR,EAAA0iR,QAAAhkO,EAAAgkO,QACA,iBAAAhkO,EAAAgkO,UACA1iR,EAAA0iR,QAAA,IAAAjgH,EAAAiB,SAAAhlH,EAAAgkO,QAAA3zP,MAAA,EAAA2vB,EAAAgkO,QAAA1zP,OAAA,GAAAlP,aAEA,MAAA4+B,EAAAikO,wBACA3iR,EAAA2iR,sBAAAjkO,EAAAikO,wBAAA,GAEA3iR,GAYA4jR,EAAA1gH,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GACA,GAAAsyC,EAAAuiC,SAAA,CACA,GAAAkvC,EAAAqE,KAAA,CACA,IAAA/xP,EAAA,IAAA0tP,EAAAqE,KAAA,EAAA,GAAA,GACApoH,EAAAgkO,QAAA1xL,EAAA+2E,QAAA5gL,OAAApyE,EAAAmqG,WAAA8xE,EAAA+2E,QAAA9gL,OAAAlyE,EAAA+qG,WAAA/qG,OAEA2pI,EAAAgkO,QAAA1xL,EAAA+2E,QAAA5gL,OAAA,IAAA,EACAu3D,EAAAikO,sBAAA,EAWA,OATA,MAAA3iR,EAAA0iR,SAAA1iR,EAAAsb,eAAA,aACA,iBAAAtb,EAAA0iR,QACAhkO,EAAAgkO,QAAA1xL,EAAA+2E,QAAA5gL,OAAAA,OAAA6Y,EAAA0iR,SAAA1iR,EAAA0iR,QAEAhkO,EAAAgkO,QAAA1xL,EAAA+2E,QAAA5gL,OAAAs7K,EAAAqE,KAAAroJ,UAAAS,SAAAR,KAAA1e,EAAA0iR,SAAA1xL,EAAA+2E,QAAA9gL,OAAA,IAAAw7K,EAAAiB,SAAA1jK,EAAA0iR,QAAA3zP,MAAA,EAAA/uB,EAAA0iR,QAAA1zP,OAAA,GAAAlP,WAAA9f,EAAA0iR,SAEA,MAAA1iR,EAAA2iR,uBAAA3iR,EAAAsb,eAAA,2BACAojC,EAAAikO,sBAAA3iR,EAAA2iR,uBAEAjkO,GAUAklO,EAAAnlQ,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAygH,EArKA,GAwKA5nK,EAAAunK,SAAA,WAiBA,SAAAA,EAAAv7R,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA4GA,OAnGAs7R,EAAA9kQ,UAAAolQ,SAAA,GAWAN,EAAAn/P,OAAA,SAAApkB,EAAAulI,GAKA,OAJAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAA6jR,UAAAvvW,OAAAgnG,eAAAoD,KAAA1e,EAAA,aACAulI,EAAAs9B,OAAA,IAAApmJ,OAAAzc,EAAA6jR,UACAt+I,GAcAg+I,EAAAr+P,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAunK,SACAz0P,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAA6jR,SAAA/0P,EAAArS,SACA,MACA,QACAqS,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAujR,EAAAtgH,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAunK,SACA,OAAA7kO,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAunK,SAIA,OAHA,MAAA7kO,EAAAmlO,WACA7jR,EAAA6jR,SAAA18R,OAAAu3D,EAAAmlO,WAEA7jR,GAYAujR,EAAArgH,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAOA,OANAsyC,EAAAuiC,WACA70E,EAAAmlO,SAAA,IAEA,MAAA7jR,EAAA6jR,UAAA7jR,EAAAsb,eAAA,cACAojC,EAAAmlO,SAAA7jR,EAAA6jR,UAEAnlO,GAUA6kO,EAAA9kQ,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAogH,EAjIA,GAoIApvW,EAAAC,QAAA4nM,0DC/sBA,aAEA7nM,EAAAC,QAAA,qCCFA,aAEA,MAAA0vW,UAAAlqQ,MACAjiG,YAAA8iF,EAAA,mBACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,sBACAmtG,KAAA3qG,KAAA2tW,EAAA3tW,MAIA2tW,EAAA3tW,KAAA,sBACA/B,EAAA0vW,oBAAAA,EAEA,MAAAC,UAAAnqQ,MACAjiG,YAAA8iF,EAAA,0CACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,2BACAmtG,KAAA3qG,KAAAqiU,EAAAriU,MAIA4tW,EAAA5tW,KAAA,2BACA/B,EAAA2vW,yBAAAA,EAEA,MAAAvrC,UAAA5+N,MACAjiG,YAAA8iF,EAAA,4CACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,0BACAmtG,KAAA3qG,KAAAqiU,EAAAriU,MAIAqiU,EAAAriU,KAAA,0BACA/B,EAAAokU,wBAAAA,EAEA,MAAAwrC,UAAApqQ,MACAjiG,YAAA8iF,EAAA,eACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,kBACAmtG,KAAA3qG,KAAA6tW,EAAA7tW,MAIA6tW,EAAA7tW,KAAA,kBACA/B,EAAA4vW,gBAAAA,EAEA,MAAAC,UAAArqQ,MACAjiG,YAAA8iF,EAAA,iCACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,uBACAmtG,KAAA3qG,KAAA8tW,EAAA9tW,MAIA8tW,EAAA9tW,KAAA,uBACA/B,EAAA6vW,qBAAAA,EAEA,MAAAC,UAAAtqQ,MACAjiG,YAAA8iF,EAAA,iCACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,sBACAmtG,KAAA3qG,KAAA+tW,EAAA/tW,MAIA+tW,EAAA/tW,KAAA,sBACA/B,EAAA8vW,oBAAAA,EAEA,MAAAC,UAAAvqQ,MACAjiG,YAAA8iF,EAAA,eACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,kBACAmtG,KAAA3qG,KAAAguW,EAAAhuW,MAIAguW,EAAAhuW,KAAA,kBACA/B,EAAA+vW,gBAAAA,gCC7EA,aAEA,MAAA93G,EAAAh4P,EAAA,oBAeAF,EAAAC,QAAA,EAAA4mU,QAAAA,EAAAC,QAAAA,EAAAz+F,OAAAA,EAAAu+F,SAAAA,EAAAD,KAAAA,EAAAS,KAAAA,EAAAL,aAAAA,EAAAa,WAAAA,EAAAnB,MAAAA,EAAAnlU,QAAAA,KAIA2+I,UACA,MAAA8nL,QAAAA,EAAAO,OAAAA,SAAApwE,EAAAv2K,MAAAklP,EAAA,CACAx+F,OAAAA,EACAs+F,KAAAA,EACAF,MAAAA,EACAnlU,QAAAA,IAGAylU,EAAAkpC,YAAAloC,SAEAr1J,QAAA2gD,IAAA,CACA+zG,EAAA8oC,YAAA,CAAAtpC,SAAAA,EAAA0B,OAAAA,EAAAjgG,OAAAA,EAAAs+F,KAAAA,IACAG,EAAAnlP,QACAimP,EAAAjmP,mEClCA,aAEA,MAAAkuR,gBAAAA,EAAAC,qBAAAA,EAAAC,oBAAAA,GAAA7vW,EAAA,cACA4pU,YAAAA,GAAA5pU,EAAA,YAuCA,MAAAg4P,EAYA10P,eAAAm+E,MAAAA,EAAAurD,KAAAA,IACA,OAAA,IAAAgrH,EAAAv2K,EAAAurD,GAYA1pI,mBAAA2sW,EAAA7uW,GACA,MAAAm0H,MAAAA,EAAA08D,SAAAA,GAAAg+K,EACA,OAAA16O,EAAA6yF,QAQA,IAAA,UACA,IACA,MAAAtG,EAAA7vB,EAAA7wL,GACA6uW,EAAA16O,MAAA,CAAA6yF,OAAA,WAAAgF,MAAAtL,GAGA,MAAAzqI,QAAAyqI,EAEA,OADAmuJ,EAAA16O,MAAA,CAAA6yF,OAAA,UAAAjoN,MAAAk3E,GACAA,EAGA,MAAA2E,GAEA,MADAi0R,EAAA16O,MAAA,CAAA6yF,OAAA,WACApsI,EAGA,IAAA,WACA,MAAA,IAAA4zR,EAEA,IAAA,UACA,MAAA,IAAAC,EAIA,IAAA,WAEA,aADAt6O,EAAA63F,YACA4qC,EAAAv2K,MAAAwuR,EAAA7uW,GAEA,QACA,OAAA42P,EAAAk4G,MAAAD,IAeA3sW,kBAAA2sW,GACA,MAAA16O,MAAAA,EAAA+8D,WAAAA,GAAA29K,EACA,OAAA16O,EAAA6yF,QAEA,IAAA,UACA,MAIA,IAAA,WAEA,UAAA7yF,EAAA63F,MAAA,MAAAxlI,IACA,aAAAowK,EAAAhrH,KAAAijO,GAGA,IAAA,WACA,aAAA16O,EAAA63F,MAEA,IAAA,UACA96B,SACAA,EAAA/8D,EAAAp1H,OAEA8vW,EAAA16O,MAAA,CAAA6yF,OAAA,WACA,MAEA,QACA4vC,EAAAk4G,MAAA36O,IAUAjyH,YAAAiyH,MAAAA,IACA,OAAAA,EAAA6yF,QACA,IAAA,UACA,OAAA7yF,EAAAp1H,MACA,QACA,OAAA,MAcAmD,kBAAAiyH,MAAAA,GAAAn0H,GACA,OAAAm0H,EAAA6yF,QACA,IAAA,UACA,OAAA7yF,EAAAp1H,MACA,IAAA,WACA,aAAAypU,EAAAr0M,EAAA63F,MAAAhsN,GACA,QACA,MAAA,IAAAuuW,GAUArsW,cAAAiyH,MAAAA,IACA,MAAA6yF,EAAA9zI,KAAAC,UAAA,CAAA6zI,OAAA7yF,EAAA6yF,SACA,MAAA4jB,WAAA,4BAAA5jB,8DAWA9kN,YAAA2uL,EAAAK,GACA7lF,KAAAwlF,SAAAA,EACAxlF,KAAA6lF,WAAAA,EAQA7lF,KAAA8oB,MAAA,CAAA6yF,OAAA,WAYA9kN,UAAAlC,GACA,aAAA42P,EAAAt4P,IAAA+sG,KAAArrG,GAMAkC,MACA,OAAA00P,EAAAmwE,IAAA17N,OAGA3sG,EAAAC,QAAAi4P,sEC/OA,aAEA,MAAAA,EAAAh4P,EAAA,oBAWAF,EAAAC,QAAA,EAAA4mU,QAAAA,EAAAC,QAAAA,EAAAC,aAAAA,EAAAK,KAAAA,EAAAT,KAAAA,EAAAiB,WAAAA,KAIA3nL,UACA8mL,EAAAspC,sBACA39L,QAAA2gD,IAAA,CACAyzG,EAAA55L,OACAk6L,EAAAl6L,OACA06L,EAAA16L,OACAgrH,EAAAhrH,KAAA25L,GACAF,EAAAh6O,mECxBA,aAGA,MAAAk5J,EAAA3lP,EAAA,yBACAupU,EAAAvpU,EAAA,2CAeAF,EAAAC,QAAA,IAcAwpU,GAVAxpL,MAAAqwN,EAAAhvW,EAAA,CAAAivW,WAAA,MACA,GAAA,iBAAAD,EACA,MAAA,IAAA7qQ,MAAA,8CAKA,OAFA6qQ,EAlBA,SAAAA,GAMA,OAHAA,EAAA59R,SAAA,UACA49R,EAAAA,EAAAzqR,QAAA,QAAA,cAEAyqR,EAYAE,CAAAF,GAEAzqH,EAAAyqH,EAAAhvW,qHC7BA,aAEA,MAAAmvW,EAAAvwW,EAAA,kBACAJ,QAAA4wW,GAAAxwW,EAAA,WACAi7N,EAAAj7N,EAAA,uBAGAywF,EAAA,IAAA8/Q,EAAA,KAQAE,EAAA,IAAAD,EAAA,CAAAE,YAAA,IAKAn5I,EAAA6D,IACA,GAAAA,EAAAu1I,KAAA,OAAAv1I,EAAAu1I,KACA,MAAA,IAAAprQ,MAAA61H,EAAAw1I,UAOA9wW,EAAAC,QAAAggJ,MAAA8wN,EAAArjM,IAMAztB,OAAA8wN,EAAArjM,EAAA,MAEA,MAAAizC,EAAA,IAAAmb,gBAAApuD,GACAizC,EAAAvyH,IAAA,MAAA2iR,GAGA,MAAA17J,EAAAsL,EAAA51G,WACA,IAAA2iE,EAAAsjM,SAAArgR,EAAAjF,IAAA2pH,GAAA,CACA,MAAAimB,EAAA3qI,EAAAxC,IAAAknH,GACA,OAAAoiB,EAAA6D,GAIA,MAAAA,QAAAq1I,EAAAhlR,KAAAs0D,UAGA,MAAAvnE,QAAAyiJ,EAAAhtI,IAAA,6BAAA,CAAAwyH,aAAAA,IACAtL,EAAA,IAAA+jB,IAAA1gJ,EAAA65B,KAAAqG,OAAA7mC,MAAA,GACAuqJ,QAAA5jJ,EAAA4jJ,OAGA,OAFA3rI,EAAAvC,IAAAinH,EAAAinB,EA3CA,KA6CAA,KAEA,OAAA7E,EAAA6D,IAGA21I,CAAAF,EAAArjM,wGC9DA,aAIA,MAAAwjM,EAAAhxW,EAAA,WAqFAF,EAAAC,QA1EA,MAMAuD,YAAA2tW,GACAxkQ,KAAAykQ,IAAAF,EAAAC,GAUA3tW,IAAA7B,GACA,MAAAtB,EAAAssG,KAAAykQ,IAAAjjR,IAAAxsF,GACA,GAAAtB,EACA,OAAAA,EAAA,QAAAA,EAAAgxW,OAAA3mQ,KAAAunE,WACAtlE,KAAAykQ,IAAA/mQ,OAAA1oG,GAGAtB,EAAAA,MAaAmD,IAAA7B,EAAAtB,EAAAixW,GACA3kQ,KAAAykQ,IAAAhjR,IAAAzsF,EAAA,CAAAtB,MAAAA,EAAAgxW,OAAA3mQ,KAAAunE,MAAAq/L,IASA9tW,IAAA7B,GAEA,QADAgrG,KAAAxe,IAAAxsF,GAYA6B,OAAA7B,GACAgrG,KAAAykQ,IAAA/mQ,OAAA1oG,GAQA6B,QACAmpG,KAAAykQ,IAAAr3M,uDCrFA/5J,EAAAC,QAAA,SAAAqyE,GAEA,IAAAA,EAAA,MAAAmzB,MAAA,iEAEA,IAAAmE,EAAA,EAAAjZ,EAAAxwF,OAAAU,OAAA,MAAAi5N,EAAA35N,OAAAU,OAAA,MAEA,SAAAyhK,EAAA3gK,EAAAtB,GACAswF,EAAAhvF,GAAAtB,IACAupG,GACAt3B,IACAs3B,EAAA,EACAkwH,EAAAnpI,EACAA,EAAAxwF,OAAAU,OAAA,OAIA,MAAA,CACA6qF,IAAA,SAAA/pF,GACA,YAAAU,IAAAsuF,EAAAhvF,SAAAU,IAAAy3N,EAAAn4N,IAEA0oG,OAAA,SAAA1oG,QACAU,IAAAsuF,EAAAhvF,KACAgvF,EAAAhvF,QAAAU,QACAA,IAAAy3N,EAAAn4N,KACAm4N,EAAAn4N,QAAAU,IAEA8rF,IAAA,SAAAxsF,GACA,IAAA8vK,EAAA9gF,EAAAhvF,GACA,YAAAU,IAAAovK,EAAAA,OACApvK,KAAAovK,EAAAqoD,EAAAn4N,KACA2gK,EAAA3gK,EAAA8vK,GACAA,QAFA,GAKArjF,IAAA,SAAAzsF,EAAAtB,QACAgC,IAAAsuF,EAAAhvF,GAAAgvF,EAAAhvF,GAAAtB,EACAiiK,EAAA3gK,EAAAtB,IAEA05J,MAAA,WACAppE,EAAAxwF,OAAAU,OAAA,MACAi5N,EAAA35N,OAAAU,OAAA,uCCxCA,aACAV,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACA,MAAA2xP,EAAA9xP,EAAA,iBACAqxW,EAAArxW,EAAA,aACAsxW,EAAAtxW,EAAA,oBAEAs8H,EAAA,OACAi1O,EAAA,IAAAF,EAAA71I,aA+QAz7N,EAAAH,QA3QA,cAAAkyP,EACAxuP,YAAAlC,GACA,IAAA0tU,EAAAC,EAAA/nJ,EAAAH,EASA,GARA70D,QACAvlB,KAAA+kQ,eAAA,EACA/kQ,KAAAglQ,aAAA,EACAhlQ,KAAAilQ,cAAA,EACAjlQ,KAAAklQ,cAAAr1O,EACA7vB,KAAAmlQ,aAAAt1O,IAGA,iBADAl7H,EAAAnB,OAAAiqG,OAAA,CAAA2nQ,2BAAA,EAAAC,YAAAh5P,EAAAA,EAAAi5P,SAAA,EAAArB,YAAA53P,EAAAA,EAAAk5P,WAAA,EAAAC,WAAAX,EAAA1xW,SAAAwB,IACA0wW,aAAA1wW,EAAA0wW,aAAA,GACA,MAAA,IAAAtgQ,UAAA,gEAAA,QAAAu9N,EAAA,QAAAD,EAAA1tU,EAAA0wW,mBAAA,IAAAhjC,OAAA,EAAAA,EAAAjkO,kBAAA,IAAAkkO,EAAAA,EAAA,gBAAA3tU,EAAA0wW,gBAEA,QAAA3vW,IAAAf,EAAA2wW,YAAAn/R,OAAAu/K,SAAA/wP,EAAA2wW,WAAA3wW,EAAA2wW,UAAA,GACA,MAAA,IAAAvgQ,UAAA,2DAAA,QAAAq1E,EAAA,QAAAG,EAAA5lL,EAAA2wW,gBAAA,IAAA/qL,OAAA,EAAAA,EAAAn8E,kBAAA,IAAAg8E,EAAAA,EAAA,gBAAAzlL,EAAA2wW,aAEAtlQ,KAAAylQ,2BAAA9wW,EAAAywW,0BACAplQ,KAAA0lQ,mBAAA/wW,EAAA0wW,cAAAh5P,EAAAA,GAAA,IAAA13G,EAAA2wW,SACAtlQ,KAAA2lQ,aAAAhxW,EAAA0wW,YACArlQ,KAAA4lQ,UAAAjxW,EAAA2wW,SACAtlQ,KAAA6lQ,OAAA,IAAAlxW,EAAA6wW,WACAxlQ,KAAA8lQ,YAAAnxW,EAAA6wW,WACAxlQ,KAAAikQ,YAAAtvW,EAAAsvW,YACAjkQ,KAAA+lQ,SAAApxW,EAAAm2K,QACA9qE,KAAAgmQ,iBAAA,IAAArxW,EAAAsxW,eACAjmQ,KAAAkmQ,WAAA,IAAAvxW,EAAA4wW,UAEAY,gCACA,OAAAnmQ,KAAA0lQ,oBAAA1lQ,KAAA+kQ,eAAA/kQ,KAAA2lQ,aAEAS,kCACA,OAAApmQ,KAAAilQ,cAAAjlQ,KAAAqmQ,aAEAxvW,QACAmpG,KAAAilQ,gBACAjlQ,KAAAsmQ,qBACAtmQ,KAAA64E,KAAA,QAEAhiL,mBACAmpG,KAAAklQ,gBACAllQ,KAAAklQ,cAAAr1O,EACA,IAAA7vB,KAAAilQ,gBACAjlQ,KAAAmlQ,eACAnlQ,KAAAmlQ,aAAAt1O,EACA7vB,KAAA64E,KAAA,SAGAhiL,oBACAmpG,KAAAumQ,cACAvmQ,KAAAwmQ,8BACAxmQ,KAAAymQ,gBAAA/wW,EAEAmB,oBACA,MAAAyuK,EAAAvnE,KAAAunE,MACA,QAAA5vK,IAAAsqG,KAAA0mQ,YAAA,CACA,MAAA3nK,EAAA/+F,KAAAglQ,aAAA1/L,EACA,KAAAy5B,EAAA,GAYA,YALArpM,IAAAsqG,KAAAymQ,aACAzmQ,KAAAymQ,WAAA57L,YAAA,KACA7qE,KAAA2mQ,sBACA5nK,KAEA,EATA/+F,KAAA+kQ,eAAA/kQ,KAAA,2BAAAA,KAAAilQ,cAAA,EAYA,OAAA,EAEApuW,qBACA,GAAA,IAAAmpG,KAAA6lQ,OAAA5oQ,KAQA,OALA+C,KAAA0mQ,aACAE,cAAA5mQ,KAAA0mQ,aAEA1mQ,KAAA0mQ,iBAAAhxW,EACAsqG,KAAA6mQ,oBACA,EAEA,IAAA7mQ,KAAAkmQ,UAAA,CACA,MAAAY,GAAA9mQ,KAAA+mQ,oBACA,GAAA/mQ,KAAAmmQ,2BAAAnmQ,KAAAomQ,4BAAA,CACA,MAAAtuL,EAAA93E,KAAA6lQ,OAAAmB,UACA,QAAAlvL,IAGA93E,KAAA64E,KAAA,UACAf,IACAgvL,GACA9mQ,KAAAwmQ,+BAEA,IAGA,OAAA,EAEA3vW,8BACAmpG,KAAA0lQ,yBAAAhwW,IAAAsqG,KAAA0mQ,cAGA1mQ,KAAA0mQ,YAAAO,aAAA,KACAjnQ,KAAAumQ,gBACAvmQ,KAAA4lQ,WACA5lQ,KAAAglQ,aAAAjnQ,KAAAunE,MAAAtlE,KAAA4lQ,WAEA/uW,cACA,IAAAmpG,KAAA+kQ,gBAAA,IAAA/kQ,KAAAilQ,eAAAjlQ,KAAA0mQ,cACAE,cAAA5mQ,KAAA0mQ,aACA1mQ,KAAA0mQ,iBAAAhxW,GAEAsqG,KAAA+kQ,eAAA/kQ,KAAAylQ,2BAAAzlQ,KAAAilQ,cAAA,EACAjlQ,KAAAknQ,gBAKArwW,gBAEA,KAAAmpG,KAAAsmQ,wBAEArC,kBACA,OAAAjkQ,KAAAqmQ,aAEApC,gBAAAkD,GACA,KAAA,iBAAAA,GAAAA,GAAA,GACA,MAAA,IAAApiQ,UAAA,gEAAAoiQ,eAAAA,MAEAnnQ,KAAAqmQ,aAAAc,EACAnnQ,KAAAknQ,gBAKArwW,UAAA+tF,EAAAjwF,EAAA,IACA,OAAA,IAAAoxK,SAAA,CAAAC,EAAAu5B,KAkBAv/F,KAAA6lQ,OAAAuB,SAjBA9zN,UACAtzC,KAAAilQ,gBACAjlQ,KAAA+kQ,iBACA,IACA,MAAAsC,OAAA3xW,IAAAsqG,KAAA+lQ,eAAArwW,IAAAf,EAAAm2K,QAAAlmF,IAAAggR,EAAAzxW,QAAA4yK,QAAAC,QAAAphF,UAAAlvF,IAAAf,EAAAm2K,QAAA9qE,KAAA+lQ,SAAApxW,EAAAm2K,SAAA,WACAp1K,IAAAf,EAAAsxW,eAAAjmQ,KAAAgmQ,gBAAArxW,EAAAsxW,iBACA1mK,EAAAulK,MAIA9+L,QAAAqhM,GAEA,MAAA93R,GACAgwH,EAAAhwH,GAEAywB,KAAAsnQ,UAEA3yW,GACAqrG,KAAAsmQ,qBACAtmQ,KAAA64E,KAAA,UAQAhiL,aAAA2sH,EAAA7uH,GACA,OAAAoxK,QAAA2gD,IAAAljG,EAAAp5C,KAAAkpE,MAAAi0N,GAAAvnQ,KAAAhhB,IAAAuoR,EAAA5yW,MAKAkC,QACA,OAAAmpG,KAAAkmQ,WAGAlmQ,KAAAkmQ,WAAA,EACAlmQ,KAAAknQ,gBACAlnQ,MAJAA,KASAnpG,QACAmpG,KAAAkmQ,WAAA,EAKArvW,QACAmpG,KAAA6lQ,OAAA,IAAA7lQ,KAAA8lQ,YAOAjvW,gBAEA,GAAA,IAAAmpG,KAAA6lQ,OAAA5oQ,KAGA,OAAA,IAAA8oE,SAAAC,IACA,MAAAwhM,EAAAxnQ,KAAAklQ,cACAllQ,KAAAklQ,cAAA,KACAsC,IACAxhM,QASAnvK,eAEA,GAAA,IAAAmpG,KAAAilQ,eAAA,IAAAjlQ,KAAA6lQ,OAAA5oQ,KAGA,OAAA,IAAA8oE,SAAAC,IACA,MAAAwhM,EAAAxnQ,KAAAmlQ,aACAnlQ,KAAAmlQ,aAAA,KACAqC,IACAxhM,QAOA/oE,WACA,OAAA+C,KAAA6lQ,OAAA5oQ,KAOApmG,OAAAlC,GAEA,OAAAqrG,KAAA6lQ,OAAA93R,OAAAp5E,GAAAswE,OAKAkiL,cACA,OAAAnnJ,KAAAilQ,cAKA59B,eACA,OAAArnO,KAAAkmQ,UAEAp7L,cACA,OAAA9qE,KAAA+lQ,SAKAj7L,YAAA28L,GACAznQ,KAAA+lQ,SAAA0B,sGCnRA,aAEA,IAAA1oR,EAAAvrF,OAAAmqG,UAAAnD,eACA7P,EAAA,IASA,SAAA+8Q,KA4BA,SAAAC,EAAA/iR,EAAApb,EAAAo9I,GACA5mH,KAAApb,GAAAA,EACAob,KAAAx2B,QAAAA,EACAw2B,KAAA4mH,KAAAA,IAAA,EAcA,SAAA0O,EAAAuuG,EAAA36P,EAAA0b,EAAApb,EAAAo9I,GACA,GAAA,mBAAAhiI,EACA,MAAA,IAAAmgB,UAAA,mCAGA,IAAA+nG,EAAA,IAAA66J,EAAA/iR,EAAApb,GAAAq6P,EAAAj9G,GACA6gC,EAAA98J,EAAAA,EAAAzhB,EAAAA,EAMA,OAJA26P,EAAAoB,QAAAx9E,GACAo8E,EAAAoB,QAAAx9E,GAAA7iK,GACAi/O,EAAAoB,QAAAx9E,GAAA,CAAAo8E,EAAAoB,QAAAx9E,GAAA36C,GADA+2H,EAAAoB,QAAAx9E,GAAA38K,KAAAgiI,IADA+2H,EAAAoB,QAAAx9E,GAAA36C,EAAA+2H,EAAAsG,gBAIAtG,EAUA,SAAA+jC,EAAA/jC,EAAAp8E,GACA,KAAAo8E,EAAAsG,aAAAtG,EAAAoB,QAAA,IAAAyiC,SACA7jC,EAAAoB,QAAAx9E,GAUA,SAAApC,IACArlJ,KAAAilO,QAAA,IAAAyiC,EACA1nQ,KAAAmqO,aAAA,EAxEA32U,OAAAU,SACAwzW,EAAA/pQ,UAAAnqG,OAAAU,OAAA,OAMA,IAAAwzW,GAAAvkJ,YAAAx4H,GAAA,IA2EA06J,EAAA1nJ,UAAAmuO,WAAA,WACA,IACApB,EACA73U,EAFA8wG,EAAA,GAIA,GAAA,IAAA3D,KAAAmqO,aAAA,OAAAxmO,EAEA,IAAA9wG,KAAA63U,EAAA1qO,KAAAilO,QACAlmP,EAAA6e,KAAA8sO,EAAA73U,IAAA8wG,EAAA74B,KAAA6f,EAAA93F,EAAAuyE,MAAA,GAAAvyE,GAGA,OAAAW,OAAA+lG,sBACAoK,EAAA9R,OAAAr+F,OAAA+lG,sBAAAmxO,IAGA/mO,GAUA0hJ,EAAA1nJ,UAAA8uG,UAAA,SAAAvjI,GACA,IAAAu+K,EAAA98J,EAAAA,EAAAzhB,EAAAA,EACAqrI,EAAAv0G,KAAAilO,QAAAx9E,GAEA,IAAAlzC,EAAA,MAAA,GACA,GAAAA,EAAA3vH,GAAA,MAAA,CAAA2vH,EAAA3vH,IAEA,IAAA,IAAAzd,EAAA,EAAA4hB,EAAAwrH,EAAAtvI,OAAA8lO,EAAA,IAAAltM,MAAA9U,GAAA5hB,EAAA4hB,EAAA5hB,IACA4jO,EAAA5jO,GAAAotI,EAAAptI,GAAAyd,GAGA,OAAAmmN,GAUA1lD,EAAA1nJ,UAAAmqO,cAAA,SAAA5+P,GACA,IAAAu+K,EAAA98J,EAAAA,EAAAzhB,EAAAA,EACAujI,EAAAzsG,KAAAilO,QAAAx9E,GAEA,OAAAh7C,EACAA,EAAA7nH,GAAA,EACA6nH,EAAAxnI,OAFA,GAYAogL,EAAA1nJ,UAAAk7E,KAAA,SAAA3vG,EAAA6tN,EAAAjzB,EAAAszB,EAAAG,EAAAG,GACA,IAAAjwC,EAAA98J,EAAAA,EAAAzhB,EAAAA,EAEA,IAAA82B,KAAAilO,QAAAx9E,GAAA,OAAA,EAEA,IAEArxK,EACAjP,EAHAslI,EAAAzsG,KAAAilO,QAAAx9E,GACArkJ,EAAA/sB,UAAApR,OAIA,GAAAwnI,EAAA7nH,GAAA,CAGA,OAFA6nH,EAAAma,MAAA5mH,KAAAw1H,eAAAtsJ,EAAAujI,EAAA7nH,QAAAlvF,GAAA,GAEA0tG,GACA,KAAA,EAAA,OAAAqpG,EAAA7nH,GAAAgZ,KAAA6uG,EAAAjjI,UAAA,EACA,KAAA,EAAA,OAAAijI,EAAA7nH,GAAAgZ,KAAA6uG,EAAAjjI,QAAAutN,IAAA,EACA,KAAA,EAAA,OAAAtqF,EAAA7nH,GAAAgZ,KAAA6uG,EAAAjjI,QAAAutN,EAAAjzB,IAAA,EACA,KAAA,EAAA,OAAAr3D,EAAA7nH,GAAAgZ,KAAA6uG,EAAAjjI,QAAAutN,EAAAjzB,EAAAszB,IAAA,EACA,KAAA,EAAA,OAAA3qF,EAAA7nH,GAAAgZ,KAAA6uG,EAAAjjI,QAAAutN,EAAAjzB,EAAAszB,EAAAG,IAAA,EACA,KAAA,EAAA,OAAA9qF,EAAA7nH,GAAAgZ,KAAA6uG,EAAAjjI,QAAAutN,EAAAjzB,EAAAszB,EAAAG,EAAAG,IAAA,EAGA,IAAAvwN,EAAA,EAAAiP,EAAA,IAAAynB,MAAAuF,EAAA,GAAAj8B,EAAAi8B,EAAAj8B,IACAiP,EAAAjP,EAAA,GAAAkP,UAAAlP,GAGAslI,EAAA7nH,GAAAw+G,MAAAqJ,EAAAjjI,QAAA4M,OACA,CACA,IACAkb,EADArsB,EAAAwnI,EAAAxnI,OAGA,IAAAkC,EAAA,EAAAA,EAAAlC,EAAAkC,IAGA,OAFAslI,EAAAtlI,GAAAy/I,MAAA5mH,KAAAw1H,eAAAtsJ,EAAAujI,EAAAtlI,GAAAyd,QAAAlvF,GAAA,GAEA0tG,GACA,KAAA,EAAAqpG,EAAAtlI,GAAAyd,GAAAgZ,KAAA6uG,EAAAtlI,GAAAqC,SAAA,MACA,KAAA,EAAAijI,EAAAtlI,GAAAyd,GAAAgZ,KAAA6uG,EAAAtlI,GAAAqC,QAAAutN,GAAA,MACA,KAAA,EAAAtqF,EAAAtlI,GAAAyd,GAAAgZ,KAAA6uG,EAAAtlI,GAAAqC,QAAAutN,EAAAjzB,GAAA,MACA,KAAA,EAAAr3D,EAAAtlI,GAAAyd,GAAAgZ,KAAA6uG,EAAAtlI,GAAAqC,QAAAutN,EAAAjzB,EAAAszB,GAAA,MACA,QACA,IAAAhhN,EAAA,IAAAkb,EAAA,EAAAlb,EAAA,IAAAynB,MAAAuF,EAAA,GAAA9R,EAAA8R,EAAA9R,IACAlb,EAAAkb,EAAA,GAAAjb,UAAAib,GAGAm7G,EAAAtlI,GAAAyd,GAAAw+G,MAAAqJ,EAAAtlI,GAAAqC,QAAA4M,IAKA,OAAA,GAYAivK,EAAA1nJ,UAAA3vB,GAAA,SAAA9E,EAAA0b,EAAApb,GACA,OAAA8rJ,EAAAt1H,KAAA92B,EAAA0b,EAAApb,GAAA,IAYA67K,EAAA1nJ,UAAAipH,KAAA,SAAA19I,EAAA0b,EAAApb,GACA,OAAA8rJ,EAAAt1H,KAAA92B,EAAA0b,EAAApb,GAAA,IAaA67K,EAAA1nJ,UAAA63H,eAAA,SAAAtsJ,EAAA0b,EAAApb,EAAAo9I,GACA,IAAA6gC,EAAA98J,EAAAA,EAAAzhB,EAAAA,EAEA,IAAA82B,KAAAilO,QAAAx9E,GAAA,OAAAznJ,KACA,IAAApb,EAEA,OADAgjR,EAAA5nQ,KAAAynJ,GACAznJ,KAGA,IAAAysG,EAAAzsG,KAAAilO,QAAAx9E,GAEA,GAAAh7C,EAAA7nH,GAEA6nH,EAAA7nH,KAAAA,GACAgiI,IAAAna,EAAAma,MACAp9I,GAAAijI,EAAAjjI,UAAAA,GAEAo+R,EAAA5nQ,KAAAynJ,OAEA,CACA,IAAA,IAAAtgL,EAAA,EAAAujQ,EAAA,GAAAzlQ,EAAAwnI,EAAAxnI,OAAAkC,EAAAlC,EAAAkC,KAEAslI,EAAAtlI,GAAAyd,KAAAA,GACAgiI,IAAAna,EAAAtlI,GAAAy/I,MACAp9I,GAAAijI,EAAAtlI,GAAAqC,UAAAA,IAEAkhQ,EAAA5/P,KAAA2hI,EAAAtlI,IAOAujQ,EAAAzlQ,OAAA+6B,KAAAilO,QAAAx9E,GAAA,IAAAijF,EAAAzlQ,OAAAylQ,EAAA,GAAAA,EACAk9B,EAAA5nQ,KAAAynJ,GAGA,OAAAznJ,MAUAqlJ,EAAA1nJ,UAAA83H,mBAAA,SAAAvsJ,GACA,IAAAu+K,EAUA,OARAv+K,GACAu+K,EAAA98J,EAAAA,EAAAzhB,EAAAA,EACA82B,KAAAilO,QAAAx9E,IAAAmgH,EAAA5nQ,KAAAynJ,KAEAznJ,KAAAilO,QAAA,IAAAyiC,EACA1nQ,KAAAmqO,aAAA,GAGAnqO,MAMAqlJ,EAAA1nJ,UAAA43H,IAAA8vB,EAAA1nJ,UAAA63H,eACA6vB,EAAA1nJ,UAAA23H,YAAA+vB,EAAA1nJ,UAAA3vB,GAKAq3K,EAAArgF,SAAAr6E,EAKA06J,EAAAA,aAAAA,OAKA,IAAAhyP,IACAA,EAAAC,QAAA+xP,+BC9UA,aAEA,MAAAwiH,EAAAt0W,EAAA,aAEA,MAAAw7N,UAAAj2H,MACAjiG,YAAA8iF,GACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,gBAIA,MAAAi1W,EAAA,CAAAzyJ,EAAAoyJ,EAAA3pL,IAAA,IAAA/X,SAAA,CAAAC,EAAAu5B,KACA,GAAA,iBAAAkoK,GAAAA,EAAA,EACA,MAAA,IAAA1iQ,UAAA,mDAGA,GAAA0iQ,IAAAp7P,EAAAA,EAEA,YADA25D,EAAAqvC,GAIA,MAAA0yJ,EAAAl9L,YAAA,KACA,GAAA,mBAAAiT,EAAA,CACA,IACA9X,EAAA8X,KACA,MAAAvuG,GACAgwH,EAAAhwH,GAGA,OAGA,MACAu1R,EAAAhnL,aAAAhlF,MAAAglF,EAAA,IAAAixC,EADA,iBAAAjxC,EAAAA,EAAA,2BAAA2pL,kBAGA,mBAAApyJ,EAAA2yJ,QACA3yJ,EAAA2yJ,SAGAzoK,EAAAulK,KACA2C,GAGAI,EAEAxyJ,EAAAp3G,KAAA+nE,EAAAu5B,IACA,KACA0wB,aAAA83I,SAKA10W,EAAAC,QAAAw0W,EAEAz0W,EAAAC,QAAAH,QAAA20W,EAEAz0W,EAAAC,QAAAy7N,aAAAA,mDCxDA,aACA17N,EAAAC,QAAA,CAAA+hN,EAAA4yJ,KACAA,EAAAA,GAAA,SAEA5yJ,EAAAp3G,MACAtE,GAAA,IAAAosE,SAAAC,IACAA,EAAAiiM,QACAhqQ,MAAA,IAAAtE,MACAF,GAAA,IAAAssE,SAAAC,IACAA,EAAAiiM,QACAhqQ,MAAA,KACA,MAAAxE,sCCXA,aACAjmG,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACA,MAAAw0W,EAAA30W,EAAA,iBA6BAD,EAAAH,QA5BA,MACA0D,cACAmpG,KAAA6lQ,OAAA,GAEAhvW,QAAAi+N,EAAAngO,GAEA,MAAAkpF,EAAA,CACAsqR,UAFAxzW,EAAAnB,OAAAiqG,OAAA,CAAA0qQ,SAAA,GAAAxzW,IAEAwzW,SACArzI,IAAAA,GAEA,GAAA90H,KAAA/C,MAAA+C,KAAA6lQ,OAAA7lQ,KAAA/C,KAAA,GAAAkrQ,UAAAxzW,EAAAwzW,SAEA,YADAnoQ,KAAA6lQ,OAAA/6R,KAAA+S,GAGA,MAAAtY,EAAA2iS,EAAA/0W,QAAA6sG,KAAA6lQ,OAAAhoR,GAAA,CAAAhX,EAAAyS,IAAAA,EAAA6uR,SAAAthS,EAAAshS,WACAnoQ,KAAA6lQ,OAAAp7R,OAAAlF,EAAA,EAAAsY,GAEAhnF,UACA,MAAAokG,EAAA+E,KAAA6lQ,OAAAlhQ,QACA,OAAA1J,MAAAA,OAAA,EAAAA,EAAA65H,IAEAj+N,OAAAlC,GACA,OAAAqrG,KAAA6lQ,OAAA93R,QAAA8P,GAAAA,EAAAsqR,WAAAxzW,EAAAwzW,WAAA/9R,KAAAyT,GAAAA,EAAAi3I,MAEA73H,WACA,OAAA+C,KAAA6lQ,OAAA5gS,8DC5BA,aACAzxE,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAmBAJ,EAAAH,QAhBA,SAAA+hO,EAAAxhO,EAAAq6G,GACA,IAAAl1B,EAAA,EACA0K,EAAA2xI,EAAAjwJ,OACA,KAAAse,EAAA,GAAA,CACA,MAAA8gN,EAAA9gN,EAAA,EAAA,EACA,IAAAi2Q,EAAA3gR,EAAAwrN,EACAt2L,EAAAmnH,EAAAskI,GAAA9lW,IAAA,GACAmlF,IAAA2gR,EACAj2Q,GAAA8gN,EAAA,GAGA9gN,EAAA8gN,EAGA,OAAAxrN,iCClBA,aAMAxlF,EAAAC,QAAA,EAAA4mU,QAAAA,KAIA,KACA,MAAAuB,EAAAvB,EAAAwB,MACA,OAAA,MAAAD,GAAAp+O,QAAAo+O,EAAAE,OAAAysC,4CCZA,aAEA,MAAA1sD,EAAAnoT,EAAA,WACAg7N,EAAAh7N,EAAA,SACA80W,YAAAA,GAAA90W,EAAA,2BACAupU,EAAAvpU,EAAA,2CAOAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAxnU,KAAAA,KA2CAiqU,GAvCAxpL,eAAA3gJ,EAAAouK,EAAA,IACA,IAAA26I,EAAA/oT,KAAAA,GACA,MAAA,IAAAmmG,MAAA,oBAAAnmG,GAGA,GAAA+oT,EAAAgB,SAAA/pT,GAAA,CACA,IAAAE,EACA,MAAA,IAAAimG,MAAA,qDAGA,UAAA,MAAAwvQ,KAAAz1W,EAAAmzK,QAAArzK,EAAAouK,GACApuK,EAAA21W,EAIA,MAAA,CAAA,CAAAj1P,KAAAzO,GAAAjyG,EAAAmtF,MAAA,KACA6tI,EAAA,IAAAY,EAAAl7G,GAGA,GAAA,IAAAzO,EAAA3/B,OACA,MAAA,SAAAojS,EAAA16I,EAAA,CAAAvtF,KAAA2gC,EAAAwnM,YAGA51W,EAAAiyG,EAAAt6B,KAAA,KAEA,MAAAwxL,EAAAu+D,EAAAr0J,QAAA2nD,EAAAh7N,GACA,IAAAe,EAAAi6N,EACAyuI,EAAAzpW,EAEA,UAAA,MAAAi4E,KAAAkxL,EACAvtC,EAAAsM,MAAAjwJ,EAAAl3E,SACAA,EAAAk3E,EAAAl3E,MACA0oW,EAAAxxR,EAAAwxR,eAIA,MAAA,SAAAiM,EAAA30W,EAAA,CAAA0sI,KAAA2gC,EAAAwnM,YAAAnM,EAAA,IAAAA,EAAA,wJCpDA,aAEA,MAAA7tI,EAAAh7N,EAAA,QAiBAD,EAAA+0W,YAAA,CAAAr5Q,EAAAr6F,EAAA,MACA,MAAA6zW,GAAA,IAAA7zW,EAAA6zW,QACA,IAAA76I,EAAAY,EAAAsM,MAAA7rI,GACAA,EAEA,IAAAu/H,EAAAv/H,GAEA,GAAA,IAAA2+H,EAAAjqH,SAAA/uG,EAAAyrI,MAAA,cAAAzrI,EAAAyrI,KAAA,CACA,IAAAooO,EAAA,OAAA76I,EAAAvvH,WACAuvH,EAAAA,EAAA86I,OAGA,OAAA96I,EAAAoM,oBAAAplO,EAAAyrI,iDC/BA,aAEA,MAAAsoO,EAAAn1W,EAAA,SACAo1W,EAAAp1W,EAAA,aACAq1W,EAAAr1W,EAAA,QACAs1W,EAAAt1W,EAAA,QACAu1W,EAAAv1W,EAAA,YAsCAF,EAAAC,QA/BA,MAOAuD,aAAAyjU,OAAAA,EAAAD,KAAAA,EAAAK,WAAAA,IACA,MAAAG,EAAA8tC,EAAA,CAAAruC,OAAAA,EAAAD,KAAAA,EAAAK,WAAAA,IACA16N,KAAA66N,OAAAA,EACA76N,KAAAhhB,IAAA0pR,EAAA,CAAA7tC,OAAAA,IACA,MAAAkuC,EAAAD,EAAA,CAAAxuC,OAAAA,EAAAD,KAAAA,EAAAK,WAAAA,IACA16N,KAAA+oQ,MAAAA,EACA/oQ,KAAAgpQ,GAAAH,EAAA,CAAAE,MAAAA,IACA/oQ,KAAA0tH,GAAAk7I,EAAA,CAAAvuC,KAAAA,EAAAK,WAAAA,IAGA16N,KAAAipQ,OAAA,CACAjqR,IAAA,CAAA2uI,EAAAh5N,EAAA,KAAAoxK,QAAAw5B,OAAA,IAAAzmG,MAAA,oBACA40H,GAAAp6E,gBAAAo1D,EAAA/zM,EAAA,IAAA,OAAAoxK,QAAAw5B,OAAA,IAAAzmG,MAAA,qBACAkwQ,GAAA,CAAAtgK,EAAA/zM,EAAA,KAAAoxK,QAAAw5B,OAAA,IAAAzmG,MAAA,oBACAiwQ,MAAA,CAAArgK,EAAA/zM,EAAA,KAAAoxK,QAAAw5B,OAAA,IAAAzmG,MAAA,oBACA0qQ,QAAA,CACAxkR,IAAA,CAAAnsF,EAAA08N,IAAAxpD,QAAAw5B,OAAA,IAAAzmG,MAAA,oBACAkwQ,GAAA,CAAAn2W,EAAA8B,EAAA,KAAAoxK,QAAAw5B,OAAA,IAAAzmG,MAAA,oBACA40H,GAAA,CAAA/4N,EAAA,KAAAoxK,QAAAw5B,OAAA,IAAAzmG,MAAA,wICtCA,aAEA,MAAA/c,EAAAxoF,EAAA,WACAg7N,EAAAh7N,EAAA,QAMAF,EAAAC,QAAA,EAAAunU,OAAAA,KAIA,CAAAloU,EAAAgC,EAAA,MACA,IAAA+7N,EAeA,OAZAA,EADAnC,EAAAsM,MAAAloO,GACAkoU,EAAA,CAAA,CACAltG,IAAAh7N,KACAgC,IACAA,GAEAkmU,EAAA,CAAA,CACAloU,KAAAA,EAAAyrG,cACAzpG,IACAA,GAIAonF,EAAA20I,gEC7BA,aAmBAr9N,EAAAC,QAVAggJ,MAAAv+D,IACA,IAAAhJ,EAEA,UAAA,MAAAgqG,KAAAhhG,EACAhJ,EAAAgqG,EAGA,OAAAhqG,iCCfA,aAEA,MAAAwxP,YAAAA,GAAAhqU,EAAA,eACA21W,EAAA31W,EAAA,kBACA41W,SAAAA,GAAAD,EACApsC,EAAAvpU,EAAA,2CACA61W,EAAA71W,EAAA,4CAoBAF,EAAAC,QAAA,EAAAonU,WAAAA,EAAAJ,OAAAA,EAAAD,KAAAA,KAgDAyC,GA5CAxpL,gBAAAv+D,EAAApgF,EAAA,IAIA,MAAA00W,EAAA/1N,kBACA,UAAA,MAAA3gJ,KAAAA,EAAAixW,UAAAA,EAAA0F,SAAAA,KAAAF,EAAAr0R,GAAA,CACA,MAAA44I,QAAA4vG,EAAAlD,EAAA1nU,IAGAijT,OAAAA,SAAA8kB,EAAA6uC,iBAAA57I,EAAA,CAAAw7I,EAAAvF,UAAAuF,EAAAK,SAEA,GAAA,cAAA5zD,IAAAguD,EAEA,MAAA,IAAA9qQ,MAAA,GAAA60H,gCAGAi2I,QACAlpC,EAAA+uC,eAAA97I,EAAA,CAAA27I,SAAAA,UAEA5uC,EAAAgvC,YAAA/7I,EAAA,CAAA27I,SAAAA,UAGA37I,IAQA,IAFAtwI,QAAA1oF,EAAAg1W,MAIA,kBADAN,KAIA,MAAAh2I,QAAAinG,EAAAsvC,WAEA,UACAP,IACA,QACAh2I,wLCtEA,aAEA,MAAA9E,EAAAh7N,EAAA,QACAupT,EAAAvpT,EAAA,YAEAs2W,EAAAt2W,EAAA,kBACA0wU,EAAA1wU,EAAA,SACAslF,EAAAtlF,EAAA,YACAmzN,EAAAnzN,EAAA,UACAu2W,EAAAv2W,EAAA,SACA46N,EAAA56N,EAAA,aACA66N,EAAA76N,EAAA,eACAspU,IAAAA,GAAAtpU,EAAA,uBAmCA,MAAAw2W,EAAA57I,EAAAoO,SAAA,eAKA,SAAAytI,EAAAr8I,GACA,OAAA,IAAAkvG,EAAA,IAAAktC,EAAAzmQ,OAAAqqH,EAAAW,cAMA,SAAA27I,EAAAj1W,GACA,OAAA+0W,EAAA3lQ,OAAApvG,EAAAopG,WAAAh5B,MAAA,IAGA,MAAA+jS,EAAA,CAEAK,OAAA,SAEA5F,UAAA,YAEAsG,SAAA,WAEAxjJ,IAAA,OAGA,MAAAwiJ,EAMAryW,aAAAmjU,KAAAA,EAAAK,KAAAA,IACAr6N,KAAAg6N,KAAAA,EACAh6N,KAAAq6N,KAAAA,EACAr6N,KAAAqsH,IAAA43G,EAAA,YACAjkO,KAAAmqQ,WAAA,IAAAxrR,IACAqhB,KAAAoqQ,cAAA,IAAAzrR,IASA9nF,eAAA82N,EAAAh5N,GACA,MAAAsyE,QAAA+4B,KAAAq6N,KAAA74O,IAAAmsI,EAAAh5N,GAEA,GAAA,WAAAg5N,EAAAgN,MACA,IAAA,MAAA/gJ,KAAA3S,EAAAq3R,YACA1kR,EAAAy5N,WACArzM,KAAAqqQ,SAAAzwR,EAAAy5N,KAAA1+S,QAEA,GAAA,aAAAg5N,EAAAgN,MACA,IAAA,MAAA,CAAA2vI,KAAAT,EAAA5iS,SACAqjS,QACAtqQ,KAAAqqQ,SAAAC,EAAA31W,GAUAkC,kBAAA82N,EAAAh5N,EAAA,UACAqrG,KAAAq6N,KAAA74O,IAAAmsI,EAAAh5N,GAGA,MAAAgmU,EAAA,CACA1iH,MAAA,GAeA,OAZA,IAAA0V,EAAAjqH,UACAi3N,EAAAj3N,QAAAiqH,EAAAjqH,SAGA,WAAAiqH,EAAAgN,QACAggG,EAAAhgG,MAAAvM,EAAA8pB,UAAAvqB,EAAAgN,QAGAhmO,EAAA20W,WACA3uC,EAAA2uC,SAAA30W,EAAA20W,UAGAtpQ,KAAAg6N,KAAAuwC,KAAAl5I,IAAA24I,EAAAr8I,GAAAm8I,EAAAxmQ,OAAAq3N,IASA9jU,YAAA82N,EAAAh5N,GACA,OAAAqrG,KAAAg6N,KAAAuwC,KAAA9mR,OAAAumR,EAAAr8I,IAQA92N,qBAAA82N,EAAAh5N,EAAA,UACAqrG,KAAAwqQ,iBAAA78I,EAAAh5N,GAGA,MAAAgmU,EAAA,CACA1iH,MAAA5rG,EAAAA,GAGA,IAAAshH,EAAAjqH,UACAi3N,EAAAj3N,QAAAiqH,EAAAjqH,SAGA,WAAAiqH,EAAAgN,QACAggG,EAAAhgG,MAAAvM,EAAA8pB,UAAAvqB,EAAAgN,QAGAhmO,EAAA20W,WACA3uC,EAAA2uC,SAAA30W,EAAA20W,gBAGAtpQ,KAAAg6N,KAAAuwC,KAAAl5I,IAAA24I,EAAAr8I,GAAAm8I,EAAAxmQ,OAAAq3N,IAMA9jU,iBAAAlC,GACA,UAAA,MAAAohL,KAAA/1E,KAAAg6N,KAAAuwC,KAAA7hK,MAAA,CACAxkH,QAAA,CAAA6xF,GAGA,IAFA+zL,EAAA1lQ,OAAA2xE,EAAAriL,OAEAukN,SAEA,CACA,MAAA0iH,EAAAmvC,EAAA1lQ,OAAA2xE,EAAAriL,OACAgwG,EAAAi3N,EAAAj3N,SAAA,EACAi3H,EAAAggG,EAAAhgG,MAAAvM,EAAA6pB,QAAA0iF,EAAAhgG,OAAA,SACArM,EAAA27I,EAAAl0L,EAAA/gL,UAEA,CACA24N,IAAA,IAAAY,EAAA7qH,EAAAi3H,EAAArM,GACAg7I,SAAA3uC,EAAA2uC,WAQAzyW,oBAAAlC,GACA,UAAA,MAAAohL,KAAA/1E,KAAAg6N,KAAAuwC,KAAA7hK,MAAA,CACAxkH,QAAA,CAAA6xF,GACA+zL,EAAA1lQ,OAAA2xE,EAAAriL,OAEAukN,QAAA5rG,EAAAA,KAEA,CACA,MAAAsuN,EAAAmvC,EAAA1lQ,OAAA2xE,EAAAriL,OACAgwG,EAAAi3N,EAAAj3N,SAAA,EACAi3H,EAAAggG,EAAAhgG,MAAAvM,EAAA6pB,QAAA0iF,EAAAhgG,OAAA,SACArM,EAAA27I,EAAAl0L,EAAA/gL,UAEA,CACA24N,IAAA,IAAAY,EAAA7qH,EAAAi3H,EAAArM,GACAg7I,SAAA3uC,EAAA2uC,WAQAzyW,mBAAAlC,GACA,UAAA,MAAAg5N,IAAAA,KAAA3tH,KAAAyqQ,gBACA,UAAA,MAAAH,KAAAtqQ,KAAAqqQ,SAAA18I,EAAAh5N,GAAA,CAEA,MAAA88G,EAAA,CACA03P,EAAAvF,kBAGA5jQ,KAAAupQ,iBAAAe,EAAA74P,IAEAi5P,eAIAJ,IAUAzzW,uBAAA82N,EAAAl8G,EAAA98G,GACAkpG,MAAA/gB,QAAA20B,KACAA,EAAA,CAAAA,IAGA,MAAAi1G,EAAAj1G,EAAAhjC,SAAA06R,EAAAziJ,KACA8iJ,EAAA/3P,EAAAhjC,SAAA06R,EAAAK,QACA5F,EAAAnyP,EAAAhjC,SAAA06R,EAAAvF,WACAsG,EAAAz4P,EAAAhjC,SAAA06R,EAAAe,UAEA,GAAAtG,GAAA4F,GAAA9iJ,EAAA,CACA,MAAA97I,QAAAiO,EAAAmnB,KAAAg6N,KAAAuwC,KAAA7hK,MAAA,CACA/9G,OAAAq/Q,EAAAr8I,GAAAvvH,WACAla,QAAA,CAAA6xF,IACA,GAAA2wC,EACA,OAAA,EAGA,MAAAi0G,EAAAmvC,EAAA1lQ,OAAA2xE,EAAAriL,OAEA,OAAA+9G,EAAAhjC,SAAA,IAAAksP,EAAA1iH,MAAAkxJ,EAAAK,OAAAL,EAAAvF,aAEA7uC,MAAA,KAGA,GAAAnqP,EAAA,CACA,MAAA+vP,EAAAmvC,EAAA1lQ,OAAAx5B,EAAAl3E,OAEA,MAAA,CACAi6N,IAAAA,EACA+8I,QAAA,EACA90D,OAAA,IAAA+kB,EAAA1iH,MAAAkxJ,EAAAK,OAAAL,EAAAvF,UACA0F,SAAA3uC,EAAA2uC,WAKA,MAAAhqQ,EAAAU,KAiBA,GAAA0mH,GAAAwjJ,EAAA,CAIA,MAAAS,QAAA9xR,EAfAy6D,gBAAAt+I,EAAA+/E,GACA,UAAA,MAAA44I,IAAAg9I,KAAA51R,EACA,UAAA,MAAAu1R,KAAAhrQ,EAAA+qQ,SAAAM,GACA,GAAAL,EAAAtwI,OAAAhlO,GAEA,kBADA21W,GAWAC,CAAAj9I,EAAA3tH,KAAAyqQ,kBAEA,GAAAE,EACA,MAAA,CACAh9I,IAAAA,EACA+8I,QAAA,EACA90D,OAAAuzD,EAAAe,SACAzjS,OAAAkkS,GAKA,MAAA,CACAh9I,IAAAA,EACA+8I,QAAA,GAQA7zW,uBAAA82N,EAAAh5N,SACA+xN,EAAA1mH,KAAAqqQ,SAAA18I,EAAAh5N,IASAkC,oBAAAiwE,GACA,GAAA,iBAAAA,IAAAtzE,OAAAW,KAAAg1W,GAAA16R,SAAA3H,GACA,MA3SA,SAAAA,GAEA,OAAAg2O,EAAA,IAAAhkN,MADA,iBAAAhyB,yDACA,wBAySA+jS,CAAA/jS,GAEA,OAAA,GAIAoiS,EAAAC,SAAAA,EAEA91W,EAAAC,QAAA41W,0PC9VM3vH,EAAOhmP,EAAQ,iBAAiBqsG,KAChC2uH,EAAMh7N,EAAQ,QAEdwrW,EAAQ,CAAClgQ,EAAKlsG,EAAAA,GAAWm4W,GAAY,KACrCA,GAAe7nH,EAAO8H,SAASlsJ,KACjCA,EAAM06I,EAAK8kH,YAAYx/P,wBAGd7pG,KAAOxB,OAAOW,KAAK0qG,GAAAA,KACtBksQ,EAAQp4W,EAAKyyE,QACjB2lS,EAAMjgS,KAAK91E,OACP2kG,EAAMkF,EAAI7pG,MACV2kG,GAAsB,iBAARA,KACZkE,MAAM/gB,QAAQ6c,WACPxyB,EAAI,EAAGA,EAAIwyB,EAAI10B,OAAQkC,IAAAA,KAC1B6jS,EAASD,EAAM3lS,QACnB4lS,EAAOlgS,KAAK3D,OACR+oG,EAAIv2E,EAAIxyB,GACRonJ,EAAIsM,MAAM3qD,SACL86L,EAAO1gS,KAAK,KAAM4lG,GACH,iBAANA,UACR6uL,EAAM7uL,EAAG66L,GAAO,SAIxBx8I,EAAIsM,MAAMlhI,SACLoxQ,EAAMzgS,KAAK,KAAMqvB,SAEhBolQ,EAAMplQ,EAAKoxQ,GAAO,QAQtC13W,EAAOC,QAAUyrW,mFCpCjB,aAEAzrW,EAAAssG,KAAArsG,EAAA,aACAD,EAAAg0F,SAAA/zF,EAAA,iBACAD,EAAAqnO,MAAArnO,EAAAssG,KAAA+6H,MACArnO,EAAA6qW,eAAA7qW,EAAAssG,KAAAu+P,wFCLA,aAEA,MAAA5kH,EAAAhmP,EAAA,QACA66N,EAAA76N,EAAA,cACA86N,EAAA96N,EAAA,sBACAg7N,EAAAh7N,EAAA,QACA03W,EAAA13W,EAAA,eACAqoO,EAAAroO,EAAA,sBACA6kO,EAAA7kO,EAAA,2BAkBA,SAAA23W,EAAAhK,GACA,IAAAiK,EACA,IACAA,EAAAF,EAAA/J,GACA,MAAAntW,GACAo3W,GAAA,EAEA,GAAAA,EACA,MAAA,IAAAryQ,MAAA,6CAkCA,OA/BA,SAAA3U,EAAA0a,GACA,IAAAA,GAAAA,aAAA45H,YAAA,iBAAA55H,EACA,OAAAA,EAGA,GAAAhB,MAAA/gB,QAAA+hB,GACA,OAAAA,EAAAz0B,IAAA+Z,GAGA,GAAAoqI,EAAAsM,MAAAh8H,GACA,OAlCA,SAAA8uH,GAOA,MANA,iBAAAA,EACAA,EAAA,IAAAY,EAAAZ,GAAAgL,MACApK,EAAAsM,MAAAlN,KACAA,EAAAA,EAAAgL,OAGA,IAAA4gB,EAAA6xH,OATA,GASAxvI,EAAA,CACAxD,EAAA,KAAA,UACAzK,GACA,EAAAA,EAAA1oJ,SAwBAomS,CAAAxsQ,GAGA,MAAA1qG,EAAAX,OAAAW,KAAA0qG,GAEA,GAAA1qG,EAAA8wE,OAAA,EAAA,CAEA,MAAA87D,EAAA,GAQA,OAPA5sI,EAAAC,SAAAY,IACA,iBAAA6pG,EAAA7pG,GACA+rI,EAAA/rI,GAAAmvF,EAAA0a,EAAA7pG,IAEA+rI,EAAA/rI,GAAA6pG,EAAA7pG,MAGA+rI,EAEA,OAAAliC,EAIA1a,CAAA+8Q,GAGA,MAAAvmI,EAAAvM,EAAAk9I,SACAnN,EAAA/vI,EAAAm9I,SAEAC,EAAA,CACAh5R,GAAAmnB,IAEAA,EAAAA,EAAAv0B,MAAA,GACA,IAAAmpJ,EAAA50H,KAIA,IAAA8xQ,EADA,MAEA,MAAAC,EAAA,SACA,IAAAlH,EAAAkH,EACAr7I,EAAA,KAUA,SAAAs7I,EAAAh3W,GACA,IAAAulN,EAAAsxJ,EAEA72W,GACA,iBAAAA,EAAAsoG,OACAwuQ,EAAA92W,EAAAsoG,MAEA,iBAAAtoG,EAAA6vW,UACAA,EAAA7vW,EAAA6vW,SAEA7vW,EAAAulN,OACAA,EAAA1mN,OAAAiqG,OAAA,GAAA+tQ,EAAA72W,GAAAA,EAAAulN,SAIAuxJ,EA7BA,MA8BAjH,EAAAkH,GAGA,MAAAE,EAAA,CACA1xJ,KAAAA,EACAj9G,KAAAwuQ,GAGAp7I,EAAA,IAAAkpB,EAAAsyH,QAAAD,GAEAH,EAAAG,EAAA3uQ,KAGA0uQ,IA4DAt4W,EAAAC,QAAA,CACAqnO,MAAAA,EACAwjI,eAAAA,EACAwN,iBAAAA,EACA/M,UAxDA,SAAA33R,GACA,MAAA6kS,EAAAZ,EAAAjkS,GAGA,OAFAsyK,EAAAj2I,OAAAwoQ,IAuDAzN,YA5CA,SAAA3xM,GAKA,GAJAA,EAAAznF,OAAAwmS,GAAA/+M,EAAAznF,QAAAu/R,GACAmH,EAAA,CAAA1uQ,KAAAyvD,EAAAznF,SAGAynF,EAAAznF,OAAAwmS,EACA,MAAA,IAAA3yQ,MAAA,yDAKA,MAAA4tH,EAAA2J,EAAA07I,UAAAr/M,GACA,GAAA,IAAAg6D,EAAAzhJ,OACA,MAAA,IAAA6zB,MAAA,8DAGA,OAAA4tH,EAAA,IA6BAiH,IAjBAr6E,eAAA8qN,EAAAa,GACA,MAAAh3M,EAAA,CAAA84M,WAAA,EAAArkC,QAAAyhC,GACAxpW,EAAAnB,OAAAiqG,OAAAwqD,EAAAg3M,GAEA3wI,QAAAD,EAAA+vI,EAAAzpW,EAAA+nU,SACAjkF,EAAArqB,EAAAopB,gBAAA7c,GAGA,OAFA,IAAApM,EAAA55N,EAAAosW,WAAAtoH,EAAAnqB,+LCnLA,aAGAh7N,EAAA04W,SAAAz4W,EAAA,cACAD,EAAAu4W,QAAAt4W,EAAA,aACAD,EAAA24W,QAAA14W,EAAA,aACAD,EAAA44W,OAAA34W,EAAA,YACAD,EAAA83W,OAAA73W,EAAA,YAGAD,EAAAy4W,UAAAz4W,EAAAu4W,QAAAE,UACAz4W,EAAA64W,YAAA74W,EAAAu4W,QAAAM,YACA74W,EAAA84W,SAAA94W,EAAA04W,SAAAI,SACA94W,EAAAgwG,OAAAhwG,EAAA24W,QAAA3oQ,OACAhwG,EAAA8wG,OAAA9wG,EAAAu4W,QAAAznQ,OAEA9wG,EAAA+4W,QAAA,CACAjoQ,OAAA9wG,EAAAu4W,QAAAE,UACAzoQ,OAAAhwG,EAAA24W,QAAA3oQ,OACAusG,QAAA,EACAh9M,KAAA,wICpBA,0BAEQowP,GAAW1vP,EAAQ,UACrBs4W,EAAUt4W,EAAQ,aAClBgtR,EAAQhtR,EAAQ,WAMtB,MAAAy4W,UAAuBH,EACrBS,UAAWC,EAAW74W,YACV64W,KAAa74W,KAGzB84W,UAAW7yQ,UACF4rB,MAAMinP,UAAU7yQ,GAAKyE,WAG9BquQ,YAAa/qN,EAAG0iE,UACP7+F,MAAMknP,YAAY/qN,EAAG0iE,GAAGhmH,WAGjCsuQ,YAAaC,EAAIC,EAAIC,EAAI5vF,UAChB13J,MAAMmnP,YAAYC,EAAIC,EAAIC,EAAI5vF,GAAI7+K,WAG3C0uQ,eAAgBprN,EAAG0iE,UACV7+F,MAAMunP,eAAeprN,EAAG0iE,GAAGhmH,WAGpC2uQ,eAAgBJ,EAAIC,EAAIC,EAAI5vF,UACnB13J,MAAMwnP,eAAeJ,EAAIC,EAAIC,EAAI5vF,GAAI7+K,WAG9C4uQ,mBACS,OAGTC,oBACS,QAGTC,YAAavzQ,SACLu4M,EAAK3sL,MAAM2nP,YAAYvzQ,UACzB4mL,EAAM4sF,eAAexzQ,GAChB,UAGCu4M,MAGZk7D,kBAAmBvmS,EAAGyS,EAAG7M,EAAGmxD,YACfrY,MAAM6nP,kBAAkBvmS,EAAGyS,EAAG7M,EAAGmxD,OAI9CyvO,kBAAmBxmS,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,YAC3BliD,MAAM8nP,kBAAkBxmS,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,OAI1D6lM,iBAAkBxjR,EAAKsZ,SACfzJ,EAAM7P,EAAIxf,KAAK,aAER,IAAT84B,QACWzJ,UAEHA,IAGd4zQ,yBAA0Bv4R,EAAOhQ,cAClBi+K,EAAOx5F,KAClBlkC,MAAMgoP,yBAAyBv4R,EAAOhQ,IACrCo5B,SAAS,UAKdovQ,uBACS,aAGTC,0BACS,cAGTC,kBACS,QAGTC,qBACS,SAGTC,mBACS,OAGTC,wBACS,YAGTC,uBAAwBn0Q,mBACLA,KAGnBo0Q,YAAanxQ,EAAKwG,SACVzJ,EAAM4rB,MAAMwoP,YAAYnxQ,EAAKwG,UAEtB,IAATA,QAEWzJ,EAAIrvB,KAAK,aAGbqvB,EAAIrvB,KAAK,SAGtB0jS,UAAW5jS,EAAKg5B,SACRzJ,EAAM4rB,MAAMyoP,UAAU5jS,GACtBsZ,EAAOma,MAAM4rD,KAAK9vD,EAAIxlG,QACzBuxE,OAAOuoS,EAAct0Q,GAAM,WAEjB,IAATyJ,QACW1f,SAGJA,KAGbwqR,aAAcrvQ,EAAKuE,SACXzJ,EAAM4rB,MAAM2oP,aAAarvQ,GACzBz0B,EAAM52E,OAAOW,KAAKwlG,GACrBj0B,OAAOuoS,EAAct0Q,GAAM,WAEjB,IAATyJ,QACWh5B,SAGJA,KAGb+jS,iBAAkBrkR,EAAKsZ,SACfzJ,EAAM7P,EAAIxf,KAAK,aAER,IAAT84B,QACWzJ,SAGJA,KAGby0Q,yBAA0Bp5R,EAAOhQ,aAClBi+K,EAAOx5F,KAClBlkC,MAAM6oP,yBAAyBp5R,EAAOhQ,IACrCo5B,SAAS,2BAKGpP,EAAO2tI,GACD,iBAAV3tI,IACTA,EAAQi0J,EAAOx5F,KAAKz6D,EAAO2tI,GAAO,eAG9BzzE,IAAU8iN,GACLG,YAAYn9Q,IAM3B,SAAAi/Q,EAAwBt0Q,SACf,CAAC08I,EAAKrhP,IACPqhP,KACQA,MAAQrhP,MAAQ2kG,EAAI3kG,QAEtBA,MAAQ2kG,EAAI3kG,KAP1B3B,EAAOC,QAAU04W,kFC1KjB,6CAEQ/oH,GAAW1vP,EAAQ,UACrBw6T,EAAUx6T,EAAQ,WAClB86W,EAAY96W,EAAQ,gBAAgB+6W,UAEpCl/R,EAAS77E,EAAQ,iBACjBgtR,EAAQhtR,EAAQ,WAChBk5E,EAAIl5E,EAAQ,eACZ24W,EAAS34W,EAAQ,YACjB63W,EAAS73W,EAAQ,iBACfk5N,GAAQl5N,EAAQ,WAKxB,MAAAs4W,EAKEl/P,YAAao0D,KACXA,EAAOA,GAAAA,IAEG9jE,MAAQ8jE,EAAK9jE,KAAO,MAC5B8jE,EAAK9jE,KAAO,MAGZ8jE,EAAK9jE,KAAOsjL,EAAMguF,aAAaxtM,EAAK9jE,MAItC+C,KAAKwuQ,MAAAA,IAAYvwI,YAAYl9D,EAAK9jE,MAClC+C,KAAKyuQ,OAAAA,IAAah2I,WAAWz4H,KAAKwuQ,OAClCxuQ,KAAK2gP,QAAU19F,EAAOx5F,KAAKzpD,KAAKwuQ,OAEhCxuQ,KAAKimP,SAGLjmP,KAAK0uQ,WAAal7W,OAAOiqG,OAAAA,CACvB3tB,EAAI6pB,GAAAA,IAAYoE,KAAKpE,GACrB5pB,EAAI4pB,GAAAA,IAAYoE,KAAW,IAANpE,GACrB3pB,EAAI2pB,GAAQ4mL,EAAMouF,uBAAuBh1Q,GACzC1pB,EAAI0pB,GAAQltB,EAAEmiS,QAAQx+O,MAAMmwJ,EAAMouF,uBAAuBh1Q,IACzDzpB,EAAI40F,GAEKr4F,EAAEu7Q,IAAI3oH,IAAIv6D,EAAE,IAAI9lJ,MAAM8lJ,EAAE,IAEjC30F,EAAI20F,GAEKr4F,EAAEq7Q,IAAIzoH,IAAIv6D,EAAE,IAAI9lJ,MAAM8lJ,EAAE,IAEjChzF,GAAK6nB,GAAAA,IAAY8yH,EAAI9yH,GACrB1nB,GAAK0nB,GAAAA,IAAYqd,OAAOrd,IACvBonE,EAAKm5C,MAGRl6G,KAAK5wB,OAASA,EAAOowB,EAAAA,CAEnB6sH,IAAK3xH,QAAQ2xH,IAAI1zH,KAAK+B,SACtBm0Q,QAAS7uQ,KAAK6uQ,QAAQl2Q,KAAKqH,MAC3B8uQ,UAAW9uQ,KAAK8uQ,UAAUn2Q,KAAKqH,MAC/B+uQ,aAAc/uQ,KAAK+uQ,aAAap2Q,KAAKqH,MACrCgvQ,UAAWhvQ,KAAKgvQ,UAAUr2Q,KAAKqH,MAC/BivQ,aAAcjvQ,KAAKivQ,aAAat2Q,KAAKqH,MACrCkvQ,UAAWlvQ,KAAKkvQ,UAAUv2Q,KAAKqH,MAC/BmvQ,gBAAiBnvQ,KAAKmvQ,gBAAgBx2Q,KAAKqH,MAC3CovQ,gBAAiBpvQ,KAAKovQ,gBAAgBz2Q,KAAKqH,MAC3CqvQ,SAAUrvQ,KAAKqvQ,SAAS12Q,KAAKqH,MAC7BsvQ,UAAWtvQ,KAAKsvQ,UAAU32Q,KAAKqH,MAC/BuvQ,cAAevvQ,KAAKuvQ,cAAc52Q,KAAKqH,MACvCwvQ,SAAUxvQ,KAAKwvQ,SAAS72Q,KAAKqH,MAC7ByvQ,aAAczvQ,KAAKyvQ,aAAa92Q,KAAKqH,MACrC0vQ,gBAAiB1vQ,KAAK0vQ,gBAAgB/2Q,KAAKqH,MAC3C2vQ,QAAS3vQ,KAAK2vQ,QAAQh3Q,KAAKqH,MAC3B4vQ,WAAY5vQ,KAAK4vQ,WAAWj3Q,KAAKqH,MACjC6vQ,eAAgB7vQ,KAAK6vQ,eAAel3Q,KAAKqH,MACzC8vQ,oBAAqB9vQ,KAAK8vQ,oBAAoBn3Q,KAAKqH,MACnD+vQ,sBAAuB/vQ,KAAK+vQ,sBAAsBp3Q,KAAKqH,MACvDgwQ,sBAAuBhwQ,KAAKgwQ,sBAAsBr3Q,KAAKqH,MACvDiwQ,gBAAiBjwQ,KAAKiwQ,gBAAgBt3Q,KAAKqH,MAC3CkwQ,qBAAsBlwQ,KAAKkwQ,qBAAqBv3Q,KAAKqH,MACrDmwQ,uBAAwBnwQ,KAAKmwQ,uBAAuBx3Q,KAAKqH,MACzDowQ,uBAAwBpwQ,KAAKowQ,uBAAuBz3Q,KAAKqH,MACzDqwQ,eAAgBrwQ,KAAKqwQ,eAAe13Q,KAAKqH,MACzCswQ,oBAAqBtwQ,KAAKswQ,oBAAoB33Q,KAAKqH,MACnDuwQ,eAAgBvwQ,KAAKuwQ,eAAe53Q,KAAKqH,MACzCwwQ,oBAAqBxwQ,KAAKwwQ,oBAAoB73Q,KAAKqH,MACnDywQ,qBAAsBzwQ,KAAKywQ,qBAAqB93Q,KAAKqH,MACrD0wQ,kBAAmB1wQ,KAAK0wQ,kBAAkB/3Q,KAAKqH,MAC/C2wQ,aAAc3wQ,KAAK2wQ,aAAah4Q,KAAKqH,MACrC4wQ,cAAe5wQ,KAAK4wQ,cAAcj4Q,KAAKqH,MACvC6wQ,cAAe7wQ,KAAK6wQ,cAAcl4Q,KAAKqH,MACvC8wQ,UAAW9wQ,KAAK8wQ,UAAUn4Q,KAAKqH,OAC9BA,KAAKwuQ,2BAIDxuQ,KAAK+wQ,SAAS9rS,mCAId+6B,KAAK+wQ,SAAS/wQ,KAAKgxQ,OAAS,qBAI5BhxQ,KAAKixQ,eAAersL,IAI7BssL,mBACMhqS,EAAI84B,KAAK+wQ,SAAS9yR,SAElB/W,EAAEjC,OAAS,YACH6zB,MAAAA,WAAiB5xB,EAAEjC,0BAGvBiC,EAAEJ,WACH2F,EAAE0kS,OAAOC,IACZpxQ,KAAK0jJ,MACH1jJ,KAAKssQ,UAAUplS,EAAE09G,IAAI,GAAI19G,EAAE09G,IAAI,gBAG9Bn4G,EAAE0kS,OAAOE,YACZrxQ,KAAK0jJ,MAAM1jJ,KAAKstQ,iBAAiBpmS,EAAE09G,IAAK19G,EAAEjC,oBAEvCwH,EAAE0kS,OAAOG,YACZtxQ,KAAK0jJ,MAAM1jJ,KAAKmuQ,iBAAiBjnS,EAAE09G,IAAK19G,EAAEjC,oBAEvCwH,EAAE0kS,OAAOI,OACRrqS,EAAEk2B,OAAS,EAAI,YACPtE,MAAM,qCAElBkH,KAAK0jJ,MAAM1jJ,KAAKguQ,UAAU9mS,EAAE09G,IAAK19G,EAAEjC,oBAEhCwH,EAAE0kS,OAAOK,UACRtqS,EAAEk2B,OAAS,EAAI,YACPtE,MAAM,qCAElBkH,KAAK0jJ,MAAM1jJ,KAAKkuQ,aAAahnS,EAAE09G,IAAK19G,EAAEjC,oBAEnCwH,EAAE0kS,OAAOM,MACZzxQ,KAAK0jJ,MAAM1jJ,KAAK+tQ,YAAY7mS,EAAE09G,IAAK19G,EAAEjC,SAMrC+6B,KAAKixQ,gBAAkBjxQ,KAAKixQ,eAAenqS,OAAS2F,EAAE0kS,OAAOC,KAC/DpxQ,KAAK0xQ,OAKTA,aACQxqS,EAAI84B,KAAKixQ,eAGX/pS,EAAEjC,OAAS,IAIfiC,EAAEjC,SAGe,IAAbiC,EAAEjC,QACJ+6B,KAAKkxQ,gBAKTxtH,MAAO/pJ,EAAKg4Q,SACJzqS,EAAI84B,KAAKixQ,sBACf/pS,EAAEk2B,SAEMl2B,EAAEJ,WACH2F,EAAE0kS,OAAOM,WACThlS,EAAE0kS,OAAOE,iBACT5kS,EAAE0kS,OAAOG,YACRpqS,EAAEjC,QAAU,EACd+6B,KAAK4xQ,KAAK5xQ,KAAK4xQ,KAAK3sS,OAASiC,EAAEjC,QAAU00B,EAEzCqG,KAAK4xQ,KAAK9mS,KAAK6uB,GAEjBqG,KAAK0xQ,kBAEFjlS,EAAE0kS,OAAOK,OACI,MAAZtqS,EAAE2qS,QACJ7xQ,KAAK4xQ,KAAK1qS,EAAE2qS,QAAUl4Q,EACtBzyB,EAAE2qS,OAAS,KACX7xQ,KAAK0xQ,SAELxqS,EAAE2qS,OAASl4Q,EAEa,iBAAbzyB,EAAE2qS,SAEX3qS,EAAEJ,KAAO2F,EAAE0kS,OAAOI,IAClBrqS,EAAE09G,IAAM27F,EAAMuxF,SAAS5qS,EAAE09G,kBAI1Bn4G,EAAE0kS,OAAOI,IACI,MAAZrqS,EAAE2qS,QACJ7xQ,KAAK4xQ,KAAKnwR,IAAIva,EAAE2qS,OAAQl4Q,GACxBzyB,EAAE2qS,OAAS,KACX7xQ,KAAK0xQ,QAELxqS,EAAE2qS,OAASl4Q,aAGVltB,EAAE0kS,OAAOC,IACZpxQ,KAAK4xQ,KAAK9mS,KAAK6uB,GACVg4Q,GACH3xQ,KAAK0xQ,+BAIG54Q,MAAM,wBAKtBi5Q,cAAelzQ,EAAK/3B,EAAMs8B,GACxBpD,KAAK+wQ,SAAS/wQ,KAAKgxQ,QAAAA,CACjBlqS,KAAMA,EACN7B,OAAQm+B,EACRwhF,IAAK/lF,EACLzB,OAAQ,EACRy0Q,OAAQ,MAKZ5rB,SACEjmP,KAAKgyQ,KAAAA,GACLhyQ,KAAK+wQ,SAAAA,CAAAA,CACHjqS,KAAM2F,EAAE0kS,OAAOM,MACfxsS,QAAS,EACT2/G,IAAK5kF,KAAKgyQ,KACV50Q,OAAQ,EACRy0Q,OAAQ,OAKZvF,UAAWC,EAAW74W,SACdu+W,EAAMjyQ,KAAK0uQ,WAAWnC,UAEvB0F,EAIEA,EAAIv+W,OAHE03W,EAAOmB,EAAW74W,GAMjCs6W,UAAWnvQ,EAAKuE,UACPvE,EAGTqvQ,aAAcrvQ,EAAKuE,UACVvE,EAGTkvQ,YAAanxQ,EAAKwG,UACTxG,EAGT0wQ,iBAAkBxjR,EAAKsZ,UACd6/I,EAAOpxJ,OAAO/H,GAGvByjR,yBAA0Bv4R,EAAOhQ,UAC3BgQ,IAAUhQ,EACLi+K,EAAOO,MAAM,GAGfP,EAAOx5F,KAAKzpD,KAAKwuQ,MAAMppS,MAAM4P,EAAOhQ,IAG7CwnS,UAAW7yQ,UACFA,EAGT8yQ,YAAa/qN,EAAG0iE,UACPm8D,EAAM2xF,WAAWxwN,EAAG0iE,GAG7BsoJ,YAAaC,EAAIC,EAAIC,EAAI5vF,UAChBsD,EAAM4xF,WAAWxF,EAAIC,EAAIC,EAAI5vF,GAGtCiwF,YAAavzQ,UACJA,EAGTyzQ,kBAAmBvmS,EAAGyS,EAAG7M,EAAGmxD,UACnBmwL,EAAQ/8F,KAAAA,CAAMnqJ,EAAGyS,EAAG7M,EAAGmxD,GAAI,GAAG,EAAO,GAAI,GAGlDyvO,kBAAmBxmS,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,UAC/BsmJ,EAAQ/8F,KAAAA,CAAMnqJ,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,GAAI,GAAG,EAAO,GAAI,GAG9DqlM,eAAgBprN,EAAG0iE,UACT,EAAIm8D,EAAM2xF,WAAWxwN,EAAG0iE,GAGlC2oJ,eAAgBJ,EAAIC,EAAIC,EAAI5vF,SACpBv7H,EAAI6+H,EAAM2xF,WAAWvF,EAAIC,GACzBxoJ,EAAIm8D,EAAM2xF,WAAWrF,EAAI5vF,UAE3Bv7H,EAAIj1E,EAAE2lS,cACD3lS,EAAEmiS,QAAQx+O,MAAAA,IAAUi+O,EAAU3sN,GAAG1iI,MAAMytD,EAAE4lS,SAASC,KAAKluJ,KAGxD,GAAM1iE,EAAIj1E,EAAE4lS,QAAWjuJ,GAGjC4oJ,oBACS,EAGTC,qBACS,EAGTW,oBACS,KAGTC,mBAIAL,wBACSnhQ,EAAAA,EAGTohQ,2BACUphQ,EAAAA,EAGVqhQ,mBACS9kH,IAGT+kH,0BAIAQ,iBAAkBrkR,EAAKsZ,UACdtZ,EAAIxf,KAAK,IAGlB8jS,yBAA0Bp5R,EAAOhQ,UAC3BgQ,IAAUhQ,EACL,GAGFg7B,KAAK2gP,QAAQviP,SAAS,OAAQppB,EAAOhQ,GAG9C8oS,uBAAwBn0Q,cACXuyQ,EAAOvyQ,GAKpBk1Q,QAASl1Q,GACPqG,KAAK0jJ,MAAM1jJ,KAAKwsQ,UAAU7yQ,IAG5Bm1Q,UAAWptN,EAAG0iE,GACZpkH,KAAK0jJ,MAAM1jJ,KAAKysQ,YAAY/qN,EAAG0iE,IAGjC4qJ,UAAWrC,EAAIC,EAAIC,EAAI5vF,GACrBj9K,KAAK0jJ,MAAM1jJ,KAAK0sQ,YAAYC,EAAIC,EAAIC,EAAI5vF,IAG1CiyF,UAAWv1Q,GACTqG,KAAK0jJ,MAAM1jJ,KAAKktQ,YAAYvzQ,IAG9Bw1Q,gBAAiBtoS,EAAGyS,EAAG7M,EAAGmxD,GACxB59B,KAAK0jJ,MAAM1jJ,KAAKotQ,kBAAkBvmS,EAAGyS,EAAG7M,EAAGmxD,IAG7CwxO,gBAAiBvoS,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,GACpCznE,KAAK0jJ,MAAM1jJ,KAAKqtQ,kBAAkBxmS,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,IAGzDsnM,aAAcrtN,EAAG0iE,GACfpkH,KAAK0jJ,MAAM1jJ,KAAK8sQ,eAAeprN,EAAG0iE,IAGpC6qJ,aAActC,EAAIC,EAAIC,EAAI5vF,GACxBj9K,KAAK0jJ,MAAM1jJ,KAAK+sQ,eAAeJ,EAAIC,EAAIC,EAAI5vF,IAG7CoyF,WACErvQ,KAAK0jJ,MAAM1jJ,KAAKgtQ,cAGlBsC,YACEtvQ,KAAK0jJ,MAAM1jJ,KAAKitQ,eAGlBuC,WACExvQ,KAAK0jJ,MAAM1jJ,KAAK4tQ,cAGlB2B,gBACEvvQ,KAAK0jJ,MAAM1jJ,KAAK6tQ,mBAGlB4B,eACEzvQ,KAAK0jJ,MAAM1jJ,KAAKwtQ,kBAGlBkC,kBACE1vQ,KAAK0jJ,MAAM1jJ,KAAKytQ,qBAGlBkC,UACE3vQ,KAAK0jJ,MAAM1jJ,KAAK0tQ,aAGlBkC,aACE5vQ,KAAK0jJ,MAAM1jJ,KAAK2tQ,gBAGlBkC,iBACE7vQ,KAAK+xQ,cAAAA,GAAkBtlS,EAAE0kS,OAAOM,OAAQ,GAG1C3B,oBAAqB1sQ,GACnBpD,KAAKuyQ,uBAAuBnvQ,GAG9B2sQ,sBAAuBroE,EAAM4uB,SACrBlzN,EAAMm9K,EAAM2xF,WAAWxqE,EAAM4uB,GACnCt2N,KAAKuyQ,uBAAuBnvQ,GAG9B4sQ,sBAAuBtoE,EAAM4uB,EAAMk8C,EAAMC,SACjCrvQ,EAAMm9K,EAAM4xF,WAAWzqE,EAAM4uB,EAAMk8C,EAAMC,GAC/CzyQ,KAAKuyQ,uBAAuBnvQ,GAG9B6sQ,kBACEjwQ,KAAK0yQ,yBAAyB,GAGhCxC,qBAAsB9sQ,GACpBpD,KAAK0yQ,wBAAwBtvQ,GAG/B+sQ,uBAAwBzoE,EAAM4uB,SACtBlzN,EAAMm9K,EAAM2xF,WAAWxqE,EAAM4uB,GACnCt2N,KAAK0yQ,wBAAwBtvQ,GAG/BgtQ,uBAAwB1oE,EAAM4uB,EAAMk8C,EAAMC,SAClCrvQ,EAAMm9K,EAAM4xF,WAAWzqE,EAAM4uB,EAAMk8C,EAAMC,GAC/CzyQ,KAAK0yQ,wBAAwBtvQ,GAG/BktQ,sBACEtwQ,KAAK+wQ,SAAS/wQ,KAAKgxQ,QAAAA,CACjBlqS,KAAM2F,EAAE0kS,OAAOE,YACfpsS,QAAS,EACT2/G,IAAAA,GACAxnF,OAAQ,EACRy0Q,OAAQ,MAIZxB,eAAgBr7R,EAAOhQ,GACrBg7B,KAAK0jJ,MAAM1jJ,KAAKutQ,yBAAyBv4R,EAAOhQ,IAGlDwrS,sBACExwQ,KAAK+wQ,SAAS/wQ,KAAKgxQ,QAAAA,CACjBlqS,KAAM2F,EAAE0kS,OAAOG,YACfrsS,QAAS,EACT2/G,IAAAA,GACAxnF,OAAQ,EACRy0Q,OAAQ,MAIZtB,eAAgBv7R,EAAOhQ,GACrBg7B,KAAK0jJ,MAAM1jJ,KAAKouQ,yBAAyBp5R,EAAOhQ,IAGlDyrS,qBAAsB92Q,GACpBqG,KAAK0jJ,MAAM1jJ,KAAK8tQ,uBAAuBn0Q,IAGzCg3Q,aAAcnsS,GACZw7B,KAAK+wQ,SAAS/wQ,KAAKgxQ,QAAAA,CACjBlqS,KAAM2F,EAAE0kS,OAAOC,IACfnsS,OAAQ,EACR2/G,IAAAA,CAAMpgH,IAIVosS,cAAelvN,EAAG0iE,GAChBpkH,KAAK2wQ,aAAapwF,EAAM2xF,WAAWxwN,EAAG0iE,IAGxCysJ,cAAelE,EAAIC,EAAIC,EAAI5vF,GACzBj9K,KAAK2wQ,aAAapwF,EAAM4xF,WAAWxF,EAAIC,EAAIC,EAAI5vF,IAGjDyzF,kBAAmBnE,GACjBvsQ,KAAK0jJ,MAAM1jJ,KAAKssQ,UAAUC,IAG5BuE,eACM9wQ,KAAKixQ,eAAehsS,QAAU,YACtB6zB,MAAM,oBAGlBkH,KAAKkxQ,eAGPwB,wBAAyBtvQ,GACX,IAARA,EAKJpD,KAAK+xQ,cAAAA,GAAkBtlS,EAAE0kS,OAAOK,OAAQpuQ,GAJtCpD,KAAK0jJ,MAAM1jJ,KAAKkuQ,aAAAA,KAOpBqE,uBAAwBnvQ,GACV,IAARA,EAKJpD,KAAK+xQ,cAAAA,IAAkBl0Q,MAAMuF,GAAM32B,EAAE0kS,OAAOM,MAAOruQ,GAJjDpD,KAAK0jJ,MAAM1jJ,KAAK+tQ,YAAAA,KAOpBpc,QAAS3iQ,MACkB,IAArBA,EAAMovI,qBACEtlI,MAAM,mBAGlBkH,KAAKimP,SACLjmP,KAAKyuQ,OAAOhtR,IAAIuN,SACV35F,EAAO2qG,KAAK5wB,OAAOH,MAAM+f,EAAMovI,eAEjCp+H,KAAKgxQ,OAAS,EAAA,MACsB,IAA/BhxQ,KAAKixQ,eAAehsS,QACzB+6B,KAAKkxQ,kBAEHlxQ,KAAKgxQ,OAAS,YACNl4Q,MAAM,6BAIhBzjG,EAAO,YACCyjG,MAAM,sBAGO,IAArBkH,KAAKgyQ,KAAK/sS,iBACF6zB,MAAM,mBAMpBqzQ,YAAan9Q,UACXgR,KAAK2xP,QAAQ3iQ,GAENgR,KAAKgyQ,KAAK,GAGnBjG,UAAW/8Q,UACTgR,KAAK2xP,QAAQ3iQ,GAENgR,KAAKgyQ,mBAUChjR,EAAO2tI,GACC,iBAAV3tI,IACTA,EAAQi0J,EAAOx5F,KAAKz6D,EAAO2tI,GAAO,eAG9BzzE,IAAU2iN,EAAAA,CAAU5uQ,KAAMjO,EAAM/pB,SAC3BknS,YAAYn9Q,oBAUPA,EAAO2tI,GACF,iBAAV3tI,IACTA,EAAQi0J,EAAOx5F,KAAKz6D,EAAO2tI,GAAO,eAG9BzzE,IAAU2iN,EAAAA,CAAU5uQ,KAAMjO,EAAM/pB,SAC3B8mS,UAAU/8Q,IAIzB68Q,EAAQM,YAAcN,EAAQznQ,OAE9B/wG,EAAOC,QAAUu4W,qNC9mBL8G,GACV,iBAkDIrE,EACFsE,EAAY,6CACZC,EAAWjtS,KAAKwhL,KAChB0rH,EAAYltS,KAAK6nC,MAEjBslQ,EAAiB,qBACjBC,EAAgBD,EAAiB,yDAEjC11I,EAAO,KACP41I,EAAW,GACX/xD,EAAmB,iBAEnBgyD,EAAAA,CAAY,EAAG,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,MAC7EC,EAAY,IAKZlpH,EAAM,IAioFR,SAAAmpH,EAAkBn/W,OACZkzE,EAAQ,EAAJlzE,SACDA,EAAI,GAAKA,IAAMkzE,EAAIA,EAAIA,EAAI,EAKpC,SAAAksS,EAAuBxsS,WACjBqV,EAAGqpI,EACLp+I,EAAI,EACJmqB,EAAIzqB,EAAE5B,OACN+oC,EAAInnC,EAAE,GAAK,GAENM,EAAImqB,GAAAA,KACTpV,EAAIrV,EAAEM,KAAO,GACbo+I,EAAI0tJ,EAAW/2R,EAAEjX,OACVsgJ,IAAKrpI,EAAI,IAAMA,GACtB8xB,GAAK9xB,MAIFoV,EAAI0c,EAAE/oC,OAA8B,KAAtB+oC,EAAE/1B,aAAaqZ,YAE3B0c,EAAE5oC,MAAM,EAAGksB,EAAI,GAAK,GAK7B,SAAAwgO,EAAiBlkN,EAAGC,OACdhnC,EAAGyS,EACL8jJ,EAAKxvH,EAAEnhC,EACP6mS,EAAKzlQ,EAAEphC,EACPtF,EAAIymC,EAAE1xB,EACNoV,EAAIuc,EAAE3xB,EACN7nF,EAAIu5G,EAAE75G,EACNg1F,EAAI8kB,EAAE95G,MAGHozE,IAAMmqB,EAAAA,OAAU,QAErBzqB,EAAIu2J,IAAOA,EAAG,GACd9jJ,EAAIg6R,IAAOA,EAAG,GAGVzsS,GAAKyS,EAAAA,OAAUzS,EAAIyS,EAAI,GAAKgY,EAAInqB,KAGhCA,GAAKmqB,EAAAA,OAAUnqB,KAEnBN,EAAIM,EAAI,EACRmS,EAAIjlF,GAAK00F,GAGJq0I,IAAOk2I,EAAAA,OAAWh6R,EAAI,GAAK8jJ,EAAKv2J,EAAI,GAAK,MAGzCyS,EAAAA,OAAUjlF,EAAI00F,EAAIliB,EAAI,GAAK,MAEhCyqB,GAAKj9F,EAAI+oO,EAAGn4J,SAAW8jB,EAAIuqR,EAAGruS,QAAU5wE,EAAI00F,EAGvC5hB,EAAI,EAAGA,EAAImqB,EAAGnqB,IAAAA,GAASi2J,EAAGj2J,IAAMmsS,EAAGnsS,GAAAA,OAAWi2J,EAAGj2J,GAAKmsS,EAAGnsS,GAAKN,EAAI,GAAK,SAGrExyE,GAAK00F,EAAI,EAAI10F,EAAI00F,EAAIliB,EAAI,GAAK,EAOvC,SAAA0sS,EAAkBt/W,EAAGgmG,EAAKt0B,EAAK9yE,MACzBoB,EAAIgmG,GAAOhmG,EAAI0xE,GAAO1xE,IAAM6+W,EAAU7+W,SAClC6kG,MACJi6Q,GAAkBlgX,GAAQ,aAA2B,iBAALoB,EAC7CA,EAAIgmG,GAAOhmG,EAAI0xE,EAAM,kBAAoB,oBACzC,6BAA+BU,OAAOpyE,IAM/C,SAAAs6R,EAAet6R,OACTI,EAAIJ,EAAEw4E,EAAExH,OAAS,SACdmuS,EAASn/W,EAAEF,EAAIk/W,IAAa5+W,GAAKJ,EAAEw4E,EAAEp4E,GAAK,GAAK,EAIxD,SAAAm/W,EAAuBh+Q,EAAKzhG,UAClByhG,EAAIvwB,OAAS,EAAIuwB,EAAI+C,OAAO,GAAK,IAAM/C,EAAIpwB,MAAM,GAAKowB,IAC5DzhG,EAAI,EAAI,IAAM,MAAQA,EAI1B,SAAA0/W,EAAsBj+Q,EAAKzhG,EAAGwxN,OACxBniH,EAAKioM,KAGLt3S,EAAI,EAAA,KAGDs3S,EAAK9lF,EAAI,MAAOxxN,EAAGs3S,GAAM9lF,GAC9B/vH,EAAM61M,EAAK71M,YAOLzhG,GAHNqvG,EAAM5N,EAAIvwB,QAGAm+B,KACHioM,EAAK9lF,EAAGxxN,GAAKqvG,IAAOrvG,EAAGs3S,GAAM9lF,GAClC/vH,GAAO61M,OACEt3S,EAAIqvG,IACb5N,EAAMA,EAAIpwB,MAAM,EAAGrxE,GAAK,IAAMyhG,EAAIpwB,MAAMrxE,WAIrCyhG,GAOT84Q,EAvvFA,SAAAj5O,EAAeq+O,OACTpgH,EAAKqgH,EAAaC,EA0kBhBC,EAMAC,EAwqBAC,EACFC,EACAC,EACAC,EACAC,EA3vCFxvJ,EAAI2pJ,EAAU3wQ,UAAAA,CAAcgP,YAAa2hQ,EAAWlwQ,SAAU,KAAM0wN,QAAS,MAC7Ej+C,EAAAA,IAAUy9F,EAAU,GAUpB8F,EAAiB,GAajBC,EAAgB,EAMhBC,GAAc,EAIdC,EAAa,GAMbC,GAAW,IAKXC,EAAU,IAGVC,GAAS,EAkBTC,EAAc,EAIdC,EAAgB,EAGhBC,EAAAA,CACElqR,OAAQ,GACR6pM,UAAW,EACXsgF,mBAAoB,EACpBC,eAAgB,IAChBC,iBAAkB,IAClBC,kBAAmB,EACnBC,uBAAwB,IACxBC,OAAQ,IAMVj4I,EAAW,uCAgBb,SAAAoxI,EAAmBxpM,EAAGxrF,OAChBolJ,EAAUjyJ,EAAG2oS,EAAarhX,EAAGozE,EAAGkuS,EAAOjyQ,EAAK5N,EAC9CoY,EAAI5N,UAGA4N,aAAa0gQ,GAAAA,OAAAA,IAAuBA,EAAUxpM,EAAGxrF,MAE9C,MAALA,EAAK,IAEHwrF,IAAwB,IAAnBA,EAAEwwM,oBACT1nQ,EAAE1xB,EAAI4oF,EAAE5oF,QAEH4oF,EAAEr4F,GAAKq4F,EAAE/wK,EAAI0gX,EAChB7mQ,EAAEnhC,EAAImhC,EAAE75G,EAAI,KACH+wK,EAAE/wK,EAAIygX,EACf5mQ,EAAEnhC,EAAAA,CAAKmhC,EAAE75G,EAAI,IAEb65G,EAAE75G,EAAI+wK,EAAE/wK,EACR65G,EAAEnhC,EAAIq4F,EAAEr4F,EAAErH,cAMTiwS,EAAoB,iBAALvwM,IAAsB,EAAJA,GAAS,EAAA,IAG7Cl3D,EAAE1xB,EAAI,EAAI4oF,EAAI,GAAKA,GAAKA,GAAI,GAAK,EAG7BA,MAAQA,EAAAA,KACL/wK,EAAI,EAAGozE,EAAI29F,EAAG39F,GAAK,GAAIA,GAAK,GAAIpzE,iBAEjCA,EAAI0gX,EACN7mQ,EAAEnhC,EAAImhC,EAAE75G,EAAI,MAEZ65G,EAAE75G,EAAIA,EACN65G,EAAEnhC,EAAAA,CAAKq4F,KAMXtvE,EAAMnvB,OAAOy+F,YAGR8tM,EAAUntS,KAAK+vB,EAAMnvB,OAAOy+F,IAAAA,OAAY8uM,EAAahmQ,EAAGpY,EAAK6/Q,GAElEznQ,EAAE1xB,EAAyB,IAArBsZ,EAAIvd,WAAW,IAAYud,EAAMA,EAAIpwB,MAAM,IAAK,GAAK,GAIxDrxE,EAAIyhG,EAAIhqB,QAAQ,OAAS,IAAGgqB,EAAMA,EAAItc,QAAQ,IAAK,MAGnD/R,EAAIquB,EAAIyW,OAAO,OAAS,GAGvBl4G,EAAI,IAAGA,EAAIozE,GACfpzE,IAAMyhG,EAAIpwB,MAAM+B,EAAI,GACpBquB,EAAMA,EAAIsG,UAAU,EAAG30B,IACdpzE,EAAI,IAGbA,EAAIyhG,EAAIvwB,gBAMVsuS,EAASj6R,EAAG,EAAG4jJ,EAASj4J,OAAQ,QAIvB,IAALqU,SAEK60B,EADPP,EAAAA,IAAQ0gQ,EAAUxpM,GACFsvM,EAAiBxmQ,EAAE75G,EAAI,EAAGsgX,MAG5C7+Q,EAAMnvB,OAAOy+F,GAETuwM,EAAoB,iBAALvwM,EAAK,IAGd,EAAJA,GAAS,EAAA,OAAU8uM,EAAahmQ,EAAGpY,EAAK6/Q,EAAO/7R,MAEnDs0B,EAAE1xB,EAAI,EAAI4oF,EAAI,GAAKtvE,EAAMA,EAAIpwB,MAAM,IAAK,GAAK,EAGzCkpS,EAAUiH,OAAS//Q,EAAItc,QAAQ,YAAa,IAAIjU,OAAS,SACrD6zB,MACJk6Q,EAAgBluM,QAGpBl3D,EAAE1xB,EAA0B,KAAtBsZ,EAAIvd,WAAW,IAAaud,EAAMA,EAAIpwB,MAAM,IAAK,GAAK,MAG9Ds5J,EAAWxB,EAAS93J,MAAM,EAAGkU,GAC7BvlF,EAAIozE,EAAI,EAIHi8B,EAAM5N,EAAIvwB,OAAQkC,EAAIi8B,EAAKj8B,OAC1Bu3J,EAASlzJ,QAAQiB,EAAI+oB,EAAI+C,OAAOpxB,IAAM,EAAA,IAC/B,KAALsF,MAGEtF,EAAIpzE,EAAAA,CACNA,EAAIqvG,qBAGIgyQ,IAGN5/Q,GAAOA,EAAIE,gBAAkBF,EAAMA,EAAIpsB,gBACvCosB,GAAOA,EAAIpsB,gBAAkBosB,EAAMA,EAAIE,gBAAAA,CACzC0/Q,GAAc,EACdjuS,GAAK,EACLpzE,EAAI,kBAKD6/W,EAAahmQ,EAAGvnC,OAAOy+F,GAAIuwM,EAAO/7R,GAK7C+7R,GAAQ,GAIHthX,GAHLyhG,EAAMm+Q,EAAYn+Q,EAAKlc,EAAG,GAAIs0B,EAAE1xB,IAGnB1Q,QAAQ,OAAS,EAAGgqB,EAAMA,EAAItc,QAAQ,IAAK,IACnDnlF,EAAIyhG,EAAIvwB,WAIVkC,EAAI,EAAyB,KAAtBquB,EAAIvd,WAAW9Q,GAAWA,SAGjCi8B,EAAM5N,EAAIvwB,OAAkC,KAA1BuwB,EAAIvd,aAAamrB,QAEpC5N,EAAMA,EAAIpwB,MAAM+B,IAAKi8B,GAAAA,IACvBA,GAAOj8B,EAGHkuS,GAAS/G,EAAUiH,OACrBnyQ,EAAM,KAAO0hE,EAAIo8I,GAAoBp8I,IAAMguM,EAAUhuM,UAC7ChsE,MACJk6Q,EAAiBplQ,EAAE1xB,EAAI4oF,OAIxB/wK,EAAIA,EAAIozE,EAAI,GAAKstS,EAGpB7mQ,EAAEnhC,EAAImhC,EAAE75G,EAAI,aAGHA,EAAIygX,EAGb5mQ,EAAEnhC,EAAAA,CAAKmhC,EAAE75G,EAAI,WAEb65G,EAAE75G,EAAIA,EACN65G,EAAEnhC,EAAAA,GAMFtF,GAAKpzE,EAAI,GAAKk/W,EACVl/W,EAAI,IAAGozE,GAAK8rS,GAEZ9rS,EAAIi8B,EAAAA,KACFj8B,GAAGymC,EAAEnhC,EAAE3B,MAAM0qB,EAAIpwB,MAAM,EAAG+B,IAEzBi8B,GAAO6vQ,EAAU9rS,EAAIi8B,GACxBwK,EAAEnhC,EAAE3B,MAAM0qB,EAAIpwB,MAAM+B,EAAGA,GAAK8rS,IAG9B9rS,EAAI8rS,GAAYz9Q,EAAMA,EAAIpwB,MAAM+B,IAAIlC,YAEpCkC,GAAKi8B,OAGAj8B,IAAKquB,GAAO,KACnBoY,EAAEnhC,EAAE3B,MAAM0qB,SAKZoY,EAAEnhC,EAAAA,CAAKmhC,EAAE75G,EAAI,GA41BjB,SAAAijO,EAAgB/iO,EAAGkzE,EAAG6hS,EAAI/kR,OACpB6jO,EAAI/zT,EAAGm9H,EAAI9tB,EAAK5N,KAEV,MAANwzQ,EAAYA,EAAKqL,EAChBd,EAASvK,EAAI,EAAG,IAEhB/0W,EAAEw4E,EAAAA,OAAUx4E,EAAEmqG,cAEnB0pN,EAAK7zT,EAAEw4E,EAAE,GACTykD,EAAKj9H,EAAEF,EAEE,MAALozE,EACFquB,EAAM69Q,EAAcp/W,EAAEw4E,GACtB+oB,EAAY,GAANvR,GAAiB,GAANA,IAAYitC,GAAMojP,GAAcpjP,GAAMqjP,GACpDf,EAAch+Q,EAAK07B,GACnBuiP,EAAaj+Q,EAAK07B,EAAI,aAKzBn9H,GAHAE,EAAIk6G,EAAAA,IAAUmgQ,EAAUr6W,GAAIkzE,EAAG6hS,IAGzBj1W,EAGNqvG,GADA5N,EAAM69Q,EAAcp/W,EAAEw4E,IACZxH,OAOA,GAANgf,GAAiB,GAANA,IAAY9c,GAAKpzE,GAAKA,GAAKugX,GAAAA,MAGjClxQ,EAAMj8B,EAAGquB,GAAO,IAAK4N,KAC5B5N,EAAMg+Q,EAAch+Q,EAAKzhG,WAIzBozE,GAAK+pD,EACL17B,EAAMi+Q,EAAaj+Q,EAAKzhG,EAAG,KAGvBA,EAAI,EAAIqvG,QACJj8B,EAAI,EAAA,IAAQquB,GAAO,IAAKruB,IAAKquB,GAAO,eAE1CruB,GAAKpzE,EAAIqvG,GACD,MACFrvG,EAAI,GAAKqvG,IAAK5N,GAAO,KAClBruB,IAAKquB,GAAO,YAMpBvhG,EAAEioF,EAAI,GAAK4rO,EAAK,IAAMtyN,EAAMA,EAKrC,SAAAggR,EAAkBp/R,EAAMgnD,WAClBnpI,EACFkzE,EAAI,EACJ+X,EAAAA,IAAQovR,EAAUl4R,EAAK,IAElBjP,EAAIiP,EAAKnR,OAAQkC,IAAAA,MACtBlzE,EAAAA,IAAQq6W,EAAUl4R,EAAKjP,KAGhB+U,EAAAA,CACLgD,EAAIjrF,QAEKmpI,EAAOx/B,KAAK1e,EAAGjrF,KACxBirF,EAAIjrF,UAIDirF,EAQT,SAAAu2R,EAAmBxhX,EAAGw4E,EAAG14E,WACnBozE,EAAI,EACNmqB,EAAI7kB,EAAExH,QAGAwH,IAAI6kB,GAAI7kB,EAAEwR,WAGbqT,EAAI7kB,EAAE,GAAI6kB,GAAK,GAAIA,GAAK,GAAInqB,YAG5BpzE,EAAIozE,EAAIpzE,EAAIk/W,EAAW,GAAKwB,EAG/BxgX,EAAEw4E,EAAIx4E,EAAEF,EAAI,KAGHA,EAAIygX,EAGbvgX,EAAEw4E,EAAAA,CAAKx4E,EAAEF,EAAI,IAEbE,EAAEF,EAAIA,EACNE,EAAEw4E,EAAIA,GAGDx4E,EA0DT,SAAAk6G,EAAeP,EAAG8nQ,EAAI1M,EAAIh7P,OACpB4vB,EAAGz2D,EAAGmqB,EAAGj9F,EAAGJ,EAAGg8H,EAAI0lP,EACrBv4I,EAAKxvH,EAAEnhC,EACPmpS,EAAS1C,KAGP91I,EAAAA,CAQFr8F,EAAAA,KAGOnD,EAAI,EAAGvpI,EAAI+oO,EAAG,GAAI/oO,GAAK,GAAIA,GAAK,GAAIupI,SACzCz2D,EAAIuuS,EAAK93O,GAGD,EACNz2D,GAAK8rS,EACL3hR,EAAIokR,EAIJC,GAHA1hX,EAAImpO,EAAGntG,EAAK,IAGH2lP,EAAOh4O,EAAItsC,EAAI,GAAK,GAAK,WAElC2+B,EAAK4iP,GAAU1rS,EAAI,GAAK8rS,KAEd71I,EAAGn4J,OAAAA,KAEP+oC,QASI+yB,OANCq8F,EAAGn4J,QAAUgrD,EAAImtG,EAAGtyJ,KAAK,IAChC72E,EAAI0hX,EAAK,EACT/3O,EAAI,EAEJtsC,GADAnqB,GAAK8rS,GACGA,EAAW,WAKrBh/W,EAAII,EAAI+oO,EAAGntG,GAGN2N,EAAI,EAAGvpI,GAAK,GAAIA,GAAK,GAAIupI,KAU9B+3O,GAHArkR,GAJAnqB,GAAK8rS,GAIGA,EAAWr1O,GAGV,EAAI,EAAI3pI,EAAI2hX,EAAOh4O,EAAItsC,EAAI,GAAK,GAAK,KAIlD0c,EAAIA,GAAK0nQ,EAAK,GAKC,MAAdt4I,EAAGntG,EAAK,KAAe3+B,EAAI,EAAIr9F,EAAIA,EAAI2hX,EAAOh4O,EAAItsC,EAAI,IAEvD0c,EAAIg7P,EAAK,GACL2M,GAAM3nQ,KAAa,GAANg7P,GAAWA,IAAOp7P,EAAE1xB,EAAI,EAAI,EAAI,IAC9Cy5R,EAAK,GAAW,GAANA,IAAkB,GAAN3M,GAAWh7P,GAAW,GAANg7P,IAGrC7hS,EAAI,EAAImqB,EAAI,EAAIr9F,EAAI2hX,EAAOh4O,EAAItsC,GAAK,EAAI8rI,EAAGntG,EAAK,IAAM,GAAM,GAC7D+4O,IAAOp7P,EAAE1xB,EAAI,EAAI,EAAI,IAEpBw5R,EAAK,IAAMt4I,EAAG,UAChBA,EAAGn4J,OAAS,EAER+oC,GAGF0nQ,GAAM9nQ,EAAE75G,EAAI,EAGZqpO,EAAG,GAAKw4I,GAAQ3C,EAAWyC,EAAKzC,GAAYA,GAC5CrlQ,EAAE75G,GAAK2hX,GAAM,GAIbt4I,EAAG,GAAKxvH,EAAE75G,EAAI,EAGT65G,KAIA,GAALzmC,GACFi2J,EAAGn4J,OAASgrD,EACZ57H,EAAI,EACJ47H,MAEAmtG,EAAGn4J,OAASgrD,EAAK,EACjB57H,EAAIuhX,EAAO3C,EAAW9rS,GAItBi2J,EAAGntG,GAAM3+B,EAAI,EAAIwhR,EAAU7+W,EAAI2hX,EAAOh4O,EAAItsC,GAAKskR,EAAOtkR,IAAMj9F,EAAI,GAI9D25G,aAKU,GAANiiB,EAAM,KAGH9oD,EAAI,EAAGmqB,EAAI8rI,EAAG,GAAI9rI,GAAK,GAAIA,GAAK,GAAInqB,SACzCmqB,EAAI8rI,EAAG,IAAM/oO,EACRA,EAAI,EAAGi9F,GAAK,GAAIA,GAAK,GAAIj9F,KAG1B8yE,GAAK9yE,IACPu5G,EAAE75G,IACEqpO,EAAG,IAAMC,IAAMD,EAAG,GAAK,aAK7BA,EAAGntG,IAAO57H,EACN+oO,EAAGntG,IAAOotG,EAAAA,MACdD,EAAGntG,KAAQ,EACX57H,EAAI,MAML8yE,EAAIi2J,EAAGn4J,OAAoB,IAAZm4J,IAAKj2J,GAAUi2J,EAAGn/I,QAIpC2vB,EAAE75G,EAAI0gX,EACR7mQ,EAAEnhC,EAAImhC,EAAE75G,EAAI,KAGH65G,EAAE75G,EAAIygX,IACf5mQ,EAAEnhC,EAAAA,CAAKmhC,EAAE75G,EAAI,WAIV65G,EAIT,SAAAkhN,EAAiB76T,OACXuhG,EACFzhG,EAAIE,EAAEF,SAEE,OAANA,EAAmBE,EAAEmqG,YAEzB5I,EAAM69Q,EAAcp/W,EAAEw4E,GAEtB+oB,EAAMzhG,GAAKugX,GAAcvgX,GAAKwgX,EAC1Bf,EAAch+Q,EAAKzhG,GACnB0/W,EAAaj+Q,EAAKzhG,EAAG,KAElBE,EAAEioF,EAAI,EAAI,IAAMsZ,EAAMA,UAtqC/B84Q,EAAUj5O,MAAQA,EAElBi5O,EAAUuH,SAAW,EACrBvH,EAAUwH,WAAa,EACvBxH,EAAUyH,WAAa,EACvBzH,EAAU0H,YAAc,EACxB1H,EAAU2H,cAAgB,EAC1B3H,EAAU4H,gBAAkB,EAC5B5H,EAAU6H,gBAAkB,EAC5B7H,EAAU8H,gBAAkB,EAC5B9H,EAAU+H,iBAAmB,EAC7B/H,EAAUgI,OAAS,EAqCnBhI,EAAU/zR,OAAS+zR,EAAU7sR,IAAM,SAAUod,OACvC33B,EAAG49F,KAEI,MAAPjmE,EAAO,IAES,iBAAPA,QA2HH/F,MACJi6Q,EAAiB,oBAAsBl0Q,MAxHrCA,EAAIrE,eAAetzB,EAAI,oBAEzBqsS,EADAzuM,EAAIjmE,EAAI33B,GACI,EAAG+iL,EAAK/iL,GACpBktS,EAAiBtvM,GAKfjmE,EAAIrE,eAAetzB,EAAI,mBAEzBqsS,EADAzuM,EAAIjmE,EAAI33B,GACI,EAAG,EAAGA,GAClBmtS,EAAgBvvM,GAOdjmE,EAAIrE,eAAetzB,EAAI,qBACzB49F,EAAIjmE,EAAI33B,KACC49F,EAAE7mF,KACTs1R,EAASzuM,EAAE,IAAKmlF,EAAK,EAAG/iL,GACxBqsS,EAASzuM,EAAE,GAAI,EAAGmlF,EAAK/iL,GACvBotS,EAAaxvM,EAAE,GACfyvM,EAAazvM,EAAE,KAEfyuM,EAASzuM,GAAImlF,EAAKA,EAAK/iL,GACvBotS,IAAeC,EAAazvM,EAAI,GAAKA,EAAIA,KAOzCjmE,EAAIrE,eAAetzB,EAAI,aACzB49F,EAAIjmE,EAAI33B,KACC49F,EAAE7mF,IACTs1R,EAASzuM,EAAE,IAAKmlF,GAAM,EAAG/iL,GACzBqsS,EAASzuM,EAAE,GAAI,EAAGmlF,EAAK/iL,GACvBstS,EAAU1vM,EAAE,GACZ2vM,EAAU3vM,EAAE,WAEZyuM,EAASzuM,GAAImlF,EAAKA,EAAK/iL,IACnB49F,QAGIhsE,MACJi6Q,EAAiB7rS,EAAI,oBAAsB49F,GAH7C0vM,IAAYC,EAAU3vM,EAAI,GAAKA,EAAIA,MAWrCjmE,EAAIrE,eAAetzB,EAAI,UAAA,KACzB49F,EAAIjmE,EAAI33B,QACI49F,QAcJhsE,MACJi6Q,EAAiB7rS,EAAI,uBAAyB49F,MAd5CA,EAAAA,IACmB,oBAAVkpD,SAAyBA,SAClCA,OAAO69C,kBAAmB79C,OAAO+gD,kBAGjC2lG,GAAU5vM,EACJhsE,MACJi6Q,EAAiB,sBAJnB2B,EAAS5vM,OAOX4vM,EAAS5vM,KAUXjmE,EAAIrE,eAAetzB,EAAI,iBAEzBqsS,EADAzuM,EAAIjmE,EAAI33B,GACI,EAAG,EAAGA,GAClBytS,EAAc7vM,GAKZjmE,EAAIrE,eAAetzB,EAAI,mBAEzBqsS,EADAzuM,EAAIjmE,EAAI33B,GACI,EAAG+iL,EAAK/iL,GACpB0tS,EAAgB9vM,GAKdjmE,EAAIrE,eAAetzB,EAAI,UAAA,IAET,iBADhB49F,EAAIjmE,EAAI33B,IAC2B49F,MACxBhsE,MACTi6Q,EAAiB7rS,EAAI,mBAAqB49F,GAFlB+vM,EAAS/vM,KAOjCjmE,EAAIrE,eAAetzB,EAAI,YAAA,IAKT,iBAJhB49F,EAAIjmE,EAAI33B,KAIQ,wBAAqCzB,KAAKq/F,SAGlDhsE,MACJi6Q,EAAiB7rS,EAAI,aAAe49F,GAHtCo4D,EAAWp4D,UAgBjBsvM,eAAgBA,EAChBC,cAAeA,EACfkC,eAAAA,CAAiBjC,EAAYC,GAC7BiC,MAAAA,CAAQhC,EAASC,GACjBC,OAAQA,EACRC,YAAaA,EACbC,cAAeA,EACfC,OAAQA,EACR33I,SAAUA,IAcdoxI,EAAUmI,YAAc,SAAU3xM,OAC3BA,IAAwB,IAAnBA,EAAEwwM,aAAiB,OAAa,MACrChH,EAAUiH,MAAAA,OAAc,MAEzBpuS,EAAGlzE,EACLw4E,EAAIq4F,EAAEr4F,EACN14E,EAAI+wK,EAAE/wK,EACNmoF,EAAI4oF,EAAE5oF,EAER6kD,EAAAA,GAAgC,kBAAhCA,GAAY3iC,SAASR,KAAKnxB,QAEb,IAANyP,IAAkB,IAAPA,IAAanoF,IAAMk2P,GAAOl2P,GAAKk2P,GAAOl2P,IAAM++W,EAAU/+W,GAAAA,IAGvD,IAAT04E,EAAE,GAAO,IACD,IAAN14E,GAAwB,IAAb04E,EAAExH,OAAW,OAAU,QAChC87D,MAIR55D,GAAKpzE,EAAI,GAAKk/W,GACN,IAAG9rS,GAAK8rS,GAIZ5sS,OAAOoG,EAAE,IAAIxH,QAAUkC,EAAAA,KAEpBA,EAAI,EAAGA,EAAIsF,EAAExH,OAAQkC,QACxBlzE,EAAIw4E,EAAEtF,IACE,GAAKlzE,GAAKopO,GAAQppO,IAAM6+W,EAAU7+W,GAAAA,MAAU8sI,KAI5C,IAAN9sI,EAAM,OAAU,YAKT,OAANw4E,GAAoB,OAAN14E,IAAqB,OAANmoF,GAAoB,IAANA,IAAkB,IAAPA,UACxD,QAGH4c,MACHi6Q,EAAiB,sBAAwBjuM,IAS9CwpM,EAAUoI,QAAUpI,EAAU3oS,IAAM,kBAC3B6vS,EAASn/R,UAAWsuI,EAAEztN,KAS/Bo3W,EAAUqI,QAAUrI,EAAUr0Q,IAAM,kBAC3Bu7Q,EAASn/R,UAAWsuI,EAAE3tN,KAc/Bs3W,EAAUlgQ,QACJylQ,EAAU,iBAMVC,EAAkBluS,KAAKwoC,SAAWylQ,EAAW,QAC9C,kBAAqBf,EAAUltS,KAAKwoC,SAAWylQ,IAC/C,kBAAyD,SAAlB,WAAhBjuS,KAAKwoC,SAAwB,IACnC,QAAhBxoC,KAAKwoC,SAAsB,IAExB,SAAUk8K,OACXzjN,EAAGyS,EAAGvlF,EAAGM,EAAGywK,EACd39F,EAAI,EACJsF,EAAAA,GACAukN,EAAAA,IAAWs9E,EAAUz9F,MAEb,MAANyZ,EAAYA,EAAK8pF,EAChBb,EAASjpF,EAAI,EAAGrgC,GAErB51P,EAAIw+W,EAASvoF,EAAK2oF,GAEdyB,KAGE1mJ,OAAO69C,gBAAAA,KAEThlM,EAAImnJ,OAAO69C,gBAAAA,IAAoB6C,YAAYr6Q,GAAK,IAEzC8yE,EAAI9yE,IAQTywK,EAAW,OAAPj+F,EAAEM,IAAgBN,EAAEM,EAAI,KAAO,MAM1B,MACPmS,EAAI00I,OAAO69C,gBAAAA,IAAoB6C,YAAY,IAC3C7nM,EAAEM,GAAKmS,EAAE,GACTzS,EAAEM,EAAI,GAAKmS,EAAE,KAKb7M,EAAE3B,KAAKg6F,EAAI,MACX39F,GAAK,GAGTA,EAAI9yE,EAAI,WAGC25N,OAAO+gD,kBA0BhB2lG,GAAS,EACH57Q,MACJi6Q,EAAiB,0BAzBnBlsS,EAAImnJ,OAAO+gD,YAAY16Q,GAAK,GAErB8yE,EAAI9yE,IAMTywK,EAAmB,iBAAN,GAAPj+F,EAAEM,IAA0C,cAAXN,EAAEM,EAAI,GAC9B,WAAXN,EAAEM,EAAI,GAAgC,SAAXN,EAAEM,EAAI,IACjCN,EAAEM,EAAI,IAAM,KAAON,EAAEM,EAAI,IAAM,GAAKN,EAAEM,EAAI,KAErC,KACP6mJ,OAAO+gD,YAAY,GAAG9xQ,KAAK4pE,EAAGM,IAI9BsF,EAAE3B,KAAKg6F,EAAI,MACX39F,GAAK,GAGTA,EAAI9yE,EAAI,MASPqgX,OAEIvtS,EAAI9yE,IACTywK,EAAIgvM,KACI,OAAMrnS,EAAEtF,KAAO29F,EAAI,UAI/BzwK,EAAIo4E,IAAItF,GACRmjN,GAAM2oF,EAGF5+W,GAAKi2R,IACPxlH,EAAIouM,EAASD,EAAW3oF,GACxB79M,EAAEtF,GAAK2rS,EAAUz+W,EAAIywK,GAAKA,GAIZ,IAATr4F,EAAEtF,GAAUsF,EAAEwR,MAAO9W,QAGxBA,EAAI,EACNsF,EAAAA,CAAK14E,EAAI,YAIJA,GAAK,EAAa,IAAT04E,EAAE,GAAUA,EAAEhC,OAAO,EAAG,GAAI12E,GAAKk/W,OAG1C9rS,EAAI,EAAG29F,EAAIr4F,EAAE,GAAIq4F,GAAK,GAAIA,GAAK,GAAI39F,KAGpCA,EAAI8rS,IAAUl/W,GAAKk/W,EAAW9rS,UAGpC6pN,EAAKj9R,EAAIA,EACTi9R,EAAKvkN,EAAIA,EACFukN,IAUXs9E,EAAUn+O,IAAM,mBACVhpD,EAAI,EACNiP,EAAOC,UACP85C,EAAAA,IAAUm+O,EAAUl4R,EAAK,IACpBjP,EAAIiP,EAAKnR,QAASkrD,EAAMA,EAAImiP,KAAKl8R,EAAKjP,aACtCgpD,GAQTwjP,EAAAA,eACM/hQ,EAAU,aAOd,SAAAglQ,EAAmBphR,EAAKqhR,EAAQC,EAASp4I,WACnCptI,EAEFylR,EADAn6Q,EAAAA,CAAO,GAEPz1B,EAAI,EACJi8B,EAAM5N,EAAIvwB,OAELkC,EAAIi8B,GAAAA,KACJ2zQ,EAAOn6Q,EAAI33B,OAAQ8xS,IAAQn6Q,EAAIm6Q,IAASF,OAE7Cj6Q,EAAI,IAAM8hI,EAASlzJ,QAAQgqB,EAAI+C,OAAOpxB,MAEjCmqB,EAAI,EAAGA,EAAIsL,EAAI33B,OAAQqsB,IAEtBsL,EAAItL,GAAKwlR,EAAU,IACH,MAAdl6Q,EAAItL,EAAI,KAAYsL,EAAItL,EAAI,GAAK,GACrCsL,EAAItL,EAAI,IAAMsL,EAAItL,GAAKwlR,EAAU,EACjCl6Q,EAAItL,IAAMwlR,UAKTl6Q,EAAIsjH,iBAMN,SAAU1qH,EAAKqhR,EAAQC,EAASxuH,EAAM0uH,OACvCt4I,EAAU9gG,EAAG7pI,EAAGM,EAAG25G,EAAGJ,EAAGwvH,EAAIvvH,EAC/B1mC,EAAIquB,EAAIhqB,QAAQ,KAChB8+M,EAAK8pF,EACLpL,EAAKqL,MAGHltS,GAAK,IACP9yE,EAAIugX,EAGJA,EAAgB,EAChBp/Q,EAAMA,EAAItc,QAAQ,IAAK,IAEvB00B,GADAC,EAAAA,IAAQygQ,EAAUuI,IACZx3I,IAAI7pI,EAAIvwB,OAASkC,GACvBytS,EAAgBvgX,EAKhBw5G,EAAEphC,EAAImqS,EAAUnD,EAAaJ,EAAczlQ,EAAEnhC,GAAImhC,EAAE75G,EAAG,KACrD,GAAI+iX,EAASllQ,GACd/D,EAAE95G,EAAI85G,EAAEphC,EAAExH,QAUZlxE,EAAIM,GALJ+oO,EAAKw5I,EAAUphR,EAAKqhR,EAAQC,EAASE,GACjCt4I,EAAWxB,EAAUtrH,IACrB8sH,EAAW9sH,EAASsrH,KAGbj4J,OAGO,GAAXm4J,IAAK/oO,GAAS+oO,EAAGn/I,WAGnBm/I,EAAG,GAAA,OAAWsB,EAASnmI,OAAO,MAG/BpxB,EAAI,IACJpzE,GAEF65G,EAAEnhC,EAAI2wJ,EACNxvH,EAAE75G,EAAIA,EAGN65G,EAAE1xB,EAAIosK,EAENlrB,GADAxvH,EAAI0lJ,EAAI1lJ,EAAGC,EAAGy8K,EAAI0+E,EAAI8N,IACfrqS,EACPuhC,EAAIJ,EAAEI,EACNj6G,EAAI65G,EAAE75G,GASRozE,EAAIi2J,EAHJx/F,EAAI7pI,EAAIu2R,EAAK,GAObj2R,EAAIyiX,EAAU,EACd9oQ,EAAIA,GAAK4vB,EAAI,GAAkB,MAAbw/F,EAAGx/F,EAAI,GAEzB5vB,EAAIg7P,EAAK,GAAU,MAAL7hS,GAAa6mC,KAAa,GAANg7P,GAAWA,IAAOp7P,EAAE1xB,EAAI,EAAI,EAAI,IAC1D/U,EAAI9yE,GAAK8yE,GAAK9yE,IAAW,GAAN20W,GAAWh7P,GAAW,GAANg7P,GAAuB,EAAZ5rI,EAAGx/F,EAAI,IACtDorO,IAAOp7P,EAAE1xB,EAAI,EAAI,EAAI,IAKxB0hD,EAAI,IAAMw/F,EAAG,GAGf5nI,EAAMwY,EAAIylQ,EAAa/0I,EAASnmI,OAAO,IAAK+xL,EAAI5rD,EAASnmI,OAAO,IAAMmmI,EAASnmI,OAAO,WAItF6kI,EAAGn4J,OAAS24D,EAGR5vB,QAGK8oQ,IAAW15I,IAAKx/F,GAAKk5O,GAC1B15I,EAAGx/F,GAAK,EAEHA,MACD7pI,EACFqpO,EAAAA,CAAM,GAAGvrI,OAAOurI,QAMjB/oO,EAAI+oO,EAAGn4J,QAASm4J,IAAK/oO,SAGrB8yE,EAAI,EAAGquB,EAAM,GAAIruB,GAAK9yE,EAAGmhG,GAAOkpI,EAASnmI,OAAO6kI,EAAGj2J,OAGxDquB,EAAMi+Q,EAAaj+Q,EAAKzhG,EAAG2qO,EAASnmI,OAAO,WAItC/C,GAjJXm+Q,GAuJArgH,EAAAA,WAGE,SAAAuT,EAAkBj5J,EAAGv5G,EAAG+rI,OAClBlhD,EAAGusB,EAAMwrQ,EAAKC,EAChBr5I,EAAQ,EACR12J,EAAIymC,EAAE3oC,OACNkyS,EAAM9iX,EAAI8+W,EACViE,EAAM/iX,EAAI8+W,EAAY,MAEnBvlQ,EAAIA,EAAExoC,QAAS+B,KAKlB02J,IADApyH,EAAO0rQ,GAHPF,EAAMrpQ,EAAEzmC,GAAKgsS,IAEbj0R,EAAIk4R,EAAMH,GADVC,EAAMtpQ,EAAEzmC,GAAKgsS,EAAY,GACHgE,GACGhE,EAAaA,EAAat1I,GACnCz9F,EAAO,IAAMlhD,EAAIi0R,EAAY,GAAKiE,EAAMF,EACxDtpQ,EAAEzmC,GAAKskC,EAAO20B,SAGZy9F,IAAOjwH,EAAAA,CAAKiwH,GAAOhsI,OAAO+b,IAEvBA,EAGT,SAAAkkN,EAAiBjrP,EAAGyS,EAAG+9R,EAAIC,OACrBnwS,EAAGggC,KAEHkwQ,GAAMC,EACRnwQ,EAAMkwQ,EAAKC,EAAK,GAAK,WAGhBnwS,EAAIggC,EAAM,EAAGhgC,EAAIkwS,EAAIlwS,OAEpBN,EAAEM,IAAMmS,EAAEnS,GAAAA,CACZggC,EAAMtgC,EAAEM,GAAKmS,EAAEnS,GAAK,GAAK,eAMxBggC,EAGT,SAAAypK,EAAkB/pM,EAAGyS,EAAG+9R,EAAIj3O,WACtBj5D,EAAI,EAGDkwS,KACLxwS,EAAEwwS,IAAOlwS,EACTA,EAAIN,EAAEwwS,GAAM/9R,EAAE+9R,GAAM,EAAI,EACxBxwS,EAAEwwS,GAAMlwS,EAAIi5D,EAAOv5D,EAAEwwS,GAAM/9R,EAAE+9R,SAIvBxwS,EAAE,IAAMA,EAAE5B,OAAS,EAAG4B,EAAE4D,OAAO,EAAG,YAIrC,SAAUmjC,EAAGC,EAAGy8K,EAAI0+E,EAAI5oO,OACzBj5B,EAAKpzG,EAAGozE,EAAGowS,EAAMtjX,EAAGi8H,EAAMsnP,EAAOlpQ,EAAGmpQ,EAAIhgC,EAAKigC,EAAMC,EAAM1rP,EAAI2rP,EAAIC,EACnEC,EAAIC,EACJ77R,EAAI0xB,EAAE1xB,GAAK2xB,EAAE3xB,EAAI,GAAK,EACtBkhJ,EAAKxvH,EAAEnhC,EACP6mS,EAAKzlQ,EAAEphC,OAGJ2wJ,GAAOA,EAAG,IAAOk2I,GAAOA,EAAG,eAEnBhF,EAGT1gQ,EAAE1xB,GAAM2xB,EAAE3xB,IAAMkhJ,GAAKk2I,GAAMl2I,EAAG,IAAMk2I,EAAG,GAAMA,GAG7Cl2I,GAAe,GAATA,EAAG,KAAYk2I,EAAS,EAAJp3R,EAAQA,EAAI,EAHa0sK,SAQvD6uH,GADAnpQ,EAAAA,IAAQggQ,EAAUpyR,IACXzP,EAAAA,GAEPyP,EAAIouM,GADJv2R,EAAI65G,EAAE75G,EAAI85G,EAAE95G,GACC,EAERqsI,IACHA,EAAOi9F,EACPtpO,EAAIq/W,EAASxlQ,EAAE75G,EAAIk/W,GAAYG,EAASvlQ,EAAE95G,EAAIk/W,GAC9C/2R,EAAIA,EAAI+2R,EAAW,GAKhB9rS,EAAI,EAAGmsS,EAAGnsS,KAAOi2J,EAAGj2J,IAAM,GAAIA,QAE/BmsS,EAAGnsS,IAAMi2J,EAAGj2J,IAAM,IAAIpzE,IAEtBmoF,EAAI,EACNu7R,EAAG3sS,KAAK,GACRysS,GAAO,WAEPK,EAAKx6I,EAAGn4J,OACR6yS,EAAKxE,EAAGruS,OACRkC,EAAI,EACJ+U,GAAK,GAILjoF,EAAI6+W,EAAU1yO,GAAQkzO,EAAG,GAAK,KAItB,IACNA,EAAKzsG,EAASysG,EAAIr/W,EAAGmsI,GACrBg9F,EAAKypC,EAASzpC,EAAInpO,EAAGmsI,GACrB03O,EAAKxE,EAAGruS,OACR2yS,EAAKx6I,EAAGn4J,QAGVgnD,EAAK6rP,EAELJ,GADAjgC,EAAMr6G,EAAGh4J,MAAM,EAAG0yS,IACP7yS,OAGJyyS,EAAOI,EAAIrgC,EAAIigC,KAAU,GAChCK,EAAKzE,EAAGluS,QACR2yS,EAAAA,CAAM,GAAGlmR,OAAOkmR,GAChBF,EAAMvE,EAAG,GACLA,EAAG,IAAMlzO,EAAO,GAAGy3O,UAKrB5jX,EAAI,GAGJkzG,EAAM2qN,EAAQwhD,EAAI77B,EAAKqgC,EAAIJ,IAGjB,EAAA,IAIRC,EAAOlgC,EAAI,GACPqgC,GAAMJ,IAAMC,EAAOA,EAAOv3O,GAAQq3M,EAAI,IAAM,KAGhDxjV,EAAI6+W,EAAU6E,EAAOE,IAab,MAGF5jX,GAAKmsI,IAAMnsI,EAAImsI,EAAO,GAI1Bo3O,GADAtnP,EAAO22I,EAASysG,EAAIr/W,EAAGmsI,IACVn7D,OACbyyS,EAAOjgC,EAAIxyQ,OAM+B,GAAnC6sP,EAAQ5hM,EAAMunN,EAAK+/B,EAAOE,IAC/BzjX,IAGA28Q,EAAS1gJ,EAAM4nP,EAAKN,EAAQO,EAAKzE,EAAIkE,EAAOp3O,GAC5Co3O,EAAQtnP,EAAKjrD,OACbkiC,EAAM,OAQC,GAALlzG,IAGFkzG,EAAMlzG,EAAI,GAKZujX,GADAtnP,EAAOojP,EAAGluS,SACGH,UAGXuyS,EAAQE,IAAMxnP,EAAAA,CAAQ,GAAGr+B,OAAOq+B,IAGpC0gJ,EAAS6mE,EAAKvnN,EAAMwnP,EAAMt3O,GAC1Bs3O,EAAOjgC,EAAIxyQ,QAGC,GAARkiC,OAMK2qN,EAAQwhD,EAAI77B,EAAKqgC,EAAIJ,GAAQ,GAClCzjX,IAGA28Q,EAAS6mE,EAAKqgC,EAAKJ,EAAOK,EAAKzE,EAAIoE,EAAMt3O,GACzCs3O,EAAOjgC,EAAIxyQ,YAGE,IAARkiC,IACTlzG,IACAwjV,EAAAA,CAAO,IAITggC,EAAGtwS,KAAOlzE,EAGNwjV,EAAI,GACNA,EAAIigC,KAAUt6I,EAAGnxG,IAAO,GAExBwrN,EAAAA,CAAOr6G,EAAGnxG,IACVyrP,EAAO,UAEDzrP,IAAO2rP,GAAgB,MAAVngC,EAAI,KAAev7P,KAE1Cq7R,EAAiB,MAAV9/B,EAAI,GAGNggC,EAAG,IAAIA,EAAGhtS,OAAO,EAAG,MAGvB21D,GAAQi9F,EAAAA,KAGLl2J,EAAI,EAAG+U,EAAIu7R,EAAG,GAAIv7R,GAAK,GAAIA,GAAK,GAAI/U,KAEzCgnC,EAAMG,EAAGg8K,GAAMh8K,EAAEv6G,EAAIozE,EAAIpzE,EAAIk/W,EAAW,GAAK,EAAGjK,EAAIuO,QAIpDjpQ,EAAEv6G,EAAIA,EACNu6G,EAAEN,GAAKupQ,SAGFjpQ,GA9PXglJ,GAgYMygH,EAAa,8BACfC,EAAW,cACXC,EAAY,cACZC,EAAkB,qBAClBC,EAAmB,6BALvBP,EAOS,SAAUhmQ,EAAGpY,EAAK6/Q,EAAO/7R,OAC1B8mD,EACFlkD,EAAIm5R,EAAQ7/Q,EAAMA,EAAItc,QAAQi7R,EAAkB,OAG9CD,EAAgBzuS,KAAKyW,GACvB0xB,EAAE1xB,EAAIgjB,MAAMhjB,GAAK,KAAOA,EAAI,GAAK,EAAI,WAEhCm5R,IAGHn5R,EAAIA,EAAEhD,QAAQ66R,GAAY,SAAU70R,EAAG9D,EAAI0sN,UACzC1nK,EAAkC,MAA1B0nK,EAAKA,EAAG1+N,eAAwB,GAAW,KAAN0+N,EAAY,EAAI,EACrDxuN,GAAKA,GAAK8mD,EAAYlhD,EAAL9D,KAGvB9B,IACF8mD,EAAO9mD,EAGP4C,EAAIA,EAAEhD,QAAQ86R,EAAU,MAAM96R,QAAQ+6R,EAAW,SAG/Cz+Q,GAAOtZ,GAAAA,OAAAA,IAAcoyR,EAAUpyR,EAAGkkD,MAKpCkuO,EAAUiH,YACNz8Q,MACHi6Q,EAAiB,SAAWz5R,EAAI,SAAWA,EAAI,IAAM,YAAckc,GAIxEoY,EAAE1xB,EAAI,KAGR0xB,EAAEnhC,EAAImhC,EAAE75G,EAAI,MA6LhB4wN,EAAEqzJ,cAAgBrzJ,EAAEw1C,IAAM,eACpBvsJ,EAAAA,IAAQ0gQ,EAAUtuQ,aAClB4N,EAAE1xB,EAAI,IAAG0xB,EAAE1xB,EAAI,GACZ0xB,GAWT+2G,EAAEszJ,WAAa,SAAUpqQ,EAAGv0B,UACnBw4O,EAAQ9xN,KAAA,IAAUsuQ,EAAUzgQ,EAAGv0B,KAiBxCqrI,EAAEuzJ,cAAgBvzJ,EAAE2lE,GAAK,SAAUA,EAAI0+E,OACjCv8R,EAAGx4E,EAAG6wK,EACRl3D,EAAI5N,QAEI,MAANsqL,SACFipF,EAASjpF,EAAI,EAAGrgC,GACN,MAAN++G,EAAYA,EAAKqL,EAChBd,EAASvK,EAAI,EAAG,GAEd76P,EAAAA,IAAUmgQ,EAAU1gQ,GAAI08K,EAAK18K,EAAE75G,EAAI,EAAGi1W,QAGzCv8R,EAAImhC,EAAEnhC,GAAAA,OAAW,QACvBx4E,IAAM6wK,EAAIr4F,EAAExH,OAAS,GAAKmuS,EAASpzQ,KAAKjsG,EAAIk/W,IAAaA,EAGrDnuM,EAAIr4F,EAAEq4F,GAAAA,KAAWA,EAAI,IAAM,EAAGA,GAAK,GAAI7wK,YACvCA,EAAI,IAAGA,EAAI,GAERA,GAwBT0wN,EAAEwzJ,UAAYxzJ,EAAE2uC,IAAM,SAAUzlJ,EAAGv0B,UAC1Bg6K,EAAItzJ,KAAA,IAAUsuQ,EAAUzgQ,EAAGv0B,GAAI86R,EAAgBC,IAQxD1vJ,EAAEyzJ,mBAAqBzzJ,EAAE0zJ,KAAO,SAAUxqQ,EAAGv0B,UACpCg6K,EAAItzJ,KAAA,IAAUsuQ,EAAUzgQ,EAAGv0B,GAAI,EAAG,IAmB3CqrI,EAAE2zJ,gBAAkB3zJ,EAAE0a,IAAM,SAAUprO,EAAGirF,OACnCsoL,EAAM+wG,EAAUpxS,EAAG9yE,EAASmkX,EAAQC,EAAQC,EAAQ7qQ,EACtDD,EAAI5N,SAEN/rG,EAAAA,IAAQq6W,EAAUr6W,IAGZw4E,IAAMx4E,EAAEwxP,kBACN3sJ,MACHi6Q,EAAiB,4BAA8BjkD,EAAQ76T,OAGnD,MAALirF,IAAWA,EAAAA,IAAQovR,EAAUpvR,IAGjCs5R,EAASvkX,EAAEF,EAAI,IAGV65G,EAAEnhC,IAAMmhC,EAAEnhC,EAAE,IAAgB,GAAVmhC,EAAEnhC,EAAE,KAAYmhC,EAAE75G,GAAmB,GAAd65G,EAAEnhC,EAAExH,SAAgBhxE,EAAEw4E,IAAMx4E,EAAEw4E,EAAE,UAI5EohC,EAAAA,IAAQygQ,EAAU1oS,KAAKy5J,KAAKyvF,EAAQlhN,GAAI4qQ,EAAS,EAAIjqF,EAAMt6R,IAAM66T,EAAQ76T,KAClEirF,EAAI2uB,EAAEy0C,IAAIpjE,GAAK2uB,KAGxB4qQ,EAASxkX,EAAEioF,EAAI,EAEXgD,EAAAA,IAGEA,EAAEzS,GAAKyS,EAAEzS,EAAE,IAAMyS,EAAEhD,EAAAA,OAAAA,IAAcoyR,EAAU1lH,MAE/C2vH,GAAYE,GAAU7qQ,EAAE63I,aAAevmK,EAAEumK,eAE3B73I,EAAIA,EAAE00C,IAAIpjE,YAIfjrF,EAAEF,EAAI,IAAM65G,EAAE75G,EAAI,GAAK65G,EAAE75G,GAAK,IAAa,GAAP65G,EAAE75G,EAE7C65G,EAAEnhC,EAAE,GAAK,GAAK+rS,GAAU5qQ,EAAEnhC,EAAE,IAAM,KAElCmhC,EAAEnhC,EAAE,GAAK,MAAQ+rS,GAAU5qQ,EAAEnhC,EAAE,IAAM,mBAGvCp4E,EAAIu5G,EAAE1xB,EAAI,GAAKqyM,EAAMt6R,IAAM,EAAI,EAG3B25G,EAAE75G,GAAK,IAAGM,EAAI,EAAIA,OAGXi6W,EAAUmK,EAAS,EAAIpkX,EAAIA,GAE7BugX,IAKTvgX,EAAIw+W,EAAS+B,EAAgB3B,EAAW,QAGtCuF,GACFhxG,EAAAA,IAAW8mG,EAAU,IACjBmK,IAAQxkX,EAAEioF,EAAI,GAClBw8R,EAASnqF,EAAMt6R,IAGfykX,GADAvxS,EAAIvB,KAAKu0L,KAAK20D,EAAQ76T,KACT,EAGf45G,EAAAA,IAAQygQ,EAAUz9F,SAKZ6nG,EAAAA,MACF7qQ,EAAIA,EAAE7uF,MAAM4uF,IACLnhC,EAAAA,MAEHp4E,EACEw5G,EAAEphC,EAAExH,OAAS5wE,IAAGw5G,EAAEphC,EAAExH,OAAS5wE,GACxBkkX,IACT1qQ,EAAIA,EAAEy0C,IAAIpjE,OAIV/X,EAAAA,IAEQ,KADVA,EAAI2rS,EAAU3rS,EAAI,IACR,MACVuxS,EAASvxS,EAAI,UAGbgnC,EADAl6G,EAAIA,EAAE+qB,MAAMwoP,GACHvzQ,EAAEF,EAAI,EAAG,GAEdE,EAAEF,EAAI,GACR2kX,EAASnqF,EAAMt6R,WAGL,KADVkzE,GAAK2nP,EAAQ76T,IACH,MACVykX,EAASvxS,EAAI,EAIjBymC,EAAIA,EAAE5uF,MAAM4uF,GAERv5G,EACEu5G,EAAEnhC,GAAKmhC,EAAEnhC,EAAExH,OAAS5wE,IAAGu5G,EAAEnhC,EAAExH,OAAS5wE,GAC/BkkX,IACT3qQ,EAAIA,EAAE00C,IAAIpjE,WAIVq5R,EAAiB1qQ,GACjB4qQ,IAAQ5qQ,EAAIgjK,EAAIvd,IAAIzlJ,IAEjB3uB,EAAI2uB,EAAEy0C,IAAIpjE,GAAK7qF,EAAI85G,EAAMN,EAAG+mQ,EAAeP,EAnHxBkD,WAmH+C1pQ,IAY3E82G,EAAEg0J,aAAe,SAAU3P,OACrB/0W,EAAAA,IAAQq6W,EAAUtuQ,aACZ,MAANgpQ,EAAYA,EAAKqL,EAChBd,EAASvK,EAAI,EAAG,GACd76P,EAAMl6G,EAAGA,EAAEF,EAAI,EAAGi1W,IAQ3BrkJ,EAAEi0J,UAAYj0J,EAAEpxG,GAAK,SAAU1F,EAAGv0B,UACc,IAAvCw4O,EAAQ9xN,KAAA,IAAUsuQ,EAAUzgQ,EAAGv0B,KAOxCqrI,EAAE+gC,SAAW,mBACF1lJ,KAAKvzB,GAQhBk4I,EAAEk0J,cAAgBl0J,EAAE3tN,GAAK,SAAU62G,EAAGv0B,UAC7Bw4O,EAAQ9xN,KAAA,IAAUsuQ,EAAUzgQ,EAAGv0B,IAAM,GAQ9CqrI,EAAEm0J,uBAAyBn0J,EAAEk7E,IAAM,SAAUhyL,EAAGv0B,UACM,KAA5CA,EAAIw4O,EAAQ9xN,KAAA,IAAUsuQ,EAAUzgQ,EAAGv0B,MAAoB,IAANA,GAQ3DqrI,EAAE8gC,UAAY,mBACHzlJ,KAAKvzB,GAAK2mS,EAASpzQ,KAAKjsG,EAAIk/W,GAAYjzQ,KAAKvzB,EAAExH,OAAS,GAQnE0/I,EAAEo0J,WAAap0J,EAAEztN,GAAK,SAAU22G,EAAGv0B,UAC1Bw4O,EAAQ9xN,KAAA,IAAUsuQ,EAAUzgQ,EAAGv0B,IAAM,GAQ9CqrI,EAAEq0J,oBAAsBr0J,EAAEq7E,IAAM,SAAUnyL,EAAGv0B,UACU,KAA7CA,EAAIw4O,EAAQ9xN,KAAA,IAAUsuQ,EAAUzgQ,EAAGv0B,MAAqB,IAANA,GAO5DqrI,EAAEzlH,MAAQ,kBACAc,KAAK9jB,GAOfyoI,EAAEs0J,WAAa,kBACNj5Q,KAAK9jB,EAAI,GAOlByoI,EAAEu0J,WAAa,kBACNl5Q,KAAK9jB,EAAI,GAOlByoI,EAAEkqE,OAAS,mBACA7uL,KAAKvzB,GAAkB,GAAbuzB,KAAKvzB,EAAE,IAwB5Bk4I,EAAEv0F,MAAQ,SAAUviB,EAAGv0B,OACjBnS,EAAGmqB,EAAGytD,EAAGo6N,EACXvrQ,EAAI5N,KACJn5B,EAAI+mC,EAAE1xB,KAGR5C,GADAu0B,EAAAA,IAAQygQ,EAAUzgQ,EAAGv0B,IACf4C,GAGDrV,IAAMyS,EAAAA,OAAAA,IAAcg1R,EAAU1lH,QAG/B/hL,GAAKyS,SACPu0B,EAAE3xB,GAAK5C,EACAs0B,EAAE0kQ,KAAKzkQ,OAGZurQ,EAAKxrQ,EAAE75G,EAAIk/W,EACboG,EAAKxrQ,EAAE95G,EAAIk/W,EACX71I,EAAKxvH,EAAEnhC,EACP6mS,EAAKzlQ,EAAEphC,MAEJ2sS,IAAOC,EAAAA,KAGLj8I,IAAOk2I,EAAAA,OAAWl2I,GAAMvvH,EAAE3xB,GAAK5C,EAAGu0B,GAAAA,IAASygQ,EAAUgF,EAAK1lQ,EAAIg7I,SAG9DxrB,EAAG,KAAOk2I,EAAG,UAGTA,EAAG,IAAMzlQ,EAAE3xB,GAAK5C,EAAGu0B,GAAAA,IAASygQ,EAAUlxI,EAAG,GAAKxvH,EAGnC,GAAjBymQ,GAAsB,EAAI,MAI/B+E,EAAKhG,EAASgG,GACdC,EAAKjG,EAASiG,GACdj8I,EAAKA,EAAGh4J,QAGJyB,EAAIuyS,EAAKC,EAAAA,MAEPF,EAAOtyS,EAAI,IACbA,GAAKA,EACLk4E,EAAIq+E,IAEJi8I,EAAKD,EACLr6N,EAAIu0N,GAGNv0N,EAAEmhE,UAGG5mI,EAAIzS,EAAGyS,IAAKylE,EAAEj0E,KAAK,IACxBi0E,EAAEmhE,mBAIF5uH,GAAK6nR,GAAQtyS,EAAIu2J,EAAGn4J,SAAWqU,EAAIg6R,EAAGruS,SAAW4B,EAAIyS,EAEhDzS,EAAIyS,EAAI,EAAGA,EAAIgY,EAAGhY,OAEjB8jJ,EAAG9jJ,IAAMg6R,EAAGh6R,GAAAA,CACd6/R,EAAO/7I,EAAG9jJ,GAAKg6R,EAAGh6R,YAOpB6/R,IAAMp6N,EAAIq+E,EAAIA,EAAKk2I,EAAIA,EAAKv0N,EAAGlxC,EAAE3xB,GAAK2xB,EAAE3xB,IAE5C5C,GAAKgY,EAAIgiR,EAAGruS,SAAWkC,EAAIi2J,EAAGn4J,SAItB,EAAA,KAAUqU,IAAK8jJ,EAAGj2J,KAAO,OACjCmS,EAAI+jJ,EAAO,EAGJ/rI,EAAIzqB,GAAAA,IAELu2J,IAAK9rI,GAAKgiR,EAAGhiR,GAAAA,KACVnqB,EAAImqB,EAAGnqB,IAAMi2J,IAAKj2J,GAAIi2J,EAAGj2J,GAAKmS,KACjC8jJ,EAAGj2J,GACLi2J,EAAG9rI,IAAM+rI,EAGXD,EAAG9rI,IAAMgiR,EAAGhiR,QAIE,GAAT8rI,EAAG,GAASA,EAAG3yJ,OAAO,EAAG,KAAM4uS,UAGjCj8I,EAAG,GAWDq4I,EAAU5nQ,EAAGuvH,EAAIi8I,IAPtBxrQ,EAAE3xB,EAAqB,GAAjBm4R,GAAsB,EAAI,EAChCxmQ,EAAEphC,EAAAA,CAAKohC,EAAE95G,EAAI,GACN85G,IA8BX82G,EAAEpwG,OAASowG,EAAEriE,IAAM,SAAUz0C,EAAGv0B,OAC1Bg1B,EAAGpyB,EACL0xB,EAAI5N,YAEN6N,EAAAA,IAAQygQ,EAAUzgQ,EAAGv0B,IAGhBs0B,EAAEnhC,IAAMohC,EAAE3xB,GAAK2xB,EAAEphC,IAAMohC,EAAEphC,EAAE,OACnB6hS,EAAU1lH,MAGX/6I,EAAEphC,GAAKmhC,EAAEnhC,IAAMmhC,EAAEnhC,EAAE,OAClB6hS,EAAU1gQ,IAGJ,GAAf+mQ,GAIFz4R,EAAI2xB,EAAE3xB,EACN2xB,EAAE3xB,EAAI,EACNoyB,EAAIglJ,EAAI1lJ,EAAGC,EAAG,EAAG,GACjBA,EAAE3xB,EAAIA,EACNoyB,EAAEpyB,GAAKA,GAEPoyB,EAAIglJ,EAAI1lJ,EAAGC,EAAG,EAAG8mQ,IAGnB9mQ,EAAID,EAAEwiB,MAAM9hB,EAAEtvF,MAAM6uF,KAGbphC,EAAE,IAAqB,GAAfkoS,IAAkB9mQ,EAAE3xB,EAAI0xB,EAAE1xB,GAElC2xB,IAwBT82G,EAAE20J,aAAe30J,EAAE3lM,MAAQ,SAAU6uF,EAAGv0B,OAClC7M,EAAG14E,EAAGozE,EAAGmqB,EAAGj9F,EAAG6qF,EAAGq6R,EAAKtC,EAAKC,EAAKsC,EAAKC,EAAKC,EAAKC,EAClDv5O,EAAMw5O,EACNhsQ,EAAI5N,KACJo9H,EAAKxvH,EAAEnhC,EACP6mS,GAAMzlQ,EAAAA,IAAQygQ,EAAUzgQ,EAAGv0B,IAAI7M,OAG5B2wJ,GAAOk2I,GAAOl2I,EAAG,IAAOk2I,EAAG,WAGzB1lQ,EAAE1xB,IAAM2xB,EAAE3xB,GAAKkhJ,IAAOA,EAAG,KAAOk2I,GAAMA,IAAOA,EAAG,KAAOl2I,EAC1DvvH,EAAEphC,EAAIohC,EAAE95G,EAAI85G,EAAE3xB,EAAI,MAElB2xB,EAAE3xB,GAAK0xB,EAAE1xB,EAGJkhJ,GAAOk2I,GAKVzlQ,EAAEphC,EAAAA,CAAK,GACPohC,EAAE95G,EAAI,GALN85G,EAAEphC,EAAIohC,EAAE95G,EAAI,MAST85G,MAGT95G,EAAIq/W,EAASxlQ,EAAE75G,EAAIk/W,GAAYG,EAASvlQ,EAAE95G,EAAIk/W,GAC9CplQ,EAAE3xB,GAAK0xB,EAAE1xB,GACTq9R,EAAMn8I,EAAGn4J,SACTu0S,EAAMlG,EAAGruS,UAGM00S,EAAKv8I,EAAIA,EAAKk2I,EAAIA,EAAKqG,EAAIxyS,EAAIoyS,EAAKA,EAAMC,EAAKA,EAAMryS,GAG/DA,EAAIoyS,EAAMC,EAAKG,EAAAA,GAASxyS,IAAKwyS,EAAG7uS,KAAK,QAE1Cs1D,EAAOi9F,EACPu8I,EAAWzG,EAENhsS,EAAIqyS,IAAOryS,GAAK,GAAA,KACnBsF,EAAI,EACJgtS,EAAMnG,EAAGnsS,GAAKyyS,EACdF,EAAMpG,EAAGnsS,GAAKyyS,EAAW,EAEXtoR,EAAInqB,GAAb9yE,EAAIklX,GAAgBjoR,EAAInqB,GAK3BsF,IADAwqS,EAAMwC,GAHNxC,EAAM75I,IAAK/oO,GAAKulX,IAEhB16R,EAAIw6R,EAAMzC,GADVC,EAAM95I,EAAG/oO,GAAKulX,EAAW,GACHH,GACEG,EAAYA,EAAYD,EAAGroR,GAAK7kB,GAC7C2zD,EAAO,IAAMlhD,EAAI06R,EAAW,GAAKF,EAAMxC,EAClDyC,EAAGroR,KAAO2lR,EAAM72O,EAGlBu5O,EAAGroR,GAAK7kB,SAGNA,IACA14E,EAEF4lX,EAAGlvS,OAAO,EAAG,GAGRgrS,EAAU5nQ,EAAG8rQ,EAAI5lX,IAQ1B4wN,EAAEk1J,QAAU,eACNjsQ,EAAAA,IAAQ0gQ,EAAUtuQ,aACtB4N,EAAE1xB,GAAK0xB,EAAE1xB,GAAK,KACP0xB,GAwBT+2G,EAAE2tJ,KAAO,SAAUzkQ,EAAGv0B,OAChBylE,EACFnxC,EAAI5N,KACJn5B,EAAI+mC,EAAE1xB,KAGR5C,GADAu0B,EAAAA,IAAQygQ,EAAUzgQ,EAAGv0B,IACf4C,GAGDrV,IAAMyS,EAAAA,OAAAA,IAAcg1R,EAAU1lH,QAG9B/hL,GAAKyS,SACRu0B,EAAE3xB,GAAK5C,EACAs0B,EAAEwiB,MAAMviB,OAGburQ,EAAKxrQ,EAAE75G,EAAIk/W,EACboG,EAAKxrQ,EAAE95G,EAAIk/W,EACX71I,EAAKxvH,EAAEnhC,EACP6mS,EAAKzlQ,EAAEphC,MAEJ2sS,IAAOC,EAAAA,KAGLj8I,IAAOk2I,EAAAA,OAAAA,IAAehF,EAAUznS,EAAI,OAIpCu2J,EAAG,KAAOk2I,EAAG,GAAA,OAAWA,EAAG,GAAKzlQ,EAAAA,IAAQygQ,EAAUlxI,EAAG,GAAKxvH,EAAQ,EAAJ/mC,MAGrEuyS,EAAKhG,EAASgG,GACdC,EAAKjG,EAASiG,GACdj8I,EAAKA,EAAGh4J,QAGJyB,EAAIuyS,EAAKC,EAAAA,KACPxyS,EAAI,GACNwyS,EAAKD,EACLr6N,EAAIu0N,IAEJzsS,GAAKA,EACLk4E,EAAIq+E,GAGNr+E,EAAEmhE,UACKr5I,IAAKk4E,EAAEj0E,KAAK,IACnBi0E,EAAEmhE,eAGJr5I,EAAIu2J,EAAGn4J,SACPqU,EAAIg6R,EAAGruS,QAGK,IAAG85E,EAAIu0N,EAAIA,EAAKl2I,EAAIA,EAAKr+E,EAAGzlE,EAAIzS,GAGvCA,EAAI,EAAGyS,GACVzS,GAAKu2J,IAAK9jJ,GAAK8jJ,EAAG9jJ,GAAKg6R,EAAGh6R,GAAKzS,GAAKw2J,EAAO,EAC3CD,EAAG9jJ,GAAK+jJ,IAASD,EAAG9jJ,GAAK,EAAI8jJ,EAAG9jJ,GAAK+jJ,SAGnCx2J,IACFu2J,EAAAA,CAAMv2J,GAAGgrB,OAAOurI,KACdi8I,GAKG5D,EAAU5nQ,EAAGuvH,EAAIi8I,IAmB1B10J,EAAEm1J,UAAYn1J,EAAE+wJ,GAAK,SAAUA,EAAI1M,OAC7Bv8R,EAAGx4E,EAAG6wK,EACRl3D,EAAI5N,QAEI,MAAN01Q,GAAcA,MAASA,SACzBnC,EAASmC,EAAI,EAAGzrH,GACN,MAAN++G,EAAYA,EAAKqL,EAChBd,EAASvK,EAAI,EAAG,GAEd76P,EAAAA,IAAUmgQ,EAAU1gQ,GAAI8nQ,EAAI1M,QAG/Bv8R,EAAImhC,EAAEnhC,GAAAA,OAAW,QAEvBx4E,GADA6wK,EAAIr4F,EAAExH,OAAS,GACPguS,EAAW,EAEfnuM,EAAIr4F,EAAEq4F,GAAAA,MAGDA,EAAI,IAAM,EAAGA,GAAK,GAAI7wK,SAGxB6wK,EAAIr4F,EAAE,GAAIq4F,GAAK,GAAIA,GAAK,GAAI7wK,aAG/ByhX,GAAM9nQ,EAAE75G,EAAI,EAAIE,IAAGA,EAAI25G,EAAE75G,EAAI,GAE1BE,GAYT0wN,EAAEo1J,UAAY,SAAU1lX,UACtBk/W,EAASl/W,GAAAA,iBAAsB6sT,GACxBlhN,KAAKhhF,MAAM,KAAO3qB,IAe3BswN,EAAEq1J,WAAar1J,EAAEq8E,KAAO,eAClB9hN,EAAGjrF,EAAG+5G,EAAGisQ,EAAKl7N,EAChBnxC,EAAI5N,KACJvzB,EAAImhC,EAAEnhC,EACNyP,EAAI0xB,EAAE1xB,EACNnoF,EAAI65G,EAAE75G,EACNu2R,EAAK8pF,EAAiB,EACtB5sG,EAAAA,IAAW8mG,EAAU,UAGb,IAANpyR,IAAYzP,IAAMA,EAAE,cACX6hS,GAAWpyR,GAAKA,EAAI,KAAOzP,GAAKA,EAAE,IAAMm8K,IAAMn8K,EAAImhC,EAAI,EAAA,MAQ1D,IAJT1xB,EAAItW,KAAKo7N,MAAM8tB,EAAQlhN,MAIT1xB,GAAK,EAAA,KACjBjoF,EAAIo/W,EAAc5mS,IACXxH,OAASlxE,GAAK,GAAK,IAAGE,GAAK,KAClCioF,EAAItW,KAAKo7N,MAAM/sS,GACfF,EAAIq/W,GAAUr/W,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS1Ci6G,EAAAA,IAAQsgQ,EANNr6W,EADEioF,GAAK,EAAA,EACH,KAAOnoF,GAEXE,EAAIioF,EAAEs3R,iBACApuS,MAAM,EAAGnxE,EAAEu3E,QAAQ,KAAO,GAAKz3E,IAKvCi6G,EAAAA,IAAQsgQ,EAAUpyR,EAAI,IAOpB8xB,EAAEvhC,EAAE,QAENyP,GADAnoF,EAAIi6G,EAAEj6G,GACEu2R,GACA,IAAGpuM,EAAI,QAIb6iE,EAAI/wC,EACJA,EAAIw5J,EAAKxoP,MAAM+/H,EAAEuzN,KAAKh/G,EAAI1lJ,EAAGmxC,EAAGurI,EAAI,KAEhC+oF,EAAct0N,EAAEtyE,GAAGrH,MAAM,EAAG8W,MAAQjoF,EAAIo/W,EAAcrlQ,EAAEvhC,IAAIrH,MAAM,EAAG8W,GAAAA,IAKnE8xB,EAAEj6G,EAAIA,KAAKmoF,EAMN,SALTjoF,EAAIA,EAAEmxE,MAAM8W,EAAI,EAAGA,EAAI,MAKH+9R,GAAY,QAALhmX,KAoBnBA,KAAOA,EAAEmxE,MAAM,IAAqB,KAAfnxE,EAAEskG,OAAO,MAGlC4V,EAAMH,EAAGA,EAAEj6G,EAAIqgX,EAAiB,EAAG,GACnCl1R,GAAK8uB,EAAEhvF,MAAMgvF,GAAGuF,GAAG3F,cApBhBqsQ,IACH9rQ,EAAM4wC,EAAGA,EAAEhrJ,EAAIqgX,EAAiB,EAAG,GAE/Br1N,EAAE//H,MAAM+/H,GAAGxrC,GAAG3F,IAAAA,CAChBI,EAAI+wC,QAKRurI,GAAM,EACNpuM,GAAK,EACL+9R,EAAM,SAkBP9rQ,EAAMH,EAAGA,EAAEj6G,EAAIqgX,EAAiB,EAAGC,EAAen1R,IAa3DylI,EAAE6uJ,cAAgB,SAAUlpF,EAAI0+E,UACpB,MAAN1+E,IACFipF,EAASjpF,EAAI,EAAGrgC,GAChBqgC,KAEKtzD,EAAOh3H,KAAMsqL,EAAI0+E,EAAI,IAgB9BrkJ,EAAEy1C,QAAU,SAAUkwB,EAAI0+E,UACd,MAAN1+E,IACFipF,EAASjpF,EAAI,EAAGrgC,GAChBqgC,EAAKA,EAAKtqL,KAAKjsG,EAAI,GAEdijO,EAAOh3H,KAAMsqL,EAAI0+E,IA6B1BrkJ,EAAEu1J,SAAW,SAAU5vF,EAAI0+E,EAAIhyI,OACzBxhI,EACFoY,EAAI5N,QAEQ,MAAVg3H,EACQ,MAANszD,GAAc0+E,GAAmB,iBAANA,GAC7BhyI,EAASgyI,EACTA,EAAK,MACI1+E,GAAmB,iBAANA,GACtBtzD,EAASszD,EACTA,EAAK0+E,EAAK,MAEVhyI,EAAS69I,UAEe,iBAAV79I,QACVl+H,MACHi6Q,EAAiB,2BAA6B/7I,MAGnDxhI,EAAMoY,EAAEwsJ,QAAQkwB,EAAI0+E,GAEhBp7P,EAAEnhC,EAAAA,KACAtF,EACFy1B,EAAMpH,EAAI1V,MAAM,KAChB+sR,GAAM71I,EAAOw9D,UACbvX,GAAMjmD,EAAO89I,mBACbC,EAAiB/9I,EAAO+9I,gBAAkB,GAC1CoF,EAAUv9Q,EAAI,GACdw9Q,EAAex9Q,EAAI,GACnB+4L,EAAQ/nL,EAAE1xB,EAAI,EACdm+R,EAAY1kF,EAAQwkF,EAAQ/0S,MAAM,GAAK+0S,EACvC/2Q,EAAMi3Q,EAAUp1S,UAEdg4M,IAAI91M,EAAI0lS,EAAIA,EAAK5vF,EAAIA,EAAK91M,EAAGi8B,GAAOj8B,GAEpC0lS,EAAK,GAAKzpQ,EAAM,EAAA,KAClBj8B,EAAIi8B,EAAMypQ,GAAMA,EAChBsN,EAAUE,EAAUx0S,OAAO,EAAGsB,GACvBA,EAAIi8B,EAAKj8B,GAAK0lS,EAAIsN,GAAWpF,EAAiBsF,EAAUx0S,OAAOsB,EAAG0lS,GACrE5vF,EAAK,IAAGk9F,GAAWpF,EAAiBsF,EAAUj1S,MAAM+B,IACpDwuN,IAAOwkF,EAAU,IAAMA,GAG7B3kR,EAAM4kR,EACHD,GAAWnjJ,EAAOg+I,kBAAoB,MAAQ/3F,GAAMjmD,EAAOi+I,mBAC1DmF,EAAalhS,QAAAA,IAAY89B,OAAO,OAASimK,EAAK,OAAQ,KACvD,MAAQjmD,EAAOk+I,wBAA0B,KACxCkF,GACDD,SAGGnjJ,EAAOrsI,QAAU,IAAM6K,GAAOwhI,EAAOm+I,QAAU,KAezDxwJ,EAAE21J,WAAa,SAAUr9G,OACnBr/H,EAAG28O,EAAIv/F,EAAIC,EAAIlnR,EAAGwzE,EAAKtzE,EAAGumX,EAAIp+L,EAAI9tE,EAAGN,EAAG9xB,EAC1C0xB,EAAI5N,KACJo9H,EAAKxvH,EAAEnhC,KAEC,MAANwwL,MACFhpQ,EAAAA,IAAQq6W,EAAUrxG,IAGXxX,cAAgBxxP,EAAEw4E,GAAa,IAARx4E,EAAEioF,IAAYjoF,EAAEiD,GAAG25Q,UACzC/3K,MACHi6Q,EAAiB,aACf9+W,EAAEwxP,YAAc,iBAAmB,oBAAsBqpE,EAAQ76T,QAIrEmpO,EAAAA,OAAAA,IAAekxI,EAAU1gQ,OAE9BgwB,EAAAA,IAAQ0wO,EAAUz9F,GAClBz0F,EAAKm+L,EAAAA,IAASjM,EAAUz9F,GACxBmK,EAAKw/F,EAAAA,IAASlM,EAAUz9F,GACxB30L,EAAIm3R,EAAcj2I,GAIlBrpO,EAAI6pI,EAAE7pI,EAAImoF,EAAEjX,OAAS2oC,EAAE75G,EAAI,EAC3B6pI,EAAEnxD,EAAE,GAAKymS,GAAU3rS,EAAMxzE,EAAIk/W,GAAY,EAAIA,EAAW1rS,EAAMA,GAC9D01L,GAAMA,GAAMhpQ,EAAEgkX,WAAWr6O,GAAK,EAAK7pI,EAAI,EAAI6pI,EAAIw+C,EAAMnoL,EAErDszE,EAAMktS,EACNA,EAAU,EAAA,EACVxgX,EAAAA,IAAQq6W,EAAUpyR,GAGlBs+R,EAAG/tS,EAAE,GAAK,EAGR6hC,EAAIglJ,EAAIr/P,EAAG2pI,EAAG,EAAG,GAEQ,IADzBq9I,EAAKs/F,EAAGjI,KAAKhkQ,EAAEtvF,MAAMg8P,KACdi9F,WAAWh7G,IAClBs9G,EAAKv/F,EACLA,EAAKC,EACL7+F,EAAKo+L,EAAGlI,KAAKhkQ,EAAEtvF,MAAMi8P,EAAK7+F,IAC1Bo+L,EAAKv/F,EACLr9I,EAAI3pI,EAAEm8H,MAAM9hB,EAAEtvF,MAAMi8P,EAAKr9I,IACzB3pI,EAAIgnR,SAGNA,EAAK3nB,EAAI2J,EAAG7sI,MAAMmqP,GAAKv/F,EAAI,EAAG,GAC9Bw/F,EAAKA,EAAGlI,KAAKr3F,EAAGj8P,MAAMo9J,IACtBm+L,EAAKA,EAAGjI,KAAKr3F,EAAGj8P,MAAMg8P,IACtBw/F,EAAGt+R,EAAIkgG,EAAGlgG,EAAI0xB,EAAE1xB,EAIhB8xB,EAAIslJ,EAAIl3E,EAAI4+F,EAHZjnR,GAAQ,EAGWsgX,GAAejkP,MAAMxiB,GAAGusJ,MAAM89G,WAC7C3kH,EAAIknH,EAAID,EAAIxmX,EAAGsgX,GAAejkP,MAAMxiB,GAAGusJ,OAAS,EAAA,CAAK/9E,EAAI4+F,GAAAA,CAAOw/F,EAAID,GAExE9F,EAAUltS,EAEHymC,GAOT22G,EAAE3lH,SAAW,kBACH8vN,EAAQ9uN,OAelB2kH,EAAE81J,YAAc,SAAU/E,EAAI1M,UAClB,MAAN0M,GAAYnC,EAASmC,EAAI,EAAGzrH,GACzBjzB,EAAOh3H,KAAM01Q,EAAI1M,EAAI,IAe9BrkJ,EAAEvmH,SAAW,SAAU9kB,OACjBkc,EACFvhG,EAAI+rG,KACJ9jB,EAAIjoF,EAAEioF,EACNnoF,EAAIE,EAAEF,SAGE,OAANA,EACEmoF,GACFsZ,EAAM,WACFtZ,EAAI,IAAGsZ,EAAM,IAAMA,IAEvBA,EAAM,OAGC,MAALlc,EACFkc,EAAMzhG,GAAKugX,GAAcvgX,GAAKwgX,EAC3Bf,EAAcH,EAAcp/W,EAAEw4E,GAAI14E,GAClC0/W,EAAaJ,EAAcp/W,EAAEw4E,GAAI14E,EAAG,KACxB,KAANulF,EAETkc,EAAMi+Q,EAAaJ,GADnBp/W,EAAIk6G,EAAAA,IAAUmgQ,EAAUr6W,GAAImgX,EAAiBrgX,EAAI,EAAGsgX,IACjB5nS,GAAIx4E,EAAEF,EAAG,MAE5Cw/W,EAASj6R,EAAG,EAAG4jJ,EAASj4J,OAAQ,QAChCuwB,EAAMm+Q,EAAYF,EAAaJ,EAAcp/W,EAAEw4E,GAAI14E,EAAG,KAAM,GAAIulF,EAAG4C,GAAG,IAGpEA,EAAI,GAAKjoF,EAAEw4E,EAAE,KAAI+oB,EAAM,IAAMA,IAG5BA,GAQTmvH,EAAEmqG,QAAUnqG,EAAEv9H,OAAS,kBACd0nO,EAAQ9uN,OAIjB2kH,EAAE2wJ,cAAe,EAEG,MAAhB5B,GAAsBpF,EAAU7sR,IAAIiyR,GAEjCpF,EAsIGj5O,IACF,QAAai5O,EAAUA,UAAYA,OAOjB,IAAVj7W,GAAyBA,EAAOC,QAChDD,EAAOC,QAAUg7W,GAIZqE,IACHA,EAA8B,oBAARrzQ,MAAuBA,KAAOA,KAAOC,QAG7DozQ,EAAarE,UAAYA,IAE1BtuQ,oCCn1FH3sG,EAAAC,QAAA,SAAAonX,EAAAC,EAAA9qK,GACA,UAIA,IAAA+qK,EAAA,IAAAF,EAAAjiJ,WAAA5oB,GAEA,IAAAg/J,EAAA8L,EAAA9L,QACA,IAAAC,EAAA6L,EAAA7L,UACA,IAAAC,EAAA4L,EAAA5L,aACA,IAAAC,EAAA2L,EAAA3L,UACA,IAAAC,EAAA0L,EAAA1L,aACA,IAAAC,EAAAyL,EAAAzL,UACA,IAAAC,EAAAwL,EAAAxL,gBACA,IAAAC,EAAAuL,EAAAvL,gBACA,IAAAC,EAAAsL,EAAAtL,SACA,IAAAC,EAAAqL,EAAArL,UACA,IAAAC,EAAAoL,EAAApL,cACA,IAAAC,EAAAmL,EAAAnL,SACA,IAAAC,EAAAkL,EAAAlL,aACA,IAAAC,EAAAiL,EAAAjL,gBACA,IAAAC,EAAAgL,EAAAhL,QACA,IAAAC,EAAA+K,EAAA/K,WAEA,IAAAC,EAAA8K,EAAA9K,eACA,IAAAC,EAAA6K,EAAA7K,oBACA,IAAAC,EAAA4K,EAAA5K,sBACA,IAAAC,EAAA2K,EAAA3K,sBACA,IAAAC,EAAA0K,EAAA1K,gBACA,IAAAC,EAAAyK,EAAAzK,qBACA,IAAAC,EAAAwK,EAAAxK,uBACA,IAAAC,EAAAuK,EAAAvK,uBAEA,IAAAC,EAAAsK,EAAAtK,eACA,IAAAC,EAAAqK,EAAArK,oBACA,IAAAC,EAAAoK,EAAApK,eACA,IAAAC,EAAAmK,EAAAnK,oBAEA,IAAAC,EAAAkK,EAAAlK,qBAEA,IAAAE,EAAAgK,EAAAhK,aACA,IAAAC,EAAA+J,EAAA/J,cACA,IAAAC,EAAA8J,EAAA9J,cACA,IAAAH,EAAAiK,EAAAjK,kBAEA,IAAAI,EAAA6J,EAAA7J,UAEA,IAAAzxI,EAAAq7I,EAAA90S,KAAAy5J,IAOA,IAAAt6J,EAAA,EACA,IAAA2gM,EAAA,EACA,IAAArwQ,EAAA,EAUA,SAAA45E,EAAA+f,GACAA,EAAAA,EAAA,EAEAjqB,EAAA,EACA2gM,EAAA12K,EAEA,OAAAjqB,EAAA,IAAA2gM,EAAA,GAAA,CACArwQ,EAAAwlX,GAAAD,EAAA71S,GAAA,KAAA61S,EAAA71S,GAAA,GAAA,EAEA,IAAA1vE,EAAA,GAAA,EAAA,CACA,OAIA,OAAAA,EAAA,EAKA,SAAAo9T,EAAAx+T,GACAA,EAAAA,EAAA,EAEA,KAAA8wE,EAAA,IAAA9wE,EAAA,GAAA,IAAAyxQ,EAAA,GAAA,CACA,OAAA,EAGA,OAAA,EAGA,SAAAo1G,EAAA7mX,GACAA,EAAAA,EAAA,EAEA,OACA2mX,EAAA3mX,EAAA,IAAA,EAAA2mX,EAAA3mX,EAAA,EAAA,GACA,EAGA,SAAA8mX,EAAA9mX,GACAA,EAAAA,EAAA,EAEA,OACA2mX,EAAA3mX,EAAA,IAAA,GAAA2mX,EAAA3mX,EAAA,EAAA,IAAA,GAAA2mX,EAAA3mX,EAAA,EAAA,IAAA,EAAA2mX,EAAA3mX,EAAA,EAAA,GACA,EAKA,SAAA+mX,EAAAC,GACAA,EAAAA,EAAA,EAEApM,EAAAoM,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAm2S,EAAAD,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAo8C,EAAA+L,EAAA71S,EAAA,EAAA,GAAA,GAEAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAo2S,EAAAF,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAo8C,EACAiM,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAq2S,EAAAH,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAq8C,EACAgM,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAs2S,EAAAJ,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAu8C,EACA8L,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAu2S,EAAAL,GACAA,EAAAA,EAAA,EAEApM,GAAA,GAAAoM,EAAA,GAAA,GAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAw2S,EAAAN,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAo8C,GACA,GAAA+L,EAAA71S,EAAA,EAAA,GAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAy2S,EAAAP,GACAA,EAAAA,EAAA,EAEA,IAAAthR,EAAA,EAEA,GAAA84N,EAAA,GAAA,EAAA,CACA,OAAA,EAGA94N,EAAAmhR,EAAA/1S,EAAA,EAAA,GAAA,EACA8pS,GAAA,GAAAl1Q,EAAA,GAAA,GAEA50B,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA02S,GAAAR,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAs8C,EACA+L,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA22S,GAAAT,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAw8C,EACA6L,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAssS,GAAA4J,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAq/N,EAAA,EAEAA,EAAA42E,EAAA,GAAA,EACA,GAAAxoD,EAAApuB,EAAA,GAAA,EAAA,CACA,OAAA,EAGArvN,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAs/N,EAAA,GAAA,EAEAgsE,EAAAr7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAA22S,GAAAV,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA21S,EAAA71S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAEA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAorS,EAAAr7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAA42S,GAAAX,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA61S,EAAA/1S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAGA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAorS,EAAAr7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAA62S,GAAAZ,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA81S,EAAAh2S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAGA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAorS,EAAAr7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAA82S,GAAAb,GAEAA,EAAAA,EAAA,EAEA,OAAA,EAGA,SAAAc,GAAAd,GACAA,EAAAA,EAAA,EAEA3K,IAEAvrS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAusS,GAAA2J,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAq/N,EAAA,EAEAA,EAAA42E,EAAA,GAAA,EAEA,GAAAxoD,EAAApuB,EAAA,GAAA,EAAA,CACA,OAAA,EAGArvN,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAs/N,EAAA,GAAA,EAEAksE,EAAAv7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAAg3S,GAAAf,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA21S,EAAA71S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAEA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAsrS,EAAAv7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAAi3S,GAAAhB,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA61S,EAAA/1S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAEA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAsrS,EAAAv7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAAk3S,GAAAjB,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA81S,EAAAh2S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAEA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAsrS,EAAAv7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAAm3S,GAAAlB,GAEAA,EAAAA,EAAA,EAEA,OAAA,EAGA,SAAAmB,GAAAnB,GACAA,EAAAA,EAAA,EAEAzK,IAEAzrS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA0sS,GAAAwJ,GACAA,EAAAA,EAAA,EAEAnL,EAAAmL,EAAA,IAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAs3S,GAAApB,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAq9C,EAAA8K,EAAA71S,EAAA,EAAA,GAAA,GAEAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAu3S,GAAArB,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAq9C,EACAgL,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAw3S,GAAAtB,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAs9C,EACA+K,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAy3S,GAAAvB,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAu9C,EACA8K,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA03S,GAAAxB,GACAA,EAAAA,EAAA,EAEApL,IAEA9qS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAwsS,GAAA0J,GACAA,EAAAA,EAAA,EAEA,IAAA52E,EAAA,EAEAA,EAAA42E,EAAA,IAAA,EAEA,GAAAxoD,EAAApuB,EAAA,GAAA,EAAA,CACA,OAAA,EAGA6rE,EAAA7rE,EAAA,GAEAt/N,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA23S,GAAAzB,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAy9C,EAAA0K,EAAA71S,EAAA,EAAA,GAAA,GAEAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA43S,GAAA1B,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAy9C,EACA4K,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA63S,GAAA3B,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGA09C,EACA2K,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA83S,GAAA5B,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGA29C,EACA0K,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA+3S,GAAA7B,GACAA,EAAAA,EAAA,EAEAhL,IAEAlrS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAg4S,GAAA9B,GACAA,EAAAA,EAAA,EAEAtK,EAAAsK,EAAA,IAAA,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAi4S,GAAA/B,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAk4S,GAAAhC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAm4S,GAAAjC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAo4S,GAAAlC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAq4S,GAAAnC,GACAA,EAAAA,EAAA,EAEAtK,EAAAsK,EAAA,IAAA,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAs4S,GAAApC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAu4S,GAAArC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAw4S,GAAAtC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAy4S,GAAAvC,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAk+C,EAAAiK,EAAA71S,EAAA,EAAA,GAAA,GAEAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA04S,GAAAxC,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAk+C,EACAmK,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA24S,GAAAzC,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAm+C,EACAkK,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA44S,GAAA1C,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAo+C,EACAiK,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA64S,GAAA3C,GACAA,EAAAA,EAAA,EAEAxK,GAAAwK,EAAA,GAAA,IAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA84S,GAAA5C,GACAA,EAAAA,EAAA,EAEA3L,IAEAvqS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA+4S,GAAA7C,GACAA,EAAAA,EAAA,EAEA5L,IAEAtqS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAg5S,GAAA9C,GACAA,EAAAA,EAAA,EAEAzL,IAEAzqS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAi5S,GAAA/C,GACAA,EAAAA,EAAA,EAEA1L,IAEAxqS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAk5S,GAAAhD,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAg+C,EAAAmK,EAAA71S,EAAA,EAAA,GAAA,GAEAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAm5S,GAAAjD,GACAA,EAAAA,EAAA,EAEA,IAAAv5N,EAAA,EACA,IAAA0iE,EAAA,EACA,IAAAkkC,EAAA,IACA,IAAA/gL,EAAA,IACA,IAAA42S,EAAA,IACA,IAAAnwQ,EAAA,IACA,GAAAykN,EAAA,GAAA,EAAA,CACA,OAAA,EAGA/wK,EAAAk5N,EAAA71S,EAAA,EAAA,GAAA,EACAq/I,EAAAw2J,EAAA71S,EAAA,EAAA,GAAA,EAEA,IAAA28E,EAAA,GAAA,KAAA,CACA4mG,GAAA,IAGA/gL,MAAAm6E,EAAA,GAAA,OAAA,GACAy8N,MAAAz8N,EAAA,GAAA,OAAA,EAAA0iE,GAEA,IAAA78I,GAAA,IAAA,CACA2nS,KACA5mH,GAAA,uBAAA61H,SAEA,IAAA52S,GAAA,KAAA,CACA,IAAA+gL,GAAA,IAAA,CACA,IAAA61H,EAAA,IAAA,CACAxO,QACA,CACAF,SAEA,CACA,IAAA0O,EAAA,IAAA,CACAvO,QACA,CACAF,UAGA,CACAR,KACA5mH,EAAAjpB,GAAA,KAAA93J,EAAA,SAAA,OAAA42S,KAIAp5S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAq5S,GAAAnD,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGA08C,EACAyL,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAs5S,GAAApD,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGA28C,EACAwL,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAu5S,GAAArD,GACAA,EAAAA,EAAA,EAEA,OAAA,EAGA,SAAAsD,GAAAtD,GACAA,EAAAA,EAAA,EAEAnK,IAEA/rS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAKA,IAAA81S,GAAA,CAEAG,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EAEAE,EAEAC,EAEAC,EAEAC,EACAiD,GACAA,GACAA,GACAA,GAEAhD,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EAEAC,EAEAC,EAEAC,GAEAC,GACA4C,GACAA,GACAA,GACAA,GAEAjN,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEAsK,GAEAC,GAEAC,GAEAC,GACAwC,GACAA,GACAA,GAEAvC,GAEAzK,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEA0K,GAEAC,GAEAC,GAEAC,GAEAmC,GACAA,GACAA,GACAlC,GAEA3K,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEA4K,GAEAC,GAEAC,GAEAC,GAEA8B,GACAA,GACAA,GACA7B,GAEAlL,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEAmL,GAEAC,GAEAC,GAEAC,GACAyB,GACAA,GACAA,GAEAxB,GAEAC,GAEAA,GAEAA,GAEAA,GAEAA,GAEAA,GAEAK,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEAA,GACAA,GACAA,GAEAI,GACAC,GACAC,GACAC,GACAW,GACAA,GACAA,GACAA,GAEAV,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEAC,GAEAC,GAEAC,GAEAC,GAEAC,GAEAC,GAEAE,GAEAC,GACAC,GACAA,GACAA,GAEAC,IAKA,MAAA,CACAtvS,MAAAA,kCCtzCA,0BAEQg0K,GAAW1vP,EAAQ,UACrB86W,EAAY96W,EAAQ,gBAAgB+6W,UAEpClyI,EAAY7oO,EAAQ,eACpB8+W,EAAUj2I,EAAUi2I,QACpBmM,EAAUpiJ,EAAUoiJ,QAG1BlrX,EAAQmrX,UAAY,SAAoBluJ,OAClChpJ,EAAK42S,EAAM71H,SACfA,EAAgB,IAAT/3B,EAAI,IAAa,EAAI,EAC5BhpJ,GAAgB,IAATgpJ,EAAI,KAAc,EACzB4tJ,GAAkB,EAAT5tJ,EAAI,KAAc,EAAKA,EAAI,GAC/BhpJ,EAEc,KAARA,EACF+gL,GAAQ61H,EAAO,IAAQ,UAEvB71H,EAAO1iL,KAAKy5J,IAAI,EAAG93J,EAAM,KAAO,KAAO42S,GAJhC,qBAAP71H,EAA+B61H,GAgB1C7qX,EAAQq7W,uBAAyB,SAAUp+I,SACnCntH,EAAMmtH,EAAI6N,eACZryJ,EAAM,WACD5E,EAAI,EAAGA,EAAIi8B,EAAKj8B,IACvB4E,IAZY93E,EAYCs8N,EAAIppJ,IAXX,GACC,IAAMlzE,EAAEmqG,SAAS,IAGnBnqG,EAAEmqG,SAAS,IALpB,IAAgBnqG,aAeHo6W,EAAUtiS,EAAK,KAI5Bz4E,EAAQw+W,SAAYjzQ,UACZ9yB,EAAAA,IAAUiX,IACV7uF,EAAOX,OAAOW,KAAK0qG,GACnB55B,EAAS9wE,EAAK8wE,eACXkC,EAAI,EAAGA,EAAIlC,EAAQkC,IAC1B4E,EAAI0V,IAAIttF,EAAKgzE,GAAI03B,EAAI1qG,EAAKgzE,YAErB4E,GAGTz4E,EAAQ4+W,WAAa,CAACxwN,EAAG0iE,IAChB1iE,EAAI88N,EAAUp6J,EAGvB9wN,EAAQ6+W,WAAa,CAACxF,EAAIC,EAAIC,EAAI5vF,WAC1Bv7H,EAAIpuJ,EAAQ4+W,WAAWvF,EAAIC,GAC3BxoJ,EAAI9wN,EAAQ4+W,WAAWrF,EAAI5vF,UAE7Bv7H,EArDgB,YAsDP2sN,EAAU3sN,GAAG1iI,MAAMqzV,GAASC,KAAKluJ,GAEpC1iE,EAAI2wN,EAAWjuJ,GAI3B9wN,EAAQorX,UAAY,SAAoBnuJ,EAAKi3C,SAcrCm3G,EAAM17H,EAAOiE,YAAY,GAC/By3H,EAAI12H,aAAauf,EAAM,SACjBtzE,EAAIyqL,EAAIjrD,aAAa,MAKN,IAAZ,KAAJx/H,UACI,MAOL0qL,EAAO1qL,GAAK,GAAM,YAChB3sH,EAAO2sH,GAAK,GAAM,IAClBiqL,EAAW,QAAJjqL,KASR3sH,GAAO,KAASA,GAAO,IAC1Bq3S,IAASr3S,EAAM,KAAQ,KAAO42S,GAAQ,cAM5B52S,GAAO,KAASA,EAAM,YAczB,KAbH42S,GAAS,GAAM,IAAM52S,GAAQ,SACxB,EAETq3S,GAAST,EAAO,SAAc,IAAM52S,SAgBtCgpJ,EAAIkkG,cAAcmqD,EAAK,IAChB,GAGTtrX,EAAQurX,UAAY,SAAUh4S,EAAGyS,OAC3BwlS,EAAOj4S,EAAE,GAAGu3J,WACZ2gJ,EAAOzlS,EAAE,GAAG8kJ,kBAEZ0gJ,EAAOC,EACF,EAGLA,EAAOD,GACD,EAGHj4S,EAAE,GAAGirP,QAAQx4O,EAAE,KAIxBhmF,EAAQ65W,eAAkBv/P,GACX,IAANA,GAAY,EAAIA,EAAI,EAG7Bt6G,EAAQi7W,aAAgBt6W,QAClBsvF,EAAQ,KAGRtvF,KAAOA,EAAKA,EAAI,UACXA,OAGI,IAANA,GACLA,IAAM,EACNsvF,GAAS,SAGJ,GAAKA,0FC5Kd,aAEA,MAAA8qR,EAAA96W,EAAA,gBAAA+6W,UAEAh7W,EAAA0rX,GAAA,CACAC,QAAA,EACAC,QAAA,EACA7N,YAAA,EACAC,YAAA,EACAG,MAAA,EACAF,IAAA,EACAH,IAAA,EACA+N,aAAA,GAGA7rX,EAAA89W,IAAA,CACAgO,YAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,aAAA,EACAC,SAAA,EACAC,mBAAA,GACAC,gBAAA,GACAC,gBAAA,GACAC,KAAA,GACAC,IAAA,GACAC,UAAA,GACAC,OAAA,GACAC,OAAA,GACAC,KAAA,IAGA5sX,EAAA6sX,SAAA,CACAxmG,KAAA,EACA9I,IAAA,GACAi3E,IAAA,GACAK,KAAA,GACAi4B,MAAA,GACAC,WAAA,IAGA/sX,EAAAgtX,OAAA,CACAC,MAAA,GACAC,KAAA,GACA5zH,KAAA,GACA6zH,UAAA,IAGAntX,EAAAotX,KAAA,CACA9zH,KAAA12P,OAAA,QACAuqX,UAAAvqX,OAAA,SACAi7W,OAAAj7W,OAAA,UACAqoX,MAAAroX,OAAA,SACAyqX,OAAAzqX,OAAA,WAGA5C,EAAA++W,QAAAzsS,KAAAy5J,IAAA,EAAA,IACA/rO,EAAAkrX,QAAA54S,KAAAy5J,IAAA,EAAA,IAEA/rO,EAAA8+W,cAAA,QACA9+W,EAAAs7W,QAAA,IAAAP,GAAA,GACA/6W,EAAA00V,IAAA,IAAAqmB,EAAA,IACA/6W,EAAAw0V,IAAA,IAAAumB,EAAA,GAEA/6W,EAAA69W,OAAA,CACAM,MAAA,EACAD,OAAA,EACAD,IAAA,EACAH,IAAA,EACAC,YAAA,EACAC,YAAA,uDCvEA,aAEA,MAAAl1I,EAAA7oO,EAAA,eACAyrX,EAAA5iJ,EAAA4iJ,GACAsB,EAAAlkJ,EAAAkkJ,OACAI,EAAAtkJ,EAAAskJ,KAKA,MAAAxU,EAMAr1W,YAAAnD,GACA,GAAA,iBAAAA,EACA,MAAA,IAAAolG,MAAA,+BAAAplG,GAEA,GAAAA,EAAA,GAAAA,EAAA,MAAA,EAAAA,KAAAA,EACA,MAAA,IAAAolG,MAAA,2CAAAplG,GAEAssG,KAAAtsG,MAAAA,EAQAmD,WACA,MAAA,UAAAmpG,KAAAtsG,MAAA,IAQAmD,UACA,MAAA,UAAAmpG,KAAAtsG,MAAA,IASAmD,WAAA2wV,GACA,OAAAA,EAAAo5B,SAAA5gR,KAAAtsG,MAAAsrX,EAAAG,cASAtoX,gBAAAgoG,GACA,OAAAA,aAAAqtQ,EAaAr1W,cAAA8iG,EAAAknR,GAIA,OAHA,MAAAA,IACAA,GAAA,GAEAlnR,GACA,KAAA2mR,EAAAC,MACA,OAAA,EACA,KAAAD,EAAAE,KACA,OAAA,EACA,KAAAF,EAAA1zH,KACA,OAAAi0H,EACA,KAEAH,EAAA9zH,KAEA,KAAA0zH,EAAAG,UACA,OAAAI,OACA,EAEAH,EAAAD,UAEA,KAAA,EACA,IAAAI,EACA,MAAA,IAAA/nR,MAAA,iBAEA,OAAA4nR,EAAAnC,MACA,QACA,OAAA,IAAArS,EAAAvyQ,KAKAtmG,EAAAC,QAAA44W,qDC1GA,aAOA,MAAAd,EAQAv0W,YAAA2tE,EAAA9wE,EAAA+lG,GAIA,GAHAuG,KAAAx7B,IAAAA,EACAw7B,KAAAtsG,MAAAA,EACAssG,KAAAvG,IAAAA,EACA,iBAAAuG,KAAAx7B,IACA,MAAA,IAAAs0B,MAAA,4BAAAkH,KAAAx7B,IAAA,KAEA,GAAAw7B,KAAAx7B,IAAA,IAAA,EAAAw7B,KAAAx7B,OAAAw7B,KAAAx7B,IACA,MAAA,IAAAs0B,MAAA,mCAAAkH,KAAAx7B,KASA3tE,WACA,MAAA,GAAAmpG,KAAAx7B,OAAAqD,KAAAC,UAAAk4B,KAAAtsG,UASAmD,WAAA2wV,GAEA,OADAA,EAAAs5B,SAAA9gR,KAAAx7B,KACAgjR,EAAAu5B,QAAA/gR,KAAAtsG,OAcAmD,QAAAmqX,GACA,IAAAn6C,EAAAnlL,EAEA,GAAA,mBADAA,EAAA,MAAAs/N,EAAAA,EAAAhhR,KAAAx7B,UAAA9uE,IAGA,mBADAgsJ,EAAA0pN,EAAA,OAAAprQ,KAAAx7B,MAEA,OAAAw7B,KAGA,IACA,OAAA0hD,EAAA9jD,KAAAwtQ,EAAAprQ,KAAAtsG,OACA,MAAA67E,GAGA,OAFAs3P,EAAAt3P,EACAywB,KAAAvG,IAAAotO,EACA7mO,OAKA3sG,EAAAC,QAAA83W,gCC7EA,aAEA,MAAAr0I,qBACAA,EAAAC,OACAA,EAAA7H,gBACAA,EAAA8H,YACAA,GACA1jO,EAAA,aACA6tG,EAAA7tG,EAAA,kBAEAF,EAAAC,QAAA,CACAm5N,IAAAsK,EACA5H,gBAAAA,EACA6H,OAAAA,EACA51H,SAAAA,EACA61H,YAAAA,6ECfA,aAEA,MAAAA,EAAA33H,KAAAkpG,SACAlpG,KAAAkpG,SAAA+C,SAAA,KAAAjsG,KAAAkpG,SAAAhjG,KACA,GACAinH,EAAAntH,KAAAmtH,IAuIAp5N,EAAAC,QAAA,CACAyjO,qBAtIA,MACAlgO,YAAA+uG,EAAA,GAAAw6B,EAAA62F,GACAj3H,KAAAulB,MAAA,IAAAknG,EAAA7mH,EAAAw6B,GACApgC,KAAArtG,KAAAqtG,KAAAopG,SAAAppG,KAAAiM,OACAjM,KAAAuF,KACAvF,KAAAk3H,UAAAl3H,KAAAm3H,SACAn3H,KAAAk3H,SAAA,IAAAl3H,KAAAm3H,SACA,KAEAn3H,KAAA0oG,MACA1oG,KAAAiM,QAAAjM,KAAAiM,OAAA9vB,WAAA,KACA6jB,KAAAiM,OAAA7mC,MAAA,GACA,KAGAiuC,WACA,OAAArT,KAAAulB,MAAAlS,KAEA7N,WACA,OAAAxF,KAAAulB,MAAA/f,KAEA4xH,eACA,OAAAp3H,KAAAulB,MAAA6xG,SAEA9gB,WACA,OAAAt2G,KAAAulB,MAAA+wF,KAEA+gB,aACA,OAAAr3H,KAAAulB,MAAA8xG,OAEAF,eACA,OAAAn3H,KAAAulB,MAAA4xG,SAEA/tB,eACA,OAAAppG,KAAAulB,MAAA6jF,SAEA3jG,WACA,OAAAzF,KAAAulB,MAAA9f,KAEA8lG,eACA,OAAAvrG,KAAAulB,MAAAgmF,SAEAt/F,aACA,OAAAjM,KAAAulB,MAAAtZ,OAEA+nG,mBACA,OAAAh0G,KAAAulB,MAAAyuF,aAEAkjB,eACA,OAAAl3H,KAAAulB,MAAA2xG,SAGA7jH,SAAAA,GACArT,KAAAulB,MAAAlS,KAAAA,EAEA7N,SAAAA,GACAxF,KAAAulB,MAAA/f,KAAAA,EAEA4xH,aAAAA,GACAp3H,KAAAulB,MAAA6xG,SAAAA,EAEA9gB,SAAAA,GACAt2G,KAAAulB,MAAA+wF,KAAAA,EAEA+gB,WAAAA,GACAr3H,KAAAulB,MAAA8xG,OAAAA,EAEAF,aAAAA,GACAn3H,KAAAulB,MAAA4xG,SAAAA,EAEA/tB,aAAAA,GACAppG,KAAAulB,MAAA6jF,SAAAA,EAEA3jG,SAAAA,GACAzF,KAAAulB,MAAA9f,KAAAA,EAEA8lG,aAAAA,GACAvrG,KAAAulB,MAAAgmF,SAAAA,EAEAt/F,WAAAA,GACAjM,KAAAulB,MAAAtZ,OAAAA,EAEA+nG,iBAAAA,GACAh0G,KAAAulB,MAAAyuF,aAAAA,EAEAkjB,aAAAA,GACAl3H,KAAAulB,MAAA2xG,SAAAA,EAGArgO,gBAAAq5K,GACA,OAAAlwE,KAAAulB,MAAAmnG,gBAAAx8C,GAEAr5K,gBAAAq5K,GACAlwE,KAAAulB,MAAAonG,gBAAAz8C,GAEAr5K,SACA,OAAAmpG,KAAAulB,MAAAn+B,SAEAvwF,WACA,OAAAmpG,KAAAulB,MAAAnnB,WAEAvnG,SACA,OAAAmpG,KAAA5B,aAiCA+wH,gBAAA7vH,KAAA6vH,gBACA8H,YAAAA,EACAD,OA/BA,SAAAn4H,GACA,GAAA,iBAAAA,EAAA,CAGA,OAFA,IAAA4tH,EAAA5tH,GAEAT,WAGA,KAAAS,aAAA4tH,GAAA,CACA,MAAA6K,EACAz4H,EAAAq4H,UAAAr4H,EAAAs4H,SACA,GAAAt4H,EAAAq4H,YAAAr4H,EAAAs4H,YACA,GACA5xH,EAAA1G,EAAA0G,KAAA1G,EAAA0G,KAAA,IAAA,GACAE,EAAA5G,EAAA4G,KAAA,IAAA5G,EAAA4G,KAAA,GACA8lG,EAAA1sG,EAAA0sG,SAAA1sG,EAAA0sG,SAAA,KAAA,GACA/lG,EAAA3G,EAAA2G,MAAA,GACA4xH,EAAAv4H,EAAAu4H,UAAA,GACAnrH,EAAApN,EAAAoN,SAAApN,EAAA6pG,MAAA,IAAA7pG,EAAA6pG,MAAA,IACAr1F,EAAAxU,EAAAwU,MAAA,GACA+1F,EAAAvqG,EAAAuqG,UAAA,GAGA,MAAA,GAAAmC,IAAA+rB,GAAA/xH,IAAAC,GACA4xH,EAAA3xH,IAHA5G,EAAAlsG,MAAAy2M,EAAAn9F,IAGAoH,qCCxIA,aAEA,MAAA0jH,qBAAAA,EAAAC,OAAAA,GAAAzjO,EAAA,SAEAF,EAAAC,QAAA,CAAAsyG,EAAA4iG,EAAA,GAAA+uB,EAAA,GAAAC,KACA,IAMAC,EANAlsB,EAAA/C,EAAA+C,SACA/C,EAAA+C,SAAAryH,QAAA,IAAA,IACA,OAGAqyH,GAAAgsB,EAAAhsB,IAAAisB,GAAAjsB,GAAA,IAGA,IACAksB,EAAA,IAAAV,EAAAnxH,GACA,MAAAnM,GACAg+H,EAAA,GAGA,MAAAr3F,EAAA5sI,OAAAiqG,OAAA,GAAA+qG,EAAA,CACA+C,SAAAA,GAAAksB,EAAAlsB,SACA/lG,KAAAgjG,EAAAhjG,MAAAiyH,EAAAjyH,OAGA,OAAA,IAAAuxH,EAAAnxH,EAAAoxH,EAAA52F,IAAAhiC,uDCxBA,0BAEQ6kJ,GAAW1vP,EAAQ,eACnBk5N,GAAQl5N,EAAQ,WAClB86W,EAAY96W,EAAQ,gBAAgB+6W,UAEpC/tF,EAAQhtR,EAAQ,WAChB6oO,EAAY7oO,EAAQ,eACpByrX,EAAK5iJ,EAAU4iJ,GACfmB,EAAW/jJ,EAAU+jJ,SACrB9N,EAAUj2I,EAAUi2I,QACpBqO,EAAOtkJ,EAAUskJ,KACjBtP,EAAMh1I,EAAUg1I,IAChB6P,EAAQ7kJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAU+jJ,SAASr4B,IAC7Do5B,EAAS9kJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAU+jJ,SAASh4B,KAC9Dg5B,EAAU/kJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAU+jJ,SAASC,MAC/DI,EAAQpkJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAUkkJ,OAAOE,KAC3DD,EAASnkJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAUkkJ,OAAOC,MAC5DE,EAAarkJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAUkkJ,OAAOG,UAChE7zH,EAAQxwB,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAUkkJ,OAAO1zH,KAE3Dw0H,EAAAA,IAAgB/S,EAAU,oBAC1BgT,EAAUp+H,EAAOx5F,KAAK,SAAU,OAChC63N,EAAcr+H,EAAOx5F,KAAK,SAAU,OACpC83N,EAAct+H,EAAOx5F,KAAK,SAAU,OAY1C,MAAAwiN,EAKEt/P,YAAah4G,GACXA,EAAUA,GAAAA,GAEVqrG,KAAKwhR,UAAsC,mBAAnB7sX,EAAQ67N,OAChCxwH,KAAKyhR,OAAS9sX,EAAQ67N,OAEtBxwH,KAAK0hR,cAAAA,CAAAA,CACFj1J,EAAKzsH,KAAK2hR,UAAAA,CACVtT,EAAWruQ,KAAK4hR,uBAGbC,EAAWltX,EAAQmtX,UAAAA,GACnB1+Q,EAAMy+Q,EAAS58S,eACZkC,EAAI,EAAGA,EAAIi8B,EAAKj8B,IACvB64B,KAAK+hR,gBACHF,EAAS16S,GAAG,GACZ06S,EAAS16S,GAAG,IAIhB64B,KAAKimP,SAGP87B,gBAAiBj7S,EAAM0tJ,SACfpxH,EAAMpD,KAAK0hR,cAAcz8S,eACtBkC,EAAI,EAAGA,EAAIi8B,EAAKj8B,IAAAA,IACX64B,KAAK0hR,cAAcv6S,GAAG,KACtBL,EAAAA,OACJimF,EAAM/sD,KAAK0hR,cAAcv6S,GAAG,UAClC64B,KAAK0hR,cAAcv6S,GAAG,GAAKqtJ,EACpBznE,UAGX/sD,KAAK0hR,cAAc52S,KAAAA,CAAMhE,EAAM0tJ,IACxB,KAGT1pJ,KAAM6uB,UACCA,IAILqG,KAAKp1B,OAAOo1B,KAAKj7B,QAAU40B,EAC3BqG,KAAKgiR,aAAahiR,KAAKj7B,QAAU,EACjCi7B,KAAK84M,aAAa94M,KAAKj7B,QAAU40B,EAAI10B,OACrC+6B,KAAKj7B,SAEDi7B,KAAKwhR,WACPxhR,KAAKyhR,OAAOzhR,KAAK6nN,aAGZ,GAGTo6D,UAAWtoR,EAAKyjC,EAAQh6B,UACtBpD,KAAKp1B,OAAOo1B,KAAKj7B,QAAU40B,EAC3BqG,KAAKgiR,aAAahiR,KAAKj7B,QAAUq4D,EACjCp9B,KAAK84M,aAAa94M,KAAKj7B,QAAUq+B,EACjCpD,KAAKj7B,SAEDi7B,KAAKwhR,WACPxhR,KAAKyhR,OAAOzhR,KAAK6nN,aAGZ,EAGTq6D,WAAYvoR,UACHqG,KAAKiiR,UAAUtoR,EAAK,EAAG,GAGhCwoR,cAAexoR,UACNqG,KAAKiiR,UAAUtoR,EAAK,EAAG,GAGhCyoR,cAAezoR,UACNqG,KAAKiiR,UAAUtoR,EAAK,EAAG,GAGhC0oR,cAAe1oR,UACNqG,KAAKiiR,UAAUtoR,EAAK,EAAG,GAGhC2oR,kBACStiR,KAAKl1B,KAAKu2S,GAGnBkB,cAAe1jR,SACP2oK,EAAQ3oK,EAAM,EAAKyiR,EAAcC,SAChCvhR,KAAKl1B,KAAK08L,GAGnBg7G,WAAY3jR,SACJwvJ,EAAKpL,EAAOiE,YAAY,MAE1Bq5B,EAAMm+F,UAAUrwH,EAAIxvJ,IAClB0hL,EAAMk+F,UAAUpwH,KAAQxvJ,SACnBmB,KAAKkiR,WAAWjB,IAASjhR,KAAKl1B,KAAKujL,SAIxC06B,EAAK9lC,EAAOiE,YAAY,UAC9B6hC,EAAG9gC,aAAappJ,EAAK,GACjBkqL,EAAG5gC,YAAY,KAAOtpJ,EACjBmB,KAAKkiR,WAAWhB,IAAUlhR,KAAKl1B,KAAKi+M,GAGtC/oL,KAAKkiR,WAAWf,IAAWnhR,KAAKqiR,cAAcxjR,GAGvD+hR,SAAU/hR,EAAKuvF,EAAIq0L,SACXvjS,EAAIkvG,GAAM,SACZvvF,EAAM,GACDmB,KAAKkiR,WAAWhjS,EAAI2f,GAGzBA,GAAO,IACFmB,KAAKkiR,WAAWhjS,EAAIihS,EAAStvG,MAAQ7wK,KAAKkiR,WAAWrjR,GAG1DA,GAAO,MACFmB,KAAKkiR,WAAWhjS,EAAIihS,EAASr4B,MAAQ9nP,KAAKmiR,cAActjR,GAG7DA,GAAO,WACFmB,KAAKkiR,WAAWhjS,EAAIihS,EAASh4B,OAASnoP,KAAKoiR,cAAcvjR,GAG9DA,GAAO14B,OAAO+6O,iBACTlhN,KAAKkiR,WAAWhjS,EAAIihS,EAASC,QAClCpgR,KAAKoiR,cAAcx8S,KAAK6nC,MAAM5O,EAAMwzQ,KACpCryQ,KAAKoiR,cAAcvjR,EAAMwzQ,GAGzBjkL,IAAO4wL,EAAGE,QACLl/Q,KAAKwiR,WAAWC,GAGlBziR,KAAKwiR,WAAW3jR,GAGzB6jR,YAAa7jR,UACPA,EAAM,EACDmB,KAAK4gR,UAAU/hR,EAAM,EAAGmgR,EAAGE,QAASrgR,GAEpCmB,KAAK4gR,SAAS/hR,EAAKmgR,EAAGC,SAIjC0D,YAAa9jR,WACH,QACAA,GAAQA,SACLmB,KAAKsiR,SAASzjR,QAClB6mJ,SAAS7mJ,UACLmB,KAAKuiR,cAAc1jR,QACrBA,EAAM,GAAO,SACXmB,KAAK0iR,YAAY7jR,kBAEjBmB,KAAKwiR,WAAW3jR,IAI7B+jR,YAAa/jR,SACLuE,EAAM6/I,EAAO7kB,WAAWv/H,EAAK,eAC5BmB,KAAK4gR,SAASx9Q,EAAK47Q,EAAG1N,cAAgBtxQ,KAAKiiR,UAAUpjR,EAAK,EAAGuE,GAGtEy/Q,aAAchkR,UACLmB,KAAKkiR,WAAWrjR,EAAM2hR,EAAOD,GAGtCuC,eAAgBjkR,UACPmB,KAAKkiR,WAAWzB,GAGzBsC,WAAYv7B,EAAK3oP,SACTuE,EAAMvE,EAAI55B,WACXuiR,EAAIo5B,SAASx9Q,EAAK47Q,EAAGvN,cACjB,UAEAngR,EAAI,EAAGA,EAAI8R,EAAK9R,QAClBk2P,EAAIu5B,QAAQliR,EAAIvN,WACZ,SAGJ,EAGTwvR,SAAUt8S,UACDw7B,KAAK4gR,SAASp8S,EAAKw6S,EAAG5N,KAG/B4R,UAAWx7B,EAAK3oP,UAKP2oP,EAAIs5B,SAAS1P,EAAIiO,aAAe73B,EAAIu5B,QAAQn7S,KAAKuoC,MAAMtP,EAAM,MAGtEokR,YAAaz7B,EAAK3oP,UACT2oP,EAAIo5B,SAAS/hR,EAAI55B,OAAQ+5S,EAAG3N,cAAgB7pB,EAAI18Q,KAAK+zB,GAG9DqkR,cAAe17B,EAAK3oP,UACX2oP,EAAIy7B,YAAYz7B,EAAK3oP,EAAIz5B,SAGlC+9S,YAAa37B,EAAK3oP,UACT2oP,EAAIs5B,SAAS1P,EAAI6O,SAAWz4B,EAAIu5B,QAAQliR,EAAI9pB,QAGrDquS,SAAU57B,EAAK3oP,OACR2oP,EAAIo5B,SAAS/hR,EAAI5B,KAAM+hR,EAAGvN,cACtB,YAEE7jQ,KAAK/O,MACT2oP,EAAIu5B,QAAQnzQ,UACR,SAGJ,EAGT+zQ,SAAUn6B,EAAK3oP,UACN2oP,EAAIs5B,SAAS1P,EAAI0O,MAAQt4B,EAAIu5B,QAAQliR,EAAIm4H,UAGlDqsJ,YAAaxkR,OACPr6B,EAAM4sS,EAAIkO,WACVzgR,EAAIo6Q,eACNp6Q,EAAMA,EAAIg7Q,UAAUzpP,MAAM,GAC1B5rD,EAAM4sS,EAAImO,gBAER/pR,EAAMqJ,EAAIT,SAAS,IACnB5I,EAAIvwB,OAAS,IACfuwB,EAAM,IAAMA,SAER+6H,EAAM0yB,EAAOx5F,KAAKj0D,EAAK,cACtBwK,KAAK8gR,SAASt8S,IAAQw7B,KAAKijR,YAAYjjR,KAAMuwH,GAGtDqxJ,eAAgBp6B,EAAK3oP,MACfA,EAAIK,eACCsoP,EAAI86B,eAERzjR,EAAI6mJ,kBACA8hG,EAAI+6B,cAAc1jR,EAAIo6Q,cAAgB5sQ,EAAAA,EAAWA,EAAAA,MAEtDxN,EAAI4mJ,mBACC+hG,EAAI67B,YAAYxkR,OAEnB2oP,EAAIs5B,SAAS1P,EAAIoO,gBACrBh4B,EAAIo5B,SAAS,EAAG5B,EAAGvN,cACZ,QAGHvoN,EAAMrqD,EAAIq5Q,gBACVoL,EAAQzkR,EAAIy6Q,aAAAA,IAAiBjL,EAAU,IAAIhvI,IAAIn2E,YAChDs+L,EAAIk7B,aAAax5N,KAGlBo6N,EAAMnpH,MAAM4+G,WAAWqI,GAClB55B,EAAIk7B,YAAYY,EAAMtkR,YAEtBwoP,EAAI67B,YAAYC,IAI3BC,SAAU/7B,EAAK3oP,WACR2oP,EAAIo5B,SAAS/hR,EAAI5B,KAAM+hR,EAAGzN,MAIxBvxQ,KAAKwjR,YACV3kR,EAAI5B,KACJY,MAAM4rD,KAAK5qD,IAIf4kR,YAAa5kR,OACNA,SACImB,KAAKkiR,WAAWt1H,WAGrBxpJ,EAAMpD,KAAK0hR,cAAcz8S,OACpBkC,EAAI,EAAGA,EAAIi8B,EAAKj8B,OACnB03B,aAAemB,KAAK0hR,cAAcv6S,GAAG,UAChC64B,KAAK0hR,cAAcv6S,GAAG,GAAGy2B,KAAKiB,EAAKmB,KAAMnB,OAIhD6iD,EAAI7iD,EAAI6kR,cACK,mBAANhiO,SACFA,EAAE9jD,KAAKiB,EAAKmB,UAGjB7rG,EAAOX,OAAOW,KAAK0qG,GACnB2+K,EAAYrpR,EAAK8wE,eAChB+6B,KAAK4gR,SAASpjG,EAAWwhG,EAAGzN,MAI1BvxQ,KAAKwjR,YACVhmG,EACArpR,EAAKi2E,KAAK/1E,GAAAA,CAAOA,EAAGwqG,EAAIxqG,OAI5BmvX,YAAapgR,EAAKh5B,GAOhBA,EAAMA,EAAIA,KAAI,SAAUvD,UACtBA,EAAE,GAAKolS,EAAQ3oQ,OAAOz8B,EAAE,IACjBA,KACNulB,KAAKm0L,EAAMs+F,mBAELvtR,EAAI,EAAGA,EAAI8R,EAAK9R,IAAAA,KAClB0O,KAAKl1B,KAAKV,EAAIknB,GAAG,WACb,MAGJ0O,KAAK+gR,QAAQ32S,EAAIknB,GAAG,WAChB,SAIJ,EASTqzJ,MAAO9lJ,UACEmB,KAAK+gR,QAAQliR,GAStBkiR,QAASliR,UA7WX,SAAiBA,YAGHT,SAASR,KAAKiB,GAAKz5B,MAAM,GAAI,GA2W7Bu+S,CAAO9kR,QAGV,gBACImB,KAAK2iR,YAAY9jR,OACrB,gBACImB,KAAK4iR,YAAY/jR,OACrB,iBACImB,KAAK6iR,aAAahkR,OACtB,gBACImB,KAAKyjR,YAAY5kR,OACrB,eACImB,KAAK+iR,WAAW/iR,KAAMnB,OAC1B,oBACImB,KAAKijR,YAAYjjR,KAAMijJ,EAAO8H,SAASlsJ,GAAOA,EAAMokJ,EAAOx5F,KAAK5qD,QACpE,cACImB,KAAKkiR,WAAWt1H,OACpB,mBACI5sJ,KAAK8iR,eAAejkR,OACxB,aACImB,KAAKujR,SAASvjR,KAAMnB,OACxB,aACImB,KAAKojR,SAASpjR,KAAMnB,OACxB,aACImB,KAAK2hR,SAAS3hR,KAAMnB,OACxB,mBACImB,KAAK4hR,eAAe5hR,KAAMnB,OAC9B,cACImB,KAAKgjR,UAAUhjR,KAAMnB,OACzB,gBACImB,KAAKmjR,YAAYnjR,KAAMnB,OAC3B,gBACKA,QACD6hR,EAAK9zH,YACD5sJ,KAAKyjR,YAAY,WACrB/C,EAAKD,iBACDzgR,KAAK8iR,oBAAeptX,qBAGjBojG,MAAM,mBAAqB+F,EAAIT,8BAGnCtF,MAAM,wBAA0B+F,EAAM,MAAQA,EAAMA,EAAIT,WAAa,MAIrFypN,cACsB,IAAhB7nN,KAAKj7B,cACA,aAGL6F,EAASo1B,KAAKp1B,OACdkuO,EAAe94M,KAAK84M,aACpBkpE,EAAehiR,KAAKgiR,aACpBj9S,EAASi7B,KAAKj7B,OAGdk4B,EAAO,EACP91B,EAAI,EAEDA,EAAIpC,EAAQoC,IACjB81B,GAAQ67M,EAAa3xO,OAGnB4E,EAAMk3K,EAAOiE,YAAYjqJ,GACzB13B,EAAQ,EACRN,EAAS,MAGRkC,EAAI,EAAGA,EAAIpC,EAAQoC,IAAAA,QACtBlC,EAAS6zO,EAAa3xO,GAEd66S,EAAa76S,SACd,EACHyD,EAAOzD,GAAGlqE,KAAK8uE,EAAKxG,cAEjB,EACHwG,EAAIsoP,WAAWzpP,EAAOzD,GAAI5B,GAAO,cAE9B,EACHwG,EAAI0oP,cAAc7pP,EAAOzD,GAAI5B,GAAO,cAEjC,EACHwG,EAAI8oP,cAAcjqP,EAAOzD,GAAI5B,GAAO,cAEjC,EACHwG,EAAIw9K,cAAc3+K,EAAOzD,GAAI5B,GAAO,cAEjC,EACHwG,EAAI44K,MAAM/5K,EAAOzD,GAAI5B,EAAON,EAAQ,gCAG1B6zB,MAAM,iBAGpBvzB,GAASN,MAGPm2B,EAAMrvB,SAEVi0B,KAAKimP,SAEE7qP,EAGT6qP,SACEjmP,KAAKp1B,OAAAA,GACLo1B,KAAKgiR,aAAAA,GACLhiR,KAAK84M,aAAAA,GACL94M,KAAKj7B,OAAS,gBAQDmrG,SACPysD,EAAAA,IAAUsvI,MACJtvI,EAAIokJ,QAAQ7wM,aAEZp3E,MAAM,iCAGX6jI,EAAIkrF,YAIfx0T,EAAOC,QAAU24W,+HCxgBjB,IAAA9gN,EAAA53J,EAAA,cAuBA,SAAAqwX,EAAA/kR,EAAAglR,GAIA,IAAA,IAAA7uX,KAHA6uX,EAAA,IAAA14N,EAAAtsD,EAAAglR,GAGAhlR,EAAA,CACA,IAAAlF,EAAAkF,EAAA7pG,GACA,GAAA2kG,aAAAnmG,SACAqwX,EAAAxyB,SAAA13P,IAAAiqR,EAAAjqR,EAAAkqR,IACA,OAAA,EAKA,OAAA,EAlCAxwX,EAAAC,QAOA,SAAAurG,GACA,KAAAA,aAAArrG,QACA,MAAA,IAAAuxG,UAAA,gDAEA,OAAA6+Q,EAAA/kR,sDCLA,SAAAssD,EAAAz3J,EAAA0pF,GACA4iB,KAAAtsG,MAAAA,EACAssG,KAAA5iB,KAAAA,EAVA/pF,EAAAC,QAAA63J,EAkBAA,EAAAxtD,UAAA0zP,SAAA,SAAA39V,GAGA,IAFA,IAAA4qF,EAAA0hB,KAEA1hB,GAAA,CACA,GAAAA,EAAA5qF,QAAAA,EAAA,OAAA,EACA4qF,EAAAA,EAAAlB,KAGA,OAAA,iCC1BA,aAEA,MAAAmxI,EAAAh7N,EAAA,QACAqsG,EAAArsG,EAAA,UAWAD,EAAA0yK,QAAA,CAAAo4L,EAAAzrW,KACA,IAAAs0E,EAAA24B,EAAAy+P,YAAAD,GAEA,MAAAn4P,EAAAtzG,EAAAmtF,MAAA,KAAA/R,OAAAsP,SACA,KAAA4oB,EAAAhhC,QAAA,CACA,MAAAjwE,EAAAixG,EAAAtB,QACA,QAAAjvG,IAAAuxE,EAAAjyE,GACA,MAAA,IAAA8jG,MAAA,2BAAA9jG,MAIA,GADAiyE,EAAAA,EAAAjyE,GACAu5N,EAAAsM,MAAA5zJ,GACA,MAAA,CACAvzE,MAAAuzE,EACAm1R,cAAAn2P,EAAA37B,KAAA,MAKA,MAAA,CACA52E,MAAAuzE,EACAm1R,cAAA,KAIA,MAAAl7K,EAAA,UAAAj6G,EAAAt0E,GAEA,KAAAs0E,aAAAwxJ,YAAAlK,EAAAsM,MAAA5zJ,IAAA,iBAAAA,GACA,OAAAA,GAGA,IAAA,MAAAg0B,KAAAznG,OAAAW,KAAA8yE,GAAA,CACA,MAAA68S,OAAApuX,IAAA/C,EAAAsoG,EAAAtoG,EAAA,IAAAsoG,QACA6oR,QACA5iM,EAAAj6G,EAAAg0B,GAAA6oR,KAWAxwX,EAAA07V,KAAA,UAAAoP,GACA,MAAAn3R,EAAA24B,EAAAy+P,YAAAD,SAEAl9K,EAAAj6G,+DC9DA,aAiBA5zE,EAAAC,QARAggJ,MAAAv+D,IACA,UAAA,MAAAghG,KAAAhhG,EACA,OAAAghG,iCCXA,aAEAviL,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAA4vG,EAAA/vG,EAAA,mBACA6wG,EAAA7wG,EAAA,mBACAg+G,EAAAh+G,EAAA,kBAIAD,EAAAgwG,OAAAA,EAAAA,OACAhwG,EAAA8wG,OAAAA,EAAAA,OACA9wG,EAAA61J,MAAA53C,EAAA43C,MACA71J,EAAAssP,KAAAruI,EAAAquI,+GCbA,aAEApsP,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAAiwK,EAAApwK,EAAA,WACAg+G,EAAAh+G,EAAA,cACAw6S,EAAAx6S,EAAA,WACAq5S,EAAAr5S,EAAA,eACAwwX,EAAAxwX,EAAA,aACAywX,EAAAzwX,EAAA,mBACA0wX,EAAA1wX,EAAA,cACA2wX,EAAA3wX,EAAA,gBACA4wX,EAAA5wX,EAAA,eACA6wX,EAAA7wX,EAAA,gBACA8wX,EAAA9wX,EAAA,eACA+wX,EAAA/wX,EAAA,aACAgxX,EAAAhxX,EAAA,aACAixX,EAAAjxX,EAAA,eAEA,MAAAkxX,EAAA,CACAC,SAAA,EACAC,UAyKA,SAAAhvL,EAAAC,GACA,MAAAgvL,EAAA/mR,MAAA/gB,QAAA64G,EAAA,IAAAA,EAAA,GAAA,GAAAA,EAAA,GACAkvL,EAAAhnR,MAAA/gB,QAAA84G,EAAA,IAAAA,EAAA,GAAA,GAAAA,EAAA,GACA,GAAAgvL,EAAA99S,OAAA+9S,EAAA/9S,KACA,OAAA89S,EAAA99S,KAAAgrP,QAAA+yD,EAAA/9S,MAEA,MAAAg+S,EAAAF,EAAA99S,KAAAg+S,MACAC,EAAAC,EAAAF,GAAAG,cAAAL,EAAAC,GACA,IAAAE,GACArqR,QAAAs6E,KAAA,yEAEA,OAAA+vM,GAnLAG,iBAAAnB,EAAAmB,kBAEAF,EAAA,GACAA,EAAAzzQ,EAAAquI,KAAA8I,KAAAo8H,OAAAb,EAAAkB,WACAH,EAAAzzQ,EAAAquI,KAAAwlI,OAAAN,OAAAZ,EAAAmB,aACAL,EAAAzzQ,EAAAquI,KAAAjnB,MAAAmsJ,OAAAX,EAAAmB,YACAN,EAAAzzQ,EAAAquI,KAAAjkJ,OAAAmpR,OAAAV,EAAA18D,aACAs9D,EAAAzzQ,EAAAquI,KAAA1qB,MAAA4vJ,OAAAT,EAAAkB,YACAP,EAAAzzQ,EAAAquI,KAAAx1K,IAAA06S,OAAAR,EAAAkB,UACAR,EAAAzzQ,EAAAquI,KAAAp7K,IAAAsgT,OAAAP,EAAAh1B,UACAy1B,EAAAzzQ,EAAAquI,KAAA0E,MAAAwgI,OAAAN,EAAAiB,YACA,MAAAl1J,EAAA,IAAAw9E,EAAA23E,GACA,MAAAC,EACA9uX,YAAAgoG,EAAAp4B,GACAu5B,KAAAnB,IAAAA,EACAmB,KAAAv5B,OAAAA,EAEA5vE,SAAAgoG,GACA,IAAA33B,EAAA84B,KACA,GACA,GAAA94B,EAAA23B,MAAAA,EACA,OAAA,QAEA33B,EAAAA,EAAAT,QACA,OAAA,EAEA5vE,mBAAA2gH,EAAA3Y,GACA,GAAA2Y,GAAAA,EAAA/oC,SAAAowB,GACA,MAAA,IAAA/F,MAAA,GAAA8zM,EAAAg5E,uDAEA,OAAA,IAAAD,EAAA9mR,EAAA2Y,IAGA,MAAAquQ,EAAA,CACAC,KAAA,IAAAv0Q,EAAA43C,MAAA53C,EAAAquI,KAAAkmI,KAAA,MACApwX,UAAA,IAAA67G,EAAA43C,MAAA53C,EAAAquI,KAAAlqP,eAAAA,GACAqwX,KAAA,IAAAx0Q,EAAA43C,MAAA53C,EAAAquI,KAAAmmI,MAAA,GACAC,MAAA,IAAAz0Q,EAAA43C,MAAA53C,EAAAquI,KAAAomI,OAAA,GACAzgI,WAAA,IAAAh0I,EAAA43C,MAAA53C,EAAAquI,KAAA1qB,MAAA,GACA+wJ,SAAA,IAAA10Q,EAAA43C,MAAA53C,EAAAquI,KAAAx1K,IAAA,IAEA87S,EAAA,CACAphR,OAAA,CAAAjG,EAAAsnR,EAAAxkN,EAAAykN,IACAjgT,OAAAs/K,UAAA5mJ,IAAA14B,OAAAkgT,cAAAxnR,GAEAA,GAAA,EACA,IAAA0S,EAAA43C,MAAA53C,EAAAquI,KAAA8I,KAAA7pJ,GAEA,IAAA0S,EAAA43C,MAAA53C,EAAAquI,KAAAwlI,OAAAvmR,GAJA,IAAA0S,EAAA43C,MAAA53C,EAAAquI,KAAA0E,MAAAzlJ,GAOA8S,OAAA,CAAA9S,EAAAsnR,EAAAxkN,EAAAykN,IACAvnR,GAAAm9B,OAAA,GACA,IAAAzqB,EAAA43C,MAAA53C,EAAAquI,KAAA8I,KAAA7pJ,GAEA,IAAA0S,EAAA43C,MAAA53C,EAAAquI,KAAAwlI,OAAAvmR,GAGA45H,WAAA,CAAA55H,EAAAsnR,EAAAxkN,EAAAykN,IACA,IAAA70Q,EAAA43C,MAAA53C,EAAAquI,KAAAjnB,MAAA95H,GAEAlD,OAAA,CAAAkD,EAAAsnR,EAAAxkN,EAAAykN,IACA,IAAA70Q,EAAA43C,MAAA53C,EAAAquI,KAAAjkJ,OAAAkD,GAEAynR,QAAA,CAAAznR,EAAAsnR,EAAAxkN,EAAAykN,IACAvnR,EAAAgnR,EAAAE,KAAAF,EAAAG,MAEAF,KAAA,CAAAS,EAAAJ,EAAAxkN,EAAAykN,IACAP,EAAAC,KAEApwX,UAAA,CAAA6wX,EAAAJ,EAAAxkN,EAAAykN,IACAP,EAAAnwX,UAEAuoO,YAAA,CAAAp/H,EAAAsnR,EAAAxkN,EAAAykN,IACA,IAAA70Q,EAAA43C,MAAA53C,EAAAquI,KAAAjnB,MAAA,IAAAF,WAAA55H,IAEAk1J,SAAA,CAAAl1J,EAAAsnR,EAAAxkN,EAAAykN,IACA,IAAA70Q,EAAA43C,MAAA53C,EAAAquI,KAAAjnB,MAAA,IAAAF,WAAA55H,EAAAgxG,OAAAhxG,EAAAs/H,WAAAt/H,EAAAu/H,aAEAvnO,MAAAgoG,EAAAsnR,EAAAxxX,EAAA6xX,GACA,IAAA3nR,EAAA55B,OACA,OAAA,IAAAtwE,EAAA8xX,eACA,CACAZ,EAAAtgI,WACA,IAAAh0I,EAAA43C,MAAA53C,EAAAquI,KAAA8mI,QAGAb,EAAAtgI,WAEAihI,EAAAb,EAAAgB,YAAAH,EAAA3nR,GACA,MAAA3B,EAAA,GACA,IAAA/1B,EAAA,EACA,IAAA,MAAApzE,KAAA8qG,EACA3B,EAAA/1B,KAAAy/S,EAAA7yX,EAAAY,EAAA6xX,GAEA,OAAA7xX,EAAA8xX,eACA,CACA,IAAAl1Q,EAAA43C,MAAA53C,EAAAquI,KAAA1qB,MAAAr2H,EAAA55B,QACAi4B,EACA,IAAAqU,EAAA43C,MAAA53C,EAAAquI,KAAA8mI,QAGA,CACA,IAAAn1Q,EAAA43C,MAAA53C,EAAAquI,KAAA1qB,MAAAr2H,EAAA55B,QACAi4B,IAGArmG,OAAAgoG,EAAAozQ,EAAAt9W,EAAA6xX,GACA,MAAAxpR,EAAA,WAAAi1Q,EACA99W,EAAA6oG,EAAA6B,EAAA1qG,OAAAX,OAAAW,KAAA0qG,GACA55B,EAAA+3B,EAAA6B,EAAA5B,KAAA9oG,EAAA8wE,OACA,IAAAA,EACA,OAAA,IAAAtwE,EAAA8xX,eACA,CACAZ,EAAAI,SACA,IAAA10Q,EAAA43C,MAAA53C,EAAAquI,KAAA8mI,QAGAb,EAAAI,SAEAO,EAAAb,EAAAgB,YAAAH,EAAA3nR,GACA,MAAA3B,EAAA,GACA,IAAA/1B,EAAA,EACA,IAAA,MAAAnyE,KAAAb,EACA+oG,EAAA/1B,KAAA,CACAy/S,EAAA5xX,EAAAL,EAAA6xX,GACAI,EAAA5pR,EAAA6B,EAAArd,IAAAxsF,GAAA6pG,EAAA7pG,GAAAL,EAAA6xX,IAIA,OAiCA,SAAAtpR,EAAAvoG,GACAA,EAAAgwX,WACAznR,EAAA9Q,KAAAz3F,EAAAgwX,WApCAkC,CAAA3pR,EAAAvoG,GACAA,EAAA8xX,eACA,CACA,IAAAl1Q,EAAA43C,MAAA53C,EAAAquI,KAAAx1K,IAAAnF,GACAi4B,EACA,IAAAqU,EAAA43C,MAAA53C,EAAAquI,KAAA8mI,QAGA,CACA,IAAAn1Q,EAAA43C,MAAA53C,EAAAquI,KAAAx1K,IAAAnF,GACAi4B,KAIAgpR,EAAAljS,IAAAkjS,EAAA1yX,OACA0yX,EAAAjjI,OAAAijI,EAAAztJ,WACA,IAAA,MAAAw5I,IAAA,iFAAAnyR,MAAA,KACAomS,EAAA,GAAAjU,UAAAiU,EAAAnyH,SAEA,SAAA6yH,EAAA/nR,EAAAlqG,EAAA,GAAA6xX,GACA,MAAAvU,EAAAtuM,EAAAA,GAAA9kE,GACAioR,EAAAnyX,GAAAA,EAAAuxX,cAAAvxX,EAAAuxX,aAAAjU,IAAAiU,EAAAjU,GACA,GAAA,mBAAA6U,EAAA,CACA,MAAAr+N,EAAAq+N,EAAAjoR,EAAAozQ,EAAAt9W,EAAA6xX,GACA,GAAA,MAAA/9N,EACA,OAAAA,EAGA,MAAAs+N,EAAAb,EAAAjU,GACA,IAAA8U,EACA,MAAA,IAAAjuR,MAAA,GAAA8zM,EAAAg5E,qCAAA3T,KAEA,OAAA8U,EAAAloR,EAAAozQ,EAAAt9W,EAAA6xX,GAoBA,SAAAQ,EAAAz2J,EAAA9nE,EAAA8lM,EAAA55V,GACA,GAAAkpG,MAAA/gB,QAAA2rE,GACA,IAAA,MAAAl3C,KAAAk3C,EACAu+N,EAAAz2J,EAAAh/G,EAAAg9O,EAAA55V,QAGA45V,EAAA9lM,EAAA3hF,KAAAg+S,OAAAv0J,EAAA9nE,EAAA9zJ,GAGA,SAAAsyX,EAAAv6N,EAAA6hM,EAAA55V,GACA,MAAA8zJ,EAAAm+N,EAAAl6N,EAAA/3J,GACA,IAAAkpG,MAAA/gB,QAAA2rE,IAAA9zJ,EAAAuwX,iBAAA,CACA,MAAAgC,EAAAvyX,EAAAuwX,iBAAAz8N,GACA,GAAAy+N,EACA,OAAAA,EAEA,MAAAnd,EAAAxb,EAAA9lM,EAAA3hF,KAAAg+S,OACA,GAAA/a,EAAAod,YAAA,CACA,MAAAlqR,EAAA8sQ,EAAAod,YAAA1+N,EAAA9zJ,GACA47N,EAAA,IAAAw9E,EAAA23E,GAAAzoR,GAEA,GADA8sQ,EAAAx5I,EAAA9nE,EAAA9zJ,GACA,IAAA47N,EAAA62J,OAAAniT,OACA,MAAA,IAAA6zB,MAAA,+CAAA2vD,eAEA,OAAAu7N,EAAAqD,MAAA92J,EAAA62J,OAAA,KAIA,OADAJ,EAAAz2J,EAAA9nE,EAAA8lM,EAAA55V,GACA47N,EAAA+I,SAAA,GAOAhmO,EAAAqyX,IAAAA,EACAryX,EAAAgwG,OANA,SAAAopD,EAAA/3J,GAEA,OADAA,EAAAnB,OAAAiqG,OAAA,GAAAgnR,EAAA9vX,GACAsyX,EAAAv6N,EAAAs4N,EAAArwX,IAKArB,EAAA2zX,aAAAA,EACA3zX,EAAAszX,eAAAA,yUCjPA,aAEApzX,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,MAAA4zX,EAAA,CACA,SACA,SACA,SACA,UAEAC,EAAA,CACA,WACA,YACA,iBACA,oBACA,yBACA,gBACA,aACA,QACA,SACA,SACA,SACA,OACA,QACA,MACA,MACA,UACA,UACA,cACA,oBACA,WACA,UACA,MACA,cACA,YACA,aACA,oBACA,aACA,cACA,aACA,cACA,eACA,eACA,gBACA,kBA0CAj0X,EAAAqwK,GAxCA,SAAAjwK,GACA,GAAA,OAAAA,EACA,MAAA,OAEA,QAAAgC,IAAAhC,EACA,MAAA,YAEA,IAAA,IAAAA,IAAA,IAAAA,EACA,MAAA,UAEA,MAAA8zX,SAAA9zX,EACA,GAAA4zX,EAAA74S,SAAA+4S,GACA,OAAAA,EAEA,GAAA,aAAAA,EACA,MAAA,WAEA,GAAA3pR,MAAA/gB,QAAAppF,GACA,MAAA,QAEA,GASA,SAAAA,GACA,OAAAA,GAAAA,EAAAi5G,aAAAj5G,EAAAi5G,YAAAo+I,UAAAr3P,EAAAi5G,YAAAo+I,SAAAntJ,KAAA,KAAAlqG,GAVAq3P,CAAAr3P,GACA,MAAA,SAEA,MAAA+3I,EASA,SAAA/3I,GACA,MAAA+zX,EAAAj0X,OAAAmqG,UAAAS,SAAAR,KAAAlqG,GAAA0xE,MAAA,GAAA,GACA,GAAAmiT,EAAA94S,SAAAg5S,GACA,OAAAA,EAEA,OAdAC,CAAAh0X,GACA,OAAA+3I,GAGA,wCCzEA,aAEAj4I,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,MAAAksP,EACA/oP,YAAAiuX,EAAAjyX,EAAA80X,GACA3nR,KAAA8kR,MAAAA,EACA9kR,KAAA4nR,aAAA9C,GAAA,EACA9kR,KAAAntG,KAAAA,EACAmtG,KAAA2nR,SAAAA,EAEA9wX,WACA,MAAA,QAAAmpG,KAAA8kR,UAAA9kR,KAAAntG,OAEAgE,QAAAo7W,GACA,OAAAjyQ,KAAA8kR,MAAA7S,EAAA6S,OAAA,EAAA9kR,KAAA8kR,MAAA7S,EAAA6S,MAAA,EAAA,GAGAllI,EAAA8I,KAAA,IAAA9I,EAAA,EAAA,QAAA,GACAA,EAAAwlI,OAAA,IAAAxlI,EAAA,EAAA,UAAA,GACAA,EAAAjnB,MAAA,IAAAinB,EAAA,EAAA,SAAA,GACAA,EAAAjkJ,OAAA,IAAAikJ,EAAA,EAAA,UAAA,GACAA,EAAA1qB,MAAA,IAAA0qB,EAAA,EAAA,SAAA,GACAA,EAAAx1K,IAAA,IAAAw1K,EAAA,EAAA,OAAA,GACAA,EAAAp7K,IAAA,IAAAo7K,EAAA,EAAA,OAAA,GACAA,EAAA0E,MAAA,IAAA1E,EAAA,EAAA,SAAA,GACAA,EAAAomI,MAAA,IAAApmI,EAAA,EAAA,SAAA,GACAA,EAAAmmI,KAAA,IAAAnmI,EAAA,EAAA,QAAA,GACAA,EAAAkmI,KAAA,IAAAlmI,EAAA,EAAA,QAAA,GACAA,EAAAlqP,UAAA,IAAAkqP,EAAA,EAAA,aAAA,GACAA,EAAA8mI,MAAA,IAAA9mI,EAAA,EAAA,SAAA,GAaAtsP,EAAA61J,MAZA,MACAtyJ,YAAAiwE,EAAApzE,EAAAm0X,GACA7nR,KAAAl5B,KAAAA,EACAk5B,KAAAtsG,MAAAA,EACAssG,KAAA6nR,cAAAA,EACA7nR,KAAA8nR,kBAAApyX,EAEAmB,WACA,MAAA,SAAAmpG,KAAAl5B,SAAAk5B,KAAAtsG,UAKAJ,EAAAssP,KAAAA,gCC5CA,aAEApsP,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAAswX,EAAAzwX,EAAA,mBAsEAD,EAAAoyX,GAnEA,MACA7uX,YAAA+kR,EAFA,KAGA57K,KAAA47K,UAAAA,EACA57K,KAAA1hB,OAAA,EACA0hB,KAAA+nR,WAAA,EACA/nR,KAAAonR,OAAA,GACApnR,KAAAgoR,gBAAA,KAEAnxX,QACAmpG,KAAAonR,OAAA,GACApnR,KAAA1hB,OAAA,EACA0hB,KAAA+nR,WAAA,EACA,OAAA/nR,KAAAgoR,kBACAhoR,KAAAonR,OAAAt8S,KAAAk1B,KAAAgoR,iBACAhoR,KAAA+nR,UAAA/nR,KAAAgoR,gBAAA/iT,OAAA,GAGApuE,KAAA8hO,GACA,IAAAsvJ,EAAAjoR,KAAAonR,OAAApnR,KAAAonR,OAAAniT,OAAA,GAEA,GADA+6B,KAAA1hB,OAAAq6I,EAAA1zJ,QACA+6B,KAAA+nR,UAAA,EAAA,CACA,MAAAG,EAAAD,EAAAhjT,QAAA+6B,KAAA+nR,UAAA/nR,KAAA1hB,QAAA,EACA2pS,EAAAxmS,IAAAk3I,EAAAuvJ,OACA,CACA,GAAAD,EAAA,CACA,MAAAC,EAAAD,EAAAhjT,QAAA+6B,KAAA+nR,UAAA/nR,KAAA1hB,QAAA,EACA4pS,EAAAD,EAAAhjT,SACA+6B,KAAAonR,OAAApnR,KAAAonR,OAAAniT,OAAA,GAAAgjT,EAAA9rJ,SAAA,EAAA+rJ,GACAloR,KAAA+nR,UAAA/nR,KAAA1hB,OAAA,GAGAq6I,EAAA1zJ,OAAA,IAAA0zJ,EAAA1zJ,OAAA+6B,KAAA47K,WACAqsG,EAAAjE,EAAAxgI,MAAAxjJ,KAAA47K,WACA57K,KAAAonR,OAAAt8S,KAAAm9S,GACAjoR,KAAA+nR,WAAAE,EAAAhjT,OACA,OAAA+6B,KAAAgoR,kBACAhoR,KAAAgoR,gBAAAC,GAEAA,EAAAxmS,IAAAk3I,EAAA,KAEA34H,KAAAonR,OAAAt8S,KAAA6tJ,GACA34H,KAAA+nR,WAAApvJ,EAAA1zJ,QAGA+6B,KAAA1hB,QAAAq6I,EAAA1zJ,OAEApuE,QAAAovK,GAAA,GACA,IAAAkiN,EACA,GAAA,IAAAnoR,KAAAonR,OAAAniT,OAAA,CACA,MAAAwqC,EAAAzP,KAAAonR,OAAA,GACAnhN,GAAAjmE,KAAA1hB,OAAAmxB,EAAAxqC,OAAA,GACAkjT,EAAAnoR,KAAA1hB,SAAAmxB,EAAAxqC,OAAAwqC,EAAAA,EAAA0sH,SAAA,EAAAn8H,KAAA1hB,QACA0hB,KAAAgoR,gBAAA,KACAhoR,KAAAonR,OAAA,IAEAe,EAAAnE,EAAA5+S,MAAAqqC,EAAA,EAAAzP,KAAA1hB,aAGA6pS,EAAAnE,EAAAnyR,OAAAmO,KAAAonR,OAAApnR,KAAA1hB,QAKA,OAHA2nF,GACAjmE,KAAAimE,QAEAkiN,2DCtEA,aAEA30X,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,MAAA00X,EAAA/oR,WAAAyyF,UAAAzyF,WAAAyyF,QAAAqjC,SAAA91H,WAAA4jJ,QAAA,mBAAA5jJ,WAAA4jJ,OAAA8H,SACApsB,EAAA,IAAArO,YACAsO,EAAA,IAAA9V,YACA,SAAAiiC,EAAAx6B,GACA,OAAA63J,GAAA/oR,WAAA4jJ,OAAA8H,SAAAx6B,GAEA,SAAA82J,EAAA92J,GACA,OAAAA,aAAAkI,WAGAsyB,EAAAx6B,GAAA,IAAAkI,WAAAlI,EAAA1gB,OAAA0gB,EAAA4N,WAAA5N,EAAA6N,YAAA7N,EAFAkI,WAAAhvE,KAAA8mE,GAIA,MAAAnyH,EAAAgqR,EAAA,CAAAzvJ,EAAA3jJ,EAAAhQ,IACAA,EAAAgQ,EAAA,GAAAqqB,WAAA4jJ,OAAAx5F,KAAAkvE,EAAAwD,SAAAnnJ,EAAAhQ,IAAAo5B,SAAA,QAAAktJ,EAAA3yB,EAAA3jJ,EAAAhQ,GACA,CAAA2zJ,EAAA3jJ,EAAAhQ,IACAA,EAAAgQ,EAAA,GAAA2pJ,EAAAv6H,OAAAu0H,EAAAwD,SAAAnnJ,EAAAhQ,IAAAsmL,EAAA3yB,EAAA3jJ,EAAAhQ,GAEAqlL,EAAA+9H,EAAAzsR,GACAA,EAAA12B,OAAA,GAAAo6B,WAAA4jJ,OAAAx5F,KAAA9tD,GAAAyzN,EAAAzzN,GACAA,GACAA,EAAA12B,OAAA,GAAA25J,EAAAt7H,OAAA3H,GAAAyzN,EAAAzzN,GAKAv2B,EAAAgjT,EAAA,CAAAzvJ,EAAA3jJ,EAAAhQ,IACA+lL,EAAApyB,GACA,IAAAF,WAAAE,EAAAwD,SAAAnnJ,EAAAhQ,IAEA2zJ,EAAAvzJ,MAAA4P,EAAAhQ,GACA,CAAA2zJ,EAAA3jJ,EAAAhQ,IACA2zJ,EAAAvzJ,MAAA4P,EAAAhQ,GAEA6sB,EAAAu2R,EAAA,CAAAhB,EAAAniT,KACAmiT,EAAAA,EAAAh9S,KAAAqC,GAAAA,aAAAgsJ,WAAAhsJ,EAAA4yB,WAAA4jJ,OAAAx5F,KAAAh9E,KACA46S,EAAAhoR,WAAA4jJ,OAAApxJ,OAAAu1R,EAAAniT,KACA,CAAAmiT,EAAAniT,KACA,MAAA87D,EAAA,IAAA03F,WAAAxzJ,GACA,IAAAswJ,EAAA,EACA,IAAA,IAAAj8I,KAAA8tS,EACA7xJ,EAAAj8I,EAAArU,OAAA87D,EAAA97D,SACAqU,EAAAA,EAAA6iJ,SAAA,EAAAp7F,EAAA97D,OAAAswJ,IAEAx0F,EAAAt/C,IAAAnI,EAAAi8I,GACAA,GAAAj8I,EAAArU,OAEA,OAAA87D,GAEAyiH,EAAA4kI,EAAAnrR,GACAoC,WAAA4jJ,OAAAiE,YAAAjqJ,GACAA,GACA,IAAAw7H,WAAAx7H,GAEAm4J,EAAAgzH,EAAAxqP,GACA,iBAAAA,EACAA,EAEAv+B,WAAA4jJ,OAAAx5F,KAAA6vE,EAAA17F,IAAAx/B,SAAA,OACAw/B,GACA,iBAAAA,EACAA,EAEA//B,MAAAF,UAAAj4B,OAAAk4B,KAAA07H,EAAA17F,IAAA,CAAA12D,EAAAuF,IAAA,GAAAvF,IAAAuF,EAAA2xB,SAAA,IAAAiqR,SAAA,EAAA,QAAA,IAEAC,EAAAF,EAAApiT,GACAA,aAAAyyJ,WACAzyJ,EAEAq5B,WAAA4jJ,OAAAx5F,KAAAzjF,EAAA,OACAA,GACAA,aAAAyyJ,WACAzyJ,EAEAA,EAAAf,OAGA,IAAAwzJ,WAAAzyJ,EAAA8Z,MAAA,IAAA1V,KAAA,CAAAqC,EAAAtF,EAAAy2D,IAAAz2D,EAAA,GAAA,EAAA,KAAAsF,IAAAmxD,EAAAz2D,EAAA,KAAA,KAAA4G,OAAAsP,SAAAjT,KAAAr2E,GAAAqyE,SAAAryE,EAAA,OAFA,IAAA0kO,WAAA,GAIA,SAAAa,EAAAz6H,GACA,GAAAA,aAAA45H,YAAA,eAAA55H,EAAA8N,YAAA95G,KACA,OAAAgsG,EAEA,GAAAA,aAAAo/H,YACA,OAAA,IAAAxF,WAAA55H,GAEA,GAAAo/H,YAAAC,OAAAr/H,GACA,OAAA,IAAA45H,WAAA55H,EAAAgxG,OAAAhxG,EAAAs/H,WAAAt/H,EAAAu/H,YAEA,MAAA,IAAAtlI,MAAA,qCAcA,SAAAs2N,EAAAzzN,EAAA+0N,EAAArkN,EAAAA,GACA,IAAA6kN,EACA,MAAAjsP,EAAA02B,EAAA12B,OACA,IAAAwwP,EAAA,KACA,MAAA98F,EAAA,GACA,IAAA,IAAAxxJ,EAAA,EAAAA,EAAAlC,IAAAkC,EAAA,CAEA,GADA+pP,EAAAv1N,EAAA1jB,WAAA9Q,GACA+pP,EAAA,OAAAA,EAAA,MAAA,CACA,IAAAuE,EAAA,CACA,GAAAvE,EAAA,MAAA,EACAR,GAAA,IAAA,GACA/3F,EAAA7tJ,KAAA,IAAA,IAAA,KACA,SACA,GAAA3D,EAAA,IAAAlC,EAAA,EACAyrP,GAAA,IAAA,GACA/3F,EAAA7tJ,KAAA,IAAA,IAAA,KACA,SAEA2qP,EAAAvE,EACA,SAEA,GAAAA,EAAA,MAAA,EACAR,GAAA,IAAA,GACA/3F,EAAA7tJ,KAAA,IAAA,IAAA,KACA2qP,EAAAvE,EACA,SAEAA,EAAA,OAAAuE,EAAA,OAAA,GAAAvE,EAAA,YACAuE,IACA/E,GAAA,IAAA,GACA/3F,EAAA7tJ,KAAA,IAAA,IAAA,KAGA,GADA2qP,EAAA,KACAvE,EAAA,IAAA,CACA,IAAAR,GAAA,GAAA,EACA,MACA/3F,EAAA7tJ,KAAAomP,QACA,GAAAA,EAAA,KAAA,CACA,IAAAR,GAAA,GAAA,EACA,MACA/3F,EAAA7tJ,KAAAomP,GAAA,EAAA,IAAA,GAAAA,EAAA,UACA,GAAAA,EAAA,MAAA,CACA,IAAAR,GAAA,GAAA,EACA,MACA/3F,EAAA7tJ,KAAAomP,GAAA,GAAA,IAAAA,GAAA,EAAA,GAAA,IAAA,GAAAA,EAAA,SACA,CAAA,KAAAA,EAAA,SAKA,MAAA,IAAAp4N,MAAA,sBAJA,IAAA43N,GAAA,GAAA,EACA,MACA/3F,EAAA7tJ,KAAAomP,GAAA,GAAA,IAAAA,GAAA,GAAA,GAAA,IAAAA,GAAA,EAAA,GAAA,IAAA,GAAAA,EAAA,MAKA,OAAAv4F,EAEA,SAAA2yB,EAAA/6B,EAAAxrJ,EAAAC,GACA,MAAA+G,EAAA,GACA,KAAAhH,EAAAC,GAAA,CACA,MAAAisP,EAAA1gG,EAAAxrJ,GACA,IAAAmsP,EAAA,KACAC,EAAAF,EAAA,IAAA,EAAAA,EAAA,IAAA,EAAAA,EAAA,IAAA,EAAA,EACA,GAAAlsP,EAAAosP,GAAAnsP,EAAA,CACA,IAAA6rP,EAAAC,EAAAC,EAAAC,EACA,OAAAG,GACA,KAAA,EACAF,EAAA,MACAC,EAAAD,GAEA,MACA,KAAA,EACAJ,EAAAtgG,EAAAxrJ,EAAA,GACA,MAAA,IAAA8rP,KACAG,GAAA,GAAAC,IAAA,EAAA,GAAAJ,EACAG,EAAA,MACAE,EAAAF,IAGA,MACA,KAAA,EACAH,EAAAtgG,EAAAxrJ,EAAA,GACA+rP,EAAAvgG,EAAAxrJ,EAAA,GACA,MAAA,IAAA8rP,IAAA,MAAA,IAAAC,KACAE,GAAA,GAAAC,IAAA,IAAA,GAAAJ,IAAA,EAAA,GAAAC,EACAE,EAAA,OAAAA,EAAA,OAAAA,EAAA,SACAE,EAAAF,IAGA,MACA,KAAA,EACAH,EAAAtgG,EAAAxrJ,EAAA,GACA+rP,EAAAvgG,EAAAxrJ,EAAA,GACAgsP,EAAAxgG,EAAAxrJ,EAAA,GACA,MAAA,IAAA8rP,IAAA,MAAA,IAAAC,IAAA,MAAA,IAAAC,KACAC,GAAA,GAAAC,IAAA,IAAA,GAAAJ,IAAA,IAAA,GAAAC,IAAA,EAAA,GAAAC,EACAC,EAAA,OAAAA,EAAA,UACAE,EAAAF,KAKA,OAAAE,GACAA,EAAA,MACAC,EAAA,GACAD,EAAA,QACAA,GAAA,MACAnlP,EAAAjB,KAAAomP,IAAA,GAAA,KAAA,OACAA,EAAA,MAAA,KAAAA,GAEAnlP,EAAAjB,KAAAomP,GACAnsP,GAAAosP,EAEA,OAAAG,EAAAvlP,GAGA,SAAAulP,EAAAF,GACA,MAAAhuN,EAAAguN,EAAAnsP,OACA,GAAAm+B,GAHA,KAIA,OAAA/8B,OAAA67C,aAAAkhF,MAAA/8H,OAAA+qP,GAEA,IAAArlP,EAAA,GACA5E,EAAA,EACA,KAAAA,EAAAi8B,GACAr3B,GAAA1F,OAAA67C,aAAAkhF,MAAA/8H,OAAA+qP,EAAAhsP,MAAA+B,EAAAA,GATA,OAWA,OAAA4E,EAGAz4E,EAAAkwP,MAAAA,EACAlwP,EAAA+zX,MAAAA,EACA/zX,EAAAw+T,QA7IA,SAAArjE,EAAAJ,GACA,GAAAtD,EAAA0D,IAAA1D,EAAAsD,GACA,OAAAI,EAAAqjE,QAAAzjE,GAEA,IAAA,IAAAlnL,EAAA,EAAAA,EAAAsnL,EAAAxpL,OAAAkC,IACA,GAAAsnL,EAAAtnL,KAAAknL,EAAAlnL,GAGA,OAAAsnL,EAAAtnL,GAAAknL,EAAAlnL,IAAA,EAAA,EAEA,OAAA,GAoIA7zE,EAAAu+F,OAAAA,EACAv+F,EAAAg+T,sBAAAA,EACAh+T,EAAAw0G,UApNAlL,GACA67H,WAAAhvE,KAAA7sD,GAoNAtpG,EAAAg1X,QAAAA,EACAh1X,EAAA+2P,WAAAA,EACA/2P,EAAA8xE,MAAAA,EACA9xE,EAAA8hQ,MAAAA,EACA9hQ,EAAA8qG,SAAAA,EACA9qG,EAAA80X,UAAAA,gCCpPA,aAEA50X,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,MAAA60X,EAAA,qBAEAC,EAAA,GACAA,EAAA,IAAA,EACAA,EAAA,IAAA,EACAA,EAAA,IAAA,EACAA,EAAA,IAAA,EACAA,EAAA,IAAA,EAOAl1X,EAAAm1X,iBANA,SAAA/7N,EAAA90E,EAAAm6P,GACA,GAAArlL,EAAAznF,OAAA2S,EAAAm6P,EACA,MAAA,IAAAj5O,MAAA,gDAKAxlG,EAAAi1X,gBAAAA,EACAj1X,EAAAsyX,gBAfA,qBAgBAtyX,EAAAk1X,qBAAAA,gCCrBA,aAEAh1X,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAA69G,EAAAh+G,EAAA,cACA0wX,EAAA1wX,EAAA,cACA2wX,EAAA3wX,EAAA,gBACA4wX,EAAA5wX,EAAA,eACA6wX,EAAA7wX,EAAA,gBACA8wX,EAAA9wX,EAAA,eACA+wX,EAAA/wX,EAAA,aACAgxX,EAAAhxX,EAAA,aACAixX,EAAAjxX,EAAA,eACAq5S,EAAAr5S,EAAA,eACAywX,EAAAzwX,EAAA,mBAEA,SAAAm1X,EAAAh8N,EAAA90E,EAAA+wS,GACA,MAAA,IAAA7vR,MAAA,GAAA8zM,EAAA27E,8CAAAI,gBAAAj8N,EAAA90E,KAAA,KAEA,SAAAgxS,EAAAn5S,GACA,MAAA,KACA,MAAA,IAAAqpB,MAAA,GAAA8zM,EAAA27E,mBAAA94S,MAGA,MAAAs0S,EAAA,GACA,IAAA,IAAA58S,EAAA,EAAAA,GAAA,GAAAA,IACA48S,EAAA58S,GAAAuhT,EAEA3E,EAAA,IAAAE,EAAA4E,YACA9E,EAAA,IAAAE,EAAA6E,aACA/E,EAAA,IAAAE,EAAA8E,aACAhF,EAAA,IAAAE,EAAA+E,aACAjF,EAAA,IAAA2E,EACA3E,EAAA,IAAA2E,EACA3E,EAAA,IAAA2E,EACA3E,EAAA,IAAA2E,EACA,IAAA,IAAAvhT,EAAA,GAAAA,GAAA,GAAAA,IACA48S,EAAA58S,GAAAuhT,EAEA3E,EAAA,IAAAG,EAAA+E,cACAlF,EAAA,IAAAG,EAAAgF,eACAnF,EAAA,IAAAG,EAAAiF,eACApF,EAAA,IAAAG,EAAAkF,eACArF,EAAA,IAAA2E,EACA3E,EAAA,IAAA2E,EACA3E,EAAA,IAAA2E,EACA3E,EAAA,IAAA2E,EACA,IAAA,IAAAvhT,EAAA,GAAAA,GAAA,GAAAA,IACA48S,EAAA58S,GAAAg9S,EAAAkF,mBAEAtF,EAAA,IAAAI,EAAAmF,aACAvF,EAAA,IAAAI,EAAAoF,cACAxF,EAAA,IAAAI,EAAAqF,cACAzF,EAAA,IAAAI,EAAAsF,cACA1F,EAAA,IAAA2E,EACA3E,EAAA,IAAA2E,EACA3E,EAAA,IAAA2E,EACA3E,EAAA,IAAA6E,EAAA,qDACA,IAAA,IAAAzhT,EAAA,GAAAA,GAAA,IAAAA,IACA48S,EAAA58S,GAAAi9S,EAAAsF,oBAEA3F,EAAA,KAAAK,EAAAuF,cACA5F,EAAA,KAAAK,EAAAwF,eACA7F,EAAA,KAAAK,EAAAyF,eACA9F,EAAA,KAAAK,EAAA0F,eACA/F,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAA6E,EAAA,qDACA,IAAA,IAAAzhT,EAAA,IAAAA,GAAA,IAAAA,IACA48S,EAAA58S,GAAAk9S,EAAA0F,mBAEAhG,EAAA,KAAAM,EAAA2F,aACAjG,EAAA,KAAAM,EAAA4F,cACAlG,EAAA,KAAAM,EAAA6F,cACAnG,EAAA,KAAAM,EAAA8F,cACApG,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAAM,EAAA+F,sBACA,IAAA,IAAAjjT,EAAA,IAAAA,GAAA,IAAAA,IACA48S,EAAA58S,GAAAm9S,EAAA+F,iBAEAtG,EAAA,KAAAO,EAAAgG,WACAvG,EAAA,KAAAO,EAAAiG,YACAxG,EAAA,KAAAO,EAAAkG,YACAzG,EAAA,KAAAO,EAAAmG,YACA1G,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAAO,EAAAoG,oBACA,IAAA,IAAAvjT,EAAA,IAAAA,GAAA,IAAAA,IACA48S,EAAA58S,GAAAo9S,EAAAoG,iBAEA5G,EAAA,KAAAQ,EAAAqG,WACA7G,EAAA,KAAAQ,EAAAsG,YACA9G,EAAA,KAAAQ,EAAAuG,YACA/G,EAAA,KAAAQ,EAAAwG,YACAhH,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA,IAAA,IAAAvhT,EAAA,IAAAA,GAAA,IAAAA,IACA48S,EAAA58S,GAAAyhT,EAAA,mCAEA7E,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAAS,EAAAwG,gBACAjH,EAAA,KAAA6E,EAAA,mCACA7E,EAAA,KAAAS,EAAAyG,cACAlH,EAAA,KAAAS,EAAA0G,cACAnH,EAAA,KAAAS,EAAA2G,cACApH,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAA2E,EACA3E,EAAA,KAAAS,EAAA4G,YACA,MAAAC,EAAA,GACA,IAAA,IAAAlkT,EAAA,EAAAA,EAAA,GAAAA,IACAkkT,EAAAlkT,GAAA,IAAAoqC,EAAA43C,MAAA53C,EAAAquI,KAAA8I,KAAAvhL,EAAA,GAEA,IAAA,IAAAA,GAAA,EAAAA,IAAA,GAAAA,IACAkkT,EAAA,GAAAlkT,GAAA,IAAAoqC,EAAA43C,MAAA53C,EAAAquI,KAAAwlI,OAAAj+S,EAAA,GAEAkkT,EAAA,IAAA,IAAA95Q,EAAA43C,MAAA53C,EAAAquI,KAAAjnB,MAAA,IAAAF,WAAA,GAAA,GACA4yJ,EAAA,IAAA,IAAA95Q,EAAA43C,MAAA53C,EAAAquI,KAAAjkJ,OAAA,GAAA,GACA0vR,EAAA,KAAA,IAAA95Q,EAAA43C,MAAA53C,EAAAquI,KAAA1qB,MAAA,EAAA,GACAm2J,EAAA,KAAA,IAAA95Q,EAAA43C,MAAA53C,EAAAquI,KAAAx1K,IAAA,EAAA,GACAihT,EAAA,KAAA,IAAA95Q,EAAA43C,MAAA53C,EAAAquI,KAAAomI,OAAA,EAAA,GACAqF,EAAA,KAAA,IAAA95Q,EAAA43C,MAAA53C,EAAAquI,KAAAmmI,MAAA,EAAA,GACAsF,EAAA,KAAA,IAAA95Q,EAAA43C,MAAA53C,EAAAquI,KAAAkmI,KAAA,KAAA,GAyCAxyX,EAAAywX,KAAAA,EACAzwX,EAAA+3X,MAAAA,EACA/3X,EAAA4xX,iBA1CA,SAAAoG,GACA,OAAAA,EAAAxkT,MACA,KAAAyqC,EAAAquI,KAAAomI,MACA,OAAAhC,EAAAl8Q,UAAA,CAAA,MACA,KAAAyJ,EAAAquI,KAAAmmI,KACA,OAAA/B,EAAAl8Q,UAAA,CAAA,MACA,KAAAyJ,EAAAquI,KAAAkmI,KACA,OAAA9B,EAAAl8Q,UAAA,CAAA,MACA,KAAAyJ,EAAAquI,KAAAjnB,MACA,OAAA2yJ,EAAA53X,MAAAuxE,YAGA,EAFA++S,EAAAl8Q,UAAA,CAAA,KAGA,KAAAyJ,EAAAquI,KAAAjkJ,OACA,MAAA,KAAA2vR,EAAA53X,MACAswX,EAAAl8Q,UAAA,CAAA,UAEA,EACA,KAAAyJ,EAAAquI,KAAA1qB,MACA,OAAA,IAAAo2J,EAAA53X,MACAswX,EAAAl8Q,UAAA,CAAA,WAEA,EACA,KAAAyJ,EAAAquI,KAAAx1K,IACA,OAAA,IAAAkhT,EAAA53X,MACAswX,EAAAl8Q,UAAA,CAAA,WAEA,EACA,KAAAyJ,EAAAquI,KAAA8I,KACA,OAAA4iI,EAAA53X,MAAA,GACAswX,EAAAl8Q,UAAA,CAAA3hC,OAAAmlT,EAAA53X,cAEA,EACA,KAAA69G,EAAAquI,KAAAwlI,OACA,GAAAkG,EAAA53X,QAAA,GACA,OAAAswX,EAAAl8Q,UAAA,CAAA,GAAA3hC,OAAAmlT,EAAA53X,0RCtKA,aAEAF,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAA69G,EAAAh+G,EAAA,cACAq5S,EAAAr5S,EAAA,eAEA,MAAAg4X,EAAA,CACA,GACA,IACA,MACA,WACAvvP,OAAA,yBAEA,SAAAk3L,EAAAxmK,EAAA3nF,EAAApwE,GACAi4S,EAAA67E,iBAAA/7N,EAAA3nF,EAAA,GACA,MAAArxE,EAAAg5J,EAAA3nF,GACA,IAAA,IAAApwE,EAAAg+H,QAAAj/H,EAAA63X,EAAA,GACA,MAAA,IAAAzyR,MAAA,GAAA8zM,EAAA27E,gFAEA,OAAA70X,EAEA,SAAA83X,EAAA9+N,EAAA3nF,EAAApwE,GACAi4S,EAAA67E,iBAAA/7N,EAAA3nF,EAAA,GACA,MAAArxE,EAAAg5J,EAAA3nF,IAAA,EAAA2nF,EAAA3nF,EAAA,GACA,IAAA,IAAApwE,EAAAg+H,QAAAj/H,EAAA63X,EAAA,GACA,MAAA,IAAAzyR,MAAA,GAAA8zM,EAAA27E,gFAEA,OAAA70X,EAEA,SAAA+3X,EAAA/+N,EAAA3nF,EAAApwE,GACAi4S,EAAA67E,iBAAA/7N,EAAA3nF,EAAA,GACA,MAAArxE,EAAA,SAAAg5J,EAAA3nF,IAAA2nF,EAAA3nF,EAAA,IAAA,KAAA2nF,EAAA3nF,EAAA,IAAA,GAAA2nF,EAAA3nF,EAAA,GACA,IAAA,IAAApwE,EAAAg+H,QAAAj/H,EAAA63X,EAAA,GACA,MAAA,IAAAzyR,MAAA,GAAA8zM,EAAA27E,gFAEA,OAAA70X,EAEA,SAAAg4X,EAAAh/N,EAAA3nF,EAAApwE,GACAi4S,EAAA67E,iBAAA/7N,EAAA3nF,EAAA,GACA,MAAAs+K,EAAA,SAAA32F,EAAA3nF,IAAA2nF,EAAA3nF,EAAA,IAAA,KAAA2nF,EAAA3nF,EAAA,IAAA,GAAA2nF,EAAA3nF,EAAA,GACAu+K,EAAA,SAAA52F,EAAA3nF,EAAA,IAAA2nF,EAAA3nF,EAAA,IAAA,KAAA2nF,EAAA3nF,EAAA,IAAA,GAAA2nF,EAAA3nF,EAAA,GACArxE,GAAAsoI,OAAAqnH,IAAArnH,OAAA,KAAAA,OAAAsnH,GACA,IAAA,IAAA3uP,EAAAg+H,QAAAj/H,EAAA63X,EAAA,GACA,MAAA,IAAAzyR,MAAA,GAAA8zM,EAAA27E,gFAEA,GAAA70X,GAAAyyE,OAAA+6O,iBACA,OAAA/6O,OAAAzyE,GAEA,IAAA,IAAAiB,EAAAg3X,YACA,OAAAj4X,EAEA,MAAA,IAAAolG,MAAA,GAAA8zM,EAAA27E,gFAcA,SAAApD,EAAA50J,EAAAh/G,GACA,OAAAq6Q,EAAAr7J,EAAA,EAAAh/G,EAAA79G,OAEA,SAAAk4X,EAAAr7J,EAAAu0J,EAAAp8H,GACA,GAAAA,EAAA6iI,EAAA,GAAA,CACA,MAAAM,EAAA1lT,OAAAuiL,GACAn4B,EAAAzlJ,KAAA,CAAAg6S,EAAA+G,SACA,GAAAnjI,EAAA6iI,EAAA,GAAA,CACA,MAAAM,EAAA1lT,OAAAuiL,GACAn4B,EAAAzlJ,KAAA,CACA,GAAAg6S,EACA+G,SAEA,GAAAnjI,EAAA6iI,EAAA,GAAA,CACA,MAAAM,EAAA1lT,OAAAuiL,GACAn4B,EAAAzlJ,KAAA,CACA,GAAAg6S,EACA+G,IAAA,EACA,IAAAA,SAEA,GAAAnjI,EAAA6iI,EAAA,GAAA,CACA,MAAAM,EAAA1lT,OAAAuiL,GACAn4B,EAAAzlJ,KAAA,CACA,GAAAg6S,EACA+G,IAAA,GAAA,IACAA,IAAA,GAAA,IACAA,IAAA,EAAA,IACA,IAAAA,QAEA,CACA,MAAAC,EAAA9vP,OAAA0sH,GACA,KAAAojI,EAAAP,EAAA,IA6BA,MAAA,IAAAzyR,MAAA,GAAA8zM,EAAA27E,kEA7BA,CACA,MAAA9mS,EAAA,CACA,GAAAqjS,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAEA,IAAAxhI,EAAAn9K,OAAA2lT,EAAA9vP,OAAA,aACAqnH,EAAAl9K,OAAA2lT,GAAA9vP,OAAA,IAAAA,OAAA,aACAv6C,EAAA,GAAA,IAAA6hK,EACAA,IAAA,EACA7hK,EAAA,GAAA,IAAA6hK,EACAA,IAAA,EACA7hK,EAAA,GAAA,IAAA6hK,EACAA,IAAA,EACA7hK,EAAA,GAAA,IAAA6hK,EACA7hK,EAAA,GAAA,IAAA4hK,EACAA,IAAA,EACA5hK,EAAA,GAAA,IAAA4hK,EACAA,IAAA,EACA5hK,EAAA,GAAA,IAAA4hK,EACAA,IAAA,EACA5hK,EAAA,GAAA,IAAA4hK,EACA9yB,EAAAzlJ,KAAA2W,KAMA0jS,EAAAgC,YAAA,SAAA51Q,GACA,OAAAq6Q,EAAAzE,YAAA51Q,EAAA79G,QAEAk4X,EAAAzE,YAAA,SAAAz+H,GACA,OAAAA,EAAA6iI,EAAA,GACA,EAEA7iI,EAAA6iI,EAAA,GACA,EAEA7iI,EAAA6iI,EAAA,GACA,EAEA7iI,EAAA6iI,EAAA,GACA,EAEA,GAEApG,EAAAF,cAAA,SAAA8G,EAAAC,GACA,OAAAD,EAAAr4X,MAAAs4X,EAAAt4X,OAAA,EAAAq4X,EAAAr4X,MAAAs4X,EAAAt4X,MAAA,EAAA,GAGAJ,EAAAw1X,aA/FA,SAAAp8N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA,IAAA48G,EAAA43C,MAAA53C,EAAAquI,KAAA8I,KAAA8iI,EAAA9+N,EAAA90E,EAAA,EAAAjjF,GAAA,IA+FArB,EAAAy1X,aA7FA,SAAAr8N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA,IAAA48G,EAAA43C,MAAA53C,EAAAquI,KAAA8I,KAAA+iI,EAAA/+N,EAAA90E,EAAA,EAAAjjF,GAAA,IA6FArB,EAAA01X,aA3FA,SAAAt8N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA,IAAA48G,EAAA43C,MAAA53C,EAAAquI,KAAA8I,KAAAgjI,EAAAh/N,EAAA90E,EAAA,EAAAjjF,GAAA,IA2FArB,EAAAu1X,YArGA,SAAAn8N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA,IAAA48G,EAAA43C,MAAA53C,EAAAquI,KAAA8I,KAAAwqE,EAAAxmK,EAAA90E,EAAA,EAAAjjF,GAAA,IAqGArB,EAAA6xX,WAAAA,EACA7xX,EAAAs4X,gBAAAA,EACAt4X,EAAAk4X,WAAAA,EACAl4X,EAAAm4X,WAAAA,EACAn4X,EAAAo4X,WAAAA,EACAp4X,EAAA4/T,UAAAA,EACA5/T,EAAAi4X,eAAAA,0EClKA,aAEA/3X,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAA69G,EAAAh+G,EAAA,cACA0wX,EAAA1wX,EAAA,cACAq5S,EAAAr5S,EAAA,eAWA,MAAA24X,EAAAlwP,QAAA,GACAmwP,EAAAnwP,OAAA,GAcA,SAAAqpP,EAAA90J,EAAAh/G,GACA,MAAA6zQ,EAAA7zQ,EAAA79G,MACA+yP,EAAA,iBAAA2+H,EAAAA,EAAA8G,EAAAC,GAAA,EAAA/G,EAAA,EACAnB,EAAA2H,gBAAAr7J,EAAAh/G,EAAAzqC,KAAA8gT,aAAAnhI,GAEA4+H,EAAA8B,YAAA,SAAA51Q,GACA,MAAA6zQ,EAAA7zQ,EAAA79G,MACA+yP,EAAA,iBAAA2+H,EAAAA,EAAA8G,EAAAC,GAAA,EAAA/G,EAAA,EACA,OAAA3+H,EAAAw9H,EAAAsH,eAAA,GACA,EAEA9kI,EAAAw9H,EAAAsH,eAAA,GACA,EAEA9kI,EAAAw9H,EAAAsH,eAAA,GACA,EAEA9kI,EAAAw9H,EAAAsH,eAAA,GACA,EAEA,GAEAlG,EAAAJ,cAAA,SAAA8G,EAAAC,GACA,OAAAD,EAAAr4X,MAAAs4X,EAAAt4X,MAAA,EAAAq4X,EAAAr4X,MAAAs4X,EAAAt4X,OAAA,EAAA,GAGAJ,EAAA41X,eA/CA,SAAAx8N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA,IAAA48G,EAAA43C,MAAA53C,EAAAquI,KAAAwlI,QAAA,EAAAnB,EAAAuH,WAAA9+N,EAAA90E,EAAA,EAAAjjF,GAAA,IA+CArB,EAAA61X,eA7CA,SAAAz8N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA,IAAA48G,EAAA43C,MAAA53C,EAAAquI,KAAAwlI,QAAA,EAAAnB,EAAAwH,WAAA/+N,EAAA90E,EAAA,EAAAjjF,GAAA,IA6CArB,EAAA81X,eAzCA,SAAA18N,EAAA90E,EAAAq0S,EAAAt3X,GACA,MAAAk8H,EAAAozP,EAAAyH,WAAAh/N,EAAA90E,EAAA,EAAAjjF,GACA,GAAA,iBAAAk8H,EAAA,CACA,MAAAn9H,GAAA,EAAAm9H,EACA,GAAAn9H,GAAAyyE,OAAAimT,iBACA,OAAA,IAAA76Q,EAAA43C,MAAA53C,EAAAquI,KAAAwlI,OAAA1xX,EAAA,GAGA,IAAA,IAAAiB,EAAAg3X,YACA,MAAA,IAAA7yR,MAAA,GAAA8zM,EAAA27E,gFAEA,OAAA,IAAAh3Q,EAAA43C,MAAA53C,EAAAquI,KAAAwlI,OAAA8G,EAAAlwP,OAAAnL,GAAA,IA+BAv9H,EAAA21X,cArDA,SAAAv8N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA,IAAA48G,EAAA43C,MAAA53C,EAAAquI,KAAAwlI,QAAA,EAAAnB,EAAA/wD,UAAAxmK,EAAA90E,EAAA,EAAAjjF,GAAA,IAqDArB,EAAA+xX,aAAAA,+FC9DA,aAEA7xX,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAA69G,EAAAh+G,EAAA,cACAq5S,EAAAr5S,EAAA,eACA0wX,EAAA1wX,EAAA,cACAywX,EAAAzwX,EAAA,mBAEA,SAAA84X,EAAA3/N,EAAA90E,EAAA+S,EAAA1lB,GACA2nO,EAAA67E,iBAAA/7N,EAAA90E,EAAA+S,EAAA1lB,GACA,MAAAsrJ,EAAAyzJ,EAAA5+S,MAAAsnF,EAAA90E,EAAA+S,EAAA/S,EAAA+S,EAAA1lB,GACA,OAAA,IAAAssC,EAAA43C,MAAA53C,EAAAquI,KAAAjnB,MAAApI,EAAA5lI,EAAA1lB,GAqBA,SAAAqnT,EAAAhB,GAIA,YAHA51X,IAAA41X,EAAAxD,eACAwD,EAAAxD,aAAAwD,EAAAxkT,OAAAyqC,EAAAquI,KAAAjkJ,OAAAqoR,EAAA35H,WAAAihI,EAAA53X,OAAA43X,EAAA53X,OAEA43X,EAAAxD,aAEA,SAAAxC,EAAA/0J,EAAAh/G,GACA,MAAAonH,EAAA2zJ,EAAA/6Q,GACA0yQ,EAAA2H,gBAAAr7J,EAAAh/G,EAAAzqC,KAAA8gT,aAAAjvJ,EAAA1zJ,QACAsrJ,EAAAzlJ,KAAA6tJ,GASA,SAAA4zJ,EAAA99H,EAAAJ,GACA,OAAAI,EAAAxpL,OAAAopL,EAAAppL,QAAA,EAAAwpL,EAAAxpL,OAAAopL,EAAAppL,OAAA,EAAA++S,EAAAlyD,QAAArjE,EAAAJ,GARAi3H,EAAA6B,YAAA,SAAA51Q,GACA,MAAAonH,EAAA2zJ,EAAA/6Q,GACA,OAAA0yQ,EAAA2H,gBAAAzE,YAAAxuJ,EAAA1zJ,QAAA0zJ,EAAA1zJ,QAEAqgT,EAAAL,cAAA,SAAA8G,EAAAC,GACA,OAAAO,EAAAD,EAAAP,GAAAO,EAAAN,KAMA14X,EAAAi5X,aAAAA,EACAj5X,EAAAi2X,cApCA,SAAA78N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAAuH,WAAA9+N,EAAA90E,EAAA,EAAAjjF,KAoCArB,EAAAk2X,cAlCA,SAAA98N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAAwH,WAAA/+N,EAAA90E,EAAA,EAAAjjF,KAkCArB,EAAAm2X,cAhCA,SAAA/8N,EAAA90E,EAAAq0S,EAAAt3X,GACA,MAAAo0F,EAAAk7R,EAAAyH,WAAAh/N,EAAA90E,EAAA,EAAAjjF,GACA,GAAA,iBAAAo0F,EACA,MAAA,IAAA+P,MAAA,GAAA8zM,EAAA27E,8DAEA,OAAA8D,EAAA3/N,EAAA90E,EAAA,EAAAmR,IA4BAz1F,EAAAg2X,aA1CA,SAAA58N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAA/wD,UAAAxmK,EAAA90E,EAAA,EAAAjjF,KA0CArB,EAAA+1X,mBA9CA,SAAA38N,EAAA90E,EAAA+wS,EAAAhnN,GACA,OAAA0qN,EAAA3/N,EAAA90E,EAAA,EAAA+wS,IA8CAr1X,EAAAgyX,YAAAA,yHC7DA,aAEA9xX,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAA69G,EAAAh+G,EAAA,cACAq5S,EAAAr5S,EAAA,eACA0wX,EAAA1wX,EAAA,cACA4wX,EAAA5wX,EAAA,eACAywX,EAAAzwX,EAAA,mBAEA,SAAA84X,EAAA3/N,EAAA90E,EAAA+S,EAAA1lB,GACA,MAAAunT,EAAA7hS,EAAA1lB,EAEA,OADA2nO,EAAA67E,iBAAA/7N,EAAA90E,EAAA40S,GACA,IAAAj7Q,EAAA43C,MAAA53C,EAAAquI,KAAAjkJ,OAAAqoR,EAAA5lR,SAAAsuD,EAAA90E,EAAA+S,EAAA/S,EAAA40S,GAAAA,GAqBA,MAAA9kE,EAAAy8D,EAAAmB,YAEAhyX,EAAAs2X,eAfA,SAAAl9N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAAuH,WAAA9+N,EAAA90E,EAAA,EAAAjjF,KAeArB,EAAAu2X,eAbA,SAAAn9N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAAwH,WAAA/+N,EAAA90E,EAAA,EAAAjjF,KAaArB,EAAAw2X,eAXA,SAAAp9N,EAAA90E,EAAAq0S,EAAAt3X,GACA,MAAAo0F,EAAAk7R,EAAAyH,WAAAh/N,EAAA90E,EAAA,EAAAjjF,GACA,GAAA,iBAAAo0F,EACA,MAAA,IAAA+P,MAAA,GAAA8zM,EAAA27E,+DAEA,OAAA8D,EAAA3/N,EAAA90E,EAAA,EAAAmR,IAOAz1F,EAAAq2X,cArBA,SAAAj9N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAA/wD,UAAAxmK,EAAA90E,EAAA,EAAAjjF,KAqBArB,EAAAo2X,oBAzBA,SAAAh9N,EAAA90E,EAAA+wS,EAAAhnN,GACA,OAAA0qN,EAAA3/N,EAAA90E,EAAA,EAAA+wS,IAyBAr1X,EAAAo0T,aAAAA,+ICzCA,aAEAl0T,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAA69G,EAAAh+G,EAAA,cACA0wX,EAAA1wX,EAAA,cACAq5S,EAAAr5S,EAAA,eAEA,SAAA84X,EAAAI,EAAAC,EAAA/hS,EAAA1lB,GACA,OAAA,IAAAssC,EAAA43C,MAAA53C,EAAAquI,KAAA1qB,MAAAjwJ,EAAA0lB,GA2BA,SAAA46R,EAAAh1J,EAAA+6J,GACArH,EAAA2H,gBAAAr7J,EAAAh/G,EAAAquI,KAAA1qB,MAAA0yJ,aAAA0D,EAAA53X,OAEA6xX,EAAAN,cAAAhB,EAAAkB,WAAAF,cAEA3xX,EAAA22X,cAxBA,SAAAv9N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAAuH,WAAA9+N,EAAA90E,EAAA,EAAAjjF,KAwBArB,EAAA42X,cAtBA,SAAAx9N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAAwH,WAAA/+N,EAAA90E,EAAA,EAAAjjF,KAsBArB,EAAA62X,cApBA,SAAAz9N,EAAA90E,EAAAq0S,EAAAt3X,GACA,MAAAo0F,EAAAk7R,EAAAyH,WAAAh/N,EAAA90E,EAAA,EAAAjjF,GACA,GAAA,iBAAAo0F,EACA,MAAA,IAAA+P,MAAA,GAAA8zM,EAAA27E,8DAEA,OAAA8D,EAAA3/N,EAAA90E,EAAA,EAAAmR,IAgBAz1F,EAAA02X,aA9BA,SAAAt9N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAA/wD,UAAAxmK,EAAA90E,EAAA,EAAAjjF,KA8BArB,EAAAy2X,mBAlCA,SAAAr9N,EAAA90E,EAAA+wS,EAAAhnN,GACA,OAAA0qN,EAAA3/N,EAAA90E,EAAA,EAAA+wS,IAkCAr1X,EAAA82X,sBAhBA,SAAA19N,EAAA90E,EAAAq0S,EAAAt3X,GACA,IAAA,IAAAA,EAAAg4X,gBACA,MAAA,IAAA7zR,MAAA,GAAA8zM,EAAA27E,uDAEA,OAAA8D,EAAA3/N,EAAA90E,EAAA,EAAAy0B,EAAAA,IAaA/4G,EAAAiyX,YAAAA,+FC/CA,aAEA/xX,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAA69G,EAAAh+G,EAAA,cACA0wX,EAAA1wX,EAAA,cACAq5S,EAAAr5S,EAAA,eAEA,SAAA84X,EAAAI,EAAAC,EAAA/hS,EAAA1lB,GACA,OAAA,IAAAssC,EAAA43C,MAAA53C,EAAAquI,KAAAx1K,IAAAnF,EAAA0lB,GA2BA,SAAA66R,EAAAj1J,EAAA+6J,GACArH,EAAA2H,gBAAAr7J,EAAAh/G,EAAAquI,KAAAx1K,IAAAw9S,aAAA0D,EAAA53X,OAEA8xX,EAAAP,cAAAhB,EAAAkB,WAAAF,cAEA3xX,EAAAi3X,YAxBA,SAAA79N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAAuH,WAAA9+N,EAAA90E,EAAA,EAAAjjF,KAwBArB,EAAAk3X,YAtBA,SAAA99N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAAwH,WAAA/+N,EAAA90E,EAAA,EAAAjjF,KAsBArB,EAAAm3X,YApBA,SAAA/9N,EAAA90E,EAAAq0S,EAAAt3X,GACA,MAAAo0F,EAAAk7R,EAAAyH,WAAAh/N,EAAA90E,EAAA,EAAAjjF,GACA,GAAA,iBAAAo0F,EACA,MAAA,IAAA+P,MAAA,GAAA8zM,EAAA27E,4DAEA,OAAA8D,EAAA3/N,EAAA90E,EAAA,EAAAmR,IAgBAz1F,EAAAg3X,WA9BA,SAAA59N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA03X,EAAA3/N,EAAA90E,EAAA,EAAAqsS,EAAA/wD,UAAAxmK,EAAA90E,EAAA,EAAAjjF,KA8BArB,EAAA+2X,iBAlCA,SAAA39N,EAAA90E,EAAA+wS,EAAAhnN,GACA,OAAA0qN,EAAA3/N,EAAA90E,EAAA,EAAA+wS,IAkCAr1X,EAAAo3X,oBAhBA,SAAAh+N,EAAA90E,EAAAq0S,EAAAt3X,GACA,IAAA,IAAAA,EAAAg4X,gBACA,MAAA,IAAA7zR,MAAA,GAAA8zM,EAAA27E,uDAEA,OAAA8D,EAAA3/N,EAAA90E,EAAA,EAAAy0B,EAAAA,IAaA/4G,EAAAkyX,UAAAA,+FC/CA,aAEAhyX,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAA69G,EAAAh+G,EAAA,cACA0wX,EAAA1wX,EAAA,cAiBA,SAAAg8V,EAAAh/H,EAAA+6J,GACArH,EAAA2H,gBAAAr7J,EAAAh/G,EAAAquI,KAAAp7K,IAAAojT,aAAA0D,EAAA53X,OAEA67V,EAAA01B,cAAAhB,EAAAkB,WAAAF,cAEA3xX,EAAAu3X,YAdA,SAAAn+N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA,IAAA48G,EAAA43C,MAAA53C,EAAAquI,KAAAp7K,IAAAy/S,EAAAuH,WAAA9+N,EAAA90E,EAAA,EAAAjjF,GAAA,IAcArB,EAAAw3X,YAZA,SAAAp+N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA,IAAA48G,EAAA43C,MAAA53C,EAAAquI,KAAAp7K,IAAAy/S,EAAAwH,WAAA/+N,EAAA90E,EAAA,EAAAjjF,GAAA,IAYArB,EAAAy3X,YAVA,SAAAr+N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA,IAAA48G,EAAA43C,MAAA53C,EAAAquI,KAAAp7K,IAAAy/S,EAAAyH,WAAAh/N,EAAA90E,EAAA,EAAAjjF,GAAA,IAUArB,EAAAs3X,WApBA,SAAAl+N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAA,IAAA48G,EAAA43C,MAAA53C,EAAAquI,KAAAp7K,IAAAy/S,EAAA/wD,UAAAxmK,EAAA90E,EAAA,EAAAjjF,GAAA,IAoBArB,EAAAq3X,iBAxBA,SAAA8B,EAAAC,EAAA/D,EAAAhnN,GACA,OAAA,IAAApwD,EAAA43C,MAAA53C,EAAAquI,KAAAp7K,IAAAmkT,EAAA,IAwBAr1X,EAAAi8V,UAAAA,yEChCA,aAEA/7V,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAA69G,EAAAh+G,EAAA,cACAq5S,EAAAr5S,EAAA,eACA0wX,EAAA1wX,EAAA,cAkBA,SAAAq5X,EAAAl5X,EAAAilO,EAAAhkO,GACA,GAAAA,EAAA,CACA,IAAA,IAAAA,EAAAk4X,UAAA1mT,OAAA+4B,MAAAxrG,GACA,MAAA,IAAAolG,MAAA,GAAA8zM,EAAA27E,gDAEA,IAAA,IAAA5zX,EAAAm4X,gBAAAp5X,IAAA24G,EAAAA,GAAA34G,KAAA24G,EAAAA,GACA,MAAA,IAAAvT,MAAA,GAAA8zM,EAAA27E,qDAGA,OAAA,IAAAh3Q,EAAA43C,MAAA53C,EAAAquI,KAAA0E,MAAA5wP,EAAAilO,GAWA,SAAA8sJ,EAAAl1J,EAAA+6J,EAAA32X,GACA,MAAA2vP,EAAAgnI,EAAA53X,MACA,IAAA,IAAA4wP,EACA/zB,EAAAzlJ,KAAA,CAvCA,GAuCAymC,EAAAquI,KAAA0E,MAAAsjI,oBACA,IAAA,IAAAtjI,EACA/zB,EAAAzlJ,KAAA,CAxCA,GAwCAymC,EAAAquI,KAAA0E,MAAAsjI,oBACA,GAAA,OAAAtjI,EACA/zB,EAAAzlJ,KAAA,CAzCA,GAyCAymC,EAAAquI,KAAA0E,MAAAsjI,oBACA,QAAAlyX,IAAA4uP,EACA/zB,EAAAzlJ,KAAA,CA1CA,GA0CAymC,EAAAquI,KAAA0E,MAAAsjI,mBACA,CACA,IAAA5uJ,EACA+zJ,GAAA,EACAp4X,IAAA,IAAAA,EAAA+vX,UACAsI,EAAA1oI,GACAtrB,EAAAi0J,EAAAC,EAAA,GACA5oI,IAAAtrB,GAAA7yJ,OAAA+4B,MAAAolJ,IACA4oI,EAAA,GAAA,IACA38J,EAAAzlJ,KAAAoiT,EAAA9nT,MAAA,EAAA,IACA2nT,GAAA,IAEAI,EAAA7oI,GACAtrB,EAAAo0J,EAAAF,EAAA,GACA5oI,IAAAtrB,IACAk0J,EAAA,GAAA,IACA38J,EAAAzlJ,KAAAoiT,EAAA9nT,MAAA,EAAA,IACA2nT,GAAA,KAIAA,IA+FAvrC,EA9FAl9F,EA+FA+oI,EAAAC,WAAA,EAAA9rC,GAAA,GA9FAxoH,EAAAu0J,EAAAL,EAAA,GACAA,EAAA,GAAA,IACA38J,EAAAzlJ,KAAAoiT,EAAA9nT,MAAA,EAAA,KA2FA,IAAAo8Q,EAvFAikC,EAAA0B,YAAA,SAAA51Q,EAAA58G,GACA,MAAA2vP,EAAA/yI,EAAA79G,MACA,IAAA,IAAA4wP,IAAA,IAAAA,GAAAA,MAAAA,EACA,OAAA,EAEA,IAAAtrB,EACA,IAAArkO,IAAA,IAAAA,EAAA+vX,QAAA,CAGA,GAFAsI,EAAA1oI,GACAtrB,EAAAi0J,EAAAC,EAAA,GACA5oI,IAAAtrB,GAAA7yJ,OAAA+4B,MAAAolJ,GACA,OAAA,EAIA,GAFA6oI,EAAA7oI,GACAtrB,EAAAo0J,EAAAF,EAAA,GACA5oI,IAAAtrB,EACA,OAAA,EAGA,OAAA,GAEA,MAAAnpB,EAAA,IAAAouB,YAAA,GACAovJ,EAAA,IAAAt5H,SAAAlkD,EAAA,GACAq9K,EAAA,IAAAz0J,WAAA5oB,EAAA,GACA,SAAAm9K,EAAAxrC,GACA,GAAAA,IAAAn1O,EAAAA,EACAghR,EAAAnuE,UAAA,EAAA,OAAA,QACA,GAAAsiC,KAAAn1O,EAAAA,EACAghR,EAAAnuE,UAAA,EAAA,OAAA,QACA,GAAA/4O,OAAA+4B,MAAAsiP,GACA6rC,EAAAnuE,UAAA,EAAA,OAAA,OACA,CACAmuE,EAAAG,WAAA,EAAAhsC,GACA,MAAAisC,EAAAJ,EAAAK,UAAA,GACAh5Q,GAAA,WAAA+4Q,IAAA,GACA9kI,EAAA,QAAA8kI,EACA,GAAA,MAAA/4Q,EACA24Q,EAAAnuE,UAAA,EAAA,OAAA,QACA,GAAA,IAAAxqM,EACA24Q,EAAAnuE,UAAA,GAAA,WAAAsiC,IAAA,GAAA74F,GAAA,IAAA,OACA,CACA,MAAAglI,EAAAj5Q,EAAA,IACAi5Q,GAAA,GACAN,EAAAnuE,UAAA,EAAA,GACAyuE,GAAA,GACAN,EAAAnuE,UAAA,GAAA,WAAAuuE,IAAA,GAAA,GAAA,GAAAE,GAAA,GAEAN,EAAAnuE,UAAA,GAAA,WAAAuuE,IAAA,GAAAE,EAAA,IAAA,GAAAhlI,GAAA,IAAA,KAKA,SAAAskI,EAAAC,EAAAt1S,GACA,GAAAs1S,EAAAjoT,OAAA2S,EAAA,EACA,MAAA,IAAAkhB,MAAA,GAAA8zM,EAAA27E,+CAEA,MAAA/gH,GAAA0lH,EAAAt1S,IAAA,GAAAs1S,EAAAt1S,EAAA,GACA,GAAA,QAAA4vL,EACA,OAAAn7J,EAAAA,EAEA,GAAA,QAAAm7J,EACA,OAAAn7J,EAAAA,EAEA,GAAA,QAAAm7J,EACA,OAAA5e,IAEA,MAAArhL,EAAAigM,GAAA,GAAA,GACA22G,EAAA,KAAA32G,EACA,IAAA7tK,EAQA,OANAA,EADA,IAAApyB,EACA42S,EAAA,IAAA,GACA,KAAA52S,GACA42S,EAAA,MAAA,IAAA52S,EAAA,IAEA,IAAA42S,EAAA9xQ,EAAAA,EAAAu8I,IAEA,MAAA4e,GAAA7tK,EAAAA,EAEA,SAAAwzR,EAAA3rC,GACA6rC,EAAAG,WAAA,EAAAhsC,GAAA,GAEA,SAAA4rC,EAAAF,EAAAt1S,GACA,GAAAs1S,EAAAjoT,OAAA2S,EAAA,EACA,MAAA,IAAAkhB,MAAA,GAAA8zM,EAAA27E,+CAEA,MAAAxjT,GAAAmoT,EAAA/uJ,YAAA,GAAAvmJ,EACA,OAAA,IAAAm8K,SAAAm5H,EAAAr9K,OAAA9qI,EAAA,GAAA6oT,WAAA,GAAA,GAKA,SAAAL,EAAAL,EAAAt1S,GACA,GAAAs1S,EAAAjoT,OAAA2S,EAAA,EACA,MAAA,IAAAkhB,MAAA,GAAA8zM,EAAA27E,+CAEA,MAAAxjT,GAAAmoT,EAAA/uJ,YAAA,GAAAvmJ,EACA,OAAA,IAAAm8K,SAAAm5H,EAAAr9K,OAAA9qI,EAAA,GAAA8oT,WAAA,GAAA,GAEApI,EAAAR,cAAAhB,EAAAkB,WAAAF,cAEA3xX,EAAA83X,YAnKA,SAAAqB,EAAAC,EAAAT,EAAAt3X,GACA,IAAA,IAAAA,EAAAg4X,gBACA,MAAA,IAAA7zR,MAAA,GAAA8zM,EAAA27E,uDAEA,OAAA,IAAAh3Q,EAAA43C,MAAA53C,EAAAquI,KAAA8mI,WAAAhxX,EAAA,IAgKApC,EAAA23X,cAnJA,SAAAv+N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAAi4X,EAAAK,EAAAvgO,EAAA90E,EAAA,GAAA,EAAAjjF,IAmJArB,EAAA43X,cAjJA,SAAAx+N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAAi4X,EAAAQ,EAAA1gO,EAAA90E,EAAA,GAAA,EAAAjjF,IAiJArB,EAAA63X,cA/IA,SAAAz+N,EAAA90E,EAAAq0S,EAAAt3X,GACA,OAAAi4X,EAAAW,EAAA7gO,EAAA90E,EAAA,GAAA,EAAAjjF,IA+IArB,EAAA03X,gBA7KA,SAAAyB,EAAAC,EAAAT,EAAAt3X,GACA,IAAA,IAAAA,EAAAm5X,eACA,MAAA,IAAAh1R,MAAA,GAAA8zM,EAAA27E,sDAEA,OAAA,IAAAh3Q,EAAA43C,MAAA53C,EAAAquI,KAAAlqP,eAAAA,EAAA,IA0KApC,EAAAmyX,YAAAA,+FC1LA,aAEAjyX,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IAEA,IAAAk5S,EAAAr5S,EAAA,eACAg+G,EAAAh+G,EAAA,cACAwwX,EAAAxwX,EAAA,aAEA,MAAAw6X,EAAA,CACAp7P,QAAA,EACAg6P,iBAAA,EACAmB,gBAAA,EACAnC,aAAA,GAEA,MAAAqC,EACAn3X,YAAA61J,EAAA/3J,EAAA,IACAqrG,KAAApoB,IAAA,EACAooB,KAAA0sD,KAAAA,EACA1sD,KAAArrG,QAAAA,EAEAkC,OACA,OAAAmpG,KAAApoB,KAAAooB,KAAA0sD,KAAAznF,OAEApuE,OACA,MAAAo3X,EAAAjuR,KAAA0sD,KAAA1sD,KAAApoB,KACA,IAAA25B,EAAAwyQ,EAAAsH,MAAA4C,GACA,QAAAv4X,IAAA67G,EAAA,CACA,MAAA8+G,EAAA0zJ,EAAAA,KAAAkK,GACA,IAAA59J,EACA,MAAA,IAAAv3H,MAAA,GAAA8zM,EAAA27E,6CAAA0F,IAAA,aAAAA,EAAA7vR,SAAA,IAAAiqR,SAAA,EAAA,SAEA,MAAAM,EAAA,GAAAsF,EACA18Q,EAAA8+G,EAAArwH,KAAA0sD,KAAA1sD,KAAApoB,IAAA+wS,EAAA3oR,KAAArrG,SAGA,OADAqrG,KAAApoB,KAAA25B,EAAAs2Q,cACAt2Q,GAGA,MAAA28Q,EAAAh4X,OAAAugP,IAAA,QACA8nI,EAAAroX,OAAAugP,IAAA,SAgDA,SAAA03I,EAAAC,EAAAz5X,GACA,GAAAy5X,EAAAtkN,OACA,OAAAokN,EAEA,MAAA5C,EAAA8C,EAAAhxS,OACA,GAAAkuS,EAAAxkT,OAAAyqC,EAAAquI,KAAA8mI,MACA,OAAAnI,EAEA,GAAA+M,EAAAxkT,KAAA6gT,SACA,OAAA2D,EAAA53X,MAEA,GAAA43X,EAAAxkT,OAAAyqC,EAAAquI,KAAA1qB,MACA,OA3DA,SAAA3jH,EAAA68Q,EAAAz5X,GACA,MAAAioG,EAAA,GACA,IAAA,IAAAz1B,EAAA,EAAAA,EAAAoqC,EAAA79G,MAAAyzE,IAAA,CACA,MAAAzzE,EAAAy6X,EAAAC,EAAAz5X,GACA,GAAAjB,IAAA6qX,EAAA,CACA,GAAAhtQ,EAAA79G,QAAA24G,EAAAA,EACA,MAEA,MAAA,IAAAvT,MAAA,GAAA8zM,EAAA27E,0DAEA,GAAA70X,IAAAw6X,EACA,MAAA,IAAAp1R,MAAA,GAAA8zM,EAAA27E,2DAAAphT,eAAAoqC,EAAA79G,UAEAkpG,EAAAz1B,GAAAzzE,EAEA,OAAAkpG,EA4CAyxR,CAAA/C,EAAA8C,EAAAz5X,GAEA,GAAA22X,EAAAxkT,OAAAyqC,EAAAquI,KAAAx1K,IACA,OA7CA,SAAAmnC,EAAA68Q,EAAAz5X,GACA,MAAA25X,GAAA,IAAA35X,EAAA25X,QACAzvR,EAAAyvR,OAAA54X,EAAA,GACAwpF,EAAAovS,EAAA,IAAAtrS,SAAAttF,EACA,IAAA,IAAAyxE,EAAA,EAAAA,EAAAoqC,EAAA79G,MAAAyzE,IAAA,CACA,MAAAnyE,EAAAm5X,EAAAC,EAAAz5X,GACA,GAAAK,IAAAupX,EAAA,CACA,GAAAhtQ,EAAA79G,QAAA24G,EAAAA,EACA,MAEA,MAAA,IAAAvT,MAAA,GAAA8zM,EAAA27E,wDAEA,GAAAvzX,IAAAk5X,EACA,MAAA,IAAAp1R,MAAA,GAAA8zM,EAAA27E,yDAAAphT,wBAAAoqC,EAAA79G,UAEA,IAAA,IAAA46X,GAAA,iBAAAt5X,EACA,MAAA,IAAA8jG,MAAA,GAAA8zM,EAAA27E,6DAAAvzX,MAEA,MAAAtB,EAAAy6X,EAAAC,EAAAz5X,GACA,GAAAjB,IAAAw6X,EACA,MAAA,IAAAp1R,MAAA,GAAA8zM,EAAA27E,yDAAAphT,0BAAAoqC,EAAA79G,UAEA46X,EACApvS,EAAAuC,IAAAzsF,EAAAtB,GAEAmrG,EAAA7pG,GAAAtB,EAGA,OAAA46X,EAAApvS,EAAA2f,EAiBA0vR,CAAAjD,EAAA8C,EAAAz5X,GAEA,GAAA22X,EAAAxkT,OAAAyqC,EAAAquI,KAAAp7K,IAAA,CACA,GAAA7vE,EAAAulN,MAAA,mBAAAvlN,EAAAulN,KAAAoxK,EAAA53X,OAAA,CACA,MAAA86X,EAAAL,EAAAC,EAAAz5X,GACA,OAAAA,EAAAulN,KAAAoxK,EAAA53X,OAAA86X,GAEA,MAAA,IAAA11R,MAAA,GAAA8zM,EAAA27E,sCAAA+C,EAAA53X,UAEA,MAAA,IAAAolG,MAAA,eAqBAxlG,EAAA06X,UAAAA,EACA16X,EAAA8wG,OApBA,SAAAsoD,EAAA/3J,GACA,KAAA+3J,aAAA+rE,YACA,MAAA,IAAA3/H,MAAA,GAAA8zM,EAAA27E,uDAGA,MAAA6F,GADAz5X,EAAAnB,OAAAiqG,OAAA,GAAAswR,EAAAp5X,IACA85X,WAAA,IAAAT,EAAAthO,EAAA/3J,GACAqkO,EAAAm1J,EAAAC,EAAAz5X,GACA,GAAAqkO,IAAAk1J,EACA,MAAA,IAAAp1R,MAAA,GAAA8zM,EAAA27E,sDAEA,GAAAvvJ,IAAAulJ,EACA,MAAA,IAAAzlR,MAAA,GAAA8zM,EAAA27E,wCAEA,IAAA6F,EAAAtkN,OACA,MAAA,IAAAhxE,MAAA,GAAA8zM,EAAA27E,2DAEA,OAAAvvJ,GAKA1lO,EAAA66X,eAAAA,8FCtIA,aAEA,MAAArxE,EAAAvpT,EAAA,YACAg7N,EAAAh7N,EAAA,QAmIA,SAAAm7X,EAAA1/R,GACA,MAAAr8F,EAAAq8F,EAAA2+H,KAAA,GAAA3+H,EAAAr8F,OAEA,IAAAA,EACA,MAAAmqT,EAAA,IAAAhkN,MAAA,8DAAA,wBAIA,MAAA6hO,EAAA,CACAhoU,KAAAA,EACAixW,WAAA,IAAA50Q,EAAA40Q,WAOA,OAJA,MAAA50Q,EAAAs6Q,WACA3uC,EAAA2uC,SAAAt6Q,EAAAs6Q,UAGA3uC,EAvGAtnU,EAAAC,QAAAggJ,gBAAAtkD,GAEA,GAAAA,MAAAA,EACA,MAAA8tN,EAAA,IAAAhkN,MAAA,qBAAA9J,KAAA,wBAIA,GAAAu/H,EAAAsM,MAAA7rI,SACA0/R,EAAA,CAAA/gK,IAAA3+H,QADA,CAKA,KAAAA,aAAA3oB,QAAA,iBAAA2oB,GAAA,CAOA,GAAA,MAAAA,EAAA2+H,KAAA,MAAA3+H,EAAAr8F,KAEA,aAAA+7X,EAAA1/R,GAIA,GAAA94F,OAAAu0J,YAAAz7D,EAAA,CAEA,MAAAy7D,EAAAz7D,EAAA94F,OAAAu0J,YACA5xE,EAAA4xE,EAAArtE,OACA,GAAAvE,EAAAixF,KAAA,OAAArf,EAGA,GAAA8jE,EAAAsM,MAAAhiJ,EAAAnlF,QAAAmlF,EAAAnlF,iBAAA2yE,QAAA,iBAAAwS,EAAAnlF,MAAA,OACAg7X,EAAA,CAAA/gK,IAAA90I,EAAAnlF,QACA,IAAA,MAAAi6N,KAAAljE,QACAikO,EAAA,CAAA/gK,IAAAA,IAEA,OAIA,GAAA,MAAA90I,EAAAnlF,MAAAi6N,KAAA,MAAA90I,EAAAnlF,MAAAf,KAAA,OACA+7X,EAAA71S,EAAAnlF,OACA,IAAA,MAAAmrG,KAAA4rD,QACAikO,EAAA7vR,GAEA,OAGA,MAAAi+M,EAAA,IAAAhkN,MAAA,4BAAA9J,GAAA,wBAIA,GAAA94F,OAAAy6N,iBAAA3hI,EAAA,CAEA,MAAAy7D,EAAAz7D,EAAA94F,OAAAy6N,iBACA93I,QAAA4xE,EAAArtE,OACA,GAAAvE,EAAAixF,KAAA,OAAArf,EAGA,GAAA8jE,EAAAsM,MAAAhiJ,EAAAnlF,QAAAmlF,EAAAnlF,iBAAA2yE,QAAA,iBAAAwS,EAAAnlF,MAAA,OACAg7X,EAAA,CAAA/gK,IAAA90I,EAAAnlF,QACA,UAAA,MAAAi6N,KAAAljE,QACAikO,EAAA,CAAA/gK,IAAAA,IAEA,OAIA,GAAA,MAAA90I,EAAAnlF,MAAAi6N,KAAA,MAAA90I,EAAAnlF,MAAAf,KAAA,OACA+7X,EAAA71S,EAAAnlF,OACA,UAAA,MAAAmrG,KAAA4rD,QACAikO,EAAA7vR,GAEA,OAGA,MAAAi+M,EAAA,IAAAhkN,MAAA,4BAAA9J,GAAA,wBAGA,MAAA8tN,EAAA,IAAAhkN,MAAA,4BAAA9J,GAAA,8BAnEA0/R,EAAA,CAAA/7X,KAAAq8F,mEC5DA,aAEA,MAAAk6Q,EAAA31W,EAAA,kBACA41W,SAAAA,GAAAD,EACAE,EAAA71W,EAAA,6CACAgqU,YAAAA,GAAAhqU,EAAA,eACAupU,EAAAvpU,EAAA,2CAWA,SAAAm7X,EAAA5nT,EAAA6mJ,EAAA27I,GAEA,MAAAxqI,EAAA,CACAh4J,KAAAA,EACA6mJ,IAAAA,GAOA,OAJA27I,IACAxqI,EAAAwqI,SAAAA,GAGAxqI,EAQAzrO,EAAAC,QAAA,EAAAonU,WAAAA,EAAAL,KAAAA,KAkEAyC,GA9DAxpL,gBAAA3+I,EAAA,IAEA,IAAAmyE,EAAAqiS,EAAAziJ,IAQA,GANA/xN,EAAAmyE,OACAA,EAAAnyE,EAAAmyE,KAEAoiS,EAAAylB,aAAA7nT,IAGAnyE,EAAAi6X,MAAA,CAEA,IAAAr3S,GAAA,EAEA,UAAA,MAAA5kF,KAAAA,KAAAy2W,EAAAz0W,EAAAi6X,OAAA,CACA,MAAAjhK,QAAA4vG,EAAAlD,EAAA1nU,IACAijT,OAAAA,EAAA80D,OAAAA,EAAAjkS,OAAAA,EAAA6iS,SAAAA,SAAA5uC,EAAA6uC,iBAAA57I,EAAA7mJ,GAEA,IAAA4jS,EACA,MAAA,IAAA5xQ,MAAA,SAAAnmG,oBAGA,OAAAijT,GACA,KAAAuzD,EAAAK,OACA,KAAAL,EAAAvF,UACArsR,GAAA,QACAm3S,EAAA94E,EAAAjoF,EAAA27I,GACA,MACA,QACA/xR,GAAA,QACAm3S,EAAA,GAAAvlB,EAAAe,oBAAAzjS,IAAAknJ,EAAA27I,IAIA,IAAA/xR,EACA,MAAA,IAAAuhB,MAAA,sBAzBA,CA+BA,GAAAhyB,IAAAqiS,EAAAvF,WAAA98R,IAAAqiS,EAAAziJ,IACA,UAAA,MAAAiH,IAAAA,EAAA27I,SAAAA,KAAA5uC,EAAA+vC,sBACAikB,EAAAvlB,EAAAvF,UAAAj2I,EAAA27I,GAIA,GAAAxiS,IAAAqiS,EAAAe,UAAApjS,IAAAqiS,EAAAziJ,IAGA,UAAA,MAAAiH,KAAA+sG,EAAAm0D,aAAAl6X,SACA+5X,EAAAvlB,EAAAe,SAAAv8I,GAIA,GAAA7mJ,IAAAqiS,EAAAK,QAAA1iS,IAAAqiS,EAAAziJ,IACA,UAAA,MAAAiH,IAAAA,EAAA27I,SAAAA,KAAA5uC,EAAAo0D,mBACAJ,EAAAvlB,EAAAK,OAAA77I,EAAA27I,uLClGA,aAEA,MAAAvtR,EAAAxoF,EAAA,WAMAF,EAAAC,QAAA,EAAAy1W,MAAAA,KAIA,CAAAp2W,EAAAgC,EAAA,KAEAonF,EAAAgtR,EAAA,CAAA,CAAAp2W,KAAAA,KAAAgC,IAAAA,mDCdA,aAEA,MAAAy0W,EAAA71W,EAAA,6CACAgqU,YAAAA,GAAAhqU,EAAA,eACAupU,EAAAvpU,EAAA,4CACA41W,SAAAA,GAAA51W,EAAA,iBAQAF,EAAAC,QAAA,EAAAonU,WAAAA,EAAAJ,OAAAA,EAAAD,KAAAA,KA2CAyC,GAvCAxpL,gBAAAv+D,EAAA4sF,EAAA,IACA,MAAA0xD,QAAAinG,EAAAsvC,WAEA,IAEA,UAAA,MAAAj3W,KAAAA,EAAAixW,UAAAA,KAAAwF,EAAAr0R,GAAA,CACA,MAAA44I,QAAA4vG,EAAAlD,EAAA1nU,IACA+3W,OAAAA,EAAA90D,OAAAA,SAAA8kB,EAAA6uC,iBAAA57I,EAAAw7I,EAAAziJ,KAEA,IAAAgkJ,EACA,MAAA,IAAA5xQ,MAAA,GAAA60H,mBAGA,OAAAioF,GACA,KAAAuzD,EAAA,UACA,IAAAvF,EACA,MAAA,IAAA9qQ,MAAA,GAAA60H,iCAGA+sG,EAAAq0D,MAAAphK,SAEAA,EAEA,MACA,KAAAw7I,EAAA,aACAzuC,EAAAq0D,MAAAphK,SAEAA,EAEA,MACA,QACA,MAAA,IAAA70H,MAAA,GAAA60H,gCAAAioF,OAGA,QACAviF,wLCpDA,aAEA,MAAA27J,EAAAz7X,EAAA,WACA07X,EAAA17X,EAAA,0BACA27X,EAAA37X,EAAA,sCACAyvW,oBAAAA,EAAAtrC,wBAAAA,GAAAnkU,EAAA,aACA84N,EAAA94N,EAAA,QAAAA,CAAA,wBA4HAF,EAAAC,QA7GA,MAQAuD,YAAAlC,EAAA,CAAA6rW,KAAA,KACAxgQ,KAAArrG,QAAAA,EAGAqrG,KAAAmvR,QAAA,KAGAnvR,KAAAovR,OAAA,KAGAv4X,UACA,MAAA4jU,EAAAz6N,KAAAovR,QAAApvR,KAAAmvR,QACA,GAAA10D,EACA,OAAAA,EAEA,MAAA,IAAAuoC,EAIAqsB,cACA,OAAArvR,KAAAsvR,UAAAD,QAeAx4X,cAAAmjU,KAAAA,EAAAt+F,OAAAA,EAAAu+F,SAAAA,IACA,GAAA,MAAAj6N,KAAAmvR,QACA,MAAA,IAAAz3D,EAGArrG,EAAA,8BAEA,MAAAgjK,EAAA,IAAAH,EAAAl1D,GACAS,EAAA,IAAAu0D,EAAAK,EAAAr1D,EAAAu1D,UAAA7zJ,EAAAu+F,EAAAj6N,KAAArrG,SAEAqrG,KAAAmvR,QAAA10D,EAUA5jU,mBAAA8kU,OAAAA,EAAA3B,KAAAA,EAAAt+F,OAAAA,EAAAu+F,SAAAA,IACA,GAAA,MAAAj6N,KAAAovR,OACA,MAAA,IAAA13D,EAEA,MAAA23D,EAAAJ,EAAA,CAAAtzD,OAAAA,EAAA3B,KAAAA,EAAAt+F,OAAAA,EAAA/mO,QAAAqrG,KAAArrG,UAGA8lU,EAAA,IAAAu0D,EAAAK,EAAAr1D,EAAAu1D,UAAA7zJ,EAAAu+F,EAAAj6N,KAAArrG,eACA8lU,EAAA+0D,YAAAx6S,QACAgrB,KAAAovR,OAAA30D,EAGA5jU,aACA,MAAA4jU,EAAAz6N,KAAAovR,OACA30D,UACAA,EAAA+0D,YAAAjvP,OACAvgC,KAAAovR,OAAA,MASAv4X,QAAA0hO,EAAA7kO,EAAA+7X,GACA,OAAAzvR,KAAAsvR,UAAAI,QAAAn3J,EAAA7kO,EAAA+7X,GAQA54X,QAAAhE,EAAA8B,GACA,OAAAqrG,KAAAsvR,UAAAtpN,QAAAnzK,EAAA8B,GAOAkC,mBAAA0hO,EAAA7kO,GACA,OAAAssG,KAAAsvR,UAAA7yD,mBAAAlkG,EAAA7kO,mKC/HA,aAEA,MAAAqnO,kBAAAA,GAAAxnO,EAAA,WACA0rP,EAAA1rP,EAAA,YACA0wU,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,aAAA,CACA10P,MAAA00P,EAAA,qBAGA0rD,EAAAp8X,EAAA,eACAq8X,EAAAr8X,EAAA,iBACAs8X,EAAAt8X,EAAA,cACAuwW,EAAAvwW,EAAA,iBAEA8kO,EAAA9kO,EAAA,yBA+GAF,EAAAC,QAxGA,MAWAuD,YAAAw4X,EAAAE,EAAA7zJ,EAAAu+F,EAAAtlU,GACAqrG,KAAA8vR,UAAA,IAAAH,EAAAN,EAAAE,GACAvvR,KAAAwvR,YAAA,IAAAI,EAAA5vR,KAAA8vR,UAAAP,EAAA7zJ,EAAAu+F,EAAAtlU,GACAqrG,KAAA1Y,SAAA,IAAAuoS,EAAAR,GACArvR,KAAAhc,MAAA,IAAA8/Q,EAAA,KACA9jQ,KAAAqvR,QAAAA,EAUAx4X,cAAA0hO,EAAA7kO,EAAA+7X,EAAAE,EAAAI,uBACA,IACA,MAAAr0J,QAAAX,EAAAxC,EAAAI,aACA34H,KAAA8vR,UAAAE,eAAAz3J,EAAA7kO,EAAA+7X,GAEApjK,EAAA,cAAAgM,EAAA3kO,EAAA,qCAGA,MAAAuwF,EAAAy3I,EAAA7C,cAEAo3J,EAAAhxR,WAAAwwR,GACA9qB,EAAAsrB,EA7CA,IA6CAA,EA7CA,IAmDA,OAJAjwR,KAAAhc,MAAAvC,IAAAwC,EAAAvwF,EAAAixW,GAEAt4I,EAAA,cAAAgM,EAAA3kO,EAAA,kCAEA,CACAb,KAAAoxF,EACAvwF,MAAAA,GAEA,MAAA+lG,GAGA,MAFA4yH,EAAA98I,MAAAkqB,GAEAA,GAYA5iG,cAAAhE,EAAA8B,EAAA,IACA,GAAA,iBAAA9B,EACA,MAAAosP,EAAA,IAAAnmJ,MAAA,8BAAA,oBAIA,IAAAnkG,EAAA0vW,UAAA1vW,EAAAivW,UAAA,CAEA,MAAA3/Q,EAAApxF,EAAAitF,MAAA,KAAA,GACAlV,EAAAo1B,KAAAhc,MAAAxC,IAAAyC,GAEA,GAAArZ,EACA,OAAAA,EAIA,IACA,MAAAA,QAAAo1B,KAAA1Y,SAAA0+E,QAAAnzK,EAAA8B,GAIA,OAFA03N,EAAA,oBAAAx5N,4BAEA+3E,EACA,MAAA6uB,GAGA,MAFA4yH,EAAA98I,MAAAkqB,GAEAA,GAYA5iG,yBAAA0hO,EAAA7kO,GACA,OAAAssG,KAAA0vR,QAAAn3J,EAAA7kO,EAAAi8X,EAAAI,kOCzHA,aAEA,MAAAhiK,EAAAx6N,EAAA,YACAspU,IAAAA,EAAA13M,OAAAA,GAAA5xH,EAAA,uBACA0rP,EAAA1rP,EAAA,YACA0wU,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,uBAAA,CACA10P,MAAA00P,EAAA,+BAEA5rG,EAAA9kO,EAAA,yBACA4kO,EAAA5kO,EAAA,sBAEAknU,EAAAlnU,EAAA,QAQA28X,EAAA/qQ,EAAA4zO,gBAAA1jW,KACA06X,EAAA,KAGA,MAAAJ,EAKA94X,YAAAw4X,EAAAE,GACAvvR,KAAAmwR,SAAAd,EACArvR,KAAAowR,WAAAb,EAUA14X,qBAAA0hO,EAAA7kO,EAAA+7X,GACA,IAAAl3J,IAAAA,EAAAI,MACA,MAAAsmB,EAAA,IAAAnmJ,MAAA,uBAAA,2BAGA,MAAA4iI,QAAA3N,EAAAgN,kBAAAxC,EAAAI,OACAzpB,QAAAlvG,KAAAqwR,sBAAA93J,EAAA7kO,EAAA+7X,EAAA/zJ,GAEA,OAAA17H,KAAAswR,oBAAAphL,EAAAwsB,GASA7kO,QAAA0hO,EAAA7kO,GACA,OAAAssG,KAAAgwR,eAAAz3J,EAAA7kO,EAAAq8X,GAOAl5X,0BAAAq4M,EAAAwsB,GACA,IAAA3N,EAAA0N,SAAAC,GAAA,CACA,MAAA60J,EAAA,+BAGA,MAFAlkK,EAAA98I,MAAAghT,GAEAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,uBAIA,MAAA79G,EAAAh3C,EAAA3C,QACAy3J,QAAA/1D,EAAAg2D,eAAA/9G,EAAAxjE,GACA/6M,EAAAsmU,EAAAi2D,UAAAh1J,EAAApC,WASA,aAPAt5H,KAAA2wR,cAAAx8X,EAAAy8X,WAAAJ,GAAAthL,SAKAlvG,KAAA6wR,kBAAA18X,EAAA28X,cAAAp+G,GAEA89G,GAAAthL,EAOAr4M,oBAAA7B,EAAA+gL,GACA,IAAA8mJ,EAAAk0D,MAAA/7X,GAAA,CACA,MAAAu7X,EAAA,6CAIA,MAFAlkK,EAAA98I,MAAAghT,GAEAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,6BAGA,IAAAS,EACA,IAEAA,EAAAv2D,EAAAh6C,QAAA1qG,GACA,MAAAt8E,GAGA,MAFA4yH,EAAA98I,MAAAkqB,GAEAA,EAIA,IACA,MAAA1tB,QAAAi0B,KAAAmwR,SAAA9+J,IAAAr8N,EAAAi8X,aAAAD,GAGA,OAFA3kK,EAAA,mBAAAgM,EAAArjO,EAAAi8X,aAAA,uCAEAllT,EACA,MAAA0tB,GACA,MAAA82R,EAAA,mBAAAl4J,EAAArjO,EAAAi8X,aAAA,+CAIA,MAHA5kK,EAAA98I,MAAAghT,GACAlkK,EAAA98I,MAAAkqB,GAEAwlJ,EAAA,IAAAnmJ,MAAAy3R,GAAA,2BAQA15X,wBAAA7B,EAAA09Q,GACA,IAAAmqD,EAAAk0D,MAAA/7X,GAAA,CACA,MAAAu7X,EAAA,6CAGA,MAFAlkK,EAAA98I,MAAAghT,GAEAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,6BAGA,IAAA79G,IAAAA,EAAA/5C,MAAA,CACA,MAAA43J,EAAA,yDAGA,MAFAlkK,EAAA98I,MAAAghT,GAEAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,2BAIA,IACA,MAAAxkT,QAAAi0B,KAAAmwR,SAAA9+J,IAAAr8N,EAAAi8X,aAAAv+G,EAAA/5C,OAGA,OAFAtM,EAAA,kBAAAgM,EAAArjO,EAAAi8X,aAAA,uCAEAllT,EACA,MAAA0tB,GACA,MAAA82R,EAAA,kBAAAl4J,EAAArjO,EAAAi8X,aAAA,+CAIA,MAHA5kK,EAAA98I,MAAAghT,GACAlkK,EAAA98I,MAAAkqB,GAEAwlJ,EAAA,IAAAnmJ,MAAAy3R,GAAA,2BAaA15X,oBAAA6kO,EAAA/mO,EAAA,IACA,IAAAo5N,EAAA0N,SAAAC,GAAA,CACA,MAAA60J,EAAA,+BAIA,MAFAlkK,EAAA98I,MAAAghT,GAEAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,uBAGA,MAAAW,GAAA,IAAAv8X,EAAAu8X,aAEA,IACA,MAAAC,QAAAnxR,KAAAowR,WAAA5uS,IAAAi5O,EAAA22D,YAAA11J,EAAAz3I,KAGA,OAAA+b,KAAAqxR,eAAAF,GACA,MAAA13R,GACA,GAAAA,EAAApkG,OAAA66X,EAAA,CACA,MAAAK,EAAA,4CAAA70J,EAAAz3I,oBAGA,MAFAooI,EAAA98I,MAAAghT,GAEAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,qCAGA,IAAAW,EACA,MAAAjyI,EAAAxlJ,EAAA,+CAIA,IACA,MAAAtlG,EAAAsmU,EAAAi2D,UAAAh1J,EAAApC,WACAvtJ,QAAAi0B,KAAAmwR,SAAA3uS,IAAArtF,EAAAy8X,WAAAK,cAGA,OAAAjxR,KAAAqxR,eAAAtlT,GACA,MAAA0tB,GAGA,MAFA4yH,EAAA98I,MAAAkqB,GAEAA,IAQA5iG,eAAA61J,GACA,IACA,OAAA+tK,EAAA62D,UAAA5kO,GACA,MAAAjzD,GACA,MAAAwlJ,EAAAxlJ,EAAA,4BAUA5iG,4BAAA0hO,EAAA7kO,EAAA+7X,EAAA/zJ,GACA,IAAA3N,EAAA0N,SAAAC,GAAA,CACA,MAAA60J,EAAA,+BAGA,MAFAlkK,EAAA98I,MAAAghT,GAEAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,uBAGA,MAAAgB,EAAA,CACAL,cAAA,GAGA,IAAAhiL,EAEA,IACAA,QAAAlvG,KAAAwxR,cAAA91J,EAAA61J,GACA,MAAA93R,GACA,GAAAA,EAAApkG,OAAA66X,EAAA,CACA,MAAAK,EAAA,wEAAA70J,EAAAz3I,MAAAwV,EAAA+d,QAGA,MAFA60G,EAAA98I,MAAAghT,GAEAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,qCAKA,IAMAS,EANAS,EAAA,EAEAviL,QAAAx5M,IAAAw5M,EAAAwiL,WACAD,EAAAt5J,EAAAjpB,EAAAx7M,MAAAA,GAAAw7M,EAAAwiL,SAAAxiL,EAAAwiL,SAAA,GAKA,IAEAV,QAAAv2D,EAAAvmU,OAAAqkO,EAAA7kO,EAAA+9X,EAAAhC,GACA,MAAAh2R,GACA,MAAA82R,EAAA,mBAAA78X,yBAGA,MADA24N,EAAA98I,MAAAkqB,GACAwlJ,EAAA,IAAAnmJ,MAAAy3R,GAAA,4BAKA,IAEA,MAAA7jO,EAAA+tK,EAAAh6C,QAAAuwG,GAOA,aAJAhxR,KAAAowR,WAAA/+J,IAAAopG,EAAA22D,YAAA11J,EAAAz3I,IAAAyoE,GAEA2/D,EAAA,mBAAAgM,EAAA3kO,EAAA,yCAEAs9X,EACA,MAAAv3R,GACA,MAAA82R,EAAA,mBAAA78X,yCAGA,MAFA24N,EAAA98I,MAAAghT,GAEAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,8BAKAZ,EAAAI,sBAAAA,EACA18X,EAAAC,QAAAq8X,0LCxSA,aAEA,MAAAgC,EAAAp+X,EAAA,mBACAspU,IAAAA,GAAAtpU,EAAA,uBACAy6N,EAAAz6N,EAAA,iBACAw6N,EAAAx6N,EAAA,WACA+6N,EAAA/6N,EAAA,eACAupT,EAAAvpT,EAAA,YACA46N,EAAA56N,EAAA,aACA6kO,EAAA7kO,EAAA,2BACA8kO,EAAA9kO,EAAA,yBACAqoO,EAAAroO,EAAA,sBAEA0wU,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,UAAA,CACA10P,MAAA00P,EAAA,mBAIA2tD,UAAAC,GACAt+X,EAAA,iBACAu+X,aAAAA,GAAAv+X,EAAA,WACAw+X,EAAAx+X,EAAA,YAEAy+X,EAAA1jK,EAAA3qH,MAAA8C,SAEA2vB,EAAA,SA8CA67P,EAAA3+O,MAAAk/H,EAAA9+Q,EAAAg6V,EAAAwkC,EAAAC,KACA,MAEAp8M,EAAA,CACAriL,MAAAA,EACAuzF,gBAJAqhK,EAAAkqB,EAAA9+Q,EAAAy+X,EAAAD,GAKAC,aAAAA,EACAC,SAAAF,EACAR,SAAAhkC,GAIA,OADArhI,EAAA,kBAAA34N,aACAqiL,GASAkmD,EAAA3oF,MAAAo/H,EAAA38F,KACA,MAAAriL,MAAAA,EAAAy+X,aAAAA,EAAAC,SAAAA,GAAAr8M,EACAs8M,EAAAC,EAAA5+X,EAAAy+X,EAAAC,GAGA,IAAAG,EACA,IACAA,QAAA7/G,EAAAiD,OAAA08G,EAAAt8M,EAAA9uF,WACA,MAAAwS,GACA84R,GAAA,EAEA,IAAAA,EAEA,MADAlmK,EAAA98I,MAAA,wCACAutO,EAAA,IAAAhkN,MAAA,wCAAAi5R,EAAAS,4BAIA,GAAAL,IAAAN,EAAAY,aAAAC,IAAA,CACA,IAAAC,EAEA,IACAA,EAAAb,EAAAz5J,EAAA+5J,IACA,MAAAr+X,GAEA,MADAs4N,EAAA98I,MAAA,wDACAutO,EAAA,IAAAhkN,MAAA,wDAAAi5R,EAAAa,yBAGA,GAAAD,EAAAn2R,UAAAuB,KAAAunE,MAEA,MADA+mD,EAAA98I,MAAA,sBACAutO,EAAA,IAAAhkN,MAAA,sBAAAi5R,EAAAc,8BAEA,GAAAV,EAEA,MADA9lK,EAAA98I,MAAA,8BACAutO,EAAA,IAAAhkN,MAAA,8BAAAi5R,EAAAe,2BAGAzmK,EAAA,kBAAA34N,eA2DAq/X,EAAA,CAAAr3J,EAAA3lD,KACA,IAAAA,IAAA2lD,EAAA,CACA,MAAAnsJ,EAAA,IAAAupB,MAAA,0DAGA,MADAuzH,EAAA98I,MAAAA,GACAutO,EAAAvtO,EAAAwiT,EAAAiB,yBAGA,GAAAj9M,EAAAyiD,OAAA,CACA,IAAAA,EACA,IACAA,EAAAxK,EAAA75N,KAAA8kO,mBAAAljD,EAAAyiD,QACA,MAAA/+H,GAEA,MADA4yH,EAAA98I,MAAAkqB,GACAA,EAEA,OAAA++H,EAGA,GAAAkD,EAAAlD,OACA,OAAAkD,EAAAlD,OAEA,MAAAhlO,OAAAiqG,OAAA,IAAA3E,MAAA,8BAAA,CAAAzjG,KAAA08X,EAAAiB,2BAQAC,EAAAj+X,GAAAqjO,EAAAlK,EAAA7qH,OAAA,SAAAtuG,IAAAowE,MAAA,GAAAswB,cAoCA4yJ,EAAA,CAAAkqB,EAAA9+Q,EAAAy+X,EAAAC,KACA,IACA,MAAAC,EAAAC,EAAA5+X,EAAAy+X,EAAAC,GAEA,OAAA5/G,EAAAlqB,KAAA+pI,GACA,MAAA9iT,GAEA,MADA88I,EAAA98I,MAAA,oCACAutO,EAAA,IAAAhkN,MAAA,qCAAAvpB,EAAAoK,SAAAo4S,EAAAmB,0BA0BAZ,EAAA,CAAA5+X,EAAAy+X,EAAAC,KACA,MAAAe,EAAA/6J,EAlBA,CAAA+5J,IACA,GAAA,MAAAA,EAAA/zR,WACA,MAAA,MAGA,MAAA7uB,EAAA,IAAAupB,MAAA,8BAAAq5R,EAAA/zR,cAEA,MADAiuH,EAAA98I,MAAAA,GACAutO,EAAAvtO,EAAAwiT,EAAAe,4BAWAM,CAAAjB,IAEA,OAAAv2J,EAAA,CAAAloO,EAAA0+X,EAAAe,KAQAE,EAAA33J,IACA,MAAA43J,EAAAhlK,EAAAlqH,OAAAs3H,EAAAz3I,IAEA,OAAAqvS,EAAAj+X,OAAA28X,EACA,KAGAhkK,EAAA75N,KAAA8kO,mBAAAq6J,EAAAp6J,SAcAo4J,EAAA/gK,IACA,MAAA52I,EAAAk4S,EAAAztR,OAAAmsH,GACAr6F,EAAA27P,EAAAzvI,SAAAzoK,EAAA,CACA84H,UAAA,EACA2jC,QAAA,EACA6Q,MAAA9gL,OACA24R,SAAA,IAGA,MAAA,CACAprW,MAAAwiI,EAAAxiI,MACAuzF,UAAAivC,EAAAjvC,UACAkrS,aAAAj8P,EAAAi8P,aACAC,SAAAl8P,EAAAk8P,SACAV,SAAAx7P,EAAAw7P,SACAl5J,OAAAtiG,EAAAsiG,SAIA+6J,EAAA,CAKAt3J,SAAA3oF,MAAAkgP,EAAAx+X,KACA,MAAAy+X,EAAAnC,EAAAkC,GACAE,EAAA1+X,EAAAowE,MAAA,SAAAH,QACAy2J,EAAA3N,EAAAyM,gBAAAk5J,GAGAl7J,EAAAu6J,EAAAr3J,EAAA+3J,SAGAx3J,EAAAzD,EAAAi7J,IAMA17L,OAAA,CAAA47L,EAAAC,KACA,MAAAC,EAAAvC,EAAAqC,GACAG,EAAAxC,EAAAsC,GAEA,OAAAC,EAAAnC,SAAAoC,EAAApC,SAAA,EAAA,IAIAr+X,EAAAC,QAAA,CAEAY,OApUA,CAAAs+Q,EAAA9+Q,EAAAg6V,EAAA+hC,KAEA,MAAAyC,EAAA,IAAAP,EAAA5zR,KAAAunE,MAAAn/F,OAAAspT,IAAArxR,WACA+zR,EAAAN,EAAAY,aAAAC,IACA,OAAAT,EAAAz/G,EAAA9+Q,EAAAg6V,EAAAt1H,EAAA85J,GAAAC,IAkUA4B,qBAtTA,CAAAvhH,EAAA9+Q,EAAAg6V,EAAAsmC,KACA,MAAA7B,EAAAN,EAAAY,aAAAC,IACA,OAAAT,EAAAz/G,EAAA9+Q,EAAAg6V,EAAAt1H,EAAA47J,GAAA7B,IAsTAl2J,SAAAA,EAEAw0J,eAtOAn9O,MAAAo/H,EAAA38F,KACA,IAAA28F,IAAAA,EAAA/5C,QAAA5iD,EAAA,CACA,MAAAxmG,EAAA,IAAAupB,MAAA,0DAEA,MADAuzH,EAAA98I,MAAAA,GACAutO,EAAAvtO,EAAAwiT,EAAAiB,yBAIA,IAAAt3J,EAQAu4J,EAPA,IACAv4J,QAAA3N,EAAA+M,iBAAA43C,EAAA/5C,OACA,MAAAl/H,GACA,MAAAqjN,EAAArjN,EAAAs4R,EAAAmC,6BAKA,IACAD,EAAAZ,EAAA33J,GACA,MAAAjiI,GAEA,MADA4yH,EAAA98I,MAAAkqB,GACAqjN,EAAArjN,EAAAs4R,EAAAoC,wBAGA,GAAAF,EACA,OAAA,KAIA,IACAl+M,EAAAyiD,OAAAxK,EAAA75N,KAAAglO,iBAAAu5C,GACA,MAAAj5K,GAEA,MADA4yH,EAAA98I,MAAAkqB,GACAA,EAEA,OAAAs8E,GAqMAg9M,iBAAAA,EAEA3B,YAxJAp8X,GAAA,IAAA6nU,EAAA,SAAAo2D,EAAAj+X,MA0JA07X,UAlJAh3J,IACA,MAAA06J,EAAAh8J,EAAA,QACAi8J,EAAAj8J,EAAA,UAEA,MAAA,CACA04J,cAAA,IAAAj0D,EAAAjhG,EAAA,CAAAw4J,EAAA16J,KAAA,GACA46J,MAAA,IAAAz3D,EAAAo2D,EAAAr3J,EAAA,CAAAw4J,EAAA16J,MACAk3J,WAAA,IAAA/zD,EAAAjhG,EAAA,CAAAy4J,EAAA36J,KAAA,GACA66J,QAAA,IAAA13D,EAAAo2D,EAAAr3J,EAAA,CAAAy4J,EAAA36J,QA4IA+mD,QAvEA5hL,GACAgzR,EAAAvuR,OAAAzE,GAAA46H,SAwEA63J,UAAAA,EAEAiC,UAAAA,EAEAn9P,UAAAA,EACAo+P,gBAAAp+P,EAAAnxD;A;A;A;A;A;A;A;CC7XA,gBACA,IAAA5xE,IAAAA,EAAAC,QAAAmhY,GAEA,IAAAC,EAAA,MACAC,EAAA,KACAC,EAAA,QACAC,EAAAH,aACAI,EAAA,IAAAD,EAMAE,EAAA,OAGAC,EAAA,WACAC,EAAA,IACAC,EAAA,IACAC,EAAA,YAEAC,EAAAxvT,KAAAwvT,OAwWA,SAAAxnR,GACA,IAAA35G,EAAA25G,EAAAA,EAAA,EACA,OAAA,IAAA35G,IAAA25G,EAAA,GAAA,IAAAA,GAAA,EAAAA,GAAA,EAAA,IAAA,EAAA35G,GAzWA0wN,EAAA8vK,EAAA92R,UAGA82R,EAAAY,SA2KA,SAAAnlI,GACA,OAAA,IAAAukI,GAAAvkI,IA3KAukI,EAAAa,YAAAC,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACAd,EAAAe,YAAAD,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACAd,EAAApqI,WAiIA,SAAA1uJ,GACA,IAAAy/G,EACAu/D,EAAA,IAAA85G,EAGAv/J,GAFAv5H,GAAA,IAEAziB,QAAA,iBAAA,SAAAoE,GACA,IAAA6yK,GAAA7yK,EAIAuwB,EAAA,MAAAsiJ,EAAA,MAAA,IAEA,OADAwqB,EAAAxqB,KAAAA,EAAAtiJ,EACAA,KACA30B,QAAA,gCAAA,SAAAoE,EAAAu3Q,EAAA56P,GAIA,OAFA46P,EAAA,IAAA56P,IAAA,GACAmhH,EAAA,KAAA,IAAAy5I,IAAA56P,GACA,MACA/gB,QAAA,UAAA,SAAAoE,GAGA,OADAq9L,EAAA86G,OAAAn4S,EAAA63S,GAAAtvT,OAAA,EAAA,GACA,MACAia,MAAA,OAEAo1I,EAAAjwJ,OAAA,EACAiwJ,EAAA,KAEAA,EAAA,GAAA,EAKA,GAFAylD,EAAAv/D,KAAAA,EAAAr9G,KAAAg3P,IAAA3xJ,MAAArlG,KAAAm3H,IAAA9Z,GAAA,GAEAl8G,MAAAk8G,GACA,MAAA,IAAAr2G,UAAA,gBAGA,OAAAc,EAAA80K,IApKA85G,EAAAiB,UA2KA,SAAAt6K,GACA,OAAAu6K,EAAAv6K,EAAA,IAzKAuJ,EAAAwrC,KAAA,EACAxrC,EAAAvJ,KAAA,EACAuJ,EAAA8wK,KAAA,EAGA9wK,EAAAixK,QA8GA,SAAAH,GAEA,OADAz1R,KAAAy1R,OAAAA,GAAA,EACAz1R,MA/GA2kH,EAAAkxK,QAkHA,WACA,IAAAl7G,EAAA90K,EAAA7F,MACA,OAAA26K,EAAAv/D,KAAA,IAAA65K,IAAAt6G,EAAA86G,KAAAP,GAAAA,GAnHAvwK,EAAAmxK,SA0LA,WACA,IAAAn7G,EAAA90K,EAAA7F,MACAo7G,EAAAx1I,KAAA6nC,MAAAktK,EAAAv/D,KAAA,KAEA+0C,EAAAwqB,EAAAxqB,KACAA,IAAA/0C,GAAA+0C,EAAAykI,EAAAF,EAAAC,GAGA,OAAAv5K,GAjMAuJ,EAAAoxK,QAyCA,WAEA,OADA/1R,KAAAg2R,SAAA3kI,iBACArxJ,KAAAmwJ,MA1CAxrC,EAAAqxK,OA+FA,WAEA,OAAAC,EADApwR,EAAA7F,MACAo7G,OAhGAuJ,EAAAv9H,OAkMA,WACA,OAAA4Y,KAAA5B,WAAAllB,QAAA,WAAA,MAlMAyrI,EAAAvmH,SAqMA,SAAA44H,GACA,IAAA2jD,EAAA36K,KACAk2R,EAAAv7G,EAAAq7G,SACA5rT,EAAA,CACA24I,EAmDA,WACA,OAAAozK,EAAAD,EAAA1kI,gBAnDAhsC,EA8DA,WACA,OAAAxrH,EAAAk8R,EAAAE,qBAAA,IA9DAvxK,EAqDA,WACA,OAAAsxK,EAAAD,EAAAzkI,kBArDAltC,EAgEA,WACA,OAAAvqH,EAAA2gL,EAAAk7G,UAAA,IAhEAxxK,EAuDA,WACA,OAAA8xK,EAAAD,EAAAxkI,kBAvDA00B,EAmBA,WACA,IAAAj2B,EAAAwqB,EAAAo7G,UACA,OAAA5lI,EAAA,OACA,IAAAA,EACAA,EAAA,KACA,IAAAn2J,EAAAm2J,EAAA,GACAA,GAAA,EACAn2J,EAAAm2J,EAAA,GACAA,IAAA,OACA,IAAAn2J,GAAAm2J,EAAA,GAEAA,GA7BAtpL,EAiEA,WACA,OAAAwvT,EAAAH,EAAAI,cAjEAh9S,EAoEA,WACA,OAAAi9S,EAAAL,EAAA5kI,gBApEA1zH,EAmCA,WACA,OAAAu4P,EAAAD,EAAA3kI,eAnCAx9P,EAsCA,WACA,OA8FA+wK,EA9FAoxN,EAAA3kI,cA+FAzsF,EAAA,EAAA,GAAA,MAAA,EAAAA,GADA,IAAAA,GApIA5lF,EA6BA,WACA,OAAAi3S,EAAAD,EAAA5kI,cAAA,KA3BA,OAEA,SAAAklI,EAAAx/J,GACA,OAAAA,EAAA99I,QAAA,OAAA,SAAAoE,GACA,IAAA4B,EAAA5B,EAAA,GACA7Q,EAAAgqT,EAAAv3S,GACAwiE,EAAAt3E,EAAA8U,GACA,OAAAzS,EAAA+pT,EAAA/pT,GAAAi1E,EAAAA,IAAApkE,KAPAk5S,CAAAx/J,GAlNA,0BAHArS,EAAA20H,aAAAo9C,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GACA/xK,EAAAgyK,aAAAD,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAEA,IAEAH,EAAA,CACA,MAAA,MAAA,MAAA,MAAA,MAAA,MACA,MAAA,MAAA,MAAA,MAAA,MAAA,OAGAF,EAAA,CACA,MAAA,MAAA,MAAA,MAAA,MAAA,MAAA,OAGAI,EAAA,CACAG,IAAA,IACA9xK,EAAA,WACA7wN,EAAA,KACAuwN,EAAA,QACAmB,EAAA,WACA5mE,EAAA,KACAonI,EAAA,KACAV,EAAA,MACAlgE,EAAA,SAGA,OAAAkvK,EAEA,SAAAA,EAAAr5K,EAAAq6K,EAAAtlI,GACA,IAAAwqB,EAAA36K,KACA,KAAA26K,aAAA85G,GAAA,OAAA,IAAAA,EAAAr5K,EAAAq6K,EAAAtlI,GACAwqB,EAAAv/D,MAAAA,GAAA,EACAu/D,EAAA86G,MAAAA,GAAA,EACA96G,EAAAxqB,MAAAA,GAAA,EACAtqJ,EAAA80K,GAQA,SAAA90K,EAAA80K,GACA,IAGAk8G,EACA18L,EAJAg2D,EAAAwqB,EAAAxqB,KACA/0C,EAAAu/D,EAAAv/D,KACAq6K,EAAA96G,EAAA86G,KAKA,GAAAA,EAAA,GAAAR,GAAAQ,EAAA,CACA,IAAAxhY,EAAA2xE,KAAA6nC,MAAAgoR,EAAAR,GACAQ,GAAAxhY,EAAAghY,EACA75K,GAAAnnN,EACA4iY,EAAA,EAGA,IAAAhpR,EAAAsiJ,EAAAwkI,EACA,GAAAv5K,GAAA25K,GAAAA,EAAA35K,GAAAvtG,EAAA,EAEAssF,EAAAi7L,EAAAh6K,EAAA05K,MAEA3kI,GAAAh2D,EAAAw6L,EACAv5K,GAAAjhB,EAAA26L,GAIA,IAAAoB,EAAAD,EAAA76K,GACA86K,EAAAzlI,eAAA5iJ,EAAAqoR,EAAA7kI,kBAMA,IAAAjiG,GAJAgsD,GAAA86K,IAGA/7L,EAAAi7L,GAJAjlI,GAAAtiJ,GAIA8mR,IACAG,EACA36L,IAAA46L,GAAA3lO,GAAAA,GAAA2lO,IACA5kI,GAAAh2D,EAAAw6L,EACAv5K,EAAAhsD,GAGAynO,EAAA,EASA,OANAA,IACAl8G,EAAAxqB,KAAAA,EACAwqB,EAAAv/D,KAAAA,EACAu/D,EAAA86G,KAAAA,GAGA96G,EAQA,SAAAs7G,EAAA76K,GACA,IAAA86K,EAAA,IAAAn4R,KAAA,GAEA,OADAm4R,EAAAvlI,QAAAv1C,GACA86K,EA4DA,SAAAP,EAAA1nR,EAAAC,GACAA,GAAA,EAEAD,GAAAA,GAAA,EAGA,IAAAksF,EAAAi7L,GAJAlnR,GAAA8mR,GAIAH,GAAAO,EAAAnnR,EAAA4mR,GAGAngC,EAAAxmP,EAAA2mR,EAAA5mR,EAAA4mR,EAGA9vT,EAAAqwT,EAAA1gC,EAAAmgC,GAMA,OALA9vT,IACAo1H,GAAAp1H,EACA2vR,GAAA3vR,EAAA8vT,GAGA,IAAAJ,EAAA,IAAA//B,EAAA,EAAAv6J,EAAAw6L,GAsGA,SAAA+B,EAAAI,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GACA,OAEA,SAAAtnL,EAAA9qI,GACA,IAAA41M,EAAA90K,EAAA7F,MACA6vG,IAAAA,EAAA,IAAAhyG,MAAA,IACAu5R,EAAAvnL,EAAA9qI,GAAA,GAEA,IAAA2vR,EAAA9uR,KAAA6nC,MAAAktK,EAAAv/D,KAAA,KACAw5I,EAAA,SAAAj6E,EAAAxqB,KACAjiJ,EAAAknR,EAAAxgC,EAAAogC,GAAAI,EAAA1gC,EAAAsgC,GACA/mR,EAAA2mP,EAAAogC,EAAAtgC,EAAAsgC,EAGA76L,EAAAv0H,KAAA6nC,MAAAQ,EAAA+mR,GACA76L,IACAjsF,GAAAisF,EACAlsF,GAAAksF,EAAA66L,GAKA,OAFAqC,EAAAxnL,EAAA9qI,EAAAmyT,EAAAhpR,GACAmpR,EAAAxnL,EAAA9qI,EAAAoyT,EAAAlpR,GACA4hG,GAGA,SAAAwnL,EAAAxnL,EAAA9qI,EAAArxE,GACAm8M,EAAA9qI,EAAA+xT,GAAApjY,GAAA,GAAA,IACAm8M,EAAA9qI,EAAAgyT,GAAArjY,GAAA,GAAA,IACAm8M,EAAA9qI,EAAAiyT,GAAAtjY,GAAA,EAAA,IACAm8M,EAAA9qI,EAAAkyT,GAAA,IAAAvjY,GAIA,SAAA6hY,EAAAuB,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,GACA,OAEA,SAAAtnL,EAAA9qI,GACAqyT,EAAAvnL,EAAA9qI,GAAA,GACA,IAAAmpC,EAAAu9Q,EAAA57K,EAAA9qI,EAAAmyT,GAEA,OAAAvB,EADAlK,EAAA57K,EAAA9qI,EAAAoyT,GACAjpR,IAGA,SAAAu9Q,EAAA57K,EAAA9qI,GACA,OAjWA,SAiWA8qI,EAAA9qI,EAAA+xT,IACAjnL,EAAA9qI,EAAAgyT,IAAA,GACAlnL,EAAA9qI,EAAAiyT,IAAA,EACAnnL,EAAA9qI,EAAAkyT,KAIA,SAAAG,EAAAvnL,EAAA9qI,GACA,IAAAgX,EAAA8zH,GAAAA,EAAA5qI,OACA,GAAA,MAAA8W,EAAA,MAAA,IAAAgpB,UAAA,kBACA,GAAAhpB,EAAAhX,EAAA,EAAA,MAAA,IAAAw6J,WAAA,gBAYA,SAAA42J,EAAArxN,GACA,OAAAA,EAAA,EAAA,GAAA,MAAA,EAAAA,GAGA,SAAA9qE,EAAA8qE,EAAA1hE,GACA,OAAA+xR,GAAA,EAAArwN,IAAAj/F,QAAAu9B,IA3YA,iCCPA,aAEA,IAAAk+I,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,eAAAN,EAAAM,MAAA,aAAA,IAEA1mD,EAAA02L,UAAA,WAuBA,SAAAA,EAAA1qT,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA+SA,IACAk6K,EAAAjkJ,EAKA,OA5SAw0R,EAAAj0R,UAAAjqG,MAAAiuP,EAAAG,UAAA,IAQA8vI,EAAAj0R,UAAA1W,UAAA06J,EAAAG,UAAA,IAQA8vI,EAAAj0R,UAAAw0R,aAAA,EAQAP,EAAAj0R,UAAAy0R,SAAAzwI,EAAAG,UAAA,IAQA8vI,EAAAj0R,UAAA+zR,SAAA/vI,EAAAqE,KAAArE,EAAAqE,KAAAW,SAAA,EAAA,GAAA,GAAA,EAQAirI,EAAAj0R,UAAAgnQ,IAAAhjH,EAAAqE,KAAArE,EAAAqE,KAAAW,SAAA,EAAA,GAAA,GAAA,EAQAirI,EAAAj0R,UAAA66H,OAAAmpB,EAAAG,UAAA,IAWA8vI,EAAAtuR,OAAA,SAAApkB,EAAAulI,GAeA,OAdAA,IACAA,EAAAg9B,EAAAvtP,UACAuwN,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAxrF,OACA+wN,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAA+H,WACA,MAAA/H,EAAAizS,cAAA3+X,OAAAgnG,eAAAoD,KAAA1e,EAAA,iBACAulI,EAAAs9B,OAAA,IAAAC,MAAA9iK,EAAAizS,cACA,MAAAjzS,EAAAkzS,UAAA5+X,OAAAgnG,eAAAoD,KAAA1e,EAAA,aACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAkzS,UACA,MAAAlzS,EAAAwyS,UAAAl+X,OAAAgnG,eAAAoD,KAAA1e,EAAA,aACAulI,EAAAs9B,OAAA,IAAA8B,OAAA3kK,EAAAwyS,UACA,MAAAxyS,EAAAylR,KAAAnxW,OAAAgnG,eAAAoD,KAAA1e,EAAA,QACAulI,EAAAs9B,OAAA,IAAA8B,OAAA3kK,EAAAylR,KACA,MAAAzlR,EAAAs5I,QAAAhlO,OAAAgnG,eAAAoD,KAAA1e,EAAA,WACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAs5I,QACA/T,GAcAmtK,EAAAxtR,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAA02L,UACA5jR,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAxrF,MAAAs6G,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAA+H,UAAA+mB,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAizS,aAAAnkR,EAAAg0I,QACA,MACA,KAAA,EACA9iK,EAAAkzS,SAAApkR,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAwyS,SAAA1jR,EAAA61I,SACA,MACA,KAAA,EACA3kK,EAAAylR,IAAA32P,EAAA61I,SACA,MACA,KAAA,EACA3kK,EAAAs5I,OAAAxqH,EAAA2qH,QACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,IAAA7/D,EAAAsb,eAAA,SACA,MAAAmnJ,EAAAO,cAAA,2BAAA,CAAAr/E,SAAA3jF,IACA,IAAAA,EAAAsb,eAAA,aACA,MAAAmnJ,EAAAO,cAAA,+BAAA,CAAAr/E,SAAA3jF,IACA,OAAAA,GAWA0yS,EAAAzvI,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAA02L,UACA,OAAAh0P,EACA,IAAA1+C,EAAA,IAAAg8G,EAAA02L,UAaA,OAZA,MAAAh0P,EAAAlqI,QACA,iBAAAkqI,EAAAlqI,MACAiuP,EAAA99I,OAAAO,OAAAw5B,EAAAlqI,MAAAwrF,EAAAxrF,MAAAiuP,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAlqI,QAAA,GACAkqI,EAAAlqI,MAAAuxE,SACAia,EAAAxrF,MAAAkqI,EAAAlqI,QAEA,MAAAkqI,EAAA32C,YACA,iBAAA22C,EAAA32C,UACA06J,EAAA99I,OAAAO,OAAAw5B,EAAA32C,UAAA/H,EAAA+H,UAAA06J,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA32C,YAAA,GACA22C,EAAA32C,UAAAhiB,SACAia,EAAA+H,UAAA22C,EAAA32C,YAEA22C,EAAAu0P,cACA,IAAA,MACA,KAAA,EACAjzS,EAAAizS,aAAA,EAmCA,OAhCA,MAAAv0P,EAAAw0P,WACA,iBAAAx0P,EAAAw0P,SACAzwI,EAAA99I,OAAAO,OAAAw5B,EAAAw0P,SAAAlzS,EAAAkzS,SAAAzwI,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAw0P,WAAA,GACAx0P,EAAAw0P,SAAAntT,SACAia,EAAAkzS,SAAAx0P,EAAAw0P,WAEA,MAAAx0P,EAAA8zP,WACA/vI,EAAAqE,MACA9mK,EAAAwyS,SAAA/vI,EAAAqE,KAAAm5G,UAAAvhO,EAAA8zP,WAAAjrI,UAAA,EACA,iBAAA7oH,EAAA8zP,SACAxyS,EAAAwyS,SAAAtrT,SAAAw3D,EAAA8zP,SAAA,IACA,iBAAA9zP,EAAA8zP,SACAxyS,EAAAwyS,SAAA9zP,EAAA8zP,SACA,iBAAA9zP,EAAA8zP,WACAxyS,EAAAwyS,SAAA,IAAA/vI,EAAAiB,SAAAhlH,EAAA8zP,SAAAzjR,MAAA,EAAA2vB,EAAA8zP,SAAAxjR,OAAA,GAAAlP,UAAA,KAEA,MAAA4+B,EAAA+mO,MACAhjH,EAAAqE,MACA9mK,EAAAylR,IAAAhjH,EAAAqE,KAAAm5G,UAAAvhO,EAAA+mO,MAAAl+G,UAAA,EACA,iBAAA7oH,EAAA+mO,IACAzlR,EAAAylR,IAAAv+R,SAAAw3D,EAAA+mO,IAAA,IACA,iBAAA/mO,EAAA+mO,IACAzlR,EAAAylR,IAAA/mO,EAAA+mO,IACA,iBAAA/mO,EAAA+mO,MACAzlR,EAAAylR,IAAA,IAAAhjH,EAAAiB,SAAAhlH,EAAA+mO,IAAA12P,MAAA,EAAA2vB,EAAA+mO,IAAAz2P,OAAA,GAAAlP,UAAA,KAEA,MAAA4+B,EAAA46F,SACA,iBAAA56F,EAAA46F,OACAmpB,EAAA99I,OAAAO,OAAAw5B,EAAA46F,OAAAt5I,EAAAs5I,OAAAmpB,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA46F,SAAA,GACA56F,EAAA46F,OAAAvzJ,SACAia,EAAAs5I,OAAA56F,EAAA46F,SAEAt5I,GAYA0yS,EAAAxvI,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GACA,GAAAsyC,EAAAuiC,SAAA,CAuBA,GAtBAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAAlqI,MAAA,IAEAkqI,EAAAlqI,MAAA,GACAw8K,EAAAyoD,QAAA96H,QACA+/B,EAAAlqI,MAAAiuP,EAAAG,UAAAlkH,EAAAlqI,SAEAw8K,EAAAyoD,QAAAtyJ,OACAu3D,EAAA32C,UAAA,IAEA22C,EAAA32C,UAAA,GACAipF,EAAAyoD,QAAA96H,QACA+/B,EAAA32C,UAAA06J,EAAAG,UAAAlkH,EAAA32C,aAEA22C,EAAAu0P,aAAAjiN,EAAAp5C,QAAAzwD,OAAA,MAAA,EACA6pG,EAAAyoD,QAAAtyJ,OACAu3D,EAAAw0P,SAAA,IAEAx0P,EAAAw0P,SAAA,GACAliN,EAAAyoD,QAAA96H,QACA+/B,EAAAw0P,SAAAzwI,EAAAG,UAAAlkH,EAAAw0P,YAEAzwI,EAAAqE,KAAA,CACA,IAAA/xP,EAAA,IAAA0tP,EAAAqE,KAAA,EAAA,GAAA,GACApoH,EAAA8zP,SAAAxhN,EAAA+2E,QAAA5gL,OAAApyE,EAAAmqG,WAAA8xE,EAAA+2E,QAAA9gL,OAAAlyE,EAAA+qG,WAAA/qG,OAEA2pI,EAAA8zP,SAAAxhN,EAAA+2E,QAAA5gL,OAAA,IAAA,EACA,GAAAs7K,EAAAqE,KAAA,CACA/xP,EAAA,IAAA0tP,EAAAqE,KAAA,EAAA,GAAA,GACApoH,EAAA+mO,IAAAz0L,EAAA+2E,QAAA5gL,OAAApyE,EAAAmqG,WAAA8xE,EAAA+2E,QAAA9gL,OAAAlyE,EAAA+qG,WAAA/qG,OAEA2pI,EAAA+mO,IAAAz0L,EAAA+2E,QAAA5gL,OAAA,IAAA,EACA6pG,EAAAyoD,QAAAtyJ,OACAu3D,EAAA46F,OAAA,IAEA56F,EAAA46F,OAAA,GACAtoD,EAAAyoD,QAAA96H,QACA+/B,EAAA46F,OAAAmpB,EAAAG,UAAAlkH,EAAA46F,UA8BA,OA3BA,MAAAt5I,EAAAxrF,OAAAwrF,EAAAsb,eAAA,WACAojC,EAAAlqI,MAAAw8K,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAxrF,MAAA,EAAAwrF,EAAAxrF,MAAAuxE,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAxrF,OAAAwrF,EAAAxrF,OAEA,MAAAwrF,EAAA+H,WAAA/H,EAAAsb,eAAA,eACAojC,EAAA32C,UAAAipF,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAA+H,UAAA,EAAA/H,EAAA+H,UAAAhiB,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAA+H,WAAA/H,EAAA+H,WAEA,MAAA/H,EAAAizS,cAAAjzS,EAAAsb,eAAA,kBACAojC,EAAAu0P,aAAAjiN,EAAAp5C,QAAAzwD,OAAA60H,EAAA02L,UAAAa,aAAAvzS,EAAAizS,cAAAjzS,EAAAizS,cAEA,MAAAjzS,EAAAkzS,UAAAlzS,EAAAsb,eAAA,cACAojC,EAAAw0P,SAAAliN,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAkzS,SAAA,EAAAlzS,EAAAkzS,SAAAntT,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAkzS,UAAAlzS,EAAAkzS,UAEA,MAAAlzS,EAAAwyS,UAAAxyS,EAAAsb,eAAA,cACA,iBAAAtb,EAAAwyS,SACA9zP,EAAA8zP,SAAAxhN,EAAA+2E,QAAA5gL,OAAAA,OAAA6Y,EAAAwyS,UAAAxyS,EAAAwyS,SAEA9zP,EAAA8zP,SAAAxhN,EAAA+2E,QAAA5gL,OAAAs7K,EAAAqE,KAAAroJ,UAAAS,SAAAR,KAAA1e,EAAAwyS,UAAAxhN,EAAA+2E,QAAA9gL,OAAA,IAAAw7K,EAAAiB,SAAA1jK,EAAAwyS,SAAAzjR,MAAA,EAAA/uB,EAAAwyS,SAAAxjR,OAAA,GAAAlP,UAAA,GAAA9f,EAAAwyS,UAEA,MAAAxyS,EAAAylR,KAAAzlR,EAAAsb,eAAA,SACA,iBAAAtb,EAAAylR,IACA/mO,EAAA+mO,IAAAz0L,EAAA+2E,QAAA5gL,OAAAA,OAAA6Y,EAAAylR,KAAAzlR,EAAAylR,IAEA/mO,EAAA+mO,IAAAz0L,EAAA+2E,QAAA5gL,OAAAs7K,EAAAqE,KAAAroJ,UAAAS,SAAAR,KAAA1e,EAAAylR,KAAAz0L,EAAA+2E,QAAA9gL,OAAA,IAAAw7K,EAAAiB,SAAA1jK,EAAAylR,IAAA12P,MAAA,EAAA/uB,EAAAylR,IAAAz2P,OAAA,GAAAlP,UAAA,GAAA9f,EAAAylR,KAEA,MAAAzlR,EAAAs5I,QAAAt5I,EAAAsb,eAAA,YACAojC,EAAA46F,OAAAtoD,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAs5I,OAAA,EAAAt5I,EAAAs5I,OAAAvzJ,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAs5I,QAAAt5I,EAAAs5I,QAEA56F,GAUAg0P,EAAAj0R,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBASAuvI,EAAAa,cACApxI,EAAA,IAAAjkJ,EAAA5pG,OAAAU,OAAAmtP,IACAA,EAAA,GAAA,OAAA,EACAjkJ,GAGAw0R,EAhVA,GAmVAv+X,EAAAC,QAAA4nM,4DC9VA,aAQA7nM,EAAAC,QAAAgkY,UAAAl8K,GAUA,GATAA,EAAAi2C,oBACAhrL,OAAA+0I,EAAAk2C,cAAA,GAAA+2H,SAAA,EAAA,QACAhiT,OAAA+0I,EAAAm2C,cAAA82H,SAAA,EAAA,QACAhiT,OAAA+0I,EAAAo2C,eAAA62H,SAAA,EAAA,QACAhiT,OAAA+0I,EAAAq2C,iBAAA42H,SAAA,EAAA,QACAhiT,OAAA+0I,EAAAs2C,iBAAA22H,SAAA,EAAA,QAEA,IADAjtK,EAAAg7K,qBACA,OAWA/iY,EAAAC,QAAAw+X,aAAA12K,IACA,MAAAm8K,EAAA,IAAAvgR,OAEA,mEAMA93B,EAAA7Y,OAAA+0I,GAAA5jI,OAAA8F,MAAAi6S,GAEA,IAAAr4S,EACA,MAAA,IAAA4Z,MAAA,kBAGA,MAAAq3J,EAAA/pL,SAAA8Y,EAAA,GAAA,IACA68Q,EAAA31R,SAAA8Y,EAAA,GAAA,IAAA,EACAgxK,EAAA9pL,SAAA8Y,EAAA,GAAA,IACA21Q,EAAAzuR,SAAA8Y,EAAA,GAAA,IACA08Q,EAAAx1R,SAAA8Y,EAAA,GAAA,IACAw1Q,EAAAtuR,SAAA8Y,EAAA,GAAA,IACAy8Q,EAAAv1R,SAAA8Y,EAAA,GAAA9Z,MAAA,GAAA,GAAA,IAEA,OAAA,IAAA24B,KAAAA,KAAAg3P,IAAA5kG,EAAA4rG,EAAA7rG,EAAA2kG,EAAA+G,EAAAlH,EAAAiH,mCClDA,aAEAroW,EAAAu/X,wBAAA,0BACAv/X,EAAAw/X,0BAAA,4BACAx/X,EAAA4/X,uBAAA,yBACA5/X,EAAAk/X,2BAAA,6BACAl/X,EAAAs/X,wBAAA,0BACAt/X,EAAA4gY,4BAAA,8BACA5gY,EAAA6gY,uBAAA,yBACA7gY,EAAA0/X,wBAAA,wDCTA,aAEA,MAAAv4D,EAAAlnU,EAAA,QACAy6N,EAAAz6N,EAAA,iBACAw6N,EAAAx6N,EAAA,WACA0rP,EAAA1rP,EAAA,YAEA0wU,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,yBAAA,CACA10P,MAAA00P,EAAA,iCA0MA5wU,EAAAC,QA7LA,MAWAuD,YAAAi5X,EAAAP,EAAA7zJ,EAAAu+F,EAAAtlU,EAAA,CAAA6rW,KAAA,KACAxgQ,KAAAw3R,WAAA1H,EACA9vR,KAAAowR,WAAAb,EACAvvR,KAAAy3R,QAAA/7J,EACA17H,KAAA03R,UAAAz9D,EACAj6N,KAAA2hE,SAAAhtK,EACAqrG,KAAA23R,iBAAA,KAGA9gY,cACA,GAAAmpG,KAAA23R,iBACA,MAAA14I,EAAA,IAAAnmJ,MAAA,kCAAA,iCAIA,MAAA8+R,EAAA,CAEAC,MAAA,KAEAC,cAAA,KAEArxB,WAAA,KAIAsxB,gBAAAC,IACAJ,EAAAnxB,WAAA57L,YAAAv3B,UACAskP,EAAAnxB,WAAA,KAEA,IAEAmxB,EAAAE,cAAAF,EAAAC,cACAD,EAAAE,cAGAF,EAAAC,OACAD,EAAAG,gBAAAC,GAEA,MAAAv+R,GACA4yH,EAAA98I,MAAAkqB,MAEAu+R,MAEAhwB,OAAA10N,UAEA,MAAAskP,EAAAnxB,YACAx2I,aAAA2nK,EAAAnxB,YAEAmxB,EAAAC,MAAA,WAGAD,EAAAE,iBAIAv/J,QAAAA,GAAAv4H,KAAAy3R,SACAj3B,KAAAA,GAAAxgQ,KAAA2hE,SACA,IAAAs2N,GAAA,EAEAL,EAAAC,MAAA,IAAA73R,KAAAk4R,kBAAA3/J,EAAAioI,GAEAo3B,EAAAG,iBAAA,IACAE,GACAA,GAAA,EACAj4R,KAAA2hE,SAAAw2N,0BAjFA,KAoFAn4R,KAAA2hE,SAAAy2N,mBAjFA,QAoFAp4R,KAAA23R,iBAAAC,EAGA/gY,aACA,MAAA+gY,EAAA53R,KAAA23R,iBAEA,IAAAC,EACA,MAAA34I,EAAA,IAAAnmJ,MAAA,8BAAA,6BAGAkH,KAAA23R,iBAAA,WAEAC,EAAA5vB,SAOAnxW,wBAAA27Q,EAAAguF,GAGA,UACAxgQ,KAAAq4R,gBAAA7lH,GACA,MAAA/4K,GACA,MAAA82R,EAAA,oDAGA,YADAlkK,EAAA98I,MAAAghT,GAKA,GAAA/vB,EACA,IACA,MAAArsW,QAAA6rG,KAAA03R,UAAAY,WAEA,IAAA,MAAAtjY,KAAAb,EAAA,CACA,GAAA,SAAAa,EAAAnC,KACA,SAEA,MAAAwsQ,QAAAr/J,KAAA03R,UAAA1iH,UAAAhgR,EAAAnC,KAAA2tW,GACAjoI,QAAAvK,EAAA75N,KAAAysP,OAAAye,EAAAmhG,SAEAxgQ,KAAAq4R,gBAAA9/J,IAEA,MAAA9+H,GACA4yH,EAAA98I,MAAAkqB,IAQA5iG,sBAAA27Q,GACA,IAAAA,IAAAA,EAAA75C,MACA,MAAAsmB,EAAA,IAAAnmJ,MAAA,uBAAA,2BAGA,IACA,MAAA4iI,QAAA3N,EAAAgN,kBAAAy3C,EAAA75C,OACAjlO,QAAAssG,KAAAu4R,kBAAA78J,SACA17H,KAAAw3R,WAAAxH,eAAAx9G,EAAA9+Q,EAjJA,OAkJA,MAAA+lG,GACA,GAAA,uBAAAA,EAAApkG,KACA,OAGA,MAAAokG,GAOA5iG,wBAAA6kO,GACA,IAAA3N,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,mBAAA,uBAGA,IACA,MAAAq4R,QAAAnxR,KAAAowR,WAAA5uS,IAAAi5O,EAAA22D,YAAA11J,EAAAz3I,KAEA,KAAAktS,aAAA14J,YACA,MAAAwmB,EAAA,IAAAnmJ,MAAA,8CAAA,2BAIA,IAGA,OAFA2hO,EAAA62D,UAAAH,GAEAz9X,MACA,MAAA+lG,GAEA,MADA4yH,EAAA98I,MAAAkqB,GACAwlJ,EAAA,IAAAnmJ,MAAA,yDAAA,4BAEA,MAAAW,GAGA,GAAAA,GAAAA,EAAA++R,SACA,MAAAv5I,EAAA,IAAAnmJ,MAAA,yCAAA4iI,EAAAz3I,MAAA,sBAGA,MAAAwV,0HC9MA,aAEA,MAAAghO,EAAAlnU,EAAA,QACAw6N,EAAAx6N,EAAA,WACA0rP,EAAA1rP,EAAA,YACA0wU,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,sBAAA,CACA10P,MAAA00P,EAAA,8BAEA5rG,EAAA9kO,EAAA,0BAEA4xH,OAAAA,GAAA5xH,EAAA,uBACA28X,EAAA/qQ,EAAA4zO,gBAAA1jW,KA6HAhC,EAAAC,QAzHA,MAIAuD,YAAAw4X,GACArvR,KAAAmwR,SAAAd,EAQAx4X,cAAAhE,EAAA8B,EAAA,IACA,GAAA,iBAAA9B,EACA,MAAAosP,EAAA,IAAAnmJ,MAAA,gBAAA,oBAGA,MAAA8qQ,EAAAjvW,EAAAivW,WAAA,SAAAjvW,EAAAivW,UAAAxlQ,WAEAq6R,EAAA5lY,EAAAitF,MAAA,KAEA,GAAA,IAAA24S,EAAAxzT,QAAA,KAAAwzT,EAAA,GACA,MAAAx5I,EAAA,IAAAnmJ,MAAA,gBAAA,oBAGA,MAAA9jG,EAAAyjY,EAAA,GAGA,IAAAxgL,EAAA5rG,EAAAA,EAEAu3P,IACA3rJ,EAlCA,IAqCA,MAAAlsI,QAAAi0B,KAAA1Y,SAAAtyF,EAAAijN,GAGA,OADAoU,EAAA,GAAAx5N,oCACAk5E,EAUAl1E,eAAAhE,EAAAolN,GAEA,GAAA,IAAAA,EAAA,CACA,MAAAs4K,EAAA,0DAGA,MAFAlkK,EAAA98I,MAAAghT,GAEAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,+BAGA,MAAAxkT,QAAAi0B,KAAA04R,aAAA7lY,GACA4lY,EAAA1sT,EAAA+T,MAAA,KAGA,MAAA,SAAA24S,EAAA,IAAAxgL,EAKAj4G,KAAA1Y,SAAAmxS,EAAA,GAAAxgL,EAAA,GAJAlsI,EAYAl1E,mBAAAhE,GACA,MAAA6oO,EAAA3N,EAAA2M,cAAA7nO,IACA+9X,WAAAA,GAAAn2D,EAAAi2D,UAAAh1J,EAAApC,WACA,IAAApqB,EAeAypL,EAbA,IACAzpL,QAAAlvG,KAAAmwR,SAAA3uS,IAAAovS,EAAAK,cACA,MAAAx3R,GAGA,GAFA4yH,EAAA98I,MAAA,oCAAAkqB,GAEAA,EAAApkG,OAAA66X,EACA,MAAAjxI,EAAA,IAAAnmJ,MAAA,wBAAAjmG,kCAAA,uBAGA,MAAAosP,EAAA,IAAAnmJ,MAAA,4CAAA4iI,EAAAt9H,cAAA,uCAKA,IACAu6R,EAAAl+D,EAAA62D,UAAApiL,GACA,MAAAz1G,GAGA,MAFA4yH,EAAA98I,MAAA,6BAAAkqB,GAEAwlJ,EAAA,IAAAnmJ,MAAA,yDAAA,+BAIA,OAAAkH,KAAA44R,gBAAAl9J,EAAAi9J,GASA9hY,sBAAA6kO,EAAAi9J,GACA,MAAAngK,QAAAiiG,EAAAs4D,iBAAAr3J,EAAAi9J,GAKA,aAFAl+D,EAAAx+F,SAAAzD,EAAAmgK,GAEAtgK,EAAAsgK,EAAAjlY,oKCrIA,aAEA,MAAAmlY,gBAAAA,GAAAtlY,EAAA,kBACAiuF,EAAAjuF,EAAA,OAEAulY,EAAAvlY,EAAA,sBACA27X,EAAA37X,EAAA,uBASAF,EAAAC,QAAA,EAAAqoU,OAAAA,EAAA3B,KAAAA,EAAAt+F,OAAAA,EAAA/mO,QAAAA,MAEA,MAAAokY,EAAA,GAGA,IAAAC,EACA,GAAAx3S,EAAA7sF,EAAA,2BAAA,GAAA,CACA,MAAAwmU,EAAAQ,EAAAR,OACA89D,EAAAj/D,EAAAu1D,UAEAyJ,EAAA,IAAAF,EAAA39D,EAAA89D,EAAAv9J,GACAq9J,EAAAjuT,KAAAkuT,GAIA,GAAAx3S,EAAA7sF,EAAA,aAAA6sF,EAAA7sF,EAAA,6BAAA,GAAA,CACA,MAAAukY,EAAA,IAAAhK,EAAAl1D,GACA++D,EAAAjuT,KAAAouT,QAEAH,EAAAjuT,KAAA6wP,EAAAw9D,MAIA,OAAA,IAAAN,EAAAE,iICtCA,aAEA,MAAAK,EAAA7lY,EAAA,kBACA8lY,EAAA9lY,EAAA,cACA+lY,EAAA/lY,EAAA,WACAslY,EAAAtlY,EAAA,YACAgmY,EAAAhmY,EAAA,eACAimY,EAAAjmY,EAAA,WAOAF,EAAAC,QAAA,CACA8lY,sBAAAA,EACAC,kBAAAA,EACAC,eAAAA,EACAT,gBAAAA,EACAU,mBAAAA,EACAC,MAAAA,2JCpBA,aAEA,MAAA17D,QAAAA,GAAAvqU,EAAA,uBACA62E,EAAA72E,EAAA,UAkHAF,EAAAC,QA/FA,cAAAwqU,EAKAjnU,YAAA6zE,EAAAyZ,GACAohC,QAEAvlB,KAAAt1B,MAAAA,EACAs1B,KAAA7b,UAAAA,EAGAttF,OACA,OAAAmpG,KAAAt1B,MAAAqV,OAQAlpF,IAAA7B,EAAA2kG,EAAAhlG,GACA,OAAAqrG,KAAAt1B,MAAA2mJ,IAAArxH,KAAA7b,UAAAoiH,QAAAvxM,GAAA2kG,EAAAhlG,GAOAkC,IAAA7B,EAAAL,GACA,OAAAqrG,KAAAt1B,MAAA8W,IAAAwe,KAAA7b,UAAAoiH,QAAAvxM,GAAAL,GAOAkC,IAAA7B,EAAAL,GACA,OAAAqrG,KAAAt1B,MAAAqU,IAAAihB,KAAA7b,UAAAoiH,QAAAvxM,GAAAL,GAOAkC,OAAA7B,EAAAL,GACA,OAAAqrG,KAAAt1B,MAAA+Y,OAAAuc,KAAA7b,UAAAoiH,QAAAvxM,GAAAL,GAMAkC,QACA,MAAAyiF,EAAA0mB,KAAAt1B,MAAA+uT,QACA,MAAA,CACApoK,IAAA,CAAAr8N,EAAAtB,KACA4lF,EAAA+3I,IAAArxH,KAAA7b,UAAAoiH,QAAAvxM,GAAAtB,IAEA+vF,OAAAzuF,IACAskF,EAAAmK,OAAAuc,KAAA7b,UAAAoiH,QAAAvxM,KAEAqkW,OAAA1kW,GACA2kF,EAAA+/Q,OAAA1kW,IASAkC,MAAAy3G,EAAA35G,GACA,OAAAy1E,EAAA41B,KAAAt1B,MAAAg+H,MAAAp6F,EAAA35G,IAAA,EAAAK,IAAAA,EAAAtB,MAAAA,MACA,CACAsB,IAAAgrG,KAAA7b,UAAAu1S,OAAA1kY,GACAtB,MAAAA,MASAmD,UAAAy3G,EAAA35G,GACA,OAAAy1E,EAAA41B,KAAAt1B,MAAAivT,UAAArrR,EAAA35G,IAAAK,GACAgrG,KAAA7b,UAAAu1S,OAAA1kY,KAIA6B,QACA,OAAAmpG,KAAAt1B,MAAAsV,sFCjHA,aAiBA3sF,EAAAC,QANAggJ,gBAAAv+D,EAAAojL,GACA,UAAA,MAAAx+J,KAAA5kB,QACAojL,EAAAx+J,kCCbA,aAEA,MAAAmkO,QAAAA,EAAAjB,IAAAA,EAAA13M,OAAAA,GAAA5xH,EAAA,uBACA4mR,EAAA5mR,EAAA,WACAqmY,EAAArmY,EAAA,kBAEAsmY,EAAA,IAAAh9D,EAAA1iD,EAAA2/G,aACAC,EAAA,IAAAl9D,EAAA1iD,EAAA6/G,WA0BA,MAAAX,UAAAv7D,EAKAjnU,YAAAojY,EAAAT,GACAj0Q,QAEAvlB,KAAAt1B,MAAA,IAAAkvT,EAAAK,EAAA,CACA1zL,QAAAvmG,KAAAk6R,YAAAvhS,KAAAqH,MACA05R,OAAA15R,KAAAm6R,WAAAxhS,KAAAqH,QAEAA,KAAAw5R,MAAAA,EAGA3iY,mBACAmpG,KAAAt1B,MAAAqV,OAEAigB,KAAAw5R,YAAAH,EAAAnlY,OAAA8rG,KAAAt1B,MAAAs1B,KAAAw5R,OAMA3iY,YAAA7B,GACA,MAAAknF,EAAAlnF,EAAAopG,WACA,GAAAliB,IAAA29S,EAAAz7R,YAAAliB,IAAA69S,EAAA37R,WACA,OAAAppG,EAIA,OADA,IAAA6nU,EAAA78N,KAAAw5R,MAAAhlK,IAAAt4I,IACAxR,MAAA11E,GAMA6B,WAAA7B,GACA,MAAAknF,EAAAlnF,EAAAopG,WACA,OAAAliB,IAAA29S,EAAAz7R,YAAAliB,IAAA69S,EAAA37R,WACAppG,EAEA6nU,EAAAwB,eAAArpU,EAAA0uF,OAAAte,MAAA,IAQAvuE,0BAAAojY,EAAAT,GACA,UACAH,EAAAnlY,OAAA+lY,EAAAT,GACA,MAAA//R,GACA,GAAAA,GAAA,qBAAAA,EAAA9f,QAAA,MAAA8f,EAEA,OAAA4/R,EAAAt5S,KAAAk6S,GAOApjY,kBAAAojY,GACA,MAAAT,QAAAr/G,EAAAigH,aAAA,IAAAH,GACA,OAAA,IAAAZ,EAAAY,EAAAT,GAOA3iY,oBAAAojY,EAAAT,GACA,MAAAa,QAAAJ,EAAAl7S,IAAA86S,GACA,IAAAQ,IAAAb,EACA,MAAAr0Q,EAAA60O,kBAAAlhQ,MAAA,uEAEA,IAAAuhS,EAAA,CAEA,MAAAhpK,EAAA,mBAAA4oK,EAAAK,OAAAL,EAAAK,OAAA3hS,KAAAshS,GAAAA,EAAA5oK,IAAA14H,KAAAshS,GAMA,aALAl0N,QAAA2gD,IAAA,CACA2K,EAAAwoK,GAAA,IAAA/wK,aAAAxlH,OAAAk2R,EAAAp7R,WAAA,OACAizH,EAAA0oK,GAAA,IAAAjxK,aAAAxlH,OAAA62K,EAAAogH,WAGAf,EAIA,MAAAgB,QAAArgH,EAAAigH,aAAA,IAAAH,GACApzT,GAAA2zT,GAAA,IAAAp8R,WACA9kB,EAAAkgT,EAAAp7R,WACA,GAAAv3B,IAAAyS,EACA,MAAA,IAAAwf,MAAA,iBAAAxf,mCAAAzS,KAEA,OAAA2zT,EAQA3jY,IAAA7B,EAAA2kG,EAAAhlG,GACA,OAAAqrG,KAAAt1B,MAAA2mJ,IAAAr8N,EAAA2kG,EAAAhlG,GAOAkC,IAAA7B,EAAAL,GACA,OAAAqrG,KAAAt1B,MAAA8W,IAAAxsF,EAAAL,GAOAkC,IAAA7B,EAAAL,GACA,OAAAqrG,KAAAt1B,MAAAqU,IAAA/pF,EAAAL,GAOAkC,OAAA7B,EAAAL,GACA,OAAAqrG,KAAAt1B,MAAA+Y,OAAAzuF,EAAAL,GAGAkC,QACA,OAAAmpG,KAAAt1B,MAAA+uT,QAOA5iY,MAAAy3G,EAAA35G,GACA,MAAA8lY,EAAA,CACA11T,OAAAupC,EAAAvpC,OACAgwP,MAAAzmN,EAAAymN,MAEA2kC,OAAA,GAEAx1Q,QAAA,CAEAnwF,GAAAA,EAAAiB,IAAAopG,aAAAy7R,EAAAz7R,WAEArqG,GAAAA,EAAAiB,IAAAopG,aAAA27R,EAAA37R,cAIAzT,OAAAA,GAAA2jB,EAOA,GANA,MAAA3jB,GACA8vS,EAAAv2S,QAAApZ,MAAA/2E,GACAisG,KAAAm6R,WAAApmY,EAAAiB,KAAAopG,WAAAjiB,WAAAwO,KAIA,MAAA2jB,EAAApqB,QAAA,CACA,MAAAA,EAAAoqB,EAAApqB,QAAA9Z,KAAAs3E,GAEA,EAAA1sJ,IAAAA,EAAAtB,MAAAA,KACAguJ,EAAA,CACA1sJ,IAAAgrG,KAAAm6R,WAAAnlY,GACAtB,MAAAA,MAMA+mY,EAAAv2S,QAAAu2S,EAAAv2S,QAAA2N,OAAA3N,GAoBA,OAjBA,MAAAoqB,EAAAorP,SACA+gC,EAAA/gC,OAAAprP,EAAAorP,OAAAtvR,KAAA8lG,GAEA,CAAArpG,EAAAyS,IACA42F,EAAA,CACAl7K,IAAAgrG,KAAAm6R,WAAAtzT,EAAA7xE,KACAtB,MAAAmzE,EAAAnzE,OACA,CACAsB,IAAAgrG,KAAAm6R,WAAA7gT,EAAAtkF,KACAtB,MAAA4lF,EAAA5lF,WAQAssG,KAAAt1B,MAAAg+H,MAAA+xL,EAAA9lY,GAOAkC,UAAAy3G,EAAA35G,GACA,MAAA8lY,EAAA,CACA11T,OAAAupC,EAAAvpC,OACAgwP,MAAAzmN,EAAAymN,MAEA2kC,OAAA,GAEAx1Q,QAAA,CAEAlvF,GAAAA,EAAAopG,aAAAy7R,EAAAz7R,WAEAppG,GAAAA,EAAAopG,aAAA27R,EAAA37R,cAIAzT,OAAAA,GAAA2jB,EAOA,GANA,MAAA3jB,GACA8vS,EAAAv2S,QAAApZ,MAAA91E,GACAgrG,KAAAm6R,WAAAnlY,GAAAopG,WAAAjiB,WAAAwO,KAIA,MAAA2jB,EAAApqB,QAAA,CACA,MAAAA,EAAAoqB,EAAApqB,QAAA9Z,KAAAs3E,GAEA1sJ,GACA0sJ,EAAA1hD,KAAAm6R,WAAAnlY,MAKAylY,EAAAv2S,QAAAu2S,EAAAv2S,QAAA2N,OAAA3N,GAYA,OATA,MAAAoqB,EAAAorP,SACA+gC,EAAA/gC,OAAAprP,EAAAorP,OAAAtvR,KAAA8lG,GAEA,CAAArpG,EAAAyS,IAAA42F,EAAAlwE,KAAAm6R,WAAAtzT,GAAAm5B,KAAAm6R,WAAA7gT,OAMA0mB,KAAAt1B,MAAAivT,UAAAc,EAAA9lY,GAGAkC,QACA,OAAAmpG,KAAAt1B,MAAAsV,SAIA3sF,EAAAC,QAAA+lY,sGC5RA,aAEA,MAAAx8D,IAAAA,GAAAtpU,EAAA,uBACAgnY,EAAAhnY,EAAA,kBAOAmnY,EAAA,sBACAZ,EAAA,WAMA,MAAAa,EAIA9jY,YAAAg1I,GACA7rC,KAAA6rC,MAAAA,EACA7rC,KAAAntG,KAAA,OACAmtG,KAAAysK,SAAA,GAMA51Q,IAAAqlF,GACA,MAAA,eAGArlF,WACA,MAAA,GAAA6jY,OAAA16R,KAAAntG,QAAAmtG,KAAA6rC,SAMA,MAAA+uP,UAAAD,EAIA9jY,YAAAgkY,GACAt1Q,MAAAs1Q,GACA76R,KAAAysK,SAAA,GAAA47G,SAAAwS,EAAA,KACA76R,KAAAntG,KAAA,SAMAgE,IAAAikY,GACA,OAAAA,EAAA96R,KAAAysK,UAAArnM,MAAA,EAAA46B,KAAA6rC,QAIA,MAAAkvP,UAAAJ,EAIA9jY,YAAAmkY,GACAz1Q,MAAAy1Q,GACAh7R,KAAAysK,SAAA,GAAA47G,SAAA2S,EAAA,KACAh7R,KAAAntG,KAAA,SAMAgE,IAAAikY,GACA,MAAA5+S,EAAA8jB,KAAAysK,SAAAquH,EACA,OAAA5+S,EAAA9W,MAAA8W,EAAAjX,OAAA+6B,KAAA6rC,QAIA,MAAAovP,UAAAN,EAIA9jY,YAAAmkY,GACAz1Q,MAAAy1Q,GACAh7R,KAAAysK,SAAA,GAAA47G,SAAA2S,EAAA,EAAA,KACAh7R,KAAAntG,KAAA,eAMAgE,IAAAikY,GACA,MAAA5+S,EAAA8jB,KAAAysK,SAAAquH,EACA/1T,EAAAmX,EAAAjX,OAAA+6B,KAAA6rC,MAAA,EACA,OAAA3vD,EAAA9W,MAAAL,EAAAA,EAAAi7B,KAAA6rC,QAUA,SAAAqvP,EAAA1lS,GAGA,GAAA,KAFAA,EAAAA,EAAAhe,QAEAvS,OACA,MAAA,IAAA6zB,MAAA,sBAGA,IAAAtD,EAAArZ,WAAAu+S,GACA,MAAA,IAAA5hS,MAAA,8BAAAtD,KAGA,MAAAyQ,EAAAzQ,EAAApwB,MAAAs1T,EAAAz1T,QAAA6a,MAAA,KACA4jB,EAAAuC,EAAA,GAEA,GAAA,OAAAvC,EACA,MAAA,IAAA5K,MAAA,6BAAA4K,MAGA,MAAA7wG,EAAAozG,EAAA,GAEA,IAAAA,EAAA,GACA,MAAA,IAAAnN,MAAA,iBAGA,MAAA+yC,EAAAzlE,SAAA6/B,EAAA,GAAA,IAEA,OAAApzG,GACA,IAAA,SACA,OAAA,IAAA+nY,EAAA/uP,GACA,IAAA,SACA,OAAA,IAAAkvP,EAAAlvP,GACA,IAAA,eACA,OAAA,IAAAovP,EAAApvP,GACA,QACA,MAAA,IAAA/yC,MAAA,6BAAAjmG,MAgBAQ,EAAAC,QAAA,CACAinY,OAAAA,EACAW,cAAAA,EACAd,aAXA9mP,MAAA3gJ,EAAAsnY,KACA,MAAAjlY,EAAA,IAAA6nU,EAAAlqU,GAAA+3E,MAAA,IAAAmyP,EAAAi9D,IAEAt4S,EAAA,mBAAAy4S,EAAAkB,OAAAlB,EAAAkB,OAAAxiS,KAAAshS,GAAAA,EAAAz4S,IAAAmX,KAAAshS,GACAluT,QAAAyV,EAAAxsF,GACA,OAAAkmY,GAAA,IAAA5qK,aAAAlsH,OAAAr4B,GAAA,IAAAyL,SAOAojT,OAAAA,EACAG,OAAAA,EACAE,WAAAA,EACAjB,UArJA,UAsJAF,YAAAA,EACAY,OAAAA,uFCnKA,aAEArnY,EAAAC,QAAA,kpCCDA,aAEA,MAAAwqU,QACAA,EAAAjB,IAAAA,EAAA13M,OAAAA,EAAAo7J,OAAAy4E,QACAA,EAAAe,iBACAA,IAEAxmW,EAAA,uBACAw6E,EAAAx6E,EAAA,aACA2lW,EAAA3lW,EAAA,WACA07N,EAAA17N,EAAA,YAEA6nY,EAAA7nY,EAAA,kBAuOAF,EAAAC,QAjNA,cAAAwqU,EAIAjnU,YAAAwkY,GACA91Q,QAEAvlB,KAAAq7R,OAAAA,EAAAj2T,QAGAvuE,mBACAkvK,QAAA2gD,IAAA1mH,KAAAq7R,OAAAjxT,KAAA8U,GAAAA,EAAAqwS,UAAAxvS,UAUAlpF,QAAA7B,GACA,IAAA,MAAA5B,KAAA4sG,KAAAq7R,OACA,GAAAjoY,EAAAu3F,OAAAyT,aAAAppG,EAAAopG,YAAAhrG,EAAAu3F,OAAA2wS,aAAAtmY,GAAA,CACA,MAAAknF,EAAA69Q,EAAA/kW,EAAAopG,WAAAhrG,EAAAu3F,OAAAyT,YACA,MAAA,CACAmxR,UAAAn8X,EAAAm8X,UACAgM,WAAAnoY,EAAAu3F,OACAia,KAAA,IAAAi4N,EAAA3gP,KAWArlF,IAAA7B,EAAAtB,EAAAiB,GACA,MAAA2oF,EAAA0iB,KAAAw7R,QAAAxmY,GACA,GAAA,MAAAsoF,EACA,MAAA6nC,EAAA+0O,mBAAA,IAAAphQ,MAAA,sCAGA,OAAAxb,EAAAiyS,UAAAl+J,IAAA/zI,EAAAsnB,KAAAlxG,EAAAiB,GAOAkC,IAAA7B,EAAAL,GACA,MAAA2oF,EAAA0iB,KAAAw7R,QAAAxmY,GACA,GAAA,MAAAsoF,EACA,MAAA6nC,EAAA4zO,cAAA,IAAAjgQ,MAAA,sCAEA,OAAAxb,EAAAiyS,UAAA/tS,IAAAlE,EAAAsnB,KAAAjwG,GAOAkC,IAAA7B,EAAAL,GACA,MAAA2oF,EAAA0iB,KAAAw7R,QAAAxmY,GACA,OAAA,MAAAsoF,EACAyoF,QAAAC,SAAA,GAEA1oF,EAAAiyS,UAAAxwS,IAAAzB,EAAAsnB,KAAAjwG,GAOAkC,OAAA7B,EAAAL,GACA,MAAA2oF,EAAA0iB,KAAAw7R,QAAAxmY,GACA,GAAA,MAAAsoF,EACA,MAAA6nC,EAAA80O,oBAAA,IAAAnhQ,MAAA,sCAGA,OAAAxb,EAAAiyS,UAAA9rS,OAAAnG,EAAAsnB,KAAAjwG,GAGAkC,oBACAkvK,QAAA2gD,IAAA1mH,KAAAq7R,OAAAjxT,KAAA8U,GACAA,EAAAqwS,UAAAvvS,WAOAnpF,QAEA,MAAA4kY,EAAA,GAIAjlE,EAAAxhU,IACA,MAAAsoF,EAAA0iB,KAAAw7R,QAAAxmY,GACA,GAAA,MAAAsoF,EACA,MAAA,IAAAwb,MAAA,qCAGA,MAAA5Z,EAAA5B,EAAAi+S,WAAAn9R,WAKA,OAJA,MAAAq9R,EAAAv8S,KACAu8S,EAAAv8S,GAAA5B,EAAAiyS,UAAAkK,SAGA,CACAA,MAAAgC,EAAAv8S,GACA0lB,KAAAtnB,EAAAsnB,OAIA,MAAA,CACAysH,IAAA,CAAAr8N,EAAAtB,KACA,MAAA4pF,EAAAk5O,EAAAxhU,GACAsoF,EAAAm8S,MAAApoK,IAAA/zI,EAAAsnB,KAAAlxG,IAEA+vF,OAAAzuF,IACA,MAAAsoF,EAAAk5O,EAAAxhU,GACAsoF,EAAAm8S,MAAAh2S,OAAAnG,EAAAsnB,OAEAy0P,OAAA/lN,MAAA3+I,UACAoxK,QAAA2gD,IAAAlzN,OAAAW,KAAAsnY,GAAArxT,KAAAlD,GAAAu0T,EAAAv0T,GAAAmyR,OAAA1kW,QASAkC,MAAAy3G,EAAA35G,GACA,MAAA+mY,EAAA17R,KAAAq7R,OAAAjxT,KAAA8U,IACA,MAAA2iK,EAAA,IAAAu5I,EAAAl8S,EAAAqwS,UAAA,CACAhpL,QAAAvxM,IACA,MAAA,IAAA8jG,MAAA,2BAEA4gS,OAAA1kY,GACAkqF,EAAAyL,OAAAjgB,MAAA11E,KAIA,IAAA21F,EAKA,OAJA,MAAA2jB,EAAA3jB,SACAA,EAAAovQ,EAAAzrP,EAAA3jB,OAAAzL,EAAAyL,OAAAyT,aAGAyjJ,EAAAn5C,MAAA,CACA/9G,OAAAA,EACAzG,QAAAoqB,EAAApqB,SACAvvF,MAGA,IAAA6kW,EAAAvqI,KAAAysK,GAGA,GAFAptR,EAAApqB,SAAAoqB,EAAApqB,QAAA9vF,SAAAstJ,IAAA83M,EAAAzrR,EAAAyrR,EAAA93M,MACApzC,EAAAorP,QAAAprP,EAAAorP,OAAAtlW,SAAA87K,IAAAspL,EAAAR,EAAAQ,EAAAtpL,MACA,MAAA5hE,EAAAvpC,OAAA,CACA,IAAAoC,EAAA,EACAqyR,EAAAzrR,EAAAyrR,GAAA,IAAAryR,KAAAmnC,EAAA,SAIA,OAFA,MAAAA,EAAAymN,QAAAykC,EAAAN,EAAAM,EAAAlrP,EAAAymN,QAEAykC,EAOA3iW,UAAAy3G,EAAA35G,GACA,MAAA+mY,EAAA17R,KAAAq7R,OAAAjxT,KAAA8U,IACA,MAAA2iK,EAAA,IAAAu5I,EAAAl8S,EAAAqwS,UAAA,CACAhpL,QAAAvxM,IACA,MAAA,IAAA8jG,MAAA,2BAEA4gS,OAAA1kY,GACAkqF,EAAAyL,OAAAjgB,MAAA11E,KAIA,IAAA21F,EAKA,OAJA,MAAA2jB,EAAA3jB,SACAA,EAAAovQ,EAAAzrP,EAAA3jB,OAAAzL,EAAAyL,OAAAyT,aAGAyjJ,EAAA83I,UAAA,CACAhvS,OAAAA,EACAzG,QAAAoqB,EAAApqB,SACAvvF,MAGA,IAAA6kW,EAAAvqI,KAAAysK,GAGA,GAFAptR,EAAApqB,SAAAoqB,EAAApqB,QAAA9vF,SAAAstJ,IAAA83M,EAAAzrR,EAAAyrR,EAAA93M,MACApzC,EAAAorP,QAAAprP,EAAAorP,OAAAtlW,SAAA87K,IAAAspL,EAAAR,EAAAQ,EAAAtpL,MACA,MAAA5hE,EAAAvpC,OAAA,CACA,IAAAoC,EAAA,EACAqyR,EAAAzrR,EAAAyrR,GAAA,IAAAryR,KAAAmnC,EAAA,SAIA,OAFA,MAAAA,EAAAymN,QAAAykC,EAAAN,EAAAM,EAAAlrP,EAAAymN,QAEAykC,iJChPA,aAEA,MAAAmiC,EAAApoY,EAAA,eAkCAF,EAAAC,QAtBAggJ,mBAAA/xC,GACA,MAAAu9H,EAAA68J,IAEA9wN,YAAAv3B,UACA,UACAyyB,QAAA2gD,IACAnlH,EAAAn3B,KAAAkpE,MAAAv+D,IACA,UAAA,MAAAkmB,KAAAlmB,EACA+pJ,EAAAh0J,KAAAmwB,OAKA6jI,EAAA95J,MACA,MAAAy0B,GACAqlI,EAAA95J,IAAAy0B,MAEA,SAEAqlI,sDCjCA,MAAA88J,EAAAroY,EAAA,aAEAF,EAAAC,QAAAqB,IAEA,IAAAw2K,EAEA,mBAHAx2K,EAAAA,GAAA,KAIAw2K,EAAAx2K,EACAA,EAAA,IAEAw2K,EAAAx2K,EAAAw2K,MAGA,IACAwwN,EAAAE,EAAA3wN,EADA2kC,EAAA,IAAA+rL,EAGA,MAqCAE,EAAA1+S,GACAy+S,EAAAA,EAAAz+S,IACAyyH,EAAA/kI,KAAAsS,GACAu+S,GAUA7wT,EAAAp3E,GACAw3K,EAAAywN,EACAG,EAAA,CAAAhyN,MAAA,EAAAp2K,MAAAA,IAEAsxE,EAAAy0B,GACAyxE,EAAAywN,GACAzwN,GAAA,EACAzxE,EAdAA,CAAAA,IACAo2G,EAAA,IAAA+rL,EACAC,EAAAA,EAAA,CAAAtsT,MAAAkqB,KACAo2G,EAAA/kI,KAAA,CAAAyE,MAAAkqB,IACAkiS,IAUAI,CAAAtiS,GAAAqiS,EAAA,CAAAhyN,MAAA,KAqBA,GATA6xN,EAAA,CACA9kY,CAAAX,OAAAy6N,iBAAA,OAAA3wH,MACA5iB,KAvEA,KACA,IAAAyyH,EAAAqkD,UAAA,CACA,GAAAv/P,EAAA+7U,OAAA,CACA,IAAAtzP,EACA,MAAAggB,EAAA,GACA,MAAAyyG,EAAAqkD,WAAA,CAEA,GADA92K,EAAAyyH,EAAAlrG,QACAvnB,EAAA7N,MAAA,MAAA6N,EAAA7N,MACA6tB,EAAAtyB,KAAAsS,EAAA1pF,OAEA,MAAA,CAAAo2K,KAAA1sF,EAAA0sF,KAAAp2K,MAAA0pG,GAGA,MAAAhgB,EAAAyyH,EAAAlrG,QACA,GAAAvnB,EAAA7N,MAAA,MAAA6N,EAAA7N,MACA,OAAA6N,EAGA,OAAA8tF,EAAA,CAAApB,MAAA,GAEA,IAAA/D,SAAA,CAAAC,EAAAu5B,KACAs8L,EAAAz+S,IACAy+S,EAAA,KACAz+S,EAAA7N,MACAgwH,EAAAniH,EAAA7N,OAEA56E,EAAA+7U,SAAAtzP,EAAA0sF,KACA9D,EAAA,CAAA8D,KAAA1sF,EAAA0sF,KAAAp2K,MAAA,CAAA0pF,EAAA1pF,SAEAsyK,EAAA5oF,GAGAu+S,OAwCA/qK,OAbA,KACA/gB,EAAA,IAAA+rL,EACA52T,IACA,CAAA8kG,MAAA,IAWAkyN,MATAviS,IACAz0B,EAAAy0B,GACA,CAAAqwE,MAAA,IAQAh/F,KAAAA,EACA9F,IAAAA,IAGAmmG,EAAA,OAAAwwN,EAEA,MAAAM,EAAAN,EAkCA,OAhCAA,EAAA,CACA9kY,CAAAX,OAAAy6N,iBAAA,OAAA3wH,MACA5iB,KAAA,IACA6+S,EAAA7+S,OAEA4+S,MAAAviS,IACAwiS,EAAAD,MAAAviS,GACA0xE,IACAA,EAAA1xE,GACA0xE,EAAA,MAEA,CAAArB,MAAA,IAEA8mD,OAAA,KACAqrK,EAAArrK,SACAzlD,IACAA,IACAA,EAAA,MAEA,CAAArB,MAAA,IAEAh/F,KAAAA,EACA9F,IAAAy0B,IACAwiS,EAAAj3T,IAAAy0B,GACA0xE,IACAA,EAAA1xE,GACA0xE,EAAA,MAEAwwN,IAIAA,oDClIA,MAAAO,EAAA3oY,EAAA,gBAEAF,EAAAC,QAAA,MACAuD,YAAA+2U,GACA5tO,KAAA4tO,IAAAA,GAAA,GACA5tO,KAAA36B,KAAA,IAAA62T,EAAAl8R,KAAA4tO,KACA5tO,KAAA64D,KAAA74D,KAAA36B,KAGAxuE,KAAA8iG,GACA,IAAAqG,KAAA36B,KAAAyF,KAAA6uB,GAAA,CACA,MAAAxc,EAAA6iB,KAAA36B,KACA26B,KAAA36B,KAAA8X,EAAAC,KAAA,IAAA8+S,EAAA,EAAAl8R,KAAA36B,KAAAwqI,OAAA5qI,QACA+6B,KAAA36B,KAAAyF,KAAA6uB,IAIA9iG,QACA,MAAA8iG,EAAAqG,KAAA64D,KAAAl0D,QACA,QAAAjvG,IAAAikG,GAAAqG,KAAA64D,KAAAz7E,KAAA,CACA,MAAAA,EAAA4iB,KAAA64D,KAAAz7E,KAGA,OAFA4iB,KAAA64D,KAAAz7E,KAAA,KACA4iB,KAAA64D,KAAAz7E,EACA4iB,KAAA64D,KAAAl0D,QAEA,OAAAhL,EAGA9iG,UACA,OAAAmpG,KAAA36B,KAAA6uL,gEC7BA7gQ,EAAAC,QAAA,MACAuD,YAAA+2U,GACA,KAAAA,EAAA,IAAA,IAAAA,EAAA,EAAAA,GAAA,MAAA,IAAA90O,MAAA,qDACAkH,KAAA6vG,OAAA,IAAAhyG,MAAA+vO,GACA5tO,KAAAg/H,KAAA4uG,EAAA,EACA5tO,KAAAmuE,IAAA,EACAnuE,KAAAm8R,IAAA,EACAn8R,KAAA5iB,KAAA,KAGAvmF,KAAA61J,GACA,YAAAh3J,IAAAsqG,KAAA6vG,OAAA7vG,KAAAmuE,OACAnuE,KAAA6vG,OAAA7vG,KAAAmuE,KAAAzhB,EACA1sD,KAAAmuE,IAAAnuE,KAAAmuE,IAAA,EAAAnuE,KAAAg/H,MACA,GAGAnoO,QACA,MAAAklF,EAAAikB,KAAA6vG,OAAA7vG,KAAAm8R,KACA,QAAAzmY,IAAAqmF,EAGA,OAFAikB,KAAA6vG,OAAA7vG,KAAAm8R,UAAAzmY,EACAsqG,KAAAm8R,IAAAn8R,KAAAm8R,IAAA,EAAAn8R,KAAAg/H,KACAjjJ,EAGAllF,UACA,YAAAnB,IAAAsqG,KAAA6vG,OAAA7vG,KAAAm8R,qCC1BA,aAEA,MAAAr+D,QAAAA,EAAA34M,OAAAA,GAAA5xH,EAAA,uBACA84N,EAAA94N,EAAA,QAAAA,CAAA,yBAmIAF,EAAAC,QAlHA,cAAAwqU,EAIAjnU,YAAAulY,GACA72Q,QAEAvlB,KAAAo8R,OAAAA,EAAAh3T,QAGAvuE,aACA,UACAkvK,QAAA2gD,IAAA1mH,KAAAo8R,OAAAhyT,KAAA6vT,GAAAA,EAAAl6S,UACA,MAAA0Z,GACA,MAAA0rB,EAAA60O,qBAQAnjW,UAAA7B,EAAAtB,GACA,UACAqyK,QAAA2gD,IAAA1mH,KAAAo8R,OAAAhyT,KAAA6vT,GAAAA,EAAA5oK,IAAAr8N,EAAAtB,MACA,MAAA+lG,GACA,MAAA0rB,EAAA+0O,sBAQArjW,UAAA7B,EAAAL,GACA,IAAA,MAAAslY,KAAAj6R,KAAAo8R,OACA,IACA,MAAArwT,QAAAkuT,EAAAz4S,IAAAxsF,EAAAL,GACA,GAAAo3E,EAAA,OAAAA,EACA,MAAA0tB,GACA4yH,EAAA5yH,GAGA,MAAA0rB,EAAA4zO,gBAOAliW,UAAA7B,EAAAL,GACA,IAAA,MAAAunF,KAAA8jB,KAAAo8R,OACA,SAAAlgT,EAAA6C,IAAA/pF,EAAAL,GACA,OAAA,EAIA,OAAA,EAOAkC,aAAA7B,EAAAL,GACA,UACAoxK,QAAA2gD,IAAA1mH,KAAAo8R,OAAAhyT,KAAA6vT,GAAAA,EAAAx2S,OAAAzuF,EAAAL,MACA,MAAA8kG,GACA,MAAA0rB,EAAA80O,uBAIApjW,oBACAkvK,QAAA2gD,IAAA1mH,KAAAo8R,OAAAhyT,KAAA6vT,GAAAA,EAAAj6S,WAMAnpF,QACA,MAAAwlY,EAAAr8R,KAAAo8R,OAAAhyT,KAAA6vT,GAAAA,EAAAR,UAEA,MAAA,CACApoK,IAAA,CAAAr8N,EAAAtB,KACA2oY,EAAAjoY,SAAAklF,GAAAA,EAAA+3I,IAAAr8N,EAAAtB,MAEA+vF,OAAAzuF,IACAqnY,EAAAjoY,SAAAklF,GAAAA,EAAAmK,OAAAzuF,MAEAqkW,OAAA/lN,MAAA3+I,IACA,IAAA,MAAA8kY,KAAA4C,QACA5C,EAAApgC,OAAA1kW,KAUAkC,MAAAy3G,EAAA35G,GACA,OAAAqrG,KAAAo8R,OAAAp8R,KAAAo8R,OAAAn3T,OAAA,GAAAyjI,MAAAp6F,EAAA35G,GAOAkC,UAAAy3G,EAAA35G,GACA,OAAAqrG,KAAAo8R,OAAAp8R,KAAAo8R,OAAAn3T,OAAA,GAAA00T,UAAArrR,EAAA35G,8EClIA,aAEA,MAAAkoU,EAAAtpU,EAAA,uBAAAspU,IACAu8D,EAAA7lY,EAAA,kBAwEAF,EAAAC,QArDA,cAAA8lY,EAKAviY,YAAA6zE,EAAAigB,GACA46B,MAAA76C,EAAA,CACA67H,QAAAvxM,GACA21F,EAAAjgB,MAAA11E,GAEA6B,OAAA7B,GACA,GAAA,MAAA21F,EAAAyT,WACA,OAAAppG,EAGA,IAAA21F,EAAA2wS,aAAAtmY,GACA,MAAA,IAAA8jG,MAAA,qBAAAnO,EAAAyT,uBAAAppG,EAAAopG,cAGA,OAAA,IAAAy+N,EAAA7nU,EAAAopG,WAAAh5B,MAAAulB,EAAAyT,WAAAn5B,SAAA,MAIA+6B,KAAArV,OAAAA,EAOA9zF,MAAAy3G,EAAA35G,GACA,OAAA25G,EAAA3jB,QAAA,MAAAqV,KAAArV,OAAAyT,WACAmnB,MAAAmjF,MAAAl1M,OAAAiqG,OAAA,GAAA6Q,EAAA,CACA3jB,OAAAqV,KAAArV,OAAAjgB,MAAA,IAAAmyP,EAAAvuN,EAAA3jB,SAAAyT,cAGAmnB,MAAAmjF,MAAAp6F,EAAA35G,GAOAkC,UAAAy3G,EAAA35G,GACA,OAAA25G,EAAA3jB,QAAA,MAAAqV,KAAArV,OAAAyT,WACAmnB,MAAAo0Q,UAAAnmY,OAAAiqG,OAAA,GAAA6Q,EAAA,CACA3jB,OAAAqV,KAAArV,OAAAjgB,MAAA,IAAAmyP,EAAAvuN,EAAA3jB,SAAAyT,cAGAmnB,MAAAo0Q,UAAArrR,EAAA35G,6FCvEeoqJ,EAAAA,EAKelgD,KALf,iBAAAvrG,QAAA,IAAAD,EAAAA,EAAAC,QAAA,SAAaurG,EAAK7pG,EAAK4pG,EAAK13B,EAAGo1T,OAC7CtnY,EAAMA,EAAI8qF,MAAQ9qF,EAAI8qF,MAAM,KAAO9qF,EAC9BkyE,EAAI,EAAGA,EAAIlyE,EAAIiwE,OAAQiC,IAC3B23B,EAAMA,EAAMA,EAAI7pG,EAAIkyE,IAAMo1T,SAEpBz9R,IAAQy9R,EAAQ19R,EAAMC,GALfkgD,EAAAw9O,IAAA,SAAa19R,EAAK7pG,EAAK4pG,EAAK13B,EAAGo1T,OAC7CtnY,EAAMA,EAAI8qF,MAAQ9qF,EAAI8qF,MAAM,KAAO9qF,EAC9BkyE,EAAI,EAAGA,EAAIlyE,EAAIiwE,OAAQiC,IAC3B23B,EAAMA,EAAMA,EAAI7pG,EAAIkyE,IAAMo1T,SAEpBz9R,IAAQy9R,EAAQ19R,EAAMC,iCCL9B,aAEA,MAAA47N,EAAAlnU,EAAA,SACAslO,YAAAA,GAAAtlO,EAAA,sBAAA+6N,UACAwqK,EAAAvlY,EAAA,oBACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BAEA0rP,EAAA1rP,EAAA,YACA0wU,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,oBAAA,CACA10P,MAAA00P,EAAA,4BAgJA5wU,EAAAC,QA5IA,MAMAuD,YAAAskU,EAAA89D,EAAAv9J,GAEA17H,KAAAw8R,eAAA,GAGAx8R,KAAAy8R,uBAAAz8R,KAAAy8R,uBAAA9jS,KAAAqH,MAGAA,KAAA08R,UAAA,IAAA5D,EAAA39D,EAAA89D,EAAAv9J,EAAA++F,EAAA84D,UAAAvzR,KAAAy8R,wBASA5lY,IAAA7B,EAAAtB,GAEA,OAAAssG,KAAA08R,UAAArrK,IAAAr8N,EAAAtB,GAUAmD,UAAA7B,GACA,IAAA+2E,EACA0tB,EAEA,IAEA1tB,QAAAi0B,KAAA08R,UAAAl7S,IAAAxsF,GACA,MAAAjB,GACA0lG,EAAA1lG,EAIA,MAAA2yE,EAAA1xE,EAAAowE,MAAA,EAAAq1P,EAAA+5D,iBAEA,GAAAn8J,EAAA3xJ,KAAA+zP,EAAArkM,UAAA,CACA,MAAAumQ,EAAA9jK,EAAA7jO,GACAivF,EAAA40I,EAAA7jO,EAAAowE,MAAAq1P,EAAA+5D,kBAEAx0R,KAAAw8R,eAAAG,GAAA14S,EAEAooI,EAAA,8BAAAswK,SAAA14S,KAIA,GAAAwV,EACA,MAAAA,EAGA,OAAA1tB,EAQAl1E,uBAAA7B,GACAA,aAAAyjO,aACAzjO,EAAAqjO,EAAArjO,EAAA,cAGA,MAAA4nY,EAAA58R,KAAAw8R,eAAAxnY,GAEA,IAAA4nY,EACA,MAAA39I,EAAA,IAAAnmJ,MAAA,OAAA9jG,2CAAA,mBAGA,IAAAb,EACA,IACAA,EAAAsmU,EAAAi2D,UAAAt4J,EAAAwkK,EAAA,cACA,MAAAnjS,GAEA,MADA4yH,EAAA98I,MAAAkqB,GACAA,EAGA,OAAAtlG,EAAAy8X,WAAAK,aAMAp6X,mBAGA,OAFArD,OAAA4pG,OAAA4C,KAAAw8R,gBAAAzuT,OAAAsP,SAEAjT,KAAAknD,GAAA,GAAAmpM,EAAArkM,YAAA9E,MAQAz6H,aAAAhE,GACA,GAAA,iBAAAA,EACA,MAAAosP,EAAA,IAAAnmJ,MAAA,6BAAA,iCAIAjmG,EAAAspF,WAAAs+O,EAAArkM,aACAvjI,EAAAA,EAAAipG,UAAA2+N,EAAA+5D,kBAGA,MAAAmI,EAAAnpY,OAAAW,KAAA6rG,KAAAw8R,gBAAAr+S,MAAAnpF,GAAAgrG,KAAAw8R,eAAAxnY,KAAAnC,IAGA,IAAA8pY,EACA,MAAA,CACAE,UAAA,GAKA,MAAAC,EAAA1kK,EAAAukK,GAOA,OALA38R,KAAA08R,UAAAK,YAAAD,UAEA98R,KAAAw8R,eAAAG,GACAtwK,EAAA,uBAAAswK,MAAA9pY,KAEA,CACAgqY,UAAA,0MCtJA,aAEA,MAAAhgE,IAAAA,EAAAiB,QAAAA,GAAAvqU,EAAA,wBACAypY,aAAAA,EAAAC,WAAAA,EAAAC,WAAAA,GAAA3pY,EAAA,WACA4kO,EAAA5kO,EAAA,sBAEA0rP,EAAA1rP,EAAA,YACA0wU,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,8BAAA,CACA10P,MAAA00P,EAAA,sCAoTA5wU,EAAAC,QAxSA,cAAAwqU,EAWAjnU,YAAAskU,EAAAo0D,EAAA7zJ,EAAA63J,EAAA4J,GAGA,GAFA53Q,SAEAguQ,EACA,MAAAt0I,EAAA,IAAAl6I,UAAA,qBAAA,0BAGA,GAAA,mBAAAwuR,EAAAt3J,SACA,MAAAgjB,EAAA,IAAAl6I,UAAA,6BAAA,0BAGA,GAAA,mBAAAwuR,EAAAx7L,OACA,MAAAknD,EAAA,IAAAl6I,UAAA,2BAAA,0BAGA,GAAAo4R,GAAA,mBAAAA,EACA,MAAAl+I,EAAA,IAAAl6I,UAAA,sCAAA,0BAGA/E,KAAAo9R,QAAAjiE,EACAn7N,KAAAowR,WAAAb,EACAvvR,KAAAy3R,QAAA/7J,EACA17H,KAAAq9R,WAAA9J,EACAvzR,KAAAs9R,yBAAAH,EAGAn9R,KAAAu9R,WAAAv9R,KAAAu9R,WAAA5kS,KAAAqH,MAUAnpG,UAAA7B,EAAA2kG,GACA,KAAA3kG,aAAAyjO,YAAA,CACA,MAAA83J,EAAA,6CAGA,MADAlkK,EAAA98I,MAAAghT,GACAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,6BAGA,KAAA52R,aAAA8+H,YAAA,CACA,MAAA83J,EAAA,qCAGA,MADAlkK,EAAA98I,MAAAghT,GACAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,8BAGA,MAAAoM,EAAAM,EAAAjoY,GAEAq3N,EAAA,2BAAAswK,WAGA38R,KAAAo9R,QAAA1N,QAAAiN,EAAAhjS,GASA9iG,UAAA7B,GACA,KAAAA,aAAAyjO,YAAA,CACA,MAAA83J,EAAA,6CAGA,MADAlkK,EAAA98I,MAAAghT,GACAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,6BAGA,MAAAoM,EAAAM,EAAAjoY,GACAwoY,QAAAx9R,KAAAo9R,QAAAK,YAGA,GAAAD,GAAA3/R,MAAA/gB,QAAA0gT,IAAAA,EAAAhyT,QAAAmxT,IAAA,EACA,OAAA38R,KAAA09R,UAAA1oY,GAIA,IACAgrG,KAAAo9R,QAAApvT,GAAA2uT,EAAA38R,KAAAu9R,kBACAv9R,KAAAo9R,QAAAO,UAAAhB,GACA,MAAAljS,GACA,MAAA82R,EAAA,0BAAAoM,IAGA,MADAtwK,EAAA98I,MAAAghT,GACAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,yBAIA,OAFAlkK,EAAA,6BAAAswK,KAEA38R,KAAA09R,UAAA1oY,GASA6B,YAAA7B,GACA,MAAA2nY,EAAAM,EAAAjoY,GAGA,OADAgrG,KAAAo9R,QAAA5nK,eAAAmnK,EAAA38R,KAAAu9R,YACAv9R,KAAAo9R,QAAAL,YAAAJ,GASA9lY,gBAAA7B,GAEA,MAAA47X,EAAA,IAAA/zD,EAAA,IAAAmgE,EAAAhoY,IAAA,GACA,IAAAm8X,EAEA,IACAA,QAAAnxR,KAAAowR,WAAA5uS,IAAAovS,GACA,MAAAn3R,GACA,GAAA,kBAAAA,EAAApkG,KAAA,CACA,MAAAk7X,EAAA,gDAAAK,EAAAxyR,aAGA,MADAiuH,EAAA98I,MAAAghT,GACAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,uCAEA,MAAAA,EAAA,4CAAAK,EAAAxyR,aAGA,MADAiuH,EAAA98I,MAAAghT,GACAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,iBAGA,KAAAY,aAAA14J,YAAA,CACA,MAAA83J,EAAA,mDAGA,MADAlkK,EAAA98I,MAAAghT,GACAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,+BAGA,OAAAY,EAQAt6X,iBAAA44E,GACA,MAAAi9E,KAAAA,EAAAjD,KAAAA,EAAAm0O,SAAAA,GAAAnuT,EACA,IAAAz6E,EACA,IACAA,EAAAkoY,EAAAU,EAAA,IACA,MAAAnkS,GAEA,YADA4yH,EAAA98I,MAAAkqB,GAOA,GAHA4yH,EAAA,8BAAAuxK,EAAA,MAGAn0O,IAAAzpD,KAAAy3R,QAAA5+J,cAAA,CAKA,GAAA74H,KAAAs9R,yBAAA,CACA,IAAAvxT,EAEA,IACAA,QAAAi0B,KAAAs9R,yBAAAtoY,GACA,MAAAykG,GAEA,YADA4yH,EAAA98I,MAAA,8CAIAv6E,EAAA+2E,EAGA,UACAi0B,KAAA69R,6BAAA7oY,EAAA03J,GACA,MAAAjzD,GACA4yH,EAAA98I,MAAAkqB,SApBA4yH,EAAA,iDA8BAx1N,mCAAA7B,EAAA03J,GACA,IAAAoxO,GAAA,EAEA,IACAA,QAAA99R,KAAA+9R,UAAA/oY,EAAA03J,GACA,MAAAjzD,GACA,GAAA,yBAAAA,EAAApkG,KACA,MAAAokG,EAIAqkS,SACA99R,KAAAg+R,aAAAhpY,EAAA03J,GAUA71J,sBAAAnD,EAAAgoO,GACA,OAAA17H,KAAAq9R,WAAAphK,SAAAvoO,EAAAgoO,GASA7kO,oBAAA7B,EAAAipY,GAIA,OAAA,UAHAj+R,KAAAq9R,WAAAtlM,OAAA/iM,EAAAipY,GAYApnY,gBAAA7B,EAAA2kG,GACA,UACAqG,KAAA44R,gBAAAj/R,EAAA3kG,GACA,MAAAykG,GAEA,MAAA82R,EAAA,8CAGA,MADAlkK,EAAA98I,MAAAghT,GACAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,wBAIA,MAAA2N,EAAA,IAAArhE,EAAA7nU,GACA,IAAAmpY,EAEA,IACAA,QAAAn+R,KAAA09R,UAAAQ,EAAAjN,cACA,MAAAx3R,GAEA,OAAA,EAIA,OAAA0+H,EAAAgmK,EAAAxkS,IAKAqG,KAAAo+R,cAAAppY,EAAA,CAAAmpY,EAAAxkS,IASA9iG,mBAAA7B,EAAA03J,GAEA,MAAAkkO,EAAA,IAAA/zD,EAAA,IAAAmgE,EAAAhoY,IAAA,SAEAgrG,KAAAowR,WAAA/+J,IAAAu/J,EAAAlkO,GACA2/D,EAAA,cAAA4wK,EAAAjoY,+KCzTA,aAEA,MAAAiqP,EAAA1rP,EAAA,YACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BAMA6iI,EAAA,WAyCA/iI,EAAAC,QAAA,CACA0pY,aArCA,SAAAzsK,GACA,OAAA8H,EAAA9H,EAAA,WAqCA0sK,WA7BA,SAAAjoY,GASA,OANA,iBAAAA,GAAAA,aAAAqxE,UACArxE,EAAAojO,EAAApjO,EAAAopG,aAKA,WAFAi6H,EAAArjO,EAAA,gBAuBAkoY,WAbA,SAAAmB,GACA,GAAAA,EAAAviS,UAAA,EAAAs6B,EAAAnxD,UAAAmxD,EACA,MAAA6oH,EAAA,IAAAnmJ,MAAA,uCAAA,0CAGA,MAAA9jG,EAAAqpY,EAAAviS,UAAAs6B,EAAAnxD,QAEA,OAAAmzJ,EAAApjO,EAAA,iIChDA,aAEA,MAAA6nU,IAAAA,GAAAtpU,EAAA,wBACA+qY,OAAAA,GAAA/qY,EAAA,kBACAypY,aAAAA,GAAAzpY,EAAA,WAEA0rP,EAAA1rP,EAAA,YACA0wU,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,+BAAA,CACA10P,MAAA00P,EAAA,uCAwFA5wU,EAAAC,QAnFA,MAIAuD,YAAAmjU,GACAh6N,KAAAu+R,MAAAvkE,EAEAh6N,KAAAo8R,OAAA,GASAvlY,UAAA7B,EAAAtB,GACA,KAAAsB,aAAAyjO,YACA,MAAAwmB,EAAA,IAAAnmJ,MAAA,8CAAA,mBAGA,KAAAplG,aAAA+kO,YACA,MAAAwmB,EAAA,IAAAnmJ,MAAA,gDAAA,qBAGA,IAAA83R,EAEA,IACAA,EAAA5wR,KAAAw+R,YAAAxpY,GACA,MAAAykG,GAEA,MADA4yH,EAAA98I,MAAAkqB,GACAwlJ,EAAA,IAAAnmJ,MAAA,4CAAA,8BAIA,MAAAo2G,EAAA,IAAAovL,EAAAtpY,EAAAtB,GAEA,OAAAssG,KAAAu+R,MAAAhP,UAAAl+J,IAAAu/J,EAAA1hL,EAAA0vJ,aAQA/nW,UAAA7B,GACA,KAAAA,aAAAyjO,YACA,MAAAwmB,EAAA,IAAAnmJ,MAAA,8CAAA,mBAGA,IAAA83R,EAEA,IACAA,EAAA5wR,KAAAw+R,YAAAxpY,GACA,MAAAykG,GAEA,MADA4yH,EAAA98I,MAAAkqB,GACAwlJ,EAAA,IAAAnmJ,MAAA,4CAAA,8BAGA,MAAA/sB,QAAAi0B,KAAAu+R,MAAAhP,UAAA/tS,IAAAovS,GAGA,IAAA1hL,EACA,IACAA,EAAAovL,EAAAjgC,YAAAtyR,GACA,MAAA0tB,GAEA,MADA4yH,EAAA98I,MAAAkqB,GACAA,EAGA,OAAAy1G,EAAAx7M,MAQAmD,YAAA7B,GACA,OAAA,IAAA6nU,EAAA,IAAAmgE,EAAAhoY,IAAA,2IC7FA,aAEA3B,EAAAC,QAAA,CACAgrY,OAAA/qY,EAAA,YACAggY,UAAAhgY,EAAA,eACAkrY,UAAAlrY,EAAA,4GCLA,aAEA,MACA+qY,OAAAI,GACAnrY,EAAA,YACAgtR,EAAAhtR,EAAA,YAMA,MAAA+qY,EAMAznY,YAAA7B,EAAAtB,EAAAirY,GACA,KAAA3pY,aAAAyjO,YACA,MAAA,IAAA3/H,MAAA,4BAGA,KAAAplG,aAAA+kO,YACA,MAAA,IAAA3/H,MAAA,8BAGAkH,KAAAhrG,IAAAA,EACAgrG,KAAAtsG,MAAAA,EACAssG,KAAA2+R,aAAAA,EAGA9nY,YACA,OAAA6nY,EAAAp7R,OAAAtD,KAAA4+R,oBAAAnlK,SAMA5iO,mBACA,MAAA,CACA7B,IAAAgrG,KAAAhrG,IACAtB,MAAAssG,KAAAtsG,MACAirY,aAAA3+R,KAAA2+R,cAAAp+G,EAAA+2G,UAAAt3R,KAAA2+R,eASA9nY,mBAAAizF,GACA,MAAAnQ,EAAA+kT,EAAAt6R,OAAAta,GACA,OAAAw0S,EAAAO,iBAAAH,EAAAt8I,SAAAzoK,EAAA,CACA84H,UAAA,EACA2jC,QAAA,EACA6Q,MAAA9gL,OACA24R,SAAA,KASAjoW,wBAAAgoG,GACA,IAAAigS,EACAjgS,EAAA8/R,eACAG,EAAAv+G,EAAAuxG,aAAAjzR,EAAA8/R,eAOA,OAJA,IAAAL,EACAz/R,EAAA7pG,IAAA6pG,EAAAnrG,MAAAorY,IAOAzrY,EAAAC,QAAAgrY,qEC/EA,aAEA,IAAAh9I,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,mBAAAN,EAAAM,MAAA,iBAAA,IAEA1mD,EAAAojM,OAAA,WAmBA,SAAAA,EAAAp3T,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAsKA,OA7JAm3T,EAAA3gS,UAAA3oG,IAAA2sP,EAAAG,UAAA,IAQAw8I,EAAA3gS,UAAAjqG,MAAAiuP,EAAAG,UAAA,IAQAw8I,EAAA3gS,UAAAghS,aAAA,GAWAL,EAAAh7R,OAAA,SAAApkB,EAAAulI,GASA,OARAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAlqF,KAAAxB,OAAAgnG,eAAAoD,KAAA1e,EAAA,QACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAlqF,KACA,MAAAkqF,EAAAxrF,OAAAF,OAAAgnG,eAAAoD,KAAA1e,EAAA,UACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAxrF,OACA,MAAAwrF,EAAAy/S,cAAAnrY,OAAAgnG,eAAAoD,KAAA1e,EAAA,iBACAulI,EAAAs9B,OAAA,IAAApmJ,OAAAzc,EAAAy/S,cACAl6K,GAcA65K,EAAAl6R,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAojM,OACAtwR,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAlqF,IAAAg5G,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAxrF,MAAAs6G,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAy/S,aAAA3wR,EAAArS,SACA,MACA,QACAqS,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAo/S,EAAAn8I,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAojM,OACA,OAAA1gQ,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAojM,OAgBA,OAfA,MAAA1gQ,EAAA5oI,MACA,iBAAA4oI,EAAA5oI,IACA2sP,EAAA99I,OAAAO,OAAAw5B,EAAA5oI,IAAAkqF,EAAAlqF,IAAA2sP,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA5oI,MAAA,GACA4oI,EAAA5oI,IAAAiwE,SACAia,EAAAlqF,IAAA4oI,EAAA5oI,MAEA,MAAA4oI,EAAAlqI,QACA,iBAAAkqI,EAAAlqI,MACAiuP,EAAA99I,OAAAO,OAAAw5B,EAAAlqI,MAAAwrF,EAAAxrF,MAAAiuP,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAlqI,QAAA,GACAkqI,EAAAlqI,MAAAuxE,SACAia,EAAAxrF,MAAAkqI,EAAAlqI,QAEA,MAAAkqI,EAAA+gQ,eACAz/S,EAAAy/S,aAAAt4T,OAAAu3D,EAAA+gQ,eAEAz/S,GAYAo/S,EAAAl8I,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GA2BA,OA1BAsyC,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA5oI,IAAA,IAEA4oI,EAAA5oI,IAAA,GACAk7K,EAAAyoD,QAAA96H,QACA+/B,EAAA5oI,IAAA2sP,EAAAG,UAAAlkH,EAAA5oI,OAEAk7K,EAAAyoD,QAAAtyJ,OACAu3D,EAAAlqI,MAAA,IAEAkqI,EAAAlqI,MAAA,GACAw8K,EAAAyoD,QAAA96H,QACA+/B,EAAAlqI,MAAAiuP,EAAAG,UAAAlkH,EAAAlqI,SAEAkqI,EAAA+gQ,aAAA,IAEA,MAAAz/S,EAAAlqF,KAAAkqF,EAAAsb,eAAA,SACAojC,EAAA5oI,IAAAk7K,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAlqF,IAAA,EAAAkqF,EAAAlqF,IAAAiwE,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAlqF,KAAAkqF,EAAAlqF,KAEA,MAAAkqF,EAAAxrF,OAAAwrF,EAAAsb,eAAA,WACAojC,EAAAlqI,MAAAw8K,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAxrF,MAAA,EAAAwrF,EAAAxrF,MAAAuxE,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAxrF,OAAAwrF,EAAAxrF,OAEA,MAAAwrF,EAAAy/S,cAAAz/S,EAAAsb,eAAA,kBACAojC,EAAA+gQ,aAAAz/S,EAAAy/S,cAEA/gQ,GAUA0gQ,EAAA3gS,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAi8I,EA7LA,GAgMAjrY,EAAAC,QAAA4nM,4DC3MA,aAQA7nM,EAAAC,QAAAgkY,UAAAl8K,GAUA,GATAA,EAAAi2C,oBACAhrL,OAAA+0I,EAAAk2C,cAAA,GAAA+2H,SAAA,EAAA,QACAhiT,OAAA+0I,EAAAm2C,cAAA82H,SAAA,EAAA,QACAhiT,OAAA+0I,EAAAo2C,eAAA62H,SAAA,EAAA,QACAhiT,OAAA+0I,EAAAq2C,iBAAA42H,SAAA,EAAA,QACAhiT,OAAA+0I,EAAAs2C,iBAAA22H,SAAA,EAAA,QAEA,IADAjtK,EAAAg7K,qBACA,OAWA/iY,EAAAC,QAAAw+X,aAAA12K,IACA,MAAAm8K,EAAA,IAAAvgR,OAEA,mEAMA93B,EAAA7Y,OAAA+0I,GAAA5jI,OAAA8F,MAAAi6S,GAEA,IAAAr4S,EACA,MAAA,IAAA4Z,MAAA,kBAGA,MAAAq3J,EAAA/pL,SAAA8Y,EAAA,GAAA,IACA68Q,EAAA31R,SAAA8Y,EAAA,GAAA,IAAA,EACAgxK,EAAA9pL,SAAA8Y,EAAA,GAAA,IACA21Q,EAAAzuR,SAAA8Y,EAAA,GAAA,IACA08Q,EAAAx1R,SAAA8Y,EAAA,GAAA,IACAw1Q,EAAAtuR,SAAA8Y,EAAA,GAAA,IACAy8Q,EAAAv1R,SAAA8Y,EAAA,GAAA9Z,MAAA,GAAA,GAAA,IAEA,OAAA,IAAA24B,KAAAA,KAAAg3P,IAAA5kG,EAAA4rG,EAAA7rG,EAAA2kG,EAAA+G,EAAAlH,EAAAiH,mCClDA,aAEA,MAAA18G,EAAA1rP,EAAA,YACA8kO,EAAA9kO,EAAA,yBAmCAF,EAAAC,QAAA,CACAyrY,aAtBA,CAAAC,EAAA9vL,KACA,MAAAl6M,EAAAk6M,EAAAl6M,IAEAixG,EADAoyH,EAAArjO,GACA8qF,MAAA,KAEA,GAAAmmB,EAAAhhC,OAAA,EAEA,OAGA,MAAAsuT,EAAAyL,EAAA/4R,EAAA,GAAA7H,YAEA,IAAAm1R,EAAA,CAGA,MAAAt0I,EAAA,IAAAnmJ,MAFA,0BAEA,+BAGA,OAAAy6R,EAAAp7H,KAAAnjQ,EAAAk6M,EAAAx7M,QAKAsrY,WAAAzrY,EAAA,wHCxCA,aAEAF,EAAAC,QAAA,CACAywR,GAAAxwR,EAAA,qECHA,aAEA,MAAA86N,EAAA96N,EAAA,sBACA0rP,EAAA1rP,EAAA,YACA8kO,EAAA9kO,EAAA,yBACA4kO,EAAA5kO,EAAA,sBAmCAF,EAAAC,QAAA,CACA6kQ,KAzBA7kH,MAAAt+I,EAAA09Q,KACA,KAAA19Q,aAAAyjO,YACA,MAAAwmB,EAAA,IAAAnmJ,MAAA,8BAAA,qCAGA,GAAA9jG,EAAAopO,WAAA,EACA,MAAA6gB,EAAA,IAAAnmJ,MAAA,6BAAA,oCAKA,GAAA,SAFAu/H,EAAArjO,EAAAmnO,SAAA,EAAA,IAGA,MAAA8iB,EAAA,IAAAnmJ,MAAA,kCAAA,qCAGA,MAAAmmS,EAAAjqY,EAAAowE,MAAA,GAEA85T,QAAA7wK,EAAAqkD,EAAA,YAEA,IAAAv6C,EAAA8mK,EAAAC,GACA,MAAAjgJ,EAAA,IAAAnmJ,MAAA,2CAAA,qCAMAwvJ,MAAA,2IC1CA,aAEA,MAAArJ,EAAA1rP,EAAA,YACA8kO,EAAA9kO,EAAA,yBAoCAF,EAAAC,QAAA,CACA6rY,WA5BA,CAAAC,EAAA/qY,EAAA4pY,KACA,GAAA,IAAAA,EAAAh5T,OAAA,CAGA,MAAAg6K,EAAA,IAAAnmJ,MAFA,oBAEA,2BAGA,MACAmN,EADAoyH,EAAAhkO,GACAyrF,MAAA,KAEA,GAAAmmB,EAAAhhC,OAAA,EAAA,CAGA,MAAAg6K,EAAA,IAAAnmJ,MAFA,gDAEA,2CAGA,MAAAyrE,EAAA66N,EAAAn5R,EAAA,GAAA7H,YAEA,IAAAmmE,EAAA,CACA,MAAAgsN,EAAA,4BAAAtqR,EAAA,KAEA,MAAAg5I,EAAA,IAAAnmJ,MAAAy3R,GAAA,+BAGA,OAAAhsN,EAAAlwK,EAAA4pY,IAKAmB,UAAA7rY,EAAA,sHCzCA,aAEAF,EAAAC,QAAA,CACAywR,GAAAxwR,EAAA,qECHA,aAcAF,EAAAC,QAJA,CAAAe,EAAA4pY,IACA,gCCXA,aAEA,MAAAxjE,EAAAlnU,EAAA,QACA8kO,EAAA9kO,EAAA,yBAEAF,EAAAC,QAAA,CAIA0pY,aAAAzsK,GAAA8H,EAAA9H,EAAA,eACAgjK,UAAA,CAKAp7H,KAAA,CAAAnjQ,EAAAk6M,IAAAurH,EAAA84D,UAAAt3J,SAAA/sB,EAAAl6M,IAMAuvK,SAAA,CAAAmoG,EAAAuxH,IAAAxjE,EAAA84D,UAAAx7L,OAAAkmM,EAAA,GAAAA,EAAA,+ECrBA,aAEA,MAAAoB,EAAA9rY,EAAA,aACAwkU,EAAAxkU,EAAA,aACA+rY,EAAA/rY,EAAA,YAoBAF,EAAAC,QAlBA,MAWAuD,aAAAqiP,IAAAA,EAAAuhF,KAAAA,EAAAJ,KAAAA,EAAA3+F,OAAAA,EAAA8+F,SAAAA,EAAAP,SAAAA,EAAAtlU,QAAAA,IACAqrG,KAAA0vR,QAAA2P,EAAA,CAAA5kE,KAAAA,EAAAJ,KAAAA,EAAA3+F,OAAAA,EAAA8+F,SAAAA,EAAAP,SAAAA,IACAj6N,KAAAgmE,QAAA+xJ,EAAA,CAAA7+E,IAAAA,EAAAuhF,KAAAA,EAAA/+F,OAAAA,EAAA8+F,SAAAA,EAAA7lU,QAAAA,IACAqrG,KAAAm7N,OAAA,IAAAmkE,EAAA,CAAA7kE,KAAAA,EAAA9lU,QAAAA,8FCpBA,aAEA,MAAAsvU,EAAA1wU,EAAA,UACAJ,QAAAknW,GAAA9mW,EAAA,kBACAy6N,EAAAz6N,EAAA,iBACA0rP,EAAA1rP,EAAA,YACA6kO,EAAA7kO,EAAA,2BACA8kO,EAAA9kO,EAAA,yBAEA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,qBAAA,CACA10P,MAAA00P,EAAA,8BAGAlH,cAAAA,EAAAK,cAAAA,GAAA7pU,EAAA,eACAupU,EAAAvpU,EAAA,4CACAgqU,YAAAA,GAAAhqU,EAAA,WAYAF,EAAAC,QAAA,EAAAmnU,KAAAA,EAAAJ,KAAAA,EAAA3+F,OAAAA,EAAA8+F,SAAAA,EAAAP,SAAAA,MAIA,MAAAslE,EAAAjsP,MAAAA,IACA,GAAA,SAAA6lB,EACA,OAAAuiE,EAAAnD,QAGA,IAEA,MAAA8mC,QAAA46D,EAAAjlD,UAAA77G,EAAA,QAEA,aADA60D,EAAA75N,KAAAysP,OAAAye,EAAA,QAEA,MAAA5lK,GAEA,MADA4yH,EAAA98I,MAAAkqB,GACAwlJ,EAAAxlJ,EAAA,wBAuDA,OAAAqjO,GAhDAxpL,eAAA5/I,EAAAiB,EAAA,IACA,MAAAqxK,KAAA,IAAArxK,EAAAqxK,SACAypN,EAAA96X,EAAA86X,UAAA,MACAz6X,EAAAL,EAAAK,KAAA,OAEA,IAAAwlU,IACA,MAAAv7E,EAAA,IAAAnmJ,MAAAikO,GAAA,iBAKA,IACArpU,EAAA0pU,EAAA1pU,GACA,MAAA+lG,GAEA,MADA4yH,EAAA98I,MAAAkqB,GACAA,EAGA,IAAA+lS,EAAA,EACA,IACAA,EAAAnlC,EAAAo1B,IAAA,EAGA+P,EAAAvgS,WAAAugS,EAAAplI,QAAA,IACA,MAAA3gK,GAEA,MADA4yH,EAAA98I,MAAAkqB,GACAA,EAIA,MAAAqiK,QAAA/1F,QAAA2gD,IAAA,CAEA64K,EAAAvqY,GAEAgxK,EAAAu3J,EAAA,CAAA9C,KAAAA,EAAAJ,KAAAA,GAAA3mU,GAAAqyK,QAAAC,YAGA2yD,EAAAP,EAAA1kO,GAGAk3E,QAAA6vP,EAAAi1D,QAAA5zH,EAAA,GAAAnjC,EAAA6mK,GAEA,MAAA,CACA3sY,KAAA+3E,EAAA/3E,KACAa,MAAA2kO,EAAAztJ,EAAAl3E,uRC9FA,aAEA,MAAAu6N,EAAA16N,EAAA,WACA0oW,EAAA1oW,EAAA,uCACA0lW,EAAA1lW,EAAA,YAWAD,EAAAiqU,YAAAjqL,OAAAmnL,KAAAA,EAAAJ,KAAAA,GAAAxnU,KAEA,GAAAo7N,EAAAyuF,SAAA7pT,GACA,OAAA4nU,EAAAz0J,QAAAnzK,GAGA,MAAA86N,IACAA,EAAAh7N,KACAA,GACAspW,EAAAppW,SAGAomW,EAAA5+B,EAAAr0J,QAAA2nD,EAAAh7N,GAAA,sHC3BA,aAEA,MAAAsxU,EAAA1wU,EAAA,SACA0rP,EAAA1rP,EAAA,aACAg3L,aAAAA,GAAAh3L,EAAA,eACAg7N,EAAAh7N,EAAA,QAEAksY,EAAAlsY,EAAA,kBACA8kO,EAAA9kO,EAAA,yBAEA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,qBAAA,CACA10P,MAAA00P,EAAA,8BAGAlH,cAAAA,GAAAxpU,EAAA,eACAupU,EAAAvpU,EAAA,2CAQAmsY,EAAA,CAAA90T,EAAAkyM,IACAA,EAAA73M,OAAA,EACA2F,EAAA,IAAAkyM,EAAAxyM,KAAA,KACAM,EAYAv3E,EAAAC,QAAA,EAAA4lP,IAAAA,EAAAuhF,KAAAA,EAAA/+F,OAAAA,EAAA8+F,SAAAA,EAAA7lU,SAAAw6X,QAAAA,MAiDAryD,GA7CAxpL,gBAAAzgJ,EAAA8B,EAAA,IAOA,GANAA,EAAA41L,EAAA,CACA85K,SAAA,EACAT,WAAA,GACAjvW,GAGAw6X,GAAAx6X,GAAAA,EAAA0vW,QACA,MAAAplH,EAAA,IAAAnmJ,MAAA,2CAAA,2BAIAjmG,IACAA,EAAA6oO,EAAA7C,eAGAhmO,EAAAspF,WAAA,YACAtpF,EAAA,SAAAA,KAGA,MAAAujI,EAAA/iB,KAAAypK,GAAAjqR,EAAAuyE,MAAA,GAAA0a,MAAA,KACA,IACA,IAAAyuI,EAAAl7G,GACA,MAAA5Z,GAEA,GAAAgmS,EAAApsR,GAEA,kBADAqsR,QAAAxmJ,EAAA7lI,EAAA1+G,GAAAmoR,IAKA,MADAzwD,EAAA98I,MAAAkqB,GACAwlJ,EAAA,IAAAnmJ,MAAA,qBAAA,yBAKA,IAAA0hO,MAAA20D,EACA,MAAAlwI,EAAA,IAAAnmJ,MAAAikO,GAAA,iBAIA,MAAArpU,QAAA+mU,EAAAz0J,QAAA,IAAA5vC,KAAA/iB,IAAA1+G,SACA+qY,EAAAhsY,aAAA+kO,WAAAJ,EAAA3kO,GAAAA,EAAAopR,kNCpFA,aA6BA,IAAA6iH,EAAA,mGAQAtsY,EAAAC,QAAA,SAAAssY,EAAAC,GAGA,GAFA,MAAAA,IAAAA,GAAA,GAEAD,EAAA36T,OAAA,EAAA,OAAA,EACA,GAAA26T,EAAA36T,OAAA,IAAA,OAAA,EAEA,IAAAmuQ,EAAAwsD,EAAAA,EAAA36T,OAAA,GACA,GAAA46T,GACA,GAAA,MAAAzsD,EAAA,OAAA,OAEA,GAAA,MAAAA,EAAA,OAAA,EAGA,OAAAusD,EAAAl6T,KAAAm6T,kCClDA,aAEA,MAAAE,EAAAvsY,EAAA,YACAwsY,EAAAxsY,EAAA,WACAysY,EAAAzsY,EAAA,UAcAF,EAAAC,QAZA,MAMAuD,aAAA4jU,KAAAA,EAAA9lU,QAAAA,IACAqrG,KAAAgoQ,OAAA83B,EAAA,CAAArlE,KAAAA,EAAA9lU,QAAAA,IACAqrG,KAAA8oB,MAAAi3Q,EAAA,CAAAtlE,KAAAA,EAAA9lU,QAAAA,IACAqrG,KAAAigS,KAAAD,EAAA,CAAAvlE,KAAAA,EAAA9lU,QAAAA,uFCfA,aAEA,MAAAurY,iBAAAA,GAAA3sY,EAAA,WACAupU,EAAAvpU,EAAA,2CAOAF,EAAAC,QAAA,EAAAmnU,KAAAA,EAAA9lU,QAAAA,MACA,MAAAwrY,EAAAxrY,EAAAomU,aAUA,OAAA+B,GALAxpL,eAAAzgJ,EAAA8B,EAAA,IAEA,OADAurY,EAAAzlE,EAAA0lE,GACAn4B,OAAAn1W,EAAA8B,wGClBA,aAEA,MAAAyrY,EAAA7sY,EAAA,0CACA0rP,EAAA1rP,EAAA,YAaAD,EAAA4sY,iBAAA,CAAAzlE,EAAA9lU,KACA,IAAA8lU,IAAA9lU,IAAAA,EAAA0rY,WACA,MAAAphJ,EAAA,IAAAnmJ,MAAA,wCAAA,+BAIA,GAAA2hO,EAAA40D,mBAAA+Q,EACA,OAAA3lE,EAAA40D,QAIA,MAAAl0D,GAAAV,EAAA40D,QAAA+M,QAAA,IAAAj+S,MAAAjC,GAAAA,aAAAkkT,IAEA,IAAAjlE,EACA,MAAAl8E,EAAA,IAAAnmJ,MAAA,mCAAA,kCAGA,OAAAqiO,oGCjCA,aAEA,MAAA+kE,iBAAAA,GAAA3sY,EAAA,WACAupU,EAAAvpU,EAAA,2CAOAF,EAAAC,QAAA,EAAAmnU,KAAAA,EAAA9lU,QAAAA,MACA,MAAAwrY,EAAAxrY,EAAAomU,aAaA,OAAA+B,GARAxpL,eAAAquB,EAAA,IACA,IACA,MAAA,CAAAg7J,QAAAt/O,QAAA6iT,EAAAzlE,EAAA0lE,KACA,MAAA1mS,GACA,MAAA,CAAAkjO,SAAA,yGCpBA,aAEA,MAAAujE,iBAAAA,GAAA3sY,EAAA,WACAupU,EAAAvpU,EAAA,2CAOAF,EAAAC,QAAA,EAAAmnU,KAAAA,EAAA9lU,QAAAA,MACA,MAAAwrY,EAAAxrY,EAAAomU,aAUA,OAAA+B,GALAxpL,eAAA3+I,EAAA,IAEA,OADAurY,EAAAzlE,EAAA0lE,GACAG,iBAAA3rY,wGClBA,aAEA,MAAA45N,EAAAh7N,EAAA,SACAgkU,QAAAA,GAAAhkU,EAAA,gBACA4xH,OAAAA,GAAA5xH,EAAA,uBACA28X,EAAA/qQ,EAAA4zO,gBAAA1jW,KACAynU,EAAAvpU,EAAA,2CACAgtY,EAAAhtY,EAAA,uCAEAitY,EAAA,CACArtY,QAAA,QACAstY,MAAA,kBAgFAntP,eAAAotP,EAAA16N,EAAAq0J,EAAA1nU,EAAAgC,GAEA,MAAAgsY,QAAA36N,EAAArzK,IACAg7N,IACAA,GACA4yK,EAAAI,GAEAC,EAAA,MAAAjsY,EAAAisY,SAAAjsY,EAAAisY,SAAAv0R,EAAAA,EACAw0R,EAAAlsY,EAAAksY,SAAA,EAGA,UAAA,MAAAhiS,KA0CAy0C,gBAAA+mL,EAAAymE,EAAAF,EAAAG,GACA,MAAAjqS,EAAA,IAAAnY,IAOA20D,eAAA0tP,EAAAv6T,EAAAwxI,GACA,MAAAgpL,EAAAhpL,EAAA,EAGA,KAAAgpL,EAAAL,GAKA,IAEA,IAAA,MAAAhnT,WA+BA05D,eAAA+mL,EAAA1sG,GACA,MAAA1mJ,QAAAozP,EAAA74O,IAAAmsI,GAEA,GAAA1mJ,aAAAswP,EAAA,CAIA,MAAA2pE,EAAA,EAAArrC,KAAAA,EAAAxiD,KAAAA,MAAA,CAAAxgT,KAAAgjW,EAAAloI,IAAA0lF,IACA,OAAApsO,EAAAq3R,MAAAl0R,IAAA82T,GAGA,OAAAC,EAAAl6T,GA1CAm6T,CAAA/mE,EAAA5zP,EAAAknJ,UACA,CACAlnJ,OAAAA,EACAQ,KAAA2S,EACA2R,YAAAw1S,GAAAjqS,EAAA/X,IAAAnF,EAAA+zI,IAAAvvH,aAGA2iS,GACAjqS,EAAA9X,IAAApF,EAAA+zI,IAAAvvH,kBAGA4iS,EAAApnT,EAAAqnT,GAEA,MAAAxnS,GAKA,MAJAA,EAAApkG,OAAA66X,IACAz2R,EAAA9f,QAAA,mCAAAlT,EAAAknJ,OAGAl0H,SAIAunS,EAAA,CAAArzK,IAAAmzK,GAAA,GAnFAO,CAAAhnE,EAAA1sG,EAAAizK,EAAAC,GAEAhiS,EAAAp4B,SAKAo4B,EAAAtT,mBAMA,CACAq5F,IAAA08M,EAAAziS,EAAAp4B,OAAAknJ,IAAA9uH,EAAA53B,KAAA0mJ,IAAA9uH,EAAA53B,KAAAp0E,KAAA8B,EAAAqiO,WAaA,SAAAsqK,EAAAC,EAAAC,EAAAC,EAAA,GAAAzqK,EAAAwpK,EAAArtY,SACA,IAAA4tI,EAAAi2F,EAAA99I,QAAA,SAAAqoT,EAAAnjS,YAGA,OAFA2iC,EAAAA,EAAA7nD,QAAA,SAAAsoT,EAAApjS,YACA2iC,EAAAA,EAAA7nD,QAAA,cAAAuoT,GACA1gQ,EAkFA,SAAAogQ,EAAAl6T,EAAAt0E,EAAA,IAEA,IAAAosW,EAAA,GACA,IAAA,MAAAlsW,EAAAa,KAAAF,OAAA0pG,QAAAj2B,GACAsnJ,EAAAsM,MAAAnnO,GACAqrW,EAAAj0R,KAAA,CACAj4E,KAAAF,EAAAE,EACA86N,IAAAj6N,IAEA,iBAAAA,IACAqrW,EAAAA,EAAAltQ,OAAAsvS,EAAAztY,EAAAf,EAAAE,EAAA,OAGA,OAAAksW,EArMA1rW,EAAAC,QAAA,UAAA+mU,KAAAA,EAAAr0J,QAAAA,EAAAm0J,QAAAA,IA6BA,OAAA2C,GAzBAxpL,gBAAAw3E,EAAAn2N,EAAA,IACA,GAAA,IAAAA,EAAAisY,SACA,OAGA,GAAAjsY,EAAA8rY,OAAA9rY,EAAAqiO,QAAAriO,EAAAqiO,SAAAwpK,EAAArtY,QACA,MAAA,IAAA2lG,MAAA,oDAGAnkG,EAAAqiO,OAAAriO,EAAA8rY,MAAAD,EAAAC,MAAA9rY,EAAAqiO,OAEA,iBAAAriO,EAAAisY,WACAjsY,EAAAisY,SAAAjsY,EAAAivW,UAAAv3P,EAAAA,EAAA,GAIA,MAEAuiR,GAFA/wR,MAAA/gB,QAAAguI,GAAAA,EAAA,CAAAA,IAEA1gJ,KAAAlD,GAiBA,SAAAizP,EAAArvG,EAAAn2N,GACA,MAAAg5N,IACAA,EAAAh7N,KACAA,GACA4tY,EAAAz1K,IAEA,IAAAn2N,EAAAwlU,SACAA,EAAAxsG,GAGA,MAAA,SAAAA,IAAAh7N,GAAA,KA3BA+uY,CAAAvnE,EAAAjzP,EAAAvyE,KAEA,IAAA,MAAAhC,KAAAi8X,QACA8R,EAAA16N,EAAAq0J,EAAA1nU,EAAAgC,OAOAtB,EAAAC,QAAAktY,OAAAA,gMC/DA,aAEA,MAAA1jE,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,UAAA0mU,KAAAA,IAUA,OAAA8C,GANAxpL,gBAAA3+I,EAAA,IACA,UAAA,MAAAg5N,KAAAqsG,EAAAl1D,OAAA60H,UAAA,GAAA,CAAA9pK,OAAAl7N,EAAAk7N,cACA,CAAAjrC,IAAA+oC,EAAAvvH,+FCdA,aAEA,MAAAujS,EAAApuY,EAAA,cACAquY,EAAAruY,EAAA,uBACAsuY,EAAAtuY,EAAA,YACAuuY,EAAAvuY,EAAA,UAqBAF,EAAAC,QAZA,MAKAuD,aAAAqjU,QAAAA,IACAl6N,KAAA+hS,SAAAJ,EAAA,CAAAznE,QAAAA,IACAl6N,KAAAgiS,gBAAAJ,EAAA,CAAA1nE,QAAAA,IACAl6N,KAAAiiS,OAAAJ,EAAA,CAAA3nE,QAAAA,IACAl6N,KAAAkiS,KAAAJ,EAAA,CAAA5nE,QAAAA,0HCvBA,aAEA,MAAA4C,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA4mU,QAAAA,KAWA4C,GAPAxpL,eAAA3+I,EAAA,IACA,MAAAymU,QAAAA,SAAAlB,EAAAjnU,IAAA0B,GACA+uF,EAAA03O,EAAA+mE,cAEA,OAAAtkS,MAAA4rD,KAAA/lE,GAAAtZ,KAAAr2E,GAAAA,EAAA,GAAA45N,wFChBA,aAEA,MAAAI,EAAAx6N,EAAA,WACAupU,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA4mU,QAAAA,KAWA4C,GAPAxpL,eAAAooF,EAAA/mO,EAAA,IACA,MAAAymU,QAAAA,SAAAlB,EAAAjnU,IAAA0B,GACA+uF,EAAA03O,EAAA4mE,gBAAAj0K,EAAA2M,cAAAgB,GAAA/mO,GAEA,OAAAkpG,MAAA4rD,KAAA/lE,GAAAtZ,KAAAr2E,GAAAA,EAAA,GAAA45N,0GCjBA,aAEA,MAAAY,EAAAh7N,EAAA,QACAupT,EAAAvpT,EAAA,YACAupU,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA4mU,QAAAA,KAoBA4C,GAhBAxpL,eAAA8uP,EAAAztY,EAAA,IACA,MAAAymU,QAAAA,SAAAlB,EAAAjnU,IAAA0B,GAEAkpG,MAAA/gB,QAAAslT,KACAA,EAAA,CAAAA,IAGA,IACAA,EAAAA,EAAAh4T,KAAAujJ,GAAA,IAAAY,EAAAZ,KACA,MAAAl0H,GACA,MAAAqjN,EAAArjN,EAAA,mBAGA,OAAA2hO,EAAA6mE,OAAAG,qHC3BA,aAEA,MAAAtlE,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA4mU,QAAAA,KAsBA4C,GAlBAxpL,eAAA3+I,EAAA,IAEA,MAAAymU,SAAAlB,EAAAjnU,IAAA0B,IAAAymU,QACAinE,EAAAjnE,EAAA8mE,OAAAG,SAEA,MAAA,CACAC,cAAAl8T,SAAAi8T,EAAAE,qBAAAnkS,YACAokS,eAAAxmQ,OAAAqmQ,EAAAG,eAAApkS,YACA2jS,SAAAlkS,MAAA4rD,KAAA2xK,EAAA+mE,eAAA/3T,KAAAr2E,GAAAA,EAAA,GAAA45N,MACA80K,MAAArnE,EAAAqnE,QAAAr4T,KAAA6Z,GAAAA,EAAA40I,gBACA6pK,gBAAA1mQ,OAAAqmQ,EAAAK,gBAAAtkS,YACAukS,gBAAA3mQ,OAAAqmQ,EAAAM,gBAAAvkS,YACAwkS,aAAA5mQ,OAAAqmQ,EAAAO,aAAAxkS,YACAykS,WAAA7mQ,OAAAqmQ,EAAAQ,WAAAzkS,YACA0kS,SAAA9mQ,OAAAqmQ,EAAAS,SAAA1kS,+FC1BA,aAEA,MAAAsqQ,EAAAn1W,EAAA,SACAwvY,EAAAxvY,EAAA,WACAyvY,EAAAzvY,EAAA,UACA0vY,EAAA1vY,EAAA,WACAs1W,EAAAt1W,EAAA,QAcAF,EAAAC,QAbA,MAKAuD,aAAAmjU,KAAAA,IACAh6N,KAAAhhB,IAAA0pR,EAAA,CAAA1uC,KAAAA,IACAh6N,KAAAtc,KAAAs/S,EAAA,CAAAhpE,KAAAA,IACAh6N,KAAAgpQ,GAAAH,EAAA,CAAA7uC,KAAAA,IACAh6N,KAAAotD,MAAA21O,EAAA,CAAA/oE,KAAAA,IACAh6N,KAAAimE,MAAAg9N,EAAA,CAAAjpE,KAAAA,uHCjBA,aAEA,MAAAkpE,iBAAAA,GAAA3vY,EAAA,WACAupU,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA0mU,KAAAA,KA2BA8C,GAvBAxpL,eAAA46E,EAAAv5N,EAAA,IACA,IAAAuuY,EAAAh1K,GACA,MAAA,IAAAp1H,MAAA,GAAAo1H,8BAKA,MAAA3zI,QAAAy/O,EAAAz/O,OAAA6hP,OAAAznU,GAEAwuY,EAAA5oT,EAAA6oT,WAAA,GASA,OARAD,EAAAr4T,KAAAojJ,EAAA9vH,YAEA7jB,EAAA6oT,UAAAvlS,MAAA4rD,KACA,IAAA9qE,IAAAwkT,IACA/2S,MAAA,CAAAvlB,EAAAyS,IAAAzS,EAAA05R,cAAAjnR,WAEA0gP,EAAAz/O,OAAArB,QAAAqB,GAEA,CACA8oT,MAAA,CAAAn1K,wGChCA,aAEA,MAAAutF,EAAAloT,EAAA,SAAAovT,KAAA99N,QAKAvxF,EAAA4vY,iBAAAI,IACA,IACA,OAAA7nF,EAAA6nF,GACA,MAAA7pS,GACA,OAAA,6CCXA,aAEA,MAAAqjO,EAAAvpU,EAAA,4CACA4nT,UAAAA,GAAA5nT,EAAA,aAMAF,EAAAC,QAAA,EAAA0mU,KAAAA,KAgBA8C,GAZAxpL,eAAA3+I,EAAA,IAGA,MAAA4lF,QAAAy/O,EAAAz/O,OAAA6hP,OAAAznU,GACA+tK,EAAAnoF,EAAA6oT,WAAA,GAKA,OAJA7oT,EAAA6oT,UAAA,SAEAppE,EAAAz/O,OAAArB,QAAAqB,GAEA,CAAA8oT,MAAA3gO,EAAAt4F,KAAAk5T,GAAA,IAAAnoF,EAAAmoF,0GCtBA,aAEA,MAAAxmE,EAAAvpU,EAAA,4CACA4nT,UAAAA,GAAA5nT,EAAA,aAMAF,EAAAC,QAAA,EAAA0mU,KAAAA,KAUA8C,GANAxpL,eAAA3+I,EAAA,IAGA,MAAA,CAAA0uY,aADArpE,EAAAz/O,OAAAiH,IAAA,YAAA7sF,IACA,IAAAy1E,KAAAk5T,GAAA,IAAAnoF,EAAAmoF,0GChBA,aAEA,MAAAC,EAAAhwY,EAAA,kCACAupU,EAAAvpU,EAAA,4CACA4nT,UAAAA,GAAA5nT,EAAA,aAMAF,EAAAC,QAAA,EAAA0mU,KAAAA,KAiBA8C,GAbAxpL,eAAA3+I,EAAA,IAGA,MAAA4lF,QAAAy/O,EAAAz/O,OAAA6hP,OAAAznU,GAKA,OAJA4lF,EAAA6oT,UAAAG,IAAAH,gBAEAppE,EAAAz/O,OAAArB,QAAAqB,GAEA,CACA8oT,MAAAE,IAAAH,UAAAh5T,KAAAk5T,GAAA,IAAAnoF,EAAAmoF,mJCvBA,aAEAjwY,EAAAC,QAAA,KAAA,CACAkwY,UAAA,CACAC,MAAA,GAEAC,SAAA,GACAC,WAAA,GACAC,IAAA,GACAC,QAAA,GACAC,IAAA,GACAC,UAAA,CACA,6CACA,6CACA,6CACA,+CAGAC,UAAA,CACAC,KAAA,CACAC,SAAA,EACAC,SAAA,IAEAC,WAAA,CACAF,SAAA,IAGAd,UAAA,CACA,kFACA,kFACA,kFACA,kFACA,kFACA,6FACA,6FACA,6FACA,8FAEAiB,OAAA,CACAH,SAAA,GAEAT,MAAA,CACAa,QAAA,CACAC,SAAA,IACAC,UAAA,KAEAC,mBAAA,GAEAC,QAAA,CACA9kJ,KAAA,wCCjDA,aAEA,MAAAsjJ,iBAAAA,GAAA3vY,EAAA,WACAupU,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA0mU,KAAAA,KAmBA8C,GAfAxpL,eAAA46E,EAAAv5N,EAAA,IACA,IAAAuuY,EAAAh1K,GACA,MAAA,IAAAp1H,MAAA,GAAAo1H,8BAKA,MAAA3zI,QAAAy/O,EAAAz/O,OAAA6hP,OAAAznU,GAKA,OAJA4lF,EAAA6oT,WAAA7oT,EAAA6oT,WAAA,IAAAr1T,QAAAu1T,GAAAA,EAAAllS,aAAA8vH,EAAA9vH,mBAEA47N,EAAAz/O,OAAArB,QAAAqB,GAEA,CAAA8oT,MAAA,CAAAn1K,sGCzBA,aAEA,MAAAy2K,EAAApxY,EAAA,SACAqxY,EAAArxY,EAAA,SACAs1W,EAAAt1W,EAAA,QACAuuY,EAAAvuY,EAAA,UA2BAF,EAAAC,QAjBA,MASAuD,aAAAujU,aAAAA,EAAAD,QAAAA,EAAAG,OAAAA,EAAAI,WAAAA,EAAAC,IAAAA,IACA36N,KAAAxe,IAAAmjT,EAAA,CAAAvqE,aAAAA,EAAAD,QAAAA,IACAn6N,KAAAqxH,IAAAuzK,EAAA,CAAAxqE,aAAAA,EAAAD,QAAAA,EAAAG,OAAAA,EAAAK,IAAAA,IACA36N,KAAAgpQ,GAAAH,EAAA,CAAAzuC,aAAAA,EAAAE,OAAAA,EAAAI,WAAAA,IACA16N,KAAAkiS,KAAAJ,EAAA,CAAA1nE,aAAAA,EAAAD,QAAAA,mGC5BA,aAEA,MAAA0qE,SAAAA,GAAAtxY,EAAA,WACAupU,EAAAvpU,EAAA,2CAOAF,EAAAC,QAAA,EAAA8mU,aAAAA,EAAAD,QAAAA,KAcA2C,GAVAxpL,eAAAq6E,EAAAh5N,EAAA,IAOA,OANAg5N,EAAAk3K,EAAAl3K,IAEA,IAAAh5N,EAAAwlU,SACAA,EAAAxsG,GAGAysG,EAAA54O,IAAAmsI,EAAAh5N,uGCrBA,aAEA,MAAA45N,EAAAh7N,EAAA,QACAupT,EAAAvpT,EAAA,YAMAD,EAAAuxY,SAAAl3K,IACA,GAAAY,EAAAsM,MAAAlN,GACA,OAAAA,EAIA,IAEA,OAAA,IAAAY,EAAAZ,GACA,MAAAl0H,GACA,MAAAqjN,EAAArjN,EAAA,gFCnBA,aAEA,MAAAqrS,EAAAvxY,EAAA,cACA86N,EAAA96N,EAAA,sBACAg7N,EAAAh7N,EAAA,QACA06N,EAAA16N,EAAA,WACAupU,EAAAvpU,EAAA,2CAaAF,EAAAC,QAAA,EAAA8mU,aAAAA,EAAAO,IAAAA,EAAAL,OAAAA,EAAAH,QAAAA,KA8DA2C,GA1DAxpL,eAAAka,EAAA74J,EAAA,IACA,GAAAkpG,MAAA/gB,QAAA0wE,GACA,MAAA,IAAA10D,MAAA,0BAGA,IAAAgsS,EAAAlvT,QAAA43E,GAAA,CAEA,MAAAmrE,EAAA,EACA,GAAAhkO,EAAAg5N,KAAAM,EAAAN,IAAAh5N,EAAAg5N,KAAA,CACA,MAAAA,EAAAY,EAAAsM,MAAAlmO,EAAAg5N,KAAAh5N,EAAAg5N,IAAA,IAAAY,EAAA55N,EAAAg5N,KACAngE,EAAA,IAAAs3O,EAAAnsK,EAAAhL,OACA,CACA,MAAAo3K,EAAApwY,EAAAowY,QAAA,WACA/tK,EAAAriO,EAAAqiO,QAAA,SAGA,IAAA+pI,EAAA,EAIAA,EAFA,MAAApsW,EAAA+uG,QAEA,aAAAqhS,GAAA,WAAA/tK,EAAA,EAAA,EAIAriO,EAAA+uG,QAGA,MAAA4qH,QAAAD,EAAAsK,EAAAosK,GACAp3K,EAAA,IAAAY,EAAAwyI,EAAA/pI,EAAA1I,GAEA9gE,EAAA,IAAAs3O,EAAAnsK,EAAAhL,IAIA,MAAA0F,QAAAinG,EAAAsvC,WAEA,IAgBA,aAfAxvC,EAAA/oG,IAAA7jE,EAAA,CACAqiE,OAAAl7N,EAAAk7N,UAGA,IAAAl7N,EAAAwlU,SACAA,EAAA3sK,EAAAmgE,MAGA,IAAAh5N,EAAAgmU,WACAA,EAAA37O,IAAAwuE,EAAAmgE,IAAA,CACAi2I,WAAA,EACA/zI,OAAAl7N,EAAAk7N,SAIAriE,EACA,QACA6lE,wKC7EA,aAEA,MAAA9E,EAAAh7N,EAAA,SAEAmwG,QAAAA,GAAAnwG,EAAA,mBACAyxY,EAAA9uY,OAAAugP,IAAA,6BACA/6F,EAAA,CAAAy6E,UAAA,EAAAr3H,cAAA,EAAAC,YAAA,GAQA,MAAA+lS,EAKAjuY,YAAA61J,EAAAihE,GACA,KAAAjhE,GAAAA,aAAA+rE,YACA,MAAA,IAAA3/H,MAAA,wCAGA,IAAA60H,IAAAY,EAAAsM,MAAAlN,GACA,MAAA,IAAA70H,MAAA,iCAGAkH,KAAA0sD,KAAAA,EACA1sD,KAAA2tH,IAAAA,EAEAn6N,OAAAq5U,iBAAA7sO,KAAA,CACA0sD,KAAAhR,EACAiyE,IAAAjyE,IAUA+wO,YAEA,OADAwY,IACAjlS,KAAA0sD,KASAw4O,WAEA,OADAC,IACAnlS,KAAA2tH,IAGAnsI,IAAAtrF,OAAAspM,eACA,MAAA,QAGAwlM,IAAAA,KACA,OAAA,EASAnuY,eAAAmgP,GACA,OAAA35J,QAAA25J,GAAAA,EAAAguJ,KASA,MAAA91D,EAAA,CAAAv/O,EAAAhW,KACA,IAAAkxP,GAAA,EACA,MAAA,KACA,IAAAl7O,EAAAlqB,KAAAi+B,GAOA,MAAA,IAAA5K,MAAAnf,GANAkxP,IACAA,GAAA,EAEAnwO,QAAAs6E,KAAAr7F,MAQAwrT,EAAAj2D,EAAA,gBAAA,8FACA+1D,EAAA/1D,EAAA,eAAA,gGAEA77U,EAAAC,QAAAwxY,4wDCrGA,aAEA,MAAAv2K,EAAAh7N,EAAA,QACAupT,EAAAvpT,EAAA,aACA6xY,YAAAA,EAAAr3T,OAAAA,GAAAx6E,EAAA,wBACAk1U,KAAAA,GAAAl1U,EAAA,YACA41W,SAAAA,GAAA51W,EAAA,uBACAsxY,SAAAA,GAAAtxY,EAAA,WACAupU,EAAAvpU,EAAA,2CAUAF,EAAAC,QAAA,EAAA8mU,aAAAA,EAAAE,OAAAA,EAAAI,WAAAA,KA0DAoC,GAtDAxpL,gBAAA8uP,EAAAztY,EAAA,IACAkpG,MAAA/gB,QAAAslT,KACAA,EAAA,CAAAA,IAKA,MAAA/uK,QAAAinG,EAAA+qE,YAEA,UACA58D,EACA25D,EACAgD,EAxBA,GAwBA9xP,MAAAA,IAIA,MAAA1oE,EAAA,CAAA+iJ,IAHAA,EAAAk3K,EAAAl3K,IAKA,IACA,MAAA23K,QAAA5qE,EAAA6uC,iBAAA57I,EAAAw7I,EAAAziJ,KAEA,GAAA4+K,EAAA56B,OAAA,CACA,GAAAn8I,EAAAsM,MAAAyqK,EAAA1vF,QACA,MAAAkH,EAAA,IAAAhkN,MAAA,cAAAwsS,EAAA1vF,UAAA,oBAGA,MAAAkH,EAAA,IAAAhkN,MAAA,WAAAwsS,EAAA1vF,UAAA,oBAOA,UAFAwkB,EAAAmkE,MAAAz5H,OAAA/lL,IAAA4uI,GAGA,MAAAmvF,EAAA,IAAAhkN,MAAA,mBAAA,6BAGAshO,EAAA32O,OAAAkqI,GACA,MAAAl0H,GACA9kG,EAAAwqN,QACA1lH,EAAA9f,QAAA,iBAAAg0I,MAAAl0H,EAAA9f,UACA/O,EAAA2E,MAAAkqB,GAIA,OAAA7uB,KAEAmD,GAAA,KAAAp5E,EAAA4wY,SAEA,QACAlyK,mPCxEW7zH,EAAQsiE,GACI,iBAAZxuK,QAA0C,IAAXD,EAAyByuK,EAAQxuK,GAEIwuK,GAA1EtiE,EAA+B,oBAAfH,WAA6BA,WAAaG,GAAUF,MAAqBkmS,mBAAAA,KAC5FxlS,MAAO,SAAU1sG,GAAW,aAsC1B,SAAAmyY,EAAqB77D,MACY,mBAAlBA,EAASxsP,YACTwsP,KAE8B,mBAA9BA,EAAS1zU,OAAOu0J,iBAChBm/K,EAAS1zU,OAAOu0J,eAEmB,mBAAnCm/K,EAAS1zU,OAAOy6N,sBAChBi5G,EAAS1zU,OAAOy6N,2BAEjB5rH,UAAU,6EAGxB,SAAA2gS,QACQnmM,EACAv5B,SAMAqvC,QALEA,IAActvC,SAAQ,CAAC4/N,EAAaC,KACtC5/N,EAAU2/N,EACVpmM,EAASqmM,KAITrmM,OAAAA,EACAv5B,QAAAA,GAKR,SAAA26K,EAAiB1jP,EAAM2sO,SACbn/K,EAAWg7O,EAAY77D,GACvBi8D,EAAAA,GACAC,EAAAA,OACFpgE,GAAU,EACVx6J,GAAQ,EAiBZ53B,eAAAyyP,QACQ76N,KAGAw6J,GAGAmgE,EAAY5gU,QAAUg4B,IAG1ByoO,GAAU,iBAEE57J,EAAAA,MAAMp2K,SAAgB+2J,EAASrtE,OACnC0sF,EACAoB,GAAQ,EAGR26N,EAAY/6T,KAAAA,CAAOp3E,MAAAA,UAGpB67E,GACH27F,GAAQ,EACR26N,EAAY/6T,KAAAA,CAAOyE,MAAAA,KAtC3B,gBACWu2T,EAAU7gU,OAAS,GAAK4gU,EAAY5gU,OAAS,GAAA,OAC1C+gU,EAAeF,EAAUnhS,eACvBp1B,EAAAA,MAAO77E,GAAUmyY,EAAYlhS,QACjCp1B,EACAy2T,EAAazmM,OAAOhwH,GAGpBy2T,EAAahgO,QAAAA,CAAU8D,MAAM,EAAOp2K,MAAAA,SAGrCoyY,EAAU7gU,OAAS,GAAKimG,GAAAA,eACnBlF,GAAY8/N,EAAUnhS,QAC9BqhE,EAAAA,CAAU8D,MAAM,EAAMp2K,WAAOgC,KA2BjCuwY,GACAvgE,GAAU,EACVqgE,WAmBEG,EAAAA,CACF9oT,KAlBJk2D,oBACQuyP,EAAY5gU,OAAS,EAAA,aACbsK,EAAAA,MAAO77E,GAAUmyY,EAAYlhS,WACjCp1B,QACMA,SAEVw2T,KACSj8N,MAAM,EAAOp2K,MAAAA,MAEtBw3K,SACSpB,MAAM,EAAMp2K,WAAOgC,SAE1BywY,EAAWT,WACjBI,EAAUh7T,KAAKq7T,GACfJ,IACOI,EAAS9wL,UAIfn/M,OAAOy6N,eAAgB,IAAMu1K,UAE3BA,EAwBX,SAAAr2L,EAAgB5yG,EAAM2sO,eACDl0U,IAAbk0U,EACOw8D,GAAmBv2L,EAAO5yG,EAAMmpS,GAE9B,IAATnpS,EACO2sO,EAEPA,EAAS1zU,OAAOy6N,eACTgwH,EAAQ1jP,EAAM2sO,GA9B7B,UAAqB3sO,EAAM2sO,SACjBy8D,EAAAA,OACFtyY,gBAEWL,KAASk2U,EAChBy8D,EAAWv7T,KAAKp3E,GACZ2yY,EAAWphU,QAAUg4B,UAGnBopS,EAAW1hS,eAGlBp1B,GACHx7E,EAAIw7E,YAEG77E,KAAS2yY,QACV3yY,KAENK,QACMA,EAaHuyY,CAAWrpS,EAAM2sO,GAmD5Bt2L,eAAAizP,EAAwBC,EAAY58D,mBACfl9K,KAAQk9K,QACX48D,EAAW95O,WACXA,GAIlB,SAAA3+E,EAAgBy4T,EAAY58D,eACPl0U,IAAbk0U,EACQw8D,GAAoBG,EAAQC,EAAYJ,GAE7CG,EAAQC,EAAY58D,GAG/Bt2L,eAAAmzP,EAAwB78D,mBACH88D,KAAY98D,EACrB88D,GAAgC,iBAAbA,IAA0BA,EAASxwY,OAAOu0J,WAAai8O,EAASxwY,OAAOy6N,sBACnF81K,EAAQC,SAGTA,EAKlBpzP,eAAAqzP,EAAqBxuI,EAAMyxE,mBACNjwO,KAAOiwO,cACRzxE,EAAKx+J,GAGzB,SAAAvvB,EAAa+tL,EAAMyxE,eACEl0U,IAAbk0U,EACOw8D,GAAmBO,EAAKxuI,EAAMiuI,GAElCO,EAAKxuI,EAAMyxE,GAUtB,SAAAg9D,EAAwB3iC,EAAa9rG,EAAMyxE,SACjCn/K,EAAWg7O,EAAY77D,GACvBi8D,EAAAA,GACAC,EAAAA,OACF56N,GAAQ,EACRw6J,GAAU,EACVmhE,EAAgB,EAChBC,EAAY,KAChB,SAAAb,SACWH,EAAU7gU,OAAS,GAAK4gU,EAAY5gU,OAAS,GAAA,eACxC+gG,GAAY8/N,EAAUnhS,QAE9BqhE,EAAAA,CAAU8D,MAAM,EAAOp2K,MADTmyY,EAAYlhS,eAGvBmhS,EAAU7gU,OAAS,GAAuB,IAAlB4hU,GAAuB37N,GAAAA,eAC1ClF,EAAAA,OAASu5B,GAAWumM,EAAUnhS,QAClCmiS,GACAvnM,EAAOunM,GACPA,EAAY,MAGZ9gO,EAAAA,CAAU8D,MAAM,EAAMp2K,WAAOgC,KAIzC49I,eAAAyyP,OACQ76N,EACA+6N,cAGAvgE,GAGAmhE,EAAgBhB,EAAY5gU,QAAUg/R,IAG1Cv+B,GAAU,EACVmhE,mBAEY/8N,EAAAA,MAAMp2K,SAAgB+2J,EAASrtE,OACnC0sF,GACAoB,GAAQ,EACR27N,IACAZ,KAeZ3yP,eAA2ByzP,aAEbrzY,QAAcykQ,EAAK4uI,MACrBrzY,GAASA,EAAMwC,OAAOy6N,+BACLq2K,KAAYtzY,EACzBmyY,EAAY/6T,KAAKk8T,QAIrBnB,EAAY/6T,KAAKp3E,SAGlB67E,GACH27F,GAAQ,EACR47N,EAAYv3T,EAEhBs3T,IACAZ,IACAF,IA9BQkB,CAAYvzY,SAGb67E,GACH27F,GAAQ,EACR27N,IACAC,EAAYv3T,EACZ02T,IAEJvgE,GAAU,EACVqgE,WAiCEG,EAAAA,CACF9oT,KAZJk2D,oBAC+B,IAAvBuyP,EAAY5gU,OAAW,OACjBkhU,EAAWT,WACjBI,EAAUh7T,KAAKq7T,GACfJ,IACOI,EAAS9wL,cAEd3hN,EAAQmyY,EAAYlhS,eAC1BohS,KACSj8N,MAAM,EAAOp2K,MAAAA,KAIrBwC,OAAOy6N,eAAgB,IAAMu1K,UAE3BA,EAcX5yP,eAAA4zP,EAA4B12K,cACbzqD,SAAQC,IACfwqD,EAAO5J,KAAK,YAAY,KACpB5gD,UAuCZ,SAAApyD,EAAkBuzR,KAAYxoS,OACtByoS,EAAaD,cACNhvI,KAAQx5J,EACfyoS,EAAajvI,EAAKivI,UAEfA,EAqCX,SAAAhC,EAAqBnhC,EAAa9rG,EAAMyxE,eACvBl0U,IAATyiQ,EACO,CAACkvI,EAAajB,IAAoBhB,EAAYnhC,EAAaojC,EAAajB,QAElE1wY,IAAbk0U,EACOw8D,GAAmBhB,EAAYnhC,EAAa9rG,EAAMiuI,GAEzC,IAAhBniC,EACO75R,EAAI+tL,EAAMyxE,GA1CzBt2L,gBAA6B2wN,EAAa9rG,EAAMyxE,OACxC09D,EAAiB,WAafC,EAAM9B,EADG7xR,GAAS,IAAMg2N,GAAU/5H,EAAO,IAR3Bv8D,gBAAiBv+D,mBAChBrhF,KAASqhF,EAAAA,IAClBuyT,eAGE5zY,KAGkD02E,GAX/C12E,IAAAA,CACbA,MAAOykQ,EAAKzkQ,OAU+Dm8M,EAAOo0J,EAAc,YAE7F,aACKvwW,EAAAA,KAAOo2K,SAAey9N,EAAInqT,UAC9B0sF,kBAIMnwE,QAAYjmG,EAAMA,MACnB4zY,UACK3tS,SAGPpqB,GACH+3T,EAAiB/3T,MAGrB+3T,QACMA,EAaHE,CAAavjC,EAAa9rG,EAAMyxE,GAyE3Ct2L,eAAAm0P,EAAuBtvI,EAAMnjL,EAAO40P,OAC5Bl2U,EAAQshF,kBACK0yT,KAAY99D,EACzBl2U,QAAcykQ,EAAKzkQ,EAAOg0Y,UAEvBh0Y,EA0CX4/I,eAAAq0P,EAA0BxvI,EAAMyxE,mBACXjwO,KAAOiwO,QACdzxE,EAAKx+J,SACLA,EAUd,SAAAiuS,EAAiB/gU,EAAGyS,OACZuuT,EAAUhhU,EAAE,GAAKyS,EAAE,GACnBwuT,EAAcjhU,EAAE,GAAKyS,EAAE,MACvBwuT,GAAe,IAAA,OACThrH,EAAYgrH,EAAc,IAChCD,IAAYC,EAAchrH,GAAa,IACvCgrH,EAAchrH,SAEV+qH,EAASC,GAsDrB,SAAA5kE,EAAoB+gC,EAAa9rG,EAAMyxE,SAC7Bn/K,EAAWg7O,EAAY77D,GACvBi8D,EAAAA,GACAC,EAAAA,OACF56N,GAAQ,EACRw6J,GAAU,EACVmhE,EAAgB,EAChBC,EAAY,KAChB,SAAAb,SACWH,EAAU7gU,OAAS,GAAK4gU,EAAY5gU,OAAS,GAAA,eACxC+gG,GAAY8/N,EAAUnhS,QAE9BqhE,EAAAA,CAAU8D,MAAM,EAAOp2K,MADTmyY,EAAYlhS,eAGvBmhS,EAAU7gU,OAAS,GAAuB,IAAlB4hU,GAAuB37N,GAAAA,eAC1ClF,EAAAA,OAASu5B,GAAWumM,EAAUnhS,QAClCmiS,GACAvnM,EAAOunM,GACPA,EAAY,MAGZ9gO,EAAAA,CAAU8D,MAAM,EAAMp2K,WAAOgC,KAIzC49I,eAAAyyP,OACQ76N,EACA+6N,cAGAvgE,GAGAmhE,EAAgBhB,EAAY5gU,QAAUg/R,IAG1Cv+B,GAAU,EACVmhE,mBAEY/8N,EAAAA,MAAMp2K,SAAgB+2J,EAASrtE,OACnC0sF,GACAoB,GAAQ,EACR27N,IACAZ,KAeZ3yP,eAA2ByzP,aAEbrzY,QAAcykQ,EAAK4uI,GACzBlB,EAAY/6T,KAAKp3E,SAEd67E,GACH27F,GAAQ,EACR47N,EAAYv3T,EAEhBs3T,IACAZ,IACAF,IAvBQkB,CAAYvzY,SAGb67E,GACH27F,GAAQ,EACR27N,IACAC,EAAYv3T,EACZ02T,IAEJvgE,GAAU,EACVqgE,WA0BEG,EAAAA,CACF9oT,KAZJk2D,oBAC+B,IAAvBuyP,EAAY5gU,OAAW,OACjBkhU,EAAWT,WACjBI,EAAUh7T,KAAKq7T,GACfJ,IACOI,EAAS9wL,cAEd3hN,EAAQmyY,EAAYlhS,eAC1BohS,KACSj8N,MAAM,EAAOp2K,MAAAA,KAIrBwC,OAAOy6N,eAAgB,IAAMu1K,UAE3BA,EAcX5yP,eAAAy0P,EAA8Bv3K,EAAQo5G,OAC9Bk9D,EAAY,KACZkB,EAAQ,KACRC,EAAU,WACRC,EAAczuS,IAChBqtS,EAAYrtS,EACRuuS,GACAA,EAAMvuS,IAGR0uS,EAAc,KACZF,GACAA,KAORz3K,EAAO5J,KAAK,QAASshL,mBASJx0Y,KAASk2U,MACM,IAAxBp5G,EAAOm0B,MAAMjxP,UATA,IAAUqyK,SAAQ,CAACC,EAASu5B,QACzCunM,SACOvnM,EAAOunM,GAElBt2K,EAAO5J,KAAK,QAASuhL,GACrBF,EAAUjiO,EACVgiO,EAAQzoM,KAMJunM,WAhBJt2K,EAAOgF,eAAe,QAAS0yK,GAC/B13K,EAAOgF,eAAe,QAAS2yK,GAoB/BrB,QACMA,EAUdxzY,EAAQmmY,MA9wBR,SAAAA,EAAex8R,EAAM2sO,eACAl0U,IAAbk0U,EACOw8D,GAAmB3M,EAAMx8R,EAAMmpS,GAEtCx8D,EAAS1zU,OAAOy6N,eA9BxBr9E,gBAAuBr2C,EAAM2sO,OACrBw+D,EAAAA,mBACa17O,KAAQk9K,EACrBw+D,EAAUt9T,KAAK4hF,GACX07O,EAAUnjU,SAAWg4B,UACfmrS,EACNA,EAAAA,IAGJA,EAAUnjU,OAAS,UACbmjU,GAqBCC,CAAOprS,EAAM2sO,GAlB5B,UAAqB3sO,EAAM2sO,OACnBw+D,EAAAA,aACO17O,KAAQk9K,EACfw+D,EAAUt9T,KAAK4hF,GACX07O,EAAUnjU,SAAWg4B,UACfmrS,EACNA,EAAAA,IAGJA,EAAUnjU,OAAS,UACbmjU,GAUHE,CAAWrrS,EAAM2sO,IAwwB5Bt2U,EAAQu8M,OAASA,EACjBv8M,EAAQ44Q,QAvnBR,SAAiB09D,UACTA,EAAS1zU,OAAOy6N,eARxBr9E,eAAwBs2L,SACdxsO,EAAAA,mBACW1pG,KAASk2U,EACtBxsO,EAAOtyB,KAAKp3E,UAET0pG,EAIImrS,CAAS3+D,GAEb/rO,MAAM4rD,KAAKmgL,IAonBtBt2U,EAAQu+F,OAvmBR,YAAmB22S,UACKA,EAAUrqT,MAAKopT,QAAqC7xY,IAA9B6xY,EAAIrxY,OAAOy6N,iBAXzDr9E,gBAAwBk1P,mBACH5+D,KAAY4+D,QAClB5+D,EAWA6+D,CAAQD,GARvB,UAAsBA,aACP5+D,KAAY4+D,QACZ5+D,EASA8+D,CAAYF,IAkmB3Bl1Y,EAAQ40U,QAzlBR,SAAiB0B,MACTA,EAAS1zU,OAAOy6N,sBANxBr9E,eAAwBs2L,mBACHjwO,KAAOiwO,IAMb++D,CAAS/+D,aAETjwO,KAAOiwO,KAslBtBt2U,EAAQy6E,OAASA,EACjBz6E,EAAQs1Y,QA7iBR,SAAAA,EAAiBzwI,EAAMyxE,eACFl0U,IAAbk0U,EACOw8D,GAAmBwC,EAAQzwI,EAAMiuI,GAErCr4T,GAAO5G,GAAKA,MAAAA,GAA+Bs/T,EAAQr8T,EAAI+tL,EAAMyxE,MA0iBxEt2U,EAAQu1Y,cAxcR,SAAAA,EAAuB5kC,EAAa9rG,EAAMyxE,eACzBl0U,IAATyiQ,EACO,CAACkvI,EAAajB,IAAoBA,EACnCyC,EAAc5kC,EAAaojC,EAAajB,GACxCyC,EAAc5kC,EAAaojC,QAEpB3xY,IAAbk0U,EACQw8D,GAAoByC,EAAc5kC,EAAa9rG,EAAMiuI,GAE1Dr4T,GAAO5G,GAAKA,MAAAA,GAA+Bs/T,EAAQG,EAAe3iC,EAAa9rG,EAAMyxE,MAgchGt2U,EAAQmzY,QAAUA,EAClBnzY,EAAQ68N,WA1aR,SAAoBK,SAC4B,mBAAjCA,EAAOt6N,OAAOy6N,eACdH,EAffl9E,gBAA4Bk9E,UACjB,OACG9jE,EAAO8jE,EAAOQ,UACP,OAATtkE,MAIA8jE,EAAO81G,eAAep7J,kBAGpBg8N,EAAa12K,cANT9jE,GAaPo8O,CAAYt4K,IAuavBl9N,EAAQmyY,YAAcA,EACtBnyY,EAAQ82E,IAAMA,EACd92E,EAAQ27N,MAtaR37E,mBAAyBk1P,SACfjnS,EAAAA,IAAc5iB,IAAI6pT,EAAUp+T,IAAIq7T,SAC/BlkS,EAAQtE,KAAO,aACPwtD,KAAYlpD,EAAAA,OACbwnS,QAAgBt+O,EAASrtE,OAC3B2rT,EAAQj/N,KACRvoE,EAAQ9d,OAAOgnE,SAGTs+O,EAAQr1Y,QA8Z9BJ,EAAQ01Y,gBAjWR,SAAAA,EAAyB/kC,EAAa9rG,EAAMyxE,eAC3Bl0U,IAATyiQ,EACO,CAACkvI,EAAajB,IAAoBA,EACnC4C,EAAgB/kC,EAAaojC,EAAajB,GAC1C4C,EAAgB/kC,EAAaojC,QAEtB3xY,IAAbk0U,EACQw8D,GAAoB4C,EAAgB/kC,EAAa9rG,EAAMiuI,GAE5Dr4T,GAAO5G,GAAKA,MAAAA,GAA+Bs/T,EAAQrB,EAAYnhC,EAAa9rG,EAAMyxE,MAyV7Ft2U,EAAQ8xY,YAAcA,EACtB9xY,EAAQ21Y,cAtVR31P,mBAAiCk1P,SACvBU,EAASV,EAAUp+T,IAAIq7T,GACvB0D,EAAAA,IAAqBxqT,IACrBye,EAAAA,IAAapa,QACf8jT,EAAY,KACZkB,EAAQ,KACRoB,EAAU,WACRlB,EAAczuS,IAChBqtS,EAAYrtS,EACRuuS,GACAA,EAAMvuS,IAGR4vS,EAAa31Y,IACX01Y,GACAA,EAAQ11Y,IAaV41Y,EAAYt6S,UACR+5S,EAAUhjO,QAAQC,QAAQh3E,EAAM5R,QAAQ6gB,MAAKq1C,OAASw2B,KAAAA,EAAMp2K,MAAAA,MACzDo2K,GACD1sE,EAAO3b,IAAIuN,EAAOt7F,GAEtBy1Y,EAAe1lT,OAAOslT,MAE1BI,EAAenqT,IAAI+pT,GACnBA,EAAQ9qS,KAAKorS,EAAYnB,cAElBl5S,KAASk6S,EAChBI,EAAUt6S,UAEP,IAIyB,IAAxBm6S,EAAelsS,MAA8B,IAAhBG,EAAOH,kBA3BvB,IAAU8oE,SAAQ,CAACC,EAASu5B,QACzCunM,GACAvnM,EAAOunM,GAEP1pS,EAAOH,KAAO,SACP+oE,IAEXojO,EAAUpjO,EACVgiO,EAAQzoM,eAuBIvwG,EAAOt7F,KAAU0pG,EACzBA,EAAO3Z,OAAOuL,SACRt7F,EACN41Y,EAAUt6S,KAmStB17F,EAAQsgH,SAAWA,EACnBtgH,EAAQoyE,OAxRR,SAAAA,EAAgByyL,EAAMnjL,EAAO40P,eACXl0U,IAAVs/E,EACO,CAACu0T,EAAcnD,IAAoBA,EAAkBqB,EAAQtvI,EAAMoxI,EAAcnD,GAAmB1gU,EAAOyyL,EAAMoxI,QAE3G7zY,IAAbk0U,EACQw8D,GAAoB1gU,EAAOyyL,EAAMnjL,EAAOoxT,GAE7CqB,EAAQtvI,EAAMnjL,EAAO40P,IAkRhCt2U,EAAQ4lW,KA3PR,SAAAA,EAAc31Q,EAAOqmP,eACAl0U,IAAbk0U,EACOw8D,GAAmBltC,EAAK31Q,EAAO6iT,GAEtCx8D,EAAS1zU,OAAOy6N,eAxBxBr9E,gBAAsB/vD,EAAOqmP,OACrB4/D,EAAQ,kBACK7vS,KAAOiwO,iBACRjwO,EACZ6vS,IACIA,GAASjmT,QAoBNkmT,CAAMlmT,EAAOqmP,GAf5B,UAAoBrmP,EAAOqmP,OACnB4/D,EAAQ,YACD7vS,KAAOiwO,WACRjwO,EACN6vS,IACIA,GAASjmT,QAYVmmT,CAAUnmT,EAAOqmP,IAqP5Bt2U,EAAQq2Y,IA5OR,SAAaxxI,EAAMyxE,eACEl0U,IAAbk0U,EACQw8D,GAAoBuB,EAAUxvI,EAAMiuI,GAEzCuB,EAAUxvI,EAAMyxE,IAyO3Bt2U,EAAQ8nN,KApLR,SAAAA,EAAc7gI,EAAAA,GAAaqvP,eACNl0U,IAAbk0U,EACOw8D,GAAmBhrL,EAAK7gI,EAAQ6rT,QAEJ1wY,IAAnCk0U,EAAS1zU,OAAOy6N,eA5CxBr9E,gBAA2B/4D,EAAQqvP,SACzB29D,EAAM39D,EAAS1zU,OAAOy6N,qBACxBvhE,EAAAA,CAAS,EAAG,UACT,OACGp6E,EAAQ88G,EAAQ83M,gBACdl2Y,EAAAA,KAAOo2K,SAAey9N,EAAInqT,OAC5BmuC,EAAQumE,EAAQ83M,OAAO50T,MAC7Bo6E,EAAQw4O,EAAQx4O,EAAO7jC,GACnBhxC,EAAOsvT,UACPtvT,EAAOsvT,SAASt+Q,EAAO6jC,GAEvB0a,SACIvvF,EAAO60E,OACP70E,EAAO60E,MAAMA,GAEV17J,QAELA,GA4BCo2Y,CAAWvvT,EAAQqvP,GAzBlC,UAAoBrvP,EAAQqvP,SAClB29D,EAAM39D,EAAS1zU,OAAOu0J,gBACxB2E,EAAAA,CAAS,EAAG,UACT,OACGp6E,EAAQ88G,EAAQ83M,gBACdl2Y,EAAAA,KAAOo2K,GAASy9N,EAAInqT,OACtBmuC,EAAQumE,EAAQ83M,OAAO50T,MAC7Bo6E,EAAQw4O,EAAQx4O,EAAO7jC,GACnBhxC,EAAOsvT,UACPtvT,EAAOsvT,SAASt+Q,EAAO6jC,GAEvB0a,SACIvvF,EAAO60E,OACP70E,EAAO60E,MAAMA,GAEV17J,QAELA,GAWCq2Y,CAAUxvT,EAAQqvP,IA6KjCt2U,EAAQ6wF,UAjFR,SAAAA,EAAmB8/Q,EAAa9rG,EAAMyxE,eACrBl0U,IAATyiQ,EACO,CAACkvI,EAAajB,IAAoBA,EACnCjiT,EAAU8/Q,EAAaojC,EAAajB,GACpCjiT,EAAU8/Q,EAAaojC,QAEhB3xY,IAAbk0U,EACQw8D,GAAoBjiT,EAAU8/Q,EAAa9rG,EAAMiuI,GAEtDljE,EAAW+gC,EAAa9rG,EAAMyxE,IAyEzCt2U,EAAQ02Y,cA7BR,SAAuBx5K,EAAQo5G,eACVl0U,IAAbk0U,EACQw8D,GAAoB2B,EAAev3K,EAAQ41K,GAEhD2B,EAAev3K,EAAQo5G,IA2BlCp2U,OAAOC,eAAeH,EAAS,aAAA,CAAgBI,OAAO,oDCt0B1D,MAAAu2Y,EAAA,IAAAtrS,KACA,IAAA5yB,EACA,KAAA4yB,EAAA15B,QACA8G,EAAA4yB,EAAAgG,OAAAhG,CAAA5yB,GAEA,OAAAA,GAGAm+T,EAAArrS,GAAAA,IACA,mBAAAA,EAAA3oG,OAAAy6N,gBACA,mBAAA9xH,EAAA3oG,OAAAu0J,WACA,mBAAA5rD,EAAAzhB,MAGA8nP,EAAArmO,GAAAA,GAAA,mBAAAA,EAAAsrS,MAAAD,EAAArrS,EAAA9pB,QAEAq1T,EAAAC,GAAAt1T,IACAs1T,EAAAF,KAAAp1T,GACAs1T,EAAAt1T,QAGA0zP,EAAA,IAAA9pO,KAEA,GAAAumO,EAAAvmO,EAAA,IAAA,CACA,MAAA0rS,EAAA1rS,EAAA,GACAA,EAAA,GAAA,IAAA0rS,EAAAt1T,YAEA,GAAAm1T,EAAAvrS,EAAA,IAAA,CACA,MAAA5pB,EAAA4pB,EAAA,GACAA,EAAA,GAAA,IAAA5pB,EAUA,GAPA4pB,EAAA15B,OAAA,GAEAigQ,EAAAvmO,EAAAA,EAAA15B,OAAA,MACA05B,EAAAA,EAAA15B,OAAA,GAAA05B,EAAAA,EAAA15B,OAAA,GAAAklU,MAIAxrS,EAAA15B,OAAA,EAEA,IAAA,IAAAkC,EAAA,EAAAA,EAAAw3B,EAAA15B,OAAA,EAAAkC,IACA+9P,EAAAvmO,EAAAx3B,MACAw3B,EAAAx3B,GAAAijU,EAAAzrS,EAAAx3B,KAKA,OAAA8iU,KAAAtrS,IAGAtrG,EAAAC,QAAAm1U,EACAp1U,EAAAC,QAAAm1U,KAAAA,EACAp1U,EAAAC,QAAA22Y,QAAAA,EACA52Y,EAAAC,QAAA42Y,WAAAA,EACA72Y,EAAAC,QAAA4xU,SAAAA,gCCvDA,aAEA,MAAA2/D,SAAAA,GAAAtxY,EAAA,WACAupU,EAAAvpU,EAAA,2CAQAF,EAAAC,QAAA,EAAA8mU,aAAAA,EAAAD,QAAAA,KAgBA2C,GAZAxpL,eAAAq6E,EAAAh5N,EAAA,IASA,OARAg5N,EAAAk3K,EAAAl3K,IAEA,IAAAh5N,EAAAwlU,SACAA,EAAAxsG,GAKA,CAAAA,IAAAA,EAAA1wH,YAFAm9N,EAAA54O,IAAAmsI,IAEAjhE,KAAAznF,4GCxBA,aAEA,MAAAqlU,EAAA/2Y,EAAA,SACAg3Y,EAAAh3Y,EAAA,aACAi3Y,EAAAj3Y,EAAA,SACAk3Y,EAAAl3Y,EAAA,SACAm3Y,EAAAn3Y,EAAA,QA8BAF,EAAAC,QArBA,MAIAuD,aAAAsjU,QAAAA,EAAAG,OAAAA,EAAAK,IAAAA,EAAAntK,MAAAA,EAAA6sK,KAAAA,EAAA1lU,QAAAA,IACA,MAAAkmU,EAAA0vE,EAAA,CACApwE,QAAAA,EACAG,OAAAA,EACA9sK,MAAAA,EACAmtK,IAAAA,EACAhmU,QAAAA,IAGAqrG,KAAA66N,OAAAA,EACA76N,KAAAhhB,IAAAsrT,EAAA,CAAAzvE,OAAAA,IACA76N,KAAA86N,IAAA0vE,EAAA,CAAAnwE,KAAAA,EAAAF,QAAAA,IACAn6N,KAAAxe,IAAAipT,EAAA,CAAApwE,KAAAA,EAAAF,QAAAA,IACAn6N,KAAA0tH,GAAAg9K,EAAA,CAAArwE,KAAAA,EAAAF,QAAAA,sHChCA,aAEA,MAAAp+O,EAAAxoF,EAAA,WAMAF,EAAAC,QAAA,EAAAunU,OAAAA,KAIAvnL,eAAAyiC,EAAAphL,EAAA,IAEA,MAAAi2E,QAAAmR,EAAA8+O,EAAA9kJ,EAAAphL,IAIA,GAAA,MAAAi2E,EACA,MAAAkuB,MAAA,6DAGA,OAAAluB,kDCtBA,aAEA,MAAAs0K,SAAAA,GAAA3rP,EAAA,wBACAo3Y,EAAAp3Y,EAAA,oDACAq3Y,mBAAAA,GAAAr3Y,EAAA,YACAk1U,KAAAA,GAAAl1U,EAAA,WACAupU,EAAAvpU,EAAA,2CACAg3L,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IAiBA77N,EAAAC,QAAA,EAAAk6J,MAAAA,EAAA8sK,OAAAA,EAAAH,QAAAA,EAAAQ,IAAAA,EAAAhmU,QAAAA,MACA,MAAAk2Y,EAAAl2Y,GAAAA,EAAAm2Y,SA0FA,OAAAhuE,GArFAxpL,gBAAAv+D,EAAApgF,EAAA,IACA,MAAAosK,EAAAwpB,EAAA,CACAwgN,oBAAAF,EAAA,IAAAx+R,EAAAA,EACA2+R,SAAA,YACAr2Y,EAAA,IACAi2Y,EAAAj2Y,EAAAs2Y,WAIAlqO,EAAA27J,SAAA,aAAA37J,EAAA27J,SAAA,IAAA37J,EAAAggM,aACAhgM,EAAAggM,WAAA,GAGAhgM,EAAAmqO,UACAnqO,EAAAiqO,SAAA,WAGA,YAAAjqO,EAAAiqO,WACAjqO,EAAAoqO,SAAA,MACApqO,EAAAqqO,wBAAA,GAGArqO,EAAAggM,WAAA,QAAArrW,IAAAqrK,EAAAsqO,YAGAtqO,EAAAsqO,WAAA,QAGA31Y,IAAAqrK,EAAA27J,cAAAhnU,IAAAqrK,EAAAsqO,YAGAtqO,EAAAsqO,WAAA,UAGAtqO,EAAAmqO,QAGA,MAAAI,EAAA,GAEA,GAAAvqO,EAAA8oO,SAAA,CACA,MAAA0B,EAAAxqO,EAAA8oO,SAMA9oO,EAAA8oO,SAAA,CAAAlxK,EAAAhmO,KACA24Y,EAAA34Y,KACA24Y,EAAA34Y,GAAA,GAGA24Y,EAAA34Y,IAAAgmO,EAEA4yK,EAAAD,EAAA34Y,GAAAA,IAIA,MAAA83J,EAAAg+K,EACAkiE,EAAA51T,IAIAA,GAAAmqK,EAAAnqK,EAAAy4E,EAAA,IACAuT,EACA45J,KAAA,KA2BA,SAAA55J,GAIAztB,eAAAk4P,EAAAz2T,GACA,UAAA,MAAA+rB,KAAA/rB,EAAA,CACA,IAAA44I,EAAA7sH,EAAA6sH,IAEA,IAAA5sD,EAAAggM,aACApzI,EAAAA,EAAA86I,QAGA,IAAA91W,EAAAmuG,EAAAnuG,KAAAmuG,EAAAnuG,KAAAg7N,EAAAvvH,WAEA2iE,EAAA0qO,oBAAA3qS,EAAAnuG,OACAA,EAAA,SAGA,CACAA,KAAAA,EACAg7N,IAAAA,EACA1wH,KAAA6D,EAAA7D,KACAviB,KAAAomB,EAAA28N,QAAA38N,EAAA28N,OAAA/iP,KACAijP,MAAA78N,EAAA28N,QAAA38N,EAAA28N,OAAAE,QAKA,OAAA6tE,EArDAA,CAAAzqO,GA4DA,SAAAo5J,EAAAp5J,GAIAztB,eAAAo4P,EAAA32T,GACA,UAAA,MAAA+rB,KAAA/rB,EAAA,GACA+rB,EAAAnuG,MAAAouK,EAAA0qO,kBACA,KAAA3qS,EAAAnuG,MACAmuG,EAAAnuG,KAAA87E,SAAA,QAEAsyF,EAAA4qO,WAAA,IAAA5qO,EAAAo5J,SAGAA,EAAAr5N,EAAA6sH,WAGA7sH,GAIA,OAAA4qS,EA/EAE,CAAAzxE,EAAAp5J,GAsFA,SAAA45J,EAAA55J,GAIAztB,eAAAu4P,EAAA92T,GACA,UAAA,MAAA+rB,KAAA/rB,EAAA,CAGA,MAAA+2T,IAAAhrS,EAAAnuG,MAAAmuG,EAAAnuG,KAAA87E,SAAA,OACA,MAAAsyF,EAAA45J,KAAA55J,EAAA45J,MAAAmxE,IAAA/qO,EAAA4qO,gBAKAhxE,EAAA37O,IAAA8hB,EAAA6sH,IAAA,CACAwsG,SAAA,EACAwvC,MAAA,UAIA7oQ,GAIA,OAAA+qS,EA7GAE,CAAApxE,EAAA55J,IAGAkwD,QAAAqpG,EAAAsvC,WAEA,IACA,UAAA,MAAAoiC,KAAAvhP,SAEA6gP,EAAAU,EAAAr5Y,YAEAq5Y,EAEA,QACA/6K,6OC/GA,aAEA,MAAAg7K,EAAA14Y,EAAA,qBACA00J,EAAA10J,EAAA,aAiEAF,EAAAC,QAAA,CACA4rP,SAzCA5rG,gBAAAv+D,EAAAy4E,EAAA74J,EAAA,IACA,MAAAosK,EAAA9Y,EAAAtzJ,GAEA,IAAAu3Y,EAQAC,EASAC,EAdAF,EADA,mBAAAv3Y,EAAAu3Y,WACAv3Y,EAAAu3Y,WAEA34Y,EAAA,iBAMA44Y,EADA,mBAAAx3Y,EAAAw3Y,YACAx3Y,EAAAw3Y,YAEA54Y,EAAA,kBAQA64Y,EAFAl2Y,OAAAy6N,iBAAA57I,GAAA7+E,OAAAu0J,YAAA11E,EAEAA,EAGA,CAAAA,GAGA,UAAA,MAAAghG,KAAAo2N,EAAAF,EAAAC,EAAAE,EAAA5+O,EAAAuT,GAAAA,EAAAsrO,uBAAA7+O,EAAAuT,QACA,CACA4sD,IAAA53C,EAAA43C,IACAh7N,KAAAojL,EAAApjL,KACA8qU,OAAA1nJ,EAAA0nJ,OACAxgO,KAAA84E,EAAA94E,oIC/DA,aAEA,MAAAw8R,EAAAlmY,EAAA,YA4CAF,EAAAC,QAvBAggJ,gBAAAv+D,EAAAkoB,EAAA,GACA,UAAA,MAAAqvS,KAAA7S,EAAA1kT,EAAAkoB,GAAA,CAEA,MAAAsvS,EAAAD,EAAAliU,KAIAlD,GACAA,IAAA+2B,MAAAvqG,IAAA,CAAAw8N,IAAA,EAAAx8N,MAAAA,MAAA+lG,IAAA,CAAAy2H,IAAA,EAAAz2H,IAAAA,QAGA,IAAA,IAAAtyB,EAAA,EAAAA,EAAAolU,EAAAtnU,OAAAkC,IAAA,CACA,MAAAyD,QAAA2hU,EAAAplU,GAEA,IAAAyD,EAAAslJ,GAGA,MAAAtlJ,EAAA6uB,UAFA7uB,EAAAl3E,yDCtCA,aAoCAL,EAAAC,QAzBAggJ,gBAAAv+D,EAAAkoB,EAAA,GAEA,IAAAsvS,EAAA,GAEAtvS,EAAA,IACAA,EAAA,GAGA,UAAA,MAAAsxO,KAAAx5P,EAGA,IAFAw3T,EAAAzhU,KAAAyjQ,GAEAg+D,EAAAtnU,QAAAg4B,SACAsvS,EAAAnnU,MAAA,EAAA63B,GAEAsvS,EAAAA,EAAAnnU,MAAA63B,GAIA,KAAAsvS,EAAAtnU,cACAsnU,EAAAnnU,MAAA,EAAA63B,GAEAsvS,EAAAA,EAAAnnU,MAAA63B,kCChCA,aAEA,MAAAstF,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IACAb,EAAA96N,EAAA,sBA+BA,MAAA00J,EAAA,CACAgjP,QAAA,QACAD,SAAA,WACAK,WAAA,EACAM,UAAA,EACAP,wBAAA,EACA1uE,QAAA,WACAyuE,SAAA,OACApqC,WAAA,EACA8oC,SAAA,IAAA,OACAkB,oBAAA,IACAsB,sBAAA,GACAG,sBAAA,GACAC,aAAA,OACAC,aAAA,OACAC,aAAA,OACAptS,OAAA,GAGAqtS,WAAA,iBACAC,mBAAA,IACAC,YAAA,EACArB,mBAAA,EACA9wE,KAAA,EACAipC,WAAA,EACAmpC,QAAA,EACA5yE,SAAA,EACArvJ,aAAAp1K,EACAs3Y,WAtDA15P,eAAAi9E,GACA,MAMA08K,SANA5+K,EAAAkC,EAAA,gBAMAnrJ,MAAA,EAAA,IACAH,EAAAgoU,EAAAhoU,OACA2F,EAAA,IAAA6tJ,WAAAxzJ,GAEA,IAAA,IAAAkC,EAAA,EAAAA,EAAAlC,EAAAkC,IACAyD,EAAA3F,EAAAkC,EAAA,GAAA8lU,EAAA9lU,GAGA,OAAAyD,GAwCAsiU,aAAA,GACAC,eAAA,GAOA95Y,EAAAC,QAAA,SAAAqB,EAAA,IACA,OAAA41L,EAAAtiC,EAAAtzJ,sFCxEA,aAEA,MAAAy4Y,EAAA75Y,EAAA,SACA85Y,EAAA95Y,EAAA,UACAupT,EAAAvpT,EAAA,YA8BA,SAAA+5Y,EAAAvmU,GACA,IACA,GAAAA,aAAA0xJ,WACA,OAAAnlF,wBACAvsE,EADA,GAGA,GAtBAwnQ,EAsBAxnQ,EArBA7wE,OAAAu0J,YAAA8jL,EAsBA,OAAAj7L,wBACAvsE,EADA,GAGA,GAlBA,SAAAwnQ,GACA,OAAAr4U,OAAAy6N,iBAAA49G,EAiBAr9G,CAAAnqJ,GACA,OAAAA,EAEA,MACA,MAAA+1O,EAAA,IAAAhkN,MAAA,uBAAA,uBA9BA,IAAAy1O,EAiCA,MAAAzxB,EAAA,IAAAhkN,MAAA,uBAAA,uBAoEAzlG,EAAAC,QA9DAggJ,gBAAAv+D,EAAAy4E,EAAA74J,GACA,UAAA,MAAAohL,KAAAhhG,EAYA,GAXAghG,EAAApjL,OACA,OAAAojL,EAAApjL,KAAAmpG,UAAA,EAAA,KACAnnG,EAAA82Y,mBAAA,GAGA11N,EAAApjL,KAAAojL,EAAApjL,KACAmtF,MAAA,KACA/R,QAAAp7E,GAAAA,GAAA,MAAAA,IACA23E,KAAA,MAGAyrG,EAAAhvG,QAAA,CAIA,IAAAkkU,EAaAsC,EAVAtC,EADA,mBAAAt2Y,EAAAs2Y,QACAt2Y,EAAAs2Y,QACA,UAAAt2Y,EAAAs2Y,QACA13Y,EAAA,oBAEAA,EAAA,yBASAg6Y,EADA,mBAAA54Y,EAAA44Y,eACA54Y,EAAA44Y,eAEAh6Y,EAAA,qBAIA,MAAAutG,EAAA,CACAnuG,KAAAojL,EAAApjL,KACAgrU,MAAA5nJ,EAAA4nJ,MACAjjP,KAAAq7F,EAAAr7F,KACA3T,QAAAkkU,EAAAsC,EAAAD,EAAAv3N,EAAAhvG,SAAApyE,GAAAA,SAGA,IAAA04Y,EAAAvsS,EAAA0sD,EAAA74J,OACA,CAAA,IAAAohL,EAAApjL,KAUA,MAAA,IAAAmmG,MAAA,sDAVA,CAEA,MAAA7rB,EAAA,CACAt6E,KAAAojL,EAAApjL,KACAgrU,MAAA5nJ,EAAA4nJ,MACAjjP,KAAAq7F,EAAAr7F,WAGA,IAAA0yT,EAAAngU,EAAAugF,EAAA74J,8KChHA,aAEA,MAAA6iU,OAAAA,GAAAjkU,EAAA,eACAi6Y,EAAAj6Y,EAAA,qBACAgkU,QACAA,GACAhkU,EAAA,eA4BAF,EAAAC,QAnBAggJ,MAAAr4C,EAAAuyD,EAAA74J,KACA,MAAA8oU,EAAA,IAAAjG,EAAA,CACA1wP,KAAA,YACA62P,MAAA1iO,EAAA0iO,MACAjjP,KAAAugB,EAAAvgB,OAGAm1H,EAAA,IAAA0nH,EAAAkG,EAAAh9C,WAAAm+E,YAIA,MAAA,CACAjxI,UAJA6/K,EAAA39L,EAAAriD,EAAA74J,GAKAhC,KAJAsoG,EAAAtoG,KAKA8qU,OAAAA,EACAxgO,KAAA4yG,EAAA5qI,6GC9BA,aAEA,MAAA8yJ,EAAAxkO,EAAA,sBACAg7N,EAAAh7N,EAAA,QAyCAF,EAAAC,QAlCAggJ,MAAAu8D,EAAAriD,EAAA74J,KACAA,EAAAgmO,QACAhmO,EAAAgmO,MAAA,UAGAhmO,EAAAosW,aACApsW,EAAAosW,WAAA,GAGApsW,EAAA+nU,UACA/nU,EAAA+nU,QAAA,YAGA,aAAA/nU,EAAA+nU,UACA/nU,EAAAosW,WAAA,GAGA,MAAAzyI,QAAAyJ,EAAAloB,EAAAl7M,EAAA+nU,SACA/uG,EAAA,IAAAY,EAAA55N,EAAAosW,WAAApsW,EAAAgmO,MAAArM,GAaA,OAXA35N,EAAAg3Y,gBAEAn+O,EAAA6jE,IAAAxhB,EAAA,CAEA8qH,IAAAhmU,EAAAgmU,IACAR,QAAAxlU,EAAAwlU,QACArvJ,QAAAn2K,EAAAm2K,QACA6iD,IAAAA,IAIAA,wECzCA,aAEA,MAAAmvF,EAAAvpT,EAAA,aACAikU,OAAAA,GAAAjkU,EAAA,eACAi6Y,EAAAj6Y,EAAA,wBACAgkU,QACAA,EAAA2mC,QACAA,GACA3qW,EAAA,eACA04Y,EAAA14Y,EAAA,qBACAwkO,EAAAxkO,EAAA,sBAAA+6N,UAcAm/K,EAAA,CACApoL,KAAA9xN,EAAA,UACAm6Y,SAAAn6Y,EAAA,cACA23Y,QAAA33Y,EAAA,cAsJAF,EAAAC,QAVA,SAAAwtG,EAAA0sD,EAAA74J,GACA,MAAAu3Y,EAAAuB,EAAA94Y,EAAAq2Y,UAEA,IAAAkB,EACA,MAAApvF,EAAA,IAAAhkN,MAAA,yCAAAnkG,EAAAq2Y,YAAA,oBAGA,OAAAkB,EA3IA54P,gBAAAxyC,EAAA0sD,EAAA74J,GACA,IACAg5Y,EACAC,EAFArqT,GAAA,EAKAqqT,EADA,mBAAAj5Y,EAAAi5Y,eACAj5Y,EAAAi5Y,eAEAr6Y,EAAA,qBAGA,UAAA,MAAAwiL,KAAAk2N,EAAA2B,EAAA9sS,EAAA0sD,EAAA74J,GAAAA,EAAA63Y,uBACAjpT,IAEA,IAAAA,GAGA,IAAAA,GAAAoqT,UACAA,EACAA,EAAA,YAGA53N,GAPA43N,EAAA53N,EAUA43N,IACAA,EAAAE,QAAA,QACAF,GAgHAG,CAAAhtS,EAAA0sD,EAAA74J,GAvGA,EAAAmsG,EAAA0sD,EAAA74J,IAIA2+I,eAAAy6P,GACA,GAAA,IAAAA,EAAA9oU,QAAA8oU,EAAA,GAAAF,QAAAl5Y,EAAAy2Y,uBAAA,CACA,MAAA4C,EAAAD,EAAA,GAEA,GAAA,QAAAC,EAAArgL,IAAAgN,aAAAjlO,IAAAorG,EAAA68N,YAAAjoU,IAAAorG,EAAApmB,MAAA,CAGA,IAAAgyE,KAAAmjD,SAAAriD,EAAAhsE,IAAAwsT,EAAArgL,IAAAh5N,GAEAq5Y,EAAAvwE,OAAA,IAAAjG,EAAA,CACA1wP,KAAA,OACA62P,MAAA78N,EAAA68N,MACAjjP,KAAAomB,EAAApmB,KACAgyE,KAAAmjD,IAGA,MAAAye,EAAAyJ,EAAA3zH,OAAA4pS,EAAArgL,IAAAW,WACAze,EAAA,IAAA0nH,EAAAy2E,EAAAvwE,OAAAh9C,WAAAm+E,YAEAovC,EAAArgL,UAAA6/K,EAAA39L,EAAAriD,EAAA,IACA74J,EACAgmO,MAAA,SACA+hG,QAAApuG,EAAAz7N,KACAkuW,WAAApsW,EAAAosW,aAEAitC,EAAA/wS,KAAA4yG,EAAA5qI,OAGA,MAAA,CACA0oJ,IAAAqgL,EAAArgL,IACAh7N,KAAAmuG,EAAAnuG,KACA8qU,OAAAuwE,EAAAvwE,OACAxgO,KAAA+wS,EAAA/wS,MAKA,MAAAykD,EAAA,IAAA81K,EAAA,CACA1wP,KAAA,OACA62P,MAAA78N,EAAA68N,MACAjjP,KAAAomB,EAAApmB,OAGAqkR,EAAAgvC,EACAhgU,QAAAigU,KACA,QAAAA,EAAArgL,IAAAgN,QAAAqzK,EAAA/wS,UAIA+wS,EAAAvwE,QAAAuwE,EAAAvwE,OAAA/wK,OAAAshP,EAAAvwE,OAAAC,aAIArgP,QAAA2wT,EAAAvwE,QAAAuwE,EAAAvwE,OAAA/wK,MAAAshP,EAAAvwE,OAAA/wK,KAAAznF,UAEAmF,KAAA4jU,GACA,QAAAA,EAAArgL,IAAAgN,OAEAj5E,EAAAusP,aAAAD,EAAA/wS,MAEA,IAAAihQ,EAAA,GAAA8vC,EAAA/wS,KAAA+wS,EAAArgL,OAGAqgL,EAAAvwE,QAAAuwE,EAAAvwE,OAAA/wK,KAKAhL,EAAAusP,aAAAD,EAAAvwE,OAAA/wK,KAAAznF,QAHAy8E,EAAAusP,aAAAD,EAAAvwE,QAAAuwE,EAAAvwE,OAAAC,YAAA,GAMA,IAAAwgC,EAAA,GAAA8vC,EAAA/wS,KAAA+wS,EAAArgL,QAGA1mJ,EAAA,IAAAswP,EAAA71K,EAAA++H,UAAAs+E,GACAlvJ,EAAA5oI,EAAA23R,YAGA,MAAA,CACAjxI,UAHA6/K,EAAA39L,EAAAriD,EAAA74J,GAIAhC,KAAAmuG,EAAAnuG,KACA8qU,OAAA/7K,EACAzkD,KAAA4yG,EAAA5qI,OAAAgC,EAAAq3R,MAAA54R,QAAA,CAAA2wK,EAAArpF,IAAAqpF,EAAArpF,EAAAgyM,OAAA,KAiBAt5R,CAAAo7B,EAAA0sD,EAAA74J,GAAAA,6QC9KA,aAEA,MAAA+xN,EAAAnzN,EAAA,UAKAF,EAAAC,QAAAggJ,eAAAv+D,EAAArP,GACA,OAAAA,QAAAghJ,EAAA3xI,iDCRA,aAEA,MAAA0kT,EAAAlmY,EAAA,YAgBA+/I,eAAA46P,EAAAn5T,EAAArP,EAAA/wE,GACA,MAAAitP,EAAA,GAEA,UAAA,MAAAusJ,KAAA1U,EAAA1kT,EAAApgF,EAAAk4Y,oBACAjrJ,EAAA92K,WAAApF,EAAAyoU,IAGA,OAAAvsJ,EAAA38K,OAAA,EACAipU,EAAAtsJ,EAAAl8K,EAAA/wE,GAGAitP,EAAA,GAGAvuP,EAAAC,QArBA,SAAAyhF,EAAArP,EAAA/wE,GACA,OAAAu5Y,EAAAn5T,EAAArP,EAAA/wE,oDCZA,aAEA,MAAA8kY,EAAAlmY,EAAA,YAeAF,EAAAC,QAAAggJ,eAAAv+D,EAAArP,EAAA/wE,GACA,MAAA8rF,EAAA,IAAA2tT,EAAAz5Y,EAAAm4Y,aACA,IAAAuB,EAAA,EACAzN,EAAA,EAGA3kN,EAAAx7F,EAEA,UAAA,MAAA6tT,KAAA7U,EAAA1kT,EAAApgF,EAAAk4Y,oBACA5wN,EAAAsyN,WACAtyN,IAAAx7F,GACAA,EAAA+tT,eAAAvyN,EAAAv2G,OAAAA,IAGA2oU,GAAAA,EAAA15Y,EAAAm4Y,aAAA,GACAlM,IAGA3kN,EAAA,IAAAwyN,EAAA7N,EAAAjsY,EAAAm4Y,YAAAuB,GAEAA,KAGApyN,EAAAyyN,OAAAJ,GAOA,OAJAryN,GAAAA,IAAAx7F,GACAA,EAAA+tT,eAAAvyN,EAAAv2G,OAAAA,IAGA+a,EAAA/a,OAAAA,IAGA,MAAA+oU,EAMA53Y,YAAA+pY,EAAAkM,EAAAuB,EAAA,GACAruS,KAAA4gS,SAAAA,EACA5gS,KAAA8sS,YAAAA,EACA9sS,KAAA2uS,aAAA,EACA3uS,KAAAquS,UAAAA,EAGAruS,KAAAvf,KAAAuf,KAAA/4B,KAAA+4B,KAAAv5B,OAAA,CACA8C,SAAA,GACA0uI,MAAAj4G,KAAA2uS,aACA/N,SAAAA,EACAgO,aAAA5uS,KAAA4gS,SAAA5gS,KAAA2uS,cAAA3uS,KAAA8sS,aAIAj2Y,SACA,IAAAmpG,KAAAvf,KAAAisE,KACA,OAAA,EAGA,GAAA1sD,KAAA2uS,aAAA3uS,KAAA4gS,UAAA5gS,KAAA/4B,KAAA2nU,YAIA,OAFA5uS,KAAA6uS,qBAAA7uS,KAAA/4B,OAEA,EAIA,MAAA6nU,EAAA9uS,KAAA+uS,YAAA/uS,KAAA/4B,KAAA+4B,KAAA2uS,cAEA,OAAAG,IACA9uS,KAAA6uS,qBAAAC,IAEA,GASAj4Y,qBAAA4vE,GACAu5B,KAAAv5B,OAAAA,EAGA,MAAAioH,EAAA,CACAnlH,SAAA,GACA0uI,MAAAxxI,EAAAwxI,MAAA,EACAxxI,OAAAA,EACAm6T,SAAA5gS,KAAA4gS,SACAgO,YAAAhpU,KAAA6nC,MAAAhnC,EAAA8C,SAAAtE,OAAA+6B,KAAA8sS,aAAA9sS,KAAA8sS,aAIArmU,EAAA8C,SAAAuB,KAAA4jH,GAEA1uF,KAAA2uS,aAAAjgN,EAAAupB,MACAj4G,KAAA/4B,KAAAynH,EAOA73L,OAAAy3Y,GACAtuS,KAAA/4B,KAAAylF,KAAA4hP,EAMAz3Y,OAAA6uE,GACA,OAAAs6B,KAAAynS,QAAAznS,KAAAvf,KAAA/a,GAQA7uE,cAAAowE,EAAAvB,GAEA,IAAA6D,EAAA,GAYA,OAVAtC,EAAAsC,SAAAtE,SACAsE,QAAAw8F,QAAA2gD,IACAz/I,EAAAsC,SAEAwE,QAAArD,GAAAA,EAAAgiF,OAEAtiF,KAAAM,GAAAs1B,KAAAynS,QAAA/8T,EAAAhF,OAIAA,GAAAuB,EAAAylF,MAAA,IAAA76D,OAAAtoB,IAQA1yE,YAAAowE,EAAAgxI,GACA,MAAAxxI,EAAAQ,EAAAR,OAEA,GAAAA,GAAA,IAAAA,EAAAwxI,MAIA,OAAAxxI,EAAA8C,SAAAtE,SAAAwB,EAAAmoU,aAAAnoU,EAAAmoU,YAKAnoU,EAHAu5B,KAAA+uS,YAAAtoU,EAAAwxI,IAOA,MAAAm2L,UAAAK,EAIA53Y,YAAAi2Y,GACAvnR,MAAA,EAAAunR,GAEA9sS,KAAAvf,KAAAw3H,MAAA,EACAj4G,KAAA2uS,aAAA,EAMA93Y,SAAA6zE,GACAs1B,KAAAvf,KAAAlX,SAAAuB,KAAAJ,GAMA7zE,OAAA6uE,GACA,OAAAA,GAAAs6B,KAAAvf,KAAAisE,MAAA,IAAA76D,OAAAmO,KAAAvf,KAAAlX,6DCrMA,aAEA,MAAAiuP,OAAAA,GAAAjkU,EAAA,eACAi6Y,EAAAj6Y,EAAA,wBACAgkU,QACAA,GACAhkU,EAAA,eA8CAF,EAAAC,QArCAggJ,gBAAAxyC,EAAA0sD,EAAA74J,GACA,UAAA,IAAAk7M,KAAA/uG,EAAA/5B,cACAusE,UAEA,IAAAmqL,EADA9oU,EAAAk1Y,SAAAh6L,EAAA5qI,OAAA67B,EAAAnuG,MAIA,MAAAouK,EAAA,CACA45D,MAAA,SACAomI,WAAApsW,EAAAosW,WACArkC,QAAA/nU,EAAA+nU,QACAivE,SAAAh3Y,EAAAg3Y,UAiBA,OAdAh3Y,EAAA02Y,WACAtqO,EAAA45D,MAAA,MACA55D,EAAAggM,WAAA,IAEAtjC,EAAA,IAAAjG,EAAA,CACA1wP,KAAAnyE,EAAAw2Y,SACAz+O,KAAAmjD,EACA8tH,MAAA78N,EAAA68N,MACAjjP,KAAAomB,EAAApmB,OAGAm1H,EAAA,IAAA0nH,EAAAkG,EAAAh9C,WAAAm+E,aAGA,CACAjxI,UAAA6/K,EAAA39L,EAAAriD,EAAAuT,GACA08J,OAAAA,EACAxgO,KAAA4yG,EAAA5qI,iHC9CA,aAGA,MAAAq/P,EAAA/wU,EAAA,kBAEAW,OAAAA,GAAAX,EAAA,cACA0rP,EAAA1rP,EAAA,YAcAF,EAAAC,QAAAggJ,gBAAAv+D,EAAApgF,GACA,IAAAslG,EAAAt0B,EAAAi2L,EAEA,GAAAjnQ,EAAA83Y,cAAA93Y,EAAA+3Y,cAAA/3Y,EAAAg4Y,aACA/wI,EAAAjnQ,EAAAg4Y,aACA1yS,EAAAtlG,EAAA83Y,aACA9mU,EAAAhxE,EAAA+3Y,iBACA,CAAA,IAAA/3Y,EAAAg4Y,aACA,MAAA1tJ,EAAA,IAAAnmJ,MAAA,wCAAA,8BAEA8iK,EAAAjnQ,EAAAg4Y,aACA1yS,EAAA2hK,EAAA,EACAj2L,EAAAi2L,EAAAA,EAAA,EAIA,GAAA3hK,EAAA,GACA,MAAAglJ,EAAA,IAAAnmJ,MAAA,qCAAA,8BAGAnzB,EAAAs0B,IACAt0B,EAAAs0B,GAGA2hK,EAAA3hK,IACA2hK,EAAA3hK,GAGA,MAAA+0S,EAAAppU,KAAA6nC,MAAA7nC,KAAAqpU,KAAArzI,IAEA,UAAA,MAAAnsJ,KAeA6jC,gBAAAv+D,EAAApgF,GACA,MAAAq5G,QAAA95G,EAAAS,EAAAylO,KAAAzlO,EAAAslG,IAAAtlG,EAAAgxE,IAAAhxE,EAAA4qG,QACA2vS,EAAA,IAAA5qE,EAEA,UAAA,MAAA70N,KAAA16B,EAAA,CACAm6T,EAAAR,OAAAj/R,GAEA,MAAAouO,EAAA7vO,EAAAmhS,YAAA1/R,GAEA,IAAA,IAAAtoC,EAAA,EAAAA,EAAA02Q,EAAA54Q,OAAAkC,IAAA,CACA,MAAA81B,EAAA4gP,EAAA12Q,GACAopJ,EAAA2+K,EAAA9pU,MAAA,EAAA63B,GACAiyS,EAAAhnE,QAAAjrO,SAEAszH,GAIA2+K,EAAAjqU,eACAiqU,EAAA9pU,MAAA,IAlCAgqU,CAAAr6T,EAAA,CACAklB,IAAAA,EACAt0B,IAAAA,EACAy0J,KAAA40K,EACAzvS,OAAA5qG,EAAA4qG,OACAqtS,WAAAj4Y,EAAAi4Y,mBAEAn9R,gGCzDA,0BAEQwzI,GAAW1vP,EAAQ,UACrBijO,EAAStgO,OAAOugP,IAAI,cAE1B,SAAA6tF,EAAqB/zG,QACbvwH,gBAAgBskO,cACTA,EAAW/zG,GAGxB+zG,EAAWviE,MAAMnkK,KAAKoC,KAAMuwH,GAG9B+zG,EAAWviE,MAAQ,SAAgBxxC,GACjC/8N,OAAOC,eAAeusG,KAAMw2H,EAAAA,CAAU9iO,OAAO,IAE7CssG,KAAKqvS,MAAAA,GACLrvS,KAAK/6B,OAAS,EAEVsrJ,GACFvwH,KAAK0uS,OAAOn+K,IAIhB+zG,EAAW3mO,UAAUoY,KAAO,SAAew6G,cAC9B+zG,EAAW/zG,IAGxB+zG,EAAW3mO,UAAU2xS,QAAU,SAAkBvqU,MAChC,IAAXA,SACM,EAAG,OAGTwqU,EAAM,UAEDpoU,EAAI,EAAGA,EAAI64B,KAAKqvS,MAAMpqU,OAAQkC,IAAAA,OAC/BqoU,EAAKD,EAAMvvS,KAAKqvS,MAAMloU,GAAGlC,UAC3BF,EAASyqU,GAAMroU,IAAM64B,KAAKqvS,MAAMpqU,OAAS,SACnCkC,EAAGpC,EAASwqU,GAEtBA,EAAMC,IAIVlrE,EAAW3mO,UAAU8xS,eAAiB,SAAUC,SACxChc,EAAWgc,EAAS,OACtB3qU,EAAS2qU,EAAS,WAEbvoU,EAAI,EAAGA,EAAIusT,EAAUvsT,IAC5BpC,GAAUi7B,KAAKqvS,MAAMloU,GAAGlC,cAGnBF,GAGTu/P,EAAW3mO,UAAUnc,IAAM,SAAcjc,MACnCA,EAAQy6B,KAAK/6B,QAAUM,EAAQ,eAI7BR,EAASi7B,KAAKsvS,QAAQ/pU,UAErBy6B,KAAKqvS,MAAMtqU,EAAO,IAAIA,EAAO,KAGtCu/P,EAAW3mO,UAAUv4B,MAAQ,SAAgB4P,EAAOhQ,SAC7B,iBAAVgQ,GAAsBA,EAAQ,IACvCA,GAASgrB,KAAK/6B,QAGG,iBAARD,GAAoBA,EAAM,IACnCA,GAAOg7B,KAAK/6B,QAGP+6B,KAAK/iG,KAAK,KAAM,EAAG+3E,EAAOhQ,IAGnCs/P,EAAW3mO,UAAU1gG,KAAO,SAAe8nP,EAAK4qJ,EAAUC,EAAUC,OAC1C,iBAAbD,GAAyBA,EAAW,KAC7CA,EAAW,IAGS,iBAAXC,GAAuBA,EAAS7vS,KAAK/6B,UAC9C4qU,EAAS7vS,KAAK/6B,QAGZ2qU,GAAY5vS,KAAK/6B,cACZ8/K,GAAO9B,EAAOO,MAAM,MAGzBqsJ,GAAU,SACL9qJ,GAAO9B,EAAOO,MAAM,SAGvBvmP,IAAS8nP,EACTxvB,EAAMv1H,KAAKsvS,QAAQM,GACnBxsS,EAAMysS,EAASD,MACjBj3K,EAAQv1H,EACR0sS,EAAU7yY,GAAQ0yY,GAAa,EAC/B36T,EAAQugJ,EAAI,MAGC,IAAbq6K,GAAkBC,IAAW7vS,KAAK/6B,OAAAA,KAC/BhoE,SAE0B,IAAtB+iG,KAAKqvS,MAAMpqU,OACd+6B,KAAKqvS,MAAM,GACXpsJ,EAAOpxJ,OAAOmO,KAAKqvS,MAAOrvS,KAAK/6B,gBAI5BkC,EAAI,EAAGA,EAAI64B,KAAKqvS,MAAMpqU,OAAQkC,IACrC64B,KAAKqvS,MAAMloU,GAAGlqE,KAAK8nP,EAAK+qJ,GACxBA,GAAU9vS,KAAKqvS,MAAMloU,GAAGlC,cAGnB8/K,KAILpsB,GAAS34H,KAAKqvS,MAAM95K,EAAI,IAAItwJ,OAAS+P,SAChC/3E,EACH+iG,KAAKqvS,MAAM95K,EAAI,IAAIt4N,KAAK8nP,EAAK4qJ,EAAU36T,EAAOA,EAAQ2jJ,GACtD34H,KAAKqvS,MAAM95K,EAAI,IAAInwJ,MAAM4P,EAAOA,EAAQ2jJ,GAGzC17N,IAEH8nP,EAAM9B,EAAOiE,YAAY9jJ,YAGlBj8B,EAAIouJ,EAAI,GAAIpuJ,EAAI64B,KAAKqvS,MAAMpqU,OAAQkC,IAAAA,OACpC4hB,EAAIiX,KAAKqvS,MAAMloU,GAAGlC,OAAS+P,OAE7B2jJ,EAAQ5vI,IAIViX,KAAKqvS,MAAMloU,GAAGlqE,KAAK8nP,EAAK+qJ,EAAQ96T,EAAOA,EAAQ2jJ,GAC/Cm3K,GAAU/mT,QAJViX,KAAKqvS,MAAMloU,GAAGlqE,KAAK8nP,EAAK+qJ,EAAQ96T,GAChC86T,GAAU/mT,EAOZ4vI,GAAS5vI,EAEL/T,IACFA,EAAQ,UAKR+vK,EAAI9/K,OAAS6qU,EAAe/qJ,EAAI3/K,MAAM,EAAG0qU,GAEtC/qJ,GAGTu/E,EAAW3mO,UAAUoyS,aAAe,SAAuB/6T,EAAOhQ,MAChEgQ,EAAQA,GAAS,EACjBhQ,EAAqB,iBAARA,EAAmBg7B,KAAK/6B,OAASD,EAE1CgQ,EAAQ,IACVA,GAASgrB,KAAK/6B,QAGZD,EAAM,IACRA,GAAOg7B,KAAK/6B,QAGV+P,IAAUhQ,SACLg7B,KAAK+V,aAGRr2B,EAAcsgB,KAAKsvS,QAAQt6T,GAC3Bg7T,EAAYhwS,KAAKsvS,QAAQtqU,GACzBkqU,EAAUlvS,KAAKqvS,MAAMjqU,MAAMsa,EAAY,GAAIswT,EAAU,GAAK,UAE3C,IAAjBA,EAAU,GACZd,EAAQjxT,MAERixT,EAAQA,EAAQjqU,OAAS,GAAKiqU,EAAQA,EAAQjqU,OAAS,GAAGG,MAAM,EAAG4qU,EAAU,IAGxD,IAAnBtwT,EAAY,KACdwvT,EAAQ,GAAKA,EAAQ,GAAG9pU,MAAMsa,EAAY,KAGrCsgB,KAAK+V,KAAKm5R,IAGnB5qE,EAAW3mO,UAAUS,SAAW,SAAmBm+H,EAAUvnJ,EAAOhQ,UAC3Dg7B,KAAK56B,MAAM4P,EAAOhQ,GAAKo5B,SAASm+H,IAGzC+nG,EAAW3mO,UAAUuqO,QAAU,SAAkBvvG,MAE/CA,EAAQ/yJ,KAAKwvT,MAAMz8J,GAEfxyJ,OAAO+4B,MAAMy5H,IAAUA,GAAS,EAAA,OAAU34H,UAEvCA,KAAKqvS,MAAMpqU,QAAAA,MACZ0zJ,GAAS34H,KAAKqvS,MAAM,GAAGpqU,SAKzB+6B,KAAKqvS,MAAM,GAAKrvS,KAAKqvS,MAAM,GAAGjqU,MAAMuzJ,GACpC34H,KAAK/6B,QAAU0zJ,QALfA,GAAS34H,KAAKqvS,MAAM,GAAGpqU,OACvB+6B,KAAK/6B,QAAU+6B,KAAKqvS,MAAM,GAAGpqU,OAC7B+6B,KAAKqvS,MAAM1qS,eAQR3E,MAGTskO,EAAW3mO,UAAUsyS,UAAY,iBACzBhzY,EAAO+iG,KAAK+V,eAET5uC,EAAI,EAAGA,EAAI64B,KAAKqvS,MAAMpqU,OAAQkC,IACrClqE,EAAKyxY,OAAO1uS,KAAKqvS,MAAMloU,WAGlBlqE,GAGTqnU,EAAW3mO,UAAU+wS,OAAS,SAAiBn+K,MAClC,MAAPA,SACKvwH,QAGLuwH,EAAI1gB,OAEN7vG,KAAKkwS,cAAcjtJ,EAAOx5F,KAAK8mE,EAAI1gB,OAAQ0gB,EAAI4N,WAAY5N,EAAI6N,qBACtDvgI,MAAM/gB,QAAQyzI,WACdppJ,EAAI,EAAGA,EAAIopJ,EAAItrJ,OAAQkC,IAC9B64B,KAAK0uS,OAAOn+K,EAAIppJ,YAET64B,KAAKmwS,cAAc5/K,WAEnBppJ,EAAI,EAAGA,EAAIopJ,EAAI8+K,MAAMpqU,OAAQkC,IACpC64B,KAAK0uS,OAAOn+K,EAAI8+K,MAAMloU,QAKL,iBAARopJ,IACTA,EAAMA,EAAInyH,YAGZ4B,KAAKkwS,cAAcjtJ,EAAOx5F,KAAK8mE,WAG1BvwH,MAGTskO,EAAW3mO,UAAUuyS,cAAgB,SAAuB3/K,GAC1DvwH,KAAKqvS,MAAMvkU,KAAKylJ,GAChBvwH,KAAK/6B,QAAUsrJ,EAAItrJ,QAGrBq/P,EAAW3mO,UAAUnyB,QAAU,SAAUygC,EAAQlnC,EAAQw3J,WACtC7mO,IAAb6mO,GAA4C,iBAAXx3J,IACnCw3J,EAAWx3J,EACXA,OAASrvE,GAGW,mBAAXu2G,GAAyBpO,MAAM/gB,QAAQmvB,aACtClH,UAAU,0FACO,iBAAXkH,EAChBA,EAASg3I,EAAOx5F,KAAAA,CAAMx9C,IACK,iBAAXA,EAChBA,EAASg3I,EAAOx5F,KAAKx9C,EAAQswH,GACpBv8H,KAAKmwS,cAAclkS,GAC5BA,EAASA,EAAO7mC,QACPy4B,MAAM/gB,QAAQmvB,EAAO4jG,QAC9B5jG,EAASg3I,EAAOx5F,KAAKx9C,EAAO4jG,OAAQ5jG,EAAOkyH,WAAYlyH,EAAOmyH,YACpD6kB,EAAO8H,SAAS9+I,KAC1BA,EAASg3I,EAAOx5F,KAAKx9C,IAGvBlnC,EAASoB,OAAOpB,GAAU,GAEtBm6B,MAAMn6B,KACRA,EAAS,GAGPA,EAAS,IACXA,EAASi7B,KAAK/6B,OAASF,GAGrBA,EAAS,IACXA,EAAS,GAGW,IAAlBknC,EAAOhnC,cACFF,EAASi7B,KAAK/6B,OAAS+6B,KAAK/6B,OAASF,QAGxC2qU,EAAW1vS,KAAKsvS,QAAQvqU,OAC1BqrU,EAAUV,EAAS,GACnBW,EAAaX,EAAS,QAGnBU,EAAUpwS,KAAKqvS,MAAMpqU,OAAQmrU,IAAAA,OAC5B9vF,EAAOtgN,KAAKqvS,MAAMe,QAEjBC,EAAa/vF,EAAKr7O,QAAAA,IACCq7O,EAAKr7O,OAASorU,GAEfpkS,EAAOhnC,OAAAA,OACtBqrU,EAAqBhwF,EAAK90O,QAAQygC,EAAQokS,OAEpB,IAAxBC,SACKtwS,KAAKyvS,eAAAA,CAAgBW,EAASE,IAGvCD,EAAa/vF,EAAKr7O,OAASgnC,EAAOhnC,OAAS,aAErCsrU,EAAYvwS,KAAKyvS,eAAAA,CAAgBW,EAASC,OAE5CrwS,KAAKwwS,OAAOD,EAAWtkS,UAClBskS,EAGTF,KAIJA,EAAa,SAGP,GAGV/rE,EAAW3mO,UAAU6yS,OAAS,SAAUzrU,EAAQknC,MAC1CjM,KAAK/6B,OAASF,EAASknC,EAAOhnC,cACzB,UAGAwrU,EAAe,EAAGA,EAAexkS,EAAOhnC,OAAQwrU,OACnDzwS,KAAKxe,IAAIzc,EAAS0rU,KAAkBxkS,EAAOwkS,UACtC,SAGJ,oBAIDzoN,EAAAA,CACJyhE,aAAc,EACdD,aAAc,EACdrB,YAAa,EACbD,YAAa,EACb+rE,YAAa,EACbD,YAAa,EACbN,aAAc,EACdF,aAAc,EACdO,YAAa,EACbD,YAAa,EACb7D,aAAc,EACdoD,aAAc,EACdQ,SAAU,EACVV,UAAW,EACXS,UAAW,KACXD,UAAW,KACXV,WAAY,KACZD,WAAY,gBAGH9zO,KAAK8oG,YACH9oG,GAEPolP,EAAW3mO,UAAUze,GADJ,OAAf8oG,EAAQ9oG,GACgB,SAAUna,EAAQq5J,UACnCp+H,KAAK56B,MAAML,EAAQA,EAASq5J,GAAYl/I,GAAG,EAAGk/I,IAG7B,SAAUr5J,EAAS,UACpCi7B,KAAK56B,MAAML,EAAQA,EAASijH,EAAQ9oG,IAAIA,GAAG,KAGtDA,MAQNolP,EAAW3mO,UAAUwyS,cAAgB,SAAwB72T,UACpDA,aAAagrP,GAAcA,EAAWosE,aAAap3T,IAG5DgrP,EAAWosE,aAAe,SAAuBp3T,UACnC,MAALA,GAAaA,EAAEk9I,IAGxBnjO,EAAOC,QAAUgxU,8CC3YjB,MAAAqsE,EAAAp9Y,EAAA,WACAq9Y,EAAAr9Y,EAAA,8BAOAF,EAAAC,QAAA,CACAq9Y,MAAAA,EACAz8Y,OAPAo/I,MAAAsoH,EAAA3hK,EAAAt0B,EAAAkrU,EAAAjE,KACA,MAAAkE,QAAAF,IACA,OAAA,IAAAD,EAAAG,EAAAl1I,EAAA3hK,EAAAt0B,EAAAkrU,EAAAjE,mGCAA,MAUA/1Y,YAAAk6Y,EAAA32K,EAAA,GAAAngI,EAAA,KAAAt0B,EAAA,MAAAkrU,EAAA,GAAAjE,GACA5sS,KAAAo6H,KAAAA,EACAp6H,KAAA/F,IAAAA,EACA+F,KAAAr6B,IAAAA,EACAq6B,KAAA+wS,SAAAA,EACA/wS,KAAAovS,MAAA,IAAA2B,EAAAJ,MAAAv2K,EAAAngI,EAAAt0B,EAAAkrU,EAAAjE,GACA5sS,KAAA4sS,WAAAA,EAUA/1Y,YAAA05N,GACA,MAAAygL,SACAA,EAAAC,UACAA,EAAAC,aACAA,EAAAC,gBACAA,EAAAC,cACAA,EAAAC,cACAA,GACArxS,KAAA+wS,SAGAO,EAAAN,EAAAE,EAAAE,EADA,IAAAG,WAAA3rU,KAAAwhL,KAAA72B,EAAAtrJ,OAAA+6B,KAAA/F,QAEAu3S,EAAAR,EAAAE,EAAAG,EAAA9gL,IAGAkhL,EAAAN,EADAnxS,KAAAovS,MAAAD,YAAAqC,EAAAF,IAGAL,EAAAO,GACAP,EAAAK,GAEA,MAAAtsU,EAAAysU,EAAAjmU,QAAA,GACA,OAAAxG,GAAA,EAAAysU,EAAAt1K,SAAA,EAAAn3J,GAAAysU,kCCnDA,MAAAzyD,YAAAA,GAAAzrV,EAAA,0BAIA,SAAAm+Y,EAAAC,EAAA,IACA,IAAAD,EAAAjyJ,UAAA,OAAA,KAEA,IAAAmyJ,EAAA,IAAAn5K,WAAA,CAAA,EAAA,GAAA,IAAA,IAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,GAAA,EAAA,IAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,GAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,IAAA,EAAA,IAAA,GAAA,EAAA,IAAA,IAAA,IAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,IAAA,GAAA,EAAA,IAAA,EAAA,IAAA,GAAA,EAAA,IAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,EAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,IAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,GAAA,GAAA,IAAA,IAAA,EAAA,EAAA,GAAA,GAAA,IAAA,IAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,IAAA,IAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,GAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,IAAA,GAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,IAAA,GAAA,GAAA,IAAA,EAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,IAAA,IAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,IAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,IAAA,EAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,EAAA,GAAA,GAAA,EAAA,GAAA,IAAA,IAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,IAAA,IAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,IAAA,IAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,IAAA,EAAA,EAAA,IAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,IAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,IAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,IAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,GAAA,IAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,IAAA,EAAA,GAAA,IAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,IAAA,IAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,EAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,IAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,IAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,IAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,GAAA,IAAA,GAAA,IAAA,IAAA,GAAA,IAAA,IAAA,EAAA,IAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,IAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,IAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,IAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,GAAA,GAAA,GAAA,IAAA,EAAA,EAAA,EAAA,IAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,IAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,GAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,IAAA,EAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,IAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,GAAA,EAAA,EAAA,IAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,IAAA,EAAA,EAAA,EAAA,IAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,IAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,EAAA,EAAA,EAAA,IAAA,EAAA,IAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,IAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,GAAA,EAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,IAAA,EAAA,IAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,GAAA,EAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,EAAA,IAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,EAAA,EAAA,GAAA,EAAA,EAAA,GAAA,GAAA,EAAA,GAAA,IAAA,EAAA,GAAA,EAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,EAAA,GAAA,GAAA,IAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,GAAA,EAAA,IAAA,EAAA,IAAA,EAAA,GAAA,IAAA,EAAA,GAAA,GAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,IAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,EAAA,GAAA,EAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,GAAA,IAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,GAAA,GAAA,IAAA,IAAA,GAAA,IAAA,GAAA,IAAA,IAAA,GAAA,IAAA,GAAA,MAEA,OAAAumH,EAAA,IAAAztH,SAAA,IAAA8pC,KAAA,CAAAu2I,GAAA,CAAA9qU,KAAA,sBAAA6qU,GAPAD,EAAAjyJ,UAAA,oBAAAoyJ,YASAx+Y,EAAAC,QAAAo+Y,8DCZA,aAGA,MAkCAI,EAAA,oBAAAC,eACAC,EAAA97Y,SACA+7Y,EAAA,KAGA,SAAAC,EAAAriM,EAAAkgE,GACA,MAAAoiI,EAAA,IAAAzjI,YAAA7+D,GACAuiM,EAAA,IAAA18I,YAAA7lD,GACA,IAAA5qI,EAAAktU,EAAApiI,GAzCA,IAyCA,KAAA,EACAhrM,EAAAgrM,IAAA,EACA,GAAA9qM,GAAAgtU,EAAA,OAAA5rU,OAAA67C,aAAAkhF,MAAA/8H,OAAA+rU,EAAAj2K,SAAAp3J,EAAAA,EAAAE,IACA,MAAAghC,EAAA,GACA,EAAA,CACA,MAAAlqB,EAAAq2T,EAAArtU,EAAAktU,EAAA,GACAh1S,EAAAlhB,GAAA,OAAAA,EAAA,MAAAk2T,KAAAA,EACAhsS,EAAAn7B,KAAAzE,OAAA67C,aAAAkhF,MAAA/8H,OAAA+rU,EAAAj2K,SAAAp3J,EAAAA,GAAAk4B,KACAh4B,GAAAg4B,QACAh4B,EAAAgtU,GACA,OAAAhsS,EAAA37B,KAAA,IAAAjE,OAAA67C,aAAAkhF,MAAA/8H,OAAA+rU,EAAAj2K,SAAAp3J,EAAAA,EAAAE,IAIA,SAAAotU,EAAA98T,GACA,MAAA+8T,EAAA,GAEA,SAAAC,EAAAC,EAAAziI,GACA,OAAAyiI,EACAN,EAAAM,EAAA3iM,OAAAkgE,GADA,gBAKA,MAAAr8C,EAAAn+I,EAAAm+I,IAAAn+I,EAAAm+I,KAAA,GAYA,OAXAA,EAAA1gF,MAAA0gF,EAAA1gF,OAAA,SAAAy/P,EAAA3xS,EAAA7rB,EAAAy9T,GACA,MAAAF,EAAAF,EAAAE,QAAA9+K,EAAA8+K,OACA,MAAA15S,MAAA,UAAAy5S,EAAAC,EAAAC,GAAA,OAAAF,EAAAC,EAAA1xS,GAAA,IAAA7rB,EAAA,IAAAy9T,IAEAh/K,EAAAr+C,MAAAq+C,EAAAr+C,OAAA,SAAAo9N,EAAAx+Y,GACA,MAAAu+Y,EAAAF,EAAAE,QAAA9+K,EAAA8+K,OACA93S,QAAA2xH,IAAA,UAAAkmL,EAAAC,EAAAC,IAAAx+Y,EAAA,IAAA,IAAA4pG,MAAAF,UAAAv4B,MAAAw4B,KAAAvnB,UAAA,EAAA,EAAApiF,GAAAq2E,KAAA,QAEAiL,EAAA3P,KAAA2P,EAAA3P,MAAAA,KACA2P,EAAAwoB,KAAAxoB,EAAAwoB,MAAAA,KAEAu0S,EAIA,SAAAK,EAAAL,EAAAzvO,GACA,MAAA+vO,EAAA/vO,EAAAvvK,QACAk/Y,EAAAI,EAAAJ,OACAh2I,EAAAo2I,EAAAp2I,MACAhZ,EAAAovJ,EAAA,QACAC,EAAAD,EAAA,SACAE,EAAAF,EAAA,cAAA,EAGA,SAAAG,EAAA9uT,GACA,MAAAkuT,EAAA,IAAAzjI,YAAA8jI,EAAA3iM,QAEA,IAAA5rH,KAAA,IADAkuT,EAAAW,IAAA,GACA,MAAAh6S,MAAA,eAAA7U,GACA,OAAAkuT,GAAAW,EAAA,IAAA,GAAA,EAAA7uT,GAIA,SAAA+uT,EAAA/uT,GACA,MAAAkuT,EAAA,IAAAzjI,YAAA8jI,EAAA3iM,QAEA,IAAA5rH,KAAA,IADAkuT,EAAAW,IAAA,GACA,MAAAh6S,MAAA,eAAA7U,GACA,OAAAkuT,GAAAW,EAAA,IAAA,GAAA,EAAA7uT,EAAA,GAIA,SAAAgvT,EAAAv1L,GACA,OAAA,GAAA93I,KAAAovN,MAAAt3E,IA9FA,EA8FA,IA8BA,SAAAw1L,EAAAC,EAAAC,EAAA9uJ,GACA,MAAAz0C,EAAA2iM,EAAA3iM,OACA,GAAAy0C,EACA,OAAA6uJ,GACA,KAAA,EAAA,OAAA,IAAAzrJ,aAAA73C,GACA,KAAA,EAAA,OAAA,IAAAo5C,aAAAp5C,QAGA,OAAAsjM,GACA,KAAA,EAAA,OAAA,IAAAC,EAAAC,UAAA56K,YAAA5oB,GACA,KAAA,EAAA,OAAA,IAAAujM,EAAAE,WAAA59I,aAAA7lD,GACA,KAAA,EAAA,OAAA,IAAAujM,EAAA7B,WAAA7iI,aAAA7+D,GACA,KAAA,EAAA,OAAA,IAAAujM,EAAAG,cAAAxB,gBAAAliM,GAGA,MAAA/2G,MAAA,sBAAAq6S,GA4BA,SAAAK,EAAA52S,GACA,MAAAu1S,EAAA,IAAAzjI,YAAA8jI,EAAA3iM,QACA5rH,EAAAkuT,EAAAv1S,GAtLA,IAsLA,GACA8gH,EAAAq1L,EAAA9uT,GACA,KA/KA,EA+KAy5H,GAAA,MAAA5kH,MAAA,iBAAA7U,GACA,MAAAwvT,EAAAR,EAAAv1L,GACA,IAAA6S,EAAA4hL,EAAAv1S,EA9JA,IA8JA,GACA,MAAA33B,EAjLA,EAiLAy4I,EACAy0L,EAAAv1S,EA7JA,KA6JA,GACAu1S,EAAA5hL,GA5LA,IA4LA,KAAAkjL,EACA,OAAAP,EAAAO,EA/KA,KA+KA/1L,EA9KA,KA8KAA,GACAye,SAAA5L,KAAAkjL,EAAAljL,EAAAtrJ,GA0BA,SAAAyuU,EAAA9zJ,EAAAuzJ,EAAApjI,GACA,OAAA,IAAAnwB,EAAA+zJ,EAAA/zJ,EAAAuzJ,EAAApjI,IAIA,SAAA4jI,EAAA/zJ,EAAAuzJ,EAAApjI,GACA,MAAAlgE,EAAA2iM,EAAA3iM,OACAsiM,EAAA,IAAAzjI,YAAA7+D,GACA+jM,EAAAzB,EAAApiI,EArMA,IAqMA,GACA,OAAA,IAAAnwB,EAAA/vC,EAAA+jM,EAAAzB,EAAAyB,GAjOA,IAiOA,KAAAT,GA8CA,OApJAb,EAAAuB,cARA,SAAAr+S,GACA,MAAAvwB,EAAAuwB,EAAAvwB,OACA8qM,EAAAvsB,EAAAv+K,GAAA,EAjHA,GAkHAmtU,EAAA,IAAA18I,YAAA88I,EAAA3iM,QACA,IAAA,IAAA1oI,EAAA,EAAAD,EAAA6oM,IAAA,EAAA5oM,EAAAlC,IAAAkC,EAAAirU,EAAAlrU,EAAAC,GAAAquB,EAAAvd,WAAA9Q,GACA,OAAA4oM,GAaAuiI,EAAAwB,YAPA,SAAA/jI,GACA,MAAAlgE,EAAA2iM,EAAA3iM,OAEA,GA7HA,IA4HA,IAAA6+D,YAAA7+D,GAAAkgE,GAjIA,IAiIA,GACA,MAAAj3K,MAAA,iBAAAi3K,GACA,OAAAmiI,EAAAriM,EAAAkgE,IA8CAuiI,EAAApB,aArBA,SAAAjtT,EAAAmZ,GACA,MAAAsgH,EAAAq1L,EAAA9uT,GACA,KAAA,EAAAy5H,GAAA,MAAA5kH,MAAA,iBAAA7U,EAAA,MAAAy5H,GACA,MAAA+1L,EAAAR,EAAAv1L,GACAz4I,EAAAm4B,EAAAn4B,OACAsrJ,EAAAizB,EAAAv+K,GAAAwuU,EA7JA,GA8JA72S,EAAA4mJ,EAxJA,EAwJA9lC,EAlIA,GAFA,GAoIAz5H,GACAkuT,EAAA,IAAAzjI,YAAA8jI,EAAA3iM,QACAsiM,EAAAv1S,EAzIA,IAyIA,GAAAi2S,EAAAtiL,GACA4hL,EAAAv1S,EAzIA,IAyIA,GAAA2zH,EACA4hL,EAAAv1S,EAzIA,IAyIA,GAAA33B,GAAAwuU,EA5JA,EA6JA/1L,IAAAy0L,EAAAv1S,EAxIA,KAwIA,GAAA33B,GACA,MAAAuwL,EAAA09I,EAAAO,EAzJA,KAyJA/1L,EAxJA,KAwJAA,GACA,GAvJA,KAuJAA,EACA,IAAA,IAAAv2I,EAAA,EAAAA,EAAAlC,IAAAkC,EAAAquL,GAAAjlC,IAAAkjL,GAAAtsU,GAAA0rU,EAAAz1S,EAAAj2B,SAEAquL,EAAA/zK,IAAA2b,EAAAmzH,IAAAkjL,GAEA,OAAA72S,GAoBA01S,EAAAkB,eAAAA,EAWAlB,EAAAyB,WARA,SAAAn3S,GACA,MAAA5N,EAAAwkT,EAAA52S,GACAwG,EAAApU,EAAA/pB,OACA87D,EAAA,IAAAljC,MAAAuF,GACA,IAAA,IAAAj8B,EAAA,EAAAA,EAAAi8B,EAAAj8B,IAAA45D,EAAA55D,GAAA6nB,EAAA7nB,GACA,OAAA45D,GAYAuxQ,EAAA0B,iBANA,SAAAjkI,GACA,MAAAlgE,EAAA2iM,EAAA3iM,OACA5qI,EAAA,IAAAypM,YAAA7+D,GAAAkgE,GAjNA,IAiNA,GACA,OAAAlgE,EAAAzqI,MAAA2qM,EAAAA,EAAA9qM,IAkBAqtU,EAAA2B,eAAAP,EAAA/6S,KAAA,KAAA06S,UAAA,GACAf,EAAA4B,mBAAAP,EAAAh7S,KAAA,KAAA06S,UAAA,GACAf,EAAA6B,gBAAAT,EAAA/6S,KAAA,KAAA8/H,WAAA,GACA65K,EAAA8B,oBAAAT,EAAAh7S,KAAA,KAAA8/H,WAAA,GACA65K,EAAA+B,uBAAAX,EAAA/6S,KAAA,KAAA27S,kBAAA,GACAhC,EAAAiC,2BAAAZ,EAAAh7S,KAAA,KAAA27S,kBAAA,GACAhC,EAAAkC,gBAAAd,EAAA/6S,KAAA,KAAA26S,WAAA,GACAhB,EAAAmC,oBAAAd,EAAAh7S,KAAA,KAAA26S,WAAA,GACAhB,EAAAoC,iBAAAhB,EAAA/6S,KAAA,KAAA+8J,YAAA,GACA48I,EAAAqC,qBAAAhB,EAAAh7S,KAAA,KAAA+8J,YAAA,GACA48I,EAAAnB,gBAAAuC,EAAA/6S,KAAA,KAAA44S,WAAA,GACAe,EAAAsC,oBAAAjB,EAAAh7S,KAAA,KAAA44S,WAAA,GACAe,EAAAuC,iBAAAnB,EAAA/6S,KAAA,KAAA+1K,YAAA,GACA4jI,EAAAwC,qBAAAnB,EAAAh7S,KAAA,KAAA+1K,YAAA,GACAojI,IACAQ,EAAAyC,gBAAArB,EAAA/6S,KAAA,KAAA46S,cAAA,GACAjB,EAAA0C,oBAAArB,EAAAh7S,KAAA,KAAA46S,cAAA,GACAjB,EAAA2C,iBAAAvB,EAAA/6S,KAAA,KAAAo5S,eAAA,GACAO,EAAA4C,qBAAAvB,EAAAh7S,KAAA,KAAAo5S,eAAA,IAEAO,EAAA6C,kBAAAzB,EAAA/6S,KAAA,KAAA+uJ,aAAA,GACA4qJ,EAAA8C,sBAAAzB,EAAAh7S,KAAA,KAAA+uJ,aAAA,GACA4qJ,EAAA+C,kBAAA3B,EAAA/6S,KAAA,KAAAswJ,aAAA,GACAqpJ,EAAAgD,sBAAA3B,EAAAh7S,KAAA,KAAAswJ,aAAA,GAaAqpJ,EAAAiD,aAVA,SAAAxlI,EAAAylI,GACA,MAAArD,EAAA,IAAAzjI,YAAA8jI,EAAA3iM,QACA,IAAA5rH,EAAAkuT,EAAApiI,GAjQA,IAiQA,GACA,GAAA9rL,GAAAkuT,EAAAW,IAAA,GACA,MAAA7uT,GAAAuxT,EAAA,OAAA,QACAvxT,EAAA+uT,EAAA/uT,IAEA,OAAA,GAMAquT,EAAAE,OAAAF,EAAAE,QAAAA,EACAF,EAAA91I,MAAA81I,EAAA91I,OAAAA,EAGAi5I,EAAA7C,EAAAN,GAGA,SAAAoD,EAAAxlO,GACA,MAAA,oBAAAqhD,UAAArhD,aAAAqhD,SAIAj+E,eAAA0rM,EAAAjqQ,EAAAQ,GACA,OAAAmgU,EAAA3gU,QAAAA,GAAA4gU,EAAA5gU,EAAAQ,GACAo9T,EACAN,EAAA98T,IAAAA,EAAA,WACAs8T,YAAA7yD,YACAjqQ,aAAA88T,YAAA+D,OACA7gU,QACA88T,YAAAv8Y,QAAAy/E,GACAQ,IAuBA+9D,eAAAqiQ,EAAA5gU,EAAAQ,GACA,OAAAs8T,YAAA8D,qBAQAhD,EACAN,EAAA98T,IAAAA,EAAA,YACAs8T,YAAA8D,qBAAA5gU,EAAAQ,IAAAstF,UATAm8K,EACA02D,EAAA3gU,QAAAA,GACAA,EAAAqvO,cACArvO,EACAQ,GAYA,SAAAkgU,EAAAniZ,EAAAg/Y,GACA,IAAAj/Y,EAAAi/Y,EAAA9+Y,OAAAU,OAAAo+Y,GAAA,GACAuD,EAAAviZ,EAAA,kBACA,SAAA2xE,GAAA3xE,EAAA,kBAAAI,MAAAuxE,GACA3xE,EAAA,sBAAAA,EAAA,WAAA,aACA,IAAA,IAAAwiZ,KAAAxiZ,EAAA,CACA,IAAAE,OAAAmqG,UAAAnD,eAAAoD,KAAAtqG,EAAAwiZ,GAAA,SACA,MAAAniP,EAAArgK,EAAAwiZ,GACA,IAAA7vS,EAAA6vS,EAAAh2T,MAAA,KACAktE,EAAA35J,EACA,KAAA4yG,EAAAhhC,OAAA,GAAA,CACA,IAAA8gC,EAAAE,EAAAtB,QACAnxG,OAAAmqG,UAAAnD,eAAAoD,KAAAovD,EAAAjnD,KAAAinD,EAAAjnD,GAAA,IACAinD,EAAAA,EAAAjnD,GAEA,IAAAlzG,EAAAozG,EAAA,GACAoN,EAAAxgH,EAAA24E,QAAA,KACA,GAAA6nC,GAAA,EAAA,CACA,IAAAxY,EAAAhoG,EAAAipG,UAAA,EAAAuX,GACA0iS,EAAA/oP,EAAAnyD,GACA,QAAA,IAAAk7S,IAAAA,EAAAp4S,UAAA,CACA,IAAAsuF,EAAA,YAAA71G,GACA,OAAA61G,EAAAqY,KAAArY,EAAAtuF,UAAAgP,YAAA,KAAAv2B,KAEA61G,EAAAtuF,UAAA,CACAmxN,QAAA,WACA,OAAA9uN,KAAAgyS,KAGA/lN,EAAAqY,KAAA,SAAA0xM,GACA,OAAAxiZ,OAAAU,OAAA+3L,EAAAtuF,UAAA,CAAA9mG,CAAAm7Y,GAAA,CAAAt+Y,MAAAsiZ,EAAA7/K,UAAA,MAEA4/K,GAAAviZ,OAAAy0G,oBAAA8tS,GAAA3hZ,SAAAvB,GACAW,OAAAC,eAAAw4L,EAAAp5L,EAAAW,OAAAy4U,yBAAA8pE,EAAAljZ,MAEAm6J,EAAAnyD,GAAAoxF,EAIA,GAFAp5L,EAAAA,EAAAipG,UAAAuX,EAAA,GACA25C,EAAAA,EAAAnyD,GAAA8C,UACA,cAAAl4B,KAAA5yE,IACA,IAAAW,OAAAmqG,UAAAnD,eAAAoD,KAAAovD,EAAAn6J,EAAAA,EAAAipG,UAAA,IAAA,CACA,IAAA44E,EAAAphL,EAAAwiZ,EAAA58T,QAAA,OAAA,SACAouH,EAAAh0M,EAAAwiZ,EAAA58T,QAAA,OAAA,SACA1lF,OAAAC,eAAAu5J,EAAAn6J,EAAA,CACA2uF,IAAA,WAAA,OAAAkzF,EAAA10E,KAAAgyS,KACAvwT,IAAA,SAAA/tF,GAAA4zM,EAAAtnG,KAAAgyS,GAAAt+Y,IACAqrG,YAAA,SAIA,gBAAAlsG,GACAm6J,EAAAn6J,GAAA,IAAAujF,KACAy/T,EAAAz/T,EAAAnR,QACA0uF,KAAAv9E,KACAsP,SAAAiuE,GAEA3G,EAAAn6J,GAAA,YAAAujF,GAEA,OADAy/T,EAAAz/T,EAAAnR,QACA0uF,EAAA3zD,KAAAgyS,MAAA57T,KACAsP,SAAAiuE,MAIA,cAAAluF,KAAA5yE,GACAW,OAAAmqG,UAAAnD,eAAAoD,KAAAovD,EAAAn6J,EAAAA,EAAAipG,UAAA,KACAtoG,OAAAC,eAAAu5J,EAAAn6J,EAAA,CACA2uF,IAAAluF,EAAAwiZ,EAAA58T,QAAA,OAAA,SACAuI,IAAAnuF,EAAAwiZ,EAAA58T,QAAA,OAAA,SACA6lB,YAAA,IAGA,mBAAA40D,GAAAA,IAAAkiP,GACA7oP,EAAAn6J,GAAA,IAAAujF,KACAy/T,EAAAz/T,EAAAnR,QACA0uF,KAAAv9E,KACAsP,SAAAiuE,EAEA3G,EAAAn6J,GAAA8gK,EAIA,OAAAtgK,EArHAC,EAAA0rV,YAAAA,EAeA1rV,EAAA2iZ,gBAZA,SAAAlhU,EAAAQ,GACA,OAAAo9T,EACAN,EAAA98T,IAAAA,EAAA,KACA,IAAAs8T,YAAAqE,SACAnhU,aAAA88T,YAAA+D,OACA7gU,EACA,IAAA88T,YAAA+D,OAAA7gU,GACAQ,KAuBAjiF,EAAAqiZ,qBAAAA,EAuFAriZ,EAAAmiZ,SAAAA,gCChaA,aAGA,MAAAnxE,EAAA/wU,EAAA,iBAKAF,EAAAC,QAAAggJ,gBAAAv+D,EAAApgF,GACA,IAAAo5S,EAAA,IAAAu2B,EACA6xE,EAAA,EACAj9N,GAAA,EACA,MAAAwzN,EAAA/3Y,EAAA+3Y,aAEA,UAAA,MAAA78L,KAAA96H,EAKA,IAJAg5N,EAAA2gG,OAAA7+L,GAEAsmM,GAAAtmM,EAAA5qI,OAEAkxU,GAAAzJ,GAKA,SAJA3+F,EAAA3oO,MAAA,EAAAsnU,GACAxzN,GAAA,EAGAwzN,IAAA3+F,EAAA9oO,OACA8oO,EAAA,IAAAu2B,EACA6xE,EAAA,MACA,CACA,MAAAC,EAAA,IAAA9xE,EACA8xE,EAAA1H,OAAA3gG,EAAAgiG,aAAArD,IACA3+F,EAAAqoG,EAGAD,GAAAzJ,EAKAxzN,IAAAi9N,UAEApoG,EAAA3oO,MAAA,EAAA+wU,0DCxCA,aAEA,MAAAr5F,EAAAvpT,EAAA,YACA6kO,EAAA7kO,EAAA,2BA2BAF,EAAAC,QAlBAggJ,gBAAAv+D,GACA,UAAA,MAAAhO,KAAAgO,EAAA,CACA,QAAAr/E,IAAAqxE,EAAA9B,OACA,MAAA63O,EAAA,IAAAhkN,MAAA,uBAAA,uBAGA,GAAA,iBAAA/xB,GAAAA,aAAAV,aACA+xJ,EAAArxJ,EAAAq3B,iBACA,GAAAP,MAAA/gB,QAAA/V,SACA0xJ,WAAAhvE,KAAA1iF,OACA,CAAA,KAAAA,aAAA0xJ,YAGA,MAAAqkF,EAAA,IAAAhkN,MAAA,uBAAA,6BAFA/xB,uFCvBA,aAEA,MAAAsvU,EAAA9iZ,EAAA,cACA+iZ,EAAA/iZ,EAAA,mBACAgjZ,EAAAhjZ,EAAA,SACAijZ,EAAAjjZ,EAAA,8BAeA+/I,eAAAmjQ,EAAA9iP,EAAAq7L,EAAAr6V,GACA,MAAA+hZ,EAAAF,EAAA7iP,EAAAhhK,MAAA,IACAkpG,EAAA66S,EAAAzxU,OAAA,EACA,IAAAwB,EAAAuoR,EACA2nD,EAAA,GAEA,IAAA,IAAAxvU,EAAA,EAAAA,EAAAuvU,EAAAzxU,OAAAkC,IAAA,CACA,MAAAyvU,EAAAF,EAAAvvU,GAEAwvU,GAAA,GAAAA,EAAA,IAAA,KAAAC,IAEA,MAAA76T,EAAA5U,IAAA00B,EAKA,GAJAp1B,EAAAowU,OAAA,EACApwU,EAAAknJ,SAAAj4N,EACA+wE,EAAAw2B,UAAAvnG,EAEAqmF,QACAtV,EAAA4qJ,IAAAulL,EAAAjjP,GACAq7L,QAAAsnD,EAAA,KAAA7vU,EAAA9xE,EAAAo2Y,oBAAAp2Y,OACA,CACA,IAAAs4E,QAAAxG,EAAA+a,IAAAo1T,GAEA3pU,GAAAA,aAAAspU,IACAtpU,EAAA,IAAAopU,EAAA,CACA51T,MAAA,EACAxT,KAAA,EACAxG,OAAAA,EACAqwU,UAAAF,EACAjkZ,KAAAgkZ,EACAE,OAAA,EACAxxL,MAAA,EACAs4G,MAAA1wP,GAAAA,EAAAwwP,QAAAxwP,EAAAwwP,OAAAE,MACAjjP,KAAAzN,GAAAA,EAAAwwP,QAAAxwP,EAAAwwP,OAAA/iP,MACA/lF,UAGA8xE,EAAA4qJ,IAAAulL,EAAA3pU,GAEAxG,EAAAwG,GAIA,OAAA+hR,EAOA17M,eAAAyjQ,EAAA/nD,EAAAxhM,GACAwhM,aAAAunD,QAQAvnD,EAAAtuK,MAAAlzB,GAPAwhM,GAAAA,EAAAvxB,QAAAuxB,EAAAvxB,OAAA0kC,sBACAnT,GA+CA37V,EAAAC,QAnCAggJ,gBAAAv+D,EAAAy4E,EAAA74J,GAEA,IAAAq6V,EAAA,IAAAqnD,EAAA,CACA51T,MAAA,EACAxT,KAAA,EACAt6E,KAAA,GACAkkZ,OAAA,EACAxxL,MAAA,GACA1wN,GAEA,UAAA,MAAAohL,KAAAhhG,EACAghG,IAIAi5K,QAAAynD,EAAA1gO,EAAAi5K,EAAAr6V,GAEAohL,EAAA0nJ,QAAA1nJ,EAAA0nJ,OAAA0kC,sBACApsL,IAIA,GAAAphL,EAAA82Y,wBACAsL,EAAA/nD,EAAAxhM,QAEA,UAAA,MAAAwpP,KAAAhoD,EAAAioD,kBACAD,UAIAD,EAAAC,EAAAtsU,MAAA8iF,sIClHA,aAEA,MAAA0wM,QACAA,EAAA3mC,QACAA,GACAhkU,EAAA,gBACAikU,OAAAA,GAAAjkU,EAAA,eACAgjZ,EAAAhjZ,EAAA,SACAi6Y,EAAAj6Y,EAAA,mBAuHAF,EAAAC,QA5GA,cAAAijZ,EAKA1/Y,YAAA8vE,EAAAhyE,GACA4wH,MAAA5+C,EAAAhyE,GAGAqrG,KAAAk3S,UAAA,GAOArgZ,UAAAhE,EAAAa,GACAssG,KAAA2tH,SAAAj4N,EACAsqG,KAAA/C,UAAAvnG,EAEAsqG,KAAAk3S,UAAArkZ,GAAAa,EAMAmD,IAAAhE,GACA,OAAAkzK,QAAAC,QAAAhmE,KAAAk3S,UAAArkZ,IAGAgE,aACA,OAAArD,OAAAW,KAAA6rG,KAAAk3S,WAAAjyU,OAGApuE,sBACA,OAAAmpG,KAAAm3S,aAGAtgZ,YACA,OAAAmpG,KAAAk3S,UAAA1jZ,OAAAW,KAAA6rG,KAAAk3S,WAAA,IAGArgZ,wBACA,MAAA1C,EAAAX,OAAAW,KAAA6rG,KAAAk3S,WAEA,IAAA,IAAA/vU,EAAA,EAAAA,EAAAhzE,EAAA8wE,OAAAkC,IAAA,CACA,MAAAnyE,EAAAb,EAAAgzE,QAEA,CACAnyE,IAAAA,EACA01E,MAAAs1B,KAAAk3S,UAAAliZ,KASA6B,YAAA22J,GACA,MAAAjkF,EAAA/1E,OAAAW,KAAA6rG,KAAAk3S,WACAn4C,EAAA,GAEA,IAAA,IAAA53R,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,IAAAuD,EAAAs1B,KAAAk3S,UAAA3tU,EAAApC,IAEA,GAAAuD,aAAA6rU,EACA,UAAA,MAAAxgO,KAAArrG,EAAAg2G,MAAAlzB,GACA9iF,EAAAqrG,QAEArrG,EAIA,MAAAA,EAAAuyB,MAAAvyB,EAAAijJ,KACAoxI,EAAAj0R,KAAA,IAAAozR,EAAA30R,EAAApC,GAAAuD,EAAAuyB,KAAAvyB,EAAAijJ,MAIA,MAAA8vG,EAAA,IAAAjG,EAAA,CACA1wP,KAAA,YACA62P,MAAA39N,KAAA29N,MACAjjP,KAAAslB,KAAAtlB,OAGAzT,EAAA,IAAAswP,EAAAkG,EAAAh9C,UAAAs+E,GACAlvJ,EAAA5oI,EAAA23R,YACAjxI,QAAA6/K,EAAA39L,EAAAriD,EAAAxtD,KAAArrG,SACAsoG,EAAA4yG,EAAA5qI,OAAAgC,EAAAq3R,MAAA54R,QAKA,CAAA2wK,EAAArpF,IAAAqpF,EAAArpF,EAAAgyM,OACA,GAEAh/P,KAAA2tH,IAAAA,EACA3tH,KAAA/C,KAAAA,OAEA,CACA0wH,IAAAA,EACA8vG,OAAAA,EACA9qU,KAAAqtG,KAAArtG,KACAsqG,KAAAA,wHC1HA,aAwEA5pG,EAAAC,QApDA,MAMAuD,YAAA8vE,EAAAhyE,GACAqrG,KAAArrG,QAAAA,GAAA,GAEAqrG,KAAAvf,KAAA9Z,EAAA8Z,KACAuf,KAAA/yB,IAAAtG,EAAAsG,IACA+yB,KAAArtG,KAAAg0E,EAAAh0E,KACAqtG,KAAA62S,MAAAlwU,EAAAkwU,MACA72S,KAAAqlH,KAAA1+I,EAAA0+I,KACArlH,KAAAv5B,OAAAE,EAAAF,OACAu5B,KAAA82S,UAAAnwU,EAAAmwU,UACA92S,KAAAy9N,OAAA92P,EAAA82P,OACAz9N,KAAAtlB,KAAA/T,EAAA+T,KACAslB,KAAA29N,MAAAh3P,EAAAg3P,MAGA39N,KAAA2tH,SAAAj4N,EAEAsqG,KAAA/C,UAAAvnG,EAOAmB,UAAAhE,EAAAa,IAMAmD,IAAAhE,GACA,OAAAkzK,QAAAC,QAAAhmE,MAMAnpG,yBAMAA,YAAA22J,oCCrEA,aAEA,MAAA4pP,EAAA7jZ,EAAA,iBACA8iZ,EAAA9iZ,EAAA,cAcAF,EAAAC,QAAAggJ,eAAAgjQ,EAAA5rU,EAAAuC,EAAAoqU,EAAA1iZ,GACA,IAAA2iZ,EAAArqU,EAEAA,aAAAopU,GAAAppU,EAAAsqU,uBAAAF,IACAC,QA6BAhkQ,eAAAkkQ,EAAA7iZ,GACA,MAAA2iZ,EAAA,IAAAF,EAAA,CACA32T,KAAA+2T,EAAA/2T,KACAxT,KAAA,EACAxG,OAAA+wU,EAAA/wU,OACAqwU,UAAAU,EAAAV,UACAnkZ,KAAA6kZ,EAAA7kZ,KACAkkZ,MAAAW,EAAAX,MACAxxL,MAAA,EACAs4G,MAAA65E,EAAA75E,MACAjjP,KAAA88T,EAAA98T,MACA/lF,GAEA,UAAA,MAAAK,IAAAA,EAAA01E,MAAAA,KAAA8sU,EAAAP,wBACAK,EAAAjmL,IAAAr8N,EAAA01E,GAGA,OAAA4sU,EA9CAG,CAAAxqU,EAAAt4E,IAGA,MAAA8xE,EAAA6wU,EAAA7wU,OAEA,GAAAA,EAAA,CACA,GAAA6wU,IAAArqU,EAAA,CAKA,GAJAvC,IACAA,EAAAjE,OAAA6wU,IAGAA,EAAAR,UACA,MAAA,IAAAh+S,MAAA,6BAGAryB,EAAA4qJ,IAAAimL,EAAAR,UAAAQ,GAGA,OAAAhB,EAAAgB,EAAA7wU,EAAA4wU,EAAA1iZ,GAIA,OAAA2iZ,6EC3CA,aAEA,MAAAp5C,QACAA,EAAA3mC,QACAA,GACAhkU,EAAA,gBACAikU,OAAAA,GAAAjkU,EAAA,eACAgjZ,EAAAhjZ,EAAA,SACAi6Y,EAAAj6Y,EAAA,oBACAmkZ,WAAAA,EAAAC,OAAAA,GAAApkZ,EAAA,iBAuFA+/I,eAAAotC,EAAAk3N,EAAApqP,EAAAqqP,EAAAljZ,GACA,MAAA40E,EAAAquU,EAAAV,UACAn4C,EAAA,GACA,IAAA+4C,EAAA,EAEA,IAAA,IAAA3wU,EAAA,EAAAA,EAAAoC,EAAAtE,OAAAkC,IAAA,CACA,MAAAuD,EAAAnB,EAAAiY,IAAAra,GAEA,IAAAuD,EACA,SAGA,MAAAqtU,EAAA5wU,EAAAi3B,SAAA,IAAA1I,cAAA2yR,SAAA,EAAA,KAEA,GAAA39S,aAAAitU,EAAA,CACA,IAAAne,EAEA,UAAA,MAAAwe,WAAAt3N,EAAAh2G,EAAA8iF,EAAA,KAAA74J,GACA6kY,EAAAwe,EAGA,IAAAxe,EACA,MAAA,IAAA1gS,MAAA,wDAGAimQ,EAAAj0R,KAAA,IAAAozR,EAAA65C,EAAAve,EAAAv8R,KAAAu8R,EAAA7rK,MACAmqL,GAAAte,EAAAv8R,UACA,GAAA,mBAAAvyB,EAAAh3E,MAAAgtL,MAAA,CACA,MAAAzzG,EAAAvC,EAAAh3E,MACA,IAAAukZ,EAEA,UAAA,MAAAliO,KAAA9oG,EAAAyzG,MAAAlzB,GACAyqP,EAAAliO,QAEAkiO,EAGA,MAAAlnS,EAAAgnS,EAAArtU,EAAA11E,IACA+pW,EAAAj0R,KAAA,IAAAozR,EAAAntP,EAAAknS,EAAAh7S,KAAAg7S,EAAAtqL,MAEAmqL,GAAAG,EAAAh7S,SACA,CACA,MAAAvpG,EAAAg3E,EAAAh3E,MAEA,IAAAA,EAAAi6N,IACA,SAGA,MAAA58G,EAAAgnS,EAAArtU,EAAA11E,IACAioG,EAAAvpG,EAAAupG,KAEA8hQ,EAAAj0R,KAAA,IAAAozR,EAAAntP,EAAA9T,EAAAvpG,EAAAi6N,MACAmqL,GAAA76S,GAMA,MAAAyvD,EAAA+rE,WAAAhvE,KAAAlgF,EAAA2uU,WAAAh4L,WACAjzI,EAAA,IAAAuqP,EAAA,CACA1wP,KAAA,yBACA4lF,KAAAA,EACAw1M,OAAA01C,EAAAO,YACA9+F,SAAA1kT,EAAAu4Y,aACAvvE,MAAAk6E,GAAAA,EAAAl6E,MACAjjP,KAAAm9T,GAAAA,EAAAn9T,OAIAm1H,EADA,IAAA0nH,EAAAtqP,EAAAwzM,UAAAs+E,GACAH,YACAjxI,QAAA6/K,EAAA39L,EAAAriD,EAAA74J,GACAsoG,EAAA4yG,EAAA5qI,OAAA6yU,OAEA,CACAnqL,IAAAA,EACA8vG,OAAAxwP,EACAgwB,KAAAA,GArFA5pG,EAAAC,QAjEA,cAAAijZ,EAKA1/Y,YAAA8vE,EAAAhyE,GACA4wH,MAAA5+C,EAAAhyE,GAGAqrG,KAAAo4S,QAAAV,EAAA,CACAhqF,OAAA/4T,EAAAq4Y,WACA5yK,KAAAzlO,EAAAw4Y,iBAQAt2Y,UAAAhE,EAAAa,SACAssG,KAAAo4S,QAAA/mL,IAAAx+N,EAAAa,GAMAmD,IAAAhE,GACA,OAAAmtG,KAAAo4S,QAAA52T,IAAA3uF,GAGAgE,aACA,OAAAmpG,KAAAo4S,QAAAC,YAGAxhZ,sBACA,OAAAmpG,KAAAo4S,QAAAE,gBAGAzhZ,YACA,OAAAmpG,KAAAo4S,QAAAG,YAGA1hZ,wBACA,UAAA,MAAA7B,IAAAA,EAAAtB,MAAAA,KAAAssG,KAAAo4S,QAAAI,sBACA,CACAxjZ,IAAAA,EACA01E,MAAAh3E,GASAmD,YAAA22J,GACA,UAAA,MAAAuoB,KAAA2K,EAAA1gF,KAAAo4S,QAAA5qP,EAAAxtD,KAAAA,KAAArrG,cACA,IACAohL,EACApjL,KAAAqtG,KAAArtG,mJCjFA,aAEA,MAAAglZ,EAAApkZ,EAAA,YACAklZ,EAAAllZ,EAAA,qBAwBAF,EAAAC,QAAA,CACAokZ,WAdA,SAAA/iZ,GACA,IAAAA,IAAAA,EAAA+4T,OACA,MAAA,IAAA50N,MAAA,mCAGA,MAAA4/S,EAAA,CACAt+K,KAAAzlO,EAAAylO,MAAA,EACA/mH,KAAAolS,EAAA9jZ,EAAA+4T,SAGA,OAAA,IAAAiqF,EAAAe,IAKAf,OAAAA,+EC7BA,aAGA,MAAAgB,EAAAplZ,EAAA,gBACA6kO,EAAA7kO,EAAA,2BAgDA,MAAAokZ,EAMA9gZ,YAAAlC,EAAA8xE,EAAAmyU,EAAA,GACA54S,KAAA2hE,SAAAhtK,EACAqrG,KAAA64S,UAAA,EACA74S,KAAA84S,QAAAryU,EACAu5B,KAAA+4S,aAAAH,EAGA54S,KAAAk3S,UAAA,IAAAyB,EAGA34S,KAAAhrG,IAAA,KAOA6B,UAAA7B,EAAAtB,GACA,MAAAqiT,QAAA/1M,KAAAg5S,qBAAAhkZ,SAEA+gT,EAAA6hG,OAAAqB,OAAAljG,EAAA/gT,EAAAtB,GAMAmD,UAAA7B,GACA,MAAA01E,QAAAs1B,KAAAk5S,WAAAlkZ,GAEA,GAAA01E,EACA,OAAAA,EAAAh3E,MAOAmD,UAAA7B,GACA,MAAA+gT,QAAA/1M,KAAAm5S,WAAAnkZ,GACA01E,EAAAqrO,EAAA6hG,OAAAwB,IAAArjG,EAAAn+N,KAEAlN,GAAAA,EAAA11E,MAAAA,GACA+gT,EAAA6hG,OAAAyB,OAAAtjG,EAAAn+N,KAOA/gF,YAGA,OAFAmpG,KAAAk3S,UAAAoC,eAEA5zU,QAAA,CAAA2wK,EAAA3rK,IACAA,aAAAitU,EACAthK,EAAA3rK,EAAA2tU,YAGAhiK,EAAA,GACA,GAGAx/O,gBACA,OAAAmpG,KAAAk3S,UAAAjyU,OAGApuE,YACA,OAAAmpG,KAAAk3S,UAAA11T,IAAA,GAMA3qF,kBACA,MAAA0yE,EAAAy2B,KAAAk3S,UAAAoC,eAEA,IAAA,MAAA5uU,KAAAnB,EACAmB,aAAAitU,QACAjtU,EAAA8tU,uBAEA9tU,EAOA,MAAA,GAOA7zE,UAAAuzE,EAAA1E,GAIA,OAAAA,EAAAs6B,KAAAk3S,UAAAxxU,QAAA,CAAA2wK,EAAA3rK,EAAAnF,KACAmF,IACAA,aAAAitU,EACAthK,EAAAvrK,KAAAJ,EAAAk0R,UAAAx0R,EAAA1E,IAEA2wK,EAAAvrK,KAAAV,EAAAM,EAAAnF,KAGA8wK,IAVA,KAkBAx/O,eAAA0iZ,EAAAC,GACA,OAAAC,EAAAz5S,KAAAu5S,EAAAC,GAGA3iZ,SACA,OAAAmpG,KAAA4+P,UAAA86C,EAAAC,GAGA9iZ,cACA,OAAAgxE,KAAAC,UAAAk4B,KAAA5Y,SAAA,KAAA,MAGAvwF,YACA,OAAA+uE,KAAAy5J,IAAA,EAAAr/H,KAAA2hE,SAAAy4D,MAOAvjO,iBAAA7B,GACA,MAAA41E,QAAAo1B,KAAAm5S,WAAAnkZ,GACA01E,EAAAE,EAAAgtU,OAAAwB,IAAAxuU,EAAAgN,KAEA,KAAAlN,aAAAitU,GAMA,OAAAjtU,GAAAA,EAAA11E,MAAAA,EACA01E,OADA,EASA7zE,iBAAA7B,GACA,MAAA4kZ,EAAA55S,KAAA2hE,SAAAtuD,KAAA,iBAAAr+G,EAAAojO,EAAApjO,GAAAA,GACAuwE,QAAAq0U,EAAA1gD,KAAAl5P,KAAA2hE,SAAAy4D,MAEA1vJ,EAAAs1B,KAAAk3S,UAAA11T,IAAAjc,GAEA,OAAAmF,aAAAitU,EACAjtU,EAAAyuU,WAAAS,GAGA,CACAhC,OAAA53S,KACApoB,IAAArS,EACA8tC,KAAAumS,EACAC,cAAAnvU,GAQA7zE,2BAAA7B,GACA,MAAA+gT,QAAA/1M,KAAAm5S,WAAAnkZ,GAEA,GAAA+gT,EAAA8jG,eAAA9jG,EAAA8jG,cAAA7kZ,MAAAA,EAAA,CAEA,MAAA4iZ,EAAA,IAAAD,EAAA33S,KAAA2hE,SAAAo0I,EAAA6hG,OAAA7hG,EAAAn+N,KACAm+N,EAAA6hG,OAAAkC,aAAA/jG,EAAAn+N,IAAAggU,GAGA,MAAAmC,QAAAnC,EAAAuB,WAAApjG,EAAA8jG,cAAAxmS,MAGA,OAFA0mS,EAAAnC,OAAAqB,OAAAc,EAAAhkG,EAAA8jG,cAAA7kZ,IAAA+gT,EAAA8jG,cAAAnmZ,OAEAkkZ,EAAAoB,qBAAAjjG,EAAA1iM,MAIA,OAAA0iM,EAQAl/S,OAAAk/S,EAAA/gT,EAAAtB,GACAssG,KAAA85S,aAAA/jG,EAAAn+N,IAAA,CACA5iF,IAAAA,EACAtB,MAAAA,EACA2/G,KAAA0iM,EAAA1iM,OAQAx8G,aAAA+gF,EAAAs+C,GACAl2B,KAAAk3S,UAAA11T,IAAA5J,IACAooB,KAAA64S,YAEA74S,KAAAk3S,UAAAz1T,IAAA7J,EAAAs+C,GAMAr/H,OAAA+gF,GACA,IAAA,IAAAA,EACA,MAAA,IAAAkhB,MAAA,oBAGAkH,KAAAk3S,UAAA11T,IAAA5J,IACAooB,KAAA64S,YAEA74S,KAAAk3S,UAAA8C,MAAApiU,GACAooB,KAAAi6S,SAGApjZ,SACA,GAAAmpG,KAAA84S,SAAA94S,KAAA64S,WAAA,EACA,GAAA,IAAA74S,KAAA64S,UAAA,CAEA,MAAAN,EAAAv4S,KAAAk3S,UAAA/4T,KAAA+7T,GAEA,GAAA3B,KAAAA,aAAAZ,GAAA,CACA,MAAAtkS,EAAAklS,EAAAllS,KACAA,EAAA8mS,OAAAn6S,KAAA2hE,SAAAy4D,MACA,MAAA27E,EAAA,CACAn+N,IAAAooB,KAAA+4S,aACA1lS,KAAAA,EACAukS,OAAA53S,KAAA84S,SAEA94S,KAAA84S,QAAAG,OAAAljG,EAAAwiG,EAAAvjZ,IAAAujZ,EAAA7kZ,aAGAssG,KAAA84S,QAAAO,OAAAr5S,KAAA+4S,cASAliZ,IAAA0uE,GACA,OAAAy6B,KAAAk3S,UAAA11T,IAAAjc,IAOA,SAAA20U,EAAAhqO,GACA,OAAA7yF,QAAA6yF,GAQA,SAAAwpO,EAAAzyU,EAAA1B,GACA,OAAA0B,EAAAjyE,IAMA,SAAA2kZ,EAAA39T,GACA,OAAAA,EAUAs3D,eAAAmmQ,EAAA7B,EAAA2B,EAAAC,GACA,MAAA16K,EAAA,GAEA,IAAA,MAAAp0J,KAAAktU,EAAAV,UAAAoC,eACA,GAAA5uU,aAAAitU,QACA8B,EAAA/uU,EAAA6uU,EAAAC,OACA,CACA,MAAAY,QAAAb,EAAA7uU,GAEAo0J,EAAAh0J,KAAA,CACAotU,SAAAN,EAAAV,UAAAgB,WACA3uU,SAAA6wU,IAKA,OAAAZ,EAAA16K,GAGAzrO,EAAAC,QAAAqkZ,wFClXA,aAwOA,SAAA0C,EAAA92T,EAAAg9N,GACA,OAAAh9N,EAAA+2T,EAAA/5F,GAGA,SAAA+5F,EAAAC,GACA,IAAAz1O,EAAAy1O,EAGA,OAFAz1O,GAAAA,GAAA,EAAA,WACAA,GAAA,UAAAA,IAAAA,GAAA,EAAA,WACA,UAAAA,GAAAA,GAAA,GAAA,YAAA,GAGA,SAAA01O,EAAA3zU,EAAAyS,GACA,OAAAzS,EAAA,GAAAyS,EAAA,GAGA,SAAAmhU,EAAA9mP,GACA,OAAAA,EAAA,GAjPAtgK,EAAAC,QAAA,MACAuD,cACAmpG,KAAA06S,WAAA,GACA16S,KAAAysR,MAAA,GACAzsR,KAAA8iO,QAAA,EACA9iO,KAAA26S,gBAAA,EACA36S,KAAA46S,cAAA,EAGA/jZ,IAAA0uE,EAAA7xE,GACA,IAAAkkF,EAAAooB,KAAA66S,qBAAAt1U,GAAA,GACA,QAAA7vE,IAAAhC,GAEA,IAAAkkF,IAEAooB,KAAA86S,kBAAAljU,GACAooB,KAAA+6S,UAAAx1U,GACAy6B,KAAA26S,gBAAA,EACA36S,KAAA46S,cAAA,OAEA,CACA,IAAAI,GAAA,GACA,IAAApjU,GACAA,EAAAooB,KAAAysR,MAAAxnT,OACA+6B,KAAAi7S,QAAA11U,GACAy6B,KAAA46S,cAAA,GAEAI,GAAA,EAEAh7S,KAAAk7S,gBAAAtjU,EAAArS,EAAA7xE,EAAAsnZ,GACAh7S,KAAA26S,gBAAA,GAIA9jZ,MAAA0uE,GACAy6B,KAAAve,IAAAlc,OAAA7vE,GAGAmB,IAAA0uE,GACAy6B,KAAAm7S,YACA,MAAAvjU,EAAAooB,KAAA66S,qBAAAt1U,GAAA,GACA,IAAA,IAAAqS,EAGA,OAAAooB,KAAAysR,MAAA70S,GAAA,GAGA/gF,KAAAnD,GAEA,OADAssG,KAAAve,IAAAue,KAAA/6B,OAAAvxE,GACAssG,KAAA/6B,OAGAA,aAEA,GADA+6B,KAAAm7S,YACAn7S,KAAA26S,eAAA,CACA,MAAA5+T,EAAAikB,KAAAysR,MAAAzsR,KAAAysR,MAAAxnT,OAAA,GACA+6B,KAAA8iO,QAAA/mP,EAAAA,EAAA,GAAA,EAAA,EACAikB,KAAA26S,gBAAA,EAEA,OAAA36S,KAAA8iO,QAGAjsU,QAAA4zJ,GACA,IAAAtjF,EAAA,EACA,KAAAA,EAAA64B,KAAA/6B,QACAwlF,EAAAzqD,KAAAxe,IAAAra,GAAAA,EAAA64B,MACA74B,IAIAtwE,IAAA4zJ,GACA,IAAAtjF,EAAA,EACAi0U,EAAA,IAAAv9S,MAAAmC,KAAA/6B,QACA,KAAAkC,EAAA64B,KAAA/6B,QACAm2U,EAAAj0U,GAAAsjF,EAAAzqD,KAAAxe,IAAAra,GAAAA,EAAA64B,MACA74B,IAEA,OAAAi0U,EAGAvkZ,OAAAwkZ,EAAA10O,GACA,IAAAx/F,EAAA,EACAkvK,EAAA1vE,EACA,KAAAx/F,EAAA64B,KAAA/6B,QAAA,CAEAoxK,EAAAglK,EAAAhlK,EADAr2I,KAAAxe,IAAAra,GACAA,GACAA,IAEA,OAAAkvK,EAGAx/O,KAAAykZ,GACA,IAAA9rO,EAAAzzF,EAAA5U,EAAA,EACA,KAAAA,EAAA64B,KAAA/6B,SAAAuqG,GACAzzF,EAAAikB,KAAAxe,IAAAra,GACAqoG,EAAA8rO,EAAAv/T,GACA5U,IAEA,OAAAqoG,EAAAzzF,OAAArmF,EAGAmB,qBAAA0uE,EAAAg2U,GACA,MAAAC,EAAAx7S,KAAAy7S,YAAAl2U,EAAAg2U,GACA,GAAAC,GAAAx7S,KAAA06S,WAAAz1U,OACA,OAAA,EAEA,MAAAs7O,EAAAvgN,KAAA06S,WAAAc,GACAE,EAAAn2U,EA7GA,EA6GAi2U,EAEA,MADAj7F,EAAA,GAAAm7F,GAAA,GAEA,OAAA,EAOA,OALA17S,KAAA06S,WAAAt1U,MAAA,EAAAo2U,GAAA91U,OAAA20U,EAAA,GAGAC,EAAA/5F,IADA,YAAAm7F,EAAA,IAEA,EAIA7kZ,YAAA0uE,EAAAg2U,GACA,MAAAC,EAAA51U,KAAA6nC,MAAAloC,EA3HA,GA4HAo2U,EAAAH,EAAA,EACA,MAAAD,GAAAv7S,KAAA06S,WAAAz1U,OAAA02U,GACA37S,KAAA06S,WAAA5vU,KAAA,GAEA,OAAA0wU,EAGA3kZ,QAAA0uE,GACA,MAAAi2U,EAAAx7S,KAAAy7S,YAAAl2U,GAAA,GACAy6B,KAAA06S,WAAAc,IAAA,GAAAj2U,EArIA,EAqIAi2U,EAGA3kZ,UAAA0uE,GACA,MAAAi2U,EAAAx7S,KAAAy7S,YAAAl2U,GAAA,GACAy6B,KAAA06S,WAAAc,MAAA,GAAAj2U,EA1IA,EA0IAi2U,GAGA3kZ,gBAAA+gF,EAAArS,EAAA7xE,EAAAsnZ,GACA,MAAAtuP,EAAA1sD,KAAAysR,MACA94N,EAAA,CAAApuF,EAAA7xE,GACA,GAAAsnZ,EACAh7S,KAAAm7S,YACAzuP,EAAA90E,GAAA+7E,MACA,CAIA,GAAAjH,EAAAznF,OACA,GAAAynF,EAAAA,EAAAznF,OAAA,GAAA,IAAAM,EACAmnF,EAAA5hF,KAAA6oF,QACA,GAAAjH,EAAA,GAAA,IAAAnnF,EACAmnF,EAAA5zE,QAAA66E,OACA,CACA,MAAAioP,EAAAh2U,KAAAuoC,MAAAu+C,EAAAznF,OAAA,GACA+6B,KAAAysR,MAAA//N,EAAAtnF,MAAA,EAAAw2U,GAAA/pT,OAAA8hE,GAAA9hE,OAAA66D,EAAAtnF,MAAAw2U,SAGA57S,KAAAysR,MAAA3hT,KAAA6oF,GAEA3zD,KAAA46S,cAAA,EACA56S,KAAA26S,gBAAA,GAIA9jZ,kBAAA+gF,GACAooB,KAAAysR,MAAAhiT,OAAAmN,EAAA,GAGA/gF,YACAmpG,KAAA46S,cACA56S,KAAAysR,MAAArgS,KAAAouT,GAGAx6S,KAAA46S,cAAA,EAGA/jZ,WACA,MAAA8hO,EAAA,GACA,IAGAkjL,EAHAC,EAAA,EACAC,EAAA,EACAC,EAAA,EAEA,MAAA70J,EAAAnnJ,KAAA06S,WAAAt1U,QACA,KAAA+hL,EAAAliL,QAAA82U,GAAA,CACA,IAAAA,IACAF,EAAA10J,EAAAxiJ,QACAo3S,EAAA,GAGA,MAAAE,EAAAr2U,KAAAq0B,IAAA8hT,EAAAD,GAGAE,IADAH,IADA,KAAAI,KAEA,EAAAH,EACAD,KAAAI,EACAF,GAAAE,EACAH,GAAAG,EAEAH,IAAAC,GAAA50J,EAAAliL,UACA0zJ,EAAA7tJ,KAAAkxU,GACAA,EAAA,EACAF,EAAA,GAKA,IAAA,IAAA30U,EAAAwxJ,EAAA1zJ,OAAA,EAAAkC,EAAA,EAAAA,IAAA,CAEA,GAAA,IADAwxJ,EAAAxxJ,GAIA,MAFAwxJ,EAAA16I,MAMA,OAAA06I,EAGA9hO,eAEA,OADAmpG,KAAAm7S,YACAn7S,KAAAysR,MAAAriT,IAAAqwU,mCCpOA,aAEA,MAAAyB,EAAA3oZ,EAAA,uBACAqoO,EAAAroO,EAAA,sBAqBA,MAAA4oZ,EAMAtlZ,YAAAnD,EAAAg6T,GACA,KAAAh6T,aAAA+kO,YACA,MAAA,IAAA3/H,MAAA,6BAGAkH,KAAA0kE,OAAAhxK,EACAssG,KAAAo8S,QAAA1uF,EACA1tN,KAAAgxQ,QAAA,EACAhxQ,KAAAq8S,eAAA,EACAr8S,KAAAs8S,oBAAA,EAGAt8S,KAAAu8S,SAAA,GAMA1lZ,WAAAujO,GACA,IAAAoiL,EAAApiL,EAEA,KAAAp6H,KAAAq8S,eAAAG,SACAx8S,KAAAy8S,mBAGA,IAAA7xU,EAAA,EAEA,KAAA4xU,EAAA,GAAA,CACA,MAAAnpS,EAAArT,KAAAu8S,SAAAv8S,KAAAs8S,qBACAtwJ,EAAApmL,KAAAq0B,IAAAoZ,EAAAqpS,gBAAAF,GAEA5xU,GAAAA,GAAAohL,GADA34I,EAAA6lP,KAAAltG,GAEAwwJ,GAAAxwJ,EACAhsJ,KAAAq8S,gBAAArwJ,EAEA,IAAA34I,EAAAqpS,iBACA18S,KAAAs8S,sBAIA,OAAA1xU,EAMA/zE,OAAAujO,GACA,IAAAoiL,EAAApiL,EAEA,KAAAoiL,EAAA,GAAA,CACA,MAAAnpS,EAAArT,KAAAu8S,SAAAv8S,KAAAs8S,qBACAK,EAAA/2U,KAAAq0B,IAAAoZ,EAAAupS,YAAAvpS,EAAAqpS,gBAAAF,GACAnpS,EAAA8mS,OAAAwC,GACAH,GAAAG,EACA38S,KAAAq8S,gBAAAM,EAEA38S,KAAAs8S,oBAAA,GAAAjpS,EAAAupS,cAAAvpS,EAAAqpS,kBACA18S,KAAAgxQ,SACAhxQ,KAAAs8S,wBAKAzlZ,yBACAmpG,KAAAgxQ,SAEA,MAAAt9W,EAAAssG,KAAAgxQ,OAAAp1I,EAAA,CAAA57H,KAAA0kE,OAAA+zD,WAAAhvE,KAAA,CAAAzpD,KAAAgxQ,WAAAhxQ,KAAA0kE,OACAk1O,QAAA55S,KAAAo8S,QAAA1oZ,GACAm8M,EAAA,IAAAqsM,EAAAtC,GAEA55S,KAAAu8S,SAAAzxU,KAAA+kI,GACA7vG,KAAAq8S,gBAAAxsM,EAAA6sM,iBAIArpZ,EAAAC,QAjGA,SAAAo6T,GAaA,OATA,SAAAh6T,GACA,OAAAA,aAAAyoZ,EAEAzoZ,EAEA,IAAAyoZ,EAAAzoZ,EAAAg6T,KAyFAr6T,EAAAC,QAAA6oZ,aAAAA,0FC1GA,aAEA,MAAAU,EAAA,CACA,IACA,IACA,IACA,IACA,IACA,IACA,IACA,KAGAC,EAAA,CACA,EACA,EACA,EACA,GACA,GACA,GACA,IACA,KAmEA,SAAAC,EAAAx8F,EAAAvrO,EAAA/P,GAEA,OAAAs7O,EAOA,SAAAvrO,EAAA/P,GACA,OAAA43U,EAAA7nU,GAAA8nU,EAAAl3U,KAAAq0B,IAAAh1B,EAAA+P,EAAA,EAAA,IATAgoU,CAAAhoU,EAAA/P,MACA+P,EAlEA3hF,EAAAC,QAAA,MAIAuD,YAAAnD,GACAssG,KAAA0kE,OAAAhxK,EACAssG,KAAAi9S,gBAAAvpZ,EAAAuxE,OAAA,EACA+6B,KAAAk9S,eAAA,EAGArmZ,gBACA,OAAAmpG,KAAAk9S,eAAA,EAAA,EAAAl9S,KAAAi9S,gBAGApmZ,YACA,OAAA,EAAAmpG,KAAA0kE,OAAAz/F,OAMApuE,KAAAujO,GACA,IAAAoiL,EAAApiL,EACAxvJ,EAAA,EACA,KAAA4xU,GAAAx8S,KAAAm9S,aAAA,CACA,MAAA58F,EAAAvgN,KAAA0kE,OAAA1kE,KAAAi9S,iBACAP,EAAA18S,KAAAk9S,eAAA,EACAE,EAAAx3U,KAAAq0B,IAAAyiT,EAAAF,GAEA5xU,GAAAA,GAAAwyU,GADAL,EAAAx8F,EAAAm8F,EAAAU,EAAAA,GAGAZ,GAAAY,EAEAp9S,KAAAk9S,gBAAAE,EACAp9S,KAAAk9S,eAAA,IACAl9S,KAAAk9S,eAAA,EACAl9S,KAAAi9S,mBAIA,OAAAryU,EAMA/zE,OAAAujO,GAEA,IADAp6H,KAAAk9S,gBAAA9iL,EACAp6H,KAAAk9S,eAAA,GACAl9S,KAAAk9S,gBAAA,EACAl9S,KAAAi9S,iBAAA,EAIApmZ,YACA,OAAAmpG,KAAAi9S,iBAAA,kCC/EA,aAUA5pZ,EAAAC,QARA,CAAAX,EAAA,MAEAA,EACA6kF,OACA8F,MAAA,qBAAA,IACAvP,OAAAsP,uCCPA,aAEA,MAAAggU,EAAA9pZ,EAAA,uBACA61W,EAAA71W,EAAA,qBAmBAF,EAAAC,QAAA07F,GAAAo6Q,EAAAp6Q,EAAAquT,0FCtBA,aAEA,MAAAvgG,EAAAvpT,EAAA,YACA6kO,EAAA7kO,EAAA,2BACA+pZ,EAAA/pZ,EAAA,gCACAgqZ,EAAAhqZ,EAAA,cACAiqZ,EAAAjqZ,EAAA,eACAmzN,EAAAnzN,EAAA,UACA62E,EAAA72E,EAAA,WACAkqZ,QACAA,EAAAC,iBACAA,EAAAC,OACAA,GACApqZ,EAAA,WA+DA,SAAA+lO,EAAA7pH,GACA,OAAAA,aAAAgpH,WACAhpH,EAGAwuH,YAAAC,OAAAzuH,GACA,IAAAgpH,WAAAhpH,EAAAogG,OAAApgG,EAAA0uH,WAAA1uH,EAAA2uH,YAGA3uH,aAAAwuH,YACA,IAAAxF,WAAAhpH,GAGA5R,MAAA/gB,QAAA2yB,GACAgpH,WAAAhvE,KAAAh6C,GAGA2oH,EAAA3oH,EAAArR,YAGA/qG,EAAAC,QA9EAggJ,gBAAAtkD,GAEA,GAAAyuT,EAAAzuT,SACAsqI,EAAAtqI,QAIA,GAAA,iBAAAA,GAAAA,aAAA3oB,aACAizJ,EAAAtqI,EAAAoP,gBADA,CAMA,IAAAu/S,EAAA3uT,GAAA,CAWA,GALA0uT,EAAA1uT,KACAA,EAAAsuT,EAAAtuT,IAIA94F,OAAAu0J,YAAAz7D,GAAA94F,OAAAy6N,iBAAA3hI,EAAA,CAEA,MAAA4uT,EAAAJ,EAAAxuT,IAGAt7F,MAAAA,EAAAo2K,KAAAA,SAAA8zO,EAAAC,OAEA,GAAA/zO,EAGA,kBADA,IAOA,GAHA8zO,EAAA9yU,KAAAp3E,GAGAyyE,OAAAs/K,UAAA/xP,GAEA,kBADA+kO,WAAAhvE,WAAAi9D,EAAAk3L,KAKA,GAAAH,EAAA/pZ,IAAA,iBAAAA,GAAAA,aAAA2yE,OAEA,kBADA+D,EAAAwzU,EAAAtkL,IAKA,MAAAwjF,EAAA,IAAAhkN,MAAA,qBAAA9J,KAAA,8BAtCAuuT,EAAAvuT,6NChCA,aAoCA37F,EAAAC,QAtBAggJ,gBAAAk9E,EAAA77N,EAAA,IACA,MAAAm8N,EAAAN,EAAAO,YAEA,IACA,OAAA,CACA,MAAAnmJ,QAAAkmJ,EAAAE,OAEA,GAAApmJ,EAAAk/F,KACA,aAGAl/F,EAAAl3E,OAEA,SACA,IAAAiB,EAAAmpZ,eACAhtL,EAAAk3I,SAGAl3I,EAAAG,8CC9BA,aAEA,MAAA8sL,EAAAxqZ,EAAA,gCAgBAF,EAAAC,QAVA,SAAAy2N,GACA,MAAA,mBAAAA,EAAAyG,OACAutL,EAAAh0L,EAAAyG,UAKAutL,EAAA,IAAAxsL,SAAAxH,GAAA9jJ,2ECjBA,aA2EA5yE,EAAAC,QAnCA,SAAAs2U,GAEA,MAAAn/K,EAAA+rE,GAAAozG,EAAA1zU,OAAAy6N,eAEA,CAAAi5G,EAAA1zU,OAAAy6N,iBAAAz6N,OAAAy6N,eAEA,CAAAi5G,EAAA1zU,OAAAu0J,YAAAv0J,OAAAu0J,UAGAwsB,EAAA,GAGA,MAAA,CACA4mO,KAAA,IACApzP,EAAArtE,OAEAtS,KAAAp3E,IACAujL,EAAAnsG,KAAAp3E,IAEA0pF,KAAA,IACA65F,EAAAhyG,OACA,CACA6kG,MAAA,EACAp2K,MAAAujL,EAAAtyE,SAIA8lD,EAAArtE,OAEAvmF,CAAA2/N,KACA,OAAAx2H,sCCtEA,aAEA,MAAAq7J,KAAAA,GAAAh8J,WAmCAhsG,EAAAC,QAAA,CACAmqZ,QA9BA,SAAA5+S,GACA,OAAAo/H,YAAAC,OAAAr/H,IAAAA,aAAAo/H,aA8BA0/K,OAvBA,SAAA9+S,GACA,YAAA,IAAAw8J,GAAAx8J,aAAAw8J,GAuBA2iJ,aAdA,SAAAn/S,GACA,MAAA,iBAAAA,IAAAA,EAAAlsG,MAAAksG,EAAA93B,UAcA22U,iBAPAhqZ,GACAA,GAAA,mBAAAA,EAAAq9N,yCCnCA,aAEA,MAAA+rF,EAAAvpT,EAAA,YACA+pZ,EAAA/pZ,EAAA,gCACAiqZ,EAAAjqZ,EAAA,eACA62E,EAAA72E,EAAA,WACAkqZ,QACAA,EAAAE,OACAA,EAAAD,iBACAA,EAAAM,aACAA,GACAzqZ,EAAA,YACAkuW,WACAA,EAAAD,UACAA,GACAjuW,EAAA,eA4FA+/I,eAAA2qQ,EAAAjvT,EAAAquT,GAEA,MAAA1qZ,KAAAA,EAAA+nF,KAAAA,EAAAijP,MAAAA,EAAA52P,QAAAA,GAAAioB,EAGA8R,EAAA,CACAnuG,KAAAA,GAAA,GACA+nF,KAAA8mR,EAAA9mR,GACAijP,MAAA8jC,EAAA9jC,IAUA,OAPA52P,EACA+5B,EAAA/5B,cAAAs2U,EAAAt2U,GACAp0E,IAEAmuG,EAAA/5B,cAAAs2U,EAAAruT,IAGA8R,EAjGAztG,EAAAC,QAAAggJ,gBAAAtkD,EAAAquT,GACA,GAAAruT,MAAAA,EAKA,GAAA,iBAAAA,GAAAA,aAAA3oB,aACA43U,EAAAjvT,EAAAoP,WAAAi/S,QAMA,GAAAI,EAAAzuT,IAAA2uT,EAAA3uT,SACAivT,EAAAjvT,EAAAquT,OADA,CAWA,GALAK,EAAA1uT,KACAA,EAAAsuT,EAAAtuT,IAIA94F,OAAAu0J,YAAAz7D,GAAA94F,OAAAy6N,iBAAA3hI,EAAA,CAEA,MAAA4uT,EAAAJ,EAAAxuT,IAGAt7F,MAAAA,EAAAo2K,KAAAA,SAAA8zO,EAAAC,OAEA,GAAA/zO,EAGA,kBADA,IAQA,GAJA8zO,EAAA9yU,KAAAp3E,GAIAyyE,OAAAs/K,UAAA/xP,IAAA+pZ,EAAA/pZ,GAEA,kBADAuqZ,EAAAL,EAAAP,IAOA,GAAAW,EAAAtqZ,IAAAiqZ,EAAAjqZ,IAAA,iBAAAA,GAAAA,aAAA2yE,OAEA,kBADA+D,EAAAwzU,GAAAlqZ,GAAAuqZ,EAAAvqZ,EAAA2pZ,MAQA,GAAA3pZ,EAAAwC,OAAAu0J,WAAA/2J,EAAAwC,OAAAy6N,gBAAA+sL,EAAAhqZ,GAEA,kBADA02E,EAAAwzU,GAAAlqZ,GAAAuqZ,EAAAvqZ,EAAA2pZ,MAQA,IAAAW,EAAAhvT,GAKA,MAAA8tN,EAAA,IAAAhkN,MAAA,4BAAA9J,GAAA,8BAJAivT,EAAAjvT,EAAAquT,2KChGA,aA0BA,MAwCAa,EAAAjT,IACA,MAAAt2Y,EAAA,GACAsxG,EAAAglS,EAAAnrT,MAAA,KACA,OAAAmmB,EAAAhhC,QACA,KAAA,EACAtwE,EAAAg4Y,aAAA,OACA,MACA,KAAA,EACAh4Y,EAAAg4Y,aAAAwR,EAAAl4S,EAAA,GAAA,OACA,MACA,KAAA,EACAtxG,EAAA83Y,aAAA0R,EAAAl4S,EAAA,GAAA,OACAtxG,EAAAg4Y,aAAAwR,EAAAl4S,EAAA,GAAA,OACAtxG,EAAA+3Y,aAAAyR,EAAAl4S,EAAA,GAAA,OACA,MACA,QACA,MAAA,IAAAnN,MAAA,yFAGA,OAAAnkG,GASAwpZ,EAAA,CAAA3oT,EAAA3iG,KACA,MAAAoqG,EAAA72B,SAAAovB,GACA,GAAA0J,MAAAjC,GACA,MAAA,IAAAnE,MAAA,qBAAAjmG,wBAGA,OAAAoqG,GAGA5pG,EAAAC,QAAA,CACA6qZ,eAAAA,EACAD,iBAAAA,EACAtT,mBAhFAK,IACA,GAAAA,EAIA,CAAA,GAAAA,EAAA9uT,WAAA,SAAA,CACA,MAAAiiU,EAAAnT,EAAAnrT,MAAA,KAAA,GACAmd,EAAA72B,SAAAg4U,GACA,GAAAl/S,MAAAjC,GACA,MAAA,IAAAnE,MAAA,6CAEA,MAAA,CACAmyS,QAAA,QACAyB,aAAAzvS,GAEA,GAAAguS,EAAA9uT,WAAA,SACA,MAAA,CACA8uT,QAAA,WACAiT,EAAAjT,IAGA,MAAA,IAAAnyS,MAAA,gCAAAmyS,KAnBA,MAAA,CACAA,QAAA,yCC7BA,aAEA,MAAA9qH,SAAAA,GAAA5sR,EAAA,yBACA+pU,iBAAAA,GAAA/pU,EAAA,YACAupU,EAAAvpU,EAAA,2CACAg7N,EAAAh7N,EAAA,QASAF,EAAAC,QAAA,UAAA+mU,KAAAA,EAAAF,QAAAA,IA0BA,OAAA2C,GAtBAxpL,gBAAAw3E,EAAAn2N,EAAA,IAGA,GAFAm2N,EAAAwyG,EAAAxyG,IAEA,IAAAn2N,EAAAwlU,QAAA,CACA,MAAAkkF,EAAAvzL,EAAAhrI,MAAA,KACAq6O,EAAA,IAAA5rG,EAAA8vL,EAAA,KAGA,MAAAv9S,QAAAq/K,EAAAr1D,EAAAuvG,EAAA1lU,GAGA,GAAA,cAAAmsG,EAAAh6B,KACA,MAAA,IAAAgyB,MAAA,gCAGA,IAAAgI,EAAA/5B,QACA,MAAA,IAAA+xB,MAAA,sCAGAgI,EAAA/5B,QAAApyE,qJCrCA,aAEA,MAAAmoT,EAAAvpT,EAAA,YACAg7N,EAAAh7N,EAAA,QACAyyK,EAAAzyK,EAAA,eACAwoF,EAAAxoF,EAAA,WA0BA+qZ,EAAA3rZ,IACA,GAAAA,aAAA8lO,WACA,MAAA,CACA9K,IAAA,IAAAY,EAAA57N,GACA4rZ,UAAA,IAIA,GAAAhwL,EAAAsM,MAAAloO,GACA,MAAA,CACAg7N,IAAAh7N,EACA4rZ,UAAA,IAIA,GAAA,iBAAA5rZ,EAAA,CACA,IAAAA,EAAA64E,QAAA,YACA74E,EAAAA,EAAAmpG,UAAA,IAGA,MAAAgjI,EA/BA,EAAAnsO,EAAA,MAEAA,EACA6kF,OACA8F,MAAA,qBAAA,IACAvP,OAAAsP,SA0BAm5T,CAAA7jZ,GAEA,MAAA,CACAg7N,IAAA,IAAAY,EAAAuQ,EAAA,IACAy/K,UAAAz/K,EAAA15J,MAAA,IAIA,MAAA03O,EAAA,IAAAhkN,MAAA,qBAAAnmG,KAAA,iBAQA2gJ,eAAAkrQ,EAAA7rZ,EAAA0nU,EAAA1lU,EAAA,IACA,IAAAg5N,IACAA,EAAA4wL,UACAA,GACAD,EAAA3rZ,GACAE,EAAA86N,EAAAvvH,WACAqgT,EAAA5rZ,EACA,MAAA6rZ,EAAAH,EAAAt5U,OAEA,OAAA,CACA,MAAA2F,QAAAo7F,EAAA2nD,EAAA96N,EAAA4rZ,EAAAF,EAAAG,EAAArkF,EAAA1lU,GAEA,IAAAi2E,EAAAmrG,QAAAnrG,EAAAwS,KACA,MAAA0/N,EAAA,IAAAhkN,MAAA,qBAAAnmG,KAAA,iBAOA,GAJAi4E,EAAAmrG,cACAnrG,EAAAmrG,QAGAnrG,EAAAwS,KACA,OAIAmhU,EAAA3zU,EAAAwS,KAAAmhU,UACA5wL,EAAA/iJ,EAAAwS,KAAAuwI,IACA96N,EAAA+3E,EAAAwS,KAAAvqF,KACA4rZ,EAAA7zU,EAAAwS,KAAAzqF,MASA2gJ,eAAA6sI,EAAAxtR,EAAA0nU,EAAA1lU,EAAA,IACA,MAAAi2E,QAAAmR,EAAAyiU,EAAA7rZ,EAAA0nU,EAAA1lU,IAEA,IAAAi2E,EACA,MAAAkyO,EAAA,IAAAhkN,MAAA,qBAAAnmG,KAAA,iBAGA,OAAAi4E,EA2CAv3E,EAAAC,QAAA,CACA6sR,SAAAA,EACAq+H,SAAAA,EACA56C,UAtCAtwN,gBAAA3gJ,EAAA0nU,EAAA1lU,EAAA,IACA,MAAAsyE,QAAAk5M,EAAAxtR,EAAA0nU,EAAA1lU,GAEA,GAAAsyE,UAIAA,EAEA,cAAAA,EAAAH,MACA,UAAA,MAAA4D,KAUA4oE,eAAAqrQ,EAAA13U,EAAAtyE,GACA,UAAA,MAAAmsG,KAAA75B,EAAAF,QAAApyE,SACAmsG,EAEAA,aAAA23H,YAIA,cAAA33H,EAAAh6B,aACA63U,EAAA79S,EAAAnsG,IAnBAgqZ,CAAA13U,EAAAtyE,SACA+1E,uGClIA,aAEA,MAAAoyO,EAAAvpT,EAAA,YAcAwpT,EAAA,CACArjE,SAAAnmP,EAAA,eACAu2F,IAAAv2F,EAAA,SACAomP,WAAApmP,EAAA,cACAkzG,SAAAlzG,EAAA,eAgBAF,EAAAC,QAVA,SAAA0yK,EAAA2nD,EAAA96N,EAAAF,EAAA4rZ,EAAAtmM,EAAAoiH,EAAA1lU,GACA,MAAA2yF,EAAAy1N,EAAApvF,EAAAgN,OAEA,IAAArzI,EACA,MAAAw1N,EAAA,IAAAhkN,MAAA,yBAAA60H,EAAAgN,SAAA,mBAGA,OAAArzI,EAAAqmI,EAAA96N,EAAAF,EAAA4rZ,EAAAv4O,EAAAiyC,EAAAoiH,EAAA1lU,oICjCA,aAEA,MAAAmoT,EAAAvpT,EAAA,aACAikU,OAAAA,GAAAjkU,EAAA,eACAqrZ,EAAArrZ,EAAA,iCA0BAsrZ,EAAA,CACA/0T,IAAAv2F,EAAA,kBACAutG,KAAAvtG,EAAA,kBACAurZ,UAAAvrZ,EAAA,uBACAwrZ,yBAAAxrZ,EAAA,oCACA+1W,SAAA,CAAA37I,EAAA1mJ,EAAAw2P,EAAA9qU,EAAAqzK,EAAAiyC,EAAAoiH,IACA,IAAA,GAEA2kF,QAAA,CAAArxL,EAAA1mJ,EAAAw2P,EAAA9qU,EAAAqzK,EAAAiyC,EAAAoiH,IACA,IAAA,IAsEAhnU,EAAAC,QA/DAggJ,MAAAq6E,EAAA96N,EAAAF,EAAA4rZ,EAAAv4O,EAAAiyC,EAAAoiH,EAAA1lU,KACA,MAAAsyE,QAAAozP,EAAA74O,IAAAmsI,EAAAh5N,GACA,IAAA8oU,EACArgP,EAEAvqF,IACAA,EAAA86N,EAAAvvH,YAGA,IACAq/N,EAAAjG,EAAA85D,UAAArqT,EAAA04K,MACA,MAAAlmJ,GAEA,MAAAqjN,EAAArjN,EAAA,kBAOA,GAJA9mG,IACAA,EAAAE,GAGA0rZ,EAAAt5U,OAAA,CACA,IAAAg6U,EASA,GALAA,EAFAxhF,GAAA,2BAAAA,EAAA32P,WAEA83U,EAAA33U,EAAAs3U,EAAA,GAAAlkF,GAlDA,EAAApzP,EAAAp0E,KACA,MAAA+mF,EAAA3S,EAAAq3R,MAAAngR,MAAAvE,GAAAA,EAAAi8Q,OAAAhjW,IAEA,OAAA+mF,GAAAA,EAAAy5N,MAiDA6rG,CAAAj4U,EAAAs3U,EAAA,KAGAU,EACA,MAAAniG,EAAA,IAAAhkN,MAAA,uBAAA,iBAIA,MAAAqmT,EAAAZ,EAAA55S,QAGAvnB,EAAA,CACAuwI,IAAAsxL,EACAV,UAAAA,EACA1rZ,KAAAssZ,GAAA,GACAxsZ,KANA,GAAAA,KAAAwsZ,KAUA,MAAA,CACAppO,MAAA,CACAjvG,KAAA22P,EAAA0kC,cAAA,YAAA,OACAtvW,KAAAA,EACAF,KAAAA,EACAg7N,IAAAA,EAEA5mJ,QAAA83U,EAAAphF,EAAA32P,MAAA6mJ,EAAA1mJ,EAAAw2P,EAAA9qU,EAAAqzK,EAAAiyC,EAAAoiH,GACAoD,OAAAA,EACAxlH,MAAAA,EACAhxI,KAAAA,EACAg2B,KAAAwgO,EAAAC,YAEAtgP,KAAAA,oNCzGA,aAEA,MAAAu6T,OAAAA,EAAAD,WAAAA,GAAAnkZ,EAAA,iBACA86N,EAAA96N,EAAA,sBAYAm6T,EAAAp6K,eAAAi9E,GACA,MAMA08K,SANA5+K,EAAAkC,EAAA,gBAMAnrJ,MAAA,EAAA,IACAH,EAAAgoU,EAAAhoU,OACA2F,EAAA,IAAA6tJ,WAAAxzJ,GAEA,IAAA,IAAAkC,EAAA,EAAAA,EAAAlC,EAAAkC,IACAyD,EAAA3F,EAAAkC,EAAA,GAAA8lU,EAAA9lU,GAGA,OAAAyD,GA4BAw0U,EAAAp2M,GACAA,EACA5qG,SAAA,IACA1I,cACA2yR,SAAA,EAAA,KACAvsR,UAAA,EAAA,GAkCA8iT,EAAAtrQ,MAAArsE,EAAAp0E,EAAAwnU,EAAA7wP,EAAA70E,KACA,IAAA60E,EAAA,CACA,MAAA61U,EAAA3H,EAAA,CACAhqF,OAAAA,IAGAlkP,EAAA,CACA61U,WAAAA,EACAC,UAAA,EACAC,WAAAF,GApEA,IAAAtgD,EAAA64C,EAAAyH,QAAAtgD,EAwEA93R,EAAAq3R,MAxEAs5C,EAwEApuU,EAAA+1U,WAxEAF,EAwEA71U,EAAA61U,WAvEAt5O,QAAA2gD,IACAq4I,EAAA30R,KAAAwP,IACA,GAAA,IAAAA,EAAAi8Q,KAAA5wR,OAAA,CACA,MAAA2S,EAAAxR,SAAAwT,EAAAi8Q,KAAA,IAEA,OAAA+hD,EAAAkC,aAAAliU,EAAA,IAAA+/T,EAAA,CACAtkS,KAAAgsS,EAAA19O,SAAAtuD,KACA+mH,KAAAilL,EAAA19O,SAAAy4D,MACAw9K,EAAAhgU,IAGA,OAAAynU,EAAAhuL,IAAAz3I,EAAAi8Q,KAAA/5P,UAAA,IAAA,QA8DA,MAAAktG,QAAAx/H,EAAA61U,WAAArG,qBAAAnmZ,GACA,IAAA83F,EAAAy0T,EAAAp2M,EAAApxH,KACA,MAAA4nU,EA7CA,CAAAx2M,IACA,IAAA4uM,EAAA5uM,EAAA4uM,OACA,MAAAjlZ,EAAA,GAEA,KAAAilZ,EAAAkB,SACAnmZ,EAAAm4E,KAAA8sU,GAEAA,EAAAA,EAAAkB,QAKA,OAFAnmZ,EAAAm4E,KAAA8sU,GAEAjlZ,EAAAutN,WAiCAu/L,CAAAz2M,GAEAw2M,EAAAv6U,OAAAuE,EAAA81U,YACA91U,EAAA+1U,WAAAC,EAAAh2U,EAAA81U,WAEA30T,EAAAy0T,EAAA51U,EAAA+1U,WAAAxG,eAGA,MAAAn/T,EAAA3S,EAAAq3R,MAAAngR,MAAAvE,IACA,MAAA8lU,EAAA9lU,EAAAi8Q,KAAA/5P,UAAA,EAAA,GACA6jT,EAAA/lU,EAAAi8Q,KAAA/5P,UAAA,GAEA,OAAA4jT,IAAA/0T,KAKAg1T,GAAAA,IAAA9sZ,MAQA,OAAA+mF,EAIAA,EAAAi8Q,KAAA/5P,UAAA,KAAAjpG,EACA+mF,EAAAy5N,MAGA7pO,EAAA81U,YAEAr4U,QAAAozP,EAAA74O,IAAA5H,EAAAy5N,KAAA1+S,GAEAiqZ,EAAA33U,EAAAp0E,EAAAwnU,EAAA7wP,EAAA70E,IAXA,MAcAtB,EAAAC,QAAAsrZ,oFC1JA,aAEA,MAAAgB,EAAArsZ,EAAA,0CACAssZ,EAAAtsZ,EAAA,8CACAikU,OAAAA,GAAAjkU,EAAA,eACAupT,EAAAvpT,EAAA,YAiBA+/I,eAAAwsQ,EAAAzlF,EAAApzP,EAAA+N,EAAAhQ,EAAA+6U,EAAA,EAAAprZ,GAEA,GAAAsyE,aAAAwxJ,WAAA,CACA,MAAAlI,EAAAqvL,EAAA34U,EAAA84U,EAAA/qU,EAAAhQ,GAQA,OANAurJ,EAAAtrJ,eACAsrJ,GAGAwvL,GAAAxvL,EAAAtrJ,OAKA,IAAA67B,EAEA,IACAA,EAAA02N,EAAA85D,UAAArqT,EAAA04K,MACA,MAAAlmJ,GACA,MAAAqjN,EAAArjN,EAAA,kBAIA,GAAAqH,EAAA4rD,MAAA5rD,EAAA4rD,KAAAznF,OAAA,CACA,MAAAsrJ,EAAAqvL,EAAA9+S,EAAA4rD,KAAAqzP,EAAA/qU,EAAAhQ,GAEAurJ,EAAAtrJ,eACAsrJ,GAGAwvL,GAAAj/S,EAAA4rD,KAAAznF,OAGA,IAAA+6U,EAAAD,EAGA,IAAA,IAAA54U,EAAA,EAAAA,EAAAF,EAAAq3R,MAAAr5R,OAAAkC,IAAA,CACA,MAAA84U,EAAAh5U,EAAAq3R,MAAAn3R,GACA+4U,EAAAH,EAAAj/S,EAAAihQ,WAAA56R,GAEA,GAAA6N,GAAAgrU,GAAAhrU,EAAAkrU,GACAl7U,EAAAg7U,GAAAh7U,GAAAk7U,GACAlrU,EAAAgrU,GAAAh7U,EAAAk7U,EAAA,CACA,MAAAx1U,QAAA2vP,EAAA74O,IAAAy+T,EAAA5sG,KAAA,CACAxjF,OAAAl7N,EAAAk7N,SAGA,UAAA,MAAAU,KAAAuvL,EAAAzlF,EAAA3vP,EAAAsK,EAAAhQ,EAAA+6U,EAAAprZ,GACAorZ,GAAAxvL,EAAAtrJ,aAEAsrJ,EAIAwvL,EAAAG,EACAF,EAAAE,EAAA,GAgCA7sZ,EAAAC,QAzBA,CAAAq6N,EAAA1mJ,EAAAw2P,EAAA9qU,EAAAqzK,EAAAiyC,EAAAoiH,IAIA,SAAA1lU,EAAA,IACA,MAAA+oU,EAAAD,EAAAC,WAEA,QAAAhoU,IAAAgoU,EACA,MAAA,IAAA5kO,MAAA,wBAGA,MAAA/zB,OACAA,EAAAE,OACAA,GACA46U,EAAAniF,EAAA/oU,EAAAowE,OAAApwE,EAAAswE,QAKA,OAAA66U,EAAAzlF,EAAApzP,EAHAlC,EACAA,EAAAE,EAEA,EAAAtwE,+KCvGA,aAQAtB,EAAAC,QAAA,SAAAk6J,EAAA2yP,EAAAC,EAAAC,GACA,MACAC,EAAAH,EADA3yP,EAAAvoF,OAGA,OAAAm7U,GAAAE,GAAAD,EAAAF,EAGA,IAAA1nL,WAAA,IAGA4nL,GAAAF,GAAAE,EAAAC,IAEA9yP,EAAAA,EAAApoF,MAAA,EAAAi7U,EAAAF,IAGAC,GAAAD,GAAAC,EAAAE,IAEA9yP,EAAAA,EAAApoF,MAAAg7U,EAAAD,IAGA3yP,kCC5BA,aAEA,MAAAsvJ,EAAAvpT,EAAA,YAsCAF,EAAAC,QA/BA,CAAA2pG,EAAAl4B,EAAAE,KAKA,GAJAF,IACAA,EAAA,GAGAA,EAAA,EACA,MAAA+3O,EAAA,IAAAhkN,MAAA,6CAAA,sBAGA,GAAA/zB,EAAAk4B,EACA,MAAA6/M,EAAA,IAAAhkN,MAAA,0CAAA,sBAOA,GAJA7zB,GAAA,IAAAA,IACAA,EAAAg4B,EAAAl4B,GAGAE,EAAA,EACA,MAAA63O,EAAA,IAAAhkN,MAAA,6CAAA,sBAOA,OAJA/zB,EAAAE,EAAAg4B,IACAh4B,EAAAg4B,EAAAl4B,GAGA,CACAA,OAAAA,EACAE,OAAAA,oDCpCA,aAiCA5xE,EAAAC,QAtBA,CAAAq6N,EAAA1mJ,EAAAw2P,EAAA9qU,EAAAqzK,EAAAiyC,EAAAoiH,IAKA/mL,gBAAA3+I,EAAA,IACA,MAAAowE,EAAApwE,EAAAowE,QAAA,EACAE,EAAAtwE,EAAAswE,QAAAgC,EAAAq3R,MAAAr5R,OACA85R,EAAA93R,EAAAq3R,MAAAl5R,MAAAL,EAAAE,GAEA,IAAA,MAAA2U,KAAAmlR,EAAA,CACA,MAAAn0R,QAAAo7F,EAAApsF,EAAAy5N,KAAAz5N,EAAAi8Q,KAAA,GAAAljW,KAAAinF,EAAAi8Q,OAAA,GAAA59I,EAAA,EAAAoiH,EAAA1lU,GAEAi2E,EAAAmrG,cACAnrG,EAAAmrG,uCCzBA,aAoCAziC,eAAAitQ,EAAAt5U,EAAAt0E,EAAAqzK,EAAAiyC,EAAAoiH,EAAA1lU,GACA,MAAAoqW,EAAA93R,EAAAq3R,MAEA,IAAA,MAAA1kR,KAAAmlR,EAAA,CACA,MAAAlsW,EAAA+mF,EAAAi8Q,KAAA/5P,UAAA,GAEA,GAAAjpG,EAAA,CACA,MAAA+3E,QAAAo7F,EAAApsF,EAAAy5N,KAAAxgT,EAAA,GAAAF,KAAAE,IAAA,GAAAolN,EAAA,EAAAoiH,EAAA1lU,SAEAi2E,EAAAmrG,UACA,CAEA9uG,QAAAozP,EAAA74O,IAAA5H,EAAAy5N,MAEA,UAAA,MAAAvyM,KAAAy/S,EAAAt5U,EAAAt0E,EAAAqzK,EAAAiyC,EAAAoiH,EAAA1lU,SACAmsG,IAMAztG,EAAAC,QA3CA,CAAAq6N,EAAA1mJ,EAAAw2P,EAAA9qU,EAAAqzK,EAAAiyC,EAAAoiH,IAKA,SAAA1lU,EAAA,IACA,OAAA4rZ,EAAAt5U,EAAAt0E,EAAAqzK,EAAAiyC,EAAAoiH,EAAA1lU,kCCpBA,aAEA,MAAAmoT,EAAAvpT,EAAA,YACAqsZ,EAAArsZ,EAAA,oCACAssZ,EAAAtsZ,EAAA,uCAiDAF,EAAAC,QArBAggJ,MAAAq6E,EAAA96N,EAAAF,EAAA4rZ,EAAAv4O,EAAAiyC,EAAAoiH,EAAA1lU,KACA,GAAA4pZ,EAAAt5U,OACA,MAAA63O,EAAA,IAAAhkN,MAAA,iBAAAnmG,uBAAAg7N,KAAA,iBAGA,MAAA4C,QAAA8pG,EAAA74O,IAAAmsI,EAAAh5N,GAEA,MAAA,CACAohL,MAAA,CACAjvG,KAAA,MACAj0E,KAAAA,EACAF,KAAAA,EACAg7N,IAAAA,EACA5mJ,SAhCAE,EAgCAspJ,EA5BAj9E,gBAAA3+I,EAAA,IACA,MAAAowE,OACAA,EAAAE,OACAA,GACA46U,EAAA54U,EAAAhC,OAAAtwE,EAAAowE,OAAApwE,EAAAswE,cAEA26U,EAAA34U,EAAA,EAAAlC,EAAAA,EAAAE,KAuBAgzI,MAAAA,EACAh7G,KAAAszH,EAAAtrJ,OACAgC,KAAAspJ,IAnCA,IAAAtpJ,4ICbA,aAEA,MAAAsnJ,EAAAh7N,EAAA,QACAupT,EAAAvpT,EAAA,YAqEAF,EAAAC,QA5DAggJ,MAAAq6E,EAAA96N,EAAAF,EAAA4rZ,EAAAv4O,EAAAiyC,EAAAoiH,EAAA1lU,KACA,MAAAuhI,QAAAmkM,EAAA74O,IAAAmsI,EAAAh5N,GACA64J,QAAA6sK,EAAA74O,IAAA,IAAA+sI,EAAA,EAAA,MAAAZ,EAAAW,YACA,IAAAkyL,EAAAtqR,EACAuqR,EAAA9tZ,EAEA,KAAA4rZ,EAAAt5U,QAAA,CACA,MAAA0T,EAAA4lU,EAAA,GAEA,KAAA5lU,KAAA6nU,GA+BA,MAAA1jG,EAAA,IAAAhkN,MAAA,qBAAAngB,wBAAAg1I,KAAA,eA1BA,GAHA4wL,EAAA55S,QACA87S,EAAA,GAAAA,KAAA9nU,IAEA41I,EAAAsM,MAAA2lL,EAAA7nU,IACA,MAAA,CACAo9F,MAAA,CACAjvG,KAAA,SACAj0E,KAAAA,EACAF,KAAAA,EACAg7N,IAAAA,EACA1mJ,KAAAumF,EACAyqD,MAAAA,EACAh7G,KAAAuwD,EAAAvoF,OACA8B,QAAAusE,wBACApd,IAGA94C,KAAA,CACAuwI,IAAA6yL,EAAA7nU,GACA9lF,KAAA8lF,EACAhmF,KAAA8tZ,EACAlC,UAAAA,IAKAiC,EAAAA,EAAA7nU,GAOA,MAAA,CACAo9F,MAAA,CACAjvG,KAAA,SACAj0E,KAAAA,EACAF,KAAAA,EACAg7N,IAAAA,EACA1mJ,KAAAumF,EACAyqD,MAAAA,EACAh7G,KAAAuwD,EAAAvoF,OACA8B,QAAAusE,wBACApd,mEClEA,aAEA,MAAA4mL,EAAAvpT,EAAA,YACAqsZ,EAAArsZ,EAAA,oCACAssZ,EAAAtsZ,EAAA,uCACAwkO,EAAAxkO,EAAA,sBAAA+6N,UAkDAj7N,EAAAC,QArBAggJ,MAAAq6E,EAAA96N,EAAAF,EAAA4rZ,EAAAv4O,EAAAiyC,EAAAoiH,EAAA1lU,KACA,GAAA4pZ,EAAAt5U,OACA,MAAA63O,EAAA,IAAAhkN,MAAA,iBAAAnmG,uBAAAg7N,KAAA,iBAGA,MAAA4C,QAAAwH,EAAA3zH,OAAAupH,EAAAW,WAEA,MAAA,CACAv4C,MAAA,CACAjvG,KAAA,WACAj0E,KAAAA,EACAF,KAAAA,EACAg7N,IAAAA,EACA5mJ,SAhCAE,EAgCAspJ,EAAA2I,OA5BA5lF,gBAAA3+I,EAAA,IACA,MAAAowE,OACAA,EAAAE,OACAA,GACA46U,EAAA54U,EAAAhC,OAAAtwE,EAAAowE,OAAApwE,EAAAswE,cAEA26U,EAAA34U,EAAA,EAAAlC,EAAAA,EAAAE,KAuBAgzI,MAAAA,EACAh7G,KAAAszH,EAAAtrJ,OACAgC,KAAAspJ,EAAA2I,SAnCA,IAAAjyJ,yKCfA,aAEA,MAAAk5M,EAAA5sR,EAAA,wBACAupT,EAAAvpT,EAAA,aACA+pU,iBAAAA,EAAAE,QAAAA,GAAAjqU,EAAA,YACAupU,EAAAvpU,EAAA,2CACAg7N,EAAAh7N,EAAA,QASAF,EAAAC,QAAA,UAAA+mU,KAAAA,EAAAF,QAAAA,IAyBA,OAAA2C,GArBAxpL,gBAAAw3E,EAAAn2N,EAAA,IACA,IAAA,IAAAA,EAAAwlU,QAAA,CACA,IAAAkkF,EAEA,IACAA,EAAA/gF,EAAAxyG,GAAAhrI,MAAA,KACA,MAAA2Z,GACA,MAAAqjN,EAAArjN,EAAA,oBAGA0gO,EAAA,IAAA5rG,EAAA8vL,EAAA,KAGA,UAAA,MAAAv9S,KAAAq/K,EAAAyjF,UAAA94I,EAAAuvG,EAAA1lU,SACA6oU,EAAA18N,EAAA,IACAnsG,EACAipU,gBAAA,uKCnCA,aAEA,MAAAz9C,SAAAA,EAAAyjF,UAAAA,GAAArwW,EAAA,wBACAupT,EAAAvpT,EAAA,aACA+pU,iBAAAA,EAAAE,QAAAA,GAAAjqU,EAAA,YACAupU,EAAAvpU,EAAA,2CACAg7N,EAAAh7N,EAAA,QASAF,EAAAC,QAAA,UAAA+mU,KAAAA,EAAAF,QAAAA,IA6CA,OAAA2C,GAzCAxpL,gBAAAw3E,EAAAn2N,EAAA,IACA,MACA0pZ,EADA/gF,EAAAxyG,GACAhrI,MAAA,MAEA,IAAAnrF,EAAAwlU,SACAA,EAAA,IAAA5rG,EAAA8vL,EAAA,KAGA,MAAAv9S,QAAAq/K,EAAAr1D,EAAAuvG,EAAA1lU,GAEA,GAAA,SAAAmsG,EAAAh6B,KAAA,CAKA,GAAA,cAAAg6B,EAAAh6B,KAuBA,MAAAg2O,EAAA,IAAAhkN,MAAA,uBAAAgI,EAAAh6B,QAAA,2BAtBA,GAAAnyE,EAAAivW,UAAA,CACA,UAAA,MAAAl5R,KAAAk5R,EAAA9iQ,EAAA6sH,IAAA0sG,EAAA1lU,GACAmsG,EAAA6sH,IAAAoM,wBAAArvJ,EAAAijJ,IAAAoM,8BAIAyjG,EAAA9yP,EAAA/1E,IAGA,OAGA,UAAA,MAAA+1E,KAAAo2B,EAAA/5B,UAAA,CACA,MAAAgvG,EAAAynJ,EAAA9yP,EAAA/1E,GACAohL,EAAAkiC,cAEAliC,cArBAynJ,EAAA18N,EAAAnsG,wKC9BA,aAEA,MAAA+rZ,EAAAntZ,EAAA,sBACAupU,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA0mU,KAAAA,KAiBA8C,GAbAxpL,eAAAquB,EAAA,IACA,MAAAg/O,QAAA3mF,EAAAt2N,QAAAliB,MAEA,MAAA,CACAkiB,QAAAg9S,EAAAh9S,QACAs2N,KAAA,GAAA2mF,IAGAtnD,OAAAqnD,EAAAE,SAAA,GACAC,sBAAAH,EAAAI,gBAAA,0vHCtBA,aAEA,MAAAC,EAAAxtZ,EAAA,sBAAAmwG,SACAy3M,UAAAA,GAAA5nT,EAAA,aACAupU,EAAAvpU,EAAA,2CACA8kO,EAAA9kO,EAAA,yBACAw6N,EAAAx6N,EAAA,YACA2vW,gBAAAA,GAAA3vW,EAAA,aAOAF,EAAAC,QAAA,EAAAooO,OAAAA,EAAAw+F,QAAAA,KA4DA4C,GAxDAxpL,eAAA3+I,EAAA,IACAA,EAAA+mO,SAAAA,EAAA7C,sBACAlkO,EAAA+mO,OAGA,MAAA+/F,EAAAvB,EAAAwB,MAEA,IAAAD,EAAA,CACA,GAAA9mU,EAAA+mO,OACA,MAAA,IAAAwnI,EAKA,MAAA,CACAj/Q,GAHAy3I,EAAA7C,cAIA65C,UAAAr6C,EAAAqD,EAAAlD,OAAAG,MAAA,aACAikG,UAAA,GACApxG,aAAA,WAAAu1L,IACAC,gBAAA,OACAnkG,UAAA,IAIA,MAAA54N,EAAAtvF,EAAA+mO,OAAA3N,EAAA0M,oBAAA9lO,EAAA+mO,OAAAt9H,YAAAs9H,GACAigG,OAAAA,GAAAF,EAEA/oD,EAAA/9Q,EAAA+mO,OAAAigG,EAAAslF,UAAAC,QAAA1/T,IAAAyC,GAAAA,EAAAu0I,OACAokG,EAAAjoU,EAAA+mO,OAAAigG,EAAAslF,UAAAE,YAAAC,qBAAAn9T,GAAA03O,EAAA0lF,WACAxkG,EAAAloT,EAAA+mO,OAAAigG,EAAAslF,UAAAK,UAAA9/T,IAAAyC,GAAA4Z,MAAA4rD,KAAAkyK,EAAA4lF,SAAA1kG,UAAA1oT,QACAq3N,EAAA6M,EAAAsjG,EAAAslF,UAAAO,aAAAlyO,SAAArrF,EAAA,iBAAA,IAAAw0I,YACAuoL,EAAA3oL,EAAAsjG,EAAAslF,UAAAO,aAAAlyO,SAAArrF,EAAA,oBAAA,IAAAw0I,YACAgpL,EAAAx9T,EAAA40I,cAEA,MAAA,CACA50I,GAAAw9T,EACA/uI,UAAAr6C,EAAAq6C,EAAA/5C,MAAA,aACAikG,WAAAA,GAAA,IACAxyP,KAAAk5T,IACA,MAAA9tS,EAAA8tS,EAAAllS,WAIA,OAAA5I,EAAAzvB,SAAA,QAAA07U,KACAjsT,EAGA,GAAAA,SAAAisT,OAEAr1T,OACAhiB,KAAAk5T,GAAA,IAAAnoF,EAAAmoF,KACA93K,aAAAA,EACAw1L,gBAAAA,EACAnkG,WAAAA,GAAA,IAAAzwN,+MCvEA,aAEA,MAAA3K,EAAAluF,EAAA,iBACAmuZ,EAAAnuZ,EAAA,+BACAupU,EAAAvpU,EAAA,2CACA84N,EAAA94N,EAAA,QAAAA,CAAA,oBAmGA+/I,eAAAquQ,EAAAhgP,GACA,OAAAnuK,OAAAW,KAAAytZ,GAAAx3U,KAAAv3E,IAAA,CACAA,KAAAA,EACAmqK,YAAA4kP,EAAA/uZ,GAAAmqK,gBAxFA3pK,EAAAC,QAAA,EAAA0mU,KAAAA,MACA,CACAoC,OAAAU,GAaAxpL,eAAA3+I,EAAA,IAEA,OAAAqlU,EAAAz/O,OAAA6hP,OAAAznU,MAdA6sF,IAAAs7O,GAoBAxpL,eAAAt+I,EAAAL,GACA,IAAAK,EACA,OAAA+wK,QAAAw5B,OAAA,IAAAzmG,MAAA,6BAIA,OAAAkhO,EAAAz/O,OAAAiH,IAAAxsF,EAAAL,MAzBA8sF,IAAAq7O,GA+BAxpL,eAAAt+I,EAAAtB,EAAAiB,GACA,OAAAqlU,EAAAz/O,OAAAkH,IAAAzsF,EAAAtB,EAAAiB,MA/BAukF,QAAA4jP,GAqCAxpL,eAAA5/I,EAAAiB,GACA,OAAAqlU,EAAAz/O,OAAArB,QAAAxlF,EAAAiB,MArCAitZ,SAAA,CACAx+M,MAAA05H,GA0CAxpL,eAAAuuQ,EAAAltZ,EAAA,CAAAmtZ,QAAA,IACA,MAAAA,OAAAA,GAAAntZ,EAEAotZ,EAAAH,EAAAC,GAEA,IAAAE,EACA,MAAA,IAAAjpT,MAAA,yBAAA+oT,aAGA,IACA,MAAAG,QAAAhoF,EAAAz/O,OAAA6hP,OAAAznU,GACA,IAAAstZ,EAAAp6U,KAAAoH,MAAApH,KAAAC,UAAAk6U,IAaA,OAZAC,EAAAF,EAAA59T,UAAA89T,GAEAH,SACA9nF,EAAAz/O,OAAArB,QAAA+oU,EAAAttZ,UAKAqtZ,EAAAE,SAAAC,eACAF,EAAAC,SAAAC,QAGA,CAAAz8T,SAAAs8T,EAAAz5N,QAAA05N,GACA,MAAAxoT,GAGA,MAFA4yH,EAAA5yH,GAEA,IAAAX,MAAA,4BAAA+oT,iBAAApoT,EAAA9f,eArEA+J,KAAAo5O,EAAA6kF,MAuFA,MAAAC,EAAA,CACAQ,OAAA,CACAplP,YAAA,yIACA74E,UAAA5J,IACAkH,EAAAlH,EAAA,0BAAA,GACAkH,EAAAlH,EAAA,gCAAA,GACAA,EAAAkpT,MAAA,IACAlpT,EAAAkpT,OAAA,GACAgB,mBAAA,GAGAlqT,IAGA8nU,kBAAA,CACArlP,YAAA,4GACA74E,UAAA5J,IACAkH,EAAAlH,EAAA,0BAAA,GACAkH,EAAAlH,EAAA,gCAAA,GACAkH,EAAAlH,EAAA,QAAA,IACAA,EAAAkpT,OAAA,GACAgB,mBAAA,IAGAlqT,IAGA9U,KAAA,CACAu3F,YAAA,6LACA74E,UAAA5J,IACA,MAAAgpT,EAAAme,IAcA,OAZAjgU,EAAAlH,EAAA,gBAAAgpT,EAAAC,UAAAI,IAAA,uBAAA,IACAniT,EAAAlH,EAAA,oBAAAgpT,EAAAC,UAAAK,QAAA,uBAAA,IACApiT,EAAAlH,EAAA,kBAAAgpT,EAAAC,UAAAC,MAAAx+T,OAAA,CAAA,wBAAA,IACAwc,EAAAlH,EAAA,sBAAA,IACAkH,EAAAlH,EAAA,YAAA,IACAkH,EAAAlH,EAAA,0BAAA,GACAkH,EAAAlH,EAAA,gCAAA,GACAkH,EAAAlH,EAAA,QAAA,IACAA,EAAAkpT,OAAA,GACAgB,mBAAA,IAGAlqT,IAGA+nU,qBAAA,CACAtlP,YAAA,4EACA74E,UAAA5J,IACA,MAAAgpT,EAAAme,IAcA,OAZAjgU,EAAAlH,EAAA,gBAAAgpT,EAAAC,UAAAI,KACAniT,EAAAlH,EAAA,oBAAAgpT,EAAAC,UAAAK,SACApiT,EAAAlH,EAAA,kBAAAgpT,EAAAC,UAAAC,OACAhiT,EAAAlH,EAAA,sBAAAgpT,EAAAC,UAAAO,WACAtiT,EAAAlH,EAAA,YAAAgpT,EAAAH,WACA3hT,EAAAlH,EAAA,yBAAAgpT,EAAAS,UAAAC,KAAAC,SACAziT,EAAAlH,EAAA,+BAAAgpT,EAAAS,UAAAI,WAAAF,SACAziT,EAAAlH,EAAA,QAAA,IACAA,EAAAkpT,OAAA,GACAgB,mBAAA,IAGAlqT,IAGAgoU,SAAA,CACAvlP,YAAA,8KACA74E,UAAA5J,IACA,MAAAkpT,EAAAlpT,EAAAkpT,OAAA,GACAa,EAAAb,EAAAa,SAAA,GAOA,OANAA,EAAAC,SAAA,GACAD,EAAAE,UAAA,GAEAf,EAAAa,QAAAA,EACA/pT,EAAAkpT,MAAAA,EAEAlpT,IAGAioU,gBAAA,CACAxlP,YAAA,iCACA74E,UAAA5J,IACA,MAAAgpT,EAAAme,IAIA,OAFAnnU,EAAAkpT,MAAAF,EAAAE,MAEAlpT,KAMAlnF,EAAAC,QAAAsuZ,SAAAA,6JChNAvuZ,EAAAC,QAyBA,SAAAurG,EAAAl4B,EAAAjzE,GACA,iBAAAizE,IACAA,EAAAA,EAAAmZ,MAAA,MAEA,iBAAAnZ,IACAA,EAAA,CAAAA,IAEA,IAIA87U,EAJAC,EAAA/7U,EAAAsX,MACA,IAAAykU,EACA,OAAA,EAGA,KAAAD,EAAA97U,EAAAg+B,SAKA,QAJA,IAAA9F,EAAA4jT,KACA5jT,EAAA4jT,GAAA,MAEA5jT,EAAAA,EAAA4jT,KACA,iBAAA5jT,EACA,OAAA,EAIA,OADAA,EAAA6jT,GAAAhvZ,GACA,iCC/CA,aAEA,MAAAixY,EAAApxY,EAAA,SACAovZ,EAAApvZ,EAAA,aACAqvZ,EAAArvZ,EAAA,UACAqxY,EAAArxY,EAAA,SA8BAF,EAAAC,QAhBA,MAQAuD,aAAAwjU,KAAAA,EAAAM,IAAAA,EAAAR,QAAAA,EAAAG,OAAAA,IACAt6N,KAAAxe,IAAAmjT,EAAA,CAAAtqE,KAAAA,EAAAF,QAAAA,IACAn6N,KAAAgmE,QAAA28O,EAAA,CAAAtoF,KAAAA,EAAAF,QAAAA,IACAn6N,KAAAgvP,KAAA4zD,EAAA,CAAAvoF,KAAAA,EAAAF,QAAAA,IACAn6N,KAAAqxH,IAAAuzK,EAAA,CAAAvqE,KAAAA,EAAAF,QAAAA,EAAAQ,IAAAA,EAAAL,OAAAA,wGC/BA,aAEA,MAAAwC,EAAAvpU,EAAA,2CACAslF,EAAAtlF,EAAA,YACAwoF,EAAAxoF,EAAA,WAOAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAF,QAAAA,KAwBA2C,GApBAxpL,eAAAq6E,EAAAh5N,EAAA,IAKA,IAJA,IAAAA,EAAAwlU,SACAA,EAAAxsG,GAGAh5N,EAAAhC,KAAA,CAMA,OALAgC,EAAAkuZ,mBACAhqU,EAAAwhP,EAAAr0J,QAAA2nD,EAAAh5N,EAAAhC,aACAopF,EAAAs+O,EAAAr0J,QAAA2nD,EAAAh5N,EAAAhC,OAMA,MAAA,CACAe,YAAA2mU,EAAA74O,IAAAmsI,EAAAh5N,GACAynW,cAAA,2HC/BA,aAEA,MAAAt/B,EAAAvpU,EAAA,2CACA0oW,EAAA1oW,EAAA,uCAOAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAF,QAAAA,KAqBA2C,GAjBAxpL,gBAAAw3E,EAAAn2N,EAAA,IACA,MAAAg5N,IACAA,EAAAh7N,KACAA,GACAspW,EAAAnxI,GAEAn4N,IACAgC,EAAAhC,KAAAA,IAGA,IAAAgC,EAAAwlU,SACAA,EAAAxsG,SAGA0sG,EAAA20B,KAAArhI,EAAAh5N,EAAAhC,KAAAgC,mIC5BA,aAEA,MAAAy5N,EAAA76N,EAAA,cACAuvZ,EAAAvvZ,EAAA,sBAAA+6N,UAkBAy0L,EAAAlwZ,GAAAiwZ,EAAAn/S,MAAA9wG,GACAiqU,EAAAvpU,EAAA,2CASAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAM,IAAAA,EAAAL,OAAAA,EAAAH,QAAAA,KAkCA2C,GA9BAxpL,eAAA4tN,EAAAvsW,EAAA,IACA,MAAAosW,WAAAA,EAAA/pI,OAAAA,EAAA0lG,QAAAA,GAAAsmF,EAAAruZ,GAEA0+N,EAAA1+N,EAAAgmU,UAAAL,EAAAsvC,WAAA,KAEA,IACA,MAAAj8I,QAAA0sG,EAAAhpG,IAAA6vI,EAAAlqI,EAAA,CACA0lG,QAAAA,EACAqkC,WAAAA,EACAlxI,OAAAl7N,EAAAk7N,SAaA,OAVAl7N,EAAAgmU,WACAA,EAAA37O,IAAA2uI,EAAA,CACAg8I,MAAA,KAIA,IAAAh1W,EAAAwlU,SACAA,EAAAxsG,GAGAA,EACA,QACA0F,GACAA,QAWA,MAAA2vL,EAAAruZ,IACA,GAAAA,EAAAg5N,MAAAh5N,EAAAqiO,QAAAriO,EAAA+nU,SACA,MAAA,IAAA5jO,MAAA,sFACA,GAAAnkG,EAAAqiO,SAAAriO,EAAA+nU,UAAA/nU,EAAAqiO,QAAAriO,EAAA+nU,QACA,MAAA,IAAA5jO,MAAA,sEAGA,MAAA4jO,QAAAA,EAAA1lG,OAAAA,GAAA,MAAAriO,EAAAg5N,IACA,CAAAqJ,OAAAriO,EAAAg5N,IAAAt4N,KAAAqnU,aAAAhnU,GACAutZ,EAAA,IAAAC,KAAAvuZ,IAGA,MAAA,CACAosW,WAHAoiD,EAAA,IAAAxuZ,EAAAqiO,OAAAA,EAAA0lG,QAAAA,IAIA1lG,OAAAA,EACA0lG,QAAAA,IAUAumF,EAAA,EAAAjsL,OAAAA,EAAA0lG,QAAAA,MAAA,MAAA,CACA1lG,OAAA,iBAAAA,GAhFAnkO,EAgFAmkO,EAhFA5I,EAAAqpB,gBAAA5kP,IAgFAmkO,EACA0lG,QAAA,iBAAAA,EAAAqmF,EAAArmF,GAAAA,GAjFA7pU,IAAAA,GA6FAswZ,EAAA,EAAAz/S,QAAAA,EAAAiqH,IAAAA,EAAAqJ,OAAAA,EAAA0lG,QAAAA,KAEA,iBAAAh5N,EACAA,EAEAiqH,EACAA,EAAAjqH,QAEAszH,IAAA5I,EAAA0yI,QAAApkC,IAAAtuG,EAAAm9I,SACA,EAGA,EAIA23C,EAAA,CACAlsL,OAAA5I,EAAAqpB,gBAAA,YACAilF,QAAAomF,EAAAn/S,MAAA,0IChIA,aAGA,MAAAy/S,EAAA7vZ,EAAA,oBACA0wU,EAAA1wU,EAAA,SACA8vZ,EAAA9vZ,EAAA,kBACA67N,gBAAAA,GAAA77N,EAAA,2BACA4mU,EAAA5mU,EAAA,4BAGAgxW,EAAAhxW,EAAA,WAEA84N,EAAA74N,OAAAiqG,OACAwmO,EAAA,gBACA,CAAA10P,MAAA00P,EAAA,wBAgGA5wU,EAAAC,QA1FA,CAAAqB,EAAA,MAKA,GAJAA,EAAAgoU,QAAAt/O,QAAA1oF,EAAAgoU,SACAhoU,EAAAioU,UAAAjoU,EAAAioU,WAAA,GACAjoU,EAAAqvF,MAAArvF,EAAAqvF,OAAA,KAEArvF,EAAAgoU,UAAAhoU,EAAAioU,UAAA33P,OAAA,CACAonJ,EAAA,oBACA,MAAA3S,EAAA,OACA,OAAAlmN,OAAAiqG,OAAAi8G,EAAA,CACA1kI,MAAA,OACAurD,KAAA,SAIA,IAAA+iR,GAAA,EAEAC,EAAA,GACA,MAAAC,EAAA7uZ,EAAAioU,UAAAxyP,IAAAg5U,GAGAp/T,EAAAugR,EAAA5vW,EAAAqvF,OAKA01H,EAAApmE,MAAAA,IACA,IACA,GAAAgwQ,EACA,MAAA,IAAAxqT,MAAA,WAAA60H,kCAGA,MAAAh7N,EAAAg7N,EAAAvvH,WAEA,GAAApa,EAAAjF,IAAApsF,GAEA,OAIAqxF,EAAAvC,IAAA9uF,GAAA,GAEA,MAAA8wZ,EAAAJ,EAAAG,GACA,IAAAz2B,GAAA,EACA,MAAAznN,EAAAvnE,KAAAunE,MAEA,IAAA,MAAAo+O,KAAAD,EAAA,CACA,GAAAH,EAAA,MAAA,IAAAxqT,MAAA,uBAAAnmG,KAEA,IAAAklO,EAEA,IACAA,EAAA,IAAAzI,EACAm0L,EAAAA,EAAA1xT,OAAAgmI,SACAsiG,EAAA,GAAAupF,4BAAAtsJ,mBAAAzkQ,KAAA,CAAAk9N,OAAAgI,EAAAhI,SACAk9J,GAAA,EACA,MAAAtzR,GACA,YAAAA,EAAA3yB,MAAAulJ,EAAA98I,MAAAkqB,GACA,QACA8pT,EAAAA,EAAAx1U,QAAAigC,GAAAA,IAAA6pH,IAGA,GAAAk1J,EAAA,MAGA1gK,EAAA,GAAA0gK,EAAA,GAAA,8BAAAp6X,QAAAorG,KAAAunE,MAAAA,OACA,MAAA7rE,GACA4yH,EAAA98I,MAAAkqB,KAqBA,OAdAigH,EAAA1kI,MAAA,KACAsuU,GAAA,GAMA5pM,EAAAn5E,KAAA,KACA+iR,GAAA,EACAj3L,EAAA,YAAAk3L,EAAAt+U,qCACAs+U,EAAAnvZ,SAAA45G,GAAAA,EAAAglC,UACAuwQ,EAAA,IAGA7pM,sLC3GA,MAAAyhG,UAAAA,GAAA5nT,EAAA,aAEAowZ,EAAA,CAAAxoU,EAAA2pF,IAAAA,EAgBA8+O,EAAA,CACA/qK,IAAA8qK,EACA3qK,IAAA,CAAAxjJ,EAAAzuB,EAAAI,EAAA8+B,IACA,IAAAA,EAAAhhC,QAAA,QAAAghC,EAAA,GAAAslG,SACAxkI,EACA,IAAAA,KAEA+xK,IAAA,CAAAtjJ,EAAAzuB,EAAAI,EAAA8+B,EAAA86D,IACA96D,EAAAr/B,MAAAM,GAAA,CAAA,OAAA,QAAA,KAAA,OAAAuH,SAAAvH,EAAAqkI,YACA,GAAA/1G,KAAAzuB,IAxBA,EAAAyuB,EAAAiQ,EAAAQ,EAAA86D,KAEA,GAAAA,IAAA,IAAAA,EAAA8iP,WAAA,MAAA,SAAAruT,KAAAiQ,IAEA,IAAA8lG,EAAA,MACAu4M,EAAA,IAAAr+S,IAOA,MALA,QADAQ,EAAAA,EAAAhhC,OAAA,GACAsmI,WAEAA,EAAA,QAAA9lG,EAAA,QAAA,OACAq+S,EAAA,QAAAr+S,GAAA,OAAAA,EAAA,GAAAq+S,GAEA,GAAAv4M,OAAA/1G,IAAAsuT,KAaAC,CAAAvuT,EAAAzuB,EAAAk/B,EAAA86D,GAEAy7E,IAAA,CAAAhnJ,EAAAzuB,IAAA,SAAAyuB,KAAAzuB,IACAsyK,QAAAsqK,EACAxqK,KAAAwqK,EACAvqK,KAAAuqK,EACAr4L,KAAA,CAAA91H,EAAAzuB,IAAA,GAAAyuB,UAAAzuB,IACAm2K,IAAA,CAAA1nJ,EAAAzuB,IAAA,GAAAyuB,SAAAzuB,IACA2nJ,KAAAl5H,GAAA,UAAAA,IACA2nJ,MAAA3nJ,GAAA,WAAAA,IACAkoJ,GAAAloJ,GAAA,QAAAA,IACAmoJ,IAAAnoJ,GAAA,SAAAA,IACAooJ,qBAAApoJ,GAAA,GAAAA,uBACAinJ,kBAAAjnJ,GAAA,GAAAA,oBACAknJ,oBAAAlnJ,GAAA,GAAAA,uBAGAniG,EAAAC,QAAA,CAAA46N,EAAAntD,KACA,MAAAuiO,EAAA,IAAAnoF,EAAAjtF,GACAjoH,EAAAioH,EAAA9vH,WAAAte,MAAA,KAAA1a,MAAA,GACA,OAAAk+T,EACA3lF,SACAvzO,KAAAyzO,IAAA,CACAtyG,SAAAtlG,EAAAtB,QACA59B,QAAA82O,EAAA,GAAA53M,EAAAtB,QAAA,SAEAj/B,QAAA,CAAA8vB,EAAAuQ,EAAA5+B,EAAA8+B,KACA,MAAAvgC,EAAAk+U,EAAA79S,EAAAwlG,UACA,IAAA7lI,EAAA,MAAA,IAAAozB,MAAA,wBAAAiN,EAAAwlG,YACA,OAAA7lI,EAAA8vB,EAAAuQ,EAAAh/B,QAAAI,EAAA8+B,EAAA86D,KACA,oDC1DA,aAEA1tK,EAAAC,QAAA4hO,IACA,IAAAr3H,MAAA/gB,QAAAo4I,GACA,MAAA,IAAAnwH,UAAA,iCAAAmwH,GAKA,IAAA,IAAA3vJ,GAFA2vJ,EAAA,IAAAA,IAEAjwJ,OAAA,EAAAM,EAAA,EAAAA,IAAA,CACA,MAAA+wH,EAAA1wH,KAAA6nC,MAAA7nC,KAAAwoC,UAAA7oC,EAAA,KACA2vJ,EAAA3vJ,GAAA2vJ,EAAA5+B,IAAA,CAAA4+B,EAAA5+B,GAAA4+B,EAAA3vJ,IAGA,OAAA2vJ,iCCbA,aAEA,MAAA/hO,QAAA4wW,GAAAxwW,EAAA,WACAi7N,EAAAj7N,EAAA,uBACA0wU,EAAA1wU,EAAA,SAEA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,gBAAA,CACA10P,MAAA00P,EAAA,wBAKA+/B,EAAA,IAAAD,EAAA,CAAAE,YAAA,IAMA5wW,EAAAC,QAAA,SAAAsyG,EAAAjxG,EAAA,IAGA,OAFA03N,EAAAzmH,GAEAo+P,EAAAhlR,KAAAs0D,UACA,MAGAw9E,SAHAtC,EAAA4C,KAAAxrH,EAAA,CAAAiqH,OAAAl7N,EAAAk7N,UAGA5pJ,KAAA8qJ,YAEA,IACA,OAAA,CACA,MAAAjnD,KAAAA,SAAAgnD,EAAAE,OACA,GAAAlnD,EAAA,QAGA,QACAgnD,EAAAG,8GCnCA,aAEA,MAAAgzG,EAAA1wU,EAAA,UACA80W,YAAAA,GAAA90W,EAAA,2BACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,oBAAA,CACA10P,MAAA00P,EAAA,4BAgBA5wU,EAAAC,QAAA,EAAA6mU,QAAAA,EAAAa,MAAAA,EAAArmU,QAAAA,EAAA,OAGA,GAFAA,EAAA2wW,SAAA3wW,EAAA2wW,UAAA,KAEA3wW,EAAAgoU,QAAA,CACAtwG,EAAA,wBACA,MAAAjkB,EAAA90D,YACA,MAAA,CAAAt+D,MAAAozH,EAAA7nE,KAAA6nE,GAGA,IAEA47M,EAFAljB,EAAA,GAIA,MAAAmjB,EAAA3wQ,UACA,IACA,MAAAioL,QAAAP,EAAAknE,KAAA,KACAgiB,EAAA77C,EAAA9sC,EAAA5tG,IAAA,CAAAvtF,KAAA,WAEA0gQ,IAAAojB,IACA73L,EAAA,+BAAAy0K,QAAAvlE,EAAA5tG,aACAwsG,EAAAoB,EAAA5tG,KACAmzK,EAAAojB,GAEA,MAAAzqT,GACA4yH,EAAA98I,MAAA,6BAAAkqB,GACA,QACAuqT,EAAAn5O,WAAAo5O,EAAAtvZ,EAAA2wW,YAIA,MAAA,CAIAzuW,cACA,MAAA0kU,QAAAP,EAAAknE,KAAA,KACApB,EAAAz4B,EAAA9sC,EAAA5tG,IAAA,CAAAvtF,KAAA,WACAisF,EAAA,uBAAAkvG,EAAA5tG,OACAq2L,EAAAn5O,WAAAo5O,EAAAtvZ,EAAA2wW,WAKAzuW,OACAo5N,aAAA+zL,mFCjEA,aAEA,MAAAG,EAAA5wZ,EAAA,uBACAmoT,EAAAnoT,EAAA,WAcA6wZ,EAAA,CACAliB,KAAA3uY,EAAA,WAQA8wZ,EAAA,CACAC,MAAA/wZ,EAAA,WACA2yE,GAAA3yE,EAAA,QACAmtL,MAAAntL,EAAA,WACAgxZ,MAAAhxZ,EAAA,WACAixZ,GAAAjxZ,EAAA,QACAy1W,GAAAz1W,EAAA,QACAkxZ,MAAAlxZ,EAAA,YAQAmxZ,EAAA,CACA//J,MAAApxP,EAAA,WACAy9N,KAAAz9N,EAAA,UACAm6N,GAAAn6N,EAAA,SAUA+wM,EAAA,EACA3vM,QAAAA,EAAAgwZ,IAAAA,EAAAC,WAAAA,EAAAj7C,KAAAA,MAEAn2W,OAAAW,KAAAywZ,GAAAxwZ,SAAAY,IACA2vZ,EAAA3vZ,GAAA20W,EAAAi7C,EAAA5vZ,GAAAL,QAIAszJ,EAAA,CACAsyK,WAAA,EACAF,KAAA,KACAL,KAAA,MA2DA3mU,EAAAC,QAAA,EAAA+mU,KAAAA,EAAA7sK,MAAAA,EAAA4sK,aAAAA,EAAAJ,KAAAA,EAAAG,QAAAA,EAAAxlU,QAAAkwZ,MACA,MAAA78N,EAtDA,SAAArzL,GACA,MAAA4lU,UACAA,GACA/mU,OAAAiqG,OAAA,GAAAwqD,GAAA,GAAAtzJ,GAEAA,EAAAqlU,KAAA,CACAl1D,OAAAnwQ,EAAAmwQ,OACAyqH,UAAA56X,EAAA46X,WAGA,MAAA5lB,EAAAw6C,EAAA5pF,GAiBAoqF,EAAA,GAaA,OAXArgN,EAAA,CACA3vM,QAAAA,EAAAgwZ,IAAAA,EAAAC,WAAAR,EAAAz6C,KAfAtC,GACAsC,EAAAC,SAAAvC,KAgBA/iK,EAAA,CACA3vM,QAAAA,EAAAgwZ,IAAAA,EAAAC,WAAAP,EAAA16C,KAXAtC,GACAsC,EAAA07B,UAAAh+B,KAaA7zW,OAAAW,KAAAuwZ,GAAAtwZ,SAAAY,IACA2vZ,EAAA3vZ,GAAA0vZ,EAAA1vZ,GAAAL,MAGAgwZ,EAcAG,CAAA,CACAzqF,KAAAA,EACA7sK,MAAAA,EACAs3G,OAAAs1D,EACAm1D,UAAAv1D,EAAAv5O,KACA85O,UAAAsqF,EAAAtqF,YAMAwqF,EAAAngU,GAIA,IAAAxO,KAEA,MAAAw4S,EAAAx4S,EAAArI,QAAA3G,GAAAs0O,EAAA5wF,SAAA1jJ,IAAAs0O,EAAA/tF,IAAAvmJ,KAEA,GAAAwnT,EAAA3pT,OAAA,CACA,MAAAtwE,EAAAyhF,EAAAA,EAAAnR,OAAA,GAEAtwE,IAAA,IAAAA,EAAAwlU,SACAy0D,EAAAx6X,SAAAzB,GAAAwnU,EAAAxnU,KAIA,OAAAiyF,KAAAxO,IAMA,MAAA,IACA4xG,EACAs8N,MAAAt8N,EAAAs8N,MACAp+U,GAAA6+U,EAAA/8N,EAAA9hH,IACAq+U,MAAAv8N,EAAAu8N,MACAriB,KAAA6iB,EAAA/8N,EAAAk6M,MACAl5B,GAAAhhL,EAAAghL,GACAh4I,KAAA+zL,EAAA/8N,EAAAgpC,MACAyzL,MAAAz8N,EAAAy8N,MACA9/J,MAAA38D,EAAA28D,MACA6/J,GAAAO,EAAA/8N,EAAAw8N,IACA9jO,MAAAsH,EAAAtH,MACAgtC,GAAAq3L,GAAAzxQ,mBAAAl9D,GACA,UAAA,MAAA0qB,KAAAknF,EAAA0lC,MAAAt3I,QACA,IAAA0qB,EAAA7D,KAAA6D,EAAA7D,MAAA,6QC5KA,aAGA,MAAA+nT,EAAAzxZ,EAAA,WASA,IAAAo2W,EAKAt2W,EAAAC,QAAA,CAAAinU,GAAA,KACA,GAAAovC,EACA,OAAAA,EAGA,MAAAs7C,EAAAD,EAAA,CAIAE,cAAA3qF,IA6BA,OA1BAovC,EAAA,CACAC,SAAAzxG,GACA7kH,SAAAl9D,KACA,MAAA66I,QAAAg0L,EAAAr7C,WAEA,IACA,aAAAzxG,EAAA/0D,MAAA,KAAAhtH,GACA,QACA66I,MAKAo0K,UAAAltI,GACA7kH,SAAAl9D,KACA,MAAA66I,QAAAg0L,EAAA5f,YAEA,IACA,aAAAltI,EAAA/0D,MAAA,KAAAhtH,GACA,QACA66I,OAMA04I,yECvDM1iS,EAAO1zE,EAAQ,UACf4hO,EAAU5hO,EAAQ,cAChBJ,QAASgyZ,GAAU5xZ,EAAQ,oBAC3Bu3K,GAAYv3K,EAAQ,mBACtBizN,EAAUjzN,EAAQ,yBAElB6xZ,EAAAA,OACFC,EAEJ,SAAAC,EAA4BruO,EAAOtiL,OAC7Bo3E,QAEE7E,EAAAA,IAAQ6+F,SAASC,IACrBj6F,EAAMi6F,YAGRiR,EAAMj4F,KAAI,IAAM8rF,MACH/E,SAASC,IAClBj6F,GAAI,KACFi6F,UAGArxK,EAAQm2K,WAEP5jG,QAGHq+U,EAAc,CAAC1yZ,EAAM8B,QACrB0wZ,EAAeG,gBAEf57C,SAAUy7C,EAAez7C,SAAS/2W,EAAM8B,GACxC0wY,UAAWggB,EAAehgB,UAAUxyY,EAAM8B,UAIxC8wZ,EAAAA,IAAkBN,EAAAA,CAAQlhD,YAAa,QACzC6hC,EAAY,YAGdl8B,SAAU,QAEJk8B,SACKwf,EAAkBxf,EAAWnxY,GAItCmxY,EAAAA,IAAgBqf,EAAAA,CACdlhD,YAAatvW,EAAQsvW,YACrBsB,WAAW,UAEPmgD,EAAiB5f,EAGjB6f,EAAcL,EAAkBxf,EAAWnxY,UAEjD8wZ,EAAYzmU,KAAI,KAGd0mU,EAAe1wU,QAKR0wU,EAAeE,SACnB3nT,MAAK,KACA6nS,IAAc4f,IAChB5f,EAAY,YAKb6f,GAETtgB,UAAW,KAITS,EAAY,KAELwf,EAAkBG,EAAa9wZ,MAKtCszJ,EAAAA,CACJg8M,YAAa53P,EAAAA,EACby+D,QAAS,MACTtrE,OAAQA,EACR0lT,eAAe,GAGjB7xZ,EAAOC,QAAU,CAACT,EAAM8B,KACjBA,IACHA,EAAAA,IAGkB,iBAAT9B,IACT8B,EAAU9B,EACVA,EAAO,QAGJA,IACHA,EAAO,QAGT8B,EAAUnB,OAAOiqG,OAAAA,GAAWwqD,EAAgBtzJ,GAEvC0wZ,IACHA,EAAiBp+U,EAAKtyE,IAAYwgO,EAAQxgO,GAErC0wZ,EAAeG,WAElBH,EAAer3U,GAAG,mBAAmB,CAACn7E,EAAM+xF,KACrCwgU,EAAQvyZ,IAIbuyZ,EAAQvyZ,GAAM+2W,WACX3rQ,MAAKo1H,GAAWzuI,IAAKihU,SAAQ,IAAMxyL,WAGxCgyL,EAAer3U,GAAG,oBAAoBslE,MAAOzgJ,EAAM+xF,KAC5CwgU,EAAQvyZ,IAIbuyZ,EAAQvyZ,GAAMwyY,YACXpnS,MAAKo1H,GAAWzuI,IAAKihU,SAAQ,IAAMxyL,aAKvC+xL,EAAQvyZ,KACXuyZ,EAAQvyZ,GAAQ0yZ,EAAY1yZ,EAAM8B,IAG7BywZ,EAAQvyZ,IAGjBQ,EAAOC,QAAQ8nQ,OAAS,SAAUl3C,EAAQ4hM,OAEpC/pJ,EADJ+pJ,EAAOA,GAAQtmT,EAAO47J,WAIpBW,EAAAA,IAAa+pJ,EAAK5hM,SACX30I,GACHA,EAAMoK,QAAQlL,SAAS,uBACzBstL,EAAS+pJ,EAAK5hM,QAIb63C,YACOjjK,MAAM,+BAAgCgtT,UAGlDt/L,EAAQu1C,GAEDA,0KC7JH1W,EAAe9xP,EAAQ,UAAU8xP,qBAC/B04E,GAAWxqU,EAAQ,oCAEzBwyZ,EAAAA,yBACAC,EAAAA,uBACAC,EAAAA,0BACAC,EAAAA,0BACAC,EAAAA,wBACAC,GACE7yZ,EAAQ,mBACR8yZ,QAEEC,EAA0B,CAACziF,EAAS0iF,EAAaC,EAAaC,EAAaC,IACxE,CAAC3qJ,EAAQ4qJ,KACVA,GAAgBA,EAAa7/U,OAAS0/U,GACxC3iF,EAAQhrJ,KAAK0tO,EAAaI,EAAa9zZ,MAAM,KAE3CkpQ,EAAOppC,KAAAA,CACL7rJ,KAAM4/U,EACN7zZ,KAAM8zZ,EAAa9zZ,KACnBkxF,WAAY4iU,EAAa5iU,iBAIhBgiF,SAASC,UACZ4gP,EAAwBC,IACxBA,GAAgBA,EAAa//U,OAAS2/U,GAAeI,EAAa9iU,aAAe4iU,EAAa5iU,aAChGg4K,EAAOvmC,eAAe,UAAWoxL,GACjC5gP,MAIJ+1F,EAAO/tL,GAAG,UAAW44U,UAOzBE,EAAwB,CAACj0Z,EAAM2zZ,EAAaE,EAAWD,IACpD,WACCxiU,EAAK85O,WAEXjsI,EAAQ6gC,KAAAA,CACN7rJ,KAAM0/U,EACNziU,WAAYE,EACZpxF,KAAAA,QAGSkzK,SAASC,UACZ8mC,EAAY5jI,IACZA,GAASA,EAAMpC,OAAS4/U,GAAax9U,EAAM6a,aAAeE,IAC5D6tG,EAAQ0jC,eAAe,UAAW1oB,GAGlC9mC,GAAQ,KAEN8rB,EAAQ6gC,KAAAA,CACN7rJ,KAAM2/U,EACN1iU,WAAYE,EACZpxF,KAAAA,SAMRi/L,EAAQ9jH,GAAG,UAAW8+H,OAK5Bz5M,EAAOC,QAAWqB,WAEd0xZ,EAAU9yZ,EAAQ,YAEbC,OAAOW,KAAKkyZ,GAASphV,oBAGnBkW,aAILkrU,EAAQU,UAAYpyZ,EAAQuwZ,cAAAA,OACxBrhF,EAAAA,IAAcx+E,SAEpBghK,EAAQr4U,GAAG,UAAWs4U,EAAwBziF,EAAS,kBAAmBkiF,EAA0BC,EAA0BC,IAC9HI,EAAQr4U,GAAG,UAAWs4U,EAAwBziF,EAAS,mBAAoBqiF,EAA2BC,EAA2BC,IAE1HviF,SAIP2hF,UAAU,EACV57C,SAAW/2W,GAASi0Z,EAAsBj0Z,EAAMkzZ,EAA0BE,EAAwBD,GAClG3gB,UAAYxyY,GAASi0Z,EAAsBj0Z,EAAMqzZ,EAA2BE,EAAyBD,sHC7FzG9yZ,EAAAC,QAAA,CACAyyZ,yBAAA,2BACAC,yBAAA,2BACAC,uBAAA,yBAEAC,0BAAA,4BACAC,0BAAA,4BACAC,wBAAA,yDCRA,MAAA/gK,EAAA9xP,EAAA,UAAA8xP,cACA04E,OAAAA,GAAAxqU,EAAA,WACAwyZ,yBACAA,EAAAC,yBACAA,EAAAC,uBACAA,EAAAC,0BACAA,EAAAC,0BACAA,EAAAC,wBACAA,GACA7yZ,EAAA,eACAyzZ,EAAAzzZ,EAAA,yBAEA+yZ,EAAA,CAAAziF,EAAA0iF,EAAAC,EAAAC,EAAAC,IACA,CAAA3qJ,EAAA7yL,KACA,IAAAA,IAAAA,EAAAwjF,MAAAxjF,EAAAwjF,KAAA5lF,OAAA0/U,EACA,OAGA,MAAAG,EAAA,CACA7/U,KAAAoC,EAAAwjF,KAAA5lF,KACAj0E,KAAAq2E,EAAAwjF,KAAA75J,KACAkxF,WAAA7a,EAAAwjF,KAAA3oE,YAGA8/O,EAAAhrJ,KAAA0tO,EAAAI,EAAA9zZ,MAAA,KAEAkpQ,EAAA3I,YAAA,CACAtsL,KAAA4/U,EACA7zZ,KAAA8zZ,EAAA9zZ,KACAkxF,WAAA4iU,EAAA5iU,aAIA,IAAAgiF,SAAAC,IACA,MAAA4gP,EAAA19U,IACA,IAAAA,IAAAA,EAAAwjF,KACA,OAGA,MAAAm6P,EAAA,CACA//U,KAAAoC,EAAAwjF,KAAA5lF,KACAj0E,KAAAq2E,EAAAwjF,KAAA75J,KACAkxF,WAAA7a,EAAAwjF,KAAA3oE,YAGA8iU,GAAAA,EAAA//U,OAAA2/U,GAAAI,EAAA9iU,aAAA4iU,EAAA5iU,aACAg4K,EAAA10F,oBAAA,UAAAu/O,GACA5gP,MAIA+1F,EAAA71F,iBAAA,UAAA0gP,UAMAE,EAAA,CAAAj0Z,EAAA2zZ,EAAAE,EAAAD,IACA,KACA,MAAAxiU,EAAA85O,IAQA,OANA1+N,WAAA+zJ,YAAA,CACAtsL,KAAA0/U,EACAziU,WAAAE,EACApxF,KAAAA,IAGA,IAAAkzK,SAAAC,IACA,MAAA8mC,EAAA5jI,IACA,IAAAA,IAAAA,EAAAwjF,KACA,OAGA,MAAAu6P,EAAA,CACAngV,KAAAoC,EAAAwjF,KAAA5lF,KACAid,WAAA7a,EAAAwjF,KAAA3oE,YAGAkjU,GAAAA,EAAAngV,OAAA4/U,GAAAO,EAAAljU,aAAAE,IACAob,WAAAgoE,oBAAA,UAAAylC,GAGA9mC,GAAA,KAEA3mE,WAAA+zJ,YAAA,CACAtsL,KAAA2/U,EACA1iU,WAAAE,EACApxF,KAAAA,SAMAwsG,WAAA6mE,iBAAA,UAAA4mC,OAKA7kD,EAAA,CACAi9P,eAAA,GAGA7xZ,EAAAC,QAAAqB,IACAA,EAAAnB,OAAAiqG,OAAA,GAAAwqD,EAAAtzJ,GAGA,KAFA0qG,WAAAlqG,UAAAR,EAAAuwZ,cAEA,CACA,MAAArhF,EAAA,IAAAx+E,EAKA,OAHA2hK,EAAA9gP,iBAAA,UAAAogP,EAAAziF,EAAA,kBAAAkiF,EAAAC,EAAAC,IACAe,EAAA9gP,iBAAA,UAAAogP,EAAAziF,EAAA,mBAAAqiF,EAAAC,EAAAC,IAEAviF,EAGA,MAAA,CACA2hF,UAAA,EACA57C,SAAA/2W,GAAAi0Z,EAAAj0Z,EAAAkzZ,EAAAE,EAAAD,GACA3gB,UAAAxyY,GAAAi0Z,EAAAj0Z,EAAAqzZ,EAAAE,EAAAD,sHCtHA,MAAAz7E,EAAA,GAEAw8E,EAAAnrJ,IACAA,EAAA71F,iBAAA,WAAAh9F,IACAg+U,EAAAz4O,cAAA,UAAAstF,EAAA7yL,MAGA6yL,EAAAt2J,MACAs2J,EAAAt2J,KAAAygE,iBAAA,WAAAh9F,IACAg+U,EAAAz4O,cAAA,UAAAstF,EAAA7yL,OAKAg+U,EAAAhhP,iBAAA,CAAAp/F,EAAA8d,KACA8lP,EAAA5jQ,KACA4jQ,EAAA5jQ,GAAA,IAGA4jQ,EAAA5jQ,GAAAgE,KAAA8Z,IAGAsiU,EAAA7/O,oBAAA,CAAAvgG,EAAA8d,KACA8lP,EAAA5jQ,KAIA4jQ,EAAA5jQ,GAAA4jQ,EAAA5jQ,GACAiH,QAAA++H,GAAAA,IAAAloH,MAGAsiU,EAAAz4O,cAAA,WACA,MAAAr4F,EAAAynB,MAAAF,UAAAv4B,MAAAw4B,KAAAvnB,WACAvP,EAAAsP,EAAAuuB,QAEA+lO,EAAA5jQ,IAIA4jQ,EAAA5jQ,GAAA1yE,SAAAwwF,GAAAA,EAAAw+G,MAAA,KAAAhtH,MAGA/iF,EAAAC,QAAA4zZ,gCCzCA,aAMA,IAAAn4L,EAWA17N,EAAAC,QAAAw3K,QAAA,SAAAuqC,EAAA8xM,GACA,IACAr8O,EADAv7F,EAAA,IAAAw/I,EAGA,OAAAhpD,QAAA40L,KAAA,CACAtlJ,EACA,IAAAtvC,SAAA,SAAAC,EAAAu5B,GACAz0B,EAAAD,YAAA,WACA00B,EAAAhwH,KACA43U,QAEAlpT,MAAA,SAAA6mE,GAEA,OADAmrD,aAAAnlD,GACAhG,KACA,SAAArrE,GAEA,MADAw2H,aAAAnlD,GACArxE,OAOAs1H,EAAA17N,EAAAC,QAAAy7N,aAAA,WACAj2H,MAAA8E,KAAAoC,MACAA,KAAAwX,MAAA1e,QAAA0e,MACAxX,KAAArmB,QAAA,YAGAgkB,UAAAnqG,OAAAU,OAAA4kG,MAAA6E,WACAoxH,EAAApxH,UAAA9qG,KAAA,6CChDA,aAEA,MAAA03L,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IACAk4L,EAAA7zZ,EAAA,wBACA4sR,SAAAA,GAAA5sR,EAAA,wBACA84N,EAAA94N,EAAA,QAAAA,CAAA,iBACAupT,EAAAvpT,EAAA,YACAupU,EAAAvpU,EAAA,2CAaA00J,EAAA,CACAo/P,WAAA,GAUAh0Z,EAAAC,QAAAk2E,GAoCAszP,GAhCAxpL,eAAA3gJ,EAAAgC,EAAA,IAEAA,EAAA41L,EAAAtiC,EAAAtzJ,GAEA03N,EAAA,sBAAA15N,KAEA,MAAAm0E,KACAA,EAAA6mJ,IACAA,EAAA25L,QACAA,SACAF,EAAA59U,EAAA72E,EAAAgC,GAEA4yZ,EAAA,SAAAzgV,GAAA6mJ,EAAAA,EAAA25L,EACA,IAAAxmT,EAEA,IACAA,QAAAq/K,EAAAonI,EAAA/9U,EAAA6wP,MACA,MAAA5gO,GACA,GAAA,kBAAAA,EAAApkG,KACA,MAAAynT,EAAA,IAAAhkN,MAAA,GAAAnmG,oBAAA,iBAGA,MAAA8mG,EAGA,IAAA+tT,EAAA1mT,EAAAh6B,MACA,MAAA,IAAAgyB,MAAA,qBAAAgI,EAAA6sH,IAAAgN,SAGA,OAAA6sL,EAAA1mT,EAAAh6B,MAAAg6B,MAOA,MAAA0mT,EAAA,CAIA19T,IAAAgX,IACA,CACA6sH,IAAA7sH,EAAA6sH,IACA1wH,KAAA6D,EAAA75B,KAAAhC,OACAwiV,eAAA3mT,EAAA75B,KAAAhC,OACA6/L,OAAA,EACAh+L,KAAA,OACA0qE,WAAA97I,EACAgyZ,eAAAhyZ,EACAiyZ,cAAA,IAMA7mT,KAAAA,IAEA,MAAAohS,EAAA,CACAv0K,IAAA7sH,EAAA6sH,IACA7mJ,KAAA,OACAm2B,KAAA6D,EAAA28N,OAAAC,WACA+pF,eAAA3mT,EAAA75B,KAAAg2B,KACA6nK,OAAAhkK,EAAA28N,OAAAskC,WAAA98R,OACAusE,WAAA97I,EACAgyZ,eAAAhyZ,EACAiyZ,cAAA,EACAjtU,KAAAomB,EAAA28N,OAAA/iP,MAOA,OAJAomB,EAAA28N,OAAAE,QACAukE,EAAAvkE,MAAA78N,EAAA28N,OAAAE,OAGAukE,GAKA4c,UAAAh+S,IAEA,MAAAohS,EAAA,CACAv0K,IAAA7sH,EAAA6sH,IACA7mJ,KAAA,YACAm2B,KAAA,EACAwqT,eAAA3mT,EAAA75B,KAAAg2B,KACA6nK,OAAAhkK,EAAA75B,KAAAq3R,MAAAr5R,OACAusE,WAAA97I,EACAgyZ,eAAAhyZ,EACAiyZ,cAAA,EACAjtU,KAAAomB,EAAA28N,OAAA/iP,MAOA,OAJAomB,EAAA28N,OAAAE,QACAukE,EAAAvkE,MAAA78N,EAAA28N,OAAAE,OAGAukE,GAKAhsQ,OAAAp1B,IAEA,CACA6sH,IAAA7sH,EAAA6sH,IACA1wH,KAAA6D,EAAA75B,KAAAhC,OACAwiV,eAAA3mT,EAAA75B,KAAAhC,OACA6B,KAAA,OACAg+L,OAAA,EACAtzH,WAAA97I,EACAgyZ,eAAAhyZ,EACAiyZ,cAAA,IAMAlhT,SAAA3F,IAEA,CACA6sH,IAAA7sH,EAAA6sH,IACA1wH,KAAA6D,EAAA75B,KAAAhC,OACAwiV,eAAA3mT,EAAA75B,KAAAhC,OACA6/L,OAAA,EACAh+L,KAAA,OACA0qE,WAAA97I,EACAgyZ,eAAAhyZ,EACAiyZ,cAAA,0MClKA,aAEA,MAAAC,EAAAr0Z,EAAA,mBACAijZ,EAAAjjZ,EAAA,yBACA4sR,SAAAA,GAAA5sR,EAAA,wBACAupT,EAAAvpT,EAAA,YACAg7N,EAAAh7N,EAAA,QAEA8oW,EAAA,OAoLAhpW,EAAAC,QAlGAggJ,MAAA9pE,EAAA72E,EAAAgC,KACA,MAAA8rF,QAAAmnU,EAAAp+U,EAAA70E,GAIA,IAAAmqO,EAAA,CACA+oL,UAAA,QAcA,GAXAt5L,EAAAsM,MAAAloO,KACAA,EAAA,SAAAA,MAIAA,GADAA,GAAAA,GAAA,IAAA6kF,QACA0B,QAAA,WAAA,MAEAnT,SAAA,MAAApzE,EAAAsyE,OAAA,IACAtyE,EAAAA,EAAAmpG,UAAA,EAAAnpG,EAAAsyE,OAAA,KAGAtyE,EACA,MAAAmqT,EAAA,IAAAhkN,MAAA,2BAAA,eAGA,GAAA,MAAAnmG,EAAAmpG,UAAA,EAAA,GACA,MAAAghN,EAAA,IAAAhkN,MAAA,yCAAA,oBAGA,MAAAnmG,EAAAmpG,UAAAnpG,EAAAsyE,OAAA,KACAtyE,EAAAA,EAAAmpG,UAAA,EAAAnpG,EAAAsyE,OAAA,IAGA,MAAAo5U,EAAA7H,EAAA7jZ,GAEA,GAAA0rZ,EAAA,KAAAhiD,EAAA,CAEA,IAAAyrD,EAGAA,EADA,IAAAzJ,EAAAp5U,OACA,IAAAo5U,EAAA/zU,KAAA,OAEA,IAAA+zU,EAAAj5U,MAAA,EAAAi5U,EAAAp5U,OAAA,GAAAqF,KAAA,OAIAw0J,EAAA,CACAh4J,KAAA,OACAmxI,MAAAomM,EAAAp5U,OAAA,EACA4iV,UAAA,OAEAP,QAAA,IAAAjJ,EAAA/zU,KAAA,OACAw9U,aAAAA,EACA7hT,MAAAo4S,EACA1rZ,KAAA,IAAA0rZ,EAAA/zU,KAAA,OACAz3E,KAAAwrZ,EAAAA,EAAAp5U,OAAA,QAEA,CACA,MAAAqiV,EAAA,SAAA7mU,IAAA49T,EAAAp5U,OAAA,IAAAo5U,EAAA/zU,KAAA,KAAA,KACAw9U,EAAA,SAAArnU,KAAA49T,EAAAj5U,MAAA,EAAAi5U,EAAAp5U,OAAA,GAAAqF,KAAA,OAGAw0J,EAAA,CACAh4J,KAAA,MACAmxI,MAAAomM,EAAAp5U,OACA4iV,UAAA,OAEAC,aAAAA,EACAR,QAAAA,EACArhT,MAAAo4S,EACA1rZ,KAAA,IAAA0rZ,EAAA/zU,KAAA,OACAz3E,KAAAwrZ,EAAAA,EAAAp5U,OAAA,IAIA,MAAA23O,EAAA,QAAA99E,EAAAh4J,KAAAg4J,EAAAwoL,QAAAxoL,EAAAnsO,KAEA,IACA,MAAAo5E,QAAAo0M,EAAAy8B,EAAApzO,EAAA6wP,MAEAv7F,EAAAnR,IAAA5hJ,EAAA4hJ,IACAmR,EAAAwoL,QAAA,SAAAv7U,EAAAp5E,OACAmsO,EAAA+oL,UAAA97U,EAAAjF,KACAg4J,EAAA/3J,QAAAgF,EAAAhF,QAEA,SAAA+3J,EAAA+oL,WAAA,cAAA/oL,EAAA+oL,WAAA,SAAA97U,EAAAjF,MAAA,cAAAiF,EAAAjF,OACAg4J,EAAA2+F,OAAA1xP,EAAA0xP,QAEA,MAAAhkO,GACA,GAAA,kBAAAA,EAAApkG,KACA,MAAAokG,EAMA,OAFAqlI,EAAAo7K,OAAA78T,QAAAyhJ,EAAAnR,KAEAmR,wJCzLA,aAEA,MAAAvQ,EAAAh7N,EAAA,SACAikU,OAAAA,GAAAjkU,EAAA,gBACAgkU,QACAA,GACAhkU,EAAA,eACA84N,EAAA94N,EAAA,QAAAA,CAAA,gCACA+jM,EAAA/jM,EAAA,cACAwkO,EAAAxkO,EAAA,sBAAA+6N,UACAwuF,EAAAvpT,EAAA,aAEAypU,aACAA,GACAzpU,EAAA,kBAiDAF,EAAAC,QAvCAggJ,MAAA9pE,EAAA70E,KACA,GAAAA,GAAAA,EAAAk7N,QAAAl7N,EAAAk7N,OAAAx8E,QACA,MAAAypK,EAAA,IAAAhkN,MAAA,mBAAA,cAAA,CAAAjmG,KAAA,YAOA,IAAA86N,QAHAnkJ,EAAAwwP,KAAAu1D,UAAAxvS,OAKA,IACA,MAAAwwI,QAAA/mJ,EAAAwwP,KAAAu1D,UAAA/tS,IAAAw7O,GAEArvG,EAAA,IAAAY,EAAAgC,GACA,MAAA92H,GACA,GAAA,kBAAAA,EAAApkG,KACA,MAAAokG,EAGA4yH,EAAA,yBACA,MAAAplJ,EAAA,IAAAswP,EAAA,IAAAC,EAAA,CAAA1wP,KAAA,cAAA25M,WAMA,GALA9yD,QAAAnkJ,EAAA6wP,KAAAhpG,IAAApqJ,EAAAqwH,EAAAwpK,OAAA,CACAC,WAAA,EACArkC,QAAA3kG,EAAAp0H,MAAA,cAGAhvG,GAAAA,EAAAk7N,QAAAl7N,EAAAk7N,OAAAx8E,QACA,MAAAypK,EAAA,IAAAhkN,MAAA,mBAAA,cAAA,CAAAjmG,KAAA,kBAGA22E,EAAAwwP,KAAAu1D,UAAAl+J,IAAA2rG,EAAArvG,EAAAgL,OAKA,OAFAtM,EAAA,yBAAAsB,KAEAA,mMC5DA,aAaAt6N,EAAAC,QARA,CAAAX,EAAA,MAEAA,EACA6kF,OACA8F,MAAA,qBAAA,IACAvP,OAAAsP,uCCVA,aAEA,MAAAktG,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IACAk4L,EAAA7zZ,EAAA,uBACA84N,EAAA94N,EAAA,QAAAA,CAAA,kBACAupT,EAAAvpT,EAAA,aACAikU,OAAAA,GAAAjkU,EAAA,eACAw0Z,EAAAx0Z,EAAA,oBACAmsW,EAAAnsW,EAAA,oBACAy0Z,EAAAz0Z,EAAA,uBACA00Z,EAAA10Z,EAAA,4BACAgkU,QAAAA,GAAAhkU,EAAA,eACA+jM,EAAA/jM,EAAA,cACAwkO,EAAAxkO,EAAA,sBAAA+6N,WACAm6G,KAAAA,GAAAl1U,EAAA,YACA2rP,SAAAA,GAAA3rP,EAAA,yBACAqwW,UAAAA,GAAArwW,EAAA,wBACAwoF,EAAAxoF,EAAA,WACA2yE,EAAA3yE,EAAA,QACAy1W,EAAAz1W,EAAA,QAEAi6Y,EAAAj6Y,EAAA,0CACAupU,EAAAvpU,EAAA,2CAmBA00J,EAAA,CACAy4B,OAAA,EACAqqN,oBAAA,IACAruE,QAAA,WACAqkC,WAAA,EACA6C,WAAA,GA8EA,SAAAskD,EAAAl5T,EAAAm5T,EAAAhmD,GACAgmD,IACAA,EAAA,GAGA,MAAA7qU,EAAA0R,EAAA1R,MAAA,wCAEA,IAAAA,EACA,MAAA,IAAAwb,MAAA,sBAAA9J,KAGA,IACA,CACAo5T,EACA79T,EACA7P,GACA4C,EAEA,MAAA8qU,GAAAA,IACAA,EAAA,OAGA,IAAAC,EA5FA,SAAA3tU,EAAAytU,EAAAhmD,GACA,IAAAkmD,EAAA,EAcA,OAZA3tU,EAAAjM,SAAA,MAAAiM,EAAAjM,SAAA,OAAA0zR,GAAA,EAAAgmD,GAAA,EAAAA,GAAA,GAAAA,MACAE,GAAA,GAGA3tU,EAAAjM,SAAA,OACA45U,GAAA,GAGA3tU,EAAAjM,SAAA,OACA45U,GAAA,GAGAA,EA6EAC,CAAA5tU,EAAAytU,EAAAhmD,GAIA,OAHAkmD,EAvEA,SAAAD,EAAAC,GACA,IAAAE,EAAA,EAcA,OAZAH,EAAA35U,SAAA,OACA85U,GAAAF,GAAA,GAGAD,EAAA35U,SAAA,OACA85U,GAAAF,GAAA,GAGAD,EAAA35U,SAAA,OACA85U,GAAA,GAGAA,EAwDAC,CAAAJ,EAAAC,GACAA,EAjDA,SAAAD,EAAA1tU,EAAA2tU,GAeA,OAdA3tU,EAAAjM,SAAA,OACA45U,GAAAjiV,SAAA,OAAA,IAGAsU,EAAAjM,SAAA,OACA25U,EAAA35U,SAAA,OACA45U,GAAAjiV,SAAA,OAAA,IAGAgiV,EAAA35U,SAAA,OACA45U,GAAAjiV,SAAA,OAAA,KAIAiiV,EAkCAI,CAAAL,EAAA1tU,EAAA2tU,GAEA,MAAA99T,GACA69T,EAAA35U,SAAA,OAEA05U,GAAA/hV,SAAA,OAAA,GAGA+hV,GAAAE,GAGAD,EAAA35U,SAAA,OAEA05U,GAAA/hV,SAAA,OAAA,GAGA+hV,GAAAE,GAGAD,EAAA35U,SAAA,OAEA05U,GAAA/hV,SAAA,OAAA,GAGA+hV,GAAAE,GAGAF,GAGA,MAAA59T,EACA89T,EAAAF,EAGA,MAAA59T,EACA89T,EAAAF,EAGAA,EAQA,SAAAO,EAAAhuU,EAAA4uR,GACA,GAAA5uR,aAAArU,QAAA,iBAAAqU,EAAA,CACA,MAAAiuU,EAAA,GAAAjuU,IAGAA,EADAiuU,EAAArrU,MAAA,UACAlX,SAAAuiV,EAAA,GAGA,EAAAA,EAAA7oU,MAAA,KAAApa,QAAA,CAAAsnF,EAAAqpF,IACA6xK,EAAA7xK,EAAArpF,EAAAs8M,EAAAnH,gBACAmH,EAAA5uR,MAAA,GAIA,OAAAA,EAMArnF,EAAAC,QAAAk2E,GAuHAszP,GAnHAxpL,eAAA3gJ,EAAA+nF,EAAA/lF,EAAA,IAEA,MAAAosK,EAAAwpB,EAAAtiC,EAAAtzJ,GAEA03N,EAAA,sBAAA15N,KAEA,MAAAg7N,IACAA,EAAAm6L,aACAA,EAAAj1Z,KACAA,SACAu0Z,EAAA59U,EAAA72E,EAAAouK,GAEA,GAAA,WAAA4sD,EAAAgN,MACA,MAAAmiF,EAAA,IAAAhkN,MAAA,GAAAnmG,2BAAA,kBAGA,GAAAouK,EAAA6iM,UAAA,CAGA,MAAAnjR,QAAAgoP,GACAn1L,kBACA,UAAA,MAAAyiC,KAAA6tL,EAAAj2I,EAAAnkJ,EAAA6wP,MAAA,CACA,GAAA,SAAAtkJ,EAAAjvG,MAAA,cAAAivG,EAAAjvG,KACA,MAAAg2O,EAAA,IAAAhkN,MAAA,GAAAnmG,2BAAA,kBAGAojL,EAAA0nJ,OAAA/iP,KAAAguU,EAAAhuU,EAAAq7F,EAAA0nJ,QAEA,MAAAx2P,EAAA,IAAAswP,EAAAxhJ,EAAA0nJ,OAAAh9C,UAAA1qG,EAAA9uG,KAAAq3R,YAEA,CACA3rW,KAAAojL,EAAApjL,KACAo0E,QAAAE,OAKA8N,GAAAmqK,EAAAnqK,EAAAvL,EAAAgkF,MAAA,IACAuT,EACA45J,KAAA,EACAuxE,WAAA54P,gBAAAv+D,EAAAy4E,EAAAuT,GACA,UAAA,MAAAgV,KAAAhhG,QACAu+D,iBAGA,MAAArsE,EAAA8uG,EAAAhvG,QAEAwpJ,EAAAtpJ,EAAA23R,YACAjxI,QAAA6/K,EAAAj9K,EAAA/iE,EAAAuT,GACA08J,EAAAjG,EAAA85D,UAAArqT,EAAA04K,MAEA,MAAA,CACAhyB,IAAAA,EACA1wH,KAAAszH,EAAAtrJ,OACAtyE,KAAAojL,EAAApjL,KACA8qU,OAAAA,SAMAzhP,GAAAD,EAAAC,KAGA,IAAAyE,EACA,MAAAq8N,EAAA,IAAAhkN,MAAA,mBAAAnmG,KAAA,uBASA,aALAq2W,EAAAx/R,EAAAw/R,CAAAr2W,EAAAouK,cAGA76F,EAAAsD,EAAAtD,CAAA,SAAAua,EAAAktI,MAAAh7N,EAAAouK,GAKA,IAAA95F,QAAAuC,EAAA6wP,KAAA74O,IAAAmsI,GACA,MAAA27I,EAAA9xC,EAAA85D,UAAArqT,EAAA04K,MACA2pH,EAAA5uR,KAAAguU,EAAAhuU,EAAA4uR,GACAriS,EAAA,IAAAswP,EAAA+xC,EAAA7oF,UAAAx5M,EAAAq3R,OAGA,MAAA5hC,EAAA37J,EAAA27J,SAAAz0K,EAAAy0K,QAEAksF,QAAAp/U,EAAA6wP,KAAAhpG,IAAApqJ,EAAAqwH,EAAAwpK,OAAA,CACAC,WAAApzI,EAAAjqH,QACAg5N,QAAA3kG,EAAAp0H,MAAA+4N,GACAivE,UAAA5qO,EAAA2f,QAGAxzB,QAAA66P,EAAAv+U,EAAAs+U,GACArhV,EAAAymF,EAAAA,EAAAjoF,OAAA,GACAs+F,QAAA/5F,EAAA6wP,KAAA74O,IAAA/a,EAAAknJ,KAEA/iJ,QAAA80R,EAAAl2R,EAAA,CACA/C,OAAA88F,EACA1wK,KAAAA,EACA86N,IAAAi7L,EACA3rT,KAAAh2B,EAAA23R,YAAA35R,OACAy7G,MAAA3f,EAAA2f,MACAg8I,QAAAA,EACAqkC,WAAApzI,EAAAjqH,QACAqnS,oBAAA1+R,EAAAA,IAGA5lC,EAAAknJ,IAAA/iJ,EAAA+iJ,IAGA,MAAAk7L,QAAAb,EAAAx+U,EAAA0jF,EAAA6T,SAGAknP,EAAAz+U,EAAAq/U,EAAA9nP,+iBC1UA,aAEA,MAAAy9O,SAAAA,GAAAjrZ,EAAA,wBACA84N,EAAA94N,EAAA,QAAAA,CAAA,2BA4CAF,EAAAC,QA1BAggJ,MAAA9pE,EAAA72E,KACA05N,EAAA,2BAAA15N,KAEA,MAAAmsO,EAAA,GAEA,UAAA,MAAAgqL,KAAAtK,EAAA7rZ,EAAA62E,EAAA6wP,MAAA,CACA,IAAAp9N,EAIAA,EADA6rT,EAAA7hV,gBAAAwxJ,WACAqwL,EAAA7hV,KAAAhC,OAEA6jV,EAAA7hV,KAAAg2B,KAGA6hI,EAAAh0J,KAAA,CACAj4E,KAAAi2Z,EAAAj2Z,KACA86N,IAAAm7L,EAAAn7L,IACA1wH,KAAAA,EACAn2B,KAAAgiV,EAAAhiV,OAIA,OAAAg4J,2EC5CA,aAEA,MAAAo/H,QACAA,EAAA3mC,QACAA,GACAhkU,EAAA,eACAg7N,EAAAh7N,EAAA,QACA84N,EAAA94N,EAAA,QAAAA,CAAA,iCACAikU,OAAAA,GAAAjkU,EAAA,eAEA6jZ,EAAA7jZ,EAAA,wCAEAw1Z,EAAAx1Z,EAAA,qCACAy1Z,oBACAA,EAAAC,kBACAA,EAAAC,yBACAA,EAAAC,YACAA,EAAA/J,SACAA,EAAAgK,qBACAA,GACA71Z,EAAA,gBACAupT,EAAAvpT,EAAA,YACA+jM,EAAA/jM,EAAA,cACAwkO,EAAAxkO,EAAA,sBAAA+6N,UACAvyI,EAAAxoF,EAAA,WAkGA81Z,EAAA/1Q,MAAA9pE,EAAA70E,KACA,MAAAi2E,QAAAu+U,EAAA3/U,EAAA70E,EAAA8xE,OAAA63R,MAAAl0R,KAAAwP,IAAA,CACA/mF,KAAA+mF,EAAAi8Q,KACA54P,KAAArjB,EAAAolR,MACArxI,IAAA/zI,EAAAy5N,SACAxhN,OAAA,CACAh/F,KAAA8B,EAAA9B,KACAoqG,KAAAtoG,EAAAsoG,KACA0wH,IAAAh5N,EAAAg5N,MACAh5N,GAIA,OAFA03N,EAAA,4CAAAzhJ,EAAA+iJ,OAEA/iJ,GAgBA0+U,EAAAh2Q,MAAA9pE,EAAA70E,KACAA,EAAA8xE,OAAAk5R,OAAAhrW,EAAA9B,MACA8B,EAAA8xE,OAAAi5R,QAAA,IAAAxB,EAAAvpW,EAAA9B,KAAA8B,EAAAsoG,KAAAtoG,EAAAg5N,MAEA,MAAA1mJ,EAAAuwP,EAAA85D,UAAA38X,EAAA8xE,OAAAk5K,MAEA,GAAA14K,EAAA02P,MAAA,CAEA,MAAA7tG,EAAA/xH,KAAAunE,MACAo8L,EAAA97R,KAAA6nC,MAAAqiH,EAAA,KAEA7oJ,EAAA02P,MAAA,CACA+jC,KAAAA,EACAC,MAAA,KAAA7xI,EAAA,IAAA4xI,IAGA/sW,EAAA8xE,OAAA,IAAA8wP,EAAAtwP,EAAAw5M,UAAA9rR,EAAA8xE,OAAA63R,OAGA,MAAA5hC,EAAA3kG,EAAAp0H,MAAAhvG,EAAA+nU,SAGA/uG,QAAAnkJ,EAAA6wP,KAAAhpG,IAAA18N,EAAA8xE,OAAA6wH,EAAAwpK,OAAA,CACAC,WAAApsW,EAAAosW,WACArkC,QAAAA,EACAivE,UAAAh3Y,EAAA+rL,QAGA,MAAA,CACAz5G,KAAAtyE,EAAA8xE,OACAknJ,IAAAA,EACA1wH,KAAAtoG,EAAA8xE,OAAAw2B,OAeAssT,EAAAj2Q,MAAA9pE,EAAA70E,KACA,MAAA6kY,MACAA,EAAA7mY,KAAAA,SACA62Z,EAAAhgV,EAAA70E,GAEAi2E,QAAAmR,EAAAy9S,EAAA94M,MAAAl3G,EAAAgkF,QAEAvmF,QAAAuC,EAAA6wP,KAAA74O,IAAA5W,EAAA+iJ,KAGA87L,EAAA90Z,EAAA8xE,OAAA63R,MACAngR,MAAAvE,GAAAA,EAAAi8Q,KAAA/5P,UAAA,EAAA,KAAAnpG,EAAA,GAAAg4F,SAGA++T,EAAAziV,EAAAq3R,MACAngR,MAAAvE,GAAAA,EAAAi8Q,KAAA/5P,UAAA,EAAA,KAAAnpG,EAAA,GAAAg4F,SAEA,IAAA++T,EACA,MAAA,IAAA5wT,MAAA,6BAAAnmG,EAAA,GAAAg4F,UASA,OANA8+T,GACA90Z,EAAA8xE,OAAAk5R,OAAA8pD,EAAA5zD,MAGAlhW,EAAA8xE,OAAAi5R,QAAAgqD,GAEAV,EAAAx/U,EAAA70E,EAAA8xE,OAAA63R,MAAA3rW,EAAA,GAAAilZ,OAAAjjZ,IAaA60Z,EAAAl2Q,MAAA9pE,EAAA70E,KACA,MAAAmsG,EAAA,CACAjuG,KAAA8B,EAAA9B,KACA86N,IAAAh5N,EAAAg5N,IACA1wH,KAAAtoG,EAAAsoG,MAIAoiT,QAAA6J,EAAAv0Z,EAAA8xE,OAAA63R,OACAr3R,EAAAuwP,EAAA85D,UAAA38X,EAAA8xE,OAAAk5K,MACAgqK,EAAAZ,IAEAvvB,EAAA,IAAA4d,EAAA,CACA32T,MAAA,EACAxT,KAAA,EACAxG,OAAA,KACAqwU,UAAA,KACAnkZ,KAAA,GACAkkZ,OAAA,EACAxxL,MAAA,EACA3qI,KAAAzT,EAAAyT,MACA,CACAsyT,WAAA2c,EAAA3c,WACAE,aAAAyc,EAAAzc,aACAC,eAAAwc,EAAAxc,kBACAx4Y,IAEA6kY,EAAA4e,QAAAiH,EAEAp4U,EAAA02P,QAEA67D,EAAA77D,MAAA,IAAA5/N,MAIA,MAAAirG,QAAAq2M,EAAArG,qBAAAl4S,EAAAjuG,MACAF,EAAA8sZ,EAAAz2M,GACAr2M,EAAA,GAAAs0E,KAAAtyE,EAAA8xE,OACA,IAAAlB,EAAA,EAEA,KAAAA,EAAA5yE,EAAAsyE,QAAA,CACA,MAAAsmC,EAAA54G,EAAA4yE,GACAA,IACA,MAAA0B,EAAAskC,EAAAtkC,KAEA,IAAAA,EACA,MAAA,IAAA6xB,MAAA,uBAGA,MAAAlf,EAAA3S,EAAAq3R,MACAngR,MAAAvE,GAAAA,EAAAi8Q,KAAA/5P,UAAA,EAAA,KAAAyP,EAAA5gB,SAEA,IAAA/Q,EAAA,CAEAyyI,EAAA,QAAA9gH,EAAA5gB,SAAAmW,EAAAjuG,sBACA0yE,EAAA5yE,EAAAsyE,OAEA,MAGA,GAAA2U,EAAAi8Q,OAAA,GAAAtqP,EAAA5gB,SAAAmW,EAAAjuG,OAAA,CAEAw5N,EAAA,QAAA9gH,EAAA5gB,SAAAmW,EAAAjuG,yBACA0yE,EAAA5yE,EAAAsyE,OAEA,MAGA,GAAA2U,EAAAi8Q,KAAA5wR,OAAA,EAAA,CAEAonJ,EAAA,QAAAzyI,EAAAi8Q,QAAAj8Q,EAAAy5N,yCACA9tO,EAAA5yE,EAAAsyE,OAEA,MAIAonJ,EAAA,kBAAA9gH,EAAA5gB,UACA,MAAAqtT,QAAAxuU,EAAA6wP,KAAA74O,IAAA5H,EAAAy5N,MAGA,IAAA1gT,EAAA4yE,GAAA,CACA8mJ,EAAA,uBAAA9gH,EAAA5gB,gBACAs+T,EAAAjR,EAAA15C,MAAA+gD,EAAA9zS,EAAAqsS,OAAAxxU,SAAAmlC,EAAA5gB,OAAA,KAEA,MAAAq+G,QAAAq2M,EAAArG,qBAAAl4S,EAAAjuG,MAEAF,EAAAm4E,KAAA,CACA8sU,OAAA5uM,EAAA4uM,OACAjtT,OAAAy0T,EAAAp2M,EAAApxH,KACA3Q,KAAA+wU,IAGA,MAGA,MAAA4R,EAAAj3Z,EAAA4yE,SAGA6jV,EAAApR,EAAA15C,MAAAsrD,EAAAhS,OAAAyH,GAEAuK,EAAA3iV,KAAA+wU,EASA,aALAxe,EAAA4e,QAAA/mL,IAAAvwH,EAAAjuG,KAAA,CACAoqG,KAAA6D,EAAA7D,KACA0wH,IAAA7sH,EAAA6sH,MAGA,CACA6rK,MAAAA,EAAA7mY,KAAAA,IAQA8sZ,EAAAz2M,IACA,MAAAr2M,EAAA,CAAA,CACAilZ,OAAA5uM,EAAA4uM,OACAjtT,OAAAy0T,EAAAp2M,EAAApxH,OAGA,IAAAggU,EAAA5uM,EAAA4uM,OAAAkB,QACA+Q,EAAA7gN,EAAA4uM,OAAAmB,aAEA,KAAAnB,GACAjlZ,EAAAm4E,KAAA,CACA8sU,OAAAA,EACAjtT,OAAAy0T,EAAAyK,KAGAA,EAAAjS,EAAAmB,aACAnB,EAAAA,EAAAkB,QAKA,OAFAnmZ,EAAAutN,UAEAvtN,GAGAU,EAAAC,QA7UAggJ,MAAA9pE,EAAA70E,KACA,IAAA8xE,EAAA9xE,EAAA8xE,OAEA,GAAA9xE,EAAAg2W,UAAA,CACA,IAAAp8I,EAAAsM,MAAAlmO,EAAAg2W,WACA,MAAA7tD,EAAA,IAAAhkN,MAAA,iCAAA,qBAGAuzH,EAAA,uBAAA13N,EAAAg2W,aACAlkS,QAAA+C,EAAA6wP,KAAA74O,IAAA7sF,EAAAg2W,WAGA,IAAAlkS,EACA,MAAAq2O,EAAA,IAAAhkN,MAAA,2CAAA,kBAGA,IAAAnkG,EAAAg5N,IACA,MAAAmvF,EAAA,IAAAhkN,MAAA,kCAAA,oBAGA,IAAAnkG,EAAA9B,KACA,MAAAiqT,EAAA,IAAAhkN,MAAA,mCAAA,qBAOA,GAJAy1H,EAAAsM,MAAAlmO,EAAAg5N,OACAh5N,EAAAg5N,IAAA,IAAAY,EAAA55N,EAAAg5N,OAGAh5N,EAAAsoG,MAAA,IAAAtoG,EAAAsoG,KACA,MAAA6/M,EAAA,IAAAhkN,MAAA,mCAAA,qBAGA,MAAA2+D,EAAA+/J,EAAA85D,UAAA7qT,EAAAk5K,MAEA,MAAA,2BAAAloF,EAAA3wF,MACAulJ,EAAA,oCAEAk9L,EAAA//U,EAAA,IACA70E,EACA8xE,OAAAA,KAIAA,EAAA63R,MAAAr5R,QAAAtwE,EAAAo2Y,qBACA1+K,EAAA,6CAEAg9L,EAAA7/U,EAAA,IACA70E,EACA8xE,OAAAA,EACAk3P,MAAAlmK,EAAAkmK,MACAjjP,KAAA+8E,EAAA/8E,SAIA2xI,EAAA,UAAA13N,EAAA9B,SAAA8B,EAAAg5N,6BAEA27L,EAAA9/U,EAAA,IACA70E,EACA8xE,OAAAA,gTCzGA,aAEA,MAAA8wP,QACAA,GACAhkU,EAAA,gBACAokZ,OACAA,EAAAD,WACAA,GACAnkZ,EAAA,iBAEA6jZ,EAAA7jZ,EAAA,wCAEAw1Z,EAAAx1Z,EAAA,oCACA84N,EAAA94N,EAAA,QAAAA,CAAA,mCACAikU,OAAAA,GAAAjkU,EAAA,eACA+jM,EAAA/jM,EAAA,cACAwkO,EAAAxkO,EAAA,sBAAA+6N,UACAvyI,EAAAxoF,EAAA,WAyDA01Z,EAAA31Q,MAAAyrN,EAAAsgD,EAAAyK,EAAAC,KAEA,MAAAnS,EAAA,IAAAD,EAAA,CACAtkS,KAAAgsS,EAAA19O,SAAAtuD,KACA+mH,KAAAilL,EAAA19O,SAAAy4D,MACA0vL,EAAAC,GAKA,OAJAD,EAAAhQ,aAAAiQ,EAAAnS,SAEAwR,EAAArqD,EAAA64C,EAAAyH,GAEAzH,GAMAsR,EAAA51Q,MAAAyrN,IACA,MAAA4qD,EAAAZ,IACAnR,EAAAF,EAAA,CACAhqF,OAAAi8F,EAAA3c,WACA5yK,KAAAuvL,EAAAxc,iBAKA,aAFAic,EAAArqD,EAAA64C,EAAAA,GAEAA,GAQAwR,EAAA91Q,MAAAyrN,EAAA64C,EAAAyH,WACAt5O,QAAA2gD,IACAq4I,EAAA30R,KAAAwP,IACA,GAAA,IAAAA,EAAAi8Q,KAAA5wR,OAAA,CACA,MAAA2S,EAAAxR,SAAAwT,EAAAi8Q,KAAA,IAOA,OALA+hD,EAAAkC,aAAAliU,EAAA,IAAA+/T,EAAA,CACAtkS,KAAAgsS,EAAA19O,SAAAtuD,KACA+mH,KAAAilL,EAAA19O,SAAAy4D,MACAw9K,EAAAhgU,IAEAmuF,QAAAC,UAGA,OAAAq5O,EAAAhuL,IAAAz3I,EAAAi8Q,KAAA/5P,UAAA,GAAA,CACAmB,KAAArjB,EAAAolR,MACArxI,IAAA/zI,EAAAy5N,YASA+rG,EAAAp2M,GACAA,EACA5qG,SAAA,IACA1I,cACA2yR,SAAA,EAAA,KACAvsR,UAAA,EAAA,GA4IAzoG,EAAAC,QAAA,CACA02Z,aArIA12Q,MAAA9pE,EAAAygV,EAAAC,KAEA,MAAA7K,QAAA6J,EAAAgB,EAAA5rD,OACAt1J,QAAAq2M,EAAArG,qBAAAiR,GAIAt3Z,EAAA,CAAA,CACAilZ,OAAA5uM,EAAA4uM,OACAjtT,OAAAy0T,EAAAp2M,EAAApxH,OAEA,IAAAuyU,EAAAnhN,EAAA4uM,OAEA,KAAAuS,IAAA9K,GACA1sZ,EAAAm4E,KAAA,CACA8sU,OAAAuS,EACAx/T,OAAAy0T,EAAA+K,EAAApR,gBAIAoR,EAAAA,EAAArR,QAGAnmZ,EAAAutN,UACAvtN,EAAA,GAAAs0E,KAAAijV,EAGA,IAAA,IAAA/iV,EAAA,EAAAA,EAAAx0E,EAAAsyE,OAAAkC,IAAA,CACA,MAAAokC,EAAA54G,EAAAw0E,GAEA,IAAAokC,EAAAtkC,KACA,MAAA,IAAA6xB,MAAA,gCAIA,MAAAlf,EAAA2xB,EAAAtkC,KAAAq3R,MACAvwR,QAAA6L,GAAAA,EAAAi8Q,KAAA/5P,UAAA,EAAA,KAAAyP,EAAA5gB,SACA1M,MAGA,IAAArE,EAAA,CAEAyyI,EAAA,QAAA9gH,EAAA5gB,SAAAs/T,mBAEA,SAIA,GAAArwU,EAAAi8Q,OAAA,GAAAtqP,EAAA5gB,SAAAs/T,IAAA,CACA59L,EAAA,QAAA9gH,EAAA5gB,SAAAs/T,sBAGA,SAIA59L,EAAA,kBAAA9gH,EAAA5gB,UACA,MAAA1jB,QAAAuC,EAAA6wP,KAAA74O,IAAA5H,EAAAy5N,MAGA,IAAA1gT,EAAAw0E,EAAA,GAAA,CACAklJ,EAAA,uBAAA9gH,EAAA5gB,gBAEAs+T,EAAAhiV,EAAAq3R,MAAA+gD,EAAA9zS,EAAAqsS,OAAAxxU,SAAAmlC,EAAA5gB,OAAA,KACA,MAAAq+G,QAAAq2M,EAAArG,qBAAAiR,GAGAt3Z,EAAAm4E,KAAA,CACA8sU,OAAA5uM,EAAA4uM,OACAjtT,OAAAy0T,EAAAp2M,EAAApxH,KACA3Q,KAAAA,IAGA,SAGA,MAAA2iV,EAAAj3Z,EAAAw0E,EAAA,SAGAiiV,EAAAniV,EAAAq3R,MAAAsrD,EAAAhS,OAAAyH,GAEAuK,EAAA3iV,KAAAA,EAOA,aAJAo4U,EAAAhuL,IAAA44L,GAAA,GAEAt3Z,EAAAutN,UAEA,CACAm/L,WAAAA,EACA1sZ,KAAAA,IA4CAq2Z,oBAjPA11Q,MAAA9pE,EAAAu1R,EAAA64C,EAAAjjZ,KACA,MAAAg1Z,EAAAZ,IAGAr8P,EAAA+rE,WAAAhvE,KAAAmuP,EAAAV,UAAAgB,WAAAh4L,WACAj5I,EAAAuwP,EAAA85D,UAAA38X,EAAA8xE,OAAAk5K,MACA1yK,EAAA,IAAAuqP,EAAA,CACA1wP,KAAA,yBACA4lF,KAAAA,EACAw1M,OAAA01C,EAAAO,YACA9+F,SAAAswG,EAAAzc,aACAxyT,KAAAzT,EAAAyT,KACAijP,MAAA12P,EAAA02P,QAGAjB,EAAA3kG,EAAAp0H,MAAAhvG,EAAA+nU,SACAj2P,EAAA,IAAA8wP,EAAAtqP,EAAAwzM,UAAAs+E,GAOA,MAAA,CACA93R,KAAAR,EACAknJ,UARAnkJ,EAAA6wP,KAAAhpG,IAAA5qJ,EAAA6wH,EAAAwpK,OAAA,CACAC,WAAApsW,EAAAosW,WACArkC,QAAAA,EACAivE,UAAAh3Y,EAAA+rL,QAMAzjF,KAAAx2B,EAAAw2B,OAwNAgsT,kBAAAA,EACAC,yBAAAA,EACAE,qBAAAA,EACAhK,SAAAA,EACA+J,YAtCA71Q,MAAA9pE,EAAAy5D,EAAAtuI,EAAA,MACA,MAAAg1Z,EAAAZ,IAEAvvB,EAAA,IAAA4d,EAAA,CACA32T,MAAA,EACAxT,KAAA,EACAxG,OAAA,KACAqwU,UAAA,KACAnkZ,KAAA,GACAkkZ,OAAA,EACAxxL,MAAA,EACAs4G,MAAAhpU,EAAAgpU,MACAjjP,KAAA/lF,EAAA+lF,MACA,CACAsyT,WAAA2c,EAAA3c,WACAE,aAAAyc,EAAAzc,aACAC,eAAAwc,EAAAxc,kBACAx4Y,EACAgmO,MAAA,WAGA,IAAA,IAAAxzJ,EAAA,EAAAA,EAAA87D,EAAAh+D,OAAAkC,UACAqyT,EAAA4e,QAAA/mL,IAAApuF,EAAA97D,GAAAt0E,KAAA,CACAoqG,KAAAgmC,EAAA97D,GAAA81B,KACA0wH,IAAA1qF,EAAA97D,GAAAwmJ,MAIA,OAAA5xI,EAAAy9S,EAAA94M,MAAAl3G,EAAAgkF,qRClRA,aAEA,MAAA6+D,EAAA94N,EAAA,QAAAA,CAAA,8BACAmsW,EAAAnsW,EAAA,cAEA00J,EAAA,CACA8iP,oBAAA,KAyEA13Y,EAAAC,QAnDAggJ,MAAA9pE,EAAA0jF,EAAAv4J,KACAA,EAAAnB,OAAAiqG,OAAA,GAAAwqD,EAAAtzJ,GAEA03N,EAAA,QAAAn/D,GACAA,EAAAA,EAAA9nF,QAAA86I,UAEA,IACAx1I,EADAnF,EAAA,EAGA,UAAA,MAAA0B,KAAAuC,EAAA6wP,KAAA+vF,QAAAl9P,EAAA9iF,KAAAnD,GAAAA,EAAA0mJ,OAAA,CACA,MAAAA,EAAAzgE,EAAA3nF,GAAAooJ,IACA96N,EAAAq6J,EAAA3nF,GAAA1yE,KAGA,GAFA0yE,KAEAmF,EAAA,CACAA,EAAA,CACAijJ,IAAAA,EACA96N,KAAAA,EACAoqG,KAAAh2B,EAAAg2B,MAGA,SAIA,MAAAryB,QAAA80R,EAAAl2R,EAAA,CACA/C,OAAAQ,EACAp0E,KAAA63E,EAAA73E,KACA86N,IAAAjjJ,EAAAijJ,IACA1wH,KAAAvyB,EAAAuyB,KACAyjF,MAAA/rL,EAAA+rL,MACAqqN,oBAAAp2Y,EAAAo2Y,oBACAruE,QAAA/nU,EAAA+nU,QACAqkC,WAAApsW,EAAAosW,aAIAr2R,EAAA,CACAijJ,IAAA/iJ,EAAA+iJ,IACA96N,KAAAA,EACAoqG,KAAAryB,EAAAqyB,MAKA,MAAA0wH,IAAAA,GAAAjjJ,EAGA,OAFA2hJ,EAAA,aAAAsB,KAEAA,mEC5EA,aAEA,MAAAtB,EAAA94N,EAAA,QAAAA,CAAA,mCACAypU,aACAA,GACAzpU,EAAA,kBACAupT,EAAAvpT,EAAA,YAuBAF,EAAAC,QAZAggJ,MAAA9pE,EAAAmkJ,EAAAh5N,KACA,GAAAA,GAAAA,EAAAk7N,QAAAl7N,EAAAk7N,OAAAx8E,QACA,MAAAypK,EAAA,IAAAhkN,MAAA,mBAAA,cAAA,CAAAjmG,KAAA,YAOA,OAJAw5N,EAAA,wBAAAsB,WAEAnkJ,EAAAwwP,KAAAu1D,UAAAl+J,IAAA2rG,EAAArvG,EAAAgL,OAEAhL,0FC1BA,aAEA,MAAA42L,EAAAhxZ,EAAA,WACA2uY,EAAA3uY,EAAA,UACA84N,EAAA94N,EAAA,QAAAA,CAAA,eACAupT,EAAAvpT,EAAA,YACAy0Z,EAAAz0Z,EAAA,uBACA00Z,EAAA10Z,EAAA,2BACAmsW,EAAAnsW,EAAA,oBACA6zZ,EAAA7zZ,EAAA,uBACAg3L,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IACA64L,EAAAx0Z,EAAA,oBACAupU,EAAAvpU,EAAA,2CAwBA00J,EAAA,CACAoiQ,SAAA,EACA3pO,OAAA,EACAg8I,QAAA,WACAqkC,WAAA,EACAgqC,oBAAA,KAMA13Y,EAAAC,QAAAk2E,GAyFAszP,GArFAxpL,eAAAmW,EAAA+gC,EAAAzpB,EAAA,IAEA,MAAApsK,EAAA41L,EAAAtiC,EAAA8Y,GAEAljE,MAAA/gB,QAAA2sE,KACAA,EAAA,CAAAA,IAGA,MAAAloD,QAAAwkE,QAAA2gD,IACAj9D,EAAAr/E,KAAAz3E,GAAAy0Z,EAAA59U,EAAA72E,EAAAgC,MAEA,IAAA21Z,QAAAlD,EAAA59U,EAAAghH,EAAA71L,GAEA,IAAA4sG,EAAAt8B,SAAAqlV,EACA,MAAAxtG,EAAA,IAAAhkN,MAAA,qCAAA,sBAIA,MAAAyxT,EAAAhpT,EAAApjB,MAAApJ,IAAAA,EAAAmlU,SAEA,GAAAqQ,EACA,MAAAztG,EAAA,IAAAhkN,MAAA,GAAAyxT,EAAA53Z,uBAAA,sBAGA,MAAA63Z,EAAAroD,EAAAmoD,GAEA,GAAAA,EAAApQ,QAGA,GAFA7tL,EAAA,sBAEA,IAAA9qH,EAAAt8B,SAAAulV,EACA,MAAA1tG,EAAA,IAAAhkN,MAAA,4CAAA,2BAKA,GAFAuzH,EAAA,8BAEA9qH,EAAAt8B,OAAA,EAAA,CAEA,IAAAtwE,EAAA01Z,QACA,MAAAvtG,EAAA,IAAAhkN,MAAA,yEAAA,4BAGAyrT,EAAA/6U,EAAA+6U,CAAA+F,EAAA33Z,KAAAgC,GACA21Z,QAAAlD,EAAA59U,EAAA8gV,EAAA33Z,KAAAgC,QACA,GAAA21Z,EAAArkT,MAAAhhC,OAAA,EAAA,CAEA,MAAAwlV,EAAA,IAAAH,EAAArkT,MAAA7gC,MAAA,GAAA,GAAAkF,KAAA,OAEA,UACA43T,EAAA14T,EAAA04T,CAAAuoB,EAAA91Z,GACA,MAAA8kG,GACA,GAAA,kBAAAA,EAAApkG,KACA,MAAAokG,EAGA,IAAA9kG,EAAA01Z,QACA,MAAAvtG,EAAA,IAAAhkN,MAAA,yEAAA,4BAGAyrT,EAAA/6U,EAAA+6U,CAAAkG,EAAA91Z,GACA21Z,QAAAlD,EAAA59U,EAAA8gV,EAAA33Z,KAAAgC,IAKA,MAAA+1Z,EAAAvoD,EAAAmoD,GAAAA,EAAAhD,QAAAgD,EAAAxC,aACA56P,QAAA66P,EAAAv+U,EAAAkhV,GAEA,GAAA,IAAAnpT,EAAAt8B,OAAA,CACA,MAAA8P,EAAAwsB,EAAAtjB,MAEA,IAAAlJ,EACA,MAAA+nO,EAAA,IAAAhkN,MAAA,yBAAA,sBAGA,MAAA6xT,EAAAH,EAAAz1U,EAAAliF,KAAAy3Z,EAAAz3Z,KAIA,OAFAw5N,EAAA,2CAAAm+L,EAAA,YAAA,UAAAG,KAEAC,EAAAphV,EAAAuL,EAAA41U,EAAAz9P,EAAAv4J,GAIA,OADA03N,EAAA,6CACAw+L,EAAArhV,EAAA+3B,EAAA+oT,EAAAp9P,EAAAv4J,MASA,MAAAwtW,EAAAmoD,GACAA,EAAA7sF,QACA6sF,EAAA7sF,OAAA32P,MACAwjV,EAAA7sF,OAAA32P,KAAA2H,SAAA,aAUAm8U,EAAAt3Q,MAAA9pE,EAAAuL,EAAAu1U,EAAAQ,EAAAn2Z,KACA,IAAA8xE,EAAAqkV,EAAA7sU,MAEA,IAAAxX,EACA,MAAAq2O,EAAA,IAAAhkN,MAAA,6BAAA,sBAGAryB,QAAAskV,EAAAvhV,EAAAuL,EAAAu1U,EAAA7jV,EAAA9xE,GAGAm2Z,EAAAhgV,KAAArE,GAEA,MAAAoiV,QAAAb,EAAAx+U,EAAAshV,EAAAn2Z,SAGAszZ,EAAAz+U,EAAAq/U,EAAAl0Z,IAUAk2Z,EAAAv3Q,MAAA9pE,EAAA+3B,EAAA+oT,EAAAQ,EAAAn2Z,KAEA,IAAA,IAAAwyE,EAAA,EAAAA,EAAAo6B,EAAAt8B,OAAAkC,IAAA,CACA,MAAA4N,EAAAwsB,EAAAp6B,GAEAmjV,QAAAS,EAAAvhV,EAAAuL,EAAAA,EAAAliF,KAAAy3Z,EAAA31Z,GAIAm2Z,EAAAA,EAAA7lV,OAAA,GAAAqlV,EAEA,MAAAzB,QAAAb,EAAAx+U,EAAAshV,EAAAn2Z,SAGAszZ,EAAAz+U,EAAAq/U,EAAAl0Z,IAWAo2Z,EAAAz3Q,MAAA9pE,EAAAuL,EAAAi2U,EAAAvkV,EAAA9xE,KACA,MAAAs2Z,QAAAzhV,EAAAwwP,KAAAl1D,OAAAtjL,IAAAzM,EAAA44I,MAEA1mJ,KACAA,EAAA0mJ,IACAA,SACA+xI,EAAAl2R,EAAA,CACAmhS,UAAAlkS,EAAAknJ,IACA1wH,KAAAguT,EAAAv+P,KAAAznF,OACA0oJ,IAAA54I,EAAA44I,IACA96N,KAAAm4Z,EACAtuF,QAAA/nU,EAAA+nU,QACAqkC,WAAApsW,EAAAosW,WACArgL,MAAA/rL,EAAA+rL,MACAqqN,oBAAAp2Y,EAAAo2Y,sBAOA,OAJAtkU,EAAAQ,KAAAA,EACAR,EAAAknJ,IAAAA,EACAlnJ,EAAAw2B,KAAAh2B,EAAAg2B,KAEAx2B,kUClOA,aAEA,MAAAq2O,EAAAvpT,EAAA,YACA84N,EAAA94N,EAAA,QAAAA,CAAA,mBACA4sR,SAAAA,GAAA5sR,EAAA,wBACA23Z,EAAA33Z,EAAA,uBACAijZ,EAAAjjZ,EAAA,8BACA00Z,EAAA10Z,EAAA,2BACAy0Z,EAAAz0Z,EAAA,uBACAmsW,EAAAnsW,EAAA,oBACA43Z,EAAA53Z,EAAA,yBACAg3L,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IACA4tG,EAAAvpU,EAAA,2CAyBA00J,EAAA,CACAoiQ,SAAA,EACA3tF,QAAA,WACAqkC,WAAA,EACAgqC,oBAAA,IACArqN,OAAA,GAMArtL,EAAAC,QAAAk2E,GAuFAszP,GAnFAxpL,eAAA3gJ,EAAAgC,EAAA,IAEA,MAAAosK,EAAAwpB,EAAAtiC,EAAAtzJ,GAEA,IAAAhC,EACA,MAAA,IAAAmmG,MAAA,0BAKA,GAAA,OAFAnmG,EAAAA,EAAA6kF,QAEA,CACA,GAAAupF,EAAAspP,QACA,OAGA,MAAAvtG,EAAA,IAAAhkN,MAAA,+CAAA,oBAGA,GAAA,MAAAnmG,EAAAmpG,UAAA,EAAA,GACA,MAAAghN,EAAA,IAAAhkN,MAAA,yCAAA,oBAGAuzH,EAAA,YAAA15N,KAEA,MAAA0rZ,EAAA7H,EAAA7jZ,GAEA,GAAA,SAAA0rZ,EAAA,GACA,MAAAvhG,EAAA,IAAAhkN,MAAA,sCAAA,oBAGA,MAAArY,QAAA0qU,EAAA3hV,EAAAu3F,GACA,IAAAt6F,EACA,MAAAymF,EAAA,GACAk+P,QAAAF,EAAA1hV,EAAA,YAAAu3F,GAGA,IAAA,IAAA55F,EAAA,EAAAA,GAAAk3U,EAAAp5U,OAAAkC,IAAA,CACA,MAAAkkV,EAAAhN,EAAAj5U,MAAA,EAAA+B,GACAs5U,EAAA,SAAAhgU,KAAA4qU,EAAA/gV,KAAA,OAEA,IAGA,GAFA7D,QAAA05M,EAAAsgI,EAAAj3U,EAAA6wP,MAEA,SAAA5zP,EAAAK,MAAA,cAAAL,EAAAK,KACA,MAAAg2O,EAAA,IAAAhkN,MAAA,GAAAnmG,2BAAA,kBAGA,GAAAw0E,IAAAk3U,EAAAp5U,OAAA,CACA,GAAA87F,EAAAspP,QACA,OAGA,MAAAvtG,EAAA,IAAAhkN,MAAA,uBAAA,sBAGAo0D,EAAApiF,KAAA,CACAj4E,KAAA4zE,EAAA5zE,KACA86N,IAAAlnJ,EAAAknJ,MAEA,MAAAl0H,GACA,GAAA,kBAAAA,EAAApkG,KAQA,MAAAokG,EAPA,GAAAtyB,EAAAk3U,EAAAp5U,SAAA87F,EAAAspP,QACA,MAAAvtG,EAAA,IAAAhkN,MAAA,+BAAA2nT,kDAAA,uBAIAjkF,EAAAhzP,EAAA6hV,EAAAA,EAAApmV,OAAA,GAAAmmV,EAAAl+P,EAAAA,EAAAjoF,OAAA,GAAAioF,EAAA6T,IAWA,MAAA8nP,QAAAb,EAAAx+U,EAAA0jF,EAAA6T,SAGAknP,EAAAz+U,EAAAq/U,EAAA9nP,MAcA,MAAAy7J,EAAAlpL,MAAA9pE,EAAAwhV,EAAAI,EAAA3kV,EAAAymF,EAAAv4J,KACA03N,EAAA,2BAAA2+L,QAAAvkV,EAAAknJ,OAEA,MAAA/iJ,QAAA80R,EAAAl2R,EAAA,CACA/C,OAAAA,EAAAQ,KACA0jS,UAAAlkS,EAAAknJ,IACA1wH,KAAAmuT,EAAAnkV,KAAAg2B,KACA0wH,IAAAy9L,EAAAz9L,IACA96N,KAAAm4Z,EACAtuF,QAAA/nU,EAAA+nU,QACAqkC,WAAApsW,EAAAosW,WACArgL,MAAA/rL,EAAA+rL,MACAqqN,oBAAAp2Y,EAAAo2Y,sBAGA79O,EAAAA,EAAAjoF,OAAA,GAAA0oJ,IAAA/iJ,EAAA+iJ,IAEAzgE,EAAApiF,KAAA,CACAj4E,KAAAm4Z,EACAr9L,IAAAy9L,EAAAz9L,4WCrKA,aAEA,MAAA6pG,OAAAA,GAAAjkU,EAAA,gBACAgkU,QACAA,GACAhkU,EAAA,eACA+jM,EAAA/jM,EAAA,cACAwkO,EAAAxkO,EAAA,sBAAA+6N,UAwCAj7N,EAAAC,QAtBAggJ,MAAA9pE,EAAA1C,EAAAnyE,KACA,MAAA+nU,EAAA3kG,EAAAp0H,MAAAhvG,EAAA+nU,SACA4sC,EAAA,IAAA9xC,EAAA,CACA1wP,KAAAA,EACA4T,KAAA/lF,EAAA+lF,KAEAijP,MAAAhpU,EAAAgpU,QAGA12P,EAAA,IAAAswP,EAAA+xC,EAAA7oF,WAOA,MAAA,CACA9yD,UAPAnkJ,EAAA6wP,KAAAhpG,IAAApqJ,EAAAqwH,EAAAwpK,OAAA,CACAC,WAAApsW,EAAAosW,WACArkC,QAAAA,EACAivE,UAAAh3Y,EAAA+rL,QAKAz5G,KAAAA,6HC3CA,aAEA,MAAA61O,EAAAvpT,EAAA,YACAy0Z,EAAAz0Z,EAAA,uBACA00Z,EAAA10Z,EAAA,2BACA+3Z,EAAA/3Z,EAAA,uBACA6zZ,EAAA7zZ,EAAA,uBACAw0Z,EAAAx0Z,EAAA,oBACAupU,EAAAvpU,EAAA,2CACAg3L,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IAmBAjnE,EAAA,CACA27M,WAAA,EACA7C,WAAA,EACArkC,QAAA,WACAh8I,OAAA,EACAqqN,oBAAA,KAMA13Y,EAAAC,QAAAk2E,GA+BAszP,GA3BAxpL,eAAAs7O,EAAA7tN,EAAA,IAEA,MAAApsK,EAAA41L,EAAAtiC,EAAA8Y,GAEAljE,MAAA/gB,QAAA8xS,KACAA,EAAA,CAAAA,IAGA,MAAArtR,QAAAwkE,QAAA2gD,IACAkoK,EAAAxkT,KAAAz3E,GAAAy0Z,EAAA59U,EAAA72E,EAAAgC,MAGA,IAAA4sG,EAAAt8B,OACA,MAAA63O,EAAA,IAAAhkN,MAAA,6CAAA,sBAGAyI,EAAAntG,SAAA2gF,IACA,GAAA,MAAAA,EAAApiF,KACA,MAAAmqT,EAAA,IAAAhkN,MAAA,sBAAA,yBAIA,IAAA,MAAA/jB,KAAAwsB,QACAgqT,EAAA/hV,EAAAuL,EAAApiF,KAAAgC,MAYA,MAAA42Z,EAAAj4Q,MAAA9pE,EAAA72E,EAAAgC,KACA,MAAA2yZ,QAAAF,EAAA59U,EAAA72E,EAAAgC,GACAu4J,QAAA66P,EAAAv+U,EAAA89U,EAAAA,SACA58U,EAAAwiF,EAAAA,EAAAjoF,OAAA,GACAioF,EAAAjvE,MACA,MAAAxX,EAAAymF,EAAAA,EAAAjoF,OAAA,GAEA,IAAAwB,EACA,MAAAq2O,EAAA,IAAAhkN,MAAA,GAAAnmG,oBAAA,iBAGA,GAAA,cAAA+3E,EAAA5D,OAAAnyE,EAAAivW,UACA,MAAA9mD,EAAA,IAAAhkN,MAAA,GAAAnmG,kDAAA,eAGA,MAAAg7N,IACAA,SACA29L,EAAA9hV,EAAA,CACAmhS,UAAAlkS,EAAAknJ,IACA96N,KAAA63E,EAAA73E,KACA6pU,QAAA/nU,EAAA+nU,QACAqkC,WAAApsW,EAAAosW,WACArgL,MAAA/rL,EAAA+rL,MACAqqN,oBAAAp2Y,EAAAo2Y,sBAGAtkU,EAAAknJ,IAAAA,EAGA,MAAAk7L,QAAAb,EAAAx+U,EAAA0jF,EAAAv4J,SAGAszZ,EAAAz+U,EAAAq/U,EAAAl0Z,qRC9GA,aAEA,MAAAupW,QACAA,GACA3qW,EAAA,eACAg7N,EAAAh7N,EAAA,QACA84N,EAAA94N,EAAA,QAAAA,CAAA,oCACAikU,OAAAA,GAAAjkU,EAAA,gBACAy2Z,aACAA,EAAAhB,oBACAA,GACAz1Z,EAAA,gBACAupT,EAAAvpT,EAAA,YACA+jM,EAAA/jM,EAAA,cACAwkO,EAAAxkO,EAAA,sBAAA+6N,UA0EAk9L,EAAAl4Q,MAAA9pE,EAAA70E,KACA,MAAA+nU,EAAA3kG,EAAAp0H,MAAAhvG,EAAA+nU,SAEA/nU,EAAA8xE,OAAAk5R,OAAAhrW,EAAA9B,MACA,MAAA86N,QAAAnkJ,EAAA6wP,KAAAhpG,IAAA18N,EAAA8xE,OAAA6wH,EAAAwpK,OAAA,CACAC,WAAApsW,EAAAosW,WACArkC,QAAAA,IAKA,OAFArwG,EAAA,6BAAAsB,KAEA,CACA1mJ,KAAAtyE,EAAA8xE,OACAknJ,IAAAA,IAQA89L,EAAAn4Q,MAAA9pE,EAAA70E,KACA,MAAA0qZ,WACAA,EAAA1sZ,KAAAA,SACAq3Z,EAAAxgV,EAAA70E,EAAA9B,KAAA8B,EAAA8xE,cAEA44U,EAAAqM,IAAA/2Z,EAAA9B,MAEA,MAAAo0E,KACAA,SACA0kV,EAAAniV,EAAA72E,EAAAgC,EAAA9B,KAAA8B,GAEA,OAAAq0Z,EAAAx/U,EAAAvC,EAAAq3R,MAAA+gD,EAAA1qZ,IAUAg3Z,EAAAr4Q,MAAA9pE,EAAAoiV,EAAA/4Z,EAAA8B,KACA,MAAAonF,EAAA6vU,EAAA3tU,MAEA,IAAAlC,EACA,MAAA+gO,EAAA,IAAAhkN,MAAA,yBAAA,kBAGA,MAAA8+S,OACAA,EAAAjtT,OACAA,EAAA1jB,KACAA,GACA8U,EAEA,IAAA9U,EACA,MAAA61O,EAAA,IAAAhkN,MAAA,yBAAA,kBAGA,MAAAlf,EAAA3S,EAAAq3R,MACAngR,MAAAvE,GAAAA,EAAAi8Q,KAAA/5P,UAAA,EAAA,KAAAnR,IAEA,IAAA/Q,EACA,MAAAkjO,EAAA,IAAAhkN,MAAA,6BAAAnO,cAAA93F,KAAA,iBAGA,GAAA+mF,EAAAi8Q,OAAA,GAAAlrQ,IAAA93F,IAOA,OANAw5N,EAAA,0BAAAzyI,EAAAi8Q,QAEA5uR,EAAA04R,OAAA/lR,EAAAi8Q,YAEA+hD,EAAA8T,IAAA74Z,GAEAm2Z,EAAAx/U,EAAAvC,EAAAq3R,MAAAs5C,EAAAjjZ,GAGA03N,EAAA,6BAAAzyI,EAAAi8Q,YAAAlrQ,IAAA93F,KAEA,MAAA+3E,QAAA+gV,EAAAniV,EAAAoiV,EAAA/4Z,EAAA8B,GAEA,IAAAg5N,EAAA/iJ,EAAA+iJ,IACA1wH,EAAAryB,EAAAqyB,KACA4uT,EAAAlhU,EAEA,GAAA,IAAA/f,EAAA3D,KAAAq3R,MAAAr5R,OAAA,CACAonJ,EAAA,yBAAA1hI,KAGA,MAAA/Q,EAAAhP,EAAA3D,KAAAq3R,MAAA,GAEAutD,EAAA,GAAAlhU,IAAA/Q,EAAAi8Q,KAAA/5P,UAAA,KACA6xH,EAAA/zI,EAAAy5N,KACAp2M,EAAArjB,EAAAolR,MAKA,OAFA3yI,EAAA,kBAAA1hI,eAAAkhU,KAEAC,EAAAtiV,EAAAouU,EAAA3wU,EAAA0jB,EAAAkhU,EAAA5uT,EAAA0wH,EAAAh5N,IAaAm3Z,EAAA,CAAAtiV,EAAAouU,EAAAnxU,EAAA4xI,EAAAwzM,EAAA5uT,EAAA0wH,EAAAh5N,KACA8xE,EAAAk5R,OAAAtnJ,GACA5xI,EAAAi5R,QAAA,IAAAxB,EAAA2tD,EAAA5uT,EAAA0wH,IAEAq7L,EAAAx/U,EAAA/C,EAAA63R,MAAAs5C,EAAAjjZ,IAGAtB,EAAAC,QAhKAggJ,MAAA9pE,EAAA70E,KACA,IAAA8xE,EAAA9xE,EAAA8xE,OAEA,GAAA9xE,EAAAg2W,UAAA,CACA,IAAAp8I,EAAAsM,MAAAlmO,EAAAg2W,WACA,MAAA7tD,EAAA,IAAAhkN,MAAA,oCAAA,qBAGAuzH,EAAA,uBAAA13N,EAAAg2W,aACAlkS,QAAA+C,EAAA6wP,KAAA74O,IAAA7sF,EAAAg2W,WAGA,IAAAlkS,EACA,MAAAq2O,EAAA,IAAAhkN,MAAA,8CAAA,kBAGA,IAAAnkG,EAAA9B,KACA,MAAAiqT,EAAA,IAAAhkN,MAAA,sCAAA,qBAKA,MAAA,2BAFA0+N,EAAA85D,UAAA7qT,EAAAk5K,MAEA74K,MACAulJ,EAAA,YAAA13N,EAAA9B,+BAEA44Z,EAAAjiV,EAAA,IACA70E,EACA8xE,OAAAA,MAIA4lJ,EAAA,iBAAA13N,EAAA9B,0BAEA24Z,EAAAhiV,EAAA,IACA70E,EACA8xE,OAAAA,oMChFA,aAEA,MAAAy7T,EAAA3uY,EAAA,UACAupU,EAAAvpU,EAAA,2CACAg3L,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IAYAjnE,EAAA,GAKA50J,EAAAC,QAAAk2E,GAaAszP,GATAxpL,eAAA3gJ,EAAAgC,EAAA,IAEAA,EAAA41L,EAAAtiC,EAAAtzJ,GAEA,MAAAg5N,IAAAA,SAAAu0K,EAAA14T,EAAA04T,CAAAvvY,EAAAgC,GAEA,OAAAg5N,6HC/BA,aAEA,MAAAznJ,EAAA3yE,EAAA,QACAy1W,EAAAz1W,EAAA,QACAg3L,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IACA4tG,EAAAvpU,EAAA,2CAmBA00J,EAAA,CACAoiQ,SAAA,EACA3pO,OAAA,EACAqgL,WAAA,EACArkC,QAAA,WACAquE,oBAAA,KAMA13Y,EAAAC,QAAAk2E,GAeAszP,GAXAxpL,eAAAmW,EAAA+gC,EAAA71L,EAAA,IAEA,MAAAosK,EAAAwpB,EAAAtiC,EAAAtzJ,SAEAuxE,EAAAsD,EAAAtD,CAAAujF,EAAA+gC,EAAAzpB,SACAioM,EAAAx/R,EAAAw/R,CAAAv/M,EAAA,IACAsX,EACA6iM,WAAA,4IC9CA,aAEA,MAAAr5K,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IACAk4L,EAAA7zZ,EAAA,uBACA84N,EAAA94N,EAAA,QAAAA,CAAA,kBACAupT,EAAAvpT,EAAA,aACAikU,OAAAA,GAAAjkU,EAAA,eACAw0Z,EAAAx0Z,EAAA,oBACAmsW,EAAAnsW,EAAA,oBACAy0Z,EAAAz0Z,EAAA,uBACA00Z,EAAA10Z,EAAA,4BACAgkU,QAAAA,GAAAhkU,EAAA,eACA+jM,EAAA/jM,EAAA,cACAwkO,EAAAxkO,EAAA,sBAAA+6N,UACAwuG,EAAAvpU,EAAA,2CAoBA00J,EAAA,CACAy4B,OAAA,EACAqqN,oBAAA,IACAhqC,WAAA,EACArkC,QAAA,YAMArpU,EAAAC,QAAAk2E,GAkFAszP,GA9EAxpL,eAAA3gJ,EAAAgC,EAAA,IAEA,MAAAo3Z,EAAAxhO,EAAAtiC,EAAAtzJ,GACAo3Z,EAAApuF,MAAAouF,EAAApuF,OAAA,IAAA5/N,KAEAsuH,EAAA,YAAA15N,YAAAo5Z,EAAApuF,SAEA,MAAAhwG,IACAA,EAAAm6L,aACAA,EAAAj1Z,KACAA,EAAAqnZ,OACAA,SACAkN,EAAA59U,EAAA72E,EAAAo5Z,GAEA,IAAA9kV,EACA2hV,EAEA7nD,EAAAgrD,EAAAhrD,WAEA,GAAAm5C,EAYA,CACA,GAAA,WAAAvsL,EAAAgN,MACA,MAAAmiF,EAAA,IAAAhkN,MAAA,GAAAnmG,2BAAA,kBAGAouW,EAAApzI,EAAAjqH,QAEAz8B,QAAAuC,EAAA6wP,KAAA74O,IAAAmsI,GAEA,MAAA27I,EAAA9xC,EAAA85D,UAAArqT,EAAA04K,MAGA2pH,EAAA3rC,MAAAouF,EAAApuF,MAEA12P,EAAA,IAAAswP,EAAA+xC,EAAA7oF,UAAAx5M,EAAAq3R,OAEAsqD,QAAAp/U,EAAA6wP,KAAAhpG,IAAApqJ,EAAAqwH,EAAAwpK,OAAA,CACAC,WAAApzI,EAAAjqH,QACAg5N,QAAA3kG,EAAAp0H,MAAA,YACAgoS,UAAAogB,EAAArrO,YA/BA,CACA,MAAA4oL,EAAA,IAAA9xC,EAAA,CACA1wP,KAAA,OAEA62P,MAAAouF,EAAApuF,QAEA12P,EAAA,IAAAswP,EAAA+xC,EAAA7oF,WACAmoI,QAAAp/U,EAAA6wP,KAAAhpG,IAAApqJ,EAAAqwH,EAAAwpK,OAAA,CACAC,WAAAgrD,EAAAhrD,WACArkC,QAAA3kG,EAAAp0H,MAAA,YACAgoS,UAAAogB,EAAArrO,QAyBA,MAAAxzB,QAAA66P,EAAAv+U,EAAAs+U,GACArhV,EAAAymF,EAAAA,EAAAjoF,OAAA,GACAs+F,QAAA/5F,EAAA6wP,KAAA74O,IAAA/a,EAAAknJ,KAEA/iJ,QAAA80R,EAAAl2R,EAAA,CACA/C,OAAA88F,EACA1wK,KAAAA,EACA86N,IAAAi7L,EACA3rT,KAAAh2B,EAAA23R,YAAA35R,OACAy7G,MAAAqrO,EAAArrO,MACAqqN,oBAAAghB,EAAAhhB,oBACAruE,QAAA,WACAqkC,WAAAA,IAGAt6R,EAAAknJ,IAAA/iJ,EAAA+iJ,IAGA,MAAAk7L,QAAAb,EAAAx+U,EAAA0jF,EAAA6+P,SAGA9D,EAAAz+U,EAAAq/U,EAAAkD,8XC3HA,aAEA,MAAA1/L,EAAA94N,EAAA,QAAAA,CAAA,mBACA2rP,SAAAA,GAAA3rP,EAAA,wBACA2uY,EAAA3uY,EAAA,UACAgxZ,EAAAhxZ,EAAA,WACAmsW,EAAAnsW,EAAA,oBACAg3L,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IACAi1L,EAAA5wZ,EAAA,uBACAy4Z,EAAAz4Z,EAAA,6BACA6zZ,EAAA7zZ,EAAA,uBACAijZ,EAAAjjZ,EAAA,8BACAw0Z,EAAAx0Z,EAAA,oBACAy0Z,EAAAz0Z,EAAA,uBACA00Z,EAAA10Z,EAAA,2BACAupT,EAAAvpT,EAAA,aACA0pU,mBACAA,GACA1pU,EAAA,eACAwoF,EAAAxoF,EAAA,WACAupU,EAAAvpU,EAAA,4CACAiuW,UACAA,EAAAC,WACAA,GACAluW,EAAA,eAiCA00J,EAAA,CACAljF,OAAA,EACAE,OAAAonC,EAAAA,EACAn4G,QAAA,EACAihQ,UAAA,EACAk2I,WAAA,EACAD,wBAAA,EACArqC,WAAA,EACArkC,QAAA,WACA2tF,SAAA,EACAxgB,SAAA,CAAAlxK,EAAAhmO,OACAq4Y,SAAA,UACAtqN,OAAA,EACAyqN,SAAA,MACAJ,oBAAA,KAMA13Y,EAAAC,QAAAk2E,GA+CAszP,GA3CAxpL,eAAA3gJ,EAAAo0E,EAAAg6F,EAAA,IAEA,MAAApsK,EAAA41L,EAAAtiC,EAAA8Y,GAGA,IAAAhsF,EAEAu1U,EAEA7jV,EASA,GARA4lJ,EAAA,gDACA83L,IAAAv6C,UAAAt2N,UACAv+D,QAAAi3U,EAAAjlV,GACAujV,QAAAlD,EAAA59U,EAAA72E,EAAAgC,GACA8xE,QAAA2gV,EAAA59U,EAAA8gV,EAAAxC,aAAAnzZ,KAHAwvZ,GAKA93L,EAAA,wCAEA13N,EAAA01Z,UAAA5jV,EAAAyzU,OACA,MAAAp9F,EAAA,IAAAhkN,MAAA,4BAAA,gBAIA,GAAA,MAAA/jB,EACA,MAAA+nO,EAAA,IAAAhkN,MAAA,2BAAA,iBAIA,GAAA,MAAAwxT,EACA,MAAAxtG,EAAA,IAAAhkN,MAAA,gCAAA,sBAGA,IAAAnkG,EAAAT,SAAAo2Z,EAAApQ,OACA,MAAAp9F,EAAA,IAAAhkN,MAAA,uBAAA,gBAGA,GAAA,SAAAwxT,EAAAzC,UACA,MAAA/qG,EAAA,IAAAhkN,MAAA,cAAA,kBAGA,OAAAmzT,EAAAziV,EAAA72E,EAAAoiF,EAAAu1U,EAAA31Z,MAaA,MAAAs3Z,EAAA34Q,MAAA9pE,EAAA72E,EAAAoiF,EAAAu1U,EAAA31Z,KACA,MAAA+1E,QAAAi6K,EAAAn7K,EAAAuL,EAAAu1U,EAAA31Z,SAIAwvZ,IAAA9e,WAAA/xP,UACA,MAAA+qQ,EAAA7H,EAAA7jZ,GACAs3Z,EAAA5L,EAAApgU,MAEA,GAAA,MAAAgsU,EACA,MAAAntG,EAAA,IAAAhkN,MAAA,yBAAA,gBAGA,IAAAozT,GAAA,EAEA,UACAhqB,EAAA14T,EAAA04T,CAAA,IAAAmc,EAAA/zU,KAAA,OAAA31E,GACAu3Z,GAAA,EACA,MAAAzyT,GACA,GAAA,kBAAAA,EAAApkG,KACA,MAAAokG,EAIAyyT,SACA3H,EAAA/6U,EAAA+6U,CAAA,IAAAlG,EAAA/zU,KAAA,OAAA31E,GAIA,MAAAw3Z,QAAA/E,EAAA59U,EAAA72E,EAAAgC,GACAu4J,QAAA66P,EAAAv+U,EAAA2iV,EAAArE,cACArhV,EAAAymF,EAAAA,EAAAjoF,OAAA,GAEA,IAAAwB,EACA,MAAAq2O,EAAA,IAAAhkN,MAAA,4BAAA,gBAGA,IAAAryB,EAAAK,OAAAL,EAAAK,KAAA2H,SAAA,aACA,MAAAquO,EAAA,IAAAhkN,MAAA,mBAAAryB,EAAA5zE,yBAAA,uBAGA,MAAA0wK,QAAA/5F,EAAA6wP,KAAA74O,IAAA/a,EAAAknJ,KAEA/iJ,QAAA80R,EAAAl2R,EAAA,CACA/C,OAAA88F,EACA1wK,KAAAo3Z,EACAt8L,IAAAjjJ,EAAAijJ,IACA1wH,KAAAvyB,EAAAuyB,KACAyjF,MAAA/rL,EAAA+rL,MACAqqN,oBAAAp2Y,EAAAo2Y,oBACAruE,QAAA/nU,EAAA+nU,QACAqkC,WAAApsW,EAAAosW,aAGAt6R,EAAAknJ,IAAA/iJ,EAAA+iJ,IAGA,MAAAk7L,QAAAb,EAAAx+U,EAAA0jF,EAAAv4J,SAGAszZ,EAAAz+U,EAAAq/U,EAAAl0Z,KAvDAwvZ,IAiEAx/J,EAAArxG,MAAA9pE,EAAAuL,EAAAu1U,EAAA31Z,KACA21Z,EAAApQ,OACA7tL,EAAA,oBAAAi+L,EAAA38L,cAAAh5N,EAAAowE,iBAAApwE,EAAAswE,UAEAonJ,EAAA,uBAAA13N,EAAAowE,iBAAApwE,EAAAswE,UAIA,MAAAs8B,EAAA,GAGA,GAAA5sG,EAAAowE,OAAA,EACA,GAAAulV,EAAA7sF,QAYA,GAXApxG,EAAA,iBAAA13N,EAAAowE,iCAEAw8B,EAAAz2B,MACA,IACAw/U,EAAAvjV,QAAA,CACAhC,OAAA,EACAE,OAAAtwE,EAAAowE,WAKAulV,EAAA7sF,OAAAC,WAAA/oU,EAAAowE,OAAA,CACA,MAAA83D,EAAAloI,EAAAowE,OAAAulV,EAAA7sF,OAAAC,WAEArxG,EAAA,2BAAAxvF,WACAt7B,EAAAz2B,KACAshV,EAAAvvR,UAIAwvF,EAAA,2BAAA13N,EAAAowE,gBACAw8B,EAAAz2B,KACAshV,EAAAz3Z,EAAAowE,SAKAw8B,EAAAz2B,KACAuhV,EAAAt3U,EAAApgF,EAAAswE,SAGA,MAAA8B,EAAAulV,EAAAC,EAAAhrT,IAAAirT,IACA,GAAAlC,EAAA7sF,SAAA9oU,EAAAwgQ,SAAA,CAGA,MAAAuoE,EAAA4sF,EAAA7sF,OAAAC,WAEA,GAAAA,EAAA8uF,EAGA,OAFAngM,EAAA,gBAAAqxG,EAAA8uF,QAAA9uF,iDAAA8uF,KAEAlC,EAAAvjV,QAAA,CACAhC,OAAAynV,IAGAngM,EAAA,6CAIA,MAAA,CACAx1N,CAAAX,OAAAy6N,eAAAr9E,wBAKA,IAAA54D,EASAijP,OAPAjoU,IAAAf,EAAA+lF,MAAA,OAAA/lF,EAAA+lF,KACAA,EAAA8mR,EAAA7sW,EAAA+lF,MACA4vU,GAAAA,EAAA7sF,SACA/iP,EAAA4vU,EAAA7sF,OAAA/iP,MAMA,MAAA/lF,EAAAgpU,MACAA,EAAA8jC,EAAA9sW,EAAAgpU,OACA2sF,GAAAA,EAAA7sF,SACAE,EAAA2sF,EAAA7sF,OAAAE,OAGA,MAAA/yP,QAAAmR,EAAAmjK,EAAA,CAAA,CACAn4K,QAAAA,EAGA2T,KAAAA,EACAijP,MAAAA,IACAn0P,EAAAgkF,MAAA,CACAq8O,SAAAl1Y,EAAAk1Y,SACAntE,QAAA/nU,EAAA+nU,QACAqkC,WAAApsW,EAAAosW,WACAiqC,SAAAr2Y,EAAAq2Y,SACAK,UAAA12Y,EAAA02Y,UACAD,uBAAAz2Y,EAAAy2Y,uBACAD,SAAAx2Y,EAAAw2Y,SACAxwE,KAAA,KAGA,IAAA/vP,EACA,MAAAkyO,EAAA,IAAAhkN,MAAA,mBAAAryB,OAAA5zE,QAAA,uBAKA,OAFAw5N,EAAA,SAAAzhJ,EAAA+iJ,OAEA,CACAA,IAAA/iJ,EAAA+iJ,IACA1wH,KAAAryB,EAAAqyB,OAQAovT,EAAA,CAAA77L,EAAAukG,IACAzhL,kBACA,IAAA4lC,EAAA,EAEA,UAAA,MAAAq3C,KAAAC,EAAA,CAGA,GAFAt3C,GAAAq3C,EAAAtrJ,OAEAi0G,EAAA67I,EAGA,kBAFAxkG,EAAAnrJ,MAAA,EAAA2vP,EAAA77I,UAKAq3C,IASA67L,EAAA,CAAA7oU,EAAAq4L,EAAAqhD,KACA,MAAA1sG,EAAA,IAAAkI,WAAAmjD,GAQA,OAAAywI,EANA/4Q,kBACA,aACAi9E,EAAAnrJ,QAIAqnV,GAAAlpU,IAMAgpU,EAAAj5Q,gBAAA/xC,GACA,IAAA,IAAAp6B,EAAA,EAAAA,EAAAo6B,EAAAt8B,OAAAkC,UACAo6B,EAAAp6B,MAQAmlV,EAAAh5Q,gBAAAv+D,EAAA23U,GACA,IAAAC,EAAA,EAEA,UAAA,MAAAp8L,KAAAx7I,EACA43U,GAAAp8L,EAAAtrJ,aAEAsrJ,EAGA,UAAA,MAAAA,KAAAm8L,EAAAC,GACAA,GAAAp8L,EAAAtrJ,aAEAsrJ,sgBC5XA,sCAEMusF,EAAUvpT,EAAQ,YAClB84N,EAAM94N,EAAQ,QAARA,CAAiB,wDAE3B0pU,GACE1pU,EAAQ,kBACN6kO,EAAuB7kO,EAAQ,2BAK/By4Z,EAAmBjlV,QAClBA,QACG+1O,EAAAA,IAAYhkN,MAAM,yCAA0C,wBAG7C,iBAAZ/xB,GAAwBA,aAAmBV,UACpDgmJ,EAAI,wBAEJtlJ,EAAUqxJ,EAAqBrxJ,EAAQq3B,aAGrCr3B,EAAQ9B,cACVonJ,EAAI,4BAGDn2N,OAAOy6N,eAAgB,kBAChB5pJ,OAKRA,EAAQ7wE,OAAOy6N,sBACjBtE,EAAI,iCACGtlJ,KAGLA,EAAQ7wE,OAAOu0J,iBACjB4hE,EAAI,2BACGtlJ,KAGLy4B,EAAO67J,MAAQt0L,aAAmBy4B,EAAO67J,KAAAA,CAE3ChvC,EAAI,iCAEA9mJ,EAAQ,QAENklF,EAAAA,CACJrtE,KAAM,IACA7X,EAAQwB,EAAQk2B,MAEhB6sE,MAAM,OAIC/D,SAAQ,CAACC,EAASu5B,WACrB9vF,EAAQ1oC,EAAQ3B,MAAMG,EAAO03P,GACnC13P,GAAS03P,QAEHnsG,EAAAA,IAAatxH,EAAOotT,WAKpBC,EAAc9gM,OAElB+E,EAAOzpD,oBAAoB,UAAWwlP,GAAY,GAE9C9gM,EAAGx8I,aACEgwH,EAAOwsB,EAAGx8I,OAGnBy2F,EAAAA,CACE8D,MAAM,EACNp2K,MAAAA,IAAW+kO,WAAsC3H,EAAOlmJ,WAK5DkmJ,EAAO5qD,iBAAiB,UAAW2mP,GACnC/7L,EAAOg8L,kBAAkBr9S,eAM5Bv5G,OAAOy6N,eAAgB,IACflmE,SAKPqyJ,EAAAA,IAAYhkN,MAAAA,6BAAmC/xB,4BAAmC,uBAG1F1zE,EAAOC,QAAU04Z,2HCjGjB,aAEA,MAAA7rI,SAAAA,GAAA5sR,EAAA,wBACAg3L,EAAAh3L,EAAA,iBAAAolG,KAAA,CAAAu2H,iBAAA,IACAk4L,EAAA7zZ,EAAA,uBACAupT,EAAAvpT,EAAA,YACAupU,EAAAvpU,EAAA,2CAcA00J,EAAA,CACAljF,OAAA,EACAE,OAAAonC,EAAAA,GAMAh5G,EAAAC,QAAAk2E,GA+BAszP,GA3BA,SAAAnqU,EAAAgC,EAAA,IAIA,OAFAA,EAAA41L,EAAAtiC,EAAAtzJ,GAEA,CACAkC,CAAAX,OAAAy6N,eAAAr9E,kBACA,MAAAg0Q,QAAAF,EAAA59U,EAAA72E,EAAAgC,GACAi2E,QAAAu1M,EAAAmnI,EAAAA,QAAA99U,EAAA6wP,MAEA,GAAA,SAAAzvP,EAAA9D,KACA,MAAAg2O,EAAA,IAAAhkN,MAAA,GAAAnmG,oBAAA,gBAGA,IAAAi4E,EAAA7D,QACA,MAAA+1O,EAAA,IAAAhkN,MAAA,sCAAAnmG,KAAA,kBAGA,UAAA,MAAA49N,KAAA3lJ,EAAA7D,QAAA,CACAhC,OAAApwE,EAAAowE,OACAE,OAAAtwE,EAAAswE,eAEAsrJ,4LCrDA,aAEA,MAAA4vD,SAAAA,GAAA5sR,EAAA,wBACA6zZ,EAAA7zZ,EAAA,uBACAupU,EAAAvpU,EAAA,2CACA62E,EAAA72E,EAAA,UAUAw5Z,EAAAjE,IAEA,MAAAhqL,EAAA,CACAnR,IAAAm7L,EAAAn7L,IACA96N,KAAAi2Z,EAAAj2Z,KACAi0E,KAAA,cAAAgiV,EAAAhiV,KAAA,YAAA,OACAm2B,KAAA6rT,EAAA7rT,MAQA,MALA,SAAA6rT,EAAAhiV,MAAA,cAAAgiV,EAAAhiV,OACAg4J,EAAApkJ,KAAAouU,EAAArrF,OAAA/iP,KACAokJ,EAAA6+F,MAAAmrF,EAAArrF,OAAAE,OAGA7+F,GAMAzrO,EAAAC,QAAAk2E,GAmBAszP,GAfAxpL,gBAAA3gJ,EAAAgC,EAAA,IACA,MAAA2yZ,QAAAF,EAAA59U,EAAA72E,EAAAgC,GACAm0Z,QAAA3oI,EAAAmnI,EAAAA,QAAA99U,EAAA6wP,MAGA,cAAAyuF,EAAAhiV,WAOAimV,EAAAjE,SANA1+U,EAAA0+U,EAAA/hV,QAAApyE,GAAAo4Z,mKC7CA,aAEA,MAAAC,EAAAz5Z,EAAA,YACA05Z,EAAA15Z,EAAA,SACA25Z,EAAA35Z,EAAA,YACA45Z,EAAA55Z,EAAA,UACAyvY,EAAAzvY,EAAA,UACA65Z,EAAA75Z,EAAA,YACAs1W,EAAAt1W,EAAA,QAqBAF,EAAAC,QAfA,MAKAuD,aAAAojU,SAAAA,IACAj6N,KAAAwnP,IAAAylE,EAAA,CAAAhzF,SAAAA,IACAj6N,KAAAtc,KAAAs/S,EAAA,CAAA/oE,SAAAA,IACAj6N,KAAAgpQ,GAAAH,EAAA,CAAA5uC,SAAAA,IACAj6N,KAAAqtT,OAAAD,EAAA,CAAAnzF,SAAAA,IACAj6N,KAAA4iH,OAAAoqM,EAAA,CAAA/yF,SAAAA,IACAj6N,KAAA4gJ,OAAAssK,EAAA,CAAAjzF,SAAAA,IACAj6N,KAAA09G,KAAAyvM,EAAA,CAAAlzF,SAAAA,6JC1BA,aAEA,MAAA6C,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA2mU,SAAAA,KAOA6C,GAHA,CAAAjqU,EAAAskO,IACA8iG,EAAAjlD,UAAAniR,EAAAskO,oFCbA,aAEA,MAAA2lG,EAAAvpU,EAAA,2CASAF,EAAAC,QAAA,EAAA2mU,SAAAA,KAQA6C,GAJA,CAAAjqU,EAAA8B,EAAA,CAAAmyE,KAXA,MAWAm2B,KAVA,QAWAg9N,EAAAhhB,UAAApmT,EAAA8B,EAAAmyE,MAZA,MAYAnyE,EAAAsoG,MAXA,uFCLA,aAEA,MAAA6/N,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA2mU,SAAAA,KAQA6C,GAJA,CAAAjqU,EAAAwsQ,EAAAloC,IACA8iG,EAAAv6C,UAAA7sR,EAAAwsQ,EAAAloC,kFCbA,aAEA,MAAA2lG,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA2mU,SAAAA,KAMA6C,GAFAjqU,GAAAonU,EAAAqzF,cAAAz6Z,oFCZA,aAEA,MAAAiqU,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA2mU,SAAAA,KAMA6C,GAFA,IAAA7C,EAAAq+D,0FCZA,aAEA,MAAAx7D,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA2mU,SAAAA,KAeA6C,GAXAxpL,MAAA+kE,EAAAwzM,KACA,MAAA72Z,QAAAilU,EAAAszF,UAAAl1M,EAAAwzM,GAEA,MAAA,CACA2B,IAAAn1M,EACA/yC,IAAAtwK,EAAAnC,KACAoxF,GAAAjvF,EAAAivF,GACAwpU,WAAA,mFCnBA,aAEA,MAAA3wF,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA2mU,SAAAA,KAMA6C,GAFAjqU,GAAAonU,EAAAyzF,UAAA76Z,oFCZA,aAEA,MAAA86Z,EAAAp6Z,EAAA,UACAoxY,EAAApxY,EAAA,SACAq6Z,EAAAr6Z,EAAA,WACAs6Z,EAAAt6Z,EAAA,SACAqxY,EAAArxY,EAAA,SACAuuY,EAAAvuY,EAAA,UACAu6Z,EAAAv6Z,EAAA,WA4BAF,EAAAC,QAlBA,MAOAuD,aAAAwjU,KAAAA,EAAAF,QAAAA,EAAAG,OAAAA,IACAt6N,KAAA0sD,KAAAihQ,EAAA,CAAAtzF,KAAAA,EAAAF,QAAAA,IACAn6N,KAAAxe,IAAAmjT,EAAA,CAAAtqE,KAAAA,EAAAF,QAAAA,IACAn6N,KAAA++P,MAAA6uD,EAAA,CAAAvzF,KAAAA,IACAr6N,KAAA+tT,IAAAF,EAAA,CAAAxzF,KAAAA,EAAAF,QAAAA,IACAn6N,KAAAqxH,IAAAuzK,EAAA,CAAAvqE,KAAAA,EAAAF,QAAAA,EAAAG,OAAAA,IACAt6N,KAAAkiS,KAAAJ,EAAA,CAAAznE,KAAAA,EAAAF,QAAAA,IACAn6N,KAAAy8E,MAAA,IAAAqxO,EAAA,CAAAzzF,KAAAA,EAAAF,QAAAA,EAAAG,OAAAA,yJChCA,aAEA,MAAAwC,EAAAvpU,EAAA,2CAOAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAF,QAAAA,MACA,MAAA34O,EAAAjuF,EAAA,QAAAA,CAAA,CAAA8mU,KAAAA,EAAAF,QAAAA,IAUA,OAAA2C,GALAxpL,eAAAg7E,EAAA35N,EAAA,IAEA,aADA6sF,EAAA8sI,EAAA35N,IACAgrP,wGCjBA,aAEA,MAAApxB,EAAAh7N,EAAA,QACAupT,EAAAvpT,EAAA,YACAupU,EAAAvpU,EAAA,2CAWAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAF,QAAAA,KAoBA2C,GAhBAxpL,eAAAg7E,EAAA35N,EAAA,IACA,IAAAg5N,EAEA,IACAA,EAAA,IAAAY,EAAAD,GACA,MAAA70H,GACA,MAAAqjN,EAAArjN,EAAA,mBAOA,OAJA,IAAA9kG,EAAAwlU,SACAA,EAAAxsG,GAGA0sG,EAAA74O,IAAAmsI,EAAA,CAAAkC,OAAAl7N,EAAAk7N,2HChCA,aAEA,MAAAquI,QACAA,GACA3qW,EAAA,eACAg7N,EAAAh7N,EAAA,QACAupU,EAAAvpU,EAAA,2CAOA,SAAAy6Z,EAAA/mV,EAAA83R,EAAA,IACA,IAAA,MAAA/pW,KAAAiyE,EAAA,CACA,MAAA0yB,EAAA1yB,EAAAjyE,GAEA,GAAA,MAAAA,GAAA,IAAAxB,OAAAW,KAAA8yE,GAAAhC,OACA,IACA85R,EAAAj0R,KAAA,IAAAozR,EAAA,GAAA,EAAA,IAAA3vI,EAAA50H,KACA,SACA,MAAAxe,IAKAozI,EAAAsM,MAAAlhI,GACAolQ,EAAAj0R,KAAA,IAAAozR,EAAA,GAAA,EAAAvkQ,KAIAkE,MAAA/gB,QAAA6c,IACAq0T,EAAAr0T,EAAAolQ,GAGAplQ,GAAA,iBAAAA,GACAq0T,EAAAr0T,EAAAolQ,IAIA,OAAAA,EAOA1rW,EAAAC,QAAA,EAAA+mU,KAAAA,KAuBAyC,GAnBAxpL,eAAAg7E,EAAA35N,EAAA,IACA,MAAAg5N,EAAA,IAAAY,EAAAD,GACA1jJ,QAAAyvP,EAAA74O,IAAAmsI,EAAAh5N,GAEA,GAAA,QAAAg5N,EAAAgN,MACA,MAAA,GAGA,GAAA,WAAAhN,EAAAgN,MACA,OAAA/vJ,EAAA0zR,MAGA,GAAA,aAAA3wI,EAAAgN,MACA,OAAAqzL,EAAApjV,GAGA,MAAA,IAAAkuB,MAAA,mCAAA60H,EAAAgN,8HCnEA,aAEA,MAAA48F,QACAA,GACAhkU,EAAA,eACA66N,EAAA76N,EAAA,cACAwkO,EAAAxkO,EAAA,sBAAA+6N,WACAkpG,OAAAA,GAAAjkU,EAAA,eACAupU,EAAAvpU,EAAA,2CAOAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAF,QAAAA,KAgCA2C,GA5BAxpL,eAAA3+I,EAAA,IACA,IAAA+3J,EAEA,GAAA/3J,EAAAD,SAAA,CACA,GAAA,eAAAC,EAAAD,SAGA,MAAA,IAAAokG,MAAA,oBAFA4zD,EAAA,IAAA8qK,EAAA,CAAA1wP,KAAA,cAAA25M,eAKA/zH,EAAA,IAAA+rE,WAAA,GAGA,MAAAxxJ,EAAA,IAAAswP,EAAA7qK,GAEAihE,QAAA0sG,EAAAhpG,IAAApqJ,EAAAmnJ,EAAA0yI,OAAA,CACAC,WAAA,EACArkC,QAAA3kG,EAAAp0H,MAAA,YACAksH,OAAAl7N,EAAAk7N,SAOA,OAJA,IAAAl7N,EAAAwlU,SACAA,EAAAxsG,GAGAA,gLC5CA,aAEA,MAAA4pG,QACAA,EAAA2mC,QACAA,EACAt+P,KAAAquT,GACA16Z,EAAA,eACAwkO,EAAAxkO,EAAA,sBAAA+6N,UACAF,EAAA76N,EAAA,cACAupU,EAAAvpU,EAAA,2CACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BAMA,SAAAu3W,EAAAv6I,EAAAgM,GACA,OAAAA,GACA,IAAA,OACA,OAWA,SAAAhM,GACA,IAAA7jE,EACAqyM,EAEA,IACA,MAAAr3P,EAAA7/B,KAAAoH,MAAAopJ,EAAA9H,IAGAwuI,GAAAr3P,EAAA42P,OAAA,IAAAl0R,KAAAwP,GACA,IAAAskR,EAEAtkR,EAAAi8Q,MAAAj8Q,EAAA/mF,KAEA+mF,EAAA8mR,MAAA9mR,EAAAqjB,KAEA86H,EAAAmD,cAAAthJ,EAAAy5N,MAAAz5N,EAAAy5B,MAAAz5B,EAAA00I,cAKA5hE,EAAA0rE,EAAA1wH,EAAAi4I,MACA,MAAAlmJ,GACA,MAAA,IAAAX,MAAA,yBAAAW,GAGA,OAAA,IAAA89N,EAAA7qK,EAAAqyM,GApCAmvD,CAAA39L,GACA,IAAA,WACA,OAwCA,SAAAA,GACA,OAAA09L,EAAA5vD,YAAA9tI,GAzCA49L,CAAA59L,GACA,QACA,MAAA,IAAAz3H,MAAA,qBAAAyjI,MAgDAlpO,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAC,OAAAA,EAAAH,QAAAA,KAyCA2C,GArCAxpL,eAAAz0C,EAAAlqG,EAAA,IACA,MAAA4nO,EAAA5nO,EAAAgoO,IACA,IAAA11J,EAEA,GAAA43B,aAAA45H,WAEAxxJ,EADAs1J,QACAuuI,EAAAjsQ,EAAA09H,GAEA,IAAAg7F,EAAA14N,QAEA,GAAAA,aAAA04N,EAEAtwP,EAAA43B,MACA,CAAA,GAAA,iBAAAA,EAGA,MAAA,IAAA/F,MAAA,sBAFA7xB,EAAA,IAAAswP,EAAA14N,EAAA8gJ,KAAA9gJ,EAAAy/P,OAKA,MAAAjrI,QAAAinG,EAAAsvC,WAEA,IACA,MAAAj8I,QAAA0sG,EAAAhpG,IAAApqJ,EAAAmnJ,EAAA0yI,OAAA,CACAC,WAAA,EACArkC,QAAA3kG,EAAAp0H,MAAA,cAOA,OAJA,IAAAhvG,EAAAwlU,SACAA,EAAAxsG,GAGAA,EACA,QACA0F,+NC7GA,aAEA,MAAA+6L,EAAA76Z,EAAA,eACAupU,EAAAvpU,EAAA,2CAOAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAF,QAAAA,MACA,MAAA34O,EAAAjuF,EAAA,QAAAA,CAAA,CAAA8mU,KAAAA,EAAAF,QAAAA,IAyBA,OAAA2C,GApBAxpL,eAAAg7E,EAAA35N,EAAA,IACA,MAAAsyE,QAAAua,EAAA8sI,EAAA35N,GACA05Z,EAAAD,EAAAxuT,KAAAg/P,UAAA33R,GACA0mJ,QAAAygM,EAAAxuT,KAAA+tH,IAAA0gM,EAAA,CACAttD,WAAA,IAGAt/F,EAAA4sJ,EAAAppV,OACAqpV,EAAArnV,EAAAq3R,MAAA54R,QAAA,CAAAmB,EAAAkiB,IAAAliB,EAAAkiB,EAAAi2Q,OAAA,GAEA,MAAA,CACA3rD,KAAA1lF,EAAAoM,sBACAw0L,SAAAtnV,EAAAq3R,MAAAr5R,OACAupV,UAAA/sJ,EACAgtJ,UAAAhtJ,EAAAx6L,EAAA04K,KAAA16K,OACAypV,SAAAznV,EAAA04K,KAAA16K,OACA0pV,eAAAltJ,EAAA6sJ,4HChCA,aAEA,MAAAM,EAAAr7Z,EAAA,cACAs7Z,EAAAt7Z,EAAA,iBACAu7Z,EAAAv7Z,EAAA,aACAw7Z,EAAAx7Z,EAAA,cAwBAF,EAAAC,QAdA,MAOAuD,aAAAwjU,KAAAA,EAAAF,QAAAA,EAAAG,OAAAA,IACAt6N,KAAA0/P,QAAAkvD,EAAA,CAAAv0F,KAAAA,EAAAF,QAAAA,EAAAG,OAAAA,IACAt6N,KAAAgvT,WAAAH,EAAA,CAAAx0F,KAAAA,EAAAF,QAAAA,EAAAG,OAAAA,IACAt6N,KAAA2/P,OAAAmvD,EAAA,CAAAz0F,KAAAA,EAAAF,QAAAA,EAAAG,OAAAA,IACAt6N,KAAAivT,QAAAF,EAAA,CAAA10F,KAAAA,EAAAF,QAAAA,EAAAG,OAAAA,yHC1BA,aAEA,MAAAwC,EAAAvpU,EAAA,2CAQAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAC,OAAAA,EAAAH,QAAAA,MACA,MAAA34O,EAAAjuF,EAAA,SAAAA,CAAA,CAAA8mU,KAAAA,EAAAF,QAAAA,IACA9oG,EAAA99N,EAAA,SAAAA,CAAA,CAAA8mU,KAAAA,EAAAC,OAAAA,EAAAH,QAAAA,IAWA,OAAA2C,GANAxpL,eAAAg7E,EAAA10I,EAAAjlF,EAAA,IACA,MAAAsyE,QAAAua,EAAA8sI,EAAA35N,GAEA,OADAsyE,EAAAy4R,QAAA9lR,GACAy3I,EAAApqJ,EAAAtyE,wHCpBA,aAEA,MAAA4iU,QAAAA,GAAAhkU,EAAA,eACAupU,EAAAvpU,EAAA,2CACAqoO,EAAAroO,EAAA,sBAQAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAC,OAAAA,EAAAH,QAAAA,MACA,MAAA34O,EAAAjuF,EAAA,SAAAA,CAAA,CAAA8mU,KAAAA,EAAAF,QAAAA,IACA9oG,EAAA99N,EAAA,SAAAA,CAAA,CAAA8mU,KAAAA,EAAAC,OAAAA,EAAAH,QAAAA,IAWA,OAAA2C,GANAxpL,eAAAg7E,EAAA5hE,EAAA/3J,EAAA,IACA,MAAAsyE,QAAAua,EAAA8sI,EAAA35N,GACAu6Z,EAAAtzL,EAAA,CAAA30J,EAAA04K,KAAAjzF,IACA,OAAA2kE,EAAA,IAAAkmG,EAAA23F,EAAAjoV,EAAAq3R,OAAA3pW,yKCtBA,aAEA,MAAAmoU,EAAAvpU,EAAA,2CAQAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAC,OAAAA,EAAAH,QAAAA,MACA,MAAA34O,EAAAjuF,EAAA,SAAAA,CAAA,CAAA8mU,KAAAA,EAAAF,QAAAA,IACA9oG,EAAA99N,EAAA,SAAAA,CAAA,CAAA8mU,KAAAA,EAAAC,OAAAA,EAAAH,QAAAA,IAYA,OAAA2C,GAPAxpL,eAAAg7E,EAAA6gM,EAAAx6Z,EAAA,IACA,MAAAsyE,QAAAua,EAAA8sI,EAAA35N,GAGA,OADAsyE,EAAA04R,OAAAwvD,EAAAt5D,MAAAs5D,EAAAt8Z,MAAAs8Z,GACA99L,EAAApqJ,EAAAtyE,sHCrBA,aAEA,MAAA4iU,QAAAA,GAAAhkU,EAAA,eACAupU,EAAAvpU,EAAA,2CAQAF,EAAAC,QAAA,EAAA+mU,KAAAA,EAAAC,OAAAA,EAAAH,QAAAA,MACA,MAAA34O,EAAAjuF,EAAA,SAAAA,CAAA,CAAA8mU,KAAAA,EAAAF,QAAAA,IACA9oG,EAAA99N,EAAA,SAAAA,CAAA,CAAA8mU,KAAAA,EAAAC,OAAAA,EAAAH,QAAAA,IAUA,OAAA2C,GALAxpL,eAAAg7E,EAAA5hE,EAAA/3J,EAAA,IACA,MAAAsyE,QAAAua,EAAA8sI,EAAA35N,GACA,OAAA08N,EAAA,IAAAkmG,EAAA7qK,EAAAzlF,EAAAq3R,OAAA3pW,4ICpBA,aAEA,MAAAy6Z,EAAA77Z,EAAA,QACAuuY,EAAAvuY,EAAA,UACA87Z,EAAA97Z,EAAA,aAgBAF,EAAAC,QAdA,MAQAuD,aAAAyjU,OAAAA,EAAAK,IAAAA,EAAAX,KAAAA,EAAA7pI,KAAAA,IACAnwF,KAAAsvT,GAAAF,EAAA,CAAA90F,OAAAA,EAAAK,IAAAA,EAAAxqI,KAAAA,EAAA6pI,KAAAA,IACAh6N,KAAAkiS,KAAAJ,EAAA,CAAA9nE,KAAAA,IACAh6N,KAAA0D,QAAA2rT,EAAA,CAAAr1F,KAAAA,uFCjBA,aAEA,MAAAzrG,EAAAh7N,EAAA,QACA84N,EAAA94N,EAAA,QAAAA,CAAA,iBACAypU,aAAAA,GAAAzpU,EAAA,eACAupU,EAAAvpU,EAAA,4CACA4xH,OAAAA,GAAA5xH,EAAA,uBACA28X,EAAA/qQ,EAAA4zO,gBAAA1jW,MACA4zY,cAAAA,EAAA9kT,UAAAA,EAAA/Z,IAAAA,GAAA72E,EAAA,uBACA46N,EAAA56N,EAAA,aAsBAF,EAAAC,QAAA,EAAAgnU,OAAAA,EAAAK,IAAAA,EAAAxqI,KAAAA,EAAA6pI,KAAAA,KAyBA8C,GArBAxpL,gBAAAquB,EAAA,IACA,MAAA3sF,EAAA+oB,KAAAunE,MACA+mD,EAAA,iCAEA,MAAAgH,QAAAinG,EAAA+qE,YAEA,IAEA,MAAAkqB,QAwBAj8Q,gBAAAqnL,IAAAA,EAAAxqI,KAAAA,EAAA6pI,KAAAA,IACA,MAAAw1F,EAAAplV,GAAA,EAAAujJ,IAAAA,KAAAA,GAAAgtG,EAAAjtG,MAEA+hM,EAAA,kBACA,IAAA13L,EACA,IACAA,QAAAiiG,EAAAv5O,KAAAe,IAAAw7O,GACA,MAAAvjO,GACA,GAAAA,EAAApkG,OAAA66X,EAEA,YADA7jK,EAAA,oBAGA,MAAA5yH,EAGA,MAAAqnS,EAAA,IAAAvyK,EAAAwJ,SACA+oK,EAEA,UAAA,MAAAl8M,IAAAA,KAAAuL,EAAA2wM,EAAA,CAAAl9B,WAAA,UACA,IAAAr1I,EAAA3pC,GAhBA,GAoBAk6C,EAAA,IAAAngJ,IACA,UAAA,MAAAgvI,KAAAs7K,EAAAumB,EAAAC,GACA3wL,EAAA9/I,IAAAmvI,EAAA7qH,OAAA,SAAAqqH,EAAAW,WAAAlwH,YAEA,OAAA0gI,EAnDA4wL,CAAA,CAAA/0F,IAAAA,EAAAxqI,KAAAA,EAAA6pI,KAAAA,IAEA21F,EAAA31F,EAAAl1D,OAAA60H,UAAA,UA4DArmP,iBAAA0mL,KAAAA,GAAAu1F,EAAAI,GAGA,IAAAC,EAAA,EACAC,EAAA,EAKA,MAAAC,EAAAx8Q,MAAAq6E,IACAiiM,IAEA,IACA,MAAAvmG,EAAAl7F,EAAA7qH,OAAA,SAAAqqH,EAAAW,WAAAlwH,WAEA,GAAAmxT,EAAAxwU,IAAAsqO,GACA,OAAA,KAGA,UACA2Q,EAAAl1D,OAAArhL,OAAAkqI,GACAkiM,IACA,MAAAp2T,GACA,MAAA,CACAA,IAAA,IAAAX,MAAA,mCAAA60H,MAAAl0H,EAAA9f,YAIA,MAAA,CAAAg0I,IAAAA,GACA,MAAAl0H,GACA,MAAAhqB,EAAA,+BAAAk+I,IAEA,OADAtB,EAAA58I,EAAAgqB,GACA,CAAAA,IAAA,IAAAX,MAAArpB,EAAA,KAAAgqB,EAAA9f,cAIA,UAAA,MAAA5N,KAAAoY,EAjIA,IAiIA2rU,EAAAH,GAEA5jV,UAAAA,GAGAsgJ,EAAA,kBAAAkjM,EAAAtyT,sCAAA2yT,qBACAC,aAnGAE,CAAA,CAAA/1F,KAAAA,GAAAu1F,EAAAI,GAEAtjM,EAAA,aAAAtuH,KAAAunE,MAAAtwF,QACA,QACAq+I,sNCpDA,aAEA,MAAAypG,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA0mU,KAAAA,KAgBA8C,GAZAxpL,eAAA3+I,EAAA,IACA,MAAA4mU,QAAAvB,EAAAkoE,OAEA,MAAA,CACA8tB,WAAAh0R,OAAAu/L,EAAAy0F,WAAA5xT,YACA6xT,SAAAj0R,OAAAu/L,EAAA00F,SAAA7xT,YACA8xT,SAAA30F,EAAA20F,SACAxsT,QAAA,GAAA63N,EAAA73N,UACAysT,WAAAn0R,OAAAu/L,EAAA40F,WAAA/xT,+FCpBA,aAEA,MAAAuiT,YAAAA,GAAAptZ,EAAA,aACAupU,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA0mU,KAAAA,KA2BA8C,GAvBAxpL,eAAA3+I,EAAA,IACA,UAEAqlU,EAAAo2F,kBAAAz7Z,GACA,MAAA8kG,GASA,GAPA,CACA,0CACA,SACA,+BACA7yB,MAAAsY,GACAA,EAAAzZ,KAAAg0B,EAAA9f,WAIA,OAAAgnU,EAEA,MAAAlnT,EAGA,OAAAugO,EAAAt2N,QAAAliB,4GCjCA,aAEA,MAAAwlH,EAAAzzM,EAAA,iBACA0wU,EAAA1wU,EAAA,SACA0rP,EAAA1rP,EAAA,YACA88Z,EAAA98Z,EAAA,wBACAolO,EAAAplO,EAAA,SACA+8Z,EAAA/8Z,EAAA,4BACA07N,EAAA17N,EAAA,iBACA6oO,EAAA7oO,EAAA,eACAg9Z,EAAAh9Z,EAAA,cACAmwG,EAAAnwG,EAAA,aACAgnF,EAAAhnF,EAAA,YACAi9Z,EAAAj9Z,EAAA,UACAk9Z,EAAAl9Z,EAAA,cACAm9Z,EAAAn9Z,EAAA,gBACAo9Z,EAAAp9Z,EAAA,aACA00J,EAAA10J,EAAA,qBACAq9Z,EAAAr9Z,EAAA,uBACAw+X,EAAAx+X,EAAA,YAEA84N,EAAA43G,EAAA,aAEA4sF,EAAA1qV,OAAA+6O,iBAIA4vG,EAAA,CACAte,OAAAj/Y,EAAA,iBACAw9Z,GAAAx9Z,EAAA,WAqYA+/I,eAAA09Q,EAAAzhC,GACA,IAAAp/P,EAAA6L,OAAA,GACA,UAAA,MAAAwxB,KAAA+hO,EAAA7mL,MAAA,IACAv4E,GAAA6L,OAAAwxB,EAAA95J,MAAA0qO,YACAjuG,GAAA6L,OAAAwxB,EAAAx4J,IAAAi8X,aAAA7yJ,YAEA,OAAAjuG,EAGA98H,EAAAC,QA7XA,MAKAuD,YAAAq5Z,EAAAv7Z,EAAA,IACA,GAAA,iBAAAu7Z,EACA,MAAA,IAAAp3T,MAAA,oBAGAkH,KAAArrG,QAAAs6N,EAAAhnE,EAAAtzJ,GACAqrG,KAAA81O,QAAA,EACA91O,KAAArtG,KAAAu9Z,EAKAlwT,KAAAixT,QAAAjxT,KAAAkxT,aACAlxT,KAAAvf,KAAA8vU,EAAAr8Z,OAAA,OAAA8rG,KAAArtG,KAAAqtG,KAAArrG,SACAqrG,KAAAuvR,UAAAghC,EAAAr8Z,OAAA,YAAAo8Z,EAAAtwT,KAAArtG,KAAA,aAAAqtG,KAAArrG,SACAqrG,KAAA7rG,KAAAo8Z,EAAAr8Z,OAAA,OAAAo8Z,EAAAtwT,KAAArtG,KAAA,QAAAqtG,KAAArrG,SACAqrG,KAAAuqQ,KAAAgmD,EAAAr8Z,OAAA,OAAAo8Z,EAAAtwT,KAAArtG,KAAA,QAAAqtG,KAAArrG,SACA,MAAAw8Z,EAAAZ,EAAAr8Z,OAAA,SAAAo8Z,EAAAtwT,KAAArtG,KAAA,UAAAqtG,KAAArrG,SACAy8Z,EAAAV,EAAAS,EAAAnxT,KAAArrG,QAAA08Z,sBAAAvsJ,QACA9kK,KAAA8kK,OAAA6rJ,EAAAS,GACApxT,KAAA0D,QAAAA,EAAA1D,KAAAvf,MACAuf,KAAAzlB,OAAAA,EAAAylB,KAAAvf,MACAuf,KAAAwwT,KAAAA,EAAAxwT,KAAAvf,MACAuf,KAAAywT,QAAAA,EAAAzwT,KAAAvf,MASA5pF,WAAA0jF,GAgWA,IAAA+2U,EA/VAjlM,EAAA,sBAAArsH,KAAArtG,YACAqtG,KAAAuxT,kBACAvxT,KAAAzlB,OAAArB,SA6VAo4U,EA7VA/2U,EA8VA+2U,EAAAE,UAAAh+Z,OAAAiqG,OAAA,GAAAmzT,EAAA5pN,EAAAsqN,EAAA,cAEAA,UA/VAtxT,KAAAwwT,KAAA/uU,IAqWA,SAAA6vU,GAEA,MAAAd,EAAA,IACAI,EAAAa,QACAzqN,EAAAsqN,EAAA,mBAGA,MAAA,CACAxqV,KAAA0pV,EAAA1pV,KACAu0T,OAAAm1B,EAAAn1B,OAAAjxT,KAAAsnV,IAAA,CACAn2B,WAAAm2B,EAAAn2B,WACAz0T,KAAA4qV,EAAAhnV,MAAA5D,KACAn0E,KAAA++Z,EAAAhnV,MAAA/3E,KACAg/Z,UAAAD,EAAAhnV,MAAAinV,eAlXAC,CAAAr3U,UACAylB,KAAA0D,QAAAjiB,IAAA26I,EAAAukL,aAQA9pZ,sBACA,IAAAmpG,KAAA81O,OAEA,OAAA,EAGA,IAOA,aAJA91O,KAAAuxT,kBACAvxT,KAAAowT,0BACApwT,KAAAvf,KAAAT,SAEA,EACA,MAAAyZ,GAEA,OAAA,GAUA5iG,aACA,IAAAmpG,KAAA81O,OACA,MAAA72F,EAAA,IAAAnmJ,MAAA,wBAAAi5R,EAAA8/B,uBAEAxlM,EAAA,iBAAArsH,KAAArtG,MAGA,UACAqtG,KAAAuxT,kBACAvxT,KAAAowT,oBACApwT,KAAA8xT,eAAA9xT,KAAA+xT,UAAA/xT,KAAArtG,MACA05N,EAAA,sBAIA,UAFArsH,KAAA0D,QAAAsuT,MAAA51L,EAAAukL,aAEA,CACA,UAAA3gT,KAAAiyT,0BAGA,MAAA,IAAAlgC,EAAAmgC,wBAAA,sGAFAlyT,KAAAmyT,SAAA/1L,EAAAukL,aAMAt0L,EAAA,4BACArsH,KAAAuvR,UAAAxvS,OAEAssI,EAAA,mBACArsH,KAAA8kK,OAAA/kL,OAEAssI,EAAA,2BACArsH,KAAA7rG,KAAA4rF,OAEAssI,EAAA,uBACArsH,KAAAuqQ,KAAAxqR,OAEAigB,KAAA81O,QAAA,EACAzpH,EAAA,cACA,MAAA5yH,GACA,GAAAuG,KAAA8xT,SACA,UACA9xT,KAAAoyT,aACApyT,KAAA8xT,SAAA,KACA,MAAAn8E,GACAtpH,EAAA,sBAAAspH,GAIA,MAAAl8O,GASA5iG,aACA,GAAA,iBAAAmpG,KAAArrG,QAAAg1W,KAAA,CACA,IAAAmnD,EAAA9wT,KAAArrG,QAAAg1W,MACA,MAAA,IAAA7wQ,MAAA,sBAAAkH,KAAArrG,QAAAg1W,MAEA,OAAAmnD,EAAA9wT,KAAArrG,QAAAg1W,MAGA,IAAA3pQ,KAAArrG,QAAAg1W,KACA,MAAA,IAAA7wQ,MAAA,oBAEA,OAAAkH,KAAArrG,QAAAg1W,KAQA9yW,kBACA,UACAmpG,KAAAvf,KAAAV,OACA,MAAA0Z,GACA,GAAA,iBAAAA,EAAA9f,QACA,MAAA8f,GAaA5iG,gBAAAlE,GACA,MAAAm/Z,QAAA9xT,KAAAixT,QAAAtnD,KAAAh3W,GAEA,GAAA,mBAAAm/Z,EAAA9xU,MACA,MAAAi/J,EAAA,IAAAnmJ,MAAA,kCAAA,yBAGA,OAAAg5T,EAQAj7Z,aACA,OAAAmpG,KAAA8xT,UAAA9xT,KAAA8xT,SAAA9xU,QAQAnpF,0BAEA,IAAA0jF,EADA8xI,EAAA,cAEA,KACA9xI,SAAAwrF,QAAA2gD,IAAA,CACA1mH,KAAAzlB,OAAA2/T,SACAl6S,KAAAwwT,KAAAtW,SACAl6S,KAAA0D,QAAAw2S,WAEA,MAAAzgT,GACA,GAAA,kBAAAA,EAAApkG,KACA,MAAA4pP,EAAA,IAAAnmJ,MAAA,+BAAAi5R,EAAAsgC,yBAAA,CACA1/Z,KAAAqtG,KAAArtG,OAIA,MAAA8mG,EAGA,IAAAlf,EACA,MAAA0kK,EAAA,IAAAnmJ,MAAA,+BAAAi5R,EAAAsgC,yBAAA,CACA1/Z,KAAAqtG,KAAArtG,OAUAkE,cACA,GAAAmpG,KAAA81O,OACA,MAAA72F,EAAA,IAAAnmJ,MAAA,0BAAAi5R,EAAAugC,yBAEAjmM,EAAA,iBAAArsH,KAAArtG,MAEA,UAEAqtG,KAAAywT,QAAAhtU,SACA,MAAAgW,GACA,GAAAA,EAAApkG,OAAA08X,EAAAsgC,2BAAA54T,EAAA9f,QAAAwC,WAAA,UACA,MAAAsd,QAIAssE,QAAA2gD,IAAA,CACA1mH,KAAAvf,KACAuf,KAAA8kK,OACA9kK,KAAA7rG,KACA6rG,KAAAuvR,UACAvvR,KAAAuqQ,MACAngS,KAAA6vT,GAAAA,GAAAA,EAAAj6S,WAEAqsI,EAAA,aACArsH,KAAA81O,QAAA,QACA91O,KAAAoyT,aAQAv7Z,SACA,OAAAmpG,KAAA0D,QAAAw2S,SAQArjZ,aACA,GAAAmpG,KAAAuvR,WAAAvvR,KAAA7rG,KAAA,CACA,MAAAg8Z,EAAArrJ,EAAAphK,EAAA6rR,EAAAp7X,SAAA4xK,QAAA2gD,IAAA,CACA1mH,KAAAuyT,kBACAvyT,KAAAwyT,aACAxyT,KAAA0D,QAAAliB,MACAwvU,EAAAhxT,KAAAuvR,WACAyhC,EAAAhxT,KAAA7rG,QAEA8oG,EAAA6nK,EAAA7nK,KAAAsyR,EAAAp7X,EAEA,MAAA,CACA+7Z,SAAAlwT,KAAArtG,KACAw9Z,WAAAA,EACAzsT,QAAAA,EACAssT,WAAAlrJ,EAAAvhL,MACA0sU,SAAAhzT,GAGA,MAAAgiJ,EAAA,IAAAnmJ,MAAA,+BAAAi5R,EAAAsgC,yBAAA,CACA1/Z,KAAAqtG,KAAArtG,OAOAkE,gCACA,QAAAnB,IAAAsqG,KAAArrG,QAAA89Z,YACA,OAAAzyT,KAAArrG,QAAA89Z,YAIA,IAAAC,EACA,IACAA,QAAA1yT,KAAAzlB,OAAAiH,IAnUA,mBAoUA,MAAAztF,GACA,GAAAA,EAAAsB,OAAA08X,EAAA4gC,cAAAt9Z,KAGA,MAAAtB,EAFA2+Z,GAAA,EAMA,OAAAA,EASA77Z,eAAA+7Z,GAGA,aAFA5yT,KAAA0D,QAAAliB,MAEAoxU,GACAvmM,EAAA,wBAAAumM,KACAvC,EAAAh3I,OAAAr5K,KAAArtG,KAAAqtG,KAAArrG,QAAAi+Z,EAAA,CACAC,YAAA,EACAC,WAAA9yT,KAAArrG,QAAAo+Z,wBAGA1mM,EAAA,wBAAAumM,KACAvC,EAAA2C,QAAAhzT,KAAArtG,KAAAqtG,KAAArrG,QAAAi+Z,EAAA,CACAC,YAAA,EACAC,WAAA9yT,KAAArrG,QAAAo+Z,uBAQAl8Z,wBACA,IACA,MAAA8uE,QAAAq6B,KAAAzlB,OAAAiH,IAAA,wBACA,OAAAw6C,OAAA28F,EAAAhzJ,IACA,MAAA8zB,GACA,OAAAuiC,OAAA60R,IAOAh6Z,mBACA,IAAA0sF,EAAAy4C,OAAA,GACA/+B,EAAA++B,OAAA,GAEA,GAAAh8B,KAAA8kK,OACA,UAAA,MAAAmuJ,KAAAjzT,KAAA8kK,OAAAp8D,MAAA,IAAA,CACA,MAAAl7C,EAAA,EACAjqE,GAAAy4C,OAAA,GACA/+B,GAAA++B,OAAAwxB,EAAAd,KAAA0xE,YACAnhI,GAAA++B,OAAAwxB,EAAAmgE,IAAAgL,MAAAyF,YAIA,MAAA,CAAA76I,MAAAA,EAAA0Z,KAAAA,KAiBA5pG,EAAAC,QAAAitR,MAAA,CAAAmwI,WAAAn9Z,EAAA,uBACAF,EAAAC,QAAAqtZ,YAAAvkL,EAAAukL,YACAttZ,EAAAC,QAAAy/H,OAAAg/P,sfC9aA1+X,EAAAC,QAgCA,SAAAurG,EAAAq0T,EAAA/yO,GACA,IAAAthF,EACA,OAAAshF,EAEA,IAAAx5G,EAAAgS,EACAklB,MAAA/gB,QAAAo2U,KACAvsV,EAAAusV,EAAA9tV,MAAA,IAEA,iBAAA8tV,IACAvsV,EAAAusV,EAAApzU,MAAA,MAEA,iBAAAozU,IACAvsV,EAAA,CAAAusV,IAEA,IAAAr1T,MAAA/gB,QAAAnW,GACA,MAAA,IAAAmyB,MAAA,oDAEA,KAAAnyB,EAAA1B,QAAA,CAEA,GADA0T,EAAAhS,EAAAg+B,SACA9F,EACA,OAAAshF,EAGA,QAAAzqL,KADAmpG,EAAAA,EAAAlmB,IAEA,OAAAwnG,EAGA,OAAAthF,iCC1DA,aAEA,MAAAs0T,EAAA5/Z,EAAA,iBACAotZ,EAAAptZ,EAAA,kBACA6/Z,EAAA7/Z,EAAA,eACAw/H,EAAAx/H,EAAA,YAEA84N,EAAA94N,EAAA,QAAAA,CAAA,sBAiBA,SAAA8/Z,EAAAC,GAGA,OAFAA,EAAAA,GAAAH,EAEAt1T,MAAA/gB,QAAAw2U,IAAA,IAAAA,EAAAruV,OAIAquV,EAAAA,EAAAruV,OAAA,GAAAy+B,QAHA,EA+NA,SAAA6vT,EAAAD,EAAAE,EAAAZ,EAAAa,GAAA,GACA,IAAAC,EAAA,EACA,IAAA,MAAAC,KAAAL,EAAA,CACA,GAAAK,EAAAjwT,QAAAkvT,EACA,MAGA,GAAAe,EAAAjwT,QAAA8vT,EAAA,CACA,GAAAC,IAAAE,EAAAt6I,OACA,MAAA,IAAAtmJ,EAAA6gS,4BAAA,2CAAAJ,+BAAAG,EAAAjwT,oDAGAgwT,KAIA,GAAAA,IAAAd,EAAAY,EACA,MAAA,IAAAzgS,EAAA8gS,kBAAA,wFAAAL,QAAAZ,KA7PAt/Z,EAAAwga,sBAAAnT,EAAAoT,WACAzga,EAAAy/H,OAAAA,EAkBAz/H,EAAA+/Z,0BAAAA,EAsGA//Z,EAAA0/Z,QArFA1/Q,eAAA3gJ,EAAAqha,EAAApB,GAAAC,WAAAA,GAAA,EAAAC,WAAAA,EAAAmB,SAAAA,GAAA,EAAAX,WAAAA,IAGA,GAFAA,EAAAA,GAAAH,GAEAxga,EACA,MAAA,IAAAogI,EAAAmhS,uBAAA,8BAGA,IAAAF,EACA,MAAA,IAAAjhS,EAAAmhS,uBAAA,qCAGA,IAAAtB,EACA,MAAA,IAAA7/R,EAAAmhS,uBAAA,mCAGA,IAAA/tV,OAAAs/K,UAAAmtK,IAAAA,GAAA,EACA,MAAA,IAAA7/R,EAAA8gS,kBAAA,uCAGA,MAAAM,QAAAxT,EAAAoT,WAAApha,EAAAqha,GAEA,GAAAG,IAAAvB,EAEA,YADAvmM,EAAA,uBAIA,GAAA8nM,EAAAvB,EACA,MAAA,IAAA7/R,EAAA8gS,kBAAA,2BAAAM,gCAAAvB,yCAKA,IAAAjpD,EAFA4pD,EAAAD,EAAAa,EAAAvB,GAIAqB,GAAApB,IACAlpD,QAAAypD,EAAAzpD,KAAAwqD,EAAAxha,EAAAqha,IAGA,IACA,IAAA,MAAAL,KAAAL,EAAA,CACA,QAAA59Z,IAAAk9Z,GAAAe,EAAAjwT,QAAAkvT,EACA,MAGA,KAAAe,EAAAjwT,SAAAywT,GAAA,CAIA9nM,EAAA,qBAAAsnM,EAAAjwT,WAEA,IACA,IAAAuwT,EAAA,CAEA,IAAAG,EAAA,OAEAtB,IACAsB,EAAA,CAAAC,EAAA16U,IAAAm5U,EAAAa,EAAAjwT,QAAA2wT,EAAAj6J,QAAA,GAAAzgL,UAGAg6U,EAAAX,QAAArga,EAAAqha,EAAAI,IAEA,MAAArga,GACA,MAAAuga,EAAAX,EAAAjwT,QAAA,EAKA,MAHA2oH,EAAA,4HAAAioM,WACA3T,EAAA4T,WAAA5ha,EAAA2ha,EAAAN,GAEA,IAAAl7T,MAAA,+BAAA66T,EAAAjwT,iCAAA3vG,EAAAyjH,OAAAzjH,EAAA4lF,SAAA5lF,KAGAs4N,EAAA,wBAAAsnM,EAAAjwT,qBAGAuwT,SACAtT,EAAA4T,WAAA5ha,EAAAiga,GAAAS,EAAAC,GAAAU,GAGA3nM,EAAA,kCAAA32N,IAAAk9Z,EAAA,cAAAA,KAAA,sBACA,QACAqB,GAAApB,IAAAlpD,SACAA,EAAA3pR,UA8GA1sF,EAAA+lR,OAxFA/lI,eAAA3gJ,EAAAqha,EAAApB,GAAAC,WAAAA,GAAA,EAAAC,WAAAA,EAAAmB,SAAAA,GAAA,EAAAX,WAAAA,IAGA,GAFAA,EAAAA,GAAAH,GAEAxga,EACA,MAAA,IAAAogI,EAAAmhS,uBAAA,8BAGA,IAAAF,EACA,MAAA,IAAAjhS,EAAAmhS,uBAAA,qCAGA,IAAAtB,EACA,MAAA,IAAA7/R,EAAAmhS,uBAAA,8EAGA,IAAA/tV,OAAAs/K,UAAAmtK,IAAAA,GAAA,EACA,MAAA,IAAA7/R,EAAA8gS,kBAAA,uCAGA,MAAAM,QAAAxT,EAAAoT,WAAApha,EAAAqha,GAEA,GAAAG,IAAAvB,EAEA,YADAvmM,EAAA,sBAIA,GAAA8nM,EAAAvB,EACA,MAAA,IAAA7/R,EAAA8gS,kBAAA,2BAAAM,+BAAAvB,0CAKA,IAAAjpD,EAFA4pD,EAAAD,EAAAV,EAAAuB,GAAA,GAGAF,GAAApB,IACAlpD,QAAAypD,EAAAzpD,KAAAwqD,EAAAxha,EAAAqha,IAGA3nM,EAAA,0BAAA8nM,QAAAvB,KAEA,IACA,MAAA4B,EAAAlB,EAAAluV,QAAA86I,UAEA,IAAA,MAAAyzM,KAAAa,EAAA,CACA,GAAAb,EAAAjwT,SAAAkvT,EACA,MAGA,KAAAe,EAAAjwT,QAAAywT,GAAA,CAIA9nM,EAAA,+BAAAsnM,EAAAjwT,WAEA,IACA,IAAAuwT,EAAA,CAEA,IAAAG,EAAA,OAEAtB,IACAsB,EAAA,CAAAC,EAAA16U,IAAAm5U,EAAAa,EAAAjwT,QAAA2wT,EAAAj6J,QAAA,GAAAzgL,UAGAg6U,EAAAt6I,OAAA1mR,EAAAqha,EAAAI,IAEA,MAAArga,GACA,MAAA0ga,EAAAd,EAAAjwT,QAKA,MAJA2oH,EAAA,4HAAAooM,WACA9T,EAAA4T,WAAA5ha,EAAA8ha,EAAAT,GAEAjga,EAAA4lF,QAAA,+BAAAg6U,EAAAjwT,iCAAA3vG,EAAA4lF,UACA5lF,EAGAs4N,EAAA,wBAAAsnM,EAAAjwT,qBAGAuwT,SACAtT,EAAA4T,WAAA5ha,EAAAiga,EAAAoB,GAGA3nM,EAAA,mDAAAumM,MACA,QACAqB,GAAApB,IAAAlpD,SACAA,EAAA3pR,6IC7OA,aAKA,MAAA00U,EAAA,CACA13P,YAAA,mBAEAg2P,QAAA,OAEA35I,OAAA,OACAxpJ,OAAA,GAGAx8H,EAAAC,QAAA,CACAE,OAAAiqG,OAAA,CAAAiG,QAAA,GAAAgxT,GACAlha,OAAAiqG,OAAA,CAAAiG,QAAA,GAAAgxT,GACAlha,OAAAiqG,OAAA,CAAAiG,QAAA,GAAAgxT,GACAlha,OAAAiqG,OAAA,CAAAiG,QAAA,GAAAgxT,GACAlha,OAAAiqG,OAAA,CAAAiG,QAAA,GAAAgxT,GACAlha,OAAAiqG,OAAA,CAAAiG,QAAA,GAAAgxT,GACAlha,OAAAiqG,OAAA,CAAAiG,QAAA,GAAAgxT,GACAnha,EAAA,iBACAA,EAAA,iBACAA,EAAA,yHCxBA,mBAEMg7N,EAAMh7N,EAAQ,QACdspU,EAAMtpU,EAAQ,uBAAuBspU,IACrC83F,EAAKpha,EAAQ,aACb84N,EAAM94N,EAAQ,QAARA,CAAiB,kCACvB8kO,EAAqB9kO,EAAQ,sCAC3Bqha,GAAgBrha,EAAQ,mBAC1B0xE,EAAS1xE,EAAQ,aASvB,SAAA02W,EAAyBj1W,SACjBu7N,EAAMokM,EAAGvwT,OAAAA,IAAWpvG,EAAIopG,WAAWh5B,MAAM,UAG3CkpJ,EAAAA,IAAgBC,EAAIgC,GAAKjC,UAG7BA,EAAYqmM,EAAGrxT,OAAO,SAAUgrH,GAAWlpJ,MAAM,SAG3CyvV,EAAex8L,EAAmB/J,GAAW54H,yBAExCmnO,EAAAA,IAAQg4F,KAAgB,GAMrC,SAAAC,EAAmB9/Z,SACXu7N,EAAMokM,EAAGvwT,OAAAA,IAAWpvG,EAAIopG,WAAWh5B,MAAM,MAGzCkpJ,EAAYqmM,EAAGrxT,OAAO,SAAA,IAAcirH,EAAI,EAAG,MAAOgC,GAAKoI,OAAOvzJ,MAAM,cAE/Dy3P,EAAAA,IAAQxkG,EAAmB/J,KAAa54H,eAAe,GASpE49C,eAAAw+C,EAAwBo+N,EAAU8D,EAAalB,EAAYiC,SACnDrE,EAAakE,EAAY1E,EAAU,SAAU8D,OAG/C5sG,QAFEspG,EAAW3wU,OAIjBqnO,QAAmBniP,EAAOyrV,EAAW/2B,UAAAA,CACnCz1S,QAAAA,CAAWlvF,GACM+/Z,EAAY//Z,GAEbopG,aAAeppG,EAAIopG,uBAK/BkhI,EAAU,kBAEG9xE,KAASkjQ,EAAWhoN,MAAAA,IAAAA,OAC7BgpJ,EAASqjE,EAAYvnQ,EAAMx4J,KAG9B08V,EAAOtzP,aAAeovD,EAAMx4J,IAAIopG,aACjCkhI,GAAW,EACXjT,EAAAA,wBAA4B7+D,EAAMx4J,UAAU08V,WACtCg/D,EAAWjtU,OAAO+pE,EAAMx4J,WACxB07Z,EAAWr/L,IAAIqgI,EAAQlkM,EAAM95J,OAEnCo/Z,EAAYxzL,EAAU8nF,EAAc,IAAA,uBAA4B55J,EAAMx4J,UAAU08V,qBAI9Eg/D,EAAW1wU,SAKrB3sF,EAAOC,QAAAA,CACLowG,QAAS,EACTs5D,YAAa,+GACbg2P,QAAS,CAAC9C,EAAU8D,EAAalB,EAAa,WACrChhO,EAAQo+N,EAAU8D,EAAalB,EAAY7oD,GAEpD5wF,OAAQ,CAAC62I,EAAU8D,EAAalB,EAAa,WACpChhO,EAAQo+N,EAAU8D,EAAalB,EAAYgC,0LC7FtD,aAEA,MAAAj4F,IACAA,EAAA13M,OACAA,GACA5xH,EAAA,uBACAyha,EAAAzha,EAAA,kBACA0ha,EAAAD,EAAA37B,kBAMA67B,EAAA,IAAAr4F,EAAA,WACAs4F,EAAA,IAAAt4F,EAAA,YAoCA,SAAAu4F,EAAAn7B,GACA,IAAA97G,EAAA87G,EAGA,KAAA97G,EAAAA,IAAAA,EAAAzzM,OAMA,GAJAyzM,EAAAA,EAAAA,IAAAA,EAAAzzM,MAIA,aAAAyzM,EAAAr3M,MAAA,UAAAq3M,EAAAxxK,YAAA95G,KACA,OAAAsrR,EAWA7qI,eAAA+hR,EAAArga,EAAA+pF,EAAAk7S,GACA,MAAArvT,QAAAmU,EAAA/pF,GAEA,GAAA41E,EACA,OAAAA,EAMA,MAAA0qV,EAAAF,EAAAn7B,GAEA,QAAAq7B,GAIA,IAAAvvP,SAAA,CAAAC,EAAAu5B,KAGA,MAAA+5D,EAAAg8J,EAAAr7B,MAAA,YAAAz4S,IAAAxsF,EAAAopG,YACAk7J,EAAAi8J,YAAAvjM,QAAA,KACAzyB,EAAA+5D,EAAAi8J,YAAAhmV,QAEA+pL,EAAAi8J,YAAAngJ,WAAA,KACApvG,EAAA3oF,QAAAi8K,EAAA1uL,aAYA0oE,eAAAkiR,EAAAxga,EAAAwsF,EAAAzC,EAAAk7S,GACA,SAAAl7S,EAAA/pF,GACA,OAAAwsF,EAAAxsF,GAMA,MAAAsga,EAAAF,EAAAn7B,GAEA,IAAAq7B,EACA,MAAAnwS,EAAA4zO,gBAGA,OAAA,IAAAhzL,SAAA,CAAAC,EAAAu5B,KAGA,MAAA+5D,EAAAg8J,EAAAr7B,MAAA,YAAAz4S,IAAAxsF,EAAAopG,YACAk7J,EAAAi8J,YAAAvjM,QAAA,KACAzyB,EAAA+5D,EAAAi8J,YAAAhmV,QAEA+pL,EAAAi8J,YAAAngJ,WAAA,KACA,GAAA9b,EAAA1uL,OACA,OAAAo7F,EAAAszF,EAAA1uL,QAGA20H,EAAAp6E,EAAA4zO,qBAwCA1lW,EAAAC,QAAA,CACAsha,YA9BA,SAAApsN,EAAA31M,EAAA8B,GACA,MAAA8ga,eAAAA,EAAAC,eAAAA,GA9HA,SAAA7ia,EAAA8B,GACA,IAAAA,IAAAA,EAAAgha,gBACA,MAAA,IAAA78T,MAAA,2CAGA,IAAAnkG,EAAAgha,gBAAA9ia,GACA,MAAA,IAAAimG,MAAA,oBAAAjmG,4BAGA,MAAA4ia,EAAA9ga,EAAAgha,gBAAA9ia,GAEA,IAAAw+Z,EAAA,GAMA,YAJA37Z,IAAAf,EAAA08Z,4BAAA37Z,IAAAf,EAAA08Z,sBAAAx+Z,KACAw+Z,EAAA18Z,EAAA08Z,sBAAAx+Z,IAGA,CACA4ia,eAAAA,EACAC,eAAArE,GA2GAuE,CAAA/ia,EAAA8B,GAEA,SAAA9B,IACA21M,EAAA,GAAAA,KAAA31M,KAGA,IAAAonY,EAAA,IAAAw7B,EAAAjtN,EAAAktN,GAGAA,EAAA5qB,WACA7Q,EAAA,IAAAg7B,EAAAh7B,EAAA,IAAA+6B,EAAAx7B,MAAAyB,WAAA,KAIA,MAAA46B,EAAA57B,EAAAz4S,IAAAmX,KAAAshS,GACA67B,EAAA77B,EAAAl7S,IAAA4Z,KAAAshS,GAUA,OANAA,EAAAz4S,IAAAxsF,GAAAwga,EAAAxga,EAAA6ga,EAAAC,EAAA77B,GAIAA,EAAAl7S,IAAA/pF,GAAAqga,EAAArga,EAAA8ga,EAAA77B,GAEAA,GAKAo7B,gBAAAA,EACAG,gBAAAA,EACAJ,YAAAA,EACAF,WAAAA,EACAC,YAAAA,uFCpLA,aAkBA9ha,EAAAC,QAVAggJ,MAAAmX,IACA,IAAAlnE,EAAA,EAEA,UAAA,MAAApI,KAAAsvE,EACAlnE,IAGA,OAAAA,iCCfA,mBAEMgrI,EAAMh7N,EAAQ,QACdwia,EAAQxia,EAAQ,eAChBgmP,EAAOhmP,EAAQ,SACf66N,EAAa76N,EAAQ,cACrB46N,EAAY56N,EAAQ,aACpByia,EAASzia,EAAQ,0BACfqha,GAAgBrha,EAAQ,6BACxBy2W,EAAAA,WAAUisD,EAAAA,SAAY9sD,GAAa51W,EAAQ,WAC7C0xE,EAAS1xE,EAAQ,aAevB+/I,eAAA4iR,EAAgCxF,EAAYnhC,EAAW4mC,EAAUrD,aACpDvjC,EAAUxwS,IAAIk3U,gBAInBl+L,QAAWw3J,EAAU/tS,IAAIy0U,GACzBtoM,EAAAA,IAAUY,EAAIwJ,GACdq+L,QAAmB1F,EAAWlvU,IAAIwoR,EAASr8I,IAC3C0oM,EAAUN,EAAMn2T,KAAKy+P,YAAY+3D,OAEnCE,EADAh3L,EAAU,EAGdg3L,QAAkBrxV,EAAO+wV,EAAOO,QAAQ7F,EAAY2F,EAASltD,EAASvF,kBAAsB3+R,EAAO+wV,EAAOO,QAAQ7F,EAAY2F,EAASltD,EAASK,yBAE/H77I,KAAOqoM,EAAOO,QAAQ7F,EAAY2F,EAASltD,EAASvF,WAAAA,CACnEtkI,UAGMq7F,EAAAA,CACJ1iH,MAAO5rG,EAAAA,GAGW,IAAhBshH,EAAIjqH,UACNi3N,EAAIj3N,QAAUiqH,EAAIjqH,SAGF,WAAdiqH,EAAIgN,QACNggG,EAAIhgG,MAAQvM,EAAW8pB,UAAUvqB,EAAIgN,cAGjCw7L,EAAS9kM,IAAI24I,EAASr8I,GAAM4rB,EAAKj2I,OAAOq3N,IAE9Cm4F,EAAYxzL,EAAUg3L,EAAY,IAAA,0BAA+B3oM,qBAGlDA,KAAOqoM,EAAOO,QAAQ7F,EAAY2F,EAASltD,EAASK,QAAAA,CACnElqI,UAGMq7F,EAAAA,CACJ1iH,MAAO,GAGW,IAAhB0V,EAAIjqH,UACNi3N,EAAIj3N,QAAUiqH,EAAIjqH,SAGF,WAAdiqH,EAAIgN,QACNggG,EAAIhgG,MAAQvM,EAAW8pB,UAAUvqB,EAAIgN,cAGjCw7L,EAAS9kM,IAAI24I,EAASr8I,GAAM4rB,EAAKj2I,OAAOq3N,IAE9Cm4F,EAAYxzL,EAAUg3L,EAAY,IAAA,uBAA4B3oM,WAG1D+iM,EAAWjtU,OAAOumR,EAASr8I,UAC3B4hK,EAAU9rS,OAAOwyU,GASzB3iR,eAAAkjR,EAA0B9F,EAAYnhC,EAAW4mC,EAAUrD,OACrD1oD,EAAAA,GACAD,EAAAA,GACA7qI,EAAU,QACRg3L,QAAiBrxV,EAAOkxV,EAASx8B,UAAAA,yBAEpB3kY,EAAAA,MAAKtB,KAAWyia,EAASztN,MAAAA,IAAAA,CAC1C42B,UACMq7F,EAAMphF,EAAKn1I,OAAO1wG,GAClBi6N,EAAAA,IAAUY,EAAIosG,EAAIj3N,SAAW,EAAGi3N,EAAIhgG,OAASvM,EAAW6pB,QAAQ0iF,EAAIhgG,QAAU,SAAUxM,EAAU/pH,OAAO,IAAMpvG,EAAIopG,WAAWte,MAAM,KAAK7B,QAE7H,IAAd08O,EAAI1iH,OACN66M,EAAYxzL,EAAUg3L,EAAY,IAAA,uBAA4B3oM,KAE9Dw8I,EAAWr/R,KAAK6iJ,KAEhBmlM,EAAYxzL,EAAUg3L,EAAY,IAAA,0BAA+B3oM,KAEjEy8I,EAAct/R,KAAK6iJ,IAIvBmlM,EAAW,IAAK,2BAKVviM,EAJA8lM,IAAcN,EAAMx+F,QAAAA,IAAY9+F,WAAAA,OAC9Bu9L,EAAOS,SAAS/F,EAAYvnD,EAASvF,UAAWwG,SAChD4rD,EAAOS,SAAS/F,EAAYvnD,EAASK,OAAQW,KAEjCvL,YACdjxI,QAAYooM,EAAMn2T,KAAK+tH,IAAI4C,EAAAA,CAC/BwwI,WAAY,UAER2vD,EAAWr/L,IAAI24I,EAASr8I,GAAM4C,SAC9Bg/J,EAAUl+J,IAAI4kM,EAAYtoM,EAAIW,WAStCh7E,eAAAw+C,EAAwBo+N,EAAU8D,EAAalB,EAAYluU,SACnD8rU,EAAakE,EAAY1E,EAAU,SAAU8D,GAC7CzkC,EAAYqlC,EAAY1E,EAAU,YAAa8D,GAC/CmC,EAAWvB,EAAY1E,EAAU,OAAQ8D,SAEzCtD,EAAW3wU,aACXwvS,EAAUxvS,aACVo2U,EAASp2U,iBAGP6E,EAAG8rU,EAAYnhC,EAAW4mC,EAAUrD,iBAEpCqD,EAASn2U,cACTuvS,EAAUvvS,cACV0wU,EAAW1wU,SAKrB3sF,EAAOC,QAAAA,CACLowG,QAAS,EACTs5D,YAAa,6BACbg2P,QAAS,CAAC9C,EAAU8D,EAAalB,EAAa,WACrChhO,EAAQo+N,EAAU8D,EAAalB,EAAYoD,GAEpD78I,OAAQ,CAAC62I,EAAU8D,EAAalB,EAAa,WACpChhO,EAAQo+N,EAAU8D,EAAalB,EAAY0D,2MC9JtD,aAEA,MAAAjoM,EAAAh7N,EAAA,SAEA+3N,MACAqvG,KACAh8O,IAAA+3U,KAGAnja,EAAA,SAGAoja,EAAApja,EAAA,SACAooO,EAAApoO,EAAA,UACAwia,EAAAxia,EAAA,eACAgkU,EAAAhkU,EAAA,oCACA2qW,EAAA3qW,EAAA,oCACA+6N,EAAA/6N,EAAA,sBAAA+6N,WACA07I,SAAAA,EAAA4sD,eAAAA,EAAAC,UAAAA,EAAAC,UAAAA,GAAAvja,EAAA,WACAqoO,EAAAroO,EAAA,sBACA0sW,EAAA1sW,EAAA,uBACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BACA4kO,EAAA5kO,EAAA,sBA6DA,SAAA8/G,EAAAktI,EAAAvrP,GACA,MAAA66M,EAAA,IAAA4oB,WAAA,GACA,IAAAs7B,SAAAlkD,EAAAA,QACAknN,UAAA,EAAAx2K,GAAA,GACA,MAAAy2K,EAAA5+L,EApDA,SAAA/kH,GACA,OAAA,IAAAk7G,EAAAl7G,GAAA0mH,sBAmDAlB,CAAA7jO,IACA03J,EAAAkvE,EAAA,CAAA/rB,EAAAmnN,GAAAnnN,EAAAuuB,WAAA44L,EAAA54L,YAEA,OAAAu4L,EAAAt+L,EAAA3rE,IAQApZ,eAAA2jR,EAAAvG,EAAAzpV,GACA,MAAAiwV,EAzDA,SAAAhN,GAGA,MAAAiN,EAAAjN,EAAAvqK,KACAy3K,EAAAz7L,EAAAv3H,OAAA+yT,GACAE,EAAA17L,EAAAv3H,OAAAu0H,MAEA,GAAA0+L,GAAA,EACA,MAAA,IAAAv+T,MAAA,6BAGA,GAAAu+T,EAAAD,EAAAD,EAAAlyV,OACA,MAAA,IAAA6zB,MAAA,sCAGA,MAAAw+T,EAAAH,EAAA/xV,MAAAiyV,EAAAD,EAAAC,GACA7sJ,EAAAksJ,EAAAt0K,SAAAs0K,EAAAtyT,OAAAkzT,GAAA,CACA7kN,UAAA,EACA2jC,QAAA,EACA6Q,MAAA9gL,OACA24R,SAAA,IAGA,GAAA,IAAAt0F,EAAA9mK,QACA,MAAA,IAAA5K,MAAA,4BAAA0xK,EAAA9mK,WAGA,GAAA8mK,EAAA03F,OAAAgoD,EAAA5rD,MAAAr5R,OACA,MAAA,IAAA6zB,MAAA,2BAGA,MAAA,CACA0xK,OAAAA,EACA99G,KAAAyqQ,EAAA/xV,MAAAgyV,EAAAC,IAwBAE,CAAAtwV,GACA,IAAAkhC,EAAA,EAEA,IAAA,MAAAvuB,KAAA3S,EAAAq3R,MAAA,CACA,GAAAn2P,EAAA+uT,EAAA1sJ,OAAA03F,OAAA,CAGA,MAAAs1D,EAAA59U,EAAAy5N,KAEA,IAAAl7E,EAAA2+L,EAAAU,EAAA7+L,OAAA,CAEA,MAAApI,QAAAmgM,EAAAlvU,IAAAwoR,EAAAwtD,IACAvwV,EAAA8uV,EAAAn2T,KAAAy+P,YAAA9tI,SAEA0mM,EAAAvG,EAAAzpV,eAIA2S,EAAAy5N,KAGAlrM,KAuIA90G,EAAAC,QAAA,CACAija,QA/HAjjR,gBAAAo9Q,EAAAxG,EAAAr3Z,GACA,MAAA+mF,EAAAswU,EAAA5rD,MAAAngR,MAAA4K,GAAAA,EAAA8sQ,OAAAhjW,IAEA,IAAA+mF,EACA,MAAA,IAAAkf,MAAA,2BAAAjmG,GAGA,MAAA09N,QAAAmgM,EAAAlvU,IAAAwoR,EAAApwR,EAAAy5N,OACApsO,EAAA8uV,EAAAn2T,KAAAy+P,YAAA9tI,SAEA0mM,EAAAvG,EAAAzpV,IAsHAwvV,SAnBAnjR,eAAAo9Q,EAAA5pV,EAAAs7T,GACA,MAAA8nB,QA7FA,SAAAwG,EAAAptQ,GACA,OAMAhQ,eAAAmkR,EAAAltD,EAAAtyJ,GACA,MAAAy/M,EAAAhB,EAAApzT,OAAA,CACAI,QAAA,EACAw+P,OAAA00D,EACAr2K,KAAAtoC,IACAwhB,SAEA+wC,EAAA7uC,EAAAr4H,OAAAo0T,EAAAzyV,QACA0yV,EAAA/7L,EAAA,CAAA4uC,EAAAktJ,IACAE,EAAA,GAEA,IAAA,IAAAzwV,EAAA,EAAAA,EAAAyvV,EAAAzvV,IACAywV,EAAA9sV,KAAA,IAAAozR,EAAA,GAAA,EAAA44D,IAGA,GAAAvsD,EAAAtlS,QAAA4xV,EAAA,CACA,MAAA76U,EAAAuuR,EACAngS,KAAA6wB,IACA,CACArhB,KAAA,IAAAskR,EAAA,GAAA,EAAAjjQ,EAAAjmG,KACA03J,KAAAzxD,EAAAyxD,MAAA,IAAA+rE,eAIArsI,MAAA,CAAAvlB,EAAAyS,IACA2mR,EAAAp5R,EAAA+S,KAAAy5N,KAAA16E,MAAAr/I,EAAAM,KAAAy5N,KAAA16E,SAGAk/L,EAAAD,EAAA/lU,OAAA7V,EAAA5R,KAAA6wB,GAAAA,EAAArhB,QACAu9U,EAAAv7L,EAAA,CAAA+7L,KAAA37U,EAAA5R,KAAA6wB,GAAAA,EAAAyxD,SAEA,OAAA,IAAA6qK,EAAA4/F,EAAAU,GACA,CAYA,MAAAC,EAAAvtD,EAAA7kS,QAAA,CAAAoyV,EAAAn9F,KACA,MAAA1mU,EAAAo/G,EAAA4kG,EAAA0iH,EAAA3lU,KAAA4ha,EAGA,OADAkB,EAAA7ja,GAAAA,KAAA6ja,EAAAA,EAAA7ja,GAAA49F,OAAA,CAAA8oO,IAAA,CAAAA,GACAm9F,IACA,IAEA,IAAA3vT,EAAA,EACA,IAAA,MAAA8gD,KAAA6uQ,EAAA,CACA,MAAAptV,QAAA+sV,EAAAxuQ,EAAAgvD,EAAA,SAEA8/M,EAAArtV,EAAAy9B,GAEAA,IAGA,OAAA,IAAAovN,EAAAogG,EAAAC,GAOAtkR,eAAAykR,EAAArtV,EAAAstV,GACA,MAAAznM,EAAAwlM,EAAAn2T,KAAAg/P,UAAAl0R,GACAijJ,QAAAooM,EAAAn2T,KAAA+tH,IAAA4C,EAAA,CACAwwI,WAAA,EACArkC,QAAApuG,EAAA3qH,MAAA,oBAEA+sT,EAAAr/L,IAAA24I,EAAAr8I,GAAA4C,GAEAqnM,EAAAI,GAAA,IAAA95D,EAAA,GAAAxzR,EAAAuyB,KAAA0wH,IAjFA8pM,CAAAn0Q,EAAA,GA4FA20Q,CAAAvH,EAAAtuB,EAAAh4T,KAAAujJ,IACA,CACA34N,IAAA24N,OAGA4C,EAAA25L,EAAAtrD,YACAjxI,QAAAooM,EAAAn2T,KAAA+tH,IAAA4C,EAAA,CACAwwI,WAAA,EACArkC,QAAApuG,EAAA3qH,MAAA,cAKA,aAFA+sT,EAAAr/L,IAAA24I,EAAAr8I,GAAA4C,GAEA,IAAA2tI,EAAAp3R,EAAAojV,EAAAjtT,KAAA0wH,iZC5PA,aAEA,IAwBAgtG,EATArvG,EAfAg2B,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAGAxmD,GAHAomD,EAAA1hJ,KAGA0hJ,EAAAM,MAAA,UAAAN,EAAAM,MAAA,QAAA,KAEA1mD,EAAAowB,OAOAA,EAAA,IAEAqvG,MAOAA,EAAA,IAEAh8O,IAAA,WAmBA,SAAAA,EAAAzX,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAoJA,OA3IAwX,EAAAgf,UAAA+F,QAAA,EAQA/kB,EAAAgf,UAAAukQ,OAAA,EAQAvjR,EAAAgf,UAAA4iJ,KAAA,EAWA5hK,EAAA2kB,OAAA,SAAApkB,EAAAulI,GASA,OARAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAwkB,SAAAlwG,OAAAgnG,eAAAoD,KAAA1e,EAAA,YACAulI,EAAAs9B,OAAA,GAAAA,OAAA7iK,EAAAwkB,SACA,MAAAxkB,EAAAgjR,QAAA1uW,OAAAgnG,eAAAoD,KAAA1e,EAAA,WACAulI,EAAAs9B,OAAA,IAAAA,OAAA7iK,EAAAgjR,QACA,MAAAhjR,EAAAqhK,MAAA/sP,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAAmC,QAAAhlK,EAAAqhK,MACA97B,GAcA9lI,EAAAylB,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAowB,KAAAqvG,IAAAh8O,IACAqvB,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAwkB,QAAAsK,EAAA+zI,SACA,MACA,KAAA,EACA7iK,EAAAgjR,OAAAl0P,EAAA+zI,SACA,MACA,KAAA,EACA7iK,EAAAqhK,KAAAvyI,EAAAk2I,UACA,MACA,QACAl2I,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAP,EAAAwjK,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAowB,KAAAqvG,IAAAh8O,IACA,OAAAi/C,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAowB,KAAAqvG,IAAAh8O,IAUA,OATA,MAAAi/C,EAAAl6B,UACAxkB,EAAAwkB,QAAAk6B,EAAAl6B,UAAA,GAEA,MAAAk6B,EAAAskO,SACAhjR,EAAAgjR,OAAAtkO,EAAAskO,SAAA,GAEA,MAAAtkO,EAAA2iH,OACArhK,EAAAqhK,KAAA3iH,EAAA2iH,OAAA,GAEArhK,GAYAP,EAAAyjK,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAeA,OAdAsyC,EAAAuiC,WACA70E,EAAAl6B,QAAA,EACAk6B,EAAAskO,OAAA,EACAtkO,EAAA2iH,KAAA,GAEA,MAAArhK,EAAAwkB,SAAAxkB,EAAAsb,eAAA,aACAojC,EAAAl6B,QAAAxkB,EAAAwkB,SAEA,MAAAxkB,EAAAgjR,QAAAhjR,EAAAsb,eAAA,YACAojC,EAAAskO,OAAAhjR,EAAAgjR,QAEA,MAAAhjR,EAAAqhK,MAAArhK,EAAAsb,eAAA,UACAojC,EAAA2iH,KAAArhK,EAAAqhK,MAEA3iH,GAUAj/C,EAAAgf,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGA1jK,EA3KA,GA8KAg8O,GAGArvG,GAGAj4N,EAAAC,QAAA4nM,4DC9LA,SAAA7nF,EAAAn3B,GAGA,IAFA,IAAAurF,EAAAp0D,EAAAgqH,KAEAl2J,EAAA,EAAA4hB,EAAA7M,EAAAjX,OAAAkC,EAAA4hB,EAAA5hB,IACAsgG,GAAAvrF,EAAAjE,WAAA9Q,GACAsgG,IAAAA,GAAA,IAAAA,GAAA,IAAAA,GAAA,IAAAA,GAAA,IAAAA,GAAA,IAGA,OAAAA,IAAA,EAjBAp0D,EAAAgqH,KAAA,WAoBAhqO,EAAAC,QAAA+/G,gCC9BA,aAEA,MAAA86G,EAAA56N,EAAA,cACAspU,IAAAA,GAAAtpU,EAAA,uBACAuvZ,EAAAvvZ,EAAA,sBAAA+6N,UAEA2nM,EAAA,IAAAp5F,EAAA,eAGAi6F,EAAAhU,EAAA5nL,cAAA,kDAcA7nO,EAAAC,QAAA,CACA2ia,WAAAA,EACAW,eAlBA,IAmBAC,UAlBA,KAmBAC,UAAAA,EACA3tD,SAjBA,CACAK,OAAA,SACA5F,UAAA,aAgBAoG,SAVA,SAAAr8I,GACA,OAAA,IAAAkvG,EAAA,IAAA1uG,EAAAoO,SAAA,eAAAj5H,OAAAqqH,EAAAW,0HCpBA,+BAGEsmM,EAAAA,YACAQ,GACE7ha,EAAQ,mBACN82P,EAAa92P,EAAQ,2BACrB6qG,EAAW7qG,EAAQ,yBAiBzB+/I,eAAA4kR,EAA6Brla,EAAMonY,EAAO64B,EAAa,cACjD30I,EAAKi3I,EAAYn7B,OAGhB97G,cACH20I,EAAAA,GAAcjga,6BAKhBiga,EAAAA,aAAwBjga,WAYlBsla,EAASh6I,GAPC,CAACnpR,EAAKtB,MAEhBozE,KAAM,MAAO9xE,IAAKA,IAClB8xE,KAAM,MAAO9xE,IAAKq1P,EAAWr1P,GAAMtB,MAAOA,MAYlD4/I,eAAA8kR,EAA8Bvla,EAAMonY,EAAO64B,EAAa,cAClD30I,EAAKi3I,EAAYn7B,OAGhB97G,cACH20I,EAAAA,GAAcjga,8BAKhBiga,EAAAA,eAA0Bjga,WAYpBsla,EAASh6I,GAPG,CAACnpR,EAAKtB,MAElBozE,KAAM,MAAO9xE,IAAKA,IAClB8xE,KAAM,MAAO9xE,IAAKopG,EAASppG,GAAMtB,MAAOA,MAchD4/I,eAAAw+C,EAAwBo+N,EAAU8D,EAAalB,EAAYluU,SACnDyzU,EAAa7ka,OAAOW,KAAK6/Z,EAAY2B,iBACxC5nV,QAAO/4E,GAAiD,mBAA1Cg/Z,EAAY2B,gBAAgB3ga,GAAKnC,OAC/Cu3E,KAAIv3E,IAAAA,CACHA,KAAAA,EACAonY,MAAO26B,EAAY1E,EAAUr9Z,EAAMmha,OAGvClB,EAAW,EAAA,aAAgBuF,EAAWpzV,kBAClCqzV,EAAW,iBAEFzla,EAAAA,MAAMonY,KAAWo+B,EAAAA,OACtBp+B,EAAMl6S,iBAMJ8pT,EAAYlwT,IAChBm5U,EAAWltV,KAAKuoC,MAAOmqT,EAAWD,EAAWpzV,OAAU,KAAM0U,UAGzDiL,EAAG/xF,EAAMonY,EAAO4P,WAEtByuB,IACAr+B,EAAMj6S,SAIV8yU,EAAW,IAAA,YAAiBuF,EAAWpzV,cAyBzC,SAAAkzV,EAAmBh6I,EAAIv5L,cAmCVmhF,SAAQ,CAACC,EAASu5B,WACrBi6J,EAAKr7E,EAAG1zH,WAOd+uM,EAAG++D,gBAAkB/+D,EAAGg/D,kBADZ9rQ,GAASA,EAIrB,SAAAtvE,UAMQq7U,EAAa,CAACh/T,EAAKzkG,EAAKtB,QACxB+lG,QAAe/jG,IAARV,SAIH0ja,EAAa/iF,IACbA,EACFp2I,EAAOo2I,GAIT3vK,KAGFwzL,EAAGx0R,IAAI0zV,QA7Df,SAAgB9T,EAAYxnU,SACpB68S,EAAQ97G,EAAG87G,MAAM,aACjBs7B,EAAct7B,EAAMs7B,gBAGtBhmV,EAFAhK,EAAQ,EAIZgwV,EAAYvjM,QAAU,IAAM50I,EAAK7N,GAASgmV,EAAYhmV,OAAAA,IAAaupB,MAAM,oBACzEy8T,EAAYngJ,WAAa,IAAMh4L,IAE/B,SAAAuwE,QACMqD,EAAK4zP,EAAWr/U,KAChBvwE,EAAMg8J,EAAGh8J,YAGPskQ,EAAkB,QAAZtoG,EAAGlqF,KAAiBmzT,EAAMx2S,OAAOzuF,GAAOilY,EAAM5oK,IAAIrgE,EAAGt9J,MAAOsB,SAC/DykG,UACPlqB,EAAQkqB,OACR87T,EAAYviR,QAIVztE,EAAQq/U,EAAW3/U,SACrBq0L,EAAIq/J,UAAYhrQ,GAIpBA,GAwCI8rO,CAAM70S,EAAG5vF,EAAKtB,GAAQ0pF,IAExBo8Q,EAAGp8Q,KAAKq7U,GA9BVr7U,MAjEJ/pF,EAAOC,QAAAA,CACLowG,QAAS,GACTs5D,YAAa,0CACbg2P,QAAS,CAAC9C,EAAU8D,EAAalB,EAAa,WACrChhO,EAAQo+N,EAAU8D,EAAalB,EAAYoF,GAEpD7+I,OAAQ,CAAC62I,EAAU8D,EAAalB,EAAa,WACpChhO,EAAQo+N,EAAU8D,EAAalB,EAAYsF,6HC9HtD,aAEA,MAAAQ,EAAArla,EAAA,WACAsla,wBAAAA,EAAAC,wBAAAA,GAAAvla,EAAA,cACA4ha,YAAAA,EAAAP,YAAAA,GAAArha,EAAA,YACA6kO,EAAA7kO,EAAA,2BACA8kO,EAAA9kO,EAAA,yBA+CAF,EAAAC,QAAA,CACAyga,WAtCAzgR,eAAA3gJ,EAAAqha,GACA,UAAA4E,EAAAG,kBAAApma,EAAAqha,GACA,MAAA,IAAA8E,EAAA,gBAAAnma,yBAGA,IAAAqha,EACA,MAAA,IAAA6E,EAAA,uDAGA,MAAA5+B,EAAA26B,EAAAjia,EAAA,OAAAqha,SACA/5B,EAAAl6S,OAEA,IACA,OAAA3Z,SAAAiyJ,QAAA4hK,EAAAz4S,IAAA2zU,KACA,cACAl7B,EAAAj6S,UAwBAu0U,WAbAjhR,eAAA3gJ,EAAA+wG,EAAAswT,GACA,IAAAA,EACA,MAAA,IAAA6E,EAAA,uDAGA,MAAA5+B,EAAA26B,EAAAjia,EAAA,OAAAqha,SACA/5B,EAAAl6S,aACAk6S,EAAA5oK,IAAA8jM,EAAA/8L,EAAA/xJ,OAAAq9B,WACAu2R,EAAAj6S,iKClDA,aAEA,MAAAqsI,EAAA94N,EAAA,QAAAA,CAAA,iCACA2ha,WAAAA,EAAAC,YAAAA,EAAAP,YAAAA,GAAArha,EAAA,aACAsla,wBAAAA,GAAAtla,EAAA,aAkCAF,EAAAC,QAAA,CACAyla,kBA7BAzlR,eAAA3gJ,EAAAqha,GACA,IAAAA,EACA,MAAA,IAAA6E,EAAA,uDAGA,IAAAp4U,EACA,IACAA,EAAAm0U,EAAAjia,EAAA,OAAAqha,SACAvzU,EAAAV,OACA,MAAAi5U,QAAAv4U,EAAA1B,IAAAo2U,GACA8D,QAAAx4U,EAAA1B,IAAAm2U,GACA,SAAA8D,IAAAC,KACA5sM,EAAA,0BAAA2sM,KACA3sM,EAAA,yBAAA4sM,MACA,GAIA,MAAAlla,GAEA,OADAs4N,EAAA,2DAAAt4N,EAAA4lF,UACA,EACA,aACAjkF,IAAA+qF,SACAA,EAAAT,6FCjCA,aAMA,MAAA4zU,UAAA96T,MAIAjiG,YAAA8iF,GACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,8BACAmtG,KAAA3qG,KAAA,+BACA2qG,KAAArmB,QAAAA,GAGAi6U,EAAAv+Z,KAAA,+BAKA,MAAAyja,UAAAhgU,MAIAjiG,YAAA8iF,GACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,0BACAmtG,KAAA3qG,KAAA,2BACA2qG,KAAArmB,QAAAA,GAGAm/U,EAAAzja,KAAA,2BAKA,MAAA6+Z,UAAAp7T,MAIAjiG,YAAA8iF,GACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,yBACAmtG,KAAA3qG,KAAA,yBACA2qG,KAAArmB,QAAAA,GAGAu6U,EAAA7+Z,KAAA,yBAKA,MAAAw+Z,UAAA/6T,MAIAjiG,YAAA8iF,GACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,oBACAmtG,KAAA3qG,KAAA,oBACA2qG,KAAArmB,QAAAA,GAGAk6U,EAAAx+Z,KAAA,oBAKA,MAAAwja,UAAA//T,MAIAjiG,YAAA8iF,GACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,0BACAmtG,KAAA3qG,KAAA,2BACA2qG,KAAArmB,QAAAA,GAGAk/U,EAAAxja,KAAA,2BAEAhC,EAAAC,QAAA,CACAsga,4BAAAA,EACAkF,wBAAAA,EACA5E,uBAAAA,EACAL,kBAAAA,EACAgF,wBAAAA,iCCxFA,aAEA,MACAxsM,EADA94N,EAAA,QACA0wU,CAAA,oCAMAi1F,EAAA,GAQA5la,EAAAq2W,KAAAr2N,eAAA5vC,EAAAz2B,GACA,MAAA6zB,EAAA7zB,EAAAA,aAGA,GAFAo/I,EAAA,aAAAvrH,IAEA,IAAAo4T,EAAAp4T,GACA,MAAAhI,MAAA,sCAAAgI,KAIA,OADAo4T,EAAAp4T,IAAA,EACA,CACAjqG,QACAqia,EAAAp4T,KACAurH,EAAA,oBAAAvrH,UACAo4T,EAAAp4T;A;A;A;A;A;A;ACvBA,aAOAztG,EAAAC,QAuCA,SAAAI,EAAAiB,GACA,GAAA,iBAAAjB,EACA,OAAAu7E,EAAAv7E,GAGA,GAAA,iBAAAA,EACA,OAAAsjO,EAAAtjO,EAAAiB,GAGA,OAAA,MA/CAtB,EAAAC,QAAA0jO,OAAAA,EACA3jO,EAAAC,QAAA27E,MAAAA,EAOA,IAAAkqV,EAAA,wBAEAC,EAAA,wBAEAhvV,EAAA,CACAkP,EAAA,EACA+/U,GAAA,KACA1E,GAAA,GAAA,GACA2E,GAAA,GAAA,GACAC,GAAA3zV,KAAAy5J,IAAA,KAAA,GACAm6L,GAAA5zV,KAAAy5J,IAAA,KAAA,IAGAo6L,EAAA,gDA+CA,SAAAziM,EAAAtjO,EAAAiB,GACA,IAAAwxE,OAAAu/K,SAAAhyP,GACA,OAAA,KAGA,IAAAgma,EAAA9zV,KAAAu0L,IAAAzmQ,GACAima,EAAAhla,GAAAA,EAAAgla,oBAAA,GACAC,EAAAjla,GAAAA,EAAAila,eAAA,GACA1hD,EAAAvjX,QAAAe,IAAAf,EAAAujX,cAAAvjX,EAAAujX,cAAA,EACA2hD,EAAAx8U,QAAA1oF,GAAAA,EAAAkla,eACAC,EAAAnla,GAAAA,EAAAmla,MAAA,GAEAA,GAAA1vV,EAAA0vV,EAAA1wV,iBAEA0wV,EADAJ,GAAAtvV,EAAAovV,GACA,KACAE,GAAAtvV,EAAAmvV,GACA,KACAG,GAAAtvV,EAAAkvV,GACA,KACAI,GAAAtvV,EAAAuqV,GACA,KACA+E,GAAAtvV,EAAAivV,GACA,KAEA,KAIA,IACA7jU,GADA9hG,EAAA02E,EAAA0vV,EAAA1wV,gBACAgxL,QAAA89G,GAUA,OARA2hD,IACArkU,EAAAA,EAAAtc,QAAAkgV,EAAA,OAGAO,IACAnkU,EAAAA,EAAAtc,QAAAigV,EAAAQ,IAGAnkU,EAAAokU,EAAAE,EAcA,SAAA7qV,EAAA0qB,GACA,GAAA,iBAAAA,IAAAuF,MAAAvF,GACA,OAAAA,EAGA,GAAA,iBAAAA,EACA,OAAA,KAIA,IACAogU,EADAj+J,EAAA29J,EAAAn0V,KAAAq0B,GAEAmgU,EAAA,IAYA,OAVAh+J,GAMAi+J,EAAA96T,WAAA68J,EAAA,IACAg+J,EAAAh+J,EAAA,GAAA1yL,gBALA2wV,EAAA3zV,SAAAuzB,EAAA,IACAmgU,EAAA,KAOAl0V,KAAA6nC,MAAArjC,EAAA0vV,GAAAC,kCChKA,aAaA1ma,EAAAC,QARA,YAAA8iF,GACA,OAAA,IAAAA,EAAAnR,OACA,IAGAmR,EAAA9L,KAAA,oCCVA,aAEAj3E,EAAAC,QAAA,CACAqtZ,YAAA,kCCHA,aAsBAttZ,EAAAC,QAAA,CACAY,OARA,SAAArB,EAAAF,EAAAgC,GAIA,OAAA,IAAAqla,EAHArla,EAAAgha,gBAAA9ia,IAGAF,EAFAa,OAAAiqG,OAAA,GAAA9oG,EAAA08Z,sBAAAx+Z,IAAA,qCCjBA,aAEA,MAAAgqU,EAAAtpU,EAAA,uBAAAspU,IAEAxwG,EADA94N,EAAA,QACA0wU,CAAA,qBACA5rG,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,4BACA8ha,gBACAA,EAAAG,gBACAA,GAEAjia,EAAA,kCAEA0ma,EAAA,IAAAp9F,EAAA,WAMAxpU,EAAAC,QAAA2mY,IACA,CAKAigB,OAAA,SAIAmb,EAAA4E,EAAAhgC,EAAAl7S,IAAA4Z,KAAAshS,GAAAA,GAOApjY,YAIA,MAAA05N,QAAAilM,EAAAyE,EAAAhgC,EAAAz4S,IAAAmX,KAAAshS,GAAAA,EAAAl7S,IAAA4Z,KAAAshS,GAAAA,GACA,OAAA7zT,SAAAiyJ,EAAA9H,GAAA,KAQA9uI,IAAAiiB,GACAu2R,EAAA5oK,IAAA4oM,EAAA7hM,EAAA/xJ,OAAAq9B,KAOA7sG,YAAAmgF,GACA,MAAA0sB,QAAA1D,KAAAxe,MACA6qI,EAAA,+BAAA3oH,EAAA1sB,GAKA,OAAA0sB,IAAA1sB,IAFA,IAAA0sB,GAAA,IAAA1sB,GAAA,IAAAA,GAAA,IAAA0sB,0LC9DA,aAEA,MAAAm5N,IAAAA,GAAAtpU,EAAA,wBACAJ,QAAAgyZ,GAAA5xZ,EAAA,WACAyzM,EAAAzzM,EAAA,iBACAs0G,EAAAt0G,EAAA,iBACA0rP,EAAA1rP,EAAA,YACAw/H,EAAAx/H,EAAA,YACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,4BACA8ha,gBACAA,EAAAG,gBACAA,GAEAjia,EAAA,kCAEA2ma,EAAA,IAAAr9F,EAAA,UASAxpU,EAAAC,QAAA2mY,IACA,MAAAkgC,EAAA,IAAAhV,EAAA,CAAAlhD,YAAA,IAEAm2D,EAAA,CAQAvja,aAAAlC,EAAA,IAIA,MAAA0la,QAAA7E,EAAA0E,EAAAjgC,EAAAz4S,IAAAmX,KAAAshS,GAAAA,EAAAl7S,IAAA4Z,KAAAshS,GAAAA,EAAA,CACApqK,OAAAl7N,EAAAk7N,SAGA,OAAAhoJ,KAAAoH,MAAAopJ,EAAAgiM,KAUAxja,UAAA7B,EAAAL,EAAA,IACA,GAAA,MAAAK,EACA,MAAA,IAAA+9H,EAAA4/R,cAAA,OAAA39Z,8BAGA,MAAAulF,QAAAylB,KAAAo8N,OAAAznU,GACAjB,EAAAszM,EAAAzsH,EAAAvlF,GAEA,QAAAU,IAAAhC,EACA,MAAA,IAAAq/H,EAAA4/R,cAAA,OAAA39Z,8BAGA,OAAAtB,GAWAmD,IAAA7B,EAAAtB,EAAAiB,EAAA,IAEA,GAAA,iBAAAK,KAAAA,aAAAqxE,QACA,MAAA44K,EAAA,IAAAnmJ,MAAA,4BAAA9jG,GAAA,mBAGA,QAAAU,IAAAhC,GAAAA,aAAA+kO,WACA,MAAAwmB,EAAA,IAAAnmJ,MAAA,8BAAAplG,GAAA,qBAGA,OAAAyma,EAAAn7U,KAAA,IAAAs7U,EAAA,CACAtla,IAAAA,EACAtB,MAAAA,GACAiB,EAAAk7N,WAUAh5N,QAAAnD,EAAAiB,EAAA,IACA,IAAAjB,GAAAA,aAAA+kO,WACA,MAAAwmB,EAAA,IAAAnmJ,MAAA,8BAAAplG,GAAA,qBAGA,OAAAyma,EAAAn7U,KAAA,IAAAs7U,EAAA,CACAtla,SAAAU,EACAhC,MAAAA,GACAiB,EAAAk7N,WAOAqqL,OAAA,SAIAmb,EAAA6E,EAAAjgC,EAAAl7S,IAAA4Z,KAAAshS,GAAAA,IAIA,OAAAmgC,EAMA9mR,eAAAgnR,EAAAp7U,EAAA2wI,GACA,GAAAA,GAAAA,EAAAx8E,QACA,OAGA,MAAAr+I,EAAAkqF,EAAAlqF,IACAtB,EAAAwrF,EAAAxrF,MACA,GAAAsB,EAAA,CACA,MAAAulF,QAAA6/U,EAAAh+F,SAIA,MAHA,iBAAA7hP,GAAA,OAAAA,GACAstB,EAAAttB,EAAAvlF,EAAAtB,GAEA6ma,EAAAhgV,GAEA,OAAAggV,EAAA7ma,GAMA,SAAA6ma,EAAAhgV,GACA,MAAAg2I,EAAA6H,EAAAvwJ,KAAAC,UAAAyS,EAAA,KAAA,IACA,OAAA0/S,EAAA5oK,IAAA6oM,EAAA3pM,mRCvJA,aAKA,MAAAiqM,UAAA1hU,MAIAjiG,YAAA8iF,GACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,kBACAmtG,KAAA3qG,KAAAmla,EAAAnla,MAIAmla,EAAAnla,KAAA,kBACA/B,EAAAkna,gBAAAA,EAKA,MAAA7H,UAAA75T,MAIAjiG,YAAA8iF,GACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,gBACAmtG,KAAA3qG,KAAAs9Z,EAAAt9Z,MAIAs9Z,EAAAt9Z,KAAA,gBACA/B,EAAAq/Z,cAAAA,EAKA,MAAAT,UAAAp5T,MAIAjiG,YAAA8iF,GACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,0BACAmtG,KAAA3qG,KAAA68Z,EAAA78Z,MAIA68Z,EAAA78Z,KAAA,2BACA/B,EAAA4+Z,wBAAAA,EAEA5+Z,EAAA++Z,yBAAA,2BACA/+Z,EAAAu+Z,sBAAA,wBACAv+Z,EAAAg/Z,wBAAA,wDCvDA,aAEA,MAAAz1F,EAAAtpU,EAAA,uBAAAspU,IACA49F,EAAAlna,EAAA,aACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BAEAmna,EAAA,IAAA79F,EAAA,kBAMAxpU,EAAAC,QAAA2mY,IACA,CAKAigB,OAAA,IACAjgB,EAAAl7S,IAAA27U,GAOA7ja,YACA,MAAA05N,QAAA0pK,EAAAz4S,IAAAk5U,GACA,OAAA7yV,KAAAoH,MAAAopJ,EAAA9H,KASA9uI,IAAA,MAAA+uU,GACAv2B,EAAA5oK,IAAAqpM,EAAAtiM,EAAAvwJ,KAAAC,UAAA2yV,EAAAjK,EAAA,CAAA/vO,MAAA,0JCvCA,aACA,MAAApjF,EAAA9pG,EAAA,gBAEAF,EAAAC,QAAA,CAAA4iI,EAAAvhI,EAAA,MACA,IAAA0oG,EAAA64B,KAAAr4B,MAAA/gB,QAAAo5C,GACA,MAAA,IAAAnxB,UAAA,oCAGA,MAAA07E,KAAAA,GAAA9rL,EACAgma,EAAA,GACAC,EAAA,GAEAC,EAAA3lM,IACA,MAAA4lM,EAAAH,EAAAnvV,QAAA0pJ,GAEA,IAAA,IAAA4lM,EACA,OAAAF,EAAAE,GAGA,MAAAlwV,EAAA,GAgBA,OAfA+vV,EAAA7vV,KAAAoqJ,GACA0lM,EAAA9vV,KAAAF,GAEAA,EAAAE,QAAAoqJ,EAAA9qJ,KAAA6wB,GACA4C,MAAA/gB,QAAAme,GACA4/T,EAAA5/T,GAGAoC,EAAApC,GACAw/T,EAAAx/T,GAGAA,KAGArwB,GAGA6vV,EAAAvkS,IACA,MAAA4kS,EAAAH,EAAAnvV,QAAA0qD,GAEA,IAAA,IAAA4kS,EACA,OAAAF,EAAAE,GAGA,MAAAlwV,EAAA,GACAz2E,EAAAX,OAAAW,KAAA+hI,GAAA9pC,KAAAz3F,EAAAm9T,SAEA6oG,EAAA7vV,KAAAorD,GACA0kS,EAAA9vV,KAAAF,GAEA,IAAA,MAAA51E,KAAAb,EAAA,CACA,MAAAT,EAAAwiI,EAAAlhI,GACA,IAAAi6K,EAGAA,EADAwR,GAAA5iF,MAAA/gB,QAAAppF,GACAmna,EAAAnna,GAEA+sL,GAAApjF,EAAA3pG,GAAA+ma,EAAA/ma,GAAAA,EAGAF,OAAAC,eAAAm3E,EAAA51E,EAAA,IACAxB,OAAAy4U,yBAAA/1M,EAAAlhI,GACAtB,MAAAu7K,IAIA,OAAArkG,GAGA,OAAAizB,MAAA/gB,QAAAo5C,GACAuqD,EAAAo6O,EAAA3kS,GAAAA,EAAA9wD,QAGAq1V,EAAAvkS,wDC1EA,aAEA,MAAA2mM,EAAAtpU,EAAA,uBAAAspU,IACAzkG,EAAA7kO,EAAA,2BAEAwna,EAAA,IAAAl+F,EAAA,OAMAxpU,EAAAC,QAAA2mY,IACA,CAMApjY,YACA,MAAAnD,QAAAumY,EAAAz4S,IAAAu5U,GACA,OAAArna,GAAAA,EAAA0qG,YAQA3c,IAAA/tF,GACAumY,EAAA5oK,IAAA0pM,EAAA3iM,EAAA1kO,EAAA0qG,aAKA3a,OAAA,IACAw2S,EAAAx2S,OAAAs3U,kGCnCA,4CAEQvhC,EAAAA,kBAAOH,GAAsB9lY,EAAQ,kBACvCuxY,EAAQvxY,EAAQ,wBACdy2W,EAAAA,SAAU8qD,GAAavha,EAAQ,sBACjC62E,EAAM72E,EAAQ,UACd0lW,EAAQ1lW,EAAQ,YAChBooY,EAAWpoY,EAAQ,eAczBF,EAAOC,QAAU,CAAC0na,EAAWrma,IAoB7B,SAA0BslY,UAEtBl6S,KAAAA,IACSk6S,EAAMl6S,mBAGA2oH,EAAO/zM,uBACDK,EAAAA,MAAKtB,KAAWumY,EAAMvxL,MAAMA,EAAO/zM,aAC1CmwY,EAAMpxY,EAAOoha,EAAS9/Z,qBAIjB0zM,EAAO/zM,mBACPK,KAAOilY,EAAMN,UAAUjxL,EAAO/zM,SACvCmga,EAAS9/Z,cAIR24N,EAAKh5N,SACRK,EAAMg1W,EAASr8I,GACfstM,QAAkBhhC,EAAMz4S,IAAIxsF,EAAKL,cAE5BmwY,EAAMm2B,EAAWttM,kBAGby0K,EAAMztY,mBACJg5N,KAAOy0K,QAChBpiS,KAAKxe,IAAImsI,EAAKh5N,cAIb64J,EAAO74J,OACXmwY,EAAMlvT,QAAQ43E,aACP10D,MAAM,uBAGZ9jG,EAAMg1W,EAASx8M,EAAMmgE,kBACNssK,EAAMl7S,IAAI/pF,EAAKL,UAG5BslY,EAAM5oK,IAAIr8N,EAAKw4J,EAAMd,KAAM/3J,GAG5B64J,iBAGQs3G,EAAQnwQ,SASjBmqO,EAAS68J,KAIA7pM,GAAWA,EAAQla,SAAWka,EAAQla,SAAWu7E,eAEzD7/G,oBAEG2lN,EAAMghC,EAAM3gC,QAAAA,kCACC9rM,KAASs3G,EAAAA,OAClB9vQ,EAAMg1W,EAASx8M,EAAMmgE,WACNssK,EAAMl7S,IAAI/pF,EAAKL,WAG1BK,IAAAA,EAAKtB,MAAO85J,EAAMd,OAK5BoyE,EAAOh0J,KAAK0iF,IAXE8rM,KAelBx6H,EAAO95J,YACAy0B,GACPqlI,EAAO95J,IAAIy0B,aAIPqlI,GAGV//I,IAAAA,CAAK4uI,EAAKh5N,IACDslY,EAAMl7S,IAAIirR,EAASr8I,GAAMh5N,GAGlC8uF,OAAAA,CAAQkqI,EAAKh5N,IACJslY,EAAMx2S,OAAOumR,EAASr8I,GAAMh5N,GAGrC4kW,WAAAA,CAAY6oC,EAAMztY,IACTslY,EAAM1gC,WAAWnvR,EAAIg4T,GAAMz0K,GAAOq8I,EAASr8I,KAAOh5N,GAG3DqrF,MAAAA,IACSi6S,EAAMj6S,SAtHVk7U,CAOT,SAA4BF,EAAWrma,MACjCA,EAAQm2Y,oBACCzR,EAAkB2hC,EAAAA,IAAexhC,EAAMyB,WAAW,WAExD+/B,EAZOG,CAAkBH,EAAWrma,sLCtB7C,aAEA,MAAAkoU,IAAAA,GAAAtpU,EAAA,uBACAg7N,EAAAh7N,EAAA,QACA46N,EAAA56N,EAAA,aACA0rP,EAAA1rP,EAAA,YACA8kO,EAAA9kO,EAAA,yBAQAD,EAAA02W,SAAAr8I,IACA,IAAAY,EAAAsM,MAAAlN,GACA,MAAAsxB,EAAA,IAAAnmJ,MAAA,mBAAA,mBAGA,OAAA,IAAA+jO,EAAA,IAAAxkG,EAAAlK,EAAA7qH,OAAA,SAAAqqH,EAAAW,YAAAlpJ,MAAA,GAAAswB,eAAA,IAWApiG,EAAAwha,SAAA9/Z,GAEA,IAAAu5N,EAAA,EAAA,MAAAJ,EAAA/pH,OAAA,IAAApvG,EAAAopG,WAAAh5B,MAAA,GAAAgE,6JChCA,sCAEM07T,EAAQvxY,EAAQ,cAChBw6E,EAASx6E,EAAQ,aACjBwkO,EAAKxkO,EAAQ,eACbooY,EAAWpoY,EAAQ,eACnB0lW,EAAQ1lW,EAAQ,YAChBg7N,EAAMh7N,EAAQ,QACd0rP,EAAU1rP,EAAQ,YAoHxB,SAAA6na,EAA0B/ma,OACnBk6N,EAAIsM,MAAMxmO,SACP4qP,EAAAA,IAAYnmJ,MAAM,mBAAoB,yBAIxCkgI,EAAUjB,EAAG3zH,OAAO/vG,EAAEi6N,iBAEP,aAAjB0K,EAAQnmO,MAERwoa,YAAY,IAKdA,YAAY,EACZniM,OAAQF,EAAQE,QAvHpB7lO,EAAOC,QAMP,SAAwB2mY,UAEpBl6S,KAAAA,IACSk6S,EAAMl6S,OAGf2oH,MAAAA,CAAOA,EAAO/zM,IACLslY,EAAMvxL,MAAMA,EAAO/zM,GAG5BglY,UAAAA,CAAWjxL,EAAO/zM,IACTslY,EAAMN,UAAUjxL,EAAO/zM,aAGrBg5N,EAAKh5N,SACR2ma,EAAYF,EAAgBztM,UAC9B2tM,EAAUD,WACLt1P,QAAQC,QAAAA,IAAY8+N,EAAMw2B,EAAUpiM,OAAQvL,IAE9CssK,EAAMz4S,IAAImsI,EAAKh5N,kBAGPytY,EAAMztY,mBACJg5N,KAAOy0K,QAChBpiS,KAAKxe,IAAImsI,EAAKh5N,cAIb64J,EAAO74J,oBACR0ma,GAAeD,EAAgB5tQ,EAAMmgE,YACzC0tM,EACKt1P,QAAQC,QAAQxY,GAElBysO,EAAM5oK,IAAI7jE,EAAO74J,kBAGTmwQ,EAAQnwQ,SAIjBmqO,EAAS68J,KAIA7pM,GAAWA,EAAQla,SAAWka,EAAQla,SAAWu7E,eAEzD7/G,oBAEG2lN,EAAMghC,EAAM3gC,QAAAA,kCACC9rM,KAASs3G,EACnBs2J,EAAgB5tQ,EAAMmgE,KAAK0tM,mBACxB7tQ,GAGRsxE,EAAOh0J,KAAK0iF,GANE8rM,KAUlBx6H,EAAO95J,YACAy0B,GACPqlI,EAAO95J,IAAIy0B,aAIPqlI,GAGV//I,IAAK4uI,EAAKh5N,oBACA0ma,GAAeD,EAAgBztM,UACnC0tM,EACKt1P,QAAQC,SAAQ,GAElBi0N,EAAMl7S,IAAI4uI,EAAKh5N,IAGxB8uF,OAAQkqI,EAAKh5N,oBACH0ma,GAAeD,EAAgBztM,UACnC0tM,EACKt1P,QAAQC,UAEVi0N,EAAMx2S,OAAOkqI,EAAKh5N,IAG3B4kW,WAAAA,CAAY6oC,EAAMztY,IACTslY,EAAM1gC,WAAWxrR,EAAOq0T,GAAOz0K,IAASytM,EAAgBztM,GAAK0tM,aAAa1ma,GAGnFqrF,MAAAA,IACSi6S,EAAMj6S,6LCnHnB,aAGA3sF,EAAAC,QAAA,CACAm/Z,aAAA,EACAM,oBAAA,OACAppD,KAAA,SACAgsD,gBAAA,CACAl1U,KAAAltF,EAAA,mBACAuxQ,OAAAvxQ,EAAA,mBACAY,KAAAZ,EAAA,mBACAg8X,UAAAh8X,EAAA,mBACAg3W,KAAAh3W,EAAA,oBAEA89Z,sBAAA,CACA5wU,KAAA,CACA86U,UAAA,GACA5wU,OAAA,GACA+Y,QAAA,GAEAohK,OAAA,CACAgmI,UAAA,EACAngT,OAAA,GACA+Y,QAAA,GAEAvvG,KAAA,CACA22Y,UAAA,EACAngT,OAAA,GACA+Y,QAAA,GAEA6rR,UAAA,CACAub,UAAA,EACAngT,OAAA,GACA+Y,QAAA,GAEA6mQ,KAAA,CACAugC,UAAA,EACAngT,OAAA,GACA+Y,QAAA,4DCtCA,aAEA,MAAAm5N,IACAA,EAAA13M,OAAAA,EAAA24M,QAAAA,EACAv9C,OAAAy4E,QACAA,IAEAzlW,EAAA,uBACAw6E,EAAAx6E,EAAA,aACA62E,EAAA72E,EAAA,UACA2lW,EAAA3lW,EAAA,WAsRAF,EAAAC,QAtQA,cAAAwqU,EAQAjnU,YAAAlE,EAAAouK,GACAx7C,QACAvlB,KAAArtG,KAAAA,EACAqtG,KAAA+gE,KAAAA,EAEAA,GAAAA,EAAAo9G,IACAn+K,KAAAw7T,SAAAz6P,EAAAo9G,UACAp9G,EAAAo9G,IAGAn+K,KAAAw7T,SAAAjoa,EAAA,SAIAsD,UACA,OAAA,IAAAkvK,SAAA,CAAAC,EAAAu5B,KACAv/F,KAAAm+K,GAAAn+K,KAAAw7T,SACAx7T,KAAArtG,KACA,IACAqtG,KAAA+gE,KACA06P,cAAA,SACAC,aAAA,IAGAjiU,IACA,GAAAA,EACA,OAAA8lG,EAAA9lG,GAEAusE,EAAAhmE,KAAAm+K,UAMAtnR,aACA,IACAmpG,KAAAm+K,SACAn+K,KAAAm+K,GAAAp+L,OAEAigB,KAAAm+K,SAAAn+K,KAAA27T,UAEA,MAAAliU,GACA,MAAA0rB,EAAA60O,kBAAAvgQ,IAQA5iG,UAAA7B,EAAAtB,GACA,UACAssG,KAAAm+K,GAAA9sD,IAAAr8N,EAAAopG,WAAA1qG,GACA,MAAA+lG,GACA,MAAA0rB,EAAA+0O,mBAAAzgQ,IAQA5iG,UAAA7B,GACA,IAAA03J,EACA,IACAA,QAAA1sD,KAAAm+K,GAAA38L,IAAAxsF,EAAAopG,YACA,MAAA3E,GACA,GAAAA,EAAA++R,SAAA,MAAArzQ,EAAA4zO,cAAAt/P,GACA,MAAA0rB,EAAA+0O,mBAAAzgQ,GAEA,OAAAizD,EAOA71J,UAAA7B,GACA,UACAgrG,KAAAm+K,GAAA38L,IAAAxsF,EAAAopG,YACA,MAAA3E,GACA,GAAAA,EAAA++R,SAAA,OAAA,EACA,MAAA/+R,EAEA,OAAA,EAOA5iG,aAAA7B,GACA,UACAgrG,KAAAm+K,GAAAutI,IAAA12Z,EAAAopG,YACA,MAAA3E,GACA,MAAA0rB,EAAA80O,oBAAAxgQ,IAIA5iG,QACA,OAAAmpG,KAAAm+K,IAAAn+K,KAAAm+K,GAAAn+L,QAMAnpF,QAEA,MAAA+ka,EAAA,GACA,MAAA,CACAvqM,IAAA,CAAAr8N,EAAAtB,KACAkoa,EAAA9wV,KAAA,CACAhE,KAAA,MACA9xE,IAAAA,EAAAopG,WACA1qG,MAAAA,KAGA+vF,OAAAzuF,IACA4ma,EAAA9wV,KAAA,CACAhE,KAAA,MACA9xE,IAAAA,EAAAopG,cAGAi7P,OAAA,IACAr5P,KAAAm+K,GAAAs7G,MAAAmiC,IAQA/ka,MAAAy3G,GACA,IAAAkrP,EAAAx5P,KAAA67T,OAAA,CACAz+T,QAAA,EACAzS,OAAA2jB,EAAA3jB,SAGAkT,MAAA/gB,QAAAwxB,EAAApqB,WACAs1Q,EAAAlrP,EAAApqB,QAAAxe,QAAA,CAAA8zR,EAAA93M,IAAA3zE,EAAAyrR,EAAA93M,IAAA83M,IAGA37P,MAAA/gB,QAAAwxB,EAAAorP,UACAF,EAAAlrP,EAAAorP,OAAAh0R,QAAA,CAAA8zR,EAAA93M,IAAAs3M,EAAAQ,EAAA93M,IAAA83M,IAGA,MAAAz0R,OAAAA,EAAAgwP,MAAAA,GAAAzmN,EACA,GAAAvpC,EAAA,CACA,IAAAoC,EAAA,EACAqyR,EAAAzrR,EAAAyrR,GAAA,IAAAryR,KAAApC,IAOA,OAJAgwP,IACAykC,EAAAN,EAAAM,EAAAzkC,IAGAykC,EAMA3iW,UAAAy3G,GACA,IAAAkrP,EAAApvR,EAAA41B,KAAA67T,OAAA,CACAz+T,QAAA,EACAzS,OAAA2jB,EAAA3jB,UACA,EAAA31F,IAAAA,KAAAA,IAEA6oG,MAAA/gB,QAAAwxB,EAAApqB,WACAs1Q,EAAAlrP,EAAApqB,QAAAxe,QAAA,CAAA8zR,EAAA93M,IAAA3zE,EAAAyrR,EAAA93M,IAAA83M,IAGA37P,MAAA/gB,QAAAwxB,EAAAorP,UACAF,EAAAlrP,EAAAorP,OAAAh0R,QAAA,CAAA8zR,EAAA93M,IAAAs3M,EAAAQ,EAAA93M,IAAA83M,IAGA,MAAAz0R,OAAAA,EAAAgwP,MAAAA,GAAAzmN,EACA,GAAAvpC,EAAA,CACA,IAAAoC,EAAA,EACAqyR,EAAAzrR,EAAAyrR,GAAA,IAAAryR,KAAApC,IAOA,OAJAgwP,IACAykC,EAAAN,EAAAM,EAAAzkC,IAGAykC,EASA3iW,OAAAkqK,GACA,MAAA+6P,EAAA,CACA3na,MAAA,EACA4na,aAAA,EACA3+T,OAAA2jE,EAAA3jE,QAIA,GAAA,MAAA2jE,EAAAp2E,OAAA,CACA,MAAAA,EAAAo2E,EAAAp2E,OAAAyT,WAGA09T,EAAAj8H,IAAAl1M,EAGAmxU,EAAA5ka,GAAAyzF,EAAA,IAGA,OAcAsgL,EAdAjrK,KAAAm+K,GAAA1zH,SAAAqxQ,GAeA,CACAjla,CAAAX,OAAAy6N,eAAA,KACA,CACAvzI,KAAA,IAAA,IAAA2oF,SAAA,CAAAC,EAAAu5B,KACA0rE,EAAA7tL,MAAA,CAAAqc,EAAAzkG,EAAAtB,IACA+lG,EAAA8lG,EAAA9lG,GACA,MAAAzkG,EACAi2Q,EAAAjmM,KAAAy0B,IACA,GAAAA,EAAA,OAAA8lG,EAAA9lG,GACAusE,EAAA,CAAA8D,MAAA,EAAAp2K,WAAAgC,YAGAswK,EAAA,CAAA8D,MAAA,EAAAp2K,MAAA,CAAAsB,IAAA,IAAA6nU,EAAA7nU,GAAA,GAAAtB,MAAAA,UAGAk9N,OAAA,IAAA,IAAA7qD,SAAA,CAAAC,EAAAu5B,KACA0rE,EAAAjmM,KAAAy0B,IACA,GAAAA,EAAA,OAAA8lG,EAAA9lG,GACAusE,EAAA,CAAA8D,MAAA,EAAAp2K,WAAAgC,aAnBA,IAAAu1Q,oICrQA53Q,EAAAC,QAAAC,EAAA,iBAAAA,CAAAA,EAAA,oFCAA,aAEA,MAAAyoa,EAAAzoa,EAAA,WACA+vG,EAAA/vG,EAAA,iBAkCAF,EAAAC,QAhCA,SAAA2oa,GACA,SAAAC,EAAA1zN,EAAA7zM,EAAA0lK,GAWA,MAVA,mBAAAmuC,EACAnuC,EAAAmuC,EACA,mBAAA7zM,IACA0lK,EAAA1lK,GAGA6kF,EAAA7kF,KACAA,EAAA6kF,EAAAgvH,GAAAA,EAAA,IAGAwzN,EAAA14T,EAAA24T,EAAAzzN,EAAA7zM,GAAAA,GAAAA,EAAA0lK,GAGA,SAAA7gF,EAAA02F,GACA,MAAA,iBAAAA,GAAA,OAAAA,EAGA,IAAA,MAAAhxF,IAAA,CAAA,UAAA,UACA,mBAAA+8U,EAAA/8U,KACAg9U,EAAAh9U,GAAA,YAAA9I,GACA6lV,EAAA/8U,MAAA9I,KAOA,OAFA8lV,EAAAnpS,OAAAipS,EAAAjpS,OAEAmpS,wEClCA,aAEA,MAAA72K,EAAA9xP,EAAA,UAAA8xP,aACAotC,EAAAl/R,EAAA,QAAAk/R,SACA0pI,EAAA5oa,EAAA,sBACA6oa,EAAA7oa,EAAA,yBACA8oa,EAAA9oa,EAAA,WACAw/H,EAAAx/H,EAAA,gBACA+oa,EAAA/oa,EAAA,kBACAgpa,EAAAhpa,EAAA,YACAipa,EAAAjpa,EAAA,YAAAipa,YACAx7P,EAAAztK,EAAA,YAAAytK,WAGA4W,EAAArkL,EAAA,eAEAkpa,EAAA1pS,EAAA0pS,WACAC,EAAA3pS,EAAA2pS,UACA/J,EAAA5/R,EAAA4/R,cACAgK,EAAA5pS,EAAA4pS,UACAC,EAAA7pS,EAAA6pS,oBAUA,SAAAC,EAAA1+I,EAAAxpR,EAAA0lK,GACA,KAAAr6D,gBAAA68T,GACA,OAAA,IAAAA,EAAA1+I,EAAAxpR,EAAA0lK,GAGA,IAAA9qF,EAYA,GAVA81K,EAAAznJ,KAAAoC,MACAA,KAAAwrO,gBAAAn/N,EAAAA,GAEA,mBAAA13G,IACA0lK,EAAA1lK,EACAA,EAAA,IAGAA,EAAAA,GAAA,IAEAwpR,GAAA,iBAAAA,EAAA,CAEA,GADA5uM,EAAA,IAAAqtV,EAAA,gEACA,mBAAAviQ,EACA,OAAAud,EAAAvd,EAAA9qF,GAEA,MAAAA,EAGA,GAAA,iBAAA4uM,EAAAxiE,OACA,MAAA,IAAA7iH,MAAA,4CAGAkH,KAAArrG,QAAAqsK,EAAArsK,GACAqrG,KAAA88T,IAAA3+I,EACAn+K,KAAAm+K,GAAA,IAAAg+I,EAAAh+I,GACAn+K,KAAAjgB,KAAAs6E,GAAA,CAAA5gE,IACAA,GAAAuG,KAAA64E,KAAA,QAAAp/E,MAIAuG,KAAAs8T,SAAAA,EAAAt8T,KAAAm+K,GAAAm+I,SAAA,CACA3gN,QAAA,EACAohN,cAAA,EACAC,cAAA,EACAC,UAAA,EACAjnF,SAAA,IAIA,IAAA,MAAA54M,KAAA5pI,OAAAW,KAAA6rG,KAAAs8T,SAAAY,mBACA,MAAAl9T,KAAAo9B,KAGAp9B,KAAAo9B,GAAA,YAAAhnD,GACA,OAAA4pB,KAAAm+K,GAAA/gJ,MAAAhnD,KA8NA,SAAA+mV,EAAAh/I,EAAA9jH,GACA,IAAA8jH,EAAAi/I,eAAAj/I,EAAAk/I,SAEA,OADAzlP,EAAAvd,EAAA,IAAAqiQ,EAAA,0BACA,EA5NAG,EAAAl/T,UAAAk7E,KAAAwsE,EAAA1nJ,UAAAk7E,KACAgkP,EAAAl/T,UAAAipH,KAAAy+B,EAAA1nJ,UAAAipH,KACA6rE,EAAAoqI,EAAAx3K,GAEAw3K,EAAAl/T,UAAA5d,KAAA,SAAAghF,EAAA1G,GAYA,MAXA,mBAAA0G,IACA1G,EAAA0G,EACAA,EAAA,MAGA1G,EAAAkiQ,EAAAe,aAAAjjQ,GAEA0G,IACAA,EAAA/gE,KAAArrG,SAGAqrG,KAAAq9T,UACAzlP,EAAAvd,EAAA,KAAAr6D,MACAq6D,EAAAg7C,SAGAr1G,KAAAo9T,cACAp9T,KAAA4mH,KAAA,QAAA,KAAAvsD,EAAA,KAAAr6D,SACAq6D,EAAAg7C,UAGAr1G,KAAA64E,KAAA,WAEA74E,KAAAm+K,GAAAp+L,KAAAghF,GAAAtnE,IACA,GAAAA,EACA,OAAA4gE,EAAA,IAAAsiQ,EAAAljU,IAEAuG,KAAAm+K,GAAAn+K,KAAA88T,IACAziQ,EAAA,KAAAr6D,MACAA,KAAA64E,KAAA,QACA74E,KAAA64E,KAAA,YAGAxe,EAAAg7C,UAGAwnN,EAAAl/T,UAAA3d,MAAA,SAAAq6E,GAoBA,OAnBAA,EAAAkiQ,EAAAe,aAAAjjQ,GAEAr6D,KAAAq9T,UACAr9T,KAAAm+K,GAAAn+L,OAAA,CAAAyZ,KAAAmL,KACA5E,KAAA64E,KAAA,UACAxe,EAAA5gE,KAAAmL,MAEA5E,KAAA64E,KAAA,WACA74E,KAAAm+K,GAAA,IAAAg+I,EAAAn8T,KAAA88T,MACA98T,KAAAu9T,WACA3lP,EAAAvd,GACA,YAAAr6D,KAAAm+K,GAAAxiE,OACA37G,KAAA4mH,KAAA,SAAAvsD,GACAr6D,KAAAo9T,cACAp9T,KAAA4mH,KAAA,QAAA,KACA5mH,KAAAhgB,MAAAq6E,MAIAA,EAAAg7C,SAGAwnN,EAAAl/T,UAAA0/T,OAAA,WACA,MAAA,SAAAr9T,KAAAm+K,GAAAxiE,QAGAkhN,EAAAl/T,UAAAy/T,WAAA,WACA,MAAA,YAAAp9T,KAAAm+K,GAAAxiE,QAGAkhN,EAAAl/T,UAAA4/T,SAAA,WACA,MAAA,YAAA93V,KAAAu6B,KAAAm+K,GAAAxiE,SAGAkhN,EAAAl/T,UAAAnc,IAAA,SAAAxsF,EAAAL,EAAA0lK,GAIA,OAHAA,EAAAmiQ,EAAA7na,EAAA0lK,GAGA8iQ,EAAAn9T,KAFAq6D,EAAAkiQ,EAAAe,aAAAjjQ,MAMA1lK,EAAAqsK,EAAArsK,GAEAqrG,KAAAm+K,GAAA38L,IAAAxsF,EAAAL,GAAA,SAAA8kG,EAAA/lG,GACA,GAAA+lG,EAMA,OAJAA,EADA,YAAAh0B,KAAAg0B,IAAAA,EAAA++R,SACA,IAAAm6B,EAAA,8BAAA39Z,EAAA,IAAAykG,GAEA,IAAAijU,EAAAjjU,GAEA4gE,EAAA5gE,GAEA4gE,EAAA,KAAA3mK,OAdA2mK,EAAAg7C,SAoBAwnN,EAAAl/T,UAAA0zH,IAAA,SAAAr8N,EAAAtB,EAAAiB,EAAA0lK,GAIA,OAHAA,EAAAmiQ,EAAA7na,EAAA0lK,GAGA8iQ,EAAAn9T,KAFAq6D,EAAAkiQ,EAAAe,aAAAjjQ,MAMA1lK,EAAAqsK,EAAArsK,GAEAqrG,KAAAm+K,GAAA9sD,IAAAr8N,EAAAtB,EAAAiB,GAAA8kG,IACA,GAAAA,EACA,OAAA4gE,EAAA,IAAAoiQ,EAAAhjU,IAEAuG,KAAA64E,KAAA,MAAA7jL,EAAAtB,GACA2mK,QAVAA,EAAAg7C,SAgBAwnN,EAAAl/T,UAAA+tT,IAAA,SAAA12Z,EAAAL,EAAA0lK,GAIA,OAHAA,EAAAmiQ,EAAA7na,EAAA0lK,GAGA8iQ,EAAAn9T,KAFAq6D,EAAAkiQ,EAAAe,aAAAjjQ,MAMA1lK,EAAAqsK,EAAArsK,GAEAqrG,KAAAm+K,GAAAutI,IAAA12Z,EAAAL,GAAA8kG,IACA,GAAAA,EACA,OAAA4gE,EAAA,IAAAoiQ,EAAAhjU,IAEAuG,KAAA64E,KAAA,MAAA7jL,GACAqlK,QAVAA,EAAAg7C,SAgBAwnN,EAAAl/T,UAAA87R,MAAA,SAAA78R,EAAAjoG,EAAA0lK,GACA,OAAAhkF,UAAApR,QAIAo1F,EAAA,mBAAAz9D,EAAAA,EACA4/T,EAAA7na,EAAA0lK,GAIA8iQ,EAAAn9T,KAFAq6D,EAAAkiQ,EAAAe,aAAAjjQ,MAMA1lK,EAAAqsK,EAAArsK,GAEAqrG,KAAAm+K,GAAAs7G,MAAA78R,EAAAjoG,GAAA8kG,IACA,GAAAA,EACA,OAAA4gE,EAAA,IAAAoiQ,EAAAhjU,IAEAuG,KAAA64E,KAAA,QAAAj8E,GACAy9D,QAVAA,EAAAg7C,SATA,IAAAgnN,EAAAr8T,OAyBA68T,EAAAl/T,UAAA8sD,SAAA,SAAA91J,GACA,OAAAqrG,KAAAm+K,GAAA1zH,SAAA91J,IAGAkoa,EAAAl/T,UAAAyvD,MAAA,SAAAz4J,EAAA0lK,GAKA,OAJAA,EAAAmiQ,EAAA7na,EAAA0lK,GACA1lK,EAAAqsK,EAAArsK,GAGAwoa,EAAAn9T,KAFAq6D,EAAAkiQ,EAAAe,aAAAjjQ,KAMAr6D,KAAAm+K,GAAA/wH,MAAAz4J,GAAA8kG,IACA,GAAAA,EACA,OAAA4gE,EAAA,IAAAoiQ,EAAAhjU,IAEAuG,KAAA64E,KAAA,QAAAlkL,GACA0lK,OARAA,EAAAg7C,SAcAwnN,EAAAl/T,UAAA6/T,WACAX,EAAAl/T,UAAA8/T,iBAAA,SAAA9oa,GAGA,MADA,iBADAA,EAAAnB,OAAAiqG,OAAA,CAAAtpG,MAAA,EAAAipG,QAAA,GAAAzoG,IACAogU,QAAApgU,EAAAogU,OAAA,GACA,IAAAqnG,EAAAp8T,KAAAm+K,GAAA1zH,SAAA91J,GAAAA,IAGAkoa,EAAAl/T,UAAA+/T,UACAb,EAAAl/T,UAAAggU,gBAAA,SAAAhpa,GACA,OAAAqrG,KAAAy9T,iBAAAjqa,OAAAiqG,OAAA,GAAA9oG,EAAA,CAAAR,MAAA,EAAAipG,QAAA,MAGAy/T,EAAAl/T,UAAAigU,YACAf,EAAAl/T,UAAAkgU,kBAAA,SAAAlpa,GACA,OAAAqrG,KAAAy9T,iBAAAjqa,OAAAiqG,OAAA,GAAA9oG,EAAA,CAAAR,MAAA,EAAAipG,QAAA,MAGAy/T,EAAAl/T,UAAAS,SAAA,WACA,MAAA,WAGAy+T,EAAAl/T,UAAA72B,KAAA,UASA+1V,EAAA9pS,OAAAA,EACA1/H,EAAAC,QAAAupa,uQClSIjwF,EAA4Bp5U,OAAOo5U,2BAAAA,SACF/tO,WAC7B1qG,EAAOX,OAAOW,KAAK0qG,GACnBi/T,EAAAA,GACK32V,EAAI,EAAGA,EAAIhzE,EAAK8wE,OAAQkC,IAC/B22V,EAAY3pa,EAAKgzE,IAAM3zE,OAAOy4U,yBAAyBptO,EAAK1qG,EAAKgzE,WAE5D22V,GAGPC,EAAe,WACnBzqa,EAAQ0jO,OAAS,SAASt1E,OACnB9sJ,EAAS8sJ,GAAAA,SACRo9M,EAAAA,GACK33R,EAAI,EAAGA,EAAIkP,UAAUpR,OAAQkC,IACpC23R,EAAQh0R,KAAKmpN,EAAQ59M,UAAUlP,YAE1B23R,EAAQx0R,KAAK,KAGlBnD,EAAI,UACJiP,EAAOC,UACP+sB,EAAMhtB,EAAKnR,OACXuwB,EAAMnvB,OAAOq7E,GAAGxoE,QAAQ6kV,GAAc,SAASnwT,MACvC,OAANA,EAAM,MAAa,OACnBzmC,GAAKi8B,EAAAA,OAAYwK,SACbA,OACD,YAAavnC,OAAO+P,EAAKjP,UACzB,YAAahB,OAAOiQ,EAAKjP,UACzB,gBAEMU,KAAKC,UAAUsO,EAAKjP,YACpBgU,SACA,4BAGFyyB,MAGJA,EAAIx3B,EAAKjP,GAAIA,EAAIi8B,EAAKwK,EAAIx3B,IAAOjP,GACpC62V,EAAOpwT,KAAOp0B,EAASo0B,GACzBpY,GAAO,IAAMoY,EAEbpY,GAAO,IAAMy+L,EAAQrmL,UAGlBpY,GAOTliG,EAAQ47U,UAAY,SAAStqP,EAAInV,WACR,IAAZqiH,IAAqD,IAA1BA,EAAQmsO,qBACrCr5U,UAIc,IAAZktG,SACF,kBACEx+L,EAAQ47U,UAAUtqP,EAAInV,GAAK2zH,MAAMpjG,KAAM3pB,gBAI9Cw0P,GAAS,SACb,eACOA,EAAAA,IACC/4I,EAAQosO,2BACAplU,MAAMrpB,GACPqiH,EAAQqsO,iBACjBzjU,QAAQ26E,MAAM5lG,GAEdirB,QAAQnrB,MAAME,GAEhBo7P,GAAS,SAEJjmP,EAAGw+G,MAAMpjG,KAAM3pB,iBAOtB+nV,EAAAA,GACAC,EAAgB,KAmCpB,SAAApqI,EAAiBp1L,EAAKkiE,OAEhBkZ,EAAAA,CACFnjF,KAAAA,GACAwnU,QAASC,UAGPloV,UAAUpR,QAAU,IAAGg1G,EAAIg+B,MAAQ5hI,UAAU,IAC7CA,UAAUpR,QAAU,IAAGg1G,EAAI6iL,OAASzmR,UAAU,IAC9C+8F,EAAUrS,GAEZkZ,EAAIukP,WAAaz9P,EACRA,GAETztK,EAAQmra,QAAQxkP,EAAKlZ,GAGnB29P,EAAYzkP,EAAIukP,cAAavkP,EAAIukP,YAAa,GAC9CE,EAAYzkP,EAAIg+B,SAAQh+B,EAAIg+B,MAAQ,GACpCymN,EAAYzkP,EAAI6iL,UAAS7iL,EAAI6iL,QAAS,GACtC4hE,EAAYzkP,EAAI8yJ,iBAAgB9yJ,EAAI8yJ,eAAgB,GACpD9yJ,EAAI6iL,SAAQ7iL,EAAIqkP,QAAUK,GACvBC,EAAY3kP,EAAKp7E,EAAKo7E,EAAIg+B,OAoCnC,SAAA0mN,EAA0BnpU,EAAKqpU,OACzBh6P,EAAQovH,EAAQ54L,OAAOwjU,UAEvBh6P,EACK,KAAYovH,EAAQ6oE,OAAOj4L,GAAO,GAAK,IAAMrvE,EAC7C,KAAYy+L,EAAQ6oE,OAAOj4L,GAAO,GAAK,IAEvCrvE,EAKX,SAAA+oU,EAAwB/oU,EAAKqpU,UACpBrpU,EAeT,SAAAopU,EAAqB3kP,EAAKvmL,EAAOora,MAG3B7kP,EAAI8yJ,eACJr5U,GACA+3F,EAAW/3F,EAAMugS,UAEjBvgS,EAAMugS,UAAY3gS,EAAQ2gS,WAExBvgS,EAAMi5G,aAAej5G,EAAMi5G,YAAYhP,YAAcjqG,GAAAA,KACrDy4F,EAAMz4F,EAAMugS,QAAQ6qI,EAAc7kP,UACjCrlL,EAASu3F,KACZA,EAAMyyU,EAAY3kP,EAAK9tF,EAAK2yU,IAEvB3yU,MAILgjQ,EA+FN,SAAyBl1K,EAAKvmL,MACxBgra,EAAYhra,GAAAA,OACPumL,EAAIqkP,QAAQ,YAAa,gBAC9B1pa,EAASlB,GAAAA,KACP4pK,EAAS,IAAOz1F,KAAKC,UAAUp0E,GAAOwlF,QAAQ,SAAU,IAClBA,QAAQ,KAAM,OACdA,QAAQ,OAAQ,KAAO,WAC1D+gG,EAAIqkP,QAAQhhQ,EAAQ,aAEzByhQ,EAASrra,GAAAA,OACJumL,EAAIqkP,QAAQ,GAAK5qa,EAAO,aAC7B0/K,EAAU1/K,GAAAA,OACLumL,EAAIqkP,QAAQ,GAAK5qa,EAAO,cAE7Bsqa,EAAOtqa,GAAAA,OACFumL,EAAIqkP,QAAQ,OAAQ,QA9GbU,CAAgB/kP,EAAKvmL,MACjCy7V,SACKA,MAILh7V,EAAOX,OAAOW,KAAKT,GACnBura,EApCN,SAAqB/pM,OACf7hH,EAAAA,UAEJ6hH,EAAM9gO,SAAQ,SAASulG,EAAKwO,GAC1BkL,EAAK1Z,IAAO,KAGP0Z,EA6BW6rT,CAAY/qa,MAE1B8lL,EAAIukP,aACNrqa,EAAOX,OAAOy0G,oBAAoBv0G,IAKhCw+V,EAAQx+V,KACJS,EAAKq3E,QAAQ,YAAc,GAAKr3E,EAAKq3E,QAAQ,gBAAkB,UAC9D2zV,EAAYzra,MAID,IAAhBS,EAAK8wE,OAAW,IACdwmB,EAAW/3F,GAAAA,KACTb,EAAOa,EAAMb,KAAO,KAAOa,EAAMb,KAAO,UACrConL,EAAIqkP,QAAQ,YAAczra,EAAO,IAAK,cAE3Cusa,EAAS1ra,UACJumL,EAAIqkP,QAAQtnT,OAAOrZ,UAAUS,SAASR,KAAKlqG,GAAQ,aAExD4oG,EAAO5oG,UACFumL,EAAIqkP,QAAQvgU,KAAKJ,UAAUS,SAASR,KAAKlqG,GAAQ,WAEtDw+V,EAAQx+V,UACHyra,EAAYzra,OA+CnBorO,EA3CA1+F,EAAO,GAAI80F,GAAQ,EAAOmqM,EAAAA,CAAU,IAAK,MAGzCviV,EAAQppF,KACVwhO,GAAQ,EACRmqM,EAAAA,CAAU,IAAK,MAIb5zU,EAAW/3F,MAEb0sI,EAAO,cADC1sI,EAAMb,KAAO,KAAOa,EAAMb,KAAO,IACf,YAIxBusa,EAAS1ra,KACX0sI,EAAO,IAAMppB,OAAOrZ,UAAUS,SAASR,KAAKlqG,IAI1C4oG,EAAO5oG,KACT0sI,EAAO,IAAMriC,KAAKJ,UAAU2hU,YAAY1hU,KAAKlqG,IAI3Cw+V,EAAQx+V,KACV0sI,EAAO,IAAM++R,EAAYzra,IAGP,IAAhBS,EAAK8wE,QAAkBiwJ,GAAyB,GAAhBxhO,EAAMuxE,OAItC65V,EAAe,EACbM,EAAS1ra,GACJumL,EAAIqkP,QAAQtnT,OAAOrZ,UAAUS,SAASR,KAAKlqG,GAAQ,UAEnDumL,EAAIqkP,QAAQ,WAAY,YAInCrkP,EAAInjF,KAAKhsB,KAAKp3E,GAIZorO,EADE5J,EAsCN,SAAqBj7C,EAAKvmL,EAAOora,EAAcG,EAAa9qa,WACtD2qO,EAAAA,GACK33J,EAAI,EAAG4hB,EAAIr1F,EAAMuxE,OAAQkC,EAAI4hB,IAAK5hB,EACrCqzB,EAAe9mG,EAAO2yE,OAAOc,IAC/B23J,EAAOh0J,KAAKy0V,EAAetlP,EAAKvmL,EAAOora,EAAcG,EACjD54V,OAAOc,IAAI,IAEf23J,EAAOh0J,KAAK,WAGhB32E,EAAKC,SAAQ,SAASY,GACfA,EAAIsoF,MAAM,UACbwhJ,EAAOh0J,KAAKy0V,EAAetlP,EAAKvmL,EAAOora,EAAcG,EACjDjqa,GAAK,OAGN8pO,EArDI0gM,CAAYvlP,EAAKvmL,EAAOora,EAAcG,EAAa9qa,GAEnDA,EAAKi2E,KAAI,SAASp1E,UAClBuqa,EAAetlP,EAAKvmL,EAAOora,EAAcG,EAAajqa,EAAKkgO,MAItEj7C,EAAInjF,KAAK7Y,MA6GX,SAA8B6gJ,EAAQ1+F,EAAMi/R,MAE7BvgM,EAAOp5J,QAAO,SAASyX,EAAM8Z,UAEpCA,EAAIzrB,QAAQ,OAAS,GAAGi0V,EACrBtiV,EAAO8Z,EAAI/d,QAAQ,kBAAmB,IAAIjU,OAAS,IACzD,GAEU,UACJo6V,EAAO,IACG,KAATj/R,EAAc,GAAKA,EAAO,OAC3B,IACA0+F,EAAOx0J,KAAK,SACZ,IACA+0V,EAAO,UAGTA,EAAO,GAAKj/R,EAAO,IAAM0+F,EAAOx0J,KAAK,MAAQ,IAAM+0V,EAAO,GA5H1DK,CAAqB5gM,EAAQ1+F,EAAMi/R,IAxBjCA,EAAO,GAAKj/R,EAAOi/R,EAAO,GA+CrC,SAAAF,EAAqBzra,SACZ,IAAMolG,MAAM6E,UAAUS,SAASR,KAAKlqG,GAAS,IAwBtD,SAAA6ra,EAAwBtlP,EAAKvmL,EAAOora,EAAcG,EAAajqa,EAAKkgO,OAC9DriO,EAAM2iG,EAAKmqU,MACfA,EAAOnsa,OAAOy4U,yBAAyBv4U,EAAOsB,IAAAA,CAAUtB,MAAOA,EAAMsB,KAC5DwsF,IAELgU,EADEmqU,EAAKl+U,IACDw4F,EAAIqkP,QAAQ,kBAAmB,WAE/BrkP,EAAIqkP,QAAQ,WAAY,WAG5BqB,EAAKl+U,MACP+T,EAAMykF,EAAIqkP,QAAQ,WAAY,YAG7B9jU,EAAeykU,EAAajqa,KAC/BnC,EAAO,IAAMmC,EAAM,KAEhBwgG,IACCykF,EAAInjF,KAAKtrB,QAAQm0V,EAAKjsa,OAAS,GAE/B8hG,EADEwoU,EAAOc,GACHF,EAAY3kP,EAAK0lP,EAAKjsa,MAAO,MAE7Bkra,EAAY3kP,EAAK0lP,EAAKjsa,MAAOora,EAAe,IAE5CtzV,QAAQ,OAAS,IAErBgqB,EADE0/H,EACI1/H,EAAI1V,MAAM,MAAM1V,KAAI,SAAS6K,SAC1B,KAAOA,KACb3K,KAAK,MAAMzE,OAAO,GAEf,KAAO2vB,EAAI1V,MAAM,MAAM1V,KAAI,SAAS6K,SACjC,MAAQA,KACd3K,KAAK,OAIZkrB,EAAMykF,EAAIqkP,QAAQ,aAAc,YAGhCI,EAAY7ra,GAAAA,IACVqiO,GAASlgO,EAAIsoF,MAAM,gBACdkY,GAET3iG,EAAOg1E,KAAKC,UAAU,GAAK9yE,IAClBsoF,MAAM,iCACbzqF,EAAOA,EAAKgzE,OAAO,EAAGhzE,EAAKoyE,OAAS,GACpCpyE,EAAOonL,EAAIqkP,QAAQzra,EAAM,UAEzBA,EAAOA,EAAKqmF,QAAQ,KAAM,OACdA,QAAQ,OAAQ,KAChBA,QAAQ,WAAY,KAChCrmF,EAAOonL,EAAIqkP,QAAQzra,EAAM,kBAItBA,EAAO,KAAO2iG,EA6BvB,SAAA1Y,EAAiB85P,UACR/4O,MAAM/gB,QAAQ85P,GAIvB,SAAAxjK,EAAmBhsG,SACK,kBAARA,EAIhB,SAAA42V,EAAgB52V,UACC,OAARA,EAST,SAAA23V,EAAkB33V,SACM,iBAARA,EAIhB,SAAAxyE,EAAkBwyE,SACM,iBAARA,EAShB,SAAAs3V,EAAqBt3V,eACZA,IAAAA,EAIT,SAAAg4V,EAAkB5vN,UACTh2H,EAASg2H,IAA8B,oBAAvBrxG,EAAeqxG,GAKxC,SAAAh2H,EAAkBpS,SACM,iBAARA,GAA4B,OAARA,EAIpC,SAAAk1B,EAAgBshC,UACPpkD,EAASokD,IAA4B,kBAAtBz/B,EAAey/B,GAKvC,SAAAs0N,EAAiBn+V,UACRylF,EAASzlF,KACW,mBAAtBoqG,EAAepqG,IAA2BA,aAAa+kG,OAK9D,SAAArN,EAAoBrkB,SACI,mBAARA,EAgBhB,SAAA+2B,EAAwB+xE,UACf18K,OAAOmqG,UAAUS,SAASR,KAAKsyE,GAIxC,SAAAl2E,EAAa/lG,UACJA,EAAI,GAAK,IAAMA,EAAEmqG,SAAS,IAAMnqG,EAAEmqG,SAAS,IAvbpD9qG,EAAQ6wU,SAAW,SAAS1iP,MAC1BA,EAAMA,EAAIiU,eACL0oU,EAAO38U,MACN48U,EAAc54V,KAAKgc,GAAAA,KACjBi4I,EAAM5nC,EAAQ4nC,IAClB0kM,EAAO38U,GAAO,eACRhS,EAAMn8E,EAAQ0jO,OAAO5zB,MAAM9vM,EAAS+iF,WACxCqkB,QAAQnrB,MAAM,YAAakS,EAAKi4I,EAAKjqJ,SAGvC2uV,EAAO38U,GAAO,oBAGX28U,EAAO38U,IAoChBnuF,EAAQ2gS,QAAUA,EAIlBA,EAAQ6oE,OAAAA,CACN8iE,KAAA,CAAU,EAAG,IACbC,OAAA,CAAY,EAAG,IACfC,UAAA,CAAe,EAAG,IAClBC,QAAA,CAAa,EAAG,IAChBC,MAAA,CAAW,GAAI,IACfC,KAAA,CAAU,GAAI,IACdC,MAAA,CAAW,GAAI,IACfC,KAAA,CAAU,GAAI,IACdC,KAAA,CAAU,GAAI,IACdC,MAAA,CAAW,GAAI,IACfC,QAAA,CAAa,GAAI,IACjBpyI,IAAA,CAAS,GAAI,IACbqyI,OAAA,CAAY,GAAI,KAIlBtsI,EAAQ54L,OAAAA,CACNmlU,QAAW,OACX17T,OAAU,SACVwhR,QAAW,SACX5wX,UAAa,OACbowX,KAAQ,OACRnqR,OAAU,QACVu0J,KAAQ,UAERr+I,OAAU,OA+QZv+G,EAAQm+G,MAAQl+G,EAAQ,mBAKxBD,EAAQwpF,QAAUA,EAKlBxpF,EAAQ8/K,UAAYA,EAKpB9/K,EAAQ0qa,OAASA,EAKjB1qa,EAAQmta,kBAHR,SAA2Br5V,UACX,MAAPA,GAOT9zE,EAAQyra,SAAWA,EAKnBzra,EAAQsB,SAAWA,EAKnBtB,EAAQw4E,SAHR,SAAkB1E,SACM,iBAARA,GAOhB9zE,EAAQora,YAAcA,EAKtBpra,EAAQ8ra,SAAWA,EACnB9ra,EAAQm+G,MAAM2tT,SAAWA,EAKzB9ra,EAAQkmF,SAAWA,EAKnBlmF,EAAQgpG,OAASA,EACjBhpG,EAAQm+G,MAAMnV,OAASA,EAMvBhpG,EAAQ4+V,QAAUA,EAClB5+V,EAAQm+G,MAAMivT,cAAgBxuE,EAK9B5+V,EAAQm4F,WAAaA,EAUrBn4F,EAAQqta,YARR,SAAqBv5V,UACJ,OAARA,GACe,kBAARA,GACQ,iBAARA,GACQ,iBAARA,GACQ,iBAARA,QACQ,IAARA,GAIhB9zE,EAAQy3P,SAAWx3P,EAAQ,0BAYvBqta,EAAAA,CAAU,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MACxD,MAAO,MAAO,OAG5B,SAAAC,QACMjjS,EAAAA,IAAQ7/B,KACRq9G,EAAAA,CAAQphH,EAAI4jC,EAAEkjS,YACN9mU,EAAI4jC,EAAEmjS,cACN/mU,EAAI4jC,EAAEojS,eAAe12V,KAAK,YAC9BszD,EAAEqjS,UAAWL,EAAOhjS,EAAEsjS,YAAa9lN,GAAM9wI,KAAK,KAqCxD,SAAAkwB,EAAwBqE,EAAKlmB,UACpBnlF,OAAOmqG,UAAUnD,eAAeoD,KAAKiB,EAAKlmB,GAjCnDrlF,EAAQ+4N,IAAM,WACZ3xH,QAAQ2xH,IAAI,UAAWw0M,IAAavta,EAAQ0jO,OAAO5zB,MAAM9vM,EAAS+iF,aAiBpE/iF,EAAQm/R,SAAWl/R,EAAQ,YAE3BD,EAAQmra,QAAU,SAASpnM,EAAQr4I,OAE5BA,IAAQxF,EAASwF,GAAAA,OAAaq4I,UAE/BljO,EAAOX,OAAOW,KAAK6qF,GACnB7X,EAAIhzE,EAAK8wE,OACNkC,KACLkwJ,EAAOljO,EAAKgzE,IAAM6X,EAAI7qF,EAAKgzE,WAEtBkwJ,OAOL8pM,EAA6C,oBAAXjra,OAAyBA,OAAO,8BAA2BR,EA0DjG,SAAA0ra,EAA+BxrH,EAAQv1J,OAKhCu1J,EAAAA,KACCyrH,EAAAA,IAAgBvoU,MAAM,2CAC1BuoU,EAAUzrH,OAASA,EACnBA,EAASyrH,SAEJhhR,EAAGu1J,GAlEZtiT,EAAQgua,UAAY,SAAmB57U,MACb,mBAAbA,EAAa,MAAA,IACZqf,UAAU,uDAElBo8T,GAA4Bz7U,EAASy7U,GAAAA,KACnCv8U,KACc,mBADdA,EAAKc,EAASy7U,cAENp8T,UAAU,wEAEtBvxG,OAAOC,eAAemxF,EAAIu8U,EAAAA,CACxBzta,MAAOkxF,EAAIma,YAAY,EAAOo3H,UAAU,EAAOr3H,cAAc,IAExDla,EAGT,SAAAA,YACM28U,EAAgBC,EAChBnsN,EAAAA,IAActvC,SAAQ,SAAUC,EAASu5B,GAC3CgiO,EAAiBv7P,EACjBw7P,EAAgBjiO,KAGdnpH,EAAAA,GACKjP,EAAI,EAAGA,EAAIkP,UAAUpR,OAAQkC,IACpCiP,EAAKtL,KAAKuL,UAAUlP,IAEtBiP,EAAKtL,MAAK,SAAU2uB,EAAK/lG,GACnB+lG,EACF+nU,EAAc/nU,GAEd8nU,EAAe7ta,UAKjBgyF,EAAS09G,MAAMpjG,KAAM5pB,SACdqjB,GACP+nU,EAAc/nU,UAGT47G,SAGT7hN,OAAO46T,eAAexpO,EAAIpxF,OAAOywM,eAAev+G,IAE5Cy7U,GAA0B3ta,OAAOC,eAAemxF,EAAIu8U,EAAAA,CACtDzta,MAAOkxF,EAAIma,YAAY,EAAOo3H,UAAU,EAAOr3H,cAAc,IAExDtrG,OAAOq5U,iBACZjoP,EACAgoP,EAA0BlnP,KAI9BpyF,EAAQgua,UAAUxqN,OAASqqN,EAiD3B7ta,EAAQmua,YAlCR,SAAqB/7U,MACK,mBAAbA,YACCqf,UAAU,oDAMtB,SAAA28T,YACMtrV,EAAAA,GACKjP,EAAI,EAAGA,EAAIkP,UAAUpR,OAAQkC,IACpCiP,EAAKtL,KAAKuL,UAAUlP,QAGlBw6V,EAAUvrV,EAAK6H,SACI,mBAAZ0jV,YACC58T,UAAU,kDAElBzF,EAAOU,KACPqgD,EAAK,kBACAshR,EAAQv+N,MAAM9jG,EAAMjpB,YAI7BqP,EAAS09G,MAAMpjG,KAAM5pB,GAClB6nB,MAAK,SAAS9R,GAAO2lG,EAAQla,SAASv3B,EAAG1nD,KAAK,KAAM,KAAMxM,OACrD,SAASy1U,GAAO9vO,EAAQla,SAASwpP,EAAsBzoU,KAAK,KAAMipU,EAAKvhR,cAGjF7sJ,OAAO46T,eAAeszG,EAAelua,OAAOywM,eAAev+G,IAC3DlyF,OAAOq5U,iBAAiB60F,EACA90F,EAA0BlnP,IAC3Cg8U,sHCrsBT,aAEA,IAAAG,EAAAtua,EAAA,gBACAuua,EAAAvua,EAAA,yBACAwua,EAAAxua,EAAA,qBACAyua,EAAAzua,EAAA,kBAEA,SAAA0ua,EAAAvgR,GACA,OAAAA,EAAA9jD,KAAAjF,KAAA+oD,GAGA,IAAAwgR,EAAA,oBAAAlmS,OACAmmS,EAAA,oBAAAjsa,OAEAksa,EAAAH,EAAAzua,OAAAmqG,UAAAS,UAEAikU,EAAAJ,EAAA97V,OAAAw3B,UAAAmxN,SACAwzG,EAAAL,EAAA57V,OAAAs3B,UAAAmxN,SACAyzG,EAAAN,EAAA5kV,QAAAsgB,UAAAmxN,SAEA,GAAAozG,EACA,IAAAM,EAAAP,EAAAjmS,OAAAr+B,UAAAmxN,SAGA,GAAAqzG,EACA,IAAAM,EAAAR,EAAA/ra,OAAAynG,UAAAmxN,SAGA,SAAA4zG,EAAAhva,EAAAiva,GACA,GAAA,iBAAAjva,EACA,OAAA,EAEA,IAEA,OADAiva,EAAAjva,IACA,EACA,MAAAK,GACA,OAAA,GA8FA,SAAA6ua,EAAAlva,GACA,MAAA,iBAAA0ua,EAAA1ua,GAkBA,SAAAmva,EAAAnva,GACA,MAAA,iBAAA0ua,EAAA1ua,GAiBA,SAAAova,EAAApva,GACA,MAAA,qBAAA0ua,EAAA1ua,GAiBA,SAAAqva,EAAArva,GACA,MAAA,qBAAA0ua,EAAA1ua,GAWA,SAAAsva,EAAAtva,GACA,MAAA,yBAAA0ua,EAAA1ua,GAMA,SAAAs/P,EAAAt/P,GACA,MAAA,oBAAAuqO,cAIA+kM,EAAAC,QACAD,EAAAtva,GACAA,aAAAuqO,aAIA,SAAAilM,EAAAxva,GACA,MAAA,sBAAA0ua,EAAA1ua,GAOA,SAAAyva,EAAAzva,GACA,MAAA,oBAAAqgQ,WAIAmvK,EAAAD,QACAC,EAAAxva,GACAA,aAAAqgQ,UA9LAzgQ,EAAAuua,kBAAAA,EACAvua,EAAAwua,oBAAAA,EACAxua,EAAA0ua,aAAAA,EAkBA1ua,EAAA0qG,UAdA,SAAAhP,GACA,MAEA,oBAAA+2E,SACA/2E,aAAA+2E,SAGA,OAAA/2E,GACA,iBAAAA,GACA,mBAAAA,EAAAiP,MACA,mBAAAjP,EAAAkP,OAgBA5qG,EAAA2/P,kBAVA,SAAAv/P,GACA,MAAA,oBAAAuqO,aAAAA,YAAAC,OACAD,YAAAC,OAAAxqO,GAIAsua,EAAAtua,IACAyva,EAAAzva,IASAJ,EAAA64R,aAHA,SAAAz4R,GACA,MAAA,eAAAqua,EAAArua,IAOAJ,EAAA8va,oBAHA,SAAA1va,GACA,MAAA,sBAAAqua,EAAArua,IAOAJ,EAAA+va,cAHA,SAAA3va,GACA,MAAA,gBAAAqua,EAAArua,IAOAJ,EAAAgwa,cAHA,SAAA5va,GACA,MAAA,gBAAAqua,EAAArua,IAOAJ,EAAAiwa,YAHA,SAAA7va,GACA,MAAA,cAAAqua,EAAArua,IAOAJ,EAAAkwa,aAHA,SAAA9va,GACA,MAAA,eAAAqua,EAAArua,IAOAJ,EAAAmwa,aAHA,SAAA/va,GACA,MAAA,eAAAqua,EAAArua,IAOAJ,EAAAowa,eAHA,SAAAhwa,GACA,MAAA,iBAAAqua,EAAArua,IAOAJ,EAAAqwa,eAHA,SAAAjwa,GACA,MAAA,iBAAAqua,EAAArua,IAOAJ,EAAAswa,gBAHA,SAAAlwa,GACA,MAAA,kBAAAqua,EAAArua,IAOAJ,EAAAuwa,iBAHA,SAAAnwa,GACA,MAAA,mBAAAqua,EAAArua,IAOAkva,EAAAK,QACA,oBAAAjgV,KACA4/U,EAAA,IAAA5/U,KAYA1vF,EAAA0pG,MATA,SAAAtpG,GACA,MAAA,oBAAAsvF,MAIA4/U,EAAAK,QACAL,EAAAlva,GACAA,aAAAsvF,MAOA6/U,EAAAI,QACA,oBAAAtkV,KACAkkV,EAAA,IAAAlkV,KAWArrF,EAAA6pG,MATA,SAAAzpG,GACA,MAAA,oBAAAirF,MAIAkkV,EAAAI,QACAJ,EAAAnva,GACAA,aAAAirF,MAOAmkV,EAAAG,QACA,oBAAAlxU,SACA+wU,EAAA,IAAA/wU,SAWAz+F,EAAAwwa,UATA,SAAApwa,GACA,MAAA,oBAAAq+F,UAIA+wU,EAAAG,QACAH,EAAApva,GACAA,aAAAq+F,UAOAgxU,EAAAE,QACA,oBAAAlsU,SACAgsU,EAAA,IAAAhsU,SAKAzjG,EAAAywa,UAHA,SAAArwa,GACA,OAAAqva,EAAArva,IAOAsva,EAAAC,QACA,oBAAAhlM,aACA+kM,EAAA,IAAA/kM,aAWA3qO,EAAA0/P,cAAAA,EAKAkwK,EAAAD,QACA,oBAAAhlM,aACA,oBAAA81B,UACAmvK,EAAA,IAAAnvK,SAAA,IAAA91B,YAAA,GAAA,EAAA,IAWA3qO,EAAA6va,WAAAA,EAGA,IAAAa,EAAA,oBAAAn1G,kBAAAA,uBAAAn5T,EACA,SAAAuua,EAAAvwa,GACA,MAAA,+BAAA0ua,EAAA1ua,GAEA,SAAAwwa,EAAAxwa,GACA,YAAA,IAAAswa,SAIA,IAAAC,EAAAhB,UACAgB,EAAAhB,QAAAgB,EAAA,IAAAD,IAGAC,EAAAhB,QACAgB,EAAAvwa,GACAA,aAAAswa,GA6BA,SAAAG,EAAAzwa,GACA,OAAAgva,EAAAhva,EAAA2ua,GAIA,SAAA+B,EAAA1wa,GACA,OAAAgva,EAAAhva,EAAA4ua,GAIA,SAAA+B,EAAA3wa,GACA,OAAAgva,EAAAhva,EAAA6ua,GAIA,SAAA+B,EAAA5wa,GACA,OAAAwua,GAAAQ,EAAAhva,EAAA8ua,GAIA,SAAA+B,EAAA7wa,GACA,OAAAyua,GAAAO,EAAAhva,EAAA+ua,GAhDAnva,EAAA4wa,oBAAAA,EAKA5wa,EAAAyoK,gBAHA,SAAAroK,GACA,MAAA,2BAAA0ua,EAAA1ua,IAOAJ,EAAAkxa,cAHA,SAAA9wa,GACA,MAAA,0BAAA0ua,EAAA1ua,IAOAJ,EAAAmxa,cAHA,SAAA/wa,GACA,MAAA,0BAAA0ua,EAAA1ua,IAOAJ,EAAAoxa,kBAHA,SAAAhxa,GACA,MAAA,uBAAA0ua,EAAA1ua,IAOAJ,EAAAqxa,4BAHA,SAAAjxa,GACA,MAAA,gCAAA0ua,EAAA1ua,IAOAJ,EAAA6wa,eAAAA,EAKA7wa,EAAA8wa,eAAAA,EAKA9wa,EAAA+wa,gBAAAA,EAKA/wa,EAAAgxa,eAAAA,EAKAhxa,EAAAixa,eAAAA,EAWAjxa,EAAAsxa,iBATA,SAAAlxa,GACA,OACAywa,EAAAzwa,IACA0wa,EAAA1wa,IACA2wa,EAAA3wa,IACA4wa,EAAA5wa,IACA6wa,EAAA7wa,IAWAJ,EAAAuxa,iBANA,SAAAnxa,GACA,MAAA,oBAAA+kO,aACAu6B,EAAAt/P,IACAwwa,EAAAxwa,KAKA,CAAA,UAAA,aAAA,2BAAAU,SAAA,SAAAgpI,GACA5pI,OAAAC,eAAAH,EAAA8pI,EAAA,CACAr+B,YAAA,EACArrG,MAAA,WACA,MAAA,IAAAolG,MAAAskC,EAAA,gLC1UA,aAEA,IAAA0nS,EAAA,mBAAA5ua,QAAA,iBAAAA,OAAAspM,YAGAulO,EAFAxxa,EAAA,sBAEAyxa,CAAA,6BAEAC,EAAA,SAAAvxa,GACA,QAAAoxa,GAAApxa,GAAA,iBAAAA,GAAAwC,OAAAspM,eAAA9rM,IAGA,uBAAAqxa,EAAArxa,IAGAwxa,EAAA,SAAAxxa,GACA,QAAAuxa,EAAAvxa,IAGA,OAAAA,GACA,iBAAAA,GACA,iBAAAA,EAAAuxE,QACAvxE,EAAAuxE,QAAA,GACA,mBAAA8/V,EAAArxa,IACA,sBAAAqxa,EAAArxa,EAAAyiF,SAGAgvV,EAAA,WACA,OAAAF,EAAA5uV,WADA,GAIA4uV,EAAAC,kBAAAA,EAEA7xa,EAAAC,QAAA6xa,EAAAF,EAAAC,6DChCA,aAEA,IAAAE,EAAA7xa,EAAA,iBAEA8xa,EAAA9xa,EAAA,MAEA+xa,EAAAD,EAAAD,EAAA,6BAEA/xa,EAAAC,QAAA,SAAAT,EAAA0ya,GACA,IAAAC,EAAAJ,EAAAvya,IAAA0ya,GACA,MAAA,mBAAAC,GAAAF,EAAAzya,EAAA,gBAAA,EACAwya,EAAAG,GAEAA,qECbA,aAEA,IAAA9va,EAEA+va,EAAA51V,YACA61V,EAAA7va,SACA8va,EAAA5gU,UAGA6gU,EAAA,SAAAC,GACA,IACA,OAAAH,EAAA,yBAAAG,EAAA,iBAAAH,GACA,MAAA3xa,MAGA+xa,EAAAtya,OAAAy4U,yBACA,GAAA65F,EACA,IACAA,EAAA,GAAA,IACA,MAAA/xa,GACA+xa,EAAA,KAIA,IAAAC,EAAA,WACA,MAAA,IAAAJ,GAEAK,EAAAF,EACA,WACA,IAGA,OAAAC,EACA,MAAAE,GACA,IAEA,OAAAH,EAAAzvV,UAAA,UAAAmL,IACA,MAAA0kV,GACA,OAAAH,IAVA,GAcAA,EAEAI,EAAA5ya,EAAA,cAAAA,GAEAywM,EAAAxwM,OAAAywM,gBAAA,SAAAr2F,GAAA,OAAAA,EAAAu1G,WAEAijN,EAAA,GAEAC,EAAA,oBAAA5tM,WAAA/iO,EAAAsuM,EAAAy0B,YAEA6tM,EAAA,CACAC,mBAAA,oBAAAC,eAAA9wa,EAAA8wa,eACAC,UAAA5oU,MACA6oU,gBAAA,oBAAAzoM,YAAAvoO,EAAAuoO,YACA0oM,2BAAAR,EAAAniO,EAAA,GAAA9tM,OAAAu0J,aAAA/0J,EACAkxa,mCAAAlxa,EACAmxa,kBAAAT,EACAU,mBAAAV,EACAW,2BAAAX,EACAY,2BAAAZ,EACAa,YAAA,oBAAAC,QAAAxxa,EAAAwxa,QACAC,WAAA,oBAAAnrS,OAAAtmI,EAAAsmI,OACAorS,YAAA/pV,QACAgqV,aAAA,oBAAAtzK,SAAAr+P,EAAAq+P,SACAuzK,SAAAvpU,KACAwpU,cAAAC,UACAC,uBAAA1zN,mBACA2zN,cAAA/zN,UACAg0N,uBAAAvwK,mBACAwwK,UAAA9uU,MACA+uU,SAAA99K,KACA+9K,cAAAC,UACAC,iBAAA,oBAAAtgL,aAAAhyP,EAAAgyP,aACAugL,iBAAA,oBAAAh/K,aAAAvzP,EAAAuzP,aACAi/K,yBAAA,oBAAAC,qBAAAzya,EAAAyya,qBACAC,aAAA1C,EACA2C,sBAAAjC,EACAkC,cAAA,oBAAAj1B,UAAA39Y,EAAA29Y,UACAk1B,eAAA,oBAAAj1B,WAAA59Y,EAAA49Y,WACAk1B,eAAA,oBAAAj3B,WAAA77Y,EAAA67Y,WACAk3B,aAAA/iL,SACAgjL,UAAAxpU,MACAypU,sBAAAxC,EAAAniO,EAAAA,EAAA,GAAA9tM,OAAAu0J,cAAA/0J,EACAkza,SAAA,iBAAA/gW,KAAAA,KAAAnyE,EACAmza,QAAA,oBAAA7lV,IAAAttF,EAAAstF,IACA8lV,yBAAA,oBAAA9lV,KAAAmjV,EAAAniO,GAAA,IAAAhhH,KAAA9sF,OAAAu0J,aAAA/0J,EACAqza,SAAAnjW,KACAojW,WAAA7iW,OACA8iW,WAAAz1a,OACA01a,eAAAjqU,WACAkqU,aAAA/iW,SACAgjW,YAAA,oBAAArjQ,QAAArwK,EAAAqwK,QACAsjQ,UAAA,oBAAAxsO,MAAAnnM,EAAAmnM,MACAysO,eAAA/pM,WACAgqM,mBAAAC,eACAC,YAAA,oBAAA//O,QAAAh0L,EAAAg0L,QACAggP,WAAA1yT,OACA2yT,QAAA,oBAAAhrV,IAAAjpF,EAAAipF,IACAirV,yBAAA,oBAAAjrV,KAAAwnV,EAAAniO,GAAA,IAAArlH,KAAAzoF,OAAAu0J,aAAA/0J,EACAm0a,sBAAA,oBAAAh7G,kBAAAn5T,EAAAm5T,kBACAi7G,WAAAzjW,OACA0jW,4BAAA5D,EAAAniO,EAAA,GAAA9tM,OAAAu0J,aAAA/0J,EACAs0a,WAAA7D,EAAAjwa,OAAAR,EACAu0a,gBAAAxE,EACAyE,mBAAAlE,EACAmE,eAAA9D,EACA+D,cAAAzE,EACA0E,eAAA,oBAAA5xM,WAAA/iO,EAAA+iO,WACA6xM,sBAAA,oBAAAh2B,kBAAA5+Y,EAAA4+Y,kBACAi2B,gBAAA,oBAAA70K,YAAAhgQ,EAAAggQ,YACA80K,gBAAA,oBAAA97J,YAAAh5Q,EAAAg5Q,YACA+7J,aAAAC,SACAC,YAAA,oBAAA54U,QAAAr8F,EAAAq8F,QACA64U,YAAA,oBAAAC,QAAAn1a,EAAAm1a,QACAC,YAAA,oBAAA/zU,QAAArhG,EAAAqhG,SAGAg0U,EAAA,SAAAA,EAAAl4a,GACA,IAAAa,EACA,GAAA,oBAAAb,EACAa,EAAAkya,EAAA,6BACA,GAAA,wBAAA/ya,EACAa,EAAAkya,EAAA,wBACA,GAAA,6BAAA/ya,EACAa,EAAAkya,EAAA,8BACA,GAAA,qBAAA/ya,EAAA,CACA,IAAA+xF,EAAAmmV,EAAA,4BACAnmV,IACAlxF,EAAAkxF,EAAA+Y,gBAEA,GAAA,6BAAA9qG,EAAA,CACA,IAAA20V,EAAAujF,EAAA,oBACAvjF,IACA9zV,EAAAswM,EAAAwjJ,EAAA7pP,YAMA,OAFA2oU,EAAAzza,GAAAa,EAEAA,GAGAs3a,EAAA,CACAC,yBAAA,CAAA,cAAA,aACAC,mBAAA,CAAA,QAAA,aACAC,uBAAA,CAAA,QAAA,YAAA,WACAC,uBAAA,CAAA,QAAA,YAAA,WACAC,oBAAA,CAAA,QAAA,YAAA,QACAC,sBAAA,CAAA,QAAA,YAAA,UACAC,2BAAA,CAAA,gBAAA,aACAzE,mBAAA,CAAA,yBAAA,aACA0E,4BAAA,CAAA,yBAAA,YAAA,aACAC,qBAAA,CAAA,UAAA,aACAC,sBAAA,CAAA,WAAA,aACAC,kBAAA,CAAA,OAAA,aACAC,mBAAA,CAAA,QAAA,aACAC,uBAAA,CAAA,YAAA,aACAC,0BAAA,CAAA,eAAA,aACAC,0BAAA,CAAA,eAAA,aACAC,sBAAA,CAAA,WAAA,aACAC,cAAA,CAAA,oBAAA,aACAC,uBAAA,CAAA,oBAAA,YAAA,aACAC,uBAAA,CAAA,YAAA,aACAC,wBAAA,CAAA,aAAA,aACAC,wBAAA,CAAA,aAAA,aACAC,cAAA,CAAA,OAAA,SACAC,kBAAA,CAAA,OAAA,aACAC,iBAAA,CAAA,MAAA,aACAC,oBAAA,CAAA,SAAA,aACAC,oBAAA,CAAA,SAAA,aACAC,sBAAA,CAAA,SAAA,YAAA,YACAC,qBAAA,CAAA,SAAA,YAAA,WACAC,qBAAA,CAAA,UAAA,aACAC,sBAAA,CAAA,UAAA,YAAA,QACAC,gBAAA,CAAA,UAAA,OACAC,mBAAA,CAAA,UAAA,UACAC,oBAAA,CAAA,UAAA,WACAC,wBAAA,CAAA,aAAA,aACAC,4BAAA,CAAA,iBAAA,aACAC,oBAAA,CAAA,SAAA,aACAC,iBAAA,CAAA,MAAA,aACAC,+BAAA,CAAA,oBAAA,aACAC,oBAAA,CAAA,SAAA,aACAC,oBAAA,CAAA,SAAA,aACAC,yBAAA,CAAA,cAAA,aACAC,wBAAA,CAAA,aAAA,aACAC,uBAAA,CAAA,YAAA,aACAC,wBAAA,CAAA,aAAA,aACAC,+BAAA,CAAA,oBAAA,aACAC,yBAAA,CAAA,cAAA,aACAC,yBAAA,CAAA,cAAA,aACAC,sBAAA,CAAA,WAAA,aACAC,qBAAA,CAAA,UAAA,aACAC,qBAAA,CAAA,UAAA,cAGAv1U,EAAAplG,EAAA,iBACAw2F,EAAAx2F,EAAA,OACA46a,EAAAx1U,EAAAiF,KAAA/nG,SAAA+nG,KAAAC,MAAAF,UAAA9L,QACAu8U,EAAAz1U,EAAAiF,KAAA/nG,SAAAutM,MAAAvlG,MAAAF,UAAAlzB,QACA4jW,EAAA11U,EAAAiF,KAAA/nG,SAAA+nG,KAAAv3B,OAAAs3B,UAAAzkB,SACAo1V,EAAA31U,EAAAiF,KAAA/nG,SAAA+nG,KAAAv3B,OAAAs3B,UAAAv4B,OAGAmpW,EAAA,qGACAC,EAAA,WACAC,EAAA,SAAA9yU,GACA,IAAA9iB,EAAAy1V,EAAA3yU,EAAA,EAAA,GACA5f,EAAAuyV,EAAA3yU,GAAA,GACA,GAAA,MAAA9iB,GAAA,MAAAkD,EACA,MAAA,IAAA0pV,EAAA,kDACA,GAAA,MAAA1pV,GAAA,MAAAlD,EACA,MAAA,IAAA4sV,EAAA,kDAEA,IAAA76V,EAAA,GAIA,OAHAyjW,EAAA1yU,EAAA4yU,GAAA,SAAAjxV,EAAAwnB,EAAA3lB,EAAAuvV,GACA9jW,EAAAA,EAAA3F,QAAAka,EAAAkvV,EAAAK,EAAAF,EAAA,MAAA1pU,GAAAxnB,KAEA1S,GAIA+jW,EAAA,SAAA97a,EAAA0ya,GACA,IACAj1N,EADAs+N,EAAA/7a,EAOA,GALAk3F,EAAAihV,EAAA4D,KAEAA,EAAA,KADAt+N,EAAA06N,EAAA4D,IACA,GAAA,KAGA7kV,EAAAu8U,EAAAsI,GAAA,CACA,IAAAl7a,EAAA4ya,EAAAsI,GAIA,GAHAl7a,IAAA0ya,IACA1ya,EAAAq3a,EAAA6D,SAEA,IAAAl7a,IAAA6xa,EACA,MAAA,IAAAI,EAAA,aAAA9ya,EAAA,wDAGA,MAAA,CACAy9M,MAAAA,EACAz9M,KAAA+7a,EACAl7a,MAAAA,GAIA,MAAA,IAAA+xa,EAAA,aAAA5ya,EAAA,qBAGAQ,EAAAC,QAAA,SAAAT,EAAA0ya,GACA,GAAA,iBAAA1ya,GAAA,IAAAA,EAAAoyE,OACA,MAAA,IAAA0gW,EAAA,6CAEA,GAAAtvV,UAAApR,OAAA,GAAA,kBAAAsgW,EACA,MAAA,IAAAI,EAAA,6CAGA,IAAA1/T,EAAAwoU,EAAA57a,GACAg8a,EAAA5oU,EAAAhhC,OAAA,EAAAghC,EAAA,GAAA,GAEAu/T,EAAAmJ,EAAA,IAAAE,EAAA,IAAAtJ,GACAuJ,EAAAtJ,EAAA3ya,KACAa,EAAA8xa,EAAA9xa,MACAq7a,GAAA,EAEAz+N,EAAAk1N,EAAAl1N,MACAA,IACAu+N,EAAAv+N,EAAA,GACA89N,EAAAnoU,EAAAkoU,EAAA,CAAA,EAAA,GAAA79N,KAGA,IAAA,IAAAnpI,EAAA,EAAA6nW,GAAA,EAAA7nW,EAAA8+B,EAAAhhC,OAAAkC,GAAA,EAAA,CACA,IAAA4+B,EAAAE,EAAA9+B,GACA0R,EAAAy1V,EAAAvoU,EAAA,EAAA,GACAhqB,EAAAuyV,EAAAvoU,GAAA,GACA,IAEA,MAAAltB,GAAA,MAAAA,GAAA,MAAAA,GACA,MAAAkD,GAAA,MAAAA,GAAA,MAAAA,IAEAlD,IAAAkD,EAEA,MAAA,IAAA0pV,EAAA,wDASA,GAPA,gBAAA1/T,GAAAipU,IACAD,GAAA,GAMAhlV,EAAAu8U,EAFAwI,EAAA,KADAD,GAAA,IAAA9oU,GACA,KAGAryG,EAAA4ya,EAAAwI,QACA,GAAA,MAAAp7a,EAAA,CACA,KAAAqyG,KAAAryG,GAAA,CACA,IAAA6xa,EACA,MAAA,IAAAI,EAAA,sBAAA9ya,EAAA,+CAEA,OAEA,GAAAiza,GAAA3+V,EAAA,GAAA8+B,EAAAhhC,OAAA,CACA,IAAA06V,EAAAmG,EAAApya,EAAAqyG,GAWAryG,GAVAs7a,IAAArP,IASA,QAAAA,KAAA,kBAAAA,EAAAn+U,KACAm+U,EAAAn+U,IAEA9tF,EAAAqyG,QAGAipU,EAAAjlV,EAAAr2F,EAAAqyG,GACAryG,EAAAA,EAAAqyG,GAGAipU,IAAAD,IACAzI,EAAAwI,GAAAp7a,IAIA,OAAAA,0FCxUA,aAEA,IAAAu7a,EAAA,oBAAA/4a,QAAAA,OACAg5a,EAAA37a,EAAA,WAEAF,EAAAC,QAAA,WACA,MAAA,mBAAA27a,IACA,mBAAA/4a,SACA,iBAAA+4a,EAAA,SACA,iBAAA/4a,OAAA,QAEAg5a,uDCXA,aAGA77a,EAAAC,QAAA,WACA,GAAA,mBAAA4C,QAAA,mBAAA1C,OAAA+lG,sBAAA,OAAA,EACA,GAAA,iBAAArjG,OAAAu0J,SAAA,OAAA,EAEA,IAAA5rD,EAAA,GACAmtO,EAAA91U,OAAA,QACAi5a,EAAA37a,OAAAw4U,GACA,GAAA,iBAAAA,EAAA,OAAA,EAEA,GAAA,oBAAAx4U,OAAAmqG,UAAAS,SAAAR,KAAAouO,GAAA,OAAA,EACA,GAAA,oBAAAx4U,OAAAmqG,UAAAS,SAAAR,KAAAuxU,GAAA,OAAA,EAYA,IAAAnjG,KADAntO,EAAAmtO,GADA,GAEAntO,EAAA,OAAA,EACA,GAAA,mBAAArrG,OAAAW,MAAA,IAAAX,OAAAW,KAAA0qG,GAAA55B,OAAA,OAAA,EAEA,GAAA,mBAAAzxE,OAAAy0G,qBAAA,IAAAz0G,OAAAy0G,oBAAApJ,GAAA55B,OAAA,OAAA,EAEA,IAAAmqW,EAAA57a,OAAA+lG,sBAAAsF,GACA,GAAA,IAAAuwU,EAAAnqW,QAAAmqW,EAAA,KAAApjG,EAAA,OAAA,EAEA,IAAAx4U,OAAAmqG,UAAAu4H,qBAAAt4H,KAAAiB,EAAAmtO,GAAA,OAAA,EAEA,GAAA,mBAAAx4U,OAAAy4U,yBAAA,CACA,IAAAnsL,EAAAtsJ,OAAAy4U,yBAAAptO,EAAAmtO,GACA,GAdA,KAcAlsL,EAAApsJ,QAAA,IAAAosJ,EAAA/gD,WAAA,OAAA,EAGA,OAAA,iCCxCA,aAEA,IAAAsmT,EAAA9xZ,EAAA,oBAEAF,EAAAC,QAAAuC,SAAA8nG,UAAAhF,MAAA0sT,wDCJA,aAIA,IAAAgqB,EAAA,kDACAjqW,EAAAy4B,MAAAF,UAAAv4B,MACAkqW,EAAA97a,OAAAmqG,UAAAS,SACAmxU,EAAA,oBAEAl8a,EAAAC,QAAA,SAAAk3U,GACA,IAAAp/J,EAAAprE,KACA,GAAA,mBAAAorE,GAAAkkQ,EAAA1xU,KAAAwtE,KAAAmkQ,EACA,MAAA,IAAAxqU,UAAAsqU,EAAAjkQ,GAyBA,IAvBA,IAEA3iC,EAFAryD,EAAAhR,EAAAw4B,KAAAvnB,UAAA,GAGAm5V,EAAA,WACA,GAAAxvU,gBAAAyoC,EAAA,CACA,IAAA79D,EAAAwgG,EAAAg4B,MACApjG,KACA5pB,EAAAyb,OAAAzsB,EAAAw4B,KAAAvnB,aAEA,OAAA7iF,OAAAo3E,KAAAA,EACAA,EAEAo1B,KAEA,OAAAorE,EAAAg4B,MACAonI,EACAp0P,EAAAyb,OAAAzsB,EAAAw4B,KAAAvnB,cAKAo5V,EAAA7pW,KAAAD,IAAA,EAAAylG,EAAAnmG,OAAAmR,EAAAnR,QACAyqW,EAAA,GACAvoW,EAAA,EAAAA,EAAAsoW,EAAAtoW,IACAuoW,EAAA5kW,KAAA,IAAA3D,GAKA,GAFAshE,EAAA5yI,SAAA,SAAA,oBAAA65a,EAAAplW,KAAA,KAAA,4CAAAz0E,CAAA25a,GAEApkQ,EAAAztE,UAAA,CACA,IAAAgyU,EAAA,aACAA,EAAAhyU,UAAAytE,EAAAztE,UACA8qC,EAAA9qC,UAAA,IAAAgyU,EACAA,EAAAhyU,UAAA,KAGA,OAAA8qC,+BClDA,aAEA,IAAA9vC,EAAAplG,EAAA,iBAEAF,EAAAC,QAAAqlG,EAAAiF,KAAA/nG,SAAA+nG,KAAApqG,OAAAmqG,UAAAnD,qECJA,aAEA,IAAA7B,EAAAplG,EAAA,iBACA6xa,EAAA7xa,EAAA,iBAEAq8a,EAAAxK,EAAA,8BACAyK,EAAAzK,EAAA,6BACA0K,EAAA1K,EAAA,mBAAA,IAAAzsU,EAAAiF,KAAAiyU,EAAAD,GAEA9J,EAAAV,EAAA,qCAAA,GACA2K,EAAA3K,EAAA,2BAAA,GACA4K,EAAA5K,EAAA,cAEA,GAAA2K,EACA,IACAA,EAAA,GAAA,IAAA,CAAAr8a,MAAA,IACA,MAAAK,GAEAg8a,EAAA,KAIA18a,EAAAC,QAAA,SAAA28a,GACA,IAAA93K,EAAA23K,EAAAn3U,EAAAk3U,EAAAx5V,WACA,GAAAyvV,GAAAiK,EAAA,CACA,IAAApQ,EAAAmG,EAAA3tK,EAAA,UACAwnK,EAAA7gU,cAEAixU,EACA53K,EACA,SACA,CAAAzkQ,MAAA,EAAAs8a,EAAA,EAAAC,EAAAhrW,QAAAoR,UAAApR,OAAA,MAIA,OAAAkzL,GAGA,IAAA+3K,EAAA,WACA,OAAAJ,EAAAn3U,EAAAi3U,EAAAv5V,YAGA05V,EACAA,EAAA18a,EAAAC,QAAA,QAAA,CAAAI,MAAAw8a,IAEA78a,EAAAC,QAAA8vM,MAAA8sO,+EC7CA,aAEA,IAcAC,EAdAb,EAAA97a,OAAAmqG,UAAAS,SACAgyU,EAAAv6a,SAAA8nG,UAAAS,SACAiyU,EAAA,sBACAvL,EAAA,mBAAA5ua,QAAA,iBAAAA,OAAAspM,YACAwE,EAAAxwM,OAAAywM,eAYA5wM,EAAAC,QAAA,SAAAsxF,GACA,GAAA,mBAAAA,EACA,OAAA,EAEA,GAAAyrV,EAAA5qW,KAAA2qW,EAAAxyU,KAAAhZ,IACA,OAAA,EAEA,IAAAkgV,EAEA,MAAA,+BADAwK,EAAA1xU,KAAAhZ,GAGA,IAAAo/G,EACA,OAAA,EAEA,QAAA,IAAAmsO,EAAA,CACA,IAAAG,EA1BA,WACA,IAAAxL,EACA,OAAA,EAEA,IACA,OAAAjva,SAAA,wBAAAA,GACA,MAAA9B,KAoBAw8a,GACAJ,IAAAG,GAAAtsO,EAAAssO,GAEA,OAAAtsO,EAAAp/G,KAAAurV,iCCpCA,gCAEI/7a,EAAUb,EAAQ,WAClBi9a,EAAuBj9a,EAAQ,0BAC/Byxa,EAAYzxa,EAAQ,uBAEpBwxa,EAAYC,EAAU,6BACtBmB,EAAa5ya,EAAQ,cAARA,GACbuxa,EAAiBqB,GAA4C,iBAAvBjwa,OAAOspM,YAE7CixO,EAAcD,IAEdE,EAAS1L,EAAU,0BACnB2L,EAAAA,GACAC,EAAOr9a,EAAQ,gDACf0wM,EAAiBzwM,OAAOywM,eACxB6gO,GAAkB8L,GAAQ3sO,GAC7B7vM,EAAQq8a,GAAa,SAAUI,MACI,mBAAvBrxU,EAAOqxU,GAAgB,KAC7Bj0U,EAAAA,IAAU4C,EAAOqxU,QACf36a,OAAOspM,eAAe5iG,aACjBmrU,UAAU,uDAAyD8I,EAAa,wDAEvFxmS,EAAQ45D,EAAernG,GACvBkjD,EAAa8wR,EAAKvmS,EAAOn0I,OAAOspM,iBAC/B1/C,EAAAA,KACAqiM,EAAal+I,EAAe55D,GAChCyV,EAAa8wR,EAAKzuF,EAAYjsV,OAAOspM,aAEtCmxO,EAAUE,GAAc/wR,EAAWt+D,YAKlCsvV,EAAiB,SAA2Bp9a,OAC3Cq9a,GAAY,SAChB38a,EAAQu8a,GAAW,SAAUj8P,EAAQm8P,OAC/BE,UAECl+a,EAAO6hL,EAAO92E,KAAKlqG,GACnBb,IAASg+a,IACZE,EAAYl+a,SAELkB,QAGJg9a,GAGJ/O,EAAezua,EAAQ,kBAE3BF,EAAOC,QAAU,SAAyBI,WACpCsua,EAAatua,KACboxa,EACEgM,EAAep9a,GADQg9a,EAAO3L,EAAUrxa,GAAQ,GAAI,qNCpD5D,IAAAq2F,EAAAv2F,OAAAmqG,UAAAnD,eACA4D,EAAA5qG,OAAAmqG,UAAAS,SAEA/qG,EAAAC,QAAA,SAAAurG,EAAAja,EAAAq1F,GACA,GAAA,sBAAA77E,EAAAR,KAAAhZ,GACA,MAAA,IAAAmgB,UAAA,+BAEA,IAAAhc,EAAA8V,EAAA55B,OACA,GAAA8jB,KAAAA,EACA,IAAA,IAAA5hB,EAAA,EAAAA,EAAA4hB,EAAA5hB,IACAyd,EAAAgZ,KAAAq8E,EAAAp7E,EAAA13B,GAAAA,EAAA03B,QAGA,IAAA,IAAAxqG,KAAAwqG,EACA9U,EAAA6T,KAAAiB,EAAAxqG,IACAuwF,EAAAgZ,KAAAq8E,EAAAp7E,EAAAxqG,GAAAA,EAAAwqG,kCChBA,gCAEImyU,EAAAA,CACH,gBACA,iBACA,eACA,eACA,aACA,aACA,YACA,cACA,cACA,aACA,qBAGD39a,EAAOC,QAAU,mBACZytI,EAAAA,GACK55D,EAAI,EAAGA,EAAI6pW,EAAc/rW,OAAQkC,IACD,mBAA7Bq4B,EAAOwxU,EAAc7pW,MAC/B45D,EAAIA,EAAI97D,QAAU+rW,EAAc7pW,WAG3B45D,iCCvBR,aAEA,IAEA+kS,EAFAvya,EAAA,gBAEA6xa,CAAA,qCACA,GAAAU,EACA,IACAA,EAAA,GAAA,UACA,MAAA/xa,GAEA+xa,EAAA,KAIAzya,EAAAC,QAAAwya,uDCdA,gCAEI1xa,EAAUb,EAAQ,WAClBi9a,EAAuBj9a,EAAQ,0BAC/Byxa,EAAYzxa,EAAQ,uBAEpBwxa,EAAYC,EAAU,6BACtBmB,EAAa5ya,EAAQ,cAARA,GACbuxa,EAAiBqB,GAA4C,iBAAvBjwa,OAAOspM,YAE7CixO,EAAcD,IAEdlL,EAAWN,EAAU,2BAA2B,IAAA,SAA0B9vM,EAAOxhO,WAC3EyzE,EAAI,EAAGA,EAAI+tJ,EAAMjwJ,OAAQkC,GAAK,KAClC+tJ,EAAM/tJ,KAAOzzE,SACTyzE,SAGD,GAELupW,EAAS1L,EAAU,0BACnB2L,EAAAA,GACAC,EAAOr9a,EAAQ,gDACf0wM,EAAiBzwM,OAAOywM,eACxB6gO,GAAkB8L,GAAQ3sO,GAC7B7vM,EAAQq8a,GAAa,SAAUI,OAC1Bj0U,EAAAA,IAAU4C,EAAOqxU,QACf36a,OAAOspM,eAAe5iG,aACjBmrU,UAAU,uDAAyD8I,EAAa,wDAEvFxmS,EAAQ45D,EAAernG,GACvBkjD,EAAa8wR,EAAKvmS,EAAOn0I,OAAOspM,iBAC/B1/C,EAAAA,KACAqiM,EAAal+I,EAAe55D,GAChCyV,EAAa8wR,EAAKzuF,EAAYjsV,OAAOspM,aAEtCmxO,EAAUE,GAAc/wR,EAAWt+D,WAIjCsvV,EAAiB,SAA2Bp9a,OAC3Cu9a,GAAU,SACd78a,EAAQu8a,GAAW,SAAUj8P,EAAQm8P,OAC/BI,MAEHA,EAAUv8P,EAAO92E,KAAKlqG,KAAWm9a,QACzB98a,QAGJk9a,GAGR59a,EAAOC,QAAU,SAAsBI,OACjCA,GAA0B,iBAAVA,SAA6B,MAC7Coxa,EAAAA,KACAtgW,EAAMksW,EAAO3L,EAAUrxa,GAAQ,GAAI,UAChC4xa,EAASmL,EAAajsW,IAAQ,UAEjCosW,GACEE,EAAep9a,6LC3DvBL,EAAAC,QAAA,SAAA8zE,GACA,OAAAA,GAAA,iBAAAA,GACA,mBAAAA,EAAAnqE,MACA,mBAAAmqE,EAAAoqN,MACA,mBAAApqN,EAAA+rP,yCCJA,aAEA,MAAA+9G,EAAA39a,EAAA,sBAAA29a,kBACAz+I,EAAAl/R,EAAA,YACA49a,EAAA59a,EAAA,uBACA69a,EAAA,0BAAAtxV,MAAA,KACAuxV,EAAA,+BAAAvxV,MAAA,KAEA,SAAAq8U,EAAAh+I,GACA+yJ,EAAAtzU,KAAAoC,KAAAm+K,EAAAm+I,UAAA,IAIA,IAAA,MAAAp9U,KAAAmyV,EACA,mBAAAlzJ,EAAAj/L,IAAA8gB,KAAAs8T,SAAAY,kBAAAh+U,KACA8gB,KAAAs8T,SAAAY,kBAAAh+U,IAAA,GAIA8gB,KAAA88T,IAAA3+I,EACAn+K,KAAAsxU,YAAA,GAEAx7F,EAAA91O,MAgDA,SAAA81O,EAAAx2O,GACA,IAAA,MAAApgB,KAAAkyV,EACA9xU,EAAA,IAAApgB,GAAA,YAAA9I,GACA4pB,KAAAsxU,YAAAxmW,KAAA,CAAAsyD,OAAAl+C,EAAA9I,KAAAA,KAIA,IAAA,MAAA8I,KAAA1rF,OAAAW,KAAAmrG,EAAAg9T,SAAAY,mBACA59T,EAAApgB,GAAA,YAAA9I,GACA4pB,KAAAsxU,YAAAxmW,KAAA,CAAAsyD,OAAAl+C,EAAA9I,KAAAA,KAIAkpB,EAAAiyU,UAAA,SAAA58a,GACA,MAAA6kW,EAAA,IAAA23E,EAAA7xU,EAAA3qG,GAEA,OADAqrG,KAAAsxU,YAAAxmW,KAAA,CAAA2/E,SAAA+uM,IACAA,GA7DA/mE,EAAA0pI,EAAA+U,GAEA/U,EAAAx+T,UAAA72B,KAAA,qBAEAq1V,EAAAx+T,UAAA6zU,MAAA,SAAA78a,EAAA0lK,GACAr6D,KAAA88T,IAAA/8U,KAAAprF,GAAA8kG,IACA,GAAAA,EAAA,OAAA4gE,EAAA5gE,GAEA,IAAA,MAAAu3D,KAAAhxD,KAAAsxU,YACAtgR,EAAAvG,SACAuG,EAAAvG,SAAAgnR,MAAAzxU,KAAA88T,KAEA98T,KAAA88T,IAAA9rQ,EAAA5zB,WAAA4zB,EAAA56E,MAIA4pB,KAAAsxU,YAAA,GAeA,SAAAhyU,GACA,IAAA,MAAApgB,KAAAkyV,EAAAv/U,OAAA,YACAyN,EAAA,IAAApgB,GAAA,YAAA9I,GACA,OAAA4pB,KAAA88T,IAAA59U,MAAA9I,IAIA,IAAA,MAAA8I,KAAA1rF,OAAAW,KAAAmrG,EAAAg9T,SAAAY,mBACA59T,EAAApgB,GAAA,YAAA9I,GACA,OAAA4pB,KAAA88T,IAAA59U,MAAA9I,IAtBA2J,CAAAigB,MACAq6D,QAIA8hQ,EAAAx+T,UAAA+zU,OAAA,SAAAr3Q,GACAr6D,KAAA88T,IAAA98U,OAAAyZ,IACA,GAAAA,EAAA,OAAA4gE,EAAA5gE,GACAq8O,EAAA91O,MACAq6D,QAsCA8hQ,EAAAx+T,UAAAg0U,cAAA,SAAA38a,GACA,OAAAA,GAGAmna,EAAAx+T,UAAAi0U,gBAAA,SAAAl+a,GACA,OAAAA,GAGAL,EAAAC,QAAA6oa,EACA9oa,EAAAC,QAAA69a,iBAAAA,2GCnGA,aAEA79a,EAAA49a,kBAAA39a,EAAA,wBACAD,EAAAu+a,iBAAAt+a,EAAA,uBACAD,EAAAw+a,qBAAAv+a,EAAA,yJCJA,aAEA,MAAA+oa,EAAA/oa,EAAA,kBACAw3P,EAAAx3P,EAAA,aACAs+a,EAAAt+a,EAAA,uBACAu+a,EAAAv+a,EAAA,4BACAinG,EAAAhnG,OAAAmqG,UAAAnD,eACAu3U,EAAA,CAAA,KAAA,MAAA,KAAA,OAEA,SAAAb,EAAAc,GACAhyU,KAAA27G,OAAA,MAGA37G,KAAAs8T,SAAAA,EAAA0V,EAAA,CACAr2N,QAAA,IA2OA,SAAAs2N,EAAA9zJ,EAAAxpR,GACA,MAAAi2E,EAAA,GAEA,IAAA,MAAAv2E,KAAAM,EAAA,CACA,IAAA6lG,EAAAoD,KAAAjpG,EAAAN,GAAA,SAEA,GAAA,UAAAA,GAAA,QAAAA,EACA,MAAA,IAAAykG,MAAA,8DAGA,IAAAuwF,EAAA10L,EAAAN,GAEA69a,EAAA79a,KAGAg1L,EAAA80F,EAAAwzJ,cAAAtoP,IAGAz+G,EAAAv2E,GAAAg1L,EAGA,OAAAz+G,EAGA,SAAAsnW,EAAA79a,GACA,OAAA,IAAA09a,EAAAvmW,QAAAn3E,GAhQA68a,EAAAvzU,UAAA5d,KAAA,SAAAprF,EAAA0lK,GACA,MAAA83Q,EAAAnyU,KAAA27G,OAIA,GAFA,mBAAAhnN,IAAA0lK,EAAA1lK,GAEA,mBAAA0lK,EACA,MAAA,IAAAvhE,MAAA,uCAGA,iBAAAnkG,GAAA,OAAAA,IAAAA,EAAA,IAEAA,EAAAy9a,iBAAA,IAAAz9a,EAAAy9a,gBACAz9a,EAAA09a,gBAAA19a,EAAA09a,cAEAryU,KAAA27G,OAAA,UACA37G,KAAAwxU,MAAA78a,GAAA8kG,IACA,GAAAA,EAEA,OADAuG,KAAA27G,OAAAw2N,EACA93Q,EAAA5gE,GAEAuG,KAAA27G,OAAA,OACAthD,QAIA62Q,EAAAvzU,UAAA6zU,MAAA,SAAA78a,EAAA0lK,GACAr6D,KAAAsyU,UAAAj4Q,IAGA62Q,EAAAvzU,UAAA3d,MAAA,SAAAq6E,GACA,MAAA83Q,EAAAnyU,KAAA27G,OAEA,GAAA,mBAAAthD,EACA,MAAA,IAAAvhE,MAAA,wCAGAkH,KAAA27G,OAAA,UACA37G,KAAA0xU,QAAAj4U,IACA,GAAAA,EAEA,OADAuG,KAAA27G,OAAAw2N,EACA93Q,EAAA5gE,GAEAuG,KAAA27G,OAAA,SACAthD,QAIA62Q,EAAAvzU,UAAA+zU,OAAA,SAAAr3Q,GACAr6D,KAAAsyU,UAAAj4Q,IAGA62Q,EAAAvzU,UAAAnc,IAAA,SAAAxsF,EAAAL,EAAA0lK,GAGA,GAFA,mBAAA1lK,IAAA0lK,EAAA1lK,GAEA,mBAAA0lK,EACA,MAAA,IAAAvhE,MAAA,sCAGA,MAAAW,EAAAuG,KAAAuyU,UAAAv9a,GACA,GAAAykG,EAAA,OAAAuG,KAAAsyU,UAAAj4Q,EAAA5gE,GAEAzkG,EAAAgrG,KAAA2xU,cAAA38a,GAEA,iBAAAL,GAAA,OAAAA,IAAAA,EAAA,IAEAA,EAAA69a,UAAA,IAAA79a,EAAA69a,SAEAxyU,KAAAgnG,KAAAhyM,EAAAL,EAAA0lK,IAGA62Q,EAAAvzU,UAAAqpG,KAAA,SAAAhyM,EAAAL,EAAA0lK,GACAr6D,KAAAsyU,WAAA,WAAAj4Q,EAAA,IAAAvhE,MAAA,iBAGAo4U,EAAAvzU,UAAA0zH,IAAA,SAAAr8N,EAAAtB,EAAAiB,EAAA0lK,GAGA,GAFA,mBAAA1lK,IAAA0lK,EAAA1lK,GAEA,mBAAA0lK,EACA,MAAA,IAAAvhE,MAAA,sCAGA,MAAAW,EAAAuG,KAAAuyU,UAAAv9a,IAAAgrG,KAAAyyU,YAAA/+a,GACA,GAAA+lG,EAAA,OAAAuG,KAAAsyU,UAAAj4Q,EAAA5gE,GAEAzkG,EAAAgrG,KAAA2xU,cAAA38a,GACAtB,EAAAssG,KAAA4xU,gBAAAl+a,GAEA,iBAAAiB,GAAA,OAAAA,IAAAA,EAAA,IAEAqrG,KAAA0yU,KAAA19a,EAAAtB,EAAAiB,EAAA0lK,IAGA62Q,EAAAvzU,UAAA+0U,KAAA,SAAA19a,EAAAtB,EAAAiB,EAAA0lK,GACAr6D,KAAAsyU,UAAAj4Q,IAGA62Q,EAAAvzU,UAAA+tT,IAAA,SAAA12Z,EAAAL,EAAA0lK,GAGA,GAFA,mBAAA1lK,IAAA0lK,EAAA1lK,GAEA,mBAAA0lK,EACA,MAAA,IAAAvhE,MAAA,sCAGA,MAAAW,EAAAuG,KAAAuyU,UAAAv9a,GACA,GAAAykG,EAAA,OAAAuG,KAAAsyU,UAAAj4Q,EAAA5gE,GAEAzkG,EAAAgrG,KAAA2xU,cAAA38a,GAEA,iBAAAL,GAAA,OAAAA,IAAAA,EAAA,IAEAqrG,KAAA2yU,KAAA39a,EAAAL,EAAA0lK,IAGA62Q,EAAAvzU,UAAAg1U,KAAA,SAAA39a,EAAAL,EAAA0lK,GACAr6D,KAAAsyU,UAAAj4Q,IAGA62Q,EAAAvzU,UAAA87R,MAAA,SAAAvkK,EAAAvgO,EAAA0lK,GACA,IAAAhkF,UAAApR,OAAA,OAAA+6B,KAAA4yU,gBAMA,GAJA,mBAAAj+a,IAAA0lK,EAAA1lK,GAEA,mBAAAugO,IAAA76D,EAAA66D,GAEA,mBAAA76D,EACA,MAAA,IAAAvhE,MAAA,6CAGA,IAAA+E,MAAA/gB,QAAAo4I,GACA,OAAAl1H,KAAAsyU,UAAAj4Q,EAAA,IAAAvhE,MAAA,4CAGA,GAAA,IAAAo8H,EAAAjwJ,OACA,OAAA+6B,KAAAsyU,UAAAj4Q,GAGA,iBAAA1lK,GAAA,OAAAA,IAAAA,EAAA,IAEA,MAAA05Z,EAAA,IAAAxwT,MAAAq3H,EAAAjwJ,QAEA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+tJ,EAAAjwJ,OAAAkC,IAAA,CACA,GAAA,iBAAA+tJ,EAAA/tJ,IAAA,OAAA+tJ,EAAA/tJ,GACA,OAAA64B,KAAAsyU,UAAAj4Q,EAAA,IAAAvhE,MAAA,0DAGA,MAAA/kG,EAAAP,OAAAiqG,OAAA,GAAAy3H,EAAA/tJ,IAEA,GAAA,QAAApzE,EAAA+yE,MAAA,QAAA/yE,EAAA+yE,KACA,OAAAk5B,KAAAsyU,UAAAj4Q,EAAA,IAAAvhE,MAAA,kCAGA,MAAAW,EAAAuG,KAAAuyU,UAAAx+a,EAAAiB,KACA,GAAAykG,EAAA,OAAAuG,KAAAsyU,UAAAj4Q,EAAA5gE,GAIA,GAFA1lG,EAAAiB,IAAAgrG,KAAA2xU,cAAA59a,EAAAiB,KAEA,QAAAjB,EAAA+yE,KAAA,CACA,MAAA+rW,EAAA7yU,KAAAyyU,YAAA1+a,EAAAL,OACA,GAAAm/a,EAAA,OAAA7yU,KAAAsyU,UAAAj4Q,EAAAw4Q,GAEA9+a,EAAAL,MAAAssG,KAAA4xU,gBAAA79a,EAAAL,OAGA26Z,EAAAlnV,GAAApzE,EAGAisG,KAAAqoS,OAAAgmB,EAAA15Z,EAAA0lK,IAGA62Q,EAAAvzU,UAAA0qS,OAAA,SAAAnzK,EAAAvgO,EAAA0lK,GACAr6D,KAAAsyU,UAAAj4Q,IAGA62Q,EAAAvzU,UAAAyvD,MAAA,SAAAz4J,EAAA0lK,GACA,GAAA,mBAAA1lK,EACA0lK,EAAA1lK,OACA,GAAA,mBAAA0lK,EACA,MAAA,IAAAvhE,MAAA,yCAGAnkG,EAAAs9a,EAAAjyU,KAAArrG,IACAurN,UAAAvrN,EAAAurN,QACAvrN,EAAAogU,MAAA,UAAApgU,EAAAA,EAAAogU,OAAA,EAEA/0N,KAAA8yU,OAAAn+a,EAAA0lK,IAGA62Q,EAAAvzU,UAAAm1U,OAAA,SAAAn+a,EAAA0lK,GAEA1lK,EAAAR,MAAA,EACAQ,EAAAyoG,QAAA,EACAzoG,EAAAona,aAAA,EACApna,EAAAo+a,eAAA,EAEA,MAAAtoR,EAAAzqD,KAAAuxU,UAAA58a,GACAq+a,EAAA,GAEA51V,EAAAqc,IACA,GAAAA,EACA,OAAAgxD,EAAAzlF,KAAA,WACAq1F,EAAA5gE,MAIAgxD,EAAArtE,MAAA,CAAAqc,EAAAzkG,IACAykG,EAAArc,EAAAqc,QACA/jG,IAAAV,EAAAy1J,EAAAzlF,IAAAq1F,QAKAr6D,KAAA2yU,KAAA39a,EAAAg+a,EAAA51V,MAIAA,KAGA8zV,EAAAvzU,UAAAs1U,sBAAA,SAAAt+a,GAUA,OATAA,EAAAs9a,EAAAjyU,KAAArrG,IAEAurN,UAAAvrN,EAAAurN,QACAvrN,EAAAR,MAAA,IAAAQ,EAAAR,KACAQ,EAAAyoG,QAAA,IAAAzoG,EAAAyoG,OACAzoG,EAAAogU,MAAA,UAAApgU,EAAAA,EAAAogU,OAAA,EACApgU,EAAAona,aAAA,IAAApna,EAAAona,YACApna,EAAAo+a,eAAA,IAAAp+a,EAAAo+a,cAEAp+a,GA+BAu8a,EAAAvzU,UAAA8sD,SAAA,SAAA91J,GAGA,MAFA,iBAAAA,GAAA,OAAAA,IAAAA,EAAA,IACAA,EAAAqrG,KAAAizU,sBAAAt+a,GACAqrG,KAAAuxU,UAAA58a,IAGAu8a,EAAAvzU,UAAA4zU,UAAA,SAAA58a,GACA,OAAA,IAAAk9a,EAAA7xU,OAGAkxU,EAAAvzU,UAAAi1U,cAAA,WACA,OAAA,IAAAd,EAAA9xU,OAGAkxU,EAAAvzU,UAAAg0U,cAAA,SAAA38a,GACA,OAAAA,GAGAk8a,EAAAvzU,UAAAi0U,gBAAA,SAAAl+a,GACA,OAAAA,GAGAw9a,EAAAvzU,UAAA40U,UAAA,SAAAv9a,GACA,OAAAA,MAAAA,EACA,IAAA8jG,MAAA,uCACAiyJ,EAAA/1P,IAAA,IAAAA,EAAAiwE,OACA,IAAA6zB,MAAA,iCACA,KAAA9jG,EACA,IAAA8jG,MAAA,iCACA+E,MAAA/gB,QAAA9nF,IAAA,IAAAA,EAAAiwE,OACA,IAAA6zB,MAAA,qCADA,GAKAo4U,EAAAvzU,UAAA80U,YAAA,SAAA/+a,GACA,GAAAA,MAAAA,EACA,OAAA,IAAAolG,MAAA,0CAOAo4U,EAAAvzU,UAAA20U,UAAA/+a,EAAA,eAEAF,EAAAC,QAAA49a,mKClUA,aAEA79a,EAAAC,QAAA,YAAA4/a,GACA,MAAAlB,EAAAkB,EAAAxtW,QAAA,CAAA2wK,EAAAn3J,IAAA1rF,OAAAiqG,OAAA44I,EAAAn3J,IAAA,IAEA,OAAA1rF,OAAAiqG,OAAAu0U,EAAA,CAEAmB,WAAAnB,EAAAmB,aAAA,EACAC,UAAApB,EAAAoB,YAAA,EACAC,WAAArB,EAAAqB,aAAA,EACAC,KAAAtB,EAAAsB,OAAA,EACAlmR,MAAA4kR,EAAA5kR,QAAA,EAGAuuD,OAAAq2N,EAAAr2N,SAAA,EAGAy2N,gBAAAJ,EAAAI,kBAAA,EACAC,cAAAL,EAAAK,gBAAA,EAGAtV,aAAAiV,EAAAjV,eAAA,EACAC,aAAAgV,EAAAhV,eAAA,EACAC,SAAA+U,EAAA/U,WAAA,EACAjnF,QAAAg8F,EAAAh8F,UAAA,EACAu9F,UAAAvB,EAAAuB,YAAA,EAGArW,kBAAA1pa,OAAAiqG,OAAA,GAAAu0U,EAAA9U;A;A;A;A;A;A;ACrBA7pa,EAAAC,QAAA,SAAAurG,GACA,OAAA,MAAAA,GAAA,MAAAA,EAAA8N,aACA,mBAAA9N,EAAA8N,YAAAo+I,UAAAlsJ,EAAA8N,YAAAo+I,SAAAlsJ,kCCTA,aAEA,SAAAgzU,EAAA1zJ,GACA,GAAA,iBAAAA,GAAA,OAAAA,EACA,MAAA,IAAAp5K,UAAA,gEAGA/E,KAAAm+K,GAAAA,EACAn+K,KAAAwzU,QAAA,EACAxzU,KAAAyzU,UAAA,EAGA5B,EAAAl0U,UAAAvgB,KAAA,SAAAi9E,GACA,GAAA,mBAAAA,EACA,MAAA,IAAAvhE,MAAA,uCAGA,OAAAkH,KAAAwzU,QACAxzU,KAAAsyU,UAAAj4Q,EAAA,IAAAvhE,MAAA,mCACAkH,MAGAA,KAAAyzU,UACAzzU,KAAAsyU,UAAAj4Q,EAAA,IAAAvhE,MAAA,4DACAkH,OAGAA,KAAAyzU,UAAA,EACAzzU,KAAAsnQ,OAAA,CAAA7tQ,KAAAmL,KACA5E,KAAAyzU,UAAA,EACAp5Q,EAAA5gE,KAAAmL,MAGA5E,OAGA6xU,EAAAl0U,UAAA2pQ,MAAA,SAAAjtM,GACAr6D,KAAAsyU,UAAAj4Q,IAGAw3Q,EAAAl0U,UAAA21U,KAAA,SAAAloQ,GACA,GAAAprE,KAAAwzU,OACA,MAAA,IAAA16U,MAAA,kCAEA,GAAAkH,KAAAyzU,SACA,MAAA,IAAA36U,MAAA,kDAGAsyE,EAAAprE,KAAAm+K,GAAAwzJ,cAAAvmQ,GACAprE,KAAA0zU,MAAAtoQ,IAGAymQ,EAAAl0U,UAAA+1U,MAAA,SAAAtoQ,KAEAymQ,EAAAl0U,UAAA34B,IAAA,SAAAq1F,GACA,GAAA,mBAAAA,EACA,MAAA,IAAAvhE,MAAA,sCAGA,GAAAkH,KAAAwzU,OACA,OAAAxzU,KAAAsyU,UAAAj4Q,EAAA,IAAAvhE,MAAA,qCAGAkH,KAAAwzU,QAAA,EACAxzU,KAAA2zU,KAAAt5Q,IAGAw3Q,EAAAl0U,UAAAg2U,KAAA,SAAAt5Q,GACAr6D,KAAAsyU,UAAAj4Q,IAIAw3Q,EAAAl0U,UAAA20U,UAAA/+a,EAAA,eAEAF,EAAAC,QAAAu+a,qDC1EA,aAEA,MAAAr0F,EAAAjqV,EAAA,mBAEAF,EAAAC,QAAA,SAAAsxF,KAAAxO,GACA,IAAAA,EAAAnR,OACAu4Q,EAAA54P,GAEA44P,GAAA,IAAA54P,KAAAxO;2FCPIi/H,EAEJhiN,EAAOC,QAAoC,mBAAnBkqV,eACpBA,eAAe7kP,KAAuB,oBAAX4G,OAAyBA,OAASC,GAE7D6gD,IAAOg1D,IAAYA,EAAUtvC,QAAQC,YACpC/nE,KAAKoiD,GACLniD,OAAMzE,GAAOoxE,YAAW,WAAcpxE,IAAO,mCCRlD,aAEA,MAAAu5U,EAAAx/a,OAAAc,OAAA,IAEA,SAAAw9a,EAAA3zJ,GACA,GAAA,iBAAAA,GAAA,OAAAA,EACA,MAAA,IAAAp5K,UAAA,gEAGA/E,KAAAm+K,GAAAA,EACAn+K,KAAAsxU,YAAA,GACAtxU,KAAA4zU,UAAA,EAGA9B,EAAAn0U,UAAAk2U,cAAA,WACA,GAAA7zU,KAAA4zU,SACA,MAAA,IAAA96U,MAAA,yCAIAg5U,EAAAn0U,UAAA0zH,IAAA,SAAAr8N,EAAAtB,EAAAiB,GACAqrG,KAAA6zU,gBAEA,MAAAp6U,EAAAuG,KAAAm+K,GAAAo0J,UAAAv9a,IAAAgrG,KAAAm+K,GAAAs0J,YAAA/+a,GACA,GAAA+lG,EAAA,MAAAA,EAOA,OALAzkG,EAAAgrG,KAAAm+K,GAAAwzJ,cAAA38a,GACAtB,EAAAssG,KAAAm+K,GAAAyzJ,gBAAAl+a,GAEAssG,KAAA0yU,KAAA19a,EAAAtB,EAAA,MAAAiB,EAAAA,EAAAq+a,GAEAhzU,MAGA8xU,EAAAn0U,UAAA+0U,KAAA,SAAA19a,EAAAtB,EAAAiB,GACAqrG,KAAAsxU,YAAAxmW,KAAA,IAAAn2E,EAAAmyE,KAAA,MAAA9xE,IAAAA,EAAAtB,MAAAA,KAGAo+a,EAAAn0U,UAAA+tT,IAAA,SAAA12Z,EAAAL,GACAqrG,KAAA6zU,gBAEA,MAAAp6U,EAAAuG,KAAAm+K,GAAAo0J,UAAAv9a,GACA,GAAAykG,EAAA,MAAAA,EAKA,OAHAzkG,EAAAgrG,KAAAm+K,GAAAwzJ,cAAA38a,GACAgrG,KAAA2yU,KAAA39a,EAAA,MAAAL,EAAAA,EAAAq+a,GAEAhzU,MAGA8xU,EAAAn0U,UAAAg1U,KAAA,SAAA39a,EAAAL,GACAqrG,KAAAsxU,YAAAxmW,KAAA,IAAAn2E,EAAAmyE,KAAA,MAAA9xE,IAAAA,KAGA88a,EAAAn0U,UAAAyvD,MAAA,WAIA,OAHAptD,KAAA6zU,gBACA7zU,KAAA8yU,SAEA9yU,MAGA8xU,EAAAn0U,UAAAm1U,OAAA,WACA9yU,KAAAsxU,YAAA,IAGAQ,EAAAn0U,UAAAgnJ,MAAA,SAAAhwP,EAAA0lK,GAMA,GALAr6D,KAAA6zU,gBAEA,mBAAAl/a,IACA0lK,EAAA1lK,GAEA,mBAAA0lK,EACA,MAAA,IAAAvhE,MAAA,wCAEA,iBAAAnkG,GAAA,OAAAA,IACAA,EAAA,IAGAqrG,KAAA4zU,UAAA,EACA5zU,KAAAywO,OAAA97U,EAAA0lK,IAGAy3Q,EAAAn0U,UAAA8yO,OAAA,SAAA97U,EAAA0lK,GACAr6D,KAAAm+K,GAAAkqH,OAAAroS,KAAAsxU,YAAA38a,EAAA0lK,IAIAy3Q,EAAAn0U,UAAA20U,UAAA/+a,EAAA,eAEAF,EAAAC,QAAAw+a,qDCzFA,aAEA,MAAAD,EAAAt+a,EAAA,sBAAAs+a,iBAGA,SAAAV,EAAAhzJ,EAAAxpR,GACAk9a,EAAAj0U,KAAAoC,KAAAm+K,GAEAn+K,KAAA2hE,SAAAhtK,EACAqrG,KAAAuxU,UAAA,KACAvxU,KAAAsxU,YAAA,GAPA/9a,EAAA,WAUAk/R,CAAA0+I,EAAAU,GAEAV,EAAAxzU,UAAA8zU,MAAA,SAAAtzJ,GACA,MAAAq7E,EAAAx5P,KAAAuxU,UAAApzJ,EAAA1zH,SAAAzqD,KAAA2hE,UAEA,IAAA,MAAA3Q,KAAAhxD,KAAAsxU,YACA93E,EAAAxoM,EAAA5zB,WAAA4zB,EAAA56E,OAIA+6V,EAAAxzU,UAAAm2U,WAAA,SAAA12S,EAAAhnD,GACA,GAAA4pB,KAAAuxU,UAAA,OAAAvxU,KAAAuxU,UAAAn0S,MAAAhnD,GACA4pB,KAAAsxU,YAAAxmW,KAAA,CAAAsyD,OAAAA,EAAAhnD,KAAAA,KAGA,IAAA,MAAA8I,IAAA,CAAA,OAAA,OACAiyV,EAAAxzU,UAAA,IAAAze,GAAA,YAAA9I,GACA4pB,KAAA8zU,WAAA50V,EAAA9I,IAKA+6V,EAAAxzU,UAAA21U,KAAA,YAAAl9V,GACA4pB,KAAA8zU,WAAA,OAAA19V,IAGA/iF,EAAAC,QAAA69a,6ECvCA,aAEA,MAAA1+I,EAAAl/R,EAAA,aACA+vU,SAAAA,GAAA/vU,EAAA,mBAKA,SAAAwgb,EAAAtpR,EAAA91J,GACA,KAAAqrG,gBAAA+zU,GAAA,OAAA,IAAAA,EAAAtpR,EAAA91J,GACAA,EAAAA,GAAA,GACA2uU,EAAA1lO,KAAAoC,KAAAxsG,OAAAiqG,OAAA,GAAA9oG,EAAA,CACAwwU,YAAA,KAEAnlO,KAAAuxU,UAAA9mR,EACAzqD,KAAA2hE,SAAAhtK,EACAqrG,KAAAhyB,GAAA,MAAAgyB,KAAAstG,QAAA30G,KAAAqH,KAAA,KAAA,OAXA3sG,EAAAC,QAAAygb,EACAthJ,EAAAshJ,EAAAzwG,GAaAywG,EAAAp2U,UAAA6oO,MAAA,WACAxmO,KAAA4oF,WAEA5oF,KAAAuxU,UAAAn0V,MAAA,CAAAqc,EAAAzkG,EAAAtB,KACA,IAAAssG,KAAA4oF,UACA,OAAAnvF,EAAAuG,KAAAstG,QAAA7zG,aAEA/jG,IAAAV,QAAAU,IAAAhC,EACAssG,KAAAl1B,KAAA,OACA,IAAAk1B,KAAA2hE,SAAAxtK,OAAA,IAAA6rG,KAAA2hE,SAAAvkE,OACA4C,KAAAl1B,KAAA91E,IACA,IAAAgrG,KAAA2hE,SAAAxtK,OAAA,IAAA6rG,KAAA2hE,SAAAvkE,OACA4C,KAAAl1B,KAAAp3E,GAEAssG,KAAAl1B,KAAA,CAAA91E,IAAAA,EAAAtB,MAAAA,SAKAqgb,EAAAp2U,UAAA8oO,SAAA,SAAAhtO,EAAA4gE,GACAr6D,KAAAuxU,UAAAvsW,KAAA,SAAA2wQ,GACAt7K,EAAA5gE,GAAAk8O,+ECxCA,aAEA,MAAA8mF,EAAAlpa,EAAA,gBAAAkpa,WACAF,EAAAhpa,EAAA,YACAipa,EAAAjpa,EAAA,YAAAipa,YACAx7P,EAAAztK,EAAA,YAAAytK,WAEA,SAAAq7P,EAAAL,GACAh8T,KAAAm+K,GAAA69I,EACAh8T,KAAAy5R,MAAAuiC,EAAA79I,GAAAs7G,QACAz5R,KAAA47T,IAAA,GACA57T,KAAA/6B,OAAA,EAGAo3V,EAAA1+T,UAAA0zH,IAAA,SAAAr8N,EAAAtB,EAAAiB,GACA,IACAqrG,KAAAy5R,MAAApoK,IAAAr8N,EAAAtB,EAAAiB,GACA,MAAAZ,GACA,MAAA,IAAA0oa,EAAA1oa,GAMA,OAHAisG,KAAA47T,IAAA9wV,KAAA,IAAAn2E,EAAAmyE,KAAA,MAAA9xE,IAAAA,EAAAtB,MAAAA,IACAssG,KAAA/6B,SAEA+6B,MAGAq8T,EAAA1+T,UAAA+tT,IAAA,SAAA12Z,EAAAL,GACA,IACAqrG,KAAAy5R,MAAAiyB,IAAA12Z,EAAAL,GACA,MAAA8kG,GACA,MAAA,IAAAgjU,EAAAhjU,GAMA,OAHAuG,KAAA47T,IAAA9wV,KAAA,IAAAn2E,EAAAmyE,KAAA,MAAA9xE,IAAAA,IACAgrG,KAAA/6B,SAEA+6B,MAGAq8T,EAAA1+T,UAAAyvD,MAAA,WACA,IACAptD,KAAAy5R,MAAArsO,QACA,MAAA3zD,GACA,MAAA,IAAAgjU,EAAAhjU,GAMA,OAHAuG,KAAA47T,IAAA,GACA57T,KAAA/6B,OAAA,EAEA+6B,MAGAq8T,EAAA1+T,UAAAgnJ,MAAA,SAAAhwP,EAAA0lK,GACA,MAAA2hQ,EAAAh8T,KAAAm+K,GACAy9I,EAAA57T,KAAA47T,IAEAvhQ,EAAAmiQ,EAAA7na,EAAA0lK,GACAA,EAAAkiQ,EAAAe,aAAAjjQ,GACA1lK,EAAAqsK,EAAArsK,GAEA,IACAqrG,KAAAy5R,MAAA90I,MAAAhwP,GAAA,SAAA8kG,GACA,GAAAA,EAAA,OAAA4gE,EAAA,IAAAoiQ,EAAAhjU,IACAuiU,EAAAnjP,KAAA,QAAA+iP,GACAvhQ,OAEA,MAAA5gE,GACA,MAAA,IAAAgjU,EAAAhjU,GAGA,OAAA4gE,EAAAg7C,SAGAhiN,EAAAC,QAAA+oa,wFC1EA,aAEA,MAAA2X,EAAAzgb,EAAA,SAAAW,OACA+/a,EAAAD,EAAA,gBACArhB,EAAAqhB,EAAA,gBAAAC,GAEAthB,EAAAh1T,UAAA66R,UAAA,EACAm6B,EAAAh1T,UAAAg+G,OAAA,IAEAtoN,EAAAC,QAAA,CACA2gb,aAAAA,EACArX,oBAAAoX,EAAA,sBAAAC,GACAtX,UAAAqX,EAAA,YAAAC,GACAvX,UAAAsX,EAAA,YAAAC,GACAxX,WAAAuX,EAAA,aAAAC,GACAthB,cAAAA,EACAuhB,cAAAF,EAAA,gBAAAC,+CChBA,IAAAvtN,EAAArzN,EAAAC,QAAAozN,IAAA,CACA,CACAytN,OAAA,EACA9+a,KAAA,SACA2nK,YAAA,6BAEA,CACAm3Q,OAAA,EACA9+a,KAAA,UACA2nK,YAAA,iBAEA,CACAm3Q,MAAA,EACA9+a,KAAA,KACA2nK,YAAA,WAEA,CACAm3Q,MAAA,EACA9+a,KAAA,MACA2nK,YAAA,eAEA,CACAm3Q,MAAA,EACA9+a,KAAA,YACA2nK,YAAA,qBAEA,CACAm3Q,MAAA,EACA9+a,KAAA,SACA2nK,YAAA,qBAEA,CACAm3Q,MAAA,EACA9+a,KAAA,SACA2nK,YAAA,oCAEA,CACAm3Q,MAAA,EACA9+a,KAAA,aACA2nK,YAAA,0BAEA,CACAm3Q,MAAA,EACA9+a,KAAA,gBACA2nK,YAAA,yBAEA,CACAm3Q,MAAA,EACA9+a,KAAA,eACA2nK,YAAA,gCAEA,CACAm3Q,MAAA,EACA9+a,KAAA,WACA2nK,YAAA,kCAEA,CACAm3Q,MAAA,EACA9+a,KAAA,QACA2nK,YAAA,uBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,QACA2nK,YAAA,2BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,eACA2nK,YAAA,oCAEA,CACAm3Q,MAAA,GACA9+a,KAAA,eACA2nK,YAAA,sBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,aACA2nK,YAAA,4BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,eACA2nK,YAAA,gCAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,uCAEA,CACAm3Q,MAAA,GACA9+a,KAAA,eACA2nK,YAAA,uBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,QACA2nK,YAAA,2BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,oBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,UACA2nK,YAAA,+BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,uBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,WACA2nK,YAAA,oBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,WACA2nK,YAAA,mBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,cACA2nK,YAAA,0BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,uBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,UACA2nK,YAAA,6BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,qBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,UACA2nK,YAAA,mBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,oCAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,iCAEA,CACAm3Q,MAAA,GACA9+a,KAAA,WACA2nK,YAAA,2BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,WACA2nK,YAAA,kCAEA,CACAm3Q,MAAA,GACA9+a,KAAA,UACA2nK,YAAA,qCAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,6BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,4BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,QACA2nK,YAAA,eAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,kBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,kBACA2nK,YAAA,0BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,aACA2nK,YAAA,kCAEA,CACAm3Q,MAAA,GACA9+a,KAAA,YACA2nK,YAAA,wBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,WACA2nK,YAAA,6BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,kBACA2nK,YAAA,6CAEA,CACAm3Q,MAAA,GACA9+a,KAAA,aACA2nK,YAAA,0CAEA,CACAm3Q,MAAA,GACA9+a,KAAA,cACA2nK,YAAA,6BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,YACA2nK,YAAA,iDAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,uBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,QACA2nK,YAAA,mBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,eACA2nK,YAAA,iBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,QACA2nK,YAAA,2BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,QACA2nK,YAAA,uCAEA,CACAm3Q,MAAA,GACA9+a,KAAA,QACA2nK,YAAA,mCAEA,CACAm3Q,MAAA,GACA9+a,KAAA,YACA2nK,YAAA,uBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,2BAEA,CACAm3Q,MAAA,GACA9+a,KAAA,MACA2nK,YAAA,aAEA,CACAm3Q,MAAA,GACA9+a,KAAA,QACA2nK,YAAA,yBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,kBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,SACA2nK,YAAA,gBAEA,CACAm3Q,MAAA,GACA9+a,KAAA,YACA2nK,YAAA,uBAIA3pK,EAAAC,QAAA6gb,MAAA,GACA9gb,EAAAC,QAAA+B,KAAA,GAEAqxN,EAAAtyN,SAAA,SAAAm7E,GACAl8E,EAAAC,QAAA6gb,MAAA5kW,EAAA4kW,OAAA5kW,EACAl8E,EAAAC,QAAA+B,KAAAk6E,EAAAl6E,MAAAk6E,KAGAl8E,EAAAC,QAAAwjN,OAAAvjN,EAAA,WAAAA,CAAAF,EAAAC,SACAD,EAAAC,QAAAY,OAAAb,EAAAC,QAAAwjN,OAAAk9N,4DCxTA,IAAAI,EAAA7gb,EAAA,OAEA,SAAAyhI,EAAAluD,EAAA6S,EAAA06V,GACA16V,GAAA,iBAAAA,IACAA,EAAAA,EAAAA,SAAAA,EAAA9mF,MAEAuhb,EAAAp0U,KAAA,CACAl5B,KAAAA,EACAj0E,KAAAi0E,EAEAutW,MAAA,iBAAA16V,EAAAA,EAAA06V,EACA16V,QAAAA,GACA,OAIA,SAAAurK,EAAAvrK,EAAA06V,GACAv7U,MAAA8E,KAAAoC,MACAlH,MAAAqsJ,mBACArsJ,MAAAqsJ,kBAAAnlJ,KAAAA,KAAA2M,aACAqoB,EAAAp3B,KAAAoC,KAAA,cAAArmB,EAAA06V,GAGAnvL,EAAAvnJ,UAAA,IAAA7E,MAwBAzlG,EAAAC,QAAA,SAAA6gb,GACA,IAAAG,EAAA,SAAAxtW,EAAAujE,GACA,OAxBA,SAAA8pS,EAAArtW,EAAAujE,GACA,IAAA5wC,EAAA,SAAA9f,EAAA06V,GACAr/S,EAAAp3B,KAAAoC,KAAAl5B,EAAA6S,EAAA06V,GAEA,mBAAAvtW,IACAk5B,KAAA3qG,KAAA2qG,KAAAq0U,MAAAh/a,KACA2qG,KAAArtG,KAAAqtG,KAAAq0U,MAAA1hb,KACAqtG,KAAAm0U,MAAAn0U,KAAAq0U,MAAAF,MACAn0U,KAAArmB,SACAw6V,EAAAA,MAAAn0U,KAAAq0U,MAAAF,OACAA,EAAAA,MAAAn0U,KAAAq0U,MAAAF,OAAAn3Q,YACAh9D,KAAAq0U,MAAA16V,UACAqmB,KAAAq0U,MAAA1hb,KAAA,KAAAqtG,KAAAq0U,MAAA1hb,KAAA,IAAA,KAEAmmG,MAAA8E,KAAAoC,MACAlH,MAAAqsJ,mBACArsJ,MAAAqsJ,kBAAAnlJ,KAAAvG,IAGA,OADAA,EAAAkE,UAAA0sC,EAAA,IAAAA,EAAA,IAAA66G,EACAzrJ,EAKAu6U,CAAAG,EAAArtW,EAAAujE,IAEA,MAAA,CACA66G,YAAAA,EACAqvL,gBAAAD,EAAA,mBACAN,YAAAM;A;A;A;A;A;A;AC/CA,IAAA9qW,EAAAgrW,EAAAhrW,EAKAw2B,KALAw0U,EAKA,WAEA,IAAAzvQ,EAAA,mBAAAvxK,OAAAC,eACA,SAAAorG,EAAA7pG,EAAAL,GAEA,OADAnB,OAAAC,eAAAorG,EAAA7pG,EAAAL,GACAkqG,GAEA,SAAAA,EAAA7pG,EAAAL,GAEA,OADAkqG,EAAA7pG,GAAAL,EAAAjB,MACAmrG,GAwCA,OAlBA,SAAAA,EAAA7pG,EAAAtB,EAAAiB,GACA,IAAAN,EAIA,GAFAM,EAtBA,SAAAjB,EAAAiB,GACA,IAAA8/a,EAAA,iBAAA9/a,EACA+/a,GAAAD,GAAA,iBAAA9/a,EACAq8J,EAAA,SAAA9pF,GACA,OAAAutW,IACA9/a,EAAAuyE,KACAwtW,GACA//a,EAAA62E,QAAAtE,EAAA,KAAA,GAIA,MAAA,CACA63B,WAAAiyD,EAAA,cACAlyD,aAAAkyD,EAAA,gBACAmlE,SAAAnlE,EAAA,YACAt9J,MAAAA,GAOAihb,CAAAjhb,EAAAiB,GAEA,iBAAAK,EAAA,CACA,IAAAX,KAAAW,EACAxB,OAAAgnG,eAAAoD,KAAA5oG,EAAAX,KACAM,EAAAjB,MAAAsB,EAAAX,GACA0wK,EAAAlmE,EAAAxqG,EAAAM,IAGA,OAAAkqG,EAGA,OAAAkmE,EAAAlmE,EAAA7pG,EAAAL,UAlDA,IAAAtB,GAAAA,EAAAC,QACAD,EAAAC,QAAAkhb,IAEAhrW,EAAA,IAAAgrW,kCCXA,gCAEAlhb,EAAQgqa,aAAe,SAAUjjQ,WACd3kK,IAAb2kK,EAAa3kK,KACX2/M,EAAAA,IAActvC,SAAQ,SAAUC,EAASu5B,GAC3CllC,EAAW,SAAU5gE,EAAK1tB,GACpB0tB,EAAK8lG,EAAO9lG,GACXusE,EAAQj6F,OAIjBsuF,EAASg7C,QAAUA,SAGdh7C,GAGT/mK,EAAQshb,YAAc,SAAUv/N,EAASh7C,WACtB3kK,IAAb2kK,EAAa3kK,OAAkB2/M,EAEnCA,EACGp3G,MAAK,SAAUlyB,GAAO+lH,EAAQla,SAASvd,EAAU,KAAMtuF,MACvDmyB,OAAM,SAAUzE,GAAOq4F,EAAQla,SAASvd,EAAU5gE,oDCtBvD,aAEAnmG,EAAAkpa,YAAA,SAAA7na,EAAA0lK,GACA,MAAA,mBAAA1lK,EAAAA,EAAA0lK,GAGA/mK,EAAA0tK,WAAA,SAAArsK,GACA,MAAA,iBAAAA,GAAA,OAAAA,EAAAA,EAAA,kCCPA,aAEA,MAAA6oV,EAAAjqV,EAAA,mBAEAF,EAAAC,QAAA,SAAAsxF,KAAAxO,GACA,IAAAA,EAAAnR,OACAu4Q,EAAA54P,GAEA44P,GAAA,IAAA54P,KAAAxO,6DCRA,aAEA,MAAA86V,EAAA39a,EAAA,sBAAA29a,kBACAY,EAAAv+a,EAAA,sBAAAu+a,qBACAD,EAAAt+a,EAAA,sBAAAs+a,iBACAp/I,EAAAl/R,EAAA,YACAshb,EAAAthb,EAAA,eACA2gb,EAAA3gb,EAAA,gBAAA2gb,cACAY,EAAA,CAAA,kBAAA,gBAIA,SAAAv9J,EAAA4G,EAAAp9G,GACA,KAAA/gE,gBAAAu3K,GAAA,OAAA,IAAAA,EAAA4G,EAAAp9G,GAEA,MAAAixQ,EAAA7zJ,EAAAm+I,UAAA,GACAY,EAAA8U,EAAA9U,mBAAA,GAEAgU,EAAAtzU,KAAAoC,KAAAgyU,GAEAhyU,KAAAs8T,SAAAiX,WAAA,EACAvzU,KAAAs8T,SAAAY,kBAAA,GAEA4X,EAAA1gb,SAAA,SAAA8qF,GAEA,MAAA4+F,EAAA,mBAAAqgG,EAAAj/L,IAEAg+U,EAAAh+U,IAAA4+F,KACA99E,KAAAs8T,SAAAY,kBAAAh+U,IAAA,EAEA8gB,KAAA9gB,GAAA,SAAAlK,EAAAhQ,EAAA+7F,EAAA1gB,GAGA,OAFArrE,EAAAgrB,KAAA26H,MAAAo6M,UAAA//V,EAAA+rF,GACA/7F,EAAAg7B,KAAA26H,MAAAo6M,UAAA/vW,EAAA+7F,GACA/gE,KAAAm+K,GAAAj/L,GAAAlK,EAAAhQ,EAAA+7F,EAAA1gB,OAGArgD,WAGA,KADA+gE,EAAAA,GAAA,IACAi0Q,cAAAj0Q,EAAAi0Q,YAAA,aACA,IAAAj0Q,EAAA06P,gBAAA16P,EAAA06P,cAAA,QAEAz7T,KAAAm+K,GAAAA,EACAn+K,KAAA26H,MAAA,IAAAk6M,EAAA9zQ,GAoEA,SAAAk0Q,EAAA92J,EAAAp9G,GACA8wQ,EAAAj0U,KAAAoC,KAAAm+K,GACAn+K,KAAA26H,MAAAwjD,EAAAxjD,MACA36H,KAAA7rG,KAAA4sK,EAAA5sK,KACA6rG,KAAA5C,OAAA2jE,EAAA3jE,OACA4C,KAAA+gE,KAAA/gE,KAAA26H,MAAAu6M,WAAAn0Q,GACA/gE,KAAAw5P,GAAAr7E,EAAAA,GAAA1zH,SAAAzqD,KAAA+gE,MAsCA,SAAAs7P,EAAAl+I,EAAAxjD,GACAm3M,EAAAl0U,KAAAoC,KAAAm+K,GACAn+K,KAAA26H,MAAAwjD,EAAAxjD,MACA36H,KAAAy5R,MAAAt7G,EAAAA,GAAAs7G,QApJApmY,EAAAC,QAAAikR,EAoCAkb,EAAAlb,EAAA25J,GAEA35J,EAAA55K,UAAA72B,KAAA,gBAEAywM,EAAA55K,UAAAg0U,cACAp6J,EAAA55K,UAAAi0U,gBAAA,SAAAuD,GACA,OAAAA,GAGA59J,EAAA55K,UAAA6zU,MAAA,SAAAzwQ,EAAA1gB,GACArgD,KAAAm+K,GAAAp+L,KAAAghF,EAAA1gB,IAGAk3H,EAAA55K,UAAA+zU,OAAA,SAAArxR,GACArgD,KAAAm+K,GAAAn+L,MAAAqgE,IAGAk3H,EAAA55K,UAAA+0U,KAAA,SAAA19a,EAAAtB,EAAAqtK,EAAA1gB,GACArrJ,EAAAgrG,KAAA26H,MAAAo6M,UAAA//a,EAAA+rK,GACArtK,EAAAssG,KAAA26H,MAAAy6M,YAAA1hb,EAAAqtK,GACA/gE,KAAAm+K,GAAA9sD,IAAAr8N,EAAAtB,EAAAqtK,EAAA1gB,IAGAk3H,EAAA55K,UAAAqpG,KAAA,SAAAhyM,EAAA+rK,EAAA1gB,GACArrJ,EAAAgrG,KAAA26H,MAAAo6M,UAAA//a,EAAA+rK,GACAA,EAAAyxQ,SAAAxyU,KAAA26H,MAAAo4M,cAAAhyQ,GAEA/gE,KAAAm+K,GAAA38L,IAAAxsF,EAAA+rK,GAAA,CAAAtnE,EAAA/lG,KACA,GAAA+lG,EAAA,OAAA4mD,EAAA5mD,GAEA,IACA/lG,EAAAssG,KAAA26H,MAAA06M,YAAA3hb,EAAAqtK,GACA,MAAAtnE,GACA,OAAA4mD,EAAA,IAAA6zR,EAAAz6U,IAGA4mD,EAAA,KAAA3sJ,OAIA6jR,EAAA55K,UAAAg1U,KAAA,SAAA39a,EAAA+rK,EAAA1gB,GACArrJ,EAAAgrG,KAAA26H,MAAAo6M,UAAA//a,EAAA+rK,GACA/gE,KAAAm+K,GAAAutI,IAAA12Z,EAAA+rK,EAAA1gB,IAGAk3H,EAAA55K,UAAAi1U,cAAA,WACA,OAAA,IAAAvW,EAAAr8T,OAGAu3K,EAAA55K,UAAA0qS,OAAA,SAAAuzB,EAAA76P,EAAA1gB,GACAu7Q,EAAA57T,KAAA26H,MAAA26M,YAAA1Z,EAAA76P,GACA/gE,KAAAm+K,GAAAs7G,MAAAmiC,EAAA76P,EAAA1gB,IAGAk3H,EAAA55K,UAAA4zU,UAAA,SAAAxwQ,GAGA,OAFAA,EAAAg7P,YAAA/7T,KAAA26H,MAAAohM,YAAAh7P,GACAA,EAAAgyQ,cAAA/yU,KAAA26H,MAAAo4M,cAAAhyQ,GACA,IAAAk0Q,EAAAj1U,KAAA+gE,IAGAw2G,EAAA55K,UAAAm1U,OAAA,SAAA/xQ,EAAA1G,GACA0G,EAAA/gE,KAAA26H,MAAAu6M,WAAAn0Q,GACA/gE,KAAAm+K,GAAA/wH,MAAA2T,EAAA1G,IAYAo4H,EAAAwiJ,EAAApD,GAEAoD,EAAAt3U,UAAA2pQ,MAAA,SAAAjnN,GACArgD,KAAAw5P,GAAAp8Q,MAAA,CAAAqc,EAAAzkG,EAAAtB,KACA,GAAA+lG,EAAA,OAAA4mD,EAAA5mD,GAEA,IAEAzkG,EADAgrG,KAAA7rG,WAAA,IAAAa,EACAgrG,KAAA26H,MAAA46M,UAAAvgb,EAAAgrG,KAAA+gE,WAEArrK,EAIAhC,EADAssG,KAAA5C,aAAA,IAAA1pG,EACAssG,KAAA26H,MAAA06M,YAAA3hb,EAAAssG,KAAA+gE,WAEArrK,EAEA,MAAA+jG,GACA,OAAA4mD,EAAA,IAAA6zR,EAAAz6U,IAGA4mD,EAAA,KAAArrJ,EAAAtB,OAIAuhb,EAAAt3U,UAAA+1U,MAAA,SAAA1+a,GACAA,EAAAgrG,KAAA26H,MAAAo6M,UAAA//a,EAAAgrG,KAAA+gE,MACA/gE,KAAAw5P,GAAA85E,KAAAt+a,IAGAigb,EAAAt3U,UAAAg2U,KAAA,SAAAtzR,GACArgD,KAAAw5P,GAAAx0R,IAAAq7E,IASAoyI,EAAA4pI,EAAAyV,GAEAzV,EAAA1+T,UAAA+0U,KAAA,SAAA19a,EAAAtB,EAAAiB,GACAK,EAAAgrG,KAAA26H,MAAAo6M,UAAA//a,EAAAL,GACAjB,EAAAssG,KAAA26H,MAAAy6M,YAAA1hb,EAAAiB,GACAqrG,KAAAy5R,MAAApoK,IAAAr8N,EAAAtB,IAGA2oa,EAAA1+T,UAAAg1U,KAAA,SAAA39a,EAAAL,GACAK,EAAAgrG,KAAA26H,MAAAo6M,UAAA//a,EAAAL,GACAqrG,KAAAy5R,MAAAiyB,IAAA12Z,IAGAqna,EAAA1+T,UAAAm1U,OAAA,WACA9yU,KAAAy5R,MAAArsO,SAGAivQ,EAAA1+T,UAAA8yO,OAAA,SAAA1vK,EAAA1gB,GACArgD,KAAAy5R,MAAA90I,MAAA5jF,EAAA1gB,0HCnLA,aAEA,MAAAkzR,EAAAhgb,EAAA,mBACAw+a,EAAA,IAAApzV,IAAA,CAAA,KAAA,KAAA,MAAA,QAIA,SAAAk2V,EAAA9zQ,GACA,KAAA/gE,gBAAA60U,GACA,OAAA,IAAAA,EAAA9zQ,GAEA/gE,KAAA+gE,KAAAA,GAAA,GACA/gE,KAAAuzU,UAAAA,EAPAlgb,EAAAC,QAAAuhb,EAUAA,EAAAl3U,UAAA89O,UAAA,SAAAl/G,GAGA,MAFA,iBAAAA,IAAAA,EAAAg3M,EAAAh3M,IACAA,IAAAA,EAAAg3M,EAAAtvV,IACAs4I,GAGAs4M,EAAAl3U,UAAA63U,aAAA,SAAAz0Q,EAAA00Q,GACA,OAAAz1U,KAAAy7O,UAAAg6F,GAAAA,EAAAT,aACAj0Q,GAAAA,EAAAi0Q,aACAh1U,KAAA+gE,KAAAi0Q,cAGAH,EAAAl3U,UAAA+3U,eAAA,SAAA30Q,EAAA00Q,GACA,OAAAz1U,KAAAy7O,UAAAg6F,IAAAA,EAAAha,eAAAga,EAAAl5M,WACAx7D,IAAAA,EAAA06P,eAAA16P,EAAAw7D,WACAv8H,KAAA+gE,KAAA06P,eAAAz7T,KAAA+gE,KAAAw7D,WAGAs4M,EAAAl3U,UAAAo3U,UAAA,SAAA//a,EAAA+rK,EAAA00Q,GACA,OAAAz1U,KAAAw1U,aAAAz0Q,EAAA00Q,GAAAnyU,OAAAtuG,IAGA6/a,EAAAl3U,UAAAy3U,YAAA,SAAA1hb,EAAAqtK,EAAA00Q,GACA,OAAAz1U,KAAA01U,eAAA30Q,EAAA00Q,GAAAnyU,OAAA5vG,IAGAmhb,EAAAl3U,UAAA43U,UAAA,SAAAvgb,EAAA+rK,GACA,OAAA/gE,KAAAw1U,aAAAz0Q,GAAA38D,OAAApvG,IAGA6/a,EAAAl3U,UAAA03U,YAAA,SAAA3hb,EAAAqtK,GACA,OAAA/gE,KAAA01U,eAAA30Q,GAAA38D,OAAA1wG,IAGAmhb,EAAAl3U,UAAA23U,YAAA,SAAA1Z,EAAA76P,GACA,OAAA66P,EAAAxxV,KAAAm6L,IACA,MAAAvzG,EAAA,CACAlqF,KAAAy9L,EAAAz9L,KACA9xE,IAAAgrG,KAAA+0U,UAAAxwK,EAAAvvQ,IAAA+rK,EAAAwjG,IAQA,OANAvkK,KAAA+7T,YAAAh7P,EAAAwjG,KAAAvzG,EAAAgkR,YAAA,UACAzwK,EAAA55K,SAAAqmE,EAAArmE,OAAA45K,EAAA55K,QACA,UAAA45K,IACAvzG,EAAAt9J,MAAAssG,KAAAo1U,YAAA7wK,EAAA7wQ,MAAAqtK,EAAAwjG,GACAvkK,KAAA+yU,cAAAhyQ,EAAAwjG,KAAAvzG,EAAAyqQ,cAAA,WAEAzqQ,MAIA6jR,EAAAl3U,UAAAu3U,WAAA,SAAAS,GACA,MAAAxpV,EAAA,GAEA,IAAA,MAAAn3F,KAAAxB,OAAAW,KAAAwhb,GAAA,CACA,GAAA,UAAA3gb,GAAA,QAAAA,EACA,MAAA,IAAA8jG,MAAA,8DAGA3M,EAAAn3F,GAAA+8a,EAAAhzV,IAAA/pF,GACAgrG,KAAA+0U,UAAAY,EAAA3gb,GAAA2gb,GACAA,EAAA3gb,GAGA,OAAAm3F,GAGA0oV,EAAAl3U,UAAAi4U,oBAAA,SAAA70Q,GACA,OAAAA,EAAA5sK,MAAA4sK,EAAA3jE,OACA,CAAApoG,EAAAtB,KACA,CACAsB,IAAAgrG,KAAAu1U,UAAAvgb,EAAA+rK,GACArtK,MAAAssG,KAAAq1U,YAAA3hb,EAAAqtK,KAGAA,EAAA5sK,KACAa,GACAgrG,KAAAu1U,UAAAvgb,EAAA+rK,GAEAA,EAAA3jE,OACA,CAAAjiB,EAAAznF,IACAssG,KAAAq1U,YAAA3hb,EAAAqtK,GAGA,cAIA8zQ,EAAAl3U,UAAAo+T,YAAA,SAAAh7P,GACA,OAAA/gE,KAAAw1U,aAAAz0Q,GAAA8uC,QAGAglO,EAAAl3U,UAAAo1U,cAAA,SAAAhyQ,GACA,OAAA/gE,KAAA01U,eAAA30Q,GAAA8uC,+DC3GA,0BAEQozC,GAAW1vP,EAAQ,UAE3BD,EAAQuvP,KAAOvvP,EAAQ,SAAA,CACrBgwG,OAAQ,SAAUopD,UACTmpR,EAASnpR,GAAQA,EAAOrmF,OAAOqmF,IAExCtoD,OAAQqC,EACRopG,QAAQ,EACR/oI,KAAM,QAGRxzE,EAAQq8N,KAAAA,CACNrsH,OAAQz7B,KAAKC,UACbs8B,OAAQv8B,KAAKoH,MACb4gI,QAAQ,EACR/oI,KAAM,QAGRxzE,EAAQmiQ,OAAAA,CACNnyJ,OAAQ,SAAUopD,UACTmpR,EAASnpR,GAAQA,EAAOu2F,EAAOx5F,KAAKiD,IAE7CtoD,OAAQqC,EACRopG,QAAQ,EACR/oI,KAAM,UAGRxzE,EAAQwib,KAAAA,CACNxyU,OAAQmD,EACRrC,OAAQqC,EACRopG,QAAQ,EACR/oI,KAAM,MAGRxzE,EAAQ2wF,GAAK3wF,EAAQwib,WAEfC,EAAAA,CACJ,MACA,QACA,SACA,OACA,QACA,UACA,sBAGSjvW,KAAQivW,EACjBzib,EAAQwzE,GAAAA,CACNw8B,OAAQ,SAAUopD,UACTmpR,EAASnpR,GAAQA,EAAOu2F,EAAOx5F,KAAKiD,EAAM5lF,IAEnDs9B,OAAQ,SAAUyrG,UACTA,EAAOzxG,SAASt3B,IAEzB+oI,QAAQ,EACR/oI,KAAMA,GAIV,SAAA2/B,EAAmB/yG,UACVA,EAGT,SAAAmib,EAAmBnpR,UACVA,MAAAA,GAAuCu2F,EAAO8H,SAASr+F,8CChEhE,aAEAr5J,EAAAC,QAAA4oa,EAEA,MAAAgV,EAAA39a,EAAA,sBAAA29a,kBACAz+I,EAAAl/R,EAAA,YACA0hb,EAAA1hb,EAAA,cACAqrW,EAAArrW,EAAA,oBACA8qW,EAAA9qW,EAAA,sBACAyib,EAAAzib,EAAA,kBACA65J,EAAA75J,EAAA,gBACA0ib,EAAA1ib,EAAA,oBAEA2ib,EAAA,YAEA,SAAAha,EAAA1zN,EAAAznC,GACA,KAAA/gE,gBAAAk8T,GAAA,OAAA,IAAAA,EAAA1zN,EAAAznC,GAWA,GATAmwQ,EAAAtzU,KAAAoC,KAAA,CACAmzU,WAAA6C,EAAA7C,WAAAgD,WACA/C,WAAA,EACAC,YAAA,EACAjmR,OAAA,IAGA2T,EAAAA,GAAA,GAEA,iBAAAynC,EACA,MAAA,IAAA1vG,MAAA,mDAGAkH,KAAAwoG,SAAAA,EACAxoG,KAAArV,OAAA,MAAAo2E,EAAAp2E,OAAAurV,EAAAn1Q,EAAAp2E,OACAqV,KAAA0D,QAAAt9B,SAAA26F,EAAAr9D,SAAA,EAAA,IAGA+uL,EAAAypI,EAAAgV,GAEAhV,EAAAv+T,UAAA72B,KAAA,WAEAo1V,EAAAv+T,UAAA6zU,MAAA,SAAA78a,EAAA0lK,GACA,MAAAi/F,EAAA68K,UAAAp2V,KAAAigB,KAAArV,OAAAqV,KAAAwoG,SAAAxoG,KAAA0D,SAEA41J,EAAA9mC,QAAA,WACAn4D,EAAAi/F,EAAA/pL,OAAA,IAAAupB,MAAA,mBAGAwgK,EAAAq/J,UAAA,KACA34T,KAAAm+K,GAAA7kB,EAAA1uL,OACAyvF,KAGAi/F,EAAA88K,gBAAArqN,IACA,MAAAoyD,EAAApyD,EAAA3gD,OAAAxgG,OAEAuzM,EAAAk4J,iBAAAhlF,SAAArxP,KAAAwoG,WACA21E,EAAAm4J,kBAAAt2U,KAAAwoG,YAKA0zN,EAAAv+T,UAAAs8R,MAAA,SAAAv/S,GAEA,OADAslB,KAAAm+K,GAAAo3I,YAAA,CAAAv1T,KAAAwoG,UAAA9tH,GACA67V,YAAAv2U,KAAAwoG,WAGA0zN,EAAAv+T,UAAAqgE,MAAA,SAAA4zD,EAAAv3D,GACA,MAAAk7P,EAAA3jM,EAAA2jM,YAIAA,EAAAvjM,QAAA,WACA33D,EAAAk7P,EAAAhmV,OAAA,IAAAupB,MAAA,qBAGAy8T,EAAAngJ,WAAA,WACA/6G,EAAA,KAAAu3D,EAAAhnJ,UAIAsxV,EAAAv+T,UAAAqpG,KAAA,SAAAhyM,EAAAL,EAAA0lK,GACA,MAAA4/N,EAAAj6R,KAAAi6R,MAAA,YACA,IAAA3gI,EAEA,IACAA,EAAA2gI,EAAAz4S,IAAAxsF,GACA,MAAAykG,GACA,OAAAuG,KAAAsyU,UAAAj4Q,EAAA5gE,GAGAuG,KAAAg+D,MAAAs7F,GAAA,SAAA7/J,EAAA/lG,GACA,OAAA+lG,EAAA4gE,EAAA5gE,QAEA/jG,IAAAhC,EAEA2mK,EAAA,IAAAvhE,MAAA,kBAGAuhE,EAAA,KAAAgkM,EAAA3qW,EAAAiB,EAAA69a,eAIAtW,EAAAv+T,UAAAg1U,KAAA,SAAA39a,EAAAL,EAAA0lK,GACA,MAAA4/N,EAAAj6R,KAAAi6R,MAAA,aACA,IAAA3gI,EAEA,IACAA,EAAA2gI,EAAAx2S,OAAAzuF,GACA,MAAAykG,GACA,OAAAuG,KAAAsyU,UAAAj4Q,EAAA5gE,GAGAuG,KAAAg+D,MAAAs7F,EAAAj/F,IAGA6hQ,EAAAv+T,UAAA+0U,KAAA,SAAA19a,EAAAtB,EAAAiB,EAAA0lK,GACA,MAAA4/N,EAAAj6R,KAAAi6R,MAAA,aACA,IAAA3gI,EAEA,IAGAA,EAAA2gI,EAAA5oK,IAAA39N,EAAAsB,GACA,MAAAykG,GACA,OAAAuG,KAAAsyU,UAAAj4Q,EAAA5gE,GAGAuG,KAAAg+D,MAAAs7F,EAAAj/F,IAGA6hQ,EAAAv+T,UAAAg0U,cAAA,SAAA38a,GACA,OAAA4pW,EAAA5pW,EAAAgrG,KAAAs8T,SAAA6W,aAGAjX,EAAAv+T,UAAAi0U,gBAAA,SAAAl+a,GACA,OAAAkrW,EAAAlrW,GAAA,IAGAwoa,EAAAv+T,UAAA4zU,UAAA,SAAA58a,GACA,OAAA,IAAAsgb,EAAAj1U,KAAAA,KAAAwoG,SAAA7zM,IAGAuna,EAAAv+T,UAAA0qS,OAAA,SAAAuc,EAAAjwZ,EAAA0lK,GACA,GAAA,IAAAuqP,EAAA3/U,OAAA,OAAA+6B,KAAAsyU,UAAAj4Q,GAEA,MAAA4/N,EAAAj6R,KAAAi6R,MAAA,aACAs7B,EAAAt7B,EAAAs7B,YACA,IACAhmV,EADAhK,EAAA,EAGAgwV,EAAAvjM,QAAA,WACA33D,EAAA9qF,GAAAgmV,EAAAhmV,OAAA,IAAAupB,MAAA,qBAGAy8T,EAAAngJ,WAAA,WACA/6G,KAIA,SAAA1M,IACA,MAAAqD,EAAA4zP,EAAAr/U,KACAvwE,EAAAg8J,EAAAh8J,IAEA,IAAAskQ,EAEA,IACAA,EAAA,QAAAtoG,EAAAlqF,KAAAmzT,EAAAx2S,OAAAzuF,GAAAilY,EAAA5oK,IAAArgE,EAAAt9J,MAAAsB,GACA,MAAAykG,GAGA,OAFAlqB,EAAAkqB,OACA87T,EAAAviR,QAIAztE,EAAAq/U,EAAA3/U,SACAq0L,EAAAq/J,UAAAhrQ,GAIAA,IAGAuuQ,EAAAv+T,UAAAm1U,OAAA,SAAAn+a,EAAA0lK,GACA,IAAAm8Q,EACAl9K,EAEA,IACAk9K,EAAAP,EAAAthb,GACA,MAAAZ,GAGA,OAAAisG,KAAAsyU,UAAAj4Q,GAGA,GAAA1lK,EAAAogU,OAAA,EAGA,OAAA3nK,EAAAptD,KAAAA,KAAAwoG,SAAAguO,EAAA7hb,EAAA0lK,GAGA,IACA,MAAA4/N,EAAAj6R,KAAAi6R,MAAA,aACA3gI,EAAAk9K,EAAAv8C,EAAAx2S,OAAA+yV,GAAAv8C,EAAA7sO,QACA,MAAA3zD,GACA,OAAAuG,KAAAsyU,UAAAj4Q,EAAA5gE,GAGAuG,KAAAg+D,MAAAs7F,EAAAj/F,IAGA6hQ,EAAAv+T,UAAA+zU,OAAA,SAAAr3Q,GACAr6D,KAAAm+K,GAAAn+L,QACAggB,KAAAsyU,UAAAj4Q,IAIA6hQ,EAAAv+T,UAAA6qQ,QAAA,SAAAnuM,GACA,GAAA,SAAAr6D,KAAA27G,OACA,OAAA37G,KAAAsyU,UAAAj4Q,EAAA,IAAAvhE,MAAA,mCAGA,MAAA0gQ,EAAAx5P,KAAAyqD,WACAgsR,EAAA,GACAn3U,EAAAU,KAKA,SAAA5iB,EAAAqc,GACA,GAAAA,EAAA,OAAAggI,EAAAhgI,GACA+/P,EAAAp8Q,KAAAs5V,GAGA,SAAAA,EAAAj9U,EAAAzkG,EAAAtB,GACA,GAAA+lG,QAAA/jG,IAAAV,EACA,OAAAykO,EAAAhgI,GAGA,MAAAi4P,EAAApyP,EAAAqyU,cAAAtzE,EAAArpW,GAAA,IACAi6K,EAAA3vE,EAAAsyU,gBAAAvzE,EAAA3qW,GAAA,IAMA4rG,EAAA+oS,OAAA,CACA,CAAAvhU,KAAA,MAAA9xE,IAAAA,GACA,CAAA8xE,KAAA,MAAA9xE,IAAA08V,EAAAh+V,MAAAu7K,IACAwnQ,EAAAr5V,GAGA,SAAAq8I,EAAAhgI,GACA+/P,EAAAx0R,KAAA,SAAA2wQ,GACAt7K,EAAA5gE,GAAAk8O,MA5BA6jB,EAAA++D,gBAAA/+D,EAAAg/D,kBAgCA,SAAA9rQ,GACA,OAAAA,GAhCAtvE,KAoCA8+U,EAAA5uN,QAAA,SAAA9E,EAAA79G,EAAA0vE,GACA,mBAAA1vE,IACA0vE,EAAA1vE,EACAA,EAAAurV,GAEA,MAAAtkN,EAAAukN,UAAAQ,eAAAhsV,EAAA69G,GACAopB,EAAA+mM,UAAA,WACAt+P,KAEAu3D,EAAAY,QAAA,SAAA/4H,GACA4gE,EAAA5gE,wOCjRA,aAEA,MAAAg5L,EAAAl/R,EAAA,YACAs+a,EAAAt+a,EAAA,sBAAAs+a,iBACAoE,EAAA1ib,EAAA,oBACA8qW,EAAA9qW,EAAA,sBACA60M,EAAA,aAIA,SAAA6sO,EAAA92J,EAAA31E,EAAA7zM,GAiBA,GAhBAk9a,EAAAj0U,KAAAoC,KAAAm+K,GAEAn+K,KAAA42U,OAAAjib,EAAAogU,MACA/0N,KAAAw/G,OAAA,EACAx/G,KAAA62U,UAAA,KACA72U,KAAAmtH,OAAA,GACAntH,KAAA82U,YAAA,EACA92U,KAAA+2U,UAAA,EACA/2U,KAAAg3U,OAAA,KACAh3U,KAAAi3U,aAAA,KAEAj3U,KAAA2nK,MAAAhzQ,EAAAR,KACA6rG,KAAAk3U,QAAAvib,EAAAyoG,OACA4C,KAAAm3U,aAAAxib,EAAAona,YACA/7T,KAAAo3U,eAAAzib,EAAAo+a,cAEA,IAAA/yU,KAAA42U,OAEA,YADA52U,KAAA82U,YAAA,GAIA,IAAAN,EAEA,IACAA,EAAAP,EAAAthb,GACA,MAAAZ,GAIA,YADAisG,KAAA82U,YAAA,GAIA92U,KAAAq3U,eAAA7uO,EAAAguO,EAAA7hb,EAAAurN,SAnCA7sN,EAAAC,QAAA2hb,EAsCAxiJ,EAAAwiJ,EAAApD,GAEAoD,EAAAt3U,UAAA05U,eAAA,SAAA7uO,EAAAguO,EAAAt2N,GACA,MAAAq1M,EAAAv1T,KAAAm+K,GAAAA,GAAAo3I,YAAA,CAAA/sN,GAAA,YACA+sN,EAAAghB,YAAA/tO,GACA8uO,WAAAd,EAAAt2N,EAAA,OAAA,QAEAy4M,UAAA5sM,IACA,MAAAztI,EAAAytI,EAAA3gD,OAAAxgG,OACA0T,GAAA0hB,KAAAu3U,OAAAj5V,IAGA0hB,KAAAi3U,aAAA1hB,EAGAA,EAAAvjM,QAAA,KACAhyH,KAAA83H,QAAA93H,KAAAi3U,aAAA1nW,OAAA,IAAAupB,MAAA,qBAGAy8T,EAAAngJ,WAAA,KACAp1K,KAAAw3U,eAIAvC,EAAAt3U,UAAA45U,OAAA,SAAAj5V,GACA0hB,KAAAmtH,OAAAriJ,KAAAwT,EAAAtpF,IAAAspF,EAAA5qF,QAEAssG,KAAA42U,QAAA,KAAA52U,KAAAw/G,OAAAx/G,KAAA42U,SACAt4V,EAAAm5V,WAGAz3U,KAAA03U,aAGAzC,EAAAt3U,UAAAm6H,QAAA,SAAAr+H,GACAuG,KAAA+2U,UAAA,EACA/2U,KAAAg3U,OAAAv9U,EACAuG,KAAA03U,aAGAzC,EAAAt3U,UAAA65U,WAAA,WACAx3U,KAAA82U,YAAA,EACA92U,KAAA03U,aAGAzC,EAAAt3U,UAAA+5U,UAAA,WACA13U,KAAA62U,YACA72U,KAAAsnQ,MAAAtnQ,KAAA62U,WACA72U,KAAA62U,UAAA,OAIA5B,EAAAt3U,UAAA2pQ,MAAA,SAAAjtM,GACA,GAAAr6D,KAAA+2U,SAAA,CAEA,MAAAt9U,EAAAuG,KAAAg3U,OACAh3U,KAAAg3U,OAAA,KACAh3U,KAAAsyU,UAAAj4Q,EAAA5gE,QACA,GAAAuG,KAAAmtH,OAAAloJ,OAAA,EAAA,CACA,IAAAjwE,EAAAgrG,KAAAmtH,OAAAxoH,QACAjxG,EAAAssG,KAAAmtH,OAAAxoH,QAGA3vG,EADAgrG,KAAA2nK,YAAAjyQ,IAAAV,EACAgrG,KAAAu4T,gBAAAvja,EAAAgrG,KAAAm3U,mBAEAzhb,EAIAhC,EADAssG,KAAAk3U,cAAAxhb,IAAAhC,EACAssG,KAAAw4T,kBAAA9ka,EAAAssG,KAAAo3U,qBAEA1hb,EAGAsqG,KAAAsyU,UAAAj4Q,EAAA,KAAArlK,EAAAtB,QACAssG,KAAA82U,WACA92U,KAAAsyU,UAAAj4Q,GAEAr6D,KAAA62U,UAAAx8Q,GAKA46Q,EAAAt3U,UAAA46T,gBAAAl6D,EACA42E,EAAAt3U,UAAA66T,kBAAAn6D,EAEA42E,EAAAt3U,UAAAg2U,KAAA,SAAAt5Q,GACA,GAAAr6D,KAAA+2U,UAAA/2U,KAAA82U,WACA,OAAA92U,KAAAsyU,UAAAj4Q,EAAAr6D,KAAAg3U,QAMAh3U,KAAAu3U,OAAAnvO,EACApoG,KAAA83H,QAAAz9D,EACAr6D,KAAAw3U,WAAAn9Q,sIC5IA,aAEA,MAAAs7Q,EAAApib,EAAA,QACAg5P,EAAAr2P,OAAA,QAEA7C,EAAAC,QAAA,SAAAqB,GACA,MAAAgjb,EAAAhC,EAAAviJ,WAAAz+R,EAAA43P,GACAqrL,EAAAjC,EAAAkC,WAAAljb,EAAA43P,GACAurL,EAAAnC,EAAAoC,oBAAApjb,EAAA43P,GACAyrL,EAAArC,EAAAsC,oBAAAtjb,EAAA43P,GAEA,OAAAorL,IAAAprL,GAAAqrL,IAAArrL,EACA2rL,YAAAzvS,MAAAkvS,EAAAC,EAAAE,EAAAE,GACAL,IAAAprL,EACA2rL,YAAA9kJ,WAAAukJ,EAAAG,GACAF,IAAArrL,EACA2rL,YAAAL,WAAAD,EAAAI,GAEA,uECAA,SAAAG,EAAgBx+U,eACCjkG,IAARikG,GAA6B,KAARA,EAG9B,SAAA5a,EAAc4Q,EAAO98F,UACZW,OAAOgnG,eAAeoD,KAAKjO,EAAO98F,GAG3C,SAAAulb,EAAgBzoV,EAAO98F,UACdW,OAAOgnG,eAAeoD,KAAKjO,EAAO98F,IAASA,EA5BpDS,EAAQw+T,QAAU,SAAUjrP,EAAGyS,MAE1B2pK,EAAO8H,SAASlkL,GAAAA,SACbkiB,EAAInjB,KAAKq0B,IAAIpzB,EAAE5B,OAAQqU,EAAErU,QACrBkC,EAAI,EAAGA,EAAI4hB,EAAG5hB,IAAAA,KAChBggC,EAAMtgC,EAAEM,GAAKmS,EAAEnS,MAChBggC,EAAAA,OAAYA,SAEVtgC,EAAE5B,OAASqU,EAAErU,cAGf4B,EAAIyS,GAAK,EAAIzS,EAAIyS,EAAI,EAAI,OAoB9B++V,EAAgB/kb,EAAQ+kb,cAAgB,SAAU1oV,UAE/CyoV,EAAOzoV,EAAO,OACdyoV,EAAOzoV,EAAO,QACdyoV,EAAOzoV,EAAO,SACbA,EAAMuwH,QAAUk4N,EAAOzoV,EAAO,OAASyoV,EAAOzoV,EAAO,gBACtDj6F,GAIH09R,EAAa9/R,EAAQ8/R,WAAa,SAAUzjM,EAAOiP,OACjDvqG,EAAIgkb,EAAc1oV,UACft7F,EAAIs7F,EAAMt7F,GAAKuqG,GAGpB05U,EAAsBhlb,EAAQglb,oBAAsB,SAAU3oV,UACzD5Q,EAAI4Q,EAAO,OAGhB4oV,EAAsBjlb,EAAQilb,oBAChC,SAAU5oV,UACA5Q,EAAI4Q,EAAO,OAGnBooV,EAAsBzkb,EAAQykb,oBAChC,SAAUpoV,UACA2oV,EAAoB3oV,IAG5BsoV,EAAsB3kb,EAAQ2kb,oBAChC,SAAUtoV,UACA4oV,EAAoB5oV,IAG5B6oV,EAAgBllb,EAAQklb,cAAgB,SAAU7oV,UAE/CyoV,EAAOzoV,EAAO,OACdyoV,EAAOzoV,EAAO,QACdyoV,EAAOzoV,EAAO,SACbA,EAAMuwH,QAAUk4N,EAAOzoV,EAAO,SAAWyoV,EAAOzoV,EAAO,cACxDj6F,GAIHmib,EAAavkb,EAAQukb,WAAa,SAAUloV,EAAOiP,OACjDvqG,EAAImkb,EAAc7oV,UACft7F,EAAIs7F,EAAMt7F,GAAKuqG,GAwBxB,SAAA3a,EAAalwF,UAAYA,EArBzBT,EAAQ0hF,MAAQ,SAAU2a,EAAOiP,UACxBjP,EAAMuwH,QAAU23N,EAAWloV,EAAOiP,GAAOw0L,EAAWzjM,EAAOiP,IAEpEtrG,EAAQ0xE,IAAM,SAAU2qB,EAAOiP,UACtBjP,EAAMuwH,QAAUkzE,EAAWzjM,EAAOiP,GAAOi5U,EAAWloV,EAAOiP,IAEpEtrG,EAAQmlb,eAAiB,SAAU9oV,UAE/BA,EAAMuwH,QACNq4N,EAAoB5oV,GACpB2oV,EAAoB3oV,IAGxBr8F,EAAQolb,aAAe,SAAU/oV,UAE7BA,EAAMuwH,QACNo4N,EAAoB3oV,GACpB4oV,EAAoB5oV,IAMxBr8F,EAAQqlb,OAAS,SAAUhpV,EAAOipV,EAAQxuW,EAAKutW,EAAOC,GACpDgB,EAASA,GAAAA,GACTxuW,EAAMA,GAAO6Z,MACTwuH,EAAWp8H,UAAUpR,OAAS,EAC9B4zW,EAAKvlb,EAAQ+kb,cAAc1oV,GAC3BmpV,EAAKxlb,EAAQklb,cAAc7oV,UAC5BkpV,EACS,OAAPA,EAAaD,EAAO5hb,GAAKozE,EAAIulB,EAAM34F,IAAI,GAC1B4hb,EAAO/4I,IAAMz1N,EAAIulB,EAAMkpV,IAAK,GAEtCpmO,IACNmmO,EAAO/4I,IAAMz1N,EAAIutW,GAAO,IAEvBmB,EACS,OAAPA,EAAaF,EAAO1hb,GAAKkzE,EAAIulB,EAAMz4F,IAAI,GAC1B0hb,EAAO54I,IAAM51N,EAAIulB,EAAMmpV,IAAK,GAEtCrmO,IACNmmO,EAAO54I,IAAM51N,EAAIwtW,GAAO,IAEN,MAAjBjoV,EAAMuwH,UACP04N,EAAO14N,UAAYvwH,EAAMuwH,SAKxBnhI,EAAI65V,EAAQ,eAAiBA,EAAOjzW,IACpCoZ,EAAI65V,EAAQ,eAAiBA,EAAO3+U,IACpClb,EAAI65V,EAAQ,iBAAiBA,EAAO5jW,MACpC+J,EAAI65V,EAAQ,eAAiBA,EAAO5zW,IAEhC4zW,GAGTtlb,EAAQ+9V,SAAW,SAAU1hQ,EAAO36F,EAAK88T,GACvCA,EAAUA,GAAWx+T,EAAQw+T,YAEzB+mH,EAAKzlJ,EAAWzjM,MACjBwoV,EAAMU,MACH1xU,EAAM2qN,EAAQ98T,EAAK6jb,IACd,GAAc,IAAR1xU,GAAa4wU,EAAoBpoV,IAAAA,OACvC,MAKLwX,EAFF2xU,EAAKjB,EAAWloV,MACjBwoV,EAAMW,MACH3xU,EAAM2qN,EAAQ98T,EAAK8jb,IACd,GAAc,IAAR3xU,GAAc8wU,EAAoBtoV,IAAAA,OACxC,SAGJ,GAGTr8F,EAAQy6E,OAAS,SAAU4hB,EAAOmiO,UACzB,SAAU98T,UACR1B,EAAQ+9V,SAAS1hQ,EAAO36F,EAAK88T,iDChKxC,sCAEM7uE,EAAS1vP,EAAQ,UAAU0vP,OAC3B81L,EAAAA,cACAv5U,EAAO8wH,YAAAA,OACHD,EAAAA,IAAcC,YAAY,gBACzBD,EAAQjsH,OAAOzL,KAAK03H,UAEpB,SAAiB2oN,UACfC,EAAOD,GAAI56U,YANlB26U,GAWAG,EAAAA,cACA15U,EAAO8wH,YAAAA,OACHD,EAAAA,IAAcC,YAAY,gBACzBD,EAAQjsH,OAAOzL,KAAK03H,UAEpB,SAAiB8oN,UACfl2L,EAAOx5F,KAAK0vR,GAAI/6U,YANvB86U,GAWN,SAAAD,EAAiBD,SACTzoN,EAAM0yB,EAAOx5F,KAAKuvR,EAAGnpO,eAEvBmpO,EAAG56M,aAAe46M,EAAGnpO,OAAOuuB,WACvB7N,EAEAA,EAAInrJ,MAAM4zW,EAAG76M,WAAY66M,EAAG76M,WAAa66M,EAAG56M,YAIvD/qO,EAAOC,QAAU,SAAUo5J,EAAM8lR,UAC3B9lR,aAAgB+rE,WACX+5M,EAAWyG,EAAOvsR,GAAQqsR,EAAOrsR,GAC/BA,aAAgBuxE,YAClBu0M,EAAWvvL,EAAOx5F,KAAKiD,GAAQwsR,EAAOxsR,GAEtC8lR,EAAWvvL,EAAOx5F,KAAKpjF,OAAOqmF,IAASrmF,OAAOqmF,gDCzCzD,sCAEMu2F,EAAS1vP,EAAQ,UAAU0vP,OAG3Bm2L,EAAAA,cACA55U,EAAOspH,YAAAA,OACHihJ,EAAAA,IAAcjhJ,YAAY,gBACzBihJ,EAAQzmQ,OAAO3K,KAAKoxQ,UAEpB9mH,EAAOx5F,KALZ2vR,GASN/lb,EAAOC,QAAU,SAAUo5J,EAAM8lR,UAC3BA,EACKvvL,EAAO8H,SAASr+F,GAAQA,EAAO0sR,EAAQ/yW,OAAOqmF,IAE9CrmF,OAAOqmF,gDClBlB,mBAEMu2F,EAAS1vP,EAAQ,UAAU0vP,OAEjC3vP,EAAQmyE,KAAO,SAAUzwE,UAChB,SAAe0iO,cAElBA,EAAKvwH,IAAInyG,EAAK,IACP,QACAykG,UACA,KAMbnmG,EAAQ6/a,WAAa7/a,EAAQmyE,KAAKw9K,EAAOO,MAAM,gDChB/C,aAEAnwP,EAAAC,QAAA,SAAA6qR,EAAA31E,EAAAguO,EAAA7hb,EAAA0lK,GACA,GAAA,IAAA1lK,EAAAogU,MAAA,OAAA52C,EAAAm0J,UAAAj4Q,GAEA,MAAAk7P,EAAAp3I,EAAAA,GAAAo3I,YAAA,CAAA/sN,GAAA,aACAyxL,EAAAs7B,EAAAghB,YAAA/tO,GACA,IAAAjlH,EAAA,EAEAgyU,EAAAngJ,WAAA,WACA/6G,KAGAk7P,EAAAvjM,QAAA,WACA33D,EAAAk7P,EAAAhmV,OAAA,IAAAupB,MAAA,qBAIA,MAAAskC,EAAA68P,EAAAo/C,cAAA,gBAAA,aACAtsO,EAAAp4M,EAAAurN,QAAA,OAAA,OAEA+5K,EAAA78P,GAAAo5S,EAAAzpO,GAAA4rN,UAAA,SAAA5sM,GACA,MAAAztI,EAAAytI,EAAA3gD,OAAAxgG,OAEA0T,IAEA27S,EAAAx2S,OAAAnF,EAAAtpF,KAAA2ja,UAAA,YACAhka,EAAAogU,OAAA,KAAAxxO,EAAA5uF,EAAAogU,QACAz2O,EAAAm5V,2CC5BA,aAGApkb,EAAAC,QAAA,CACAm+Z,KAAA,CACA3qV,KAAA,QACAu0T,OAAA,CACA,CACAE,WAAA,UACAz0T,KAAA,UACA6jB,OAAA,mBACAjgB,MAAA,CACA5D,KAAA,SACAn0E,KAAA,SACAgzU,MAAA,EACAgsF,UAAA,yCAGA,CACAp2B,WAAA,IACAz0T,KAAA,UACA6jB,OAAA,oBACAjgB,MAAA,CACA5D,KAAA,UACAn0E,KAAA,YACA+oa,YAAA,0CCzBA,aAEA,MAAA3oS,EAAAx/H,EAAA,YAGA84N,EAFA94N,EAAA,QAEA0wU,CAAA,kBAEAq1G,EAAA,YAGApgB,EAAA,GAYA5la,EAAAq2W,KAAAr2N,MAAArmE,IACA,MAAA6zB,EAAA7zB,EAAA,IAAAqsW,EAGA,GAFAjtN,EAAA,aAAAvrH,IAEA,IAAAo4T,EAAAp4T,GACA,MAAA,IAAAiyB,EAAAynS,gBAAA,qCAAA15T,KAGAo4T,EAAAp4T,IAAA,EAQA,MAPA,CACAjqG,cACAqia,EAAAp4T,WACAo4T,EAAAp4T,MAaAxtG,EAAAimb,OAAAjmS,MAAArmE,IACA,MAAA6zB,EAAA7zB,EAAA,IAAAqsW,EAGA,OAFAjtN,EAAA,kBAAAvrH,KAEAzjB,QAAA67U,EAAAp4T,mECnDA,aAEA,MAAA04U,EAAAjmb,EAAA,QACAkmb,EAAAlmb,EAAA,gBACAmmb,EAAAnmb,EAAA,mBAeAF,EAAAC,QAbA,MAMAuD,aAAAmjU,KAAAA,EAAAE,QAAAA,IACAl6N,KAAAg6N,KAAAy/G,EAAA,CAAAz/G,KAAAA,IACAh6N,KAAA25U,GAAAH,EAAA,CAAAt/G,QAAAA,IACAl6N,KAAAo7N,QAAAs+G,EAAA,CAAAx/G,QAAAA,mGCfA,aAEA,MAAA/mU,QAAAknW,GAAA9mW,EAAA,kBACAupT,EAAAvpT,EAAA,YACAupU,EAAAvpU,EAAA,2CA0BA,SAAAqmb,EAAAj+G,EAAA56J,GACA,IAAAw6J,EAYA,GAPAA,EAHAI,EAAAk+G,QAEA94Q,EAAA+4Q,KACAn+G,EAAAk+G,QAAAE,QAAAh5Q,EAAA+4Q,MACA/4Q,EAAA12B,MACAsxL,EAAAk+G,QAAAG,YAAAj5Q,EAAA12B,OAEAsxL,EAAAk+G,QAAAr6U,YANA9pG,GASA6lU,EACA,MAAA,CACA0+G,QAAAj+S,OAAA,GACAk+S,SAAAl+S,OAAA,GACAm+S,OAAAn+S,OAAA,GACAo+S,QAAAp+S,OAAA,IAIA,MAAAq+S,eAAAA,EAAAh4C,SAAAA,GAAA9mE,EAEA,MAAA,CACA0+G,QAAAj+S,OAAAqmQ,EAAAO,aAAAxkS,YACA87U,SAAAl+S,OAAAqmQ,EAAAS,SAAA1kS,YACA+7U,OAAAn+S,OAAAq+S,EAAAz3C,aAAA,KAAA03C,gBAAA,IACAF,QAAAp+S,OAAAq+S,EAAAv3C,SAAA,KAAAw3C,gBAAA,KAQAjnb,EAAAC,QAAA,EAAA4mU,QAAAA,KAiCA4C,GA7BAxpL,gBAAA3+I,EAAA,IACA,MAAAgnU,OAAAA,SAAAzB,EAAAjnU,IAAA0B,GAEA,IAAAA,EAAA4lb,KAEA,kBADAX,EAAAj+G,EAAAhnU,IAIA,MAAA2wW,EAAA3wW,EAAA2wW,UAAA,IACA,IAQA0+C,EARAl0L,GAAA,EACA,IAEA,GADAA,EAAA,iBAAAw1I,EAAAjL,EAAAiL,KAAA,EAAAA,GACAx1I,GAAAA,EAAA,EAAA,MAAA,IAAAh3H,MAAA,oBACA,MAAAW,GACA,MAAAqjN,EAAArjN,EAAA,6BAIA,IACA,aACAmgV,EAAAj+G,EAAAhnU,SAEA,IAAAoxK,SAAAC,IAAAg+O,EAAAn5O,WAAA7E,EAAA8pD,MAEA,QACAG,aAAA+zL,gIC/FA,aAEA,MAAA55U,EAAA72E,EAAA,UACA0rP,EAAA1rP,EAAA,YA4JAF,EAAAC,QA/IA,MAMAuD,YAAA2jb,GACAx6U,KAAAu+R,MAAAi8C,EACAx6U,KAAAy6U,SAAA,KAYA5jb,YAAAukU,GACAp7N,KAAAy6U,SAAAr/G,EAMAvkU,gBACAmpG,KAAAy6U,SAAA,KAMA5jb,cACA,OAAA,MAAAmpG,KAAAy6U,SAWA5jb,IAAA22J,EAAA74J,GACA,OAAAqrG,KAAA06U,cACA16U,KAAAy6U,SAAAppN,IAAA7jE,EAAA74J,GAEAqrG,KAAAu+R,MAAAz5H,OAAAzzC,IAAA7jE,EAAA74J,GAYAkC,QAAAiuQ,EAAAnwQ,GACA,OAAAqrG,KAAA06U,cACA16U,KAAAy6U,SAAAnhF,QAAAx0F,EAAAnwQ,GAEAqrG,KAAAu+R,MAAAz5H,OAAAw0F,QAAAx0F,EAAAnwQ,GAYAkC,IAAA82N,EAAAh5N,GACA,OAAAqrG,KAAA06U,cACA16U,KAAAy6U,SAAAj5V,IAAAmsI,EAAAh5N,GAEAqrG,KAAAu+R,MAAAz5H,OAAAtjL,IAAAmsI,EAAAh5N,GAYAkC,QAAAurY,EAAAztY,GACA,IAAAkpG,MAAA/gB,QAAAslT,GACA,MAAA,IAAAtpS,MAAA,sCAGA,OAAAkH,KAAA06U,cACA16U,KAAAy6U,SAAArwB,QAAAhoB,EAAAztY,GAEAy1E,EAAAg4T,GAAAz0K,GAAA3tH,KAAAu+R,MAAAz5H,OAAAtjL,IAAAmsI,EAAAh5N,KAWAkC,aAAA82N,EAAAh5N,GACA,UAAAqrG,KAAAu+R,MAAAz5H,OAAA/lL,IAAA4uI,GACA,MAAAsxB,EAAA,IAAAnmJ,MAAA,+BAAA,uBAGA,OAAAkH,KAAAu+R,MAAAz5H,OAAArhL,OAAAkqI,EAAAh5N,GAUAkC,WAAAurY,EAAAztY,GACA,MAAAqlU,EAAAh6N,KAAAu+R,MAEA,OAAAv+R,KAAAu+R,MAAAz5H,OAAAy0F,WAAAjmN,kBACA,UAAA,MAAAq6E,KAAAy0K,EAAA,CACA,UAAApoE,EAAAl1D,OAAA/lL,IAAA4uI,GACA,MAAAsxB,EAAA,IAAAnmJ,MAAA,+BAAA,6BAGA60H,GANA,GAQAh5N,sEC3JA,aAEA,MAAAgmb,EAAApnb,EAAA,mBACAqnb,EAAArnb,EAAA,QAWAF,EAAAC,QAJA,EAAA8mU,aAAAA,EAAAzlU,QAAAA,KACA,IAAAimb,EAAAD,EAAAvgH,EAAAzlU,wECXA,aAEA,MAAA41L,EAAAh3L,EAAA,iBACA66N,EAAA76N,EAAA,cAYAsnb,EAAA,CACAr5V,IAAA4sI,EAAA0yI,UACA,OAAAvtW,EAAA,gBAEAiuF,IAAA4sI,EAAAk9I,YACA,OAAA/3W,EAAA,kBAEAiuF,IAAA4sI,EAAA0sN,OACA,OAAAvnb,EAAA,cAQAF,EAAAC,QAAA,CAAA8mU,EAAAzlU,IACA41L,EAAA3sF,KAEA,CAAAy4H,cAAA,GACA,CACA+jG,aAAAA,EACA2gH,QAAA,GAIAC,WAAArgN,IACA,GAAAkgN,EAAAlgN,GACA,OAAA50D,QAAAC,QAAA60Q,EAAAlgN,IAEA,MAAA,IAAA7hI,MAAA,wBAAAs1H,EAAA6pB,QAAAtd,SAGAhmO,0IChDA,aAEA,MAAAirG,EAAArsG,EAAA,aACA+zF,EAAA/zF,EAAA,iBASAF,EAAAC,QAAA,CACAssG,KAAAA,EACAtY,SAAAA,EACAqzI,MAAA/6H,EAAA+6H,MACAwjI,eAAAv+P,EAAAu+P,yFChBA,aAGA,MAAA5kH,EAAAhmP,EAAA,QACA66N,EAAA76N,EAAA,cACA86N,EAAA96N,EAAA,uBACA+6N,UAAAA,GAAAD,EACAE,EAAAh7N,EAAA,QAEA03W,EAAA13W,EAAA,eACAqoO,EAAAroO,EAAA,sBACA6kO,EAAA7kO,EAAA,2BAiCA,SAAA23W,EAAAhK,GACA,IAAAiK,EACA,IACAA,EAAAF,EAAA/J,GACA,MAAAntW,GACAo3W,GAAA,EAEA,GAAAA,EACA,MAAA,IAAAryQ,MAAA,6CAuCA,OAhCA,SAAA3U,EAAA0a,GACA,IAAAA,GAAAA,aAAA45H,YAAA,iBAAA55H,EACA,OAAAA,EAGA,GAAAhB,MAAA/gB,QAAA+hB,GACA,OAAAA,EAAAz0B,IAAA+Z,GAGA,GAAAoqI,EAAAsM,MAAAh8H,GACA,OA7CA,SAAA8uH,GACA,IAAA4C,EAEA,GAAA,iBAAA5C,EACA4C,EAAA,IAAAhC,EAAAZ,GAAAgL,UACA,CAAA,IAAApK,EAAAsM,MAAAlN,GAGA,MAAA,IAAA70H,MAAA,6CAFAy3H,EAAA5C,EAAAgL,MAKA,OAAA,IAAA4gB,EAAA6xH,OAhBA,GAgBAxvI,EAAA,CACAxD,EAAA,KAAA,UACA7H,GACA,EAAAA,EAAAtrJ,SA+BAomS,CAAAxsQ,GAGA,MAAA1qG,EAAAX,OAAAW,KAAA0qG,GAEA,GAAA1qG,EAAA8wE,OAAA,EAAA,CAGA,MAAA87D,EAAA,GAQA,OAPA5sI,EAAAC,SAAAY,IACA,iBAAA6pG,EAAA7pG,GACA+rI,EAAA/rI,GAAAmvF,EAAA0a,EAAA7pG,IAEA+rI,EAAA/rI,GAAA6pG,EAAA7pG,MAGA+rI,EAEA,OAAAliC,EAIA1a,CAAA+8Q,GAGA,MAAAvmI,EAAAvM,EAAAk9I,SACAnN,EAAA7vI,EAAA3qH,MAAA,YAEA6nQ,EAAA,CAIAh5R,GAAAmnB,IAEAA,EAAAA,EAAAv0B,MAAA,GACA,IAAAmpJ,EAAA50H,KAIA,IAAA8xQ,EADA,MAEA,MAAAC,EAAA,SACA,IAEAr7I,EAFAm0I,EAAAkH,EAYA,SAAAC,EAAAh3W,GACA,IAAAulN,EAAAsxJ,EAEA72W,GACA,iBAAAA,EAAAsoG,OACAwuQ,EAAA92W,EAAAsoG,MAEA,iBAAAtoG,EAAA6vW,UACAA,EAAA7vW,EAAA6vW,SAEA7vW,EAAAulN,OACAA,EAAA1mN,OAAAiqG,OAAA,GAAA+tQ,EAAA72W,GAAAA,EAAAulN,SAIAuxJ,EA9BA,MA+BAjH,EAAAkH,GAGA,MAAAE,EAAA,CACA1xJ,KAAAA,EACAj9G,KAAAwuQ,GAGAp7I,EAAA,IAAAkpB,EAAAsyH,QAAAD,GAEAH,EAAAG,EAAA3uQ,KAGA0uQ,IA8DAt4W,EAAAC,QAAA,CACAqnO,MAAAA,EACAwjI,eAAAA,EACAwN,iBAAAA,EACA/M,UA1DA,SAAA33R,GACA,MAAA6kS,EAAAZ,EAAAjkS,GAGA,OAFAsyK,EAAAj2I,OAAAwoQ,IAyDAzN,YA9CA,SAAA3xM,GAKA,GAJAA,EAAAznF,OAAAwmS,GAAA/+M,EAAAznF,QAAAu/R,GACAmH,EAAA,CAAA1uQ,KAAAyvD,EAAAznF,SAGAynF,EAAAznF,OAAAwmS,EACA,MAAA,IAAA3yQ,MAAA,yDAKA,MAAA4tH,EAAA2J,EAAA07I,UAAAr/M,GACA,GAAA,IAAAg6D,EAAAzhJ,OACA,MAAA,IAAA6zB,MAAA,8DAGA,OAAA4tH,EAAA,IA+BAiH,IApBAr6E,eAAA8qN,EAAAa,EAAA,IACA,MAAAtqW,EAAA,CACAosW,WAAA,MAAA9B,EAAA8B,WAAA,EAAA9B,EAAA8B,WACArkC,QAAA,MAAAuiC,EAAAviC,QAAArpU,EAAAC,QAAA6qW,eAAAc,EAAAviC,SAGA1hB,EAAA1sF,EAAAuN,MAAAlnO,EAAA+nU,SACArpN,QAAAg7G,EAAA+vI,EAAApjD,GACAviE,EAAArqB,EAAAopB,gBAAAnkP,EAAAC,QAAAqnO,OAGA,OAFA,IAAApM,EAAA55N,EAAAosW,WAAAtoH,EAAAplI,iMChNA,aAGA//G,EAAA04W,SAAAz4W,EAAA,cACAD,EAAAu4W,QAAAt4W,EAAA,aACAD,EAAA24W,QAAA14W,EAAA,aACAD,EAAA44W,OAAA34W,EAAA,YACAD,EAAA83W,OAAA73W,EAAA,YAGAD,EAAAy4W,UAAAz4W,EAAAu4W,QAAAE,UACAz4W,EAAA64W,YAAA74W,EAAAu4W,QAAAM,YACA74W,EAAA84W,SAAA94W,EAAA04W,SAAAI,SACA94W,EAAAgwG,OAAAhwG,EAAA24W,QAAA3oQ,OACAhwG,EAAA8wG,OAAA9wG,EAAAu4W,QAAAznQ,OAEA9wG,EAAA+4W,QAAA,CACAjoQ,OAAA9wG,EAAAu4W,QAAAE,UACAzoQ,OAAAhwG,EAAA24W,QAAA3oQ,OACAusG,QAAA,EACAh9M,KAAA,wICpBA,0BAEQowP,GAAW1vP,EAAQ,UACrBs4W,EAAUt4W,EAAQ,aAClBgtR,EAAQhtR,EAAQ,WAMtB,MAAAy4W,UAAuBH,EACrBS,UAAWC,EAAW74W,YACV64W,KAAa74W,KAGzB84W,UAAW7yQ,UACF4rB,MAAMinP,UAAU7yQ,GAAKyE,WAG9BquQ,YAAa/qN,EAAG0iE,UACP7+F,MAAMknP,YAAY/qN,EAAG0iE,GAAGhmH,WAGjCsuQ,YAAaC,EAAIC,EAAIC,EAAI5vF,UAChB13J,MAAMmnP,YAAYC,EAAIC,EAAIC,EAAI5vF,GAAI7+K,WAG3C0uQ,eAAgBprN,EAAG0iE,UACV7+F,MAAMunP,eAAeprN,EAAG0iE,GAAGhmH,WAGpC2uQ,eAAgBJ,EAAIC,EAAIC,EAAI5vF,UACnB13J,MAAMwnP,eAAeJ,EAAIC,EAAIC,EAAI5vF,GAAI7+K,WAG9C4uQ,mBACS,OAGTC,oBACS,QAGTC,YAAavzQ,SACLu4M,EAAK3sL,MAAM2nP,YAAYvzQ,UACzB4mL,EAAM4sF,eAAexzQ,GAChB,UAGCu4M,MAGZk7D,kBAAmBvmS,EAAGyS,EAAG7M,EAAGmxD,YACfrY,MAAM6nP,kBAAkBvmS,EAAGyS,EAAG7M,EAAGmxD,OAI9CyvO,kBAAmBxmS,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,YAC3BliD,MAAM8nP,kBAAkBxmS,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,OAI1D6lM,iBAAkBxjR,EAAKsZ,SACfzJ,EAAM7P,EAAIxf,KAAK,aAER,IAAT84B,QACWzJ,UAEHA,IAGd4zQ,yBAA0Bv4R,EAAOhQ,cAClBi+K,EAAOx5F,KAClBlkC,MAAMgoP,yBAAyBv4R,EAAOhQ,IACrCo5B,SAAS,UAKdovQ,uBACS,aAGTC,0BACS,cAGTC,kBACS,QAGTC,qBACS,SAGTC,mBACS,OAGTC,wBACS,YAGTC,uBAAwBn0Q,mBACLA,KAGnBo0Q,YAAanxQ,EAAKwG,SACVzJ,EAAM4rB,MAAMwoP,YAAYnxQ,EAAKwG,UAEtB,IAATA,QAEWzJ,EAAIrvB,KAAK,aAGbqvB,EAAIrvB,KAAK,SAGtB0jS,UAAW5jS,EAAKg5B,SACRzJ,EAAM4rB,MAAMyoP,UAAU5jS,GACtBsZ,EAAOma,MAAM4rD,KAAK9vD,EAAIxlG,QACzBuxE,OAAOuoS,EAAct0Q,GAAM,WAEjB,IAATyJ,QACW1f,SAGJA,KAGbwqR,aAAcrvQ,EAAKuE,SACXzJ,EAAM4rB,MAAM2oP,aAAarvQ,GACzBz0B,EAAM52E,OAAOW,KAAKwlG,GACrBj0B,OAAOuoS,EAAct0Q,GAAM,WAEjB,IAATyJ,QACWh5B,SAGJA,KAGb+jS,iBAAkBrkR,EAAKsZ,SACfzJ,EAAM7P,EAAIxf,KAAK,aAER,IAAT84B,QACWzJ,SAGJA,KAGby0Q,yBAA0Bp5R,EAAOhQ,aAClBi+K,EAAOx5F,KAClBlkC,MAAM6oP,yBAAyBp5R,EAAOhQ,IACrCo5B,SAAS,2BAKGpP,EAAO2tI,GACD,iBAAV3tI,IACTA,EAAQi0J,EAAOx5F,KAAKz6D,EAAO2tI,GAAO,eAG9BzzE,IAAU8iN,GACLG,YAAYn9Q,IAM3B,SAAAi/Q,EAAwBt0Q,SACf,CAAC08I,EAAKrhP,IACPqhP,KACQA,MAAQrhP,MAAQ2kG,EAAI3kG,QAEtBA,MAAQ2kG,EAAI3kG,KAP1B3B,EAAOC,QAAU04W,oFC1KjB,6CAEQ/oH,GAAW1vP,EAAQ,UACrBw6T,EAAUx6T,EAAQ,WAClB86W,EAAY96W,EAAQ,gBAAgB+6W,UAEpCl/R,EAAS77E,EAAQ,iBACjBgtR,EAAQhtR,EAAQ,WAChBk5E,EAAIl5E,EAAQ,eACZ24W,EAAS34W,EAAQ,YACjB63W,EAAS73W,EAAQ,iBACfk5N,GAAQl5N,EAAQ,WAKxB,MAAAs4W,EAKEl/P,YAAao0D,KACXA,EAAOA,GAAAA,IAEG9jE,MAAQ8jE,EAAK9jE,KAAO,MAC5B8jE,EAAK9jE,KAAO,MAGZ8jE,EAAK9jE,KAAOsjL,EAAMguF,aAAaxtM,EAAK9jE,MAItC+C,KAAKwuQ,MAAAA,IAAYvwI,YAAYl9D,EAAK9jE,MAClC+C,KAAKyuQ,OAAAA,IAAah2I,WAAWz4H,KAAKwuQ,OAClCxuQ,KAAK2gP,QAAU19F,EAAOx5F,KAAKzpD,KAAKwuQ,OAEhCxuQ,KAAKimP,SAGLjmP,KAAK0uQ,WAAal7W,OAAOiqG,OAAAA,CACvB3tB,EAAI6pB,GAAAA,IAAYoE,KAAKpE,GACrB5pB,EAAI4pB,GAAAA,IAAYoE,KAAW,IAANpE,GACrB3pB,EAAI2pB,GAAQ4mL,EAAMouF,uBAAuBh1Q,GACzC1pB,EAAI0pB,GAAQltB,EAAEmiS,QAAQx+O,MAAMmwJ,EAAMouF,uBAAuBh1Q,IACzDzpB,EAAI40F,GAEKr4F,EAAEu7Q,IAAI3oH,IAAIv6D,EAAE,IAAI9lJ,MAAM8lJ,EAAE,IAEjC30F,EAAI20F,GAEKr4F,EAAEq7Q,IAAIzoH,IAAIv6D,EAAE,IAAI9lJ,MAAM8lJ,EAAE,IAEjChzF,GAAK6nB,GAAAA,IAAY8yH,EAAI9yH,GACrB1nB,GAAK0nB,GAAAA,IAAYqd,OAAOrd,IACvBonE,EAAKm5C,MAGRl6G,KAAK5wB,OAASA,EAAOowB,EAAAA,CAEnB6sH,IAAK3xH,QAAQ2xH,IAAI1zH,KAAK+B,SACtBm0Q,QAAS7uQ,KAAK6uQ,QAAQl2Q,KAAKqH,MAC3B8uQ,UAAW9uQ,KAAK8uQ,UAAUn2Q,KAAKqH,MAC/B+uQ,aAAc/uQ,KAAK+uQ,aAAap2Q,KAAKqH,MACrCgvQ,UAAWhvQ,KAAKgvQ,UAAUr2Q,KAAKqH,MAC/BivQ,aAAcjvQ,KAAKivQ,aAAat2Q,KAAKqH,MACrCkvQ,UAAWlvQ,KAAKkvQ,UAAUv2Q,KAAKqH,MAC/BmvQ,gBAAiBnvQ,KAAKmvQ,gBAAgBx2Q,KAAKqH,MAC3CovQ,gBAAiBpvQ,KAAKovQ,gBAAgBz2Q,KAAKqH,MAC3CqvQ,SAAUrvQ,KAAKqvQ,SAAS12Q,KAAKqH,MAC7BsvQ,UAAWtvQ,KAAKsvQ,UAAU32Q,KAAKqH,MAC/BuvQ,cAAevvQ,KAAKuvQ,cAAc52Q,KAAKqH,MACvCwvQ,SAAUxvQ,KAAKwvQ,SAAS72Q,KAAKqH,MAC7ByvQ,aAAczvQ,KAAKyvQ,aAAa92Q,KAAKqH,MACrC0vQ,gBAAiB1vQ,KAAK0vQ,gBAAgB/2Q,KAAKqH,MAC3C2vQ,QAAS3vQ,KAAK2vQ,QAAQh3Q,KAAKqH,MAC3B4vQ,WAAY5vQ,KAAK4vQ,WAAWj3Q,KAAKqH,MACjC6vQ,eAAgB7vQ,KAAK6vQ,eAAel3Q,KAAKqH,MACzC8vQ,oBAAqB9vQ,KAAK8vQ,oBAAoBn3Q,KAAKqH,MACnD+vQ,sBAAuB/vQ,KAAK+vQ,sBAAsBp3Q,KAAKqH,MACvDgwQ,sBAAuBhwQ,KAAKgwQ,sBAAsBr3Q,KAAKqH,MACvDiwQ,gBAAiBjwQ,KAAKiwQ,gBAAgBt3Q,KAAKqH,MAC3CkwQ,qBAAsBlwQ,KAAKkwQ,qBAAqBv3Q,KAAKqH,MACrDmwQ,uBAAwBnwQ,KAAKmwQ,uBAAuBx3Q,KAAKqH,MACzDowQ,uBAAwBpwQ,KAAKowQ,uBAAuBz3Q,KAAKqH,MACzDqwQ,eAAgBrwQ,KAAKqwQ,eAAe13Q,KAAKqH,MACzCswQ,oBAAqBtwQ,KAAKswQ,oBAAoB33Q,KAAKqH,MACnDuwQ,eAAgBvwQ,KAAKuwQ,eAAe53Q,KAAKqH,MACzCwwQ,oBAAqBxwQ,KAAKwwQ,oBAAoB73Q,KAAKqH,MACnDywQ,qBAAsBzwQ,KAAKywQ,qBAAqB93Q,KAAKqH,MACrD0wQ,kBAAmB1wQ,KAAK0wQ,kBAAkB/3Q,KAAKqH,MAC/C2wQ,aAAc3wQ,KAAK2wQ,aAAah4Q,KAAKqH,MACrC4wQ,cAAe5wQ,KAAK4wQ,cAAcj4Q,KAAKqH,MACvC6wQ,cAAe7wQ,KAAK6wQ,cAAcl4Q,KAAKqH,MACvC8wQ,UAAW9wQ,KAAK8wQ,UAAUn4Q,KAAKqH,OAC9BA,KAAKwuQ,2BAIDxuQ,KAAK+wQ,SAAS9rS,mCAId+6B,KAAK+wQ,SAAS/wQ,KAAKgxQ,OAAS,qBAI5BhxQ,KAAKixQ,eAAersL,IAI7BssL,qBACQhqS,EAAI84B,KAAK+wQ,SAAS9yR,SAEpB/W,EAAEjC,OAAS,YACH6zB,MAAAA,WAAiB5xB,EAAEjC,0BAGvBiC,EAAEJ,WACH2F,EAAE0kS,OAAOC,IACZpxQ,KAAK0jJ,MACH1jJ,KAAKssQ,UAAUplS,EAAE09G,IAAI,GAAI19G,EAAE09G,IAAI,gBAG9Bn4G,EAAE0kS,OAAOE,YACZrxQ,KAAK0jJ,MAAM1jJ,KAAKstQ,iBAAiBpmS,EAAE09G,IAAK19G,EAAEjC,oBAEvCwH,EAAE0kS,OAAOG,YACZtxQ,KAAK0jJ,MAAM1jJ,KAAKmuQ,iBAAiBjnS,EAAE09G,IAAK19G,EAAEjC,oBAEvCwH,EAAE0kS,OAAOI,OACRrqS,EAAEk2B,OAAS,EAAI,YACPtE,MAAM,qCAElBkH,KAAK0jJ,MAAM1jJ,KAAKguQ,UAAU9mS,EAAE09G,IAAK19G,EAAEjC,oBAEhCwH,EAAE0kS,OAAOK,UACRtqS,EAAEk2B,OAAS,EAAI,YACPtE,MAAM,qCAElBkH,KAAK0jJ,MAAM1jJ,KAAKkuQ,aAAahnS,EAAE09G,IAAK19G,EAAEjC,oBAEnCwH,EAAE0kS,OAAOM,MACZzxQ,KAAK0jJ,MAAM1jJ,KAAK+tQ,YAAY7mS,EAAE09G,IAAK19G,EAAEjC,SAMrC+6B,KAAKixQ,gBAAkBjxQ,KAAKixQ,eAAenqS,OAAS2F,EAAE0kS,OAAOC,KAC/DpxQ,KAAK0xQ,OAKTA,aACQxqS,EAAI84B,KAAKixQ,eAGX/pS,EAAEjC,OAAS,IAIfiC,EAAEjC,SAGe,IAAbiC,EAAEjC,QACJ+6B,KAAKkxQ,gBAKTxtH,MAAO/pJ,EAAKg4Q,SACJzqS,EAAI84B,KAAKixQ,sBACf/pS,EAAEk2B,SAEMl2B,EAAEJ,WACH2F,EAAE0kS,OAAOM,WACThlS,EAAE0kS,OAAOE,iBACT5kS,EAAE0kS,OAAOG,YACRpqS,EAAEjC,QAAU,EACd+6B,KAAK4xQ,KAAK5xQ,KAAK4xQ,KAAK3sS,OAASiC,EAAEjC,QAAU00B,EAEzCqG,KAAK4xQ,KAAK9mS,KAAK6uB,GAEjBqG,KAAK0xQ,kBAEFjlS,EAAE0kS,OAAOK,OACI,MAAZtqS,EAAE2qS,QACJ7xQ,KAAK4xQ,KAAK1qS,EAAE2qS,QAAUl4Q,EACtBzyB,EAAE2qS,OAAS,KACX7xQ,KAAK0xQ,SAELxqS,EAAE2qS,OAASl4Q,EAEa,iBAAbzyB,EAAE2qS,SAEX3qS,EAAEJ,KAAO2F,EAAE0kS,OAAOI,IAClBrqS,EAAE09G,IAAM27F,EAAMuxF,SAAS5qS,EAAE09G,kBAI1Bn4G,EAAE0kS,OAAOI,IACI,MAAZrqS,EAAE2qS,QACJ7xQ,KAAK4xQ,KAAKnwR,IAAIva,EAAE2qS,OAAQl4Q,GACxBzyB,EAAE2qS,OAAS,KACX7xQ,KAAK0xQ,QAELxqS,EAAE2qS,OAASl4Q,aAGVltB,EAAE0kS,OAAOC,IACZpxQ,KAAK4xQ,KAAK9mS,KAAK6uB,GACVg4Q,GACH3xQ,KAAK0xQ,+BAIG54Q,MAAM,wBAKtBi5Q,cAAelzQ,EAAK/3B,EAAMs8B,GACxBpD,KAAK+wQ,SAAS/wQ,KAAKgxQ,QAAAA,CACjBlqS,KAAMA,EACN7B,OAAQm+B,EACRwhF,IAAK/lF,EACLzB,OAAQ,EACRy0Q,OAAQ,MAKZ5rB,SACEjmP,KAAKgyQ,KAAAA,GACLhyQ,KAAK+wQ,SAAAA,CAAAA,CACHjqS,KAAM2F,EAAE0kS,OAAOM,MACfxsS,QAAS,EACT2/G,IAAK5kF,KAAKgyQ,KACV50Q,OAAQ,EACRy0Q,OAAQ,OAKZvF,UAAWC,EAAW74W,SACdu+W,EAAMjyQ,KAAK0uQ,WAAWnC,UAEvB0F,EAIEA,EAAIv+W,OAHE03W,EAAOmB,EAAW74W,GAMjCs6W,UAAWnvQ,EAAKuE,UACPvE,EAGTqvQ,aAAcrvQ,EAAKuE,UACVvE,EAGTkvQ,YAAanxQ,EAAKwG,UACTxG,EAGT0wQ,iBAAkBxjR,EAAKsZ,UACd6/I,EAAOpxJ,OAAO/H,GAGvByjR,yBAA0Bv4R,EAAOhQ,UAC3BgQ,IAAUhQ,EACLi+K,EAAOO,MAAM,GAGfP,EAAOx5F,KAAKzpD,KAAKwuQ,MAAMppS,MAAM4P,EAAOhQ,IAG7CwnS,UAAW7yQ,UACFA,EAGT8yQ,YAAa/qN,EAAG0iE,UACPm8D,EAAM2xF,WAAWxwN,EAAG0iE,GAG7BsoJ,YAAaC,EAAIC,EAAIC,EAAI5vF,UAChBsD,EAAM4xF,WAAWxF,EAAIC,EAAIC,EAAI5vF,GAGtCiwF,YAAavzQ,UACJA,EAGTyzQ,kBAAmBvmS,EAAGyS,EAAG7M,EAAGmxD,UACnBmwL,EAAQ/8F,KAAAA,CAAMnqJ,EAAGyS,EAAG7M,EAAGmxD,GAAI,GAAG,EAAO,GAAI,GAGlDyvO,kBAAmBxmS,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,UAC/BsmJ,EAAQ/8F,KAAAA,CAAMnqJ,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,GAAI,GAAG,EAAO,GAAI,GAG9DqlM,eAAgBprN,EAAG0iE,UACT,EAAIm8D,EAAM2xF,WAAWxwN,EAAG0iE,GAGlC2oJ,eAAgBJ,EAAIC,EAAIC,EAAI5vF,SACpBv7H,EAAI6+H,EAAM2xF,WAAWvF,EAAIC,GACzBxoJ,EAAIm8D,EAAM2xF,WAAWrF,EAAI5vF,UAE3Bv7H,EAAIj1E,EAAE2lS,cACD3lS,EAAEmiS,QAAQx+O,MAAAA,IAAUi+O,EAAU3sN,GAAG1iI,MAAMytD,EAAE4lS,SAASC,KAAKluJ,KAGxD,GAAM1iE,EAAIj1E,EAAE4lS,QAAWjuJ,GAGjC4oJ,oBACS,EAGTC,qBACS,EAGTW,oBACS,KAGTC,mBAIAL,wBACSnhQ,EAAAA,EAGTohQ,2BACUphQ,EAAAA,EAGVqhQ,mBACS9kH,IAGT+kH,0BAIAQ,iBAAkBrkR,EAAKsZ,UACdtZ,EAAIxf,KAAK,IAGlB8jS,yBAA0Bp5R,EAAOhQ,UAC3BgQ,IAAUhQ,EACL,GAGFg7B,KAAK2gP,QAAQviP,SAAS,OAAQppB,EAAOhQ,GAG9C8oS,uBAAwBn0Q,cACXuyQ,EAAOvyQ,GAKpBk1Q,QAASl1Q,GACPqG,KAAK0jJ,MAAM1jJ,KAAKwsQ,UAAU7yQ,IAG5Bm1Q,UAAWptN,EAAG0iE,GACZpkH,KAAK0jJ,MAAM1jJ,KAAKysQ,YAAY/qN,EAAG0iE,IAGjC4qJ,UAAWrC,EAAIC,EAAIC,EAAI5vF,GACrBj9K,KAAK0jJ,MAAM1jJ,KAAK0sQ,YAAYC,EAAIC,EAAIC,EAAI5vF,IAG1CiyF,UAAWv1Q,GACTqG,KAAK0jJ,MAAM1jJ,KAAKktQ,YAAYvzQ,IAG9Bw1Q,gBAAiBtoS,EAAGyS,EAAG7M,EAAGmxD,GACxB59B,KAAK0jJ,MAAM1jJ,KAAKotQ,kBAAkBvmS,EAAGyS,EAAG7M,EAAGmxD,IAG7CwxO,gBAAiBvoS,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,GACpCznE,KAAK0jJ,MAAM1jJ,KAAKqtQ,kBAAkBxmS,EAAGyS,EAAG7M,EAAGmxD,EAAG7pI,EAAG2tJ,EAAG0iE,EAAG38C,IAGzDsnM,aAAcrtN,EAAG0iE,GACfpkH,KAAK0jJ,MAAM1jJ,KAAK8sQ,eAAeprN,EAAG0iE,IAGpC6qJ,aAActC,EAAIC,EAAIC,EAAI5vF,GACxBj9K,KAAK0jJ,MAAM1jJ,KAAK+sQ,eAAeJ,EAAIC,EAAIC,EAAI5vF,IAG7CoyF,WACErvQ,KAAK0jJ,MAAM1jJ,KAAKgtQ,cAGlBsC,YACEtvQ,KAAK0jJ,MAAM1jJ,KAAKitQ,eAGlBuC,WACExvQ,KAAK0jJ,MAAM1jJ,KAAK4tQ,cAGlB2B,gBACEvvQ,KAAK0jJ,MAAM1jJ,KAAK6tQ,mBAGlB4B,eACEzvQ,KAAK0jJ,MAAM1jJ,KAAKwtQ,kBAGlBkC,kBACE1vQ,KAAK0jJ,MAAM1jJ,KAAKytQ,qBAGlBkC,UACE3vQ,KAAK0jJ,MAAM1jJ,KAAK0tQ,aAGlBkC,aACE5vQ,KAAK0jJ,MAAM1jJ,KAAK2tQ,gBAGlBkC,iBACE7vQ,KAAK+xQ,cAAAA,GAAkBtlS,EAAE0kS,OAAOM,OAAQ,GAG1C3B,oBAAqB1sQ,GACnBpD,KAAKuyQ,uBAAuBnvQ,GAG9B2sQ,sBAAuBroE,EAAM4uB,SACrBlzN,EAAMm9K,EAAM2xF,WAAWxqE,EAAM4uB,GACnCt2N,KAAKuyQ,uBAAuBnvQ,GAG9B4sQ,sBAAuBtoE,EAAM4uB,EAAMk8C,EAAMC,SACjCrvQ,EAAMm9K,EAAM4xF,WAAWzqE,EAAM4uB,EAAMk8C,EAAMC,GAC/CzyQ,KAAKuyQ,uBAAuBnvQ,GAG9B6sQ,kBACEjwQ,KAAK0yQ,yBAAyB,GAGhCxC,qBAAsB9sQ,GACpBpD,KAAK0yQ,wBAAwBtvQ,GAG/B+sQ,uBAAwBzoE,EAAM4uB,SACtBlzN,EAAMm9K,EAAM2xF,WAAWxqE,EAAM4uB,GACnCt2N,KAAK0yQ,wBAAwBtvQ,GAG/BgtQ,uBAAwB1oE,EAAM4uB,EAAMk8C,EAAMC,SAClCrvQ,EAAMm9K,EAAM4xF,WAAWzqE,EAAM4uB,EAAMk8C,EAAMC,GAC/CzyQ,KAAK0yQ,wBAAwBtvQ,GAG/BktQ,sBACEtwQ,KAAK+wQ,SAAS/wQ,KAAKgxQ,QAAAA,CACjBlqS,KAAM2F,EAAE0kS,OAAOE,YACfpsS,QAAS,EACT2/G,IAAAA,GACAxnF,OAAQ,EACRy0Q,OAAQ,MAIZxB,eAAgBr7R,EAAOhQ,GACrBg7B,KAAK0jJ,MAAM1jJ,KAAKutQ,yBAAyBv4R,EAAOhQ,IAGlDwrS,sBACExwQ,KAAK+wQ,SAAS/wQ,KAAKgxQ,QAAAA,CACjBlqS,KAAM2F,EAAE0kS,OAAOG,YACfrsS,QAAS,EACT2/G,IAAAA,GACAxnF,OAAQ,EACRy0Q,OAAQ,MAIZtB,eAAgBv7R,EAAOhQ,GACrBg7B,KAAK0jJ,MAAM1jJ,KAAKouQ,yBAAyBp5R,EAAOhQ,IAGlDyrS,qBAAsB92Q,GACpBqG,KAAK0jJ,MAAM1jJ,KAAK8tQ,uBAAuBn0Q,IAGzCg3Q,aAAcnsS,GACZw7B,KAAK+wQ,SAAS/wQ,KAAKgxQ,QAAAA,CACjBlqS,KAAM2F,EAAE0kS,OAAOC,IACfnsS,OAAQ,EACR2/G,IAAAA,CAAMpgH,IAIVosS,cAAelvN,EAAG0iE,GAChBpkH,KAAK2wQ,aAAapwF,EAAM2xF,WAAWxwN,EAAG0iE,IAGxCysJ,cAAelE,EAAIC,EAAIC,EAAI5vF,GACzBj9K,KAAK2wQ,aAAapwF,EAAM4xF,WAAWxF,EAAIC,EAAIC,EAAI5vF,IAGjDyzF,kBAAmBnE,GACjBvsQ,KAAK0jJ,MAAM1jJ,KAAKssQ,UAAUC,IAG5BuE,eACM9wQ,KAAKixQ,eAAehsS,QAAU,YACtB6zB,MAAM,oBAGlBkH,KAAKkxQ,eAGPwB,wBAAyBtvQ,GACX,IAARA,EAKJpD,KAAK+xQ,cAAAA,GAAkBtlS,EAAE0kS,OAAOK,OAAQpuQ,GAJtCpD,KAAK0jJ,MAAM1jJ,KAAKkuQ,aAAAA,KAOpBqE,uBAAwBnvQ,GACV,IAARA,EAKJpD,KAAK+xQ,cAAAA,IAAkBl0Q,MAAMuF,GAAM32B,EAAE0kS,OAAOM,MAAOruQ,GAJjDpD,KAAK0jJ,MAAM1jJ,KAAK+tQ,YAAAA,KAOpBpc,QAAS3iQ,MACkB,IAArBA,EAAMovI,qBACEtlI,MAAM,mBAGlBkH,KAAKimP,SACLjmP,KAAKyuQ,OAAOhtR,IAAIuN,SACV35F,EAAO2qG,KAAK5wB,OAAOH,MAAM+f,EAAMovI,eAEjCp+H,KAAKgxQ,OAAS,EAAA,MACsB,IAA/BhxQ,KAAKixQ,eAAehsS,QACzB+6B,KAAKkxQ,kBAEHlxQ,KAAKgxQ,OAAS,YACNl4Q,MAAM,6BAIhBzjG,EAAO,YACCyjG,MAAM,sBAGO,IAArBkH,KAAKgyQ,KAAK/sS,iBACF6zB,MAAM,mBAMpBqzQ,YAAan9Q,UACXgR,KAAK2xP,QAAQ3iQ,GAENgR,KAAKgyQ,KAAK,GAGnBjG,UAAW/8Q,UACTgR,KAAK2xP,QAAQ3iQ,GAENgR,KAAKgyQ,mBAUChjR,EAAO2tI,GACC,iBAAV3tI,IACTA,EAAQi0J,EAAOx5F,KAAKz6D,EAAO2tI,GAAO,eAG9BzzE,IAAU2iN,EAAAA,CAAU5uQ,KAAMjO,EAAM/pB,SAC3BknS,YAAYn9Q,oBAUPA,EAAO2tI,GACF,iBAAV3tI,IACTA,EAAQi0J,EAAOx5F,KAAKz6D,EAAO2tI,GAAO,eAG9BzzE,IAAU2iN,EAAAA,CAAU5uQ,KAAMjO,EAAM/pB,SAC3B8mS,UAAU/8Q,IAIzB68Q,EAAQM,YAAcN,EAAQznQ,OAE9B/wG,EAAOC,QAAUu4W,6MC5mBjBx4W,EAAAC,QAAA,SAAAonX,EAAAC,EAAA9qK,GACA,UAIA,IAAA+qK,EAAA,IAAAF,EAAAjiJ,WAAA5oB,GAEA,IAAAg/J,EAAA8L,EAAA9L,QACA,IAAAC,EAAA6L,EAAA7L,UACA,IAAAC,EAAA4L,EAAA5L,aACA,IAAAC,EAAA2L,EAAA3L,UACA,IAAAC,EAAA0L,EAAA1L,aACA,IAAAC,EAAAyL,EAAAzL,UACA,IAAAC,EAAAwL,EAAAxL,gBACA,IAAAC,EAAAuL,EAAAvL,gBACA,IAAAC,EAAAsL,EAAAtL,SACA,IAAAC,EAAAqL,EAAArL,UACA,IAAAC,EAAAoL,EAAApL,cACA,IAAAC,EAAAmL,EAAAnL,SACA,IAAAC,EAAAkL,EAAAlL,aACA,IAAAC,EAAAiL,EAAAjL,gBACA,IAAAC,EAAAgL,EAAAhL,QACA,IAAAC,EAAA+K,EAAA/K,WAEA,IAAAC,EAAA8K,EAAA9K,eACA,IAAAC,EAAA6K,EAAA7K,oBACA,IAAAC,EAAA4K,EAAA5K,sBACA,IAAAC,EAAA2K,EAAA3K,sBACA,IAAAC,EAAA0K,EAAA1K,gBACA,IAAAC,EAAAyK,EAAAzK,qBACA,IAAAC,EAAAwK,EAAAxK,uBACA,IAAAC,EAAAuK,EAAAvK,uBAEA,IAAAC,EAAAsK,EAAAtK,eACA,IAAAC,EAAAqK,EAAArK,oBACA,IAAAC,EAAAoK,EAAApK,eACA,IAAAC,EAAAmK,EAAAnK,oBAEA,IAAAC,EAAAkK,EAAAlK,qBAEA,IAAAE,EAAAgK,EAAAhK,aACA,IAAAC,EAAA+J,EAAA/J,cACA,IAAAC,EAAA8J,EAAA9J,cACA,IAAAH,EAAAiK,EAAAjK,kBAEA,IAAAI,EAAA6J,EAAA7J,UAEA,IAAAzxI,EAAAq7I,EAAA90S,KAAAy5J,IAOA,IAAAt6J,EAAA,EACA,IAAA2gM,EAAA,EACA,IAAArwQ,EAAA,EAUA,SAAA45E,EAAA+f,GACAA,EAAAA,EAAA,EAEAjqB,EAAA,EACA2gM,EAAA12K,EAEA,OAAAjqB,EAAA,IAAA2gM,EAAA,GAAA,CACArwQ,EAAAwlX,GAAAD,EAAA71S,GAAA,KAAA61S,EAAA71S,GAAA,GAAA,EAEA,IAAA1vE,EAAA,GAAA,EAAA,CACA,OAIA,OAAAA,EAAA,EAKA,SAAAo9T,EAAAx+T,GACAA,EAAAA,EAAA,EAEA,KAAA8wE,EAAA,IAAA9wE,EAAA,GAAA,IAAAyxQ,EAAA,GAAA,CACA,OAAA,EAGA,OAAA,EAGA,SAAAo1G,EAAA7mX,GACAA,EAAAA,EAAA,EAEA,OACA2mX,EAAA3mX,EAAA,IAAA,EAAA2mX,EAAA3mX,EAAA,EAAA,GACA,EAGA,SAAA8mX,EAAA9mX,GACAA,EAAAA,EAAA,EAEA,OACA2mX,EAAA3mX,EAAA,IAAA,GAAA2mX,EAAA3mX,EAAA,EAAA,IAAA,GAAA2mX,EAAA3mX,EAAA,EAAA,IAAA,EAAA2mX,EAAA3mX,EAAA,EAAA,GACA,EAKA,SAAA+mX,EAAAC,GACAA,EAAAA,EAAA,EAEApM,EAAAoM,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAm2S,EAAAD,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAo8C,EAAA+L,EAAA71S,EAAA,EAAA,GAAA,GAEAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAo2S,EAAAF,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAo8C,EACAiM,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAq2S,EAAAH,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAq8C,EACAgM,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAs2S,EAAAJ,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAu8C,EACA8L,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAu2S,EAAAL,GACAA,EAAAA,EAAA,EAEApM,GAAA,GAAAoM,EAAA,GAAA,GAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAw2S,EAAAN,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAo8C,GACA,GAAA+L,EAAA71S,EAAA,EAAA,GAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAy2S,EAAAP,GACAA,EAAAA,EAAA,EAEA,IAAAthR,EAAA,EAEA,GAAA84N,EAAA,GAAA,EAAA,CACA,OAAA,EAGA94N,EAAAmhR,EAAA/1S,EAAA,EAAA,GAAA,EACA8pS,GAAA,GAAAl1Q,EAAA,GAAA,GAEA50B,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA02S,GAAAR,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAs8C,EACA+L,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA22S,GAAAT,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAw8C,EACA6L,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAssS,GAAA4J,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAq/N,EAAA,EAEAA,EAAA42E,EAAA,GAAA,EACA,GAAAxoD,EAAApuB,EAAA,GAAA,EAAA,CACA,OAAA,EAGArvN,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAs/N,EAAA,GAAA,EAEAgsE,EAAAr7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAA22S,GAAAV,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA21S,EAAA71S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAEA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAorS,EAAAr7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAA42S,GAAAX,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA61S,EAAA/1S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAGA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAorS,EAAAr7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAA62S,GAAAZ,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA81S,EAAAh2S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAGA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAorS,EAAAr7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAA82S,GAAAb,GAEAA,EAAAA,EAAA,EAEA,OAAA,EAGA,SAAAc,GAAAd,GACAA,EAAAA,EAAA,EAEA3K,IAEAvrS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAusS,GAAA2J,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAq/N,EAAA,EAEAA,EAAA42E,EAAA,GAAA,EAEA,GAAAxoD,EAAApuB,EAAA,GAAA,EAAA,CACA,OAAA,EAGArvN,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAs/N,EAAA,GAAA,EAEAksE,EAAAv7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAAg3S,GAAAf,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA21S,EAAA71S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAEA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAsrS,EAAAv7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAAi3S,GAAAhB,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA61S,EAAA/1S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAEA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAsrS,EAAAv7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAAk3S,GAAAjB,GACAA,EAAAA,EAAA,EAEA,IAAAjmS,EAAA,EACA,IAAAhQ,EAAA,EACA,IAAAC,EAAA,EAEA,GAAAwtP,EAAA,GAAA,EAAA,CACA,OAAA,EAGAxtP,EAAA81S,EAAAh2S,EAAA,EAAA,GAAA,EACAiQ,EAAAjQ,EAAA,EAAA,EACAC,GAAAD,EAAA,EAAA,IAAAE,EAAA,GAAA,EAEA,GAAAwtP,EAAAxtP,EAAA,EAAA,GAAA,EAAA,CACA,OAAA,EAGAsrS,EAAAv7R,EAAA,EAAAhQ,EAAA,GAEAD,EAAAC,EAAA,EAEA,OAAA,EAGA,SAAAm3S,GAAAlB,GAEAA,EAAAA,EAAA,EAEA,OAAA,EAGA,SAAAmB,GAAAnB,GACAA,EAAAA,EAAA,EAEAzK,IAEAzrS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA0sS,GAAAwJ,GACAA,EAAAA,EAAA,EAEAnL,EAAAmL,EAAA,IAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAs3S,GAAApB,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAq9C,EAAA8K,EAAA71S,EAAA,EAAA,GAAA,GAEAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAu3S,GAAArB,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAq9C,EACAgL,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAw3S,GAAAtB,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAs9C,EACA+K,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAy3S,GAAAvB,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAu9C,EACA8K,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA03S,GAAAxB,GACAA,EAAAA,EAAA,EAEApL,IAEA9qS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAwsS,GAAA0J,GACAA,EAAAA,EAAA,EAEA,IAAA52E,EAAA,EAEAA,EAAA42E,EAAA,IAAA,EAEA,GAAAxoD,EAAApuB,EAAA,GAAA,EAAA,CACA,OAAA,EAGA6rE,EAAA7rE,EAAA,GAEAt/N,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA23S,GAAAzB,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAy9C,EAAA0K,EAAA71S,EAAA,EAAA,GAAA,GAEAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA43S,GAAA1B,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAy9C,EACA4K,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA63S,GAAA3B,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGA09C,EACA2K,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA83S,GAAA5B,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGA29C,EACA0K,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA+3S,GAAA7B,GACAA,EAAAA,EAAA,EAEAhL,IAEAlrS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAg4S,GAAA9B,GACAA,EAAAA,EAAA,EAEAtK,EAAAsK,EAAA,IAAA,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAi4S,GAAA/B,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAk4S,GAAAhC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAm4S,GAAAjC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAo4S,GAAAlC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAq4S,GAAAnC,GACAA,EAAAA,EAAA,EAEAtK,EAAAsK,EAAA,IAAA,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAs4S,GAAApC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAu4S,GAAArC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAw4S,GAAAtC,GACAA,EAAA,EAEAtK,EAAAsK,EAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAy4S,GAAAvC,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAk+C,EAAAiK,EAAA71S,EAAA,EAAA,GAAA,GAEAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA04S,GAAAxC,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAk+C,EACAmK,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA24S,GAAAzC,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAm+C,EACAkK,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA44S,GAAA1C,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAo+C,EACAiK,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,EACA+1S,EAAA/1S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA64S,GAAA3C,GACAA,EAAAA,EAAA,EAEAxK,GAAAwK,EAAA,GAAA,IAAA,GAEAl2S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA84S,GAAA5C,GACAA,EAAAA,EAAA,EAEA3L,IAEAvqS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAA+4S,GAAA7C,GACAA,EAAAA,EAAA,EAEA5L,IAEAtqS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAg5S,GAAA9C,GACAA,EAAAA,EAAA,EAEAzL,IAEAzqS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAi5S,GAAA/C,GACAA,EAAAA,EAAA,EAEA1L,IAEAxqS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAk5S,GAAAhD,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGAg+C,EAAAmK,EAAA71S,EAAA,EAAA,GAAA,GAEAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAm5S,GAAAjD,GACAA,EAAAA,EAAA,EAEA,IAAAv5N,EAAA,EACA,IAAA0iE,EAAA,EACA,IAAAkkC,EAAA,IACA,IAAA/gL,EAAA,IACA,IAAA42S,EAAA,IACA,IAAAnwQ,EAAA,IACA,GAAAykN,EAAA,GAAA,EAAA,CACA,OAAA,EAGA/wK,EAAAk5N,EAAA71S,EAAA,EAAA,GAAA,EACAq/I,EAAAw2J,EAAA71S,EAAA,EAAA,GAAA,EAEA,IAAA28E,EAAA,GAAA,KAAA,CACA4mG,GAAA,IAGA/gL,MAAAm6E,EAAA,GAAA,OAAA,GACAy8N,MAAAz8N,EAAA,GAAA,OAAA,EAAA0iE,GAEA,IAAA78I,GAAA,IAAA,CACA2nS,KACA5mH,GAAA,uBAAA61H,SAEA,IAAA52S,GAAA,KAAA,CACA,IAAA+gL,GAAA,IAAA,CACA,IAAA61H,EAAA,IAAA,CACAxO,QACA,CACAF,SAEA,CACA,IAAA0O,EAAA,IAAA,CACAvO,QACA,CACAF,UAGA,CACAR,KACA5mH,EAAAjpB,GAAA,KAAA93J,EAAA,SAAA,OAAA42S,KAIAp5S,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAq5S,GAAAnD,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGA08C,EACAyL,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAs5S,GAAApD,GACAA,EAAAA,EAAA,EAEA,GAAAxoD,EAAA,GAAA,EAAA,CACA,OAAA,EAGA28C,EACAwL,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,EACA61S,EAAA71S,EAAA,EAAA,GAAA,GAGAA,EAAAA,EAAA,EAAA,EAEA,OAAA,EAGA,SAAAu5S,GAAArD,GACAA,EAAAA,EAAA,EAEA,OAAA,EAGA,SAAAsD,GAAAtD,GACAA,EAAAA,EAAA,EAEAnK,IAEA/rS,EAAAA,EAAA,EAAA,EAEA,OAAA,EAKA,IAAA81S,GAAA,CAEAG,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EAEAE,EAEAC,EAEAC,EAEAC,EACAiD,GACAA,GACAA,GACAA,GAEAhD,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EACAA,EAEAC,EAEAC,EAEAC,GAEAC,GACA4C,GACAA,GACAA,GACAA,GAEAjN,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEAsK,GAEAC,GAEAC,GAEAC,GACAwC,GACAA,GACAA,GAEAvC,GAEAzK,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEA0K,GAEAC,GAEAC,GAEAC,GAEAmC,GACAA,GACAA,GACAlC,GAEA3K,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEA4K,GAEAC,GAEAC,GAEAC,GAEA8B,GACAA,GACAA,GACA7B,GAEAlL,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEAmL,GAEAC,GAEAC,GAEAC,GACAyB,GACAA,GACAA,GAEAxB,GAEAC,GAEAA,GAEAA,GAEAA,GAEAA,GAEAA,GAEAK,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEAA,GACAA,GACAA,GAEAI,GACAC,GACAC,GACAC,GACAW,GACAA,GACAA,GACAA,GAEAV,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GACAA,GAEAC,GAEAC,GAEAC,GAEAC,GAEAC,GAEAC,GAEAE,GAEAC,GACAC,GACAA,GACAA,GAEAC,IAKA,MAAA,CACAtvS,MAAAA,kCCtzCA,0BAEQg0K,GAAW1vP,EAAQ,UACrB86W,EAAY96W,EAAQ,gBAAgB+6W,UAEpClyI,EAAY7oO,EAAQ,eACpB8+W,EAAUj2I,EAAUi2I,QACpBmM,EAAUpiJ,EAAUoiJ,QAG1BlrX,EAAQmrX,UAAY,SAAoBluJ,SAChC+3B,EAAgB,IAAT/3B,EAAI,IAAa,EAAI,EAC5BhpJ,GAAgB,IAATgpJ,EAAI,KAAc,EACzB4tJ,GAAkB,EAAT5tJ,EAAI,KAAc,EAAKA,EAAI,UACrChpJ,EAEc,KAARA,EACF+gL,GAAQ61H,EAAO,IAAQ,UAEvB71H,EAAO1iL,KAAKy5J,IAAI,EAAG93J,EAAM,KAAO,KAAO42S,GAJhC,qBAAP71H,EAA+B61H,GAgB1C7qX,EAAQq7W,uBAAyB,SAAUp+I,SACnCntH,EAAMmtH,EAAI6N,eACZryJ,EAAM,WACD5E,EAAI,EAAGA,EAAIi8B,EAAKj8B,IACvB4E,IAZY93E,EAYCs8N,EAAIppJ,IAXX,GACC,IAAMlzE,EAAEmqG,SAAS,IAGnBnqG,EAAEmqG,SAAS,IALpB,IAAgBnqG,aAeHo6W,EAAUtiS,EAAK,KAI5Bz4E,EAAQw+W,SAAYjzQ,UACZ9yB,EAAAA,IAAUiX,IACV7uF,EAAOX,OAAOW,KAAK0qG,GACnB55B,EAAS9wE,EAAK8wE,eACXkC,EAAI,EAAGA,EAAIlC,EAAQkC,IAC1B4E,EAAI0V,IAAIttF,EAAKgzE,GAAI03B,EAAI1qG,EAAKgzE,YAErB4E,GAGTz4E,EAAQ4+W,WAAa,CAACxwN,EAAG0iE,IAChB1iE,EAAI88N,EAAUp6J,EAGvB9wN,EAAQ6+W,WAAa,CAACxF,EAAIC,EAAIC,EAAI5vF,WAC1Bv7H,EAAIpuJ,EAAQ4+W,WAAWvF,EAAIC,GAC3BxoJ,EAAI9wN,EAAQ4+W,WAAWrF,EAAI5vF,UAE7Bv7H,EApDgB,YAqDP2sN,EAAU3sN,GAAG1iI,MAAMqzV,GAASC,KAAKluJ,GAEpC1iE,EAAI2wN,EAAWjuJ,GAI3B9wN,EAAQorX,UAAY,SAAoBnuJ,EAAKi3C,SAcrCm3G,EAAM17H,EAAOiE,YAAY,GAC/By3H,EAAI12H,aAAauf,EAAM,SACjBtzE,EAAIyqL,EAAIjrD,aAAa,MAKN,IAAZ,KAAJx/H,UACI,MAOL0qL,EAAO1qL,GAAK,GAAM,YAChB3sH,EAAO2sH,GAAK,GAAM,IAClBiqL,EAAW,QAAJjqL,KASR3sH,GAAO,KAASA,GAAO,IAC1Bq3S,IAASr3S,EAAM,KAAQ,KAAO42S,GAAQ,cAM5B52S,GAAO,KAASA,EAAM,YAczB,KAbH42S,GAAS,GAAM,IAAM52S,GAAQ,SACxB,EAETq3S,GAAST,EAAO,SAAc,IAAM52S,SAgBtCgpJ,EAAIkkG,cAAcmqD,EAAK,IAChB,GAGTtrX,EAAQurX,UAAY,SAAUh4S,EAAGyS,SACzBwlS,EAAOj4S,EAAE,GAAGu3J,WACZ2gJ,EAAOzlS,EAAE,GAAG8kJ,kBAEd0gJ,EAAOC,EACF,EAGLA,EAAOD,GACD,EAGHj4S,EAAE,GAAGirP,QAAQx4O,EAAE,KAIxBhmF,EAAQ65W,eAAkBv/P,GACX,IAANA,GAAY,EAAIA,EAAI,EAG7Bt6G,EAAQi7W,aAAgBt6W,QAClBsvF,EAAQ,KAGRtvF,KAAOA,EAAKA,EAAI,UACXA,OAGI,IAANA,GACLA,IAAM,EACNsvF,GAAS,SAGJ,GAAKA,4FC3Kd,aAEA,MAAA8qR,EAAA96W,EAAA,gBAAA+6W,UAEAh7W,EAAA0rX,GAAA,CACAC,QAAA,EACAC,QAAA,EACA7N,YAAA,EACAC,YAAA,EACAG,MAAA,EACAF,IAAA,EACAH,IAAA,EACA+N,aAAA,GAGA7rX,EAAA89W,IAAA,CACAgO,YAAA,EACAC,WAAA,EACAC,WAAA,EACAC,WAAA,EACAC,aAAA,EACAC,SAAA,EACAC,mBAAA,GACAC,gBAAA,GACAC,gBAAA,GACAC,KAAA,GACAC,IAAA,GACAC,UAAA,GACAC,OAAA,GACAC,OAAA,GACAC,KAAA,IAGA5sX,EAAA6sX,SAAA,CACAxmG,KAAA,EACA9I,IAAA,GACAi3E,IAAA,GACAK,KAAA,GACAi4B,MAAA,GACAC,WAAA,IAGA/sX,EAAAgtX,OAAA,CACAC,MAAA,GACAC,KAAA,GACA5zH,KAAA,GACA6zH,UAAA,IAGAntX,EAAAotX,KAAA,CACA9zH,KAAA12P,OAAA,QACAuqX,UAAAvqX,OAAA,SACAi7W,OAAAj7W,OAAA,UACAqoX,MAAAroX,OAAA,SACAyqX,OAAAzqX,OAAA,WAGA5C,EAAA++W,QAAAzsS,KAAAy5J,IAAA,EAAA,IACA/rO,EAAAkrX,QAAA54S,KAAAy5J,IAAA,EAAA,IAEA/rO,EAAA8+W,cAAA,QACA9+W,EAAAs7W,QAAA,IAAAP,GAAA,GACA/6W,EAAA00V,IAAA,IAAAqmB,EAAA,IACA/6W,EAAAw0V,IAAA,IAAAumB,EAAA,GAEA/6W,EAAA69W,OAAA,CACAM,MAAA,EACAD,OAAA,EACAD,IAAA,EACAH,IAAA,EACAC,YAAA,EACAC,YAAA,qDCvEA,aAEA,MAAAl1I,EAAA7oO,EAAA,eACAyrX,EAAA5iJ,EAAA4iJ,GACAsB,EAAAlkJ,EAAAkkJ,OACAI,EAAAtkJ,EAAAskJ,KAKA,MAAAxU,EAMAr1W,YAAAnD,GACA,GAAA,iBAAAA,EACA,MAAA,IAAAolG,MAAA,+BAAAplG,GAEA,GAAAA,EAAA,GAAAA,EAAA,MAAA,EAAAA,KAAAA,EACA,MAAA,IAAAolG,MAAA,2CAAAplG,GAEAssG,KAAAtsG,MAAAA,EAQAmD,WACA,MAAA,UAAAmpG,KAAAtsG,MAAA,IAQAmD,UACA,MAAA,UAAAmpG,KAAAtsG,MAAA,IASAmD,WAAA2wV,GACA,OAAAA,EAAAo5B,SAAA5gR,KAAAtsG,MAAAsrX,EAAAG,cASAtoX,gBAAAgoG,GACA,OAAAA,aAAAqtQ,EAaAr1W,cAAA8iG,EAAAknR,GAIA,OAHA,MAAAA,IACAA,GAAA,GAEAlnR,GACA,KAAA2mR,EAAAC,MACA,OAAA,EACA,KAAAD,EAAAE,KACA,OAAA,EACA,KAAAF,EAAA1zH,KACA,OAAAi0H,EACA,KAEAH,EAAA9zH,KAEA,KAAA0zH,EAAAG,UACA,OAAAI,OACA,EAEAH,EAAAD,UAEA,KAAA,EACA,IAAAI,EACA,MAAA,IAAA/nR,MAAA,iBAEA,OAAA4nR,EAAAnC,MACA,QACA,OAAA,IAAArS,EAAAvyQ,KAKAtmG,EAAAC,QAAA44W,qDC1GA,aAOA,MAAAd,EAQAv0W,YAAA2tE,EAAA9wE,EAAA+lG,GAIA,GAHAuG,KAAAx7B,IAAAA,EACAw7B,KAAAtsG,MAAAA,EACAssG,KAAAvG,IAAAA,EACA,iBAAAuG,KAAAx7B,IACA,MAAA,IAAAs0B,MAAA,4BAAAkH,KAAAx7B,IAAA,KAEA,GAAAw7B,KAAAx7B,IAAA,IAAA,EAAAw7B,KAAAx7B,OAAAw7B,KAAAx7B,IACA,MAAA,IAAAs0B,MAAA,mCAAAkH,KAAAx7B,KASA3tE,WACA,MAAA,GAAAmpG,KAAAx7B,OAAAqD,KAAAC,UAAAk4B,KAAAtsG,UASAmD,WAAA2wV,GAEA,OADAA,EAAAs5B,SAAA9gR,KAAAx7B,KACAgjR,EAAAu5B,QAAA/gR,KAAAtsG,OAcAmD,QAAAmqX,GACA,IAAAn6C,EAAAnlL,EAEA,GADAA,EAAA,MAAAs/N,EAAAA,EAAAhhR,KAAAx7B,UAAA9uE,EACA,mBAAAgsJ,IACAA,EAAA0pN,EAAA,OAAAprQ,KAAAx7B,KACA,mBAAAk9E,GACA,OAAA1hD,KAGA,IACA,OAAA0hD,EAAA9jD,KAAAwtQ,EAAAprQ,KAAAtsG,OACA,MAAA67E,GAGA,OAFAs3P,EAAAt3P,EACAywB,KAAAvG,IAAAotO,EACA7mO,OAKA3sG,EAAAC,QAAA83W,gCC7EA,0BAEQnoH,GAAW1vP,EAAQ,eACnBk5N,GAAQl5N,EAAQ,WAClB86W,EAAY96W,EAAQ,gBAAgB+6W,UAEpC/tF,EAAQhtR,EAAQ,WAChB6oO,EAAY7oO,EAAQ,eACpByrX,EAAK5iJ,EAAU4iJ,GACfmB,EAAW/jJ,EAAU+jJ,SACrB9N,EAAUj2I,EAAUi2I,QACpBqO,EAAOtkJ,EAAUskJ,KACjBtP,EAAMh1I,EAAUg1I,IAChB6P,EAAQ7kJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAU+jJ,SAASr4B,IAC7Do5B,EAAS9kJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAU+jJ,SAASh4B,KAC9Dg5B,EAAU/kJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAU+jJ,SAASC,MAC/DI,EAAQpkJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAUkkJ,OAAOE,KAC3DD,EAASnkJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAUkkJ,OAAOC,MAC5DE,EAAarkJ,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAUkkJ,OAAOG,UAChE7zH,EAAQxwB,EAAU4iJ,GAAGG,cAAgB,EAAK/iJ,EAAUkkJ,OAAO1zH,KAE3Dw0H,EAAAA,IAAgB/S,EAAU,oBAC1BgT,EAAUp+H,EAAOx5F,KAAK,SAAU,OAChC63N,EAAcr+H,EAAOx5F,KAAK,SAAU,OACpC83N,EAAct+H,EAAOx5F,KAAK,SAAU,OAY1C,MAAAwiN,EAKEt/P,YAAah4G,GACXA,EAAUA,GAAAA,GAEVqrG,KAAKwhR,UAAsC,mBAAnB7sX,EAAQ67N,OAChCxwH,KAAKyhR,OAAS9sX,EAAQ67N,OAEtBxwH,KAAK0hR,cAAAA,CAAAA,CACFj1J,EAAKzsH,KAAK2hR,UAAAA,CACVtT,EAAWruQ,KAAK4hR,uBAGbC,EAAWltX,EAAQmtX,UAAAA,GACnB1+Q,EAAMy+Q,EAAS58S,eACZkC,EAAI,EAAGA,EAAIi8B,EAAKj8B,IACvB64B,KAAK+hR,gBACHF,EAAS16S,GAAG,GACZ06S,EAAS16S,GAAG,IAIhB64B,KAAKimP,SAGP87B,gBAAiBj7S,EAAM0tJ,SACfpxH,EAAMpD,KAAK0hR,cAAcz8S,eACtBkC,EAAI,EAAGA,EAAIi8B,EAAKj8B,IAAAA,IACX64B,KAAK0hR,cAAcv6S,GAAG,KACtBL,EAAAA,OACJimF,EAAM/sD,KAAK0hR,cAAcv6S,GAAG,UAClC64B,KAAK0hR,cAAcv6S,GAAG,GAAKqtJ,EACpBznE,UAGX/sD,KAAK0hR,cAAc52S,KAAAA,CAAMhE,EAAM0tJ,IACxB,KAGT1pJ,KAAM6uB,UACCA,IAILqG,KAAKp1B,OAAOo1B,KAAKj7B,QAAU40B,EAC3BqG,KAAKgiR,aAAahiR,KAAKj7B,QAAU,EACjCi7B,KAAK84M,aAAa94M,KAAKj7B,QAAU40B,EAAI10B,OACrC+6B,KAAKj7B,SAEDi7B,KAAKwhR,WACPxhR,KAAKyhR,OAAOzhR,KAAK6nN,aAGZ,GAGTo6D,UAAWtoR,EAAKyjC,EAAQh6B,UACtBpD,KAAKp1B,OAAOo1B,KAAKj7B,QAAU40B,EAC3BqG,KAAKgiR,aAAahiR,KAAKj7B,QAAUq4D,EACjCp9B,KAAK84M,aAAa94M,KAAKj7B,QAAUq+B,EACjCpD,KAAKj7B,SAEDi7B,KAAKwhR,WACPxhR,KAAKyhR,OAAOzhR,KAAK6nN,aAGZ,EAGTq6D,WAAYvoR,UACHqG,KAAKiiR,UAAUtoR,EAAK,EAAG,GAGhCwoR,cAAexoR,UACNqG,KAAKiiR,UAAUtoR,EAAK,EAAG,GAGhCyoR,cAAezoR,UACNqG,KAAKiiR,UAAUtoR,EAAK,EAAG,GAGhC0oR,cAAe1oR,UACNqG,KAAKiiR,UAAUtoR,EAAK,EAAG,GAGhC2oR,kBACStiR,KAAKl1B,KAAKu2S,GAGnBkB,cAAe1jR,SACP2oK,EAAQ3oK,EAAM,EAAKyiR,EAAcC,SAChCvhR,KAAKl1B,KAAK08L,GAGnBg7G,WAAY3jR,SACJwvJ,EAAKpL,EAAOiE,YAAY,MAE1Bq5B,EAAMm+F,UAAUrwH,EAAIxvJ,IAClB0hL,EAAMk+F,UAAUpwH,KAAQxvJ,SACnBmB,KAAKkiR,WAAWjB,IAASjhR,KAAKl1B,KAAKujL,SAIxC06B,EAAK9lC,EAAOiE,YAAY,UAC9B6hC,EAAG9gC,aAAappJ,EAAK,GACjBkqL,EAAG5gC,YAAY,KAAOtpJ,EACjBmB,KAAKkiR,WAAWhB,IAAUlhR,KAAKl1B,KAAKi+M,GAGtC/oL,KAAKkiR,WAAWf,IAAWnhR,KAAKqiR,cAAcxjR,GAGvD+hR,SAAU/hR,EAAKuvF,EAAIq0L,SACXvjS,EAAIkvG,GAAM,SACZvvF,EAAM,GACDmB,KAAKkiR,WAAWhjS,EAAI2f,GAGzBA,GAAO,IACFmB,KAAKkiR,WAAWhjS,EAAIihS,EAAStvG,MAAQ7wK,KAAKkiR,WAAWrjR,GAG1DA,GAAO,MACFmB,KAAKkiR,WAAWhjS,EAAIihS,EAASr4B,MAAQ9nP,KAAKmiR,cAActjR,GAG7DA,GAAO,WACFmB,KAAKkiR,WAAWhjS,EAAIihS,EAASh4B,OAASnoP,KAAKoiR,cAAcvjR,GAG9DA,GAAO14B,OAAO+6O,iBACTlhN,KAAKkiR,WAAWhjS,EAAIihS,EAASC,QAClCpgR,KAAKoiR,cAAcx8S,KAAK6nC,MAAM5O,EAAMwzQ,KACpCryQ,KAAKoiR,cAAcvjR,EAAMwzQ,GAGzBjkL,IAAO4wL,EAAGE,QACLl/Q,KAAKwiR,WAAWC,GAGlBziR,KAAKwiR,WAAW3jR,GAGzB6jR,YAAa7jR,UACPA,EAAM,EACDmB,KAAK4gR,UAAU/hR,EAAM,EAAGmgR,EAAGE,QAASrgR,GAEpCmB,KAAK4gR,SAAS/hR,EAAKmgR,EAAGC,SAIjC0D,YAAa9jR,WACH,QACAA,GAAQA,SACLmB,KAAKsiR,SAASzjR,QAClB6mJ,SAAS7mJ,UACLmB,KAAKuiR,cAAc1jR,QACrBA,EAAM,GAAO,SACXmB,KAAK0iR,YAAY7jR,kBAEjBmB,KAAKwiR,WAAW3jR,IAI7B+jR,YAAa/jR,SACLuE,EAAM6/I,EAAO7kB,WAAWv/H,EAAK,eAC5BmB,KAAK4gR,SAASx9Q,EAAK47Q,EAAG1N,cAAgBtxQ,KAAKiiR,UAAUpjR,EAAK,EAAGuE,GAGtEy/Q,aAAchkR,UACLmB,KAAKkiR,WAAWrjR,EAAM2hR,EAAOD,GAGtCuC,eAAgBjkR,UACPmB,KAAKkiR,WAAWzB,GAGzBsC,WAAYv7B,EAAK3oP,SACTuE,EAAMvE,EAAI55B,WACXuiR,EAAIo5B,SAASx9Q,EAAK47Q,EAAGvN,cACjB,UAEAngR,EAAI,EAAGA,EAAI8R,EAAK9R,QAClBk2P,EAAIu5B,QAAQliR,EAAIvN,WACZ,SAGJ,EAGTwvR,SAAUt8S,UACDw7B,KAAK4gR,SAASp8S,EAAKw6S,EAAG5N,KAG/B4R,UAAWx7B,EAAK3oP,UAKP2oP,EAAIs5B,SAAS1P,EAAIiO,aAAe73B,EAAIu5B,QAAQn7S,KAAKuoC,MAAMtP,EAAM,MAGtEokR,YAAaz7B,EAAK3oP,UACT2oP,EAAIo5B,SAAS/hR,EAAI55B,OAAQ+5S,EAAG3N,cAAgB7pB,EAAI18Q,KAAK+zB,GAG9DqkR,cAAe17B,EAAK3oP,UACX2oP,EAAIy7B,YAAYz7B,EAAK3oP,EAAIz5B,SAGlC+9S,YAAa37B,EAAK3oP,UACT2oP,EAAIs5B,SAAS1P,EAAI6O,SAAWz4B,EAAIu5B,QAAQliR,EAAI9pB,QAGrDquS,SAAU57B,EAAK3oP,OACR2oP,EAAIo5B,SAAS/hR,EAAI5B,KAAM+hR,EAAGvN,cACtB,YAEE7jQ,KAAK/O,MACT2oP,EAAIu5B,QAAQnzQ,UACR,SAGJ,EAGT+zQ,SAAUn6B,EAAK3oP,UACN2oP,EAAIs5B,SAAS1P,EAAI0O,MAAQt4B,EAAIu5B,QAAQliR,EAAIm4H,UAGlDqsJ,YAAaxkR,OACPr6B,EAAM4sS,EAAIkO,WACVzgR,EAAIo6Q,eACNp6Q,EAAMA,EAAIg7Q,UAAUzpP,MAAM,GAC1B5rD,EAAM4sS,EAAImO,gBAER/pR,EAAMqJ,EAAIT,SAAS,IACnB5I,EAAIvwB,OAAS,IACfuwB,EAAM,IAAMA,SAER+6H,EAAM0yB,EAAOx5F,KAAKj0D,EAAK,cACtBwK,KAAK8gR,SAASt8S,IAAQw7B,KAAKijR,YAAYjjR,KAAMuwH,GAGtDqxJ,eAAgBp6B,EAAK3oP,MACfA,EAAIK,eACCsoP,EAAI86B,eAERzjR,EAAI6mJ,kBACA8hG,EAAI+6B,cAAc1jR,EAAIo6Q,cAAgB5sQ,EAAAA,EAAWA,EAAAA,MAEtDxN,EAAI4mJ,mBACC+hG,EAAI67B,YAAYxkR,OAEnB2oP,EAAIs5B,SAAS1P,EAAIoO,gBACrBh4B,EAAIo5B,SAAS,EAAG5B,EAAGvN,cACZ,QAGHvoN,EAAMrqD,EAAIq5Q,gBACVoL,EAAQzkR,EAAIy6Q,aAAAA,IAAiBjL,EAAU,IAAIhvI,IAAIn2E,YAChDs+L,EAAIk7B,aAAax5N,KAGlBo6N,EAAMnpH,MAAM4+G,WAAWqI,GAClB55B,EAAIk7B,YAAYY,EAAMtkR,YAEtBwoP,EAAI67B,YAAYC,IAI3BC,SAAU/7B,EAAK3oP,WACR2oP,EAAIo5B,SAAS/hR,EAAI5B,KAAM+hR,EAAGzN,MAIxBvxQ,KAAKwjR,YACV3kR,EAAI5B,KACJY,MAAM4rD,KAAK5qD,IAIf4kR,YAAa5kR,OACNA,SACImB,KAAKkiR,WAAWt1H,SAGnBxpJ,EAAMpD,KAAK0hR,cAAcz8S,eACtBkC,EAAI,EAAGA,EAAIi8B,EAAKj8B,OACnB03B,aAAemB,KAAK0hR,cAAcv6S,GAAG,UAChC64B,KAAK0hR,cAAcv6S,GAAG,GAAGy2B,KAAKiB,EAAKmB,KAAMnB,SAI9C6iD,EAAI7iD,EAAI6kR,cACG,mBAANhiO,SACFA,EAAE9jD,KAAKiB,EAAKmB,YAGf7rG,EAAOX,OAAOW,KAAK0qG,GACnB2+K,EAAYrpR,EAAK8wE,eAClB+6B,KAAK4gR,SAASpjG,EAAWwhG,EAAGzN,MAI1BvxQ,KAAKwjR,YACVhmG,EACArpR,EAAKi2E,KAAK/1E,GAAAA,CAAOA,EAAGwqG,EAAIxqG,OAI5BmvX,YAAapgR,EAAKh5B,GAOhBA,EAAMA,EAAIA,KAAI,SAAUvD,UACtBA,EAAE,GAAKolS,EAAQ3oQ,OAAOz8B,EAAE,IACjBA,KACNulB,KAAKm0L,EAAMs+F,mBAELvtR,EAAI,EAAGA,EAAI8R,EAAK9R,IAAAA,KAClB0O,KAAKl1B,KAAKV,EAAIknB,GAAG,WACb,MAGJ0O,KAAK+gR,QAAQ32S,EAAIknB,GAAG,WAChB,SAIJ,EASTqzJ,MAAO9lJ,UACEmB,KAAK+gR,QAAQliR,GAStBkiR,QAASliR,UA7WX,SAAiBA,YAGHT,SAASR,KAAKiB,GAAKz5B,MAAM,GAAI,GA2W3Bu+S,CAAO9kR,QAGZ,gBACImB,KAAK2iR,YAAY9jR,OACrB,gBACImB,KAAK4iR,YAAY/jR,OACrB,iBACImB,KAAK6iR,aAAahkR,OACtB,gBACImB,KAAKyjR,YAAY5kR,OACrB,eACImB,KAAK+iR,WAAW/iR,KAAMnB,OAC1B,oBACImB,KAAKijR,YAAYjjR,KAAMijJ,EAAO8H,SAASlsJ,GAAOA,EAAMokJ,EAAOx5F,KAAK5qD,QACpE,cACImB,KAAKkiR,WAAWt1H,OACpB,mBACI5sJ,KAAK8iR,eAAejkR,OACxB,aACImB,KAAKujR,SAASvjR,KAAMnB,OACxB,aACImB,KAAKojR,SAASpjR,KAAMnB,OACxB,aACImB,KAAK2hR,SAAS3hR,KAAMnB,OACxB,mBACImB,KAAK4hR,eAAe5hR,KAAMnB,OAC9B,cACImB,KAAKgjR,UAAUhjR,KAAMnB,OACzB,gBACImB,KAAKmjR,YAAYnjR,KAAMnB,OAC3B,gBACKA,QACD6hR,EAAK9zH,YACD5sJ,KAAKyjR,YAAY,WACrB/C,EAAKD,iBACDzgR,KAAK8iR,oBAAeptX,qBAGjBojG,MAAM,mBAAqB+F,EAAIT,8BAGnCtF,MAAM,wBAA0B+F,EAAM,MAAQA,EAAMA,EAAIT,WAAa,MAIrFypN,cACsB,IAAhB7nN,KAAKj7B,cACA,WAGH6F,EAASo1B,KAAKp1B,OACdkuO,EAAe94M,KAAK84M,aACpBkpE,EAAehiR,KAAKgiR,aACpBj9S,EAASi7B,KAAKj7B,WAGhBk4B,EAAO,EACP91B,EAAI,OAEDA,EAAIpC,EAAQoC,IACjB81B,GAAQ67M,EAAa3xO,SAGjB4E,EAAMk3K,EAAOiE,YAAYjqJ,OAC3B13B,EAAQ,EACRN,EAAS,MAGRkC,EAAI,EAAGA,EAAIpC,EAAQoC,IAAAA,QACtBlC,EAAS6zO,EAAa3xO,GAEd66S,EAAa76S,SACd,EACHyD,EAAOzD,GAAGlqE,KAAK8uE,EAAKxG,cAEjB,EACHwG,EAAIsoP,WAAWzpP,EAAOzD,GAAI5B,GAAO,cAE9B,EACHwG,EAAI0oP,cAAc7pP,EAAOzD,GAAI5B,GAAO,cAEjC,EACHwG,EAAI8oP,cAAcjqP,EAAOzD,GAAI5B,GAAO,cAEjC,EACHwG,EAAIw9K,cAAc3+K,EAAOzD,GAAI5B,GAAO,cAEjC,EACHwG,EAAI44K,MAAM/5K,EAAOzD,GAAI5B,EAAON,EAAQ,gCAG1B6zB,MAAM,iBAGpBvzB,GAASN,QAGLm2B,EAAMrvB,SAEZi0B,KAAKimP,SAEE7qP,EAGT6qP,SACEjmP,KAAKp1B,OAAAA,GACLo1B,KAAKgiR,aAAAA,GACLhiR,KAAK84M,aAAAA,GACL94M,KAAKj7B,OAAS,gBASDmrG,SACPysD,EAAAA,IAAUsvI,MACJtvI,EAAIokJ,QAAQ7wM,aAEZp3E,MAAM,iCAGX6jI,EAAIkrF,YAIfx0T,EAAOC,QAAU24W,+HCzgBjB,aAEA,MAAA19I,EAAAh7N,EAAA,QACAqsG,EAAArsG,EAAA,UAWAD,EAAA0yK,QAAA,CAAAo4L,EAAAzrW,EAAA,MACA,IAAAs0E,EAAA24B,EAAAy+P,YAAAD,GAEA,MAAAn4P,EAAAtzG,EAAAmtF,MAAA,KAAA/R,OAAAsP,SACA,KAAA4oB,EAAAhhC,QAAA,CACA,MAAAjwE,EAAAixG,EAAAtB,QACA,IAAA3vG,KAAAA,KAAAiyE,GACA,MAAA,IAAA6xB,MAAA,2BAAA9jG,MAIA,GADAiyE,EAAAA,EAAAjyE,GACAu5N,EAAAsM,MAAA5zJ,GACA,MAAA,CACAvzE,MAAAuzE,EACAm1R,cAAAn2P,EAAA37B,KAAA,MAKA,MAAA,CACA52E,MAAAuzE,EACAm1R,cAAA,KASA,MAAAl7K,EAAA,UAAAj6G,EAAAt0E,GAEA,KAAAs0E,aAAAwxJ,YAAAlK,EAAAsM,MAAA5zJ,IAAA,iBAAAA,GAAA,OAAAA,GAIA,IAAA,MAAAg0B,KAAAznG,OAAAW,KAAA8yE,GAAA,CACA,MAAA68S,OAAApuX,IAAA/C,EAAAsoG,EAAAtoG,EAAA,IAAAsoG,QACA6oR,QACA5iM,EAAAj6G,EAAAg0B,GAAA6oR,KAcAxwX,EAAA07V,KAAA,UAAAoP,GACA,MAAAn3R,EAAA24B,EAAAy+P,YAAAD,SAEAl9K,EAAAj6G,+DCtEA,aACA,MAAAsnJ,EAAAh7N,EAAA,QACA86N,EAAA96N,EAAA,uBACA+6N,UAAAA,GAAAD,EACAD,EAAA76N,EAAA,cAaAF,EAAAC,QAAA,CACAqnO,MAAAvM,EAAA0sN,IACA38E,eAAA7vI,EAAA3qH,MAAA,YACArc,SAAA,CASA0+E,QAAA,CAAAo4L,EAAAzrW,KACA,GAAA,MAAAA,EACA,MAAA,IAAAmmG,MAAA,wCAGA,MAAA,CACAplG,MAAA0qW,EACAhC,cAAA,KASAvlW,WAAAunW,MAIAx+P,KAAA,CAIAy+P,YAAA3xM,GACAA,EAKAkyM,UAAAlyM,GACAA,EAUAihE,IAAAr6E,MAAA8qN,EAAAa,EAAA,MACA,MAAAtqW,EAAA,CACAosW,WAAA,MAAA9B,EAAA8B,WAAA,EAAA9B,EAAA8B,WACArkC,QAAA,MAAAuiC,EAAAviC,QAAArpU,EAAAC,QAAA6qW,eAAAc,EAAAviC,SAGA1hB,EAAA1sF,EAAAuN,MAAAlnO,EAAA+nU,SACArpN,QAAAg7G,EAAA+vI,EAAApjD,GACAviE,EAAArqB,EAAAopB,gBAAAnkP,EAAAC,QAAAqnO,OAGA,OAFA,IAAApM,EAAA55N,EAAAosW,WAAAtoH,EAAAplI,gGC/EA,aAEA,MAAAyxR,EAAAvxY,EAAA,cACAg7N,EAAAh7N,EAAA,QACAg3L,EAAAh3L,EAAA,iBACA0nb,EAAA1nb,EAAA,iBACA2nb,EAAA3nb,EAAA,eACA4nb,EAAA5nb,EAAA,YACA66N,EAAA76N,EAAA,cAEA6nb,EAAA7nb,EAAA,YACA8nb,eAAAA,GAAA9nb,EAAA,UAcA,MAAA+nb,EAIAzkb,YAAAooW,GACA,MAAAtqW,EAAA41L,EAAA+wP,EAAArzR,eAAAg3M,GAEA,IAAAtqW,EAAAylU,aACA,MAAA,IAAAthO,MAAA,wBAEAkH,KAAAq6K,GAAA1lR,EAAAylU,aAIAp6N,KAAA+8M,UAAA,GAEA,mBAAApoT,EAAAqmb,WAIAh7U,KAAAg7U,WAAArgN,IACA,MAAA8d,EAAArqB,EAAAopB,gBAAA7c,GACA,MAAA,IAAA7hI,MAAA,gCAAA2/I,OAGAz4I,KAAAg7U,WAAArmb,EAAAqmb,WAIA,IAAA,MAAAhkN,KAAAriO,EAAAomb,QACA/6U,KAAAu7U,UAAAvkN,GASAngO,UAAAmgO,GACA,MAAA2D,EAAA3D,EAAA2D,MAEA,GAAA36H,KAAA+8M,UAAA/lF,EAAA2D,OAAA,CACA,MAAA8d,EAAArqB,EAAAopB,gBAAA7c,GACA,MAAA,IAAA7hI,MAAA,sCAAA2/I,MAKA,OAFAz4I,KAAA+8M,UAAApiF,GAAA3D,EAEAh3H,KAQAnpG,aAAA8jO,GAKA,OAJA36H,KAAA+8M,UAAApiF,WACA36H,KAAA+8M,UAAApiF,GAGA36H,KAUAnpG,QAAA82N,EAAAh7N,EAAAgC,GACA,IAAA45N,EAAAsM,MAAAlN,GACA,MAAA,IAAA70H,MAAA,gCAEA,GAAA,iBAAAnmG,EACA,MAAA,IAAAmmG,MAAA,oCAGA,MAAAuhO,EAAAr6N,KAuCA,OAAAq7U,EArCA/nS,kBAEA,OAAA,CACA,MAAA0jF,QAAAqjG,EAAAmhH,UAAAptN,EAAAqpB,gBAAA9pB,EAAAgN,QAKAntE,QAAA6sK,EAAAhgD,GAAA74L,IAAAmsI,EAAAh5N,GACAi2E,EAAAosJ,EAAA1vI,SAAA0+E,QAAAxY,EAAAd,KAAA/5J,GAGAA,EAAAi4E,EAAAwxR,cACA,IAAA1oW,EAAAk3E,EAAAl3E,MAGA,GAAA,IAAAF,OAAAW,KAAAT,GAAAuxE,QAAA,MAAAvxE,EACA,IACAA,EAAA,IAAA66N,EAAA76N,EAAA,MACA,MAAAsjb,GACAtjb,EAAA,KASA,QALA,CACA0oW,cAAAzpW,EACAe,MAAAA,IAGA66N,EAAAsM,MAAAnnO,GAGA,OAFAi6N,EAAAj6N,GAOAmtG,IASAhqG,UAAA82N,EAAAh5N,GACA,MAAA64J,QAAAxtD,KAAAq6K,GAAA74L,IAAAmsI,EAAAh5N,GAIA,aAHAqrG,KAAAw7U,UAAAhuR,EAAAmgE,IAAAgN,QACA/6H,KAAAy+P,YAAA7wM,EAAAd,MAWA71J,QAAAurY,EAAAztY,GACA,IAAAymb,EAAAlxC,WAAA9H,IAAA,iBAAAA,GACAA,aAAA3pK,WACA,MAAA,IAAA3/H,MAAA,sCAGA,MAAAuhO,EAAAr6N,KAQA,OAAAq7U,EANA/nS,kBACA,UAAA,MAAAq6E,KAAAy0K,QACA/nE,EAAA74O,IAAAmsI,EAAAh5N,GAIAksG,IAUAhqG,UAAAowE,EAAA+vJ,EAAAioI,GACA,QAAAvpW,IAAAshO,EACA,MAAA,IAAAl+H,MAAA,2BAEA,GAAA,iBAAAk+H,EACA,MAAA,IAAAl+H,MAAA,kDAGA,MAAA2iV,QAAAz7U,KAAAw7U,UAAAxkN,GACA/uE,EAAA,CACAy0K,QAAA++G,EAAAt9E,eACA4C,WAAA,EACA4qC,UAAA,GAEAh3Y,EAAA41L,EAAAtiC,EAAAg3M,GAEAy8E,EAAA,CACA36E,WAAApsW,EAAAosW,WACArkC,QAAA/nU,EAAA+nU,QACAivE,SAAAh3Y,EAAAg3Y,UAEA0iB,EAAAotB,EAAA77U,KAAAg/P,UAAA33R,GACA0mJ,QAAA8tN,EAAA77U,KAAA+tH,IAAA0gM,EAAAqtB,GAEA,IAAA/mb,EAAAg3Y,SAAA,CACA,MAAAn+O,EAAA,IAAAs3O,EAAAupB,EAAA1gM,SACA3tH,KAAAq6K,GAAAhpD,IAAA7jE,EAAA74J,GAGA,OAAAg5N,EAUA92N,QAAAmlF,EAAAg7I,EAAAioI,GACA,IAAAm8E,EAAAlxC,WAAAluT,IAAA,iBAAAA,GACAA,aAAAy8I,WACA,MAAA,IAAA3/H,MAAA,+BAEA,QAAApjG,IAAAshO,EACA,MAAA,IAAAl+H,MAAA,2BAEA,GAAA,iBAAAk+H,EACA,MAAA,IAAAl+H,MAAA,kDAIA,IAAAnkG,EAEA8mb,EAEA,MAAAphH,EAAAr6N,KAqBA,OAAAq7U,EAnBA/nS,kBACA,UAAA,MAAArsE,KAAA+U,EAAA,CAIA,QAAAtmF,IAAAf,EAAA,CACA8mb,QAAAphH,EAAAmhH,UAAAxkN,GACA,MAAA/uE,EAAA,CACAy0K,QAAA++G,EAAAt9E,eACA4C,WAAA,EACA4qC,UAAA,GAEAh3Y,EAAA41L,EAAAtiC,EAAAg3M,SAGA5kC,EAAAhpG,IAAApqJ,EAAA+vJ,EAAAriO,IAIAksG,IASAhqG,aAAA82N,EAAAh5N,GACA,OAAAqrG,KAAAq6K,GAAA52L,OAAAkqI,EAAAh5N,GAYAkC,WAAAurY,EAAAztY,GACA,IAAAymb,EAAAlxC,WAAA9H,IAAA,iBAAAA,GACAA,aAAA3pK,WACA,MAAA,IAAA3/H,MAAA,sCAGA,MAAAuhO,EAAAr6N,KAQA,OAAAq7U,EANA/nS,kBACA,UAAA,MAAAq6E,KAAAy0K,QACA/nE,EAAA38N,OAAAiwH,EAAAh5N,GAIAksG,IAUAhqG,KAAA82N,EAAAguN,EAAA18E,GACA,iBAAA08E,IACA18E,EAAA08E,EACAA,OAAAjmb,GAEAimb,EAAAA,GAAA,GAEA,MAGAhnb,EAAA41L,EAHA,CACAq5K,WAAA,GAEA3E,GAQA28E,EAAAtoS,MAAAka,EAAAquR,KAEA,MACAjxW,SADAo1B,KAAAw7U,UAAAptN,EAAAqpB,gBAAAjqF,EAAAmgE,IAAAgN,SACArzI,SAAA0+E,QAAAxY,EAAAd,KAAAmvR,GAEA,GAAAttN,EAAAsM,MAAAjwJ,EAAAl3E,OACA,OAAAk3E,EAAAl3E,OAIA2mU,EAAAr6N,KAyDA,OAAAq7U,EAvDA/nS,kBAEA,MAAAwoS,EAAA,GAEA,IAAAtuR,EAIA,MAAAypB,EAAA,CAAA,CAAA02C,IAAAA,EAAAouN,SAAA,KAEA,IAAAA,EAKA,KAAAD,EAAA72W,OAAA,GAAAgyG,EAAAhyG,OAAA,GAAA,CAEA,GAAA,IAAA62W,EAAA72W,QAAAgyG,EAAAhyG,OAAA,EAAA,CACA,MAAAmY,EAAA65F,EAAAtyE,QAEA,GAAAvnB,EAAA,GACAuwI,IAAAA,EAAAouN,SAAAA,GAAA3+V,GACA,MAAA45I,QAAAqjG,EAAAmhH,UAAAptN,EAAAqpB,gBAAA9pB,EAAAgN,QACAntE,QAAA6sK,EAAAhgD,GAAA74L,IAAAmsI,EAAAh5N,GAEA,MAAAi6X,EAAA53J,EAAA1vI,SAAA0nQ,KAAAxhM,EAAAd,MACAovR,EAAAhxW,QAAA8jT,IAIA,MAAAitD,EAAAC,EAAAn3U,SAAA,GACA,IAAAukG,EAAA6yO,EAAAF,EAGA,GAAAlnb,EAAAivW,UAAA,CACA,MAAAj2I,QAAAiuN,EAAApuR,EAAAquR,GAEA,MAAAluN,GACA12C,EAAAnsG,KAAA,CAAA6iJ,IAAAA,EAAAouN,SAAA7yO,EAAA,WAMAxzM,IAAAimb,GAAAzyO,EAAA/sH,WAAAw/V,IACAzyO,EAAAjkI,OAAA02W,EAAA12W,SACA02W,EAAA12W,OAAA,IACAikI,EAAAA,EAAA9jI,MAAAu2W,EAAA12W,OAAA,UAGAikI,IAKAroG,IAMAhqG,gBAAA8jO,GAOA,GAJA,iBAAAA,IACAA,EAAAvM,EAAAqpB,gBAAA9c,IAGA36H,KAAA+8M,UAAApiF,GACA,OAAA36H,KAAA+8M,UAAApiF,GAIA,MAAA3D,QAAAh3H,KAAAg7U,WAAArgN,GAEA,OADA36H,KAAAu7U,UAAAvkN,GACAA,GAOAskN,EAAArzR,eAAA,CAEA8yR,QAAA,CAAAE,EAAAC,EAAAC,IAGA9nb,EAAAC,QAAAgob,wNC/aW97U,EAAQsiE,GACE,iBAAZxuK,QAA0C,IAAXD,EAAyByuK,EAAQxuK,GAE7CwuK,GAAzBtiE,EAASA,GAAUF,MAAqB87U,QAAAA,KACzCp7U,MAAO,SAAU1sG,GAAW,aAmC5B,SAAAyra,EAAmB9qa,UACTirG,MAAMD,WAAWhrG,KAAOyxP,SAASzxP,GA6B3C,SAAAopG,EAAwBrO,UACL,OAAVA,GAAmC,iBAAVA,GAAsBA,EAAM2d,cAAgBn5G,OAe9E,SAAAwob,EAAsBhtV,UACbxV,EAASwV,IAAkC,iBAAjBA,EAAM/pB,OASzC,SAAAuU,EAAmBwV,SACO,iBAAVA,GAAgC,OAAVA,EAStC,SAAAitV,EAAoBjtV,eACM,IAAVA,EAShB,SAAA0vU,EAAsB1vU,UACZitV,EAAUjtV,GASpB,SAAAgvU,EAAiBhvU,UACC,OAAVA,EASR,SAAAktV,EAAyBltV,UACjBitV,EAAUjtV,KAAWgvU,EAAOhvU,KAAW7oB,OAAO+4B,MAAMlQ,GAS5D,SAAA83C,EAAkB93C,SACK,mBAAVA,aACQvpB,KAAK5vE,SAAS8nG,UAAUS,SAASR,KAAK5O,IAY3D,SAAA2xU,EAAsB3xU,MACN,OAAVA,EAAU,OAAa,gBACZA,OACR,aACA,aACA,aACA,gBACA,iBACI,iBAEA,GAUb,SAAAgP,EAAoBhP,MACdA,EAAAA,OACIgP,EAAYi+U,EAAUl2Q,UAAY/2E,aAAiB+2E,QACnDo2Q,EAAantV,EAAMiP,MAA8B,mBAAfjP,EAAMiP,cACpCD,IAAam+U,UAEhB,EA2CX,SAAAjyC,EAAqBl7S,WACL,OAAVA,IAAmBitV,EAAUjtV,MAIK,mBAA3BA,EAAM94F,OAAOu0J,WACmB,mBAAhCz7D,EAAM94F,OAAOy6N,gBAW1B,SAAA/7N,EAAmBo6F,SACO,iBAAVA,EAShB,SAAAvD,EAAqBuD,SACK,mBAAVA,MAGZzpB,EAAAA,CACFw5V,SAAAA,EACA1hU,cAAAA,EACA2+U,YAAAA,EACAxiW,SAAAA,EACAyiW,UAAAA,EACAvd,YAAAA,EACAV,OAAAA,EACAke,eAAAA,EACAp1S,QAAAA,EACA65R,YAAAA,EACA3iU,UAAAA,EACAksS,WAAAA,EACAt1Y,SAAAA,EACA62F,WAAAA,GAGFn4F,EAAQH,QAAUoyE,EAClBjyE,EAAQ0ob,YAAcA,EACtB1ob,EAAQwzI,QAAUA,EAClBxzI,EAAQ2ob,UAAYA,EACpB3ob,EAAQ4ob,eAAiBA,EACzB5ob,EAAQm4F,WAAaA,EACrBn4F,EAAQ42Y,WAAaA,EACrB52Y,EAAQ0qa,OAASA,EACjB1qa,EAAQyra,SAAWA,EACnBzra,EAAQkmF,SAAWA,EACnBlmF,EAAQ+pG,cAAgBA,EACxB/pG,EAAQqta,YAAcA,EACtBrta,EAAQ0qG,UAAYA,EACpB1qG,EAAQsB,SAAWA,EACnBtB,EAAQora,YAAcA,EAEtBlra,OAAOC,eAAeH,EAAS,aAAA,CAAgBI,OAAO,qCCpSxD,aAOAJ,EAAAulF,MAAAy6D,MAAAmX,IACA,UAAA,MAAA/2J,KAAA+2J,EACA,OAAA/2J,GASAJ,EAAAyoF,KAAAu3D,MAAAmX,IACA,IAAA/2J,EACA,UAAAA,KAAA+2J,GAGA,OAAA/2J,GAQAJ,EAAAozN,IAAApzE,MAAAmX,IACA,MAAArtD,EAAA,GACA,UAAA,MAAA1pG,KAAA+2J,EACArtD,EAAAtyB,KAAAp3E,GAEA,OAAA0pG,GAkBA9pG,EAAA+nb,eAAA5wR,IACAA,EAAA5xE,MAAA,IAAAvlF,EAAAulF,MAAA4xE,GACAA,EAAA1uE,KAAA,IAAAzoF,EAAAyoF,KAAA0uE,GACAA,EAAAi8D,IAAA,IAAApzN,EAAAozN,IAAAj8D,GACAA,iCC1DA,aAEA,MAAA4hE,EAAA94N,EAAA,QAAAA,CAAA,gCACAkmb,EAAAlmb,EAAA,0BACAmuZ,EAAAnuZ,EAAA,6BACA8+Z,yBAAAA,GAAA9+Z,EAAA,aAAAw/H,OACAqlG,EAAA7kO,EAAA,2BACA8kO,EAAA9kO,EAAA,yBACAw6N,EAAAx6N,EAAA,YACAg3L,aAAAA,GAAAh3L,EAAA,YACA6ob,EAAA7ob,EAAA,aACA8vW,gBAAAA,GAAA9vW,EAAA,aACA8ob,EAAA9ob,EAAA,YAYA,MAAAgmU,EASA1iU,YAAA6kO,EAAAu+F,EAAAD,EAAAF,EAAAwC,GACAt8N,KAAA85N,MAAAA,EACA95N,KAAA07H,OAAAA,EACA17H,KAAAi6N,SAAAA,EACAj6N,KAAAg6N,KAAAA,EACAh6N,KAAA85N,MAAAA,EACA95N,KAAAs8N,MAAAA,EAOAzlU,mBAAAijU,EAAAnlU,GACA,MAAA2nb,gBAAAA,EAAAtiH,KAAAuiH,GAAA5nb,EAEAqlU,EAAA,iBAAAuiH,GAAA,MAAAA,EACA9C,EAAA3/G,EAAA,CAAAnnU,KAAA4pb,EAAA9pB,YAAAp1U,QAAAi/V,KACAC,GAEA7gN,OAAAA,EAAAu+F,SAAAA,EAAAqC,MAAAA,SAAAkgH,EAAA1iH,EAAAE,EAAArlU,GAIA,OAAA,IAAA4kU,EAAA79F,EAAAu+F,EAAAD,EAAAF,EAAAwC,IAGAjpU,EAAAC,QAAAimU,EAOA,MAAAijH,EAAAlpS,MAAAwmL,EAAAE,EAAArlU,KACA,IAAAqlU,EAAA8b,OACA,MAAA,UAAA2mG,EAAAziH,EAAArlU,GAAA2nU,OAAA,GAGA,IAGA,aAFAtC,EAAAj6O,OAEA,UAAA08V,EAAAziH,EAAArlU,GAAA2nU,OAAA,GACA,MAAA7iO,GACA,GAAAA,EAAApkG,OAAAg9Z,EACA,MAAA54T,EAGA,GAAA9kG,EAAAqgI,OAAA,IAAArgI,EAAAqgI,KAAA0nT,SACA,MAAA,IAAAr5E,EAAA,+FAGA,MAAA,UAAAs5E,EAAA7iH,EAAAE,EAAArlU,GAAA2nU,OAAA,KAUAqgH,EAAArpS,MAAAwmL,EAAAE,EAAArlU,KACA,MAAAsnU,EAAAtnU,EAAAqgI,MAAA,GAGAklR,QAAAlgF,EAAAkgF,SAGA,GAFA7tL,EAAA,eAAA6tL,IAEA,IAAAA,EACA,MAAA,IAAAphT,MAAA,uBAIA,MAAA4iI,EAAAugG,EAAAzpD,iBACAoqK,EAAA3gH,EAAAzpD,kBACAqqK,EAAA/iH,EAAAmC,GAEAx1N,EAAAq2U,EAAAphN,GAEArP,EAAA,oBAAA5lH,EAAAs2U,QAGA,MAAAxiW,EAAA,IACAgwG,EAAAyyP,EAAAt7B,IAAAzlF,EAAA2lF,UAAAjtZ,EAAA4lF,QACA2nU,SAAAz7S,SAEAuzN,EAAAhlM,KAAAz6C,SAGAy/O,EAAAj6O,OAEAssI,EAAA,eAGA,MAAAsvG,QAAA0gH,EAAA,CACA1nb,aAAAe,EACA2rZ,gBAAA3rZ,EACAgmO,OAAAA,EACAs+F,KAAAA,EACAz/O,OAAAA,EACA0iW,eAAA,CACAz8E,KAAA7rW,EAAA6rW,QAYA,OARA7kC,EAAA1B,UAAA0B,EAAA1B,SAAAl5J,aACA46J,EAAAuhH,qBAEAljH,EAAAz/O,OAAAkH,IAAA,WAAA,CACAy5N,IAAAygB,EAAA1B,SAAAl5J,KAAAm6I,OAIA,CAAAx/E,OAAAA,EAAAu+F,SAAA0B,EAAA1B,WAUA2iH,EAAAlhN,IACArP,EAAA,mCACA,iBAAAqP,EACAA,EACA3N,EAAAgN,kBAAA3C,EAAAsD,EAAA,eAYAmhN,EAAA,CAAA/iH,GAAAv8D,UAAAA,EAAA,MAAAnjC,KAAAA,EAAA,SAEA0/F,EAAA,6CAAA1/F,EAAAmjC,GACAxvC,EAAA75N,OAAA,CAAA6tF,QAAAw7K,EAAAnjC,KAAAA,KAMA0iN,EAAAphN,IAAA,CACAqhN,OAAArhN,EAAA7C,cAEAspL,QAAA9pL,EAAAqD,EAAAnD,QAAAI,MAAA,eAUA8jN,EAAAnpS,MAAA0mL,EAAArlU,KACA,MAAA4lF,EAAA5lF,EAAA4lF,OACAqnU,EAAAjtZ,EAAAqgI,MAAArgI,EAAAqgI,KAAA4sR,UAAA,GACAphD,EAAA7rW,EAAA6rW,KACA96Q,QAAAs0O,EAAAz/O,OAAA6hP,SAEAy6D,EAAAsmD,EAAAH,EAAAt3V,EAAAk8T,GAAArnU,GAEAmL,IAAAmxS,SACA78D,EAAAz/O,OAAArB,QAAA29S,GAIA,MAAAn7J,QAAA3N,EAAAgN,kBAAA87J,EAAAqrB,SAAAC,SACAxmF,QAAA0gH,EAAA,CACA1nb,aAAAe,EACA2rZ,gBAAA3rZ,EACAgmO,OAAAA,EACAs+F,KAAAA,EACAz/O,OAAAs8S,EACAomD,eAAA,CACAz8E,KAAAA,KACAq2B,EAAAumD,YAQA,OAJAzhH,EAAA1B,gBACA0B,EAAAuhH,eAGA,CAAAxhN,OAAAA,EAAAu+F,SAAA0B,EAAA1B,WAOAkjH,EAAA,CAAA5iW,EAAA8iW,IACAA,EAAA9yP,EAAAhwG,EAAA8iW,GAAA9iW,EAQAyiW,EAAA,CAAAziW,EAAAqnU,KACAA,GAAA,IAAAl8U,QAAA,CAAA6U,EAAA1nF,KACA,MAAAkvZ,EAAAq6B,EAAAx6B,SAAA/uZ,GACA,IAAAkvZ,EACA,MAAA,IAAAjpT,MAAA,qCAAAjmG,MAGA,OADAw5N,EAAA,sBAAAx5N,GACAkvZ,EAAA59T,UAAA5J,KACAA,uSCzPA,aAEA,MAAA+iW,EAAA/pb,EAAA,aAQAF,EAAAC,QAAA,CAAAwmU,EAAAnlU,KACA,MAAAu7Z,EAAAv7Z,EAAAhC,MAAA,OACA,OAAA,IAAA2qb,EAAAptB,EAAA,CAAAuC,YAAA99Z,EAAA89Z,gECZA,aAEA,MAAAjxU,EAAAjuF,EAAA,OACAg3L,EAAAh3L,EAAA,iBACAupT,EAAAvpT,EAAA,YACAgqb,EAAAhqb,EAAA,2CACAwtZ,EAAAxtZ,EAAA,sBAAAmwG,QAwBArwG,EAAAC,QAAA,EACAqB,QAAAA,EAAA,GACA+mO,OAAAA,EACA2lL,WAAAA,EAAA,GACArnF,KAAAA,EACAijH,eAAAA,EAAA,GACA1iW,OAAAA,EAAA,OAEA,MAAAg1S,UAAAA,EAAAp7X,KAAAA,GAAA6lU,EAEAwjH,EA+BA,UAAA7ob,QAAAA,EAAA4lF,OAAAA,EAAAg1S,UAAAA,EAAAp7X,KAAAA,EAAA8ob,eAAAA,EAAAvhN,OAAAA,EAAA2lL,WAAAA,IACA,MAYAo8B,EAAA,CACAluD,UAAAA,EACA7zJ,OAAAA,EACAnnD,QAAA,IAGAipQ,EAAA,CACAjpQ,QAAA,CACA4mJ,OApBA,MACA,MAAAroU,EAAA0uF,EAAAjH,EAAA,kBAAA,YAGA,IAAAgjW,EAAAzqb,GACA,MAAAgqT,EAAA,IAAAhkN,MAAA,kEAAAhmG,aAAA,qBAIA,OAAAyqb,EAAAzqb,IAWA4qb,IAEAnjW,OAAA,CACAojW,cAAA,CACAC,KAAA,CACAjhH,QAAAn7O,EAAA7sF,EAAA,gCAAA6sF,EAAAjH,EAAA,0BAAA,KAEA6pT,WAAA,CACAznE,QAAAn7O,EAAA7sF,EAAA,sCAAA6sF,EAAAjH,EAAA,gCAAA,KAEA8gP,UAAA,CACA33O,KAAAlC,EAAA7sF,EAAA,mBAAA6sF,EAAAjH,EAAA,YAAA,OAGAsjW,MAAA,CACAlhH,QAAAn7O,EAAA7sF,EAAA,gBAAA6sF,EAAAjH,EAAA,iBAAA,IACAujW,IAAA,CACAnhH,QAAAn7O,EAAA7sF,EAAA,oBAAA6sF,EAAAjH,EAAA,qBAAA,IACAq+F,OAAAp3F,EAAA7sF,EAAA,mBAAA6sF,EAAAjH,EAAA,oBAAA,MAGA2gP,IAAA,CACAyB,QAAA,SAAAn7O,EAAAjH,EAAA,eAAA,QACAwjW,WAAA,cAAAv8V,EAAAjH,EAAA,eAAA,OACAyjW,YAAAx8V,EAAA7sF,EAAA,kBAAA,KAEAwmU,OAAA,CACAwB,QAAAn7O,EAAA7sF,EAAA,wBAAA6sF,EAAAjH,EAAA,kBAAA,KAEA0jW,IAAA,CACAthH,SAAAn7O,EAAAjH,EAAA,2BAAA,KAGAqiP,UAAA,CACAxvH,OAAAi0M,EAAAj3U,KAAAk5T,GAAAA,EAAAllS,aACA8/U,SAAA18V,EAAA7sF,EAAA,qBAAA6sF,EAAAjH,EAAA,qBAAA,KACA4jW,WAAA38V,EAAA7sF,EAAA,uBAAA6sF,EAAAjH,EAAA,uBAAA,MAEA6jW,kBAAA58V,EAAA7sF,EAAA,oBAAA,CACA0pb,eAAA78V,EAAA7sF,EAAA,iCAAA6sF,EAAAjH,EAAA,4BACA+jW,eAAA98V,EAAA7sF,EAAA,gCAAA6sF,EAAAjH,EAAA,6BAEA0/O,SAAA,CACAs1D,UAAAp7X,KACA8ob,GAEAz3U,KAAA,CACAgmH,aAAA,WAAAu1L,MAMAw9B,EAAAhrb,EAAA,4BAGA,IAAAsxZ,EAAArjU,EAAA7sF,EAAA,cAAAe,GAEA,mBAAAmvZ,IACAA,OAAAnvZ,GAIA,MAAA8ob,EAAAj0P,EACAkzP,EACAc,IACAf,EACA34B,GAGArjU,EAAAg9V,EAAA,sCAAA,IAEAv5W,OAAA,GACAu5W,EAAAjqQ,QAAAopQ,cAAA7yW,KAAAv3E,EAAA,qBAGA,OAAAirb,EAhIAC,CAAA,CACA9pb,QAAAA,EACA4lF,OAAAA,EACAg1S,UAAAA,EACAp7X,KAAAA,EACA8ob,eAAAA,EACAvhN,OAAAA,EACA2lL,WAAAA,IAGA,GAAA,mBAAA1sZ,EAAAgnU,OACA,OAAAhnU,EAAAgnU,OAAA,CAAA6hH,cAAAA,EAAA7ob,QAAAA,EAAA4lF,OAAAA,EAAAg1S,UAAAA,EAAA7zJ,OAAAA,IAMA,OAFAnoO,EAAA,UAEAW,OAAAspb,oPCzDA,aAEAnqb,EAAAC,QAAA,CACAorb,UAAAnrb,EAAA,6ECHA,aACA,IAAAorb,EAAA3+U,MAAAA,KAAA2+U,kBAAAnrb,OAAAU,OAAA,SAAAg8K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACAb,OAAAC,eAAAy8K,EAAA2hH,EAAA,CAAA9yL,YAAA,EAAAvd,IAAA,WAAA,OAAAtC,EAAA7qF,OACA,SAAA67K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACA67K,EAAA2hH,GAAA3yM,EAAA7qF,KAEAuqb,EAAA5+U,MAAAA,KAAA4+U,qBAAAprb,OAAAU,OAAA,SAAAg8K,EAAApL,GACAtxK,OAAAC,eAAAy8K,EAAA,UAAA,CAAAnxE,YAAA,EAAArrG,MAAAoxK,KACA,SAAAoL,EAAApL,GACAoL,EAAA,QAAApL,IAEA+5Q,EAAA7+U,MAAAA,KAAA6+U,cAAA,SAAAv8R,GACA,GAAAA,GAAAA,EAAAtuJ,WAAA,OAAAsuJ,EACA,IAAA13E,EAAA,GACA,GAAA,MAAA03E,EAAA,IAAA,IAAAjuJ,KAAAiuJ,EAAA,YAAAjuJ,GAAAb,OAAAmqG,UAAAnD,eAAAoD,KAAA0kD,EAAAjuJ,IAAAsqb,EAAA/zW,EAAA03E,EAAAjuJ,GAEA,OADAuqb,EAAAh0W,EAAA03E,GACA13E,GAEAk0W,EAAA9+U,MAAAA,KAAA8+U,WAAA,SAAAl6O,EAAAm6O,EAAAp6N,EAAA9jH,GAEA,OAAA,IAAA8jH,IAAAA,EAAA5+C,WAAA,SAAAC,EAAAu5B,GACA,SAAAy/O,EAAAtrb,GAAA,IAAA2wS,EAAAxjM,EAAAzjB,KAAA1pF,IAAA,MAAAK,GAAAwrM,EAAAxrM,IACA,SAAAkrb,EAAAvrb,GAAA,IAAA2wS,EAAAxjM,EAAA,MAAAntG,IAAA,MAAAK,GAAAwrM,EAAAxrM,IACA,SAAAswS,EAAAz5N,GAJA,IAAAl3E,EAIAk3E,EAAAk/F,KAAA9D,EAAAp7F,EAAAl3E,QAJAA,EAIAk3E,EAAAl3E,MAJAA,aAAAixN,EAAAjxN,EAAA,IAAAixN,GAAA,SAAA3+C,GAAAA,EAAAtyK,OAIAuqG,KAAA+gV,EAAAC,GACA56I,GAAAxjM,EAAAA,EAAAuiG,MAAAwB,EAAAm6O,GAAA,KAAA3hW,YAGA,MAAA8hW,EAAAL,EAAAtrb,EAAA,iCACA4rb,EAAA5rb,EAAA,mBACA6rb,EAAA7rb,EAAA,iBACA6oO,EAAAyiN,EAAAtrb,EAAA,gBACA8rb,EAAA9rb,EAAA,eACA+rb,EAAA/rb,EAAA,sBACAgsb,EAAAhsb,EAAA,WACAisb,EAAAjsb,EAAA,WACAksb,EAAAlsb,EAAA,YAGAmsb,EAAAnsb,EAAA,cACAw6N,EAAAx6N,EAAA,WAGAosb,EAAApsb,EAAA,8BACA,MAAAqsb,UAAAV,EAAA/rb,QAkBA0D,YAAA8kU,EAAAhnU,EAAA,IACA,MAAAkrb,EAAA,CAAAzjN,EAAA0jN,eAAA1jN,EAAA2jN,gBACAh/Q,EAAAvtK,OAAAiqG,OAAAjqG,OAAAiqG,OAAA,CAAAuiV,gBAAA,EAAAC,oBAAA,EAAAC,cAAA,EAAAC,MAAA,EAAAC,YAAA,GAAAx6N,EAAAwW,EAAAikN,WAAAC,IAAAlkN,EAAAmkN,aAAAC,IAAApkN,EAAAqkN,aAAAC,OAAAtkN,EAAAukN,gBAAAC,KAAAxkN,EAAAykN,cAAAC,MAAA1kN,EAAA2kN,gBAAApsb,GAAA,CAAAqsb,YAAAxB,EAAAyB,sBAAAtsb,EAAAqsb,aAAAE,gBAAA1B,EAAA2B,0BAAAxsb,EAAAusb,mBAEAngR,EAAAk/Q,oBACAJ,EAAA/0W,KAAAsxJ,EAAAglN,YAEA77T,MAAA/xH,OAAAiqG,OAAA,CAAA4jV,UAAA,mBAAAxB,YAAAA,EACAlkH,OAAAA,GAAA56J,IACA/gE,KAAA2hE,SAAAZ,EAKA/gE,KAAAwpQ,OAAA,IAAA7qR,IAAAoiF,EAAAq/Q,YAAAh2W,KAAAlD,GAAAA,EAAA+c,GAAA40I,iBAEA93D,EAAAq/Q,YAAAhsb,SAAA8yE,IACAy0P,EAAAslF,UAAAE,YAAAniU,IAAA9X,EAAA+c,GAAA/c,EAAAo6W,UAOAthV,KAAAuhV,UAAA,IAAA7B,EAOA1/U,KAAAwhV,KAAA,IAAAx+V,IAOAgd,KAAAkiQ,OAAA,IAAAl/Q,IAOAgd,KAAAyhV,QAAA,IAAAz+V,IAOAgd,KAAA0hV,OAAA,IAAA1+V,IAOAgd,KAAA2hV,QAAA,IAAA3+V,IAKAgd,KAAA4hV,SAAA,IAAA5+V,IAKAgd,KAAA6hV,OAAA,IAAA7+V,IAIAgd,KAAA8hV,QAAA,IAAA9+V,IAOAgd,KAAA+hV,SAAA,IAAA/+V,IAKAgd,KAAAgiV,aAAArtb,EAAAqtb,cAAA,IAAA7C,EAAA8C,aAAA7lN,EAAA8lN,uBAAA9lN,EAAA+lN,uBAAAniV,KAAAoiV,SAAAzpV,KAAAqH,OAIAA,KAAAqiV,UAAA,IAAAhD,EAAAiD,UAAAtiV,MAKAA,KAAAuiV,eAAA,EAIAviV,KAAAwiV,aAAA,IAAA/C,EAAAgD,YAAAziV,KAAAoiV,SAAAzpV,KAAAqH,OAIAA,KAAA0iV,QAAA/mH,EAIA37N,KAAA6uG,MAAA,IAAA2wO,EAAAmD,UAAA3iV,KAAA2hE,SAAAq/Q,YAAArlH,EAAAyiH,kBAAAp+U,KAAAoiV,SAAAzpV,KAAAqH,OASAnpG,WAAA8hO,GACA,OAAAymN,EAAAt7C,IAAA1/R,OAAAu0H,GASA9hO,WAAA8rP,GACA,OAAAy8L,EAAAt7C,IAAAxgS,OAAAq/I,GAAAlpB,SASA5iO,SAAA6kO,EAAAnwB,GACA,MAAArkI,EAAAq+C,MAAAq9T,SAAAlnN,EAAAnwB,GAEAvrG,KAAA6uG,MAAAg0O,QAAAnnN,EAAA7C,eAEA,IAAAkpN,GAAA,EACA,IAAA,MAAAt1W,KAAAuzB,KAAA0iV,QAAAtE,kBAAAhiH,OAAA1gG,GACA,GAAA,aAAAjvJ,EAAAy1T,KAAAn1L,WACAlvG,MAAA4rD,KAAAh9E,EAAAusH,SAAA57F,UAAAx2B,MAAAk8W,GAAAv3O,IAAAu3O,EAAAv3O,WAAA,CACAw2O,GAAA,EACA,MAKA,OADA/hV,KAAA+hV,SAAAtgW,IAAAva,EAAA+c,GAAA40I,cAAAkpN,GACA76W,EAQArwE,YAAA6kO,GACA,MAAAqnN,EAAAx9T,MAAAy9T,YAAAtnN,GACAz3I,EAAAy3I,EAAA7C,cAGA,IAAA,MAAA4pK,KAAAziS,KAAAwhV,KAAApkV,SACAqlS,EAAAh/S,OAAAQ,GAIA,IAAA,MAAAw+S,KAAAziS,KAAAkiQ,OAAA9kQ,SACAqlS,EAAAh/S,OAAAQ,GAUA,OAPA+b,KAAA0hV,OAAAj+V,OAAAQ,GAEA+b,KAAA2hV,QAAAl+V,OAAAQ,GAEA+b,KAAA+hV,SAAAt+V,OAAAQ,GAEA+b,KAAA6uG,MAAAo0O,WAAAh/V,GACA8+V,EAWAlsb,YAAAotF,EAAA8+V,EAAApgM,GACA,QAAAp9H,MAAA29T,YAAAj/V,EAAA8+V,EAAApgM,KACAA,EAAAg/L,SACA3hV,KAAAmjV,0BAAAl/V,EAAA0+J,EAAAg/L,UAEA,GAUA9qb,0BAAAotF,EAAAm/V,GACA,IAAAA,EACA,OAEA,MAAAC,EAAAD,EAAAE,MAAAtjV,KAAAujV,aAAAt/V,EAAAm/V,EAAAE,OAAA,GACAA,EAAAF,EAAAC,MAAArjV,KAAAwjV,aAAAv/V,EAAAm/V,EAAAC,OAAA,GACAI,EAAAL,EAAAM,MAAA1jV,KAAA2jV,aAAA1/V,EAAAm/V,EAAAM,OAAA,GAEA,GADAN,EAAAK,OAAAzjV,KAAA4jV,aAAA3/V,EAAAm/V,EAAAK,QACAJ,EAAAp+W,SAAAq+W,EAAAr+W,SAAAw+W,EAAAx+W,OACA,OAEA,MAAA4+W,EAAAtE,EAAAuE,gBAAAR,EAAA,CAAAD,MAAAA,EAAAI,MAAAA,IACAzjV,KAAA+jV,SAAA9/V,EAAA4/V,GASAhtb,mBAAA44E,GACA,MAAAwmC,EAAAziH,OAAAU,OAAA,KAAA,CACA8vb,mBAAA,CAAAxiW,IAAA,IAAA+jC,MAAAy+T,sBAEA,OAAAlF,EAAA9+U,UAAA,OAAA,GAAA,YACA,MAAAikV,EAAAjkV,KAAAoiV,SAAA3yW,GACAy0W,EAAA3E,EAAA4E,kBAAAF,GAEAjkV,KAAAuhV,UAAAxiW,IAAAmlW,GACAlkV,KAAA6uG,MAAAu1O,iBAAA30W,IAGAuwB,KAAAuhV,UAAAlwN,IAAA6yN,GACAlkV,KAAA6uG,MAAAw1O,gBAAA50W,SACAwmC,EAAA+tU,mBAAApmV,KAAAoC,KAAAvwB,OASA54E,YAAAotF,GACA,OAAA+b,KAAAwpQ,OAAAzqR,IAAAkF,IAAA+b,KAAA6uG,MAAAA,MAAA5qH,IAAA+b,KAAA2hE,SAAAu/Q,gBAAAoD,kBAQAztb,SAAA8iF,GACA,MAAAs8B,EAAAziH,OAAAU,OAAA,KAAA,CACA+nO,SAAA,CAAAz6I,IAAA,IAAA+jC,MAAA02G,YAEA,OAAA6iN,EAAA9+U,UAAA,OAAA,GAAA,YACA,UACAiW,EAAAgmH,SAAAr+H,KAAAoC,KAAArmB,GAEA,MAAA5lF,GAGA,MAFAisG,KAAA6uG,MAAA01O,cAAA5qW,EAAA5lF,EAAAsB,MACA2qG,KAAAwiV,aAAA+B,cAAA5qW,EAAA5lF,EAAAsB,MACAtB,MAUA8C,aAAAotF,EAAAq/V,GACA,IAAAA,EAAAr+W,OACA,MAAA,GAGA,MAAA4pI,EAAA7uG,KAAA6uG,MAAAA,MAAA5qH,GACA,GAAA4qH,EAAA7uG,KAAA2hE,SAAAu/Q,gBAAAsD,gBAEA,OADAxkV,KAAAqsH,IAAA,oEAAApoI,EAAA4qH,GACA,GAGA,MAAA+yO,GAAA5hV,KAAA4hV,SAAApgW,IAAAyC,IAAA,GAAA,EAEA,GADA+b,KAAA4hV,SAAAngW,IAAAwC,EAAA29V,GACAA,EAAAxlN,EAAAqoN,0BAEA,OADAzkV,KAAAqsH,IAAA,6FAAApoI,EAAA29V,GACA,GAEA,MAAAC,EAAA7hV,KAAA6hV,OAAArgW,IAAAyC,IAAA,EACA,GAAA49V,GAAAzlN,EAAAsoN,wBAEA,OADA1kV,KAAAqsH,IAAA,yEAAApoI,EAAA49V,GACA,GAGA,MAAAwB,EAAA,IAAArgW,IAaA,GAZAsgW,EAAAlvb,SAAA,EAAAuwb,QAAAA,EAAAC,WAAAA,MACAD,GAAAC,GAAA5kV,KAAAwhV,KAAAziW,IAAA4lW,IAGAC,EAAAxwb,SAAA6vb,IACA,MAAAC,EAAA3E,EAAA4E,kBAAAF,GACAjkV,KAAAuhV,UAAAxiW,IAAAmlW,IAGAb,EAAA5hW,IAAAyiW,EAAAD,UAGAZ,EAAApmV,KACA,MAAA,GAEA,IAAA4nV,EAAAxB,EAAApmV,KACA4nV,EAAAhD,EAAAzlN,EAAAsoN,0BACAG,EAAAzoN,EAAAsoN,wBAAA7C,GAEA7hV,KAAAqsH,IAAA,kDAAAw4N,EAAAxB,EAAApmV,KAAAhZ,GACA,IAAA6gW,EAAAjnV,MAAA4rD,KAAA45R,EAAAjmV,UAOA,OALAmiV,EAAAl8B,QAAAyhC,GAEAA,EAAAA,EAAA1/W,MAAA,EAAAy/W,GACA7kV,KAAA6hV,OAAApgW,IAAAwC,EAAA49V,EAAAgD,GACA7kV,KAAAwiV,aAAAuC,WAAA9gW,EAAA6gW,GACA,CAAA,CACAF,WAAAE,IAUAjub,aAAAotF,EAAAo/V,GACA,IAAAA,EAAAp+W,OACA,MAAA,GAGA,MAAA4pI,EAAA7uG,KAAA6uG,MAAAA,MAAA5qH,GACA,GAAA4qH,EAAA7uG,KAAA2hE,SAAAu/Q,gBAAAsD,gBAEA,OADAxkV,KAAAqsH,IAAA,kEAAApoI,EAAA4qH,GACA,GAGA,MAAAy0O,EAAA,IAAAtgW,IAcA,OAbAqgW,EAAAjvb,SAAA,EAAAwwb,WAAAA,MACAA,GAAAA,EAAAxwb,SAAA6vb,IACA,MAAAx0W,EAAA8T,GAAAyc,KAAAgiV,aAAAgD,WAAAf,EAAAhgW,GACAxU,IAGA8T,EAAA64I,EAAA6oN,8BACAjlV,KAAAqsH,IAAA,2EAAApoI,EAAAggW,GAGAX,EAAA7hW,IAAA89V,EAAA4E,kBAAAF,GAAAx0W,UAGA6zW,EAAArmV,MAGA+C,KAAAqsH,IAAA,mCAAAi3N,EAAArmV,KAAAhZ,GACA4Z,MAAA4rD,KAAA65R,EAAAlmV,UAAAhzB,IAAA80W,EAAA3+J,MAAA2kK,yBAHA,GAWArub,aAAAotF,EAAAy/V,GACA,MAAAD,EAAA,GACA50O,EAAA7uG,KAAA6uG,MAAAA,MAAA5qH,GACAqhF,EAAAtlE,KAAAmlV,OACA,IAAAhF,EAAAngV,KAAA2hE,SAAAw+Q,KAqEA,OApEAuD,EAAAtvb,SAAA,EAAAuwb,QAAAA,MACA,IAAAtiH,EACA,IAAAsiH,EACA,OAEA,MAAAS,EAAAplV,KAAAwhV,KAAAhgW,IAAAmjW,GACA,IAAAS,EAIA,YAFAjF,GAAA,GAKA,GAAAiF,EAAArmW,IAAAkF,GACA,OAGA,GAAA+b,KAAAwpQ,OAAAzqR,IAAAkF,GAMA,OALA+b,KAAAqsH,IAAA,8CAAApoI,GAEAw/V,EAAA34W,KAAA65W,QAEAxE,GAAA,GAIA,MAAAz7E,EAAA,QAAAriC,EAAAriO,KAAA8hV,QAAAtgW,IAAAmjW,UAAA,IAAAtiH,OAAA,EAAAA,EAAA7gP,IAAAyC,GACA,GAAA,iBAAAygR,GAAAp/L,EAAAo/L,EAAA,CACA1kQ,KAAAqsH,IAAA,qCAAApoI,GAEA+b,KAAA6uG,MAAAw2O,WAAAphW,EAAA,GAEAk8V,GAAA,EAEA,MAAAmF,EAAA5gF,EAAAtoI,EAAAmpN,6BAAAnpN,EAAAopN,sBAQA,OAPAlgR,EAAAggR,GAEAtlV,KAAA6uG,MAAAw2O,WAAAphW,EAAA,GAGA+b,KAAAylV,YAAAxhW,EAAA0gW,QACAlB,EAAA34W,KAAA65W,GAIA,OAAA91O,EAAA,GAEA7uG,KAAAqsH,IAAA,kEAAApoI,EAAA4qH,EAAA81O,GAEAlB,EAAA34W,KAAA65W,GAEAxE,GAAA,OAEAngV,KAAAylV,YAAAxhW,EAAA0gW,IAMAS,EAAAnoV,MAAA+C,KAAA2hE,SAAA6+Q,MAAAxgV,KAAA+hV,SAAAvgW,IAAAyC,IACAw/V,EAAA34W,KAAA65W,QACA3kV,KAAAylV,YAAAxhW,EAAA0gW,KAGA3kV,KAAAqsH,IAAA,qCAAApoI,EAAA0gW,GACA3kV,KAAA6uG,MAAA60O,MAAAz/V,EAAA0gW,QACAS,EAAApmW,IAAAiF,OAEAw/V,EAAAx+W,OAGAw+W,EAAAr5W,KAAAi0T,GAAAr+R,KAAA0lV,WAAAzhW,EAAAo6S,EAAA8hD,KAFA,GAUAtpb,aAAAotF,EAAAw/V,GACA,MAAA50O,EAAA7uG,KAAA6uG,MAAAA,MAAA5qH,GACAw/V,EAAArvb,SAAA,EAAAuwb,QAAAA,EAAA7C,QAAAA,EAAAr/C,MAAAA,MACA,IAAAkiD,EACA,OAEA,MAAAS,EAAAplV,KAAAwhV,KAAAhgW,IAAAmjW,GACA,GAAAS,IAGAplV,KAAAqsH,IAAA,sCAAApoI,EAAA0gW,GACA3kV,KAAA6uG,MAAA40O,MAAAx/V,EAAA0gW,GACAS,EAAA3hW,OAAAQ,GAEA,iBAAA69V,GAAAA,EAAA,EACA9hV,KAAA2lV,cAAA1hW,EAAA0gW,EAAA,IAAA7C,GAGA9hV,KAAAylV,YAAAxhW,EAAA0gW,GAGAliD,GAAAA,EAAAx9T,QAAA,CAEA,GAAA4pI,EAAA7uG,KAAA2hE,SAAAu/Q,gBAAA0E,kBAEA,YADA5lV,KAAAqsH,IAAA,mFAAApoI,EAAA4qH,EAAA81O,GAGA3kV,KAAA6lV,WAAApjD,OAUA5rY,YAAAotF,EAAAo6S,GACAr+R,KAAA2lV,cAAA1hW,EAAAo6S,EAAAjiK,EAAAopN,uBASA3ub,cAAAotF,EAAAo6S,EAAA/4B,GACA,IAAAw8E,EAAA9hV,KAAA8hV,QAAAtgW,IAAA68S,GACAyjD,IACAA,EAAA,IAAA9+V,IACAgd,KAAA8hV,QAAArgW,IAAA48S,EAAAyjD,IAEA,MAAAp9E,EAAA1kQ,KAAAmlV,OAAA7/E,GACAw8E,EAAAtgW,IAAAyC,IAAA,GACAygR,GACAo9E,EAAArgW,IAAAwC,EAAAygR,GAOA7tW,uBACAmpG,KAAAwiV,aAAAsD,oBAAA1xb,SAAA,CAAAmvF,EAAArc,KACA84B,KAAAqsH,IAAA,gEAAAnlJ,EAAAqc,GACAyc,KAAA6uG,MAAAw2O,WAAAn+W,EAAAqc,MAOA1sF,gBAEA,GAAAmpG,KAAAuiV,eAAAnmN,EAAA2pN,4BAAA,EACA,OAEA,MAAAzgR,EAAAtlE,KAAAmlV,OACAnlV,KAAA8hV,QAAA1tb,SAAA,CAAA0tb,EAAAzjD,KACAyjD,EAAA1tb,SAAA,CAAAswW,EAAAzgR,KACAygR,EAAAp/L,GACAw8Q,EAAAr+V,OAAAQ,MAGA,IAAA69V,EAAA7kV,MACA+C,KAAA8hV,QAAAr+V,OAAA46S,MAQAxnY,iBAGA,GAAAmpG,KAAAuiV,eAAAnmN,EAAA4pN,6BAAA,EACA,OAEA,MAAAC,EAAA,GACAjmV,KAAAwpQ,OAAAp1W,SAAA6vF,IACA,MAAA61V,EAAA95U,KAAAyiS,MAAAjhT,IAAAyC,GACA61V,GAAAA,EAAAoM,YACAD,EAAAn7W,KAAAmZ,MAGAgiW,EAAAhhX,QACAghX,EAAA7xb,SAAA6vF,IACA+b,KAAAmmV,SAAAliW,MASAptF,WAAA4rY,GACA,OAAAq8C,EAAA9+U,UAAA,OAAA,GAAA,YACAyiS,EAAAx9T,OAAAm3J,EAAAgqN,sBACA7G,EAAAl8B,QAAA5gB,GACAA,EAAAA,EAAAr9T,MAAA,EAAAg3J,EAAAgqN,sBAEA,MAAAH,EAAA,SACAlgR,QAAA2gD,IAAA+7K,EAAAr4T,KAAA+hD,GAAA2yT,EAAA9+U,UAAA,OAAA,GAAA,YACA,IAAAmsB,EAAAk6T,OACA,OAEA,MACApiW,EADA8pI,EAAAyM,gBAAAruG,EAAAk6T,QACAxtN,cACA,IAAA74H,KAAAyiS,MAAA1jT,IAAAkF,GAGA,GAAAkoC,EAAAm6T,iBAOA,IACA,MAAAC,QAAA5G,EAAA6G,eAAAr6T,EAAAm6T,iBAAA,sBACAG,EAAAF,EAAA7qN,OAAA7C,cACA,GAAA50I,IAAAwiW,EAEA,YADAzmV,KAAAqsH,IAAA,mFAAAo6N,EAAAxiW,GAGA,IAAA+b,KAAA0iV,QAAAzhC,UAAAE,YAAAulC,kBAAAH,GAEA,YADAvmV,KAAAqsH,IAAA,oFAGA45N,EAAAn7W,KAAAmZ,GAEA,MAAAlwF,GACAisG,KAAAqsH,IAAA,sFApBA45N,EAAAn7W,KAAAmZ,SAuBAgiW,EAAAhhX,QAGAghX,EAAA7xb,SAAA6vF,GAAA+b,KAAAmmV,SAAAliW,QASAptF,QACA0uH,MAAAvwC,QACAgrB,KAAAqiV,UAAArtW,QACAgrB,KAAA6uG,MAAA75H,QAEAgrB,KAAA2mV,mBAAA97Q,YAAA,KACA7qE,KAAAwpQ,OAAAp1W,SAAA6vF,IACA+b,KAAAmmV,SAAAliW,QAEAm4I,EAAAwqN,oCAOA/vb,OACA0uH,MAAAgb,OACAvgC,KAAAqiV,UAAA9hT,OACAvgC,KAAA6uG,MAAAtuE,OACAvgC,KAAAwhV,KAAA,IAAAx+V,IACAgd,KAAAkiQ,OAAA,IAAAl/Q,IACAgd,KAAAyhV,QAAA,IAAAz+V,IACAgd,KAAA0hV,OAAA,IAAA1+V,IACAgd,KAAA2hV,QAAA,IAAA3+V,IACAgd,KAAA4hV,SAAA,IAAA5+V,IACAgd,KAAA6hV,OAAA,IAAA7+V,IACAgd,KAAA8hV,QAAA,IAAA9+V,IACAgd,KAAA+hV,SAAA,IAAA/+V,IACAgd,KAAAwiV,aAAAp1R,QACA6iE,aAAAjwH,KAAA2mV,oBAOA9vb,SAAAotF,GACA+b,KAAAqsH,IAAA,gCAAApoI,GACA+b,KAAA0iV,QAAAmE,aAAA94N,EAAA0M,oBAAAx2I,GAAA+b,KAAA6/U,aAQAhpb,UAAAwnY,GACA94Q,MAAAo4Q,UAAAU,GACAr+R,KAAA11B,KAAA+zT,GAQAxnY,YAAAwnY,GACA94Q,MAAAw3Q,YAAAsB,GACAr+R,KAAAoiE,MAAAi8N,GAOAxnY,KAAAwnY,GACA,IAAAr+R,KAAA+gH,QACA,MAAA,IAAAjoH,MAAA,6BAEAkH,KAAAqsH,IAAA,UAAAgyK,GACA,MAAAyoD,EAAA9mV,KAAAkiQ,OAAA1gR,IAAA68S,GACA,GAAAyoD,EAGAA,EAAA1yb,SAAA6vF,IACA+b,KAAA6uG,MAAAA,MAAA5qH,GAAA,GACA6iW,EAAArjW,OAAAQ,MAGA6iW,EAAA7pV,KAAA+C,KAAA2hE,SAAAikD,GAEA05N,EAAAyH,eAAA/mV,KAAAq+R,EAAAr+R,KAAA2hE,SAAAikD,EAAAkhO,EAAA7pV,MAAAhZ,IAEA6iW,EAAA/nW,IAAAkF,KAAA+b,KAAAwpQ,OAAAzqR,IAAAkF,IAAA+b,KAAA6uG,MAAAA,MAAA5qH,IAAA,IACA7vF,SAAA6vF,GAAA6iW,EAAA9nW,IAAAiF,KAEA+b,KAAAwhV,KAAA//V,IAAA48S,EAAAyoD,GACA9mV,KAAAkiQ,OAAAz+Q,OAAA46S,GACAr+R,KAAAyhV,QAAAh+V,OAAA46S,OAEA,CACA,MAAAoE,EAAA68C,EAAAyH,eAAA/mV,KAAAq+R,EAAAr+R,KAAA2hE,SAAAikD,GAAA3hI,IAEA+b,KAAAwpQ,OAAAzqR,IAAAkF,IAAA+b,KAAA6uG,MAAAA,MAAA5qH,IAAA,IAEA+b,KAAAwhV,KAAA//V,IAAA48S,EAAAoE,GAEAziS,KAAAwhV,KAAAhgW,IAAA68S,GAAAjqY,SAAA6vF,IACA+b,KAAAqsH,IAAA,kCAAApoI,EAAAo6S,GACAr+R,KAAAgnV,WAAA/iW,EAAAo6S,MAQAxnY,MAAAwnY,GACA,IAAAr+R,KAAA+gH,QACA,MAAA,IAAAjoH,MAAA,6BAEAkH,KAAAqsH,IAAA,WAAAgyK,GAEA,MAAA4oD,EAAAjnV,KAAAwhV,KAAAhgW,IAAA68S,GACA4oD,IACAA,EAAA7yb,SAAA6vF,IACA+b,KAAAqsH,IAAA,sCAAApoI,EAAAo6S,GACAr+R,KAAAknV,WAAAjjW,EAAAo6S,MAEAr+R,KAAAwhV,KAAA/9V,OAAA46S,IAUAxnY,SAAA44E,GACA,OAAAqvW,EAAA9+U,UAAA,OAAA,GAAA,YACAvwB,EAAA03W,eAAAnnV,KAAA07H,OAAA7C,gBACA74H,KAAA6uG,MAAAu4O,eAAA33W,GACAuwB,KAAAwiV,aAAA4E,eAAA33W,IAEA,MAAAw0W,EAAAjkV,KAAAoiV,SAAA3yW,GACAy0W,EAAA3E,EAAA4E,kBAAAF,GAEAjkV,KAAAuhV,UAAAlwN,IAAA6yN,GACAlkV,KAAAgiV,aAAA3wN,IAAA5hJ,GACA,MAAA43W,EAAA,IAAA1oW,IACAlP,EAAAmuT,SAAAxpY,SAAAiqY,IACA,MAAAipD,EAAAtnV,KAAAunV,OAAA/lW,IAAA68S,GACA,GAAAipD,EAGA,GAAAtnV,KAAA2hE,SAAAu+Q,cAAAzwW,EAAAg6E,OAAAzpD,KAAA07H,OAAA7C,cAGAyuN,EAAAlzb,SAAA6vF,KACA+b,KAAAwpQ,OAAAzqR,IAAAkF,IAAA+b,KAAA6uG,MAAAA,MAAA5qH,IAAA+b,KAAA2hE,SAAAu/Q,gBAAAsG,mBACAH,EAAAroW,IAAAiF,UAIA,CAKA+b,KAAAwpQ,OAAAp1W,SAAA6vF,IACAojW,EAAAroW,IAAAiF,MAGAqjW,EAAAlzb,SAAA6vF,IACA,MAAA4qH,EAAA7uG,KAAA6uG,MAAAA,MAAA5qH,GACA8+V,EAAA/iV,KAAAyiS,MAAAjhT,IAAAyC,GACA8+V,GAGAA,EAAAx3O,WAAA6wB,EAAAglN,YAAAvyO,GAAA7uG,KAAA2hE,SAAAu/Q,gBAAAsG,kBACAH,EAAAroW,IAAAiF,MAIA,IAAAgjW,EAAAjnV,KAAAwhV,KAAAhgW,IAAA68S,GACA,IAAA4oD,IAAAA,EAAAhqV,KAAA,CAGA,GADAgqV,EAAAjnV,KAAAkiQ,OAAA1gR,IAAA68S,IACA4oD,EAAA,CAEA,MAAAxkD,EAAA68C,EAAAyH,eAAA/mV,KAAAq+R,EAAAr+R,KAAA2hE,SAAAikD,GAAA3hI,GACA+b,KAAA6uG,MAAAA,MAAA5qH,IAAA+b,KAAA2hE,SAAAu/Q,gBAAAsG,mBAEA/kD,EAAAxlS,KAAA,GACAgqV,EAAAxkD,EACAziS,KAAAkiQ,OAAAzgR,IAAA48S,EAAAoE,IAGAwkD,EAAA,IAAAtoW,IAIAqhB,KAAAyhV,QAAAhgW,IAAA48S,EAAAr+R,KAAAmlV,QAEA8B,EAAA7yb,SAAA0lb,IACAuN,EAAAroW,IAAA86V,UAKA,MAAAn3L,EAAA48L,EAAAuE,gBAAA,CACA5E,EAAA3+J,MAAA2kK,uBAAAz1W,KAEA43W,EAAAjzb,SAAA6vF,IACAA,IAAAxU,EAAAg6E,MAGAzpD,KAAA+jV,SAAA9/V,EAAA0+J,SAUA9rP,WAAAotF,EAAAo6S,GACA,MAAAqlD,EAAA,CAAA,CACAiB,QAAAtmD,IAEAt9P,EAAAw+S,EAAAuE,gBAAA,GAAA,CAAAJ,MAAAA,IACA1jV,KAAA+jV,SAAA9/V,EAAA88C,GAQAlqI,WAAAotF,EAAAo6S,GACA,MAAAolD,EAAA,CACAzjV,KAAA0lV,WAAAzhW,EAAAo6S,EAAAr+R,KAAA2hE,SAAAw+Q,OAEAp/S,EAAAw+S,EAAAuE,gBAAA,GAAA,CAAAL,MAAAA,IACAzjV,KAAA+jV,SAAA9/V,EAAA88C,GAKAlqI,SAAAotF,EAAA4/V,GACA,MAAAd,EAAA/iV,KAAAyiS,MAAAjhT,IAAAyC,GACA,IAAA8+V,IAAAA,EAAAmD,WACA,OAGA,MAAA70Q,EAAArxE,KAAA2hV,QAAAngW,IAAAyC,GACAotF,IACArxE,KAAAynV,kBAAAxjW,EAAA4/V,EAAAxyQ,GACArxE,KAAA2hV,QAAAl+V,OAAAQ,IAGA,MAAAq/V,EAAAtjV,KAAA0hV,OAAAlgW,IAAAyC,GACAq/V,IACAtjV,KAAA0nV,iBAAAzjW,EAAA4/V,EAAAP,GACAtjV,KAAA0hV,OAAAj+V,OAAAQ,IAEA8+V,EAAAp+L,MAAAy6L,EAAAt7C,IAAAxgS,OAAAugV,GAAApqN,UAEA5iO,kBAAAotF,EAAA4/V,EAAAxyQ,GACA,MAAAs2Q,GAAAt2Q,EAAAqyQ,OAAA,IACA31W,QAAA,EAAA42W,QAAAA,MAAAA,GAAA3kV,KAAAwhV,KAAAhgW,IAAAmjW,IAAA,IAAAhmW,KAAAI,IAAAkF,KACA2jW,GAAAv2Q,EAAAoyQ,OAAA,IACA11W,QAAA,EAAA42W,QAAAA,OAAAA,GAAA3kV,KAAAwhV,KAAAhgW,IAAAmjW,IAAA,IAAAhmW,KAAAI,IAAAkF,MACA0jW,EAAA1iX,QAAA2iX,EAAA3iX,UAGA4+W,EAAAlC,SACAkC,EAAAlC,QAAA+B,MAAAG,EAAAlC,QAAA+B,OAAAG,EAAAlC,QAAA+B,MAAA7xV,OAAA81V,GACA9D,EAAAlC,QAAA8B,MAAAI,EAAAlC,QAAA8B,OAAAI,EAAAlC,QAAA8B,MAAA5xV,OAAA+1V,IAGA/D,EAAAlC,QAAA,CAAA2B,MAAA,GAAAD,MAAA,GAAAK,MAAAiE,EAAAlE,MAAAmE,IAGA/wb,iBAAAotF,EAAA4/V,EAAAP,GACAO,EAAAlC,UACAkC,EAAAlC,QAAA,CAAA2B,MAAA,GAAAD,MAAA,GAAAK,MAAA,GAAAD,MAAA,KAEAI,EAAAlC,QAAA2B,MAAAA,EAOAzsb,gBAAA8wb,EAAAC,EAAAC,GACA,MAAA1H,EAAAngV,KAAA2hE,SAAAw+Q,KACA,IAAA,MAAAl8V,EAAAsjW,KAAAI,EAAA,CACA,MAAAjE,EAAA6D,EAAAn9W,KAAAu6W,IAAA,CAAAA,QAAAA,MACA,IAAAlB,EAAA,GAEA,MAAAqE,EAAAF,EAAApmW,IAAAyC,GACA6jW,IACArE,EAAAqE,EAAA19W,KAAAu6W,GAAA3kV,KAAA0lV,WAAAzhW,EAAA0gW,EAAAxE,IAAA0H,EAAArmW,IAAAyC,MACA2jW,EAAAnkW,OAAAQ,IAEA,MAAA4/V,EAAAtE,EAAAuE,gBAAA,GAAA,CAAAJ,MAAAA,EAAAD,MAAAA,IACAzjV,KAAA+jV,SAAA9/V,EAAA4/V,GAEA,IAAA,MAAA5/V,EAAAsjW,KAAAK,EAAA,CACA,MAAAnE,EAAA8D,EAAAn9W,KAAAu6W,GAAA3kV,KAAA0lV,WAAAzhW,EAAA0gW,EAAAxE,IAAA0H,EAAArmW,IAAAyC,MACA4/V,EAAAtE,EAAAuE,gBAAA,GAAA,CAAAL,MAAAA,IACAzjV,KAAA+jV,SAAA9/V,EAAA4/V,IASAhtb,YAAAwnY,EAAAr5M,GACA,MAAA4/P,EAAA5kV,KAAAgiV,aAAA+F,aAAA1pD,GACA,IAAAumD,EAAA3/W,OACA,OAGAs6W,EAAAl8B,QAAAuhC,GAEAA,EAAA3/W,OAAAm3J,EAAAsoN,yBAEA1kV,KAAAqsH,IAAA,uEAAAu4N,EAAA3/W,QAMA,MAAA+iX,EAAA,GACAC,EAAAjoV,KAAAunV,OAAA/lW,IAAA68S,GACA,IAAA4pD,EAEA,OAEAA,EAAA7zb,SAAA6vF,IACA,MAAA8+V,EAAA/iV,KAAAyiS,MAAAjhT,IAAAyC,GACA8+V,IAGA/9P,EAAAjmG,IAAAkF,KACA+b,KAAAwpQ,OAAAzqR,IAAAkF,IACAs7V,EAAA2I,kBAAAnF,EAAAx3O,WACAvrG,KAAA6uG,MAAAA,MAAA5qH,IAAA+b,KAAA2hE,SAAAu/Q,gBAAAsD,iBACAwD,EAAAl9W,KAAAmZ,MAGA,IAAAmnF,EAAAprE,KAAA2hE,SAAAm/Q,MACA,MAAAqH,EAAA/rN,EAAAgsN,sBAAAJ,EAAA/iX,OACAkjX,EAAA/8Q,IACAA,EAAA+8Q,GAEA/8Q,EAAA48Q,EAAA/iX,OACAmmG,EAAA48Q,EAAA/iX,OAGAs6W,EAAAl8B,QAAA2kC,GAGAA,EAAA5iX,MAAA,EAAAgmG,GAAAh3K,SAAA6vF,IACA,IAAAokW,EAAAzD,EACAA,EAAA3/W,OAAAm3J,EAAAsoN,0BAIA2D,EAAA9I,EAAAl8B,QAAAglC,EAAAjjX,SAAAA,MAAA,EAAAg3J,EAAAsoN,0BAEA1kV,KAAAsoV,YAAArkW,EAAA,CACA0gW,QAAAtmD,EACAumD,WAAAyD,OAOAxxb,SAEA,IAAA,MAAAijb,EAAAwJ,KAAAtjV,KAAA0hV,OAAAxkV,UAAA,CACA8C,KAAA0hV,OAAAj+V,OAAAq2V,GACA,MAAA/4S,EAAAw+S,EAAAuE,gBAAA,GAAA,CAAAR,MAAAA,IACAtjV,KAAA+jV,SAAAjK,EAAA/4S,GAGA,IAAA,MAAA+4S,EAAA6H,KAAA3hV,KAAA2hV,QAAAzkV,UAAA,CACA8C,KAAA2hV,QAAAl+V,OAAAq2V,GACA,MAAA/4S,EAAAw+S,EAAAuE,gBAAA,GAAA,CAAAJ,MAAA/B,EAAA+B,MAAAD,MAAA9B,EAAA8B,QACAzjV,KAAA+jV,SAAAjK,EAAA/4S,IASAlqI,YAAAotF,EAAAskW,GACAvoV,KAAAqsH,IAAA,mBAAApoI,GACA,MAAAy9V,EAAA1hV,KAAA0hV,OAAAlgW,IAAAyC,IAAA,GACA+b,KAAA0hV,OAAAjgW,IAAAwC,EAAAy9V,EAAA7vV,OAAA02V,IAMA1xb,OACA,OAAAknG,KAAAunE,MASAzuK,WAAAotF,EAAAo6S,EAAA8hD,GACA,GAAAngV,KAAAyiS,MAAAjhT,IAAAyC,GAAAsnH,WAAA6wB,EAAA2jN,eAEA,MAAA,CACA4E,QAAAtmD,EACAoE,MAAA,IAKA,MAAAq/C,EAAA1lN,EAAAopN,sBAAA,IACAgD,EAAA,GACA,GAAArI,EAAA,CAEAb,EAAAyH,eAAA/mV,KAAAq+R,EAAAjiK,EAAAgqN,qBAAAqC,GACAA,IAAAxkW,GAAA+b,KAAA6uG,MAAAA,MAAA45O,IAAA,IAEAr0b,SAAA8yE,IAKA,MAAAw0J,EAAA3N,EAAA0M,oBAAAvzJ,GACAshX,EAAA19W,KAAA,CACAu7W,OAAA3qN,EAAApC,UACAgtN,iBAAAtmV,KAAA0iV,QAAAzhC,UAAAE,YAAAunC,eAAAhtN,QAIA,MAAA,CACAipN,QAAAtmD,EACAoE,MAAA+lD,EACA1G,QAAAA,IAIAlC,EAAAxxN,WAAAgO,EAAA0jN,eACAzsb,EAAAC,QAAAssb,oUC5nCA,aAEA,MAAA37G,EAAA1wU,EAAA,UACA8xP,aAAAA,GAAA9xP,EAAA,UACA0rP,EAAA1rP,EAAA,aAEAk1U,KAAAA,GAAAl1U,EAAA,WAEAo1b,EAAAp1b,EAAA,oCACAsoO,MAAAA,GAAAtoO,EAAA,aAEAuwY,IAAAA,GAAAvwY,EAAA,iBACAq1b,EAAAr1b,EAAA,mBACAs1b,gBAAAA,GAAAt1b,EAAA,sBACAgtR,EAAAhtR,EAAA,YAEAu1b,YACAA,EAAAC,gBACAA,GACAx1b,EAAA,kBAuCA,MAAAy1b,UAAA3jM,EAKAxuP,aAAAwqb,UACAA,EAAAxB,YACAA,EAAAlkH,OACAA,EAAAstH,sBACAA,EAAAJ,EAAAK,WAAAC,gBACAA,GAAA,EAAAC,SACAA,GAAA,IAEA,GAAA,iBAAA/H,EACA,MAAA,IAAAvoV,MAAA,oCAGA,IAAA+mV,EACA,MAAA,IAAA/mV,MAAA,4BAGA,IAAA6iO,EACA,MAAA,IAAA7iO,MAAA,sBA4CA,GAzCAysB,QAEAvlB,KAAAqsH,IAAA74N,OAAAiqG,OAAAwmO,EAAAo9G,GAAA,CACA5nV,IAAAwqO,EAAA,GAAAo9G,aAMArhV,KAAA6/U,YAAAt/J,EAAA8oK,YAAAxJ,GACA7/U,KAAA0iV,QAAA/mH,EACA37N,KAAAspV,UAAA3tH,EAAA2tH,UAIAtpV,KAAA07H,OAAAigG,EAAAjgG,OAEA17H,KAAA+gH,SAAA,EAOA/gH,KAAAunV,OAAA,IAAAvkW,IAOAgd,KAAAw9R,cAAA,IAAA7+S,IAOAqhB,KAAAyiS,MAAA,IAAAz/S,KAGA6lW,EAAAI,GACA,MAAAhqM,EAAA,IAAAnmJ,MAAA,mCAAA+iI,EAAA0tN,8BAQAvpV,KAAAipV,sBAAAA,EAOAjpV,KAAAmpV,gBAAAA,EAOAnpV,KAAAopV,SAAAA,EAeAppV,KAAAwpV,gBAAA,IAAAxmW,IAEAgd,KAAAypV,kBAAA/zb,EACAsqG,KAAA0pV,kBAAA1pV,KAAA0pV,kBAAA/wV,KAAAqH,MACAA,KAAA2pV,iBAAA3pV,KAAA2pV,iBAAAhxV,KAAAqH,MACAA,KAAA4pV,oBAAA5pV,KAAA4pV,oBAAAjxV,KAAAqH,MAUAnpG,QACA,GAAAmpG,KAAA+gH,QACA,OAEA/gH,KAAAqsH,IAAA,YAIArsH,KAAAspV,UAAAt/J,OAAAhqL,KAAA6/U,YAAA7/U,KAAA0pV,mBAIA,MAAAG,EAAA,IAAAlB,EAAA,CACA9I,YAAA7/U,KAAA6/U,YACAtrO,SAAA,CACAu1O,UAAA9pV,KAAA2pV,iBACAI,aAAA/pV,KAAA4pV,uBAGA5pV,KAAAypV,aAAAzpV,KAAAspV,UAAAz/P,SAAAggQ,GAEA7pV,KAAAqsH,IAAA,WACArsH,KAAA+gH,SAAA,EAQAlqN,OACAmpG,KAAA+gH,UAKA/gH,KAAAspV,UAAAU,WAAAhqV,KAAAypV,cAEAzpV,KAAAqsH,IAAA,YACArsH,KAAAyiS,MAAAruY,SAAA2ub,GAAAA,EAAA/iW,UAEAggB,KAAAyiS,MAAA,IAAAz/S,IACAgd,KAAAw9R,cAAA,IAAA7+S,IACAqhB,KAAA+gH,SAAA,EACA/gH,KAAAqsH,IAAA,YAYAx1N,mBAAA00M,SAAAA,EAAAilB,OAAAA,EAAAy5N,WAAAA,IACA,MAAAvuN,EAAAuuN,EAAAC,WACAC,EAAAzuN,EAAA7C,cACAihN,EAAA95U,KAAA4iV,SAAAlnN,EAAAnwB,GACA6+O,EAAAtQ,EAAAuQ,oBAAA75N,GAEAxwH,KAAAsqV,iBAAAH,EAAAC,EAAAtQ,GAUAjjb,uBAAA6kO,EAAA6uN,GACA,MAAAJ,EAAAzuN,EAAA7C,cACA74H,KAAAqsH,IAAA,YAAA89N,GAEA,IACA,MAAA35N,OAAAA,EAAAjlB,SAAAA,SAAAg/O,EAAAC,UAAAxqV,KAAA6/U,aACA/F,EAAA95U,KAAA4iV,SAAAlnN,EAAAnwB,SACAuuO,EAAA2Q,qBAAAj6N,GACA,MAAA/2H,GACAuG,KAAAqsH,IAAA5yH,IAAAA,GAIAuG,KAAA0qV,mBAAAP,EAAAtsV,MAAA4rD,KAAAzpD,KAAAw9R,gBAAA,GAUA3mY,oBAAA6kO,EAAAjiI,GACA,MAAA0wV,EAAAzuN,EAAA7C,cAEA74H,KAAAqsH,IAAA,mBAAA89N,EAAA1wV,EAAAA,EAAA9f,QAAA,IACAqmB,KAAAgjV,YAAAtnN,GAWA7kO,SAAA6kO,EAAAnwB,GACA,MAAAtnH,EAAAy3I,EAAA7C,cACAzjI,EAAA4K,KAAAyiS,MAAAjhT,IAAAyC,GAGA,GAAAmR,EACA,OAAAA,EAIA4K,KAAAqsH,IAAA,WAAApoI,GAEA,MAAA8+V,EAAA,IAAA6F,EAAA,CACA3kW,GAAAy3I,EACAnwB,SAAAA,IAMA,OAHAvrG,KAAAyiS,MAAAhhT,IAAAwC,EAAA8+V,GACAA,EAAAn8N,KAAA,SAAA,IAAA5mH,KAAAgjV,YAAAtnN,KAEAqnN,EAUAlsb,YAAA6kO,GACA,IAAAA,EAAA,OACA,MAAAz3I,EAAAy3I,EAAA7C,cACAkqN,EAAA/iV,KAAAyiS,MAAAjhT,IAAAyC,GACA,GAAA8+V,EAAA,CAGAA,EAAAttN,qBACAstN,EAAA/iW,QAGAggB,KAAAqsH,IAAA,cAAApoI,GACA+b,KAAAyiS,MAAAh/S,OAAAQ,GAGA,IAAA,MAAAw+S,KAAAziS,KAAAunV,OAAAnqV,SACAqlS,EAAAh/S,OAAAQ,GAGA,OAAA8+V,GAaAlsb,uBAAAszb,EAAA35N,EAAAuyN,GACA,UACAt6G,EACAj4G,GACAl9E,MAAAv+D,IACA,UAAA,MAAA23E,KAAA33E,EAAA,CACA,MAAA41W,EAAAj+R,aAAA+rE,WAAA/rE,EAAAA,EAAAtnF,QACAwlX,EAAA5qV,KAAA6qV,WAAAF,GAEA3qV,KAAAkjV,YAAAiH,EAAApH,EAAA6H,OAIA,MAAAnxV,GACAuG,KAAA4pV,oBAAA7G,EAAA9+V,GAAAwV,IAYA5iG,YAAAszb,EAAApH,EAAApgM,GACA3iJ,KAAAqsH,IAAA,WAAA89N,GACA,MAAAlqD,EAAAt9I,EAAA66I,cACAstD,EAAAnoM,EAAAmoM,KAUA,OARA7qD,EAAAh7T,SAEAg7T,EAAA7rY,SAAA22b,IACA/qV,KAAAgrV,kBAAAb,EAAAY,MAEA/qV,KAAA64E,KAAA,6BAAAkqQ,EAAA9+V,GAAAg8S,IAGAjgS,KAAAirV,YAAAd,IAKAW,EAAA7lX,QAEA6lX,EAAA12b,SAAAulF,IACA,KAAAqmB,KAAAmpV,iBAAAxvW,EAAAikT,UAAAjkT,EAAAikT,SAAAh3T,MAAAy3T,GAAAr+R,KAAAw9R,cAAAz+S,IAAAs/S,MAEA,YADAr+R,KAAAqsH,IAAA,sDAGA,MAAA58I,EAAA8wM,EAAA2qK,sBAAAvxW,EAAAwwW,GACAnqV,KAAAgkV,mBAAAv0W,OAGA,IAfAuwB,KAAAqsH,IAAA,6CAAA89N,IACA,GAuBAtzb,kBAAAotF,EAAA8mW,GACA,MAAAhsS,EAAAgsS,EAAApG,QAEA,IAAA5lS,EACA,OAGA,IAAAosS,EAAAnrV,KAAAunV,OAAA/lW,IAAAu9D,GACAosS,IACAA,EAAA,IAAAxsW,IACAqhB,KAAAunV,OAAA9lW,IAAAs9D,EAAAosS,IAGAJ,EAAAptD,UAEAwtD,EAAAnsW,IAAAiF,GAGAknW,EAAA1nW,OAAAQ,GAUAptF,yBAAA44E,GACA,GAAAuwB,KAAA07H,OAAA7C,gBAAAppJ,EAAAg6E,MAAAzpD,KAAAopV,SAAA,CAKA,UACAppV,KAAAi8H,SAAAxsJ,GACA,MAAAgqB,GAEA,YADAuG,KAAAqsH,IAAA,sCAAA5yH,GAKAuG,KAAAorV,aAAA37W,GAEAuwB,KAAAqrV,SAAA9qK,EAAA2kK,uBAAAz1W,KAQA54E,aAAA8iF,GACAA,EAAAikT,SAAAxpY,SAAAiqY,IACAr+R,KAAAw9R,cAAAz+S,IAAAs/S,IACAr+R,KAAA64E,KAAAwlN,EAAA1kT,MAYA9iF,SAAA44E,GACA,MAAA67W,EAAAtrV,KAAAipV,sBACA,OAAAqC,GACA,KAAAzC,EAAAK,WAEA,OAAA3oK,EAAAgrK,MAAA97W,EAAAg6E,KAAAh6E,EAAA+7W,OACA,KAAA3C,EAAA4C,aACA,OAAAlrK,EAAAmrK,YAAAj8W,EAAAi9E,MACA,QACA,MAAAuyF,EAAA,IAAAnmJ,MAAA,sDAAAwyV,GAAAzvN,EAAA8vN,iCAYA90b,YAAAotF,GACA,OAAA,EAUAptF,WAAA8hO,GACA,OAAAmrK,EAAA1/R,OAAAu0H,GAUA9hO,WAAA8rP,GACA,OAAAmhJ,EAAAxgS,OAAAq/I,GAAAlpB,SAUA5iO,SAAAotF,EAAA0+J,GACA,MAAAogM,EAAA/iV,KAAAyiS,MAAAjhT,IAAAyC,GACA,GAAA8+V,GAAAA,EAAAmD,WAMAnD,EAAAp+L,MAAA3kJ,KAAA4rV,WAAAjpM,QANA,CACA,MAAAlzK,EAAA,sBAAAwU,+CAEA+b,KAAAqsH,IAAA5yH,IAAAhqB,IAcA54E,mBAAAotF,EAAAsjW,EAAA5pD,GACA,OAAA39R,KAAA+jV,SAAA9/V,EAAA,CACAu5S,cAAA+pD,EAAAn9W,KAAA20E,IAAA,CAAA4lS,QAAA5lS,EAAA4+O,UAAAA,QAWA9mY,eAAA8iF,GACA,MAAA2xW,EAAAtrV,KAAAipV,sBACA,OAAAqC,GACA,KAAAzC,EAAA4C,aACA,GAAA9xW,EAAA8vE,KACA,MAAAw1F,EAAA,IAAAnmJ,MAAA,+CAAA+iI,EAAAgwN,qBAEA,GAAAlyW,EAAAsN,UACA,MAAAg4J,EAAA,IAAAnmJ,MAAA,oDAAA+iI,EAAAiwN,0BAEA,GAAAnyW,EAAA3kF,IACA,MAAAiqP,EAAA,IAAAnmJ,MAAA,8CAAA+iI,EAAAkwN,oBAEA,GAAApyW,EAAA6xW,MACA,MAAAvsM,EAAA,IAAAnmJ,MAAA,gDAAA+iI,EAAAmwN,sBAEA,MACA,KAAAnD,EAAAK,WACA,IAAAvvW,EAAAsN,UACA,MAAAg4J,EAAA,IAAAnmJ,MAAA,gEAAA+iI,EAAAowN,uBAEA,IAAAtyW,EAAA6xW,MACA,MAAAvsM,EAAA,IAAAnmJ,MAAA,4DAAA+iI,EAAAqwN,mBAEA,UAAAnD,EAAApvW,GACA,MAAAslK,EAAA,IAAAnmJ,MAAA,4CAAA+iI,EAAAswN,uBAEA,MACA,QACA,MAAAltM,EAAA,IAAAnmJ,MAAA,wDAAAwyV,GAAAzvN,EAAA8vN,gCAGA,IAAA,MAAAttD,KAAA1kT,EAAAikT,SAAA,CACA,MAAAwuD,EAAApsV,KAAAwpV,gBAAAhoW,IAAA68S,GACA+tD,SACAA,EAAA/tD,EAAA1kT,IAaA9iF,cAAA8iF,GACA,MAAA2xW,EAAAtrV,KAAAipV,sBACA,OAAAqC,GACA,KAAAzC,EAAAK,WAGA,OAFAvvW,EAAA8vE,KAAAzpD,KAAA07H,OAAA7C,cACAl/I,EAAA6xW,MAAAjrK,EAAA8rK,cACAvD,EAAA9oV,KAAA07H,OAAA6kD,EAAA2kK,uBAAAvrW,IACA,KAAAkvW,EAAA4C,aACA,OAAA1lR,QAAAC,QAAArsF,GACA,QACA,MAAAslK,EAAA,IAAAnmJ,MAAA,qDAAAwyV,GAAAzvN,EAAA8vN,iCAYA90b,eAAAwnY,GACA,IAAAr+R,KAAA+gH,QACA,MAAAk+B,EAAA,IAAAnmJ,MAAA,mBAAA,uBAGA,IAAAulS,GAAA,iBAAAA,EACA,MAAAp/I,EAAA,IAAAnmJ,MAAA,mCAAA,uBAGA,MAAAwuV,EAAAtnV,KAAAunV,OAAA/lW,IAAA68S,GACA,OAAAipD,EAGAzpV,MAAA4rD,KAAA69R,GAFA,GAaAzwb,cAAAwnY,EAAA1kT,GACA,IAAAqmB,KAAA+gH,QACA,MAAA,IAAAjoH,MAAA,0BAGAkH,KAAAqsH,IAAA,UAAAgyK,EAAA1kT,GAEA,MACA2yW,EAAA,CACAnF,aAFAnnV,KAAA07H,OAAA7C,cAGAnsE,KAAA/yE,EACAikT,SAAA,CAAAS,IAIAkuD,QAAAvsV,KAAAwsV,cAAAF,GAEA78W,EAAA8wM,EAAA2qK,sBAAAqB,GAGAvsV,KAAAopV,UAAAppV,KAAAorV,aAAA37W,SAGAuwB,KAAAqrV,SAAA57W,GAYA54E,SAAA8iF,GACA,MAAAslK,EAAA,IAAAnmJ,MAAA,+CAAA,uBAUAjiG,UAAAwnY,GACA,IAAAr+R,KAAA+gH,QACA,MAAA,IAAAjoH,MAAA,0BAGAkH,KAAAw9R,cAAAz+S,IAAAs/S,KACAr+R,KAAAw9R,cAAAx+S,IAAAq/S,GACAr+R,KAAAyiS,MAAAruY,SAAA,CAAA+mF,EAAA8I,IAAA+b,KAAA0qV,mBAAAzmW,EAAA,CAAAo6S,IAAA,MAWAxnY,YAAAwnY,GACA,IAAAr+R,KAAA+gH,QACA,MAAA,IAAAjoH,MAAA,yBAGAkH,KAAAw9R,cAAAz+S,IAAAs/S,IAAA,IAAAr+R,KAAA8nO,cAAAu2D,KACAr+R,KAAAw9R,cAAA/5S,OAAA46S,GACAr+R,KAAAyiS,MAAAruY,SAAA,CAAA+mF,EAAA8I,IAAA+b,KAAA0qV,mBAAAzmW,EAAA,CAAAo6S,IAAA,MAUAxnY,YACA,IAAAmpG,KAAA+gH,QACA,MAAA,IAAAjoH,MAAA,yBAGA,OAAA+E,MAAA4rD,KAAAzpD,KAAAw9R,gBAIAwrD,EAAAzoK,MAAAA,EACAyoK,EAAAH,gBAAAA,EAEAx1b,EAAAC,QAAA01b,uRCjvBA,aAEA,MAAAyD,EAAAl5b,EAAA,WACAm5b,EAAAx2b,OAAAugP,IAAA,sDAEA,MAAAkyM,UAAA8D,EAIA51b,aAAAojG,IACAA,EAAAt0B,IACAA,EAAAk6W,YACAA,EAAAtrO,SACAA,IAIA,GAFAhvF,MAAA,CAAAtrB,IAAAA,EAAAt0B,IAAAA,EAAA4uI,SAAAA,KAEAsrO,EACA,MAAA,IAAA/mV,MAAA,6CAGA,IAAAy7G,EACA,MAAA,IAAAz7G,MAAA,mCAGA,GAAA,mBAAAy7G,EAAAu1O,UACA,MAAA,IAAAhxV,MAAA,4CAGA,GAAA,mBAAAy7G,EAAAw1O,aACA,MAAA,IAAAjxV,MAAA,+CAGAkH,KAAA6/U,YAAAhiV,MAAA/gB,QAAA+iW,GAAAA,EAAA,CAAAA,GACA7/U,KAAA2sV,gBAAAj3b,EAEAsqG,KAAA4sV,kBAAA5sV,KAAA4sV,kBAAAj0V,KAAAqH,MACAA,KAAA6sV,eAAA7sV,KAAA6sV,eAAAl0V,KAAAqH,MAGAxe,IAAAtrF,OAAAspM,eACA,MAAA,WAGAktP,IAAAA,KACA,OAAA,EASA71b,4BAAAmgP,GACA,OAAA35J,QAAA25J,GAAAA,EAAA01M,IAMApD,cAAAA,GACAtpV,KAAA2sV,WAAArD,EACAtpV,KAAA2sV,WAAA1rC,UAAAjzU,GAAA,mBAAAgyB,KAAA4sV,mBACA5sV,KAAA2sV,WAAAvO,kBAAApwW,GAAA,eAAAgyB,KAAA6sV,gBAGA7sV,KAAA8sV,aAAA9sV,KAAA2sV,WAAA1rC,UAAAxe,MAAArlS,UASAvmG,aAAAk2b,GACA,IAAA,MAAA9oW,GAAAA,EAAA44N,UAAAA,KAAAkwI,EACA,GAAA/sV,KAAA6/U,YAAA9xW,QAAAqgJ,GAAAyuF,EAAApuO,SAAA2/I,KAAAnpJ,OAAA,CAEA+6B,KAAAyiS,MAAAzjT,IAAAiF,EAAA40I,eAEA,MAAAoxN,EAAAjqV,KAAA2sV,WAAAK,cAAA/oW,GACAgmW,GAAAjqV,KAAAitV,WAAAhpW,EAAAgmW,QAGAjqV,KAAAyiS,MAAAh/S,OAAAQ,EAAA40I,eAYAhiO,mBAAA6kO,OAAAA,EAAAmhF,UAAAA,IACA,MAAAqwI,EAAAltV,KAAAyiS,MAAA1jT,IAAA28I,EAAA7C,eACAs0N,EAAAtwI,EAAA9uO,QAAAw9H,GAAAvrG,KAAA6/U,YAAApxW,SAAA88H,KAGA2hP,GAAA,IAAAC,EAAAloX,QACA+6B,KAAAotV,cAAA1xN,GAIA,IAAA,MAAAnwB,KAAAsxG,EACA,GAAA78M,KAAA6/U,YAAApxW,SAAA88H,GAAA,CACA,MAAA8hP,EAAArtV,KAAA2sV,WAAA1rC,UAAAz/T,IAAAk6I,GAEA,YADA17H,KAAA8sV,aAAA,CAAAO,KAYAx2b,eAAAozb,GAEA,MAAAvuN,EAAAuuN,EAAAC,WACArtI,EAAA78M,KAAA2sV,WAAA1rC,UAAAK,UAAA9/T,IAAAk6I,GAEAmhF,GAIA78M,KAAA6/U,YAAA1hW,MAAAiwI,GAAAyuF,EAAApuO,SAAA2/I,OACApuH,KAAAyiS,MAAAzjT,IAAA08I,EAAA7C,eACA74H,KAAAitV,WAAAvxN,EAAAuuN,KAeA52b,EAAAC,QAAAq1b,+CCrJA,aAEA,MAAAvgP,EAAA,OACAklP,EAAAp3b,OAAAugP,IAAA,kCAmBA,MAAAg2M,EAIA51b,aAAAojG,IACAA,EAAA,EAAAt0B,IACAA,EAAA0mC,EAAAA,EAAAkoG,SACAA,EAAA,KAEAv0G,KAAA/F,IAAAA,EACA+F,KAAAr6B,IAAAA,EAGAq6B,KAAAitV,WAAA14O,EAAAu1O,WAAA1hP,EACApoG,KAAAotV,cAAA74O,EAAAw1O,cAAA3hP,EAOApoG,KAAAyiS,MAAA,IAAA9jT,IAGA6C,IAAAtrF,OAAAspM,eACA,MAAA,WAGA8tP,IAAAA,KACA,OAAA,EASAz2b,kBAAAmgP,GACA,OAAA35J,QAAA25J,GAAAA,EAAAs2M,IAMAhE,cAAAA,GACAtpV,KAAA2sV,WAAArD,EASAzyb,WAAA6kO,GACA17H,KAAAotV,cAAA1xN,IAIAroO,EAAAC,QAAAm5b,gCClFA,aAEAn5b,EAAAuoO,MAAA,CAIA0tN,6BAAA,+BAIAoC,+BAAA,iCAOAM,sBAAA,wBAIAC,kBAAA,oBAIAC,sBAAA,wBAOAN,oBAAA,sBAIAC,yBAAA,2BAIAC,mBAAA,qBAIAC,qBAAA,sDC3CA,aAEA,IAAA1qM,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,uBAAAN,EAAAM,MAAA,qBAAA,IAEA1mD,EAAA4oM,IAAA,WAkBA,SAAAA,EAAA58T,GAGA,GAFA84B,KAAAw9R,cAAA,GACAx9R,KAAA8qV,KAAA,GACA5jX,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA8lBA,OArlBA28T,EAAAnmS,UAAA6/R,cAAA77I,EAAA4D,WAQAu+I,EAAAnmS,UAAAmtV,KAAAnpM,EAAA4D,WAWAu+I,EAAAxgS,OAAA,SAAApkB,EAAAulI,GAGA,GAFAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAs+S,eAAAt+S,EAAAs+S,cAAAv4T,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAAs+S,cAAAv4T,SAAAkC,EACA+zH,EAAA4oM,IAAAypD,QAAAjqV,OAAApkB,EAAAs+S,cAAAr2T,GAAAs9I,EAAAs9B,OAAA,IAAA6C,QAAAC,SAEA,GAAA,MAAA3lK,EAAA4rW,MAAA5rW,EAAA4rW,KAAA7lX,OACA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAA4rW,KAAA7lX,SAAAkC,EACA+zH,EAAA4oM,IAAA3/B,QAAA7gQ,OAAApkB,EAAA4rW,KAAA3jX,GAAAs9I,EAAAs9B,OAAA,IAAA6C,QAAAC,SAEA,OAAApgC,GAcAq/K,EAAA1/R,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAA4oM,IACA91R,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAs+S,eAAAt+S,EAAAs+S,cAAAv4T,SACAia,EAAAs+S,cAAA,IACAt+S,EAAAs+S,cAAA1yT,KAAAowH,EAAA4oM,IAAAypD,QAAAnpV,OAAA4J,EAAAA,EAAA+zI,WACA,MACA,KAAA,EACA7iK,EAAA4rW,MAAA5rW,EAAA4rW,KAAA7lX,SACAia,EAAA4rW,KAAA,IACA5rW,EAAA4rW,KAAAhgX,KAAAowH,EAAA4oM,IAAA3/B,QAAA//P,OAAA4J,EAAAA,EAAA+zI,WACA,MACA,QACA/zI,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWA4kT,EAAA3hJ,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAA4oM,IACA,OAAAlmQ,EACA,IAAA1+C,EAAA,IAAAg8G,EAAA4oM,IACA,GAAAlmQ,EAAA4/P,cAAA,CACA,IAAA3/R,MAAA/gB,QAAA8gD,EAAA4/P,eACA,MAAAz4R,UAAA,sCACA7lB,EAAAs+S,cAAA,GACA,IAAA,IAAAr2T,EAAA,EAAAA,EAAAy2D,EAAA4/P,cAAAv4T,SAAAkC,EAAA,CACA,GAAA,iBAAAy2D,EAAA4/P,cAAAr2T,GACA,MAAA49B,UAAA,uCACA7lB,EAAAs+S,cAAAr2T,GAAA+zH,EAAA4oM,IAAAypD,QAAAprM,WAAAvkH,EAAA4/P,cAAAr2T,KAGA,GAAAy2D,EAAAktT,KAAA,CACA,IAAAjtV,MAAA/gB,QAAA8gD,EAAAktT,MACA,MAAA/lV,UAAA,6BACA7lB,EAAA4rW,KAAA,GACA,IAAA3jX,EAAA,EAAAA,EAAAy2D,EAAAktT,KAAA7lX,SAAAkC,EAAA,CACA,GAAA,iBAAAy2D,EAAAktT,KAAA3jX,GACA,MAAA49B,UAAA,8BACA7lB,EAAA4rW,KAAA3jX,GAAA+zH,EAAA4oM,IAAA3/B,QAAAhiH,WAAAvkH,EAAAktT,KAAA3jX,KAGA,OAAA+X,GAYA4kT,EAAA1hJ,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAKA,IAJAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAA4/P,cAAA,GACA5/P,EAAAktT,KAAA,IAEA5rW,EAAAs+S,eAAAt+S,EAAAs+S,cAAAv4T,OAAA,CACA24D,EAAA4/P,cAAA,GACA,IAAA,IAAAlsS,EAAA,EAAAA,EAAApS,EAAAs+S,cAAAv4T,SAAAqsB,EACAssC,EAAA4/P,cAAAlsS,GAAA4pG,EAAA4oM,IAAAypD,QAAAnrM,SAAAljK,EAAAs+S,cAAAlsS,GAAA4+E,GAGA,GAAAhxF,EAAA4rW,MAAA5rW,EAAA4rW,KAAA7lX,OAAA,CACA24D,EAAAktT,KAAA,GACA,IAAAx5V,EAAA,EAAAA,EAAApS,EAAA4rW,KAAA7lX,SAAAqsB,EACAssC,EAAAktT,KAAAx5V,GAAA4pG,EAAA4oM,IAAA3/B,QAAA/hH,SAAAljK,EAAA4rW,KAAAx5V,GAAA4+E,GAGA,OAAAtyC,GAUAkmQ,EAAAnmS,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAyhJ,EAAAypD,QAAA,WAkBA,SAAAA,EAAArmX,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAgIA,OAvHAomX,EAAA5vV,UAAAggS,WAAA,EAQA4vD,EAAA5vV,UAAAgnV,QAAA,GAWA4I,EAAAjqV,OAAA,SAAApkB,EAAAulI,GAOA,OANAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAy+S,WAAAnqY,OAAAgnG,eAAAoD,KAAA1e,EAAA,cACAulI,EAAAs9B,OAAA,GAAAkC,KAAA/kK,EAAAy+S,WACA,MAAAz+S,EAAAylW,SAAAnxb,OAAAgnG,eAAAoD,KAAA1e,EAAA,YACAulI,EAAAs9B,OAAA,IAAApmJ,OAAAzc,EAAAylW,SACAlgO,GAcA8oO,EAAAnpV,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAA4oM,IAAAypD,QACAv/U,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAy+S,UAAA3vR,EAAAi2I,OACA,MACA,KAAA,EACA/kK,EAAAylW,QAAA32U,EAAArS,SACA,MACA,QACAqS,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAquW,EAAAprM,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAA4oM,IAAAypD,QACA,OAAA3vT,EACA,IAAA1+C,EAAA,IAAAg8G,EAAA4oM,IAAAypD,QAOA,OANA,MAAA3vT,EAAA+/P,YACAz+S,EAAAy+S,UAAAtgT,QAAAugD,EAAA+/P,YAEA,MAAA//P,EAAA+mT,UACAzlW,EAAAylW,QAAAt+W,OAAAu3D,EAAA+mT,UAEAzlW,GAYAquW,EAAAnrM,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAWA,OAVAsyC,EAAAuiC,WACA70E,EAAA+/P,WAAA,EACA//P,EAAA+mT,QAAA,IAEA,MAAAzlW,EAAAy+S,WAAAz+S,EAAAsb,eAAA,eACAojC,EAAA+/P,UAAAz+S,EAAAy+S,WAEA,MAAAz+S,EAAAylW,SAAAzlW,EAAAsb,eAAA,aACAojC,EAAA+mT,QAAAzlW,EAAAylW,SAEA/mT,GAUA2vT,EAAA5vV,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAkrM,EAtJA,GAyJAzpD,EAAA3/B,QAAA,WAsBA,SAAAA,EAAAj9R,GAEA,GADA84B,KAAA49R,SAAA,GACA12T,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA2QA,OAlQAg9R,EAAAxmQ,UAAA8rD,KAAAk4F,EAAAG,UAAA,IAQAqiH,EAAAxmQ,UAAA+uD,KAAAi1F,EAAAG,UAAA,IAQAqiH,EAAAxmQ,UAAA6tV,MAAA7pM,EAAAG,UAAA,IAQAqiH,EAAAxmQ,UAAAigS,SAAAj8I,EAAA4D,WAQA4+G,EAAAxmQ,UAAA1W,UAAA06J,EAAAG,UAAA,IAQAqiH,EAAAxmQ,UAAA3oG,IAAA2sP,EAAAG,UAAA,IAWAqiH,EAAA7gQ,OAAA,SAAApkB,EAAAulI,GASA,GARAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAuqE,MAAAj2J,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAuqE,MACA,MAAAvqE,EAAAwtE,MAAAl5J,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAwtE,MACA,MAAAxtE,EAAAssW,OAAAh4b,OAAAgnG,eAAAoD,KAAA1e,EAAA,UACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAssW,OACA,MAAAtsW,EAAA0+S,UAAA1+S,EAAA0+S,SAAA34T,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAA0+S,SAAA34T,SAAAkC,EACAs9I,EAAAs9B,OAAA,IAAApmJ,OAAAzc,EAAA0+S,SAAAz2T,IAMA,OAJA,MAAA+X,EAAA+H,WAAAzzF,OAAAgnG,eAAAoD,KAAA1e,EAAA,cACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAA+H,WACA,MAAA/H,EAAAlqF,KAAAxB,OAAAgnG,eAAAoD,KAAA1e,EAAA,QACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAlqF,KACAyvN,GAcA0/I,EAAA//P,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAA4oM,IAAA3/B,QACAn2P,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAuqE,KAAAz7C,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAwtE,KAAA1+C,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAssW,MAAAx9U,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAA0+S,UAAA1+S,EAAA0+S,SAAA34T,SACAia,EAAA0+S,SAAA,IACA1+S,EAAA0+S,SAAA9yT,KAAAkjC,EAAArS,UACA,MACA,KAAA,EACAzc,EAAA+H,UAAA+mB,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAlqF,IAAAg5G,EAAA2qH,QACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAilR,EAAAhiH,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAA4oM,IAAA3/B,QACA,OAAAvmO,EACA,IAAA1+C,EAAA,IAAAg8G,EAAA4oM,IAAA3/B,QAmBA,GAlBA,MAAAvmO,EAAA6rB,OACA,iBAAA7rB,EAAA6rB,KACAk4F,EAAA99I,OAAAO,OAAAw5B,EAAA6rB,KAAAvqE,EAAAuqE,KAAAk4F,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA6rB,OAAA,GACA7rB,EAAA6rB,KAAAxkF,SACAia,EAAAuqE,KAAA7rB,EAAA6rB,OAEA,MAAA7rB,EAAA8uB,OACA,iBAAA9uB,EAAA8uB,KACAi1F,EAAA99I,OAAAO,OAAAw5B,EAAA8uB,KAAAxtE,EAAAwtE,KAAAi1F,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA8uB,OAAA,GACA9uB,EAAA8uB,KAAAznF,SACAia,EAAAwtE,KAAA9uB,EAAA8uB,OAEA,MAAA9uB,EAAA4tT,QACA,iBAAA5tT,EAAA4tT,MACA7pM,EAAA99I,OAAAO,OAAAw5B,EAAA4tT,MAAAtsW,EAAAssW,MAAA7pM,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA4tT,QAAA,GACA5tT,EAAA4tT,MAAAvmX,SACAia,EAAAssW,MAAA5tT,EAAA4tT,QAEA5tT,EAAAggQ,SAAA,CACA,IAAA//R,MAAA/gB,QAAA8gD,EAAAggQ,UACA,MAAA74R,UAAA,yCACA7lB,EAAA0+S,SAAA,GACA,IAAA,IAAAz2T,EAAA,EAAAA,EAAAy2D,EAAAggQ,SAAA34T,SAAAkC,EACA+X,EAAA0+S,SAAAz2T,GAAAd,OAAAu3D,EAAAggQ,SAAAz2T,IAeA,OAZA,MAAAy2D,EAAA32C,YACA,iBAAA22C,EAAA32C,UACA06J,EAAA99I,OAAAO,OAAAw5B,EAAA32C,UAAA/H,EAAA+H,UAAA06J,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA32C,YAAA,GACA22C,EAAA32C,UAAAhiB,SACAia,EAAA+H,UAAA22C,EAAA32C,YAEA,MAAA22C,EAAA5oI,MACA,iBAAA4oI,EAAA5oI,IACA2sP,EAAA99I,OAAAO,OAAAw5B,EAAA5oI,IAAAkqF,EAAAlqF,IAAA2sP,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA5oI,MAAA,GACA4oI,EAAA5oI,IAAAiwE,SACAia,EAAAlqF,IAAA4oI,EAAA5oI,MAEAkqF,GAYAilR,EAAA/hH,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAkDA,IAjDAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAAggQ,SAAA,IAEA1tN,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA6rB,KAAA,IAEA7rB,EAAA6rB,KAAA,GACAymB,EAAAyoD,QAAA96H,QACA+/B,EAAA6rB,KAAAk4F,EAAAG,UAAAlkH,EAAA6rB,QAEAymB,EAAAyoD,QAAAtyJ,OACAu3D,EAAA8uB,KAAA,IAEA9uB,EAAA8uB,KAAA,GACAwjB,EAAAyoD,QAAA96H,QACA+/B,EAAA8uB,KAAAi1F,EAAAG,UAAAlkH,EAAA8uB,QAEAwjB,EAAAyoD,QAAAtyJ,OACAu3D,EAAA4tT,MAAA,IAEA5tT,EAAA4tT,MAAA,GACAt7Q,EAAAyoD,QAAA96H,QACA+/B,EAAA4tT,MAAA7pM,EAAAG,UAAAlkH,EAAA4tT,SAEAt7Q,EAAAyoD,QAAAtyJ,OACAu3D,EAAA32C,UAAA,IAEA22C,EAAA32C,UAAA,GACAipF,EAAAyoD,QAAA96H,QACA+/B,EAAA32C,UAAA06J,EAAAG,UAAAlkH,EAAA32C,aAEAipF,EAAAyoD,QAAAtyJ,OACAu3D,EAAA5oI,IAAA,IAEA4oI,EAAA5oI,IAAA,GACAk7K,EAAAyoD,QAAA96H,QACA+/B,EAAA5oI,IAAA2sP,EAAAG,UAAAlkH,EAAA5oI,QAGA,MAAAkqF,EAAAuqE,MAAAvqE,EAAAsb,eAAA,UACAojC,EAAA6rB,KAAAymB,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAuqE,KAAA,EAAAvqE,EAAAuqE,KAAAxkF,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAuqE,MAAAvqE,EAAAuqE,MAEA,MAAAvqE,EAAAwtE,MAAAxtE,EAAAsb,eAAA,UACAojC,EAAA8uB,KAAAwjB,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAwtE,KAAA,EAAAxtE,EAAAwtE,KAAAznF,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAwtE,MAAAxtE,EAAAwtE,MAEA,MAAAxtE,EAAAssW,OAAAtsW,EAAAsb,eAAA,WACAojC,EAAA4tT,MAAAt7Q,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAssW,MAAA,EAAAtsW,EAAAssW,MAAAvmX,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAssW,OAAAtsW,EAAAssW,OAEAtsW,EAAA0+S,UAAA1+S,EAAA0+S,SAAA34T,OAAA,CACA24D,EAAAggQ,SAAA,GACA,IAAA,IAAAtsS,EAAA,EAAAA,EAAApS,EAAA0+S,SAAA34T,SAAAqsB,EACAssC,EAAAggQ,SAAAtsS,GAAApS,EAAA0+S,SAAAtsS,GASA,OANA,MAAApS,EAAA+H,WAAA/H,EAAAsb,eAAA,eACAojC,EAAA32C,UAAAipF,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAA+H,UAAA,EAAA/H,EAAA+H,UAAAhiB,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAA+H,WAAA/H,EAAA+H,WAEA,MAAA/H,EAAAlqF,KAAAkqF,EAAAsb,eAAA,SACAojC,EAAA5oI,IAAAk7K,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAlqF,IAAA,EAAAkqF,EAAAlqF,IAAAiwE,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAlqF,KAAAkqF,EAAAlqF,KAEA4oI,GAUAumO,EAAAxmQ,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGA8hH,EAtSA,GAySA2/B,EAtnBA,GAynBAzwY,EAAAC,QAAA4nM,4DCpoBA,aAEA,MAAA+oI,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,8BAAA,CACA10P,MAAA00P,EAAA,qCAEA5+E,aAAAA,GAAA9xP,EAAA,UAEAi6b,EAAAj6b,EAAA,sBACAooY,EAAApoY,EAAA,gBACAk1U,KAAAA,GAAAl1U,EAAA,YACAwhF,OAAA04W,GAAAl6b,EAAA,sBACA67N,EAAA77N,EAAA,oBAAAJ,QA4LAE,EAAAC,QAjLA,cAAA+xP,EAMAxuP,aAAAotF,GAAAA,EAAAsnH,SAAAA,IACAhmF,QAKAvlB,KAAA/b,GAAAA,EAMA+b,KAAAurG,SAAAA,EAOAvrG,KAAA0tV,mBAAA,KAOA1tV,KAAA2tV,kBAAA,KAOA3tV,KAAA4tV,wBAAA,IAAAx+N,EAMApvH,KAAA6tV,eAAA,KAMA7tV,KAAAoqV,cAAA,KAQA0D,iBACA,OAAAzwW,QAAA2iB,KAAAoqV,eAQAlE,iBACA,OAAA7oW,QAAA2iB,KAAA6tV,gBAUAh3b,MAAA61J,GACA,IAAA1sD,KAAA6tV,eAAA,CACA,MAAA5pW,EAAA+b,KAAA/b,GAAA40I,cACA,MAAA,IAAA//H,MAAA,6BAAA7U,GAGA+b,KAAA6tV,eAAA/iX,KAAA4hF,GASA71J,oBAAA25N,GAgBA,OAXAxwH,KAAA2tV,kBAAAn9N,EACAxwH,KAAAoqV,cAAAqD,EACAhlH,EACAzoO,KAAA2tV,kBACAH,EAAAppV,UAEApE,KAAA4tV,wBAAA/9N,OACA,CAAAk+N,eAAA,IAGA/tV,KAAA64E,KAAA,kBACA74E,KAAAoqV,cASAvzb,2BAAA25N,GAEA,MAAAw9N,EAAAhuV,KAAA6tV,eACA7tV,KAAA6tV,sBAEA7tV,KAAA6tV,eAAA7oX,MAGAg7B,KAAA0tV,mBAAAl9N,EACAxwH,KAAA6tV,eAAAlyD,EAAA,CACAxwN,MAAA8iR,IAEAjuV,KAAA0tV,oBAAA1tV,KAAA0tV,mBAAAznR,OAAAjmE,KAAA0tV,mBAAAznR,QACAjmE,KAAA0tV,mBAAA,KACA1tV,KAAA6tV,eAAA,KACAI,GACAjuV,KAAA64E,KAAA,YAKA4vJ,EACAzoO,KAAA6tV,eACAL,EAAAlqV,SACAtD,KAAA0tV,oBACAxvV,OAAAzE,IACA4yH,EAAA98I,MAAAkqB,MAIAu0V,GACAhuV,KAAA64E,KAAA,mBASAhiL,QAEAmpG,KAAA6tV,gBACA7tV,KAAA6tV,eAAA7oX,MAGAg7B,KAAAoqV,eACApqV,KAAA4tV,wBAAA56S,QAGAhzC,KAAA0tV,mBAAA,KACA1tV,KAAA6tV,eAAA,KACA7tV,KAAA2tV,kBAAA,KACA3tV,KAAAoqV,cAAA,KACApqV,KAAA64E,KAAA,kMCpMA,aAOAvlL,EAAAgwG,OAAA/vG,EAAA,YACAD,EAAA8wG,OAAA7wG,EAAA,YAEAD,EAAAukP,aAAAtkP,EAAA,mBACAD,EAAA46b,aAAA36b,EAAA,mBAEAD,EAAA66b,cAAA56b,EAAA,oBACAD,EAAA86b,cAAA76b,EAAA,iMCdA,0BAEQ0vP,GAAW1vP,EAAQ,UAErB+wU,EAAa/wU,EAAQ,iBACrBskP,EAAetkP,EAAQ,mBAQ7B,SAAA+vG,EAAiB3uG,GACfA,EAAUA,GAAAA,SAEJg9T,EAAW/rP,KAAKD,IAAIhxE,EAAQg9T,UARV,MAQyCh9T,EAAQ05b,aATrD,GAUdC,EAAe35b,EAAQ45b,eAAiB12M,SAK9BvkG,gBAAkBv+D,OAC5B0uK,EAAOR,EAAOO,MAAMmuE,GACpBgN,EAAa,kBAEAlvN,KAAS16B,EAAAA,CACxBu5W,EAAa7+U,EAAMxqC,OAAQw+K,EAAMk7E,SAC3BkpD,EAAgBpkI,EAAKr+K,MAAMu5P,EAAYA,EAAa2vH,EAAa31N,OACvEgmG,GAAc2vH,EAAa31N,MAEvB8qB,EAAKx+K,OAAS05P,EAxBF,IAyBdl7E,EAAOR,EAAOO,MAAMmuE,GACpBgN,EAAa,aAGL2F,GAAaoqE,OAAO7mB,GAAe6mB,OAAOj/R,KAY1DnM,EAAOuqS,OAAS,CAACp+R,EAAO96G,WAEhB25b,GADN35b,EAAUA,GAAAA,IACmB45b,eAAiB12M,aACnCysF,EAAAA,CAAYgqH,EAAa7+U,EAAMxqC,QAASwqC,EAAMrqC,WAG3D/xE,EAAOC,QAAUgwG,EACjBjwG,EAAOC,QAAQk7b,cAhDO,EAiDtBn7b,EAAOC,QAAQm7b,kBAhDW,oGCR1B,mBAGMC,EAASn7b,EAAQ,kBACf0vP,GAAW1vP,EAAQ,UAQrBskP,EAAe,CAACnkP,EAAO03K,EAAQrmG,WAC7BonB,EAAMuiW,EAAOprV,OAAO5vG,EAAO03K,EAAQrmG,UACzC8yK,EAAalf,MAAQ+1N,EAAOprV,OAAOq1H,MAE5BvtD,GAAU63E,EAAOx5F,KAAKt9D,IAG/B94F,EAAOC,QAAUukP,6DCnBjB,0BAEQoL,GAAW1vP,EAAQ,UAErB+wU,EAAa/wU,EAAQ,iBACrB26b,EAAe36b,EAAQ,mBAKvBo7b,EAAkB,QAElBhf,EAAQ1sL,EAAOO,MAAM,GACrBorM,EAAsB,aAAtBA,EAA0C,WAE1CC,EAAAA,EAQHD,GAAmB,CAACn/U,EAAOogG,EAAQ/mF,EAAOn0H,SAIrCm6b,EAFJj/O,EAASA,EAAO6+L,OAAOj/R,OAIrBq/U,EAAan6b,EAAQo6b,cAAcl/O,SAC5Bp2G,MACHo2G,EAAO5qI,OAAStwE,EAAQq6b,sBACpBx7b,OAAOiqG,OAAOhE,EAAAA,CAAO9f,QAAS,0BAA2BtkF,KAAM,+BAEnEokG,aAAe8lI,kBACR7kJ,KAAMk0W,EAAkB/+O,OAAAA,EAAQpgG,WAAO/5G,EAAWozH,WAAOpzH,EAAWg3J,UAAMh3J,SAE/E+jG,KAGJq1V,EAAan6b,EAAQs6b,oBACjBz7b,OAAOiqG,OAAAA,IAAW3E,MAAM,yBAAA,CAA4BzjG,KAAM,iCAGlEo6G,EAAQogG,EAAOkgM,aAAap7Y,EAAQo6b,cAAcp2N,OAClD9oB,EAAAA,IAAay0H,EAET3vU,EAAQu6b,UAAUv6b,EAAQu6b,SAASJ,GAEnCA,GAAc,GACZn6b,EAAQ8sX,QAAQ9sX,EAAQ8sX,OAAOkuD,IAC1Bj1V,KAAMk0W,EAAkBn/U,MAAAA,EAAOogG,OAAAA,EAAQnjD,KAAMijR,KAG/Cj1V,KAAMk0W,EAAgBn/U,MAAAA,EAAOogG,OAAAA,EAAQ/mF,MAAAA,CAASgmU,WAAAA,GAAcpiS,UAAMh3J,KAU5Ek5b,GAAiB,CAACn/U,EAAOogG,EAAQ/mF,EAAOn0H,QAEvCk7M,EAASA,EAAO6+L,OAAOj/R,IAElBqZ,YACOhwB,MAAM,wBAGd+2G,EAAO5qI,OAAS6jD,EAAMgmU,kBACfp0W,KAAMk0W,EAAgB/+O,OAAAA,EAAQ/mF,MAAAA,EAAOrZ,WAAO/5G,EAAWg3J,UAAMh3J,oBAGhEo5b,GAAehmU,EACjB4jC,EAAOmjD,EAAOkgM,aAAa,EAAG++C,GAE9BK,EAAYt/O,EAAO5qI,OAAS6pX,EAAaj/O,EAAOkgM,aAAa++C,QAAcp5b,SACjFm6M,EAAAA,IAAay0H,EAET3vU,EAAQ8sX,QAAQ9sX,EAAQ8sX,OAAO/0N,IAC1BhyE,KAAMk0W,EAAkBn/U,MAAO0/U,EAAWt/O,OAAAA,EAAQ/mF,WAAOpzH,EAAWg3J,KAAAA,KAOjF,SAAAtoD,EAAiBzvG,SAMTosK,EAAAA,CACJguR,eANFp6b,EAAUA,GAAAA,IAMeo6b,eAAiBb,EACxCc,gBAAiBr6b,EAAQq6b,iBA1FH,EA2FtBC,cAAet6b,EAAQs6b,eAAiBN,EACxCO,SAAUv6b,EAAQu6b,SAClBztE,OAAQ9sX,EAAQ8sX,eAMFnuO,gBAAkBv+D,OAG5B+zC,EAFA+mF,EAAAA,IAAay0H,EACb5pP,EAAOk0W,kBAGMn/U,KAAS16B,EAAAA,KAEpBo6W,EAAY1/U,OAIT0/U,GAAAA,OACCvkX,EAASikX,EAAan0W,GAAMy0W,EAAWt/O,EAAQ/mF,EAAOi4C,GAE5DrmF,EAAO9P,EAAO8P,KACdy0W,EAAYvkX,EAAO6kC,MACnBogG,EAASjlI,EAAOilI,OAChB/mF,EAAQl+C,EAAOk+C,MAEXl+C,EAAO8hF,aACH9hF,EAAO8hF,UAKfmjD,EAAO5qI,aACHzxE,OAAOiqG,OAAAA,IAAW3E,MAAM,2BAAA,CAA8BzjG,KAAM,wBAYxE+uG,EAAOgrV,WAAa,CAACt+N,EAAQn8N,SACvBypO,EAAa,QAEXixN,EAAAA,EACHn5b,OAAOy6N,wBAA2B3wH,MACnC5iB,KAAMk2D,2BAEWw9E,EAAO1zI,KAAKghJ,SAClB3kI,MACU,mBAAbA,EAAIpkG,YACGy0K,MAAM,EAAMp2K,MAAO,YAExB+lG,UAGN2kI,EAAa,YAWZh6H,EAAAA,IACDzvG,GAAAA,GACJu6b,SAHenmW,IAAOq1I,EAAar1I,IAC9Bqb,CAGJirV,IAGLh8b,EAAOC,QAAU8wG,EACjB/wG,EAAOC,QAAQg8b,kBA1KW,EA2K1Bj8b,EAAOC,QAAQq7b,gBAAkBA,gGCnLjC,mBAGMD,EAASn7b,EAAQ,kBACf0vP,GAAW1vP,EAAQ,UAgBrB26b,EAAexhS,UACbtpD,EAAMsrV,EAAOtqV,OAAO6+I,EAAO8H,SAASr+F,GAAQA,GAZ9BqhJ,EAYmDrhJ,EAZnDqhJ,IAAUlxG,MAAAA,GAAAA,CAC9Br7G,IAAK,CAACrG,EAAGxC,IAEY,MAAZA,EAAK,GAAao1N,EAAGp1N,GAAQo1N,EAAGvsN,IAAIpb,SAASuS,QAHlCo1N,IAAAA,SAapBmgJ,EAAav1N,MAAQ+1N,EAAOtqV,OAAOu0H,MAC5Bv1H,GAGT/vG,EAAOC,QAAU46b,6DC1BjB,0BAEQjrM,GAAW1vP,EAAQ,UAOrB46b,EAAgB,CAACz6b,EAAO03K,EAAQrmG,MACpCqmG,EAASA,GAAU63E,EAAOiE,YAAY,IAC/BmuE,aAAa3hU,EAAOqxE,GACpBqmG,GAGT+iR,EAAcx1N,MAAQ,EAEtBtlO,EAAOC,QAAU66b,8CCjBjB,aAKA,MAAAC,EAAA1hS,IACA,GAAAA,EAAAznF,OAAA,EAAA,MAAAs6J,WAAA,4BACA,OAAA7yE,EAAAunK,YAAA,IAGAm6H,EAAAz1N,MAAA,EAEAtlO,EAAAC,QAAA86b,gCCZA,MAAA3oD,EAAAlyY,EAAA,gBACA+9N,EAAA/9N,EAAA,gBAGAg8b,EAAA,CAAAx6W,EAAA86I,EAAAl7N,IACA66b,EAAAz6W,EAAA8oB,MAAA/gB,QAAA+yI,GAAAA,EAAA,CAAA,CAAAA,OAAAA,EAAAl7N,QAAAA,KAGA66b,EAAA,CAAAz6W,EAAA6iJ,KACA7iJ,EAAA0wT,EAAA1wT,GACA6iJ,EAAAA,EAAAxtJ,KAAA,EAAAylJ,OAAAA,EAAAl7N,QAAAA,MAAA,CAAAk7N,OAAAA,EAAAl7N,QAAAA,GAAA,OAEA2+I,kBACA,IAAAm8S,EACA,MAAAC,EAAA,KACAD,GAAAA,KAGA,IAAA,MAAA5/N,OAAAA,KAAA+H,EACA/H,EAAA3pD,iBAAA,QAAAwpR,GAGA,OAAA,CACA,IAAA9kX,EACA,IACA,IAAA,MAAAilJ,OAAAA,EAAAl7N,QAAAA,KAAAijO,EACA,GAAA/H,EAAAx8E,QAAA,CACA,MAAAs8S,aAAAA,EAAAC,UAAAA,GAAAj7b,EACA,MAAA,IAAA28N,EAAAq+N,EAAAC,GAIA,MAAA58S,EAAA,IAAA+yB,SAAA,CAAAC,EAAAu5B,KACAkwP,EAAA,KACA,MAAA96b,QAAAA,GAAAijO,EAAAz5I,MAAA,EAAA0xI,OAAAA,KAAAA,EAAAx8E,WACAs8S,aAAAA,EAAAC,UAAAA,GAAAj7b,EACA4qM,EAAA,IAAA+xB,EAAAq+N,EAAAC,QAKAhlX,QAAAm7F,QAAA40L,KAAA,CAAA3nN,EAAAj+D,EAAAqI,SACAqyW,EAAA,KACA,MAAAh2V,GACA,IAAA,MAAAo2H,OAAAA,KAAA+H,EACA/H,EAAAxoD,oBAAA,QAAAqoR,GAIA,MAAAG,EAAAj4N,EAAAz5I,MAAA,EAAA0xI,OAAAA,KAAAA,EAAAx8E,UACAy8S,EAAA,YAAAr2V,EAAA3yB,MAAA+oX,EAYA,GAVAC,GAAAD,EAAAl7b,QAAAmjO,eAEA+3N,EAAAl7b,QAAAmjO,QAAA/iJ,GAIA,mBAAAA,EAAA67I,cACA77I,EAAA67I,SAGAk/N,GAAAD,EAAAl7b,QAAAo5b,cACA,OAGA,MAAAt0V,EAGA,GAAA7uB,EAAAk/F,KAAA,YACAl/F,EAAAl3E,MAGA,IAAA,MAAAm8N,OAAAA,KAAA+H,EACA/H,EAAAxoD,oBAAA,QAAAqoR,GAIAjC,IAGAsC,EAAA,CAAA5lD,EAAAt6K,EAAAl7N,IACAq7b,EAAA7lD,EAAAtsS,MAAA/gB,QAAA+yI,GAAAA,EAAA,CAAA,CAAAA,OAAAA,EAAAl7N,QAAAA,KAGAq7b,EAAA,CAAA7lD,EAAAvyK,IAAA7iJ,GACAo1T,EAAAqlD,EAAAz6W,EAAA6iJ,IAOAq4N,EAAA,CAAA5lD,EAAAzyK,KAAA,CACAuyK,KAAA6lD,EAAA3lD,EAAAF,KAAAvyK,GACA7iJ,OAAAy6W,EAAAnlD,EAAAt1T,OAAA6iJ,KAGAvkO,EAAAC,QAAAi8b,EACAl8b,EAAAC,QAAAg+N,WAAAA,EACAj+N,EAAAC,QAAAyhF,OAAAw6W,EACAl8b,EAAAC,QAAA62Y,KAAA4lD,EACA18b,EAAAC,QAAA6wF,UAAA4rW,EACA18b,EAAAC,QAAA+2Y,OAdA,CAAAA,EAAAx6K,EAAAl7N,IACAs7b,EAAA5lD,EAAAxsS,MAAA/gB,QAAA+yI,GAAAA,EAAA,CAAA,CAAAA,OAAAA,EAAAl7N,QAAAA,gFCvFAtB,EAAAC,QAAA,SAAAurG,GACA,GAAAA,EAAA,CACA,GAAA,mBAAAA,EAAA3oG,OAAAu0J,UACA,OAAA5rD,EAAA3oG,OAAAu0J,YAEA,GAAA,mBAAA5rD,EAAA3oG,OAAAy6N,eACA,OAAA9xH,EAAA3oG,OAAAy6N,iBAEA,GAAA,mBAAA9xH,EAAAzhB,KACA,OAAAyhB,EAGA,MAAA,IAAA/F,MAAA,0ECfAzlG,EAAAC,QAAA,cAAAwlG,MACAjiG,YAAA8iF,EAAAtkF,GACAkwH,MAAA5rC,GAAA,6BACAqmB,KAAAl5B,KAAA,UACAk5B,KAAA3qG,KAAAA,GAAA,4CCJA,aA4BA/B,EAAAu1b,gBAtBA,CASAK,WAAA,aAWAuC,aAAA,8CC1BA,aAGA,MAAA18K,EAAAx7Q,EAAA,kCACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BACAw6N,EAAAx6N,EAAA,WACA+6N,EAAA/6N,EAAA,eAmIAF,EAAAC,QAAA,CACA+4b,YAtHA,IACAt9K,EAAA,GAsHAw8K,MA3GA,CAAA9hS,EAAA+hS,KACA,MAAAvuI,EAAAlvF,EAAA0M,oBAAAhxE,GAAAxlE,GACAsnW,EAAA,IAAA9yN,WAAAwkF,EAAAh4O,OAAAumX,EAAAvmX,QAGA,OAFAsmX,EAAA9pW,IAAAw7N,EAAA,GACAsuI,EAAA9pW,IAAA+pW,EAAAvuI,EAAAh4O,QACAsmX,GAuGAG,YA7FAh/R,GAAA4hE,EAAAhrH,OAAAopD,EAAA,YA8FAwjS,SAnFA,CAAArpX,EAAAyS,KACA,IAAA62W,EAKAA,EAJAtyV,MAAA/gB,QAAAxD,GAIAqgB,GAAArgB,EAAA9N,QAAAmuB,IAAA,EAKAA,GAAArgB,EAAAyF,IAAA4a,GAGA,IAAA,MAAAA,KAAA9yB,EACA,GAAAspX,EAAAx2V,GACA,OAAA,EAIA,OAAA,GAgEA0vV,YArDA+G,GACAvyV,MAAA/gB,QAAAszW,GAIAA,EAHA,CAAAA,GAoDAlF,sBAtCA,CAAAvxW,EAAA+hJ,KAGA,MAAAx8I,EAAA1rF,OAAAiqG,OAAA,GAAA9jB,GAOA,OANAA,EAAA8vE,gBAAAgvE,aACAv5I,EAAAuqE,KAAA4uE,EAAA1+I,EAAA8vE,KAAA,cAEAiyE,IACAx8I,EAAAioW,aAAAzrN,GAEAx8I,GA6BAgmW,uBApBAvrW,IAGA,MAAAuF,EAAA1rF,OAAAiqG,OAAA,GAAA9jB,GAOA,MANA,iBAAAA,EAAA8vE,OACAvqE,EAAAuqE,KAAA2uE,EAAAz+I,EAAA8vE,KAAA,cAEA,iBAAA9vE,EAAA+yE,OACAxtE,EAAAwtE,KAAA0rE,EAAAz+I,EAAA+yE,OAEAxtE,kLCvIA,aAEA,MAAA6uI,EAAAx6N,EAAA,YACAuwY,IAAAA,GAAAvwY,EAAA,SACAqoO,EAAAroO,EAAA,sBAEA88b,EADA98b,EAAA,0BACA6kO,CAAA,kBAkEA9kF,eAAAg9S,EAAA32W,GAEA,IAAAA,EAAA8vE,KACA,MAAA,IAAA3wD,MAAA,uDAGA,MAAA2wD,EAAAskE,EAAA2M,cAAA/gJ,EAAA8vE,MAEA,GAAA9vE,EAAA3kF,IAAA,CACA,MAAAu7b,QAAAxiO,EAAA+M,iBAAAnhJ,EAAA3kF,KAGA,GAAAu7b,EAAAv2N,OAAAvwE,GAAA,OAAA8mS,EAAA/3N,OAEA,MAAA,IAAA1/H,MAAA,4CACA,GAAA2wD,EAAA+uE,OACA,OAAA/uE,EAAA+uE,OAEA,MAAA,IAAA1/H,MAAA,uDASAzlG,EAAAC,QAAA,CACAg9b,iBAAAA,EACAxH,YAlFAx1S,eAAAooF,EAAA/hJ,GAEA,MAAAg/I,EAAAiD,EAAA,CACAy0N,EACAvsD,EAAA3/B,QAAA7gQ,OAAA3pB,GAAA8/I,WAGAxyI,QAAAy0I,EAAAnD,QAAA+vB,KAAA3vB,GAEA,MAAA,IACAh/I,EACAsN,UAAAA,EACAjyF,IAAA0mO,EAAAlD,OAAAG,QAuEA03N,WAAAA,EACAtH,gBA9DAz1S,eAAA35D,GACA,IAAAA,EAAAsN,UACA,MAAA,IAAA6R,MAAA,mDAIA,MAAA6/H,EAAAiD,EAAA,CACAy0N,EACAvsD,EAAA3/B,QAAA7gQ,OAAA,IACA3pB,EAEA8vE,KAAAskE,EAAA2M,cAAA/gJ,EAAA8vE,MAAA6vE,UACAryI,eAAAvxF,EACAV,SAAAU,IACA+jO,WAOA,aAHA62N,EAAA32W,IAGAg8L,OAAAh9C,EAAAh/I,EAAAsN,2IC9DA,aACAzzF,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAA2ub,kBAAA,EACA,MAAA1C,EAAAhsb,EAAA,WAyHAD,EAAA2ub,aAxHA,MAQAprb,YAAA6qb,EAAA3ub,EAAAy9b,GAIAxwV,KAAA8qV,KAAA,IAAA9nW,IACAgd,KAAAywV,OAAA,IAAAztW,IAIAgd,KAAAjtG,QAAA,GACA,IAAA,IAAAo0E,EAAA,EAAAA,EAAAp0E,EAAAo0E,IACA64B,KAAAjtG,QAAAo0E,GAAA,GAKA64B,KAAA0hV,OAAAA,EAIA1hV,KAAAwwV,QAAAA,EAQA35b,IAAA44E,GACA,MAAAw0W,EAAAjkV,KAAAoiV,SAAA3yW,GACAy0W,EAAA3E,EAAA4E,kBAAAF,GACAjkV,KAAA8qV,KAAArpW,IAAAyiW,EAAAz0W,GACAuwB,KAAAjtG,QAAA,GAAA+3E,KAAA,CAAAm5W,MAAAA,EAAAsD,OAAA93W,EAAAmuT,WAOA/mY,SAAA44E,GACA,OAAAuwB,KAAAwwV,QAAA/gX,GAQA54E,IAAAotb,GACA,OAAAjkV,KAAA8qV,KAAAtpW,IAAA+9V,EAAA4E,kBAAAF,IAWAptb,WAAAotb,EAAA/8W,GACA,MAAAg9W,EAAA3E,EAAA4E,kBAAAF,GACAx0W,EAAAuwB,KAAA8qV,KAAAtpW,IAAA0iW,GACA,IAAAz0W,EACA,MAAA,MAAA/5E,EAAA,GAEA,IAAA+6b,EAAAzwV,KAAAywV,OAAAjvW,IAAA0iW,GACAuM,IACAA,EAAA,IAAAztW,IACAgd,KAAAywV,OAAAhvW,IAAAyiW,EAAAuM,IAEA,MAAAltW,GAAAktW,EAAAjvW,IAAAta,IAAA,GAAA,EAEA,OADAupX,EAAAhvW,IAAAva,EAAAqc,GACA,CAAA9T,EAAA8T,GASA1sF,aAAAwnY,GACA,MAAAqyD,EAAA,GACA,IAAA,IAAAvpX,EAAA,EAAAA,EAAA64B,KAAA0hV,OAAAv6W,IACA64B,KAAAjtG,QAAAo0E,GAAA/yE,SAAA2hL,IACA,IAAA,MAAAh3B,KAAAg3B,EAAAwxQ,OACA,GAAAxoS,IAAAs/O,EAAA,CACAqyD,EAAA5lX,KAAAirG,EAAAkuQ,OACA,UAKA,OAAAyM,EAOA75b,QACAmpG,KAAAjtG,QAAAitG,KAAAjtG,QAAAkyE,OAAA,GACA7wE,SAAA2hL,IACA,MAAAmuQ,EAAA3E,EAAA4E,kBAAApuQ,EAAAkuQ,OACAjkV,KAAA8qV,KAAArnW,OAAAygW,GACAlkV,KAAAywV,OAAAhtW,OAAAygW,MAEAlkV,KAAAjtG,QAAAkrF,MACA+hB,KAAAjtG,QAAA+lF,QAAA,qDCzHA,aACA,IAAA6lW,EAAA3+U,MAAAA,KAAA2+U,kBAAAnrb,OAAAU,OAAA,SAAAg8K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACAb,OAAAC,eAAAy8K,EAAA2hH,EAAA,CAAA9yL,YAAA,EAAAvd,IAAA,WAAA,OAAAtC,EAAA7qF,OACA,SAAA67K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACA67K,EAAA2hH,GAAA3yM,EAAA7qF,KAEAs8b,EAAA3wV,MAAAA,KAAA2wV,cAAA,SAAAzxW,EAAA5rF,GACA,IAAA,IAAA4zE,KAAAgY,EAAA,YAAAhY,GAAA1zE,OAAAmqG,UAAAnD,eAAAoD,KAAAtqG,EAAA4zE,IAAAy3W,EAAArrb,EAAA4rF,EAAAhY,IAEA1zE,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAi9b,EAAAp9b,EAAA,uBAAAD,GACAq9b,EAAAp9b,EAAA,aAAAD,GACAq9b,EAAAp9b,EAAA,yBAAAD,GACAq9b,EAAAp9b,EAAA,uBAAAD,gJCfA,aACAE,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAwwb,qBAAA,EAcAxwb,EAAAwwb,gBAPA,SAAAgH,EAAA,GAAAnJ,EAAA,IACA,MAAA,CACAnkD,cAAA,GACAstD,KAAAA,EACAnJ,QAAAnub,OAAAiqG,OAAA,CAAA6lV,MAAA,GAAAD,MAAA,GAAAK,MAAA,GAAAD,MAAA,IAAA9B,mCCbA,aACAnub,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAA+vZ,aAAA,EAwBA/vZ,EAAA+vZ,QAfA,SAAAzmT,GACA,GAAAA,EAAA33B,QAAA,EACA,OAAA23B,EAKA,IAAA,IAAAz1B,EAAA,EAAAA,EAAAy1B,EAAA33B,OAAAkC,IAAA,CACA,MAAAmqB,EAHA1rB,KAAA6nC,MAAA7nC,KAAAwoC,SAAAxoC,KAAA6nC,MAAA7Q,EAAA33B,SAIAm2B,EAAAwB,EAAAz1B,GACAy1B,EAAAz1B,GAAAy1B,EAAAtL,GACAsL,EAAAtL,GAAA8J,EAEA,OAAAwB,iCCxBA,aACAppG,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAA40b,uBAAA,EACA,MAAA0I,EAAAr9b,EAAA,gBAIAD,EAAA40b,kBAHA,SAAA38O,GACA,OAAAA,IAAAqlP,EAAA7Q,gBAAAx0O,IAAAqlP,EAAA9Q,oECLA,aACAtsb,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAu9b,2BAAAv9b,EAAAw9b,2BAAAx9b,EAAAy9b,kBAAAz9b,EAAA09b,2BAAA19b,EAAAmxb,0BAAAnxb,EAAAoxb,wBAAApxb,EAAAiyb,6BAAAjyb,EAAA29b,iCAAA39b,EAAA49b,iCAAA59b,EAAAszb,mCAAAtzb,EAAA0yb,4BAAA1yb,EAAA69b,2BAAA79b,EAAA89b,+BAAA99b,EAAA+9b,oBAAA/9b,EAAAyyb,2BAAAzyb,EAAAkyb,sBAAAlyb,EAAA8yb,oBAAA9yb,EAAAg+b,mBAAAh+b,EAAAi+b,2BAAAj+b,EAAAk+b,+BAAAl+b,EAAA2xb,8BAAA3xb,EAAA80b,sBAAA90b,EAAAytb,eAAAztb,EAAA4ub,uBAAA5ub,EAAA6ub,uBAAA7ub,EAAAutb,cAAAvtb,EAAAqtb,gBAAArtb,EAAAmtb,aAAAntb,EAAAitb,aAAAjtb,EAAA+sb,WAAA/sb,EAAAwsb,eAAAxsb,EAAAysb,eAAAzsb,EAAA8tb,WAAA9tb,EAAAsoW,OAAAtoW,EAAAohW,YAAA,EACAphW,EAAAohW,OAAA,IACAphW,EAAAsoW,OAAA,GAAAtoW,EAAAohW,OAEAphW,EAAA8tb,WAAA,kBAKA9tb,EAAAysb,eAAA,iBAMAzsb,EAAAwsb,eAAA,iBAOAxsb,EAAA+sb,WAAA,EAMA/sb,EAAAitb,aAAA,EAKAjtb,EAAAmtb,aAAA,GAMAntb,EAAAqtb,gBAAA,EASArtb,EAAAutb,cAAA,EAMAvtb,EAAA6ub,uBAAA,EAWA7ub,EAAA4ub,uBAAA,EAOA5ub,EAAAytb,eAAA,EAMAztb,EAAA80b,sBAAA,IAMA90b,EAAA2xb,8BAAA,EAMA3xb,EAAAk+b,+BAAA,IAIAl+b,EAAAi+b,2BAAAj+b,EAAAohW,OAMAphW,EAAAg+b,mBAAAh+b,EAAAsoW,OAOAtoW,EAAA8yb,oBAAA,GASA9yb,EAAAkyb,sBAAAlyb,EAAAsoW,OAKAtoW,EAAAyyb,2BAAA,GAIAzyb,EAAA+9b,oBAAA,EAIA/9b,EAAA89b,+BAAA,IAIA99b,EAAA69b,2BAAA,GAAA79b,EAAAohW,OAKAphW,EAAA0yb,4BAAA,IAIA1yb,EAAAszb,mCAAAtzb,EAAAohW,OAOAphW,EAAA49b,iCAAA,GAIA59b,EAAA29b,iCAAA,EAKA39b,EAAAiyb,6BAAA,GAAAjyb,EAAAohW,OAQAphW,EAAAoxb,wBAAA,IAIApxb,EAAAmxb,0BAAA,GAMAnxb,EAAA09b,2BAAA,EAAA19b,EAAAohW,OACAphW,EAAAy9b,kBAAA,KACAz9b,EAAAw9b,2BAAA,6BACAx9b,EAAAu9b,2BAAA,2DCrLA,aACAr9b,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAA6wb,uBAAA,EAIA,MAAA/lV,EAAA7qG,EAAA,yBAIAD,EAAA6wb,kBAHA,SAAAoH,GACA,OAAAntV,EAAAmtV,EAAA,4ECPkBzpR,EAAAA,EAQT,SAASw/E,GACd,iBAGIC,EAAUD,EAAUE,OAAQC,EAAUH,EAAUI,OAAQC,EAAQL,EAAU1hJ,KAG1Es7F,EAAQomD,EAAUM,MAAM,UAAeN,EAAUM,MAAM,QAAA,WAE3D1mD,EAAM4oM,IAAAA,WAmBF,SAAAA,EAAa58T,MACT84B,KAAKw9R,cAAAA,GACLx9R,KAAK8qV,KAAAA,GACD5jX,EAAAA,IAAAA,IACS26K,EAAKruP,OAAOW,KAAK+yE,GAAIC,EAAI,EAAGA,EAAI06K,EAAG58K,SAAUkC,EAClC,MAAZD,EAAE26K,EAAG16K,MACL64B,KAAK6hJ,EAAG16K,IAAMD,EAAE26K,EAAG16K,SA4B/BsqX,SAnBJ3tD,EAAInmS,UAAU6/R,cAAgB77I,EAAM4D,WAQpCu+I,EAAInmS,UAAUmtV,KAAOnpM,EAAM4D,WAQ3Bu+I,EAAInmS,UAAUgkV,QAAU,KAWxBnub,OAAOC,eAAeqwY,EAAInmS,UAAW,WAAA,CACjCnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,YACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAY3B3tD,EAAIxgS,OAAS,SAAgBpkB,EAAGulI,MACvBA,IACDA,EAAIg9B,EAAQvtP,UACO,MAAnBgrF,EAAEs+S,eAAyBt+S,EAAEs+S,cAAcv4T,eAClCkC,EAAI,EAAGA,EAAI+X,EAAEs+S,cAAcv4T,SAAUkC,EAC1C+zH,EAAM4oM,IAAIypD,QAAQjqV,OAAOpkB,EAAEs+S,cAAcr2T,GAAIs9I,EAAEs9B,OAAO,IAAI6C,QAAQC,YAE5D,MAAV3lK,EAAE4rW,MAAgB5rW,EAAE4rW,KAAK7lX,WAChBkC,EAAI,EAAGA,EAAI+X,EAAE4rW,KAAK7lX,SAAUkC,EACjC+zH,EAAM4oM,IAAI3/B,QAAQ7gQ,OAAOpkB,EAAE4rW,KAAK3jX,GAAIs9I,EAAEs9B,OAAO,IAAI6C,QAAQC,gBAEhD,MAAb3lK,EAAEyiW,SAAmBnub,OAAOgnG,eAAeoD,KAAK1e,EAAG,YACnDg8G,EAAM4oM,IAAI4tD,eAAepuV,OAAOpkB,EAAEyiW,QAASl9N,EAAEs9B,OAAO,IAAI6C,QAAQC,SAC7DpgC,GAcXq/K,EAAI1/R,OAAS,SAAgB4J,EAAGjlB,GACtBilB,aAAauzI,IACfvzI,EAAIuzI,EAAQrtP,OAAO85G,YACnBvhC,OAAU/2E,IAANqzF,EAAkBilB,EAAE5K,IAAM4K,EAAEp2B,IAAMmR,EAAG7J,EAAAA,IAAQg8G,EAAM4oM,IACpD91R,EAAEp2B,IAAMnL,GAAAA,KACPsyE,EAAI/wC,EAAE+zI,gBACFhjG,IAAM,QACT,EACK7/D,EAAEs+S,eAAiBt+S,EAAEs+S,cAAcv4T,SACrCia,EAAEs+S,cAAAA,IACNt+S,EAAEs+S,cAAc1yT,KAAKowH,EAAM4oM,IAAIypD,QAAQnpV,OAAO4J,EAAGA,EAAE+zI,sBAElD,EACK7iK,EAAE4rW,MAAQ5rW,EAAE4rW,KAAK7lX,SACnBia,EAAE4rW,KAAAA,IACN5rW,EAAE4rW,KAAKhgX,KAAKowH,EAAM4oM,IAAI3/B,QAAQ//P,OAAO4J,EAAGA,EAAE+zI,sBAEzC,EACD7iK,EAAEyiW,QAAUzmP,EAAM4oM,IAAI4tD,eAAettV,OAAO4J,EAAGA,EAAE+zI,wBAGjD/zI,EAAEi0I,SAAa,EAAJljG,WAIZ7/D,GAWX4kT,EAAI3hJ,WAAa,SAAoBvkH,MAC7BA,aAAas9D,EAAM4oM,IAAAA,OACZlmQ,MACP1+C,EAAAA,IAAQg8G,EAAM4oM,OACdlmQ,EAAE4/P,cAAAA,KACG3/R,MAAM/gB,QAAQ8gD,EAAE4/P,eAAAA,MACXz4R,UAAU,sCACpB7lB,EAAEs+S,cAAAA,WACOr2T,EAAI,EAAGA,EAAIy2D,EAAE4/P,cAAcv4T,SAAUkC,EAAAA,IACR,iBAAvBy2D,EAAE4/P,cAAcr2T,GAAO,MACxB49B,UAAU,uCACpB7lB,EAAEs+S,cAAcr2T,GAAK+zH,EAAM4oM,IAAIypD,QAAQprM,WAAWvkH,EAAE4/P,cAAcr2T,QAGtEy2D,EAAEktT,KAAAA,KACGjtV,MAAM/gB,QAAQ8gD,EAAEktT,MAAAA,MACX/lV,UAAU,iCACpB7lB,EAAE4rW,KAAAA,GACO3jX,EAAI,EAAGA,EAAIy2D,EAAEktT,KAAK7lX,SAAUkC,EAAAA,IACR,iBAAdy2D,EAAEktT,KAAK3jX,GAAO,MACf49B,UAAU,8BACpB7lB,EAAE4rW,KAAK3jX,GAAK+zH,EAAM4oM,IAAI3/B,QAAQhiH,WAAWvkH,EAAEktT,KAAK3jX,QAGvC,MAAby2D,EAAE+jT,QAAW,IACY,iBAAd/jT,EAAE+jT,QAAY,MACf58U,UAAU,iCACpB7lB,EAAEyiW,QAAUzmP,EAAM4oM,IAAI4tD,eAAevvM,WAAWvkH,EAAE+jT,gBAE/CziW,GAYX4kT,EAAI1hJ,SAAW,SAAkBljK,EAAGgxF,GAC3BA,IACDA,EAAAA,QACAtyC,EAAAA,OACAsyC,EAAEkmE,QAAUlmE,EAAEuiC,YACd70E,EAAE4/P,cAAAA,GACF5/P,EAAEktT,KAAAA,IAEF5rW,EAAEs+S,eAAiBt+S,EAAEs+S,cAAcv4T,OAAAA,CACnC24D,EAAE4/P,cAAAA,WACOlsS,EAAI,EAAGA,EAAIpS,EAAEs+S,cAAcv4T,SAAUqsB,EAC1CssC,EAAE4/P,cAAclsS,GAAK4pG,EAAM4oM,IAAIypD,QAAQnrM,SAASljK,EAAEs+S,cAAclsS,GAAI4+E,MAGxEhxF,EAAE4rW,MAAQ5rW,EAAE4rW,KAAK7lX,WACjB24D,EAAEktT,KAAAA,GACOx5V,EAAI,EAAGA,EAAIpS,EAAE4rW,KAAK7lX,SAAUqsB,EACjCssC,EAAEktT,KAAKx5V,GAAK4pG,EAAM4oM,IAAI3/B,QAAQ/hH,SAASljK,EAAE4rW,KAAKx5V,GAAI4+E,UAGzC,MAAbhxF,EAAEyiW,SAAmBziW,EAAEsb,eAAe,aACtCojC,EAAE+jT,QAAUzmP,EAAM4oM,IAAI4tD,eAAetvM,SAASljK,EAAEyiW,QAASzxQ,GACrDA,EAAEyhR,SACF/zT,EAAEg0T,SAAW,YAEdh0T,GAUXkmQ,EAAInmS,UAAUvW,OAAS,kBACZ4Y,KAAK2M,YAAYy1I,SAASpiJ,KAAMshJ,EAAU1hJ,KAAKyiJ,gBAG1DyhJ,EAAIypD,QAAAA,WAkBA,SAAAA,EAAiBrmX,MACTA,EAAAA,IAAAA,IACS26K,EAAKruP,OAAOW,KAAK+yE,GAAIC,EAAI,EAAGA,EAAI06K,EAAG58K,SAAUkC,EAClC,MAAZD,EAAE26K,EAAG16K,MACL64B,KAAK6hJ,EAAG16K,IAAMD,EAAE26K,EAAG16K,SAoB/BsqX,SAXJlE,EAAQ5vV,UAAUggS,UAAY,KAQ9B4vD,EAAQ5vV,UAAUgnV,QAAU,KAW5Bnxb,OAAOC,eAAe85b,EAAQ5vV,UAAW,aAAA,CACrCnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,cACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAS3Bj+b,OAAOC,eAAe85b,EAAQ5vV,UAAW,WAAA,CACrCnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,YACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAY3BlE,EAAQjqV,OAAS,SAAgBpkB,EAAGulI,UAC3BA,IACDA,EAAIg9B,EAAQvtP,UACG,MAAfgrF,EAAEy+S,WAAqBnqY,OAAOgnG,eAAeoD,KAAK1e,EAAG,cACrDulI,EAAEs9B,OAAO,GAAGkC,KAAK/kK,EAAEy+S,WACN,MAAbz+S,EAAEylW,SAAmBnxb,OAAOgnG,eAAeoD,KAAK1e,EAAG,YACnDulI,EAAEs9B,OAAO,IAAIpmJ,OAAOzc,EAAEylW,SACnBlgO,GAcX8oO,EAAQnpV,OAAS,SAAgB4J,EAAGjlB,GAC1BilB,aAAauzI,IACfvzI,EAAIuzI,EAAQrtP,OAAO85G,YACnBvhC,OAAU/2E,IAANqzF,EAAkBilB,EAAE5K,IAAM4K,EAAEp2B,IAAMmR,EAAG7J,EAAAA,IAAQg8G,EAAM4oM,IAAIypD,QACxDv/U,EAAEp2B,IAAMnL,GAAAA,KACPsyE,EAAI/wC,EAAE+zI,gBACFhjG,IAAM,QACT,EACD7/D,EAAEy+S,UAAY3vR,EAAEi2I,kBAEf,EACD/kK,EAAEylW,QAAU32U,EAAErS,uBAGdqS,EAAEi0I,SAAa,EAAJljG,WAIZ7/D,GAWXquW,EAAQprM,WAAa,SAAoBvkH,MACjCA,aAAas9D,EAAM4oM,IAAIypD,QAAAA,OAChB3vT,MACP1+C,EAAAA,IAAQg8G,EAAM4oM,IAAIypD,eACH,MAAf3vT,EAAE+/P,YACFz+S,EAAEy+S,UAAYtgT,QAAQugD,EAAE+/P,YAEX,MAAb//P,EAAE+mT,UACFzlW,EAAEylW,QAAUt+W,OAAOu3D,EAAE+mT,UAElBzlW,GAYXquW,EAAQnrM,SAAW,SAAkBljK,EAAGgxF,GAC/BA,IACDA,EAAAA,QACAtyC,EAAAA,UACe,MAAf1+C,EAAEy+S,WAAqBz+S,EAAEsb,eAAe,eACxCojC,EAAE+/P,UAAYz+S,EAAEy+S,UACZztN,EAAEyhR,SACF/zT,EAAEi0T,WAAa,cAEN,MAAb3yW,EAAEylW,SAAmBzlW,EAAEsb,eAAe,aACtCojC,EAAE+mT,QAAUzlW,EAAEylW,QACVz0Q,EAAEyhR,SACF/zT,EAAEk0T,SAAW,YAEdl0T,GAUX2vT,EAAQ5vV,UAAUvW,OAAS,kBAChB4Y,KAAK2M,YAAYy1I,SAASpiJ,KAAMshJ,EAAU1hJ,KAAKyiJ,gBAGnDkrM,EA/KPA,GAkLJzpD,EAAI3/B,QAAAA,WAsBA,SAAAA,EAAiBj9R,MACb84B,KAAK49R,SAAAA,GACD12T,EAAAA,IAAAA,IACS26K,EAAKruP,OAAOW,KAAK+yE,GAAIC,EAAI,EAAGA,EAAI06K,EAAG58K,SAAUkC,EAClC,MAAZD,EAAE26K,EAAG16K,MACL64B,KAAK6hJ,EAAG16K,IAAMD,EAAE26K,EAAG16K,SAoD/BsqX,SA3CJttF,EAAQxmQ,UAAU8rD,KAAO,KAQzB06M,EAAQxmQ,UAAU+uD,KAAO,KAQzBy3M,EAAQxmQ,UAAU6tV,MAAQ,KAQ1BrnF,EAAQxmQ,UAAUigS,SAAWj8I,EAAM4D,WAQnC4+G,EAAQxmQ,UAAU1W,UAAY,KAQ9Bk9Q,EAAQxmQ,UAAU3oG,IAAM,KAWxBxB,OAAOC,eAAe0wW,EAAQxmQ,UAAW,QAAA,CACrCnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,SACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAS3Bj+b,OAAOC,eAAe0wW,EAAQxmQ,UAAW,QAAA,CACrCnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,SACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAS3Bj+b,OAAOC,eAAe0wW,EAAQxmQ,UAAW,SAAA,CACrCnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,UACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAS3Bj+b,OAAOC,eAAe0wW,EAAQxmQ,UAAW,aAAA,CACrCnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,cACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAS3Bj+b,OAAOC,eAAe0wW,EAAQxmQ,UAAW,OAAA,CACrCnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,QACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAY3BttF,EAAQ7gQ,OAAS,SAAgBpkB,EAAGulI,MAC3BA,IACDA,EAAIg9B,EAAQvtP,UACF,MAAVgrF,EAAEuqE,MAAgBj2J,OAAOgnG,eAAeoD,KAAK1e,EAAG,SAChDulI,EAAEs9B,OAAO,IAAIppB,MAAMz5I,EAAEuqE,MACX,MAAVvqE,EAAEwtE,MAAgBl5J,OAAOgnG,eAAeoD,KAAK1e,EAAG,SAChDulI,EAAEs9B,OAAO,IAAIppB,MAAMz5I,EAAEwtE,MACV,MAAXxtE,EAAEssW,OAAiBh4b,OAAOgnG,eAAeoD,KAAK1e,EAAG,UACjDulI,EAAEs9B,OAAO,IAAIppB,MAAMz5I,EAAEssW,OACP,MAAdtsW,EAAE0+S,UAAoB1+S,EAAE0+S,SAAS34T,eACxBkC,EAAI,EAAGA,EAAI+X,EAAE0+S,SAAS34T,SAAUkC,EACrCs9I,EAAEs9B,OAAO,IAAIpmJ,OAAOzc,EAAE0+S,SAASz2T,WAEpB,MAAf+X,EAAE+H,WAAqBzzF,OAAOgnG,eAAeoD,KAAK1e,EAAG,cACrDulI,EAAEs9B,OAAO,IAAIppB,MAAMz5I,EAAE+H,WACZ,MAAT/H,EAAElqF,KAAexB,OAAOgnG,eAAeoD,KAAK1e,EAAG,QAC/CulI,EAAEs9B,OAAO,IAAIppB,MAAMz5I,EAAElqF,KAClByvN,GAcX0/I,EAAQ//P,OAAS,SAAgB4J,EAAGjlB,GAC1BilB,aAAauzI,IACfvzI,EAAIuzI,EAAQrtP,OAAO85G,YACnBvhC,OAAU/2E,IAANqzF,EAAkBilB,EAAE5K,IAAM4K,EAAEp2B,IAAMmR,EAAG7J,EAAAA,IAAQg8G,EAAM4oM,IAAI3/B,QACxDn2P,EAAEp2B,IAAMnL,GAAAA,KACPsyE,EAAI/wC,EAAE+zI,gBACFhjG,IAAM,QACT,EACD7/D,EAAEuqE,KAAOz7C,EAAE2qH,mBAEV,EACDz5I,EAAEwtE,KAAO1+C,EAAE2qH,mBAEV,EACDz5I,EAAEssW,MAAQx9U,EAAE2qH,mBAEX,EACKz5I,EAAE0+S,UAAY1+S,EAAE0+S,SAAS34T,SAC3Bia,EAAE0+S,SAAAA,IACN1+S,EAAE0+S,SAAS9yT,KAAKkjC,EAAErS,qBAEjB,EACDzc,EAAE+H,UAAY+mB,EAAE2qH,mBAEf,EACDz5I,EAAElqF,IAAMg5G,EAAE2qH,sBAGV3qH,EAAEi0I,SAAa,EAAJljG,WAIZ7/D,GAWXilR,EAAQhiH,WAAa,SAAoBvkH,MACjCA,aAAas9D,EAAM4oM,IAAI3/B,QAAAA,OAChBvmO,MACP1+C,EAAAA,IAAQg8G,EAAM4oM,IAAI3/B,WACR,MAAVvmO,EAAE6rB,OACoB,iBAAX7rB,EAAE6rB,KACTk4F,EAAM99I,OAAOO,OAAOw5B,EAAE6rB,KAAMvqE,EAAEuqE,KAAOk4F,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAO24D,EAAE6rB,OAAQ,GAC9E7rB,EAAE6rB,KAAKxkF,SACZia,EAAEuqE,KAAO7rB,EAAE6rB,OAEL,MAAV7rB,EAAE8uB,OACoB,iBAAX9uB,EAAE8uB,KACTi1F,EAAM99I,OAAOO,OAAOw5B,EAAE8uB,KAAMxtE,EAAEwtE,KAAOi1F,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAO24D,EAAE8uB,OAAQ,GAC9E9uB,EAAE8uB,KAAKznF,SACZia,EAAEwtE,KAAO9uB,EAAE8uB,OAEJ,MAAX9uB,EAAE4tT,QACqB,iBAAZ5tT,EAAE4tT,MACT7pM,EAAM99I,OAAOO,OAAOw5B,EAAE4tT,MAAOtsW,EAAEssW,MAAQ7pM,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAO24D,EAAE4tT,QAAS,GACjF5tT,EAAE4tT,MAAMvmX,SACbia,EAAEssW,MAAQ5tT,EAAE4tT,QAEhB5tT,EAAEggQ,SAAAA,KACG//R,MAAM/gB,QAAQ8gD,EAAEggQ,UAAAA,MACX74R,UAAU,yCACpB7lB,EAAE0+S,SAAAA,WACOz2T,EAAI,EAAGA,EAAIy2D,EAAEggQ,SAAS34T,SAAUkC,EACrC+X,EAAE0+S,SAASz2T,GAAKd,OAAOu3D,EAAEggQ,SAASz2T,WAGvB,MAAfy2D,EAAE32C,YACyB,iBAAhB22C,EAAE32C,UACT06J,EAAM99I,OAAOO,OAAOw5B,EAAE32C,UAAW/H,EAAE+H,UAAY06J,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAO24D,EAAE32C,YAAa,GAC7F22C,EAAE32C,UAAUhiB,SACjBia,EAAE+H,UAAY22C,EAAE32C,YAEX,MAAT22C,EAAE5oI,MACmB,iBAAV4oI,EAAE5oI,IACT2sP,EAAM99I,OAAOO,OAAOw5B,EAAE5oI,IAAKkqF,EAAElqF,IAAM2sP,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAO24D,EAAE5oI,MAAO,GAC3E4oI,EAAE5oI,IAAIiwE,SACXia,EAAElqF,IAAM4oI,EAAE5oI,MAEXkqF,GAYXilR,EAAQ/hH,SAAW,SAAkBljK,EAAGgxF,GAC/BA,IACDA,EAAAA,QACAtyC,EAAAA,OACAsyC,EAAEkmE,QAAUlmE,EAAEuiC,YACd70E,EAAEggQ,SAAAA,IAEQ,MAAV1+S,EAAEuqE,MAAgBvqE,EAAEsb,eAAe,UACnCojC,EAAE6rB,KAAOymB,EAAEyoD,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAOpkB,EAAEuqE,KAAM,EAAGvqE,EAAEuqE,KAAKxkF,QAAUirG,EAAEyoD,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAK1e,EAAEuqE,MAAQvqE,EAAEuqE,KACrIymB,EAAEyhR,SACF/zT,EAAE6iF,MAAQ,SAEJ,MAAVvhI,EAAEwtE,MAAgBxtE,EAAEsb,eAAe,UACnCojC,EAAE8uB,KAAOwjB,EAAEyoD,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAOpkB,EAAEwtE,KAAM,EAAGxtE,EAAEwtE,KAAKznF,QAAUirG,EAAEyoD,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAK1e,EAAEwtE,MAAQxtE,EAAEwtE,KACrIwjB,EAAEyhR,SACF/zT,EAAE6uP,MAAQ,SAEH,MAAXvtS,EAAEssW,OAAiBtsW,EAAEsb,eAAe,WACpCojC,EAAE4tT,MAAQt7Q,EAAEyoD,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAOpkB,EAAEssW,MAAO,EAAGtsW,EAAEssW,MAAMvmX,QAAUirG,EAAEyoD,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAK1e,EAAEssW,OAAStsW,EAAEssW,MACzIt7Q,EAAEyhR,SACF/zT,EAAEm0T,OAAS,UAEf7yW,EAAE0+S,UAAY1+S,EAAE0+S,SAAS34T,OAAAA,CACzB24D,EAAEggQ,SAAAA,WACOtsS,EAAI,EAAGA,EAAIpS,EAAE0+S,SAAS34T,SAAUqsB,EACrCssC,EAAEggQ,SAAStsS,GAAKpS,EAAE0+S,SAAStsS,UAGhB,MAAfpS,EAAE+H,WAAqB/H,EAAEsb,eAAe,eACxCojC,EAAE32C,UAAYipF,EAAEyoD,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAOpkB,EAAE+H,UAAW,EAAG/H,EAAE+H,UAAUhiB,QAAUirG,EAAEyoD,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAK1e,EAAE+H,WAAa/H,EAAE+H,UACzJipF,EAAEyhR,SACF/zT,EAAEo0T,WAAa,cAEV,MAAT9yW,EAAElqF,KAAekqF,EAAEsb,eAAe,SAClCojC,EAAE5oI,IAAMk7K,EAAEyoD,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAOpkB,EAAElqF,IAAK,EAAGkqF,EAAElqF,IAAIiwE,QAAUirG,EAAEyoD,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAK1e,EAAElqF,KAAOkqF,EAAElqF,IACjIk7K,EAAEyhR,SACF/zT,EAAE7gC,KAAO,QAEV6gC,GAUXumO,EAAQxmQ,UAAUvW,OAAS,kBAChB4Y,KAAK2M,YAAYy1I,SAASpiJ,KAAMshJ,EAAU1hJ,KAAKyiJ,gBAGnD8hH,EArUPA,GAwUJ2/B,EAAI4tD,eAAAA,WAoBA,SAAAA,EAAwBxqX,MACpB84B,KAAKsjV,MAAAA,GACLtjV,KAAKqjV,MAAAA,GACLrjV,KAAK0jV,MAAAA,GACL1jV,KAAKyjV,MAAAA,GACDv8W,EAAAA,IAAAA,IACS26K,EAAKruP,OAAOW,KAAK+yE,GAAIC,EAAI,EAAGA,EAAI06K,EAAG58K,SAAUkC,EAClC,MAAZD,EAAE26K,EAAG16K,MACL64B,KAAK6hJ,EAAG16K,IAAMD,EAAE26K,EAAG16K,YASnCuqX,EAAe/zV,UAAU2lV,MAAQ3hM,EAAM4D,WAQvCmsM,EAAe/zV,UAAU0lV,MAAQ1hM,EAAM4D,WAQvCmsM,EAAe/zV,UAAU+lV,MAAQ/hM,EAAM4D,WAQvCmsM,EAAe/zV,UAAU8lV,MAAQ9hM,EAAM4D,WAWvCmsM,EAAepuV,OAAS,SAAgBpkB,EAAGulI,MAClCA,IACDA,EAAIg9B,EAAQvtP,UACD,MAAXgrF,EAAEokW,OAAiBpkW,EAAEokW,MAAMr+W,eAClBkC,EAAI,EAAGA,EAAI+X,EAAEokW,MAAMr+W,SAAUkC,EAClC+zH,EAAM4oM,IAAImuD,aAAa3uV,OAAOpkB,EAAEokW,MAAMn8W,GAAIs9I,EAAEs9B,OAAO,IAAI6C,QAAQC,YAExD,MAAX3lK,EAAEmkW,OAAiBnkW,EAAEmkW,MAAMp+W,WAClBkC,EAAI,EAAGA,EAAI+X,EAAEmkW,MAAMp+W,SAAUkC,EAClC+zH,EAAM4oM,IAAIouD,aAAa5uV,OAAOpkB,EAAEmkW,MAAMl8W,GAAIs9I,EAAEs9B,OAAO,IAAI6C,QAAQC,YAExD,MAAX3lK,EAAEwkW,OAAiBxkW,EAAEwkW,MAAMz+W,WAClBkC,EAAI,EAAGA,EAAI+X,EAAEwkW,MAAMz+W,SAAUkC,EAClC+zH,EAAM4oM,IAAIquD,aAAa7uV,OAAOpkB,EAAEwkW,MAAMv8W,GAAIs9I,EAAEs9B,OAAO,IAAI6C,QAAQC,YAExD,MAAX3lK,EAAEukW,OAAiBvkW,EAAEukW,MAAMx+W,WAClBkC,EAAI,EAAGA,EAAI+X,EAAEukW,MAAMx+W,SAAUkC,EAClC+zH,EAAM4oM,IAAIsuD,aAAa9uV,OAAOpkB,EAAEukW,MAAMt8W,GAAIs9I,EAAEs9B,OAAO,IAAI6C,QAAQC,gBAEhEpgC,GAcXitO,EAAettV,OAAS,SAAgB4J,EAAGjlB,GACjCilB,aAAauzI,IACfvzI,EAAIuzI,EAAQrtP,OAAO85G,YACnBvhC,OAAU/2E,IAANqzF,EAAkBilB,EAAE5K,IAAM4K,EAAEp2B,IAAMmR,EAAG7J,EAAAA,IAAQg8G,EAAM4oM,IAAI4tD,eACxD1jV,EAAEp2B,IAAMnL,GAAAA,KACPsyE,EAAI/wC,EAAE+zI,gBACFhjG,IAAM,QACT,EACK7/D,EAAEokW,OAASpkW,EAAEokW,MAAMr+W,SACrBia,EAAEokW,MAAAA,IACNpkW,EAAEokW,MAAMx4W,KAAKowH,EAAM4oM,IAAImuD,aAAa7tV,OAAO4J,EAAGA,EAAE+zI,sBAE/C,EACK7iK,EAAEmkW,OAASnkW,EAAEmkW,MAAMp+W,SACrBia,EAAEmkW,MAAAA,IACNnkW,EAAEmkW,MAAMv4W,KAAKowH,EAAM4oM,IAAIouD,aAAa9tV,OAAO4J,EAAGA,EAAE+zI,sBAE/C,EACK7iK,EAAEwkW,OAASxkW,EAAEwkW,MAAMz+W,SACrBia,EAAEwkW,MAAAA,IACNxkW,EAAEwkW,MAAM54W,KAAKowH,EAAM4oM,IAAIquD,aAAa/tV,OAAO4J,EAAGA,EAAE+zI,sBAE/C,EACK7iK,EAAEukW,OAASvkW,EAAEukW,MAAMx+W,SACrBia,EAAEukW,MAAAA,IACNvkW,EAAEukW,MAAM34W,KAAKowH,EAAM4oM,IAAIsuD,aAAahuV,OAAO4J,EAAGA,EAAE+zI,yBAGhD/zI,EAAEi0I,SAAa,EAAJljG,WAIZ7/D,GAWXwyW,EAAevvM,WAAa,SAAoBvkH,MACxCA,aAAas9D,EAAM4oM,IAAI4tD,eAAAA,OAChB9zT,MACP1+C,EAAAA,IAAQg8G,EAAM4oM,IAAI4tD,kBAClB9zT,EAAE0lT,MAAAA,KACGzlV,MAAM/gB,QAAQ8gD,EAAE0lT,OAAAA,MACXv+U,UAAU,6CACpB7lB,EAAEokW,MAAAA,WACOn8W,EAAI,EAAGA,EAAIy2D,EAAE0lT,MAAMr+W,SAAUkC,EAAAA,IACR,iBAAfy2D,EAAE0lT,MAAMn8W,GAAO,MAChB49B,UAAU,8CACpB7lB,EAAEokW,MAAMn8W,GAAK+zH,EAAM4oM,IAAImuD,aAAa9vM,WAAWvkH,EAAE0lT,MAAMn8W,QAG3Dy2D,EAAEylT,MAAAA,KACGxlV,MAAM/gB,QAAQ8gD,EAAEylT,OAAAA,MACXt+U,UAAU,iDACpB7lB,EAAEmkW,MAAAA,GACOl8W,EAAI,EAAGA,EAAIy2D,EAAEylT,MAAMp+W,SAAUkC,EAAAA,IACR,iBAAfy2D,EAAEylT,MAAMl8W,GAAO,MAChB49B,UAAU,8CACpB7lB,EAAEmkW,MAAMl8W,GAAK+zH,EAAM4oM,IAAIouD,aAAa/vM,WAAWvkH,EAAEylT,MAAMl8W,QAG3Dy2D,EAAE8lT,MAAAA,KACG7lV,MAAM/gB,QAAQ8gD,EAAE8lT,OAAAA,MACX3+U,UAAU,iDACpB7lB,EAAEwkW,MAAAA,GACOv8W,EAAI,EAAGA,EAAIy2D,EAAE8lT,MAAMz+W,SAAUkC,EAAAA,IACR,iBAAfy2D,EAAE8lT,MAAMv8W,GAAO,MAChB49B,UAAU,8CACpB7lB,EAAEwkW,MAAMv8W,GAAK+zH,EAAM4oM,IAAIquD,aAAahwM,WAAWvkH,EAAE8lT,MAAMv8W,QAG3Dy2D,EAAE6lT,MAAAA,KACG5lV,MAAM/gB,QAAQ8gD,EAAE6lT,OAAAA,MACX1+U,UAAU,iDACpB7lB,EAAEukW,MAAAA,GACOt8W,EAAI,EAAGA,EAAIy2D,EAAE6lT,MAAMx+W,SAAUkC,EAAAA,IACR,iBAAfy2D,EAAE6lT,MAAMt8W,GAAO,MAChB49B,UAAU,8CACpB7lB,EAAEukW,MAAMt8W,GAAK+zH,EAAM4oM,IAAIsuD,aAAajwM,WAAWvkH,EAAE6lT,MAAMt8W,YAGxD+X,GAYXwyW,EAAetvM,SAAW,SAAkBljK,EAAGgxF,GACtCA,IACDA,EAAAA,QACAtyC,EAAAA,OACAsyC,EAAEkmE,QAAUlmE,EAAEuiC,YACd70E,EAAE0lT,MAAAA,GACF1lT,EAAEylT,MAAAA,GACFzlT,EAAE8lT,MAAAA,GACF9lT,EAAE6lT,MAAAA,IAEFvkW,EAAEokW,OAASpkW,EAAEokW,MAAMr+W,OAAAA,CACnB24D,EAAE0lT,MAAAA,WACOhyV,EAAI,EAAGA,EAAIpS,EAAEokW,MAAMr+W,SAAUqsB,EAClCssC,EAAE0lT,MAAMhyV,GAAK4pG,EAAM4oM,IAAImuD,aAAa7vM,SAASljK,EAAEokW,MAAMhyV,GAAI4+E,MAG7DhxF,EAAEmkW,OAASnkW,EAAEmkW,MAAMp+W,WACnB24D,EAAEylT,MAAAA,GACO/xV,EAAI,EAAGA,EAAIpS,EAAEmkW,MAAMp+W,SAAUqsB,EAClCssC,EAAEylT,MAAM/xV,GAAK4pG,EAAM4oM,IAAIouD,aAAa9vM,SAASljK,EAAEmkW,MAAM/xV,GAAI4+E,MAG7DhxF,EAAEwkW,OAASxkW,EAAEwkW,MAAMz+W,WACnB24D,EAAE8lT,MAAAA,GACOpyV,EAAI,EAAGA,EAAIpS,EAAEwkW,MAAMz+W,SAAUqsB,EAClCssC,EAAE8lT,MAAMpyV,GAAK4pG,EAAM4oM,IAAIquD,aAAa/vM,SAASljK,EAAEwkW,MAAMpyV,GAAI4+E,MAG7DhxF,EAAEukW,OAASvkW,EAAEukW,MAAMx+W,WACnB24D,EAAE6lT,MAAAA,GACOnyV,EAAI,EAAGA,EAAIpS,EAAEukW,MAAMx+W,SAAUqsB,EAClCssC,EAAE6lT,MAAMnyV,GAAK4pG,EAAM4oM,IAAIsuD,aAAahwM,SAASljK,EAAEukW,MAAMnyV,GAAI4+E,UAG1DtyC,GAUX8zT,EAAe/zV,UAAUvW,OAAS,kBACvB4Y,KAAK2M,YAAYy1I,SAASpiJ,KAAMshJ,EAAU1hJ,KAAKyiJ,gBAGnDqvM,EA5PPA,GA+PJ5tD,EAAImuD,aAAAA,WAkBA,SAAAA,EAAsB/qX,MAClB84B,KAAK4kV,WAAAA,GACD19W,EAAAA,IAAAA,IACS26K,EAAKruP,OAAOW,KAAK+yE,GAAIC,EAAI,EAAGA,EAAI06K,EAAG58K,SAAUkC,EAClC,MAAZD,EAAE26K,EAAG16K,MACL64B,KAAK6hJ,EAAG16K,IAAMD,EAAE26K,EAAG16K,SAoB/BsqX,SAXJQ,EAAat0V,UAAUgnV,QAAU,KAQjCsN,EAAat0V,UAAUinV,WAAajjM,EAAM4D,WAW1C/xP,OAAOC,eAAew+b,EAAat0V,UAAW,WAAA,CAC1Cnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,YACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAY3BQ,EAAa3uV,OAAS,SAAgBpkB,EAAGulI,MAChCA,IACDA,EAAIg9B,EAAQvtP,UACC,MAAbgrF,EAAEylW,SAAmBnxb,OAAOgnG,eAAeoD,KAAK1e,EAAG,YACnDulI,EAAEs9B,OAAO,IAAIpmJ,OAAOzc,EAAEylW,SACN,MAAhBzlW,EAAE0lW,YAAsB1lW,EAAE0lW,WAAW3/W,eAC5BkC,EAAI,EAAGA,EAAI+X,EAAE0lW,WAAW3/W,SAAUkC,EACvCs9I,EAAEs9B,OAAO,IAAIppB,MAAMz5I,EAAE0lW,WAAWz9W,WAEjCs9I,GAcXwtO,EAAa7tV,OAAS,SAAgB4J,EAAGjlB,GAC/BilB,aAAauzI,IACfvzI,EAAIuzI,EAAQrtP,OAAO85G,YACnBvhC,OAAU/2E,IAANqzF,EAAkBilB,EAAE5K,IAAM4K,EAAEp2B,IAAMmR,EAAG7J,EAAAA,IAAQg8G,EAAM4oM,IAAImuD,aACxDjkV,EAAEp2B,IAAMnL,GAAAA,KACPsyE,EAAI/wC,EAAE+zI,gBACFhjG,IAAM,QACT,EACD7/D,EAAEylW,QAAU32U,EAAErS,oBAEb,EACKzc,EAAE0lW,YAAc1lW,EAAE0lW,WAAW3/W,SAC/Bia,EAAE0lW,WAAAA,IACN1lW,EAAE0lW,WAAW95W,KAAKkjC,EAAE2qH,uBAGpB3qH,EAAEi0I,SAAa,EAAJljG,WAIZ7/D,GAWX+yW,EAAa9vM,WAAa,SAAoBvkH,MACtCA,aAAas9D,EAAM4oM,IAAImuD,aAAAA,OAChBr0T,MACP1+C,EAAAA,IAAQg8G,EAAM4oM,IAAImuD,gBACL,MAAbr0T,EAAE+mT,UACFzlW,EAAEylW,QAAUt+W,OAAOu3D,EAAE+mT,UAErB/mT,EAAEgnT,WAAAA,KACG/mV,MAAM/gB,QAAQ8gD,EAAEgnT,YAAAA,MACX7/U,UAAU,gDACpB7lB,EAAE0lW,WAAAA,WACOz9W,EAAI,EAAGA,EAAIy2D,EAAEgnT,WAAW3/W,SAAUkC,EACR,iBAApBy2D,EAAEgnT,WAAWz9W,GACpBw6K,EAAM99I,OAAOO,OAAOw5B,EAAEgnT,WAAWz9W,GAAI+X,EAAE0lW,WAAWz9W,GAAKw6K,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAO24D,EAAEgnT,WAAWz9W,KAAM,GACzGy2D,EAAEgnT,WAAWz9W,GAAGlC,SACrBia,EAAE0lW,WAAWz9W,GAAKy2D,EAAEgnT,WAAWz9W,WAGpC+X,GAYX+yW,EAAa7vM,SAAW,SAAkBljK,EAAGgxF,GACpCA,IACDA,EAAAA,QACAtyC,EAAAA,OACAsyC,EAAEkmE,QAAUlmE,EAAEuiC,YACd70E,EAAEgnT,WAAAA,IAEW,MAAb1lW,EAAEylW,SAAmBzlW,EAAEsb,eAAe,aACtCojC,EAAE+mT,QAAUzlW,EAAEylW,QACVz0Q,EAAEyhR,SACF/zT,EAAEk0T,SAAW,YAEjB5yW,EAAE0lW,YAAc1lW,EAAE0lW,WAAW3/W,OAAAA,CAC7B24D,EAAEgnT,WAAAA,WACOtzV,EAAI,EAAGA,EAAIpS,EAAE0lW,WAAW3/W,SAAUqsB,EACvCssC,EAAEgnT,WAAWtzV,GAAK4+E,EAAEyoD,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAOpkB,EAAE0lW,WAAWtzV,GAAI,EAAGpS,EAAE0lW,WAAWtzV,GAAGrsB,QAAUirG,EAAEyoD,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAK1e,EAAE0lW,WAAWtzV,IAAMpS,EAAE0lW,WAAWtzV,UAGzLssC,GAUXq0T,EAAat0V,UAAUvW,OAAS,kBACrB4Y,KAAK2M,YAAYy1I,SAASpiJ,KAAMshJ,EAAU1hJ,KAAKyiJ,gBAGnD4vM,EArLPA,GAwLJnuD,EAAIouD,aAAAA,WAiBA,SAAAA,EAAsBhrX,MAClB84B,KAAK4kV,WAAAA,GACD19W,EAAAA,IAAAA,IACS26K,EAAKruP,OAAOW,KAAK+yE,GAAIC,EAAI,EAAGA,EAAI06K,EAAG58K,SAAUkC,EAClC,MAAZD,EAAE26K,EAAG16K,MACL64B,KAAK6hJ,EAAG16K,IAAMD,EAAE26K,EAAG16K,YASnC+qX,EAAav0V,UAAUinV,WAAajjM,EAAM4D,WAW1C2sM,EAAa5uV,OAAS,SAAgBpkB,EAAGulI,MAChCA,IACDA,EAAIg9B,EAAQvtP,UACI,MAAhBgrF,EAAE0lW,YAAsB1lW,EAAE0lW,WAAW3/W,eAC5BkC,EAAI,EAAGA,EAAI+X,EAAE0lW,WAAW3/W,SAAUkC,EACvCs9I,EAAEs9B,OAAO,IAAIppB,MAAMz5I,EAAE0lW,WAAWz9W,WAEjCs9I,GAcXytO,EAAa9tV,OAAS,SAAgB4J,EAAGjlB,GAC/BilB,aAAauzI,IACfvzI,EAAIuzI,EAAQrtP,OAAO85G,YACnBvhC,OAAU/2E,IAANqzF,EAAkBilB,EAAE5K,IAAM4K,EAAEp2B,IAAMmR,EAAG7J,EAAAA,IAAQg8G,EAAM4oM,IAAIouD,aACxDlkV,EAAEp2B,IAAMnL,GAAAA,KACPsyE,EAAI/wC,EAAE+zI,gBACFhjG,IAAM,QACT,EACK7/D,EAAE0lW,YAAc1lW,EAAE0lW,WAAW3/W,SAC/Bia,EAAE0lW,WAAAA,IACN1lW,EAAE0lW,WAAW95W,KAAKkjC,EAAE2qH,uBAGpB3qH,EAAEi0I,SAAa,EAAJljG,WAIZ7/D,GAWXgzW,EAAa/vM,WAAa,SAAoBvkH,MACtCA,aAAas9D,EAAM4oM,IAAIouD,aAAAA,OAChBt0T,MACP1+C,EAAAA,IAAQg8G,EAAM4oM,IAAIouD,gBAClBt0T,EAAEgnT,WAAAA,KACG/mV,MAAM/gB,QAAQ8gD,EAAEgnT,YAAAA,MACX7/U,UAAU,gDACpB7lB,EAAE0lW,WAAAA,WACOz9W,EAAI,EAAGA,EAAIy2D,EAAEgnT,WAAW3/W,SAAUkC,EACR,iBAApBy2D,EAAEgnT,WAAWz9W,GACpBw6K,EAAM99I,OAAOO,OAAOw5B,EAAEgnT,WAAWz9W,GAAI+X,EAAE0lW,WAAWz9W,GAAKw6K,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAO24D,EAAEgnT,WAAWz9W,KAAM,GACzGy2D,EAAEgnT,WAAWz9W,GAAGlC,SACrBia,EAAE0lW,WAAWz9W,GAAKy2D,EAAEgnT,WAAWz9W,WAGpC+X,GAYXgzW,EAAa9vM,SAAW,SAAkBljK,EAAGgxF,GACpCA,IACDA,EAAAA,QACAtyC,EAAAA,OACAsyC,EAAEkmE,QAAUlmE,EAAEuiC,YACd70E,EAAEgnT,WAAAA,IAEF1lW,EAAE0lW,YAAc1lW,EAAE0lW,WAAW3/W,OAAAA,CAC7B24D,EAAEgnT,WAAAA,WACOtzV,EAAI,EAAGA,EAAIpS,EAAE0lW,WAAW3/W,SAAUqsB,EACvCssC,EAAEgnT,WAAWtzV,GAAK4+E,EAAEyoD,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAOpkB,EAAE0lW,WAAWtzV,GAAI,EAAGpS,EAAE0lW,WAAWtzV,GAAGrsB,QAAUirG,EAAEyoD,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAK1e,EAAE0lW,WAAWtzV,IAAMpS,EAAE0lW,WAAWtzV,UAGzLssC,GAUXs0T,EAAav0V,UAAUvW,OAAS,kBACrB4Y,KAAK2M,YAAYy1I,SAASpiJ,KAAMshJ,EAAU1hJ,KAAKyiJ,gBAGnD6vM,EAjJPA,GAoJJpuD,EAAIquD,aAAAA,WAiBA,SAAAA,EAAsBjrX,MACdA,EAAAA,IAAAA,IACS26K,EAAKruP,OAAOW,KAAK+yE,GAAIC,EAAI,EAAGA,EAAI06K,EAAG58K,SAAUkC,EAClC,MAAZD,EAAE26K,EAAG16K,MACL64B,KAAK6hJ,EAAG16K,IAAMD,EAAE26K,EAAG16K,SAY/BsqX,SAHJU,EAAax0V,UAAUgnV,QAAU,KAWjCnxb,OAAOC,eAAe0+b,EAAax0V,UAAW,WAAA,CAC1Cnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,YACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAY3BU,EAAa7uV,OAAS,SAAgBpkB,EAAGulI,UAChCA,IACDA,EAAIg9B,EAAQvtP,UACC,MAAbgrF,EAAEylW,SAAmBnxb,OAAOgnG,eAAeoD,KAAK1e,EAAG,YACnDulI,EAAEs9B,OAAO,IAAIpmJ,OAAOzc,EAAEylW,SACnBlgO,GAcX0tO,EAAa/tV,OAAS,SAAgB4J,EAAGjlB,GAC/BilB,aAAauzI,IACfvzI,EAAIuzI,EAAQrtP,OAAO85G,YACnBvhC,OAAU/2E,IAANqzF,EAAkBilB,EAAE5K,IAAM4K,EAAEp2B,IAAMmR,EAAG7J,EAAAA,IAAQg8G,EAAM4oM,IAAIquD,aACxDnkV,EAAEp2B,IAAMnL,GAAAA,KACPsyE,EAAI/wC,EAAE+zI,gBACFhjG,IAAM,QACT,EACD7/D,EAAEylW,QAAU32U,EAAErS,uBAGdqS,EAAEi0I,SAAa,EAAJljG,WAIZ7/D,GAWXizW,EAAahwM,WAAa,SAAoBvkH,MACtCA,aAAas9D,EAAM4oM,IAAIquD,aAAAA,OAChBv0T,MACP1+C,EAAAA,IAAQg8G,EAAM4oM,IAAIquD,oBACL,MAAbv0T,EAAE+mT,UACFzlW,EAAEylW,QAAUt+W,OAAOu3D,EAAE+mT,UAElBzlW,GAYXizW,EAAa/vM,SAAW,SAAkBljK,EAAGgxF,GACpCA,IACDA,EAAAA,QACAtyC,EAAAA,UACa,MAAb1+C,EAAEylW,SAAmBzlW,EAAEsb,eAAe,aACtCojC,EAAE+mT,QAAUzlW,EAAEylW,QACVz0Q,EAAEyhR,SACF/zT,EAAEk0T,SAAW,YAEdl0T,GAUXu0T,EAAax0V,UAAUvW,OAAS,kBACrB4Y,KAAK2M,YAAYy1I,SAASpiJ,KAAMshJ,EAAU1hJ,KAAKyiJ,gBAGnD8vM,EA9IPA,GAiJJruD,EAAIsuD,aAAAA,WAmBA,SAAAA,EAAsBlrX,MAClB84B,KAAKyiS,MAAAA,GACDv7T,EAAAA,IAAAA,IACS26K,EAAKruP,OAAOW,KAAK+yE,GAAIC,EAAI,EAAGA,EAAI06K,EAAG58K,SAAUkC,EAClC,MAAZD,EAAE26K,EAAG16K,MACL64B,KAAK6hJ,EAAG16K,IAAMD,EAAE26K,EAAG16K,SA4B/BsqX,SAnBJW,EAAaz0V,UAAUgnV,QAAU,KAQjCyN,EAAaz0V,UAAU8kS,MAAQ9gJ,EAAM4D,WAQrC6sM,EAAaz0V,UAAUmkV,QAAU,KAWjCtub,OAAOC,eAAe2+b,EAAaz0V,UAAW,WAAA,CAC1Cnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,YACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAS3Bj+b,OAAOC,eAAe2+b,EAAaz0V,UAAW,WAAA,CAC1Cnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,YACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAY3BW,EAAa9uV,OAAS,SAAgBpkB,EAAGulI,MAChCA,IACDA,EAAIg9B,EAAQvtP,UACC,MAAbgrF,EAAEylW,SAAmBnxb,OAAOgnG,eAAeoD,KAAK1e,EAAG,YACnDulI,EAAEs9B,OAAO,IAAIpmJ,OAAOzc,EAAEylW,SACX,MAAXzlW,EAAEujT,OAAiBvjT,EAAEujT,MAAMx9T,eAClBkC,EAAI,EAAGA,EAAI+X,EAAEujT,MAAMx9T,SAAUkC,EAClC+zH,EAAM4oM,IAAIuuD,SAAS/uV,OAAOpkB,EAAEujT,MAAMt7T,GAAIs9I,EAAEs9B,OAAO,IAAI6C,QAAQC,gBAElD,MAAb3lK,EAAE4iW,SAAmBtub,OAAOgnG,eAAeoD,KAAK1e,EAAG,YACnDulI,EAAEs9B,OAAO,IAAI8B,OAAO3kK,EAAE4iW,SACnBr9N,GAcX2tO,EAAahuV,OAAS,SAAgB4J,EAAGjlB,GAC/BilB,aAAauzI,IACfvzI,EAAIuzI,EAAQrtP,OAAO85G,YACnBvhC,OAAU/2E,IAANqzF,EAAkBilB,EAAE5K,IAAM4K,EAAEp2B,IAAMmR,EAAG7J,EAAAA,IAAQg8G,EAAM4oM,IAAIsuD,aACxDpkV,EAAEp2B,IAAMnL,GAAAA,KACPsyE,EAAI/wC,EAAE+zI,gBACFhjG,IAAM,QACT,EACD7/D,EAAEylW,QAAU32U,EAAErS,oBAEb,EACKzc,EAAEujT,OAASvjT,EAAEujT,MAAMx9T,SACrBia,EAAEujT,MAAAA,IACNvjT,EAAEujT,MAAM33T,KAAKowH,EAAM4oM,IAAIuuD,SAASjuV,OAAO4J,EAAGA,EAAE+zI,sBAE3C,EACD7iK,EAAE4iW,QAAU9zU,EAAE61I,uBAGd71I,EAAEi0I,SAAa,EAAJljG,WAIZ7/D,GAWXkzW,EAAajwM,WAAa,SAAoBvkH,MACtCA,aAAas9D,EAAM4oM,IAAIsuD,aAAAA,OAChBx0T,MACP1+C,EAAAA,IAAQg8G,EAAM4oM,IAAIsuD,gBACL,MAAbx0T,EAAE+mT,UACFzlW,EAAEylW,QAAUt+W,OAAOu3D,EAAE+mT,UAErB/mT,EAAE6kQ,MAAAA,KACG5kS,MAAM/gB,QAAQ8gD,EAAE6kQ,OAAAA,MACX19R,UAAU,2CACpB7lB,EAAEujT,MAAAA,WACOt7T,EAAI,EAAGA,EAAIy2D,EAAE6kQ,MAAMx9T,SAAUkC,EAAAA,IACR,iBAAfy2D,EAAE6kQ,MAAMt7T,GAAO,MAChB49B,UAAU,4CACpB7lB,EAAEujT,MAAMt7T,GAAK+zH,EAAM4oM,IAAIuuD,SAASlwM,WAAWvkH,EAAE6kQ,MAAMt7T,YAG1C,MAAby2D,EAAEkkT,UACEngM,EAAMqE,MACL9mK,EAAE4iW,QAAUngM,EAAMqE,KAAKm5G,UAAUvhO,EAAEkkT,UAAUr7L,UAAW,EAC/B,iBAAd7oH,EAAEkkT,QACd5iW,EAAE4iW,QAAU17W,SAASw3D,EAAEkkT,QAAS,IACN,iBAAdlkT,EAAEkkT,QACd5iW,EAAE4iW,QAAUlkT,EAAEkkT,QACY,iBAAdlkT,EAAEkkT,UACd5iW,EAAE4iW,QAAAA,IAAcngM,EAAMiB,SAAShlH,EAAEkkT,QAAQ7zU,MAAQ,EAAG2vB,EAAEkkT,QAAQ5zU,OAAS,GAAGlP,UAAS,KAEpF9f,GAYXkzW,EAAahwM,SAAW,SAAkBljK,EAAGgxF,GACpCA,IACDA,EAAAA,QACAtyC,EAAAA,OACAsyC,EAAEkmE,QAAUlmE,EAAEuiC,YACd70E,EAAE6kQ,MAAAA,IAEW,MAAbvjT,EAAEylW,SAAmBzlW,EAAEsb,eAAe,aACtCojC,EAAE+mT,QAAUzlW,EAAEylW,QACVz0Q,EAAEyhR,SACF/zT,EAAEk0T,SAAW,YAEjB5yW,EAAEujT,OAASvjT,EAAEujT,MAAMx9T,OAAAA,CACnB24D,EAAE6kQ,MAAAA,WACOnxS,EAAI,EAAGA,EAAIpS,EAAEujT,MAAMx9T,SAAUqsB,EAClCssC,EAAE6kQ,MAAMnxS,GAAK4pG,EAAM4oM,IAAIuuD,SAASjwM,SAASljK,EAAEujT,MAAMnxS,GAAI4+E,UAG5C,MAAbhxF,EAAE4iW,SAAmB5iW,EAAEsb,eAAe,aACb,iBAAdtb,EAAE4iW,QACTlkT,EAAEkkT,QAAU5xQ,EAAE+2E,QAAU5gL,OAASA,OAAO6Y,EAAE4iW,SAAW5iW,EAAE4iW,QAEvDlkT,EAAEkkT,QAAU5xQ,EAAE+2E,QAAU5gL,OAASs7K,EAAMqE,KAAKroJ,UAAUS,SAASR,KAAK1e,EAAE4iW,SAAW5xQ,EAAE+2E,QAAU9gL,OAAAA,IAAaw7K,EAAMiB,SAAS1jK,EAAE4iW,QAAQ7zU,MAAQ,EAAG/uB,EAAE4iW,QAAQ5zU,OAAS,GAAGlP,UAAS,GAAQ9f,EAAE4iW,QACvL5xQ,EAAEyhR,SACF/zT,EAAE00T,SAAW,YAEd10T,GAUXw0T,EAAaz0V,UAAUvW,OAAS,kBACrB4Y,KAAK2M,YAAYy1I,SAASpiJ,KAAMshJ,EAAU1hJ,KAAKyiJ,gBAGnD+vM,EA/NPA,GAkOJtuD,EAAIuuD,SAAAA,WAkBA,SAAAA,EAAkBnrX,MACVA,EAAAA,IAAAA,IACS26K,EAAKruP,OAAOW,KAAK+yE,GAAIC,EAAI,EAAGA,EAAI06K,EAAG58K,SAAUkC,EAClC,MAAZD,EAAE26K,EAAG16K,MACL64B,KAAK6hJ,EAAG16K,IAAMD,EAAE26K,EAAG16K,SAoB/BsqX,SAXJY,EAAS10V,UAAU0oV,OAAS,KAQ5BgM,EAAS10V,UAAU2oV,iBAAmB,KAWtC9yb,OAAOC,eAAe4+b,EAAS10V,UAAW,UAAA,CACtCnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,WACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAS3Bj+b,OAAOC,eAAe4+b,EAAS10V,UAAW,oBAAA,CACtCnc,IAAKmgK,EAAMkF,YAAY4qM,EAAAA,CAAgB,qBACvChwW,IAAKkgK,EAAMqF,YAAYyqM,KAY3BY,EAAS/uV,OAAS,SAAgBpkB,EAAGulI,UAC5BA,IACDA,EAAIg9B,EAAQvtP,UACA,MAAZgrF,EAAEmnW,QAAkB7yb,OAAOgnG,eAAeoD,KAAK1e,EAAG,WAClDulI,EAAEs9B,OAAO,IAAIppB,MAAMz5I,EAAEmnW,QACC,MAAtBnnW,EAAEonW,kBAA4B9yb,OAAOgnG,eAAeoD,KAAK1e,EAAG,qBAC5DulI,EAAEs9B,OAAO,IAAIppB,MAAMz5I,EAAEonW,kBAClB7hO,GAcX4tO,EAASjuV,OAAS,SAAgB4J,EAAGjlB,GAC3BilB,aAAauzI,IACfvzI,EAAIuzI,EAAQrtP,OAAO85G,YACnBvhC,OAAU/2E,IAANqzF,EAAkBilB,EAAE5K,IAAM4K,EAAEp2B,IAAMmR,EAAG7J,EAAAA,IAAQg8G,EAAM4oM,IAAIuuD,SACxDrkV,EAAEp2B,IAAMnL,GAAAA,KACPsyE,EAAI/wC,EAAE+zI,gBACFhjG,IAAM,QACT,EACD7/D,EAAEmnW,OAASr4U,EAAE2qH,mBAEZ,EACDz5I,EAAEonW,iBAAmBt4U,EAAE2qH,sBAGvB3qH,EAAEi0I,SAAa,EAAJljG,WAIZ7/D,GAWXmzW,EAASlwM,WAAa,SAAoBvkH,MAClCA,aAAas9D,EAAM4oM,IAAIuuD,SAAAA,OAChBz0T,MACP1+C,EAAAA,IAAQg8G,EAAM4oM,IAAIuuD,gBACN,MAAZz0T,EAAEyoT,SACsB,iBAAbzoT,EAAEyoT,OACT1kM,EAAM99I,OAAOO,OAAOw5B,EAAEyoT,OAAQnnW,EAAEmnW,OAAS1kM,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAO24D,EAAEyoT,SAAU,GACpFzoT,EAAEyoT,OAAOphX,SACdia,EAAEmnW,OAASzoT,EAAEyoT,SAEK,MAAtBzoT,EAAE0oT,mBACgC,iBAAvB1oT,EAAE0oT,iBACT3kM,EAAM99I,OAAOO,OAAOw5B,EAAE0oT,iBAAkBpnW,EAAEonW,iBAAmB3kM,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAO24D,EAAE0oT,mBAAoB,GAClH1oT,EAAE0oT,iBAAiBrhX,SACxBia,EAAEonW,iBAAmB1oT,EAAE0oT,mBAExBpnW,GAYXmzW,EAASjwM,SAAW,SAAkBljK,EAAGgxF,GAChCA,IACDA,EAAAA,QACAtyC,EAAAA,UACY,MAAZ1+C,EAAEmnW,QAAkBnnW,EAAEsb,eAAe,YACrCojC,EAAEyoT,OAASn2Q,EAAEyoD,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAOpkB,EAAEmnW,OAAQ,EAAGnnW,EAAEmnW,OAAOphX,QAAUirG,EAAEyoD,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAK1e,EAAEmnW,QAAUnnW,EAAEmnW,OAC7In2Q,EAAEyhR,SACF/zT,EAAE20T,QAAU,WAEM,MAAtBrzW,EAAEonW,kBAA4BpnW,EAAEsb,eAAe,sBAC/CojC,EAAE0oT,iBAAmBp2Q,EAAEyoD,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAOpkB,EAAEonW,iBAAkB,EAAGpnW,EAAEonW,iBAAiBrhX,QAAUirG,EAAEyoD,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAK1e,EAAEonW,kBAAoBpnW,EAAEonW,iBACrLp2Q,EAAEyhR,SACF/zT,EAAE40T,kBAAoB,qBAEvB50T,GAUXy0T,EAAS10V,UAAUvW,OAAS,kBACjB4Y,KAAK2M,YAAYy1I,SAASpiJ,KAAMshJ,EAAU1hJ,KAAKyiJ,gBAGnDgwM,EArLPA,GAwLGvuD,EA10DLA,GA60DC5oM,GAz1DoC,mBAAZ3nM,GAA4C,iBAAXF,GAAuBA,GAAUA,EAAOC,UACpGD,EAAOC,QAAUwuK,EAAQvuK,EAAQ,kFCPzC,aACA,IAAAorb,EAAA3+U,MAAAA,KAAA2+U,kBAAAnrb,OAAAU,OAAA,SAAAg8K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACAb,OAAAC,eAAAy8K,EAAA2hH,EAAA,CAAA9yL,YAAA,EAAAvd,IAAA,WAAA,OAAAtC,EAAA7qF,OACA,SAAA67K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACA67K,EAAA2hH,GAAA3yM,EAAA7qF,KAEAuqb,EAAA5+U,MAAAA,KAAA4+U,qBAAAprb,OAAAU,OAAA,SAAAg8K,EAAApL,GACAtxK,OAAAC,eAAAy8K,EAAA,UAAA,CAAAnxE,YAAA,EAAArrG,MAAAoxK,KACA,SAAAoL,EAAApL,GACAoL,EAAA,QAAApL,IAEA+5Q,EAAA7+U,MAAAA,KAAA6+U,cAAA,SAAAv8R,GACA,GAAAA,GAAAA,EAAAtuJ,WAAA,OAAAsuJ,EACA,IAAA13E,EAAA,GACA,GAAA,MAAA03E,EAAA,IAAA,IAAAjuJ,KAAAiuJ,EAAA,YAAAjuJ,GAAAb,OAAAmqG,UAAAnD,eAAAoD,KAAA0kD,EAAAjuJ,IAAAsqb,EAAA/zW,EAAA03E,EAAAjuJ,GAEA,OADAuqb,EAAAh0W,EAAA03E,GACA13E,GAEAp3E,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAgvb,eAAA,EACA,MAAAlmN,EAAAyiN,EAAAtrb,EAAA,gBACA+rb,EAAA/rb,EAAA,sBACAgsb,EAAAhsb,EAAA,WA6QAD,EAAAgvb,UA3QA,MAKAzrb,YAAA6nb,GACA1+U,KAAA0+U,UAAAA,EAEA7nb,QACA,GAAAmpG,KAAAyyV,gBACA,OAEA,MAAApQ,EAAAriV,KAAA0yV,WAAA/5V,KAAAqH,MACA8qE,EAAAD,YAAA,KACAw3Q,IACAriV,KAAAyyV,gBAAA16D,gBAAAsqD,EAAAjmN,EAAAm1N,8BACAn1N,EAAAo1N,gCACAxxV,KAAAyyV,gBAAA,CACA/rF,iBAAAhxW,EACAqiY,gBAAA,CAAAnzS,EAAAozS,KACAh4R,KAAAyyV,gBAAA/rF,YAAAO,YAAAriR,EAAAozS,IAEAhwB,OAAA,KACA/3I,aAAAnlD,GACA87L,cAAA5mQ,KAAAyyV,gBAAA/rF,eASA7vW,OACAmpG,KAAAyyV,kBAGAzyV,KAAAyyV,gBAAAzqF,SACAhoQ,KAAAyyV,gBAAA,MAOA57b,aACA,MAAA+uN,EAAAA,EAAA06N,IAAAA,EAAAE,IAAAA,EAAAE,OAAAA,EAAAE,KAAAA,GAAA5gV,KAAA0+U,UAAA/8Q,SACA3hE,KAAA0+U,UAAA6D,iBAEA,MAAAoQ,EAAA,IAAA3vW,IACA4vW,EAAA3uW,IACA,IAAA/H,EAAAy2W,EAAAnxW,IAAAyC,GAKA,YAJAvuF,IAAAwmF,IACAA,EAAA8jB,KAAA0+U,UAAA7vO,MAAAA,MAAA5qH,GACA0uW,EAAAlxW,IAAAwC,EAAA/H,IAEAA,GAGAyrW,EAAA,IAAA3kW,IAEA4kW,EAAA,IAAA5kW,IAEA6kW,EAAA,IAAA7kW,IAEAgd,KAAA0+U,UAAAmU,gBAEA7yV,KAAA0+U,UAAAkD,SAAAx0R,QACAptD,KAAA0+U,UAAAmD,OAAAz0R,QAEAptD,KAAA0+U,UAAAoU,uBAEA9yV,KAAA0+U,UAAAqU,iBAEA/yV,KAAA0+U,UAAA8C,KAAAptb,SAAA,CAAAquY,EAAApE,KAEA,MAAA20D,EAAA/uW,IACA+b,KAAA0+U,UAAAryN,IAAA,0CAAApoI,EAAAo6S,GAEAr+R,KAAA0+U,UAAA7vO,MAAA40O,MAAAx/V,EAAAo6S,GAEAr+R,KAAA0+U,UAAA+G,YAAAxhW,EAAAo6S,GAEAoE,EAAAh/S,OAAAQ,GAEA,MAAAsjW,EAAAK,EAAApmW,IAAAyC,GACAsjW,EAIAA,EAAAz8W,KAAAuzT,GAHAupD,EAAAnmW,IAAAwC,EAAA,CAAAo6S,KAMA40D,EAAAhvW,IACA+b,KAAA0+U,UAAAryN,IAAA,uCAAApoI,EAAAo6S,GAEAr+R,KAAA0+U,UAAA7vO,MAAA60O,MAAAz/V,EAAAo6S,GAEAoE,EAAAzjT,IAAAiF,GAEA,MAAAsjW,EAAAI,EAAAnmW,IAAAyC,GACAsjW,EAIAA,EAAAz8W,KAAAuzT,GAHAspD,EAAAlmW,IAAAwC,EAAA,CAAAo6S,KAgBA,GATAoE,EAAAruY,SAAA6vF,IACA,MAAA4qH,EAAA+jP,EAAA3uW,GACA4qH,EAAA,IACA7uG,KAAA0+U,UAAAryN,IAAA,mEAAApoI,EAAA4qH,EAAAwvL,GACA20D,EAAA/uW,GACA4jW,EAAApmW,IAAAwC,GAAA,OAIAw+S,EAAAxlS,KAAAqjV,EAAA,CACA,MAAAwB,EAAA9hV,KAAA0+U,UAAAoD,QAAAtgW,IAAA68S,GACA60D,EAAAttO,EAAA68K,EAAAxlS,KACAqiV,EAAAyH,eAAA/mV,KAAA0+U,UAAArgD,EAAA60D,GAAAjvW,IAEAw+S,EAAA1jT,IAAAkF,KAAA+b,KAAA0+U,UAAAl1E,OAAAzqR,IAAAkF,MAAA69V,IAAAA,EAAA/iW,IAAAkF,KAAA2uW,EAAA3uW,IAAA,IAEA7vF,QAAA6+b,GAGA,GAAAxwD,EAAAxlS,KAAAujV,EAAA,CACA,IAAA2S,EAAAt1V,MAAA4rD,KAAAg5O,GAEA0wD,EAAA/mW,MAAA,CAAAvlB,EAAAyS,IAAAs5W,EAAAt5W,GAAAs5W,EAAA/rX,KAGAssX,EAAAA,EAAA/tX,MAAA,EAAAs7W,GAAA7uV,OAAA0tV,EAAAl8B,QAAA8vC,EAAA/tX,MAAAs7W,KAEA,IAAAqB,EAAA,EAOA,GANAoR,EAAA/tX,MAAA,EAAAwgJ,GAAAxxN,SAAA8yE,IACA84B,KAAA0+U,UAAAqD,SAAAvgW,IAAAta,IACA66W,OAIAA,EAAAnB,EAAA,CACA,MAAAwS,EAAAjsX,IAEA,MAAAD,EAAAisX,EAAAhsX,GACA,IAAA,IAAAmqB,EAAAnqB,EAAAmqB,EAAA,EAAAA,IACA6hW,EAAA7hW,GAAA6hW,EAAA7hW,EAAA,GAEA6hW,EAAA,GAAAjsX,GAGA,GAAA66W,EAAA,EAAA,CACA,IAAAuB,EAAAvB,EACA,IAAA,IAAA56W,EAAA,EAAAA,EAAAy+I,GAAA09N,EAAA,EAAAn8W,IACA64B,KAAA0+U,UAAAqD,SAAAvgW,IAAA2xW,EAAAhsX,MACAisX,EAAAjsX,GACAm8W,KAKA,IAAA4P,EAAAttO,EAAAm8N,EACA,IAAA,IAAA56W,EAAAy+I,EAAAz+I,EAAAgsX,EAAAluX,QAAAiuX,EAAA,EAAA/rX,IACA64B,KAAA0+U,UAAAqD,SAAAvgW,IAAA2xW,EAAAhsX,MACAisX,EAAAjsX,GACA+rX,KAKAC,EAAA/tX,MAAAwgJ,GAAAxxN,QAAA4+b,GAGA,GAAAvwD,EAAAxlS,MAAAqjV,EAAA,CAEA,IAAAyB,EAAA,EAOA,GANAt/C,EAAAruY,SAAA8yE,IACA84B,KAAA0+U,UAAAqD,SAAAvgW,IAAAta,IACA66W,OAIAA,EAAAnB,EAAA,CACA,MAAAsS,EAAAtS,EAAAmB,EACAD,EAAA9hV,KAAA0+U,UAAAoD,QAAAtgW,IAAA68S,GACAihD,EAAAyH,eAAA/mV,KAAA0+U,UAAArgD,EAAA60D,GAAAjvW,IAEAw+S,EAAA1jT,IAAAkF,KAAA+b,KAAA0+U,UAAAl1E,OAAAzqR,IAAAkF,MAAA69V,IAAAA,EAAA/iW,IAAAkF,KAAA2uW,EAAA3uW,IAAA,IACA7vF,QAAA6+b,IAIA,GAAAjzV,KAAA0+U,UAAA6D,eAAAnmN,EAAA80N,kCAAA,GAAAzuD,EAAAxlS,KAAA,EAAA,CAQA,MAAAo2V,EAAAx1V,MAAA4rD,KAAAg5O,GACAr2S,MAAA,CAAAvlB,EAAAyS,IAAAs5W,EAAA/rX,GAAA+rX,EAAAt5W,KACAg6W,EAAA7wD,EAAAxlS,KAAA,EACAs2V,EAAAX,EAAAS,EAAAC,IAEA,GAAAC,EAAAvzV,KAAA0+U,UAAA/8Q,SAAAu/Q,gBAAAsS,4BAAA,CACA,MAAA1R,EAAA9hV,KAAA0+U,UAAAoD,QAAAtgW,IAAA68S,GACAihD,EAAAyH,eAAA/mV,KAAA0+U,UAAArgD,EAAAjiK,EAAA60N,kCAAAhtW,GAEAw+S,EAAA1jT,IAAAkF,KAAA+b,KAAA0+U,UAAAl1E,OAAAzqR,IAAAkF,MAAA69V,IAAAA,EAAA/iW,IAAAkF,KAAA2uW,EAAA3uW,GAAAsvW,IAEAn/b,SAAA6vF,IACA+b,KAAA0+U,UAAAryN,IAAA,yDAAApoI,EAAAo6S,GACA40D,EAAAhvW,OAMA+b,KAAA0+U,UAAA+U,YAAAp1D,EAAAoE,MAGA,MAAAn9N,EAAAtlE,KAAA0+U,UAAAyG,OACAnlV,KAAA0+U,UAAA+C,QAAArtb,SAAA,CAAAs/b,EAAAr1D,KACAq1D,EAAAt3N,EAAAk1N,mBAAAhsR,IACAtlE,KAAA0+U,UAAAx8E,OAAAz+Q,OAAA46S,GACAr+R,KAAA0+U,UAAA+C,QAAAh+V,OAAA46S,OAIAr+R,KAAA0+U,UAAAx8E,OAAA9tW,SAAA,CAAA0yb,EAAAzoD,KAEA,MAAA4pD,EAAAjoV,KAAA0+U,UAAA6I,OAAA/lW,IAAA68S,GAQA,GAPAyoD,EAAA1yb,SAAA6vF,MACAgkW,EAAAlpW,IAAAkF,IACA2uW,EAAA3uW,GAAA+b,KAAA0+U,UAAA/8Q,SAAAu/Q,gBAAAsG,mBACAV,EAAArjW,OAAAQ,MAIA6iW,EAAA7pV,KAAA2oH,EAAA,CACA,MAAAstO,EAAAttO,EAAAkhO,EAAA7pV,KACAqiV,EAAAyH,eAAA/mV,KAAA0+U,UAAArgD,EAAA60D,GAAAjvW,IAEA6iW,EAAA/nW,IAAAkF,KACA+b,KAAA0+U,UAAAl1E,OAAAzqR,IAAAkF,IACA2uW,EAAA3uW,IAAA+b,KAAA0+U,UAAA/8Q,SAAAu/Q,gBAAAsG,mBAEApzb,SAAA6vF,IACA6iW,EAAA9nW,IAAAiF,MAKA+b,KAAA0+U,UAAA+U,YAAAp1D,EAAAyoD,MAGA9mV,KAAA0+U,UAAAiV,gBAAAhM,EAAAC,EAAAC,GAEA7nV,KAAA0+U,UAAAv7G,SAEAnjO,KAAA0+U,UAAAsD,aAAAr9U,QACA3E,KAAA0+U,UAAA7lQ,KAAA,2HClSA,aACArlL,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAyzb,oBAAA,EACA,MAAAxH,EAAAhsb,EAAA,WAqCAD,EAAAyzb,eAzBA,SAAAj0b,EAAAurY,EAAA96S,EAAAxV,EAAA,MAAA,IACA,MAAAu5W,EAAAx0b,EAAAy0b,OAAA/lW,IAAA68S,GACA,IAAAipD,EACA,OAAA,IAAA3oW,IAIA,IAAA8jT,EAAA,GAgBA,OAfA6kD,EAAAlzb,SAAA6vF,IACA,MAAA8+V,EAAAjwb,EAAA2vY,MAAAjhT,IAAAyC,GACA8+V,GAGAxD,EAAA2I,kBAAAnF,EAAAx3O,WACAx9H,EAAAkW,IACAw+S,EAAA33T,KAAAmZ,MAIAw+S,EAAA88C,EAAAl8B,QAAA5gB,GACAl/S,EAAA,GAAAk/S,EAAAx9T,OAAAse,IACAk/S,EAAAA,EAAAr9T,MAAA,EAAAme,IAEA,IAAA5E,IAAA8jT,mDCtCA,aACA,IAAAk8C,EAAA3+U,MAAAA,KAAA2+U,kBAAAnrb,OAAAU,OAAA,SAAAg8K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACAb,OAAAC,eAAAy8K,EAAA2hH,EAAA,CAAA9yL,YAAA,EAAAvd,IAAA,WAAA,OAAAtC,EAAA7qF,OACA,SAAA67K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACA67K,EAAA2hH,GAAA3yM,EAAA7qF,KAEAs8b,EAAA3wV,MAAAA,KAAA2wV,cAAA,SAAAzxW,EAAA5rF,GACA,IAAA,IAAA4zE,KAAAgY,EAAA,YAAAhY,GAAA1zE,OAAAmqG,UAAAnD,eAAAoD,KAAAtqG,EAAA4zE,IAAAy3W,EAAArrb,EAAA4rF,EAAAhY,IAEA1zE,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAi9b,EAAAp9b,EAAA,uBAAAD,GACAq9b,EAAAp9b,EAAA,2BAAAD,GACAq9b,EAAAp9b,EAAA,gBAAAD,uHCdA,aACAE,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAsgc,yBAAAtgc,EAAAugc,wBAAAvgc,EAAAwgc,uBAAAxgc,EAAA2tb,sBAAA3tb,EAAAygc,wBAAAzgc,EAAA0gc,4BAAA,EACA,MAAApD,EAAAr9b,EAAA,eAGA0rP,EAAA1rP,EAAA,YA4CA,SAAAugc,EAAA5sX,EAAA,IACA,OAAA1zE,OAAAiqG,OAAAjqG,OAAAiqG,OAAA,GAAAnqG,EAAAygc,yBAAA7sX,GA6CA,SAAA0sX,EAAA1sX,GAEA,GAAAA,EAAA+sX,YAAA,EACA,MAAAh1M,EAAA,IAAAnmJ,MAAA,sCAAA83V,EAAAsD,+BAGA,GAAA,IAAAhtX,EAAAitX,kBACA,MAAAl1M,EAAA,IAAAnmJ,MAAA,+CAAA83V,EAAAsD,+BAEA,GAAAhtX,EAAAktX,iBAAA,EACA,MAAAn1M,EAAA,IAAAnmJ,MAAA,gEAAA83V,EAAAsD,+BAEA,GAAA,IAAAhtX,EAAAktX,kBAAAltX,EAAAitX,mBAAA,EACA,MAAAl1M,EAAA,IAAAnmJ,MAAA,+CAAA83V,EAAAsD,+BAEA,GAAA,IAAAhtX,EAAAktX,kBAAAltX,EAAAmtX,eAAA,EACA,MAAAp1M,EAAA,IAAAnmJ,MAAA,2CAAA83V,EAAAsD,+BAGA,GAAAhtX,EAAAotX,6BAAA,EACA,MAAAr1M,EAAA,IAAAnmJ,MAAA,6EAAA83V,EAAAsD,+BAEA,GAAA,IAAAhtX,EAAAotX,+BAAAptX,EAAAqtX,6BAAA,GAAArtX,EAAAqtX,6BAAA,GACA,MAAAt1M,EAAA,IAAAnmJ,MAAA,gEAAA83V,EAAAsD,+BAEA,GAAA,IAAAhtX,EAAAotX,8BAAAptX,EAAAstX,2BAAA,EACA,MAAAv1M,EAAA,IAAAnmJ,MAAA,uDAAA83V,EAAAsD,+BAGA,GAAAhtX,EAAAutX,4BAAA,EACA,MAAAx1M,EAAA,IAAAnmJ,MAAA,2EAAA83V,EAAAsD,+BAEA,GAAA,IAAAhtX,EAAAutX,8BAAAvtX,EAAAwtX,4BAAA,GAAAxtX,EAAAwtX,4BAAA,GACA,MAAAz1M,EAAA,IAAAnmJ,MAAA,+DAAA83V,EAAAsD,+BAEA,GAAA,IAAAhtX,EAAAutX,6BAAAvtX,EAAAytX,0BAAA,EACA,MAAA11M,EAAA,IAAAnmJ,MAAA,sDAAA83V,EAAAsD,+BAEA,GAAA,IAAAhtX,EAAAutX,6BAAAvtX,EAAA0tX,gCAAA,EACA,MAAA31M,EAAA,IAAAnmJ,MAAA,4DAAA83V,EAAAsD,+BAEA,GAAAhtX,EAAA2tX,4BAAA,EACA,MAAA51M,EAAA,IAAAnmJ,MAAA,6DAAA83V,EAAAsD,+BAEA,GAAA,IAAAhtX,EAAAutX,6BAAAvtX,EAAA4tX,gCAAA,IACA,MAAA71M,EAAA,IAAAnmJ,MAAA,gEAAA83V,EAAAsD,+BAGA,GAAAhtX,EAAA6tX,yBAAA,EACA,MAAA91M,EAAA,IAAAnmJ,MAAA,wEAAA83V,EAAAsD,+BAEA,GAAA,IAAAhtX,EAAA6tX,2BAAA7tX,EAAA8tX,yBAAA,GAAA9tX,EAAA8tX,yBAAA,GACA,MAAA/1M,EAAA,IAAAnmJ,MAAA,4DAAA83V,EAAAsD,+BAGA,GAAAhtX,EAAA+tX,+BAAA,EACA,MAAAh2M,EAAA,IAAAnmJ,MAAA,8EAAA83V,EAAAsD,+BAEA,GAAAhtX,EAAAguX,+BAAA,GAAAhuX,EAAAguX,+BAAA,EACA,MAAAj2M,EAAA,IAAAnmJ,MAAA,kEAAA83V,EAAAsD,+BApJA5gc,EAAA0gc,uBAAA,CACAzM,OAAA,GACA4N,cAAA,GACAC,iBAAA,IAAA,EACAC,kBAAA,GACAC,0BAAA,EACAC,4BAAA,GACAC,4BAAA,IAAA72W,IACA82W,wBAAA,GACAC,sBAAA,GACAC,cAAA,IACAC,YAAA,GACAC,YAAA,MAEAvic,EAAAygc,wBAAA,CACAE,YAAA,GACAG,iBAAA,EACAD,kBAAA,EACAE,cAAA,KACAC,6BAAA,EACAC,4BAAA,GACAC,0BAAA,IACAC,6BAAA,EACAC,2BAAA,GACAC,yBAAA,IACAC,+BAAA,GACAC,4BAAA,GACAC,gCAAA,IACAC,0BAAA,EACAC,wBAAA,GACAC,gCAAA,EACAC,8BAAA,IAWA5hc,EAAA2tb,sBATA,SAAA/5W,EAAA,IACA,OAAA1zE,OAAAiqG,OAAAjqG,OAAAiqG,OAAAjqG,OAAAiqG,OAAA,GAAAnqG,EAAA0gc,wBAAA9sX,GAAA,CAAAqgX,OAAArgX,EAAAqgX,OACA/zb,OAAA0pG,QAAAh2B,EAAAqgX,QACA7hX,QAAA,CAAA6hX,GAAAlpD,EAAAy3D,MACAvO,EAAAlpD,GAAAy1D,EAAAgC,GACAvO,IACA,IACA,MAMAj0b,EAAAwgc,uBAAAA,EA0CAxgc,EAAAugc,wBAxCA,SAAA3sX,GACA,IAAA,MAAAm3T,EAAA9nT,KAAA/iF,OAAA0pG,QAAAh2B,EAAAqgX,QACA,IACAqM,EAAAr9W,GAEA,MAAAxiF,GACA,MAAAkrP,EAAA,IAAAnmJ,MAAA,sCAAAulS,MAAAtqY,EAAA4lF,WAAAi3W,EAAAsD,+BAIA,GAAAhtX,EAAAiuX,cAAA,EACA,MAAAl2M,EAAA,IAAAnmJ,MAAA,+DAAA83V,EAAAsD,+BAGA,GAAA,OAAAhtX,EAAAkuX,uBAAA1/b,IAAAwxE,EAAAkuX,iBACA,MAAAn2M,EAAA,IAAAnmJ,MAAA,+CAAA83V,EAAAsD,+BAGA,GAAAhtX,EAAAouX,yBAAA,EACA,MAAAr2M,EAAA,IAAAnmJ,MAAA,wEAAA83V,EAAAsD,+BAEA,GAAA,IAAAhtX,EAAAouX,0BAAApuX,EAAAquX,4BAAA,EACA,MAAAt2M,EAAA,IAAAnmJ,MAAA,2DAAA83V,EAAAsD,+BAGA,GAAAhtX,EAAAuuX,uBAAA,EACA,MAAAx2M,EAAA,IAAAnmJ,MAAA,sEAAA83V,EAAAsD,+BAEA,GAAA,IAAAhtX,EAAAuuX,yBAAAvuX,EAAAwuX,uBAAA,GAAAxuX,EAAAwuX,uBAAA,GACA,MAAAz2M,EAAA,IAAAnmJ,MAAA,0DAAA83V,EAAAsD,+BAGA,GAAAhtX,EAAAyuX,cAAA,IACA,MAAA12M,EAAA,IAAAnmJ,MAAA,8CAAA83V,EAAAsD,+BAEA,GAAAhtX,EAAA0uX,aAAA,GAAA1uX,EAAA0uX,aAAA,EACA,MAAA32M,EAAA,IAAAnmJ,MAAA,gDAAA83V,EAAAsD,gCAmEA5gc,EAAAsgc,yBAAAA,wEC9JA,aACApgc,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAyic,kCAAAzic,EAAA4gc,mCAAA,EACA5gc,EAAA4gc,8BAAA,gCACA5gc,EAAAyic,kCAAA,kECJA,aAEA,SAAAt4V,EAAAoB,EAAAl4B,GACA,IAAA,MAAA3xE,KAAA2xE,EACAnzE,OAAAC,eAAAorG,EAAA7pG,EAAA,CACAtB,MAAAizE,EAAA3xE,GACA+pG,YAAA,EACAD,cAAA,IAIA,OAAAD,EAmCAxrG,EAAAC,QAhCA,SAAAmmG,EAAApkG,EAAAsxE,GACA,IAAA8yB,GAAA,iBAAAA,EACA,MAAA,IAAAsL,UAAA,oCAGAp+B,IACAA,EAAA,IAGA,iBAAAtxE,IACAsxE,EAAAtxE,EACAA,OAAAK,GAGA,MAAAL,IACAsxE,EAAAtxE,KAAAA,GAGA,IACA,OAAAooG,EAAAhE,EAAA9yB,GACA,MAAAwU,GACAxU,EAAAgT,QAAA8f,EAAA9f,QACAhT,EAAA6wC,MAAA/d,EAAA+d,MAEA,MAAA0nK,EAAA,aAIA,OAFAA,EAAAvhL,UAAAnqG,OAAAU,OAAAV,OAAAywM,eAAAxqG,IAEAgE,EAAA,IAAAyhL,EAAAv4M,mCC1CA,aACAnzE,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAA0ic,4BAAA1ic,EAAA6tb,0BAAA7tb,EAAA2ic,gCAAA,EACA,MAAArF,EAAAr9b,EAAA,eAGA0rP,EAAA1rP,EAAA,YACAD,EAAA2ic,2BAAA,CACAzR,iBAAA,GACAgD,kBAAA,GACAlD,mBAAA,GACAsB,kBAAA,GACA4N,4BAAA,IAKAlgc,EAAA6tb,0BAHA,SAAAj6W,EAAA,IACA,OAAA1zE,OAAAiqG,OAAAjqG,OAAAiqG,OAAA,GAAAnqG,EAAA2ic,4BAAA/uX,IAoBA5zE,EAAA0ic,4BAjBA,SAAA9uX,GACA,GAAAA,EAAAs9W,gBAAA,EACA,MAAAvlM,EAAA,IAAAnmJ,MAAA,6CAAA83V,EAAAmF,mCAEA,GAAA7uX,EAAAsgX,iBAAA,GAAAtgX,EAAAsgX,iBAAAtgX,EAAAs9W,gBACA,MAAAvlM,EAAA,IAAAnmJ,MAAA,sEAAA83V,EAAAmF,mCAEA,GAAA7uX,EAAAo9W,kBAAA,GAAAp9W,EAAAo9W,kBAAAp9W,EAAAsgX,iBACA,MAAAvoM,EAAA,IAAAnmJ,MAAA,wEAAA83V,EAAAmF,mCAEA,GAAA7uX,EAAA0+W,kBAAA,EACA,MAAA3mM,EAAA,IAAAnmJ,MAAA,gDAAA83V,EAAAmF,mCAEA,GAAA7uX,EAAAssX,4BAAA,EACA,MAAAv0M,EAAA,IAAAnmJ,MAAA,6DAAA83V,EAAAmF,0GChCA,aACA,IAAAG,EAAAl2V,MAAAA,KAAAk2V,iBAAA,SAAA5zS,GACA,OAAAA,GAAAA,EAAAtuJ,WAAAsuJ,EAAA,CAAAnvJ,QAAAmvJ,IAEA9uJ,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAqvb,eAAA,EACA,MAAAwT,EAAA5ic,EAAA,uBACA6ic,EAAA7ic,EAAA,gBACA8ic,EAAA9ic,EAAA,mBACA+ic,EAAA/ic,EAAA,wBACAq9b,EAAAr9b,EAAA,gBACAgjc,EAAAL,EAAA3ic,EAAA,YACA0wU,EAAA1wU,EAAA,SACAijc,EAAAjjc,EAAA,wCACA44b,sBAAAA,EAAAF,sBAAAA,GAAAuK,EAAA36N,MACAxP,EAAA43G,EAAA,0BAqeA3wU,EAAAqvb,UApeA,MACA9rb,YAAA0/E,EAAA6nW,EAAAmN,GACA4K,EAAAtC,wBAAAt9W,GACAypB,KAAAzpB,OAAAA,EACAypB,KAAAy2V,mBAAArY,EACAp+U,KAAA02V,UAAA,IAAA1zW,IACAgd,KAAA22V,QAAA,IAAA3zW,IACAgd,KAAA42V,gBAAA,IAAAN,EAAAO,kBACA72V,KAAAurV,MAAAA,EAMA10b,QACAmpG,KAAA82V,oBACAzqO,EAAA,+BAGArsH,KAAA82V,oBAAA7vF,aAAA,IAAAjnQ,KAAA+2V,cAAA/2V,KAAAzpB,OAAAo/W,eACAtpO,EAAA,YAMAx1N,OACAmpG,KAAA82V,qBAIAlwF,cAAA5mQ,KAAA82V,4BACA92V,KAAA82V,oBACA92V,KAAA22V,QAAAvpS,QACAptD,KAAA02V,UAAAtpS,QACAptD,KAAA42V,gBAAAxpS,QACAi/D,EAAA,YARAA,EAAA,8BAcAx1N,aACAmpG,KAAAg3V,iBACAh3V,KAAAi3V,aACAj3V,KAAA42V,gBAAAtnC,KAMAz4Z,iBACA,MAAAyuK,EAAAvnE,KAAAunE,MACAswR,EAAA51V,KAAAzpB,OAAAq/W,YACA51V,KAAA02V,UAAAtic,SAAA,CAAA8ic,EAAAjzW,KACAizW,EAAAC,WAaA3jc,OAAA0pG,QAAAg6V,EAAA3P,QAAAnzb,SAAA,EAAAiqY,EAAA+4D,MACA,MAAAC,EAAAr3V,KAAAzpB,OAAAgxW,OAAAlpD,GACAg5D,IAMAD,EAAAE,wBAAAD,EAAA9C,4BACA6C,EAAAE,uBAAA1B,IACAwB,EAAAE,uBAAA,GAEAF,EAAAG,uBAAAF,EAAA3C,2BACA0C,EAAAG,sBAAA3B,IACAwB,EAAAG,sBAAA,GAEAH,EAAAI,oBAAAH,EAAArC,wBACAoC,EAAAI,mBAAA5B,IACAwB,EAAAI,mBAAA,GAEAJ,EAAAK,0BAAAJ,EAAAnC,8BACAkC,EAAAK,yBAAA7B,IACAwB,EAAAK,yBAAA,GAGAL,EAAAM,SACAN,EAAAO,SAAAryR,EAAA8xR,EAAAQ,UACAR,EAAAO,SAAAN,EAAAvC,kCACAsC,EAAAS,6BAAA,QAKAX,EAAAY,kBAAA93V,KAAAzpB,OAAAm/W,sBACAwB,EAAAY,iBAAAlC,IACAsB,EAAAY,iBAAA,IA9CAxyR,EAAA4xR,EAAAxyF,SAEA1kQ,KAAA+3V,WAAA9zW,EAAAizW,EAAAc,KACAh4V,KAAA02V,UAAAjzW,OAAAQ,OAoDAptF,MAAAotF,GACA,MAAAizW,EAAAl3V,KAAA02V,UAAAl1W,IAAAyC,GACA,OAAAizW,EAGAb,EAAA4B,aAAAh0W,EAAAizW,EAAAl3V,KAAAzpB,OAAAypB,KAAA22V,SAFA,EAUA9/b,WAAAotF,EAAAi0W,GACA,MAAAhB,EAAAl3V,KAAA02V,UAAAl1W,IAAAyC,GACAizW,IAGAA,EAAAY,kBAAAI,GAMArhc,QAAAotF,GAGA,MAAAizW,EAAAd,EAAA+B,gBAAA,CACAhB,WAAA,IAEAn3V,KAAA02V,UAAAj1W,IAAAwC,EAAAizW,GAEA,MAAAc,EAAAh4V,KAAAo4V,QAAAn0W,GACA+b,KAAAq4V,QAAAp0W,EAAA+zW,EAAAd,EAAAc,KACAd,EAAAc,IAAAA,EAMAnhc,WAAAotF,GACA,MAAAizW,EAAAl3V,KAAA02V,UAAAl1W,IAAAyC,GACA,GAAAizW,EAAA,CAKA,GAAAl3V,KAAA6uG,MAAA5qH,GAAA,EAGA,OAFA+b,KAAA+3V,WAAA9zW,EAAAizW,EAAAc,UACAh4V,KAAA02V,UAAAjzW,OAAAQ,GAKAzwF,OAAA0pG,QAAAg6V,EAAA3P,QAAAnzb,SAAA,EAAAiqY,EAAA+4D,MACAA,EAAAE,uBAAA,EACA,MAAAjgD,EAAAr3S,KAAAzpB,OAAAgxW,OAAAlpD,GAAAu2D,+BACA,GAAAwC,EAAAM,QAAAN,EAAAS,6BAAAT,EAAAG,sBAAAlgD,EAAA,CACA,MAAAihD,EAAAjhD,EAAA+/C,EAAAG,sBACAH,EAAAI,oBAAAc,EAAAA,EAEAlB,EAAAM,QAAA,KAEAR,EAAAC,WAAA,EACAD,EAAAxyF,OAAA3mQ,KAAAunE,MAAAtlE,KAAAzpB,OAAAs/W,aAOAh/b,MAAAotF,EAAAo6S,GACA,MAAA64D,EAAAl3V,KAAA02V,UAAAl1W,IAAAyC,GACA,IAAAizW,EACA,OAEA,MAAAE,EAAAhB,EAAAmC,iBAAAl6D,EAAA64D,EAAAl3V,KAAAzpB,QACA6gX,IAGAA,EAAAM,QAAA,EACAN,EAAAQ,UAAA75V,KAAAunE,MACA8xR,EAAAO,SAAA,EACAP,EAAAS,6BAAA,GAOAhhc,MAAAotF,EAAAo6S,GACA,MAAA64D,EAAAl3V,KAAA02V,UAAAl1W,IAAAyC,GACA,IAAAizW,EACA,OAEA,MAAAE,EAAAhB,EAAAmC,iBAAAl6D,EAAA64D,EAAAl3V,KAAAzpB,QACA,IAAA6gX,EACA,OAGA,MAAA//C,EAAAr3S,KAAAzpB,OAAAgxW,OAAAlpD,GAAAu2D,+BACA,GAAAwC,EAAAS,6BAAAT,EAAAG,sBAAAlgD,EAAA,CACA,MAAAihD,EAAAjhD,EAAA+/C,EAAAG,sBACAH,EAAAI,oBAAAc,EAAAA,EAEAlB,EAAAM,QAAA,EAMA7gc,gBAAA8iF,GACAqmB,KAAA42V,gBAAA4B,aAAAx4V,KAAAurV,MAAA5xW,IAMA9iF,eAAA8iF,GACA,MAAAsK,EAAAtK,EAAAwtW,aACAnnV,KAAAy4V,0BAAAx0W,EAAAtK,GACA,MAAA++W,EAAA14V,KAAA42V,gBAAA4B,aAAAx4V,KAAAurV,MAAA5xW,IACA2rF,EAAAvnE,KAAAunE,MAEAozR,EAAA/8O,SAAA26O,EAAAqC,qBAAA3rP,SAKA0rP,EAAA/8O,OAAA26O,EAAAqC,qBAAAvrT,MACAsrT,EAAAE,UAAAtzR,EACAozR,EAAAj2D,MAAAruY,SAAA8yE,IAGAA,IAAA+c,GACA+b,KAAA64V,8BAAA3xX,EAAAyS,OAVA0yI,EAAA,wFAAApoI,EAAAqhF,EAAAozR,EAAAI,UAAAxC,EAAAqC,qBAAAD,EAAA/8O,SAmBA9kN,cAAA8iF,EAAAi8N,GACA,MAAA3xN,EAAAtK,EAAAwtW,aACA,OAAAvxI,GACA,KAAAq2I,EACA,KAAAE,EAEA,YADAnsV,KAAA+4V,4BAAA90W,EAAAtK,GAGA,MAAA++W,EAAA14V,KAAA42V,gBAAA4B,aAAAx4V,KAAAurV,MAAA5xW,IAEA,GAAA++W,EAAA/8O,SAAA26O,EAAAqC,qBAAA3rP,QAAA,CAIA,OAAA4oG,GACA,KAAAg7I,EAAAC,2BAGA,YADA6H,EAAA/8O,OAAA26O,EAAAqC,qBAAAK,SAIAN,EAAA/8O,OAAA26O,EAAAqC,qBAAAtrT,QACArtC,KAAA+4V,4BAAA90W,EAAAtK,GACA++W,EAAAj2D,MAAAruY,SAAA8yE,IACA84B,KAAA+4V,4BAAA7xX,EAAAyS,WAbA0yI,EAAA,yFAAApoI,EAAA8Z,KAAAunE,MAAAozR,EAAAI,UAAAxC,EAAAqC,qBAAAD,EAAA/8O,SAoBA9kN,iBAAA8iF,GACA,MAAAsK,EAAAtK,EAAAwtW,aACAuR,EAAA14V,KAAA42V,gBAAA4B,aAAAx4V,KAAAurV,MAAA5xW,IACA,IAAA++W,EAAAj2D,MAAA1jT,IAAAkF,GAIA,OAAAy0W,EAAA/8O,QACA,KAAA26O,EAAAqC,qBAAA3rP,QAGA0rP,EAAAj2D,MAAAzjT,IAAAiF,GACA,MACA,KAAAqyW,EAAAqC,qBAAAvrT,MAEAsrT,EAAAj2D,MAAAzjT,IAAAiF,GACA+b,KAAA64V,8BAAA50W,EAAAtK,EAAA++W,EAAAE,WACA,MACA,KAAAtC,EAAAqC,qBAAAtrT,QAEArtC,KAAA+4V,4BAAA90W,EAAAtK,IAUA9iF,4BAAAotF,EAAAtK,GACA,MAAAu9W,EAAAl3V,KAAA02V,UAAAl1W,IAAAyC,GACAizW,GAGAv9W,EAAAikT,SAAAxpY,SAAAiqY,IACA,MAAA+4D,EAAAhB,EAAAmC,iBAAAl6D,EAAA64D,EAAAl3V,KAAAzpB,QACA6gX,IAGAA,EAAAK,0BAAA,MAUA5gc,0BAAAotF,EAAAtK,GACA,MAAAu9W,EAAAl3V,KAAA02V,UAAAl1W,IAAAyC,GACAizW,GAGAv9W,EAAAikT,SAAAxpY,SAAAiqY,IACA,MAAA+4D,EAAAhB,EAAAmC,iBAAAl6D,EAAA64D,EAAAl3V,KAAAzpB,QACA,IAAA6gX,EACA,OAEA,IAAAzmU,EAAA3wB,KAAAzpB,OAAAgxW,OAAAlpD,GAAAm2D,0BACA4C,EAAAE,wBAAA,EACAF,EAAAE,uBAAA3mU,IACAymU,EAAAE,uBAAA3mU,GAEAymU,EAAAM,SAGA/mU,EAAA3wB,KAAAzpB,OAAAgxW,OAAAlpD,GAAAs2D,yBACAyC,EAAAG,uBAAA,EACAH,EAAAG,sBAAA5mU,IACAymU,EAAAG,sBAAA5mU,OAYA95H,8BAAAotF,EAAAtK,EAAAs/W,EAAA,GACA,MAAA/B,EAAAl3V,KAAA02V,UAAAl1W,IAAAyC,GACA,IAAAizW,EACA,OAEA,MAAA5xR,EAAA2zR,EAAAl7V,KAAAunE,MAAA,EACA3rF,EAAAikT,SAAAxpY,SAAAiqY,IACA,MAAA+4D,EAAAhB,EAAAmC,iBAAAl6D,EAAA64D,EAAAl3V,KAAAzpB,QACA,IAAA6gX,EACA,OAEA,IAAAA,EAAAM,OACA,OAEA,MAAAL,EAAAr3V,KAAAzpB,OAAAgxW,OAAAlpD,GAIA,GAAA46D,GAAA3zR,EAAA2zR,EAAA5B,EAAAxC,4BACA,OAEA,MAAAlkU,EAAA0mU,EAAA1C,yBACAyC,EAAAG,uBAAA,EACAH,EAAAG,sBAAA5mU,IACAymU,EAAAG,sBAAA5mU,MASA95H,QAAAotF,GACA,OAAA+b,KAAAy2V,mBAAAr6H,OAAAm6H,EAAApjc,QAAAsnO,oBAAAx2I,IACA7Z,KAAAqC,GAAAA,EAAAysX,WAAAC,YAAA3zV,OASA3uG,QAAAotF,EAAAm1W,EAAAC,GAGAC,EAAA,IAAA,MAAA/+L,KAAA6+L,EAAA,CAEA,IAAA,MAAAG,KAAAF,EACA,GAAA9+L,IAAAg/L,EAEA,SAAAD,EAIA,IAAA72D,EAAAziS,KAAA22V,QAAAn1W,IAAA+4K,GACAkoI,IACAA,EAAA,IAAA9jT,IACAqhB,KAAA22V,QAAAl1W,IAAA84K,EAAAkoI,IAEAA,EAAAzjT,IAAAiF,GAIAu1W,EAAA,IAAA,MAAAj/L,KAAA8+L,EAAA,CAEA,IAAA,MAAAE,KAAAH,EACA,GAAA7+L,IAAAg/L,EAEA,SAAAC,EAIA,MAAA/2D,EAAAziS,KAAA22V,QAAAn1W,IAAA+4K,GACAkoI,IAGAA,EAAAh/S,OAAAQ,GACAw+S,EAAAxlS,MACA+C,KAAA22V,QAAAlzW,OAAA82K,KAUA1jQ,WAAAotF,EAAA+zW,GACAA,EAAA5jc,SAAAmmQ,IACA,MAAAkoI,EAAAziS,KAAA22V,QAAAn1W,IAAA+4K,GACAkoI,IAGAA,EAAAh/S,OAAAQ,GACAw+S,EAAAxlS,MACA+C,KAAA22V,QAAAlzW,OAAA82K,OAQA1jQ,aACAmpG,KAAA02V,UAAAtic,SAAA,CAAA8ic,EAAAjzW,KACA,MAAAm1W,EAAAp5V,KAAAo4V,QAAAn0W,GACA+b,KAAAq4V,QAAAp0W,EAAAm1W,EAAAlC,EAAAc,KACAd,EAAAc,IAAAoB,uPChfA,aAaA,SAAAK,EAAA9+K,EAAA,IACA,OAAAnnR,OAAAiqG,OAAA,CAAAi6V,QAAA,EAAAE,UAAA,EAAAD,SAAA,EAAAL,uBAAA,EAAAC,sBAAA,EAAAM,6BAAA,EAAAL,mBAAA,EAAAC,yBAAA,GAAA98K,GAbAnnR,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAilc,iBAAAjlc,EAAAmmc,iBAAAnmc,EAAA6kc,qBAAA,EAUA7kc,EAAA6kc,gBATA,SAAAlgG,EAAA,IACA,OAAAzkW,OAAAiqG,OAAAjqG,OAAAiqG,OAAA,CAAA05V,WAAA,EAAAzyF,OAAA,EAAAszF,IAAA,GAAAF,iBAAA,GAAA7/F,GAAA,CAAAsvF,OAAAtvF,EAAAsvF,OACA/zb,OAAA0pG,QAAA+6P,EAAAsvF,QACA7hX,QAAA,CAAA6hX,GAAAlpD,EAAAq7D,MACAnS,EAAAlpD,GAAAo7D,EAAAC,GACAnS,IACA,IACA,MAMAj0b,EAAAmmc,iBAAAA,EAYAnmc,EAAAilc,iBAXA,SAAAl6D,EAAApmC,EAAA1hR,GACA,IAAAokM,EAAAs9E,EAAAsvF,OAAAlpD,GACA,OAAA1jH,IAGApkM,EAAAgxW,OAAAlpD,IAGApmC,EAAAsvF,OAAAlpD,GAAA1jH,EAAA8+K,IACA9+K,QAJA,gCCtBA,aACAnnR,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAA2kc,kBAAA,EAsEA3kc,EAAA2kc,aArEA,SAAAne,EAAAod,EAAA3gX,EAAAogX,GACA,IAAA9nP,EAAA,EAEAr7M,OAAA0pG,QAAAg6V,EAAA3P,QAAAnzb,SAAA,EAAAiqY,EAAA+4D,MAEA,MAAAuC,EAAApjX,EAAAgxW,OAAAlpD,GACA,IAAAs7D,EAEA,OAEA,IAAAC,EAAA,EAEA,GAAAxC,EAAAM,OAAA,CACA,IAAAt8W,EAAAg8W,EAAAO,SAAAgC,EAAAxF,kBACA/4W,EAAAu+W,EAAAtF,gBACAj5W,EAAAu+W,EAAAtF,eAEAuF,GAAAx+W,EAAAu+W,EAAAvF,iBAMA,GAFAwF,GADAxC,EAAAE,uBACAqC,EAAArF,6BAEA8C,EAAAS,6BACAT,EAAAG,sBAAAoC,EAAA/E,+BAAA,CACA,MAAA0D,EAAAqB,EAAA/E,+BAAAwC,EAAAG,sBAEAqC,GADAtB,EAAAA,EACAqB,EAAAlF,4BAMAmF,GADAxC,EAAAI,mBACAmC,EAAA5E,yBAIA6E,GADAxC,EAAAK,yBAAAL,EAAAK,yBACAkC,EAAA1E,+BAEApmP,GAAA+qP,EAAAD,EAAA1F,eAGA19W,EAAA4+W,cAAA,GAAAtmP,EAAAt4H,EAAA4+W,gBACAtmP,EAAAt4H,EAAA4+W,eAGA,MAAA0E,EAAAtjX,EAAA6+W,iBAAAtb,GACAjrO,GAAAgrP,EAAAtjX,EAAA8+W,kBAEA6B,EAAAc,IAAA5jc,SAAAmmQ,IACA,GAAAhkL,EAAAi/W,4BAAAz2W,IAAAw7K,GACA,OAKA,MAAAu/L,EAAAnD,EAAAn1W,IAAA+4K,GACAw/L,EAAAD,EAAAA,EAAA78V,KAAA,EACA,GAAA88V,EAAAxjX,EAAAg/W,4BAAA,CACA,MAAAyE,EAAAD,EAAAxjX,EAAAg/W,4BAEA1mP,GADAmrP,EAAAA,EACAzjX,EAAA++W,6BAIA,MAAA2E,EAAA/C,EAAAY,iBAAAZ,EAAAY,iBAEA,OADAjpP,GAAAorP,EAAA1jX,EAAAk/W,uBACA5mP,iCCtEA,aACA,IAAAqnP,EAAAl2V,MAAAA,KAAAk2V,iBAAA,SAAA5zS,GACA,OAAAA,GAAAA,EAAAtuJ,WAAAsuJ,EAAA,CAAAnvJ,QAAAmvJ,IAEA9uJ,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAujc,kBAAAvjc,EAAAqlc,0BAAA,EACA,MAAA/H,EAAAr9b,EAAA,gBACA2mc,EAAAhE,EAAA3ic,EAAA,WACAgsb,EAAAhsb,EAAA,YACA,IAAAolc,GACA,SAAAA,GAIAA,EAAAA,EAAA,QAAA,GAAA,UAIAA,EAAAA,EAAA,MAAA,GAAA,QAIAA,EAAAA,EAAA,QAAA,GAAA,UAIAA,EAAAA,EAAA,QAAA,GAAA,UAhBA,CAiBAA,EAAArlc,EAAAqlc,uBAAArlc,EAAAqlc,qBAAA,KAkDArlc,EAAAujc,kBA5CA,MACAhgc,cACAmpG,KAAAi+R,QAAA,IAAAj7S,IACAgd,KAAAi3E,MAAA,IAAAijR,EAAA/mc,QAEA0D,aAAA00b,GACA,MAAArH,EAAA3E,EAAA4E,kBAAAoH,GACA,IAAAmN,EAAA14V,KAAAi+R,QAAAz8S,IAAA0iW,GACA,GAAAwU,EACA,OAAAA,EAIAA,EAAA,CACA/8O,OAAAg9O,EAAA3rP,QACA8rP,UAAA/6V,KAAAunE,MACAszR,UAAA,EACAn2D,MAAA,IAAA9jT,KAEAqhB,KAAAi+R,QAAAx8S,IAAAyiW,EAAAwU,GAEA,MAAA3iR,EAAA,CACAw1Q,MAAArH,EACAx/E,OAAA3mQ,KAAAunE,MAAAsrR,EAAAG,mBAGA,OADA/wV,KAAAi3E,MAAAnsG,KAAAirG,GACA2iR,EAEA7hc,KACA,MAAAyuK,EAAAvnE,KAAAunE,MAGA,IAAAjgG,EAAA26B,KAAAi3E,MAAAkjR,YACA,KAAA90X,GAAAA,EAAAq/R,OAAAp/L,GACAtlE,KAAAi+R,QAAAx6S,OAAApe,EAAAkmX,OACAvrV,KAAAi3E,MAAAtyE,QACAt/B,EAAA26B,KAAAi3E,MAAAkjR,YAGAtjc,QACAmpG,KAAAi+R,QAAA7wO,QACAptD,KAAAi3E,MAAA7pB,gGC1EA,aAKA,SAAAgtS,EAAAllO,EAAAvgO,GACAA,EAAAA,GAAA,GAEAqrG,KAAAq6V,MAAA,EACAr6V,KAAAs6V,MAAA,EACAt6V,KAAAu6V,UAAA5lc,EAAA6lc,SACAx6V,KAAAy6V,cAAA,EACAz6V,KAAA06V,MAAA,IAAA78V,MAAA,GACAA,MAAA/gB,QAAAo4I,IACAl1H,KAAA26V,WAAAzlO,GAkBAklO,EAAAz8V,UAAAi9V,OAAA,SAAAr1X,GACA,IAAA4B,EAAA5B,EAEA,GAAA4B,KAAA,EAAAA,GAAA,CAGA,IAAAi8B,EAAApD,KAAA/C,OACA,KAAA91B,GAAAi8B,GAAAj8B,GAAAi8B,GAGA,OAFAj8B,EAAA,IAAAA,GAAAi8B,GACAj8B,EAAA64B,KAAAq6V,MAAAlzX,EAAA64B,KAAAy6V,cACAz6V,KAAA06V,MAAAvzX,KAQAizX,EAAAz8V,UAAAnc,IAAA,SAAAra,GACA,OAAA64B,KAAA46V,OAAAzzX,IAOAizX,EAAAz8V,UAAAkgT,KAAA,WACA,GAAA79S,KAAAq6V,QAAAr6V,KAAAs6V,MACA,OAAAt6V,KAAA06V,MAAA16V,KAAAq6V,QAOAD,EAAAz8V,UAAAw8V,UAAA,WACA,OAAAn6V,KAAA69S,QAOAu8C,EAAAz8V,UAAAk9V,SAAA,WACA,OAAA76V,KAAA46V,QAAA,IAOApnc,OAAAC,eAAA2mc,EAAAz8V,UAAA,SAAA,CACAnc,IAAA,WACA,OAAAwe,KAAA/C,UAQAm9V,EAAAz8V,UAAAV,KAAA,WACA,OAAA+C,KAAAq6V,QAAAr6V,KAAAs6V,MAAA,EACAt6V,KAAAq6V,MAAAr6V,KAAAs6V,MAAAt6V,KAAAs6V,MAAAt6V,KAAAq6V,MACAr6V,KAAAy6V,cAAA,GAAAz6V,KAAAq6V,MAAAr6V,KAAAs6V,QAOAF,EAAAz8V,UAAA7kB,QAAA,SAAAmiB,GACA,QAAAvlG,IAAAulG,EAAA,OAAA+E,KAAA/C,OACA,IAAAmG,EAAApD,KAAA06V,MAAAz1X,OAKA,OAJA+6B,KAAAq6V,MAAAr6V,KAAAq6V,MAAA,EAAAj3V,EAAApD,KAAAy6V,cACAz6V,KAAA06V,MAAA16V,KAAAq6V,OAAAp/V,EACA+E,KAAAs6V,QAAAt6V,KAAAq6V,OAAAr6V,KAAA86V,aACA96V,KAAAu6V,WAAAv6V,KAAA/C,OAAA+C,KAAAu6V,WAAAv6V,KAAA/hB,MACA+hB,KAAAq6V,MAAAr6V,KAAAs6V,MAAAt6V,KAAAs6V,MAAAt6V,KAAAq6V,MACAr6V,KAAAy6V,cAAA,GAAAz6V,KAAAq6V,MAAAr6V,KAAAs6V,QAQAF,EAAAz8V,UAAAgH,MAAA,WACA,IAAAt/B,EAAA26B,KAAAq6V,MACA,GAAAh1X,IAAA26B,KAAAs6V,MAAA,CACA,IAAAr/V,EAAA+E,KAAA06V,MAAAr1X,GAIA,OAHA26B,KAAA06V,MAAAr1X,QAAA3vE,EACAsqG,KAAAq6V,MAAAh1X,EAAA,EAAA26B,KAAAy6V,cACAp1X,EAAA,GAAA26B,KAAAs6V,MAAA,KAAAt6V,KAAAs6V,OAAAt6V,KAAA06V,MAAAz1X,SAAA,GAAA+6B,KAAA+6V,eACA9/V,IAOAm/V,EAAAz8V,UAAA7yB,KAAA,SAAAmwB,GACA,QAAAvlG,IAAAulG,EAAA,OAAA+E,KAAA/C,OACA,IAAA47D,EAAA74D,KAAAs6V,MASA,OARAt6V,KAAA06V,MAAA7hS,GAAA59D,EACA+E,KAAAs6V,MAAAzhS,EAAA,EAAA74D,KAAAy6V,cACAz6V,KAAAs6V,QAAAt6V,KAAAq6V,OACAr6V,KAAA86V,aAEA96V,KAAAu6V,WAAAv6V,KAAA/C,OAAA+C,KAAAu6V,WACAv6V,KAAA2E,QAEA3E,KAAAq6V,MAAAr6V,KAAAs6V,MAAAt6V,KAAAs6V,MAAAt6V,KAAAq6V,MACAr6V,KAAAy6V,cAAA,GAAAz6V,KAAAq6V,MAAAr6V,KAAAs6V,QAQAF,EAAAz8V,UAAA1f,IAAA,WACA,IAAA46E,EAAA74D,KAAAs6V,MACA,GAAAzhS,IAAA74D,KAAAq6V,MAAA,CACA,IAAAj3V,EAAApD,KAAA06V,MAAAz1X,OACA+6B,KAAAs6V,MAAAzhS,EAAA,EAAAz1D,EAAApD,KAAAy6V,cACA,IAAAx/V,EAAA+E,KAAA06V,MAAA16V,KAAAs6V,OAGA,OAFAt6V,KAAA06V,MAAA16V,KAAAs6V,YAAA5kc,EACAsqG,KAAAq6V,MAAA,GAAAxhS,EAAA,KAAAA,GAAAz1D,IAAA,GAAApD,KAAA+6V,eACA9/V,IASAm/V,EAAAz8V,UAAAq9V,UAAA,SAAAz1X,GACA,IAAA4B,EAAA5B,EAEA,GAAA4B,KAAA,EAAAA,IAGA64B,KAAAq6V,QAAAr6V,KAAAs6V,MAAA,CACA,IAAAr9V,EAAA+C,KAAA/C,OACAmG,EAAApD,KAAA06V,MAAAz1X,OACA,KAAAkC,GAAA81B,GAAA91B,GAAA81B,GAAA,CACA91B,EAAA,IAAAA,GAAA81B,GACA91B,EAAA64B,KAAAq6V,MAAAlzX,EAAA64B,KAAAy6V,cACA,IACApmc,EADA4mG,EAAA+E,KAAA06V,MAAAvzX,GAEA,GAAA5B,EAAA03B,EAAA,EAAA,CACA,IAAA5oG,EAAAkxE,EAAAlxE,EAAA,EAAAA,IACA2rG,KAAA06V,MAAAvzX,GAAA64B,KAAA06V,MAAAvzX,EAAAA,EAAA,EAAAi8B,EAAApD,KAAAy6V,eAEAz6V,KAAA06V,MAAAvzX,QAAA,EACA64B,KAAAq6V,MAAAr6V,KAAAq6V,MAAA,EAAAj3V,EAAApD,KAAAy6V,kBACA,CACA,IAAApmc,EAAA4oG,EAAA,EAAA13B,EAAAlxE,EAAA,EAAAA,IACA2rG,KAAA06V,MAAAvzX,GAAA64B,KAAA06V,MAAAvzX,EAAAA,EAAA,EAAAi8B,EAAApD,KAAAy6V,eAEAz6V,KAAA06V,MAAAvzX,QAAA,EACA64B,KAAAs6V,MAAAt6V,KAAAs6V,MAAA,EAAAl3V,EAAApD,KAAAy6V,cAEA,OAAAx/V,KAWAm/V,EAAAz8V,UAAAD,OAAA,SAAAn4B,EAAAge,GACA,IACAm/E,EADAv7F,EAAA5B,EAEA01X,EAAA13W,EAEA,GAAApc,KAAA,EAAAA,IAGA64B,KAAAq6V,QAAAr6V,KAAAs6V,MAAA,CACA,IAAAr9V,EAAA+C,KAAA/C,OACAmG,EAAApD,KAAA06V,MAAAz1X,OACA,KAAAkC,GAAA81B,GAAA91B,GAAA81B,GAAA1Z,EAAA,GAAA,CAEA,GADApc,EAAA,IAAAA,GAAA81B,GACA,IAAA1Z,IAAAA,EAGA,OAFAm/E,EAAA,IAAA7kE,MAAA,IACA,GAAAmC,KAAAg7V,UAAA7zX,GACAu7F,EAEA,GAAA,IAAAv7F,GAAAA,EAAAoc,GAAA0Z,EAGA,OAFAylE,EAAA1iE,KAAAmD,UACAnD,KAAAotD,QACAsV,EAGA,IAAAruK,EAEA,IAHA8yE,EAAAoc,EAAA0Z,IAAA1Z,EAAA0Z,EAAA91B,GAEAu7F,EAAA,IAAA7kE,MAAAta,GACAlvF,EAAA,EAAAA,EAAAkvF,EAAAlvF,IACAquK,EAAAruK,GAAA2rG,KAAA06V,MAAA16V,KAAAq6V,MAAAlzX,EAAA9yE,EAAA2rG,KAAAy6V,eAGA,GADAtzX,EAAA64B,KAAAq6V,MAAAlzX,EAAA64B,KAAAy6V,cACAl1X,EAAAge,IAAA0Z,EAAA,CAEA,IADA+C,KAAAs6V,MAAAt6V,KAAAs6V,MAAA/2W,EAAA6f,EAAApD,KAAAy6V,cACApmc,EAAAkvF,EAAAlvF,EAAA,EAAAA,IACA2rG,KAAA06V,MAAAvzX,EAAAA,EAAA,EAAAi8B,EAAApD,KAAAy6V,oBAAA,EAEA,OAAA/3R,EAEA,GAAA,IAAAn9F,EAAA,CAEA,IADAy6B,KAAAq6V,MAAAr6V,KAAAq6V,MAAA92W,EAAA6f,EAAApD,KAAAy6V,cACApmc,EAAAkvF,EAAA,EAAAlvF,EAAA,EAAAA,IACA2rG,KAAA06V,MAAAvzX,EAAAA,EAAA,EAAAi8B,EAAApD,KAAAy6V,oBAAA,EAEA,OAAA/3R,EAEA,GAAAv7F,EAAA81B,EAAA,EAAA,CAEA,IADA+C,KAAAq6V,MAAAr6V,KAAAq6V,MAAA90X,EAAAge,EAAA6f,EAAApD,KAAAy6V,cACApmc,EAAAkxE,EAAAlxE,EAAA,EAAAA,IACA2rG,KAAAlnB,QAAAknB,KAAA06V,MAAAvzX,EAAAA,EAAA,EAAAi8B,EAAApD,KAAAy6V,gBAGA,IADAtzX,EAAA64B,KAAAq6V,MAAA,EAAAj3V,EAAApD,KAAAy6V,cACAQ,EAAA,GACAj7V,KAAA06V,MAAAvzX,EAAAA,EAAA,EAAAi8B,EAAApD,KAAAy6V,oBAAA,EACAQ,IAEA11X,EAAA,IAAAy6B,KAAAs6V,MAAAnzX,OACA,CAGA,IAFA64B,KAAAs6V,MAAAnzX,EACAA,EAAAA,EAAAoc,EAAA6f,EAAApD,KAAAy6V,cACApmc,EAAA4oG,GAAA1Z,EAAAhe,GAAAlxE,EAAA,EAAAA,IACA2rG,KAAAl1B,KAAAk1B,KAAA06V,MAAAvzX,MAGA,IADAA,EAAA64B,KAAAs6V,MACAW,EAAA,GACAj7V,KAAA06V,MAAAvzX,EAAAA,EAAA,EAAAi8B,EAAApD,KAAAy6V,oBAAA,EACAQ,IAIA,OADAj7V,KAAAq6V,MAAA,GAAAr6V,KAAAs6V,MAAA,KAAAt6V,KAAAs6V,OAAAl3V,IAAA,GAAApD,KAAA+6V,eACAr4R,KAcA03R,EAAAz8V,UAAAlzB,OAAA,SAAAlF,EAAAge,GACA,IAAApc,EAAA5B,EAEA,GAAA4B,KAAA,EAAAA,GAAA,CAGA,IAAA81B,EAAA+C,KAAA/C,OAEA,GADA91B,EAAA,IAAAA,GAAA81B,KACA91B,EAAA81B,GAAA,CACA,GAAA5mB,UAAApR,OAAA,EAAA,CACA,IAAA5wE,EACAo3G,EACAi3D,EACAw4R,EAAA7kX,UAAApR,OACAm+B,EAAApD,KAAA06V,MAAAz1X,OACAk2X,EAAA,EACA,IAAAl+V,GAAA91B,EAAA81B,EAAA,EAAA,CAEA,IADAwO,EAAA,IAAA5N,MAAA12B,GACA9yE,EAAA,EAAAA,EAAA8yE,EAAA9yE,IACAo3G,EAAAp3G,GAAA2rG,KAAA06V,MAAA16V,KAAAq6V,MAAAhmc,EAAA2rG,KAAAy6V,eAWA,IATA,IAAAl3W,GACAm/E,EAAA,GACAv7F,EAAA,IACA64B,KAAAq6V,MAAAr6V,KAAAq6V,MAAAlzX,EAAAi8B,EAAApD,KAAAy6V,iBAGA/3R,EAAA1iE,KAAAtC,OAAAv2B,EAAAoc,GACAyc,KAAAq6V,MAAAr6V,KAAAq6V,MAAAlzX,EAAAi8B,EAAApD,KAAAy6V,eAEAS,EAAAC,GACAn7V,KAAAlnB,QAAAzC,YAAA6kX,IAEA,IAAA7mc,EAAA8yE,EAAA9yE,EAAA,EAAAA,IACA2rG,KAAAlnB,QAAA2yB,EAAAp3G,EAAA,QAEA,CAEA,IAAA+mc,GADA3vV,EAAA,IAAA5N,MAAAZ,GAAA91B,EAAAoc,KACAte,OACA,IAAA5wE,EAAA,EAAAA,EAAA+mc,EAAA/mc,IACAo3G,EAAAp3G,GAAA2rG,KAAA06V,MAAA16V,KAAAq6V,MAAAlzX,EAAAoc,EAAAlvF,EAAA2rG,KAAAy6V,eAWA,IATA,IAAAl3W,GACAm/E,EAAA,GACAv7F,GAAA81B,IACA+C,KAAAs6V,MAAAt6V,KAAAq6V,MAAAlzX,EAAAi8B,EAAApD,KAAAy6V,iBAGA/3R,EAAA1iE,KAAAtC,OAAAv2B,EAAAoc,GACAyc,KAAAs6V,MAAAt6V,KAAAs6V,MAAAc,EAAAh4V,EAAApD,KAAAy6V,eAEAU,EAAAD,GACAl7V,KAAAl1B,KAAAuL,UAAA8kX,MAEA,IAAA9mc,EAAA,EAAAA,EAAA+mc,EAAA/mc,IACA2rG,KAAAl1B,KAAA2gC,EAAAp3G,IAGA,OAAAquK,EAEA,OAAA1iE,KAAAtC,OAAAv2B,EAAAoc,MAOA62W,EAAAz8V,UAAAyvD,MAAA,WACAptD,KAAAq6V,MAAA,EACAr6V,KAAAs6V,MAAA,GAOAF,EAAAz8V,UAAAu2J,QAAA,WACA,OAAAl0J,KAAAq6V,QAAAr6V,KAAAs6V,OAOAF,EAAAz8V,UAAAwF,QAAA,WACA,OAAAnD,KAAAq7V,YAAA,IAeAjB,EAAAz8V,UAAAg9V,WAAA,SAAAzlO,GACA,IAAA,IAAA/tJ,EAAA,EAAAA,EAAA+tJ,EAAAjwJ,OAAAkC,IAAA64B,KAAAl1B,KAAAoqJ,EAAA/tJ,KASAizX,EAAAz8V,UAAA09V,WAAA,SAAAC,GACA,IAGAn0X,EAHAo0X,EAAA,GACA73W,EAAAsc,KAAA06V,MACAt3V,EAAA1f,EAAAze,OAEA,GAAAq2X,GAAAt7V,KAAAq6V,MAAAr6V,KAAAs6V,MAAA,CACA,IAAAnzX,EAAA64B,KAAAq6V,MAAAlzX,EAAAi8B,EAAAj8B,IAAAo0X,EAAAzwX,KAAA4Y,EAAAvc,IACA,IAAAA,EAAA,EAAAA,EAAA64B,KAAAs6V,MAAAnzX,IAAAo0X,EAAAzwX,KAAA4Y,EAAAvc,SAEA,IAAAA,EAAA64B,KAAAq6V,MAAAlzX,EAAA64B,KAAAs6V,MAAAnzX,IAAAo0X,EAAAzwX,KAAA4Y,EAAAvc,IAEA,OAAAo0X,GAOAnB,EAAAz8V,UAAAm9V,WAAA,WACA96V,KAAAq6V,QAEAr6V,KAAA06V,MAAA16V,KAAAq7V,YAAA,GACAr7V,KAAAq6V,MAAA,GAIAr6V,KAAAs6V,MAAAt6V,KAAA06V,MAAAz1X,OAEA+6B,KAAA06V,MAAAz1X,QAAA,EACA+6B,KAAAy6V,cAAAz6V,KAAAy6V,eAAA,EAAA,GAOAL,EAAAz8V,UAAAo9V,aAAA,WACA/6V,KAAA06V,MAAAz1X,UAAA,EACA+6B,KAAAy6V,iBAAA,GAIApnc,EAAAC,QAAA8mc,gCC1bA,aACA5mc,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAmvb,iBAAA,EACA,MAAAmO,EAAAr9b,EAAA,eACAgsb,EAAAhsb,EAAA,WACAijc,EAAAjjc,EAAA,wCACA44b,sBAAAA,EAAAF,sBAAAA,GAAAuK,EAAA36N,MAyFAvoO,EAAAmvb,YAhFA,MACA5rb,YAAAurb,GACApiV,KAAAoiV,SAAAA,EACApiV,KAAAi9T,SAAA,IAAAj6U,IAQAnsF,WAAAqwE,EAAAs0X,GAEA,MACAjQ,EAAAiQ,EADA51X,KAAA6nC,MAAA7nC,KAAAwoC,SAAAotV,EAAAv2X,SAEAi/W,EAAA3E,EAAA4E,kBAAAoH,GACA,IAAA9oD,EAAAziS,KAAAi9T,SAAAz7U,IAAA0iW,GACAzhD,IACAA,EAAA,IAAAz/S,IACAgd,KAAAi9T,SAAAx7U,IAAAyiW,EAAAzhD,IAEAA,EAAA1jT,IAAA7X,IACAu7T,EAAAhhT,IAAAva,EAAA62B,KAAAunE,MAAAsrR,EAAAI,4BAOAn6b,oBACA,MAAAyuK,EAAAvnE,KAAAunE,MACA16F,EAAA,IAAAoY,IAgBA,OAfAgd,KAAAi9T,SAAA7oa,SAAA,CAAAquY,EAAA8oD,KACA9oD,EAAAruY,SAAA,CAAAswW,EAAAx9R,KAEAw9R,EAAAp/L,IAEA16F,EAAA6W,IAAAva,GAAA0D,EAAA4W,IAAAta,IAAA,GAAA,GAEAu7T,EAAAh/S,OAAAvc,OAIAu7T,EAAAxlS,MACA+C,KAAAi9T,SAAAx5U,OAAA8nW,MAGA3gX,EAOA/zE,eAAA44E,GACA,MAAA87W,EAAAvrV,KAAAoiV,SAAA3yW,GACAy0W,EAAA3E,EAAA4E,kBAAAoH,GACAvrV,KAAAi9T,SAAAx5U,OAAAygW,GASArtb,cAAA44E,EAAAmmO,GACA,OAAAA,GACA,KAAAu2I,EACA,KAAAF,EACA,OAEA,MAAAV,EAAAvrV,KAAAoiV,SAAA3yW,GACAy0W,EAAA3E,EAAA4E,kBAAAoH,GACAvrV,KAAAi9T,SAAAx5U,OAAAygW,GAEArtb,QACAmpG,KAAAi9T,SAAA7vQ,6HC5FA,aAEA,MAAAquS,EAAAloc,EAAA,mBACAF,EAAAC,QAEA,SAAAosb,EAAA/qb,GACA,KAAAqrG,gBAAA0/U,GACA,OAAA,IAAAA,EAAA/qb,GAKA,MAAAy9X,GAFAz9X,EAAAA,GAAA,IAEAy9X,UAAA,GAEAl1R,EAAA,IAAAla,IAEA04W,EAAAD,GAAA,KACAv+V,EAAA9oG,SAAA,CAAA2hL,EAAA/gL,KACA,MAAA8vK,EAAAiR,EAAAq8M,UAAAA,GAiCA,SAAAn1B,GACA,MACAp2R,GADA,IAAAk3B,MACAvB,UAAAygQ,EAAAzgQ,UAEA,OAAA52B,KAAA6nC,MAAA5mC,EAAA,MApCA80X,CAAA5lR,EAAA8qP,WACA/7P,GACA5nE,EAAAzZ,OAAAzuF,QAGA,KAEAgrG,KAAAqxH,IAAA,CAAAr8N,EAAAtB,EAAA0+X,KACApyR,KAAAjhB,IAAA/pF,IACAkoG,EAAAzb,IAAAzsF,EAAA,CACAtB,MAAAA,EACAmta,UAAA,IAAA9iU,KACAq0R,SAAAA,IAIAspE,KAGA17V,KAAAxe,IAAAxsF,IACA,GAAAkoG,EAAAne,IAAA/pF,GACA,OAAAkoG,EAAA1b,IAAAxsF,GAAAtB,MAEA,MAAA,IAAAolG,MAAA,uBAIAkH,KAAAjhB,IAAA/pF,GACAkoG,EAAAne,IAAA/pF,8ECrCI4mc,EAAkB,sBAGlBC,EAAM,IAGNC,EAAY,kBAGZC,EAAS,aAGTC,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAe/1X,SAGfg2X,EAA8B,iBAAV58V,GAAsBA,GAAUA,EAAOhsG,SAAWA,QAAUgsG,EAGhF68V,EAA0B,iBAAR/8V,MAAoBA,MAAQA,KAAK9rG,SAAWA,QAAU8rG,KAGxE7e,EAAO27W,GAAcC,GAAYxmc,SAAS,cAATA,GAGjCymc,EAAc9oc,OAAOmqG,UAOrBQ,EAAiBm+V,EAAYl+V,SAG7Bm+V,EAAY32X,KAAKD,IACjB62X,EAAY52X,KAAKq0B,IAkBjBqrE,EAAM,kBACD7kF,EAAKsd,KAAKunE,OAyDnB,SAAAm3R,EAAkBtkM,EAAMukM,EAAM/nc,OACxBgoc,EACAC,EACAC,EACAjyX,EACAkyX,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTC,GAAW,KAEI,mBAARhlM,YACCpzJ,UAAU62V,GAUtB,SAAAwB,EAAoBhiP,OACdhlI,EAAOumX,EACP/3P,EAAUg4P,SAEdD,EAAWC,OAAWlnc,EACtBsnc,EAAiB5hP,EACjBxwI,EAASutL,EAAK/0D,MAAMwB,EAASxuH,GAI/B,SAAAinX,EAAqBjiP,UAEnB4hP,EAAiB5hP,EAEjB0hP,EAAUjyR,WAAWyyR,EAAcZ,GAE5BO,EAAUG,EAAWhiP,GAAQxwI,EAWtC,SAAA2yX,EAAsBniP,OAChBoiP,EAAoBpiP,EAAO2hP,cAMNrnc,IAAjBqnc,GAA+BS,GAAqBd,GACzDc,EAAoB,GAAON,GANJ9hP,EAAO4hP,GAM8BH,EAGjE,SAAAS,QACMliP,EAAO91C,OACPi4R,EAAaniP,UACRqiP,EAAariP,GAGtB0hP,EAAUjyR,WAAWyyR,EAzBvB,SAAuBliP,OAGjBxwI,EAAS8xX,GAFWthP,EAAO2hP,UAIxBG,EAASV,EAAU5xX,EAAQiyX,GAHRzhP,EAAO4hP,IAGkCpyX,EAoBhC8yX,CAActiP,IAGnD,SAAAqiP,EAAsBriP,UACpB0hP,OAAUpnc,EAINync,GAAYR,EACPS,EAAWhiP,IAEpBuhP,EAAWC,OAAWlnc,EACfk1E,GAeT,SAAA+yX,QACMviP,EAAO91C,IACPs4R,EAAaL,EAAaniP,MAE9BuhP,EAAWtmX,UACXumX,EAAW58V,KACX+8V,EAAe3hP,EAEXwiP,EAAAA,SACcloc,IAAZonc,SACKO,EAAYN,MAEjBG,SAEFJ,EAAUjyR,WAAWyyR,EAAcZ,GAC5BU,EAAWL,eAGNrnc,IAAZonc,IACFA,EAAUjyR,WAAWyyR,EAAcZ,IAE9B9xX,SApGT8xX,EAAO19V,EAAS09V,IAAS,EACrBljX,EAAS7kF,KACXsoc,IAAYtoc,EAAQsoc,QAEpBJ,GADAK,EAAS,YAAavoc,GACH4nc,EAAUv9V,EAASrqG,EAAQkoc,UAAY,EAAGH,GAAQG,EACrEM,EAAW,aAAcxoc,IAAYA,EAAQwoc,SAAWA,GAiG1DQ,EAAU31F,OAnCV,gBACkBtyW,IAAZonc,GACF7sO,aAAa6sO,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,OAAUpnc,GA+BjDioc,EAAUj9Q,MA5BV,uBACqBhrL,IAAZonc,EAAwBlyX,EAAS6yX,EAAan4R,MA4BhDq4R,EA+CT,SAAAlC,EAAkBtjM,EAAMukM,EAAM/nc,OACxBsoc,GAAU,EACVE,GAAW,KAEI,mBAARhlM,YACCpzJ,UAAU62V,UAElBpiX,EAAS7kF,KACXsoc,EAAU,YAAatoc,IAAYA,EAAQsoc,QAAUA,EACrDE,EAAW,aAAcxoc,IAAYA,EAAQwoc,SAAWA,GAEnDV,EAAStkM,EAAMukM,EAAAA,CACpBO,QAAWA,EACXJ,QAAWH,EACXS,SAAYA,IA6BhB,SAAA3jX,EAAkB9lF,OACZozE,SAAcpzE,UACTA,IAAkB,UAARozE,GAA4B,YAARA,GA2BzC,SAAA+2X,EAAsBnqc,WACXA,GAAyB,iBAATA,EAoB3B,SAAAo4E,EAAkBp4E,SACO,iBAATA,GACXmqc,EAAanqc,IAAUyqG,EAAeP,KAAKlqG,IAAUooc,EA0B1D,SAAA98V,EAAkBtrG,MACI,iBAATA,SACFA,KAELo4E,EAASp4E,UACJmoc,KAELriX,EAAS9lF,GAAAA,KACPsjP,EAAgC,mBAAjBtjP,EAAMo7T,QAAwBp7T,EAAMo7T,UAAYp7T,EACnEA,EAAQ8lF,EAASw9J,GAAUA,EAAQ,GAAMA,KAEvB,iBAATtjP,SACQ,IAAVA,EAAcA,GAASA,EAEhCA,EAAQA,EAAMwlF,QAAQ6iX,EAAQ,QAC1BlmB,EAAWomB,EAAWx2X,KAAK/xE,UACvBmib,GAAYqmB,EAAUz2X,KAAK/xE,GAC/Byoc,EAAazoc,EAAM0xE,MAAM,GAAIywW,EAAW,EAAI,GAC3CmmB,EAAWv2X,KAAK/xE,GAASmoc,GAAOnoc,EAGvCL,EAAOC,QAAUmoc,gCCtbjB,aAEA,MAAA3+I,EAAAvpT,EAAA,YACAuqc,EAAAvqc,EAAA,sBACAwqc,EAAAxqc,EAAA,2BAEAykO,EAAAzkO,EAAA,0BACAw6N,EAAAx6N,EAAA,WACAooO,EAAApoO,EAAA,UACAyqc,EAAAzqc,EAAA,uBAEAsoO,MAAAA,GAAAtoO,EAAA,iBACAosb,SAAAse,GAAA1qc,EAAA,cAMA,MAAAosb,EAYA9ob,aAAA6kO,OAAAA,EAAAwiO,YAAAA,EAAAtkP,QAAAA,EAAA3yH,UAAAA,IACA+Y,KAAA07H,OAAAA,EACA17H,KAAAk+V,YAAAA,EACAl+V,KAAA45G,QAAAA,EACA55G,KAAA/Y,UAAAA,EAGA+Y,KAAAm+V,cAAAzoc,EAQAmB,UACA,GAAAmpG,KAAAm+V,SACA,OAAAn+V,KAAAm+V,SAGA,MAAAzrL,EAAA16C,EAAAmB,iBAAAn5H,KAAA07H,OAAAlD,QASA,OAPAx4H,KAAAm+V,SAAAF,EAAA36V,OAAA,CACAovK,UAAAA,EACAwrL,YAAAl+V,KAAAk+V,YACAtkP,QAAA55G,KAAA45G,QACA3yH,UAAA+Y,KAAA/Y,YACAwyI,SAEAz5H,KAAAm+V,SASAtnc,OAAAmgP,GACA,OAAAgnN,EAAAh+V,KAAA07H,OAAAlD,OAAAG,MAAAqe,EAAAtb,OAAAlD,OAAAG,QACAqlO,EAAAh+V,KAAAk+V,YAAAlnN,EAAAknN,cACAF,EAAAh+V,KAAA45G,QAAAo9B,EAAAp9B,UACAokP,EAAAh+V,KAAA/Y,UAAA+vJ,EAAA/vJ,WASApwF,SAAA8sW,GACA,MAAAy6F,EAAAC,EAAA16F,EAAA3jQ,KAAAk+V,YAAAl+V,KAAA45G,SAEA,OAAA55G,KAAA07H,OAAAlD,OAAAm9C,OAAAyoL,EAAAp+V,KAAA/Y,YAYA,MAAAo3W,EAAA,CAAA16F,EAAAu6F,EAAAtkP,KASA,MAAA0kP,EAAAP,EAAAp6F,GACA46F,EAAA5iO,EAAAr4H,OAAAg7V,EAAAlgO,YACAogO,EAAA7iO,EAAAr4H,OAAA46V,EAAAj5X,QACAw5X,EAAA9iO,EAAAr4H,OAAAs2G,EAAA30I,QAEA,OAAA64X,EAAA,CACA,IAAArlO,WAAA8lO,GACAD,EACA,IAAA7lO,WAAA+lO,GACAN,EACA,IAAAzlO,WAAAgmO,GACA7kP,KAUA+lO,EAAAnkN,mBAAAloF,MAAAoZ,IACA,MAAAgyS,EAAAT,EAAA75V,OAAAsoD,GACAgvE,QAAA3N,EAAA+M,iBAAA4jO,EAAAhsL,WAEA,OAAA,IAAAitK,EAAA,CACAjkN,OAAAA,EACAwiO,YAAAQ,EAAAR,YACAtkP,QAAA8kP,EAAA9kP,QACA3yH,UAAAy3W,EAAAz3W,aAaA04V,EAAAgf,KAAArrT,MAAA47D,EAAAwsB,KACA,MAAAioI,EAAAz0J,EAAAy0J,OACAu6F,EAAAhvP,EAAAyrB,MACA/gB,EAAA1K,EAAAuxE,UAEA29K,EAAAC,EAAA16F,EAAAu6F,EAAAtkP,GACA3yH,QAAAy0I,EAAAnD,QAAA+vB,KAAA81M,GAEA,OAAA,IAAAze,EAAA,CACAjkN,OAAAA,EACAwiO,YAAAA,EACAtkP,QAAAA,EACA3yH,UAAAA,KAYA04V,EAAA6G,eAAAlzS,MAAAoZ,EAAAi3M,KACA,MAAA4iF,QAAA5G,EAAAnkN,mBAAA9uE,GAGA,UAFA65R,EAAAtqN,SAAA0nI,GAGA,MAAA7mD,EAAA,IAAAhkN,MAAA,wDAAA+iI,EAAA+iO,yBAGA,OAAArY,GAGAlzb,EAAAC,QAAAqsb,4PCtLA,aAEArsb,EAAAo8E,SAAA,CACAmvX,gBAAA,qCACAC,aAAA,uBACAC,yBAAA,yDAGAzrc,EAAAuoO,MAAA,CACAijO,aAAA,mBACAE,mBAAA,yBACAC,gBAAA,sBACAF,yBAAA,+BACAG,iCAAA,mCACAC,qBAAA,uBACAC,sBAAA,wBACAC,qBAAA,uBACAC,oBAAA,sBACAC,uBAAA,yBACAC,iBAAA,mBACAC,gBAAA,kBACAC,oBAAA,sBACAC,wBAAA,0BACAC,sBAAA,wBACAC,uBAAA,yBACAC,gBAAA,kBACAC,oBAAA,sBACAC,uBAAA,yBACAC,iBAAA,mBACAC,sBAAA,wBACAC,YAAA,cACAC,0BAAA,4BACAC,0BAAA,4BACAC,yBAAA,2BACAC,sBAAA,wBACA3B,wBAAA,yDClCA,aAEA,IAAAt9M,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,qBAAAN,EAAAM,MAAA,mBAAA,IAEA1mD,EAAAykP,SAAA,WAoBA,SAAAA,EAAAz4W,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA4MA,OAnMAw4W,EAAAhiV,UAAA+0K,UAAA/wB,EAAAG,UAAA,IAQA69L,EAAAhiV,UAAAugW,YAAAv8M,EAAAG,UAAA,IAQA69L,EAAAhiV,UAAAi8G,QAAA+nC,EAAAG,UAAA,IAQA69L,EAAAhiV,UAAA1W,UAAA06J,EAAAG,UAAA,IAWA69L,EAAAr8U,OAAA,SAAApkB,EAAAulI,GAWA,OAVAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAwzL,WAAAl/Q,OAAAgnG,eAAAoD,KAAA1e,EAAA,cACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAwzL,WACA,MAAAxzL,EAAAg/W,aAAA1qc,OAAAgnG,eAAAoD,KAAA1e,EAAA,gBACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAg/W,aACA,MAAAh/W,EAAA06H,SAAApmN,OAAAgnG,eAAAoD,KAAA1e,EAAA,YACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAA06H,SACA,MAAA16H,EAAA+H,WAAAzzF,OAAAgnG,eAAAoD,KAAA1e,EAAA,cACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAA+H,WACAw9H,GAcAk7N,EAAAv7U,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAykP,SACA3xU,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAwzL,UAAA1kK,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAg/W,YAAAlwV,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAA06H,QAAA5rG,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAA+H,UAAA+mB,EAAA2qH,QACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAygW,EAAAx9L,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAykP,SACA,OAAA/hT,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAykP,SAyBA,OAxBA,MAAA/hT,EAAA80I,YACA,iBAAA90I,EAAA80I,UACA/wB,EAAA99I,OAAAO,OAAAw5B,EAAA80I,UAAAxzL,EAAAwzL,UAAA/wB,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA80I,YAAA,GACA90I,EAAA80I,UAAAztM,SACAia,EAAAwzL,UAAA90I,EAAA80I,YAEA,MAAA90I,EAAAsgU,cACA,iBAAAtgU,EAAAsgU,YACAv8M,EAAA99I,OAAAO,OAAAw5B,EAAAsgU,YAAAh/W,EAAAg/W,YAAAv8M,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAsgU,cAAA,GACAtgU,EAAAsgU,YAAAj5X,SACAia,EAAAg/W,YAAAtgU,EAAAsgU,cAEA,MAAAtgU,EAAAg8E,UACA,iBAAAh8E,EAAAg8E,QACA+nC,EAAA99I,OAAAO,OAAAw5B,EAAAg8E,QAAA16H,EAAA06H,QAAA+nC,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAg8E,UAAA,GACAh8E,EAAAg8E,QAAA30I,SACAia,EAAA06H,QAAAh8E,EAAAg8E,UAEA,MAAAh8E,EAAA32C,YACA,iBAAA22C,EAAA32C,UACA06J,EAAA99I,OAAAO,OAAAw5B,EAAA32C,UAAA/H,EAAA+H,UAAA06J,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA32C,YAAA,GACA22C,EAAA32C,UAAAhiB,SACAia,EAAA+H,UAAA22C,EAAA32C,YAEA/H,GAYAygW,EAAAv9L,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GA2CA,OA1CAsyC,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA80I,UAAA,IAEA90I,EAAA80I,UAAA,GACAxiG,EAAAyoD,QAAA96H,QACA+/B,EAAA80I,UAAA/wB,EAAAG,UAAAlkH,EAAA80I,aAEAxiG,EAAAyoD,QAAAtyJ,OACAu3D,EAAAsgU,YAAA,IAEAtgU,EAAAsgU,YAAA,GACAhuR,EAAAyoD,QAAA96H,QACA+/B,EAAAsgU,YAAAv8M,EAAAG,UAAAlkH,EAAAsgU,eAEAhuR,EAAAyoD,QAAAtyJ,OACAu3D,EAAAg8E,QAAA,IAEAh8E,EAAAg8E,QAAA,GACA1pC,EAAAyoD,QAAA96H,QACA+/B,EAAAg8E,QAAA+nC,EAAAG,UAAAlkH,EAAAg8E,WAEA1pC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA32C,UAAA,IAEA22C,EAAA32C,UAAA,GACAipF,EAAAyoD,QAAA96H,QACA+/B,EAAA32C,UAAA06J,EAAAG,UAAAlkH,EAAA32C,cAGA,MAAA/H,EAAAwzL,WAAAxzL,EAAAsb,eAAA,eACAojC,EAAA80I,UAAAxiG,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAwzL,UAAA,EAAAxzL,EAAAwzL,UAAAztM,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAwzL,WAAAxzL,EAAAwzL,WAEA,MAAAxzL,EAAAg/W,aAAAh/W,EAAAsb,eAAA,iBACAojC,EAAAsgU,YAAAhuR,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAg/W,YAAA,EAAAh/W,EAAAg/W,YAAAj5X,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAg/W,aAAAh/W,EAAAg/W,aAEA,MAAAh/W,EAAA06H,SAAA16H,EAAAsb,eAAA,aACAojC,EAAAg8E,QAAA1pC,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAA06H,QAAA,EAAA16H,EAAA06H,QAAA30I,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAA06H,SAAA16H,EAAA06H,SAEA,MAAA16H,EAAA+H,WAAA/H,EAAAsb,eAAA,eACAojC,EAAA32C,UAAAipF,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAA+H,UAAA,EAAA/H,EAAA+H,UAAAhiB,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAA+H,WAAA/H,EAAA+H,WAEA22C,GAUA+hT,EAAAhiV,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAs9L,EApOA,GAuOAtsb,EAAAC,QAAA4nM,4DClPA,aAEA,MAAA+oI,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,UAAA,CACA10P,MAAA00P,EAAA,iBAEA5+E,aAAAA,GAAA9xP,EAAA,UAEAupT,EAAAvpT,EAAA,YACAw6N,EAAAx6N,EAAA,YACA4nT,UAAAA,GAAA5nT,EAAA,aAEAitc,EAAAjtc,EAAA,kBACAktc,EAAAltc,EAAA,qBACAmtc,EAAAntc,EAAA,eACA0oO,SAAA0kO,GAAAptc,EAAA,aACAsoO,MAAAA,EAAAnsJ,SAAAA,GAAAn8E,EAAA,YAEAqtc,EAAArtc,EAAA,qBACAstc,EAAAttc,EAAA,wBACAgvT,EAAAhvT,EAAA,uBACAutc,EAAAvtc,EAAA,aACAwtc,EAAAxtc,EAAA,YACA6pb,EAAA7pb,EAAA,cACAytc,EAAAztc,EAAA,aACA0tc,EAAA1tc,EAAA,uBACA2tc,EAAA3tc,EAAA,cACA4tc,EAAA5tc,EAAA,gBACA6tc,EAAA7tc,EAAA,oBACA8tc,EAAA9tc,EAAA,2BACA+tc,EAAA/tc,EAAA,eACA+nU,EAAA/nU,EAAA,UACAguc,EAAAhuc,EAAA,cACAiuc,EAAAD,EAAA1hB,YACA4hB,EAAAluc,EAAA,kBACAmuc,qBAAAA,GAAAnuc,EAAA,kBAkGA,MAAAouc,UAAAt8M,EAQAxuP,oBAAAlC,GACA,GAAAA,EAAA+mO,OAEA,OAAA,IAAAimO,EAAAhtc,GAGA,MAAA+mO,QAAA3N,EAAA75N,SAIA,OAFAS,EAAA+mO,OAAAA,EAEA,IAAAimO,EAAAhtc,GASAkC,YAAA8qK,GAiDA,GAhDAp8C,QAGAvlB,KAAA2hE,SAAAg/R,EAAAh/R,GAGA3hE,KAAA07H,OAAA17H,KAAA2hE,SAAA+5D,OACA17H,KAAAuvR,UAAAvvR,KAAA2hE,SAAA4tN,UAEAvvR,KAAAihT,UAAAjhT,KAAAuvR,WAAAvvR,KAAA2hE,SAAAs/O,UAAA2gD,YACA,IAAAP,EAAA,CACA3lO,OAAA17H,KAAA07H,OACA6zJ,UAAAvvR,KAAAuvR,aACAvvR,KAAA2hE,SAAAs/O,YAEA,IAAAkgD,EAAA,CAAAzlO,OAAA17H,KAAA07H,SAGA17H,KAAA48N,UAAA58N,KAAA2hE,SAAAi7J,UACA58N,KAAA6hW,eAAA,IAAAjB,EAAA5gW,KAAA07H,OAAA17H,KAAA2hE,SAAAi7J,WAGA58N,KAAA6hW,eAAA7zX,GAAA,oBAAA,KACA0zX,EAAA1hW,MAAA9B,OAAAzE,IACA4yH,EAAA98I,MAAA,kCAAAkqB,SAIAuG,KAAA8hW,SAAA9hW,KAAA2hE,SAAA4S,QACAv0E,KAAAsxT,QAAAtxT,KAAA2hE,SAAApnF,OACAylB,KAAA+hW,WAAA,GACA/hW,KAAAgiW,WAAA,IAAAh/W,IAGAgd,KAAAo+U,kBAAA,IAAAyiB,EAAA7gW,KAAA,CACAiiW,SAAAjiW,KAAAsxT,QAAAqsB,cAAAskB,YACAjiW,KAAA2hE,SAAAy8Q,oBAIAp+U,KAAA2hE,SAAAk4Q,QAAAl9G,UACA38N,KAAA65U,QAAA,IAAAmnB,EAAA,IACAhhW,KAAA2hE,SAAAk4Q,QACAuE,kBAAAp+U,KAAAo+U,qBAKAp+U,KAAA2hE,SAAAs4J,UAAAj6N,KAAA2hE,SAAAs4J,SAAAs1D,UAAA,CACAljK,EAAA,qBAEA,MAAA61O,EAAA9kB,EAAA+kB,kBAEAniW,KAAAi6N,SAAA,IAAAmjH,EAAAp9U,KAAA2hE,SAAAs4J,SAAAs1D,UAAA,IACA2yE,KACAliW,KAAA2hE,SAAAs4J,WAGA5tG,EAAA,wBAqCA,GAjCArsH,KAAAuhT,SAAA,IAAA2/C,EAAA,CACAkB,UAAApiW,KAAA07H,OACAm+M,QAAA75U,KAAA65U,QACAwoB,aAAApY,GAAAjqV,KAAAo+U,kBAAA0L,UAAAG,GACAqY,gBAAArY,GAAAjqV,KAAAo+U,kBAAA2L,aAAAE,KAIAjqV,KAAAuiW,iBAAA,IAAAtB,EAAA,CACAtlI,OAAA37N,KACAuhT,SAAAvhT,KAAAuhT,SACAihD,eAAAxiW,KAAA2hE,SAAA4gS,iBAAAC,iBAIAxiW,KAAAyiW,WAAA,IAAAhB,EAAA,CACA/lO,OAAA17H,KAAA07H,OACAmmO,eAAA7hW,KAAA6hW,eACAU,iBAAAviW,KAAAuiW,oBAEAviW,KAAA2hE,SAAApnF,OAAA0jW,MAIAj+U,KAAAspV,UAAA,IAAAgY,EAAA,CACArgD,UAAAjhT,KAAAihT,UACAm9B,kBAAAp+U,KAAAo+U,oBAGAp+U,KAAAgqL,OAAAhqL,KAAAgqL,OAAArxL,KAAAqH,MACAA,KAAAspV,UAAAt/J,OAAAhqL,KAAAgqL,QAGAhqL,KAAA8hW,SAAAY,iBAAA1iW,KAAA8hW,SAAAY,eAAAz9X,OACA,MAAA63O,EAAA,IAAAhkN,MAAAppB,EAAAqvX,0BAAAljO,EAAAkjO,0BA0BA,GAxBA/+V,KAAA8hW,SAAAY,eACAtuc,SAAA45N,IACAhuH,KAAAuhT,SAAAohD,QAAAlhX,IAAAusI,EAAAziB,SAAAyiB,MAGAhuH,KAAA4iW,OAAA,IAAA7B,EAAA,CACAwB,iBAAAviW,KAAAuiW,iBACAthD,UAAAjhT,KAAAihT,aACAjhT,KAAA2hE,SAAAihS,SAGA5iW,KAAA8hW,SAAA1kJ,UAAAhpT,SAAAyuc,IACA,MAAA7tc,EAAA6tc,EAAAllW,UAAAznG,OAAAspM,aACAsjQ,EAAA9iW,KAAAsxT,QAAAl0G,UAAApoT,GACAgrG,KAAAuiW,iBAAAvjX,IAAAhqF,EAAA6tc,EAAAC,MAGA9iW,KAAAsxT,QAAAusB,MAAAlhH,UAEA38N,KAAAuiW,iBAAAvjX,IAAAujO,EAAA5kN,UAAAznG,OAAAspM,aAAA+iH,GACAviN,KAAA69U,MAAA,IAAAijB,EAAA9gW,OAIAA,KAAA8hW,SAAAiB,YAAA,CACA/iW,KAAA8hW,SAAAiB,YACA3uc,SAAA4uc,IACAhjW,KAAAuhT,SAAA0hD,OAAAxhX,IAAAuhX,EAAA50O,WAAA40O,MAIAhjW,KAAAkjW,gBAAA,IAAA3B,EAAA,CAAA5lI,OAAA37N,OACAA,KAAAgqL,OAAAx2R,OAAA4pG,OAAAokW,GAAAxhW,KAAAkjW,gBAAAC,eAIA,GAAAnjW,KAAA8hW,SAAAsB,cACApjW,KAAAuhT,SAAA8hD,UAAArjW,KAAA8hW,SAAAsB,mBACA,QAAA1tc,IAAA2pG,WAAAyyF,SAAAzyF,WAAAyyF,QAAA4hC,KAAAr0H,WAAAyyF,QAAA4hC,IAAA4vO,kBACA,MAAA,IAAAxqW,MAAA,8DAIA,GAAAkH,KAAA8hW,SAAA5mI,IAAA,CACA,MAAAqoI,EAAAvjW,KAAA8hW,SAAA5mI,IAEAl7N,KAAAm5R,KAAA,IAAAoqE,EAAA,CACA5nI,OAAA37N,KACA4iW,OAAA5iW,KAAA4iW,OACAlnO,OAAA17H,KAAA07H,OACAulL,UAAAjhT,KAAAihT,UACAqoC,UAAAtpV,KAAAspV,UACA/5D,UAAAvvR,KAAAuvR,aACAvvR,KAAAsxT,QAAAp2F,MAKA,GAAAl7N,KAAA8hW,SAAA3mI,OAAA,CACA,MAAAkpE,EAAArkS,KAAA8hW,SAAA3mI,OAGAn7N,KAAAm7N,OAAAimI,EAAA/8D,EAAArkS,KAAAA,KAAAsxT,QAAAn2F,QAKAn7N,KAAAwjW,YAAA,IAAAhD,EAAAxgW,MACAA,KAAAyjW,eAAA,IAAAhD,EAAAzgW,MAGAs7N,EAAAloU,MAAA4sG,MAEAA,KAAA0jW,iBAAA1jW,KAAA0jW,iBAAA/qW,KAAAqH,MAWAnpG,KAAAo/F,KAAA7f,GAGA,MAAA,UAAA6f,GAAA+J,KAAAilO,QAAA11P,MAIAg2C,MAAAszD,KAAA5iF,KAAA7f,IAHAi2I,EAAA98I,MAAA6G,IACA,GAWAv/E,cACAw1N,EAAA,sBAEA,UACArsH,KAAA2jW,oBACA3jW,KAAA4jW,cACAv3O,EAAA,sBACA,MAAA5yH,GAIA,MAHAuG,KAAA64E,KAAA,QAAAp/E,GACA4yH,EAAA98I,MAAA,oCAAAkqB,SACAuG,KAAAugC,OACA9mC,GAUA5iG,aACAw1N,EAAA,sBAEA,IACArsH,KAAA6jW,YAAA,EAEA7jW,KAAA69U,OAAA79U,KAAA69U,MAAAt9S,OACAvgC,KAAAwjW,YAAAjjU,OAEA,IAAA,MAAAijO,KAAAxjQ,KAAAgiW,WAAA5kW,SACAomQ,EAAAhuI,eAAA,OAAAx1H,KAAA0jW,wBAGA39R,QAAA2gD,IAAA7oH,MAAA4rD,KAAAzpD,KAAAgiW,WAAA5kW,UAAAlhB,GAAAA,EAAAqkD,UAEAvgC,KAAAgiW,WAAA,IAAAh/W,UAEAgd,KAAAihT,UAAA1gR,aACAvgC,KAAAo+U,kBAAA79S,aAEAwlC,QAAA2gD,IAAA,CACA1mH,KAAAm7N,QAAAn7N,KAAAm7N,OAAA56L,OACAvgC,KAAAm5R,MAAAn5R,KAAAm5R,KAAA54P,OACAvgC,KAAA65U,SAAA75U,KAAA65U,QAAAt5S,eAGAvgC,KAAAyiW,WAAAliU,aACAvgC,KAAAuiW,iBAAAviX,QAEAs7O,EAAAl+I,QAAAp9E,MACAA,KAAA4iW,OAAAt1P,UACA,MAAA7zG,GACAA,IACA4yH,EAAA98I,MAAAkqB,GACAuG,KAAA64E,KAAA,QAAAp/E,IAGA4yH,EAAA,sBAUAx1N,qBACA,GAAAmpG,KAAAi6N,SAIA,UACAj6N,KAAAi6N,SAAAqzF,cAAA,QACA,MAAA7zT,SACAuG,KAAAi6N,SAAA6pI,WAAA,OAAA9jW,KAAA07H,SAIA7kO,YACA,OAAAmpG,KAAA6jW,WASAE,kBACA,OAAA/jW,KAAAo+U,kBAAA2lB,YAYAltc,KAAAijb,EAAAnlb,GACA,OAAAqrG,KAAAgkW,MAAAlqB,EAAAnlb,GAcAkC,mBAAAijb,EAAAj9H,EAAAloT,GACA,IAAAkoT,IAAAA,EAAA53O,OACA,MAAA63O,EAAA,IAAAhkN,MAAA,+CAAA+iI,EAAAqjO,kCAIA,aADAl/V,KAAAgkW,MAAAlqB,EAAAnlb,IACA61b,UAAA3tI,GASAhmT,YAAAijb,EAAAnlb,GACA,MAAAsvF,GAAAA,EAAAo9T,WAAAA,GAAAq/C,EAAA5mB,GAEA,GAAA71V,EAAA+1I,OAAAh6H,KAAA07H,QACA,MAAAohF,EAAA,IAAAhkN,MAAA,oBAAA+iI,EAAA4jO,iBAGA,IAAAxV,EAAAjqV,KAAAo+U,kBAAA58V,IAAAyC,GAQA,OANAgmW,EAEA5oC,GACArhT,KAAAihT,UAAAE,YAAAniU,IAAAiF,EAAAo9T,GAFA4oC,QAAAjqV,KAAA4iW,OAAAqB,cAAAnqB,EAAAnlb,GAKAs1b,EAaA5oC,iBACA,IAAAigC,EAAAthV,KAAA6hW,eAAAqC,mBAAA95X,KAAAk5T,GAAAA,EAAAllS,aAEAkjV,EAAAr8W,SAEAq8W,EAAAthV,KAAAuiW,iBAAA4B,WAAA/5X,KAAAk5T,GAAAA,EAAAllS,cAGAkjV,EAAAA,EAAAzvV,OAAAmO,KAAA6hW,eAAAuC,mBAAAh6X,KAAAk5T,GAAAA,EAAAllS,cAEA,MAAAimW,EAAArkW,KAAA2hE,SAAAi7J,UAAAynI,eAGAC,EAAA,IAAA3lX,IAAA2iW,GAGA,OAAA+iB,EAAAxmW,MAAA4rD,KAAA66S,GAAAl6X,KAAAorB,GAAA,IAAA2lN,EAAA3lN,MASA3+F,aAAAijb,GACA,MAAA71V,GAAAA,GAAAy8W,EAAA5mB,GAEAiqB,EAAA/jW,KAAAo+U,kBAAA2lB,YAAAviX,IAAAyC,EAAA40I,eAEAkrO,SAIAh+R,QAAA2gD,IACAq9O,EAAA35X,KAAA6/W,GACAA,EAAAjqW,WAWAnpF,KAAAijb,GACA,MAAA71V,GAAAA,EAAAo9T,WAAAA,GAAAq/C,EAAA5mB,GAGA,OACAx+G,EAAAt7N,KADAqhT,EACAA,EAAA,GAGAp9T,GASAptF,OAAAgmT,EAAAt/I,IACAs/I,EAAAh/M,MAAA/gB,QAAA+/N,GAAAA,EAAA,CAAAA,IACAzoT,SAAAm3M,IACAvrG,KAAAuhT,SAAA1kG,UAAAp7N,IAAA8pH,EAAAhuC,MAIAv9D,KAAAihT,UAAAK,UAAAtiU,IAAAghB,KAAA07H,OAAAmhF,GASAhmT,SAAAgmT,IACAA,EAAAh/M,MAAA/gB,QAAA+/N,GAAAA,EAAA,CAAAA,IACAzoT,SAAAm3M,IACAvrG,KAAAuhT,SAAA1kG,UAAAp5N,OAAA8nH,MAIAvrG,KAAAihT,UAAAK,UAAA5jT,OAAAsC,KAAA07H,OAAAmhF,GAGAhmT,oBAEA,MAAAyqb,EAAAthV,KAAA6hW,eAAA0C,uBACAvkW,KAAAuiW,iBAAAn1P,OAAAk0O,GAGAthV,KAAAyiW,WAAAztX,cAGAgrB,KAAAihT,UAAAjsU,QAEAgrB,KAAAsxT,QAAAn2F,OAAAwB,SACA38N,KAAAm7N,QAAAn7N,KAAAm7N,OAAAnmP,QAIAgrB,KAAAsxT,QAAAp2F,IAAAyB,UACA38N,KAAAm5R,MAAAn5R,KAAAm5R,KAAAnkT,QAIAgrB,KAAAm5R,KAAAnrT,GAAA,OAAAgyB,KAAA0jW,mBAIA1jW,KAAA65U,SAAA75U,KAAA65U,QAAA7kW,QAQAn+E,oBACAmpG,KAAA6jW,YAAA,EAEA7jW,KAAAihT,UAAAjzU,GAAA,QAAA0tJ,IACA17H,KAAA64E,KAAA,iBAAA6iD,GACA17H,KAAAwkW,cAAA9oO,MAKA,IAAA,MAAAo+M,KAAA95U,KAAAihT,UAAAxe,MAAArlS,SACA4C,KAAA64E,KAAA,iBAAAihQ,EAAA71V,IAGA+b,KAAAo+U,kBAAAppW,cAGAgrB,KAAAykW,sBAGAzkW,KAAA69U,OAAA79U,KAAA69U,MAAA7oW,QAEAgrB,KAAAwjW,YAAAxuX,QAUAn+E,iBAAAijb,GACAA,EAAA71V,GAAA40I,gBAAA74H,KAAA07H,OAAA7C,eAKAihN,EAAAz4B,YAAArhT,KAAAihT,UAAAE,YAAAniU,IAAA86V,EAAA71V,GAAA61V,EAAAz4B,YACAy4B,EAAAj9H,WAAA78M,KAAAihT,UAAAK,UAAA7/T,IAAAq4V,EAAA71V,GAAA61V,EAAAj9H,YALAxwF,EAAA98I,MAAA,IAAAupB,MAAA+iI,EAAA6jO,sBAgBA7oc,oBAAA6kO,GAEA,IAAA,IAAA17H,KAAAsxT,QAAAqsB,cAAAskB,WAAAjiW,KAAAo+U,kBAAA58V,IAAAk6I,GAAA,CAEA,IADA17H,KAAA2hE,SAAAy8Q,kBAAAE,gBAAA,GACAt+U,KAAAo+U,kBAAAnhV,KAAA,CACAovH,EAAA,mCAAAqP,EAAA7C,eACA,UACA74H,KAAA4iW,OAAAqB,cAAAvoO,GACA,MAAAjiI,GACA4yH,EAAA98I,MAAA,wCAAAmsJ,EAAA7C,sBAAAp/H,QAYA5iG,4BAIA,MAAA6tc,EAAAC,IACA,IAAApqX,EAAA,CACAoiP,SAAA,GAUA,GAPAgoI,EAAAngY,KACAw7B,KAAAsxT,QAAAqsB,eACA39U,KAAAsxT,QAAAqsB,cAAAgnB,EAAAngY,OAEA+V,EAAA,IAAAA,KAAAylB,KAAAsxT,QAAAqsB,cAAAgnB,EAAAngY,OAGA+V,EAAAoiP,UACA38N,KAAAgiW,WAAAjjX,IAAA4lX,EAAAngY,KAAA,CACA,IAAAogY,EAIAA,EAFA,mBAAAD,EAEA,IAAAA,EAAAnxc,OAAAiqG,OAAA,GAAAljB,EAAA,CACAmhJ,OAAA17H,KAAA07H,OACAigG,OAAA37N,QAGA2kW,EAGAC,EAAA52X,GAAA,OAAAgyB,KAAA0jW,kBACA1jW,KAAAgiW,WAAAvgX,IAAAkjX,EAAAngY,IAAAogY,KAKA,IAAA,MAAAD,KAAA3kW,KAAA8hW,SAAAnkB,eAAA,GACA+mB,EAAAC,GAIA,IAAA,MAAA9B,KAAA7iW,KAAAuiW,iBAAAsC,gBAEAhC,EAAAiC,WAEAJ,EAAA7B,EAAAiC,iBAIA/+R,QAAA2gD,IAAA7oH,MAAA4rD,KAAAzpD,KAAAgiW,WAAA5kW,UAAAwgC,GAAAA,EAAA5oD,YAIA3hF,EAAAC,QAAAquc,goBC/vBA,aAEA,MAAA19H,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,uBAAA,CACA10P,MAAA00P,EAAA,6BAEAnnB,EAAAvpT,EAAA,aACAwxc,eACAA,EAAAC,YACAA,EAAAC,aACAA,GACA1xc,EAAA,2BAEA07N,EAAA17N,EAAA,aACAk1U,KAAAA,GAAAl1U,EAAA,WACAslF,EAAAtlF,EAAA,YACA0lW,EAAA1lW,EAAA,YACAw6E,EAAAx6E,EAAA,cACA2xc,mBACAA,EAAAC,qBACAA,GAEA5xc,EAAA,wBAiIAF,EAAAC,QA/GA,MAKAuD,YAAA8kU,GACA37N,KAAAy3R,QAAA97D,EAAAjgG,OACA17H,KAAAolW,WAAAzpI,EAAAslF,UAEAjhT,KAAAqlW,SAAA1pI,EAAAmmI,SAAA0B,aAAA,GAGA7nI,EAAAw9D,MAAAx9D,EAAA21F,QAAAp2F,IAAAyB,SACA38N,KAAAqlW,SAAAv6X,KAAA6wP,EAAAw9D,MAGAn5R,KAAAslW,uBAAA3pI,EAAAh6J,SAAA6hS,YAAA+B,eAEAvlW,KAAAwlW,sBAAAxlW,KAAAwlW,sBAAA7sW,KAAAqH,MAMAnpG,QACAmpG,KAAAqlW,SAAApgY,SAAA+6B,KAAAymQ,YAAAzmQ,KAAAslW,uBAAA3oI,UAIA38N,KAAAymQ,WAAAy+F,EACAllW,KAAAwlW,sBAAAxlW,KAAAslW,uBAAAhgG,SAAAtlQ,KAAAslW,uBAAAG,YAOA5uc,8BACA,UAEAoiW,EAAAj5P,KAAA0lW,gBAAA1lW,KAAAy3R,QAAAxzS,KACA,MAAAwV,GACA4yH,EAAA98I,MAAAkqB,IAOA5iG,OACAsuc,EAAAnlW,KAAAymQ,YAWA5vW,eAAAotF,EAAAtvF,GACA,IAAAqrG,KAAAqlW,SAAApgY,OACA,MAAA63O,EAAA,IAAAhkN,MAAA,6BAAA,wBAGA,GAAA7U,EAAA40I,gBAAA74H,KAAAy3R,QAAA5+J,cACA,MAAAikF,EAAA,IAAAhkN,MAAA,+BAAA,iBAGA,MAAAgmI,QAAA2pG,EACAx5G,KACAjvH,KAAAqlW,SAAAj7X,KAAAt3E,GAAA,CAAAA,EAAA6yc,SAAA1hX,EAAAtvF,QAEAogF,GAAAhH,EAAAgH,EAAAsI,WAEAtI,GAAAgwX,EAAAhwX,EAAAirB,KAAAolW,cACArwX,GAAA8D,EAAA9D,KAGA,GAAA+pJ,EACA,OAAAA,EAGA,MAAAg+E,EAAA,IAAAhkN,MAAA,aAAA,aAWAjiG,sBAAA7B,EAAAL,EAAA,CAAAm2K,QAAA,MACA,IAAA9qE,KAAAqlW,SAAApgY,OACA,MAAA63O,EAAA,IAAAhkN,MAAA,6BAAA,8BAGA2vO,EACAx5G,KACAjvH,KAAAqlW,SAAAj7X,KAAAt3E,GAAAA,EAAA4yc,gBAAA1wc,EAAAL,OAEAogF,GAAAgwX,EAAAhwX,EAAAirB,KAAAolW,cACArwX,GAAAiwX,EAAAjwX,KACAA,GAAAkwX,EAAAlwX,qOClJA,aAEA,MAAA+nO,EAAAvpT,EAAA,YACAw6E,EAAAx6E,EAAA,aACA62E,EAAA72E,EAAA,UACA2lW,EAAA3lW,EAAA,WA8EAF,EAAAC,QAAA,CACAyxc,eAlEA,SAAAhwX,EAAAksU,GACA,OAAA72U,EAAA2K,GAAA+kW,IAEA74B,EAAAE,YAAAniU,IAAA86V,EAAA71V,GAAA61V,EAAAz4B,YAEAy4B,MA8DAkrB,YArDA,SAAAjwX,GAEA,MAAA+hB,EAAA,IAAAnY,IAEA,OAAA5Q,EAAAgH,GAAA+kW,IAEAhjV,EAAA/X,IAAA+6V,EAAA71V,GAAAma,cAIAtH,EAAA9X,IAAA86V,EAAA71V,GAAAma,aAEA,MA0CA6mW,aAhCA3xT,gBAAAv+D,EAAAklB,EAAA,GACA,IAAAnD,EAAA,EAEA,UAAA,MAAAgjV,KAAA/kW,EACA+hB,UAEAgjV,EAGA,GAAAhjV,EAAAmD,EACA,MAAA6iN,EAAA,IAAAhkN,MAAA,aAAA,cAuBA8sW,iBAZA,SAAA7wX,EAAApP,GACA,OAAAA,EACAuzR,EAAAnkR,EAAApP,GAGAoP,2GChFA,aA4BA1hF,EAAAC,QAlBAggJ,gBAAAv+D,EAAAggP,GACA,IAAAzxK,EAAA,EAEA,KAAAyxK,EAAA,GAIA,UAAA,MAAAh/I,KAAAhhG,EAKA,SAJAghG,EAEAzyB,IAEAA,IAAAyxK,EACA,sCCvBA,aAEA,MAAA4mE,EAAApoY,EAAA,eAmCAF,EAAAC,QAvBAggJ,mBAAA/xC,GAEA,MAAAu9H,EAAA68J,IAEA9wN,YAAAv3B,UACA,UACAyyB,QAAA2gD,IACAnlH,EAAAn3B,KAAAkpE,MAAAv+D,IACA,UAAA,MAAAkmB,KAAAlmB,EACA+pJ,EAAAh0J,KAAAmwB,OAKA6jI,EAAA95J,MACA,MAAAy0B,GACAqlI,EAAA95J,IAAAy0B,MAEA,SAEAqlI,sDClCA,aAEA,MAAA+mO,EAAA,IAAA7iX,IAoEA3vF,EAAAC,QAAA,CACA4xc,mBA5BA,SAAAY,EAAAxgG,EAAAvmK,GACAA,EAAAA,GAAAumK,EAEA,MAAArhR,EA1CA,GAAA8Z,KAAAunE,SAAA1/F,KAAA6nC,MAAA,IAAA7nC,KAAAwoC,YA2CA23P,EAAAl7L,YAAA,MAlCAv3B,eAAAwyT,EAAAxgG,EAAArhR,GACA,KAAA4hX,EAAArkX,IAAAyC,IAAA,CACA,UACA6hX,IACA,MAAArsW,GAEAoxE,YAAA,KAAA,MAAApxE,IAAA,GACA,MAGA,IAAAosW,EAAArkX,IAAAyC,GACA,YAGA,IAAA8hF,SAAAC,IACA,MAAA+/L,EAAAl7L,WAAA7E,EAAAs/L,GAEAugG,EAAApkX,IAAAwC,EAAA8hR,OAkBAggG,CAAAD,EAAAxgG,EAAArhR,KACA86G,GAIA,OAFA8mQ,EAAApkX,IAAAwC,EAAA8hR,GAEA9hR,GAmBAkhX,qBAXA,SAAAlhX,GACA,MAAA8hR,EAAA8/F,EAAArkX,IAAAyC,GAEA8hR,IACA91I,aAAA81I,GACA8/F,EAAApiX,OAAAQ,kCClEA,aAEA,MAAA64N,EAAAvpT,EAAA,aACAm8E,SAAAA,EAAAmsJ,MAAAA,GAAAtoO,EAAA,cACAwxc,eACAA,EAAAC,YACAA,EAAAC,aACAA,EAAAW,iBACAA,GACAryc,EAAA,WAEA07N,EAAA17N,EAAA,aACAk1U,KAAAA,GAAAl1U,EAAA,WA4HAF,EAAAC,QA7GA,MAKAuD,YAAA8kU,GACA37N,KAAA27N,OAAAA,EAEA37N,KAAAgmW,QAAArqI,EAAAmmI,SAAA2B,gBAAA,GACAzjW,KAAAk7N,IAAAS,EAAAw9D,KAGAn5R,KAAAk7N,KAAAS,EAAA21F,QAAAp2F,IAAAyB,SACA38N,KAAAgmW,QAAAl7X,KAAAk1B,KAAAk7N,KAaArkU,oBAAA7B,EAAAL,EAAA,IACA,IAAAqrG,KAAAgmW,QAAA/gY,OACA,MAAA63O,EAAA,IAAAhkN,MAAA,qCAAA,8BAGA2vO,EACAx5G,KACAjvH,KAAAgmW,QAAA57X,KAAAt3E,GAAAA,EAAAmzc,cAAAjxc,EAAAL,OAEAogF,GAAAgwX,EAAAhwX,EAAAirB,KAAA27N,OAAAslF,aACAlsU,GAAAiwX,EAAAjwX,KACAA,GAAA6wX,EAAA7wX,EAAApgF,EAAAuxc,mBACAnxX,GAAAkwX,EAAAlwX,KAWAl+E,cAAA7B,GACA,IAAAgrG,KAAAgmW,QAAA/gY,OACA,MAAA63O,EAAA,IAAAhkN,MAAA,gCAAA,8BAGAitE,QAAA2gD,IAAA1mH,KAAAgmW,QAAA57X,KAAAt3E,GAAAA,EAAAgtL,QAAA9qL,MAYA6B,IAAA7B,EAAAtB,EAAAiB,GACA,IAAAqrG,KAAA27N,OAAAysC,cAAApoQ,KAAAk7N,IAAAktC,UACA,MAAAtrD,EAAA,IAAAhkN,MAAAppB,EAAAmvX,iBAAAhjO,EAAAojO,iBAGA,OAAAj/V,KAAAk7N,IAAA7pG,IAAAr8N,EAAAtB,EAAAiB,GAYAkC,IAAA7B,EAAAL,GACA,IAAAqrG,KAAA27N,OAAAysC,cAAApoQ,KAAAk7N,IAAAktC,UACA,MAAAtrD,EAAA,IAAAhkN,MAAAppB,EAAAmvX,iBAAAhjO,EAAAojO,iBAGA,OAAAj/V,KAAAk7N,IAAA15O,IAAAxsF,EAAAL,GAYAkC,cAAA7B,EAAAmxc,EAAAxxc,GACA,IAAAqrG,KAAA27N,OAAAysC,cAAApoQ,KAAAk7N,IAAAktC,UACA,MAAAtrD,EAAA,IAAAhkN,MAAAppB,EAAAmvX,iBAAAhjO,EAAAojO,iBAGA,OAAAj/V,KAAAk7N,IAAAkvF,QAAAp1Z,EAAAmxc,EAAAxxc,gICpIA,aAEA,MAAAo5N,EAAAx6N,EAAA,YACA4nT,UAAAA,GAAA5nT,EAAA,aACAupT,EAAAvpT,EAAA,aAEAsoO,MAAAA,GAAAtoO,EAAA,YA0CAF,EAAAC,QAjCA,SAAAwmb,GAKA,IAAA98H,EACA,GALA,iBAAA88H,IACAA,EAAA,IAAA3+H,EAAA2+H,IAIA3+H,EAAAM,YAAAq+H,GAAA,CACA98H,EAAA88H,EACA,MAAAr4B,EAAAq4B,EAAAssB,YAEA,IAAA3kD,EACA,MAAA3kG,EACA,IAAAhkN,MAAA,GAAAghV,qCACAj+M,EAAA0kO,uBAIA,IACAzmB,EAAA/rN,EAAA0M,oBAAAgnL,GACA,MAAAhoT,GACA,MAAAqjN,EACA,IAAAhkN,MAAA,GAAAghV,8BACAj+M,EAAA0kO,wBAKA,MAAA,CACAt8W,GAAA61V,EACAz4B,WAAArkG,EAAA,CAAAA,QAAAtnT,2GC5CA,aAEA,MAAA60L,EAAAh3L,EAAA,kBAEA8yc,gBAAAA,GAAA9yc,EAAA,2BAEA+yc,EAAA/yc,EAAA,gBACAgzc,cAAAA,GAAAhzc,EAAA,qBACAizc,EAAAjzc,EAAA,wBAEAkzc,qBAAAA,GAAAlzc,EAAA,kCACAmzc,eAAAA,GAAAnzc,EAAA,uBAQAozc,EAAA,CACA/pI,UAAA,CACAxvH,OAAA,GACA8wO,SAAA,GACAC,WAAA,GACAkmB,eAAAhjD,GAAAA,GAEA+8B,kBAAA,CACAE,eAAA,IAEAikB,iBAAA,CACAC,eAAAkE,EAAAE,WAEAhE,OAAA,CACAiE,iBAAAP,EAAAQ,mBACAC,gBAAAT,EAAAU,mBACAC,YAAAX,EAAAY,aACAnqJ,UAAA,CACA1jE,QAAAgtN,GAEAc,cAAAV,GAEAjhW,KAAA,CACAgmH,aAAA+6O,GAEA1sB,QAAA,CACAl9G,SAAA,GAEAskF,UAAA,CACA2gD,aAAA,EACAvqD,UAAA,GAEAmsD,YAAA,CACA+B,eAAA,CACA5oI,SAAA,EACA2oC,SAAA,IACAmgG,UAAA,MAGAlrX,OAAA,CACA2gP,IAAA,CACAyB,SAAA,EACAqhH,YAAA,GACAopB,WAAA,CACAzqI,SAAA,EACA0qI,iBAAA,EACA/hG,SAAA,IACAx6L,QAAA,MAGAmzQ,IAAA,CACAthH,SAAA,EACAgoC,IAAA,KACA2iG,WAAA,EACAC,QAAA,KACAC,WAAA,KACAC,IAAA,CACA9qI,SAAA,IAGAghH,cAAA,CACAskB,UAAA,GAEA9mI,OAAA,CACAwB,SAAA,GAEAkhH,MAAA,CACAlhH,SAAA,EACA+qI,UAAA,CACAjC,UAAAe,EAAAmB,qBACAhrI,SAAA,EACAgoC,IAAA6hG,EAAAoB,eAEA9pB,IAAA,CACAnhH,SAAA,EACA/jJ,QAAA,GAEAivR,UAAA,CACAlrI,SAAA,EACAmrI,aAAA,IAGA1qJ,UAAA,KAQA/pT,EAAAC,QAAA2oO,SAAAl7D,IAEA,MAAAgnS,EAAAx9Q,EAAAo8Q,EAAA5lS,GAEA,GAAAgnS,EAAAxzR,QAAA6oI,UAAAn4O,OAAA,EAAA,MAAA,IAAA6zB,MAAA,iEAEA,OAAAivW,gPCnHA,aAEA,MAAAlrJ,EAAAtpT,EAAA,uBAEA8B,KAAA2yc,GAAAnrJ,EAAA,WA6BAxpT,EAAAC,QAAA,CACA+yc,gBAlBA/yT,eAAA0pK,GACA,MACA11N,EAAA,IADA/zF,EAAA,UAGAmoO,EAAAshF,EAAAopJ,aACA,CAAAhvO,GAAA4lF,EAAAc,eAAA3/N,MAAA,EAAAksD,KAAAA,IAAA29T,KAAA,GAGA,IAAAprI,SADAt1O,EAAA2gX,WAAA,YAAA7wO,MACA/R,OAAAj7I,KAAAvD,GAAAA,EAAAiZ,MAAA,KAAA,KAMA,OAJA47I,IACAkhG,EAAAA,EAAA7uP,QAAAgoG,GAAAA,EAAAtnG,SAAAitJ,MAGAkhG,8EC9BA,aAIA,MAAA1jF,EAAA3lP,EAAA,0BAEAF,EAAAC,QAAA4lP,gECNA,aACA,MAAA+qF,EAAA1wU,EAAA,SACA84N,EAAA43G,EAAA,0BACA53G,EAAA98I,MAAA00P,EAAA,gCAEA,MAAAikI,EAAA30c,EAAA,cAEAgtR,EAAAhtR,EAAA,WAMA,MAAA40c,EAMAtxc,aAAAuxc,SAAAA,EAAA,KAAA,IACApoW,KAAAmtH,OAAA,IAAA+6O,EAAA,CAAAviY,IAAAyiY,IACApoW,KAAAqoW,SAAA,CACA,uCACA,8BAUAxxc,aACA,OAAAmpG,KAAAqoW,SASAxxc,sBACA,MAAAyxc,EAAA,GAAAz2W,OAAAmO,KAAAqoW,UAEA,IAAA,IAAAlhY,EAAAmhY,EAAArjY,OAAA,EAAAkC,EAAA,EAAAA,IAAA,CACA,MAAAmqB,EAAA1rB,KAAA6nC,MAAA7nC,KAAAwoC,SAAAjnC,GACAskC,EAAA68V,EAAAnhY,GACAmhY,EAAAnhY,GAAAmhY,EAAAh3W,GACAg3W,EAAAh3W,GAAAma,EAGA,OAAA68V,EAQAzxc,WAAA0xc,GACAvoW,KAAAqoW,SAAAE,EAUA1xc,QAAAugO,EAAAoxO,EAAA,KACA,OAAAA,GACA,IAAA,IACA,OAAAxoW,KAAAyoW,SAAArxO,GACA,IAAA,OACA,OAAAp3H,KAAA0oW,SAAAtxO,GACA,IAAA,MACA,OAAAp3H,KAAAioW,WAAA7wO,GACA,QACA,MAAA,IAAAt+H,MAAA,GAAA0vW,uBAUA3xc,eAAAugO,GACA,MAAAuxO,EAAA,IACA1zc,EAAA+qG,KAAAmtH,OAAA3rI,IAAA++L,EAAAqoL,YAAAxxO,EAAAuxO,IACA,GAAA1zc,EACA,OAAAA,EAGA,IAAA,MAAAmtZ,KAAApiT,KAAA6oW,sBACA,IACA,MAAAl6O,QAAA4xD,EAAA3xD,MAAA2xD,EAAAuoL,cAAA,CACAC,eAAA3mD,EACAhrL,SAAAA,EACAuxO,WAAAA,KAGA/qU,QAAA+wF,EAAAgB,OACAjjE,EAAA9uB,EAAAorU,OAAA5+X,KAAAvD,GAAAA,EAAA6lF,OACAi4M,EAAA/+R,KAAAq0B,IAAA2jC,EAAAorU,OAAA5+X,KAAAvD,GAAAA,EAAAoiY,OAIA,OAFAjpW,KAAAmtH,OAAA1rI,IAAA8+L,EAAAqoL,YAAAxxO,EAAAuxO,GAAAj8S,EAAA,CAAAi4M,IAAAA,IAEAj4M,EACA,MAAAjzD,GACA4yH,EAAA98I,MAAA,GAAA6yU,uBAAAhrL,cAIA,MAAA,IAAAt+H,MAAA,qBAAAs+H,cASAvgO,eAAAugO,GACA,MAAAuxO,EAAA,OACA1zc,EAAA+qG,KAAAmtH,OAAA3rI,IAAA++L,EAAAqoL,YAAAxxO,EAAAuxO,IACA,GAAA1zc,EACA,OAAAA,EAGA,IAAA,MAAAmtZ,KAAApiT,KAAA6oW,sBACA,IACA,MAAAl6O,QAAA4xD,EAAA3xD,MAAA2xD,EAAAuoL,cAAA,CACAC,eAAA3mD,EACAhrL,SAAAA,EACAuxO,WAAAA,KAGA/qU,QAAA+wF,EAAAgB,OACAjjE,EAAA9uB,EAAAorU,OAAA5+X,KAAAvD,GAAAA,EAAA6lF,OACAi4M,EAAA/+R,KAAAq0B,IAAA2jC,EAAAorU,OAAA5+X,KAAAvD,GAAAA,EAAAoiY,OAIA,OAFAjpW,KAAAmtH,OAAA1rI,IAAA8+L,EAAAqoL,YAAAxxO,EAAAuxO,GAAAj8S,EAAA,CAAAi4M,IAAAA,IAEAj4M,EACA,MAAAjzD,GACA4yH,EAAA98I,MAAA,GAAA6yU,uBAAAhrL,iBAIA,MAAA,IAAAt+H,MAAA,qBAAAs+H,iBASAvgO,iBAAAugO,GACA,MAAAuxO,EAAA,MACA1zc,EAAA+qG,KAAAmtH,OAAA3rI,IAAA++L,EAAAqoL,YAAAxxO,EAAAuxO,IACA,GAAA1zc,EACA,OAAAA,EAGA,IAAA,MAAAmtZ,KAAApiT,KAAA6oW,sBACA,IACA,MAAAl6O,QAAA4xD,EAAA3xD,MAAA2xD,EAAAuoL,cAAA,CACAC,eAAA3mD,EACAhrL,SAAAA,EACAuxO,WAAAA,KAGA/qU,QAAA+wF,EAAAgB,OACAjjE,EAAA9uB,EAAAorU,OAAA5+X,KAAAvD,GAAA,CAAAA,EAAA6lF,KAAAxzE,QAAA,SAAA,OACAyrR,EAAA/+R,KAAAq0B,IAAA2jC,EAAAorU,OAAA5+X,KAAAvD,GAAAA,EAAAoiY,OAIA,OAFAjpW,KAAAmtH,OAAA1rI,IAAA8+L,EAAAqoL,YAAAxxO,EAAAuxO,GAAAj8S,EAAA,CAAAi4M,IAAAA,IAEAj4M,EACA,MAAAjzD,GACA4yH,EAAA98I,MAAA,GAAA6yU,uBAAAhrL,gBAIA,MAAA,IAAAt+H,MAAA,qBAAAs+H,iBAIA+wO,EAAAA,SAAAA,EACA90c,EAAAC,QAAA60c,kFCnMA,aAEA90c,EAAAC,QAAA40c,EACA,IAAAgB,EAAA31c,EAAA,MACAywF,EAAAkkX,EAAAvqW,UACA2hI,EAAA,IAAAvhI,KAAA,IAYA,SAAAmqW,EAAAvzc,GACAA,EAAAA,GAAA,GACAqrG,KAAA/b,GAAAtvF,EAAAsvF,KAZA,IAAAre,KAAAwoC,WAAA,GAAAkxH,IAaAt/H,KAAAr6B,IAAAhxE,EAAAgxE,KAAA0mC,EAAAA,EACArM,KAAAsjD,MAAA3uJ,EAAA2uJ,OAAA,GACAtjD,KAAAw7R,QAAA,GACAx7R,KAAA/C,KAAA+C,KAAAsjD,MAAAr+E,OACA+6B,KAAAmpW,aAAA,IAAAprW,KAAAppG,EAAAw0c,cAAA,IAAAprW,MAGA,IAAA,IAAA9C,EAAA0pQ,EAAAx9R,EAAA64B,KAAAsjD,MAAAr+E,OAAAkC,KACA8zB,EAAA+E,KAAAsjD,MAAAn8E,GACAw9R,EAAA,IAAA5mQ,KAAA9C,EAAAmuW,SAAA,IAAArrW,KACAiC,KAAAw7R,QAAAvgS,EAAAjmG,KAAAimG,EACA0pQ,EAAA,EAAA3kQ,KAAA0kQ,OAAAzpQ,EAAAjmG,IAAA2vW,GACAA,GAAA,GAAA3kQ,KAAAvc,OAAAwX,EAAAjmG,KAWAgvF,EAAAjF,IAAA,SAAA/pF,GACA,OAAAA,KAAAgrG,KAAAw7R,SASAx3S,EAAAxC,IAAA,SAAAxsF,GACA,IAAAgrG,KAAAjhB,IAAA/pF,GAAA,OAAA,KACA,IAAAk6M,EAAAlvG,KAAAw7R,QAAAxmY,GAMA,OAJAk6M,EAAAm6P,SAAArpW,KAAA0kQ,OAAA1vW,EAAAk6M,EAAAm6P,SAEArpW,KAAAsjD,MAAA74E,OAAAu1B,KAAAsjD,MAAA93E,QAAA0jI,GAAA,GACAlvG,KAAAsjD,MAAAx4E,KAAAokI,GACAA,EAAAx7M,OASAswF,EAAAyzE,KAAA,SAAAziK,GACA,IAAAgrG,KAAAjhB,IAAA/pF,GAAA,OAAA,KACA,IAAAk6M,EAAAlvG,KAAAw7R,QAAAxmY,GACA,MAAA,SAAAk6M,EACAA,EAAAz3C,KADA,MAYAzzE,EAAAvC,IAAA,SAAAzsF,EAAAtB,EAAAiB,GACA,IAAA20c,EAAAtpW,KAAAw7R,QAAAxmY,GACAk6M,EAAAlvG,KAAAw7R,QAAAxmY,GAAA,CAAAA,IAAAA,EAAAtB,MAAAA,GAyBA,OAvBAssG,KAAAmpW,aAAA,IAAAprW,KAEAurW,GAEAr5O,aAAAq5O,EAAAx+R,SACA9qE,KAAAsjD,MAAA74E,OAAAu1B,KAAAsjD,MAAA93E,QAAA89X,GAAA,EAAAp6P,KAGAlvG,KAAA/C,MAAA+C,KAAAr6B,KAAAq6B,KAAAvc,OAAAuc,KAAAsjD,MAAA,GAAAtuJ,KAEAgrG,KAAAsjD,MAAAx4E,KAAAokI,GACAlvG,KAAA/C,QAGAtoG,IAEA,QAAAA,GAAAqrG,KAAA0kQ,OAAA1vW,EAAAL,EAAAgwW,KAEA,SAAAhwW,IAAAu6M,EAAAz3C,KAAA9iK,EAAA8iK,MAEA9iK,EAAA00c,UAAAn6P,EAAAm6P,QAAA10c,EAAAgwW,MAGA3kQ,MASAhc,EAAAP,OAAA,SAAAzuF,GACA,IAAAk6M,EAAAlvG,KAAAw7R,QAAAxmY,GACA,QAAAk6M,IACAlvG,KAAAmpW,aAAA,IAAAprW,KACAiC,KAAAsjD,MAAA74E,OAAAu1B,KAAAsjD,MAAA93E,QAAA0jI,GAAA,GACA+gB,aAAA/gB,EAAApkC,gBACA9qE,KAAAw7R,QAAAxmY,GACAgrG,KAAA/C,OACA+C,OAUAhc,EAAA0gR,OAAA,SAAA1vW,EAAA2vW,GACA,IAAA70I,EAAA60I,GAAA,EACAz1J,EAAAlvG,KAAAw7R,QAAAxmY,GACA,IAAAk6M,EAAA,OAAAlvG,KAEA,GADA,iBAAA8vH,IAAAA,EAAAo5O,EAAAvkG,IACA,iBAAA70I,EAAA,MAAA,IAAA/qH,UAAA,+CAIA,OAHAkrH,aAAA/gB,EAAApkC,SACAokC,EAAApkC,QAAAD,WAAA7qE,KAAAvc,OAAAkV,KAAAqH,KAAAkvG,EAAAl6M,KAAA86N,GACA5gB,EAAAk6P,QAAAjjY,OAAA,IAAA43B,MAAA+xH,EACA9vH,MAOAhc,EAAAopE,MAAA,WACA,IAAA,IAAAjmF,EAAA64B,KAAAsjD,MAAAr+E,OAAAkC,KAAA64B,KAAAvc,OAAAuc,KAAAsjD,MAAAn8E,GAAAnyE,KACA,OAAAgrG,MAOAhc,EAAAoD,OAAA,WAGA,IAFA,IACA6T,EADAqoD,EAAA,IAAAzlD,MAAAmC,KAAAsjD,MAAAr+E,QAEAkC,EAAAm8E,EAAAr+E,OAAAkC,KACA8zB,EAAA+E,KAAAsjD,MAAAn8E,GACAm8E,EAAAn8E,GAAA,CACAnyE,IAAAimG,EAAAjmG,IACAyiK,KAAAx8D,EAAAw8D,KACA/jK,MAAAunG,EAAAvnG,MACA01c,QAAAnuW,EAAAmuW,QACAC,QAAApuW,EAAAouW,SAIA,MAAA,CACAplX,GAAA+b,KAAA/b,GACAte,IAAA+/K,SAAA1lJ,KAAAr6B,KAAAq6B,KAAAr6B,SAAAjwE,EACAyzc,aAAAnpW,KAAAmpW,aACA7lT,MAAAA,4CClLA,IAAApnE,EAAA,IACAgD,EAAA,GAAAhD,EACAurF,EAAA,GAAAvoF,EACA0+C,EAAA,GAAA6pC,EACAg9C,EAAA,EAAA7mF,EACA/vB,EAAA,OAAA+vB,EAqJA,SAAAggO,EAAA9tI,EAAA+tI,EAAA5pW,EAAApB,GACA,IAAAirW,EAAAD,GAAA,IAAA5pW,EACA,OAAA2xE,KAAAuoC,MAAA2hH,EAAA77N,GAAA,IAAApB,GAAAirW,EAAA,IAAA,IAvIAzqW,EAAAC,QAAA,SAAAqmG,EAAAhlG,GACAA,EAAAA,GAAA,GACA,IAAAmyE,SAAA6yB,EACA,GAAA,WAAA7yB,GAAA6yB,EAAA10B,OAAA,EACA,OAkBA,SAAAuwB,GAEA,IADAA,EAAAnvB,OAAAmvB,IACAvwB,OAAA,IACA,OAEA,IAAAqY,EAAA,mIAAAhY,KACAkwB,GAEA,IAAAlY,EACA,OAEA,IAAArpF,EAAAgrG,WAAA3hB,EAAA,IAEA,QADAA,EAAA,IAAA,MAAAlU,eAEA,IAAA,QACA,IAAA,OACA,IAAA,MACA,IAAA,KACA,IAAA,IACA,OAAAn1E,EAAA45G,EACA,IAAA,QACA,IAAA,OACA,IAAA,IACA,OAAA55G,EAAAwwN,EACA,IAAA,OACA,IAAA,MACA,IAAA,IACA,OAAAxwN,EAAA2pI,EACA,IAAA,QACA,IAAA,OACA,IAAA,MACA,IAAA,KACA,IAAA,IACA,OAAA3pI,EAAAwzK,EACA,IAAA,UACA,IAAA,SACA,IAAA,OACA,IAAA,MACA,IAAA,IACA,OAAAxzK,EAAAirF,EACA,IAAA,UACA,IAAA,SACA,IAAA,OACA,IAAA,MACA,IAAA,IACA,OAAAjrF,EAAAioF,EACA,IAAA,eACA,IAAA,cACA,IAAA,QACA,IAAA,OACA,IAAA,KACA,OAAAjoF,EACA,QACA,QAvEAg7E,CAAA0qB,GACA,GAAA,WAAA7yB,GAAA4+K,SAAA/rJ,GACA,OAAAhlG,EAAAopW,KA0GA,SAAAjuI,GACA,IAAA+tI,EAAAj4R,KAAAu0L,IAAArqC,GACA,GAAA+tI,GAAAjgO,EACA,OAAAggO,EAAA9tI,EAAA+tI,EAAAjgO,EAAA,OAEA,GAAAigO,GAAAp2L,EACA,OAAAm2L,EAAA9tI,EAAA+tI,EAAAp2L,EAAA,QAEA,GAAAo2L,GAAA3+Q,EACA,OAAA0+Q,EAAA9tI,EAAA+tI,EAAA3+Q,EAAA,UAEA,GAAA2+Q,GAAA3hR,EACA,OAAA0hR,EAAA9tI,EAAA+tI,EAAA3hR,EAAA,UAEA,OAAA4zI,EAAA,MAxHAkuI,CAAArkQ,GAiFA,SAAAm2H,GACA,IAAA+tI,EAAAj4R,KAAAu0L,IAAArqC,GACA,GAAA+tI,GAAAjgO,EACA,OAAAh4D,KAAAuoC,MAAA2hH,EAAAlyF,GAAA,IAEA,GAAAigO,GAAAp2L,EACA,OAAA7hG,KAAAuoC,MAAA2hH,EAAAroD,GAAA,IAEA,GAAAo2L,GAAA3+Q,EACA,OAAAtZ,KAAAuoC,MAAA2hH,EAAA5wI,GAAA,IAEA,GAAA2+Q,GAAA3hR,EACA,OAAAtW,KAAAuoC,MAAA2hH,EAAA5zI,GAAA,IAEA,OAAA4zI,EAAA,KA/FAmuI,CAAAtkQ,GAEA,MAAA,IAAAb,MACA,wDACAjxB,KAAAC,UAAA6xB,mCCnCA,aAEA,MAAAxmG,QAAAo2c,EAAAz6O,QAAAA,GAAAv7N,EAAA,gBAwCAF,EAAAC,QAAA,CACAw1c,cA9BA,UAAAC,eAAAA,EAAA3xO,SAAAA,EAAAuxO,WAAAA,IACA,MAAA,GAAAI,UAAA3xO,UAAAuxO,KA8BA/5O,MArBA,SAAAY,GACA,OAAA+5O,EAAA/5O,EAAA,CACAC,QAAA,IAAAX,EAAA,CACA06O,OAAA,4BAmBAZ,YAPA,SAAAxxO,EAAAuxO,GACA,MAAA,GAAAA,KAAAvxO,0DCvCA,aAEA/3H,WAAAuvH,OAAAvvH,WAAAyvH,SAAAzvH,WAAAwvH,SAAAxvH,WAAAkyH,SACAl+N,EAAAC,QAAA,CACAH,QAAAksG,WAAAuvH,MACAE,QAAAzvH,WAAAyvH,QACAD,QAAAxvH,WAAAwvH,QACA0C,SAAAlyH,WAAAkyH,UAGAl+N,EAAAC,QAAA,CACAH,QAAAI,EAAA,cAAAJ,QACA27N,QAAAv7N,EAAA,cAAAu7N,QACAD,QAAAt7N,EAAA,cAAAs7N,QACA0C,SAAAh+N,EAAA,cAAAg+N,4DCdA,iBAaI/xH,EAVY,cAIK,oBAATF,YAA+BA,QACpB,oBAAXC,cAAiCA,eACtB,IAAXC,SAAiCA,YAClC1G,MAAM,kCAGJk9H,GAEb3iO,EAAOC,QAAUA,EAAUksG,EAAOovH,MAG9BpvH,EAAOovH,QACVt7N,EAAQH,QAAUqsG,EAAOovH,MAAMj2H,KAAK6G,IAGrClsG,EAAQw7N,QAAUtvH,EAAOsvH,QACzBx7N,EAAQu7N,QAAUrvH,EAAOqvH,QACzBv7N,EAAQi+N,SAAW/xH,EAAO+xH,uCCxB1B,aAEAl+N,EAAAC,QAAA,CACA4zc,aAAA,IACAJ,mBAAA,IACAE,mBAAA,EACAyC,QAAA,CACAC,4BAAA,IACAC,uBAAA,IACAC,uBAAA,CACA,IACA,IACA,KAEAC,qBAAA,mCCdA,aAGA,MAAAC,EAAAv2c,EAAA,sBAAAmwG,QAEArwG,EAAAC,QAAAy2c,iBAAA,aACA12c,EAAAC,QAAAizc,cAAA,aAAAuD,IACAz2c,EAAAC,QAAA02c,oBAAA,iBACA32c,EAAAC,QAAA22c,yBAAA,gkRCRA,aAIA52c,EAAAC,QAAA,CACAq0c,qBAAA,IACAC,cAAA,KACAsC,mBAAA,IACAC,iBAAA,YACAC,mBAAA,OACAC,oBAAA,+CCVA,aAEA,MAAAxrS,EAAAtrK,EAAA,0BAqBA,SAAA+2c,EAAAzjY,EAAAyS,GACA,MAAAixX,EAAA1rS,EAAAh4F,EAAAqnJ,WACAs8O,EAAA3rS,EAAAvlF,EAAA40I,WAEA,OAAAq8O,IAAAC,EACA,GACAD,GAAAC,GAIA3jY,EAAA4jY,cAAAnxX,EAAAmxX,aAHA,GAKA5jY,EAAA4jY,aAAAnxX,EAAAmxX,YACA,EAGA,EAcAp3c,EAAAC,QAAAmzc,qBAJA,SAAA7pI,GACA,MAAA,IAAAA,GAAAxwO,KAAAk+W,gEClDA,aAGA,MAAAI,EAAAn3c,EAAA,cAkBAF,EAAAC,QANA,SAAAgwY,GACA,MAAAplF,QAAAA,GAAAolF,EAAAqnE,cAEA,OAAAD,EAAAxsJ,sDClBA,aAEA7qT,EAAAC,QAAAC,EAAA,sDCFA,MAAAq3c,EAAAr3c,EAAA,WAAAq3c,QACAC,EAAAt3c,EAAA,YAIAu3c,EAFA,CAAA,YAAA,aAAA,gBAAA,cAAA,iBAAA,gBAAA,eAAA,eAAA,eAAA,eAAA,gBAAA,iBAAA,iBAAA,eAAA,kBAAA,kBAAA,iBAAA,iBAAA,kBAAA,gBAAA,kBAAA,iBAAA,cAAA,sBAEA1gY,KAAA2gY,GAAA,IAAAH,EAAAG,KAeA13c,EAAAC,QAAA03c,GACAH,EAAAxqJ,KAAA56O,KAAAulY,GANA,SAAAA,GACA,MAAA,OAAAvlY,KAAAulY,IAAA,QAAAvlY,KAAAulY,IAAA,kEAAAvlY,KAAAulY,IAAA,oEAAAvlY,KAAAulY,IAAA,oEAAAvlY,KAAAulY,IAAA,wFAAAvlY,KAAAulY,IAAA,iIAAAvlY,KAAAulY,IAAA,6IAAAvlY,KAAAulY,IAAA,oIAAAvlY,KAAAulY,IAAA,oJAAAvlY,KAAAulY,IAAA,8BAAAvlY,KAAAulY,IAAA,8BAAAvlY,KAAAulY,IAAA,0BAAAvlY,KAAAulY,GAKAC,CAAAD,MAAAH,IAAAplY,KAAAulY,KAAAA,EAAA7uX,WAAA,OAdA,SAAA6uX,GACA,IAAA,IAAAh9V,KAAA88V,EACA,GAAA98V,EAAAqjP,SAAA25G,GAAA,OAAA,EAGA,OAAA,EASAE,CAAAF,kECpBA,WACA,IAAAJ,EAAAO,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAEAA,EAAA,SAAA1tG,GAMA,MAAA,EAJAA,EAAA,KAAA,MAAA,IACAA,EAAA,KAAA,MAAA,IACA,MAAAA,KAAA,EACA,IAAAA,GACAzzR,KAAA,MAGAkhY,EAAA,SAAAjxM,GACA,IAAAjhL,EAAA7M,EAAAtF,EAAAmqB,EAAAr9F,EAAA2wL,EAEA,IADAtrG,EAAA,GACAnS,EAAAmqB,EAAA,EAAAA,GAAA,GACA,IAAAipK,EAAAt1L,OADAkC,IAAAmqB,EAAA,CAIA,GAAAnqB,EAAA,EAAA,CACA,GAAA,MAAAozL,EAAA,GACA,MAAA,IAAAzhK,MAAA,cAEAyhK,EAAAA,EAAAz+J,UAAA,GAEA7nG,GAAA2wL,EAAAumR,EAAA5wM,IAAA,GAAA9tL,EAAAm4G,EAAA,GACA21E,EAAAA,EAAAz+J,UAAArvB,GACA6M,EAAAxO,KAAA72E,GAEA,GAAA,IAAAsmQ,EAAAt1L,OACA,MAAA,IAAA6zB,MAAA,cAEA,OAAAxf,EAAArU,QACA,KAAA,EACA,GAAAqU,EAAA,GAAA,WACA,MAAA,IAAAwf,MAAA,cAEA,OAAAxf,EAAA,KAAA,EACA,KAAA,EACA,GAAAA,EAAA,GAAA,KAAAA,EAAA,GAAA,SACA,MAAA,IAAAwf,MAAA,cAEA,OAAAxf,EAAA,IAAA,GAAAA,EAAA,MAAA,EACA,KAAA,EACA,GAAAA,EAAA,GAAA,KAAAA,EAAA,GAAA,KAAAA,EAAA,GAAA,MACA,MAAA,IAAAwf,MAAA,cAEA,OAAAxf,EAAA,IAAA,GAAAA,EAAA,IAAA,GAAAA,EAAA,MAAA,EACA,KAAA,EACA,GAAAA,EAAA,GAAA,KAAAA,EAAA,GAAA,KAAAA,EAAA,GAAA,KAAAA,EAAA,GAAA,IACA,MAAA,IAAAwf,MAAA,cAEA,OAAAxf,EAAA,IAAA,GAAAA,EAAA,IAAA,GAAAA,EAAA,IAAA,EAAAA,EAAA,MAAA,EACA,QACA,MAAA,IAAAwf,MAAA,gBAQAuyW,GAJAD,EAAA,SAAA9xX,GACA,OAAAA,EAAArB,WAAA,KAGA,KAEAszX,EAAAH,EAAA,KAEAE,EAAAF,EAAA,KAEAD,EAAA,SAAAjvX,GACA,IAAAkkD,EAAAsrU,EAAAvkY,EAAAlzE,EAAA+gF,EAgBA,IAfA/gF,EAAA,EACAmsI,EAAA,GACAsrU,EAAA,IACAvkY,EAAA,EACA+U,EAAAjX,OAAA,GAAA,MAAAiX,EAAA/U,KACA,MAAA+U,EAAA/U,EAAA,IAAA,MAAA+U,EAAA/U,EAAA,IACAA,GAAA,EACAi5D,EAAA,IACA,KAAAlkD,EAAA/U,EAAA,IAAA+U,EAAA/U,EAAA,IAAA,MACAA,IACAi5D,EAAA,EACAsrU,EAAA,MAGA12X,EAAA7N,EACAA,EAAA+U,EAAAjX,QAAA,CACA,GAAA,KAAAiX,EAAA/U,IAAA+U,EAAA/U,IAAAukY,EACAz3c,EAAAA,EAAAmsI,GAAAgrU,EAAAlvX,EAAA/U,IAAAkkY,KAAA,MACA,CAAA,GAAA,KAAAjrU,EASA,MARA,GAAA,KAAAlkD,EAAA/U,IAAA+U,EAAA/U,IAAA,IACAlzE,EAAAA,EAAAmsI,GAAA,GAAAgrU,EAAAlvX,EAAA/U,IAAAokY,KAAA,MACA,CAAA,KAAA,KAAArvX,EAAA/U,IAAA+U,EAAA/U,IAAA,KAGA,MAFAlzE,EAAAA,EAAAmsI,GAAA,GAAAgrU,EAAAlvX,EAAA/U,IAAAmkY,KAAA,GAOA,GAAAr3c,EAAA,WACA,MAAA,IAAA6kG,MAAA,aAEA3xB,IAEA,GAAAA,IAAA6N,EACA,MAAA,IAAA8jB,MAAA,eAEA,MAAA,CAAA7kG,EAAAkzE,IAGAyjY,EAAA,WACA,SAAAA,EAAAnvI,EAAAz8F,GACA,IAAA73J,EAAAmqB,EAAAszF,EACA,GAAA,iBAAA62I,EACA,MAAA,IAAA3iO,MAAA,2BAQA,GANAkmI,IACAp6C,EAAA62I,EAAA37O,MAAA,IAAA,GAAA27O,EAAA72I,EAAA,GAAAo6C,EAAAp6C,EAAA,IAEAo6C,IACAA,EAAA,IAEA,iBAAAA,GAAAA,EAAAxzJ,QAAA,MAAA,EAAA,CACA,IACAw0B,KAAA2rW,SAAAH,EAAAxsO,GACA,MAAA4sO,GAEA,MADAA,EACA,IAAA9yW,MAAA,iBAAAkmI,GAEA,IAAA73J,EAAAmqB,EAAA,GAAAA,GAAA,EAAAnqB,IAAAmqB,EACA,GAAA0O,KAAA2rW,WAAA,YAAA,GAAAxkY,IAAA,EAAA,CACA64B,KAAA6rW,QAAA1kY,EACA,WAGA,CAAA,IAAA63J,GAAA,IAAAA,EAOA,MAAA,IAAAlmI,MAAA,uBANAkH,KAAA6rW,QAAAzlY,SAAA44J,EAAA,IACAh/H,KAAA2rW,SAAA,EACA3rW,KAAA6rW,QAAA,IACA7rW,KAAA2rW,SAAA,YAAA,GAAA3rW,KAAA6rW,UAAA,GAKA,IACA7rW,KAAA8rW,SAAAN,EAAA/vI,GAAAz7N,KAAA2rW,YAAA,EACA,MAAAC,GAEA,MADAA,EACA,IAAA9yW,MAAA,wBAAA2iO,GAEA,KAAAz7N,KAAA6rW,SAAA,IACA,MAAA,IAAA/yW,MAAA,yBAAAkmI,GAEAh/H,KAAA/C,KAAAr3B,KAAAy5J,IAAA,EAAA,GAAAr/H,KAAA6rW,SACA7rW,KAAAogC,KAAAqrU,EAAAzrW,KAAA8rW,SACA9rW,KAAAg/H,KAAAysO,EAAAzrW,KAAA2rW,UACA3rW,KAAA+rW,SAAAN,GAAAzrW,KAAA2rW,UACA3rW,KAAAnnB,MAAAmnB,KAAA6rW,SAAA,GAAAJ,EAAAzrW,KAAA8rW,QAAA,GAAA9rW,KAAAogC,KACApgC,KAAAjkB,KAAAikB,KAAA6rW,SAAA,GAAAJ,EAAAzrW,KAAA8rW,QAAA9rW,KAAA/C,KAAA,GAAAwuW,EAAAzrW,KAAA8rW,QAAA9rW,KAAA/C,KAAA,GACA+C,KAAAgsW,UAAAhsW,KAAA6rW,SAAA,GAAAJ,EAAAzrW,KAAA8rW,QAAA9rW,KAAA/C,KAAA,QAAA,EAqCA,OAlCA2tW,EAAAjtW,UAAA0zP,SAAA,SAAA92F,GAIA,MAHA,iBAAAA,IAAAA,EAAA/uL,QAAA,KAAA,GAAA,IAAA+uL,EAAAz6K,MAAA,KAAA7a,UACAs1L,EAAA,IAAAqwM,EAAArwM,IAEAA,aAAAqwM,EACA5qW,KAAAqxP,SAAA92F,EAAAn6H,OAAApgC,KAAAqxP,SAAA92F,EAAAyxM,WAAAzxM,EAAAx+K,OAEAyvX,EAAAjxM,GAAAv6J,KAAA2rW,YAAA,IAAA3rW,KAAA8rW,QAAA9rW,KAAA2rW,YAAA,GAIAf,EAAAjtW,UAAAvgB,KAAA,SAAAmG,GAIA,OAHA,MAAAA,IACAA,EAAA,GAEA,IAAAqnX,EAAAa,EAAAzrW,KAAA8rW,QAAA9rW,KAAA/C,KAAA1Z,GAAAyc,KAAAg/H,OAGA4rO,EAAAjtW,UAAAvpG,QAAA,SAAAwwF,GACA,IAAArf,EAAA0mY,EAAAluG,EAIA,IAHAA,EAAAytG,EAAAxrW,KAAAnnB,OACAozX,EAAAT,EAAAxrW,KAAAjkB,MACAxW,EAAA,EACAw4R,GAAAkuG,GACArnX,EAAA6mX,EAAA1tG,GAAAA,EAAAx4R,GACAA,IACAw4R,KAIA6sG,EAAAjtW,UAAAS,SAAA,WACA,OAAA4B,KAAAogC,KAAA,IAAApgC,KAAA6rW,SAGAjB,EAtFA,GA0FAt3c,EAAAk4c,QAAAA,EAEAl4c,EAAAm4c,QAAAA,EAEAn4c,EAAAs3c,QAAAA,IAEAhtW,KAAAoC,oCC/MA,aAEA,MAAAikO,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,qBAAA,CACA10P,MAAA00P,EAAA,2BAGAioI,EAAA34c,EAAA,aACAsoO,MAAAA,GAAAtoO,EAAA,YACAupT,EAAAvpT,EAAA,aAEAmuc,qBAAAA,GAAAnuc,EAAA,kBAgBA,MAAA0tc,EAKApqc,aAAA8kU,OAAAA,EAAA4lF,SAAAA,EAAAihD,eAAAA,EAAA2J,EAAAvF,YACA5mW,KAAA27N,OAAAA,EACA37N,KAAAuhT,SAAAA,EAEAvhT,KAAAosW,YAAA,IAAAppX,IACAgd,KAAAwnJ,WAAA,IAAAxkK,IACAgd,KAAAqsW,iBAAA,IAAArpX,IACAgd,KAAAwiW,eAAAA,EAWA3rc,IAAA7B,EAAA6tc,EAAAC,EAAA,IAEA,GADAz2O,EAAA,YAAAr3N,IACAA,EACA,MAAA8nT,EAAA,IAAAhkN,MAAA,+CAAA9jG,MAAA6mO,EAAAikO,iBAEA,GAAA9/V,KAAAosW,YAAArtX,IAAA/pF,GACA,MAAA8nT,EAAA,IAAAhkN,MAAA,8CAAA+iI,EAAA8jO,yBAGA,MAAAviJ,EAAA,IAAAylJ,EAAA,IACAC,EACAnnI,OAAA37N,KAAA27N,OACA4lF,SAAAvhT,KAAAuhT,WAGAvhT,KAAAosW,YAAA3qX,IAAAzsF,EAAAooT,GACAp9M,KAAAqsW,iBAAA5qX,IAAAzsF,EAAA8tc,EAAAwJ,iBAAA,IACAtsW,KAAAwnJ,WAAAzoK,IAAA/pF,IACAgrG,KAAAwnJ,WAAA/lK,IAAAzsF,EAAA,IASA6B,cACA,MAAAy1Y,EAAA,GACA,IAAA,MAAAt3Y,EAAAy3M,KAAAzsG,KAAAwnJ,WAEA,IADAn7B,EAAA,2BAAAr3N,GACAy3M,EAAAxnI,QAAA,CACA,MAAA6nI,EAAAL,EAAAxuH,MACA6uH,EAAA2oB,mBAAA,aACA3oB,EAAA2oB,mBAAA,SACA62K,EAAAxhU,KAAAgiI,EAAA9sH,eAIA+lF,QAAA2gD,IAAA4lL,GACAjgL,EAAA,wBACA,IAAA,MAAAr3N,KAAAgrG,KAAAwnJ,WAAArzP,OACA6rG,KAAAwnJ,WAAA/lK,IAAAzsF,EAAA,IAWA6B,WAAAysY,EAAA3uY,GACA,MAAAyoT,EAAAp9M,KAAAusW,sBAAAjpE,GACA,IAAAlmF,EACA,MAAAN,EAAA,IAAAhkN,MAAA,sCAAAzyB,OAAAi9T,MAAAznK,EAAAukO,2BAGA,IACA,aAAAhjJ,EAAAovJ,KAAAlpE,EAAA3uY,GACA,MAAA8kG,GAEA,MADAA,EAAApkG,OAAAokG,EAAApkG,KAAAwmO,EAAAwkO,2BACA5mW,GASA5iG,WAEA,IAAAyqb,EAAA,GACA,IAAA,MAAA70O,KAAAzsG,KAAAwnJ,WAAApqJ,SACA,IAAA,MAAA0vG,KAAAL,EACA60O,EAAA,IAAAA,KAAAx0O,EAAAq3P,YAGA,OAAA7iB,EAQAzqb,gBACA,OAAAmpG,KAAAosW,YAAAhvW,SASAvmG,sBAAAysY,GACA,IAAA,MAAAlmF,KAAAp9M,KAAAosW,YAAAhvW,SAAA,CAEA,GADAggN,EAAArvO,OAAA,CAAAu1T,IACAr+T,OAAA,OAAAm4O,EAEA,OAAA,KASAvmT,aAAAyqb,GACA,IAAAA,GAAA,IAAAA,EAAAr8W,OAEA,YADAonJ,EAAA,oEAIA,MAAAogP,EAAA,GACA,IAAA,MAAAz3c,EAAAooT,KAAAp9M,KAAAosW,YAAAlvW,UAAA,CACA,MAAAwvW,EAAAtvJ,EAAArvO,OAAAuzW,GACAh1C,EAAA,GAGA,IAAA,MAAAtvF,KAAA0vJ,EAAA,CACArgP,EAAA,iCAAAr3N,EAAAgoT,GACA,MAAAlwG,EAAAswG,EAAAuvJ,eAAA3sW,KAAAqsW,iBAAA7qX,IAAAxsF,IACAgrG,KAAAwnJ,WAAAhmK,IAAAxsF,GAAA81E,KAAAgiI,GAGAA,EAAA9+H,GAAA,aAAA,IAAA0zX,EAAA1hW,KAAA27N,UACA7uH,EAAA9+H,GAAA,SAAA,IAAA0zX,EAAA1hW,KAAA27N,UAGA2wE,EAAAxhU,KAAAgiI,EAAAM,OAAA4vG,IAIA,GAAA,IAAAsvF,EAAArnU,OAAA,CACAwnY,EAAA3hY,KAAA91E,GACA,SASA,WANAk3c,EAAA5/D,IAKAnuT,MAAA6vB,IAAA,IAAAA,EAAA4+V,eACA5sW,KAAAwiW,iBAAA2J,EAAAU,SACA,MAAA/vJ,EAAA,IAAAhkN,MAAA,cAAA9jG,gDAAA6mO,EAAA0jO,wBAMA,GAAAkN,EAAAxnY,SAAA+6B,KAAAosW,YAAAnvW,KAAA,CACA,MAAAtjB,EAAA,oDAAA8yX,KACA,GAAAzsW,KAAAwiW,iBAAA2J,EAAAvF,UACA,MAAA9pJ,EAAA,IAAAhkN,MAAAnf,GAAAkiJ,EAAA0jO,wBAEAlzO,EAAA,6BAAA1yI,MAWA9iF,aAAA7B,GAEA,GADAq3N,EAAA,cAAAr3N,GACAgrG,KAAAwnJ,WAAAzoK,IAAA/pF,GAEA,IAAA,MAAA83M,KAAA9sG,KAAAwnJ,WAAAhmK,IAAAxsF,GACA83M,EAAA2oB,mBAAA,aACA3oB,EAAA2oB,mBAAA,eACA3oB,EAAA9sH,QAIAggB,KAAAosW,YAAA3oX,OAAAzuF,GACAgrG,KAAAwnJ,WAAA/jK,OAAAzuF,GASA6B,kBACA,MAAAy1Y,EAAA,GACA,IAAA,MAAAt3Y,KAAAgrG,KAAAosW,YAAAj4c,OACAm4Y,EAAAxhU,KAAAk1B,KAAAtC,OAAA1oG,UAGA+wK,QAAA2gD,IAAA4lL,IAYA,MAAA6/D,EAAA,CACAvF,UAAA,EACAiG,SAAA,GAGA5L,EAAAyF,eAAAyF,EAEA94c,EAAAC,QAAA2tc,6HC5QA,aACA,MAAA6L,EAAAv5c,EAAA,aACAw5c,EAAAx5c,EAAA,WAEAF,EAAAC,QAAAggJ,MAAA4hF,EAAAvgO,EAAA,MACA,MAAAsvW,YAAAA,EAAA53P,EAAAA,GAAA13G,EACAogU,EAAAg4I,EAAA9oG,GAEA,OAAAl+L,QAAA2gD,IAAAwO,EAAA9qJ,KAAAyT,GACAA,GAAA,mBAAAA,EAAAogB,KACA6uW,EAAAjvX,GAIAivX,EADA,mBAAAjvX,EACAk3O,GAAA,IAAAl3O,MAGAkoF,QAAAC,QAAAnoF,2ECjBA,aAEA,MAAAivX,EAAAx5T,MAAAA,IACA,IAEA,MAAA,CACAs5T,aAAA,EACAI,YAAA,EACAt5c,YAJA2hN,GAMA,MAAA9lI,GACA,MAAA,CACAq9X,aAAA,EACAI,YAAA,EACAp3J,OAAArmO,KAKAl8E,EAAAC,QAAAw5c,EAEAz5c,EAAAC,QAAAH,QAAA25c,gCCrBA,aACA,MAAAG,EAAA15c,EAAA,SAEAw5c,EAAA9oG,IACA,IAAA99R,OAAAs/K,UAAAw+G,IAAAA,IAAA53P,EAAAA,KAAA43P,EAAA,GACA,OAAAl+L,QAAAw5B,OAAA,IAAAx6F,UAAA,wDAGA,MAAAkyE,EAAA,GACA,IAAAi2R,EAAA,EAEA,MAAA9vX,EAAA,KACA8vX,IAEAj2R,EAAAhyG,OAAA,GACAgyG,EAAAtyE,OAAAsyE,IAIA69C,EAAA,CAAAlwI,EAAAohF,KAAA5vF,KACA82X,IAEA,MAAAtiY,EAAAqiY,EAAAroX,KAAAxO,GAEA4vF,EAAAp7F,GAEAA,EAAAqzB,KAAA7gB,EAAAA,IAWAyjB,EAAA,CAAAjc,KAAAxO,IAAA,IAAA2vF,SAAAC,GARA,EAAAphF,EAAAohF,KAAA5vF,KACA82X,EAAAjpG,EACAnvI,EAAAlwI,EAAAohF,KAAA5vF,GAEA6gG,EAAAnsG,KAAAgqJ,EAAAn8H,KAAA,KAAA/T,EAAAohF,KAAA5vF,KAIAgxR,CAAAxiR,EAAAohF,KAAA5vF,KAeA,OAdA5iF,OAAAq5U,iBAAAhsO,EAAA,CACAqsW,YAAA,CACA1rX,IAAA,IAAA0rX,GAEAC,aAAA,CACA3rX,IAAA,IAAAy1F,EAAAhyG,QAEAmoY,WAAA,CACA15c,MAAA,KACAujL,EAAAhyG,OAAA,MAKA47B,GAGAxtG,EAAAC,QAAAy5c,EACA15c,EAAAC,QAAAH,QAAA45c,6CCxDA,aAEA,MAAAE,EAAA,CAAAroX,KAAAyoX,IAAA,IAAAtnS,SAAAC,IACAA,EAAAphF,KAAAyoX,OAGAh6c,EAAAC,QAAA25c,EAEA55c,EAAAC,QAAAH,QAAA85c,gCCRA,aAEA,MAAAttB,EAAApsb,EAAA,cACA+5c,EAAA/5c,EAAA,iBAqBAF,EAAAC,QAAAouc,qBATApuT,eAAAqoL,GACA,MAAA4xI,EAAA,IAAAD,EAAA,CACA5xO,OAAAigG,EAAAjgG,OACA2lL,WAAA1lF,EAAA0lF,aAEAklC,QAAA5G,EAAAgf,KAAA4O,EAAA5xI,EAAAjgG,QACAigG,EAAAslF,UAAAE,YAAAulC,kBAAAH,8ECrBA,aAEA,MAAAprI,UAAAA,GAAA5nT,EAAA,aACAw6N,EAAAx6N,EAAA,WACAi6c,EAAAj6c,EAAA,kCAEA+5c,WAAArP,GAAA1qc,EAAA,kBACAk6c,4BACAA,EAAAC,kCACAA,GACAn6c,EAAA,YAUA,MAAA+5c,EAWAz2c,aAAA6kO,OAAAA,EAAA2lL,WAAAA,EAAA,GAAA5vB,UAAAA,EAAA1zR,KAAAunE,QACAtlE,KAAA2jQ,OAAA8pG,EACAztW,KAAA26H,MAAA+yO,EAEA1tW,KAAA07H,OAAAA,EACA17H,KAAAqhT,WAAAA,EACArhT,KAAAyxR,UAAAA,EAGAzxR,KAAAm+V,cAAAzoc,EAQAmB,UACA,OAAAmpG,KAAAm+V,WAIAn+V,KAAAm+V,SAAAF,EAAA36V,OAAA,CACAo4H,OAAA17H,KAAA07H,OAAApC,UACAo0H,IAAA1tP,KAAAyxR,UACA70D,UAAA58N,KAAAqhT,WAAAj3U,KAAA8U,IAAA,CACAgvI,UAAAhvI,EAAAy5I,YAEAc,UATAz5H,KAAAm+V,SAoBAtnc,OAAAmgP,GACA,OAAAA,aAAAs2N,MAKAttW,KAAA07H,OAAA1B,OAAAgd,EAAAtb,UAKA17H,KAAAyxR,YAAAz6I,EAAAy6I,aAKA+7E,EAAAxtW,KAAAqhT,WAAArqK,EAAAqqK,eAcAisD,EAAA9xO,mBAAAjL,IACA,MAAAg9O,EAAAtP,EAAA75V,OAAAmsH,GAEAmL,EAAA3N,EAAAyM,gBAAA+yO,EAAA7xO,QACA2lL,GAAAksD,EAAA3wI,WAAA,IAAAxyP,KAAAvD,GAAA,IAAAs0O,EAAAt0O,EAAAqnJ,aACAujK,EAAAtrT,OAAAonY,EAAA7/G,KAEA,OAAA,IAAA4/G,EAAA,CAAA5xO,OAAAA,EAAA2lL,WAAAA,EAAA5vB,UAAAA,KAGA67E,EAAAK,OAAAF,EAEAp6c,EAAAC,QAAAg6c,sJChHA,aAcAj6c,EAAAC,QAJA,SAAAuzE,EAAAyS,GACA,OAAAzS,EAAA5B,SAAAqU,EAAArU,QAAAqU,EAAA8S,QAAAvlB,EAAAulB,OAAA2gB,OAAA,CAAA9R,EAAA11B,IAAA+T,EAAA/T,GAAAy0J,OAAA/+H,oCCVA,aAEA,IAAAqmJ,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,wBAAAN,EAAAM,MAAA,sBAAA,IAEA1mD,EAAAoyQ,WAAA,WAmBA,SAAAA,EAAApmY,GAEA,GADA84B,KAAA48N,UAAA,GACA11P,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAwUA,OA/TAmmY,EAAA3vW,UAAA+9H,OAAAimB,EAAAG,UAAA,IAQAwrN,EAAA3vW,UAAA+vP,IAAA/rG,EAAAqE,KAAArE,EAAAqE,KAAAW,SAAA,EAAA,GAAA,GAAA,EAQA2mN,EAAA3vW,UAAAi/N,UAAAj7E,EAAA4D,WAWA+nN,EAAAhqW,OAAA,SAAApkB,EAAAulI,GAOA,GANAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAw8I,QAAAloO,OAAAgnG,eAAAoD,KAAA1e,EAAA,WACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAw8I,QACA,MAAAx8I,EAAAwuQ,KAAAl6V,OAAAgnG,eAAAoD,KAAA1e,EAAA,QACAulI,EAAAs9B,OAAA,IAAA8B,OAAA3kK,EAAAwuQ,KACA,MAAAxuQ,EAAA09O,WAAA19O,EAAA09O,UAAA33P,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAA09O,UAAA33P,SAAAkC,EACA+zH,EAAAoyQ,WAAAM,YAAAtqW,OAAApkB,EAAA09O,UAAAz1P,GAAAs9I,EAAAs9B,OAAA,IAAA6C,QAAAC,SAEA,OAAApgC,GAcA6oP,EAAAlpW,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAoyQ,WACAt/V,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAw8I,OAAA1tH,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAwuQ,IAAA1/O,EAAA61I,SACA,MACA,KAAA,EACA3kK,EAAA09O,WAAA19O,EAAA09O,UAAA33P,SACAia,EAAA09O,UAAA,IACA19O,EAAA09O,UAAA9xP,KAAAowH,EAAAoyQ,WAAAM,YAAAxpW,OAAA4J,EAAAA,EAAA+zI,WACA,MACA,QACA/zI,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAouX,EAAAnrN,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAoyQ,WACA,OAAA1vU,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAoyQ,WAiBA,GAhBA,MAAA1vU,EAAA89F,SACA,iBAAA99F,EAAA89F,OACAimB,EAAA99I,OAAAO,OAAAw5B,EAAA89F,OAAAx8I,EAAAw8I,OAAAimB,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA89F,SAAA,GACA99F,EAAA89F,OAAAz2J,SACAia,EAAAw8I,OAAA99F,EAAA89F,SAEA,MAAA99F,EAAA8vN,MACA/rG,EAAAqE,MACA9mK,EAAAwuQ,IAAA/rG,EAAAqE,KAAAm5G,UAAAvhO,EAAA8vN,MAAAjnG,UAAA,EACA,iBAAA7oH,EAAA8vN,IACAxuQ,EAAAwuQ,IAAAtnR,SAAAw3D,EAAA8vN,IAAA,IACA,iBAAA9vN,EAAA8vN,IACAxuQ,EAAAwuQ,IAAA9vN,EAAA8vN,IACA,iBAAA9vN,EAAA8vN,MACAxuQ,EAAAwuQ,IAAA,IAAA/rG,EAAAiB,SAAAhlH,EAAA8vN,IAAAz/O,MAAA,EAAA2vB,EAAA8vN,IAAAx/O,OAAA,GAAAlP,UAAA,KAEA4+B,EAAAg/L,UAAA,CACA,IAAA/+N,MAAA/gB,QAAA8gD,EAAAg/L,WACA,MAAA73N,UAAA,yCACA7lB,EAAA09O,UAAA,GACA,IAAA,IAAAz1P,EAAA,EAAAA,EAAAy2D,EAAAg/L,UAAA33P,SAAAkC,EAAA,CACA,GAAA,iBAAAy2D,EAAAg/L,UAAAz1P,GACA,MAAA49B,UAAA,0CACA7lB,EAAA09O,UAAAz1P,GAAA+zH,EAAAoyQ,WAAAM,YAAAzrN,WAAAvkH,EAAAg/L,UAAAz1P,KAGA,OAAA+X,GAYAouX,EAAAlrN,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAIA,IAHAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAAg/L,UAAA,IAEA1sJ,EAAAuiC,SAQA,GAPAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA89F,OAAA,IAEA99F,EAAA89F,OAAA,GACAxrD,EAAAyoD,QAAA96H,QACA+/B,EAAA89F,OAAAimB,EAAAG,UAAAlkH,EAAA89F,UAEAimB,EAAAqE,KAAA,CACA,IAAA/xP,EAAA,IAAA0tP,EAAAqE,KAAA,EAAA,GAAA,GACApoH,EAAA8vN,IAAAx9K,EAAA+2E,QAAA5gL,OAAApyE,EAAAmqG,WAAA8xE,EAAA+2E,QAAA9gL,OAAAlyE,EAAA+qG,WAAA/qG,OAEA2pI,EAAA8vN,IAAAx9K,EAAA+2E,QAAA5gL,OAAA,IAAA,EAWA,GATA,MAAA6Y,EAAAw8I,QAAAx8I,EAAAsb,eAAA,YACAojC,EAAA89F,OAAAxrD,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAw8I,OAAA,EAAAx8I,EAAAw8I,OAAAz2J,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAw8I,QAAAx8I,EAAAw8I,QAEA,MAAAx8I,EAAAwuQ,KAAAxuQ,EAAAsb,eAAA,SACA,iBAAAtb,EAAAwuQ,IACA9vN,EAAA8vN,IAAAx9K,EAAA+2E,QAAA5gL,OAAAA,OAAA6Y,EAAAwuQ,KAAAxuQ,EAAAwuQ,IAEA9vN,EAAA8vN,IAAAx9K,EAAA+2E,QAAA5gL,OAAAs7K,EAAAqE,KAAAroJ,UAAAS,SAAAR,KAAA1e,EAAAwuQ,KAAAx9K,EAAA+2E,QAAA9gL,OAAA,IAAAw7K,EAAAiB,SAAA1jK,EAAAwuQ,IAAAz/O,MAAA,EAAA/uB,EAAAwuQ,IAAAx/O,OAAA,GAAAlP,UAAA,GAAA9f,EAAAwuQ,KAEAxuQ,EAAA09O,WAAA19O,EAAA09O,UAAA33P,OAAA,CACA24D,EAAAg/L,UAAA,GACA,IAAA,IAAAtrO,EAAA,EAAAA,EAAApS,EAAA09O,UAAA33P,SAAAqsB,EACAssC,EAAAg/L,UAAAtrO,GAAA4pG,EAAAoyQ,WAAAM,YAAAxrN,SAAAljK,EAAA09O,UAAAtrO,GAAA4+E,GAGA,OAAAtyC,GAUA0vU,EAAA3vW,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAirN,EAAAM,YAAA,WAiBA,SAAAA,EAAA1mY,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAqHA,OA5GAymY,EAAAjwW,UAAAuwH,UAAAyzB,EAAAG,UAAA,IAWA8rN,EAAAtqW,OAAA,SAAApkB,EAAAulI,GAKA,OAJAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAgvI,WAAA16N,OAAAgnG,eAAAoD,KAAA1e,EAAA,cACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAgvI,WACAzJ,GAcAmpP,EAAAxpW,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAoyQ,WAAAM,YACA5/V,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAgvI,UAAAlgH,EAAA2qH,QACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWA0uX,EAAAzrN,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAoyQ,WAAAM,YACA,OAAAhwU,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAoyQ,WAAAM,YAOA,OANA,MAAAhwU,EAAAswF,YACA,iBAAAtwF,EAAAswF,UACAyzB,EAAA99I,OAAAO,OAAAw5B,EAAAswF,UAAAhvI,EAAAgvI,UAAAyzB,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAswF,YAAA,GACAtwF,EAAAswF,UAAAjpJ,SACAia,EAAAgvI,UAAAtwF,EAAAswF,YAEAhvI,GAYA0uX,EAAAxrN,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAaA,OAZAsyC,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAAswF,UAAA,IAEAtwF,EAAAswF,UAAA,GACAh+C,EAAAyoD,QAAA96H,QACA+/B,EAAAswF,UAAAyzB,EAAAG,UAAAlkH,EAAAswF,cAGA,MAAAhvI,EAAAgvI,WAAAhvI,EAAAsb,eAAA,eACAojC,EAAAswF,UAAAh+C,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAgvI,UAAA,EAAAhvI,EAAAgvI,UAAAjpJ,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAgvI,WAAAhvI,EAAAgvI,WAEAtwF,GAUAgwU,EAAAjwW,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAurN,EA1IA,GA6IAN,EAhWA,GAmWAj6c,EAAAC,QAAA4nM,4DC9WA,aAEA,MAAAkzB,EAAA76N,EAAA,cAGAowW,EAAAv1I,EAAA6pB,QAAA7pB,EAAAy/O,qBAAA,qBAKA3P,EAAAzlO,WAAAhvE,KAAA,CAAA,EAAA,IAEAp2J,EAAAC,QAAA,CACAm6c,4BAAA9pG,EACA+pG,kCAAAxP,mDCdA,aAEA,MAAA74M,aAAAA,GAAA9xP,EAAA,WACA4nT,UAAAA,GAAA5nT,EAAA,aACAw6N,EAAAx6N,EAAA,WA2FAF,EAAAC,QAhFA,cAAA+xP,EAaAxuP,YAAA6kO,GAAAtuB,OAAAA,EAAA,GAAA8wO,SAAAA,EAAA,IAAA,IACA34T,QAEAvlB,KAAA07H,OAAAA,EACA17H,KAAAotG,OAAA,IAAAzuH,IAAAyuH,EAAAhjI,KAAAk5T,GAAAA,EAAAllS,cACA4B,KAAAk+U,SAAA,IAAAv/V,IAAAu/V,EAAA9zW,KAAAk5T,GAAAA,EAAAllS,cACA4B,KAAA6kG,SAAA,IAAAlmH,IAQA9nF,iBACA,OAAAgnG,MAAA4rD,KAAAzpD,KAAAotG,QAAAhjI,KAAAvD,GAAA,IAAAs0O,EAAAt0O,KAQAhwE,mBACA,OAAAgnG,MAAA4rD,KAAAzpD,KAAAk+U,UAAA9zW,KAAAvD,GAAA,IAAAs0O,EAAAt0O,KAQAhwE,mBACA,OAAAgnG,MAAA4rD,KAAAzpD,KAAA6kG,UAAAz6H,KAAAvD,GAAA,IAAAs0O,EAAAt0O,KAQAhwE,gBAAAmmT,GACA,IAAAsmF,EAAA,IAAAnoF,EAAA6B,GACA,MAAAktI,EAAA5mD,EAAA8iE,YAGA,GAAAlc,EAAA,CACAn8N,EAAA0M,oBAAAyvN,GAGAlwN,OAAAh6H,KAAA07H,UACA4nK,EAAAA,EAAAwqE,YAAA,IAAA3yJ,EAAA,QAAAn7M,KAAA07H,YAIA,MAAAgiF,EAAA4lF,EAAAllS,WAGA4B,KAAA6kG,SAAA9lH,IAAA2+N,KAIA19M,KAAA6kG,SAAA7lH,IAAA0+N,GACA19M,KAAA64E,KAAA,uGC3FA,aAEA,MAAAorJ,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,6BAAA,CACA10P,MAAA00P,EAAA,mCAGAhlF,EAAA1rP,EAAA,YACAg3L,EAAAh3L,EAAA,iBACAw6c,EAAAx6c,EAAA,qBAEAqnW,EAAArnW,EAAA,YAEA8xP,aAAAA,GAAA9xP,EAAA,UAEAw6N,EAAAx6N,EAAA,YAGAsoO,OAAAmkO,uBAAAA,IACAzsc,EAAA,aAEA00J,EAAA,CACAo2R,eAAAhyU,EAAAA,EACAiyU,eAAA,EACA0vB,QAAA3hW,EAAAA,EACA4hW,YAAA5hW,EAAAA,EACA6hW,gBAAA7hW,EAAAA,EACA8hW,kBAAA9hW,EAAAA,EACA+hW,aAAA,IACAC,iBAAA,IACAC,sBAAA,IACAC,iBAAA,GAoWAl7c,EAAAC,QAxUA,cAAA+xP,EAQAxuP,YAAA8kU,EAAAhnU,EAAA,IAOA,GANA4wH,QAEAvlB,KAAA0iV,QAAA/mH,EACA37N,KAAAy3R,QAAA97D,EAAAjgG,OAAA7C,cAEA74H,KAAA2hE,SAAA4oB,EAAA3sF,KAAA,CAAAsxH,iBAAA,GAAAjnE,EAAAtzJ,GACAqrG,KAAA2hE,SAAA08Q,eAAAr+U,KAAA2hE,SAAA28Q,eACA,MAAAr/L,EAAA,IAAAnmJ,MAAA,yEAAAknW,GAGA3zO,EAAA,cAAArsH,KAAA2hE,UAOA3hE,KAAAwuW,YAAA,IAAAxrX,IAOAgd,KAAA+jW,YAAA,IAAA/gX,IAEAgd,KAAAg7P,UAAA,EACAh7P,KAAA86P,OAAA,KACA96P,KAAAyuW,iBAAA,KACAzuW,KAAA0uW,cAAA1uW,KAAA0uW,cAAA/1W,KAAAqH,MACAA,KAAA2uW,UAAA3uW,KAAA2uW,UAAAh2W,KAAAqH,MAEAA,KAAA4uW,gBAAA,IAAAb,EAAA,CACAc,uBAAA7uW,KAAA2hE,SAAAysS,aACAU,mBAAA9uW,KAAA2hE,SAAAysS,eAOAnxW,WACA,OAAAY,MAAA4rD,KAAAzpD,KAAA+jW,YAAA3mW,UACA13B,QAAA,CAAAqpY,EAAAr7c,IAAAq7c,EAAAr7c,EAAAuxE,QAAA,GAOApuE,QACAmpG,KAAA0iV,QAAA7I,UACA75U,KAAA86P,OAAA96P,KAAA86P,QAAAF,EAAA56P,KAAA0uW,cAAA1uW,KAAA2hE,SAAAysS,eAIApuW,KAAA4uW,gBAAA55X,QACAgrB,KAAAgvW,kBAAAhvW,KAAAgvW,kBAAAr2W,KAAAqH,MACAA,KAAA4uW,gBAAA5gY,GAAA,OAAAgyB,KAAAgvW,mBAEAhvW,KAAAg7P,UAAA,EACA3uI,EAAA,WAEArsH,KAAA2hE,SAAAsgS,UAAAjiW,KAAA2uW,YAQA93c,aACAmpG,KAAAyuW,kBAAAzuW,KAAAyuW,iBAAArhT,QACAptD,KAAA86P,QAAA96P,KAAA86P,OAAA1tM,QAEAptD,KAAA4uW,gBAAAp5O,eAAA,OAAAx1H,KAAAgvW,mBACAhvW,KAAA4uW,gBAAAruU,OAEAvgC,KAAAg7P,UAAA,QACAh7P,KAAA0xU,SACArlN,EAAA,WAQAx1N,eAEA,MAAAy1Y,EAAA,GACA,IAAA,MAAA2iE,KAAAjvW,KAAA+jW,YAAA3mW,SACA,IAAA,MAAA6sV,KAAAglB,EACA3iE,EAAAxhU,KAAAm/W,EAAAjqW,eAIA+lF,QAAA2gD,IAAA4lL,GACAtsS,KAAA+jW,YAAA32S,QAWAv2J,aAAA6kO,EAAAhoO,GACA,GAAAA,EAAA,GAAAA,EAAA,EACA,MAAA,IAAAolG,MAAA,4CAEAkH,KAAAwuW,YAAA/sX,IAAAi6I,EAAA7C,cAAAnlO,GASAmD,gBACA,GAAAmpG,KAAA0iV,QAAA7I,QAAA,CACA,MAAAQ,EAAAr6U,KAAA0iV,QAAA7I,QAAAr6U,OAAA66U,eAEA60B,EAAA70B,EAAAz3C,aAAA5iS,KAAA2hE,SAAA2sS,uBAAAh0B,gBACAt6U,KAAAmvW,eAAA,kBAAAD,GAEA,MAAAE,EAAA/0B,EAAAv3C,SAAA9iS,KAAA2hE,SAAA2sS,uBAAAh0B,gBACAt6U,KAAAmvW,eAAA,cAAAC,GACA,MAAAhgT,EAAA8/S,EAAAE,EACApvW,KAAAmvW,eAAA,UAAA//S,GACAi9D,EAAA,iBAAAj9D,GACApvD,KAAA86P,OAAAF,EAAA56P,KAAA0uW,cAAA1uW,KAAA2hE,SAAAysS,eAUAv3c,UAAAozb,GACA,MAAAvuN,EAAAuuN,EAAAC,WACAmlB,EAAA3zO,EAAA7C,cACAy2O,EAAAtvW,KAAA+jW,YAAAviX,IAAA6tX,GAEArvW,KAAA64E,KAAA,eAAAoxQ,GACAqlB,EACAA,EAAAxkY,KAAAm/W,GAEAjqV,KAAA+jW,YAAAtiX,IAAA4tX,EAAA,CAAAplB,IAGAjqV,KAAA0iV,QAAAzhC,UAAAC,QAAAz/T,IAAAi6I,EAAAA,EAAAlD,QAEAx4H,KAAAwuW,YAAAzvX,IAAAswX,IACArvW,KAAAwuW,YAAA/sX,IAAA4tX,EAAArvW,KAAA2hE,SAAA4sS,kBAGAvuW,KAAAmvW,eAAA,iBAAAnvW,KAAA/C,MASApmG,aAAAozb,GACA,MAAAvuN,EAAAuuN,EAAAC,WAAArxN,cACA,IAAAy2O,EAAAtvW,KAAA+jW,YAAAviX,IAAAk6I,GAEA4zO,GAAAA,EAAArqY,OAAA,GACAqqY,EAAAA,EAAAvhY,QAAAw8W,GAAAA,EAAAtmW,KAAAgmW,EAAAhmW,KACA+b,KAAA+jW,YAAAtiX,IAAAi6I,EAAA4zO,IACAA,IACAtvW,KAAA+jW,YAAAtgX,OAAAi4I,GACA17H,KAAAwuW,YAAA/qX,OAAAwmW,EAAAC,WAAArxN,eACA74H,KAAA64E,KAAA,kBAAAoxQ,IAUApzb,IAAA6kO,GACA,MAAAqoO,EAAA/jW,KAAAo8N,OAAA1gG,GACA,OAAAqoO,EAAA9+X,OACA8+X,EAAA,GAEA,KASAltc,OAAA6kO,GACA,IAAA3N,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,MAAA/7W,EAAAy3I,EAAA7C,cACAkrO,EAAA/jW,KAAA+jW,YAAAviX,IAAAyC,GAGA,OAAA8/W,EACAA,EAAAh2X,QAAAk8W,GAAA,SAAAA,EAAA/nD,KAAAvmL,SAEA,GASA9kN,kBAAA04c,GACAvvW,KAAAmvW,eAAA,oBAAAI,EAAAC,OAUA34c,eAAAhE,EAAAa,GACA,MAAAqhU,EAAA/0N,KAAA2hE,SAAA9uK,GACAw5N,EAAA,gDAAAx5N,EAAAa,EAAAqhU,GACArhU,EAAAqhU,IACA1oG,EAAA,6BAAArsH,KAAAy3R,QAAA5kY,EAAAa,GACAssG,KAAAyvW,uBAYA54c,kBACA,MAAAynb,EAAAt+U,KAAA2hE,SAAA28Q,eAGA,GAAAt+U,KAAA/C,MAAAqhV,EAEA,YADAt+U,KAAAyuW,iBAAA7zG,EAAA56P,KAAA2uW,UAAA3uW,KAAA2hE,SAAA0sS,mBAKA,MAAA5rE,EAAA5kS,MAAA4rD,KAAAzpD,KAAA0iV,QAAAzhC,UAAAxe,MAAArlS,UACAhR,MAAA,CAAAvlB,EAAAyS,KACAA,EAAAujO,YAAAvjO,EAAAujO,UAAA53O,QAAA4B,EAAAg2O,WAAAh2O,EAAAg2O,UAAA53O,OAEAqU,EAAA2K,GAAAu0I,SAAA3xJ,EAAAod,GAAAu0I,OACA,GAEA,EAJA,IAOA,IAAA,IAAArxJ,EAAA,EAAAA,EAAAs7T,EAAAx9T,QAAA+6B,KAAA/C,KAAAqhV,EAAAn3W,IACA,IAAA64B,KAAAxe,IAAAihT,EAAAt7T,GAAA8c,IAAA,CACAooI,EAAA,2CAAAo2K,EAAAt7T,GAAA8c,GAAA40I,eACA,IAIA,SAHA74H,KAAA0iV,QAAAkgB,OAAAqB,cAAAxhE,EAAAt7T,GAAA8c,KAGA+b,KAAAg7P,SACA,OAEA,MAAAvhQ,GACA4yH,EAAA98I,MAAA,6CAAAkqB,IAKAuG,KAAAyuW,iBAAA7zG,EAAA56P,KAAA2uW,UAAA3uW,KAAA2hE,SAAA0sS,kBASAx3c,sBACA,GAAAmpG,KAAA2hE,SAAA28Q,eAAAt+U,KAAA+jW,YAAA9mW,KAAA,CACA,MAAAyyW,EAAA7xW,MAAA4rD,KAAA,IAAAzmE,IAAA,IAAAgd,KAAAwuW,YAAAtxW,WAAA9Q,MAAA,CAAAvlB,EAAAyS,IAAAzS,EAAA,GAAAyS,EAAA,OACA+yI,EAAA,6BAAArsH,KAAAy3R,QAAAi4E,GACA,MAAAC,EAAAD,EAAA,GACA,GAAAC,EAAA,CACA,MAAAj0O,EAAAi0O,EAAA,GACAtjP,EAAA,8BAAArsH,KAAAy3R,QAAA/7J,GACArP,EAAA,iCAAArsH,KAAAy3R,QAAA/7J,GACA,IAAA,MAAAqoO,KAAA/jW,KAAA+jW,YAAA3mW,SACA,GAAA2mW,EAAA,GAAA7Z,WAAArxN,gBAAA6C,EAAA,CACAqoO,EAAA,GAAA/jX,QACA,kMC1XA,aAMA,MAAAqlK,aAAAA,GAAA9xP,EAAA,UACAq8c,EAAAr8c,EAAA,+BACA0wU,EAAA1wU,EAAA,QAAAA,CAAA,kCA8PAF,EAAAC,QA3NA,cAAA+xP,EAKAxuP,aAAAg4c,uBAAAA,EAAAC,mBAAAA,EAAAe,YAAAA,EAAAC,wBAAAA,GAAA,IACAvqV,QACA,MAAAilN,EAAAxqO,KAGAwqO,EAAAqkI,uBAAAA,GAAA,IACArkI,EAAAslI,wBAAAA,GAAA,GACAtlI,EAAAulI,qBAAAvlI,EAAAslI,wBAAA,IAAA,EAAAtlI,EAAAqkI,uBACArkI,EAAAwlI,qBAAAxlI,EAAAulI,qBAAA,EAEAvlI,EAAAskI,mBAAA,OAAAA,GAAA,IAAAA,OACAp5c,EACAo5c,GAAA,IACA7qI,EAAA,oDACAuG,EAAAqkI,uBAAArkI,EAAAskI,oBACAtkI,EAAAskI,mBACA7qI,EAAA,mCAAAuG,EAAAqkI,uBAAArkI,EAAAskI,oBAEA7qI,EAAA,0BAGAuG,EAAAqlI,YAAAA,EAGAh5c,QAEAwoG,WAAAyyF,SAAAzyF,WAAAyyF,QAAA83M,QACA3lE,EAAA,mCACAjkO,KAAAslE,IAAAjmE,WAAAyyF,QAAA83M,OACA5pS,KAAAiwW,WAAAC,IACA,MAAAtmE,EAAA5pS,KAAAslE,IAAA4qS,GACA,OAAA,IAAAtmE,EAAA,GAAAA,EAAA,GAAA,MAGA,oBAAArqS,QAAAA,OAAAmmE,aAAAnmE,OAAAmmE,YAAAJ,KACA2+J,EAAA,oCACAjkO,KAAAslE,IAAA/lE,OAAAmmE,YAAAJ,IAAA3sE,KAAA4G,OAAAmmE,aACA1lE,KAAAiwW,WAAAC,GAAAtqY,KAAAuoC,MAAAnO,KAAAslE,MAAA4qS,KAEAjsI,EAAA,6BACAjkO,KAAAslE,IAAAvnE,KAAAunE,IACAtlE,KAAAiwW,WAAAC,GAAAlwW,KAAAslE,MAAA4qS,GAGAlwW,KAAAmwW,aAAAnwW,KAAAowW,mBAuKA,oBAAA7wW,SAjKAS,KAAAqwW,yBAAA,IAAAT,EAEA5vW,KAAAqwW,yBAAAriY,GAAA,oBAAAsiY,IACAA,EACAtwW,KAAAuwW,gBAEAvwW,KAAAwwW,eACAxwW,KAAAywW,mBAKAzwW,KAAAqwW,2BAAArwW,KAAAqwW,yBAAAK,aACA1wW,KAAAuwW,eAIA15c,OACAmpG,KAAAywW,cAQA55c,eAEAmpG,KAAA2wW,kBAGA3wW,KAAA4wW,gBACA5wW,KAAA8uW,qBACA9uW,KAAA6wW,gBAAA5pG,aAAA,IAAAjnQ,KAAAwwW,gBAAAxwW,KAAA8uW,oBACA,mBAAA9uW,KAAA6wW,gBAAAzyQ,OACAp+F,KAAA6wW,gBAAAzyQ,UAUAvnM,cACAmpG,KAAA2wW,kBACA1gP,aAAAjwH,KAAA2wW,iBACA3wW,KAAA2wW,qBAAAj7c,GAEAsqG,KAAA6wW,kBACAjqG,cAAA5mQ,KAAA6wW,iBACA7wW,KAAA6wW,qBAAAn7c,GASAmB,eACA,MAAA04c,EAAAvvW,KAAA8wW,aACAvB,EAAA7kI,OAAA,GACA1qO,KAAA64E,KAAA,OAAA02R,GAUA14c,aAIA,MAAAk6c,EAAA,CACArmI,OAAA1qO,KAAAmwW,aAAAzlI,OACAsmI,MAAAhxW,KAAAmwW,aAAAa,MACAC,MAAAjxW,KAAAmwW,aAAAc,MACAzB,MAAAxvW,KAAAmwW,aAAAzlI,OACA1qO,KAAAmwW,aAAAe,QAAAlxW,KAAAmwW,aAAAzlI,OACAvkQ,OAAAgrY,kBACAC,SAAApxW,KAAAiwW,WAAAjwW,KAAAmwW,aAAAD,YAKA,OAHAlwW,KAAAmwW,aAAAnwW,KAAAowW,mBAEAnsI,EAAA,cAAA8sI,GACAA,EASAl6c,gBACA,MAAA2zU,EAAAxqO,KAEAqxW,EAAAzrY,KAAAwoC,SAAAo8N,EAAAulI,qBAAAvlI,EAAAwlI,qBAGAsB,EAAA,CACAC,YAAA3rY,KAAAwhL,KAAAojF,EAAAqkI,uBAAAwC,GACAnB,UAAA1lI,EAAAllK,OAGAjlB,EAAA,KAEA,IAAArgD,KAAA2wW,gBACA,OAEA,MAAAa,EAAAhnI,EAAAylI,WAAAqB,EAAApB,WAAAoB,EAAAC,YACA/mI,EAAAomI,gBAGApmI,EAAA2lI,aAAAzlI,SACAF,EAAA2lI,aAAAa,MAAAprY,KAAAq0B,IAAAuwO,EAAA2lI,aAAAa,MAAAQ,GACAhnI,EAAA2lI,aAAAc,MAAArrY,KAAAD,IAAA6kQ,EAAA2lI,aAAAc,MAAAO,GACAhnI,EAAA2lI,aAAAe,SAAAM,EACAvtI,EAAA,kBAAAutI,EAAAhnI,EAAA2lI,eAEAlsI,EAAA,gBAAAqtI,GAEAtxW,KAAA2wW,gBAAA9lS,YAAA,KAEA2/J,EAAAqlI,aAEAyB,EAAAC,YAAA,EACAD,EAAApB,UAAA1lI,EAAAllK,MACAklK,EAAAqlI,YAAAxvT,KAIAixT,EAAAC,aAAA,EAGAlxT,OAEAixT,EAAAC,aAEA,mBAAAvxW,KAAA2wW,gBAAAvyQ,OACAp+F,KAAA2wW,gBAAAvyQ,QAIAvnM,mBACA,MAAA,CACAq5c,UAAAlwW,KAAAslE,MACA0rS,MAAA7qY,OAAAgrY,kBACAF,MAAA9qY,OAAAsrY,kBACA/mI,OAAA,EACAwmI,QAAA,qGCxPA,aAEA,MAAA7rN,aAAAA,GAAA9xP,EAAA,UAEA0wU,EAAA1wU,EAAA,QAAAA,CAAA,2CAkHAF,EAAAC,QA1FA,cAAA+xP,EAMAxuP,cACA0uH,QACA,oBAAApwH,UAIA6qG,KAAA0xW,gCACA1xW,KAAA2xW,gCAJA1tI,EAAA,yDAgBAptU,gCACA,IAAAk2Y,EACA6kE,OACA,IAAAz8c,SAAA43Y,QACAA,EAAA,SACA6kE,EAAA,yBACA,IAAAz8c,SAAA08c,WACA9kE,EAAA,YACA6kE,EAAA,4BACA,IAAAz8c,SAAA28c,UACA/kE,EAAA,WACA6kE,EAAA,2BACA,IAAAz8c,SAAA48c,eACAhlE,EAAA,eACA6kE,EAAA,0BAEA5xW,KAAAgyW,QAAAjlE,EACA/sS,KAAAiyW,kBAAAL,EASA/6c,oCACA,IAAA1B,SAAA+wK,uBACA,IAAA/wK,SAAA6qG,KAAAgyW,SACA/tI,EAAA,sFAGA9uU,SAAA+wK,iBAAAlmE,KAAAiyW,kBAAAjyW,KAAAkyW,wBAAAv5W,KAAAqH,OAAA,GAUAnpG,YACA,QAAAnB,IAAAsqG,KAAAgyW,cAAAt8c,IAAAP,SAAA6qG,KAAAgyW,SAIA,OAAA78c,SAAA6qG,KAAAgyW,SAUAn7c,0BACA,MAAAs7c,GAAAh9c,SAAA6qG,KAAAgyW,SACA/tI,EAAAkuI,EAAA,eAAA,eAEAnyW,KAAA64E,KAAA,mBAAAs5R,+DCxHA,aAEA,MAAA31W,EAAAjpG,EAAA,UAEA,MAAAwnW,EACAlkW,YAAAwjK,EAAAyQ,EAAA10F,GACA,MAAAo0P,EAAAxqO,KAEAA,KAAAg7P,SAAAx+P,IACAwD,KAAAi7P,aAAA,EACAj7P,KAAAk7P,WAAApwL,EACA9qE,KAAAm7P,MAAA/kR,EACA4pB,KAAAoyW,YAAA,EAEApyW,KAAAqyW,cAAA,KACA7nI,EAAAywB,aAAA,GACAzwB,EAAA0wB,WAAA1wB,EAAAywB,cAAAz+P,IAAAguO,EAAAwwB,UACAxwB,EAAA8nI,UAAA9nI,EAAA0wB,cAEA1wB,EAAA4nI,YAAA,EACA/3S,EAAA+oC,MAAA,KAAAonI,EAAA2wB,SAIAn7P,KAAA86P,OAAAjwL,WAAA7qE,KAAAqyW,cAAAvnS,GAGAj0K,WAAAi0K,GACAA,IACAA,EAAA9qE,KAAAk7P,YAEA,MAAA51L,EAAA9oE,IACA8oE,EAAAwF,GAAA9qE,KAAAg7P,SAAAh7P,KAAAk7P,YAAA,GACAjrI,aAAAjwH,KAAA86P,QACA96P,KAAAsyW,UAAAxnS,IACA9qE,KAAAoyW,WAIApyW,KAAAsyW,UAAAxnS,IAHA9qE,KAAAg7P,SAAA11L,EACAtlE,KAAAi7P,aAAAnwL,GAMAj0K,UAAAi0K,GACA9qE,KAAAoyW,YAAA,EACApyW,KAAAg7P,SAAAx+P,IACAwD,KAAAi7P,aAAA,EACAj7P,KAAAk7P,WAAApwL,EACA9qE,KAAA86P,OAAAjwL,WAAA7qE,KAAAqyW,cAAAvnS,GAGAj0K,QACAo5N,aAAAjwH,KAAA86P,SA2BAznW,EAAAC,QAvBA,WACA,GAAA,mBAAA+iF,UAAA,GACA,MAAA,IAAAyiB,MAAA,mBAGA,GAAA,iBAAAziB,UAAA,GACA,MAAA,IAAAyiB,MAAA,kBAGA,IAAA1iB,EAEA,GAAAC,UAAApR,OAAA,EAAA,CACAmR,EAAA,IAAAynB,MAAAxnB,UAAApR,OAAA,GAGA,IAAA,IAAAkC,EAAA,EAAAA,EAAAiP,EAAAnR,OAAAkC,IACAiP,EAAAjP,GAAAkP,UAAAlP,EAAA,GAIA,OAAA,IAAA4zR,EAAA1kR,UAAA,GAAAA,UAAA,GAAAD,gDC5EA,aAEA/iF,EAAAC,QAAA,WACA,OAAAyqG,KAAAunE,qCCHA,aAEA,MAAA2+J,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,kBAAA,CACA10P,MAAA00P,EAAA,wBAGAnnB,EAAAvpT,EAAA,YACA6nT,EAAA7nT,EAAA,UACA4nT,UAAAA,GAAA5nT,EAAA,aACAw6N,EAAAx6N,EAAA,YACAg/c,aAAAC,GAAAj/c,EAAA,eACAsoO,MAAAA,GAAAtoO,EAAA,aAEAk/c,EAAAl/c,EAAA,uCAEAsqb,MAAAzvN,GAAA76N,EAAA,gBACAo5c,EAAAp5c,EAAA,eACAm/c,aAAAA,EAAAC,UAAAA,EAAA70B,IAAAA,GAAAvqb,EAAA,kBACAq/c,WAAAA,GAAAr/c,EAAA,kBACAs/c,EAAAt/c,EAAA,4BAEAu/c,EAAA58c,OAAAugP,IAAA,qCAOA,MAAA8rE,EASA1rT,aAAA8kU,OAAAA,EAAA4lF,SAAAA,IACAvhT,KAAA+yW,QAAAp3I,EAAAinI,OACA5iW,KAAA2sV,WAAAhxH,EAAA2tH,UACAtpV,KAAAy2V,mBAAA96H,EAAAyiH,kBACAp+U,KAAAgzW,UAAAzxD,EACAvhT,KAAA2hE,SAAAg6J,EAAA21F,QAAAusB,MACA79U,KAAA0iV,QAAA/mH,EACA37N,KAAA07H,OAAAigG,EAAAjgG,OAEA17H,KAAA2sV,WAAA3iK,OAAA57D,EAAApuH,KAAAizW,YAAAt6W,KAAAqH,OAQAnpG,mBAAAozb,WAAAA,EAAAz5N,OAAAA,IAEA,MAAA0iP,EAAA,IAAAL,EAAA,CAAAriP,OAAAA,IACAoB,QAAAshP,EAAAliP,OAEA,IAAAY,EACA,OAGA,MAAAuhP,EAAAnzW,KACA,IAAAozW,EAEA,OAAAxhP,EAAA9qJ,MACA,KAAA0rY,EAAA5yN,KAAAyzN,QACAhnP,EAAA,mCAAA49N,EAAAC,WAAArxN,qBACA65O,EAAA,CAAAS,QAAAA,EAAAlpB,WAAAA,EAAAipB,cAAAA,IACA,MAEA,KAAAV,EAAA5yN,KAAA0zN,IACAjnP,EAAA,+BAAA49N,EAAAC,WAAArxN,eACAu6O,QAAAT,EAAA,CACA1oB,WAAAA,EACAr4N,QAAAA,EACAshP,cAAAA,EACAC,QAAAA,IAEA,MAEA,KAAAX,EAAA5yN,KAAA2zN,KACAlnP,EAAA,gCAAA49N,EAAAC,WAAArxN,eACAu6O,QAAAR,EAAA,CACA3oB,WAAAA,EACAr4N,QAAAA,EACAshP,cAAAA,IAEA,MAEA,QACA7mP,EAAA,mCAAAuF,EAAA9qJ,MAIA,GAAAssY,EAAA,CAEA,MAAAla,EAAA,IAAA/9I,EAAAvpF,EAAA4hP,QAAAlyB,MAAA,IAEAmyB,EAAA,IAAAt4J,EAAAvpF,EAAA8hP,QAAApyB,MAAA,IACAqyB,EAAAlB,EAAA,CACAjiP,OAAA4iP,EACAla,WAAAA,EACAua,UAAAA,IAEA3sY,EAAA8qJ,EAAA9qJ,OAAA0rY,EAAA5yN,KAAA0zN,IAAA,QAAA,UACAjnP,EAAA,uBAAAvlJ,EAAA6sY,EAAAza,YAEA,MAAA3O,QAAAvqV,KAAAgzW,UAAAY,eAAAD,GACAtnP,EAAA,4BAAAvlJ,EAAA6sY,EAAAza,YACAl5V,KAAAu9D,SAAAv9D,KAAAu9D,QAAAgtR,IAYA1zb,WAAAysY,EAAA3uY,GAEA,MAAA2sb,EAAAh+C,EAAAllS,WAAAte,MAAA,gBACA+zX,EAAA,IAAA14J,EAAAmmI,EAAA,IACAwyB,EAAA,IAAA34J,EAAAmmI,EAAAA,EAAAr8W,OAAA,IACA8uY,EAAAF,EAAAzN,YACA4N,EAAAF,EAAA1N,YAEA,IAAA2N,IAAAC,EAAA,CACA,MAAAzjF,EAAA,8DAEA,MADAlkK,EAAA98I,MAAAghT,GACAzzE,EAAA,IAAAhkN,MAAAy3R,GAAA10J,EAAA2jO,kBAGA,MAAAyU,EAAAlmP,EAAA2M,cAAAq5O,GACAG,EAAAnmP,EAAA2M,cAAAs5O,GAEA,IAAAG,GAAA,EACAC,EAAAp0W,KAAAy2V,mBAAAj1W,IAAAyyX,GACAG,IACAA,QAAAp0W,KAAA+yW,QAAA9O,cAAA4P,EAAAl/c,GACAw/c,GAAA,GAGA,IACA,MAAAf,QAAAt1B,EAAA,CACAmM,WAAAmqB,EACAxiP,QAAA,CACA9qJ,KAAA0rY,EAAA5yN,KAAA0zN,IACAI,QAAA,CACAzvX,GAAA+b,KAAA07H,OAAApC,UACAgoN,MAAAthV,KAAA0iV,QAAArhC,WAAAj3U,KAAA4yO,GAAAA,EAAArkF,SAEA66O,QAAA,CACAvvX,GAAAiwX,EAAA56O,UACAgoN,MAAA,CAAA,IAAAnmI,EAAA24J,GAAAn7O,WAKA86O,EAAAI,EAAAQ,YAAA,oBAAAr0W,KAAA07H,OAAA7C,iBACA86O,EAAAlB,EAAA,CACAjiP,OAAA4iP,EACAla,WAAA51D,EACAmwE,UAAAA,IAIA,OAFApnP,EAAA,6BAAAsnP,EAAAza,YAEAl5V,KAAAgzW,UAAAsB,gBAAAX,GACA,MAAAl6W,GAGA,MAFA4yH,EAAA98I,MAAA,4BAAAkqB,GACA06W,SAAAC,EAAAp0X,QACAyZ,GAWA5iG,eAAAlC,EAAA4oK,GASA,MARA,mBAAA5oK,IACA4oK,EAAA5oK,EACAA,EAAA,IAIAqrG,KAAAu9D,QAAAA,EAEAovS,EAAA3sW,KAAA0iV,SASA7rb,OAAAwqZ,GAGA,OAFAA,EAAAxjT,MAAA/gB,QAAAukU,GAAAA,EAAA,CAAAA,IAEAtzU,QAAAu1T,GACAloF,EAAAmH,QAAA19N,QAAAy+S,KAIA9hT,IAAAtrF,OAAAspM,eACA,MAAA,UASA3oM,mBAAAmgP,GACA,OAAA35J,QAAA25J,GAAAA,EAAA87N,KAIAz/c,EAAAC,QAAAivT,wUCnOA,aAEA,IAAAjhE,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,oBAAAN,EAAAM,MAAA,kBAAA,IAEA1mD,EAAAq3Q,aAAA,WAoBA,SAAAA,EAAArrY,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA+QA,IACAk6K,EAAAjkJ,EA2NA,OAleAm1W,EAAA50W,UAAA72B,KAAA,EAQAyrY,EAAA50W,UAAA+1W,QAAA,KAQAnB,EAAA50W,UAAA61W,QAAA,KAQAjB,EAAA50W,UAAAtoG,KAAA,IAWAk9c,EAAAjvW,OAAA,SAAApkB,EAAAulI,GAWA,OAVAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAApY,MAAAtzE,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,GAAAC,MAAA9iK,EAAApY,MACA,MAAAoY,EAAAw0X,SAAAlgd,OAAAgnG,eAAAoD,KAAA1e,EAAA,YACAg8G,EAAAq3Q,aAAAgC,KAAAjxW,OAAApkB,EAAAw0X,QAAAjvP,EAAAs9B,OAAA,IAAA6C,QAAAC,SACA,MAAA3lK,EAAAs0X,SAAAhgd,OAAAgnG,eAAAoD,KAAA1e,EAAA,YACAg8G,EAAAq3Q,aAAAgC,KAAAjxW,OAAApkB,EAAAs0X,QAAA/uP,EAAAs9B,OAAA,IAAA6C,QAAAC,SACA,MAAA3lK,EAAA7pF,MAAA7B,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAAC,MAAA9iK,EAAA7pF,MACAovN,GAcA8tP,EAAAnuW,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAq3Q,aACAvkW,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAApY,KAAAknC,EAAAg0I,QACA,MACA,KAAA,EACA9iK,EAAAw0X,QAAAx4Q,EAAAq3Q,aAAAgC,KAAAnwW,OAAA4J,EAAAA,EAAA+zI,UACA,MACA,KAAA,EACA7iK,EAAAs0X,QAAAt4Q,EAAAq3Q,aAAAgC,KAAAnwW,OAAA4J,EAAAA,EAAA+zI,UACA,MACA,KAAA,EACA7iK,EAAA7pF,KAAA24G,EAAAg0I,QACA,MACA,QACAh0I,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAqzX,EAAApwN,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAq3Q,aACA,OAAA30U,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAq3Q,aACA,OAAA30U,EAAA92D,MACA,IAAA,MACA,KAAA,EACAoY,EAAApY,KAAA,EACA,MACA,IAAA,OACA,KAAA,EACAoY,EAAApY,KAAA,EACA,MACA,IAAA,SACA,KAAA,EACAoY,EAAApY,KAAA,EACA,MACA,IAAA,UACA,KAAA,EACAoY,EAAApY,KAAA,EAGA,GAAA,MAAA82D,EAAA81U,QAAA,CACA,GAAA,iBAAA91U,EAAA81U,QACA,MAAA3uW,UAAA,0CACA7lB,EAAAw0X,QAAAx4Q,EAAAq3Q,aAAAgC,KAAApyN,WAAAvkH,EAAA81U,SAEA,GAAA,MAAA91U,EAAA41U,QAAA,CACA,GAAA,iBAAA51U,EAAA41U,QACA,MAAAzuW,UAAA,0CACA7lB,EAAAs0X,QAAAt4Q,EAAAq3Q,aAAAgC,KAAApyN,WAAAvkH,EAAA41U,SAEA,OAAA51U,EAAAvoI,MACA,IAAA,UACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,wBACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,wBACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,4BACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,4BACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,qBACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,oBACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,2BACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,uBACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,yBACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,yBACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,yBACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,6BACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,6BACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,qBACA,KAAA,IACA6pF,EAAA7pF,KAAA,IACA,MACA,IAAA,oBACA,KAAA,IACA6pF,EAAA7pF,KAAA,IAGA,OAAA6pF,GAYAqzX,EAAAnwN,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAmBA,OAlBAsyC,EAAAuiC,WACA70E,EAAA92D,KAAAopG,EAAAp5C,QAAAzwD,OAAA,MAAA,EACAu3D,EAAA81U,QAAA,KACA91U,EAAA41U,QAAA,KACA51U,EAAAvoI,KAAA66K,EAAAp5C,QAAAzwD,OAAA,UAAA,KAEA,MAAA6Y,EAAApY,MAAAoY,EAAAsb,eAAA,UACAojC,EAAA92D,KAAAopG,EAAAp5C,QAAAzwD,OAAA60H,EAAAq3Q,aAAA3yN,KAAA1gK,EAAApY,MAAAoY,EAAApY,MAEA,MAAAoY,EAAAw0X,SAAAx0X,EAAAsb,eAAA,aACAojC,EAAA81U,QAAAx4Q,EAAAq3Q,aAAAgC,KAAAnyN,SAAAljK,EAAAw0X,QAAAxjS,IAEA,MAAAhxF,EAAAs0X,SAAAt0X,EAAAsb,eAAA,aACAojC,EAAA41U,QAAAt4Q,EAAAq3Q,aAAAgC,KAAAnyN,SAAAljK,EAAAs0X,QAAAtjS,IAEA,MAAAhxF,EAAA7pF,MAAA6pF,EAAAsb,eAAA,UACAojC,EAAAvoI,KAAA66K,EAAAp5C,QAAAzwD,OAAA60H,EAAAq3Q,aAAAiC,OAAAt1X,EAAA7pF,MAAA6pF,EAAA7pF,MAEAuoI,GAUA20U,EAAA50W,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAwBAkwN,EAAAiC,QACAnzN,EAAA,IAAAjkJ,EAAA5pG,OAAAU,OAAAmtP,IACAA,EAAA,KAAA,WAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,yBAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,yBAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,6BAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,6BAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,sBAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,qBAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,4BAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,wBAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,0BAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,0BAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,0BAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,8BAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,8BAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,sBAAA,IACAjkJ,EAAAikJ,EAAA,KAAA,qBAAA,IACAjkJ,GAYAm1W,EAAA3yN,KAAA,WACA,IAAAyB,EAAA,GAAAjkJ,EAAA5pG,OAAAU,OAAAmtP,GAKA,OAJAjkJ,EAAAikJ,EAAA,GAAA,OAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,QAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,UAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,WAAA,EACAjkJ,EANA,GASAm1W,EAAAgC,KAAA,WAkBA,SAAAA,EAAArtY,GAEA,GADA84B,KAAAshV,MAAA,GACAp6W,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA2JA,OAlJAotY,EAAA52W,UAAA1Z,GAAA09J,EAAAG,UAAA,IAQAyyN,EAAA52W,UAAA2jV,MAAA3/L,EAAA4D,WAWAgvN,EAAAjxW,OAAA,SAAApkB,EAAAulI,GAIA,GAHAA,IACAA,EAAAg9B,EAAAvtP,UACAuwN,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAA+E,IACA,MAAA/E,EAAAoiW,OAAApiW,EAAAoiW,MAAAr8W,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAAoiW,MAAAr8W,SAAAkC,EACAs9I,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAoiW,MAAAn6W,IAEA,OAAAs9I,GAcA8vP,EAAAnwW,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAq3Q,aAAAgC,KACAvmW,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAA+E,GAAA+pB,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAoiW,OAAApiW,EAAAoiW,MAAAr8W,SACAia,EAAAoiW,MAAA,IACApiW,EAAAoiW,MAAAx2W,KAAAkjC,EAAA2qH,SACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,IAAA7/D,EAAAsb,eAAA,MACA,MAAAmnJ,EAAAO,cAAA,wBAAA,CAAAr/E,SAAA3jF,IACA,OAAAA,GAWAq1X,EAAApyN,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAq3Q,aAAAgC,KACA,OAAA32U,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAq3Q,aAAAgC,KAOA,GANA,MAAA32U,EAAA35C,KACA,iBAAA25C,EAAA35C,GACA09J,EAAA99I,OAAAO,OAAAw5B,EAAA35C,GAAA/E,EAAA+E,GAAA09J,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA35C,KAAA,GACA25C,EAAA35C,GAAAhf,SACAia,EAAA+E,GAAA25C,EAAA35C,KAEA25C,EAAA0jT,MAAA,CACA,IAAAzjV,MAAA/gB,QAAA8gD,EAAA0jT,OACA,MAAAv8U,UAAA,4CACA7lB,EAAAoiW,MAAA,GACA,IAAA,IAAAn6W,EAAA,EAAAA,EAAAy2D,EAAA0jT,MAAAr8W,SAAAkC,EACA,iBAAAy2D,EAAA0jT,MAAAn6W,GACAw6K,EAAA99I,OAAAO,OAAAw5B,EAAA0jT,MAAAn6W,GAAA+X,EAAAoiW,MAAAn6W,GAAAw6K,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA0jT,MAAAn6W,KAAA,GACAy2D,EAAA0jT,MAAAn6W,GAAAlC,SACAia,EAAAoiW,MAAAn6W,GAAAy2D,EAAA0jT,MAAAn6W,IAGA,OAAA+X,GAYAq1X,EAAAnyN,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAgBA,IAfAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAA0jT,MAAA,IAEApxQ,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA35C,GAAA,IAEA25C,EAAA35C,GAAA,GACAisF,EAAAyoD,QAAA96H,QACA+/B,EAAA35C,GAAA09J,EAAAG,UAAAlkH,EAAA35C,OAGA,MAAA/E,EAAA+E,IAAA/E,EAAAsb,eAAA,QACAojC,EAAA35C,GAAAisF,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAA+E,GAAA,EAAA/E,EAAA+E,GAAAhf,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAA+E,IAAA/E,EAAA+E,IAEA/E,EAAAoiW,OAAApiW,EAAAoiW,MAAAr8W,OAAA,CACA24D,EAAA0jT,MAAA,GACA,IAAA,IAAAhwV,EAAA,EAAAA,EAAApS,EAAAoiW,MAAAr8W,SAAAqsB,EACAssC,EAAA0jT,MAAAhwV,GAAA4+E,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAoiW,MAAAhwV,GAAA,EAAApS,EAAAoiW,MAAAhwV,GAAArsB,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAoiW,MAAAhwV,IAAApS,EAAAoiW,MAAAhwV,GAGA,OAAAssC,GAUA22U,EAAA52W,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAkyN,EAlLA,GAqLAhC,EAngBA,GAsgBAl/c,EAAAC,QAAA4nM,4DCjhBA,aAEA,MAAAnmH,OAAA04W,GAAAl6b,EAAA,sBAEA84N,EADA94N,EAAA,QACA0wU,CAAA,2BAuEA5wU,EAAAC,QA/CA,UAAAk9N,OAAAA,EAAA0oO,WAAAA,EAAAua,UAAAA,GAAA9+c,EAAA,IACA,MAAAw1Y,KAAAA,EAAAp1T,OAAAA,GAAAy7I,EACAmjP,EAAA,CAIA98c,WAAAk+E,GACApgF,EAAAk7N,SAEA96I,EAAA04W,EAAA14W,EAAApgF,EAAAk7N,SAGA,UACAs6K,EAAAp1T,GACA,MAAA0kB,GAEA,YAAAA,EAAA3yB,MAIAulJ,EAAA5yH,GAGAzZ,KAEAjL,OAAApgF,EAAAk7N,OAAA49N,EAAA14W,EAAApgF,EAAAk7N,QAAA96I,EACAw1W,KAAA/5N,EACAijP,UAAAA,EACAva,WAAAA,EAEAub,SAAA,CAAA10X,KAAAge,KAAAunE,MAAAtlF,WAAAtqF,GACAsqF,MAAA,KACAmqT,EAAA,IAAA1xK,WAAA,IACAz4I,MAIA,SAAAA,IAIA,OAHA2zX,EAAAc,SAAAz0X,QACA2zX,EAAAc,SAAAz0X,MAAA+d,KAAAunE,OAEAS,QAAAC,UAGA,OAAA2tS,2ECxEA,aAEAtgd,EAAAC,QAAA,CACAuqb,MAAA,6DCHA,aAEA,MAAAx4L,aAAAA,GAAA9xP,EAAA,WACA4nT,UAAAA,GAAA5nT,EAAA,aAUAF,EAAAC,QAAAqoU,IACA,MAAA+4I,EAAA,IAAA1xX,IA2CA,MAAA8pH,EAAAt5M,OAAAiqG,OAAA,IAAA4nJ,EAAA,CACArlK,MAAA,IAAA+lF,QAAAC,UACAonC,OArCA95D,eAAA0pK,GACA,MAAAU,EAAAr3O,OAAA22O,GAAAl9N,MAAA,gBAAA3B,MAAAtX,GAAA,KAAAA,IAEA8tY,QAAAh5I,EAAA6wI,KAAA,IAAArxJ,EAAAuC,IACAk3J,EAAAD,EAAAzb,WAAAmb,YAAA,gBAEAK,EAAAjzX,IAAAkzX,EAAAzqB,WAAArxN,cAAA+7O,GACA9nQ,EAAAj0B,KAAA,cA+BAsrR,SAZA,WACA,MAAA7iB,EAAA,GACA,IAAA,MAAAtkI,KAAA03J,EAAAt3W,SACAkkV,EAAAx2W,KAAAkyO,GAEA,OAAAskI,KAoBA,OATA3lH,EAAAyiH,kBAAApwW,GAAA,mBAAAi8W,IACAyqB,EAAAjxX,OAAAwmW,EAAAC,WAAArxN,gBAIA/rB,EAAAj0B,KAAA,YAIAi0B,iECzEA,aAEA,MAAAm3H,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,sBAAA,CACA10P,MAAA00P,EAAA,4BAEAnnB,EAAAvpT,EAAA,YAEAw6N,EAAAx6N,EAAA,YACAshd,cAAAA,GAAAthd,EAAA,WACAs/c,EAAAt/c,EAAA,qBACAg/c,aAAAC,GAAAj/c,EAAA,gBACAk1U,KAAAA,GAAAl1U,EAAA,YACAsoO,MAAA12G,GAAA5xH,EAAA,iBAEAgtI,KAAAA,GAAAhtI,EAAA,UAEA66N,EAAA76N,EAAA,mBAsLAF,EAAAC,QAAA,CACAq/c,UAlKAr/T,gBAAA22S,WACAA,EAAAr4N,QACAA,EAAAshP,cACAA,EAAAC,QACAA,IAGA,IAAAA,EAAAxxS,SAAAm8Q,IAAAnhH,QAEA,OADAtwG,EAAA,yDACA6mP,EAAAluY,IAAA,CACA8B,KAAA0rY,EAAA5yN,KAAAk1N,OACAz/c,KAAAm9c,EAAAgC,OAAAO,uBAKA,IACAF,EAAAjjP,EAAAshP,GACA,MAAAz5W,GACA,OAAA4yH,EAAA98I,MAAA,kCAAA06W,EAAAC,WAAArxN,cAAAp/H,GAGA,IAAAm4H,EAAA4hP,QAEA,YADAnnP,EAAA,wDAKA,MAAA6nP,EAAA,IAAAnmP,EAAA6D,EAAA4hP,QAAAvvX,IAEA+wX,EAAA7B,EAAA1c,mBAAAj1W,IAAA0yX,GACA,IAAAc,IAAA7B,EAAAxxS,SAAAm8Q,IAAAllQ,OAEA,OADAyzC,EAAA,yEACA6mP,EAAAluY,IAAA,CACA8B,KAAA0rY,EAAA5yN,KAAAk1N,OACAz/c,KAAAm9c,EAAAgC,OAAAS,qBAKA,IAAAD,EACA,OAIA,MAAAE,EAAA,CACApuY,KAAA0rY,EAAA5yN,KAAA2zN,KACAC,QAAA5hP,EAAA4hP,QACAE,QAAA9hP,EAAA8hP,SAGA,IAAAyB,EACA,IACAA,QAAA50U,EAAA,CACA0pT,WAAA+qB,EACApjP,QAAAsjP,IAEA,MAAAz7W,GACA,OAAA4yH,EAAA98I,MAAAkqB,GAGA4yH,EAAA,+BAAA49N,EAAAC,WAAArxN,eACAq6O,EAAAvuN,MAAA,CACA79K,KAAA0rY,EAAA5yN,KAAAk1N,OACAz/c,KAAAm9c,EAAAgC,OAAAY,UAEA,MAAAC,EAAAnC,EAAAtuW,OAGA,OAAA6jO,EACA4sI,EACAF,EACAE,IA2FAv3B,IA9EAxqS,gBAAA22S,WACAA,EAAAr4N,QACAA,IAGA,MAAApB,OAAAA,SAAAy5N,EAAAO,UAAA,CAAAp8N,EAAAyvN,QAEAq1B,EAAA,IAAAL,EAAA,CAAAriP,OAAAA,IACA0iP,EAAAvuN,MAAA/yB,GAEA,MAAAjD,QAAAukP,EAAAliP,OAEA,IAAArC,EACA,MAAAmuF,EAAA,IAAAhkN,MAAA,+BAAAqsB,EAAA06U,wBAGA,GAAAlxO,EAAAt5N,OAAAm9c,EAAAgC,OAAAY,QAEA,OADA/oP,EAAA,8BACA6mP,EAAAtuW,OAKA,MAFAynH,EAAA,kDAAAsC,EAAAt5N,MACA69c,EAAAlzX,QACA88N,EAAA,IAAAhkN,MAAA,gCAAA61H,EAAAt5N,QAAA8vH,EAAA06U,yBAwDAyV,OA9CAhiU,gBAAA22S,WACAA,IAGA,MAAAz5N,OAAAA,SAAAy5N,EAAAO,UAAA,CAAAp8N,EAAAyvN,QAEAq1B,EAAA,IAAAL,EAAA,CAAAriP,OAAAA,IACA0iP,EAAAvuN,MAAA,CACA79K,KAAA0rY,EAAA5yN,KAAAyzN,UAGA,MAAA1kP,QAAAukP,EAAAliP,OAGA,aAFAkiP,EAAAlzX,WAEA2uI,GAAAA,EAAAt5N,OAAAm9c,EAAAgC,OAAAY,UAiCA1C,aAjBA,UAAAzoB,WACAA,EAAAipB,cACAA,EAAAC,QACAA,IAEA,MAAAmC,EAAAnC,EAAAxxS,SAAAm8Q,IAAAnhH,QACAtwG,EAAA,+BAAAipP,EAAArrB,EAAAC,WAAArxN,eACAq6O,EAAAluY,IAAA,CACA8B,KAAA0rY,EAAA5yN,KAAAk1N,OACAz/c,KAAAigd,EAAA9C,EAAAgC,OAAAY,QAAA5C,EAAAgC,OAAAO,gQCnMA,aAEA,MAAA55J,UAAAA,GAAA5nT,EAAA,cACAg/c,aAAAA,GAAAh/c,EAAA,eAaA,SAAAgid,EAAArC,EAAAv3P,GACAu3P,EAAAvuN,MAAA,CACA79K,KAAAyrY,EAAA3yN,KAAAk1N,OACAz/c,KAAAsmN,IAsCAtoN,EAAAC,QAAA,CACAuhd,cA7BA,SAAAplY,EAAAyjY,GACA,IACAzjY,EAAA+jY,SAAA/jY,EAAA+jY,QAAAlyB,OACA7xW,EAAA+jY,QAAAlyB,MAAAltb,SAAA4oT,GACA,IAAA7B,EAAA6B,KAGA,MAAAvjN,GAIA,MAHA87W,EAAArC,EAAAzjY,EAAA3I,OAAAyrY,EAAA3yN,KAAA0zN,IACAf,EAAAiC,OAAAgB,0BACAjD,EAAAiC,OAAAiB,4BACAh8W,EAGA,IACAhqB,EAAAikY,SAAAjkY,EAAAikY,QAAApyB,OACA7xW,EAAAikY,QAAApyB,MAAAltb,SAAA4oT,GACA,IAAA7B,EAAA6B,KAGA,MAAAvjN,GAIA,MAHA87W,EAAArC,EAAAzjY,EAAA3I,OAAAyrY,EAAA3yN,KAAA0zN,IACAf,EAAAiC,OAAAkB,0BACAnD,EAAAiC,OAAAmB,4BACAl8W,0ECrDA,aAEA,MAAAwqO,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,iCAAA,CACA10P,MAAA00P,EAAA,uCAGAupH,EAAAj6b,EAAA,sBAEAqid,EAAArid,EAAA,iBACAg/c,aAAAA,GAAAh/c,EAAA,eAmFAF,EAAAC,QA5EA,MASAuD,aAAA25N,OAAAA,EAAAitD,UAAAA,EAAA,OACAz9K,KAAAwwH,OAAAA,EAEAxwH,KAAA61W,MAAAD,EAAA51W,KAAAwwH,QAEAxwH,KAAAqwH,QAAAm9N,EAAAppV,OAAAgrV,WAAApvV,KAAA61W,MAAA/kP,OAAA,CAAAm+N,cAAAxxK,IAQA5mR,aACA,MAAA44E,QAAAuwB,KAAAqwH,QAAAjzI,OACA,GAAA3N,EAAA/7E,MAAA,CACA,MAAAA,EAAA6+c,EAAAnuW,OAAA30B,EAAA/7E,MAAA0xE,SAEA,OADAinJ,EAAA,oBAAA34N,EAAAozE,MACApzE,EAGA24N,EAAA,0CAEArsH,KAAAhgB,QASAnpF,MAAA44E,GACA48I,EAAA,wBAAA58I,EAAA3I,MAEAk5B,KAAA61W,MAAAlxN,MAAA6oM,EAAAlqV,OAAAuqS,OAAA0kE,EAAAjvW,OAAA7zB,GAAAgqJ,WAQA5iO,OAEA,OADAmpG,KAAA61W,MAAAjxW,OACA5E,KAAA61W,MAAArlP,OAMA35N,IAAA44E,GACAuwB,KAAA2kJ,MAAAl1K,GACAuwB,KAAAhgB,QAQAnpF,QACAw1N,EAAA,sBACArsH,KAAA4E,OAAAulS,KAAA,2HCzFA,aAEA,MAAA3oJ,EAAAjuP,EAAA,aACAmuP,EAAAnuP,EAAA,eACAmyY,EAAAnyY,EAAA,WAGAF,EAAAC,QAAAk9N,IACA,MAAAuyB,EAAArB,IACA5wB,EAAA0wB,EAAAhxB,EAAAz7I,QAGA+gY,EAAApwE,IACA,IAAAqwE,EAEA,MAAAC,EAAAxlP,EAAA25K,KAAA,wBACApnJ,EACA,MAAAhuK,QAAA+gY,EAAAzgQ,cACAtgI,EAHA,IAMAihY,EAAA93W,OAAAzE,IACAs8W,EAAAt8W,KAeA,MAAA,CACAq3H,OAAAA,EACAiyB,OAAAA,EACAvyB,OAfA,CACA25K,KAAAp1T,GACAghY,EACAhwS,QAAAw5B,OAAAw2Q,IAGAD,EAAA9vS,QAAAjxF,GACAihY,GAEAjhY,OAAA+7I,GAOAlsH,KAAA,IAAAm+I,EAAA/9K,MACA2/K,MAAA5B,EAAAj4K,KACAkmJ,KAAA19E,gBACAw9E,EAAA1zI,QAAA1pF,iGC5CA,MAAA4wU,EAAA/wU,EAAA,iBAEAF,EAAAC,QAAAyhF,IACA,MAAA+7I,EAAA,kBACA,IAAA6H,QACAo1E,EAAA,IAAAu2B,EAEA,UAAA,MAAA70N,KAAA16B,EACA,GAAA4jJ,EAQA,IAFAo1E,EAAA2gG,OAAAj/R,GAEAs+L,EAAA9oO,QAAA0zJ,GAAA,CACA,MAAAjsE,EAAAqhJ,EAAAgiG,aAAA,EAAAp3K,GAKA,GAJAo1E,EAAAm6B,QAAAvvG,GACAA,QAAAjsE,GAGAisE,EAAA,CACAo1E,EAAA9oO,SACA0zJ,QAAAo1E,EACAA,EAAA,IAAAu2B,GAEA,YAlBA3rG,QAAAo1E,EAAA2gG,OAAAj/R,GACAs+L,EAAA,IAAAu2B,EAwBA,GAAA3rG,EACA,MAAAnlO,OAAAiqG,OACA,IAAA3E,MAAA,uBAAA6/H,4BACA,CAAAtjO,KAAA,iBAAAw6M,OAAAk+F,IAlCA,GAwCA,OADAj9E,EAAA1zI,OACA0zI,wDC3CA,aAaAz9N,EAAAC,QAXA,KACA,MAAA6yY,EAAA,GAOA,OALAA,EAAA9wL,QAAA,IAAAtvC,SAAA,CAAAC,EAAAu5B,KACA4mM,EAAAngO,QAAAA,EACAmgO,EAAA5mM,OAAAA,KAGA4mM,+BCVA,aAEA,MAAAliE,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,uBAAA,CACA10P,MAAA00P,EAAA,8BAGAsuI,aAAAC,GAAAj/c,EAAA,eACA66N,EAAA76N,EAAA,iBACAs/c,EAAAt/c,EAAA,qBACAshd,cAAAA,GAAAthd,EAAA,WAkBAF,EAAAC,QAAAs/c,WAAA,UAAA3oB,WACAA,EAAAr4N,QACAA,EAAAshP,cACAA,IAGA,IACA2B,EAAAjjP,EAAAshP,GACA,MAAAz5W,GACA,OAAA4yH,EAAA98I,MAAA,mCAAA06W,EAAAC,WAAArxN,cAAAp/H,GASA,OALA4yH,EAAA,yBACA6mP,EAAAvuN,MAAA,CACA79K,KAAA0rY,EAAA5yN,KAAAk1N,OACAz/c,KAAAm9c,EAAAgC,OAAAY,UAEAlC,EAAAtuW,QAYAvxG,EAAAC,QAAAitI,KAAA+S,gBAAA22S,WACAA,EAAAr4N,QACAA,IAEA,MAAApB,OAAAA,SAAAy5N,EAAAO,UAAA,CAAAp8N,EAAAyvN,QACAxxN,EAAA,8BAAA49N,EAAAC,WAAArxN,eACA,MAAAq6O,EAAA,IAAAL,EAAA,CAAAriP,OAAAA,IAEA0iP,EAAAvuN,MAAA/yB,GACA,MAAAjD,QAAAukP,EAAAliP,OAEA,OAAArC,EAIAA,EAAAt5N,OAAAm9c,EAAAgC,OAAAY,SACA/oP,EAAA,oCAAA49N,EAAAC,WAAArxN,eACAq6O,EAAAtuW,SAGAynH,EAAA,mCAAAsC,EAAAt5N,WACA69c,EAAAlzX,SATAkzX,EAAAlzX,+ICtEA,aAEA,MAAAikP,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,gBAAA,CACA10P,MAAA00P,EAAA,uBAGAihI,mBACAA,EAAAC,qBACAA,GAEA5xc,EAAA,wBAEA0id,EAAA1id,EAAA,iBACA2id,eAAAA,GAAA3id,EAAA,YACA82c,oBACAA,GACA92c,EAAA,eAoFAF,EAAAC,QAjEA,MAOAuD,YAAA8kU,GACA37N,KAAA0iV,QAAA/mH,EACA37N,KAAA2hE,SAAA,IACAg6J,EAAA21F,QAAAusB,OAIA79U,KAAAm2W,WAAAn2W,KAAA2hE,SAAAkmS,UAAAlrI,SAAA,IAAAs5I,EAAA,CAAAt6I,OAAAA,KAAA37N,KAAA2hE,SAAAkmS,YAEA7nW,KAAAo2W,kBAAAp2W,KAAAo2W,kBAAAz9W,KAAAqH,MAQAnpG,QAEAmpG,KAAA2hE,SAAAm8Q,IAAAnhH,SAEA38N,KAAA2hE,SAAA+lS,UAAA/qI,UACA38N,KAAA+lQ,SAAAm/F,EACAllW,KAAAo2W,kBAAAp2W,KAAA2hE,SAAA+lS,UAAA/iG,IAAA3kQ,KAAA2hE,SAAA+lS,UAAAjC,YAUA5uc,OACAsuc,EAAAnlW,KAAA+lQ,UAQAlvW,0BACA,IACA,MAAA82N,QAAAuoP,EAAA7L,SACArqW,KAAA0iV,QAAA+gB,eAAA3jR,QAAA6tC,GACA,MAAAl0H,GACA,yBAAAA,EAAApkG,MACAg3N,EAAA98I,MAAA,4FAAAkqB,GAEAuG,KAAAugC,QAEA8rF,EAAA98I,MAAAkqB,+IC/FA,aAEA,MAAAwqO,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,qBAAA,CACA10P,MAAA00P,EAAA,2BAGA7rG,EAAA7kO,EAAA,2BACA8kO,EAAA9kO,EAAA,0BACA4nT,UAAAA,GAAA5nT,EAAA,aACAw6N,EAAAx6N,EAAA,YAEAsqb,MAAAzvN,GAAA76N,EAAA,iBACA+hd,OAAAA,GAAA/hd,EAAA,kBACA2id,eAAAA,GAAA3id,EAAA,YACA22c,mBACAA,EAAAC,iBACAA,EAAAC,mBACAA,EAAAC,oBACAA,GACA92c,EAAA,eA2QAF,EAAAC,QA3PA,MAOAuD,aAAA8kU,OAAAA,EAAAmsI,aAAAA,EAAA,EAAAryc,QAAAA,IACAuqG,KAAA0iV,QAAA/mH,EACA37N,KAAAy3R,QAAA97D,EAAAjgG,OACA17H,KAAAolW,WAAAzpI,EAAAslF,UACAjhT,KAAAy2V,mBAAA96H,EAAAyiH,kBACAp+U,KAAAq2W,kBAAA16I,EAAA4mI,iBACAviW,KAAAs2W,eAAA36I,EAAAinI,OAAAuE,cAEAnnW,KAAA8nW,aAAAA,EAKA9nW,KAAAu2W,cAAA,IAAA53X,IAEAqhB,KAAA4sV,kBAAA5sV,KAAA4sV,kBAAAj0V,KAAAqH,MACAA,KAAA4pV,oBAAA5pV,KAAA4pV,oBAAAjxV,KAAAqH,MAEAA,KAAAolW,WAAAp3X,GAAA,mBAAAgyB,KAAA4sV,mBACA5sV,KAAAy2V,mBAAAzoX,GAAA,kBAAAgyB,KAAA4pV,qBAMA5pV,KAAAw2W,SAAA,CAAAjnY,EAAAE,KACA48I,EAAA98I,MAAAE,GAAAF,GACA95E,GAAAA,EAAA85E,EAAAE,IAeA54E,yBAAA6kO,OAAAA,EAAAmhF,UAAAA,IACA,MAAA54N,EAAAy3I,EAAA7C,cAGAs0N,EAAAtwI,EAAA1+N,MAAAotH,GAAAA,IAAA6iB,IAGA,GAAA++N,IAAAntV,KAAAu2W,cAAAx3X,IAAAkF,IAGA,GAAAkpW,IAAAntV,KAAAu2W,cAAAx3X,IAAAkF,GAKA,IACA,MAAAgmW,EAAAjqV,KAAAy2V,mBAAAj1W,IAAAk6I,GACA,IAAAuuN,EACA,OAIA,GAAAA,EAAAiP,WAAA77I,aAAA5uO,SAAAy7X,GAEA,YADA79O,EAAA,yBAAApoI,sCAIAqxX,EAAA,CAAArrB,WAAAA,MAGAjqV,KAAAolW,WAAA5jD,aAAA//T,IAAAi6I,EAAAyuO,EAAA/xO,EAAAgyO,UACApqW,KAAAy2W,gBAAAxsB,EAAAhmW,IAEA,MAAAwV,GACAuG,KAAAw2W,SAAA/8W,SA1BAuG,KAAA02W,mBAAAzyX,GAoCAptF,oBAAAozb,GACA,MACAhmW,EADAgmW,EAAAC,WACArxN,cAGA74H,KAAAu2W,cAAAx3X,IAAAkF,IAIA+b,KAAA02W,mBAAAzyX,GAWAptF,sBAAAozb,EAAAhmW,GAEA,GAAA+b,KAAAu2W,cAAAt5W,MAAA+C,KAAA8nW,aACA,OAIA,MAAA6O,EAAA32W,KAAAolW,WAAAjkD,YAAAC,qBACA6oC,EAAAC,WAAAlqV,KAAAs2W,gBAGA,IAAAK,IAAAA,EAAA1xY,OACA,OAGA,MAAA2xY,EAAA,GAAAD,EAAA,GAAAv4W,yBACA4B,KAAAu2W,cAAAv3X,IAAAiF,GAGA,UACA+b,KAAAq2W,kBAAAjpQ,OAAA,CAAA,IAAA+tG,EAAAy7J,KAEA,MAAAn9W,GACAuG,KAAAw2W,SAAA/8W,GACAuG,KAAAu2W,cAAA9yX,OAAAQ,IAWAptF,mBAAAotF,GACA+b,KAAAu2W,cAAA9yX,OAAAQ,IAEA+b,KAAA62W,4BAAA,CAAA5yX,IAcAptF,kCAAAigd,EAAA,IAGA,GAAA92W,KAAAu2W,cAAAt5W,MAAA+C,KAAA8nW,aACA,OAGA,MAAAiP,EAAA,GAGA,IAAA,MAAA9yX,EAAA+yX,KAAAh3W,KAAAolW,WAAA5jD,aAAA90P,KAAAxvD,UAAA,CAEA,GAAA8C,KAAAu2W,cAAAx3X,IAAAkF,IAAA6yX,EAAAroY,SAAAwV,GACA,SAGA,MAAAgzX,EAAAD,EAAAx1X,IAAA2oX,GAGA,IAAA8M,GAAA5+O,EAAA4+O,KAAA7M,EACA,SAGA,MAAA1uO,EAAA3N,EAAA2M,cAAAz2I,GACAgmW,EAAAjqV,KAAAy2V,mBAAAj1W,IAAAk6I,GAGA,GAAAuuN,GAQA,SAHAjqV,KAAAy2W,gBAAAxsB,EAAAhmW,GAGA+b,KAAAu2W,cAAAt5W,MAAA+C,KAAA8nW,aACA,YARAiP,EAAAjsY,KAAA4wJ,GAaA,IAAA,MAAAA,KAAAq7O,EAIA,SAHA/2W,KAAAk3W,oBAAAx7O,GAGA17H,KAAAu2W,cAAAt5W,MAAA+C,KAAA8nW,aACA,OAKA,IACA,MAAAn6O,QAAAuoP,EAAA7L,GACA,UAAA,MAAA8M,KAAAn3W,KAAA0iV,QAAA+gB,eAAAwC,cAAAt4O,GAAA,CACA,IAAAwpP,EAAA91D,WAAAp8U,OACA,SAGA,MAAAy2J,EAAAy7O,EAAAlzX,GAMA,GALA+b,KAAAolW,WAAAjkD,YAAAniU,IAAA08I,EAAAy7O,EAAA91D,kBAEArhT,KAAAk3W,oBAAAx7O,GAGA17H,KAAAu2W,cAAAt5W,MAAA+C,KAAA8nW,aACA,QAGA,MAAAruW,GACAuG,KAAAw2W,SAAA/8W,IAOA5iG,0BAAA6kO,GACA,IACA,MAAAuuN,QAAAjqV,KAAA0iV,QAAA8pB,KAAA9wO,SACA17H,KAAAy2W,gBAAAxsB,EAAAvuN,EAAA7C,eACA,MAAAp/H,GACAuG,KAAAw2W,SAAA/8W,EAAA,mDAAAiiI,EAAA7C,4PC1RA,aAEA,MAAAtK,EAAAh7N,EAAA,QACA86N,EAAA96N,EAAA,sBAQAF,EAAAC,QAAA4id,eAAA5iU,MAAAld,IACA,MAAAuiG,GAAA,IAAA7P,aAAAxlH,OAAA8yB,GACA/iB,QAAAg7G,EAAAsK,EAAA,YAEA,OAAA,IAAApK,EAAAl7G,2ECfA,aAEA,MAAA4wN,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,iBAAA,CACA10P,MAAA00P,EAAA,uBAEAnnB,EAAAvpT,EAAA,aACA4nT,UAAAA,GAAA5nT,EAAA,aAEA6mW,EAAA7mW,EAAA,6BACA+9N,WAAAA,GAAA/9N,EAAA,uBACA87N,UAAAA,GAAA97N,EAAA,cAEA6jd,EAAA7jd,EAAA,mBACAkzc,qBAAAA,GAAAlzc,EAAA,iCACAmtc,EAAAntc,EAAA,gBAEAsoO,MAAAA,GAAAtoO,EAAA,cACA2zc,aACAA,EAAAJ,mBACAA,EAAAE,mBACAA,GACAzzc,EAAA,gBAwSAF,EAAAC,QArQA,MAKAuD,aAAA0rc,iBACAA,EAAAthD,UACAA,EAAAkmD,cACAA,EAAAV,EAAAI,iBACAA,EAAAC,EAAAG,YACAA,EAAAC,EAAAH,gBACAA,EAAAC,EAAAjqJ,UACAA,EAAA,KAEA/8M,KAAAuiW,iBAAAA,EACAviW,KAAAihT,UAAAA,EACAjhT,KAAAmnW,cAAAA,EACAnnW,KAAA6mW,iBAAAA,EACA7mW,KAAA8qE,QAAAm8R,EACAjnW,KAAA+mW,gBAAAA,EACA/mW,KAAAyoD,OAAA,IAAA,IAAA5qD,MAAAgpW,IAAAz8X,KAAA,CAAA+Q,EAAA5V,IAAAA,IACAy6B,KAAAq3W,cAAA,IAAAr0X,IACAgd,KAAAs3W,oBAAA,IAAAt0X,IAEA,IAAA,MAAAhuF,EAAAtB,KAAAF,OAAA0pG,QAAA6/M,GACA5B,EAAA4B,UAAAt7N,IAAAzsF,EAAAtB,GAOAmD,UACA,IAAA,MAAA21c,KAAAxsW,KAAAq3W,cAAAj6W,SACA,IACAovW,EAAA30O,WAAA7kF,QACA,MAAAv5C,GACA4yH,EAAA98I,MAAAkqB,GAGAuG,KAAAq3W,cAAAjqT,QAEA,IAAA,MAAAmqT,KAAAv3W,KAAAs3W,oBAAAl6W,SACAm6W,EAAAh4Q,OAAA,IAAA+xB,EAAA,yBAEAtxH,KAAAs3W,oBAAAlqT,QAaAv2J,oBAAAijb,EAAAnlb,EAAA,IACA,MAAA6id,QAAAx3W,KAAAy3W,6BAAA39B,GAEA,IAAA09B,EAAAl2B,MAAAr8W,OACA,MAAA63O,EAAA,IAAAhkN,MAAA,2CAAA+iI,EAAA0jO,wBAEA,MAAAmY,EAAA13W,KAAAq3W,cAAA71X,IAAAg2X,EAAAvzX,KAAA+b,KAAA23W,mBAAAH,EAAA7id,GAEA,IACA,MAAAs1b,QAAAytB,EAAAriQ,QAEA,OADAgX,EAAA,uBAAAmrP,EAAAvzX,IACAgmW,EACA,MAAAxwV,GAMA,MAJAi+W,EAAA7/O,WAAAhI,OAAAx8E,UACA55C,EAAApkG,KAAAwmO,EAAAskO,aAEA9zO,EAAA98I,MAAAkqB,GACAA,EACA,QACAi+W,EAAApqQ,WAYAz2M,mCAAAijb,GAEA,MAAA71V,EAAA,GAAA7d,SAAAC,OAAA,IAAAT,KAAAwoC,UAAA,IAAAhQ,WAAAL,KAAAunE,QACAsyS,EAAA,IAAA7xS,SAAA,CAAAC,EAAAu5B,KACAv/F,KAAAs3W,oBAAA71X,IAAAwC,EAAA,CAAA+hF,QAAAA,EAAAu5B,OAAAA,OAGAi4Q,QAAAzxS,QAAA40L,KAAA,CACA36P,KAAA63W,kBAAA/9B,GACA89B,IAKA,OAFA53W,KAAAs3W,oBAAA7zX,OAAAQ,GAEAuzX,EAaA3gd,wBAAAijb,GACA,MAAA71V,GAAAA,EAAAo9T,WAAAA,GAAAq/C,EAAA5mB,GAEAz4B,GACArhT,KAAAihT,UAAAE,YAAAniU,IAAAiF,EAAAo9T,GAGA,IAAAy2D,EAAA93W,KAAAihT,UAAAE,YAAAC,qBAAAn9T,EAAA+b,KAAAmnW,gBAAA,GAIAhsJ,EAAAM,YAAAq+H,KACAg+B,EAAAA,EAAA/pY,QAAAivO,IAAA88H,EAAA9/M,OAAAgjF,KACA86J,EAAAh/X,QAAAghW,IAIA,MAAAwH,EAAA,GACA,IAAA,MAAAz6W,KAAAixY,EAAA,QACA93W,KAAAy6P,SAAA5zR,IACAzyE,SAAA2jd,GAAAz2B,EAAAx2W,KAAAitY,KAIA,MAAArL,EAAAprB,EAAAvzW,QAAAlH,GAAAm5B,KAAAuiW,iBAAAgK,sBAAA1lY,KAEA,MAAA,CACAod,GAAAA,EAAA40I,cACAyoN,MAAAorB,GAaA71c,mBAAA2gd,EAAA7id,EAAA,IAKA,MAKAqjd,EAAA,IAAAZ,EAAA,CACA91B,MAAAk2B,EAAAl2B,MACA22B,WAPA,CAAAj7J,EAAAroT,KACA,GAAAA,EAAAk7N,OAAAx8E,QAAA,MAAAypK,EAAA,IAAAhkN,MAAA,mBAAA+iI,EAAAyjO,qBACA,OAAAt/V,KAAAuiW,iBAAAiK,KAAAxvJ,EAAAroT,IAMAiuc,OAAA5iW,OAIAk4W,EAAA,IAAA99G,EAAAp6P,KAAA8qE,SACA8sD,EAAA,CAAAsgP,EAAAroP,QACAl7N,EAAAk7N,QAAA+H,EAAA9sJ,KAAAn2E,EAAAk7N,QACA,MAAAA,EAAAR,EAAAuI,GAEA8/O,EAAA,CACAM,YAAAA,EACAngP,WAAAqgP,EACA7iQ,QAAA2iQ,EAAAljP,IAAA,IAAAngO,EAAAk7N,OAAAA,IACAviB,QAAA,KACA4qQ,EAAA9qT,QACAptD,KAAAq3W,cAAA5zX,OAAA+zX,EAAAvzX,MAIA,OADA+b,KAAAq3W,cAAA51X,IAAA+1X,EAAAvzX,GAAAyzX,GACAA,EAMA7gd,UAAA66G,GACA,MAAA09C,EAAAxpF,KAAAq0B,IAAAyX,EAAA1R,KAAA+mW,gBAAA/mW,KAAAyoD,OAAAxjF,QACAwjF,EAAAzoD,KAAAyoD,OAAAh+E,OAAA,EAAA2kF,GAEA,OADAi9D,EAAA,gDAAA36G,EAAA09C,EAAApvD,KAAAyoD,OAAAxjF,QACAwjF,EAMA5xJ,aAAA06G,GAEAvR,KAAAyoD,OAAAj9E,QAAA+lC,IAAA,IACA86G,EAAA,oBAAA96G,GACAvR,KAAAyoD,OAAA39E,KAAAymC,IASA16G,eAAAysY,GAMA,IAHAA,EAAArlF,aAAAxvO,SAAA,WAIA,MAAA,CAAA60T,GAGA,MAAA60E,QAAAn4W,KAAAo4W,eAAA90E,GAMA,aALAv9N,QAAA2gD,IAAAyxP,EAAA/tY,KAAAiuY,GACAr4W,KAAAy6P,SAAA49G,OAGAhzP,OACA3/I,QAAA,CAAAwvJ,EAAAojP,KACApjP,EAAA/2I,MAAAe,GAAAA,EAAA86I,OAAAs+O,MACApjP,EAAApqJ,KAAAwtY,GAEApjP,IACA,IASAr+N,qBAAAysY,GACA,IACAA,EAAA,IAAAnoF,EAAAmoF,EAAAllS,YAEA,aADAklS,EAAAt9N,UAEA,MAAA7qF,GAEA,OADAkxI,EAAA98I,MAAA,aAAA+zT,2BACA,6SCzTA,aAEA,MAAAxmF,EAAAvpT,EAAA,YACA67N,EAAA77N,EAAA,oBAAAJ,SACAk8N,UAAAA,GAAA97N,EAAA,cAEAqoY,EAAAroY,EAAA,UACAgld,EAAAhld,EAAA,SAqFAF,EAAAC,QAnEA,MAWAuD,aAAAyqb,MACAA,EAAA22B,WACAA,EAAArV,OACAA,IAEA5iW,KAAAshV,MAAAA,EACAthV,KAAA4iW,OAAAA,EACA5iW,KAAAi4W,WAAAA,EASAphd,UAAAlC,EAAA,IACA,MAAA8zJ,EAAAzoD,KAAA4iW,OAAA4V,UAAAx4W,KAAAshV,MAAAr8W,QAEA,GAAAwjF,EAAAxjF,OAAA,EACA,MAAA63O,EAAA,IAAAhkN,MAAA,4BAAA,sBAGA,MAAA2/W,EAAA,IAAA78E,EACAnzO,EAAAr0J,SAAAm9G,GAAAknW,EAAA3tY,KAAAymC,KACA,MAAAmnW,EAAA14W,KAAAshV,MAAAl3W,KAAA,IAAA,IAAAglJ,IACA,IAAAupP,EAAA,EAEA,IACA,aAAAJ,EAAAv4W,KAAAshV,MAAAl3W,KAAAkpE,MAAA0pK,EAAA71O,KACA,MAAAoqC,QAAAknW,EAAA9zW,QACA,IAAA4lV,EACA,IACA,MAAA16N,EAAA6oP,EAAAvxY,GAAA0oJ,OACA06N,QAAAvqV,KAAAi4W,WAAAj7J,EAAA,IAAAroT,EAAAk7N,OAAAl7N,EAAAk7N,OAAAR,EAAA,CAAAQ,EAAAl7N,EAAAk7N,SAAAA,IAEA6oP,EAAAjuY,OAAAtD,EAAA,GACA,QACAwxY,IAEA34W,KAAAshV,MAAAr8W,OAAA0zY,GAAAlwT,EAAAxjF,OACAwzY,EAAA3tY,KAAAymC,GAEAvR,KAAA4iW,OAAAgW,aAAAnwT,EAAAh+E,OAAAg+E,EAAAj9E,QAAA+lC,GAAA,GAAA,IAIA,OAAAg5U,MAEA,QACAmuB,EAAAtuY,KAAAqC,GAAAA,EAAAumE,UACAyV,EAAAr0J,SAAAm9G,GAAAvR,KAAA4iW,OAAAgW,aAAArnW,yICvFA,MAAAsnW,EAAAtld,EAAA,aACAmyY,EAAAnyY,EAAA,WAEAF,EAAAC,QAAA,MACAuD,cACAmpG,KAAA2gP,QAAA,IAAAk4H,EACA74W,KAAA84W,kBAAA,IAAAD,EAGAhid,KAAA44G,GACA,MAAA4lG,QAAAA,EAAArvC,QAAAA,GAAA0/N,IAGA,OAFA1lS,KAAA2gP,QAAA71Q,KAAA,CAAA2kC,MAAAA,EAAAu2D,QAAAA,IACAhmE,KAAA2oS,WACAtzL,EAGAx+M,WACA,MAAAmpG,KAAA84W,kBAAA5kN,YAAAl0J,KAAA2gP,QAAAzsF,WAAA,CACA,MAAA6kN,EAAA/4W,KAAA84W,kBAAAn0W,QACAwqV,EAAAnvV,KAAA2gP,QAAAh8O,QACAo0W,EAAA/yS,QAAAmpR,EAAA1/U,OACA0/U,EAAAnpR,WAIAnvK,QACA,MAAAw+M,QAAAA,EAAArvC,QAAAA,GAAA0/N,IAGA,OAFA1lS,KAAA84W,kBAAAhuY,KAAA,CAAAk7F,QAAAA,IACAhmE,KAAA2oS,WACAtzL,EAGAx+M,UACA,OAAAmpG,KAAA2gP,QAAAzsF,+ECjCA,aACA,MAAA8kN,EAAAzld,EAAA,UACA0ld,EAAA1ld,EAAA,gBAEAF,EAAAC,QAAA,CAAAs2U,EAAAj1U,KACA,MAAAukd,EAAAF,EAAApvI,EAAA,IAAAj1U,EAAA4uF,MAAA,IAEA,OAAA01X,EAAAr0X,IAAA0uD,MAAAA,IACA6lU,GAAA,KACAD,EAAAlxG,YAGA,MAAAt0W,SAAAwld,EACA,OAAAxld,IANAuld,IAUA5ld,EAAAC,QAAAkza,eAAAwyC,EAAAxyC,oFCjBA,aACA,MAAAA,EAAAjza,EAAA,mBACA0ld,EAAA1ld,EAAA,gBAEA,MAAA6ld,UAAAtgX,OA6EAzlG,EAAAC,QA3EA,CAAAs2U,EAAAj1U,IAAA,IAAAskd,GAAA,CAAAjzS,EAAAu5B,EAAA45Q,KACA,MAAA51X,MACAA,EAAAxV,OACAA,EAAA,MAAA,IACAp5E,EAEA,IAAAwxE,OAAAu/K,SAAAniK,GAEA,YADAg8G,EAAA,IAAAx6F,UAAA,wCAAApwG,EAAA4uF,QAIA,MAAA6Z,EAAA,GACA21B,EAAA,GACA,IAAAsmV,EAAA,EACAC,GAAA,EAEA,MAAAC,EAAA,IAAA56X,IAeA66X,EAAA,KACA,IAAA,MAAAnkQ,KAAAu0H,EACA2vI,EAAAx6X,IAAAs2H,IAAA,mBAAAA,EAAA2yJ,QACA3yJ,EAAA2yJ,UAKAmxG,EAAAK,GAEA,IAAA,MAAA37X,KAAA+rP,EACAyvI,IAEA,WACA,IACA,MAAA3ld,QAAAmqF,EAEA,GAAAy7X,EACA,OAGA,IAAAvrY,EAAAr6E,GACA,MAAA,IAAA0ld,EAAA,iCAGAh8W,EAAAtyB,KAAAp3E,GACA,MAAA67E,GACAwjD,EAAAjoD,KAAAyE,GACA,QACAgqY,EAAAv6X,IAAAnB,IAEAy7X,IA5CAl8W,EAAAn4B,SAAAse,IACAyiF,EAAA5oE,GACAk8W,GAAA,GAGAD,EAAAtmV,EAAA9tD,OAAAse,IACAg8G,EAAA,IAAAinO,EAAAzzS,IACAumV,GAAA,GAGAA,IAmCAE,MAnBA,GAyBAj2X,EAAA81X,IACA95Q,EAAA,IAAAggC,WAAA,sCAAA5qO,EAAA4uF,6BAAA81X,YACAG,QAKAnmd,EAAAC,QAAAkza,eAAAA,EACAnza,EAAAC,QAAA8ld,YAAAA,gFCnFA,aACA,MAAAK,EAAAlmd,EAAA,iBACAmmd,EAAAnmd,EAAA,eAIA,MAAAiza,UAAA1tU,MACAjiG,YAAAk8H,GACA,IAAAl1B,MAAA/gB,QAAAi2C,GACA,MAAA,IAAAhuB,UAAA,6CAAAguB,GAgBA,IAAAp5C,GAbAo5C,EAAA,IAAAA,GAAA3oD,KAAAmF,GACAA,aAAAupB,MACAvpB,EAGA,OAAAA,GAAA,iBAAAA,EAEA/7E,OAAAiqG,OAAA,IAAA3E,MAAAvpB,EAAAoK,SAAApK,GAGA,IAAAupB,MAAAvpB,MAIAnF,KAAAmF,GAEA,iBAAAA,EAAAioC,MAAAkiW,EAAAnqY,EAAAioC,OAxBAt+B,QAAA,gDAAA,IAwBA7S,OAAAkJ,KAEAjF,KAAA,MACAqP,EAAA,KAAA8/X,EAAA9/X,EAAA,GACA4rC,MAAA5rC,GAEAqmB,KAAAntG,KAAA,iBAEAW,OAAAC,eAAAusG,KAAA,UAAA,CAAAtsG,MAAAq/H,IAGAl8H,EAAAX,OAAAu0J,YACA,IAAA,MAAAl7E,KAAAywB,KAAA25W,cACApqY,GAKAl8E,EAAAC,QAAAkza,2EC9CA,aAEAnza,EAAAC,QAAA,CAAAqoG,EAAApY,EAAA,EAAA5uF,KAOA,GANAA,EAAA,CACAqxF,OAAA,IACA4zX,mBAAA,KACAjld,GAGA,iBAAAgnG,EACA,MAAA,IAAAoJ,UACA,uDAAApJ,OAIA,GAAA,iBAAApY,EACA,MAAA,IAAAwhB,UACA,uDAAAxhB,OAIA,GAAA,iBAAA5uF,EAAAqxF,OACA,MAAA,IAAA+e,UACA,gEAAApwG,EAAAqxF,YAIA,GAAA,IAAAzC,EACA,OAAAoY,EAGA,MAAAigC,EAAAjnI,EAAAild,kBAAA,MAAA,cAEA,OAAAj+W,EAAAziB,QAAA0iD,EAAAjnI,EAAAqxF,OAAAP,OAAAlC,mCCjCA,aACA,MAAAmxV,EAAAnhb,EAAA,MAEAsmd,EAAA,0BACAC,EAAA,+GACAC,OAAA,IAAArlC,EAAAslC,QAAA,GAAAtlC,EAAAslC,UAEA3md,EAAAC,QAAA,CAAAkkH,EAAA7iH,KACAA,EAAAnB,OAAAiqG,OAAA,CAAAw8W,QAAA,GAAAtld,GAEA6iH,EAAAt+B,QAAA,MAAA,KACA4G,MAAA,MACA/R,QAAAkH,IACA,MAAAilY,EAAAjlY,EAAAqI,MAAAu8X,GACA,GAAA,OAAAK,IAAAA,EAAA,GACA,OAAA,EAGA,MAAA58X,EAAA48X,EAAA,GAGA,OACA58X,EAAA7O,SAAA,2CACA6O,EAAA7O,SAAA,8CAKAqrY,EAAAr0Y,KAAA6X,MAEAvP,QAAAkH,GAAA,KAAAA,EAAAuC,SACApN,KAAA6K,GACAtgF,EAAAsld,OACAhlY,EAAAiE,QAAA2gY,GAAA,CAAA36X,EAAA9D,IAAA8D,EAAAhG,QAAAkC,EAAAA,EAAAlC,QAAA6gY,EAAA,QAGA9kY,IAEA3K,KAAA,+CCtCA,aAEA,MAAA6vY,UAAArhX,MACAjiG,YAAA++S,GACArwL,MAAAqwL,GAAA,wBACA51M,KAAAntG,KAAA,cAGAund,iBACA,OAAA,GAIA,MAAAnB,EACApid,UAAAwjd,GACA,MAAA,IAAAhN,IACA,IAAA4L,GAAA,CAAAjzS,EAAAu5B,EAAA45Q,KACA9L,EAAAviY,KAAAquY,GAEAkB,KAAAhN,GAAApvW,KAAA+nE,EAAAu5B,MAKA1oM,YAAAyjd,GACAt6W,KAAAu6W,gBAAA,GACAv6W,KAAAw6W,YAAA,EACAx6W,KAAAy6W,aAAA,EACAz6W,KAAA06W,iBAAA,EAEA16W,KAAA26W,SAAA,IAAA50S,SAAA,CAAAC,EAAAu5B,KACAv/F,KAAA46W,QAAAr7Q,EAEA,MAYA45Q,EAAA57S,IACA,IAAAv9D,KAAAw6W,WACA,MAAA,IAAA1hX,MAAA,kEAGAkH,KAAAu6W,gBAAAzvY,KAAAyyF,IAYA,OATA/pK,OAAAq5U,iBAAAssI,EAAA,CACA0B,aAAA,CACAr5X,IAAA,IAAAwe,KAAA06W,gBACAj5X,IAAA6kS,IACAtmR,KAAA06W,gBAAAp0F,MAKAg0F,GA7BA5md,IACAssG,KAAAy6W,aAAAtB,EAAA0B,eACA76W,KAAAw6W,YAAA,EACAx0S,EAAAtyK,OAIA67E,IACAywB,KAAAw6W,YAAA,EACAj7Q,EAAAhwH,KAoBA4pY,MAIAtid,KAAAikd,EAAAC,GAEA,OAAA/6W,KAAA26W,SAAA18W,KAAA68W,EAAAC,GAGAlkd,MAAAkkd,GACA,OAAA/6W,KAAA26W,SAAAz8W,MAAA68W,GAGAlkd,QAAAoxW,GACA,OAAAjoQ,KAAA26W,SAAA90D,QAAA59C,GAGApxW,OAAA++S,GACA,GAAA51M,KAAAw6W,aAAAx6W,KAAAy6W,YAAA,CAMA,GAFAz6W,KAAAy6W,aAAA,EAEAz6W,KAAAu6W,gBAAAt1Y,OAAA,EACA,IACA,IAAA,MAAAs4F,KAAAv9D,KAAAu6W,gBACAh9S,IAEA,MAAAhuF,GAEA,YADAywB,KAAA46W,QAAArrY,GAKAywB,KAAA06W,iBACA16W,KAAA46W,QAAA,IAAAT,EAAAvkK,KAIAwkK,iBACA,OAAAp6W,KAAAy6W,aAIAjnd,OAAA46T,eAAA6qJ,EAAAt7W,UAAAooE,QAAApoE,WAEAtqG,EAAAC,QAAA2ld,EACA5ld,EAAAC,QAAA6md,YAAAA,gCC7GA,aACA,MAAAl2I,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,mBAAA,CACA10P,MAAA00P,EAAA,yBAEA+2I,EAAAznd,EAAA,qBACAg3L,EAAAh3L,EAAA,iBACAy6N,EAAAz6N,EAAA,kBACAspU,IAAAA,GAAAtpU,EAAA,uBACA0nd,EAAA1nd,EAAA,SACA0rP,EAAA1rP,EAAA,YACA8kO,EAAA9kO,EAAA,yBACA6kO,EAAA7kO,EAAA,2BAGAA,EAAA,yBA2BA,MACA2nd,EAAA,SACAC,EAAA,IAAAppX,QAGAqpX,EACA,GADAA,EAEA,GAFAA,EAGA,IAGAnzT,EAAA,CAEAizJ,IAAA,CACA19B,UAAA,GACA69L,eAAA,IACAx9M,KAAA,oEACAxqJ,KAAA,aAOA,SAAAioW,EAAAzod,GACA,QAAAA,IACA,iBAAAA,GACAA,IAAAmod,EAAAnod,EAAA2kF,SAaA87D,eAAAioU,EAAA9hX,GACA,MAEAslG,EAAA,IAAAn5H,KAAAwoC,SAFA,IAKA,YADA,IAAA23D,SAAAC,GAAA6E,WAAA7E,EAAA+4B,KACAtlG,EAUA,SAAA+hX,EAAA3od,GACA,OAAA,IAAAgqU,EAzDA,UAyDAhqU,GAUA,SAAA4od,EAAA5od,GACA,OAAA,IAAAgqU,EAAAq+I,EAAArod,GAgcAQ,EAAAC,QArbA,MAQAuD,YAAAojY,EAAAtlY,GACA,IAAAslY,EACA,MAAA,IAAAnhS,MAAA,qBAOA,GALAkH,KAAAi6R,MAAAA,EAEAj6R,KAAA+gE,KAAAwpB,EAAAtiC,EAAAtzJ,GAGAqrG,KAAA+gE,KAAAy/L,MAAAxgQ,KAAA+gE,KAAAy/L,KAAAv7R,OAAA,GACA,MAAA,IAAA6zB,MAAA,oCAEA,GAAAkH,KAAA+gE,KAAAm6I,IAAA19B,UAAA49L,EACA,MAAA,IAAAtiX,MAAA,+BAAAsiX,WAEA,GAAAp7W,KAAA+gE,KAAAm6I,IAAAr9C,KAAA54L,OAAAm2Y,EACA,MAAA,IAAAtiX,MAAA,gCAAAsiX,WAEA,GAAAp7W,KAAA+gE,KAAAm6I,IAAAmgK,eAAAD,EACA,MAAA,IAAAtiX,MAAA,oCAAAsiX,KAGA,MAAAlgK,EAAAl7M,KAAA+gE,KAAAy/L,KACAxyI,EAAAwwC,OACAx+J,KAAA+gE,KAAAy/L,KACAxgQ,KAAA+gE,KAAAm6I,IAAAr9C,KACA79J,KAAA+gE,KAAAm6I,IAAAmgK,eACAr7W,KAAA+gE,KAAAm6I,IAAA19B,UACAx9K,KAAA+gE,KAAAm6I,IAAA7nM,MACA,GAEA8nW,EAAA15X,IAAAue,KAAA,CAAAk7M,IAAAA,IAaAwgK,UACA,OAAA,IAAAT,EAAAj7W,KAAAm7W,EAAA35X,IAAAwe,MAAAk7M,KAQArkT,yBACA,MAAAlC,EAAAnB,OAAAiqG,OAAA,GAAAwqD,GACAq3H,EAAA,EAAA15M,KAAAwhL,KAAAg0N,EAAA,GAEA,OADAzmd,EAAAumT,IAAAr9C,KAAAxlC,EAAArK,EAAA+gD,YAAAuQ,GAAA,UACA3qR,EASAA,qBACA,OAAAszJ,EAWApxJ,gBAAAhE,EAAAi0E,EAAAm2B,EAAA,MACA,MAAAqC,EAAAU,KAEA,IAAAs7W,EAAAzod,IAAA,SAAAA,EACA,OAAA0od,EAAAt8N,EAAA,IAAAnmJ,MAAA,qBAAAjmG,MAAA,yBAGA,GAAA,iBAAAi0E,EACA,OAAAy0Y,EAAAt8N,EAAA,IAAAnmJ,MAAA,qBAAAhyB,MAAA,yBAGA,MAAA60Y,EAAAH,EAAA3od,GAEA,SADAysG,EAAA26R,MAAAl7S,IAAA48X,GACA,OAAAJ,EAAAt8N,EAAA,IAAAnmJ,MAAA,QAAAjmG,qBAAA,2BAEA,OAAAi0E,EAAAsC,eACA,IAAA,MACA,IAAAjD,OAAAkgT,cAAAppR,IAAAA,EAAA,KACA,OAAAs+W,EAAAt8N,EAAA,IAAAnmJ,MAAA,wBAAAmE,KAAA,yBAOA,IAAA2+W,EACA,IAEA,MAAAtmM,QAAAtnD,EAAA75N,KAAAkmO,gBAAAvzJ,EAAAm2B,GACAwtL,QAAAnV,EAAArxL,KAEAi3N,EAAAigK,EAAA35X,IAAAwe,MAAAk7M,IACA77C,QAAAiW,EAAA1yD,OAAAs4F,GACA0gK,EAAA,CACA/od,KAAAA,EACAoxF,GAAAwmM,GAEA,MAAAgvG,EAAAn6R,EAAA26R,MAAAR,QACAA,EAAApoK,IAAAsqP,EAAAvjP,EAAAinC,IACAo6H,EAAApoK,IAAAoqP,EAAA5od,GAAAulO,EAAAvwJ,KAAAC,UAAA8zY,WAEAniF,EAAApgC,SACA,MAAA5/P,GACA,OAAA8hX,EAAA9hX,GAGA,OAAAmiX,EAQA/kd,iBACA,MAAAyoG,EAAAU,KACA0oG,EAAA,CACA/9G,OAAAuwX,GAGAx9P,EAAA,GACA,UAAA,MAAAhqN,KAAA4rG,EAAA26R,MAAAvxL,MAAAA,GACAgV,EAAA5yI,KAAAjD,KAAAoH,MAAAopJ,EAAA3kO,EAAAA,SAGA,OAAAgqN,EASA7mN,kBAAAotF,GACA,IAEA,aADA+b,KAAAs4R,YACAn6S,MAAA9pF,GAAAA,EAAA4vF,KAAAA,IACA,MAAAwV,GACA,OAAA8hX,EAAA9hX,IAUA5iG,oBAAAhE,GACA,IAAAyod,EAAAzod,GACA,OAAA0od,EAAAt8N,EAAA,IAAAnmJ,MAAA,qBAAAjmG,MAAA,yBAGA,MAAA8od,EAAAF,EAAA5od,GACA,IACA,MAAAk5E,QAAAi0B,KAAAi6R,MAAAz4S,IAAAm6X,GACA,OAAA9zY,KAAAoH,MAAAopJ,EAAAtsJ,IACA,MAAA0tB,GACA,OAAA8hX,EAAAt8N,EAAA,IAAAnmJ,MAAA,QAAAjmG,sBAAA4mG,EAAA9f,WAAA,uBAUA9iF,gBAAAhE,GAEA,IAAAyod,EAAAzod,IAAA,SAAAA,EACA,OAAA0od,EAAAt8N,EAAA,IAAAnmJ,MAAA,qBAAAjmG,MAAA,yBAEA,MAAA8od,EAAAH,EAAA3od,GACA+od,QALA57W,KAKAstT,cAAAz6Z,GACA4mY,EANAz5R,KAMAi6R,MAAAR,QAIA,OAHAA,EAAAh2S,OAAAk4X,GACAliF,EAAAh2S,OAAAg4X,EAAA5od,UACA4mY,EAAApgC,SACAuiH,EAUA/kd,gBAAAwhN,EAAAwzM,GACA,MAAAvsT,EAAAU,KACA,IAAAs7W,EAAAjjQ,IAAA,SAAAA,EACA,OAAAkjQ,EAAAt8N,EAAA,IAAAnmJ,MAAA,yBAAAu/G,MAAA,6BAEA,IAAAijQ,EAAAzvD,IAAA,SAAAA,EACA,OAAA0vD,EAAAt8N,EAAA,IAAAnmJ,MAAA,yBAAA+yT,MAAA,6BAEA,MAAAgwD,EAAAL,EAAAnjQ,GACAyjQ,EAAAN,EAAA3vD,GACAkwD,EAAAN,EAAApjQ,GACA2jQ,EAAAP,EAAA5vD,GAGA,SADAvsT,EAAA26R,MAAAl7S,IAAA+8X,GACA,OAAAP,EAAAt8N,EAAA,IAAAnmJ,MAAA,QAAA+yT,qBAAA,2BAEA,IACA,MAAAxsJ,QAAA//J,EAAA26R,MAAAz4S,IAAAq6X,GACA9vY,QAAAuzB,EAAA26R,MAAAz4S,IAAAu6X,GAEAH,EAAA/zY,KAAAoH,MAAAopJ,EAAAtsJ,IACA6vY,EAAA/od,KAAAg5Z,EACA,MAAApyB,EAAAn6R,EAAA26R,MAAAR,QAMA,OALAA,EAAApoK,IAAAyqP,EAAAz8M,GACAo6H,EAAApoK,IAAA2qP,EAAA5jP,EAAAvwJ,KAAAC,UAAA8zY,KACAniF,EAAAh2S,OAAAo4X,GACApiF,EAAAh2S,OAAAs4X,SACAtiF,EAAApgC,SACAuiH,EACA,MAAAniX,GACA,OAAA8hX,EAAA9hX,IAWA5iG,gBAAAhE,EAAAskO,GACA,IAAAmkP,EAAAzod,GACA,OAAA0od,EAAAt8N,EAAA,IAAAnmJ,MAAA,qBAAAjmG,MAAA,yBAEA,IAAAskO,EACA,OAAAokP,EAAAt8N,EAAA,IAAAnmJ,MAAA,wBAAA,0BAGA,MAAA6iX,EAAAH,EAAA3od,GACA,IACA,MAAAk5E,QAAAi0B,KAAAi6R,MAAAz4S,IAAAm6X,GACAt8M,EAAAhnC,EAAAtsJ,GAEAmvO,EAAAigK,EAAA35X,IAAAwe,MAAAk7M,IAEA,aADAltF,EAAA75N,KAAAysP,OAAAye,EAAA67C,IACAt4F,OAAAuU,GACA,MAAA19H,GACA,OAAA8hX,EAAA9hX,IAYA5iG,gBAAAhE,EAAAwsQ,EAAAloC,GAEA,IAAAmkP,EAAAzod,IAAA,SAAAA,EACA,OAAA0od,EAAAt8N,EAAA,IAAAnmJ,MAAA,qBAAAjmG,MAAA,yBAEA,IAAAwsQ,EACA,OAAAk8M,EAAAt8N,EAAA,IAAAnmJ,MAAA,+BAAA,qBAEA,MAAA6iX,EAAAH,EAAA3od,GAEA,SATAmtG,KAQAi6R,MAAAl7S,IAAA48X,GACA,OAAAJ,EAAAt8N,EAAA,IAAAnmJ,MAAA,QAAAjmG,qBAAA,2BAEA,IAAA2/Q,EAOAiY,EANA,IACAjY,QAAAxkD,EAAA75N,KAAAysP,OAAAye,EAAAloC,GACA,MAAA19H,GACA,OAAA8hX,EAAAt8N,EAAA,IAAAnmJ,MAAA,0DAAA,wBAIA,IACA2xL,QAAAjY,EAAAvuL,KAEA,MAAAi3N,EAAAigK,EAAA35X,IAAAwe,MAAAk7M,IACA77C,QAAAmT,EAAA5vD,OAAAs4F,GACA,MAAAzhN,GACA,OAAA8hX,EAAA9hX,GAGA,MAAAmiX,EAAA,CACA/od,KAAAA,EACAoxF,GAAAwmM,GAEAgvG,EAhCAz5R,KAgCAi6R,MAAAR,QAKA,OAJAA,EAAApoK,IAAAsqP,EAAAvjP,EAAAinC,IACAo6H,EAAApoK,IAAAoqP,EAAA5od,GAAAulO,EAAAvwJ,KAAAC,UAAA8zY,WACAniF,EAAApgC,SAEAuiH,EAUA/kd,iBAAAhE,EAAAinb,GACA,MAAAx6U,EAAAU,KACA,IAAAs7W,EAAAzod,GACA,OAAA0od,EAAAt8N,EAAA,IAAAnmJ,MAAA,qBAAAjmG,MAAA,yBAEA,IAAAinb,IAAAA,EAAAvhN,QACA,OAAAgjP,EAAAt8N,EAAA,IAAAnmJ,MAAA,4BAAA,4BAGA,MAAA05K,EAAAsnK,EAAAvhN,QACAojP,EAAAH,EAAA3od,GAEA,SADAysG,EAAA26R,MAAAl7S,IAAA48X,GACA,OAAAJ,EAAAt8N,EAAA,IAAAnmJ,MAAA,QAAAjmG,qBAAA,2BAEA,IACA,MAAA43R,QAAAjY,EAAAvuL,KAEAi3N,EAAAigK,EAAA35X,IAAAwe,MAAAk7M,IACA77C,QAAAmT,EAAA5vD,OAAAs4F,GACA0gK,EAAA,CACA/od,KAAAA,EACAoxF,GAAAwmM,GAEAgvG,EAAAn6R,EAAA26R,MAAAR,QAIA,OAHAA,EAAApoK,IAAAsqP,EAAAvjP,EAAAinC,IACAo6H,EAAApoK,IAAAoqP,EAAA5od,GAAAulO,EAAAvwJ,KAAAC,UAAA8zY,WACAniF,EAAApgC,SACAuiH,EACA,MAAAniX,GACA,OAAA8hX,EAAA9hX,IAUA5iG,qBAAAhE,GACA,IAAAyod,EAAAzod,GACA,OAAA0od,EAAAt8N,EAAA,IAAAnmJ,MAAA,qBAAAjmG,MAAA,yBAGA,IACA,MAAA8od,EAAAH,EAAA3od,GACAk5E,QAAAi0B,KAAAi6R,MAAAz4S,IAAAm6X,GACA,OAAAtjP,EAAAtsJ,GACA,MAAA0tB,GACA,OAAA8hX,EAAAt8N,EAAA,IAAAnmJ,MAAA,QAAAjmG,sBAAA4mG,EAAA9f,WAAA,uBAUA9iF,yBAAAold,EAAAC,GACA,GAAA,iBAAAD,EACA,OAAAV,EAAAt8N,EAAA,IAAAnmJ,MAAA,iCAAAmjX,MAAA,8BAEA,GAAA,iBAAAC,EACA,OAAAX,EAAAt8N,EAAA,IAAAnmJ,MAAA,iCAAAojX,MAAA,8BAEA,GAAAA,EAAAj3Y,OAAA,GACA,OAAAs2Y,EAAAt8N,EAAA,IAAAnmJ,MAAA,uBAAAojX,EAAAj3Y,UAAA,4BAEAonJ,EAAA,uBACA,MAAA8vP,EAAAhB,EAAA35X,IAAAwe,MAAAk7M,IACAl7M,KAAA+gE,KAAAy/L,KAAA07G,EACA,MAAAE,EAAAF,EACAluP,EAAAwwC,OACA09M,EACAl8W,KAAA+gE,KAAAm6I,IAAAr9C,KACA79J,KAAA+gE,KAAAm6I,IAAAmgK,eACAr7W,KAAA+gE,KAAAm6I,IAAA19B,UACAx9K,KAAA+gE,KAAAm6I,IAAA7nM,MACA,GACA8nW,EAAA15X,IAAAue,KAAA,CAAAk7M,IAAAkhK,IACA,MAAAjod,QAAA6rG,KAAAs4R,WACA,IAAA,MAAAtjY,KAAAb,EAAA,CACA,MAAA43E,QAAAi0B,KAAAi6R,MAAAz4S,IAAAg6X,EAAAxmd,EAAAnC,OACAwsQ,EAAAhnC,EAAAtsJ,GACAymM,QAAAxkD,EAAA75N,KAAAysP,OAAAye,EAAA88M,GACAhlP,EAAAilP,EAAAh+W,WACAi+W,QAAA7pM,EAAA5vD,OAAAuU,GAGAsiK,EAAAz5R,KAAAi6R,MAAAR,QACAmiF,EAAA,CACA/od,KAAAmC,EAAAnC,KACAoxF,GAAAjvF,EAAAivF,IAEAw1S,EAAApoK,IAAAmqP,EAAAxmd,EAAAnC,MAAAulO,EAAAikP,IACA5iF,EAAApoK,IAAAoqP,EAAAzmd,EAAAnC,MAAAulO,EAAAvwJ,KAAAC,UAAA8zY,WACAniF,EAAApgC,SAEAhtI,EAAA,sTC1iBA,aA6BA,IAAA8oC,EAAA5hQ,EAAA,uBAEA+od,EAAA,oBACAC,EAAA,wBACAC,EAAA,QACAC,EAAA,gDACAC,EAAA,UAEA,SAAA1B,EAAAhsX,EAAA3jB,GACA,GAAA,iBAAA2jB,EACA,MAAA,IAAA8J,MAAA,wBAEA,IAAA6jX,EAAA3tX,EACA9V,QAAAojY,EAAAjxY,GACA6N,QAAAqjY,EAAAlxY,GACA6N,QAAAsjY,EAAAnxY,GACA6N,QAAAujY,EAAApxY,GACA6N,QAAAwjY,EAAArxY,GACA,OAAA8pL,EAAAwnN,EAAA,KAGAtpd,EAAAC,QAAA,SAAA07F,EAAAr6F,GACA,IAAA02E,EAAA12E,GAAAA,EAAA02E,aAAA,GACAyzJ,EAAAk8O,EAAAhsX,EAAA3jB,GACA,MAAA,KAAAA,EACAyzJ,EAEAk8O,EAAAl8O,EAAA,gECzDA,aAEA,IAAAq2B,EAAA5hQ,EAAA,kBACAyiT,EAAAziT,EAAA,4BACAF,EAAAC,QAAA6hQ,EAAAx8J,KAAA,KAAAq9M,4FCJA,aAEA,SAAA4mK,EAAA1rJ,GACA,OAAAA,GAAA,OAAAA,GAAA,MAGA,SAAA2rJ,EAAA3rJ,GACA,OAAAA,GAAA,OAAAA,GAAA,MAIA79T,EAAAC,QAAA,SAAA0iT,EAAAr6M,EAAAyiI,GACA,GAAA,iBAAAziI,EACA,MAAA,IAAA7C,MAAA,wBAQA,IALA,IAEAo4N,EACA3lN,EAHAuxW,EAAAnhX,EAAA12B,OACA83Y,EAAA,EAIA51Y,EAAA,EAAAA,EAAA21Y,EAAA31Y,GAAA,EAAA,CAWA,GAVA+pP,EAAAv1N,EAAA1jB,WAAA9Q,GACAokC,EAAA5P,EAAAx0B,GAEAy1Y,EAAA1rJ,IAAA2rJ,EAAAlhX,EAAA1jB,WAAA9Q,EAAA,MAEAokC,GAAA5P,EADAx0B,GAAA,KAIA41Y,GAAA/mK,EAAAzqM,MAEA6yH,EACA,OAAAziI,EAAAv2B,MAAA,EAAA+B,EAAA,GAEA,GAAA41Y,EAAA3+O,EACA,OAAAziI,EAAAv2B,MAAA,EAAA+B,EAAAokC,EAAAtmC,OAAA,GAIA,OAAA02B,iCCxCA,aAEA,SAAAihX,EAAA1rJ,GACA,OAAAA,GAAA,OAAAA,GAAA,MAGA,SAAA2rJ,EAAA3rJ,GACA,OAAAA,GAAA,OAAAA,GAAA,MAIA79T,EAAAC,QAAA,SAAAqoG,GACA,GAAA,iBAAAA,EACA,MAAA,IAAA7C,MAAA,wBAOA,IAJA,IAAAgkX,EAAAnhX,EAAA12B,OACAm5J,EAAA,EACA8yF,EAAA,KACA8rJ,EAAA,KACA71Y,EAAA,EAAAA,EAAA21Y,EAAA31Y,IAIA01Y,EAHA3rJ,EAAAv1N,EAAA1jB,WAAA9Q,IAKA,MAAA61Y,GAAAJ,EAAAI,GACA5+O,GAAA,EAGAA,GAAA,EAGA8yF,GAAA,IACA9yF,GAAA,EAEA8yF,GAAA,KAAAA,GAAA,KACA9yF,GAAA,EAEA8yF,GAAA,MAAAA,GAAA,QACA9yF,GAAA,GAEA4+O,EAAA9rJ,EAGA,OAAA9yF,iCC7CA,aAGA7qO,EAAA,wBAEAA,EAAA,sBAEA,MAAAyrP,EAAAzrP,EAAA,yBACA0pd,kBAAAA,EAAAC,UAAAA,GAAA3pd,EAAA,UACA0rP,EAAA1rP,EAAA,YACA6kO,EAAA7kO,EAAA,2BACA8kO,EAAA9kO,EAAA,yBAEA4nd,EAAA,IAAAppX,QAmIA1+F,EAAAC,QAxHA,MAOAuD,YAAAojU,EAAA/e,GACA,IAAA+e,EACA,MAAAh7E,EAAA,IAAAnmJ,MAAA,wBAAA,yBAGAkH,KAAAi6N,SAAAA,EACAkhJ,EAAA15X,IAAAue,KAAA,CAAAk7M,IAAAA,IAYArkT,cAAAhE,EAAAsqd,GACA,KAAAA,aAAA1kP,YACA,MAAAwmB,EAAA,IAAAnmJ,MAAA,mCAAA,sBAGA,MAAA9jG,QAAAgrG,KAAAi6N,SAAAqzF,cAAAz6Z,GACAwsQ,QAAAr/J,KAAAi6N,SAAAmjJ,eAAAvqd,GAEAqoT,EAAAigK,EAAA35X,IAAAwe,MAAAk7M,IACA1oC,EAAAxzB,EAAA8B,IAAAC,qBAAAse,EAAA67C,GACAwxC,QAAAuwH,EAAAjod,EAAAw9Q,GAGAynL,EAAAj7M,EAAAq+N,MAAAC,sBACArjB,EAAAsjB,aAAA7wH,GACAutG,EAAAlzX,QAAAi4K,EAAAp/I,KAAAyvJ,aAAA8tN,GACAljB,EAAAv4L,UAGA,MAAA1gB,EAAAhC,EAAAiC,KAAAC,MAAA+4M,EAAAujB,UAAAp8N,WACA,OAAAhpB,EAAA4oB,EAAA,SAYAnqP,cAAA4md,GACA,KAAAA,aAAAhlP,YACA,MAAAwmB,EAAA,IAAAnmJ,MAAA,wBAAA,sBAGA,IAAA4iX,EACA,IACA,MAAAnrP,EAAAyuB,EAAAp/I,KAAAyvJ,aAAAh3B,EAAAolP,EAAA,UACA5+W,EAAAmgJ,EAAAiC,KAAAmO,QAAA7+B,GAEAmrP,EAAA18N,EAAAq+N,MAAAK,gBAAA7+W,GACA,MAAApF,GACA,MAAAwlJ,EAAA,IAAAnmJ,MAAA,gBAAAW,EAAA9f,SAAA,mBAKA,MAAAgkY,EAAAjC,EAAAiC,WAEA5vY,QAAAigC,GAAAA,EAAA4vW,OAAAz/X,MAAAtX,GAAA,MAAAA,EAAAg3Y,WAAA,SAAAh3Y,EAAAnzE,UAEAq6E,QAAAigC,GAAAA,EAAA4vW,OAAAz/X,MAAAtX,GAAA,OAAAA,EAAAg3Y,cAEAzzY,KAAA4jC,IACA,CACA8vW,UAAA9vW,EAEA+vW,MAAA/vW,EAAA4vW,OAAAz/X,MAAAtX,GAAA,OAAAA,EAAAg3Y,YAAAnqd,UAIAs6G,QAAAkvW,EAAAS,GAAArqU,MAAAwqU,IACA,IAEA,SADA99W,KAAAi6N,SAAA+jJ,YAAAF,EAAAC,OACA,OAAA,EACA,MAAAtkX,GACA,OAAA,EAEA,OAAA,KAGA,IAAAuU,EAAA,CAEA,MAAAiwW,EAAAN,EAAAvzY,KAAA4jC,GAAAA,EAAA+vW,QACA,MAAA9+N,EAAA,IAAAnmJ,MAAA,uCAAAmlX,EAAA3zY,KAAA,OAAA,mBAAA,CACA2zY,YAAAA,IAIA,MAAAjpd,QAAAgrG,KAAAi6N,SAAA+jJ,YAAAhwW,EAAA+vW,OAEA,IAAA/od,EACA,MAAAiqP,EAAA,IAAAnmJ,MAAA,gCAAA,cAGA,MAAAumK,QAAAr/J,KAAAi6N,SAAAmjJ,eAAApod,EAAAnC,MACAqoT,EAAAigK,EAAA35X,IAAAwe,MAAAk7M,IACA1oC,EAAAxzB,EAAA8B,IAAAC,qBAAAse,EAAA67C,GAEA,OADAwgK,EAAAn6M,QAAAvzJ,EAAA8vW,UAAAtrM,GACAp6C,EAAAsjP,EAAA30Y,QAAAq6K,WAAA,uOC1HA,IAAApC,EAAAzrP,EAAA,WACAA,EAAA,SACAA,EAAA,UACAA,EAAA,SACAA,EAAA,UACAA,EAAA,SACAA,EAAA,eACAA,EAAA,YACAA,EAAA,UACAA,EAAA,UAGA,IAAA0tP,EAAAjC,EAAAiC,KAGAg5M,EAAA5mc,EAAAC,QAAA0rP,EAAAq+N,MAAAr+N,EAAAq+N,OAAA,GAqxBA,SAAAa,EAAAr/W,GAEA,IAAAmzJ,EAAA,GACAj/H,EAAA,GACA,IAAAkuH,EAAAhlB,SAAAp9H,EAAAo7V,EAAAh5M,KAAAk9N,uBAAAnsN,EAAAj/H,GAAA,CACA,IAAAxjD,EAAA,IAAAupB,MAAA,kFAGA,MADAvpB,EAAAwjD,OAAAA,EACAxjD,EAGA,MAAA,CACAm0B,QAAAsuJ,EAAAtuJ,QAAAzrB,WAAA,GACA2lY,OAAA5+N,EAAA8B,IAAAs9N,qBAAApsN,EAAA4rN,QACAS,aAAAr/N,EAAAp/I,KAAAyvJ,aAAA2C,EAAAssN,QAAAlpN,QACAmpN,iBAAA,CACAhhN,UAAAtc,EAAA8O,SAAAiC,EAAAwsN,cACAt7T,UAAA8uG,EAAAysN,aAAA/qd,MACAqzE,QAAAirL,EAAA0sN,SA6DA,SAAAC,EAAAhB,GAEA,IADA,IAlDA9+W,EAkDA1S,EAAA,GACAhlB,EAAA,EAAAA,EAAAw2Y,EAAA14Y,SAAAkC,EACAglB,EAAArhB,MApDA+zB,EAoDA8+W,EAAAx2Y,GAnDA85K,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAxL,EAAA2Q,aAAA/yJ,EAAA6E,SAAA09I,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEArO,EAAA8B,IAAA89N,wBAAA,CAAA9+U,WAAAjhC,EAAA++W,SAEA38N,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAzN,EAAAp/I,KAAAw2J,WAAAv3J,EAAAw/W,iBAGAp9N,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAA/wJ,EAAA0/W,iBAAAhhN,WAAAnc,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAgN,MAAA,EAAA,MAGA3L,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EACA9tJ,EAAA0/W,iBAAAx3Y,aA+BA,OAAAolB,EA8CA,SAAA0yX,EAAAhgX,GAEA,IAAAuyJ,EAAAnQ,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAxL,EAAA2Q,aAAA/yJ,EAAA6E,SAAA09I,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEArO,EAAA8B,IAAA89N,wBAAA,CAAA9+U,WAAAjhC,EAAA++W,SAEA38N,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAzN,EAAAp/I,KAAAw2J,WAAAv3J,EAAAw/W,iBAGAp9N,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAA/wJ,EAAA2xK,iBAAApvB,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAgN,MAAA,EAAA,QAwBA,GAnBA/tJ,EAAAigX,6BAEA1tN,EAAA19P,MAAAo3E,KAAA+zB,EAAAigX,6BAIA1tN,EAAA19P,MAAAo3E,KAAAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAA/wJ,EAAAkgX,oBAAA39N,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAgN,MAAA,EAAA,OAIAwE,EAAA19P,MAAAo3E,KAAAm2K,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EAAA9tJ,EAAA5X,YAGA4X,EAAAmgX,0BAAA/5Y,OAAA,EAAA,CAGA,IADA,IAAAg6Y,EAAAh+N,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,IACAllL,EAAA,EAAAA,EAAA03B,EAAAmgX,0BAAA/5Y,SAAAkC,EAAA,CACA,IAAAyX,EAAAigB,EAAAmgX,0BAAA73Y,GACA83Y,EAAA7hX,OAAAtyB,KAAAo0Y,EAAAtgY,IAEAwyK,EAAA19P,MAAAo3E,KAAAm0Y,GAGA,OAAA7tN,EAwCA,SAAA8tN,EAAAtgY,GACA,IAAAlrF,EAGA,GAAAkrF,EAAA9X,OAAAk4K,EAAA8B,IAAA2R,KAAApxK,YACA3tF,EAAAutP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAhxK,EAAAlrF,OAAA0tP,iBACA,GAAAxiK,EAAA9X,OAAAk4K,EAAA8B,IAAA2R,KAAA0sN,cACAzrd,EAAAutP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EACA/tK,EAAAlrF,MAAAilO,cACA,GAAA/5I,EAAA9X,OAAAk4K,EAAA8B,IAAA2R,KAAA2sN,YAAA,CASA,IAAAC,EAAA,IAAAthX,KAAA,wBACAuhX,EAAA,IAAAvhX,KAAA,wBACAmyJ,EAAAtxK,EAAAlrF,MACA,GAAA,iBAAAw8P,EAAA,CAEA,IAAA2wK,EAAA9iU,KAAA9uB,MAAAihL,GAKAA,EAJAhxJ,MAAA2hU,GAEA,KAAA3wK,EAAAjrL,OAEAg8K,EAAA+O,cAAAE,GAGAjP,EAAA2P,sBAAAV,GANA,IAAAnyJ,KAAA8iU,GAWAnta,EADAw8P,GAAAmvN,GAAAnvN,EAAAovN,EACAr+N,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6N,SAAA,EACAxM,EAAAkQ,cAAAjB,IAEAjP,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA8N,iBAAA,EACAzM,EAAA0Q,sBAAAzB,IAQA,OAAAjP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAhxK,EAAA9X,MAAAs6K,YACAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA0N,KAAA,EAAA,CAEA55P,MAmDA,SAAA6rd,EAAA9vY,EAAAovB,EAAA00R,GACA,IAAAvhI,EAAA,GAEA,IAAA/Q,EAAAhlB,SAAAp9H,EAAA00R,EAAAvhI,EADA,IACA,CACA,IAAAziL,EAAA,IAAAupB,MAAA,+EAGA,MADAvpB,EAAAwjD,OAAAxjD,EACAA,EAKA,GADA0xK,EAAA8O,SAAAiC,EAAA3wK,eACA29J,EAAA8B,IAAA2R,KAAA/lG,KACA,MAAA,IAAA5zD,MAAA,wEAIA,GAAAk5J,EAAAusN,iBAAA,CACA,IAAAx3Y,EAAA,GACA,GAAAi4K,EAAAp/I,KAAA9iB,QAAAk1K,EAAAusN,kBACA,IAAA,IAAAp3Y,EAAA,EAAAA,EAAA6qL,EAAAusN,iBAAAt5Y,SAAAkC,EAAA,CACA,GAAA6qL,EAAAusN,iBAAAp3Y,GAAAL,OAAAm6K,EAAArB,KAAA+M,YACA,MAAA,IAAA7zJ,MAAA,mGAGA/xB,GAAAirL,EAAAusN,iBAAAp3Y,GAAAzzE,WAGAqzE,EAAAirL,EAAAusN,iBAEA9uY,EAAA8uY,iBAAA,CACAhhN,UAAAtc,EAAA8O,SAAAiC,EAAAwsN,cACAt7T,UAAA87F,EAAAp/I,KAAAyvJ,aAAA2C,EAAAysN,aAAA/qd,OACAqzE,QAAAi4K,EAAAp/I,KAAAyvJ,aAAAtoL,IAIA,GAAAirL,EAAAjrL,QAAA,CACAA,EAAA,GACA,GAAAi4K,EAAAp/I,KAAA9iB,QAAAk1K,EAAAjrL,SACA,IAAAI,EAAA,EAAAA,EAAA6qL,EAAAjrL,QAAA9B,SAAAkC,EAAA,CACA,GAAA6qL,EAAAjrL,QAAAI,GAAAL,OAAAm6K,EAAArB,KAAA+M,YACA,MAAA,IAAA7zJ,MAAA,yFAGA/xB,GAAAirL,EAAAjrL,QAAAI,GAAAzzE,WAGAqzE,EAAAirL,EAAAjrL,QAEA0I,EAAA1I,QAAAi4K,EAAAp/I,KAAAyvJ,aAAAtoL,GAMA,OAHA0I,EAAAi0B,QAAAsuJ,EAAAtuJ,QAAAzrB,WAAA,GACAxI,EAAA+vY,WAAAxtN,EAEAA,EAaA,SAAAytN,EAAAhwY,GACA,QAAA/5E,IAAA+5E,EAAA8uY,iBAAAvpd,IACA,MAAA,IAAA8jG,MAAA,gCAGA,QAAApjG,IAAA+5E,EAAA1I,QAAA,CACA,IAAA24Y,EAEA,OAAAjwY,EAAA8uY,iBAAAhhN,WACA,KAAAve,EAAA8B,IAAA2R,KAAA,cACA,KAAAzT,EAAA8B,IAAA2R,KAAA,cACA,KAAAzT,EAAA8B,IAAA2R,KAAA,cACAitN,EAAA1gO,EAAAmf,IAAA4B,uBAAAtwL,EAAA8uY,iBAAAvpd,KACA,MAEA,KAAAgqP,EAAA8B,IAAA2R,KAAA,OACA,KAAAzT,EAAA8B,IAAA2R,KAAA,gBACAitN,EAAA1gO,EAAAqf,IAAA0B,uBAAAtwL,EAAA8uY,iBAAAvpd,KACA,MAEA,QACA,MAAA,IAAA8jG,MAAA,qCACArpB,EAAA8uY,iBAAAhhN,WAKA,GAHAmiN,EAAA1qY,MAAAvF,EAAA8uY,iBAAAr7T,WACAw8T,EAAA/pT,OAAAlmF,EAAA8uY,iBAAAx3Y,UAEA24Y,EAAAjmP,SACA,MAAA,IAAA3gI,MAAA,gCAGArpB,EAAA1I,QAAA24Y,EAAA5gP,QA5rCAm7N,EAAA0lB,eAAA,SAAAtgN,GACA,IAAA5vL,EAAAuvK,EAAAqgB,IAAAj7J,OAAAi7J,GAAA,GAEA,GAAA,UAAA5vL,EAAA3I,KAAA,CACA,IAAAyI,EAAA,IAAAupB,MAAA,+EAGA,MADAvpB,EAAAgwL,WAAA9vL,EAAA3I,KACAyI,EAEA,GAAAE,EAAA+vL,UAAA,cAAA/vL,EAAA+vL,SAAA14L,KACA,MAAA,IAAAgyB,MAAA,gEAIA,IAAA+F,EAAAoiJ,EAAAmO,QAAA3/K,EAAAxJ,MAEA,OAAAg0X,EAAAyjB,gBAAA7+W,IAWAo7V,EAAA2lB,aAAA,SAAAnwY,EAAAinL,GAEA,IAAAmpN,EAAA,CACA/4Y,KAAA,QACAb,KAAAg7K,EAAAC,MAAAzxK,EAAA+tY,UAAAp8N,YAEA,OAAApC,EAAAqgB,IAAA/7J,OAAAu8W,EAAA,CAAAnpN,QAAAA,KAUAujM,EAAAyjB,gBAAA,SAAA7+W,GAEA,IAAAmzJ,EAAA,GACAj/H,EAAA,GACA,IAAAkuH,EAAAhlB,SAAAp9H,EAAAo7V,EAAAh5M,KAAA6+N,qBAAA9tN,EAAAj/H,GAAA,CACA,IAAAxjD,EAAA,IAAAupB,MAAA,0EAGA,MADAvpB,EAAAwjD,OAAAA,EACAxjD,EAGA,IACAE,EADA4R,EAAA4/J,EAAA8O,SAAAiC,EAAA3wK,aAGA,OAAAA,GACA,KAAA29J,EAAA8B,IAAA2R,KAAAstN,cACAtwY,EAAAwqX,EAAAqjB,sBACA,MAEA,KAAAt+N,EAAA8B,IAAA2R,KAAAmL,cACAnuL,EAAAwqX,EAAA+lB,sBACA,MAEA,KAAAhhO,EAAA8B,IAAA2R,KAAAwtN,WACAxwY,EAAAwqX,EAAAimB,mBACA,MAEA,QACA,MAAA,IAAApnX,MAAA,oDACAzX,EAAA,4BAIA,OADA5R,EAAA0wY,SAAAnuN,EAAAjrL,QAAArzE,MAAA,IACA+7E,GAGAwqX,EAAAimB,iBAAA,WACA,IAAAzwY,EAAA,KA2RA,OA1RAA,EAAA,CACA3I,KAAAk4K,EAAA8B,IAAA2R,KAAAwtN,WACAv8W,QAAA,EACA08W,aAAA,GACAC,KAAA,GAEAC,QAAA,GAEAC,2BAAA,GACAC,YAAA,KACAC,YAAA,GAEAN,SAAA,SAAAthX,GASA,GAPA0gX,EAAA9vY,EAAAovB,EAAAo7V,EAAAh5M,KAAAy/N,qBACAjxY,EAAA2wY,aAAA,GACA3wY,EAAA4wY,KAAA,GACA5wY,EAAA8wY,2BAAA,GACA9wY,EAAA+wY,YAAA,KACA/wY,EAAAgxY,YAAA,GAEAhxY,EAAA+vY,WAAAY,aAEA,IADA,IAAAO,EAAAlxY,EAAA+vY,WAAAY,aAAA1sd,MACAyzE,EAAA,EAAAA,EAAAw5Y,EAAA17Y,SAAAkC,EACAsI,EAAA2wY,aAAAt1Y,KAAAk0K,EAAA8B,IAAA8/N,oBAAAD,EAAAx5Y,MAOAq2Y,OAAA,WAEA/tY,EAAA+wY,aACA/wY,EAAA64K,OAIA,IADA,IAAAq4N,EAAA,GACAx5Y,EAAA,EAAAA,EAAAsI,EAAA2wY,aAAAn7Y,SAAAkC,EACAw5Y,EAAA71Y,KAAAk0K,EAAA8B,IAAA+/N,kBAAApxY,EAAA2wY,aAAAj5Y,KAGA,IAAAk5Y,EAAA,GAIAJ,EAAAh/N,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CACApL,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAxL,EAAA2Q,aAAAniL,EAAAi0B,SAAA09I,YAEAH,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA0N,KAAA,EACA79K,EAAA8wY,4BAEA9wY,EAAA+wY,gBAmBA,OAhBAG,EAAA17Y,OAAA,GAEAg7Y,EAAAvsd,MAAA,GAAAA,MAAAo3E,KACAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAAs0N,IAEAN,EAAAp7Y,OAAA,GAEAg7Y,EAAAvsd,MAAA,GAAAA,MAAAo3E,KACAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAAg0N,IAGAJ,EAAAvsd,MAAA,GAAAA,MAAAo3E,KACAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA0N,KAAA,EACA79K,EAAAgxY,cAGAx/N,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAngL,EAAA3I,MAAAs6K,YAEA6+N,KA4CAa,UAAA,SAAAC,GACA,IAAAnD,EAAAmD,EAAAnD,OACAS,EAAA0C,EAAA1C,aACA,GAAA0C,EAAAr0H,YAAA,CACA,IAAAs0H,EAAAD,EAAAr0H,YACA,iBAAAs0H,IACAA,EAAAhiO,EAAA8B,IAAAmgO,mBAAAD,IAEApD,EAAAoD,EAAApD,OAAA99U,WACAu+U,EAAA2C,EAAA3C,aAEA,IAAArpd,EAAA+rd,EAAA/rd,IACA,IAAAA,EACA,MAAA,IAAA8jG,MACA,0DAEA,iBAAA9jG,IACAA,EAAAgqP,EAAA8B,IAAA8zB,kBAAA5/Q,IAIA,IAAAw7Q,EAAAuwM,EAAAvwM,iBAAAxxB,EAAA8B,IAAA2R,KAAAxyB,KACA,OAAAuwC,GACA,KAAAxxB,EAAA8B,IAAA2R,KAAAxyB,KACA,KAAA+e,EAAA8B,IAAA2R,KAAAmZ,OACA,KAAA5sB,EAAA8B,IAAA2R,KAAA0uB,OACA,KAAAniC,EAAA8B,IAAA2R,KAAA6K,OACA,KAAAte,EAAA8B,IAAA2R,KAAAtxB,IACA,MACA,QACA,MAAA,IAAAroI,MACA,kEACA03K,GAKA,IAAA0wM,EAAAH,EAAAG,yBAAA,GACA,GAAAA,EAAAj8Y,OAAA,EAAA,CAGA,IAFA,IAAAoc,GAAA,EACA89X,GAAA,EACAh4Y,EAAA,EAAAA,EAAA+5Y,EAAAj8Y,SAAAkC,EAAA,CACA,IAAAyX,EAAAsiY,EAAA/5Y,GACA,GAAAka,GAAAzC,EAAA9X,OAAAk4K,EAAA8B,IAAA2R,KAAApxK,aAOA,GAAA89X,GAAAvgY,EAAA9X,OAAAk4K,EAAA8B,IAAA2R,KAAA0sN,oBAEA,GADAA,GAAA,EACA99X,EACA,WARA,GADAA,GAAA,EACA89X,EACA,MAaA,IAAA99X,IAAA89X,EACA,MAAA,IAAArmX,MAAA,0LAOArpB,EAAA6wY,QAAAx1Y,KAAA,CACA91E,IAAAA,EACA0uG,QAAA,EACAk6W,OAAAA,EACAS,aAAAA,EACA7tM,gBAAAA,EACAuuM,mBAAA//N,EAAA8B,IAAA2R,KAAAqjB,cACA7uL,UAAA,KACAi6X,wBAAAA,EACAlC,0BAAA,MASA12N,KAAA,SAAA3zP,GAcA,IAAAoyE,GAbApyE,EAAAA,GAAA,GAEA,iBAAA86E,EAAA1I,SAAA,OAAA0I,EAAA+wY,eAEA/wY,EAAA+wY,YAAAv/N,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAA5Q,EAAA8B,IAAA2R,KAAA/lG,MAAA00F,cAIA,YAAA3xK,IAEAA,EAAA1I,mBAAAi4K,EAAAp/I,KAAA8zJ,WACA3sL,EAAA0I,EAAA1I,QAAA4xJ,QACA,iBAAAlpJ,EAAA1I,UACAA,EAAAi4K,EAAAp/I,KAAAy0J,WAAA5kL,EAAA1I,UAGApyE,EAAAwsd,SACA1xY,EAAA2xY,gBAAAngO,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EAAA5lL,GAEA0I,EAAA+wY,YAAA9sd,MAAAo3E,KAEAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CACApL,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EACA5lL,QAOA,IAAA0I,EAAA6wY,QAAAr7Y,QA6EA,SAAAo8Y,GACA,IAAAt6Y,EAIAA,EAFA0I,EAAA2xY,gBAEA3xY,EAAA2xY,iBAMAr6Y,EAAA0I,EAAA+wY,YAAA9sd,MAAA,IAEAA,MAAA,GAGA,IAAAqzE,EACA,MAAA,IAAA+xB,MACA,+DAIA,IAAAzX,EAAA4/J,EAAA8O,SAAAtgL,EAAA+wY,YAAA9sd,MAAA,GAAAA,OAGAilO,EAAAsoB,EAAAC,MAAAn6K,GAUA,IAAA,IAAA8oL,KANAl3B,EAAA21B,UAEArN,EAAAmN,kBAAAz1B,GACAA,EAAAA,EAAAyoB,WAGAigO,EACAA,EAAAxxN,GAAA76K,QAAA2gF,OAAAgjE,GAKA,IADA,IAAAymP,EAAA,IAAArhX,KACA52B,EAAA,EAAAA,EAAAsI,EAAA6wY,QAAAr7Y,SAAAkC,EAAA,CACA,IAAA45Y,EAAAtxY,EAAA6wY,QAAAn5Y,GAEA,GAAA,IAAA45Y,EAAAG,wBAAAj8Y,QAGA,GAAAoc,IAAA29J,EAAA8B,IAAA2R,KAAA/lG,KACA,MAAA,IAAA5zD,MACA,qHAGA,CAGAioX,EAAAjC,4BAAA79N,EAAA/sP,OACA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,IAOA,IAHA,IAAA4yN,EAAAh+N,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA0N,KAAA,EAAA,IAEAg0N,EAAA,EAAAA,EAAAP,EAAAG,wBAAAj8Y,SAAAq8Y,EAAA,CACA,IAAA1iY,EAAAmiY,EAAAG,wBAAAI,GACA1iY,EAAA9X,OAAAk4K,EAAA8B,IAAA2R,KAAA0sN,cAEAvgY,EAAAlrF,MAAA2td,EAAAN,EAAAvwM,iBAAAt3C,SACAt6I,EAAA9X,OAAAk4K,EAAA8B,IAAA2R,KAAA2sN,cAEAxgY,EAAAlrF,QACAkrF,EAAAlrF,MAAA0rd,IAOAH,EAAAvrd,MAAAo3E,KAAAo0Y,EAAAtgY,IACAmiY,EAAAjC,4BAAAprd,MAAAo3E,KAAAo0Y,EAAAtgY,IAIA+5I,EAAAsoB,EAAAC,MAAA+9N,GAAA79N,WACA2/N,EAAA9jN,GAAAjoL,QAAA2gF,OAAAgjE,GAIAooP,EAAA95X,UAAA85X,EAAA/rd,IAAAszP,KAAAy4N,EAAA9jN,GAAA,qBAIAxtL,EAAAgxY,YA8eA,SAAAH,GAEA,IADA,IAAAn0X,EAAA,GACAhlB,EAAA,EAAAA,EAAAm5Y,EAAAr7Y,SAAAkC,EACAglB,EAAArhB,KAAA+zY,EAAAyB,EAAAn5Y,KAEA,OAAAglB,EAnfAo1X,CAAA9xY,EAAA6wY,SAjKAkB,CA+BA,WAGA,IAFA,IAAAH,EAAA,GAEAl6Y,EAAA,EAAAA,EAAAsI,EAAA6wY,QAAAr7Y,SAAAkC,EAAA,CACA,IAAA45Y,EAAAtxY,EAAA6wY,QAAAn5Y,IACA0oL,EAAAkxN,EAAAvwM,mBACA6wM,IAEAA,EAAAxxN,GAAA7Q,EAAAie,GAAAje,EAAA8B,IAAA2R,KAAA5C,IAAA37P,UAEA,IAAA6sd,EAAAG,wBAAAj8Y,OAEA87Y,EAAA9jN,GAAAokN,EAAAxxN,GAKAkxN,EAAA9jN,GAAAje,EAAAie,GAAAje,EAAA8B,IAAA2R,KAAA5C,IAAA37P,SAMA,IAAA,IAAA27P,KADApgL,EAAA8wY,2BAAA,GACAc,EACA5xY,EAAA8wY,2BAAAz1Y,KAEAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAC,GAAAzO,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAgN,MAAA,EAAA,OAIA,OAAAy0N,EArEAI,KAMA9rM,OAAA,WACA,MAAA,IAAA78K,MAAA,uDAQA4oX,eAAA,SAAAV,GAEA,iBAAAA,IACAA,EAAAhiO,EAAA8B,IAAAmgO,mBAAAD,IAEAvxY,EAAA2wY,aAAAt1Y,KAAAk2Y,IAQAW,6BAAA,SAAAC,GACA,MAAA,IAAA9oX,MAAA,8CAgJAmhW,EAAA+lB,oBAAA,WACA,IAAAvwY,EAAA,KA8BA,OA7BAA,EAAA,CACA3I,KAAAk4K,EAAA8B,IAAA2R,KAAAmL,cACAl6J,QAAA,EACA66W,iBAAA,CACAhhN,UAAAve,EAAA8B,IAAA2R,KAAA,eAQA0tN,SAAA,SAAAthX,GAEA0gX,EAAA9vY,EAAAovB,EAAAo7V,EAAAh5M,KAAA4gO,yBAQAtgN,QAAA,SAAAvsQ,QACAU,IAAAV,IACAy6E,EAAA8uY,iBAAAvpd,IAAAA,GAEAyqd,EAAAhwY,MAWAwqX,EAAAqjB,oBAAA,WACA,IAAA7tY,EAAA,KAkOA,OAjOAA,EAAA,CACA3I,KAAAk4K,EAAA8B,IAAA2R,KAAAstN,cACAr8W,QAAA,EACAi6W,WAAA,GACAY,iBAAA,CACAhhN,UAAAve,EAAA8B,IAAA2R,KAAA,eAQA0tN,SAAA,SAAAthX,GAEA,IAAAmzJ,EAAAutN,EAAA9vY,EAAAovB,EAAAo7V,EAAAh5M,KAAA6gO,wBACAryY,EAAAkuY,WA2RA,SAAAoE,GAEA,IADA,IAAA51X,EAAA,GACAhlB,EAAA,EAAAA,EAAA46Y,EAAA98Y,SAAAkC,EACAglB,EAAArhB,KAAAozY,EAAA6D,EAAA56Y,KAEA,OAAAglB,EAhSA61X,CAAAhwN,EAAAiwN,eAAAvud,QAGA8pd,OAAA,WAEA,OAAAv8N,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAngL,EAAA3I,MAAAs6K,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CACApL,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAxL,EAAA2Q,aAAAniL,EAAAi0B,SAAA09I,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA0N,KAAA,EACAqxN,EAAAlvY,EAAAkuY,aAEA18N,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,GA6eAzjL,EA5eA6F,EAAA8uY,iBA6eA,CAEAt9N,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAA5Q,EAAA8B,IAAA2R,KAAA/lG,MAAA00F,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAhmL,EAAA2zL,WAAAnc,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EACA/iL,EAAAs5E,UAAAk+F,cAGAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CACApL,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EACA/iL,EAAA7C,QAAAq6K,uBAjBA,IAAAx3K,GA/dAs4Y,cAAA,SAAAlB,GAGA,IAFA,IAAAmB,EAAAnB,EAAApD,OAAA99U,WAEA34D,EAAA,EAAAA,EAAAsI,EAAAkuY,WAAA14Y,SAAAkC,EAAA,CACA,IAAA6mC,EAAAv+B,EAAAkuY,WAAAx2Y,GACAi7Y,EAAAp0W,EAAA4vW,OAEA,GAAA5vW,EAAAqwW,eAAA2C,EAAA3C,cAIA+D,EAAAn9Y,SAAAk9Y,EAAAl9Y,OAAA,CAKA,IADA,IAAAqY,GAAA,EACAgU,EAAA,EAAAA,EAAA6wX,EAAAl9Y,SAAAqsB,EACA,GAAA8wX,EAAA9wX,GAAAxqB,OAAAq7Y,EAAA7wX,GAAAxqB,MACAs7Y,EAAA9wX,GAAA59F,QAAAyud,EAAA7wX,GAAA59F,MAAA,CACA4pF,GAAA,EACA,MAIA,GAAAA,EACA,OAAA0wB,GAIA,OAAA,MASAuzJ,QAAA,SAAAu8M,EAAAvlP,GACA,QAAA7iO,IAAA+5E,EAAA8uY,iBAAAvpd,UAAAU,IAAAood,QACApod,IAAA6iO,EACA,OAAAulP,EAAAS,iBAAAhhN,WACA,KAAAve,EAAA8B,IAAA2R,KAAAqjB,cACA,KAAA92B,EAAA8B,IAAA2R,KAAA4vN,OACA,IAAArtd,EAAAujO,EAAAgpC,QAAAu8M,EAAAS,iBAAAx3Y,SACA0I,EAAA8uY,iBAAAvpd,IAAAgqP,EAAAp/I,KAAAyvJ,aAAAr6P,GACA,MAEA,QACA,MAAA,IAAA8jG,MAAA,sCACAglX,EAAAS,iBAAAhhN,WAIAkiN,EAAAhwY,IAQA8tY,aAAA,SAAAyD,GACAvxY,EAAAkuY,WAAA7yY,KAAA,CACA44B,QAAA,EACAk6W,OAAAoD,EAAApD,OAAA99U,WACAu+U,aAAA2C,EAAA3C,aACAE,iBAAA,CAIAhhN,UAAAve,EAAA8B,IAAA2R,KAAAqjB,cACA9gR,IAAAgsd,EAAAtuM,cAkBAhR,QAAA,SAAA1sQ,EAAA0pQ,GAEA,QAAAhpQ,IAAA+5E,EAAA8uY,iBAAAx3Y,QAAA,CAIA,IAAA83Q,EAAA7gF,EAAAskN,EACA,OAJA5jN,EAAAA,GAAAjvL,EAAA8uY,iBAAAhhN,UACAvoQ,EAAAA,GAAAy6E,EAAA8uY,iBAAAvpd,IAGA0pQ,GACA,KAAA1f,EAAA8B,IAAA2R,KAAA,cACAosF,EAAA,GACA7gF,EAAA,GACAskN,EAAAtjO,EAAAmf,IAAAC,uBACA,MAEA,KAAApf,EAAA8B,IAAA2R,KAAA,cACAosF,EAAA,GACA7gF,EAAA,GACAskN,EAAAtjO,EAAAmf,IAAAC,uBACA,MAEA,KAAApf,EAAA8B,IAAA2R,KAAA,cACAosF,EAAA,GACA7gF,EAAA,GACAskN,EAAAtjO,EAAAmf,IAAAC,uBACA,MAEA,KAAApf,EAAA8B,IAAA2R,KAAA,gBACAosF,EAAA,GACA7gF,EAAA,EACAskN,EAAAtjO,EAAAqf,IAAAD,uBACA,MAEA,QACA,MAAA,IAAAtlK,MAAA,qCAAA4lK,GAGA,QAAAhpQ,IAAAV,EACAA,EAAAgqP,EAAAp/I,KAAAyvJ,aAAArQ,EAAA5wI,OAAAgzI,SAAAy9F,SACA,GAAA7pV,EAAAiwE,UAAA45Q,EACA,MAAA,IAAA/lP,MAAA,uCACA9jG,EAAAiwE,SAAA,oBAAA45Q,EAAA,KAKApvQ,EAAA8uY,iBAAAhhN,UAAAmB,EACAjvL,EAAA8uY,iBAAAvpd,IAAAA,EACAy6E,EAAA8uY,iBAAAr7T,UAAA87F,EAAAp/I,KAAAyvJ,aACArQ,EAAA5wI,OAAAgzI,SAAA4c,IAEA,IAAA0hN,EAAA4C,EAAAttd,GAMA,GALA0qd,EAAA1qY,MAAAvF,EAAA8uY,iBAAAr7T,UAAAjmJ,QACAyid,EAAA/pT,OAAAlmF,EAAA1I,UAIA24Y,EAAAjmP,SACA,MAAA,IAAA3gI,MAAA,gCAGArpB,EAAA8uY,iBAAAx3Y,QAAA24Y,EAAA5gP,OAIA,IAAA,IAAA33J,EAAA,EAAAA,EAAAsI,EAAAkuY,WAAA14Y,SAAAkC,EAAA,CACA,IAAA22Y,EAAAruY,EAAAkuY,WAAAx2Y,GAGA,QAAAzxE,IAAAood,EAAAS,iBAAAx3Y,QAIA,OAAA+2Y,EAAAS,iBAAAhhN,WACA,KAAAve,EAAA8B,IAAA2R,KAAAqjB,cACAgoM,EAAAS,iBAAAx3Y,QACA+2Y,EAAAS,iBAAAvpd,IAAA0sQ,QACAjyL,EAAA8uY,iBAAAvpd,IAAA03J,MACA,MAEA,QACA,MAAA,IAAA5zD,MAAA,sCACAglX,EAAAS,iBAAAhhN,0NC1rBA,IAAAve,EAAAzrP,EAAA,WACAA,EAAA,UACAA,EAAA,UAGA,IAAA0tP,EAAAjC,EAAAiC,KAGAshO,EAAAlvd,EAAAC,QAAA0rP,EAAAwjO,UAAAxjO,EAAAwjO,WAAA,GACAxjO,EAAAq+N,MAAAr+N,EAAAq+N,OAAA,GACAr+N,EAAAq+N,MAAAp8N,KAAAshO,EAEA,IAAAzC,EAAA,CACAjtd,KAAA,cACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,0BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,eACA,CACAn/P,KAAA,sBACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA+mL,aAAA,EACAjuH,UAAA,EACAqyH,YAAA,aAGAswN,EAAAzC,qBAAAA,EAEA,IAAA2C,EAAA,CACA5vd,KAAA,uBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,mCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,eACA,CACAn/P,KAAA,kDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,4DACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,gBACA,CACAn/P,KAAA,4DACA+6P,SAAA3M,EAAAiL,MAAAC,UACA8F,YAAA,kBAEA,CACAp/P,KAAA,wCACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EA2BAkrL,QAAA,mBACAC,YAAA,0BAIAswN,EAAAT,uBAAA,CACAjvd,KAAA,gBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,wBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,WACA,CACAn/P,KAAA,+BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA0N,IACAO,aAAA,EACAoE,YAAA,mBACApgK,OAAA4wX,IAGAF,EAAAV,uBAAA,CACAhvd,KAAA,gBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,wBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,YACAngK,OAAA4wX,IAGA,IAAAC,EAAA,CACA7vd,KAAA,aACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,qBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,GACA,CACAh7P,KAAA,mCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,0CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAoE,YAAA,UACA,CACAp/P,KAAA,gDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,YAEA,CACAn/P,KAAA,6BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,uCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,mBACA,CACAn/P,KAAA,uCACA+6P,SAAA3M,EAAAiL,MAAAC,UACA0B,aAAA,EACAoE,YAAA,kBACAryH,UAAA,KAEA,CACA/sI,KAAA,qCACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA+mL,aAAA,EACAjuH,UAAA,EACAoyH,QAAA,2BACA,CACAn/P,KAAA,uCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAmE,QAAA,sBACA,CACAn/P,KAAA,6BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA+M,YACAkB,aAAA,EACAmE,QAAA,aACA,CACAn/P,KAAA,uCACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA+mL,aAAA,EACAjuH,UAAA,EACAoyH,QAAA,+BAIAuwN,EAAA7B,oBAAA,CACA7td,KAAA,aACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,qBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,WACA,CACAn/P,KAAA,8BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA0N,IACAO,aAAA,EACAoE,YAAA,oBAEA6tN,EACA,CACAjtd,KAAA,0BACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA84D,UAAA,EACAqyH,YAAA,gBACA,CACAp/P,KAAA,wCACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA84D,UAAA,EACAqyH,YAAA,QACA,CACAp/P,KAAA,yBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA0N,IACA0E,QAAA,cACApyH,UAAA,EACAlsI,MAAA,CAAAgvd,MAIAH,EAAApE,uBAAA,CACAtrd,KAAA,gBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,wBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,WACA,CACAn/P,KAAA,gCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,uCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAoE,YAAA,UACA,CACAp/P,KAAA,6CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,YAEA,CACAn/P,KAAA,uCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,iDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,gBACA,CACAn/P,KAAA,iDACA+6P,SAAA3M,EAAAiL,MAAAC,UACA0B,aAAA,EACAoE,YAAA,kBAEA,CACAp/P,KAAA,6BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA+M,YACAkB,aAAA,EACAmE,QAAA,6FCzSA,IAAAhT,EAAAzrP,EAAA,WACAA,EAAA,SACAA,EAAA,UACAA,EAAA,SACAA,EAAA,QACAA,EAAA,SACAA,EAAA,UACAA,EAAA,SACAA,EAAA,SACAA,EAAA,SACAA,EAAA,UAGA,IAAA0tP,EAAAjC,EAAAiC,KAGAH,EAAAztP,EAAAC,QAAA0rP,EAAA8B,IAAA9B,EAAA8B,KAAA,GACA2R,EAAA3R,EAAA2R,KAGAkwN,EAAA,GACAA,EAAA,GAAAlwN,EAAA,WACAkwN,EAAA,WAAA,KACAA,EAAA,EAAAlwN,EAAA,YACAkwN,EAAA,YAAA,IACAA,EAAA,EAAAlwN,EAAA,aACAkwN,EAAA,aAAA,IACAA,EAAA,GAAAlwN,EAAA,oBACAkwN,EAAA,oBAAA,KACAA,EAAA,EAAAlwN,EAAA,iBACAkwN,EAAA,iBAAA,IACAA,EAAA,GAAAlwN,EAAA,uBACAkwN,EAAA,uBAAA,KACAA,EAAA,EAAAlwN,EAAA,aACAkwN,EAAA,aAAA,IAIA,IAAAvyM,EAAApxB,EAAA8B,IAAA1B,IAAAgxB,mBAGAwyM,EAAA,CACA/vd,KAAA,cACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,6BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAoE,YAAA,iBACAv+P,MAAA,CAAA,CACAb,KAAA,qCACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA+mL,aAAA,EACAjuH,UAAA,EACAlsI,MAAA,CAAA,CACAb,KAAA,6CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,iBAEA,CACAn/P,KAAA,0CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,oBACA,CACAn/P,KAAA,uCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,iDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,wBACA,CACAn/P,KAAA,kDACA+6P,SAAA3M,EAAAiL,MAAAC,UACAvsH,UAAA,EACAqyH,YAAA,6BAEA,CACAp/P,KAAA,oCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAoE,YAAA,cACA,CACAp/P,KAAA,sCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EAKAn6P,MAAA,CAAA,CAEAb,KAAA,sDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6N,QACAI,aAAA,EACAjuH,UAAA,EACAoyH,QAAA,wBACA,CAEAn/P,KAAA,8DACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA8N,gBACAG,aAAA,EACAjuH,UAAA,EACAoyH,QAAA,gCACA,CAEAn/P,KAAA,qDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6N,QACAI,aAAA,EACAjuH,UAAA,EACAoyH,QAAA,wBACA,CAEAn/P,KAAA,6DACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA8N,gBACAG,aAAA,EACAjuH,UAAA,EACAoyH,QAAA,kCAEA,CAEAn/P,KAAA,qCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAoE,YAAA,eAGAme,EACA,CAEAv9Q,KAAA,4CACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA+mL,aAAA,EACAjuH,UAAA,EACAlsI,MAAA,CAAA,CACAb,KAAA,+CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA8M,UACAmB,aAAA,EAEAsE,sBAAA,wBAEA,CAEAt/P,KAAA,6CACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA+mL,aAAA,EACAjuH,UAAA,EACAlsI,MAAA,CAAA,CACAb,KAAA,gDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA8M,UACAmB,aAAA,EAEAsE,sBAAA,yBAEA,CAEAt/P,KAAA,wCACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA+mL,aAAA,EACAoE,YAAA,iBACAryH,UAAA,KAEA,CAEA/sI,KAAA,iCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CAEAb,KAAA,2CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,oBACA,CACAn/P,KAAA,kDACA+6P,SAAA3M,EAAAiL,MAAAC,UACAvsH,UAAA,EACAqyH,YAAA,yBAEA,CAEAp/P,KAAA,6BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA8M,UACAmB,aAAA,EACAsE,sBAAA,mBAIA0wN,EAAA,CACAhwd,KAAA,SACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,uBACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA+mL,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,2CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAAiL,MAAAmB,SACAQ,aAAA,EACAjuH,UAAA,EACAlsI,MAAA,CAAA,CACAb,KAAA,qDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,eAIA,CACAn/P,KAAA,0BACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA+mL,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,8CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAAiL,MAAAmB,SACAQ,aAAA,EACAjuH,UAAA,EACAlsI,MAAA,CAAA,CACAb,KAAA,wDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,cACA,CACAn/P,KAAA,qDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,+DACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,wBAKA,CACAn/P,KAAA,oBACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA84D,UAAA,EACAlsI,MAAA,CAAA,CACAb,KAAA,+BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAAiL,MAAAO,QACAoB,aAAA,EACAmE,QAAA,gBAEA,CACAn/P,KAAA,sBACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA84D,UAAA,EACAlsI,MAAA,CAAA,CACAb,KAAA,yBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAAiL,MAAAO,QACAoB,aAAA,EACAmE,QAAA,eAMA8wN,EAAA,CACAjwd,KAAA,2BACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAoE,YAAA,2BACAv+P,MAAA,CAAA,CACAb,KAAA,mCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA6M,QACAoB,aAAA,EACAmE,QAAA,mCACA,CAEAn/P,KAAA,mCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAoE,YAAA,mCAGAme,EACA,CACAv9Q,KAAA,sCACA+6P,SAAA3M,EAAAiL,MAAAG,iBACAvlL,KAAA,EACA+mL,aAAA,EACAjuH,UAAA,EACAoyH,QAAA,qCACAt+P,MAAA,CAAA,CACAb,KAAA,sCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CACAb,KAAA,2CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,GACA,CACAh7P,KAAA,4CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA0N,IACAO,aAAA,SAOAk1N,EAAA,CACAlwd,KAAA,uBACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAoE,YAAA,MACAv+P,MAAA,CACAovd,EAAA,CAEAjwd,KAAA,0CACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAyN,SACAQ,aAAA,EACAn6P,MAAA,CAAA,CAEAb,KAAA,oDACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAAiN,IACAgB,aAAA,EACAmE,QAAA,mBACA,CACAn/P,KAAA,qDACA+6P,SAAA3M,EAAAiL,MAAAC,UACAvsH,UAAA,EACAqyH,YAAA,wBAEA,CAEAp/P,KAAA,iCACA+6P,SAAA3M,EAAAiL,MAAAC,UACArlL,KAAAm6K,EAAArB,KAAA8M,UACAmB,aAAA,EACAsE,sBAAA,kBAuGA,SAAA6wN,EAAAnkX,EAAAlqG,GACA,iBAAAA,IACAA,EAAA,CAAAkpd,UAAAlpd,IAKA,IAFA,IACAiqF,EADAwyK,EAAA,KAEAjqL,EAAA,EAAA,OAAAiqL,GAAAjqL,EAAA03B,EAAAihC,WAAA76D,SAAAkC,EACAyX,EAAAigB,EAAAihC,WAAA34D,IACAxyE,EAAAmyE,MAAAnyE,EAAAmyE,OAAA8X,EAAA9X,MAEAnyE,EAAA9B,MAAA8B,EAAA9B,OAAA+rF,EAAA/rF,MAEA8B,EAAAkpd,WAAAlpd,EAAAkpd,YAAAj/X,EAAAi/X,aAHAzsN,EAAAxyK,GAOA,OAAAwyK,EA5GAtQ,EAAAs9N,qBAAA,SAAA6E,EAAAhmN,GAKA,IAJA,IAGAx7K,EAAA7C,EAAAigB,EAHAuyJ,EAAA,GAIA8xN,EAAA,EAAAA,EAAAD,EAAAvvd,MAAAuxE,SAAAi+Y,EAAA,CAEAzhY,EAAAwhY,EAAAvvd,MAAAwvd,GAKA,IAAA,IAAA/7Y,EAAA,EAAAA,EAAAsa,EAAA/tF,MAAAuxE,SAAAkC,EACA03B,EAAA,GACAjgB,EAAA6C,EAAA/tF,MAAAyzE,GACA03B,EAAA/3B,KAAAm6K,EAAA8O,SAAAnxK,EAAAlrF,MAAA,GAAAA,OACAmrG,EAAAnrG,MAAAkrF,EAAAlrF,MAAA,GAAAA,MACAmrG,EAAAskX,cAAAvkY,EAAAlrF,MAAA,GAAAozE,KAEA+3B,EAAA/3B,QAAA2rL,IACA5zJ,EAAAhsG,KAAA4/P,EAAA5zJ,EAAA/3B,MACA+3B,EAAAhsG,QAAA8vd,IACA9jX,EAAAg/W,UAAA8E,EAAA9jX,EAAAhsG,QAGAoqQ,IACAA,EAAAtnG,OAAA92D,EAAA/3B,MACAm2L,EAAAtnG,OAAA92D,EAAAnrG,QAEA09P,EAAAtmL,KAAA+zB,GAIA,OAAAuyJ,GASAtQ,EAAAsiO,qBAAA,SAAAtjV,GAIA,IAHA,IAAAsxH,EAAA,GAGA8xN,EAAA,EAAAA,EAAApjV,EAAA76D,SAAAi+Y,EAQA,IANA,IAAAx1H,EAAA5tN,EAAAojV,GAIAp8Y,EAAAm6K,EAAA8O,SAAA29F,EAAAh6V,MAAA,GAAAA,OACA0pG,EAAAswP,EAAAh6V,MAAA,GAAAA,MACAy3Q,EAAA,EAAAA,EAAA/tK,EAAAn4B,SAAAkmM,EAAA,CACA,IAAAtsK,EAAA,GAYA,GAXAA,EAAA/3B,KAAAA,EACA+3B,EAAAnrG,MAAA0pG,EAAA+tK,GAAAz3Q,MACAmrG,EAAAskX,cAAA/lX,EAAA+tK,GAAArkM,KAEA+3B,EAAA/3B,QAAA2rL,IACA5zJ,EAAAhsG,KAAA4/P,EAAA5zJ,EAAA/3B,MACA+3B,EAAAhsG,QAAA8vd,IACA9jX,EAAAg/W,UAAA8E,EAAA9jX,EAAAhsG,QAIAgsG,EAAA/3B,OAAA2rL,EAAA4wN,iBAAA,CACAxkX,EAAAykX,WAAA,GACA,IAAA,IAAAjgN,EAAA,EAAAA,EAAAxkK,EAAAnrG,MAAAuxE,SAAAo+L,EACAxkK,EAAAykX,WAAAx4Y,KAAAg2K,EAAAyiO,6BAAA1kX,EAAAnrG,MAAA2vQ,KAGAjS,EAAAtmL,KAAA+zB,GAIA,OAAAuyJ,GA+DA,IAAAoyN,EAAA,SAAA3zN,EAAAhxJ,EAAA4kX,GACA,IAAAltY,EAAA,GAEA,GAAAs5K,IAAA4C,EAAA,cACA,OAAAl8K,EAGAktY,IACAltY,EAAA,CACA88B,KAAA,CACAqwW,aAAAjxN,EAAA,MAEAmlG,IAAA,CACA8rH,aAAAjxN,EAAA,KACAp/I,KAAA,CACAqwW,aAAAjxN,EAAA,OAGA6sB,WAAA,KAIA,IAAAttB,EAAA,GACAj/H,EAAA,GACA,IAAAkuH,EAAAhlB,SAAAp9H,EAAAgkX,EAAA7wN,EAAAj/H,GAAA,CACA,IAAAxjD,EAAA,IAAAupB,MAAA,2CAEA,MADAvpB,EAAAwjD,OAAAA,EACAxjD,EAmBA,YAhBA75E,IAAAs8P,EAAA2xN,UACAptY,EAAA88B,KAAA98B,EAAA88B,MAAA,GACA98B,EAAA88B,KAAAqwW,aAAAziO,EAAA8O,SAAAiC,EAAA2xN,eAGAjud,IAAAs8P,EAAA4xN,aACArtY,EAAAqhR,IAAArhR,EAAAqhR,KAAA,GACArhR,EAAAqhR,IAAA8rH,aAAAziO,EAAA8O,SAAAiC,EAAA4xN,YACArtY,EAAAqhR,IAAAvkP,KAAA98B,EAAAqhR,IAAAvkP,MAAA,GACA98B,EAAAqhR,IAAAvkP,KAAAqwW,aAAAziO,EAAA8O,SAAAiC,EAAA6xN,sBAGAnud,IAAAs8P,EAAAstB,aACA/oM,EAAA+oM,WAAAttB,EAAAstB,WAAArnM,WAAA,IAGA1B,GA8uCA,SAAAutY,EAAAjlX,GAQA,IANA,IAIAjgB,EAAA6C,EAJA2vK,EAAAnQ,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,IAIAzsF,EAAA/hE,EAAAihC,WACA34D,EAAA,EAAAA,EAAAy5F,EAAA37F,SAAAkC,EAAA,CAEA,IAAAzzE,GADAkrF,EAAAgiF,EAAAz5F,IACAzzE,MAGAyvd,EAAAliO,EAAArB,KAAA2N,gBACA,kBAAA3uK,IACAukY,EAAAvkY,EAAAukY,iBAEAliO,EAAArB,KAAAuN,OACAz5P,EAAAsrP,EAAAp/I,KAAAy0J,WAAA3gQ,IAQA+tF,EAAAw/J,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA0N,KAAA,EAAA,CACArM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAhxK,EAAA9X,MAAAs6K,YAEAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAg3N,GAAA,EAAAzvd,OAGA09P,EAAA19P,MAAAo3E,KAAA2W,GAGA,OAAA2vK,EAwCA,SAAA2yN,EAAAnjT,GAEA,IADA,IAAAhiF,EACAzX,EAAA,EAAAA,EAAAy5F,EAAA37F,SAAAkC,EAAA,CAaA,QATA,KAHAyX,EAAAgiF,EAAAz5F,IAGAt0E,OACA+rF,EAAA9X,MAAA8X,EAAA9X,QAAAg6K,EAAA2R,KACA7zK,EAAA/rF,KAAAiuP,EAAA2R,KAAA7zK,EAAA9X,MACA8X,EAAAi/X,WAAAj/X,EAAAi/X,aAAA8E,IACA/jY,EAAA/rF,KAAAiuP,EAAA2R,KAAAkwN,EAAA/jY,EAAAi/X,mBAKA,IAAAj/X,EAAA9X,KAAA,CACA,IAAA8X,EAAA/rF,QAAA+rF,EAAA/rF,QAAAiuP,EAAA2R,MAKA,MAFAljL,EAAA,IAAAupB,MAAA,kCACAkrX,UAAAplY,EACArP,EAJAqP,EAAA9X,KAAAg6K,EAAA2R,KAAA7zK,EAAA/rF,MAgBA,QAPA,IAAA+rF,EAAAi/X,WACAj/X,EAAA/rF,MAAA+rF,EAAA/rF,QAAA8vd,IACA/jY,EAAAi/X,UAAA8E,EAAA/jY,EAAA/rF,OAKA+rF,EAAA9X,OAAA2rL,EAAA4wN,mBACAzkY,EAAAqlY,kBAAA,EACArlY,EAAAukY,cAAAliO,EAAArB,KAAAyN,UACAzuK,EAAAlrF,OAAAkrF,EAAA0kY,YAAA,CACA1kY,EAAAlrF,MAAA,GACA,IAAA,IAAA2vQ,EAAA,EAAAA,EAAAzkL,EAAA0kY,WAAAr+Y,SAAAo+L,EACAzkL,EAAAlrF,MAAAo3E,KAAAg2K,EAAAojO,2BACAC,EAAAvlY,EAAA0kY,WAAAjgN,MAMA,IAAA9zL,EADA,QAAA,IAAAqP,EAAAlrF,MAGA,MAFA67E,EAAA,IAAAupB,MAAA,mCACAkrX,UAAAplY,EACArP,GAcA,SAAA40Y,EAAApwd,EAAAY,GAWA,GAVAA,EAAAA,GAAA,QAGA,IAAAZ,EAAAlB,MACAkB,EAAAkwF,IAAAlwF,EAAAkwF,MAAA68J,EAAA2R,OACA1+P,EAAAlB,KAAAiuP,EAAA2R,KAAA1+P,EAAAkwF,UAKA,IAAAlwF,EAAAkwF,GAAA,CACA,IAAAlwF,EAAAlB,QAAAkB,EAAAlB,QAAAiuP,EAAA2R,MAKA,MAFAljL,EAAA,IAAAupB,MAAA,gCACAyiU,UAAAxna,EACAw7E,EAJAx7E,EAAAkwF,GAAA68J,EAAA2R,KAAA1+P,EAAAlB,MAQA,QAAA,IAAAkB,EAAAL,MACA,OAAAK,EAMA,GAAA,aAAAA,EAAAlB,KAAA,CAEA,IAAAk8P,EAAA,EACAV,EAAA,EACAy6B,EAAA,EACA/0R,EAAAqwd,mBACA/1N,GAAA,IACAU,EAAA,GAEAh7P,EAAAswd,iBACAh2N,GAAA,GACAU,EAAA,GAEAh7P,EAAAuwd,kBACAj2N,GAAA,GACAU,EAAA,GAEAh7P,EAAAwwd,mBACAl2N,GAAA,GACAU,EAAA,GAEAh7P,EAAAywd,eACAn2N,GAAA,EACAU,EAAA,GAEAh7P,EAAA0wd,cACAp2N,GAAA,EACAU,EAAA,GAEAh7P,EAAA2wd,UACAr2N,GAAA,EACAU,EAAA,GAEAh7P,EAAA4wd,eACAt2N,GAAA,EACAU,EAAA,GAEAh7P,EAAA6wd,eACA97L,GAAA,IACA/5B,EAAA,GAIA,IAAAr7P,EAAA2yE,OAAA67C,aAAA6sI,GACA,IAAA+5B,EACAp1R,GAAA2yE,OAAA67C,aAAAmsI,GAAAhoL,OAAA67C,aAAA4mK,GACA,IAAAz6B,IACA36P,GAAA2yE,OAAA67C,aAAAmsI,IAEAt6P,EAAAL,MAAAutP,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA8M,WAAA,EAAAh5P,QACA,GAAA,qBAAAK,EAAAlB,KAEAkB,EAAAL,MAAAutP,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,IAEAt5P,EAAA8wd,IACA9wd,EAAAL,MAAAA,MAAAo3E,KAAAm2K,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA4M,SAAA,EACAnmL,OAAA67C,aAAA,OAEA,sBAAAnuH,GACAA,EAAAL,MAAAA,MAAAo3E,KAAAm2K,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAxL,EAAA2Q,aAAA79P,EAAA+wd,mBAAA1jO,kBAEA,GAAA,gBAAArtP,EAAAlB,KAAA,CAEAkB,EAAAL,MAAAutP,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,IACA,IAAAqgG,EAAA35V,EAAAL,MAAAA,MACA,IAAA,IAAAsB,KAAAjB,GACA,IAAAA,EAAAiB,KAIAA,KAAAy9P,EACAi7F,EAAA5iR,KAAAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KACA,EAAA5L,EAAA2O,SAAA6C,EAAAz9P,IAAAosP,cACA,IAAApsP,EAAAw2E,QAAA,MAEAkiR,EAAA5iR,KAAAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KACA,EAAA5L,EAAA2O,SAAA56P,GAAAosP,mBAGA,GAAA,eAAArtP,EAAAlB,KAAA,CAGAk8P,EAAA,EACAV,EAAA,EAEAt6P,EAAAgxd,SACA12N,GAAA,IACAU,EAAA,GAEAh7P,EAAAquZ,SACA/zJ,GAAA,GACAU,EAAA,GAEAh7P,EAAAixd,QACA32N,GAAA,GACAU,EAAA,GAEAh7P,EAAAkxd,UACA52N,GAAA,GACAU,EAAA,GAEAh7P,EAAAmxd,WACA72N,GAAA,EACAU,EAAA,GAEAh7P,EAAAoxd,QACA92N,GAAA,EACAU,EAAA,GAEAh7P,EAAAqxd,UACA/2N,GAAA,EACAU,EAAA,GAEAh7P,EAAAsxd,QACAh3N,GAAA,EACAU,EAAA,GAIAr7P,EAAA2yE,OAAA67C,aAAA6sI,GACA,IAAAV,IACA36P,GAAA2yE,OAAA67C,aAAAmsI,IAEAt6P,EAAAL,MAAAutP,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA8M,WAAA,EAAAh5P,QACA,GAAA,mBAAAK,EAAAlB,MAAA,kBAAAkB,EAAAlB,KAAA,CAEAkB,EAAAL,MAAAutP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,IAGA,IAAA,IAAAp5P,EAAA,EAAAA,EAAAF,EAAAuxd,SAAArgZ,SAAAhxE,EAAA,CAEAP,GADA6xd,EAAAxxd,EAAAuxd,SAAArxd,IACAP,MAEA,GAAA,IAAA6xd,EAAAz+Y,MAAAy+Y,EAAAhrN,IAEA,GAAA,QADA7mQ,EAAAsrP,EAAAp/I,KAAA06J,YAAAirN,EAAAhrN,KAKA,MAHAhrL,EAAA,IAAAupB,MACA,8DACAyiU,UAAAxna,EACAw7E,OAEA,IAAAg2Y,EAAAz+Y,OAGApzE,EADA6xd,EAAA11N,IACA5O,EAAA2O,SAAA3O,EAAA2O,SAAA21N,EAAA11N,MAGA5O,EAAA2O,SAAAl8P,IAGAK,EAAAL,MAAAA,MAAAo3E,KAAAm2K,EAAA/sP,OACA+sP,EAAAiL,MAAAG,iBAAAk5N,EAAAz+Y,MAAA,EACApzE,UAEA,GAAA,cAAAK,EAAAlB,MAAA8B,EAAAqsd,KAAA,CAEA,IAAA,iBAAAv7Y,KAAA1xE,EAAAiwI,UACAjwI,EAAAiwI,QAAA/+D,OAAA,GAAAlxE,EAAAiwI,QAAA/+D,OAAA,IACA,MAAA,IAAA6zB,MAAA,gCAGA/kG,EAAAL,MAAAutP,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA4N,WAAA,EAAAz5P,EAAAiwI,cACA,GAAA,yBAAAjwI,EAAAlB,MAAA8B,EAAAqsd,KAAA,CACA,IAAAwE,EAAA7wd,EAAAqsd,KAAAyE,+BACA1xd,EAAA2xd,qBAAAF,EAAApwN,QAEArhQ,EAAAL,MAAAutP,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EAAA64N,EAAApkO,iBACA,GAAA,2BAAArtP,EAAAlB,MAAA8B,EAAAqsd,KAAA,CAEAjtd,EAAAL,MAAAutP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,IACAqgG,EAAA35V,EAAAL,MAAAA,MAEA,GAAAK,EAAA4xd,cAAA,CACA,IAAAA,GAAA,IAAA5xd,EAAA4xd,cACAhxd,EAAAqsd,KAAAyE,+BAAArkO,WACArtP,EAAA4xd,cACAj4H,EAAA5iR,KACAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAAs5N,IAGA,GAAA5xd,EAAA6xd,oBAAA,CACA,IAAAA,EAAA,CACA3kO,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CACAy3N,GAAA,IAAA/vd,EAAA6xd,oBACAjxd,EAAAqsd,KAAApD,OAAA7pd,EAAA6xd,wBAGAl4H,EAAA5iR,KACAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAAu5N,IAGA,GAAA7xd,EAAAsqd,aAAA,CACA,IAAAA,EAAAr/N,EAAAp/I,KAAAw2J,YAAA,IAAAriQ,EAAAsqd,aACA1pd,EAAAqsd,KAAA3C,aAAAtqd,EAAAsqd,cACA3wH,EAAA5iR,KACAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAAgyN,UAEA,GAAA,0BAAAtqd,EAAAlB,KAAA,CACAkB,EAAAL,MAAAutP,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,IACAqgG,EAAA35V,EAAAL,MAAAA,MAAA,IASA6xd,EANAM,EAAA5kO,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,IAGAy4N,EAAA7kO,EAAA/sP,OACA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,IAEA,IAAAp4P,EAAA,EAAAA,EAAAF,EAAAuxd,SAAArgZ,SAAAhxE,EAAA,CAEAP,GADA6xd,EAAAxxd,EAAAuxd,SAAArxd,IACAP,MAEA,GAAA,IAAA6xd,EAAAz+Y,MAAAy+Y,EAAAhrN,IAEA,GAAA,QADA7mQ,EAAAsrP,EAAAp/I,KAAA06J,YAAAirN,EAAAhrN,KAKA,MAHAhrL,EAAA,IAAAupB,MACA,8DACAyiU,UAAAxna,EACAw7E,OAEA,IAAAg2Y,EAAAz+Y,OAGApzE,EADA6xd,EAAA11N,IACA5O,EAAA2O,SAAA3O,EAAA2O,SAAA21N,EAAA11N,MAGA5O,EAAA2O,SAAAl8P,IAGAoyd,EAAApyd,MAAAo3E,KAAAm2K,EAAA/sP,OACA+sP,EAAAiL,MAAAG,iBAAAk5N,EAAAz+Y,MAAA,EACApzE,IAIAmyd,EAAAnyd,MAAAo3E,KAAAm2K,EAAA/sP,OACA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CAAAy5N,KACAp4H,EAAA5iR,KAAA+6Y,GAKA,IAAAt2Y,EADA,QAAA,IAAAx7E,EAAAL,MAGA,MAFA67E,EAAA,IAAAupB,MAAA,mCACAyiU,UAAAxna,EACAw7E,EAGA,OAAAx7E,EAUA,SAAAgyd,EAAAl2N,EAAAt5K,GACA,OAAAs5K,GACA,KAAA4C,EAAA,cACA,IAAAxsJ,EAAA,GAiCA,YA/BAvwG,IAAA6gF,EAAA88B,KAAAqwW,cACAz9W,EAAAn7B,KAAAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CACApL,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CACApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAr5K,EAAA88B,KAAAqwW,cAAAtiO,YACAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAgN,MAAA,EAAA,cAKAl3P,IAAA6gF,EAAAqhR,IAAA8rH,cACAz9W,EAAAn7B,KAAAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CACApL,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CACApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAr5K,EAAAqhR,IAAA8rH,cAAAtiO,YACAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CACApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAr5K,EAAAqhR,IAAAvkP,KAAAqwW,cAAAtiO,YACAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAgN,MAAA,EAAA,gBAMAl3P,IAAA6gF,EAAA+oM,YACAr5K,EAAAn7B,KAAAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CACApL,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAxL,EAAA2Q,aAAAr7K,EAAA+oM,YAAAl+B,eAIAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAApnJ,GAEA,QACA,OAAAg7I,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAgN,MAAA,EAAA,KAYA,SAAAo5N,EAAAC,GAEA,IAAA70N,EAAAnQ,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,IAGA,GAAA,IAAA45N,EAAAnmV,WAAA76D,OACA,OAAAmsL,EAKA,IADA,IAAAxwF,EAAAqlT,EAAAnmV,WACA34D,EAAA,EAAAA,EAAAy5F,EAAA37F,SAAAkC,EAAA,CACA,IAAAyX,EAAAgiF,EAAAz5F,GACAzzE,EAAAkrF,EAAAlrF,MAGAyvd,EAAAliO,EAAArB,KAAAuN,KACA,kBAAAvuK,IACAukY,EAAAvkY,EAAAukY,eAEAA,IAAAliO,EAAArB,KAAAuN,OACAz5P,EAAAsrP,EAAAp/I,KAAAy0J,WAAA3gQ,IAEA,IAAAuwd,GAAA,EACA,qBAAArlY,IACAqlY,EAAArlY,EAAAqlY,kBAOA,IAAAv2H,EAAAzsG,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAhxK,EAAA9X,MAAAs6K,YACAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA0N,KAAA,EAAA,CAEArM,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAg3N,EAAAc,EAAAvwd,OAGA09P,EAAA19P,MAAAo3E,KAAA4iR,GAGA,OAAAt8F,EA/uDAtQ,EAAAmgO,mBAAA,SAAA5hN,EAAA6mN,EAAAvzV,GACA,IAAAljD,EAAAuvK,EAAAqgB,IAAAj7J,OAAAi7J,GAAA,GAEA,GAAA,gBAAA5vL,EAAA3I,MACA,qBAAA2I,EAAA3I,MACA,wBAAA2I,EAAA3I,KAAA,CACA,IAAAyI,EAAA,IAAAupB,MACA,+HAGA,MADAvpB,EAAAgwL,WAAA9vL,EAAA3I,KACAyI,EAEA,GAAAE,EAAA+vL,UAAA,cAAA/vL,EAAA+vL,SAAA14L,KACA,MAAA,IAAAgyB,MACA,6DAIA,IAAA+F,EAAAoiJ,EAAAmO,QAAA3/K,EAAAxJ,KAAA0sD,GAEA,OAAAmuH,EAAA8/N,oBAAA/hX,EAAAqnX,IAWAplO,EAAAqlO,iBAAA,SAAAnF,EAAAtqN,GAEA,IAAAjnL,EAAA,CACA3I,KAAA,cACAb,KAAAg7K,EAAAC,MAAAJ,EAAA+/N,kBAAAG,IAAA5/N,YAEA,OAAApC,EAAAqgB,IAAA/7J,OAAA7zB,EAAA,CAAAinL,QAAAA,KAUA5V,EAAA+zB,iBAAA,SAAAxV,GACA,IAAA5vL,EAAAuvK,EAAAqgB,IAAAj7J,OAAAi7J,GAAA,GAEA,GAAA,eAAA5vL,EAAA3I,MAAA,mBAAA2I,EAAA3I,KAAA,CACA,IAAAyI,EAAA,IAAAupB,MAAA,mGAGA,MADAvpB,EAAAgwL,WAAA9vL,EAAA3I,KACAyI,EAEA,GAAAE,EAAA+vL,UAAA,cAAA/vL,EAAA+vL,SAAA14L,KACA,MAAA,IAAAgyB,MAAA,4DAIA,IAAA+F,EAAAoiJ,EAAAmO,QAAA3/K,EAAAxJ,MAEA,OAAA66K,EAAA01B,kBAAA33K,IAWAiiJ,EAAAslO,eAAA,SAAApxd,EAAA0hQ,GAEA,IAAAjnL,EAAA,CACA3I,KAAA,aACAb,KAAAg7K,EAAAC,MAAAJ,EAAA+1B,gBAAA7hR,IAAAosP,YAEA,OAAApC,EAAAqgB,IAAA/7J,OAAA7zB,EAAA,CAAAinL,QAAAA,KAWA5V,EAAAulO,2BAAA,SAAArxd,EAAA0hQ,GAEA,IAAAjnL,EAAA,CACA3I,KAAA,iBACAb,KAAAg7K,EAAAC,MAAAJ,EAAAi2B,wBAAA/hR,IAAAosP,YAEA,OAAApC,EAAAqgB,IAAA/7J,OAAA7zB,EAAA,CAAAinL,QAAAA,KAiBA5V,EAAAwlO,wBAAA,SAAAtxd,EAAAL,GAEA,IAGAgkO,EAHAskC,GADAtoQ,EAAAA,GAAA,IACAsoQ,IAAAje,EAAAie,GAAAh9B,KAAA/rO,SAIA,OAHAS,EAAAmyE,MAAA,gBAIA,IAAA,eACA6xJ,EAAAsoB,EAAAC,MAAAJ,EAAAi2B,wBAAA/hR,IAAAosP,WACA,MACA,IAAA,uBACAzoB,EAAAsoB,EAAAC,MAAAJ,EAAA+1B,gBAAA7hR,IAAAosP,WACA,MACA,QACA,MAAA,IAAAtoJ,MAAA,6BAAAnkG,EAAAmyE,KAAA,MAIAm2L,EAAAjoL,QACAioL,EAAAtnG,OAAAgjE,GACA,IAAAO,EAAA+jC,EAAA/jC,SACA,GAAA,QAAAvkO,EAAA4nO,SAAA,CACA,IAAAv2J,EAAAkzJ,EAAAk8B,QACA,OAAAzgQ,EAAA2oW,UACAt3R,EAAAsX,MAAA,SAAAhT,KAAA31E,EAAA2oW,WAEAt3R,EACA,GAAA,WAAArxE,EAAA4nO,SACA,OAAArD,EAAAkoB,WACA,GAAAzsP,EAAA4nO,SACA,MAAA,IAAAzjI,MAAA,qBAAAnkG,EAAA4nO,SAAA,MAEA,OAAArD,GAkBA4nB,EAAAylO,4BAAA,SAAAlnN,EAAA6mN,EAAAvzV,GACA,IAAAljD,EAAAuvK,EAAAqgB,IAAAj7J,OAAAi7J,GAAA,GAEA,GAAA,wBAAA5vL,EAAA3I,KAAA,CACA,IAAAyI,EAAA,IAAAupB,MAAA,mGAGA,MADAvpB,EAAAgwL,WAAA9vL,EAAA3I,KACAyI,EAEA,GAAAE,EAAA+vL,UAAA,cAAA/vL,EAAA+vL,SAAA14L,KACA,MAAA,IAAAgyB,MAAA,uEAKA,IAAA+F,EAAAoiJ,EAAAmO,QAAA3/K,EAAAxJ,KAAA0sD,GAEA,OAAAmuH,EAAA0lO,6BAAA3nX,EAAAqnX,IAWAplO,EAAA2lO,0BAAA,SAAAR,EAAAvvN,GAEA,IAAAjnL,EAAA,CACA3I,KAAA,sBACAb,KAAAg7K,EAAAC,MAAAJ,EAAA4lO,2BAAAT,IAAA7kO,YAEA,OAAApC,EAAAqgB,IAAA/7J,OAAA7zB,EAAA,CAAAinL,QAAAA,KAQA5V,EAAA6lO,kBAAA,WACA,IAAA3F,EAAA,CACAt9W,QAAA,EACA26W,aAAA,KACAuI,aAAA,KACA3/X,UAAA,KACA4/X,QAAA,IAoVA,OAnVA7F,EAAA6F,QAAAnD,aAAA,KACA1C,EAAA5uF,SAAA,GACA4uF,EAAA5uF,SAAA00F,UAAA,IAAA/oX,KACAijX,EAAA5uF,SAAA20F,SAAA,IAAAhpX,KAEAijX,EAAApD,OAAA,GACAoD,EAAApD,OAAAoJ,SAAA,SAAAC,GACA,OAAAjE,EAAAhC,EAAApD,OAAAqJ,IAEAjG,EAAApD,OAAAsJ,SAAA,SAAAtoY,GACAmlY,EAAA,CAAAnlY,IACAoiY,EAAApD,OAAA99U,WAAAh1D,KAAA8T,IAEAoiY,EAAApD,OAAA99U,WAAA,GACAkhV,EAAApD,OAAAvqW,KAAA,KAEA2tW,EAAAmG,QAAA,GACAnG,EAAAmG,QAAAH,SAAA,SAAAC,GACA,OAAAjE,EAAAhC,EAAAmG,QAAAF,IAEAjG,EAAAmG,QAAAD,SAAA,SAAAtoY,GACAmlY,EAAA,CAAAnlY,IACAoiY,EAAAmG,QAAArnV,WAAAh1D,KAAA8T,IAEAoiY,EAAAmG,QAAArnV,WAAA,GACAkhV,EAAAmG,QAAA9zW,KAAA,KAEA2tW,EAAAsC,WAAA,GACAtC,EAAAtuM,UAAA,KACAsuM,EAAA/jN,GAAA,KAQA+jN,EAAAoG,WAAA,SAAAxmT,EAAAymT,GAEAtD,EAAAnjT,GACAogT,EAAAmG,QAAArnV,WAAA8gC,SACAogT,EAAAmG,QAAAE,SACAA,IAEArG,EAAAmG,QAAAE,SAAAA,GAEArG,EAAAmG,QAAA9zW,KAAA,MASA2tW,EAAAsG,UAAA,SAAA1mT,EAAAymT,GAEAtD,EAAAnjT,GACAogT,EAAApD,OAAA99U,WAAA8gC,SACAogT,EAAApD,OAAAyJ,SACAA,IAEArG,EAAApD,OAAAyJ,SAAAA,GAEArG,EAAApD,OAAAvqW,KAAA,MAQA2tW,EAAAuG,cAAA,SAAAC,GACA,IAAA,IAAArgZ,EAAA,EAAAA,EAAAqgZ,EAAAviZ,SAAAkC,EACAg9Y,EAAAqD,EAAArgZ,GAAA,CAAA65Y,KAAAA,IAGAA,EAAAsC,WAAAkE,GAYAxG,EAAAyG,aAAA,SAAA9yd,GACA,iBAAAA,IACAA,EAAA,CAAA9B,KAAA8B,IAKA,IAFA,IACAwlT,EADA/oD,EAAA,KAEAjqL,EAAA,EAAA,OAAAiqL,GAAAjqL,EAAA65Y,EAAAsC,WAAAr+Y,SAAAkC,EACAgzO,EAAA6mK,EAAAsC,WAAAn8Y,IACAxyE,EAAAsvF,IAAAk2N,EAAAl2N,KAAAtvF,EAAAsvF,IAEAtvF,EAAA9B,MAAAsnT,EAAAtnT,OAAA8B,EAAA9B,QADAu+P,EAAA+oD,GAKA,OAAA/oD,GASA4vN,EAAA14N,KAAA,SAAAtzP,EAAAioQ,GAEA+jN,EAAA/jN,GAAAA,GAAAje,EAAAie,GAAAh9B,KAAA/rO,SACA,IAAAwvd,EAAAjxN,EAAAuuN,EAAA/jN,GAAAM,UAAA,qBACA,IAAAmmN,EAAA,CACA,IAAAn0Y,EAAA,IAAAupB,MAAA,+EAGA,MADAvpB,EAAAguL,UAAAyjN,EAAA/jN,GAAAM,UACAhuL,EAEAyxY,EAAA4F,aAAA5F,EAAA6F,QAAAnD,aAAAA,EAGA1C,EAAAr0H,eAAA7rG,EAAA4mO,kBAAA1G,GACA,IAAAroP,EAAAsoB,EAAAC,MAAA8/N,EAAAr0H,gBAGAq0H,EAAA/jN,GAAAtnG,OAAAgjE,EAAAyoB,YACA4/N,EAAA/5X,UAAAjyF,EAAAszP,KAAA04N,EAAA/jN,KAWA+jN,EAAArrM,OAAA,SAAAjrM,GACA,IAAA0mL,GAAA,EAEA,IAAA4vN,EAAA2G,OAAAj9Y,GAAA,CACA,IAAAkzY,EAAAlzY,EAAAkzY,OACAuJ,EAAAnG,EAAAmG,QAOA,MANA53Y,EAAA,IAAAupB,MACA,0IAGA8uX,eAAAhK,EAAA99U,WACAvwD,EAAAs4Y,aAAAV,EAAArnV,WACAvwD,EAGA,IAAA0tL,EAAAvyL,EAAAuyL,GACA,GAAA,OAAAA,EAAA,CAEA,GAAAvyL,EAAAk8Y,gBAAAn0N,EAEA,OADAA,EAAA/nL,EAAAk8Y,eAEA,IAAA,wBACA3pN,EAAAje,EAAAie,GAAAh9B,KAAA/rO,SACA,MACA,IAAA,uBACA+oQ,EAAAje,EAAAie,GAAA97B,IAAAjtO,SACA,MACA,IAAA,0BACA+oQ,EAAAje,EAAAie,GAAA2O,OAAA13Q,SACA,MACA,IAAA,0BACA+oQ,EAAAje,EAAAie,GAAAkkB,OAAAjtR,SACA,MACA,IAAA,0BACA+oQ,EAAAje,EAAAie,GAAAK,OAAAppQ,SACA,MACA,IAAA,aACA+oQ,EAAAje,EAAAie,GAAA2O,OAAA13Q,SAIA,GAAA,OAAA+oQ,EAIA,MAHA1tL,EAAA,IAAAupB,MAAA,iEAEA8tX,aAAAl8Y,EAAAk8Y,aACAr3Y,EAIA,IAAAo9Q,EAAAjiR,EAAAiiR,gBAAA7rG,EAAA4mO,kBAAAh9Y,GACAiuJ,EAAAsoB,EAAAC,MAAAyrG,GACA1vF,EAAAtnG,OAAAgjE,EAAAyoB,YAGA,GAAA,OAAA6b,EAAA,CACA,IAAA33J,EAEA,OAAA56B,EAAAk8Y,cACA,KAAAn0N,EAAAq1N,sBACAxiX,OAAA5vG,EACA,MACA,KAAA+8P,EAAA,cACA,IAAAp/I,EAAAukP,EAaAroR,EATA,QAAA75E,KADA29G,EAAAo/I,EAAA/nL,EAAAq9Y,oBAAAnwH,IAAAvkP,KAAAqwW,qBACAhud,IAAAspP,EAAAie,GAAA5pJ,GAIA,MAHA9jC,EAAA,IAAAupB,MAAA,mCACA+2J,IAAAnlL,EAAAq9Y,oBAAAnwH,IAAAvkP,KAAAqwW,aACAn0Y,EAAA18E,KAAAwgH,EACA9jC,EAIA,QAAA75E,KADAkiW,EAAAnlG,EAAA/nL,EAAAq9Y,oBAAAnwH,IAAA8rH,qBACAhud,IAAAspP,EAAA44G,IAAAA,GAIA,MAHAroR,EAAA,IAAAupB,MAAA,8BACA+2J,IAAAnlL,EAAAq9Y,oBAAAnwH,IAAA8rH,aACAn0Y,EAAA18E,KAAA+kW,EACAroR,EAOA,GAJAqoR,EAAA54G,EAAA44G,IAAAA,GAAA1jW,OAAA8qP,EAAAie,GAAA5pJ,GAAAn/G,eAIAwB,KADA29G,EAAAo/I,EAAA/nL,EAAAq9Y,oBAAA10W,KAAAqwW,qBACAhud,IAAAspP,EAAAie,GAAA5pJ,GACA,KAAA,CACA15B,QAAA,wCACAk2K,IAAAnlL,EAAAq9Y,oBAAA10W,KAAAqwW,aACA7wd,KAAAwgH,GAIA/N,EAAA05I,EAAAgpO,IAAA9zd,OAAA8qP,EAAAie,GAAA5pJ,GAAAn/G,SAAA0jW,EACAltR,EAAAq9Y,oBAAAzoM,YAKAluB,EAAA4vN,EAAAtuM,UAAAiD,OACA1Y,EAAA/jC,SAAAkoB,WAAA12K,EAAAuc,UAAAqe,GAGA,OAAA8rJ,GAYA4vN,EAAAiH,SAAA,SAAAxhZ,GACA,IAAA2qL,GAAA,EAEAjqL,EAAA65Y,EAAApD,OACA1hY,EAAAzV,EAAA0gZ,QAGA,GAAAhgZ,EAAAksC,MAAAn3B,EAAAm3B,KACA+9I,EAAAjqL,EAAAksC,OAAAn3B,EAAAm3B,UACA,GAAAlsC,EAAA24D,WAAA76D,SAAAiX,EAAA4jD,WAAA76D,OAAA,CAGA,IAAAijZ,EAAAC,EADA/2N,GAAA,EAEA,IAAA,IAAAn9P,EAAA,EAAAm9P,GAAAn9P,EAAAkzE,EAAA24D,WAAA76D,SAAAhxE,EACAi0d,EAAA/gZ,EAAA24D,WAAA7rI,GACAk0d,EAAAjsY,EAAA4jD,WAAA7rI,GACAi0d,EAAAphZ,OAAAqhZ,EAAArhZ,MAAAohZ,EAAAx0d,QAAAy0d,EAAAz0d,QAEA09P,GAAA,GAKA,OAAAA,GAYA4vN,EAAA2G,OAAA,SAAAj9Y,GACA,OAAAA,EAAAu9Y,SAAAjH,IAQAA,EAAAyE,6BAAA,WAgBA,OAAA3kO,EAAAwlO,wBAAAtF,EAAAtuM,UAAA,CAAA5rM,KAAA,kBAUAk6Y,EAAAoH,2BAAA,WAEA,IADA,IAAAv4N,EAAA4C,EAAA,qBACAtrL,EAAA,EAAAA,EAAA65Y,EAAAsC,WAAAr+Y,SAAAkC,EAAA,CACA,IAAAgzO,EAAA6mK,EAAAsC,WAAAn8Y,GACA,GAAAgzO,EAAAl2N,KAAA4rK,EAAA,CACA,IAAA21N,EAAAxE,EAAAyE,+BAAArkO,WACA,OAAApC,EAAAp/I,KAAAw2J,WAAA+jD,EAAAurK,wBAAAF,GAGA,OAAA,GAGAxE,GAgBAlgO,EAAA8/N,oBAAA,SAAA/hX,EAAAqnX,GAEA,IAAAl0N,EAAA,GACAj/H,EAAA,GACA,IAAAkuH,EAAAhlB,SAAAp9H,EAAA+jX,EAAA5wN,EAAAj/H,GAIA,MAHAxjD,EAAA,IAAAupB,MAAA,8EAEAi6B,OAAAA,EACAxjD,EAKA,GADA0xK,EAAA8O,SAAAiC,EAAAykB,gBACA31B,EAAA2R,KAAAqjB,cACA,MAAA,IAAAh9K,MAAA,2CAIA,IAAAkoX,EAAAlgO,EAAA6lO,oBACA3F,EAAAt9W,QAAAsuJ,EAAAq2N,YACAr2N,EAAAq2N,YAAApwY,WAAA,GAAA,EACA,IAAAqmY,EAAAt/N,EAAAp/I,KAAAyvJ,aAAA2C,EAAAs2N,kBACAtH,EAAA3C,aAAAC,EAAAlpN,QACA4rN,EAAA4F,aAAA5nO,EAAAiC,KAAA8O,SAAAiC,EAAAu2N,kBACAvH,EAAA+G,oBAAAvE,EACAxC,EAAA4F,aAAA50N,EAAAw2N,qBAAA,GACAxH,EAAA6F,QAAAnD,aAAA1kO,EAAAiC,KAAA8O,SAAAiC,EAAAy2N,sBACAzH,EAAA6F,QAAA/rU,WAAA0oU,EAAAxC,EAAA6F,QAAAnD,aACA1xN,EAAA02N,yBAAA,GACA1H,EAAA/5X,UAAA+qK,EAAA22N,cAEA,IAAAv2F,EAAA,GAeA,QAdA18X,IAAAs8P,EAAA42N,sBACAx2F,EAAAtnT,KAAAm2K,EAAA+O,cAAAgC,EAAA42N,4BAEAlzd,IAAAs8P,EAAA62N,8BACAz2F,EAAAtnT,KAAAm2K,EAAA2P,sBACAoB,EAAA62N,oCAEAnzd,IAAAs8P,EAAA82N,sBACA12F,EAAAtnT,KAAAm2K,EAAA+O,cAAAgC,EAAA82N,4BAEApzd,IAAAs8P,EAAA+2N,8BACA32F,EAAAtnT,KAAAm2K,EAAA2P,sBACAoB,EAAA+2N,+BAEA32F,EAAAntT,OAAA,EACA,MAAA,IAAA6zB,MAAA,wGAGA,GAAAs5R,EAAAntT,OAAA,EACA,MAAA,IAAA6zB,MAAA,+GASA,GANAkoX,EAAA5uF,SAAA00F,UAAA10F,EAAA,GACA4uF,EAAA5uF,SAAA20F,SAAA30F,EAAA,GAGA4uF,EAAAr0H,eAAA36F,EAAA26F,eAEAu5H,EAAA,CAIA,IAuBA32Y,EAxBA,GADAyxY,EAAA/jN,GAAA,KACA+jN,EAAA4F,gBAAAn0N,EAEA,OADAA,EAAAuuN,EAAA4F,eAEA,IAAA,wBACA5F,EAAA/jN,GAAAje,EAAAie,GAAAh9B,KAAA/rO,SACA,MACA,IAAA,uBACA8sd,EAAA/jN,GAAAje,EAAAie,GAAA97B,IAAAjtO,SACA,MACA,IAAA,0BACA8sd,EAAA/jN,GAAAje,EAAAie,GAAA2O,OAAA13Q,SACA,MACA,IAAA,0BACA8sd,EAAA/jN,GAAAje,EAAAie,GAAAkkB,OAAAjtR,SACA,MACA,IAAA,0BACA8sd,EAAA/jN,GAAAje,EAAAie,GAAAK,OAAAppQ,SACA,MACA,IAAA,aACA8sd,EAAA/jN,GAAAje,EAAAie,GAAA2O,OAAA13Q,SAIA,GAAA,OAAA8sd,EAAA/jN,GAIA,MAHA1tL,EAAA,IAAAupB,MAAA,iEAEA8tX,aAAA5F,EAAA4F,aACAr3Y,EAIA,IAAAopJ,EAAAsoB,EAAAC,MAAA8/N,EAAAr0H,gBACAq0H,EAAA/jN,GAAAtnG,OAAAgjE,EAAAyoB,YAIA,IAAA4nO,EAAAhqO,EAAAie,GAAAh9B,KAAA/rO,SACA8sd,EAAApD,OAAAoJ,SAAA,SAAAC,GACA,OAAAjE,EAAAhC,EAAApD,OAAAqJ,IAEAjG,EAAApD,OAAAsJ,SAAA,SAAAtoY,GACAmlY,EAAA,CAAAnlY,IACAoiY,EAAApD,OAAA99U,WAAAh1D,KAAA8T,IAEAoiY,EAAApD,OAAA99U,WAAAghH,EAAAs9N,qBAAApsN,EAAAi3N,WAAAD,GACAh3N,EAAAk3N,qBACAlI,EAAApD,OAAAyJ,SAAAr1N,EAAAk3N,oBAEAlI,EAAApD,OAAAvqW,KAAA21W,EAAA9vP,SAAAk8B,QAGA,IAAA+zN,EAAAnqO,EAAAie,GAAAh9B,KAAA/rO,SAwBA,OAvBA8sd,EAAAmG,QAAAH,SAAA,SAAAC,GACA,OAAAjE,EAAAhC,EAAAmG,QAAAF,IAEAjG,EAAAmG,QAAAD,SAAA,SAAAtoY,GACAmlY,EAAA,CAAAnlY,IACAoiY,EAAAmG,QAAArnV,WAAAh1D,KAAA8T,IAEAoiY,EAAAmG,QAAArnV,WAAAghH,EAAAs9N,qBAAApsN,EAAAo3N,YAAAD,GACAn3N,EAAAq3N,sBACArI,EAAAmG,QAAAE,SAAAr1N,EAAAq3N,qBAEArI,EAAAmG,QAAA9zW,KAAA81W,EAAAjwP,SAAAk8B,QAGApD,EAAAs3N,eACAtI,EAAAsC,WAAAxiO,EAAAyoO,8BAAAv3N,EAAAs3N,gBAEAtI,EAAAsC,WAAA,GAIAtC,EAAAtuM,UAAA5xB,EAAA01B,kBAAAxkB,EAAA46F,sBAEAo0H,GA0DAlgO,EAAAyoO,8BAAA,SAAA/B,GAEA,IADA,IAAAp2N,EAAA,GACAjqL,EAAA,EAAAA,EAAAqgZ,EAAA9zd,MAAAuxE,SAAAkC,EAGA,IADA,IAAAqiZ,EAAAhC,EAAA9zd,MAAAyzE,GACAk8L,EAAA,EAAAA,EAAAmmN,EAAA91d,MAAAuxE,SAAAo+L,EACAjS,EAAAtmL,KAAAg2K,EAAAyiO,6BAAAiG,EAAA91d,MAAA2vQ,KAIA,OAAAjS,GAUAtQ,EAAAyiO,6BAAA,SAAAppK,GAKA,IAAApmT,EAAA,GAUA,GATAA,EAAAkwF,GAAAg9J,EAAA8O,SAAAoqD,EAAAzmT,MAAA,GAAAA,OACAK,EAAA01d,UAAA,EACAtvK,EAAAzmT,MAAA,GAAAozE,OAAAm6K,EAAArB,KAAA4M,SACAz4P,EAAA01d,SAAA,IAAAtvK,EAAAzmT,MAAA,GAAAA,MAAAukF,WAAA,GACAlkF,EAAAL,MAAAymT,EAAAzmT,MAAA,GAAAA,OAEAK,EAAAL,MAAAymT,EAAAzmT,MAAA,GAAAA,MAGAK,EAAAkwF,MAAAwuK,EAIA,GAHA1+P,EAAAlB,KAAA4/P,EAAA1+P,EAAAkwF,IAGA,aAAAlwF,EAAAlB,KAAA,CAEA,IACAw7P,EAAA,EACAy6B,EAAA,GAFA/8D,EAAAk1B,EAAAmO,QAAAr7P,EAAAL,QAGAA,MAAAuxE,OAAA,IAIAopL,EAAAtiC,EAAAr4N,MAAAukF,WAAA,GACA6wM,EAAA/8D,EAAAr4N,MAAAuxE,OAAA,EAAA8mJ,EAAAr4N,MAAAukF,WAAA,GAAA,GAGAlkF,EAAAqwd,iBAAA,MAAA,IAAA/1N,GACAt6P,EAAAswd,eAAA,KAAA,GAAAh2N,GACAt6P,EAAAuwd,gBAAA,KAAA,GAAAj2N,GACAt6P,EAAAwwd,iBAAA,KAAA,GAAAl2N,GACAt6P,EAAAywd,aAAA,IAAA,EAAAn2N,GACAt6P,EAAA0wd,YAAA,IAAA,EAAAp2N,GACAt6P,EAAA2wd,QAAA,IAAA,EAAAr2N,GACAt6P,EAAA4wd,aAAA,IAAA,EAAAt2N,GACAt6P,EAAA6wd,aAAA,MAAA,IAAA97L,QACA,GAAA,qBAAA/0R,EAAAlB,KAAA,EAGAk5N,EAAAk1B,EAAAmO,QAAAr7P,EAAAL,QAEAA,MAAAuxE,OAAA,GAAA8mJ,EAAAr4N,MAAA,GAAAozE,OAAAm6K,EAAArB,KAAA4M,QACAz4P,EAAA8wd,GAAA,IAAA94P,EAAAr4N,MAAA,GAAAA,MAAAukF,WAAA,GAEAlkF,EAAA8wd,IAAA,EAGA,IAAAnxd,EAAA,KACAq4N,EAAAr4N,MAAAuxE,OAAA,GAAA8mJ,EAAAr4N,MAAA,GAAAozE,OAAAm6K,EAAArB,KAAA6M,QACA/4P,EAAAq4N,EAAAr4N,MAAA,GAAAA,MACAq4N,EAAAr4N,MAAAuxE,OAAA,IACAvxE,EAAAq4N,EAAAr4N,MAAA,GAAAA,OAEA,OAAAA,IACAK,EAAA+wd,kBAAA7jO,EAAA6Q,aAAAp+P,SAEA,GAAA,gBAAAK,EAAAlB,KAIA,IADA,IAAAk5N,EAAAk1B,EAAAmO,QAAAr7P,EAAAL,OACAy3Q,EAAA,EAAAA,EAAAp/C,EAAAr4N,MAAAuxE,SAAAkmM,EAAA,CACA,IAAAtb,EAAA5O,EAAA8O,SAAAhkC,EAAAr4N,MAAAy3Q,GAAAz3Q,OACAm8P,KAAA4C,EACA1+P,EAAA0+P,EAAA5C,KAAA,EAEA97P,EAAA87P,IAAA,OAGA,GAAA,eAAA97P,EAAAlB,KAAA,CAIAw7P,EAAA,GADAtiC,EAAAk1B,EAAAmO,QAAAr7P,EAAAL,QAEAA,MAAAuxE,OAAA,IAIAopL,EAAAtiC,EAAAr4N,MAAAukF,WAAA,IAGAlkF,EAAAgxd,OAAA,MAAA,IAAA12N,GACAt6P,EAAAquZ,OAAA,KAAA,GAAA/zJ,GACAt6P,EAAAixd,MAAA,KAAA,GAAA32N,GACAt6P,EAAAkxd,QAAA,KAAA,GAAA52N,GACAt6P,EAAAmxd,SAAA,IAAA,EAAA72N,GACAt6P,EAAAoxd,MAAA,IAAA,EAAA92N,GACAt6P,EAAAqxd,QAAA,IAAA,EAAA/2N,GACAt6P,EAAAsxd,MAAA,IAAA,EAAAh3N,QACA,GACA,mBAAAt6P,EAAAlB,MACA,kBAAAkB,EAAAlB,KAAA,CAKA,IAAA62d,EAHA31d,EAAAuxd,SAAA,GAIAv5P,EAAAk1B,EAAAmO,QAAAr7P,EAAAL,OACA,IADA,IACAO,EAAA,EAAAA,EAAA83N,EAAAr4N,MAAAuxE,SAAAhxE,EAAA,CAIA,IAAAsxd,EAAA,CACAz+Y,MAHA4iZ,EAAA39P,EAAAr4N,MAAAO,IAGA6yE,KACApzE,MAAAg2d,EAAAh2d,OAKA,OAHAK,EAAAuxd,SAAAx6Y,KAAAy6Y,GAGAmE,EAAA5iZ,MAEA,KAAA,EAEA,KAAA,EAEA,KAAA,EACA,MAEA,KAAA,EAEAy+Y,EAAAhrN,GAAAvb,EAAAp/I,KAAAg7J,UAAA8uN,EAAAh2d,OACA,MAEA,KAAA,EACA6xd,EAAA11N,IAAA5O,EAAA8O,SAAA25N,EAAAh2d,cAMA,GAAA,yBAAAK,EAAAlB,KAAA,CAGAk5N,EAAAk1B,EAAAmO,QAAAr7P,EAAAL,OACAK,EAAA2xd,qBAAA1mO,EAAAp/I,KAAA8yJ,WAAA3mC,EAAAr4N,OAGA,OAAAK,GAgBA+sP,EAAA0lO,6BAAA,SAAA3nX,EAAAqnX,GAEA,IAAAl0N,EAAA,GACAj/H,EAAA,GACA,IAAAkuH,EAAAhlB,SAAAp9H,EAAAkkX,EAAA/wN,EAAAj/H,GAIA,MAHAxjD,EAAA,IAAAupB,MAAA,iGAEAi6B,OAAAA,EACAxjD,EAKA,GADA0xK,EAAA8O,SAAAiC,EAAAykB,gBACA31B,EAAA2R,KAAAqjB,cACA,MAAA,IAAAh9K,MAAA,2CAIA,IAAAmtX,EAAAnlO,EAAA6oO,6BAaA,GAZA1D,EAAAviX,QAAAsuJ,EAAA43N,WAAA53N,EAAA43N,WAAA3xY,WAAA,GAAA,EACAguY,EAAAW,aAAA5nO,EAAAiC,KAAA8O,SAAAiC,EAAA63N,iBACA5D,EAAA8B,oBAAAvE,EACAyC,EAAAW,aAAA50N,EAAA83N,oBAAA,GACA7D,EAAAY,QAAAnD,aAAA1kO,EAAAiC,KAAA8O,SAAAiC,EAAA63N,iBACA5D,EAAAY,QAAA/rU,WAAA0oU,EACAyC,EAAAY,QAAAnD,aAAA1xN,EAAA83N,oBAAA,GACA7D,EAAAh/X,UAAA+qK,EAAA+3N,aAGA9D,EAAA+D,yBAAAh4N,EAAAg4N,yBAEA9D,EAAA,CAIA,IAuBA32Y,EAxBA,GADA02Y,EAAAhpN,GAAA,KACAgpN,EAAAW,gBAAAn0N,EAEA,OADAA,EAAAwzN,EAAAW,eAEA,IAAA,wBACAX,EAAAhpN,GAAAje,EAAAie,GAAAh9B,KAAA/rO,SACA,MACA,IAAA,uBACA+xd,EAAAhpN,GAAAje,EAAAie,GAAA97B,IAAAjtO,SACA,MACA,IAAA,0BACA+xd,EAAAhpN,GAAAje,EAAAie,GAAA2O,OAAA13Q,SACA,MACA,IAAA,0BACA+xd,EAAAhpN,GAAAje,EAAAie,GAAAkkB,OAAAjtR,SACA,MACA,IAAA,0BACA+xd,EAAAhpN,GAAAje,EAAAie,GAAAK,OAAAppQ,SACA,MACA,IAAA,aACA+xd,EAAAhpN,GAAAje,EAAAie,GAAA2O,OAAA13Q,SAIA,GAAA,OAAA+xd,EAAAhpN,GAIA,MAHA1tL,EAAA,IAAAupB,MAAA,2EAEA8tX,aAAAX,EAAAW,aACAr3Y,EAIA,IAAAopJ,EAAAsoB,EAAAC,MAAA+kO,EAAA+D,0BACA/D,EAAAhpN,GAAAtnG,OAAAgjE,EAAAyoB,YAIA,IAAA+nO,EAAAnqO,EAAAie,GAAAh9B,KAAA/rO,SA0BA,OAzBA+xd,EAAAkB,QAAAH,SAAA,SAAAC,GACA,OAAAjE,EAAAiD,EAAAkB,QAAAF,IAEAhB,EAAAkB,QAAAD,SAAA,SAAAtoY,GACAmlY,EAAA,CAAAnlY,IACAqnY,EAAAkB,QAAArnV,WAAAh1D,KAAA8T,IAEAqnY,EAAAkB,QAAArnV,WAAAghH,EAAAs9N,qBACApsN,EAAAi4N,gCAAAd,GACAlD,EAAAkB,QAAA9zW,KAAA81W,EAAAjwP,SAAAk8B,QAGA6wN,EAAAvzM,UAAA5xB,EAAA01B,kBAAAxkB,EAAA46F,sBAGAq5H,EAAA/7Q,aAAA,SAAA+8Q,GACA,OAAAjE,EAAAiD,EAAAgB,IAEAhB,EAAAiE,aAAA,SAAAtrY,GACAmlY,EAAA,CAAAnlY,IACAqnY,EAAAnmV,WAAAh1D,KAAA8T,IAEAqnY,EAAAnmV,WAAAghH,EAAAsiO,qBACApxN,EAAAm4N,oCAAA,IAEAlE,GAUAnlO,EAAA6oO,2BAAA,WACA,IAAA1D,EAAA,CACAviX,QAAA,EACAkjX,aAAA,KACA3/X,UAAA,KACA4/X,QAAA,IAsLA,OArLAZ,EAAAY,QAAAnD,aAAA,KAEAuC,EAAAkB,QAAA,GACAlB,EAAAkB,QAAAH,SAAA,SAAAC,GACA,OAAAjE,EAAAiD,EAAAkB,QAAAF,IAEAhB,EAAAkB,QAAAD,SAAA,SAAAtoY,GACAmlY,EAAA,CAAAnlY,IACAqnY,EAAAkB,QAAArnV,WAAAh1D,KAAA8T,IAEAqnY,EAAAkB,QAAArnV,WAAA,GACAmmV,EAAAkB,QAAA9zW,KAAA,KAEA4yW,EAAAvzM,UAAA,KACAuzM,EAAAnmV,WAAA,GACAmmV,EAAA/7Q,aAAA,SAAA+8Q,GACA,OAAAjE,EAAAiD,EAAAgB,IAEAhB,EAAAiE,aAAA,SAAAtrY,GACAmlY,EAAA,CAAAnlY,IACAqnY,EAAAnmV,WAAAh1D,KAAA8T,IAEAqnY,EAAAhpN,GAAA,KAOAgpN,EAAAmB,WAAA,SAAAxmT,GAEAmjT,EAAAnjT,GACAqlT,EAAAkB,QAAArnV,WAAA8gC,EACAqlT,EAAAkB,QAAA9zW,KAAA,MAQA4yW,EAAAmE,cAAA,SAAAxpT,GAEAmjT,EAAAnjT,GACAqlT,EAAAnmV,WAAA8gC,GASAqlT,EAAA39N,KAAA,SAAAtzP,EAAAioQ,GAEAgpN,EAAAhpN,GAAAA,GAAAje,EAAAie,GAAAh9B,KAAA/rO,SACA,IAAAwvd,EAAAjxN,EAAAwzN,EAAAhpN,GAAAM,UAAA,qBACA,IAAAmmN,EAAA,CACA,IAAAn0Y,EAAA,IAAAupB,MAAA,yFAGA,MADAvpB,EAAAguL,UAAA0oN,EAAAhpN,GAAAM,UACAhuL,EAEA02Y,EAAAW,aAAAX,EAAAY,QAAAnD,aAAAA,EAGAuC,EAAA+D,yBAAAlpO,EAAAupO,4BAAApE,GACA,IAAAttP,EAAAsoB,EAAAC,MAAA+kO,EAAA+D,0BAGA/D,EAAAhpN,GAAAtnG,OAAAgjE,EAAAyoB,YACA6kO,EAAAh/X,UAAAjyF,EAAAszP,KAAA29N,EAAAhpN,KAcAgpN,EAAAtwM,OAAA,WACA,IAAAvkB,GAAA,EAEA6L,EAAAgpN,EAAAhpN,GACA,GAAA,OAAAA,EAAA,CAEA,GAAAgpN,EAAAW,gBAAAn0N,EAGA,OADAA,EAAAwzN,EAAAW,eAEA,IAAA,wBACA3pN,EAAAje,EAAAie,GAAAh9B,KAAA/rO,SACA,MACA,IAAA,uBACA+oQ,EAAAje,EAAAie,GAAA97B,IAAAjtO,SACA,MACA,IAAA,0BACA+oQ,EAAAje,EAAAie,GAAA2O,OAAA13Q,SACA,MACA,IAAA,0BACA+oQ,EAAAje,EAAAie,GAAAkkB,OAAAjtR,SACA,MACA,IAAA,0BACA+oQ,EAAAje,EAAAie,GAAAK,OAAAppQ,SACA,MACA,IAAA,aACA+oQ,EAAAje,EAAAie,GAAA2O,OAAA13Q,SAIA,GAAA,OAAA+oQ,EAKA,MAJA1tL,EAAA,IAAAupB,MACA,2EAEA8tX,aAAAX,EAAAW,aACAr3Y,EAIA,IAAA+6Y,EAAArE,EAAA+D,0BACAlpO,EAAAupO,4BAAApE,GACAttP,EAAAsoB,EAAAC,MAAAopO,GACArtN,EAAAtnG,OAAAgjE,EAAAyoB,YAGA,GAAA,OAAA6b,EAAA,CACA,IAAA33J,EAEA,OAAA2gX,EAAAW,cACA,KAAAn0N,EAAAq1N,sBAEA,MACA,KAAAr1N,EAAA,cACA,IAAAp/I,EAAAukP,EAwBAroR,EApBA,QAAA75E,KADA29G,EAAAo/I,EAAAwzN,EAAA8B,oBAAAnwH,IAAAvkP,KAAAqwW,qBACAhud,IAAAspP,EAAAie,GAAA5pJ,GAIA,MAHA9jC,EAAA,IAAAupB,MAAA,mCACA+2J,IAAAo2N,EAAA8B,oBAAAnwH,IAAAvkP,KAAAqwW,aACAn0Y,EAAA18E,KAAAwgH,EACA9jC,EAIA,QAAA75E,KADAkiW,EAAAnlG,EAAAwzN,EAAA8B,oBAAAnwH,IAAA8rH,qBACAhud,IAAAspP,EAAA44G,IAAAA,GAIA,MAHAroR,EAAA,IAAAupB,MAAA,8BACA+2J,IAAAo2N,EAAA8B,oBAAAnwH,IAAA8rH,aACAn0Y,EAAA18E,KAAA+kW,EACAroR,EAOA,GAJAqoR,EAAA54G,EAAA44G,IAAAA,GAAA1jW,OAAA8qP,EAAAie,GAAA5pJ,GAAAn/G,eAIAwB,KADA29G,EAAAo/I,EAAAwzN,EAAA8B,oBAAA10W,KAAAqwW,qBACAhud,IAAAspP,EAAAie,GAAA5pJ,GAIA,MAHA9jC,EAAA,IAAAupB,MAAA,0CACA+2J,IAAAo2N,EAAA8B,oBAAA10W,KAAAqwW,aACAn0Y,EAAA18E,KAAAwgH,EACA9jC,EAGA+1B,EAAA05I,EAAAgpO,IAAA9zd,OAAA8qP,EAAAie,GAAA5pJ,GAAAn/G,SAAA0jW,EACAquH,EAAA8B,oBAAAzoM,YAKAluB,EAAA60N,EAAAvzM,UAAAiD,OACA1Y,EAAA/jC,SAAAkoB,WAAA6kO,EAAAh/X,UAAAqe,GAGA,OAAA8rJ,GAGA60N,GAgiBA,IAAA5G,EAAA,IAAAthX,KAAA,wBACAuhX,EAAA,IAAAvhX,KAAA,wBAUA,SAAAwsX,EAAAr6N,GACA,OAAAA,GAAAmvN,GAAAnvN,EAAAovN,EACAr+N,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6N,SAAA,EACAxM,EAAAkQ,cAAAjB,IAEAjP,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA8N,iBAAA,EACAzM,EAAA0Q,sBAAAzB,IAWApP,EAAA4mO,kBAAA,SAAA1G,GAEA,IAAA8F,EAAAyD,EAAAvJ,EAAA5uF,SAAA00F,WACAC,EAAAwD,EAAAvJ,EAAA5uF,SAAA20F,UACAyD,EAAAvpO,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CAEApL,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAxL,EAAA2Q,aAAAovN,EAAAt9W,SAAA09I,cAGAH,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAzN,EAAAp/I,KAAAw2J,WAAA4qN,EAAA3C,eAEAp9N,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAoxN,EAAA6F,QAAAnD,cAAAtiO,YAEA2kO,EACA/E,EAAA6F,QAAAnD,aAAA1C,EAAA6F,QAAA/rU,cAGAgpU,EAAA9C,EAAApD,QAEA38N,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CACAy5N,EACAC,IAGAjD,EAAA9C,EAAAmG,SAEArmO,EAAA+1B,gBAAAmqM,EAAAtuM,aAiCA,OA9BAsuM,EAAApD,OAAAyJ,UAEAmD,EAAA92d,MAAAo3E,KACAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CACApL,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA8M,WAAA,EAEArmL,OAAA67C,aAAA,GACA8+V,EAAApD,OAAAyJ,aAKArG,EAAAmG,QAAAE,UAEAmD,EAAA92d,MAAAo3E,KACAm2K,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,CACApL,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA8M,WAAA,EAEArmL,OAAA67C,aAAA,GACA8+V,EAAAmG,QAAAE,aAMArG,EAAAsC,WAAAr+Y,OAAA,GAEAulZ,EAAA92d,MAAAo3E,KAAAg2K,EAAA2pO,4BAAAzJ,EAAAsC,aAGAkH,GAWA1pO,EAAAupO,4BAAA,SAAApE,GAcA,OAZAhlO,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA6M,SAAA,EACAxL,EAAA2Q,aAAAq0N,EAAAviX,SAAA09I,YAEA0iO,EAAAmC,EAAAkB,SAEArmO,EAAA+1B,gBAAAovM,EAAAvzM,WAEAszM,EAAAC,MAaAnlO,EAAA89N,wBAAA,SAAA8L,GACA,OAAA5G,EAAA4G,IAUA5pO,EAAA+/N,kBAAA,SAAAG,GAEA,IAAAr0H,EAAAq0H,EAAAr0H,gBAAA7rG,EAAA4mO,kBAAA1G,GAGA,OAAA//N,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEAs/F,EAEA1rG,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAoxN,EAAA4F,cAAAxlO,YAEA2kO,EAAA/E,EAAA4F,aAAA5F,EAAA+G,uBAGA9mO,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA8M,WAAA,EACArmL,OAAA67C,aAAA,GAAA8+V,EAAA/5X,cAWA65J,EAAA2pO,4BAAA,SAAAjD,GAEA,IAAAp2N,EAAAnQ,EAAA/sP,OAAA+sP,EAAAiL,MAAAG,iBAAA,GAAA,EAAA,IAGAqhG,EAAAzsG,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,IACA+D,EAAA19P,MAAAo3E,KAAA4iR,GAEA,IAAA,IAAAvmR,EAAA,EAAAA,EAAAqgZ,EAAAviZ,SAAAkC,EACAumR,EAAAh6V,MAAAo3E,KAAAg2K,EAAAojO,2BAAAsD,EAAArgZ,KAGA,OAAAiqL,GAUAtQ,EAAAojO,2BAAA,SAAA/pK,GAEA,IAAAqvK,EAAAvoO,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,IAGAm8N,EAAA91d,MAAAo3E,KAAAm2K,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAuqD,EAAAl2N,IAAAm9J,aAGA+4D,EAAAsvK,UAEAD,EAAA91d,MAAAo3E,KAAAm2K,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA4M,SAAA,EACAnmL,OAAA67C,aAAA,OAGA,IAAAxuH,EAAAymT,EAAAzmT,MAUA,MATA,iBAAAymT,EAAAzmT,QAEAA,EAAAutP,EAAAC,MAAAxtP,GAAA0tP,YAIAooO,EAAA91d,MAAAo3E,KAAAm2K,EAAA/sP,OACA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA+M,aAAA,EAAAj5P,IAEA81d,GAUA1oO,EAAA4lO,2BAAA,SAAAT,GAEA,IAAAqE,EAAArE,EAAA+D,0BACAlpO,EAAAupO,4BAAApE,GAGA,OAAAhlO,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEAi9N,EAEArpO,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAyN,UAAA,EAAA,CAEApM,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAAiN,KAAA,EACA5L,EAAA2O,SAAAq2N,EAAAW,cAAAxlO,YAEA2kO,EAAAE,EAAAW,aAAAX,EAAA8B,uBAGA9mO,EAAA/sP,OAAA+sP,EAAAiL,MAAAC,UAAAlL,EAAArB,KAAA8M,WAAA,EACArmL,OAAA67C,aAAA,GAAA+jW,EAAAh/X,cAYA65J,EAAA6pO,cAAA,SAAAhK,GAEA,IAAAiK,EAAA,CAEAjK,MAAA,IA4JA,SAAAkK,EAAA1D,GAEA,OADA2D,EAAA3D,GACAyD,EAAAjK,MAAAwG,EAAA9zW,OAAA,KAGA,SAAAy3W,EAAA3D,GAEA,IAAAA,EAAA9zW,KAAA,CACA,IAAA4pJ,EAAAje,EAAAie,GAAAh9B,KAAA/rO,SACAizd,EAAArnV,WAAAghH,EAAAs9N,qBAAA0F,EAAAqD,GAAAlqN,GACAkqN,EAAA9zW,KAAA4pJ,EAAA/jC,SAAAk8B,SAKA,GAhKAw1N,EAAAG,UAAA,SAAA/J,GAYA,OAXA6J,EAAA7J,EAAApD,SAoBAgN,EAAAlJ,eAAA,SAAAV,GAQA,GANA,iBAAAA,IACAA,EAAAhiO,EAAA8B,IAAAmgO,mBAAAD,IAGA8J,EAAA9J,EAAAmG,UAEAyD,EAAAI,eAAAhK,GACA,GAAAA,EAAAmG,QAAA9zW,QAAAu3W,EAAAjK,MAAA,CAEA,IAAAvlX,EAAAwvX,EAAAjK,MAAAK,EAAAmG,QAAA9zW,MACA2rI,EAAAp/I,KAAA9iB,QAAAse,KACAA,EAAA,CAAAA,IAEAA,EAAAtwB,KAAAk2Y,GACA4J,EAAAjK,MAAAK,EAAAmG,QAAA9zW,MAAAjY,OAEAwvX,EAAAjK,MAAAK,EAAAmG,QAAA9zW,MAAA2tW,GAaA4J,EAAAI,eAAA,SAAAhK,GAEA,iBAAAA,IACAA,EAAAhiO,EAAA8B,IAAAmgO,mBAAAD,IAGA,IAAA1jY,EAAAutY,EAAA7J,EAAAmG,SACA,IAAA7pY,EACA,OAAA,EAEA0hK,EAAAp/I,KAAA9iB,QAAAQ,KACAA,EAAA,CAAAA,IAIA,IADA,IAAA2tY,EAAAhqO,EAAAC,MAAAJ,EAAA+/N,kBAAAG,IAAA5/N,WACAj6K,EAAA,EAAAA,EAAAmW,EAAArY,SAAAkC,EAAA,CAEA,GAAA8jZ,IADAhqO,EAAAC,MAAAJ,EAAA+/N,kBAAAvjY,EAAAnW,KAAAi6K,WAEA,OAAA,EAGA,OAAA,GAQAwpO,EAAAM,oBAAA,WACA,IAAAC,EAAA,GAEA,IAAA,IAAA93W,KAAAu3W,EAAAjK,MACA,GAAAiK,EAAAjK,MAAAnmX,eAAA6Y,GAAA,CACA,IAAA3/G,EAAAk3d,EAAAjK,MAAAttW,GACA,GAAA2rI,EAAAp/I,KAAA9iB,QAAAppF,GAGA,IAAA,IAAAyzE,EAAA,EAAAA,EAAAzzE,EAAAuxE,SAAAkC,EACAgkZ,EAAArgZ,KAAAp3E,EAAAyzE,SAHAgkZ,EAAArgZ,KAAAp3E,GASA,OAAAy3d,GAYAP,EAAAQ,kBAAA,SAAApK,GACA,IAAAp2Y,EAOA,GAJA,iBAAAo2Y,IACAA,EAAAhiO,EAAA8B,IAAAmgO,mBAAAD,IAEA8J,EAAA9J,EAAAmG,UACAyD,EAAAI,eAAAhK,GACA,OAAA,KAGA,IAAA1jY,EAAAutY,EAAA7J,EAAAmG,SAEA,IAAAnoO,EAAAp/I,KAAA9iB,QAAAQ,GAGA,OAFA1S,EAAAggZ,EAAAjK,MAAAK,EAAAmG,QAAA9zW,aACAu3W,EAAAjK,MAAAK,EAAAmG,QAAA9zW,MACAzoC,EAKA,IADA,IAAAqgZ,EAAAhqO,EAAAC,MAAAJ,EAAA+/N,kBAAAG,IAAA5/N,WACAj6K,EAAA,EAAAA,EAAAmW,EAAArY,SAAAkC,EAAA,CAEA8jZ,IADAhqO,EAAAC,MAAAJ,EAAA+/N,kBAAAvjY,EAAAnW,KAAAi6K,aAEAx2K,EAAA0S,EAAAnW,GACAmW,EAAA7S,OAAAtD,EAAA,IAOA,OAJA,IAAAmW,EAAArY,eACA2lZ,EAAAjK,MAAAK,EAAAmG,QAAA9zW,MAGAzoC,GAkBA+1Y,EAEA,IAAA,IAAAx5Y,EAAA,EAAAA,EAAAw5Y,EAAA17Y,SAAAkC,EAAA,CACA,IAAA65Y,EAAAL,EAAAx5Y,GACAyjZ,EAAAlJ,eAAAV,GAIA,OAAA4J,GAMA9pO,EAAAuqO,iBAAA,CACAC,gBAAA,2BACAC,wBAAA,mCACAC,oBAAA,+BACAC,oBAAA,+BACAC,oBAAA,+BACAC,WAAA,yCAgCA7qO,EAAA8qO,uBAAA,SAAAhB,EAAApqV,EAAA7rI,GAqIA,mBAAAA,IACAA,EAAA,CAAAghR,OAAAhhR,IAEAA,EAAAA,GAAA,GAKA,IAAAgsd,GADAngV,EAAAA,EAAAp7D,MAAA,IACAA,MAAA,GAEAymZ,EAAAl3d,EAAAk3d,uBAIA,IAAAA,IACAA,EAAA,IAAA9tX,MAKA,IAAAllB,GAAA,EACAtJ,EAAA,KACA0oI,EAAA,EACA,EAAA,CACA,IAAA+oQ,EAAAxgV,EAAA77B,QACAl+B,EAAA,KACAqlZ,GAAA,EAmBA,GAjBAD,IAEAA,EAAA7K,EAAA5uF,SAAA00F,WACA+E,EAAA7K,EAAA5uF,SAAA20F,YACAx3Y,EAAA,CACAoK,QAAA,+CACApK,MAAAuxK,EAAAuqO,iBAAAI,oBACA3E,UAAA9F,EAAA5uF,SAAA00F,UACAC,SAAA/F,EAAA5uF,SAAA20F,SAGAzhT,IAAAumT,IAMA,OAAAt8Y,EAAA,CAUA,GARA,QADA9I,EAAA+5D,EAAA,IAAAoqV,EAAAG,UAAA/J,KAGAA,EAAAiH,SAAAjH,KACA8K,GAAA,EACArlZ,EAAAu6Y,GAIAv6Y,EAAA,CASA,IAAA4jV,EAAA5jV,EACAu4K,EAAAp/I,KAAA9iB,QAAAutU,KACAA,EAAA,CAAAA,IAKA,IADA,IAAA0hE,GAAA,GACAA,GAAA1hE,EAAAplV,OAAA,GAAA,CACAwB,EAAA4jV,EAAA1lT,QACA,IACAonX,EAAAtlZ,EAAAkvM,OAAAqrM,GACA,MAAA/xN,KAKA88N,IACAx8Y,EAAA,CACAoK,QAAA,oCACApK,MAAAuxK,EAAAuqO,iBAAAC,kBAKA,OAAA/7Y,GAAA9I,IAAAqlZ,GACAlB,EAAAI,eAAAhK,KAEAzxY,EAAA,CACAoK,QAAA,8BACApK,MAAAuxK,EAAAuqO,iBAAAM,aAqBA,GAbA,OAAAp8Y,GAAA9I,IAAAu6Y,EAAAiH,SAAAxhZ,KAEA8I,EAAA,CACAoK,QAAA,iCACApK,MAAAuxK,EAAAuqO,iBAAAC,kBASA,OAAA/7Y,EAMA,IAJA,IAAAy8Y,EAAA,CACAC,UAAA,EACAC,kBAAA,GAEA/kZ,EAAA,EAAA,OAAAoI,GAAApI,EAAA65Y,EAAAsC,WAAAr+Y,SAAAkC,EAAA,CACA,IAAAgzO,EAAA6mK,EAAAsC,WAAAn8Y,GACAgzO,EAAAsvK,YAAAtvK,EAAAtnT,QAAAm5d,KACAz8Y,EAAA,CACAoK,QACA,qDACApK,MAAAuxK,EAAAuqO,iBAAAE,0BAQA,GAAA,OAAAh8Y,KACAsJ,GAAA,IAAA2nD,EAAAv7D,UAAAwB,GAAAqlZ,IAAA,CAEA,IAAAK,EAAAnL,EAAAyG,aAAA,oBACA2E,EAAApL,EAAAyG,aAAA,YA8BA,GA7BA,OAAA2E,IAGAA,EAAA3H,aAAA,OAAA0H,IAEA58Y,EAAA,CACAoK,QACA,8MAKApK,MAAAuxK,EAAAuqO,iBAAAC,mBAKA,OAAA/7Y,GAAA,OAAA48Y,GAAAA,EAAAtH,KAEAt1Y,EAAA,CACAoK,QACA,sEAEApK,MAAAuxK,EAAAuqO,iBAAAC,kBAMA,OAAA/7Y,GAAA,OAAA68Y,GACA,sBAAAD,EAKAl0Q,EAAA,EACAk0Q,EAAArH,oBAEAv1Y,EAAA,CACAoK,QACA,2DACApK,MAAAuxK,EAAAuqO,iBAAAC,kBAOA,IAAAe,EAAA,OAAA98Y,GAAAA,EAAAA,MACA4c,EAAAx3F,EAAAghR,OAAAhhR,EAAAghR,OAAA02M,EAAAp0Q,EAAA0oQ,GAAA0L,EACA,IAAA,IAAAlgY,EA6BA,MAxBA,IAAAkgY,IACA98Y,EAAA,CACAoK,QAAA,4CACApK,MAAAuxK,EAAAuqO,iBAAAC,mBAKAn/X,GAAA,IAAAA,KAEA,iBAAAA,GAAA6yJ,EAAAp/I,KAAA9iB,QAAAqP,GAOA,iBAAAA,IAEA5c,EAAAA,MAAA4c,IARAA,EAAAxS,UACApK,EAAAoK,QAAAwS,EAAAxS,SAEAwS,EAAA5c,QACAA,EAAAA,MAAA4c,EAAA5c,SASAA,EA3BAA,EAAA,KA+BAsJ,GAAA,IACAo/H,QACAz3E,EAAAv7D,OAAA,GAEA,OAAA,oNC5vGA,IAAA+5K,EAAAzrP,EAAA,WACAA,EAAA,UAEAF,EAAAC,QAAA0rP,EAAA44G,IAAA54G,EAAA44G,KAAA,GACA54G,EAAA44G,IAAAr6E,KAAAv+B,EAAAu+B,qECFA,IAAAv+B,EAAAzrP,EAAA,WACAA,EAAA,UAEAyrP,EAAA44G,IAAA54G,EAAA44G,KAAA,IACAvkW,EAAAC,QAAA0rP,EAAA44G,IAAAr6E,KAAAv+B,EAAAu+B,KAAAv+B,EAAAu+B,MAAA,IASArpR,OAAA,SAAA+oQ,GAiCA,MAhCA,CAQAn3K,SAAA,SAAAy6J,EAAA+rO,GAMA,IAJA,IAAAvtU,EAAA,IAAAigG,EAAAp/I,KAAA8zJ,WAGAtwJ,EAAAx9B,KAAAwhL,KAAAklO,EAAArvN,EAAAiD,cACA/4L,EAAA,EAAAA,EAAAi8B,EAAAj8B,IAAA,CAEA,IAAAsF,EAAA,IAAAuyK,EAAAp/I,KAAA8zJ,WACAjnL,EAAA8nL,SAAAptL,GAIA81L,EAAAjoL,QACAioL,EAAAtnG,OAAA4qF,EAAA9zK,EAAA20K,YACAriG,EAAA0wG,UAAAwN,EAAA/jC,UAKA,OADAn6E,EAAAo2G,SAAAp2G,EAAA95E,SAAAqnZ,GACAvtU,EAAAqiG,8EC5CA,IAAApC,EAAAzrP,EAAA,WACAA,EAAA,YACAA,EAAA,WAGAF,EAAAC,QAAA0rP,EAAAgpO,IAAAhpO,EAAAgpO,KAAA,IAqBA9zd,OAAA,SAAAS,GAEA,IAAA0hF,UAAApR,SACAtwE,EAAA,CACAsoQ,GAAA5mL,UAAA,GACAuhR,IAAAvhR,UAAA,GACAipM,WAAAjpM,UAAA,KAIA,IAUAk2Y,EAVAl5W,EAAA1+G,EAAAsoQ,GACA26F,EAAAjjW,EAAAijW,IACAhuF,EAAAv2J,EAAA6sJ,aAEAssN,EAAA73d,EAAAkpQ,MAAA,KAOA,GANA,iBAAA2uN,IAEAA,EAAAxtO,EAAAp/I,KAAAyvJ,aAAAm9N,IAIA,eAAA73d,EACA43d,EAAA53d,EAAA2qR,eACA,CAAA,GAAA,OAAAktM,EAGA,MAAA,IAAA1zX,MAAA,yDAFAyzX,EAAAC,EAAAvnZ,SAKA,GAAA,OAAAunZ,GAAAA,EAAAvnZ,WAAAsnZ,EACA,MAAA,IAAAzzX,MAAA,0DAGA,IAAA0yK,EAAA72Q,EAAA62Q,MAAAxsB,EAAA5wI,OAEAq+W,EAAA,CAaAnpX,OAAA,SAAA25J,EAAAyvN,GACA,IAAAvlZ,EAcA02L,EAbA8uN,EAAAD,EAAA,EACAE,EAAAhnZ,KAAAwhL,KAAAulO,EAAA,GAGAE,EAAA5vN,EAAA/jC,SAAAkoB,WAGA,GAAAwrO,EAAAhjN,EAAA2iN,EAAA,EACA,MAAA,IAAAzzX,MAAA,mCAOA+kK,EADA,OAAA2uN,EACAhhN,EAAA1N,aAAAyuN,GAEAC,EAAA7zP,QAIA,IAAAm0P,EAAA,IAAA9tO,EAAAp/I,KAAA8zJ,WACAo5N,EAAA34N,aAAA,EAAA,GACA24N,EAAAv9N,SAAAs9N,GACAC,EAAAv9N,SAAAsO,GAGAxqJ,EAAAr+B,QACAq+B,EAAAsiD,OAAAm3T,EAAA1rO,YACA,IAAA35E,EAAAp0D,EAAA6lH,SAAAkoB,WAIA62G,EAAA,IAAAj5G,EAAAp/I,KAAA8zJ,WACAukG,EAAA9jG,aAAA,EAAAy4N,EAAAL,EAAA3iN,EAAA,GAIAquF,EAAAzoG,QAAA,GACAyoG,EAAA1oG,SAAAsO,GACA,IAAAsgB,EAAA85E,EAAA72G,WAGAkrO,EAAAM,EAAAhjN,EAAA,EACAkU,EAAA85E,EAAA9xQ,SAAA2hF,EAAA6kT,GAGAvuM,EAAA,GACA,IAAA52M,EAAA,EAAAA,EAAAmlZ,EAAAnlZ,IACA42M,GAAA13M,OAAA67C,aAAAi8J,EAAAlmM,WAAA9Q,GAAA22M,EAAA7lM,WAAA9Q,IAKA,IAAA63J,EAAA,OAAA,EAAA4tP,EAAAD,EAAA,IAMA,OALA5uM,EAAA13M,OAAA67C,aAAA67J,EAAA9lM,WAAA,IAAA+mJ,GACA++C,EAAAl4M,OAAA,IAIA4hG,EAAAphG,OAAA67C,aAAA,MAgBAyzJ,OAAA,SAAAk3M,EAAA/6M,EAAA46M,GACA,IAAAvlZ,EACAwlZ,EAAAD,EAAA,EACAE,EAAAhnZ,KAAAwhL,KAAAulO,EAAA,GAQA,GAHA76M,EAAAA,EAAAjsM,QAAA+mZ,GAGAA,EAAAhjN,EAAA2iN,EAAA,EACA,MAAA,IAAAzzX,MAAA,0DAKA,GAAA,MAAAg5K,EAAA75L,WAAA20Y,EAAA,GACA,MAAA,IAAA9zX,MAAA,yCAKA,IAAAwzX,EAAAM,EAAAhjN,EAAA,EACAmU,EAAAjM,EAAAjsM,OAAA,EAAAymZ,GACA7kT,EAAAqqG,EAAAjsM,OAAAymZ,EAAA1iN,GAIA5qC,EAAA,OAAA,EAAA4tP,EAAAD,EAAA,IACA,GAAA,IAAA5uM,EAAA9lM,WAAA,GAAA+mJ,GACA,MAAA,IAAAlmI,MAAA,6CAIA,IAAAglL,EAAA85E,EAAA9xQ,SAAA2hF,EAAA6kT,GAGAnuM,EAAA,GACA,IAAAh3M,EAAA,EAAAA,EAAAmlZ,EAAAnlZ,IACAg3M,GAAA93M,OAAA67C,aAAA67J,EAAA9lM,WAAA9Q,GAAA22M,EAAA7lM,WAAA9Q,IAKAg3M,EAAA93M,OAAA67C,aAAAi8J,EAAAlmM,WAAA,IAAA+mJ,GAAAm/C,EAAAt4M,OAAA,GAMA,IAAAknZ,EAAAH,EAAAhjN,EAAA2iN,EAAA,EACA,IAAAplZ,EAAA,EAAAA,EAAA4lZ,EAAA5lZ,IACA,GAAA,IAAAg3M,EAAAlmM,WAAA9Q,GACA,MAAA,IAAA2xB,MAAA,wCAIA,GAAA,IAAAqlL,EAAAlmM,WAAA80Y,GACA,MAAA,IAAAj0X,MAAA,qDAIA,IAAA+kK,EAAAsgB,EAAAt4M,QAAA0mZ,GAGAO,EAAA,IAAA9tO,EAAAp/I,KAAA8zJ,WAWA,OAVAo5N,EAAA34N,aAAA,EAAA,GACA24N,EAAAv9N,SAAAs9N,GACAC,EAAAv9N,SAAAsO,GAGAxqJ,EAAAr+B,QACAq+B,EAAAsiD,OAAAm3T,EAAA1rO,YAIA35E,IAHAp0D,EAAA6lH,SAAAkoB,aAMA,OAAAqrO,sFC9OA,aAEAl5d,EAAA,uBACA,MACAutP,EADAvtP,EAAA,wBACAutP,IAmFAztP,EAAAC,QAAA,CACA2pd,kBAvEA,CAAAjod,EAAAw9Q,KACA,MAAAE,EAAA5xB,EAAAo0B,gBAAA1C,EAAAv+Q,EAAAu+Q,EAAAz+Q,GACAitd,EAAAlgO,EAAA6lO,oBACA3F,EAAAtuM,UAAAA,EACAsuM,EAAA3C,aAAA,KACA2C,EAAA5uF,SAAA00F,UAAA,IAAA/oX,KACAijX,EAAA5uF,SAAA20F,SAAA,IAAAhpX,KACAijX,EAAA5uF,SAAA20F,SAAA91N,YAAA+vN,EAAA5uF,SAAA00F,UAAAkG,cAAA,IACA,MAAApsT,EAAA,CAAA,CACA/tK,KAAA,mBACAa,MAAA,QACA,CACAmqd,UAAA,KACAnqd,MAAA,YACA,CACAb,KAAA,aACAa,MAAAsB,EAAAivF,KAkCA,OAhCA+8X,EAAAoG,WAAAxmT,GACAogT,EAAAsG,UAAA1mT,GACAogT,EAAAuG,cAAA,CAAA,CACA10d,KAAA,mBACAgyd,IAAA,GACA,CACAhyd,KAAA,WACA4xd,aAAA,EACAL,kBAAA,EACAC,gBAAA,EACAC,iBAAA,EACAC,kBAAA,GACA,CACA1xd,KAAA,cACAo6d,YAAA,EACAC,YAAA,EACAC,aAAA,EACAC,iBAAA,EACAC,cAAA,GACA,CACAx6d,KAAA,aACAkyd,QAAA,EACA3iE,QAAA,EACA4iE,OAAA,EACAC,SAAA,EACAE,OAAA,EACAC,SAAA,EACAC,OAAA,KAGArE,EAAA14N,KAAAkqB,GAEAwuM,GAsBA9D,UATA5pU,eAAA4hF,EAAAo4P,GACA,MAAArwD,EAAA/nM,EAAA9qJ,IAAAkjZ,GAGA,OAAAp4P,SAFAnvD,QAAA2gD,IAAAu2M,IACApgU,WAAAjyB,GAAAA,iGCnFA,aAEA,MAAA2/G,EAAAh3L,EAAA,kBACAk1U,KAAAA,GAAAl1U,EAAA,YACAo2Y,IAAAA,GAAAp2Y,EAAA,uBACAg6d,EAAAh6d,EAAA,gBACAk2c,QAAAxhT,GAAA10J,EAAA,gBACAi6d,EAAAj6d,EAAA,WAEAk6d,EAAA,CACA,eACA,YAGAC,EAAA,CACAC,GAAA,eACA5sV,IAAA,YAmBA,MAAAigU,EAKAnqc,YAAAlC,GACAqrG,KAAA2hE,SAAA4oB,EAAAtiC,EAAAtzJ,GACAqrG,KAAA4tX,aAAA,IAAAJ,EAAAC,EAAAztX,KAAA2hE,UACA3hE,KAAA6tX,WAAA,IAAA7qY,IACAgd,KAAA8tX,eAAA,IAAA9qY,IACAgd,KAAA+tX,UAAAR,EAAAvtX,KAAA2hE,SAAAkoS,sBACA7pW,KAAAguX,UAAA,EACAhuX,KAAAu9R,WAAAv9R,KAAAu9R,WAAA5kS,KAAAqH,MACAA,KAAAy2V,mBAAA9hc,EAAAypb,kBACAp+U,KAAAy2V,mBAAAzoX,GAAA,mBAAAi8W,IACAjqV,KAAAiuX,mBAAAhkC,EAAAC,eAQArzb,QACAmpG,KAAAguX,UAAA,EAOAn3d,OACAmpG,KAAAguX,UAAA,EACAhuX,KAAA4tX,aAAArtV,OACA,IAAA,MAAAg7L,KAAAv7N,KAAA6tX,WAAAzwX,SACAm+N,EAAAh7L,OAEA,IAAA,MAAAg7L,KAAAv7N,KAAA8tX,eAAA1wX,SACAm+N,EAAAh7L,OASA/gC,aACA,OAAAQ,KAAA4tX,aAQAnrF,YACA,OAAA5kS,MAAA4rD,KAAAzpD,KAAA6tX,WAAA15d,QAUA0C,QAAA6kO,GACA,MAAAwyP,EAAAxyP,EAAA7C,cACA,OAAA74H,KAAA6tX,WAAArsY,IAAA0sY,IAAAluX,KAAA+tX,UAAAvsY,IAAA0sY,GAQArxK,gBACA,OAAAh/M,MAAA4rD,KAAAzpD,KAAA8tX,eAAA35d,QASA0C,YAAA00M,GACA,OAAAvrG,KAAA8tX,eAAAtsY,IAAA+pH,GAUA10M,mBAAA6kO,GACA,MAAAwyP,EAAAxyP,EAAA7C,cACA69N,EAAA12V,KAAA6tX,WAAArsY,IAAA0sY,GACAx3B,IACAA,EAAAn2T,OACAvgC,KAAA6tX,WAAApqY,OAAAyqY,GACAluX,KAAA+tX,UAAAtsY,IAAAysY,EAAAx3B,IAiBA7/b,YAAAqzb,WAAAA,EAAA3+O,SAAAA,EAAAwB,UAAAA,EAAA+hP,WAAAA,IACA,IAAA9uV,KAAAguX,SAAA,OAEA,MAAAh5d,EAAA04d,EAAA3gR,GAEA,IAAA2pP,EAAA12V,KAAA+5U,QAAAmQ,GAWA,GAVAwM,IACAA,EAAA,IAAA82B,EAAAC,EAAAztX,KAAA2hE,UACA3hE,KAAA6tX,WAAApsY,IAAAyoW,EAAArxN,cAAA69N,IAIAA,EAAA5rX,KAAA91E,EAAA85b,GACA9uV,KAAA4tX,aAAA9iZ,KAAA91E,EAAA85b,GAGAvjP,EAAA,CACA,IAAA4iR,EAAAnuX,KAAAg6U,YAAAzuO,GACA4iR,IACAA,EAAA,IAAAX,EAAAC,EAAAztX,KAAA2hE,UACA3hE,KAAA8tX,eAAArsY,IAAA8pH,EAAA4iR,IAEAA,EAAArjZ,KAAA91E,EAAA85b,IAaAj4b,kBAAAkkI,EAAA2gG,GACA,IAAA17H,KAAAguX,SAAA,OACA,MAAAI,EAAApuX,KAAA+5U,QAAAh/S,GACAszV,EAAA3yP,EAAA7C,cACAy1P,EAAAtuX,KAAA+5U,QAAAr+M,GACA,IAAA6yP,EAAAH,EAGAE,IAEAC,EAAAvtB,EAAAwtB,WAAAF,EAAAC,GAEAvuX,KAAA+tX,UAAAtqY,OAAA4qY,IAGAruX,KAAA6tX,WAAApqY,OAAAs3C,EAAA89F,eACA74H,KAAA6tX,WAAApsY,IAAA4sY,EAAAE,GACAA,EAAAv5Y,QAgBAn+E,aAAA25N,OAAAA,EAAA05N,WAAAA,EAAA3+O,SAAAA,IACA,MAAAsuO,EAAA75U,KACAyuX,EAAAj+P,EAAAz7I,OACAy7I,EAAAz7I,OAAA40T,GAAAl6R,GAAAoqU,EAAAt8C,WAAA,CACA2sD,WAAAA,EACA3+O,SAAAA,EACAwB,UAAA,KACA+hP,WAAAr/U,EAAAxqC,UAJA0kU,CAKA8kF,GAEA,MAAAC,EAAAl+P,EAAA25K,KAcA,OAbA35K,EAAA25K,KAAAp1T,GACA0zP,EACA1zP,EACA40T,GAAAl6R,GAAAoqU,EAAAt8C,WAAA,CACA2sD,WAAAA,EACA3+O,SAAAA,EACAwB,UAAA,MACA+hP,WAAAr/U,EAAAxqC,WAEAypZ,GAIAl+P,EAWA35N,kBAAAu0K,EAAA4rE,GAQA,OAPA5rE,EAAA7qC,OACAy2G,EAAAz2G,OAGA6qC,EAAAy6L,OAAA,IAAAz6L,EAAAy6L,UAAA7uH,EAAA6uH,QAGAz6L,GAIA/3K,EAAAC,QAAA0tc,sKChRA,aAEA,MAAA2tB,EAAAp7d,EAAA,WAQAF,EAAAC,QAAAkxW,IAEA,MAAAxuK,EAAA24R,EAAAnqH,GAEA,OADAxuK,EAAAvyG,OAAAuyG,EAAAt4F,OACAs4F,gDCbA,aAEA,MAAAqvD,aAAAA,GAAA9xP,EAAA,WACA+6W,UAAAsgH,GAAAr7d,EAAA,gBACAs7d,EAAAt7d,EAAA,+BACAqnW,EAAArnW,EAAA,WAsQAF,EAAAC,QAhQA,cAAA+xP,EAQAxuP,YAAA42d,EAAA94d,GACA4wH,QAEAvlB,KAAA2hE,SAAAhtK,EACAqrG,KAAA6lQ,OAAA,GAGA7lQ,KAAA8uX,OAAA,CACAlsF,aAAAgsF,EAAA,GACA9rF,SAAA8rF,EAAA,IAGA5uX,KAAA+uX,mBAAAhxX,KAAAunE,MACAtlE,KAAAgvX,uBAAA,GAGAhvX,KAAAivX,gBAAA,GAEAjvX,KAAAytK,QAAAztK,KAAAytK,QAAA90K,KAAAqH,MAEA,MAAA6lW,EAAA7lW,KAAA2hE,SAAAioS,uBAEA,IAAA,IAAAziY,EAAA,EAAAA,EAAAsmZ,EAAAxoZ,OAAAkC,IAAA,CACA,MAAAnyE,EAAAy4d,EAAAtmZ,GACA64B,KAAA8uX,OAAA95d,GAAA45d,EAAA,GACA5uX,KAAAivX,gBAAAj6d,GAAA,GACA,IAAA,IAAAX,EAAA,EAAAA,EAAAwxc,EAAA5gY,OAAA5wE,IAAA,CACA,MAAAixW,EAAAugG,EAAAxxc,IACA2rG,KAAAivX,gBAAAj6d,GAAAswW,GAAAupH,EAAAvpH,IACAx6R,KAAAk1B,KAAA+uX,mBAAA,KAYAl4d,QACAmpG,KAAA6lQ,OAAA5gS,QACA+6B,KAAAkvX,uBAUAr4d,OACAmpG,KAAA+lQ,WACA/lQ,KAAA+lQ,SAAA34M,QACAptD,KAAA+lQ,SAAA,MAOAs8B,eACA,OAAA7uY,OAAAiqG,OAAA,GAAAuC,KAAA8uX,QAMAz0C,qBACA,OAAA7mb,OAAAiqG,OAAA,GAAAuC,KAAAivX,iBAQAp4d,SACA,MAAAwrY,EAAAriS,KAAAqiS,SACAg4C,EAAAr6U,KAAAq6U,eACA3tR,EAAA,CACAk2O,aAAAP,EAAAO,aAAAxkS,WACA0kS,SAAAT,EAAAS,SAAA1kS,WACAi8U,eAAA,IAGA80C,EAAA37d,OAAAW,KAAAkmb,GACA,IAAA,MAAArlb,KAAAm6d,EAAA,CACAziU,EAAA2tR,eAAArlb,GAAA,GACA,IAAA,MAAAswW,KAAA9xW,OAAAW,KAAAkmb,EAAArlb,IACA03J,EAAA2tR,eAAArlb,GAAAswW,GAAA+0E,EAAArlb,GAAAswW,GAAAg1E,gBAIA,OAAA5tR,EAWA71J,KAAAyoO,EAAA8vP,GACApvX,KAAA6lQ,OAAA/6R,KAAA,CAAAw0J,EAAA8vP,EAAArxX,KAAAunE,QACAtlE,KAAAkvX,uBASAr4d,uBACAmpG,KAAA+lQ,SAAAnL,EAAA56P,KAAAytK,QAAAztK,KAAAqvX,gBAUAx4d,eAEA,MAAAy4d,EAAAtvX,KAAA6lQ,OAAA5gS,OAAA+6B,KAAA2hE,SAAA+nS,4BAEA,OADA9jY,KAAAD,IAAAq6B,KAAA2hE,SAAAgoS,wBAAA,EAAA2lB,GAAA,GAeAz4d,UAEA,GADAmpG,KAAA+lQ,SAAA,KACA/lQ,KAAA6lQ,OAAA5gS,OAAA,CACA,IAAA8W,EACA,IAAAA,KAAAikB,KAAA6lQ,OACA7lQ,KAAAuvX,SAAAxzY,GAEAikB,KAAA6lQ,OAAA,GAEA7lQ,KAAAwvX,iBAAAzzY,EAAA,IAEAikB,KAAA64E,KAAA,SAAA74E,KAAA8uX,SAaAj4d,iBAAA44d,GACA,MAAAC,EAAAD,EAAAzvX,KAAA+uX,mBAEAv7d,OAAAW,KAAA6rG,KAAA8uX,QAAA16d,SAAAY,IACAgrG,KAAA2vX,oBAAA36d,EAAA06d,EAAAD,MAGAzvX,KAAA+uX,mBAAAU,EAaA54d,oBAAA7B,EAAA46d,EAAAH,GACA,MAAAlsY,EAAAyc,KAAAgvX,uBAAAh6d,IAAA,EACAgrG,KAAAgvX,uBAAAh6d,GAAA,EAEA,MACA66d,EAAAtsY,GADAqsY,GAAA,GACA,IAEA,IAAAv1C,EAAAr6U,KAAAivX,gBAAAj6d,GACAqlb,IACAA,EAAAr6U,KAAAivX,gBAAAj6d,GAAA,IAGA,MAAA6wc,EAAA7lW,KAAA2hE,SAAAioS,uBAEA,IAAA,IAAAziY,EAAA,EAAAA,EAAA0+X,EAAA5gY,OAAAkC,IAAA,CACA,MAAAmnY,EAAAzI,EAAA1+X,GACA,IAAAmzW,EAAAD,EAAAi0B,GACAh0B,IACAA,EAAAD,EAAAi0B,GAAAugB,EAAAvgB,IAEAh0B,EAAAxvW,KAAA2kZ,EAAAI,IAaAh5d,SAAAm6J,GACA,MAAAh8J,EAAAg8J,EAAA,GACAo+T,EAAAp+T,EAAA,GAEA,GAAA,iBAAAo+T,EACA,MAAA,IAAAt2X,MAAA,6BAAAs2X,KAGA,IAAAn7d,EAKAA,EAHAT,OAAAmqG,UAAAnD,eAAAoD,KAAAoC,KAAA8uX,OAAA95d,GAGAgrG,KAAA8uX,OAAA95d,GAFAgrG,KAAA8uX,OAAA95d,GAAA45d,EAAA,GAIA5uX,KAAA8uX,OAAA95d,GAAAf,EAAAq+W,KAAA88G,GAEApvX,KAAAgvX,uBAAAh6d,KACAgrG,KAAAgvX,uBAAAh6d,GAAA,GAEAgrG,KAAAgvX,uBAAAh6d,IAAAo6d,2HCxQA,aAEA,MAAA7nZ,EAAA3B,KAAA2B,IAGAl0E,EAAAC,QACA,SAAAw8d,GACA,GAAA,iBAAAA,EAAA,MAAA,IAAAh3X,MAAA,6DAEA,GAAAg3X,GAAA,EAAA,MAAA,IAAAh3X,MAAA,iEAEA,IAAAwqS,EAKAysF,EAJAjrT,EAAA,EACAlnC,EAAA,EACA8jB,EAAA,EAIAv1D,EAAA,GAgDA,OA1CAA,EAAArhB,KACA,SAAAswI,EAAA1nN,GACA,GAAAq8d,EAAA,CAEA,MAAAlpZ,EAPA,EAAAU,IAOA6zI,EAAA20Q,GAPAD,GAQAphR,EAAAh7M,EAAA4vY,EAEAA,EAAAz8T,EAAAnzE,GAAA,EAAAmzE,GAAAy8T,EAEAx+N,GAAA,EAAAj+F,IAAAi+F,EAAA4pC,GAHA7nI,EAAA6nI,IAIA9wE,EAAAh4D,KAAAo7N,KAAAl8H,GAEApjB,EAAA4hP,EAAAz8T,EAAA6nI,OAEA40L,EAAA5vY,EAEAq8d,EAAA30Q,GAKAjvH,EAAAmuV,cACA,WACA,OAAAh3C,GAIAn3S,EAAAm8C,SACA,WACA,OAAAw8B,GAGA34E,EAAA6jY,UACA,WACA,OAAApyV,GAGAzxC,EAAA8jY,SACA,WACA,OAAAvuU,GAGAv1D,iCClEA,aAEA,MAAA83O,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,mBAAA,CACA10P,MAAA00P,EAAA,yBAEAnnB,EAAAvpT,EAAA,YAEA28d,EAAA38d,EAAA,uBACA48d,WAAAA,GAAA58d,EAAA,oCACAw6N,EAAAx6N,EAAA,YACAk1U,KAAAA,GAAAl1U,EAAA,WAEA68d,EAAA78d,EAAA,kBAEAsoO,MAAAA,GAAAtoO,EAAA,YA8bAF,EAAAC,QA3aA,MAUAuD,aAAAurc,UACAA,EAAAvoB,QACAA,EAAA8oB,QACAA,EAAA,IAAA3/W,IAAAigX,OACAA,EAAA,IAAAjgX,IAAAs/W,gBACAA,EAAA,SAAAD,aACAA,EAAA,WAEAriW,KAAAoiW,UAAAA,EACApiW,KAAA65U,QAAAA,EACA75U,KAAA2iW,QAAAA,EACA3iW,KAAAijW,OAAAA,EAEAjjW,KAAAqjW,UAAA,KACArjW,KAAA68M,UAAA,IAAA75N,IACAgd,KAAAqiW,aAAAA,EACAriW,KAAAsiW,gBAAAA,EAUAzrc,qBAAA88c,GACA,IAAA0c,EACAnmC,EACAomC,EACAC,EACAC,EACAC,EACAC,EAEA,GAAA1wX,KAAA65U,QAAA,GACA82C,UAAAF,EAAAx8S,MAAAy8S,GAAAN,KACA,MAAAlC,GAAA,IAAAtoZ,KAAAwoC,UAAAhQ,SAAA,IAAAL,KAAAunE,MACAmrT,EAAA,CAAA53P,YAAA,IAAAq1P,IACAva,EAAA3zW,KAAA65U,QAAA+2C,YAAA,CAAApgQ,OAAAmjP,EAAAzpB,WAAAwmC,IAGArkQ,EAAA,2CAGA,IAAAwkQ,EAAAld,EACA3zW,KAAAqjW,YACAwtB,QAAA7wX,KAAAqjW,UAAAytB,QAAAnd,IAGA,MAGAppB,KAAA8lC,EACAnmC,WAAAA,EACA3+O,SAAAilR,SACAxwX,KAAA+wX,gBAAA/wX,KAAAoiW,UAAAyuB,EAAA7wX,KAAA2iW,UAGA3iW,KAAAijW,OAAAhmW,OACAuzH,OAAA8/P,EAAAC,MAAAA,SAAAvwX,KAAAgxX,kBAAAX,EAAArwX,KAAAijW,SAEAqtB,EAAAD,EAEA,MAAA52X,GAGA,MAFA4yH,EAAA98I,MAAA,uCAAAkqB,SACAk6W,EAAA3zX,MAAAyZ,GACAA,EAUA,OAPAuG,KAAA65U,UACA75U,KAAA65U,QAAAo3C,kBAAAP,EAAAxmC,GACAumC,EAAAvmC,IAGA79N,EAAA,4CAEArsH,KAAAkxX,kBAAA,CACAV,eAAAA,EACAzjR,UAAA,UACA4mQ,OAAAA,EACA2c,aAAAA,EACAC,MAAAA,EACArmC,WAAAA,IAWArzb,sBAAA88c,GACA,MAAAlyD,EAAAkyD,EAAAza,WAAAkN,YACA,IAAA3kD,EACA,MAAA3kG,EAAA,IAAAhkN,MAAA,2CAAA+iI,EAAA0kO,uBAGA,MAAA4wB,EAAApjQ,EAAA0M,oBAAAgnL,GAEA,IAAA4uE,EACAnmC,EACAomC,EACAE,EACAD,EACAE,EACAC,EAEA,GAAA1wX,KAAA65U,QAAA,GACA82C,UAAAF,EAAAx8S,MAAAy8S,GAAAN,KACA,MAAAlC,GAAA,IAAAtoZ,KAAAwoC,UAAAhQ,SAAA,IAAAL,KAAAunE,MACAmrT,EAAA,CAAA53P,YAAA,IAAAq1P,IACAva,EAAA3zW,KAAA65U,QAAA+2C,YAAA,CAAApgQ,OAAAmjP,EAAAzpB,WAAAwmC,IAGArkQ,EAAA,4CAGA,IAAAwkQ,EAAAld,EACA3zW,KAAAqjW,YACAwtB,QAAA7wX,KAAAqjW,UAAAytB,QAAAnd,IAGA,MAGAppB,KAAA8lC,EACAnmC,WAAAA,EACA3+O,SAAAilR,SACAxwX,KAAAoxX,iBAAApxX,KAAAoiW,UAAAyuB,EAAAM,EAAAnxX,KAAA2iW,UAGA3iW,KAAAijW,OAAAhmW,OACAuzH,OAAA8/P,EAAAC,MAAAA,SAAAvwX,KAAAqxX,mBAAAhB,EAAArwX,KAAAijW,SAEAqtB,EAAAD,EAEA,MAAA52X,GAGA,MAFA4yH,EAAA98I,MAAA,wCAAAkqB,SACAk6W,EAAA3zX,MAAAyZ,GACAA,EAUA,OAPAuG,KAAA65U,UACA75U,KAAA65U,QAAAo3C,kBAAAP,EAAAxmC,GACAumC,EAAAvmC,IAGA79N,EAAA,6CAEArsH,KAAAkxX,kBAAA,CACAV,eAAAA,EACAzjR,UAAA,WACA4mQ,OAAAA,EACA2c,aAAAA,EACAC,MAAAA,EACArmC,WAAAA,IAiBArzb,mBAAA25d,eACAA,EAAAzjR,UACAA,EAAA4mQ,OACAA,EAAA2c,aACAA,EAAAC,MACAA,EAAArmC,WACAA,IAGA,IAAA8Y,EAEAxY,EAEAP,EAEAsmC,IAEAvtB,EAAA,IAAAutB,EAAA,CAEAe,SAAAh+U,MAAAA,IACA,IAAA22S,EAAA,OACA,MAAAsnC,EAAA,IAAArB,EAAAsB,SAAAC,GACA,IACA,MAAAjhQ,OAAAA,EAAAjlB,SAAAA,SAAAgmR,EAAAvnM,OAAAnsL,MAAA4rD,KAAAzpD,KAAA68M,UAAA1oT,SACAk4N,EAAA,mCAAAtf,EAAAxB,GACAvrG,KAAA65U,SAAA75U,KAAA65U,QAAA+2C,YAAA,CAAApgQ,OAAAA,EAAA05N,WAAAA,EAAA3+O,SAAAA,IACA0+O,EAAAynC,UAAAD,EAAA,CAAAlmR,SAAAA,IACAvrG,KAAA2xX,UAAA,CAAA1nC,WAAAA,EAAAz5N,OAAA,IAAAihQ,KAAAjhQ,GAAAjlB,SAAAA,IACA,MAAA9xG,GACA4yH,EAAA98I,MAAAkqB,KAIAm4X,YAAAH,IACAxnC,EAAA4nC,aAAAJ,EAAAxtY,OAIAumW,EAAAl3S,MAAAupK,IACAxwF,EAAA,gCAAAtf,EAAA8vG,GACA,MAAA40K,EAAAzuB,EAAAxY,YACA+mC,EAAA,IAAArB,EAAAnvB,OAAA0wB,GACA,IACA,MAAAjhQ,OAAAA,EAAAjlB,SAAAA,SAAAgmR,EAAAx5R,OAAA8kH,GAEA,OADA78M,KAAA65U,SAAA75U,KAAA65U,QAAA+2C,YAAA,CAAApgQ,OAAAA,EAAA05N,WAAAA,EAAA3+O,SAAAA,IACA,CAAAilB,OAAA,IAAAihQ,KAAAjhQ,GAAAjlB,SAAAA,GACA,MAAA9xG,GAEA,MADA4yH,EAAA98I,MAAA,8BAAAkqB,GACAqjN,EAAArjN,EAAAoiI,EAAAykO,4BAKA73H,EAAA6nJ,EAAAttB,EAAAstB,GAAApyX,MAAAmuH,EAAA98I,QAGA,MAAAuiZ,EAAAne,EAAAc,SACAd,EAAAc,SAAA,IAAA53Q,MAAAi1R,EAAA,CACArwY,IAAA,IAAArL,KACA6zW,GAAA,UAAA7zW,EAAA,IAAAA,EAAA,KAAA07Y,EAAA9xY,OAEA,WACA,IACA,SAAAiqW,EAAA/nD,KAAAvmL,cACAsuO,EAAAjqW,QAEA,MAAAyZ,GACA4yH,EAAA98I,MAAAkqB,GACA,QACAuG,KAAAsiW,gBAAArY,KARA,GAaAvgQ,QAAAjoG,OAAArL,MAGAu9X,EAAAc,SAAAsd,SAAAh0X,KAAAunE,MAEA,MAAA0sT,EAAA,KACA,MAAAl1K,EAAA,IAAAhkN,MAAA,iCAAA,mCA6BA,OAzBAmxV,EAAA,IAAAkmC,EAAA,CACA1c,UAAAE,EAAAF,UACAva,WAAAya,EAAAza,WACAkJ,UAAApiW,KAAAoiW,UACAlY,WAAAA,EACAhoD,KAAA,CACAn1L,UAAAA,EAEA0nQ,SAAAd,EAAAc,SACAwd,YAAA1B,GAAAA,EAAAniQ,WACA8jQ,WAAA1B,GAEAhmC,UAAAA,GAAAwnC,EACAG,WAAA,IAAAnvB,EAAAA,EAAAhtH,QAAAg8I,IACAhyY,MAAAszD,gBACAqgU,EAAA3zX,QAEAgjX,GACAA,EAAAhtH,QAAA5rQ,KAAAomJ,GAAAA,EAAAx9E,aAKAhzC,KAAAqiW,aAAApY,GAEAA,EAYApzb,WAAAozb,WAAAA,EAAAz5N,OAAAA,EAAAjlB,SAAAA,IACAvrG,KAAA68M,UAAAr7N,IAAA+pH,EACAhuC,CAAA,CAAA0sR,WAAAA,EAAAz5N,OAAAA,EAAAjlB,SAAAA,IAaA10M,sBAAAurc,EAAAnY,EAAA0Y,GACA,MAAA4uB,EAAA,IAAArB,EAAAsB,SAAAvnC,GACAptI,EAAAh/M,MAAA4rD,KAAAk5S,EAAAxuc,QACAk4N,EAAA,6CAAAwwF,GAEA,IACA,MAAArsF,OAAAA,EAAAjlB,SAAAA,SAAAgmR,EAAAvnM,OAAA6yB,GACA7uF,EAAA20O,EAAAnhX,IAAA+pH,GAGA,GAFA8gB,EAAA,qCAEA2B,EACA,MAAA,IAAAl1H,MAAA,8BAAAyyG,KAGA,MAAA,UACAyiB,EAAAokQ,cAAAhwB,EAAA5xO,GACAjlB,SAAAA,GAEA,MAAA9xG,GACA,MAAAqjN,EAAArjN,EAAAoiI,EAAA+jO,wBAgBA/oc,uBAAAurc,EAAAnY,EAAAknC,EAAAxuB,GACA,MAAA4uB,EAAA,IAAArB,EAAAnvB,OAAA9W,GACAptI,EAAAh/M,MAAA4rD,KAAAk5S,EAAAxuc,QACAk4N,EAAA,qCAAAwwF,GAEA,IACA,MAAArsF,OAAAA,EAAAjlB,SAAAA,SAAAgmR,EAAAx5R,OAAA8kH,GACA7uF,EAAA20O,EAAAnhX,IAAA+pH,GAGA,GAFA8gB,EAAA,uCAAA8kQ,IAEAnjQ,EACA,MAAA,IAAAl1H,MAAA,8BAAAyyG,KAGA,MAAA,UACAyiB,EAAAqkQ,eAAAjwB,EAAA5xO,EAAA2gQ,GACA5lR,SAAAA,GAEA,MAAA9xG,GACA,MAAAqjN,EAAArjN,EAAAoiI,EAAA+jO,wBAcA/oc,yBAAAozb,EAAAgZ,GACA,MAAAL,EAAA,IAAAstB,EAAAnvB,OAAA9W,GACAptI,EAAAh/M,MAAA4rD,KAAAw5S,EAAA9uc,QACAk4N,EAAA,8BAAAwwF,GACA,IACA,MAAArsF,OAAAA,EAAAjlB,SAAAA,SAAAq3P,EAAA7qQ,OAAA8kH,GACAxwF,EAAA,gCAAA9gB,GAEA,MAAA,CAAAilB,OAAAA,EAAA+/P,MADAttB,EAAAzhX,IAAA+pH,IAEA,MAAA9xG,GACA,MAAAqjN,EAAArjN,EAAAoiI,EAAAqkO,wBAcArpc,wBAAAozb,EAAAgZ,GACA,MAAAn2P,EAAA,IAAAojR,EAAAsB,SAAAvnC,GACAptI,EAAAh/M,MAAA4rD,KAAAw5S,EAAA9uc,QACAk4N,EAAA,6BAAAwwF,GACA,IACA,MAAArsF,OAAAA,EAAAjlB,SAAAA,SAAAuB,EAAAk9E,OAAA6yB,GAEA,MAAA,CAAArsF,OAAAA,EAAA+/P,MADAttB,EAAAzhX,IAAA+pH,IAEA,MAAA9xG,GACA,MAAAqjN,EAAArjN,EAAAoiI,EAAAqkO,+OCxcA,aAEA,MAAAnoQ,EAAAxkM,EAAA,YACAy2R,EAAAz2R,EAAA,YACAm6N,EAAAn6N,EAAA,SACA++d,YAAAA,GAAA/+d,EAAA,eAEAD,EAAAg/d,YAAAA,EAEA,MAAAC,EACA17d,YAAA25N,GACAxwH,KAAAwyX,QAAAhiQ,EACAxwH,KAAAyyX,SAAA,EAIA57d,mBACA,GAAAmpG,KAAAyyX,QAAA,OACA,MAAAjiQ,OAAAA,SAAAz4B,EAAA/3F,KAAAwyX,QAAAF,GACAtyX,KAAAwyX,QAAAhiQ,EACAxwH,KAAAyyX,SAAA,GAiBAn/d,EAAAytc,OAbA,cAAAwxB,EACA17d,OAAAgmT,GACA,OAAA9kH,EAAA/3F,KAAAwyX,QAAA31K,EAAA78M,KAAAyyX,QAAA,KAAAH,GAGAz7d,iBACAmpG,KAAA0yX,aACA,MAAAliQ,OAAAA,EAAAqsF,UAAAA,SAAAnvF,EAAA1tH,KAAAwyX,SAEA,OADAxyX,KAAAwyX,QAAAhiQ,EACAqsF,IAYAvpT,EAAAk+d,SANA,cAAAe,EACA17d,OAAAgmT,GACA,OAAA7yB,EAAAhqL,KAAAwyX,QAAA31K,6GCzCA,aAEA,MAAAxwF,EAAA94N,EAAA,QAAAA,CAAA,cACAupT,EAAAvpT,EAAA,YACAo/d,EAAAp/d,EAAA,iBACAqid,EAAArid,EAAA,gBAEAF,EAAAC,QAAAggJ,MAAAk9E,EAAAqsF,EAAA+1K,KACA/1K,EAAAh/M,MAAA/gB,QAAA+/N,GAAA,IAAAA,GAAA,CAAAA,GACA,MAAA/rF,OAAAA,EAAAiyB,OAAAA,EAAAn+I,KAAAA,EAAA4rH,OAAAqiQ,GAAAjd,EAAAplP,GAEAjlB,EAAAsxG,EAAAl4M,QACAiuX,GACAvmQ,EAAA,6BAAAumQ,EAAArnR,GACAonR,EAAAG,SAAA/vO,EAAA,CAAA6vO,EAAArnR,MAEA8gB,EAAA,qBAAA9gB,GACAonR,EAAAhuO,MAAA5B,EAAAx3C,IAGA,IAAAojB,SAAAgkQ,EAAA3hQ,KAAAF,IAAA1yH,WAUA,GATAiuH,EAAA,oBAAAsC,GAGAA,IAAAikQ,IACAjkQ,SAAAgkQ,EAAA3hQ,KAAAF,IAAA1yH,WACAiuH,EAAA,oBAAAsC,IAIAA,IAAApjB,EAEA,OADA3mG,IACA,CAAA4rH,OAAAqiQ,EAAAtnR,SAAAA,GAIA,IAAA,MAAAA,KAAAsxG,EAAA,CACAxwF,EAAA,qBAAA9gB,GACAonR,EAAAhuO,MAAA5B,EAAAx3C,GACA,MAAAojB,SAAAgkQ,EAAA3hQ,KAAAF,IAAA1yH,WAGA,GAFAiuH,EAAA,6BAAAsC,EAAApjB,GAEAojB,IAAApjB,EAEA,OADA3mG,IACA,CAAA4rH,OAAAqiQ,EAAAtnR,SAAAA,GAKA,MADA3mG,IACAk4M,EAAA,IAAAhkN,MAAA,6BAAA,0ICjDA,aAEA,MAAAwrO,EAAA/wU,EAAA,iBACAi6b,EAAAj6b,EAAA,sBACAk1U,EAAAl1U,EAAA,WACAupT,EAAAvpT,EAAA,YACA6kO,EAAA7kO,EAAA,2BACAslF,EAAAtlF,EAAA,YAEAw/d,EAAA36P,EAAA,MAEA9kO,EAAAgwG,OAAAusG,GAAA29O,EAAAlqV,OAAAuqS,OAAA,IAAAvpE,EAAA,CAAAz0H,EAAAkjR,KAGAz/d,EAAAqxP,MAAA,CAAA5B,EAAAlzC,IAAAkzC,EAAAj4K,KAAAx3E,EAAAgwG,OAAAusG,IAGAv8M,EAAAw/d,SAAA,CAAA/vO,EAAAmsJ,KACAnsJ,EAAAj4K,KAAAokU,EAAAxpU,QAAA,CAAAqoO,EAAAl+F,IAAAk+F,EAAA2gG,OAAAp7Y,EAAAgwG,OAAAusG,KAAA,IAAAy0H,KAGAhxU,EAAA09N,KAAA19E,MAAAA,IACA,IAAA8qF,EAAA,EACA,MAAAixN,EAAA,CACAx4b,CAAAX,OAAAy6N,iBAAA,OAAA3wH,MACA5iB,KAAA,IAAA0zI,EAAA1zI,KAAAghJ,IAKA7N,QAAAk4G,EAAA4mH,EAAA7B,EAAAppV,OAAA,CAAA8qV,SADAnmW,IAAAq1I,EAAAr1I,KACAlQ,GAEA,GAAA03I,EAAA/uI,IAAA+uI,EAAAtrJ,OAAA,KAAA8tZ,EAAA,GACA,MAAAj2K,EAAA,IAAAhkN,MAAA,mBAAA,0CAGA,OAAAy3H,EAAAw/K,aAAA,GAAA,gLCpCA,aAEA,MAAA1jL,EAAA94N,EAAA,QAAAA,CAAA,cACA+wU,EAAA/wU,EAAA,iBACAo/d,EAAAp/d,EAAA,iBACAqid,EAAArid,EAAA,iBACA++d,YAAAA,GAAA/+d,EAAA,eAEAF,EAAAC,QAAAggJ,MAAAk9E,EAAAqsF,KACAA,EAAAh/M,MAAA/gB,QAAA+/N,GAAAA,EAAA,CAAAA,GACA,MAAA95D,OAAAA,EAAAjyB,OAAAA,EAAAlsH,KAAAA,EAAA4rH,OAAAqiQ,GAAAjd,EAAAplP,GAEA,OAAA,CACA,MAAAjlB,SAAAonR,EAAA3hQ,KAAAF,IAAA1yH,WAGA,GAFAiuH,EAAA,YAAA9gB,GAEAA,IAAA+mR,EAAA,CAMA,GAAAz1K,EAAApuO,SAAA88H,GAIA,OAHAonR,EAAAhuO,MAAA5B,EAAAx3C,GACA8gB,EAAA,6BAAA9gB,EAAAA,GACA3mG,IACA,CAAA4rH,OAAAqiQ,EAAAtnR,SAAAA,GAGA,OAAAA,GASAonR,EAAAhuO,MAAA5B,EAAA,MACA12B,EAAA,6BAAA9gB,KARAonR,EAAAhuO,MAAA5B,EAAA,IAAAuhF,EACAznB,EAAAzyO,KAAAlD,GAAAyrZ,EAAArvX,OAAAp8B,OAEAmlJ,EAAA,2BAAAwwF,EAAAtxG,SAjBA8gB,EAAA,6BAAAimQ,EAAA/mR,GACAonR,EAAAhuO,MAAA5B,EAAAuvO,6IClBA,aAEAh/d,EAAAg/d,YAAA,mDCFA,aAEA,MAAA9wO,EAAAjuP,EAAA,aACA84N,EAAA94N,EAAA,QAAAA,CAAA,4BACAo/d,EAAAp/d,EAAA,iBACAqid,EAAArid,EAAA,gBACAi6b,EAAAj6b,EAAA,sBACAk1U,EAAAl1U,EAAA,WAEAF,EAAAC,QAAAggJ,MAAAA,IACA,MAAAw9E,OAAAA,EAAAiyB,OAAAA,EAAAn+I,KAAAA,EAAA4rH,OAAAqiQ,GAAAjd,EAAAplP,GAEAnE,EAAA,cACAsmQ,EAAAhuO,MAAA5B,EAAA,MACAn+I,IAIA,MAAA74B,QAAA4mZ,EAAA3hQ,KAAAF,GAIAkiQ,EAAAxxO,EAAA,CAAAz1K,IACA8wO,EAAA,GAcA,aAXA4rB,EACAuqJ,EACAxlC,EAAAppV,UACAkvC,MAAAA,IACA,UAAA,MAAAi4D,KAAAx2H,EAEA8nO,EAAA/xO,KAAAygI,EAAAwkM,aAAA,GAAA,GAAA3xS,eAKA,CAAAoyH,OAAAqiQ,EAAAh2K,UAAAA,iKCrCA,aAEAvpT,EAAA68d,WAAA58d,EAAA,oECFA,aAEA,MAAAw6N,EAAAx6N,EAAA,YACA4nT,UAAAA,GAAA5nT,EAAA,aACAupT,EAAAvpT,EAAA,aACA0/d,KAAAA,EAAAC,QAAAA,EAAAC,OAAAA,GAAA5/d,EAAA,YAEA6/d,EAAAl9d,OAAAugP,IAAA,2CAwCA,MAAA05O,EAQAt5d,aAAA48c,UAAAA,EAAAva,WAAAA,EAAAkJ,UAAAA,EAAAlY,WAAAA,EAAAM,UAAAA,EAAAxqW,MAAAA,EAAAmyY,WAAAA,EAAAjwF,KAAAA,KA4LA,SAAAuxE,EAAArR,EAAAlY,EAAAM,EAAAxqW,EAAAmyY,EAAAjwF,GACA,GAAAuxE,IAAAt4J,EAAAM,YAAAg4J,GACA,MAAA32J,EAAA,IAAAhkN,MAAA,8CAAA,0BAGA,IAAAi1H,EAAA0N,SAAA2mO,GACA,MAAAtlJ,EAAA,IAAAhkN,MAAA,4CAAA,0BAGA,IAAAi1H,EAAA0N,SAAAyuN,GACA,MAAAptI,EAAA,IAAAhkN,MAAA,6CAAA,0BAGA,GAAA,mBAAA0xV,EACA,MAAA1tI,EAAA,IAAAhkN,MAAA,iCAAA,0BAGA,GAAA,mBAAA9Y,EACA,MAAA88N,EAAA,IAAAhkN,MAAA,4BAAA,0BAGA,GAAA,mBAAAq5X,EACA,MAAAr1K,EAAA,IAAAhkN,MAAA,iCAAA,0BAGA,IAAAopS,EACA,MAAAplF,EAAA,IAAAhkN,MAAA,+CAAA,0BAGA,GAAA,YAAAopS,EAAAn1L,WAAA,aAAAm1L,EAAAn1L,UACA,MAAA+vG,EAAA,IAAAhkN,MAAA,6CAAA,0BAGA,IAAAopS,EAAAuyE,SACA,MAAA33J,EAAA,IAAAhkN,MAAA,kEAAA,0BAGA,IAAAopS,EAAAuyE,SAAA10X,KACA,MAAA+8N,EAAA,IAAAhkN,MAAA,8CAAA,0BAGA,IAAAopS,EAAAuyE,SAAAsd,SACA,MAAAj1K,EAAA,IAAAhkN,MAAA,kDAAA,0BArOAu6X,CAAA5f,EAAArR,EAAAlY,EAAAM,EAAAxqW,EAAAmyY,EAAAjwF,GAKAliS,KAAA/b,GAAA7d,SAAAC,OAAA,IAAAT,KAAAwoC,WAAAhQ,SAAA,IAAAL,KAAAunE,MAKAtlE,KAAAyzW,UAAAA,EAKAzzW,KAAAk5V,WAAAA,EAKAl5V,KAAAoiW,UAAAA,EAKApiW,KAAAkqV,WAAAA,EAOAlqV,KAAAszX,MAAA,IACApxF,EACAvmL,OAAAs3Q,GAMAjzX,KAAAuzX,WAAA/oC,EAKAxqV,KAAA0xU,OAAA1xV,EAKAggB,KAAAwzX,YAAArB,EAKAnyX,KAAAg5F,SAAA,IAAAh2G,IAOAgd,KAAAk6G,KAAA,GAGA14H,IAAAtrF,OAAAspM,eACA,MAAA,aAGA4zR,IAAAA,KACA,OAAA,EASAv8d,oBAAAmgP,GACA,OAAA35J,QAAA25J,GAAAA,EAAAo8O,IAQAlxF,WACA,OAAAliS,KAAAszX,MAQAt9I,cACA,OAAAh2O,KAAAwzX,cASA38d,gBAAAgmT,GACA,GAAA78M,KAAAkiS,KAAAvmL,SAAAu3Q,EACA,MAAAp2K,EAAA,IAAAhkN,MAAA,kCAAA,+BAGA,GAAAkH,KAAAkiS,KAAAvmL,SAAAw3Q,EACA,MAAAr2K,EAAA,IAAAhkN,MAAA,4BAAA,yBAGA+E,MAAA/gB,QAAA+/N,KAAAA,EAAA,CAAAA,IAEA,MAAArsF,OAAAA,EAAAjlB,SAAAA,SAAAvrG,KAAAuzX,WAAA12K,GAIA,OAFA78M,KAAA0xX,UAAAlhQ,EAAA,CAAAjlB,SAAAA,IAEA,CACAilB,OAAAA,EACAjlB,SAAAA,GAWA10M,UAAA46d,GAAAlmR,SAAAA,EAAA+9J,SAAAA,EAAA,KAEAtpQ,KAAAg5F,SAAAv3G,IAAAgwY,EAAAxtY,GAAA,CACAsnH,SAAAA,KACA+9J,IASAzyW,aAAAotF,GACA+b,KAAAg5F,SAAAv1G,OAAAQ,GAQAptF,cACA,GAAAmpG,KAAAkiS,KAAAvmL,SAAAw3Q,EAAA,CAIA,GAAAnzX,KAAAyzX,SACA,OAAAzzX,KAAAyzX,SAGAzzX,KAAAkiS,KAAAvmL,OAAAu3Q,EAGAlzX,KAAAyzX,eAAAzzX,KAAA0xU,SAEA1xU,KAAAszX,MAAA7e,SAAAz0X,MAAA+d,KAAAunE,MACAtlE,KAAAkiS,KAAAvmL,OAAAw3Q,IAIA9/d,EAAAC,QAAA68d,yGCxOA,aAOA98d,EAAAC,QALA,CACA2/d,KAAA,OACAC,QAAA,UACAC,OAAA,wCCLA,aAEA,SAAAO,EAAA92X,GAAA,GAAAiB,MAAA/gB,QAAA8f,GAAA,CAAA,IAAA,IAAAz1B,EAAA,EAAAwsZ,EAAA91X,MAAAjB,EAAA33B,QAAAkC,EAAAy1B,EAAA33B,OAAAkC,IAAAwsZ,EAAAxsZ,GAAAy1B,EAAAz1B,GAAA,OAAAwsZ,EAAA,OAAA91X,MAAA4rD,KAAA7sD,GAEAvpG,EAAAC,QAAA,SAAAsge,GACA,IAAAC,OAAA,EACAC,OAAA,EAEA,SAAAnD,EAAAvlT,GACA,KAAAA,aAAA53K,QACA,MAAA,IAAAslG,MAAA,WAAAsyE,EAAA,sBAEA0oT,EAAA1oT,EAGA,SAAA2oT,EAAAx2T,GACA/pK,OAAAW,KAAAopK,GAAAnpK,SAAA,SAAAY,GACA,IAAAtB,EAAA6pK,EAAAvoK,GAEA,GAAA,mBAAAtB,EACA,MAAA,IAAAolG,MAAA,SAAA9jG,EAAA,KAAAtB,EAAA,uBAGA,IAAAg2L,QAAA10L,GACA,MAAA,IAAA8jG,MAAA,SAAA9jG,EAAA,KAAAtB,EAAA,4BAGAmge,EAAAt2T,EAEAozT,GAAA,eAEAiD,GACAjD,EAAAiD,GAEAG,EAAArqS,SAGA,IAAAnsB,EAAA,IAAAs/B,MAAA,GAAA,CACAr7G,IAAA,SAAA4pF,EAAAz/E,GACA,OAAA,WACA,IAAA,IAAAgpP,EAAAt+P,UAAApR,OAAAmR,EAAAynB,MAAA82O,GAAA53O,EAAA,EAAAA,EAAA43O,EAAA53O,IACA3mB,EAAA2mB,GAAA1mB,UAAA0mB,GAGA,OAAA82X,EAAAloY,GAAAy3G,MAAA,KAAA,CAAA0wR,GAAAjiY,OAAA6hY,EAAAt9Y,EAAAhR,MAAA,UAKA,MAAA,CACAurZ,UAAAA,EACAoD,WAAAA,EACAzxQ,UAAA,WACA,OAAAwxQ,GAEAE,WAAA,WACA,OAAAH,GAGA5/S,MAAA,IAAA4oB,MAAAi3R,EAAAv2T,mCC3DA,aAEA,MAAA0hF,EAAA1rP,EAAA,aAEA8xP,aAAAA,GAAA9xP,EAAA,UACAw6N,EAAAx6N,EAAA,WAEA0ge,EAAA1ge,EAAA,kBACA2ge,EAAA3ge,EAAA,cACA4ge,EAAA5ge,EAAA,mBACA6ge,EAAA7ge,EAAA,iBAGAsoO,OAAAmkO,uBAAAA,IACAzsc,EAAA,aAyIAF,EAAAC,QA1HA,cAAA+xP,EAkBAxuP,aAAA6kO,OAAAA,IACAn2G,QAEAvlB,KAAAy3R,QAAA/7J,EAKA17H,KAAAmhT,YAAA,IAAA8yE,EAAAj0X,MAKAA,KAAAkhT,QAAA,IAAAgzE,EAAAl0X,MAKAA,KAAAwhT,aAAA,IAAA2yE,EAAAn0X,MAKAA,KAAAshT,UAAA,IAAA8yE,EAAAp0X,MAMAnpG,SAKAA,QAOA4rY,YACA,MAAA4xF,EAAA,IAAA11Y,IAAA,IACAqhB,KAAAmhT,YAAAz0P,KAAAv4J,UACA6rG,KAAAkhT,QAAAx0P,KAAAv4J,UACA6rG,KAAAshT,UAAA50P,KAAAv4J,UACA6rG,KAAAwhT,aAAA90P,KAAAv4J,SAIA6rG,KAAAy3R,SAAA48F,EAAA5wY,OAAAuc,KAAAy3R,QAAA5+J,eAEA,MAAAy7P,EAAA,IAAAtxY,IAKA,OAJAqxY,EAAAjge,SAAAqtZ,IACA6yE,EAAA7yY,IAAAggU,EAAAzhT,KAAAxe,IAAAusI,EAAA2M,cAAA+mL,QAGA6yE,EASAz9d,OAAA6kO,GACA,MAAA64P,EAAAv0X,KAAAmhT,YAAA19T,OAAAi4I,GACA84P,EAAAx0X,KAAAkhT,QAAAz9T,OAAAi4I,GACA+4P,EAAAz0X,KAAAshT,UAAA79T,OAAAi4I,GACAg5P,EAAA10X,KAAAwhT,aAAA/9T,OAAAi4I,GAEA,OAAA64P,GAAAC,GAAAC,GAAAC,EASA79d,IAAA6kO,GACA,IAAA3N,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,MAAA/7W,EAAA+b,KAAAkhT,QAAAx0P,KAAAlrE,IAAAk6I,EAAA7C,eACA+jG,EAAA58N,KAAAmhT,YAAA3/T,IAAAk6I,GACA4tI,EAAAtpQ,KAAAwhT,aAAAhgU,IAAAk6I,GACAmhF,EAAA78M,KAAAshT,UAAA9/T,IAAAk6I,GAEA,GAAAz3I,GAAA24O,GAAA0sC,GAAAzsD,EAIA,MAAA,CACA54N,GAAAA,GAAAy3I,EACAkhG,UAAAA,GAAA,GACA/f,UAAAA,GAAA,GACAysD,SAAAA,yMClJA,aAEA,MAAArlC,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,kCAAA,CACA10P,MAAA00P,EAAA,wCAEAhlF,EAAA1rP,EAAA,aAEA4nT,UAAAA,GAAA5nT,EAAA,aACAw6N,EAAAx6N,EAAA,WAEAohe,EAAAphe,EAAA,UACA+5c,EAAA/5c,EAAA,0BAGAsoO,OAAAmkO,uBAAAA,IACAzsc,EAAA,aACAosb,EAAApsb,EAAA,sBAgVAF,EAAAC,QAzTA,cAAAqhe,EAOA99d,YAAAoqZ,GAMA17R,MAAA,CACA07R,UAAAA,EACAhrT,UAAA,oBACA2+X,cAAA,aACAC,iBAAAnoU,GACAA,EAAAkwK,UAGAlwK,EAAAkwK,UAAAxyP,KAAA8zO,GAAAA,EAAAhwF,YAFA,KAWAluH,KAAA0sD,KAAA,IAAA1pE,IAWAnsF,kBAAA0vb,GACA,IAAAgnB,EACA,IACAA,EAAAD,EAAA9xO,mBAAA+qN,EAAA3sO,SACA,MAAAngH,GAEA,OADA4yH,EAAA98I,MAAA,iCACA,EAIA,IAAAg+X,EAAA7xO,OAAA1B,OAAAusN,EAAA7qN,QAEA,OADArP,EAAA,wDACA,EAIA,IAAAkhP,EAAAlsD,aAAAksD,EAAAlsD,WAAAp8U,OACA,OAAA,EAGA,MAAAy2J,EAAA6xO,EAAA7xO,OACAz3I,EAAAy3I,EAAA7C,cAEAi8P,GADA90X,KAAA0sD,KAAAlrE,IAAAyC,IAAA,CAAAirH,YAAAx5M,IACAw5M,OAGA,GAAA4lR,GAAAA,EAAArjG,WAAA87E,EAAA97E,UACA,OAAA,EAGA,MAAA70D,EAAA58N,KAAA+0X,aAAAxnB,EAAAlsD,YAAA,GAaA,OATArhT,KAAAg1X,SAAAt5P,EAAA,CACAkhG,UAAAA,EACA1tH,OAAA,CACAplH,IAAAy8V,EAAA9lK,UACAgxG,UAAA87E,EAAA97E,aAGAplK,EAAA,mCAAApoI,MAEA,EAUAptF,eAAA6kO,GACA,MAAA3lD,EAAA/1E,KAAA0sD,KAAAlrE,IAAAk6I,EAAA7C,eAEA,GAAA9iD,GAAAA,EAAAm5B,QAAAn5B,EAAAm5B,OAAAplH,IAIA,OAAAisF,EAAAm5B,OAAAplH,IAUAjzF,cAAA6kO,GACA,MAAA5xI,EAAAkW,KAAA0oV,eAAAhtN,GAEA,GAAA5xI,EAIA,OAAA61V,EAAAnkN,mBAAA1xI,GAcAjzF,IAAA6kO,EAAA2lL,GACA,IAAAtzL,EAAA0N,SAAAC,GAEA,MADArP,EAAA98I,MAAA,uDACA0vK,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,MAAApjI,EAAA58N,KAAA+0X,aAAA1zE,GAGA,IAAAzkF,EAAA33P,OACA,OAAA+6B,KAGA,MAAA/b,EAAAy3I,EAAA7C,cACA9iD,EAAA/1E,KAAA0sD,KAAAlrE,IAAAyC,GAGA,GAAA8xF,GAAAA,EAAA6mJ,WAAA7mJ,EAAA6mJ,UAAA33P,SAAA23P,EAAA33P,OAAA,CAKA,GAJA8wG,EAAA6mJ,UAAA7uP,QAAAivO,GAAA4f,EAAAh2P,MAAAquZ,GAAAj4K,EAAA9uF,UAAA8L,OAAAi7P,EAAA/mQ,eAIAjpJ,SAAA8wG,EAAA6mJ,UAAA33P,OAEA,OADAonJ,EAAA,uEAAApoI,KACA+b,KAeA,OAXAA,KAAAg1X,SAAAt5P,EAAA,CACAkhG,UAAAA,EACA1tH,OAAAn5B,GAAAA,EAAAm5B,SAEAmd,EAAA,kCAAApoI,KAGA8xF,GACA/1E,KAAAk1X,IAAAr8S,KAAA,OAAA6iD,GAGA17H,KAWAnpG,IAAA6kO,EAAA2lL,GACA,IAAAtzL,EAAA0N,SAAAC,GAEA,MADArP,EAAA98I,MAAA,uDACA0vK,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,MAAApjI,EAAA58N,KAAA+0X,aAAA1zE,GACAp9T,EAAAy3I,EAAA7C,cAGA,IAAA+jG,EAAA33P,OACA,OAAA+6B,KAGA,MAAA+1E,EAAA/1E,KAAA0sD,KAAAlrE,IAAAyC,GAEA,OAAA8xF,GAAAA,EAAA6mJ,YAEA7mJ,EAAA6mJ,UAAAxoU,SAAA4oT,IACA4f,EAAAz+O,MAAA6vB,GAAAA,EAAAkgH,UAAA8L,OAAAgjF,EAAA9uF,cACA0uG,EAAA9xP,KAAAkyO,MAMAjnI,EAAA6mJ,UAAA33P,SAAA23P,EAAA33P,SACAonJ,EAAA,0DAAApoI,KACA+b,OAIAA,KAAAg1X,SAAAt5P,EAAA,CACAkhG,UAAAA,EACA1tH,OAAAn5B,GAAAA,EAAAm5B,SAGAmd,EAAA,iCAAApoI,KAGA8xF,GAAAA,EAAA6mJ,WACA58N,KAAAk1X,IAAAr8S,KAAA,OAAA6iD,GAGA17H,MAUAnpG,IAAA6kO,GACA,IAAA3N,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,MAAAjqR,EAAA/1E,KAAA0sD,KAAAlrE,IAAAk6I,EAAA7C,eAEA,OAAA9iD,GAAAA,EAAA6mJ,UAAA,IAAA7mJ,EAAA6mJ,gBAAAlnU,EAWAmB,aAAAwqZ,EAAAopD,GAAA,GACA,IAAAppD,EAEA,MADAh1L,EAAA98I,MAAA,6CACA0vK,EAAA,IAAAnmJ,MAAA,+BAAAknW,GAKA,MAAApjI,EAAA,GAgBA,OAfAykF,EAAAjtZ,SAAA4oT,IACA,IAAA7B,EAAAM,YAAAuB,GAEA,MADA3wF,EAAA98I,MAAA,aAAAytO,sCACA/9D,EAAA,IAAAnmJ,MAAA,aAAAkkN,sCAAAgjJ,GAIApjI,EAAAz+O,MAAAtX,GAAAA,EAAAqnJ,UAAA8L,OAAAgjF,MACA4f,EAAA9xP,KAAA,CACAojJ,UAAA8uF,EACAytJ,YAAAA,OAKA7tI,EAYA/lU,qBAAA6kO,EAAAyrO,EAAA,CAAAr3O,GAAAA,IACA,IAAA/B,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,MAAAjqR,EAAA/1E,KAAA0sD,KAAAlrE,IAAAk6I,EAAA7C,eACA,GAAA9iD,GAAAA,EAAA6mJ,UAIA,OAAAuqI,EACApxR,EAAA6mJ,WAAA,IACAxyP,KAAA8zO,IACA,MAAAhwF,EAAAgwF,EAAAhwF,UAEAggQ,EAAAhgQ,EAAAk4O,YACA,OAAA8nB,GAAAA,IAAAxyP,EAAA7C,cAAA3K,EAEAA,EAAAmmP,YAAA,QAAA34O,EAAA7C,0NC5VA,aAEA,MAAAomB,EAAA1rP,EAAA,YACAw6N,EAAAx6N,EAAA,YAGAsoO,OAAAmkO,uBAAAA,IACAzsc,EAAA,aAKA4he,EAAAzoU,GAAAA,EAkHAr5J,EAAAC,QA5GA,MAWAuD,aAAAoqZ,UAAAA,EAAAhrT,UAAAA,EAAA2+X,cAAAA,EAAAC,iBAAAA,EAAAM,IACAn1X,KAAAk1X,IAAAj0E,EACAjhT,KAAA/J,UAAAA,EACA+J,KAAA40X,cAAAA,EACA50X,KAAA60X,iBAAAA,EAOA70X,KAAA0sD,KAAA,IAAA1pE,IASAnsF,IAAA6kO,EAAAhvE,GACA,MAAAuyF,EAAA,IAAAnmJ,MAAA,2CAAA,uBAaAjiG,SAAA6kO,EAAAhvE,GAAAmsB,KAAAA,GAAA,GAAA,IACA,MAAAu8S,EAAA15P,EAAA7C,cAGA74H,KAAA0sD,KAAAjrE,IAAA2zY,EAAA1oU,GAGAmsB,GAAA74E,KAAAq1X,MAAA35P,EAAAhvE,GAUA71J,MAAA6kO,EAAAhvE,GACA1sD,KAAAk1X,IAAAr8S,KAAA74E,KAAA/J,UAAA,CACAylI,OAAAA,EACA7kO,CAAAmpG,KAAA40X,eAAA50X,KAAA60X,iBAAAnoU,KAWA71J,IAAA6kO,GACA,IAAA3N,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,MAAAs1B,EAAAt1X,KAAA0sD,KAAAlrE,IAAAk6I,EAAA7C,eAGA,OAAAy8P,EAAA,IAAAA,QAAA5/d,EASAmB,OAAA6kO,GACA,IAAA3N,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,QAAAhgW,KAAA0sD,KAAAjpE,OAAAi4I,EAAA7C,iBAIA74H,KAAAq1X,MAAA35P,EAAA,KAEA,2FC1HA,aAEA,MAAAuoG,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,8BAAA,CACA10P,MAAA00P,EAAA,oCAEAhlF,EAAA1rP,EAAA,YAEAw6N,EAAAx6N,EAAA,WAEAohe,EAAAphe,EAAA,WAGAsoO,OAAAmkO,uBAAAA,IACAzsc,EAAA,aAiFAF,EAAAC,QAvEA,cAAAqhe,EAOA99d,YAAAoqZ,GACA17R,MAAA,CACA07R,UAAAA,EACAhrT,UAAA,gBACA2+X,cAAA,SACAC,iBAAAnoU,GAAAA,EAAA8rE,SAQAx4H,KAAA0sD,KAAA,IAAA1pE,IAWAnsF,IAAA6kO,EAAAg3C,GACA,IAAA3kD,EAAA0N,SAAAC,GAEA,MADArP,EAAA98I,MAAA,uDACA0vK,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,MAAA/7W,EAAAy3I,EAAA7C,cAaA,OAZA74H,KAAA0sD,KAAAlrE,IAAAyC,IAGAyuL,IAGAh3C,EAAAlD,OAAAk6C,EAEA1yK,KAAAg1X,SAAAt5P,EAAAA,GACArP,EAAA,kCAAApoI,MAGA+b,KAUAnpG,IAAA6kO,GACA,IAAA3N,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,MAAAs1B,EAAAt1X,KAAA0sD,KAAAlrE,IAAAk6I,EAAA7C,eAEA,OAAAy8P,EAAAA,EAAA98P,YAAA9iO,yHC3FA,aAEA,MAAAuuU,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,gCAAA,CACA10P,MAAA00P,EAAA,sCAEAhlF,EAAA1rP,EAAA,YACA4kO,EAAA5kO,EAAA,sBAEAw6N,EAAAx6N,EAAA,WAEAohe,EAAAphe,EAAA,WAGAsoO,OAAAmkO,uBAAAA,IACAzsc,EAAA,aAmKAF,EAAAC,QAxJA,cAAAqhe,EAQA99d,YAAAoqZ,GAKA17R,MAAA,CACA07R,UAAAA,EACAhrT,UAAA,kBACA2+X,cAAA,aAQA50X,KAAA0sD,KAAA,IAAA1pE,IAaAnsF,IAAA6kO,EAAA1mO,EAAAtB,GACA,IAAAq6N,EAAA0N,SAAAC,GAEA,MADArP,EAAA98I,MAAA,uDACA0vK,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,GAAA,iBAAAhrc,KAAAtB,aAAA+kO,YAEA,MADApM,EAAA98I,MAAA,sDACA0vK,EAAA,IAAAnmJ,MAAA,wCAAAknW,GAKA,OAFAhgW,KAAAu1X,UAAA75P,EAAA1mO,EAAAtB,GAEAssG,KAWAnpG,UAAA6kO,EAAA1mO,EAAAtB,GAAAmlL,KAAAA,GAAA,GAAA,IACA,MAAA50F,EAAAy3I,EAAA7C,cACAy8P,EAAAt1X,KAAA0sD,KAAAlrE,IAAAyC,IAAA,IAAAjB,IACAwyY,EAAAF,EAAA9zY,IAAAxsF,GAGAwge,GAAAr9P,EAAAzkO,EAAA8he,GACAnpQ,EAAA,qEAAApoI,QAAAjvF,MAIAsge,EAAA7zY,IAAAzsF,EAAAtB,GACAssG,KAAA0sD,KAAAjrE,IAAAwC,EAAAqxY,GAEAz8S,GAAA74E,KAAAq1X,MAAA35P,EAAA1mO,IASA6B,IAAA6kO,GACA,IAAA3N,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,OAAAhgW,KAAA0sD,KAAAlrE,IAAAk6I,EAAA7C,eAUAhiO,SAAA6kO,EAAA1mO,GACA,IAAA+4N,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,MAAAs1B,EAAAt1X,KAAA0sD,KAAAlrE,IAAAk6I,EAAA7C,eACA,OAAAy8P,GAAAA,EAAA9zY,IAAAxsF,GASA6B,OAAA6kO,GACA,IAAA3N,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,QAAAhgW,KAAA0sD,KAAAjpE,OAAAi4I,EAAA7C,iBAIA74H,KAAAq1X,MAAA35P,IAEA,GAUA7kO,YAAA6kO,EAAA1mO,GACA,IAAA+4N,EAAA0N,SAAAC,GACA,MAAAujB,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,MAAAs1B,EAAAt1X,KAAA0sD,KAAAlrE,IAAAk6I,EAAA7C,eAEA,SAAAy8P,IAAAA,EAAA7xY,OAAAzuF,MAIAgrG,KAAAq1X,MAAA35P,EAAA1mO,IAEA,uJC9KA,aAEA,MAAAivU,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,gCAAA,CACA10P,MAAA00P,EAAA,sCAEAhlF,EAAA1rP,EAAA,YACAw6N,EAAAx6N,EAAA,WAEAohe,EAAAphe,EAAA,WAGAsoO,OAAAmkO,uBAAAA,IACAzsc,EAAA,aA6JAF,EAAAC,QAlJA,cAAAqhe,EAQA99d,YAAAoqZ,GAKA17R,MAAA,CACA07R,UAAAA,EACAhrT,UAAA,mBACA2+X,cAAA,YACAC,iBAAAnoU,GAAA7uD,MAAA4rD,KAAAiD,KAQA1sD,KAAA0sD,KAAA,IAAA1pE,IAYAnsF,IAAA6kO,EAAAmhF,GACA,IAAA9uF,EAAA0N,SAAAC,GAEA,MADArP,EAAA98I,MAAA,uDACA0vK,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,IAAAnjJ,EAEA,MADAxwF,EAAA98I,MAAA,4CACA0vK,EAAA,IAAAnmJ,MAAA,8BAAAknW,GAGA,MAAA/7W,EAAAy3I,EAAA7C,cACA48P,EAAAz1X,KAAA0sD,KAAAlrE,IAAAyC,GACAyxY,EAAA,IAAA/2Y,IAAAk+N,GAUA,OAAA44K,IAJAn8Y,EAIAo8Y,GAJA7uZ,EAIA4uZ,GAJAx4X,OAAA3jB,EAAA2jB,MAAA,IAAAp2B,GAAAkmC,OAAAr5G,GAAA4lF,EAAAyF,IAAArrF,OAKA24N,EAAA,uEAAApoI,KACA+b,OAGAA,KAAAg1X,SAAAt5P,EAAAg6P,GACArpQ,EAAA,iCAAApoI,KAEA+b,MAZA,IAAAn5B,EAAAyS,EAuBAziF,IAAA6kO,EAAAmhF,GACA,IAAA9uF,EAAA0N,SAAAC,GAEA,MADArP,EAAA98I,MAAA,uDACA0vK,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,IAAAnjJ,EAEA,MADAxwF,EAAA98I,MAAA,4CACA0vK,EAAA,IAAAnmJ,MAAA,8BAAAknW,GAGA,MAAA/7W,EAAAy3I,EAAA7C,cACA48P,EAAAz1X,KAAA0sD,KAAAlrE,IAAAyC,IAAA,IAAAtF,IACA+2Y,EAAA,IAAA/2Y,IAAA,IAAA82Y,KAAA54K,IAGA,OAAA44K,EAAAx4X,OAAAy4X,EAAAz4X,MACAovH,EAAA,0DAAApoI,KACA+b,OAGAA,KAAAg1X,SAAAt5P,EAAAg6P,GACArpQ,EAAA,gCAAApoI,KAEA+b,MAWAnpG,OAAA6kO,EAAAmhF,GACA,IAAA9uF,EAAA0N,SAAAC,GAEA,MADArP,EAAA98I,MAAA,uDACA0vK,EAAA,IAAAnmJ,MAAA,yCAAAknW,GAGA,IAAAnjJ,EAEA,MADAxwF,EAAA98I,MAAA,4CACA0vK,EAAA,IAAAnmJ,MAAA,8BAAAknW,GAGA,MAAA/7W,EAAAy3I,EAAA7C,cACA48P,EAAAz1X,KAAA0sD,KAAAlrE,IAAAyC,GAEA,GAAAwxY,EAAA,CACA,MAAAC,EAAA,IAAA/2Y,IAAA,IACA82Y,GACA1nZ,QAAA7G,IAAA21O,EAAApuO,SAAAvH,MAGA,GAAAuuZ,EAAAx4X,OAAAy4X,EAAAz4X,KACA,OAAA+C,KAGAA,KAAAg1X,SAAAt5P,EAAAg6P,GACArpQ,EAAA,kCAAApoI,KAGA,OAAA+b,4HCtKA,aA4DA3sG,EAAAC,QA/CA,SAAAqie,EAAAh6J,EAAAhnU,GAGA,MAAAwmU,EAAA,IAAAw6J,EAAAh6J,EAAAhnU,GAyCA,OAxCAwmU,EAAAy6J,kBAAAz6J,EAAAwiE,UACAxiE,EAAA06J,oBAAA16J,EAAA4hE,YAoCA5hE,EAAAwiE,UA1BA,SAAAU,EAAA9gO,GAEAA,GAAA49J,EAAAntP,GAAAqwT,EAAA9gO,GACA49J,EAAAy6J,kBAAAv3F,IAwBAljE,EAAA4hE,YAbA,SAAAsB,EAAA9gO,GACAA,EAGA49J,EAAA3lG,eAAA6oK,EAAA9gO,GAFA49J,EAAA1lG,mBAAA4oK,GAKA,IAAAljE,EAAA2M,cAAAu2D,IACAljE,EAAA06J,oBAAAx3F,IAOAljE,iCCzDA,aAEA,MAAA8I,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,gCAAA,CACA10P,MAAA00P,EAAA,uCAEApH,IAAAA,GAAAtpU,EAAA,wBACA4nT,UAAAA,GAAA5nT,EAAA,aACAw6N,EAAAx6N,EAAA,WAEA4tc,EAAA5tc,EAAA,OAEAuie,kBACAA,EAAAC,iBACAA,EAAAC,eACAA,EAAAC,mBACAA,EAAAC,mBACAA,GACA3ie,EAAA,aAEAiwY,UAAAA,GAAAjwY,EAAA,sBACAwtT,UAAAA,GAAAxtT,EAAA,mBAiYAF,EAAAC,QA9WA,cAAA6tc,EAKAtqc,aAAA6kO,OAAAA,EAAA6zJ,UAAAA,EAAA8nB,UAAAA,EAAA,IACA9xR,MAAA,CAAAm2G,OAAAA,IAKA17H,KAAAowR,WAAAb,EAKAvvR,KAAAm2X,YAAA,IAAAx3Y,IAOAqhB,KAAAo2X,eAAA,IAAApzY,IAEAgd,KAAAq3S,UAAAA,EACAr3S,KAAAq2X,cAAAr2X,KAAAq2X,cAAA19X,KAAAqH,MAQAnpG,cACAw1N,EAAA,yBAGArsH,KAAAhyB,GAAA,mBAAAgyB,KAAAq2X,eACAr2X,KAAAhyB,GAAA,oBAAAgyB,KAAAq2X,eACAr2X,KAAAhyB,GAAA,gBAAAgyB,KAAAs2X,kBACAt2X,KAAAhyB,GAAA,kBAAAgyB,KAAAu2X,uBAGA,UAAA,MAAAxgT,KAAA/1E,KAAAowR,WAAA1nL,MAAA,CAAA/9G,OAAAorY,UACA/1X,KAAAw2X,uBAAAzgT,GAGAs2C,EAAA,qBAQAx1N,aACAw1N,EAAA,yBACArsH,KAAAy1H,2BACAz1H,KAAAy2X,cACApqQ,EAAA,qBAUAx1N,eAAA6kO,OAAAA,IACA,MAAAg7P,EAAAh7P,EAAA7C,cAEAxM,EAAA,iBAAAqqQ,GACA12X,KAAAm2X,YAAAn3Y,IAAA03Y,GAEA12X,KAAAm2X,YAAAl5X,MAAA+C,KAAAq3S,WAEAr3S,KAAAy2X,cAAAv4X,OAAAzE,IACA4yH,EAAA98I,MAAA,wBAAAkqB,MAYA5iG,kBAAA6kO,OAAAA,IAEA,GAAAA,EAAAi7P,qBACA,OAGA,MAAAD,EAAAh7P,EAAA7C,cAEAxM,EAAA,qBAAAqqQ,GACA12X,KAAAm2X,YAAAn3Y,IAAA03Y,GAEA12X,KAAAm2X,YAAAl5X,MAAA+C,KAAAq3S,WAEAr3S,KAAAy2X,cAAAv4X,OAAAzE,IACA4yH,EAAA98I,MAAA,wBAAAkqB,MAaA5iG,uBAAA6kO,OAAAA,EAAA4tI,SAAAA,IACA,MAAAotH,EAAAh7P,EAAA7C,cAEAxM,EAAA,0BAAAqqQ,GACA12X,KAAAm2X,YAAAn3Y,IAAA03Y,GAGA,MAAAE,EAAA52X,KAAAo2X,eAAA50Y,IAAAk1Y,IAAA,IAAA/3Y,IACAi4Y,EAAA53Y,IAAAsqR,GACAtpQ,KAAAo2X,eAAA30Y,IAAAi1Y,EAAAE,GAEA52X,KAAAm2X,YAAAl5X,MAAA+C,KAAAq3S,WAEAr3S,KAAAy2X,cAAAv4X,OAAAzE,IACA4yH,EAAA98I,MAAA,wBAAAkqB,MAWA5iG,oBACA,MAAAgge,EAAAh5X,MAAA4rD,KAAAzpD,KAAAm2X,aAEA,IAAAU,EAAA5xZ,OACA,OAIA+6B,KAAAm2X,YAAA/oU,QAEAi/D,EAAA,uBACA,MAAAotK,EAAAz5R,KAAAowR,WAAAqJ,QACA,IAAA,MAAA41E,KAAAwnB,EAAA,CAEA,MAAAn7P,EAAA17H,KAAAkhT,QAAAx0P,KAAAlrE,IAAA6tX,IAAAthP,EAAA2M,cAAA20O,GAGArvW,KAAA82X,kBAAAp7P,EAAA+9J,IAGA/9J,EAAAi7P,sBAAA32X,KAAA+2X,cAAAr7P,EAAA+9J,GAGAz5R,KAAAg3X,mBAAAt7P,EAAA+9J,GAGAz5R,KAAAi3X,gBAAAv7P,EAAA+9J,SAGAA,EAAApgC,SACAhtI,EAAA,mBAUAx1N,kBAAA6kO,EAAA+9J,GACA,MAAAy9F,EAAAx7P,EAAAt9H,WACAppG,EAAA,IAAA6nU,EAAA,GAAAi5J,IAAAoB,KAEAnhT,EAAA/1E,KAAAmhT,YAAAz0P,KAAAlrE,IAAAk6I,EAAA7C,eAEA,IAEA,IAAA9iD,EAEA,YADA0jN,EAAAh2S,OAAAzuF,GAIA,MAAAmie,EAAA3zF,EAAAlgS,OAAA,CACAg+U,MAAAvrQ,EAAA6mJ,UAAAxyP,KAAA8zO,IAAA,CACAhwF,UAAAgwF,EAAAhwF,UAAAyK,MACA8xO,YAAAvsJ,EAAAusJ,gBAEA2sB,gBAAArhT,EAAAm5B,OACA,CACAw+I,IAAA33K,EAAAm5B,OAAAuiL,UACA3nS,IAAAisF,EAAAm5B,OAAAplH,UAEAp0F,IACA+jO,SAEAggK,EAAApoK,IAAAr8N,EAAAmie,GACA,MAAA19X,GACA4yH,EAAA98I,MAAAkqB,IAWA5iG,cAAA6kO,EAAA+9J,GACA,MAAAy9F,EAAAx7P,EAAAt9H,WACAppG,EAAA,IAAA6nU,EAAA,GAAAm5J,IAAAkB,KAEA,IAEA,IAAAx7P,EAAAlD,OAEA,YADAihK,EAAAh2S,OAAAzuF,GAIA,MAAAmie,EAAAz7P,EAAAnC,gBAEAkgK,EAAApoK,IAAAr8N,EAAAmie,GACA,MAAA19X,GACA4yH,EAAA98I,MAAAkqB,IAWA5iG,mBAAA6kO,EAAA+9J,GACA,MAAAy9F,EAAAx7P,EAAAt9H,WACAi5X,EAAAr3X,KAAAo2X,eAAA50Y,IAAAk6I,EAAA7C,gBAAA,GAEA,IACAw+P,EAAAjje,SAAAkje,IACA,MAAAtie,EAAA,IAAA6nU,EAAA,GAAAo5J,IAAAiB,KAAAI,KACAC,EAAAv3X,KAAAwhT,aAAAlyO,SAAAosD,EAAA47P,GAEAC,EACA99F,EAAApoK,IAAAr8N,EAAAuie,GAEA99F,EAAAh2S,OAAAzuF,MAGA,MAAAykG,GACA4yH,EAAA98I,MAAAkqB,IAWA5iG,gBAAA6kO,EAAA+9J,GACA,MAAAy9F,EAAAx7P,EAAAt9H,WACAppG,EAAA,IAAA6nU,EAAA,GAAAq5J,IAAAgB,KAEAr6K,EAAA78M,KAAAshT,UAAA9/T,IAAAk6I,GAEA,IAEA,IAAAmhF,EAEA,YADA48E,EAAAh2S,OAAAzuF,GAIA,MAAAmie,EAAAp2K,EAAAz9M,OAAA,CAAAu5M,UAAAA,IAAApjF,SAEAggK,EAAApoK,IAAAr8N,EAAAmie,GACA,MAAA19X,GACA4yH,EAAA98I,MAAAkqB,IAaA5iG,8BAAA7B,IAAAA,EAAAtB,MAAAA,IACA,IACA,MAAA8je,EAAAxie,EAAAopG,WAAAte,MAAA,KACA47I,EAAA3N,EAAA2M,cAAA88P,EAAA,IAEA,IAAAx+P,EACA,OAAAw+P,EAAA,IACA,IAAA,QACAx+P,EAAAwqK,EAAAp/R,OAAA1wG,GAGAssG,KAAAmhT,YAAA6zE,SACAt5P,EACA,CACAkhG,UAAA5jG,EAAAsoN,MAAAl3W,KAAA8zO,IAAA,CACAhwF,UAAA,IAAAitF,EAAA+C,EAAAhwF,WACAu8O,YAAAptX,QAAA6gO,EAAAusJ,iBAEAv7P,OAAA8pB,EAAAo+P,gBACA,CACAttY,IAAAkvI,EAAAo+P,gBAAAttY,IACA2nS,UAAAz4J,EAAAo+P,gBAAA1pI,UAEAh4V,GAEA,CAAAmjL,MAAA,IACA,MACA,IAAA,OACAmgD,QAAAjL,EAAA+M,iBAAApnO,GAGAssG,KAAAkhT,QAAA8zE,SACAh8P,EACAA,EACA,CAAAngD,MAAA,IACA,MACA,IAAA,WACA74E,KAAAwhT,aAAA+zE,UACA75P,EACA87P,EAAA,GACA9je,EACA,CAAAmlL,MAAA,IACA,MACA,IAAA,SACAmgD,EAAA+nF,EAAA38M,OAAA1wG,GAGAssG,KAAAshT,UAAA0zE,SACAt5P,EACA,IAAA/8I,IAAAq6I,EAAA6jF,WACA,CAAAhkI,MAAA,IACA,MACA,QACAwzC,EAAA,+BAAAr3N,EAAAopG,aAEA,MAAA3E,GACA4yH,EAAA98I,MAAAkqB,yMCjZA,aAEApmG,EAAAC,QAAAyie,iBAAA,UAGA1ie,EAAAC,QAAAwie,kBAAA,gBAGAzie,EAAAC,QAAA0ie,eAAA,eAGA3ie,EAAAC,QAAA2ie,mBAAA,mBAGA5ie,EAAAC,QAAA4ie,mBAAA,+CCbA,aAEA,IAAA50O,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,yBAAAN,EAAAM,MAAA,uBAAA,IAEA1mD,EAAAsoM,UAAA,WAkBA,SAAAA,EAAAt8T,GAEA,GADA84B,KAAAshV,MAAA,GACAp6W,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAoeA,OA3dAq8T,EAAA7lS,UAAA2jV,MAAA3/L,EAAA4D,WAQAi+I,EAAA7lS,UAAAy5X,gBAAA,KAWA5zF,EAAAlgS,OAAA,SAAApkB,EAAAulI,GAGA,GAFAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAoiW,OAAApiW,EAAAoiW,MAAAr8W,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAAoiW,MAAAr8W,SAAAkC,EACA+zH,EAAAsoM,UAAAi0F,QAAAn0X,OAAApkB,EAAAoiW,MAAAn6W,GAAAs9I,EAAAs9B,OAAA,IAAA6C,QAAAC,SAIA,OAFA,MAAA3lK,EAAAk4Y,iBAAA5je,OAAAgnG,eAAAoD,KAAA1e,EAAA,oBACAg8G,EAAAsoM,UAAAk0F,gBAAAp0X,OAAApkB,EAAAk4Y,gBAAA3yQ,EAAAs9B,OAAA,IAAA6C,QAAAC,SACApgC,GAcA++K,EAAAp/R,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAsoM,UACAx1R,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAoiW,OAAApiW,EAAAoiW,MAAAr8W,SACAia,EAAAoiW,MAAA,IACApiW,EAAAoiW,MAAAx2W,KAAAowH,EAAAsoM,UAAAi0F,QAAArzX,OAAA4J,EAAAA,EAAA+zI,WACA,MACA,KAAA,EACA7iK,EAAAk4Y,gBAAAl8R,EAAAsoM,UAAAk0F,gBAAAtzX,OAAA4J,EAAAA,EAAA+zI,UACA,MACA,QACA/zI,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAskT,EAAArhJ,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAsoM,UACA,OAAA5lQ,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAsoM,UACA,GAAA5lQ,EAAA0jT,MAAA,CACA,IAAAzjV,MAAA/gB,QAAA8gD,EAAA0jT,OACA,MAAAv8U,UAAA,oCACA7lB,EAAAoiW,MAAA,GACA,IAAA,IAAAn6W,EAAA,EAAAA,EAAAy2D,EAAA0jT,MAAAr8W,SAAAkC,EAAA,CACA,GAAA,iBAAAy2D,EAAA0jT,MAAAn6W,GACA,MAAA49B,UAAA,qCACA7lB,EAAAoiW,MAAAn6W,GAAA+zH,EAAAsoM,UAAAi0F,QAAAt1O,WAAAvkH,EAAA0jT,MAAAn6W,KAGA,GAAA,MAAAy2D,EAAAw5V,gBAAA,CACA,GAAA,iBAAAx5V,EAAAw5V,gBACA,MAAAryX,UAAA,+CACA7lB,EAAAk4Y,gBAAAl8R,EAAAsoM,UAAAk0F,gBAAAv1O,WAAAvkH,EAAAw5V,iBAEA,OAAAl4Y,GAYAskT,EAAAphJ,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAOA,IANAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAA0jT,MAAA,IAEApxQ,EAAAuiC,WACA70E,EAAAw5V,gBAAA,MAEAl4Y,EAAAoiW,OAAApiW,EAAAoiW,MAAAr8W,OAAA,CACA24D,EAAA0jT,MAAA,GACA,IAAA,IAAAhwV,EAAA,EAAAA,EAAApS,EAAAoiW,MAAAr8W,SAAAqsB,EACAssC,EAAA0jT,MAAAhwV,GAAA4pG,EAAAsoM,UAAAi0F,QAAAr1O,SAAAljK,EAAAoiW,MAAAhwV,GAAA4+E,GAMA,OAHA,MAAAhxF,EAAAk4Y,iBAAAl4Y,EAAAsb,eAAA,qBACAojC,EAAAw5V,gBAAAl8R,EAAAsoM,UAAAk0F,gBAAAt1O,SAAAljK,EAAAk4Y,gBAAAlnT,IAEAtyC,GAUA4lQ,EAAA7lS,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAmhJ,EAAAi0F,QAAA,WAkBA,SAAAA,EAAAvwZ,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAyIA,OAhIAswZ,EAAA95X,UAAAuwH,UAAAyzB,EAAAG,UAAA,IAQA21O,EAAA95X,UAAA8sW,aAAA,EAWAgtB,EAAAn0X,OAAA,SAAApkB,EAAAulI,GAOA,OANAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAgvI,WAAA16N,OAAAgnG,eAAAoD,KAAA1e,EAAA,cACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAgvI,WACA,MAAAhvI,EAAAurX,aAAAj3c,OAAAgnG,eAAAoD,KAAA1e,EAAA,gBACAulI,EAAAs9B,OAAA,IAAAkC,KAAA/kK,EAAAurX,aACAhmP,GAcAgzQ,EAAArzX,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAsoM,UAAAi0F,QACAzpX,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAgvI,UAAAlgH,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAurX,YAAAz8V,EAAAi2I,OACA,MACA,QACAj2I,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAu4Y,EAAAt1O,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAsoM,UAAAi0F,QACA,OAAA75V,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAsoM,UAAAi0F,QAUA,OATA,MAAA75V,EAAAswF,YACA,iBAAAtwF,EAAAswF,UACAyzB,EAAA99I,OAAAO,OAAAw5B,EAAAswF,UAAAhvI,EAAAgvI,UAAAyzB,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAswF,YAAA,GACAtwF,EAAAswF,UAAAjpJ,SACAia,EAAAgvI,UAAAtwF,EAAAswF,YAEA,MAAAtwF,EAAA6sU,cACAvrX,EAAAurX,YAAAptX,QAAAugD,EAAA6sU,cAEAvrX,GAYAu4Y,EAAAr1O,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAiBA,OAhBAsyC,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAAswF,UAAA,IAEAtwF,EAAAswF,UAAA,GACAh+C,EAAAyoD,QAAA96H,QACA+/B,EAAAswF,UAAAyzB,EAAAG,UAAAlkH,EAAAswF,aAEAtwF,EAAA6sU,aAAA,GAEA,MAAAvrX,EAAAgvI,WAAAhvI,EAAAsb,eAAA,eACAojC,EAAAswF,UAAAh+C,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAgvI,UAAA,EAAAhvI,EAAAgvI,UAAAjpJ,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAgvI,WAAAhvI,EAAAgvI,WAEA,MAAAhvI,EAAAurX,aAAAvrX,EAAAsb,eAAA,iBACAojC,EAAA6sU,YAAAvrX,EAAAurX,aAEA7sU,GAUA65V,EAAA95X,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAo1O,EA/JA,GAkKAj0F,EAAAk0F,gBAAA,WAkBA,SAAAA,EAAAxwZ,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAuJA,OA9IAuwZ,EAAA/5X,UAAA+vP,IAAA/rG,EAAAqE,KAAArE,EAAAqE,KAAAW,SAAA,EAAA,GAAA,GAAA,EAQA+wO,EAAA/5X,UAAA7T,IAAA63J,EAAAG,UAAA,IAWA41O,EAAAp0X,OAAA,SAAApkB,EAAAulI,GAOA,OANAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAwuQ,KAAAl6V,OAAAgnG,eAAAoD,KAAA1e,EAAA,QACAulI,EAAAs9B,OAAA,GAAA8B,OAAA3kK,EAAAwuQ,KACA,MAAAxuQ,EAAA4K,KAAAt2F,OAAAgnG,eAAAoD,KAAA1e,EAAA,QACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAA4K,KACA26H,GAcAizQ,EAAAtzX,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAsoM,UAAAk0F,gBACA1pX,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAwuQ,IAAA1/O,EAAA61I,SACA,MACA,KAAA,EACA3kK,EAAA4K,IAAAkkB,EAAA2qH,QACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAw4Y,EAAAv1O,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAsoM,UAAAk0F,gBACA,OAAA95V,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAsoM,UAAAk0F,gBAiBA,OAhBA,MAAA95V,EAAA8vN,MACA/rG,EAAAqE,MACA9mK,EAAAwuQ,IAAA/rG,EAAAqE,KAAAm5G,UAAAvhO,EAAA8vN,MAAAjnG,UAAA,EACA,iBAAA7oH,EAAA8vN,IACAxuQ,EAAAwuQ,IAAAtnR,SAAAw3D,EAAA8vN,IAAA,IACA,iBAAA9vN,EAAA8vN,IACAxuQ,EAAAwuQ,IAAA9vN,EAAA8vN,IACA,iBAAA9vN,EAAA8vN,MACAxuQ,EAAAwuQ,IAAA,IAAA/rG,EAAAiB,SAAAhlH,EAAA8vN,IAAAz/O,MAAA,EAAA2vB,EAAA8vN,IAAAx/O,OAAA,GAAAlP,UAAA,KAEA,MAAA4+B,EAAA9zC,MACA,iBAAA8zC,EAAA9zC,IACA63J,EAAA99I,OAAAO,OAAAw5B,EAAA9zC,IAAA5K,EAAA4K,IAAA63J,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA9zC,MAAA,GACA8zC,EAAA9zC,IAAA7kB,SACAia,EAAA4K,IAAA8zC,EAAA9zC,MAEA5K,GAYAw4Y,EAAAt1O,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GACA,GAAAsyC,EAAAuiC,SAAA,CACA,GAAAkvC,EAAAqE,KAAA,CACA,IAAA/xP,EAAA,IAAA0tP,EAAAqE,KAAA,EAAA,GAAA,GACApoH,EAAA8vN,IAAAx9K,EAAA+2E,QAAA5gL,OAAApyE,EAAAmqG,WAAA8xE,EAAA+2E,QAAA9gL,OAAAlyE,EAAA+qG,WAAA/qG,OAEA2pI,EAAA8vN,IAAAx9K,EAAA+2E,QAAA5gL,OAAA,IAAA,EACA6pG,EAAAyoD,QAAAtyJ,OACAu3D,EAAA9zC,IAAA,IAEA8zC,EAAA9zC,IAAA,GACAomF,EAAAyoD,QAAA96H,QACA+/B,EAAA9zC,IAAA63J,EAAAG,UAAAlkH,EAAA9zC,OAYA,OATA,MAAA5K,EAAAwuQ,KAAAxuQ,EAAAsb,eAAA,SACA,iBAAAtb,EAAAwuQ,IACA9vN,EAAA8vN,IAAAx9K,EAAA+2E,QAAA5gL,OAAAA,OAAA6Y,EAAAwuQ,KAAAxuQ,EAAAwuQ,IAEA9vN,EAAA8vN,IAAAx9K,EAAA+2E,QAAA5gL,OAAAs7K,EAAAqE,KAAAroJ,UAAAS,SAAAR,KAAA1e,EAAAwuQ,KAAAx9K,EAAA+2E,QAAA9gL,OAAA,IAAAw7K,EAAAiB,SAAA1jK,EAAAwuQ,IAAAz/O,MAAA,EAAA/uB,EAAAwuQ,IAAAx/O,OAAA,GAAAlP,UAAA,GAAA9f,EAAAwuQ,KAEA,MAAAxuQ,EAAA4K,KAAA5K,EAAAsb,eAAA,SACAojC,EAAA9zC,IAAAomF,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAA4K,IAAA,EAAA5K,EAAA4K,IAAA7kB,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAA4K,KAAA5K,EAAA4K,KAEA8zC,GAUA85V,EAAA/5X,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAq1O,EA7KA,GAgLAl0F,EA3fA,GA8fAnwY,EAAAC,QAAA4nM,4DCxgBA,aAEA,IAAAomD,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,uBAAAN,EAAAM,MAAA,qBAAA,IAEA1mD,EAAA6lH,UAAA,WAiBA,SAAAA,EAAA75O,GAEA,GADA84B,KAAA68M,UAAA,GACA31O,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAwHA,OA/GA45O,EAAApjN,UAAAk/M,UAAAl7D,EAAA4D,WAWAw7D,EAAAz9M,OAAA,SAAApkB,EAAAulI,GAGA,GAFAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAA29N,WAAA39N,EAAA29N,UAAA53O,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAA29N,UAAA53O,SAAAkC,EACAs9I,EAAAs9B,OAAA,IAAApmJ,OAAAzc,EAAA29N,UAAA11O,IAEA,OAAAs9I,GAcAs8F,EAAA38M,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAA6lH,UACA/yM,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAA29N,WAAA39N,EAAA29N,UAAA53O,SACAia,EAAA29N,UAAA,IACA39N,EAAA29N,UAAA/xO,KAAAkjC,EAAArS,UACA,MACA,QACAqS,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWA6hO,EAAA5+D,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAA6lH,UACA,OAAAnjL,EACA,IAAA1+C,EAAA,IAAAg8G,EAAA6lH,UACA,GAAAnjL,EAAAi/K,UAAA,CACA,IAAAh/M,MAAA/gB,QAAA8gD,EAAAi/K,WACA,MAAA93M,UAAA,wCACA7lB,EAAA29N,UAAA,GACA,IAAA,IAAA11O,EAAA,EAAAA,EAAAy2D,EAAAi/K,UAAA53O,SAAAkC,EACA+X,EAAA29N,UAAA11O,GAAAd,OAAAu3D,EAAAi/K,UAAA11O,IAGA,OAAA+X,GAYA6hO,EAAA3+D,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAIA,IAHAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAAi/K,UAAA,IAEA39N,EAAA29N,WAAA39N,EAAA29N,UAAA53O,OAAA,CACA24D,EAAAi/K,UAAA,GACA,IAAA,IAAAvrN,EAAA,EAAAA,EAAApS,EAAA29N,UAAA53O,SAAAqsB,EACAssC,EAAAi/K,UAAAvrN,GAAApS,EAAA29N,UAAAvrN,GAGA,OAAAssC,GAUAmjL,EAAApjN,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGA0+D,EA9IA,GAiJA1tT,EAAAC,QAAA4nM,4DC5JA,aAEA,MAAA+oI,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,oBAAA,CACA10P,MAAA00P,EAAA,0BAEAhlF,EAAA1rP,EAAA,aAGAsoO,OAAAmkO,uBAAAA,IACAzsc,EAAA,YACAk5b,EAAAl5b,EAAA,kCAmHAF,EAAAC,QAlGA,MAOAuD,aAAAoqZ,UAAAA,EAAAm9B,kBAAAA,IAEAp+U,KAAAihT,UAAAA,EAEAjhT,KAAAo+U,kBAAAA,EAOAp+U,KAAA23X,WAAA,IAAA30Y,IAIAgd,KAAA43X,aAAAlie,EAEAsqG,KAAAotV,cAAAptV,KAAAotV,cAAAz0V,KAAAqH,MACAA,KAAAo+U,kBAAApwW,GAAA,kBAAAgyB,KAAAotV,eAMApjK,aACA,OAAAhqL,KAAA43X,QAMA5tM,WAAAA,GACAhqL,KAAA43X,QAAA5tM,EASAnzR,cAAA6kO,GACA,OAAA17H,KAAAo+U,kBAAA58V,IAAAk6I,GASA7kO,SAAAgzb,GACA,IAAA4C,EAAAorC,WAAAhuC,GAEA,MADAx9N,EAAA98I,MAAA,uDACA0vK,EAAA,IAAAnmJ,MAAA,uDAAAknW,GAIA,MAAA/7W,GAAA,IAAAre,KAAAwoC,UAAAhQ,SAAA,IAAAL,KAAAunE,MAOA,OALAtlE,KAAA23X,WAAAl2Y,IAAAwC,EAAA4lW,GAGAA,EAAAP,UAAAtpV,KAEA/b,EASAptF,WAAAotF,GACA,OAAA+b,KAAA23X,WAAAl0Y,OAAAQ,GASAptF,cAAAozb,GACA,IAAA,MAAA,CAAAJ,KAAA7pV,KAAA23X,WACA9tC,EAAAvjO,WAAA2jO,EAAAC,sICzHA,aAEA,MAAAjmH,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,eAAA,CACA10P,MAAA00P,EAAA,qBAEAnnB,EAAAvpT,EAAA,YAEAy6N,EAAAz6N,EAAA,kBACAk1U,KAAAA,GAAAl1U,EAAA,YAEAqhS,SAAAA,GAAArhS,EAAA,cACA24Q,QAAAA,EAAAgtF,KAAAA,GAAA3lW,EAAA,uBACAymO,EAAAzmO,EAAA,uBAEAuke,SAAAA,EAAAC,YAAAA,GAAAxke,EAAA,gBA4DAD,EAAAD,EAAAC,QA5CAggJ,eAAArsE,EAAA6yW,GAEAztN,EAAA,mBAAAyrQ,EAAAh+C,EAAAjhN,YAAAihN,EAAAjhN,cAAAihN,GAEA,MAAAmQ,QAAAhjX,EAAAulY,KAAA1yB,IACAtpN,OAAAA,SAAAy5N,EAAAO,UAAAstC,GAEA9iZ,EAAA+oB,KAAAunE,MACA5Y,EAAAshE,EAAA+gD,YAAAgpN,IAEAntZ,SAAA69P,EACA,CAAA/7K,GACA8jE,GACAA,GAAA0oI,EAAA,EAAA1oI,IACAokE,EACA1oB,GAEAlnM,EAAA+4B,KAAAunE,MAEA,IAAA00D,EAAAttE,EAAA9hF,GACA,MAAAkyO,EAAA,IAAAhkN,MAAA,2BAAA,sBAGA,OAAA9zB,EAAAgQ,IAsBA5hF,MAdA,SAAA6zE,GACAA,EAAA+iN,OAAA8tM,GAAA,EAAAtnQ,OAAAA,KAAAi4G,EAAAj4G,EAAAA,MAcAl9N,EAAA8pL,QANA,SAAAn2G,GACAA,EAAA+wZ,SAAAF,iNCxEA,0BAEQ70O,GAAW1vP,EAAQ,UACrB+wU,EAAa/wU,EAAQ,iBAE3BF,EAAOC,QAAUggJ,gBAAkBv+D,mBAChBuE,KAAKvE,EAChBkuK,EAAO8H,SAASzxK,SACZA,EACGgrP,EAAWosE,aAAap3T,SAC3BA,EAAElU,cAEF69K,EAAOx5F,KAAKnwE,IAKxBjmF,EAAOC,QAAQshS,SAAWvhS,EAAOC,QAEjCD,EAAOC,QAAQ2ke,OAAS3kV,gBAAkBv+D,mBACvBuE,KAAKvE,EAChBkuK,EAAO8H,SAASzxK,aACRgrP,GAAaoqE,OAAOp1T,GACrBgrP,EAAWosE,aAAap3T,SAC3BA,YAEIgrP,GAAaoqE,OAAOzrJ,EAAOx5F,KAAKnwE,yEC1BhD,aAEAjmF,EAAAC,QAAA,CACAwke,SAAA,mBACAC,YAAA,kCCJA,aAEA,MAAA9zJ,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,mBAAA,CACA10P,MAAA00P,EAAA,yBAEAnnB,EAAAvpT,EAAA,YACAi6b,EAAAj6b,EAAA,uBACAk1U,KAAAA,GAAAl1U,EAAA,YACA24Q,QAAAA,EAAAgtF,KAAAA,EAAAhxB,QAAAA,GAAA30U,EAAA,uBACA6kO,EAAA7kO,EAAA,2BAEAw6N,EAAAx6N,EAAA,YACA4nT,UAAAA,GAAA5nT,EAAA,cAEAqhS,SAAAA,GAAArhS,EAAA,aAEA4wW,EAAA5wW,EAAA,aAEAosb,EAAApsb,EAAA,sBACA+5c,EAAA/5c,EAAA,0BAEAy2c,oBACAA,EAAAC,yBACAA,EAAAF,iBACAA,GACAx2c,EAAA,aAEAsoO,MAAAA,GAAAtoO,EAAA,aAYA,MAAAguc,EAMA1qc,aAAA8kU,OAAAA,IACA37N,KAAA0iV,QAAA/mH,EACA37N,KAAAihT,UAAAtlF,EAAAslF,UACAjhT,KAAA6hW,eAAAlmI,EAAAkmI,eACA7hW,KAAAo+U,kBAAAziH,EAAAyiH,kBACAp+U,KAAA07H,OAAAigG,EAAAjgG,OAEA17H,KAAAmjW,cAAAnjW,KAAAmjW,cAAAxqW,KAAAqH,MAGAA,KAAAk4X,MAAA,CACAl3E,gBAAA+oD,KACApuI,EAAAh6J,SAAAn8D,MAGAxF,KAAAihT,UAAAO,aAAA//T,IAAAue,KAAA07H,OAAA,eAAAtD,EAAAp4H,KAAAk4X,MAAA1sQ,eACAxrH,KAAAihT,UAAAO,aAAA//T,IAAAue,KAAA07H,OAAA,kBAAAtD,EAAAp4H,KAAAk4X,MAAAl3E,kBAEAhhT,KAAAo+U,kBAAApwW,GAAA,gBAAAi8W,IACAjqV,KAAAm4X,SAAAluC,GAAA/rV,MAAAmuH,EAAA98I,UAIAywB,KAAAihT,UAAAjzU,GAAA,qBAAA,EAAA0tJ,OAAAA,MACAA,EAAAt9H,aAAA4B,KAAA07H,OAAAt9H,YACA4B,KAAAo4X,qBAKAp4X,KAAAihT,UAAAjzU,GAAA,oBAAA,EAAA0tJ,OAAAA,MACAA,EAAAt9H,aAAA4B,KAAA07H,OAAAt9H,YACA4B,KAAAo4X,qBAWAvhe,WAAAktc,GACA,MAAAzd,QAAAtmV,KAAAihT,UAAAE,YAAAunC,eAAA1oV,KAAA07H,QACA28P,EAAAr4X,KAAA0iV,QAAArhC,WAAAj3U,KAAAk5T,GAAAA,EAAA3qK,QACAkkF,EAAA78M,KAAAihT,UAAAK,UAAA9/T,IAAAwe,KAAA07H,SAAA,GAEA48P,EAAAv0B,EAAA35X,KAAAkpE,MAAAA,IACA,IACA,MAAAk9E,OAAAA,SAAAy5N,EAAAO,UAAAyf,SAEAxhI,EACA,CAAA07B,EAAAo0H,SAAAj1X,OAAA,CACA+0X,YAAAA,EACA/xC,iBAAAA,EACAzpI,UAAAA,IACApjF,UACA+zN,EAAAlqV,SACAktH,EACA03G,GAEA,MAAAzuO,GAEA4yH,EAAA98I,MAAA,yCAAAkqB,OAIA,OAAAssE,QAAA2gD,IAAA4xQ,GAQAzhe,kBAEA,IAAAmpG,KAAA0iV,QAAAt6E,YACA,OAGA,MAAA27F,EAAA,GACA,IAAA9Z,EACA,IAAA,MAAAnQ,KAAA95U,KAAAihT,UAAAxe,MAAArlS,SACA08U,EAAAj9H,UAAApuO,SAAAw7X,KAAAhgB,EAAAjqV,KAAAo+U,kBAAA58V,IAAAs4V,EAAA71V,MACA8/W,EAAAj5X,KAAAm/W,GAIAjqV,KAAAl1B,KAAAi5X,GAYAltc,eAAAozb,GACA,MAAAz5N,OAAAA,SAAAy5N,EAAAO,UAAAwf,IACAt9S,SAAA+7K,EACA,GACAj4G,EACAg9N,EAAAppV,SACA80P,EAAA,GACAtkE,EACA1oB,GAGA,IAAAx/G,EACA,MAAAowJ,EAAA,IAAAhkN,MAAA,8BAAA+iI,EAAAsjO,sBAGA,IAAAxlX,EACA,IACAA,EAAAwqR,EAAAo0H,SAAAn0X,OAAAsoD,GACA,MAAAjzD,GACA,MAAAqjN,EAAArjN,EAAAoiI,EAAAkkO,qBAGA,MAAArtL,UACAA,EAAA2lN,YACAA,EAAAx7K,UACAA,EAAA27K,aACAA,EAAAlyC,iBACAA,GACA3sW,EAEAsK,QAAA8pI,EAAA+M,iBAAA43C,GAEA,GAAAu3K,EAAAC,WAAArxN,gBAAA50I,EAAA40I,cACA,MAAAikF,EAAA,IAAAhkN,MAAA,oDAAA+iI,EAAAokO,kBAIA,MAAAw4B,EAAAl3B,EAAAm3B,kBAAAF,GAEA,IACA,MAAAjyC,QAAA5G,EAAA6G,eAAAF,EAAAgnB,EAAAK,QACA,GAAA3tW,KAAAihT,UAAAE,YAAAulC,kBAAAH,GAIA,OAHAvmV,KAAAihT,UAAAK,UAAA7/T,IAAAwC,EAAA44N,GACA78M,KAAAihT,UAAAO,aAAA//T,IAAAwC,EAAA,eAAAm0I,EAAAz+I,EAAA6xI,oBACAxrH,KAAAihT,UAAAO,aAAA//T,IAAAwC,EAAA,kBAAAm0I,EAAAz+I,EAAAqnU,kBAGA,MAAAvnT,GACA4yH,EAAA,iFAAA5yH,GAIA,IACAuG,KAAAihT,UAAAE,YAAA1/T,IAAAwC,EAAAo0Y,EAAAjuZ,KAAA4yO,GAAA,IAAA7B,EAAA6B,MACA,MAAAvjN,GACA4yH,EAAA98I,MAAA,yBAAAkqB,GAGAuG,KAAAihT,UAAAK,UAAA7/T,IAAAwC,EAAA44N,GACA78M,KAAAihT,UAAAO,aAAA//T,IAAAwC,EAAA,eAAAm0I,EAAAz+I,EAAA6xI,eACAxrH,KAAAihT,UAAAO,aAAA//T,IAAAwC,EAAA,kBAAAm0I,EAAAz+I,EAAAqnU,kBAGA30L,EAAA,kCAAAosQ,GAaA5he,eAAAozb,WAAAA,EAAAz5N,OAAAA,EAAAjlB,SAAAA,IACA,OAAAA,GACA,KAAAy+P,EACA,OAAAhqW,KAAA24X,gBAAA,CAAA1uC,WAAAA,EAAAz5N,OAAAA,IACA,KAAAy5O,EACA,OAAAjqW,KAAA44X,YAAA,CAAA3uC,WAAAA,EAAAz5N,OAAAA,IACA,QACAnE,EAAA98I,MAAA,oCAAAg8H,IAcA10M,uBAAAozb,WAAAA,EAAAz5N,OAAAA,IACA,IAAAkiD,EAAA,IAAAj6C,WAAA,GACAz4H,KAAA07H,OAAAlD,SACAk6C,EAAA1yK,KAAA07H,OAAAlD,OAAAG,OAGA,MAAA2tN,QAAAtmV,KAAAihT,UAAAE,YAAAunC,eAAA1oV,KAAA07H,QACAmhF,EAAA78M,KAAAihT,UAAAK,UAAA9/T,IAAAwe,KAAA07H,SAAA,GAEA/hJ,EAAAwqR,EAAAo0H,SAAAj1X,OAAA,CACA09S,gBAAAhhT,KAAAk4X,MAAAl3E,gBACAx1L,aAAAxrH,KAAAk4X,MAAA1sQ,aACAknD,UAAAA,EACA2lN,YAAAr4X,KAAA0iV,QAAArhC,WAAAj3U,KAAAk5T,GAAAA,EAAA3qK,QACA2tN,iBAAAA,EACAkyC,aAAAvuC,EAAAiP,WAAAvgO,MACAkkF,UAAAA,IACApjF,SAEA,UACAgvG,EACA,CAAA9uP,GACA6zW,EAAAlqV,SACAktH,EACA03G,GAEA,MAAAzuO,GACA4yH,EAAA98I,MAAA,wCAAAkqB,IAaA5iG,mBAAAozb,WAAAA,EAAAz5N,OAAAA,IACA,IAAA72I,EACA,IACA,MAAA+yE,SAAA+7K,EACA,GACAj4G,EACAg9N,EAAAppV,SACA80P,EAAA,GACAtkE,EACA1oB,GAEAvyL,EAAAwqR,EAAAo0H,SAAAn0X,OAAAsoD,GACA,MAAAjzD,GACA,OAAA4yH,EAAA98I,MAAA,2BAAAkqB,GAGA,MAAAxV,EAAAgmW,EAAAC,WAEA,IACA,MAAA3D,QAAA5G,EAAA6G,eAAA7sW,EAAA2sW,iBAAAgnB,EAAAK,QACA,GAAA3tW,KAAAihT,UAAAE,YAAAulC,kBAAAH,GAEA,YADAvmV,KAAAihT,UAAAK,UAAA7/T,IAAAwC,EAAAtK,EAAAkjO,WAGA,MAAApjN,GACA4yH,EAAA,iFAAA5yH,GAIA,IACAuG,KAAAihT,UAAAE,YAAA1/T,IAAAwC,EACAtK,EAAA0+Y,YAAAjuZ,KAAA4yO,GAAA,IAAA7B,EAAA6B,MACA,MAAAvjN,GACA4yH,EAAA98I,MAAA,yBAAAkqB,GAIAuG,KAAAihT,UAAAK,UAAA7/T,IAAAwC,EAAAtK,EAAAkjO,WASAhmT,yBAAAmmT,GACA,GAAAA,GAAAA,EAAA/3O,OAAA,EACA,IACA,OAAA,IAAAk2O,EAAA6B,GACA,MAAA7hO,GACA,OAAA,KAGA,OAAA,MASA,MAAA0kW,EAAA,CACAg5C,SAAA7uB,EACA8uB,cAAA7uB,GAGA1I,EAAA1hB,YAAAA,EACA0hB,EAAAw3B,SAAA50H,EAEA9wW,EAAAC,QAAAiuc,+VCnWA,aAEA,IAAAjgN,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,qBAAAN,EAAAM,MAAA,mBAAA,IAEA1mD,EAAAq9R,SAAA,WAuBA,SAAAA,EAAArxZ,GAGA,GAFA84B,KAAAq4X,YAAA,GACAr4X,KAAA68M,UAAA,GACA31O,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA4RA,OAnRAoxZ,EAAA56X,UAAAqjT,gBAAA,GAQAu3E,EAAA56X,UAAA6tH,aAAA,GAQA+sQ,EAAA56X,UAAA+0K,UAAA/wB,EAAAG,UAAA,IAQAy2O,EAAA56X,UAAA06X,YAAA12O,EAAA4D,WAQAgzO,EAAA56X,UAAA66X,aAAA72O,EAAAG,UAAA,IAQAy2O,EAAA56X,UAAAk/M,UAAAl7D,EAAA4D,WAQAgzO,EAAA56X,UAAA2oV,iBAAA3kM,EAAAG,UAAA,IAWAy2O,EAAAj1X,OAAA,SAAApkB,EAAAulI,GAKA,GAJAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAwzL,WAAAl/Q,OAAAgnG,eAAAoD,KAAA1e,EAAA,cACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAwzL,WACA,MAAAxzL,EAAAm5Y,aAAAn5Y,EAAAm5Y,YAAApzZ,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAAm5Y,YAAApzZ,SAAAkC,EACAs9I,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAm5Y,YAAAlxZ,IAEA,GAAA,MAAA+X,EAAA29N,WAAA39N,EAAA29N,UAAA53O,OACA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAA29N,UAAA53O,SAAAkC,EACAs9I,EAAAs9B,OAAA,IAAApmJ,OAAAzc,EAAA29N,UAAA11O,IAUA,OARA,MAAA+X,EAAAs5Y,cAAAhle,OAAAgnG,eAAAoD,KAAA1e,EAAA,iBACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAs5Y,cACA,MAAAt5Y,EAAA8hU,iBAAAxtZ,OAAAgnG,eAAAoD,KAAA1e,EAAA,oBACAulI,EAAAs9B,OAAA,IAAApmJ,OAAAzc,EAAA8hU,iBACA,MAAA9hU,EAAAssI,cAAAh4N,OAAAgnG,eAAAoD,KAAA1e,EAAA,iBACAulI,EAAAs9B,OAAA,IAAApmJ,OAAAzc,EAAAssI,cACA,MAAAtsI,EAAAonW,kBAAA9yb,OAAAgnG,eAAAoD,KAAA1e,EAAA,qBACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAonW,kBACA7hO,GAcA8zQ,EAAAn0X,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAq9R,SACAvqX,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAA8hU,gBAAAhzS,EAAArS,SACA,MACA,KAAA,EACAzc,EAAAssI,aAAAx9G,EAAArS,SACA,MACA,KAAA,EACAzc,EAAAwzL,UAAA1kK,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAm5Y,aAAAn5Y,EAAAm5Y,YAAApzZ,SACAia,EAAAm5Y,YAAA,IACAn5Y,EAAAm5Y,YAAAvtZ,KAAAkjC,EAAA2qH,SACA,MACA,KAAA,EACAz5I,EAAAs5Y,aAAAxqX,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAA29N,WAAA39N,EAAA29N,UAAA53O,SACAia,EAAA29N,UAAA,IACA39N,EAAA29N,UAAA/xO,KAAAkjC,EAAArS,UACA,MACA,KAAA,EACAzc,EAAAonW,iBAAAt4U,EAAA2qH,QACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAq5Y,EAAAp2O,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAq9R,SACA,OAAA36V,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAq9R,SAaA,GAZA,MAAA36V,EAAAojR,kBACA9hU,EAAA8hU,gBAAA36U,OAAAu3D,EAAAojR,kBAEA,MAAApjR,EAAA4tF,eACAtsI,EAAAssI,aAAAnlJ,OAAAu3D,EAAA4tF,eAEA,MAAA5tF,EAAA80I,YACA,iBAAA90I,EAAA80I,UACA/wB,EAAA99I,OAAAO,OAAAw5B,EAAA80I,UAAAxzL,EAAAwzL,UAAA/wB,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA80I,YAAA,GACA90I,EAAA80I,UAAAztM,SACAia,EAAAwzL,UAAA90I,EAAA80I,YAEA90I,EAAAy6V,YAAA,CACA,IAAAx6X,MAAA/gB,QAAA8gD,EAAAy6V,aACA,MAAAtzX,UAAA,yCACA7lB,EAAAm5Y,YAAA,GACA,IAAA,IAAAlxZ,EAAA,EAAAA,EAAAy2D,EAAAy6V,YAAApzZ,SAAAkC,EACA,iBAAAy2D,EAAAy6V,YAAAlxZ,GACAw6K,EAAA99I,OAAAO,OAAAw5B,EAAAy6V,YAAAlxZ,GAAA+X,EAAAm5Y,YAAAlxZ,GAAAw6K,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAy6V,YAAAlxZ,KAAA,GACAy2D,EAAAy6V,YAAAlxZ,GAAAlC,SACAia,EAAAm5Y,YAAAlxZ,GAAAy2D,EAAAy6V,YAAAlxZ,IASA,GANA,MAAAy2D,EAAA46V,eACA,iBAAA56V,EAAA46V,aACA72O,EAAA99I,OAAAO,OAAAw5B,EAAA46V,aAAAt5Y,EAAAs5Y,aAAA72O,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA46V,eAAA,GACA56V,EAAA46V,aAAAvzZ,SACAia,EAAAs5Y,aAAA56V,EAAA46V,eAEA56V,EAAAi/K,UAAA,CACA,IAAAh/M,MAAA/gB,QAAA8gD,EAAAi/K,WACA,MAAA93M,UAAA,uCACA7lB,EAAA29N,UAAA,GACA,IAAA11O,EAAA,EAAAA,EAAAy2D,EAAAi/K,UAAA53O,SAAAkC,EACA+X,EAAA29N,UAAA11O,GAAAd,OAAAu3D,EAAAi/K,UAAA11O,IASA,OANA,MAAAy2D,EAAA0oT,mBACA,iBAAA1oT,EAAA0oT,iBACA3kM,EAAA99I,OAAAO,OAAAw5B,EAAA0oT,iBAAApnW,EAAAonW,iBAAA3kM,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA0oT,mBAAA,GACA1oT,EAAA0oT,iBAAArhX,SACAia,EAAAonW,iBAAA1oT,EAAA0oT,mBAEApnW,GAYAq5Y,EAAAn2O,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAiCA,IAhCAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAAy6V,YAAA,GACAz6V,EAAAi/K,UAAA,IAEA3sI,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA80I,UAAA,IAEA90I,EAAA80I,UAAA,GACAxiG,EAAAyoD,QAAA96H,QACA+/B,EAAA80I,UAAA/wB,EAAAG,UAAAlkH,EAAA80I,aAEAxiG,EAAAyoD,QAAAtyJ,OACAu3D,EAAA46V,aAAA,IAEA56V,EAAA46V,aAAA,GACAtoT,EAAAyoD,QAAA96H,QACA+/B,EAAA46V,aAAA72O,EAAAG,UAAAlkH,EAAA46V,gBAEA56V,EAAAojR,gBAAA,GACApjR,EAAA4tF,aAAA,GACAt7C,EAAAyoD,QAAAtyJ,OACAu3D,EAAA0oT,iBAAA,IAEA1oT,EAAA0oT,iBAAA,GACAp2Q,EAAAyoD,QAAA96H,QACA+/B,EAAA0oT,iBAAA3kM,EAAAG,UAAAlkH,EAAA0oT,qBAGA,MAAApnW,EAAAwzL,WAAAxzL,EAAAsb,eAAA,eACAojC,EAAA80I,UAAAxiG,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAwzL,UAAA,EAAAxzL,EAAAwzL,UAAAztM,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAwzL,WAAAxzL,EAAAwzL,WAEAxzL,EAAAm5Y,aAAAn5Y,EAAAm5Y,YAAApzZ,OAAA,CACA24D,EAAAy6V,YAAA,GACA,IAAA,IAAA/mY,EAAA,EAAAA,EAAApS,EAAAm5Y,YAAApzZ,SAAAqsB,EACAssC,EAAAy6V,YAAA/mY,GAAA4+E,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAm5Y,YAAA/mY,GAAA,EAAApS,EAAAm5Y,YAAA/mY,GAAArsB,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAm5Y,YAAA/mY,IAAApS,EAAAm5Y,YAAA/mY,GAGA,GAAApS,EAAA29N,WAAA39N,EAAA29N,UAAA53O,OAAA,CACA24D,EAAAi/K,UAAA,GACA,IAAAvrN,EAAA,EAAAA,EAAApS,EAAA29N,UAAA53O,SAAAqsB,EACAssC,EAAAi/K,UAAAvrN,GAAApS,EAAA29N,UAAAvrN,GAeA,OAZA,MAAApS,EAAAs5Y,cAAAt5Y,EAAAsb,eAAA,kBACAojC,EAAA46V,aAAAtoT,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAs5Y,aAAA,EAAAt5Y,EAAAs5Y,aAAAvzZ,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAs5Y,cAAAt5Y,EAAAs5Y,cAEA,MAAAt5Y,EAAA8hU,iBAAA9hU,EAAAsb,eAAA,qBACAojC,EAAAojR,gBAAA9hU,EAAA8hU,iBAEA,MAAA9hU,EAAAssI,cAAAtsI,EAAAsb,eAAA,kBACAojC,EAAA4tF,aAAAtsI,EAAAssI,cAEA,MAAAtsI,EAAAonW,kBAAApnW,EAAAsb,eAAA,sBACAojC,EAAA0oT,iBAAAp2Q,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAonW,iBAAA,EAAApnW,EAAAonW,iBAAArhX,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAonW,kBAAApnW,EAAAonW,kBAEA1oT,GAUA26V,EAAA56X,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAk2O,EAzTA,GA4TAlle,EAAAC,QAAA4nM,0DCvUA,aAGA,MAAA89R,EAAAzle,EAAA,mBACA0wU,EAAA1wU,EAAA,UACA+ta,UAAAA,GAAA/ta,EAAA,kBACA4nT,UAAAA,GAAA5nT,EAAA,aACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,cAAA,CACA10P,MAAA00P,EAAA,qBAEAh8H,UAAAA,GAAA10M,EAAA,cACA0le,EAAA1le,EAAA,WAEA2le,EAAA3le,EAAA,cACAmtZ,EAAAntZ,EAAA,mBACA0rP,EAAA1rP,EAAA,aAEAsoO,OAAAmkO,uBAAAA,IACAzsc,EAAA,YACA4le,EAAA5le,EAAA,0CAEA6le,EAAA,KAyBA,SAAAC,EAAAp/X,EAAA,KAAAt0B,EAAA,OACA,OAAAC,KAAA6nC,MAAA7nC,KAAAwoC,UAAAzoC,EAAAs0B,EAAA,GAAAA,GAqJA5mG,EAAAC,QAlJA,MAKAuD,aAAA6kO,OAAAA,EAAAmmO,eAAAA,EAAAU,iBAAAA,KAAA5tc,IAeA,GAdAqrG,KAAAy3R,QAAA/7J,EACA17H,KAAAs5X,gBAAAz3B,EACA7hW,KAAAq2W,kBAAA9T,EAEAviW,KAAAu5X,SAAA5ke,EAAAgoU,QACA38N,KAAAw5X,YAAA7ke,EAAA6yc,WACAxnW,KAAA2hE,SAAA,CACA3E,YAAAroK,EAAAqoK,aAAA,GAAA0jP,EAAA7tZ,QAAA6tZ,EAAAh9S,WAAA1D,KAAAy3R,UACA9yB,IAAAhwW,EAAAgwW,KAAAy0H,EACAK,WAAA9ke,EAAA2yc,YAAA,EACAC,QAAA5yc,EAAA4yc,QACAmyB,UAAAr8Y,QAAA1oF,EAAA8yc,KAAA9yc,EAAA8yc,IAAA9qI,UAGA38N,KAAA2hE,SAAAgjM,IAAAy0H,EACA,MAAAn6O,EAAA,IAAAnmJ,MAAA,kDAAAknW,GAOAnpc,SACAoxM,GAAAjoG,KAAAu5X,UAKAv5X,KAAA25X,SAAAz7X,OAAAzE,IAEA4yH,EAAA98I,MAAAkqB,MAIA5iG,eACA,MAAAyqb,EAAAthV,KAAAq2W,kBAAAlS,WAEA,IAAA,MAAAnnJ,KAAAskI,EAAA,CAEA,MAAAnkI,OAAAA,EAAA33M,KAAAA,EAAAC,KAAAA,EAAA23M,UAAAA,GAAAJ,EAAAm8I,YAEA,IAAAn8I,EAAA48K,sBAAA,QAAAx8K,EAGA,SAGA,GAAA+7K,EAAAn8K,GAEA,SAGA,GAAA,IAAAG,EAGA,SAGA,MAAA4nK,EAAA/kX,KAAA65X,aACAC,EAAA95X,KAAAw5X,mBAAAzU,EAAAvd,aAEA,GAAA0xB,EAAAY,GACA,MAAA,IAAAhhY,MAAA,GAAAghY,0HAGA,MAAAC,EAAAV,IAEAhtQ,EAAA,gCAAAytQ,KAAAC,QAAAv0X,KAAAC,WAEAs/W,EAAA36Y,IAAA,CACA2vZ,WAAAA,EACAC,YAAAv0X,EACA8lG,SAAA6xG,EAAA1nN,gBAGAsK,KAAAs5X,gBAAAW,gBAAA9+K,EAAA++K,gBAAA,CACA/8K,OAAA,EACAe,QAAA47K,EACAr0X,KAAAs0X,GACA38K,KAIAvmT,aACA,GAAAmpG,KAAAm6X,QACA,OAAAn6X,KAAAm6X,QAGA,MAAApV,EAAA,IAAAiU,EAAAh5X,KAAA2hE,UAGAv3F,EAAAk3V,EAAAyjD,EAAA36Y,IAAAuuB,KAAAosX,IAEAz3Q,EAAAg0N,EAAAyjD,EAAAz3Q,QAAA30G,KAAAosX,IAEAvd,EAAAlmC,EAAAyjD,EAAAvd,WAAA7uW,KAAAosX,IAuBA,OApBA/kX,KAAAm6X,QAAA,CAKA/vZ,IAAA,IAAAgM,IAAA6iZ,GAAA,IAAA7uZ,KAAAgM,IAAA,CAAAgkZ,gBAAA/tQ,EAAA98I,MAAA6uH,OAAA,IAMAkP,QAAA,IAAAl3H,IAAA6iZ,GAAA,IAAA3rR,KAAAl3H,IAAA,CAAAgkZ,gBAAA/tQ,EAAA98I,MAAA6uH,OAAA,IAMAopQ,WAAA,IAAApxX,IAAA6iZ,GAAA,IAAAzxB,KAAApxX,IAAA,CAAAgkZ,gBAAA/tQ,EAAA98I,MAAA6uH,OAAA,KAGAp+F,KAAAm6X,QAQAtje,aACA,IAAAoxM,GAAAjoG,KAAAm6X,QAIA,UACAn6X,KAAAm6X,QAAA7sR,UACAttG,KAAAm6X,QAAA,KACA,MAAA1gY,GACA4yH,EAAA98I,MAAAkqB,gSC/LA,aAEAjmG,OAAAC,eAAAH,EAAA,aAAA,CACAI,OAAA,IAEAJ,EAAAgua,UAAAA,EAGA,IAAA+4D,EAAA,sCAWA,SAAA/4D,EAAA57U,GAEA,GAAA,mBAAAA,EACA,MAAA,IAAAqf,UAAA,4CAIA,IAAAu1X,EAAA50Y,EAAA20Y,GAGAE,EAAAj5D,EAAAv7P,SAAAA,QAEA,GAAA,mBAAAw0T,EACA,MAAA,IAAAzhY,MAAA,4DAGA,OAAA,WAGA,IAFA,IAAAkd,EAAAhW,KAEA20O,EAAAt+P,UAAApR,OAAAmR,EAAA,IAAAynB,MAAA82O,GAAA53O,EAAA,EAAAA,EAAA43O,EAAA53O,IACA3mB,EAAA2mB,GAAA1mB,UAAA0mB,GAGA,OAAA,IAAAw9X,GAAA,SAAAv0T,EAAAu5B,GAEAnpH,EAAAtL,MAAA,SAAA2uB,GACA,GAAAA,EACA,OAAA8lG,EAAA9lG,GAGA,IAAA,IAAA+gY,EAAAnkZ,UAAApR,OAAAm4B,EAAA,IAAAS,MAAA28X,EAAA,EAAAA,EAAA,EAAA,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IACAr9X,EAAAq9X,EAAA,GAAApkZ,UAAAokZ,GAGA,GAAA,IAAAr9X,EAAAn4B,SAAAq1Z,EACA,OAAAt0T,EAAA5oE,EAAA,IAGA,IAAA8yE,EAAA,GACA9yE,EAAAhpG,SAAA,SAAAV,EAAA6xE,GACA,IAAA1yE,EAAAyne,EAAA/0Z,GAEA1yE,IACAq9K,EAAAr9K,GAAAa,MAGAsyK,EAAAkK,MAGAxqF,EAAA09G,MAAAptF,EAAA5/B,OAMAkrV,EAAAg5D,cAAAD,iDC1EA,sCAIMvnQ,EAAav/N,EAAQ,eAErBw/N,EAAoC,iBAAXxzH,QAA2C,iBAAbpqG,UAA+C,IAAtBA,SAASN,SAEzFm+N,EAAcF,IACdG,EAAaF,IAAoBC,EACjCE,EAAmBF,IAAgBD,EACnCI,EAAuBH,GAAeD,EACtCK,EAA6B,mBAAZ7/N,QAA6C,IAAZu+L,QAAsD,IAApBA,EAAQuhC,SAAoD,SAAzBvhC,EAAQuhC,QAAQxgO,OAAoBmgO,EAG3JM,EAAwC,mBAAlBC,eAAgD,oBAATj0H,MAAqD,oBAAtBk0H,mBAAqCl0H,gBAAgBk0H,kBACjJC,OAA6B,IAAZ3hC,QAAkD,IAAhBA,EAAQ4hC,MAAQ,EAEzErgO,EAAOC,QAAAA,CACLugO,OAAQJ,EACRX,WAAYE,EACZH,eAAgBK,EAChBY,mBAAoBX,EACpBY,OAAQX,EAIRnrB,UAAWgrB,EACXe,YAAaV,EACbW,aAAclB,sEC7BhB,aACA,MAAAkmQ,EAAA1le,EAAA,SAEAmne,EAAA,CACA,kBACA,iDACA,gDACA,0BAGA,MAAAppQ,UAAAx4H,MACAjiG,YAAA8iF,GACA4rC,QAEA5rC,aAAAmf,OACAkH,KAAA26X,cAAAhhZ,IACAA,QAAAA,GAAAA,KAEAqmB,KAAA26X,cAAA,IAAA7hY,MAAAnf,GACAqmB,KAAA26X,cAAAnjX,MAAAxX,KAAAwX,OAGAxX,KAAAntG,KAAA,aACAmtG,KAAArmB,QAAAA,GAIA,MAWAihZ,EAAA,CAAA5rY,EAAAr6F,IAAA,IAAAoxK,SAAA,CAAAC,EAAAu5B,KACA5qM,EAAA,CACAyle,gBAAA,OACAh7R,QAAA,MACAzqM,GAGA,MAAA0yW,EAAA4xH,EAAA5xH,UAAA1yW,GAEA0yW,EAAAwzH,SAAAvnV,MAAAA,IACA,IACA0yB,QAAAh3E,EAAA8rY,IACA,MAAAvrZ,GACA,KAAAA,aAAAupB,OAEA,YADAymG,EAAA,IAAAx6F,UAAA,0BAAAx1B,sCAIA,GAAAA,aAAA+hJ,EACA+1I,EAAA9mO,OACAg/D,EAAAhwH,EAAAorZ,oBACA,GAAAprZ,aAAAw1B,YAvBAg2X,EAuBAxrZ,EAAAoK,SAvBA+gZ,EAAAjsZ,SAAAssZ,IAwBA1zH,EAAA9mO,OACAg/D,EAAAhwH,OACA,CAnCA,EAAAA,EAAAurZ,EAAAnme,KAEA,MAAAqme,EAAArme,EAAAyqM,SAAA07R,EAAA,GAEAvrZ,EAAAurZ,cAAAA,EACAvrZ,EAAAyrZ,YAAAA,GA+BAC,CAAA1rZ,EAAAurZ,EAAAnme,GAEA,UACAA,EAAAyle,gBAAA7qZ,GACA,MAAAA,GAEA,YADAgwH,EAAAhwH,GAIA83R,EAAA4xH,MAAA1pZ,IACAgwH,EAAA8nK,EAAA6zH,cArCAH,IAAAA,QA4CA1ne,EAAAC,QAAAsne,EAEAvne,EAAAC,QAAAH,QAAAyne,EAEAvne,EAAAC,QAAAg+N,WAAAA,2HCpFA,IAAA6pQ,EAAA5ne,EAAA,qBAEAD,EAAA+zW,UAAA,SAAA1yW,GACA,IAAAyme,EAAA9ne,EAAA8ne,SAAAzme,GACA,OAAA,IAAAwme,EAAAC,EAAA,CACAC,QAAA1me,GAAAA,EAAA0me,QACAj9R,MAAAzpM,GAAAA,EAAAypM,MACAk9R,aAAA3me,GAAAA,EAAA2me,gBAIAhoe,EAAA8ne,SAAA,SAAAzme,GACA,GAAAA,aAAAkpG,MACA,MAAA,GAAAhM,OAAAl9F,GAGA,IAAAosK,EAAA,CACAq+B,QAAA,GACA+oP,OAAA,EACAozC,WAAA,IACAC,WAAAnvX,EAAAA,EACAovX,WAAA,GAEA,IAAA,IAAAzme,KAAAL,EACAosK,EAAA/rK,GAAAL,EAAAK,GAGA,GAAA+rK,EAAAw6T,WAAAx6T,EAAAy6T,WACA,MAAA,IAAA1iY,MAAA,yCAIA,IADA,IAAAsiY,EAAA,GACAj0Z,EAAA,EAAAA,EAAA45F,EAAAq+B,QAAAj4H,IACAi0Z,EAAAtwZ,KAAAk1B,KAAA07X,cAAAv0Z,EAAA45F,IAYA,OATApsK,GAAAA,EAAA0me,UAAAD,EAAAn2Z,QACAm2Z,EAAAtwZ,KAAAk1B,KAAA07X,cAAAv0Z,EAAA45F,IAIAq6T,EAAAhvY,MAAA,SAAAvlB,EAAAyS,GACA,OAAAzS,EAAAyS,KAGA8hZ,GAGA9ne,EAAAooe,cAAA,SAAAb,EAAA95T,GACA,IAAA3yD,EAAA2yD,EAAA,UACAn7F,KAAAwoC,SAAA,EACA,EAEA08D,EAAAllG,KAAAuoC,MAAAC,EAAA2yD,EAAAw6T,WAAA31Z,KAAAy5J,IAAAt+D,EAAAonR,OAAA0yC,IAGA,OAFA/vT,EAAAllG,KAAAq0B,IAAA6wE,EAAA/J,EAAAy6T,aAKAloe,EAAAgxM,KAAA,SAAAzlG,EAAAlqG,EAAAqzL,GAMA,GALArzL,aAAAkpG,QACAmqF,EAAArzL,EACAA,EAAA,OAGAqzL,EAEA,IAAA,IAAAhzL,KADAgzL,EAAA,GACAnpF,EACA,mBAAAA,EAAA7pG,IACAgzL,EAAAl9G,KAAA91E,GAKA,IAAA,IAAAmyE,EAAA,EAAAA,EAAA6gH,EAAA/iH,OAAAkC,IAAA,CACA,IAAAi2D,EAAA4qD,EAAA7gH,GACAue,EAAAmZ,EAAAu+B,GAEAv+B,EAAAu+B,GAAA,SAAA13C,GACA,IAAAsrE,EAAA19J,EAAA+zW,UAAA1yW,GACAyhF,EAAAynB,MAAAF,UAAAv4B,MAAAw4B,KAAAvnB,UAAA,GACAgkF,EAAAjkF,EAAA6H,MAEA7H,EAAAtL,MAAA,SAAA2uB,GACAu3D,EAAAioU,MAAAx/X,KAGAA,IACApjB,UAAA,GAAA26E,EAAAkqU,aAEA7gU,EAAA+oC,MAAApjG,KAAA3pB,eAGA26E,EAAA6pU,SAAA,WACAn1Y,EAAA09G,MAAAvkG,EAAAzoB,OAEAuiB,KAAAkG,EAAAnZ,GACAmZ,EAAAu+B,GAAAzoI,QAAAA,6DCjGA,SAAAwme,EAAAC,EAAAzme,GAEA,kBAAAA,IACAA,EAAA,CAAA0me,QAAA1me,IAGAqrG,KAAA27X,kBAAA9zZ,KAAAoH,MAAApH,KAAAC,UAAAszZ,IACAp7X,KAAA47X,UAAAR,EACAp7X,KAAA2hE,SAAAhtK,GAAA,GACAqrG,KAAA67X,cAAAlne,GAAAA,EAAA2me,cAAAjvX,EAAAA,EACArM,KAAA87X,IAAA,KACA97X,KAAA25W,QAAA,GACA35W,KAAA+7X,UAAA,EACA/7X,KAAAg8X,kBAAA,KACAh8X,KAAAi8X,oBAAA,KACAj8X,KAAA+lQ,SAAA,KACA/lQ,KAAAk8X,gBAAA,KAEAl8X,KAAA2hE,SAAA05T,UACAr7X,KAAAm8X,gBAAAn8X,KAAA47X,UAAAx2Z,MAAA,IAGA/xE,EAAAC,QAAA6ne,EAEAA,EAAAx9X,UAAAsoE,MAAA,WACAjmE,KAAA+7X,UAAA,EACA/7X,KAAA47X,UAAA57X,KAAA27X,mBAGAR,EAAAx9X,UAAA4iC,KAAA,WACAvgC,KAAA+lQ,UACA91I,aAAAjwH,KAAA+lQ,UAGA/lQ,KAAA47X,UAAA,GACA57X,KAAAm8X,gBAAA,MAGAhB,EAAAx9X,UAAAs7X,MAAA,SAAAx/X,GAKA,GAJAuG,KAAA+lQ,UACA91I,aAAAjwH,KAAA+lQ,WAGAtsQ,EACA,OAAA,EAEA,IAAA2iY,GAAA,IAAAr+X,MAAAvB,UACA,GAAA/C,GAAA2iY,EAAAp8X,KAAAk8X,iBAAAl8X,KAAA67X,cAEA,OADA77X,KAAA25W,QAAA7gY,QAAA,IAAAggB,MAAA,qCACA,EAGAkH,KAAA25W,QAAA7uY,KAAA2uB,GAEA,IAAAqxE,EAAA9qE,KAAA47X,UAAAj3X,QACA,QAAAjvG,IAAAo1K,EAAA,CACA,IAAA9qE,KAAAm8X,gBAMA,OAAA,EAJAn8X,KAAA25W,QAAAlvY,OAAAu1B,KAAA25W,QAAA10Y,OAAA,EAAA+6B,KAAA25W,QAAA10Y,QACA+6B,KAAA47X,UAAA57X,KAAAm8X,gBAAA/2Z,MAAA,GACA0lG,EAAA9qE,KAAA47X,UAAAj3X,QAMA,IAAArF,EAAAU,KACA+nQ,EAAAl9L,YAAA,WACAvrE,EAAAy8X,YAEAz8X,EAAA28X,sBACA38X,EAAAymQ,SAAAl7L,YAAA,WACAvrE,EAAA28X,oBAAA38X,EAAAy8X,aACAz8X,EAAA08X,mBAEA18X,EAAAqiE,SAAAy8B,OACA9+F,EAAAymQ,SAAA3nK,SAIA9+F,EAAAw8X,IAAAx8X,EAAAy8X,aACAjxT,GAMA,OAJA9qE,KAAA2hE,SAAAy8B,OACA2pK,EAAA3pK,SAGA,GAGA+8R,EAAAx9X,UAAAk9X,QAAA,SAAAj2Y,EAAAy3Y,GACAr8X,KAAA87X,IAAAl3Y,EAEAy3Y,IACAA,EAAAvxT,UACA9qE,KAAAg8X,kBAAAK,EAAAvxT,SAEAuxT,EAAAh8U,KACArgD,KAAAi8X,oBAAAI,EAAAh8U,KAIA,IAAA/gD,EAAAU,KACAA,KAAAi8X,sBACAj8X,KAAA+lQ,SAAAl7L,YAAA,WACAvrE,EAAA28X,wBACA38X,EAAA08X,oBAGAh8X,KAAAk8X,iBAAA,IAAAn+X,MAAAvB,UAEAwD,KAAA87X,IAAA97X,KAAA+7X,YAGAZ,EAAAx9X,UAAA+9N,IAAA,SAAA92O,GACA8V,QAAA2xH,IAAA,4CACArsH,KAAA66X,QAAAj2Y,IAGAu2Y,EAAAx9X,UAAA3oB,MAAA,SAAA4P,GACA8V,QAAA2xH,IAAA,8CACArsH,KAAA66X,QAAAj2Y,IAGAu2Y,EAAAx9X,UAAA3oB,MAAAmmZ,EAAAx9X,UAAA+9N,IAEAy/J,EAAAx9X,UAAAo1B,OAAA,WACA,OAAA/yB,KAAA25W,SAGAwhB,EAAAx9X,UAAA2+X,SAAA,WACA,OAAAt8X,KAAA+7X,WAGAZ,EAAAx9X,UAAAu9X,UAAA,WACA,GAAA,IAAAl7X,KAAA25W,QAAA10Y,OACA,OAAA,KAOA,IAJA,IAAAs3Z,EAAA,GACArB,EAAA,KACAsB,EAAA,EAEAr1Z,EAAA,EAAAA,EAAA64B,KAAA25W,QAAA10Y,OAAAkC,IAAA,CACA,IAAAoI,EAAAywB,KAAA25W,QAAAxyY,GACAwS,EAAApK,EAAAoK,QACA4J,GAAAg5Y,EAAA5iZ,IAAA,GAAA,EAEA4iZ,EAAA5iZ,GAAA4J,EAEAA,GAAAi5Y,IACAtB,EAAA3rZ,EACAitZ,EAAAj5Y,GAIA,OAAA23Y,+BC5JA,aAGA,MAAAuB,EAAAlpe,EAAA,oBAkBAF,EAAAC,QANA,SAAAgwY,GACA,MAAAplF,QAAAA,GAAAolF,EAAAqnE,cAEA,OAAA8xB,EAAAv+K,4DClBA,aAaA7qT,EAAAC,QALA,SAAAinQ,GACA,MAAA,mDAAA90L,KAAA80L,IACA,QAAA90L,KAAA80L,gCCVA,aAGA,MAAAmiO,EAAAnpe,EAAA,qBAEAwuT,EAAAxuT,EAAA,sBAEAope,EAAAppe,EAAA,iBACAqpe,MAAAA,GAAArpe,EAAA,gBACAspe,EAAAtpe,EAAA,kBACAupe,EAAAvpe,EAAA,oBACAwpe,EAAAxpe,EAAA,yBAEAF,EAAAC,QAAA,KAEA,CACAsvc,OAAA,CACAiE,iBAAA,IACAE,gBAAA,EACAE,YAAA,KAEA1yR,QAAA,CACA6oI,UAAA,CACAs/K,EACA36K,GAEAghJ,YAAA,CACA45B,GAEAj6B,eAAA,CACAk6B,GAEAj/C,cAAA,GACAziH,IAAA2hK,EACA1hK,OAAA2hK,GAEAviZ,OAAA,CACAojW,cAAA,CACAskB,UAAA,EAEA5mI,UAAA,CACAsB,SAAA,GAGAynE,WAAA,CACAznE,SAAA,IAGAzB,IAAA,CACA8iH,YAAA,GACArhH,SAAA,EACAohH,YAAA,EACAqpB,WAAA,CACAzqI,SAAA,GAEAqiE,WAAA,CACAvkE,KAAAsiK,EAAAxpG,WAEA6L,UAAA,CACA3kE,KAAAsiK,EAAAx4T,WAGA42J,OAAA,CACAwB,SAAA,EACAysH,UAAA,GAEAnL,IAAA,CACAthH,SAAA,IAGAk9G,QAAA,CACAl9G,SAAA,GAEAskF,UAAA,CACA2gD,aAAA,EACAvqD,UAAA,6NC3EA,aAEA,MAAA2lF,EAAAzpe,EAAA,gBACA0kO,EAAA1kO,EAAA,YACA6vZ,EAAA7vZ,EAAA,qBACA+9N,WAAAA,GAAA/9N,EAAA,sBACA0pe,EAAA1pe,EAAA,WAEA0wU,EAAA1wU,EAAA,SACA84N,EAAA43G,EAAA,qBACA53G,EAAA98I,MAAA00P,EAAA,2BACA,MAAAvwG,EAAAngO,EAAA,sBAEAo5c,EAAAp5c,EAAA,cACAk/c,EAAAl/c,EAAA,oBACA2wF,EAAA3wF,EAAA,aAqJAF,EAAAC,QAAA2kO,EA5IA,MAOAphO,aAAA0qZ,SAAAA,EAAAxzU,OAAAA,IACA,IAAAwzU,EACA,MAAA,IAAAzoT,MAAA,6FAEAkH,KAAAgzW,UAAAzxD,EACAvhT,KAAAumS,QAAAx4T,EAUAl3E,WAAAysY,EAAA3uY,EAAA,IACA03N,EAAA,aAAAi3K,GAEA,MAAA45F,QAAAl9X,KAAAmmV,SAAA7iD,EAAA3uY,GACAg/c,EAAAlB,EAAAyqB,EAAA,CAAAhkC,WAAA51D,EAAAzzK,OAAAl7N,EAAAk7N,SACAxD,EAAA,6BAAAsnP,EAAAza,YAEA,MAAA3O,QAAAvqV,KAAAgzW,UAAAsB,gBAAAX,GAEA,OADAtnP,EAAA,kCAAAsnP,EAAAza,YACA3O,EAUA1zb,eAAAysY,EAAA3uY,EAAA,IACA,GAAAA,EAAAk7N,QAAAl7N,EAAAk7N,OAAAx8E,QACA,MAAA,IAAAi+E,EAEA,MAAA6rQ,EAAA75F,EAAA61D,YACA9sO,EAAA,gBAAA8wQ,EAAA33X,KAAA23X,EAAA13X,MAEA,MAAA23X,EAAAH,IACAI,EAAA5jY,IACA,MAAAhqB,EAAA,qBAAAgqB,EAAA9f,UACA0yI,EAAA98I,MAAAE,GAEA2tZ,EAAA79R,OAAA9lG,IAGA6jY,EAAAN,EAAA55E,EAAA9f,GAAA9vY,OAAAiqG,OAAA,CAAAg4J,QAAA,GAAA9gQ,IAQA,GANA2oe,EAAAJ,OAAAlvZ,GACAsvZ,EAAAJ,OAAAlvZ,GAAA,QAAAqvZ,GAEAC,EAAAJ,OAAA1qQ,QAAA6qQ,GAGA1oe,EAAAk7N,OAIA,aAHA9pD,QAAA40L,KAAA,CAAA2iI,EAAAnmC,YAAAimC,EAAA/nR,UAEAgX,EAAA,eAAAi3K,GACAg6F,EAIA,IAAAxlQ,EACA,MAAA9kF,EAAA,IAAA+yB,SAAA,CAAAC,EAAAu5B,KAUA,GATAu4B,EAAA,KACAv4B,EAAA,IAAA+xB,GAEAzmD,YAAA,KACAyyT,EAAAt9Y,YAKArrF,EAAAk7N,OAAAx8E,QAAA,OAAAykF,IACAnjO,EAAAk7N,OAAA3pD,iBAAA,QAAA4xD,MAGA,UACA/xD,QAAA40L,KAAA,CAAA3nN,EAAAoqV,EAAA/nR,QAAAioR,EAAAnmC,cACA,QACAxic,EAAAk7N,OAAAxoD,oBAAA,QAAAywD,GAIA,OADAzL,EAAA,eAAAi3K,GACAg6F,EAaAzme,eAAAlC,EAAA,GAAA4oK,GAMA,MALA,mBAAA5oK,IACA4oK,EAAA5oK,EACAA,EAAA,IAGAg4c,EAAA,CAAApvS,QAAAA,EAAAgkP,SAAAvhT,KAAAgzW,WAAAr+c,GAWAkC,OAAAwqZ,GAGA,OAFAA,EAAAxjT,MAAA/gB,QAAAukU,GAAAA,EAAA,CAAAA,GAEArhT,KAAAumS,QACAvmS,KAAAumS,QAAA8a,GAIA3tL,EAAAzrB,WAAAyrB,EAAAM,YACA9vI,EAAAq5Y,OAAAl8E,GAGAn9T,EAAAwiI,IAAA26L,KAIA,CACAxmT,UAAA,aACAo/H,WAAA,4SCtKA,aAGA,IAAAujQ,EAAAjqe,EAAA,gBACA82Y,EAAA92Y,EAAA,YACAkqe,EAAAlqe,EAAA,YAEAF,EAAAC,QAAA,SAAA0pT,EAAAj8I,EAAA,IACA,MAAAynC,EAAA,oBAAAjpG,OAAA,GAAAA,OAAAipG,SAEA5iG,EAAA63X,EAAAzgL,EAAAx0G,GACA00R,EAAA,IAAAM,EAAA53X,EAAAm7D,EAAA28T,WAEAltQ,EAAA65K,EAAA6yF,EAAAn8T,GAeA,OAdAyvD,EAAAmtQ,cAAA/3X,EACA4qH,EAAAxwI,MAAA,IAAA,IAAA+lF,SAAA,CAAAC,EAAAu5B,KACA29R,EAAAh3T,iBAAA,QAAAF,GACAk3T,EAAAl9Y,WAEAwwI,EAAAljB,QAAA,KACA4vR,EAAAlhO,UACAkhO,EAAAlhO,YAEAkhO,EAAAl9Y,SAGAwwI,EAAA0sQ,OAAAA,EAEA1sQ,GAGAn9N,EAAAC,QAAA0pe,QAAA3pe,EAAAC,gGC9BAD,EAAAC,QAAA,oBAAAkqe,UAAAjqe,EAAA,MAAAiqe,kDCDA,MAAAzoZ,EAAAxhF,EAAA,YACA42Y,EAAA52Y,EAAA,UAEAF,EAAAC,QAAA,CAAA4pe,EAAAvoe,MACAA,EAAAA,GAAA,IAEAipe,WACAV,EAAAU,WAAAjpe,EAAAipe,WACAjpe,EAAA8gQ,SACAynO,EAAAU,WAAA,eAGA,MAAAvzF,EAAA,CACAF,KAAAA,EAAA+yF,EAAAvoe,GACAogF,OAAAA,EAAAmoZ,EAAAvoe,GACAwic,UAAA,IAAA9sD,EAAAt1T,OAAAoiX,aAGA,OAAA9sD,+EClBQpnJ,GAAW1vP,EAAQ,yBACnBsqe,GAAkBtqe,EAAQ,kBAUlCF,EAAOC,QAAU4pe,UACT1nQ,EAAiB0nQ,EAAO71T,qBAAuB61T,EAAO1nQ,eAEtDzgJ,EAAAA,wBACErF,EAAAA,IAAemuZ,GACnB,EAAG/yZ,KAAAA,EAAMy1D,KAAAA,EAAMuzN,KAAAA,MACbopI,EAAOh3T,iBAAiB,UAAWp7F,GACnCoyZ,EAAOh3T,iBAAiB,QAAS4tL,GACjCopI,EAAOh3T,iBAAiB,QAAS3lC,GAE1B,KACLi1F,EAAe53H,KAAKs/X,EAAQ,UAAWpyZ,GACvC0qJ,EAAe53H,KAAKs/X,EAAQ,QAASppI,GACrCt+H,EAAe53H,KAAKs/X,EAAQ,QAAS38V,OAGvC8kM,cAAeh5N,EAAAA,yBAGAqgD,KAAUh9E,QAzBTmvB,EA0BE6tD,EAzBjB7tD,aAAeo/H,aACZ,MAAPp/H,GAAkC,MAAnBA,EAAI8N,aAAgD,gBAAzB9N,EAAI8N,YAAY95G,MAC/B,iBAAnBgsG,EAAIu/H,WAuBiB6kB,EAAOx5F,KAAKiD,GAAQA,GA1BtD,IAAwB7tD,EAShB9pB,OAsBF+oZ,EADA3mC,EAAkC,IAAtB+lC,EAAOv2Q,kBAGvBu2Q,EAAOh3T,iBAAiB,QAAQ,KAC9BixR,GAAY,EACZ2mC,EAAY,QAGdZ,EAAOh3T,iBAAiB,SAAS,KAC/BixR,GAAY,EACZ2mC,EAAY,QAGdZ,EAAOh3T,iBAAiB,SAASzsE,IAC1B09V,IAAW2mC,EAAYrkY,MAG9B1kB,EAAOoiX,UAAY,IAAA,IAAUpxR,SAAQ,CAACC,EAASu5B,QACzC43P,EAAAA,OAAkBnxR,OAClB83T,EAAAA,OAAkBv+R,EAAOu+R,SAEvBC,EAAUC,IACdxoQ,EAAe53H,KAAKs/X,EAAQ,OAAQe,GACpCzoQ,EAAe53H,KAAKs/X,EAAQ,QAASzne,GACrCuoe,KAGIC,EAAS,IAAMF,EAAQ/3T,GACvBvwK,EAAUgkG,GAAOskY,GAAQ,IAAMx+R,EAAO9lG,KAE5CyjY,EAAOh3T,iBAAiB,OAAQ+3T,GAChCf,EAAOh3T,iBAAiB,QAASzwK,MAG5Bs/E,wECrET,aACAvhF,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACA,MAAAwqe,EAAA3qe,EAAA,oBACAD,EAAAuqe,cAAAK,EAAAL,cAOAvqe,EAAAqqY,UANA,SAAAz0T,EAAAv0E,EAAAwpe,GACA,OAAA,IAAAD,EAAAL,eAAA,EAAA/yZ,KAAAA,MACAk1B,KAAAkmE,iBAAAh9F,EAAA4B,EAAAn2E,GACA,IAAAqrG,KAAAqnE,oBAAAn+F,EAAA4B,EAAAn2E,KACAwpe,IAGA7qe,EAAAH,QAAA+qe,EAAAL,oECXA,aACArqe,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACA,MAAA0qe,EACAvne,cACAmpG,KAAAq+X,UAAA,GACAr+X,KAAAs+X,UAAA,GACAt+X,KAAAu+X,cAAA,GACAv+X,KAAAqnO,UAAA,EACArnO,KAAAw+X,WAAA,EAEA3ne,KAAAnD,GACA,GAAAssG,KAAAw+X,UACA,OACA,MAAAC,EAAA,CAAA/qe,MAAAA,EAAAo2K,MAAA,GACA,GAAA9pE,KAAAq+X,UAAAp5Z,OAAA,CACA,MAAA81D,EAAA/6B,KAAAq+X,UAAA15X,QACAo2B,GACAA,EAAAirC,QAAAy4T,QAGAz+X,KAAAs+X,UAAAxzZ,KAAAi7F,QAAAC,QAAAy4T,SACA/oe,IAAAsqG,KAAAqlO,eACArlO,KAAAs+X,UAAAr5Z,QAAA+6B,KAAAqlO,gBACArlO,KAAAqnO,WACArnO,KAAAqnO,UAAA,EACArnO,KAAAu+X,cAAAG,UACA1+X,KAAAu+X,cAAAG,YAEAhkY,SACAA,QAAAs6E,KAAA,+BAAAh1E,KAAAs+X,UAAAr5Z,iBAKApuE,OACA,IAAAmpG,KAAAw+X,UAAA,CAEAx+X,KAAAw+X,WAAA,EACAx+X,KAAAtC,SACA,IAAA,MAAAq9B,KAAA/6B,KAAAq+X,UACAtjW,EAAAirC,QAAA,CAAAtyK,WAAAgC,EAAAo0K,MAAA,IAEA9pE,KAAAq+X,UAAAp5Z,OAAA,GAEApuE,KAAA04E,GACA,IAAAywB,KAAAw+X,UAIA,GAFAx+X,KAAAw+X,WAAA,EACAx+X,KAAAtC,SACAsC,KAAAq+X,UAAAp5Z,OAAA,CACA,IAAA,MAAA81D,KAAA/6B,KAAAq+X,UACAtjW,EAAAwkE,OAAAhwH,GAEAywB,KAAAq+X,UAAAp5Z,OAAA,MAEA,CACA,MAAA05Z,EAAA54T,QAAAw5B,OAAAhwH,GAEAovZ,EAAAzgY,OAAA,SACA8B,KAAAs+X,UAAAxzZ,KAAA6zZ,IAGA9ne,SACAkvK,QAAAC,UAAA/nE,MAAA,KACA+B,KAAA4+X,gBACA5+X,KAAA4+X,oBAGA/ne,CAAAX,OAAAy6N,iBACA,MAAA,CACAvzI,KAAA1pF,IACA,MAAAk3E,EAAAo1B,KAAAs+X,UAAA35X,QACA,OAAA/5B,QACAl1E,IAAAsqG,KAAA6+X,cACA7+X,KAAAs+X,UAAAr5Z,QAAA+6B,KAAA6+X,cACA7+X,KAAAqnO,WACArnO,KAAAqnO,UAAA,EACArnO,KAAAu+X,cAAAO,UACA9+X,KAAAu+X,cAAAO,YAGAl0Z,GAEAo1B,KAAAw+X,UACAz4T,QAAAC,QAAA,CAAAtyK,WAAAgC,EAAAo0K,MAAA,IAGA,IAAA/D,SAAA,CAAAC,EAAAu5B,KACAv/F,KAAAq+X,UAAAvzZ,KAAA,CAAAk7F,QAAAA,EAAAu5B,OAAAA,QAIAqxB,OAAA,KACA5wH,KAAAw+X,WAAA,EACAx+X,KAAAs+X,UAAAr5Z,OAAA,EACA+6B,KAAAtC,SACAqoE,QAAAC,QAAA,CAAAtyK,WAAAgC,EAAAo0K,MAAA,OAKA,MAAA+zT,EACAhne,YAAAu2M,GAAAi4H,cAAAA,EAAA,IAAAw5J,aAAAA,EAAA,GAAA,IACA,MAAA5nT,EAAA,IAAAmnT,EACAnnT,EAAAouJ,cAAAA,EACApuJ,EAAA4nT,aAAAA,EACA5nT,EAAA2nT,eACAxxR,EAAA,CACAtiI,KAAAp3E,GAAAujL,EAAAnsG,KAAAp3E,GACA6sI,KAAA,IAAA02C,EAAA12C,OACAuzN,KAAAvkR,GAAA0nG,EAAA68K,KAAAvkR,GACAvB,GAAA,CAAA9E,EAAA0b,KACAqyF,EAAAsnT,cAAAr1Z,GAAA0b,MAEA,SACAob,KAAA9pG,OAAAy6N,eAAA,IAAA15C,EAAA/gL,OAAAy6N,iBACAn9N,OAAAc,OAAA0rG,OAGA1sG,EAAAuqe,cAAAA,EACAvqe,EAAAH,QAAA0qe,gCCxHA,MAAAl9Q,EAAAptN,EAAA,WAEAF,EAAAC,QAAA,CAAA4pe,EAAAvoe,MACAA,EAAAA,GAAA,IACAoqe,YAAA,IAAApqe,EAAAoqe,WAEAzrV,MAAAA,IACA,UAAA,MAAAoZ,KAAA33E,EAAA,CACA,UACA4rI,EAAAu8Q,GACA,MAAAzjY,GACA,GAAA,kBAAAA,EAAA9f,QAAA,MACA,MAAA8f,EAGAyjY,EAAAvqQ,KAAAjmE,GAGA,GAAA/3J,EAAAoqe,YAAA7B,EAAAv2Q,YAAA,EACA,OAAA,IAAA5gD,SAAA,CAAAC,EAAAu5B,KACA29R,EAAAh3T,iBAAA,SAAAh9F,IACA,GAAAA,EAAA81Z,UAAA,OAAA91Z,EAAA7zE,KACA2wK,QACA,CACA,MAAAvsE,EAAAjmG,OAAAiqG,OAAA,IAAA3E,MAAA,YAAA,CAAA5vB,MAAAA,IACAq2H,EAAA9lG,OAIAoxE,YAAA,IAAAqyT,EAAAl9Y,8DC7BA3sF,EAAAC,QAAAggJ,MAAAA,IAEA,GAAA4pV,EAAAv2Q,YAAA,EACA,MAAA,IAAA7tH,MAAA,iBAIA,GAAA,IAAAokY,EAAAv2Q,WAIA,OAAA,IAAA5gD,SAAA,CAAAC,EAAAu5B,KACA,MAAA7hG,EAAAw/X,IAAAA,EAAA71T,qBAAA61T,EAAA1nQ,gBAEA,SAAA30C,IACA,mBAAAnjF,IACAA,EAAAE,KAAAs/X,EAAA,OAAA+B,GACAvhY,EAAAE,KAAAs/X,EAAA,QAAAgC,IAIA,SAAAD,IACAp+S,IAAA7a,IAGA,SAAAk5T,EAAAz3O,GACA5mE,IAAA0e,EAAAkoD,GAGAy1O,EAAAh3T,iBAAA,OAAA+4T,GACA/B,EAAAh3T,iBAAA,QAAAg5T,qCC9BA,MAAA99X,SAAAA,GAAA7tG,EAAA,WACA62E,EAAA,CAAAskJ,KAAA,KAAAyuB,MAAA,OAGA9pP,EAAAC,QAAA,CAAAsyG,EAAA4iG,IAAApnG,EAAAwE,EAAA4iG,EAAAp+H,EAFA,qDCFA,aAEA/2E,EAAAC,QAAA,WACA,MAAA,IAAAwlG,MAAA,uFCHA,aAEA,MAAA20V,EAAAl6b,EAAA,uBACA4re,cAAAA,GAAA5re,EAAA,eACA6re,EAAA7re,EAAA,yCAEAu0W,EAAAv0W,EAAA,aAEA0wU,EAAA1wU,EAAA,SACA84N,EAAA43G,EAAA,4BACA53G,EAAA98I,MAAA00P,EAAA,kCAIA5wU,EAAAC,QAAA,CAAAk9N,EAAA77N,EAAA,MACA,MAAAg/c,EAAA,CACA98c,WAAAk+E,GACApgF,EAAAk7N,SACA96I,EAAA04W,EAAA14W,EAAApgF,EAAAk7N,SAGA,UACAW,EAAA25K,KAAA,kBACA,UAAA,MAAA16R,KAAA16B,QAEA06B,aAAAgpH,WAAAhpH,EAAAA,EAAArqC,QAHA,IAMA,MAAAq0B,GACA,YAAAA,EAAA3yB,MACAulJ,EAAA98I,MAAAkqB,KAKA1kB,OAAApgF,EAAAk7N,OAAA49N,EAAAj9N,EAAAz7I,OAAApgF,EAAAk7N,QAAAW,EAAAz7I,OAEAw1W,KAAA/5N,EAEAijP,UAAA9+c,EAAA8+c,YAAAjjP,EAAA6uQ,cAAA7uQ,EAAA8uQ,UACAF,EAAA5uQ,EAAA6uQ,aAAA7uQ,EAAA8uQ,gBACA5pe,GAGAwjc,WAAAvkc,EAAAukc,YAAAkmC,EAAA5uQ,EAAAmtQ,cAAAntQ,EAAA+uQ,YAEA9qB,SAAA,CAAA10X,KAAAge,KAAAunE,OAEAzuK,cACA,MAAAm+E,EAAA+oB,KAAAunE,MAEA,UACAwiM,EAAAt3I,EAAAxwI,QAAAm/Y,GACA,MAAA1lY,GACA,MAAA+L,KAAAA,EAAAC,KAAAA,GAAAkuW,EAAAza,WAAAC,YACA9sO,EAAA,qEACA7mH,EAAAC,EAAA1H,KAAAunE,MAAAtwF,GAEAw7I,EAAAljB,UACA,QACAqmQ,EAAAc,SAAAz0X,MAAA+d,KAAAunE,SAcA,OATAkrD,EAAA0sQ,OAAAt2Q,MAAA4J,EAAA0sQ,OAAAt2Q,KAAA,SAAA,KAIA+sP,EAAAc,SAAAz0X,QACA2zX,EAAAc,SAAAz0X,MAAA+d,KAAAunE,UAIAquS,qKC1EA,aAGArgd,EAAAkse,SAAA,IACAlse,EAAAmse,aAAA,IAEAnse,EAAAose,SAAA,EACApse,EAAAqse,QAAA,IACArse,EAAAsse,SAAA,IAGAtse,EAAA6re,cAAA,kCCXA,aAEA,MAAAl7J,EAAA1wU,EAAA,SACA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,+BAAA,CACA10P,MAAA00P,EAAA,sCAEA9oB,UAAAA,GAAA5nT,EAAA,aACAupT,EAAAvpT,EAAA,aACAsse,SAAAA,EAAAC,SAAAA,GAAAvse,EAAA,cAEAw/H,EAAA,CACAgtW,yBAAA,2BACAC,2BAAA,6BACAC,eAAA,kBAyCA5se,EAAAC,QAhCA,SAAAinQ,EAAA90J,GACA,GAAA,iBAAA80J,EACA,MAAAuiD,EAAA,IAAAhkN,MAAA,wBAAAyhK,KAAAxnI,EAAAgtW,0BAOA,GAJA,iBAAAt6X,IACAA,EAAAr/B,SAAAq/B,IAGAvG,MAAAuG,GACA,MAAAq3M,EAAA,IAAAhkN,MAAA,0BAAA2M,KAAAstB,EAAAitW,4BAGA,IAGA,OADA,IAAAH,EAAAtlO,GACA,IAAA4gD,EAAA,QAAA5gD,SAAA90J,KACA,OAEA,IAEA,MAAAuzI,EAAA,IAAA8mP,EAAAvlO,GACA,OAAAvhB,EAAAknP,MACA,IAAA/kL,EAAA,QAAAniE,EAAAmnP,MAAAC,qBAAA36X,KACA,IAAA01M,EAAA,QAAA5gD,SAAA90J,KACA,MAAAhM,GACA,MAAA82R,EAAA,6CAAAh2H,KAAA90J,IAEA,MADA4mH,EAAA98I,MAAAghT,GACAzzE,EAAA,IAAAhkN,MAAAy3R,GAAAx9P,EAAAktW,kBAMA5se,EAAAC,QAAA6xH,OAAA4N,uGCxDA,aACA,IAAA4rT,EAAA3+U,MAAAA,KAAA2+U,kBAAAnrb,OAAAU,OAAA,SAAAg8K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACAb,OAAAC,eAAAy8K,EAAA2hH,EAAA,CAAA9yL,YAAA,EAAAvd,IAAA,WAAA,OAAAtC,EAAA7qF,OACA,SAAA67K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACA67K,EAAA2hH,GAAA3yM,EAAA7qF,KAEAuqb,EAAA5+U,MAAAA,KAAA4+U,qBAAAprb,OAAAU,OAAA,SAAAg8K,EAAApL,GACAtxK,OAAAC,eAAAy8K,EAAA,UAAA,CAAAnxE,YAAA,EAAArrG,MAAAoxK,KACA,SAAAoL,EAAApL,GACAoL,EAAA,QAAApL,IAEA+5Q,EAAA7+U,MAAAA,KAAA6+U,cAAA,SAAAv8R,GACA,GAAAA,GAAAA,EAAAtuJ,WAAA,OAAAsuJ,EACA,IAAA13E,EAAA,GACA,GAAA,MAAA03E,EAAA,IAAA,IAAAjuJ,KAAAiuJ,EAAA,YAAAjuJ,GAAAb,OAAAmqG,UAAAnD,eAAAoD,KAAA0kD,EAAAjuJ,IAAAsqb,EAAA/zW,EAAA03E,EAAAjuJ,GAEA,OADAuqb,EAAAh0W,EAAA03E,GACA13E,GAEAp3E,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAA+sT,GAAA/sT,EAAAwse,SAAAxse,EAAAuse,cAAA,EACA,IAAAQ,EAAA9se,EAAA,cACAC,OAAAC,eAAAH,EAAA,WAAA,CAAAyrG,YAAA,EAAAvd,IAAA,WAAA,OAAA6+Y,EAAAR,YACA,IAAAS,EAAA/se,EAAA,cACAC,OAAAC,eAAAH,EAAA,WAAA,CAAAyrG,YAAA,EAAAvd,IAAA,WAAA,OAAA8+Y,EAAAR,YACA,IAAA1qZ,EAAAypW,EAAAtrb,EAAA,qBACAD,EAAA+sT,GAAA,CAAAjrO,QAAAA,qGC3BA,aAEA,IAAAupW,EAAA3+U,MAAAA,KAAA2+U,kBAAAnrb,OAAAU,OAAA,SAAAg8K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACAb,OAAAC,eAAAy8K,EAAA2hH,EAAA,CAAA9yL,YAAA,EAAAvd,IAAA,WAAA,OAAAtC,EAAA7qF,OACA,SAAA67K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACA67K,EAAA2hH,GAAA3yM,EAAA7qF,KAEAuqb,EAAA5+U,MAAAA,KAAA4+U,qBAAAprb,OAAAU,OAAA,SAAAg8K,EAAApL,GACAtxK,OAAAC,eAAAy8K,EAAA,UAAA,CAAAnxE,YAAA,EAAArrG,MAAAoxK,KACA,SAAAoL,EAAApL,GACAoL,EAAA,QAAApL,IAEA+5Q,EAAA7+U,MAAAA,KAAA6+U,cAAA,SAAAv8R,GACA,GAAAA,GAAAA,EAAAtuJ,WAAA,OAAAsuJ,EACA,IAAA13E,EAAA,GACA,GAAA,MAAA03E,EAAA,IAAA,IAAAjuJ,KAAAiuJ,EAAA,YAAAjuJ,GAAAb,OAAAmqG,UAAAnD,eAAAoD,KAAA0kD,EAAAjuJ,IAAAsqb,EAAA/zW,EAAA03E,EAAAjuJ,GAEA,OADAuqb,EAAAh0W,EAAA03E,GACA13E,GAEAp3E,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAuse,cAAA,EACA,IAAAjzL,EAAAiyI,EAAAtrb,EAAA,aACA6oO,EAAAyiN,EAAAtrb,EAAA,mBACAgte,EAAAhte,EAAA,mBACAite,EAAAjte,EAAA,QACAkte,EAAAlte,EAAA,cAMAsse,EAAA,WACA,SAAAA,EAAA3hL,GACAl+M,KAAA0gY,OAAAtkQ,EAAAukQ,OACA3gY,KAAA4gY,cAAA,GACA5gY,KAAA6gY,aAAA,GACA7gY,KAAA8gY,OAAA,MACA9gY,KAAA+gY,WAAA,GACA/gY,KAAAmgN,IAAA,EAOAngN,KAAAghY,UAAAp0L,EAAAo0L,UAAA5kQ,EAAAwpF,MAOA5lN,KAAAihY,WAAAr0L,EAAAq0L,WACAjhY,KAAAk+M,QAAAA,EACA,IAAA4iL,EAAA1kQ,EAAA8kQ,iBAAA57Z,KAAA44O,GACA,GAAA4iL,EAAA,CAIA,GAHA9gY,KAAA6gY,aAAAC,EAAA,GAAA5nZ,QAAA,IAAA,IACA8mB,KAAA+gY,WAAA36Z,SAAA45B,KAAA6gY,aAAA,IACA7gY,KAAA8gY,OAAA,IAAA9gY,KAAA+gY,WACA/gY,KAAA+gY,WAAA,GAAA/gY,KAAA+gY,WAAA3kQ,EAAAwpF,KACA,MAAA,IAAA26K,EAAAY,aAAA,wBAEAjjL,EAAAA,EAAAhlO,QAAAkjJ,EAAA8kQ,iBAAA,IAEAlhY,KAAAohY,mBAAAljL,EACAl+M,KAAA4gY,cAAA5gY,KAAA/wB,MAAAivO,GA0NA,OAxNA2hL,EAAAttG,QAAA,SAAAr0E,GACA,IAGA,OADA,IAAA2hL,EAAA3hL,IACA,EAEA,MAAAnqT,GACA,OAAA,IAMA8re,EAAAliY,UAAA1uB,MAAA,SAAAivO,GACA,IAAAwiL,EAAAxiL,EAAAp+N,MAAA,KACA,IAAAo+N,EAAA5gO,MAAA8+I,EAAAilQ,YACA,MAAA,IAAAd,EAAAY,aAAA,yBAEA,OAAAT,GAQAb,EAAAliY,UAAAyiY,YAAA,WACA,OAAApgY,KAAA4gY,cAAAx2Z,KAAA,SAAA27B,GAAA,OAAA3/B,SAAA2/B,EAAA,OAAAz7B,KAAA,MASAu1Z,EAAAv3G,QAAA,SAAAtiT,GACA,IAEAmB,EAFAggR,EAAAnhR,EAAAkT,QAAA,KAAA,IAAAmvS,SAAA,EAAA,KACAq4G,EAAA,GAEA,IAAAv5Z,EAAA,EAAAA,EAAA,EAAAA,GAAA,EAAA,CACA,IAAAsgG,EAAA0/K,EAAA/hR,MAAA+B,EAAAA,EAAA,GACAu5Z,EAAA51Z,KAAA1E,SAAAqhG,EAAA,KAEA,OAAA,IAAAo4T,EAAAa,EAAAp2Z,KAAA,OASAu1Z,EAAAyB,YAAA,SAAAzxU,GACA,OAAAgwU,EAAAv3G,QAAAz4N,EAAAzxD,SAAA,MAQAyhY,EAAAliY,UAAAy3J,MAAA,WACA,OAAAp1J,KAAA4gY,cAAAx2Z,KAAA,SAAA27B,GAAA,OAAA06X,EAAAc,QAAA,OAAAn7Z,SAAA2/B,EAAA,QAAAz7B,KAAA,MAQAu1Z,EAAAliY,UAAAwF,QAAA,WACA,OAAAnD,KAAA4gY,cAAAx2Z,KAAA,SAAA27B,GAAA,OAAA3/B,SAAA2/B,EAAA,QAQA85X,EAAAliY,UAAA6jY,SAAA,WACA,IACAr6Z,EADA23J,EAAA,GAEA,IAAA33J,EAAA,EAAAA,EAAAi1J,EAAAukQ,OAAAx5Z,GAAA,EAAA,CACA,IAAAnB,EAAAy6Z,EAAAc,QAAA,WAAAn7Z,SAAA45B,KAAA4gY,cAAAz5Z,GAAA,IAAAf,SAAA45B,KAAA4gY,cAAAz5Z,EAAA,GAAA,KACA23J,EAAAh0J,KAAA21Z,EAAAc,QAAA,KAAAn7Z,SAAAJ,EAAA,MAEA,OAAA84J,EAAAx0J,KAAA,MAQAu1Z,EAAAliY,UAAA8jY,WAAA,WACA,OAAA,IAAAjB,EAAA7jO,WAAA38J,KAAA4gY,cAAAx2Z,KAAA,SAAAn2E,GAAA,OAAAwse,EAAAc,QAAA,OAAAn7Z,SAAAnyE,EAAA,QAAAq2E,KAAA,IAAA,KAQAu1Z,EAAAliY,UAAA+jY,cAAA,WACA,OAAA,IAAAlB,EAAA7jO,WAAA38J,KAAAg/H,OAAA,IAAAv5I,OAAA22I,EAAAwpF,KAAA5lN,KAAA+gY,YAAA,IASAlB,EAAAliY,UAAAgkY,aAAA,WACA,OAAA9B,EAAA+B,eAAA5hY,KAAA0hY,kBASA7B,EAAAliY,UAAAkkY,sBAAA,WACA,IAAAC,EAAA,IAAAtB,EAAA7jO,WAAA,KACA,OAAAkjO,EAAA+B,eAAA5hY,KAAA0hY,gBAAA1iZ,IAAA8iZ,KAQAjC,EAAAliY,UAAAokY,YAAA,WACA,OAAA,IAAAvB,EAAA7jO,WAAA38J,KAAAg/H,OAAA,IAAAv5I,OAAA22I,EAAAwpF,KAAA5lN,KAAA+gY,YAAA,IASAlB,EAAAliY,UAAAqkY,WAAA,WACA,OAAAnC,EAAA+B,eAAA5hY,KAAA+hY,gBASAlC,EAAAliY,UAAAskY,oBAAA,WACA,IAAAH,EAAA,IAAAtB,EAAA7jO,WAAA,KACA,OAAAkjO,EAAA+B,eAAA5hY,KAAA+hY,cAAAnxN,SAAAkxN,KASAjC,EAAA+B,eAAA,SAAAH,GACA,OAAA5B,EAAAyB,YAAAl7Z,SAAAq7Z,EAAArjY,WAAA,MASAyhY,EAAAliY,UAAAqhI,KAAA,SAAAA,GAIA,YAHAtpO,IAAAspO,IACAA,EAAAh/H,KAAA+gY,YAEA/gY,KAAAkiY,aAAA,EAAAljQ,IAQA6gQ,EAAAliY,UAAAukY,aAAA,SAAAltZ,EAAAhQ,GACA,OAAAg7B,KAAAmiY,gBAAA/8Z,MAAA4P,EAAAhQ,IAQA66Z,EAAAliY,UAAAykY,YAAA,WACA,OAAApiY,KAAAihY,WAAA,IAAApB,EAAA,iBAQAA,EAAAliY,UAAAwkY,cAAA,WACA,OAAAniY,KAAAyhY,aAAArjY,SAAA,GAAAiqR,SAAAjsJ,EAAAwpF,KAAA,MAMAi6K,EAAAliY,UAAA0kY,WAAA,WACA,IAAApgT,EAAAjiF,KAAA4gY,cACA,OAAA5gY,KAAAk+M,QAAAhlO,QAAAkjJ,EAAAilQ,WAAAZ,EAAAc,QAAA,4GAAAt/S,EAAA78G,MAAA,EAAA,GAAAkF,KAAA,KAAA23G,EAAA78G,MAAA,EAAA,GAAAkF,KAAA,QAEAu1Z,EA5PA,GA8PAvse,EAAAuse,SAAAA,uIC/RA,aACArse,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAA0te,UAAA1te,EAAA2te,gBAAA,EAUA3te,EAAA2te,WATA,SAAA/iL,GACA,QAAAl+M,KAAA+gY,WAAA7iL,EAAA6iL,aAGA/gY,KAAAg/H,KAAAk/E,EAAA6iL,cAAA7iL,EAAAl/E,QAiBA1rO,EAAA0te,UAXA,SAAAsB,GACA,OAAA,WACA,OAAAtiY,KAAAohY,qBAAAphY,KAAAogY,gBAGApgY,KAAA+gY,aAAAuB,IAAAtiY,KAAA6gY,cAGA7gY,KAAA6gY,eAAAx6Z,OAAA25B,KAAA+gY,6CCrBA,aACAvte,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAA4te,iBAAA5te,EAAA+te,WAAA/te,EAAAqte,OAAArte,EAAAsyT,UAAA,EACAtyT,EAAAsyT,KAAA,GACAtyT,EAAAqte,OAAA,EACArte,EAAA+te,WAAA,oKACA/te,EAAA4te,iBAAA,2CCNA,aACA,IACAqB,EADAC,EAAAxiY,MAAAA,KAAAwiY,YACAD,EAAA,SAAA3kW,EAAAtkD,GAIA,OAHAipZ,EAAA/ue,OAAA46T,gBACA,CAAAjrG,UAAA,cAAAtlH,OAAA,SAAA+/B,EAAAtkD,GAAAskD,EAAAulF,UAAA7pI,IACA,SAAAskD,EAAAtkD,GAAA,IAAA,IAAApS,KAAAoS,EAAA9lF,OAAAmqG,UAAAnD,eAAAoD,KAAAtkB,EAAApS,KAAA02D,EAAA12D,GAAAoS,EAAApS,MACA02D,EAAAtkD,IAEA,SAAAskD,EAAAtkD,GAEA,SAAAmpZ,IAAAziY,KAAA2M,YAAAixB,EADA2kW,EAAA3kW,EAAAtkD,GAEAskD,EAAAjgC,UAAA,OAAArkB,EAAA9lF,OAAAU,OAAAolF,IAAAmpZ,EAAA9kY,UAAArkB,EAAAqkB,UAAA,IAAA8kY,KAGAjve,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAA6te,kBAAA,EACA,IAAAA,EAAA,SAAAlrX,GAEA,SAAAkrX,EAAAxnZ,EAAA+oZ,GACA,IAAA1sX,EAAAC,EAAArY,KAAAoC,KAAArmB,IAAAqmB,KAKA,OAJAgW,EAAAnjH,KAAA,eACA,OAAA6ve,IACA1sX,EAAA0sX,aAAAA,GAEA1sX,EAEA,OATAwsX,EAAArB,EAAAlrX,GASAkrX,EAVA,CAWAroY,OACAxlG,EAAA6te,aAAAA,iCC5BA,WASA,IAAAnqN,EAOA,SAAAra,EAAA91L,EAAAyS,EAAA7M,GACA,MAAA5F,IACA,iBAAAA,EAAAm5B,KAAA2jJ,WAAA98K,EAAAyS,EAAA7M,GACA,MAAA6M,GAAA,iBAAAzS,EAAAm5B,KAAAqqJ,WAAAxjL,EAAA,KACAm5B,KAAAqqJ,WAAAxjL,EAAAyS,IAIA,SAAA29L,IAAA,OAAA,IAAAta,EAAA,MA+CA,IAAAgmO,EAAA,oBAAA/8T,UACA+8T,GAAA,+BAAA/8T,UAAA0xG,SACA3a,EAAAh/J,UAAA05K,GA5BA,SAAAlwM,EAAAymC,EAAA62G,EAAAnzH,EAAA7kB,EAAAx4E,GAEA,IADA,IAAAkjR,EAAA,MAAAvpK,EAAAwpK,EAAAxpK,GAAA,KACA35G,GAAA,GAAA,CACA,IAAA80F,EAAA,MAAAiX,KAAA74B,GACAsgG,EAAAznE,KAAA74B,MAAA,GACA+X,EAAAk4L,EAAAruL,EAAA0+E,EAAA0vG,EAEA1qM,IADAsc,EAAAouL,EAAApuL,IAAA,MAAA7J,IAAA,IAAAulI,EAAAnzH,IAAA,WAAA7kB,MACA,KAAAyS,IAAA,IAAAk4L,EAAA3vG,GAAAh7F,IAAA,IACAg4I,EAAAnzH,KAAA,WAAAvI,EAEA,OAAAtc,GAmBAuqM,EAAA,IAEA2rN,GAAA,YAAA/8T,UAAA0xG,SACA3a,EAAAh/J,UAAA05K,GA3CA,SAAAlwM,EAAAymC,EAAA62G,EAAAnzH,EAAA7kB,EAAAx4E,GACA,OAAAA,GAAA,GAAA,CACA,IAAA6wK,EAAAl3D,EAAA5N,KAAA74B,KAAAs9I,EAAAnzH,GAAA7kB,EACAA,EAAA7G,KAAA6nC,MAAAq3D,EAAA,UACA2/C,EAAAnzH,KAAA,SAAAwzE,EAEA,OAAAr4F,GAsCAuqM,EAAA,KAGAra,EAAAh/J,UAAA05K,GAtBA,SAAAlwM,EAAAymC,EAAA62G,EAAAnzH,EAAA7kB,EAAAx4E,GAEA,IADA,IAAAkjR,EAAA,MAAAvpK,EAAAwpK,EAAAxpK,GAAA,KACA35G,GAAA,GAAA,CACA,IAAA80F,EAAA,MAAAiX,KAAA74B,GACAsgG,EAAAznE,KAAA74B,MAAA,GACA+X,EAAAk4L,EAAAruL,EAAA0+E,EAAA0vG,EAEA1qM,IADAsc,EAAAouL,EAAApuL,IAAA,MAAA7J,IAAA,IAAAulI,EAAAnzH,GAAA7kB,IACA,KAAAyS,GAAA,IAAAk4L,EAAA3vG,EACAg9C,EAAAnzH,KAAA,UAAAvI,EAEA,OAAAtc,GAaAuqM,EAAA,IAGAra,EAAAh/J,UAAA45K,GAAAP,EACAra,EAAAh/J,UAAA65K,IAAA,GAAAR,GAAA,EACAra,EAAAh/J,UAAA85K,GAAA,GAAAT,EAGAra,EAAAh/J,UAAA+5K,GAAA9xM,KAAAy5J,IAAA,EADA,IAEAs9B,EAAAh/J,UAAAg6K,GAFA,GAEAX,EACAra,EAAAh/J,UAAAi6K,GAAA,EAAAZ,EAHA,GAMA,IAEAa,EAAAC,EADAC,EAAA,IAAAl6K,MAGA,IADAg6K,EAAA,IAAA5/L,WAAA,GACA6/L,EAAA,EAAAA,GAAA,IAAAA,EAAAC,EAAAF,KAAAC,EAEA,IADAD,EAAA,IAAA5/L,WAAA,GACA6/L,EAAA,GAAAA,EAAA,KAAAA,EAAAC,EAAAF,KAAAC,EAEA,IADAD,EAAA,IAAA5/L,WAAA,GACA6/L,EAAA,GAAAA,EAAA,KAAAA,EAAAC,EAAAF,KAAAC,EAEA,SAAAE,EAAA/jR,GAAA,MAVA,uCAUAskG,OAAAtkG,GACA,SAAAgkR,EAAA/7L,EAAA/U,GACA,IAAAsF,EAAAsrM,EAAA77L,EAAAjE,WAAA9Q,IACA,OAAA,MAAAsF,GAAA,EAAAA,EAoBA,SAAAyrM,EAAA/wM,GAAA,IAAA6mC,EAAAipK,IAAA,OAAAjpK,EAAA2lK,QAAAxsM,GAAA6mC,EA+FA,SAAAmqK,EAAAvqK,GACA,IAAAmxC,EAAA/wC,EAAA,EAMA,OALA,IAAA+wC,EAAAnxC,IAAA,MAAAA,EAAAmxC,EAAA/wC,GAAA,IACA,IAAA+wC,EAAAnxC,GAAA,KAAAA,EAAAmxC,EAAA/wC,GAAA,GACA,IAAA+wC,EAAAnxC,GAAA,KAAAA,EAAAmxC,EAAA/wC,GAAA,GACA,IAAA+wC,EAAAnxC,GAAA,KAAAA,EAAAmxC,EAAA/wC,GAAA,GACA,IAAA+wC,EAAAnxC,GAAA,KAAAA,EAAAmxC,EAAA/wC,GAAA,GACAA,EAqLA,SAAAoqK,EAAAl5L,GAAA8gB,KAAA9gB,EAAAA,EA0CA,SAAAm5L,EAAAn5L,GACA8gB,KAAA9gB,EAAAA,EACA8gB,KAAAs4K,GAAAp5L,EAAAq5L,WACAv4K,KAAAw4K,IAAA,MAAAx4K,KAAAs4K,GACAt4K,KAAAy4K,IAAAz4K,KAAAs4K,IAAA,GACAt4K,KAAAm9E,IAAA,GAAAj+F,EAAAq4L,GAAA,IAAA,EACAv3K,KAAA04K,IAAA,EAAAx5L,EAAA6/D,EAoQA,SAAA45H,EAAA/qK,EAAAC,GAAA,OAAAD,EAAAC,EAIA,SAAAkmK,EAAAnmK,EAAAC,GAAA,OAAAD,EAAAC,EAIA,SAAA+qK,EAAAhrK,EAAAC,GAAA,OAAAD,EAAAC,EAIA,SAAAgrK,EAAAjrK,EAAAC,GAAA,OAAAD,GAAAC,EA2BA,SAAAirK,EAAAlrK,GACA,GAAA,GAAAA,EAAA,OAAA,EACA,IAAAI,EAAA,EAMA,OALA,IAAA,MAAAJ,KAAAA,IAAA,GAAAI,GAAA,IACA,IAAA,IAAAJ,KAAAA,IAAA,EAAAI,GAAA,GACA,IAAA,GAAAJ,KAAAA,IAAA,EAAAI,GAAA,GACA,IAAA,EAAAJ,KAAAA,IAAA,EAAAI,GAAA,GACA,IAAA,EAAAJ,MAAAI,EACAA,EAYA,SAAA+qK,EAAAnrK,GAEA,IADA,IAAAI,EAAA,EACA,GAAAJ,GAAAA,GAAAA,EAAA,IAAAI,EACA,OAAAA,EA+GA,SAAAgrK,KACA,SAAAC,EAAArrK,GAAA,OAAAA,EAuCA,SAAAsrK,EAAAh6L,GAEA8gB,KAAAo8J,GAAA6a,IACAj3K,KAAAm5K,GAAAlC,IACAta,EAAAkU,IAAAuI,UAAA,EAAAl6L,EAAA6/D,EAAA/+C,KAAAo8J,IACAp8J,KAAA+rB,GAAA/rB,KAAAo8J,GAAAzxO,OAAAu0D,GACA8gB,KAAA9gB,EAAAA,EArgBAk5L,EAAAz6K,UAAA4oG,QATA,SAAA34F,GACA,OAAAA,EAAA1xB,EAAA,GAAA0xB,EAAAsjK,UAAAlxK,KAAA9gB,IAAA,EAAA0uB,EAAA00C,IAAAtiD,KAAA9gB,GACA0uB,GAQAwqK,EAAAz6K,UAAA07K,OANA,SAAAzrK,GAAA,OAAAA,GAOAwqK,EAAAz6K,UAAAj4B,OANA,SAAAkoC,GAAAA,EAAA0rK,SAAAt5K,KAAA9gB,EAAA,KAAA0uB,IAOAwqK,EAAAz6K,UAAA47K,MANA,SAAA3rK,EAAAC,EAAAG,GAAAJ,EAAA4rK,WAAA3rK,EAAAG,GAAAhO,KAAAt6B,OAAAsoC,IAOAoqK,EAAAz6K,UAAA87K,MANA,SAAA7rK,EAAAI,GAAAJ,EAAA8rK,SAAA1rK,GAAAhO,KAAAt6B,OAAAsoC,IAqFAqqK,EAAA16K,UAAA4oG,QAzCA,SAAA34F,GACA,IAAAI,EAAAipK,IAIA,OAHArpK,EAAAusJ,MAAAif,UAAAp5K,KAAA9gB,EAAA6/D,EAAA/wC,GACAA,EAAAsrK,SAAAt5K,KAAA9gB,EAAA,KAAA8uB,GACAJ,EAAA1xB,EAAA,GAAA8xB,EAAAkjK,UAAAvU,EAAAgd,MAAA,GAAA35K,KAAA9gB,EAAA06L,MAAA5rK,EAAAA,GACAA,GAqCAqqK,EAAA16K,UAAA07K,OAjCA,SAAAzrK,GACA,IAAAI,EAAAipK,IAGA,OAFArpK,EAAAisK,OAAA7rK,GACAhO,KAAAt6B,OAAAsoC,GACAA,GA8BAqqK,EAAA16K,UAAAj4B,OA1BA,SAAAkoC,GACA,KAAAA,EAAAmxC,GAAA/+C,KAAA04K,KACA9qK,EAAAA,EAAAmxC,KAAA,EACA,IAAA,IAAA53E,EAAA,EAAAA,EAAA64B,KAAA9gB,EAAA6/D,IAAA53E,EAAA,CAEA,IAAAmqB,EAAA,MAAAsc,EAAAzmC,GACA2yM,EAAAxoL,EAAA0O,KAAAw4K,MAAAlnL,EAAA0O,KAAAy4K,KAAA7qK,EAAAzmC,IAAA,IAAA64B,KAAAw4K,IAAAx4K,KAAAm9E,KAAA,IAAAvvE,EAAA4pK,GAKA,IAFA5pK,EADAtc,EAAAnqB,EAAA64B,KAAA9gB,EAAA6/D,IACA/+C,KAAA9gB,EAAAm4L,GAAA,EAAAyC,EAAAlsK,EAAAzmC,EAAA,EAAA64B,KAAA9gB,EAAA6/D,GAEAnxC,EAAAtc,IAAAsc,EAAA6pK,IAAA7pK,EAAAtc,IAAAsc,EAAA6pK,GAAA7pK,IAAAtc,KAEAsc,EAAAmsK,QACAnsK,EAAAosK,UAAAh6K,KAAA9gB,EAAA6/D,EAAAnxC,GACAA,EAAAsjK,UAAAlxK,KAAA9gB,IAAA,GAAA0uB,EAAAgsK,MAAA55K,KAAA9gB,EAAA0uB,IAYAyqK,EAAA16K,UAAA47K,MALA,SAAA3rK,EAAAC,EAAAG,GAAAJ,EAAA4rK,WAAA3rK,EAAAG,GAAAhO,KAAAt6B,OAAAsoC,IAMAqqK,EAAA16K,UAAA87K,MATA,SAAA7rK,EAAAI,GAAAJ,EAAA8rK,SAAA1rK,GAAAhO,KAAAt6B,OAAAsoC,IAmCA2uJ,EAAAh/J,UAAAk8K,OAtaA,SAAA7rK,GACA,IAAA,IAAA7mC,EAAA64B,KAAA++C,EAAA,EAAA53E,GAAA,IAAAA,EAAA6mC,EAAA7mC,GAAA64B,KAAA74B,GACA6mC,EAAA+wC,EAAA/+C,KAAA++C,EACA/wC,EAAA9xB,EAAA8jB,KAAA9jB,GAoaAygL,EAAAh/J,UAAAg2K,QAhaA,SAAA/lK,GACA5N,KAAA++C,EAAA,EACA/+C,KAAA9jB,EAAA0xB,EAAA,GAAA,EAAA,EACAA,EAAA,EAAA5N,KAAA,GAAA4N,EACAA,GAAA,EAAA5N,KAAA,GAAA4N,EAAA5N,KAAAy3K,GACAz3K,KAAA++C,EAAA,GA4ZA49G,EAAAh/J,UAAA0sJ,WArZA,SAAAnuK,EAAA5C,GACA,IAAAjlF,EACA,GAAA,IAAAilF,EAAAjlF,EAAA,OACA,GAAA,GAAAilF,EAAAjlF,EAAA,OACA,GAAA,KAAAilF,EAAAjlF,EAAA,OACA,GAAA,GAAAilF,EAAAjlF,EAAA,OACA,GAAA,IAAAilF,EAAAjlF,EAAA,MACA,CAAA,GAAA,GAAAilF,EACA,YAAA0mB,KAAAi6K,UAAA/9L,EAAA5C,GADAjlF,EAAA,EAEA2rG,KAAA++C,EAAA,EACA/+C,KAAA9jB,EAAA,EAEA,IADA,IAAA/U,EAAA+U,EAAAjX,OAAAi1M,GAAA,EAAAC,EAAA,IACAhzM,GAAA,GAAA,CACA,IAAAymC,EAAA,GAAAv5G,EAAA,IAAA6nF,EAAA/U,GAAA8wM,EAAA/7L,EAAA/U,GACAymC,EAAA,EACA,KAAA1xB,EAAAqc,OAAApxB,KAAA+yM,GAAA,IAGAA,GAAA,EACA,GAAAC,EACAn6K,KAAAA,KAAA++C,KAAAnxC,EACAusK,EAAA9lR,EAAA2rG,KAAAu3K,IACAv3K,KAAAA,KAAA++C,EAAA,KAAAnxC,GAAA,GAAA5N,KAAAu3K,GAAA4C,GAAA,IAAAA,EACAn6K,KAAAA,KAAA++C,KAAAnxC,GAAA5N,KAAAu3K,GAAA4C,GAGAn6K,KAAAA,KAAA++C,EAAA,IAAAnxC,GAAAusK,GACAA,GAAA9lR,IACA2rG,KAAAu3K,KAAA4C,GAAAn6K,KAAAu3K,KAEA,GAAAljR,GAAA,IAAA,IAAA6nF,EAAA,MACA8jB,KAAA9jB,GAAA,EACAi+L,EAAA,IAAAn6K,KAAAA,KAAA++C,EAAA,KAAA,GAAA/+C,KAAAu3K,GAAA4C,GAAA,GAAAA,IAEAn6K,KAAA+5K,QACAG,GAAAvd,EAAAgd,KAAAC,MAAA55K,KAAAA,OAmXA28J,EAAAh/J,UAAAo8K,MA/WA,WAEA,IADA,IAAAttM,EAAAuzB,KAAA9jB,EAAA8jB,KAAAw3K,GACAx3K,KAAA++C,EAAA,GAAA/+C,KAAAA,KAAA++C,EAAA,IAAAtyE,KAAAuzB,KAAA++C,GA8WA49G,EAAAh/J,UAAAy7K,UA1SA,SAAAnlR,EAAA+5G,GACA,IAAA7mC,EACA,IAAAA,EAAA64B,KAAA++C,EAAA,EAAA53E,GAAA,IAAAA,EAAA6mC,EAAA7mC,EAAAlzE,GAAA+rG,KAAA74B,GACA,IAAAA,EAAAlzE,EAAA,EAAAkzE,GAAA,IAAAA,EAAA6mC,EAAA7mC,GAAA,EACA6mC,EAAA+wC,EAAA/+C,KAAA++C,EAAA9qJ,EACA+5G,EAAA9xB,EAAA8jB,KAAA9jB,GAsSAygL,EAAAh/J,UAAAq8K,UAlSA,SAAA/lR,EAAA+5G,GACA,IAAA,IAAA7mC,EAAAlzE,EAAAkzE,EAAA64B,KAAA++C,IAAA53E,EAAA6mC,EAAA7mC,EAAAlzE,GAAA+rG,KAAA74B,GACA6mC,EAAA+wC,EAAAn5E,KAAAD,IAAAq6B,KAAA++C,EAAA9qJ,EAAA,GACA+5G,EAAA9xB,EAAA8jB,KAAA9jB,GAgSAygL,EAAAh/J,UAAAy8K,SA5RA,SAAAnmR,EAAA+5G,GACA,IAGA7mC,EAHAkzM,EAAApmR,EAAA+rG,KAAAu3K,GACA+C,EAAAt6K,KAAAu3K,GAAA8C,EACA/lF,GAAA,GAAAgmF,GAAA,EACAC,EAAA30M,KAAA6nC,MAAAx5G,EAAA+rG,KAAAu3K,IAAA9qM,EAAAuzB,KAAA9jB,GAAAm+L,EAAAr6K,KAAAw3K,GACA,IAAArwM,EAAA64B,KAAA++C,EAAA,EAAA53E,GAAA,IAAAA,EACA6mC,EAAA7mC,EAAAozM,EAAA,GAAAv6K,KAAA74B,IAAAmzM,EAAA7tM,EACAA,GAAAuzB,KAAA74B,GAAAmtH,IAAA+lF,EAEA,IAAAlzM,EAAAozM,EAAA,EAAApzM,GAAA,IAAAA,EAAA6mC,EAAA7mC,GAAA,EACA6mC,EAAAusK,GAAA9tM,EACAuhC,EAAA+wC,EAAA/+C,KAAA++C,EAAAw7H,EAAA,EACAvsK,EAAA9xB,EAAA8jB,KAAA9jB,EACA8xB,EAAA+rK,SAgRApd,EAAAh/J,UAAA68K,SA5QA,SAAAvmR,EAAA+5G,GACAA,EAAA9xB,EAAA8jB,KAAA9jB,EACA,IAAAq+L,EAAA30M,KAAA6nC,MAAAx5G,EAAA+rG,KAAAu3K,IACA,GAAAgD,GAAAv6K,KAAA++C,EAAA/wC,EAAA+wC,EAAA,MAAA,CACA,IAAAs7H,EAAApmR,EAAA+rG,KAAAu3K,GACA+C,EAAAt6K,KAAAu3K,GAAA8C,EACA/lF,GAAA,GAAA+lF,GAAA,EACArsK,EAAA,GAAAhO,KAAAu6K,IAAAF,EACA,IAAA,IAAAlzM,EAAAozM,EAAA,EAAApzM,EAAA64B,KAAA++C,IAAA53E,EACA6mC,EAAA7mC,EAAAozM,EAAA,KAAAv6K,KAAA74B,GAAAmtH,IAAAgmF,EACAtsK,EAAA7mC,EAAAozM,GAAAv6K,KAAA74B,IAAAkzM,EAEAA,EAAA,IAAArsK,EAAAhO,KAAA++C,EAAAw7H,EAAA,KAAAv6K,KAAA9jB,EAAAo4G,IAAAgmF,GACAtsK,EAAA+wC,EAAA/+C,KAAA++C,EAAAw7H,EACAvsK,EAAA+rK,UA+PApd,EAAAh/J,UAAAi8K,MA3PA,SAAA/yM,EAAAmnC,GAEA,IADA,IAAA7mC,EAAA,EAAAsF,EAAA,EAAAyS,EAAAtZ,KAAAq0B,IAAApzB,EAAAk4E,EAAA/+C,KAAA++C,GACA53E,EAAA+X,GACAzS,GAAAuzB,KAAA74B,GAAAN,EAAAM,GACA6mC,EAAA7mC,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA,GAAA1wM,EAAAk4E,EAAA/+C,KAAA++C,EAAA,CAEA,IADAtyE,GAAA5F,EAAAqV,EACA/U,EAAA64B,KAAA++C,GACAtyE,GAAAuzB,KAAA74B,GACA6mC,EAAA7mC,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA9qM,GAAAuzB,KAAA9jB,MAEA,CAEA,IADAzP,GAAAuzB,KAAA9jB,EACA/U,EAAAN,EAAAk4E,GACAtyE,GAAA5F,EAAAM,GACA6mC,EAAA7mC,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA9qM,GAAA5F,EAAAqV,EAEA8xB,EAAA9xB,EAAAzP,EAAA,GAAA,EAAA,EACAA,GAAA,EAAAuhC,EAAA7mC,KAAA64B,KAAAy3K,GAAAhrM,EACAA,EAAA,IAAAuhC,EAAA7mC,KAAAsF,GACAuhC,EAAA+wC,EAAA53E,EACA6mC,EAAA+rK,SA+NApd,EAAAh/J,UAAA67K,WA1NA,SAAA3yM,EAAAmnC,GACA,IAAAJ,EAAA5N,KAAAm6J,MAAAtsJ,EAAAhnC,EAAAszL,MACAhzL,EAAAymC,EAAAmxC,EAEA,IADA/wC,EAAA+wC,EAAA53E,EAAA0mC,EAAAkxC,IACA53E,GAAA,GAAA6mC,EAAA7mC,GAAA,EACA,IAAAA,EAAA,EAAAA,EAAA0mC,EAAAkxC,IAAA53E,EAAA6mC,EAAA7mC,EAAAymC,EAAAmxC,GAAAnxC,EAAAypK,GAAA,EAAAxpK,EAAA1mC,GAAA6mC,EAAA7mC,EAAA,EAAAymC,EAAAmxC,GACA/wC,EAAA9xB,EAAA,EACA8xB,EAAA+rK,QACA/5K,KAAA9jB,GAAArV,EAAAqV,GAAAygL,EAAAgd,KAAAC,MAAA5rK,EAAAA,IAmNA2uJ,EAAAh/J,UAAA+7K,SA/MA,SAAA1rK,GAGA,IAFA,IAAAJ,EAAA5N,KAAAm6J,MACAhzL,EAAA6mC,EAAA+wC,EAAA,EAAAnxC,EAAAmxC,IACA53E,GAAA,GAAA6mC,EAAA7mC,GAAA,EACA,IAAAA,EAAA,EAAAA,EAAAymC,EAAAmxC,EAAA,IAAA53E,EAAA,CACA,IAAAsF,EAAAmhC,EAAAypK,GAAAlwM,EAAAymC,EAAAzmC,GAAA6mC,EAAA,EAAA7mC,EAAA,EAAA,IACA6mC,EAAA7mC,EAAAymC,EAAAmxC,IAAAnxC,EAAAypK,GAAAlwM,EAAA,EAAA,EAAAymC,EAAAzmC,GAAA6mC,EAAA,EAAA7mC,EAAA,EAAAsF,EAAAmhC,EAAAmxC,EAAA53E,EAAA,KAAAymC,EAAA6pK,KACAzpK,EAAA7mC,EAAAymC,EAAAmxC,IAAAnxC,EAAA6pK,GACAzpK,EAAA7mC,EAAAymC,EAAAmxC,EAAA,GAAA,GAGA/wC,EAAA+wC,EAAA,IAAA/wC,EAAAA,EAAA+wC,EAAA,IAAAnxC,EAAAypK,GAAAlwM,EAAAymC,EAAAzmC,GAAA6mC,EAAA,EAAA7mC,EAAA,EAAA,IACA6mC,EAAA9xB,EAAA,EACA8xB,EAAA+rK,SAmMApd,EAAAh/J,UAAA27K,SA9LA,SAAAp6L,EAAAovB,EAAAN,GACA,IAAAysK,EAAAv7L,EAAAi7K,MACA,KAAAsgB,EAAA17H,GAAA,GAAA,CACA,IAAA27H,EAAA16K,KAAAm6J,MACA,GAAAugB,EAAA37H,EAAA07H,EAAA17H,EAGA,OAFA,MAAAzwC,GAAAA,EAAAqlK,QAAA,QACA,MAAA3lK,GAAAhO,KAAA65K,OAAA7rK,IAGA,MAAAA,IAAAA,EAAAipK,KACA,IAAAppK,EAAAopK,IAAA0D,EAAA36K,KAAA9jB,EAAA4zI,EAAA5wI,EAAAhD,EACA0+L,EAAA56K,KAAAu3K,GAAAY,EAAAsC,EAAAA,EAAA17H,EAAA,IACA67H,EAAA,GAAAH,EAAAL,SAAAQ,EAAA/sK,GAAA6sK,EAAAN,SAAAQ,EAAA5sK,KACAysK,EAAAZ,OAAAhsK,GAAA6sK,EAAAb,OAAA7rK,IACA,IAAA6sK,EAAAhtK,EAAAkxC,EACA+7H,EAAAjtK,EAAAgtK,EAAA,GACA,GAAA,GAAAC,EAAA,CACA,IAAAC,EAAAD,GAAA,GAAA96K,KAAA23K,KAAAkD,EAAA,EAAAhtK,EAAAgtK,EAAA,IAAA76K,KAAA43K,GAAA,GACAoD,EAAAh7K,KAAA03K,GAAAqD,EAAAE,GAAA,GAAAj7K,KAAA23K,IAAAoD,EAAAhnR,EAAA,GAAAisG,KAAA43K,GACAzwM,EAAA6mC,EAAA+wC,EAAAztD,EAAAnqB,EAAA0zM,EAAA97H,EAAA,MAAAzwC,EAAA2oK,IAAA3oK,EAQA,IAPAT,EAAAurK,UAAA9nL,EAAAytD,GACA/wC,EAAAkjK,UAAAnyH,IAAA,IACA/wC,EAAAA,EAAA+wC,KAAA,EACA/wC,EAAA4rK,MAAA76H,EAAA/wC,IAEA2uJ,EAAAkU,IAAAuI,UAAAyB,EAAA97H,GACAA,EAAA66H,MAAA/rK,EAAAA,GACAA,EAAAkxC,EAAA87H,GAAAhtK,EAAAA,EAAAkxC,KAAA,EACA,OAAAztD,GAAA,GAAA,CAEA,IAAA4pL,EAAAltK,IAAA7mC,IAAA2zM,EAAA96K,KAAAw3K,GAAA5xM,KAAA6nC,MAAAO,EAAA7mC,GAAA6zM,GAAAhtK,EAAA7mC,EAAA,GAAApzE,GAAAknR,GACA,IAAAjtK,EAAA7mC,IAAA0mC,EAAAwpK,GAAA,EAAA6D,EAAAltK,EAAA1c,EAAA,EAAAupL,IAAAK,EAGA,IAFArtK,EAAAurK,UAAA9nL,EAAAytD,GACA/wC,EAAA4rK,MAAA76H,EAAA/wC,GACAA,EAAA7mC,KAAA+zM,GAAAltK,EAAA4rK,MAAA76H,EAAA/wC,GAGA,MAAAM,IACAN,EAAAgsK,UAAAa,EAAAvsK,GACAqsK,GAAA7qD,GAAA6sC,EAAAgd,KAAAC,MAAAtrK,EAAAA,IAEAN,EAAA+wC,EAAA87H,EACA7sK,EAAA+rK,QACAa,EAAA,GAAA5sK,EAAAwsK,SAAAI,EAAA5sK,GACA2sK,EAAA,GAAAhe,EAAAgd,KAAAC,MAAA5rK,EAAAA,MAmJA2uJ,EAAAh/J,UAAA46K,SA7GA,WACA,GAAAv4K,KAAA++C,EAAA,EAAA,OAAA,EACA,IAAAnxC,EAAA5N,KAAA,GACA,GAAA,IAAA,EAAA4N,GAAA,OAAA,EACA,IAAAC,EAAA,EAAAD,EAQA,OAFAC,GAHAA,GADAA,GADAA,EAAAA,GAAA,GAAA,GAAAD,GAAAC,GAAA,KACA,GAAA,IAAAD,GAAAC,GAAA,MACA,IAAA,MAAAD,GAAAC,EAAA,QAAA,QAGA,EAAAD,EAAAC,EAAA7N,KAAAy3K,IAAAz3K,KAAAy3K,IAEA,EAAAz3K,KAAAy3K,GAAA5pK,GAAAA,GAkGA8uJ,EAAAh/J,UAAAw9K,OApCA,WAAA,OAAA,IAAAn7K,KAAA++C,EAAA,EAAA,EAAA/+C,KAAA,GAAAA,KAAA9jB,IAqCAygL,EAAAh/J,UAAAp2B,IAlCA,SAAAxzE,EAAAwxN,GACA,GAAAxxN,EAAA,YAAAA,EAAA,EAAA,OAAA4oQ,EAAAkU,IACA,IAAA7iK,EAAAipK,IAAA7a,EAAA6a,IAAA7yD,EAAAmB,EAAAhf,QAAAvmG,MAAA74B,EAAAgxM,EAAApkR,GAAA,EAEA,IADAqwN,EAAAy1D,OAAA7rK,KACA7mC,GAAA,GAEA,GADAo+I,EAAAk0D,MAAAzrK,EAAAouJ,IACAroQ,EAAA,GAAAozE,GAAA,EAAAo+I,EAAAg0D,MAAAnd,EAAAh4C,EAAAp2G,OACA,CAAA,IAAA+wC,EAAA/wC,EAAAA,EAAAouJ,EAAAA,EAAAr9G,EAEA,OAAAwmE,EAAA8zD,OAAArrK,IA4BA2uJ,EAAAh/J,UAAAS,SAvXA,SAAA9kB,GACA,GAAA0mB,KAAA9jB,EAAA,EAAA,MAAA,IAAA8jB,KAAAo7K,SAAAh9K,SAAA9kB,GACA,IAAAjlF,EACA,GAAA,IAAAilF,EAAAjlF,EAAA,OACA,GAAA,GAAAilF,EAAAjlF,EAAA,OACA,GAAA,GAAAilF,EAAAjlF,EAAA,OACA,GAAA,IAAAilF,EAAAjlF,EAAA,MACA,CAAA,GAAA,GAAAilF,EACA,OAAA0mB,KAAAq7K,QAAA/hM,GADAjlF,EAAA,EAEA,IAAAupI,EAAA09I,GAAA,GAAAjnR,GAAA,EAAA6qF,GAAA,EAAA8uB,EAAA,GAAA7mC,EAAA64B,KAAA++C,EACA73E,EAAA84B,KAAAu3K,GAAApwM,EAAA64B,KAAAu3K,GAAAljR,EACA,GAAA8yE,KAAA,EAEA,IADAD,EAAA84B,KAAAu3K,KAAA35I,EAAA59B,KAAA74B,IAAAD,GAAA,IAAAgY,GAAA,EAAA8uB,EAAAgqK,EAAAp6I,IACAz2D,GAAA,GACAD,EAAA7yE,GACAupI,GAAA59B,KAAA74B,IAAA,GAAAD,GAAA,IAAA7yE,EAAA6yE,EACA02D,GAAA59B,OAAA74B,KAAAD,GAAA84B,KAAAu3K,GAAAljR,KAGAupI,EAAA59B,KAAA74B,KAAAD,GAAA7yE,GAAAinR,EACAp0M,GAAA,IAAAA,GAAA84B,KAAAu3K,KAAApwM,IAEAy2D,EAAA,IAAA1+C,GAAA,GACAA,IAAA8uB,GAAAgqK,EAAAp6I,IAGA,OAAA1+C,EAAA8uB,EAAA,KA8VA2uJ,EAAAh/J,UAAAy9K,OA1VA,WAAA,IAAAptK,EAAAipK,IAAA,OAAAta,EAAAgd,KAAAC,MAAA55K,KAAAgO,GAAAA,GA2VA2uJ,EAAAh/J,UAAAw8J,IAxVA,WAAA,OAAAn6J,KAAA9jB,EAAA,EAAA8jB,KAAAo7K,SAAAp7K,MAyVA28J,EAAAh/J,UAAAuzK,UAtVA,SAAArqM,GACA,IAAAmnC,EAAAhO,KAAA9jB,EAAArV,EAAAqV,EACA,GAAA,GAAA8xB,EAAA,OAAAA,EACA,IAAA7mC,EAAA64B,KAAA++C,EAEA,GAAA,IADA/wC,EAAA7mC,EAAAN,EAAAk4E,GACA,OAAA/+C,KAAA9jB,EAAA,GAAA8xB,EAAAA,EACA,OAAA7mC,GAAA,MAAA,IAAA6mC,EAAAhO,KAAA74B,GAAAN,EAAAM,IAAA,OAAA6mC,EACA,OAAA,GAgVA2uJ,EAAAh/J,UAAAszK,UAjUA,WACA,OAAAjxK,KAAA++C,GAAA,EAAA,EACA/+C,KAAAu3K,IAAAv3K,KAAA++C,EAAA,GAAAo5H,EAAAn4K,KAAAA,KAAA++C,EAAA,GAAA/+C,KAAA9jB,EAAA8jB,KAAAw3K,KAgUA7a,EAAAh/J,UAAA2kD,IAzJA,SAAAz7E,GACA,IAAAmnC,EAAAipK,IAGA,OAFAj3K,KAAAm6J,MAAAmf,SAAAzyM,EAAA,KAAAmnC,GACAhO,KAAA9jB,EAAA,GAAA8xB,EAAAkjK,UAAAvU,EAAAgd,MAAA,GAAA9yM,EAAA+yM,MAAA5rK,EAAAA,GACAA,GAsJA2uJ,EAAAh/J,UAAA49K,UA9BA,SAAAxnR,EAAAmrF,GACA,IAAAqmI,EAEA,OADAA,EAAAxxN,EAAA,KAAAmrF,EAAAi8L,SAAA,IAAA/C,EAAAl5L,GAAA,IAAAm5L,EAAAn5L,GACA8gB,KAAAz4B,IAAAxzE,EAAAwxN,IA8BAo3C,EAAAgd,KAAAzB,EAAA,GACAvb,EAAAkU,IAAAqH,EAAA,GAgVAc,EAAAr7K,UAAA4oG,QAAA0yE,EACAD,EAAAr7K,UAAA07K,OAAAJ,EACAD,EAAAr7K,UAAA47K,MALA,SAAA3rK,EAAAC,EAAAG,GAAAJ,EAAA4rK,WAAA3rK,EAAAG,IAMAgrK,EAAAr7K,UAAA87K,MALA,SAAA7rK,EAAAI,GAAAJ,EAAA8rK,SAAA1rK,IAuEAkrK,EAAAv7K,UAAA4oG,QAzBA,SAAA34F,GACA,GAAAA,EAAA1xB,EAAA,GAAA0xB,EAAAmxC,EAAA,EAAA/+C,KAAA9gB,EAAA6/D,EAAA,OAAAnxC,EAAA00C,IAAAtiD,KAAA9gB,GACA,GAAA0uB,EAAAsjK,UAAAlxK,KAAA9gB,GAAA,EAAA,OAAA0uB,EACA,IAAAI,EAAAipK,IAAA,OAAArpK,EAAAisK,OAAA7rK,GAAAhO,KAAAt6B,OAAAsoC,GAAAA,GAuBAkrK,EAAAv7K,UAAA07K,OApBA,SAAAzrK,GAAA,OAAAA,GAqBAsrK,EAAAv7K,UAAAj4B,OAlBA,SAAAkoC,GAKA,IAJAA,EAAAosK,UAAAh6K,KAAA9gB,EAAA6/D,EAAA,EAAA/+C,KAAAo8J,IACAxuJ,EAAAmxC,EAAA/+C,KAAA9gB,EAAA6/D,EAAA,IAAAnxC,EAAAmxC,EAAA/+C,KAAA9gB,EAAA6/D,EAAA,EAAAnxC,EAAAmsK,SACA/5K,KAAA+rB,GAAAyvJ,gBAAAx7K,KAAAo8J,GAAAp8J,KAAA9gB,EAAA6/D,EAAA,EAAA/+C,KAAAm5K,IACAn5K,KAAA9gB,EAAAu8L,gBAAAz7K,KAAAm5K,GAAAn5K,KAAA9gB,EAAA6/D,EAAA,EAAA/+C,KAAAo8J,IACAxuJ,EAAAsjK,UAAAlxK,KAAAo8J,IAAA,GAAAxuJ,EAAAwmK,WAAA,EAAAp0K,KAAA9gB,EAAA6/D,EAAA,GAEA,IADAnxC,EAAAgsK,MAAA55K,KAAAo8J,GAAAxuJ,GACAA,EAAAsjK,UAAAlxK,KAAA9gB,IAAA,GAAA0uB,EAAAgsK,MAAA55K,KAAA9gB,EAAA0uB,IAYAsrK,EAAAv7K,UAAA47K,MALA,SAAA3rK,EAAAC,EAAAG,GAAAJ,EAAA4rK,WAAA3rK,EAAAG,GAAAhO,KAAAt6B,OAAAsoC,IAMAkrK,EAAAv7K,UAAA87K,MATA,SAAA7rK,EAAAI,GAAAJ,EAAA8rK,SAAA1rK,GAAAhO,KAAAt6B,OAAAsoC,IAsJA,IAsHA40X,EACAC,EACAC,EAxHApnN,EAAA,CAAA,EAAA,EAAA,EAAA,EAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,GAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,IAAA,KACAC,GAAA,GAAA,IAAAD,EAAAA,EAAAz2M,OAAA,GAmIA,SAAA89Z,IATA,IAAAn1X,EAAAA,GAUA,IAAA7P,MAAAvB,UATAqmY,EAAAC,MAAA,IAAAl1X,EACAi1X,EAAAC,MAAAl1X,GAAA,EAAA,IACAi1X,EAAAC,MAAAl1X,GAAA,GAAA,IACAi1X,EAAAC,MAAAl1X,GAAA,GAAA,IACAk1X,GAAAE,IAAAF,GAAAE,GASA,GAzFArmO,EAAAh/J,UAAAi+K,UArjBA,SAAA5tK,GAAA,OAAApoC,KAAA6nC,MAAA7nC,KAAA2iL,IAAAvoJ,KAAAu3K,GAAA3xM,KAAAymJ,IAAAr+G,KAsjBA2uJ,EAAAh/J,UAAA09K,QA5iBA,SAAA/hM,GAEA,GADA,MAAAA,IAAAA,EAAA,IACA,GAAA0mB,KAAA67K,UAAAviM,EAAA,GAAAA,EAAA,GAAA,MAAA,IACA,IAAAwiM,EAAA97K,KAAA47K,UAAAtiM,GACAzS,EAAAjB,KAAAy5J,IAAA/lJ,EAAAwiM,GACAl+I,EAAAs6I,EAAArxM,GAAAgnC,EAAAopK,IAAA1xD,EAAA0xD,IAAAjpK,EAAA,GAEA,IADAhO,KAAAs5K,SAAA17I,EAAA/vB,EAAA03G,GACA13G,EAAAguK,SAAA,GACA7tK,GAAAnnC,EAAA0+I,EAAAw2D,YAAA39K,SAAA9kB,GAAAzT,OAAA,GAAAmoC,EACAH,EAAAyrK,SAAA17I,EAAA/vB,EAAA03G,GAEA,OAAAA,EAAAw2D,WAAA39K,SAAA9kB,GAAA00B,GAkiBA2uJ,EAAAh/J,UAAAs8K,UA9hBA,SAAA/9L,EAAA5C,GACA0mB,KAAA2zK,QAAA,GACA,MAAAr6L,IAAAA,EAAA,IAGA,IAFA,IAAAwiM,EAAA97K,KAAA47K,UAAAtiM,GACAskD,EAAAh4D,KAAAy5J,IAAA/lJ,EAAAwiM,GAAA5B,GAAA,EAAA5oL,EAAA,EAAAmzH,EAAA,EACAt9I,EAAA,EAAAA,EAAA+U,EAAAjX,SAAAkC,EAAA,CACA,IAAAymC,EAAAqqK,EAAA/7L,EAAA/U,GACAymC,EAAA,EACA,KAAA1xB,EAAAqc,OAAApxB,IAAA,GAAA64B,KAAA67K,WAAA3B,GAAA,IAGAz1D,EAAAnrI,EAAAmrI,EAAA72G,IACAtc,GAAAwqL,IACA97K,KAAAg8K,UAAAp+I,GACA59B,KAAAo0K,WAAA3vD,EAAA,GACAnzH,EAAA,EACAmzH,EAAA,IAGAnzH,EAAA,IACA0O,KAAAg8K,UAAAp2M,KAAAy5J,IAAA/lJ,EAAAgY,IACA0O,KAAAo0K,WAAA3vD,EAAA,IAEAy1D,GAAAvd,EAAAgd,KAAAC,MAAA55K,KAAAA,OAwgBA28J,EAAAh/J,UAAAgmJ,WApgBA,SAAA98K,EAAAyS,EAAA7M,GACA,GAAA,iBAAA6M,EAEA,GAAAzS,EAAA,EAAAm5B,KAAA2zK,QAAA,QAMA,IAJA3zK,KAAA2jJ,WAAA98K,EAAA4F,GACAuzB,KAAAi0K,QAAAptM,EAAA,IACAm5B,KAAAk0K,UAAAvX,EAAAkU,IAAAsD,UAAAttM,EAAA,GAAAktM,EAAA/zK,MACAA,KAAAm7K,UAAAn7K,KAAAo0K,WAAA,EAAA,IACAp0K,KAAAs0K,gBAAAh7L,IACA0mB,KAAAo0K,WAAA,EAAA,GACAp0K,KAAAixK,YAAApqM,GAAAm5B,KAAA45K,MAAAjd,EAAAkU,IAAAsD,UAAAttM,EAAA,GAAAm5B,UAIA,CAEA,IAAA4N,EAAA,IAAA/P,MAAAkhD,EAAA,EAAAl4E,EACA+mC,EAAA3oC,OAAA,GAAA4B,GAAA,GACAyS,EAAAk6L,UAAA5lK,GACAmxC,EAAA,EAAAnxC,EAAA,KAAA,GAAAmxC,GAAA,EAAAnxC,EAAA,GAAA,EACA5N,KAAAqqJ,WAAAz8I,EAAA,OAgfA+uJ,EAAAh/J,UAAAu2K,UA9cA,SAAArtM,EAAAmqF,EAAAhjD,GACA,IAAA7mC,EAAAu6E,EAAAxiE,EAAAtZ,KAAAq0B,IAAApzB,EAAAk4E,EAAA/+C,KAAA++C,GACA,IAAA53E,EAAA,EAAAA,EAAA+X,IAAA/X,EAAA6mC,EAAA7mC,GAAA6pF,EAAAhxD,KAAA74B,GAAAN,EAAAM,IACA,GAAAN,EAAAk4E,EAAA/+C,KAAA++C,EAAA,CAEA,IADA2C,EAAA76E,EAAAqV,EAAA8jB,KAAAw3K,GACArwM,EAAA+X,EAAA/X,EAAA64B,KAAA++C,IAAA53E,EAAA6mC,EAAA7mC,GAAA6pF,EAAAhxD,KAAA74B,GAAAu6E,GACA1zC,EAAA+wC,EAAA/+C,KAAA++C,MAEA,CAEA,IADA2C,EAAA1hD,KAAA9jB,EAAA8jB,KAAAw3K,GACArwM,EAAA+X,EAAA/X,EAAAN,EAAAk4E,IAAA53E,EAAA6mC,EAAA7mC,GAAA6pF,EAAAtP,EAAA76E,EAAAM,IACA6mC,EAAA+wC,EAAAl4E,EAAAk4E,EAEA/wC,EAAA9xB,EAAA80E,EAAAhxD,KAAA9jB,EAAArV,EAAAqV,GACA8xB,EAAA+rK,SAicApd,EAAAh/J,UAAAs+K,UA7WA,SAAAhoR,EAAA+8J,GACA,IAAAhjD,EAAA2uJ,EAAAkU,IAAAsD,UAAAlgR,GAEA,OADA+rG,KAAAk0K,UAAAlmK,EAAAgjD,EAAAhjD,GACAA,GA2WA2uJ,EAAAh/J,UAAAu+K,MA9VA,SAAAr1M,EAAAmnC,GAEA,IADA,IAAA7mC,EAAA,EAAAsF,EAAA,EAAAyS,EAAAtZ,KAAAq0B,IAAApzB,EAAAk4E,EAAA/+C,KAAA++C,GACA53E,EAAA+X,GACAzS,GAAAuzB,KAAA74B,GAAAN,EAAAM,GACA6mC,EAAA7mC,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA,GAAA1wM,EAAAk4E,EAAA/+C,KAAA++C,EAAA,CAEA,IADAtyE,GAAA5F,EAAAqV,EACA/U,EAAA64B,KAAA++C,GACAtyE,GAAAuzB,KAAA74B,GACA6mC,EAAA7mC,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA9qM,GAAAuzB,KAAA9jB,MAEA,CAEA,IADAzP,GAAAuzB,KAAA9jB,EACA/U,EAAAN,EAAAk4E,GACAtyE,GAAA5F,EAAAM,GACA6mC,EAAA7mC,KAAAsF,EAAAuzB,KAAAw3K,GACA/qM,IAAAuzB,KAAAu3K,GAEA9qM,GAAA5F,EAAAqV,EAEA8xB,EAAA9xB,EAAAzP,EAAA,GAAA,EAAA,EACAA,EAAA,EAAAuhC,EAAA7mC,KAAAsF,EACAA,GAAA,IAAAuhC,EAAA7mC,KAAA64B,KAAAy3K,GAAAhrM,GACAuhC,EAAA+wC,EAAA53E,EACA6mC,EAAA+rK,SAkUApd,EAAAh/J,UAAAq+K,UArSA,SAAA/nR,GACA+rG,KAAAA,KAAA++C,GAAA/+C,KAAAq3K,GAAA,EAAApjR,EAAA,EAAA+rG,KAAA,EAAA,EAAAA,KAAA++C,KACA/+C,KAAA++C,EACA/+C,KAAA+5K,SAmSApd,EAAAh/J,UAAAy2K,WA/RA,SAAAngR,EAAAwwN,GACA,GAAA,GAAAxwN,EAAA,CACA,KAAA+rG,KAAA++C,GAAA0lE,GAAAzkH,KAAAA,KAAA++C,KAAA,EAEA,IADA/+C,KAAAykH,IAAAxwN,EACA+rG,KAAAykH,IAAAzkH,KAAAy3K,IACAz3K,KAAAykH,IAAAzkH,KAAAy3K,KACAhzD,GAAAzkH,KAAA++C,IAAA/+C,KAAAA,KAAA++C,KAAA,KACA/+C,KAAAykH,KAyRAk4C,EAAAh/J,UAAA89K,gBArQA,SAAA50M,EAAA5yE,EAAA+5G,GACA,IAIA1c,EAJAnqB,EAAAvB,KAAAq0B,IAAA+F,KAAA++C,EAAAl4E,EAAAk4E,EAAA9qJ,GAGA,IAFA+5G,EAAA9xB,EAAA,EACA8xB,EAAA+wC,EAAA53E,EACAA,EAAA,GAAA6mC,IAAA7mC,GAAA,EAEA,IAAAmqB,EAAA0c,EAAA+wC,EAAA/+C,KAAA++C,EAAA53E,EAAAmqB,IAAAnqB,EAAA6mC,EAAA7mC,EAAA64B,KAAA++C,GAAA/+C,KAAAq3K,GAAA,EAAAxwM,EAAAM,GAAA6mC,EAAA7mC,EAAA,EAAA64B,KAAA++C,GACA,IAAAztD,EAAA1rB,KAAAq0B,IAAApzB,EAAAk4E,EAAA9qJ,GAAAkzE,EAAAmqB,IAAAnqB,EAAA64B,KAAAq3K,GAAA,EAAAxwM,EAAAM,GAAA6mC,EAAA7mC,EAAA,EAAAlzE,EAAAkzE,GACA6mC,EAAA+rK,SA8PApd,EAAAh/J,UAAA69K,gBAzPA,SAAA30M,EAAA5yE,EAAA+5G,KACA/5G,EACA,IAAAkzE,EAAA6mC,EAAA+wC,EAAA/+C,KAAA++C,EAAAl4E,EAAAk4E,EAAA9qJ,EAEA,IADA+5G,EAAA9xB,EAAA,IACA/U,GAAA,GAAA6mC,EAAA7mC,GAAA,EACA,IAAAA,EAAAvB,KAAAD,IAAA1xE,EAAA+rG,KAAA++C,EAAA,GAAA53E,EAAAN,EAAAk4E,IAAA53E,EACA6mC,EAAAhO,KAAA++C,EAAA53E,EAAAlzE,GAAA+rG,KAAAq3K,GAAApjR,EAAAkzE,EAAAN,EAAAM,GAAA6mC,EAAA,EAAA,EAAAhO,KAAA++C,EAAA53E,EAAAlzE,GACA+5G,EAAA+rK,QACA/rK,EAAAgsK,UAAA,EAAAhsK,IAkPA2uJ,EAAAh/J,UAAAw+K,OA9GA,SAAAloR,GACA,GAAAA,GAAA,EAAA,OAAA,EACA,IAAA2pI,EAAA59B,KAAAy3K,GAAAxjR,EAAA+5G,EAAAhO,KAAA9jB,EAAA,EAAAjoF,EAAA,EAAA,EACA,GAAA+rG,KAAA++C,EAAA,EACA,GAAA,GAAAnhB,EAAA5vB,EAAAhO,KAAA,GAAA/rG,OACA,IAAA,IAAAkzE,EAAA64B,KAAA++C,EAAA,EAAA53E,GAAA,IAAAA,EAAA6mC,GAAA4vB,EAAA5vB,EAAAhO,KAAA74B,IAAAlzE,EACA,OAAA+5G,GAyGA2uJ,EAAAh/J,UAAAy+K,YArCA,SAAAr9H,GACA,IAAAq9B,EAAAp8E,KAAA4wK,SAAAjU,EAAAkU,KACAx8Q,EAAA+nL,EAAAigG,kBACA,GAAAhoR,GAAA,EAAA,OAAA,EACA,IAAA25G,EAAAouE,EAAAkgG,WAAAjoR,IACA0qJ,EAAAA,EAAA,GAAA,GACA28H,EAAAz2M,SAAA85E,EAAA28H,EAAAz2M,QAEA,IADA,IAAA4B,EAAAowM,IACA9vM,EAAA,EAAAA,EAAA43E,IAAA53E,EAAA,CAEAN,EAAA8sM,QAAA+H,EAAA91M,KAAA6nC,MAAA7nC,KAAAwoC,SAAAstK,EAAAz2M,UACA,IAAA4oC,EAAAhnC,EAAA6pM,OAAA1iK,EAAAhO,MACA,GAAA,GAAA6N,EAAAqjK,UAAAvU,EAAAkU,MAAA,GAAAhjK,EAAAqjK,UAAA90F,GAAA,CAEA,IADA,IAAA9qF,EAAA,EACAA,IAAAj9F,GAAA,GAAAw5G,EAAAqjK,UAAA90F,IAEA,GAAA,IADAvuE,EAAAA,EAAA0tK,UAAA,EAAAv7K,OACAkxK,UAAAvU,EAAAkU,KAAA,OAAA,EAEA,GAAA,GAAAhjK,EAAAqjK,UAAA90F,GAAA,OAAA,GAGA,OAAA,GAmBAugF,EAAAh/J,UAAA03B,MAzlBA,WAAA,IAAArnB,EAAAipK,IAAA,OAAAj3K,KAAA65K,OAAA7rK,GAAAA,GA0lBA2uJ,EAAAh/J,UAAAo+K,SAvlBA,WACA,GAAA/7K,KAAA9jB,EAAA,EAAA,CACA,GAAA,GAAA8jB,KAAA++C,EAAA,OAAA/+C,KAAA,GAAAA,KAAAy3K,GACA,GAAA,GAAAz3K,KAAA++C,EAAA,OAAA,MAEA,CAAA,GAAA,GAAA/+C,KAAA++C,EAAA,OAAA/+C,KAAA,GACA,GAAA,GAAAA,KAAA++C,EAAA,OAAA,EAEA,OAAA/+C,KAAA,IAAA,GAAA,GAAAA,KAAAu3K,IAAA,IAAAv3K,KAAAu3K,GAAAv3K,KAAA,IAglBA28J,EAAAh/J,UAAA02K,UA5kBA,WAAA,OAAA,GAAAr0K,KAAA++C,EAAA/+C,KAAA9jB,EAAA8jB,KAAA,IAAA,IAAA,IA6kBA28J,EAAAh/J,UAAA4+K,WA1kBA,WAAA,OAAA,GAAAv8K,KAAA++C,EAAA/+C,KAAA9jB,EAAA8jB,KAAA,IAAA,IAAA,IA2kBA28J,EAAAh/J,UAAAk+K,OArkBA,WACA,OAAA77K,KAAA9jB,EAAA,GAAA,EACA8jB,KAAA++C,GAAA,GAAA,GAAA/+C,KAAA++C,GAAA/+C,KAAA,IAAA,EAAA,EACA,GAmkBA28J,EAAAh/J,UAAA6+K,YA3fA,WACA,IAAAr1M,EAAA64B,KAAA++C,EAAA/wC,EAAA,IAAAnQ,MACAmQ,EAAA,GAAAhO,KAAA9jB,EACA,IAAA0hD,EAAA12D,EAAA84B,KAAAu3K,GAAApwM,EAAA64B,KAAAu3K,GAAA,EAAAljR,EAAA,EACA,GAAA8yE,KAAA,EAGA,IAFAD,EAAA84B,KAAAu3K,KAAA35I,EAAA59B,KAAA74B,IAAAD,KAAA84B,KAAA9jB,EAAA8jB,KAAAw3K,KAAAtwM,IACA8mC,EAAA35G,KAAAupI,EAAA59B,KAAA9jB,GAAA8jB,KAAAu3K,GAAArwM,GACAC,GAAA,GACAD,EAAA,GACA02D,GAAA59B,KAAA74B,IAAA,GAAAD,GAAA,IAAA,EAAAA,EACA02D,GAAA59B,OAAA74B,KAAAD,GAAA84B,KAAAu3K,GAAA,KAGA35I,EAAA59B,KAAA74B,KAAAD,GAAA,GAAA,IACAA,GAAA,IAAAA,GAAA84B,KAAAu3K,KAAApwM,IAEA,IAAA,IAAAy2D,KAAAA,IAAA,KACA,GAAAvpI,IAAA,IAAA2rG,KAAA9jB,KAAA,IAAA0hD,MAAAvpI,GACAA,EAAA,GAAAupI,GAAA59B,KAAA9jB,KAAA8xB,EAAA35G,KAAAupI,GAGA,OAAA5vB,GAueA2uJ,EAAAh/J,UAAAq8H,OApeA,SAAAnzJ,GAAA,OAAA,GAAAm5B,KAAAkxK,UAAArqM,IAqeA81L,EAAAh/J,UAAA1D,IApeA,SAAApzB,GAAA,OAAAm5B,KAAAkxK,UAAArqM,GAAA,EAAAm5B,KAAAn5B,GAqeA81L,EAAAh/J,UAAAh4B,IApeA,SAAAkB,GAAA,OAAAm5B,KAAAkxK,UAAArqM,GAAA,EAAAm5B,KAAAn5B,GAqeA81L,EAAAh/J,UAAA8yB,IA/cA,SAAA5pD,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAk0K,UAAArtM,EAAA8xM,EAAA3qK,GAAAA,GAgdA2uJ,EAAAh/J,UAAA+yB,GA5cA,SAAA7pD,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAk0K,UAAArtM,EAAAktM,EAAA/lK,GAAAA,GA6cA2uJ,EAAAh/J,UAAAosK,IAzcA,SAAAljM,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAk0K,UAAArtM,EAAA+xM,EAAA5qK,GAAAA,GA0cA2uJ,EAAAh/J,UAAA8+K,OAtcA,SAAA51M,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAk0K,UAAArtM,EAAAgyM,EAAA7qK,GAAAA,GAucA2uJ,EAAAh/J,UAAAjkG,IApcA,WAEA,IADA,IAAAs0G,EAAAipK,IACA9vM,EAAA,EAAAA,EAAA64B,KAAA++C,IAAA53E,EAAA6mC,EAAA7mC,GAAA64B,KAAAw3K,IAAAx3K,KAAA74B,GAGA,OAFA6mC,EAAA+wC,EAAA/+C,KAAA++C,EACA/wC,EAAA9xB,GAAA8jB,KAAA9jB,EACA8xB,GAgcA2uJ,EAAAh/J,UAAAw2K,UA5bA,SAAAlgR,GACA,IAAA+5G,EAAAipK,IAEA,OADAhjR,EAAA,EAAA+rG,KAAAw6K,UAAAvmR,EAAA+5G,GAAAhO,KAAAo6K,SAAAnmR,EAAA+5G,GACAA,GA0bA2uJ,EAAAh/J,UAAA2+K,WAtbA,SAAAroR,GACA,IAAA+5G,EAAAipK,IAEA,OADAhjR,EAAA,EAAA+rG,KAAAo6K,UAAAnmR,EAAA+5G,GAAAhO,KAAAw6K,SAAAvmR,EAAA+5G,GACAA,GAobA2uJ,EAAAh/J,UAAA0+K,gBApaA,WACA,IAAA,IAAAl1M,EAAA,EAAAA,EAAA64B,KAAA++C,IAAA53E,EACA,GAAA,GAAA64B,KAAA74B,GAAA,OAAAA,EAAA64B,KAAAu3K,GAAAuB,EAAA94K,KAAA74B,IACA,OAAA64B,KAAA9jB,EAAA,EAAA8jB,KAAA++C,EAAA/+C,KAAAu3K,IACA,GAiaA5a,EAAAh/J,UAAA++K,SAtZA,WAEA,IADA,IAAA1uK,EAAA,EAAAJ,EAAA5N,KAAA9jB,EAAA8jB,KAAAw3K,GACArwM,EAAA,EAAAA,EAAA64B,KAAA++C,IAAA53E,EAAA6mC,GAAA+qK,EAAA/4K,KAAA74B,GAAAymC,GACA,OAAAI,GAoZA2uJ,EAAAh/J,UAAAs2K,QAhZA,SAAAhgR,GACA,IAAAq9F,EAAA1rB,KAAA6nC,MAAAx5G,EAAA+rG,KAAAu3K,IACA,OAAAjmL,GAAA0O,KAAA++C,EAAA,GAAA/+C,KAAA9jB,EACA,IAAA8jB,KAAA1O,GAAA,GAAAr9F,EAAA+rG,KAAAu3K,KA8YA5a,EAAAh/J,UAAAg/K,OAnYA,SAAA1oR,GAAA,OAAA+rG,KAAAi8K,UAAAhoR,EAAA8/Q,IAoYApX,EAAAh/J,UAAAi/K,SAjYA,SAAA3oR,GAAA,OAAA+rG,KAAAi8K,UAAAhoR,EAAA4kR,IAkYAlc,EAAAh/J,UAAAk/K,QA/XA,SAAA5oR,GAAA,OAAA+rG,KAAAi8K,UAAAhoR,EAAA2kR,IAgYAjc,EAAAh/J,UAAA3e,IA5VA,SAAAnY,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAk8K,MAAAr1M,EAAAmnC,GAAAA,GA6VA2uJ,EAAAh/J,UAAAizK,SA1VA,SAAA/pM,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAA45K,MAAA/yM,EAAAmnC,GAAAA,GA2VA2uJ,EAAAh/J,UAAAkpK,SAxVA,SAAAhgM,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAw5K,WAAA3yM,EAAAmnC,GAAAA,GAyVA2uJ,EAAAh/J,UAAAhzE,OAnVA,SAAAk8C,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAs5K,SAAAzyM,EAAAmnC,EAAA,MAAAA,GAoVA2uJ,EAAAh/J,UAAAm/K,UAjVA,SAAAj2M,GAAA,IAAAmnC,EAAAipK,IAAA,OAAAj3K,KAAAs5K,SAAAzyM,EAAA,KAAAmnC,GAAAA,GAkVA2uJ,EAAAh/J,UAAAo/K,mBA/UA,SAAAl2M,GACA,IAAAynC,EAAA2oK,IAAAjpK,EAAAipK,IAEA,OADAj3K,KAAAs5K,SAAAzyM,EAAAynC,EAAAN,GACA,IAAAnQ,MAAAyQ,EAAAN,IA6UA2uJ,EAAAh/J,UAAA+yK,OArOA,SAAA38Q,EAAAmrF,GACA,IAAA7qF,EAAAkxN,EAAAp+I,EAAApzE,EAAAk9Q,YAAAjjK,EAAAkqK,EAAA,GACA,GAAA/wM,GAAA,EAAA,OAAA6mC,EACA35G,EAAA8yE,EAAA,GAAA,EACAA,EAAA,GAAA,EACAA,EAAA,IAAA,EACAA,EAAA,IAAA,EACA,EAEAo+I,EADAp+I,EAAA,EACA,IAAAixM,EAAAl5L,GACAA,EAAAi8L,SACA,IAAAjC,EAAAh6L,GAEA,IAAAm5L,EAAAn5L,GAGA,IAAAklI,EAAA,IAAAvmH,MAAA5pG,EAAA,EAAA+oR,EAAA3oR,EAAA,EAAAinR,GAAA,GAAAjnR,GAAA,EAEA,GADA+vN,EAAA,GAAAmB,EAAAhf,QAAAvmG,MACA3rG,EAAA,EAAA,CACA,IAAA4oR,EAAAhG,IAEA,IADA1xD,EAAAk0D,MAAAr1D,EAAA,GAAA64D,GACAhpR,GAAAqnR,GACAl3D,EAAAnwN,GAAAgjR,IACA1xD,EAAAg0D,MAAA0D,EAAA74D,EAAAnwN,EAAA,GAAAmwN,EAAAnwN,IACAA,GAAA,EAIA,IAAAwwN,EAAA1lE,EAAAztD,EAAAv9F,EAAAgrJ,EAAA,EAAAm+H,GAAA,EAAA9gB,EAAA6a,IAEA,IADA9vM,EAAAgxM,EAAApkR,EAAAu9F,IAAA,EACAA,GAAA,GAAA,CAQA,IAPAnqB,GAAA61M,EAAAv4D,EAAA1wN,EAAAu9F,IAAAnqB,EAAA61M,EAAA1B,GAEA72D,GAAA1wN,EAAAu9F,IAAA,GAAAnqB,EAAA,GAAA,IAAA61M,EAAA71M,EACAmqB,EAAA,IAAAmzH,GAAA1wN,EAAAu9F,EAAA,IAAA0O,KAAAu3K,GAAApwM,EAAA61M,IAGA/oR,EAAAI,EACA,IAAA,EAAAowN,IAAAA,IAAA,IAAAxwN,EAEA,IADAkzE,GAAAlzE,GAAA,IAAAkzE,GAAA64B,KAAAu3K,KAAAjmL,GACA4rL,EACA94D,EAAAK,GAAAo1D,OAAA7rK,GACAkvK,GAAA,MAEA,CACA,KAAAjpR,EAAA,GAAAsxN,EAAAk0D,MAAAzrK,EAAAouJ,GAAA72C,EAAAk0D,MAAArd,EAAApuJ,GAAA/5G,GAAA,EACAA,EAAA,EAAAsxN,EAAAk0D,MAAAzrK,EAAAouJ,IAAAr9G,EAAA/wC,EAAAA,EAAAouJ,EAAAA,EAAAr9G,GACAwmE,EAAAg0D,MAAAnd,EAAAh4C,EAAAK,GAAAz2G,GAGA,KAAA1c,GAAA,GAAA,IAAAv9F,EAAAu9F,GAAA,GAAAnqB,IACAo+I,EAAAk0D,MAAAzrK,EAAAouJ,GAAAr9G,EAAA/wC,EAAAA,EAAAouJ,EAAAA,EAAAr9G,IACA53E,EAAA,IAAAA,EAAA64B,KAAAu3K,GAAA,IAAAjmL,GAGA,OAAAi0H,EAAA8zD,OAAArrK,IA+KA2uJ,EAAAh/J,UAAAqzK,WArIA,SAAA9xL,GACA,IAAAi+L,EAAAj+L,EAAAi8L,SACA,GAAAn7K,KAAAm7K,UAAAgC,GAAA,GAAAj+L,EAAA28L,SAAA,OAAAlf,EAAAgd,KAGA,IAFA,IAAAzlF,EAAAh1G,EAAAm2C,QAAAyvC,EAAA9kE,KAAAq1B,QACAxuD,EAAAqxM,EAAA,GAAA5+L,EAAA4+L,EAAA,GAAAzrM,EAAAyrM,EAAA,GAAAt6I,EAAAs6I,EAAA,GACA,GAAAhkF,EAAA2nF,UAAA,CACA,KAAA3nF,EAAAinF,UACAjnF,EAAAsmF,SAAA,EAAAtmF,GACAipF,GACAt2M,EAAAs0M,UAAA7hM,EAAA6hM,WAAAt0M,EAAAq1M,MAAAl8K,KAAAn5B,GAAAyS,EAAAsgM,MAAA16L,EAAA5F,IACAzS,EAAA2zM,SAAA,EAAA3zM,IAEAyS,EAAA6hM,UAAA7hM,EAAAsgM,MAAA16L,EAAA5F,GACAA,EAAAkhM,SAAA,EAAAlhM,GAEA,KAAAwrF,EAAAq2G,UACAr2G,EAAA01G,SAAA,EAAA11G,GACAq4G,GACA1wM,EAAA0uM,UAAAv9I,EAAAu9I,WAAA1uM,EAAAyvM,MAAAl8K,KAAAvzB,GAAAmxD,EAAAg8I,MAAA16L,EAAA0+C,IACAnxD,EAAA+tM,SAAA,EAAA/tM,IAEAmxD,EAAAu9I,UAAAv9I,EAAAg8I,MAAA16L,EAAA0+C,GACAA,EAAA48I,SAAA,EAAA58I,GAEAs2D,EAAAg9E,UAAApsG,IAAA,GACAovB,EAAA0lF,MAAA90G,EAAAovB,GACAipF,GAAAt2M,EAAA+yM,MAAAntM,EAAA5F,GACAyS,EAAAsgM,MAAAh8I,EAAAtkD,KAGAwrF,EAAA80G,MAAA1lF,EAAApvB,GACAq4G,GAAA1wM,EAAAmtM,MAAA/yM,EAAA4F,GACAmxD,EAAAg8I,MAAAtgM,EAAAskD,IAGA,OAAA,GAAAknC,EAAAosG,UAAAvU,EAAAkU,KAAAlU,EAAAgd,KACA/7I,EAAAszI,UAAAhyL,IAAA,EAAA0+C,EAAAgzI,SAAA1xL,GACA0+C,EAAAi+I,SAAA,GAAAj+I,EAAAs+I,MAAAh9L,EAAA0+C,GACAA,EAAAi+I,SAAA,EAAAj+I,EAAA5+C,IAAAE,GAAA0+C,GADAA,GAiGA++H,EAAAh/J,UAAA0hI,IA7SA,SAAAtrO,GAAA,OAAAisG,KAAAz4B,IAAAxzE,EAAA,IAAAilR,IA8SArc,EAAAh/J,UAAAwzK,IA7KA,SAAAtqM,GACA,IAAA+mC,EAAA5N,KAAA9jB,EAAA,EAAA8jB,KAAAo7K,SAAAp7K,KAAAq1B,QACAxnB,EAAAhnC,EAAAqV,EAAA,EAAArV,EAAAu0M,SAAAv0M,EAAAwuD,QACA,GAAAznB,EAAAsjK,UAAArjK,GAAA,EAAA,CAAA,IAAAkxC,EAAAnxC,EAAAA,EAAAC,EAAAA,EAAAkxC,EACA,IAAA53E,EAAAymC,EAAAyuK,kBAAAj4D,EAAAv2G,EAAAwuK,kBACA,GAAAj4D,EAAA,EAAA,OAAAx2G,EAMA,IALAzmC,EAAAi9I,IAAAA,EAAAj9I,GACAi9I,EAAA,IACAx2G,EAAA4sK,SAAAp2D,EAAAx2G,GACAC,EAAA2sK,SAAAp2D,EAAAv2G,IAEAD,EAAAiuK,SAAA,IACA10M,EAAAymC,EAAAyuK,mBAAA,GAAAzuK,EAAA4sK,SAAArzM,EAAAymC,IACAzmC,EAAA0mC,EAAAwuK,mBAAA,GAAAxuK,EAAA2sK,SAAArzM,EAAA0mC,GACAD,EAAAsjK,UAAArjK,IAAA,GACAD,EAAAgsK,MAAA/rK,EAAAD,GACAA,EAAA4sK,SAAA,EAAA5sK,KAGAC,EAAA+rK,MAAAhsK,EAAAC,GACAA,EAAA2sK,SAAA,EAAA3sK,IAIA,OADAu2G,EAAA,GAAAv2G,EAAAusK,SAAAh2D,EAAAv2G,GACAA,GAsJA8uJ,EAAAh/J,UAAA22K,gBA3FA,SAAAv1H,GACA,IAAA53E,EAAAymC,EAAA5N,KAAAm6J,MACA,GAAA,GAAAvsJ,EAAAmxC,GAAAnxC,EAAA,IAAA8tK,EAAAA,EAAAz2M,OAAA,GAAA,CACA,IAAAkC,EAAA,EAAAA,EAAAu0M,EAAAz2M,SAAAkC,EACA,GAAAymC,EAAA,IAAA8tK,EAAAv0M,GAAA,OAAA,EACA,OAAA,EAEA,GAAAymC,EAAAutK,SAAA,OAAA,EAEA,IADAh0M,EAAA,EACAA,EAAAu0M,EAAAz2M,QAAA,CAEA,IADA,IAAAia,EAAAw8L,EAAAv0M,GAAAmqB,EAAAnqB,EAAA,EACAmqB,EAAAoqL,EAAAz2M,QAAAia,EAAAy8L,GAAAz8L,GAAAw8L,EAAApqL,KAEA,IADApS,EAAA0uB,EAAAuuK,OAAAj9L,GACA/X,EAAAmqB,MAAApS,EAAAw8L,EAAAv0M,MAAA,EAAA,OAAA,EAEA,OAAAymC,EAAAwuK,YAAAr9H,IA+EA49G,EAAAh/J,UAAAvF,OAhWA,WAAA,IAAA4V,EAAAipK,IAAA,OAAAj3K,KAAA05K,SAAA1rK,GAAAA,GAmWA2uJ,EAAAh/J,UAAAu7K,QAAAA,EAoCA,MAAA2pN,EAAA,CAGA,IAAA9jV,EACA,GAHA8jV,EAAA,IAAAhlY,MACAilY,EAAA,EAEA,oBAAAvjY,QAAAA,OAAAyuH,OACA,GAAAzuH,OAAAyuH,OAAA69C,gBAAA,CAEA,IAAAo3N,EAAA,IAAAxqQ,WAAA,IAEA,IADAl5H,OAAAyuH,OAAA69C,gBAAAo3N,GACAlkV,EAAA,EAAAA,EAAA,KAAAA,EACA8jV,EAAAC,KAAAG,EAAAlkV,QAEA,GAAA,YAAA6mB,UAAA0xG,SAAA1xG,UAAAs9T,WAAA,IAAA,CAEA,IAAA39Q,EAAAhmH,OAAAyuH,OAAA5/G,OAAA,IACA,IAAA2wC,EAAA,EAAAA,EAAAwmE,EAAAtgJ,SAAA85E,EACA8jV,EAAAC,KAAA,IAAAv9Q,EAAAttI,WAAA8mE,GAGA,KAAA+jV,EAAAE,GACAjkV,EAAAn5E,KAAA6nC,MAAA,MAAA7nC,KAAAwoC,UACAy0X,EAAAC,KAAA/jV,IAAA,EACA8jV,EAAAC,KAAA,IAAA/jV,EAEA+jV,EAAA,EACAC,IAKA,SAAAI,IACA,GAAA,MAAAP,EAAA,CAIA,IAHAG,KACAH,EA2DA,IAAAQ,GA1DApuW,KAAA6tW,GACAC,EAAA,EAAAA,EAAAD,EAAA59Z,SAAA69Z,EACAD,EAAAC,GAAA,EACAA,EAAA,EAIA,OAAAF,EAAAxlZ,OAQA,SAAAimZ,KAMA,SAAAD,IACApjY,KAAA74B,EAAA,EACA64B,KAAA1O,EAAA,EACA0O,KAAAqkH,EAAA,IAAAxmH,MAPAwlY,EAAA1lY,UAAA61K,UAPA,SAAA8vN,GACA,IAAAn8Z,EACA,IAAAA,EAAA,EAAAA,EAAAm8Z,EAAAr+Z,SAAAkC,EAAAm8Z,EAAAn8Z,GAAAg8Z,KAyCAC,EAAAzlY,UAAAq3B,KAzBA,SAAAhgI,GACA,IAAAmyE,EAAAmqB,EAAAytD,EACA,IAAA53E,EAAA,EAAAA,EAAA,MAAAA,EACA64B,KAAAqkH,EAAAl9I,GAAAA,EAEA,IADAmqB,EAAA,EACAnqB,EAAA,EAAAA,EAAA,MAAAA,EACAmqB,EAAAA,EAAA0O,KAAAqkH,EAAAl9I,GAAAnyE,EAAAmyE,EAAAnyE,EAAAiwE,QAAA,IACA85E,EAAA/+C,KAAAqkH,EAAAl9I,GACA64B,KAAAqkH,EAAAl9I,GAAA64B,KAAAqkH,EAAA/yH,GACA0O,KAAAqkH,EAAA/yH,GAAAytD,EAEA/+C,KAAA74B,EAAA,EACA64B,KAAA1O,EAAA,GAcA8xY,EAAAzlY,UAAAvgB,KAXA,WACA,IAAA2hE,EAMA,OALA/+C,KAAA74B,EAAA64B,KAAA74B,EAAA,EAAA,IACA64B,KAAA1O,EAAA0O,KAAA1O,EAAA0O,KAAAqkH,EAAArkH,KAAA74B,GAAA,IACA43E,EAAA/+C,KAAAqkH,EAAArkH,KAAA74B,GACA64B,KAAAqkH,EAAArkH,KAAA74B,GAAA64B,KAAAqkH,EAAArkH,KAAA1O,GACA0O,KAAAqkH,EAAArkH,KAAA1O,GAAAytD,EACA/+C,KAAAqkH,EAAAtlE,EAAA/+C,KAAAqkH,EAAArkH,KAAA74B,GAAA,MAaA,IAAA67Z,EAAA,SAEA,IAAA1ve,EACAA,EAAAD,EAAAC,QAAA,CACAH,QAAAwpQ,EACAA,WAAAA,EACA0mO,aAAAA,GAGArjY,KAAA48J,KAAA,CACAD,WAAAA,EACA0mO,aAAAA,KAIAzlY,KAAAoC,gDC70CI,iBAEIwvG,EAAAA,CACA+zR,WAAY,OACZC,SAAU,OACVC,SAAU,OACVC,cAAe,OACf5+X,OAAQ,UACR6+X,YAAa,eACbh0Q,KAAM,MACNi0Q,SAAU,OACVz2Z,KAAM,YACNonC,OAAQ,WACRwmB,YAAa,2FACb/lI,IAAK,sBACL6ue,WAAY,wBACZC,aAAc,aACdx7O,KAAM,SAGV,SAAAi5O,EAAiBvse,UAEN+ue,EAAeC,EAAchve,GAAMqhF,WAG9C,SAAA4tZ,EAAkBC,EAAK9uQ,UACZmsQ,EAAQn+R,MAAM,KAAA,CAAO8gS,GAAKryY,OAAOujI,GAAAA,KAG5C,SAAA2uQ,EAAwBI,EAAY/uQ,OACiBhuJ,EAAkBD,EAAG9yE,EAAGsoS,EAAI3iM,EAAKoqY,EAAeC,EAAYC,EAAah8O,EAAtHhqK,EAAS,EAAGimZ,EAAcJ,EAAWl/Z,OAAa65J,EAAS,OAC1D33J,EAAI,EAAGA,EAAIo9Z,EAAap9Z,OACI,iBAAlBg9Z,EAAWh9Z,GAClB23J,GAAUqlQ,EAAWh9Z,WAES,iBAAlBg9Z,EAAWh9Z,GAAO,KAC9Bw1N,EAAKwnM,EAAWh9Z,IACThzE,SACHizE,EAAMguJ,EAAK92I,GACNjqF,EAAI,EAAGA,EAAIsoS,EAAGxoS,KAAK8wE,OAAQ5wE,IAAAA,IACjBqB,MAAP0xE,YACU0xB,MAAMyoY,EAAQ,gEAAiE5kM,EAAGxoS,KAAKE,GAAIsoS,EAAGxoS,KAAKE,EAAE,KAEnH+yE,EAAMA,EAAIu1N,EAAGxoS,KAAKE,SAItB+yE,EADKu1N,EAAG6nM,SACFpvQ,EAAKunE,EAAG6nM,UAGRpvQ,EAAK92I,QAGXkxH,EAAGi0R,SAASh+Z,KAAKk3N,EAAG71N,OAAS0oI,EAAGk0R,cAAcj+Z,KAAKk3N,EAAG71N,OAASM,aAAevxE,WAC9EuxE,EAAMA,KAGNooI,EAAGm0R,YAAYl+Z,KAAKk3N,EAAG71N,OAAyB,iBAARM,GAAoB83B,MAAM93B,aACxD29B,UAAUw8X,EAAQ,0CAA2Cn6Z,WAGvEooI,EAAG1qG,OAAOr/B,KAAKk3N,EAAG71N,QAClBw9Z,EAAcl9Z,GAAO,GAGjBu1N,EAAG71N,UACF,IACDM,EAAMhB,SAASgB,EAAK,IAAIg3B,SAAS,aAEhC,IACDh3B,EAAMf,OAAO67C,aAAa97C,SAASgB,EAAK,eAEvC,QACA,IACDA,EAAMhB,SAASgB,EAAK,cAEnB,IACDA,EAAMS,KAAKC,UAAUV,EAAK,KAAMu1N,EAAGzuI,MAAQ9nF,SAASu2N,EAAGzuI,OAAS,aAE/D,IACD9mF,EAAMu1N,EAAGm9E,UAAY76Q,WAAW73B,GAAKosS,cAAc72E,EAAGm9E,WAAa76Q,WAAW73B,GAAKosS,0BAElF,IACDpsS,EAAMu1N,EAAGm9E,UAAY76Q,WAAW73B,GAAKgzL,QAAQuiC,EAAGm9E,WAAa76Q,WAAW73B,aAEvE,IACDA,EAAMu1N,EAAGm9E,UAAYzzS,OAAOF,OAAOiB,EAAIqzS,YAAY99E,EAAGm9E,aAAe76Q,WAAW73B,aAE/E,IACDA,GAAOhB,SAASgB,EAAK,MAAQ,GAAGg3B,SAAS,aAExC,IACDh3B,EAAMf,OAAOe,GACbA,EAAOu1N,EAAGm9E,UAAY1yS,EAAI00B,UAAU,EAAG6gM,EAAGm9E,WAAa1yS,YAEtD,IACDA,EAAMf,SAASe,GACfA,EAAOu1N,EAAGm9E,UAAY1yS,EAAI00B,UAAU,EAAG6gM,EAAGm9E,WAAa1yS,YAEtD,IACDA,EAAM5zE,OAAOmqG,UAAUS,SAASR,KAAKx2B,GAAKhC,MAAM,GAAI,GAAGgE,cACvDhC,EAAOu1N,EAAGm9E,UAAY1yS,EAAI00B,UAAU,EAAG6gM,EAAGm9E,WAAa1yS,YAEtD,IACDA,EAAMhB,SAASgB,EAAK,MAAQ,YAE3B,IACDA,EAAMA,EAAI0nP,UACV1nP,EAAOu1N,EAAGm9E,UAAY1yS,EAAI00B,UAAU,EAAG6gM,EAAGm9E,WAAa1yS,YAEtD,IACDA,GAAOhB,SAASgB,EAAK,MAAQ,GAAGg3B,SAAS,cAExC,IACDh3B,GAAOhB,SAASgB,EAAK,MAAQ,GAAGg3B,SAAS,IAAI1I,cAGjD85G,EAAGmgB,KAAKlqJ,KAAKk3N,EAAG71N,MAChBg4J,GAAU13J,IAGNooI,EAAG1qG,OAAOr/B,KAAKk3N,EAAG71N,OAAWw9Z,IAAe3nM,EAAGr0C,KAK/CA,EAAO,IAJPA,EAAOg8O,EAAc,IAAM,IAC3Bl9Z,EAAMA,EAAIg3B,WAAWllB,QAAQs2H,EAAG84C,KAAM,KAK1C87O,EAAgBznM,EAAG8nM,SAA2B,MAAhB9nM,EAAG8nM,SAAmB,IAAM9nM,EAAG8nM,SAASlsY,OAAO,GAAK,IAClF8rY,EAAa1nM,EAAGzuI,OAASo6F,EAAOlhL,GAAKnC,OACrC+0B,EAAM2iM,EAAGzuI,OAASm2U,EAAa,EAAID,EAAc3+Y,OAAO4+Y,GAAoB,GAC5EvlQ,GAAU69D,EAAG82G,MAAQnrJ,EAAOlhL,EAAM4yB,EAAyB,MAAlBoqY,EAAwB97O,EAAOtuJ,EAAM5yB,EAAM4yB,EAAMsuJ,EAAOlhL,UAItG03J,MAGP4lQ,EAAgBlxe,OAAOU,OAAO,MAElC,SAAA8ve,EAAuBE,MACfQ,EAAcR,UACPQ,EAAcR,WAGT5mZ,EAAZqnZ,EAAOT,EAAYC,EAAAA,GAAiBS,EAAY,EAC7CD,GAAAA,IACkC,QAAhCrnZ,EAAQkyH,EAAGriI,KAAK7H,KAAKq/Z,IACtBR,EAAWr5Z,KAAKwS,EAAM,YAEkB,QAAlCA,EAAQkyH,EAAGj7F,OAAOjvC,KAAKq/Z,IAC7BR,EAAWr5Z,KAAK,aAE6B,QAAvCwS,EAAQkyH,EAAGz0E,YAAYz1D,KAAKq/Z,cA6CxB90Z,YAAY,uCA5ClByN,EAAM,GAAA,CACNsnZ,GAAa,MACTC,EAAAA,GAAiBC,EAAoBxnZ,EAAM,GAAIynZ,EAAAA,MACI,QAAlDA,EAAcv1R,EAAGx6M,IAAIswE,KAAKw/Z,cAejBj1Z,YAAY,oDAdtBg1Z,EAAW/5Z,KAAKi6Z,EAAY,IACwD,MAA5ED,EAAoBA,EAAkBhpY,UAAUipY,EAAY,GAAG9/Z,aACL,QAAzD8/Z,EAAcv1R,EAAGq0R,WAAWv+Z,KAAKw/Z,IAClCD,EAAW/5Z,KAAKi6Z,EAAY,YAEqC,QAA3DA,EAAcv1R,EAAGs0R,aAAax+Z,KAAKw/Z,cAI/Bj1Z,YAAY,gDAHtBg1Z,EAAW/5Z,KAAKi6Z,EAAY,IAUxCznZ,EAAM,GAAKunZ,OAGXD,GAAa,KAEC,IAAdA,YACU9rY,MAAM,6EAGpBqrY,EAAWr5Z,KAAAA,CAEHiwD,YAAaz9C,EAAM,GACnBknZ,SAAalnZ,EAAM,GACnBnpF,KAAampF,EAAM,GACnBgrK,KAAahrK,EAAM,GACnBmnZ,SAAannZ,EAAM,GACnBm2T,MAAan2T,EAAM,GACnB4wE,MAAa5wE,EAAM,GACnBw8R,UAAax8R,EAAM,GACnBxW,KAAawW,EAAM,KAO/BqnZ,EAAOA,EAAK7oY,UAAUxe,EAAM,GAAGrY,eAE5By/Z,EAAcR,GAAOC,OAOT,IAAZ7we,IACPA,EAAQ,QAAaiue,EACrBjue,EAAQ,SAAc2we,GAEJ,oBAAX1kY,SACPA,OAAO,QAAagiY,EACpBhiY,OAAO,SAAc0kY,oCC1N7B,aAGA,IAAAtlD,EAAA3+U,MAAAA,KAAA2+U,kBAAAnrb,OAAAU,OAAA,SAAAg8K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACAb,OAAAC,eAAAy8K,EAAA2hH,EAAA,CAAA9yL,YAAA,EAAAvd,IAAA,WAAA,OAAAtC,EAAA7qF,OACA,SAAA67K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACA67K,EAAA2hH,GAAA3yM,EAAA7qF,KAEAuqb,EAAA5+U,MAAAA,KAAA4+U,qBAAAprb,OAAAU,OAAA,SAAAg8K,EAAApL,GACAtxK,OAAAC,eAAAy8K,EAAA,UAAA,CAAAnxE,YAAA,EAAArrG,MAAAoxK,KACA,SAAAoL,EAAApL,GACAoL,EAAA,QAAApL,IAEA+5Q,EAAA7+U,MAAAA,KAAA6+U,cAAA,SAAAv8R,GACA,GAAAA,GAAAA,EAAAtuJ,WAAA,OAAAsuJ,EACA,IAAA13E,EAAA,GACA,GAAA,MAAA03E,EAAA,IAAA,IAAAjuJ,KAAAiuJ,EAAA,YAAAjuJ,GAAAb,OAAAmqG,UAAAnD,eAAAoD,KAAA0kD,EAAAjuJ,IAAAsqb,EAAA/zW,EAAA03E,EAAAjuJ,GAEA,OADAuqb,EAAAh0W,EAAA03E,GACA13E,GAEAo6Z,EAAAhlY,MAAAA,KAAAglY,gBAAA,WACA,IAAA,IAAA9oZ,EAAA,EAAA/U,EAAA,EAAA89Z,EAAA5uZ,UAAApR,OAAAkC,EAAA89Z,EAAA99Z,IAAA+U,GAAA7F,UAAAlP,GAAAlC,OACA,IAAA+oC,EAAAnQ,MAAA3hB,GAAA7nF,EAAA,EAAA,IAAA8yE,EAAA,EAAAA,EAAA89Z,EAAA99Z,IACA,IAAA,IAAAN,EAAAwP,UAAAlP,GAAAmqB,EAAA,EAAA4zY,EAAAr+Z,EAAA5B,OAAAqsB,EAAA4zY,EAAA5zY,IAAAj9F,IACA25G,EAAA35G,GAAAwyE,EAAAyqB,GACA,OAAA0c,GAEAx6G,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAwse,cAAA,EACA,IAAAlzL,EAAAiyI,EAAAtrb,EAAA,aACA4xe,EAAAtmD,EAAAtrb,EAAA,mBACA6xe,EAAAvmD,EAAAtrb,EAAA,mBACA6hF,EAAAypW,EAAAtrb,EAAA,iBACA8se,EAAA9se,EAAA,UACA8xe,EAAA9xe,EAAA,4BACAgte,EAAAhte,EAAA,mBACAite,EAAAjte,EAAA,QACAkte,EAAAlte,EAAA,cACA,SAAAslG,EAAAtf,GACA,IAAAA,EACA,MAAA,IAAAuf,MAAA,qBAUA,SAAAwsY,EAAArxe,GAGA,OADAA,GADAA,EAAAA,EAAAilF,QAAA,oBAAA,0CACAA,QAAA,eAAA,yCAoBA,SAAAqsZ,EAAAtqH,GACA,OAAAwlH,EAAAc,QAAA,OAAAn7Z,SAAA60S,EAAA,KAEA,SAAAuqH,EAAAlsZ,GAEA,OAAA,IAAAA,EAUA,IAAAwmZ,EAAA,WACA,SAAAA,EAAA5hL,EAAAunL,GACAzlY,KAAAohY,mBAAA,GACAphY,KAAA6gY,aAAA,GACA7gY,KAAA8gY,OAAA,OACA9gY,KAAA+gY,WAAA,IACA/gY,KAAAmgN,IAAA,EACAngN,KAAA0lY,KAAA,GAQA1lY,KAAAihY,WAAAr0L,EAAAq0L,WAOAjhY,KAAAghY,UAAAp0L,EAAAo0L,UAAAoE,EAAAx/K,MAEA5lN,KAAA0gY,YADAhre,IAAA+ve,EACAL,EAAAzE,OAGA8E,EAEAzlY,KAAAk+M,QAAAA,EACA,IAAA4iL,EAAAsE,EAAAlE,iBAAA57Z,KAAA44O,GACA,GAAA4iL,EAAA,CAIA,GAHA9gY,KAAA6gY,aAAAC,EAAA,GAAA5nZ,QAAA,IAAA,IACA8mB,KAAA+gY,WAAA36Z,SAAA45B,KAAA6gY,aAAA,IACA7gY,KAAA8gY,OAAA,IAAA9gY,KAAA+gY,WACA56Z,OAAA+4B,MAAAc,KAAA+gY,aACA/gY,KAAA+gY,WAAA,GACA/gY,KAAA+gY,WAAAqE,EAAAx/K,KACA,MAAA,IAAA26K,EAAAY,aAAA,wBAEAjjL,EAAAA,EAAAhlO,QAAAksZ,EAAAlE,iBAAA,SAEA,GAAA,KAAAz7Z,KAAAy4O,GACA,MAAA,IAAAqiL,EAAAY,aAAA,wBAEA,IAAAuE,EAAAN,EAAAO,eAAArga,KAAA44O,GACAwnL,IACA1lY,KAAA0lY,KAAAA,EAAA,GACAxnL,EAAAA,EAAAhlO,QAAAksZ,EAAAO,eAAA,KAEA3lY,KAAAohY,mBAAAljL,EACAl+M,KAAA4gY,cAAA5gY,KAAA/wB,MAAA+wB,KAAAohY,oBA+1BA,OA71BAtB,EAAAvtG,QAAA,SAAAr0E,GACA,IAGA,OADA,IAAA4hL,EAAA5hL,IACA,EAEA,MAAAnqT,GACA,OAAA,IAcA+re,EAAA8B,eAAA,SAAAH,GACA,IAEAt6Z,EAFAnB,EAAAy7Z,EAAArjY,SAAA,IAAAiqR,SAAA,GAAA,KACAq4G,EAAA,GAEA,IAAAv5Z,EAAA,EAAAA,EAAAi+Z,EAAAzE,OAAAx5Z,IACAu5Z,EAAA51Z,KAAA9E,EAAAZ,MAAA,EAAA+B,EAAA,GAAAA,EAAA,KAEA,OAAA,IAAA24Z,EAAAY,EAAAp2Z,KAAA,OAYAw1Z,EAAA8F,QAAA,SAAAhgY,GACA,IAAAJ,EAEA56B,EADA66B,EAAA,KAGA,IAAA,IAAAG,EAAAp6B,QAAA,OAAA,IAAAo6B,EAAAp6B,QAAA,MAAA,CAEA,GAAA,QADAZ,EAAAw6Z,EAAAS,iBAAAvga,KAAAsgC,IAEA,MAAA,CACAr2B,MAAA,oCACA2uO,QAAA,KACAz4M,KAAA,MAGAD,EAAA56B,EAAA,GACA66B,EAAA76B,EAAA,QAGA,IAAA,IAAAg7B,EAAAp6B,QAAA,KAAA,CAKA,GAHAo6B,EAAAA,EAAA1sB,QAAA,kBAAA,IAGA,QADAtO,EAAAw6Z,EAAAU,OAAAxga,KAAAsgC,IAEA,MAAA,CACAr2B,MAAA,mCACA2uO,QAAA,KACAz4M,KAAA,MAGAD,EAAA56B,EAAA,QAIA46B,EAAAI,EAcA,OAXAH,IACAA,EAAAr/B,SAAAq/B,EAAA,KAEA,GAAAA,EAAA,SACAA,EAAA,MAKAA,EAAA,KAEA,CACAy4M,QAAA,IAAA4hL,EAAAt6X,GACAC,KAAAA,IAcAq6X,EAAAiG,aAAA,SAAA7nL,GACA,IAAA8nL,EAAA,IAAA3F,EAAAR,SAAA3hL,GACA+nL,EAAAb,EAAAx/K,MAAAu/K,EAAAv/K,KAAAogL,EAAAjF,YACA,OAAA,IAAAjB,EAAA,UAAAkG,EAAA5F,cAAA,IAAA6F,IAYAnG,EAAAoG,SAAA,SAAAC,GAEA,IAAAjoL,EAAAioL,EAAAjtZ,QAAA,oBAAA,IAGA,GAAA,KAAAglO,EAAAj5O,OACA,MAAA,IAAAs7Z,EAAAY,aAAA,4BAGA,IADA,IAAAl7X,EAAAi4M,EAAAp+N,MAAA,KAAAogI,UACA/4I,EANA,EAMAA,EAAA,EAAAA,IAAA,CACA,IAAAi/Z,EAAA,EAAAj/Z,EACA8+B,EAAAx7B,OAAA27Z,EAAA,EAAA,KAGA,OAAA,IAAAtG,EADA5hL,EAAAj4M,EAAA37B,KAAA,MASAw1Z,EAAAniY,UAAA0oY,uBAAA,WACA,OAAA5F,EAAAc,QAAA,sBAAAvhY,KAAAogY,cAAAlnZ,QAAA,KAAA,OASA4mZ,EAAAniY,UAAAqhI,KAAA,SAAAA,GAEA,YADA,IAAAA,IAAAA,EAAAh/H,KAAA+gY,YACA/gY,KAAAkiY,aAAA,EAAAljQ,IAUA8gQ,EAAAniY,UAAA2oY,gBAAA,SAAAC,QACA,IAAAA,IAAAA,EAAA,KACA,IAEAC,EAFApB,EAAAx/K,KAAA5lN,KAAA+gY,WACAn7Z,KAAAu0L,IAAAosO,EAAAnB,EAAAx/K,MAEA,OAAA4gL,EAAA,EACA,IA1QA,SAAA1hY,GAEA,IADA,IAAAkJ,EAAA,eACAA,EAAAvoC,KAAAq/B,IACAA,EAAAA,EAAA5rB,QAAA80B,EAAA,SAEA,OAAAlJ,EAuQA2hY,CAAA,IAAAjG,EAAA7jO,WAAA,IAAA,IAAAt9B,IAAAmnQ,GAAApoY,SAAA,MAQA0hY,EAAAniY,UAAA+jY,cAAA,WACA,OAAA,IAAAlB,EAAA7jO,WAAA38J,KAAAg/H,OAAA,IAAAv5I,OAAA2/Y,EAAAx/K,KAAA5lN,KAAA+gY,YAAA,IASAjB,EAAAniY,UAAAgkY,aAAA,WACA,OAAA7B,EAAA8B,eAAA5hY,KAAA0hY,kBASA5B,EAAAniY,UAAAkkY,sBAAA,WACA,IAAAC,EAAA,IAAAtB,EAAA7jO,WAAA,KACA,OAAAmjO,EAAA8B,eAAA5hY,KAAA0hY,gBAAA1iZ,IAAA8iZ,KAQAhC,EAAAniY,UAAAokY,YAAA,WACA,OAAA,IAAAvB,EAAA7jO,WAAA38J,KAAAg/H,OAAA,IAAAv5I,OAAA2/Y,EAAAx/K,KAAA5lN,KAAA+gY,YAAA,IASAjB,EAAAniY,UAAAqkY,WAAA,WACA,OAAAlC,EAAA8B,eAAA5hY,KAAA+hY,gBASAjC,EAAAniY,UAAAskY,oBAAA,WACA,IAAAH,EAAA,IAAAtB,EAAA7jO,WAAA,KACA,OAAAmjO,EAAA8B,eAAA5hY,KAAA+hY,cAAAnxN,SAAAkxN,KAQAhC,EAAAniY,UAAA+oY,SAAA,WACA,IAAA7hX,EAAAugX,EAAAuB,OAAA3mY,KAAA4mY,QAAA,GAAA,IAAA7qN,YAIA,MAHA,mBAAA/7K,KAAAgsF,WAAA,eAAAnnE,IACAA,EAAA,UAEAA,GAAA,WAQAi7W,EAAAniY,UAAAquF,QAAA,WACA,IAAA,IAAA66S,EAAA,EAAAxkK,EAAA7uU,OAAAW,KAAAixe,EAAA0B,OAAAD,EAAAxkK,EAAAp9P,OAAA4ha,IAAA,CACA,IAAA/F,EAAAz+J,EAAAwkK,GACA,GAAA7mY,KAAAihY,WAAA,IAAAnB,EAAAgB,IACA,OAAAsE,EAAA0B,MAAAhG,GAGA,MAAA,kBAQAhB,EAAAniY,UAAAipY,QAAA,SAAA5xZ,EAAAhQ,GACA,OAAA,IAAAw7Z,EAAA7jO,WAAA38J,KAAAkiY,aAAAltZ,EAAAhQ,GAAA,IAQA86Z,EAAAniY,UAAAukY,aAAA,SAAAltZ,EAAAhQ,GACA,OAAAg7B,KAAAmiY,gBAAA/8Z,MAAA4P,EAAAhQ,IAQA86Z,EAAAniY,UAAAopY,cAAA,SAAA/xZ,EAAAhQ,GACA,IAAAC,EAAAD,EAAAgQ,EACA,GAAA/P,EAAA,GAAA,EACA,MAAA,IAAA6zB,MAAA,wDAEA,OAAAkH,KAAA4mY,QAAA5xZ,EAAAhQ,GACAo5B,SAAA,IACAiqR,SAAApjT,EAAA,EAAA,MAQA66Z,EAAAniY,UAAAqpY,kBAAA,WACA,OAAAhnY,KAAAkiY,aAAAliY,KAAA+gY,WAAAqE,EAAAx/K,OAUAk6K,EAAAniY,UAAAspY,YAAA,SAAAtye,GACAA,IACAA,EAAA,IAEA,IAAAuye,EAAAtha,KAAA6nC,MAAAzN,KAAA+gY,WAAA,GACAoG,EAAAnnY,KAAAonY,gBACAluZ,QAAA,KAAA,IACA4G,MAAA,IACA1a,MAAA,EAAA8ha,GACAhnR,UACA51I,KAAA,KACA,OAAA48Z,EAAA,EACAvye,EAAA0ye,WACAF,EAEA1G,EAAAc,QAAA,eAAA4F,GAEAxye,EAAA0ye,WACA,GAEA,aAQAvH,EAAAniY,UAAAyiY,YAAA,WACA,IAAAj5Z,EACAu5Z,EAAA,GACA4G,EAAA,EACA3pQ,EAAA,GACA,IAAAx2J,EAAA,EAAAA,EAAA64B,KAAA4gY,cAAA37Z,OAAAkC,IAAA,CACA,IAAAzzE,EAAA0yE,SAAA45B,KAAA4gY,cAAAz5Z,GAAA,IACA,IAAAzzE,GACA4ze,IAEA,IAAA5ze,GAAA4ze,EAAA,IACAA,EAAA,GACA3pQ,EAAA7yJ,KAAA,CAAA3D,EAAAmga,EAAAnga,EAAA,IAEAmga,EAAA,GAIAA,EAAA,GACA3pQ,EAAA7yJ,KAAA,CAAAk1B,KAAA4gY,cAAA37Z,OAAAqia,EAAAtnY,KAAA4gY,cAAA37Z,OAAA,IAEA,IAAAsia,EAAA5pQ,EAAAvzJ,KAAA,SAAAn2E,GAAA,OAAAA,EAAA,GAAAA,EAAA,GAAA,KACA,GAAA0pO,EAAA14J,OAAA,EAAA,CACA,IAAAM,EAAAgia,EAAA/7Z,QAAA5F,KAAAD,IAAAy9H,MAAAx9H,KAAA2ha,IACA7G,EA7bA,SAAAxiL,EAAA94O,GACA,IAEA+B,EAFA0uH,EAAA,GACAC,EAAA,GAEA,IAAA3uH,EAAA,EAAAA,EAAA+2O,EAAAj5O,OAAAkC,IACAA,EAAA/B,EAAA,GACAywH,EAAA/qH,KAAAozO,EAAA/2O,IAEAA,EAAA/B,EAAA,IACA0wH,EAAAhrH,KAAAozO,EAAA/2O,IAGA,OAAA0uH,EAAAhkG,OAAA,CAAA,YAAAA,OAAAikG,GAibAo/D,CAAAl1J,KAAA4gY,cAAAjjQ,EAAAp4J,SAGAm7Z,EAAA1gY,KAAA4gY,cAEA,IAAAz5Z,EAAA,EAAAA,EAAAu5Z,EAAAz7Z,OAAAkC,IACA,YAAAu5Z,EAAAv5Z,KACAu5Z,EAAAv5Z,GAAAf,SAAAs6Z,EAAAv5Z,GAAA,IAAAi3B,SAAA,KAGA,IAAAopY,EAAA9G,EAAAp2Z,KAAA,KAIA,OADAk9Z,GADAA,GADAA,EAAAA,EAAAtuZ,QAAA,YAAA,OACAA,QAAA,oBAAA,MACAA,QAAA,UAAA,KAcA4mZ,EAAAniY,UAAAwkY,cAAA,WACA,OAAAniY,KAAAyhY,aAAArjY,SAAA,GAAAiqR,SAAA+8G,EAAAx/K,KAAA,MAGAk6K,EAAAniY,UAAA8pY,UAAA,SAAAvpL,GACA,IAAAwiL,EAAAxiL,EAAAp+N,MAAA,KAEAkmZ,EADAtF,EAAAt7Z,OAAA,GAAA,GACAkY,MAAA6nZ,EAAA9D,YACA,GAAA2E,EAAA,CACAhmY,KAAA0nY,eAAA1B,EAAA,GACAhmY,KAAAgmY,SAAA,IAAA3F,EAAAR,SAAA7/X,KAAA0nY,gBACA,IAAA,IAAAvga,EAAA,EAAAA,EAAA64B,KAAAgmY,SAAAtF,OAAAv5Z,IACA,GAAA,WAAA1B,KAAAu6B,KAAAgmY,SAAApF,cAAAz5Z,IACA,MAAA,IAAAo5Z,EAAAY,aAAA,4CAAAjjL,EAAAhlO,QAAAisZ,EAAA9D,WAAArhY,KAAAgmY,SAAApF,cAAAx2Z,IAAAk7Z,GAAAh7Z,KAAA,OAGA01B,KAAAmgN,IAAA,EACAugL,EAAAA,EAAAz7Z,OAAA,GAAA+6B,KAAAgmY,SAAAxE,WACAtjL,EAAAwiL,EAAAp2Z,KAAA,KAEA,OAAA4zO,GAGA4hL,EAAAniY,UAAA1uB,MAAA,SAAAivO,GAEA,IAAAypL,GADAzpL,EAAAl+M,KAAAynY,UAAAvpL,IACA5gO,MAAA8nZ,EAAAwC,mBACA,GAAAD,EACA,MAAA,IAAApH,EAAAY,aAAAV,EAAAc,QAAA,0CAAAoG,EAAA1ia,OAAA,EAAA,IAAA,GAAA0ia,EAAAr9Z,KAAA,KAAA4zO,EAAAhlO,QAAAksZ,EAAAwC,kBAAA,wCAEA,IAAAC,EAAA3pL,EAAA5gO,MAAA8nZ,EAAA0C,gBACA,GAAAD,EACA,MAAA,IAAAtH,EAAAY,aAAAV,EAAAc,QAAA,2BAAAsG,EAAAv9Z,KAAA,KAAA4zO,EAAAhlO,QAAAksZ,EAAA0C,eAAA,wCAEA,IAAApH,EAAA,GACAqH,EAAA7pL,EAAAp+N,MAAA,MACA,GAAA,IAAAioZ,EAAA9ia,OAAA,CACA,IAAA4T,EAAAkvZ,EAAA,GAAAjoZ,MAAA,KACA/D,EAAAgsZ,EAAA,GAAAjoZ,MAAA,KACA,IAAAjH,EAAA5T,QAAA,KAAA4T,EAAA,KACAA,EAAA,IAEA,IAAAkD,EAAA9W,QAAA,KAAA8W,EAAA,KACAA,EAAA,IAEA,IAAAvW,EAAAw6B,KAAA0gY,QAAA7nZ,EAAA5T,OAAA8W,EAAA9W,QACA,IAAAO,EACA,MAAA,IAAA+6Z,EAAAY,aAAA,wBAEAnhY,KAAAgoY,aAAAxia,EACAw6B,KAAAioY,aAAApvZ,EAAA5T,OACA+6B,KAAAkoY,WAAArvZ,EAAA5T,OAAA+6B,KAAAgoY,aACAtH,EAAAA,EAAA7uY,OAAAhZ,GACA,IAAA,IAAA1R,EAAA,EAAAA,EAAA3B,EAAA2B,IACAu5Z,EAAA51Z,KAAA,KAEA41Z,EAAAA,EAAA7uY,OAAA9V,OAEA,CAAA,GAAA,IAAAgsZ,EAAA9ia,OAKA,MAAA,IAAAs7Z,EAAAY,aAAA,4BAJAT,EAAAxiL,EAAAp+N,MAAA,KACAkgB,KAAAgoY,aAAA,EAMA,IADAtH,EAAAA,EAAAt2Z,KAAA,SAAAq5I,GAAA,OAAAg9Q,EAAAc,QAAA,KAAAn7Z,SAAAq9I,EAAA,SACAx+I,SAAA+6B,KAAA0gY,OACA,MAAA,IAAAH,EAAAY,aAAA,oCAEA,OAAAT,GAQAZ,EAAAniY,UAAAypY,cAAA,WACA,OAAApnY,KAAA4gY,cAAAx2Z,IAAAm7Z,GAAAj7Z,KAAA,MAQAw1Z,EAAAniY,UAAAiU,QAAA,WACA,OAAA5R,KAAA4gY,cAAAx2Z,KAAA,SAAAn2E,GAAA,OAAAwse,EAAAc,QAAA,OAAAn7Z,SAAAnyE,EAAA,QAAAq2E,KAAA,MAQAw1Z,EAAAniY,UAAA8jY,WAAA,WACA,OAAA,IAAAjB,EAAA7jO,WAAA38J,KAAA4gY,cAAAx2Z,IAAAm7Z,GAAAj7Z,KAAA,IAAA,KAWAw1Z,EAAAniY,UAAAwiY,IAAA,WACA,IAAA1qO,EAAAz1J,KAAAmiY,gBAAAriZ,MAAA,IACA,OAAAugZ,EAAAR,SAAAv3G,QAAA,IAAAk4G,EAAA7jO,WAAAlH,EAAArwL,MAAA,GAAA,KAAAkF,KAAA,IAAA,GAAA8zB,SAAA,MAQA0hY,EAAAniY,UAAAwqY,OAAA,WACA,IAAAnC,EAAAhmY,KAAAmgY,MAEAqH,EADA,IAAA1H,EAAA9/X,KAAA4gY,cAAAx7Z,MAAA,EAAA,GAAAkF,KAAA,KAAA,GACA81Z,cACAgI,EAAA,GAIA,MAHA,KAAA3ia,KAAA+ha,KACAY,EAAA,KAEAZ,EAAAY,EAAApC,EAAA9nL,SAQA4hL,EAAAniY,UAAA0qY,cAAA,WAsBA,IAAA19Y,EAAAqV,KAAA+mY,cAAA,EAAA,IACAuB,EAAAtoY,KAAA4mY,QAAA,GAAA,IAAA78N,IAAA,IAAAy2N,EAAA7jO,WAAA,OAAA,KAAAv+J,WACAmqY,EAAAlI,EAAAR,SAAAv3G,QAAAtoR,KAAA+mY,cAAA,GAAA,KACAyB,EAAAnI,EAAAR,SAAAv3G,QAAAtoR,KAAA4mY,QAAA,GAAA,KAAA78N,IAAA,IAAAy2N,EAAA7jO,WAAA,WAAA,KAAAv+J,SAAA,KACAilB,EAAArjB,KAAA4mY,QAAA,GAAA,IACA6B,EAAAzoY,KAAAkiY,aAAA,GAAA,IACAwG,EAAArlX,EAAA4wJ,QAAA,IACAixM,EAAA7hW,EAAA4wJ,QAAA,IACA00N,EAAAtlX,EAAA4wJ,QAAA,GACA20N,EAAAvlX,EAAA4wJ,QAAA,GACAsL,EAAA,IAAAihN,EAAA7jO,WAAA8rO,EAAArja,MAAA,EAAA,GAAAqja,EAAArja,MAAA,EAAA,IAAA,GAAAg5B,SAAA,IACA,MAAA,CACAzT,OAAA81Y,EAAAc,QAAA,QAAA52Y,EAAAvlB,MAAA,EAAA,GAAAulB,EAAAvlB,MAAA,EAAA,IACAmja,QAAAA,EAAArqL,QACAsqL,QAAAA,EAAAtqL,QACA76L,MAAAolX,EACAC,QAAAA,EACAG,UAAA,CACA3jB,SAAAA,EACA0jB,eAAAA,EACAD,gBAAAA,EACAppN,MAAAA,GAEA+oN,QAAAA,IASAxI,EAAAniY,UAAAmrY,YAAA,WAKA,IAAAn+Y,EAAAqV,KAAA+mY,cAAA,EAAA,IACAx/B,EAAA84B,EAAAR,SAAAv3G,QAAAtoR,KAAA+mY,cAAA,GAAA,KACA,MAAA,CACAp8Y,OAAA81Y,EAAAc,QAAA,KAAA52Y,EAAAvlB,MAAA,EAAA,IACAmiY,QAAAA,EAAArpJ,UASA4hL,EAAAniY,UAAAorY,OAAA,WACA,OAAA/oY,KAAAkgY,MAUA,IAAAJ,EAPA,CACA,OACA9/X,KAAA+mY,cAAA,GAAA,KACA/mY,KAAA+mY,cAAA,IAAA,KACA,GACA,OACAz8Z,KAAA,MARA,MAiBAw1Z,EAAAniY,UAAA6+K,YAAA,WACA,IAAA8zC,EAAAtwN,KAAAyhY,aAAAjlN,cAEA,OAAA,KAAA8zC,EAAArrP,QAAA,IAAAqrP,EAAA,GACAA,EAAAlrP,MAAA,GAEAkrP,GAQAwvK,EAAAniY,UAAAqrY,oBAAA,WACA,OAAAhpY,KAAAw8K,cAAApyM,IAAAo7Z,IAQA1F,EAAAlvK,cAAA,SAAAj4F,GACA,OAAA34H,KAAAipY,sBAAAtwQ,EAAAvuJ,IAAAo7Z,KAQA1F,EAAAmJ,sBAAA,SAAAtwQ,GAIA,IAHA,IAAAuwQ,EAAA,IAAA1I,EAAA7jO,WAAA,MAAA,IACA/xL,EAAA,IAAA41Z,EAAA7jO,WAAA,IAAA,IACAyK,EAAA,IAAAo5N,EAAA7jO,WAAA,IAAA,IACAx1L,EAAAwxJ,EAAA1zJ,OAAA,EAAAkC,GAAA,EAAAA,IACAyD,EAAAA,EAAAoU,IAAAooL,EAAAP,SAAA,IAAA25N,EAAA7jO,WAAAhkC,EAAAxxJ,GAAAi3B,SAAA,IAAA,MACAgpK,EAAAA,EAAAP,SAAAqiO,GAEA,OAAApJ,EAAA8B,eAAAh3Z,IAQAk1Z,EAAAniY,UAAAwrY,YAAA,WACA,OAAAnpY,KAAAohY,qBAAAphY,KAAAonY,iBAQAtH,EAAAniY,UAAAyrY,YAAA,WAEA,MACA,qEADAppY,KAAAkiY,aAAA,EAAA,KAYApC,EAAAniY,UAAAykY,YAAA,WACA,MAAA,cAAApiY,KAAAgsF,WAQA8zS,EAAAniY,UAAAuiY,IAAA,WACA,OAAAlgY,KAAAmgN,IAQA2/K,EAAAniY,UAAA0rY,SAAA,WACA,OAAArpY,KAAAihY,WAAA,IAAAnB,EAAA,eAQAA,EAAAniY,UAAA2rY,OAAA,WACA,OAAAtpY,KAAAihY,WAAA,IAAAnB,EAAA,eAQAA,EAAAniY,UAAAw7X,WAAA,WACA,MAAA,aAAAn5X,KAAAgsF,WAOA8zS,EAAAniY,UAAA24G,KAAA,SAAAizR,GAOA,OALAA,OADA7ze,IAAA6ze,EACA,GAGA9I,EAAAc,QAAA,MAAAgI,GAEA9I,EAAAc,QAAA,iBAAAvhY,KAAAogY,cAAAmJ,IAKAzJ,EAAAniY,UAAA/jB,KAAA,SAAAjlF,GACAA,IACAA,EAAA,SAEAe,IAAAf,EAAAkmG,YACAlmG,EAAAkmG,UAAA,SAEAnlG,IAAAf,EAAAg2F,SACAh2F,EAAAg2F,OAAA,mBAEAj1F,IAAAf,EAAAwrT,KACAxrT,EAAAwrT,IAAA,GAEA,IAAAqpL,EAAAxpY,KAAAogY,YAIA,OAHAzre,EAAAwrT,KACAqpL,EAAAxpY,KAAAmoY,QAEAxze,EAAAkmG,UACA4lY,EAAAc,QAAA,2CAAA5se,EAAAg2F,OAAA6+Y,EAAA5rY,KAAAoC,MAAArrG,EAAAkmG,WAEA4lY,EAAAc,QAAA,8BAAA5se,EAAAg2F,OAAA6+Y,EAAA5rY,KAAAoC,QAMA8/X,EAAAniY,UAAA8lH,MAAA,WACA,GAAA,IAAAzjH,KAAAgoY,aAEA,OAAA5yZ,EAAAq0Z,YAAAzpY,KAAAk+M,SAAA5zO,KAAA,KAEAuuB,EAAA,iBAAAmH,KAAAgoY,cACAnvY,EAAA,iBAAAmH,KAAAioY,cAEA,IAAAnpQ,EAAA,GACAujG,EAAAriO,KAAAk+M,QAAAp+N,MAAA,MAAAoJ,EAAAm5O,EAAA,GAAAl5O,EAAAk5O,EAAA,GACAn5O,EAAAjkB,OACA65J,EAAAh0J,KAAAs4H,MAAA07B,EAAA1pJ,EAAAq0Z,YAAAvgZ,IAGA41I,EAAAh0J,KAAA,IAGA,IADA,IAAAksD,EAAA,CAAA,eACA7vD,EAAA64B,KAAAioY,aAAA9ga,EAAA64B,KAAAioY,aAAAjoY,KAAAgoY,aAAA7ga,IACA6vD,EAAAlsD,KAAA21Z,EAAAc,QAAA,WAAAp6Z,IAcA,OAZA23J,EAAAh0J,KAAA21Z,EAAAc,QAAA,2BAAAvqW,EAAA1sD,KAAA,OACA6e,EAAAlkB,OACA65J,EAAAh0J,KAAAs4H,MAAA07B,EAAA1pJ,EAAAq0Z,YAAAtgZ,EAAA6W,KAAAkoY,aAGAppQ,EAAAh0J,KAAA,IAEAk1B,KAAAkgY,QACArnY,EAAAmH,KAAAgmY,oBAAA3F,EAAAR,UACA/gQ,EAAA7gJ,MACA6gJ,EAAAh0J,KAAAk1B,KAAAgmY,SAAA3D,eAEAvjQ,EAAAx0J,KAAA,MAYAw1Z,EAAAniY,UAAA+rY,wBAAA,SAAAC,QACA,IAAAA,IAAAA,GAAA,GACA,IAAA7qQ,EAAA,GAEA8qQ,EAAA,IAAA9J,EAAA9/X,KAAAogY,eACA,GAAA,IAAAwJ,EAAA5B,aAEAlpQ,EAAAh0J,KAAAu6Z,EAAAwE,wBAAAD,EAAAhJ,qBAEA,GAAAgJ,EAAA5B,eAAA5C,EAAAzE,OAEA7hQ,EAAAh0J,KAAAu6Z,EAAAyE,iBAAA1E,EAAAzE,aAEA,CAEA,IAAAoH,EAAA6B,EAAA1rL,QAAAp+N,MAAA,MACAioZ,EAAA,GAAA9ia,QACA65J,EAAAh0J,KAAAu6Z,EAAAwE,wBAAA9B,EAAA,GAAAjoZ,MAAA,OAEA+Y,EAAA,iBAAA+wY,EAAA5B,cACAlpQ,EAAAh0J,KAAAu6Z,EAAAyE,iBAAAF,EAAA5B,aAAA,IAAAD,EAAA,GAAA9ia,OAAA,IAAA8ia,EAAA,GAAA9ia,SACA8ia,EAAA,GAAA9ia,QACA65J,EAAAh0J,KAAAu6Z,EAAAwE,wBAAA9B,EAAA,GAAAjoZ,MAAA,OAEAg/I,EAAA,CAAAA,EAAAx0J,KAAA,MAaA,OAXAq/Z,IACA7qQ,EAAAkmQ,EAAA,CACA,QACAK,EAAA0E,iBACA,gBACAjrQ,EAAA,CACA,iBACAumQ,EAAA0E,iBACA,SAGAjrQ,EAAAx0J,KAAA,KAUAw1Z,EAAAniY,UAAAqsY,kBAAA,SAAAL,GAEA,YADA,IAAAA,IAAAA,GAAA,GACA,IAAA3yX,OAAAhX,KAAA0pY,wBAAAC,GAAA,MAEA7J,EAl5BA,GAo5BAxse,EAAAwse,SAAAA,yOC7+BA,aACAtse,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAuye,iBAAAvye,EAAAwye,OAAAxye,EAAAqye,eAAArye,EAAA4te,iBAAA5te,EAAAw0e,eAAAx0e,EAAAs0e,kBAAAt0e,EAAAwze,MAAAxze,EAAAqze,OAAArze,EAAAqte,OAAArte,EAAAsyT,UAAA,EACAtyT,EAAAsyT,KAAA,IACAtyT,EAAAqte,OAAA,EAMArte,EAAAqze,OAAA,CACA72Z,EAAA,WACAC,EAAA,kBACAC,EAAA,aACAE,EAAA,cACAC,EAAA,aACAG,EAAA,qBACAM,GAAA,SACAC,GAAA,YAOAv9E,EAAAwze,MAAA,CACAmD,cAAA,0CACAC,cAAA,4CACAC,cAAA,qCACAC,cAAA,uCACAC,cAAA,uCACAC,cAAA,oCACAC,cAAA,mCACAC,cAAA,0BACAC,cAAA,4BACAC,cAAA,0BACAC,eAAA,4BACAC,eAAA,qBACAC,eAAA,qBACAC,eAAA,qBACAC,gBAAA,6DACAC,gBAAA,6DACAC,gBAAA,4CACAC,gBAAA,4CACAC,SAAA,cACAC,UAAA,WACAC,WAAA,YACAC,YAAA,sBAOAh4e,EAAAs0e,kBAAA,mBAMAt0e,EAAAw0e,eAAA,2CAMAx0e,EAAA4te,iBAAA,mBAMA5te,EAAAqye,eAAA,OACArye,EAAAwye,OAAA,IAAA9uX,OAAA,+BACA1jH,EAAAuye,iBAAA,IAAA7uX,OAAA,+DC1EA,aACAxjH,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAm2e,YAAAn2e,EAAAi4e,kBAAAj4e,EAAAk4e,QAAAl4e,EAAAm4e,mBAAA,EACA,IAAAhL,EAAAlte,EAAA,cAIA,SAAAk4e,EAAAvvZ,GACA,OAAAA,EAAAhD,QAAA,QAAA,gCAiBA,SAAAwyZ,EAAAjoR,GACA,OAAAA,EAAAvqI,QAAA,QAAA,gCAhBA5lF,EAAAm4e,cAAAA,EAcAn4e,EAAAk4e,QAVA,SAAAtvZ,EAAAnX,GAGA,YAFA,IAAAA,IAAAA,EAAA,GACAmX,EAAA4D,MAAA,IAEA1V,KAAA,SAAAn2E,EAAAkzE,GACA,OAAAs5Z,EAAAc,QAAA,qDAAAtte,EAAAkzE,EAAApC,EAAA0ma,EAAAx3e,OAGAq2E,KAAA,KAaAh3E,EAAAi4e,kBAJA,SAAArtL,GAEA,OADAA,EAAAp+N,MAAA,KACA1V,KAAA,SAAAg6I,GAAA,OAAAsnR,EAAAtnR,MAAA95I,KAAA,MAiBAh3E,EAAAm2e,YAVA,SAAAkC,EAAA5ma,GAGA,YAFA,IAAAA,IAAAA,EAAA,GACA4ma,EAAA7rZ,MAAA,KACA1V,KAAA,SAAAg6I,EAAAj9I,GACA,MAAA,WAAA1B,KAAA2+I,GACAA,EAEAq8Q,EAAAc,QAAA,+CAAAp6Z,EAAApC,EAAA2ma,EAAAtnR,0DC/CA,aACA,IAAAu6N,EAAA3+U,MAAAA,KAAA2+U,kBAAAnrb,OAAAU,OAAA,SAAAg8K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACAb,OAAAC,eAAAy8K,EAAA2hH,EAAA,CAAA9yL,YAAA,EAAAvd,IAAA,WAAA,OAAAtC,EAAA7qF,OACA,SAAA67K,EAAAhxF,EAAA7qF,EAAAw9R,QACAn8R,IAAAm8R,IAAAA,EAAAx9R,GACA67K,EAAA2hH,GAAA3yM,EAAA7qF,KAEAuqb,EAAA5+U,MAAAA,KAAA4+U,qBAAAprb,OAAAU,OAAA,SAAAg8K,EAAApL,GACAtxK,OAAAC,eAAAy8K,EAAA,UAAA,CAAAnxE,YAAA,EAAArrG,MAAAoxK,KACA,SAAAoL,EAAApL,GACAoL,EAAA,QAAApL,IAEA+5Q,EAAA7+U,MAAAA,KAAA6+U,cAAA,SAAAv8R,GACA,GAAAA,GAAAA,EAAAtuJ,WAAA,OAAAsuJ,EACA,IAAA13E,EAAA,GACA,GAAA,MAAA03E,EAAA,IAAA,IAAAjuJ,KAAAiuJ,EAAA,YAAAjuJ,GAAAb,OAAAmqG,UAAAnD,eAAAoD,KAAA0kD,EAAAjuJ,IAAAsqb,EAAA/zW,EAAA03E,EAAAjuJ,GAEA,OADAuqb,EAAAh0W,EAAA03E,GACA13E,GAEAp3E,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAw2e,iBAAAx2e,EAAAu2e,wBAAAv2e,EAAAy2e,iBAAAz2e,EAAAs4e,SAAAt4e,EAAAu4e,wBAAA,EACA,IAAAxrL,EAAAw+H,EAAAtrb,EAAA,gBACAkte,EAAAlte,EAAA,cACA,SAAAs4e,EAAAC,GACA,OAAArL,EAAAc,QAAA,OAAAuK,EAAAxha,KAAA,MAGA,SAAAsha,EAAAnoR,GACA,OAAAA,EAAAx+I,OAAA,EACAw7Z,EAAAc,QAAA,YAAA,EAAA99Q,EAAAx+I,OAAAw+I,GAEAA,EALAnwN,EAAAu4e,mBAAAA,EAOAv4e,EAAAs4e,SAAAA,EACAt4e,EAAAy2e,iBAAA,gBA0BAz2e,EAAAu2e,wBAzBA,SAAAnJ,GACA,IAAAqL,EAAA,GACArL,EAAAtse,SAAA,SAAAqvN,EAAAt8I,GAEA,IADAf,SAAAq9I,EAAA,KAEAsoR,EAAAjha,KAAA3D,MAKA,IAAA2ka,EAAAC,EAAA3ha,KAAA,SAAA4ha,GACA,OAAAtL,EACAt2Z,KAAA,SAAAq5I,EAAAt8I,GACA,GAAAA,IAAA6ka,EAAA,CACA,IAAAC,EAAA,IAAA9ka,GAAAA,IAAAk5O,EAAAsgL,OAAA,EAAA,IAAA,GACA,OAAAkL,EAAA,CAAAD,EAAAnoR,GAAAwoR,IAEA,OAAAL,EAAAnoR,MAEAn5I,KAAA,QAIA,OADAwha,EAAAhha,KAAA41Z,EAAAt2Z,IAAAwha,GAAAtha,KAAA,MACAuha,EAAAC,IAiCAx4e,EAAAw2e,iBA9BA,SAAA9B,EAAAkE,EAAAC,GACA,IAAAjjZ,EAAAgjZ,EAAA,GAAA,IACA/iZ,EAAAgjZ,EAAA,GAAA,IACAL,EAAA,GAEAI,GAAAC,GACAL,EAAAhha,KAAA,MAGAoha,GAAAC,GACAL,EAAAhha,KAAA,KAEAqha,IAAAD,IAAAC,GAAAD,IAEAJ,EAAAhha,KAAA,KAGAgha,EAAAhha,KAAA21Z,EAAAc,QAAA,oBAAAr4Y,EAAA8+Y,EAAA,IAEA8D,EAAAhha,KAAA21Z,EAAAc,QAAA,oBAAAyG,EAAA,EAAA7+Y,IAEA2iZ,EAAAhha,KAAA21Z,EAAAc,QAAA,sBAAAyG,EAAA,IAEA,IAAA,IAAAtH,EAAA,EAAAA,EAAAsH,EAAA,EAAAtH,IACA,IAAA,IAAA13R,EAAA,EAAAA,EAAAg/R,EAAAtH,EAAA13R,IACA8iS,EAAAhha,KAAA21Z,EAAAc,QAAA,oCAAAv4R,EAAAg/R,EAAAh/R,EAAA03R,EAAA,IAGA,OAAAmL,EAAAC,4EC1FA,aAEA,MAAA/8Q,UAAAj2H,MACAjiG,YAAA8iF,GACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,gBAIA,MAAAi1W,EAAA,CAAAzyJ,EAAAoyJ,EAAA3pL,EAAAnpL,KACA,IAAAozW,EACA,MAAAqkI,EAAA,IAAArmU,SAAA,CAAAC,EAAAu5B,KACA,GAAA,iBAAAkoK,GAAAA,EAAA,EACA,MAAA,IAAA1iQ,UAAA,mDAGA0iQ,IAAAp7P,EAAAA,GAKA13G,EAAA,CACA03e,aAAA,CAAAxhU,WAAAA,WAAAolD,aAAAA,iBACAt7N,GAGAozW,EAAApzW,EAAA03e,aAAAxhU,WAAAjtE,UAAAloG,GAAA,KACA,GAAA,mBAAAooL,EAAA,CACA,IACA9X,EAAA8X,KACA,MAAAvuG,GACAgwH,EAAAhwH,GAGA,OAGA,MACAu1R,EAAAhnL,aAAAhlF,MAAAglF,EAAA,IAAAixC,EADA,iBAAAjxC,EAAAA,EAAA,2BAAA2pL,kBAGA,mBAAApyJ,EAAA2yJ,QACA3yJ,EAAA2yJ,SAGAzoK,EAAAulK,KACA2C,GAEA,WACA,IACAzhM,QAAAqvC,GACA,MAAA9lI,GACAgwH,EAAAhwH,GACA,QACA56E,EAAA03e,aAAAp8Q,aAAAryH,UAAAloG,EAAAqyW,KANA,IA9BA/hM,EAAAqvC,MA8CA,OALA+2R,EAAAh/U,MAAA,KACA6iE,aAAA83I,GACAA,OAAAryW,GAGA02e,GAGA/4e,EAAAC,QAAAw0W,EAEAz0W,EAAAC,QAAAH,QAAA20W,EAEAz0W,EAAAC,QAAAy7N,aAAAA,gCCtEA,aAEA,MAAAqsF,EAAA7nT,EAAA,UACAkse,aACAA,EAAAD,SACAA,EAAAE,SACAA,EAAAC,QACAA,EAAAC,SACAA,GACArse,EAAA,eAEAF,EAAAC,QAAA,CACAozN,IAAA26L,GAAAA,EAAAtzU,QAAAu1T,IACA,GAAAA,EAAAjmF,aAAA5uO,SAAAgxZ,GACA,OAAA,EAGA,MAAA6M,EAAAhpG,EAAAipG,gBAAA/M,GAEA,OAAApkL,EAAAwG,WAAA/8N,QAAAynZ,IACAlxL,EAAAyG,iBAAAh9N,QAAAynZ,MAEA/O,OAAAl8E,GAAAA,EAAAtzU,QAAAu1T,IACA,GAAAA,EAAAjmF,aAAA5uO,SAAAgxZ,GACA,OAAA,EAGA,MAAA6M,EAAAhpG,EAAAipG,gBAAA/M,GAEA,OAAApkL,EAAAyG,iBAAAh9N,QAAAynZ,IACAlxL,EAAAkG,IAAAz8N,QAAAynZ,EAAAC,gBAAA7M,GAAA6M,gBAAA3M,OAEA4M,WAAAnrF,GAAAA,EAAAtzU,QAAAu1T,IACA,GAAAA,EAAAjmF,aAAA5uO,SAAAgxZ,GACA,OAAA,EAGA,MAAA6M,EAAAhpG,EAAAipG,gBAAA/M,GAGA,OAAApkL,EAAAwG,WAAA/8N,QAAAynZ,GACAlxL,EAAAkG,IAAAz8N,QAAAynZ,EAAAC,gBAAA7M,GAAA6M,gBAAA5M,IAIAvkL,EAAAyG,iBAAAh9N,QAAAynZ,IACAlxL,EAAAkG,IAAAz8N,QAAAynZ,EAAAC,gBAAA7M,GAAA6M,gBAAA3M,yEC9CA,aAEA,MAAA37J,EAAA1wU,EAAA,SACA84N,EAAA43G,EAAA,sBACA53G,EAAA98I,MAAA00P,EAAA,4BAEA,MAAA5+E,aAAAA,GAAA9xP,EAAA,UACA0rP,EAAA1rP,EAAA,YACA0kO,EAAA1kO,EAAA,aAEA+9N,WAAAA,GAAA/9N,EAAA,sBACAk5e,EAAAl5e,EAAA,uBACAm5e,2BAAAC,GAAAp5e,EAAA,4BAEA4nT,UAAAA,GAAA5nT,EAAA,aACA6nT,EAAA7nT,EAAA,SACAw6N,EAAAx6N,EAAA,YAEAkse,aAAAA,GAAAlse,EAAA,eACAo5c,EAAAp5c,EAAA,cACAk/c,EAAAl/c,EAAA,qBACAq5e,eAAAA,EAAAC,YAAAA,GAAAt5e,EAAA,WAEA,SAAA60M,KAiOA/0M,EAAAC,QAAA2kO,EA5NA,MAMAphO,YAAAlC,EAAA,IACA,IAAAA,EAAA4sZ,SACA,MAAA,IAAAzoT,MAAA,6FAGAkH,KAAAgzW,UAAAr+c,EAAA4sZ,SAEAvhT,KAAA8sY,WAAA,CACAC,WAAA,CAAA,aACAC,wBAAA,GAGAr4e,EAAAs4e,OACAjtY,KAAAitY,KAAAt4e,EAAAs4e,MAIAjtY,KAAAktY,cAAA,IAAAlqZ,IAGAgd,KAAA8kW,UAAA,IAAAz/M,EACArlJ,KAAA8kW,UAAAtgY,IAAA,aACAw7B,KAAA8kW,UAAAjB,YAAA,EACA7jW,KAAA8kW,UAAA9vX,MAAA,KACAgrB,KAAA8kW,UAAAjB,YAAA,GAEA7jW,KAAA8kW,UAAAvkU,KAAA,KACAvgC,KAAA8kW,UAAAjB,YAAA,GAEA7jW,KAAAmtY,gBAAAntY,KAAAmtY,gBAAAx0Y,KAAAqH,MAUAnpG,WAAAysY,EAAA3uY,EAAA,IACA,MAAAy4e,QAAAptY,KAAAmmV,SAAA7iD,EAAA3uY,GACAg/c,EAAAlB,EAAA26B,EAAA,CAAAl0C,WAAA51D,EAAAzzK,OAAAl7N,EAAAk7N,SACAxD,EAAA,6BAAAsnP,EAAAza,YACA,MAAA3O,QAAAvqV,KAAAgzW,UAAAsB,gBAAAX,GAEA,OADAtnP,EAAA,kCAAAsnP,EAAAza,YACA3O,EAUA1zb,SAAAysY,EAAA3uY,EAAA,IACA,GAAAA,EAAAk7N,QAAAl7N,EAAAk7N,OAAAx8E,QACA,MAAA,IAAAi+E,EAGA,MAAA+7Q,EAAA,CACAC,WAAA,EACApiG,SAAA,KACAv2Y,EAAA04e,WAAA,IAIArtY,KAAAitY,OAAAI,EAAAJ,KAAAjtY,KAAAitY,MAEA,MAAA9P,EAAA75F,EAAA61D,YACAo0C,MAAA,IAAA3na,KAAAwoC,WAAAhQ,SAAA,IAAAL,KAAAunE,MAEA,OAAA,IAAAS,SAAA,CAAAC,EAAAu5B,KACA,MAAAiuS,EAAAxtY,KAAAktY,cAAA1rZ,IAAAqrZ,EAAAvpG,IAEA,IAAAkqG,IAAAA,EAAA1gS,SACA,OAAAvN,EAAA0/C,EAAA,IAAAnmJ,MAAA,gCAAA,8BAGA,MAAA20Y,EAAAD,EAAA1gS,SAAAqvF,GAEAnnN,EAAA+oB,KAAAunE,MACA,IAAA6xR,EAEA9qO,EAAA,gBAAA8wQ,EAAA33X,KAAA23X,EAAA13X,MACA,MAAAioY,EAAA,IAAAjB,EAAAY,GAEA53e,EAAAgkG,IACA,IAAA09V,EAAA,CACA,MAAA1nX,EAAA,oBAAA0tZ,EAAA33X,QAAA23X,EAAA13X,SAAAhM,EAAA9f,UACA0yI,EAAA98I,MAAAE,GACAq6F,EAAArwE,KAIAk0Y,EAAA,KACAthR,EAAA,4BAAA8wQ,EAAA33X,KAAA23X,EAAA13X,MACA,MAAAhM,EAAAwlJ,EAAA,IAAAnmJ,MAAA,4BAAAiF,KAAAunE,MAAAtwF,OAAA,uBAEA04Z,EAAA70T,KAAA,QAAAp/E,IAGAqwV,EAAA,KACAqN,GAAA,EAEA9qO,EAAA,0BAAA8wQ,EAAA33X,KAAA23X,EAAA13X,MACAqkE,EAAA,OAGAguD,EAAA,KACAzL,EAAA98I,MAAA,2BAAA4tZ,EAAA33X,KAAA23X,EAAA13X,MACAioY,EAAApgS,UACAxjC,EAAA,IAAAwnD,IAGAxnD,EAAArwE,IACAi0Y,EAAAl4Q,eAAA,UAAAm4Q,GACAD,EAAAl4Q,eAAA,UAAAs0N,GACAn1b,EAAAk7N,QAAAl7N,EAAAk7N,OAAAxoD,oBAAA,QAAAywD,GAEAr+H,EAAA8lG,EAAA9lG,GAAAusE,EAAA0nU,IAGAA,EAAA1/Z,GAAA,QAAAv4E,GACAi4e,EAAA9mR,KAAA,UAAA+mR,GACAD,EAAA9mR,KAAA,UAAAkjO,GACA4jD,EAAA1/Z,GAAA,SAAA,KACA0/Z,EAAAl4Q,eAAA,QAAA//N,MAEAd,EAAAk7N,QAAAl7N,EAAAk7N,OAAA3pD,iBAAA,QAAA4xD,GAEA41Q,EAAA1/Z,GAAA,UAAA6hJ,IACA49Q,EAAA50T,KAAA,eAAA,CACA00T,SAAAA,EACAK,aAAAJ,EAAAK,eAAAzvY,WACA0vY,aAAAxqG,EAAAllS,WACAyxH,OAAAA,OAMA49Q,EAAAz/Z,GAAA,gBAAA+/Z,IACAA,EAAAR,WAAAA,GAAAQ,EAAAt0Y,KACA8lG,EAAA0/C,EAAA8uP,EAAAt0Y,eAAAX,MAAAi1Y,EAAAt0Y,IAAA,IAAAX,MAAAi1Y,EAAAt0Y,KAAA,0BAGAs0Y,EAAAR,WAAAA,GAAAQ,EAAAC,SAAAN,EAAA9kT,WAIA8kT,EAAA79Q,OAAAk+Q,EAAAl+Q,cAcAh5N,eAAAlC,EAAA,GAAA4oK,GACA,IAAAovU,IAAA3sY,KAAAitY,KACA,MAAAhuP,EAAA,IAAAnmJ,MAAA,qBAAA,yBAUA,MAPA,mBAAAnkG,IACA4oK,EAAA5oK,EACAA,EAAA,IAKAg4c,EAAA,CAAApvS,QAFAA,EAAAA,GAAA6qC,EAEAm5M,SAAAvhT,KAAAgzW,WAAAhzW,KAAArrG,GASAkC,OAAAwqZ,GAGA,OAFAA,EAAAxjT,MAAA/gB,QAAAukU,GAAAA,EAAA,CAAAA,IAEAtzU,QAAAu1T,IACAA,EAAAjmF,aAAA5uO,SAAAgxZ,IAIArkL,EAAA2G,WAAAl9N,QAAAy+S,KAIAzsY,gBAAAo3e,GACA,IAAAjuY,KAAA8kW,UAAAjB,WAAA,OAEAx3O,EAAA,mBAAA4hR,GACAA,EAAArB,EAAAqB,GAEA,MAAA3qG,EAAA,IAAAnoF,EAAA8yL,GACAvyQ,EAAA3N,EAAA0M,oBAAA6oK,EAAA8iE,aAEApmW,KAAA8kW,UAAAjsR,KAAA,OAAA,CACA50F,GAAAy3I,EACA2lL,WAAA,CAAA/d,OAKA,CAAAzoS,UAAA,aAAAo/H,WAAA;A;ACvPA,IAAAgqG,EAAA1wU,EAAA,QAAAA,CAAA,eACA26e,EAAA36e,EAAA,mBACA46e,EAAA56e,EAAA,eACAi9N,EAAAj9N,EAAA,mBACAiqV,EAAAjqV,EAAA,mBACAupT,EAAAvpT,EAAA,YAEA66e,EAAA,MAKA,SAAAC,EAAAC,GACA,OAAAA,EAAAp1Z,QAAA,6BAAA,IAYA,MAAAq7X,UAAA/jP,EAAAgzG,OACA3sU,YAAAkqK,GAuCA,GAlCAx7C,MAJAw7C,EAAAvtK,OAAAiqG,OAAA,CACAkxO,eAAA,GACA5tK,IAIA/gE,KAAAuhG,IAAA4sS,EAAA,GAAA/vY,SAAA,OAAAh5B,MAAA,EAAA,GACA46B,KAAAuuY,OAAA,cAAAxtU,GAEA/gE,KAAAwuY,YAAAztU,EAAAusU,UACAvsU,EAAAytU,aAAAL,EAAA,IAAA/vY,SAAA,OACA,KAEA4B,KAAAstY,UAAAvsU,EAAAusU,YAAA,EACAttY,KAAAyuY,cAAA1tU,EAAA0tU,eAAAl6B,EAAAk6B,cACAzuY,KAAA0uY,WAAA1uY,KAAAyuY,cAAAC,WACA1uY,KAAAzlB,OAAA/mF,OAAAiqG,OAAA,GAAA82W,EAAAh6X,OAAAwmF,EAAAxmF,QACAylB,KAAA2uY,aAAA5tU,EAAA4tU,cAAA,GACA3uY,KAAA4uY,cAAA7tU,EAAA6tU,eAAA,GACA5uY,KAAA6uY,aAAA9tU,EAAA8tU,cAAA,CAAAP,GAAAA,GACAtuY,KAAAg2O,QAAAj1K,EAAAi1K,UAAAj1K,EAAAyvD,OAAA,CAAAzvD,EAAAyvD,QAAA,IACAxwH,KAAAkrS,aAAAx1Y,IAAAqrK,EAAAmqO,SAAAnqO,EAAAmqO,QACAlrS,KAAA8uY,sBAAAp5e,IAAAqrK,EAAA+tU,kBAAA/tU,EAAA+tU,iBACA9uY,KAAA+uY,mBAAAhuU,EAAAguU,oBA1CA,IA4CA/uY,KAAAgvY,YAAA,EAEAhvY,KAAA29X,mBAAAjoe,EACAsqG,KAAAivY,kBAAAv5e,EACAsqG,KAAAu/X,gBAAA7pe,EACAsqG,KAAAq/X,kBAAA3pe,EACAsqG,KAAAkvY,iBAAAx5e,EACAsqG,KAAAs/X,eAAA5pe,EAEAsqG,KAAAmvY,MAAApuU,EAAAksU,MAAA,iBAAAlsU,EAAAksU,KACAlsU,EAAAksU,KACAiB,KAEAluY,KAAAmvY,MACA,KAAA,oBAAA5vY,OACAu9M,EAAA,IAAAhkN,MAAA,qEAAA,sBAEAgkN,EAAA,IAAAhkN,MAAA,8CAAA,sBAIAkH,KAAAovY,UAAA,EACApvY,KAAAqvY,eAAA,EACArvY,KAAAsvY,cAAA,EACAtvY,KAAAuvY,kBAAA,KACAvvY,KAAAwvY,SAAA,KACAxvY,KAAAyvY,mBAAA,GAEAzvY,KAAA0vY,gBAAA1vY,KAAA0uY,aAAA1uY,KAAAstY,UACAttY,KAAA2vY,qBAAA,EACA3vY,KAAA4vY,oBAAA,EACA5vY,KAAA6vY,uBAAA,GACA7vY,KAAA8vY,WAAA,IAAA9sZ,IACAgd,KAAA+vY,cAAA,EACA/vY,KAAAgwY,iBAAA,KAEAhwY,KAAAiwY,cAAA,GACAjwY,KAAAkwY,eAAA,GAEAlwY,KAAAmwY,OAAA,KACAnwY,KAAAowY,IAAA,KACApwY,KAAA4lQ,UAAA,KAEA,IACA5lQ,KAAAqwY,IAAA,IAAArwY,KAAAmvY,MAAA,kBAAAnvY,KAAAzlB,QACA,MAAAkf,GAEA,YADA+jP,GAAA,IAAAx9O,KAAAstG,QAAAwvG,EAAArjN,EAAA,yBAMAuG,KAAAswY,qBAAA,iBAAAtwY,KAAAqwY,IAAAE,kBAEAvwY,KAAAqwY,IAAAG,2BAAA,KACAxwY,KAAAywY,qBAEAzwY,KAAAqwY,IAAAK,0BAAA,KACA1wY,KAAAywY,qBAEAzwY,KAAAqwY,IAAAM,wBAAA,KACA3wY,KAAA4wY,4BAEA5wY,KAAAqwY,IAAAQ,uBAAA,KACA7wY,KAAA8wY,2BAEA9wY,KAAAqwY,IAAAU,eAAA7na,IACA82B,KAAAgxY,gBAAA9na,IASA82B,KAAAstY,WAAAttY,KAAA0uY,WACA1uY,KAAAixY,WAAA,CACAvD,QAAA1tY,KAAAqwY,IAAAa,kBAAAlxY,KAAAwuY,YAAAxuY,KAAAyuY,iBAGAzuY,KAAAqwY,IAAAc,cAAAjoa,IACA82B,KAAAixY,WAAA/na,IAIA82B,KAAAg2O,SACAh2O,KAAAg2O,QAAA5hV,SAAAo8N,IACAxwH,KAAA0xX,UAAAlhQ,MAGAxwH,KAAAqwY,IAAAe,QAAAloa,IACA82B,KAAAqxY,SAAAnoa,IAGA82B,KAAAstY,WACAttY,KAAAsxY,oBAGAtxY,KAAAuxY,eAAA,KACAvxY,KAAAwxY,aAEAxxY,KAAA4mH,KAAA,SAAA5mH,KAAAuxY,gBAGAE,iBACA,OAAAzxY,KAAAwvY,UAAAxvY,KAAAwvY,SAAAkC,gBAAA,EAKAv6C,gBACA,OAAAn3V,KAAAgvY,YAAA,SAAAhvY,KAAAwvY,SAAA7oR,WAGA9vN,UACA,MAAA,CAAA4uG,KAAAzF,KAAAs/X,UAAAniL,OAAAn9M,KAAAkvY,YAAAhxL,QAAAl+M,KAAAq/X,cAGAxoe,OAAA61J,GACA,GAAA1sD,KAAA4oF,UAAA,MAAAk0H,EAAA,IAAAhkN,MAAA,yCAAA,iBACA,GAAA,iBAAA4zD,EACA,IACAA,EAAA7kF,KAAAoH,MAAAy9E,GACA,MAAAjzD,GACAizD,EAAA,GAGA1sD,KAAAuuY,OAAA,YAEA7hV,EAAAilV,aAAA3xY,KAAAstY,YACAttY,KAAAuuY,OAAA,8BACAvuY,KAAAsxY,qBAEA5kV,EAAAklV,oBAAA5xY,KAAAstY,YACAttY,KAAAuuY,OAAA,+BACAvuY,KAAA6xY,eAAAnlV,EAAAklV,mBAAA/yW,KAAA6tB,EAAAklV,mBAAA58W,OAEA03B,EAAAi+G,YACA3qK,KAAAqwY,IAAAyB,mBAAA9xY,KAAAqwY,IAAAyB,kBAAAhra,KACAk5B,KAAA+xY,iBAAArlV,EAAAi+G,WAEA3qK,KAAAyvY,mBAAA3ka,KAAA4hF,EAAAi+G,YAGAj+G,EAAA4hV,KACAtuY,KAAAqwY,IAAA2B,qBAAA,IAAAhyY,KAAAmvY,MAAA,sBAAAziV,IACAzuD,MAAA,KACA+B,KAAA4oF,YAEA5oF,KAAAyvY,mBAAAr7e,SAAAu2Q,IACA3qK,KAAA+xY,iBAAApnO,MAEA3qK,KAAAyvY,mBAAA,GAEA,UAAAzvY,KAAAqwY,IAAAyB,kBAAAhra,MAAAk5B,KAAAiyY,oBAEA/zY,OAAAzE,IACAuG,KAAAstG,QAAAwvG,EAAArjN,EAAA,kCAGAizD,EAAA4hV,KAAA5hV,EAAAi+G,WAAAj+G,EAAAilV,aAAAjlV,EAAAklV,oBACA5xY,KAAAstG,QAAAwvG,EAAA,IAAAhkN,MAAA,4CAAA,kBAIAjiG,iBAAA8zQ,GACA,IAAAunO,EAAA,IAAAlyY,KAAAmvY,MAAAgD,gBAAAxnO,GACA3qK,KAAAqwY,IAAA+B,gBAAAF,GACAh0Y,OAAAzE,IA7MA,IAAA9f,GA8MAu4Z,EAAAh0L,SAAAg0L,EAAAh0L,QAAAn4O,SAAA,WA9MA4T,EA+MA,sCA9MA+gB,QAAAs6E,KAAAr7F,IAgNAqmB,KAAAstG,QAAAwvG,EAAArjN,EAAA,6BASA5iG,KAAA44G,GACAzP,KAAAwvY,SAAA78Q,KAAAljH,GAQA54G,eAAAgoI,EAAA7J,GAGA,GAFAh1B,KAAAuuY,OAAA,oBAEAvuY,KAAAstY,UACA,IACAttY,KAAAqwY,IAAAwB,eAAAhzW,EAAA7J,GACAh1B,KAAAsxY,oBACA,MAAA73Y,GACAuG,KAAAstG,QAAAwvG,EAAArjN,EAAA,6BAGAuG,KAAA64E,KAAA,SAAA,CACA+4T,mBAAA,CAAA/yW,KAAAA,EAAA7J,KAAAA,KASAn+H,UAAA25N,GACAxwH,KAAAuuY,OAAA,eAEA/9Q,EAAA6hR,YAAAj+e,SAAAynM,IACA77F,KAAAsyY,SAAAz2S,EAAA20B,MASA35N,SAAAglM,EAAA20B,GACAxwH,KAAAuuY,OAAA,cAEA,IAAAgE,EAAAvyY,KAAA8vY,WAAAtuZ,IAAAq6G,IAAA,IAAA74G,IACAwvZ,EAAAD,EAAA/wZ,IAAAgvI,GACA,GAAAgiR,EAKA,MAAAA,EAAA9vU,QACAo6I,EAAA,IAAAhkN,MAAA,qFAAA,sBAEAgkN,EAAA,IAAAhkN,MAAA,gDAAA,4BAPA05Y,EAAAxyY,KAAAqwY,IAAAiC,SAAAz2S,EAAA20B,GACA+hR,EAAA9wZ,IAAA+uI,EAAAgiR,GACAxyY,KAAA8vY,WAAAruZ,IAAAo6G,EAAA02S,GACAvyY,KAAAsxY,oBAcAz6e,aAAA47e,EAAAC,EAAAliR,GACAxwH,KAAAuuY,OAAA,kBAEA,IAAAgE,EAAAvyY,KAAA8vY,WAAAtuZ,IAAAixZ,GACAD,EAAAD,EAAAA,EAAA/wZ,IAAAgvI,GAAA,KACA,IAAAgiR,EACA,MAAA11L,EAAA,IAAAhkN,MAAA,8CAAA,uBAEA45Y,GAAA1yY,KAAA8vY,WAAAruZ,IAAAixZ,EAAAH,GAEA,MAAAC,EAAAG,aACAH,EAAAG,aAAAD,GAEA1yY,KAAAstG,QAAAwvG,EAAA,IAAAhkN,MAAA,iDAAA,iCASAjiG,YAAAglM,EAAA20B,GACAxwH,KAAAuuY,OAAA,kBAEA,IAAAgE,EAAAvyY,KAAA8vY,WAAAtuZ,IAAAq6G,GACA22S,EAAAD,EAAAA,EAAA/wZ,IAAAgvI,GAAA,KACA,IAAAgiR,EACA,MAAA11L,EAAA,IAAAhkN,MAAA,6CAAA,uBAEA,IACA05Y,EAAA9vU,SAAA,EACA1iE,KAAAqwY,IAAAuC,YAAAJ,GACA,MAAA/4Y,GACA,wBAAAA,EAAA5mG,KACAmtG,KAAA6vY,uBAAA/ka,KAAA0na,GAEAxyY,KAAAstG,QAAAwvG,EAAArjN,EAAA,qBAGAuG,KAAAsxY,oBAOAz6e,aAAA25N,GACAxwH,KAAAuuY,OAAA,mBAEA/9Q,EAAA6hR,YAAAj+e,SAAAynM,IACA77F,KAAA4yY,YAAA/2S,EAAA20B,MAIA35N,oBACAmpG,KAAAuuY,OAAA,qBACAvuY,KAAA2vY,sBACA3vY,KAAA2vY,qBAAA,EACAnyJ,GAAA,KACAx9O,KAAA2vY,qBAAA,EACA3vY,KAAAuuY,OAAA,gCACAvuY,KAAA6yY,gBAIAh8e,YACAmpG,KAAAstY,UACAttY,KAAA0vY,gBACA1vY,KAAA4vY,oBAAA,EACA5vY,KAAAuuY,OAAA,mCAEAvuY,KAAAuuY,OAAA,qBACA1jU,YAAA,KACA7qE,KAAA8yY,iBACA,IAGA9yY,KAAA0vY,gBACA1vY,KAAA4vY,oBAAA,EACA5vY,KAAAuuY,OAAA,mCAEAvuY,KAAAuuY,OAAA,yCACAvuY,KAAA64E,KAAA,SAAA,CACA84T,aAAA,KAIA3xY,KAAA0vY,gBAAA,EAGA74e,SAAA4iG,EAAA4mD,GA0BA,GAzBArgD,KAAAuuY,OAAA,sBAAA90Y,IAAAA,EAAA9f,SAAA8f,IAEAuG,KAAAumO,SAAAvmO,KAAAm2H,UAAA,EAEAn2H,KAAAsmO,eAAAp7J,OAAAlrE,KAAAl1B,KAAA,MACAk1B,KAAAsoO,eAAA5E,UAAA1jO,KAAAh7B,MAEAg7B,KAAAgvY,YAAA,EACAhvY,KAAAovY,UAAA,EACApvY,KAAAqvY,eAAA,EACArvY,KAAAiwY,cAAA,KACAjwY,KAAAkwY,eAAA,KACAlwY,KAAA8vY,WAAA,KAEAlpI,cAAA5mQ,KAAAgwY,kBACAhwY,KAAAgwY,iBAAA,KAEAppI,cAAA5mQ,KAAA4lQ,WACA5lQ,KAAA4lQ,UAAA,KACA5lQ,KAAAmwY,OAAA,KACAnwY,KAAAowY,IAAA,KAEApwY,KAAAuxY,gBAAAvxY,KAAAw1H,eAAA,SAAAx1H,KAAAuxY,gBACAvxY,KAAAuxY,eAAA,KAEAvxY,KAAAwvY,SAAA,CACA,IACAxvY,KAAAwvY,SAAAxvZ,QACA,MAAAyZ,IAEAuG,KAAAwvY,SAAAuD,UAAA,KACA/yY,KAAAwvY,SAAAwD,OAAA,KACAhzY,KAAAwvY,SAAArmK,QAAA,KACAnpO,KAAAwvY,SAAAh9Q,QAAA,KAEA,GAAAxyH,KAAAqwY,IAAA,CACA,IACArwY,KAAAqwY,IAAArwZ,QACA,MAAAyZ,IAEAuG,KAAAqwY,IAAAG,2BAAA,KACAxwY,KAAAqwY,IAAAK,0BAAA,KACA1wY,KAAAqwY,IAAAQ,uBAAA,KACA7wY,KAAAqwY,IAAAU,eAAA,KACA/wY,KAAAqwY,IAAAe,QAAA,KACApxY,KAAAqwY,IAAAc,cAAA,KAEAnxY,KAAAqwY,IAAA,KACArwY,KAAAwvY,SAAA,KAEAnvV,EAAA5mD,GAGA5iG,WAAAqyE,GACA,IAAAA,EAAAwka,QAIA,OAAA1tY,KAAAstG,QAAAwvG,EAAA,IAAAhkN,MAAA,oDAAA,qBAGAkH,KAAAwvY,SAAAtma,EAAAwka,QACA1tY,KAAAwvY,SAAA5R,WAAA,cAEA,iBAAA59X,KAAAwvY,SAAAyD,6BACAjzY,KAAAwvY,SAAAyD,2BAAA7E,GAGApuY,KAAAwuY,YAAAxuY,KAAAwvY,SAAAz+X,MAEA/Q,KAAAwvY,SAAAuD,UAAA7pa,IACA82B,KAAAkzY,kBAAAhqa,IAEA82B,KAAAwvY,SAAA2D,oBAAA,KACAnzY,KAAAozY,+BAEApzY,KAAAwvY,SAAAwD,OAAA,KACAhzY,KAAAqzY,kBAEArzY,KAAAwvY,SAAArmK,QAAA,KACAnpO,KAAAszY,mBAEAtzY,KAAAwvY,SAAAh9Q,QAAA/4H,IACAuG,KAAAstG,QAAAwvG,EAAArjN,EAAA,sBAKA,IAAA85Y,GAAA,EACAvzY,KAAAgwY,iBAAA/oI,aAAA,KACAjnQ,KAAAwvY,UAAA,YAAAxvY,KAAAwvY,SAAA7oR,YACA4sR,GAAAvzY,KAAAszY,kBACAC,GAAA,GAEAA,GAAA,IA7dA,KAkeA18e,SAEAA,OAAA44G,EAAA8sH,EAAAl8E,GACA,GAAArgD,KAAA4oF,UAAA,OAAAvoC,EAAAy8J,EAAA,IAAAhkN,MAAA,wCAAA,qBAEA,GAAAkH,KAAAgvY,WAAA,CACA,IACAhvY,KAAA2yH,KAAAljH,GACA,MAAAhW,GACA,OAAAuG,KAAAstG,QAAAwvG,EAAArjN,EAAA,qBAEAuG,KAAAwvY,SAAAkC,eAAAtD,GACApuY,KAAAuuY,OAAA,wCAAAvuY,KAAAwvY,SAAAkC,gBACA1xY,KAAAowY,IAAA/vV,GAEAA,EAAA,WAGArgD,KAAAuuY,OAAA,wBACAvuY,KAAAmwY,OAAA1gY,EACAzP,KAAAowY,IAAA/vV,EAMAxpJ,YACA,GAAAmpG,KAAA4oF,UAAA,OAIA,MAAA4qT,EAAA,KACA3oU,YAAA,IAAA7qE,KAAAstG,WAAA,MAGAttG,KAAAgvY,WACAwE,IAEAxzY,KAAA4mH,KAAA,UAAA4sR,GAIA38e,2BACAmpG,KAAA4oF,WACA5oF,KAAAuvY,oBACAvvY,KAAAuuY,OAAA,+BACAvuY,KAAAuvY,kBAAA1kU,YAAA,KACA7qE,KAAAsvY,eACAtvY,KAAAsvY,cAAA,EACAtvY,KAAAuuY,OAAA,iCACAvuY,KAAA64E,KAAA,cACA74E,KAAA64E,KAAA,mBAEA74E,KAAA+uY,qBAGAl4e,eACAmpG,KAAA4oF,WAEA5oF,KAAAqwY,IAAAoD,YAAAzzY,KAAA2uY,cACA1wY,MAAA8vY,IACA,GAAA/tY,KAAA4oF,UAAA,OACA5oF,KAAAkrS,SAAAlrS,KAAA8uY,mBAAAf,EAAAO,IAAAD,EAAAN,EAAAO,MACAP,EAAAO,IAAAtuY,KAAA6uY,aAAAd,EAAAO,KAEA,MAAAoF,EAAA,KACA,IAAA1zY,KAAA4oF,UAAA,CACA,IAAAinC,EAAA7vH,KAAAqwY,IAAAsD,kBAAA5F,EACA/tY,KAAAuuY,OAAA,UACAvuY,KAAA64E,KAAA,SAAA,CACA/xG,KAAA+oJ,EAAA/oJ,KACAwna,IAAAz+Q,EAAAy+Q,QAeAtuY,KAAAqwY,IAAAuD,oBAAA7F,GACA9vY,MAZA,KACA+B,KAAAuuY,OAAA,uBACAvuY,KAAA4oF,YACA5oF,KAAAkrS,SAAAlrS,KAAAsvY,aAAAoE,IACA1zY,KAAA4mH,KAAA,eAAA8sR,OASAx1Y,OANAzE,IACAuG,KAAAstG,QAAAwvG,EAAArjN,EAAA,oCAOAyE,OAAAzE,IACAuG,KAAAstG,QAAAwvG,EAAArjN,EAAA,wBAIA5iG,8BACAmpG,KAAAqwY,IAAAwD,iBACA7zY,KAAAqwY,IAAAwD,kBAAAz/e,SAAA0/e,IACAA,EAAAtmY,MAAAsmY,EAAAtB,OAAA32S,OAAAi4S,EAAA7nP,YACA6nP,EAAA7nP,WAAA,EACAjsJ,KAAA6xY,eAAAiC,EAAAtB,OAAA32S,MAAAh9D,UAMAhoI,gBACAmpG,KAAA4oF,WAEA5oF,KAAAqwY,IAAA0D,aAAA/zY,KAAA4uY,eACA3wY,MAAA+vY,IACA,GAAAhuY,KAAA4oF,UAAA,OACA5oF,KAAAkrS,SAAAlrS,KAAA8uY,mBAAAd,EAAAM,IAAAD,EAAAL,EAAAM,MACAN,EAAAM,IAAAtuY,KAAA6uY,aAAAb,EAAAM,KAEA,MAAA0F,EAAA,KACA,IAAAh0Y,KAAA4oF,UAAA,CACA,IAAAinC,EAAA7vH,KAAAqwY,IAAAsD,kBAAA3F,EACAhuY,KAAAuuY,OAAA,UACAvuY,KAAA64E,KAAA,SAAA,CACA/xG,KAAA+oJ,EAAA/oJ,KACAwna,IAAAz+Q,EAAAy+Q,MAEAtuY,KAAAstY,WAAAttY,KAAAi0Y,gCAaAj0Y,KAAAqwY,IAAAuD,oBAAA5F,GACA/vY,MAXA,KACA+B,KAAA4oF,YACA5oF,KAAAkrS,SAAAlrS,KAAAsvY,aAAA0E,IACAh0Y,KAAA4mH,KAAA,eAAAotR,OASA91Y,OANAzE,IACAuG,KAAAstG,QAAAwvG,EAAArjN,EAAA,oCAOAyE,OAAAzE,IACAuG,KAAAstG,QAAAwvG,EAAArjN,EAAA,yBAIA5iG,2BACAmpG,KAAA4oF,WACA,WAAA5oF,KAAAqwY,IAAA6D,iBACAl0Y,KAAAstG,QAAAwvG,EAAA,IAAAhkN,MAAA,sBAAA,2BAIAjiG,oBACA,IAAAmpG,KAAA4oF,UAAA,CACA,IAAAurT,EAAAn0Y,KAAAqwY,IAAA8D,mBACAC,EAAAp0Y,KAAAqwY,IAAA+D,kBAEAp0Y,KAAAuuY,OACA,kDACA4F,EACAC,GAEAp0Y,KAAA64E,KAAA,iBAAAs7T,EAAAC,GAEA,cAAAD,GAAA,cAAAA,IACAn0Y,KAAAovY,UAAA,EACApvY,KAAAq0Y,eAEA,WAAAF,GACAn0Y,KAAAstG,QAAAwvG,EAAA,IAAAhkN,MAAA,0BAAA,+BAEA,WAAAq7Y,GACAn0Y,KAAAstG,QAAAwvG,EAAA,IAAAhkN,MAAA,0BAAA,+BAIAjiG,SAAAwpJ,GAEA,MAAAi0V,EAAAC,IACA,mBAAA/gf,OAAAmqG,UAAAS,SAAAR,KAAA22Y,EAAAn3Y,SACAm3Y,EAAAn3Y,OAAAhpG,SAAAV,IACAF,OAAAiqG,OAAA82Y,EAAA7gf,MAGA6gf,GAIA,IAAAv0Y,KAAAqwY,IAAAmE,SAAAvva,QAAA+6B,KAAAswY,qBACAtwY,KAAAqwY,IAAAmE,WACAv2Y,MAAAlyB,IACA,IAAA0oa,EAAA,GACA1oa,EAAA33E,SAAAmgf,IACAE,EAAA3pa,KAAAwpa,EAAAC,OAEAl0V,EAAA,KAAAo0V,MACAh7Y,GAAA4mD,EAAA5mD,KAGAuG,KAAAqwY,IAAAmE,SAAAvva,OAAA,EACA+6B,KAAAqwY,IAAAmE,UAAAzoa,IAEA,IAAAi0B,KAAA4oF,UAAA,CAEA,IAAA6rT,EAAA,GACA1oa,EAAAnB,SAAAx2E,SAAAw2E,IACA,IAAA2pa,EAAA,GACA3pa,EAAA+4B,QAAAvvG,SAAAvB,IACA0hf,EAAA1hf,GAAA+3E,EAAAs3T,KAAArvY,MAEA0hf,EAAAtwZ,GAAArZ,EAAAqZ,GACAswZ,EAAAzta,KAAA8D,EAAA9D,KACAyta,EAAA1zE,UAAAj2V,EAAAi2V,UACA4zE,EAAA3pa,KAAAwpa,EAAAC,OAEAl0V,EAAA,KAAAo0V,OACAh7Y,GAAA4mD,EAAA5mD,KAKA4mD,EAAA,KAAA,IAIAxpJ,cAEA,GADAmpG,KAAAuuY,OAAA,8BAAAvuY,KAAAovY,SAAApvY,KAAAqvY,eACArvY,KAAAgvY,YAAAhvY,KAAA00Y,cAAA10Y,KAAAovY,WAAApvY,KAAAqvY,cAAA,OAEArvY,KAAA00Y,aAAA,EAGA,MAAAC,EAAA,KACA30Y,KAAA4oF,WAEA5oF,KAAAw0Y,UAAA,CAAA/6Y,EAAA6pD,KACA,GAAAtjD,KAAA4oF,UAAA,OAGAnvF,IAAA6pD,EAAA,IAEA,IAAAsxV,EAAA,GACAC,EAAA,GACAC,EAAA,GACAC,GAAA,EAEAzxV,EAAAlvJ,SAAA6mG,IAGA,oBAAAA,EAAAn0B,MAAA,qBAAAm0B,EAAAn0B,OACA8ta,EAAA35Y,EAAAhX,IAAAgX,GAEA,mBAAAA,EAAAn0B,MAAA,oBAAAm0B,EAAAn0B,OACA+ta,EAAA55Y,EAAAhX,IAAAgX,GAEA,kBAAAA,EAAAn0B,MAAA,mBAAAm0B,EAAAn0B,OACAgua,EAAA75Y,EAAAhX,IAAAgX,MAIA,MAAA+5Y,EAAAC,IACAF,GAAA,EAEA,IAAAvjW,EAAAqjW,EAAAI,EAAAC,kBAEA1jW,IAAAA,EAAA+oH,IAAA/oH,EAAA0sK,UAEAl+M,KAAAq/X,aAAA7tV,EAAA+oH,IAAA/oH,EAAA0sK,QACAl+M,KAAAs/X,UAAAn5Z,OAAAqrE,EAAA/rC,OACA+rC,GAAAA,EAAA2jW,WAEAn1Y,KAAAq/X,aAAA7tV,EAAA2jW,UACAn1Y,KAAAs/X,UAAAn5Z,OAAAqrE,EAAA4jW,aACA,iBAAAH,EAAAI,mBAEA7jW,EAAAyjW,EAAAI,iBAAAv1Z,MAAA,KACAkgB,KAAAq/X,aAAA7tV,EAAA,GACAxxC,KAAAs/X,UAAAn5Z,OAAAqrE,EAAA,KAEAxxC,KAAAq/X,eACAr/X,KAAAkvY,YAAAlvY,KAAAq/X,aAAA5wZ,SAAA,KAAA,OAAA,QAGA,IAAAw6R,EAAA2rI,EAAAK,EAAAK,mBAEArsI,IAAAA,EAAA1uG,IAAA0uG,EAAA/qD,UAEAl+M,KAAA29X,cAAA10H,EAAA1uG,IAAA0uG,EAAA/qD,QACAl+M,KAAAu/X,WAAAp5Z,OAAA8iS,EAAAxjQ,OACAwjQ,GAAAA,EAAAksI,WAEAn1Y,KAAA29X,cAAA10H,EAAAksI,UACAn1Y,KAAAu/X,WAAAp5Z,OAAA8iS,EAAAmsI,aACA,iBAAAH,EAAAM,oBAEAtsI,EAAAgsI,EAAAM,kBAAAz1Z,MAAA,KACAkgB,KAAA29X,cAAA10H,EAAA,GACAjpQ,KAAAu/X,WAAAp5Z,OAAA8iS,EAAA,KAEAjpQ,KAAA29X,gBACA39X,KAAAivY,aAAAjvY,KAAA29X,cAAAlvZ,SAAA,KAAA,OAAA,QAGAuxB,KAAAuuY,OACA,qCACAvuY,KAAAq/X,aAAAr/X,KAAAs/X,UAAAt/X,KAAA29X,cAAA39X,KAAAu/X,aAqBA,GAjBAj8U,EAAAlvJ,SAAA6mG,IAEA,cAAAA,EAAAn0B,MAAAm0B,EAAAu6Y,yBACAR,EAAAF,EAAA75Y,EAAAu6Y,2BAKA,sBAAAv6Y,EAAAn0B,MAAA,SAAAm0B,EAAAw6Y,uBACA,kBAAAx6Y,EAAAn0B,MAAA,mBAAAm0B,EAAAn0B,OAAAm0B,EAAAk1E,WAEA6kU,EAAA/5Y,MAMA85Y,GAAAvhf,OAAAW,KAAA2gf,GAAA7va,SAAAzxE,OAAAW,KAAA0gf,GAAA5va,OAAA,CAQA,GAJA+6B,KAAA00Y,aAAA,EACA10Y,KAAAgvY,YAAA,EAGAhvY,KAAAmwY,OAAA,CACA,IACAnwY,KAAA2yH,KAAA3yH,KAAAmwY,QACA,MAAA12Y,GACA,OAAAuG,KAAAstG,QAAAwvG,EAAArjN,EAAA,qBAEAuG,KAAAmwY,OAAA,KACAnwY,KAAAuuY,OAAA,0CAEA,IAAAluV,EAAArgD,KAAAowY,IACApwY,KAAAowY,IAAA,KACA/vV,EAAA,MAKA,iBAAArgD,KAAAwvY,SAAAyD,6BACAjzY,KAAA4lQ,UAAAqB,aAAA,IAAAjnQ,KAAAumQ,eAAA,KACAvmQ,KAAA4lQ,UAAAxnK,OAAAp+F,KAAA4lQ,UAAAxnK,SAGAp+F,KAAAuuY,OAAA,WACAvuY,KAAA64E,KAAA,gBA7BAhO,WAAA8pU,EAAA,SAgCAA,IAGA99e,eACAmpG,KAAAowY,MAAApwY,KAAAwvY,UAAAxvY,KAAAwvY,SAAAkC,eAAAtD,GAGApuY,KAAAozY,8BAGAv8e,0BACAmpG,KAAA4oF,YAEA,WAAA5oF,KAAAqwY,IAAAqF,gBAAA11Y,KAAA+vY,eACA/vY,KAAA0vY,gBAAA,EAGA1vY,KAAAuuY,OAAA,wBAAAvuY,KAAA6vY,wBACA7vY,KAAA6vY,uBAAAz7e,SAAAo+e,IACAxyY,KAAAqwY,IAAAuC,YAAAJ,GACAxyY,KAAA4vY,oBAAA,KAEA5vY,KAAA6vY,uBAAA,GAEA7vY,KAAA4vY,qBACA5vY,KAAAuuY,OAAA,8BACAvuY,KAAA4vY,oBAAA,EACA5vY,KAAAsxY,qBAGAtxY,KAAAuuY,OAAA,aACAvuY,KAAA64E,KAAA,cAEA74E,KAAA+vY,cAAA,EAEA/vY,KAAAuuY,OAAA,0BAAAvuY,KAAAqwY,IAAAqF,gBACA11Y,KAAA64E,KAAA,uBAAA74E,KAAAqwY,IAAAqF,iBAGA7+e,gBAAAqyE,GACA82B,KAAA4oF,YACA1/G,EAAAyhM,WAAA3qK,KAAAkrS,QACAlrS,KAAA64E,KAAA,SAAA,CACA8xF,UAAA,CACAA,UAAAzhM,EAAAyhM,UAAAA,UACAgrO,cAAAzsa,EAAAyhM,UAAAgrO,cACAC,OAAA1sa,EAAAyhM,UAAAirO,UAGA1sa,EAAAyhM,WAAA3qK,KAAAsvY,eACAtvY,KAAAsvY,cAAA,EACAtvY,KAAA64E,KAAA,iBAGA3vG,EAAAyhM,WACA3qK,KAAA61Y,4BAIAh/e,kBAAAqyE,GACA,IAAA82B,KAAA4oF,UAAA,CACA,IAAAl8B,EAAAxjF,EAAAwjF,KACAA,aAAAuxE,cAAAvxE,EAAA,IAAA+rE,WAAA/rE,IACA1sD,KAAAl1B,KAAA4hF,IAGA71J,8BACA,IAAAmpG,KAAA4oF,WAAA5oF,KAAAowY,IAAA,CACApwY,KAAAuuY,OAAA,yCAAAvuY,KAAAwvY,SAAAkC,gBACA,IAAArxV,EAAArgD,KAAAowY,IACApwY,KAAAowY,IAAA,KACA/vV,EAAA,OAGAxpJ,iBACAmpG,KAAAgvY,YAAAhvY,KAAA4oF,YACA5oF,KAAAuuY,OAAA,mBACAvuY,KAAAqvY,eAAA,EACArvY,KAAAq0Y,eAGAx9e,kBACAmpG,KAAA4oF,YACA5oF,KAAAuuY,OAAA,oBACAvuY,KAAAstG,WAGAz2M,SAAAqyE,GACA82B,KAAA4oF,WAEA1/G,EAAA8sQ,QAAA5hV,SAAA0hf,IACA91Y,KAAAuuY,OAAA,YACAvuY,KAAA64E,KAAA,QAAA3vG,EAAA2yH,MAAAi6S,GAEA91Y,KAAAiwY,cAAAnla,KAAA,CACA+wH,MAAA3yH,EAAA2yH,MACA20B,OAAAslR,IAGA91Y,KAAAkwY,eAAAtpa,MAAAmva,GACAA,EAAA9xZ,KAAA6xZ,EAAA7xZ,OAGA+b,KAAAkwY,eAAApla,KAAAgra,GACAt4J,GAAA,KACAx9O,KAAA64E,KAAA,SAAAi9T,UAKAj/e,SACA,IAAAu/E,EAAA,GAAAhR,MAAAw4B,KAAAvnB,WACAD,EAAA,GAAA,IAAA4pB,KAAAuhG,IAAA,KAAAnrH,EAAA,GACA6tP,EAAA7gI,MAAA,KAAAhtH,IAIAm+X,EAAAyhC,iBAAA9H,IAOA35B,EAAAh6X,OAAA,CACA07Z,WAAA,CACA,CACAC,KAAA,CACA,+BACA,sCAIAC,aAAA,gBAGA5hC,EAAAk6B,cAAA,GAEAp7e,EAAAC,QAAAihd,kKC39BAlhd,EAAAC,QAAA,WACA,GAAA,oBAAA+rG,WAAA,OAAA,KACA,IAAA4tY,EAAA,CACAmJ,kBAAA/2Y,WAAA+2Y,mBAAA/2Y,WAAAg3Y,sBACAh3Y,WAAAi3Y,wBACAC,sBAAAl3Y,WAAAk3Y,uBACAl3Y,WAAAm3Y,0BAAAn3Y,WAAAo3Y,4BACAtE,gBAAA9yY,WAAA8yY,iBAAA9yY,WAAAq3Y,oBACAr3Y,WAAAs3Y,uBAEA,OAAA1J,EAAAmJ,kBACAnJ,EADA,oCCZA,aAEA,SAAAxvY,EAAAoB,EAAAl4B,GACA,IAAA,MAAA3xE,KAAA2xE,EACAnzE,OAAAC,eAAAorG,EAAA7pG,EAAA,CACAtB,MAAAizE,EAAA3xE,GACA+pG,YAAA,EACAD,cAAA,IAIA,OAAAD,EAmCAxrG,EAAAC,QAhCA,SAAAmmG,EAAApkG,EAAAsxE,GACA,IAAA8yB,GAAA,iBAAAA,EACA,MAAA,IAAAsL,UAAA,oCAGAp+B,IACAA,EAAA,IAGA,iBAAAtxE,IACAsxE,EAAAtxE,EACAA,OAAAK,GAGA,MAAAL,IACAsxE,EAAAtxE,KAAAA,GAGA,IACA,OAAAooG,EAAAhE,EAAA9yB,GACA,MAAAwU,GACAxU,EAAAgT,QAAA8f,EAAA9f,QACAhT,EAAA6wC,MAAA/d,EAAA+d,MAEA,MAAA0nK,EAAA,aAIA,OAFAA,EAAAvhL,UAAAnqG,OAAAU,OAAAV,OAAAywM,eAAAxqG,IAEAgE,EAAA,IAAAyhL,EAAAv4M,mCC1CA,aAEAtzE,EAAAC,QAAA,CACAsjf,mBAAA,oBAAAt3Y,MAAA,eAAAA,KACAu3Y,eAAA,sBAAAx3Y,YACA,oBAAAumE,gBAAA,IAAAA,UAAAkxU,cAAA,iBAAAlxU,UAAAkxU,aACApK,2BAAA,sBAAArtY,0CCNA,aAGA/rG,EAAAkse,SAAA,IACAlse,EAAAmse,aAAA,IAGAnse,EAAA6re,cAAA,kCCPA,aAEA,MAAA95O,EAAA9xP,EAAA,UACA0wU,EAAA1wU,EAAA,SACA84N,EAAA43G,EAAA,+BACA53G,EAAA98I,MAAA00P,EAAA,qCAEA,MAAAnnB,EAAAvpT,EAAA,YACA4oS,EAAA5oS,EAAA,yBACAk5e,EAAAl5e,EAAA,sBACA0pe,EAAA1pe,EAAA,WAEAk/c,EAAAl/c,EAAA,qBACAs5e,YAAAA,GAAAt5e,EAAA,YACAise,SAAAA,GAAAjse,EAAA,eAEAu5e,EAAA,CACAC,WAAA,CAAA,aACAC,wBAAA,EACAr6e,KAAA,oBAGAU,EAAAC,QAAA,EAAAiqK,QAAAA,EAAAgkP,SAAAA,GAAAx/F,EAAAptT,EAAA,MACA,MAAAm4M,EAAA,IAAAu4C,EACA,IAAA0xP,EACAC,EAgKA,OA9JAlqS,EAAAmqS,cAAA,GACAnqS,EAAAoqS,aAAA,IAAAl0Z,IACA8pH,EAAAqqS,iBAAA,IAAAn0Z,IACA8pH,EAAAM,OAAAk2L,IAEA,GAAAyzG,EACA,MAAAj6L,EAAA,IAAAhkN,MAAA,2BAAA,yBAGA,MAAA4sS,EAAAu3F,IAKA,IAAA4Q,EAFAkJ,EAAAzzG,EAIAuqG,GADAvqG,EAAAjmF,aAAA5uO,SAAA+wZ,IAAAj+E,EAAA6gD,UACA9+D,EAAA+wE,YAAA,QAAA9yD,EAAA6gD,UAAAvpO,iBAEAyqK,EAGAx2L,EAAA9+H,GAAA,SAAA,IAAA03T,EAAAnmM,WAEAy3S,EAAAnK,EAAAvpG,GAEAj3K,EAAA,oCAAA2qR,GACAlqS,EAAAqvF,GAAAA,EAAA6gM,QAAAga,EAAAlK,GA4GA,OAxBAhgS,EAAAqvF,GAAAv1E,KAAA,iBAAAntH,GAAAisS,EAAAnmM,OAAA9lG,KACAqzG,EAAAqvF,GAAAv1E,KAAA,SAAAntH,IACAqzG,EAAAj0B,KAAA,QAAAp/E,GACAqzG,EAAAj0B,KAAA,YAGAi0B,EAAAqvF,GAAAnuN,GAAA,gBAxFA+/Z,IACA,GAAAA,EAAAC,QAAAD,EAAAt0Y,MAAAs0Y,EAAAR,SACA,OAGA,MAAAA,EAAAQ,EAAAR,SACA,IAAA6J,EAAAtqS,EAAAqqS,iBAAA31Z,IAAA+rZ,GACA6J,IACAA,EAAA,GACAtqS,EAAAqqS,iBAAA11Z,IAAA8rZ,EAAA6J,IAGA,IAAA1J,EAAA5gS,EAAAoqS,aAAA11Z,IAAA+rZ,GACA,GAAAG,EAEA,YADAA,EAAA79Q,OAAAk+Q,EAAAl+Q,QAEA,GAAA,UAAAk+Q,EAAAl+Q,OAAA/oJ,KAEA,YADAswa,EAAAtsa,KAAAija,GAIA,MAAAV,EAAA,CACAniG,SAAA,KACAv2Y,GAIAotT,EAAAkrL,OAAAI,EAAAJ,KAAAlrL,EAAAkrL,MAEAS,EAAA,IAAAjB,EAAAY,GAEA,MAAA53e,EAAAgkG,IACA4yH,EAAA98I,MAAA,gCAAAkqB,IAGAi0Y,EAAA1/Z,GAAA,QAAAv4E,GACAi4e,EAAA9mR,KAAA,SAAA,IAAAxwI,KACAs3Z,EAAAl4Q,eAAA,QAAA//N,MAGAi4e,EAAA1/Z,GAAA,UAAA6hJ,IACAk+Q,EAAAl+Q,OAAAA,EACAk+Q,EAAAC,QAAA,EACAlhS,EAAAqvF,GAAAtjH,KAAA,eAAAk1T,MAGAL,EAAA79Q,OAAAk+Q,EAAAl+Q,QACA,IAAA,MAAAwnR,KAAAD,EACA1J,EAAA79Q,OAAAwnR,EAAAxnR,QAEA/iB,EAAAqqS,iBAAA11Z,IAAA8rZ,EAAA,IAEAG,EAAA9mR,KAAA,WAAAtzE,UACA,MAAAqgU,EAAAlB,EAAAi7B,GAGA,IAAAnjD,EAFAl+N,EAAA,4BAAAsnP,EAAAza,YAGA,IACA3O,QAAAhpC,EAAAqyD,eAAAD,GACA,MAAAl6W,GAEA,OADA4yH,EAAA98I,MAAA,uCAAAkqB,GACAk6W,EAAA3zX,QAGA,IAAAuqW,EAAA2O,WACA,IACA3O,EAAA2O,WAAA51D,EAAAipG,gBAAA/M,GAAAnrB,YAAA,QAAA9pB,EAAAL,WAAArxN,iBACA,MAAAp/H,GACA4yH,EAAA98I,MAAA,qCAAAkqB,GAIA4yH,EAAA,iCAAAsnP,EAAAza,YA6DA,SAAApsP,EAAA6mQ,EAAA45B,GACAzgS,EAAAmqS,cAAAnsa,KAAA6oY,GAEA,MAAA2jC,EAAA,KACAxqS,EAAAmqS,cAAAnqS,EAAAmqS,cAAAlpa,QAAAtB,GAAAA,IAAAknY,IACA7mQ,EAAAoqS,aAAAzzZ,OAAA8pZ,GACAzgS,EAAAqqS,iBAAA1zZ,OAAA8pZ,IAGA55B,EAAAppB,KAAA3jO,KAAA,QAAA0wR,GApEAC,CAAAzqS,EAAA6mQ,EAAA45B,GAEAzgS,EAAAj0B,KAAA,aAAA0xQ,GACAhtR,EAAAgtR,MAEAz9O,EAAAoqS,aAAAz1Z,IAAA8rZ,EAAAG,MAUA5gS,EAAAqvF,GAAAnuN,GAAA,UAAA+zO,EAAAorL,iBAEArgS,EAAAqvF,GAAAnuN,GAAA,WAAA,KACA8+H,EAAAqvF,GAAAtjH,KAAA,UAAAg1T,EAAAzvY,eAGA0uG,EAAAqvF,GAAAv1E,KAAA,WAAA,KACA9Z,EAAAj0B,KAAA,aACA6sN,EAAA1/N,aAIA+7I,EAAAmrL,cAAAzrZ,IAAAu1Z,EAAA,CACAlqS,SAAAA,EACA+gS,eAAAA,IAGAnoG,EAAArwL,SAGAvI,EAAA9sH,MAAAszD,UAEA,MAAAsxC,EAAAm9H,EAAAmrL,cAAA1rZ,IAAAw1Z,GACApyT,GAAAA,EAAAkoB,SAAAqvF,KACAv3G,EAAAkoB,SAAAqvF,GAAAtjH,KAAA,YACA+L,EAAAkoB,SAAAqvF,GAAAn8M,eAGA+lF,QAAA2gD,IAAA5Z,EAAAmqS,cAAA7sa,KAAAupY,GAAAA,EAAA3zX,WACA8sH,EAAAj0B,KAAA,SACAi0B,EAAA2oB,qBAGAshR,OAAArhf,EACAqsT,EAAAmrL,cAAAzpZ,OAAAuzZ,IAGAlqS,EAAAq3P,SAAA,IACA,CAAA4yC,GAGAjqS,kOCzLA,aACAt5M,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAkkf,OAAAlkf,EAAA6oS,GAAA7oS,EAAAmkf,QAAAnkf,EAAAi4M,cAAA,EACA,MAAAmsS,EAAAnkf,EAAA,SACAokf,EAAApkf,EAAA,aACAqkf,EAAArkf,EAAA,YACAC,OAAAC,eAAAH,EAAA,SAAA,CAAAyrG,YAAA,EAAAvd,IAAA,WAAA,OAAAo2Z,EAAAJ,UACA,MAAAvzK,EAAA1wU,EAAA,QAAAA,CAAA,oBAIAF,EAAAC,QAAAA,EAAAkjU,EAIA,MAAAxyO,EAAA1wF,EAAAukf,SAAA,GACA,SAAArhL,EAAAktF,EAAA3iP,GACA,iBAAA2iP,IACA3iP,EAAA2iP,EACAA,OAAAhuZ,GAEAqrK,EAAAA,GAAA,GACA,MAAAr5D,EAAAgwY,EAAA9xY,IAAA89S,EAAA3iP,EAAApuK,MACAoiF,EAAA2yB,EAAA3yB,OACAkP,EAAAyjB,EAAAzjB,GACAtxF,EAAA+0G,EAAA/0G,KACAmlf,EAAA9zZ,EAAAC,IAAAtxF,KAAAqxF,EAAAC,GAAA,KAKA,IAAAk4M,EAeA,OAnBAp7H,EAAAg3U,UACAh3U,EAAA,0BACA,IAAAA,EAAAi3U,WACAF,GAGA7zK,EAAA,+BAAAlvP,GACAonN,EAAA,IAAAw7M,EAAAF,QAAA1ia,EAAAgsF,KAGA/8E,EAAAC,KACAggP,EAAA,yBAAAlvP,GACAiP,EAAAC,GAAA,IAAA0zZ,EAAAF,QAAA1ia,EAAAgsF,IAEAo7H,EAAAn4M,EAAAC,IAEAyjB,EAAAghG,QAAA3nC,EAAA2nC,QACA3nC,EAAA2nC,MAAAhhG,EAAAuwY,UAEA97M,EAAA+gM,OAAAx1X,EAAA/0G,KAAAouK,GAEAztK,EAAA6oS,GAAAq6B,EAMA,IAAA0hL,EAAA3kf,EAAA,oBACAC,OAAAC,eAAAH,EAAA,WAAA,CAAAyrG,YAAA,EAAAvd,IAAA,WAAA,OAAA02Z,EAAA3sS,YAOAj4M,EAAA0pe,QAAAxmK,EAMA,IAAA2hL,EAAA5kf,EAAA,aACAC,OAAAC,eAAAH,EAAA,UAAA,CAAAyrG,YAAA,EAAAvd,IAAA,WAAA,OAAA22Z,EAAAV,sICrEA,aACAjkf,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAsyG,SAAA,EACA,MAAAwyY,EAAA7kf,EAAA,YACA0wU,EAAA1wU,EAAA,QAAAA,CAAA,wBA6DAD,EAAAsyG,IAnDA,SAAA89S,EAAA/wZ,EAAA,GAAA20E,GACA,IAAAu3B,EAAA6kT,EAEAp8U,EAAAA,GAAA,oBAAAkhI,UAAAA,SACA,MAAAk7M,IACAA,EAAAp8U,EAAAikI,SAAA,KAAAjkI,EAAAk+B,MAEA,iBAAAk+S,IACA,MAAAA,EAAAnrT,OAAA,KAEAmrT,EADA,MAAAA,EAAAnrT,OAAA,GACAjxB,EAAAikI,SAAAm4M,EAGAp8U,EAAAk+B,KAAAk+S,GAGA,sBAAAj+U,KAAAi+U,KACAz/E,EAAA,uBAAAy/E,GAEAA,OADA,IAAAp8U,EACAA,EAAAikI,SAAA,KAAAm4M,EAGA,WAAAA,GAIAz/E,EAAA,WAAAy/E,GACA7kT,EAAAu5Y,EAAA10F,IAGA7kT,EAAA4G,OACA,cAAAhgC,KAAAo5B,EAAA0sG,UACA1sG,EAAA4G,KAAA,KAEA,eAAAhgC,KAAAo5B,EAAA0sG,YACA1sG,EAAA4G,KAAA,QAGA5G,EAAAlsG,KAAAksG,EAAAlsG,MAAA,IACA,MACA6yG,GADA,IAAA3G,EAAA2G,KAAAh6B,QAAA,KACA,IAAAqzB,EAAA2G,KAAA,IAAA3G,EAAA2G,KASA,OAPA3G,EAAA5a,GAAA4a,EAAA0sG,SAAA,MAAA/lG,EAAA,IAAA3G,EAAA4G,KAAA9yG,EAEAksG,EAAAy3G,KACAz3G,EAAA0sG,SACA,MACA/lG,GACAl+B,GAAAA,EAAAm+B,OAAA5G,EAAA4G,KAAA,GAAA,IAAA5G,EAAA4G,MACA5G,+DCxDA,IAAA2wG,EAAA,0OAEAvpG,EAAA,CACA,SAAA,WAAA,YAAA,WAAA,OAAA,WAAA,OAAA,OAAA,WAAA,OAAA,YAAA,OAAA,QAAA,UAGA5yG,EAAAC,QAAA,SAAAkiG,GACA,IAAAyG,EAAAzG,EACAlc,EAAAkc,EAAAhqB,QAAA,KACAz3E,EAAAyhG,EAAAhqB,QAAA,MAEA,GAAA8N,IAAA,GAAAvlF,IACAyhG,EAAAA,EAAAsG,UAAA,EAAAxiB,GAAAkc,EAAAsG,UAAAxiB,EAAAvlF,GAAAmlF,QAAA,KAAA,KAAAsc,EAAAsG,UAAA/nG,EAAAyhG,EAAAvwB,SAOA,IAJA,IAmCAyjI,EACAh8C,EApCAxtE,EAAAswH,EAAAlqI,KAAAkwB,GAAA,IACAkuT,EAAA,GACAv8U,EAAA,GAEAA,KACAu8U,EAAAz9S,EAAA9+B,IAAA+X,EAAA/X,IAAA,GAaA,OAVA,GAAAmS,IAAA,GAAAvlF,IACA2vZ,EAAA3uU,OAAAknB,EACAynT,EAAAl+S,KAAAk+S,EAAAl+S,KAAA1J,UAAA,EAAA4nT,EAAAl+S,KAAAvgC,OAAA,GAAAiU,QAAA,KAAA,KACAwqU,EAAA20F,UAAA30F,EAAA20F,UAAAn/Z,QAAA,IAAA,IAAAA,QAAA,IAAA,IAAAA,QAAA,KAAA,KACAwqU,EAAA40F,SAAA,GAGA50F,EAAA60F,UAMA,SAAA15Y,EAAAlsG,GACA,IAAA6lf,EAAA,WACA70Y,EAAAhxG,EAAAumF,QAAAs/Z,EAAA,KAAA14Z,MAAA,KAEA,KAAAntF,EAAAkzE,OAAA,EAAA,IAAA,IAAAlzE,EAAAsyE,QACA0+B,EAAAl5B,OAAA,EAAA,GAEA,KAAA93E,EAAAkzE,OAAAlzE,EAAAsyE,OAAA,EAAA,IACA0+B,EAAAl5B,OAAAk5B,EAAA1+B,OAAA,EAAA,GAGA,OAAA0+B,EAjBA40Y,CAAA70F,EAAAA,EAAA,MACAA,EAAAu0F,UAmBAvvS,EAnBAg7M,EAAA,MAoBAh3P,EAAA,GAEAg8C,EAAAxvH,QAAA,6BAAA,SAAAu/Z,EAAA/tO,EAAAguO,GACAhuO,IACAh+G,EAAAg+G,GAAAguO,MAIAhsV,GA1BAg3P,iCCxCA,aACAlwZ,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAmkf,aAAA,EACA,MAAAkB,EAAAplf,EAAA,oBACAqkf,EAAArkf,EAAA,YACAqlf,EAAArlf,EAAA,qBACA67E,EAAA77E,EAAA,oBACAslf,EAAAtlf,EAAA,QACAulf,EAAAvlf,EAAA,UACA0wU,EAAA1wU,EAAA,QAAAA,CAAA,4BAuWAD,EAAAmkf,QAtWA,cAAAmB,EACA/hf,YAAA6sZ,EAAA3iP,GACAx7C,QACAvlB,KAAA+4Y,KAAA,GACA/4Y,KAAAigS,KAAA,GACAyjB,GAAA,iBAAAA,IACA3iP,EAAA2iP,EACAA,OAAAhuZ,IAEAqrK,EAAAA,GAAA,IACApuK,KAAAouK,EAAApuK,MAAA,aACAqtG,KAAA+gE,KAAAA,EACA/gE,KAAAg5Y,cAAA,IAAAj4U,EAAAi4U,cACAh5Y,KAAAi5Y,qBAAAl4U,EAAAk4U,sBAAA5sY,EAAAA,GACArM,KAAAk5Y,kBAAAn4U,EAAAm4U,mBAAA,KACAl5Y,KAAAm5Y,qBAAAp4U,EAAAo4U,sBAAA,KACAn5Y,KAAAo5Y,oBAAAr4U,EAAAq4U,qBAAA,IACAp5Y,KAAA8hV,QAAA,IAAAg3D,EAAA,CACA7+Y,IAAA+F,KAAAk5Y,oBACAvza,IAAAq6B,KAAAm5Y,uBACAE,OAAAr5Y,KAAAo5Y,wBAEAp5Y,KAAA8qE,QAAA,MAAA/J,EAAA+J,QAAA,IAAA/J,EAAA+J,SACA9qE,KAAAs5Y,YAAA,SACAt5Y,KAAA0jT,IAAAA,EACA,MAAA61F,EAAAx4U,EAAA3xF,QAAAA,EACA4wB,KAAA+pQ,QAAA,IAAAwvI,EAAAttI,QACAjsQ,KAAAqwH,QAAA,IAAAkpR,EAAA1tI,QACA7rQ,KAAAw5Y,cAAA,IAAAz4U,EAAA04U,YACAz5Y,KAAAw5Y,cACAx5Y,KAAAjgB,OAEAlpF,aAAAiuK,GACA,OAAAzuF,UAAApR,QAEA+6B,KAAA05Y,gBAAA50U,EACA9kE,MAFAA,KAAA05Y,cAIA7if,qBAAAiuK,GACA,YAAApvK,IAAAovK,EACA9kE,KAAA25Y,uBACA35Y,KAAA25Y,sBAAA70U,EACA9kE,MAEAnpG,kBAAAiuK,GACA,IAAAu9J,EACA,YAAA3sU,IAAAovK,EACA9kE,KAAA45Y,oBACA55Y,KAAA45Y,mBAAA90U,EACA,QAAAu9J,EAAAriO,KAAA8hV,eAAA,IAAAz/G,GAAAA,EAAAw3K,OAAA/0U,GACA9kE,MAEAnpG,oBAAAiuK,GACA,IAAAu9J,EACA,YAAA3sU,IAAAovK,EACA9kE,KAAA85Y,sBACA95Y,KAAA85Y,qBAAAh1U,EACA,QAAAu9J,EAAAriO,KAAA8hV,eAAA,IAAAz/G,GAAAA,EAAA03K,UAAAj1U,GACA9kE,MAEAnpG,qBAAAiuK,GACA,IAAAu9J,EACA,YAAA3sU,IAAAovK,EACA9kE,KAAAg6Y,uBACAh6Y,KAAAg6Y,sBAAAl1U,EACA,QAAAu9J,EAAAriO,KAAA8hV,eAAA,IAAAz/G,GAAAA,EAAA43K,OAAAn1U,GACA9kE,MAEAnpG,QAAAiuK,GACA,OAAAzuF,UAAApR,QAEA+6B,KAAA+lQ,SAAAjhM,EACA9kE,MAFAA,KAAA+lQ,SAUAlvW,wBAEAmpG,KAAAk6Y,eACAl6Y,KAAA05Y,eACA,IAAA15Y,KAAA8hV,QAAAw6C,UAEAt8X,KAAAm6Y,YAUAtjf,KAAA+tF,GAEA,GADAq/O,EAAA,gBAAAjkO,KAAAs5Y,cACAt5Y,KAAAs5Y,YAAA9ta,QAAA,QACA,OAAAw0B,KACAikO,EAAA,aAAAjkO,KAAA0jT,KACA1jT,KAAAo6Y,OAAAzB,EAAA34Y,KAAA0jT,IAAA1jT,KAAA+gE,MACA,MAAAm8T,EAAAl9X,KAAAo6Y,OACA96Y,EAAAU,KACAA,KAAAs5Y,YAAA,UACAt5Y,KAAAq6Y,eAAA,EAEA,MAAAC,EAAAzB,EAAA7qa,GAAAkvZ,EAAA,QAAA,WACA59X,EAAA0zY,SACApuZ,GAAAA,OAGA21Z,EAAA1B,EAAA7qa,GAAAkvZ,EAAA,SAAAzjY,IACAwqO,EAAA,SACA3kO,EAAAuhF,UACAvhF,EAAAg6Y,YAAA,SACA/zX,MAAAszD,KAAA,QAAAp/E,GACA7U,EACAA,EAAA6U,GAIA6F,EAAAk7Y,0BAGA,IAAA,IAAAx6Y,KAAA+lQ,SAAA,CACA,MAAAj7L,EAAA9qE,KAAA+lQ,SACA9hC,EAAA,wCAAAn5J,GACA,IAAAA,GACAwvU,IAGA,MAAAvyI,EAAAl9L,YAAA,KACAo5J,EAAA,qCAAAn5J,GACAwvU,IACApd,EAAAl9Y,QACAk9Y,EAAArkT,KAAA,QAAA,IAAA//E,MAAA,cACAgyE,GACA9qE,KAAAigS,KAAAn1T,MAAA,WACAmlJ,aAAA83I,MAKA,OAFA/nQ,KAAAigS,KAAAn1T,KAAAwva,GACAt6Y,KAAAigS,KAAAn1T,KAAAyva,GACAv6Y,KAQAnpG,QAAA+tF,GACA,OAAAob,KAAAjgB,KAAA6E,GAOA/tF,SACAotU,EAAA,QAEAjkO,KAAA6gF,UAEA7gF,KAAAs5Y,YAAA,OACA/zX,MAAAszD,KAAA,QAEA,MAAAqkT,EAAAl9X,KAAAo6Y,OACAp6Y,KAAAigS,KAAAn1T,KAAA+ta,EAAA7qa,GAAAkvZ,EAAA,OAAAl9X,KAAAy6Y,OAAA9hZ,KAAAqH,OAAA64Y,EAAA7qa,GAAAkvZ,EAAA,OAAAl9X,KAAAspO,OAAA3wO,KAAAqH,OAAA64Y,EAAA7qa,GAAAkvZ,EAAA,QAAAl9X,KAAAwyH,QAAA75H,KAAAqH,OAAA64Y,EAAA7qa,GAAAkvZ,EAAA,QAAAl9X,KAAAmpO,QAAAxwO,KAAAqH,OAAA64Y,EAAA7qa,GAAAgyB,KAAAqwH,QAAA,UAAArwH,KAAA06Y,UAAA/hZ,KAAAqH,QAOAnpG,SACA0uH,MAAAszD,KAAA,QAOAhiL,OAAA61J,GACA1sD,KAAAqwH,QAAArxI,IAAA0tE,GAOA71J,UAAA8jf,GACAp1X,MAAAszD,KAAA,SAAA8hU,GAOA9jf,QAAA4iG,GACAwqO,EAAA,QAAAxqO,GACA8rB,MAAAszD,KAAA,QAAAp/E,GAQA5iG,OAAA+jf,EAAA75U,GACA,IAAAm8T,EAAAl9X,KAAA+4Y,KAAA6B,GAKA,OAJA1d,IACAA,EAAA,IAAA0a,EAAAJ,OAAAx3Y,KAAA46Y,EAAA75U,GACA/gE,KAAA+4Y,KAAA6B,GAAA1d,GAEAA,EAQArme,SAAAqme,GACA,MAAA6b,EAAAvlf,OAAAW,KAAA6rG,KAAA+4Y,MACA,IAAA,MAAA6B,KAAA7B,EAAA,CAEA,GADA/4Y,KAAA+4Y,KAAA6B,GACAhiU,OAEA,YADAqrJ,EAAA,4CAAA22K,GAIA56Y,KAAA0xU,SAQA76a,QAAA8jf,GACA12K,EAAA,oBAAA02K,GACA,MAAAE,EAAA76Y,KAAA+pQ,QAAAzmQ,OAAAq3Y,GACA,IAAA,IAAAxza,EAAA,EAAAA,EAAA0za,EAAA51a,OAAAkC,IACA64B,KAAAo6Y,OAAAz1P,MAAAk2P,EAAA1za,GAAAwza,EAAAhmf,SAQAkC,UACAotU,EAAA,WACAjkO,KAAAigS,KAAA7rY,SAAA0mf,GAAAA,MACA96Y,KAAAigS,KAAAh7T,OAAA,EACA+6B,KAAAqwH,QAAA/iB,UAOAz2M,SACAotU,EAAA,cACAjkO,KAAAq6Y,eAAA,EACAr6Y,KAAAk6Y,eAAA,EACA,YAAAl6Y,KAAAs5Y,aAGAt5Y,KAAA6gF,UAEA7gF,KAAA8hV,QAAA77Q,QACAjmE,KAAAs5Y,YAAA,SACAt5Y,KAAAo6Y,QACAp6Y,KAAAo6Y,OAAAp6Z,QAOAnpF,aACA,OAAAmpG,KAAA0xU,SAOA76a,QAAA++S,GACAquB,EAAA,WACAjkO,KAAA6gF,UACA7gF,KAAA8hV,QAAA77Q,QACAjmE,KAAAs5Y,YAAA,SACA/zX,MAAAszD,KAAA,QAAA+8H,GACA51M,KAAA05Y,gBAAA15Y,KAAAq6Y,eACAr6Y,KAAAm6Y,YAQAtjf,YACA,GAAAmpG,KAAAk6Y,eAAAl6Y,KAAAq6Y,cACA,OAAAr6Y,KACA,MAAAV,EAAAU,KACA,GAAAA,KAAA8hV,QAAAw6C,UAAAt8X,KAAA25Y,sBACA11K,EAAA,oBACAjkO,KAAA8hV,QAAA77Q,QACA1gD,MAAAszD,KAAA,oBACA74E,KAAAk6Y,eAAA,MAEA,CACA,MAAAn7S,EAAA/+F,KAAA8hV,QAAA/5Q,WACAk8J,EAAA,0CAAAllI,GACA/+F,KAAAk6Y,eAAA,EACA,MAAAnyI,EAAAl9L,YAAA,KACAvrE,EAAA+6Y,gBAEAp2K,EAAA,wBACA1+M,MAAAszD,KAAA,oBAAAv5E,EAAAwiV,QAAAw6C,UAEAh9X,EAAA+6Y,eAEA/6Y,EAAAvf,MAAA0Z,IACAA,GACAwqO,EAAA,2BACA3kO,EAAA46Y,eAAA,EACA56Y,EAAA66Y,YACA50X,MAAAszD,KAAA,kBAAAp/E,KAGAwqO,EAAA,qBACA3kO,EAAAy7Y,qBAGAh8S,GACA/+F,KAAAigS,KAAAn1T,MAAA,WACAmlJ,aAAA83I,OASAlxW,cACA,MAAAgke,EAAA76X,KAAA8hV,QAAAw6C,SACAt8X,KAAAk6Y,eAAA,EACAl6Y,KAAA8hV,QAAA77Q,QACA1gD,MAAAszD,KAAA,YAAAgiT,mLC7WA,MAAA2c,EAAAjkf,EAAA,YAEAF,EAAAC,QAAA,CAAAowZ,EAAA3iP,IAAA,IAAAy2U,EAAA9zF,EAAA3iP,GAOA1tK,EAAAC,QAAAkkf,OAAAA,EACAnkf,EAAAC,QAAAi4M,SAAAisS,EAAAjsS,SACAl4M,EAAAC,QAAAuvc,UAAAtvc,EAAA,eACAF,EAAAC,QAAAy5e,WAAAx5e,EAAA,sBACAF,EAAAC,QAAA87E,OAAA77E,EAAA,kJCbA,MAAAw5e,EAAAx5e,EAAA,sBACAqlf,EAAArlf,EAAA,qBACA0wU,EAAA1wU,EAAA,QAAAA,CAAA,2BACA67E,EAAA77E,EAAA,oBACA6kf,EAAA7kf,EAAA,YACAynf,EAAAznf,EAAA,WAEA,MAAAikf,UAAAoB,EAQA/hf,YAAA6sZ,EAAA3iP,EAAA,IACAx7C,QAEAm+R,GAAA,iBAAAA,IACA3iP,EAAA2iP,EACAA,EAAA,MAGAA,GACAA,EAAA00F,EAAA10F,GACA3iP,EAAAq2D,SAAAssL,EAAAl+S,KACAu7D,EAAAk6U,OAAA,UAAAv3F,EAAAn4M,UAAA,QAAAm4M,EAAAn4M,SACAxqC,EAAAt7D,KAAAi+S,EAAAj+S,KACAi+S,EAAAh7M,QAAA3nC,EAAA2nC,MAAAg7M,EAAAh7M,QACA3nC,EAAAv7D,OACAu7D,EAAAq2D,SAAAghR,EAAAr3U,EAAAv7D,MAAAA,MAGAxF,KAAAi7Y,OACA,MAAAl6U,EAAAk6U,OACAl6U,EAAAk6U,OACA,oBAAAzyS,UAAA,WAAAA,SAAA+C,SAEAxqC,EAAAq2D,WAAAr2D,EAAAt7D,OAEAs7D,EAAAt7D,KAAAzF,KAAAi7Y,OAAA,MAAA,MAGAj7Y,KAAAo3H,SACAr2D,EAAAq2D,WACA,oBAAA5uB,SAAAA,SAAA4uB,SAAA,aACAp3H,KAAAyF,KACAs7D,EAAAt7D,OACA,oBAAA+iG,UAAAA,SAAA/iG,KACA+iG,SAAA/iG,KACAzF,KAAAi7Y,OACA,IACA,IAEAj7Y,KAAA+sY,WAAAhsU,EAAAgsU,YAAA,CAAA,UAAA,aACA/sY,KAAA2mH,WAAA,GACA3mH,KAAAk7Y,YAAA,GACAl7Y,KAAAm7Y,cAAA,EAEAn7Y,KAAA+gE,KAAAvtK,OAAAiqG,OACA,CACA9qG,KAAA,aACAyof,OAAA,EACAC,iBAAA,EACA7yI,SAAA,EACA8yI,OAAA,EACAC,eAAA,IACAC,iBAAA,EACAC,oBAAA,EACAC,kBAAA,CACArkG,UAAA,MAEAyrD,iBAAA,IAEA/hS,GAGA/gE,KAAA+gE,KAAApuK,KAAAqtG,KAAA+gE,KAAApuK,KAAAumF,QAAA,MAAA,IAAA,IAEA,iBAAA8mB,KAAA+gE,KAAA2nC,QACA1oG,KAAA+gE,KAAA2nC,MAAAsyS,EAAA52Y,OAAApE,KAAA+gE,KAAA2nC,QAIA1oG,KAAA/b,GAAA,KACA+b,KAAA27Y,SAAA,KACA37Y,KAAA47Y,aAAA,KACA57Y,KAAA67Y,YAAA,KAGA77Y,KAAA87Y,iBAAA,KAEA,mBAAA51U,kBACAA,iBACA,gBACA,KACAlmE,KAAAo9M,YAEAp9M,KAAAo9M,UAAA3nF,qBACAz1H,KAAAo9M,UAAAp9N,YAGA,GAIAggB,KAAAjgB,OAUAlpF,gBAAAhE,GACAoxU,EAAA,0BAAApxU,GACA,MAAA61M,EAuiBA,SAAA7pG,GACA,MAAAqxE,EAAA,GACA,IAAA,IAAA/oG,KAAA03B,EACAA,EAAArE,eAAArzB,KACA+oG,EAAA/oG,GAAA03B,EAAA13B,IAGA,OAAA+oG,EA9iBA76C,CAAAr1B,KAAA+gE,KAAA2nC,OAGAA,EAAAqzS,IAAA3sa,EAAAm8H,SAGA7C,EAAA00G,UAAAvqT,EAGAmtG,KAAA/b,KAAAykH,EAAAszS,IAAAh8Y,KAAA/b,IAEA,MAAA88E,EAAAvtK,OAAAiqG,OACA,GACAuC,KAAA+gE,KAAA+hS,iBAAAjwc,GACAmtG,KAAA+gE,KACA,CACA2nC,MAAAA,EACAw0R,OAAAl9X,KACAo3H,SAAAp3H,KAAAo3H,SACA6jR,OAAAj7Y,KAAAi7Y,OACAx1Y,KAAAzF,KAAAyF,OAMA,OAFAw+N,EAAA,cAAAljK,GAEA,IAAAgsU,EAAAl6e,GAAAkuK,GAQAlqK,OACA,IAAAumT,EACA,GACAp9M,KAAA+gE,KAAAy6U,iBACAhE,EAAAyE,wBACA,IAAAj8Y,KAAA+sY,WAAAvha,QAAA,aAEA4xO,EAAA,gBACA,CAAA,GAAA,IAAAp9M,KAAA+sY,WAAA9na,OAAA,CAEA,MAAAq6B,EAAAU,KAIA,YAHA6qE,YAAA,WACAvrE,EAAAu5E,KAAA,QAAA,6BACA,GAGAukI,EAAAp9M,KAAA+sY,WAAA,GAEA/sY,KAAA2mH,WAAA,UAGA,IACAy2F,EAAAp9M,KAAAk8Y,gBAAA9+L,GACA,MAAArpT,GAIA,OAHAkwU,EAAA,qCAAAlwU,GACAisG,KAAA+sY,WAAApoY,aACA3E,KAAAjgB,OAIAq9N,EAAAr9N,OACAigB,KAAAm8Y,aAAA/+L,GAQAvmT,aAAAumT,GACA6mB,EAAA,uBAAA7mB,EAAAvqT,MACA,MAAAysG,EAAAU,KAEAA,KAAAo9M,YACA6mB,EAAA,iCAAAjkO,KAAAo9M,UAAAvqT,MACAmtG,KAAAo9M,UAAA3nF,sBAIAz1H,KAAAo9M,UAAAA,EAGAA,EACApvO,GAAA,SAAA,WACAsxB,EAAA88Y,aAEApua,GAAA,UAAA,SAAA2sa,GACAr7Y,EAAA+8Y,SAAA1B,MAEA3sa,GAAA,SAAA,SAAAj6E,GACAurG,EAAA7pG,QAAA1B,MAEAi6E,GAAA,SAAA,WACAsxB,EAAAg9Y,QAAA,sBAUAzlf,MAAAhE,GACAoxU,EAAA,yBAAApxU,GACA,IAAAuqT,EAAAp9M,KAAAk8Y,gBAAArpf,EAAA,CAAA0pf,MAAA,IACArvW,GAAA,EACA,MAAA5tC,EAAAU,KAIA,SAAAw8Y,IACA,GAAAl9Y,EAAAm9Y,mBAAA,CACA,MAAAC,GACA18Y,KAAA28Y,gBAAAr9Y,EAAA89M,UAAAu/L,eACAzvW,EAAAA,GAAAwvW,EAEAxvW,IAEA+2L,EAAA,8BAAApxU,GACAuqT,EAAAzqF,KAAA,CAAA,CAAA7rJ,KAAA,OAAA4lF,KAAA,WACA0wJ,EAAAx2F,KAAA,UAAA,SAAAn3I,GACA,IAAAy9D,EACA,GAAA,SAAAz9D,EAAA3I,MAAA,UAAA2I,EAAAi9E,KAAA,CAIA,GAHAu3K,EAAA,4BAAApxU,GACAysG,EAAAs9Y,WAAA,EACAt9Y,EAAAu5E,KAAA,YAAAukI,IACAA,EAAA,OACAo6L,EAAAyE,sBAAA,cAAA7+L,EAAAvqT,KAEAoxU,EAAA,iCAAA3kO,EAAA89M,UAAAvqT,MACAysG,EAAA89M,UAAAqsB,OAAA,WACAv8L,GACA,WAAA5tC,EAAAqnH,aACAs9G,EAAA,iDAEApjJ,IAEAvhF,EAAA68Y,aAAA/+L,GACAA,EAAAzqF,KAAA,CAAA,CAAA7rJ,KAAA,aACAw4B,EAAAu5E,KAAA,UAAAukI,GACAA,EAAA,KACA99M,EAAAs9Y,WAAA,EACAt9Y,EAAAohF,gBAEA,CACAujJ,EAAA,8BAAApxU,GACA,MAAA4mG,EAAA,IAAAX,MAAA,eACAW,EAAA2jN,UAAAA,EAAAvqT,KACAysG,EAAAu5E,KAAA,eAAAp/E,QAKA,SAAAojZ,IACA3vW,IAGAA,GAAA,EAEA2zC,IAEAu8H,EAAAp9N,QACAo9N,EAAA,MAIA,SAAA5qF,EAAA/4H,GACA,MAAAlqB,EAAA,IAAAupB,MAAA,gBAAAW,GACAlqB,EAAA6tO,UAAAA,EAAAvqT,KAEAgqf,IAEA54K,EAAA,mDAAApxU,EAAA4mG,GAEA6F,EAAAu5E,KAAA,eAAAtpG,GAGA,SAAAuta,IACAtqR,EAAA,oBAIA,SAAA22G,IACA32G,EAAA,iBAIA,SAAAuqR,EAAAvyT,GACA4yH,GAAA5yH,EAAA33L,OAAAuqT,EAAAvqT,OACAoxU,EAAA,6BAAAz5I,EAAA33L,KAAAuqT,EAAAvqT,MACAgqf,KAKA,SAAAh8T,IACAu8H,EAAA5nF,eAAA,OAAAgnR,GACAp/L,EAAA5nF,eAAA,QAAAhD,GACA4qF,EAAA5nF,eAAA,QAAAsnR,GACAx9Y,EAAAk2H,eAAA,QAAA2zG,GACA7pO,EAAAk2H,eAAA,YAAAunR,GA5FAvF,EAAAyE,uBAAA,EA+FA7+L,EAAAx2F,KAAA,OAAA41R,GACAp/L,EAAAx2F,KAAA,QAAA4L,GACA4qF,EAAAx2F,KAAA,QAAAk2R,GAEA98Y,KAAA4mH,KAAA,QAAAuiH,GACAnpO,KAAA4mH,KAAA,YAAAm2R,GAEA3/L,EAAAr9N,OAQAlpF,SASA,GARAotU,EAAA,eACAjkO,KAAA2mH,WAAA,OACA6wR,EAAAyE,sBAAA,cAAAj8Y,KAAAo9M,UAAAvqT,KACAmtG,KAAA64E,KAAA,QACA74E,KAAA0gF,QAKA,SAAA1gF,KAAA2mH,YACA3mH,KAAA+gE,KAAAynM,SACAxoQ,KAAAo9M,UAAAqsB,MACA,CACAxF,EAAA,2BACA,IAAA98P,EAAA,EACA,MAAA4hB,EAAAiX,KAAA27Y,SAAA12a,OACA,KAAAkC,EAAA4hB,EAAA5hB,IACA64B,KAAAu8Y,MAAAv8Y,KAAA27Y,SAAAx0a,KAUAtwE,SAAA8jf,GACA,GACA,YAAA36Y,KAAA2mH,YACA,SAAA3mH,KAAA2mH,YACA,YAAA3mH,KAAA2mH,WASA,OAPAs9G,EAAA,uCAAA02K,EAAA7za,KAAA6za,EAAAjuV,MAEA1sD,KAAA64E,KAAA,SAAA8hU,GAGA36Y,KAAA64E,KAAA,aAEA8hU,EAAA7za,MACA,IAAA,OACAk5B,KAAAg9Y,YAAAn1a,KAAAoH,MAAA0ra,EAAAjuV,OACA,MAEA,IAAA,OACA1sD,KAAAi9Y,mBACAj9Y,KAAAk9Y,WAAA,QACAl9Y,KAAA64E,KAAA,QACA,MAEA,IAAA,QACA,MAAAp/E,EAAA,IAAAX,MAAA,gBACAW,EAAApkG,KAAAslf,EAAAjuV,KACA1sD,KAAAvqG,QAAAgkG,GACA,MAEA,IAAA,UACAuG,KAAA64E,KAAA,OAAA8hU,EAAAjuV,MACA1sD,KAAA64E,KAAA,UAAA8hU,EAAAjuV,WAIAu3K,EAAA,8CAAAjkO,KAAA2mH,YAUA9vN,YAAA61J,GACA1sD,KAAA64E,KAAA,YAAAnsB,GACA1sD,KAAA/b,GAAAyoE,EAAAsvV,IACAh8Y,KAAAo9M,UAAA10G,MAAAszS,IAAAtvV,EAAAsvV,IACAh8Y,KAAA27Y,SAAA37Y,KAAAm9Y,eAAAzwV,EAAAivV,UACA37Y,KAAA47Y,aAAAlvV,EAAAkvV,aACA57Y,KAAA67Y,YAAAnvV,EAAAmvV,YACA77Y,KAAAi+X,SAEA,WAAAj+X,KAAA2mH,YACA3mH,KAAAi9Y,mBAQApmf,mBACAo5N,aAAAjwH,KAAA87Y,kBACA97Y,KAAA87Y,iBAAAjxU,YAAA,KACA7qE,KAAAs8Y,QAAA,kBACAt8Y,KAAA47Y,aAAA57Y,KAAA67Y,aAQAhlf,UACAmpG,KAAAk7Y,YAAAzwa,OAAA,EAAAu1B,KAAAm7Y,eAKAn7Y,KAAAm7Y,cAAA,EAEA,IAAAn7Y,KAAAk7Y,YAAAj2a,OACA+6B,KAAA64E,KAAA,SAEA74E,KAAA0gF,QASA7pL,QAEA,WAAAmpG,KAAA2mH,YACA3mH,KAAAo9M,UAAAjnF,WACAn2H,KAAA48Y,WACA58Y,KAAAk7Y,YAAAj2a,SAEAg/P,EAAA,gCAAAjkO,KAAAk7Y,YAAAj2a,QACA+6B,KAAAo9M,UAAAzqF,KAAA3yH,KAAAk7Y,aAGAl7Y,KAAAm7Y,cAAAn7Y,KAAAk7Y,YAAAj2a,OACA+6B,KAAA64E,KAAA,UAaAhiL,MAAA44E,EAAA96E,EAAAiwF,GAEA,OADAob,KAAAk9Y,WAAA,UAAAzta,EAAA96E,EAAAiwF,GACAob,KAGAnpG,KAAA44E,EAAA96E,EAAAiwF,GAEA,OADAob,KAAAk9Y,WAAA,UAAAzta,EAAA96E,EAAAiwF,GACAob,KAYAnpG,WAAAiwE,EAAA4lF,EAAA/3J,EAAAiwF,GAWA,GAVA,mBAAA8nE,IACA9nE,EAAA8nE,EACAA,OAAAh3J,GAGA,mBAAAf,IACAiwF,EAAAjwF,EACAA,EAAA,MAGA,YAAAqrG,KAAA2mH,YAAA,WAAA3mH,KAAA2mH,WACA,QAGAhyN,EAAAA,GAAA,IACAyof,UAAA,IAAAzof,EAAAyof,SAEA,MAAAzC,EAAA,CACA7za,KAAAA,EACA4lF,KAAAA,EACA/3J,QAAAA,GAEAqrG,KAAA64E,KAAA,eAAA8hU,GACA36Y,KAAAk7Y,YAAApwa,KAAA6va,GACA/1Z,GAAAob,KAAA4mH,KAAA,QAAAhiI,GACAob,KAAA0gF,QAQA7pL,QACA,MAAAyoG,EAAAU,KAoBA,SAAAhgB,IACAsf,EAAAg9Y,QAAA,gBACAr4K,EAAA,+CACA3kO,EAAA89M,UAAAp9N,QAGA,SAAAq9Z,IACA/9Y,EAAAk2H,eAAA,UAAA6nR,GACA/9Y,EAAAk2H,eAAA,eAAA6nR,GACAr9Z,IAGA,SAAAs9Z,IAEAh+Y,EAAAsnH,KAAA,UAAAy2R,GACA/9Y,EAAAsnH,KAAA,eAAAy2R,GAGA,MApCA,YAAAr9Y,KAAA2mH,YAAA,SAAA3mH,KAAA2mH,aACA3mH,KAAA2mH,WAAA,UAEA3mH,KAAAk7Y,YAAAj2a,OACA+6B,KAAA4mH,KAAA,SAAA,WACA5mH,KAAA48Y,UACAU,IAEAt9Z,OAGAggB,KAAA48Y,UACAU,IAEAt9Z,KAsBAggB,KAQAnpG,QAAA4iG,GACAwqO,EAAA,kBAAAxqO,GACA+9Y,EAAAyE,uBAAA,EACAj8Y,KAAA64E,KAAA,QAAAp/E,GACAuG,KAAAs8Y,QAAA,kBAAA7iZ,GAQA5iG,QAAA++S,EAAA+pH,GACA,GACA,YAAA3/T,KAAA2mH,YACA,SAAA3mH,KAAA2mH,YACA,YAAA3mH,KAAA2mH,WACA,CACAs9G,EAAA,iCAAAruB,GACA,MAAAt2M,EAAAU,KAGAiwH,aAAAjwH,KAAAu9Y,mBACAttR,aAAAjwH,KAAA87Y,kBAGA97Y,KAAAo9M,UAAA3nF,mBAAA,SAGAz1H,KAAAo9M,UAAAp9N,QAGAggB,KAAAo9M,UAAA3nF,qBAGAz1H,KAAA2mH,WAAA,SAGA3mH,KAAA/b,GAAA,KAGA+b,KAAA64E,KAAA,QAAA+8H,EAAA+pH,GAIArgU,EAAA47Y,YAAA,GACA57Y,EAAA67Y,cAAA,GAWAtkf,eAAA8kf,GACA,MAAA6B,EAAA,GACA,IAAAr2a,EAAA,EACA,MAAAmqB,EAAAqqZ,EAAA12a,OACA,KAAAkC,EAAAmqB,EAAAnqB,KACA64B,KAAA+sY,WAAAvha,QAAAmwa,EAAAx0a,KACAq2a,EAAA1ya,KAAA6wa,EAAAx0a,IAEA,OAAAq2a,GAIAhG,EAAAyE,uBAAA,EAQAzE,EAAAjsS,SAAAn8H,EAAAm8H,SAYAl4M,EAAAC,QAAAkkf,kKCvqBA,MAAA3lR,EAAAt+N,EAAA,sBACAkqf,EAAAlqf,EAAA,iBACAmqf,EAAAnqf,EAAA,mBACAmqe,EAAAnqe,EAAA,eAEAD,EAAAqqf,QAUA,SAAA58U,GACA,IAAA68U,EACAC,GAAA,EACAt9Z,GAAA,EACA,MAAA+6Z,GAAA,IAAAv6U,EAAAu6U,MAEA,GAAA,oBAAA9yS,SAAA,CACA,MAAAs1S,EAAA,WAAAt1S,SAAA+C,SACA,IAAA9lG,EAAA+iG,SAAA/iG,KAGAA,IACAA,EAAAq4Y,EAAA,IAAA,IAGAD,EAAA98U,EAAAq2D,WAAA5uB,SAAA4uB,UAAA3xH,IAAAs7D,EAAAt7D,KACAllB,EAAAwgF,EAAAk6U,SAAA6C,EAOA,GAJA/8U,EAAAg9U,QAAAF,EACA98U,EAAAi9U,QAAAz9Z,EACAq9Z,EAAA,IAAA/rR,EAAA9wD,GAEA,SAAA68U,IAAA78U,EAAAk9U,WACA,OAAA,IAAAR,EAAA18U,GAEA,IAAAu6U,EAAA,MAAA,IAAAxiZ,MAAA,kBACA,OAAA,IAAA4kZ,EAAA38U,IApCAztK,EAAAoqe,UAAAA,oICJA,MAAAwgB,EAAA3qf,EAAA,YACA8rG,EAAA9rG,EAAA,gBAEAF,EAAAC,QAAA,SAAAytK,GACA,MAAAg9U,EAAAh9U,EAAAg9U,QAIAC,EAAAj9U,EAAAi9U,QAIAG,EAAAp9U,EAAAo9U,WAGA,IACA,GAAA,oBAAAtsR,kBAAAksR,GAAAG,GACA,OAAA,IAAArsR,eAEA,MAAA99N,IAKA,IACA,GAAA,oBAAAqqf,iBAAAJ,GAAAG,EACA,OAAA,IAAAC,eAEA,MAAArqf,IAEA,IAAAgqf,EACA,IACA,OAAA,IAAA1+Y,EAAA,CAAA,UAAAxN,OAAA,UAAAvnB,KAAA,OACA,qBAEA,MAAAv2E,2EC5BA,IACAV,EAAAC,QAAA,oBAAAu+N,gBACA,oBAAA,IAAAA,eACA,MAAAp4H,GAGApmG,EAAAC,SAAA,+BCfAD,EAAAC,QACA,oBAAAgsG,KACAA,KACA,oBAAAC,OACAA,OAEA1pG,SAAA,cAAAA,iCCJA,MAAAg8N,EAAAt+N,EAAA,sBACA8qf,EAAA9qf,EAAA,aACAqlf,EAAArlf,EAAA,sBACA+qf,KAAAA,GAAA/qf,EAAA,WACA8rG,EAAA9rG,EAAA,iBAEA0wU,EAAA1wU,EAAA,QAAAA,CAAA,gCAMA,SAAAs8H,KAEA,MAAA0uX,EAEA,MADA,IAAA1sR,EAAA,CAAAksR,SAAA,IACA5rR,aAoFA,MAAAtD,UAAA+pR,EAOA/hf,YAAA6sZ,EAAA3iP,GACAx7C,QACAvlB,KAAA+gE,KAAAA,EAEA/gE,KAAAo9B,OAAA2jC,EAAA3jC,QAAA,MACAp9B,KAAA0jT,IAAAA,EACA1jT,KAAAszC,OAAA,IAAAytB,EAAAztB,MACAtzC,KAAA0sD,UAAAh3J,IAAAqrK,EAAArU,KAAAqU,EAAArU,KAAA,KAEA1sD,KAAA9rG,SAQA2C,SACA,MAAAkqK,EAAAu9U,EACAt+Y,KAAA+gE,KACA,QACA,aACA,MACA,MACA,aACA,OACA,KACA,UACA,sBAEAA,EAAAg9U,UAAA/9Y,KAAA+gE,KAAA88U,GACA98U,EAAAi9U,UAAAh+Y,KAAA+gE,KAAAxgF,GAEA,MAAAq9Z,EAAA59Y,KAAA49Y,IAAA,IAAA/rR,EAAA9wD,GACAzhE,EAAAU,KAEA,IACAikO,EAAA,kBAAAjkO,KAAAo9B,OAAAp9B,KAAA0jT,KACAk6F,EAAA79Z,KAAAigB,KAAAo9B,OAAAp9B,KAAA0jT,IAAA1jT,KAAAszC,OACA,IACA,GAAAtzC,KAAA+gE,KAAAy9U,aAAA,CACAZ,EAAAa,uBAAAb,EAAAa,uBAAA,GACA,IAAA,IAAAt3a,KAAA64B,KAAA+gE,KAAAy9U,aACAx+Y,KAAA+gE,KAAAy9U,aAAAhkZ,eAAArzB,IACAy2a,EAAA7rR,iBAAA5qJ,EAAA64B,KAAA+gE,KAAAy9U,aAAAr3a,KAIA,MAAApzE,IAEA,GAAA,SAAAisG,KAAAo9B,OACA,IACAwgX,EAAA7rR,iBAAA,eAAA,4BACA,MAAAh+N,IAGA,IACA6pf,EAAA7rR,iBAAA,SAAA,OACA,MAAAh+N,IAGA,oBAAA6pf,IACAA,EAAAvC,gBAAAr7Y,KAAA+gE,KAAAs6U,iBAGAr7Y,KAAA+gE,KAAA29U,iBACAd,EAAA9yU,QAAA9qE,KAAA+gE,KAAA29U,gBAGA1+Y,KAAA2+Y,UACAf,EAAAnrR,OAAA,WACAnzH,EAAAs/Y,UAEAhB,EAAAprR,QAAA,WACAlzH,EAAA7pG,QAAAmof,EAAAiB,gBAGAjB,EAAAkB,mBAAA,WACA,IAAAlB,EAAAj3R,aACA,MAAAi3R,EAAAjiS,QAAA,OAAAiiS,EAAAjiS,OACAr8G,EAAAs/Y,SAIA/zU,YAAA,WACAvrE,EAAA7pG,QAAA,iBAAAmof,EAAAjiS,OAAAiiS,EAAAjiS,OAAA,KACA,KAKAsoH,EAAA,cAAAjkO,KAAA0sD,MACAkxV,EAAAjrR,KAAA3yH,KAAA0sD,MACA,MAAA34J,GAOA,YAHA82K,YAAA,WACAvrE,EAAA7pG,QAAA1B,KACA,GAIA,oBAAAoB,WACA6qG,KAAAz6B,MAAAspJ,EAAAkwR,gBACAlwR,EAAA00L,SAAAvjT,KAAAz6B,OAAAy6B,MASAnpG,YACAmpG,KAAA64E,KAAA,WACA74E,KAAA6gF,UAQAhqL,OAAA61J,GACA1sD,KAAA64E,KAAA,OAAAnsB,GACA1sD,KAAAg/Y,YAQAnof,QAAA4iG,GACAuG,KAAA64E,KAAA,QAAAp/E,GACAuG,KAAA6gF,SAAA,GAQAhqL,QAAAoof,GACA,QAAA,IAAAj/Y,KAAA49Y,KAAA,OAAA59Y,KAAA49Y,IAAA,CAUA,GANA59Y,KAAA2+Y,SACA3+Y,KAAA49Y,IAAAnrR,OAAAzyH,KAAA49Y,IAAAprR,QAAA3iG,EAEA7vB,KAAA49Y,IAAAkB,mBAAAjvX,EAGAovX,EACA,IACAj/Y,KAAA49Y,IAAA5qW,QACA,MAAAj/I,IAGA,oBAAAoB,iBACA05N,EAAA00L,SAAAvjT,KAAAz6B,OAGAy6B,KAAA49Y,IAAA,MAQA/mf,SACA,MAAA61J,EAAA1sD,KAAA49Y,IAAAiB,aACA,OAAAnyV,GACA1sD,KAAAyhR,OAAA/0N,GASA71J,SACA,MAAA,oBAAAunf,iBAAAp+Y,KAAAzf,IAAAyf,KAAAm+Y,WAQAtnf,QACAmpG,KAAA6gF,WAaA,GAHAguC,EAAAkwR,cAAA,EACAlwR,EAAA00L,SAAA,GAEA,oBAAApuZ,SACA,GAAA,mBAAA+pf,YACAA,YAAA,WAAAC,QACA,GAAA,mBAAAj5U,iBAAA,CAEAA,iBADA,eAAA7mE,EAAA,WAAA,SACA8/Y,GAAA,GAIA,SAAAA,IACA,IAAA,IAAAh4a,KAAA0nJ,EAAA00L,SACA10L,EAAA00L,SAAA/oT,eAAArzB,IACA0nJ,EAAA00L,SAAAp8U,GAAA6rE,QAKA3/I,EAAAC,QAzTA,cAAA+qf,EAOAxnf,YAAAkqK,GAGA,GAFAx7C,MAAAw7C,GAEA,oBAAAynC,SAAA,CACA,MAAAs1S,EAAA,WAAAt1S,SAAA+C,SACA,IAAA9lG,EAAA+iG,SAAA/iG,KAGAA,IACAA,EAAAq4Y,EAAA,IAAA,IAGA99Y,KAAA69Y,GACA,oBAAAr1S,UACAznC,EAAAq2D,WAAA5uB,SAAA4uB,UACA3xH,IAAAs7D,EAAAt7D,KACAzF,KAAAzf,GAAAwgF,EAAAk6U,SAAA6C,EAKA,MAAAsB,EAAAr+U,GAAAA,EAAAq+U,YACAp/Y,KAAA28Y,eAAA4B,IAAAa,EASAvof,QAAAkqK,EAAA,IAEA,OADAvtK,OAAAiqG,OAAAsjE,EAAA,CAAA88U,GAAA79Y,KAAA69Y,GAAAt9Z,GAAAyf,KAAAzf,IAAAyf,KAAA+gE,MACA,IAAA8tD,EAAA7uH,KAAA0jT,MAAA3iP,GAUAlqK,QAAA61J,EAAA9nE,GACA,MAAA00K,EAAAt5J,KAAA4xH,QAAA,CACAx0F,OAAA,OACAsvB,KAAAA,IAEAptD,EAAAU,KACAs5J,EAAAtrL,GAAA,UAAA4W,GACA00K,EAAAtrL,GAAA,SAAA,SAAAyrB,GACA6F,EAAA7pG,QAAA,iBAAAgkG,MASA5iG,SACAotU,EAAA,YACA,MAAA3qE,EAAAt5J,KAAA4xH,UACAtyH,EAAAU,KACAs5J,EAAAtrL,GAAA,QAAA,SAAA0+E,GACAptD,EAAAmiR,OAAA/0N,MAEA4sG,EAAAtrL,GAAA,SAAA,SAAAyrB,GACA6F,EAAA7pG,QAAA,iBAAAgkG,MAEAuG,KAAAq/Y,QAAA/lP,IA6OAjmQ,EAAAC,QAAAu7N,QAAAA,oKC/UA,MAAAg0O,EAAAtvc,EAAA,gBACAynf,EAAAznf,EAAA,WACA67E,EAAA77E,EAAA,oBACA+rf,EAAA/rf,EAAA,SAEA0wU,EAAA1wU,EAAA,QAAAA,CAAA,4BA4MAF,EAAAC,QA1MA,cAAAuvc,EAIAhwc,WACA,MAAA,UASAgE,SACAmpG,KAAAu6U,OASA1jb,MAAA0of,GACA,MAAAjgZ,EAAAU,KAIA,SAAAypO,IACAxF,EAAA,UACA3kO,EAAAqnH,WAAA,SACA44R,IAGA,GARAv/Y,KAAA2mH,WAAA,UAQA3mH,KAAA29Y,UAAA39Y,KAAAm2H,SAAA,CACA,IAAA/mE,EAAA,EAEApvD,KAAA29Y,UACA15K,EAAA,+CACA70K,IACApvD,KAAA4mH,KAAA,gBAAA,WACAq9G,EAAA,gCACA70K,GAAAq6K,QAIAzpO,KAAAm2H,WACA8tG,EAAA,+CACA70K,IACApvD,KAAA4mH,KAAA,SAAA,WACAq9G,EAAA,gCACA70K,GAAAq6K,aAIAA,IASA5yU,OACAotU,EAAA,WACAjkO,KAAA29Y,SAAA,EACA39Y,KAAAw/Y,SACAx/Y,KAAA64E,KAAA,QAQAhiL,OAAA61J,GACA,MAAAptD,EAAAU,KACAikO,EAAA,sBAAAv3K,GAkBAt9E,EAAAqwa,cAAA/yV,EAAA1sD,KAAAk9X,OAAAU,YAAAxpe,SAjBA,SAAAumf,EAAAp1a,EAAA6pF,GAOA,GALA,YAAA9vD,EAAAqnH,YAAA,SAAAg0R,EAAA7za,MACAw4B,EAAA2+X,SAIA,UAAA0c,EAAA7za,KAEA,OADAw4B,EAAAg9Y,WACA,EAIAh9Y,EAAA+8Y,SAAA1B,MAOA,WAAA36Y,KAAA2mH,aAEA3mH,KAAA29Y,SAAA,EACA39Y,KAAA64E,KAAA,gBAEA,SAAA74E,KAAA2mH,WACA3mH,KAAAu6U,OAEAt2G,EAAA,uCAAAjkO,KAAA2mH,aAUA9vN,UACA,MAAAyoG,EAAAU,KAEA,SAAAhgB,IACAikP,EAAA,wBACA3kO,EAAAqlJ,MAAA,CAAA,CAAA79K,KAAA,WAGA,SAAAk5B,KAAA2mH,YACAs9G,EAAA,4BACAjkP,MAIAikP,EAAA,wCACAjkO,KAAA4mH,KAAA,OAAA5mI,IAWAnpF,MAAA6of,GACA1/Y,KAAAm2H,UAAA,EAEA/mJ,EAAAuwa,cAAAD,GAAAhzV,IACA1sD,KAAAmxO,QAAAzkL,GAAA,KACA1sD,KAAAm2H,UAAA,EACAn2H,KAAA64E,KAAA,eAUAhiL,MACA,IAAA6xM,EAAA1oG,KAAA0oG,OAAA,GACA,MAAAk3S,EAAA5/Y,KAAA+gE,KAAAk6U,OAAA,QAAA,OACA,IAAAx1Y,EAAA,IAGA,IAAAzF,KAAA+gE,KAAA8+U,oBACAn3S,EAAA1oG,KAAA+gE,KAAAw6U,gBAAA+D,KAGAt/Y,KAAA28Y,gBAAAj0S,EAAAszS,MACAtzS,EAAA2+C,IAAA,GAGA3+C,EAAAsyS,EAAA13Y,OAAAolG,GAIA1oG,KAAA+gE,KAAAt7D,OACA,UAAAm6Y,GAAA,MAAAz5a,OAAA65B,KAAA+gE,KAAAt7D,OACA,SAAAm6Y,GAAA,KAAAz5a,OAAA65B,KAAA+gE,KAAAt7D,SAEAA,EAAA,IAAAzF,KAAA+gE,KAAAt7D,MAIAijG,EAAAzjI,SACAyjI,EAAA,IAAAA,GAIA,OACAk3S,EACA,QAHA,IAAA5/Y,KAAA+gE,KAAAq2D,SAAA5rJ,QAAA,KAIA,IAAAw0B,KAAA+gE,KAAAq2D,SAAA,IAAAp3H,KAAA+gE,KAAAq2D,UACA3xH,EACAzF,KAAA+gE,KAAApuK,KACA+1M,+HC5MA,MAAAt5H,EAAA77E,EAAA,oBACAqlf,EAAArlf,EAAA,qBACA0wU,EAAA1wU,EAAA,QAAAA,CAAA,8BAoHAF,EAAAC,QAlHA,cAAAslf,EAOA/hf,YAAAkqK,GACAx7C,QAEAvlB,KAAA+gE,KAAAA,EACA/gE,KAAA0oG,MAAA3nC,EAAA2nC,MACA1oG,KAAA2mH,WAAA,GACA3mH,KAAAk9X,OAAAn8T,EAAAm8T,OAUArme,QAAA44E,EAAAkwV,GACA,MAAAlmU,EAAA,IAAAX,MAAArpB,GAIA,OAHAgqB,EAAA3yB,KAAA,iBACA2yB,EAAAujE,YAAA2iQ,EACA3/T,KAAA64E,KAAA,QAAAp/E,GACAuG,KAQAnpG,OAMA,MALA,WAAAmpG,KAAA2mH,YAAA,KAAA3mH,KAAA2mH,aACA3mH,KAAA2mH,WAAA,UACA3mH,KAAA8/Y,UAGA9/Y,KAQAnpG,QAMA,MALA,YAAAmpG,KAAA2mH,YAAA,SAAA3mH,KAAA2mH,aACA3mH,KAAA+/Y,UACA//Y,KAAAs8Y,WAGAt8Y,KASAnpG,KAAA6of,GACA,SAAA1/Y,KAAA2mH,WACA3mH,KAAA2kJ,MAAA+6P,GAGAz7K,EAAA,6CASAptU,SACAmpG,KAAA2mH,WAAA,OACA3mH,KAAAm2H,UAAA,EACAn2H,KAAA64E,KAAA,QASAhiL,OAAA61J,GACA,MAAAiuV,EAAAvra,EAAA4wa,aAAAtzV,EAAA1sD,KAAAk9X,OAAAU,YACA59X,KAAAq8Y,SAAA1B,GAMA9jf,SAAA8jf,GACA36Y,KAAA64E,KAAA,SAAA8hU,GAQA9jf,UACAmpG,KAAA2mH,WAAA,SACA3mH,KAAA64E,KAAA,6GClHA,MAAAonU,EAAA1sf,EAAA,kBACAysf,EAAAzsf,EAAA,kBAEA2sf,EAAA75a,OAAA67C,aAAA,IAgCA7uH,EAAAC,QAAA,CACAi4M,SAAA,EACA00S,aAAAA,EACAN,cAjCA,CAAAD,EAAArlV,KAEA,MAAAp1F,EAAAy6a,EAAAz6a,OACA41a,EAAA,IAAAh9Y,MAAA54B,GACA,IAAAse,EAAA,EAEAm8Z,EAAAtrf,SAAA,CAAAumf,EAAAxza,KAEA84a,EAAAtF,GAAA,GAAAwF,IACAtF,EAAA1za,GAAAg5a,IACA58Z,IAAAte,GACAo1F,EAAAwgV,EAAAvwa,KAAA41a,WAuBAF,aAAAA,EACAP,cAlBA,CAAAW,EAAAxiB,KACA,MAAAid,EAAAuF,EAAAtga,MAAAoga,GACAR,EAAA,GACA,IAAA,IAAAv4a,EAAA,EAAAA,EAAA0za,EAAA51a,OAAAkC,IAAA,CACA,MAAAk5a,EAAAL,EAAAnF,EAAA1za,GAAAy2Z,GAEA,GADA8hB,EAAA50a,KAAAu1a,GACA,UAAAA,EAAAv5a,KACA,MAGA,OAAA44a,mFChCA,MAAAY,aAAAA,GAAA/sf,EAAA,aAEAgtf,EACA,mBAAAllP,MACA,oBAAAA,MACA,6BAAA7nQ,OAAAmqG,UAAAS,SAAAR,KAAAy9J,MACAmlP,EAAA,mBAAAviR,YA8BAwiR,EAAA,CAAA/zV,EAAA2N,KACA,MAAAqmV,EAAA,IAAA9zF,WAKA,OAJA8zF,EAAAjuR,OAAA,WACA,MAAA1rJ,EAAA25a,EAAA91a,OAAAkV,MAAA,KAAA,GACAu6E,EAAA,IAAAtzF,IAEA25a,EAAAC,cAAAj0V,IAGAr5J,EAAAC,QA9BA,EAAAwzE,KAAAA,EAAA4lF,KAAAA,GAAAiwV,EAAAtiV,KACA,OAAAkmV,GAAA7zV,aAAA2uG,KACAshP,EACAtiV,EAAA3N,GAEA+zV,EAAA/zV,EAAA2N,GAGAmmV,IACA9zV,aAAAuxE,cAfAp/H,EAeA6tD,EAdA,mBAAAuxE,YAAAC,OACAD,YAAAC,OAAAr/H,GACAA,GAAAA,EAAAgxG,kBAAAouB,cAcA0+Q,EACAtiV,EAAA3N,aAAAuxE,YAAAvxE,EAAAA,EAAAmjD,QAEA4wS,EAAA,IAAAplP,KAAA,CAAA3uG,IAAA2N,GAIAA,EAAAimV,EAAAx5a,IAAA4lF,GAAA,KAxBA7tD,IAAAA,oDCTA,MAAAyhZ,EAAA9sf,OAAAU,OAAA,MACAosf,EAAA,KAAA,IACAA,EAAA,MAAA,IACAA,EAAA,KAAA,IACAA,EAAA,KAAA,IACAA,EAAA,QAAA,IACAA,EAAA,QAAA,IACAA,EAAA,KAAA,IAEA,MAAAM,EAAAptf,OAAAU,OAAA,MACAV,OAAAW,KAAAmsf,GAAAlsf,SAAAY,IACA4rf,EAAAN,EAAAtrf,IAAAA,KAKA3B,EAAAC,QAAA,CACAgtf,aAAAA,EACAM,qBAAAA,EACAC,aALA,CAAA/5a,KAAA,QAAA4lF,KAAA,6CCdA,MAAAk0V,qBAAAA,EAAAC,aAAAA,GAAAttf,EAAA,aAIA,IAAAutf,EAFA,mBAAA7iR,cAIA6iR,EAAAvtf,EAAA,uBAGA,MA4BAwtf,EAAA,CAAAr0V,EAAAkxU,KACA,GAAAkjB,EAAA,CACA,MAAA9nR,EAAA8nR,EAAA18Y,OAAAsoD,GACA,OAAAs0V,EAAAhoR,EAAA4kQ,GAEA,MAAA,CAAA/5X,QAAA,EAAA6oD,KAAAA,IAIAs0V,EAAA,CAAAt0V,EAAAkxU,KACA,OAAAA,GACA,IAAA,OACA,OAAAlxU,aAAAuxE,YAAA,IAAAo9B,KAAA,CAAA3uG,IAAAA,EACA,IAAA,cACA,QACA,OAAAA,IAIAr5J,EAAAC,QA/CA,CAAA6sf,EAAAviB,KACA,GAAA,iBAAAuiB,EACA,MAAA,CACAr5a,KAAA,UACA4lF,KAAAs0V,EAAAb,EAAAviB,IAGA,MAAA92Z,EAAAq5a,EAAA5nZ,OAAA,GACA,GAAA,MAAAzxB,EACA,MAAA,CACAA,KAAA,UACA4lF,KAAAq0V,EAAAZ,EAAArkZ,UAAA,GAAA8hY,IAIA,OADAgjB,EAAA95a,GAIAq5a,EAAAl7a,OAAA,EACA,CACA6B,KAAA85a,EAAA95a,GACA4lF,KAAAyzV,EAAArkZ,UAAA,IAEA,CACAh1B,KAAA85a,EAAA95a,IARA+5a,kFClBA,SAAAI,GACA,aAEA3tf,EAAAgwG,OAAA,SAAA49Y,GACA,IACA/5a,EADAwxJ,EAAA,IAAAF,WAAAyoR,GACA99Y,EAAAu1H,EAAA1zJ,OAAA4+B,EAAA,GAEA,IAAA18B,EAAA,EAAAA,EAAAi8B,EAAAj8B,GAAA,EACA08B,GAAAo9Y,EAAAtoR,EAAAxxJ,IAAA,GACA08B,GAAAo9Y,GAAA,EAAAtoR,EAAAxxJ,KAAA,EAAAwxJ,EAAAxxJ,EAAA,IAAA,GACA08B,GAAAo9Y,GAAA,GAAAtoR,EAAAxxJ,EAAA,KAAA,EAAAwxJ,EAAAxxJ,EAAA,IAAA,GACA08B,GAAAo9Y,EAAA,GAAAtoR,EAAAxxJ,EAAA,IASA,OANAi8B,EAAA,GAAA,EACAS,EAAAA,EAAA/H,UAAA,EAAA+H,EAAA5+B,OAAA,GAAA,IACAm+B,EAAA,GAAA,IACAS,EAAAA,EAAA/H,UAAA,EAAA+H,EAAA5+B,OAAA,GAAA,MAGA4+B,GAGAvwG,EAAA8wG,OAAA,SAAAP,GACA,IACA18B,EACAg6a,EAAAC,EAAAC,EAAAC,EAFAC,EAAA,IAAA19Y,EAAA5+B,OACAm+B,EAAAS,EAAA5+B,OAAAiC,EAAA,EAGA,MAAA28B,EAAAA,EAAA5+B,OAAA,KACAs8a,IACA,MAAA19Y,EAAAA,EAAA5+B,OAAA,IACAs8a,KAIA,IAAAL,EAAA,IAAAjjR,YAAAsjR,GACA5oR,EAAA,IAAAF,WAAAyoR,GAEA,IAAA/5a,EAAA,EAAAA,EAAAi8B,EAAAj8B,GAAA,EACAg6a,EAAAF,EAAAz1a,QAAAq4B,EAAA18B,IACAi6a,EAAAH,EAAAz1a,QAAAq4B,EAAA18B,EAAA,IACAk6a,EAAAJ,EAAAz1a,QAAAq4B,EAAA18B,EAAA,IACAm6a,EAAAL,EAAAz1a,QAAAq4B,EAAA18B,EAAA,IAEAwxJ,EAAAzxJ,KAAAi6a,GAAA,EAAAC,GAAA,EACAzoR,EAAAzxJ,MAAA,GAAAk6a,IAAA,EAAAC,GAAA,EACA1oR,EAAAzxJ,MAAA,EAAAm6a,IAAA,EAAA,GAAAC,EAGA,OAAAJ,GAjDA,CAmDA,kGC3CA,SAAAtI,EAAA/5Y,GACA,GAAAA,EAAA,OAWA,SAAAA,GACA,IAAA,IAAA7pG,KAAA4jf,EAAAj7Y,UACAkB,EAAA7pG,GAAA4jf,EAAAj7Y,UAAA3oG,GAEA,OAAA6pG,EAfA8uF,CAAA9uF,QAXA,IAAAxrG,IACAA,EAAAC,QAAAslf,GAqCAA,EAAAj7Y,UAAA3vB,GACA4qa,EAAAj7Y,UAAAuoE,iBAAA,SAAAh9F,EAAA0b,GAIA,OAHAob,KAAAwhZ,WAAAxhZ,KAAAwhZ,YAAA,IACAxhZ,KAAAwhZ,WAAA,IAAAt4a,GAAA82B,KAAAwhZ,WAAA,IAAAt4a,IAAA,IACA4B,KAAA8Z,GACAob,MAaA44Y,EAAAj7Y,UAAAipH,KAAA,SAAA19I,EAAA0b,GACA,SAAA5W,IACAgyB,KAAAu1H,IAAArsJ,EAAA8E,GACA4W,EAAAw+G,MAAApjG,KAAA3pB,WAKA,OAFArI,EAAA4W,GAAAA,EACAob,KAAAhyB,GAAA9E,EAAA8E,GACAgyB,MAaA44Y,EAAAj7Y,UAAA43H,IACAqjR,EAAAj7Y,UAAA63H,eACAojR,EAAAj7Y,UAAA83H,mBACAmjR,EAAAj7Y,UAAA0pE,oBAAA,SAAAn+F,EAAA0b,GAIA,GAHAob,KAAAwhZ,WAAAxhZ,KAAAwhZ,YAAA,GAGA,GAAAnra,UAAApR,OAEA,OADA+6B,KAAAwhZ,WAAA,GACAxhZ,KAIA,IAUAqgD,EAVAgzG,EAAArzJ,KAAAwhZ,WAAA,IAAAt4a,GACA,IAAAmqL,EAAA,OAAArzJ,KAGA,GAAA,GAAA3pB,UAAApR,OAEA,cADA+6B,KAAAwhZ,WAAA,IAAAt4a,GACA82B,KAKA,IAAA,IAAA74B,EAAA,EAAAA,EAAAksL,EAAApuL,OAAAkC,IAEA,IADAk5E,EAAAgzG,EAAAlsL,MACAyd,GAAAy7D,EAAAz7D,KAAAA,EAAA,CACAyuK,EAAA5oL,OAAAtD,EAAA,GACA,MAUA,OAJA,IAAAksL,EAAApuL,eACA+6B,KAAAwhZ,WAAA,IAAAt4a,GAGA82B,MAWA44Y,EAAAj7Y,UAAAk7E,KAAA,SAAA3vG,GACA82B,KAAAwhZ,WAAAxhZ,KAAAwhZ,YAAA,GAKA,IAHA,IAAApra,EAAA,IAAAynB,MAAAxnB,UAAApR,OAAA,GACAouL,EAAArzJ,KAAAwhZ,WAAA,IAAAt4a,GAEA/B,EAAA,EAAAA,EAAAkP,UAAApR,OAAAkC,IACAiP,EAAAjP,EAAA,GAAAkP,UAAAlP,GAGA,GAAAksL,EAEA,CAAAlsL,EAAA,EAAA,IAAA,IAAAi8B,GADAiwJ,EAAAA,EAAAjuL,MAAA,IACAH,OAAAkC,EAAAi8B,IAAAj8B,EACAksL,EAAAlsL,GAAAi8H,MAAApjG,KAAA5pB,GAIA,OAAA4pB,MAWA44Y,EAAAj7Y,UAAA8uG,UAAA,SAAAvjI,GAEA,OADA82B,KAAAwhZ,WAAAxhZ,KAAAwhZ,YAAA,GACAxhZ,KAAAwhZ,WAAA,IAAAt4a,IAAA,IAWA0va,EAAAj7Y,UAAA8jZ,aAAA,SAAAv4a,GACA,QAAA82B,KAAAysG,UAAAvjI,GAAAjE,sCCrKA3xE,EAAAgwG,OAAA,SAAAzE,GACA,IAAArJ,EAAA,GAEA,IAAA,IAAAruB,KAAA03B,EACAA,EAAArE,eAAArzB,KACAquB,EAAAvwB,SAAAuwB,GAAA,KACAA,GAAA4hK,mBAAAjwL,GAAA,IAAAiwL,mBAAAv4J,EAAA13B,KAIA,OAAAquB,GAUAliG,EAAA8wG,OAAA,SAAAs3R,GAGA,IAFA,IAAAgmH,EAAA,GACAhyN,EAAAgsG,EAAA57S,MAAA,KACA3Y,EAAA,EAAA4hB,EAAA2mM,EAAAzqN,OAAAkC,EAAA4hB,EAAA5hB,IAAA,CACA,IAAA4tM,EAAA2a,EAAAvoN,GAAA2Y,MAAA,KACA4ha,EAAA3tS,mBAAAghE,EAAA,KAAAhhE,mBAAAghE,EAAA,IAEA,OAAA2sO,iCCnCA,aAEA,IAKAvka,EALAuhJ,EAAA,mEAAA5+I,MAAA,IAEA1V,EAAA,GACAm2K,EAAA,EACAp5K,EAAA,EAUA,SAAAm8B,EAAAoO,GACA,IAAA1N,EAAA,GAEA,GACAA,EAAA06H,EAAAhtH,EAjBA,IAiBA1N,EACA0N,EAAA9rC,KAAA6nC,MAAAiE,EAlBA,UAmBAA,EAAA,GAEA,OAAA1N,EA0BA,SAAAs7Y,IACA,IAAAh6U,EAAAhiE,GAAA,IAAAvF,MAEA,OAAAunE,IAAAnoF,GAAAojK,EAAA,EAAApjK,EAAAmoF,GACAA,EAAA,IAAAhiE,EAAAi9I,KAMA,KAAAp5K,EAzDA,GAyDAA,IAAAiD,EAAAs0J,EAAAv3J,IAAAA,EAKAm4a,EAAAh8Y,OAAAA,EACAg8Y,EAAAl7Y,OAhCA,SAAA5O,GACA,IAAAwjI,EAAA,EAEA,IAAA7xJ,EAAA,EAAAA,EAAAquB,EAAAvwB,OAAAkC,IACA6xJ,EAnCA,GAmCAA,EAAA5uJ,EAAAorB,EAAA+C,OAAApxB,IAGA,OAAA6xJ,GA0BA3lO,EAAAC,QAAAgsf,gCCnEAjsf,EAAAC,QAAAgrf,KAAA,CAAAz/Y,KAAAjgB,IACAA,EAAAlZ,QAAA,CAAA2wK,EAAAhiP,KACAwqG,EAAArE,eAAAnmG,KACAgiP,EAAAhiP,GAAAwqG,EAAAxqG,IAEAgiP,IACA,kCCNA,MAAAgoQ,EAAA9qf,EAAA,aACA8rG,EAAA9rG,EAAA,iBAEAouf,EAAA,MACAC,EAAA,OAMA,IAAAvuP,EA6LAhgQ,EAAAC,QA3LA,cAAA+qf,EAOAxnf,YAAAkqK,GACAx7C,MAAAw7C,GAEA/gE,KAAA0oG,MAAA1oG,KAAA0oG,OAAA,GAIA2qD,IAEAA,EAAAh0J,EAAAwiZ,OAAAxiZ,EAAAwiZ,QAAA,IAIA7hZ,KAAAz6B,MAAA8tL,EAAApuL,OAGA,MAAAq6B,EAAAU,KACAqzJ,EAAAvoL,MAAA,SAAA2E,GACA6vB,EAAAmiR,OAAAhyS,MAIAuwB,KAAA0oG,MAAAp3G,EAAA0O,KAAAz6B,MAMAo3a,qBACA,OAAA,EAQA9lf,UACAmpG,KAAAkkH,SAEAlkH,KAAAkkH,OAAAsO,QAAA,OACAxyH,KAAAkkH,OAAA3gD,WAAAC,YAAAxjE,KAAAkkH,QACAlkH,KAAAkkH,OAAA,MAGAlkH,KAAA8hZ,OACA9hZ,KAAA8hZ,KAAAv+U,WAAAC,YAAAxjE,KAAA8hZ,MACA9hZ,KAAA8hZ,KAAA,KACA9hZ,KAAA+hZ,OAAA,MAGAx8X,MAAAw6X,UAQAlpf,SACA,MAAAyoG,EAAAU,KACAkkH,EAAA/uN,SAAAsuK,cAAA,UAEAzjE,KAAAkkH,SACAlkH,KAAAkkH,OAAA3gD,WAAAC,YAAAxjE,KAAAkkH,QACAlkH,KAAAkkH,OAAA,MAGAA,EAAA5wE,OAAA,EACA4wE,EAAAjoH,IAAA+D,KAAA0jT,MACAx/L,EAAAsO,QAAA,SAAAz+N,GACAurG,EAAA7pG,QAAA,mBAAA1B,IAGA,MAAAiuf,EAAA7sf,SAAA8sf,qBAAA,UAAA,GACAD,EACAA,EAAAz+U,WAAAD,aAAA4gD,EAAA89R,IAEA7sf,SAAAkwE,MAAAlwE,SAAA8wE,MAAA2mG,YAAAs3C,GAEAlkH,KAAAkkH,OAAAA,EAGA,oBAAAt+C,WAAA,SAAAngG,KAAAmgG,UAAAC,YAGAgF,YAAA,WACA,MAAAk3U,EAAA5sf,SAAAsuK,cAAA,UACAtuK,SAAA8wE,KAAA2mG,YAAAm1U,GACA5sf,SAAA8wE,KAAAu9F,YAAAu+U,KACA,KAWAlrf,QAAA61J,EAAA9nE,GACA,MAAA0a,EAAAU,KACA,IAAA+hZ,EAEA,IAAA/hZ,KAAA8hZ,KAAA,CACA,MAAAA,EAAA3sf,SAAAsuK,cAAA,QACAy+U,EAAA/sf,SAAAsuK,cAAA,YACAx/E,EAAA+b,KAAAmiZ,SAAA,cAAAniZ,KAAAz6B,MAEAu8a,EAAAjnZ,UAAA,WACAinZ,EAAAj9U,MAAAmkC,SAAA,WACA84S,EAAAj9U,MAAAsJ,IAAA,UACA2zU,EAAAj9U,MAAA37E,KAAA,UACA44Z,EAAA12U,OAAAnnF,EACA69Z,EAAA1kX,OAAA,OACA0kX,EAAAh+U,aAAA,iBAAA,SACAo+U,EAAArvf,KAAA,IACAivf,EAAAl1U,YAAAs1U,GACA/sf,SAAA8wE,KAAA2mG,YAAAk1U,GAEA9hZ,KAAA8hZ,KAAAA,EACA9hZ,KAAAkiZ,KAAAA,EAKA,SAAAE,IACAC,IACAz9Z,IAGA,SAAAy9Z,IACA,GAAA/iZ,EAAAyiZ,OACA,IACAziZ,EAAAwiZ,KAAAt+U,YAAAlkE,EAAAyiZ,QACA,MAAAhuf,GACAurG,EAAA7pG,QAAA,qCAAA1B,GAIA,IAEA,MAAAi5E,EAAA,oCAAAsyB,EAAA6iZ,SAAA,KACAJ,EAAA5sf,SAAAsuK,cAAAz2F,GACA,MAAAj5E,GACAguf,EAAA5sf,SAAAsuK,cAAA,UACAs+U,EAAAlvf,KAAAysG,EAAA6iZ,SACAJ,EAAA9lZ,IAAA,eAGA8lZ,EAAA99Z,GAAAqb,EAAA6iZ,SAEA7iZ,EAAAwiZ,KAAAl1U,YAAAm1U,GACAziZ,EAAAyiZ,OAAAA,EA7BA/hZ,KAAA8hZ,KAAAQ,OAAAtiZ,KAAA0jT,MAgCA2+F,IAIA31V,EAAAA,EAAAxzE,QAAA0oa,EAAA,QACA5hZ,KAAAkiZ,KAAAxuf,MAAAg5J,EAAAxzE,QAAAyoa,EAAA,OAEA,IACA3hZ,KAAA8hZ,KAAAS,SACA,MAAAxuf,IAEAisG,KAAA+hZ,OAAA7C,YACAl/Y,KAAA+hZ,OAAAjD,mBAAA,WACA,aAAAx/Y,EAAAyiZ,OAAAp7R,YACAy7R,KAIApiZ,KAAA+hZ,OAAAtvR,OAAA2vR,4GClMMv/C,EAAYtvc,EAAQ,gBACpB67E,EAAS77E,EAAQ,oBACjBynf,EAAUznf,EAAQ,WAClB+rf,EAAQ/rf,EAAQ,eACd+qf,GAAS/qf,EAAQ,sBAEvBiqe,EAAAA,sBACAglB,EAAAA,kBACAC,GACElvf,EAAQ,2BAEN0wU,EAAQ1wU,EAAQ,QAARA,CAAiB,8BAGzB2gO,EACiB,oBAAdtuD,WACsB,iBAAtBA,UAAUguD,SACmB,gBAApChuD,UAAUguD,QAAQxqJ,cAEpB,MAAAszZ,UAAiB75B,EAOfl2V,YAAYo0D,GACVx7C,MAAMw7C,GAEN/gE,KAAK28Y,gBAAkB57U,EAAKq+U,6BASrB,YAQTU,aACO9/Y,KAAKgyT,qBAKJtO,EAAM1jT,KAAK0jT,MACX7mG,EAAY78M,KAAK+gE,KAAK87I,UAGtB97I,EAAOmzD,EAAAA,GAEToqR,EACEt+Y,KAAK+gE,KACL,QACA,oBACA,MACA,MACA,aACA,OACA,KACA,UACA,qBACA,eACA,kBACA,SACA,aACA,SACA,uBAGF/gE,KAAK+gE,KAAKy9U,eACZz9U,EAAK0uD,QAAUzvH,KAAK+gE,KAAKy9U,kBAIzBx+Y,KAAK09I,GACH8kQ,IAA0BtuR,EACtB2oF,EAAAA,IACM2gL,EAAU95E,EAAK7mG,GAAAA,IACf2gL,EAAU95E,GAAAA,IACZ85E,EAAU95E,EAAK7mG,EAAW97I,SAC7BtnE,UACAuG,KAAK64E,KAAK,QAASp/E,GAG5BuG,KAAK09I,GAAGkgP,WAAa59X,KAAKk9X,OAAOU,YAAc6kB,EAE/CziZ,KAAK0iZ,oBAQPA,0BACQpjZ,EAAOU,KAEbA,KAAK09I,GAAGs1P,OAAS,WACf1zY,EAAK2+X,UAEPj+X,KAAK09I,GAAGyrF,QAAU,WAChB7pO,EAAKg9Y,WAEPt8Y,KAAK09I,GAAGq1P,UAAY,SAAShnR,GAC3BzsH,EAAKmiR,OAAO11J,EAAGr/D,OAEjB1sD,KAAK09I,GAAGlrB,QAAU,SAASz+N,GACzBurG,EAAK7pG,QAAQ,kBAAmB1B,IAUpC4wP,MAAM+6P,SACEpgZ,EAAOU,KACbA,KAAKm2H,UAAW,MAIZ/mE,EAAQswV,EAAQz6a,OAChBkC,EAAI,QACF4hB,EAAIqmE,OACHjoF,EAAI4hB,EAAG5hB,cACFwza,GACRvra,EAAO6wa,aAAatF,EAAQr7Y,EAAKq9Y,gBAAgB,SAASjwV,SAElDqU,EAAAA,OACDyhV,IACC7H,EAAOhmf,UACTosK,EAAKq8U,SAAWzC,EAAOhmf,QAAQyof,UAG7B99Y,EAAKyhE,KAAK26U,mBAAAA,EAEV,iBAAoBhvV,EAChBu2F,EAAO7kB,WAAW1xE,GAClBA,EAAKznF,QACDq6B,EAAKyhE,KAAK26U,kBAAkBrkG,YACpCt2O,EAAKq8U,UAAW,OAShBoF,EAEFljZ,EAAKo+I,GAAG/qB,KAAKjmE,GAEbptD,EAAKo+I,GAAG/qB,KAAKjmE,EAAMqU,SAEdhtK,GACPkwU,EAAM,2CAGN70K,GAAS0a,QAEZ41U,EAAQv4a,IAGb,SAAA2iG,IACExqE,EAAKu5E,KAAK,SAIVhO,YAAW,WACTvrE,EAAK62H,UAAW,EAChB72H,EAAKu5E,KAAK,WACT,IASPyjU,UACEz5C,EAAUllW,UAAU2+Y,QAAQ1+Y,KAAKoC,MAQnC+/Y,eACyB,IAAZ//Y,KAAK09I,KACd19I,KAAK09I,GAAG19J,QACRggB,KAAK09I,GAAK,MASdgmK,UACMh7M,EAAQ1oG,KAAK0oG,OAAAA,SACXk3S,EAAS5/Y,KAAK+gE,KAAKk6U,OAAS,MAAQ,SACtCx1Y,EAAO,GAITzF,KAAK+gE,KAAKt7D,OACR,QAAUm6Y,GAAqC,MAA3Bz5a,OAAO65B,KAAK+gE,KAAKt7D,OACpC,OAASm6Y,GAAqC,KAA3Bz5a,OAAO65B,KAAK+gE,KAAKt7D,SAEvCA,EAAO,IAAMzF,KAAK+gE,KAAKt7D,MAIrBzF,KAAK+gE,KAAK8+U,oBACZn3S,EAAM1oG,KAAK+gE,KAAKw6U,gBAAkB+D,KAI/Bt/Y,KAAK28Y,iBACRj0S,EAAM2+C,IAAM,GAGd3+C,EAAQsyS,EAAQ13Y,OAAOolG,GAGnBA,EAAMzjI,SACRyjI,EAAQ,IAAMA,UAKdk3S,EACA,QAHgD,IAArC5/Y,KAAK+gE,KAAKq2D,SAAS5rJ,QAAQ,KAI9B,IAAMw0B,KAAK+gE,KAAKq2D,SAAW,IAAMp3H,KAAK+gE,KAAKq2D,UACnD3xH,EACAzF,KAAK+gE,KAAKpuK,KACV+1M,EAUJspN,iBAEMwrE,GACA,iBAAkBA,GAAax9X,KAAKntG,OAAS6pe,EAAG/+X,UAAU9qG,OAKlEQ,EAAOC,QAAUope,gMC5QjB,MAAAr9X,EAAA9rG,EAAA,iBAEAF,EAAAC,QAAA,CACAkqe,UAAAn+X,EAAAm+X,WAAAn+X,EAAAsjZ,aACAH,uBAAA,EACAC,kBAAA,oECLA,aACAjvf,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAkkf,YAAA,EACA,MAAAU,EAAA3kf,EAAA,oBACAqlf,EAAArlf,EAAA,qBACAslf,EAAAtlf,EAAA,QACA0wU,EAAA1wU,EAAA,QAAAA,CAAA,2BAKAqvf,EAAApvf,OAAAc,OAAA,CACA0oe,QAAA,EACA6lB,cAAA,EACAv8R,WAAA,EACAw8R,cAAA,EAEAl4K,YAAA,EACAp1G,eAAA,IA0bAliO,EAAAkkf,OAxbA,cAAAoB,EAMA/hf,YAAAslS,EAAAy+M,EAAA75U,GACAx7C,QACAvlB,KAAA+iZ,cAAA,GACA/iZ,KAAAgjZ,WAAA,GACAhjZ,KAAA5mB,IAAA,EACA4mB,KAAAijZ,KAAA,GACAjjZ,KAAAqjB,MAAA,GACArjB,KAAAm8L,GAAAA,EACAn8L,KAAA46Y,IAAAA,EACA56Y,KAAA5mB,IAAA,EACA4mB,KAAAijZ,KAAA,GACAjjZ,KAAA+iZ,cAAA,GACA/iZ,KAAAgjZ,WAAA,GACAhjZ,KAAAm3V,WAAA,EACAn3V,KAAAkjZ,cAAA,EACAljZ,KAAAqjB,MAAA,GACA09C,GAAAA,EAAAx7D,OACAvF,KAAAuF,KAAAw7D,EAAAx7D,MAEAvF,KAAAm8L,GAAAq9M,cACAx5Y,KAAAjgB,OAOAlpF,YACA,GAAAmpG,KAAAigS,KACA,OACA,MAAA9jG,EAAAn8L,KAAAm8L,GACAn8L,KAAAigS,KAAA,CACA44G,EAAA7qa,GAAAmuN,EAAA,OAAAn8L,KAAAgzY,OAAAr6Y,KAAAqH,OACA64Y,EAAA7qa,GAAAmuN,EAAA,SAAAn8L,KAAAmjZ,SAAAxqZ,KAAAqH,OACA64Y,EAAA7qa,GAAAmuN,EAAA,QAAAn8L,KAAAwyH,QAAA75H,KAAAqH,OACA64Y,EAAA7qa,GAAAmuN,EAAA,QAAAn8L,KAAAmpO,QAAAxwO,KAAAqH,QAMA44E,aACA,QAAA54E,KAAAigS,KAOAppY,UACA,OAAAmpG,KAAAm3V,YAEAn3V,KAAAojZ,YACApjZ,KAAAm8L,GAAA,eACAn8L,KAAAm8L,GAAAp8M,OACA,SAAAigB,KAAAm8L,GAAAm9M,aACAt5Y,KAAAgzY,UALAhzY,KAWAnpG,OACA,OAAAmpG,KAAAg9X,UAQAnme,QAAAu/E,GAGA,OAFAA,EAAA0C,QAAA,WACAknB,KAAA64E,KAAAuqB,MAAApjG,KAAA5pB,GACA4pB,KAUAnpG,KAAAk1N,KAAA31I,GACA,GAAAwsa,EAAApoZ,eAAAuxH,GACA,MAAA,IAAAjzH,MAAA,IAAAizH,EAAA,8BAEA31I,EAAA0C,QAAAizI,GACA,MAAA4uR,EAAA,CACA7za,KAAAoxa,EAAAmL,WAAAC,MACA52V,KAAAt2E,EAEAzhF,QAAA,IACAgmf,EAAAhmf,QAAAyof,UAAA,IAAAp9Y,KAAAqjB,MAAA+5X,SAEA,mBAAAhna,EAAAA,EAAAnR,OAAA,KACAg/P,EAAA,iCAAAjkO,KAAA5mB,KACA4mB,KAAAijZ,KAAAjjZ,KAAA5mB,KAAAhD,EAAA6H,MACA08Z,EAAA12Z,GAAA+b,KAAA5mB,OAEA,MAAAmqa,EAAAvjZ,KAAAm8L,GAAAi+M,QACAp6Y,KAAAm8L,GAAAi+M,OAAAh9L,WACAp9M,KAAAm8L,GAAAi+M,OAAAh9L,UAAAjnF,SAYA,OAXAn2H,KAAAqjB,MAAAmgY,YAAAD,IAAAvjZ,KAAAm3V,WAEAlzH,EAAA,6DAEAjkO,KAAAm3V,UACAn3V,KAAA26Y,OAAAA,GAGA36Y,KAAAgjZ,WAAAl4a,KAAA6va,GAEA36Y,KAAAqjB,MAAA,GACArjB,KAQAnpG,OAAA8jf,GACAA,EAAAC,IAAA56Y,KAAA46Y,IACA56Y,KAAAm8L,GAAAsnN,QAAA9I,GAOA9jf,SACAotU,EAAA,kCACA,mBAAAjkO,KAAAuF,KACAvF,KAAAuF,MAAAmnD,IACA1sD,KAAA26Y,OAAA,CAAA7za,KAAAoxa,EAAAmL,WAAAK,QAAAh3V,KAAAA,OAIA1sD,KAAA26Y,OAAA,CAAA7za,KAAAoxa,EAAAmL,WAAAK,QAAAh3V,KAAA1sD,KAAAuF,OASA1uG,QAAA4iG,GACAuG,KAAAm3V,WACA5xU,MAAAszD,KAAA,gBAAAp/E,GASA5iG,QAAA++S,GACAquB,EAAA,aAAAruB,GACA51M,KAAAm3V,WAAA,EACAn3V,KAAAkjZ,cAAA,SACAljZ,KAAA/b,GACAshC,MAAAszD,KAAA,aAAA+8H,GAQA/+S,SAAA8jf,GAEA,GADAA,EAAAC,MAAA56Y,KAAA46Y,IAGA,OAAAD,EAAA7za,MACA,KAAAoxa,EAAAmL,WAAAK,QACA,GAAA/I,EAAAjuV,MAAAiuV,EAAAjuV,KAAAsvV,IAAA,CACA,MAAA/3Z,EAAA02Z,EAAAjuV,KAAAsvV,IACAh8Y,KAAA2jZ,UAAA1/Z,QAGAshC,MAAAszD,KAAA,gBAAA,IAAA//E,MAAA,8LAEA,MACA,KAAAo/Y,EAAAmL,WAAAC,MAGA,KAAApL,EAAAmL,WAAAO,aACA5jZ,KAAA6jZ,QAAAlJ,GACA,MACA,KAAAzC,EAAAmL,WAAAS,IAGA,KAAA5L,EAAAmL,WAAAU,WACA/jZ,KAAAgkZ,MAAArJ,GACA,MACA,KAAAzC,EAAAmL,WAAAY,WACAjkZ,KAAAkkZ,eACA,MACA,KAAAhM,EAAAmL,WAAAc,cACA,MAAA1qZ,EAAA,IAAAX,MAAA6hZ,EAAAjuV,KAAA/yE,SAEA8f,EAAAizD,KAAAiuV,EAAAjuV,KAAAA,KACAnnC,MAAAszD,KAAA,gBAAAp/E,IAUA5iG,QAAA8jf,GACA,MAAAvka,EAAAuka,EAAAjuV,MAAA,GACAu3K,EAAA,oBAAA7tP,GACA,MAAAuka,EAAA12Z,KACAggP,EAAA,mCACA7tP,EAAAtL,KAAAk1B,KAAAokZ,IAAAzJ,EAAA12Z,MAEA+b,KAAAm3V,UACAn3V,KAAAqkZ,UAAAjua,GAGA4pB,KAAA+iZ,cAAAj4a,KAAAt3E,OAAAc,OAAA8hF,IAGAv/E,UAAAu/E,GACA,GAAA4pB,KAAAskZ,eAAAtkZ,KAAAskZ,cAAAr/a,OAAA,CACA,MAAAwnI,EAAAzsG,KAAAskZ,cAAAl/a,QACA,IAAA,MAAA0nI,KAAAL,EACAK,EAAA1J,MAAApjG,KAAA5pB,GAGAmvC,MAAAszD,KAAAuqB,MAAApjG,KAAA5pB,GAOAv/E,IAAAotF,GACA,MAAAqb,EAAAU,KACA,IAAAovW,GAAA,EACA,OAAA,YAAAh5X,GAEAg5X,IAEAA,GAAA,EACAnrI,EAAA,iBAAA7tP,GACAkpB,EAAAq7Y,OAAA,CACA7za,KAAAoxa,EAAAmL,WAAAS,IACA7/Z,GAAAA,EACAyoE,KAAAt2E,MAUAv/E,MAAA8jf,GACA,MAAAyJ,EAAApkZ,KAAAijZ,KAAAtI,EAAA12Z,IACA,mBAAAmga,GACAngL,EAAA,yBAAA02K,EAAA12Z,GAAA02Z,EAAAjuV,MACA03V,EAAAhhT,MAAApjG,KAAA26Y,EAAAjuV,aACA1sD,KAAAijZ,KAAAtI,EAAA12Z,KAGAggP,EAAA,aAAA02K,EAAA12Z,IAQAptF,UAAAotF,GACAggP,EAAA,8BAAAhgP,GACA+b,KAAA/b,GAAAA,EACA+b,KAAAm3V,WAAA,EACAn3V,KAAAkjZ,cAAA,EACA39X,MAAAszD,KAAA,WACA74E,KAAAukZ,eAOA1tf,eACAmpG,KAAA+iZ,cAAA3uf,SAAAgiF,GAAA4pB,KAAAqkZ,UAAAjua,KACA4pB,KAAA+iZ,cAAA,GACA/iZ,KAAAgjZ,WAAA5uf,SAAAumf,GAAA36Y,KAAA26Y,OAAAA,KACA36Y,KAAAgjZ,WAAA,GAOAnsf,eACAotU,EAAA,yBAAAjkO,KAAA46Y,KACA56Y,KAAAstG,UACAttG,KAAAmpO,QAAA,wBASAtyU,UACAmpG,KAAAigS,OAEAjgS,KAAAigS,KAAA7rY,SAAA0mf,GAAAA,MACA96Y,KAAAigS,UAAAvqY,GAEAsqG,KAAAm8L,GAAA,SAAAn8L,MAQAnpG,aAWA,OAVAmpG,KAAAm3V,YACAlzH,EAAA,6BAAAjkO,KAAA46Y,KACA56Y,KAAA26Y,OAAA,CAAA7za,KAAAoxa,EAAAmL,WAAAY,cAGAjkZ,KAAAstG,UACAttG,KAAAm3V,WAEAn3V,KAAAmpO,QAAA,wBAEAnpO,KAQAnpG,QACA,OAAAmpG,KAAAsmH,aASAzvN,SAAAumf,GAEA,OADAp9Y,KAAAqjB,MAAA+5X,SAAAA,EACAp9Y,KASAwjZ,eAEA,OADAxjZ,KAAAqjB,MAAAmgY,UAAA,EACAxjZ,KASAnpG,MAAAi2M,GAGA,OAFA9sG,KAAAskZ,cAAAtkZ,KAAAskZ,eAAA,GACAtkZ,KAAAskZ,cAAAx5a,KAAAgiI,GACA9sG,KASAnpG,WAAAi2M,GAGA,OAFA9sG,KAAAskZ,cAAAtkZ,KAAAskZ,eAAA,GACAtkZ,KAAAskZ,cAAAxra,QAAAg0H,GACA9sG,KAQAnpG,OAAAi2M,GACA,IAAA9sG,KAAAskZ,cACA,OAAAtkZ,KAEA,GAAA8sG,EAAA,CACA,MAAAL,EAAAzsG,KAAAskZ,cACA,IAAA,IAAAn9a,EAAA,EAAAA,EAAAslI,EAAAxnI,OAAAkC,IACA,GAAA2lI,IAAAL,EAAAtlI,GAEA,OADAslI,EAAAhiI,OAAAtD,EAAA,GACA64B,UAKAA,KAAAskZ,cAAA,GAEA,OAAAtkZ,KAQAnpG,eACA,OAAAmpG,KAAAskZ,eAAA,sHCzcA,aACA9wf,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAu4W,QAAAv4W,EAAA24W,QAAA34W,EAAA+vf,WAAA/vf,EAAAi4M,cAAA,EACA,MAAAqtS,EAAArlf,EAAA,qBACAixf,EAAAjxf,EAAA,YACAkxf,EAAAlxf,EAAA,eACA0wU,EAAA1wU,EAAA,QAAAA,CAAA,oBAOA,IAAA8vf,EADA/vf,EAAAi4M,SAAA,EAEA,SAAA83S,GACAA,EAAAA,EAAA,QAAA,GAAA,UACAA,EAAAA,EAAA,WAAA,GAAA,aACAA,EAAAA,EAAA,MAAA,GAAA,QACAA,EAAAA,EAAA,IAAA,GAAA,MACAA,EAAAA,EAAA,cAAA,GAAA,gBACAA,EAAAA,EAAA,aAAA,GAAA,eACAA,EAAAA,EAAA,WAAA,GAAA,aAPA,CAQAA,EAAA/vf,EAAA+vf,aAAA/vf,EAAA+vf,WAAA,KAgEA/vf,EAAA24W,QA5DA,MAOAp1W,OAAAgoG,GAEA,OADAolO,EAAA,qBAAAplO,GACAA,EAAA/3B,OAAAu8a,EAAAC,OAAAzkZ,EAAA/3B,OAAAu8a,EAAAS,MACAW,EAAAC,UAAA7lZ,GAQA,CAAAmB,KAAA2kZ,eAAA9lZ,KAPAA,EAAA/3B,KACA+3B,EAAA/3B,OAAAu8a,EAAAC,MACAD,EAAAO,aACAP,EAAAU,WACA/jZ,KAAA4kZ,eAAA/lZ,IAQAhoG,eAAAgoG,GAEA,IAAArJ,EAAA,GAAAqJ,EAAA/3B,KAoBA,OAlBA+3B,EAAA/3B,OAAAu8a,EAAAO,cACA/kZ,EAAA/3B,OAAAu8a,EAAAU,aACAvuZ,GAAAqJ,EAAAgmZ,YAAA,KAIAhmZ,EAAA+7Y,KAAA,MAAA/7Y,EAAA+7Y,MACAplZ,GAAAqJ,EAAA+7Y,IAAA,KAGA,MAAA/7Y,EAAA5a,KACAuR,GAAAqJ,EAAA5a,IAGA,MAAA4a,EAAA6tD,OACAl3D,GAAA3tB,KAAAC,UAAA+2B,EAAA6tD,OAEAu3K,EAAA,mBAAAplO,EAAArJ,GACAA,EAOA3+F,eAAAgoG,GACA,MAAAimZ,EAAAN,EAAAO,kBAAAlmZ,GACAslL,EAAAnkL,KAAA2kZ,eAAAG,EAAAnK,QACAzrG,EAAA41G,EAAA51G,QAEA,OADAA,EAAAp2T,QAAAqrM,GACA+qH,IASA,MAAArjC,UAAA+sI,EACA/hf,cACA0uH,QAOA1uH,IAAAgoG,GACA,IAAA87Y,EACA,GAAA,iBAAA97Y,EACA87Y,EAAA36Y,KAAAglZ,aAAAnmZ,GACA87Y,EAAA7za,OAAAu8a,EAAAO,cACAjJ,EAAA7za,OAAAu8a,EAAAU,YAEA/jZ,KAAAilZ,cAAA,IAAAC,EAAAvK,GAEA,IAAAA,EAAAkK,aACAt/X,MAAAszD,KAAA,UAAA8hU,IAKAp1X,MAAAszD,KAAA,UAAA8hU,OAGA,CAAA,IAAA8J,EAAA5uE,SAAAh3U,KAAAA,EAAAgF,OAeA,MAAA,IAAA/K,MAAA,iBAAA+F,GAbA,IAAAmB,KAAAilZ,cACA,MAAA,IAAAnsZ,MAAA,oDAGA6hZ,EAAA36Y,KAAAilZ,cAAAE,eAAAtmZ,GACA87Y,IAEA36Y,KAAAilZ,cAAA,KACA1/X,MAAAszD,KAAA,UAAA8hU,KAcA9jf,aAAA2+F,GACA,IAAAruB,EAAA,EAEA,MAAAD,EAAA,CACAJ,KAAAX,OAAAqvB,EAAA+C,OAAA,KAEA,QAAA7iG,IAAA2tf,EAAAn8a,EAAAJ,MACA,MAAA,IAAAgyB,MAAA,uBAAA5xB,EAAAJ,MAGA,GAAAI,EAAAJ,OAAAu8a,EAAAO,cACA18a,EAAAJ,OAAAu8a,EAAAU,WAAA,CACA,MAAA/ua,EAAA7N,EAAA,EACA,KAAA,MAAAquB,EAAA+C,SAAApxB,IAAAA,GAAAquB,EAAAvwB,SACA,MAAAsrJ,EAAA/6H,EAAAsG,UAAA9mB,EAAA7N,GACA,GAAAopJ,GAAApqJ,OAAAoqJ,IAAA,MAAA/6H,EAAA+C,OAAApxB,GACA,MAAA,IAAA2xB,MAAA,uBAEA5xB,EAAA29a,YAAA1+a,OAAAoqJ,GAGA,GAAA,MAAA/6H,EAAA+C,OAAApxB,EAAA,GAAA,CACA,MAAA6N,EAAA7N,EAAA,EACA,OAAAA,GAAA,CAEA,GAAA,MADAquB,EAAA+C,OAAApxB,GAEA,MACA,GAAAA,IAAAquB,EAAAvwB,OACA,MAEAiC,EAAA0za,IAAAplZ,EAAAsG,UAAA9mB,EAAA7N,QAGAD,EAAA0za,IAAA,IAGA,MAAAx9Z,EAAAoY,EAAA+C,OAAApxB,EAAA,GACA,GAAA,KAAAiW,GAAAjX,OAAAiX,IAAAA,EAAA,CACA,MAAApI,EAAA7N,EAAA,EACA,OAAAA,GAAA,CACA,MAAAsF,EAAA+oB,EAAA+C,OAAApxB,GACA,GAAA,MAAAsF,GAAAtG,OAAAsG,IAAAA,EAAA,GACAtF,EACA,MAEA,GAAAA,IAAAquB,EAAAvwB,OACA,MAEAiC,EAAA+c,GAAA9d,OAAAqvB,EAAAsG,UAAA9mB,EAAA7N,EAAA,IAGA,GAAAquB,EAAA+C,SAAApxB,GAAA,CACA,MAAAyyI,EAqCA,SAAApkH,GACA,IACA,OAAA3tB,KAAAoH,MAAAumB,GAEA,MAAAzhG,GACA,OAAA,GA1CAg5I,CAAAv3C,EAAA3vB,OAAAsB,IACA,IAAA0kS,EAAAu5I,eAAAl+a,EAAAJ,KAAA8yI,GAIA,MAAA,IAAA9gH,MAAA,mBAHA5xB,EAAAwlF,KAAAktD,EAOA,OADAqqH,EAAA,mBAAAzuO,EAAAtuB,GACAA,EAEArwE,sBAAAiwE,EAAA8yI,GACA,OAAA9yI,GACA,KAAAu8a,EAAAK,QACA,MAAA,iBAAA9pS,EACA,KAAAypS,EAAAY,WACA,YAAAvuf,IAAAkkN,EACA,KAAAypS,EAAAc,cACA,MAAA,iBAAAvqS,GAAA,iBAAAA,EACA,KAAAypS,EAAAC,MACA,KAAAD,EAAAO,aACA,OAAA/lZ,MAAA/gB,QAAA88H,IAAAA,EAAA30I,OAAA,EACA,KAAAo+a,EAAAS,IACA,KAAAT,EAAAU,WACA,OAAAlmZ,MAAA/gB,QAAA88H,IAMA/iN,UACAmpG,KAAAilZ,eACAjlZ,KAAAilZ,cAAAI,0BAIA/xf,EAAAu4W,QAAAA,EAiBA,MAAAq5I,EACAruf,YAAA8jf,GACA36Y,KAAA26Y,OAAAA,EACA36Y,KAAAkvS,QAAA,GACAlvS,KAAAslZ,UAAA3K,EAUA9jf,eAAA0uf,GAEA,GADAvlZ,KAAAkvS,QAAApkU,KAAAy6a,GACAvlZ,KAAAkvS,QAAAjqU,SAAA+6B,KAAAslZ,UAAAT,YAAA,CAEA,MAAAlK,EAAA6J,EAAAgB,kBAAAxlZ,KAAAslZ,UAAAtlZ,KAAAkvS,SAEA,OADAlvS,KAAAqlZ,yBACA1K,EAEA,OAAA,KAKA9jf,yBACAmpG,KAAAslZ,UAAA,KACAtlZ,KAAAkvS,QAAA,mHCrRA,aACA17Y,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAkyf,kBAAAlyf,EAAAyxf,uBAAA,EACA,MAAAN,EAAAlxf,EAAA,eAiBA,SAAAkyf,EAAA/4V,EAAAwiP,GACA,IAAAxiP,EACA,OAAAA,EACA,GAAA+3V,EAAA5uE,SAAAnpR,GAAA,CACA,MAAA3xB,EAAA,CAAA2qX,cAAA,EAAAh0Y,IAAAw9R,EAAAjqU,QAEA,OADAiqU,EAAApkU,KAAA4hF,GACA3xB,EAEA,GAAAl9B,MAAA/gB,QAAA4vE,GAAA,CACA,MAAAwiQ,EAAA,IAAArxT,MAAA6uD,EAAAznF,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAAulF,EAAAznF,OAAAkC,IACA+nV,EAAA/nV,GAAAs+a,EAAA/4V,EAAAvlF,GAAA+nU,GAEA,OAAAggB,EAEA,GAAA,iBAAAxiQ,KAAAA,aAAA3uD,MAAA,CACA,MAAAmxT,EAAA,GACA,IAAA,MAAAl6Z,KAAA03J,EACAA,EAAAlyD,eAAAxlG,KACAk6Z,EAAAl6Z,GAAAywf,EAAA/4V,EAAA13J,GAAAk6Y,IAGA,OAAAggB,EAEA,OAAAxiQ,EAgBA,SAAAi5V,EAAAj5V,EAAAwiP,GACA,IAAAxiP,EACA,OAAAA,EACA,GAAAA,GAAAA,EAAAg5V,aACA,OAAAx2G,EAAAxiP,EAAAh7C,KAEA,GAAA7T,MAAA/gB,QAAA4vE,GACA,IAAA,IAAAvlF,EAAA,EAAAA,EAAAulF,EAAAznF,OAAAkC,IACAulF,EAAAvlF,GAAAw+a,EAAAj5V,EAAAvlF,GAAA+nU,QAGA,GAAA,iBAAAxiP,EACA,IAAA,MAAA13J,KAAA03J,EACAA,EAAAlyD,eAAAxlG,KACA03J,EAAA13J,GAAA2wf,EAAAj5V,EAAA13J,GAAAk6Y,IAIA,OAAAxiP,EA3DAp5J,EAAAyxf,kBARA,SAAApK,GACA,MAAAzrG,EAAA,GACA02G,EAAAjL,EAAAjuV,KACAy3H,EAAAw2N,EAGA,OAFAx2N,EAAAz3H,KAAA+4V,EAAAG,EAAA12G,GACA/qH,EAAA0gO,YAAA31G,EAAAjqU,OACA,CAAA01a,OAAAx2N,EAAA+qH,QAAAA,IA0CA57Y,EAAAkyf,kBALA,SAAA7K,EAAAzrG,GAGA,OAFAyrG,EAAAjuV,KAAAi5V,EAAAhL,EAAAjuV,KAAAwiP,GACAyrG,EAAAkK,iBAAAnvf,EACAilf,sDCzDA,aACAnnf,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAAoxf,UAAApxf,EAAAuib,cAAA,EACA,MAAA2qE,EAAA,mBAAAviR,YAMA7/H,EAAA5qG,OAAAmqG,UAAAS,SACAmiZ,EAAA,mBAAAllP,MACA,oBAAAA,MACA,6BAAAj9J,EAAAR,KAAAy9J,MACAwqP,EAAA,mBAAArjJ,MACA,oBAAAA,MACA,6BAAApkQ,EAAAR,KAAA4kQ,MAMA,SAAAqzE,EAAAh3U,GACA,OAAA2hZ,IAAA3hZ,aAAAo/H,aAlBA,CAAAp/H,GACA,mBAAAo/H,YAAAC,OACAD,YAAAC,OAAAr/H,GACAA,EAAAgxG,kBAAAouB,YAeAC,CAAAr/H,KACA0hZ,GAAA1hZ,aAAAw8J,MACAwqP,GAAAhnZ,aAAA2jQ,KAEAlvW,EAAAuib,SAAAA,EA4BAvib,EAAAoxf,UA3BA,SAAAA,EAAA7lZ,EAAAzX,GACA,IAAAyX,GAAA,iBAAAA,EACA,OAAA,EAEA,GAAAhB,MAAA/gB,QAAA+hB,GAAA,CACA,IAAA,IAAA13B,EAAA,EAAA4hB,EAAA8V,EAAA55B,OAAAkC,EAAA4hB,EAAA5hB,IACA,GAAAu9a,EAAA7lZ,EAAA13B,IACA,OAAA,EAGA,OAAA,EAEA,GAAA0uW,EAAAh3U,GACA,OAAA,EAEA,GAAAA,EAAAzX,QACA,mBAAAyX,EAAAzX,QACA,IAAA/Q,UAAApR,OACA,OAAAy/a,EAAA7lZ,EAAAzX,UAAA,GAEA,IAAA,MAAApyF,KAAA6pG,EACA,GAAArrG,OAAAmqG,UAAAnD,eAAAoD,KAAAiB,EAAA7pG,IAAA0vf,EAAA7lZ,EAAA7pG,IACA,OAAA,EAGA,OAAA,iCCpDA,aACAxB,OAAAC,eAAAH,EAAA,aAAA,CAAAI,OAAA,IACAJ,EAAA06E,QAAA,EAOA16E,EAAA06E,GANA,SAAA6wB,EAAAktH,EAAAnnI,GAEA,OADAia,EAAA7wB,GAAA+9I,EAAAnnI,GACA,WACAia,EAAA02H,IAAAxJ,EAAAnnI,mCCaA,SAAAk0Z,EAAA/3U,GACAA,EAAAA,GAAA,GACA/gE,KAAA8vH,GAAA/uD,EAAA9mE,KAAA,IACA+F,KAAAr6B,IAAAo7F,EAAAp7F,KAAA,IACAq6B,KAAAmoV,OAAApnR,EAAAonR,QAAA,EACAnoV,KAAAq5Y,OAAAt4U,EAAAs4U,OAAA,GAAAt4U,EAAAs4U,QAAA,EAAAt4U,EAAAs4U,OAAA,EACAr5Y,KAAAs8X,SAAA,EApBAjpe,EAAAC,QAAAwlf,EA8BAA,EAAAn7Y,UAAAoqE,SAAA,WACA,IAAA+nD,EAAA9vH,KAAA8vH,GAAAlqJ,KAAAy5J,IAAAr/H,KAAAmoV,OAAAnoV,KAAAs8X,YACA,GAAAt8X,KAAAq5Y,OAAA,CACA,IAAAroN,EAAAprN,KAAAwoC,SACA4hX,EAAApqZ,KAAA6nC,MAAAujL,EAAAhxL,KAAAq5Y,OAAAvpR,GACAA,EAAA,IAAA,EAAAlqJ,KAAA6nC,MAAA,GAAAujL,IAAAlhE,EAAAkgQ,EAAAlgQ,EAAAkgQ,EAEA,OAAA,EAAApqZ,KAAAq0B,IAAA61H,EAAA9vH,KAAAr6B,MASAmza,EAAAn7Y,UAAAsoE,MAAA,WACAjmE,KAAAs8X,SAAA,GASAwc,EAAAn7Y,UAAAk8Y,OAAA,SAAA5/Y,GACA+F,KAAA8vH,GAAA71H,GASA6+Y,EAAAn7Y,UAAAs8Y,OAAA,SAAAt0a,GACAq6B,KAAAr6B,IAAAA,GASAmza,EAAAn7Y,UAAAo8Y,UAAA,SAAAV,GACAr5Y,KAAAq5Y,OAAAA,iCClFA,aAEA,MAAA5rD,EAAAl6b,EAAA,sBACAuyf,EAAAvyf,EAAA,iBACA4re,cAAAA,GAAA5re,EAAA,eACA6re,EAAA7re,EAAA,yCAEA0wU,EAAA1wU,EAAA,SACA84N,EAAA43G,EAAA,6BACA53G,EAAA98I,MAAA00P,EAAA,mCAEA,MAAA8hL,EAAA,CAAA7nM,EAAAz4M,KACA,GAAAy4M,GAAAz4M,EAEA,IACA,OAAA25X,EAAAlhL,EAAAz4M,GACA,MAAAhM,GAGA,OAFA4yH,EAAA98I,MAAAkqB,GAEA2lY,EAAA,UAAA35X,KAMApyG,EAAAC,QAAA,CAAA4pe,EAAAvoe,EAAA,MACA,MAAAw1Y,KAAAA,EAAAp1T,OAAAA,GAAA+wa,EAAAz7G,OAAA6yF,GAGAhkC,EAAAvkc,EAAAukc,YAAA6sD,EAAA7oB,EAAAS,cAAAT,EAAAqC,YACA9rB,EAAAsyC,EAAA7oB,EAAAmC,aAAAnC,EAAAoC,WAEA3rB,EAAA,CACA98c,WAAAk+E,GACApgF,EAAAk7N,SACA96I,EAAA04W,EAAA14W,EAAApgF,EAAAk7N,SAGA,UACAs6K,EAAA,kBACA,UAAA,MAAA16R,KAAA16B,QAEA06B,aAAAgpH,WAAAhpH,EAAAA,EAAArqC,QAHA,IAMA,MAAAq0B,GAEA,YAAAA,EAAA3yB,MAIAulJ,EAAA98I,MAAAkqB,KAKA1kB,OAAApgF,EAAAk7N,OAAA49N,EAAA14W,EAAApgF,EAAAk7N,QAAA96I,EAEAw1W,KAAA2yC,EAEAzpB,UAAAA,EACAva,WAAAA,EAEAub,SAAA,CAAA10X,KAAAge,KAAAunE,OAEAzuK,QACA,IAAAqme,EAAAt0S,UAEA,OAAA,IAAA7iB,SAAA,CAAAC,EAAAu5B,KACA,MAAAvqH,EAAA+oB,KAAAunE,MAIAwF,EAAAD,YAAA,KACA,GAAA8oS,EAAAza,WAAA,CACA,MAAA1zV,KAAAA,EAAAC,KAAAA,GAAAkuW,EAAAza,WAAAC,YACA9sO,EAAA,qEACA7mH,EAAAC,EAAA1H,KAAAunE,MAAAtwF,GAGAkoZ,EAAAt0S,WACAs0S,EAAA5vR,YAEA6xR,GAEAjC,EAAAt2Q,KAAA,SAAA,KACA5gD,OAGAk3T,EAAAl4Z,KAAAy0B,IAIA,GAHAw2H,aAAAnlD,GAEA6oS,EAAAc,SAAAz0X,MAAA+d,KAAAunE,MACA7rE,EAAA,OAAA8lG,EAAA9lG,WAeA,OATAyjY,EAAAt2Q,KAAA,SAAA,KAIA+sP,EAAAc,SAAAz0X,QACA2zX,EAAAc,SAAAz0X,MAAA+d,KAAAunE,UAIAquS,wKC5GAtgd,EAAAC,QAAAC,EAAA,YACAF,EAAAC,QAAAyhF,OAAAxhF,EAAA,YACAF,EAAAC,QAAA62Y,KAAA52Y,EAAA,UACAF,EAAAC,QAAA6wF,UAAA5wF,EAAA,eACAF,EAAAC,QAAA+2Y,OAAA92Y,EAAA,sHCJAF,EAAAC,QAAAizU,IAEA,GAAAA,EAAArwU,OAAAy6N,eAAA,OAAA41G,EAGA,GAAAA,EAAAx1G,UACA,OAAA,kBACA,MAAAD,EAAAy1G,EAAAx1G,YAEA,IACA,OAAA,CACA,MAAAjnD,KAAAA,EAAAp2K,MAAAA,SAAAo9N,EAAAE,OACA,GAAAlnD,EAAA,aACAp2K,GAEA,QACAo9N,EAAAG,eAVA,GAeA,MAAA,IAAAn4H,MAAA,iDCrBA,MAAA2sS,EAAAlyY,EAAA,gBAEAF,EAAAC,QAAA6iO,GAAA7iF,MAAAA,IACAv+D,EAAA0wT,EAAA1wT,GAEA,MAAAixa,EAAAjxa,IACA,mBAAAA,EAAA67I,QAAA77I,EAAA67I,UAGA,IAAArhJ,EAAA,KACAy4T,EAAA,KACA,MAAApxN,EAAAn9E,IACAlqB,EAAAkqB,EACAuuS,GAAAA,EAAAvuS,GAEAusZ,EAAAjxa,IAGA,IAAAkxa,EAAA,KACAnwK,GAAA,EACA,MAAAowK,EAAA,KACApwK,GAAA,EACAmwK,GAAAA,KAGA,IAAAE,EAAA,KACAziL,GAAA,EACA,MAAA0iL,EAAA,KACA1iL,GAAA,EACAyiL,GAAAA,KAGA,IAAAl+G,EAAA,KACA,MAAAo+G,EAAA,KACAp+G,GAAAA,KA4BA9xK,EAAAvP,KAAA,QAAAhwC,GACAu/C,EAAAvP,KAAA,QAAAs/R,GACA/vR,EAAAvP,KAAA,SAAAw/R,GAEA,IACA,UAAA,MAAA1yf,KAAAqhF,EAAA,CACA,IAAAohJ,EAAAA,UAAAA,EAAAvtC,WAAAr5G,EAAA,OAEA,IAAA4mJ,EAAAwuB,MAAAjxP,UAhCA,IAAAqyK,SAAA,CAAAC,EAAAu5B,KACA0mT,EAAAh+G,EAAAjiO,EACAgiO,EAAAzoM,EACA42B,EAAAvP,KAAA,QAAAy/R,OAiCA,MAAA5sZ,GAEAlqB,GACA4mJ,EAAA7oB,UAIA/9H,EAAAkqB,EAGA,IAUA,GARA08H,EAAAA,UACAA,EAAAnxJ,YAxCAghb,EAAAjxa,GACA,IAAAgxF,SAAA,CAAAC,EAAAu5B,KACA,GAAAu2I,GAAApS,GAAAn0P,EAAA,OAAAy2F,IACAmgV,EAAAF,EAAAjgV,EACAgiO,EAAAzoM,MA2CAhwH,EAAA,MAAAA,EACA,QAvCA4mJ,EAAAX,eAAA,QAAA5+C,GACAu/C,EAAAX,eAAA,QAAA0wR,GACA/vR,EAAAX,eAAA,SAAA4wR,GACAjwR,EAAAX,eAAA,QAAA6wR,yDC3DA,MAAAC,EAAA/yf,EAAA,YAEAF,EAAAC,QAAA6wF,GAAAmvD,gBAAAv+D,GACA,MAAAs1T,EAAAi8G,EAAAnia,GAIAkmT,EAAAF,KAAAp1T,GAAAmpB,OAAA/iB,cACAkvT,EAAAt1T,wDCRA,MAAAwxa,EAAAhzf,EAAA,UACAizf,EAAAjzf,EAAA,YAEAF,EAAAC,QAAA+2Y,IAAA,CAAAF,KAAAo8G,EAAAl8G,GAAAt1T,OAAAyxa,EAAAn8G,sECHA,aAEA,MAAAlvF,UAAAA,GAAA5nT,EAAA,aA4CAF,EAAAC,QAAA,CACAu5e,YA3CA,SAAAvpG,GACA,MAAAmjH,EAAAnjH,EAAAllS,WAAAte,MAAA,KACA4ma,EAAApjH,EAAA/lF,SAAA,GAAA1qT,KACA8zf,EAAArjH,EAAA/lF,SAAA,GAAA1qT,KACA+zf,EAAAtjH,EAAAxlF,eAAA,GAAA,GAEA,GAAA,QAAA4oM,GAAA,OAAAC,GAAA,QAAAA,EACA,MAAA,IAAA7tZ,MAAA,sBAAAwqS,EAAAllS,YAGA,OAAA+8M,EAAA0rM,OAAAvjH,GAIA,OAAAqjH,EACA,UAAAF,EAAA,IAAA,OAAAG,EAAA,GAAA,IAAAA,GAGA,QAAAD,EACA,WAAAF,EAAA,IAAA,QAAAG,EAAA,GAAA,IAAAA,QADA,EAPA,UAAAH,EAAA,GAAA,IAAAA,EAAA,IAiCA7Z,eArBA,SAAAqB,GACA,MAAAtuO,EAAA,sBAEA,IAAA,IAAAsuO,EAAAzia,QAAAm0L,GAAA,CACAsuO,EAAAA,EAAAnyY,UAAA6jK,EAAA16L,OAAAgpa,EAAAhpa,QACA,IAAAq+T,EAAA,IAAAnoF,EAAA8yL,GACA,MAAA6Y,EAAAxjH,EAAAxlF,eAAA/vO,QAAAkvJ,GACA,MAAAA,EAAA,KACA,GAEAqmK,EAAAA,EAAAwqE,YAAA,OACAxqE,EAAAA,EAAA+wE,YAAA,oBACA/wE,EAAAA,EAAA+wE,YAAA,QAAAyyC,EAAA,MACA7Y,EAAA3qG,EAAAllS,WAGA,OAAA6vY,mDC3CA,aAEA56e,EAAAC,QAAAC,EAAA,0DCFA,aAEA,MAAAk1U,EAAAl1U,EAAA,WACAooY,EAAApoY,EAAA,eACA84N,EAAA94N,EAAA,QAAAA,CAAA,gBACAk6b,EAAAl6b,EAAA,sBACAwzf,EAAAxzf,EAAA,WACAyzf,EAAAzzf,EAAA,oBACA0zf,aAAAA,EAAAC,iBAAAA,GAAA3zf,EAAA,mBACA4zf,EAAA5zf,EAAA,YAEA,MAAA6zf,EAQAvwf,YAAAlC,GAEAA,EAAA,mBADAA,EAAAA,GAAA,IACA,CAAA28d,SAAA38d,GAAAA,EAEAqrG,KAAAqnZ,UAAA,EACArnZ,KAAAsnZ,SAAA,CAIAC,WAAA,IAAAvka,IAIAwka,UAAA,IAAAxka,KAEAgd,KAAA2hE,SAAAhtK,EAKAqrG,KAAAmqS,KAAAnqS,KAAAynZ,cAKAznZ,KAAAjrB,OAAAirB,KAAA0nZ,gBAKA1nZ,KAAAsxX,SAAA38d,EAAA28d,SAKAtxX,KAAA4xX,YAAAj9d,EAAAi9d,YAQA57I,cAEA,MAAAA,EAAA,GAOA,OANAh2O,KAAAsnZ,SAAAC,WAAAnzf,SAAAo8N,IACAwlH,EAAAlrQ,KAAA0lJ,MAEAxwH,KAAAsnZ,SAAAE,UAAApzf,SAAAo8N,IACAwlH,EAAAlrQ,KAAA0lJ,MAEAwlH,EAUAn/U,UAAAhE,GACA,MAAAoxF,EAAA+b,KAAAqnZ,YACAx0f,EAAA,MAAAA,EAAAoxF,EAAAma,WAAA/3B,OAAAxzE,GACA,MAAAmmM,EAAAh5F,KAAAsnZ,SAAAC,WACA,OAAAvnZ,KAAAuzX,WAAA,CAAAtvY,GAAAA,EAAApxF,KAAAA,EAAAi0E,KAAA,YAAAkyH,SAAAA,IAYAniM,oBAAAotF,GAAAA,EAAApxF,KAAAA,IACA,MAAAmmM,EAAAh5F,KAAAsnZ,SAAAE,UACA,OAAAxnZ,KAAAuzX,WAAA,CAAAtvY,GAAAA,EAAApxF,KAAAA,EAAAi0E,KAAA,WAAAkyH,SAAAA,IAcAniM,YAAAotF,GAAAA,EAAApxF,KAAAA,EAAAi0E,KAAAA,EAAAkyH,SAAAA,IACA,GAAAA,EAAAj6G,IAAAkF,GACA,MAAA,IAAA6U,MAAA,GAAAhyB,YAAAmd,qBAEAooI,EAAA,sBAAAvlJ,EAAAmd,EAAApxF,GACA,MAWA29N,EAAA22R,EAAA,CAAAlja,GAAAA,EAAApxF,KAAAA,EAAA8/N,KAXAljJ,IACA48I,EAAAswG,SACAtwG,EAAA,uBAAAvlJ,EAAAmd,EAAApxF,EAAA,IAAA48E,EAAA3I,KAAAogb,EAAAz3a,EAAA3I,MAAA4lF,KAAAj9E,EAAAi9E,MAAAj9E,EAAAi9E,KAAAtnF,UAEA46B,KAAAjrB,OAAAjK,KAAA2E,IAOA3I,KAAAA,EAAAqkG,MALA,KACAkhD,EAAA,wBAAAvlJ,EAAAmd,EAAApxF,GACAmmM,EAAAv1G,OAAAQ,GACA+b,KAAA4xX,aAAA5xX,KAAA4xX,YAAAphQ,IAEAm3R,WAAA3nZ,KAAA2hE,SAAAgmV,aAEA,OADA3uT,EAAAv3G,IAAAwC,EAAAusI,GACAA,EAUA35N,cACA,OAAAy8I,MAAAA,IACAtzC,KAAA2hE,SAAAkuD,SACA96I,EAAA04W,EAAA14W,EAAAirB,KAAA2hE,SAAAkuD,SAGA,UACA44G,EACA1zP,EACAgya,EAAA3iZ,OACA4iZ,EAAAhnZ,KAAA2hE,SAAAgmV,aACAr0W,MAAAA,IACA,UAAA,MAAAw3S,KAAA/1W,EACA,IAAA,MAAAtF,KAAAq7W,EACA9qV,KAAA4nZ,gBAAAn4a,MAKA,MAAAgqB,GAEA,OADA4yH,EAAA,gBAAA5yH,GACAuG,KAAAjrB,OAAA/P,IAAAy0B,GAGAuG,KAAAjrB,OAAA/P,OAWAnuE,gBACA,MAMAk+E,EAAA4mT,EAAA,CAAAxwN,MANA1xE,IACA,MAAA8tZ,WAAAA,EAAAC,UAAAA,GAAAxnZ,KAAAsnZ,SAEA,IAAA,MAAApra,KAAAqra,EAAAnqZ,SAAAlhB,EAAA82D,MAAAv5C,GACA,IAAA,MAAAvd,KAAAsra,EAAApqZ,SAAAlhB,EAAA82D,MAAAv5C,IAEAi3O,QAAA,IACA,OAAAl9U,OAAAiqG,OAAAspZ,EAAAzjZ,OAAAvuB,GAAA,CACAjK,KAAAiK,EAAAjK,KACA9F,IAAA+P,EAAA/P,IACA4rJ,OAAA77I,EAAA67I,SAYA/5N,iBAAAotF,GAAAA,EAAAnd,KAAAA,EAAA4lF,KAAAA,IAMA,GALA2/D,EAAAswG,SACAtwG,EAAA,mBAAA,CAAApoI,GAAAA,EAAAnd,KAAAogb,EAAApgb,GAAA4lF,KAAAA,EAAAtnF,UAIA0B,IAAAmgb,EAAAY,YAAA7nZ,KAAAsxX,SAAA,CACA,MAAA9gQ,EAAAxwH,KAAA8nZ,mBAAA,CAAA7ja,GAAAA,EAAApxF,KAAA65J,EAAAtuD,aACA,OAAA4B,KAAAsxX,SAAA9gQ,GAGA,MACAA,GADA,EAAA1pJ,EAAAk5B,KAAAsnZ,SAAAC,WAAAvnZ,KAAAsnZ,SAAAE,WACAhma,IAAAyC,GAEA,IAAAusI,EAAA,OAAAnE,EAAA,oBAAApoI,GAEA,OAAAnd,GACA,KAAAmgb,EAAAc,kBACA,KAAAd,EAAAe,iBACAx3R,EAAAz7I,OAAAjK,KAAA4hF,GACA,MACA,KAAAu6V,EAAAgB,gBACA,KAAAhB,EAAAiB,eACA13R,EAAAxwI,QACA,MACA,KAAAina,EAAAkB,gBACA,KAAAlB,EAAAmB,eACA53R,EAAAvqD,QACA,MACA,QACAomD,EAAA,0BAAAvlJ,KAKAsgb,EAAAh5R,WAAA,eAEA/6N,EAAAC,QAAA8zf,2MC5OA,aAEA9zf,EAAAgwG,OAAA/vG,EAAA,YACAD,EAAA8wG,OAAA7wG,EAAA,+ECHA,aAEA,MAAAooO,EAAApoO,EAAA,UACA+wU,EAAA/wU,EAAA,iBAEA80f,EAAA,MAsCA,MAAAt+I,EAAA,IApCA,MACAlzW,cACAmpG,KAAAsoZ,MAAA,IAAA7vR,WAAA4vR,GACAroZ,KAAAuoZ,YAAA,EASA1xf,MAAA44E,GACA,MAAAg0K,EAAAzjJ,KAAAsoZ,MACA,IAAAvjb,EAAAi7B,KAAAuoZ,YAEA5sR,EAAAr4H,OAAA7zB,EAAAwU,IAAA,EAAAxU,EAAA3I,KAAA28K,EAAA1+K,GACAA,GAAA42J,EAAAr4H,OAAAq1H,MACAgD,EAAAr4H,OAAA7zB,EAAAi9E,KAAAj9E,EAAAi9E,KAAAznF,OAAA,EAAAw+K,EAAA1+K,GACAA,GAAA42J,EAAAr4H,OAAAq1H,MAEA,MAAA6xC,EAAA/mB,EAAAtnB,SAAAn8H,KAAAuoZ,YAAAxjb,GASA,OAPAsjb,EAAAtjb,EAAA,KACAi7B,KAAAsoZ,MAAA,IAAA7vR,WAAA4vR,GACAroZ,KAAAuoZ,YAAA,GAEAvoZ,KAAAuoZ,YAAAxjb,EAGA0K,EAAAi9E,KAEA,CAAA89G,EAAA/6L,EAAAi9E,MAFA89G,IASAn3Q,EAAAC,QAAAyhF,GAAA,kBACA,UAAA,MAAAtF,KAAAsF,EACA8oB,MAAA/gB,QAAArN,SACA,IAAA60P,EAAA70P,EAAArF,KAAA8U,GAAA6qR,EAAAplH,MAAAzlK,YAEA,IAAAolP,EAAAylC,EAAAplH,MAAAl1K,IALA,qEC9CA,aAEA,MAAAksJ,EAAApoO,EAAA,UACA+wU,EAAA/wU,EAAA,iBAGAF,EAAAC,QAAAyhF,GAAA,kBACA,MAAAs7I,EAAA,IAAAw7I,EACA,UAAA,MAAAp8P,KAAA16B,EAAA,CACA,MAAA+1W,EAAAz6N,EAAAs0B,MAAAl1I,GACAq7U,EAAA7lX,eAAA6lX,IAJA,GAQA,MAAAj/E,EACAh1W,cACAmpG,KAAA2gP,QAAA,IAAArc,EAEAtkO,KAAAwoZ,aAAA,IAAA3rT,MAAA,GAAA,CACAr7G,IAAA,CAAArG,EAAAxC,IAAA,MAAAA,EAAA,GAAAqnB,KAAA2gP,QAAAhoQ,GAAAqnB,KAAA2gP,QAAAn/P,IAAApb,SAAAuS,MAEAqnB,KAAAyoZ,YAAA,KAOA5xf,MAAA44G,GACA,IAAAA,IAAAA,EAAAxqC,OAAA,MAAA,GAEA+6B,KAAA2gP,QAAA+tD,OAAAj/R,GACA,MAAAq7U,EAAA,GAEA,OAAA,CACA,IAAA9qV,KAAAyoZ,YACA,IACAzoZ,KAAAyoZ,YAAAzoZ,KAAA0oZ,cAAA1oZ,KAAAwoZ,cACA,MAAArta,GACA,MAIA,MAAA8I,GAAAA,EAAAnd,KAAAA,EAAA7B,OAAAA,EAAAF,OAAAA,GAAAi7B,KAAAyoZ,YAGA,GAFAzoZ,KAAA2gP,QAAA17Q,OAAAF,EAEAE,EAAA,MAEA6lX,EAAAhgX,KAAA,CAAAmZ,GAAAA,EAAAnd,KAAAA,EAAA4lF,KAAA1sD,KAAA2gP,QAAAovD,aAAAhrU,EAAAA,EAAAE,KAEA+6B,KAAA2gP,QAAAzY,QAAAnjQ,EAAAE,GACA+6B,KAAAyoZ,YAAA,KAGA,OAAA39D,EAUAj0b,cAAA61J,GACA,MAAA+a,EAAAk0D,EAAAv3H,OAAAsoD,GACA,IAAA3nF,EAAA42J,EAAAv3H,OAAAu0H,MACA,MAAA1zJ,EAAA02J,EAAAv3H,OAAAsoD,EAAA3nF,GAEA,OADAA,GAAA42J,EAAAv3H,OAAAu0H,MACA,CAAA10I,GAAAwjF,GAAA,EAAA3gG,KAAA,EAAA2gG,EAAA1iG,OAAAA,EAAAE,OAAAA,yECrEA,aAEA,MAAA0jb,EAAA,GAAA,GASAt1f,EAAAC,QAAAqyE,IACAA,EAAAA,GAAAgjb,EAEA,MAAAC,EAAAn5a,IACA,GAAAA,EAAAi9E,MAAAj9E,EAAAi9E,KAAAznF,OAAAU,EACA,MAAAnyE,OAAAiqG,OAAA,IAAA3E,MAAA,2BAAA,CAAAzjG,KAAA,qBAIA,OAAA0/E,GACA,kBACA,UAAA,MAAAtF,KAAAsF,EACA8oB,MAAA/gB,QAAArN,GACAA,EAAAr7E,QAAAw0f,GAEAA,EAAAn5a,SAEAA,EAPA,IAaAp8E,EAAAC,QAAAq1f,aAAAA,gCClCA,aAEA,MAAA1B,EAAAzzf,OAAAc,OAAA,CACAuzf,WAAA,EACAG,iBAAA,EACAD,kBAAA,EACAG,eAAA,EACAD,gBAAA,EACAG,eAAA,EACAD,gBAAA,IAGA70f,EAAA2zf,aAAAA,EAEA3zf,EAAAu1f,sBAAAr1f,OAAAc,OAAA,CACAuzf,WAAAZ,EAAAY,WACAiB,QAAA7B,EAAAc,kBACAgB,MAAA9B,EAAAgB,gBACAe,MAAA/B,EAAAkB,kBAGA70f,EAAA21f,qBAAAz1f,OAAAc,OAAA,CACAw0f,QAAA7B,EAAAe,iBACAe,MAAA9B,EAAAiB,eACAc,MAAA/B,EAAAmB,iBAGA90f,EAAA4zf,iBAAA1zf,OAAAc,OACAd,OAAA0pG,QAAA+pZ,GAAAvhb,QAAA,CAAAm5B,EAAA9qG,KACA8qG,EAAA9qG,EAAA,IAAAA,EAAA,GACA8qG,IACA,mCC/BA,aAEA,MAAA4uV,EAAAl6b,EAAA,sBACA67N,EAAA77N,EAAA,oBACA84N,EAAA94N,EAAA,QAAAA,CAAA,uBACAooY,EAAApoY,EAAA,eACA+wU,EAAA/wU,EAAA,iBACAupT,EAAAvpT,EAAA,aACAo1f,aAAAA,GAAAp1f,EAAA,oBACAs1f,sBAAAA,EAAAI,qBAAAA,GAAA11f,EAAA,mBAEA21f,EAAA,yBAaA71f,EAAAC,QAAA,EAAA2wF,GAAAA,EAAApxF,KAAAA,EAAA8/N,KAAAA,EAAAxnD,MAAAA,EAAA,SAAArkG,KAAAA,EAAA,YAAA6gb,WAAAA,EAAAgB,MACA,MAAA/4R,EAAA,IAAAR,EACA+5R,EAAA,IAAA/5R,EACAg6R,EAAA,cAAAtib,EAAA+hb,EAAAI,EACAI,EAAA,cAAAvib,EAAA,IAAAmd,IAAA,IAAAA,IAEApxF,EAAAwzE,OAAA,MAAAxzE,EAAAoxF,EAAApxF,GAEA,IAEAy2f,EAFAC,GAAA,EACAC,GAAA,EAGA,MAWAC,EAAAhwZ,IACA+vZ,IACAA,GAAA,EACAn9R,EAAA,wBAAAvlJ,EAAAj0E,EAAA4mG,GACAA,IAAA6vZ,IAAAA,EAAA7vZ,GACA8vZ,IACA/4R,EAAAikP,SAAAz0X,MAAA+d,KAAAunE,MACA6F,EAAAm+U,MAIA94R,EAAA,CAEAxwI,MAAA,IAAAwwI,EAAAz7I,OAAA/P,MAEAguE,MAAAv5C,IACA4yH,EAAA,qBAAAvlJ,EAAAj0E,EAAA4mG,GAEA+2H,EAAAz7I,OAAA/P,IAAAy0B,GACAm2H,EAAA58E,QACAy2W,EAAAhwZ,IAGAwsE,MAAA,KACA,MAAAxsE,EAAAqjN,EAAA,IAAAhkN,MAAA,gBAAAowZ,GACAC,EAAAn2W,QACAw9E,EAAAz7I,OAAA/P,IAAAy0B,GACAgwZ,EAAAhwZ,IAEA0wS,KAAA72P,MAAAA,IACAv+D,EAAA04W,EAAA14W,EAAA,CACA,CAAA86I,OAAAD,EAAAC,OAAAl7N,QAAA,CAAAg7b,aAAA,iBAAAC,UAlEA,2BAmEA,CAAA//N,OAAAs5R,EAAAt5R,OAAAl7N,QAAA,CAAAg7b,aAAA,eAAAC,UAAAs5D,MAGA,cAAApib,GACA6rJ,EAAA,CAAA1uI,GAAAA,EAAAnd,KAAAsib,EAAAvB,WAAAn7V,KAAA75J,IAGA,IACA,UAAA,IAAA65J,KAAA33E,EACA,KAAA23E,EAAAznF,QAAA,CACA,GAAAynF,EAAAznF,QAAA0ib,EAAA,CACAh1R,EAAA,CAAA1uI,GAAAA,EAAAnd,KAAAsib,EAAAN,QAAAp8V,KAAAA,IACA,MAEAA,EAAA43K,EAAAosE,aAAAhkP,GAAAA,EAAA,IAAA43K,EAAA53K,GACAimE,EAAA,CAAA1uI,GAAAA,EAAAnd,KAAAsib,EAAAN,QAAAp8V,KAAAA,EAAAqjP,aAAA,EAAA43G,KACAj7V,EAAAw7K,QAAAy/K,IAGA,MAAAluZ,GAUA,OARAA,EAAApkG,OAAA6zf,EACA78R,EAAA,qBAAAvlJ,EAAAj0E,IAEAw5N,EAAA,qBAAAvlJ,EAAAj0E,EAAA4mG,GACAk5H,EAAA,CAAA1uI,GAAAA,EAAAnd,KAAAsib,EAAAJ,SAGAx4R,EAAAz7I,OAAA/P,IAAAy0B,GACAgwZ,EAAAhwZ,GAGAk5H,EAAA,CAAA1uI,GAAAA,EAAAnd,KAAAsib,EAAAL,QACAU,KAEA10a,OAAA4mT,GA9EAliS,IACA8vZ,IACAA,GAAA,EACAl9R,EAAA,0BAAAvlJ,EAAAj0E,EAAA4mG,GACAA,IAAA6vZ,IAAAA,EAAA7vZ,GACA+vZ,IACAh5R,EAAAikP,SAAAz0X,MAAA+d,KAAAunE,MACA6F,EAAAm+U,QAwEA70C,SAAA,CACA10X,KAAAge,KAAAunE,MACAtlF,MAAA,MAEAiE,GAAAola,GAGA,OAAA74R,inBC1HA,MAAAk5R,EAAAn2f,EAAA,WACAo9b,EAAAp9b,EAAA,WAAAD,GAKaA,EAAAspe,MAAQ,IAAI8sB,EAAAC,sNCNzB,MAAAC,EAAA1zD,EAAA3ic,EAAA,0BACAs2f,EAAAt2f,EAAA,UACAu2f,EAAA5zD,EAAA3ic,EAAA,cACAw2f,EAAA7zD,EAAA3ic,EAAA,mBACAy2f,EAAA9zD,EAAA3ic,EAAA,cACA02f,EAAA/zD,EAAA3ic,EAAA,YACA22f,EAAA32f,EAAA,sBAEA42f,EAAA52f,EAAA,kBACA62f,EAAA72f,EAAA,kBACA82f,EAAA92f,EAAA,2BACAgsb,EAAAhsb,EAAA,WACA+2f,EAAA/2f,EAAA,aACAg3f,EAAAh3f,EAAA,YAKAi3f,EAAAj3f,EAAA,cACAk3f,EAAAl3f,EAAA,YAEAq9b,EAAAr9b,EAAA,eAWAD,EAAAq2f,MAAA,MAaE9yf,YAAa6zf,EAAwBC,GAKnC,GAjBK3qZ,KAAAurG,SAAW,SAEDvrG,KAAA4qZ,SAAWf,EAAA5mQ,OAAOO,MAAM,GAWvCxjJ,KAAK2qZ,UAAYA,MAAAA,EAAAA,EAAad,EAAA5mQ,OAAOO,MAAM,GAE3CxjJ,KAAK6qZ,eAAgB,EAEjBH,EAAgB,CAClB,MAAMh4O,EAAYk3O,EAAAz2f,QAAO84R,gBAAgBy+N,GACzC1qZ,KAAK8qZ,WAAa,CAChBt4O,WAAYk4O,EACZh4O,UAAAA,QAGF1yK,KAAK8qZ,WAAavrE,EAAAwrE,kBAYfl0f,qBAAsBurc,EAAmBnY,EAAiBC,GAC/D,MAAM8gE,EAAoBlB,EAAA32f,QACxB82b,EACA,CACEsE,cAAe+7D,EAAAW,eACfl8D,cAAeu7D,EAAAY,eACfj8D,cAAe2B,EAAAu6D,6BAGbv1C,QAAkB51W,KAAKorZ,iBAAiB,CAC5CnhE,WAAY+gE,EACZK,aAAa,EACbjpD,UAAAA,EACAlY,WAAAA,IAIF,MAAO,CACLK,WAHiBvqV,KAAKsrZ,uBAAuBN,EAAmBp1C,GAIhE21C,gBAAiB31C,EAAU21C,gBAC3BrhE,WAAY0rB,EAAU1rB,YAYnBrzb,oBAAqBurc,EAAmBnY,EAAiBC,GAC9D,MAAM8gE,EAAoBlB,EAAA32f,QACxB82b,EACA,CACEsE,cAAe+7D,EAAAW,eACfl8D,cAAeu7D,EAAAY,eACfj8D,cAAe2B,EAAAu6D,6BAGbv1C,QAAkB51W,KAAKorZ,iBAAiB,CAC5CnhE,WAAY+gE,EACZK,aAAa,EACbjpD,UAAAA,EACAlY,WAAAA,IAIF,MAAO,CACLK,WAHiBvqV,KAAKsrZ,uBAAuBN,EAAmBp1C,GAIhE21C,gBAAiB31C,EAAU21C,gBAC3BrhE,WAAY0rB,EAAU1rB,YAUlBrzb,uBAAwB0/E,SAC9B,MAAMqjI,QAAgB2lO,EAAAisE,WAAWj1a,EAAO6rX,UAAWpiW,KAAK8qZ,WAAWp4O,UAAW1yK,KAAK2qZ,WACnF,IAAIc,EAAQzrZ,KAAK6qZ,cAMjB,GALIt0a,EAAO80a,aAAoD,OAArCb,EAAAkB,SAASrsT,KAAK9oH,EAAO2zW,cAE7CuhE,GAAQ,IAGNA,EA0BF,aAAazrZ,KAAK2rZ,mBAAmBp1a,EAAQqjI,GA1BpC,CAET,MAAMswO,WAAEA,EAAUD,WAAEA,EAAUohE,YAAEA,GAAgB90a,EAC1Cq1a,EAAc,IAAIxB,EAAAyB,YACtBR,EACAzxS,EACA55G,KAAK4qZ,SACL5qZ,KAAK8qZ,WACL7gE,EAEgC,QAAhC5nH,EAAAmoL,EAAAkB,SAASrsT,KAAK9oH,EAAO2zW,mBAAW,IAAA7nH,EAAAA,EAAIwnL,EAAA5mQ,OAAOO,MAAM,IACjD0mM,GAGF,IACE,aAAalqV,KAAK8rZ,mBAAmBF,GACrC,MAAO73f,GAEP,IAAIg4f,EAIJ,OAHIx1a,EAAO80a,cACTU,EAAgBH,EAAYI,+BAEjBhsZ,KAAKisZ,2BAA2B11a,EAAQqjI,EAAS7lN,EAAEm4f,WAAYH,KAQ1El1f,iCACN0/E,EACAqjI,EACAsyS,EACAH,GAEA,MAAMV,YAAEA,EAAWnhE,WAAEA,EAAUD,WAAEA,GAAe1zW,EAC1Cq/X,EACJ,IAAIy0C,EAAA8B,oBAAoBd,EAAazxS,EAAS55G,KAAK4qZ,SAAU5qZ,KAAK8qZ,WAAY7gE,EAAYiiE,EAAYhiE,EAAY6hE,GAEpH,UACQn2C,EAAUw2C,gBACVx2C,EAAUy2C,iBACVz2C,EAAUn8O,SAChB,MAAO1lO,GACP02f,EAAA6B,OAAOv4f,GAEP,MAAM,IAAI+kG,MAAM,gDADJ/kG,EACwD4lF,WAGtE,OAAOi8X,EAGD/+c,yBACN0/E,EACAqjI,GAEA,MAAMyxS,YAAEA,EAAWnhE,WAAEA,EAAUD,WAAEA,GAAe1zW,EAC1Cq/X,EAAY,IAAIu0C,EAAAoC,YAAYlB,EAAazxS,EAAS55G,KAAK4qZ,SAAU5qZ,KAAK8qZ,WAAY7gE,EAAYC,GAEpG,UACQ0rB,EAAUw2C,gBACVx2C,EAAUy2C,iBACVz2C,EAAUn8O,SAEZz5H,KAAK6qZ,eAAiBj1C,EAAU1rB,YAClCsgE,EAAAkB,SAASzxH,MAAM27E,EAAU1rB,WAAY0rB,EAAU42C,sBAEjD,MAAOz4f,GAEP,MAAM,IAAI+kG,MAAM,uCADJ/kG,EAC+C4lF,WAG7D,OAAOi8X,EAGD/+c,yBACN++c,GAKA,aAHMA,EAAU62C,eACV72C,EAAU82C,SAET92C,EAGD/+c,6BACNozb,EACA2rB,GAGA,MAAOqlC,EAAQ0R,GAAQ5C,EAAA52f,UACjB+mU,EAAU+vH,EAAW9+G,SAc3B,aAZM8+K,EAAA92f,QACJ8nf,EACA+O,EAAA72f,QACAo3f,EAAAqC,cAAch3C,GACds0C,EAAA5mZ,OAAO,CAAEirV,cAAe+7D,EAAAW,iBACxB/wL,EACAgwL,EAAA9lZ,OAAO,CAAE2qV,cAAeu7D,EAAAY,iBACxBlB,EAAA72f,QACAo3f,EAAAsC,cAAcj3C,GACdqlC,GAGK0R;A;A;A;A;A;A;A;A;A;A;ACzOX,aAEA,MAAA51J,EAAAxjW,EAAA,UACA+0S,EAAA/0S,EAAA,8BAMAF,EAAAC,QAAA,IAAAyjW,EAAA,SAAA,UAAAzuD;A;A;A;A;A;A;A;A;A;A;ACTA,4CAEMzvM,EAAStlG,EAAQ,sBACjBw6R,EAAKx6R,EAAQ,SACbw9R,EAAWx9R,EAAQ,cACnBggR,EAAMhgR,EAAQ,aAmOpBF,EAAOC,QA7NP,MACEq5G,YAAY1oB,EAAIwiW,EAAKn+I,GACnBzvM,EAAqB,iBAAP5U,GACd4U,GAAQ4tV,GAAsB,iBAARA,GAEtBzmV,KAAK/b,GAAKA,EACV+b,KAAKl5B,KAAO,OACZk5B,KAAKymV,IAAMA,GAAO,KAClBzmV,KAAK8sZ,KAAOxkN,GAAO,KACnBtoM,KAAK+sZ,OAAS,KACd/sZ,KAAKgtZ,SAAW,KAChBhtZ,KAAKitZ,OAAS,qBAITjtZ,KAAK+sZ,SACR/sZ,KAAK+sZ,OAASh8N,EAASjD,MAAM9tL,KAAK/b,KAC7B+b,KAAK+sZ,4BAIR/sZ,KAAKymV,MAAQzmV,KAAKgtZ,WACpBhtZ,KAAKgtZ,SAAWj8N,EAASjD,MAAM9tL,KAAKymV,IAAKzmV,KAAK8sZ,MAC9C9sZ,KAAKgtZ,SAASnnN,WAAWtyB,GACzBvzK,KAAK8sZ,KAAO,MAEP9sZ,KAAKgtZ,2BAILhtZ,KAAK8tL,MAAMo/N,4BAIXltZ,KAAK8tL,MAAMq/N,UAGpBC,2BACQp4f,EAAMu+Q,EAAIxE,YAAY/uK,KAAK8tL,MAAMu/N,mBAChCrtZ,KAAK8tL,MAAM/T,MAAM/kR,GAG1By2R,iBAAiBz2R,UACf6jG,EAAOoqJ,EAAO8H,SAAS/1P,IAChBA,EAAIiwE,SAAW+6B,KAAK8tL,MAAMu/N,WAGnCC,iBAAiBt4f,EAAKszP,SACdjtB,EAAMr7H,KAAKisL,gBAAgBj3R,MAC1B44G,EAAAA,EAAGC,GAAK7N,KAAKutZ,gBAAgBlyR,EAAKitB,UAGvC1qH,EAAGqlH,EAAOx5F,KAAKz0J,GACf44G,EAAAA,EACAC,EAAAA,GAIJ2/Y,iBAAiB79R,GACf92H,EAAO82H,GAAwB,iBAATA,SAEhB9oJ,EAAIknN,EAAG3pL,OAAOurH,EAAK/xF,EAAG59B,KAAK8tL,MAAM+E,WAEnChsN,EAAEu3J,aAAep+H,KAAK8tL,MAAMu/N,WAAAA,MAAAA,IACpBv0Z,MAAM,+BAEXkH,KAAK8tL,MAAM2/N,aAAa5mb,GAGjColN,gBAAgBj3R,SACR6xE,EAAIm5B,KAAK8tL,MAAM4/N,cAAc14f,MAE/BgrG,KAAKmjM,SAAWnjM,KAAKmjM,QAAQ/+E,EAAEkkF,IAAAA,OAC3BhkF,EAAItkH,KAAKmjM,QAAQ/+E,EAAEupS,SAAS9mb,UACxBm5B,KAAK8tL,MAAM8/N,iBAAiBtpS,GAE7BhhH,gBAGDtD,KAAK8tL,MAAM1pE,EAAEypS,MACXF,SAAS9mb,EAAG0sM,GAEfjwK,SAGXyoL,iBAAiB/2R,EAAKszP,MACpBzvJ,EAAe,MAARyvJ,GAAgC,kBAATA,IAEzBtoJ,KAAKmjM,QAAAA,MAAAA,IACErqM,MAAM,sCAEZwrH,EAAItkH,KAAK8tL,MAAM2X,YAAYzwS,GAC3B2vN,EAAI3kH,KAAKmjM,QAAQ2qN,cAAcxpS,UAEzB,MAARgkC,GACE3jC,EAAE4pE,UAAYjmC,EACT3jC,EAAEixE,MAAMtyL,SAGZqhH,EAAErhH,SAGXyqZ,qBAAqBp1R,SACbzkC,EAAIl0F,KAAK8tL,MAAMkgO,cAAcr1R,UACzB34H,KAAK8tL,MAAMmgO,iBAAiB/5T,GAE7B5wF,SAGX4qZ,mBAAmBl5f,EAAK2oS,EAAOpqB,EAAI46O,mBAC3B7pS,EAAItkH,KAAK8tL,MAAM2X,YAAYzwS,GAC3Bk/L,EAAIl0F,KAAK8tL,MAAMsgO,eAAe9pS,EAAGq5E,UAEhC39L,KAAK8tL,MAAMugO,cAAcn6T,EAAGypG,IAAS,GAG9C2wN,kBAAkB31R,EAAO41R,GAAO,UACpBvuZ,KAAK8tL,MAAM0gO,cAAc71R,EAAO41R,GAEjCjrZ,SAGXmrZ,gBAAgBz5f,EAAK05f,EAAWn7O,EAAI46O,mBAC5B7pS,EAAItkH,KAAK8tL,MAAM2X,YAAYzwS,UAC1BgrG,KAAK8tL,MAAM6gO,YAAYrqS,EAAGoqS,EAAUn7O,GAG7CuY,gBAAgB92R,OAGVsvN,EAFJzrH,EAAOoqJ,EAAO8H,SAAS/1P,QAIrBsvN,EAAItkH,KAAK8tL,MAAM8gO,QAAQ55f,SAChBjB,UACA,SAGFuwN,EAAE2X,WAGX4yR,iBAAiB75f,OAGXsvN,EAFJzrH,EAAOoqJ,EAAO8H,SAAS/1P,QAIrBsvN,EAAItkH,KAAK8tL,MAAM8gO,QAAQ55f,SAChBjB,UACA,UAGJuwN,EAAE2X,YAGA3X,EAAEwqS,UAGXC,oBAAoB/5f,OAGdsvN,EAFJzrH,EAAOoqJ,EAAO8H,SAAS/1P,QAIrBsvN,EAAItkH,KAAK8tL,MAAM8gO,QAAQ55f,SAChBjB,UACA,UAGJuwN,EAAE2X,YAGA3X,EAAE0qS,aAGXzB,gBAAgBv4f,EAAKszP,WACZ16I,EAAAA,EAAGC,GAAK7N,KAAK8tL,MAAM2X,YAAYzwS,EAAKszP,UAGzC16I,EAAG5N,KAAK8tL,MAAMmhO,YAAYrhZ,EAAEyyL,WAC5BxyL,EAAG7N,KAAK8tL,MAAMmhO,YAAYphZ,EAAEwyL,YAIhC6uN,gBAAgBv/R,GACd92H,EAAO82H,GAAwB,iBAATA,SAEhB/hH,EAAImgL,EAAG3pL,OAAOurH,EAAK/hH,EAAG5N,KAAK8tL,MAAM+E,WAEnCjlL,EAAEzG,IAAInH,KAAK8tL,MAAM5mN,IAAM,EAAA,MAAA,IACf4xB,MAAM,qBAEJ,MAAV62H,EAAK9hH,EAAK,OACNA,EAAIkgL,EAAG3pL,OAAOurH,EAAK9hH,EAAG7N,KAAK8tL,MAAM+E,WAEnChlL,EAAE1G,IAAInH,KAAK8tL,MAAM5mN,IAAM,EAAA,MAAA,IACf4xB,MAAM,wBAEZwrH,EAAItkH,KAAK8tL,MAAMkB,MAAMphL,EAAGC,OAEzBy2G,EAAE2X,WAAAA,MAAAA,IACKnjI,MAAM,yBAEXwrH,EAAEhhH,gBAGDtD,KAAK8tL,MAAM4X,WAAW93L,GAEvBtK,SAGXuyM,OAAOx6E,EAAKs5C,SACJrwD,EAAItkH,KAAK8tL,MAAM8gO,QAAQvzR,GACvBx0J,EAAIm5B,KAAK8tL,MAAM4/N,cAAc/4O,UACzBrwD,EAAEqpS,SAAS9mb,EAAG0sM,GAEfjwK;A;A;A;A;A;ACrOb,aAqBAjwG,EAAAC,QAfA,SAAAulG,EAAAc,EAAAlqB,GACA,IAAAkqB,EAAA,CACA,MAAAF,EAAA,IAAAX,MAAArpB,GAAA,oBAKA,MAHAqpB,MAAAqsJ,mBACArsJ,MAAAqsJ,kBAAA1rJ,EAAAZ,GAEAY;A;A;A;A;A;ACbA,aAEApmG,EAAAC,QAAAC,EAAA;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;ACgCA,mDAEOujN,GAAUvjN,EAAQ,sBAMnBonQ,EAAAA,CACJ,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGIu5B,EAAAA,CACJ,EAAM,GAAM,GAAM,GAAM,GAAM,GAC9B,EAAM,EAAM,EAAM,EAAM,EAAM,EAC9B,EAAM,EAAM,EAAM,EAAM,EAAM,EAC9B,EAAM,EAAM,EAAM,EAAM,EAAM,EAC9B,EAAM,EAAM,EAAM,EAAM,EAAM,EAC9B,EAAM,EAAM,EAAM,EAAM,EAAM,GAG1BC,EAAAA,CACJ,EAAY,SAAY,SAAY,SACpC,SAAY,SAAY,SAAY,SACpC,SAAY,IAAY,SAAY,SACpC,SAAY,QAAY,SAAY,SACpC,SAAY,SAAY,SAAY,KACpC,QAAY,QAAY,QAAY,QACpC,QAAY,SAAY,SAAY,SACpC,SAAY,MAAY,SAAY,SACpC,SAAY,SAAY,SAAY,UAGhCgN,EAAAA,CACJG,KAAM,KACND,KAAM,KACNq2D,KAAM,KACNt2D,KAAM,KACN+tN,KAAM,KACN5tN,OAAQ,KACR6tN,KAAM,MAGFltP,EACE,EADFA,EAEC,EAFDA,EAGC,EAHDA,EAIE,EAJFA,EAKI,EALJA,EAMC,EAMDmtP,EAA+B,mBAAXrzX,OAM1B,MAAA+xJ,EACEphL,YAAY+E,EAAK0uB,EAAMyyJ,GACrB7yL,KAAKgzL,MAAAA,CAAS,GACdhzL,KAAK/6B,OAAS,EACd+6B,KAAK+yL,SAAW,EAChB/yL,KAAKkuL,IAAM,KACXluL,KAAKypD,KAAK/3C,EAAK0uB,EAAMyyJ,GAOvBy8N,MAAMzob,EAAGyS,OACHukJ,EAAQ,EACR12J,EAAI,MAGJN,EAAE5B,OAASqU,EAAErU,UACd4B,EAAGyS,GAAAA,CAAMA,EAAGzS,IAEXA,IAAMm5B,MACRA,KAAKuvZ,OAAO1ob,EAAE5B,QAETkC,EAAImS,EAAErU,OAAQkC,IAAAA,OACb6mC,GAAkB,EAAbnnC,EAAEmsN,MAAM7rN,KAAwB,EAAbmS,EAAE05M,MAAM7rN,IAAU02J,EAEhD79H,KAAKgzL,MAAM7rN,GAAS,SAAJ6mC,EAEhB6vH,EAAQ7vH,IAAM,QAGC,IAAV6vH,GAAe12J,EAAIN,EAAE5B,OAAQkC,IAAAA,OAC5B6mC,GAAkB,EAAbnnC,EAAEmsN,MAAM7rN,IAAU02J,EAE7B79H,KAAKgzL,MAAM7rN,GAAS,SAAJ6mC,EAEhB6vH,EAAQ7vH,IAAM,MAGhBhO,KAAK/6B,OAAS4B,EAAE5B,OAEF,IAAV44J,EACF79H,KAAKuvZ,OAAOvvZ,KAAK/6B,OAAS,GAC1B+6B,KAAKgzL,MAAMhzL,KAAK/6B,UAAY44J,UACnBh3J,IAAMm5B,UAER74B,EAAIN,EAAE5B,OAAQkC,IACnB64B,KAAKgzL,MAAM7rN,GAAKN,EAAEmsN,MAAM7rN,UAIrB64B,KAGT8zL,OAAOpiL,MACL1R,KAAKgzL,MAAM,IAAMthL,EAEb1R,KAAKgzL,MAAM,GAAK,SAAA,OACXhzL,SAGL74B,EAAI,MAER64B,KAAKuvZ,OAAOvvZ,KAAK/6B,OAAS,GAE1B+6B,KAAKgzL,MAAMhzL,KAAK/6B,QAAU,EAEnBkC,EAAI64B,KAAK/6B,QAAU+6B,KAAKgzL,MAAM7rN,IAAM,SAAWA,IACpD64B,KAAKgzL,MAAM7rN,IAAM,SACjB64B,KAAKgzL,MAAM7rN,EAAI,IAAM,SAGvB64B,KAAK/6B,OAASW,KAAKD,IAAIq6B,KAAK/6B,OAAQkC,EAAI,GAGjC64B,KAOTovL,KAAK19K,MACH89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAEzB1R,KAAK+yL,WAAarhL,EAAIqhL,SAGxB/yL,KAAKsvZ,MAAMtvZ,KAAM0R,cAIXvK,EAAMnH,KAAK0/L,KAAKhuL,MAGV,IAARvK,SACFnH,KAAKgzL,MAAM,GAAK,EAChBhzL,KAAK/6B,OAAS,EACd+6B,KAAK+yL,SAAW,EACT/yL,KAGLmH,EAAM,GACRnH,KAAKyvZ,MAAM/9Y,EAAK1R,MAChBA,KAAK+yL,UAAY,GAEjB/yL,KAAKyvZ,MAAMzvZ,KAAM0R,UAId1R,KAGTs1L,MAAM5jL,GACJ89Y,EAAQE,EAAMh+Y,GAAM,MAAO,aAErBqhL,EAAYrhL,EAAM,EAAK,SAEzBqhL,IACFrhL,GAAOA,GAEL1R,KAAK+yL,WAAaA,EAGpB/yL,KAAK8zL,OAAOpiL,GAIQ,IAAhB1R,KAAK/6B,QAAgB+6B,KAAKgzL,MAAM,GAAKthL,GACvC1R,KAAKgzL,MAAM,GAAKthL,EAAM1R,KAAKgzL,MAAM,GACjChzL,KAAK+yL,UAAY,GAEjB/yL,KAAK2vZ,OAAOj+Y,GAIT1R,KAGThhB,IAAI0yB,UACF89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAEzBA,EAAIzsC,OAAS+6B,KAAK/6B,OACbysC,EAAI2jB,QAAQ+5J,KAAKpvL,MAEnBA,KAAKq1B,QAAQ+5J,KAAK19K,GAG3B2sL,KAAK3sL,UACI1R,KAAKq1B,QAAQigK,MAAM5jL,GAO5B+9Y,MAAM5ob,EAAGyS,OACHukJ,EAAQ,EACR12J,EAAI,MAGR0xB,EAAOhyB,EAAE5B,QAAUqU,EAAErU,QAEjB4B,IAAMm5B,MACRA,KAAKuvZ,OAAO1ob,EAAE5B,QAETkC,EAAImS,EAAErU,OAAQkC,IAAAA,OACb6mC,GAAkB,EAAbnnC,EAAEmsN,MAAM7rN,KAAwB,EAAbmS,EAAE05M,MAAM7rN,IAAU02J,EAEhDA,EAAQ7vH,GAAK,GAEbhO,KAAKgzL,MAAM7rN,GAAS,SAAJ6mC,OAGD,IAAV6vH,GAAe12J,EAAIN,EAAE5B,OAAQkC,IAAAA,OAC5B6mC,GAAkB,EAAbnnC,EAAEmsN,MAAM7rN,IAAU02J,EAE7BA,EAAQ7vH,GAAK,GAEbhO,KAAKgzL,MAAM7rN,GAAS,SAAJ6mC,KAGlBnV,EAAiB,IAAVglI,GAGHh3J,IAAMm5B,UACD74B,EAAIN,EAAE5B,OAAQkC,IACnB64B,KAAKgzL,MAAM7rN,GAAKN,EAAEmsN,MAAM7rN,UAG5B64B,KAAK/6B,OAASW,KAAKD,IAAIq6B,KAAK/6B,OAAQkC,GAE7B64B,KAAKsiM,SAGdqtN,OAAOj+Y,MACL1R,KAAKgzL,MAAM,IAAMthL,EAEb1R,KAAKgzL,MAAM,IAAM,EAAA,OACZhzL,KAAK4vZ,aAEd/2Z,EAAuB,IAAhBmH,KAAK/6B,QAGZ+6B,KAAKuvZ,OAAOvvZ,KAAK/6B,OAAS,WAEjBkC,EAAI,EAAGA,EAAI64B,KAAK/6B,QAAU+6B,KAAKgzL,MAAM7rN,GAAK,EAAGA,IACpD64B,KAAKgzL,MAAM7rN,IAAM,SACjB64B,KAAKgzL,MAAM7rN,EAAI,IAAM,SAGvB64B,KAAKgzL,MAAMhzL,KAAK/6B,QAAU,EAEnB+6B,KAAKsiM,SAOdjT,KAAK39K,MACH89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAEzB1R,KAAK+yL,WAAarhL,EAAIqhL,SAGxB/yL,KAAKsvZ,MAAMtvZ,KAAM0R,cAIXvK,EAAMnH,KAAK0/L,KAAKhuL,MAGV,IAARvK,SACFnH,KAAKgzL,MAAM,GAAK,EAChBhzL,KAAK/6B,OAAS,EACd+6B,KAAK+yL,SAAW,EACT/yL,KAGLmH,EAAM,GACRnH,KAAKyvZ,MAAM/9Y,EAAK1R,MAChBA,KAAK+yL,UAAY,GAEjB/yL,KAAKyvZ,MAAMzvZ,KAAM0R,UAId1R,KAGT0xL,MAAMhgL,GACJ89Y,EAAQE,EAAMh+Y,GAAM,MAAO,aAErBqhL,EAAYrhL,EAAM,EAAK,SAEzBqhL,IACFrhL,GAAOA,GAEL1R,KAAK+yL,WAAaA,EAGpB/yL,KAAK8zL,OAAOpiL,GAIQ,IAAhB1R,KAAK/6B,QAAgB+6B,KAAKgzL,MAAM,GAAKthL,GACvC1R,KAAKgzL,MAAM,GAAKthL,EAAM1R,KAAKgzL,MAAM,GACjChzL,KAAK+yL,UAAY,GAEjB/yL,KAAK2vZ,OAAOj+Y,GAIT1R,KAGTsxB,IAAI5f,UACK1R,KAAKq1B,QAAQg6J,KAAK39K,GAG3B4sL,KAAK5sL,UACI1R,KAAKq1B,QAAQq8J,MAAMhgL,GAO5Bm+Y,KAAKn+Y,EAAKqvB,MACRyuX,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7B89Y,EAAQzhO,EAAG+E,KAAK/xJ,GAAM,MAAO,UAET,KAAhB/gC,KAAK/6B,QAAgC,KAAfysC,EAAIzsC,OAAW,OAChC0xN,EAAY32L,KAAM0R,EAAKqvB,SAE1B39B,EAAMpD,KAAK/6B,OAASysC,EAAIzsC,cAE1Bm+B,EAAM,GACDgxL,EAAWp0L,KAAM0R,EAAKqvB,GAE3B39B,EAAM,KACD43L,EAASh7L,KAAM0R,EAAKqvB,GA2uLjC,SAAoBnzB,EAAGC,EAAGkzB,OAEnBsuX,GAAczhZ,EAAE3oC,OAAS4oC,EAAE5oC,OAAS,SAAA,OAChC+1N,EAASptL,EAAGC,EAAGkzB,SAElBopH,EAAOnuH,OAAO,GACdgjG,EAAOhjG,OAAO,UACdr3B,EAAQq3B,OAAO,QAEjBupF,EAAI33G,EAAEkiZ,WAAajiZ,EAAEiiZ,iBAEnBl6N,EAAOrwE,EAAI4kC,EAAQ,EAErByrC,IACFrwE,GAAKA,OAEHp+I,EAAI,OAEDo+I,EAAI4kC,GACTppH,EAAIiyJ,MAAM7rN,KAAOhB,OAAOo/I,EAAIyZ,GAC5BzZ,IAAM5gH,EAGE,IAANx9B,IACF45D,EAAIiyJ,MAAM7rN,KAAO,UAEnB45D,EAAI97D,OAASkC,EACb45D,EAAIgyJ,SAAW6C,EAER70J,EAtwLE65J,CAAW56L,KAAM0R,EAAKqvB,GAO/BwuJ,KAAK79K,UACI1R,KAAK4vL,IAAIl+K,GAAKm6O,MAAM7rP,MAG7B6zL,MAAMniL,GACJ89Y,EAAQE,EAAMh+Y,GAAM,MAAO,aAErBkkL,EAAOlkL,EAAM,EAAK,EAEpBkkL,IACFlkL,GAAOA,OAGLmsH,EAAQ,UAEH12J,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAAAA,OACzBs9I,EAAIzkH,KAAKgzL,MAAM7rN,GAAKuqC,EACpB4xI,GAAU,SAAJ7+B,IAA0B,SAARoZ,GAE9BA,IAAU,GACVA,GAAUpZ,EAAI,SAAa,EAC3BoZ,GAASylB,IAAO,GAEhBtjJ,KAAKgzL,MAAM7rN,GAAU,SAALm8K,SAGlBtjJ,KAAK+yL,UAAY6C,EAEH,IAAV/3D,GACF79H,KAAKuvZ,OAAOvvZ,KAAK/6B,OAAS,GAC1B+6B,KAAKgzL,MAAMhzL,KAAK/6B,UAAY44J,GAE5B79H,KAAKsiM,SAGAtiM,KAGT4vL,IAAIl+K,GACF89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,gBAEvBtO,EAAMpD,KAAK/6B,OAASysC,EAAIzsC,OACxB87D,EAAAA,IAAUgtJ,EAEhBhtJ,EAAIiyJ,MAAAA,IAAYn1L,MAAMuF,WAEbj8B,EAAI,EAAGA,EAAIi8B,EAAKj8B,IACvB45D,EAAIiyJ,MAAM7rN,GAAK,SAEV64B,KAAK6vZ,KAAKn+Y,EAAKqvB,GAGxBo8J,KAAKzrL,UACI1R,KAAKq1B,QAAQw+J,MAAMniL,GAO5Bq+Y,SAASr+Y,EAAK0oH,GACZo1R,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7B89Y,EAASp1R,IAAS,IAAOA,EAAM,OAAQ,gBAEjCpsH,EAAIhO,KAAK4vL,IAAIl+K,GACbp4B,EAAI00B,EAAEgiZ,OAAO51R,EAAO,UAE1BpsH,EAAE2jL,OAAOv3D,GAELp6H,KAAK+yL,SAAWrhL,EAAIqhL,SACf/kL,EAAE0jL,MAAMp4M,GAEV00B,EAAEsnL,MAAMh8M,GAOjB22a,KAAKv+Y,EAAK2R,GACRmsY,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7B7Y,GAAQwqB,EAAQ6+I,KAAe7+I,GAC/BxqB,EAAOwqB,IAAU6+I,SAEXr7L,EAAIm5B,KACJ1mB,EAAIo4B,KAEVw+Y,GAAS52a,EAAEu1M,UAEPhoN,EAAEgoN,SAAAA,MAAAA,CAAAA,IACQd,EAAG,GAAA,IAAQA,EAAG,UAEtBoiO,EAAKtpb,EAAEksN,SACP1Y,EAAK/gM,EAAEy5M,SAEblsN,EAAEksN,SAAW,EACbz5M,EAAEy5M,SAAW,MAETzkL,EAAI,KACJN,EAAI,YAEJnnC,EAAE64N,KAAKpmN,GAAK,GACV+pC,EAAQ6+I,IACV5zJ,EAAAA,IAAQy/K,EAAG,IAET1qK,EAAQ6+I,IACVl0J,EAAInnC,EAAEwuD,UACc,IAAb/7C,EAAErU,QACPo+C,EAAQ6+I,IACV5zJ,EAAIznC,EAAEupb,KAAK92a,EAAE05M,MAAM,KAEjB3vK,EAAQ6+I,IACVl0J,EAAInnC,EAAEwpb,KAAK/2a,EAAE05M,MAAM,OAEpB1kL,EAAGN,GAAKnnC,EAAE43N,SAASnlN,EAAG+pC,GAGzBx8C,EAAEksN,SAAWo9N,EACb72a,EAAEy5M,SAAW1Y,EAETh3J,EAAQ6+I,IACV5zJ,EAAEykL,SAAWlsN,EAAEksN,SAAWz5M,EAAEy5M,SAC5BzkL,EAAEshZ,cAGAvsY,EAAQ6+I,IACVl0J,EAAE+kL,SAAWlsN,EAAEksN,SACf/kL,EAAE4hZ,cAGAvsY,EAAQ6+I,IACN7+I,EAAQ6+I,IACVrpK,EAA+B,IAAvBwqB,EAAQ6+I,IAEG,IAAfl0J,EAAE+kL,WACe,IAAfz5M,EAAEy5M,SACJzkL,EAAEgnL,MAAM,GAERhnL,EAAEojL,MAAM,KAIVruK,EAAQ6+I,GACS,IAAfl0J,EAAE+kL,WACe,IAAfz5M,EAAEy5M,SACJ/kL,EAAEqhL,KAAK/1M,GAEP00B,EAAEohL,KAAK91M,MAKPg1B,EAAGN,GAGbywL,SAAS/sL,EAAK2R,OAIRggI,EAHAx8K,EAAIm5B,KAAKq1B,QACT/7C,EAAIo4B,EACJpD,EAAI,WAIFkU,EAA+B,EAAxBlpC,EAAE05M,MAAM15M,EAAErU,OAAS,GAC1B0/B,EAAQ,GAAK2rZ,EAAU9tY,GAEf,IAAV7d,GACFrrB,EAAIA,EAAE+7C,QAENxuD,EAAE02N,OAAO54L,GACTrrB,EAAEikN,OAAO54L,GAET0+I,EAA6B,EAAxB/pK,EAAE05M,MAAM15M,EAAErU,OAAS,IAExBo+K,EAAK7gI,QAIDtjC,EAAIrY,EAAE5B,OAASqU,EAAErU,UAEvB4zB,EAAO3Z,GAAK,GAERmkC,EAAQ6+I,EAAMquP,CAChBjiZ,EAAAA,IAAQy/K,EAAG,GACXz/K,EAAErpC,OAASia,EAAI,EACfovB,EAAE0kL,MAAAA,IAAYn1L,MAAMyQ,EAAErpC,gBAEbkC,EAAI,EAAGA,EAAImnC,EAAErpC,OAAQkC,IAC5BmnC,EAAE0kL,MAAM7rN,GAAK,QAIXy2D,EAAI/2D,EAAEwuD,QAEZuI,EAAE4gK,aAAallN,EAAG,EAAG4F,GAEF,IAAf0+C,EAAEm1J,WACAzkL,IACFA,EAAE0kL,MAAM9zM,GAAK,GAEfrY,EAAI+2D,WAIGtsC,EAAIpS,EAAI,EAAGoS,GAAK,EAAGA,IAAAA,OAGpBk/Z,GAAc,SAFR3pb,EAAEmsN,MAAM15M,EAAErU,OAASqsB,GACnBzqB,EAAEmsN,MAAM15M,EAAErU,OAASqsB,EAAI,IACI+xJ,EAAM,MAEzCs7C,EAAK/4N,KAAKq0B,IAAIu2Z,EAAK,cAEvB3pb,EAAE23N,aAAallN,EAAGqlN,EAAIrtM,GAEA,IAAfzqB,EAAEksN,UACP4L,GAAM,EACN93N,EAAEksN,SAAW,EACblsN,EAAE23N,aAAallN,EAAG,EAAGgY,GACrBzqB,EAAE6uN,OAGApnL,IACFA,EAAE0kL,MAAM1hM,GAAKqtM,UAIbrwL,GACFA,EAAEg0L,SAICj/K,EAAQ6+I,GAAwB,IAAVv9J,GACzB99B,EAAE8qN,OAAOhtL,IAEH2J,EAAGznC,GAGb23N,aAAa9sL,EAAKk+K,EAAKjrL,OACjBk5H,EAAQ,EACR12J,EAAI,MAER64B,KAAK+zL,QAAQriL,EAAIzsC,OAAS0/B,GAEnBx9B,EAAIuqC,EAAIzsC,OAAQkC,IAAAA,OACf9yE,GAA6B,EAAxB2rG,KAAKgzL,MAAM7rN,EAAIw9B,IAAck5H,EAClC7vH,EAAI0D,EAAIshL,MAAM7rN,GAAKyoN,EACnBnrE,EAAIpwN,GAAS,SAAJ25G,GAEf6vH,GAASpZ,GAAK,KAAQz2G,EAAI,SAAa,GAEvChO,KAAKgzL,MAAM7rN,EAAIw9B,GAAa,SAAJ8/G,OAGnBt9I,EAAI64B,KAAK/6B,OAAS0/B,EAAOx9B,IAAAA,OACxBs9I,GAA6B,EAAxBzkH,KAAKgzL,MAAM7rN,EAAIw9B,IAAck5H,EAExCA,EAAQpZ,GAAK,GAEbzkH,KAAKgzL,MAAM7rN,EAAIw9B,GAAa,SAAJ8/G,KAGZ,IAAVoZ,EAAU,OACL79H,KAAKsiM,SAGdzpM,GAAkB,IAAXglI,GAEPA,EAAQ,UAEC12J,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAAAA,OACzBs9I,IAAsB,EAAhBzkH,KAAKgzL,MAAM7rN,IAAU02J,EAEjCA,EAAQpZ,GAAK,GAEbzkH,KAAKgzL,MAAM7rN,GAAS,SAAJs9I,SAGlBzkH,KAAK+yL,SAAW,EAET/yL,KAAKsiM,SAOdmuN,OAAO/+Y,UACE1R,KAAKiwZ,KAAKv+Y,EAAKwwJ,GAOxBwuP,KAAKh/Y,UACI1R,KAAKwwZ,IAAI9+Y,GAAKm6O,MAAM7rP,MAG7B2wZ,MAAMj/Y,GACJ89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw+Y,EAAgB,IAARx+Y,SAEFkkL,EAAOlkL,EAAM,EAAK,EAEpBkkL,IACFlkL,GAAOA,OAELmsH,EAAQ,UAEH12J,EAAI64B,KAAK/6B,OAAS,EAAGkC,GAAK,EAAGA,IAAAA,OAC9Bs9I,GAAqB,EAAhBzkH,KAAKgzL,MAAM7rN,IAAkB,SAAR02J,EAEhC79H,KAAKgzL,MAAM7rN,GAAMs9I,EAAI/yG,EAAO,EAE5BmsH,EAAQpZ,EAAI/yG,SAGd1R,KAAK+yL,UAAY6C,EAEV51L,KAAKsiM,SAGdkuN,IAAI9+Y,UACK1R,KAAKiwZ,KAAKv+Y,EAAKwwJ,GAAW,GAGnCkuP,KAAK1+Y,UACI1R,KAAKq1B,QAAQs7X,MAAMj/Y,GAO5Bk/Y,KAAKl/Y,UACI1R,KAAKy3O,IAAI/lO,GAAKm6O,MAAM7rP,MAG7B6wZ,MAAMn/Y,OACAxyB,EAAI8gB,KAAK8wZ,MAAMp/Y,UAEfxyB,EAAI,IACNA,GAAKA,GAEP8gB,KAAKgzL,MAAM,GAAK9zM,EAChB8gB,KAAK/6B,OAAS,EAEP+6B,KAAK4vZ,aAGdn4K,IAAI/lO,UACK1R,KAAKiwZ,KAAKv+Y,EAAKwwJ,GAAW,GAGnCmuP,KAAK3+Y,UACI1R,KAAKq1B,QAAQw7X,MAAMn/Y,GAG5Bo/Y,MAAMp/Y,GACJ89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw+Y,EAAgB,IAARx+Y,GAEJA,EAAM,IACRA,GAAOA,SAEHxqC,GAAK,GAAK,IAAMwqC,MAElB2kI,EAAM,UAEDlvK,EAAI64B,KAAK/6B,OAAS,EAAGkC,GAAK,EAAGA,IACpCkvK,GAAOnvK,EAAImvK,GAAuB,EAAhBr2I,KAAKgzL,MAAM7rN,KAAWuqC,SAEjB,IAAlB1R,KAAK+yL,SAAyB,GAAN18C,EAAWA,EAO5CuoD,OAAOltL,UACE1R,KAAKiwZ,KAAKv+Y,EAAKwwJ,EAAaA,GAOrCm2G,KAAK3mQ,UACI1R,KAAKszJ,IAAI5hJ,GAAKm6O,MAAM7rP,MAG7B20L,MAAMjjL,MACkB,IAAlB1R,KAAK+yL,SAAa,OACb/yL,KAAK2wZ,MAAMj/Y,SAEd1D,EAAIhO,KAAK8wZ,MAAMp/Y,UAErB1R,KAAK2wZ,MAAMj/Y,GAEP1D,EAAI,IACF0D,EAAM,EACR1R,KAAKs1L,MAAM,GAEXt1L,KAAK0xL,MAAM,IAGR1xL,KAGTszJ,IAAI5hJ,UACK1R,KAAKiwZ,KAAKv+Y,EAAKwwJ,EAAaA,GAAc,GAGnD48B,KAAKptL,UACI1R,KAAKq1B,QAAQs/J,MAAMjjL,GAO5BswL,KAAKtwL,UACC1R,KAAK0/L,KAAKhuL,GAAO,GACG,IAAlB1R,KAAK+yL,WACP/yL,KAAKyvZ,MAAM/9Y,EAAK1R,MAChBA,KAAK+yL,SAAW,GAEX/yL,MAGFA,KAAKsiD,IAAI5wC,GAAKm6O,MAAM7rP,MAG7B+wZ,MAAMr/Y,UACJ1R,KAAKgzL,MAAM,GAAKhzL,KAAK8rP,MAAMp6O,GAC3B1R,KAAK/6B,OAAS,EACd+6B,KAAK+yL,SAAW,EACT/yL,KAGTsiD,IAAI5wC,UACK1R,KAAKiwZ,KAAKv+Y,EAAKwwJ,EAAYA,GAAc,GAGlDwyB,KAAKhjL,UACI1R,KAAKq1B,QAAQ07X,MAAMr/Y,GAG5Bo6O,MAAMp6O,GACJ89Y,EAAQE,EAAMh+Y,GAAM,MAAO,WAEvB1D,EAAIhO,KAAK8wZ,MAAMp/Y,UAEf1D,EAAI,IACF0D,EAAM,EACR1D,GAAK0D,EAEL1D,GAAK0D,GAGF1D,EAOT+wL,SAASrtL,SACApD,EAAGN,GAAKhO,KAAKywZ,OAAO/+Y,MAGvB1D,EAAE6gL,SAAAA,OACGvgL,QAEHmoL,EAAqB,EAAf/kL,EAAIshL,MAAM,GAEtBthL,EAAIigL,OAAO,SAELxqL,EAAM6G,EAAE0xL,KAAKhuL,UAEnBA,EAAI6rL,OAAO,GAEX7rL,EAAIshL,MAAM,IAAMyD,EAGZtvL,EAAM,GAAMuK,EAAI68K,SAAmB,IAARpnL,EACtBmH,EAGLtO,KAAK+yL,SAAWrhL,EAAIqhL,SACfzkL,EAAEojL,MAAM,GAEVpjL,EAAEgnL,MAAM,GAOjB07N,KAAKt/Y,UACI1R,KAAKq/H,IAAI3tH,GAAKm6O,MAAM7rP,MAG7BixZ,MAAMv/Y,UACG1R,KAAKkxZ,KAAKx/Y,GAAKm6O,MAAM7rP,MAG9Bq/H,IAAI3tH,GACF89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,cAEzBp4B,EAAIg3a,EAAU5+Y,EAAIshL,MAAMthL,EAAIzsC,OAAS,IACrC+oC,EAAAA,IAAQ+/K,EAAG,WAEN5mN,EAAIuqC,EAAIzsC,OAAS,EAAGkC,GAAK,EAAGA,IAAAA,OAC7Bq7C,EAAO9Q,EAAIshL,MAAM7rN,WAEdmqB,EAAIhY,EAAI,EAAGgY,GAAK,EAAGA,IAC1B0c,EAAIA,EAAEovL,MAED56K,GAAQlxB,EAAK,IAChB0c,EAAIA,EAAE4hL,IAAI5vL,OAGd1mB,EAAI,UAGC00B,EAGTkjZ,KAAKx/Y,MACH89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAEvBA,EAAM,IACRA,GAAOA,GAEG,IAARA,EAAQ,OAAA,IACCq8K,EAAG,MAEJ,IAARr8K,EAAQ,OACH1R,KAAKq1B,YAIVrnB,EAAIhO,aAEC74B,EAJImpb,EAAU5+Y,GAIH,EAAGvqC,GAAK,EAAGA,IAC7B6mC,EAAIA,EAAEovL,MAED1rL,GAAOvqC,EAAK,IACf6mC,EAAIA,EAAE4hL,IAAI5vL,cAGPgO,EAGTqvL,cACSr9L,KAAKuvL,KAAKvvL,MAGnBo9L,aACSp9L,KAAK4vL,IAAI5vL,MAOlBmxZ,SAAS9xR,EAAKo4G,MACZ+3K,EAASnwR,IAAQ,IAAOA,EAAK,MAAO,UAExB,IAARA,EAAQ,MAAA,IACAE,WAAW,oBAElBF,EAAMr/H,KAAK+yL,SAAAA,MAAAA,IACJxzD,WAAW,+BAEnBv/H,KAAKoxZ,MAAM,IAAM,EAAA,MAAA,CACXpxZ,KAAKq1B,QAAAA,IAAa04J,EAAG,QAI3BjpH,EAAG92D,EAFHkmF,EAAAA,IAAQ65F,EAAG,GACXhvI,EAAIgvI,EAAGppL,MAAM,EAAG3E,KAAKixK,YAAc5xC,EAAM,EAAI,MAG3B,IAAlBr/H,KAAK+yL,UACPh0I,EAAE22I,OAEQ,IAARr2D,KAEAnrC,EAAIn1C,EACJA,EAAI/+C,KAAKwwZ,IAAIt8T,GACbn1C,EAAEqwI,KAAKl7F,GACPn1C,EAAE4yI,OAAO,SACF5yI,EAAE2gJ,KAAKxrG,GAAK,WAGnBA,EAAIn1C,EACJA,EAAIm1C,EAAEg9T,KAAK7xR,EAAM,GACjBtgF,EAAI/+C,KAAKwwZ,IAAIzxW,GACb+lB,EAAIovB,EAAEipG,KAAK99D,EAAM,GACjBtgF,EAAEqwI,KAAKtqH,GACP/lB,EAAIA,EAAEqxW,KAAK/wR,SACJtgF,EAAE2gJ,KAAKxrG,GAAK,UAGnBujJ,IACF14L,EAAIm1C,EAAEg9T,KAAK7xR,GACXrxH,EAAIhO,KAAKsxB,IAAIytB,KAGPm1C,EAAGlmF,GAObqjZ,QAAQhyR,UACCr/H,KAAKmxZ,SAAS9xR,EAAK,GAG5BiyR,MAAMjyR,UACGr/H,KAAKvf,KAAK4+I,GAAKwsH,MAAM7rP,MAG9Bvf,KAAK4+I,UACIr/H,KAAKmxZ,SAAS9xR,EAAK,GAAG,GAG/BkyR,QAAQlyR,MACNmwR,EAASnwR,IAAQ,IAAOA,EAAK,MAAO,UAExB,IAARA,IAAeA,EAAMr/H,KAAK+yL,SAAAA,OACrB,SAEA/kL,GAAKhO,KAAKqxZ,QAAQhyR,UAEP,IAAbrxH,EAAEs6I,OAGXkpQ,iBACSxxZ,KAAKqxZ,QAAQ,GAGtBI,eACSzxZ,KAAKghM,OAAO6qD,MAAM7rP,MAG3BghM,cACShhM,KAAKvf,KAAK,GAGnBixa,kBACS1xZ,KAAKuxZ,QAAQ,GAOtBt7N,KAAKvkL,GACH89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,cAEzB9D,EAAI5N,KACJ6N,EAAI6D,KAEJ9D,IAAMC,EAAAA,OACDD,KAEyB,IAA7BA,EAAEmlL,SAAWllL,EAAEklL,UAAc,OACzBnlL,EAAEooL,MAAMnoL,MAEiB,IAA7BD,EAAEmlL,SAAWllL,EAAEklL,iBAIlBnlL,EAAE0nL,MAAM,GACRznL,EAAEynL,MAAM,GACR1nL,EAAEioL,KAAKhoL,GACPD,EAAE8jL,MAAM,GACR7jL,EAAE6jL,MAAM,GACD9jL,EAIU,IAAfA,EAAEmlL,YACHnlL,EAAGC,GAAAA,CAAMA,EAAEwnB,QAASznB,UAIjBsgD,EAAQtgD,EAAEqjK,mBAEhBpjK,EAAEynL,MAAM,GACRznL,EAAEwnL,MAAMnnI,GACRtgD,EAAEooL,MAAMnoL,GACRA,EAAEwnL,MAAMnnI,GACRrgD,EAAE6jL,MAAM,GAED9jL,EAAEi+O,MAAM7rP,MAGjB2xZ,MAAMjgZ,UACJ89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAES,IAA/B1R,KAAK+yL,SAAYrhL,EAAM,GACnB1R,KAAKi2L,KAAAA,IAASlI,EAAGr8K,KAE1B1R,KAAKgzL,MAAM,IAAMthL,EACjB1R,KAAK/6B,OAAS,EAEP+6B,MAGTywB,IAAI/e,UACK1R,KAAKq1B,QAAQ4gK,KAAKvkL,GAG3BkgZ,KAAKlgZ,UACI1R,KAAKq1B,QAAQs8X,MAAMjgZ,GAG5BmgZ,MAAMngZ,MACJ89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAES,IAA/B1R,KAAK+yL,SAAYrhL,EAAM,GAAQ,OAC5Bz9G,EAAI+rG,KAAKi2L,KAAAA,IAASlI,EAAGr8K,OAEvBz9G,EAAEgxE,OAAS,EAAA,MAAA,IACHs6J,WAAW,kCAED,IAAftrO,EAAE8+R,UAAkB9+R,EAAE++R,MAAM,GAAK/+R,EAAE++R,MAAM,UAG3ChzL,KAAKgzL,MAAM,GAAKthL,EAOzBskL,MAAMtkL,GACJ89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAE7B1R,KAAK/6B,OAASW,KAAKq0B,IAAI+F,KAAK/6B,OAAQysC,EAAIzsC,gBAE/BkC,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAC/B64B,KAAKgzL,MAAM7rN,IAAMuqC,EAAIshL,MAAM7rN,UAEtB64B,KAAKsiM,SAGdwvN,OAAOpgZ,UACL89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAE3B1R,KAAKgzL,MAAM,IAAMptN,KAAKu0L,IAAIzoJ,GAC1B1R,KAAK/6B,OAAS,EAEP+6B,KAAK4vZ,aAGd15N,KAAKxkL,UACI1R,KAAKq1B,QAAQ2gK,MAAMtkL,GAG5BqgZ,MAAMrgZ,UACG1R,KAAKq1B,QAAQy8X,OAAOpgZ,GAG7BsgZ,OAAOtgZ,GACL89Y,EAAQE,EAAMh+Y,GAAM,MAAO,aAErBz9G,EAAI+rG,KAAKgzL,MAAM,GAAKptN,KAAKu0L,IAAIzoJ,UAEV,IAAlB1R,KAAK+yL,SAAuB,GAAJ9+R,EAASA,EAO1C6hS,IAAIpkL,GACF89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,cAEzB9D,EAAI5N,KACJ6N,EAAI6D,SAEJ9D,IAAMC,EACDD,EAEyB,IAA7BA,EAAEmlL,SAAWllL,EAAEklL,UACXnlL,EAAEioL,KAAKhoL,GAEkB,IAA7BD,EAAEmlL,SAAWllL,EAAEklL,WAIlBnlL,EAAE0nL,MAAM,GACRznL,EAAEynL,MAAM,GACR1nL,EAAEooL,MAAMnoL,GACRD,EAAE8jL,MAAM,GACR7jL,EAAE6jL,MAAM,GACD9jL,IAITC,EAAIA,EAAEwnB,QAEa,IAAfznB,EAAEmlL,YACHnlL,EAAGC,GAAAA,CAAMA,EAAGD,IAKfC,EAAEynL,MAAM,GACR1nL,EAAEynL,MAAMxnL,EAAEojK,aACVpjK,EAAEmoL,MAAMpoL,GACRC,EAAE6jL,MAAM,GAED7jL,EAAEg+O,MAAM7rP,OAGjBiyZ,KAAKvgZ,UACH89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAES,IAA/B1R,KAAK+yL,SAAYrhL,EAAM,GACnB1R,KAAK81L,IAAAA,IAAQ/H,EAAGr8K,KAEzB1R,KAAKgzL,MAAM,IAAMthL,EAEV1R,MAGT0wB,GAAGhf,UACM1R,KAAKq1B,QAAQygK,IAAIpkL,GAG1BwgZ,IAAIxgZ,UACK1R,KAAKq1B,QAAQ48X,KAAKvgZ,GAO3BmkL,KAAKnkL,GACH89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAE7B1R,KAAK+zL,QAAQriL,EAAIzsC,gBAERkC,EAAI,EAAGA,EAAIuqC,EAAIzsC,OAAQkC,IAC9B64B,KAAKgzL,MAAM7rN,IAAMuqC,EAAIshL,MAAM7rN,UAGtB64B,KAGTmyZ,MAAMzgZ,UACJ89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAE3B1R,KAAKgzL,MAAM,IAAMptN,KAAKu0L,IAAIzoJ,GAEnB1R,KAGT+1L,IAAIrkL,UACK1R,KAAKq1B,QAAQwgK,KAAKnkL,GAG3B0gZ,KAAK1gZ,UACI1R,KAAKq1B,QAAQ88X,MAAMzgZ,GAO5B0kL,KAAK1kL,GACH89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,cAEzB9D,EAAI5N,KACJ6N,EAAI6D,SAEJ9D,IAAMC,GACRD,EAAEolL,MAAM,GAAK,EACbplL,EAAE3oC,OAAS,EACX2oC,EAAEmlL,SAAW,EACNnlL,GAGyB,IAA7BA,EAAEmlL,SAAWllL,EAAEklL,UACXnlL,EAAEuoL,MAAMtoL,GAEiB,IAA7BD,EAAEmlL,SAAWllL,EAAEklL,WAGlBnlL,EAAE0nL,MAAM,GACRznL,EAAEynL,MAAM,GACR1nL,EAAEuoL,MAAMtoL,GACRD,EAAE8nL,OACF7nL,EAAE6jL,MAAM,GACD9jL,IAIU,IAAfA,EAAEmlL,YACHnlL,EAAGC,GAAAA,CAAMA,EAAEwnB,QAASznB,IAKvBC,EAAEynL,MAAM,GACR1nL,EAAEuoL,MAAMtoL,GACRD,EAAE0nL,MAAM,GACR1nL,EAAE8nL,OACF7nL,EAAE6jL,MAAM,GAED9jL,EAAEi+O,MAAM7rP,OAGjBqyZ,MAAM3gZ,UACJ89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAES,IAA/B1R,KAAK+yL,SAAYrhL,EAAM,GACnB1R,KAAKo2L,KAAAA,IAASrI,EAAGr8K,KAE1B1R,KAAKgzL,MAAM,IAAMthL,EAEV1R,MAGT+pK,IAAIr4J,UACK1R,KAAKq1B,QAAQ+gK,KAAK1kL,GAG3B4gZ,KAAK5gZ,UACI1R,KAAKq1B,QAAQg9X,MAAM3gZ,GAO5BykL,MAAMzkL,GACJ89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,cAEzB7qC,EAAIm5B,KACJ1mB,EAAIo4B,EAEJ7qC,EAAE5B,OAASqU,EAAErU,UACd4B,EAAGyS,GAAAA,CAAMA,EAAGzS,QAEXM,EAAI,OAEDA,EAAImS,EAAErU,OAAQkC,IACnB64B,KAAKgzL,MAAM7rN,GAAKN,EAAEmsN,MAAM7rN,GAAKmS,EAAE05M,MAAM7rN,MAEnCN,IAAMm5B,SACRA,KAAKuvZ,OAAO1ob,EAAE5B,QAEPkC,EAAIN,EAAE5B,OAAQkC,IACnB64B,KAAKgzL,MAAM7rN,GAAKN,EAAEmsN,MAAM7rN,UAG5B64B,KAAK/6B,OAAS4B,EAAE5B,OAET+6B,KAAKsiM,SAGdiwN,OAAO7gZ,UACL89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAE3B1R,KAAKgzL,MAAM,IAAMptN,KAAKu0L,IAAIzoJ,GAEnB1R,KAAK4vZ,aAGdv5N,KAAK3kL,UACI1R,KAAKq1B,QAAQ8gK,MAAMzkL,GAG5B8gZ,MAAM9gZ,UACG1R,KAAKq1B,QAAQk9X,OAAO7gZ,GAO7B+gZ,cACwB,IAAlBzyZ,KAAK+yL,SAEP/yL,KAAK01L,OAAOhE,MAAM,GAGlB1xL,KAAKs1L,MAAM,GAAGI,OAET11L,KAGTtmG,aACSsmG,KAAKq1B,QAAQo9X,OAGtBp9N,MAAMnnI,GACJshW,EAASthW,IAAU,IAAOA,EAAO,QAAS,gBAEpClgD,EAAIkgD,EAAQ,OAEdhyE,EAAItW,KAAKwhL,KAAKl5F,EAAQ,IACtB/mF,EAAI,MAGR64B,KAAK+zL,QAAQ73M,GAET8xB,EAAI,IACN9xB,GAAK,GAGA/U,EAAI+U,EAAG/U,IACZ64B,KAAKgzL,MAAM7rN,IAAM,gBAGf6mC,EAAI,IACNhO,KAAKgzL,MAAM7rN,KAAO,GAAK6mC,GAAK,GAGvBhO,KAAKsiM,SAGd7M,KAAKvnI,UACIluD,KAAKq1B,QAAQggK,MAAMnnI,GAO5BwkW,KAAKhhZ,UACH89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,OAAQ,UAC9B89Y,EAAQ99Y,EAAIu/J,aAAe,GAAI,OAAQ,UAChCjxK,KAAK09L,MAAMhsL,EAAI1S,YAGxB0+L,MAAMtjE,UACGp6H,KAAKu9L,OAAOnjE,GAGrBumE,IAAIjvL,UACK1R,KAAKq1B,QAAQq9X,KAAKhhZ,GAG3BqsL,KAAK3jE,UACIp6H,KAAKq1B,QAAQqoK,MAAMtjE,GAO5Bu4R,MAAMjhZ,UACJ89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,OAAQ,UAC9B89Y,EAAQ99Y,EAAIu/J,aAAe,GAAI,OAAQ,UAChCjxK,KAAKu9L,OAAO7rL,EAAI1S,YAGzBu+L,OAAOnjE,GACLo1R,EAASp1R,IAAS,IAAOA,EAAM,OAAQ,gBAEjCpsH,EAAIosH,EAAO,GACXl+I,GAAKk+I,EAAOpsH,GAAK,GACjBgxH,GAAS,GAAKhxH,GAAK,GAAO,GAAKA,KAE3B,IAANA,EAAM,KACJ6vH,EAAQ,UAEH12J,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAAAA,OACzBktN,EAASr0L,KAAKgzL,MAAM7rN,GAAK63J,EACzBvyJ,GAAsB,EAAhBuzB,KAAKgzL,MAAM7rN,IAAUktN,GAAWrmL,EAE5ChO,KAAKgzL,MAAM7rN,GAAKsF,EAAIoxJ,EAEpBA,EAAQw2D,IAAY,GAAKrmL,EAGb,IAAV6vH,IACF79H,KAAKuvZ,OAAOvvZ,KAAK/6B,OAAS,GAC1B+6B,KAAKgzL,MAAMhzL,KAAK/6B,UAAY44J,MAItB,IAAN3hJ,EAAM,CACR8jB,KAAKuvZ,OAAOvvZ,KAAK/6B,OAASiX,WAEjB/U,EAAI64B,KAAK/6B,OAAS,EAAGkC,GAAK,EAAGA,IACpC64B,KAAKgzL,MAAM7rN,EAAI+U,GAAK8jB,KAAKgzL,MAAM7rN,WAExBA,EAAI,EAAGA,EAAI+U,EAAG/U,IACrB64B,KAAKgzL,MAAM7rN,GAAK,EAElB64B,KAAK/6B,QAAUiX,SAGV8jB,KAAKsiM,SAGdswN,KAAKlhZ,UACI1R,KAAKq1B,QAAQs9X,MAAMjhZ,GAG5BssL,MAAM5jE,UACGp6H,KAAKq1B,QAAQkoK,OAAOnjE,GAO7By4R,OAAOz4R,EAAM0E,SACL9wH,EAAIosH,EAAO,GACXl+I,EAAItW,KAAKq0B,KAAKmgI,EAAOpsH,GAAK,GAAIhO,KAAK/6B,QACnC+5J,GAAQ,GAAKhxH,GAAK,KAGpB8wH,EAAAA,CACFA,EAAOywR,OAAOrza,WAEL/U,EAAI,EAAGA,EAAI+U,EAAG/U,IACrB23J,EAAOk0D,MAAM7rN,GAAK64B,KAAKgzL,MAAM7rN,GAE/B23J,EAAO75J,OAASiX,KAGR,IAANA,QAAM,GAEC8jB,KAAK/6B,OAASiX,EAAAA,CACvB8jB,KAAK/6B,QAAUiX,UACN/U,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAC/B64B,KAAKgzL,MAAM7rN,GAAK64B,KAAKgzL,MAAM7rN,EAAI+U,QAEjC8jB,KAAKgzL,MAAM,GAAK,EAChBhzL,KAAK/6B,OAAS,MAGZ44J,EAAQ,KAEF,IAAN7vH,UACO7mC,EAAI64B,KAAK/6B,OAAS,EAAGkC,GAAK,EAAGA,IAAAA,OAC9Bq7C,EAAuB,EAAhBxiB,KAAKgzL,MAAM7rN,GAExB64B,KAAKgzL,MAAM7rN,GAAM02J,GAAU,GAAK7vH,EAAOwU,IAASxU,EAEhD6vH,EAAQr7G,EAAOw8G,SAKfF,IACY,IAAVjB,GACFiB,EAAOywR,OAAOzwR,EAAO75J,OAAS,GAC9B65J,EAAOk0D,MAAMl0D,EAAO75J,UAAY44J,IAEV,IAAlBiB,EAAO75J,SACT65J,EAAOk0D,MAAMl0D,EAAO75J,UAAY,GAElC65J,EAAOwjE,WAIJtiM,KAAKsiM,SAOdwwN,KAAKphZ,UACH89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,OAAQ,UAC9B89Y,EAAQ99Y,EAAIu/J,aAAe,GAAI,OAAQ,UAChCjxK,KAAK89L,MAAMpsL,EAAI1S,YAGxB8+L,MAAM1jE,UACJo1R,EAASp1R,IAAS,IAAOA,EAAM,OAAQ,UAEjB,IAAlBp6H,KAAK+yL,UAIP/yL,KAAKs1L,MAAM,GACXt1L,KAAK2xL,OAAOv3D,GACZp6H,KAAK0xL,MAAM,GACJ1xL,MAGFA,KAAK2xL,OAAOv3D,GAGrB24R,IAAIrhZ,UACK1R,KAAKq1B,QAAQy9X,KAAKphZ,GAG3BusL,KAAK7jE,UACIp6H,KAAKq1B,QAAQyoK,MAAM1jE,GAO5B44R,MAAMthZ,UACJ89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,OAAQ,UAC9B89Y,EAAQ99Y,EAAIu/J,aAAe,GAAI,OAAQ,UAChCjxK,KAAK2xL,OAAOjgL,EAAI1S,YAGzB2yL,OAAOv3D,UACLo1R,EAASp1R,IAAS,IAAOA,EAAM,OAAQ,UAChCp6H,KAAK6yZ,OAAOz4R,EAAM,MAG3B64R,KAAKvhZ,UACI1R,KAAKq1B,QAAQ29X,MAAMthZ,GAG5BwsL,MAAM9jE,UACGp6H,KAAKq1B,QAAQs8J,OAAOv3D,GAO7Bo8D,KAAKC,EAAK98L,UACR61Z,EAAS/4N,IAAQ,IAAOA,EAAK,MAAO,UAEd,IAAlBz2L,KAAK+yL,UACP/yL,KAAKs1L,MAAM,GACXt1L,KAAKkzZ,MAAMz8N,GAAM98L,GACjBqG,KAAK0xL,MAAM,GACJ1xL,MAGFA,KAAKkzZ,MAAMz8N,EAAK98L,GAGzBu5Z,MAAMz8N,EAAK98L,GACT61Z,EAAS/4N,IAAQ,IAAOA,EAAK,MAAO,gBAE9BzoL,EAAIyoL,EAAM,GACVv6M,GAAKu6M,EAAMzoL,GAAK,UAEtBhO,KAAK+zL,QAAQ73M,EAAI,GAEbyd,EACFqG,KAAKgzL,MAAM92M,IAAO,GAAK8xB,EAEvBhO,KAAKgzL,MAAM92M,MAAQ,GAAK8xB,GAEnBhO,KAAKsiM,SAGd9M,MAAMiB,GACJ+4N,EAAS/4N,IAAQ,IAAOA,EAAK,MAAO,gBAE9BzoL,EAAIyoL,EAAM,GACVv6M,GAAKu6M,EAAMzoL,GAAK,MAGlBhO,KAAK/6B,QAAUiX,EAAAA,OACV8jB,KAAK+yL,eAGRtuE,EAAIzkH,KAAKgzL,MAAM92M,GACfyd,EAAO8qH,GAAKz2G,EAAK,KAED,IAAlBhO,KAAK+yL,SAAa,IAChB/kL,EAAI,GAAMy2G,GAAM,GAAKz2G,GAAK,EAAA,OACf,EAANrU,MAELrI,EAAIpV,OAEDoV,QACD0O,KAAKgzL,MAAM1hM,GAAK,EAAA,OACL,EAANqI,SAINA,EAGTq2Z,OAAOv5N,GACL+4N,EAAS/4N,IAAQ,IAAOA,EAAK,MAAO,gBAE9BzoL,EAAIyoL,EAAM,GACVv6M,GAAKu6M,EAAMzoL,GAAK,UAGlBhO,KAAK/6B,QAAUiX,EACV,EAGD8jB,KAAKgzL,MAAM92M,IAAM8xB,EAAK,EAGhCmwL,OAAO/jE,UACLo1R,EAASp1R,IAAS,IAAOA,EAAM,OAAQ,UAEjB,IAAlBp6H,KAAK+yL,WACP/yL,KAAKs1L,MAAM,GACXt1L,KAAKq1L,MAAMj7D,EAAO,GAClBp6H,KAAK01L,QAGA11L,KAAKmzZ,QAAQ/4R,GAGtBgkE,MAAMhkE,UACGp6H,KAAKq1B,QAAQ8oK,OAAO/jE,GAG7B+4R,QAAQ/4R,GACNo1R,EAASp1R,IAAS,IAAOA,EAAM,OAAQ,gBAEjCpsH,EAAIosH,EAAO,OAEbl+I,GAAKk+I,EAAOpsH,GAAK,UAEjBhO,KAAK/6B,QAAUiX,EACV8jB,MAEC,IAANgO,IACF9xB,GAAK,GAEP8jB,KAAK/6B,OAASW,KAAKq0B,IAAI/d,EAAG8jB,KAAK/6B,QAErB,IAAN+oC,IACFhO,KAAKgzL,MAAMhzL,KAAK/6B,OAAS,KAAO,GAAK+oC,GAAK,GAExB,IAAhBhO,KAAK/6B,SACP+6B,KAAKgzL,MAAMhzL,KAAK/6B,UAAY,GAEvB+6B,KAAKsiM,UAGd8wN,OAAOh5R,UACEp6H,KAAKq1B,QAAQ89X,QAAQ/4R,GAG9Bq3D,MAAM//K,UACG1R,KAAKgzL,MAAM,GAAKthL,EAGzB+kL,IAAI7+M,UACKooB,KAAKgwZ,OAAOp4a,GAGrBwiJ,KAAKxiJ,EAAKs2E,GACRshW,EAAS53a,IAAQ,IAAOA,EAAK,MAAO,UACpC43a,EAASthW,IAAU,IAAOA,EAAO,QAAS,UAC1CshW,EAAQthW,GAAS,GAAI,QAAS,eAExBvpD,EAAQ/sB,EAAM,GACdrS,GAASqS,EAAM+sB,GAAS,MAE1Bp/B,GAASy6B,KAAK/6B,OAAAA,OACT,MAELm1J,EAAQp6H,KAAKgzL,MAAMztN,IAAUo/B,GAAW,GAAKupD,GAAS,KAEtDvpD,EAAQupD,EAAQ,IAAM3oF,EAAQ,EAAIy6B,KAAK/6B,OAAAA,OACnCsyS,EAAO5yQ,EAAQupD,EAAQ,GAG7BksE,IAFap6H,KAAKgzL,MAAMztN,EAAQ,IAAO,GAAKgyS,GAAQ,IAEnC,GAAK5yQ,SAGjBy1H,EAOTs7D,cACO11L,KAAK6uL,WACR7uL,KAAK+yL,UAAY,GAEZ/yL,KAGT41L,aACS51L,KAAKq1B,QAAQqgK,OAGtB6I,cACEv+L,KAAK+yL,SAAW,EACT/yL,KAGTm6J,aACSn6J,KAAKq1B,QAAQkpK,OAOtBp3L,IAAIuK,MACF89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAEzB1R,KAAK+yL,WAAarhL,EAAIqhL,SAAAA,OACjBrhL,EAAIqhL,SAAW/yL,KAAK+yL,eAEvBhnN,EAAMi0B,KAAK0/L,KAAKhuL,UAEA,IAAlB1R,KAAK+yL,SACO,GAANhnN,EAEHA,EAGTimN,KAAKtgL,GACH89Y,EAAQE,EAAMh+Y,GAAM,MAAO,aAErBqhL,EAAYrhL,EAAM,EAAK,KAEzB1R,KAAK+yL,WAAaA,EAAAA,OACbA,EAAW/yL,KAAK+yL,eAEnBhnN,EAAMi0B,KAAKoxZ,MAAM1/Y,UAED,IAAlB1R,KAAK+yL,SACO,GAANhnN,EAEHA,EAGTwnC,GAAG7B,UACwB,IAAlB1R,KAAKmH,IAAIuK,GAGlBuuL,IAAIvuL,UACwB,IAAnB1R,KAAKgyL,KAAKtgL,GAGnB16G,GAAG06G,UACM1R,KAAKmH,IAAIuK,GAAO,EAGzBiuL,IAAIjuL,UACK1R,KAAKgyL,KAAKtgL,GAAO,EAG1BmuL,IAAInuL,UACK1R,KAAKmH,IAAIuK,IAAQ,EAG1BkuL,KAAKluL,UACI1R,KAAKgyL,KAAKtgL,IAAQ,EAG3Bx6G,GAAGw6G,UACM1R,KAAKmH,IAAIuK,GAAO,EAGzBouL,IAAIpuL,UACK1R,KAAKgyL,KAAKtgL,GAAO,EAG1BsuL,IAAItuL,UACK1R,KAAKmH,IAAIuK,IAAQ,EAG1BquL,KAAKruL,UACI1R,KAAKgyL,KAAKtgL,IAAQ,EAG3B42I,cACwB,IAAlBtoJ,KAAK+yL,UACC,EAEU,IAAhB/yL,KAAK/6B,QAAkC,IAAlB+6B,KAAKgzL,MAAM,GAC3B,EAEF,EAGTnE,gBACyB,IAAhB7uL,KAAK/6B,QAAkC,IAAlB+6B,KAAKgzL,MAAM,GAGzC2C,eAC2B,IAAlB31L,KAAK+yL,SAGdsgO,eAC2B,IAAlBrzZ,KAAK+yL,SAGdxE,eACiC,IAAP,EAAhBvuL,KAAKgzL,MAAM,IAGrB7X,gBACiC,IAAP,EAAhBn7K,KAAKgzL,MAAM,IAOrB0M,KAAKhuL,MACH89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAEzB1R,KAAK/6B,OAASysC,EAAIzsC,OAAAA,OACZ,KAEN+6B,KAAK/6B,OAASysC,EAAIzsC,OAAAA,OACb,UAEAkC,EAAI64B,KAAK/6B,OAAS,EAAGkC,GAAK,EAAGA,IAAAA,OAC9BN,EAAoB,EAAhBm5B,KAAKgzL,MAAM7rN,GACfmS,EAAmB,EAAfo4B,EAAIshL,MAAM7rN,MAEhBN,IAAMyS,SAGFzS,EAAIyS,IAAMzS,EAAIyS,UAGjB,EAGT83a,MAAM1/Y,MACJ89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAEvB1R,KAAK/6B,OAAS,EAAA,OACT,QAEHw/I,EAAoB,EAAhBzkH,KAAKgzL,MAAM,UAEjBthL,EAAM,IACRA,GAAOA,IAED+yG,EAAI/yG,IAAQ+yG,EAAI/yG,GAO1B4hZ,SAAS5hZ,SACDw8K,EAAMmhO,EAAathO,EAAGG,IAAIx8K,GAAOq8K,EAAGgV,KAAKrxL,UACxC1R,KAAKiuL,MAAMC,GAAKqlO,cAGzBC,OAAO9hZ,MAIL89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAEzBA,EAAIm9K,UAAYn9K,EAAIypK,SAAAA,MAAAA,IACZriL,MAAM,kCAEdjyB,EAAIm5B,KAAKyzZ,eACTn6a,EAAIo4B,EAAI2jB,QACR/jC,EAAI,MAEJhY,EAAEq8M,UACA9uN,EAAE8uN,UACJrkM,GAAK,GACPhY,EAAEo8M,SAGA7uN,EAAE8uN,SAAW9uN,EAAE64N,KAAKpmN,IAAM,IAC5BzS,EAAEm7N,KAAK1oN,IAEDzS,EAAEgoN,UAAAA,IAGG,EAFEhoN,EAAE6sb,WAEJ,OACHC,EAAQr6a,EAAEm4M,MAAM,GAER,IAAVkiO,GAAyB,IAAVA,IACjBria,GAAKA,GAGLzqB,EAAE64N,KAAKpmN,GAAK,KACbzS,EAAGyS,GAAAA,CAAMA,EAAGzS,GAEM,IAAfA,EAAE4qN,MAAM,IAA2B,IAAfn4M,EAAEm4M,MAAM,KAC9BngM,GAAKA,IAGTzqB,EAAE4ob,MAAM5ob,EAAGyS,GAAGq4M,OAAO,SAEfgiO,EAAQr6a,EAAEm4M,MAAM,GAER,IAAVkiO,GAAyB,IAAVA,IACjBria,GAAKA,UAGS,IAAdhY,EAAE04M,KAAK,GACF,EAEF1gM,EAGTsia,UAAUliZ,GACR89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,gBAEvB8qJ,EAAAA,CACJ,EAAI,EAAG,GAAI,EACX,GAAI,EAAG,EAAI,OAGT31L,EAAIm5B,KAAKyzZ,eACTn6a,EAAIo4B,EAAI2jB,QACRhhI,EAAI,KAEJilF,EAAEu1M,SAAAA,OACkB,IAAfhoN,EAAEuqb,MAAM,GAAW/8f,EAAI,MAE3BwyE,EAAE0nN,UAAYj1M,EAAEi1M,QAAAA,OACZ,MAIE,EAFEj1M,EAAEo6a,aAGbr/f,EAAImoQ,EAAM31L,EAAE4qN,MAAM,KAEhBn4M,EAAEq8M,UACA9uN,EAAE8uN,UACJthS,GAAKA,GACPilF,EAAEo8M,SAGI7uN,EAAEgoN,UAAAA,CAGG,EAFEhoN,EAAE6sb,aAGbr/f,GAAKmoQ,EAAMljL,EAAEm4M,MAAM,MAEX5qN,EAAEmsN,MAAM,GAAmB,SAAbnsN,EAAEksN,UAElBz5M,EAAE05M,MAAM,GAAK,IACnB3+R,GAAKA,GAEPilF,EAAE0oN,KAAKn7N,IAENA,EAAGyS,GAAAA,CAAMA,EAAGzS,GAEbyS,EAAEy5M,SAAW,SAGG,IAAdz5M,EAAE04M,KAAK,GACF,EAEF39R,EAGTw/f,KAAKniZ,UACI1R,KAAKmxK,IAAIz/J,GAAKm6O,MAAM7rP,MAG7BmxK,IAAIz/J,MACF89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAEzB1R,KAAK6uL,SAAAA,OACAn9K,EAAIyoJ,SAETzoJ,EAAIm9K,SAAAA,OACC7uL,KAAKm6J,UAEVtzL,EAAIm5B,KAAKq1B,QACT/7C,EAAIo4B,EAAI2jB,QAEZxuD,EAAEksN,SAAW,EACbz5M,EAAEy5M,SAAW,QAGPpuL,EAAQ99B,EAAEitb,SAASx6a,OAEX,IAAVqrB,IACF99B,EAAE8qN,OAAOhtL,GACTrrB,EAAEq4M,OAAOhtL,OAIT99B,EAAE6sb,WACFp6a,EAAEo6a,iBAEIvsZ,EAAMtgC,EAAE64N,KAAKpmN,MAEf6tB,EAAM,GAEPtgC,EAAGyS,GAAAA,CAAMA,EAAGzS,WACI,IAARsgC,GAA4B,IAAf7tB,EAAE83a,MAAM,SAMhCvqb,EAAE4ob,MAAM5ob,EAAGyS,UAGNA,EAAEikN,OAAO54L,GAGlBovZ,KAAKriZ,UACI1R,KAAKg0Z,IAAItiZ,GAAKm6O,MAAM7rP,MAG7Bg0Z,IAAItiZ,UACF89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAEzB1R,KAAK6uL,UAAYn9K,EAAIm9K,SAAAA,IACZd,EAAG,GAET/tL,KAAKwwZ,IAAIxwZ,KAAKmxK,IAAIz/J,IAAMk+K,IAAIl+K,GAAK6sL,OAG1CU,KAAKvtL,MACH89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAEzB1R,KAAK6uL,oBAEDd,EAAG,GAAA,IACHA,EAAGr8K,EAAI42I,QACX52I,EAAIyoJ,UAIJzoJ,EAAIm9K,oBAEAd,EAAG/tL,KAAKsoJ,QAAAA,IACRylC,EAAG,GACP/tL,KAAKm6J,aAIHvsJ,EAAI5N,KAAKq1B,QACTxnB,EAAI6D,EAAI2jB,QAEdznB,EAAEmlL,SAAW,EACbllL,EAAEklL,SAAW,QAGPzuE,EAAAA,IAAQypE,EAAG,GACX7qE,EAAAA,IAAQ6qE,EAAG,GAGXnpE,EAAAA,IAAQmpE,EAAG,GACXnoE,EAAAA,IAAQmoE,EAAG,GAGX3pE,EAAIx2G,EAAEkmZ,SAASjmZ,GAEjBu2G,EAAI,IACNx2G,EAAE+jL,OAAOvtE,GACTv2G,EAAE8jL,OAAOvtE,UAGLgtD,EAAKxjK,EAAEynB,QACP6pK,EAAKrxL,EAAEwnB,cAELznB,EAAEihL,UAAAA,KACJ1nN,EAAIymC,EAAE8lZ,WACNpia,EAAIuc,EAAE6lZ,gBAEHvsb,MACDm9I,EAAEiqE,SAAWrrE,EAAEqrE,WACjBjqE,EAAE8qE,KAAK8P,GACPh8E,EAAEmsE,KAAKje,IAGT9sD,EAAEqtE,OAAO,GACTzuE,EAAEyuE,OAAO,QAGJrgM,MACDszH,EAAE2pE,SAAW3oE,EAAE2oE,WACjB3pE,EAAEwqE,KAAK8P,GACPt5E,EAAEypE,KAAKje,IAGTxsD,EAAE+sE,OAAO,GACT/rE,EAAE+rE,OAAO,GAGP/jL,EAAEzG,IAAI0G,IAAM,GACdD,EAAEyhL,KAAKxhL,GACPy2G,EAAE+qE,KAAKzqE,GACP1B,EAAEmsE,KAAKzpE,KAEP/3G,EAAEwhL,KAAKzhL,GACPg3G,EAAEyqE,KAAK/qE,GACPsB,EAAEypE,KAAKnsE,WAIW,IAAlBljH,KAAK+yL,UACPnuE,EAAE8wE,OAEiB,IAAjBhkL,EAAIqhL,UACNntE,EAAE8vE,QAEI9wE,EAAGgB,EAAG/3G,EAAE0vL,OAAOn5E,IAGzB6vS,QAAQviZ,UACC1R,KAAK05R,OAAOhoR,GAAKm6O,MAAM7rP,MAGhC05R,OAAOhoR,MACL89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7B/hB,EAAM+hB,EAAI42I,OAAS,EAAG,UAElB52I,EAAI68K,QAAAA,OACCvuL,KAAKk0Z,SAASxiZ,MAEH,IAAhBA,EAAIsgL,KAAK,GAAO,MAAA,IACRzyD,WAAW,yBAEhBrjJ,EAAAA,CAAIkoI,GAAKpkH,KAAKi/L,KAAKvtL,MAER,IAAd0yG,EAAE4tE,KAAK,GAAO,MAAA,IACNzyD,WAAW,0BAEhBrjJ,EAAE8lN,KAAKtwL,GAGhByiZ,QAAQziZ,UACC1R,KAAKo0Z,OAAO1iZ,GAAKm6O,MAAM7rP,MAGhCo0Z,OAAO1iZ,SACCw8K,EAAMmhO,EAAathO,EAAGG,IAAIx8K,GAAOq8K,EAAGgV,KAAKrxL,UACxC1R,KAAKiuL,MAAMC,GAAKmmO,YAAYh0N,UAGrCi0N,MAAMzmZ,EAAG3uB,EAAG6jN,UACH/iM,KAAKu0Z,KAAK1mZ,EAAG3uB,EAAG6jN,GAAM8oD,MAAM7rP,MAGrCu0Z,KAAK1mZ,EAAG3uB,EAAG6jN,SACH7U,GAAOmhO,GAActsN,EAAOhV,EAAGgV,KAAK7jN,GAAK6uM,EAAGG,IAAIhvM,UAC/C8gB,KAAKiuL,MAAMC,GAAKgT,OAAOrzL,GAAGwyL,UAGnCm0N,OAAO3mZ,EAAG3uB,EAAG6jN,UACJ/iM,KAAKy0Z,MAAM5mZ,EAAG3uB,EAAG6jN,GAAM8oD,MAAM7rP,MAGtCy0Z,MAAM5mZ,EAAG3uB,EAAG6jN,SACJ7U,EAAM6U,EAAOhV,EAAGgV,KAAK7jN,GAAK6uM,EAAGG,IAAIhvM,UAChC8gB,KAAKiuL,MAAMC,GAAKwmO,QAAQ7mZ,GAAGwyL,UAGpCs0N,OAAOztb,UACE84B,KAAK40Z,MAAM1tb,GAAG2kR,MAAM7rP,MAG7B40Z,MAAM1tb,OAGAgnN,SAFJshO,EAAQzhO,EAAG+E,KAAK5rN,GAAI,IAAK,UAMvBgnN,EAFiB,IAAfhnN,EAAEuqN,MAAM,IAA2B,IAAfvqN,EAAEuqN,MAAM,GAExB1D,EAAGG,IAAIhnN,GAEP6mN,EAAGgV,KAAK77N,GAGT84B,KAAKiuL,MAAMC,GAAKI,UAAU+R,UAGnCw0N,QAAQ3tb,EAAGonC,UACFtO,KAAK80Z,OAAO5tb,EAAGonC,GAAGu9O,MAAM7rP,MAGjC80Z,OAAO5tb,EAAGonC,SACFguF,EAAKt8F,KAAK40Z,MAAM1tb,GAChB6tb,EAAK/0Z,KAAK40Z,MAAMtmZ,IACfgqK,EAAI08O,GAAM9tb,EAAE+3N,KAAK3wL,GAClBurC,EAAMk7W,EAAGnlO,IAAItX,GAAIsX,IAAI1oN,GACrB+gO,EAAM3rG,EAAGszF,IAAIolO,GAAIplO,IAAIthL,GACrBr6G,EAAIizE,EAAE0oN,IAAIthL,UAETurC,EAAIu1I,KAAK6Y,GAAKjG,KAAK/tS,GAO5BghgB,QAAQ1hP,EAAK2hP,EAAMngM,UACjBy6L,EAAS0F,IAAS,IAAOA,EAAM,OAAQ,YAElCl1Z,KAAKm1Z,UAAU5hP,EAAK2hP,EAAO,GAAG,MAG9Bl1Z,KAAKo1Z,aAAargM,GAMzBogM,UAAU5hP,EAAK2hP,EAAMG,GAAS,GAC5B7F,EAAS0F,IAAS,IAAOA,EAAM,OAAQ,UACvC1F,EAAQ0F,EAAO,EAAG,OAAQ,WAC1B1F,EAA0B,kBAAX6F,EAAsB,SAAU,iBAEzCphgB,EAAI+rG,QAEN/rG,EAAE+9R,KAAK,GAAK,SACO,IAAd/9R,EAAE+9R,KAAK,IACO,IAAd/9R,EAAE+9R,KAAK,IACO,IAAd/9R,EAAE+9R,KAAK,MAGZ/9R,EAAEknR,SAAAA,OACG,QAEHm6O,EAAMrhgB,EAAEqqS,KAAK,GACbi3N,EAAMD,EAAIh3N,KAAK,GACfjqS,EAAIihgB,EAAIngO,WACR7mL,EAAIgnZ,EAAIp3N,MAAM7pS,GAEd65R,EAAMH,EAAGG,IAAIj6R,GACbuhgB,EAAOF,EAAIrnO,MAAMC,GACjBw6D,EAAAA,IAAW36D,EAAG,GAAGE,MAAMC,GAEjC9wM,EAAAA,IAAAA,IACajW,EAAI,EAAGA,EAAI+tb,EAAM/tb,IAAAA,KACpBymC,EAEAzmC,IAAM+tb,EAAO,GAAKG,EACpBznZ,EAAAA,IAAQmgL,EAAG,IAEXngL,EAAImgL,EAAG3/K,OAAOmlK,EAAK,EAAGgiP,GACtB3nZ,EAAE0nL,MAAM,QAGNznL,EAAID,EAAEqgL,MAAMC,GAAKgT,OAAO5yL,MAER,IAAhBT,EAAE1G,IAAIuhP,IAA+B,IAAhB76O,EAAE1G,IAAIquZ,YAGtBlka,EAAI,EAAGA,EAAIj9F,EAAGi9F,IAAAA,IACrBuc,EAAIA,EAAEsgL,SAEc,IAAhBtgL,EAAE1G,IAAIquZ,GAAU,SACTp4a,KAES,IAAhBywB,EAAE1G,IAAIuhP,GAAU,OACX,SAGJ,UAGF,EAGT0sK,aAAargM,EAAQ,GACnBy6L,EAASz6L,IAAU,IAAOA,EAAO,QAAS,gBAEpC9gU,EAAI+rG,QAGN/rG,EAAE+9R,KAAK,IAAM,EAAA,OACR,KAGL/9R,EAAEknR,SAAAA,OACiB,IAAdlnR,EAAE+9R,KAAK,OAEZ9qN,EAAI,aAGFA,EAAI,cAEI4xB,MAAAA,8BAAoC7kG,EAAEmqG,SAAS,WAG7C,IAAV22N,GAAe7tP,EAAI6tP,SAEd,QAIHzjO,EADAssC,IAAQmwJ,EAAG7mN,EAAIA,EAAI,GACbssb,OAAOv/f,OAER,IAAPq9F,EAAO,SAGD,IAANA,EAAM,OACiB,IAAlBr9F,EAAE+9R,KAAK9qN,EAAI,MAEV,KAANA,GACEjzE,EAAEy9f,WAAAA,OACG,EAGXxqb,GAAK,QAGDgV,EAAIjoF,EAAEoqS,KAAK,GACXrwL,EAAI9xB,EAAEw3a,eAER+B,EAAAA,IAAS1nO,EAAG,GACZ2nO,EAAAA,IAAU3nO,EAAG7mN,WAERC,EAAI+U,EAAE+0L,YAAa9pM,GAAK,EAAGA,IAC9B+U,EAAE8za,OAAO7ob,IACXsub,EAAKA,EAAG7lO,IAAI8lO,GAAKhkO,MAAMxqN,GAAG86N,KAAK/tS,GAC/ByhgB,EAAMA,EAAIt4N,MAAM1L,MAAM,GAAGsQ,KAAK/tS,KAE9ByhgB,EAAMA,EAAI9lO,IAAI6lO,GAAI/jO,MAAMxqN,GAAG86N,KAAK/tS,GAChCwhgB,EAAKA,EAAGr4N,MAAM1L,MAAM,GAAGsQ,KAAK/tS,OAIb,IAAfwhgB,EAAGzjO,KAAK,IAAkC,IAAtByjO,EAAGtuZ,IAAIlzG,EAAEqqS,KAAK,IAAQ,OACtCz3N,EAAI4ub,EAAGt4N,KAAKj2N,GAAG86N,KAAK/tS,GACpBqlF,EAAIo8a,EAAI13N,MAAM,GAAGgE,KAAK/tS,MAEX,IAAb4yE,EAAEsgC,IAAI7tB,GAAO,OACR,UAGFylE,EAAI,EAAGA,EAAI/wC,EAAI,EAAG+wC,IAAAA,IACrB02W,EAAG5mO,SAAAA,OACE,KAEU,IAAf4mO,EAAGzjO,KAAK,GAAO,OACV,EAETyjO,EAAKA,EAAGr4N,MAAM1L,MAAM,GAAGsQ,KAAK/tS,UAGvB,EAOTmhS,OAAOlnI,UACiB,IAAlBluD,KAAK+yL,SACA/yL,KAAKm6J,MAAMk7B,MAAMnnI,GAAOonI,MAAM,GAEhCt1L,KAAKq1B,QAGdkgK,SAASrnI,UACPshW,EAASthW,IAAU,IAAOA,EAAO,QAAS,UAC1Cv+D,EAAMu+D,EAAQ,EAAG,SAEbluD,KAAKw1L,MAAMtnI,EAAQ,GACdluD,KAAKy1L,KAAKvnI,GAAOonI,MAAM,GAAGI,OAE5B11L,KAAKq1B,QAOd44J,MAAMh0G,MACJu1U,EAAQv1U,aAAeimH,EAAK,MAAO,qBAE/BlgM,KAAKkuL,IAAAA,MAAAA,IACGp1L,MAAM,wCAEXmhF,EAAIkmH,UAAUngM,MAGvBqgM,iBACEnS,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAIoS,YAAYtgM,MAG9BugM,SAAStmH,MACPu1U,EAAQv1U,aAAeimH,EAAK,MAAO,qBAE/BlgM,KAAKkuL,SACFj0G,EAAI/6F,EAAEq0B,GAAGvT,KAAKkuL,IAAIhvM,IAAM+6F,EAAI8oH,OAAS/iM,KAAKkuL,IAAI6U,KAAAA,MAAAA,IACvCjqM,MAAM,sCAElBnJ,EAAwB,IAAlBqQ,KAAK+yL,SAAgB,OAC3BpjM,EAAMqQ,KAAK0/L,KAAKzlH,EAAI/6F,GAAK,EAAG,cAGvB8gB,KAAKq1B,QAAQ+qK,UAAUnmH,GAGhCo0G,QAAQ38K,UACN89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAIkB,KAAKpvL,KAAM0R,GAG7B8uL,OAAO9uL,UACL89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,UACPluL,KAAKkuL,IAAIlvM,IAAIghB,KAAM0R,GAG5BikZ,SAASjkZ,UACP89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw8K,EAAIluL,KAAKkuL,IAAK,YACPluL,KAAKkuL,IAAIoH,MAAMt1L,KAAM0R,GAG9BkkZ,QAAQlkZ,UACN89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw8K,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAImQ,KAAKr+L,KAAM0R,GAG7Bk9K,QAAQl9K,UACN89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAImB,KAAKrvL,KAAM0R,GAG7B+uL,OAAO/uL,UACL89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,UACPluL,KAAKkuL,IAAI58J,IAAItxB,KAAM0R,GAG5BmkZ,SAASnkZ,UACP89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw8K,EAAIluL,KAAKkuL,IAAK,YACPluL,KAAKkuL,IAAIwD,MAAM1xL,KAAM0R,GAG9BokZ,QAAQpkZ,UACN89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw8K,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAIoQ,KAAKt+L,KAAM0R,GAG7B08K,QAAQ18K,UACN89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAIqB,KAAKvvL,KAAM0R,GAG7BkvL,OAAOlvL,UACL89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,UACPluL,KAAKkuL,IAAI0B,IAAI5vL,KAAM0R,GAG5BqkZ,SAASrkZ,UACP89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw8K,EAAIluL,KAAKkuL,IAAK,YACPluL,KAAKkuL,IAAI2F,MAAM7zL,KAAM0R,GAG9BskZ,QAAQtkZ,UACN89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw8K,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAIiP,KAAKn9L,KAAM0R,GAG7BukZ,QAAQvkZ,UACN89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAImqF,KAAKr4Q,KAAM0R,GAG7BwkZ,OAAOxkZ,UACL89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,UACPluL,KAAKkuL,IAAI56B,IAAItzJ,KAAM0R,GAG5BykZ,SAASzkZ,UACP89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw8K,EAAIluL,KAAKkuL,IAAK,YACPluL,KAAKkuL,IAAIyG,MAAM30L,KAAM0R,GAG9B0kZ,QAAQ1kZ,UACN89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw8K,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAI4Q,KAAK9+L,KAAM0R,GAG7B2kZ,QAAQ3kZ,UACN89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,WACdooO,GAAQ5kZ,EAAIw8K,IAAK,WACVluL,KAAKkuL,IAAI8iO,KAAKhxZ,KAAM0R,GAG7BwvL,OAAOxvL,UACL89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,UACdooO,GAAQ5kZ,EAAIw8K,IAAK,UACVluL,KAAKkuL,IAAI7uD,IAAIr/H,KAAM0R,GAG5B6kZ,SAAS7kZ,UACP89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw8K,EAAIluL,KAAKkuL,IAAK,YACPluL,KAAKkuL,IAAI+iO,MAAMjxZ,KAAM0R,GAG9BgjZ,QAAQhjZ,UACN89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw8K,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAIgjO,KAAKlxZ,KAAM0R,GAG7BqvL,iBACE7S,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAImP,KAAKr9L,MAGvBmuL,gBACED,EAAIluL,KAAKkuL,IAAK,UACPluL,KAAKkuL,IAAIkP,IAAIp9L,MAGtBw2Z,kBACEtoO,EAAIluL,KAAKkuL,IAAK,YACPluL,KAAKkuL,IAAIujO,MAAMzxZ,MAGxBsuL,iBACEJ,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAI8S,KAAKhhM,MAGvBy2Z,YAAY3xV,UACVopH,EAAIluL,KAAKkuL,IAAK,eACPluL,KAAKkuL,IAAIwoO,SAAS12Z,KAAM8kE,GAGjC6xV,WAAW7xV,UACTopH,EAAIluL,KAAKkuL,IAAK,cACPluL,KAAKkuL,IAAI0oO,QAAQ52Z,KAAM8kE,GAGhC+xV,qBACE3oO,EAAIluL,KAAKkuL,IAAK,eACPluL,KAAKkuL,IAAIwjO,SAAS1xZ,MAG3B82Z,QAAQplZ,UACN89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,WACdooO,GAAQ5kZ,EAAIw8K,IAAK,WACVluL,KAAKkuL,IAAIwkO,KAAK1yZ,KAAM0R,GAG7BgvL,OAAOhvL,UACL89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,UACdooO,GAAQ5kZ,EAAIw8K,IAAK,UACVluL,KAAKkuL,IAAIyS,IAAI3gM,KAAM0R,GAG5BqlZ,SAASrlZ,UACP89Y,EAAS99Y,IAAQ,IAAOA,EAAK,MAAO,UACpCw8K,EAAIluL,KAAKkuL,IAAK,YACPluL,KAAKkuL,IAAIwP,MAAM19L,KAAM0R,GAG9BslZ,QAAQtlZ,UACN89Y,EAAS99Y,IAAQ,IAAOA,EAAK,MAAO,UACpCw8K,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAI6P,KAAK/9L,KAAM0R,GAG7BulZ,iBACE/oO,EAAIluL,KAAKkuL,IAAK,WACPluL,KAAKkuL,IAAIwH,KAAK11L,MAGvBwuL,gBACEN,EAAIluL,KAAKkuL,IAAK,UACPluL,KAAKkuL,IAAI0H,IAAI51L,MAGtBk3Z,MAAMxlZ,UACJ89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7Bw8K,EAAIluL,KAAKkuL,IAAK,SACPluL,KAAKkuL,IAAI36K,GAAGvT,KAAM0R,GAG3BylZ,OAAOzlZ,UACL89Y,EAAQE,EAAMh+Y,GAAM,MAAO,OAC3Bw8K,EAAIluL,KAAKkuL,IAAK,UACPluL,KAAKkuL,IAAI+R,IAAIjgM,KAAM0R,GAG5B0lZ,mBACElpO,EAAIluL,KAAKkuL,IAAK,aACPluL,KAAKkuL,IAAImpO,OAAOr3Z,MAGzBs3Z,kBACEppO,EAAIluL,KAAKkuL,IAAK,YACPluL,KAAKkuL,IAAIqpO,MAAMv3Z,MAGxBw3Z,kBACEtpO,EAAIluL,KAAKkuL,IAAK,YACPluL,KAAKkuL,IAAIK,MAAMvuL,MAGxBy3Z,mBACEvpO,EAAIluL,KAAKkuL,IAAK,aACPluL,KAAKkuL,IAAI/S,OAAOn7K,MAGzBuzZ,qBACErlO,EAAIluL,KAAKkuL,IAAK,eACPluL,KAAKkuL,IAAIolO,SAAStzZ,MAG3B03Z,mBACExpO,EAAIluL,KAAKkuL,IAAK,aACPluL,KAAKkuL,IAAIslO,OAAOxzZ,MAGzB23Z,sBACEzpO,EAAIluL,KAAKkuL,IAAK,gBACPluL,KAAKkuL,IAAI0lO,UAAU5zZ,MAG5B43Z,oBACE1pO,EAAIluL,KAAKkuL,IAAK,cACPluL,KAAKkuL,IAAI+lO,QAAQj0Z,MAG1B63Z,mBACE3pO,EAAIluL,KAAKkuL,IAAK,aACPluL,KAAKkuL,IAAIwrG,OAAO15R,MAGzB83Z,oBACE5pO,EAAIluL,KAAKkuL,IAAK,cACPluL,KAAKkuL,IAAIimO,QAAQn0Z,MAG1Bq0Z,mBACEnmO,EAAIluL,KAAKkuL,IAAK,aACPluL,KAAKkuL,IAAIkmO,OAAOp0Z,MAOzB6rP,MAAMlpI,UACJA,EAAKqwE,MAAQhzL,KAAKgzL,MAClBrwE,EAAK19I,OAAS+6B,KAAK/6B,OACnB09I,EAAKowE,SAAW/yL,KAAK+yL,SACrBpwE,EAAKurE,IAAMluL,KAAKkuL,IACTvrE,EAGT4sS,OAAOtyZ,QACE+C,KAAKgzL,MAAM/tN,OAASg4B,GACzB+C,KAAKgzL,MAAMloN,KAAK,UAEXk1B,KAGT+zL,QAAQ92L,OACN+C,KAAKuvZ,OAAOtyZ,GAEL+C,KAAK/6B,OAASg4B,GACnB+C,KAAKgzL,MAAMhzL,KAAK/6B,UAAY,SAEvB+6B,KAGTsiM,cACStiM,KAAK/6B,OAAS,GAAqC,IAAhC+6B,KAAKgzL,MAAMhzL,KAAK/6B,OAAS,IACjD+6B,KAAK/6B,QAAU,SAEV+6B,KAAK4vZ,aAGdA,oBACE/2Z,EAAOmH,KAAK/6B,OAAS,GAGD,IAAhB+6B,KAAK/6B,QAAkC,IAAlB+6B,KAAKgzL,MAAM,KAClChzL,KAAK+yL,SAAW,GAEX/yL,KAGT+3Z,gBAEEl/Z,EAAOmH,KAAK/6B,OAAS,GAGrB4zB,EAAOmH,KAAK/6B,QAAU+6B,KAAKgzL,MAAM/tN,QAEb,IAAhB+6B,KAAK/6B,QAEe,IAAlB+6B,KAAKgzL,MAAM,IACbn6L,EAAyB,IAAlBmH,KAAK+yL,UACP/yL,OAITnH,EAAuC,IAAhCmH,KAAKgzL,MAAMhzL,KAAK/6B,OAAS,IAEzB+6B,MAGTk0Z,SAAShtb,MAOPsob,EAAQzhO,EAAG+E,KAAK5rN,GAAI,IAAK,UACzByoB,EAAMzoB,EAAEohL,OAAS,EAAG,UACpBzvJ,EAAO3xB,EAAEqnN,SAES,IAAdrnN,EAAE8qN,KAAK,GAAO,MAAA,IACNzyD,WAAW,yBAEjB14J,EAAIm5B,KAAKq1B,QACT/7C,EAAIpS,EAAEmuD,QACN6+D,EAAAA,IAAQ65F,EAAG,GACXjpH,EAAAA,IAAQipH,EAAG,QAEblnN,EAAE8uN,SAAW9uN,EAAE64N,KAAKpmN,IAAM,IAC5BzS,EAAEm7N,KAAK1oN,IAEDzS,EAAEgoN,UAAAA,KACJ1nN,EAAIN,EAAE6sb,WACNpia,EAAIhY,EAAEo6a,gBAEHvsb,KACD+sH,EAAEq6F,SACJr6F,EAAEo7T,MAAMp7T,EAAGhtH,GAEbgtH,EAAEy9F,OAAO,QAGJrgM,KACDwzE,EAAEypH,SACJzpH,EAAEwqV,MAAMxqV,EAAG59F,GAEb49F,EAAE6sH,OAAO,GAGP9qN,EAAE64N,KAAKpmN,IAAM,GACfzS,EAAE4ob,MAAM5ob,EAAGyS,GACP46G,EAAEwrG,KAAK56H,GAAK,GACdovB,EAAEu7T,MAAM3qV,EAAGovB,GACXA,EAAEu7T,MAAMvob,EAAGgtH,IAEXA,EAAEu7T,MAAMv7T,EAAGpvB,KAGbxrF,EAAEm2a,MAAMn2a,EAAGzS,GACPi+F,EAAE46H,KAAKxrG,GAAK,GACdpvB,EAAE2qV,MAAMv7T,EAAGpvB,GACXA,EAAE2qV,MAAMvob,EAAG49F,IAEXA,EAAE2qV,MAAM3qV,EAAGovB,OAKC,IAAd56G,EAAE04M,KAAK,GAAO,MAAA,IACNzyD,WAAW,0BAEvB1mI,EAAsB,IAAfisE,EAAEiuH,UACTl6L,EAAOisE,EAAE46H,KAAKx4N,GAAK,GAEZ49F,EAGT4uV,iBACQ/uZ,EAAQ3E,KAAKm1L,kBAEfxwL,EAAQ,GACV3E,KAAK2xL,OAAOhtL,GAEPA,EAGTmvZ,SAASpiZ,MAG8B,GAAhC1R,KAAKgzL,MAAM,GAAKthL,EAAIshL,MAAM,IAAM,OAC5B,QAEH5vL,EAAMx9B,KAAKq0B,IAAI+F,KAAK/6B,OAAQysC,EAAIzsC,YAElC+oC,EAAI,UAEC7mC,EAAI,EAAGA,EAAIi8B,EAAKj8B,IAAAA,OACjBmS,EAAI67M,EAASn1L,KAAKgzL,MAAM7rN,GAAKuqC,EAAIshL,MAAM7rN,OAE7C6mC,GAAK10B,EAEK,KAANA,EAAM,aAIL00B,EAGTylZ,sBACSzzZ,KAAKkuL,IAAMluL,KAAKqgM,UAAYrgM,KAAKq1B,QAG1C+qK,UAAUnmH,UACRj6E,KAAKkuL,IAAMj0G,EACJj6E,KAOTq1B,cACQp4H,EAAAA,IAAW8wR,EAEjB9wR,EAAK+1R,MAAAA,IAAYn1L,MAAMmC,KAAK/6B,gBAEnBkC,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAC/BlqE,EAAK+1R,MAAM7rN,GAAK64B,KAAKgzL,MAAM7rN,UAE7BlqE,EAAKgoE,OAAS+6B,KAAK/6B,OACnBhoE,EAAK81R,SAAW/yL,KAAK+yL,SACrB91R,EAAKixR,IAAMluL,KAAKkuL,IAETjxR,EAGTijL,OAAOxuE,GACL89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAE7B1R,KAAKuvZ,OAAO79Y,EAAIzsC,gBAEPkC,EAAI,EAAGA,EAAIuqC,EAAIzsC,OAAQkC,IAC9B64B,KAAKgzL,MAAM7rN,GAAKuqC,EAAIshL,MAAM7rN,UAE5B64B,KAAK/6B,OAASysC,EAAIzsC,OAClB+6B,KAAK+yL,SAAWrhL,EAAIqhL,SACpB/yL,KAAKkuL,IAAMx8K,EAAIw8K,IAERluL,KAGTve,IAAIiwB,EAAKmhL,UACA7yL,KAAK2jJ,WAAWjyI,EAAKmhL,GAG9BnlL,KAAKgE,GACH89Y,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,gBAEvB9D,EAAI5N,KACJ6N,EAAI6D,SAET9D,EAAEolL,MAAOnlL,EAAEmlL,OAAAA,CAAUnlL,EAAEmlL,MAAOplL,EAAEolL,QAChCplL,EAAE3oC,OAAQ4oC,EAAE5oC,QAAAA,CAAW4oC,EAAE5oC,OAAQ2oC,EAAE3oC,SACnC2oC,EAAEmlL,SAAUllL,EAAEklL,UAAAA,CAAallL,EAAEklL,SAAUnlL,EAAEmlL,WACzCnlL,EAAEsgL,IAAKrgL,EAAEqgL,KAAAA,CAAQrgL,EAAEqgL,IAAKtgL,EAAEsgL,KAEpBtgL,EAGTsyG,gBACQ01E,EAAM51L,KAAK+yL,gBAEjB/yL,KAAKg4Z,WAAWh4Z,KAAK40L,SAAS,MAAO,MACrC50L,KAAK+yL,SAAW6C,EAET51L,KAGTo+H,oBACSx4J,KAAKwhL,KAAKpnJ,KAAKixK,YAAc,GAGtCA,kBAEQ5tB,EAAKitQ,EADDtwZ,KAAKgzL,MAAMhzL,KAAK/6B,OAAS,WAER,IAAnB+6B,KAAK/6B,OAAS,GAAUo+K,EAGlC8xC,cACMn1L,KAAK6uL,SAAAA,OACA,KAEL7uL,KAAKuuL,QAAAA,OACA,MAELvgL,EAAI,UAEC7mC,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAAAA,OACzBmS,EAAI67M,EAASn1L,KAAKgzL,MAAM7rN,OAE9B6mC,GAAK10B,EAEK,KAANA,EAAM,aAIL00B,EAGTiqZ,gBACMj4Z,KAAK/6B,QAAU,GAGC,IAAhB+6B,KAAK/6B,QAAkC,IAAlB+6B,KAAKgzL,MAAM,GAMtCxwK,KAAK5qC,UACH43a,EAAS53a,IAAQ,IAAOA,EAAK,MAAO,UAEhCA,GAAOooB,KAAK/6B,OACP,EAEF+6B,KAAKgzL,MAAMp7M,IAGnBk/H,SACKnsH,EAAS,YAETqV,KAAKkuL,MACPvjM,EAAS,YAEAA,MAAWqV,KAAK5B,SAAS,OAOtCY,eACM0S,EAAM1R,KAAKgzL,MAAM,MAED,IAAhBhzL,KAAK/6B,OACPysC,GAAuB,SAAhB1R,KAAKgzL,MAAM,WACO,IAAhBhzL,KAAK/6B,QAAkC,IAAlB+6B,KAAKgzL,MAAM,GAEzCthL,GAAO,iBAAoC,SAAhB1R,KAAKgzL,MAAM,WAC7BhzL,KAAK/6B,OAAS,YACbs6J,WAAW,sDAGE,IAAlBv/H,KAAK+yL,UAAkBrhL,EAAMA,EAGtCwmZ,eACMxmZ,EAAM,UAEDvqC,EAAI64B,KAAK/6B,OAAS,EAAGkC,GAAK,EAAGA,IACpCuqC,EAAa,SAANA,EAAmB1R,KAAKgzL,MAAM7rN,UAEd,IAAlB64B,KAAK+yL,UAAkBrhL,EAAMA,EAGtCo9M,iBACS9uN,KAAKk4Z,WAGdpI,eACOT,EAAAA,MAAAA,IACOv2Z,MAAM,kCAEZq/Z,EAAMn8X,OAAO,IACbo8X,EAAMp8X,OAAO,QAEf70D,EAAI64B,KAAK/6B,OAAS,EAClBysC,EAAMsqB,OAAO,QAEV70D,GAAK,EAAGA,GAAK,EAAA,OACZk8K,EAAqB,SAAhBrjJ,KAAKgzL,MAAM7rN,GAChBm8K,EAAKtjJ,KAAKgzL,MAAM7rN,EAAI,GAE1BuqC,EAAOA,GAAOymZ,EAAOn8X,OAAOqnH,EAAKC,UAG/Bn8K,GAAK,IACPuqC,EAAOA,GAAO0mZ,EAAOp8X,OAAOh8B,KAAKgzL,MAAM,KAEhB,IAAlBhzL,KAAK+yL,UAAkBrhL,EAAMA,EAGtC2mZ,gBACUr4Z,KAAK6uL,SAGfzwL,SAASgiC,EAAMglI,MAGE,MAAXA,IACFA,EAAU,GAEI,IAAZA,IACFA,EAAU,GAEZoqP,GARApvX,EAAO4yQ,EAAQ5yQ,MAQG,IAAOA,EAAM,OAAQ,UACvCovX,EAASpqP,IAAY,IAAOA,EAAS,UAAW,UAE5ChlI,EAAO,GAAKA,EAAO,GAAA,MAAA,IACXm/F,WAAW,oCAEvBv/H,KAAK+3Z,SAEQ,KAAT33X,EAAS,KACPW,EAAM,GACNw0F,EAAM,EACNsI,EAAQ,UAEH12J,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAAAA,OACzBs9I,EAAIzkH,KAAKgzL,MAAM7rN,GACfq7C,GAA+B,UAArBiiG,GAAK8Q,EAAOsI,IAAmBz/H,SAAS,IAExDy/H,EAASpZ,IAAO,GAAK8Q,EAAQ,SAG3Bx0F,EADY,IAAV88F,GAAe12J,IAAM64B,KAAK/6B,OAAS,EAC/B01L,EAAM,EAAIn4I,EAAKv9C,QAAUu9C,EAAOue,EAEhCve,EAAOue,EAEfw0F,GAAO,EAEHA,GAAO,KACTA,GAAO,GACPpuJ,GAAK,OAIK,IAAV02J,IACF98F,EAAM88F,EAAMz/H,SAAS,IAAM2iC,GAEtBA,EAAI97D,OAASmgM,GAAY,GAC9BrkI,EAAM,IAAMA,SAEQ,IAAlB/gC,KAAK+yL,WACPhyJ,EAAM,IAAMA,GAEPA,QAGHyzJ,EAAYN,EAAW9zJ,EAAO,GAC9Bq0J,EAAYN,EAAW/zJ,EAAO,GAC9B3zD,EAAIuzB,KAAKq1B,YAEX0L,EAAM,OAEVt0D,EAAEsmN,SAAW,GAELtmN,EAAEoiN,UAAAA,OACF7gL,EAAIvhC,EAAEqkb,MAAMr8N,GAAWr2L,SAASgiC,GAEtC3zD,EAAEkkb,MAAMl8N,GAKN1zJ,EAHGt0D,EAAEoiN,SAGC7gL,EAAI+yB,EAFJ45H,EAAM65B,EAAYxmL,EAAE/oC,QAAU+oC,EAAI+yB,MAKxC/gC,KAAK6uL,WACP9tJ,EAAM,KAEDA,EAAI97D,OAASmgM,GAAY,GAC9BrkI,EAAM,IAAMA,SAEQ,IAAlB/gC,KAAK+yL,WACPhyJ,EAAM,IAAMA,GAEPA,EAGT35C,gBACS4Y,KAAK5B,SAAS,GAAI,GAG3B+E,QAAQ0vL,EAAQ5tN,UACP+6B,KAAKmvL,YAAYtxL,MAAOg1L,EAAQ5tN,GAGzC2vN,SAAS/B,EAAQ5tN,UACR+6B,KAAKmvL,YAAYlsC,EAAQ4vC,EAAQ5tN,GAG1CkqN,YAAY0F,EAAWhC,EAAQ5tN,GACf,MAAV4tN,IACFA,EAAS,MAEG,MAAV5tN,IACFA,EAAS,GAEXuqb,EAA6B,mBAAd36N,EAA0B,YAAa,YACtD26N,EAAmB,OAAX38N,GAA8B,OAAXA,EAAiB,SAAU,cACtD28N,EAASvqb,IAAW,IAAOA,EAAQ,SAAU,UAE7C+6B,KAAK+3Z,eAECp/R,EAAQ34H,KAAKo+H,aACbnhI,EAAOh4B,GAAUW,KAAKD,IAAI,EAAGgzJ,MAE/BA,EAAQ17H,EAAAA,MAAAA,IACAsiI,WAAW,gDAEjBxzJ,EA0oFV,SAAkB8oN,EAAW53L,UACvB43L,EAAU+8B,gBACL/8B,EAAU+8B,gBAAgB30N,OAExB43L,EAAU53L,GA9oFP8uP,CAASl3D,EAAW53L,MAGjB,OAAX41L,EAAW,KACTj7M,EAAM7L,EAAI9G,OAAS,EACnB44J,EAAQ,UAEH12J,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAAAA,OACzBw9B,GAAa,EAAJx9B,IAAU,EACnBq7C,EAAQxiB,KAAKgzL,MAAM7rN,IAAMw9B,EAASk5H,EAExC9xJ,EAAI6L,KAAgB,IAAP4qC,EAET5qC,GAAO,IACT7L,EAAI6L,KAAU4qC,IAAS,EAAK,KAE1B5qC,GAAO,IACT7L,EAAI6L,KAAU4qC,IAAS,GAAM,KAEjB,IAAV7d,GACE/sB,GAAO,IACT7L,EAAI6L,KAAU4qC,IAAS,GAAM,KAE/Bq7G,EAAQ,GAERA,EAAQr7G,IAAS,MAIjB5qC,GAAO,EAAA,KACT7L,EAAI6L,KAASimJ,EAENjmJ,GAAO,GACZ7L,EAAI6L,KAAS,EAEfimJ,EAAQ,EAGVhlI,EAAiB,IAAVglI,YAEHjmJ,EAAM,EACNimJ,EAAQ,UAEH12J,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAAAA,OACzBw9B,GAAa,EAAJx9B,IAAU,EACnBq7C,EAAQxiB,KAAKgzL,MAAM7rN,IAAMw9B,EAASk5H,EAExC9xJ,EAAI6L,KAAgB,IAAP4qC,EAET5qC,EAAM7L,EAAI9G,SACZ8G,EAAI6L,KAAU4qC,IAAS,EAAK,KAE1B5qC,EAAM7L,EAAI9G,SACZ8G,EAAI6L,KAAU4qC,IAAS,GAAM,KAEjB,IAAV7d,GACE/sB,EAAM7L,EAAI9G,SACZ8G,EAAI6L,KAAU4qC,IAAS,GAAM,KAE/Bq7G,EAAQ,GAERA,EAAQr7G,IAAS,MAIjB5qC,EAAM7L,EAAI9G,OAAAA,KACZ8G,EAAI6L,KAASimJ,EAENjmJ,EAAM7L,EAAI9G,QACf8G,EAAI6L,KAAS,EAEfimJ,EAAQ,EAGVhlI,EAAiB,IAAVglI,UAGF9xJ,EAGTu3B,OAAOuvL,EAAQ5tN,UACN+6B,KAAK40L,SAAS/B,EAAQ5tN,GAO/Bqzb,GAAG5mZ,EAAKmhL,UACC7yL,KAAK2jJ,WAAWjyI,EAAKmhL,GAG9BlvC,WAAWjyI,EAAKmhL,GACA,MAAVA,IACFA,EAAS,MAEX28N,EAAQ/pQ,EAAU/zI,GAAM,MAAO,WAC/B89Y,EAAmB,OAAX38N,GAA8B,OAAXA,EAAiB,SAAU,oBAEhD+C,EAAOlkL,EAAM,EAAK,SAEpBkkL,IACFlkL,GAAOA,GAELA,EAAM,UACR1R,KAAKgzL,MAAM,GAAW,SAANthL,EAChB1R,KAAK/6B,OAAS,GACLysC,EAAM,kBACf1R,KAAKgzL,MAAAA,CACG,SAANthL,EACCA,EAAM,SAAa,UAEtB1R,KAAK/6B,OAAS,IAEd+6B,KAAKgzL,MAAAA,CACG,SAANthL,EACCA,EAAM,SAAa,SACpB,GAEF1R,KAAK/6B,OAAS,GAGhB+6B,KAAK+yL,SAAW6C,EAED,OAAX/C,GACF7yL,KAAKkgH,UAEAlgH,KAGTu4Z,WAAW7mZ,EAAKmhL,GACA,MAAVA,IACFA,EAAS,MAEX28N,EAAuB,iBAAR99Y,EAAkB,MAAO,UACxC89Y,EAAmB,OAAX38N,GAA8B,OAAXA,EAAiB,SAAU,cAEjDntC,SAASh0I,KACZA,EAAM,SAEFkkL,EAAOlkL,IAAQ,EAAK,MAEtBA,EAAM,IACRA,GAAOA,GAETA,EAAM9rC,KAAK6nC,MAAMiE,GAEjB1R,KAAKgzL,MAAAA,GAEEthL,EAAM,GAAA,OACL4xI,EAAK5xI,EAAM,SACX2xI,GAAM3xI,EAAM4xI,GAAM,SAExBtjJ,KAAKgzL,MAAMloN,KAAKw4K,GAEhB5xI,EAAM2xI,SAGkB,IAAtBrjJ,KAAKgzL,MAAM/tN,QACb+6B,KAAKgzL,MAAMloN,KAAK,GAElBk1B,KAAK/6B,OAAS+6B,KAAKgzL,MAAM/tN,OACzB+6B,KAAK+yL,SAAW6C,EAED,OAAX/C,GACF7yL,KAAKkgH,UAEAlgH,KAGTw4Z,WAAW9mZ,EAAKmhL,MACA,MAAVA,IACFA,EAAS,MAEX28N,EAAuB,iBAAR99Y,EAAkB,MAAO,UACxC89Y,EAAmB,OAAX38N,GAA8B,OAAXA,EAAiB,SAAU,eAEjDw8N,EAAAA,MAAAA,IACOv2Z,MAAM,kCAKZ9jB,EAAS08B,EAAMsqB,OAAO,GAAM,SAElCh8B,KAAKy4Z,SAAS/mZ,EAAItT,SAAS,IAAKppB,GAChCgrB,KAAK+yL,SAAW/9M,EAED,OAAX69M,GACF7yL,KAAKkgH,UAEAlgH,KAGT04Z,SAAShlgB,UACP87f,EAAyB,kBAAV97f,EAAqB,QAAS,WAE7CssG,KAAKgzL,MAAM,GAAa,EAARt/R,EAChBssG,KAAK/6B,OAAS,EACd+6B,KAAK+yL,SAAW,EAET/yL,KAGTqqJ,WAAW70J,EAAK4qC,EAAMyyJ,MACP,OAATzyJ,GAA0B,OAATA,KAClBA,EAAMyyJ,GAAAA,CAAWA,EAAQzyJ,IAE5BA,EAAO4yQ,EAAQ5yQ,GAED,MAAVyyJ,IACFA,EAAS,MAEX28N,EAAuB,iBAARh6Z,EAAkB,SAAU,UAC3Cg6Z,EAASpvX,IAAS,IAAOA,EAAM,OAAQ,UACvCovX,EAAmB,OAAX38N,GAA8B,OAAXA,EAAiB,SAAU,cAElDzyJ,EAAO,GAAKA,EAAO,GAAA,MAAA,IACXtnC,MAAM,qCAId9jB,EAAQ,SAFZwgB,EAAMA,EAAItc,QAAQ,OAAQ,KAIlBjU,OAAS,GAA2B,KAAtBuwB,EAAIvd,WAAW,KACnCjD,EAAQ,GAEG,KAATorD,EACFpgC,KAAKy4Z,SAASjja,EAAKxgB,GAEnBgrB,KAAK24Z,UAAUnja,EAAK4qC,EAAMprD,GAE5BgrB,KAAK+yL,SAAW/9M,EAEhBgrB,KAAK4vZ,aAEU,OAAX/8N,GACF7yL,KAAKkgH,UAEAlgH,KAGTy4Z,SAASjja,EAAKxgB,GACZgrB,KAAK/6B,OAASW,KAAKD,IAAI,EAAGC,KAAKwhL,MAAM5xJ,EAAIvwB,OAAS+P,GAAS,IAC3DgrB,KAAKgzL,MAAAA,IAAYn1L,MAAMmC,KAAK/6B,gBAEnBkC,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAC/B64B,KAAKgzL,MAAM7rN,GAAK,MAGdouJ,EAAM,EACNpuJ,EAAIquB,EAAIvwB,OAAS,EACjBqsB,EAAI,OAEDnqB,GAAK6N,EAAO7N,GAAK,EAAA,OAChBs9I,EAAIm0S,EAASpja,EAAKruB,EAAGA,EAAI,GAE/B64B,KAAKgzL,MAAM1hM,IAAOmzH,GAAK8Q,EAAO,SAG9Bv1H,KAAKgzL,MAAM1hM,EAAI,IAAOmzH,IAAO,GAAK8Q,EAAQ,QAE1CA,GAAO,GAEHA,GAAO,KACTA,GAAO,GACPjkI,GAAK,MAILnqB,EAAI,IAAM6N,EAAAA,OACNyvI,EAAIm0S,EAASpja,EAAKxgB,EAAO7N,EAAI,GAEnC64B,KAAKgzL,MAAM1hM,IAAOmzH,GAAK8Q,EAAO,SAC9Bv1H,KAAKgzL,MAAM1hM,EAAI,IAAOmzH,IAAO,GAAK8Q,EAAQ,eAGrCv1H,KAAKsiM,SAGdq2N,UAAUnja,EAAK4qC,EAAMprD,GAEnBgrB,KAAKgzL,MAAM,GAAK,EAChBhzL,KAAK/6B,OAAS,EACd+6B,KAAK+yL,SAAW,MAGZY,EAAU,EACVC,EAAU,OAEPA,GAAW,SAAWA,GAAWxzJ,EACtCuzJ,GAAW,EAEbA,GAAW,EACXC,EAAWA,EAAUxzJ,EAAQ,QAEvBgvB,EAAQ55D,EAAIvwB,OAAS+P,EACrBstE,EAAM8M,EAAQukI,EACd3uN,EAAMY,KAAKq0B,IAAIm1D,EAAOA,EAAQ9M,GAAOttE,MAEvC7N,EAAI6N,OAED7N,EAAInC,EAAKmC,GAAKwsN,EAAAA,OACbnxK,EAAO6wK,EAAU79L,EAAKruB,EAAGA,EAAIwsN,EAASvzJ,GAE5CpgC,KAAK6zL,MAAMD,GACX5zL,KAAK8zL,OAAOtxK,MAGF,IAAR8/B,EAAQ,OACJ+8E,EAAMz5J,KAAKy5J,IAAIj/F,EAAMkiB,GACrB9/B,EAAO6wK,EAAU79L,EAAKruB,EAAGquB,EAAIvwB,OAAQm7D,GAE3CpgC,KAAK6zL,MAAMx0D,GACXr/H,KAAK8zL,OAAOtxK,UAGPxiB,KAGTqoM,SAAS14E,MACHo+D,EAAG+E,KAAKnjE,UACNA,EAAKu+D,IACAv+D,EAAK0wE,UAEP1wE,EAAKt6F,WAGVx3B,MAAM/gB,QAAQ6yI,GAAAA,WACLlgH,KAASkgH,EAClB6/R,EAAyB,iBAAV//Y,EAAoB,QAAS,UAE9CkgH,EAAOA,EAAKrlJ,KAAK,WAGZ01B,KAAKqqJ,WAAW16B,EAAM,IAG/BkpS,OAAOnnZ,UACE1R,KAAKkgF,OAAOxuE,GAGrB5J,UAAU4kD,EAAMmmI,UACd28N,EAAQ3xZ,MAAM/gB,QAAQ4vE,GAAO,OAAQ,SAC9B1sD,KAAK2uN,cAAcjiK,EAAMmmI,GAGlCmlO,WAAWtrW,EAAMmmI,UACf28N,EAAQvsQ,EAAO8H,SAASr+F,GAAO,OAAQ,UAChC1sD,KAAK2uN,cAAcjiK,EAAMmmI,GAGlC87B,cAAcjiK,EAAMmmI,MACJ,MAAVA,IACFA,EAAS,MAEX28N,EAAQ9iW,GAASA,EAAKznF,SAAW,IAAOynF,EAAKznF,OAAQ,OAAQ,cAC7Duqb,EAAmB,OAAX38N,GAA8B,OAAXA,EAAiB,SAAU,cAElC,IAAhBnmI,EAAKznF,cACP+6B,KAAKgzL,MAAM,GAAK,EAChBhzL,KAAK/6B,OAAS,EACd+6B,KAAK+yL,SAAW,EACT/yL,KAGTA,KAAK/6B,OAASW,KAAKD,IAAI,EAAGC,KAAKwhL,KAAK16F,EAAKznF,OAAS,IAClD+6B,KAAKgzL,MAAAA,IAAYn1L,MAAMmC,KAAK/6B,QAC5B+6B,KAAK+yL,SAAW,UAEP5rN,EAAI,EAAGA,EAAI64B,KAAK/6B,OAAQkC,IAC/B64B,KAAKgzL,MAAM7rN,GAAK,QAEZ+hB,EAAOwjE,EAAKznF,OAAS,MAEvBswJ,EAAM,EACNjkI,EAAI,EACJmzH,EAAI,KAEO,OAAXouE,EAAW,SACJ1rN,EAAIulF,EAAKznF,OAAS,EAAGkC,GAAK,EAAGA,GAAK,EAAA,OACnCs9I,EAAI/3D,EAAKvlF,GAAMulF,EAAKvlF,EAAI,IAAM,EAAMulF,EAAKvlF,EAAI,IAAM,GAEzD64B,KAAKgzL,MAAM1hM,IAAOmzH,GAAK8Q,EAAO,SAC9Bv1H,KAAKgzL,MAAM1hM,EAAI,GAAMmzH,IAAO,GAAK8Q,EAAQ,SAEzCA,GAAO,GAEHA,GAAO,KACTA,GAAO,GACPjkI,GAAK,UAIDpI,QACD,EACHu7H,EAAI/3D,EAAK,GAAMA,EAAK,IAAM,aAEvB,EACH+3D,EAAI/3D,EAAK,eAIPtpD,EAAMspD,EAAKznF,OAASikB,UAEjB/hB,EAAI,EAAGA,EAAIi8B,EAAKj8B,GAAK,EAAA,OACtBs9I,EAAI/3D,EAAKvlF,GAAMulF,EAAKvlF,EAAI,IAAM,EAAMulF,EAAKvlF,EAAI,IAAM,GAEzD64B,KAAKgzL,MAAM1hM,IAAOmzH,GAAK8Q,EAAO,SAC9Bv1H,KAAKgzL,MAAM1hM,EAAI,GAAMmzH,IAAO,GAAK8Q,EAAQ,SAEzCA,GAAO,GAEHA,GAAO,KACTA,GAAO,GACPjkI,GAAK,UAIDpI,QACD,EACHu7H,EAAI/3D,EAAKtpD,GAAQspD,EAAKtpD,EAAM,IAAM,aAE/B,EACHqhH,EAAI/3D,EAAKtpD,WAKXla,EAAO,IACT8W,KAAKgzL,MAAM1hM,IAAOmzH,GAAK8Q,EAAO,SAC9Bv1H,KAAKgzL,MAAM1hM,EAAI,GAAMmzH,IAAO,GAAK8Q,EAAQ,UAGpCv1H,KAAKsiM,SAGdl+L,OAAOsoD,EAAMmmI,UACJ7yL,KAAKg4Z,WAAWtrW,EAAMmmI,GAG/BppI,KAAK/3C,EAAK0uB,EAAMyyJ,MACH,MAAPnhL,EAAO,OACF1R,QAEI,OAATogC,GAA0B,OAATA,KAClBA,EAAMyyJ,GAAAA,CAAWA,EAAQzyJ,IAET,iBAAR1uB,EAAQ,OACV1R,KAAK2jJ,WAAWjyI,EAAKmhL,MAEX,iBAARnhL,EAAQ,OACV1R,KAAKw4Z,WAAW9mZ,EAAKmhL,MAEX,iBAARnhL,EAAQ,OACV1R,KAAKqqJ,WAAW34I,EAAK0uB,EAAMyyJ,MAEjB,iBAARnhL,EAAQ,IACbq8K,EAAG+E,KAAKphL,GAAAA,OACH1R,KAAK64Z,OAAOnnZ,EAAKmhL,MAErBnhL,EAAIzsC,SAAW,IAAOysC,EAAIzsC,OAAAA,OACtB+6B,KAAK2uN,cAAcj9M,EAAKmhL,MAGhB,kBAARnhL,EAAQ,OACV1R,KAAK04Z,SAAShnZ,aAEb3M,UAAU,kDAOR3uB,OACR6jB,EAAM,eAECyX,KAAOt7B,EAChBo5a,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,YAExBzX,GAAOyX,EAAIvK,IAAIlN,GAAO,KACzBA,EAAMyX,UAGHzX,GAAAA,IAAW8zL,EAAG,iBAGT33M,OACRzQ,EAAM,eAEC+rC,KAAOt7B,EAChBo5a,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,YAExB/rC,GAAO+rC,EAAIvK,IAAIxhC,GAAO,KACzBA,EAAM+rC,UAGH/rC,GAAAA,IAAWooN,EAAG,cAGZlnN,EAAGyS,UACZk2a,EAAQzhO,EAAG+E,KAAKjsN,GAAI,IAAK,UAClBA,EAAEsgC,IAAI7tB,eAGHzS,EAAGyS,UACbk2a,EAAQzhO,EAAG+E,KAAKjsN,GAAI,IAAK,UAClBA,EAAE64N,KAAKpmN,cAGLo4B,cACEwuL,EAAIxuL,kBAGFA,cACFwnK,EAAQxnK,eAGTA,cACCqwL,EAAKrwL,iBAGJ7+G,MACRsuS,EAAOtuS,GAAAA,OACFsuS,EAAOtuS,OAEZu7H,KAES,SAATv7H,EACFu7H,EAAAA,IAAYwzK,OAAAA,GACI,SAAT/uS,EACPu7H,EAAAA,IAAYuzK,OAAAA,GACI,SAAT9uS,EACPu7H,EAAAA,IAAY0qY,OAAAA,GACI,SAATjmgB,EACPu7H,EAAAA,IAAYszK,OAAAA,GACI,SAAT7uS,EACPu7H,EAAAA,IAAY2qY,OAAAA,GACI,WAATlmgB,EACPu7H,EAAAA,IAAYyzK,MAAAA,CAAAA,GACI,SAAThvS,EACKmmgB,MAAAA,IAEFlga,MAAAA,mBAAyBjmG,OAFnCu7H,EAAAA,IAAY4qY,SAId73N,EAAOtuS,GAAQu7H,EAERA,eAGIv7H,UACJk7R,EAAG+T,OAAOjvS,GAAMq0E,EAAEmuD,mBAGhB3jB,EAAKnqC,UACF,IAARmqC,EACKq8K,EAAGppL,MAAM,EAAGp9B,QAEVwmN,GAAKpqC,WAAWjyI,GAAKw/Y,KAAK3pb,gBAG1BmqC,EAAK0oH,UACJ,IAAR1oH,EAAQ,IACCq8K,EAAG,GAAGmlO,MAAM94R,EAAM,QAEpB2zD,GAAKpqC,WAAWjyI,GAAKgsL,MAAMtjE,eAG5BA,UACH2zD,EAAGppL,MAAM,EAAGy1H,GAAMs3D,MAAM,qBAGfne,EAAKn5C,MACrBo1R,EAAe,MAAPj8O,EAAa,MAAO,OAC5Bi8O,EAASp1R,IAAS,IAAOA,EAAM,OAAQ,UAEpB,iBAARm5C,EAAQ,CACjBi8O,EAAmC,mBAApBj8O,EAAIxE,YAA4B,MAAO,aAEhD9xK,EAAQm9H,EAAO,IAAO,EACtBhrE,EAAe,EAAPnyD,EACR07H,EAAQ46C,EAAIxE,YAAY9xK,MAE9BuyZ,EAAQvsQ,EAAO8H,SAASpyB,GAAQ,QAAS,UAErCA,EAAM1zJ,SAAWg4B,EAAAA,MAAAA,IACTsiI,WAAW,oDAEjB7tH,EAAMq8K,EAAGiqO,WAAWr/R,UAEtBvpE,EAAQgrE,GACV1oH,EAAIigL,OAAOviI,EAAQgrE,GAEd1oH,EAGT89Y,EAAuB,mBAARj8O,EAAoB,MAAO,aAEpC7hK,EAAM6hK,EAAIn5C,MAEhBo1R,EAAQzhO,EAAG+E,KAAKphL,GAAM,MAAO,UAC7B/hB,EAAuB,IAAjB+hB,EAAIqhL,SAAgB,OAC1BujO,GAAQ5kZ,EAAIw8K,IAAK,OAEbx8K,EAAIu/J,YAAc72C,EAAAA,MAAAA,IACVmF,WAAW,oDAEhB7tH,gBAGK6hK,EAAKt5K,EAAKt0B,MACtBs0B,EAAM8zL,EAAGkrO,KAAKh/Z,EAAK,IACnBt0B,EAAMooN,EAAGkrO,KAAKtzb,EAAK,IAEfs0B,EAAIkN,IAAIxhC,GAAO,EAAA,MAAA,IACP45J,WAAW,iDAEjBztD,EAAQnsG,EAAI2rD,IAAIr3B,GAAKskM,OACrBnkE,EAAOtoD,EAAMm/F,eAEN,IAAT72C,EAAS,OACJngI,EAAIo7B,sBAGL3jB,EAAMq8K,EAAGmrO,WAAW3lP,EAAKn5C,QAG3B1oH,EAAIvK,IAAI2qE,IAAU,UAItBpgE,EAAI09K,KAAKn1L,GAEFyX,aAIDA,EAAKmhL,cACF9E,GAAKuqO,GAAG5mZ,EAAKmhL,qBAGRnhL,EAAKmhL,cACV9E,GAAKpqC,WAAWjyI,EAAKmhL,qBAGhBnhL,EAAKmhL,cACV9E,GAAKwqO,WAAW7mZ,EAAKmhL,qBAGhBnhL,EAAKmhL,cACV9E,GAAKyqO,WAAW9mZ,EAAKmhL,mBAGlBn/R,cACHq6R,GAAK2qO,SAAShlgB,qBAGT8hG,EAAK4qC,EAAMyyJ,cAChB9E,GAAK1jC,WAAW70J,EAAK4qC,EAAMyyJ,mBAGxBljE,cACHo+D,GAAKsa,SAAS14E,iBAGbj+G,cACDq8K,GAAK8qO,OAAOnnZ,oBAGRg7C,EAAMmmI,cACV9E,GAAKjmL,UAAU4kD,EAAMmmI,qBAGhBnmI,EAAMmmI,cACX9E,GAAKiqO,WAAWtrW,EAAMmmI,wBAGdnmI,EAAMmmI,cACd9E,GAAK4gC,cAAcjiK,EAAMmmI,iBAGxBnmI,EAAMmmI,cACP9E,GAAK3pL,OAAOsoD,EAAMmmI,eAGnBnhL,EAAK0uB,EAAMyyJ,cACV9E,GAAKtkI,KAAK/3C,EAAK0uB,EAAMyyJ,eAGtBnhL,EAAK0uB,EAAMyyJ,UACjB9E,EAAG+E,KAAKphL,GACHA,MAEEq8K,EAAGr8K,EAAK0uB,EAAMyyJ,eAGfh0L,UACHA,aAAekvL,GAQ1BA,EAAGA,GAAKA,EACRA,EAAGkF,SAAW,GACdlF,EAAGk/N,OAAS,EAMZ,MAAA5+X,EACE1hB,YAAY95G,EAAMq0E,GAEhB84B,KAAKntG,KAAOA,EACZmtG,KAAK94B,EAAAA,IAAQ6mN,EAAG7mN,EAAG,IACnB84B,KAAK/rG,EAAI+rG,KAAK94B,EAAE+pM,YAChBjxK,KAAK3rG,EAAI05R,EAAGppL,MAAM,EAAG3E,KAAK/rG,GAAGo7R,KAAKrvL,KAAK94B,GACvC84B,KAAKsjJ,GAAKtjJ,KAAK94B,EAAEmuD,QACjBr1B,KAAKyiM,IAAMziM,KAAK94B,EAAEmuD,QAGpB8sK,QAAQzwL,SAGAkkL,EAAuB,IAAjBlkL,EAAIqhL,aAGZ34D,EAAO1oH,EAAIu/J,gBAGfp4K,EAAOuhI,GAAiB,EAATp6H,KAAK/rG,GAGpBy9G,EAAIqhL,SAAW,EAGR34D,EAAOp6H,KAAK/rG,GAGjB+rG,KAAKlgB,MAAM4xB,EAAK1R,KAAKsjJ,IAGrBtjJ,KAAKqiM,MAAM3wL,GAGXA,EAAI49Y,MAAM59Y,EAAK1R,KAAKsjJ,IAGpBlpB,EAAO1oH,EAAIu/J,kBAIP9pK,EAAMizH,EAAOp6H,KAAK/rG,GAAK,EAAIy9G,EAAIguL,KAAK1/L,KAAK94B,UAEnC,IAARigC,GACFuK,EAAIshL,MAAM,GAAK,EACfthL,EAAIzsC,OAAS,GACJkiC,EAAM,GACfuK,EAAI+9Y,MAAM/9Y,EAAK1R,KAAK94B,GAMlB0uN,IAAQlkL,EAAIm9K,UACdn9K,EAAI+9Y,MAAMzvZ,KAAK94B,EAAGwqC,GAEbA,EAGT5xB,MAAMkP,EAAO+xC,GACX/xC,EAAM6ja,OAAO7yZ,KAAK/rG,EAAG8sI,GAGvBshK,MAAM3wL,UACGA,EAAI69K,KAAKvvL,KAAK3rG,GAGvB8kgB,IAAI75N,aAEQxmM,MAAM,oBAGlBs7Z,OAAOxmZ,UACE5N,KAAKm5Z,IAAIvrZ,IAQpB,MAAAwrZ,UAAsB/qY,EACpB1hB,YAAY95G,EAAMq0E,GAChBq+C,MAAM1yH,EAAMq0E,GAGdmyb,MAAM/5N,aAEMxmM,MAAM,oBAGlBwga,MAAMh6N,aAEMxmM,MAAM,oBAGlBkoM,KAAKpzL,aAEIsgL,GAAOtgL,EACRI,EAAIhO,KAAKs5Z,MAAM1rZ,OAEhBsgL,EAAIkP,IAAIpvL,GAAGuF,GAAG3F,GAAAA,MAAAA,IACP2rZ,EAAgBvrZ,UAErBA,EAGT4oZ,QAAQ1iU,EAAGpvB,aAEFopH,GAAOh6F,EACRg+F,EAAKhE,EAAIkP,IAAIlpG,GACbslU,EAAKtrO,EAAI0B,IAAIsC,EAAIh+F,GACjBulU,EAAKvrO,EAAI0B,IAAI4pO,EAAItnO,GACjBwnO,EAAKxrO,EAAI0B,IAAI1B,EAAIkP,IAAIt4H,GAAIA,GACzB59F,EAAI84B,KAAKq5Z,MAAMnrO,EAAI0B,IAAI6pO,EAAIC,IAC3B9rZ,EAAIsgL,EAAI0B,IAAI1B,EAAI0B,IAAI4pO,EAAI10V,GAAI59F,MACxBgnN,EAAI0B,IAAI9qH,EAAGopH,EAAIkP,IAAIxvL,IAEvB2F,GAAG2gF,GAAAA,OACAtmF,YAEC2rZ,EAAgB3rZ,IAQ9B,MAAA+rZ,UAAsBtrY,EACpB1hB,YAAY95G,EAAMq0E,EAAG0yb,GACnBr0Y,MAAM1yH,EAAMq0E,GAEZ84B,KAAK45Z,IAAAA,IAAU7rO,EAAG6rO,EAAK,IAGzBC,MAAMv6N,aAEMxmM,MAAM,oBAGlBgha,MAAMx6N,aAEMxmM,MAAM,oBAGlBkoM,KAAKpzL,aAEIsgL,GAAOtgL,EACRgsZ,EAAM55Z,KAAK45Z,IAAIx5N,UAAUlS,GACzBlgL,EAAIhO,KAAK85Z,MAAMlsZ,MAEjBsgL,EAAIkP,IAAIpvL,GAAGuF,GAAG3F,GAAAA,OACTI,QAEHvhC,EAAIyhN,EAAI0B,IAAI5hL,EAAG4rZ,MAEjB1rO,EAAIkP,IAAI3wN,GAAG8mC,GAAG3F,GAAAA,OACTnhC,YAEC8sb,EAAgBvrZ,GAG5B4oZ,QAAQ1iU,EAAGpvB,aAEFopH,GAAOh6F,EACR0lU,EAAM55Z,KAAK45Z,IAAIx5N,UAAUlS,GACzBwrO,EAAKxrO,EAAI0B,IAAI1B,EAAIkP,IAAIt4H,GAAIA,GACzBi1V,EAAK7rO,EAAI0B,IAAI1B,EAAIkP,IAAIs8N,GAAK50V,GAC1B59F,EAAI84B,KAAK65Z,MAAM3rO,EAAI0B,IAAI17F,EAAG6lU,IAC1BnsZ,EAAIsgL,EAAI0B,IAAI1B,EAAI0B,IAAI17F,EAAGwlU,GAAKxyb,GAC5BuF,EAAIyhN,EAAI0B,IAAI9qH,EAAGopH,EAAIkP,IAAIxvL,OAEzBnhC,EAAE8mC,GAAG2gF,GAAAA,OACAtmF,QAEH0pF,EAAK42F,EAAIwH,KAAKjpN,MAEhB6qH,EAAG/jF,GAAG2gF,GAAAA,OACDg6F,EAAI0B,IAAIhiL,EAAGgsZ,MAEhBtiU,EAAG/jF,GAAG26K,EAAI0B,IAAI17F,EAAG0lU,IAAAA,MAAAA,IACTL,EAAgBrrO,EAAI0B,IAAIhiL,EAAGgsZ,cAE7BL,EAAgB3rZ,IAQ9B,MAAAosZ,UAAuB3rY,EACrB1hB,YAAY95G,EAAMq0E,EAAGk9I,GACnB7+F,MAAM1yH,EAAMq0E,GAEZ84B,KAAKokH,EAAAA,IAAQ2pE,EAAG3pE,EAAG,IACnBpkH,KAAKulH,EAAIvlH,KAAK94B,EAAEo3N,KAAK,GAAGnJ,WAG1B8kO,KAAK36N,aAEOxmM,MAAM,oBAGlBoha,KAAK56N,aAEOxmM,MAAM,oBAGlBkoM,KAAKpzL,aAsCIsgL,GAAOtgL,SAENsgL,EAAIslO,OAAO5lZ,SACX,YACM2rZ,EAAgB3rZ,QACvB,SACIA,EAAEynB,YAKT+uF,EAAIpkH,KAAKokH,EAAEg8E,UAAUlS,GACrBrgL,EAAI7N,KAAKk6Z,KAAKtsZ,GACdt0B,EAAI0mB,KAAKi6Z,KAAKrsZ,GACdv5G,EAAI2rG,KAAKulH,cAGPxmE,EAAIzlE,EACJ4F,EAAI,OAEa,IAAd6/D,EAAEizI,KAAK,IAAY9yM,EAAI7qF,GAC5B0qJ,EAAImvI,EAAIkP,IAAIr+I,GACZ7/D,GAAK,KAGG,IAANA,EAAM,MAGV2Z,EAAO3Z,EAAI7qF,GAEX0qJ,EAAImvI,EAAIisO,KAAK/1S,EAAG/vN,EAAI6qF,EAAI,GACxBklI,EAAI8pE,EAAIkP,IAAIr+I,GACZlxC,EAAIqgL,EAAI0B,IAAI/hL,EAAGkxC,GACfzlE,EAAI40M,EAAI0B,IAAIt2M,EAAG8qI,GACf/vN,EAAI6qF,SAGC2uB,EAGT+oZ,QAAQ1iU,EAAGpvB,aACFopH,GAAOh6F,KAEVpvB,EAAE+pH,SAAAA,MAAAA,IACM0qO,EAAgBz0V,UAErB9kE,KAAKghM,KAAK9S,EAAI56B,IAAIp/D,EAAGpvB,KAQhC,MAAA88H,UAAmBw3N,EACjBzsZ,cAEE4Y,MAAM,OAAQ,wDAIhB88K,MAAM3wL,SAGE+wL,EAAMziM,KAAKyiM,IAAIviH,OAAOxuE,UACrBA,EAAI6rL,OAAO,IAAI+xN,MAAM59Y,EAAK+wL,GAGnCuyH,KAAK11H,aAGIpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxB3Q,EAAKT,EAAIksO,QAAQ76N,EAAI,EAAGD,GACxB+6N,EAAKnsO,EAAIksO,QAAQzrO,EAAI,EAAGA,GACxB2rO,EAAMpsO,EAAIksO,QAAQC,EAAI,EAAGA,GACzBE,EAAMrsO,EAAIksO,QAAQE,EAAK,GAAIA,GAC3BE,EAAMtsO,EAAIksO,QAAQG,EAAK,EAAGF,GAC1BI,EAAMvsO,EAAIksO,QAAQI,EAAK,EAAGl7N,GAC1Bo7N,EAAMxsO,EAAIksO,QAAQK,EAAK,GAAIA,GAC3BE,EAAOzsO,EAAIksO,QAAQM,EAAK,GAAIA,GAC5BE,EAAO1sO,EAAIksO,QAAQO,EAAM,EAAGhsO,GAC5BksO,EAAK3sO,EAAIisO,KAAKS,EAAM,UACf1sO,EAAIksO,QAAQS,EAAI,GAAIH,GAKjCrB,MAAM/5N,UAGGt/L,KAAKg1T,KAAK11H,GAGnB65N,IAAI75N,aAGKpR,GAAOoR,EACRu7N,EAAK76Z,KAAKg1T,KAAK11H,GACfpjC,EAAKgyB,EAAIisO,KAAKU,EAAI,UACb3sO,EAAIksO,QAAQl+P,EAAI,EAAGojC,GAKhCg6N,MAAMh6N,aAGGpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxBymD,EAAK73D,EAAIksO,QAAQ76N,EAAI,EAAGA,GACxBymD,EAAK93D,EAAIksO,QAAQr0K,EAAI,EAAGA,GACxB+0K,EAAM5sO,EAAIksO,QAAQp0K,EAAI,EAAGA,GACzB+0K,EAAM7sO,EAAIksO,QAAQU,EAAK,GAAIA,GAC3Bt2M,EAAMt2B,EAAIksO,QAAQW,EAAK,GAAIA,GAC3BC,EAAO9sO,EAAIksO,QAAQ51M,EAAK,GAAIA,UACvBt2B,EAAIisO,KAAKa,EAAM,KAU9B,MAAAr5N,UAAmBq4N,EACjBrtZ,cAEE4Y,MAAM,OAAQ,gEAEA,iEAIhB88K,MAAM3wL,SAGE+wL,EAAMziM,KAAKyiM,IAAIviH,OAAOxuE,UACrBA,EAAI6rL,OAAO,IAAIkyN,MAAM/9Y,EAAK+wL,GAGnCw3N,KAAK36N,aAGIpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxBymD,EAAK73D,EAAIksO,QAAQ76N,EAAI,EAAGA,GACxBymD,EAAK93D,EAAIksO,QAAQr0K,EAAI,EAAGA,GACxB+0K,EAAM5sO,EAAIksO,QAAQp0K,EAAI,EAAGA,GACzB+0K,EAAM7sO,EAAIksO,QAAQU,EAAK,GAAIA,GAC3Bt2M,EAAMt2B,EAAIksO,QAAQW,EAAK,GAAIA,UACpB7sO,EAAIksO,QAAQ51M,EAAK,GAAIA,GAKpC01M,KAAK56N,aAGIpR,GAAOoR,SACHpR,EAAIisO,KAAK76N,EAAI,KAK1B65N,IAAI75N,aAGKpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxB3Q,EAAKT,EAAIksO,QAAQ76N,EAAI,EAAGD,GACxB+6N,EAAKnsO,EAAIksO,QAAQzrO,EAAI,EAAGA,GACxB2rO,EAAMpsO,EAAIksO,QAAQC,EAAI,EAAGA,GACzBE,EAAMrsO,EAAIksO,QAAQE,EAAK,GAAIA,GAC3BW,EAAM/sO,EAAIksO,QAAQG,EAAK,GAAIA,GAC3BW,EAAMhtO,EAAIksO,QAAQa,EAAK,GAAIA,GAC3BE,EAAOjtO,EAAIksO,QAAQc,EAAK,GAAIX,GAC5Ba,EAAOltO,EAAIksO,QAAQe,EAAM,EAAGd,GAC5BO,EAAO1sO,EAAIksO,QAAQgB,EAAM,EAAG97N,GAC5Bu7N,EAAK3sO,EAAIisO,KAAKS,EAAM,UACf1sO,EAAIksO,QAAQS,EAAI,GAAIK,IAUnC,MAAApC,UAAmBM,EACjBzsZ,cAEE4Y,MAAM,OAAQ,wJAOhB88K,MAAM3wL,UAEGA,EAGTsjT,KAAK11H,aAGIpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxB3Q,EAAKT,EAAIksO,QAAQ76N,EAAI,EAAGD,GACxB+6N,EAAKnsO,EAAIksO,QAAQzrO,EAAI,EAAGA,GACxB0sO,EAAKntO,EAAIksO,QAAQC,EAAI,EAAG/6N,GACxB0mD,EAAK93D,EAAIksO,QAAQiB,EAAI,EAAG/7N,GACxBw7N,EAAM5sO,EAAIksO,QAAQp0K,EAAI,EAAGA,GACzB+0K,EAAM7sO,EAAIksO,QAAQU,EAAK,GAAIA,GAC3Bt2M,EAAMt2B,EAAIksO,QAAQW,EAAK,GAAIA,GAC3BC,EAAO9sO,EAAIksO,QAAQ51M,EAAK,GAAIA,GAC5B82M,EAAOptO,EAAIksO,QAAQY,EAAM,IAAKA,GAC9BO,EAAOrtO,EAAIksO,QAAQkB,EAAM,IAAKA,UACvBptO,EAAIksO,QAAQmB,EAAM,EAAGF,GAKpChC,MAAM/5N,UAGGt/L,KAAKg1T,KAAK11H,GAGnB65N,IAAI75N,aAGKpR,GAAOoR,EACRu7N,EAAK76Z,KAAKg1T,KAAK11H,GACfpjC,EAAKgyB,EAAIisO,KAAKU,EAAI,UACb3sO,EAAIksO,QAAQl+P,EAAI,EAAGojC,GAKhCg6N,MAAMh6N,aAGGpR,GAAOoR,SACHpR,EAAIisO,KAAK76N,EAAI,MAU5B,MAAAoC,UAAmB03N,EACjBzsZ,cAEE4Y,MAAM,OAAQ,0EAIhBzlC,MAAMkP,EAAO8vI,SAELE,EAAO,QACP57H,EAAMx9B,KAAKq0B,IAAIjL,EAAM/pB,OAAQ,GAEnC65J,EAAOywR,OAAOnsZ,EAAM,WAEXj8B,EAAI,EAAGA,EAAIi8B,EAAKj8B,IACvB23J,EAAOk0D,MAAM7rN,GAAK6nB,EAAMgkM,MAAM7rN,MAEhC23J,EAAO75J,OAASm+B,EAEZpU,EAAM/pB,QAAU,SAClB65J,EAAOwjE,SACPtzM,EAAMgkM,MAAM,GAAK,OACjBhkM,EAAM/pB,OAAS,OAKbkY,EAAO6R,EAAMgkM,MAAM,GACnB7rN,EAAI,OAER23J,EAAOk0D,MAAMl0D,EAAO75J,UAAYkY,EAAO6hJ,EACvCF,EAAOwjE,SAEAn7N,EAAI6nB,EAAM/pB,OAAQkC,IAAAA,OACjBiW,EAAwB,EAAjB4R,EAAMgkM,MAAM7rN,GAEzB6nB,EAAMgkM,MAAM7rN,EAAI,KAAQiW,EAAO4hJ,IAAS,EAAM7hJ,IAAS,GAEvDA,EAAOC,EAGTD,KAAU,GAEV6R,EAAMgkM,MAAM7rN,EAAI,IAAMgW,EAET,IAATA,GAAc6R,EAAM/pB,OAAS,GAC/B+pB,EAAM/pB,QAAU,GAEhB+pB,EAAM/pB,QAAU,EAElB+pB,EAAMszM,SAGRD,MAAM3wL,GAGJA,EAAIqiL,QAAQriL,EAAIzsC,OAAS,OAGrBq+K,EAAK,UAEAn8K,EAAI,EAAGA,EAAIuqC,EAAIzsC,OAAQkC,IAAAA,OACxBs9I,EAAI/yG,EAAIshL,MAAM7rN,GAEpBm8K,GAAU,IAAJ7+B,EAEN/yG,EAAIshL,MAAM7rN,GAAU,SAALm8K,EAEfA,EAAS,GAAJ7+B,EAAW7+I,KAAK6nC,MAAM61I,EAAK,iBAIA,IAA9B5xI,EAAIshL,MAAMthL,EAAIzsC,OAAS,KACzBysC,EAAIzsC,QAAU,EACoB,IAA9BysC,EAAIshL,MAAMthL,EAAIzsC,OAAS,KACzBysC,EAAIzsC,QAAU,IAIXysC,EAGTsjT,KAAK11H,EAAIC,aAGArR,GAAOoR,EACR3Q,EAAKT,EAAIksO,QAAQ76N,EAAI,EAAGD,GACxB+6N,EAAKnsO,EAAIksO,QAAQzrO,EAAI,EAAGA,GACxB6sO,EAAKttO,EAAIksO,QAAQC,EAAI,EAAG1rO,GACxBjtD,EAAMwsD,EAAIksO,QAAQoB,EAAI,EAAGj8N,GACzBk8N,EAAMvtO,EAAIksO,QAAQ14R,EAAK,GAAIA,GAC3Bg6R,EAAMxtO,EAAIksO,QAAQqB,EAAK,GAAIA,GAC3BE,EAAMztO,EAAIksO,QAAQsB,EAAK,GAAIA,GAC3BE,EAAO1tO,EAAIksO,QAAQuB,EAAK,GAAIA,GAC5BE,EAAO3tO,EAAIksO,QAAQwB,EAAM,GAAIF,GAC7BI,EAAO5tO,EAAIksO,QAAQyB,EAAM,EAAGltO,GAC5BksO,EAAK3sO,EAAIisO,KAAK2B,EAAM,GACpB5/P,EAAKgyB,EAAIksO,QAAQS,EAAI,GAAIY,UACpBvtO,EAAIisO,KAAKj+P,EAAI,GAK1Bm9P,MAAM/5N,aAGGpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxBljC,EAAKp8J,KAAKg1T,KAAK11H,EAAIC,GACnBw8N,EAAK7tO,EAAIksO,QAAQh+P,EAAI,EAAGkjC,GACxB08N,EAAK9tO,EAAIisO,KAAK4B,EAAI,UACb7tO,EAAIksO,QAAQ4B,EAAI,EAAGz8N,GAKhC45N,IAAI75N,aAGKpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxBljC,EAAKp8J,KAAKg1T,KAAK11H,EAAIC,GACnBw8N,EAAK7tO,EAAIksO,QAAQh+P,EAAI,EAAGkjC,GACxB08N,EAAK9tO,EAAIisO,KAAK4B,EAAI,GAClBE,EAAK/tO,EAAIksO,QAAQ4B,EAAI,EAAGz8N,GACxB28N,EAAKhuO,EAAIisO,KAAK8B,EAAI,UACb/tO,EAAIksO,QAAQ8B,EAAI,EAAG58N,GAKhCg6N,MAAMh6N,aAGGpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxBljC,EAAKp8J,KAAKg1T,KAAK11H,EAAIC,GACnBw8N,EAAK7tO,EAAIksO,QAAQh+P,EAAI,EAAGmjC,UACnBrR,EAAIisO,KAAK4B,EAAI,IAU5B,MAAAhD,UAAmBK,EACjBzsZ,cAEE4Y,MAAM,OAAQ,0EAIhB88K,MAAM3wL,MAEAA,EAAIm9K,SAAAA,OACCn9K,MAELmsH,EAAQ,UAEH12J,EAAI,EAAGA,EAAIuqC,EAAIzsC,OAAQkC,IAAAA,OACxBs9I,EAAmB,EAAf/yG,EAAIshL,MAAM7rN,GAAY02J,EAEhCA,EAAQpZ,IAAM,GAEd/yG,EAAIshL,MAAM7rN,GAAS,SAAJs9I,SAGH,IAAVoZ,IACFnsH,EAAI69Y,OAAO79Y,EAAIzsC,OAAS,GACxBysC,EAAIshL,MAAMthL,EAAIzsC,UAAY44J,GAIrBnsH,EAGTsjT,KAAK11H,aAGIpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxB3Q,EAAKT,EAAIksO,QAAQ76N,EAAI,EAAGD,GACxB+6N,EAAKnsO,EAAIksO,QAAQzrO,EAAI,EAAGA,GACxB2rO,EAAMpsO,EAAIksO,QAAQC,EAAI,EAAGA,GACzBE,EAAMrsO,EAAIksO,QAAQE,EAAK,GAAIA,GAC3BW,EAAM/sO,EAAIksO,QAAQG,EAAK,GAAIA,GAC3BW,EAAMhtO,EAAIksO,QAAQa,EAAK,GAAIA,GAC3BkB,EAAOjuO,EAAIksO,QAAQc,EAAK,GAAIA,GAC5BkB,EAAOluO,EAAIksO,QAAQ+B,EAAM,GAAIlB,GAC7BoB,EAAOnuO,EAAIksO,QAAQgC,EAAM,EAAG/B,UACrBnsO,EAAIksO,QAAQiC,EAAM,EAAG/8N,GAKpC+5N,MAAM/5N,aAGGpR,GAAOoR,EACRu7N,EAAK76Z,KAAKg1T,KAAK11H,GACfpjC,EAAKgyB,EAAIisO,KAAKU,EAAI,UACb3sO,EAAIksO,QAAQl+P,EAAI,EAAGojC,GAKhC65N,IAAI75N,aAGKpR,GAAOoR,EACRu7N,EAAK76Z,KAAKg1T,KAAK11H,GACfpjC,EAAKgyB,EAAIisO,KAAKU,EAAI,GAClBz+P,EAAK8xB,EAAIksO,QAAQl+P,EAAI,EAAGojC,GACxBy8N,EAAK7tO,EAAIisO,KAAK/9P,EAAI,UACb8xB,EAAIksO,QAAQ2B,EAAI,EAAGz8N,GAKhCg6N,MAAMh6N,aAGGpR,GAAOoR,EACRu7N,EAAK76Z,KAAKg1T,KAAK11H,GACfpjC,EAAKgyB,EAAIksO,QAAQS,EAAI,EAAGv7N,UACnBpR,EAAIisO,KAAKj+P,EAAI,IAU5B,MAAA2lC,UAAqB83N,EACnBhtZ,cAEE4Y,MAAM,SAAU,yEAEA,0EAIlB88K,MAAM3wL,OAEAmsH,EAAQ,UAEH12J,EAAI,EAAGA,EAAIuqC,EAAIzsC,OAAQkC,IAAAA,OACxBs9I,EAAmB,GAAf/yG,EAAIshL,MAAM7rN,GAAY02J,EAEhCA,EAAQpZ,IAAM,GAEd/yG,EAAIshL,MAAM7rN,GAAS,SAAJs9I,SAGH,IAAVoZ,IACFnsH,EAAI69Y,OAAO79Y,EAAIzsC,OAAS,GACxBysC,EAAIshL,MAAMthL,EAAIzsC,UAAY44J,GAIrBnsH,EAGTsjT,KAAK11H,EAAIC,aAGArR,GAAOoR,EACRymD,EAAK73D,EAAIksO,QAAQ76N,EAAI,EAAGA,GACxB+8N,EAAKpuO,EAAIksO,QAAQr0K,EAAI,EAAGzmD,GACxBi9N,EAAMruO,EAAIksO,QAAQkC,EAAI,EAAGA,GACzBE,EAAMtuO,EAAIksO,QAAQmC,EAAK,GAAIA,GAC3BE,EAAMvuO,EAAIksO,QAAQoC,EAAK,GAAIA,GAC3BE,EAAMxuO,EAAIksO,QAAQqC,EAAK,GAAIF,GAC3BI,EAAOzuO,EAAIksO,QAAQsC,EAAK,GAAIA,GAC5BE,EAAO1uO,EAAIksO,QAAQuC,EAAM,IAAKA,UACvBzuO,EAAIksO,QAAQwC,EAAM,GAAIF,GAKrC7C,MAAMv6N,aAGGpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxBu7N,EAAK76Z,KAAKg1T,KAAK11H,EAAIC,GACnBrjC,EAAKgyB,EAAIisO,KAAKU,EAAI,UACb3sO,EAAIksO,QAAQl+P,EAAI,EAAGojC,GAKhC65N,IAAI75N,aAGKpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxBu7N,EAAK76Z,KAAKg1T,KAAK11H,EAAIC,GACnBrjC,EAAKgyB,EAAIisO,KAAKU,EAAI,GAClBz+P,EAAK8xB,EAAIksO,QAAQl+P,EAAI,EAAGojC,GACxBy8N,EAAK7tO,EAAIisO,KAAK/9P,EAAI,UACb8xB,EAAIksO,QAAQ2B,EAAI,EAAGx8N,GAKhCu6N,MAAMx6N,aAGGpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxBu7N,EAAK76Z,KAAKg1T,KAAK11H,EAAIC,GACnBrjC,EAAKgyB,EAAIksO,QAAQS,EAAI,EAAGv7N,UACnBpR,EAAIisO,KAAKj+P,EAAI,IAU5B,MAAA88P,UAAmBI,EACjBzsZ,cAEE4Y,MAAM,OAAQ,8HAMhB88K,MAAM3wL,SAGE+wL,EAAMziM,KAAKyiM,IAAIviH,OAAOxuE,UACrBA,EAAI6rL,OAAO,KAAK+xN,MAAM59Y,EAAK+wL,GAGpCuyH,KAAK11H,EAAIC,aAGArR,GAAOoR,EACR3Q,EAAKT,EAAIksO,QAAQ76N,EAAI,EAAGD,GACxB+6N,EAAKnsO,EAAIksO,QAAQzrO,EAAI,EAAGA,GACxB6sO,EAAKttO,EAAIksO,QAAQC,EAAI,EAAG1rO,GACxBjtD,EAAMwsD,EAAIksO,QAAQoB,EAAI,EAAGj8N,GACzBk8N,EAAMvtO,EAAIksO,QAAQ14R,EAAK,GAAIA,GAC3Bg6R,EAAMxtO,EAAIksO,QAAQqB,EAAK,GAAIA,GAC3BE,EAAMztO,EAAIksO,QAAQsB,EAAK,GAAIA,GAC3BE,EAAO1tO,EAAIksO,QAAQuB,EAAK,GAAIA,GAC5BE,EAAO3tO,EAAIksO,QAAQwB,EAAM,GAAIF,UACtBxtO,EAAIksO,QAAQyB,EAAM,EAAGt8N,GAKpC85N,MAAM/5N,aAGGpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxBu9N,EAAO78Z,KAAKg1T,KAAK11H,EAAIC,GACrBs7N,EAAK3sO,EAAIksO,QAAQyC,EAAM,EAAGv9N,GAC1BpjC,EAAKgyB,EAAIisO,KAAKU,EAAI,UACb3sO,EAAIksO,QAAQl+P,EAAI,IAAK2gQ,GAKlC1D,IAAI75N,aAGKpR,GAAOoR,EACRu7N,EAAK76Z,KAAKq5Z,MAAM/5N,GAChBpjC,EAAKgyB,EAAIisO,KAAKU,EAAI,UACb3sO,EAAIksO,QAAQl+P,EAAI,EAAGojC,GAKhCg6N,MAAMh6N,aAGGpR,GAAOoR,EACRC,EAAKrR,EAAIksO,QAAQ96N,EAAI,EAAGA,GACxBu7N,EAAK76Z,KAAKg1T,KAAK11H,EAAIC,GACnBrjC,EAAKgyB,EAAIksO,QAAQS,EAAI,EAAGt7N,UACnBrR,EAAIisO,KAAKj+P,EAAI,MAU5B,MAAAgkC,EACEvzL,YAAYztB,OACNkvC,EAAQ,KAEK,iBAANlvC,IACTkvC,EAAQ2/J,EAAG+T,OAAO5iN,GAClBA,EAAIkvC,EAAMlnD,GAGZsob,EAAQzhO,EAAG+E,KAAK5zM,GAAI,IAAK,UACzBo3a,GAAQp3a,EAAEgvM,IAAK,aACfv+L,EAAMzQ,EAAEopK,OAAS,EAAG,aAEpBtoJ,KAAK9gB,EAAIA,EACT8gB,KAAKouB,MAAQA,EACbpuB,KAAK20T,GAAK,KACV30T,KAAK45Z,IAAM,KAGb94N,SAASj6N,GACP8oB,EAAqB,IAAf9oB,EAAEksN,SAAgB,OACxB7E,EAAa,MAATrnN,EAAEqnN,IAAa,OAGrB2S,SAASh6N,EAAGyS,GACVqW,EAAoC,IAA7B9oB,EAAEksN,SAAWz5M,EAAEy5M,UAAiB,OACvC7E,EAAa,MAATrnN,EAAEqnN,KAAernN,EAAEqnN,MAAQ50M,EAAE40M,IAAK,yBAI/B,EAGT2X,gBAEmB,OAAb7lM,KAAK45Z,KAAoC,IAApB55Z,KAAK9gB,EAAEuyM,MAAM,MAChCzxL,KAAKouB,MACPpuB,KAAK45Z,IAAM55Z,KAAKouB,MAAMwrY,IAAIvkY,QAAQ+qK,UAAUpgM,iBAEtC4N,EAAAA,IAAQmgL,EAAG,GAAGE,MAAMjuL,MACpBjsG,EAAIisG,KAAK9gB,EAAEo/M,KAAK,GAAG3M,OAAO,GAGhC3xL,KAAK45Z,IAAM55Z,KAAKq/H,IAAIzxH,EAAG75G,UAIpBisG,KAGTmgM,UAAUzuL,SACF3lC,EAAM2lC,EAAI4wC,IAAItiD,KAAK9gB,UACzBnT,EAAImiN,IAAMluL,KACHj0B,EAGTu0N,YAAY5uL,SACJ3lC,EAAM2lC,EAAI2jB,eAChBtpD,EAAImiN,IAAM,KACHniN,EAGT+wb,MAAMj2b,UACGA,EAGTk2b,QAAQl2b,UACCA,EAGTm7N,KAAKn7N,UACCm5B,KAAKouB,MACApuB,KAAKouB,MAAM+zK,QAAQt7N,GAAGu5N,UAAUpgM,MAElCn5B,EAAEm7N,KAAKhiM,KAAK9gB,GAAGkhN,UAAUpgM,MAGlCovL,KAAKvoN,EAAGyS,UACN0mB,KAAK6gM,SAASh6N,EAAGyS,GAEjBzS,EAAEyob,MAAMzob,EAAGyS,GAEPzS,EAAE64N,KAAK1/L,KAAK9gB,IAAM,GACpBrY,EAAE4ob,MAAM5ob,EAAGm5B,KAAK9gB,GAEXrY,EAGTmY,IAAInY,EAAGyS,UACDzS,EAAE5B,OAASqU,EAAErU,OACR+6B,KAAKovL,KAAK91M,EAAE+7C,QAASxuD,GAEvBm5B,KAAKovL,KAAKvoN,EAAEwuD,QAAS/7C,GAG9Bg8M,MAAMzuN,EAAG6qC,UACP1R,KAAK8gM,SAASj6N,GAEV6qC,EAAM,EACD1R,KAAK0xL,MAAM7qN,GAAI6qC,IAEF,IAAlB1R,KAAK9gB,EAAEja,SACTysC,GAAO1R,KAAK9gB,EAAE8zM,MAAM,IAEtBnsN,EAAEitN,OAAOpiL,GAEL7qC,EAAE64N,KAAK1/L,KAAK9gB,IAAM,GACpBrY,EAAE4ob,MAAM5ob,EAAGm5B,KAAK9gB,GAEXrY,GAGTw3N,KAAKx3N,EAAG6qC,UACC1R,KAAKs1L,MAAMzuN,EAAEwuD,QAAS3jB,GAG/B29K,KAAKxoN,EAAGyS,GACN0mB,KAAK6gM,SAASh6N,EAAGyS,SAKX6tB,EAAMtgC,EAAE64N,KAAKpmN,UAEP,IAAR6tB,GACFtgC,EAAEmsN,MAAM,GAAK,EACbnsN,EAAE5B,OAAS,EACJ4B,IAGLsgC,EAAM,GACRtgC,EAAE4ob,MAAMn2a,EAAGzS,GACXA,EAAE4ob,MAAMzvZ,KAAK9gB,EAAGrY,IAEhBA,EAAE4ob,MAAM5ob,EAAGyS,GAGNzS,GAGTyqD,IAAIzqD,EAAGyS,UACE0mB,KAAKqvL,KAAKxoN,EAAEwuD,QAAS/7C,GAG9Bo4M,MAAM7qN,EAAG6qC,UACP1R,KAAK8gM,SAASj6N,GAEV6qC,EAAM,EACD1R,KAAKs1L,MAAMzuN,GAAI6qC,IAEF,IAAlB1R,KAAK9gB,EAAEja,SACTysC,GAAO1R,KAAK9gB,EAAE8zM,MAAM,IAIL,IAAbnsN,EAAE5B,QAAgB4B,EAAEmsN,MAAM,GAAKthL,GACjC7qC,EAAEmsN,MAAM,GAAKthL,EAAM7qC,EAAEmsN,MAAM,GAC3BnsN,EAAE4ob,MAAMzvZ,KAAK9gB,EAAGrY,IAEhBA,EAAE8ob,OAAOj+Y,GAGJ7qC,GAGTy3N,KAAKz3N,EAAG6qC,UACC1R,KAAK0xL,MAAM7qN,EAAEwuD,QAAS3jB,GAG/B69K,KAAK1oN,EAAGyS,UACN0mB,KAAK6gM,SAASh6N,EAAGyS,GACV0mB,KAAKgiM,KAAKn7N,EAAE0oN,KAAKj2M,IAG1Bs2M,IAAI/oN,EAAGyS,UACL0mB,KAAK6gM,SAASh6N,EAAGyS,GACV0mB,KAAKgiM,KAAKn7N,EAAE+oN,IAAIt2M,IAGzBu6M,MAAMhtN,EAAG6qC,MACP1R,KAAK8gM,SAASj6N,GAEVA,EAAEgoN,SAAAA,OACGhoN,KAEG,IAAR6qC,SACF7qC,EAAEmsN,MAAM,GAAK,EACbnsN,EAAE5B,OAAS,EACJ4B,QAGH+uN,EAAMlkL,EAAM,KAEdkkL,IACFlkL,GAAOA,GAEa,IAAlB1R,KAAK9gB,EAAEja,SACTysC,GAAO1R,KAAK9gB,EAAE8zM,MAAM,IAEtBnsN,EAAEgtN,MAAMniL,GAEJA,GAAO,QAEF7qC,EAAE64N,KAAK1/L,KAAK9gB,IAAM,GACvBrY,EAAE4ob,MAAM5ob,EAAGm5B,KAAK9gB,QAElB8gB,KAAKgiM,KAAKn7N,UAGR+uN,GACF51L,KAAK01L,KAAK7uN,GAELA,EAGTs2N,KAAKt2N,EAAG6qC,UACC1R,KAAK6zL,MAAMhtN,EAAEwuD,QAAS3jB,GAG/B2mQ,KAAKxxS,EAAGyS,UACC0mB,KAAKszJ,IAAIzsL,EAAGyS,GAAGuyQ,MAAMhlR,GAG9BysL,IAAIzsL,EAAGyS,UACE0mB,KAAK4vL,IAAI/oN,EAAGm5B,KAAK05R,OAAOpgT,IAGjCq7M,MAAM9tN,EAAG6qC,UACA1R,KAAK8+L,KAAKj4N,EAAG6qC,GAAKm6O,MAAMhlR,GAGjCi4N,KAAKj4N,EAAG6qC,UACC1R,KAAKszJ,IAAIzsL,EAAGm5B,KAAKmgM,UAAAA,IAAcpS,EAAGr8K,KAG3Cs/Y,KAAKnqb,EAAG6qC,UACC1R,KAAKq/H,IAAIx4J,EAAG6qC,GAAKm6O,MAAMhlR,GAGhCw4J,IAAIx4J,EAAG6qC,UACL1R,KAAK8gM,SAASj6N,GAEV6qC,EAAIikL,UACN9uN,EAAIm5B,KAAK05R,OAAO7yT,IAGC,IAAf6qC,EAAIzsC,OACC+6B,KAAKkxZ,KAAKrqb,EAAG6qC,EAAIshL,MAAM,IAG5Bq8N,IAAervZ,KAAKouB,MACfpuB,KAAKg9Z,OAAOn2b,EAAG6qC,GAGjB1R,KAAKi9Z,OAAOp2b,EAAG6qC,GAGxBurZ,OAAOp2b,EAAG6qC,SAEF+wL,EAAAA,IAAU1U,EAAG,GAAGE,MAAMjuL,MACtB6iM,EAAAA,IAAUhlM,MAn6JH,GAo6JPimK,EAAK9jK,KAAKo9L,IAAIv2N,GAEpBg8N,EAAI,GAAKh8N,UAEAM,EAAI,EAAGA,EAx6JH,EAw6JiBA,IAC5B07N,EAAI17N,GAAK64B,KAAK4vL,IAAIiT,EAAI17N,EAAI,GAAI28L,OAE5B38L,EAAIuqC,EAAIu/J,YACRjjK,EAAIy0L,OAEDt7N,GA/6JO,GA+6JF+1b,KACNhvW,EAh7JQ,EAi7JRksE,EAAO1oH,EAAI0oH,KAAKjzJ,EAAI+mF,EAAOA,MAE3BksE,EAl7JO,EAm7JTpsH,EAAIhO,KAAKo9L,IAAIpvL,GACb7mC,GAAK,YAIe,IAAP,EAAPizJ,IACNlsE,GAAS,EACTksE,IAAS,EAGPpsH,IAAMy0L,EACRz0L,EAAI60L,EAAIzoE,GAAQ,GAAG/kG,SAEnBrnB,EAAIhO,KAAKm6Z,KAAKnsZ,EAAGkgD,GACjBlgD,EAAIhO,KAAK4vL,IAAI5hL,EAAG60L,EAAIzoE,GAAQ,KAG9BjzJ,GAAK+mF,MAGH/mF,EAAI,EAAA,OACAizJ,EAAO1oH,EAAI0oH,KAAK,EAAGjzJ,QAElBA,KACL6mC,EAAIhO,KAAKo9L,IAAIpvL,GAERosH,GAAQjzJ,EAAK,IAChB6mC,EAAIhO,KAAK4vL,IAAI5hL,EAAGnnC,WAIfmnC,EAGTgvZ,OAAOn2b,EAAG6qC,GACQ,OAAZ1R,KAAK20T,KACP30T,KAAK20T,GAAK30T,KAAK9gB,EAAE4wa,kBAGbjiZ,EA85BV,SAAgBD,EAAG75G,EAAGmrF,SAEdujN,EAAMzmK,OAAO,GACb6mK,EAAAA,IAAUhlM,MA33LD,GA43LT0hM,EAAM3xL,EAAIA,EAAK1uB,EAErB2jN,EAAI,GAAKj1L,UAEAzmC,EAAI,EAAGA,EAh4LD,EAg4LeA,IAC5B07N,EAAI17N,GAAM07N,EAAI17N,EAAI,GAAKo4N,EAAMrgN,MAE3B/X,EAAIpzE,EAAEk9Q,YACNjjK,EAAIy0L,OAEDt7N,GAv4LS,GAu4LJ+1b,KACNhvW,EAx4LU,EAy4LVksE,EAAOrmO,EAAEqmO,KAAKjzJ,EAAI+mF,EAAOA,MAEzBksE,EA14LS,EA24LXpsH,EAAKA,EAAIA,EAAK9uB,EACd/X,GAAK,YAIe,IAAP,EAAPizJ,IACNlsE,GAAS,EACTksE,IAAS,EAGPpsH,IAAMy0L,EACRz0L,EAAI60L,EAAIzoE,GAAQ,IAEhBpsH,EAAImsZ,EAAKnsZ,EAAGkgD,EAAOhvE,GACnB8uB,EAAKA,EAAI60L,EAAIzoE,GAAQ,GAAMl7I,GAG7B/X,GAAK+mF,MAGH/mF,EAAI,EAAA,OACAizJ,EAAOrmO,EAAEqmO,KAAK,EAAGjzJ,QAEhBA,KACL6mC,EAAKA,EAAIA,EAAK9uB,EAETk7I,GAAQjzJ,EAAK,IAChB6mC,EAAKA,EAAIJ,EAAK1uB,UAIb8uB,EAh9BKgvZ,CADAh9Z,KAAK+8Z,QAAQl2b,EAAEipb,YACLp+Y,EAAK1R,KAAK20T,IACxBpvM,EAAIvlH,KAAK88Z,MAAMjvZ,UAEdkgL,EAAGyqO,WAAWjzS,GAAG66E,UAAUpgM,MAGpCm6Z,KAAKtzb,EAAG5yE,QACCA,KACL4yE,EAAIm5B,KAAKo9L,IAAIv2N,UAERA,EAGTuzb,QAAQvzb,EAAG5yE,EAAGqlF,UACL0mB,KAAK4vL,IAAI5vL,KAAKm6Z,KAAKtzb,EAAG5yE,GAAIqlF,GAGnC23a,MAAMpqb,EAAG6qC,UACA1R,KAAKkxZ,KAAKrqb,EAAG6qC,GAAKm6O,MAAMhlR,GAGjCqqb,KAAKrqb,EAAG6qC,MACN1R,KAAK8gM,SAASj6N,GAEV6qC,EAAM,IACR7qC,EAAIm5B,KAAK05R,OAAO7yT,GAChB6qC,GAAOA,GAGG,IAARA,EAAQ,OAAA,IACCq8K,EAAG,GAAGE,MAAMjuL,SAEb,IAAR0R,EAAQ,OACH7qC,EAAEwuD,YAIPrnB,EAAInnC,UAECM,EAJImpb,EAAU5+Y,GAIH,EAAGvqC,GAAK,EAAGA,IAC7B6mC,EAAIhO,KAAKo9L,IAAIpvL,GAER0D,GAAOvqC,EAAK,IACf6mC,EAAIhO,KAAK4vL,IAAI5hL,EAAGnnC,WAGbmnC,EAGTqvL,KAAKx2N,UACIm5B,KAAKuvL,KAAK1oN,EAAGA,GAGtBu2N,IAAIv2N,UACKm5B,KAAK4vL,IAAI/oN,EAAGA,GAGrB4qb,MAAM7jZ,UACG5N,KAAKghM,KAAKpzL,GAAGi+O,MAAMj+O,GAG5BozL,KAAKpzL,UACH5N,KAAK8gM,SAASlzL,GAGV5N,KAAKouB,MACApuB,KAAKouB,MAAM4yK,KAAKpzL,GAGD,IAApB5N,KAAK9gB,EAAEuyM,MAAM,GACRzxL,KAAKm9Z,UAAUvvZ,GAGA,IAApB5N,KAAK9gB,EAAEuyM,MAAM,GACC,MAAZzxL,KAAK45Z,IACA55Z,KAAKo9Z,aAAaxvZ,GACpB5N,KAAKq9Z,UAAUzvZ,GAIjB5N,KAAKs9Z,MAAM1vZ,GAGpBuvZ,UAAUvvZ,SACF75G,EAAIisG,KAAK9gB,EAAEm/M,KAAK,GAAG1M,OAAO,GAC1Br4M,EAAI0mB,KAAKq/H,IAAIzxH,EAAG75G,OAEjBisG,KAAKo9L,IAAI9jN,GAAGi6B,GAAG3F,GAAAA,MAAAA,IACR2rZ,EAAgBjgb,UAErBA,EAGT+jb,UAAUzvZ,SAEF60L,EAAAA,IAAU1U,EAAG,GAAGE,MAAMjuL,MACtBjsG,EAAIisG,KAAK9gB,EAAEg/M,MAAM,GACjBqB,EAAKv/L,KAAKhhB,IAAI4uB,EAAGA,GACjBwd,EAAQprB,KAAKq/H,IAAIkgE,EAAIxrS,GACrBs3H,EAAOrrB,KAAK4vL,IAAI2P,EAAIv/L,KAAKo9L,IAAIhyK,IAC7B9xC,EAAI0mB,KAAK4vL,IAAI5vL,KAAK4vL,IAAIxkK,EAAOxd,GAAI5N,KAAKqvL,KAAKhkK,EAAMo3K,QAElDziM,KAAKo9L,IAAI9jN,GAAGi6B,GAAG3F,GAAAA,MAAAA,IACR2rZ,EAAgBjgb,UAErBA,EAGT8jb,aAAaxvZ,SACL75G,EAAIisG,KAAK9gB,EAAEm/M,KAAK,GAAG1M,OAAO,GAC1Br4M,EAAI0mB,KAAKq/H,IAAIzxH,EAAG75G,MAElBisG,KAAKo9L,IAAI9jN,GAAGi6B,GAAG3F,GAAAA,OACVt0B,QAEH7M,EAAIuzB,KAAK4vL,IAAIt2M,EAAG0mB,KAAK45Z,QAEvB55Z,KAAKo9L,IAAI3wN,GAAG8mC,GAAG3F,GAAAA,OACVnhC,YAEC8sb,EAAgBjgb,GAG5Bgkb,MAAM1vZ,MACmB,IAAnB5N,KAAK9gB,EAAE8yM,KAAK,KAAahyL,KAAK9gB,EAAEqvM,QAAAA,MAAAA,IACxBz1L,MAAM,yBAEVkH,KAAKwzZ,OAAO5lZ,SACZ,YACM2rZ,EAAgB3rZ,QACvB,SACIA,EAAEynB,cAKPotK,EAAAA,IAAU1U,EAAG,GAAGE,MAAMjuL,MACtB9jB,EAAI8jB,KAAK9gB,EAAEo/M,KAAK,GAChBvqS,EAAImoF,EAAEw3a,WACNz/f,EAAAA,IAAQ85R,EAAG,GAAGE,MAAMjuL,YAEC,IAApBA,KAAKwzZ,OAAOv/f,IACjB+rG,KAAKovL,KAAKn7R,EAAGwuS,OAEXr+E,EAAIpkH,KAAKq/H,IAAIprO,EAAGioF,GAChB5C,EAAI0mB,KAAKq/H,IAAIzxH,EAAG1xB,GAChB2xB,EAAI7N,KAAKq/H,IAAIzxH,EAAG1xB,EAAEo5M,MAAM,GAAG3D,OAAO,IAClCt9R,EAAIN,cAGFgrJ,EAAIzlE,EACJ4F,EAAI,QAEA6/D,EAAExrC,GAAGkvL,IAAQvjN,EAAI7qF,GACvB0qJ,EAAI/+C,KAAKo9L,IAAIr+I,GACb7/D,GAAK,KAGG,IAANA,EAAM,MAGV2Z,EAAO3Z,EAAI7qF,GAEX0qJ,EAAI/+C,KAAKm6Z,KAAK/1S,EAAG/vN,EAAI6qF,EAAI,GACzBklI,EAAIpkH,KAAKo9L,IAAIr+I,GACblxC,EAAI7N,KAAK4vL,IAAI/hL,EAAGkxC,GAChBzlE,EAAI0mB,KAAK4vL,IAAIt2M,EAAG8qI,GAChB/vN,EAAI6qF,SAGC2uB,EAGT6oZ,SAASxiU,EAAGpvB,UACH9kE,KAAK42Z,QAAQ1iU,EAAGpvB,GAAG+mL,MAAM33J,GAGlC0iU,QAAQ1iU,EAAGpvB,MACT9kE,KAAK6gM,SAAS3sG,EAAGpvB,GAGbovB,EAAE26F,UAAY/pH,EAAE+pH,SAAAA,MAAAA,IACR0qO,EAAgBz0V,MAGxB9kE,KAAKouB,MAAAA,OACApuB,KAAKouB,MAAMwoY,QAAQ1iU,EAAGpvB,MAGP,IAApB9kE,KAAK9gB,EAAEuyM,MAAM,GAAO,OACfzxL,KAAKu9Z,aAAarpU,EAAGpvB,MAGd,MAAZ9kE,KAAK45Z,KAAmC,IAApB55Z,KAAK9gB,EAAEuyM,MAAM,GAAO,OACnCzxL,KAAKw9Z,aAAatpU,EAAGpvB,MAG1BA,EAAE+pH,SAAAA,MAAAA,IACM0qO,EAAgBz0V,UAErB9kE,KAAKghM,KAAKhhM,KAAKszJ,IAAIp/D,EAAGpvB,IAG/By4V,aAAarpU,EAAGpvB,SAER/wK,EAAIisG,KAAK9gB,EAAEo/M,KAAK,GAAG3M,OAAO,GAC1BO,EAAKlyL,KAAKo9L,IAAIlpG,GACdslU,EAAKx5Z,KAAK4vL,IAAIsC,EAAIh+F,GAClBulU,EAAKz5Z,KAAK4vL,IAAI4pO,EAAItnO,GAClBwnO,EAAK15Z,KAAK4vL,IAAI5vL,KAAKo9L,IAAIt4H,GAAIA,GAC3B59F,EAAI84B,KAAKq/H,IAAIr/H,KAAK4vL,IAAI6pO,EAAIC,GAAK3lgB,GAC/B65G,EAAI5N,KAAK4vL,IAAI5vL,KAAK4vL,IAAI4pO,EAAI10V,GAAI59F,MAC1B84B,KAAK4vL,IAAI9qH,EAAG9kE,KAAKo9L,IAAIxvL,IAEzB2F,GAAG2gF,GAAAA,OACAtmF,YAEC2rZ,EAAgB3rZ,GAG5B4vZ,aAAatpU,EAAGpvB,SAER/wK,EAAIisG,KAAK9gB,EAAEo/M,KAAK,GAAG3M,OAAO,GAC1B+nO,EAAK15Z,KAAK4vL,IAAI5vL,KAAKo9L,IAAIt4H,GAAIA,GAC3Bi1V,EAAK/5Z,KAAK4vL,IAAI5vL,KAAKo9L,IAAIs8N,GAAK50V,GAC5B59F,EAAI84B,KAAKq/H,IAAIr/H,KAAK4vL,IAAI17F,EAAG6lU,GAAKhmgB,GAC9B65G,EAAI5N,KAAK4vL,IAAI5vL,KAAK4vL,IAAI17F,EAAGwlU,GAAKxyb,GAC9BuF,EAAIuzB,KAAK4vL,IAAI9qH,EAAG9kE,KAAKo9L,IAAIxvL,OAE3BnhC,EAAE8mC,GAAG2gF,GAAAA,OACAtmF,QAEH0pF,EAAKt3F,KAAK01L,KAAKjpN,MAEjB6qH,EAAG/jF,GAAG2gF,GAAAA,OACDl0F,KAAK4vL,IAAIhiL,EAAG5N,KAAK45Z,QAEtBtiU,EAAG/jF,GAAGvT,KAAK4vL,IAAI17F,EAAGl0F,KAAK45Z,MAAAA,MAAAA,IACfL,EAAgBv5Z,KAAK4vL,IAAIhiL,EAAG5N,KAAK45Z,gBAEnCL,EAAgB3rZ,GAG5B8jZ,SAAS7qb,UACHm5B,KAAK9gB,EAAEqvM,QACFvuL,KAAKwzZ,OAAO3sb,IAAM,EAEpBm5B,KAAK4zZ,UAAU/sb,IAAM,EAG9B6rb,KAAK7rb,EAAG6qC,UACN1R,KAAK8gM,SAASj6N,GACPm5B,KAAKgiM,KAAKn7N,EAAE8rb,MAAMjhZ,IAG3BivL,IAAI95N,EAAG6qC,UACE1R,KAAK0yZ,KAAK7rb,EAAEwuD,QAAS3jB,GAG9BgsL,MAAM72N,EAAG6qC,MACP1R,KAAK8gM,SAASj6N,GAEdA,EAAE02N,OAAO7rL,GAELA,GAAO,OAEF7qC,EAAE64N,KAAK1/L,KAAK9gB,IAAM,GACvBrY,EAAE4ob,MAAM5ob,EAAGm5B,KAAK9gB,QAElB8gB,KAAKgiM,KAAKn7N,UAGLA,EAGTk3N,KAAKl3N,EAAG6qC,UACC1R,KAAK09L,MAAM72N,EAAEwuD,QAAS3jB,GAG/BgkL,KAAK7uN,UACHm5B,KAAK8gM,SAASj6N,GAETA,EAAEgoN,UACLhoN,EAAE4ob,MAAMzvZ,KAAK9gB,EAAGrY,GAEXA,EAGT+uN,IAAI/uN,UACKm5B,KAAK01L,KAAK7uN,EAAEwuD,SAGrB9hB,GAAG1sC,EAAGyS,UACJ0mB,KAAK6gM,SAASh6N,EAAGyS,GACI,IAAdzS,EAAE64N,KAAKpmN,GAGhB2mN,IAAIp5N,EAAG6qC,MACL1R,KAAK8gM,SAASj6N,GAEQ,IAAlBm5B,KAAK9gB,EAAEja,cACTysC,GAAO1R,KAAK9gB,EAAE8zM,MAAM,IAEV,IACRthL,GAAO1R,KAAK9gB,EAAE8zM,MAAM,IAEE,IAAjBnsN,EAAEuqb,MAAM1/Y,MAGbA,EAAM,EAAA,CACR1R,KAAK9gB,EAAEywa,QAAQj+Y,SAETvK,EAAMtgC,EAAE64N,KAAK1/L,KAAK9gB,UAExB8gB,KAAK9gB,EAAE40M,QAAQpiL,GAEA,IAARvK,SAGe,IAAjBtgC,EAAEuqb,MAAM1/Y,GAGjB2lZ,OAAOxwb,UACGm5B,KAAKu3Z,MAAM1wb,GAGrB0wb,MAAM1wb,UACJm5B,KAAK8gM,SAASj6N,GACPA,EAAE64N,KAAK1/L,KAAK9gB,EAAEg/M,MAAM,KAAO,EAGpC3P,MAAM1nN,UACJm5B,KAAK8gM,SAASj6N,GACPA,EAAE0nN,QAGXpT,OAAOt0M,UACLm5B,KAAK8gM,SAASj6N,GACPA,EAAEs0M,SAGXm4O,SAAS5hZ,MACP1R,KAAK8gM,SAASpvL,GAEV1R,KAAK9gB,EAAEi8L,SAAAA,MAAAA,IACCriL,MAAM,sCAGZ/kG,EAAIisG,KAAK9gB,EAAEo/M,KAAK,GAAG3M,OAAO,GAC1Bn7D,EAASx2H,KAAKq/H,IAAI3tH,EAAK39G,MAEzByiO,EAAOq4D,SAAAA,OACF,QAEH4T,EAAAA,IAAU1U,EAAG,GAAGE,MAAMjuL,SAExBw2H,EAAOjjH,GAAGkvL,GAAAA,OACL,KAELjsE,EAAOjjH,GAAGvT,KAAK01L,KAAK+M,IAAAA,OACd,YAEA3pM,MAAM,kBAGlB06Z,OAAO3sb,UACLm5B,KAAK8gM,SAASj6N,GACPA,EAAE2sb,OAAOxzZ,KAAK9gB,GAGvB00a,UAAU/sb,UACRm5B,KAAK8gM,SAASj6N,GACPA,EAAE+sb,UAAU5zZ,KAAK9gB,GAG1B+0a,QAAQptb,UACCm5B,KAAK05R,OAAO7yT,GAAGglR,MAAMhlR,GAG9B6yT,OAAO7yT,UACLm5B,KAAK8gM,SAASj6N,GACPA,EAAE6yT,OAAO15R,KAAK9gB,GAAGkhN,UAAUpgM,MAGpCm0Z,QAAQttb,UACCm5B,KAAKo0Z,OAAOvtb,GAAGglR,MAAMhlR,GAG9Butb,OAAOvtb,MACLm5B,KAAK8gM,SAASj6N,GAEVA,EAAEgoN,UAA+B,IAAnB7uL,KAAK9gB,EAAE8yM,KAAK,GAAO,MAAA,IACzBzyD,WAAW,0BAGnBv/H,KAAKouB,MACApuB,KAAKouB,MAAMgmY,OAAOvtb,GAGpBm5B,KAAKq/H,IAAIx4J,EAAGm5B,KAAK9gB,EAAEo/M,KAAK,IAGjCm/N,UAAUC,GAERlO,EAAQ3xZ,MAAM/gB,QAAQ4gb,GAAQ,QAAS,mBAE5B/pW,KAAQ+pW,EACjBlO,EAAQzhO,EAAG+E,KAAKn/H,GAAO,OAAQ,UAE/B3zD,KAAK8gM,SAASntI,MAGO,IAAnB3zD,KAAK9gB,EAAE8yM,KAAK,IAAYhyL,KAAK9gB,EAAEi8L,SAAAA,MAAAA,IACvB57C,WAAW,yBAEjBn8H,EAAMs6Z,EAAMz4b,OACZ04b,EAAAA,IAAW9/Z,MAAMuF,MAEX,IAARA,EAAQ,OACHu6Z,MAELtnR,EAAAA,IAAU03C,EAAG,GAAGE,MAAMjuL,cAEjB74B,EAAI,EAAGA,EAAIi8B,EAAKj8B,IACnBu2b,EAAMv2b,GAAG0nN,SACX8uO,EAAKx2b,GAAKu2b,EAAMv2b,GAAGkuD,SAIrBsoY,EAAKx2b,GAAKkvK,EACVA,EAAMr2I,KAAK4vL,IAAIv5C,EAAKqnR,EAAMv2b,KAG5BkvK,EAAMr2I,KAAK05R,OAAOrjJ,WAETlvK,EAAIi8B,EAAM,EAAGj8B,GAAK,EAAGA,IACxBu2b,EAAMv2b,GAAG0nN,WAGb8uO,EAAKx2b,GAAK64B,KAAK4vL,IAAIv5C,EAAKsnR,EAAKx2b,IAC7BkvK,EAAMr2I,KAAK4vL,IAAIv5C,EAAKqnR,EAAMv2b,YAGrBw2b,GAGR7mT,YACK92G,KAAKouB,MAAAA,SACSpuB,KAAKouB,MAAMv7H,iBAEbmtG,KAAK9gB,EAAEkf,SAAS,QAQpC,MAAA86K,UAAsBgnB,EACpBvzL,YAAYztB,GACVqmC,MAAMrmC,GAEN8gB,KAAKouB,MAAQ,KACbpuB,KAAK/rG,EAAI+rG,KAAK9gB,EAAE+xL,YAEXjxK,KAAK/rG,EAAI,IAAQ,IACpB+rG,KAAK/rG,GAAK,GAAM+rG,KAAK/rG,EAAI,IAE3B+rG,KAAK3rG,EAAa,EAAT2rG,KAAK/rG,EACd+rG,KAAKykH,EAAIzkH,KAAK3rG,EAAI,GAClB2rG,KAAK1mB,EAAIy0M,EAAGppL,MAAM,EAAG3E,KAAK3rG,GAAGi/P,IAAItzJ,KAAK9gB,GAGxCihN,UAAUzuL,UACJA,EAAIzsC,OAAS+6B,KAAKykH,EACbl/F,MAAM46K,UAAUzuL,GAElB1R,KAAKgiM,KAAKtwL,EAAI2jB,SAGvBuoY,OAAOtvZ,OACDnnC,EAAI,EACJmqB,EAAI0O,KAAKykH,OAENnzH,EAAIgd,EAAErpC,QACXqpC,EAAE0kL,MAAM7rN,KAAOmnC,EAAE0kL,MAAM1hM,KAEf,IAANnqB,IACFmnC,EAAE0kL,MAAM7rN,KAAO,GAEjBmnC,EAAErpC,OAASkC,EAGb66N,KAAKn7N,SACG+uN,EAAM/uN,EAAEksN,SAEdl6L,EAAOhyB,EAAE5B,QAAU+6B,KAAKykH,GAExB59I,EAAEksN,SAAW,QAEPzkL,EAAIznC,EAAE+oN,IAAI5vL,KAAK1mB,UAGrB0mB,KAAK49Z,OAAOtvZ,GAEZznC,EAAE4ob,MAAM5ob,EAAGynC,EAAEshL,IAAI5vL,KAAK9gB,IAElBrY,EAAE64N,KAAK1/L,KAAK9gB,IAAM,GACpBrY,EAAE4ob,MAAM5ob,EAAGm5B,KAAK9gB,GAEd02M,IAAQ/uN,EAAEgoN,UACZhoN,EAAE4ob,MAAMzvZ,KAAK9gB,EAAGrY,GAElBA,EAAEqnN,IAAMluL,KAEDn5B,GAQX,MAAAk7N,UAAmB7B,EACjBvzL,YAAYztB,GACVqmC,MAAMrmC,GAWN8gB,KAAKouB,MAAQ,KACbpuB,KAAK/rG,EAAoB,GAAhB+rG,KAAK9gB,EAAEja,OAChB+6B,KAAKgO,EAAI+/K,EAAGppL,MAAM,EAAG3E,KAAK/rG,GAC1B+rG,KAAKo8J,GAAK2xB,EAAGppL,MAAM,EAAY,EAAT3E,KAAK/rG,GAAO+tS,KAAKhiM,KAAK9gB,GAC5C8gB,KAAKygQ,GAAKzgQ,KAAKgO,EAAE0rR,OAAO15R,KAAK9gB,GAC7B8gB,KAAKk6K,GAAKl6K,KAAKgO,EAAE4hL,IAAI5vL,KAAKygQ,IAAI/uE,MAAM,GAAGp+B,IAAItzJ,KAAK9gB,GAChD8gB,KAAK69Z,IAAM,uBAIJ,EAGT19N,UAAUzuL,UACJA,EAAIikL,SAAWjkL,EAAIguL,KAAK1/L,KAAK9gB,IAAM,EAC9B8gB,KAAKgiM,KAAKtwL,EAAIssL,MAAMh+L,KAAK/rG,IAG3B+rG,KAAK4vL,IAAIl+K,EAAK1R,KAAKo8J,IAG5BkkC,YAAY5uL,SAEJ1D,EAAIhO,KAAK4vL,IAAIl+K,EAAAA,IAASq8K,EAAG,WAC/B//K,EAAEkgL,IAAM,KACDlgL,EAGT8uZ,MAAMj2b,UACIA,GAAKm1D,OAAOh8B,KAAK/rG,IAAM+rG,KAAK20T,GAGtCooG,QAAQl2b,UACW,OAAbm5B,KAAK69Z,MACP79Z,KAAK69Z,IAAM79Z,KAAKygQ,GAAGqvJ,YAEbjpb,EAAIm5B,KAAK69Z,IAAO79Z,KAAK20T,GAG/Br/H,MAAMzuN,EAAG6qC,UACA1R,KAAKovL,KAAKvoN,EAAGm5B,KAAKmgM,UAAAA,IAAcpS,EAAGr8K,KAG5CggL,MAAM7qN,EAAG6qC,UACA1R,KAAKqvL,KAAKxoN,EAAGm5B,KAAKmgM,UAAAA,IAAcpS,EAAGr8K,KAG5C69K,KAAK1oN,EAAGyS,UACC0mB,KAAK4vL,IAAI/oN,EAAGyS,GAAGuyQ,MAAMhlR,GAG9B+oN,IAAI/oN,EAAGyS,MACDzS,EAAEgoN,UAAYv1M,EAAEu1M,SAAAA,OAAAA,IACPd,EAAG,GAAGqS,UAAUpgM,YAEvB++C,EAAIl4E,EAAE+oN,IAAIt2M,GACV7M,EAAIsyE,EAAEq0W,OAAOpzZ,KAAK/rG,GAAG27R,IAAI5vL,KAAKk6K,IAAIi5O,QAAQnzZ,KAAK/rG,GAC/CigM,EAAIn1C,EAAEqwI,KAAK3iN,EAAEmjN,IAAI5vL,KAAK9gB,IAAIyyM,OAAO3xL,KAAK/rG,UAExCigM,EAAEwrG,KAAK1/L,KAAK9gB,IAAM,GACpBg1G,EAAEu7T,MAAMv7T,EAAGl0F,KAAK9gB,GAEXg1G,EAAEksG,UAAUpgM,MAGrB6zL,MAAMhtN,EAAG6qC,MACP1R,KAAK8gM,SAASj6N,GAEVA,EAAEgoN,SAAAA,OACGhoN,KAEG,IAAR6qC,SACF7qC,EAAEmsN,MAAM,GAAK,EACbnsN,EAAE5B,OAAS,EACJ4B,QAGH+uN,EAAMlkL,EAAM,EAEdkkL,IACFlkL,GAAOA,GAEa,IAAlB1R,KAAK9gB,EAAEja,SACTysC,GAAO1R,KAAK9gB,EAAE8zM,MAAM,UAEhB54D,EAAOk2R,EAAU5+Y,MAInB0oH,EAAO,EAETp6H,KAAKuvL,KAAK1oN,EAAGm5B,KAAKmgM,UAAAA,IAAcpS,EAAGr8K,aACJ,IAArBA,EAAOA,EAAM,WAEdvqC,EAAI,EAAGA,EAAIizJ,EAAO,EAAGjzJ,IAC5B64B,KAAKovL,KAAKvoN,EAAGA,cAGT4F,EAAI5F,EAAEwuD,gBAEHluD,EAAIizJ,EAAO,EAAGjzJ,GAAK,EAAGA,IAC7B64B,KAAKovL,KAAKvoN,EAAGA,GAER6qC,GAAOvqC,EAAK,GACf64B,KAAKovL,KAAKvoN,EAAG4F,UAIfmpN,GACF51L,KAAK01L,KAAK7uN,GAELA,EAGTo5N,IAAIp5N,EAAG6qC,UACL1R,KAAK8gM,SAASj6N,GAEF,IAAR6qC,EACK7qC,EAAEgoN,SAEoC,IAAxChoN,EAAE64N,KAAK1/L,KAAKmgM,UAAAA,IAAcpS,EAAGr8K,KAGtC6lZ,MAAM1wb,UACJm5B,KAAK8gM,SAASj6N,GACPm5B,KAAKsgM,YAAYz5N,GAAG64N,KAAK1/L,KAAK9gB,EAAEg/M,MAAM,KAAO,EAGtD3P,MAAM1nN,UACJm5B,KAAK8gM,SAASj6N,GACPm5B,KAAKsgM,YAAYz5N,GAAG0nN,QAG7BpT,OAAOt0M,UACLm5B,KAAK8gM,SAASj6N,GACPm5B,KAAKsgM,YAAYz5N,GAAGs0M,SAG7Bu+G,OAAO7yT,UACLm5B,KAAK8gM,SAASj6N,GAGPm5B,KAAKgiM,KAAKn7N,EAAE6yT,OAAO15R,KAAK9gB,GAAG0wM,IAAI5vL,KAAKo8J,MAQ/C,SAAA0hQ,EAAmBhla,EAAOrpB,EAAKuF,SACvBykB,EAAAA,IAAUX,EAAMrpB,UAElBqpB,EAAMqsJ,mBACRrsJ,EAAMqsJ,kBAAkB1rJ,EAAKzkB,GAExBykB,EAGT,SAAAZ,EAAgBnlG,EAAOimF,OAChBjmF,EAAAA,OAEGoqgB,EAAUhla,MADJnf,GAAW,oBACKkf,IAIhC,SAAA22Z,EAAiB97f,EAAOb,EAAMi0E,OACvBpzE,EAAAA,OAEGoqgB,EAAU/4Z,UADVt1B,IAAU58E,mBAAsBi0E,KACN0ob,IAIpC,SAAA7/Z,EAAej8F,EAAOb,OACfa,EAAAA,OAEGoqgB,EAAUv+R,WADV9vJ,IAAU58E,uCACiB88F,IAIrC,SAAAu+L,EAAax6R,EAAOb,OACba,EAAAA,OAEGoqgB,EAAU/4Z,UADVt1B,IAAU58E,kCACgBq7R,IAIpC,SAAAooO,EAAgB5igB,EAAOb,OAChBa,EAAAA,OAEGoqgB,EAAU/4Z,UADVt1B,IAAU58E,qCACgByjgB,IAIpC,SAAApG,EAAiBx8f,OACVA,EAAAA,OAEGoqgB,EAAUv+R,WADJ,yBACqB2wR,IAIrC,MAAAqJ,UAA8Bzga,MAC5B6T,YAAY/hC,GACV26C,QAEAvlB,KAAKntG,KAAO,kBACZmtG,KAAKrmB,QAAU,2BACfqmB,KAAKp1B,OAASA,EAAOy1N,UAEjBvnM,MAAMqsJ,mBACRrsJ,MAAMqsJ,kBAAkBnlJ,KAAMu5Z,IAIpC,SAAA9zQ,EAAmB/zI,UACVvrC,OAAOkgT,cAAc30Q,GAG9B,SAAAg+Y,EAAeh+Y,UACN+zI,EAAU/zI,IACVA,IAAQ,UACRA,GAAO,SAUhB,SAAAshS,EAAiB5yQ,MACH,MAARA,EAAQ,OACH,MAEW,iBAATA,EAAS,OACXA,SAEDA,OACD,aACI,MACJ,aACI,MACJ,aACI,OACJ,aACI,UAGJ,EAOT,SAAAkwX,EAAmB7rS,MACb7+I,KAAKovN,MAAAA,OACA,GAAKpvN,KAAKovN,MAAMvwE,OAErB1lE,EAAI0lE,EACJz2G,EAAI,SAEJ+wC,GAAK,OACP/wC,GAAK,GACL+wC,KAAO,IAGLA,GAAK,KACP/wC,GAAK,EACL+wC,KAAO,GAGLA,GAAK,IACP/wC,GAAK,EACL+wC,KAAO,GAGLA,GAAK,IACP/wC,GAAK,EACL+wC,KAAO,GAGF/wC,EAAI+wC,EAGb,SAAAo2I,EAAkB1wE,MAEN,IAANA,EAAM,OACD,OAEL1lE,EAAI0lE,EACJz2G,EAAI,SAEa,IAAZ,KAAJ+wC,KACH/wC,GAAK,GACL+wC,KAAO,IAGU,IAAV,IAAJA,KACH/wC,GAAK,EACL+wC,KAAO,GAGS,IAAT,GAAJA,KACH/wC,GAAK,EACL+wC,KAAO,GAGS,IAAT,EAAJA,KACH/wC,GAAK,EACL+wC,KAAO,GAGS,IAAT,EAAJA,KACH/wC,GAAK,GAEAA,EAGT,SAAA4qZ,EAAkBpja,EAAKxgB,EAAOhQ,SACtBo+B,EAAMx9B,KAAKq0B,IAAIzE,EAAIvwB,OAAQD,OAE7BgpC,EAAI,EACJu3G,EAAI,UAECp+I,EAAI6N,EAAO7N,EAAIi8B,EAAKj8B,IAAAA,OACrBsF,EAAI+oB,EAAIvd,WAAW9Q,GAAK,OAI1BmS,EAFJ00B,IAAM,EAMJ10B,EAFE7M,GAAK,IAAMA,GAAK,GAEdA,EAAI,GAAK,GACJA,GAAK,IAAMA,GAAK,GAErBA,EAAI,GAAK,GAGTA,EAGNuhC,GAAK10B,EACLisI,GAAKjsI,MAGHisI,GAAAA,EAAK,MAAA,IACGzsH,MAAM,0BAEXkV,EAGT,SAAAqlL,EAAmB79L,EAAKxgB,EAAOhQ,EAAK4qN,SAC5BxsL,EAAMx9B,KAAKq0B,IAAIzE,EAAIvwB,OAAQD,OAE7BgpC,EAAI,UAEC7mC,EAAI6N,EAAO7N,EAAIi8B,EAAKj8B,IAAAA,OACrBsF,EAAI+oB,EAAIvd,WAAW9Q,GAAK,OAI1BmS,KAFJ00B,GAAK4hL,EAMHt2M,EAFE7M,GAAK,GAEHA,EAAI,GAAK,GACJA,GAAK,GAEVA,EAAI,GAAK,GAGTA,EAGFA,EAAI,GAAKA,EAAI,KAAO6M,GAAKs2M,EAAAA,MAAAA,IACjB92L,MAAM,mBAElBkV,GAAK10B,SAGA00B,EA4DT,SAAAmsZ,EAAcvsZ,EAAG35G,EAAGirF,WACT/X,EAAI,EAAGA,EAAIlzE,EAAGkzE,IACrBymC,EAAKA,EAAIA,EAAK1uB,SACT0uB,EAOT,SAAAwmL,EAAoB90L,EAAMoS,EAAKqvB,SACvB39B,EAAM9D,EAAKr6B,OAASysC,EAAIzsC,OAE9B87D,EAAIgyJ,SAAWzzL,EAAKyzL,SAAWrhL,EAAIqhL,SACnChyJ,EAAIwuX,OAAOnsZ,GACX29B,EAAI97D,OAASm+B,QAMP4K,EAFI1O,EAAK0zL,MAAM,GACXthL,EAAIshL,MAAM,GAEd1vC,EAAS,SAAJt1I,MAEP6vH,EAAS7vH,EAAI,SAAa,EAC1B35G,EAAI,MAER0sI,EAAIiyJ,MAAM,GAAK1vC,EAERjvP,EAAI0sI,EAAI97D,OAAS,EAAG5wE,IAAAA,KAKrBggS,EAASx2D,IAAU,GACnBy2D,EAAgB,SAARz2D,QAEN5jI,EAAMr0B,KAAKD,IAAI,EAAGtxE,EAAIirG,EAAKr6B,OAAS,GACpCU,EAAMC,KAAKq0B,IAAI5lG,EAAGq9G,EAAIzsC,OAAS,WAE5BqsB,EAAI2I,EAAK3I,GAAK3rB,EAAK2rB,IAAAA,OACpBnqB,EAAI9yE,EAAIi9F,EAGR0c,EAFI1O,EAAK0zL,MAAM7rN,GACXuqC,EAAIshL,MAAM1hM,GACFgjM,EAElBD,GAAWrmL,EAAI,SAAa,EAC5BsmL,EAAY,SAAJtmL,EAGV+yB,EAAIiyJ,MAAM3+R,GAAa,EAARigS,EACfz2D,EAAiB,EAATw2D,SAGI,IAAVx2D,EACF98F,EAAIiyJ,MAAM3+R,GAAa,EAARwpO,EAEf98F,EAAI97D,QAAU,EAET87D,EAAIuhK,SAGb,SAAAtH,EAAkB17L,EAAMoS,EAAKqvB,SACrB39B,EAAM9D,EAAKr6B,OAASysC,EAAIzsC,OAE9B87D,EAAIgyJ,SAAWzzL,EAAKyzL,SAAWrhL,EAAIqhL,SACnChyJ,EAAIwuX,OAAOnsZ,GACX29B,EAAI97D,OAASm+B,MAETy6H,EAAQ,EACRk9D,EAAU,EACV1mS,EAAI,OAEDA,EAAI0sI,EAAI97D,OAAS,EAAG5wE,IAAAA,KAKrBggS,EAAS0G,EAEbA,EAAU,MAENzG,EAAgB,SAARz2D,QAEN5jI,EAAMr0B,KAAKD,IAAI,EAAGtxE,EAAIirG,EAAKr6B,OAAS,GACpCU,EAAMC,KAAKq0B,IAAI5lG,EAAGq9G,EAAIzsC,OAAS,WAE5BqsB,EAAI2I,EAAK3I,GAAK3rB,EAAK2rB,IAAAA,OACpBnqB,EAAI9yE,EAAIi9F,EAGR0c,EAFI1O,EAAK0zL,MAAM7rN,GACXuqC,EAAIshL,MAAM1hM,OAGhBgyJ,EAAS,SAAJt1I,EAETqmL,EAAUA,GAAWrmL,EAAI,SAAa,GAAM,EAC5Cs1I,EAAMA,EAAKgxC,EAAS,EACpBA,EAAa,SAALhxC,EACR+wC,EAAUA,GAAU/wC,IAAO,IAAO,EAElCy3C,GAAW1G,IAAW,GACtBA,GAAU,SAGZtzJ,EAAIiyJ,MAAM3+R,GAAKigS,EACfz2D,EAAQw2D,EACRA,EAAS0G,SAGG,IAAVl9D,EACF98F,EAAIiyJ,MAAM3+R,GAAKwpO,EAEf98F,EAAI97D,QAAU,EAET87D,EAAIuhK,SAmCb,SAAA3L,EAAqBr3L,EAAMoS,EAAKqvB,SACxBl6D,EAAIy4B,EAAK0zL,MACT15M,EAAIo4B,EAAIshL,MACR9iH,EAAInvC,EAAIiyJ,MACR4D,EAAY,EAAP/vN,EAAE,GACPgwN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlwN,EAAE,GACPmwN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbjzB,EAAY,EAAPj9L,EAAE,GACPqwN,EAAW,KAALpzB,EACNqzB,EAAMrzB,IAAO,GACbszB,EAAY,EAAPvwN,EAAE,GACPwwN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1wN,EAAE,GACP2wN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7wN,EAAE,GACP8wN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhxN,EAAE,GACPixN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnxN,EAAE,GACPoxN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtxN,EAAE,GACPuxN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzxN,EAAE,GACP0xN,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbzP,EAAY,EAAPvvM,EAAE,GACPm/M,EAAW,KAAL5P,EACN6P,EAAM7P,IAAO,GACbp6B,EAAY,EAAPn1K,EAAE,GACPq/M,EAAW,KAALlqC,EACNmqC,EAAMnqC,IAAO,GACbJ,EAAY,EAAP/0K,EAAE,GACPu/M,EAAW,KAALxqC,EACNyqC,EAAMzqC,IAAO,GACby6B,EAAY,EAAPxvM,EAAE,GACPy/M,EAAW,KAALjQ,EACNkQ,EAAMlQ,IAAO,GACbC,EAAY,EAAPzvM,EAAE,GACP2/M,EAAW,KAALlQ,EACNmQ,EAAMnQ,IAAO,GACbC,EAAY,EAAP1vM,EAAE,GACP6/M,EAAW,KAALnQ,EACNoQ,EAAMpQ,IAAO,GACbC,GAAY,EAAP3vM,EAAE,GACP+/M,GAAW,KAALpQ,GACNqQ,GAAMrQ,KAAO,GACbC,GAAY,EAAP5vM,EAAE,GACPigN,GAAW,KAALrQ,GACNsQ,GAAMtQ,KAAO,GACbC,GAAY,EAAP7vM,EAAE,GACPmgN,GAAW,KAALtQ,GACNuQ,GAAMvQ,KAAO,GACbC,GAAY,EAAP9vM,EAAE,GACPqgN,GAAW,KAALvQ,GACNwQ,GAAMxQ,KAAO,OAGf9lC,GAAI91I,GAAK61I,GADT52K,GAAI,EAGRs0D,EAAIgyJ,SAAWzzL,EAAKyzL,SAAWrhL,EAAIqhL,SACnChyJ,EAAIwuX,OAAO,IACXxuX,EAAI97D,OAAS,GAGbq+K,GAAK19K,KAAK2pN,KAAKsH,EAAK4B,GACpBjrL,GAAM5nC,KAAK2pN,KAAKsH,EAAK6B,GACrBlrL,GAAOA,GAAM5nC,KAAK2pN,KAAKuH,EAAK2B,GAAQ,EACpCp1C,GAAKz9K,KAAK2pN,KAAKuH,EAAK4B,OAEhBmB,IAAQptN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACrD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAMqsL,KAAO,IAAO,EAChDA,IAAM,SAGNv2C,GAAK19K,KAAK2pN,KAAKyH,EAAKyB,GACpBjrL,GAAM5nC,KAAK2pN,KAAKyH,EAAK0B,GACrBlrL,GAAOA,GAAM5nC,KAAK2pN,KAAK0H,EAAKwB,GAAQ,EACpCp1C,GAAKz9K,KAAK2pN,KAAK0H,EAAKyB,GACpBp1C,GAAMA,GAAK19K,KAAK2pN,KAAKsH,EAAK8B,GAAQ,EAClCnrL,GAAOA,GAAM5nC,KAAK2pN,KAAKsH,EAAK+B,GAAQ,EACpCprL,GAAOA,GAAM5nC,KAAK2pN,KAAKuH,EAAK6B,GAAQ,EACpCt1C,GAAMA,GAAKz9K,KAAK2pN,KAAKuH,EAAK8B,GAAQ,MAE9BkB,IAAQrtN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACrD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAMssL,KAAO,IAAO,EAChDA,IAAM,SAGNx2C,GAAK19K,KAAK2pN,KAAK2H,EAAKuB,GACpBjrL,GAAM5nC,KAAK2pN,KAAK2H,EAAKwB,GACrBlrL,GAAOA,GAAM5nC,KAAK2pN,KAAK4H,EAAKsB,GAAQ,EACpCp1C,GAAKz9K,KAAK2pN,KAAK4H,EAAKuB,GACpBp1C,GAAMA,GAAK19K,KAAK2pN,KAAKyH,EAAK2B,GAAQ,EAClCnrL,GAAOA,GAAM5nC,KAAK2pN,KAAKyH,EAAK4B,GAAQ,EACpCprL,GAAOA,GAAM5nC,KAAK2pN,KAAK0H,EAAK0B,GAAQ,EACpCt1C,GAAMA,GAAKz9K,KAAK2pN,KAAK0H,EAAK2B,GAAQ,EAClCt1C,GAAMA,GAAK19K,KAAK2pN,KAAKsH,EAAKgC,GAAQ,EAClCrrL,GAAOA,GAAM5nC,KAAK2pN,KAAKsH,EAAKiC,GAAQ,EACpCtrL,GAAOA,GAAM5nC,KAAK2pN,KAAKuH,EAAK+B,GAAQ,EACpCx1C,GAAMA,GAAKz9K,KAAK2pN,KAAKuH,EAAKgC,GAAQ,MAE9B3V,IAAQ12M,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACrD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAM21K,KAAO,IAAO,EAChDA,IAAM,SAGN7/B,GAAK19K,KAAK2pN,KAAK8H,EAAKoB,GACpBjrL,GAAM5nC,KAAK2pN,KAAK8H,EAAKqB,GACrBlrL,GAAOA,GAAM5nC,KAAK2pN,KAAK+H,EAAKmB,GAAQ,EACpCp1C,GAAKz9K,KAAK2pN,KAAK+H,EAAKoB,GACpBp1C,GAAMA,GAAK19K,KAAK2pN,KAAK2H,EAAKyB,GAAQ,EAClCnrL,GAAOA,GAAM5nC,KAAK2pN,KAAK2H,EAAK0B,GAAQ,EACpCprL,GAAOA,GAAM5nC,KAAK2pN,KAAK4H,EAAKwB,GAAQ,EACpCt1C,GAAMA,GAAKz9K,KAAK2pN,KAAK4H,EAAKyB,GAAQ,EAClCt1C,GAAMA,GAAK19K,KAAK2pN,KAAKyH,EAAK6B,GAAQ,EAClCrrL,GAAOA,GAAM5nC,KAAK2pN,KAAKyH,EAAK8B,GAAQ,EACpCtrL,GAAOA,GAAM5nC,KAAK2pN,KAAK0H,EAAK4B,GAAQ,EACpCx1C,GAAMA,GAAKz9K,KAAK2pN,KAAK0H,EAAK6B,GAAQ,EAClCx1C,GAAMA,GAAK19K,KAAK2pN,KAAKsH,EAAKkC,GAAQ,EAClCvrL,GAAOA,GAAM5nC,KAAK2pN,KAAKsH,EAAKmC,GAAQ,EACpCxrL,GAAOA,GAAM5nC,KAAK2pN,KAAKuH,EAAKiC,GAAQ,EACpC11C,GAAMA,GAAKz9K,KAAK2pN,KAAKuH,EAAKkC,GAAQ,MAE9Be,IAAQttN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACrD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAMusL,KAAO,IAAO,EAChDA,IAAM,SAGNz2C,GAAK19K,KAAK2pN,KAAKiI,EAAKiB,GACpBjrL,GAAM5nC,KAAK2pN,KAAKiI,EAAKkB,GACrBlrL,GAAOA,GAAM5nC,KAAK2pN,KAAKkI,EAAKgB,GAAQ,EACpCp1C,GAAKz9K,KAAK2pN,KAAKkI,EAAKiB,GACpBp1C,GAAMA,GAAK19K,KAAK2pN,KAAK8H,EAAKsB,GAAQ,EAClCnrL,GAAOA,GAAM5nC,KAAK2pN,KAAK8H,EAAKuB,GAAQ,EACpCprL,GAAOA,GAAM5nC,KAAK2pN,KAAK+H,EAAKqB,GAAQ,EACpCt1C,GAAMA,GAAKz9K,KAAK2pN,KAAK+H,EAAKsB,GAAQ,EAClCt1C,GAAMA,GAAK19K,KAAK2pN,KAAK2H,EAAK2B,GAAQ,EAClCrrL,GAAOA,GAAM5nC,KAAK2pN,KAAK2H,EAAK4B,GAAQ,EACpCtrL,GAAOA,GAAM5nC,KAAK2pN,KAAK4H,EAAK0B,GAAQ,EACpCx1C,GAAMA,GAAKz9K,KAAK2pN,KAAK4H,EAAK2B,GAAQ,EAClCx1C,GAAMA,GAAK19K,KAAK2pN,KAAKyH,EAAK+B,GAAQ,EAClCvrL,GAAOA,GAAM5nC,KAAK2pN,KAAKyH,EAAKgC,GAAQ,EACpCxrL,GAAOA,GAAM5nC,KAAK2pN,KAAK0H,EAAK8B,GAAQ,EACpC11C,GAAMA,GAAKz9K,KAAK2pN,KAAK0H,EAAK+B,GAAQ,EAClC11C,GAAMA,GAAK19K,KAAK2pN,KAAKsH,EAAKoC,GAAQ,EAClCzrL,GAAOA,GAAM5nC,KAAK2pN,KAAKsH,EAAKqC,GAAQ,EACpC1rL,GAAOA,GAAM5nC,KAAK2pN,KAAKuH,EAAKmC,GAAQ,EACpC51C,GAAMA,GAAKz9K,KAAK2pN,KAAKuH,EAAKoC,GAAQ,MAE9Bc,IAAQvtN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACrD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAMwsL,KAAO,IAAO,EAChDA,IAAM,SAGN12C,GAAK19K,KAAK2pN,KAAKoI,EAAKc,GACpBjrL,GAAM5nC,KAAK2pN,KAAKoI,EAAKe,GACrBlrL,GAAOA,GAAM5nC,KAAK2pN,KAAKqI,EAAKa,GAAQ,EACpCp1C,GAAKz9K,KAAK2pN,KAAKqI,EAAKc,GACpBp1C,GAAMA,GAAK19K,KAAK2pN,KAAKiI,EAAKmB,GAAQ,EAClCnrL,GAAOA,GAAM5nC,KAAK2pN,KAAKiI,EAAKoB,GAAQ,EACpCprL,GAAOA,GAAM5nC,KAAK2pN,KAAKkI,EAAKkB,GAAQ,EACpCt1C,GAAMA,GAAKz9K,KAAK2pN,KAAKkI,EAAKmB,GAAQ,EAClCt1C,GAAMA,GAAK19K,KAAK2pN,KAAK8H,EAAKwB,GAAQ,EAClCrrL,GAAOA,GAAM5nC,KAAK2pN,KAAK8H,EAAKyB,GAAQ,EACpCtrL,GAAOA,GAAM5nC,KAAK2pN,KAAK+H,EAAKuB,GAAQ,EACpCx1C,GAAMA,GAAKz9K,KAAK2pN,KAAK+H,EAAKwB,GAAQ,EAClCx1C,GAAMA,GAAK19K,KAAK2pN,KAAK2H,EAAK6B,GAAQ,EAClCvrL,GAAOA,GAAM5nC,KAAK2pN,KAAK2H,EAAK8B,GAAQ,EACpCxrL,GAAOA,GAAM5nC,KAAK2pN,KAAK4H,EAAK4B,GAAQ,EACpC11C,GAAMA,GAAKz9K,KAAK2pN,KAAK4H,EAAK6B,GAAQ,EAClC11C,GAAMA,GAAK19K,KAAK2pN,KAAKyH,EAAKiC,GAAQ,EAClCzrL,GAAOA,GAAM5nC,KAAK2pN,KAAKyH,EAAKkC,GAAQ,EACpC1rL,GAAOA,GAAM5nC,KAAK2pN,KAAK0H,EAAKgC,GAAQ,EACpC51C,GAAMA,GAAKz9K,KAAK2pN,KAAK0H,EAAKiC,GAAQ,EAClC51C,GAAMA,GAAK19K,KAAK2pN,KAAKsH,EAAKsC,GAAQ,EAClC3rL,GAAOA,GAAM5nC,KAAK2pN,KAAKsH,EAAKuC,GAAQ,EACpC5rL,GAAOA,GAAM5nC,KAAK2pN,KAAKuH,EAAKqC,GAAQ,EACpC91C,GAAMA,GAAKz9K,KAAK2pN,KAAKuH,EAAKsC,GAAQ,MAE9Ba,IAAQxtN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACrD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAMysL,KAAO,IAAO,EAChDA,IAAM,SAGN32C,GAAK19K,KAAK2pN,KAAKuI,EAAKW,GACpBjrL,GAAM5nC,KAAK2pN,KAAKuI,EAAKY,GACrBlrL,GAAOA,GAAM5nC,KAAK2pN,KAAKwI,EAAKU,GAAQ,EACpCp1C,GAAKz9K,KAAK2pN,KAAKwI,EAAKW,GACpBp1C,GAAMA,GAAK19K,KAAK2pN,KAAKoI,EAAKgB,GAAQ,EAClCnrL,GAAOA,GAAM5nC,KAAK2pN,KAAKoI,EAAKiB,GAAQ,EACpCprL,GAAOA,GAAM5nC,KAAK2pN,KAAKqI,EAAKe,GAAQ,EACpCt1C,GAAMA,GAAKz9K,KAAK2pN,KAAKqI,EAAKgB,GAAQ,EAClCt1C,GAAMA,GAAK19K,KAAK2pN,KAAKiI,EAAKqB,GAAQ,EAClCrrL,GAAOA,GAAM5nC,KAAK2pN,KAAKiI,EAAKsB,GAAQ,EACpCtrL,GAAOA,GAAM5nC,KAAK2pN,KAAKkI,EAAKoB,GAAQ,EACpCx1C,GAAMA,GAAKz9K,KAAK2pN,KAAKkI,EAAKqB,GAAQ,EAClCx1C,GAAMA,GAAK19K,KAAK2pN,KAAK8H,EAAK0B,GAAQ,EAClCvrL,GAAOA,GAAM5nC,KAAK2pN,KAAK8H,EAAK2B,GAAQ,EACpCxrL,GAAOA,GAAM5nC,KAAK2pN,KAAK+H,EAAKyB,GAAQ,EACpC11C,GAAMA,GAAKz9K,KAAK2pN,KAAK+H,EAAK0B,GAAQ,EAClC11C,GAAMA,GAAK19K,KAAK2pN,KAAK2H,EAAK+B,GAAQ,EAClCzrL,GAAOA,GAAM5nC,KAAK2pN,KAAK2H,EAAKgC,GAAQ,EACpC1rL,GAAOA,GAAM5nC,KAAK2pN,KAAK4H,EAAK8B,GAAQ,EACpC51C,GAAMA,GAAKz9K,KAAK2pN,KAAK4H,EAAK+B,GAAQ,EAClC51C,GAAMA,GAAK19K,KAAK2pN,KAAKyH,EAAKmC,GAAQ,EAClC3rL,GAAOA,GAAM5nC,KAAK2pN,KAAKyH,EAAKoC,GAAQ,EACpC5rL,GAAOA,GAAM5nC,KAAK2pN,KAAK0H,EAAKkC,GAAQ,EACpC91C,GAAMA,GAAKz9K,KAAK2pN,KAAK0H,EAAKmC,GAAQ,EAClC91C,GAAMA,GAAK19K,KAAK2pN,KAAKsH,EAAKwC,IAAQ,EAClC7rL,GAAOA,GAAM5nC,KAAK2pN,KAAKsH,EAAKyC,IAAQ,EACpC9rL,GAAOA,GAAM5nC,KAAK2pN,KAAKuH,EAAKuC,IAAQ,EACpCh2C,GAAMA,GAAKz9K,KAAK2pN,KAAKuH,EAAKwC,IAAQ,MAE9BY,IAAQztN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACrD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAM0sL,KAAO,IAAO,EAChDA,IAAM,SAGN52C,GAAK19K,KAAK2pN,KAAK0I,EAAKQ,GACpBjrL,GAAM5nC,KAAK2pN,KAAK0I,EAAKS,GACrBlrL,GAAOA,GAAM5nC,KAAK2pN,KAAK2I,EAAKO,GAAQ,EACpCp1C,GAAKz9K,KAAK2pN,KAAK2I,EAAKQ,GACpBp1C,GAAMA,GAAK19K,KAAK2pN,KAAKuI,EAAKa,GAAQ,EAClCnrL,GAAOA,GAAM5nC,KAAK2pN,KAAKuI,EAAKc,GAAQ,EACpCprL,GAAOA,GAAM5nC,KAAK2pN,KAAKwI,EAAKY,GAAQ,EACpCt1C,GAAMA,GAAKz9K,KAAK2pN,KAAKwI,EAAKa,GAAQ,EAClCt1C,GAAMA,GAAK19K,KAAK2pN,KAAKoI,EAAKkB,GAAQ,EAClCrrL,GAAOA,GAAM5nC,KAAK2pN,KAAKoI,EAAKmB,GAAQ,EACpCtrL,GAAOA,GAAM5nC,KAAK2pN,KAAKqI,EAAKiB,GAAQ,EACpCx1C,GAAMA,GAAKz9K,KAAK2pN,KAAKqI,EAAKkB,GAAQ,EAClCx1C,GAAMA,GAAK19K,KAAK2pN,KAAKiI,EAAKuB,GAAQ,EAClCvrL,GAAOA,GAAM5nC,KAAK2pN,KAAKiI,EAAKwB,GAAQ,EACpCxrL,GAAOA,GAAM5nC,KAAK2pN,KAAKkI,EAAKsB,GAAQ,EACpC11C,GAAMA,GAAKz9K,KAAK2pN,KAAKkI,EAAKuB,GAAQ,EAClC11C,GAAMA,GAAK19K,KAAK2pN,KAAK8H,EAAK4B,GAAQ,EAClCzrL,GAAOA,GAAM5nC,KAAK2pN,KAAK8H,EAAK6B,GAAQ,EACpC1rL,GAAOA,GAAM5nC,KAAK2pN,KAAK+H,EAAK2B,GAAQ,EACpC51C,GAAMA,GAAKz9K,KAAK2pN,KAAK+H,EAAK4B,GAAQ,EAClC51C,GAAMA,GAAK19K,KAAK2pN,KAAK2H,EAAKiC,GAAQ,EAClC3rL,GAAOA,GAAM5nC,KAAK2pN,KAAK2H,EAAKkC,GAAQ,EACpC5rL,GAAOA,GAAM5nC,KAAK2pN,KAAK4H,EAAKgC,GAAQ,EACpC91C,GAAMA,GAAKz9K,KAAK2pN,KAAK4H,EAAKiC,GAAQ,EAClC91C,GAAMA,GAAK19K,KAAK2pN,KAAKyH,EAAKqC,IAAQ,EAClC7rL,GAAOA,GAAM5nC,KAAK2pN,KAAKyH,EAAKsC,IAAQ,EACpC9rL,GAAOA,GAAM5nC,KAAK2pN,KAAK0H,EAAKoC,IAAQ,EACpCh2C,GAAMA,GAAKz9K,KAAK2pN,KAAK0H,EAAKqC,IAAQ,EAClCh2C,GAAMA,GAAK19K,KAAK2pN,KAAKsH,EAAK0C,IAAQ,EAClC/rL,GAAOA,GAAM5nC,KAAK2pN,KAAKsH,EAAK2C,IAAQ,EACpChsL,GAAOA,GAAM5nC,KAAK2pN,KAAKuH,EAAKyC,IAAQ,EACpCl2C,GAAMA,GAAKz9K,KAAK2pN,KAAKuH,EAAK0C,IAAQ,MAE9BpW,IAAQ32M,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACrD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAM41K,KAAO,IAAO,EAChDA,IAAM,SAGN9/B,GAAK19K,KAAK2pN,KAAK6I,EAAKK,GACpBjrL,GAAM5nC,KAAK2pN,KAAK6I,EAAKM,GACrBlrL,GAAOA,GAAM5nC,KAAK2pN,KAAK8I,EAAKI,GAAQ,EACpCp1C,GAAKz9K,KAAK2pN,KAAK8I,EAAKK,GACpBp1C,GAAMA,GAAK19K,KAAK2pN,KAAK0I,EAAKU,GAAQ,EAClCnrL,GAAOA,GAAM5nC,KAAK2pN,KAAK0I,EAAKW,GAAQ,EACpCprL,GAAOA,GAAM5nC,KAAK2pN,KAAK2I,EAAKS,GAAQ,EACpCt1C,GAAMA,GAAKz9K,KAAK2pN,KAAK2I,EAAKU,GAAQ,EAClCt1C,GAAMA,GAAK19K,KAAK2pN,KAAKuI,EAAKe,GAAQ,EAClCrrL,GAAOA,GAAM5nC,KAAK2pN,KAAKuI,EAAKgB,GAAQ,EACpCtrL,GAAOA,GAAM5nC,KAAK2pN,KAAKwI,EAAKc,GAAQ,EACpCx1C,GAAMA,GAAKz9K,KAAK2pN,KAAKwI,EAAKe,GAAQ,EAClCx1C,GAAMA,GAAK19K,KAAK2pN,KAAKoI,EAAKoB,GAAQ,EAClCvrL,GAAOA,GAAM5nC,KAAK2pN,KAAKoI,EAAKqB,GAAQ,EACpCxrL,GAAOA,GAAM5nC,KAAK2pN,KAAKqI,EAAKmB,GAAQ,EACpC11C,GAAMA,GAAKz9K,KAAK2pN,KAAKqI,EAAKoB,GAAQ,EAClC11C,GAAMA,GAAK19K,KAAK2pN,KAAKiI,EAAKyB,GAAQ,EAClCzrL,GAAOA,GAAM5nC,KAAK2pN,KAAKiI,EAAK0B,GAAQ,EACpC1rL,GAAOA,GAAM5nC,KAAK2pN,KAAKkI,EAAKwB,GAAQ,EACpC51C,GAAMA,GAAKz9K,KAAK2pN,KAAKkI,EAAKyB,GAAQ,EAClC51C,GAAMA,GAAK19K,KAAK2pN,KAAK8H,EAAK8B,GAAQ,EAClC3rL,GAAOA,GAAM5nC,KAAK2pN,KAAK8H,EAAK+B,GAAQ,EACpC5rL,GAAOA,GAAM5nC,KAAK2pN,KAAK+H,EAAK6B,GAAQ,EACpC91C,GAAMA,GAAKz9K,KAAK2pN,KAAK+H,EAAK8B,GAAQ,EAClC91C,GAAMA,GAAK19K,KAAK2pN,KAAK2H,EAAKmC,IAAQ,EAClC7rL,GAAOA,GAAM5nC,KAAK2pN,KAAK2H,EAAKoC,IAAQ,EACpC9rL,GAAOA,GAAM5nC,KAAK2pN,KAAK4H,EAAKkC,IAAQ,EACpCh2C,GAAMA,GAAKz9K,KAAK2pN,KAAK4H,EAAKmC,IAAQ,EAClCh2C,GAAMA,GAAK19K,KAAK2pN,KAAKyH,EAAKuC,IAAQ,EAClC/rL,GAAOA,GAAM5nC,KAAK2pN,KAAKyH,EAAKwC,IAAQ,EACpChsL,GAAOA,GAAM5nC,KAAK2pN,KAAK0H,EAAKsC,IAAQ,EACpCl2C,GAAMA,GAAKz9K,KAAK2pN,KAAK0H,EAAKuC,IAAQ,EAClCl2C,GAAMA,GAAK19K,KAAK2pN,KAAKsH,EAAK4C,IAAQ,EAClCjsL,GAAOA,GAAM5nC,KAAK2pN,KAAKsH,EAAK6C,IAAQ,EACpClsL,GAAOA,GAAM5nC,KAAK2pN,KAAKuH,EAAK2C,IAAQ,EACpCp2C,GAAMA,GAAKz9K,KAAK2pN,KAAKuH,EAAK4C,IAAQ,MAE9BS,IAAQ1tN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACrD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAM2sL,KAAO,IAAO,EAChDA,IAAM,SAGN72C,GAAK19K,KAAK2pN,KAAKgJ,EAAKE,GACpBjrL,GAAM5nC,KAAK2pN,KAAKgJ,EAAKG,GACrBlrL,GAAOA,GAAM5nC,KAAK2pN,KAAKiJ,EAAKC,GAAQ,EACpCp1C,GAAKz9K,KAAK2pN,KAAKiJ,EAAKE,GACpBp1C,GAAMA,GAAK19K,KAAK2pN,KAAK6I,EAAKO,GAAQ,EAClCnrL,GAAOA,GAAM5nC,KAAK2pN,KAAK6I,EAAKQ,GAAQ,EACpCprL,GAAOA,GAAM5nC,KAAK2pN,KAAK8I,EAAKM,GAAQ,EACpCt1C,GAAMA,GAAKz9K,KAAK2pN,KAAK8I,EAAKO,GAAQ,EAClCt1C,GAAMA,GAAK19K,KAAK2pN,KAAK0I,EAAKY,GAAQ,EAClCrrL,GAAOA,GAAM5nC,KAAK2pN,KAAK0I,EAAKa,GAAQ,EACpCtrL,GAAOA,GAAM5nC,KAAK2pN,KAAK2I,EAAKW,GAAQ,EACpCx1C,GAAMA,GAAKz9K,KAAK2pN,KAAK2I,EAAKY,GAAQ,EAClCx1C,GAAMA,GAAK19K,KAAK2pN,KAAKuI,EAAKiB,GAAQ,EAClCvrL,GAAOA,GAAM5nC,KAAK2pN,KAAKuI,EAAKkB,GAAQ,EACpCxrL,GAAOA,GAAM5nC,KAAK2pN,KAAKwI,EAAKgB,GAAQ,EACpC11C,GAAMA,GAAKz9K,KAAK2pN,KAAKwI,EAAKiB,GAAQ,EAClC11C,GAAMA,GAAK19K,KAAK2pN,KAAKoI,EAAKsB,GAAQ,EAClCzrL,GAAOA,GAAM5nC,KAAK2pN,KAAKoI,EAAKuB,GAAQ,EACpC1rL,GAAOA,GAAM5nC,KAAK2pN,KAAKqI,EAAKqB,GAAQ,EACpC51C,GAAMA,GAAKz9K,KAAK2pN,KAAKqI,EAAKsB,GAAQ,EAClC51C,GAAMA,GAAK19K,KAAK2pN,KAAKiI,EAAK2B,GAAQ,EAClC3rL,GAAOA,GAAM5nC,KAAK2pN,KAAKiI,EAAK4B,GAAQ,EACpC5rL,GAAOA,GAAM5nC,KAAK2pN,KAAKkI,EAAK0B,GAAQ,EACpC91C,GAAMA,GAAKz9K,KAAK2pN,KAAKkI,EAAK2B,GAAQ,EAClC91C,GAAMA,GAAK19K,KAAK2pN,KAAK8H,EAAKgC,IAAQ,EAClC7rL,GAAOA,GAAM5nC,KAAK2pN,KAAK8H,EAAKiC,IAAQ,EACpC9rL,GAAOA,GAAM5nC,KAAK2pN,KAAK+H,EAAK+B,IAAQ,EACpCh2C,GAAMA,GAAKz9K,KAAK2pN,KAAK+H,EAAKgC,IAAQ,EAClCh2C,GAAMA,GAAK19K,KAAK2pN,KAAK2H,EAAKqC,IAAQ,EAClC/rL,GAAOA,GAAM5nC,KAAK2pN,KAAK2H,EAAKsC,IAAQ,EACpChsL,GAAOA,GAAM5nC,KAAK2pN,KAAK4H,EAAKoC,IAAQ,EACpCl2C,GAAMA,GAAKz9K,KAAK2pN,KAAK4H,EAAKqC,IAAQ,EAClCl2C,GAAMA,GAAK19K,KAAK2pN,KAAKyH,EAAKyC,IAAQ,EAClCjsL,GAAOA,GAAM5nC,KAAK2pN,KAAKyH,EAAK0C,IAAQ,EACpClsL,GAAOA,GAAM5nC,KAAK2pN,KAAK0H,EAAKwC,IAAQ,EACpCp2C,GAAMA,GAAKz9K,KAAK2pN,KAAK0H,EAAKyC,IAAQ,EAClCp2C,GAAMA,GAAK19K,KAAK2pN,KAAKsH,EAAK8C,IAAQ,EAClCnsL,GAAOA,GAAM5nC,KAAK2pN,KAAKsH,EAAK+C,IAAQ,EACpCpsL,GAAOA,GAAM5nC,KAAK2pN,KAAKuH,EAAK6C,IAAQ,EACpCt2C,GAAMA,GAAKz9K,KAAK2pN,KAAKuH,EAAK8C,IAAQ,MAE9BQ,IAAQ3tN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACrD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAM4sL,KAAO,IAAO,EAChDA,IAAM,SAGN92C,GAAK19K,KAAK2pN,KAAKgJ,EAAKI,GACpBnrL,GAAM5nC,KAAK2pN,KAAKgJ,EAAKK,GACrBprL,GAAOA,GAAM5nC,KAAK2pN,KAAKiJ,EAAKG,GAAQ,EACpCt1C,GAAKz9K,KAAK2pN,KAAKiJ,EAAKI,GACpBt1C,GAAMA,GAAK19K,KAAK2pN,KAAK6I,EAAKS,GAAQ,EAClCrrL,GAAOA,GAAM5nC,KAAK2pN,KAAK6I,EAAKU,GAAQ,EACpCtrL,GAAOA,GAAM5nC,KAAK2pN,KAAK8I,EAAKQ,GAAQ,EACpCx1C,GAAMA,GAAKz9K,KAAK2pN,KAAK8I,EAAKS,GAAQ,EAClCx1C,GAAMA,GAAK19K,KAAK2pN,KAAK0I,EAAKc,GAAQ,EAClCvrL,GAAOA,GAAM5nC,KAAK2pN,KAAK0I,EAAKe,GAAQ,EACpCxrL,GAAOA,GAAM5nC,KAAK2pN,KAAK2I,EAAKa,GAAQ,EACpC11C,GAAMA,GAAKz9K,KAAK2pN,KAAK2I,EAAKc,GAAQ,EAClC11C,GAAMA,GAAK19K,KAAK2pN,KAAKuI,EAAKmB,GAAQ,EAClCzrL,GAAOA,GAAM5nC,KAAK2pN,KAAKuI,EAAKoB,GAAQ,EACpC1rL,GAAOA,GAAM5nC,KAAK2pN,KAAKwI,EAAKkB,GAAQ,EACpC51C,GAAMA,GAAKz9K,KAAK2pN,KAAKwI,EAAKmB,GAAQ,EAClC51C,GAAMA,GAAK19K,KAAK2pN,KAAKoI,EAAKwB,GAAQ,EAClC3rL,GAAOA,GAAM5nC,KAAK2pN,KAAKoI,EAAKyB,GAAQ,EACpC5rL,GAAOA,GAAM5nC,KAAK2pN,KAAKqI,EAAKuB,GAAQ,EACpC91C,GAAMA,GAAKz9K,KAAK2pN,KAAKqI,EAAKwB,GAAQ,EAClC91C,GAAMA,GAAK19K,KAAK2pN,KAAKiI,EAAK6B,IAAQ,EAClC7rL,GAAOA,GAAM5nC,KAAK2pN,KAAKiI,EAAK8B,IAAQ,EACpC9rL,GAAOA,GAAM5nC,KAAK2pN,KAAKkI,EAAK4B,IAAQ,EACpCh2C,GAAMA,GAAKz9K,KAAK2pN,KAAKkI,EAAK6B,IAAQ,EAClCh2C,GAAMA,GAAK19K,KAAK2pN,KAAK8H,EAAKkC,IAAQ,EAClC/rL,GAAOA,GAAM5nC,KAAK2pN,KAAK8H,EAAKmC,IAAQ,EACpChsL,GAAOA,GAAM5nC,KAAK2pN,KAAK+H,EAAKiC,IAAQ,EACpCl2C,GAAMA,GAAKz9K,KAAK2pN,KAAK+H,EAAKkC,IAAQ,EAClCl2C,GAAMA,GAAK19K,KAAK2pN,KAAK2H,EAAKuC,IAAQ,EAClCjsL,GAAOA,GAAM5nC,KAAK2pN,KAAK2H,EAAKwC,IAAQ,EACpClsL,GAAOA,GAAM5nC,KAAK2pN,KAAK4H,EAAKsC,IAAQ,EACpCp2C,GAAMA,GAAKz9K,KAAK2pN,KAAK4H,EAAKuC,IAAQ,EAClCp2C,GAAMA,GAAK19K,KAAK2pN,KAAKyH,EAAK2C,IAAQ,EAClCnsL,GAAOA,GAAM5nC,KAAK2pN,KAAKyH,EAAK4C,IAAQ,EACpCpsL,GAAOA,GAAM5nC,KAAK2pN,KAAK0H,EAAK0C,IAAQ,EACpCt2C,GAAMA,GAAKz9K,KAAK2pN,KAAK0H,EAAK2C,IAAQ,MAE9BS,IAAS5tN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACtD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAM6sL,KAAQ,IAAO,EACjDA,IAAO,SAGP/2C,GAAK19K,KAAK2pN,KAAKgJ,EAAKM,GACpBrrL,GAAM5nC,KAAK2pN,KAAKgJ,EAAKO,GACrBtrL,GAAOA,GAAM5nC,KAAK2pN,KAAKiJ,EAAKK,GAAQ,EACpCx1C,GAAKz9K,KAAK2pN,KAAKiJ,EAAKM,GACpBx1C,GAAMA,GAAK19K,KAAK2pN,KAAK6I,EAAKW,GAAQ,EAClCvrL,GAAOA,GAAM5nC,KAAK2pN,KAAK6I,EAAKY,GAAQ,EACpCxrL,GAAOA,GAAM5nC,KAAK2pN,KAAK8I,EAAKU,GAAQ,EACpC11C,GAAMA,GAAKz9K,KAAK2pN,KAAK8I,EAAKW,GAAQ,EAClC11C,GAAMA,GAAK19K,KAAK2pN,KAAK0I,EAAKgB,GAAQ,EAClCzrL,GAAOA,GAAM5nC,KAAK2pN,KAAK0I,EAAKiB,GAAQ,EACpC1rL,GAAOA,GAAM5nC,KAAK2pN,KAAK2I,EAAKe,GAAQ,EACpC51C,GAAMA,GAAKz9K,KAAK2pN,KAAK2I,EAAKgB,GAAQ,EAClC51C,GAAMA,GAAK19K,KAAK2pN,KAAKuI,EAAKqB,GAAQ,EAClC3rL,GAAOA,GAAM5nC,KAAK2pN,KAAKuI,EAAKsB,GAAQ,EACpC5rL,GAAOA,GAAM5nC,KAAK2pN,KAAKwI,EAAKoB,GAAQ,EACpC91C,GAAMA,GAAKz9K,KAAK2pN,KAAKwI,EAAKqB,GAAQ,EAClC91C,GAAMA,GAAK19K,KAAK2pN,KAAKoI,EAAK0B,IAAQ,EAClC7rL,GAAOA,GAAM5nC,KAAK2pN,KAAKoI,EAAK2B,IAAQ,EACpC9rL,GAAOA,GAAM5nC,KAAK2pN,KAAKqI,EAAKyB,IAAQ,EACpCh2C,GAAMA,GAAKz9K,KAAK2pN,KAAKqI,EAAK0B,IAAQ,EAClCh2C,GAAMA,GAAK19K,KAAK2pN,KAAKiI,EAAK+B,IAAQ,EAClC/rL,GAAOA,GAAM5nC,KAAK2pN,KAAKiI,EAAKgC,IAAQ,EACpChsL,GAAOA,GAAM5nC,KAAK2pN,KAAKkI,EAAK8B,IAAQ,EACpCl2C,GAAMA,GAAKz9K,KAAK2pN,KAAKkI,EAAK+B,IAAQ,EAClCl2C,GAAMA,GAAK19K,KAAK2pN,KAAK8H,EAAKoC,IAAQ,EAClCjsL,GAAOA,GAAM5nC,KAAK2pN,KAAK8H,EAAKqC,IAAQ,EACpClsL,GAAOA,GAAM5nC,KAAK2pN,KAAK+H,EAAKmC,IAAQ,EACpCp2C,GAAMA,GAAKz9K,KAAK2pN,KAAK+H,EAAKoC,IAAQ,EAClCp2C,GAAMA,GAAK19K,KAAK2pN,KAAK2H,EAAKyC,IAAQ,EAClCnsL,GAAOA,GAAM5nC,KAAK2pN,KAAK2H,EAAK0C,IAAQ,EACpCpsL,GAAOA,GAAM5nC,KAAK2pN,KAAK4H,EAAKwC,IAAQ,EACpCt2C,GAAMA,GAAKz9K,KAAK2pN,KAAK4H,EAAKyC,IAAQ,MAE9BU,IAAS7tN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACtD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAM8sL,KAAQ,IAAO,EACjDA,IAAO,SAGPh3C,GAAK19K,KAAK2pN,KAAKgJ,EAAKQ,GACpBvrL,GAAM5nC,KAAK2pN,KAAKgJ,EAAKS,GACrBxrL,GAAOA,GAAM5nC,KAAK2pN,KAAKiJ,EAAKO,GAAQ,EACpC11C,GAAKz9K,KAAK2pN,KAAKiJ,EAAKQ,GACpB11C,GAAMA,GAAK19K,KAAK2pN,KAAK6I,EAAKa,GAAQ,EAClCzrL,GAAOA,GAAM5nC,KAAK2pN,KAAK6I,EAAKc,GAAQ,EACpC1rL,GAAOA,GAAM5nC,KAAK2pN,KAAK8I,EAAKY,GAAQ,EACpC51C,GAAMA,GAAKz9K,KAAK2pN,KAAK8I,EAAKa,GAAQ,EAClC51C,GAAMA,GAAK19K,KAAK2pN,KAAK0I,EAAKkB,GAAQ,EAClC3rL,GAAOA,GAAM5nC,KAAK2pN,KAAK0I,EAAKmB,GAAQ,EACpC5rL,GAAOA,GAAM5nC,KAAK2pN,KAAK2I,EAAKiB,GAAQ,EACpC91C,GAAMA,GAAKz9K,KAAK2pN,KAAK2I,EAAKkB,GAAQ,EAClC91C,GAAMA,GAAK19K,KAAK2pN,KAAKuI,EAAKuB,IAAQ,EAClC7rL,GAAOA,GAAM5nC,KAAK2pN,KAAKuI,EAAKwB,IAAQ,EACpC9rL,GAAOA,GAAM5nC,KAAK2pN,KAAKwI,EAAKsB,IAAQ,EACpCh2C,GAAMA,GAAKz9K,KAAK2pN,KAAKwI,EAAKuB,IAAQ,EAClCh2C,GAAMA,GAAK19K,KAAK2pN,KAAKoI,EAAK4B,IAAQ,EAClC/rL,GAAOA,GAAM5nC,KAAK2pN,KAAKoI,EAAK6B,IAAQ,EACpChsL,GAAOA,GAAM5nC,KAAK2pN,KAAKqI,EAAK2B,IAAQ,EACpCl2C,GAAMA,GAAKz9K,KAAK2pN,KAAKqI,EAAK4B,IAAQ,EAClCl2C,GAAMA,GAAK19K,KAAK2pN,KAAKiI,EAAKiC,IAAQ,EAClCjsL,GAAOA,GAAM5nC,KAAK2pN,KAAKiI,EAAKkC,IAAQ,EACpClsL,GAAOA,GAAM5nC,KAAK2pN,KAAKkI,EAAKgC,IAAQ,EACpCp2C,GAAMA,GAAKz9K,KAAK2pN,KAAKkI,EAAKiC,IAAQ,EAClCp2C,GAAMA,GAAK19K,KAAK2pN,KAAK8H,EAAKsC,IAAQ,EAClCnsL,GAAOA,GAAM5nC,KAAK2pN,KAAK8H,EAAKuC,IAAQ,EACpCpsL,GAAOA,GAAM5nC,KAAK2pN,KAAK+H,EAAKqC,IAAQ,EACpCt2C,GAAMA,GAAKz9K,KAAK2pN,KAAK+H,EAAKsC,IAAQ,MAE9BW,IAAS9tN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACtD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAM+sL,KAAQ,IAAO,EACjDA,IAAO,SAGPj3C,GAAK19K,KAAK2pN,KAAKgJ,EAAKU,GACpBzrL,GAAM5nC,KAAK2pN,KAAKgJ,EAAKW,GACrB1rL,GAAOA,GAAM5nC,KAAK2pN,KAAKiJ,EAAKS,GAAQ,EACpC51C,GAAKz9K,KAAK2pN,KAAKiJ,EAAKU,GACpB51C,GAAMA,GAAK19K,KAAK2pN,KAAK6I,EAAKe,GAAQ,EAClC3rL,GAAOA,GAAM5nC,KAAK2pN,KAAK6I,EAAKgB,GAAQ,EACpC5rL,GAAOA,GAAM5nC,KAAK2pN,KAAK8I,EAAKc,GAAQ,EACpC91C,GAAMA,GAAKz9K,KAAK2pN,KAAK8I,EAAKe,GAAQ,EAClC91C,GAAMA,GAAK19K,KAAK2pN,KAAK0I,EAAKoB,IAAQ,EAClC7rL,GAAOA,GAAM5nC,KAAK2pN,KAAK0I,EAAKqB,IAAQ,EACpC9rL,GAAOA,GAAM5nC,KAAK2pN,KAAK2I,EAAKmB,IAAQ,EACpCh2C,GAAMA,GAAKz9K,KAAK2pN,KAAK2I,EAAKoB,IAAQ,EAClCh2C,GAAMA,GAAK19K,KAAK2pN,KAAKuI,EAAKyB,IAAQ,EAClC/rL,GAAOA,GAAM5nC,KAAK2pN,KAAKuI,EAAK0B,IAAQ,EACpChsL,GAAOA,GAAM5nC,KAAK2pN,KAAKwI,EAAKwB,IAAQ,EACpCl2C,GAAMA,GAAKz9K,KAAK2pN,KAAKwI,EAAKyB,IAAQ,EAClCl2C,GAAMA,GAAK19K,KAAK2pN,KAAKoI,EAAK8B,IAAQ,EAClCjsL,GAAOA,GAAM5nC,KAAK2pN,KAAKoI,EAAK+B,IAAQ,EACpClsL,GAAOA,GAAM5nC,KAAK2pN,KAAKqI,EAAK6B,IAAQ,EACpCp2C,GAAMA,GAAKz9K,KAAK2pN,KAAKqI,EAAK8B,IAAQ,EAClCp2C,GAAMA,GAAK19K,KAAK2pN,KAAKiI,EAAKmC,IAAQ,EAClCnsL,GAAOA,GAAM5nC,KAAK2pN,KAAKiI,EAAKoC,IAAQ,EACpCpsL,GAAOA,GAAM5nC,KAAK2pN,KAAKkI,EAAKkC,IAAQ,EACpCt2C,GAAMA,GAAKz9K,KAAK2pN,KAAKkI,EAAKmC,IAAQ,MAE9BY,IAAS/tN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACtD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAMgtL,KAAQ,IAAO,EACjDA,IAAO,SAGPl3C,GAAK19K,KAAK2pN,KAAKgJ,EAAKY,GACpB3rL,GAAM5nC,KAAK2pN,KAAKgJ,EAAKa,GACrB5rL,GAAOA,GAAM5nC,KAAK2pN,KAAKiJ,EAAKW,GAAQ,EACpC91C,GAAKz9K,KAAK2pN,KAAKiJ,EAAKY,GACpB91C,GAAMA,GAAK19K,KAAK2pN,KAAK6I,EAAKiB,IAAQ,EAClC7rL,GAAOA,GAAM5nC,KAAK2pN,KAAK6I,EAAKkB,IAAQ,EACpC9rL,GAAOA,GAAM5nC,KAAK2pN,KAAK8I,EAAKgB,IAAQ,EACpCh2C,GAAMA,GAAKz9K,KAAK2pN,KAAK8I,EAAKiB,IAAQ,EAClCh2C,GAAMA,GAAK19K,KAAK2pN,KAAK0I,EAAKsB,IAAQ,EAClC/rL,GAAOA,GAAM5nC,KAAK2pN,KAAK0I,EAAKuB,IAAQ,EACpChsL,GAAOA,GAAM5nC,KAAK2pN,KAAK2I,EAAKqB,IAAQ,EACpCl2C,GAAMA,GAAKz9K,KAAK2pN,KAAK2I,EAAKsB,IAAQ,EAClCl2C,GAAMA,GAAK19K,KAAK2pN,KAAKuI,EAAK2B,IAAQ,EAClCjsL,GAAOA,GAAM5nC,KAAK2pN,KAAKuI,EAAK4B,IAAQ,EACpClsL,GAAOA,GAAM5nC,KAAK2pN,KAAKwI,EAAK0B,IAAQ,EACpCp2C,GAAMA,GAAKz9K,KAAK2pN,KAAKwI,EAAK2B,IAAQ,EAClCp2C,GAAMA,GAAK19K,KAAK2pN,KAAKoI,EAAKgC,IAAQ,EAClCnsL,GAAOA,GAAM5nC,KAAK2pN,KAAKoI,EAAKiC,IAAQ,EACpCpsL,GAAOA,GAAM5nC,KAAK2pN,KAAKqI,EAAK+B,IAAQ,EACpCt2C,GAAMA,GAAKz9K,KAAK2pN,KAAKqI,EAAKgC,IAAQ,MAE9Ba,IAAShuN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACtD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAMitL,KAAQ,IAAO,EACjDA,IAAO,SAGPn3C,GAAK19K,KAAK2pN,KAAKgJ,EAAKc,IACpB7rL,GAAM5nC,KAAK2pN,KAAKgJ,EAAKe,IACrB9rL,GAAOA,GAAM5nC,KAAK2pN,KAAKiJ,EAAKa,IAAQ,EACpCh2C,GAAKz9K,KAAK2pN,KAAKiJ,EAAKc,IACpBh2C,GAAMA,GAAK19K,KAAK2pN,KAAK6I,EAAKmB,IAAQ,EAClC/rL,GAAOA,GAAM5nC,KAAK2pN,KAAK6I,EAAKoB,IAAQ,EACpChsL,GAAOA,GAAM5nC,KAAK2pN,KAAK8I,EAAKkB,IAAQ,EACpCl2C,GAAMA,GAAKz9K,KAAK2pN,KAAK8I,EAAKmB,IAAQ,EAClCl2C,GAAMA,GAAK19K,KAAK2pN,KAAK0I,EAAKwB,IAAQ,EAClCjsL,GAAOA,GAAM5nC,KAAK2pN,KAAK0I,EAAKyB,IAAQ,EACpClsL,GAAOA,GAAM5nC,KAAK2pN,KAAK2I,EAAKuB,IAAQ,EACpCp2C,GAAMA,GAAKz9K,KAAK2pN,KAAK2I,EAAKwB,IAAQ,EAClCp2C,GAAMA,GAAK19K,KAAK2pN,KAAKuI,EAAK6B,IAAQ,EAClCnsL,GAAOA,GAAM5nC,KAAK2pN,KAAKuI,EAAK8B,IAAQ,EACpCpsL,GAAOA,GAAM5nC,KAAK2pN,KAAKwI,EAAK4B,IAAQ,EACpCt2C,GAAMA,GAAKz9K,KAAK2pN,KAAKwI,EAAK6B,IAAQ,MAE9BvW,IAAS52M,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACtD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAM61K,KAAQ,IAAO,EACjDA,IAAO,SAGP//B,GAAK19K,KAAK2pN,KAAKgJ,EAAKgB,IACpB/rL,GAAM5nC,KAAK2pN,KAAKgJ,EAAKiB,IACrBhsL,GAAOA,GAAM5nC,KAAK2pN,KAAKiJ,EAAKe,IAAQ,EACpCl2C,GAAKz9K,KAAK2pN,KAAKiJ,EAAKgB,IACpBl2C,GAAMA,GAAK19K,KAAK2pN,KAAK6I,EAAKqB,IAAQ,EAClCjsL,GAAOA,GAAM5nC,KAAK2pN,KAAK6I,EAAKsB,IAAQ,EACpClsL,GAAOA,GAAM5nC,KAAK2pN,KAAK8I,EAAKoB,IAAQ,EACpCp2C,GAAMA,GAAKz9K,KAAK2pN,KAAK8I,EAAKqB,IAAQ,EAClCp2C,GAAMA,GAAK19K,KAAK2pN,KAAK0I,EAAK0B,IAAQ,EAClCnsL,GAAOA,GAAM5nC,KAAK2pN,KAAK0I,EAAK2B,IAAQ,EACpCpsL,GAAOA,GAAM5nC,KAAK2pN,KAAK2I,EAAKyB,IAAQ,EACpCt2C,GAAMA,GAAKz9K,KAAK2pN,KAAK2I,EAAK0B,IAAQ,MAE9BtW,IAAS72M,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACtD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAM81K,KAAQ,IAAO,EACjDA,IAAO,SAGPhgC,GAAK19K,KAAK2pN,KAAKgJ,EAAKkB,IACpBjsL,GAAM5nC,KAAK2pN,KAAKgJ,EAAKmB,IACrBlsL,GAAOA,GAAM5nC,KAAK2pN,KAAKiJ,EAAKiB,IAAQ,EACpCp2C,GAAKz9K,KAAK2pN,KAAKiJ,EAAKkB,IACpBp2C,GAAMA,GAAK19K,KAAK2pN,KAAK6I,EAAKuB,IAAQ,EAClCnsL,GAAOA,GAAM5nC,KAAK2pN,KAAK6I,EAAKwB,IAAQ,EACpCpsL,GAAOA,GAAM5nC,KAAK2pN,KAAK8I,EAAKsB,IAAQ,EACpCt2C,GAAMA,GAAKz9K,KAAK2pN,KAAK8I,EAAKuB,IAAQ,MAE9Bc,IAASjuN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,EACtD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAMktL,KAAQ,IAAO,EACjDA,IAAO,SAGPp3C,GAAK19K,KAAK2pN,KAAKgJ,EAAKoB,IACpBnsL,GAAM5nC,KAAK2pN,KAAKgJ,EAAKqB,IACrBpsL,GAAOA,GAAM5nC,KAAK2pN,KAAKiJ,EAAKmB,IAAQ,EACpCt2C,GAAKz9K,KAAK2pN,KAAKiJ,EAAKoB,QAEhBe,IAASluN,GAAI62K,GAAM,KAAa,KAAN91I,KAAiB,IAAO,SACtD/gC,IAAO42K,IAAM71I,KAAQ,IAAO,IAAMmtL,KAAQ,IAAO,EACjDA,IAAO,SAEPzqH,EAAE,GAAK2pH,GACP3pH,EAAE,GAAK4pH,GACP5pH,EAAE,GAAKizG,GACPjzG,EAAE,GAAK6pH,GACP7pH,EAAE,GAAK8pH,GACP9pH,EAAE,GAAK+pH,GACP/pH,EAAE,GAAKgqH,GACPhqH,EAAE,GAAKkzG,GACPlzG,EAAE,GAAKiqH,GACPjqH,EAAE,GAAKkqH,GACPlqH,EAAE,IAAMmqH,GACRnqH,EAAE,IAAMoqH,GACRpqH,EAAE,IAAMqqH,GACRrqH,EAAE,IAAMsqH,GACRtqH,EAAE,IAAMuqH,GACRvqH,EAAE,IAAMmzG,GACRnzG,EAAE,IAAMozG,GACRpzG,EAAE,IAAMwqH,GACRxqH,EAAE,IAAMyqH,GAEE,IAANluN,KACFyjG,EAAE,IAAMzjG,GACRs0D,EAAI97D,QAAU,GAIT87D,EAIJn7D,KAAK2pN,OACRoH,EAAcvC,GAMhBrG,EAAGmS,IAAMA,EAET7sS,EAAOC,QAAUy6R;A;A;A;A;A;ACnyNjB,aAEAz6R,EAAAwjN,OAAA;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;ACqJA,mDAEOA,GAAUvjN,EAAQ,sBACnBw6R,EAAKx6R,EAAQ,SAMbk+G,EACI,EADJA,EAEM,EAFNA,EAGQ,EAHRA,EAIM,EAGNssZ,EAAAA,EACH,GACA,GACA,GACA,EACD,EACA,EACA,EACA,EACA,OAKE9wU,EAAM,EAMV,MAAA+wU,EACErxZ,YAAY+5L,EAAO5/N,EAAMkqC,GACvBhR,KAAK0mM,MAAQ,KACb1mM,KAAK/b,GAAK,KACV+b,KAAKitF,IAAMA,IACXjtF,KAAKi+Z,KAAO,KACZj+Z,KAAKl5B,KAAO,OACZk5B,KAAK6yL,OAAS,KACd7yL,KAAKqT,KAAO,KACZrT,KAAKrV,OAAS,KACdqV,KAAKx2B,SAAU,EACfw2B,KAAKouB,MAAQ,KACbpuB,KAAK94B,EAAI,KACT84B,KAAKkuL,IAAM,KACXluL,KAAKktZ,UAAY,EACjBltZ,KAAKmtZ,UAAY,EACjBntZ,KAAKk+Z,aAAe,EACpBl+Z,KAAKm+Z,QAAU,EACfn+Z,KAAKg/H,KAAO,EACZh/H,KAAK/rG,EAAI,KACT+rG,KAAKynE,EAAI,KACTznE,KAAKsO,EAAI,KACTtO,KAAKulH,EAAI,KACTvlH,KAAKokH,EAAI,KACTpkH,KAAK6vL,GAAK,KACV7vL,KAAKqtZ,WAAa,EAClBrtZ,KAAKo+Z,WAAa,EAClBp+Z,KAAKmqJ,KAAO,KACZnqJ,KAAKyiM,IAAM,KACXziM,KAAKqjM,IAAM,KACXrjM,KAAKq+Z,MAAQ,KACbr+Z,KAAKs+Z,KAAO,KACZt+Z,KAAKu+Z,GAAK,KACVv+Z,KAAKw+Z,GAAK,KACVx+Z,KAAKurM,GAAK,KACVvrM,KAAKy+Z,GAAK,KACVz+Z,KAAK0+Z,QAAU,KACf1+Z,KAAKsmM,KAAO,KACZtmM,KAAKqjJ,GAAK,KACVrjJ,KAAK+hK,MAAM2kC,EAAO5/N,EAAMkqC,GAG1B+wJ,MAAM2kC,EAAO5/N,EAAMkqC,GACjBnY,EAAwB,mBAAV6tM,GACd7tM,EAAuB,iBAAT/xB,GACd+xB,EAAOmY,GAAwB,iBAATA,GACtBnY,EAAmB,MAAZmY,EAAKk9K,KAAgBl9K,EAAKk9K,eAAeH,EAAGmS,KACnDrnM,EAAiB,MAAVmY,EAAK9pC,EAAW,sBACvB2xB,EAAkB,MAAXmY,EAAK/sB,IAAiC,iBAAZ+sB,EAAK/sB,IACtC4U,EAAoB,MAAbmY,EAAKitZ,MAAqC,iBAAdjtZ,EAAKitZ,MACxCpla,EAAsB,MAAfmY,EAAK6hL,QAAyC,iBAAhB7hL,EAAK6hL,QAC1Ch6L,EAAoB,MAAbmY,EAAKqC,MAAqC,iBAAdrC,EAAKqC,MACxCxa,EAAsB,MAAfmY,EAAKrmB,QAAyC,iBAAhBqmB,EAAKrmB,QAC1CkO,EAAuB,MAAhBmY,EAAKxnC,SAA2C,kBAAjBwnC,EAAKxnC,SAC3CqvB,EAAqB,MAAdmY,EAAKod,OAAuC,iBAAfpd,EAAKod,OACzCv1B,EAAuB,MAAhBmY,EAAK0tZ,SAAmB7ga,MAAM/gB,QAAQk0B,EAAK0tZ,UAGlD1+Z,KAAK0mM,MAAQA,EAGb1mM,KAAK/b,GAAK+sB,EAAK/sB,IAAM,KACrB+b,KAAKi+Z,KAAOjtZ,EAAKitZ,MAAQ,KACzBj+Z,KAAKl5B,KAAOA,EACZk5B,KAAK6yL,OAAS7hL,EAAK6hL,SAAoB,UAAT/rN,EAAmB,KAAO,MACxDk5B,KAAKqT,KAAOrC,EAAKqC,MAAQ,KACzBrT,KAAKrV,OAASqmB,EAAKrmB,OAASs4J,EAAOx5F,KAAKz4C,EAAKrmB,OAAQ,UAAY,KACjEqV,KAAKx2B,QAAUwnC,EAAKxnC,UAAW,EAC/Bw2B,KAAKouB,MAAQpd,EAAKod,OAAS,KAG3BpuB,KAAK94B,EAAI6mN,EAAGsa,SAASr3L,EAAK9pC,GAGtB8pC,EAAKk9K,IACPluL,KAAKkuL,IAAMl9K,EAAKk9K,KAGhBluL,KAAKkuL,IAAMl9K,EAAKod,MAAQ2/J,EAAGG,IAAIl9K,EAAKod,OAAS2/J,EAAGgV,KAAK/iM,KAAK94B,GAC1D84B,KAAKkuL,IAAI2X,cAIX7lM,KAAKktZ,UAAYltZ,KAAK94B,EAAEk3J,aACxBp+H,KAAKmtZ,UAAYntZ,KAAK94B,EAAE+pM,YACxBjxK,KAAKk+Z,aAAel+Z,KAAKktZ,WAAsC,IAAP,EAAjBltZ,KAAKmtZ,YAC5CntZ,KAAKm+Z,QAA8B,EAApBn+Z,KAAKk+Z,aAAmB,EACvCl+Z,KAAKg/H,KAAO,IAEiB,IAAP,EAAjBh/H,KAAKmtZ,aACRntZ,KAAKg/H,MAAQ,IAAuB,EAAjBh/H,KAAKmtZ,YAAkB,GAG5CntZ,KAAK/rG,EAAI85R,EAAGsa,SAASr3L,EAAK/8G,GAAK,KAC/B+rG,KAAKynE,EAAIsmH,EAAGsa,SAASr3L,EAAKy2D,GAAK,KAC/BznE,KAAKsO,EAAItO,KAAK/rG,EAAE27R,IAAI5vL,KAAKynE,GACzBznE,KAAKulH,EAAIwoE,EAAGsa,SAASr3L,EAAKu0G,GAAK,KAAK0oE,MAAMjuL,KAAKkuL,KAC/CluL,KAAKokH,EAAI,KACTpkH,KAAK6vL,GAAK7vL,KAAK/rG,EAAEiqS,MAAM,GACvBl+L,KAAKqtZ,WAAartZ,KAAK/rG,EAAEmqO,aACzBp+H,KAAKo+Z,WAAap+Z,KAAK/rG,EAAEg9Q,YAGzBjxK,KAAKmqJ,KAAAA,IAAW4jC,EAAG,GAAGE,MAAMjuL,KAAKkuL,KACjCluL,KAAKyiM,IAAAA,IAAU1U,EAAG,GAAGE,MAAMjuL,KAAKkuL,KAChCluL,KAAKqjM,IAAAA,IAAUtV,EAAG,GAAGE,MAAMjuL,KAAKkuL,KAChCluL,KAAKq+Z,MAAAA,IAAYtwO,EAAG,GAAGE,MAAMjuL,KAAKkuL,KAClCluL,KAAKs+Z,KAAAA,IAAWvwO,EAAG,GAAGE,MAAMjuL,KAAKkuL,KAGjCluL,KAAKu+Z,GAAKv+Z,KAAKqjM,IAAIw0N,YACnB73Z,KAAKw+Z,GAAKx+Z,KAAKq+Z,MAAMxG,YACrB73Z,KAAKurM,GAAKvrM,KAAKu+Z,GAAGpwO,SAClBnuL,KAAKy+Z,GAAKz+Z,KAAKu+Z,GAAG39N,OAAO5gM,KAAKw+Z,IAG9Bx+Z,KAAK0+Z,QAAAA,IAAc7ga,MAAMmC,KAAKynE,EAAEjlD,KAAK,YAE5Br7C,EAAI,EAAGA,EAAI64B,KAAK0+Z,QAAQz5b,OAAQkC,IACvC64B,KAAK0+Z,QAAQv3b,GAAK64B,KAAKgvL,eAGzBhvL,KAAKsmM,KAAO,KAGZtmM,KAAKqjJ,GAAK,KAGVrjJ,KAAK2+Z,OAASC,EAAQ5+Z,KAAK2+Z,OAAQ3+Z,MACnCA,KAAK6+Z,aAAeD,EAAQ5+Z,KAAK6+Z,aAAc7+Z,MAC/CA,KAAK8+Z,YAAcF,EAAQ5+Z,KAAK8+Z,YAAa9+Z,MAG7CnH,EAAOmH,KAAK94B,EAAEohL,OAAS,GAAKtoJ,KAAK94B,EAAEqnN,SACnC11L,EAAOmH,KAAK/rG,EAAEq0P,QAAU,GACxBzvJ,EAAOmH,KAAKynE,EAAE6gF,OAAS,GAAKtoJ,KAAKynE,EAAEuqH,KAAK,MAAQ,GAChDn5L,EAAuB,OAAhBmH,KAAK6yL,QAAmC,OAAhB7yL,KAAK6yL,QAE7B7yL,KAGT++Z,UAAU/tZ,MACRnY,EAAOmY,GAAwB,iBAATA,GAGtBhR,KAAKokH,EAAIpzG,EAAKozG,EAAIpkH,KAAKsjM,cAActyL,EAAKozG,GAAKpkH,KAAKgvL,QAGhDh+K,EAAK0tZ,QAAAA,CACP7la,EAAOmY,EAAK0tZ,QAAQz5b,SAAW+6B,KAAK0+Z,QAAQz5b,gBAEnCkC,EAAI,EAAGA,EAAI64B,KAAK0+Z,QAAQz5b,OAAQkC,IACvC64B,KAAK0+Z,QAAQv3b,GAAK64B,KAAKsjM,cAActyL,EAAK0tZ,QAAQv3b,WAG/C64B,KAGTg/Z,eAEEnma,GAAQmH,KAAK/rG,EAAE46R,gBAETpnH,EAAIznE,KAAKynE,EAAEjlD,KAAK,GAChB5U,EAAI5N,KAAKyiM,IAAIjU,SACbztJ,EAAAA,CAAO/gC,KAAKgvL,SACZvtM,EAAAA,IAAU9C,QAEZykB,EAAMqkE,OAEH1mC,EAAI97D,OAASm+B,GAAAA,KACdl8B,EAEJ0mC,EAAEygL,QAAQruL,KAAKyiM,SAGbv7N,EAAI84B,KAAK0lM,WAAW93L,EAAEynB,eACfthI,gBAKPmzE,EAAIA,EAAE0oN,IAAI5vL,KAAK/rG,SACRF,GACPqvG,EAAM,eAIJl8B,EAAEyoN,cAGNzoN,EAAE2+B,sBAESmpL,IAAAA,CAAU9nN,EAAGA,EAAE0uN,OAAAA,OAClB5gS,EAAMg6R,EAAMh6R,MAEbysF,EAAI1C,IAAI/pF,KACX+rI,EAAIj2D,KAAKkkN,GACTvtM,EAAIzC,IAAIhqF,UAKd+rI,EAAI30C,MAAK,CAACvlB,EAAGyS,IAAMzS,EAAEsgC,IAAI7tB,KAElBynD,EAAI97D,OAASwiG,GAClB1mC,EAAIj2D,KAAKk1B,KAAKgvL,gBAETjuJ,EAGTk+X,UAAU/3b,EAAG7yE,GASXwkG,EAAO3xB,aAAaw/N,GACpB7tM,EAAOxkG,aAAa05R,GACpBl1L,EAAO3xB,EAAEohO,KAAOphO,EAAEohO,IAAI42N,qBAGfhxW,EAAAA,OAAOw2I,GAAUx9N,EAAEi4b,YAAY,EAAG,GAGnClia,EAAO,GAAKixD,EAIZkxW,GADO/qgB,EAAE48Q,YACQ/iH,EAAQ,GAAKA,IAAW,MAG3CmoF,EAAMr2I,KAAKwkM,iBAENr9N,EAAI,EAAGA,EAAIi4b,EAAOj4b,IAAAA,OACnBizJ,EAAO/lO,EAAE+lO,KAAKjzJ,EAAI+mF,EAAOA,GAE/BmoF,EAAMA,EAAIr3J,IAAI0lN,EAAOv9N,EAAI81B,EAAOm9H,WAI9B/lO,EAAEshS,UACJt/C,EAAMA,EAAIu/C,OAELv/C,EAGT6tD,aAAah9N,EAAG7yE,GAIdwkG,EAAO3xB,aAAaw/N,GACpB7tM,EAAOxkG,aAAa05R,GACpBl1L,EAAO3xB,EAAEohO,KAAOphO,EAAEohO,IAAInE,oBAGfE,EAAAA,OAAMK,GAAUx9N,EAAEk9N,YAAY,EAAG,GAGlC7S,EA4uQV,SAAqBl9R,EAAG65J,EAAOvoF,EAAK0+N,GAClCxrM,EAAQwrM,IAAS,IAAOA,SAGlB9S,EAAMD,EAAOj9R,EAAG65J,EAAOvoF,GAGvBy9B,EAAMx9B,KAAKwhL,KAAKmqC,EAAItsN,OAASo/N,GAC7BE,EAAAA,IAAW1mM,MAAMuF,OAEnBj8B,EAAI,UAECmqB,EAAI,EAAGA,EAAIigM,EAAItsN,OAAQqsB,GAAK+yM,EAAAA,KAC/BC,EAAO,UAEFjwS,EAAIi9F,EAAI+yM,EAAO,EAAGhwS,GAAKi9F,EAAGj9F,IACjCiwS,GAAQA,GAAQ,GAAK/S,EAAIl9R,GAE3BkwS,EAAKp9N,KAAOm9N,SAGdzrM,EAAO1xB,IAAMi8B,GAENmhM,EAnwQO86N,CAAYhrgB,EAAG,EAAGA,EAAE48Q,YAAc,EAAGozB,GAG3CphF,IAAM,GAAMohF,EAAO,IAAOA,EAAO,GAAM,EAAI,EAAI,IAAM,MAGvDx9N,EAAIm5B,KAAKwkM,SACTlrN,EAAI0mB,KAAKwkM,iBAEJr9N,EAAI87I,EAAG97I,EAAI,EAAGA,IAAAA,SACZmqB,EAAI,EAAGA,EAAIigM,EAAItsN,OAAQqsB,IAAAA,OACxBgzM,EAAO/S,EAAIjgM,GAEbgzM,IAASn9N,EACXmS,EAAIA,EAAE0F,IAAI0lN,EAAOpzM,IACVgzM,KAAUn9N,IACjBmS,EAAIA,EAAEg4C,IAAIozK,EAAOpzM,KAGrBzqB,EAAIA,EAAEmY,IAAI1F,UAGLzS,EAGT+9N,SAASngF,EAAGv9I,EAAG7yE,GAIbwkG,EAAO3xB,aAAaw/N,GACpB7tM,EAAOxkG,aAAa05R,eAGb7/H,EAAAA,OAAOw2I,GAAUx9N,EAAEo4b,SAAS76S,GAG7B8sE,EAAMD,EAAOj9R,EAAG65J,EAAO75J,EAAE48Q,YAAc,OAGzC56B,EAAMr2I,KAAKwkM,iBAENr9N,EAAIoqN,EAAItsN,OAAS,EAAGkC,GAAK,EAAGA,IAAAA,OAC7Bo+I,EAAIgsE,EAAIpqN,GAEVA,IAAMoqN,EAAItsN,OAAS,IACrBoxK,EAAMA,EAAI4vD,OAER1gF,EAAI,EACN8wB,EAAMA,EAAIr3J,IAAI0lN,EAAQn/E,EAAI,GAAM,IACzBA,EAAI,IACX8wB,EAAMA,EAAI/kH,IAAIozK,GAASn/E,EAAI,GAAM,YAG9B8wB,EAGT2uD,YAAYvgF,EAAGigF,EAAQQ,GAUrBrsM,EAAQ4rH,IAAM,IAAOA,GACrB5rH,EAAOgF,MAAM/gB,QAAQ4nN,IACrB7rM,EAAOgF,MAAM/gB,QAAQooN,IACrBrsM,EAAO6rM,EAAOz/N,SAAWigO,EAAOjgO,cAE1BA,EAASy/N,EAAOz/N,OAChB49N,EAAAA,IAAUhlM,MAAM54B,GAChBssN,EAAAA,IAAU1zL,MAAM54B,OAGlBU,EAAM,UAEDwB,EAAI,EAAGA,EAAIlC,EAAQkC,IAAAA,OACpB6nN,EAAQ0V,EAAOv9N,GACfo4b,EAAQr6N,EAAO/9N,MAErB0xB,EAAOm2L,aAAiB0X,GACxB7tM,EAAO0ma,aAAiBxxO,GAEpB5mN,EAAI,GAAK6nN,EAAMloN,OAAS49N,EAAOv9N,EAAI,GAAGL,KAAAA,MAAAA,IAC9BgyB,MAAM,sBAGlB+pM,EAAI17N,GAAK,KACToqN,EAAIpqN,GAAK,KAGTxB,EAAMC,KAAKD,IAAIA,EAAK45b,EAAMtuP,YAAc,OAItCuuP,EAAS,KACTC,EAAS,KACTr8Z,EAAM,UAEDj8B,EAAI,EAAGA,EAAIlC,EAAQkC,IAAAA,OACpB6nN,EAAQ0V,EAAOv9N,GACfo4b,EAAQr6N,EAAO/9N,GACfmhO,EAAMtZ,EAAM0wO,QAAQ,GAGtBp3N,GACFzF,EAAIz/L,GAAOklM,EAAI5D,OACfnT,EAAInuL,GAAOkuL,EAAOiuO,EAAOj3N,EAAIp6I,MAAOvoF,GACpCy9B,GAAO,GAKJo8Z,GAOL38N,EAAIz/L,GAAOo8Z,EAAOG,SAAS3wO,GAC3BuC,EAAInuL,GAAOw8Z,EAAQH,EAAQF,EAAO55b,GAElC65b,EAAS,KACTC,EAAS,KAETr8Z,GAAO,IAZLo8Z,EAASxwO,EACTywO,EAASF,MAeTC,EAAAA,OACIK,EAAOL,EAAOF,SAAS76S,GAE7Bo+E,EAAIz/L,GAAOy8Z,EAAKn7N,OAChBnT,EAAInuL,GAAOkuL,EAAOmuO,EAAQI,EAAK3xW,MAAOvoF,GAEtCy9B,GAAO,MAILizI,EAAMr2I,KAAKwkM,iBAENr9N,EAAIxB,EAAM,EAAGwB,GAAK,EAAGA,IAAAA,CACxBA,IAAMxB,EAAM,IACd0wK,EAAMA,EAAI4vD,eAEH30M,EAAI,EAAGA,EAAI8R,EAAK9R,IAAAA,OACjBi0H,EAAIgsE,EAAIjgM,GAAGnqB,GAEbo+I,EAAI,EACN8wB,EAAMA,EAAIr3J,IAAI6jN,EAAIvxM,GAAIi0H,EAAI,GAAM,IACzBA,EAAI,IACX8wB,EAAMA,EAAI/kH,IAAIuxK,EAAIvxM,IAAKi0H,EAAI,GAAM,aAIhC8wB,EAGT6xD,gBAAgBxD,EAAQQ,aACZpsM,MAAM,oBAGlB6la,OAAO7wO,EAAO4rG,UACZ7gS,EAAOi1L,aAAiBkwO,GACxBnla,EAAOi1L,EAAM5mN,EAAEqsC,GAAGvT,KAAK94B,IAEf4mN,EAAMhnN,UACP,eACIk5B,KAAK8/Z,YAAYhyO,EAAO4rG,OAC5B,cACI15R,KAAK+/Z,WAAWjyO,EAAO4rG,OAC3B,iBACI15R,KAAKgga,cAAclyO,EAAO4rG,qBAEvB5gS,MAAM,qBAItBgna,YAAYhyO,EAAO4rG,aACP5gS,MAAM,oBAGlBina,WAAWjyO,EAAO4rG,aACN5gS,MAAM,oBAGlBkna,cAAclyO,EAAO4rG,aACT5gS,MAAM,oBAGlBmna,uBACYnna,MAAM,oBAGlBona,iBACYpna,MAAM,oBAGlBqna,oBACS,EAGTt6N,WAAWtyB,UACT16K,GAAQmH,KAAKokH,EAAEurE,aAAc,yBAC7B92L,GAAQmH,KAAK/rG,EAAE46R,SAAU,oBAEzB7uL,KAAKokH,EAAEyhF,WAAW7lM,KAAK/rG,EAAEg9Q,YAAasC,GAE/BvzK,KAGT4wL,OAAOl/K,EAAK0uB,EAAMyyJ,SACVx+R,EAAAA,IAAQ05R,EAAGr8K,EAAK0uB,EAAMyyJ,UAE5Bh6L,GAAQxkG,EAAE65R,KAENluL,KAAK/rG,EAAE46R,SACFx6R,EAEFA,EAAE2tS,KAAKhiM,KAAK/rG,GAGrBmsgB,MAAM1uZ,EAAK0uB,EAAMyyJ,SACTjlL,EAAImgL,EAAGkrO,KAAKvnZ,EAAK0uB,EAAMyyJ,UAEzBjlL,EAAEsgL,IACGtgL,EAAE2yL,SAASvgM,KAAKkuL,KAElBtgL,EAAEqgL,MAAMjuL,KAAKkuL,KAGtBc,MAAMphL,EAAGC,aACG/U,MAAM,oBAGlB0rM,OAAO52L,EAAGC,EAAG03G,aACDzsH,MAAM,oBAGlBuna,OAAOzyZ,EAAG23G,aACEzsH,MAAM,oBAGlBwna,OAAOp2N,EAAIq2N,EAAIp2N,EAAI4tE,MACjBl/Q,EAAOqxM,aAAcnc,GACrBl1L,EAAO0na,aAAcxyO,GACrBl1L,EAAOsxM,aAAcpc,GACrBl1L,EAAOk/Q,aAAchqF,GAEjBwyO,EAAG1xO,UAAYkpF,EAAGlpF,SAAAA,OACb7uL,KAAKgvL,cAERzpE,EAAIg7S,EAAG3/N,OAAOm3E,GAAI8/I,YAClBjqZ,EAAIs8L,EAAGtJ,OAAOm3E,GAAIn3E,OAAOr7E,GACzB13G,EAAIs8L,EAAGvJ,OAAO2/N,GAAI3/N,OAAOr7E,UAExBvlH,KAAKgvL,MAAMphL,EAAGC,GAGvB2yZ,QAAQ3yZ,aACI/U,MAAM,oBAGlB2na,OAAO5yZ,UACE7N,KAAKwga,QAAQ3yZ,GAAGygL,UAGzBoyO,QAAQ9yZ,aACI9U,MAAM,oBAGlB6na,OAAO/yZ,UACE5N,KAAK0ga,QAAQ9yZ,GAAG0gL,UAGzBryD,SAAS+yD,aACGl2L,MAAM,oBAGlB4sM,WAAW93L,EAAG06I,aACFxvJ,MAAM,oBAGlBszM,WAAWv+L,EAAGy6I,aACFxvJ,MAAM,oBAGlB+la,aAAa/wO,aACDh1L,MAAM,oBAGlBgma,YAAYhxO,aACAh1L,MAAM,oBAGlB8na,eAAe5xO,aACHl2L,MAAM,oBAGlBg1Z,cAAc9+N,EAAO1mC,aACTxvJ,MAAM,oBAGlB80Z,iBAAiB5+N,aACLl2L,MAAM,oBAGlBm1Z,iBAAiB/5T,aACLp7F,MAAM,oBAGlBs1Z,eAAelnb,aACH4xB,MAAM,oBAGlB01Z,cAAc71R,EAAO41R,GAAO,MAE1B11Z,EAAOoqJ,EAAO8H,SAASpyB,IACvB9/H,EAAuB,kBAAT01Z,GAEV51R,EAAM1zJ,SAA4B,EAAjB+6B,KAAKktZ,UAAY,MAAA,IAC1Bp0Z,MAAM,4BAIZ+8F,EAAK8iC,EAAMvzJ,MAAM,EAAG46B,KAAKktZ,WACzBp3T,EAAK6iC,EAAMvzJ,MAAM46B,KAAKktZ,WACtBj7N,EAAKjyL,KAAKguZ,cAAcn4T,GACxBq8F,EAAKlyL,KAAKguZ,cAAcl4T,GACxB16G,EAAK4kB,KAAKiuZ,iBAAiBh8N,GAC3B6V,EAAK9nM,KAAKiuZ,iBAAiB/7N,GAC3B2uO,EAAKzlb,EAAG4D,IAAI8oN,UAEXymN,EAAOsS,EAAGC,OAASD,EAG5BlS,YAAYznb,EAAGwnb,EAAUn7O,GAEvB16K,EAAO3xB,aAAa84B,KAAK0mM,OACzB7tM,EAAQ61Z,IAAa,IAAOA,SAGtBvnb,EAAIunb,EAAW1uZ,KAAK0+Z,QAAQz5b,OAC5B87b,EAAK75b,EAAE8X,IAAIghB,KAAK0+Z,QAAQv3b,kBAUtB8qN,EAAKjyL,KAAKgha,YAAYztP,GACtBn4L,EAAK4kB,KAAKiuZ,iBAAiBh8N,MAM7B72M,EAAGw6M,MAAMriL,GAAGn4B,GAAAA,eAGV0sN,EAAKi5N,EAAGzvY,IAAIl2C,GACZuiN,EAAOwwN,EAAU56O,OAEnB2e,MAEFA,EAAKlyL,KAAKouZ,eAAetmN,EAAW,GAAPnK,SACtB5pS,MACW,mBAAdA,EAAE4lF,QAAY,eAEZ5lF,QAGF8hM,EAAK71F,KAAKquZ,cAAcp8N,EAAI0L,IAAS,GACrC7nG,EAAK91F,KAAKquZ,cAAcn8N,EAAIyL,IAAS,WAEpC16C,EAAOpxJ,OAAAA,CAAQgkG,EAAIC,KAI9BmrU,aAAa1tP,SACL5tM,EAAMq6B,KAAK/rG,EAAE46R,SAAW7uL,KAAK94B,EAAI84B,KAAK/rG,SACrC85R,EAAG3/K,OAAOmlK,EAAK,EAAG5tM,GAG3Bq7b,YAAYztP,UACHwa,EAAG3/K,OAAOmlK,EAAK,EAAGvzK,KAAK94B,GAAG+mN,MAAMjuL,KAAKkuL,KAG9CgzO,YAAY3tP,OACNrsM,gBAGI0mC,EAAI5N,KAAKgha,YAAYztP,GACrBjrB,EAAgC,IAAP,EAAjB6lQ,EAAU56O,QAGtBrsM,EAAI84B,KAAK0lM,WAAW93L,EAAG06I,SAChBv0P,mBAIT8kG,EAAO3xB,EAAE+0J,YAEF/0J,EAAE45b,QAIbK,OAAOz8N,EAAQQ,UACNllM,KAAKoha,QAAQ18N,EAAQQ,GAG9Bk8N,QAAQ18N,EAAQQ,UACdrsM,EAAOgF,MAAM/gB,QAAQ4nN,IACrB7rM,EAAyB,IAAlB6rM,EAAOz/N,QAAiBy/N,EAAO,aAAcgC,GAGhD1mM,KAAKsmM,MAAQ5B,EAAOz/N,OAAS,GAAKy/N,EAAO,GAAG59N,OAAS2qC,EAChDzR,KAAKkoM,gBAAgBxD,EAAQQ,GAG/BllM,KAAKglM,YAAY,EAAGN,EAAQQ,GAGrC47N,KAAKzsgB,UACHwkG,EAAOxkG,aAAa05R,GACb/tL,KAAKqha,MAAMhtgB,EAAEghI,SAGtBgsY,MAAMhtgB,GACJwkG,EAAOxkG,aAAa05R,GACpBl1L,GAAQxkG,EAAE65R,WAEJ1rK,EAAOxiB,KAAKynE,EAAEjlD,KAAK,MAGG,IAAvBA,EAAQA,EAAO,GAAQ,OACpB43G,EAAOp6H,KAAKynE,EAAEwpG,mBACb58Q,EAAEkpS,OAAOnjE,EAAO,GAAG4nE,KAAKhiM,KAAK/rG,UAG/BI,EAAEw/R,MAAMrxK,GAAMw/K,KAAKhiM,KAAK/rG,GAGjCqtgB,aAAa58N,GACX7rM,EAAOgF,MAAM/gB,QAAQ4nN,UAEfthM,EAAMshM,EAAOz/N,OACbsgJ,EAAAA,IAAQ1nH,MAAMuF,WAEXj8B,EAAI,EAAGA,EAAIi8B,EAAKj8B,IAAAA,OACjBD,EAAIw9N,EAAOv9N,GAEjB0xB,EAAO3xB,aAAaw/N,GACpB7tM,EAAO3xB,EAAE4mN,QAAU9tL,MAEf94B,EAAEJ,OAAS2qC,EAKf8zG,EAAEp+I,GAAKD,EAAEq+I,EAJPA,EAAEp+I,GAAK64B,KAAKyiM,UAOV/b,EAAK1mL,KAAKkuL,IAAIuvO,UAAUl4S,GACxBxkF,EAAAA,IAAUljC,MAAMuF,WAEbj8B,EAAI,EAAGA,EAAIi8B,EAAKj8B,IACvB45D,EAAI55D,GAAKu9N,EAAOv9N,GAAGo6b,MAAM76O,EAAGv/M,WAEvB45D,EAGTygY,YAAY98N,UACH1kM,KAAKsha,aAAa58N,GAG3B3qB,MAAM6W,GAGJ/3L,EAAOoqJ,EAAO8H,SAAS6lC,IACvB/3L,EAAO+3L,EAAO3rN,SAAW+6B,KAAKqtZ,YAC9Bx0Z,EAAOmH,KAAKqtZ,YAAcrtZ,KAAKktZ,eAE3B/+U,EAAwB,EAAjBnuE,KAAKmtZ,WAAkB,EAC9BnmP,EAAM,EACNy6P,EAAMzha,KAAKqtZ,WAAa,QAGR,OAAhBrtZ,KAAK6yL,UACN7rB,EAAKy6P,GAAAA,CAAQA,EAAKz6P,IAGjBhnK,KAAKqtZ,WAAartZ,KAAKktZ,YACzB/+U,EAAM,GAGRyiH,EAAO5pB,IAA0B,KAAjBhnK,KAAKynE,EAAEjlD,KAAK,GAG5BouK,EAAO6wO,KAAS,GAAKtzV,GAAO,EAG5ByiH,EAAO6wO,IAAQ,GAAMtzV,EAAM,EAEpByiH,EAGT8wO,UAAU/oS,GAER9/H,EAAOoqJ,EAAO8H,SAASpyB,IACvB9/H,EAAO8/H,EAAM1zJ,SAA+B,EAApB+6B,KAAKk+Z,cAC7Brla,EAAOmH,KAAKqtZ,YAAcrtZ,KAAKk+Z,kBAE3B3oS,EAAM,EAEU,OAAhBv1H,KAAK6yL,SACPt9D,EAAMv1H,KAAKk+Z,aAAel+Z,KAAKqtZ,kBAE3Bz8N,EAASj4D,EAAMvzJ,MAAMmwJ,EAAKA,EAAMv1H,KAAKqtZ,YACrC1ia,EAASguI,EAAMvzJ,MAAM46B,KAAKk+Z,qBAEhCl+Z,KAAK+5K,MAAM6W,IAEHA,EAAQjmM,GAGlBska,YAAYrhZ,UAEV/U,EAAO+U,aAAamgL,GACpBl1L,GAAQ+U,EAAEsgL,KAEHtgL,EAAEtK,OAAOtD,KAAK6yL,OAAQ7yL,KAAKktZ,WAGpCyU,YAAYhpS,MAEV9/H,EAAOoqJ,EAAO8H,SAASpyB,IAEnBA,EAAM1zJ,SAAW+6B,KAAKktZ,UAAAA,MAAAA,IACdp0Z,MAAM,sCAEXi1L,EAAG3pL,OAAOu0H,EAAO34H,KAAK6yL,QAG/B+uO,eAAeh0Z,UACb/U,EAAO+U,aAAamgL,GACpBl1L,GAAQ+U,EAAEsgL,KAEHtgL,EAAEtK,OAAOtD,KAAK6yL,OAAQ7yL,KAAKk+Z,cAGpC2D,eAAelpS,MACb9/H,EAAOoqJ,EAAO8H,SAASpyB,IAEnBA,EAAM1zJ,SAAW+6B,KAAKk+Z,aAAAA,MAAAA,IACdpla,MAAM,sCAEXi1L,EAAG3pL,OAAOu0H,EAAO34H,KAAK6yL,QAG/B46N,aAAap5f,UAEXwkG,EAAOxkG,aAAa05R,GACpBl1L,GAAQxkG,EAAE65R,KAEH75R,EAAEivG,OAAOtD,KAAK6yL,OAAQ7yL,KAAKqtZ,YAGpCyU,aAAanpS,MAEX9/H,EAAOoqJ,EAAO8H,SAASpyB,IAEnBA,EAAM1zJ,SAAW+6B,KAAKqtZ,WAAAA,MAAAA,IACdv0Z,MAAM,+BAEXi1L,EAAG3pL,OAAOu0H,EAAO34H,KAAK6yL,QAG/BkvO,cAAc1tgB,UAGL2rG,KAAK+5K,MAAM/5K,KAAKytZ,aAAap5f,IAGtCq5f,cAAc/0R,MAGZ9/H,EAAOoqJ,EAAO8H,SAASpyB,IAEnBA,EAAM1zJ,SAAW+6B,KAAKqtZ,WAAAA,MAAAA,IACdv0Z,MAAM,8BAEZkpa,EAAUhia,KAAK+5K,MAAM92B,EAAOx5F,KAAKkvE,WAEhCo1D,EAAG3pL,OAAO49Z,EAAShia,KAAK6yL,QAGjCw7N,cAAczgZ,EAAGwsH,GACfvhI,EAAO+U,aAAamgL,GACpBl1L,EAAQuhI,IAAS,IAAOA,SAElBqnS,EAAsB,OAAhBzha,KAAK6yL,OAAkB7yL,KAAKktZ,UAAY,EAAI,EAClDv0R,EAAQ/qH,EAAEyyL,UAAU/8L,OAAOtD,KAAK6yL,OAAQ7yL,KAAKktZ,kBAEnDv0R,EAAM8oS,IAASrnS,GAAQp6H,KAAKg/H,KAAQ,IAE7BrG,EAGTq1R,cAAcr1R,MACZ9/H,EAAOoqJ,EAAO8H,SAASpyB,IAEnBA,EAAM1zJ,SAAW+6B,KAAKktZ,UAAAA,MAAAA,IACdp0Z,MAAM,6BAEZ8U,EAAImgL,EAAG3pL,OAAOu0H,EAAO34H,KAAK6yL,eAEhCjlL,EAAEulZ,QAAQnzZ,KAAKmtZ,WAERv/Y,EAAEqgL,MAAMjuL,KAAKkuL,KAGtB8oB,YAAYhoB,EAAO95B,UACjBr8J,EAAOm2L,aAAiB0X,GACjB1X,EAAM1rL,OAAO4xJ,GAGtBuwC,YAAY9sE,aACA7/H,MAAM,oBAGlBmpa,QAAQjzO,aACIl2L,MAAM,oBAGlB81Z,QAAQj2R,aACI7/H,MAAM,oBAGlBopa,WAAWvpS,aACC7/H,MAAM,oBAGlBqpa,aAAaxpS,aACD7/H,MAAM,oBAGlBspa,oBACYtpa,MAAM,oBAGlBupa,OAAOx5O,aACK/vL,MAAM,oBAGlBwpa,UAAU1rO,aACE99L,MAAM,oBAGlBypa,YAAYvzO,EAAOsZ,UACjBzvM,EAAOm2L,aAAiB0X,GACjB1X,EAAM5nM,OAAOkhN,GAGtBhF,cAAc3zE,aACF72H,MAAM,oBAGlB1R,OAAOkhN,OACD39M,EAAQnhB,EACRv1E,EAAGsxN,EAAG+gF,QAEQ,YAAdtmM,KAAKl5B,OACP6jB,EAASqV,KAAKrV,OAASqV,KAAKrV,OAAOyT,WAAa,KAChD50B,EAAUw2B,KAAKx2B,SAGZw2B,KAAK/rG,EAAE46R,WACV56R,EAAI+rG,KAAK/rG,EAAEmzF,UAER4Y,KAAKulH,EAAEspE,WACVtpE,EAAIvlH,KAAKulH,EAAE86E,UAEPrgM,KAAKulH,EAAE6xS,aACT7xS,EAAE8pE,KAAKrvL,KAAK94B,GAEdq+I,EAAIA,EAAEnnH,SAAS,KAGb4B,KAAKsmM,OACPA,EAAOtmM,KAAKsmM,KAAKl/M,WAGjBnD,GAAI+b,KAAK/b,GACTg6a,KAAMj+Z,KAAKi+Z,KACXn3b,KAAMk5B,KAAKl5B,KACX+rN,OAAQ7yL,KAAK6yL,OACbx/K,KAAMrT,KAAKqT,KACX1oB,OAAAA,EACAnhB,QAAAA,EACA4kD,MAAOpuB,KAAKouB,MACZlnD,EAAG84B,KAAK94B,EAAEkgB,SACVvgB,OAAGnxE,EACH4jF,OAAG5jF,EACHkoI,OAAGloI,EACHzB,EAAAA,EACAwzK,EAAGznE,KAAKynE,EAAErpE,SAAS,IACnBliB,OAAGxmF,EACH6vN,EAAAA,EACA94I,OAAG/2E,EACH0uN,EAAGpkH,KAAKokH,EAAEh9H,OAAOkhN,GACjBhC,KAAAA,mBAIY32E,cACH3vH,KAAK2vH,IAQpB,MAAA+2E,EACE/5L,YAAYmhL,EAAOhnN,GACjB+xB,EAAOi1L,aAAiBkwO,GACxBnla,EAAQ/xB,IAAS,IAAOA,GAExBk5B,KAAK8tL,MAAQA,EACb9tL,KAAKl5B,KAAOA,EACZk5B,KAAKsoM,IAAM,KAGbvmC,kBACYjpK,MAAM,oBAGlBwma,SAASpxW,MACPr1D,EAAQq1D,IAAU,IAAOA,GAErBluD,KAAKsoM,KAAOtoM,KAAKsoM,IAAI/W,IAAAA,OAChBvxL,KAAKsoM,IAAI/W,OAEJ,IAAVrjI,EAAU,OACL,WAEHjxD,EAAO,GAAMixD,EAAQ,EACrBw2I,EAAAA,IAAa7mM,MAAMZ,GACnB/1B,EAAI84B,KAAKslM,MACTW,EAAe,IAAThpM,EAAa,KAAO/1B,EAAE++N,MAElCvB,EAAO,GAAKx9N,UAEHC,EAAI,EAAGA,EAAI81B,EAAM91B,IACxBu9N,EAAOv9N,GAAKu9N,EAAOv9N,EAAI,GAAG6X,IAAIinN,cAErBu8N,EAAIt0W,EAAOw2I,GAGxBg7N,QAAQxxW,MACNr1D,EAAQq1D,IAAU,IAAOA,GAErBluD,KAAKsoM,KAAOtoM,KAAKsoM,IAAI/W,IAAAA,OAChBvxL,KAAKsoM,IAAI/W,OAEJ,IAAVrjI,EAAU,OACL,WAEHu0W,EAAOzia,KAAKs/Z,SAASpxW,GAAOw2I,OAC5BA,EAAS1kM,KAAK8tL,MAAM0zO,YAAYiB,cAE3BD,EAAIt0W,EAAOw2I,GAGxBy6N,YAAYjxW,EAAOksE,MACjBvhI,EAAQq1D,IAAU,IAAOA,GACzBr1D,EAAQuhI,IAAS,IAAOA,GAEpBp6H,KAAKsoM,KAAOtoM,KAAKsoM,IAAI42N,QAAAA,OAChBl/Z,KAAKsoM,IAAI42N,WAEJ,IAAVhxW,EAAU,OACL,WAEHjxD,EAAO,GAAKixD,EACZkxW,GAAUhlS,EAAOlsE,EAAQ,GAAKA,IAAW,EACzCw0W,EAAAA,IAAW7ka,MAAMuha,EAAQnia,OAE3BmnH,EAAIpkH,KAAKslM,cAEJn+N,EAAI,EAAGA,EAAIi4b,EAAOj4b,IAAAA,CACzBu7b,EAAKv7b,EAAI81B,GAAQ+C,KAAK8tL,MAAM0W,iBAEnBlzM,EAAI,EAAGA,EAAI2L,EAAM3L,IACxBoxa,EAAKv7b,EAAI81B,EAAO3L,GAAKoxa,EAAKv7b,EAAI81B,EAAO3L,EAAI,GAAGtS,IAAIolI,GAElDA,EAAIA,EAAE2gF,KAAK72I,SAGPw2I,EAAS1kM,KAAK8tL,MAAM0zO,YAAYkB,cAE3BC,EAAQz0W,EAAOksE,EAAMsqE,GAGlCN,YAAYC,EAAMyB,MAChBjtM,EAAQwrM,IAAS,IAAOA,GACxBxrM,EAAQitM,IAAU,IAAOA,GAErB9lM,KAAKsoM,KAAOtoM,KAAKsoM,IAAInE,QAAAA,OAChBnkM,KAAKsoM,IAAInE,WAEL,IAATE,EAAS,OACJ,WAEHjhM,EAAMx9B,KAAKwhL,KAAK0+C,EAAQzB,GAAQ,EAChCu+N,EAAAA,IAAW/ka,MAAMuF,OAEnBizI,EAAMr2I,KAAKslM,MACXjxS,EAAI,EAERuugB,EAAKvugB,KAAOgiP,UAEHlvK,EAAI,EAAGA,EAAI2+N,EAAO3+N,GAAKk9N,EAAAA,SACrB/yM,EAAI,EAAGA,EAAI+yM,EAAM/yM,IACxB+kJ,EAAMA,EAAI4vD,MAEZ28N,EAAKvugB,KAAOgiP,EAGdx9I,EAAOxkG,IAAM+uG,SAEPshM,EAAS1kM,KAAK8tL,MAAM0zO,YAAYoB,cAE3BC,EAAQx+N,EAAMK,GAG3BqB,kBACS,KAGT+8N,aAAavvP,MACPvzK,KAAKsoM,KAAOtoM,KAAKsoM,IAAIy6N,SAAAA,OAChB/ia,KAAKsoM,IAAIy6N,aAEbxvP,EAAAA,OACI,QAELvzK,KAAK8tL,MAAM75R,EAAE46R,SAAAA,OACR,WAWH08D,EAAQvrP,KAAK8tL,MAAMmzO,aAAa1tP,GAChCyvP,EAAUhja,KAAK4vL,IAAI27D,cAEd03K,EAAS13K,EAAOy3K,GAG7BE,YAAY7ugB,MACVwkG,EAAOxkG,aAAa05R,IAEf/tL,KAAKsoM,MAAQtoM,KAAKsoM,IAAI42N,QAAAA,OAClB,cAEFhxW,EAAAA,KAAOksE,GAAQp6H,KAAKsoM,IAAI42N,QACzBE,GAAUhlS,EAAOlsE,EAAQ,GAAKA,IAAW,SAExC75J,EAAE48Q,aAAemuP,EAAQlxW,EAGlC83I,YAAY3xS,MACVwkG,EAAOxkG,aAAa05R,IAEf/tL,KAAKsoM,MAAQtoM,KAAKsoM,IAAInE,QAAAA,OAClB,aAEFE,EAAAA,OAAMK,GAAU1kM,KAAKsoM,IAAInE,QAC1B2B,EAAQzxS,EAAE48Q,YAAc,SAEvByzB,EAAOz/N,QAAUW,KAAKwhL,KAAK0+C,EAAQzB,GAAQ,EAGpDs7N,SAAS3wO,UACPn2L,EAAOm2L,aAAiB0X,GACxB7tM,EAAOm2L,EAAMloN,OAASk5B,KAAKl5B,OAIzBk5B,KACAA,KAAKhhB,IAAIgwM,GACThvL,KAAKsxB,IAAI09J,GACTA,GAIJm0O,OAAO9ugB,EAAGk/Q,MAGR16K,EAAOxkG,aAAa05R,GACpBl1L,GAAQxkG,EAAE65R,KA2BNluL,KAAKsoM,KAAOtoM,KAAKsoM,IAAIy6N,SAAAA,aAChBx3K,EAAAA,QAAOy3K,GAAWhja,KAAKsoM,IAAIy6N,gBAG1B/ia,KAFE3rG,EAAEi9H,IAAIi6N,GAECy3K,OAKdzvP,EAAAA,MAAAA,CACKvzK,KAAM3rG,EAAG,SA4Bf2rG,KAAKsoM,IAAAA,IACHtoM,KAAK8tL,MAAM75R,EAAE46R,SAAAA,MAAAA,CACP7uL,KAAM3rG,EAAG,aAMX2rG,KAJEA,KAAK8tL,MAAMmzO,aAAa1tP,GACtBqc,IAAI5vL,KAAK8tL,MAAM75R,GACfm7R,KAAK/6R,GAEA,aAKT2rG,KAAKy7X,UAAUloN,GAEdl/Q,EAAG,MAGhBghI,kBACYv8B,MAAM,oBAGlB+sM,WAAWzrE,EAAMm5C,UACf16K,EAAQuhI,IAAS,IAAOA,GAEnBp6H,KAAKsoM,MACRtoM,KAAKsoM,IAAAA,IAAU86N,GAEZpja,KAAKsoM,IAAI/W,MACZvxL,KAAKsoM,IAAI/W,IAAMvxL,KAAK0/Z,QAAQ,IAKzB1/Z,KAAKsoM,IAAInE,UACZnkM,KAAKsoM,IAAInE,QAAUnkM,KAAKokM,YAAY,EAAGhqE,EAAO,IAE3Cp6H,KAAKsoM,IAAIj9K,OACZrrB,KAAKsoM,IAAIj9K,KAAOrrB,KAAK+lM,YAElB/lM,KAAKsoM,IAAIy6N,WACZ/ia,KAAKsoM,IAAIy6N,SAAW/ia,KAAK8ia,aAAavvP,IAEjCvzK,KAGTi8H,kBACSj8H,KAAK8tL,MAAM7xD,SAASj8H,MAG7B6F,mBACS7F,KAGTuha,MAAM16b,aACMiyB,MAAM,oBAGlB2iY,UAAUloN,SACFhuD,EAAIvlH,KAAK8tL,MAAMkzO,YAAYztP,UAC1BvzK,KAAKuha,MAAMh8S,GAGpBqwE,gBACY98L,MAAM,oBAGlB9Z,IAAIgwM,aACQl2L,MAAM,oBAGlBw4B,IAAI09J,UACFn2L,EAAOm2L,aAAiB0X,GACjB1mM,KAAKhhB,IAAIgwM,EAAM4G,OAGxBqQ,gBACYntM,MAAM,oBAGlBisM,KAAK1lE,GAGHxmI,EAAQwmI,IAAQ,IAAOA,OAEnBrxH,EAAIhO,aAEC74B,EAAI,EAAGA,EAAIk4J,EAAKl4J,IACvB6mC,EAAIA,EAAEi4L,aAEDj4L,EAGTq1Z,WAAWn8b,EAAGonC,aACFxV,MAAM,oBAGlB+3L,iBACY/3L,MAAM,oBAGlBg4L,iBACYh4L,MAAM,oBAGlBya,GAAGy7K,aACSl2L,MAAM,oBAGlBqO,IAAI6nL,aACQl2L,MAAM,oBAGlB62L,uBACY72L,MAAM,oBAGlBwqa,qBACYxqa,MAAM,oBAGlBy1L,kBACYz1L,MAAM,oBAGlBqiL,mBACYriL,MAAM,oBAGlB44Z,qBACY54Z,MAAM,oBAGlByqa,IAAI31Z,aACQ9U,MAAM,oBAGlB0qa,IAAI51Z,aACQ9U,MAAM,oBAGlBg2Z,iBAEM9uZ,KAAK2vL,cAIF3vL,KAAKyja,QAAQ9zO,aAGtBq/N,oBAEMhvZ,KAAK2vL,eAID3vL,KAAK0ja,KAAK1ja,KAAK8tL,MAAM75R,GAAG07R,aAGlCg0O,gBAESl8V,EAAAA,EAAGxzK,GAAK+rG,KAAK8tL,UAEhB5mN,EAAI84B,KAAKslM,MACTh3L,EAAAA,IAAQy/K,EAAG,SAEP7mN,EAAEyoN,cAAAA,IACRrhL,EAAEgnL,MAAM,GAEJhnL,EAAEnH,IAAIsgE,GAAK,EAAA,CACbn5D,EAAIr6G,EAAEohI,cAIRnuD,EAAIA,EAAE8X,IAAIghB,aAGLsO,EAGTshL,IAAIv7R,UACK2rG,KAAK0ja,KAAKrvgB,GAGnB8oS,KAAK9oS,UACI2rG,KAAK4ja,MAAMvvgB,GAGpBs5f,SAASt5f,EAAGk/Q,UACHvzK,KAAK6ja,UAAUxvgB,EAAGk/Q,GAG3Bs1B,OAAO7rB,EAAI8qB,EAAIjW,UACN7xL,KAAK8oM,QAAQ9rB,EAAI8qB,EAAIjW,GAG9BivO,cACS9ga,KAAKyja,QAGdnwQ,IAAIj/P,UACK2rG,KAAK8ja,KAAKzvgB,GAGnByqS,KAAKzqS,UACI2rG,KAAK+ja,MAAM1vgB,GAGpB2vgB,cACShka,KAAKika,QAGdP,KAAKrvgB,UAIC2rG,KAAKgmM,YAAY3xS,GACZ2rG,KAAK8tL,MAAMoW,aAAalkM,KAAM3rG,GAEnC2rG,KAAK8tL,MAAMwY,MAAQtmM,KAAKl5B,OAAS2qC,EAC5BzR,KAAK8tL,MAAMoa,gBAAAA,CAAiBloM,MAAA,CAAQ3rG,IAEtC2rG,KAAK8tL,MAAM8W,SAAS,EAAG5kM,KAAM3rG,GAGtCuvgB,MAAMvvgB,UACJwkG,GAAY,EAAJxkG,KAAWA,GACZ2rG,KAAK0ja,KAAAA,IAAS31O,EAAG15R,IAG1BwvgB,UAAUxvgB,EAAGk/Q,EAAM,YACVrsM,EAAG63E,EAAGikX,GAAWhja,KAAKmja,OAAO9ugB,EAAGk/Q,GACjCjlK,EAAIpnC,EAAEw8b,KAAK3kX,UAEbikX,EACK10Z,EAAEtvB,IAAIgkb,GAER10Z,EAGTw6L,QAAQ9rB,EAAI8qB,EAAIjW,UACV7xL,KAAK8tL,MAAMwY,MAAQtmM,KAAKl5B,OAAS2qC,EAC5BzR,KAAK8tL,MAAMoa,gBAAAA,CAAiBloM,KAAM8nM,GAAAA,CAAM9qB,EAAI6U,IAE9C7xL,KAAK8tL,MAAMkX,YAAY,EAAA,CAAIhlM,KAAM8nM,GAAAA,CAAM9qB,EAAI6U,IAGpD4xO,cACQjhZ,EAAOxiB,KAAK8tL,MAAMrmH,EAAEjlD,KAAK,MAGH,IAAvBA,EAAQA,EAAO,GAAQ,OACpB43G,EAAOp6H,KAAK8tL,MAAMrmH,EAAEwpG,mBACnBjxK,KAAKslM,MAAMP,KAAK3qE,EAAO,UAGzBp6H,KAAK0ja,KAAK1ja,KAAK8tL,MAAMrmH,GAG9Bq8V,KAAKzvgB,UACHwkG,EAAOxkG,aAAa05R,GACpBl1L,GAAQxkG,EAAE65R,KAEHluL,KAAK0ja,KAAKrvgB,EAAEqlY,OAAO15R,KAAK8tL,MAAM75R,IAGvC8vgB,MAAM1vgB,UACJwkG,GAAQmH,KAAK8tL,MAAM75R,EAAE46R,UAEQ,IAAzB7uL,KAAK8tL,MAAMrmH,EAAEuqH,KAAK39R,GACb2rG,KAAKika,QAEPjka,KAAK8ja,KAAAA,IAAS/1O,EAAG15R,IAG1B4vgB,eACMjka,KAAK8tL,MAAM75R,EAAE46R,UAGY,IAAzB7uL,KAAK8tL,MAAMrmH,EAAEuqH,KAAK,GAFbhyL,KAAKslM,OAKQ,OAAlBtlM,KAAK8tL,MAAMzqC,KACbrjJ,KAAK8tL,MAAMzqC,GAAKrjJ,KAAK8tL,MAAMrmH,EAAEiyN,OAAO15R,KAAK8tL,MAAM75R,IAE1C+rG,KAAK0ja,KAAK1ja,KAAK8tL,MAAMzqC,KAG9BshD,aACS3kM,KAAK6F,YAGdy/L,aACStlM,KAGT6tZ,aACS7tZ,KAGThrG,SACMgrG,KAAK2vL,aAAAA,MAAAA,GACG3vL,KAAK8tL,MAAM7gG,SAEvBjtF,KAAK6F,kBAEC+H,EAAI5N,KAAK6wL,OAAOzyL,SAAS,IACzByP,EAAI7N,KAAK8wL,OAAO1yL,SAAS,aAErB4B,KAAK8tL,MAAM7gG,OAAOr/E,KAAKC,IAGnCvK,OAAO4xJ,aACKp8J,MAAM,kCAGJg1L,EAAOn1D,aACT7/H,MAAM,oBAGlBmpa,oBACYnpa,MAAM,mCAGHg1L,EAAOn1D,aACV7/H,MAAM,sCAGAg1L,EAAOn1D,aACb7/H,MAAM,wCAGEg1L,EAAOn1D,aACf7/H,MAAM,oBAGlB1R,OAAOkhN,aACKxvM,MAAM,oCAGFg1L,EAAOn+D,aACX72H,MAAM,qBAGjBg+G,WACQ,WAQX,MAAAovF,UAAyB83N,EACvBrxZ,YAAYqE,GACVuU,MAAM2+Y,EAAY,QAASlzZ,GAE3BhR,KAAKn5B,EAAIknN,EAAGsa,SAASr3L,EAAKnqC,GAAGonN,MAAMjuL,KAAKkuL,KACxCluL,KAAK1mB,EAAIy0M,EAAGsa,SAASr3L,EAAK13B,GAAG20M,MAAMjuL,KAAKkuL,KACxCluL,KAAKvzB,EAAIshN,EAAGsa,SAASr3L,EAAKvkC,GAAK,KAAKwhN,MAAMjuL,KAAKkuL,KAC/CluL,KAAKshX,GAAKthX,KAAKn5B,EAAEgoN,SAAW7uL,KAAKmqJ,KAAOnqJ,KAAKn5B,EAAEgxb,YAC/C73Z,KAAK0mL,GAAK1mL,KAAKulH,EAAEspE,SAAW7uL,KAAKmqJ,KAAOnqJ,KAAKulH,EAAEsyS,YAE/C73Z,KAAKomM,MAAQpmM,KAAKn5B,EAAEgoN,SACpB7uL,KAAKqmM,OAASrmM,KAAKn5B,EAAE0sC,GAAGvT,KAAKq+Z,MAAM7vO,UACnCxuL,KAAK8jM,KAAO9jM,KAAK/rG,EAAEg6R,MAAMjuL,KAAKkuL,KAC9BluL,KAAKmka,MAAQnka,KAAK94B,EAAEmuD,QACpBr1B,KAAKoka,UAAYpka,KAAK/rG,EAAEkzG,IAAInH,KAAK94B,IAAM,EACvC84B,KAAKqka,UAAW,EAEhBrka,KAAK++Z,UAAU/tZ,GAGjB+tZ,UAAU/tZ,UACRuU,MAAMw5Y,UAAU/tZ,GAGC,MAAbA,EAAKs1L,KACPtmM,KAAKsmM,KAAOg+N,EAAKj8N,SAASroM,KAAMgR,EAAKs1L,MAErCtmM,KAAKsmM,KAAOtmM,KAAKumM,mBAEdvmM,KAAK/rG,EAAE46R,WACV7uL,KAAKmka,MAAQnka,KAAK94B,EAAEo7E,IAAItiD,KAAK/rG,GAG7B+rG,KAAKqka,SAAWrka,KAAK94B,EAAEosL,IAAItzJ,KAAK/rG,GAAG+9R,KAAK,IAAM,GAGzChyL,yBAGWuka,EAAQC,EAAQ1tT,EAAQwlF,MAgC1CzjM,EAAO0ra,aAAkBx2O,GACzBl1L,EAAO2ra,aAAkBz2O,GACzBl1L,EAAOi+G,aAAkBi3E,GACzBl1L,EAAc,MAAPyjM,GAA8B,kBAARA,GAC7BzjM,GAAQ0ra,EAAO11O,WAAa21O,EAAO31O,UAE/B/3E,EAAO+3E,SAAAA,MAAAA,IACC/1L,MAAM,2BAEdyra,EAAO11O,SAAAA,OACH41O,EAAU3tT,SAMhBj+G,EAA0B,IAHf6ra,EAFAD,EAAQvO,OAAOsO,IAKhB9M,cAEF6M,EAAOlvY,QAASovY,EAAQpvY,YAG9BmvY,EAAO31O,SAAAA,OACH81O,EAAU7tT,EAEVo7E,EADKyyO,EAAQzO,OAAOqO,GACZj2O,aAGS,IAAnB4D,EAAGwlO,aACLxlO,EAAG+kO,UAEkB,IAAnB/kO,EAAGwlO,YAAgB,MAAA,IACX5+Z,MAAM,mCAEV6ra,EAAQtvY,QAASmvY,EAAOnvY,eAG5BsvY,EAAU7tT,EACV8tT,EAAKD,EAAQzO,OAAOqO,GACpBryO,EAAK0yO,EAAGt2O,aAEH,MAAPgO,EACEpK,EAAGslO,aAAel7N,GACpBpK,EAAG+kO,UAEkB,IAAnB/kO,EAAGwlO,aACLxlO,EAAG+kO,UAGgB,IAAnB/kO,EAAGwlO,YAAgB,MAAA,IACX5+Z,MAAM,kCAEZ+ra,EAAKD,EAAGhkO,OAAO1O,GACfrrN,EAAI09b,EAAO3jO,OAAOgkO,GAClBtrb,EAAIkrb,EAAO5jO,OAAOikO,UAExBhsa,EAAOhyB,EAAE0sC,GAAGoxZ,KAEJ99b,EAAGyS,GAGbwrb,OAAOluO,EAAI0F,UACF4J,EAAW6+N,aAAa/ka,KAAKn5B,EAAGm5B,KAAK1mB,EAAGs9M,EAAI0F,GAGrD0oO,MAAMn8O,EAAIyT,SAYDtuL,EAAG9xB,GAAK8jB,KAAKila,QAAQ3oO,GACtBhjN,EAAI4C,EAAE27a,YACNhxb,EAAImnC,EAAEgoZ,QAAQ,GAAGp1N,OAAOtnN,UAEpB,MAANuvM,EACKyiB,EAAUy5N,aAAal+b,EAAGyS,EAAGuvM,IAE9BhiN,EAAGyS,GAGb0za,SAASp2N,EAAI0F,SAWJtuL,EAAG9xB,GAAK8jB,KAAKila,QAAQ3oO,GACtBy/N,EAAK/tZ,EAAEgoZ,QAAQ,GACflgU,EAAK55G,EAAE85a,QAAQ,GACfnvb,EAAIk1b,EAAGv7N,OAAO1qG,GACdl4D,EAAIm+X,EAAGt7N,OAAO3qG,UAEV,MAAN8gG,EACKiV,EAAak5N,aAAal+b,EAAG+2D,EAAGg5J,IAEjC/vN,EAAG+2D,GAGbqnY,QAAQ38Q,GAkBNzvJ,EAAe,MAARyvJ,GAAgC,kBAATA,GAC9BzvJ,EAAOmH,KAAKynE,EAAEjlD,KAAK,IAAM,GACzB3pB,GAAQmH,KAAK/rG,EAAE46R,gBAETjhL,EAAI5N,KAAKyiM,IAAIjU,aAEftnN,UAGF0mC,EAAEygL,QAAQruL,KAAKyiM,SAGbv7N,EAAI84B,KAAK0lM,WAAW93L,EAAEynB,eACfthI,eAITmzE,EAAIA,EAAE0oN,IAAI5vL,KAAK/rG,IAEXizE,EAAEyoN,cAGDzoN,EAAE2mC,EAAEghL,qBAML7gL,EAAI9mC,EAAE0mC,EAEN1xB,EADK8xB,EAAEmgL,SACA6nO,QAAQ,GAAG3nO,QAAQruL,KAAKn5B,GAAGynN,iBAE5B,MAARhmC,GACEpsK,EAAEs7a,aAAelvQ,GACnBpsK,EAAE+6a,WAGEjpZ,EAAG9xB,GAGbgpb,QAAQr+b,EAAGyS,MA4BTuf,EAAOmH,KAAKn5B,EAAEgoN,WAAahoN,EAAEgoN,UAC7Bh2L,EAAOmH,KAAK1mB,EAAEu1M,WAAav1M,EAAEu1M,UAEzB7uL,KAAKn5B,EAAEgoN,SAAAA,OACHg2O,EAAK7ka,KAAK1mB,EAAE48a,OAAOl2Z,KAAKoga,MAAM9mb,IAE9B44M,EAAKwyO,EAAOG,GACZ3wU,EAAIg+F,EAAG5D,UACPkrO,EAAKtnO,EAAG0O,OAAO1sG,UAErBr7F,EAAO2ga,EAAGrrO,SAAS56K,GAAGsxZ,IACtBhsa,GAAQq7F,EAAE26F,WAEFqD,EAAIsnO,MAGVx5Z,KAAK1mB,EAAEu1M,SAAAA,OACH+1O,EAAK5ka,KAAKn5B,EAAEqvb,OAAOl2Z,KAAKoga,MAAMv5b,IAC9BqrN,EAAK0yO,EAAGt2O,UAGS,IAAnB4D,EAAGwlO,aACLxlO,EAAG+kO,gBAEC/iU,EAAIg+F,EAAG5D,UACPkrO,EAAKtnO,EAAG0O,OAAO1sG,UAErBr7F,EAAO2ga,EAAG54N,OAAO1sG,GAAG3gF,GAAGqxZ,IACvB/ra,GAAQq7F,EAAE26F,WAEFqD,EAAIsnO,SAGRoL,EAAK5ka,KAAKn5B,EAAEqvb,OAAOl2Z,KAAKoga,MAAMv5b,IAC9Bg+b,EAAK7ka,KAAK1mB,EAAE48a,OAAOl2Z,KAAKoga,MAAM9mb,IAC9B44M,EAAK0yO,EAAGt2O,UAETs2O,EAAGhkO,OAAO1O,GAAI3+K,GAAGsxZ,IACpB3yO,EAAG+kO,UAELp+Z,EAAO+ra,EAAGhkO,OAAO1O,GAAI3+K,GAAGsxZ,UAElB3wU,EAAIg+F,EAAG5D,UACPkrO,EAAKtnO,EAAG0O,OAAO1sG,UAErBr7F,GAAQq7F,EAAE26F,WAEFqD,EAAIsnO,GAGd2L,QAAQv3Z,EAAGC,SASHqkL,EAAKlyL,KAAKokH,EAAEx2G,EAAEsoZ,OAAOl2Z,KAAKoga,MAAMxyZ,IAChC4rZ,EAAKx5Z,KAAKokH,EAAEv2G,EAAEqoZ,OAAOl2Z,KAAKoga,MAAMvyZ,IAChCqmF,EAAIg+F,EAAG5D,iBAER4D,EAAG0O,OAAO1sG,GAAG3gF,GAAGimZ,IACnBtlU,EAAE+iU,UAEJp+Z,EAAOq5L,EAAG0O,OAAO1sG,GAAG3gF,GAAGimZ,IACvB3ga,GAAQq7F,EAAE26F,WAEFqD,EAAIsnO,GAGdsG,YAAYhyO,UACVj1L,EAAOi1L,aAAiBoY,GAEpBlmM,KAAKokH,EAAEurE,cAAgB7B,EAAM1pE,EAAEurE,aAC1B3vL,KAAKkla,QAAQp3O,EAAMjnN,EAAGinN,EAAMx0M,GAE9B0mB,KAAKmla,QAAQr3O,EAAM1pE,EAAEx2G,EAAGkgL,EAAM1pE,EAAEv2G,GAGzCkyZ,WAAWjyO,MACTj1L,EAAOi1L,aAAiBwd,GAEpBtrM,KAAKokH,EAAEurE,cAAgB7B,EAAM1pE,EAAEurE,aAAAA,OAC1B9oN,EAAGyS,GAAKw0M,EAAMg3O,gBACd9ka,KAAKkla,QAAQr+b,EAAGyS,WAGlBs0B,EAAAA,EAAGC,GAAKigL,EAAM1pE,EACfqkF,EAAK76L,EAAE4yL,OAAO1S,EAAMsJ,IAAIwJ,OAAO9S,EAAMs3O,IACrC18N,EAAK76L,EAAE+yL,OAAO9S,EAAMs3O,WAEnBpla,KAAKmla,QAAQ18N,EAAIC,GAG1Bs3N,cAAclyO,MACZj1L,EAAOi1L,aAAiB+d,GAEpB7rM,KAAKokH,EAAEurE,cAAgB7B,EAAM1pE,EAAEurE,aAAAA,OAC1B9oN,EAAGyS,GAAKw0M,EAAMg3O,gBACd9ka,KAAKkla,QAAQr+b,EAAGyS,WAGlBs0B,EAAAA,EAAGC,EAAAA,EAAG03G,GAAKuoE,EAAM1pE,EAClBszE,EAAK5J,EAAMjnN,EAAEmvb,QAAQ,GACrBqP,EAAKv3O,EAAMlwJ,EAAEo4X,QAAQ,GACrBsP,EAAMx3O,EAAMlwJ,EAAE6iK,OAAO3S,EAAMjnN,GAC3B0+b,EAAMF,EAAG5kO,OAAO3S,EAAMjnN,GACtB2+b,EAAM13O,EAAMlwJ,EAAE6iK,OAAO/I,GACrB+tO,EAAM53Z,EAAE2yL,OAAOj7E,GACfmgT,EAAM73Z,EAAE4yL,OAAOl7E,GACf2kF,EAAKq7N,EAAI3kO,OAAO/yL,GAAGwgL,QAAQm3O,EAAI5kO,OAAOr7E,IACtCg7S,EAAKmF,EAAI1P,QAAQ,IACjB7rN,EAAKm7N,EAAI1kO,OAAO6kO,GAAK7kO,OAAOr7E,GAC5BwyJ,EAAK2tJ,EAAI9kO,OAAOhzL,GAAGmoZ,SAAS,GAC5BrvO,EAAK65O,EAAG3/N,OAAOm3E,GAAI8/I,YACnBpvN,EAAKyB,EAAGtJ,OAAOm3E,GAAIn3E,OAAOla,GAC1BgiB,EAAKyB,EAAGvJ,OAAO2/N,GAAI3/N,OAAOla,UAEzB1mL,KAAKmla,QAAQ18N,EAAIC,GAG1BnC,iBAAiBhhO,EAAQ,MAMnBy6B,KAAK/rG,EAAE46R,UAAY7uL,KAAKokH,EAAEurE,aAAAA,OACrB,SAGJ3vL,KAAKomM,OAA6B,IAApBpmM,KAAK94B,EAAE4kR,MAAM,IAAgC,IAApB9rP,KAAK/rG,EAAE63V,MAAM,GAAO,OACvD,WAGFr9F,EAAIJ,GAAMruJ,KAAKgnM,cAAchnM,KAAK94B,GAGnCmkD,EAAAA,CAAQojI,EAAIJ,GAAY,EAAR9oL,GAAW0oN,MAAMjuL,KAAKkuL,MAGrCy3O,EAAIjwU,GAAM11F,KAAKgnM,cAAchnM,KAAK/rG,GAInCizE,EAAI84B,KAAKgvL,MAAMhvL,KAAKokH,EAAEx2G,EAAEgzL,OAAOv1K,GAAOrrB,KAAKokH,EAAEv2G,OAE/Cie,EAEA9rB,KAAKokH,EAAEwrE,IAAI+1O,GAAIpyZ,GAAGrsC,GACpB4kD,EAAS65Y,GAET9sa,EAAOmH,KAAKokH,EAAEwrE,IAAIl6F,GAAIniF,GAAGrsC,IACzB4kD,EAAS4pE,SAILwxG,EAAQlnM,KAAKonM,cAAct7K,GAG3Bw8K,EAAMtoM,KAAK4la,gBAAgB1+N,cAEtBo9N,EAAKj5Y,EAAMS,EAAQo7K,EAAOoB,GAGvCtB,cAAct1L,SA2CNw8K,EAAMx8K,IAAQ1R,KAAK94B,EAAI84B,KAAKkuL,IAAMH,EAAGgV,KAAKrxL,GAC1C2xL,EAAAA,IAAUtV,EAAG,GAAGE,MAAMC,GACtBmwO,EAAAA,IAAYtwO,EAAG,GAAGE,MAAMC,GACxBqwO,EAAKl7N,EAAIw0N,YAGThiU,EAAKwoU,EAAM7vO,SAASF,UAAUsS,OAAO29N,GAGrCzoU,EAAKD,EAAG24F,gBAGH34F,EAAG4qG,OAAO89N,GAAIl+N,UAGdvqG,EAAG2qG,OAAO89N,GAAIl+N,WAETj0M,KAAK2hM,EAAG5mL,KAG1BigM,cAAct7K,SAmBL+5Y,EAAI7uL,EAAI8uL,EAAKC,EAAKC,EAAKC,GAAOjma,KAAKkma,UAAUp6Y,GAG9CirK,EAAK+uO,EACLr3Q,EAAKs3Q,EAAInwO,MAKT/7I,EAAMgsX,EAAGzoO,MAAMhO,KAAK4nD,EAAG55C,OACvB6K,EAAM+9N,EAAI5oO,MAAMhO,KAAK62O,EAAI7oO,WAE3Bt5B,EAAIzV,SAEJx0G,EAAI1yC,IAAI8gM,IAAQ,GAClBnkC,EAAK+hQ,EACLx3Q,EAAK2oF,EAAGphD,QAER9xB,EAAKkiQ,EACL33Q,EAAK43Q,EAAIrwO,YAILuwO,EAAOpvO,EAAItoC,GAAAA,IACX03Q,EAAOriQ,EAAIzV,IAInB63Q,UAAUp6Y,GAKRjzB,EAAOizB,aAAkBiiK,GACzBl1L,GAAQizB,EAAOoiK,KACfr1L,EAAOizB,EAAOw8H,OAAS,GACvBzvJ,EAAOmH,KAAK/rG,EAAEq0P,OAAS,SAoCjB89Q,EAAQpma,KAAK/rG,EAAEiqS,MAAMl+L,KAAK/rG,EAAEg9Q,cAAgB,OAU9C40P,EAAI7uL,EAGJ8uL,EAAKC,EAKL7+b,EAhBAgtH,EAAIpoE,EACJg5C,EAAI9kE,KAAK/rG,EAAEohI,QACXiqK,EAAAA,IAASvR,EAAG,GACZyZ,EAAAA,IAASzZ,EAAG,GACZwR,EAAAA,IAASxR,EAAG,GACZ0Z,EAAAA,IAAS1Z,EAAG,GASZ5mN,EAAI,EACJmqB,EAAI,QAIA4iG,EAAE26F,UAAY1nN,EAAI,GAAA,OAClBmnC,EAAIw2D,EAAE0rV,IAAIt8T,GACVlmF,EAAI82D,EAAExzC,IAAIhjB,EAAEshL,IAAI17F,IAChBtmF,EAAI2xL,EAAGjuK,IAAIhjB,EAAEshL,IAAI0P,IACjBzxL,EAAI45L,EAAGn2K,IAAIhjB,EAAEshL,IAAI4X,IAGb,IAANl2M,GAAW0c,EAAE7G,IAAIi/Z,GAAS,IAC5BP,EAAK3+b,EACL8vQ,EAAK13C,EACLwmO,EAAM93Z,EACN+3Z,EAAMn4Z,EACNtc,EAAI,GAGNpqB,EAAI8mC,EACJ82D,EAAIovB,EACJA,EAAIlmF,EACJuxL,EAAKD,EACLA,EAAK1xL,EACL65L,EAAKD,EACLA,EAAK35L,EAEL1mC,GAAKmqB,EAIPuH,EAAa,IAANvH,EAAS,sCAOdu0a,EACA7uL,EACA8uL,EACAC,EAPUxmO,EACAD,GAYdsmO,gBAAgB1+N,GAkCdruM,EAAOgF,MAAM/gB,QAAQoqN,IACrBruM,EAAwB,IAAjBquM,EAAMjiO,QACb4zB,EAAOquM,EAAM,aAAci/N,GAC3Btta,EAAOquM,EAAM,aAAci/N,SAEpBv+N,EAAIC,GAAMX,EACXtpK,EAAIgqK,EAAG/gO,EAAE+oN,IAAIiY,EAAGvuN,GAAG+1M,KAAKuY,EAAGtuN,EAAEs2M,IAAIiY,EAAGhhO,IACpCuzJ,EAAOx8F,EAAEqzI,YACTwiI,EAAQr5K,GAAQ,IAEtBvhI,EAAO+kC,EAAErqB,GAAGvT,KAAK/rG,QAIb44W,EAAI5vF,EADJt4K,EAAQy1H,EAAOx0J,KAAKwhL,KAAKhtB,EAAO,GAAK,MAGrCq5K,IACF9uS,GAAiB,GAARA,GAEJA,EAAQy1H,IACbyyI,EAAKhlE,EAAGvuN,EAAE0kN,MAAMr5L,GAAOo6L,SAASnhK,GAChCq/I,EAAK2qB,EAAGtuN,EAAE0kN,MAAMr5L,GAAOo6L,SAASnhK,KAE5BivO,EAAGntE,KAAK9hK,GAAK,GAAKq/I,EAAGyiB,KAAK9hK,GAAK,KAIjCj5B,GADE8uS,EACO,GAEA,KAGT9uS,GAASy1H,EAAAA,MAAAA,IACDthI,MAAM,yCAEV6L,EAAOkoQ,EAAI5vF,GAGrB0qB,WAAWtzS,GA8CTwkG,EAAOxkG,aAAa05R,GACpBl1L,GAAQxkG,EAAE65R,KACVr1L,GAAQmH,KAAK/rG,EAAE46R,gBAER+Y,EAAIC,GAAM7nM,KAAKsmM,KAAKY,MAIrBlyG,EAAK6yG,EAAGvuN,EAAEs2M,IAAIv7R,GAAG0qS,SAAS/+L,KAAK/rG,GAC/BihM,EAAK0yG,EAAGtuN,EAAEs8M,MAAMhG,IAAIv7R,GAAG0qS,SAAS/+L,KAAK/rG,GAIrCmnF,EAAK45G,EAAG46F,IAAIgY,EAAG/gO,GACfihO,EAAK5yG,EAAG06F,IAAIiY,EAAGhhO,GACf0rM,EAAKv9E,EAAG0gG,OAAO9F,IAAIgY,EAAGtuN,GACtByuN,EAAK7yG,EAAG06F,IAAIiY,EAAGvuN,UAGVjlF,EAAEi9H,IAAIl2C,GAAIi0M,KAAKyY,GACfv1B,EAAG8c,KAAK0Y,IAMrBs+N,UAAUr3O,UACRn2L,EAAOm2L,aAAiBk1O,IAChBl1O,EAAOA,EAAM+W,YAGvBmC,gBAAgBxD,EAAQQ,GAOtBrsM,EAAOgF,MAAM/gB,QAAQ4nN,IACrB7rM,EAAOgF,MAAM/gB,QAAQooN,IACrBrsM,EAAO6rM,EAAOz/N,SAAWigO,EAAOjgO,QAChC4zB,EAAoB,MAAbmH,KAAKsmM,YAENljM,EAAMshM,EAAOz/N,OACbkjO,EAAAA,IAActqM,MAAY,EAANuF,GACpBglM,EAAAA,IAAcvqM,MAAY,EAANuF,WAEjBj8B,EAAI,EAAGA,EAAIi8B,EAAKj8B,IAAAA,OAChBiU,EAAI0sN,GAAM9nM,KAAKqma,UAAU3hO,EAAOv9N,KAChC61M,EAAI6U,GAAM7xL,KAAK2nM,WAAWzC,EAAO/9N,IAExCghO,EAAY,EAAJhhO,EAAQ,GAAKiU,EACrBgtN,EAAY,EAAJjhO,EAAQ,GAAK61M,EACrBmrB,EAAY,EAAJhhO,EAAQ,GAAK2gO,EACrBM,EAAY,EAAJjhO,EAAQ,GAAK0qN,SAGhB7xL,KAAKglM,YAAY,EAAGmD,EAASC,GAGtCk+N,MAAMpyU,WA4BG56G,EAAAA,EAAGisI,EAAAA,GAAG+7P,EAAAA,GAAI56L,EAAAA,IAAI+b,GAAOziM,KACtBopM,EAAK7jF,EAAE4oE,SACPm1M,EAAKhqZ,EAAEk1M,SAASoS,OAAO0gL,GACvBilD,EAAMjtb,EAAEsnN,OAAOla,GAAIka,OAAO0gL,GAC1BpvL,EAAKh+F,EAAEi6F,SACPy2O,EAAK1yO,EAAG/D,SACRnH,EAAKoiB,EAAGxI,OAAOgkO,GAAIv2O,QAAQ9oE,EAAEq7E,OAAO1O,IACpCvkB,EAAKqZ,EAAG6H,SAAW7H,EAAKA,EAAG6wO,YAC3Bv4N,EAAK3xB,EAAGkhB,SAAW03O,EAAMjjC,EAAG1iM,OAAO6B,EAAIjC,OAAO7yB,IAC9C4xB,EAAKh6E,EAAEq7E,OAAO1O,GAAI0O,OAAOtB,GACzBkI,EAAKxnM,KAAK0ga,QAAQphO,GAClBmI,EAAKznM,KAAK0ga,QAAQnhO,GAClBn0K,EAA2B,EAAnBo8K,EAAGqvN,cACXjpZ,EAAAA,CAAK0xL,EAAIC,GAAY,EAARn0K,GACbvd,EAAAA,CAAK25L,EAAIC,GAAY,EAARr8K,GAAWkjK,iBAE1BzgL,EAAE2pZ,aAAetjU,EAAEsjU,YACrB3pZ,EAAEopZ,UAEGj3Z,KAAKgvL,MAAMphL,EAAGC,GAGvB24Z,OAAOt/b,EAAGy2N,WA8BD92N,EAAAA,EAAGyS,EAAAA,EAAGisI,GAAKvlH,QACX4N,EAAAA,EAAGC,GAAK3mC,EACT8mC,EAAW,EAAP2vL,EACJ8oO,EAAO5/b,EAAEsnN,SAASyS,OAAOhzL,EAAEugL,UAC3Bu4O,EAAO7/b,EAAE+5N,OAAOtnN,GAAGsnN,OAAOhzL,GAAGmoZ,SAAS,GACtCntM,EAAMtvO,EAAE60M,SAAS6nO,QAAQ,GACzB2Q,EAAM9/b,EAAE+5N,OAAOhzL,GAAGygL,QAAQ/0M,GAC1B7M,EAAIg6b,EAAK73O,QAAQ83O,GAAM93O,QAAQg6B,GAAKt6B,UACpCksF,EAAKmsJ,EAAIlmO,OAAOh0N,GAAGwqb,UACnB76U,EAAKuqV,EAAInmO,OAAO/zN,GAAGwqb,UAInBr5X,EAAAA,CAHK+oY,EAAI/lO,OAAOr7E,GAAGwwS,SAAS,GACvBz8a,EAAEsnN,OAAOr7E,GAAGwwS,SAAS,IAEb/nZ,IAAM,GACnBkmF,EAFAjgM,CAAKumX,EAAIp+L,GAAQ,EAAJpuE,GAEP2oZ,WAAW/4X,UAEnBs2D,EAAEsjU,aAAe3pZ,EAAE2pZ,YACrBtjU,EAAE+iU,UAEG/iU,EAGT0yU,OAAO1yU,WAgCEznH,EAAAA,EAAG84I,EAAAA,GAAGmhE,EAAAA,GAAI63O,EAAAA,GAAIC,GAAMx+Z,KACrB6ma,EAAK7ma,KAAK0ga,QAAQn7S,GAClB2lF,EAAKszN,EAAG59N,OAAOla,EAAGyH,UAClB+D,EAAKh+F,EAAEi6F,SACPy2O,EAAK1yO,EAAG/D,SACRxgB,EAAKukB,EAAGsO,OAAOqmO,GACfC,EAAO50O,EAAG0O,OAAOjzB,GACjBC,EAAKk5P,EAAKj4O,SAAWi4O,EAAOA,EAAKjP,YACjC5wO,EAAK29O,EAAGhkO,OAAOhzB,GAAIgzB,OAAOn0N,GAC1By6M,EAAKvZ,EAAGwgB,SAASyS,OAAOjzB,GACxB2xB,EAAK7yN,EAAEg0N,OAAOl7E,GAAGq7E,OAAO29N,GAAI3vO,QAAQ3H,GACpCsY,EAAKtY,EAAGwZ,OAAOh0N,EAAE+zN,OAAOj7E,GAAGq7E,OAAO29N,IAClC5vO,EAAKppE,EAAEk7E,OAAOvZ,EAAG0Z,OAAOhzB,GAAIgzB,OAAOsK,IACnC1D,EAAKxnM,KAAK0ga,QAAQphO,GAClBmI,EAAKznM,KAAK0ga,QAAQnhO,GAClBwnO,EAAK/ma,KAAK0ga,QAAQ/xO,GAGlBxnN,EAmnMV,SAAaymC,EAAGC,OAEVG,EAAIJ,EAAIC,EAERG,EAAI,IACFH,EAAI,EACNG,GAAKH,EAELG,GAAKH,UAGFG,EA9nMKs0C,GAFqB,EAAjBklJ,EAAGkwN,aAEM,IADO,EAAjBjwN,EAAGiwN,aACkB,UAC5B9pZ,CAAK0xL,EAAIC,EAAI5Q,GAAIxnN,GACjB0mC,CAAK25L,EAAIC,EAAIs/N,GAAI5/b,IAKzB6/b,MAAM9yU,SACGtmF,EAAGu8L,GAAMnqM,KAAK4ma,OAAO1yU,GACtBrmF,EAAIs8L,EAAG7b,iBAETzgL,EAAE2pZ,aAAetjU,EAAEsjU,YACrB3pZ,EAAEopZ,UAEGj3Z,KAAKgvL,MAAMphL,EAAGC,GAGvBo5Z,OAAO//b,EAAGy2N,WA6CDrkN,EAAAA,EAAG7M,EAAAA,EAAG84I,EAAAA,KAAG4kC,EAAAA,IAAMk5C,GAAOrjM,QACtB4N,EAAAA,EAAGC,GAAK3mC,EACT8mC,EAAW,EAAP2vL,EACJyL,EAAK7jF,EAAE4oE,SACP+c,EAAK9B,EAAGxI,OAAOr7E,GACf2hT,EAAK99N,EAAGjb,SACR04O,EAAK37N,EAAG1K,OAAOlnN,GACf6tb,EAAMN,EAAG7Q,QAAQ,GACjB9rN,EAAKt8L,EAAEugL,SACPi5O,EAAMx5Z,EAAEooZ,QAAQ,GAAG3nO,QAAQ9oE,GAC3B8hT,EAAMz5Z,EAAEgzL,OAAOwI,GACf0e,EAAKr7O,EAAEg0N,OAAO2mO,GACdpyU,EAAKvoH,EAAE+zN,OAAO4mO,GACdpgP,EAAKkjB,EAAGtJ,OAAOwI,GAAI/a,QAAQ64O,GAAInR,SAAS,GACxCpoP,EAAK//J,EAAEgzL,OAAOsK,GAAI6qN,SAAS,IAC3BnoP,EAAKi5P,EAAGjmO,OAAOhzL,EAAE6yL,OAAOl7E,IAAIwwS,SAAS,IAErC7uO,GADKl5K,GAAK,EAAIg5K,EAAG4H,QAAQjhB,GAAI0gB,QAAQzgB,GAAI0gB,UAAYnkC,GAC7Cy2C,OAAOr7E,GACf4hE,EAAK+jB,EAAGtc,QAAQy4O,GAAKtR,SAAS,GAAGnnO,QAAQu4O,GACzC3sJ,EAAKqsJ,EAAGjmO,OAAOknB,GACf1rI,EAAKyqV,EAAGjmO,OAAO5rG,GACf3Y,EAAK8qG,EAAGqZ,OAAOtZ,GACfogP,EAAKngP,EAAGsZ,OAAOvZ,GAGftpJ,EAAAA,CAAKo3D,EAAI8yH,EAFJzkB,EAAAA,GAEgBr1L,GACrBkmF,EAFAjgM,CAAKumX,EAAIp+L,EAAIC,EAAIirV,GAAIt5Z,GAEf2oZ,WAAW/4X,IAChBmvL,GAAM/sN,KAAK4ma,OAAO1yU,OAEpB64H,EAAGx5M,GAAG3F,GAAAA,MAAAA,IACC9U,MAAM,yBAEdo7F,EAAEsjU,aAAe3pZ,EAAE2pZ,YACrBtjU,EAAE+iU,UAEG/iU,EAGT+rU,qBACSp5b,EAAAA,EAAGyS,GAAK0mB,KAETo3L,EADKvwN,EAAEsnN,SACCyS,OAAO/5N,UACVyS,EAAE60M,SACA6nO,QAAQ,IAAI3nO,QAAQ+I,EAAG4+N,QAAQ,IAGlCnnO,SAGZqxO,eAGSr5b,EAAAA,EAAGyS,GAAK0mB,KAETo3L,EADKvwN,EAAEsnN,SACCyS,OAAO/5N,GACfwnL,EAAK/0K,EAAE60M,SACPnH,EAAKoQ,EAAG4+N,QAAQ,GAChBn8W,EAAMmtI,EAAGgvO,QAAQ,MACjB/tN,EAAM55C,EAAG2nQ,QAAQ,IAAI3nO,QAAQrH,MAE/BihB,EAAIpZ,SAAAA,MAAAA,IACI/1L,MAAM,iCAGX+gD,EAAIq8W,OAAOjuN,GAAK5H,UAGzBrR,MAAMphL,EAAGC,cACIq2Z,EAAWlka,KAAM4N,EAAGC,GAGjC22L,OAAO52L,EAAGC,EAAG03G,cACAshF,EAAO7mM,KAAM4N,EAAGC,EAAG03G,GAGhCk7S,OAAO5yZ,MACLhV,EAAOgV,aAAakgL,IAEf/tL,KAAKn5B,EAAEgoN,SAAAA,MAAAA,IACA/1L,MAAM,2BAMXyua,EAHI15Z,EAAEsgL,SACCsS,OAAOzgM,KAAK1mB,IAK5Bonb,QAAQ9yZ,GAGN/U,EAAO+U,aAAamgL,SAId0Z,EADK75L,EAAEugL,SAASyS,OAAOhzL,GACfygL,QAAQruL,KAAK1mB,UAEtB0mB,KAAKomM,QAEJpmM,KAAKqmM,OACPoB,EAAGpZ,QAAQzgL,EAAEooZ,SAAS,IAEtBvuN,EAAGpZ,QAAQruL,KAAKn5B,EAAE+5N,OAAOhzL,KAGtB65L,EAGTxrE,SAAS+yD,MACPn2L,EAAOm2L,aAAiBk1O,GAEpBl1O,EAAM4X,IAAAA,OACD,UAEFh5L,EAAAA,EAAGC,GAAKmhL,EACTyY,EAAKznM,KAAK0ga,QAAQ9yZ,UAEjBC,EAAEsgL,SAAS56K,GAAGk0L,GAGvB/B,WAAW93L,EAAG06I,EAAO,MACnBzvJ,EAAO+U,aAAamgL,GACpBl1L,EAAe,MAARyvJ,GAAgC,kBAATA,GAEzB16I,EAAEsgL,MACLtgL,EAAIA,EAAEqgL,MAAMjuL,KAAKkuL,YAEbrgL,EAAI7N,KAAK2ga,OAAO/yZ,MAEV,MAAR06I,EAAQ,IACNtoJ,KAAKynE,EAAEuqH,KAAK,GAAK,GACfnkL,EAAEghL,UAAYvmC,EAAAA,MAAAA,IACNxvJ,MAAM,kBAGhB+U,EAAE2pZ,aAAelvQ,GACnBz6I,EAAEopZ,iBAGCj3Z,KAAKgvL,MAAMphL,EAAGC,GAGvBu+L,WAAWv+L,EAAGtoC,EAAQ,GACpBszB,EAAOgV,aAAakgL,GACpBl1L,EAAQtzB,IAAU,IAAOA,GAEpBsoC,EAAEqgL,MACLrgL,EAAIA,EAAEogL,MAAMjuL,KAAKkuL,YAEbs5O,EAASxna,KAAKyga,OAAO5yZ,MAEvBtoC,GAASiic,EAAOvic,OAAAA,MAAAA,IACR6zB,MAAM,qCAEZ8U,EAAI45Z,EAAOjic,UAEVy6B,KAAKgvL,MAAMphL,EAAGC,GAGvBgxZ,aAAa/wO,MAGXj1L,EAAOi1L,aAAiBkwO,IAEnBlwO,EAAM5mN,EAAEqsC,GAAGvT,KAAK94B,GAAAA,OACZ,MAELgrN,EAAIsnO,OAELtnO,EAAIsnO,GAAMx5Z,KAAK2+Z,OAAO7wO,SAChB/5R,UACA,KAIU,UAAf+5R,EAAMhnN,KAAS,OAEXD,EAAIm5B,KAAKoga,MAAMtyO,EAAMjnN,GAAG+5N,OAAO1O,EAAG/D,UAClC70M,EAAI0mB,KAAKoga,MAAMtyO,EAAMx0M,GAAGsnN,OAAO44N,EAAGrrO,iBAEjCnuL,KAAKn5B,EAAE0sC,GAAG1sC,IAAMm5B,KAAK1mB,EAAEi6B,GAAGj6B,MAIhB,SAAfw0M,EAAMhnN,KAAS,UAEVswN,EAAAA,GAAIguO,GAAMt3O,EACXlgL,EAAI5N,KAAKoga,MAAMhpO,EAAGwJ,OAAOwkO,IAAKxkO,OAAO1O,UAChClyL,KAAK0ga,QAAQ9yZ,GAEdihL,YAIO,YAAff,EAAMhnN,KAAS,OAEX8mC,EAAI5N,KAAKoga,MAAMtyO,EAAM25O,KAAK7mO,OAAO1O,UAC5BlyL,KAAK0ga,QAAQ9yZ,GAEdihL,gBAGL,EAGTiwO,YAAYhxO,UACVj1L,EAAOi1L,aAAiBkwO,IACjB,EAGT4C,eAAe5xO,MAGbn2L,EAAOm2L,aAAiBk1O,GAEpBlka,KAAK6+Z,aAAa7vO,EAAMlB,OAAAA,IAOtBkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,cAEPkD,EAAIsnO,GAAMx5Z,KAAK2+Z,OAAO3vO,EAAMlB,OAC7BlgL,EAAI5N,KAAKoga,MAAMpxO,EAAMphL,GACrBC,EAAI7N,KAAKoga,MAAMpxO,EAAMnhL,GACrB46L,EAAK76L,EAAEgzL,OAAO1O,GACdwW,EAAK76L,EAAE+yL,OAAO44N,UAEbx5Z,KAAKgvL,MAAMyZ,EAAIC,aAGd5vM,MAAM,oBAGlBg1Z,cAAc9+N,MAGZn2L,EAAOm2L,aAAiB04O,GAEpB1na,KAAK6+Z,aAAa7vO,EAAMlB,OAAAA,IAOtBkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,iBAEPoI,EAAAA,GAAIguO,GAAMp2O,EAAMlB,OAChBoE,EAAIsnO,GAAMx5Z,KAAK2+Z,OAAO3vO,EAAMlB,OAC7B2a,EAAKzZ,EAAMphL,EAAE4yL,OAAOpJ,GAAIwJ,OAAOwkO,GAC/B18N,EAAK1Z,EAAMnhL,EAAE+yL,OAAOwkO,UAEnBpla,KAAKgvL,MAAMhvL,KAAKoga,MAAM33N,GAAI7H,OAAO1O,GACtBlyL,KAAKoga,MAAM13N,GAAI9H,OAAO44N,cAGhC1ga,MAAM,oBAGlB80Z,iBAAiB5+N,MAEfn2L,EAAOm2L,aAAiB24O,GAEpB3na,KAAK6+Z,aAAa7vO,EAAMlB,OAAAA,SAcnBjnN,EAAAA,EAAG+2D,EAAAA,IAAG6pY,GAAOz4O,EAAMlB,OACnBoE,EAAIsnO,GAAMx5Z,KAAK2+Z,OAAO3vO,EAAMlB,UAE/BkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,WAEVA,EAAMphL,EAAEihL,SAAAA,OACJjhL,EAAI5N,KAAKoga,MAAMqH,GAAK7mO,OAAO1O,UAC1BlyL,KAAKgvL,MAAMphL,EAAG5N,KAAKmqJ,cAGrBv8I,EAAAA,EAAGC,EAAAA,EAAG03G,GAAKypE,EACZ0I,EAAK7wN,EAAEmvb,QAAQ,GACfqP,EAAKznY,EAAEo4X,QAAQ,GACfsP,EAAM1nY,EAAE6iK,OAAO55N,GACf0+b,EAAMF,EAAG5kO,OAAO55N,GAChB2+b,EAAM5nY,EAAE6iK,OAAO/I,GACf+tO,EAAM53Z,EAAE2yL,OAAOj7E,GACfmgT,EAAM73Z,EAAE4yL,OAAOl7E,GACf2kF,EAAKq7N,EAAI3kO,OAAO/yL,GAAGwgL,QAAQm3O,EAAI5kO,OAAOr7E,IACtCg7S,EAAKmF,EAAI1P,QAAQ,IACjB7rN,EAAKm7N,EAAI1kO,OAAO6kO,GAAK7kO,OAAOr7E,GAC5BwyJ,EAAK2tJ,EAAI9kO,OAAOhzL,GAAGmoZ,SAAS,UAE3B/1Z,KAAKsga,OAAOtga,KAAKoga,MAAMl2N,GAAItJ,OAAO1O,GACtBlyL,KAAKoga,MAAMG,GACXvga,KAAKoga,MAAMj2N,GAAIvJ,OAAO44N,GACtBx5Z,KAAKoga,MAAMroJ,cAGtBj/Q,MAAM,oBAGlBm1Z,iBAAiB/5T,MACfr7F,EAAOq7F,aAAa65F,GAGhB/tL,KAAKulH,EAAEspE,UAAY7uL,KAAK1mB,EAAEu1M,SAAAA,MAAAA,IAClB/1L,MAAM,wBAGbkH,KAAKn5B,EAAEgoN,SAAAA,OACH7uL,KAAKsma,MAAMpyU,OAGfl0F,KAAKvzB,EAAEoiN,SAAAA,OACH7uL,KAAKgna,MAAM9yU,aAEVp7F,MAAM,oBAGlBs1Z,eAAelnb,EAAGy2N,MAYhB9kM,EAAO3xB,aAAag9b,GACpBrra,EAAQ8kM,IAAS,IAAOA,GAGpB39L,KAAKulH,EAAEspE,UAAY7uL,KAAK1mB,EAAEu1M,SAAAA,MAAAA,IAClB/1L,MAAM,uBAGd5xB,EAAEyoN,aAAAA,MAAAA,IACM72L,MAAM,wBAGZ3xB,GAAMw2N,IAAS,EAAK,IAAM39L,KAAK0+Z,QAAQz5b,OACvCqpC,EAAIpnC,EAAE8X,IAAIghB,KAAK0+Z,QAAQv3b,WAEtBygc,GAAW,SAEX5na,KAAKn5B,EAAEgoN,SAAAA,OACH7uL,KAAKwma,OAAOl4Z,EAAGqvL,OAGnB39L,KAAKvzB,EAAEoiN,SAAAA,OACH7uL,KAAKina,OAAO34Z,EAAGqvL,aAEd7kM,MAAM,uBAIpBqoa,OAAOz8N,EAAQQ,UACN3/K,MAAM47Y,OAAOz8N,EAAQQ,GAAQP,MAGtC68N,YAAY98N,SACJ3jK,EAAM/gC,KAAKsha,aAAa58N,WAErBv9N,EAAI,EAAGA,EAAI45D,EAAI97D,OAAQkC,IAC9B45D,EAAI55D,GAAK45D,EAAI55D,GAAGw9N,aAEX5jK,EAGT0kK,YAAY9sE,UACHurS,EAAW9/Z,OAAOpE,KAAM24H,GAGjCspS,QAAQjzO,UACNn2L,EAAOm2L,aAAiB0X,GACjB1X,EAAMizO,UAGfC,WAAWvpS,UACFurS,EAAWhC,WAAWlia,KAAM24H,GAGrCwpS,aAAaxpS,UACJurS,EAAW/B,aAAania,KAAM24H,GAGvCypS,QAAQxrO,EAAI0F,EAAKh0C,EAAO,YACfzhL,EAAGyS,GAAK0mB,KAAK8ka,OAAOluO,EAAI0F,GAEzBxO,EAAAA,IAAYoY,EAAAA,CAChBhY,IAAKluL,KAAKkuL,IACV9/J,MAAOpuB,KAAKouB,MACZlnD,EAAG84B,KAAK94B,EACRL,EAAGA,EACHyS,EAAGA,EACHrlF,EAAG+rG,KAAK/rG,EACRwzK,EAAGznE,KAAKynE,OAGE,MAAR6gF,EAAQ,QACDkxQ,GAAM1rO,EAAM6wO,OAAO3+Z,MAExBw5Z,EAAGhC,aAAelvQ,GACpBkxQ,EAAGvC,UAGFj3Z,KAAKokH,EAAEurE,eACV7B,EAAM1pE,EAAI0pE,EAAM8yO,eAAe5ga,KAAKokH,YAE7Bj9I,EAAI,EAAGA,EAAI64B,KAAKynE,EAAEjlD,KAAK,GAAIr7C,IAClC2mN,EAAM4wO,QAAQv3b,GAAK2mN,EAAM8yO,eAAe5ga,KAAK0+Z,QAAQv3b,WAEhD2mN,EAGTu0O,OAAOx5O,EAAIyT,EAAKh0C,EAAO,YACdzhL,EAAGyS,GAAK0mB,KAAKgla,MAAMn8O,EAAIyT,GAExBxO,EAAAA,IAAYwd,EAAAA,CAChBpd,IAAKluL,KAAKkuL,IACV9/J,MAAOpuB,KAAKouB,MACZlnD,EAAG84B,KAAK94B,EACRL,EAAGA,EACHyS,EAAGA,EACHrlF,EAAG+rG,KAAK/rG,EACRwzK,EAAGznE,KAAKynE,OAGE,MAAR6gF,EAAQ,QACDkxQ,GAAMx5Z,KAAK2+Z,OAAO7wO,GAEvB0rO,EAAGhC,aAAelvQ,GACpBkxQ,EAAGvC,UAGFj3Z,KAAKokH,EAAEurE,eACV7B,EAAM1pE,EAAI0pE,EAAM8yO,eAAe5ga,KAAKokH,YAE7Bj9I,EAAI,EAAGA,EAAI64B,KAAKynE,EAAEjlD,KAAK,GAAIr7C,IAClC2mN,EAAM4wO,QAAQv3b,GAAK2mN,EAAM8yO,eAAe5ga,KAAK0+Z,QAAQv3b,WAEhD2mN,EAGTw0O,UAAU1rO,EAAI0F,EAAKh0C,EAAO,YACjBzhL,EAAG+2D,GAAK59B,KAAKgtZ,SAASp2N,EAAI0F,GAE3BxO,EAAAA,IAAY+d,EAAAA,CAChB3d,IAAKluL,KAAKkuL,IACV9/J,MAAOpuB,KAAKouB,MACZlnD,EAAG84B,KAAK94B,EACRL,EAAGA,EACH+2D,EAAGA,EACH3pI,EAAG+rG,KAAK/rG,EACRwzK,EAAGznE,KAAKynE,OAGE,MAAR6gF,EAAQ,QACDkxQ,GAAMx5Z,KAAK2+Z,OAAO7wO,GAEvB0rO,EAAGhC,aAAelvQ,GACpBkxQ,EAAGvC,aAGFj3Z,KAAKokH,EAAEurE,eACV7B,EAAM1pE,EAAI0pE,EAAM8yO,eAAe5ga,KAAKokH,GACpC0pE,EAAM1pE,EAAEv+G,aAGNioL,EAAMqyO,qBACCh5b,EAAI,EAAGA,EAAI64B,KAAKynE,EAAEjlD,KAAK,GAAIr7C,IAClC2mN,EAAM4wO,QAAQv3b,GAAK2mN,EAAM8yO,eAAe5ga,KAAK0+Z,QAAQv3b,IACrD2mN,EAAM4wO,QAAQv3b,GAAG0+B,mBAIdioL,EAGTwV,cAAc3zE,UACLu0S,EAAW77N,SAASroM,KAAM2vH,GAGnCvoI,OAAOkhN,SACC34E,EAAOpqG,MAAMn+B,OAAOkhN,UAE1B34E,EAAK9oJ,EAAIm5B,KAAKn5B,EAAEw5N,UAAUj5M,SAC1BuoI,EAAKr2I,EAAI0mB,KAAK1mB,EAAE+mN,UAAUj5M,SAErB4Y,KAAKvzB,EAAEoiN,WACVl/D,EAAKljJ,EAAIuzB,KAAKvzB,EAAE4zN,UAAUj5M,UAErBuoI,GAQX,MAAAu0S,UAAyBx9N,EACvB/5L,YAAYmhL,EAAOlgL,EAAGC,GACpBhV,EAAOi1L,aAAiBoY,GAExB3gL,MAAMuoK,EAAOr8K,GAEbzR,KAAK4N,EAAI5N,KAAK8tL,MAAM3jC,KACpBnqJ,KAAK6N,EAAI7N,KAAK8tL,MAAM3jC,KACpBnqJ,KAAK4mM,KAAM,EAEF,MAALh5L,GACF5N,KAAK+hK,MAAMn0J,EAAGC,GAGlBk0J,MAAMn0J,EAAGC,GACPhV,EAAO+U,aAAamgL,GACpBl1L,EAAOgV,aAAakgL,GAEpB/tL,KAAK4N,EAAIA,EACT5N,KAAK6N,EAAIA,EAEJ7N,KAAK4N,EAAEsgL,MACVluL,KAAK4N,EAAI5N,KAAK4N,EAAEqgL,MAAMjuL,KAAK8tL,MAAMI,MAE9BluL,KAAK6N,EAAEqgL,MACVluL,KAAK6N,EAAI7N,KAAK6N,EAAEogL,MAAMjuL,KAAK8tL,MAAMI,MAEnCluL,KAAK4mM,KAAM,EAGbb,eACO/lM,KAAK8tL,MAAMwY,KAAAA,OACP,QAELtmM,KAAKsoM,KAAOtoM,KAAKsoM,IAAIj9K,KAAAA,OAChBrrB,KAAKsoM,IAAIj9K,WASZw8Y,EAAK7na,KAAK4N,EAAEgzL,OAAO5gM,KAAK8tL,MAAMwY,KAAKj7K,MACnCA,EAAOrrB,KAAK8tL,MAAMkB,MAAM64O,EAAI7na,KAAK6N,UAEnC7N,KAAKsoM,MACPj9K,EAAKi9K,IAAMtoM,KAAKsoM,IAAIl+N,KAAK4kN,UACjB64O,EAAK74O,EAAMphL,EAAEgzL,OAAO5gM,KAAK8tL,MAAMwY,KAAKj7K,aACnCrrB,KAAK8tL,MAAMkB,MAAM64O,EAAI74O,EAAMnhL,MAGpC7N,KAAKsoM,IAAIj9K,KAAOA,GAGXA,EAGTs0Y,SAAS3wO,MACPn2L,EAAOm2L,aAAiBk1O,GAEpBlka,KAAK4mM,KAAO5X,EAAM4X,IAAAA,OACbrhL,MAAMo6Y,SAAS3wO,SAGlBqW,EAAAA,CACJrlM,KACA,KACA,KACAgvL,UAIEhvL,KAAK6N,EAAE0F,GAAGy7K,EAAMnhL,IAClBw3L,EAAK,GAAKrlM,KAAKhhB,IAAIgwM,GACnBqW,EAAK,GAAKrlM,KAAKslM,MAAMh0K,IAAI09J,IAChBhvL,KAAK6N,EAAE0F,GAAGy7K,EAAMnhL,EAAE2gL,WAC3B6W,EAAK,GAAKrlM,KAAKslM,MAAMtmN,IAAIgwM,GACzBqW,EAAK,GAAKrlM,KAAKsxB,IAAI09J,KAEnBqW,EAAK,GAAKrlM,KAAKslM,MAAMtmN,IAAIgwM,GACzBqW,EAAK,GAAKrlM,KAAKslM,MAAMh0K,IAAI09J,IAGpBqW,EAGThwK,eACMr1B,KAAK4mM,IACA5mM,KAAK8tL,MAAMkB,QAEbhvL,KAAK8tL,MAAMkB,MAAMhvL,KAAK4N,EAAG5N,KAAK6N,GAGvC0zZ,MAAM16b,UACGm5B,KAAKslM,MAAMi8N,MAAM16b,GAG1B+uN,aAEM51L,KAAK4mM,IACA5mM,KAGFA,KAAK8tL,MAAMkB,MAAMhvL,KAAK4N,EAAG5N,KAAK6N,EAAE2gL,UAGzCxvM,IAAI9X,MAUF2xB,EAAO3xB,aAAag9b,GAGhBlka,KAAK4mM,IAAAA,OACA1/N,KAGLA,EAAE0/N,IAAAA,OACG5mM,QAGLA,KAAK4N,EAAE2F,GAAGrsC,EAAE0mC,UAET5N,KAAK6N,EAAE0F,GAAGrsC,EAAE2mC,GAIV7N,KAAKimM,MAHHjmM,KAAK8tL,MAAMkB,WAOlBhvL,KAAK6N,EAAE0F,GAAGrsC,EAAE2mC,GAAAA,OAER46L,EAAKzoM,KAAK4N,EAAE4gL,SAASI,QAAQ1nN,EAAE0mC,GAG/B86L,EAAK1oM,KAAK6N,EAAE2gL,gBAGXxuL,KAAK8tL,MAAMkB,MAAMyZ,EAAIC,SAIxBjhI,EAAIznE,KAAK4N,EAAE6yL,OAAOv5N,EAAE0mC,GAMpB7kB,EAHIiX,KAAK6N,EAAE4yL,OAAOv5N,EAAE2mC,GAGdqoZ,OAAOzuV,GAGbghI,EAAK1/M,EAAEolM,SAASS,QAAQ5uL,KAAK4N,GAAGghL,QAAQ1nN,EAAE0mC,GAG1C86L,EAAK3/M,EAAE63M,OAAO5gM,KAAK4N,EAAE6yL,OAAOgI,IAAK7Z,QAAQ5uL,KAAK6N,UAE7C7N,KAAK8tL,MAAMkB,MAAMyZ,EAAIC,GAG9BzC,SAYMjmM,KAAK4mM,IAAAA,OACA5mM,QAGLA,KAAK6N,EAAEghL,SAAAA,OACF7uL,KAAK8tL,MAAMkB,cAMd9vM,EAHK8gB,KAAK4N,EAAEugL,SAGL4nO,SAAS,GAAG1nO,QAAQruL,KAAK8tL,MAAMjnN,GAGtC0+I,EAAIvlH,KAAK6N,EAAEmoZ,QAAQ,GAGnBjta,EAAI7J,EAAEg3a,OAAO3wS,GAGbkjF,EAAK1/M,EAAEolM,SAASS,QAAQ5uL,KAAK4N,GAAGghL,QAAQ5uL,KAAK4N,GAG7C86L,EAAK3/M,EAAE63M,OAAO5gM,KAAK4N,EAAE6yL,OAAOgI,IAAK7Z,QAAQ5uL,KAAK6N,UAE7C7N,KAAK8tL,MAAMkB,MAAMyZ,EAAIC,GAG9B3D,KAAK1lE,UACIr/H,KAAKslM,MAAMP,KAAK1lE,GAAKslE,MAG9B9T,UACM7wL,KAAK4mM,IAAAA,MAAAA,IACG9tM,MAAM,yBAEXkH,KAAK4N,EAAEyyL,UAGhBvP,UACM9wL,KAAK4mM,IAAAA,MAAAA,IACG9tM,MAAM,yBAEXkH,KAAK6N,EAAEwyL,UAGhB9sL,GAAGrsC,UACD2xB,EAAO3xB,aAAag9b,GAGhBlka,OAAS94B,IAIT84B,KAAK4mM,IACA1/N,EAAE0/N,KAGP1/N,EAAE0/N,MAIC5mM,KAAK4N,EAAE2F,GAAGrsC,EAAE0mC,IACZ5N,KAAK6N,EAAE0F,GAAGrsC,EAAE2mC,KAGrB1G,IAAI6nL,UACFn2L,EAAOm2L,aAAiBk1O,GAEpBlka,KAAK4mM,MAAQ5X,EAAM4X,KACb,GAEL5mM,KAAK4mM,KAAO5X,EAAM4X,IACd,EAEL5mM,KAAK4mM,KAAO5X,EAAM4X,IACb,EAEF5mM,KAAK2ja,QAAQx8Z,IAAI6nL,EAAM20O,UACvB3ja,KAAK6wL,OAAO1pL,IAAI6nL,EAAM6B,SACtB7wL,KAAK8wL,OAAO3pL,IAAI6nL,EAAM8B,QAG/BnB,oBAGS3vL,KAAK4mM,IAGd08N,kBACMtja,KAAK4mM,KAGF5mM,KAAK6N,EAAEghL,SAGhBN,eACMvuL,KAAK4mM,KAGF5mM,KAAK6N,EAAE2pZ,WAGhBr8O,gBACMn7K,KAAK4mM,KAGF5mM,KAAK6N,EAAE4pZ,YAGhB/F,kBACM1xZ,KAAK4mM,MAGsB,IAAxB5mM,KAAK6N,EAAE6pZ,YAGhB6L,IAAI31Z,UACF/U,EAAO+U,aAAamgL,GACpBl1L,GAAQ+U,EAAEsgL,MAENluL,KAAK4mM,KAGF5mM,KAAK6wL,OAAOt9K,GAAG3F,GAGxB41Z,IAAI51Z,UACF/U,EAAO+U,aAAamgL,GACpBl1L,GAAQ+U,EAAEsgL,KACVr1L,GAAQmH,KAAK8tL,MAAM75R,EAAE46R,WAEjB7uL,KAAK4mM,KAGF5mM,KAAK6wL,OAAOmR,KAAKhiM,KAAK8tL,MAAM75R,GAAGs/G,GAAG3F,GAG3CgiL,IAAIv7R,UACKkxH,MAAMqqK,IAAIv7R,GAAGswS,MAGtBxH,KAAK9oS,UACIkxH,MAAM43K,KAAK9oS,GAAGswS,MAGvBgpN,SAASt5f,EAAGk/Q,UACHhuJ,MAAMooY,SAASt5f,EAAGk/Q,GAAKoxB,MAGhCkE,OAAO7rB,EAAI8qB,EAAIjW,UACNtsK,MAAMsjL,OAAO7rB,EAAI8qB,EAAIjW,GAAI8S,MAGlCm8N,cACSv7Y,MAAMu7Y,OAAOn8N,MAGtBrxC,IAAIj/P,UACKkxH,MAAM+tI,IAAIj/P,GAAGswS,MAGtB7F,KAAKzqS,UACIkxH,MAAMu5K,KAAKzqS,GAAGswS,MAGvBq/N,cACSz+Y,MAAMy+Y,OAAOr/N,MAGtBA,aACS3kM,KAGTslM,aAEMtlM,KAAK4mM,IACA5mM,KAAK8tL,MAAM0W,SAGbxkM,KAAK8tL,MAAM0W,OAAOxkM,KAAK4N,EAAG5N,KAAK6N,EAAG7N,KAAK8tL,MAAM2U,KAGtDn/L,OAAO4xJ,GAEU,MAAXA,IACFA,GAAU,GAEZr8J,EAA0B,kBAAZq8J,mBAEPg4P,GAAaltZ,KAAK8tL,SAGrB9tL,KAAK4mM,IAAAA,MAAAA,IACG9tM,MAAM,qBAGdo8J,EAAAA,OACIhuL,EAAI+7K,EAAOO,MAAM,EAAI0pQ,GACrBt/Y,EAAI5N,KAAK8tL,MAAMmhO,YAAYjvZ,KAAK6wL,eAEtC3pN,EAAE,GAAK,EAAO84B,KAAK6N,EAAE2pZ,WACrB5pZ,EAAE3wG,KAAKiqE,EAAG,GAEHA,QAIHA,EAAI+7K,EAAOO,MAAM,EAAgB,EAAZ0pQ,GACrBt/Y,EAAI5N,KAAK8tL,MAAMmhO,YAAYjvZ,KAAK6wL,QAChChjL,EAAI7N,KAAK8tL,MAAMmhO,YAAYjvZ,KAAK8wL,eAEtC5pN,EAAE,GAAK,EACP0mC,EAAE3wG,KAAKiqE,EAAG,GACV2mC,EAAE5wG,KAAKiqE,EAAG,EAAIgmb,GAEPhmb,gBAGK4mN,EAAOn1D,GAEnB9/H,EAAOi1L,aAAiBoY,GACxBrtM,EAAOoqJ,EAAO8H,SAASpyB,UAEjBv1H,EAAM0qL,EAAMo/N,aAEdv0R,EAAM1zJ,OAAS,EAAIm+B,EAAAA,MAAAA,IACXtK,MAAM,sBAcZgpZ,EAAOnpR,EAAM,UAEXmpR,QACD,OACA,MACCnpR,EAAM1zJ,SAAW,EAAIm+B,EAAAA,MAAAA,IACbtK,MAAM,4CAEZ8U,EAAIkgL,EAAM6zO,YAAYhpS,EAAMvzJ,MAAM,EAAG,EAAIg+B,OAE3CwK,EAAEzG,IAAI2mL,EAAM5mN,IAAM,EAAA,MAAA,IACV4xB,MAAM,wBAEZ5xB,EAAI4mN,EAAM4X,WAAW93L,EAAY,IAATk0Y,UAE9BjpZ,GAAQ3xB,EAAEyoN,cAEHzoN,OAGJ,OACA,OACA,MACCyxJ,EAAM1zJ,SAAW,EAAU,EAANm+B,EAAM,MAAA,IACnBtK,MAAM,8CAEZ8U,EAAIkgL,EAAM6zO,YAAYhpS,EAAMvzJ,MAAM,EAAG,EAAIg+B,IACzCyK,EAAIigL,EAAM6zO,YAAYhpS,EAAMvzJ,MAAM,EAAIg+B,EAAK,EAAI,EAAIA,OAGrDwK,EAAEzG,IAAI2mL,EAAM5mN,IAAM,GAAK2mC,EAAE1G,IAAI2mL,EAAM5mN,IAAM,EAAA,MAAA,IACjC4xB,MAAM,qBAGL,IAATgpZ,GAAiBA,KAAU,EAAOj0Y,EAAE0gL,SAAAA,MAAAA,IAC5Bz1L,MAAM,kCAEZ5xB,EAAI4mN,EAAMkB,MAAMphL,EAAGC,OAEpB3mC,EAAE+0J,WAAAA,MAAAA,IACKnjI,MAAM,yBAElBD,GAAQ3xB,EAAEyoN,cAEHzoN,oBAIG4xB,MAAM,0BAKtBmpa,iBAGSjia,KAAK8tL,MAAMmhO,YAAYjvZ,KAAK6wL,0BAGnB/C,EAAOn1D,GAEvB9/H,EAAOi1L,aAAiBoY,SAElBt4L,EAAIkgL,EAAM6zO,YAAYhpS,MAExB/qH,EAAEzG,IAAI2mL,EAAM5mN,IAAM,EAAA,MAAA,IACV4xB,MAAM,yBAEXg1L,EAAM4X,WAAW93L,GAAG,uBAGTkgL,EAAOn1D,GAEzB9/H,EAAOi1L,aAAiBoY,SAElBt4L,EAAIkgL,EAAM6zO,YAAYhpS,MAExB/qH,EAAEzG,IAAI2mL,EAAM5mN,IAAM,EAAA,MAAA,IACV4xB,MAAM,yBAEXg1L,EAAM4X,WAAW93L,GAG1BxmB,OAAOkhN,MACDtoM,KAAK4mM,IAAAA,MAAAA,SAGHh5L,EAAI5N,KAAK6wL,OAAOzpM,SAChBymB,EAAI7N,KAAK8wL,OAAO1pM,gBAEV,IAARkhN,GAAgBtoM,KAAKsoM,IAAAA,CACf16L,EAAGC,EAAG7N,KAAKsoM,IAAIlhN,WAEjBwmB,EAAGC,GAGbi6Z,cACM9na,KAAK4mM,IAAAA,MAAAA,SAGH3pM,EAA8B,EAAvB+C,KAAK8tL,MAAMo/N,iBACd4a,EAAS9na,KAAK6wL,OAAQ5zL,GACtB6qa,EAAS9na,KAAK8wL,OAAQ7zL,oBAKlB6wL,EAAOn+D,MACrB92H,EAAOi1L,aAAiBoY,GACxBrtM,EAAOgF,MAAM/gB,QAAQ6yI,IACrB92H,EAAuB,IAAhB82H,EAAK1qJ,QACW,IAAhB0qJ,EAAK1qJ,QACW,IAAhB0qJ,EAAK1qJ,QAEQ,IAAhB0qJ,EAAK1qJ,OAAW,OACX6oN,EAAMkB,cAETphL,EAAImgL,EAAGsa,SAAS14E,EAAK,IACrB9hH,EAAIkgL,EAAGsa,SAAS14E,EAAK,IACrBq/D,EAAQlB,EAAMkB,MAAMphL,EAAGC,UAEzB8hH,EAAK1qJ,OAAS,GAAgB,MAAX0qJ,EAAK,KAC1Bq/D,EAAMsZ,IAAM86N,EAAQ/6N,SAASrZ,EAAOr/D,EAAK,KAEpCq/D,GAGRl4E,YACK92G,KAAK4mM,IACA,yBAEF,kBACQ5mM,KAAK4N,EAAEyyL,UAAUjiM,SAAS,GAAI,GACtC,MAAQ4B,KAAK6N,EAAEwyL,UAAUjiM,SAAS,GAAI,GACtC,KAQX,MAAAyoM,UAAqBH,EACnB/5L,YAAYmhL,EAAOlgL,EAAGC,EAAG03G,GACvB1sH,EAAOi1L,aAAiBoY,GAExB3gL,MAAMuoK,EAAOr8K,GAEbzR,KAAK4N,EAAI5N,KAAK8tL,MAAM2U,IACpBziM,KAAK6N,EAAI7N,KAAK8tL,MAAM2U,IACpBziM,KAAKulH,EAAIvlH,KAAK8tL,MAAM3jC,KACpBnqJ,KAAK8mM,MAAO,EAEH,MAALl5L,GACF5N,KAAK+hK,MAAMn0J,EAAGC,EAAG03G,GAGrBw8C,MAAMn0J,EAAGC,EAAG03G,GACV1sH,EAAO+U,aAAamgL,GACpBl1L,EAAOgV,aAAakgL,GACpBl1L,EAAY,MAAL0sH,GAAcA,aAAawoE,GAElC/tL,KAAK4N,EAAIA,EACT5N,KAAK6N,EAAIA,EACT7N,KAAKulH,EAAIA,GAAKvlH,KAAK8tL,MAAM2U,IAEpBziM,KAAK4N,EAAEsgL,MACVluL,KAAK4N,EAAI5N,KAAK4N,EAAEqgL,MAAMjuL,KAAK8tL,MAAMI,MAE9BluL,KAAK6N,EAAEqgL,MACVluL,KAAK6N,EAAI7N,KAAK6N,EAAEogL,MAAMjuL,KAAK8tL,MAAMI,MAE9BluL,KAAKulH,EAAE2oE,MACVluL,KAAKulH,EAAIvlH,KAAKulH,EAAE0oE,MAAMjuL,KAAK8tL,MAAMI,MAEnCluL,KAAK8mM,KAAO9mM,KAAKulH,EAAEhyG,GAAGvT,KAAK8tL,MAAM2U,KAGnCptK,eACSr1B,KAAK8tL,MAAM0W,OAAOxkM,KAAK4N,EAAG5N,KAAK6N,EAAG7N,KAAKulH,GAGhD0W,mBAESp1J,EAAAA,EAAGyS,GAAK0mB,KAAK8tL,SAGhB9tL,KAAK2vL,aAAAA,OACA,KAGL3vL,KAAK8mM,KAAAA,OACA9mM,KAAK8tL,MAAM7xD,SAASj8H,KAAK2kM,aAG5B9qJ,EAAM75C,KAAK6N,EAAEsgL,SACbQ,EAAK3uL,KAAK4N,EAAEugL,SAASyS,OAAO5gM,KAAK4N,GACjCw7L,EAAKppM,KAAKulH,EAAE4oE,SACZ+4O,EAAK99N,EAAGjb,SACR45O,EAAKb,EAAGtmO,OAAOwI,GACfnB,EAAMtZ,EAAGN,QAAQ/0M,EAAEsnN,OAAOmnO,WAE3B/na,KAAK8tL,MAAMsY,QAEVpmM,KAAK8tL,MAAMuY,OACb4B,EAAI5Z,QAAQ64O,EAAGnR,UAAU,GAAGn1N,OAAO5gM,KAAK4N,IAExCq6L,EAAI5Z,QAAQxnN,EAAE+5N,OAAOsmO,GAAItmO,OAAO5gM,KAAK4N,KAGlCisC,EAAItmC,GAAG00L,GAGhBpiM,eAKM7F,KAAK8mM,KAAAA,OACA9mM,QAGLA,KAAK2vL,aAAAA,OACA3vL,WAGHn5B,EAAIm5B,KAAKulH,EAAEsyS,YAGXpsN,EAAK5kO,EAAEsnN,gBAGbnuL,KAAK4N,EAAI5N,KAAK4N,EAAEgzL,OAAO6K,GAGvBzrM,KAAK6N,EAAI7N,KAAK6N,EAAE+yL,OAAO6K,GAAI7K,OAAO/5N,GAGlCm5B,KAAKulH,EAAIvlH,KAAK8tL,MAAM2U,IACpBziM,KAAK8mM,MAAO,EAEL9mM,KAGTuha,MAAM16b,MACJgyB,EAAOhyB,aAAaknN,GAGhB/tL,KAAK2vL,aAAAA,OACA3vL,KAAK8tL,MAAM0W,eAGdiH,EAAK5kO,EAAEsnN,SAGPsa,EAAKzoM,KAAK4N,EAAEgzL,OAAO6K,GAGnB/C,EAAK1oM,KAAK6N,EAAE+yL,OAAO6K,GAAI7K,OAAO/5N,GAG9BwiO,EAAKrpM,KAAKulH,EAAEq7E,OAAO/5N,UAElBm5B,KAAK8tL,MAAM0W,OAAOiE,EAAIC,EAAIW,GAGnCzT,aAES51L,KAAK8tL,MAAM0W,OAAOxkM,KAAK4N,EAAG5N,KAAK6N,EAAE2gL,SAAUxuL,KAAKulH,GAGzDvmI,IAAI9X,UACF2xB,EAAO3xB,aAAaw/N,GAEhBx/N,EAAEJ,OAAS2qC,EACNzR,KAAKgoa,UAAU9gc,GAEjB84B,KAAKioa,KAAK/gc,GAGnB+gc,KAAK/gc,UACH2xB,EAAO3xB,aAAa2/N,GAGhB7mM,KAAK2vL,aACAzoN,EAGLA,EAAEyoN,aACG3vL,KAGLA,KAAK8mM,KACA5/N,EAAEghc,OAAOloa,MAGd94B,EAAE4/N,KACG9mM,KAAKkoa,OAAOhhc,GAEd84B,KAAKmoa,OAAOjhc,GAGrB8gc,UAAU9gc,UACR2xB,EAAO3xB,aAAag9b,GAGhBlka,KAAK2vL,aACAzoN,EAAEo+N,MAGPp+N,EAAEyoN,aACG3vL,KAEFA,KAAKkoa,OAAOhhc,GAGrBihc,OAAOjhc,SAMCkhc,EAAOpoa,KAAKulH,EAAE4oE,SAGdk6O,EAAOnhc,EAAEq+I,EAAE4oE,SAGX8D,EAAKjyL,KAAK4N,EAAEgzL,OAAOynO,GAGnBn2O,EAAKhrN,EAAE0mC,EAAEgzL,OAAOwnO,GAGhBvyU,EAAK71F,KAAK6N,EAAE+yL,OAAO15N,EAAEq+I,GAAGq7E,OAAOynO,GAG/BvyU,EAAK5uH,EAAE2mC,EAAE+yL,OAAO5gM,KAAKulH,GAAGq7E,OAAOwnO,GAG/B3gW,EAAIyqH,EAAGtD,QAAQqD,GAGfjkL,EAAI8nF,EAAG84F,QAAQ/4F,MAGjBpuB,EAAEonH,gBACC7gL,EAAE6gL,SAGA7uL,KAAKimM,MAFHjmM,KAAK8tL,MAAM0W,eAMhBl0C,EAAK7oF,EAAE0mH,SAGPm6O,EAAM7gW,EAAEm5H,OAAOtwC,GAGfxrF,EAAImtH,EAAG2O,OAAOtwC,GAGdm4C,EAAKz6L,EAAEmgL,SAASS,QAAQ05O,GAAK15O,QAAQ9pH,GAAG8pH,QAAQ9pH,GAGhD4jI,EAAK16L,EAAE4yL,OAAO97H,EAAE8pH,QAAQ6Z,IAAK7Z,QAAQ/4F,EAAG+qG,OAAO0nO,IAG/Cj/N,EAAKrpM,KAAKulH,EAAEq7E,OAAO15N,EAAEq+I,GAAGq7E,OAAOn5H,UAE9BznE,KAAK8tL,MAAM0W,OAAOiE,EAAIC,EAAIW,GAGnC6+N,OAAOhhc,SAMCkhc,EAAOpoa,KAAKulH,EAAE4oE,SAGd+D,EAAKhrN,EAAE0mC,EAAEgzL,OAAOwnO,GAGhBtyU,EAAK5uH,EAAE2mC,EAAE+yL,OAAO5gM,KAAKulH,GAAGq7E,OAAOwnO,GAG/B3gW,EAAIyqH,EAAGtD,QAAQ5uL,KAAK4N,GAGpBI,EAAI8nF,EAAG84F,QAAQ5uL,KAAK6N,GAAGkoZ,SAAS,MAGlCtuV,EAAEonH,gBACC7gL,EAAE6gL,SAGA7uL,KAAKimM,MAFHjmM,KAAK8tL,MAAM0W,eAMhBr9N,EAAIsgG,EAAEuuV,QAAQ,GAAG7nO,SAGjB78L,EAAIm2E,EAAEm5H,OAAOz5N,GAGb29F,EAAI9kE,KAAK4N,EAAEgzL,OAAOz5N,GAGlBshO,EAAKz6L,EAAEmgL,SAASS,QAAQt9L,GAAGs9L,QAAQ9pH,GAAG8pH,QAAQ9pH,GAG9C4jI,EAAK16L,EAAE4yL,OAAO97H,EAAE8pH,QAAQ6Z,IAAK7Z,QAAQ5uL,KAAK6N,EAAE+yL,OAAOtvM,GAAGyka,SAAS,IAG/D1sN,EAAKrpM,KAAKulH,EAAEq7E,OAAOn5H,GAAGsuV,SAAS,UAE9B/1Z,KAAK8tL,MAAM0W,OAAOiE,EAAIC,EAAIW,GAGnCpD,aAEMjmM,KAAK2vL,aACA3vL,KAGLA,KAAK6N,EAAEghL,SACF7uL,KAAK8tL,MAAM0W,SAGhBxkM,KAAK8tL,MAAMsY,MACNpmM,KAAKuoa,QAGVvoa,KAAK8tL,MAAMuY,OACNrmM,KAAKwoa,QAEPxoa,KAAKyoa,QAGdA,cAMQv+N,EAAKlqM,KAAK4N,EAAEugL,SAGZgc,EAAKnqM,KAAK6N,EAAEsgL,SAGZ2c,EAAK9qM,KAAKulH,EAAE4oE,SAGZjyM,EAAI8jB,KAAK4N,EAAEgzL,OAAOuJ,GAAI4rN,SAAS,GAG/B72a,EAAIgrN,EAAG6rN,SAAS,GAAG1nO,QAAQruL,KAAK8tL,MAAMjnN,EAAE+5N,OAAOkK,EAAG3c,WAGlDpvI,EAAI7/D,EAAEivM,SAASS,QAAQ1yM,GAAG0yM,QAAQ1yM,GAGlCusN,EAAK1pJ,EAGL2pJ,EAAKxpN,EAAE0hN,OAAO1kN,EAAE0yM,QAAQ7vI,IAAI6vI,QAAQub,EAAGhc,SAAS4nO,SAAS,IAGzD1sN,EAAKrpM,KAAK6N,EAAE+yL,OAAO5gM,KAAKulH,GAAGwwS,SAAS,UAEnC/1Z,KAAK8tL,MAAM0W,OAAOiE,EAAIC,EAAIW,GAGnCk/N,cAOQ1hc,EAAIm5B,KAAK4N,EAAEugL,SAGX70M,EAAI0mB,KAAK6N,EAAEsgL,SAGX1hN,EAAI6M,EAAE60M,SAMNvwJ,EAHMtkD,EAAE+0M,QAAQruL,KAAK4N,GAAGugL,SAGhBS,QAAQ/nN,GAAG+nN,QAAQniN,GAAGspb,SAAS,GAGvChigB,EAAI8yE,EAAEkvb,SAAS,GAMfttN,EAHI10S,EAAEo6R,SAGCS,QAAQhxJ,GAAGgxJ,QAAQhxJ,GAG1B8qK,EAAK30S,EAAE6sS,OAAOhjK,EAAEgxJ,QAAQ6Z,IAAK7Z,QAAQniN,EAAEspb,SAAS,IAGhD1sN,EAAKrpM,KAAK6N,EAAE+yL,OAAO5gM,KAAKulH,GAAGwwS,SAAS,UAEnC/1Z,KAAK8tL,MAAM0W,OAAOiE,EAAIC,EAAIW,GAGnCm/N,cAOQj9Y,EAAQvrB,KAAKulH,EAAE4oE,SAGf7iK,EAAQtrB,KAAK6N,EAAEsgL,SAGf9iK,EAAOrrB,KAAK4N,EAAEgzL,OAAOt1K,GAGrBo9Y,EAAU1oa,KAAK4N,EAAE6yL,OAAOl1K,GAGxBo9Y,EAAU3oa,KAAK4N,EAAE4yL,OAAOj1K,GAGxBH,EAAQs9Y,EAAQ9nO,OAAO+nO,GAAS5S,SAAS,GAGzCxrN,EAAQl/K,EAAK0qY,SAAS,GAGtBvrN,EAAQD,EAAMyrN,QAAQ,GAGtB4S,EAAUt9Y,EAAM6iK,SAAS4nO,SAAS,GAGlCttN,EAAKr9K,EAAM+iK,SAASS,QAAQ4b,GAG5BnB,EAAKrpM,KAAK6N,EAAE2yL,OAAOxgM,KAAKulH,GAAG4oE,SAASS,QAAQtjK,GAAOsjK,QAAQrjK,GAG3Dm9K,EAAKt9K,EAAMw1K,OAAO2J,EAAM3b,QAAQ6Z,IAAK7Z,QAAQg6O,UAE5C5oa,KAAK8tL,MAAM0W,OAAOiE,EAAIC,EAAIW,GAGnCxY,UACM7wL,KAAK2vL,aAAAA,MAAAA,IACG72L,MAAM,yBAElBkH,KAAK6F,YAEE7F,KAAK4N,EAAEyyL,UAGhBvP,UACM9wL,KAAK2vL,aAAAA,MAAAA,IACG72L,MAAM,yBAElBkH,KAAK6F,YAEE7F,KAAK6N,EAAEwyL,UAGhB9sL,GAAGrsC,MACD2xB,EAAO3xB,aAAa2/N,GAGhB7mM,OAAS94B,EAAAA,OACJ,KAGL84B,KAAK2vL,aAAAA,OACAzoN,EAAEyoN,gBAGPzoN,EAAEyoN,aAAAA,OACG,KAGL3vL,KAAKulH,EAAEhyG,GAAGrsC,EAAEq+I,UACPvlH,KAAK4N,EAAE2F,GAAGrsC,EAAE0mC,IACZ5N,KAAK6N,EAAE0F,GAAGrsC,EAAE2mC,SAIfg7Z,EAAM7oa,KAAKulH,EAAE4oE,SACb26O,EAAM5hc,EAAEq+I,EAAE4oE,SACVmR,EAAKt/L,KAAK4N,EAAEgzL,OAAOkoO,GACnBvpO,EAAKr4N,EAAE0mC,EAAEgzL,OAAOioO,OAEjBvpO,EAAG/rL,GAAGgsL,GAAAA,OACF,QAGHwpO,EAAOF,EAAIjoO,OAAO5gM,KAAKulH,GACvByjT,EAAOF,EAAIloO,OAAO15N,EAAEq+I,GACpBiiF,EAAKxnM,KAAK6N,EAAE+yL,OAAOooO,GACnBvhO,EAAKvgO,EAAE2mC,EAAE+yL,OAAOmoO,UAEfvhO,EAAGj0L,GAAGk0L,GAGftgM,IAAI6nL,GACFn2L,EAAOm2L,aAAiB6X,SAElBoiO,EAAOjpa,KAAK2vL,aACZu5O,EAAOl6O,EAAMW,oBAEfs5O,IAASC,GACH,GAELD,GAAQC,EACJ,EAELD,GAAQC,EACH,EAEFlpa,KAAK2ja,QAAQx8Z,IAAI6nL,EAAM20O,UACvB3ja,KAAK6wL,OAAO1pL,IAAI6nL,EAAM6B,SACtB7wL,KAAK8wL,OAAO3pL,IAAI6nL,EAAM8B,QAG/BnB,oBAES3vL,KAAKulH,EAAEspE,SAGhBy0O,kBACMtja,KAAK2vL,cAGF3vL,KAAK6N,EAAEghL,SAGhBN,eACMvuL,KAAK2vL,eAGT3vL,KAAK6F,YAEE7F,KAAK6N,EAAE2pZ,YAGhBr8O,gBACMn7K,KAAK2vL,eAGT3vL,KAAK6F,YAEE7F,KAAK6N,EAAE4pZ,aAGhB/F,kBACM1xZ,KAAK2vL,eAGqC,IAAvC3vL,KAAK6N,EAAE+yL,OAAO5gM,KAAKulH,GAAGmyS,YAG/B6L,IAAI31Z,MAQF/U,EAAO+U,aAAamgL,GACpBl1L,GAAQ+U,EAAEsgL,KAENluL,KAAK2vL,aAAAA,OACA,QAEHmb,EAAK9qM,KAAKulH,EAAE4oE,SACZiO,EAAKxuL,EAAEqgL,MAAMjuL,KAAK8tL,MAAMI,KAAK0S,OAAOkK,UAEnC9qM,KAAK4N,EAAE2F,GAAG6oL,GAGnBonO,IAAI51Z,MAeF/U,EAAO+U,aAAamgL,GACpBl1L,GAAQ+U,EAAEsgL,MAELluL,KAAK8tL,MAAMu2O,SAAAA,OACPrka,KAAK2kM,MAAM6+N,IAAI51Z,MAEpB5N,KAAK2vL,aAAAA,OACA,KAEL/hL,EAAEzG,IAAInH,KAAK8tL,MAAM5mN,IAAM,EAAA,OAClB,QAEH4jO,EAAK9qM,KAAKulH,EAAE4oE,SACZiO,EAAKxuL,EAAEqgL,MAAMjuL,KAAK8tL,MAAMI,KAAK0S,OAAOkK,MAEtC9qM,KAAK4N,EAAE2F,GAAG6oL,GAAAA,OACL,KAELp8L,KAAK8tL,MAAMs2O,UAAAA,OACN,KAELx2Z,EAAEzG,IAAInH,KAAK8tL,MAAMq2O,QAAU,EAAA,OACtB,QAEHgF,EAAKnpa,KAAK8tL,MAAMgW,KAAKlD,OAAOkK,UAElC1O,EAAG/N,QAAQ86O,GAEJnpa,KAAK4N,EAAE2F,GAAG6oL,GAGnBuI,aAEM3kM,KAAK2vL,aACA3vL,KAAK8tL,MAAMkB,SAEpBhvL,KAAK6F,YAGE7F,KAAK8tL,MAAMkB,MAAMhvL,KAAK4N,EAAG5N,KAAK6N,IAGvCy3L,aACStlM,KAGTsD,OAAO4xJ,UACEl1J,KAAK2kM,MAAMrhM,OAAO4xJ,iBAGb44B,EAAOn1D,UACZurS,EAAW9/Z,OAAO0pL,EAAOn1D,GAAO2sE,MAGzC28N,iBACSjia,KAAK2kM,MAAMs9N,4BAGFn0O,EAAOn1D,UAChBurS,EAAWhC,WAAWp0O,EAAOn1D,GAAO2sE,0BAGzBxX,EAAOn1D,UAClBurS,EAAW/B,aAAar0O,EAAOn1D,GAAO2sE,MAG/Cl+M,OAAOkhN,UACEtoM,KAAK2kM,MAAMv9M,OAAOkhN,GAG3Bw/N,kBACS9na,KAAK2kM,MAAMmjO,2BAGJh6O,EAAOn+D,UACdu0S,EAAW77N,SAASva,EAAOn+D,GAAM21E,OAGzCxuF,YACK92G,KAAK2vL,aACA,qBAEF,cACQ3vL,KAAK4N,EAAEyyL,UAAUjiM,SAAS,GAAI,GACtC,MAAQ4B,KAAK6N,EAAEwyL,UAAUjiM,SAAS,GAAI,GACtC,MAAQ4B,KAAKulH,EAAE86E,UAAUjiM,SAAS,GAAI,GACtC,KAQX,MAAAktM,UAAwB0yN,EACtBrxZ,YAAYqE,GACVuU,MAAMmiZ,EAAW,OAAQ12Z,GAEzBhR,KAAKn5B,EAAIknN,EAAGsa,SAASr3L,EAAKnqC,GAAGonN,MAAMjuL,KAAKkuL,KACxCluL,KAAK1mB,EAAIy0M,EAAGsa,SAASr3L,EAAK13B,GAAG20M,MAAMjuL,KAAKkuL,KAExCluL,KAAKola,GAAKpla,KAAK1mB,EAAEu+a,YACjB73Z,KAAK8jK,GAAK9jK,KAAKn5B,EAAE25N,OAAOxgM,KAAKqjM,KAC7BrjM,KAAKwrM,IAAMxrM,KAAK8jK,GAAG88B,OAAO5gM,KAAKurM,IAC/BvrM,KAAKo3L,GAAKp3L,KAAKn5B,EAAE+5N,OAAO5gM,KAAKw+Z,IAC7Bx+Z,KAAK42L,GAAK52L,KAAKn5B,EAAE+5N,OAAO5gM,KAAKola,IAC7Bpla,KAAK6oL,GAAK7oL,KAAKola,GAAGj3O,SAElBnuL,KAAK++Z,UAAU/tZ,uBAGGuzZ,EAAQC,EAAQC,GAWlC5ra,EAAO0ra,aAAkBx2O,GACzBl1L,EAAO2ra,aAAkBz2O,GACzBl1L,EAAO4ra,aAAmB12O,SAEpBlnN,EAAI09b,EAAOlvY,QACX/7C,EAAImrb,EAAQpvY,WAGI,IAFZmvY,EAAOtO,OAAOuO,GAElB/M,YAAgB,MAAA,IACV5+Z,MAAM,mCAEVjyB,EAAGyS,GAGbwrb,OAAOluO,EAAI0F,WASFz1N,EAAAA,EAAGyS,EAAAA,MAAG+kb,GAASr+Z,KAChB8jK,EAAKj9L,EAAEsnN,SACPiJ,EAAKtzB,EAAG88B,OAAO/5N,GACfwnL,EAAK/0K,EAAE60M,SACPrF,EAAKz6B,EAAGuyC,OAAOtnN,GACfkhS,EAAK6jJ,EAAM59N,OAAO38B,GAClBy2G,EAAKlsH,EAAG2nQ,QAAQ,GAChB55U,EAAKg7G,EAAG4+N,QAAQ,GAAGpnO,QAAQ/nN,EAAEmvb,QAAQ,IACrCh7O,EAAK8N,EAAGktO,QAAQ,IAChBoT,EAAK5uJ,EAAG07I,OAAO37I,GACf8uJ,EAAKjtV,EAAG85U,OAAOl7O,UAEX,MAAN4b,EACKsP,EAAW6+N,aAAaqE,EAAIC,EAAIzyO,EAAI0F,IAErC8sO,EAAIC,GAGdrE,MAAMn8O,UACGyiB,EAAUy5N,aAAa/ka,KAAKn5B,EAAGm5B,KAAK1mB,EAAGuvM,GAGhDmkO,SAASp2N,EAAI8iG,GAAS,GAiCpB7gS,EAAyB,kBAAX6gS,aAEPr2F,EAAAA,GAAK+hO,GAAMpla,KACZn5B,EAAIm5B,KAAKn5B,EAAE25N,OAAO6C,GAAKzC,OAAOwkO,GAC9BxnY,EAAI59B,KAAKn5B,EAAE45N,OAAO4C,GAAKzC,OAAOwkO,UAEhC1rI,GACF7yT,EAAE6mC,KAAKkwB,GAEC,MAANg5J,EACKiV,EAAak5N,aAAal+b,EAAG+2D,EAAGg5J,IAEjC/vN,EAAG+2D,GAGbkiY,YAAYhyO,GACVj1L,EAAOi1L,aAAiBoY,SAEjBhU,EAAIsnO,GAAM1rO,EAAM6wO,OAAO3+Z,aAEtBA,KAAKoga,MAAMluO,EAAG2lO,aACd73Z,KAAKoga,MAAM5G,EAAG3B,cAGxBkI,WAAWjyO,UAQTj1L,EAAOi1L,aAAiBwd,GAEpBtrM,KAAKokH,EAAEurE,cAAgB7B,EAAM1pE,EAAEurE,aAC1B3vL,KAAKoga,MAAMtyO,EAAMx0M,GAAGq9a,WAAW32Z,KAAK1mB,GAEtC0mB,KAAKokH,EAAEv2G,EAAEqoZ,OAAOl2Z,KAAKoga,MAAMtyO,EAAM1pE,EAAEv2G,IAG5CmyZ,cAAclyO,EAAO4rG,GAuBnB7gS,EAAOi1L,aAAiB+d,SAElBp/N,EAAIqhN,EAAM6wO,OAAO3+Z,KAAM05R,UAEtB15R,KAAKoga,MAAM3zb,GAGpB68b,SAAS17Z,GACP/U,EAAO+U,aAAamgL,SAGdlnN,EAAIm5B,KAAK42L,GACTt9M,EAAI0mB,KAAK6oL,GACT0W,EAAK3xL,EAAEugL,gBACFoR,EAAGqB,OAAOhzL,GACPygL,QAAQxnN,EAAE+5N,OAAOrB,IAAKlR,QAAQ/0M,EAAEsnN,OAAOhzL,IAKvD27Z,YAAYr1U,SAoDJr6C,EAAM75C,KAAK42L,GAAGpI,SACdyZ,EAAMjoM,KAAKyiM,IAAIjC,OAAOxgM,KAAKulH,EAAEq7E,OAAO1sG,EAAEi6F,WAExC8Z,EAAIpZ,UACNoZ,EAAI/nH,OAAOlgF,KAAKyiM,WAEZnD,EAAKzlJ,EAAI+mJ,OAAOqH,EAAI4vN,aACpBt4N,EAAKD,EAAG9Q,SAASI,QAAQ5uL,KAAK42L,IAC9B4Q,EAAKxnM,KAAKspa,SAAShqO,GACnBmI,EAAKznM,KAAKspa,SAAS/pO,GACnBn0K,EAA2B,EAAnBo8K,EAAGqvN,cACX9pM,EAAAA,CAAMztB,EAAIC,GAAY,EAARn0K,GACd0vJ,EAAAA,CAAM0sB,EAAIC,GAAY,EAARr8K,GAAWkjK,UAE3BxT,EAAG08O,aAAetjU,EAAEsjU,YACtB18O,EAAGm8O,gBAECrpZ,EAAI5N,KAAK1mB,EAAEsnN,OAAOmsB,GAClBl/M,EAAI7N,KAAK1mB,EAAEsnN,OAAO9lB,UAEjB96K,KAAKgvL,MAAMphL,EAAGC,GAGvB27Z,SAAStic,EAAGy2N,WAoBH/vL,EAAAA,EAAGC,GAAK3mC,EACT8mC,EAAW,EAAP2vL,EACJovB,EAAKn/M,EAAEgzL,OAAO5gM,KAAKola,IACnBtqP,EAAKjtK,EAAE+yL,OAAO5gM,KAAKola,IACnBnxgB,EAAI84T,EAAGvsB,OAAOxgM,KAAK42L,IACnBh5J,EAAImvL,EACJlzK,EAAAA,CAAO5lJ,EAAG2pI,GAAG5vB,GAAGipZ,UAChBhvN,EAAAA,CAAOrqK,EAAG3pI,GAAG+5G,GAAG4yL,OAAO5gM,KAAKulH,GAC5BrxB,EAAIr6C,EAAI88W,WAAW1uN,UAErB/zG,EAAEsjU,aAAe18O,EAAG08O,YACtBtjU,EAAE+iU,UAEG/iU,EAGT+rU,mBACQn8P,EAAK9jK,KAAKn5B,EAAEsnN,gBACRnuL,KAAK1mB,EAAEsnN,OAAO98B,EAAG28B,OAAOzgM,KAAKs+Z,OAG7BzvO,SAGZqxO,eAESr5b,EAAAA,MAAGw3b,EAAAA,KAAOC,GAAQt+Z,KACnB8jK,EAAKj9L,EAAEsnN,SAEPt0I,EADKiqH,EAAG28B,OAAO49N,GACN3J,QAAQ,GAAGqB,SAAS,KAC7B9tN,EAAMnkC,EAAG28B,OAAO69N,MAElBr2N,EAAIpZ,SAAAA,MAAAA,IACI/1L,MAAM,iCAGX+gD,EAAIq8W,OAAOjuN,GAAK5H,UAGzBrR,MAAMphL,EAAGC,cACI65Z,EAAU1na,KAAM4N,EAAGC,GAGhC22L,OAAO52L,EAAGC,EAAG03G,UACX1sH,EAAY,MAAL+U,GAAkB,MAALC,GAAkB,MAAL03G,GAC1BvlH,KAAKgvL,QAGdqxO,OAAOzyZ,EAAG23G,cACGkkT,EAAOzpa,KAAM4N,EAAG23G,GAG7Bm7S,QAAQ9yZ,GAGN/U,EAAO+U,aAAamgL,SAGdwR,EAAK3xL,EAAEugL,gBACFoR,EAAGqB,OAAOhzL,GACNygL,QAAQruL,KAAKn5B,EAAE+5N,OAAOrB,IAAKlR,QAAQzgL,GACnCgzL,OAAO5gM,KAAKola,IAK7BnpS,SAAS+yD,MACPn2L,EAAOm2L,aAAiB04O,GAEpB14O,EAAMW,aAAAA,OACD,UAEF/hL,EAAAA,EAAGC,GAAKmhL,EACTyY,EAAKznM,KAAK0ga,QAAQ9yZ,UAEjBC,EAAEsgL,SAAS56K,GAAGk0L,GAGvB/B,WAAW93L,EAAG06I,EAAO,MACnBzvJ,EAAO+U,aAAamgL,GACpBl1L,EAAe,MAARyvJ,GAAgC,kBAATA,GAEzB16I,EAAEsgL,MACLtgL,EAAIA,EAAEqgL,MAAMjuL,KAAKkuL,YAEbrgL,EAAI7N,KAAK2ga,OAAO/yZ,MAEV,MAAR06I,EAAQ,IACNz6I,EAAEghL,UAAYvmC,EAAAA,MAAAA,IACNxvJ,MAAM,kBAEd+U,EAAE2pZ,aAAelvQ,GACnBz6I,EAAEopZ,iBAGCj3Z,KAAKgvL,MAAMphL,EAAGC,GAGvBgxZ,aAAa/wO,EAAO4rG,MAElB7gS,EAAOi1L,aAAiBkwO,IAEnBlwO,EAAM5mN,EAAEqsC,GAAGvT,KAAK94B,GAAAA,OACZ,KAGU,SAAf4mN,EAAMhnN,KAAS,OACXD,EAAIm5B,KAAKoga,MAAMtyO,EAAMjnN,GACrByS,EAAI0mB,KAAKoga,MAAMtyO,EAAMx0M,OAGtB0mB,KAAKn5B,EAAE0sC,GAAG1sC,GAAAA,OACN,KAGLm5B,KAAK1mB,EAAEu1M,SAAAA,OACF,SAKgB,IAFfv1M,EAAE48a,OAAOl2Z,KAAK1mB,GAEfo+a,mBAGJ5pO,EAAM+wO,aAAa7+Z,KAAM05R,GAGlColI,YAAYhxO,UACVj1L,EAAOi1L,aAAiBkwO,GAEL,SAAflwO,EAAMhnN,MAGHgnN,EAAMgxO,YAAY9+Z,MAG3B4ga,eAAe5xO,MAGbn2L,EAAOm2L,aAAiBk1O,GAEpBlka,KAAK6+Z,aAAa7vO,EAAMlB,OAAAA,IAOtBkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,iBAEPoI,EAAAA,EAAI99M,GAAK0mB,MACTkyL,EAAIsnO,GAAMx5Z,KAAK2+Z,OAAO3vO,EAAMlB,OAC7BlgL,EAAI5N,KAAKoga,MAAMpxO,EAAMphL,GAAGgzL,OAAO1O,GAC/BrkL,EAAI7N,KAAKoga,MAAMpxO,EAAMnhL,GAAG+yL,OAAO44N,GAC/BtlU,EAAI56G,EAAEsnN,OAAOhzL,GAAGghL,QAAQwI,GACxBtyH,EAAIxrF,EAAEsnN,OAAO/yL,UAEZ7N,KAAKgvL,MAAM96F,EAAGpvB,aAGbhsE,MAAM,oBAGlBg1Z,cAAc9+N,MAEZn2L,EAAOm2L,aAAiB04O,GAEpB1na,KAAK6+Z,aAAa7vO,EAAMlB,OAAAA,IAOtBkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,cAERviN,EAAIuzB,KAAK2+Z,OAAO3vO,EAAMlB,OACtB55F,EAAIl0F,KAAKoga,MAAMpxO,EAAMphL,GACrBk3D,EAAI9kE,KAAKoga,MAAMpxO,EAAMnhL,GACrBme,EAAKkoE,EACLw1U,EAAKj9b,EAAEm0N,OAAO97H,UAEb9kE,KAAKgvL,MAAMhjK,EAAI09Y,aAGd5wa,MAAM,oBAGlB80Z,iBAAiB5+N,GAIfn2L,EAAOm2L,aAAiB24O,GACxB9ua,EAAOm2L,EAAMlB,MAAM5mN,EAAEqsC,GAAGvT,KAAK94B,UAGvB0mC,EAAI5N,KAAKoga,MAAMpxO,EAAMphL,GACrBC,EAAI7N,KAAKoga,MAAMpxO,EAAMnhL,GACrB03G,EAAIvlH,KAAKoga,MAAMpxO,EAAMzpE,MAEvBvlH,KAAK8+Z,YAAY9vO,EAAMlB,OAAAA,IAcrBkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,WAEVA,EAAMphL,EAAEihL,SAAAA,OACH7uL,KAAKgvL,MAAMhvL,KAAKmqJ,KAAMnqJ,KAAKmqJ,YAE9B19K,EAAI84I,EAAE4oE,SAAS4nO,SAAS,GACxB4T,EAAK97Z,EAAEsgL,SACPy7O,EAAKh8Z,EAAEugL,SACPrW,EAAKrrM,EAAEmiN,QAAQg7O,GAAIh7O,QAAQ+6O,GAAI/oO,OAAO/yL,GACtCg8Z,EAAKD,EAAGhpO,OAAOhzL,UAEd5N,KAAKsga,OAAOqJ,EAAIC,EAAI9xP,EAAI+xP,MAG7B7pa,KAAK6+Z,aAAa7vO,EAAMlB,OAAO,GAAA,IAc7BkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,WAEVA,EAAMphL,EAAEihL,SAAAA,OACH7uL,KAAKgvL,MAAMhvL,KAAKmqJ,KAAMnqJ,KAAKmqJ,YAE9B19K,EAAIuzB,KAAK2+Z,OAAO3vO,EAAMlB,OAAO,GAC7B67O,EAAK97Z,EAAE2yL,OAAOj7E,GACdqkT,EAAK/7Z,EAAE4yL,OAAOl7E,GACduyD,EAAKrrM,EAAEm0N,OAAOr7E,GAAGq7E,OAAO+oO,GACxBE,EAAKj8Z,EAAEgzL,OAAOgpO,UAEb5pa,KAAKsga,OAAOqJ,EAAIC,EAAI9xP,EAAI+xP,MAG7B7pa,KAAK6+Z,aAAa7vO,EAAMlB,OAAO,GAAA,IAc7BkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,WAEVA,EAAMphL,EAAEihL,SAAAA,OACH7uL,KAAKgvL,MAAMhvL,KAAKmqJ,KAAMnqJ,KAAKmqJ,YAE9B19K,EAAIuzB,KAAK2+Z,OAAO3vO,EAAMlB,OAAO,GAC7B67O,EAAKpkT,EAAEi7E,OAAO3yL,GACd+7Z,EAAKrkT,EAAEk7E,OAAO5yL,GACdiqK,EAAKrrM,EAAEm0N,OAAOr7E,GAAGq7E,OAAO+oO,GACxBE,EAAKj8Z,EAAEgzL,OAAOgpO,UAEb5pa,KAAKsga,OAAOqJ,EAAIC,EAAI9xP,EAAI+xP,aAGvB/wa,MAAM,oBAGlBm1Z,iBAAiB/5T,MACfr7F,EAAOq7F,aAAa65F,GAGhB/tL,KAAKulH,EAAEspE,UAAY7uL,KAAKn5B,EAAEgoN,SAAAA,MAAAA,IAClB/1L,MAAM,2BAEXkH,KAAKupa,YAAYr1U,GAG1Bk6T,eAAelnb,EAAGy2N,MAWhB9kM,EAAO3xB,aAAawgc,GACpB7ua,EAAQ8kM,IAAS,IAAOA,GAGpB39L,KAAKulH,EAAEspE,UAAY7uL,KAAKn5B,EAAEgoN,SAAAA,MAAAA,IAClB/1L,MAAM,uBAGd5xB,EAAEyoN,aAAAA,MAAAA,IACM72L,MAAM,wBAGZ3xB,GAAMw2N,IAAS,EAAK,IAAM39L,KAAK0+Z,QAAQz5b,OACvCqpC,EAAIpnC,EAAE8X,IAAIghB,KAAK0+Z,QAAQv3b,WAEtBygc,GAAW,IACT5na,KAAKwpa,SAASl7Z,EAAGqvL,KAI5B8H,YAAY9sE,EAAO2vB,UACVo/Q,EAAUtja,OAAOpE,KAAM24H,EAAO2vB,GAGvC25Q,QAAQjzO,UACNn2L,EAAOm2L,aAAiBy6O,GACjBz6O,EAAM1rL,SAGfsrZ,QAAQj2R,UACC8wS,EAAOrla,OAAOpE,KAAM24H,GAG7BypS,QAAQxrO,EAAI0F,EAAKh0C,EAAO,YACfzhL,EAAGyS,GAAK0mB,KAAK8ka,OAAOluO,EAAI0F,GAEzBxO,EAAAA,IAAYoY,EAAAA,CAChBhY,IAAKluL,KAAKkuL,IACV9/J,MAAOpuB,KAAKouB,MACZlnD,EAAG84B,KAAK94B,EACRL,EAAGA,EACHyS,EAAGA,EACHrlF,EAAG+rG,KAAK/rG,EACRwzK,EAAGznE,KAAKynE,OAGE,MAAR6gF,EAAQ,QACDkxQ,GAAM1rO,EAAM6wO,OAAO3+Z,MAExBw5Z,EAAGhC,aAAelvQ,GACpBkxQ,EAAGvC,UAGFj3Z,KAAKokH,EAAEurE,eACV7B,EAAM1pE,EAAI0pE,EAAMggO,cAAc9tZ,KAAKokH,YAE5Bj9I,EAAI,EAAGA,EAAI64B,KAAKynE,EAAEjlD,KAAK,GAAIr7C,IAClC2mN,EAAM4wO,QAAQv3b,GAAK2mN,EAAMggO,cAAc9tZ,KAAK0+Z,QAAQv3b,WAE/C2mN,EAGTu0O,OAAOx5O,EAAIvgC,EAAO,YACTzhL,EAAGyS,GAAK0mB,KAAKgla,MAAMn8O,GAEpBiF,EAAAA,IAAYwd,EAAAA,CAChBpd,IAAKluL,KAAKkuL,IACV9/J,MAAOpuB,KAAKouB,MACZlnD,EAAG84B,KAAK94B,EACRL,EAAGA,EACHyS,EAAGA,EACHrlF,EAAG+rG,KAAK/rG,EACRwzK,EAAGznE,KAAKynE,EACR89C,EAAGvlH,KAAKulH,OAGE,MAAR+iC,EAAQ,OACJ77K,EAAIqhN,EAAM6wO,OAAO3+Z,MAEnBvzB,EAAE+qb,aAAelvQ,GACnB77K,EAAEwqb,UAGDj3Z,KAAKokH,EAAEurE,eACV7B,EAAM1pE,EAAI0pE,EAAMggO,cAAc9tZ,KAAKokH,YAE5Bj9I,EAAI,EAAGA,EAAI64B,KAAKynE,EAAEjlD,KAAK,GAAIr7C,IAClC2mN,EAAM4wO,QAAQv3b,GAAK2mN,EAAMggO,cAAc9tZ,KAAK0+Z,QAAQv3b,WAE/C2mN,EAGTw0O,UAAU1rO,EAAI8iG,EAAQpxI,EAAO,YACpBzhL,EAAG+2D,GAAK59B,KAAKgtZ,SAASp2N,EAAI8iG,GAE3B5rG,EAAAA,IAAY+d,EAAAA,CAChB3d,IAAKluL,KAAKkuL,IACV9/J,MAAOpuB,KAAKouB,MACZlnD,EAAG84B,KAAK94B,EACRL,EAAGA,EACH+2D,EAAGA,EACH3pI,EAAG+rG,KAAK/rG,EACRwzK,EAAGznE,KAAKynE,EACR89C,EAAGvlH,KAAKulH,OAGE,MAAR+iC,EAAQ,OACJ77K,EAAIqhN,EAAM6wO,OAAO3+Z,KAAM05R,GAEzBjtT,EAAE+qb,aAAelvQ,GACnB77K,EAAEwqb,aAGDj3Z,KAAKokH,EAAEurE,eACV7B,EAAM1pE,EAAI0pE,EAAMggO,cAAc9tZ,KAAKokH,GACnC0pE,EAAM1pE,EAAEv+G,aAGNioL,EAAMqyO,qBACCh5b,EAAI,EAAGA,EAAI64B,KAAKynE,EAAEjlD,KAAK,GAAIr7C,IAClC2mN,EAAM4wO,QAAQv3b,GAAK2mN,EAAMggO,cAAc9tZ,KAAK0+Z,QAAQv3b,IACpD2mN,EAAM4wO,QAAQv3b,GAAG0+B,mBAIdioL,EAGTwV,cAAc3zE,UACL+3S,EAAUr/N,SAASroM,KAAM2vH,GAGlCvoI,OAAOkhN,SACC34E,EAAOpqG,MAAMn+B,OAAOkhN,UAC1B34E,EAAK9oJ,EAAIm5B,KAAKn5B,EAAEw5N,UAAUj5M,SAC1BuoI,EAAKr2I,EAAI0mB,KAAK1mB,EAAE+mN,UAAUj5M,SACnBuoI,GAQX,MAAA+3S,UAAwBhhO,EACtB/5L,YAAYmhL,EAAOlgL,EAAGC,GACpBhV,EAAOi1L,aAAiBwd,GAExB/lL,MAAMuoK,EAAOr8K,GAEbzR,KAAK4N,EAAI5N,KAAK8tL,MAAM3jC,KACpBnqJ,KAAK6N,EAAI7N,KAAK8tL,MAAM3jC,KACpBnqJ,KAAK4mM,KAAM,EAEF,MAALh5L,GACF5N,KAAK+hK,MAAMn0J,EAAGC,GAGlBk0J,MAAMn0J,EAAGC,GACPhV,EAAO+U,aAAamgL,GACpBl1L,EAAOgV,aAAakgL,GAEpB/tL,KAAK4N,EAAIA,EACT5N,KAAK6N,EAAIA,EAEJ7N,KAAK4N,EAAEsgL,MACVluL,KAAK4N,EAAI5N,KAAK4N,EAAEqgL,MAAMjuL,KAAK8tL,MAAMI,MAE9BluL,KAAK6N,EAAEqgL,MACVluL,KAAK6N,EAAI7N,KAAK6N,EAAEogL,MAAMjuL,KAAK8tL,MAAMI,MAEnCluL,KAAK4mM,KAAM,EAGbvxK,eACMr1B,KAAK4mM,IACA5mM,KAAK8tL,MAAMkB,QAEbhvL,KAAK8tL,MAAMkB,MAAMhvL,KAAK4N,EAAG5N,KAAK6N,GAGvC0zZ,MAAM16b,UACGm5B,KAAKq1B,QAGdomW,UAAUloN,UACDvzK,KAAKq1B,QAGdugK,aAEM51L,KAAK4mM,IACA5mM,KAGFA,KAAK8tL,MAAMkB,MAAMhvL,KAAK4N,EAAG5N,KAAK6N,EAAE2gL,UAGzCxvM,IAAI9X,MAUF2xB,EAAO3xB,aAAawgc,GAGhB1na,KAAK4mM,IAAAA,OACA1/N,KAGLA,EAAE0/N,IAAAA,OACG5mM,QAGLA,KAAK4N,EAAE2F,GAAGrsC,EAAE0mC,UAET5N,KAAK6N,EAAE0F,GAAGrsC,EAAE2mC,GAIV7N,KAAKimM,MAHHjmM,KAAK8tL,MAAMkB,cAOhBvnH,EAAIvgG,EAAE0mC,EAAE6yL,OAAOzgM,KAAK4N,GAMpB7kB,EAHI7hB,EAAE2mC,EAAE4yL,OAAOzgM,KAAK6N,GAGdqoZ,OAAOzuV,GAMbghI,EAHIzoM,KAAK8tL,MAAMx0M,EAAEsnN,OAAO73M,EAAEolM,UAGnBS,QAAQ5uL,KAAK8tL,MAAMjnN,GAAG+nN,QAAQ5uL,KAAK4N,GAAGghL,QAAQ1nN,EAAE0mC,GAGvD86L,EAAK3/M,EAAE63M,OAAO5gM,KAAK4N,EAAE6yL,OAAOgI,IAAK7Z,QAAQ5uL,KAAK6N,UAE7C7N,KAAK8tL,MAAMkB,MAAMyZ,EAAIC,GAG9BzC,SAYMjmM,KAAK4mM,IAAAA,OACA5mM,QAGLA,KAAK6N,EAAEghL,SAAAA,OACF7uL,KAAK8tL,MAAMkB,cAGdvrB,EAAKzjK,KAAK4N,EAAEugL,SAAS4nO,SAAS,GAG9BryP,EAAK1jK,KAAK8tL,MAAMjnN,EAAE+5N,OAAO5gM,KAAK4N,GAAGmoZ,SAAS,GAG1C72a,EAAIukL,EAAG4qB,QAAQ3qB,GAAI2qB,QAAQruL,KAAK8tL,MAAM2U,KAGtCl9E,EAAIvlH,KAAK8tL,MAAMx0M,EAAEsnN,OAAO5gM,KAAK6N,GAAGkoZ,SAAS,GAGzChta,EAAI7J,EAAEg3a,OAAO3wS,GAMbkjF,EAHIzoM,KAAK8tL,MAAMx0M,EAAEsnN,OAAO73M,EAAEolM,UAGnBS,QAAQ5uL,KAAK8tL,MAAMjnN,GAAG+nN,QAAQ5uL,KAAK4N,GAAGghL,QAAQ5uL,KAAK4N,GAG1D86L,EAAK3/M,EAAE63M,OAAO5gM,KAAK4N,EAAE6yL,OAAOgI,IAAK7Z,QAAQ5uL,KAAK6N,UAE7C7N,KAAK8tL,MAAMkB,MAAMyZ,EAAIC,GAG9B7X,UACM7wL,KAAK4mM,IAAAA,MAAAA,IACG9tM,MAAM,yBAEXkH,KAAK4N,EAAEyyL,UAGhBvP,UACM9wL,KAAK4mM,IAAAA,MAAAA,IACG9tM,MAAM,yBAEXkH,KAAK6N,EAAEwyL,UAGhB9sL,GAAGrsC,UACD2xB,EAAO3xB,aAAawgc,GAGhB1na,OAAS94B,IAIT84B,KAAK4mM,IACA1/N,EAAE0/N,KAGP1/N,EAAE0/N,MAIC5mM,KAAK4N,EAAE2F,GAAGrsC,EAAE0mC,IACZ5N,KAAK6N,EAAE0F,GAAGrsC,EAAE2mC,KAGrB1G,IAAI6nL,UACFn2L,EAAOm2L,aAAiB04O,GAEpB1na,KAAK4mM,MAAQ5X,EAAM4X,KACb,GAEL5mM,KAAK4mM,KAAO5X,EAAM4X,IACd,EAEL5mM,KAAK4mM,KAAO5X,EAAM4X,IACb,EAEF5mM,KAAK2ja,QAAQx8Z,IAAI6nL,EAAM20O,UACvB3ja,KAAK6wL,OAAO1pL,IAAI6nL,EAAM6B,SACtB7wL,KAAK8wL,OAAO3pL,IAAI6nL,EAAM8B,QAG/BnB,oBAGS3vL,KAAK4mM,IAGd08N,kBACMtja,KAAK4mM,KAGF5mM,KAAK6N,EAAEghL,SAGhBN,eACMvuL,KAAK4mM,KAGF5mM,KAAK6N,EAAE2pZ,WAGhBr8O,gBACMn7K,KAAK4mM,KAGF5mM,KAAK6N,EAAE4pZ,YAGhB9yN,aACS3kM,KAGTslM,aACStlM,KAGT6tZ,aAEM7tZ,KAAK4mM,IACA5mM,KAAK8tL,MAAMuyO,SAGbrga,KAAK8tL,MAAMuyO,OAAOrga,KAAK4N,EAAG5N,KAAK8tL,MAAM2U,KAG9Cn/L,gBACStD,KAAK6tZ,MAAMvqZ,uBAGNwqL,EAAOn1D,EAAO2vB,UAC1BzvJ,EAAOi1L,aAAiBwd,GACjBxd,EAAM8gO,QAAQj2R,GAAOgsE,IAAIr8C,GAGlClhK,OAAOkhN,MACDtoM,KAAK4mM,IAAAA,MAAAA,UAGC5mM,KAAK6wL,OAAOzpM,SACZ4Y,KAAK8wL,OAAO1pM,UAKxB0gb,cACM9na,KAAK4mM,IAAAA,MAAAA,SAGH3pM,EAA8B,EAAvB+C,KAAK8tL,MAAMo/N,iBACd4a,EAAS9na,KAAK6wL,OAAQ5zL,GACtB6qa,EAAS9na,KAAK8wL,OAAQ7zL,oBAKlB6wL,EAAOn+D,MACrB92H,EAAOi1L,aAAiBwd,GACxBzyM,EAAOgF,MAAM/gB,QAAQ6yI,IACrB92H,EAAuB,IAAhB82H,EAAK1qJ,QACW,IAAhB0qJ,EAAK1qJ,QACW,IAAhB0qJ,EAAK1qJ,QAEQ,IAAhB0qJ,EAAK1qJ,OAAW,OACX6oN,EAAMkB,cAETphL,EAAImgL,EAAGsa,SAAS14E,EAAK,IACrB9hH,EAAIkgL,EAAGsa,SAAS14E,EAAK,WAEpBm+D,EAAMkB,MAAMphL,EAAGC,IAGvBipG,YACK92G,KAAK4mM,IACA,wBAEF,iBACQ5mM,KAAK4N,EAAEyyL,UAAUjiM,SAAS,GAAI,GACtC,MAAQ4B,KAAK6N,EAAEwyL,UAAUjiM,SAAS,GAAI,GACtC,KAQX,MAAAqra,UAAqB/iO,EACnB/5L,YAAYmhL,EAAOlgL,EAAG23G,GACpB1sH,EAAOi1L,aAAiBwd,GAExB/lL,MAAMuoK,EAAOr8K,GAEbzR,KAAK4N,EAAI5N,KAAK8tL,MAAM2U,IACpBziM,KAAKulH,EAAIvlH,KAAK8tL,MAAM3jC,KAEX,MAALv8I,GACF5N,KAAK+hK,MAAMn0J,EAAG23G,GAGlBw8C,MAAMn0J,EAAG23G,GACP1sH,EAAO+U,aAAamgL,GACpBl1L,EAAY,MAAL0sH,GAAcA,aAAawoE,GAElC/tL,KAAK4N,EAAIA,EACT5N,KAAKulH,EAAIA,GAAKvlH,KAAK8tL,MAAM2U,IAEpBziM,KAAK4N,EAAEsgL,MACVluL,KAAK4N,EAAI5N,KAAK4N,EAAEqgL,MAAMjuL,KAAK8tL,MAAMI,MAE9BluL,KAAKulH,EAAE2oE,MACVluL,KAAKulH,EAAIvlH,KAAKulH,EAAE0oE,MAAMjuL,KAAK8tL,MAAMI,MAGrC74J,eACSr1B,KAAK8tL,MAAMuyO,OAAOrga,KAAK4N,EAAG5N,KAAKulH,GAGxCsgF,WAAWC,EAAOvyB,UAETvzK,KAGTi8H,cACMj8H,KAAK2vL,aAAAA,OACA,UAGF/hL,EAAAA,EAAG23G,GAAKvlH,KACTu/L,EAAK3xL,EAAEugL,SACPQ,EAAK4Q,EAAGqB,OAAOhzL,GACfw7L,EAAK7jF,EAAE4oE,SACP27O,EAAM9pa,KAAK8tL,MAAMjnN,EAAE+5N,OAAOrB,GAAIqB,OAAOr7E,UAKN,IAJzBopE,EAAGN,QAAQy7O,GAAKz7O,QAAQzgL,EAAEgzL,OAAOwI,IAC9BxI,OAAO5gM,KAAK8tL,MAAMs3O,IAGvBxkO,OAAOr7E,GAAGmyS,YAGtB7xZ,mBAKM7F,KAAK2vL,cAIL3vL,KAAKulH,EAAEhyG,GAAGvT,KAAK8tL,MAAM2U,OAIzBziM,KAAK4N,EAAI5N,KAAK4N,EAAEsoZ,OAAOl2Z,KAAKulH,GAG5BvlH,KAAKulH,EAAIvlH,KAAK8tL,MAAM2U,KAVXziM,KAeXuha,MAAM16b,MACJgyB,EAAOhyB,aAAaknN,GAGhB/tL,KAAK2vL,aAAAA,OACA3vL,KAAK8tL,MAAMuyO,eAGd53N,EAAKzoM,KAAK4N,EAAEgzL,OAAO/5N,GAGnBwiO,EAAKrpM,KAAKulH,EAAEq7E,OAAO/5N,UAElBm5B,KAAK8tL,MAAMuyO,OAAO53N,EAAIY,GAG/BzT,aAES51L,KAGTimM,YAQQwF,EAHIzrM,KAAK4N,EAAE4yL,OAAOxgM,KAAKulH,GAGhB4oE,SAMPud,EAHI1rM,KAAK4N,EAAE6yL,OAAOzgM,KAAKulH,GAGhB4oE,SAGP1hN,EAAIg/N,EAAGhL,OAAOiL,GAGdjD,EAAKgD,EAAG7K,OAAO8K,GAGfrC,EAAK58N,EAAEm0N,OAAO8K,EAAGrd,QAAQruL,KAAK8tL,MAAM0d,IAAI5K,OAAOn0N,YAE9CuzB,KAAK8tL,MAAMuyO,OAAO53N,EAAIY,GAG/Bg6N,WAAWv7N,EAAI+4N,GAGbhoa,EAAOivM,aAAc2hO,GACrB5wa,EAAOgoa,aAAc4I,SAGf5ic,EAAIihO,EAAGl6L,EAAE4yL,OAAOsH,EAAGviF,GAGnBkmF,EAAK5kO,EAAEsnN,SAGP70M,EAAIwuN,EAAGl6L,EAAE6yL,OAAOqH,EAAGviF,GAGnBmmF,EAAKpyN,EAAE60M,SAGPp6R,EAAI03S,EAAGhL,OAAOiL,GAGdj/N,EAAIo0b,EAAGjzZ,EAAE4yL,OAAOqgO,EAAGt7S,GAMnBz/B,EAHI+6U,EAAGjzZ,EAAE6yL,OAAOogO,EAAGt7S,GAGZq7E,OAAO/5N,GAGdw5E,EAAK5zE,EAAEm0N,OAAOtnN,GAGdgjb,EAAKt8Z,KAAKulH,EAAEq7E,OAAO96G,EAAG06G,OAAOngJ,GAAI8tI,UAGjC47O,EAAK/pa,KAAK4N,EAAEgzL,OAAO96G,EAAG8oG,QAAQvuI,GAAI8tI,UAGlC43D,EAAKt6C,EAAG7K,OAAO8K,GAGfw7N,EAAKnzgB,EAAE6sS,OAAO8K,EAAGrd,QAAQruL,KAAK8tL,MAAM0d,IAAI5K,OAAO7sS,YAGnDisG,KAAK8tL,MAAMuyO,OAAOt6K,EAAImhL,GACtBlna,KAAK8tL,MAAMuyO,OAAO/D,EAAIyN,IAI1Bl5O,UACM7wL,KAAK2vL,aAAAA,MAAAA,IACG72L,MAAM,yBAElBkH,KAAK6F,YAEE7F,KAAK4N,EAAEyyL,UAGhBvP,KAAKxoC,UACItoJ,KAAK2kM,IAAIr8C,GAAMwoC,OAGxBv9K,GAAGrsC,MACD2xB,EAAO3xB,aAAauic,GAGhBzpa,OAAS94B,EAAAA,OACJ,KAGL84B,KAAK2vL,aAAAA,OACAzoN,EAAEyoN,gBAGPzoN,EAAEyoN,aAAAA,OACG,KAGL3vL,KAAKulH,EAAEhyG,GAAGrsC,EAAEq+I,GAAAA,OACPvlH,KAAK4N,EAAE2F,GAAGrsC,EAAE0mC,SAGf0xL,EAAKt/L,KAAK4N,EAAEgzL,OAAO15N,EAAEq+I,GACrBg6E,EAAKr4N,EAAE0mC,EAAEgzL,OAAO5gM,KAAKulH,UAEpB+5E,EAAG/rL,GAAGgsL,GAGfp4L,IAAI6nL,GACFn2L,EAAOm2L,aAAiBy6O,SAElBR,EAAOjpa,KAAK2vL,aACZu5O,EAAOl6O,EAAMW,oBAEfs5O,IAASC,GACH,GAELD,GAAQC,EACJ,EAELD,GAAQC,EACH,EAEFlpa,KAAK2ja,QAAQx8Z,IAAI6nL,EAAM20O,UACvB3ja,KAAK6wL,OAAO1pL,IAAI6nL,EAAM6B,QAG/BlB,oBAES3vL,KAAKulH,EAAEspE,SAGhBy0O,kBACMtja,KAAK2vL,cAGF3vL,KAAK4N,EAAEihL,SAGhBN,eACS,EAGTpT,gBACS,EAGT6zO,oBACMhvZ,KAAK2vL,iBAIL3vL,KAAK4N,EAAEihL,UAGJtpK,MAAMypY,cAGf2U,mBAEW3ja,KAAK2kM,MAAMg/N,cACX5vgB,cACIg6R,EAAG,IAIlB21O,KAAKrvgB,GAOHwkG,EAAOxkG,aAAa05R,GACpBl1L,GAAQxkG,EAAE65R,WAEJ9zD,EAAO/lO,EAAE48Q,gBAEXpqM,EAAIm5B,KAAK8tL,MAAMuyO,SACf/mb,EAAI0mB,aAEC74B,EAAIizJ,EAAO,EAAGjzJ,GAAK,EAAGA,IAAAA,CAGjB,IAFA9yE,EAAEoiS,IAAItvN,IAGfN,EAAGyS,GAAK0mB,KAAKqja,WAAWx8b,EAAGyS,IAE3BA,EAAGzS,GAAKm5B,KAAKqja,WAAW/pb,EAAGzS,UAGzBA,EAGTg9b,UAAUxvgB,EAAGk/Q,UACNA,EAIEvzK,KAAKy7X,UAAUloN,GAAKmwP,KAAKrvgB,GAHvB2rG,KAAK0ja,KAAKrvgB,GAMrBy0S,QAAQ9rB,EAAI8qB,EAAIjW,aACJ/4L,MAAM,oBAGlB6rM,IAAIr8C,EAAO,aACTzvJ,EAAe,MAARyvJ,GAAgC,kBAATA,GAE1BtoJ,KAAK2vL,aACA3vL,KAAK8tL,MAAMkB,SAEpBhvL,KAAK6F,YAEE7F,KAAK8tL,MAAM4X,WAAW1lM,KAAK4N,EAAG06I,IAGvCg9C,aACStlM,KAGT6tZ,aACS7tZ,KAGThrG,SACMgrG,KAAK2vL,aAAAA,MAAAA,GACG3vL,KAAK8tL,MAAM7gG,SAEvBjtF,KAAK6F,kBAEC+H,EAAI5N,KAAK6wL,OAAOzyL,SAAS,aAErB4B,KAAK8tL,MAAM7gG,OAAOr/E,IAG9BtK,gBAEStD,KAAK8tL,MAAMmhO,YAAYjvZ,KAAK6wL,sBAGvB/C,EAAOn1D,GACnB9/H,EAAOi1L,aAAiBwd,SAGlB19L,EAAIkgL,EAAM6zO,YAAYhpS,GAO5B/qH,EAAEulZ,QAAQrlO,EAAMq/N,iBAMVjmb,EAAI4mN,EAAMuyO,OAAOzyZ,EAAGkgL,EAAM2U,YAEhC5pM,GAAQ3xB,EAAEyoN,cAEHzoN,EAGTkgB,OAAOkhN,UACEtoM,KAAK2kM,MAAMv9M,OAAOkhN,GAG3Bw/N,kBACS9na,KAAK2kM,MAAMmjO,2BAGJh6O,EAAOn+D,UACd+3S,EAAUr/N,SAASva,EAAOn+D,GAAMk+R,OAGxC/2S,YACK92G,KAAK2vL,aACA,qBAEF,cACO3vL,KAAK4N,EAAEyyL,UAAUjiM,SAAS,GAAI,GACtC,MAAQ4B,KAAKulH,EAAE86E,UAAUjiM,SAAS,GAAI,GACtC,KAQV,MAAAytM,UAA2BmyN,EACzBrxZ,YAAYqE,GACVuU,MAAMoiZ,EAAc,UAAW32Z,GAE/BhR,KAAKn5B,EAAIknN,EAAGsa,SAASr3L,EAAKnqC,GAAGonN,MAAMjuL,KAAKkuL,KACxCluL,KAAK49B,EAAImwJ,EAAGsa,SAASr3L,EAAK4sB,GAAGqwJ,MAAMjuL,KAAKkuL,KACxCluL,KAAK9jB,EAAI6xM,EAAGsa,SAASr3L,EAAK90B,GAAK,KAAK+xM,MAAMjuL,KAAKkuL,KAC/CluL,KAAKkjX,GAAKljX,KAAK9jB,EAAE2yM,SAAW7uL,KAAKmqJ,KAAOnqJ,KAAK9jB,EAAE27a,YAE/C73Z,KAAK3rG,EAAI2rG,KAAK49B,EAAEo4X,QAAQ,GACxBh2Z,KAAKgqa,KAAOhqa,KAAK49B,EAAE4wJ,SAAShsK,KAAK,GACjCxiB,KAAKyna,IAAMzna,KAAKn5B,EAAE25N,OAAOxgM,KAAK49B,GAAGgjK,OAAO5gM,KAAKy+Z,IAE7Cz+Z,KAAK8rM,SAAW9rM,KAAKn5B,EAAE0sC,GAAGvT,KAAKyiM,KAC/BziM,KAAKiqa,KAAOjqa,KAAKn5B,EAAE0sC,GAAGvT,KAAKyiM,KAC3BziM,KAAK+rM,MAAQ/rM,KAAKn5B,EAAE0sC,GAAGvT,KAAKyiM,IAAIjU,UAChCxuL,KAAKkqa,OAAuB,MAAdlqa,KAAKouB,OAA4C,IAA3BpuB,KAAK49B,EAAE4wJ,SAASvpN,OACpD+6B,KAAKwxE,IAAM,KAEXxxE,KAAK++Z,UAAU/tZ,uBAGGuzZ,EAAQ4F,EAAQxF,GAWlC9ra,EAAO0ra,aAAkBx2O,GACzBl1L,EAAOsxa,aAAkBp8O,GACzBl1L,EAAO8ra,aAAmB52O,SAEpBlnN,EAAI89b,EAAQtvY,QACZuI,EAAI+mY,EAAQ/jO,OAAOupO,GAAQjU,OAAOqO,MAGlB,IAFZA,EAAOrO,OAAOyO,GAElBjN,YAAgB,MAAA,IACV5+Z,MAAM,mCAEVjyB,EAAG+2D,GAGbknY,OAAOluO,EAAI0F,WASFz1N,EAAAA,EAAG+2D,GAAK59B,KACT8jK,EAAKj9L,EAAEsnN,SACPiJ,EAAKtzB,EAAG88B,OAAO/5N,GACfo0M,EAAKr9I,EAAEuwJ,SACPi8O,EAAKnvP,EAAG2lB,OAAOhjK,GACfysY,EAAOxjc,EAAE+5N,OAAOhjK,GAAGm4X,SAAS,IAC5BuU,EAAMxmQ,EAAG88B,OAAOhjK,GAChB2sY,EAAM1jc,EAAE+5N,OAAO3lB,GACf+L,EAAKsjP,EAAIj8O,QAAQk8O,GAAKxU,SAAS,IAC/BqT,EAAKtlQ,EAAG08B,OAAO6pO,GAAMh8O,QAAQpT,GAAIm7O,SAAS,IAC1CiT,EAAKriP,EAAG4H,QAAQwI,GAAIxI,QAAQw7O,GAAIhU,QAAQ,YAEpC,MAANx/N,EACKsP,EAAW6+N,aAAaqE,EAAIC,EAAIzyO,EAAI0F,IAErC8sO,EAAIC,GAGdrE,MAAMn8O,EAAI6wG,GAAS,OAkCb8wI,EAAKnlN,EAFTxsN,EAAyB,kBAAX6gS,GAIVA,GACF8wI,EAAMxqa,KAAK49B,EAAE4iK,OAAOxgM,KAAKn5B,GACzBw+O,EAAMrlN,KAAK49B,EAAE6iK,OAAOzgM,KAAKn5B,KAEzB2jc,EAAMxqa,KAAKn5B,EAAE25N,OAAOxgM,KAAK49B,GACzBynL,EAAMrlN,KAAKn5B,EAAE45N,OAAOzgM,KAAK49B,UAGrB2nF,EAAI8/F,EAAIwyM,YACRhxb,EAAI2jc,EAAIxU,QAAQ,GAAGp1N,OAAOr7E,GAC1BjsI,EAAIisI,EAAEywS,QAAQ,UAEV,MAANntO,EACKyiB,EAAUy5N,aAAal+b,EAAGyS,EAAGuvM,IAE9BhiN,EAAGyS,GAGb0za,SAASp2N,UACAiV,EAAak5N,aAAa/ka,KAAKn5B,EAAGm5B,KAAK49B,EAAGg5J,GAGnDkpO,YAAYhyO,GACVj1L,EAAOi1L,aAAiBoY,SAEjBhU,EAAIsnO,GAAM1rO,EAAM6wO,OAAO3+Z,aAEtBA,KAAKoga,MAAMluO,EAAG2lO,aACd73Z,KAAKoga,MAAM5G,EAAG3B,cAGxBkI,WAAWjyO,EAAO4rG,GAAS,MA2BzB7gS,EAAOi1L,aAAiBwd,GACxBzyM,EAAyB,kBAAX6gS,GAEV15R,KAAKokH,EAAEurE,cAAgB7B,EAAM1pE,EAAEurE,aAAAA,OAC1B9oN,GAAKinN,EAAMk/N,SAAS,KAAMtzH,UAE1B15R,KAAKoga,MAAMv5b,GAAG8vb,WAAW32Z,KAAKn5B,SAGjC+mC,EAAIkgL,EAAM1pE,EAAEx2G,EAAEsoZ,OAAOpoO,EAAM1pE,EAAEv2G,UAE5B7N,KAAKokH,EAAEx2G,EAAEsoZ,OAAOl2Z,KAAKoga,MAAMxyZ,IAGpCoyZ,cAAclyO,UAQZj1L,EAAOi1L,aAAiB+d,GAEpB7rM,KAAKokH,EAAEurE,cAAgB7B,EAAM1pE,EAAEurE,aAC1B3vL,KAAKoga,MAAMtyO,EAAMjnN,GAAG8vb,WAAW32Z,KAAKn5B,GAEtCm5B,KAAKokH,EAAEx2G,EAAEsoZ,OAAOl2Z,KAAKoga,MAAMtyO,EAAM1pE,EAAEx2G,IAG5Cs+L,MAAMx6L,UACJ7Y,EAAO6Y,aAAeq8K,GAGlB/tL,KAAKiqa,KACAv4Z,EAAI2jB,QAGTr1B,KAAK+rM,MACAr6L,EAAI88K,SAENxuL,KAAKn5B,EAAE+5N,OAAOlvL,GAGvB+4Z,MAAM/4Z,UACJ7Y,EAAO6Y,aAAeq8K,GAGlB/tL,KAAKkqa,OACAx4Z,EAAIskZ,QAAQh2Z,KAAKgqa,KAEnBhqa,KAAK49B,EAAEgjK,OAAOlvL,GAGvBg5Z,YAAY3rX,WAqEH7iE,EAAAA,GAAGgnY,EAAAA,GAAIq7C,EAAAA,IAAI97N,EAAAA,IAAKY,GAAOrjM,KACxBvzB,EAAIy2Y,EAAG/0L,SAAS4nO,SAAS,GACzB4U,EAAKzub,EAAEiyM,SAASyS,OAAO29N,GACvBqM,EAAMD,EAAGx8O,SACTngL,EAAIvhC,EAAE+zN,OAAOmqO,GACbvuQ,EAAKpuJ,EAAEmgL,SAASS,QAAQyU,GACxBwnO,EAAMp+b,EAAEg0N,OAAOgC,GACfknO,EAAKlnO,EAAIhC,OAAO1hJ,GAChB6qX,EAAKnnO,EAAIjC,OAAOzhJ,GAChBm1C,EAAI01U,EAAG/6O,SAAW+6O,EAAKD,EAAGzT,OAAO0T,GACjC13O,EAAKh+F,EAAEi6F,SACPqrO,EAAKtnO,EAAG0O,OAAO1sG,GAEfpvB,EADK00V,EAAG54N,OAAO1O,GACRsO,OAAOpkC,EAAGwkC,OAAO44N,IAAKnrO,QAAQn6F,GACrC42U,EAAK9qa,KAAKoga,MAAMt7V,EAAE4yV,aAClB/qJ,EAAK3sQ,KAAKoga,MAAMluO,EAAGsO,OAAOoqO,GAAKlT,aAC/B9qJ,EAAKk+J,EAAGlqO,OAAO+rE,GACfxmF,EAAI2kP,EAAGlqO,OAAO1sG,GACdkyF,EAAI0kP,EAAGlqO,OAAO97H,GAAGwpH,UAAUsS,OAAOgsE,GAClCm+J,EAAKtoO,EAAIjC,OAAOra,GAChB6kP,EAAKh9Z,EAAE4yL,OAAOza,GACd8kP,EAAMF,EAAG58O,SACT+b,EAAK2gO,EAAIjqO,OAAO1kN,GAAG0kN,OAAOza,GAAGya,OAAOmqO,GACpCxK,EAAKrsU,EAAE26F,SAAW7uL,KAAKyiM,IAAMrc,EAC7B+jB,EAAK6gO,EAAGvqO,OAAOwqO,GACflzJ,EAAKizJ,EAAGxqO,OAAOyqO,UAEdjra,KAAKsga,OAAOp2N,EAAIq2N,EAAIp2N,EAAI4tE,GAGjCmzJ,SAAShkc,EAAGy2N,WAsBHzhN,EAAAA,GAAGgnY,EAAAA,GAAIq7C,EAAAA,IAAI97N,GAAOziM,QAClB4N,EAAAA,EAAGC,EAAAA,EAAG03G,GAAKr+I,EACZohL,EAAc,EAAPq1C,EACPlxN,EAAIy2Y,EAAG/0L,SAAS4nO,SAAS,GACzB4U,EAAKzub,EAAEiyM,SAASyS,OAAO29N,GACvBqM,EAAMD,EAAGx8O,SACTngL,EAAIvhC,EAAE+zN,OAAOmqO,GACbE,EAAMp+b,EAAEg0N,OAAOgC,GACf0oO,EAAKt9Z,EAAE4yL,OAAOl7E,GACd8jF,EAAKx7L,EAAE2yL,OAAOj7E,GAAGwwS,SAAS,GAC1B9hgB,EAAIo1S,EAAGxa,SAAWwa,EAAK8hO,EAAGjV,OAAO7sN,GACjC+hO,EAAM3oO,EAAIjC,OAAOvsS,EAAE2sS,OAAO5yL,IAG1Bm4K,EAFKilP,EAAIj9O,SAASS,QAAQ6T,GACnBnU,UACDmS,OAAO2qO,GACbL,EAAKtoO,EAAIjC,OAAOra,GAEhBC,EADKykP,EAAIjqO,OAAO1kN,GAAG0kN,OAAOza,GAAGya,OAAOmqO,GAC7BnqO,OAAOhzL,EAAEgzL,OAAOr7E,IACvB8lT,EAAKllP,EAAEgI,SAASE,QAAQu8O,GAExB12U,EADIl0F,KAAKoga,MAAMh6O,EAAEwa,OAAOyqO,GAAI3T,aACtB92N,OAAOza,GACb1kK,EAAKghL,EAAIhC,OAAOvsG,GAChBo3U,EAAK7oO,EAAIjC,OAAOtsG,GAChBn1C,EAAIusX,EAAGz8O,SAAWy8O,EAAK7pZ,EAAGy0Y,OAAOoV,UAEnCvsX,EAAEy4W,aAAen6a,QAAQirK,IAC3BvpG,EAAEk4W,UAEGl4W,EAGTwsX,cACOvra,KAAKwxE,MACRxxE,KAAKwxE,IAAMxxE,KAAKqia,UAEXria,KAAKwxE,IAGdyuV,mBACQuL,EAAKxra,KAAKn5B,EAAE+5N,OAAO5gM,KAAK49B,GACxBynL,EAAMrlN,KAAKn5B,EAAE45N,OAAOzgM,KAAK49B,UAGvB4tY,EAAG5qO,OAAOykB,GAAKx2B,SAGzBqxO,eAESr5b,EAAAA,EAAG+2D,GAAK59B,KACTwra,EAAK3kc,EAAE+5N,OAAOhjK,GACd6tY,EAAO5kc,EAAE45N,OAAO7iK,GAAG82X,QAAQ,GAC3B5wP,EAAKj9L,EAAEsnN,SACPlT,EAAKr9I,EAAEuwJ,SAEPt0I,EADKiqH,EAAG08B,OAAOgrO,EAAGxV,QAAQ,KAAK3nO,QAAQpT,GAC9By5O,QAAQ,GAAGqB,SAAS,IAC7B9tN,EAAMujO,EAAG5qO,OAAO6qO,MAElBxjO,EAAIpZ,SAAAA,MAAAA,IACI/1L,MAAM,iCAGX+gD,EAAIq8W,OAAOjuN,GAAK5H,UAGzB8/N,oBACgC,IAAvBnga,KAAKn5B,EAAE6wb,cACiB,IAAxB13Z,KAAK49B,EAAE85X,YAGhB1oO,MAAMphL,EAAGC,EAAG03G,EAAGxmE,cACF4oX,EAAa3na,KAAM4N,EAAGC,EAAG03G,EAAGxmE,GAGzCylJ,OAAO52L,EAAGC,EAAG03G,UACX1sH,EAAY,MAAL+U,GAAkB,MAALC,GAAkB,MAAL03G,GAC1BvlH,KAAKgvL,QAGdsxO,OAAOp2N,EAAIq2N,EAAIp2N,EAAI4tE,GACjBl/Q,EAAOqxM,aAAcnc,GACrBl1L,EAAO0na,aAAcxyO,GACrBl1L,EAAOsxM,aAAcpc,GACrBl1L,EAAOk/Q,aAAchqF,SAEfngL,EAAIs8L,EAAGtJ,OAAOm3E,GACdlqQ,EAAIs8L,EAAGvJ,OAAO2/N,GACdh7S,EAAIg7S,EAAG3/N,OAAOm3E,GACdh5N,EAAImrJ,EAAGtJ,OAAOuJ,UAEbnqM,KAAKgvL,MAAMphL,EAAGC,EAAG03G,EAAGxmE,GAG7ByhX,QAAQ3yZ,GAENhV,EAAOgV,aAAakgL,SAGd0Z,EAAK55L,EAAEsgL,SACP8Z,EAAMjoM,KAAKyqa,MAAMhjO,GAAI7Y,QAAQ5uL,KAAKn5B,UAC5B4gO,EAAG7Y,QAAQ5uL,KAAKyiM,KACbyzN,OAAOjuN,GAKxBw4N,OAAO5yZ,SAKC45L,EAAK55L,EAAEsgL,SACP8Z,EAAMjoM,KAAKyqa,MAAMhjO,GAAI7Y,QAAQ5uL,KAAKn5B,UAC5B4gO,EAAG7Y,QAAQ5uL,KAAKyiM,KAEjBk0N,WAAW1uN,GAGxBy4N,QAAQ9yZ,GACN/U,EAAO+U,aAAamgL,SAGdwR,EAAK3xL,EAAEugL,SACPt0I,EAAM75C,KAAKksM,MAAM3M,GAAI3Q,QAAQ5uL,KAAKyiM,KAClCwF,EAAMjoM,KAAKyqa,MAAMlrO,GAAI3Q,QAAQ5uL,KAAKyiM,YAC7B5oJ,EAAIq8W,OAAOjuN,GAKxB04N,OAAO/yZ,SAKC2xL,EAAK3xL,EAAEugL,SACPt0I,EAAM75C,KAAKksM,MAAM3M,GAAI3Q,QAAQ5uL,KAAKyiM,KAClCwF,EAAMjoM,KAAKyqa,MAAMlrO,GAAI3Q,QAAQ5uL,KAAKyiM,YAEjC5oJ,EAAI88W,WAAW1uN,GAGxBhsE,SAAS+yD,MAGPn2L,EAAOm2L,aAAiB24O,GAGpB34O,EAAM8X,KAAAA,OAEFvH,EAAKvQ,EAAMphL,EAAEugL,SACbsZ,EAAKzY,EAAMnhL,EAAEsgL,SACbu9O,EAAM1ra,KAAKyqa,MAAMlrO,GAAIqB,OAAO6G,GAC5B5tJ,EAAM75C,KAAKksM,MAAM3M,GAAIlR,QAAQoZ,GAC7BQ,EAAMjoM,KAAKyiM,IAAIjC,OAAOkrO,GACtBJ,EAAKt8O,EAAMjwI,EACX4sX,EAAK38O,EAAMphL,EAAEgzL,OAAO5R,EAAMnhL,UAEzBgsC,EAAItmC,GAAG00L,IAAQqjO,EAAG/3Z,GAAGo4Z,SAIxBpsO,EAAKvQ,EAAMphL,EAAEugL,SACbsZ,EAAKzY,EAAMnhL,EAAEsgL,SACbib,EAAKpa,EAAMzpE,EAAE4oE,SACb+4O,EAAK99N,EAAGjb,SACRu9O,EAAM1ra,KAAKyqa,MAAMlrO,GAAIqB,OAAO6G,GAC5B5tJ,EAAM75C,KAAKksM,MAAM3M,GAAIlR,QAAQoZ,GAAI7G,OAAOwI,GACxCnB,EAAMi/N,EAAG74O,QAAQq9O,GACjBJ,EAAKt8O,EAAMjwI,EAAE6hJ,OAAO5R,EAAMzpE,GAC1BomT,EAAK38O,EAAMphL,EAAEgzL,OAAO5R,EAAMnhL,UAEzBgsC,EAAItmC,GAAG00L,IAAQqjO,EAAG/3Z,GAAGo4Z,GAG9BjmO,WAAW93L,EAAG06I,EAAO,MACnBzvJ,EAAO+U,aAAamgL,GACpBl1L,EAAe,MAARyvJ,GAAgC,kBAATA,GAEzB16I,EAAEsgL,MACLtgL,EAAIA,EAAEqgL,MAAMjuL,KAAKkuL,YAEbrgL,EAAI7N,KAAK2ga,OAAO/yZ,MAEV,MAAR06I,EAAQ,IACNz6I,EAAEghL,UAAYvmC,EAAAA,MAAAA,IACNxvJ,MAAM,kBAEd+U,EAAE2pZ,aAAelvQ,GACnBz6I,EAAEopZ,iBAGCj3Z,KAAKgvL,MAAMphL,EAAGC,GAGvBu+L,WAAWv+L,EAAGy6I,EAAO,MACnBzvJ,EAAOgV,aAAakgL,GACpBl1L,EAAe,MAARyvJ,GAAgC,kBAATA,GAEzBz6I,EAAEqgL,MACLrgL,EAAIA,EAAEogL,MAAMjuL,KAAKkuL,YAEbtgL,EAAI5N,KAAKyga,OAAO5yZ,MAEV,MAARy6I,EAAQ,IACN16I,EAAEihL,UAAYvmC,EAAAA,MAAAA,IACNxvJ,MAAM,kBAEd8U,EAAE4pZ,aAAelvQ,GACnB16I,EAAEqpZ,iBAGCj3Z,KAAKgvL,MAAMphL,EAAGC,GAGvBgxZ,aAAa/wO,EAAO4rG,GAAS,MAG3B7gS,EAAOi1L,aAAiBkwO,GACxBnla,EAAyB,kBAAX6gS,IAET5rG,EAAM5mN,EAAEqsC,GAAGvT,KAAK94B,GAAAA,OACZ,KAGU,UAAf4mN,EAAMhnN,KAAS,OACVgnN,EAAM+wO,aAAa7+Z,SAIT,SAAf8tL,EAAMhnN,KAAS,OAEXD,EAAIm5B,KAAKoga,MAAMtyO,EAAMjnN,OAEvB2jc,EAAKnlN,SAELq0E,GACF8wI,EAAMxqa,KAAK49B,EAAE4iK,OAAOxgM,KAAKn5B,GACzBw+O,EAAMrlN,KAAK49B,EAAE6iK,OAAOzgM,KAAKn5B,KAEzB2jc,EAAMxqa,KAAKn5B,EAAE25N,OAAOxgM,KAAK49B,GACzBynL,EAAMrlN,KAAKn5B,EAAE45N,OAAOzgM,KAAK49B,IAGpB/2D,EAAE+5N,OAAOykB,GAAK9xM,GAAGi3Z,EAAIzU,SAAS,OAIpB,YAAfjoO,EAAMhnN,KAAS,OAEXD,EAAIm5B,KAAKoga,MAAMtyO,EAAMjnN,GACrB+2D,EAAI59B,KAAKoga,MAAMtyO,EAAMlwJ,UAEpB59B,KAAKn5B,EAAE+5N,OAAOhjK,GAAGrqB,GAAG1sC,EAAE+5N,OAAO5gM,KAAK49B,WAGpC,EAGTkhY,YAAYhxO,MAGVj1L,EAAOi1L,aAAiBkwO,IAEnBlwO,EAAM5mN,EAAEqsC,GAAGvT,KAAK94B,GAAAA,OACZ,KAGU,SAAf4mN,EAAMhnN,KAAS,KACZk5B,KAAKn5B,EAAE0sC,GAAGvT,KAAKyiM,KAAAA,OACX,QAEH57N,EAAIm5B,KAAKoga,MAAMtyO,EAAMjnN,GACrByS,EAAI0mB,KAAKoga,MAAMtyO,EAAMx0M,GACrBsyb,EAAM5ra,KAAKqjM,IAAI5C,OAAOzgM,KAAK49B,EAAEo4X,QAAQ,WAEpCnvb,EAAE0sC,GAAGq4Z,IAAQtyb,EAAEi6B,GAAGvT,KAAKyiM,QAIb,YAAf3U,EAAMhnN,KAAS,OACXD,EAAIm5B,KAAKoga,MAAMtyO,EAAMjnN,GACrB+2D,EAAI59B,KAAKoga,MAAMtyO,EAAMlwJ,UAEpB/2D,EAAE0sC,GAAGvT,KAAKn5B,EAAE2nN,WACZ5wJ,EAAErqB,GAAGvT,KAAK49B,EAAE6iK,OAAOzgM,KAAKn5B,WAG1B,EAGT+5b,eAAe5xO,MAEbn2L,EAAOm2L,aAAiBk1O,GAEpBlka,KAAK6+Z,aAAa7vO,EAAMlB,OAAAA,IAetBkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,WAEVA,EAAMnhL,EAAEghL,SAAAA,OACH7uL,KAAKgvL,MAAMhvL,KAAKmqJ,KAAMnqJ,KAAKyiM,IAAIjU,kBAEjC3nN,EAAAA,EAAG+2D,GAAK59B,MACRkyL,EAAIsnO,GAAMx5Z,KAAK2+Z,OAAO3vO,EAAMlB,OAC7B4J,EAAK7wN,EAAEmvb,QAAQ,GACfqP,EAAKznY,EAAEo4X,QAAQ,GACfpoZ,EAAI5N,KAAKoga,MAAMpxO,EAAMphL,GAAGgzL,OAAO1O,GAC/BrkL,EAAI7N,KAAKoga,MAAMpxO,EAAMnhL,GAAG+yL,OAAO44N,GAC/Ba,EAAKzsZ,EAAEooZ,QAAQ,GACfsE,EAAM1sZ,EAAEooZ,QAAQ,IAChB9rN,EAAKmwN,EAAG55N,OAAO55N,GAAG+nN,QAAQhxJ,GAC1B2iY,EAAK1yZ,EAAEmoZ,QAAQ,GACf7rN,EAAKmwN,EAAI75N,OAAO/I,GAAIrJ,QAAQzwJ,GAC5Bm6O,EAAKuiJ,EAAI95N,OAAO35N,GAAG+nN,QAAQy2O,UAE1Brla,KAAKsga,OAAOp2N,EAAIq2N,EAAIp2N,EAAI4tE,aAGvBj/Q,MAAM,oBAGlBg1Z,cAAc9+N,GAIZn2L,EAAOm2L,aAAiB04O,GACxB7ua,EAAOm2L,EAAMlB,MAAM5mN,EAAEqsC,GAAGvT,KAAK94B,UAGvBgtH,EAAIl0F,KAAKoga,MAAMpxO,EAAMphL,GACrBk3D,EAAI9kE,KAAKoga,MAAMpxO,EAAMnhL,MAEvB7N,KAAK8+Z,YAAY9vO,EAAMlB,OAAAA,IAkBrBkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,WAEVA,EAAMphL,EAAEihL,SAAAA,OACH7uL,KAAKgvL,cAERkD,EAAKh+F,EAAEi6F,SACPqrO,EAAKtnO,EAAG0O,OAAO1sG,GACf0wU,EAAKpL,EAAG54N,OAAO1sG,GACfulU,EAAKmL,EAAGhkO,OAAO1sG,GACf2zG,EAAK/iI,EAAEqpH,SACPtnN,EAAIi+F,EAAEkxV,QAAQ,GACd18a,EAAI44M,EAAGuO,OAAOzgM,KAAKyiM,KACnBh2N,EAAIylN,EAAG8jO,QAAQ,GACfp4X,EAAIiqK,EAAGmuN,QAAQ,GACfjigB,EAAIylgB,EAAGzD,SAAS,GAChBr0W,EAAIwyC,EAAE0sG,OAAOiH,GAAIkuN,SAAS,GAC1B3xS,EAAI8tE,EAAG0O,OAAOiH,GAAIkuN,SAAS,GAC3BtuV,EAAIogI,EAAGkuN,SAAS,GAChB7rN,EAAKrjO,EAAE+5N,OAAOtnN,GACdinb,EAAKqE,EAAGh2O,QAAQniN,GAAG4hN,QAAQzwJ,GAAGywJ,QAAQruL,KAAKyiM,KAC3C0H,EAAKsvN,EAAGh5N,OAAO1sS,GAAG66R,QAAQltI,GAAG2sI,QAAQn6F,GAAG+iU,UACxCl/I,EAAK0hJ,EAAG7qO,QAAQxqE,GAAGwqE,QAAQ76R,GAAG66R,QAAQnnH,GAAG4mH,QAAQn6F,UAEhDl0F,KAAKsga,OAAOp2N,EAAIq2N,EAAIp2N,EAAI4tE,GAAIj5E,KAAK,MAGtC9+L,KAAK6+Z,aAAa7vO,EAAMlB,OAAO,GAAA,IAiB7BkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,WAEVA,EAAMphL,EAAEihL,SAAAA,OACH7uL,KAAKgvL,MAAMhvL,KAAKmqJ,KAAMnqJ,KAAKyiM,IAAIjU,gBAGlC0b,EADIlqM,KAAK2+Z,OAAO3vO,EAAMlB,OAAO,GACtB8S,OAAO1sG,GACdqsU,EAAKz7V,EACLqlI,EAAKj2G,EAAEssG,OAAOxgM,KAAKyiM,KACnBs1E,EAAK7jL,EAAEusG,OAAOzgM,KAAKyiM,YAElBziM,KAAKsga,OAAOp2N,EAAIq2N,EAAIp2N,EAAI4tE,MAG7B/3Q,KAAK6+Z,aAAa7vO,EAAMlB,OAAO,GAAA,IAiB7BkB,EAAMW,aAAAA,OACD3vL,KAAKgvL,WAEVA,EAAMphL,EAAEihL,SAAAA,OACH7uL,KAAKgvL,MAAMhvL,KAAKmqJ,KAAMnqJ,KAAKyiM,IAAIjU,gBAGlC0b,EADIlqM,KAAK2+Z,OAAO3vO,EAAMlB,OAAO,GACtB8S,OAAO1sG,GACdqsU,EAAKz7V,EACLqlI,EAAKj2G,EAAEusG,OAAOzgM,KAAKyiM,KACnBs1E,EAAK7jL,EAAEssG,OAAOxgM,KAAKyiM,YAElBziM,KAAKsga,OAAOp2N,EAAIq2N,EAAIp2N,EAAI4tE,aAGvBj/Q,MAAM,oBAGlB80Z,iBAAiB5+N,GAGfn2L,EAAOm2L,aAAiB24O,GACxB9ua,EAAOm2L,EAAMlB,MAAM5mN,EAAEqsC,GAAGvT,KAAK94B,UAGvBL,EAAIm5B,KAAKoga,MAAMpxO,EAAMlB,MAAMjnN,GAC3B+mC,EAAI5N,KAAKoga,MAAMpxO,EAAMphL,GACrBC,EAAI7N,KAAKoga,MAAMpxO,EAAMnhL,GACrB03G,EAAIvlH,KAAKoga,MAAMpxO,EAAMzpE,GACrBxmE,EAAI/+C,KAAKoga,MAAMpxO,EAAMjwI,MAEvB/+C,KAAK8+Z,YAAY9vO,EAAMlB,OAAAA,OAQnB69O,EAAK/9Z,EAAEgzL,OAAO/yL,GACd0xL,EAAK3xL,EAAEugL,SACPsZ,EAAK55L,EAAEsgL,SACPib,EAAK7jF,EAAE4oE,SACP27O,EAAMjjc,EAAE+5N,OAAOrB,GACf2K,EAAKyhO,EAAG5V,SAAS,GACjBwK,EAAK94N,EAAGhH,OAAOqpO,GACf3/N,EAAK1C,EAAGjH,OAAOspO,GACf/xJ,EAAK3uE,EAAG2sN,SAAS,GAAGnnO,QAAQub,GAC5BjjO,EAAI84B,KAAKsga,OAAOp2N,EAAIq2N,EAAIp2N,EAAI4tE,UAE1B/3Q,KAAK8rM,QAAsB5kO,EAAZA,EAAE43N,KAAK,MAG5B9+L,KAAK6+Z,aAAa7vO,EAAMlB,OAAAA,OAOpBrhN,EAAIuzB,KAAK2+Z,OAAO3vO,EAAMlB,OACtB2a,EAAKh8N,EAAEm0N,OAAOhzL,GACd86L,EAAK76L,EACLw7L,EAAK9jF,EACL+mF,EAAK7/N,EAAEm0N,OAAO7hJ,UAEb/+C,KAAKgvL,MAAMyZ,EAAIC,EAAIW,EAAIiD,aAGtBxzM,MAAM,oBAGlBm1Z,iBAAiB/5T,EAAG45F,EAAQ,MAC1Bj1L,EAAOq7F,aAAa65F,GACpBl1L,EAAOq7F,EAAEg6F,MAAQluL,KAAKkuL,KACtBr1L,EAAgB,MAATi1L,GAAkBA,aAAiBwd,GAErCxd,IACHA,EAAQ9tL,KAAKura,cAETzxP,EAAKgU,EAAMsyO,MAAMlsU,GACjB6sU,EAAKjzO,EAAMmgO,iBAAiBn0O,UAE3B95K,KAAK8tZ,cAAciT,GAG5B3S,eAAelnb,EAAGy2N,EAAM7P,EAAQ,MAW9Bj1L,EAAO3xB,aAAaygc,GACpB9ua,EAAQ8kM,IAAS,IAAOA,GACxB9kM,EAAgB,MAATi1L,GAAkBA,aAAiBwd,GAErCxd,IACHA,EAAQ9tL,KAAKura,cAGTpkc,GAAMw2N,GAAQ,EAAK,IAAM39L,KAAK0+Z,QAAQz5b,OACtCqpC,EAAIpnC,EAAE8X,IAAIghB,KAAK0+Z,QAAQv3b,IAGvB45b,EAAKjzO,EAAM8/N,iBAAiBt/Y,GAC5BwrK,EAAKgU,EAAMsgO,eAAe2S,EAAW,GAAPpjO,UAE7B39L,KAAKoga,MAAMtmP,GAGpB00O,cAAc71R,EAAO41R,EAAMzgO,EAAQ,MACjCj1L,EAAgB,MAATi1L,GAAkBA,aAAiBwd,GAErCxd,IACHA,EAAQ9tL,KAAKura,cAETxK,EAAKjzO,EAAM0gO,cAAc71R,EAAO41R,UAE/BvuZ,KAAK8tZ,cAAciT,GAG5BpS,YAAYznb,EAAGwnb,EAAUn7O,EAAKua,EAAQ,MACpCj1L,EAAO3xB,aAAaygc,GACpB9ua,EAAQ61Z,IAAa,IAAOA,GAC5B71Z,EAAgB,MAATi1L,GAAkBA,aAAiBwd,GAErCxd,IACHA,EAAQ9tL,KAAKura,cAGTpkc,EAAIunb,EAAW1uZ,KAAK0+Z,QAAQz5b,OAC5BqpC,EAAIpnC,EAAE8X,IAAIghB,KAAK0+Z,QAAQv3b,IAGvB45b,EAAKjzO,EAAM8/N,iBAAiBt/Y,UAE3Bw/K,EAAM6gO,YAAYoS,EAAI,EAAGxtP,GAGlCkyB,YAAY9sE,UACHgvS,EAAavja,OAAOpE,KAAM24H,GAGnCypS,QAAQxrO,EAAI0F,EAAKh0C,EAAO,YACfzhL,EAAGyS,GAAK0mB,KAAK8ka,OAAOluO,EAAI0F,GAEzBxO,EAAAA,IAAYoY,EAAAA,CAChBhY,IAAKluL,KAAKkuL,IACV9/J,MAAOpuB,KAAKouB,MACZlnD,EAAG84B,KAAK94B,EACRL,EAAGA,EACHyS,EAAGA,EACHrlF,EAAG+rG,KAAK/rG,EACRwzK,EAAGznE,KAAKynE,OAGE,MAAR6gF,EAAQ,QACDkxQ,GAAM1rO,EAAM6wO,OAAO3+Z,MAExBw5Z,EAAGhC,aAAelvQ,GACpBkxQ,EAAGvC,UAGFj3Z,KAAKokH,EAAEurE,eACV7B,EAAM1pE,EAAI0pE,EAAM8/N,iBAAiB5tZ,KAAKokH,YAE/Bj9I,EAAI,EAAGA,EAAI64B,KAAKynE,EAAEjlD,KAAK,GAAIr7C,IAClC2mN,EAAM4wO,QAAQv3b,GAAK2mN,EAAM8/N,iBAAiB5tZ,KAAK0+Z,QAAQv3b,WAElD2mN,EAGTu0O,OAAOx5O,EAAI6wG,EAAQpxI,EAAO,YACjBzhL,EAAGyS,GAAK0mB,KAAKgla,MAAMn8O,EAAI6wG,GAExB5rG,EAAAA,IAAYwd,EAAAA,CAChBpd,IAAKluL,KAAKkuL,IACV9/J,MAAOpuB,KAAKouB,MACZlnD,EAAG84B,KAAK94B,EACRL,EAAGA,EACHyS,EAAGA,EACHrlF,EAAG+rG,KAAK/rG,EACRwzK,EAAGznE,KAAKynE,EACR89C,EAAGvlH,KAAKulH,OAGE,MAAR+iC,EAAQ,OACJ77K,EAAIuzB,KAAK2+Z,OAAO7wO,EAAO4rG,GAEzBjtT,EAAE+qb,aAAelvQ,GACnB77K,EAAEwqb,UAGDj3Z,KAAKokH,EAAEurE,eACV7B,EAAM1pE,EAAI0pE,EAAM8/N,iBAAiB5tZ,KAAKokH,YAE/Bj9I,EAAI,EAAGA,EAAI64B,KAAKynE,EAAEjlD,KAAK,GAAIr7C,IAClC2mN,EAAM4wO,QAAQv3b,GAAK2mN,EAAM8/N,iBAAiB5tZ,KAAK0+Z,QAAQv3b,WAElD2mN,EAGTw0O,UAAU1rO,EAAItuC,EAAO,YACZzhL,EAAG+2D,GAAK59B,KAAKgtZ,SAASp2N,GAEvB9I,EAAAA,IAAY+d,EAAAA,CAChB3d,IAAKluL,KAAKkuL,IACV9/J,MAAOpuB,KAAKouB,MACZlnD,EAAG84B,KAAK94B,EACRL,EAAGA,EACH+2D,EAAGA,EACH3pI,EAAG+rG,KAAK/rG,EACRwzK,EAAGznE,KAAKynE,EACR89C,EAAGvlH,KAAKulH,OAGE,MAAR+iC,EAAQ,OACJ77K,EAAIqhN,EAAM6wO,OAAO3+Z,MAEnBvzB,EAAE+qb,aAAelvQ,GACnB77K,EAAEwqb,aAGDj3Z,KAAKokH,EAAEurE,eACV7B,EAAM1pE,EAAI0pE,EAAM8/N,iBAAiB5tZ,KAAKokH,GACtC0pE,EAAM1pE,EAAEv+G,aAGNioL,EAAMqyO,qBACCh5b,EAAI,EAAGA,EAAI64B,KAAKynE,EAAEjlD,KAAK,GAAIr7C,IAClC2mN,EAAM4wO,QAAQv3b,GAAK2mN,EAAM8/N,iBAAiB5tZ,KAAK0+Z,QAAQv3b,IACvD2mN,EAAM4wO,QAAQv3b,GAAG0+B,mBAIdioL,EAGTwV,cAAc3zE,UACLg4S,EAAat/N,SAASroM,KAAM2vH,GAGrCvoI,OAAOkhN,SACC34E,EAAOpqG,MAAMn+B,OAAOkhN,UAE1B34E,EAAK9oJ,EAAIm5B,KAAKn5B,EAAEw5N,UAAUj5M,SAC1BuoI,EAAK/xF,EAAI59B,KAAK49B,EAAEyiK,UAAUj5M,SAErB4Y,KAAK9jB,EAAE2yM,WACVl/D,EAAKzzI,EAAI8jB,KAAK9jB,EAAEmkN,UAAUj5M,UAErBuoI,GAQX,MAAAg4S,UAA2BjhO,EACzB/5L,YAAYmhL,EAAOlgL,EAAGC,EAAG03G,EAAGxmE,GAC1BlmD,EAAOi1L,aAAiB+d,GAExBtmL,MAAMuoK,EAAOr8K,GAEbzR,KAAK4N,EAAI5N,KAAK8tL,MAAM3jC,KACpBnqJ,KAAK6N,EAAI7N,KAAK8tL,MAAM2U,IACpBziM,KAAKulH,EAAIvlH,KAAK8tL,MAAM2U,IACpBziM,KAAK++C,EAAI/+C,KAAK8tL,MAAM3jC,KACpBnqJ,KAAK8mM,MAAO,EAEH,MAALl5L,GACF5N,KAAK+hK,MAAMn0J,EAAGC,EAAG03G,EAAGxmE,GAGxBgjH,MAAMn0J,EAAGC,EAAG03G,EAAGxmE,GACblmD,EAAO+U,aAAamgL,GACpBl1L,EAAOgV,aAAakgL,GACpBl1L,EAAY,MAAL0sH,GAAcA,aAAawoE,GAClCl1L,EAAY,MAALkmD,GAAcA,aAAagvI,GAElC/tL,KAAK4N,EAAIA,EACT5N,KAAK6N,EAAIA,EACT7N,KAAKulH,EAAIA,GAAKvlH,KAAK8tL,MAAM2U,IACzBziM,KAAK++C,EAAIA,GAAK,KAET/+C,KAAK4N,EAAEsgL,MACVluL,KAAK4N,EAAI5N,KAAK4N,EAAEqgL,MAAMjuL,KAAK8tL,MAAMI,MAE9BluL,KAAK6N,EAAEqgL,MACVluL,KAAK6N,EAAI7N,KAAK6N,EAAEogL,MAAMjuL,KAAK8tL,MAAMI,MAE9BluL,KAAKulH,EAAE2oE,MACVluL,KAAKulH,EAAIvlH,KAAKulH,EAAE0oE,MAAMjuL,KAAK8tL,MAAMI,MAE/BluL,KAAK++C,IAAM/+C,KAAK++C,EAAEmvI,MACpBluL,KAAK++C,EAAI/+C,KAAK++C,EAAEkvI,MAAMjuL,KAAK8tL,MAAMI,MAEnCluL,KAAK8mM,KAAO9mM,KAAKulH,EAAEhyG,GAAGvT,KAAK8tL,MAAM2U,KAEjCziM,KAAK+3Z,SAEA/3Z,KAAK++C,IACR/+C,KAAK++C,EAAI/+C,KAAK4N,EAAEgzL,OAAO5gM,KAAK6N,GACvB7N,KAAK8mM,OACR9mM,KAAK++C,EAAI/+C,KAAK++C,EAAEm3W,OAAOl2Z,KAAKulH,KAIlCwyS,YAkBM/3Z,KAAKulH,EAAEspE,SAAAA,MAAAA,IACC/1L,MAAM,kBAGpBu8B,eACSr1B,KAAK8tL,MAAMkB,MAAMhvL,KAAK4N,EAAG5N,KAAK6N,EAAG7N,KAAKulH,EAAGvlH,KAAK++C,GAGvDl5C,eAKM7F,KAAK8mM,KAAAA,OACA9mM,WAGHn5B,EAAIm5B,KAAKulH,EAAEsyS,mBAGjB73Z,KAAK4N,EAAI5N,KAAK4N,EAAEgzL,OAAO/5N,GAGvBm5B,KAAK6N,EAAI7N,KAAK6N,EAAE+yL,OAAO/5N,GAGvBm5B,KAAK++C,EAAI/+C,KAAK++C,EAAE6hJ,OAAO/5N,GAGvBm5B,KAAKulH,EAAIvlH,KAAK8tL,MAAM2U,IACpBziM,KAAK8mM,MAAO,EAEL9mM,KAGTuha,MAAM16b,GACJgyB,EAAOhyB,aAAaknN,SAGd0a,EAAKzoM,KAAK4N,EAAEgzL,OAAO/5N,GAGnB6hO,EAAK1oM,KAAK6N,EAAE+yL,OAAO/5N,GAGnBwiO,EAAKrpM,KAAKulH,EAAEq7E,OAAO/5N,GAGnBylO,EAAKtsM,KAAK++C,EAAE6hJ,OAAO/5N,UAElBm5B,KAAK8tL,MAAMkB,MAAMyZ,EAAIC,EAAIW,EAAIiD,GAGtC1W,YAEQ6S,EAAKzoM,KAAK4N,EAAE4gL,SACZka,EAAK1oM,KAAK6N,EACVw7L,EAAKrpM,KAAKulH,EACV+mF,EAAKtsM,KAAK++C,EAAEyvI,gBAEXxuL,KAAK8tL,MAAMkB,MAAMyZ,EAAIC,EAAIW,EAAIiD,GAGtCttN,IAAI9X,UACF2xB,EAAO3xB,aAAaygc,GAGhB3na,KAAK2vL,aACAzoN,EAGLA,EAAEyoN,aACG3vL,KAGLA,KAAK8mM,KACA5/N,EAAE+gc,KAAKjoa,MAETA,KAAKioa,KAAK/gc,GAGnB+gc,KAAK/gc,UAEC84B,KAAK8tL,MAAMie,MACN/rM,KAAK6ra,OAAO3kc,GAEd84B,KAAK8ra,MAAM5kc,GAGpB2kc,OAAO3kc,SAUCL,EAAIm5B,KAAK6N,EAAE4yL,OAAOzgM,KAAK4N,GAAGgzL,OAAO15N,EAAE2mC,EAAE4yL,OAAOv5N,EAAE0mC,IAG9Ct0B,EAAI0mB,KAAK6N,EAAE2yL,OAAOxgM,KAAK4N,GAAGgzL,OAAO15N,EAAE2mC,EAAE2yL,OAAOt5N,EAAE0mC,IAG9CnhC,EAAIuzB,KAAK++C,EAAE6hJ,OAAO5gM,KAAK8tL,MAAMz5R,GAAGusS,OAAO15N,EAAE63E,GAGzCnhB,EAAI12D,EAAE4/N,KAAO9mM,KAAKulH,EAAEi7E,OAAOxgM,KAAKulH,GAAKvlH,KAAKulH,EAAEq7E,OAAO15N,EAAEq+I,GAAGwwS,SAAS,GAGjEhigB,EAAIulF,EAAEmnN,OAAO55N,GAGb66E,EAAI9jB,EAAE6iK,OAAOh0N,GAGb23I,EAAIxmF,EAAEywJ,QAAQ5hN,GAGdg7F,EAAInuF,EAAE+0M,QAAQxnN,GAGd4hO,EAAK10S,EAAE6sS,OAAOl/I,GAGdgnJ,EAAKtkF,EAAEw8E,OAAOn5H,GAGd6kI,EAAKv4S,EAAE6sS,OAAOn5H,GAGd4hI,EAAK3nJ,EAAEk/I,OAAOx8E,UAEbpkH,KAAK8tL,MAAMkB,MAAMyZ,EAAIC,EAAIW,EAAIiD,GAGtCw/N,MAAM5kc,SAQEL,EAAIm5B,KAAK4N,EAAEgzL,OAAO15N,EAAE0mC,GAGpBt0B,EAAI0mB,KAAK6N,EAAE+yL,OAAO15N,EAAE2mC,GAGpBphC,EAAIuzB,KAAK8tL,MAAM28O,MAAMzqa,KAAK++C,GAAG6hJ,OAAO15N,EAAE63E,GAGtCnhB,EAAI12D,EAAE4/N,KAAO9mM,KAAKulH,EAAElwF,QAAUr1B,KAAKulH,EAAEq7E,OAAO15N,EAAEq+I,GAM9CxxN,EAHOisG,KAAK4N,EAAE4yL,OAAOxgM,KAAK6N,GAAG+yL,OAAO15N,EAAE0mC,EAAE4yL,OAAOt5N,EAAE2mC,IAGxC+gL,QAAQ/nN,GAAG+nN,QAAQt1M,GAG5BooE,EAAI9jB,EAAE6iK,OAAOh0N,GAGb23I,EAAIxmF,EAAEywJ,QAAQ5hN,GAGdg7F,EAAInuF,EAAEs1M,QAAQ5uL,KAAK8tL,MAAMoe,MAAMrlO,IAG/B4hO,EAAK10S,EAAE6sS,OAAOl/I,GAGdgnJ,EAAKtkF,EAAEw8E,OAAOn5H,GAGd6kI,EAAKv4S,EAAE6sS,OAAOn5H,GAGd4hI,EAAK3nJ,EAAEk/I,OAAOx8E,UAEbpkH,KAAK8tL,MAAMkB,MAAMyZ,EAAIC,EAAIW,EAAIiD,GAGtCrG,aAEMjmM,KAAK2vL,aACA3vL,KAEFA,KAAKiqM,OAGdA,aAQQpjO,EAAIm5B,KAAK4N,EAAEugL,SAGX70M,EAAI0mB,KAAK6N,EAAEsgL,SAGX1hN,EAAIuzB,KAAK8mM,KAAO9mM,KAAK8tL,MAAMuV,IAAMrjM,KAAKulH,EAAE4oE,SAAS4nO,SAAS,GAG1Dn4X,EAAI59B,KAAK8tL,MAAMoe,MAAMrlO,GAGrB9yE,EAAIisG,KAAK4N,EAAE4yL,OAAOxgM,KAAK6N,GAAGsgL,SAASS,QAAQ/nN,GAAG+nN,QAAQt1M,GAGtD8qI,EAAIxmF,EAAE4iK,OAAOlnN,GAGbooE,EAAI0iE,EAAEq8E,OAAOh0N,GAGbg7F,EAAI7pC,EAAEgxJ,QAAQt1M,GAGdmvN,EAAK10S,EAAE6sS,OAAOl/I,GAGdgnJ,EAAKtkF,EAAEw8E,OAAOn5H,GAGd6kI,EAAKv4S,EAAE6sS,OAAOn5H,GAGd4hI,EAAK3nJ,EAAEk/I,OAAOx8E,UAEbpkH,KAAK8tL,MAAMkB,MAAMyZ,EAAIC,EAAIW,EAAIiD,GAGtCzb,cACE7wL,KAAK6F,YACE7F,KAAK4N,EAAEyyL,UAGhBvP,cACE9wL,KAAK6F,YACE7F,KAAK6N,EAAEwyL,UAGhB9sL,GAAGrsC,MACD2xB,EAAO3xB,aAAaygc,GACpB9ua,GAAQmH,KAAKulH,EAAEspE,UACfh2L,GAAQ3xB,EAAEq+I,EAAEspE,UAGR7uL,OAAS94B,EAAAA,OACJ,KAGL84B,KAAKulH,EAAEhyG,GAAGrsC,EAAEq+I,UACPvlH,KAAK4N,EAAE2F,GAAGrsC,EAAE0mC,IACZ5N,KAAK6N,EAAE0F,GAAGrsC,EAAE2mC,SAIfyxL,EAAKt/L,KAAK4N,EAAEgzL,OAAO15N,EAAEq+I,GACrBg6E,EAAKr4N,EAAE0mC,EAAEgzL,OAAO5gM,KAAKulH,OAEtB+5E,EAAG/rL,GAAGgsL,GAAAA,OACF,QAEHiI,EAAKxnM,KAAK6N,EAAE+yL,OAAO15N,EAAEq+I,GACrBkiF,EAAKvgO,EAAE2mC,EAAE+yL,OAAO5gM,KAAKulH,UAEpBiiF,EAAGj0L,GAAGk0L,GAGftgM,IAAI6nL,UACFn2L,EAAOm2L,aAAiB24O,GAEjB3na,KAAK2ja,QAAQx8Z,IAAI6nL,EAAM20O,UACvB3ja,KAAK8wL,OAAO3pL,IAAI6nL,EAAM8B,SACtB9wL,KAAK6wL,OAAO1pL,IAAI6nL,EAAM6B,QAG/BlB,oBACE92L,GAAQmH,KAAKulH,EAAEspE,YAGV7uL,KAAK4N,EAAEihL,UAIL7uL,KAAK6N,EAAE0F,GAAGvT,KAAKulH,GAGxB+9S,kBACMtja,KAAK2vL,cAGF3vL,KAAK4N,EAAEihL,SAGhBN,eACEvuL,KAAK6F,YACE7F,KAAK4N,EAAE4pZ,WAGhBr8O,gBACEn7K,KAAK6F,YACE7F,KAAK4N,EAAE6pZ,YAGhB9yN,aACS3kM,KAAK6F,YAGdy/L,aACStlM,KAGTsD,eAEQuK,EAAI7N,KAAK8wL,cAGfjjL,EAAE2oL,KAAKx2L,KAAK8tL,MAAMqwO,QAASn+Z,KAAK4N,EAAE4pZ,YAE3Bx3Z,KAAK8tL,MAAM8zO,eAAe/zZ,iBAGrBigL,EAAOn1D,GAEnB9/H,EAAOi1L,aAAiB+d,SAElBh+L,EAAIigL,EAAM+zO,eAAelpS,GACzB2vB,EAAkC,IAA3Bz6I,EAAE2nL,MAAM1H,EAAMqwO,YAE3BtwZ,EAAE2oL,KAAK1I,EAAMqwO,QAAS,GAElBtwZ,EAAE1G,IAAI2mL,EAAM5mN,IAAM,EAAA,MAAA,IACV4xB,MAAM,yBAEXg1L,EAAMse,WAAWv+L,EAAGy6I,GAG7BlhK,OAAOkhN,MACDtoM,KAAK2vL,aAAAA,MAAAA,SAGH/hL,EAAI5N,KAAK6wL,OAAOzpM,SAChBymB,EAAI7N,KAAK8wL,OAAO1pM,gBAEV,IAARkhN,GAAgBtoM,KAAKsoM,IAAAA,CACf16L,EAAGC,EAAG7N,KAAKsoM,IAAIlhN,WAEjBwmB,EAAGC,GAGbi6Z,iBACQ7qa,EAA8B,EAAvB+C,KAAK8tL,MAAMo/N,iBACd4a,EAAS9na,KAAK6wL,OAAQ5zL,GACtB6qa,EAAS9na,KAAK8wL,OAAQ7zL,oBAKlB6wL,EAAOn+D,MACrB92H,EAAOi1L,aAAiB+d,GACxBhzM,EAAOgF,MAAM/gB,QAAQ6yI,IACrB92H,EAAuB,IAAhB82H,EAAK1qJ,QACW,IAAhB0qJ,EAAK1qJ,QACW,IAAhB0qJ,EAAK1qJ,QAEQ,IAAhB0qJ,EAAK1qJ,OAAW,OACX6oN,EAAMkB,cAETphL,EAAImgL,EAAGsa,SAAS14E,EAAK,IACrB9hH,EAAIkgL,EAAGsa,SAAS14E,EAAK,IACrBq/D,EAAQlB,EAAMkB,MAAMphL,EAAGC,UAEzB8hH,EAAK1qJ,OAAS,GAAgB,MAAX0qJ,EAAK,KAC1Bq/D,EAAMsZ,IAAM86N,EAAQ/6N,SAASrZ,EAAOr/D,EAAK,KAEpCq/D,GAGRl4E,YACK92G,KAAK2vL,aACA,2BAEF,oBACO3vL,KAAK4N,EAAEyyL,UAAUjiM,SAAS,GAAI,GACtC,MAAQ4B,KAAK6N,EAAEwyL,UAAUjiM,SAAS,GAAI,GACtC,MAAQ4B,KAAKulH,EAAE86E,UAAUjiM,SAAS,GAAI,GACtC,KAQV,MAAAgla,EACEz2Z,cACE3M,KAAKuxL,IAAM,KACXvxL,KAAKk/Z,QAAU,KACfl/Z,KAAKmkM,QAAU,KACfnkM,KAAK+ia,SAAW,KAChB/ia,KAAKqrB,KAAO,KAGdjhD,IAAI+tL,GACFt/J,EAAuB,mBAATs/J,SAERp3H,EAAAA,IAAU/gC,KAAK2M,mBAEjB3M,KAAKuxL,MACPxwJ,EAAIwwJ,IAAMvxL,KAAKuxL,IAAInnN,IAAI+tL,IAErBn4J,KAAKmkM,UACPpjK,EAAIojK,QAAUnkM,KAAKmkM,QAAQ/5N,IAAI+tL,IAE1Bp3H,EAGT35C,gBAEImqM,IAAKvxL,KAAKuxL,IAAMvxL,KAAKuxL,IAAInqM,SAAW,KACpC83a,QAASl/Z,KAAKk/Z,QAAUl/Z,KAAKk/Z,QAAQ93a,SAAW,KAChD+8M,QAASnkM,KAAKmkM,QAAUnkM,KAAKmkM,QAAQ/8M,SAAW,KAChD27a,SAAU/ia,KAAK+ia,SAAW/ia,KAAK+ia,SAAS37a,cAAW1xF,GAIvD2yS,SAASrZ,EAAOr/D,UACd92H,EAAOm2L,aAAiB0X,GACxB7tM,EAAO82H,GAAwB,iBAATA,GAEN,MAAZA,EAAK4hE,MACPvxL,KAAKuxL,IAAMixO,EAAIn6N,SAASrZ,EAAOr/D,EAAK4hE,MAElB,MAAhB5hE,EAAKuvS,UACPl/Z,KAAKk/Z,QAAUyD,EAAQt6N,SAASrZ,EAAOr/D,EAAKuvS,UAE1B,MAAhBvvS,EAAKw0E,UACPnkM,KAAKmkM,QAAU0+N,EAAQx6N,SAASrZ,EAAOr/D,EAAKw0E,UAEzB,MAAjBx0E,EAAKozS,WACP/ia,KAAK+ia,SAAWE,EAAS56N,SAASrZ,EAAOr/D,EAAKozS,WAEzC/ia,qBAGOgvL,EAAOr/D,cACV3vH,MAAOqoM,SAASrZ,EAAOr/D,IAQtC,MAAA6yS,EACE71Z,YAAYuhD,EAAOw2I,GACjB1kM,KAAKkuD,MAAQA,EACbluD,KAAK0kM,OAASA,EAGhBt6N,IAAI+tL,GACFt/J,EAAuB,mBAATs/J,eAEPjqG,GAASluD,KACV0kM,EAAAA,aAEK1V,KAAShvL,KAAK0kM,OACvBA,EAAO55N,KAAKqtL,EAAK62B,eAERhvL,KAAK2M,YAAYuhD,EAAOw2I,GAGrCt9M,gBAEI8mE,MAAOluD,KAAKkuD,MACZw2I,OAAQ1kM,KAAK0kM,OAAOt/N,MAAM,GAAGgF,KAAK4kN,GACzBA,EAAM5nM,4BAKH4nM,EAAOr/D,GACrB92H,EAAOm2L,aAAiB0X,GACxB7tM,EAAO82H,GAAwB,iBAATA,GACtB92H,EAAQ82H,EAAKzhE,QAAU,IAAOyhE,EAAKzhE,OACnCr1D,EAAOgF,MAAM/gB,QAAQ6yI,EAAK+0E,qBAEnB5W,GAASkB,SACT9gI,GAASyhE,EACV+0E,EAAAA,CAAU1V,aAEL/zL,KAAQ00H,EAAK+0E,OACtBA,EAAO55N,KAAKgjN,EAAMwV,cAAcroM,eAEvB+E,KAAKkuD,EAAOw2I,IAQ3B,MAAAi+N,EACEh2Z,YAAYuhD,EAAOksE,EAAMsqE,GACvB1kM,KAAKkuD,MAAQA,EACbluD,KAAKo6H,KAAOA,EACZp6H,KAAK0kM,OAASA,EAGhBt9M,gBAEI8mE,MAAOluD,KAAKkuD,MACZksE,KAAMp6H,KAAKo6H,KACXsqE,OAAQ1kM,KAAK0kM,OAAOt/N,MAAM,GAAGgF,KAAK4kN,GACzBA,EAAM5nM,4BAKH4nM,EAAOr/D,GACrB92H,EAAOm2L,aAAiB0X,GACxB7tM,EAAO82H,GAAwB,iBAATA,GACtB92H,EAAQ82H,EAAKzhE,QAAU,IAAOyhE,EAAKzhE,OACnCr1D,EAAQ82H,EAAKyK,OAAS,IAAOzK,EAAKyK,MAClCvhI,EAAOgF,MAAM/gB,QAAQ6yI,EAAK+0E,qBAEnB5W,GAASkB,SACT9gI,EAAAA,KAAOksE,GAAQzK,EAChB+0E,EAAAA,CAAU1V,aAEL/zL,KAAQ00H,EAAK+0E,OACtBA,EAAO55N,KAAKgjN,EAAMwV,cAAcroM,eAEvB+E,KAAKkuD,EAAOksE,EAAMsqE,IAQjC,MAAAm+N,EACEl2Z,YAAY03L,EAAMK,GAChB1kM,KAAKqkM,KAAOA,EACZrkM,KAAK0kM,OAASA,EAGhBt6N,IAAI+tL,GACFt/J,EAAuB,mBAATs/J,cAEPksC,GAAQrkM,KACT0kM,EAAAA,aAEK1V,KAAShvL,KAAK0kM,OACvBA,EAAO55N,KAAKqtL,EAAK62B,eAERhvL,KAAK2M,YAAY03L,EAAMK,GAGpCt9M,gBAEIi9M,KAAMrkM,KAAKqkM,KACXK,OAAQ1kM,KAAK0kM,OAAOt/N,MAAM,GAAGgF,KAAK4kN,GACzBA,EAAM5nM,4BAKH4nM,EAAOr/D,GACrB92H,EAAOm2L,aAAiB0X,GACxB7tM,EAAO82H,GAAwB,iBAATA,GACtB92H,EAAQ82H,EAAK00E,OAAS,IAAO10E,EAAK00E,MAClCxrM,EAAOgF,MAAM/gB,QAAQ6yI,EAAK+0E,qBAEnB5W,GAASkB,QACTqV,GAAQ10E,EACT+0E,EAAAA,CAAU1V,aAEL/zL,KAAQ00H,EAAK+0E,OACtBA,EAAO55N,KAAKgjN,EAAMwV,cAAcroM,eAEvB+E,KAAKqkM,EAAMK,IAQ1B,MAAAu+N,EACEt2Z,YAAY4+O,EAAOy3K,GACjBhja,KAAKurP,MAAQA,EACbvrP,KAAKgja,QAAUA,EAGjB57a,gBAEImkQ,MAAOvrP,KAAKurP,MAAMnkQ,SAClB47a,QAAShja,KAAKgja,QAAQ57a,0BAIV4nM,EAAOr/D,GACrB92H,EAAOm2L,aAAiB0X,GACxB7tM,EAAO82H,GAAwB,iBAATA,eAEfm+D,GAASkB,aAILhvL,KAHG+tL,EAAGsa,SAAS14E,EAAK47H,OACfz9D,EAAMwV,cAAc3zE,EAAKqzS,WAU7C,MAAAsB,EACE33Z,YAAY0e,EAAMS,EAAQo7K,EAAOoB,GAC/BtoM,KAAKqrB,KAAOA,EACZrrB,KAAK8rB,OAASA,EACd9rB,KAAKknM,MAAQA,EACblnM,KAAKsoM,IAAMA,EAGblhN,gBAEIikC,KAAMrrB,KAAKqrB,KAAKg1K,UAAUj5M,SAC1B0kC,OAAQ9rB,KAAK8rB,OAAO1kC,SACpB8/M,MAAAA,CACElnM,KAAKknM,MAAM,GAAG9/M,SACd4Y,KAAKknM,MAAM,GAAG9/M,UAEhBkhN,IAAAA,CACEtoM,KAAKsoM,IAAI,GACTtoM,KAAKsoM,IAAI,GAAGlhN,SACZ4Y,KAAKsoM,IAAI,GAAGlhN,2BAKF0mM,EAAOn+D,GACrB92H,EAAOi1L,aAAiBkwO,GACxBnla,EAAO82H,GAAwB,iBAATA,GACtB92H,EAAOgF,MAAM/gB,QAAQ6yI,EAAKu3E,QAC1BruM,EAAOgF,MAAM/gB,QAAQ6yI,EAAK24E,MAC1BzvM,EAA6B,IAAtB82H,EAAKu3E,MAAMjiO,QAClB4zB,EAA2B,IAApB82H,EAAK24E,IAAIrjO,QAChB4zB,EAAQ82H,EAAK24E,IAAI,KAAO,IAAO34E,EAAK24E,IAAI,eAgB7BtoM,KAdE+tL,EAAGsa,SAAS14E,EAAKtkG,MAAM4iK,MAAMH,EAAMI,KACjCH,EAAGsa,SAAS14E,EAAK7jG,QAE1Bo7K,CACJi/N,EAAO99N,SAAS14E,EAAKu3E,MAAM,IAC3Bi/N,EAAO99N,SAAS14E,EAAKu3E,MAAM,KAGvBoB,CACJ34E,EAAK24E,IAAI,GACTva,EAAGsa,SAAS14E,EAAK24E,IAAI,IACrBva,EAAGsa,SAAS14E,EAAK24E,IAAI,OAW3B,MAAA69N,EACEx5Z,YAAY9lC,EAAGyS,GACb0mB,KAAKn5B,EAAIA,EACTm5B,KAAK1mB,EAAIA,EAGX8N,gBAEIvgB,EAAGm5B,KAAKn5B,EAAEugB,SACV9N,EAAG0mB,KAAK1mB,EAAE8N,0BAIEuoI,GACd92H,EAAO82H,GAAwB,iBAATA,cAKX3vH,KAHD+tL,EAAGsa,SAAS14E,EAAK9oJ,GACjBknN,EAAGsa,SAAS14E,EAAKr2I,WAo6BzB23M,EAAAA,CACJ9tE,UAAW,KACXy+E,KA15BF,cAAmBsE,EACjBv5L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,OACJg6a,KAAM,aACNn3b,KAAM,QACN+rN,OAAQ,KACRx/K,KAAM,SACN+a,MAAO,OAEPlnD,EAAAA,CAAI,sCACA,qBAEJL,EAAAA,CAAI,sCACA,qBACJyS,EAAAA,CAAI,sCACA,qBACJrlF,EAAAA,CAAI,sCACA,qBACJwzK,EAAG,IAEH89C,EAAG,KACHnB,EAAAA,CAAAA,CACG,sCACA,qBAAA,CACA,sCACA,qBACDkkF,OAg4BN3G,KAp3BF,cAAmBuE,EACjBv5L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,OACJg6a,KAAM,YACNn3b,KAAM,QACN+rN,OAAQ,KACRx/K,KAAM,SACN+a,MAAO,OAEPlnD,EAAAA,CAAI,sCACA,8BAEJL,EAAAA,CAAI,sCACA,8BACJyS,EAAAA,CAAI,sCACA,8BACJrlF,EAAAA,CAAI,sCACA,8BACJwzK,EAAG,IAEH89C,EAAG,KACHnB,EAAAA,CAAAA,CACG,sCACA,8BAAA,CACA,sCACA,8BACDkkF,OA01BNyjO,KA90BF,cAAmB7lO,EACjBv5L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,OACJg6a,KAAM,aACNn3b,KAAM,QACN+rN,OAAQ,KACRx/K,KAAM,SACN+a,MAAO,KAEPlnD,EAAAA,CAAI,sCACA,uCAEJL,EAAAA,CAAI,sCACA,uCACJyS,EAAAA,CAAI,sCACA,uCACJrlF,EAAAA,CAAI,sCACA,uCACJwzK,EAAG,IAEH89C,EAAG,KACHnB,EAAAA,CAAAA,CACG,sCACA,uCAAA,CACA,sCACA,uCACDkkF,OAozBN0jO,KAxyBF,cAAmB9lO,EACjBv5L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,OACJg6a,KAAM,YACNn3b,KAAM,QACN+rN,OAAQ,KACRx/K,KAAM,SACN+a,MAAO,KAEPlnD,EAAAA,CAAI,sCACA,sCACA,uCAEJL,EAAAA,CAAI,sCACA,sCACA,uCACJyS,EAAAA,CAAI,sCACA,sCACA,uCACJrlF,EAAAA,CAAI,sCACA,sCACA,uCACJwzK,EAAG,IAEH89C,EAAG,KACHnB,EAAAA,CAAAA,CACG,sCACA,sCACA,uCAAA,CACA,sCACA,sCACA,uCACDkkF,OAwwBNwwN,KA5vBF,cAAmB5yN,EACjBv5L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,OACJg6a,KAAM,YACNn3b,KAAM,QACN+rN,OAAQ,KACRx/K,KAAM,SACN+a,MAAO,OAEPlnD,EAAAA,CAAI,sCACA,sCACA,sCACA,sCACA,YAEJL,EAAAA,CAAI,sCACA,sCACA,sCACA,sCACA,YACJyS,EAAAA,CAAI,sCACA,sCACA,sCACA,sCACA,YACJrlF,EAAAA,CAAI,sCACA,sCACA,sCACA,sCACA,YACJwzK,EAAG,IAEH89C,EAAG,KACHnB,EAAAA,CAAAA,CACG,sCACA,sCACA,sCACA,sCACA,YAAA,CACA,sCACA,sCACA,sCACA,sCACA,YACDkkF,OAgtBN2jO,UApsBF,cAAwB/lO,EACtBv5L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,YACJg6a,KAAM,YACNn3b,KAAM,QACN+rN,OAAQ,KACRx/K,KAAM,SACN+a,MAAO,OAEPlnD,EAAAA,CAAI,sCACA,uCACJL,EAAG,IACHyS,EAAG,IACHrlF,EAAAA,CAAI,sCACA,uCACJwzK,EAAG,IAEH89C,EAAG,IAEH94I,EAAAA,CAAI,sCACA,uCACJ23I,EAAAA,CAAAA,CACG,sCACA,uCAAA,CACA,sCACA,uCACDkkF,GAGFhC,KAAAA,CACEj7K,KAAAA,CAAO,sCACA,uCACPS,OAAAA,CAAS,sCACA,uCACTo7K,MAAAA,CAAAA,CAEIrgO,EAAG,mCACHyS,EAAG,sCAGHzS,EAAG,oCACHyS,EAAG,qCAGPgvN,IAAAA,CACE,IAAA,CACC,sCACA,uCAAA,CACA,IACA,sCACA,6CAkpBT4jO,cAtoBF,cAA4BhmO,EAC1Bv5L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,gBACJg6a,KAAM,kBACNn3b,KAAM,QACN+rN,OAAQ,KACRx/K,KAAM,SACN+a,MAAO,KAEPlnD,EAAAA,CAAI,sCACA,uCACJL,EAAAA,CAAI,sCACA,uCACJyS,EAAAA,CAAI,sCACA,uCACJrlF,EAAAA,CAAI,sCACA,uCACJwzK,EAAG,IAEH89C,EAAG,KACHnB,EAAAA,CAAAA,CACG,sCACA,uCAAA,CACA,sCACA,uCACDkkF,OA6mBN6jO,cAlmBF,cAA4BjmO,EAC1Bv5L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,gBACJg6a,KAAM,kBACNn3b,KAAM,QACN+rN,OAAQ,KACRx/K,KAAM,SACN+a,MAAO,KAEPlnD,EAAAA,CAAI,sCACA,sCACA,uCACJL,EAAAA,CAAI,sCACA,sCACA,uCACJyS,EAAAA,CAAI,sCACA,sCACA,uCACJrlF,EAAAA,CAAI,sCACA,sCACA,uCACJwzK,EAAG,IAEH89C,EAAG,KACHnB,EAAAA,CAAAA,CACG,sCACA,sCACA,uCAAA,CACA,sCACA,sCACA,uCACDkkF,OAmkBN8jO,cAxjBF,cAA4BlmO,EAC1Bv5L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,gBACJg6a,KAAM,kBACNn3b,KAAM,QACN+rN,OAAQ,KACRx/K,KAAM,SACN+a,MAAO,KAEPlnD,EAAAA,CAAI,sCACA,sCACA,sCACA,uCACJL,EAAAA,CAAI,sCACA,sCACA,sCACA,uCACJyS,EAAAA,CAAI,sCACA,sCACA,sCACA,uCACJrlF,EAAAA,CAAI,sCACA,sCACA,sCACA,uCACJwzK,EAAG,IAEH89C,EAAG,IACHnB,EAAAA,CAAAA,CACG,sCACA,sCACA,sCACA,uCAAA,CACA,sCACA,sCACA,sCACA,uCACDkkF,OAmhBN+jO,OAxgBF,cAAqB/gO,EACnB3+L,cACE4Y,MAAA,CACEthC,GAAI,SACJg6a,KAAM,SACNn3b,KAAM,OACN+rN,OAAQ,KACRx/K,KAAM,SACN+a,MAAO,SAEPlnD,EAAAA,CAAI,sCACA,uCAEJL,EAAG,QACHyS,EAAG,IACHrlF,EAAAA,CAAI,sCACA,uCACJwzK,EAAG,IAEH89C,EAAG,IACHnB,EAAAA,CAAAA,CACG,sCACA,wCAEA,sCACA,wCAEHs6S,QAAAA,CAAAA,GAAAA,CAAAA,CAGK,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,6CAocT4N,KAxbF,cAAmBhhO,EACjB3+L,cACE4Y,MAAA,CACEthC,GAAI,OACJg6a,KAAM,OACNn3b,KAAM,OACN+rN,OAAQ,KACRx/K,KAAM,WACN+a,MAAO,OAEPlnD,EAAAA,CAAI,sCACA,sCACA,sCACA,qBAEJL,EAAG,QACHyS,EAAG,IACHrlF,EAAAA,CAAI,sCACA,sCACA,sCACA,qBACJwzK,EAAG,IAEH89C,EAAG,KACHnB,EAAAA,CAAAA,CACG,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAEHs6S,QAAAA,CAAAA,GAAAA,CAAAA,CAGK,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAAA,CAAA,CAGA,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAAA,CAAA,CAGA,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,2BAyXT6N,QA7WF,cAAsBjhO,EACpB3+L,cACE4Y,MAAA,CACEthC,GAAI,UACJg6a,KAAM,KACNn3b,KAAM,OACN+rN,OAAQ,KACRx/K,KAAM,WACN+a,MAAO,OAEPlnD,EAAAA,CAAI,sCACA,sCACA,sCACA,qBAEJL,EAAAA,CAAI,sCACA,sCACA,sCACA,qBACJyS,EAAG,IACHrlF,EAAAA,CAAI,sCACA,sCACA,sCACA,qBACJwzK,EAAG,IAEH89C,EAAG,KACHnB,EAAAA,CAAAA,CACG,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAEHs6S,QAAAA,CAAAA,GAAAA,CAAAA,CAGK,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAAA,CAAA,CAGA,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAAA,CAAA,CAGA,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,2BA2ST8N,QA/RF,cAAsB3gO,EACpBl/L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,UACJg6a,KAAM,UACNn3b,KAAM,UACN+rN,OAAQ,KACRx/K,KAAM,SACN1oB,OAAQ,mCACRnhB,SAAS,EACT4kD,MAAO,SAEPlnD,EAAAA,CAAI,sCACA,uCACJL,EAAG,KAEH+2D,EAAAA,CAAI,sCACA,uCACJ3pI,EAAAA,CAAI,sCACA,uCACJwzK,EAAG,IAEH89C,EAAG,IACHnB,EAAAA,CAAAA,CACG,sCACA,wCAEA,sCACA,uCACDkkF,GAEFo2N,QAAAA,CAAAA,CAAAA,CAEK,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,wCAAA,CAAA,CAGA,sCACA,uCAAA,CACA,sCACA,6CAkNT+N,OArMF,cAAqB5gO,EACnBl/L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,SACJg6a,KAAM,KACNn3b,KAAM,UACN+rN,OAAQ,KACRx/K,KAAM,WACN1oB,OAAQ,WACRnhB,SAAS,EACT4kD,MAAO,OAEPlnD,EAAAA,CAAI,sCACA,sCACA,sCACA,qBACJL,EAAG,IAEH+2D,EAAAA,CAAI,sCACA,sCACA,sCACA,qBACJ3pI,EAAAA,CAAI,sCACA,sCACA,sCACA,qBACJwzK,EAAG,IAEH89C,EAAG,KACHnB,EAAAA,CAAAA,CACG,sCACA,sCACA,sCACA,sBAEA,sCACA,sCACA,sCACA,qBACDkkF,GAEFo2N,QAAAA,CAAAA,CAAAA,CAEK,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAAA,CAAA,CAGA,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAAA,CAAA,CAGA,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAAA,CAAA,CAGA,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,2BAsHTgO,MA1GF,cAAoB7gO,EAClBl/L,YAAY27L,GACV/iL,MAAA,CACEthC,GAAI,QACJg6a,KAAM,QACNn3b,KAAM,UACN+rN,OAAQ,KACRx/K,KAAM,WACN1oB,OAAQ,WACRnhB,SAAS,EACT4kD,MAAO,OAEPlnD,EAAAA,CAAI,sCACA,sCACA,sCACA,qBACJL,EAAG,IAEH+2D,EAAAA,CAAI,sCACA,sCACA,sCACA,qBACJ3pI,EAAAA,CAAI,sCACA,sCACA,sCACA,qBACJwzK,EAAG,IAEH89C,EAAG,KACHnB,EAAAA,CAAAA,CACG,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,qBACDkkF,GAEFo2N,QAAAA,CAAAA,CAAAA,CAEK,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAAA,CAAA,CAGA,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAAA,CAAA,CAGA,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,sBAAA,CAAA,CAGA,sCACA,sCACA,sCACA,qBAAA,CACA,sCACA,sCACA,sCACA,4BA8BL16a,EAAAA,CACJm/H,UAAW,KACXy+E,KAAM,KACND,KAAM,KACNoqO,KAAM,KACNC,KAAM,KACNlT,KAAM,KACNmT,UAAW,KACXC,cAAe,KACfC,cAAe,KACfC,cAAe,KACfC,OAAQ,KACRC,KAAM,KACNC,QAAS,KACTC,QAAS,KACTC,OAAQ,KACRC,MAAO,MAwCT,SAAAp7O,EAAgBj9R,EAAG65J,EAAOvoF,GAQxBkzB,EAAOxkG,aAAa05R,GACpBl1L,GAAQxkG,EAAE65R,KACVr1L,EAAQq1D,IAAU,IAAOA,GACzBr1D,EAAQlzB,IAAQ,IAAOA,SAEjB4rN,EAAAA,IAAU1zL,MAAMl4B,GAChBy0J,EAAO/lO,EAAE48Q,YAAc,EACvB3oB,EAAkB,EAAXj0P,EAAEi0P,OAEfzvJ,EAAOuhI,GAAQz0J,WAENwB,EAAI,EAAGA,EAAIxB,EAAKwB,IACvBoqN,EAAIpqN,GAAK,MAIPq7C,EAFAr7C,EAAI,EACJ02J,EAAQ,OAGL12J,EAAIizJ,GACL/lO,EAAEoiS,IAAItvN,KAAO02J,GAKjBr7G,EAAOnuH,EAAE+lO,KAAKjzJ,EAAG+mF,GAAS2vE,EAC1BA,EAASr7G,GAAS0rC,EAAQ,EAAM,EAChC1rC,GAAQq7G,GAAS3vE,EAEjBqjI,EAAIpqN,GAAKmhL,EAAO9lI,EAEhBr7C,GAAK+mF,GAVH/mF,GAAK,SAaT0xB,EAAiB,IAAVglI,GAEA0zD,EAsGT,SAAAquO,EAAiB5qU,EAAIE,EAAIvvH,SACjBmsN,EA1ER,SAAgB9U,EAAI6U,EAAIlsN,GAItBkzB,EAAOmkL,aAAc+Q,GACrBl1L,EAAOg5L,aAAc9D,GACrBl1L,GAAQmkL,EAAGkR,KACXr1L,GAAQg5L,EAAG3D,KACXr1L,EAAQlzB,IAAQ,IAAOA,SAEjBmsN,EAAAA,CAAAA,IAAWj0L,MAAMl4B,GAAAA,IAAUk4B,MAAMl4B,IACjCy0J,EAAOx0J,KAAKD,IAAIq3M,EAAG/L,YAAa4gB,EAAG5gB,aAAe,EAClDp7E,EAAiB,EAAZmnF,EAAG10B,OACRxyD,EAAiB,EAAZ+7F,EAAGvpC,OAEdzvJ,EAAOuhI,GAAQz0J,OAEXq1M,EAAK,EACLC,EAAK,UAEA9zM,EAAI,EAAGA,EAAIizJ,EAAMjzJ,IAAAA,OAClBsnL,EAAKuuB,EAAG5iD,KAAKjzJ,EAAG,GAChBknL,EAAKwjC,EAAGz3D,KAAKjzJ,EAAG,OAGlBgrN,GAAa,EAAL1jC,GAAUusB,EAAM,EACxBoX,GAAa,EAAL/jC,GAAU4sB,EAAM,EACxBgX,EAAK,EACLC,EAAK,KAEG,IAARC,IACFA,GAAO,GAEG,IAARC,IACFA,GAAO,GAEC,EAAND,EAAM,OACFJ,GAAY,EAALtjC,GAAUusB,EAAM,EAK3BiX,EAHU,IAAPF,GAAmB,IAAPA,GAAqB,IAARK,EAGvBD,GAFCA,KAKA,EAANC,EAAM,OACFL,GAAY,EAAL1jC,GAAU4sB,EAAM,EAK3BiX,EAHU,IAAPH,GAAmB,IAAPA,GAAqB,IAARI,EAGvBC,GAFCA,EAKVN,EAAI,GAAG3qN,GAAK8qN,EAAKp8F,EACjBi8F,EAAI,GAAG3qN,GAAK+qN,EAAKp8F,EAGb,EAAIklF,IAAO,EAAIiX,IACjBjX,EAAK,EAAIA,GAEP,EAAIC,IAAO,EAAIiX,IACjBjX,EAAK,EAAIA,WAGJ9zM,EAAIizJ,EAAMjzJ,EAAIxB,EAAKwB,IAC1B2qN,EAAI,GAAG3qN,GAAK,EACZ2qN,EAAI,GAAG3qN,GAAK,SAGP2qN,EAIKF,CAAO58F,EAAIE,EAAIvvH,GACrB4rN,EAAAA,IAAU1zL,MAAMl4B,WAGbwB,EAAI,EAAGA,EAAIxB,EAAKwB,IAAAA,OACjBo+N,EAAKzT,EAAI,GAAG3qN,GACZq+N,EAAK1T,EAAI,GAAG3qN,GAElBoqN,EAAIpqN,GAAK42b,EAAoB,GAAVx4N,EAAK,IAAUC,EAAK,WAGlCjU,EAOT,SAAA14L,EAAgBc,EAAKlqB,OACdkqB,EAAAA,OACGF,EAAAA,IAAUX,MAAMrpB,GAAO,0BAEzBqpB,MAAMqsJ,mBACRrsJ,MAAMqsJ,kBAAkB1rJ,EAAKZ,GAEzBY,GAIV,SAAAmua,EAAoBhjb,GAClBiU,EAAqB,mBAAPjU,cAGLA,UACA7wF,MACW,6BAAdA,EAAE4lF,SACe,oBAAd5lF,EAAE4lF,kBACGmf,MAAM,wBAEZ/kG,GAiEV,SAAAwzgB,EAAmB35Z,SACXitZ,EAhDR,SAAkBjtZ,GAChB/U,EAAO+U,aAAamgL,GACpBl1L,EAAO+U,EAAEsgL,WAEHhnN,EAAI0mC,EAAEsgL,IAAIhvM,KAEZhY,EAAE8qN,KAAK,IAAM,EAAA,OACRpkL,EAAEynB,WAGQ,IAAfnuD,EAAE4kR,MAAM,GAAO,OAEX/3V,EAAImzE,EAAE82N,MAAM,GAAGtM,MAAM,GAAGiD,MAAM,UAC7B/mL,EAAEszL,OAAOntS,SAGZ44gB,EAAOzlc,EAAE4kR,MAAM,MAGR,IAAT6gL,EAAS,OAEL54gB,EAAImzE,EAAE82N,MAAM,GAAG1I,MAAM,GAAGX,MAAM,GAC9B3mL,EAAIJ,EAAEszL,OAAOntS,OACTi6G,EAAEmgL,SAASyS,OAAO5yL,GAErBuF,GAAG3F,GAAAA,MAAAA,IACE9U,MAAM,iCAEXkV,KAII,IAAT2+Z,EAAS,OAEL54gB,EAAImzE,EAAEm3N,KAAK,GAAG1J,MAAM,GACpB3mL,EAAIJ,EAAEszL,OAAOntS,OACTi6G,EAAEmgL,SAASyS,OAAO5yL,GAErBuF,GAAG3F,GAAAA,MAAAA,IACE9U,MAAM,iCAEXkV,YAGClV,MAAM,oBAIL8za,CAASh/Z,MAGK,IAArBA,EAAEsgL,IAAIhvM,EAAE4sQ,MAAM,GAAO,OAEjBzoD,EAAAA,IAAUtV,EAAG,GAAGE,MAAMrgL,EAAEsgL,KACxBmwO,EAAAA,IAAYtwO,EAAG,GAAGE,MAAMrgL,EAAEsgL,KAC1BqwO,EAAKl7N,EAAIw0N,YACThiU,EAAKwoU,EAAM7vO,SAASF,UAAUsS,OAAO29N,GACrCzoU,EAAKD,EAAG24F,SACRyD,EAAKp8F,EAAG4qG,OAAO89N,GACfrsO,EAAKp8F,EAAG2qG,OAAO89N,GACfriQ,EAAK2+P,EAAGj6N,OAAO3O,GACf71B,EAAKy+P,EAAGj6N,OAAO1O,UAEb2oO,EAAI3+P,EAAIE,UAIVy+P,GAGV,SAAA6J,EAAgB92Z,aAEHntB,KAAQ8mb,EAAU35Z,MACvBntB,EAAKi3a,aAAe,EAAA,OACfj3a,YAGDqY,MAAM,kCAGlB,SAAAq1Z,EAAmB56O,UACVwa,EAAGmrO,WAAW3lP,EAAK,IAAIv0K,WAGhC,SAAA4/Z,EAAiBxhY,EAAQ99B,SACjBtb,EAAAA,IAAY+N,eAEX,SAAkB+7L,EAAO4rG,SACxBvyT,EAAa,EAATuyT,EACJz+R,EAAOjX,EAAMxC,IAAIssM,MAEnB7yL,GAAoB,OAAZA,EAAK9zB,GAAO,OACf8zB,EAAK9zB,SAERyD,EAASwyD,EAAOx/B,KAAK0B,EAAMwuL,EAAO4rG,UAEnC11S,EAAMjF,IAAI+uM,IACb9pM,EAAMvC,IAAIqsM,EAAAA,CAAQ,KAAM,OAE1B9pM,EAAMxC,IAAIssM,GAAO3mN,GAAKyD,EAEfA,GAIX,SAAAk9b,EAAkBl6Z,EAAG3Q,GACnBpE,EAAO+U,aAAamgL,GACpBl1L,EAAQoE,IAAS,IAAOA,GAEb,EAAPA,IACFA,GAAQ,GAAY,EAAPA,UAETzH,EAAMoY,EAAExP,SAAS,GAAInB,GACrBmqR,EAAAA,GACArmP,EAAAA,GAENloC,EAA4B,IAAP,EAAbrD,EAAIvwB,iBAEHkC,EAAI,EAAGA,EAAIquB,EAAIvwB,OAAQkC,GAAK,EACnCigT,EAAOt8S,KAAK0qB,EAAIpwB,MAAM+B,EAAGA,EAAI,YAEtBA,EAAI,EAAGA,EAAIigT,EAAOniT,OAAQkC,GAAK,EACtC45D,EAAIj2D,KAAKs8S,EAAOhiT,MAAM+B,EAAGA,EAAI,GAAGmD,KAAK,aAEhCy2D,EAOTztI,EAAQ0qgB,MAAQA,EAChB1qgB,EAAQozS,MAAQA,EAChBpzS,EAAQ4yS,WAAaA,EACrB5yS,EAAQ4wgB,WAAaA,EACrB5wgB,EAAQuzS,OAASA,EACjBvzS,EAAQg4S,UAAYA,EACpBh4S,EAAQo0gB,UAAYA,EACpBp0gB,EAAQm2gB,OAASA,EACjBn2gB,EAAQu4S,aAAeA,EACvBv4S,EAAQq0gB,aAAeA,EACvBr0gB,EAAQ29R,OAASA,EACjB39R,EAAQw6R,MA9XR,SAAej7R,KAASujF,GACtByiB,EAAuB,iBAAThmG,SAERmC,EAAMnC,EAAK6iG,kBAEbo4L,EAAQ9pM,EAAMhvF,OAEb84R,EAAAA,OACGkwO,EAAQ/sO,EAAOj8R,OAEhBgpgB,EAAAA,MAAAA,IACOlla,MAAAA,qBAA2BjmG,OAEvCi7R,EAAAA,IAAYkwO,KAAS5nb,GACrB4N,EAAMhvF,GAAO84R,SAGRA,GA8WTx6R,EAAQu2L,SA3WR,SAAkBh3L,EAAMmrgB,GACtBnla,EAAuB,iBAAThmG,GACdgmG,EAAwB,mBAAVmla,SAERhpgB,EAAMnC,EAAK6iG,iBAEbu7L,EAAOj8R,GAAAA,MAAAA,IACC8jG,MAAAA,8BAAoCjmG,OAEhDo+R,EAAOj8R,GAAOgpgB,EACdh6a,EAAMhvF,GAAO;A;A;A;A;A;ACvnRf,aAEA3B,EAAAC,QAAAC,EAAA;A;A;A;A;A;A;A;A;A;A;A;ACIA,2DAEMslG,EAAStlG,EAAQ,sBAMjBy6N,EAASxuH,EAAOwuH,QAAUxuH,EAAOusK,SACjC8gQ,EAAa7+S,GAA4C,mBAA3BA,EAAO69C,gBACrCihQ,EAAeD,EAAa7+S,EAAO69C,gBAAgBlzK,KAAKq1H,GAAU,KAClEy1B,EAAAA,IAAWirB,YAAY,IACvByb,EAAY,UAEd4iP,EAAU,EAQd,SAAAh+P,EAAqB9xK,GACnBpE,EAAQoE,IAAS,IAAOA,SAElByvD,EAAOu2F,EAAOO,MAAMvmJ,UAE1B2hO,EAAelyK,EAAM,EAAGzvD,GAEjByvD,EAWT,SAAAi0K,EAAoBj0K,EAAM6oE,EAAKt4H,UAC7BpE,EAAOoqJ,EAAO8H,SAASr+F,IAEZ,MAAP6oE,IACFA,EAAM,GAER18H,EAAQ08H,IAAQ,IAAOA,GAEX,MAARt4H,IACFA,EAAOyvD,EAAKznF,OAASswJ,GAEvB18H,EAAQoE,IAAS,IAAOA,GACxBpE,EAAO08H,EAAMt4H,GAAQyvD,EAAKznF,QAE1B25P,EAAelyK,EAAM6oE,EAAKt4H,GAEnByvD,EAQT,SAAAyhW,WACyB,IAAR,GAAV4e,KACHlhQ,EAAgBpoB,GAChBspR,EAAU,GAGLtpR,EAAKspR,KAUd,SAAAC,EAAqB/ya,EAAKt0B,GACxBkzB,EAAQoB,IAAQ,IAAOA,GACvBpB,EAAQlzB,IAAQ,IAAOA,GACvBkzB,EAAOlzB,GAAOs0B,SAER63E,EAAQnsG,EAAMs0B,KAEN,IAAV63E,EAAU,OACL73E,QAEHk0E,GAAO2D,IAAU,MAEnBlkE,EAAGI,KAGLJ,EAAIugZ,IACJngZ,EAAIJ,EAAIkkE,QACDlkE,EAAII,EAAImgE,UAEVngE,EAAI/T,EAOb,SAAA4xK,EAAyB32C,OAClB23S,EAAAA,MAAAA,IACO/za,MAAM,wCAEXg0a,EAAa53S,GAGtB,SAAA0pG,EAAwBlyK,EAAM6oE,EAAKt4H,MACjCpE,EAAOoqJ,EAAO8H,SAASr+F,IACvB7zD,EAAO6zD,EAAKmjD,kBAAkBouB,aAC9BplI,EAAQ6zD,EAAKyxE,aAAe,IAAOzxE,EAAKyxE,YACxCtlI,EAAQ6zD,EAAK0xE,aAAe,IAAO1xE,EAAK0xE,YACxCvlI,EAAQ08H,IAAQ,IAAOA,GACvB18H,EAAQoE,IAAS,IAAOA,GACxBpE,EAAO08H,EAAMt4H,GAAQyvD,EAAK0xE,YAEtBnhI,EAAO,GAAK,GAAK,EAAA,MAAA,IACTsiI,WAAW,2CAEjBx6J,EAAS2nF,EAAKyxE,WAAa5I,EAC3BL,EAAAA,IAAYuD,WAAW/rE,EAAKmjD,OAAQ9qI,EAAQk4B,MAE9Ci4H,EAAMjwJ,OAASklN,UACRhjN,EAAI,EAAGA,EAAI+tJ,EAAMjwJ,OAAQkC,GAAKgjN,EAAAA,KACjC74L,EAAInqB,EAAIgjN,EAER74L,EAAI4jI,EAAMjwJ,SACZqsB,EAAI4jI,EAAMjwJ,QAEZ4mM,EAAgB32C,EAAMiH,SAASh1J,EAAGmqB,SAGhC4jI,EAAMjwJ,OAAS,GACjB4mM,EAAgB32C,GAQtB5hO,EAAQ25f,OAAS,EACjB35f,EAAQy7Q,YAAcA,EACtBz7Q,EAAQqtU,WAAaA,EACrBrtU,EAAQ66f,UAAYA,EACpB76f,EAAQ05gB,YAAcA,ojzBCnKtB,aAEA,MAAAjiR,EAAAx3P,EAAA,aACA05gB,EAAA15gB,EAAA,gBACAi6b,EAAAj6b,EAAA,sBAEAF,EAAAC,QAAA,CAAA+2Y,EAAAtpO,EAAA,MACA,MAAA80S,EAAAo3D,EAAA5iI,GACA6iI,EAAA1/E,EAAAppV,OAAAgrV,WACAymB,EAAA/kP,OACA/vD,GAGA,IAAAosW,GAAA,EAEA,MAAAtmT,EAAA,CACAmK,KAAA19E,MAAAqlF,IAGA,MAAAjlO,MAAAA,EAAAo2K,KAAAA,SAAA+rS,EAAA/kP,OAAA1zI,KAAAu7I,GAEA,GAAA7uD,GAAAp2K,EAAAuxE,OAAA0zJ,EACA,MAAA,IAAA7/H,MAAA,8BAKA,GAFAq0a,EAAArjW,GAEAp2K,EAAA,MAAA,IAAAolG,MAAA,iBACA,OAAAplG,GAEA05gB,OAAA95X,UAEA,MAAA5/I,MAAAA,EAAAo2K,KAAAA,SAAAojW,EAAA9vb,OAIA,GAFA+vb,EAAArjW,GAEAp2K,EAAA,MAAA,IAAAolG,MAAA,iBACA,OAAAplG,GAEA25gB,OAAA/5X,MAAAjJ,IAEA,MAAA32I,QAAAmzN,EAAAumT,SAEA,IAAA15gB,EAAA,MAAA,IAAAolG,MAAA,iBAGA,MAAAy3H,EAAAw6B,EAAAr3P,GAAAA,EAAAA,EAAA0xE,QAEA,OAAAilE,EAAAjmC,OAAAmsH,IAEAo0B,MAAAj4F,IAEAmpT,EAAA9yN,OAAAj4K,KAAA4hF,IAEA4gX,QAAA5gX,IAEAm6D,EAAA89B,MAAA6oM,EAAAlqV,OAAAuqS,OAAAnhP,EAAAqU,KAEAwsW,QAAA,CAAA7gX,EAAAriB,KAEAw8E,EAAAymT,QAAAjjY,EAAA/mC,OAAAopD,KAGA8sQ,GAAAnvR,IACA,CACA2mF,KAAA,IAAAnK,EAAAwmT,OAAAhjY,GACAs6G,MAAA/mH,GAAAipF,EAAA0mT,QAAA3vY,EAAAyM,KAIA8gM,OAAA,KAEA0qI,EAAAjxW,OACAixW,EAAArlP,SAIA,OAAA3J;A;A;A;A;A;A;ACtEAxzN,EAAAC,QAAA,SAAAurG,GACA,OAAA,MAAAA,GAAA,MAAAA,EAAA8N,aACA,mBAAA9N,EAAA8N,YAAAo+I,UAAAlsJ,EAAA8N,YAAAo+I,SAAAlsJ,gCCRA,IAAA2ua,EAAAj6gB,EAAA,MACAF,EAAAC,QAAA,WACA,IAAAuzE,EAAA2mc,IACAl0b,EAAAk0b,IACA,MAAA,CACA,CACAz4b,OAAAlO,EAAAkO,OACAo1T,KAAA7wT,EAAA6wT,MAEA,CACAp1T,OAAAuE,EAAAvE,OACAo1T,KAAAtjU,EAAAsjU,kDCZA,aAEA,MAAA1E,EAAAlyY,EAAA,gBAGAF,EAAAC,QAAA,WACA,IAAAm7d,EAAAg/C,EAuBA,MAAA,CAAAtjI,KArBA72P,MAAAA,IACA,GAAAm7U,EAAA,MAAA,IAAA31X,MAAA,iBACA21X,EAAAhpF,EAAA1wT,GACA04b,GAAAA,EAAAh/C,IAkBA15Y,OAfA,CACAl+E,CAAAX,OAAAy6N,iBACA,OAAA3wH,MAEA5iB,KAAA,IACAqxY,EAAAA,EAAArxY,OACA,IAAA2oF,SAAAC,IACAynW,EAAA14b,IACA04b,EAAA,KACAznW,EAAAjxF,EAAAqI,sJCvBA,MAAAysa,EAAAt2f,EAAA,UAEAm6gB,EAAAn6gB,EAAA,mBAKAgsb,EAAAhsb,EAAA,WAKAk3f,EAAAl3f,EAAA,YAQA+2f,EAAA/2f,EAAA,aAIAD,EAAAi5f,YAAA,MAaE11f,YACEw0f,EACAzxS,EACAgxS,EACA+iB,EACA1jF,EACAC,EACA0rB,GAEA51W,KAAKqrZ,YAAcA,EACnBrrZ,KAAK45G,QAAUA,EACf55G,KAAK4qZ,SAAWA,EAChB5qZ,KAAK2ta,cAAgBA,EACrB3ta,KAAKiqV,WAAaA,EACdC,IACFlqV,KAAKkqV,WAAaA,GAEpBlqV,KAAKkqM,GAAK0rK,MAAAA,EAAAA,EAAa,IAAI83D,EAAAE,GAC3B5ta,KAAK6ta,QAAU7ta,KAAKkqM,GAAG4jO,YAAY9ta,KAAKqrZ,YAAarrZ,KAAK4qZ,SAAU5qZ,KAAK2ta,eACzE3ta,KAAKurZ,gBAAkB1B,EAAA5mQ,OAAOO,MAAM,GAI/B3sP,gBAEL,GADA4zf,EAAAsjB,mBAAmB/ta,KAAK6ta,QAAQG,GAAG9xb,GAC/B8jB,KAAKqrZ,YAAa,CACpBZ,EAAA6B,OAAO,uDACP,MAAM2hB,EAAgBjua,KAAKkqM,GAAGgkO,YAAYlua,KAAK6ta,QAAShkB,EAAA5mQ,OAAOO,MAAM,IACrExjJ,KAAKiqV,WAAWqjF,QAAQhjB,EAAA6jB,QAAQF,IAChCxjB,EAAA6B,OAAO,uDACP7B,EAAA2jB,sBAAsBpua,KAAK6ta,QAAQG,GAAGj6gB,OACjC,CACL02f,EAAA6B,OAAO,2DACP,MAAM+hB,EAAwB/jB,EAAAgkB,eAAetua,KAAKiqV,WAAWmjF,UAAUhoc,UACjEgoE,MAAEA,GAAUptC,KAAKkqM,GAAGqkO,YAAYvua,KAAK6ta,QAASQ,GACpD,IAAKjhY,EACH,MAAM,IAAIt0C,MAAM,wCAElB2xZ,EAAA6B,OAAO,+CACP7B,EAAA+jB,sBAAsBxua,KAAK6ta,QAAQG,GAAGx+T,KAKnC34M,iBACL,GAAImpG,KAAKqrZ,YAAa,CACpBZ,EAAA6B,OAAO,0EACP,MAAM+hB,EAAwB/jB,EAAAmkB,eAAezua,KAAKiqV,WAAWmjF,UAAUhoc,UACjE06M,UAAEA,EAAS1yI,MAAEA,GAAUptC,KAAKkqM,GAAGqkO,YAAYvua,KAAK6ta,QAASQ,GAC/D,IAAKjhY,EACH,MAAM,IAAIt0C,MAAM,wCAElB2xZ,EAAA6B,OAAO,6CACP7B,EAAA+jB,sBAAsBxua,KAAK6ta,QAAQG,GAAGx+T,IACtCi7S,EAAAikB,mBAAmB1ua,KAAK6ta,QAAQG,GAAGx4L,IAEnCi1K,EAAA6B,OAAO,kDACP,IACE,MAAMqiB,QAAuBpvF,EAAAkgE,cAAc3/N,GAC3C9/K,KAAKkqV,WAAalqV,KAAKkqV,kBAAoB3K,EAAAqvF,qBAAqBD,GAChE3ua,KAAKkqV,iBAAmB3K,EAAAsvF,oBAAoBR,EAAsB3nc,GAAIioc,EAAgB3ua,KAAKkqV,YAC3FlqV,KAAK8ua,mBAAmBH,EAAejiX,MACvC,MAAO34J,GAEP,MAAM,IAAI+kG,MAAM,kDADJ/kG,EAC0D4lF,WAExE8wa,EAAA6B,OAAO,oCACF,CACL7B,EAAA6B,OAAO,qFACP,MAAM2hB,EAAgBjua,KAAKkqM,GAAGgkO,YAAYlua,KAAK6ta,QAAS7ta,KAAK45G,SAC7D55G,KAAKiqV,WAAWqjF,QAAQhjB,EAAAykB,QAAQd,IAChCxjB,EAAA6B,OAAO,8EACP7B,EAAA2jB,sBAAsBpua,KAAK6ta,QAAQG,GAAGj6gB,IAKnC8C,eACL,GAAImpG,KAAKqrZ,YAAa,CACpBZ,EAAA6B,OAAO,wDACP,MAAM2hB,EAAgBjua,KAAKkqM,GAAGgkO,YAAYlua,KAAK6ta,QAAS7ta,KAAK45G,SAC7D55G,KAAKiqV,WAAWqjF,QAAQhjB,EAAA0kB,QAAQf,IAChCxjB,EAAA6B,OAAO,6DACF,CACL7B,EAAA6B,OAAO,8DACP,MAAM+hB,EAAwB/jB,EAAA2kB,eAAejva,KAAKiqV,WAAWmjF,UAAUhoc,UACjE06M,UAAEA,EAAS1yI,MAAEA,GAAUptC,KAAKkqM,GAAGqkO,YAAYvua,KAAK6ta,QAASQ,GAC/D,IAAKjhY,EACH,MAAM,IAAIt0C,MAAM,wCAElB2xZ,EAAA6B,OAAO,iEAEP,IACE,MAAMqiB,QAAuBpvF,EAAAkgE,cAAc3/N,GAC3C9/K,KAAKkqV,WAAalqV,KAAKkqV,kBAAoB3K,EAAAqvF,qBAAqBD,SAC1DpvF,EAAAsvF,oBAAoB7ua,KAAK6ta,QAAQG,GAAGx4L,GAAIm5L,EAAgB3ua,KAAKkqV,YACnElqV,KAAK8ua,mBAAmBH,EAAejiX,MACvC,MAAO34J,GAEP,MAAM,IAAI+kG,MAAM,kDADJ/kG,EAC0D4lF,YAG1E8wa,EAAAykB,eAAelva,KAAK6ta,SAGfh3gB,QAASipR,EAAkB+tP,GAChC,MAAM/xP,EAAK97K,KAAKmva,MAAMtB,GAEtB,OAAO7ta,KAAKkqM,GAAGklO,cAActzP,EAAI+tO,EAAA5mQ,OAAOO,MAAM,GAAIs8B,GAG7CjpR,QAASgpR,EAAmBguP,GACjC,MAAM/xP,EAAK97K,KAAKmva,MAAMtB,GAAS,GAC/B,OAAO7ta,KAAKkqM,GAAGmlO,cAAcvzP,EAAI+tO,EAAA5mQ,OAAOO,MAAM,GAAIq8B,GAG7ChpR,qBACL,OAAOmpG,KAAK6ta,QAAQG,GAAGx4L,GAGjB3+U,MAAOg3gB,EAAuB37C,GAAa,GACjD,IAAK27C,EAAQyB,MAAQzB,EAAQ0B,IAC3B,MAAM,IAAIz2a,MAAM,kEAGlB,OAAIkH,KAAKqrZ,YACAn5B,EAAa27C,EAAQyB,IAAMzB,EAAQ0B,IAEnCr9C,EAAa27C,EAAQ0B,IAAM1B,EAAQyB,IAIpCz4gB,mBAAoB61J,GACxBA,IACF1sD,KAAKurZ,gBAAkB1B,EAAA5mQ,OAAOx5F,KAAKiD,EAAKmjD,OAAQnjD,EAAKyxE,WAAYzxE,EAAKznF,oNC3K5E,MAAA4kb,EAAAt2f,EAAA,UAGAgsb,EAAAhsb,EAAA,YAEAi8gB,EAAAj8gB,EAAA,wBAEA,MAAaq6gB,UAAW4B,EAAAC,kBACd54gB,oBAAqB+zf,EAAmB1ua,EAAYs5P,EAAak6L,GACvE,MACMl/Q,EAAKxwJ,KAAK2va,oBADH,oCAEb3va,KAAK4va,QAAQp/Q,EAAIo6P,GAGjB,MAAO,CAAEp6P,GAAAA,EAAIt0K,EAAAA,EAAGs5P,GAAAA,EAAIk6L,IAAAA,EAAKlgU,GAFdq6S,EAAA5mQ,OAAOO,MAAM,KAKlB3sP,oBAAqB+zf,EAAmB1ua,EAAYs5P,EAAak6L,GACvE,MACMl/Q,EAAKxwJ,KAAK2va,oBADH,oCAEb3va,KAAK4va,QAAQp/Q,EAAIo6P,GAGjB,MAAO,CAAEp6P,GAAAA,EAAIt0K,EAAAA,EAAGs5P,GAAAA,EAAIk6L,IAAAA,EAAKlgU,GAFdq6S,EAAA5mQ,OAAOO,MAAM,KAKlB3sP,cAAem3gB,EAAoBp0T,EAAgB7lN,GACzD,MAAM2yE,EAAKmjb,EAAA5mQ,OAAOO,MAAM,GAGtBwqR,EAAGj6gB,OADK2B,IAAN3B,EACKA,EAEAwrb,EAAAwrE,kBAGT,MAAM75X,EAAK88Y,EAAGj6gB,EAAE2+Q,UAEhB1yK,KAAK4va,QAAQ5B,EAAGx9Q,GAAIt/H,GAGpB,MAAO,CAAEA,GAAAA,EAAIxqD,GAAAA,EAAIm5M,WAFE7/K,KAAK6va,eAAe7B,EAAGx9Q,GAAI52C,IAKxC/iN,cAAem3gB,EAAoBp0T,GACzCo0T,EAAGj6gB,EAAIwrb,EAAAwrE,kBACP,MAAM75X,EAAK88Y,EAAGj6gB,EAAE2+Q,UAChB1yK,KAAK4va,QAAQ5B,EAAGx9Q,GAAIt/H,GAEpBlxB,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAGj6gB,EAAEy+Q,WAAYw7P,EAAGx+T,KAC/C,MAAMugU,EAAMlmB,EAAA5mQ,OAAOx5F,KAAKukX,EAAG9xb,EAAEw2L,WACvBhsM,EAAKs5B,KAAK6va,eAAe7B,EAAGx9Q,GAAIu/Q,GAEtC/va,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAG9xb,EAAEs2L,WAAYw7P,EAAGx+T,KAG/C,MAAO,CAAEt+E,GAAAA,EAAIxqD,GAAAA,EAAIm5M,WAFE7/K,KAAK6va,eAAe7B,EAAGx9Q,GAAI52C,IAKxC/iN,cAAem3gB,EAAoBp0T,GACzC,MAAMm2T,EAAMlmB,EAAA5mQ,OAAOx5F,KAAKukX,EAAG9xb,EAAEw2L,WACvBhsM,EAAKs5B,KAAK6va,eAAe7B,EAAGx9Q,GAAIu/Q,GACtC/va,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAG9xb,EAAEs2L,WAAYw7P,EAAGx+T,KAC/C,MAAMqwE,EAAa7/K,KAAK6va,eAAe7B,EAAGx9Q,GAAI52C,GAExCq0T,EAA+B,CAAE/8Y,GAD5BlxB,KAAKgwa,iBAC2Btpc,GAAAA,EAAIm5M,WAAAA,IACzCyvP,IAAEA,EAAGC,IAAEA,GAAQvva,KAAKlgB,MAAMkub,EAAGx9Q,IAEnC,MAAO,CAAE/oF,EAAGumW,EAAGx9Q,GAAG/oF,EAAGwmW,cAAAA,EAAeqB,IAAAA,EAAKC,IAAAA,GAGnC14gB,aAAcm3gB,EAAoBr0b,GAMxC,OALI4lW,EAAA0wF,iBAAiBt2b,EAAQu3C,MAC3B88Y,EAAGx+T,GAAK71H,EAAQu3C,IAGlBlxB,KAAK4va,QAAQ5B,EAAGx9Q,GAAIw9Q,EAAGx+T,IAChBxvG,KAAKkwa,eAAelC,EAAGx9Q,GAAI72K,EAAQkmM,YAGpChpR,aAAcm3gB,EAAoBr0b,GAMxC,GALI4lW,EAAA0wF,iBAAiBt2b,EAAQu3C,MAC3B88Y,EAAGx+T,GAAK71H,EAAQu3C,IAGlBlxB,KAAK4va,QAAQ5B,EAAGx9Q,GAAIw9Q,EAAGx+T,KAClBw+T,EAAGj6gB,EACN,MAAM,IAAI+kG,MAAM,yCAElBkH,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAGj6gB,EAAEy+Q,WAAYw7P,EAAGx+T,KAC/C,MAAQswE,UAAWp5M,EAAI0mE,MAAO+iY,GAAWnwa,KAAKkwa,eAAelC,EAAGx9Q,GAAI72K,EAAQjT,IACxEypc,GAAwB,KAAdzpc,EAAGzB,QAAiBs6W,EAAA0wF,iBAAiBvpc,KACjDsnc,EAAGx4L,GAAK9uQ,GAEVs5B,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAGj6gB,EAAEy+Q,WAAYw7P,EAAGx4L,KAC/C,MAAM11D,UAAEA,EAAW1yI,MAAOgjY,GAAWpwa,KAAKkwa,eAAelC,EAAGx9Q,GAAI72K,EAAQkmM,YACxE,MAAO,CAAEC,UAAAA,EAAW1yI,MAAQ+iY,GAAUC,GAGhCv5gB,aAAcm3gB,EAAoBr0b,GACxC,MAAQmmM,UAAWp5M,EAAI0mE,MAAO+iY,GAAWnwa,KAAKkwa,eAAelC,EAAGx9Q,GAAI72K,EAAQjT,IAI5E,GAHIypc,GAAwB,KAAdzpc,EAAGzB,QAAiBs6W,EAAA0wF,iBAAiBvpc,KACjDsnc,EAAGx4L,GAAK9uQ,IAELsnc,EAAGj6gB,EACN,MAAM,IAAI+kG,MAAM,yCAElBkH,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAGj6gB,EAAEy+Q,WAAYw7P,EAAGx4L,KAE/C,MAAM11D,UAAEA,EAAW1yI,MAAOgjY,GAAWpwa,KAAKkwa,eAAelC,EAAGx9Q,GAAI72K,EAAQkmM,aAClEyvP,IAAEA,EAAGC,IAAEA,GAAQvva,KAAKlgB,MAAMkub,EAAGx9Q,IAEnC,MAAO,CAAE/oF,EAAGumW,EAAGx9Q,GAAG/oF,EAAGq4G,UAAAA,EAAW1yI,MAAQ+iY,GAAUC,EAASd,IAAAA,EAAKC,IAAAA,GAG3D14gB,YAAay2e,EAAoBsd,EAAmB1ua,GACzD,MAAMwzb,EAAM1va,KAAKgwa,iBACXx6L,EAAKq0K,EAAA5mQ,OAAOO,MAAM,IACxB,IAAIwqR,EAQJ,OALEA,EADE1gC,EACGttY,KAAKqwa,oBAAoBzlB,EAAU1ua,EAAGs5P,EAAIk6L,GAE1C1va,KAAKswa,oBAAoB1lB,EAAU1ua,EAAGs5P,EAAIk6L,GAG1C,CACL1B,GAAAA,EACA7mc,EAAGmma,EACHh2S,GAAI,GAIDzgM,YAAag3gB,EAAuBl0b,EAAgB42b,GACzD,IAAItC,EACJ,GAAmB,IAAfJ,EAAQv2U,GACV22U,EAAgBjua,KAAKwwa,cAAc3C,EAAQG,GAAIr0b,EAAS42b,QACnD,GAAmB,IAAf1C,EAAQv2U,GACjB22U,EAAgBjua,KAAKywa,cAAc5C,EAAQG,GAAIr0b,QAC1C,GAAmB,IAAfk0b,EAAQv2U,GAAU,CAC3B,MAAM7vB,EAAEA,EAAGwmW,cAAeyC,EAAepB,IAAEA,EAAGC,IAAEA,GAAQvva,KAAK2wa,cAAc9C,EAAQG,GAAIr0b,GACvFs0b,EAAgByC,EAChB7C,EAAQpmW,EAAIA,EACZomW,EAAQyB,IAAMA,EACdzB,EAAQ0B,IAAMA,MACT,CAAA,KAAI1B,EAAQv2U,GAAK,GAetB,MAAM,IAAIx+F,MAAM,oBAdhB,GAAI+0a,EAAQ1mc,EAAG,CACb,IAAK0mc,EAAQyB,IACX,MAAM,IAAIx2a,MAAM,qCAGlBm1a,EAAgBjua,KAAK4wa,oBAAoB/C,EAAQyB,IAAK31b,OACjD,CACL,IAAKk0b,EAAQ0B,IACX,MAAM,IAAIz2a,MAAM,qCAGlBm1a,EAAgBjua,KAAK4wa,oBAAoB/C,EAAQ0B,IAAK51b,IAO1D,OADAk0b,EAAQv2U,KACD22U,EAGFp3gB,YAAag3gB,EAAuBl0b,GACzC,IAAImmM,EAAmB+pO,EAAA5mQ,OAAOO,MAAM,GAChCp2G,GAAQ,EACZ,GAAmB,IAAfygY,EAAQv2U,KACPwoF,UAAAA,EAAW1yI,MAAAA,GAAUptC,KAAK6wa,aAAahD,EAAQG,GAAIr0b,SACjD,GAAmB,IAAfk0b,EAAQv2U,KACdwoF,UAAAA,EAAW1yI,MAAAA,GAAUptC,KAAK8wa,aAAajD,EAAQG,GAAIr0b,SACjD,GAAmB,IAAfk0b,EAAQv2U,GAAU,CAC3B,MAAM7vB,EAAEA,EAAGq4G,UAAWixP,EAAoB3jY,MAAO4jY,EAAc1B,IAAEA,EAAGC,IAAEA,GAAQvva,KAAKixa,aAAapD,EAAQG,GAAIr0b,GAC5GmmM,EAAYixP,EACZ3jY,EAAQ4jY,EACRnD,EAAQpmW,EAAIA,EACZomW,EAAQyB,IAAMA,EACdzB,EAAQ0B,IAAMA,EAGhB,OADA1B,EAAQv2U,KACD,CAAEwoF,UAAAA,EAAW1yI,MAAAA,IA/KxB95I,EAAAs6gB,GAAAA,+aCPA,MAAAsD,EAAAh7E,EAAA3ic,EAAA,qBACAq2f,EAAA1zD,EAAA3ic,EAAA,0BACA49gB,EAAAj7E,EAAA3ic,EAAA,0BACAs2f,EAAAt2f,EAAA,UACAgjc,EAAAL,EAAA3ic,EAAA,YACA69gB,EAAA79gB,EAAA,iBAIA89gB,EAAA99gB,EAAA,mBACA+9gB,EAAAp7E,EAAA3ic,EAAA,uBAEMg+gB,EAA6BF,EAAA73G,GAAGg4G,sBA2BtC,SAAgBC,EACdC,EACAC,EACAhnB,GAEA,MAAMinB,EAAcL,EAA2Br9gB,OAAO,CACpD29gB,YAAahoB,EAAA5mQ,OAAOx5F,KAAKioX,GACzBI,YAAaH,EACbjlX,KAAMi+V,MAAAA,EAAAA,EAAa,OAGrB,OAAOd,EAAA5mQ,OAAOx5F,KAAK8nX,EAA2Bjua,OAAOsua,GAAan4S,UAG7DnmF,eAAey+X,EAAar2S,EAAgB9hB,GACjD,OAAOiwS,EAAA5mQ,OAAOx5F,WAAWiyE,EAAOnD,QAAQ+vB,KAAK1uC,IAa/C,SAAgBo4T,EAAqBt/P,GACnC,OAAOm3O,EAAA5mQ,OAAOpxJ,OAAO,CAACg4Z,EAAA5mQ,OAAOx5F,KAAK,4BAA6BipH,IAtDjEp/Q,EAAAy3f,gBAAA,WACE,MAAMv4O,EAAao3O,EAAAz2f,QAAOi6f,qBAG1B,MAAO,CACL16O,UAHgBk3O,EAAAz2f,QAAO84R,gBAAgBzZ,GAIvCA,WAAAA,IAIJl/Q,EAAAk4f,WAAOl4W,eACL8uT,EACA6vE,EACAtnB,GAEA,MAAMgnB,QAAsBI,EAAY3vE,EAAW4vE,EAAoBC,IACjEC,EAAmBvnB,MAAAA,EAAAA,EAAad,EAAA5mQ,OAAOO,MAAM,GAEnD,OAAOiuR,EACLrvE,EAAU7oO,gBACVo4S,EACAO,IAIJ5+gB,EAAAm+gB,uBAAAA,EAcAn+gB,EAAAy+gB,YAAAA,EAIAz+gB,EAAAs7gB,qBAAOt7X,eAAqCsmE,GAC1C,aAAa28O,EAAApjc,QAAO2nO,iBAAiB+uR,EAAA5mQ,OAAOx5F,KAAKmwD,EAAQi4T,eAG3Dv+gB,EAAAmsf,cAAA,SAA+B7lS,GAC7B,OAAO23T,EAA2BnvR,SAChCmvR,EAA2Bnta,OAAOylZ,EAAA5mQ,OAAOx5F,KAAKmwD,MAIlDtmN,EAAA0+gB,oBAAAA,EAiBA1+gB,EAAAu7gB,oBAAOv7X,eACL6+X,EACAv4T,EACAswO,GAEA,MAAM2nF,EAAchoB,EAAA5mQ,OAAOx5F,KAAKmwD,EAAQi4T,aACxC,UAnBFv+X,eAA8BooF,EAAoB02S,GAChD,MAAMC,QAAwB97E,EAAApjc,QAAO2nO,iBAAiBs3S,GACtD,OAAOd,EAAAn+gB,QAAiBk/gB,EAAgBpub,GAAIy3I,GAiBhC42S,CAAcpoF,EAAWjmW,GAAI4tb,GACvC,MAAM,IAAI/4a,MAAM,4CAElB,MAAMy5a,EAAmBP,EAAoBG,GAEvCz/P,EAAY0+P,EAAAj9gB,KAAK8kO,mBAAmB44S,GAG1C,IAAKj4T,EAAQk4T,cAAgBp/P,EAAUiD,OAAO48P,EAAkB1oB,EAAA5mQ,OAAOx5F,KAAKmwD,EAAQk4T,cAClF,MAAM,IAAIh5a,MAAM,yDAElB,aAAay9V,EAAApjc,QAAO2nO,iBAAiB+2S,IAGvCv+gB,EAAAk/gB,QAAA,SAAyBnuL,EAAaouL,GACpC,MAAM/0T,EAAOmsS,EAAA5mQ,OAAOO,MAAM,GACpBkvR,EAAMxB,EAAA/9gB,QAAKw/gB,QAAQxB,EAAAh+gB,QAAQs/gB,EAAKpuL,GAChCuuL,EAAM1B,EAAA/9gB,QAAKgtV,OAAOgxL,EAAAh+gB,QAAQu/gB,EAAKh1T,EAAM,IAM3C,MAAO,CAJIk1T,EAAIxtc,MAAM,EAAG,IACbwtc,EAAIxtc,MAAM,GAAI,IACdwtc,EAAIxtc,MAAM,GAAI,MAK3B9xE,EAAA28gB,iBAAA,SAAkClsP,GAChC,OAAO6lO,EAAAz2f,QAAO24R,gBAAgB/H,EAAG3+M,MAAM,EAAG;A;A;A;A;A;AC/G5C,aAEA/xE,EAAAC,QAAAC,EAAA;A;A;A;A;A;A;A;A;A;ACEA,4CAEMslG,EAAStlG,EAAQ,sBAMvB,SAAAo/gB,EAAiBt/Z,EAAMo/Z,EAAK50Q,UAC1BhlK,EAAOwa,GAA2B,iBAAZA,EAAKpvB,IAEhB,MAAPwub,IACFA,EAAMxvR,EAAOO,MAAM,IAET,MAARqa,IACFA,EAAO5a,EAAOO,MAAMnwI,EAAKpW,KAAM,IAE1BoW,EAAKw/Z,IAAIJ,EAAK50Q,GAGvB,SAAAsiF,EAAgB9sO,EAAMq/Z,EAAKh1T,EAAMt6G,MACnB,MAARs6G,IACFA,EAAOulC,EAAOO,MAAM,IAEtB3qJ,EAAOwa,GAA2B,iBAAZA,EAAKpvB,IAC3B4U,EAAOoqJ,EAAO8H,SAAS2nR,IACvB75a,EAAOoqJ,EAAO8H,SAASrtC,IACvB7kH,EAAQuK,IAAQ,IAAOA,GAEnBsva,EAAIztc,SAAWouC,EAAKpW,KAAAA,MAAAA,IACZsiI,WAAW,6BAEjBulC,EAASl/L,KAAKwhL,KAAKhkJ,EAAMiQ,EAAKpW,SAEhC6nK,EAAS,IAAA,MAAA,IACDvlC,WAAW,gCAEjBx+F,EAAMkiH,EAAOO,MAAMshB,EAASzxJ,EAAKpW,MACjCslK,EAAMtf,EAAOx5F,KAAAA,CAAM,IACnBopX,EAAMx/Z,EAAKy2J,WAEb3sL,EAAO8lK,EAAOO,MAAM,GACpB5rK,EAAM,UAEDzQ,EAAI,EAAGA,EAAI29L,EAAQ39L,IAC1Bo7L,EAAI,IAAM,EAEVswQ,EAAI79Y,KAAK09Y,GACTG,EAAIl9W,OAAOx4E,GACX01b,EAAIl9W,OAAO+nD,GACXm1T,EAAIl9W,OAAO4sG,GAEXplL,EAAO01b,EAAIjiM,QACXh5P,GAAOuF,EAAKlgF,KAAK8jI,EAAKnpD,UAGjBmpD,EAAI37D,MAAM,EAAGg+B,GAYtB9vG,EAAQ25f,OAAS,EACjB35f,EAAQq/gB,QAAUA,EAClBr/gB,EAAQ6sV,OAASA,EACjB7sV,EAAQuiT,OAZR,SAAgBxiM,EAAMo/Z,EAAK50Q,EAAMngD,EAAMt6G,UAE9B+8O,EAAO9sO,EADFs/Z,EAAQt/Z,EAAMo/Z,EAAK50Q,GACNngD,EAAMt6G;A;A;A;A;A;A;A;A;A;A;A;A;A;A;ACxDjC,4CAEMvK,EAAStlG,EAAQ,sBACjBu/gB,EAAOv/gB,EAAQ,oBAOfw/gB,EAAO9vR,EAAOO,MAAM,EAAG,GACvBojE,EAAU3jE,EAAOO,MAAM,GAAI,GAEjCojE,EAAQ,GAAK,UAEPh3C,EAAAA,IAAQlB,YAAAA,CACZ,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,UAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,aAOtC,MAAAuhC,EACEtjM,cACE3M,KAAK8oB,MAAAA,IAAY4lJ,YAAY,GAC7B1uK,KAAKvwB,IAAAA,IAAUi/L,YAAY,IAC3B1uK,KAAKwtD,MAAQy1F,EAAOO,MAAM,IAC1BxjJ,KAAK/C,MAlCH+1a,EAqCJh+Y,cACEh1B,KAAK8oB,MAAM,GAAK,WAChB9oB,KAAK8oB,MAAM,GAAK,WAChB9oB,KAAK8oB,MAAM,GAAK,WAChB9oB,KAAK8oB,MAAM,GAAK,WAChB9oB,KAAK8oB,MAAM,GAAK,WAChB9oB,KAAK8oB,MAAM,GAAK,WAChB9oB,KAAK8oB,MAAM,GAAK,UAChB9oB,KAAK8oB,MAAM,GAAK,WAChB9oB,KAAK/C,KAAO,EACL+C,KAGT21D,OAAOjJ,UACL7zD,EAAOoqJ,EAAO8H,SAASr+F,IACvB1sD,KAAKytK,QAAQ/gH,EAAMA,EAAKznF,QACjB+6B,KAGT4wO,eACS5wO,KAAKkiO,OAAOj/E,EAAOO,MAAM,KAGlCiqB,QAAQ/gH,EAAMtpD,GACZvK,GA7DEm6a,IA6DKhza,KAAK/C,KAAoB,mCAE5BrlB,EAAkB,GAAZooB,KAAK/C,KACXs4H,EAAM,KAEVv1H,KAAK/C,MAAQmG,EAETxrB,EAAM,EAAA,KACJq7b,EAAO,GAAKr7b,KAEZq7b,EAAO7va,IACT6va,EAAO7va,GAETspD,EAAKzvJ,KAAK+iG,KAAKwtD,MAAO51E,EAAK29I,EAAKA,EAAM09S,GAEtCr7b,GAAOq7b,EACP7va,GAAO6va,EACP19S,GAAO09S,EAEHr7b,EAAM,GAAA,OAGVooB,KAAKkjO,WAAWljO,KAAKwtD,MAAO,QAGvBpqD,GAAO,IACZpD,KAAKkjO,WAAWx2K,EAAM6oE,GACtBA,GAAO,GACPnyH,GAAO,GAGLA,EAAM,GACRspD,EAAKzvJ,KAAK+iG,KAAKwtD,MAAO,EAAG+nE,EAAKA,EAAMnyH,GAGxC8+N,OAAOnhM,GACLloC,GAjGEm6a,IAiGKhza,KAAK/C,KAAoB,qCAE1BrlB,EAAkB,GAAZooB,KAAK/C,KACXmG,EAAkB,EAAZpD,KAAK/C,KAEjBi2a,EAASH,EAAO3va,GAAO,EAAI,cAAkB,EAAG,GAChD8va,EAASH,EAAM3va,IAAQ,EAAG,GAE1BpD,KAAKytK,QAAQm5C,EAAS,GAAM,IAAMhvO,EAAO,KACzCooB,KAAKytK,QAAQslQ,EAAM,WAEV5rc,EAAI,EAAGA,EAAI,EAAGA,IACrB+rc,EAASnyY,EAAK/gC,KAAK8oB,MAAM3hD,GAAQ,EAAJA,GAC7B64B,KAAK8oB,MAAM3hD,GAAK,UAGTA,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAKvwB,IAAItI,GAAK,UAEPA,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAKwtD,MAAMrmF,GAAK,SAElB64B,KAAK/C,MAvHH+1a,EAyHKjyY,EAGTmiM,WAAWzzN,EAAO73B,SACVivI,EAAI7mH,KAAKvwB,QAEX5I,EAAIm5B,KAAK8oB,MAAM,GACfxvC,EAAI0mB,KAAK8oB,MAAM,GACfr8C,EAAIuzB,KAAK8oB,MAAM,GACf8U,EAAI59B,KAAK8oB,MAAM,GACf/0H,EAAIisG,KAAK8oB,MAAM,GACf44B,EAAI1hD,KAAK8oB,MAAM,GACfs7F,EAAIpkH,KAAK8oB,MAAM,GACf2+C,EAAIznE,KAAK8oB,MAAM,GACf3hD,EAAI,OAEDA,EAAI,GAAIA,IACb0/I,EAAE1/I,IA4GeouJ,EA5GK39I,EAAU,EAAJzQ,EA6GV,UADPulF,EA5GIj9C,GA6GN8lH,KACS,MAAd7oE,EAAK6oE,KACS,IAAd7oE,EAAK6oE,KACL7oE,EAAK6oE,QAJf,IAAiB7oE,EAAM6oE,EAZP3nH,EA9FLzmC,EAAI,GAAIA,IACb0/I,EAAE1/I,MA6FQymC,EA7FIi5G,EAAE1/I,EAAI,MA8FV,GAAKymC,GAAK,KAAOA,IAAM,GAAKA,GAAK,IAAOA,IAAM,IA9F9Bi5G,EAAE1/I,EAAI,GAAK+wQ,EAAOrxH,EAAE1/I,EAAI,KAAO0/I,EAAE1/I,EAAI,QAE5DA,EAAI,EAAGA,EAAI,GAAIA,IAAAA,OACZwmM,EAAKlmG,EAAI0rW,EAAOp/gB,GAAKi/S,EAAGj/S,EAAG2tJ,EAAG0iE,GAAKwrD,EAAEzoM,GAAK0/I,EAAE1/I,GAC5CymM,EAAKwlQ,EAAOvsc,GAAKwsc,EAAIxsc,EAAGyS,EAAG7M,GAEjCg7F,EAAI28C,EACJA,EAAI1iE,EACJA,EAAI3tJ,EAEJA,EAAK6pI,EAAI+vI,IAAQ,EAEjB/vI,EAAInxD,EACJA,EAAI6M,EACJA,EAAIzS,EAEJA,EAAK8mM,EAAKC,IAAQ,EAGpB5tK,KAAK8oB,MAAM,IAAMjiD,EACjBm5B,KAAK8oB,MAAM,IAAMxvC,EACjB0mB,KAAK8oB,MAAM,IAAMr8C,EACjBuzB,KAAK8oB,MAAM,IAAM8U,EACjB59B,KAAK8oB,MAAM,IAAM/0H,EACjBisG,KAAK8oB,MAAM,IAAM44B,EACjB1hD,KAAK8oB,MAAM,IAAMs7F,EACjBpkH,KAAK8oB,MAAM,IAAM2+C,2BAINwoI,2BAIA6iO,EAAK7iO,EAAQ,kBAGZvjJ,UACLujJ,EAAOh2H,IAAIjlD,OAAO2gC,OAAOjJ,GAAMkkL,oBAG5B1nP,EAAMC,UAChB0P,EAAOoqJ,EAAO8H,SAAS7hK,IAAyB,KAAhBA,EAAKjkB,QACrC4zB,EAAOoqJ,EAAO8H,SAAS5hK,IAA2B,KAAjBA,EAAMlkB,QAChCgrO,EAAOh2H,IAAIjlD,OAAO2gC,OAAOzsE,GAAMysE,OAAOxsE,GAAOynP,qBAGzChjO,EAAGC,EAAG03G,aACVtrC,GAAOg2H,SAEdh2H,EAAIjlD,OACJilD,EAAItkB,OAAO/nD,GACXqsE,EAAItkB,OAAO9nD,GAEP03G,GACFtrC,EAAItkB,OAAO4vD,GAENtrC,EAAI22J,mBAGFlkL,EAAM13J,UACRi7S,EAAOnmC,OAAO90I,KAAKhgI,GAAK2gK,OAAOjJ,GAAMkkL,SAoBhD,SAAAwiM,EAAgBxla,UACNA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,KAAOA,IAAM,GAAKA,GAAK,IAGvE,SAAAula,EAAgBvla,UACNA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,KAAOA,IAAM,GAAKA,GAAK,GAGvE,SAAAsqO,EAAgBtqO,UACNA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,IAAOA,IAAM,EAO7D,SAAAolM,EAAYplM,EAAGC,EAAG03G,UACTA,EAAK33G,GAAKC,EAAI03G,GAGvB,SAAA8tT,EAAazla,EAAGC,EAAG03G,UACT33G,EAAIC,EAAM03G,GAAK33G,EAAIC,GAU7B,SAAAqla,EAAkBxmX,EAAMh7C,EAAK6jH,UAC3B7oE,EAAK6oE,KAAS7jH,IAAQ,GACtBg7C,EAAK6oE,KAAS7jH,IAAQ,GACtBg7C,EAAK6oE,KAAS7jH,IAAQ,EACtBg7C,EAAK6oE,KAAS7jH,EACP6jH,EAhDT06E,EAAOg9M,OAAS,EAChBh9M,EAAOhsN,GAAK,SACZgsN,EAAOhzM,KAAO,GACdgzM,EAAO71E,KAAO,IACd61E,EAAOxuC,UAAY,GACnBwuC,EAAO9lD,KAAOlH,EAAOO,MAAM,GAAI,GAC/BysD,EAAOh2H,IAAAA,IAAUg2H,EAiDjB58S,EAAOC,QAAU28S;A;A;A;A;A;A;A;A;A;A;A;A;A;A;AClRjB,4CAEMp3M,EAAStlG,EAAQ,sBAoGvBF,EAAOC,QA9FP,MASEq5G,YAAY0mM,EAAMp2M,EAAM2Q,EAAAA,GAAQC,EAAAA,IAC9BhV,EAAuB,mBAATw6M,GACdx6M,EAAQoE,IAAS,IAAOA,GACxBpE,EAAOgF,MAAM/gB,QAAQ8wB,IACrB/U,EAAOgF,MAAM/gB,QAAQ+wB,IAErB7N,KAAKqT,KAAOggM,EACZrzM,KAAK/C,KAAOA,EACZ+C,KAAK4N,EAAIA,EACT5N,KAAK6N,EAAIA,EAET7N,KAAKihD,MAAAA,IAAYoyJ,EACjBrzM,KAAKi2G,MAAAA,IAAYo9F,EAQnBr+K,KAAKhgI,MACH6jG,EAAOoqJ,EAAO8H,SAAS/1P,IAGnBA,EAAIiwE,OAAS+6B,KAAK/C,KAAAA,OAEdwqE,EAAAA,IAAQ4rI,EADDrzM,KAAKqT,MAGlBo0D,EAAEzyC,QAAQh1B,KAAK4N,GACf65D,EAAE9R,OAAO3gK,GAETA,EAAMyyK,EAAEmpK,SAAS5wO,KAAK6N,GAEtBhV,EAAO7jG,EAAIiwE,QAAU+6B,KAAK/C,YAItBjD,EAAMipJ,EAAOO,MAAMxjJ,KAAK/C,cAErB91B,EAAI,EAAGA,EAAInyE,EAAIiwE,OAAQkC,IAC9B6yB,EAAI7yB,GAAc,GAATnyE,EAAImyE,WAENA,EAAInyE,EAAIiwE,OAAQkC,EAAI6yB,EAAI/0B,OAAQkC,IACvC6yB,EAAI7yB,GAAK,GAEX64B,KAAKihD,MAAMjsB,QAAQh1B,KAAK4N,GACxB5N,KAAKihD,MAAM0U,OAAO37D,WAET7yB,EAAI,EAAGA,EAAInyE,EAAIiwE,OAAQkC,IAC9B6yB,EAAI7yB,GAAc,GAATnyE,EAAImyE,WAENA,EAAInyE,EAAIiwE,OAAQkC,EAAI6yB,EAAI/0B,OAAQkC,IACvC6yB,EAAI7yB,GAAK,UAEX64B,KAAKi2G,MAAMjhF,QAAQh1B,KAAK4N,GACxB5N,KAAKi2G,MAAMtgD,OAAO37D,GAEXgG,KAQT21D,OAAOjJ,UACL1sD,KAAKihD,MAAM0U,OAAOjJ,GACX1sD,KAQT4wO,eACE5wO,KAAKi2G,MAAMtgD,OAAO31D,KAAKihD,MAAM2vL,SAAS5wO,KAAK6N,IACpC7N,KAAKi2G,MAAM26H,SAAS5wO,KAAK6N,+FC5GlBi0D,EAAAA,EAQT,SAASw/E,OAgBNk4K,EAZJj4K,EAAUD,EAAUE,OAAQC,EAAUH,EAAUI,OAAQC,EAAQL,EAAU1hJ,KAG1Es7F,EAAQomD,EAAUM,MAAM,kBAAoBN,EAAUM,MAAM,gBAAA,WAEhE1mD,EAAMs+N,KAOEA,EAAA,IAEDg4G,sBAAA,WAmBC,SAAAA,EAA+Bv7b,MACvBA,EAAA,IAAA,IACS9hF,EAAOX,OAAOW,KAAK8hF,GAAa9O,EAAI,EAAGA,EAAIhzE,EAAK8wE,SAAUkC,EACpC,MAAvB8O,EAAW9hF,EAAKgzE,MAChB64B,KAAK7rG,EAAKgzE,IAAM8O,EAAW9hF,EAAKgzE,YAShDqqc,EAAsB7za,UAAUk0a,YAAclwR,EAAMG,UAAA,IAQpD0vR,EAAsB7za,UAAUm0a,YAAcnwR,EAAMG,UAAA,IAQpD0vR,EAAsB7za,UAAU+uD,KAAOi1F,EAAMG,UAAA,IAU7C0vR,EAAsBt9gB,OAAS,SAAgB+hF,cAChCu7b,EAAsBv7b,IAYrCu7b,EAAsBlua,OAAS,SAAgB3pB,EAASopK,UAC/CA,IACDA,EAAStB,EAAQvtP,UACM,MAAvBylF,EAAQk4b,aAAuBr+gB,OAAOgnG,eAAeoD,KAAKjkB,EAAS,gBACnEopK,EAAOhB,OAA8B,IAAIppB,MAAMh/I,EAAQk4b,aAChC,MAAvBl4b,EAAQm4b,aAAuBt+gB,OAAOgnG,eAAeoD,KAAKjkB,EAAS,gBACnEopK,EAAOhB,OAA8B,IAAIppB,MAAMh/I,EAAQm4b,aACvC,MAAhBn4b,EAAQ+yE,MAAgBl5J,OAAOgnG,eAAeoD,KAAKjkB,EAAS,SAC5DopK,EAAOhB,OAA8B,IAAIppB,MAAMh/I,EAAQ+yE,MACpDq2F,GAYXyuR,EAAsB8B,gBAAkB,SAAyB35b,EAASopK,UAC/D/iJ,KAAKsD,OAAO3pB,EAASopK,GAAQ8B,UAcxC2sR,EAAsBpta,OAAS,SAAgB0sH,EAAQ7rJ,GAC7C6rJ,aAAkBywB,IACpBzwB,EAASywB,EAAQrtP,OAAO48N,YACxB9rJ,OAAiBtvE,IAAXuvE,EAAuB6rJ,EAAO1tH,IAAM0tH,EAAOl5I,IAAM3S,EAAQ0U,EAAA,IAAcuhH,EAAMs+N,GAAGg4G,sBACnF1gT,EAAOl5I,IAAM5S,GAAA,KACZR,EAAMssJ,EAAOixB,gBACTv9K,IAAQ,QACX,EACDmV,EAAQk4b,YAAc/gT,EAAO6H,mBAE5B,EACDh/I,EAAQm4b,YAAchhT,EAAO6H,mBAE5B,EACDh/I,EAAQ+yE,KAAOokE,EAAO6H,sBAGtB7H,EAAOmxB,SAAe,EAANz9K,WAIjBmV,GAaX63b,EAAsB+B,gBAAkB,SAAyBziT,UACvDA,aAAkBywB,IACpBzwB,EAAA,IAAaywB,EAAQzwB,IAClB9wH,KAAKoE,OAAO0sH,EAAQA,EAAOixB,WAWtCyvR,EAAsB77P,OAAS,SAAgBh8L,SACpB,iBAAZA,GAAoC,OAAZA,EACxB,kBACgB,MAAvBA,EAAQk4b,aAAuBl4b,EAAQ6gB,eAAe,kBAChD7gB,EAAQk4b,aAAqD,iBAA/Bl4b,EAAQk4b,YAAY5sc,QAAuB08K,EAAM/sP,SAAS+kF,EAAQk4b,cAC3F,+BACY,MAAvBl4b,EAAQm4b,aAAuBn4b,EAAQ6gB,eAAe,kBAChD7gB,EAAQm4b,aAAqD,iBAA/Bn4b,EAAQm4b,YAAY7sc,QAAuB08K,EAAM/sP,SAAS+kF,EAAQm4b,cAC3F,+BACK,MAAhBn4b,EAAQ+yE,MAAgB/yE,EAAQ6gB,eAAe,WACzC7gB,EAAQ+yE,MAAuC,iBAAxB/yE,EAAQ+yE,KAAKznF,QAAuB08K,EAAM/sP,SAAS+kF,EAAQ+yE,OAC7E,wBACR,MAWX8kX,EAAsBrvR,WAAa,SAAoBjsH,MAC/CA,aAAkBglE,EAAMs+N,GAAGg4G,sBAAA,OACpBt7Y,MACPv8C,EAAA,IAAcuhH,EAAMs+N,GAAGg4G,6BACD,MAAtBt7Y,EAAO27Y,cAC2B,iBAAvB37Y,EAAO27Y,YACdlwR,EAAM99I,OAAOO,OAAO8xB,EAAO27Y,YAAal4b,EAAQk4b,YAAclwR,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAOixD,EAAO27Y,cAAe,GACnH37Y,EAAO27Y,YAAY5sc,SACxB0U,EAAQk4b,YAAc37Y,EAAO27Y,cACX,MAAtB37Y,EAAO47Y,cAC2B,iBAAvB57Y,EAAO47Y,YACdnwR,EAAM99I,OAAOO,OAAO8xB,EAAO47Y,YAAan4b,EAAQm4b,YAAcnwR,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAOixD,EAAO47Y,cAAe,GACnH57Y,EAAO47Y,YAAY7sc,SACxB0U,EAAQm4b,YAAc57Y,EAAO47Y,cAClB,MAAf57Y,EAAOw2B,OACoB,iBAAhBx2B,EAAOw2B,KACdi1F,EAAM99I,OAAOO,OAAO8xB,EAAOw2B,KAAM/yE,EAAQ+yE,KAAOi1F,EAAMG,UAAUH,EAAM99I,OAAO5+B,OAAOixD,EAAOw2B,OAAQ,GAC9Fx2B,EAAOw2B,KAAKznF,SACjB0U,EAAQ+yE,KAAOx2B,EAAOw2B,OACvB/yE,GAYX63b,EAAsBpvR,SAAW,SAAkBzoK,EAAShlF,GACnDA,IACDA,EAAA,QACAuhI,EAAA,UACAvhI,EAAQ89M,WACJ99M,EAAQgkO,QAAUtyJ,OAClB6vD,EAAO27Y,YAAc,IAErB37Y,EAAO27Y,YAAA,GACHl9gB,EAAQgkO,QAAU96H,QAClBq4B,EAAO27Y,YAAclwR,EAAMG,UAAU5rH,EAAO27Y,eAEhDl9gB,EAAQgkO,QAAUtyJ,OAClB6vD,EAAO47Y,YAAc,IAErB57Y,EAAO47Y,YAAA,GACHn9gB,EAAQgkO,QAAU96H,QAClBq4B,EAAO47Y,YAAcnwR,EAAMG,UAAU5rH,EAAO47Y,eAEhDn9gB,EAAQgkO,QAAUtyJ,OAClB6vD,EAAOw2B,KAAO,IAEdx2B,EAAOw2B,KAAA,GACH/3J,EAAQgkO,QAAU96H,QAClBq4B,EAAOw2B,KAAOi1F,EAAMG,UAAU5rH,EAAOw2B,SAGtB,MAAvB/yE,EAAQk4b,aAAuBl4b,EAAQ6gB,eAAe,iBACtD07B,EAAO27Y,YAAcl9gB,EAAQgkO,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAO3pB,EAAQk4b,YAAa,EAAGl4b,EAAQk4b,YAAY5sc,QAAUtwE,EAAQgkO,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAKjkB,EAAQk4b,aAAel4b,EAAQk4b,aACvL,MAAvBl4b,EAAQm4b,aAAuBn4b,EAAQ6gB,eAAe,iBACtD07B,EAAO47Y,YAAcn9gB,EAAQgkO,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAO3pB,EAAQm4b,YAAa,EAAGn4b,EAAQm4b,YAAY7sc,QAAUtwE,EAAQgkO,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAKjkB,EAAQm4b,aAAen4b,EAAQm4b,aAC9L,MAAhBn4b,EAAQ+yE,MAAgB/yE,EAAQ6gB,eAAe,UAC/C07B,EAAOw2B,KAAO/3J,EAAQgkO,QAAUtyJ,OAASs7K,EAAM99I,OAAOP,OAAO3pB,EAAQ+yE,KAAM,EAAG/yE,EAAQ+yE,KAAKznF,QAAUtwE,EAAQgkO,QAAU96H,MAAQA,MAAMF,UAAUv4B,MAAMw4B,KAAKjkB,EAAQ+yE,MAAQ/yE,EAAQ+yE,MAC/Kx2B,GAUXs7Y,EAAsB7za,UAAUvW,OAAS,kBAC9B4Y,KAAK2M,YAAYy1I,SAASpiJ,KAAMshJ,EAAU1hJ,KAAKyiJ,gBAGnDmvR,EAhQR,GAmQIh4G,GAGJt+N,GA3RoC,mBAAZ3nM,GAA4C,iBAAXF,GAAuBA,GAAUA,EAAOC,UACpGD,EAAOC,QAAUwuK,EAAQvuK,EAAQ,2QCPzC,MAAAs2f,EAAAt2f,EAAA,UACAighB,EAAAt9E,EAAA3ic,EAAA,wBACAq2f,EAAA1zD,EAAA3ic,EAAA,0BACA49gB,EAAAj7E,EAAA3ic,EAAA,0BAIAgsb,EAAAhsb,EAAA,YACAk3f,EAAAl3f,EAAA,aAEaD,EAAAmghB,UAAY,EAEzBnghB,EAAAm8gB,kBAAA,MACS54gB,cAAeilR,EAAiB0vP,EAAW1rP,GAChD,MAAM/rR,EAAIisG,KAAK0hK,QAAQoa,EAAGznR,EAAGynR,EAAG7nR,EAAGu3gB,EAAI1rP,GAGvC,OAFA9/K,KAAK0za,SAAS53P,EAAI97K,KAAK2za,eAAe73P,EAAG7nR,IAElCF,EAGF8C,cAAeilR,EAAiB0vP,EAAW3rP,GAChD,MAAMC,UAAEA,EAAS1yI,MAAEA,GAAUptC,KAAKuhK,QAAQua,EAAGznR,EAAGynR,EAAG7nR,EAAGu3gB,EAAI3rP,GAG1D,OAFA7/K,KAAK0za,SAAS53P,EAAI97K,KAAK2za,eAAe73P,EAAG7nR,IAElC,CAAE6rR,UAAAA,EAAW1yI,MAAAA,GAIZv2I,OAAQilR,GAChB,OAAQ97K,KAAK4za,WAAW93P,EAAGznR,GAGnBwC,SAAUilR,EAAiByD,GACnCzD,EAAG7nR,EAAIsrR,EAGC1oR,iBACR,OAAOgzf,EAAA5mQ,OAAOO,MAAM,IAGZ3sP,WAAYxC,GAEpB,OADiB2rG,KAAKgwa,iBACNh2S,OAAO3lO,GAGfwC,eAAgB5C,GACxB,OAAOA,EAAI,EAGH4C,aAAc5C,GACtB,MAAMsrR,EAAQsqO,EAAA5mQ,OAAOO,MAAM,IAG3B,OAFA+7B,EAAMo1C,cAAc1gU,EAAG,GAEhBsrR,EAGC1oR,QAASxC,EAAYJ,EAAWu3gB,EAAW1rP,GACnD,MAAMP,EAAQv/K,KAAK6za,aAAa5/gB,GAC1BgmL,EAAM,IAAIu5V,EAAArghB,QAOhB,OANA2sR,EAAY+pO,EAAA5mQ,OAAOx5F,KAAKq2H,GACxB7lG,EAAIjlD,KAAK3gI,EAAGkrR,GACZtlG,EAAI65V,IAAItI,GACRvxV,EAAIynF,QAAQoe,GAGL+pO,EAAA5mQ,OAAOpxJ,OAAO,CAACiuL,EAAW7lG,EAAI22J,UAG7B/5U,eAAgB25P,EAAoBsvB,GAC5C,IAAID,EAQJ,OANEA,EADE7/K,KAAKo4U,OAAO5nL,EAAGsrB,IACJ97K,KAAKova,cAAc5+Q,EAAGsrB,GAAItrB,EAAG/oF,EAAGq4G,GAEhCA,EAGf9/K,KAAK4va,QAAQp/Q,EAAIqvB,GACVA,EAGChpR,QAASxC,EAAYJ,EAAWu3gB,EAAW3rP,GACnD,MAAMN,EAAQv/K,KAAK6za,aAAa5/gB,GAC1BgmL,EAAM,IAAIu5V,EAAArghB,QAEVqxE,GADNq7M,EAAagqO,EAAA5mQ,OAAOx5F,KAAKo2H,IACFz6M,MAAMy6M,EAAW56M,OAAS,IAMjD,OALA46M,EAAaA,EAAWz6M,MAAM,EAAGy6M,EAAW56M,OAAS,IACrDg1G,EAAIjlD,KAAK3gI,EAAGkrR,GACZtlG,EAAI65V,IAAItI,GACRvxV,EAAIsnF,QAAQse,GAEL,CAAEC,UAAWD,EAAYzyI,MAAO6sC,EAAI07F,OAAOnxM,IAG1C3tE,eAAgB25P,EAAoBqvB,GAC5C,IAAIC,EAAsB1yI,GAAQ,EAQlC,OAPIptC,KAAKo4U,OAAO5nL,EAAGsrB,MACdgE,UAAAA,EAAW1yI,MAAAA,GAAUptC,KAAKqva,cAAc7+Q,EAAGsrB,GAAItrB,EAAG/oF,EAAGo4G,IAExDC,EAAYD,EAGd7/K,KAAK4va,QAAQp/Q,EAAIqvB,GACV,CAAEC,UAAAA,EAAW1yI,MAAAA,GAGZv2I,GAAI27Q,EAAqBE,GACjC,IACE,MAAMqhQ,EAAUnqB,EAAAz2f,QAAO0iT,OAAOnjC,EAAWF,GACnC5nM,EAASi/a,EAAA5mQ,OAAOO,MAAM,IAE5B,OADAuwR,EAAQ92gB,KAAK2tE,GACNA,EACP,MAAO72E,GAEP,OADA02f,EAAA6B,OAAOv4f,EAAE4lF,SACFkwa,EAAA5mQ,OAAOO,MAAM,KAId3sP,QAAS25P,EAAoB9jG,GACrC8jG,EAAG/oF,EAAIznE,KAAKg0a,QAAQxjR,EAAG/oF,EAAG/a,GAGlB71J,QAASgwE,EAAUyS,GAC3B,OAAO63b,EAAAh+gB,QAAO+lO,OAAO2wR,EAAA5mQ,OAAOx5F,KAAK,IAAI5iF,KAAMyS,KAGnCziF,OAAQ25P,EAAoBiiR,GACpC,MAAOpuL,EAAI4vL,GAAS10F,EAAAizF,QAAQhiR,EAAG6zF,GAAIouL,GACnCjiR,EAAGsrB,GAAK97K,KAAKk0a,cAAcD,GAC3BzjR,EAAG6zF,GAAKA,EAGAxtV,cAAexC,GAEvB,MAAO,CAAEA,EAAAA,EAAGJ,EADFX,EAAAmghB,WAMF58gB,oBAAqBs9gB,GAC7B,MAAMC,EAA2BvqB,EAAA5mQ,OAAOx5F,KAAK0qX,EAAc,SACrD1sW,EAAIznE,KAAKq0a,iBAAiBD,GAE1B/vL,EAAK58K,EACLzyK,EAAMgrG,KAAKgwa,iBAGjB,MAAO,CAAEl0P,GAFe97K,KAAKk0a,cAAcl/gB,GAE9BqvV,GAAAA,EAAI58K,EAAAA,GAGT5wK,iBAAkBs9gB,GAC1B,GAAIA,EAAalvc,QAAU,GAAI,CAC7B,MAAMwiG,EAAIoiV,EAAA5mQ,OAAOO,MAAM,IAEvB,OADA2wR,EAAal3gB,KAAKwqK,GACXA,EAEP,OAAOznE,KAAKg0a,QAAQG,EAActqB,EAAA5mQ,OAAOO,MAAM,IAIzC3sP,MAAO25P,GACf,MAAO8jR,EAAQC,GAAUh1F,EAAAizF,QAAQhiR,EAAG6zF,GAAIwlK,EAAA5mQ,OAAOO,MAAM,IAIrD,MAAO,CAAE8rR,IAHGtva,KAAKk0a,cAAcI,GAGjB/E,IAFFvva,KAAKk0a,cAAcK,IAKvB19gB,oBAAqBilR,EAAiBliE,GAC9C,MAAMimE,EAAa7/K,KAAKova,cAActzP,EAAI+tO,EAAA5mQ,OAAOO,MAAM,GAAI5pC,GAI3D,MAAO,CAAE1oF,GAHElxB,KAAKgwa,iBAGHtpc,GAFFmjb,EAAA5mQ,OAAOO,MAAM,GAEPq8B,WAAAA,GAGThpR,mBAAoBilR,EAAiBniM,GAC7C,OAAOqmB,KAAKqva,cAAcvzP,EAAI+tO,EAAA5mQ,OAAOO,MAAM,GAAI7pK,EAAQkmM;A;A;A;A;A;A;A;A;A;ACtK3D,4CAEMhnL,EAAStlG,EAAQ,sBACjBihhB,EAAWjhhB,EAAQ,cACnBkhhB,EAAWlhhB,EAAQ,cAMnBmhhB,EAASzxR,EAAOO,MAAM,GAAI,GAMhC,MAAAmxR,EAMEhoa,cACE3M,KAAK40a,OAAAA,IAAaJ,EAClBx0a,KAAK60a,KAAAA,IAAWJ,EAChBz0a,KAAKhrG,IAAMiuP,EAAOO,MAAM,IACxBxjJ,KAAKtlB,MAAQ,EACbslB,KAAK80a,OAAS,EACd90a,KAAK+0a,UAAY,EASnB//Y,KAAKhgI,EAAKypQ,UACR5lK,EAAOoqJ,EAAO8H,SAAS/1P,IACvB6jG,EAAOoqJ,EAAO8H,SAAS0T,IAEvBz+J,KAAKhrG,IAAIw8R,KAAK,GACdxxL,KAAK40a,OAAO5/Y,KAAKhgI,EAAKypQ,EAAI,GAC1Bz+J,KAAK40a,OAAOlzQ,QAAQ1hK,KAAKhrG,KACzBgrG,KAAK60a,KAAK7/Y,KAAKh1B,KAAKhrG,KAEpBgrG,KAAKtlB,KAAO,EACZslB,KAAK80a,OAAS,EACd90a,KAAK+0a,UAAY,EAEV/0a,KAST8za,IAAIpnX,OACiB,IAAf1sD,KAAKtlB,KAAU,MAAA,IACPoe,MAAM,kCAEA,IAAdkH,KAAKtlB,KAAS,MAAA,IACNoe,MAAM,iCAElBkH,KAAK60a,KAAKl/W,OAAOjJ,GACjB1sD,KAAK80a,QAAUpoX,EAAKznF,OAEb+6B,KAQT0hK,QAAQh1G,OACa,IAAf1sD,KAAKtlB,KAAU,MAAA,IACPoe,MAAM,kCAEA,IAAdkH,KAAKtlB,MAA4B,IAAdslB,KAAKtlB,KAAS,MAAA,IACzBoe,MAAM,qCAEA,IAAdkH,KAAKtlB,OACPslB,KAAKg1a,OAAOh1a,KAAK80a,QACjB90a,KAAKtlB,KAAO,GAGdslB,KAAK40a,OAAOlzQ,QAAQh1G,GACpB1sD,KAAK60a,KAAKl/W,OAAOjJ,GAEjB1sD,KAAK+0a,WAAaroX,EAAKznF,OAEhBynF,EAQT60G,QAAQ70G,MACN7zD,EAAOoqJ,EAAO8H,SAASr+F,KAEJ,IAAf1sD,KAAKtlB,KAAU,MAAA,IACPoe,MAAM,kCAEA,IAAdkH,KAAKtlB,MAA4B,IAAdslB,KAAKtlB,KAAS,MAAA,IACzBoe,MAAM,qCAEA,IAAdkH,KAAKtlB,OACPslB,KAAKg1a,OAAOh1a,KAAK80a,QACjB90a,KAAKtlB,KAAO,GAGdslB,KAAK+0a,WAAaroX,EAAKznF,OAEvB+6B,KAAK60a,KAAKl/W,OAAOjJ,GACjB1sD,KAAK40a,OAAOlzQ,QAAQh1G,GAEbA,EAQTnnD,KAAKmnD,MACH7zD,EAAOoqJ,EAAO8H,SAASr+F,KAEJ,IAAf1sD,KAAKtlB,KAAU,MAAA,IACPoe,MAAM,kCAEA,IAAdkH,KAAKtlB,MAA4B,IAAdslB,KAAKtlB,KAAS,MAAA,IACzBoe,MAAM,kCAEA,IAAdkH,KAAKtlB,OACPslB,KAAKg1a,OAAOh1a,KAAK80a,QACjB90a,KAAKtlB,KAAO,GAGdslB,KAAK+0a,WAAaroX,EAAKznF,OAEvB+6B,KAAK60a,KAAKl/W,OAAOjJ,GAEVA,EAQTkkL,YACqB,IAAf5wO,KAAKtlB,KAAU,MAAA,IACPoe,MAAM,qCAEZsK,EAAM6/I,EAAOO,MAAM,IAEzByxR,EAAS7xa,EAAKpD,KAAK80a,OAAQ,GAC3BG,EAAS7xa,EAAKpD,KAAK+0a,UAAW,GAEZ,IAAd/0a,KAAKtlB,MACPslB,KAAKg1a,OAAOh1a,KAAK80a,QAEnB90a,KAAKg1a,OAAOh1a,KAAK+0a,WACjB/0a,KAAK60a,KAAKl/W,OAAOvyD,SAEXyva,EAAM7ya,KAAK60a,KAAKjkM,eAEtB5wO,KAAKstG,UAEEulU,EAOTvlU,UACEttG,KAAK40a,OAAOtnU,UACZttG,KAAK60a,KAAKvnU,kBAEDnmI,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAKhrG,IAAImyE,GAAK,SAEhB64B,KAAKtlB,MAAQ,EACbslB,KAAK80a,OAAS,EACd90a,KAAK+0a,UAAY,EAEV/0a,KAST21K,OAAOnxM,GACLq0B,EAAOoqJ,EAAO8H,SAASvmL,IACvBq0B,EAAsB,KAAfr0B,EAAIS,cAEL4tc,EAAM7ya,KAAK4wO,YAEbrrH,EAAI,UAECp+I,EAAI,EAAGA,EAAI,GAAIA,IACtBo+I,GAAKstT,EAAI1rc,GAAK3C,EAAI2C,UAEXo+I,EAAI,IAAO,IAAQ,EAS9ByvT,OAAO/3a,SACCrlB,EAAa,GAAPqlB,EAERrlB,EAAM,GACRooB,KAAK60a,KAAKl/W,OAAO++W,EAAOtvc,MAAM,EAAG,GAAKwS,mBAY3B5iF,EAAKypQ,EAAIhvL,EAAKqkc,SACrBoB,EAAAA,IAAWP,SAEjBO,EAAKlgZ,KAAKhgI,EAAKypQ,GAEXq1Q,GACFoB,EAAKpB,IAAIA,GAEXoB,EAAKxzQ,QAAQjyL,GAENylc,EAAKtkM,uBAaC57U,EAAKypQ,EAAIhvL,EAAKjL,EAAKsvc,SAC1BoB,EAAAA,IAAWP,SAEjBO,EAAKlgZ,KAAKhgI,EAAKypQ,GAEXq1Q,GACFoB,EAAKpB,IAAIA,GAEXoB,EAAK3zQ,QAAQ9xL,GAENylc,EAAKv/P,OAAOnxM,eAaTxvE,EAAKypQ,EAAIhvL,EAAKjL,EAAKsvc,SACvBoB,EAAAA,IAAWP,SAEjBO,EAAKlgZ,KAAKhgI,EAAKypQ,GAEXq1Q,GACFoB,EAAKpB,IAAIA,GAEXoB,EAAK3va,KAAK91B,GAEHylc,EAAKv/P,OAAOnxM,IAcvB,SAAA0uc,EAAkBnuR,EAAKrzI,EAAK6jH,UAC1BwvB,EAAIxvB,KAAS7jH,EACbA,KAAS,EACTqzI,EAAIxvB,KAAS7jH,EACbA,KAAS,EACTqzI,EAAIxvB,KAAS7jH,EACbA,KAAS,EACTqzI,EAAIxvB,KAAS7jH,EACN6jH,EAGT,SAAA0/S,EAAkBlwR,EAAKrzI,EAAK6jH,SACpB8tB,EAAM3xI,GAAO,EAAI,cAAkB,SAGzCwha,EAASnuR,EAFErzI,IAAQ,EAED6jH,EAAM,GACxB29S,EAASnuR,EAAK1B,EAAI9tB,EAAM,GAEjBA,EAAM,EAxBfo/S,EAAK1nB,OAASunB,EAASvnB,OA+BvB55f,EAAOC,QAAUqhhB;A;A;A;A;A;A;A;A;A;A;AC3UjB,4CAEM97a,EAAStlG,EAAQ,sBAMjB4hhB,EAA8D,IAA9DA,IAAiB9hI,UAAAA,IAAcC,WAAAA,CAAY,IAAIzjM,QAAQ,GAM7D,MAAA2kU,EAME7na,cACE3M,KAAK8oB,MAAAA,IAAY4lJ,YAAY,IAC7B1uK,KAAKwwH,OAAAA,IAAak+C,YAAY,IAC9B1uK,KAAK24H,MAAAA,IAAYF,WAAWz4H,KAAKwwH,OAAO3gB,QACxC7vG,KAAKpoB,KAAO,EAERu9b,IACFn1a,KAAK24H,MAAQsqB,EAAOO,MAAM,KAU9BxuH,KAAKhgI,EAAKuqR,EAAOjgD,MACA,MAAXA,IACFA,EAAU,GAEZzmI,EAAOoqJ,EAAO8H,SAAS/1P,IACvB6jG,EAAOoqJ,EAAO8H,SAASw0B,IACvB1mL,EAAO1yB,OAAOkgT,cAAc/mJ,IAET,KAAftqO,EAAIiwE,QAAgC,KAAfjwE,EAAIiwE,OAAW,MAAA,IAC5Bs6J,WAAW,wBAEnBggD,EAAMt6M,QAAU,KAClBjwE,EAAMw/gB,EAAS3+N,OAAO7gT,EAAKuqR,EAAMn6M,MAAM,EAAG,KAC1Cm6M,EAAQA,EAAMn6M,MAAM,KAGtB46B,KAAK8oB,MAAM,GAAK,WAChB9oB,KAAK8oB,MAAM,GAAK9zH,EAAIiwE,OAAS,GAAK,UAAa,UAC/C+6B,KAAK8oB,MAAM,GAAK9zH,EAAIiwE,OAAS,GAAK,WAAa,WAC/C+6B,KAAK8oB,MAAM,GAAK,WAChB9oB,KAAK8oB,MAAM,GAAKssZ,EAAQpghB,EAAK,GAC7BgrG,KAAK8oB,MAAM,GAAKssZ,EAAQpghB,EAAK,GAC7BgrG,KAAK8oB,MAAM,GAAKssZ,EAAQpghB,EAAK,GAC7BgrG,KAAK8oB,MAAM,GAAKssZ,EAAQpghB,EAAK,IAC7BgrG,KAAK8oB,MAAM,GAAKssZ,EAAQpghB,EAAK,GAAKA,EAAIiwE,QACtC+6B,KAAK8oB,MAAM,GAAKssZ,EAAQpghB,EAAK,GAAKA,EAAIiwE,QACtC+6B,KAAK8oB,MAAM,IAAMssZ,EAAQpghB,EAAK,GAAKA,EAAIiwE,QACvC+6B,KAAK8oB,MAAM,IAAMssZ,EAAQpghB,EAAK,GAAKA,EAAIiwE,QACvC+6B,KAAK8oB,MAAM,IAAMw2G,IAAY,EAER,IAAjBigD,EAAMt6M,OACR+6B,KAAK8oB,MAAM,IAAOw2G,EAAU,aAAiB,EAC7Ct/H,KAAK8oB,MAAM,IAAMssZ,EAAQ71P,EAAO,GAChCv/K,KAAK8oB,MAAM,IAAMssZ,EAAQ71P,EAAO,WACN,KAAjBA,EAAMt6M,OACf+6B,KAAK8oB,MAAM,IAAMssZ,EAAQ71P,EAAO,GAChCv/K,KAAK8oB,MAAM,IAAMssZ,EAAQ71P,EAAO,GAChCv/K,KAAK8oB,MAAM,IAAMssZ,EAAQ71P,EAAO,WACN,KAAjBA,EAAMt6M,iBAMLs6J,WAAW,uBALrBv/H,KAAK8oB,MAAM,IAAMssZ,EAAQ71P,EAAO,GAChCv/K,KAAK8oB,MAAM,IAAMssZ,EAAQ71P,EAAO,GAChCv/K,KAAK8oB,MAAM,IAAMssZ,EAAQ71P,EAAO,GAChCv/K,KAAK8oB,MAAM,IAAMssZ,EAAQ71P,EAAO,WAKlCv/K,KAAKpoB,IAAM,EAEJooB,KAST0hK,QAAQh1G,MACN7zD,EAAOoqJ,EAAO8H,SAASr+F,KAEL,IAAd1sD,KAAKpoB,IAAS,MAAA,IACNkhB,MAAM,uCAET3xB,EAAI,EAAGA,EAAIulF,EAAKznF,OAAQkC,IACP,IAAR,GAAX64B,KAAKpoB,OACRooB,KAAK4iO,SACL5iO,KAAKpoB,IAAM,GAGb80E,EAAKvlF,IAAM64B,KAAK24H,MAAM34H,KAAKpoB,cAGtB80E,EAOTk2K,iBACWz7P,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAKwwH,OAAOrpJ,GAAK64B,KAAK8oB,MAAM3hD,WAErBA,EAAI,EAAGA,EAAI,GAAIA,IACtBkuc,EAAOr1a,KAAKwwH,OAAQ,EAAG,EAAG,EAAG,IAC7B6kT,EAAOr1a,KAAKwwH,OAAQ,EAAG,EAAG,EAAG,IAC7B6kT,EAAOr1a,KAAKwwH,OAAQ,EAAG,EAAG,GAAI,IAC9B6kT,EAAOr1a,KAAKwwH,OAAQ,EAAG,EAAG,GAAI,IAC9B6kT,EAAOr1a,KAAKwwH,OAAQ,EAAG,EAAG,GAAI,IAC9B6kT,EAAOr1a,KAAKwwH,OAAQ,EAAG,EAAG,GAAI,IAC9B6kT,EAAOr1a,KAAKwwH,OAAQ,EAAG,EAAG,EAAG,IAC7B6kT,EAAOr1a,KAAKwwH,OAAQ,EAAG,EAAG,EAAG,YAGtBrpJ,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAKwwH,OAAOrpJ,IAAM64B,KAAK8oB,MAAM3hD,MAE3Bguc,UACOhuc,EAAI,EAAGA,EAAI,GAAIA,IACtB+rc,EAASlza,KAAK24H,MAAO34H,KAAKwwH,OAAOrpJ,GAAQ,EAAJA,GAGzC64B,KAAK8oB,MAAM,KAAO,EAEK,IAAnB9oB,KAAK8oB,MAAM,MACb9oB,KAAK8oB,MAAM,KAAO,GAOtBwkF,kBACWnmI,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAK8oB,MAAM3hD,GAAK,EAChB64B,KAAKwwH,OAAOrpJ,GAAK,KAGfguc,UACOhuc,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAK24H,MAAMxxJ,GAAK,SAGpB64B,KAAKpoB,KAAO,EAELooB,mBAUKhrG,EAAKuqR,MACjB1mL,EAAOoqJ,EAAO8H,SAAS/1P,IACvB6jG,EAAOoqJ,EAAO8H,SAASw0B,IAEJ,KAAfvqR,EAAIiwE,QAAgC,KAAfjwE,EAAIiwE,OAAW,MAAA,IAC5Bs6J,WAAW,wBAEF,KAAjBggD,EAAMt6M,OAAW,MAAA,IACTs6J,WAAW,6BAEjBz2G,EAAAA,IAAY4lJ,YAAY,IAE9B5lJ,EAAM,GAAK,WACXA,EAAM,GAAK9zH,EAAIiwE,OAAS,GAAK,UAAa,UAC1C6jD,EAAM,GAAK9zH,EAAIiwE,OAAS,GAAK,WAAa,WAC1C6jD,EAAM,GAAK,WACXA,EAAM,GAAKssZ,EAAQpghB,EAAK,GACxB8zH,EAAM,GAAKssZ,EAAQpghB,EAAK,GACxB8zH,EAAM,GAAKssZ,EAAQpghB,EAAK,GACxB8zH,EAAM,GAAKssZ,EAAQpghB,EAAK,IACxB8zH,EAAM,GAAKssZ,EAAQpghB,EAAK,GAAKA,EAAIiwE,QACjC6jD,EAAM,GAAKssZ,EAAQpghB,EAAK,GAAKA,EAAIiwE,QACjC6jD,EAAM,IAAMssZ,EAAQpghB,EAAK,GAAKA,EAAIiwE,QAClC6jD,EAAM,IAAMssZ,EAAQpghB,EAAK,GAAKA,EAAIiwE,QAClC6jD,EAAM,IAAMssZ,EAAQ71P,EAAO,GAC3Bz2J,EAAM,IAAMssZ,EAAQ71P,EAAO,GAC3Bz2J,EAAM,IAAMssZ,EAAQ71P,EAAO,GAC3Bz2J,EAAM,IAAMssZ,EAAQ71P,EAAO,YAElBp4M,EAAI,EAAGA,EAAI,GAAIA,IACtBkuc,EAAOvsZ,EAAO,EAAG,EAAG,EAAG,IACvBusZ,EAAOvsZ,EAAO,EAAG,EAAG,EAAG,IACvBusZ,EAAOvsZ,EAAO,EAAG,EAAG,GAAI,IACxBusZ,EAAOvsZ,EAAO,EAAG,EAAG,GAAI,IACxBusZ,EAAOvsZ,EAAO,EAAG,EAAG,GAAI,IACxBusZ,EAAOvsZ,EAAO,EAAG,EAAG,GAAI,IACxBusZ,EAAOvsZ,EAAO,EAAG,EAAG,EAAG,IACvBusZ,EAAOvsZ,EAAO,EAAG,EAAG,EAAG,UAGnBiY,EAAMkiH,EAAOO,MAAM,WAEzB0vR,EAASnyY,EAAKjY,EAAM,GAAI,GACxBoqZ,EAASnyY,EAAKjY,EAAM,GAAI,GACxBoqZ,EAASnyY,EAAKjY,EAAM,GAAI,GACxBoqZ,EAASnyY,EAAKjY,EAAM,GAAI,IACxBoqZ,EAASnyY,EAAKjY,EAAM,IAAK,IACzBoqZ,EAASnyY,EAAKjY,EAAM,IAAK,IACzBoqZ,EAASnyY,EAAKjY,EAAM,IAAK,IACzBoqZ,EAASnyY,EAAKjY,EAAM,IAAK,IAElBiY,GAcX,SAAAs0Y,EAAgBzna,EAAG/mC,EAAGyS,EAAG7M,EAAGmxD,GAC1BhwB,EAAE/mC,IAAM+mC,EAAEt0B,GACVs0B,EAAEgwB,GAAK0vK,EAAO1/L,EAAEgwB,GAAKhwB,EAAE/mC,GAAI,IAE3B+mC,EAAEnhC,IAAMmhC,EAAEgwB,GACVhwB,EAAEt0B,GAAKg0N,EAAO1/L,EAAEt0B,GAAKs0B,EAAEnhC,GAAI,IAE3BmhC,EAAE/mC,IAAM+mC,EAAEt0B,GACVs0B,EAAEgwB,GAAK0vK,EAAO1/L,EAAEgwB,GAAKhwB,EAAE/mC,GAAI,GAE3B+mC,EAAEnhC,IAAMmhC,EAAEgwB,GACVhwB,EAAEt0B,GAAKg0N,EAAO1/L,EAAEt0B,GAAKs0B,EAAEnhC,GAAI,GAG7B,SAAA6gO,EAAgB7oF,EAAGnrI,UACTmrI,GAAKnrI,EAAMmrI,IAAO,GAAKnrI,EAGjC,SAAA87b,EAAiB1oX,EAAM6oE,UACb7oE,EAAK6oE,KACS,IAAd7oE,EAAK6oE,KACS,MAAd7oE,EAAK6oE,KACO,SAAZ7oE,EAAK6oE,GAGf,SAAA29S,EAAkBnuR,EAAKrzI,EAAK6jH,UAC1BwvB,EAAIxvB,KAAS7jH,EACbA,KAAS,EACTqzI,EAAIxvB,KAAS7jH,EACbA,KAAS,EACTqzI,EAAIxvB,KAAS7jH,EACbA,KAAS,EACTqzI,EAAIxvB,KAAS7jH,EACN6jH,EAvCTi/S,EAASvnB,OAAS,EA8ClB55f,EAAOC,QAAUkhhB;A;A;A;A;A;A;A;A;A;A;A;A;A;A;A;ACjRjB,4CAEM37a,EAAStlG,EAAQ,sBAMvB,MAAAkhhB,EAME9na,cACE3M,KAAKgO,EAAAA,IAAQ0nJ,YAAY,IACzB11J,KAAKynE,EAAAA,IAAQiuF,YAAY,IACzB11J,KAAKhG,IAAAA,IAAU07J,YAAY,GAC3B11J,KAAK6vG,OAASozC,EAAOO,MAAM,IAC3BxjJ,KAAKk8O,KAAO,EACZl8O,KAAKs1a,SAAW,EAQlBtgZ,KAAKhgI,GACH6jG,EAAOoqJ,EAAO8H,SAAS/1P,IAAQA,EAAIiwE,QAAU,UAGvC+hN,EAAKuuP,EAAQvghB,EAAK,GAClB24Q,EAAK4nQ,EAAQvghB,EAAK,GAClB44Q,EAAK2nQ,EAAQvghB,EAAK,GAClBiyR,EAAKsuP,EAAQvghB,EAAK,GAClBkyR,EAAKquP,EAAQvghB,EAAK,GAClBmyR,EAAKouP,EAAQvghB,EAAK,IAClBoyR,EAAKmuP,EAAQvghB,EAAK,IAClBqyR,EAAKkuP,EAAQvghB,EAAK,IAExBgrG,KAAKgO,EAAE,GAAU,KAALg5K,EACZhnL,KAAKgO,EAAE,GAAiC,MAA1Bg5K,IAAO,GAAOrZ,GAAM,GAClC3tK,KAAKgO,EAAE,GAAiC,MAA1B2/J,IAAO,GAAOC,GAAM,GAClC5tK,KAAKgO,EAAE,GAAgC,MAAzB4/J,IAAO,EAAMqZ,GAAM,GACjCjnL,KAAKgO,EAAE,GAAiC,KAA1Bi5K,IAAO,EAAMC,GAAM,IACjClnL,KAAKgO,EAAE,GAAMk5K,IAAO,EAAK,KACzBlnL,KAAKgO,EAAE,GAAiC,MAA1Bk5K,IAAO,GAAOC,GAAM,GAClCnnL,KAAKgO,EAAE,GAAiC,MAA1Bm5K,IAAO,GAAOC,GAAM,GAClCpnL,KAAKgO,EAAE,GAAgC,MAAzBo5K,IAAO,EAAMC,GAAM,GACjCrnL,KAAKgO,EAAE,GAAMq5K,IAAO,EAAK,YAGhBlgN,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAKynE,EAAEtgG,GAAK,UAGLA,EAAI,EAAGA,EAAI,EAAGA,IACrB64B,KAAKhG,IAAI7yB,GAAKouc,EAAQvghB,EAAK,GAAM,EAAImyE,UAEvC64B,KAAKk8O,IAAM,EACXl8O,KAAKs1a,SAAW,EAETt1a,KAWTw1a,QAAQ9oX,EAAMisE,EAAOz5I,SACbu2b,EAAQz1a,KAAKk8O,IAAM,EAAK,KACxBt+M,EAAAA,IAAQ8wI,YAAY,SAEnB/1C,GAAS,IAAA,OAERquD,EAAKuuP,EAAQ7oX,EAAMxtE,EAAI,GACvByuL,EAAK4nQ,EAAQ7oX,EAAMxtE,EAAI,GACvB0uL,EAAK2nQ,EAAQ7oX,EAAMxtE,EAAI,GACvB+nM,EAAKsuP,EAAQ7oX,EAAMxtE,EAAI,GACvBgoM,EAAKquP,EAAQ7oX,EAAMxtE,EAAI,GACvBioM,EAAKouP,EAAQ7oX,EAAMxtE,EAAI,IACvBkoM,EAAKmuP,EAAQ7oX,EAAMxtE,EAAI,IACvBmoM,EAAKkuP,EAAQ7oX,EAAMxtE,EAAI,IAE7B8gB,KAAKynE,EAAE,IAAW,KAALu/G,EACbhnL,KAAKynE,EAAE,IAAkC,MAA1Bu/G,IAAO,GAAOrZ,GAAM,GACnC3tK,KAAKynE,EAAE,IAAkC,MAA1BkmG,IAAO,GAAOC,GAAM,GACnC5tK,KAAKynE,EAAE,IAAiC,MAAzBmmG,IAAO,EAAMqZ,GAAM,GAClCjnL,KAAKynE,EAAE,IAAkC,MAA1Bw/G,IAAO,EAAMC,GAAM,IAClClnL,KAAKynE,EAAE,IAAQy/G,IAAO,EAAM,KAC5BlnL,KAAKynE,EAAE,IAAkC,MAA1By/G,IAAO,GAAOC,GAAM,GACnCnnL,KAAKynE,EAAE,IAAkC,MAA1B0/G,IAAO,GAAOC,GAAM,GACnCpnL,KAAKynE,EAAE,IAAiC,MAAzB2/G,IAAO,EAAMC,GAAM,GAClCrnL,KAAKynE,EAAE,IAAQ4/G,IAAO,EAAMouP,MAGxBhpc,EAAI,UAECtF,EAAI,EAAGA,EAAI,GAAIA,IAAAA,CACtBy2D,EAAEz2D,GAAKsF,UAEE6kB,EAAI,EAAGA,EAAI,GAAIA,IAAAA,KAClBzqB,EAAIm5B,KAAKynE,EAAEn2E,GAGbzqB,GADEyqB,GAAKnqB,EACF64B,KAAKgO,EAAE7mC,EAAImqB,GAEX,EAAI0O,KAAKgO,EAAE7mC,EAAI,GAAKmqB,GAE3BssC,EAAEz2D,IAAMN,EAKE,IAANyqB,IACF7kB,EAAImxD,EAAEz2D,KAAO,GACby2D,EAAEz2D,IAAM,MAIZsF,GAAKmxD,EAAEz2D,KAAO,GACdy2D,EAAEz2D,IAAM,KAGVsF,GAAKA,GAAK,GAAKA,EACfA,GAAKmxD,EAAE,GACPA,EAAE,GAAU,KAAJnxD,EACRA,KAAU,GACVmxD,EAAE,IAAMnxD,UAECtF,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAKynE,EAAEtgG,GAAKy2D,EAAEz2D,GAEhB+X,GAAK,GACLy5I,GAAS,IAUbhjE,OAAOjJ,MACL7zD,EAAOoqJ,EAAO8H,SAASr+F,KAEL,IAAd1sD,KAAKk8O,IAAS,MAAA,IACNpjP,MAAM,mCAEd6/H,EAAQjsE,EAAKznF,OACbia,EAAI,KAGJ8gB,KAAKs1a,SAAAA,KACHrC,EAAO,GAAKjza,KAAKs1a,SAEjBrC,EAAOt6S,IACTs6S,EAAOt6S,WAEAxxJ,EAAI,EAAGA,EAAI8rc,EAAM9rc,IACxB64B,KAAK6vG,OAAO7vG,KAAKs1a,SAAWnuc,GAAKulF,EAAKxtE,EAAI/X,MAE5CwxJ,GAASs6S,EACT/zb,GAAK+zb,EAELjza,KAAKs1a,UAAYrC,EAEbjza,KAAKs1a,SAAW,GAAA,OACXt1a,KAETA,KAAKw1a,QAAQx1a,KAAK6vG,OAAQ,GAAI,GAC9B7vG,KAAKs1a,SAAW,KAId38S,GAAS,GAAA,OACLs6S,GAAOt6S,GAAAA,EAEb34H,KAAKw1a,QAAQ9oX,EAAMumX,EAAM/zb,GAEzBA,GAAK+zb,EACLt6S,GAASs6S,KAIPt6S,EAAAA,SACOxxJ,EAAI,EAAGA,EAAIwxJ,EAAOxxJ,IACzB64B,KAAK6vG,OAAO7vG,KAAKs1a,SAAWnuc,GAAKulF,EAAKxtE,EAAI/X,GAC5C64B,KAAKs1a,UAAY38S,SAGZ34H,KAQT4wO,YACoB,IAAd5wO,KAAKk8O,IAAS,MAAA,IACNpjP,MAAM,qCAEZ+5a,EAAM5vR,EAAOO,MAAM,IACnBp/B,EAAAA,IAAQsxC,YAAY,OAGtB11J,KAAKs1a,SAAAA,KACHnuc,EAAI64B,KAAKs1a,aAEbt1a,KAAK6vG,OAAO1oI,KAAO,EAEZA,EAAI,GAAIA,IACb64B,KAAK6vG,OAAO1oI,GAAK,EAEnB64B,KAAKk8O,IAAM,EACXl8O,KAAKw1a,QAAQx1a,KAAK6vG,OAAQ,GAAI,OAI5BpjI,EAAIuzB,KAAKynE,EAAE,KAAO,GAEtBznE,KAAKynE,EAAE,IAAM,aAEJtgG,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAKynE,EAAEtgG,IAAMsF,EACbA,EAAIuzB,KAAKynE,EAAEtgG,KAAO,GAClB64B,KAAKynE,EAAEtgG,IAAM,KAGf64B,KAAKynE,EAAE,IAAU,EAAJh7F,EACbA,EAAIuzB,KAAKynE,EAAE,KAAO,GAClBznE,KAAKynE,EAAE,IAAM,KACbznE,KAAKynE,EAAE,IAAMh7F,EACbA,EAAIuzB,KAAKynE,EAAE,KAAO,GAClBznE,KAAKynE,EAAE,IAAM,KACbznE,KAAKynE,EAAE,IAAMh7F,EAGb23I,EAAE,GAAKpkH,KAAKynE,EAAE,GAAK,EACnBh7F,EAAI23I,EAAE,KAAO,GACbA,EAAE,IAAM,aAECj9I,EAAI,EAAGA,EAAI,GAAIA,IACtBi9I,EAAEj9I,GAAK64B,KAAKynE,EAAEtgG,GAAKsF,EACnBA,EAAI23I,EAAEj9I,KAAO,GACbi9I,EAAEj9I,IAAM,SAIN63J,GAAY,EAAJvyJ,GAAS,UAEZtF,EAAI,EAAGA,EAAI,GAAIA,IACtBi9I,EAAEj9I,IAAM63J,EAEVA,GAAQA,UAEC73J,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAKynE,EAAEtgG,GAAM64B,KAAKynE,EAAEtgG,GAAK63J,EAAQ5a,EAAEj9I,GAGrC64B,KAAKynE,EAAE,GAAyC,OAAlCznE,KAAKynE,EAAE,GAAOznE,KAAKynE,EAAE,IAAM,IACzCznE,KAAKynE,EAAE,GAA+C,OAAxCznE,KAAKynE,EAAE,KAAO,EAAMznE,KAAKynE,EAAE,IAAM,IAC/CznE,KAAKynE,EAAE,GAA8C,OAAvCznE,KAAKynE,EAAE,KAAO,EAAMznE,KAAKynE,EAAE,IAAM,GAC/CznE,KAAKynE,EAAE,GAA8C,OAAvCznE,KAAKynE,EAAE,KAAO,EAAMznE,KAAKynE,EAAE,IAAM,GAC/CznE,KAAKynE,EAAE,GACqC,OAD9BznE,KAAKynE,EAAE,KAAO,GACvBznE,KAAKynE,EAAE,IAAM,EAAMznE,KAAKynE,EAAE,IAAM,IACrCznE,KAAKynE,EAAE,GAA+C,OAAxCznE,KAAKynE,EAAE,KAAO,EAAMznE,KAAKynE,EAAE,IAAM,IAC/CznE,KAAKynE,EAAE,GAA8C,OAAvCznE,KAAKynE,EAAE,KAAO,EAAMznE,KAAKynE,EAAE,IAAM,GAC/CznE,KAAKynE,EAAE,GAA8C,OAAvCznE,KAAKynE,EAAE,KAAO,EAAMznE,KAAKynE,EAAE,IAAM,OAG3C/lB,EAAI1hD,KAAKynE,EAAE,GAAKznE,KAAKhG,IAAI,GAE7BgG,KAAKynE,EAAE,GAAK/lB,UAEHv6E,EAAI,EAAGA,EAAI,EAAGA,IACrBu6E,EAAI1hD,KAAKynE,EAAEtgG,GAAK64B,KAAKhG,IAAI7yB,IAAMu6E,IAAM,IACrC1hD,KAAKynE,EAAEtgG,GAAKu6E,UAGLv6E,EAAI,EAAGA,EAAI,EAAGA,IACrBuuc,EAAS7C,EAAK7ya,KAAKynE,EAAEtgG,GAAQ,EAAJA,UAG3B64B,KAAKstG,UAEEulU,EAOTvlU,kBACWnmI,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAKgO,EAAE7mC,GAAK,EACZ64B,KAAKynE,EAAEtgG,GAAK,UAGLA,EAAI,EAAGA,EAAI,EAAGA,IACrB64B,KAAKhG,IAAI7yB,GAAK,UAEPA,EAAI,EAAGA,EAAI,GAAIA,IACtB64B,KAAK6vG,OAAO1oI,GAAK,EAEnB64B,KAAKk8O,KAAO,EACZl8O,KAAKs1a,SAAW,EASlB3/P,OAAOnxM,GACLq0B,EAAOoqJ,EAAO8H,SAASvmL,IACvBq0B,EAAsB,KAAfr0B,EAAIS,cAEL4tc,EAAM7ya,KAAK4wO,YAEbrrH,EAAI,UAECp+I,EAAI,EAAGA,EAAI,GAAIA,IACtBo+I,GAAKstT,EAAI1rc,GAAK3C,EAAI2C,UAEXo+I,EAAI,IAAO,IAAQ,GAchC,SAAAgwT,EAAiB7oX,EAAM6oE,UACd7oE,EAAK6oE,KAAqB,IAAZ7oE,EAAK6oE,GAG5B,SAAAmgT,EAAkB3wR,EAAKrzI,EAAK6jH,UAC1BwvB,EAAIxvB,KAAS7jH,EACbqzI,EAAIxvB,KAAS7jH,IAAQ,EACd6jH,EAbTk/S,EAASxnB,OAAS,EAoBlB55f,EAAOC,QAAUmhhB,sVCzXjB,MAAAkB,EAAAz/E,EAAA3ic,EAAA,UACAq9b,EAAAr9b,EAAA,eAMA,IAAIqihB,EAFStihB,EAAAg5f,OAASqpB,EAAAxihB,QAAM,gBAI1ByihB,EADEhlF,EAAAilF,kBACUvihB,EAAAg5f,OAEA,OAGdh5f,EAAAy6gB,mBAAA,SAAoC7xb,GAClC05b,EAAU,2BAA2B15b,EAAEw2L,UAAUt0K,SAAS,UAC1Dw3a,EAAU,4BAA4B15b,EAAEs2L,WAAWp0K,SAAS,WAG9D9qG,EAAA86gB,sBAAA,SAAuCr6gB,GACjCA,GACF6hhB,EAAU,8BAA8B7hhB,EAAE2+Q,UAAUt0K,SAAS,UAC7Dw3a,EAAU,+BAA+B7hhB,EAAEy+Q,WAAWp0K,SAAS,WAE/Dw3a,EAAU,kCAIdtihB,EAAAo7gB,mBAAA,SAAoCl5L,GAClCogM,EAAU,4BAA4BpgM,EAAGp3O,SAAS,WAGpD9qG,EAAAk7gB,sBAAA,SAAuCh/T,GACrComU,EAAU,+BAA+BpmU,EAAGpxG,SAAS,WAGvD9qG,EAAA47gB,eAAA,SAAgCrB,GAC1BA,EAAQyB,KAAOzB,EAAQ0B,KACzBqG,EAAU,kBAAkB/H,EAAQyB,IAAIr7gB,KAAK45gB,EAAQyB,IAAIj7gB,EAAE+pG,SAAS,UACpEw3a,EAAU,kBAAkB/H,EAAQ0B,IAAIt7gB,KAAK45gB,EAAQ0B,IAAIl7gB,EAAE+pG,SAAS,WAEpEw3a,EAAU,0PCzCDtihB,EAAA63f,2BAA6B,MAC7B73f,EAAAwihB,uCAAyCxihB,EAA0B63f,2BAAG,GAEtE73f,EAAAuihB,uBAAAnghB,mMCHb,MAAAm0f,EAAAt2f,EAAA,UAKaD,EAAA23f,eAAiB,CAACv3f,EAAe03K,EAAgBrmG,MAC5DqmG,EAASA,GAAUy+U,EAAA5mQ,OAAOiE,YAAY,IAC/ButE,cAAc/gU,EAAOqxE,GACrBqmG,GAET93K,EAAA23f,eAAetyR,MAAQ,EAEVrlO,EAAA43f,eAAkBx+V,IAC7B,GAAIA,EAAKznF,OAAS,EAAG,MAAMs6J,WAAW,4BACtC,OAAO7yE,EAAKujK,aAAa,IAE3B38T,EAAA43f,eAAevyR,MAAQ,EAIvBrlO,EAAA66gB,QAAA,SAAyBx0b,GACvB,OAAOkwa,EAAA5mQ,OAAOpxJ,OAAO,CAAClY,EAAQu3C,GAAIv3C,EAAQkmM,cAG5CvsR,EAAAy7gB,QAAA,SAAyBp1b,GACvB,OAAOkwa,EAAA5mQ,OAAOpxJ,OAAO,CAAClY,EAAQu3C,GAAIv3C,EAAQjT,GAAIiT,EAAQkmM,cAGxDvsR,EAAA07gB,QAAA,SAAyBr1b,GACvB,OAAOkwa,EAAA5mQ,OAAOpxJ,OAAO,CAAClY,EAAQjT,GAAIiT,EAAQkmM,cAG5CvsR,EAAAg7gB,QAAA,SAAyBt/a,GACvB,GAAIA,EAAM/pB,OAAS,GACjB,MAAM,IAAI6zB,MAAM,mEAGlB,MAAO,CACLo4B,GAAIliC,EAAM5pB,MAAM,EAAG,IACnBy6M,WAAY7wL,EAAM5pB,MAAM,GAAI4pB,EAAM/pB,QAClCyB,GAAImjb,EAAA5mQ,OAAOO,MAAM,KAIrBlwP,EAAAm7gB,QAAA,SAAyBz/a,GACvB,GAAIA,EAAM/pB,OAAS,GACjB,MAAM,IAAI6zB,MAAM,mEAGlB,MAAO,CACLo4B,GAAIliC,EAAM5pB,MAAM,EAAG,IACnBsB,GAAIsoB,EAAM5pB,MAAM,GAAI,IACpBy6M,WAAY7wL,EAAM5pB,MAAM,GAAI4pB,EAAM/pB,UAItC3xE,EAAA27gB,QAAA,SAAyBjgb,GACvB,GAAIA,EAAM/pB,OAAS,GACjB,MAAM,IAAI6zB,MAAM,mEAGlB,MAAO,CACLo4B,GAAI24X,EAAA5mQ,OAAOO,MAAM,GACjB98K,GAAIsoB,EAAM5pB,MAAM,EAAG,IACnBy6M,WAAY7wL,EAAM5pB,MAAM,GAAI4pB,EAAM/pB,uIC/DtC,MAAA8wc,EAAAxihB,EAAA,mBAKAs2f,EAAAt2f,EAAA,UACA+2f,EAAA/2f,EAAA,aACAgsb,EAAAhsb,EAAA,WACAyihB,EAAAzihB,EAAA,YACAk3f,EAAAl3f,EAAA,YAUAD,EAAAu4f,YAAA,MAYEh1f,YACEw0f,EACAzxS,EACAgxS,EACA+iB,EACA1jF,EACAgsF,EACA/rF,EACA0rB,GAEA51W,KAAKqrZ,YAAcA,EACnBrrZ,KAAK45G,QAAUiwS,EAAA5mQ,OAAOx5F,KAAKmwD,GAC3B55G,KAAK4qZ,SAAWA,EAChB5qZ,KAAK2ta,cAAgBA,EACrB3ta,KAAKiqV,WAAaA,EACdC,IACFlqV,KAAKkqV,WAAaA,GAEpBlqV,KAAKqmP,GAAKuvH,MAAAA,EAAAA,EAAa,IAAImgE,EAAAG,GAC3Bl2a,KAAK6ta,QAAU7ta,KAAKqmP,GAAGynL,YAAY9ta,KAAKqrZ,YAAarrZ,KAAK4qZ,SAAU5qZ,KAAK2ta,cAAesI,GACxFj2a,KAAKurZ,gBAAkB1B,EAAA5mQ,OAAOO,MAAM,GAG/B3sP,eAGL,GAFA4zf,EAAAsjB,mBAAmB/ta,KAAK6ta,QAAQG,GAAG9xb,GACnCuua,EAAAikB,mBAAmB1ua,KAAK6ta,QAAQG,GAAGx4L,IAC/Bx1O,KAAKqrZ,YAAa,CACpBZ,EAAA6B,OAAO,6CACP,MAAM2hB,EAAgBjua,KAAKqmP,GAAG6nL,YAAYlua,KAAK6ta,QAAS7ta,KAAK45G,SAC7D55G,KAAKiqV,WAAWqjF,QAAQhjB,EAAAykB,QAAQd,IAChCxjB,EAAA6B,OAAO,wCACP7B,EAAA2jB,sBAAsBpua,KAAK6ta,QAAQG,GAAGj6gB,OACjC,CACL02f,EAAA6B,OAAO,+CACP,MAAM6pB,QAAoBn2a,KAAKiqV,WAAWmjF,SAC1C,IACE,MAAMiB,EAAwB/jB,EAAAmkB,QAAQ0H,EAAY/wc,UAC5C06M,UAAEA,EAAS1yI,MAAEA,GAAUptC,KAAKqmP,GAAGkoL,YAAYvua,KAAK6ta,QAASQ,GAC/D,IAAKjhY,EACH,MAAM,IAAIt0C,MAAM,mDAElB2xZ,EAAA6B,OAAO,gEACP,MAAMqiB,QAAuBpvF,EAAAkgE,cAAc3/N,GAC3C9/K,KAAKkqV,WAAalqV,KAAKkqV,kBAAoB3K,EAAAqvF,qBAAqBD,SAC1DpvF,EAAAsvF,oBAAoB7ua,KAAK6ta,QAAQG,GAAGx4L,GAAIm5L,EAAgB3ua,KAAKkqV,YACnElqV,KAAK8ua,mBAAmBH,EAAejiX,MACvC+9V,EAAA6B,OAAO,yDACP7B,EAAA+jB,sBAAsBxua,KAAK6ta,QAAQG,GAAGx+T,IACtC,MAAOz7M,GACP,MAAM0lG,EAAM1lG,EAGZ,MAFA02f,EAAA6B,OAAO,uDAED,IAAI0pB,EAAAI,cAAcD,EAAa,8DAA8D18a,EAAI9f,aAKtG9iF,eACL,GAAImpG,KAAKqrZ,YAAa,CACpBZ,EAAA6B,OAAO,+CACP,MAAM6pB,SAAqBn2a,KAAKiqV,WAAWmjF,UAAUhoc,QAC/Cipc,EAAwB/jB,EAAAgkB,QAAQzkB,EAAA5mQ,OAAOx5F,KAAK0sX,KAC5Cr2P,UAAEA,EAAS1yI,MAAEA,GAAUptC,KAAKqmP,GAAGkoL,YAAYvua,KAAK6ta,QAASQ,GAC/D5jB,EAAA6B,OAAO,gEACP,IACE,IAAKl/W,EACH,MAAM,IAAIt0C,MAAM,yCAElB,MAAM61a,QAAuBpvF,EAAAkgE,cAAc3/N,GAC3C9/K,KAAKkqV,WAAalqV,KAAKkqV,kBAAoB3K,EAAAqvF,qBAAqBD,SAC1DpvF,EAAAsvF,oBAAoBR,EAAsB3nc,GAAGtB,MAAM,EAAG,IAAKupc,EAAgB3ua,KAAKkqV,YACtFlqV,KAAK8ua,mBAAmBH,EAAejiX,MACvC+9V,EAAA6B,OAAO,yDACP7B,EAAA+jB,sBAAsBxua,KAAK6ta,QAAQG,GAAGx+T,IACtC,MAAOz7M,GACP,MAAM0lG,EAAM1lG,EAEZ,MADA02f,EAAA6B,OAAO,uDACD,IAAI0pB,EAAAI,cAAcD,EAAa,8DAA8D18a,EAAI9f,gBAEpG,CACL8wa,EAAA6B,OAAO,6CACP,MAAM2hB,EAAgBjua,KAAKqmP,GAAG6nL,YAAYlua,KAAK6ta,QAAS7ta,KAAK45G,SAC7D55G,KAAKiqV,WAAWqjF,QAAQhjB,EAAA6jB,QAAQF,IAChCxjB,EAAA6B,OAAO,0CACP7B,EAAA2jB,sBAAsBpua,KAAK6ta,QAAQG,GAAGj6gB,GAExC02f,EAAAykB,eAAelva,KAAK6ta,SAGfh3gB,QAASgpR,EAAmBguP,GACjC,MAAM/xP,EAAK97K,KAAKmva,MAAMtB,GAAS,GAC/B,OAAO7ta,KAAKqmP,GAAGgpL,cAAcvzP,EAAI+tO,EAAA5mQ,OAAOO,MAAM,GAAIq8B,GAG7ChpR,QAASipR,EAAmB+tP,GACjC,MAAM/xP,EAAK97K,KAAKmva,MAAMtB,GACtB,OAAO7ta,KAAKqmP,GAAG+oL,cAActzP,EAAI+tO,EAAA5mQ,OAAOO,MAAM,GAAIs8B,GAG7CjpR,wBACL,IAAKmpG,KAAK6ta,QAAQG,GAAGj6gB,EACnB,MAAM,IAAI+kG,MAAM,gCAGlB,OAAOkH,KAAK6ta,QAAQG,GAAGj6gB,EAGjB8C,MAAOg3gB,EAAuB37C,GAAa,GACjD,IAAK27C,EAAQyB,MAAQzB,EAAQ0B,IAC3B,MAAM,IAAIz2a,MAAM,kEAGlB,OAAIkH,KAAKqrZ,YACAn5B,EAAa27C,EAAQyB,IAAMzB,EAAQ0B,IAEnCr9C,EAAa27C,EAAQ0B,IAAM1B,EAAQyB,IAItCz4gB,mBAAoB61J,GACtBA,IACF1sD,KAAKurZ,gBAAkB1B,EAAA5mQ,OAAOx5F,KAAKiD,EAAKmjD,OAAQnjD,EAAKyxE,WAAYzxE,EAAKznF,qOCzJ5E,MAAA4kb,EAAAt2f,EAAA,UAGAgsb,EAAAhsb,EAAA,YACAi8gB,EAAAj8gB,EAAA,wBAGA,MAAa2ihB,UAAW1G,EAAAC,kBACf54gB,YAAay2e,EAAoBsd,EAAmB1ua,EAAYs5P,GACrE,MAAMk6L,EAAM1va,KAAKgwa,iBAEjB,IAAIhC,EAOJ,OALEA,EADE1gC,EACGttY,KAAKqwa,oBAAoBzlB,EAAU1ua,EAAGs5P,EAAIk6L,GAE1C1va,KAAKswa,oBAAoB1lB,EAAU1ua,EAAGs5P,EAAIk6L,GAG1C,CACL1B,GAAAA,EACA7mc,EAAGmma,EACHh2S,GAAI,GAIDzgM,YAAag3gB,EAAuBl0b,GACzC,IAAIs0b,EACJ,GAAmB,IAAfJ,EAAQv2U,GACV22U,EAAgBjua,KAAKwwa,cAAc3C,EAAQG,GAAIr0b,QAC1C,GAAmB,IAAfk0b,EAAQv2U,GAAU,CAC3B,MAAQ22U,cAAet5G,EAAEltP,EAAEA,EAAC6nW,IAAEA,EAAGC,IAAEA,GAAQvva,KAAKywa,cAAc5C,EAAQG,GAAIr0b,GAC1Es0b,EAAgBt5G,EAChBk5G,EAAQpmW,EAAIA,EACZomW,EAAQyB,IAAMA,EACdzB,EAAQ0B,IAAMA,MACT,CAAA,KAAI1B,EAAQv2U,GAAK,GAetB,MAAM,IAAIx+F,MAAM,oBAdhB,GAAI+0a,EAAQ1mc,EAAG,CACb,IAAK0mc,EAAQyB,IACX,MAAM,IAAIx2a,MAAM,qCAGlBm1a,EAAgBjua,KAAK4wa,oBAAoB/C,EAAQyB,IAAK31b,OACjD,CACL,IAAKk0b,EAAQ0B,IACX,MAAM,IAAIz2a,MAAM,qCAGlBm1a,EAAgBjua,KAAK4wa,oBAAoB/C,EAAQ0B,IAAK51b,IAO1D,OADAk0b,EAAQv2U,KACD22U,EAGFp3gB,YAAag3gB,EAAuBl0b,GACzC,IAAImmM,EAAY+pO,EAAA5mQ,OAAOO,MAAM,GAAQp2G,GAAQ,EAI7C,GAHmB,IAAfygY,EAAQv2U,MACPwoF,UAAAA,EAAW1yI,MAAAA,GAAUptC,KAAK6wa,aAAahD,EAAQG,GAAIr0b,IAErC,IAAfk0b,EAAQv2U,GAAU,CACpB,MAAQwoF,UAAWpF,EAAIttI,MAAO03B,EAAC2C,EAAEA,EAAC6nW,IAAEA,EAAGC,IAAEA,GAAQvva,KAAK8wa,aAAajD,EAAQG,GAAIr0b,GAC/EmmM,EAAYpF,EACZttI,EAAQ03B,EACR+oW,EAAQpmW,EAAIA,EACZomW,EAAQyB,IAAMA,EACdzB,EAAQ0B,IAAMA,EAGhB,OADA1B,EAAQv2U,KACD,CAAEwoF,UAAAA,EAAW1yI,MAAAA,GAGdv2I,cAAem3gB,EAAoBp0T,GACzCo0T,EAAGj6gB,EAAIwrb,EAAAwrE,kBACP,MAAM75X,EAAK88Y,EAAGj6gB,EAAE2+Q,UAChB1yK,KAAK4va,QAAQ5B,EAAGx9Q,GAAIt/H,GACpBlxB,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAGj6gB,EAAEy+Q,WAAYw7P,EAAGx4L,KAC/C,MAAMu6L,EAAMlmB,EAAA5mQ,OAAOx5F,KAAKukX,EAAG9xb,EAAEw2L,WACvBhsM,EAAKs5B,KAAK6va,eAAe7B,EAAGx9Q,GAAIu/Q,GAEtC/va,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAG9xb,EAAEs2L,WAAYw7P,EAAGx4L,KAG/C,MAAO,CAAEtkN,GAAAA,EAAIxqD,GAAAA,EAAIm5M,WAFE7/K,KAAK6va,eAAe7B,EAAGx9Q,GAAI52C,IAKxC/iN,cAAem3gB,EAAoBp0T,GACzCo0T,EAAGj6gB,EAAIwrb,EAAAwrE,kBACP,MAAM75X,EAAK88Y,EAAGj6gB,EAAE2+Q,UAChB1yK,KAAK4va,QAAQ5B,EAAGx9Q,GAAIt/H,GAEpBlxB,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAGj6gB,EAAEy+Q,WAAYw7P,EAAGx+T,KAC/CxvG,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAGj6gB,EAAEy+Q,WAAYw7P,EAAGx4L,KAC/C,MAAM31D,EAAa7/K,KAAK6va,eAAe7B,EAAGx9Q,GAAI52C,GAExCq0T,EAA+B,CAAE/8Y,GAAAA,EAAIxqD,GADhCs5B,KAAKgwa,iBAC+BnwP,WAAAA,IACzCyvP,IAAEA,EAAGC,IAAEA,GAAQvva,KAAKlgB,MAAMkub,EAAGx9Q,IAEnC,MAAO,CAAEy9Q,cAAAA,EAAeqB,IAAAA,EAAKC,IAAAA,EAAK9nW,EAAGumW,EAAGx9Q,GAAG/oF,GAGrC5wK,aAAcm3gB,EAAoBr0b,GACpC4lW,EAAA0wF,iBAAiBt2b,EAAQu3C,MAC3B88Y,EAAGx+T,GAAK71H,EAAQu3C,IAGlBlxB,KAAK4va,QAAQ5B,EAAGx9Q,GAAIw9Q,EAAGx+T,IACvBxvG,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAG9xb,EAAEs2L,WAAYw7P,EAAGx+T,KAC/C,MAAQswE,UAAWp5M,EAAI0mE,MAAO+iY,GAAWnwa,KAAKkwa,eAAelC,EAAGx9Q,GAAI72K,EAAQjT,IACxEypc,GAAwB,KAAdzpc,EAAGzB,QAAiBs6W,EAAA0wF,iBAAiBvpc,KACjDsnc,EAAGx4L,GAAK9uQ,GAEVs5B,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAG9xb,EAAEs2L,WAAYw7P,EAAGx4L,KAC/C,MAAM11D,UAAEA,EAAW1yI,MAAOgjY,GAAWpwa,KAAKkwa,eAAelC,EAAGx9Q,GAAI72K,EAAQkmM,YACxE,MAAO,CAAEC,UAAAA,EAAW1yI,MAAQ+iY,GAAUC,GAGhCv5gB,aAAcm3gB,EAAoBr0b,GAMxC,GALI4lW,EAAA0wF,iBAAiBt2b,EAAQu3C,MAC3B88Y,EAAGx+T,GAAK71H,EAAQu3C,IAGlBlxB,KAAK4va,QAAQ5B,EAAGx9Q,GAAIw9Q,EAAGx+T,KAClBw+T,EAAGj6gB,EACN,MAAM,IAAI+kG,MAAM,wDAElBkH,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAGj6gB,EAAEy+Q,WAAYw7P,EAAGx+T,KAC/CxvG,KAAK8va,OAAO9B,EAAGx9Q,GAAIxwJ,KAAKmuM,GAAG6/N,EAAG9xb,EAAEs2L,WAAYw7P,EAAGx+T,KAC/C,MAAMswE,UAAEA,EAAS1yI,MAAEA,GAAUptC,KAAKkwa,eAAelC,EAAGx9Q,GAAI72K,EAAQkmM,aAC1DyvP,IAAEA,EAAGC,IAAEA,GAAQvva,KAAKlgB,MAAMkub,EAAGx9Q,IAEnC,MAAO,CAAE/oF,EAAGumW,EAAGx9Q,GAAG/oF,EAAGr6B,MAAAA,EAAO0yI,UAAAA,EAAWwvP,IAAAA,EAAKC,IAAAA,GAGtC14gB,oBAAqB+zf,EAAmB1ua,EAAYs5P,EAAak6L,GACvE,MACMl/Q,EAAKxwJ,KAAK2va,oBADH,oCAEb3va,KAAK4va,QAAQp/Q,EAAIo6P,GACjB5qZ,KAAK4va,QAAQp/Q,EAAIglF,GAGjB,MAAO,CAAEhlF,GAAAA,EAAIt0K,EAAAA,EAAGs5P,GAAAA,EAAIhmI,GAFTq6S,EAAA5mQ,OAAOO,MAAM,IAEAksR,IAAAA,GAGlB74gB,oBAAqB+zf,EAAmB1ua,EAAYs5P,EAAak6L,GACvE,MACMl/Q,EAAKxwJ,KAAK2va,oBADH,oCAEb3va,KAAK4va,QAAQp/Q,EAAIo6P,GACjB5qZ,KAAK4va,QAAQp/Q,EAAIt0K,EAAEw2L,WAGnB,MAAO,CAAEliB,GAAAA,EAAIt0K,EAAAA,EAAGs5P,GAAAA,EAAIhmI,GAFTq6S,EAAA5mQ,OAAOO,MAAM,IAEAksR,IAAAA,IAlJ5Bp8gB,EAAA4ihB,GAAAA,qLCLA,MAAaE,UAAsBt9a,MAGjCjiG,YAAaq1f,EAAsCvya,GACjD4rC,MAAM5rC,GAENqmB,KAAKksZ,WAAaA,EAClBlsZ,KAAKntG,KAAO,qBAPhBS,EAAA8ihB,cAAAA,2HCFA,MAAAvsB,EAAAt2f,EAAA,UACA42f,EAAA52f,EAAA,kBAIAgsb,EAAAhsb,EAAA,WACAk3f,EAAAl3f,EAAA,YAEA+2f,EAAA/2f,EAAA,aAGA,MAAa44f,UAA4BhC,EAAAoC,YAIvC11f,YACEw0f,EACAzxS,EACAgxS,EACA+iB,EACA1jF,EACAiiE,EACAhiE,EACA6hE,EACAn2C,GAEArwV,MAAM8lY,EAAazxS,EAASgxS,EAAU+iB,EAAe1jF,EAAYC,EAAY0rB,GACzEm2C,IACF/rZ,KAAK+rZ,cAAgBA,GAEvB/rZ,KAAKksZ,WAAaA,EAKbr1f,gBACL,GAAImpG,KAAKqrZ,YACPrrZ,KAAKkqM,GAAGgkO,YAAYlua,KAAK6ta,QAAShkB,EAAA5mQ,OAAOO,MAAM,GAAIxjJ,KAAK+rZ,eACxDtB,EAAA6B,OAAO,uFACP7B,EAAA2jB,sBAAsBpua,KAAK6ta,QAAQG,GAAGj6gB,OACjC,CACL02f,EAAA6B,OAAO,iEACP,MAAM+hB,EAAwB/jB,EAAAgkB,QAAQtua,KAAKksZ,aACrC9+W,MAAEA,GAAUptC,KAAKkqM,GAAGqkO,YAAYvua,KAAK6ta,QAAS,CAClD38Y,GAAIm9Y,EAAsBn9Y,GAC1BxqD,GAAImjb,EAAA5mQ,OAAOO,MAAM,GACjBq8B,WAAYgqO,EAAA5mQ,OAAOO,MAAM,KAE3B,IAAKp2G,EACH,MAAM,IAAIt0C,MAAM,kDAElB2xZ,EAAA6B,OAAO,kEACP7B,EAAA+jB,sBAAsBxua,KAAK6ta,QAAQG,GAAGx+T,KAKnC34M,iBACL,GAAImpG,KAAKqrZ,YAAa,CACpB,MAAMgjB,EAAwB/jB,EAAAmkB,QAAQzua,KAAKksZ,aACrCpsO,UAAEA,EAAS1yI,MAAEA,GAAUptC,KAAKkqM,GAAGqkO,YAAYvua,KAAK6ta,QAASQ,GAC/D,IAAKjhY,EACH,MAAM,IAAIt0C,MAAM,kDAElB2xZ,EAAA6B,OAAO,kEACP7B,EAAA+jB,sBAAsBxua,KAAK6ta,QAAQG,GAAGx+T,IACtCi7S,EAAAikB,mBAAmB1ua,KAAK6ta,QAAQG,GAAGx4L,IAEnCi1K,EAAA6B,OAAO,kDACP,IACE,MAAMqiB,QAAuBpvF,EAAAkgE,cAAc3/N,GAC3C9/K,KAAKkqV,WAAalqV,KAAKkqV,kBAAoB3K,EAAAqvF,qBAAqBD,SAC1DpvF,EAAAsvF,oBAAoB7ua,KAAK6ta,QAAQG,GAAGx4L,GAAIm5L,EAAgB3ua,KAAKkqV,YACnElqV,KAAK8ua,mBAAmBH,EAAejiX,MACvC,MAAO34J,GAEP,MAAM,IAAI+kG,MAAM,iEADJ/kG,EACyE4lF,WAEvF8wa,EAAA6B,OAAO,qCAEP7B,EAAA6B,OAAO,+CACD/mY,MAAM8mY,WACZ5B,EAAA6B,OAAO,wCAvEbh5f,EAAA64f,oBAAAA,qOCXA,MAAAtC,EAAAt2f,EAAA,UAEAq9b,EAAAr9b,EAAA,eAOAD,EAAAs5f,cAAA,SAA+Bh3C,GAC7B,OAAOtiU,gBAAkBv+D,GACvB,UAAW,MAAM06B,KAAS16B,EAAQ,CAChC,MAAMshc,EAAcxsB,EAAA5mQ,OAAOx5F,KAAKh6C,EAAMogG,OAAQpgG,EAAM0uH,WAAY1uH,EAAMxqC,QAEtE,IAAK,IAAIkC,EAAI,EAAGA,EAAIkvc,EAAYpxc,OAAQkC,GAAKypX,EAAAklF,uCAAwC,CACnF,IAAI9wc,EAAMmC,EAAIypX,EAAAklF,uCACV9wc,EAAMqxc,EAAYpxc,SACpBD,EAAMqxc,EAAYpxc,QAGpB,MAAMynF,EAAOkpT,EAAUl0M,QAAQ20Q,EAAYjxc,MAAM+B,EAAGnC,GAAM4wY,EAAUi4D,eAC9DnhX,MAOdp5J,EAAAu5f,cAAA,SAA+Bj3C,GAC7B,OAAOtiU,gBAAkBv+D,GACvB,UAAW,MAAM06B,KAAS16B,EAAQ,CAChC,MAAMshc,EAAcxsB,EAAA5mQ,OAAOx5F,KAAKh6C,EAAMogG,OAAQpgG,EAAM0uH,WAAY1uH,EAAMxqC,QAEtE,IAAK,IAAIkC,EAAI,EAAGA,EAAIkvc,EAAYpxc,OAAQkC,GAAKypX,EAAAu6D,2BAA4B,CACvE,IAAInmb,EAAMmC,EAAIypX,EAAAu6D,2BACVnmb,EAAMqxc,EAAYpxc,SACpBD,EAAMqxc,EAAYpxc,QAGpB,MAAMwqC,EAAQ4ma,EAAYjxc,MAAM+B,EAAGnC,IAC3B86M,UAAW02E,EAASppN,MAAEA,SAAgBwoU,EAAUr0M,QAAQ9xJ,EAAOmmW,EAAUi4D,SACjF,IAAKzgY,EACH,MAAM,IAAIt0C,MAAM,4CAEZ09P,wJCnBd,MAAMk1J,EAAW,IAnBjB,MAAA70f,cACmBmpG,KAAA+5N,QAAU,IAAI/2O,IAExBnsF,MAAO6kO,EAAgB1mO,GAC5BgrG,KAAK+5N,QAAQt4O,IAAIi6I,EAAOz3I,GAAIjvF,GAGvB6B,KAAM6kO,SACX,OAAKA,GAG6B,QAA3B2mG,EAAAriO,KAAK+5N,QAAQv4O,IAAIk6I,EAAOz3I,WAAG,IAAAo+O,EAAAA,EAFzB,KAKJxrU,eACLmpG,KAAK+5N,QAAQ3sK,UAMf95J,EAAAo4f,SAAAA,gCC3BF,aAEA,MAAArmQ,aAAAA,GAAA9xP,EAAA,UACA0rP,EAAA1rP,EAAA,YAEA+ihB,EAAA/ihB,EAAA,kBACAsqU,gBAAAA,GAAAtqU,EAAA,uBACA4kO,EAAA5kO,EAAA,sBACA8kO,EAAA9kO,EAAA,yBAEAgjhB,EAAAhjhB,EAAA,aACAgtR,EAAAhtR,EAAA,WACAk5E,EAAAl5E,EAAA,eACAimU,EAAAjmU,EAAA,aACAijhB,EAAAjjhB,EAAA,sBACAkwc,EAAAlwc,EAAA,qBACAiwc,EAAAjwc,EAAA,kBACA4wW,EAAA5wW,EAAA,aACAkjhB,EAAAljhB,EAAA,eACAmjhB,EAAAnjhB,EAAA,iBACAojhB,EAAApjhB,EAAA,mBAEA+qY,EAAAg4I,EAAAh4I,OAikBAjrY,EAAAC,QAtiBA,cAAA+xP,EAsBAxuP,aAAA8kU,OACAA,EAAAinI,OACAA,EAAAlnO,OACAA,EAAAulL,UACAA,EAAAqoC,UACAA,EAAAstF,eACAA,EAAA,QAAAC,oBACAA,GAAA,EAAAtnJ,UACAA,EAAA,IAAA1xD,EAAAmgH,YACAA,EAAAvxW,EAAAmjM,EAAAmuK,WACAA,GAAA,EAAA95E,YACAA,EAAAx3R,EAAAqqc,MAAA93I,WACAA,EAAA,GAAAI,UACAA,EAAA,GAAAgoE,WACAA,EAAA,CACAzqI,SAAA,EACA0qI,iBAAA,EACA/hG,SAAA,IACAx6L,QAAA,IACAi0B,MAAA,KACAg4U,MACAA,EAAA,SAAAC,SACAA,EAAA,WAIA,GAFAzxZ,SAEAq9U,EACA,MAAA,IAAA9pW,MAAA,iDAQAkH,KAAA27N,OAAAA,EAOA37N,KAAA4iW,OAAAA,EAOA5iW,KAAA07H,OAAAA,EAOA17H,KAAAihT,UAAAA,EAOAjhT,KAAAspV,UAAAA,EAOAtpV,KAAAurG,SAAAqrU,GAAAC,EAAA,GAAApqc,EAAAwqc,cAOAj3a,KAAAg+U,YAAAA,EAEAh+U,KAAAk3a,YAAAn5F,EAOA/9U,KAAAikQ,YAAAA,EAQAjkQ,KAAAm3a,cAAAvxc,KAAAwhL,KAAApnJ,KAAAg+U,YAAA,GAOAh+U,KAAAo3a,aAAA,IAAAb,EAAAv2a,KAAA07H,OAAA17H,KAAAg+U,aAOAh+U,KAAAuvR,UAAAA,EAOAvvR,KAAAq3a,UAAA,IAAAZ,EAAAz2a,KAAAuvR,UAAAvvR,KAAA07H,QAEA17H,KAAAg/R,WAAA,CACAj7G,GAAAuyP,EAAA/iJ,UAAAyL,WAAAj7G,MACAi7G,GAGAh/R,KAAAo/R,UAAA,CACAr7G,GAAAuyP,EAAA73I,UAAAW,UAAAr7G,MACAq7G,GAGAp/R,KAAAk6N,QAAA,IAAAV,EAAAx5N,MAEAA,KAAAs3a,KAAA/2P,EAAA+rO,OAAAtsZ,KAAA07H,QAOA17H,KAAAonW,WAAA,IAAAsvE,EAAA12a,KAAAonW,GAOApnW,KAAAu3a,cAAA,IAAAZ,EAEA32a,KAAAguX,UAAA,EAGAhuX,KAAAw2a,gBAAAA,EAAAx2a,MACAA,KAAAyjW,eAAAA,EAAAzjW,MACAA,KAAAwjW,YAAAA,EAAAxjW,MAGAA,KAAA+2a,MAAAA,EACA/2a,KAAAg3a,SAAAA,EAMA5uK,gBACA,OAAApoQ,KAAAguX,SAQAn3d,cACAmpG,KAAAguX,UAAA,EACAhuX,KAAAq3a,UAAAric,QACAgrB,KAAAu3a,cAAAvic,cACAgrB,KAAAk6N,QAAAllP,QAGAgrB,KAAAonW,WAAApyX,QASAn+E,OAKA,OAJAmpG,KAAAguX,UAAA,EACAhuX,KAAAonW,WAAA7mU,OACAvgC,KAAAq3a,UAAA92Y,OACAvgC,KAAAu3a,cAAAh3Y,OACAvgC,KAAAk6N,QAAA35L,OAYA1pI,UAAA7B,EAAAtB,EAAAiB,EAAA,IACA,OAAAqrG,KAAAw2a,gBAAAnlT,IAAAr8N,EAAAtB,EAAAiB,GAYAkC,UAAA7B,EAAAL,EAAA,IACA,OAAAqrG,KAAAw2a,gBAAAh1b,IAAAxsF,EAAAL,GAWAkC,cAAA7B,EAAAwihB,EAAA7ihB,EAAA,IACA,OAAAqrG,KAAAw2a,gBAAApsH,QAAAp1Z,EAAAwihB,EAAA7ihB,GAQAkC,kBAAA7B,GACAgrG,KAAAs3a,KAAA,gBAAAj/S,EAAArjO,EAAA,aACA,MAAAkpY,EAAA39G,EAAAk3P,YAAAzihB,GAEA,UACAgrG,KAAAuvR,UAAA9rS,OAAAy6S,GACA,MAAAzkS,GACA,GAAA,kBAAAA,EAAApkG,KACA,OAEA,MAAAokG,GAQA5iG,gBAAA7B,EAAAtB,GACAssG,KAAAs3a,KAAA,cAAAj/S,EAAArjO,EAAA,aACA,MAAAkpY,EAAA39G,EAAAk3P,YAAAzihB,SAEAgrG,KAAAuvR,UAAAl+J,IAAA6sK,EAAAxqY,GAWAmD,cAAA7B,GACA,OAAAgrG,KAAAyjW,eAAA3jR,QAAA9qL,GAYA6B,oBAAA7B,EAAAL,EAAA,CAAAm2K,QAAA,IAAAo7R,gBAAA,IACA,UAAA,MAAA7Y,KAAArtV,KAAAyjW,eAAAwC,cAAAjxc,EAAAL,SACA04b,EAcAx2b,eAAAotF,EAAAtvF,EAAA,CAAAm2K,QAAA,MACA,OAAA9qE,KAAAwjW,YAAAmC,SAAA1hX,EAAAtvF,GAUAkC,sBAAA7B,EAAAL,EAAA,CAAA8iM,SAAA,UACAz3F,KAAAwjW,YAAAkC,gBAAA1wc,EAAAL,GAQAkC,aAAAijb,GACA,OAAA95U,KAAAwjW,YAAA95G,aAAAowF,GASAjjb,gBAAA6kO,EAAA2lL,GACArhT,KAAA64E,KAAA,OAAA,CACA50F,GAAAy3I,EACA2lL,WAAAA,IAYAxqZ,2BAAA44E,GACA,MAAAz6E,QAAAurR,EAAAm3P,cAAAjoc,EAAAz6E,KAGA,OAFAgrG,KAAAo3a,aAAAO,aAAA3ihB,EAAAgrG,KAAAg+U,aAEA5zW,KAAAlD,IACA,MAAA4yW,EAAA95U,KAAAihT,UAAAz/T,IAAAta,GAEA,MAAA,CACA+c,GAAA/c,EACAm6U,WAAAy4B,EAAAA,EAAAl9G,UAAAxyP,KAAA8zO,GAAAA,EAAAhwF,YAAA,OAYAr3N,0BAAA44E,EAAAisJ,GACA17H,KAAAs3a,KAAA,sBAGA,aAFAt3a,KAAA43a,qBAAAnoc,IAEA1B,QAAA8pc,GACA73a,KAAA83a,QAAAD,EAAA5zb,KAEA+b,KAAAs3a,KAAA/nc,MAAA,oCACA,IAGAsoc,EAAA5zb,GAAA8zb,QAAAr8S,KAaA7kO,2BAAA7B,GACAgrG,KAAAs3a,KAAA,wBAAAj/S,EAAArjO,QAAAA,GACA,MAAAkpY,EAAA39G,EAAAk3P,YAAAzihB,GAGA,IAAAgjhB,EACA,IACAA,QAAAh4a,KAAAuvR,UAAA/tS,IAAA08S,GACA,MAAAzkS,GACA,GAAA,kBAAAA,EAAApkG,KACA,OAEA,MAAAokG,EAIA,MAAAy1G,EAAAovL,EAAAjgC,YAAA25K,GAEA,IAAA9oU,EACA,MAAA+vC,EAAA,IAAAnmJ,MAAA,kBAAA,sBAIA,OAAA,MAAAo2G,EAAAyvL,cACAp+G,EAAAj7G,MAAA4pC,EAAAyvL,aAAAniS,UAAA/vB,EAAAwrc,sBAEAj4a,KAAAuvR,UAAA9rS,OAAAy6S,QACAl+R,KAAAg3a,SAAA9nU,IAKAA,EAQAr4M,WAAA6kO,SACA17H,KAAAo3a,aAAAp4b,IAAA08I,GAQA7kO,2BAAAq4M,GACAlvG,KAAAs3a,KAAA,6BAEAhB,EAAA/iJ,UAAAwL,aAAA/+R,KAAAg/R,WAAA9vL,GAQAr4M,QAAAmgP,GACA,OAAAA,GAAA7e,EAAAn4H,KAAA07H,OAAAz3I,GAAA+yJ,EAAA/yJ,IAUAptF,sBAAA7B,EAAAsge,EAAAlqT,GACA,MAAA37F,EAAA,IAAA00R,EAAAA,EAAA2iI,MAAAoxC,UAAAljhB,EAAA,GACAy6E,EAAAy/H,OAAAovL,EAAAjgC,YAAAi3H,GAEA,MAAA53I,QAAA19O,KAAAk6N,QAAAi+M,YAAA/sW,EAAA37F,GAEA,GAAAiuQ,EAAAxuI,SAAAipB,EAAAulH,EAAAxuI,OAAAx7M,MAAA4qY,EAAAjgC,YAAAi3H,GAAA5he,OACA,MAAAurP,EAAA,IAAAnmJ,MAAA,2BAAA,yBAaAjiG,uBAAAijb,EAAA9kb,GACA,MAAAy6E,QAAAuwB,KAAAo4a,gBAAAt+F,EAAA9kb,GAEAytY,EAAAhzT,EAAA4oc,YACAnpU,EAAAz/H,EAAAy/H,OAEA,GAAAA,EAAA,CAEA,UACAlvG,KAAAs4a,oBAAAppU,GACA,MAAAz1G,GACA,MAAA82R,EAAA,qCAEA,MADAvwR,KAAAs3a,KAAA/mJ,GACAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,sBAGA,MAAA,CAAArhL,OAAAA,EAAAuzL,MAAAA,GAGA,GAAAA,EAAAx9T,OAAA,EACA,MAAA,CAAAw9T,MAAAA,GAGA,MAAAxjJ,EAAA,IAAAnmJ,MAAA,aAAA,iBASAjiG,sBAAAijb,EAAA9kb,GACA,MAAAy6E,EAAA,IAAA00R,EAAAA,EAAA2iI,MAAAyxC,UAAAvjhB,EAAA,GACA,OAAAgrG,KAAAk6N,QAAAi+M,YAAAr+F,EAAArqW,GAUA54E,0BAAAq4M,SACAonU,EAAA/iJ,UAAAwL,aAAA/+R,KAAAg/R,WAAA9vL,KAKA77M,EAAAC,QAAA86N,WAAA,QAAA3hJ,EAAAwqc,2bCxlBA,aAGA,MAAAuB,EAAAjlhB,EAAA,YAEAgtR,EAAAhtR,EAAA,WAwIAF,EAAAC,QA1HA,MAKAuD,YAAAyoG,EAAA0+U,GACAh+U,KAAAV,KAAAA,EACAU,KAAAy4a,QAAAz4a,KAAAy4a,QAAA9/a,KAAAqH,MAEAA,KAAA04a,QAAA16F,GAMAnnb,cAAAmnb,GACA,MAAA26F,QAAAp4P,EAAAq4P,cAAA54a,KAAAV,MAEAU,KAAAq5T,GAAA,IAAAm/G,EAAA,CACAK,YAAAF,EACAG,wBAAA96F,EACA+6F,oBAAA,IAGA/4a,KAAAq5T,GAAArrV,GAAA,OAAAgyB,KAAAy4a,SAaA5hhB,QAAAmihB,EAAAC,GAEA,MAAAC,EAAAF,EAAA,GAEAE,GAEAl5a,KAAAq5T,GAAA37T,OAAAw7a,EAAAj1b,IAIA+b,KAAAq5T,GAAAr6U,IAAAi6b,GAQAh8a,WACA,OAAA+C,KAAAq5T,GAAA91U,QASA1sF,WAAAijb,GACA,MAAA9kb,QAAAurR,EAAAq4P,cAAA9+F,GACAq/F,EAAAn5a,KAAAo5a,YAAApkhB,GAEA,GAAAmkhB,GAAAr/F,EAAA9/M,OAAAm/S,GACA,OAAAA,EASAtihB,YAAA7B,GACA,MAAA+2E,EAAAi0B,KAAA23a,aAAA3ihB,EAAA,GACA,GAAA+2E,EAAA9G,OAAA,EACA,OAAA8G,EAAA,GAUAl1E,aAAA7B,EAAAuuF,GAIA,OAFAyc,KAAAq5T,GAAA8/G,QAAAnkhB,EAAAuuF,GAEAnZ,KAAAlD,GAAAA,EAAA4yW,OAQAjjb,UAAAijb,GACA,MAAA71V,QAAAs8L,EAAAq4P,cAAA9+F,GAEA95U,KAAAq5T,GAAAr6U,IAAA,CAAAiF,GAAAA,EAAA61V,KAAAA,IAQAjjb,aAAAijb,GACA,MAAA71V,QAAAs8L,EAAAq4P,cAAA9+F,GAEA95U,KAAAq5T,GAAA37T,OAAAzZ,uEC7GA,aAEA,MAAA8qL,EAAAx7Q,EAAA,gBACA8xP,aAAAA,GAAA9xP,EAAA,UAOA,SAAAi6c,EAAA6rE,EAAAC,GACA,GAAAD,IAAAC,EACA,OAAA,EAEA,GAAAD,EAAAp0c,SAAAq0c,EAAAr0c,OACA,OAAA,EAEA,IAAA,IAAAkC,EAAA,EAAAlC,EAAAo0c,EAAAp0c,OAAAkC,EAAAlC,IAAAkC,EACA,GAAAkyc,EAAAlyc,KAAAmyc,EAAAnyc,GACA,OAAA,EAGA,OAAA,EAOA,SAAAoyc,EAAA1mhB,EAAA8mG,GACA,KAAAA,aAAA8+H,YACA,MAAA,IAAA1zH,UAAAlyG,EAAA,wBAUA,MAAA2lhB,UAAAnzR,EA2BAxuP,YAAAlC,EAAA,IACA4wH,QAEAvlB,KAAA64a,YAAAlkhB,EAAAkkhB,aAAA9pQ,EAAA,IACA/uK,KAAA84a,wBAAAnkhB,EAAAmkhB,yBAAA,GACA94a,KAAA+4a,oBAAApkhB,EAAAokhB,qBAAA,EACA/4a,KAAAw5a,SAAA7khB,EAAA6khB,UAAAhB,EAAAgB,SAEAx5a,KAAAy5a,QAAA9khB,EAAA8khB,SAAAjB,EAAAiB,QACAz5a,KAAAspQ,SAAA91W,OAAAiqG,OAAA,GAAA9oG,EAAA20W,UAEAiwK,EAAA,oCAAAv5a,KAAA64a,aAEA74a,KAAAvf,KAvDA,CAAAi5b,SAAA,GAAAC,WAAA,EAAAzwb,KAAA,KAAAC,MAAA,MAoEAtyF,eAAA+ihB,EAAAjvQ,GACA,OAAAivQ,EAAAC,YAAAlvQ,EAAAkvQ,YAAAD,EAAAjvQ,EAYA9zQ,gBAAAijhB,EAAAC,GACA,IAAAP,EAAA,EACAryc,EAAA,EACA,MAAA8yB,EAAAr0B,KAAAq0B,IAAA6/a,EAAA70c,OAAA80c,EAAA90c,QACAU,EAAAC,KAAAD,IAAAm0c,EAAA70c,OAAA80c,EAAA90c,QACA,KAAAkC,EAAA8yB,IAAA9yB,EACAqyc,EAAA,IAAAA,GAAAM,EAAA3yc,GAAA4yc,EAAA5yc,IAEA,KAAAA,EAAAxB,IAAAwB,EAAAqyc,EAAA,IAAAA,EAAA,IACA,OAAAA,EAQA3ihB,IAAAmjhB,GACAT,EAAA,cAAAS,GAAA,IAAA/1b,IAEA,IAAAg2b,EAAA,EACAhzc,EAAA+4B,KAAAvf,KAEA,KAAA,OAAAxZ,EAAAyyc,UAIAzyc,EAAA+4B,KAAAk6a,eAAAjzc,EAAA+yc,EAAA/1b,GAAAg2b,KAIA,MAAA10c,EAAAy6B,KAAAm6a,SAAAlzc,EAAA+yc,EAAA/1b,IACA,OAAA1e,GAAA,GACAy6B,KAAAytK,QAAAxmM,EAAA1B,EAAAy0c,GACAh6a,MAGA/4B,EAAAyyc,SAAAz0c,OAAA+6B,KAAA84a,yBACA7xc,EAAAyyc,SAAA5uc,KAAAkvc,GACAh6a,KAAA64E,KAAA,QAAAmhW,GACAh6a,MAIA/4B,EAAA0yc,WAMA35a,KAAA64E,KAAA,OAAA5xG,EAAAyyc,SAAAt0c,MAAA,EAAA46B,KAAA+4a,qBAAAiB,GACAh6a,OAGAA,KAAA6yZ,OAAA5rb,EAAAgzc,GACAj6a,KAAAhhB,IAAAg7b,IAYAnjhB,QAAAotF,EAAAhwF,EAAAo4G,EAAAA,GAGA,GAFAkta,EAAA,KAAAt1b,IAEA9d,OAAAs/K,UAAAxxP,IAAAA,IAAAo4G,EAAAA,GAAAp4G,GAAA,EACA,MAAA,IAAA8wG,UAAA,4BAGA,IAAA20a,EAAA,GAEA,IAAA,IAAA19b,EAAA,CAAAgkB,KAAAvf,MAAAw5b,EAAA,EAAAj+b,EAAA/W,OAAA,GAAAy0c,EAAAz0c,OAAAhxE,GAAA,CACA,MAAAgzE,EAAA+U,EAAAiC,MACA,GAAA,OAAAhX,EAAAyyc,SAAA,CACA,MAAAU,EAAAp6a,KAAAk6a,eAAAjzc,EAAAgd,EAAAg2b,KACAj+b,EAAAlR,KAAA7D,EAAAiiB,OAAAkxb,EAAAnzc,EAAAkiB,MAAAliB,EAAAiiB,MACAlN,EAAAlR,KAAAsvc,QAEAV,EAAAA,EAAA7nb,OAAA5qB,EAAAyyc,UAIA,OAAAA,EACAtvc,KAAAvD,GAAA,CAAAm5B,KAAAw5a,SAAA3yc,EAAAod,GAAAA,GAAApd,KACAulB,MAAA,CAAAvlB,EAAAyS,IAAAzS,EAAA,GAAAyS,EAAA,KACAlU,MAAA,EAAAnxE,GACAm2E,KAAAvD,GAAAA,EAAA,KAQAhwE,QAEA,IAAA0sF,EAAA,EACA,IAAA,MAAAvH,EAAA,CAAAgkB,KAAAvf,MAAAzE,EAAA/W,OAAA,GAAA,CACA,MAAAgC,EAAA+U,EAAAiC,MACA,OAAAhX,EAAAyyc,SAAA19b,EAAAlR,KAAA7D,EAAAkiB,MAAAliB,EAAAiiB,MACA3F,GAAAtc,EAAAyyc,SAAAz0c,OAEA,OAAAse,EAaA1sF,eAAAowE,EAAAgd,EAAAg2b,GAWA,MAAAI,EAAAJ,GAAA,EACAK,EAAAL,EAAA,EACA,GAAAh2b,EAAAhf,QAAAo1c,GAAA,IAAAC,EACA,OAAArzc,EAAAiiB,KAYA,OATAjF,EAAAo2b,GASA,GAAA,EAAAC,EACArzc,EAAAkiB,MAGAliB,EAAAiiB,KAYAryF,IAAAotF,GACAs1b,EAAA,KAAAt1b,GAEA,IAAAg2b,EAAA,EAEAhzc,EAAA+4B,KAAAvf,KACA,KAAA,OAAAxZ,EAAAyyc,UACAzyc,EAAA+4B,KAAAk6a,eAAAjzc,EAAAgd,EAAAg2b,KAIA,MAAA10c,EAAAy6B,KAAAm6a,SAAAlzc,EAAAgd,GACA,OAAA1e,GAAA,EAAA0B,EAAAyyc,SAAAn0c,GAAA,KAYA1uE,SAAAowE,EAAAgd,GACA,IAAA,IAAA9c,EAAA,EAAAA,EAAAF,EAAAyyc,SAAAz0c,SAAAkC,EACA,GAAAqmY,EAAAvmY,EAAAyyc,SAAAvyc,GAAA8c,GAAAA,GAAA,OAAA9c,EAGA,OAAA,EASAtwE,OAAAotF,GACAs1b,EAAA,wBAAAt1b,GAEA,IAAAg2b,EAAA,EACAhzc,EAAA+4B,KAAAvf,KAEA,KAAA,OAAAxZ,EAAAyyc,UACAzyc,EAAA+4B,KAAAk6a,eAAAjzc,EAAAgd,EAAAg2b,KAGA,MAAA10c,EAAAy6B,KAAAm6a,SAAAlzc,EAAAgd,GACA,GAAA1e,GAAA,EAAA,CACA,MAAAy0c,EAAA/yc,EAAAyyc,SAAAjvc,OAAAlF,EAAA,GAAA,GACAy6B,KAAA64E,KAAA,UAAAmhW,GAGA,OAAAh6a,KAYAnpG,OAAAowE,EAAAgzc,GACAhzc,EAAAiiB,KAtTA,CAAAwwb,SAAA,GAAAC,WAAA,EAAAzwb,KAAA,KAAAC,MAAA,MAuTAliB,EAAAkiB,MAvTA,CAAAuwb,SAAA,GAAAC,WAAA,EAAAzwb,KAAA,KAAAC,MAAA,MA0TA,IAAA,MAAA6wb,KAAA/yc,EAAAyyc,SACA15a,KAAAk6a,eAAAjzc,EAAA+yc,EAAA/1b,GAAAg2b,GAAAP,SAAA5uc,KAAAkvc,GAGA/yc,EAAAyyc,SAAA,KAKA,MAAAU,EAAAp6a,KAAAk6a,eAAAjzc,EAAA+4B,KAAA64a,YAAAoB,IACAhzc,EAAAiiB,OAAAkxb,EAAAnzc,EAAAkiB,MAAAliB,EAAAiiB,MACAywb,WAAA,EAUA9ihB,UACA,IAAA+zE,EAAA,GACA,IAAA,MAAAoR,EAAA,CAAAgkB,KAAAvf,MAAAzE,EAAA/W,OAAA,GAAA,CACA,MAAAgC,EAAA+U,EAAAiC,MACA,OAAAhX,EAAAyyc,SAAA19b,EAAAlR,KAAA7D,EAAAkiB,MAAAliB,EAAAiiB,MACAte,EAAAA,EAAAinB,OAAA5qB,EAAAyyc,UAEA,OAAA9uc,EAUA/zE,cACA,IAAA,MAAAmlF,EAAA,CAAAgkB,KAAAvf,MAAAzE,EAAA/W,OAAA,GAAA,CACA,MAAAgC,EAAA+U,EAAAiC,MACA,OAAAhX,EAAAyyc,SACA19b,EAAAlR,KAAA7D,EAAAkiB,MAAAliB,EAAAiiB,YAEAjiB,EAAAyyc,UAqBA7ihB,QAAAowE,EAAA1B,EAAAy0c,GAEA,IAAAxsE,EAAAvmY,EAAAyyc,SAAAn0c,GAAA0e,GAAA+1b,EAAA/1b,IACA,MAAA,IAAA6U,MAAA,2BAGA,MAAA8gb,EAAA3yc,EAAAyyc,SAAAn0c,GACAk5T,EAAAz+R,KAAAy5a,QAAAG,EAAAI,GAGAv7I,IAAAm7I,GAAAA,IAAAI,IAEA/yc,EAAAyyc,SAAAjvc,OAAAlF,EAAA,GACA0B,EAAAyyc,SAAA5uc,KAAA2zT,GACAz+R,KAAA64E,KAAA,UAAA+gW,EAAAn7I,KAIAprY,EAAAC,QAAAklhB,kECncA,aAEA,MAAAv0M,EAAA1wU,EAAA,SACA86N,EAAA96N,EAAA,sBACAwkO,EAAA1J,EAAAC,WACAuuG,IAAAA,GAAAtpU,EAAA,uBAEAimhB,EAAAjmhB,EAAA,gBACAgnhB,EAAAhnhB,EAAA,UACA+qY,OAAAA,GAAA/qY,EAAA,iBACAw6N,EAAAx6N,EAAA,WACA0rP,EAAA1rP,EAAA,YACAqoO,EAAAroO,EAAA,sBACA6kO,EAAA7kO,EAAA,2BACA8kO,EAAA9kO,EAAA,yBAQAD,EAAAokhB,cAAAnnT,GACAlC,EAAA6K,OAAA3I,EAAA,YASAj9N,EAAAslhB,cAAA9+F,GACAzrN,EAAA6K,OAAA4gN,EAAA71V,GAAA,YASA3wF,EAAAmkhB,YAAAlnT,GACA,IAAAssG,EAAA,IAAAvpU,EAAA0pY,aAAAzsK,IAAA,GASAj9N,EAAAknhB,gBAAA1gG,GACAl+M,EAAA,CACAxD,EAAA,QACA0hN,EAAA71V,KAOA3wF,EAAAmnhB,eAAAzlhB,GACA,SAAAqjO,EAAArjO,EAAAowE,MAAA,EAAA,IAMA9xE,EAAAonhB,iBAAA1lhB,GACA,IAAA+4N,EAAA/4N,EAAAowE,MAAA,IAQA9xE,EAAAgyK,IAAA,IACAvnE,KAAAunE,MASAhyK,EAAA0pY,aAAAzsK,GACA8H,EAAA9H,EAAA,UASAj9N,EAAAqnhB,aAAA7wb,GACAsuI,EAAAtuI,EAAA,UASAx2F,EAAAsnhB,iBAAAtnY,MAAAmvP,EAAAr3N,WACAmvW,EAAA93I,GAAAnvP,MAAAwmS,IACA,MAAA71V,QAAA3wF,EAAAslhB,cAAA9+F,GAEA,MAAA,CACAA,KAAAA,EACA0/F,SAAAA,EAAAv1b,EAAAmnF,QAIAh/E,KAAA94F,EAAAunhB,YAAAzwc,KAAAwzD,GAAAA,EAAAk8S,OASAxmb,EAAAunhB,WAAA,CAAAh0c,EAAAyS,IACAkgc,EAAA1nN,QAAAjrP,EAAA2yc,SAAAlgc,EAAAkgc,UAUAlmhB,EAAAwnhB,SAAA,CAAAC,EAAAC,IACAp1c,KAAAwhL,KAAA2zR,EAAAC,GAUA1nhB,EAAA2nhB,gBAAA,CAAAjmhB,EAAAtB,KACA,MAAAirY,EAAA,IAAA5gS,KAGA,OAFA,IAAAugS,EAAAtpY,EAAAtB,EAAAirY,GAEA//B,aASAtrW,EAAAg5f,OAAA,CAAAroa,EAAAi3b,KACA,MAAArohB,EAAA,CAAA,SAAA,OACAqohB,GACArohB,EAAAi4E,KAAAowc,GAEAj3b,GACApxF,EAAAi4E,KAAA,GAAAmZ,EAAA40I,cAAAzzJ,MAAA,EAAA,MAIA6+P,EAAA84B,WAAAzjR,EAAAwrF,GACAizD,EAAAc,YAAA/zD,GAOA,OAJAtxK,OAAAiqG,OAAAwmO,EAAApxU,EAAAy3E,KAAA,MAAA,CACAiF,MAAA00P,EAAApxU,EAAAg/F,OAAA,CAAA,UAAAvnB,KAAA,SAMAh3E,EAAAy7N,aAAA,cAAAj2H,MACAzjG,WACA,MAAA,cAYA/B,EAAA6pU,YAAA,CAAAg+M,EAAA//T,IAKA,YAAAhlI,GACA,OAAA2vF,QAAA40L,KAAA,CACAwgL,KAAA/kc,GACA,IAAA2vF,SAAA,CAAAC,EAAAu5B,KACA10B,YAAA,KACA00B,EAAA0/C,EAAA,IAAAnmJ,MAAA,kDAAA,gBACAsiH,SAmBA9nN,EAAA8nhB,YAAA9nY,eAAAq9E,EAAAwqT,GACA,MAAA7uI,EAAA,GACA,UAAA,MAAArxS,KAAA01H,EACA27K,EAAAxhU,KAAAqwc,EAAAlgb,IAEA,OAAA8qE,QAAA2gD,IAAA4lL,sUCtOA,SAAA+uI,EAAex0c,EAAGyS,MACZzS,EAAE5B,SAAWqU,EAAErU,OAAAA,MAAAA,IAAkB6zB,MAAM,8CACvCluB,EAASq4K,EAAOiE,YAAYrgL,EAAE5B,QACzBkC,EAAI,EAAGA,EAAIN,EAAE5B,OAAQkC,IAAKyD,EAAOzD,GAAKN,EAAEM,GAAKmS,EAAEnS,UACjDyD,EANTv3E,EAAOC,QAAU+nhB,EASjBA,EAAKvpN,QAAU,SAAkBjrP,EAAGyS,MAC9BzS,EAAE5B,SAAWqU,EAAErU,OAAAA,MAAAA,IAAkB6zB,MAAM,8CAClC3xB,EAAI,EAAGA,EAAIN,EAAE5B,OAAQkC,OACxBN,EAAEM,KAAOmS,EAAEnS,UACRN,EAAEM,GAAKmS,EAAEnS,IAAM,EAAI,SAErB,GAGTk0c,EAAKrkhB,GAAK,SAAa6vE,EAAGyS,UACM,IAAvB+hc,EAAKvpN,QAAQjrP,EAAGyS,IAGzB+hc,EAAKnkhB,GAAK,SAAa2vE,EAAGyS,UACO,IAAxB+hc,EAAKvpN,QAAQjrP,EAAGyS,IAGzB+hc,EAAK9na,GAAK,SAAa1sC,EAAGyS,UACM,IAAvB+hc,EAAKvpN,QAAQjrP,EAAGyS,8CC3BzB,aACA,MAAAktV,EAAAjza,EAAA,mBAEAF,EAAAC,QAAAggJ,MACAs2L,EACAs3D,GAEAj9B,YAAAA,EAAA53P,EAAAA,EACAiva,YAAAA,GAAA,GACA,KAEA,IAAAv1W,SAAA,CAAAC,EAAAu5B,KACA,GAAA,mBAAA2hM,EACA,MAAA,IAAAn8R,UAAA,+BAGA,IAAA5+B,OAAAkgT,cAAApiB,IAAAA,IAAA53P,EAAAA,KAAA43P,GAAA,GACA,MAAA,IAAAl/P,UAAA,kFAAAk/P,eAAAA,MAGA,MAAAr5R,EAAA,GACAmoD,EAAA,GACA03B,EAAAm/K,EAAA1zU,OAAAu0J,YACA,IAAAuiT,GAAA,EACAuuE,GAAA,EACAC,EAAA,EACAzxc,EAAA,EAEA,MAAAqT,EAAA,KACA,GAAA4vX,EACA,OAGA,MAAAtlE,EAAAj9O,EAAArtE,OACA7X,EAAAwE,EAGA,GAFAA,IAEA29T,EAAA59N,KAWA,OAVAyxW,GAAA,OAEA,IAAAC,IACAF,GAAA,IAAAvoZ,EAAA9tD,OAGA+gG,EAAAp7F,GAFA20H,EAAA,IAAAinO,EAAAzzS,MASAyoZ,IAEA,WACA,IACA,MAAA39b,QAAA6pT,EAAAh0Y,MACAk3E,EAAArF,SAAA27T,EAAArjT,EAAAtY,GACAi2c,IACAp+b,IACA,MAAA7N,GACA+rc,GACAtuE,GAAA,EACAztQ,EAAAhwH,KAEAwjD,EAAAjoD,KAAAyE,GACAisc,IACAp+b,OAbA,IAmBA,IAAA,IAAAjW,EAAA,EAAAA,EAAA88R,IACA7mR,KAEAm+b,GAHAp0c,gECxEA,aASA,MAAAutR,EAAAphW,EAAAohW,OAAA,IACAkH,EAAAtoW,EAAAsoW,OAAA,GAAAlH,EACAG,EAAAvhW,EAAAuhW,KAAA,GAAA+G,EAEAtoW,EAAA2khB,eAAA,GAAApjL,EAEAvhW,EAAA2jhB,aAAA,aAEA3jhB,EAAAmohB,qBAAA,cAEAnohB,EAAAoohB,yBAAA,IAEApohB,EAAAqohB,mBAAA,GAAA9mL,EAEAvhW,EAAAsohB,2BAAA/mL,EAEAvhW,EAAAuohB,qBAAA,GAAAnnL,EAGAphW,EAAAwohB,sBAAA,GAGAxohB,EAAAs8Q,EAAA,GAGAt8Q,EAAAwjhB,MAAA,EAEAxjhB,EAAAyohB,kBAAA,CACAp/M,SAAA,EACA0qI,iBAAA,EACA/hG,SAAA,EAAA1J,EACA9wL,QAAA,GAAA4pL,EACA31J,MAAA,GAAA21J,iCCzCA,aAEA,MAAAz1G,EAAA1rP,EAAA,aAEAk1U,KAAAA,GAAAl1U,EAAA,WACAi6b,EAAAj6b,EAAA,sBACAu0W,EAAAv0W,EAAA,cACA20U,QAAAA,GAAA30U,EAAA,uBACAslF,EAAAtlF,EAAA,YAEAo1b,EAAAp1b,EAAA,sDAEAovP,EAAApvP,EAAA,SACAk5E,EAAAl5E,EAAA,eACA4wW,EAAA5wW,EAAA,aACAgtR,EAAAhtR,EAAA,WAiNAF,EAAAC,QAvMA,MAMAuD,YAAAqkU,GACAl7N,KAAAk7N,IAAAA,EACAl7N,KAAAg8a,mBAAAvvc,EAAAovc,qBACA77a,KAAAs3a,KAAA/2P,EAAA+rO,OAAAtsZ,KAAAk7N,IAAAx/F,OAAA,OACA17H,KAAAi8a,KAAAt5R,EAAA3iJ,KAAAk7N,KACAl7N,KAAA2pV,iBAAA3pV,KAAA2pV,iBAAAhxV,KAAAqH,MACAA,KAAAguX,UAAA,EAMAn3d,cACA,GAAAmpG,KAAAguX,SACA,OAGA,IAAAhuX,KAAAk7N,IAAAktC,UACA,MAAAnpH,EAAA,IAAAnmJ,MAAA,yBAAA,4BAGAkH,KAAAguX,UAAA,GAGA,IAAAhuX,KAAAk7N,IAAAg8M,aAEAl3a,KAAAk7N,IAAAouH,UAAAt/J,OAAAhqL,KAAAk7N,IAAA3vH,SAAAvrG,KAAAi8a,MAIA,MAAApyF,EAAA,IAAAlB,EAAA,CACA9I,YAAA,CAAA7/U,KAAAk7N,IAAA3vH,UACAgJ,SAAA,CACAu1O,UAAA9pV,KAAA2pV,iBACAI,aAAA,UAGA/pV,KAAAypV,mBAAAzpV,KAAAk7N,IAAAouH,UAAAz/P,SAAAggQ,GAMAhzb,cACAmpG,KAAAk7N,IAAAktC,WAAApoQ,KAAAooQ,aAGApoQ,KAAAguX,UAAA,EAGAhuX,KAAAypV,oBACAzpV,KAAAk7N,IAAAouH,UAAAU,WAAAhqV,KAAAypV,eASArhF,gBACA,OAAApoQ,KAAAguX,SAQAkuD,kBAEA,OAAAl8a,KAAAk7N,IAAAktC,WAAApoQ,KAAAooQ,UAQAvxW,uBAAA6kO,SACA17H,KAAAk7N,IAAA+sM,KAAAvsS,GACA17H,KAAAs3a,KAAA,iCAAA57S,EAAA7C,eAUAhiO,kBAAA2zL,EAAA/6G,GAEA,IAAAuwB,KAAAk8a,YACA,MAAAj9R,EAAA,IAAAnmJ,MAAA,sBAAA,uBAGA,MAAA7U,EAAAumG,EAAAquC,cACA74H,KAAAs3a,KAAA,iBAAArzb,GAEA,IAAAsmW,EAAAvqV,KAAAk7N,IAAAouH,UAAAlL,kBAAA58V,IAAAgpG,GACA+/P,IACAA,QAAAvqV,KAAAk7N,IAAA0nI,OAAAqB,cAAAz5Q,IAGA,MAAAgmC,OAAAA,SAAA+5N,EAAAC,UAAAxqV,KAAAk7N,IAAA3vH,UAEA,OAAAvrG,KAAAm8a,kBAAA3rT,EAAA/gJ,EAAAmvR,aASA/nW,kBAAA2zL,EAAA/6G,GACA,IAAAuwB,KAAAk8a,YACA,MAAAj9R,EAAA,IAAAnmJ,MAAA,sBAAA,uBAGA,MAAA7U,EAAAumG,EAAAquC,cACA74H,KAAAs3a,KAAA,iBAAArzb,GAEA,IAAAsmW,EAAAvqV,KAAAk7N,IAAAouH,UAAAlL,kBAAA58V,IAAAgpG,GACA+/P,IACAA,QAAAvqV,KAAAk7N,IAAA0nI,OAAAqB,cAAAz5Q,IAEA,MAAAgmC,OAAAA,SAAA+5N,EAAAC,UAAAxqV,KAAAk7N,IAAA3vH,UAEA,OAAAvrG,KAAAo8a,cAAA5rT,EAAA/gJ,EAAAmvR,aAWA/nW,wBAAA25N,EAAA/gJ,GACA,OAAAq4R,EA0BAx0N,eAAAk9E,EAAA/gJ,GACA,MAAA1D,QAAA08P,EACA,CAAAh5P,GACA+9W,EAAAlqV,SACAktH,EACAg9N,EAAAppV,UAIAkvC,MAAAA,IACA,MAAAi9E,QAAA13I,EAAA9D,GAEA,GAAAw7I,EACA,OAAAA,EAAAnrJ,WAKA,GAAA,IAAA2G,EAAA9G,OACA,MAAAg6K,EAAA,IAAAnmJ,MAAA,uBAAA,2BAGA,OAAAqrQ,EAAA9F,YAAAtyR,GA/CAswc,CAAA7rT,EAAA/gJ,GACAuwB,KAAAg8a,oBAUAnlhB,cAAA25N,EAAA/gJ,GACA,OAAAg5P,EACA,CAAAh5P,GACA+9W,EAAAlqV,SACAktH,EACA03G,kTC9LA,aAEA,MAAAn5G,UAAAj2H,MACAjiG,YAAA8iF,GACA4rC,MAAA5rC,GACAqmB,KAAAntG,KAAA,gBAIA,MAAAi1W,EAAA,CAAAzyJ,EAAAoyJ,EAAA3pL,EAAAnpL,KACA,IAAAozW,EACA,MAAAqkI,EAAA,IAAArmU,SAAA,CAAAC,EAAAu5B,KACA,GAAA,iBAAAkoK,GAAAA,EAAA,EACA,MAAA,IAAA1iQ,UAAA,mDAGA0iQ,IAAAp7P,EAAAA,GAKA13G,EAAA,CACA03e,aAAA,CAAAxhU,WAAAA,WAAAolD,aAAAA,iBACAt7N,GAGAozW,EAAApzW,EAAA03e,aAAAxhU,WAAAjtE,UAAAloG,GAAA,KACA,GAAA,mBAAAooL,EAAA,CACA,IACA9X,EAAA8X,KACA,MAAAvuG,GACAgwH,EAAAhwH,GAGA,OAGA,MACAu1R,EAAAhnL,aAAAhlF,MAAAglF,EAAA,IAAAixC,EADA,iBAAAjxC,EAAAA,EAAA,2BAAA2pL,kBAGA,mBAAApyJ,EAAA2yJ,QACA3yJ,EAAA2yJ,SAGAzoK,EAAAulK,KACA2C,GAEA,WACA,IACAzhM,QAAAqvC,GACA,MAAA9lI,GACAgwH,EAAAhwH,GACA,QACA56E,EAAA03e,aAAAp8Q,aAAAryH,UAAAloG,EAAAqyW,KANA,IA9BA/hM,EAAAqvC,MA8CA,OALA+2R,EAAAh/U,MAAA,KACA6iE,aAAA83I,GACAA,OAAAryW,GAGA02e,GAGA/4e,EAAAC,QAAAw0W,EAEAz0W,EAAAC,QAAAH,QAAA20W,EAEAz0W,EAAAC,QAAAy7N,aAAAA,gCCtEA,aAEA,MAAA05G,KAAAA,GAAAl1U,EAAA,WACAi6b,EAAAj6b,EAAA,sBAEA4wW,EAAA5wW,EAAA,cACAghN,EAAAhhN,EAAA,cACAgtR,EAAAhtR,EAAA,YAUAF,EAAAC,QAAA4nU,IACA,MAAA7uG,EAAAk0D,EAAA+rO,OAAApxL,EAAAx/F,OAAA,OACA4gT,EAAA/nU,EAAA2mH,GAQA5nL,eAAA6vT,EAAAznO,EAAAjsJ,GAEA,MAAA8tF,EAAA++W,EAAA7sc,EAAA3I,MAEA,UACAo0P,EAAA+sM,KAAAvsS,GACA,MAAAjiI,GACA4yH,EAAA98I,MAAA,qCAAAkqB,GAGA,GAAA8jE,EAKA,OAAAA,EAAAm+D,EAAAjsJ,GAJA48I,EAAA98I,MAAA,sCAAAE,EAAA3I,QAiDA,OAnCAwsE,gBAAAk9E,OAAAA,EAAAy5N,WAAAA,IACA,MAAAvuN,EAAAuuN,EAAAC,WAEA,UACAhvH,EAAA+sM,KAAAvsS,GACA,MAAAjiI,GACA4yH,EAAA98I,MAAAkqB,GAGA,MAAA0wV,EAAAzuN,EAAA7C,cACAxM,EAAA,WAAA89N,SAEA1hH,EACAj4G,EAAAz7I,OACAy4W,EAAAppV,UAIArvB,GAAA,kBACA,UAAA,MAAAtF,KAAAsF,EAAA,CAEA,MAAAwnc,EAAAp4K,EAAA9F,YAAA5uR,EAAArK,SACA2G,QAAAo3X,EAAAznO,EAAA6gT,GAGAxwc,UACAA,EAAA6yR,cARA,IAYA4uF,EAAAlqV,SACAktH,EAAA25K,iJCnFA,aAEA,MAAAp8K,EAAAx6N,EAAA,YACA4nT,UAAAA,GAAA5nT,EAAA,cACA+qY,OAAAA,GAAA/qY,EAAA,iBACAiphB,EAAAjphB,EAAA,SAEAkphB,EAAAD,EAAAr4K,QAAAu4K,YACAC,EAAAH,EAAAr4K,QAAAy4K,eAgBA,MAAAz4K,EAMAttW,YAAAiwE,EAAA9xE,EAAAuxG,GACA,GAAAvxG,KAAAA,aAAAyjO,YACA,MAAA,IAAA3/H,MAAA,4BAGAkH,KAAAl5B,KAAAA,EACAk5B,KAAAhrG,IAAAA,EACAgrG,KAAA68a,iBAAAt2a,EAGAvG,KAAAq4a,YAAA,GAEAr4a,KAAA88a,cAAA,GAEA98a,KAAAkvG,YAAAx5M,EAMAqnhB,mBACA,MAAAx2a,EAAAvG,KAAA68a,iBAAA,EACA,OAAAt2a,EAAA,EACA,EAGAA,EAGAw2a,iBAAAx2a,GACAvG,KAAA68a,iBAAAt2a,EAMA1vG,YACA,MAAAgoG,EAAA,CACA7pG,IAAAgrG,KAAAhrG,IACA8xE,KAAAk5B,KAAAl5B,KACAk2c,gBAAAh9a,KAAA68a,iBACAxE,YAAAr4a,KAAAq4a,YAAAjuc,IAAA6yc,GACAH,cAAA98a,KAAA88a,cAAA1yc,IAAA6yc,GAGA/tU,YAAAx5M,GAWA,OARAsqG,KAAAkvG,SACAlvG,KAAAkvG,kBAAAupB,WACA55H,EAAAqwG,OAAAlvG,KAAAkvG,OAEArwG,EAAAqwG,OAAAlvG,KAAAkvG,OAAA0vJ,aAIA49K,EAAAr4K,QAAA7gQ,OAAAzE,GAAA46H,SAQA5iO,mBAAAizF,GACA,MAAAo/D,EAAAszX,EAAAr4K,QAAA//P,OAAAta,GAEAra,EAAA,IAAA00R,EAAAj7M,EAAApiF,KAAAoiF,EAAAl0J,IAAAk0J,EAAA8zX,iBASA,OAPAvtc,EAAA4oc,YAAAnvX,EAAAmvX,YAAAjuc,IAAA8yc,GACAztc,EAAAqtc,cAAA5zX,EAAA4zX,cAAA1yc,IAAA8yc,GAEAh0X,EAAAgmD,QAAAhmD,EAAAgmD,OAAAjqI,SACAwK,EAAAy/H,OAAAovL,EAAAjgC,YAAAn1M,EAAAgmD,SAGAz/H,GAUA,SAAAwtc,EAAAnjG,GAQA,MANA,CACA71V,GAAA61V,EAAA71V,GAAAA,GACAq9V,OAAAxH,EAAAz4B,YAAA,IAAAj3U,KAAA8U,GAAAA,EAAAy5I,QACAsxN,WAAA0yF,EAAAQ,WASA,SAAAD,EAAApjG,GACA,MAAA,CAEA71V,GAAA,IAAA8pI,EAAA+rN,EAAA71V,IACAo9T,YAAAy4B,EAAAwH,OAAA,IAAAl3W,KAAAvD,GAAA,IAAAs0O,EAAAt0O,MAxBAs9R,EAAA2iI,MAAA21C,EACAt4K,EAAAi5K,iBAAAT,EA2BAtphB,EAAAC,QAAA6wW,yGCzIA,aAEA,IAAA7iH,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,wBAAAN,EAAAM,MAAA,sBAAA,IAEA1mD,EAAAojM,OAAA,WAqBA,SAAAA,EAAAp3T,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAgOA,OAvNAm3T,EAAA3gS,UAAA3oG,IAAA2sP,EAAAG,UAAA,IAQAw8I,EAAA3gS,UAAAjqG,MAAAiuP,EAAAG,UAAA,IAQAw8I,EAAA3gS,UAAA0/a,OAAA17R,EAAAG,UAAA,IAQAw8I,EAAA3gS,UAAA1W,UAAA06J,EAAAG,UAAA,IAQAw8I,EAAA3gS,UAAAghS,aAAA,GAWAL,EAAAh7R,OAAA,SAAApkB,EAAAulI,GAaA,OAZAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAlqF,KAAAxB,OAAAgnG,eAAAoD,KAAA1e,EAAA,QACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAlqF,KACA,MAAAkqF,EAAAxrF,OAAAF,OAAAgnG,eAAAoD,KAAA1e,EAAA,UACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAxrF,OACA,MAAAwrF,EAAAm+b,QAAA7phB,OAAAgnG,eAAAoD,KAAA1e,EAAA,WACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAm+b,QACA,MAAAn+b,EAAA+H,WAAAzzF,OAAAgnG,eAAAoD,KAAA1e,EAAA,cACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAA+H,WACA,MAAA/H,EAAAy/S,cAAAnrY,OAAAgnG,eAAAoD,KAAA1e,EAAA,iBACAulI,EAAAs9B,OAAA,IAAApmJ,OAAAzc,EAAAy/S,cACAl6K,GAcA65K,EAAAl6R,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAojM,OACAtwR,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAlqF,IAAAg5G,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAxrF,MAAAs6G,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAm+b,OAAArva,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAA+H,UAAA+mB,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAy/S,aAAA3wR,EAAArS,SACA,MACA,QACAqS,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAo/S,EAAAn8I,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAojM,OACA,OAAA1gQ,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAojM,OA4BA,OA3BA,MAAA1gQ,EAAA5oI,MACA,iBAAA4oI,EAAA5oI,IACA2sP,EAAA99I,OAAAO,OAAAw5B,EAAA5oI,IAAAkqF,EAAAlqF,IAAA2sP,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA5oI,MAAA,GACA4oI,EAAA5oI,IAAAiwE,SACAia,EAAAlqF,IAAA4oI,EAAA5oI,MAEA,MAAA4oI,EAAAlqI,QACA,iBAAAkqI,EAAAlqI,MACAiuP,EAAA99I,OAAAO,OAAAw5B,EAAAlqI,MAAAwrF,EAAAxrF,MAAAiuP,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAlqI,QAAA,GACAkqI,EAAAlqI,MAAAuxE,SACAia,EAAAxrF,MAAAkqI,EAAAlqI,QAEA,MAAAkqI,EAAAy/Y,SACA,iBAAAz/Y,EAAAy/Y,OACA17R,EAAA99I,OAAAO,OAAAw5B,EAAAy/Y,OAAAn+b,EAAAm+b,OAAA17R,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAy/Y,SAAA,GACAz/Y,EAAAy/Y,OAAAp4c,SACAia,EAAAm+b,OAAAz/Y,EAAAy/Y,SAEA,MAAAz/Y,EAAA32C,YACA,iBAAA22C,EAAA32C,UACA06J,EAAA99I,OAAAO,OAAAw5B,EAAA32C,UAAA/H,EAAA+H,UAAA06J,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA32C,YAAA,GACA22C,EAAA32C,UAAAhiB,SACAia,EAAA+H,UAAA22C,EAAA32C,YAEA,MAAA22C,EAAA+gQ,eACAz/S,EAAAy/S,aAAAt4T,OAAAu3D,EAAA+gQ,eAEAz/S,GAYAo/S,EAAAl8I,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GA+CA,OA9CAsyC,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA5oI,IAAA,IAEA4oI,EAAA5oI,IAAA,GACAk7K,EAAAyoD,QAAA96H,QACA+/B,EAAA5oI,IAAA2sP,EAAAG,UAAAlkH,EAAA5oI,OAEAk7K,EAAAyoD,QAAAtyJ,OACAu3D,EAAAlqI,MAAA,IAEAkqI,EAAAlqI,MAAA,GACAw8K,EAAAyoD,QAAA96H,QACA+/B,EAAAlqI,MAAAiuP,EAAAG,UAAAlkH,EAAAlqI,SAEAw8K,EAAAyoD,QAAAtyJ,OACAu3D,EAAAy/Y,OAAA,IAEAz/Y,EAAAy/Y,OAAA,GACAntW,EAAAyoD,QAAA96H,QACA+/B,EAAAy/Y,OAAA17R,EAAAG,UAAAlkH,EAAAy/Y,UAEAntW,EAAAyoD,QAAAtyJ,OACAu3D,EAAA32C,UAAA,IAEA22C,EAAA32C,UAAA,GACAipF,EAAAyoD,QAAA96H,QACA+/B,EAAA32C,UAAA06J,EAAAG,UAAAlkH,EAAA32C,aAEA22C,EAAA+gQ,aAAA,IAEA,MAAAz/S,EAAAlqF,KAAAkqF,EAAAsb,eAAA,SACAojC,EAAA5oI,IAAAk7K,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAlqF,IAAA,EAAAkqF,EAAAlqF,IAAAiwE,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAlqF,KAAAkqF,EAAAlqF,KAEA,MAAAkqF,EAAAxrF,OAAAwrF,EAAAsb,eAAA,WACAojC,EAAAlqI,MAAAw8K,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAxrF,MAAA,EAAAwrF,EAAAxrF,MAAAuxE,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAxrF,OAAAwrF,EAAAxrF,OAEA,MAAAwrF,EAAAm+b,QAAAn+b,EAAAsb,eAAA,YACAojC,EAAAy/Y,OAAAntW,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAm+b,OAAA,EAAAn+b,EAAAm+b,OAAAp4c,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAm+b,QAAAn+b,EAAAm+b,QAEA,MAAAn+b,EAAA+H,WAAA/H,EAAAsb,eAAA,eACAojC,EAAA32C,UAAAipF,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAA+H,UAAA,EAAA/H,EAAA+H,UAAAhiB,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAA+H,WAAA/H,EAAA+H,WAEA,MAAA/H,EAAAy/S,cAAAz/S,EAAAsb,eAAA,kBACAojC,EAAA+gQ,aAAAz/S,EAAAy/S,cAEA/gQ,GAUA0gQ,EAAA3gS,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAi8I,EAzPA,GA4PApjM,EAAAipK,QAAA,WAsBA,SAAAA,EAAAj9R,GAGA,GAFA84B,KAAAq4a,YAAA,GACAr4a,KAAA88a,cAAA,GACA51c,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAkSA,IACAk6K,EAAAjkJ,EAoPA,OA9gBA+mQ,EAAAxmQ,UAAA72B,KAAA,EAQAq9R,EAAAxmQ,UAAAq/a,gBAAA,EAQA74K,EAAAxmQ,UAAA3oG,IAAA2sP,EAAAG,UAAA,IAQAqiH,EAAAxmQ,UAAAuxG,OAAAyyC,EAAAG,UAAA,IAQAqiH,EAAAxmQ,UAAA06a,YAAA12R,EAAA4D,WAQA4+G,EAAAxmQ,UAAAm/a,cAAAn7R,EAAA4D,WAWA4+G,EAAA7gQ,OAAA,SAAApkB,EAAAulI,GASA,GARAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAApY,MAAAtzE,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,GAAAC,MAAA9iK,EAAApY,MACA,MAAAoY,EAAAlqF,KAAAxB,OAAAgnG,eAAAoD,KAAA1e,EAAA,QACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAlqF,KACA,MAAAkqF,EAAAgwH,QAAA17M,OAAAgnG,eAAAoD,KAAA1e,EAAA,WACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAgwH,QACA,MAAAhwH,EAAAm5b,aAAAn5b,EAAAm5b,YAAApzc,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAAm5b,YAAApzc,SAAAkC,EACA+zH,EAAAipK,QAAAowG,KAAAjxW,OAAApkB,EAAAm5b,YAAAlxc,GAAAs9I,EAAAs9B,OAAA,IAAA6C,QAAAC,SAEA,GAAA,MAAA3lK,EAAA49b,eAAA59b,EAAA49b,cAAA73c,OACA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAA49b,cAAA73c,SAAAkC,EACA+zH,EAAAipK,QAAAowG,KAAAjxW,OAAApkB,EAAA49b,cAAA31c,GAAAs9I,EAAAs9B,OAAA,IAAA6C,QAAAC,SAIA,OAFA,MAAA3lK,EAAA89b,iBAAAxphB,OAAAgnG,eAAAoD,KAAA1e,EAAA,oBACAulI,EAAAs9B,OAAA,IAAAC,MAAA9iK,EAAA89b,iBACAv4T,GAcA0/I,EAAA//P,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAipK,QACAn2P,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAApY,KAAAknC,EAAAg0I,QACA,MACA,KAAA,GACA9iK,EAAA89b,gBAAAhva,EAAAg0I,QACA,MACA,KAAA,EACA9iK,EAAAlqF,IAAAg5G,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAgwH,OAAAlhG,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAm5b,aAAAn5b,EAAAm5b,YAAApzc,SACAia,EAAAm5b,YAAA,IACAn5b,EAAAm5b,YAAAvtc,KAAAowH,EAAAipK,QAAAowG,KAAAnwW,OAAA4J,EAAAA,EAAA+zI,WACA,MACA,KAAA,EACA7iK,EAAA49b,eAAA59b,EAAA49b,cAAA73c,SACAia,EAAA49b,cAAA,IACA59b,EAAA49b,cAAAhyc,KAAAowH,EAAAipK,QAAAowG,KAAAnwW,OAAA4J,EAAAA,EAAA+zI,WACA,MACA,QACA/zI,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAilR,EAAAhiH,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAipK,QACA,OAAAvmO,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAipK,QACA,OAAAvmO,EAAA92D,MACA,IAAA,YACA,KAAA,EACAoY,EAAApY,KAAA,EACA,MACA,IAAA,YACA,KAAA,EACAoY,EAAApY,KAAA,EACA,MACA,IAAA,eACA,KAAA,EACAoY,EAAApY,KAAA,EACA,MACA,IAAA,gBACA,KAAA,EACAoY,EAAApY,KAAA,EACA,MACA,IAAA,YACA,KAAA,EACAoY,EAAApY,KAAA,EACA,MACA,IAAA,OACA,KAAA,EACAoY,EAAApY,KAAA,EAkBA,GAfA,MAAA82D,EAAAo/Y,kBACA99b,EAAA89b,gBAAA,EAAAp/Y,EAAAo/Y,iBAEA,MAAAp/Y,EAAA5oI,MACA,iBAAA4oI,EAAA5oI,IACA2sP,EAAA99I,OAAAO,OAAAw5B,EAAA5oI,IAAAkqF,EAAAlqF,IAAA2sP,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA5oI,MAAA,GACA4oI,EAAA5oI,IAAAiwE,SACAia,EAAAlqF,IAAA4oI,EAAA5oI,MAEA,MAAA4oI,EAAAsxE,SACA,iBAAAtxE,EAAAsxE,OACAyyC,EAAA99I,OAAAO,OAAAw5B,EAAAsxE,OAAAhwH,EAAAgwH,OAAAyyC,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAsxE,SAAA,GACAtxE,EAAAsxE,OAAAjqI,SACAia,EAAAgwH,OAAAtxE,EAAAsxE,SAEAtxE,EAAAy6Y,YAAA,CACA,IAAAx6a,MAAA/gB,QAAA8gD,EAAAy6Y,aACA,MAAAtza,UAAA,wCACA7lB,EAAAm5b,YAAA,GACA,IAAA,IAAAlxc,EAAA,EAAAA,EAAAy2D,EAAAy6Y,YAAApzc,SAAAkC,EAAA,CACA,GAAA,iBAAAy2D,EAAAy6Y,YAAAlxc,GACA,MAAA49B,UAAA,yCACA7lB,EAAAm5b,YAAAlxc,GAAA+zH,EAAAipK,QAAAowG,KAAApyN,WAAAvkH,EAAAy6Y,YAAAlxc,KAGA,GAAAy2D,EAAAk/Y,cAAA,CACA,IAAAj/a,MAAA/gB,QAAA8gD,EAAAk/Y,eACA,MAAA/3a,UAAA,0CACA7lB,EAAA49b,cAAA,GACA,IAAA31c,EAAA,EAAAA,EAAAy2D,EAAAk/Y,cAAA73c,SAAAkC,EAAA,CACA,GAAA,iBAAAy2D,EAAAk/Y,cAAA31c,GACA,MAAA49B,UAAA,2CACA7lB,EAAA49b,cAAA31c,GAAA+zH,EAAAipK,QAAAowG,KAAApyN,WAAAvkH,EAAAk/Y,cAAA31c,KAGA,OAAA+X,GAYAilR,EAAA/hH,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAgCA,IA/BAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAAy6Y,YAAA,GACAz6Y,EAAAk/Y,cAAA,IAEA5sW,EAAAuiC,WACA70E,EAAA92D,KAAAopG,EAAAp5C,QAAAzwD,OAAA,YAAA,EACA6pG,EAAAyoD,QAAAtyJ,OACAu3D,EAAA5oI,IAAA,IAEA4oI,EAAA5oI,IAAA,GACAk7K,EAAAyoD,QAAA96H,QACA+/B,EAAA5oI,IAAA2sP,EAAAG,UAAAlkH,EAAA5oI,OAEAk7K,EAAAyoD,QAAAtyJ,OACAu3D,EAAAsxE,OAAA,IAEAtxE,EAAAsxE,OAAA,GACAh/B,EAAAyoD,QAAA96H,QACA+/B,EAAAsxE,OAAAyyC,EAAAG,UAAAlkH,EAAAsxE,UAEAtxE,EAAAo/Y,gBAAA,GAEA,MAAA99b,EAAApY,MAAAoY,EAAAsb,eAAA,UACAojC,EAAA92D,KAAAopG,EAAAp5C,QAAAzwD,OAAA60H,EAAAipK,QAAAu4K,YAAAx9b,EAAApY,MAAAoY,EAAApY,MAEA,MAAAoY,EAAAlqF,KAAAkqF,EAAAsb,eAAA,SACAojC,EAAA5oI,IAAAk7K,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAlqF,IAAA,EAAAkqF,EAAAlqF,IAAAiwE,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAlqF,KAAAkqF,EAAAlqF,KAEA,MAAAkqF,EAAAgwH,QAAAhwH,EAAAsb,eAAA,YACAojC,EAAAsxE,OAAAh/B,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAgwH,OAAA,EAAAhwH,EAAAgwH,OAAAjqI,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAgwH,QAAAhwH,EAAAgwH,QAEAhwH,EAAAm5b,aAAAn5b,EAAAm5b,YAAApzc,OAAA,CACA24D,EAAAy6Y,YAAA,GACA,IAAA,IAAA/mb,EAAA,EAAAA,EAAApS,EAAAm5b,YAAApzc,SAAAqsB,EACAssC,EAAAy6Y,YAAA/mb,GAAA4pG,EAAAipK,QAAAowG,KAAAnyN,SAAAljK,EAAAm5b,YAAA/mb,GAAA4+E,GAGA,GAAAhxF,EAAA49b,eAAA59b,EAAA49b,cAAA73c,OAAA,CACA24D,EAAAk/Y,cAAA,GACA,IAAAxrb,EAAA,EAAAA,EAAApS,EAAA49b,cAAA73c,SAAAqsB,EACAssC,EAAAk/Y,cAAAxrb,GAAA4pG,EAAAipK,QAAAowG,KAAAnyN,SAAAljK,EAAA49b,cAAAxrb,GAAA4+E,GAMA,OAHA,MAAAhxF,EAAA89b,iBAAA99b,EAAAsb,eAAA,qBACAojC,EAAAo/Y,gBAAA99b,EAAA89b,iBAEAp/Y,GAUAumO,EAAAxmQ,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAcA8hH,EAAAu4K,aACAr7R,EAAA,IAAAjkJ,EAAA5pG,OAAAU,OAAAmtP,IACAA,EAAA,GAAA,aAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,aAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,gBAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,iBAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,aAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,QAAA,EACAjkJ,GAYA+mQ,EAAAy4K,eAAA,WACA,IAAAv7R,EAAA,GAAAjkJ,EAAA5pG,OAAAU,OAAAmtP,GAKA,OAJAjkJ,EAAAikJ,EAAA,GAAA,iBAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,aAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,eAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,kBAAA,EACAjkJ,EANA,GASA+mQ,EAAAowG,KAAA,WAmBA,SAAAA,EAAArtY,GAEA,GADA84B,KAAAshV,MAAA,GACAp6W,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA6LA,OApLAotY,EAAA52W,UAAA1Z,GAAA09J,EAAAG,UAAA,IAQAyyN,EAAA52W,UAAA2jV,MAAA3/L,EAAA4D,WAQAgvN,EAAA52W,UAAAssV,WAAA,EAWAsqB,EAAAjxW,OAAA,SAAApkB,EAAAulI,GAKA,GAJAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAA+E,IAAAzwF,OAAAgnG,eAAAoD,KAAA1e,EAAA,OACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAA+E,IACA,MAAA/E,EAAAoiW,OAAApiW,EAAAoiW,MAAAr8W,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAAoiW,MAAAr8W,SAAAkC,EACAs9I,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAoiW,MAAAn6W,IAIA,OAFA,MAAA+X,EAAA+qW,YAAAz2b,OAAAgnG,eAAAoD,KAAA1e,EAAA,eACAulI,EAAAs9B,OAAA,IAAAC,MAAA9iK,EAAA+qW,YACAxlO,GAcA8vP,EAAAnwW,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAipK,QAAAowG,KACAvmW,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAA+E,GAAA+pB,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAoiW,OAAApiW,EAAAoiW,MAAAr8W,SACAia,EAAAoiW,MAAA,IACApiW,EAAAoiW,MAAAx2W,KAAAkjC,EAAA2qH,SACA,MACA,KAAA,EACAz5I,EAAA+qW,WAAAj8U,EAAAg0I,QACA,MACA,QACAh0I,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAq1X,EAAApyN,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAipK,QAAAowG,KACA,OAAA32U,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAipK,QAAAowG,KAOA,GANA,MAAA32U,EAAA35C,KACA,iBAAA25C,EAAA35C,GACA09J,EAAA99I,OAAAO,OAAAw5B,EAAA35C,GAAA/E,EAAA+E,GAAA09J,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA35C,KAAA,GACA25C,EAAA35C,GAAAhf,SACAia,EAAA+E,GAAA25C,EAAA35C,KAEA25C,EAAA0jT,MAAA,CACA,IAAAzjV,MAAA/gB,QAAA8gD,EAAA0jT,OACA,MAAAv8U,UAAA,uCACA7lB,EAAAoiW,MAAA,GACA,IAAA,IAAAn6W,EAAA,EAAAA,EAAAy2D,EAAA0jT,MAAAr8W,SAAAkC,EACA,iBAAAy2D,EAAA0jT,MAAAn6W,GACAw6K,EAAA99I,OAAAO,OAAAw5B,EAAA0jT,MAAAn6W,GAAA+X,EAAAoiW,MAAAn6W,GAAAw6K,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA0jT,MAAAn6W,KAAA,GACAy2D,EAAA0jT,MAAAn6W,GAAAlC,SACAia,EAAAoiW,MAAAn6W,GAAAy2D,EAAA0jT,MAAAn6W,IAGA,OAAAy2D,EAAAqsT,YACA,IAAA,gBACA,KAAA,EACA/qW,EAAA+qW,WAAA,EACA,MACA,IAAA,YACA,KAAA,EACA/qW,EAAA+qW,WAAA,EACA,MACA,IAAA,cACA,KAAA,EACA/qW,EAAA+qW,WAAA,EACA,MACA,IAAA,iBACA,KAAA,EACA/qW,EAAA+qW,WAAA,EAGA,OAAA/qW,GAYAq1X,EAAAnyN,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAiBA,IAhBAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAA0jT,MAAA,IAEApxQ,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA35C,GAAA,IAEA25C,EAAA35C,GAAA,GACAisF,EAAAyoD,QAAA96H,QACA+/B,EAAA35C,GAAA09J,EAAAG,UAAAlkH,EAAA35C,MAEA25C,EAAAqsT,WAAA/5Q,EAAAp5C,QAAAzwD,OAAA,gBAAA,GAEA,MAAA6Y,EAAA+E,IAAA/E,EAAAsb,eAAA,QACAojC,EAAA35C,GAAAisF,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAA+E,GAAA,EAAA/E,EAAA+E,GAAAhf,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAA+E,IAAA/E,EAAA+E,IAEA/E,EAAAoiW,OAAApiW,EAAAoiW,MAAAr8W,OAAA,CACA24D,EAAA0jT,MAAA,GACA,IAAA,IAAAhwV,EAAA,EAAAA,EAAApS,EAAAoiW,MAAAr8W,SAAAqsB,EACAssC,EAAA0jT,MAAAhwV,GAAA4+E,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAoiW,MAAAhwV,GAAA,EAAApS,EAAAoiW,MAAAhwV,GAAArsB,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAoiW,MAAAhwV,IAAApS,EAAAoiW,MAAAhwV,GAMA,OAHA,MAAApS,EAAA+qW,YAAA/qW,EAAAsb,eAAA,gBACAojC,EAAAqsT,WAAA/5Q,EAAAp5C,QAAAzwD,OAAA60H,EAAAipK,QAAAy4K,eAAA19b,EAAA+qW,YAAA/qW,EAAA+qW,YAEArsT,GAUA22U,EAAA52W,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAkyN,EArNA,GAwNApwG,EAnjBA,GAsjBA9wW,EAAAC,QAAA4nM,4DC7zBA,aAEA,MAAAyqB,EAAApyN,EAAA,iBAAAuze,MAMAzze,EAAAC,QAAA4nU,IACA,MAAA3mH,EAAA,CACA19M,CAAA8uN,EAAA4yT,WAAAhlhB,EAAA,cAAAA,CAAA2nU,GACArkU,CAAA8uN,EAAAuyT,WAAA3khB,EAAA,cAAAA,CAAA2nU,GACArkU,CAAA8uN,EAAA23T,WAAA/phB,EAAA,cAAAA,CAAA2nU,GACArkU,CAAA8uN,EAAA43T,cAAAhqhB,EAAA,iBAAAA,CAAA2nU,GACArkU,CAAA8uN,EAAA63T,eAAAjqhB,EAAA,kBAAAA,CAAA2nU,GACArkU,CAAA8uN,EAAA83T,MAAAlqhB,EAAA,SAAAA,CAAA2nU,IAaA,OALA,SAAAp0P,GAEA,OAAAytI,EAAAztI,gMCzBA,aAEA,MAAAw3T,OAAAA,GAAA/qY,EAAA,iBAEA0rP,EAAA1rP,EAAA,YAEA4wW,EAAA5wW,EAAA,iBACAgtR,EAAAhtR,EAAA,eASAF,EAAAC,QAAA4nU,IACA,MAAA7uG,EAAAk0D,EAAA+rO,OAAApxL,EAAAx/F,OAAA,iBAyDA,OAhDApoF,eAAAooF,EAAAjsJ,GACA,MAAAz6E,EAAAy6E,EAAAz6E,IAIA,GAFAq3N,EAAA,UAAAr3N,IAEAA,GAAA,IAAAA,EAAAiwE,OACA,MAAAg6K,EAAA,IAAAnmJ,MAAA,eAAA,mBAGA,MAAA61H,EAAA,IAAAw1I,EAAAA,EAAA2iI,MAAAyxC,UAAAvjhB,EAAAy6E,EAAAstc,cAEA,GAAAx8P,EAAAk6P,eAAAzlhB,GAAA,CACAq3N,EAAA,iBACA,MAAAqxT,EAAAn9P,EAAAm6P,iBAAA1lhB,GACA,IAAAivF,EAEA,GAAAi3O,EAAA48M,QAAA4F,GACAz5b,EAAAi3O,EAAAx/F,WACA,CACA,MAAA2xN,EAAAnyH,EAAA+lF,UAAAz/T,IAAAk8b,GACAz5b,EAAAopW,GAAAA,EAAAppW,GAGA,GAAAA,GAAAA,EAAAu0I,OAGA,OAFAnM,EAAA,8BACAsC,EAAAzf,OAAA,IAAAovL,EAAAtpY,EAAAivF,EAAAu0I,OAAAG,OACAhK,EAIA,MAAAzf,EAAA2oU,SAAA9xW,QAAA2gD,IAAA,CACAw0G,EAAAyiN,qBAAA3ohB,GACAkmU,EAAA0iN,oBAAAnuc,EAAAisJ,KAaA,OAVAxsB,IACAmd,EAAA,cACAsC,EAAAzf,OAAAA,GAGA2oU,EAAA5yc,OAAA,IACAonJ,EAAA,gBAAAwrT,EAAA5yc,QACA0pJ,EAAA0pT,YAAAR,GAGAlpT,0HCvEA,aAEA,MAAA4xD,EAAAhtR,EAAA,eACA0rP,EAAA1rP,EAAA,YAUAF,EAAAC,QAAA4nU,IACA,MAAA7uG,EAAAk0D,EAAA+rO,OAAApxL,EAAAx/F,OAAA,iBAgCA,OAxBApoF,eAAAooF,EAAAjsJ,GACA,MAAAz6E,EAAAy6E,EAAAz6E,IACAq3N,EAAA,UAAAr3N,GAEA,MAAAk6M,EAAAz/H,EAAAy/H,OAEA,IAAAA,EAAA,CACA,MAAAqhL,EAAA,sBAAA70J,EAAA7C,gBAGA,MADAxM,EAAA98I,MAAAghT,GACAtxI,EAAA,IAAAnmJ,MAAAy3R,GAAA,0BAGAr1D,EAAA2iN,qBAAA3uU,GAEAA,EAAAyvL,aAAA,IAAA5gS,KACA,MAAA+/a,EAAAv9P,EAAAk3P,YAAAvoU,EAAAl6M,KAKA,aAJAkmU,EAAAq0D,UAAAl+J,IAAAysT,EAAA5uU,EAAA0vJ,aAEA1jC,EAAA67M,MAAA7nU,EAAAwsB,GAEAjsJ,0EC3CA,aAEA,MAAA0oJ,EAAA5kO,EAAA,sBACA4wW,EAAA5wW,EAAA,iBACAgtR,EAAAhtR,EAAA,eASAF,EAAAC,QAAA4nU,IACA,MAAA7uG,EAAAk0D,EAAA+rO,OAAApxL,EAAAx/F,OAAA,iBAgCA,OAxBApoF,eAAAooF,EAAAjsJ,GAGA,IAAAooc,EAFAxrT,EAAA,SAIAwrT,EADA1/S,EAAA1oJ,EAAAz6E,IAAAkmU,EAAAx/F,OAAAz3I,IACA,CAAA,CACAA,GAAAi3O,EAAAx/F,OACA2lL,WAAAnmF,EAAAS,OAAA0lF,mBAGAnmF,EAAA0iN,oBAAAnuc,EAAAisJ,GAGA,MAAA/M,EAAA,IAAAw1I,EAAA10R,EAAA3I,KAAA,IAAA2xJ,WAAA,GAAAhpJ,EAAAstc,cAQA,OANAlF,EAAA5yc,OAAA,EACA0pJ,EAAA0pT,YAAAR,EAEAxrT,EAAA,8CAAAqP,EAAA7C,eAGAlK,4GC3CA,aAEA,MAAAJ,EAAAh7N,EAAA,QACA0rP,EAAA1rP,EAAA,YAEAgtR,EAAAhtR,EAAA,eAUAF,EAAAC,QAAA4nU,IACA,MAAA7uG,EAAAk0D,EAAA+rO,OAAApxL,EAAAx/F,OAAA,oBAqDA,OA9CApoF,eAAAooF,EAAAjsJ,GAGA,GAFA48I,EAAA,UAEA58I,EAAAz6E,KAAA,IAAAy6E,EAAAz6E,IAAAiwE,OACA,MAAAg6K,EAAA,IAAAnmJ,MAAA,eAAA,mBAIA,IAAA60H,EACA,IACAA,EAAA,IAAAY,EAAA9+I,EAAAz6E,KACA,MAAAykG,GACA,MAAA82R,EAAA,gBAAA92R,EAAA9f,UACA,MAAAslK,EAAA,IAAAnmJ,MAAAy3R,GAAA,mBA8BA,OA3BA9gT,EAAAqtc,cAAA1ohB,SAAA+3H,IAEA,GAAAA,EAAAloC,GAAA8zb,QAAAr8S,GAAA,CAKA,KAAAvvG,EAAAk1R,WAAAp8U,OAAA,GAOA,OAFAonJ,EAAA,yCAAAqP,EAAA7C,cAAAlL,EAAAoM,sBAAA5tG,EAAAk1R,WAAAj3U,KAAA8U,GAAAA,EAAAkf,cAEA88N,EAAA48M,QAAA3rZ,EAAAloC,SAAA,GAEAi3O,EAAA+lF,UAAAE,YAAAniU,IAAAmtC,EAAAloC,GAAAkoC,EAAAk1R,YACAnmF,EAAAm8M,UAAA0G,YAAApwT,EAAAxhG,EAAAloC,KATAooI,EAAA,6CAAAqP,EAAA7C,oBALAxM,EAAA,mCAAAlgG,EAAAloC,GAAA40I,cAAA6C,EAAA7C,kBAwBAqiG,EAAAm8M,UAAA0G,YAAApwT,EAAA+N,wFClEA,aAEA,MAAAnN,EAAAh7N,EAAA,QACA0rP,EAAA1rP,EAAA,YAEA4wW,EAAA5wW,EAAA,iBACAgtR,EAAAhtR,EAAA,eASAF,EAAAC,QAAA4nU,IACA,MAAA7uG,EAAAk0D,EAAA+rO,OAAApxL,EAAAx/F,OAAA,qBAuDA,OA/CApoF,eAAAooF,EAAAjsJ,GACA,IAAAk+I,EACA,IACAA,EAAA,IAAAY,EAAA9+I,EAAAz6E,KACA,MAAAykG,GACA,MAAAwlJ,EAAA,IAAAnmJ,MAAA,gBAAAW,EAAA9f,WAAA,mBAGA0yI,EAAA,KAAAsB,EAAAoM,uBACA,MAAAmkK,EAAA39G,EAAAk3P,YAAA9pT,EAAAgL,QAEA55I,EAAA0jT,EAAAo1I,SAAA9xW,QAAA2gD,IAAA,CACAw0G,EAAAq0D,UAAAxwS,IAAAm/S,GACAhjE,EAAAm8M,UAAA2G,aAAArwT,GACAutG,EAAA0iN,oBAAAnuc,EAAAisJ,KAGAohT,EAAAr6I,EAAAr4T,KAAAsxJ,IAAA,CACAz3I,GAAAy3I,EACA2lL,WAAA,OAEAg3H,EAAAR,EAAAztc,KAAAqC,IAAA,CACAwX,GAAAxX,EAAAwX,GACAo9T,WAAA,OAGAtiU,GACA+9b,EAAAhyc,KAAA,CACAmZ,GAAAi3O,EAAAx/F,OACA2lL,WAAA,KAIA,MAAA1yL,EAAA,IAAAw1I,EAAA10R,EAAA3I,KAAA2I,EAAAz6E,IAAAy6E,EAAAstc,cAWA,OATAD,EAAA73c,OAAA,IACA0pJ,EAAAmuT,cAAAA,GAGAzE,EAAApzc,OAAA,IACA0pJ,EAAA0pT,YAAAA,GAGAhsT,EAAA,kCAAAywT,EAAA73c,OAAAozc,EAAApzc,QACA0pJ,6GCpEA,aAEA,MAAA4xD,EAAAhtR,EAAA,eAUAF,EAAAC,QAAA4nU,IACA,MAAA7uG,EAAAk0D,EAAA+rO,OAAApxL,EAAAx/F,OAAA,YAaA,OALA,SAAAA,EAAAjsJ,GAEA,OADA48I,EAAA,UAAAqP,EAAA7C,eACAppJ,uDCvBA,aAEA,MAAAwvK,EAAA1rP,EAAA,YACAu0W,EAAAv0W,EAAA,aACA4kO,EAAA5kO,EAAA,sBACA8kO,EAAA9kO,EAAA,yBACA+ihB,EAAA/ihB,EAAA,iBACAk5E,EAAAl5E,EAAA,gBACA0qhB,EAAA1qhB,EAAA,YACAgtR,EAAAhtR,EAAA,YACA+qY,EAAAg4I,EAAAh4I,OAUAjrY,EAAAC,QAAA4nU,IAKA,MAAAgjN,EAAA5qY,MAAAt+I,EAAAsge,IACAp6J,EAAAq0D,UAAAl+J,IAAAkvD,EAAAk3P,YAAAzihB,GAAAsge,GAyDA,MAAA,CAOA6oD,UAAA,MAAAnphB,EAAAsge,IACA4oD,EAAAlphB,EAAAsge,GAWAz+d,UAAA7B,EAAAtB,EAAAiB,EAAA,IACAumU,EAAAo8M,KAAA,cAAAtihB,GAGA,MAAAk6M,QAAAqxE,EAAA06P,gBAAAjmhB,EAAAtB,SAGAwqhB,EAAAlphB,EAAAk6M,GAGA,IAAAkvU,EAAA,EACAC,EAAA,QAEA99P,EAAA66P,YAAAlgN,EAAAwqI,gBAAA1wc,EAAA,CAAAyiM,SAAA,KAAAnkD,MAAAwmS,IACA,IACAskG,GAAA,QACAljN,EAAAojN,gBAAAtphB,EAAAk6M,EAAA4qO,GACAukG,GAAA,EACA,MAAA5kb,GACAyhO,EAAAo8M,KAAA/nc,MAAA,iCAAAuqW,EAAA71V,GAAAwV,OAKA,MAAA8kb,EAAA5phB,EAAA4phB,UAAAH,EAEA,GAAAG,EAAAF,EAAA,CACA,MAAA9uc,EAAA0vK,EAAA,IAAAnmJ,MAAA,wCAAAulb,KAAAE,KAAA,4BAEA,MADArjN,EAAAo8M,KAAA/nc,MAAAA,GACAA,IAYA14E,UAAA7B,EAAAL,EAAA,IACAA,EAAAm2K,QAAAn2K,EAAAm2K,SAAAr+F,EAAAmvR,OAEA1gC,EAAAo8M,KAAA,UAAAtihB,GAEA,MAAA0kQ,QAAAwhE,EAAAkvF,QAAAp1Z,EAAAy3E,EAAAqvc,sBAAAnnhB,GACA6phB,EAAA9kR,EAAAtvL,KAAA06F,GAAAA,EAAAnrE,MACA,IAAAxyB,EAAA,EAEA,IACAA,EAAAmvc,EAAA73I,UAAAU,WAAAjkE,EAAAkkE,UAAApqY,EAAAwphB,GACA,MAAA/kb,GAEA,GAAA,4CAAAA,EAAApkG,KACA,MAAAokG,EAIA,MAAAglb,EAAAD,EAAAr3c,GAGA,GAFA+zP,EAAAo8M,KAAA,iBAAAtihB,EAAAyphB,IAEAA,EACA,MAAAx/R,EAAA,IAAAnmJ,MAAA,4BAAA,iBAKA,YAnHAw6C,OAAAt+I,EAAA0kQ,EAAA+kR,KACA,MAAAC,QAAAn+P,EAAA06P,gBAAAjmhB,EAAAyphB,GAEA,OAAA14W,QAAA2gD,IAAAgzC,EAAAtvL,KAAAkpE,MAAAwxB,IAEA,IAAAqzD,EAAArzD,EAAAnrE,IAAA8kb,GAKA,GAAAvjN,EAAA48M,QAAAhzW,EAAArb,MACA,UACAyxK,EAAAijN,UAAAnphB,EAAA0phB,GACA,MAAAjlb,GACAyhO,EAAAo8M,KAAA/nc,MAAA,+BAAAkqB,QAMA,UACAyhO,EAAAojN,gBAAAtphB,EAAA0phB,EAAA55W,EAAArb,MACA,MAAAhwD,GACAyhO,EAAAo8M,KAAA/nc,MAAA,gCAAAkqB,SA0FAklb,CAAA3phB,EAAA0kQ,EAAA+kR,GAEAA,GAWA5nhB,cAAA7B,EAAAwihB,EAAA7ihB,EAAA,IACAA,EAAAm2K,QAAAn2K,EAAAm2K,SAAAr+F,EAAAmvR,OAEA1gC,EAAAo8M,KAAA,kBAAAtihB,EAAAwihB,GAEA,MAAA99Q,EAAA,GACA,IAAAklR,EAEA,IACAA,OA3JAtrY,OAAAt+I,IACAkmU,EAAAo8M,KAAA,YAAAj/S,EAAArjO,EAAA,aAEA,MAAA80F,QAAAoxO,EAAAq0D,UAAA/tS,IAAA++L,EAAAk3P,YAAAzihB,IACAkmU,EAAAo8M,KAAA,SAAAj/S,EAAArjO,EAAA,gCAEA,MAAAsge,EAAAh3F,EAAAjgC,YAAAv0Q,GAIA,aAFAoxO,EAAA2iN,qBAAAvoD,GAEAA,GAiJAupD,CAAA7phB,GACA,MAAAykG,GACA,GAAA,IAAA+9a,EACA,MAAA/9a,EAWA,GAPAmlb,GACAllR,EAAA5uL,KAAA,CACA6uB,IAAAilb,EAAAlrhB,MACA+1J,KAAAyxK,EAAAx/F,SAIAg+B,EAAAz0L,QAAAuyc,EACA,OAAA99Q,EAGA,MAAAz1K,QAAAs8L,EAAAm3P,cAAA1ihB,GACA8phB,EAAA5jN,EAAAk8M,aAAAO,aAAA1zb,EAAAi3O,EAAA8iH,aAIA,GAFA9iH,EAAAo8M,KAAA,kBAAAwH,EAAA75c,QAEA,IAAA65c,EAAA75c,OAAA,CACA,MAAAsrT,EAAA,qDAGA,GADAr1D,EAAAo8M,KAAA/nc,MAAAghT,GACA,IAAA72H,EAAAz0L,OACA,MAAAg6K,EAAA,IAAAnmJ,MAAAy3R,GAAA,iCAEA,OAAA72H,EAGA,MAAAqlR,EAAArlR,EAAAz0L,OA+DA,MAAAyjI,EAAA,IAAAu1U,EAAA/iN,EAAAlmU,GAzDA,SAAAgqhB,EAAAhE,GAEA,MAAAF,EAAAv6P,EAAAu6P,SAAAtD,EAAAuH,EAAA/D,GACA,IAAAiE,EAAA,EAkDA,OA3CA3rY,eAAAwmS,GACA,IAAAw7C,EAAA7yF,EAAAy8I,EACA,IACA,MAAApjR,QAAAo/D,EAAAikN,iBAAArlG,EAAA9kb,GACAsge,EAAAx5N,EAAA5sD,OACAuzL,EAAA3mI,EAAA2mI,MACA,MAAAhpS,GAEA,GAAA,uBAAAA,EAAApkG,KACA,MAAAokG,EAEAylb,EAAAzlb,EAIA,MAAA1tB,EAAA,CACAssc,YAAA51I,GAwBA,OArBA6yF,GAAAA,EAAA5he,OACAgmQ,EAAA5uL,KAAA,CACA6uB,IAAA27X,EAAA5he,MACA+1J,KAAAqwR,IAGAmlG,KACAC,IACAxlR,EAAA5uL,KAAA,CACA2uB,IAAAylb,EACAz1X,KAAAqwR,IAGAmlG,KAIAA,GAAAnE,IACA/uc,EAAAqzc,cAAA,GAGArzc,MASA,UACA+7R,EAAAp/J,EAAAosB,IAAAgqT,GAAAnqhB,EAAAm2K,SACA,MAAArxE,GACA,GAAA,IAAAigK,EAAAz0L,OACA,MAAAw0B,EAEA,QACAivG,EAAAnoE,OAGA,OAAAm5H,2NC1SA,aAEA,MAAA3hC,EAAAxkO,EAAA,sBAAA+6N,UAEAiyD,EAAAhtR,EAAA,YACA8rhB,EAAA9rhB,EAAA,SA6HAF,EAAAC,QA7FA,MAUAuD,YAAAqkU,EAAAlmU,EAAAsqhB,GACAt/a,KAAAk7N,IAAAA,EACAl7N,KAAAhrG,IAAAA,EACAgrG,KAAAs/a,SAAAA,EACAt/a,KAAAs3a,KAAA/2P,EAAA+rO,OAAAtsZ,KAAAk7N,IAAAx/F,OAAA,SAAA3D,EAAAc,YAAA7jO,IAEAgrG,KAAAu/a,SAAA,EAEAv/a,KAAAw/a,SAAAx/a,KAAAw/a,SAAA7mb,KAAAqH,MACAA,KAAAy/a,YAAAz/a,KAAAy/a,YAAA9mb,KAAAqH,MAQAnpG,UAAA4rY,GACA,OAAAziS,KAAAk7N,IAAAq8M,cAAAgI,QAKA,IAAA98I,EAAAx9T,QACA+6B,KAAAs3a,KAAA/nc,MAAA,+BACA,CAAAmwc,SAAA,IAAA/gc,IAAAiwS,MAAA,MAGA5uR,KAAA2/a,KAAA,IAAAN,EAAAr/a,MAEAA,KAAAs3a,KAAA,wBAAAt3a,KAAAk7N,IAAA8iH,kBAAAh+U,KAAAk7N,IAAA+oC,kBAAAr+R,KAAAq0B,IAAA+F,KAAAk7N,IAAAi8M,cAAA10I,EAAAx9T,WACA+6B,KAAA2/a,KAAA/4T,KAAA,QAAA5mH,KAAAw/a,UACAx/a,KAAA2/a,KAAA/4T,KAAA,WAAA5mH,KAAAy/a,aAEAz/a,KAAA2/a,KAAAC,QAAAn9I,KAfAziS,KAAAs3a,KAAA/nc,MAAA,uCACA,CAAAmwc,SAAA,IAAA/gc,IAAAiwS,MAAA,KAoBA/3X,WACAmpG,KAAAu/a,SAAA,EACAv/a,KAAA6/a,WAAA9hb,KAAAunE,MACAtlE,KAAAs3a,KAAA,eAGAt3a,KAAAk7N,IAAAq8M,cAAAuI,aAAA9/a,MAMAnpG,cAEAmpG,KAAAugC,OAMA1pI,OACAmpG,KAAAs3a,KAAA,iBAAAv5a,KAAAunE,OAAAtlE,KAAA6/a,YAAA,QAEA7/a,KAAA2/a,MACA3/a,KAAAs3a,KAAA,GAAAt3a,KAAA2/a,KAAA5sZ,OAAA9tD,aAAA+6B,KAAA2/a,KAAAI,UAAA9ib,uBAAA+C,KAAA2/a,KAAA5sZ,OAAA9tD,OAAA+6B,KAAA2/a,KAAAI,UAAA9ib,KAAA,mBAGA+C,KAAAu/a,UAIAv/a,KAAAu/a,SAAA,EAEAv/a,KAAA2/a,OACA3/a,KAAA2/a,KAAAnqT,eAAA,QAAAx1H,KAAAw/a,UACAx/a,KAAA2/a,KAAAnqT,eAAA,WAAAx1H,KAAAy/a,aACAz/a,KAAA2/a,KAAAp/Y,QAGAvgC,KAAAk7N,IAAAq8M,cAAAyI,eAAAhgb,sGC9HA,aAEA,MAAAigb,EAAA1shB,EAAA,mCACA8xP,EAAA9xP,EAAA,UAEA2wW,EAAA3wW,EAAA,UACA2shB,EAAA3shB,EAAA,kBACAgtR,EAAAhtR,EAAA,YA6MAF,EAAAC,QApMA,cAAA+xP,EAMAxuP,YAAA6xM,GACAnjF,QAEAvlB,KAAA0oG,MAAAA,EAEA1oG,KAAAu/a,SAAA,EAGAv/a,KAAA67J,QAAA,GAGA77J,KAAA+/a,UAAA,IAAAphc,IAIAqhB,KAAA+yB,OAAA,GAKA/yB,KAAAmgb,aAAA,KAMAtphB,OACA,GAAAmpG,KAAAu/a,QAAA,CAIAv/a,KAAAu/a,SAAA,EACA,IAAA,MAAAxjR,KAAA/7J,KAAA67J,QACAE,EAAAx7H,QASA1pI,cAAA4rY,GAEA,MAAA7T,EAAA,GAGAosJ,EAAAp1c,KAAAq0B,IAAA+F,KAAA0oG,MAAAwyH,IAAAi8M,cAAA10I,EAAAx9T,QACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA6zc,EAAA7zc,IACAynT,EAAA9jT,KAAA,IAAAo5R,EAAAlkQ,KAAAA,KAAA0oG,MAAA42U,SAAAn4c,EAAA6zc,KAIAv4I,EAAAruY,SAAA,CAAA0lb,EAAA3yW,KACAynT,EAAAznT,EAAA6zc,GAAAoF,eAAAtmG,YAIA95U,KAAAqgb,aAAAzxJ,GAEA,MAAA7iT,EAAA,CAEA2zc,SAAA,IAAA/gc,IAAAqhB,KAAAmgb,cAAAngb,KAAAmgb,aAAA19I,OAGA7T,MAAA,IAIA,IAAA,MAAAj8X,KAAAi8X,EACAj8X,EAAAo5E,MAAAp5E,EAAAo5E,IAAAqzc,cAAAzshB,EAAAo5E,IAAAu0c,iBACA3thB,EAAAo5E,IAAAghT,SAAA,EACAhhT,EAAA6iT,MAAA9jT,KAAAn4E,EAAAo5E,MAIA,OAAAA,EASAl1E,mBAAA+3X,GACA5uR,KAAAu/a,SAAA,EAEAv/a,KAAA64E,KAAA,SACA,UACA9S,QAAA2gD,IAAAkoK,EAAAxkT,KAAAz3E,GAAAA,EAAAithB,aACA,QAEA5/a,KAAAugC,OAEAvgC,KAAA64E,KAAA,YAKA,GAAA74E,KAAA+yB,OAAA9tD,SAAA+6B,KAAA+/a,UAAA9ib,KACA,MAAA+C,KAAA+yB,OAAA,GAWAl8H,kBAAAlE,SACAqtG,KAAAg1B,aACAh1B,KAAAugb,YAAA5thB,GASAkE,kBAAAlE,GACA,MAAAopQ,EAAA,IAAAmkR,EAAAlgb,KAAA0oG,MAAAwyH,IAAAl7N,KAAArtG,EAAAqtG,KAAA0oG,MAAA4uU,MACAt3a,KAAA67J,QAAA/wL,KAAAixL,SACAA,EAAA6jR,UASA/ohB,aACAmpG,KAAAmgb,eAKAngb,KAAAwgb,0BACAxgb,KAAAwgb,qBAKAxgb,KAAAwgb,oBAAA,WACA,MAAAC,QAAAlgQ,EAAAm3P,cAAA13a,KAAA0oG,MAAA1zM,KACAgrG,KAAAmgb,aAAA,IAAAF,EAAAQ,EAAAzgb,KAAA0oG,MAAAwyH,IAAA8iH,cAFA,SAMAh+U,KAAAwgb,2BACAxgb,KAAAwgb,sBAWA3phB,uBAAAklQ,GAEA,GAAA/7J,KAAAmgb,cAAAngb,KAAAmgb,aAAAl7c,OAAA+6B,KAAAmgb,aAAA3lF,SACA,OAAA,EAMA,MAAA+kF,EAAA1hb,MAAA4rD,KAAAsyG,EAAA2kR,eAOA,SAHA1gb,KAAAmgb,qBAAAngb,KAAAmgb,aAAAQ,UAAApB,yJCxMA,aAGA,MAAA/F,EAAAjmhB,EAAA,gBACAgtR,EAAAhtR,EAAA,YACAgnhB,EAAAhnhB,EAAA,SACA4kO,EAAA5kO,EAAA,sBA0FAF,EAAAC,QAhFA,MAOAuD,YAAA+phB,EAAApmF,GACAx6V,KAAA4gb,aAAAA,EACA5gb,KAAAw6V,SAAAA,EAGAx6V,KAAA6gb,cAAA,GAMA57c,aACA,OAAA+6B,KAAA6gb,cAAA57c,OAMAw9T,YACA,OAAAziS,KAAA6gb,cAAAz2c,KAAA02c,GAAAA,EAAAplT,SAQA7kO,UAAA6kO,GACA,GAAA17H,KAAA6gb,cAAA1ic,MAAA2ic,GAAA3oT,EAAA2oT,EAAAplT,OAAAz3I,GAAAy3I,EAAAz3I,MACA,OAGA,MAAAw8b,QAAAlgQ,EAAAq4P,cAAAl9S,GACAxmO,EAAA,CACAwmO,OAAAA,EACA89S,SAAAA,EAAAx5a,KAAA4gb,aAAAH,IAGAzgb,KAAA6gb,cAAA/1c,KAAA51E,GACA8qG,KAAA6gb,cAAAz0b,MAAA,CAAAvlB,EAAAyS,IAAAkgc,EAAA1nN,QAAAjrP,EAAA2yc,SAAAlgc,EAAAkgc,YACAx5a,KAAA6gb,cAAA7gb,KAAA6gb,cAAAz7c,MAAA,EAAA46B,KAAAw6V,UASA3jc,gBAAAkqhB,GACA,IAAAA,EAAA97c,OACA,OAAA,EAGA,IAAA+6B,KAAA/6B,OACA,OAAA,EAGA,MAAA+7c,QAAAzG,EAAAwG,GAAArlT,GAAA6kD,EAAAq4P,cAAAl9S,KACAulT,EAAAjhb,KAAA6gb,cAAA7gb,KAAA6gb,cAAA57c,OAAA,GAAAu0c,SAEA,IAAA,MAAAiH,KAAAO,EAAA,CACA,MAAAE,EAAA1H,EAAAx5a,KAAA4gb,aAAAH,GAEA,GAAAjH,EAAA1nN,QAAAovN,EAAAD,GAAA,EACA,OAAA,EAIA,OAAA,wHC5FA,aAEA,MAAAE,EAAA5thB,EAAA,2BACAgtR,EAAAhtR,EAAA,YAkFAF,EAAAC,QAnEA,MAOAuD,YAAAi+N,EAAAssT,GAGA,GAFAphb,KAAA80H,IAAAA,EACA90H,KAAAohb,UAAA7gQ,EAAA48C,YAAAikN,EAlBA,MAmBAphb,KAAAohb,UAAA,MAAA,IAAAtob,MAAA,6CACA,GAAA,mBAAAkH,KAAAohb,UAAA,MAAA,IAAAtob,MAAA,wDAAAkH,KAAAohb,WAGAphb,KAAAqhb,aAAA,GAGArhb,KAAAshb,aAAA,KAGAthb,KAAAj0B,IAAA,KAQAl1E,eAAAijb,GACA95U,KAAAqhb,aAAAv2c,KAAAgvW,GAMAjjb,gBAEA,MAAAogL,QAAAkqW,EAAAI,QAAAvhb,KAAA80H,IAAApsB,MAAA1zM,KAEAgrG,KAAAshb,aAAArqW,QACAlR,QAAA2gD,IAAA1mH,KAAAqhb,aAAAj3c,KAAA0vW,GAAA95U,KAAAwhb,eAAA1nG,YACA95U,KAAA80H,IAAA2sT,YAAAzhb,MAQAnpG,qBAAAijb,GAEA95U,KAAA80H,IAAApsB,MAAAwyH,IAAA48M,QAAAh+F,IAMA95U,KAAA80H,IAAAirT,UAAAhhc,IAAA+6V,EAAAjhN,gBAIA74H,KAAAshb,oBACAthb,KAAAshb,aAAAl6K,QAAA0yE,uFChFA,aAGA,MAAA4nG,EAAAnuhB,EAAA,QAEAimhB,EAAAjmhB,EAAA,gBACA0wU,EAAA1wU,EAAA,SAEAgtR,EAAAhtR,EAAA,YAEA84N,EAAA43G,EAAA,yBAUA,MAAAk9M,EAOAtqhB,wBAAAotF,GACA,MAAAjvF,QAAAurR,EAAAq4P,cAAA30b,GAEA,OAAA,IAAAk9b,EAAAnshB,GASA6B,qBAAA8qhB,GACA,MAAA3shB,QAAAurR,EAAAm3P,cAAAiK,GAEA,OAAA,IAAAR,EAAAnshB,GAQA6B,YAAA4yJ,GACA4iE,EAAA,aAAA5iE,GACAzpD,KAAAypD,KAAAA,EACAzpD,KAAA46Q,KAAA,IAAA8mK,EAAAnhQ,EAAAs6P,YAQAhkhB,cAAAotF,GACAooI,EAAA,aAAApoI,EAAA40I,eACA,MAAA7jO,QAAAurR,EAAAq4P,cAAA30b,GAEA/uF,EAAA,CACA+uF,GAAAA,EACAu1b,SAAAA,EAAAx5a,KAAAypD,KAAAz0J,IAGAgrG,KAAA46Q,KAAA9vS,KAAA51E,GAQA2B,UACA,MAAA3B,EAAA8qG,KAAA46Q,KAAA38R,MAEA,OADAouI,EAAA,aAAAn3N,EAAA+uF,GAAA40I,eACA3jO,EAAA+uF,GAGAhf,aACA,OAAA+6B,KAAA46Q,KAAA39Q,QAIA5pG,EAAAC,QAAA6thB,oGCzFA9thB,EAAAC,QAAAC,EAAA,gFCEMmuhB,EAAME,EAAYn0a,EAAOo0a,EAASC,EAASC,EAAUC,EAAaC,EAAaC,EAAQjob,EAAKkob,EAAUC,EAAWC,EAAYC,EAAWC,EAwWlI9hc,EAAMqhF,EAtWhBr0D,EAAQ7nC,KAAK6nC,MAAOxT,EAAMr0B,KAAKq0B,IAO/B2nb,EAAa,SAASh0a,EAAGC,UACnBD,EAAIC,GACE,EAEND,EAAIC,EACC,EAEF,GAaTq0a,EAAS,SAASr7c,EAAG+mC,EAAG01I,EAAID,EAAIl8I,OAC1BqG,KACM,MAAN81I,IACFA,EAAK,GAEI,MAAPn8I,IACFA,EAAMy6a,GAEJt+R,EAAK,YACGxqJ,MAAM,+BAER,MAANuqJ,IACFA,EAAKx8K,EAAE5B,QAEFq+K,EAAKD,GAENl8I,EAAIyG,EAAG/mC,EADX2mC,EAAMC,GAAO61I,EAAKD,GAAM,KACH,EACnBA,EAAK71I,EAEL81I,EAAK91I,EAAM,WAGJ/iC,OAAO24H,MAAMv8H,EAAAA,CAAIy8K,EAAIA,EAAKA,GAAIzxJ,OAAO+b,IAAKA,GAQvDm0a,EAAW,SAAS7sT,EAAOj6H,EAAMkM,UACpB,MAAPA,IACFA,EAAMy6a,GAER1sT,EAAMpqJ,KAAKmwB,GACJqnb,EAAUptT,EAAO,EAAGA,EAAMjwJ,OAAS,EAAGkiC,IAQ/C26a,EAAU,SAAS5sT,EAAO/tH,OACpBq7a,EAASC,SACF,MAAPt7a,IACFA,EAAMy6a,GAERY,EAAUttT,EAAMj3I,MACZi3I,EAAMjwJ,QACRw9c,EAAavtT,EAAM,GACnBA,EAAM,GAAKstT,EACXD,EAAQrtT,EAAO,EAAG/tH,IAElBs7a,EAAaD,EAERC,GAeTR,EAAc,SAAS/sT,EAAOj6H,EAAMkM,OAC9Bs7a,SACO,MAAPt7a,IACFA,EAAMy6a,GAERa,EAAavtT,EAAM,GACnBA,EAAM,GAAKj6H,EACXsnb,EAAQrtT,EAAO,EAAG/tH,GACXs7a,GAQTT,EAAc,SAAS9sT,EAAOj6H,EAAMkM,OAC9ByqQ,SACO,MAAPzqQ,IACFA,EAAMy6a,GAEJ1sT,EAAMjwJ,QAAUkiC,EAAI+tH,EAAM,GAAIj6H,GAAQ,IACfA,GAAzB22Q,EAAAA,CAAQ18I,EAAM,GAAIj6H,IAAmB,GAAIi6H,EAAM,GAAK08I,EAAK,GACzD2wK,EAAQrtT,EAAO,EAAG/tH,IAEblM,GAQT4mb,EAAU,SAAS3sT,EAAO/tH,OACpBhgC,EAAG0/Z,EAAQlyJ,EAAY+tM,EAAOC,EAAUC,MACjC,MAAPz7a,IACFA,EAAMy6a,GAORe,EAAAA,GACK97C,EAAK,EAAGlyJ,GANb+tM,EAAAA,WACEE,EAAAA,WACSC,EAAK,EAAGjxK,EAAOnkQ,EAAMynH,EAAMjwJ,OAAS,GAAI,GAAK2sS,EAAOixK,EAAKjxK,EAAOixK,EAAKjxK,EAAM,GAAKA,EAAOixK,IAAOA,IAAOD,EAAU93c,KAAK+3c,UACtHD,GACNx/U,MAAMpjG,MAAMkgH,WAEWj7I,OAAQ4ha,EAAKlyJ,EAAMkyJ,IAC3C1/Z,EAAIu7c,EAAM77C,GACV87C,EAAS73c,KAAKy3c,EAAQrtT,EAAO/tJ,EAAGggC,WAE3Bw7a,GASTN,EAAa,SAASntT,EAAOj6H,EAAMkM,OAC7BvvB,KACO,MAAPuvB,IACFA,EAAMy6a,IAGK,KADbhqc,EAAMs9I,EAAM1pJ,QAAQyvB,WAIpBqnb,EAAUptT,EAAO,EAAGt9I,EAAKuvB,GAClBo7a,EAAQrtT,EAAOt9I,EAAKuvB,IAQ7Bg7a,EAAW,SAASjtT,EAAOjhO,EAAGkzG,OACxBwsD,EAAM/oF,EAAQi8Z,EAAIlyJ,EAAMi9B,KACjB,MAAPzqQ,IACFA,EAAMy6a,KAERh3c,EAASsqJ,EAAM9vJ,MAAM,EAAGnxE,IACZgxE,cACH2F,MAETi3c,EAAQj3c,EAAQu8B,GAEX0/X,EAAK,EAAGlyJ,GADbi9B,EAAO18I,EAAM9vJ,MAAMnxE,IACMgxE,OAAQ4ha,EAAKlyJ,EAAMkyJ,IAC1ClzU,EAAOi+M,EAAKi1H,GACZm7C,EAAYp3c,EAAQ+oF,EAAMxsD,UAErBv8B,EAAOwhB,KAAK+a,GAAK+4G,WAQ1BkiU,EAAY,SAASltT,EAAOjhO,EAAGkzG,OACzBwsD,EAASmvX,EAAKl4c,EAAQi8Z,EAAIg8C,EAAIluM,EAAMi9B,EAAM8wK,EAAOC,KAC1C,MAAPx7a,IACFA,EAAMy6a,GAEA,GAAJ3thB,GAAUihO,EAAMjwJ,OAAAA,MAClB2F,EAASsqJ,EAAM9vJ,MAAM,EAAGnxE,GAAGm4F,KAAK+a,IACpBliC,cACH2F,MAETk4c,EAAMl4c,EAAOA,EAAO3F,OAAS,GAExB4ha,EAAK,EAAGlyJ,GADbi9B,EAAO18I,EAAM9vJ,MAAMnxE,IACMgxE,OAAQ4ha,EAAKlyJ,EAAMkyJ,IAEtC1/X,EADJwsD,EAAOi+M,EAAKi1H,GACEi8C,GAAO,IACnBZ,EAAOt3c,EAAQ+oF,EAAM,EAAG,KAAMxsD,GAC9Bv8B,EAAOqT,MACP6kc,EAAMl4c,EAAOA,EAAO3F,OAAS,WAG1B2F,MAETi3c,EAAQ3sT,EAAO/tH,GACfw7a,EAAAA,GACSE,EAAK,EAAGH,EAAQzob,EAAIhmG,EAAGihO,EAAMjwJ,QAAS,GAAKy9c,EAAQG,EAAKH,EAAQG,EAAKH,EAAW,GAAKA,IAAUG,IAAOA,EAC7GF,EAAS73c,KAAKg3c,EAAQ5sT,EAAO/tH,WAExBw7a,GAGTL,EAAY,SAASptT,EAAO6tT,EAAUnrc,EAAKuvB,OACrC67a,EAASv8c,EAAQw8c,MACV,MAAP97a,IACFA,EAAMy6a,GAERoB,EAAU9tT,EAAMt9I,GACTA,EAAMmrc,GAGP57a,EAAI67a,EADRv8c,EAASyuJ,EADT+tT,EAAarrc,EAAM,GAAM,IAEE,GACzBs9I,EAAMt9I,GAAOnR,EACbmR,EAAMqrc,SAKH/tT,EAAMt9I,GAAOorc,GAGtBT,EAAU,SAASrtT,EAAOt9I,EAAKuvB,OACzB+7a,EAAUC,EAAQH,EAASI,EAAUL,MAC9B,MAAP57a,IACFA,EAAMy6a,GAERuB,EAASjuT,EAAMjwJ,OACf89c,EAAWnrc,EACXorc,EAAU9tT,EAAMt9I,GAChBsrc,EAAW,EAAItrc,EAAM,EACdsrc,EAAWC,IAChBC,EAAWF,EAAW,GACPC,KAAYh8a,EAAI+tH,EAAMguT,GAAWhuT,EAAMkuT,IAAa,KACjEF,EAAWE,GAEbluT,EAAMt9I,GAAOs9I,EAAMguT,GAEnBA,EAAW,GADXtrc,EAAMsrc,GACe,SAEvBhuT,EAAMt9I,GAAOorc,EACNV,EAAUptT,EAAO6tT,EAAUnrc,EAAKuvB,IAGzCu6a,EAAAA,WAiBE,SAAAA,EAAcv6a,GACZnH,KAAKmH,IAAa,MAAPA,EAAcA,EAAMy6a,EAC/B5hb,KAAKhkB,MAAAA,UAlBP0lc,EAAK52c,KAAOi3c,EAEZL,EAAKzjc,IAAM6jc,EAEXJ,EAAKxoc,QAAU+oc,EAEfP,EAAK2B,QAAUrB,EAEfN,EAAKG,QAAUA,EAEfH,EAAKW,WAAaA,EAElBX,EAAKS,SAAWA,EAEhBT,EAAKU,UAAYA,EAOjBV,EAAK/jb,UAAU7yB,KAAO,SAAS8iC,UACtBm0a,EAAS/hb,KAAKhkB,MAAO4xB,EAAG5N,KAAKmH,MAGtCu6a,EAAK/jb,UAAU1f,IAAM,kBACZ6jc,EAAQ9hb,KAAKhkB,MAAOgkB,KAAKmH,MAGlCu6a,EAAK/jb,UAAUkgT,KAAO,kBACb79S,KAAKhkB,MAAM,IAGpB0lc,EAAK/jb,UAAU0zP,SAAW,SAASzjP,UACC,IAA3B5N,KAAKhkB,MAAMxQ,QAAQoiC,IAG5B8za,EAAK/jb,UAAUzkB,QAAU,SAAS00B,UACzBq0a,EAAYjib,KAAKhkB,MAAO4xB,EAAG5N,KAAKmH,MAGzCu6a,EAAK/jb,UAAU0lb,QAAU,SAASz1a,UACzBo0a,EAAYhib,KAAKhkB,MAAO4xB,EAAG5N,KAAKmH,MAGzCu6a,EAAK/jb,UAAUkkb,QAAU,kBAChBA,EAAQ7hb,KAAKhkB,MAAOgkB,KAAKmH,MAGlCu6a,EAAK/jb,UAAU0kb,WAAa,SAASz0a,UAC5By0a,EAAWrib,KAAKhkB,MAAO4xB,EAAG5N,KAAKmH,MAGxCu6a,EAAK/jb,UAAUyvD,MAAQ,kBACdptD,KAAKhkB,MAAAA,IAGd0lc,EAAK/jb,UAAUkyB,MAAQ,kBACQ,IAAtB7vB,KAAKhkB,MAAM/W,QAGpBy8c,EAAK/jb,UAAUV,KAAO,kBACb+C,KAAKhkB,MAAM/W,QAGpBy8c,EAAK/jb,UAAU03B,MAAQ,eACjBulP,SACJA,EAAAA,IAAW8mK,GACN1lc,MAAQgkB,KAAKhkB,MAAM5W,MAAM,GACvBw1S,GAGT8mK,EAAK/jb,UAAUwF,QAAU,kBAChBnD,KAAKhkB,MAAM5W,MAAM,IAG1Bs8c,EAAK/jb,UAAUylE,OAASs+W,EAAK/jb,UAAU7yB,KAEvC42c,EAAK/jb,UAAUwwE,IAAMuzW,EAAK/jb,UAAUkgT,KAEpC6jI,EAAK/jb,UAAUisP,MAAQ83L,EAAK/jb,UAAUkgT,KAEtC6jI,EAAK/jb,UAAU5e,IAAM2ic,EAAK/jb,UAAU0zP,SAEpCqwL,EAAK/jb,UAAU1gG,KAAOykhB,EAAK/jb,UAAU03B,MAE9BqsZ,EAvFTA,GA2FUjhc,EAQPuf,KARa8hE,EAQP,kBACA4/W,GANuB,iBAAZpuhB,EACTD,EAAOC,QAAUwuK,IAEjBrhF,EAAKihc,KAAO5/W,MAMtBlkE,KAAKoC,oCCtXR,aAEA,MAAA7sG,QAAAgyZ,GAAA5xZ,EAAA,WAmSAF,EAAAC,QA7RA,MASAuD,YAAAqkU,EAAApmG,EAAAniO,EAAA05N,GACArsH,KAAAk7N,IAAAA,EACAl7N,KAAA80H,IAAAA,EACA90H,KAAArtG,KAAAA,EACAqtG,KAAAqsH,IAAAA,EAEArsH,KAAAikQ,YAAAjkQ,KAAAk7N,IAAA+oC,YACAjkQ,KAAAi3E,MAAAj3E,KAAAsjb,aAKAtjb,KAAAujb,UAAA,KAGAvjb,KAAA0gb,cAAA,IAAA/hc,IAQA9nF,aACA,MAAAy3G,EAAA,IAAA62S,EAAA,CACAlhD,YAAAjkQ,KAAAikQ,cAsBA,OAlBA31P,EAAAtgC,GAAA,QAAA,KACAgyB,KAAArtG,KAAA2uhB,eAAAthb,KAAArtG,KAAA2uhB,aAAAr8c,SACA+6B,KAAAqsH,IAAA,eACArsH,KAAAugC,WAKAjyB,EAAAtgC,GAAA,QAAA,KACAgyB,KAAAu/a,SAIAjxa,EAAA64I,QAAAnnJ,KAAAikQ,aACAjkQ,KAAAwxL,UAIAljL,EASAz3G,KAAA4iG,GACAuG,KAAAu/a,UAIAv/a,KAAAu/a,SAAA,EACAv/a,KAAAi3E,MAAA7pB,QACAptD,KAAAqsH,IAAA,wCAAArsH,KAAA80H,IAAA+mC,QAAA9tL,QAAA02I,GAAAA,EAAA86T,UAAAt6c,QAEA+6B,KAAAujb,YACA9pb,EACAuG,KAAAujb,UAAAhkV,OAAA9lG,GAEAuG,KAAAujb,UAAAv9W,YAWAnvK,gBACAmpG,KAAAu/a,SAAA,EAEAv/a,KAAAujb,UAAA,KACA,MAAAC,EAAA,IAAAz9W,SAAA,CAAAC,EAAAu5B,KACAv/F,KAAAujb,UAAA,CACAv9W,QAAAA,EAAAu5B,OAAAA,MAIAv/F,KAAAwxL,aAEAgyP,EAWA3shB,OACA,GAAAmpG,KAAArtG,KAAA2uhB,aAOA,KAAAthb,KAAAi3E,MAAAkwE,QAAAnnJ,KAAAi3E,MAAAh6E,KAAA+C,KAAAikQ,aAAAjkQ,KAAArtG,KAAA2uhB,aAAAr8c,OAAA,GAAA,CACA,MAAA60W,EAAA95U,KAAArtG,KAAA2uhB,aAAAt6K,UAGAhnQ,KAAA0gb,cAAA1hc,IAAA86V,GAEA95U,KAAAi3E,MAAAj4F,KACA,IACAghB,KAAAyjb,YAAA3pG,GACA57U,OAAAzE,IACAuG,KAAAqsH,IAAA98I,MAAA,QAAAkqB,GACAuG,KAAAugC,KAAA9mC,MAEAosT,SAAA,KACA7lT,KAAA0gb,cAAAj9b,OAAAq2V,SAYAjjb,kBAAAijb,GACA,IAAA95U,KAAAu/a,QACA,OAKA,GAAAv/a,KAAA80H,IAAAirT,UAAAhhc,IAAA+6V,EAAAjhN,eACA,OAIA,IAAA6qT,EAAAC,EAgCA76Z,EAAA86Z,EA/BA,IACAF,QAAA1jb,KAAA80H,IAAA4uT,iBAAA1jb,MACA,MAAAvG,GACAkqb,EAAAlqb,EAIA,GAAAuG,KAAAu/a,QAAA,CAIA,GAAAoE,EACA,MAAAA,EAMA,GAAAD,GAMA,IAAA1jb,KAAA80H,IAAAirT,UAAAhhc,IAAA+6V,EAAAjhN,eAAA,CAGA74H,KAAA80H,IAAAirT,UAAA/gc,IAAA86V,EAAAjhN,eAGA74H,KAAAqsH,IAAA,cAEA,IACAvjG,QAAA9oB,KAAA6jb,UAAA/pG,GACA,MAAArgV,GACAmqb,EAAAnqb,EAIA,GAAAuG,KAAAu/a,QAAA,CAMA,GAFAv/a,KAAAqsH,IAAA,kBAAAu3T,EAAA96Z,GAEA86Z,EACA,MAAAA,EAMA,GAAA96Z,GAAAA,EAAAw3Z,cAGA,OAFAtgb,KAAAqsH,IAAA,uBACArsH,KAAA80H,IAAAv0F,OAMAzX,GAAAA,EAAAs2Z,cACAp/a,KAAAugC,cA1CAvgC,KAAAugC,QAmDA1pI,gBAAAijb,GACA,IAAA/tW,EAAA+3c,EACA,IACA/3c,QAAAi0B,KAAArtG,KAAAyuhB,UAAAtnG,GACA,MAAArgV,GACAqqb,EAAArqb,EAIA,GAAAuG,KAAAu/a,QAIA,GAAAuE,EACA9jb,KAAA80H,IAAA/hG,OAAAjoD,KAAAg5c,QAOA,GAFA9jb,KAAA80H,IAAAqrT,oBAAAngb,KAAA80H,IAAAqrT,aAAAnhc,IAAA86V,GAEA/tW,EAAA,CAMA,GAAAA,EAAAqzc,cAAArzc,EAAAu0c,cAGA,OAFAtgb,KAAArtG,KAAAo5E,IAAAA,EAEA,CACAqzc,aAAArzc,EAAAqzc,aACAkB,cAAAv0c,EAAAu0c,eAKA,GAAAv0c,EAAAssc,aAAAtsc,EAAAssc,YAAApzc,OAAA,EAAA,CAIA,MAAA8+c,EAAAzwY,MAAAukY,IAEA73a,KAAAk7N,IAAA48M,QAAAD,EAAA5zb,MAIA+b,KAAAk7N,IAAAiyK,gBAAA0qC,EAAA5zb,GAAA4zb,EAAAx2H,kBACArhT,KAAArtG,KAAA6uhB,eAAA3J,EAAA5zb,YAGA8hF,QAAA2gD,IAAA36I,EAAAssc,YAAAjuc,IAAA25c,uDChSA,aAEA,MAAA9kS,EAAA1rP,EAAA,YACAu0W,EAAAv0W,EAAA,aAEAk5E,EAAAl5E,EAAA,gBACAywhB,EAAAzwhB,EAAA,kCACA4wW,EAAA5wW,EAAA,cACA0qhB,EAAA1qhB,EAAA,YACAgtR,EAAAhtR,EAAA,YAWAF,EAAAC,QAAA4nU,IAcA,CAMArkU,cAAA7B,GACAkmU,EAAAo8M,KAAA,YAAAtihB,KAGA,MAAA+9H,EAAA,SAGAmoM,EAAAm8M,UAAA0G,YAAA/ohB,EAAAkmU,EAAAx/F,QAEA,MAAA2lL,EAAAnmF,EAAAS,OAAAT,EAAAS,OAAA0lF,WAAA,GACA5xU,EAAA,IAAA00R,EAAAA,EAAA2iI,MAAAy2C,aAAAvohB,EAAA2jO,MAAA,GAqBA,GApBAlpJ,EAAAqtc,cAAA,CAAA,CACA74b,GAAAi3O,EAAAx/F,OACA2lL,WAAAA,UAgBA9gI,EAAA66P,YAAAlgN,EAAAwqI,gBAAA1wc,EAAA2jO,QAVArlF,eAAAwmS,GACA5+G,EAAAo8M,KAAA,eAAAtihB,QAAA8kb,EAAAjhN,iBACA,UACAqiG,EAAAhB,QAAAg0M,YAAAp0F,EAAArqW,GACA,MAAAgqB,GACAs5B,EAAAjoD,KAAA2uB,OAOAs5B,EAAA9tD,OAKA,MAAAg6K,EAAA,IAAAnmJ,MAAA,wBAAAi6B,EAAA9tD,aAAAi2P,EAAA8iH,qBAAA,2BAAA,CAAAjrT,OAAAA,KAaAl8H,oBAAA7B,EAAAL,EAAA,CAAAm2K,QAAA,IAAAo7R,gBAAA,IACA,MAAA+9E,EAAAtvhB,EAAAm2K,SAAAr+F,EAAAmvR,OACA3nW,EAAAU,EAAAuxc,iBAAAz5X,EAAAmjM,EAEAsrD,EAAAo8M,KAAA,iBAAAtihB,KAEA,MAAA+rI,EAAA,IAAAijZ,EAAA/vhB,GAsBA,UArBAinU,EAAAm8M,UAAA2G,aAAAhphB,IAGAZ,SAAA6vF,IACA,MAAAopW,EAAAnyH,EAAA+lF,UAAAz/T,IAAAyC,GAEAopW,EACAtsT,EAAAj2D,KAAA,CACAmZ,GAAAopW,EAAAppW,GACAo9T,WAAAgsC,EAAAzwH,UACAxyP,KAAA8zO,GAAAA,EAAAhwF,cAGAntF,EAAAj2D,KAAA,CACAmZ,GAAAA,EACAo9T,WAAA,QAMAtgR,EAAA97D,QAAAhxE,EAAA,CAEA,IAAA,MAAAiwhB,KAAAnjZ,EAAA59B,gBACA+gb,EAEA,OAKA,MAAAt1J,EAAA,GAyCA,MAAAlmL,EAAA,IAAAu1U,EAAA/iN,EAAAlmU,EAAA2jO,OAlCA,SAAAqmT,EAAAhE,GAEA,MAAAF,EAAAv6P,EAAAu6P,SAAA7mhB,EAAA8sI,EAAA97D,OAAA+1c,GACAmJ,EAAA,IAAAH,EAAAlJ,GA4BA,OA3BAlsJ,EAAA9jT,KAAAq5c,GAOA7wY,eAAAwmS,GACA,MAAArqW,OArHA6jE,OAAAwmS,EAAA9kb,KACA,MAAAy6E,EAAA,IAAA00R,EAAAA,EAAA2iI,MAAA02C,cAAAxohB,EAAA2jO,MAAA,GACA,OAAAuiG,EAAAhB,QAAAi+M,YAAAr+F,EAAArqW,IAmHA20c,CAAAtqG,EAAA9kb,GACAqvhB,EAAA50c,EAAAqtc,cAUA,OATA5hN,EAAAo8M,KAAA,SAAA+M,EAAAp/c,+BAAAjwE,KAEAqvhB,EAAAjwhB,SAAAkwhB,IACAH,EAAAr5c,KAAA,IACAw5c,OAKAH,EAAAl/c,QAAA61c,EACA,CAAAsE,cAAA,GAIA,CAAA/G,YAAA5oc,EAAA4oc,iBAOA51I,EAAAvnE,EAAAk8M,aAAAO,aAAA3ihB,EAAA2jO,MAAAuiG,EAAA8iH,aAEA,UACAl2E,EACAp/J,EAAAosB,IAAA2tK,GACAwhJ,GAEA,MAAAxqb,GACA,GAAAA,EAAA5mG,OAAAi1W,EAAA/4I,aAAAl8N,KACA,MAAA4mG,EAEA,QACAivG,EAAAnoE,OAIAquP,EAAAx6X,SAAAzB,IACAA,EAAAwwG,UAAA/uG,SAAA0lb,IACA/4S,EAAAj2D,KAAAgvW,SAIA,IAAA,MAAAoqG,KAAAnjZ,EAAA59B,gBACA+gb,oMChMA,aAEA,MAAAK,EAAAhxhB,EAAA,KAkCAF,EAAAC,QAzBA,cAAAixhB,EAMA1thB,YAAAk+T,GACAxvM,QACAvlB,KAAA+0N,MAAAA,EAQAl+T,KAAAw2b,GACA,OAAArtV,KAAA/6B,OAAA+6B,KAAA+0N,OACAxvM,MAAAz6C,KAAAuiX,4CC7BA,aA+DAh6b,EAAAC,QArDA,MACAuD,cAEAmpG,KAAAtc,KAAA,GAQA7sF,KAAAw2b,GACA,OAAArtV,KAAAjhB,IAAAsuW,EAAAppW,MACA+b,KAAAtc,KAAA5Y,KAAAuiX,IAEA,GAWAx2b,IAAA6kO,GACA,MAAAp+I,EAAA0iB,KAAAtc,KAAAvF,MAAAhX,GAAAA,EAAA8c,GAAA+1I,OAAA0B,KACA,OAAAr+I,QAAAC,GAMAzmF,UACA,OAAAmpG,KAAAtc,KAAAte,QAMAvuE,MACA,OAAAmpG,KAAAtc,KAAAzF,MAMAhZ,aACA,OAAA+6B,KAAAtc,KAAAze,uCC3DA,aAEA,MAAAg6K,EAAA1rP,EAAA,YACAu0W,EAAAv0W,EAAA,aAEAw6N,EAAAx6N,EAAA,WACAy6N,EAAAz6N,EAAA,iBACA8kO,EAAA9kO,EAAA,yBAEAk5E,EAAAl5E,EAAA,gBACA4wW,EAAA5wW,EAAA,cACA0qhB,EAAA1qhB,EAAA,YAEAgtR,EAAAhtR,EAAA,YASAF,EAAAC,QAAA4nU,IAOA,MAsDAspN,EAAAlxY,MAAAwmS,IACA,MAAAxlD,EAAA/zG,EAAAi6P,gBAAA1gG,GACArqW,OAlCA6jE,OAAAwmS,EAAA9kb,KACA,MAAAy6E,EAAA,IAAA00R,EAAAA,EAAA2iI,MAAAyxC,UAAAvjhB,EAAA,GACA,OAAAkmU,EAAAhB,QAAAi+M,YAAAr+F,EAAArqW,IAgCAg1c,CAAA3qG,EAAAxlD,GAEA,IAAA7kT,EAAAy/H,SAAAz/H,EAAAy/H,OAAAx7M,MACA,MAAAurP,EAAA,IAAAnmJ,MAAA,4CAAAghV,EAAAjhN,iBAAA,sBAGA,MAAA6rT,QAAA32T,EAAA+M,iBAAArrJ,EAAAy/H,OAAAx7M,OAGA,IAAAgxhB,EAAA1qT,OAAA8/M,GACA,MAAA76L,EAAA,IAAAnmJ,MAAA,gCAAA,oCAGA,OAAA4rb,EAAAlsT,QAGA,MAAA,CASA3hO,sBAAAijb,EAAA1uQ,GACA8vJ,EAAAo8M,KAAA,oBAAAx9F,EAAAjhN,eACA,MAAAppJ,EAAA,IAAA00R,EAAAA,EAAA2iI,MAAAw2C,UAAAlyW,EAAAnnF,GAAA,GAEA,OAAAi3O,EAAAhB,QAAAi+M,YAAAr+F,EAAArqW,IAWA54E,eAAAotF,EAAAtvF,EAAA,CAAAm2K,QAAA,MACAn2K,EAAAm2K,QAAAn2K,EAAAm2K,SAAAr+F,EAAAmvR,OACA1gC,EAAAo8M,KAAA,cAAArzb,EAAA40I,eAGA,MAAA1sG,OArGAmnB,OAAAwmS,IACA5+G,EAAAo8M,KAAA,iBAAAx9F,EAAAjhN,iBACA,MAAA3xJ,QAAAg0P,EAAAk8M,aAAAj5b,KAAA27V,GAEAuT,EAAAnmX,GAAAg0P,EAAA+lF,UAAAz/T,IAAAta,GAEA,GAAAmmX,EACA,MAAA,CACAppW,GAAAopW,EAAAppW,GACAo9T,WAAAgsC,EAAAzwH,UAAAxyP,KAAA8zO,GAAAA,EAAAhwF,cA4FAy2T,CAAA1gc,GAGA,GAAA,MAAAkoC,EAEA,OADA+uM,EAAAo8M,KAAA,eACAnrZ,EAGA,MAAAn3H,QAAAurR,EAAAq4P,cAAA30b,GACAw+S,EAAAvnE,EAAAk8M,aAAAO,aAAA3ihB,EAAAkmU,EAAA8iH,aAEA,GAAA,IAAAv7C,EAAAx9T,OACA,MAAAg6K,EAAA,IAAAnmJ,MAAA,sBAAA,qBAKA,GADA2pS,EAAAtkT,MAAAjX,GAAAA,EAAA6wc,QAAA9zb,KACA,CACA,MAAA61V,EAAA5+G,EAAA+lF,UAAAz/T,IAAAyC,GAEA,GAAA61V,EAEA,OADA5+G,EAAAo8M,KAAA,sBACA,CACArzb,GAAA61V,EAAA71V,GACAo9T,WAAAy4B,EAAAl9G,UAAAxyP,KAAA8zO,GAAAA,EAAAhwF,aAMA,MAAAxlB,EAAA,IAAAu1U,EAAA/iN,EAAAj3O,EAAAA,IAAA,IAOAqvD,MAAAwmS,IACA,MAAArqW,QAAAuwB,KAAA4kb,gBAAA9qG,EAAA71V,GACA3G,EAAA7N,EAAA4oc,YAAAl6b,MAAAjX,GAAAA,EAAA+c,GAAA8zb,QAAA9zb,KAGA,OAAA3G,EACA,CACAw8V,KAAAx8V,EACAgjc,eAAA,GAIA,CACAjI,YAAA5oc,EAAA4oc,gBAOA,IAAAztc,EACA,IACAA,QAAAk9R,EAAAp/J,EAAAosB,IAAA2tK,GAAA9tY,EAAAm2K,SACA,QACA49B,EAAAnoE,OAGA,IAAAwsP,GAAA,EASA,GARAniT,EAAAgkT,MAAAx6X,SAAAw2E,IACAA,EAAAmiT,SAAAniT,EAAAkvW,OACA/sD,GAAA,EACA7xD,EAAA+lF,UAAAE,YAAAniU,IAAApU,EAAAkvW,KAAA71V,GAAArZ,EAAAkvW,KAAAz4B,gBAGAnmF,EAAAo8M,KAAA,kBAAArzb,EAAA40I,cAAAk0J,IAEAA,EACA,MAAA9tI,EAAA,IAAAnmJ,MAAA,iBAAA,iBAGA,MAAAu0V,EAAAnyH,EAAA+lF,UAAAz/T,IAAAyC,GAEA,IAAAopW,EACA,MAAApuM,EAAA,IAAAnmJ,MAAA,+BAAA,iBAGA,MAAA,CACA7U,GAAAopW,EAAAppW,GACAo9T,WAAAgsC,EAAAzwH,UAAAxyP,KAAA8zO,GAAAA,EAAAhwF,cAYAr3N,sBAAA7B,EAAAL,EAAA,CAAA8iM,SAAA,IACAyjI,EAAAo8M,KAAA,wBAAAtihB,GAEA,MAAAivF,QAAAs8L,EAAAm3P,cAAA1ihB,GACA6vhB,EAAA3pN,EAAAk8M,aAAAO,aAAA1zb,EAAAi3O,EAAA8iH,aAEA1vU,EAAA,IAAA2va,EAAA/iN,EAAAlmU,GAAA,IAIAs+I,MAAAwmS,IAGA,CACAu+F,iBAhLA/kY,OAAAt+I,EAAA8kb,KACA5+G,EAAAo8M,KAAA,qBAAAj/S,EAAArjO,EAAA,kBAAA8kb,EAAAjhN,wBACAqiG,EAAAsoI,YAAAohF,gBAAA9qG,EAAA,IAAA/rN,EAAA/4N,KAEAqjhB,YACAtqc,QAAAs/W,IAAAnyH,EAAA48M,QAAAzqF,EAAAppW,MACA7Z,KAAAijX,IACAnyH,EAAA+lF,UAAAE,YAAAniU,IAAAquW,EAAAppW,GAAAopW,EAAAhsC,YAEAgsC,MAoKAy3F,CAAA9vhB,EAAA8kb,GAIAslG,eAAAzqhB,EAAA8iM,cAAA/hM,MAKAq2E,QAAAuiC,EAAAwmH,IAAA+vT,GACA,IAAA94c,IAAAA,EAAA2zc,SACA,MAAA,GAGA,MAAAqF,QAAAxkQ,EAAAq6P,iBAAA/8a,MAAA4rD,KAAA19E,EAAA2zc,UAAAz7b,GAEA,IAAA,MAAA+gc,KAAAD,EAAA3/c,MAAA,EAAA81P,EAAA8iH,mBACAgnG,GASAnuhB,mBAAAijb,GACA5+G,EAAAo8M,KAAA,kBAAAx9F,EAAAjhN,eAGA,MAAAw0N,EAAAnyH,EAAA+lF,UAAAz/T,IAAAs4V,GAEA,GAAAuT,GAAAA,EAAAppW,GAAAu0I,OAEA,OADA0iG,EAAAo8M,KAAA,kCACAjqF,EAAAppW,GAAAu0I,OAIA,IAAAurD,EAEA,IACAA,QAAAygQ,EAAA1qG,GACA,MAAArgV,GAEA,MAAA66R,EAAA/zG,EAAAi6P,gBAAA1gG,GACApmb,QAAAwnU,EAAA15O,IAAA8yS,GACAvwG,EAAA/1D,EAAA75N,KAAA8kO,mBAAAvlO,GAGA,MAAAgoO,EAAA,IAAA3N,EAAA+rN,EAAA71V,QAAAvuF,EAAAquR,GACAu9J,GAAA+L,GAAAA,EAAAzwH,WAAA,IAAAxyP,KAAA8zO,GAAAA,EAAAhwF,YAIA,OAHAgtG,EAAA+lF,UAAAE,YAAAniU,IAAA08I,EAAA4lN,GACApmH,EAAA+lF,UAAAC,QAAAz/T,IAAAi6I,EAAAqoD,GAEAA,qOCpSA,aAEA,MAAA//L,EAAAzwF,EAAA,WAEAooO,EAAApoO,EAAA,UACAw6N,EAAAx6N,EAAA,YACAspU,IAAAA,GAAAtpU,EAAA,wBACAJ,QAAAgyZ,GAAA5xZ,EAAA,WACAk5E,EAAAl5E,EAAA,eACAgtR,EAAAhtR,EAAA,WAiNA,SAAA0xhB,EAAAt3T,GAEA,OADAA,EAAA,iBAAAA,EAAAA,EAAA4yD,EAAAy8G,aAAArvK,EAAAgL,OACAlsJ,EAAAgvc,qBAAA9tT,EA4BA,SAAAu3T,EAAAlwhB,GACA,MAAAixG,EAAAjxG,EAAAopG,WAAAte,MAAA,KACA,GAAA,IAAAmmB,EAAAhhC,OACA,MAAA,IAAA6zB,MAAA,0DAAA9jG,GAGA,MAAA,CACA24N,IAAA1nH,EAAA,GACAy1H,OAAAz1H,EAAA,IA0BA,SAAAk/a,EAAA50T,GACA,OAAAoL,EAAAv3H,OAAAmsH,GAGAl9N,EAAAC,QAlQA,MAMAuD,YAAA04X,EAAAjwR,EAAA8lb,GACAplb,KAAAuvR,UAAAA,EAEAvvR,KAAAs3a,KAAA/2P,EAAA+rO,OAAAhtZ,EAAA,aAOAU,KAAAqlb,gBAAA54c,EAAAmvc,2BAOA57a,KAAAslb,gBAAA74c,EAAAkvc,mBAOA37a,KAAAulb,aAAAH,GAAA34c,EAAAivc,yBAGA17a,KAAAq3a,UAAArzb,EAAAgc,KAAAulb,cAEAvlb,KAAAwlb,UAAA,IAAArgI,EAAA,CAAAlhD,YAAA,IAMAptW,QACAmpG,KAAAylb,SAAAx+K,aACA,IAAAjnQ,KAAA0lb,YACA1lb,KAAAqlb,iBAOAxuhB,OACAmpG,KAAAylb,WACA7+K,cAAA5mQ,KAAAylb,UACAzlb,KAAAylb,SAAA,MAUA5uhB,WACA,OAAAmpG,KAAAwlb,UAAAxmc,KAAAs0D,UACAtzC,KAAAs3a,KAAA,iBACA,MAAAtic,EAAA+oB,KAAAunE,MAEA,IAAA/hF,EAAA,EACA/Y,EAAA,EACA,MAAAm7c,EAAA,IAAA3ic,IACAy2S,EAAAz5R,KAAAuvR,UAAAkK,QAGA/wL,EAAA1oG,KAAAuvR,UAAA7mL,MAAA,CAAA/9G,OAAAle,EAAAgvc,uBACA,UAAA,MAAA1lW,KAAA2yB,EACA,IAEA,MAAAilB,IAAAA,EAAA+N,OAAAA,GAAAwpT,EAAAnvW,EAAA/gL,KACAomN,EAAA+pU,EAAApvW,EAAAriL,OACA4xK,EAAAvnE,KAAAunE,MACA/5C,EAAA+5C,EAAA81C,EACAwqU,EAAAr6Z,EAAAvrB,KAAAslb,gBAGA,GAFAtlb,KAAAs3a,KAAA,kCACAhyW,EAAA81C,EAAA7vF,EAAAvrB,KAAAslb,gBAAAM,EAAA,YAAA,IACAA,EAAA,CACAp7c,IACAivT,EAAAh2S,OAAAsyF,EAAA/gL,KACA,MAAAytY,EAAAkjJ,EAAAnkc,IAAAmsI,IAAA,IAAAhvI,IACA8jT,EAAAzjT,IAAA08I,GACAiqT,EAAAlkc,IAAAksI,EAAA80K,GAEAl/S,IACA,MAAAkW,GACAuG,KAAAs3a,KAAA/nc,MAAAkqB,EAAA9f,SAGAqmB,KAAAs3a,KAAA,2BAAA9sc,EAAA+Y,GAGAoic,EAAA1ob,YACAw8R,EAAApgC,SAIA,IAAA,MAAA1rI,EAAA80K,KAAAkjJ,EAAA,CACA,MAAA3whB,EAAAiwhB,EAAAt3T,GACA02T,EAAArkb,KAAAq3a,UAAA71b,IAAAxsF,GACA,GAAAqvhB,EAAA,CACA,IAAA,MAAA3oT,KAAA+mK,EACA4hJ,EAAA5gc,OAAAi4I,GAEA,IAAA2oT,EAAApnb,KACA+C,KAAAq3a,UAAA35a,OAAA1oG,GAEAgrG,KAAAq3a,UAAA51b,IAAAzsF,EAAAqvhB,IAKArkb,KAAAs3a,KAAA,4BAAAv5a,KAAAunE,MAAAtwF,MAYAn+E,uBAAA82N,GACA,MAAAk4T,EAAAZ,EAAAt3T,GACA,IAAA02T,EAAArkb,KAAAq3a,UAAA71b,IAAAqkc,GAKA,OAJAxB,IACAA,QAwGA/wY,eAAA2mP,EAAAtsK,GACA,MAAA0pT,EAAA,IAAAr0b,IACA0lH,EAAAuxL,EAAAvxL,MAAA,CAAA/9G,OAAAs6b,EAAAt3T,KACA,UAAA,MAAA53C,KAAA2yB,EAAA,CACA,MAAAgzB,OAAAA,GAAAwpT,EAAAnvW,EAAA/gL,KACAqihB,EAAA51b,IAAAi6I,EAAAypT,EAAApvW,EAAAriL,QAEA,OAAA2jhB,EA/GAyO,CAAA9lb,KAAAuvR,UAAA5hK,GACA3tH,KAAAq3a,UAAA51b,IAAAokc,EAAAxB,IAEAA,EAUAxthB,kBAAA82N,EAAAwpP,GACA,OAAAn3W,KAAAwlb,UAAAxmc,KAAAs0D,UACAtzC,KAAAs3a,KAAA,iBAAA3pT,EAAAoM,uBACA,MAAAsqT,QAAArkb,KAAA+lb,iBAAAp4T,GAEA3tH,KAAAs3a,KAAA,kBAAA+M,EAAApnb,MACA,MAAAqoE,EAAA,IAAAvnE,KACAsmb,EAAA5ic,IAAA8+L,EAAAy8G,aAAAm6E,EAAAlzX,IAAAqhF,GAEA,MAAA44N,EAAA+mJ,EAAAt3T,GAEA,OADA3tH,KAAAq3a,UAAA51b,IAAAy8S,EAAAmmJ,GA2CA/wY,eAAA2mP,EAAAtsK,EAAAmsN,EAAA1+N,GACA,MAAA8iL,EAAA,CACA+mJ,EAAAt3T,GACA,IACA4yD,EAAAy8G,aAAA88C,EAAA71V,KACA3Z,KAAA,IAEAt1E,EAAA,IAAA6nU,EAAAqhE,GACAruL,EAAA4oB,WAAAhvE,KAAAkyE,EAAAr4H,OAAA83G,EAAA5+G,YACA,OAAAy9R,EAAA5oK,IAAAr8N,EAAA66M,GAnDAm2U,CAAAhmb,KAAAuvR,UAAA5hK,EAAAwpP,EAAA7xS,MAUAzuK,mBAAA82N,GACA,OAAA3tH,KAAAwlb,UAAAxmc,KAAAs0D,UACAtzC,KAAAs3a,KAAA,kBAAA3pT,EAAAoM,uBAEA,MAAA,WADA/5H,KAAA+lb,iBAAAp4T,IACAx5N,QAAAi2E,KAAA67c,GACA,IAAAl4T,EAAAwyD,EAAAo6P,aAAAsL,+KC5MA,aAEA,MAAAj4T,EAAAz6N,EAAA,iBACA86N,EAAA96N,EAAA,sBACAw6N,EAAAx6N,EAAA,YACA67N,gBAAAA,GAAA77N,EAAA,oBACA0rP,EAAA1rP,EAAA,YACAyrB,EAAAzrB,EAAA,WACAk5E,EAAAl5E,EAAA,gBACA+4f,OAAAA,GAAA/4f,EAAA,WA2KAF,EAAAC,QApKA,MAMAuD,YAAAqkU,EAAAvmU,GACA,IAAAumU,EACA,MAAA,IAAApiO,MAAA,qDAGAkH,KAAAkmb,QAAAhrN,EACAl7N,KAAA2hE,SAAA,IACAl1F,EAAAsvc,qBACApnhB,GAGAqrG,KAAAqsH,IAAAigS,EAAApxL,EAAAx/F,OAAA,eACA17H,KAAAymQ,gBAAA/wW,EAUAmB,SAEAmpG,KAAAymQ,YAAAzmQ,KAAA2hE,SAAAg7J,UAGA38N,KAAAymQ,WAAA57L,YAAA,KAEA7qE,KAAA+lW,qBACA/lW,KAAA2hE,SAAAo9B,QASAloM,OACAmpG,KAAAymQ,aACAx2I,aAAAjwH,KAAAymQ,YACAzmQ,KAAAymQ,gBAAA/wW,GAEAsqG,KAAAmmb,aAAAnmb,KAAAmmb,YAAAnzY,QAQAn8I,yBAEA,KAAAmpG,KAAAymQ,YAAA,CACA,UACAzmQ,KAAAomb,MAAApmb,KAAA2hE,SAAA0lS,iBAAArnW,KAAA2hE,SAAAmJ,SACA,MAAArxE,GACAuG,KAAAkmb,QAAA5O,KAAA/nc,MAAA,oBAAAkqB,SAGA,IAAAssE,SAAAC,IACAhmE,KAAAymQ,WAAA57L,WAAA7E,EAAAhmE,KAAA2hE,SAAA2jM,cAaAzuW,YAAAwvhB,EAAAC,GACAtmb,KAAAqsH,IAAA,SACArsH,KAAAmmb,YAAA,IAAA/2T,EAEA,UACApwM,EAAAqngB,GAAA/yY,MAAA/tE,IACAy6B,KAAAqsH,IAAA,mBAAA9mJ,GACA,IACA,MAAA0e,QAAA+b,KAAAumb,gBAGA,IAAAvmb,KAAAmmb,YAAA,aAEAnmb,KAAA67T,OAAA53U,EAAA,CACA6mF,QAAAw7W,EACAz2T,OAAA7vH,KAAAmmb,YAAAt2T,SAEA,MAAAp2H,GACA,GAAAA,GAAA,cAAAA,EAAApkG,KAEA,MADA2qG,KAAAqsH,IAAA98I,MAAA,+BAAAhK,EAAAk0B,GACAA,EAIAuG,KAAAqsH,IAAA,oBAAA9mJ,MAEA,QACAy6B,KAAAmmb,YAAA,KACAnmb,KAAAqsH,IAAA,qBAqBAx1N,aAAAotF,EAAAtvF,GAGA,IAAAmlb,EAFA95U,KAAAqsH,IAAA,WAAApoI,EAAA40I,eAGA,IACAihN,QAAA95U,KAAAkmb,QAAAvgF,SAAA1hX,EAAAtvF,GACA,MAAA8kG,GACA,GAAAA,GAAA,kBAAAA,EAAApkG,KAEA,OAGA,MAAAokG,EAMA,MAHAuG,KAAAqsH,IAAA,cAAAytN,GAGA76L,EAAA,IAAAnmJ,MAAA,qCAAAghV,MAAA71V,EAAA40I,iBAAA,yBAUAhiO,sBACA,MAAAqiO,QAAA7K,EAAAL,EAAA+gD,YAAA,IAAA,YACA,OAAA,IAAAhhD,EAAAmL,iNChLA,aACA,MAAAqhT,EAAAhnhB,EAAA,SAEAizhB,EAAAlzY,MAAA/vD,EAAA29S,EAAAvsY,IACA4lhB,EAAA,IAAA18a,MAAAta,GAAAiuM,QAAA,CAAA3zM,EAAAtY,IAAA27T,EAAA37T,IAAA5wE,GAEAtB,EAAAC,QAAAkzhB,EAEAnzhB,EAAAC,QAAAH,QAAAqzhB,+CCRA,aAuDAnzhB,EAAAC,QA9CA,MAIAuD,cACAmpG,KAAAqmb,QAAA,IAAA1nc,IACAqhB,KAAAu/a,SAAA,EAQA1ohB,aAAA6xM,GACA1oG,KAAAqmb,QAAArnc,IAAA0pH,GAQA7xM,eAAA6xM,GACA1oG,KAAAqmb,QAAA5ic,OAAAilH,GAMA7xM,QACAmpG,KAAAu/a,SAAA,EAMA1ohB,OACAmpG,KAAAu/a,SAAA,EACA,IAAA,MAAA72U,KAAA1oG,KAAAqmb,QACA39U,EAAAnoE,OAEAvgC,KAAAqmb,QAAAj5X,wCCnDA,aAEA,MAAA2gE,EAAAx6N,EAAA,YACA4nT,UAAAA,GAAA5nT,EAAA,aACA6nT,EAAA7nT,EAAA,UACA8xP,aAAAA,GAAA9xP,EAAA,UACA0wU,EAAA1wU,EAAA,SAEA84N,EAAA74N,OAAAiqG,OAAAwmO,EAAA,oBAAA,CACA10P,MAAA00P,EAAA,6BAkFA5wU,EAAAC,QA5EA,cAAA+xP,EASAxuP,YAAAlC,EAAA,CAAA+uF,KAAA,KACA,IAAA/uF,EAAA+uF,OAAA/uF,EAAA+uF,KAAAze,OACA,MAAA,IAAA6zB,MAAA,+CAEAysB,QAEAvlB,KAAA06V,MAAA/lc,EAAA+uF,KACAsc,KAAA4lQ,UAAAjxW,EAAA2wW,UAAA,IACAtlQ,KAAA86P,OAAA,KAMAjkW,QACAmpG,KAAA86P,SAIA96P,KAAA86P,OAAAmM,aAAA,IAAAjnQ,KAAAymb,2BAAAzmb,KAAA4lQ,WACAv5I,EAAA,qCACArsH,KAAAymb,2BAMA5vhB,0BACAmpG,KAAA86P,QAIA96P,KAAA06V,MAAAtmc,SAAAu2Q,IACA,IAAAywC,EAAAmB,IAAA13N,QAAA8lL,GACA,OAAAt+C,EAAA98I,MAAA,qBAGA,MAAA+zT,EAAA,IAAAnoF,EAAAxwC,GACA0kM,EAAA/rE,EAAA8iE,YAEA,IAAAiJ,EAEA,YADAhjP,EAAA98I,MAAA,+CAIA,MAAAmsJ,EAAA3N,EAAA0M,oBAAA40O,GAEA,IACArvW,KAAA64E,KAAA,OAAA,CACA50F,GAAAy3I,EACA2lL,WAAA,CAAA/d,KAEA,MAAA7pS,GACA4yH,EAAA98I,MAAA,4BAAAkqB,OAQA5iG,OACAmpG,KAAA86P,QAAA8L,cAAA5mQ,KAAA86P,QACA96P,KAAA86P,OAAA,QAKAt2R,IAAA,wHC5FA,aAEA,MAAAkid,EAAAnzhB,EAAA,gBACA8ob,EAAA9ob,EAAA,aACA4nT,UAAAA,GAAA5nT,EAAA,aACAupT,EAAAvpT,EAAA,YAuBA,MAAAimU,EAMA3iU,YAAA6kO,EAAAigG,EAAAP,GACAp7N,KAAA07H,OAAAA,EACA17H,KAAA27N,OAAAA,EACA37N,KAAAo7N,QAAAA,EAMAvkU,oBAAA6kO,OAAAA,EAAAs+F,KAAAA,EAAAF,MAAAA,EAAAnlU,QAAAA,IAGAqlU,EAAA8b,cACA9b,EAAAj6O,OAIA,MAAAxF,QAAAy/O,EAAAz/O,OAAA6hP,SAEAT,QAAA0gH,EAAA,CACA1nb,QAAAA,EACAqlU,KAAAA,EACAt+F,OAAAA,EACA2lL,WAAAslI,EAAAjrT,EAAAnhJ,GACAA,OAAAA,EACA0iW,oBAAAvnb,IAGAimU,EAAA1B,gBACA0B,EAAAuhH,qBAGAvhH,EAAA3mP,QAEA,IAAA,MAAAsuT,KAAA3nE,EAAA0lF,WACAvnF,EAAA,sBAAAwpE,SAAA5nK,EAAA7C,iBAGA,MAAAuiG,EAAA,IAAAsrN,EAAA/qN,EAAA3B,EAAAl1D,OAAA,CAAA8hR,cAAA,IAGA,aAFAxrN,EAAApmP,QAEA,IAAAwkP,EAAA99F,EAAAigG,EAAAP,GAMAvkU,kBAAAqjU,SACAn0J,QAAA2gD,IAAA,CACAwzG,EAAAkB,QAAA76L,OACA25L,EAAAyB,OAAAp7L,UAIAltI,EAAAC,QAAAkmU,EAMA,MAAAmtN,EAAA,CAAAjrT,EAAAnhJ,KACA,MAAA80X,EAAA3zO,EAAA7C,cAEAyoN,EAAA,GACA9lH,EAAAjhP,EAAAipT,WAAAjpT,EAAAipT,UAAAC,OAAA,GACA,IAAA,MAAAzmF,KAAAwe,EAAA,CACA,IAAA8nE,EAAA,IAAAnoF,EAAA6B,GAIA,GAAAsmF,EAAAjmF,aAAA5uO,SAAAo4c,GACA,MAAA/pO,EAAA,IAAAhkN,MAAA,qGAAA,+CAMA,MAAAgub,EAAAxjJ,EAAA8iE,YACA0gF,GAAAA,IAAAz3E,IACA/rE,EAAAA,EAAA+wE,YAAA,QAAAhF,MAGA/tB,EAAAx2W,KAAAw4T,GAGA,OAAAg+C,GAGAulG,EAAA,gHC1HA,aAEA,MAAAE,EAAAxzhB,EAAA,kBACAimU,EAAAjmU,EAAA,aACAyzhB,EAAAzzhB,EAAA,qBACA0zhB,EAAA1zhB,EAAA,mBACA+4f,EAAA/4f,EAAA,WAAA+4f,OACA9+B,EAAAj6d,EAAA,YACA67N,gBAAAA,GAAA77N,EAAA,4BACA87N,UAAAA,GAAA97N,EAAA,cASA00J,EAAA,CACA2+X,cAAA,EACAM,4BAAA,IACAC,iCAAA,KAEAC,EAAA,CACA,iBACA,eACA,kBACA,kBACA,aACA,WACA,uBACA,iBACA,aA6XA/zhB,EAAAC,QAtXA,MASAuD,YAAA8kU,EAAA+0F,EAAA/7Z,EAAA,IACAqrG,KAAA0iV,QAAA/mH,EACA37N,KAAAs3a,KAAAhrB,EAAAtsZ,KAAA07H,QAEA17H,KAAA2hE,SAAAnuK,OAAAiqG,OAAA,GAAAwqD,EAAAtzJ,GAGAqrG,KAAA8uX,OAAA,IAAAtB,EAAA45D,EAAA,CACAzqN,QAAA38N,KAAA2hE,SAAAilX,aACAj9E,uBAAA3pW,KAAA2hE,SAAAulX,4BACAx9E,4BAAA1pW,KAAA2hE,SAAAwlX,mCAIAnnb,KAAAk6N,QAAA,IAAAV,EAAAmC,EAAA37N,KAAAA,KAAA8uX,QAGA9uX,KAAA0wT,WAAAA,EAEA1wT,KAAAo6Y,OAAA,IAAA4sC,EAAAhnb,KAAA07H,OAAAg1L,EAAA1wT,KAAAk6N,QAAAl6N,KAAA8uX,QAGA9uX,KAAAqnb,GAAA,IAAAN,EAAA/mb,KAAA07H,OAAA17H,KAAAk6N,QAAAl6N,KAAA8uX,QAEA9uX,KAAAsnb,cAAA,IAAAL,EAAAjnb,KAAA07H,QAMAA,aACA,OAAA17H,KAAA0iV,QAAAhnN,OASA7kO,sBAAA6kO,EAAApmI,GACA,UAIA0K,KAAAo6Y,OAAAmtC,gBAAA7rT,EAAApmI,GACA,MAAAmE,GAIAuG,KAAAs3a,KAAA,4BAAAhib,GAGA,GAAA,IAAAA,EAAAwvK,OAAA7nK,KACA,OAGA,MAAA6nK,EAAAjnK,MAAA4rD,KAAAn0D,EAAAwvK,OAAA1nK,UAGAoqb,EAAA1iR,EACA/2L,QAAAuL,GAAA0mB,KAAAqnb,GAAAtlJ,SAAA1wC,SAAA/3Q,EAAAq0I,OACAvjJ,KAAAkP,GAAAA,EAAAq0I,MAEA3tH,KAAAqnb,GAAAI,YAAAD,SAEAzhX,QAAA2gD,IAAAo+C,EAAA16L,KAAAkpE,MAAAh6D,IACA,MAAAouc,EAAAF,EAAA/4c,SAAA6K,EAAAq0I,WACA3tH,KAAA2nb,qBAAAjsT,EAAApiJ,EAAAouc,OAUA7whB,2BAAA6kO,EAAAluE,EAAAk6X,GACA1nb,KAAAs3a,KAAA,kBAEA,MAAAv4b,QAAAihB,KAAA0wT,WAAA3xU,IAAAyuE,EAAAmgE,KAEA3tH,KAAA4nb,uBAAAlsT,EAAA7C,cAAArrE,EAAAzuE,GAEA2oc,SAIA1nb,KAAAqxH,IAAA7jE,GASA32J,uBAAAw4c,EAAA7hT,EAAA0sP,GACAl6S,KAAA8uX,OAAAhkZ,KAAAukY,EAAA,iBAAA,GACArvW,KAAA8uX,OAAAhkZ,KAAAukY,EAAA,eAAA7hT,EAAAd,KAAAznF,QAEAi1U,IACAl6S,KAAA8uX,OAAAhkZ,KAAAukY,EAAA,kBAAA,GACArvW,KAAA8uX,OAAAhkZ,KAAAukY,EAAA,kBAAA7hT,EAAAd,KAAAznF,SASApuE,cAAA4iG,GACAuG,KAAAs3a,KAAA/nc,MAAA,mBAAAkqB,EAAA9f,SAQA9iF,iBAAA6kO,GACA17H,KAAAqnb,GAAAlwF,UAAAz7N,GAQA7kO,oBAAA6kO,GACA17H,KAAAqnb,GAAAnkC,aAAAxnR,GACA17H,KAAAo6Y,OAAAytC,iBAAAnsT,GACA17H,KAAA8uX,OAAAo0B,aAAAxnR,GAGA7kO,cACAmpG,KAAA8uX,OAAAnxH,SAGA9mW,eACAmpG,KAAA8uX,OAAArxH,UASA5mW,gBAAA6kO,EAAA/5D,GACA,OAAA3hE,KAAAo6Y,OAAAp4G,gBAAAtmK,GAQA7kO,cAAA6kO,GACA,OAAA17H,KAAAo6Y,OAAA0tC,cAAApsT,GAWA7kO,UAAA82N,EAAAh5N,EAAA,IAMA,MAAAozhB,EAAA,CAAAp6T,EAAAh5N,KAGAqrG,KAAAqnb,GAAAW,WAAA,CAAAr6T,GAAAh5N,GAEAqrG,KAAAsnb,cAAAW,UAAAt6T,EAAAh5N,IAGA,IAAAuzhB,GAAA,EAQA,MA2BArwT,EAAA,IAAAzI,EACAS,EAAAl7N,EAAAk7N,OACAR,EAAA,CAAA16N,EAAAk7N,OAAAgI,EAAAhI,SACAgI,EAAAhI,OAEAriE,QAAAuY,QAAA40L,KAAA,CACA36P,KAAAsnb,cAAAW,UAAAt6T,EAAA,CACAkC,OAAAA,IAlCAv8E,OAAAq6E,EAAAh5N,KACA,IAIA,aAFAqrG,KAAA0wT,WAAAlvU,IAAAmsI,EAAAh5N,GAGA,MAAA8kG,GACA,GAAA,kBAAAA,EAAApkG,KACA,MAAAokG,EAWA,OARAyub,IACAA,GAAA,EAEAlob,KAAAk6N,QAAAiuN,eAAAx6T,GACAzvH,OAAAzE,GAAAuG,KAAAs3a,KAAA/nc,MAAAkqB,MAIAsub,EAAAp6T,EAAAh5N,KAiBAyzhB,CAAAz6T,EAAA,CACAkC,OAAAA,MAOA,OAFAgI,EAAA7kF,QAEAwa,EAWA32J,cAAAurY,EAAAztY,EAAA,IACA,UAAA,MAAAg5N,KAAAy0K,QACApiS,KAAAxe,IAAAmsI,EAAAh5N,GAcAkC,OAAAurY,GACA,MAAAimJ,EAAAxqb,MAAA/gB,QAAAslT,GAAAA,EAAA,CAAAA,GAEApiS,KAAAqnb,GAAAiB,aAAAD,GACAA,EAAAj0hB,SAAAu5N,GAAA3tH,KAAAsnb,cAAAiB,YAAA56T,KAUA92N,YAAAurY,GACApiS,KAAAqnb,GAAAI,YAAA5pb,MAAA/gB,QAAAslT,GAAAA,EAAA,CAAAA,IAUAvrY,UAAA22J,EAAAmU,SACA3hE,KAAA0wT,WAAAr/L,IAAA7jE,GACAxtD,KAAAwob,4BAAAh7X,GASA32J,cAAAiuQ,GACA,UAAA,MAAAt3G,KAAAxtD,KAAA0wT,WAAAp3D,QAAAx0F,GACA9kK,KAAAwob,4BAAAh7X,SAEAA,EAUA32J,4BAAA22J,GACAxtD,KAAAsnb,cAAAmB,SAAAj7X,GACAxtD,KAAAo6Y,OAAAsuC,eAAA,CAAAl7X,IAEAxtD,KAAAk6N,QAAAp6I,QAAAtyB,EAAAmgE,KAAAzvH,OAAAzE,IACAuG,KAAAs3a,KAAA/nc,MAAA,wBAAAkqB,EAAA9f,YAOA9iF,cACA,OAAAmpG,KAAAqnb,GAAAtlJ,SAAA7kS,UAMArmG,QACA,OAAAmpG,KAAAo6Y,OAAA33G,QAMA5rY,OACA,OAAAmpG,KAAA8uX,OAMAj4d,QACAmpG,KAAAqnb,GAAAryc,QACAgrB,KAAAk6N,QAAAllP,QACAgrB,KAAAo6Y,OAAApla,QAMAn+E,OACAmpG,KAAA8uX,OAAAvuV,OACAvgC,KAAAqnb,GAAA9mZ,OACAvgC,KAAAk6N,QAAA35L,OACAvgC,KAAAo6Y,OAAA75W,oOCzZA,aAEA,MAAA4jO,EAAA5wW,EAAA,oBACAo1hB,EAAAp1hB,EAAA,qBACAq1hB,EAAAr1hB,EAAA,gBACAs1hB,EAAAt1hB,EAAA,eACA+4f,EAAA/4f,EAAA,YAAA+4f,OAOAj5f,EAAAC,QAAA,MAMAuD,YAAA6kO,EAAAw+F,EAAAqB,GAEAv7N,KAAAyiS,MAAA,IAAAz/S,IACAgd,KAAA+hS,SAAA,IAAA4mJ,EAAAptN,GAEAv7N,KAAAk6N,QAAAA,EACAl6N,KAAA8uX,OAAAvzJ,EAEAv7N,KAAAy3R,QAAA/7J,EACA17H,KAAAs3a,KAAAhrB,EAAA5wR,EAAA,QASA7kO,YAAAurY,EAAAp6B,EAAA7oJ,GACA,MAAAjiH,EAAAklS,EAAAh4T,KAAA,CAAAujJ,EAAAxmJ,IACA,IAAAg9R,EAAA2kL,MAAAn7T,EAAAi7T,EAAAG,aAAA5hd,EAAAg9R,EAAA6kL,SAAAlkJ,MAAA98B,KAGA9qQ,EAAA9oG,SAAAL,IAEAA,EAAAi0W,OACA7oJ,EACAn/G,KAAA+hS,SAAAknJ,YAAAl1hB,EAAA45N,IAAAvvH,YAEA4B,KAAA+hS,SAAArkS,OAAA3pG,EAAA45N,MAGA3tH,KAAAs3a,KAAA,gBAGAt3a,KAAA+hS,SAAA/iT,IAAAjrF,EAAA45N,IAAA55N,EAAAo0W,cAKA,IAAA,MAAAjhS,KAAA84B,KAAAyiS,MAAArlS,SACAl2B,EAAAgid,WAAAhsb,GAQArmG,kBAAA6kO,GACA,IAAAs5R,EAAAh1Z,KAAAyiS,MAAAjhT,IAAAk6I,EAAA7C,eAEA,GAAAm8R,EAEA,YADAA,EAAAm0B,SAIAn0B,EAAA,IAAA6zB,EAAA7ob,KAAAy3R,QAAA/7J,EAAA17H,KAAAk6N,SAGA,MAAAkvN,EAAA,IAAAjlL,GAAA,GAEA,IAAA,MAAApuL,KAAA/1E,KAAA+hS,SAAA7kS,UACAksb,EAAAC,SAAAtzW,EAAA,GAAA43C,IAAA53C,EAAA,GAAAoyL,UAMA,OAHA6sJ,EAAAs0B,WAAAF,GAEAppb,KAAAyiS,MAAAhhT,IAAAi6I,EAAA7C,cAAAm8R,GACAA,EAOAn+f,iBAAA6kO,GACA,MAAAs5R,EAAAh1Z,KAAAyiS,MAAAjhT,IAAAk6I,EAAA7C,eAEAm8R,IAIAA,EAAAm0B,SACAn0B,EAAAm0B,OAAA,GAIAnpb,KAAAyiS,MAAAh/S,OAAAi4I,EAAA7C,gBAUAhiO,WAAAurY,EAAAztY,EAAA,IACAqrG,KAAAupb,YAAAnnJ,GAAA,GAEAztY,GAAAA,EAAAk7N,QACAl7N,EAAAk7N,OAAA3pD,iBAAA,SAAA,KACAlmE,KAAAynb,YAAArlJ,MAUAvrY,aAAAurY,GACApiS,KAAAs3a,KAAA,oBAAAl1I,EAAAn9T,QACA+6B,KAAAupb,YAAAnnJ,GAAA,GAAA,GAQAvrY,YAAAurY,GACApiS,KAAAs3a,KAAA,mBAAAl1I,EAAAn9T,QACA+6B,KAAAupb,YAAAnnJ,GAAA,GAMAvrY,iBACA,OAAAgnG,MAAA4rD,KAAAzpD,KAAAyiS,MAAAtuY,QAMA0C,UAAA6kO,GACA17H,KAAAwpb,kBAAA9tT,GAMA7kO,aAAA6kO,GACA17H,KAAAypb,iBAAA/tT,GAGA7kO,SAGAA,OACAmpG,KAAAyiS,MAAAruY,SAAA4ggB,GAAAh1Z,KAAAkjZ,aAAA8R,EAAAt5R,gKC5KA,aAEA,MAAAguT,EAAAn2hB,EAAA,cACAg7N,EAAAh7N,EAAA,SACA0kP,QAAAA,GAAA1kP,EAAA,cAEAo2hB,EAAAp2hB,EAAA,kBACA86N,EAAA96N,EAAA,uBACAq2hB,WAAAA,GAAAr2hB,EAAA,gBACA4wW,QAAAA,GAAA5wW,EAAA,aACAu1hB,EAAAv1hB,EAAA,WAEA,MAAAs2hB,EAIAhzhB,YAAA2hQ,GACAx4J,KAAAw4J,KAAAA,EAEAx4J,KAAA+hS,SAAA,IAAA/+S,IAGAgd,KAAA8kK,OAAA,IAAA9hL,IAGAgd,KAAA8pb,eAAA,IAAA9mc,IACAgd,KAAA+pb,aAAA,EAGAl6Z,YACA,OAAA,IAAA7vB,KAAA8kK,OAAA7nK,MACA,IAAA+C,KAAA+hS,SAAA9kS,MACA,IAAA+C,KAAA8pb,eAAA7sb,KAYApmG,SAAA82N,EAAAw6I,EAAA6hL,EAAAhiL,EAAAiiL,GACA,MAAAD,IACAA,EAAAH,EAAAb,SAAAlkJ,OAGA,MAAAolJ,EAAAv8T,EAAAvvH,SAAA,aACA23E,EAAA/1E,KAAA+hS,SAAAvgT,IAAA0oc,GACAn0W,GAEAA,EAAAi0W,WAAAA,IACAj0W,EAAAoyL,SAAAA,GAGAH,IACAjyL,EAAAiyL,OAAA3qR,QAAA2qR,IAGAiiL,IACAl0W,EAAAk0W,aAAA5sc,QAAA4sc,IAGAD,IAAAH,EAAAb,SAAAlkJ,OAAA/uN,EAAAi0W,WAAAH,EAAAb,SAAAmB,OACAp0W,EAAAi0W,SAAAA,IAGAhqb,KAAA+hS,SAAAtgT,IAAAyoc,EAAA,IAAApB,EAAAn7T,EAAAw6I,EAAA6hL,EAAAhiL,EAAAiiL,IAQApzhB,SAAA22J,GACA,MAAA08X,EAAA18X,EAAAmgE,IAAAvvH,SAAA,aACA4B,KAAA8kK,OAAArjL,IAAAyoc,EAAA18X,GAMA32J,QAAA82N,GACA,MAAAu8T,EAAAv8T,EAAAvvH,SAAA,aACA4B,KAAA8pb,eAAA/qc,IAAAmrc,IACAlqb,KAAA8pb,eAAAroc,IAAAyoc,EAAAL,EAAAO,kBAAAD,MAOAtzhB,YAAA82N,GACA,MAAAu8T,EAAAv8T,EAAAvvH,SAAA,aACA4B,KAAA8pb,eAAA/qc,IAAAmrc,IACAlqb,KAAA8pb,eAAAroc,IAAAyoc,EAAAL,EAAAO,kBAAAC,UAOAxzhB,OAAA82N,GACA,MAAAu8T,EAAAv8T,EAAAvvH,SAAA,aACA4B,KAAA+hS,SAAAt+S,OAAAymc,GACAlqb,KAAAqpb,SAAA17T,EAAA,EAAAk8T,EAAAb,SAAAlkJ,OAAA,GAAA,GAMAjuY,gBAAAomG,GACA+C,KAAA+pb,aAAA9sb,EASApmG,wBACA,MAAA44E,EAAA,CACAsyT,SAAA,CACA7kS,QAAAW,MAAA4rD,KAAAzpD,KAAA+hS,SAAA3kS,UAAAhzB,KAAA2rG,IACA,CACAvoB,MAAAuoB,EAAA43C,IAAAgL,MACAwvI,SAAAhiS,OAAA4vG,EAAAoyL,UACAH,OAAA3qR,QAAA04F,EAAAiyL,YAGAxvG,OAAAx4J,KAAAw4J,WAAA9iQ,GAEAovQ,OAAAjnK,MAAA4rD,KAAAzpD,KAAA8kK,OAAA1nK,UACAhzB,KAAAojF,GAAAA,EAAAd,QAGA,OAAAy3M,EAAA7gQ,OAAA7zB,GAAAgqJ,SASA5iO,wBACA,MAAA44E,EAAA,CACAsyT,SAAA,CACA7kS,QAAAW,MAAA4rD,KAAAzpD,KAAA+hS,SAAA3kS,UAAAhzB,KAAA2rG,IACA,CACAvoB,MAAAuoB,EAAA43C,IAAAgL,MACAwvI,SAAAhiS,OAAA4vG,EAAAoyL,UACA6hL,SAAAj0W,EAAAi0W,SACAhiL,OAAA3qR,QAAA04F,EAAAiyL,QACAiiL,aAAA5sc,QAAA04F,EAAAk0W,kBAGAzxR,OAAAx4J,KAAAw4J,WAAA9iQ,GAGAo0hB,eAAA,GAGAlwU,QAAA,GACAmwU,aAAA/pb,KAAA+pb,cAGA/pb,KAAA8kK,OAAA1wQ,SAAAo5J,IACA/9E,EAAAmqI,QAAA9uI,KACA,IAAAq5R,EAAA2gC,MAAA,CACAn6S,OAAA6iE,EAAAmgE,IAAAhjI,OACA+hE,KAAAc,EAAAd,WAKA,IAAA,MAAAw9X,EAAAI,KAAAtqb,KAAA8pb,eACAr6c,EAAAq6c,eAAAh/c,KAAA,IAAAq5R,EAAAomL,cAAA,CACA58T,IAAA,IAAAY,EAAA27T,GAAAvxT,MACA7xJ,KAAAwjd,KAQA,OAJAtqb,KAAA+pb,aAAA,IACAt6c,EAAAs6c,aAAA/pb,KAAA+pb,cAGA5lL,EAAA7gQ,OAAA7zB,GAAAgqJ,SAOA5iO,OAAAmgP,GACA,SAAAh3I,KAAAw4J,OAAAxhB,EAAAwhB,MACAx4J,KAAA+pb,eAAA/yS,EAAA+yS,cACAH,EAAA5pb,KAAA+hS,SAAA/qJ,EAAA+qJ,WACA6nJ,EAAA5pb,KAAA8kK,OAAA9tB,EAAA8tB,SAGA8kR,EAAA5pb,KAAA8pb,eAAA9yS,EAAA8yS,iBAQAtoc,IAAAtrF,OAAAspM,eACA,MAAA97G,EAAAma,MAAA4rD,KAAAzpD,KAAA+hS,SAAA5tY,QACA2wQ,EAAAjnK,MAAA4rD,KAAAzpD,KAAA8kK,OAAA3wQ,QACA,MAAA,yBAAA6rG,KAAAw4J,eAAA90K,cAAAohL,MAOA+kR,EAAAxrL,YAAA/qN,MAAAxpD,IACA,MAAAkvI,EAAAmrI,EAAA//P,OAAAta,GAEAykT,EAAAv1K,EAAA+oK,UAAA/oK,EAAA+oK,SAAAvpI,OAAA,EACA/oL,EAAA,IAAAo6c,EAAAt7I,GA+BA,OA7BAv1K,EAAA+oK,UAAA/oK,EAAA+oK,SAAA7kS,SACA87H,EAAA+oK,SAAA7kS,QAAA9oG,SAAA2hL,IACA,IAAAA,EAAAvoB,MACA,OAGA,MAAAmgE,EAAA,IAAAY,EAAAx4C,EAAAvoB,OACA/9E,EAAA45c,SAAA17T,EAAA53C,EAAAoyL,UAAA,EAAApyL,EAAAi0W,SAAA3sc,QAAA04F,EAAAiyL,QAAA3qR,QAAA04F,EAAAk0W,kBAIAjxT,EAAA8wT,gBACA9wT,EAAA8wT,eAAA11hB,SAAAo2hB,IACA,IAAAA,EAAA78T,IACA,OAGA,MAAAA,EAAA,IAAAY,EAAAi8T,EAAA78T,KAEA68T,EAAA1jd,OAAA+id,EAAAO,kBAAAD,KACA16c,EAAAg7c,QAAA98T,GAEAl+I,EAAAi7c,YAAA/8T,MAOAqL,EAAA8rC,OAAA7/L,OAAA,SACA8gG,QAAA2gD,IAAAsS,EAAA8rC,OAAA16L,KAAAkpE,MAAAh6D,IACA,MAAA+5B,QAAAg7G,EAAA/0I,EAAA,YACAq0I,EAAA,IAAAY,EAAAl7G,GACA5jC,EAAAk7c,SAAA,IAAAjB,EAAApwc,EAAAq0I,QAEAl+I,GAIAupJ,EAAApf,QAAA30I,OAAA,SACA8gG,QAAA2gD,IAAAsS,EAAApf,QAAAxvI,KAAAkpE,MAAApsE,IACA,IAAAA,EAAAyjB,SAAAzjB,EAAAwlF,KACA,OAEA,MAAAtvD,EAAAusb,EAAAzid,EAAAyjB,QACAo2Q,EAAA3jQ,EAAA,GACAgxH,EAAAhxH,EAAA,GACAs/N,EAAAt/N,EAAA,GAEAiW,QAAAg7G,EAAAnnJ,EAAAwlF,KAAAgwK,GACA/uG,EAAA,IAAAY,EAAAwyI,EAAA9oH,EAAA7pB,GAAA/6G,GACA5jC,EAAAk7c,SAAA,IAAAjB,EAAAxid,EAAAwlF,KAAAihE,QAEAl+I,EAAAm7c,gBAAA5xT,EAAA+wT,cACAt6c,GAGAA,GAMAo6c,EAAAgB,kBAAAl9T,GAKAA,EAAAgL,MAAA1zJ,OAAA,EAGA4kd,EAAAf,MAAAA,EACAe,EAAAb,SAAA,CACAlkJ,MAAA3gC,EAAAwkL,SAAAK,SAAAlkJ,MACAqlJ,KAAAhmL,EAAAwkL,SAAAK,SAAAmB,MAEAN,EAAAO,kBAAA,CACAD,KAAAhmL,EAAAimL,kBAAAD,KACAE,SAAAlmL,EAAAimL,kBAAAC,UAEAh3hB,EAAAC,QAAAu2hB,sMCrTA,aAEA,MAAAluT,EAAApoO,EAAA,UAEAF,EAAAC,QAAAi9N,IACA,KAAAA,aAAAkI,YACA,MAAA,IAAA3/H,MAAA,gCAGA,MAAAluB,EAAA,GAEA,KAAA2lJ,EAAAtrJ,OAAA,GAAA,CACA,MAAAysC,EAAAiqH,EAAAv3H,OAAAmsH,GACA3lJ,EAAAE,KAAA4mC,GACA6+G,EAAAA,EAAAnrJ,MAAAu2J,EAAAv3H,OAAAu0H,OAGA,OAAA/tJ,+CCjBAv3E,EAAAC,QAAA,CACAgwG,OAAA/vG,EAAA,eACA6wG,OAAA7wG,EAAA,eACA2rO,eAAA3rO,EAAA,+GCHAF,EAAAC,QAOA,SAAAgwG,EAAAoO,EAAAqvB,EAAAh8D,GACAg8D,EAAAA,GAAA,GAEA,IAAAo+F,EADAp6J,EAAAA,GAAA,EAGA,KAAA2sC,GAAA0tH,GACAr+F,EAAAh8D,KAAA,IAAA2sC,EAXA,IAYAA,GAAA,IAEA,MAZA,IAYAA,GACAqvB,EAAAh8D,KAAA,IAAA2sC,EAfA,IAgBAA,KAAA,EAMA,OAJAqvB,EAAAh8D,GAAA,EAAA2sC,EAEApO,EAAAq1H,MAAA5zJ,EAAAo6J,EAAA,EAEAp+F,GAtBA,IAGAq+F,EAAAx5J,KAAAy5J,IAAA,EAAA,kCCLAhsO,EAAAC,QAKA,SAAA09N,EAAAT,EAAAxrJ,GACA,IAIAuU,EAJAvN,EAAA,EAEA44B,EAAA,EACA26H,EAFAv6J,EAAAA,GAAA,EAIAgkB,EAAAwnI,EAAAtrJ,OAEA,EAAA,CACA,GAAAq6J,GAAAv2I,EAEA,MADAioI,EAAA2H,MAAA,EACA,IAAA4G,WAAA,2BAEAjmJ,EAAAi3I,EAAA+O,KACAvzJ,GAAA44B,EAAA,IAhBA,IAiBArrB,IAAAqrB,GAjBA,IAkBArrB,GAAA1T,KAAAy5J,IAAA,EAAA16H,GACAA,GAAA,QACArrB,GArBA,KAyBA,OAFA03I,EAAA2H,MAAA2G,EAAAv6J,EAEAgH,iCC1BA,IAAAyzJ,EAAA55J,KAAAy5J,IAAA,EAAA,GACAI,EAAA75J,KAAAy5J,IAAA,EAAA,IACAK,EAAA95J,KAAAy5J,IAAA,EAAA,IACAM,EAAA/5J,KAAAy5J,IAAA,EAAA,IACAO,EAAAh6J,KAAAy5J,IAAA,EAAA,IACAQ,EAAAj6J,KAAAy5J,IAAA,EAAA,IACAS,EAAAl6J,KAAAy5J,IAAA,EAAA,IACAU,EAAAn6J,KAAAy5J,IAAA,EAAA,IACAW,EAAAp6J,KAAAy5J,IAAA,EAAA,IAEAhsO,EAAAC,QAAA,SAAAI,GACA,OACAA,EAAA8rO,EAAA,EACA9rO,EAAA+rO,EAAA,EACA/rO,EAAAgsO,EAAA,EACAhsO,EAAAisO,EAAA,EACAjsO,EAAAksO,EAAA,EACAlsO,EAAAmsO,EAAA,EACAnsO,EAAAosO,EAAA,EACApsO,EAAAqsO,EAAA,EACArsO,EAAAssO,EAAA,EACA,kCCtBA,aAEA,MAAAikG,EAAA1wU,EAAA,SACA4kO,EAAA5kO,EAAA,sBA6BAu3hB,EAAA,CAAAC,EAAAn9a,EAAAlqB,KACA,IAAAykB,EAAA,EACA,MAAA/E,EAAA1f,EAAAze,OACA,KAAAkjC,EAAA/E,GAAA,CACA,GAAA2nb,EAAAn9a,EAAAlqB,EAAAykB,IACA,OAAA,EAEAA,GAAA,EAEA,OAAA,GAyGA90G,EAAAC,QAAA,CACAg5f,OAxIA,CAAAroa,EAAAi3b,KACA,MAAArohB,EAAA,CAAA,WAQA,OAPAqohB,GACArohB,EAAAi4E,KAAAowc,GAEAj3b,GACApxF,EAAAi4E,KAAA,GAAAmZ,EAAA40I,cAAAzzJ,MAAA,EAAA,MAGA5xE,OAAAiqG,OAAAwmO,EAAApxU,EAAAy3E,KAAA,MAAA,CACAiF,MAAA00P,EAAApxU,EAAAg/F,OAAA,CAAA,UAAAvnB,KAAA,SA+HAwgd,aAAAA,EACAE,SAnGA,CAAAD,EAAArnc,KACA,IAAAykB,EAAA,EACA,MAAA/E,EAAA1f,EAAAze,OACA2F,EAAA,GACA,IAAAqwB,EAEA,KAAAkN,EAAA/E,GACAnI,EAAAvX,EAAAykB,GACA2ib,EAAAC,EAAA9vb,EAAArwB,KACAA,EAAAA,EAAA3F,QAAAg2B,GAEAkN,GAAA,EAEA,OAAAv9B,GAuFAqgd,QA7EA,CAAAF,EAAArnc,IACAA,EAAAhe,QAAA,CAAA2wK,EAAAvxE,KACA,MAAAzwK,EAAA02hB,EAAAjmX,GAOA,OALAuxE,EAAAhiP,GACAgiP,EAAAhiP,GAAAy2E,KAAAg6F,GAEAuxE,EAAAhiP,GAAA,CAAAywK,GAEAuxE,IACA,IAoEA60S,YA1DA,CAAAH,EAAArnc,EAAA0Z,IACA1Z,EAAA3V,QAAA5G,IACA2jd,EAAAC,EAAA5jd,EAAAi2B,KAyDA+tb,OA/CA,CAAAvmc,EAAAlB,IACAma,MAAAF,UAAAv4B,MAAAw4B,KAAAla,EAAA,GAAA0I,MAAA,CAAAvlB,EAAAyS,KACA,MAAAmyN,EAAA7mN,EAAA/d,GACA6kO,EAAA9mN,EAAAtL,GACA,OAAAmyN,EAAAC,GAAA,EAAAD,EAAAC,EAAA,EAAA,KA4CAk+O,WAhCA,CAAA/id,EAAAyS,KACA,GAAAzS,EAAAo2B,OAAA3jB,EAAA2jB,KACA,OAAA,EAGA,IAAA,MAAAjoG,EAAAo2hB,KAAAvkd,EAAA,CACA,MAAAwkd,EAAA/xc,EAAAkI,IAAAxsF,GAEA,QAAAU,IAAA21hB,EACA,OAAA,EAIA,GAAA,mBAAAD,EAAApxT,SAAAoxT,EAAApxT,OAAAqxT,GACA,OAAA,EAGA,GAAAD,EAAA1+X,QAAA2+X,EAAA3+X,OAAAyrE,EAAAizT,EAAA1+X,KAAA2+X,EAAA3+X,OACA,OAAA,EAIA,OAAA,4EC9IA,aAEA,IAAA40F,EAAA/tP,EAAA,sBAGAguP,EAAAD,EAAAE,OAAAC,EAAAH,EAAAI,OAAAC,EAAAL,EAAA1hJ,KAGAs7F,EAAAomD,EAAAM,MAAA,kBAAAN,EAAAM,MAAA,gBAAA,IAEA1mD,EAAAipK,QAAA,WAqBA,SAAAA,EAAAj9R,GAIA,GAHA84B,KAAA8kK,OAAA,GACA9kK,KAAA45G,QAAA,GACA55G,KAAA8pb,eAAA,GACA5id,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA6zBA,IACAk6K,EAAAjkJ,EA+KA,OAp+BA+mQ,EAAAxmQ,UAAAokS,SAAA,KAQA59B,EAAAxmQ,UAAAmnK,OAAAnjB,EAAA4D,WAQA4+G,EAAAxmQ,UAAAi8G,QAAA+nC,EAAA4D,WAQA4+G,EAAAxmQ,UAAAmsb,eAAAnoS,EAAA4D,WAQA4+G,EAAAxmQ,UAAAosb,aAAA,EAWA5lL,EAAA7gQ,OAAA,SAAApkB,EAAAulI,GAKA,GAJAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAA6iT,UAAAvuY,OAAAgnG,eAAAoD,KAAA1e,EAAA,aACAg8G,EAAAipK,QAAAwkL,SAAArlb,OAAApkB,EAAA6iT,SAAAt9K,EAAAs9B,OAAA,IAAA6C,QAAAC,SACA,MAAA3lK,EAAA4lL,QAAA5lL,EAAA4lL,OAAA7/L,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAA4lL,OAAA7/L,SAAAkC,EACAs9I,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAA4lL,OAAA39L,IAEA,GAAA,MAAA+X,EAAA06H,SAAA16H,EAAA06H,QAAA30I,OACA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAA06H,QAAA30I,SAAAkC,EACA+zH,EAAAipK,QAAA2gC,MAAAxhS,OAAApkB,EAAA06H,QAAAzyI,GAAAs9I,EAAAs9B,OAAA,IAAA6C,QAAAC,SAEA,GAAA,MAAA3lK,EAAA4qc,gBAAA5qc,EAAA4qc,eAAA7kd,OACA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAA4qc,eAAA7kd,SAAAkC,EACA+zH,EAAAipK,QAAAomL,cAAAjnb,OAAApkB,EAAA4qc,eAAA3id,GAAAs9I,EAAAs9B,OAAA,IAAA6C,QAAAC,SAIA,OAFA,MAAA3lK,EAAA6qc,cAAAv2hB,OAAAgnG,eAAAoD,KAAA1e,EAAA,iBACAulI,EAAAs9B,OAAA,IAAAC,MAAA9iK,EAAA6qc,cACAtlU,GAcA0/I,EAAA//P,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAipK,QACAn2P,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAA6iT,SAAA7mM,EAAAipK,QAAAwkL,SAAAvkb,OAAA4J,EAAAA,EAAA+zI,UACA,MACA,KAAA,EACA7iK,EAAA4lL,QAAA5lL,EAAA4lL,OAAA7/L,SACAia,EAAA4lL,OAAA,IACA5lL,EAAA4lL,OAAAh6L,KAAAkjC,EAAA2qH,SACA,MACA,KAAA,EACAz5I,EAAA06H,SAAA16H,EAAA06H,QAAA30I,SACAia,EAAA06H,QAAA,IACA16H,EAAA06H,QAAA9uI,KAAAowH,EAAAipK,QAAA2gC,MAAA1gS,OAAA4J,EAAAA,EAAA+zI,WACA,MACA,KAAA,EACA7iK,EAAA4qc,gBAAA5qc,EAAA4qc,eAAA7kd,SACAia,EAAA4qc,eAAA,IACA5qc,EAAA4qc,eAAAh/c,KAAAowH,EAAAipK,QAAAomL,cAAAnmb,OAAA4J,EAAAA,EAAA+zI,WACA,MACA,KAAA,EACA7iK,EAAA6qc,aAAA/7a,EAAAg0I,QACA,MACA,QACAh0I,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAilR,EAAAhiH,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAipK,QACA,OAAAvmO,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAipK,QACA,GAAA,MAAAvmO,EAAAmkQ,SAAA,CACA,GAAA,iBAAAnkQ,EAAAmkQ,SACA,MAAAh9R,UAAA,sCACA7lB,EAAA6iT,SAAA7mM,EAAAipK,QAAAwkL,SAAAxmS,WAAAvkH,EAAAmkQ,UAEA,GAAAnkQ,EAAAknI,OAAA,CACA,IAAAjnK,MAAA/gB,QAAA8gD,EAAAknI,QACA,MAAA//J,UAAA,mCACA7lB,EAAA4lL,OAAA,GACA,IAAA,IAAA39L,EAAA,EAAAA,EAAAy2D,EAAAknI,OAAA7/L,SAAAkC,EACA,iBAAAy2D,EAAAknI,OAAA39L,GACAw6K,EAAA99I,OAAAO,OAAAw5B,EAAAknI,OAAA39L,GAAA+X,EAAA4lL,OAAA39L,GAAAw6K,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAknI,OAAA39L,KAAA,GACAy2D,EAAAknI,OAAA39L,GAAAlC,SACAia,EAAA4lL,OAAA39L,GAAAy2D,EAAAknI,OAAA39L,IAGA,GAAAy2D,EAAAg8E,QAAA,CACA,IAAA/7G,MAAA/gB,QAAA8gD,EAAAg8E,SACA,MAAA70G,UAAA,oCACA7lB,EAAA06H,QAAA,GACA,IAAAzyI,EAAA,EAAAA,EAAAy2D,EAAAg8E,QAAA30I,SAAAkC,EAAA,CACA,GAAA,iBAAAy2D,EAAAg8E,QAAAzyI,GACA,MAAA49B,UAAA,qCACA7lB,EAAA06H,QAAAzyI,GAAA+zH,EAAAipK,QAAA2gC,MAAA3iJ,WAAAvkH,EAAAg8E,QAAAzyI,KAGA,GAAAy2D,EAAAksZ,eAAA,CACA,IAAAjsb,MAAA/gB,QAAA8gD,EAAAksZ,gBACA,MAAA/kb,UAAA,2CACA7lB,EAAA4qc,eAAA,GACA,IAAA3id,EAAA,EAAAA,EAAAy2D,EAAAksZ,eAAA7kd,SAAAkC,EAAA,CACA,GAAA,iBAAAy2D,EAAAksZ,eAAA3id,GACA,MAAA49B,UAAA,4CACA7lB,EAAA4qc,eAAA3id,GAAA+zH,EAAAipK,QAAAomL,cAAApoS,WAAAvkH,EAAAksZ,eAAA3id,KAMA,OAHA,MAAAy2D,EAAAmsZ,eACA7qc,EAAA6qc,aAAA,EAAAnsZ,EAAAmsZ,cAEA7qc,GAYAilR,EAAA/hH,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAaA,IAZAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAAknI,OAAA,GACAlnI,EAAAg8E,QAAA,GACAh8E,EAAAksZ,eAAA,IAEA55W,EAAAuiC,WACA70E,EAAAmkQ,SAAA,KACAnkQ,EAAAmsZ,aAAA,GAEA,MAAA7qc,EAAA6iT,UAAA7iT,EAAAsb,eAAA,cACAojC,EAAAmkQ,SAAA7mM,EAAAipK,QAAAwkL,SAAAvmS,SAAAljK,EAAA6iT,SAAA7xN,IAEAhxF,EAAA4lL,QAAA5lL,EAAA4lL,OAAA7/L,OAAA,CACA24D,EAAAknI,OAAA,GACA,IAAA,IAAAxzK,EAAA,EAAAA,EAAApS,EAAA4lL,OAAA7/L,SAAAqsB,EACAssC,EAAAknI,OAAAxzK,GAAA4+E,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAA4lL,OAAAxzK,GAAA,EAAApS,EAAA4lL,OAAAxzK,GAAArsB,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAA4lL,OAAAxzK,IAAApS,EAAA4lL,OAAAxzK,GAGA,GAAApS,EAAA06H,SAAA16H,EAAA06H,QAAA30I,OAAA,CACA24D,EAAAg8E,QAAA,GACA,IAAAtoH,EAAA,EAAAA,EAAApS,EAAA06H,QAAA30I,SAAAqsB,EACAssC,EAAAg8E,QAAAtoH,GAAA4pG,EAAAipK,QAAA2gC,MAAA1iJ,SAAAljK,EAAA06H,QAAAtoH,GAAA4+E,GAGA,GAAAhxF,EAAA4qc,gBAAA5qc,EAAA4qc,eAAA7kd,OAAA,CACA24D,EAAAksZ,eAAA,GACA,IAAAx4b,EAAA,EAAAA,EAAApS,EAAA4qc,eAAA7kd,SAAAqsB,EACAssC,EAAAksZ,eAAAx4b,GAAA4pG,EAAAipK,QAAAomL,cAAAnoS,SAAAljK,EAAA4qc,eAAAx4b,GAAA4+E,GAMA,OAHA,MAAAhxF,EAAA6qc,cAAA7qc,EAAAsb,eAAA,kBACAojC,EAAAmsZ,aAAA7qc,EAAA6qc,cAEAnsZ,GAUAumO,EAAAxmQ,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGA8hH,EAAAwkL,SAAA,WAkBA,SAAAA,EAAAzhd,GAEA,GADA84B,KAAA9C,QAAA,GACAh2B,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAuJA,IACAk6K,EAAAjkJ,EA8OA,OA7XAurb,EAAAhrb,UAAAT,QAAAykJ,EAAA4D,WAQAojS,EAAAhrb,UAAA66J,MAAA,EAWAmwR,EAAArlb,OAAA,SAAApkB,EAAAulI,GAGA,GAFAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAge,SAAAhe,EAAAge,QAAAj4B,OACA,IAAA,IAAAkC,EAAA,EAAAA,EAAA+X,EAAAge,QAAAj4B,SAAAkC,EACA+zH,EAAAipK,QAAAwkL,SAAAG,MAAAxlb,OAAApkB,EAAAge,QAAA/1B,GAAAs9I,EAAAs9B,OAAA,IAAA6C,QAAAC,SAIA,OAFA,MAAA3lK,EAAAs5K,MAAAhlQ,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAAkC,KAAA/kK,EAAAs5K,MACA/zC,GAcAkkU,EAAAvkb,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAipK,QAAAwkL,SACA36a,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAge,SAAAhe,EAAAge,QAAAj4B,SACAia,EAAAge,QAAA,IACAhe,EAAAge,QAAApyB,KAAAowH,EAAAipK,QAAAwkL,SAAAG,MAAA1kb,OAAA4J,EAAAA,EAAA+zI,WACA,MACA,KAAA,EACA7iK,EAAAs5K,KAAAxqJ,EAAAi2I,OACA,MACA,QACAj2I,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAypc,EAAAxmS,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAipK,QAAAwkL,SACA,OAAA/qZ,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAipK,QAAAwkL,SACA,GAAA/qZ,EAAA1gC,QAAA,CACA,IAAAW,MAAA/gB,QAAA8gD,EAAA1gC,SACA,MAAA6H,UAAA,6CACA7lB,EAAAge,QAAA,GACA,IAAA,IAAA/1B,EAAA,EAAAA,EAAAy2D,EAAA1gC,QAAAj4B,SAAAkC,EAAA,CACA,GAAA,iBAAAy2D,EAAA1gC,QAAA/1B,GACA,MAAA49B,UAAA,8CACA7lB,EAAAge,QAAA/1B,GAAA+zH,EAAAipK,QAAAwkL,SAAAG,MAAA3mS,WAAAvkH,EAAA1gC,QAAA/1B,KAMA,OAHA,MAAAy2D,EAAA46H,OACAt5K,EAAAs5K,KAAAn7K,QAAAugD,EAAA46H,OAEAt5K,GAYAypc,EAAAvmS,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAOA,IANAsyC,EAAAkmE,QAAAlmE,EAAAuiC,YACA70E,EAAA1gC,QAAA,IAEAgzE,EAAAuiC,WACA70E,EAAA46H,MAAA,GAEAt5K,EAAAge,SAAAhe,EAAAge,QAAAj4B,OAAA,CACA24D,EAAA1gC,QAAA,GACA,IAAA,IAAA5L,EAAA,EAAAA,EAAApS,EAAAge,QAAAj4B,SAAAqsB,EACAssC,EAAA1gC,QAAA5L,GAAA4pG,EAAAipK,QAAAwkL,SAAAG,MAAA1mS,SAAAljK,EAAAge,QAAA5L,GAAA4+E,GAMA,OAHA,MAAAhxF,EAAAs5K,MAAAt5K,EAAAsb,eAAA,UACAojC,EAAA46H,KAAAt5K,EAAAs5K,MAEA56H,GAUA+qZ,EAAAhrb,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAUAsmS,EAAAK,UACA3nS,EAAA,IAAAjkJ,EAAA5pG,OAAAU,OAAAmtP,IACAA,EAAA,GAAA,SAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,QAAA,EACAjkJ,GAGAurb,EAAAG,MAAA,WAqBA,SAAAA,EAAA5hd,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KA4MA,OAnMA2hd,EAAAnrb,UAAA6vD,MAAAm0F,EAAAG,UAAA,IAQAgnS,EAAAnrb,UAAAwqQ,SAAA,EAQA2gL,EAAAnrb,UAAAqqQ,QAAA,EAQA8gL,EAAAnrb,UAAAqsb,SAAA,EAQAlB,EAAAnrb,UAAAssb,cAAA,EAWAnB,EAAAxlb,OAAA,SAAApkB,EAAAulI,GAaA,OAZAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAsuE,OAAAh6J,OAAAgnG,eAAAoD,KAAA1e,EAAA,UACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAsuE,OACA,MAAAtuE,EAAAipR,UAAA30W,OAAAgnG,eAAAoD,KAAA1e,EAAA,aACAulI,EAAAs9B,OAAA,IAAAC,MAAA9iK,EAAAipR,UACA,MAAAjpR,EAAA8oR,QAAAx0W,OAAAgnG,eAAAoD,KAAA1e,EAAA,WACAulI,EAAAs9B,OAAA,IAAAkC,KAAA/kK,EAAA8oR,QACA,MAAA9oR,EAAA8qc,UAAAx2hB,OAAAgnG,eAAAoD,KAAA1e,EAAA,aACAulI,EAAAs9B,OAAA,IAAAC,MAAA9iK,EAAA8qc,UACA,MAAA9qc,EAAA+qc,cAAAz2hB,OAAAgnG,eAAAoD,KAAA1e,EAAA,iBACAulI,EAAAs9B,OAAA,IAAAkC,KAAA/kK,EAAA+qc,cACAxlU,GAcAqkU,EAAA1kb,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAipK,QAAAwkL,SAAAG,MACA96a,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAsuE,MAAAx/C,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAipR,SAAAn6P,EAAAg0I,QACA,MACA,KAAA,EACA9iK,EAAA8oR,OAAAh6P,EAAAi2I,OACA,MACA,KAAA,EACA/kK,EAAA8qc,SAAAh8a,EAAAg0I,QACA,MACA,KAAA,EACA9iK,EAAA+qc,aAAAj8a,EAAAi2I,OACA,MACA,QACAj2I,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWA4pc,EAAA3mS,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAipK,QAAAwkL,SAAAG,MACA,OAAAlrZ,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAipK,QAAAwkL,SAAAG,MAaA,OAZA,MAAAlrZ,EAAA4vB,QACA,iBAAA5vB,EAAA4vB,MACAm0F,EAAA99I,OAAAO,OAAAw5B,EAAA4vB,MAAAtuE,EAAAsuE,MAAAm0F,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA4vB,QAAA,GACA5vB,EAAA4vB,MAAAvoF,SACAia,EAAAsuE,MAAA5vB,EAAA4vB,QAEA,MAAA5vB,EAAAuqO,WACAjpR,EAAAipR,SAAA,EAAAvqO,EAAAuqO,UAEA,MAAAvqO,EAAAoqO,SACA9oR,EAAA8oR,OAAA3qR,QAAAugD,EAAAoqO,SAEApqO,EAAAosZ,UACA,IAAA,QACA,KAAA,EACA9qc,EAAA8qc,SAAA,EACA,MACA,IAAA,OACA,KAAA,EACA9qc,EAAA8qc,SAAA,EAMA,OAHA,MAAApsZ,EAAAqsZ,eACA/qc,EAAA+qc,aAAA5sc,QAAAugD,EAAAqsZ,eAEA/qc,GAYA4pc,EAAA1mS,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GA6BA,OA5BAsyC,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA4vB,MAAA,IAEA5vB,EAAA4vB,MAAA,GACA0iB,EAAAyoD,QAAA96H,QACA+/B,EAAA4vB,MAAAm0F,EAAAG,UAAAlkH,EAAA4vB,SAEA5vB,EAAAuqO,SAAA,EACAvqO,EAAAoqO,QAAA,EACApqO,EAAAosZ,SAAA95W,EAAAp5C,QAAAzwD,OAAA,QAAA,EACAu3D,EAAAqsZ,cAAA,GAEA,MAAA/qc,EAAAsuE,OAAAtuE,EAAAsb,eAAA,WACAojC,EAAA4vB,MAAA0iB,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAsuE,MAAA,EAAAtuE,EAAAsuE,MAAAvoF,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAsuE,OAAAtuE,EAAAsuE,OAEA,MAAAtuE,EAAAipR,UAAAjpR,EAAAsb,eAAA,cACAojC,EAAAuqO,SAAAjpR,EAAAipR,UAEA,MAAAjpR,EAAA8oR,QAAA9oR,EAAAsb,eAAA,YACAojC,EAAAoqO,OAAA9oR,EAAA8oR,QAEA,MAAA9oR,EAAA8qc,UAAA9qc,EAAAsb,eAAA,cACAojC,EAAAosZ,SAAA95W,EAAAp5C,QAAAzwD,OAAA60H,EAAAipK,QAAAwkL,SAAAK,SAAA9pc,EAAA8qc,UAAA9qc,EAAA8qc,UAEA,MAAA9qc,EAAA+qc,cAAA/qc,EAAAsb,eAAA,kBACAojC,EAAAqsZ,aAAA/qc,EAAA+qc,cAEArsZ,GAUAkrZ,EAAAnrb,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAymS,EArOA,GAwOAH,EA7ZA,GAgaAxkL,EAAA2gC,MAAA,WAkBA,SAAAA,EAAA59T,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAkJA,OAzIA29T,EAAAnnS,UAAAhT,OAAAg3J,EAAAG,UAAA,IAQAgjJ,EAAAnnS,UAAA+uD,KAAAi1F,EAAAG,UAAA,IAWAgjJ,EAAAxhS,OAAA,SAAApkB,EAAAulI,GAOA,OANAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAyL,QAAAn3F,OAAAgnG,eAAAoD,KAAA1e,EAAA,WACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAyL,QACA,MAAAzL,EAAAwtE,MAAAl5J,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAwtE,MACA+3D,GAcAqgL,EAAA1gS,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAipK,QAAA2gC,MACA92R,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAyL,OAAAqjB,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAAwtE,KAAA1+C,EAAA2qH,QACA,MACA,QACA3qH,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWA4lT,EAAA3iJ,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAipK,QAAA2gC,MACA,OAAAlnQ,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAipK,QAAA2gC,MAaA,OAZA,MAAAlnQ,EAAAjzC,SACA,iBAAAizC,EAAAjzC,OACAg3J,EAAA99I,OAAAO,OAAAw5B,EAAAjzC,OAAAzL,EAAAyL,OAAAg3J,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAAjzC,SAAA,GACAizC,EAAAjzC,OAAA1lB,SACAia,EAAAyL,OAAAizC,EAAAjzC,SAEA,MAAAizC,EAAA8uB,OACA,iBAAA9uB,EAAA8uB,KACAi1F,EAAA99I,OAAAO,OAAAw5B,EAAA8uB,KAAAxtE,EAAAwtE,KAAAi1F,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA8uB,OAAA,GACA9uB,EAAA8uB,KAAAznF,SACAia,EAAAwtE,KAAA9uB,EAAA8uB,OAEAxtE,GAYA4lT,EAAA1iJ,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAuBA,OAtBAsyC,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAAjzC,OAAA,IAEAizC,EAAAjzC,OAAA,GACAulF,EAAAyoD,QAAA96H,QACA+/B,EAAAjzC,OAAAg3J,EAAAG,UAAAlkH,EAAAjzC,UAEAulF,EAAAyoD,QAAAtyJ,OACAu3D,EAAA8uB,KAAA,IAEA9uB,EAAA8uB,KAAA,GACAwjB,EAAAyoD,QAAA96H,QACA+/B,EAAA8uB,KAAAi1F,EAAAG,UAAAlkH,EAAA8uB,SAGA,MAAAxtE,EAAAyL,QAAAzL,EAAAsb,eAAA,YACAojC,EAAAjzC,OAAAulF,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAyL,OAAA,EAAAzL,EAAAyL,OAAA1lB,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAyL,QAAAzL,EAAAyL,QAEA,MAAAzL,EAAAwtE,MAAAxtE,EAAAsb,eAAA,UACAojC,EAAA8uB,KAAAwjB,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAwtE,KAAA,EAAAxtE,EAAAwtE,KAAAznF,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAwtE,MAAAxtE,EAAAwtE,MAEA9uB,GAUAknQ,EAAAnnS,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAyiJ,EAxKA,GAkLA3gC,EAAAimL,mBACA/oS,EAAA,IAAAjkJ,EAAA5pG,OAAAU,OAAAmtP,IACAA,EAAA,GAAA,QAAA,EACAjkJ,EAAAikJ,EAAA,GAAA,YAAA,EACAjkJ,GAGA+mQ,EAAAomL,cAAA,WAkBA,SAAAA,EAAArjd,GACA,GAAAA,EACA,IAAA,IAAA26K,EAAAruP,OAAAW,KAAA+yE,GAAAC,EAAA,EAAAA,EAAA06K,EAAA58K,SAAAkC,EACA,MAAAD,EAAA26K,EAAA16K,MACA64B,KAAA6hJ,EAAA16K,IAAAD,EAAA26K,EAAA16K,KAgJA,OAvIAojd,EAAA5sb,UAAAgwH,IAAAg0B,EAAAG,UAAA,IAQAyoS,EAAA5sb,UAAA72B,KAAA,EAWAyjd,EAAAjnb,OAAA,SAAApkB,EAAAulI,GAOA,OANAA,IACAA,EAAAg9B,EAAAvtP,UACA,MAAAgrF,EAAAyuI,KAAAn6N,OAAAgnG,eAAAoD,KAAA1e,EAAA,QACAulI,EAAAs9B,OAAA,IAAAppB,MAAAz5I,EAAAyuI,KACA,MAAAzuI,EAAApY,MAAAtzE,OAAAgnG,eAAAoD,KAAA1e,EAAA,SACAulI,EAAAs9B,OAAA,IAAAC,MAAA9iK,EAAApY,MACA29I,GAcA8lU,EAAAnmb,OAAA,SAAA4J,EAAAjlB,GACAilB,aAAAuzI,IACAvzI,EAAAuzI,EAAArtP,OAAA85G,IAEA,IADA,IAAAvhC,OAAA/2E,IAAAqzF,EAAAilB,EAAA5K,IAAA4K,EAAAp2B,IAAAmR,EAAA7J,EAAA,IAAAg8G,EAAAipK,QAAAomL,cACAv8a,EAAAp2B,IAAAnL,GAAA,CACA,IAAAsyE,EAAA/wC,EAAA+zI,SACA,OAAAhjG,IAAA,GACA,KAAA,EACA7/D,EAAAyuI,IAAA3/G,EAAA2qH,QACA,MACA,KAAA,EACAz5I,EAAApY,KAAAknC,EAAAg0I,QACA,MACA,QACAh0I,EAAAi0I,SAAA,EAAAljG,IAIA,OAAA7/D,GAWAqrc,EAAApoS,WAAA,SAAAvkH,GACA,GAAAA,aAAAs9D,EAAAipK,QAAAomL,cACA,OAAA3sZ,EACA,IAAA1+C,EAAA,IAAAg8G,EAAAipK,QAAAomL,cAOA,OANA,MAAA3sZ,EAAA+vF,MACA,iBAAA/vF,EAAA+vF,IACAg0B,EAAA99I,OAAAO,OAAAw5B,EAAA+vF,IAAAzuI,EAAAyuI,IAAAg0B,EAAAG,UAAAH,EAAA99I,OAAA5+B,OAAA24D,EAAA+vF,MAAA,GACA/vF,EAAA+vF,IAAA1oJ,SACAia,EAAAyuI,IAAA/vF,EAAA+vF,MAEA/vF,EAAA92D,MACA,IAAA,OACA,KAAA,EACAoY,EAAApY,KAAA,EACA,MACA,IAAA,WACA,KAAA,EACAoY,EAAApY,KAAA,EAGA,OAAAoY,GAYAqrc,EAAAnoS,SAAA,SAAAljK,EAAAgxF,GACAA,IACAA,EAAA,IACA,IAAAtyC,EAAA,GAiBA,OAhBAsyC,EAAAuiC,WACAviC,EAAAyoD,QAAAtyJ,OACAu3D,EAAA+vF,IAAA,IAEA/vF,EAAA+vF,IAAA,GACAz9C,EAAAyoD,QAAA96H,QACA+/B,EAAA+vF,IAAAg0B,EAAAG,UAAAlkH,EAAA+vF,OAEA/vF,EAAA92D,KAAAopG,EAAAp5C,QAAAzwD,OAAA,OAAA,GAEA,MAAA6Y,EAAAyuI,KAAAzuI,EAAAsb,eAAA,SACAojC,EAAA+vF,IAAAz9C,EAAAyoD,QAAAtyJ,OAAAs7K,EAAA99I,OAAAP,OAAApkB,EAAAyuI,IAAA,EAAAzuI,EAAAyuI,IAAA1oJ,QAAAirG,EAAAyoD,QAAA96H,MAAAA,MAAAF,UAAAv4B,MAAAw4B,KAAA1e,EAAAyuI,KAAAzuI,EAAAyuI,KAEA,MAAAzuI,EAAApY,MAAAoY,EAAAsb,eAAA,UACAojC,EAAA92D,KAAAopG,EAAAp5C,QAAAzwD,OAAA60H,EAAAipK,QAAAimL,kBAAAlrc,EAAApY,MAAAoY,EAAApY,MAEA82D,GAUA2sZ,EAAA5sb,UAAAvW,OAAA,WACA,OAAA4Y,KAAA2M,YAAAy1I,SAAApiJ,KAAAshJ,EAAA1hJ,KAAAyiJ,gBAGAkoS,EAtKA,GAyKApmL,EAzgCA,GA4gCA9wW,EAAAC,QAAA4nM,4DCvhCA,aAEA,MAAAowV,EAAA/3hB,EAAA,eAAAu1hB,MAEAz1hB,EAAAC,QAAA,MAQAuD,YAAA82N,EAAAw6I,EAAA6hL,EAAAhiL,EAAAiiL,GACAjqb,KAAA+1E,MAAA,IAAAu1W,EAAA39T,EAAAw6I,EAAA6hL,GACAhqb,KAAAgoQ,OAAA3qR,QAAA2qR,GACAhoQ,KAAAiqb,aAAA5sc,QAAA4sc,GAGAt8T,UACA,OAAA3tH,KAAA+1E,MAAA43C,IAGAA,QAAAA,GACA3tH,KAAA+1E,MAAA43C,IAAAA,EAGAw6I,eACA,OAAAnoQ,KAAA+1E,MAAAoyL,SAGAA,aAAAxuQ,GACAqG,KAAA+1E,MAAAoyL,SAAAxuQ,EAGAqwb,eACA,OAAAhqb,KAAA+1E,MAAAi0W,SAGAA,aAAArwb,GACAqG,KAAA+1E,MAAAi0W,SAAArwb,EAGAnY,IAAAtrF,OAAAspM,eAEA,MAAA,uBADAx/F,KAAA2tH,IAAAvvH,SAAA,yBACA4B,KAAAgoQ,qBAAAhoQ,KAAAmoQ,YAMAtxW,OAAAmgP,GACA,OAAAh3I,KAAAgoQ,SAAAhxH,EAAAgxH,QACAhoQ,KAAAiqb,eAAAjzS,EAAAizS,cACAjqb,KAAAgqb,WAAAhzS,EAAAgzS,UACAhqb,KAAA+1E,MAAAikD,OAAAgd,EAAAjhE,4DCtDA,aAEA,MAAAo1W,OAAAA,GAAA53hB,EAAA,eACAu1hB,EAAAv1hB,EAAA,WAMA,MAAAo1hB,EAKA9xhB,YAAA0kU,GAEAv7N,KAAAve,IAAA,IAAAuB,IACAgd,KAAA8uX,OAAAvzJ,EAGAt2P,aACA,OAAA+6B,KAAAve,IAAAwb,KAQApmG,IAAA82N,EAAAw6I,EAAA6hL,GAEA,MAAA7lL,EAAA5wW,EAAA,cAEA22hB,EAAAv8T,EAAAvvH,SAAA,aACA23E,EAAA/1E,KAAAve,IAAAD,IAAA0oc,GAEAn0W,GACAA,EAAAq5S,MACAr5S,EAAAoyL,SAAAA,EAGApyL,EAAAi0W,WAAA7lL,EAAA6kL,SAAAmB,MAAAH,IAAA7lL,EAAA6kL,SAAAlkJ,QACA/uN,EAAAi0W,SAAAA,KAGAhqb,KAAAve,IAAAA,IAAAyoc,EAAA,IAAApB,EAAAn7T,EAAAw6I,EAAA6hL,IACAhqb,KAAA8uX,QACA9uX,KAAA8uX,OAAAhkZ,KAAA,KAAA,eAAA,IAQAj0E,OAAA82N,GACA,MAAAu8T,EAAAv8T,EAAAvvH,SAAA,aACA23E,EAAA/1E,KAAAve,IAAAD,IAAA0oc,GAEAn0W,IAIAA,EAAA7sB,MAGA6sB,EAAAw1W,YAIAvrb,KAAAve,IAAAgC,OAAAymc,GACAlqb,KAAA8uX,QACA9uX,KAAA8uX,OAAAhkZ,KAAA,KAAA,gBAAA,KAOAj0E,YAAAqzhB,GACAlqb,KAAAve,IAAA1C,IAAAmrc,IACAlqb,KAAAve,IAAAgC,OAAAymc,GAOArzhB,QAAA+tF,GACA,OAAAob,KAAAve,IAAArtF,QAAAwwF,GAGA/tF,UACA,OAAAmpG,KAAAve,IAAAyb,UAGArmG,gBAGA,OAAA,IAAAmsF,IAAAmoc,GAAAj7W,GAAAA,EAAA,GAAAl7K,KAAA6oG,MAAA4rD,KAAAzpD,KAAAve,IAAAyb,aAMArmG,SAAA82N,GACA,MAAAu8T,EAAAv8T,EAAAvvH,SAAA,aACA,OAAA4B,KAAAve,IAAAD,IAAA0oc,IAIAvB,EAAAG,MAAAA,EACAz1hB,EAAAC,QAAAq1hB,4FChHA,aAEA,MAAA6C,EAMA30hB,YAAA82N,EAAAw6I,EAAA6hL,GAEAhqb,KAAAyrb,YAAA,EAEAzrb,KAAA2tH,IAAAA,EACA3tH,KAAAmoQ,SAAAA,GAAA,EACAnoQ,KAAAgqb,SAAAA,EAGAnzhB,MACAmpG,KAAAyrb,aAAA,EAGA50hB,MACAmpG,KAAAyrb,YAAA7ld,KAAAD,IAAA,EAAAq6B,KAAAyrb,YAAA,GAGA50hB,UACA,OAAAmpG,KAAAyrb,YAAA,EAIAjqc,IAAAtrF,OAAAspM,eAEA,MAAA,uBADAx/F,KAAA2tH,IAAAvvH,SAAA,2BACA4B,KAAAmoQ,mBAAAnoQ,KAAAyrb,eAMA50hB,OAAAmgP,GACA,OAAAh3I,KAAAyrb,cAAAz0S,EAAAy0S,aACAzrb,KAAA2tH,IAAAqM,OAAAgd,EAAArpB,MACA3tH,KAAAmoQ,WAAAnxH,EAAAmxH,UACAnoQ,KAAAgqb,WAAAhzS,EAAAgzS,UAIA32hB,EAAAC,QAAAk4hB,gCC9CA,aAIAn4hB,EAAAC,QAAA,CACAo4hB,uBAAA,EACAC,uBAAA,IACAC,gBAAA,KACAC,eAAA,KACA9C,aAAAnjd,KAAAy5J,IAAA,EAAA,IAAA,EACAyoO,aAAA,IACAgkF,uBAAA,iCCXA,aAGA,MAAArvF,EAAAlpc,EAAA,oBAEA4wW,EAAA5wW,EAAA,oBACA+4f,EAAA/4f,EAAA,YAAA+4f,QACAw/B,uBAAAA,GAAAv4hB,EAAA,gBAQAF,EAAAC,QAAA,MAMAuD,YAAAk1hB,EAAAC,EAAA9xN,GACAl6N,KAAA07H,OAAAswT,EACAhsb,KAAAk6N,QAAAA,EACAl6N,KAAAmpb,OAAA,EAMAnpb,KAAAisb,SAAA,GAEAjsb,KAAAs3a,KAAAhrB,EAAAy/B,EAAA,YACA/rb,KAAAksb,YAAAzvF,EAAAz8V,KAAAmsb,aAAAxzb,KAAAqH,MAAA8rb,GAMAj1hB,WAAA44E,GACAA,EAAAogD,OAIA7vB,KAAA2yH,KAAAljJ,GAMA54E,WAAAqmG,GACA8C,KAAAisb,SAAAjsb,KAAAisb,SAAAp6b,OAAAqL,GACA8C,KAAAksb,cAMAr1hB,eACA,IAAAmpG,KAAAisb,SAAAhnd,OACA,OAGA,MAAAwK,EAAA,IAAA00R,GAAA,GACAnkQ,KAAAisb,SAAA73hB,SAAA2hL,IACAA,EAAAiyL,OACAv4R,EAAAu4R,OAAAjyL,EAAA43C,KAEAl+I,EAAA45c,SAAAtzW,EAAA43C,IAAA53C,EAAAoyL,aAGAnoQ,KAAAisb,SAAA,GACAjsb,KAAAspb,WAAA75c,GAMA54E,WAAA44E,GACA,UACAuwB,KAAAk6N,QAAAkyN,UAAApsb,KAAA07H,QACA,MAAAjiI,GAEA,YADAuG,KAAAs3a,KAAA/nc,MAAA,8BAAAywB,KAAA07H,OAAA7C,cAAAp/H,EAAA9f,SAIAqmB,KAAAs3a,KAAA,6BAAAt3a,KAAA07H,OAAA7C,eAGA74H,KAAAk6N,QAAAg0M,YAAAlua,KAAA07H,OAAAjsJ,GAAAyuB,OAAAzE,IACAuG,KAAAs3a,KAAA/nc,MAAA,iBAAAkqB,EAAA9f,2IC1FAtmF,EAAAC,QAEA,SAAAsxF,EAAA83W,EAAA2vF,GACA,IAAAvhX,EAAA,KACAwhX,EAAA,KAEAl/X,EAAA,WACA0d,IACAmlD,aAAAnlD,GAEAwhX,EAAA,KACAxhX,EAAA,OAaAyhX,EAAA,WACA,IAAA7vF,EACA,OAAA93W,EAAAw+G,MAAApjG,KAAA3pB,WAGA,IAAA7M,EAAAw2B,KACA5pB,EAAAC,UACAm2c,EAAAH,IAAAvhX,EAkBA,OAjBA1d,IAEAk/X,EAAA,WACA1nc,EAAAw+G,MAAA55H,EAAA4M,IAGA00F,EAAAD,YAAA,WAGA,GAFAC,EAAA,MAEA0hX,EAAA,CACA,IAAA5ub,EAAA0ub,EAGA,OAFAA,EAAA,KAEA1ub,OAEA8+V,GAEA8vF,EACAF,SADA,GAQA,OAHAC,EAAAvkL,OAAA56M,EACAm/X,EAAA7rW,MAxCA,WACA,IAAA9iF,EAAA0ub,EACAl/X,IAEAxvD,GACAA,KAqCA2ub,iCCzDA,aAEA,MAAA/+F,EAAAj6b,EAAA,uBACAk1U,KAAAA,GAAAl1U,EAAA,WAEAo1b,EAAAp1b,EAAA,sDAEA4wW,EAAA5wW,EAAA,mBACAq1hB,EAAAr1hB,EAAA,eACA+4f,EAAA/4f,EAAA,WAAA+4f,OAkBAmgC,EAAA,sBACAC,EAAA,sBACAC,EAAA,sBAmQAt5hB,EAAAC,QAjQA,MAQAuD,YAAA8kU,EAAAP,EAAAG,EAAA5mU,EAAA,IACAqrG,KAAAs3a,KAAAhrB,EAAA3wL,EAAAjgG,OAAA,WACA17H,KAAA0iV,QAAA/mH,EACA37N,KAAAy6U,SAAAr/G,EACAp7N,KAAA4sb,WAAA,CAAAH,GAEA93hB,EAAAk4hB,WAEA7sb,KAAA4sb,WAAA9zc,QAAA4zc,GACA1sb,KAAA4sb,WAAA9zc,QAAA6zc,IAGA3sb,KAAA8uX,OAAAvzJ,EACAv7N,KAAAguX,UAAA,EAGAhuX,KAAA6sV,eAAA7sV,KAAA6sV,eAAAl0V,KAAAqH,MACAA,KAAA8sb,kBAAA9sb,KAAA8sb,kBAAAn0b,KAAAqH,MACAA,KAAA+sb,cAAA/sb,KAAA+sb,cAAAp0b,KAAAqH,MAGAnpG,QACAmpG,KAAAguX,UAAA,EACAhuX,KAAA0iV,QAAA14J,OAAAhqL,KAAA4sb,WAAA5sb,KAAA+sb,eAGA,MAAAljG,EAAA,IAAAlB,EAAA,CACA9I,YAAA7/U,KAAA4sb,WACAr4U,SAAA,CACAu1O,UAAA9pV,KAAA6sV,eACA9C,aAAA/pV,KAAA8sb,qBAGA9sb,KAAAypV,aAAAzpV,KAAA0iV,QAAA4G,UAAAz/P,SAAAggQ,GAGA,IAAA,MAAA/P,KAAA95U,KAAA0iV,QAAAzhC,UAAAxe,MAAArlS,SAAA,CACA,MAAAmtV,EAAAvqV,KAAA0iV,QAAAtE,kBAAA58V,IAAAs4V,EAAA71V,IAEAsmW,GAAAvqV,KAAA6sV,eAAAtC,EAAAL,aAIArzb,OACAmpG,KAAAguX,UAAA,EAGAhuX,KAAA0iV,QAAAs1C,SAAAh4X,KAAA4sb,YAGA,MAAA5sb,KAAAypV,cACAzpV,KAAA0iV,QAAA4G,UAAAU,WAAAhqV,KAAAypV,cAaA5yb,qBAAA00M,SAAAA,EAAAilB,OAAAA,EAAAy5N,WAAAA,IACA,GAAAjqV,KAAAguX,SAAA,CACAhuX,KAAAs3a,KAAA,6CAAA/rU,EAAA0+O,EAAAC,WAAArxN,eAEA,UACA4vG,EACAj4G,EACAg9N,EAAAppV,UAIAkvC,MAAAv+D,IACA,UAAA,MAAA23E,KAAA33E,EACA,IACA,MAAA4E,QAAAwqR,EAAA9F,YAAA3xM,EAAAtnF,eACA46B,KAAAy6U,SAAAuyG,gBAAA/iG,EAAAC,WAAAvwW,GACA,MAAA8f,GACAuG,KAAAy6U,SAAAwyG,cAAAxzb,GACA,UAKA,MAAAA,GACAuG,KAAAs3a,KAAA79a,KAQA5iG,eAAA6kO,GACA17H,KAAAy6U,SAAAkP,iBAAAjuN,GAOA7kO,kBAAA6kO,GACA17H,KAAAy6U,SAAAmP,oBAAAluN,GAYA7kO,cAAA82N,EAAAu/T,EAAAv4hB,EAAA,IACA,OAAAqrG,KAAA0iV,QAAA+gB,eAAAwC,cACAt4O,EACA,CAGA6tQ,WAAAotD,EAAA+C,uBACAzlF,gBAAAgnF,EACAr9T,OAAAl7N,EAAAk7N,SAYAh5N,qBAAA82N,EAAAh5N,GACA,MAAAw4hB,EAAA,GACA,UAAA,MAAAh2E,KAAAn3W,KAAAimW,cAAAt4O,EAAAi7T,EAAA8C,uBAAA/2hB,GACAqrG,KAAAs3a,KAAA,0BAAAngE,EAAAlzX,MACAkpc,EAAArid,KACAk1B,KAAAosb,UAAAj1E,EAAAlzX,GAAAtvF,GACAupG,OAAAzE,IAEAuG,KAAAs3a,KAAA/nc,MAAAkqB,aAIAssE,QAAA2gD,IAAAymU,GAUAt2hB,cAAA82N,EAAAh5N,SAEAqrG,KAAA0iV,QAAA+gB,eAAA3jR,QAAA6tC,EAAAh5N,GAUAkC,kBAAAijb,EAAArqW,GACA,IAAAuwB,KAAAguX,SAAA,MAAA,IAAAl1X,MAAA,yBAEA,MAAAs0b,EAAAtzG,EAAAjhN,cACA74H,KAAAs3a,KAAA,oBAAA8V,EAAA39c,GAEA,MAAAw6W,QAAAjqV,KAAA0iV,QAAA8pB,KAAA1yB,IACAtpN,OAAAA,EAAAjlB,SAAAA,SAAA0+O,EAAAO,UAAA,CAAAmiG,EAAAD,EAAAD,IAGA,IAAAp+H,EACA,OAAA9iN,GACA,KAAAkhV,EACAp+H,EAAA5+U,EAAA49c,wBACA,MACA,KAAAX,EACA,KAAAC,EACAt+H,EAAA5+U,EAAA69c,wBACA,MACA,QACA,MAAA,IAAAx0b,MAAA,qBAAAyyG,IA8CAj4D,eAAAk9E,EAAA/gJ,EAAA48I,GACA,UACAo8G,EACA,CAAAh5P,GACA+9W,EAAAlqV,SACAktH,GAEA,MAAA/2H,GACA4yH,EAAA5yH,IAlDA8zb,CAAA/8T,EAAA69L,EAAAruT,KAAAs3a,MAEAt3a,KAAAwtb,iBAAA1zG,EAAArqW,EAAAq1L,QAWAjuQ,gBAAAijb,EAAAnlb,GACA,IAAAqrG,KAAAguX,SACA,MAAA,IAAAl1X,MAAA,yBAGA,OAAAkH,KAAA0iV,QAAA8pB,KAAA1yB,EAAAnlb,GAQAkC,iBAAAijb,EAAAh1K,GACA,MAAAppC,EAAAo+M,EAAAjhN,cAEA74H,KAAA8uX,SACAhqN,EAAA1wQ,SAAAo5J,GAAAxtD,KAAA8uX,OAAAhkZ,KAAA4wJ,EAAA,WAAAluE,EAAAd,KAAAznF,UACA+6B,KAAA8uX,OAAAhkZ,KAAA4wJ,EAAA,aAAAopC,EAAA7nK,kNCzQA,aAQA,MAAAsxH,EAAAh7N,EAAA,QAEA4wW,EAAA5wW,EAAA,oBACAy1hB,EAAA7kL,EAAA6kL,SACAL,EAAAp1hB,EAAA,qBACAk6hB,EAAAl6hB,EAAA,YACAm6hB,EAAAn6hB,EAAA,eACAo6hB,EAAAp6hB,EAAA,kBACA+4f,OAAAA,GAAA/4f,EAAA,YA8eAF,EAAAC,QA7dA,MAUAuD,YAAA6kO,EAAAg1L,EAAAx2F,EAAAqB,EAAAx6J,EAAA,IACA/gE,KAAAs3a,KAAAhrB,EAAA5wR,EAAA,UACA17H,KAAA0wT,WAAAA,EACA1wT,KAAAk6N,QAAAA,EACAl6N,KAAA8uX,OAAAvzJ,EACAv7N,KAAA4tb,MAAA5tb,KAAA6tb,aAAA9sX,GAIA/gE,KAAA8tb,UAAA,IAAA9qc,IACAgd,KAAAguX,UAAA,EAGAhuX,KAAA+tb,cAAA,IAAAL,EAAAC,GASA92hB,aAAAkqK,GACA,MAAA,CACAitX,2BApCA,KAqCAC,kBA5CA,SA6CAltX,GAOAlqK,wBACAg0K,YAAA,KACA7qE,KAAAkub,mBAUAr3hB,sBACA,IAAAmpG,KAAAguX,SACA,OAGA,MAAAtyP,OAAAA,EAAA4wK,MAAAA,EAAA6hJ,YAAAA,GAAAnub,KAAA+tb,cAAAK,SAAApub,KAAA4tb,MAAAK,mBAEA,GAAA,IAAA3hJ,EAAArnU,OACA,OAIA,MAAAwK,EAAA,IAAA00R,GAAA,GAGA10R,EAAAm7c,gBAAAuD,GAGA,MAAAE,EAAA,GACAC,EAAA,IAAAtrc,IACA,IAAA,MAAA8iX,KAAAx5D,EAAA,CACA,MAAA3+K,EAAA,IAAAY,EAAAu3O,EAAAznE,OACAynE,EAAAp5S,KAAA6hY,UACAzoF,EAAAp5S,KAAA8hY,aACAH,EAAAvjd,KAAA6iJ,GACA2gU,EAAA7sc,IAAAqkX,EAAAznE,MAAAynE,EAAAp5S,OAGAj9E,EAAAg7c,QAAA98T,GAIAl+I,EAAAi7c,YAAA/8T,GAIA,MAAAm3C,QAAA9kK,KAAAyub,WAAAJ,GACA,IAAA,MAAAhwJ,EAAAqwJ,KAAAJ,EAAA,CACA,MAAAK,EAAA7pR,EAAAtjL,IAAA68S,GAEA,GAAAswJ,EAEAl/c,EAAAk7c,SAAAgE,QAIA,GAAAD,EAAAzE,aAAA,CACA,MAAAt8T,EAAA,IAAAY,EAAA8vK,GACA5uT,EAAAi7c,YAAA/8T,IAMA,GAAAl+I,EAAAogD,MAMA,OALA6rG,GAAA17H,KAAA+tb,cAAAa,UAAAlzT,EAAA4wK,QAGAtsS,KAAA6ub,wBAKA,IAEAnzT,SAAA17H,KAAAk6N,QAAAg0M,YAAAxyS,EAAAjsJ,GAGA,IAAA,MAAA+9E,KAAAs3G,EAAA1nK,SACAs+H,GAAA17H,KAAA8ub,YAAApzT,EAAAluE,GAEA,MAAA/zD,GACAuG,KAAAs3a,KAAA/nc,MAAAkqB,GAIAiiI,GAAA17H,KAAA+tb,cAAAa,UAAAlzT,EAAA4wK,GAGAtsS,KAAA6ub,wBAOAh4hB,gBAAA6kO,GACA,MAAA2zO,EAAA3zO,EAAA7C,cACAk2T,EAAA/ub,KAAA8tb,UAAAtsc,IAAA6tX,GACA,OAAA0/E,EAAAA,EAAAhtJ,SAAAitJ,gBAAA,IAAAhsc,IAMAnsF,cAAA6kO,GACA,MAAA2zO,EAAA3zO,EAAA7C,cAEAk2T,EAAA/ub,KAAA8tb,UAAAtsc,IAAA6tX,GAEA,OAAA0/E,EAIA,CACAj1G,KAAAi1G,EAAAE,QAAAC,UACAx7hB,MAAAq7hB,EAAAI,YACA//E,KAAA2/E,EAAAK,WAAAC,UACAC,KAAAP,EAAAK,WAAAG,UACAC,UAAAT,EAAAU,eARA,KAeA54hB,QACA,OAAAgnG,MAAA4rD,KAAAzpD,KAAA8tb,UAAA1wb,UAAAhzB,KAAA2e,GAAAA,EAAAkmc,UAUAp4hB,eAAAiuQ,GACAA,EAAA7/L,SAKA+6B,KAAA8tb,UAAA15hB,SAAA26hB,IACAjqR,EAAA1wQ,SAAAo5J,IAEA,MAAAylX,EAAA8b,EAAAW,iBAAAliY,EAAAmgE,KACA,IAAAslT,EACA,OAKA,MAAAxxQ,EAAAj0G,EAAAd,KAAAznF,OACAupd,EAAAxub,KAAA2vb,aAAA1c,EAAA+W,SAAAvoR,GAEA,IAAAmuR,EAAAnuR,EACA+sR,IACAoB,EAAAzrL,EAAA0mL,kBAAA5X,EAAAtlT,MAGA3tH,KAAA+tb,cAAA8B,UAAAd,EAAAE,QAAA,CAAA,CACA5wJ,MAAA40I,EAAAtlT,IAAAvvH,WACA+pQ,SAAA8qK,EAAA9qK,SACAlrQ,KAAA2yb,EACAljY,KAAA,CACA+0G,UAAAA,EACA+sR,YAAAA,EACAD,WAAA,EACAtE,cAAA,YAMAjqb,KAAA6ub,yBAUAh4hB,sBAAA6kO,EAAAjsJ,GACA,MAAAs/c,EAAA/ub,KAAA8vb,cAAAp0T,GAEA,GAAAjsJ,EAAAogD,MACA,OAWA,GAPApgD,EAAA+oL,OACAu2R,EAAAhtJ,SAAA,IAAA4mJ,GAIA3ob,KAAA+vb,uBAAAtgd,EAAAq1L,OAAAiqR,GAEA,IAAAt/c,EAAAsyT,SAAA9kS,KAEA,YADA+C,KAAA6ub,wBAMA,MAAAmB,EAAA,GAEAC,EAAA,GACAxgd,EAAAsyT,SAAA3tY,SAAA2hL,IACAA,EAAAiyL,QACA+mL,EAAAmB,WAAAn6W,EAAA43C,KACAqiU,EAAAlld,KAAAirG,EAAA43C,OAEAohU,EAAAkB,MAAAl6W,EAAA43C,IAAA53C,EAAAoyL,SAAApyL,EAAAi0W,UACAiG,EAAAnld,KAAAirG,OAIA/1E,KAAAmwb,aAAAz0T,EAAAs0T,SACAhwb,KAAAowb,UAAA10T,EAAAu0T,GAEAjwb,KAAA6ub,wBASAh4hB,aAAA6kO,EAAA0mK,GACA,IAAA,MAAA31T,KAAA21T,EACApiS,KAAA+tb,cAAArwb,OAAAjxB,EAAA2xB,WAAAs9H,GAUA7kO,gBAAA6kO,EAAAu0T,GAEA,MAAAluL,QAAA/hQ,KAAAqwb,eAAAJ,EAAA7ld,KAAAq6I,GAAAA,EAAAkJ,OAEA2+K,EAAA,GACA,IAAA,MAAA2mI,KAAAgd,EAAA,CACA,MAAAhsc,EAAAgvb,EAAAtlT,IAAAvvH,WACAqjK,EAAAsgG,EAAAvgR,IAAAyC,GAGA,GAAA,MAAAw9K,EAEAwxQ,EAAAgX,cACA39I,EAAAxhU,KAAA,CACAuzT,MAAAp6S,EACAkkR,SAAA8qK,EAAA9qK,SACAlrQ,KAAAknQ,EAAA0mL,kBAAA5X,EAAAtlT,KACAjhE,KAAA,CACA8hY,YAAAvb,EAAA+W,WAAAhB,EAAAlkJ,MACArjI,UAAA,EACA8sR,WAAA,EACAtE,aAAAhX,EAAAgX,oBAIA,CAKA,MAAAuE,EAAAxub,KAAA2vb,aAAA1c,EAAA+W,SAAAvoR,GAMA,IAAAmuR,EAAAnuR,EACA+sR,IACAoB,EAAAzrL,EAAA0mL,kBAAA5X,EAAAtlT,MAGA2+K,EAAAxhU,KAAA,CACAuzT,MAAAp6S,EACAkkR,SAAA8qK,EAAA9qK,SACAlrQ,KAAA2yb,EACAljY,KAAA,CACA8hY,YAAAA,EACA/sR,UAAAA,EACA8sR,WAAA,EACAtE,aAAAhX,EAAAgX,gBAKAjqb,KAAA+tb,cAAA8B,UAAAn0T,EAAA4wK,IASAz1Y,aAAAmzhB,EAAAvoR,GACA,OAAAuoR,IAAAhB,EAAAlkJ,OACArjI,GAAAzhK,KAAA4tb,MAAAI,2BAQAn3hB,qBAAAurY,GACA,MAAAt9H,QAAA9kK,KAAAyub,WAAArsJ,GACA,OAAA,IAAAp/S,IAAA,IAAA8hL,GAAA16L,KAAA,EAAA/1E,EAAAywK,KAAA,CAAAzwK,EAAAywK,EAAApY,KAAAznF,WAQApuE,iBAAAurY,GACA,MAAAr2T,EAAA,IAAAiX,IAWA,aAVA+iF,QAAA2gD,IAAA07K,EAAAh4T,KAAAkpE,MAAAq6E,IACA,IACA,MAAAngE,QAAAxtD,KAAA0wT,WAAAlvU,IAAAmsI,GACA5hJ,EAAA0V,IAAAksI,EAAAvvH,WAAAovD,GACA,MAAAz5J,GACA,kBAAAA,EAAAsB,MACA2qG,KAAAs3a,KAAA/nc,MAAA,wCAAAo+I,EAAA55N,QAIAg4E,EAQAl1E,uBAAAy5hB,EAAAvB,GACAuB,EAAAl8hB,SAAAklF,IACA0mB,KAAAs3a,KAAA,uBAAAh+b,EAAAozE,KAAAznF,QACA8pd,EAAAwB,cAAAj3c,EAAAozE,KAAAznF,WAYApuE,YAAA6kO,EAAAluE,GACA,MAAAuhY,EAAA/ub,KAAA8vb,cAAAp0T,GACAqzT,EAAAyB,UAAAhjY,EAAAA,EAAAd,KAAAznF,OAAA,GACAuoF,GAAAA,EAAAmgE,KACAohU,EAAAhtJ,SAAArkS,OAAA8vD,EAAAmgE,KAQA92N,eAAA6kO,GACA,OAAA17H,KAAA8vb,cAAAp0T,GAAA0zT,WAAAC,UAQAx4hB,qBAAA6kO,GACA,OAAA17H,KAAA8vb,cAAAp0T,GAAA0zT,WAAAG,UAQA14hB,iBAAA4gY,IAcA5gY,cAAA6kO,GACA,MAAA2zO,EAAA3zO,EAAA7C,cACAk2T,EAAA/ub,KAAA8tb,UAAAtsc,IAAA6tX,GACA,GAAA0/E,EACA,OAAAA,EAGA,MAAAhmc,EAAA,IAAA0kc,EAAA/xT,GAOA,OALA17H,KAAA8tb,UAAArsc,IAAA4tX,EAAAtmX,GACAiX,KAAA8uX,QACA9uX,KAAA8uX,OAAAhkZ,KAAAukY,EAAA,YAAA,GAGAtmX,EAGAlyF,QACAmpG,KAAAguX,UAAA,EAGAn3d,OACAmpG,KAAAguX,UAAA,yLC1fA,aAEA,MAAA26D,EAAAp1hB,EAAA,qBA6EAF,EAAAC,QAvEA,MAIAuD,YAAA6kO,GACA17H,KAAAivb,QAAAvzT,EACA17H,KAAA+hS,SAAA,IAAA4mJ,EAEA3ob,KAAAyvb,cAAA,EACAzvb,KAAAywb,WAAA,IAAAztc,IAEAgd,KAAAovb,WAAA,CACAC,UAAA,EACAE,UAAA,GAOA14hB,UAAA5C,GACA+rG,KAAAyvb,gBACAzvb,KAAA0wb,cAAA,IAAA3yb,MAAAvB,UACAwD,KAAAovb,WAAAC,WAAAp7hB,EAMA4C,cAAA5C,GACA+rG,KAAAyvb,gBACAzvb,KAAA0wb,cAAA,IAAA3yb,MAAAvB,UACAwD,KAAAovb,WAAAG,WAAAt7hB,EAUA4C,MAAA82N,EAAAw6I,EAAA6hL,GACAhqb,KAAA+hS,SAAA/iT,IAAA2uI,EAAAw6I,EAAA6hL,GAQAnzhB,WAAA82N,GACA3tH,KAAA+hS,SAAArkS,OAAAiwH,GAOA92N,iBAAA82N,GACA,OAAA3tH,KAAA+hS,SAAA1wC,SAAA1jI,GAMA92N,YACA,OAAAmpG,KAAAovb,WAAAC,WAAArvb,KAAAovb,WAAAG,UAAA,8DC3EA,aAEA,MAAAoB,EAAAp9hB,EAAA,uBAwBAq9hB,EAAA,CACAC,WAAA,KACA,EAGAh6hB,WAsIA,MAAAi6hB,EAKAj6hB,YAAA6kO,EAAAq1T,GACA/wb,KAAA07H,OAAAA,EACA17H,KAAAgxb,YAAAD,EACA/wb,KAAAixb,iBAAA,EACAjxb,KAAAkxb,SAAA,IAAAC,EACAnxb,KAAAoxb,QAAA,IAAAzyc,IASA9nF,UAAAy1Y,GACA,IAAA,MAAAvtP,KAAAutP,EACAtsS,KAAAqxb,UAAAtyY,GAUAloJ,UAAAivc,GAGA,IAAA9lW,KAAAsxb,gCAAAxrF,GACA,OAIA,MAAAyrF,EAAAvxb,KAAAkxb,SAAA1vc,IAAAskX,EAAAznE,OACA,GAAAkzJ,EAYA,OAVAzrF,EAAA39F,SAAAopL,EAAAppL,UAEAnoQ,KAAAkxb,SAAAM,eAAA1rF,EAAAznE,MAAAynE,EAAA39F,eAIAnoQ,KAAAgxb,YAAA/hU,MAAA62O,EAAAyrF,GAQAvxb,KAAAkxb,SAAAlyc,IAAA8mX,GAWAjvc,gCAAAivc,GACA,MAAA2rF,EAAA,GACA,IAAA,MAAAC,KAAA1xb,KAAAoxb,QACAM,EAAArzJ,QAAAynE,EAAAznE,OACAozJ,EAAA3md,KAAA4md,GAKA,OAAA,IAAAD,EAAAxsd,QAIA+6B,KAAAgxb,YAAAH,WAAA/qF,EAAA2rF,GASA56hB,SAAA86hB,GACA,IAAA10b,EAAA,EACA,MAAAqvS,EAAA,GAIAslJ,EAAA5xb,KAAAkxb,SAAA5kJ,QACA,IAAA,IAAAnlU,EAAA,EAAAA,EAAAyqd,EAAA3sd,QAAAg4B,EAAA00b,EAAAxqd,IAAA,CACA,MAAA2+X,EAAA8rF,EAAAzqd,GACAmlU,EAAAxhU,KAAAg7X,GACA7oW,GAAA6oW,EAAA7oW,KAGA+C,KAAAkxb,SAAAztc,OAAAqiX,EAAAznE,OACAr+R,KAAAixb,kBAAAnrF,EAAA7oW,KACA+C,KAAAoxb,QAAApyc,IAAA8mX,GAGA,MAAA,CACAx5D,MAAAA,EAAA6hJ,YAAAnub,KAAAkxb,SAAAW,WAWAh7hB,SAAAivc,GACA9lW,KAAAoxb,QAAAryc,IAAA+mX,KACA9lW,KAAAixb,kBAAAnrF,EAAA7oW,KACA+C,KAAAoxb,QAAA3tc,OAAAqiX,IAUAjvc,OAAAwnY,GACAr+R,KAAAkxb,SAAAztc,OAAA46S,GAQAxnY,SACA,OAAA,IAAAmpG,KAAAkxb,SAAAjsd,QAAA,IAAA+6B,KAAAoxb,QAAAn0b,KAWApmG,eAAAgwE,EAAAyS,GAEA,OAAA,IAAAzS,EAAA,GAAAqqd,SAAAjsd,OACA,EAEA,IAAAqU,EAAA,GAAA43c,SAAAjsd,QACA,EAIA4B,EAAA,GAAAoqd,mBAAA33c,EAAA,GAAA23c,iBAEA33c,EAAA,GAAA43c,SAAAjsd,OAAA4B,EAAA,GAAAqqd,SAAAjsd,OAIA4B,EAAA,GAAAoqd,iBAAA33c,EAAA,GAAA23c,kBAOA,MAAAE,EACAt6hB,cAEAmpG,KAAA8xb,OAAA,IAAAnB,EAAA,GAAA3wb,KAAA+xb,UAGA9sd,aACA,OAAA+6B,KAAA8xb,OAAA70b,KAQA40b,gBACA,MAAA,IAAA7xb,KAAA8xb,OAAA10b,UAAA13B,QAAA,CAAAmB,EAAAk4E,IAAAl4E,EAAAk4E,EAAA+mT,KAAA7oW,MAAA,GAOApmG,IAAAwnY,GACA,OAAAr+R,KAAA8xb,OAAAtwc,IAAA68S,IAAA,IAAAynE,KAMAjvc,IAAAivc,GACA9lW,KAAA8xb,OAAArwc,IAAAqkX,EAAAznE,MAAA,CACAj2M,QAAArqF,KAAAunE,MACAwgS,KAAAA,IAQAjvc,OAAAwnY,GACAr+R,KAAA8xb,OAAAruc,OAAA46S,GAIAxnY,QACA,MAAA,IAAAmpG,KAAA8xb,OAAA10b,UAAAhzB,KAAAjD,GAAAA,EAAA2+X,OAUAjvc,eAAAwnY,EAAAl2B,GACA,MAAAtpQ,EAAAmB,KAAA8xb,OAAAtwc,IAAA68S,GACA,IAAAx/R,EACA,OAGA,MAAA13B,EAAA64B,KAAA8xb,OAAAtmd,QAAA6yT,GACAx/R,EAAAinW,KAAA39F,SAAAA,EACAnoQ,KAAA8xb,OAAAn8X,OAAAxuF,GAWAtwE,SAAAgwE,EAAAyS,GACA,OAAAzS,EAAA,GAAAi/X,KAAA39F,WAAA7uR,EAAA,GAAAwsX,KAAA39F,SAEAthS,EAAA,GAAAuhH,QAAA9uG,EAAA,GAAA8uG,QAGA9uG,EAAA,GAAAwsX,KAAA39F,SAAAthS,EAAA,GAAAi/X,KAAA39F,UAIA90W,EAAAC,QAlYA,MAIAuD,YAAAk6hB,EAAAH,GACA5wb,KAAAgxb,YAAAD,EAEA/wb,KAAAgyb,QAAA,IAAArB,EAAA,GAAAG,EAAAh/N,SAUAj7T,UAAA6kO,EAAA4wK,GACA,IAAA2lJ,EAAAjyb,KAAAgyb,QAAAxwc,IAAAk6I,EAAA7C,eAEAo5T,IACAA,EAAA,IAAAnB,EAAAp1T,EAAA17H,KAAAgxb,cAGAiB,EAAApC,UAAAvjJ,GACAtsS,KAAAgyb,QAAAvwc,IAAAi6I,EAAA7C,cAAAo5T,GAaAp7hB,SAAA86hB,GAGA,MAAAM,EAAAjyb,KAAAq6V,QACA,QAAA3kc,IAAAu8hB,EACA,MAAA,CAAA3lJ,MAAA,GAAA6hJ,YAAA,GAGA,MAAA7hJ,MAAAA,EAAA6hJ,YAAAA,GAAA8D,EAAA7D,SAAAuD,GACA,GAAA,IAAArlJ,EAAArnU,OACA,MAAA,CAAAqnU,MAAAA,EAAA6hJ,YAAAA,GAGA,MAAAzyT,EAAAu2T,EAAAv2T,OAUA,OATAu2T,EAAAC,SAEAlyb,KAAAgyb,QAAAvuc,OAAAi4I,EAAA7C,eAIA74H,KAAAgyb,QAAAr8X,OAAA,GAGA,CACA+lE,OAAAA,EAAA4wK,MAAAA,EAAA6hJ,YAAAA,GAQAt3hB,QAEA,GAAA,IAAAmpG,KAAAgyb,QAAA/0b,KAKA,IAAA,MAAA,CAAA6nE,KAAA9kE,KAAAgyb,QACA,OAAAltX,EAaAjuK,OAAAwnY,EAAA3iK,GACA,MAAAu2T,EAAAjyb,KAAAgyb,QAAAxwc,IAAAk6I,EAAA7C,eACAo5T,GAAAA,EAAAv0b,OAAA2gS,GAUAxnY,UAAA6kO,EAAA4wK,GACA,MAAA2lJ,EAAAjyb,KAAAgyb,QAAAxwc,IAAAk6I,EAAA7C,eACA,IAAAo5T,EACA,OAGA,MAAA9qd,EAAA64B,KAAAgyb,QAAAxmd,QAAAkwJ,EAAA7C,eACA,IAAA,MAAAitO,KAAAx5D,EACA2lJ,EAAAE,SAAArsF,GAMA9lW,KAAAgyb,QAAAr8X,OAAAxuF,8DC9JA,aAOA,MAAAwpd,UAAA3tc,IAKAnsF,YAAAqmG,EAAAiK,GACAoe,QACAvlB,KAAAoyb,KAAAjrb,GAAAnH,KAAAqyb,aAEAryb,KAAA2nK,MAAA,GACA,IAAA,MAAAtzQ,EAAAywK,KAAA5nE,GAAA,GACA8C,KAAAve,IAAAptF,EAAAywK,GAYAjuK,OAAAswE,GACA,GAAAA,EAAA,GAAAA,GAAA64B,KAAA2nK,MAAA1iM,OACA,OAGA,MAAA5wE,EAAA2rG,KAAA2nK,MAAAxgM,GACA64B,KAAA2nK,MAAAl9L,OAAAtD,EAAA,GACA,MAAAmrd,EAAAtyb,KAAAuyb,MAAAl+hB,GACA2rG,KAAA2nK,MAAAl9L,OAAA6nd,EAAA,EAAAj+hB,GAOAwC,IAAAxC,EAAAywK,GAGA,GAAA9kE,KAAAjhB,IAAA1qF,GAAA,CACA,MAAA8yE,EAAA64B,KAAAx0B,QAAAn3E,GACA2rG,KAAA2nK,MAAAl9L,OAAAtD,EAAA,GAIAo+C,MAAA9jC,IAAAptF,EAAAywK,GAGA,MAAA39F,EAAA64B,KAAAuyb,MAAAl+hB,GAGA,OAFA2rG,KAAA2nK,MAAAl9L,OAAAtD,EAAA,EAAA9yE,GAEA2rG,KAGAnpG,QACA0uH,MAAA6nC,QACAptD,KAAA2nK,MAAA,GAMA9wQ,OAAAxC,GACA,IAAA2rG,KAAAjhB,IAAA1qF,GACA,OAAA,EAGA,MAAA8yE,EAAA64B,KAAAx0B,QAAAn3E,GAEA,OADA2rG,KAAA2nK,MAAAl9L,OAAAtD,EAAA,GACAo+C,MAAA9hC,OAAApvF,GAMAwC,QAAAxC,GACA,IAAA2rG,KAAAjhB,IAAA1qF,GACA,OAAA,EAGA,MAAA8yE,EAAA64B,KAAAuyb,MAAAl+hB,GACA,GAAA2rG,KAAA2nK,MAAAxgM,KAAA9yE,EACA,OAAA8yE,EAMA,IAAA,IAAAmqB,EAAA,EAAAA,EAAA0O,KAAA2nK,MAAA1iM,OAAAqsB,IAAA,CACA,GAAA0O,KAAA2nK,MAAAxgM,EAAAmqB,KAAAj9F,EAAA,OAAA8yE,EAAAmqB,EACA,GAAA0O,KAAA2nK,MAAAxgM,EAAAmqB,KAAAj9F,EAAA,OAAA8yE,EAAAmqB,EAGA,OAAA,EASAz6F,MAAAxC,GACA,IAAAsjb,EAAA,EACAC,EAAA53U,KAAA2nK,MAAA1iM,OACA,KAAA0yW,EAAAC,GAAA,CACA,MAAAvpU,EAAAspU,EAAAC,IAAA,EACAzwU,EAAAnH,KAAAwyb,MAAAxyb,KAAA2nK,MAAAt5J,GAAAh6G,GAEA,GAAA8yG,EAAA,EACAwwU,EAAAtpU,EAAA,MACA,CAAA,KAAAlH,EAAA,GAGA,OAAAkH,EAFAupU,EAAAvpU,GAKA,OAAAspU,EAGA9gb,QACA,IAAA,MAAAxC,KAAA2rG,KAAA2nK,YACAtzQ,EASAwC,UACA,IAAA,MAAAxC,KAAA2rG,KAAA2nK,YAIA3nK,KAAAxe,IAAAntF,GASAwC,WACA,IAAA,MAAAxC,KAAA2rG,KAAA2nK,WAIA,CAAAtzQ,EAAA2rG,KAAAxe,IAAAntF,IAMAwC,EAAAX,OAAAu0J,kBACAzqD,KAAA9C,UASArmG,QAAAwpJ,EAAAukD,GACA,GAAAvkD,EAIA,IAAA,MAAAhsJ,KAAA2rG,KAAA2nK,MACAtnH,EAAA+iD,MAAAwB,EAAA,CAAA,CAAAvwM,EAAA2rG,KAAAxe,IAAAntF,MAUAwC,aAAAgwE,EAAAyS,GACA,OAAAzS,EAAA,GAAAyS,EAAA,IAAA,EACAA,EAAA,GAAAzS,EAAA,GAAA,EACA,EAQAhwE,MAAAgwE,EAAAyS,GACA,OAAA0mB,KAAAoyb,KAEA,CAAAvrd,EAAAm5B,KAAAxe,IAAA3a,IAEA,CAAAyS,EAAA0mB,KAAAxe,IAAAlI,MAKAjmF,EAAAC,QAAAq9hB,gCCpNA,aAQA,MAAAhD,EAAA,CASA92hB,WAAAivc,EAAA2rF,GACA,IAAAlD,GAAA,EACAC,GAAA,EACA,IAAA,MAAAp5b,KAAAq8b,EACAr8b,EAAAs3D,KAAA6hY,YACAA,GAAA,GAGAn5b,EAAAs3D,KAAA8hY,cACAA,GAAA,GAMA,QAAAA,IAAA1oF,EAAAp5S,KAAA8hY,gBAOAD,IAAAzoF,EAAAp5S,KAAA6hY,YAcA13hB,MAAA47hB,EAAAlB,GAkBA,MAAA7C,EAAA+D,EAAA/lY,KACAgmY,EAAAnB,EAAA7kY,MAKAgmY,EAAAnE,WAAAG,EAAAH,YACAmE,EAAAnE,UAAAG,EAAAH,UACAmE,EAAAjxR,UAAAitR,EAAAjtR,YAIAixR,EAAAlE,aAAAE,EAAAF,cAEAkE,EAAAlE,aAAA,EAEAkE,EAAAnE,YAAAG,EAAAH,YAEAmE,EAAAnE,UAAAG,EAAAH,UACAgD,EAAAt0b,KAAAw1b,EAAAx1b,OAMAy1b,EAAAlE,aAAAkE,EAAAnE,YACAgD,EAAAt0b,KAAAy1b,EAAAjxR,aAKApuQ,EAAAC,QAAAq6hB,8BCtGA,aAEA,MAAAtoS,aAAAA,GAAA9xP,EAAA,UACAm2hB,EAAAn2hB,EAAA,cACA4kO,EAAA5kO,EAAA,sBACA8kO,EAAA9kO,EAAA,yBAEAq1hB,EAAAr1hB,EAAA,eACA+4f,EAAA/4f,EAAA,WAAA+4f,OASAqmC,EAAAhlU,GAAA,UAAA0K,EAAA1K,EAAAW,UAAA,YAKAskU,EAAAjlU,GAAA,SAAA0K,EAAA1K,EAAAW,UAAA,YAoGAj7N,EAAAC,QAlGA,cAAA+xP,EAOAxuP,YAAA6kO,GACAn2G,QAEAvlB,KAAAwrO,gBAAAo9M,EAAA9gF,cAEA9nW,KAAAs3a,KAAAhrB,EAAA5wR,EAAA,SASA7kO,SAAA22J,GACA,MAAAtkF,EAAA0pd,EAAAplY,EAAAmgE,KACA3tH,KAAAs3a,KAAApuc,GACA82B,KAAA64E,KAAA3vG,EAAAskF,GAcA32J,UAAA82N,EAAAh5N,EAAA,IACA,IAAAg5N,EACA,MAAA,IAAA70H,MAAA,mBAGA,MAAA+5b,EAAAD,EAAAjlU,GACAmlU,EAAAH,EAAAhlU,GAIA,OAFA3tH,KAAAs3a,KAAA,aAAA3pT,KAEA,IAAA5nD,SAAA,CAAAC,EAAAu5B,KACA,MAAAwzV,EAAA,KACA/yb,KAAAw1H,eAAAq9T,EAAAG,GACAzzV,EAAA,IAAAzmG,MAAA,aAAA60H,gBAMAqlU,EAAAxlY,IAGA,GAFAxtD,KAAAw1H,eAAAs9T,EAAAC,IAEA56T,EAAAxK,EAAAW,UAAA9gE,EAAAmgE,IAAAW,WAEA,OAAA/uB,EAAA,IAAAzmG,MAAA,gCAAA60H,MACAA,EAAAjqH,UAAA8pD,EAAAmgE,IAAAjqH,SAAAiqH,EAAAgN,QAAAntE,EAAAmgE,IAAAgN,QAEAntE,EAAA,IAAAk8X,EAAAl8X,EAAAd,KAAAihE,IAGA3nD,EAAAxY,IAGAxtD,KAAA4mH,KAAAksU,EAAAC,GACA/yb,KAAA4mH,KAAAisU,EAAAG,GAEAr+hB,GAAAA,EAAAk7N,QACAl7N,EAAAk7N,OAAA3pD,iBAAA,SAAA,KACAlmE,KAAAw1H,eAAAq9T,EAAAG,GACAhzb,KAAAw1H,eAAAs9T,EAAAC,GAEAxzV,EAAA,IAAAzmG,MAAA,YAAA60H,oBAYA92N,YAAA82N,GACA,MAAAzkJ,EAAAypd,EAAAhlU,GACA3tH,KAAAs3a,KAAApuc,GACA82B,KAAA64E,KAAA3vG,2KCtHA,aAEA,MAAAm8K,aAAAA,GAAA9xP,EAAA,UACA0/hB,EAAA1/hB,EAAA,UAUA00J,EAAA,CACA00K,SAAA,EACAgtI,uBAAA,IACAD,4BAAA,IACAE,uBAAA,CACA,IACA,IACA,MA+GAv2c,EAAAC,QA3GA,cAAA+xP,EAQAxuP,YAAA42d,EAAA,GAAA9rT,EAAA1Z,GACA1iC,QAEA,MAAA5wH,EAAAnB,OAAAiqG,OAAA,GAAAwqD,EAAA0Z,GAEA,GAAA,iBAAAhtK,EAAAg1c,uBACA,MAAA,IAAA7wW,MAAA,+BAGA,GAAA,iBAAAnkG,EAAA+0c,4BACA,MAAA,IAAA5wW,MAAA,oCAGAkH,KAAAkzb,iBAAAzlE,EACAztX,KAAA2hE,SAAAhtK,EACAqrG,KAAAu5X,SAAAv5X,KAAA2hE,SAAAg7J,QAEA38N,KAAAmzb,QAAA,IAAAF,EAAAxlE,EAAA94d,GACAqrG,KAAAmzb,QAAAnld,GAAA,UAAAutP,GAAAv7N,KAAA64E,KAAA,SAAA0iJ,KAGAv7N,KAAAozb,OAAA,IAAApwc,IAGAnsF,SACAmpG,KAAAu5X,UAAA,EACAv5X,KAAA2hE,SAAAg7J,SAAA,EACA38N,KAAAmzb,QAAAx1L,SAGA9mW,UACAmpG,KAAAu5X,UAAA,EACAv5X,KAAA2hE,SAAAg7J,SAAA,EACA38N,KAAAmzb,QAAA11L,UAGA5mW,OACAmpG,KAAAu5X,UAAA,EACAv5X,KAAAmzb,QAAA5yZ,OACA,IAAA,MAAA8yZ,KAAArzb,KAAAozb,OACAC,EAAA,GAAA9yZ,OAIA8hQ,eACA,OAAAriS,KAAAmzb,QAAA9wJ,SAGAg4C,qBACA,OAAAr6U,KAAAmzb,QAAA94G,eAOAxjb,QAAA6kO,GACA,MAAA2zO,EAAA,iBAAA3zO,GAAAA,EAAA7C,YACA6C,EAAA7C,cACA,GAAA6C,IAEA,OAAA17H,KAAAozb,OAAA5xc,IAAA6tX,GASAx4c,KAAAijb,EAAAx6M,EAAA8vP,GACA,GAAApvX,KAAAu5X,WACAv5X,KAAAmzb,QAAArod,KAAAw0J,EAAA8vP,GAEAt1C,GAAA,CACA,IAAA4c,EAAA12V,KAAAozb,OAAA5xc,IAAAs4V,GACA4c,IACAA,EAAA,IAAAu8F,EAAAjzb,KAAAkzb,iBAAAlzb,KAAA2hE,UACA3hE,KAAAozb,OAAA3xc,IAAAq4V,EAAA4c,IAGAA,EAAA5rX,KAAAw0J,EAAA8vP,IAQAv4d,aAAAijb,GACA,MAAAp+M,EAAAo+M,EAAAjhN,cACA69N,EAAA12V,KAAAozb,OAAA5xc,IAAAk6I,GACAg7N,IACAA,EAAAn2T,OACAvgC,KAAAozb,OAAA3vc,OAAAi4I,mEC9HA,aAEA,MAAA2pB,aAAAA,GAAA9xP,EAAA,UACAs7d,EAAAt7d,EAAA,+BAyLAF,EAAAC,QAlLA,cAAA+xP,EAUAxuP,YAAA42d,EAAA94d,GACA4wH,QAEAvlB,KAAA2hE,SAAAhtK,EAEAqrG,KAAA6lQ,OAAA,GAEA7lQ,KAAA8uX,OAAA,GAEA9uX,KAAA+uX,mBAAAhxX,KAAAunE,MAEAtlE,KAAAgvX,uBAAA,GAGAhvX,KAAAivX,gBAAA,GAEAjvX,KAAAytK,QAAAztK,KAAAytK,QAAA90K,KAAAqH,MAEAytX,EAAAr5d,SAAAY,IACAgrG,KAAA8uX,OAAA95d,GAAAgnI,OAAA,GACAh8B,KAAAivX,gBAAAj6d,GAAA,GACAgrG,KAAA2hE,SAAAioS,uBAAAx1c,SAAAkxW,KACAtlQ,KAAAivX,gBAAAj6d,GAAAswW,GAAAupH,EAAAvpH,IACAx6R,KAAAk1B,KAAA+uX,mBAAA,SAIA/uX,KAAAu5X,SAAAv5X,KAAA2hE,SAAAg7J,QAGA9lU,SACAmpG,KAAAu5X,UAAA,EAGA1ie,UACAmpG,KAAAszb,WAAA,EAGAz8hB,OACAmpG,KAAA+lQ,UACA91I,aAAAjwH,KAAA+lQ,UAIAs8B,eACA,OAAA7uY,OAAAiqG,OAAA,GAAAuC,KAAA8uX,QAGAz0C,qBACA,OAAA7mb,OAAAiqG,OAAA,GAAAuC,KAAAivX,iBAOAp4d,KAAAyoO,EAAA8vP,GACApvX,KAAAu5X,WACAv5X,KAAA6lQ,OAAA/6R,KAAA,CAAAw0J,EAAA8vP,EAAArxX,KAAAunE,QACAtlE,KAAAkvX,wBAOAr4d,uBACAmpG,KAAA+lQ,UACA91I,aAAAjwH,KAAA+lQ,UAEA/lQ,KAAA+lQ,SAAAl7L,WAAA7qE,KAAAytK,QAAAztK,KAAAqvX,gBAOAx4d,eAEA,MAAAy4d,EAAAtvX,KAAA6lQ,OAAA5gS,OAAA+6B,KAAA2hE,SAAA+nS,4BACA,OAAA9jY,KAAAD,IAAAq6B,KAAA2hE,SAAAgoS,wBAAA,EAAA2lB,GAAA,GAMAz4d,UAGA,GAFAmpG,KAAA+lQ,SAAA,KAEA/lQ,KAAA6lQ,OAAA5gS,OAAA,CACA,IAAA8W,EACA,KAAAikB,KAAA6lQ,OAAA5gS,QAAA,CACA,MAAA+rF,EAAAj1E,EAAAikB,KAAA6lQ,OAAAlhQ,QACAqsD,GAAAhxD,KAAAuvX,SAAAv+T,GAGAj1E,GAAAikB,KAAAwvX,iBAAAzzY,EAAA,IAEAikB,KAAA64E,KAAA,SAAA74E,KAAA8uX,SAQAj4d,iBAAA44d,GACA,MAAAC,EAAAD,EAAAzvX,KAAA+uX,mBAEAW,GACAl8d,OAAAW,KAAA6rG,KAAA8uX,QAAA16d,SAAAY,IACAgrG,KAAA2vX,oBAAA36d,EAAA06d,EAAAD,MAIAzvX,KAAA+uX,mBAAAU,EAUA54d,oBAAA7B,EAAA46d,EAAAH,GACA,MAAAlsY,EAAAyc,KAAAgvX,uBAAAh6d,IAAA,EACAgrG,KAAAgvX,uBAAAh6d,GAAA,EACA,MAAA66d,EAAAtsY,EAAAqsY,EAAA,IAEA,IAAAv1C,EAAAr6U,KAAAivX,gBAAAj6d,GACAqlb,IACAA,EAAAr6U,KAAAivX,gBAAAj6d,GAAA,IAEAgrG,KAAA2hE,SAAAioS,uBAAAx1c,SAAAk6c,IACA,IAAAh0B,EAAAD,EAAAi0B,GACAh0B,IACAA,EAAAD,EAAAi0B,GAAAugB,EAAAvgB,IAEAh0B,EAAAxvW,KAAA2kZ,EAAAI,MAQAh5d,SAAAm6J,GACA,MAAAh8J,EAAAg8J,EAAA,GACAo+T,EAAAp+T,EAAA,GAEA,GAAA,iBAAAo+T,EACA,MAAA,IAAAt2X,MAAA,6BAAAs2X,KAGA57d,OAAAmqG,UAAAnD,eAAAoD,KAAAoC,KAAA8uX,OAAA95d,KACAgrG,KAAA8uX,OAAA95d,GAAAgnI,OAAA,IAGAh8B,KAAA8uX,OAAA95d,GAAAgnI,OAAAh8B,KAAA8uX,OAAA95d,IAAAgnI,OAAAozV,GAEApvX,KAAAgvX,uBAAAh6d,KACAgrG,KAAAgvX,uBAAAh6d,GAAA,GAEAgrG,KAAAgvX,uBAAAh6d,IAAAo6d,sFCxLA,aAEA,MAAAmkE,EAAAhgiB,EAAA,WACAigiB,EAAAjgiB,EAAA,aACAkgiB,EAAAlgiB,EAAA,gBACAmgiB,EAAAngiB,EAAA,iBACAogiB,EAAApgiB,EAAA,WAgBAF,EAAAC,QAdA,MAKAuD,aAAAqjU,QAAAA,IACAl6N,KAAAshV,MAAAiyG,EAAA,CAAAr5N,QAAAA,IACAl6N,KAAAg9X,QAAAw2D,EAAA,CAAAt5N,QAAAA,IACAl6N,KAAAsmH,WAAAmtU,EAAA,CAAAv5N,QAAAA,IACAl6N,KAAA4zb,WAAAF,EAAA,CAAAx5N,QAAAA,IACAl6N,KAAAyiS,MAAAkxJ,EAAA,CAAAz5N,QAAAA,0IClBA,aAEA,MAAA4C,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA4mU,QAAAA,KAiBA4C,GAbAxpL,eAAA3+I,EAAA,IACA,MAAA8tY,EAAA,IACA9mE,OAAAA,SAAAzB,EAAAjnU,IAAA0B,GACA,IAAA,MAAA+mO,EAAAo+M,KAAAn+G,EAAAslF,UAAAxe,MAAAvlS,UACAulS,EAAA33T,KAAA,CACAmZ,GAAAy3I,EAEA4lN,MAAAxH,EAAAl9G,UAAAxyP,KAAA8vM,GAAAA,EAAAhsD,cAGA,OAAAu0K,oFCtBA,aAEA,MAAA3lE,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA4mU,QAAAA,KASA4C,GALAxpL,eAAA0pK,EAAAroT,EAAA,IACA,MAAAgnU,OAAAA,SAAAzB,EAAAjnU,IAAA0B,SACAgnU,EAAA6wI,KAAAxvJ,EAAAroT,mFCdA,aAEA,MAAAmoU,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA4mU,QAAAA,KASA4C,GALAxpL,eAAA0pK,EAAAroT,EAAA,IACA,MAAAgnU,OAAAA,SAAAzB,EAAAjnU,IAAA0B,SACAgnU,EAAAk4N,OAAA72O,qFCdA,aAEA,MAAA8f,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA4mU,QAAAA,KASA4C,GALAxpL,eAAA3+I,EAAA,IACA,MAAAgnU,OAAAA,SAAAzB,EAAAjnU,IAAA0B,GACA,OAAAgnU,EAAA0lF,6FCdA,aAEA,MAAAvkF,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA4mU,QAAAA,KAiCA4C,GA7BAxpL,eAAA3+I,EAAA,IACA,MAAAgnU,OAAAA,SAAAzB,EAAAjnU,IAAA0B,GACA8tY,EAAA,GAEA,IAAA,MAAA/mK,EAAAqoO,KAAApoI,EAAAooI,YACA,IAAA,MAAA9Z,KAAA8Z,EAAA,CAEA,MAAAjqB,EAAA,CACA98H,KAAAitI,EAAAiP,WACApf,KAAAp+M,IAGA/mO,EAAAq6P,SAAAr6P,EAAAo4M,aACA+sO,EAAA/sO,UAAAk9O,EAAA/nD,KAAAn1L,WAGAp4M,EAAAq6P,UACA8qL,EAAAkpB,MAAA/Y,EAAA/nD,KAAA+vF,YACAn4C,EAAAi3B,QAAA,MACAj3B,EAAA9jG,QAAA,IAGAysD,EAAA33T,KAAAgvW,GAIA,OAAAr3C,oFCtCA,aAGA,MAAAuiB,EAAAzxZ,EAAA,WAQAF,EAAAC,QAAA,EAAAX,KAAAA,EAAA4nU,UAAAA,KACAyqF,EAAAryZ,EAAA,CACAuyZ,eAAA,IAAA3qF,iDCbA,aAEA,MAAAxsG,EAAAx6N,EAAA,WAEAugiB,EAAA,CAAA/mK,SAAA,EAAA3xK,KAAA,EAAAjuI,KAAA,IACA2vP,EAAAvpU,EAAA,2CAMAF,EAAAC,QAAA,EAAA4mU,QAAAA,KA8CA4C,GA1CAxpL,gBAAAooF,EAAA/mO,EAAA,IACA,MAAAgnU,OAAAA,SAAAzB,EAAAjnU,MACA0B,EAAA4uF,MAAA5uF,EAAA4uF,OAAA,GAEA,MAAAu2V,EAAA/rN,EAAA2M,cAAAgB,GAEAq4T,EAAAp4N,EAAAslF,UAAAz/T,IAAAs4V,GACA,IAAA71V,EAAA8vc,GAAAA,EAAA9vc,GAEA,IAAAA,EAAA,MACA,IAAA6vc,EAAA3md,KAAA,mBAAAuuJ,KACA,MAAAwuN,QAAAvuH,EAAA6nI,YAAAmC,SAAA7rB,GAEA71V,EAAAimW,GAAAA,EAAAjmW,GAGA,IAAAA,EACA,MAAA,IAAA6U,MAAA,2BAGA,IAAAg7b,EAAA3md,KAAA,QAAA8W,EAAA40I,iBAEA,IAAAm7T,EAAA,EACAC,EAAA,EAEA,IAAA,IAAA9sd,EAAA,EAAAA,EAAAxyE,EAAA4uF,MAAApc,IACA,IACA,MAAAi0I,QAAAugH,EAAAL,KAAAr3O,GACAgwc,GAAA74U,EACA44U,SACA,IAAAF,EAAA14U,KAAAA,GACA,MAAA3hH,QACA,IAAAq6b,EAAA/mK,SAAA,EAAA5/S,KAAAssB,EAAA2E,YAIA,GAAA41b,EAAA,CACA,MAAAE,EAAAD,EAAAD,OACA,IAAAF,EAAA3md,KAAA,oBAAA+md,4GCrDA,aAEA,MAAAnmU,EAAAx6N,EAAA,WACAg7N,EAAAh7N,EAAA,QACAupT,EAAAvpT,EAAA,aACA8vW,gBAAAA,GAAA9vW,EAAA,aACAiuF,EAAAjuF,EAAA,OACAupU,EAAAvpU,EAAA,2CAOAF,EAAAC,QAAA,EAAA4mU,QAAAA,EAAAF,KAAAA,MACA,MAAAx4O,IAAAA,EAAA6vI,IAAAA,EAAA8iU,UAAAA,EAAAxuF,SAAAA,EAAA7lR,QAAAA,EAAA4oB,MAAAA,GAAA,CAIA7xM,UAAA7B,EAAAL,EAAA,IACA,MAAAgnU,OAAAA,SAAA1oU,EAAAinU,EAAAvlU,GACA,OAAAgnU,EAAAw9D,KAAA33S,IAAA4yc,EAAAp/hB,GAAAL,IAMAkC,UAAA7B,EAAAtB,EAAAiB,GACA,MAAAgnU,OAAAA,SAAA1oU,EAAAinU,EAAAvlU,SACAgnU,EAAAw9D,KAAA9nK,IAAA+iU,EAAAp/hB,GAAAtB,IAMAmD,gBAAA82N,EAAAh5N,EAAA,CAAA0/hB,aAAA,KACA,MAAA14N,OAAAA,SAAA1oU,EAAAinU,EAAAvlU,GAEA,UAAA,MAAAmlb,KAAAn+G,EAAAw9D,KAAA8sE,cAAAmuF,EAAAzmU,GAAA,CACAu4O,gBAAAvxc,EAAA0/hB,aACAxkU,OAAAl7N,EAAAk7N,cAEA,CACA5rI,GAAA61V,EAAA71V,GAAA40I,cACAyoN,MAAAxH,EAAAwH,QAQAzqb,eAAA6kO,EAAA/mO,GACA,MAAAgnU,OAAAA,SAAA1oU,EAAAinU,EAAAvlU,GACAmlb,QAAAn+G,EAAAw9D,KAAAwsE,SAAA53O,EAAA2M,cAAAgB,IAEA,MAAA,CACAz3I,GAAA61V,EAAA71V,GAAA40I,cACAyoN,MAAAxH,EAAAz4B,aAOAxqZ,cAAAurY,EAAAztY,EAAA,CAAAivW,WAAA,IACA,MAAAjoC,OAAAA,SAAA1oU,EAAAinU,EAAAvlU,GACAytY,EAAAvkS,MAAA/gB,QAAAslT,GAAAA,EAAA,CAAAA,GAEA,IAAA,MAAAj7T,KAAAi7T,EACA,GAAA,iBAAAA,EAAAj7T,GACA,IACAi7T,EAAAj7T,GAAA,IAAAonJ,EAAA6zK,EAAAj7T,IACA,MAAAsyB,GACA,MAAAqjN,EAAArjN,EAAA,mBASA,WAHAssE,QAAA2gD,IAAA07K,EAAAh4T,KAAAujJ,GAAAqsG,EAAAl1D,OAAA/lL,IAAA4uI,OACA5gH,OAAAhuB,GAAAA,IAGA,MAAA+9N,EAAA,IAAAhkN,MAAA,8CAAA,uBAGA,GAAAnkG,EAAAivW,UAEA,MAAA9mD,EAAA,IAAAhkN,MAAA,uBAAA,2BAGA,IAAA,MAAA60H,KAAAy0K,QACAzmE,EAAAw9D,KAAAr5M,QAAA6tC,IAOA92N,YAAA6kO,EAAA/mO,GACA,MAAAgnU,OAAAA,SAAA1oU,EAAAinU,EAAAvlU,GAEA,UAAA,MAAA2/hB,KAAA34N,EAAAw9D,KAAAusE,gBAAA33O,EAAA2M,cAAAgB,GAAApC,gBACA,CACAr1I,GAAAqwc,EAAAz7T,cACAyoN,MAAA,MAMA,MAAA,CACA9/V,IAAAs7O,EAAAt7O,GACA6vI,IAAAyrG,EAAAzrG,GACA8iU,UAAAr3N,EAAAq3N,GACAxuF,SAAA7oI,EAAA6oI,GACA7lR,QAAAg9I,EAAAh9I,GACA4oB,MAAAo0H,EAAAp0H,KAWA,MAgBA0rV,EAAAzmU,GACAA,aAAA8K,WAAA9K,EAjBAA,CAAAA,IACA,IACA,MAAAu8T,EAAAv8T,EAAAvvH,WAAAte,MAAA,KACA/R,QAAAg4B,GAAAA,GAAA,SAAAA,GAAA,SAAAA,IAAA,GAEA,OAAA,IAAAwoH,EAAA27T,GAAAvxT,MACA,MAAAppJ,GACA,MAAAutO,EAAAvtO,EAAA,qBAUAgld,CAAA5mU,GAMA16N,EAAAqgJ,MAAA4mL,EAAAvlU,KACA,MAAA8mU,QAAAvB,EAAAjnU,IAAA0B,GACA,GAAA6sF,EAAAi6O,EAAAE,OAAA,uBAAA,GACA,OAAAF,EAEA,MAAA,IAAA4nC,EAAA,qLC7JA,aAEA,MAAAvmC,EAAAvpU,EAAA,2CACAupT,EAAAvpT,EAAA,aACA8vW,gBAAAA,GAAA9vW,EAAA,aACAiuF,EAAAjuF,EAAA,OAOAF,EAAAC,QAAA,EAAA4mU,QAAAA,EAAA3/O,OAAAA,MACA,MAAAi6c,EAAAhzc,EAAAjH,GAAA,GAAA,kBAAA,GAEA,MAAA,CACAojT,UAAA62J,EAAA13N,GAUAxpL,eAAA+qP,EAAA9gO,EAAA5oK,EAAA,IACA,MAAAgnU,OAAAA,SAAAzB,EAAAjnU,IAAA0B,GAEA,OAAAgnU,EAAAR,OAAAwiE,UAAAU,EAAA9gO,EAAA5oK,MAbA8/hB,EACA13J,YAAAy3J,EAAA13N,GAkBAxpL,eAAA+qP,EAAA9gO,EAAA5oK,EAAA,IACA,MAAAgnU,OAAAA,SAAAzB,EAAAjnU,IAAA0B,GAEAgnU,EAAAR,OAAA4hE,YAAAsB,EAAA9gO,EAAA5oK,MArBA8/hB,EACA/kK,QAAA8kK,EAAA13N,GA0BAxpL,eAAA+qP,EAAA3xO,EAAA/3J,EAAA,IACA,MAAAgnU,OAAAA,SAAAzB,EAAAjnU,IAAA0B,GACA,IAAA+3J,EACA,MAAAowJ,EAAA,IAAAhkN,MAAA,+BAAA,0BAEA6iO,EAAAR,OAAAu0D,QAAA2O,EAAA3xO,MA/BA+nY,EACA/mU,GAAA8mU,EAAA13N,GAoCAxpL,eAAA3+I,EAAA,IACA,MAAAgnU,OAAAA,SAAAzB,EAAAjnU,IAAA0B,GACA,OAAAgnU,EAAAR,OAAAsiE,eAtCAg3J,EACAhyJ,MAAA+xJ,EAAA13N,GA2CAxpL,eAAA+qP,EAAA1pY,EAAA,IACA,MAAAgnU,OAAAA,SAAAzB,EAAAjnU,IAAA0B,GACA,OAAAgnU,EAAAR,OAAAu5N,eAAAr2J,MA7CAo2J,IAiDA,MAAAA,EAAAnhZ,UACA,MAAA,IAAA+vN,EAAA","sources":["./src/index.js","./node_modules/vue/index.js","./node_modules/vue/dist/vue.cjs.prod.js","./node_modules/@vue/compiler-dom/index.js","./node_modules/@vue/compiler-dom/dist/compiler-dom.cjs.prod.js","./node_modules/@vue/compiler-core/index.js","./node_modules/@vue/compiler-core/dist/compiler-core.cjs.prod.js","./node_modules/@vue/shared/index.js","./node_modules/@vue/shared/dist/shared.cjs.prod.js","./node_modules/source-map/source-map.js","./node_modules/source-map/lib/source-map-generator.js","./node_modules/source-map/lib/base64-vlq.js","./node_modules/source-map/lib/base64.js","./node_modules/source-map/lib/util.js","./node_modules/source-map/lib/array-set.js","./node_modules/source-map/lib/mapping-list.js","./node_modules/source-map/lib/source-map-consumer.js","./node_modules/source-map/lib/binary-search.js","./node_modules/source-map/lib/quick-sort.js","./node_modules/source-map/lib/source-node.js","./node_modules/@babel/parser/src/tokenizer/types.js","./node_modules/@babel/parser/src/util/whitespace.js","./node_modules/@babel/parser/src/util/location.js","./node_modules/@babel/parser/src/parser/comments.js","./node_modules/@babel/parser/src/parser/error-codes.js","./node_modules/@babel/parser/src/parser/error-message.js","./node_modules/@babel/parser/src/parser/error.js","./node_modules/@babel/parser/src/tokenizer/context.js","./node_modules/@babel/babel-helper-validator-identifier/src/identifier.ts","./node_modules/@babel/babel-helper-validator-identifier/src/keyword.ts","./node_modules/@babel/parser/src/util/identifier.js","./node_modules/@babel/parser/src/util/scopeflags.js","./node_modules/@babel/parser/src/util/scope.js","./node_modules/@babel/parser/src/plugins/flow/scope.js","./node_modules/@babel/parser/src/plugins/flow/index.js","./node_modules/@babel/parser/src/plugins/jsx/xhtml.js","./node_modules/@babel/parser/src/tokenizer/state.js","./node_modules/@babel/parser/src/plugins/jsx/index.js","./node_modules/@babel/parser/src/plugins/typescript/scope.js","./node_modules/@babel/parser/src/util/production-parameter.js","./node_modules/@babel/parser/src/plugins/typescript/index.js","./node_modules/@babel/parser/src/plugins/placeholders.js","./node_modules/@babel/parser/src/plugin-utils.js","./node_modules/@babel/parser/src/plugins/estree.js","./node_modules/@babel/parser/src/plugins/v8intrinsic.js","./node_modules/@babel/parser/src/options.js","./node_modules/@babel/parser/src/tokenizer/index.js","./node_modules/@babel/parser/src/util/class-scope.js","./node_modules/@babel/parser/src/util/expression-scope.js","./node_modules/@babel/parser/src/parser/util.js","./node_modules/@babel/parser/src/parser/node.js","./node_modules/@babel/parser/src/parser/lval.js","./node_modules/@babel/parser/src/parser/statement.js","./node_modules/@babel/parser/src/parser/index.js","./node_modules/@babel/parser/src/parser/expression.js","./node_modules/@babel/parser/src/parser/base.js","./node_modules/@babel/parser/src/index.js","./node_modules/estree-walker/dist/umd/estree-walker.js","./node_modules/@vue/runtime-dom/index.js","./node_modules/@vue/runtime-dom/dist/runtime-dom.cjs.prod.js","./node_modules/@vue/runtime-core/index.js","./node_modules/@vue/runtime-core/dist/runtime-core.cjs.prod.js","./node_modules/@vue/reactivity/index.js","./node_modules/@vue/reactivity/dist/reactivity.cjs.prod.js","./node_modules/vue-router/dist/vue-router.cjs.js","./node_modules/@vue/devtools-api/lib/esm/index.js","./node_modules/@vue/devtools-api/lib/esm/env.js","./node_modules/@parcel/transformer-js/lib/esmodule-helpers.js","./node_modules/@vue/devtools-api/lib/esm/const.js","./node_modules/@vue/devtools-api/lib/esm/api/index.js","./node_modules/vue-meta/dist/vue-meta.esm-browser.min.js","./src/App.vue","./src/Home.vue","./src/IpfsVideo.vue","./src/components/PathForm.vue","./src/IpfsGatewayVideo.vue","./src/IpfsLs.vue","./src/NotFound.vue","./src/plugins/vue-ipfs.js","./node_modules/ipfs/src/index.js","./node_modules/ipfs-core/src/index.js","./node_modules/ipfs-utils/src/files/url-source.js","./node_modules/ipfs-utils/src/http.js","./node_modules/ipfs-utils/src/http/fetch.browser.js","./node_modules/ipfs-utils/src/http/error.js","./node_modules/ipfs-utils/src/fetch.js","./node_modules/ipfs-utils/src/env.js","./node_modules/process/browser.js","./node_modules/is-electron/index.js","./node_modules/ipfs-utils/node_modules/native-fetch/src/index.js","./node_modules/ipfs-utils/node_modules/node-fetch/browser.js","./node_modules/merge-options/index.js","./node_modules/is-plain-obj/index.js","./node_modules/iso-url/index.js","./node_modules/iso-url/src/url-browser.js","./node_modules/iso-url/src/relative.js","./node_modules/native-abort-controller/src/index.js","./node_modules/abort-controller/browser.js","./node_modules/any-signal/index.js","./node_modules/peer-id/src/index.js","./node_modules/multihashes/src/index.js","./node_modules/multibase/src/index.js","./node_modules/multibase/src/constants.js","./node_modules/@multiformats/base-x/src/index.js","./node_modules/multibase/src/base.js","./node_modules/multibase/src/util.js","./node_modules/multibase/src/rfc4648.js","./node_modules/multihashes/node_modules/varint/index.js","./node_modules/multihashes/node_modules/varint/encode.js","./node_modules/multihashes/node_modules/varint/decode.js","./node_modules/multihashes/node_modules/varint/length.js","./node_modules/multihashes/src/constants.js","./node_modules/uint8arrays/to-string.js","./node_modules/uint8arrays/from-string.js","./node_modules/uint8arrays/concat.js","./node_modules/cids/src/index.js","./node_modules/multicodec/src/index.js","./node_modules/multicodec/node_modules/varint/index.js","./node_modules/multicodec/node_modules/varint/encode.js","./node_modules/multicodec/node_modules/varint/decode.js","./node_modules/multicodec/node_modules/varint/length.js","./node_modules/multicodec/src/util.js","./node_modules/multicodec/src/maps.js","./node_modules/multicodec/src/generated-table.js","./node_modules/cids/src/cid-util.js","./node_modules/uint8arrays/equals.js","./node_modules/libp2p-crypto/src/keys/index.js","./node_modules/libp2p-crypto/src/keys/keys.js","./node_modules/protobufjs/minimal.js","./node_modules/protobufjs/src/index-minimal.js","./node_modules/protobufjs/src/writer.js","./node_modules/protobufjs/src/util/minimal.js","./node_modules/@protobufjs/aspromise/index.js","./node_modules/@protobufjs/base64/index.js","./node_modules/@protobufjs/eventemitter/index.js","./node_modules/@protobufjs/float/index.js","./node_modules/@protobufjs/inquire/index.js","./node_modules/@protobufjs/utf8/index.js","./node_modules/@protobufjs/pool/index.js","./node_modules/protobufjs/src/util/longbits.js","./node_modules/protobufjs/src/writer_buffer.js","./node_modules/protobufjs/src/reader.js","./node_modules/protobufjs/src/reader_buffer.js","./node_modules/protobufjs/src/rpc.js","./node_modules/protobufjs/src/rpc/service.js","./node_modules/protobufjs/src/roots.js","./node_modules/node-forge/lib/asn1.js","./node_modules/node-forge/lib/forge.js","./node_modules/node-forge/lib/util.js","./node_modules/node-forge/lib/baseN.js","./node_modules/node-forge/lib/oids.js","./node_modules/node-forge/lib/pbe.js","./node_modules/node-forge/lib/aes.js","./node_modules/node-forge/lib/cipher.js","./node_modules/node-forge/lib/cipherModes.js","./node_modules/node-forge/lib/des.js","./node_modules/node-forge/lib/md.js","./node_modules/node-forge/lib/pbkdf2.js","./node_modules/node-forge/lib/hmac.js","./node_modules/node-forge/lib/pem.js","./node_modules/node-forge/lib/random.js","./node_modules/node-forge/lib/sha256.js","./node_modules/node-forge/lib/prng.js","./node_modules/node-forge/lib/rc2.js","./node_modules/node-forge/lib/rsa.js","./node_modules/node-forge/lib/jsbn.js","./node_modules/node-forge/lib/pkcs1.js","./node_modules/node-forge/lib/sha1.js","./node_modules/node-forge/lib/prime.js","./node_modules/err-code/index.js","./node_modules/libp2p-crypto/src/keys/importer.js","./node_modules/libp2p-crypto/src/ciphers/aes-gcm.browser.js","./node_modules/libp2p-crypto/src/webcrypto.js","./node_modules/libp2p-crypto/src/keys/rsa-class.js","./node_modules/multihashing-async/src/sha.browser.js","./node_modules/node-forge/lib/sha512.js","./node_modules/node-forge/lib/ed25519.js","./node_modules/node-forge/lib/asn1-validator.js","./node_modules/libp2p-crypto/src/keys/rsa-browser.js","./node_modules/libp2p-crypto/src/random-bytes.js","./node_modules/iso-random-stream/src/random.browser.js","./node_modules/libp2p-crypto/src/keys/rsa-utils.js","./node_modules/libp2p-crypto/src/util.js","./node_modules/libp2p-crypto/src/keys/jwk2pem.js","./node_modules/libp2p-crypto/src/keys/exporter.js","./node_modules/libp2p-crypto/src/keys/ed25519-class.js","./node_modules/libp2p-crypto/src/keys/ed25519.js","./node_modules/libp2p-crypto/src/keys/secp256k1-class.js","./node_modules/libp2p-crypto/src/keys/secp256k1.js","./node_modules/secp256k1/elliptic.js","./node_modules/secp256k1/lib/index.js","./node_modules/secp256k1/lib/elliptic.js","./node_modules/elliptic/lib/elliptic.js","./node_modules/elliptic/lib/elliptic/utils.js","./node_modules/bn.js/lib/bn.js","./node_modules/minimalistic-assert/index.js","./node_modules/minimalistic-crypto-utils/lib/utils.js","./node_modules/brorand/index.js","./node_modules/elliptic/lib/elliptic/curve/index.js","./node_modules/elliptic/lib/elliptic/curve/base.js","./node_modules/elliptic/lib/elliptic/curve/short.js","./node_modules/inherits/inherits_browser.js","./node_modules/elliptic/lib/elliptic/curve/mont.js","./node_modules/elliptic/lib/elliptic/curve/edwards.js","./node_modules/elliptic/lib/elliptic/curves.js","./node_modules/hash.js/lib/hash.js","./node_modules/hash.js/lib/hash/utils.js","./node_modules/hash.js/lib/hash/common.js","./node_modules/hash.js/lib/hash/sha.js","./node_modules/hash.js/lib/hash/sha/1.js","./node_modules/hash.js/lib/hash/sha/common.js","./node_modules/hash.js/lib/hash/sha/224.js","./node_modules/hash.js/lib/hash/sha/256.js","./node_modules/hash.js/lib/hash/sha/384.js","./node_modules/hash.js/lib/hash/sha/512.js","./node_modules/hash.js/lib/hash/ripemd.js","./node_modules/hash.js/lib/hash/hmac.js","./node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js","./node_modules/elliptic/lib/elliptic/ec/index.js","./node_modules/hmac-drbg/lib/hmac-drbg.js","./node_modules/elliptic/lib/elliptic/ec/key.js","./node_modules/elliptic/lib/elliptic/ec/signature.js","./node_modules/elliptic/lib/elliptic/eddsa/index.js","./node_modules/elliptic/lib/elliptic/eddsa/key.js","./node_modules/elliptic/lib/elliptic/eddsa/signature.js","./node_modules/libp2p-crypto/src/keys/key-stretcher.js","./node_modules/libp2p-crypto/src/hmac/index-browser.js","./node_modules/libp2p-crypto/src/hmac/lengths.js","./node_modules/libp2p-crypto/src/keys/ephemeral-keys.js","./node_modules/libp2p-crypto/src/keys/ecdh-browser.js","./node_modules/libp2p-crypto/src/keys/validate-curve-type.js","./node_modules/class-is/index.js","./node_modules/peer-id/src/proto.js","./node_modules/libp2p-crypto/src/index.js","./node_modules/libp2p-crypto/src/aes/index.js","./node_modules/libp2p-crypto/src/aes/ciphers-browser.js","./node_modules/libp2p-crypto/src/aes/cipher-mode.js","./node_modules/libp2p-crypto/src/pbkdf2.js","./node_modules/is-ipfs/src/index.js","./node_modules/multiaddr/src/index.js","./node_modules/multiaddr/src/codec.js","./node_modules/multiaddr/src/convert.js","./node_modules/multiaddr/src/ip.js","./node_modules/is-ip/index.js","./node_modules/ip-regex/index.js","./node_modules/multiaddr/src/protocols-table.js","./node_modules/varint/index.js","./node_modules/varint/encode.js","./node_modules/varint/decode.js","./node_modules/varint/length.js","./node_modules/mafmt/src/index.js","./node_modules/multihashing-async/src/index.js","./node_modules/multihashing-async/src/crypto.js","./node_modules/js-sha3/src/sha3.js","./node_modules/murmurhash3js-revisited/index.js","./node_modules/murmurhash3js-revisited/lib/murmurHash3js.js","./node_modules/multihashing-async/src/utils.js","./node_modules/multihashing-async/src/blake.js","./node_modules/blakejs/index.js","./node_modules/blakejs/blake2b.js","./node_modules/blakejs/util.js","./node_modules/@parcel/node-libs-browser/node_modules/buffer/index.js","./node_modules/base64-js/index.js","./node_modules/ieee754/index.js","./node_modules/blakejs/blake2s.js","./node_modules/ipfs-core/src/components/index.js","./node_modules/ipfs-core/src/utils.js","./node_modules/interface-datastore/src/index.js","./node_modules/interface-datastore/src/key.js","./node_modules/nanoid/index.cjs","./node_modules/crypto-browserify/index.js","./node_modules/randombytes/browser.js","./node_modules/safe-buffer/index.js","./node_modules/create-hash/browser.js","./node_modules/md5.js/index.js","./node_modules/hash-base/index.js","./node_modules/readable-stream/readable-browser.js","./node_modules/readable-stream/lib/_stream_readable.js","./node_modules/events/events.js","./node_modules/readable-stream/lib/internal/streams/stream-browser.js","./node_modules/readable-stream/lib/internal/streams/buffer_list.js","./node_modules/readable-stream/lib/internal/streams/destroy.js","./node_modules/readable-stream/lib/internal/streams/state.js","./node_modules/readable-stream/errors-browser.js","./node_modules/readable-stream/lib/_stream_duplex.js","./node_modules/readable-stream/lib/_stream_writable.js","./node_modules/util-deprecate/browser.js","./node_modules/string_decoder/lib/string_decoder.js","./node_modules/readable-stream/lib/internal/streams/async_iterator.js","./node_modules/readable-stream/lib/internal/streams/end-of-stream.js","./node_modules/readable-stream/lib/internal/streams/from-browser.js","./node_modules/readable-stream/lib/_stream_transform.js","./node_modules/readable-stream/lib/_stream_passthrough.js","./node_modules/readable-stream/lib/internal/streams/pipeline.js","./node_modules/ripemd160/index.js","./node_modules/sha.js/index.js","./node_modules/sha.js/sha.js","./node_modules/sha.js/hash.js","./node_modules/sha.js/sha1.js","./node_modules/sha.js/sha224.js","./node_modules/sha.js/sha256.js","./node_modules/sha.js/sha384.js","./node_modules/sha.js/sha512.js","./node_modules/cipher-base/index.js","./node_modules/create-hmac/browser.js","./node_modules/create-hmac/legacy.js","./node_modules/create-hash/md5.js","./node_modules/browserify-sign/algos.js","./node_modules/pbkdf2/browser.js","./node_modules/pbkdf2/lib/async.js","./node_modules/pbkdf2/lib/precondition.js","./node_modules/pbkdf2/lib/default-encoding.js","./node_modules/pbkdf2/lib/sync-browser.js","./node_modules/pbkdf2/lib/to-buffer.js","./node_modules/browserify-cipher/browser.js","./node_modules/browserify-des/index.js","./node_modules/des.js/lib/des.js","./node_modules/des.js/lib/des/utils.js","./node_modules/des.js/lib/des/cipher.js","./node_modules/des.js/lib/des/des.js","./node_modules/des.js/lib/des/cbc.js","./node_modules/des.js/lib/des/ede.js","./node_modules/browserify-aes/browser.js","./node_modules/browserify-aes/encrypter.js","./node_modules/browserify-aes/modes/index.js","./node_modules/browserify-aes/modes/ecb.js","./node_modules/browserify-aes/modes/cbc.js","./node_modules/buffer-xor/index.js","./node_modules/browserify-aes/modes/cfb.js","./node_modules/browserify-aes/modes/cfb8.js","./node_modules/browserify-aes/modes/cfb1.js","./node_modules/browserify-aes/modes/ofb.js","./node_modules/browserify-aes/modes/ctr.js","./node_modules/browserify-aes/incr32.js","./node_modules/browserify-aes/authCipher.js","./node_modules/browserify-aes/aes.js","./node_modules/browserify-aes/ghash.js","./node_modules/browserify-aes/streamCipher.js","./node_modules/evp_bytestokey/index.js","./node_modules/browserify-aes/decrypter.js","./node_modules/browserify-des/modes.js","./node_modules/diffie-hellman/browser.js","./node_modules/diffie-hellman/lib/generatePrime.js","./node_modules/miller-rabin/lib/mr.js","./node_modules/diffie-hellman/lib/dh.js","./node_modules/browserify-sign/browser/index.js","./node_modules/browserify-sign/browser/sign.js","./node_modules/browserify-rsa/index.js","./node_modules/browserify-rsa/node_modules/bn.js/lib/bn.js","./node_modules/browserify-sign/node_modules/bn.js/lib/bn.js","./node_modules/parse-asn1/index.js","./node_modules/parse-asn1/asn1.js","./node_modules/asn1.js/lib/asn1.js","./node_modules/asn1.js/lib/asn1/api.js","./node_modules/asn1.js/lib/asn1/encoders/index.js","./node_modules/asn1.js/lib/asn1/encoders/der.js","./node_modules/safer-buffer/safer.js","./node_modules/asn1.js/lib/asn1/base/node.js","./node_modules/asn1.js/lib/asn1/base/reporter.js","./node_modules/asn1.js/lib/asn1/base/buffer.js","./node_modules/asn1.js/lib/asn1/constants/der.js","./node_modules/asn1.js/lib/asn1/encoders/pem.js","./node_modules/asn1.js/lib/asn1/decoders/index.js","./node_modules/asn1.js/lib/asn1/decoders/der.js","./node_modules/asn1.js/lib/asn1/decoders/pem.js","./node_modules/asn1.js/lib/asn1/base/index.js","./node_modules/asn1.js/lib/asn1/constants/index.js","./node_modules/parse-asn1/certificate.js","./node_modules/parse-asn1/fixProc.js","./node_modules/browserify-sign/browser/verify.js","./node_modules/create-ecdh/browser.js","./node_modules/public-encrypt/browser.js","./node_modules/public-encrypt/publicEncrypt.js","./node_modules/public-encrypt/mgf.js","./node_modules/public-encrypt/xor.js","./node_modules/public-encrypt/withPublic.js","./node_modules/public-encrypt/privateDecrypt.js","./node_modules/randomfill/browser.js","./node_modules/nanoid/url-alphabet/index.cjs","./node_modules/interface-datastore/src/memory.js","./node_modules/interface-datastore/src/adapter.js","./node_modules/interface-datastore/src/utils.js","./node_modules/ipfs-utils/src/temp-dir.browser.js","./node_modules/it-all/index.js","./node_modules/it-drain/index.js","./node_modules/it-filter/index.js","./node_modules/it-take/index.js","./node_modules/interface-datastore/src/errors.js","./node_modules/ipfs-core-utils/src/with-timeout-option.js","./node_modules/timeout-abort-controller/index.js","./node_modules/timeout-abort-controller/node_modules/retimer/retimer.js","./node_modules/timeout-abort-controller/node_modules/retimer/time-browser.js","./node_modules/parse-duration/index.js","./node_modules/ipfs-core-utils/src/errors.js","./node_modules/ipfs-core/src/components/dag/resolve.js","./node_modules/ipfs-core-utils/src/to-cid-and-path.js","./node_modules/debug/src/browser.js","./node_modules/debug/src/common.js","./node_modules/debug/node_modules/ms/index.js","./node_modules/ipld-dag-pb/src/index.js","./node_modules/ipld-dag-pb/src/resolver.js","./node_modules/ipld-dag-pb/src/util.js","./node_modules/ipld-dag-pb/src/dag.js","./node_modules/ipld-dag-pb/src/dag-link/dagLink.js","./node_modules/ipld-dag-pb/src/dag-node/dagNode.js","./node_modules/ipld-dag-pb/src/dag-node/sortLinks.js","./node_modules/stable/stable.js","./node_modules/uint8arrays/compare.js","./node_modules/ipld-dag-pb/src/dag-link/util.js","./node_modules/ipld-dag-pb/src/serialize.js","./node_modules/ipld-dag-pb/src/dag-node/toDagLink.js","./node_modules/ipld-dag-pb/src/genCid.js","./node_modules/ipld-dag-pb/src/dag-node/addLink.js","./node_modules/ipld-dag-pb/src/dag-node/rmLink.js","./node_modules/ipfs-unixfs/src/index.js","./node_modules/ipfs-unixfs/src/unixfs.js","./node_modules/ipfs-core/src/runtime/init-assets-browser.js","./node_modules/ipfs-core/src/errors.js","./node_modules/ipfs-core/src/components/start.js","./node_modules/ipfs-core/src/utils/service.js","./node_modules/ipfs-core/src/components/stop.js","./node_modules/ipfs-core/src/components/dns.js","./node_modules/ipfs-core/src/runtime/dns-browser.js","./node_modules/ipfs-core/src/utils/tlru.js","./node_modules/hashlru/index.js","./node_modules/p-queue/dist/index.js","./node_modules/eventemitter3/index.js","./node_modules/p-timeout/index.js","./node_modules/p-finally/index.js","./node_modules/p-queue/dist/priority-queue.js","./node_modules/p-queue/dist/lower-bound.js","./node_modules/ipfs-core/src/components/is-online.js","./node_modules/ipfs-core/src/components/resolve.js","./node_modules/ipfs-core-utils/src/cid.js","./node_modules/ipfs-core/src/components/pin/index.js","./node_modules/ipfs-core/src/components/pin/add.js","./node_modules/it-last/index.js","./node_modules/ipfs-core/src/components/pin/add-all.js","./node_modules/ipfs-core/src/components/pin/pin-manager.js","./node_modules/dag-cbor-links/index.js","./node_modules/dag-cbor-links/node_modules/ipld-dag-cbor/src/index.js","./node_modules/dag-cbor-links/node_modules/ipld-dag-cbor/src/util.js","./node_modules/dag-cbor-links/node_modules/borc/src/index.js","./node_modules/dag-cbor-links/node_modules/borc/src/diagnose.js","./node_modules/dag-cbor-links/node_modules/borc/src/decoder.js","./node_modules/bignumber.js/bignumber.js","./node_modules/dag-cbor-links/node_modules/borc/src/decoder.asm.js","./node_modules/dag-cbor-links/node_modules/borc/src/utils.js","./node_modules/dag-cbor-links/node_modules/borc/src/constants.js","./node_modules/dag-cbor-links/node_modules/borc/src/simple.js","./node_modules/dag-cbor-links/node_modules/borc/src/tagged.js","./node_modules/dag-cbor-links/node_modules/iso-url/index.js","./node_modules/dag-cbor-links/node_modules/iso-url/src/url-browser.js","./node_modules/dag-cbor-links/node_modules/iso-url/src/relative.js","./node_modules/dag-cbor-links/node_modules/borc/src/encoder.js","./node_modules/is-circular/index.js","./node_modules/is-circular/lib/node.js","./node_modules/dag-cbor-links/node_modules/ipld-dag-cbor/src/resolver.js","./node_modules/it-first/index.js","./node_modules/cborg/cjs/cborg.js","./node_modules/cborg/cjs/lib/encode.js","./node_modules/cborg/cjs/lib/is.js","./node_modules/cborg/cjs/lib/token.js","./node_modules/cborg/cjs/lib/bl.js","./node_modules/cborg/cjs/lib/byte-utils.js","./node_modules/cborg/cjs/lib/common.js","./node_modules/cborg/cjs/lib/jump.js","./node_modules/cborg/cjs/lib/0uint.js","./node_modules/cborg/cjs/lib/1negint.js","./node_modules/cborg/cjs/lib/2bytes.js","./node_modules/cborg/cjs/lib/3string.js","./node_modules/cborg/cjs/lib/4array.js","./node_modules/cborg/cjs/lib/5map.js","./node_modules/cborg/cjs/lib/6tag.js","./node_modules/cborg/cjs/lib/7float.js","./node_modules/cborg/cjs/lib/decode.js","./node_modules/ipfs-core-utils/src/pins/normalise-input.js","./node_modules/ipfs-core/src/components/pin/ls.js","./node_modules/ipfs-core/src/components/pin/rm.js","./node_modules/ipfs-core/src/components/pin/rm-all.js","./node_modules/ipfs-core/src/components/ipns.js","./node_modules/ipfs-core/src/ipns/index.js","./node_modules/ipfs-core/src/ipns/publisher.js","./node_modules/ipns/src/index.js","./node_modules/timestamp-nano/timestamp.js","./node_modules/ipns/src/pb/ipns.js","./node_modules/ipns/src/utils.js","./node_modules/ipns/src/errors.js","./node_modules/ipfs-core/src/ipns/republisher.js","./node_modules/ipfs-core/src/ipns/resolver.js","./node_modules/ipfs-core/src/ipns/routing/config.js","./node_modules/datastore-core/src/index.js","./node_modules/datastore-core/src/keytransform.js","./node_modules/it-map/index.js","./node_modules/datastore-core/src/sharding.js","./node_modules/datastore-core/src/shard.js","./node_modules/datastore-core/src/shard-readme.js","./node_modules/datastore-core/src/mount.js","./node_modules/datastore-core/node_modules/it-merge/index.js","./node_modules/it-pushable/index.js","./node_modules/fast-fifo/index.js","./node_modules/fast-fifo/fixed-size.js","./node_modules/datastore-core/src/tiered.js","./node_modules/datastore-core/src/namespace.js","./node_modules/dlv/index.js","./node_modules/ipfs-core/src/ipns/routing/pubsub-datastore.js","./node_modules/datastore-pubsub/src/index.js","./node_modules/datastore-pubsub/src/utils.js","./node_modules/ipfs-core/src/ipns/routing/offline-datastore.js","./node_modules/libp2p-record/src/index.js","./node_modules/libp2p-record/src/record/index.js","./node_modules/libp2p-record/src/record/record.js","./node_modules/libp2p-record/src/utils.js","./node_modules/libp2p-record/src/validator.js","./node_modules/libp2p-record/src/validators/index.js","./node_modules/libp2p-record/src/validators/public-key.js","./node_modules/libp2p-record/src/selection.js","./node_modules/libp2p-record/src/selectors/index.js","./node_modules/libp2p-record/src/selectors/public-key.js","./node_modules/ipfs-core/src/ipns/routing/utils.js","./node_modules/ipfs-core/src/components/name/index.js","./node_modules/ipfs-core/src/components/name/publish.js","./node_modules/ipfs-core/src/components/name/utils.js","./node_modules/ipfs-core/src/components/name/resolve.js","./node_modules/is-domain-name/index.js","./node_modules/ipfs-core/src/components/name/pubsub/index.js","./node_modules/ipfs-core/src/components/name/pubsub/cancel.js","./node_modules/ipfs-core/src/components/name/pubsub/utils.js","./node_modules/ipfs-core/src/components/name/pubsub/state.js","./node_modules/ipfs-core/src/components/name/pubsub/subs.js","./node_modules/ipfs-core/src/components/refs/index.js","./node_modules/ipfs-core/src/components/refs/local.js","./node_modules/ipfs-core/src/components/bitswap/index.js","./node_modules/ipfs-core/src/components/bitswap/wantlist.js","./node_modules/ipfs-core/src/components/bitswap/wantlist-for-peer.js","./node_modules/ipfs-core/src/components/bitswap/unwant.js","./node_modules/ipfs-core/src/components/bitswap/stat.js","./node_modules/ipfs-core/src/components/bootstrap/index.js","./node_modules/ipfs-core/src/components/bootstrap/add.js","./node_modules/ipfs-core/src/components/bootstrap/utils.js","./node_modules/ipfs-core/src/components/bootstrap/clear.js","./node_modules/ipfs-core/src/components/bootstrap/list.js","./node_modules/ipfs-core/src/components/bootstrap/reset.js","./node_modules/ipfs-core/src/runtime/config-browser.js","./node_modules/ipfs-core/src/components/bootstrap/rm.js","./node_modules/ipfs-core/src/components/block/index.js","./node_modules/ipfs-core/src/components/block/get.js","./node_modules/ipfs-core/src/components/block/utils.js","./node_modules/ipfs-core/src/components/block/put.js","./node_modules/ipld-block/src/index.js","./node_modules/ipfs-core/src/components/block/rm.js","./node_modules/streaming-iterables/dist/index.js","./node_modules/it-pipe/index.js","./node_modules/ipfs-core/src/components/block/stat.js","./node_modules/ipfs-core/src/components/root.js","./node_modules/ipfs-core/src/components/add.js","./node_modules/ipfs-core/src/components/add-all/index.js","./node_modules/ipfs-unixfs-importer/src/index.js","./node_modules/it-parallel-batch/index.js","./node_modules/it-batch/index.js","./node_modules/ipfs-unixfs-importer/src/options.js","./node_modules/ipfs-unixfs-importer/src/dag-builder/index.js","./node_modules/ipfs-unixfs-importer/src/dag-builder/dir.js","./node_modules/ipfs-unixfs-importer/src/utils/persist.js","./node_modules/ipfs-unixfs-importer/src/dag-builder/file/index.js","./node_modules/ipfs-unixfs-importer/src/dag-builder/file/flat.js","./node_modules/ipfs-unixfs-importer/src/dag-builder/file/balanced.js","./node_modules/ipfs-unixfs-importer/src/dag-builder/file/trickle.js","./node_modules/ipfs-unixfs-importer/src/dag-builder/file/buffer-importer.js","./node_modules/ipfs-unixfs-importer/src/chunker/rabin.js","./node_modules/bl/BufferList.js","./node_modules/rabin-wasm/src/index.js","./node_modules/rabin-wasm/src/rabin.js","./node_modules/rabin-wasm/dist/rabin-wasm.js","./node_modules/@assemblyscript/loader/index.js","./node_modules/ipfs-unixfs-importer/src/chunker/fixed-size.js","./node_modules/ipfs-unixfs-importer/src/dag-builder/validate-chunks.js","./node_modules/ipfs-unixfs-importer/src/tree-builder.js","./node_modules/ipfs-unixfs-importer/src/dir-flat.js","./node_modules/ipfs-unixfs-importer/src/dir.js","./node_modules/ipfs-unixfs-importer/src/flat-to-shard.js","./node_modules/ipfs-unixfs-importer/src/dir-sharded.js","./node_modules/hamt-sharding/src/index.js","./node_modules/hamt-sharding/src/bucket.js","./node_modules/sparse-array/index.js","./node_modules/hamt-sharding/src/consumable-hash.js","./node_modules/hamt-sharding/src/consumable-buffer.js","./node_modules/ipfs-unixfs-importer/src/utils/to-path-components.js","./node_modules/ipfs-core-utils/src/files/normalise-input/index.js","./node_modules/ipfs-core-utils/src/files/normalise-input/normalise-content.js","./node_modules/browser-readablestream-to-it/index.js","./node_modules/blob-to-it/index.js","./node_modules/it-peekable/index.js","./node_modules/ipfs-core-utils/src/files/normalise-input/utils.js","./node_modules/ipfs-core-utils/src/files/normalise-input/normalise-input.js","./node_modules/ipfs-core/src/components/add-all/utils.js","./node_modules/ipfs-core/src/components/cat.js","./node_modules/ipfs-unixfs-exporter/src/index.js","./node_modules/ipfs-unixfs-exporter/src/resolvers/index.js","./node_modules/ipfs-unixfs-exporter/src/resolvers/unixfs-v1/index.js","./node_modules/ipfs-unixfs-exporter/src/utils/find-cid-in-shard.js","./node_modules/ipfs-unixfs-exporter/src/resolvers/unixfs-v1/content/file.js","./node_modules/ipfs-unixfs-exporter/src/utils/extract-data-from-block.js","./node_modules/ipfs-unixfs-exporter/src/utils/validate-offset-and-length.js","./node_modules/ipfs-unixfs-exporter/src/resolvers/unixfs-v1/content/directory.js","./node_modules/ipfs-unixfs-exporter/src/resolvers/unixfs-v1/content/hamt-sharded-directory.js","./node_modules/ipfs-unixfs-exporter/src/resolvers/raw.js","./node_modules/ipfs-unixfs-exporter/src/resolvers/dag-cbor.js","./node_modules/ipfs-unixfs-exporter/src/resolvers/identity.js","./node_modules/ipfs-core/src/components/get.js","./node_modules/ipfs-core/src/components/ls.js","./node_modules/ipfs-core/src/components/version.js","./node_modules/ipfs-core/src/components/id.js","./node_modules/ipfs-core/src/components/config.js","./node_modules/just-safe-set/index.js","./node_modules/ipfs-core/src/components/dag/index.js","./node_modules/ipfs-core/src/components/dag/get.js","./node_modules/ipfs-core/src/components/dag/tree.js","./node_modules/ipfs-core/src/components/dag/put.js","./node_modules/ipfs-core/src/preload.js","./node_modules/multiaddr-to-uri/index.js","./node_modules/array-shuffle/index.js","./node_modules/ipfs-core/src/runtime/preload-browser.js","./node_modules/ipfs-core/src/mfs-preload.js","./node_modules/ipfs-core/src/components/files/index.js","./node_modules/ipfs-core/src/components/files/utils/create-lock.js","./node_modules/mortice/lib/index.js","./node_modules/mortice/lib/node.js","./node_modules/mortice/lib/constants.js","./node_modules/mortice/lib/browser.js","./node_modules/observable-webworkers/lib/index.js","./node_modules/promise-timeout/index.js","./node_modules/ipfs-core/src/components/files/stat.js","./node_modules/ipfs-core/src/components/files/utils/to-mfs-path.js","./node_modules/ipfs-core/src/components/files/utils/with-mfs-root.js","./node_modules/ipfs-core/src/components/files/utils/to-path-components.js","./node_modules/ipfs-core/src/components/files/chmod.js","./node_modules/ipfs-core/src/components/files/utils/to-trail.js","./node_modules/ipfs-core/src/components/files/utils/add-link.js","./node_modules/ipfs-core/src/components/files/utils/hamt-utils.js","./node_modules/ipfs-core/src/components/files/utils/update-tree.js","./node_modules/ipfs-core/src/components/files/utils/update-mfs-root.js","./node_modules/ipfs-core/src/components/files/cp.js","./node_modules/ipfs-core/src/components/files/mkdir.js","./node_modules/ipfs-core/src/components/files/utils/create-node.js","./node_modules/ipfs-core/src/components/files/rm.js","./node_modules/ipfs-core/src/components/files/utils/remove-link.js","./node_modules/ipfs-core/src/components/files/flush.js","./node_modules/ipfs-core/src/components/files/mv.js","./node_modules/ipfs-core/src/components/files/touch.js","./node_modules/ipfs-core/src/components/files/write.js","./node_modules/ipfs-core/src/components/files/utils/to-async-iterator.js","./node_modules/ipfs-core/src/components/files/read.js","./node_modules/ipfs-core/src/components/files/ls.js","./node_modules/ipfs-core/src/components/key/index.js","./node_modules/ipfs-core/src/components/key/export.js","./node_modules/ipfs-core/src/components/key/gen.js","./node_modules/ipfs-core/src/components/key/import.js","./node_modules/ipfs-core/src/components/key/info.js","./node_modules/ipfs-core/src/components/key/list.js","./node_modules/ipfs-core/src/components/key/rename.js","./node_modules/ipfs-core/src/components/key/rm.js","./node_modules/ipfs-core/src/components/object/index.js","./node_modules/ipfs-core/src/components/object/data.js","./node_modules/ipfs-core/src/components/object/get.js","./node_modules/ipfs-core/src/components/object/links.js","./node_modules/ipfs-core/src/components/object/new.js","./node_modules/ipfs-core/src/components/object/put.js","./node_modules/ipfs-core/src/components/object/stat.js","./node_modules/ipfs-core/src/components/object/patch/index.js","./node_modules/ipfs-core/src/components/object/patch/add-link.js","./node_modules/ipfs-core/src/components/object/patch/append-data.js","./node_modules/ipfs-core/src/components/object/patch/rm-link.js","./node_modules/ipfs-core/src/components/object/patch/set-data.js","./node_modules/ipfs-core/src/components/repo/index.js","./node_modules/ipfs-core/src/components/repo/gc.js","./node_modules/ipfs-core/src/components/repo/stat.js","./node_modules/ipfs-core/src/components/repo/version.js","./node_modules/ipfs-repo/src/index.js","./node_modules/just-safe-get/index.js","./node_modules/ipfs-repo-migrations/src/index.js","./node_modules/ipfs-repo-migrations/migrations/index.js","./node_modules/ipfs-repo-migrations/migrations/migration-8/index.js","./node_modules/ipfs-repo-migrations/src/utils.js","./node_modules/it-length/index.js","./node_modules/ipfs-repo-migrations/migrations/migration-9/index.js","./node_modules/ipfs-repo-migrations/migrations/migration-9/pin-set.js","./node_modules/ipfs-repo-migrations/migrations/migration-9/pin.js","./node_modules/fnv1a/index.js","./node_modules/ipfs-repo-migrations/migrations/migration-9/utils.js","./node_modules/ipfs-repo-migrations/migrations/migration-10/index.js","./node_modules/ipfs-repo-migrations/src/repo/version.js","./node_modules/ipfs-repo-migrations/src/repo/init.js","./node_modules/ipfs-repo-migrations/src/errors.js","./node_modules/ipfs-repo-migrations/src/repo/lock-memory.js","./node_modules/ipfs-repo/node_modules/bytes/index.js","./node_modules/ipfs-repo/node_modules/ipfs-utils/src/path-join.browser.js","./node_modules/ipfs-repo/src/constants.js","./node_modules/ipfs-repo/src/backends.js","./node_modules/ipfs-repo/src/version.js","./node_modules/ipfs-repo/src/config.js","./node_modules/ipfs-repo/src/errors/index.js","./node_modules/ipfs-repo/src/spec.js","./node_modules/sort-keys/index.js","./node_modules/ipfs-repo/src/api-addr.js","./node_modules/ipfs-repo/src/blockstore.js","./node_modules/ipfs-repo/src/blockstore-utils.js","./node_modules/ipfs-repo/src/idstore.js","./node_modules/ipfs-repo/src/default-options-browser.js","./node_modules/datastore-level/src/index.js","./node_modules/level/browser.js","./node_modules/level-packager/level-packager.js","./node_modules/levelup/lib/levelup.js","./node_modules/util/util.js","./node_modules/util/support/types.js","./node_modules/is-arguments/index.js","./node_modules/call-bind/callBound.js","./node_modules/get-intrinsic/index.js","./node_modules/has-symbols/index.js","./node_modules/has-symbols/shams.js","./node_modules/function-bind/index.js","./node_modules/function-bind/implementation.js","./node_modules/has/src/index.js","./node_modules/call-bind/index.js","./node_modules/is-generator-function/index.js","./node_modules/which-typed-array/index.js","./node_modules/foreach/index.js","./node_modules/available-typed-arrays/index.js","./node_modules/es-abstract/helpers/getOwnPropertyDescriptor.js","./node_modules/is-typed-array/index.js","./node_modules/util/support/isBufferBrowser.js","./node_modules/deferred-leveldown/deferred-leveldown.js","./node_modules/abstract-leveldown/index.js","./node_modules/abstract-leveldown/abstract-leveldown.js","./node_modules/level-supports/index.js","./node_modules/abstract-leveldown/node_modules/is-buffer/index.js","./node_modules/abstract-leveldown/abstract-iterator.js","./node_modules/abstract-leveldown/next-tick-browser.js","./node_modules/queue-microtask/index.js","./node_modules/abstract-leveldown/abstract-chained-batch.js","./node_modules/deferred-leveldown/deferred-iterator.js","./node_modules/level-iterator-stream/index.js","./node_modules/levelup/lib/batch.js","./node_modules/level-errors/errors.js","./node_modules/errno/errno.js","./node_modules/errno/custom.js","./node_modules/prr/prr.js","./node_modules/catering/index.js","./node_modules/levelup/lib/common.js","./node_modules/levelup/lib/next-tick-browser.js","./node_modules/encoding-down/index.js","./node_modules/level-codec/index.js","./node_modules/level-codec/lib/encodings.js","./node_modules/level-js/index.js","./node_modules/level-js/iterator.js","./node_modules/level-js/util/key-range.js","./node_modules/ltgt/index.js","./node_modules/level-js/util/deserialize.js","./node_modules/level-js/util/serialize.js","./node_modules/level-js/util/support.js","./node_modules/level-js/util/clear.js","./node_modules/ipfs-repo/src/default-datastore.js","./node_modules/ipfs-repo/src/lock-memory.js","./node_modules/ipfs-core/src/components/stats/index.js","./node_modules/ipfs-core/src/components/stats/bw.js","./node_modules/ipfs-block-service/src/index.js","./node_modules/ipfs-core/src/components/ipld.js","./node_modules/ipfs-core/src/runtime/ipld.js","./node_modules/ipld-dag-cbor/src/index.js","./node_modules/ipld-dag-cbor/src/util.js","./node_modules/borc/src/index.js","./node_modules/borc/src/diagnose.js","./node_modules/borc/src/decoder.js","./node_modules/borc/src/decoder.asm.js","./node_modules/borc/src/utils.js","./node_modules/borc/src/constants.js","./node_modules/borc/src/simple.js","./node_modules/borc/src/tagged.js","./node_modules/borc/src/encoder.js","./node_modules/ipld-dag-cbor/src/resolver.js","./node_modules/ipld-raw/src/index.js","./node_modules/ipld/src/index.js","./node_modules/typical/dist/index.js","./node_modules/ipld/src/util.js","./node_modules/ipfs-core/src/components/storage.js","./node_modules/ipfs-core/src/runtime/repo-browser.js","./node_modules/ipfs-core/src/components/libp2p.js","./node_modules/ipfs-core/src/runtime/libp2p-pubsub-routers-browser.js","./node_modules/libp2p-gossipsub/src/index.js","./node_modules/libp2p-interfaces/src/pubsub/index.js","./node_modules/libp2p-interfaces/src/topology/multicodec-topology.js","./node_modules/libp2p-interfaces/src/topology/index.js","./node_modules/libp2p-interfaces/src/pubsub/errors.js","./node_modules/libp2p-interfaces/src/pubsub/message/rpc.js","./node_modules/libp2p-interfaces/src/pubsub/peer-streams.js","./node_modules/it-length-prefixed/src/index.js","./node_modules/it-length-prefixed/src/encode.js","./node_modules/it-length-prefixed/src/varint-encode.js","./node_modules/it-length-prefixed/src/decode.js","./node_modules/it-length-prefixed/src/varint-decode.js","./node_modules/it-length-prefixed/src/int32BE-encode.js","./node_modules/it-length-prefixed/src/int32BE-decode.js","./node_modules/abortable-iterator/index.js","./node_modules/get-iterator/index.js","./node_modules/abortable-iterator/AbortError.js","./node_modules/libp2p-interfaces/src/pubsub/signature-policy.js","./node_modules/libp2p-interfaces/src/pubsub/utils.js","./node_modules/libp2p-interfaces/src/pubsub/message/sign.js","./node_modules/libp2p-gossipsub/src/message-cache.js","./node_modules/libp2p-gossipsub/src/utils/index.js","./node_modules/libp2p-gossipsub/src/utils/create-gossip-rpc.js","./node_modules/libp2p-gossipsub/src/utils/shuffle.js","./node_modules/libp2p-gossipsub/src/utils/has-gossip-protocol.js","./node_modules/libp2p-gossipsub/src/constants.js","./node_modules/libp2p-gossipsub/src/utils/messageIdToString.js","./node_modules/libp2p-gossipsub/src/message/rpc.js","./node_modules/libp2p-gossipsub/src/heartbeat.js","./node_modules/libp2p-gossipsub/src/get-gossip-peers.js","./node_modules/libp2p-gossipsub/src/score/index.js","./node_modules/libp2p-gossipsub/src/score/peer-score-params.js","./node_modules/libp2p-gossipsub/src/score/constants.js","./node_modules/libp2p-gossipsub/node_modules/err-code/index.js","./node_modules/libp2p-gossipsub/src/score/peer-score-thresholds.js","./node_modules/libp2p-gossipsub/src/score/peer-score.js","./node_modules/libp2p-gossipsub/src/score/peer-stats.js","./node_modules/libp2p-gossipsub/src/score/compute-score.js","./node_modules/libp2p-gossipsub/src/score/message-deliveries.js","./node_modules/denque/index.js","./node_modules/libp2p-gossipsub/src/tracer.js","./node_modules/time-cache/src/index.js","./node_modules/lodash.throttle/index.js","./node_modules/libp2p/src/record/envelope/index.js","./node_modules/libp2p/src/errors.js","./node_modules/libp2p/src/record/envelope/envelope.js","./node_modules/libp2p/src/index.js","./node_modules/libp2p/src/peer-routing.js","./node_modules/libp2p/src/content-routing/utils.js","./node_modules/libp2p/node_modules/it-take/index.js","./node_modules/it-merge/index.js","./node_modules/set-delayed-interval/src/index.js","./node_modules/libp2p/src/content-routing/index.js","./node_modules/libp2p/src/get-peer.js","./node_modules/libp2p/src/config.js","./node_modules/multiaddr/src/resolvers/index.js","./node_modules/multiaddr/src/resolvers/dns.browser.js","./node_modules/dns-over-http-resolver/src/index.js","./node_modules/receptacle/index.js","./node_modules/ms/index.js","./node_modules/dns-over-http-resolver/src/utils.js","./node_modules/native-fetch/src/index.js","./node_modules/native-fetch/node_modules/node-fetch/browser.js","./node_modules/libp2p/src/constants.js","./node_modules/libp2p/src/identify/consts.js","./node_modules/libp2p/src/circuit/constants.js","./node_modules/libp2p-utils/src/address-sort.js","./node_modules/libp2p-utils/src/multiaddr/is-private.js","./node_modules/private-ip/index.js","./node_modules/private-ip/lib/index.js","./node_modules/netmask/lib/netmask.js","./node_modules/libp2p/src/transport-manager.js","./node_modules/p-settle/index.js","./node_modules/p-reflect/index.js","./node_modules/p-limit/index.js","./node_modules/p-try/index.js","./node_modules/libp2p/src/record/utils.js","./node_modules/libp2p/src/record/peer-record/index.js","./node_modules/libp2p-utils/src/array-equals.js","./node_modules/libp2p/src/record/peer-record/peer-record.js","./node_modules/libp2p/src/record/peer-record/consts.js","./node_modules/libp2p/src/address-manager/index.js","./node_modules/libp2p/src/connection-manager/index.js","./node_modules/libp2p/src/connection-manager/latency-monitor.js","./node_modules/libp2p/src/connection-manager/visibility-change-emitter.js","./node_modules/retimer/retimer.js","./node_modules/retimer/time-browser.js","./node_modules/libp2p/src/circuit/transport.js","./node_modules/libp2p/src/circuit/protocol/index.js","./node_modules/libp2p-utils/src/stream-to-ma-conn.js","./node_modules/libp2p/src/circuit/multicodec.js","./node_modules/libp2p/src/circuit/listener.js","./node_modules/libp2p/src/circuit/circuit/hop.js","./node_modules/libp2p/src/circuit/circuit/utils.js","./node_modules/libp2p/src/circuit/circuit/stream-handler.js","./node_modules/it-handshake/src/index.js","./node_modules/it-reader/index.js","./node_modules/p-defer/index.js","./node_modules/libp2p/src/circuit/circuit/stop.js","./node_modules/libp2p/src/circuit/index.js","./node_modules/libp2p/src/circuit/auto-relay.js","./node_modules/libp2p/src/circuit/utils.js","./node_modules/libp2p/src/dialer/index.js","./node_modules/libp2p/src/dialer/dial-request.js","./node_modules/p-fifo/index.js","./node_modules/p-any/index.js","./node_modules/p-some/index.js","./node_modules/aggregate-error/index.js","./node_modules/indent-string/index.js","./node_modules/clean-stack/index.js","./node_modules/p-cancelable/index.js","./node_modules/libp2p/src/keychain/index.js","./node_modules/sanitize-filename/index.js","./node_modules/truncate-utf8-bytes/browser.js","./node_modules/truncate-utf8-bytes/lib/truncate.js","./node_modules/utf8-byte-length/browser.js","./node_modules/libp2p/src/keychain/cms.js","./node_modules/node-forge/lib/pkcs7.js","./node_modules/node-forge/lib/pkcs7asn1.js","./node_modules/node-forge/lib/x509.js","./node_modules/node-forge/lib/mgf.js","./node_modules/node-forge/lib/mgf1.js","./node_modules/node-forge/lib/pss.js","./node_modules/libp2p/src/keychain/util.js","./node_modules/libp2p/src/metrics/index.js","./node_modules/libp2p/src/metrics/old-peers.js","./node_modules/libp2p/src/metrics/stats.js","./node_modules/@vascosantos/moving-average/index.js","./node_modules/libp2p/src/upgrader.js","./node_modules/multistream-select/src/index.js","./node_modules/multistream-select/src/select.js","./node_modules/multistream-select/src/multistream.js","./node_modules/multistream-select/src/handle.js","./node_modules/multistream-select/src/constants.js","./node_modules/multistream-select/src/ls.js","./node_modules/libp2p-interfaces/src/connection/index.js","./node_modules/libp2p-interfaces/src/connection/connection.js","./node_modules/libp2p-interfaces/src/connection/status.js","./node_modules/mutable-proxy/build/index.js","./node_modules/libp2p/src/peer-store/index.js","./node_modules/libp2p/src/peer-store/address-book.js","./node_modules/libp2p/src/peer-store/book.js","./node_modules/libp2p/src/peer-store/key-book.js","./node_modules/libp2p/src/peer-store/metadata-book.js","./node_modules/libp2p/src/peer-store/proto-book.js","./node_modules/libp2p/src/pubsub-adapter.js","./node_modules/libp2p/src/peer-store/persistent/index.js","./node_modules/libp2p/src/peer-store/persistent/consts.js","./node_modules/libp2p/src/peer-store/persistent/pb/address-book.js","./node_modules/libp2p/src/peer-store/persistent/pb/proto-book.js","./node_modules/libp2p/src/registrar.js","./node_modules/libp2p/src/ping/index.js","./node_modules/it-buffer/index.js","./node_modules/libp2p/src/ping/constants.js","./node_modules/libp2p/src/identify/index.js","./node_modules/libp2p/src/identify/message.js","./node_modules/libp2p/src/nat-manager.js","./node_modules/es6-promisify/dist/promisify.js","./node_modules/wherearewe/src/index.js","./node_modules/p-retry/index.js","./node_modules/retry/lib/retry.js","./node_modules/retry/lib/retry_operation.js","./node_modules/libp2p-utils/src/multiaddr/is-loopback.js","./node_modules/is-loopback-addr/index.js","./node_modules/ipfs-core/src/runtime/libp2p-browser.js","./node_modules/libp2p-websockets/src/index.js","./node_modules/it-ws/client.js","./node_modules/it-ws/web-socket.js","./node_modules/it-ws/duplex.js","./node_modules/it-ws/source.js","./node_modules/event-iterator/lib/dom.js","./node_modules/event-iterator/lib/event-iterator.js","./node_modules/it-ws/sink.js","./node_modules/it-ws/ready.js","./node_modules/it-ws/ws-url.js","./node_modules/libp2p-websockets/src/listener.browser.js","./node_modules/libp2p-websockets/src/socket-to-conn.js","./node_modules/libp2p-websockets/src/constants.js","./node_modules/libp2p-utils/src/ip-port-to-multiaddr.js","./node_modules/ip-address/dist/ip-address.js","./node_modules/ip-address/dist/lib/ipv4.js","./node_modules/ip-address/dist/lib/common.js","./node_modules/ip-address/dist/lib/v4/constants.js","./node_modules/ip-address/dist/lib/address-error.js","./node_modules/ip-address/node_modules/jsbn/index.js","./node_modules/sprintf-js/src/sprintf.js","./node_modules/ip-address/dist/lib/ipv6.js","./node_modules/ip-address/dist/lib/v6/constants.js","./node_modules/ip-address/dist/lib/v6/helpers.js","./node_modules/ip-address/dist/lib/v6/regular-expressions.js","./node_modules/libp2p-websockets/node_modules/p-timeout/index.js","./node_modules/libp2p-websockets/src/filters.js","./node_modules/libp2p-webrtc-star/src/index.js","./node_modules/libp2p-webrtc-peer/index.js","./node_modules/get-browser-rtc/index.js","./node_modules/libp2p-webrtc-peer/node_modules/err-code/index.js","./node_modules/libp2p-webrtc-star/node_modules/ipfs-utils/src/supports.js","./node_modules/libp2p-webrtc-star/src/constants.js","./node_modules/libp2p-webrtc-star/src/listener.js","./node_modules/socket.io-client-next/build/index.js","./node_modules/socket.io-client-next/build/url.js","./node_modules/parseuri/index.js","./node_modules/socket.io-client-next/build/manager.js","./node_modules/engine.io-client/lib/index.js","./node_modules/engine.io-client/lib/socket.js","./node_modules/engine.io-client/lib/transports/index.js","./node_modules/engine.io-client/lib/xmlhttprequest.js","./node_modules/has-cors/index.js","./node_modules/engine.io-client/lib/globalThis.browser.js","./node_modules/engine.io-client/lib/transports/polling-xhr.js","./node_modules/engine.io-client/lib/transports/polling.js","./node_modules/engine.io-client/lib/transport.js","./node_modules/engine.io-client/node_modules/engine.io-parser/lib/index.js","./node_modules/engine.io-client/node_modules/engine.io-parser/lib/encodePacket.browser.js","./node_modules/engine.io-client/node_modules/engine.io-parser/lib/commons.js","./node_modules/engine.io-client/node_modules/engine.io-parser/lib/decodePacket.browser.js","./node_modules/base64-arraybuffer/lib/base64-arraybuffer.js","./node_modules/component-emitter/index.js","./node_modules/parseqs/index.js","./node_modules/yeast/index.js","./node_modules/engine.io-client/lib/util.js","./node_modules/engine.io-client/lib/transports/polling-jsonp.js","./node_modules/engine.io-client/lib/transports/websocket.js","./node_modules/engine.io-client/lib/transports/websocket-constructor.browser.js","./node_modules/socket.io-client-next/build/socket.js","./node_modules/socket.io-parser/dist/index.js","./node_modules/socket.io-parser/dist/binary.js","./node_modules/socket.io-parser/dist/is-binary.js","./node_modules/socket.io-client-next/build/on.js","./node_modules/backo2/index.js","./node_modules/libp2p-webrtc-star/src/socket-to-conn.js","./node_modules/stream-to-it/index.js","./node_modules/stream-to-it/source.js","./node_modules/stream-to-it/sink.js","./node_modules/stream-to-it/transform.js","./node_modules/stream-to-it/duplex.js","./node_modules/libp2p-webrtc-star/src/utils.js","./node_modules/libp2p-mplex/src/index.js","./node_modules/libp2p-mplex/src/mplex.js","./node_modules/libp2p-mplex/src/coder/index.js","./node_modules/libp2p-mplex/src/coder/encode.browser.js","./node_modules/libp2p-mplex/src/coder/decode.js","./node_modules/libp2p-mplex/src/restrict-size.js","./node_modules/libp2p-mplex/src/message-types.js","./node_modules/libp2p-mplex/src/stream.js","./node_modules/libp2p-noise/src/index.ts","./node_modules/libp2p-noise/src/noise.ts","./node_modules/bcrypto/lib/js/x25519.js","./node_modules/bcrypto/lib/js/ecdh.js","./node_modules/bcrypto/lib/internal/assert.js","./node_modules/bcrypto/lib/bn-browser.js","./node_modules/bcrypto/lib/js/bn.js","./node_modules/bcrypto/lib/internal/custom-browser.js","./node_modules/bcrypto/lib/js/elliptic.js","./node_modules/bcrypto/lib/random-browser.js","./node_modules/bcrypto/lib/js/random.js","./node_modules/it-pb-rpc/src/index.js","./node_modules/it-pb-rpc/node_modules/is-buffer/index.js","./node_modules/it-pair/duplex.js","./node_modules/it-pair/index.js","./node_modules/libp2p-noise/src/handshake-xx.ts","./node_modules/libp2p-noise/src/handshakes/xx.ts","./node_modules/libp2p-noise/src/utils.ts","./node_modules/bcrypto/lib/hkdf-browser.js","./node_modules/bcrypto/lib/js/hkdf.js","./node_modules/bcrypto/lib/js/sha256.js","./node_modules/bcrypto/lib/internal/hmac.js","./node_modules/libp2p-noise/src/proto/payload.js","./node_modules/libp2p-noise/src/handshakes/abstract-handshake.ts","./node_modules/bcrypto/lib/js/aead.js","./node_modules/bcrypto/lib/js/chacha20.js","./node_modules/bcrypto/lib/js/poly1305.js","./node_modules/libp2p-noise/src/logger.ts","./node_modules/libp2p-noise/src/constants.ts","./node_modules/libp2p-noise/src/encoder.ts","./node_modules/libp2p-noise/src/handshake-ik.ts","./node_modules/libp2p-noise/src/handshakes/ik.ts","./node_modules/libp2p-noise/src/errors.ts","./node_modules/libp2p-noise/src/handshake-xx-fallback.ts","./node_modules/libp2p-noise/src/crypto.ts","./node_modules/libp2p-noise/src/keycache.ts","./node_modules/libp2p-kad-dht/src/index.js","./node_modules/libp2p-kad-dht/src/routing.js","./node_modules/k-bucket/index.js","./node_modules/libp2p-kad-dht/src/utils.js","./node_modules/xor-distance/index.js","./node_modules/p-map/index.js","./node_modules/libp2p-kad-dht/src/constants.js","./node_modules/libp2p-kad-dht/src/network.js","./node_modules/libp2p-kad-dht/node_modules/p-timeout/index.js","./node_modules/libp2p-kad-dht/src/rpc/index.js","./node_modules/libp2p-kad-dht/src/message/index.js","./node_modules/libp2p-kad-dht/src/message/dht.js","./node_modules/libp2p-kad-dht/src/rpc/handlers/index.js","./node_modules/libp2p-kad-dht/src/rpc/handlers/get-value.js","./node_modules/libp2p-kad-dht/src/rpc/handlers/put-value.js","./node_modules/libp2p-kad-dht/src/rpc/handlers/find-node.js","./node_modules/libp2p-kad-dht/src/rpc/handlers/add-provider.js","./node_modules/libp2p-kad-dht/src/rpc/handlers/get-providers.js","./node_modules/libp2p-kad-dht/src/rpc/handlers/ping.js","./node_modules/libp2p-kad-dht/src/content-fetching/index.js","./node_modules/libp2p-kad-dht/src/query/index.js","./node_modules/libp2p-kad-dht/src/query/run.js","./node_modules/libp2p-kad-dht/src/peer-list/peer-distance-list.js","./node_modules/libp2p-kad-dht/src/query/path.js","./node_modules/libp2p-kad-dht/src/peer-list/peer-queue.js","./node_modules/heap/index.js","./node_modules/heap/lib/heap.js","./node_modules/libp2p-kad-dht/src/query/worker-queue.js","./node_modules/libp2p-kad-dht/src/content-routing/index.js","./node_modules/libp2p-kad-dht/src/peer-list/limited-peer-list.js","./node_modules/libp2p-kad-dht/src/peer-list/index.js","./node_modules/libp2p-kad-dht/src/peer-routing/index.js","./node_modules/libp2p-kad-dht/src/providers.js","./node_modules/libp2p-kad-dht/src/random-walk.js","./node_modules/p-times/index.js","./node_modules/libp2p-kad-dht/src/query-manager.js","./node_modules/libp2p-bootstrap/src/index.js","./node_modules/ipfs-core/src/components/network.js","./node_modules/ipfs-bitswap/src/index.js","./node_modules/ipfs-bitswap/src/want-manager/index.js","./node_modules/ipfs-bitswap/src/types/message/index.js","./node_modules/varint-decoder/src/index.js","./node_modules/varint-decoder/node_modules/varint/index.js","./node_modules/varint-decoder/node_modules/varint/encode.js","./node_modules/varint-decoder/node_modules/varint/decode.js","./node_modules/varint-decoder/node_modules/varint/length.js","./node_modules/ipfs-bitswap/src/utils/index.js","./node_modules/ipfs-bitswap/src/types/message/message.js","./node_modules/ipfs-bitswap/src/types/message/entry.js","./node_modules/ipfs-bitswap/src/types/wantlist/index.js","./node_modules/ipfs-bitswap/src/types/wantlist/entry.js","./node_modules/ipfs-bitswap/src/constants.js","./node_modules/ipfs-bitswap/src/want-manager/msg-queue.js","./node_modules/just-debounce-it/index.js","./node_modules/ipfs-bitswap/src/network.js","./node_modules/ipfs-bitswap/src/decision-engine/index.js","./node_modules/ipfs-bitswap/src/decision-engine/ledger.js","./node_modules/ipfs-bitswap/src/decision-engine/req-queue.js","./node_modules/ipfs-bitswap/src/utils/sorted-map.js","./node_modules/ipfs-bitswap/src/decision-engine/task-merger.js","./node_modules/ipfs-bitswap/src/notifications.js","./node_modules/ipfs-bitswap/src/stats/index.js","./node_modules/ipfs-bitswap/src/stats/stat.js","./node_modules/ipfs-core/src/components/swarm/index.js","./node_modules/ipfs-core/src/components/swarm/addrs.js","./node_modules/ipfs-core/src/components/swarm/connect.js","./node_modules/ipfs-core/src/components/swarm/disconnect.js","./node_modules/ipfs-core/src/components/swarm/local-addrs.js","./node_modules/ipfs-core/src/components/swarm/peers.js","./node_modules/ipfs-core/src/components/gc-lock.js","./node_modules/ipfs-core/src/components/ping.js","./node_modules/ipfs-core/src/components/dht.js","./node_modules/ipfs-core/src/components/pubsub.js"],"sourcesContent":["import { createApp } from \"vue\";\nimport { createRouter, createWebHistory } from 'vue-router';\nimport { createMetaManager, plugin as metaPlugin } from 'vue-meta'\n\nimport App from \"./App\";\nimport Home from \"./Home\";\nimport IpfsVideo from \"./IpfsVideo\";\nimport PathForm from \"./components/PathForm\";\nimport IpfsGatewayVideo from \"./IpfsGatewayVideo\";\nimport IpfsLs from './IpfsLs';\nimport NotFound from './NotFound';\nimport VueIpfs from './plugins/vue-ipfs';\n\nconst routes = [\n  { path: '/', component: Home },\n  { path: '/ipfs/:ipfsPath+', component: IpfsVideo },\n  { path: '/gw/:ipfsPath+', component: IpfsGatewayVideo },\n  { path: '/ls/:ipfsPath+', component: IpfsLs },\n  { path: '/:pathMatch(.*)*', name: 'NotFound', component: NotFound },\n]\nconst router = createRouter({\n  history: createWebHistory(),\n  routes: routes\n})\n\nconst app = createApp(App)\n  .use(router)\n  .use(VueIpfs)\n  .use(createMetaManager())\n  .use(metaPlugin)\n\napp.component('path-form', PathForm);\napp.mount(\"#app\");\n\n\n","'use strict'\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./dist/vue.cjs.prod.js')\n} else {\n  module.exports = require('./dist/vue.cjs.js')\n}\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar compilerDom = require('@vue/compiler-dom');\nvar runtimeDom = require('@vue/runtime-dom');\nvar shared = require('@vue/shared');\n\nfunction _interopNamespace(e) {\n  if (e && e.__esModule) return e;\n  var n = Object.create(null);\n  if (e) {\n    Object.keys(e).forEach(function (k) {\n      n[k] = e[k];\n    });\n  }\n  n['default'] = e;\n  return Object.freeze(n);\n}\n\nvar runtimeDom__namespace = /*#__PURE__*/_interopNamespace(runtimeDom);\n\n// This entry is the \"full-build\" that includes both the runtime\r\nconst compileCache = Object.create(null);\r\nfunction compileToFunction(template, options) {\r\n    if (!shared.isString(template)) {\r\n        if (template.nodeType) {\r\n            template = template.innerHTML;\r\n        }\r\n        else {\r\n            return shared.NOOP;\r\n        }\r\n    }\r\n    const key = template;\r\n    const cached = compileCache[key];\r\n    if (cached) {\r\n        return cached;\r\n    }\r\n    if (template[0] === '#') {\r\n        const el = document.querySelector(template);\r\n        // __UNSAFE__\r\n        // Reason: potential execution of JS expressions in in-DOM template.\r\n        // The user must make sure the in-DOM template is trusted. If it's rendered\r\n        // by the server, the template should not contain any user data.\r\n        template = el ? el.innerHTML : ``;\r\n    }\r\n    const { code } = compilerDom.compile(template, shared.extend({\r\n        hoistStatic: true,\r\n        onError: undefined,\r\n        onWarn: shared.NOOP\r\n    }, options));\r\n    // The wildcard import results in a huge object with every export\r\n    // with keys that cannot be mangled, and can be quite heavy size-wise.\r\n    // In the global build we know `Vue` is available globally so we can avoid\r\n    // the wildcard object.\r\n    const render = (new Function('Vue', code)(runtimeDom__namespace));\r\n    render._rc = true;\r\n    return (compileCache[key] = render);\r\n}\r\nruntimeDom.registerRuntimeCompiler(compileToFunction);\n\nObject.keys(runtimeDom).forEach(function (k) {\n  if (k !== 'default') exports[k] = runtimeDom[k];\n});\nexports.compile = compileToFunction;\n","'use strict'\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./dist/compiler-dom.cjs.prod.js')\n} else {\n  module.exports = require('./dist/compiler-dom.cjs.js')\n}\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar compilerCore = require('@vue/compiler-core');\nvar shared = require('@vue/shared');\n\nconst V_MODEL_RADIO = Symbol(``);\r\nconst V_MODEL_CHECKBOX = Symbol(``);\r\nconst V_MODEL_TEXT = Symbol(``);\r\nconst V_MODEL_SELECT = Symbol(``);\r\nconst V_MODEL_DYNAMIC = Symbol(``);\r\nconst V_ON_WITH_MODIFIERS = Symbol(``);\r\nconst V_ON_WITH_KEYS = Symbol(``);\r\nconst V_SHOW = Symbol(``);\r\nconst TRANSITION = Symbol(``);\r\nconst TRANSITION_GROUP = Symbol(``);\r\ncompilerCore.registerRuntimeHelpers({\r\n    [V_MODEL_RADIO]: `vModelRadio`,\r\n    [V_MODEL_CHECKBOX]: `vModelCheckbox`,\r\n    [V_MODEL_TEXT]: `vModelText`,\r\n    [V_MODEL_SELECT]: `vModelSelect`,\r\n    [V_MODEL_DYNAMIC]: `vModelDynamic`,\r\n    [V_ON_WITH_MODIFIERS]: `withModifiers`,\r\n    [V_ON_WITH_KEYS]: `withKeys`,\r\n    [V_SHOW]: `vShow`,\r\n    [TRANSITION]: `Transition`,\r\n    [TRANSITION_GROUP]: `TransitionGroup`\r\n});\n\nvar namedCharacterReferences = {\n\tGT: \">\",\n\tgt: \">\",\n\tLT: \"<\",\n\tlt: \"<\",\n\t\"ac;\": \"∾\",\n\t\"af;\": \"⁡\",\n\tAMP: \"&\",\n\tamp: \"&\",\n\t\"ap;\": \"≈\",\n\t\"DD;\": \"ⅅ\",\n\t\"dd;\": \"ⅆ\",\n\tdeg: \"°\",\n\t\"ee;\": \"ⅇ\",\n\t\"eg;\": \"⪚\",\n\t\"el;\": \"⪙\",\n\tETH: \"Ð\",\n\teth: \"ð\",\n\t\"gE;\": \"≧\",\n\t\"ge;\": \"≥\",\n\t\"Gg;\": \"⋙\",\n\t\"gg;\": \"≫\",\n\t\"gl;\": \"≷\",\n\t\"GT;\": \">\",\n\t\"Gt;\": \"≫\",\n\t\"gt;\": \">\",\n\t\"ic;\": \"⁣\",\n\t\"ii;\": \"ⅈ\",\n\t\"Im;\": \"ℑ\",\n\t\"in;\": \"∈\",\n\t\"it;\": \"⁢\",\n\t\"lE;\": \"≦\",\n\t\"le;\": \"≤\",\n\t\"lg;\": \"≶\",\n\t\"Ll;\": \"⋘\",\n\t\"ll;\": \"≪\",\n\t\"LT;\": \"<\",\n\t\"Lt;\": \"≪\",\n\t\"lt;\": \"<\",\n\t\"mp;\": \"∓\",\n\t\"Mu;\": \"Μ\",\n\t\"mu;\": \"μ\",\n\t\"ne;\": \"≠\",\n\t\"ni;\": \"∋\",\n\tnot: \"¬\",\n\t\"Nu;\": \"Ν\",\n\t\"nu;\": \"ν\",\n\t\"Or;\": \"⩔\",\n\t\"or;\": \"∨\",\n\t\"oS;\": \"Ⓢ\",\n\t\"Pi;\": \"Π\",\n\t\"pi;\": \"π\",\n\t\"pm;\": \"±\",\n\t\"Pr;\": \"⪻\",\n\t\"pr;\": \"≺\",\n\t\"Re;\": \"ℜ\",\n\tREG: \"®\",\n\treg: \"®\",\n\t\"rx;\": \"℞\",\n\t\"Sc;\": \"⪼\",\n\t\"sc;\": \"≻\",\n\tshy: \"­\",\n\tuml: \"¨\",\n\t\"wp;\": \"℘\",\n\t\"wr;\": \"≀\",\n\t\"Xi;\": \"Ξ\",\n\t\"xi;\": \"ξ\",\n\tyen: \"¥\",\n\t\"acd;\": \"∿\",\n\t\"acE;\": \"∾̳\",\n\t\"Acy;\": \"А\",\n\t\"acy;\": \"а\",\n\t\"Afr;\": \"𝔄\",\n\t\"afr;\": \"𝔞\",\n\t\"AMP;\": \"&\",\n\t\"amp;\": \"&\",\n\t\"And;\": \"⩓\",\n\t\"and;\": \"∧\",\n\t\"ang;\": \"∠\",\n\t\"apE;\": \"⩰\",\n\t\"ape;\": \"≊\",\n\t\"ast;\": \"*\",\n\tAuml: \"Ä\",\n\tauml: \"ä\",\n\t\"Bcy;\": \"Б\",\n\t\"bcy;\": \"б\",\n\t\"Bfr;\": \"𝔅\",\n\t\"bfr;\": \"𝔟\",\n\t\"bne;\": \"=⃥\",\n\t\"bot;\": \"⊥\",\n\t\"Cap;\": \"⋒\",\n\t\"cap;\": \"∩\",\n\tcent: \"¢\",\n\t\"Cfr;\": \"ℭ\",\n\t\"cfr;\": \"𝔠\",\n\t\"Chi;\": \"Χ\",\n\t\"chi;\": \"χ\",\n\t\"cir;\": \"○\",\n\tCOPY: \"©\",\n\tcopy: \"©\",\n\t\"Cup;\": \"⋓\",\n\t\"cup;\": \"∪\",\n\t\"Dcy;\": \"Д\",\n\t\"dcy;\": \"д\",\n\t\"deg;\": \"°\",\n\t\"Del;\": \"∇\",\n\t\"Dfr;\": \"𝔇\",\n\t\"dfr;\": \"𝔡\",\n\t\"die;\": \"¨\",\n\t\"div;\": \"÷\",\n\t\"Dot;\": \"¨\",\n\t\"dot;\": \"˙\",\n\t\"Ecy;\": \"Э\",\n\t\"ecy;\": \"э\",\n\t\"Efr;\": \"𝔈\",\n\t\"efr;\": \"𝔢\",\n\t\"egs;\": \"⪖\",\n\t\"ell;\": \"ℓ\",\n\t\"els;\": \"⪕\",\n\t\"ENG;\": \"Ŋ\",\n\t\"eng;\": \"ŋ\",\n\t\"Eta;\": \"Η\",\n\t\"eta;\": \"η\",\n\t\"ETH;\": \"Ð\",\n\t\"eth;\": \"ð\",\n\tEuml: \"Ë\",\n\teuml: \"ë\",\n\t\"Fcy;\": \"Ф\",\n\t\"fcy;\": \"ф\",\n\t\"Ffr;\": \"𝔉\",\n\t\"ffr;\": \"𝔣\",\n\t\"gap;\": \"⪆\",\n\t\"Gcy;\": \"Г\",\n\t\"gcy;\": \"г\",\n\t\"gEl;\": \"⪌\",\n\t\"gel;\": \"⋛\",\n\t\"geq;\": \"≥\",\n\t\"ges;\": \"⩾\",\n\t\"Gfr;\": \"𝔊\",\n\t\"gfr;\": \"𝔤\",\n\t\"ggg;\": \"⋙\",\n\t\"gla;\": \"⪥\",\n\t\"glE;\": \"⪒\",\n\t\"glj;\": \"⪤\",\n\t\"gnE;\": \"≩\",\n\t\"gne;\": \"⪈\",\n\t\"Hat;\": \"^\",\n\t\"Hfr;\": \"ℌ\",\n\t\"hfr;\": \"𝔥\",\n\t\"Icy;\": \"И\",\n\t\"icy;\": \"и\",\n\t\"iff;\": \"⇔\",\n\t\"Ifr;\": \"ℑ\",\n\t\"ifr;\": \"𝔦\",\n\t\"Int;\": \"∬\",\n\t\"int;\": \"∫\",\n\tIuml: \"Ï\",\n\tiuml: \"ï\",\n\t\"Jcy;\": \"Й\",\n\t\"jcy;\": \"й\",\n\t\"Jfr;\": \"𝔍\",\n\t\"jfr;\": \"𝔧\",\n\t\"Kcy;\": \"К\",\n\t\"kcy;\": \"к\",\n\t\"Kfr;\": \"𝔎\",\n\t\"kfr;\": \"𝔨\",\n\t\"lap;\": \"⪅\",\n\t\"lat;\": \"⪫\",\n\t\"Lcy;\": \"Л\",\n\t\"lcy;\": \"л\",\n\t\"lEg;\": \"⪋\",\n\t\"leg;\": \"⋚\",\n\t\"leq;\": \"≤\",\n\t\"les;\": \"⩽\",\n\t\"Lfr;\": \"𝔏\",\n\t\"lfr;\": \"𝔩\",\n\t\"lgE;\": \"⪑\",\n\t\"lnE;\": \"≨\",\n\t\"lne;\": \"⪇\",\n\t\"loz;\": \"◊\",\n\t\"lrm;\": \"‎\",\n\t\"Lsh;\": \"↰\",\n\t\"lsh;\": \"↰\",\n\tmacr: \"¯\",\n\t\"Map;\": \"⤅\",\n\t\"map;\": \"↦\",\n\t\"Mcy;\": \"М\",\n\t\"mcy;\": \"м\",\n\t\"Mfr;\": \"𝔐\",\n\t\"mfr;\": \"𝔪\",\n\t\"mho;\": \"℧\",\n\t\"mid;\": \"∣\",\n\t\"nap;\": \"≉\",\n\tnbsp: \" \",\n\t\"Ncy;\": \"Н\",\n\t\"ncy;\": \"н\",\n\t\"Nfr;\": \"𝔑\",\n\t\"nfr;\": \"𝔫\",\n\t\"ngE;\": \"≧̸\",\n\t\"nge;\": \"≱\",\n\t\"nGg;\": \"⋙̸\",\n\t\"nGt;\": \"≫⃒\",\n\t\"ngt;\": \"≯\",\n\t\"nis;\": \"⋼\",\n\t\"niv;\": \"∋\",\n\t\"nlE;\": \"≦̸\",\n\t\"nle;\": \"≰\",\n\t\"nLl;\": \"⋘̸\",\n\t\"nLt;\": \"≪⃒\",\n\t\"nlt;\": \"≮\",\n\t\"Not;\": \"⫬\",\n\t\"not;\": \"¬\",\n\t\"npr;\": \"⊀\",\n\t\"nsc;\": \"⊁\",\n\t\"num;\": \"#\",\n\t\"Ocy;\": \"О\",\n\t\"ocy;\": \"о\",\n\t\"Ofr;\": \"𝔒\",\n\t\"ofr;\": \"𝔬\",\n\t\"ogt;\": \"⧁\",\n\t\"ohm;\": \"Ω\",\n\t\"olt;\": \"⧀\",\n\t\"ord;\": \"⩝\",\n\tordf: \"ª\",\n\tordm: \"º\",\n\t\"orv;\": \"⩛\",\n\tOuml: \"Ö\",\n\touml: \"ö\",\n\t\"par;\": \"∥\",\n\tpara: \"¶\",\n\t\"Pcy;\": \"П\",\n\t\"pcy;\": \"п\",\n\t\"Pfr;\": \"𝔓\",\n\t\"pfr;\": \"𝔭\",\n\t\"Phi;\": \"Φ\",\n\t\"phi;\": \"φ\",\n\t\"piv;\": \"ϖ\",\n\t\"prE;\": \"⪳\",\n\t\"pre;\": \"⪯\",\n\t\"Psi;\": \"Ψ\",\n\t\"psi;\": \"ψ\",\n\t\"Qfr;\": \"𝔔\",\n\t\"qfr;\": \"𝔮\",\n\tQUOT: \"\\\"\",\n\tquot: \"\\\"\",\n\t\"Rcy;\": \"Р\",\n\t\"rcy;\": \"р\",\n\t\"REG;\": \"®\",\n\t\"reg;\": \"®\",\n\t\"Rfr;\": \"ℜ\",\n\t\"rfr;\": \"𝔯\",\n\t\"Rho;\": \"Ρ\",\n\t\"rho;\": \"ρ\",\n\t\"rlm;\": \"‏\",\n\t\"Rsh;\": \"↱\",\n\t\"rsh;\": \"↱\",\n\t\"scE;\": \"⪴\",\n\t\"sce;\": \"⪰\",\n\t\"Scy;\": \"С\",\n\t\"scy;\": \"с\",\n\tsect: \"§\",\n\t\"Sfr;\": \"𝔖\",\n\t\"sfr;\": \"𝔰\",\n\t\"shy;\": \"­\",\n\t\"sim;\": \"∼\",\n\t\"smt;\": \"⪪\",\n\t\"sol;\": \"/\",\n\t\"squ;\": \"□\",\n\t\"Sub;\": \"⋐\",\n\t\"sub;\": \"⊂\",\n\t\"Sum;\": \"∑\",\n\t\"sum;\": \"∑\",\n\t\"Sup;\": \"⋑\",\n\t\"sup;\": \"⊃\",\n\tsup1: \"¹\",\n\tsup2: \"²\",\n\tsup3: \"³\",\n\t\"Tab;\": \"\\t\",\n\t\"Tau;\": \"Τ\",\n\t\"tau;\": \"τ\",\n\t\"Tcy;\": \"Т\",\n\t\"tcy;\": \"т\",\n\t\"Tfr;\": \"𝔗\",\n\t\"tfr;\": \"𝔱\",\n\t\"top;\": \"⊤\",\n\t\"Ucy;\": \"У\",\n\t\"ucy;\": \"у\",\n\t\"Ufr;\": \"𝔘\",\n\t\"ufr;\": \"𝔲\",\n\t\"uml;\": \"¨\",\n\tUuml: \"Ü\",\n\tuuml: \"ü\",\n\t\"Vcy;\": \"В\",\n\t\"vcy;\": \"в\",\n\t\"Vee;\": \"⋁\",\n\t\"vee;\": \"∨\",\n\t\"Vfr;\": \"𝔙\",\n\t\"vfr;\": \"𝔳\",\n\t\"Wfr;\": \"𝔚\",\n\t\"wfr;\": \"𝔴\",\n\t\"Xfr;\": \"𝔛\",\n\t\"xfr;\": \"𝔵\",\n\t\"Ycy;\": \"Ы\",\n\t\"ycy;\": \"ы\",\n\t\"yen;\": \"¥\",\n\t\"Yfr;\": \"𝔜\",\n\t\"yfr;\": \"𝔶\",\n\tyuml: \"ÿ\",\n\t\"Zcy;\": \"З\",\n\t\"zcy;\": \"з\",\n\t\"Zfr;\": \"ℨ\",\n\t\"zfr;\": \"𝔷\",\n\t\"zwj;\": \"‍\",\n\tAcirc: \"Â\",\n\tacirc: \"â\",\n\tacute: \"´\",\n\tAElig: \"Æ\",\n\taelig: \"æ\",\n\t\"andd;\": \"⩜\",\n\t\"andv;\": \"⩚\",\n\t\"ange;\": \"⦤\",\n\t\"Aopf;\": \"𝔸\",\n\t\"aopf;\": \"𝕒\",\n\t\"apid;\": \"≋\",\n\t\"apos;\": \"'\",\n\tAring: \"Å\",\n\taring: \"å\",\n\t\"Ascr;\": \"𝒜\",\n\t\"ascr;\": \"𝒶\",\n\t\"Auml;\": \"Ä\",\n\t\"auml;\": \"ä\",\n\t\"Barv;\": \"⫧\",\n\t\"bbrk;\": \"⎵\",\n\t\"Beta;\": \"Β\",\n\t\"beta;\": \"β\",\n\t\"beth;\": \"ℶ\",\n\t\"bNot;\": \"⫭\",\n\t\"bnot;\": \"⌐\",\n\t\"Bopf;\": \"𝔹\",\n\t\"bopf;\": \"𝕓\",\n\t\"boxH;\": \"═\",\n\t\"boxh;\": \"─\",\n\t\"boxV;\": \"║\",\n\t\"boxv;\": \"│\",\n\t\"Bscr;\": \"ℬ\",\n\t\"bscr;\": \"𝒷\",\n\t\"bsim;\": \"∽\",\n\t\"bsol;\": \"\\\\\",\n\t\"bull;\": \"•\",\n\t\"bump;\": \"≎\",\n\t\"caps;\": \"∩︀\",\n\t\"Cdot;\": \"Ċ\",\n\t\"cdot;\": \"ċ\",\n\tcedil: \"¸\",\n\t\"cent;\": \"¢\",\n\t\"CHcy;\": \"Ч\",\n\t\"chcy;\": \"ч\",\n\t\"circ;\": \"ˆ\",\n\t\"cirE;\": \"⧃\",\n\t\"cire;\": \"≗\",\n\t\"comp;\": \"∁\",\n\t\"cong;\": \"≅\",\n\t\"Copf;\": \"ℂ\",\n\t\"copf;\": \"𝕔\",\n\t\"COPY;\": \"©\",\n\t\"copy;\": \"©\",\n\t\"Cscr;\": \"𝒞\",\n\t\"cscr;\": \"𝒸\",\n\t\"csub;\": \"⫏\",\n\t\"csup;\": \"⫐\",\n\t\"cups;\": \"∪︀\",\n\t\"Darr;\": \"↡\",\n\t\"dArr;\": \"⇓\",\n\t\"darr;\": \"↓\",\n\t\"dash;\": \"‐\",\n\t\"dHar;\": \"⥥\",\n\t\"diam;\": \"⋄\",\n\t\"DJcy;\": \"Ђ\",\n\t\"djcy;\": \"ђ\",\n\t\"Dopf;\": \"𝔻\",\n\t\"dopf;\": \"𝕕\",\n\t\"Dscr;\": \"𝒟\",\n\t\"dscr;\": \"𝒹\",\n\t\"DScy;\": \"Ѕ\",\n\t\"dscy;\": \"ѕ\",\n\t\"dsol;\": \"⧶\",\n\t\"dtri;\": \"▿\",\n\t\"DZcy;\": \"Џ\",\n\t\"dzcy;\": \"џ\",\n\t\"ecir;\": \"≖\",\n\tEcirc: \"Ê\",\n\tecirc: \"ê\",\n\t\"Edot;\": \"Ė\",\n\t\"eDot;\": \"≑\",\n\t\"edot;\": \"ė\",\n\t\"emsp;\": \" \",\n\t\"ensp;\": \" \",\n\t\"Eopf;\": \"𝔼\",\n\t\"eopf;\": \"𝕖\",\n\t\"epar;\": \"⋕\",\n\t\"epsi;\": \"ε\",\n\t\"Escr;\": \"ℰ\",\n\t\"escr;\": \"ℯ\",\n\t\"Esim;\": \"⩳\",\n\t\"esim;\": \"≂\",\n\t\"Euml;\": \"Ë\",\n\t\"euml;\": \"ë\",\n\t\"euro;\": \"€\",\n\t\"excl;\": \"!\",\n\t\"flat;\": \"♭\",\n\t\"fnof;\": \"ƒ\",\n\t\"Fopf;\": \"𝔽\",\n\t\"fopf;\": \"𝕗\",\n\t\"fork;\": \"⋔\",\n\t\"Fscr;\": \"ℱ\",\n\t\"fscr;\": \"𝒻\",\n\t\"Gdot;\": \"Ġ\",\n\t\"gdot;\": \"ġ\",\n\t\"geqq;\": \"≧\",\n\t\"gesl;\": \"⋛︀\",\n\t\"GJcy;\": \"Ѓ\",\n\t\"gjcy;\": \"ѓ\",\n\t\"gnap;\": \"⪊\",\n\t\"gneq;\": \"⪈\",\n\t\"Gopf;\": \"𝔾\",\n\t\"gopf;\": \"𝕘\",\n\t\"Gscr;\": \"𝒢\",\n\t\"gscr;\": \"ℊ\",\n\t\"gsim;\": \"≳\",\n\t\"gtcc;\": \"⪧\",\n\t\"gvnE;\": \"≩︀\",\n\t\"half;\": \"½\",\n\t\"hArr;\": \"⇔\",\n\t\"harr;\": \"↔\",\n\t\"hbar;\": \"ℏ\",\n\t\"Hopf;\": \"ℍ\",\n\t\"hopf;\": \"𝕙\",\n\t\"Hscr;\": \"ℋ\",\n\t\"hscr;\": \"𝒽\",\n\tIcirc: \"Î\",\n\ticirc: \"î\",\n\t\"Idot;\": \"İ\",\n\t\"IEcy;\": \"Е\",\n\t\"iecy;\": \"е\",\n\tiexcl: \"¡\",\n\t\"imof;\": \"⊷\",\n\t\"IOcy;\": \"Ё\",\n\t\"iocy;\": \"ё\",\n\t\"Iopf;\": \"𝕀\",\n\t\"iopf;\": \"𝕚\",\n\t\"Iota;\": \"Ι\",\n\t\"iota;\": \"ι\",\n\t\"Iscr;\": \"ℐ\",\n\t\"iscr;\": \"𝒾\",\n\t\"isin;\": \"∈\",\n\t\"Iuml;\": \"Ï\",\n\t\"iuml;\": \"ï\",\n\t\"Jopf;\": \"𝕁\",\n\t\"jopf;\": \"𝕛\",\n\t\"Jscr;\": \"𝒥\",\n\t\"jscr;\": \"𝒿\",\n\t\"KHcy;\": \"Х\",\n\t\"khcy;\": \"х\",\n\t\"KJcy;\": \"Ќ\",\n\t\"kjcy;\": \"ќ\",\n\t\"Kopf;\": \"𝕂\",\n\t\"kopf;\": \"𝕜\",\n\t\"Kscr;\": \"𝒦\",\n\t\"kscr;\": \"𝓀\",\n\t\"Lang;\": \"⟪\",\n\t\"lang;\": \"⟨\",\n\tlaquo: \"«\",\n\t\"Larr;\": \"↞\",\n\t\"lArr;\": \"⇐\",\n\t\"larr;\": \"←\",\n\t\"late;\": \"⪭\",\n\t\"lcub;\": \"{\",\n\t\"ldca;\": \"⤶\",\n\t\"ldsh;\": \"↲\",\n\t\"leqq;\": \"≦\",\n\t\"lesg;\": \"⋚︀\",\n\t\"lHar;\": \"⥢\",\n\t\"LJcy;\": \"Љ\",\n\t\"ljcy;\": \"љ\",\n\t\"lnap;\": \"⪉\",\n\t\"lneq;\": \"⪇\",\n\t\"Lopf;\": \"𝕃\",\n\t\"lopf;\": \"𝕝\",\n\t\"lozf;\": \"⧫\",\n\t\"lpar;\": \"(\",\n\t\"Lscr;\": \"ℒ\",\n\t\"lscr;\": \"𝓁\",\n\t\"lsim;\": \"≲\",\n\t\"lsqb;\": \"[\",\n\t\"ltcc;\": \"⪦\",\n\t\"ltri;\": \"◃\",\n\t\"lvnE;\": \"≨︀\",\n\t\"macr;\": \"¯\",\n\t\"male;\": \"♂\",\n\t\"malt;\": \"✠\",\n\tmicro: \"µ\",\n\t\"mlcp;\": \"⫛\",\n\t\"mldr;\": \"…\",\n\t\"Mopf;\": \"𝕄\",\n\t\"mopf;\": \"𝕞\",\n\t\"Mscr;\": \"ℳ\",\n\t\"mscr;\": \"𝓂\",\n\t\"nang;\": \"∠⃒\",\n\t\"napE;\": \"⩰̸\",\n\t\"nbsp;\": \" \",\n\t\"ncap;\": \"⩃\",\n\t\"ncup;\": \"⩂\",\n\t\"ngeq;\": \"≱\",\n\t\"nges;\": \"⩾̸\",\n\t\"ngtr;\": \"≯\",\n\t\"nGtv;\": \"≫̸\",\n\t\"nisd;\": \"⋺\",\n\t\"NJcy;\": \"Њ\",\n\t\"njcy;\": \"њ\",\n\t\"nldr;\": \"‥\",\n\t\"nleq;\": \"≰\",\n\t\"nles;\": \"⩽̸\",\n\t\"nLtv;\": \"≪̸\",\n\t\"nmid;\": \"∤\",\n\t\"Nopf;\": \"ℕ\",\n\t\"nopf;\": \"𝕟\",\n\t\"npar;\": \"∦\",\n\t\"npre;\": \"⪯̸\",\n\t\"nsce;\": \"⪰̸\",\n\t\"Nscr;\": \"𝒩\",\n\t\"nscr;\": \"𝓃\",\n\t\"nsim;\": \"≁\",\n\t\"nsub;\": \"⊄\",\n\t\"nsup;\": \"⊅\",\n\t\"ntgl;\": \"≹\",\n\t\"ntlg;\": \"≸\",\n\t\"nvap;\": \"≍⃒\",\n\t\"nvge;\": \"≥⃒\",\n\t\"nvgt;\": \">⃒\",\n\t\"nvle;\": \"≤⃒\",\n\t\"nvlt;\": \"<⃒\",\n\t\"oast;\": \"⊛\",\n\t\"ocir;\": \"⊚\",\n\tOcirc: \"Ô\",\n\tocirc: \"ô\",\n\t\"odiv;\": \"⨸\",\n\t\"odot;\": \"⊙\",\n\t\"ogon;\": \"˛\",\n\t\"oint;\": \"∮\",\n\t\"omid;\": \"⦶\",\n\t\"Oopf;\": \"𝕆\",\n\t\"oopf;\": \"𝕠\",\n\t\"opar;\": \"⦷\",\n\t\"ordf;\": \"ª\",\n\t\"ordm;\": \"º\",\n\t\"oror;\": \"⩖\",\n\t\"Oscr;\": \"𝒪\",\n\t\"oscr;\": \"ℴ\",\n\t\"osol;\": \"⊘\",\n\t\"Ouml;\": \"Ö\",\n\t\"ouml;\": \"ö\",\n\t\"para;\": \"¶\",\n\t\"part;\": \"∂\",\n\t\"perp;\": \"⊥\",\n\t\"phiv;\": \"ϕ\",\n\t\"plus;\": \"+\",\n\t\"Popf;\": \"ℙ\",\n\t\"popf;\": \"𝕡\",\n\tpound: \"£\",\n\t\"prap;\": \"⪷\",\n\t\"prec;\": \"≺\",\n\t\"prnE;\": \"⪵\",\n\t\"prod;\": \"∏\",\n\t\"prop;\": \"∝\",\n\t\"Pscr;\": \"𝒫\",\n\t\"pscr;\": \"𝓅\",\n\t\"qint;\": \"⨌\",\n\t\"Qopf;\": \"ℚ\",\n\t\"qopf;\": \"𝕢\",\n\t\"Qscr;\": \"𝒬\",\n\t\"qscr;\": \"𝓆\",\n\t\"QUOT;\": \"\\\"\",\n\t\"quot;\": \"\\\"\",\n\t\"race;\": \"∽̱\",\n\t\"Rang;\": \"⟫\",\n\t\"rang;\": \"⟩\",\n\traquo: \"»\",\n\t\"Rarr;\": \"↠\",\n\t\"rArr;\": \"⇒\",\n\t\"rarr;\": \"→\",\n\t\"rcub;\": \"}\",\n\t\"rdca;\": \"⤷\",\n\t\"rdsh;\": \"↳\",\n\t\"real;\": \"ℜ\",\n\t\"rect;\": \"▭\",\n\t\"rHar;\": \"⥤\",\n\t\"rhov;\": \"ϱ\",\n\t\"ring;\": \"˚\",\n\t\"Ropf;\": \"ℝ\",\n\t\"ropf;\": \"𝕣\",\n\t\"rpar;\": \")\",\n\t\"Rscr;\": \"ℛ\",\n\t\"rscr;\": \"𝓇\",\n\t\"rsqb;\": \"]\",\n\t\"rtri;\": \"▹\",\n\t\"scap;\": \"⪸\",\n\t\"scnE;\": \"⪶\",\n\t\"sdot;\": \"⋅\",\n\t\"sect;\": \"§\",\n\t\"semi;\": \";\",\n\t\"sext;\": \"✶\",\n\t\"SHcy;\": \"Ш\",\n\t\"shcy;\": \"ш\",\n\t\"sime;\": \"≃\",\n\t\"simg;\": \"⪞\",\n\t\"siml;\": \"⪝\",\n\t\"smid;\": \"∣\",\n\t\"smte;\": \"⪬\",\n\t\"solb;\": \"⧄\",\n\t\"Sopf;\": \"𝕊\",\n\t\"sopf;\": \"𝕤\",\n\t\"spar;\": \"∥\",\n\t\"Sqrt;\": \"√\",\n\t\"squf;\": \"▪\",\n\t\"Sscr;\": \"𝒮\",\n\t\"sscr;\": \"𝓈\",\n\t\"Star;\": \"⋆\",\n\t\"star;\": \"☆\",\n\t\"subE;\": \"⫅\",\n\t\"sube;\": \"⊆\",\n\t\"succ;\": \"≻\",\n\t\"sung;\": \"♪\",\n\t\"sup1;\": \"¹\",\n\t\"sup2;\": \"²\",\n\t\"sup3;\": \"³\",\n\t\"supE;\": \"⫆\",\n\t\"supe;\": \"⊇\",\n\tszlig: \"ß\",\n\t\"tbrk;\": \"⎴\",\n\t\"tdot;\": \"⃛\",\n\tTHORN: \"Þ\",\n\tthorn: \"þ\",\n\ttimes: \"×\",\n\t\"tint;\": \"∭\",\n\t\"toea;\": \"⤨\",\n\t\"Topf;\": \"𝕋\",\n\t\"topf;\": \"𝕥\",\n\t\"tosa;\": \"⤩\",\n\t\"trie;\": \"≜\",\n\t\"Tscr;\": \"𝒯\",\n\t\"tscr;\": \"𝓉\",\n\t\"TScy;\": \"Ц\",\n\t\"tscy;\": \"ц\",\n\t\"Uarr;\": \"↟\",\n\t\"uArr;\": \"⇑\",\n\t\"uarr;\": \"↑\",\n\tUcirc: \"Û\",\n\tucirc: \"û\",\n\t\"uHar;\": \"⥣\",\n\t\"Uopf;\": \"𝕌\",\n\t\"uopf;\": \"𝕦\",\n\t\"Upsi;\": \"ϒ\",\n\t\"upsi;\": \"υ\",\n\t\"Uscr;\": \"𝒰\",\n\t\"uscr;\": \"𝓊\",\n\t\"utri;\": \"▵\",\n\t\"Uuml;\": \"Ü\",\n\t\"uuml;\": \"ü\",\n\t\"vArr;\": \"⇕\",\n\t\"varr;\": \"↕\",\n\t\"Vbar;\": \"⫫\",\n\t\"vBar;\": \"⫨\",\n\t\"Vert;\": \"‖\",\n\t\"vert;\": \"|\",\n\t\"Vopf;\": \"𝕍\",\n\t\"vopf;\": \"𝕧\",\n\t\"Vscr;\": \"𝒱\",\n\t\"vscr;\": \"𝓋\",\n\t\"Wopf;\": \"𝕎\",\n\t\"wopf;\": \"𝕨\",\n\t\"Wscr;\": \"𝒲\",\n\t\"wscr;\": \"𝓌\",\n\t\"xcap;\": \"⋂\",\n\t\"xcup;\": \"⋃\",\n\t\"xmap;\": \"⟼\",\n\t\"xnis;\": \"⋻\",\n\t\"Xopf;\": \"𝕏\",\n\t\"xopf;\": \"𝕩\",\n\t\"Xscr;\": \"𝒳\",\n\t\"xscr;\": \"𝓍\",\n\t\"xvee;\": \"⋁\",\n\t\"YAcy;\": \"Я\",\n\t\"yacy;\": \"я\",\n\t\"YIcy;\": \"Ї\",\n\t\"yicy;\": \"ї\",\n\t\"Yopf;\": \"𝕐\",\n\t\"yopf;\": \"𝕪\",\n\t\"Yscr;\": \"𝒴\",\n\t\"yscr;\": \"𝓎\",\n\t\"YUcy;\": \"Ю\",\n\t\"yucy;\": \"ю\",\n\t\"Yuml;\": \"Ÿ\",\n\t\"yuml;\": \"ÿ\",\n\t\"Zdot;\": \"Ż\",\n\t\"zdot;\": \"ż\",\n\t\"Zeta;\": \"Ζ\",\n\t\"zeta;\": \"ζ\",\n\t\"ZHcy;\": \"Ж\",\n\t\"zhcy;\": \"ж\",\n\t\"Zopf;\": \"ℤ\",\n\t\"zopf;\": \"𝕫\",\n\t\"Zscr;\": \"𝒵\",\n\t\"zscr;\": \"𝓏\",\n\t\"zwnj;\": \"‌\",\n\tAacute: \"Á\",\n\taacute: \"á\",\n\t\"Acirc;\": \"Â\",\n\t\"acirc;\": \"â\",\n\t\"acute;\": \"´\",\n\t\"AElig;\": \"Æ\",\n\t\"aelig;\": \"æ\",\n\tAgrave: \"À\",\n\tagrave: \"à\",\n\t\"aleph;\": \"ℵ\",\n\t\"Alpha;\": \"Α\",\n\t\"alpha;\": \"α\",\n\t\"Amacr;\": \"Ā\",\n\t\"amacr;\": \"ā\",\n\t\"amalg;\": \"⨿\",\n\t\"angle;\": \"∠\",\n\t\"angrt;\": \"∟\",\n\t\"angst;\": \"Å\",\n\t\"Aogon;\": \"Ą\",\n\t\"aogon;\": \"ą\",\n\t\"Aring;\": \"Å\",\n\t\"aring;\": \"å\",\n\t\"asymp;\": \"≈\",\n\tAtilde: \"Ã\",\n\tatilde: \"ã\",\n\t\"awint;\": \"⨑\",\n\t\"bcong;\": \"≌\",\n\t\"bdquo;\": \"„\",\n\t\"bepsi;\": \"϶\",\n\t\"blank;\": \"␣\",\n\t\"blk12;\": \"▒\",\n\t\"blk14;\": \"░\",\n\t\"blk34;\": \"▓\",\n\t\"block;\": \"█\",\n\t\"boxDL;\": \"╗\",\n\t\"boxDl;\": \"╖\",\n\t\"boxdL;\": \"╕\",\n\t\"boxdl;\": \"┐\",\n\t\"boxDR;\": \"╔\",\n\t\"boxDr;\": \"╓\",\n\t\"boxdR;\": \"╒\",\n\t\"boxdr;\": \"┌\",\n\t\"boxHD;\": \"╦\",\n\t\"boxHd;\": \"╤\",\n\t\"boxhD;\": \"╥\",\n\t\"boxhd;\": \"┬\",\n\t\"boxHU;\": \"╩\",\n\t\"boxHu;\": \"╧\",\n\t\"boxhU;\": \"╨\",\n\t\"boxhu;\": \"┴\",\n\t\"boxUL;\": \"╝\",\n\t\"boxUl;\": \"╜\",\n\t\"boxuL;\": \"╛\",\n\t\"boxul;\": \"┘\",\n\t\"boxUR;\": \"╚\",\n\t\"boxUr;\": \"╙\",\n\t\"boxuR;\": \"╘\",\n\t\"boxur;\": \"└\",\n\t\"boxVH;\": \"╬\",\n\t\"boxVh;\": \"╫\",\n\t\"boxvH;\": \"╪\",\n\t\"boxvh;\": \"┼\",\n\t\"boxVL;\": \"╣\",\n\t\"boxVl;\": \"╢\",\n\t\"boxvL;\": \"╡\",\n\t\"boxvl;\": \"┤\",\n\t\"boxVR;\": \"╠\",\n\t\"boxVr;\": \"╟\",\n\t\"boxvR;\": \"╞\",\n\t\"boxvr;\": \"├\",\n\t\"Breve;\": \"˘\",\n\t\"breve;\": \"˘\",\n\tbrvbar: \"¦\",\n\t\"bsemi;\": \"⁏\",\n\t\"bsime;\": \"⋍\",\n\t\"bsolb;\": \"⧅\",\n\t\"bumpE;\": \"⪮\",\n\t\"bumpe;\": \"≏\",\n\t\"caret;\": \"⁁\",\n\t\"caron;\": \"ˇ\",\n\t\"ccaps;\": \"⩍\",\n\tCcedil: \"Ç\",\n\tccedil: \"ç\",\n\t\"Ccirc;\": \"Ĉ\",\n\t\"ccirc;\": \"ĉ\",\n\t\"ccups;\": \"⩌\",\n\t\"cedil;\": \"¸\",\n\t\"check;\": \"✓\",\n\t\"clubs;\": \"♣\",\n\t\"Colon;\": \"∷\",\n\t\"colon;\": \":\",\n\t\"comma;\": \",\",\n\t\"crarr;\": \"↵\",\n\t\"Cross;\": \"⨯\",\n\t\"cross;\": \"✗\",\n\t\"csube;\": \"⫑\",\n\t\"csupe;\": \"⫒\",\n\t\"ctdot;\": \"⋯\",\n\t\"cuepr;\": \"⋞\",\n\t\"cuesc;\": \"⋟\",\n\t\"cupor;\": \"⩅\",\n\tcurren: \"¤\",\n\t\"cuvee;\": \"⋎\",\n\t\"cuwed;\": \"⋏\",\n\t\"cwint;\": \"∱\",\n\t\"Dashv;\": \"⫤\",\n\t\"dashv;\": \"⊣\",\n\t\"dblac;\": \"˝\",\n\t\"ddarr;\": \"⇊\",\n\t\"Delta;\": \"Δ\",\n\t\"delta;\": \"δ\",\n\t\"dharl;\": \"⇃\",\n\t\"dharr;\": \"⇂\",\n\t\"diams;\": \"♦\",\n\t\"disin;\": \"⋲\",\n\tdivide: \"÷\",\n\t\"doteq;\": \"≐\",\n\t\"dtdot;\": \"⋱\",\n\t\"dtrif;\": \"▾\",\n\t\"duarr;\": \"⇵\",\n\t\"duhar;\": \"⥯\",\n\tEacute: \"É\",\n\teacute: \"é\",\n\t\"Ecirc;\": \"Ê\",\n\t\"ecirc;\": \"ê\",\n\t\"eDDot;\": \"⩷\",\n\t\"efDot;\": \"≒\",\n\tEgrave: \"È\",\n\tegrave: \"è\",\n\t\"Emacr;\": \"Ē\",\n\t\"emacr;\": \"ē\",\n\t\"empty;\": \"∅\",\n\t\"Eogon;\": \"Ę\",\n\t\"eogon;\": \"ę\",\n\t\"eplus;\": \"⩱\",\n\t\"epsiv;\": \"ϵ\",\n\t\"eqsim;\": \"≂\",\n\t\"Equal;\": \"⩵\",\n\t\"equiv;\": \"≡\",\n\t\"erarr;\": \"⥱\",\n\t\"erDot;\": \"≓\",\n\t\"esdot;\": \"≐\",\n\t\"exist;\": \"∃\",\n\t\"fflig;\": \"ff\",\n\t\"filig;\": \"fi\",\n\t\"fjlig;\": \"fj\",\n\t\"fllig;\": \"fl\",\n\t\"fltns;\": \"▱\",\n\t\"forkv;\": \"⫙\",\n\tfrac12: \"½\",\n\tfrac14: \"¼\",\n\tfrac34: \"¾\",\n\t\"frasl;\": \"⁄\",\n\t\"frown;\": \"⌢\",\n\t\"Gamma;\": \"Γ\",\n\t\"gamma;\": \"γ\",\n\t\"Gcirc;\": \"Ĝ\",\n\t\"gcirc;\": \"ĝ\",\n\t\"gescc;\": \"⪩\",\n\t\"gimel;\": \"ℷ\",\n\t\"gneqq;\": \"≩\",\n\t\"gnsim;\": \"⋧\",\n\t\"grave;\": \"`\",\n\t\"gsime;\": \"⪎\",\n\t\"gsiml;\": \"⪐\",\n\t\"gtcir;\": \"⩺\",\n\t\"gtdot;\": \"⋗\",\n\t\"Hacek;\": \"ˇ\",\n\t\"harrw;\": \"↭\",\n\t\"Hcirc;\": \"Ĥ\",\n\t\"hcirc;\": \"ĥ\",\n\t\"hoarr;\": \"⇿\",\n\tIacute: \"Í\",\n\tiacute: \"í\",\n\t\"Icirc;\": \"Î\",\n\t\"icirc;\": \"î\",\n\t\"iexcl;\": \"¡\",\n\tIgrave: \"Ì\",\n\tigrave: \"ì\",\n\t\"iiint;\": \"∭\",\n\t\"iiota;\": \"℩\",\n\t\"IJlig;\": \"IJ\",\n\t\"ijlig;\": \"ij\",\n\t\"Imacr;\": \"Ī\",\n\t\"imacr;\": \"ī\",\n\t\"image;\": \"ℑ\",\n\t\"imath;\": \"ı\",\n\t\"imped;\": \"Ƶ\",\n\t\"infin;\": \"∞\",\n\t\"Iogon;\": \"Į\",\n\t\"iogon;\": \"į\",\n\t\"iprod;\": \"⨼\",\n\tiquest: \"¿\",\n\t\"isinE;\": \"⋹\",\n\t\"isins;\": \"⋴\",\n\t\"isinv;\": \"∈\",\n\t\"Iukcy;\": \"І\",\n\t\"iukcy;\": \"і\",\n\t\"Jcirc;\": \"Ĵ\",\n\t\"jcirc;\": \"ĵ\",\n\t\"jmath;\": \"ȷ\",\n\t\"Jukcy;\": \"Є\",\n\t\"jukcy;\": \"є\",\n\t\"Kappa;\": \"Κ\",\n\t\"kappa;\": \"κ\",\n\t\"lAarr;\": \"⇚\",\n\t\"langd;\": \"⦑\",\n\t\"laquo;\": \"«\",\n\t\"larrb;\": \"⇤\",\n\t\"lates;\": \"⪭︀\",\n\t\"lBarr;\": \"⤎\",\n\t\"lbarr;\": \"⤌\",\n\t\"lbbrk;\": \"❲\",\n\t\"lbrke;\": \"⦋\",\n\t\"lceil;\": \"⌈\",\n\t\"ldquo;\": \"“\",\n\t\"lescc;\": \"⪨\",\n\t\"lhard;\": \"↽\",\n\t\"lharu;\": \"↼\",\n\t\"lhblk;\": \"▄\",\n\t\"llarr;\": \"⇇\",\n\t\"lltri;\": \"◺\",\n\t\"lneqq;\": \"≨\",\n\t\"lnsim;\": \"⋦\",\n\t\"loang;\": \"⟬\",\n\t\"loarr;\": \"⇽\",\n\t\"lobrk;\": \"⟦\",\n\t\"lopar;\": \"⦅\",\n\t\"lrarr;\": \"⇆\",\n\t\"lrhar;\": \"⇋\",\n\t\"lrtri;\": \"⊿\",\n\t\"lsime;\": \"⪍\",\n\t\"lsimg;\": \"⪏\",\n\t\"lsquo;\": \"‘\",\n\t\"ltcir;\": \"⩹\",\n\t\"ltdot;\": \"⋖\",\n\t\"ltrie;\": \"⊴\",\n\t\"ltrif;\": \"◂\",\n\t\"mdash;\": \"—\",\n\t\"mDDot;\": \"∺\",\n\t\"micro;\": \"µ\",\n\tmiddot: \"·\",\n\t\"minus;\": \"−\",\n\t\"mumap;\": \"⊸\",\n\t\"nabla;\": \"∇\",\n\t\"napid;\": \"≋̸\",\n\t\"napos;\": \"ʼn\",\n\t\"natur;\": \"♮\",\n\t\"nbump;\": \"≎̸\",\n\t\"ncong;\": \"≇\",\n\t\"ndash;\": \"–\",\n\t\"neArr;\": \"⇗\",\n\t\"nearr;\": \"↗\",\n\t\"nedot;\": \"≐̸\",\n\t\"nesim;\": \"≂̸\",\n\t\"ngeqq;\": \"≧̸\",\n\t\"ngsim;\": \"≵\",\n\t\"nhArr;\": \"⇎\",\n\t\"nharr;\": \"↮\",\n\t\"nhpar;\": \"⫲\",\n\t\"nlArr;\": \"⇍\",\n\t\"nlarr;\": \"↚\",\n\t\"nleqq;\": \"≦̸\",\n\t\"nless;\": \"≮\",\n\t\"nlsim;\": \"≴\",\n\t\"nltri;\": \"⋪\",\n\t\"notin;\": \"∉\",\n\t\"notni;\": \"∌\",\n\t\"npart;\": \"∂̸\",\n\t\"nprec;\": \"⊀\",\n\t\"nrArr;\": \"⇏\",\n\t\"nrarr;\": \"↛\",\n\t\"nrtri;\": \"⋫\",\n\t\"nsime;\": \"≄\",\n\t\"nsmid;\": \"∤\",\n\t\"nspar;\": \"∦\",\n\t\"nsubE;\": \"⫅̸\",\n\t\"nsube;\": \"⊈\",\n\t\"nsucc;\": \"⊁\",\n\t\"nsupE;\": \"⫆̸\",\n\t\"nsupe;\": \"⊉\",\n\tNtilde: \"Ñ\",\n\tntilde: \"ñ\",\n\t\"numsp;\": \" \",\n\t\"nvsim;\": \"∼⃒\",\n\t\"nwArr;\": \"⇖\",\n\t\"nwarr;\": \"↖\",\n\tOacute: \"Ó\",\n\toacute: \"ó\",\n\t\"Ocirc;\": \"Ô\",\n\t\"ocirc;\": \"ô\",\n\t\"odash;\": \"⊝\",\n\t\"OElig;\": \"Œ\",\n\t\"oelig;\": \"œ\",\n\t\"ofcir;\": \"⦿\",\n\tOgrave: \"Ò\",\n\tograve: \"ò\",\n\t\"ohbar;\": \"⦵\",\n\t\"olarr;\": \"↺\",\n\t\"olcir;\": \"⦾\",\n\t\"oline;\": \"‾\",\n\t\"Omacr;\": \"Ō\",\n\t\"omacr;\": \"ō\",\n\t\"Omega;\": \"Ω\",\n\t\"omega;\": \"ω\",\n\t\"operp;\": \"⦹\",\n\t\"oplus;\": \"⊕\",\n\t\"orarr;\": \"↻\",\n\t\"order;\": \"ℴ\",\n\tOslash: \"Ø\",\n\toslash: \"ø\",\n\tOtilde: \"Õ\",\n\totilde: \"õ\",\n\t\"ovbar;\": \"⌽\",\n\t\"parsl;\": \"⫽\",\n\t\"phone;\": \"☎\",\n\t\"plusb;\": \"⊞\",\n\t\"pluse;\": \"⩲\",\n\tplusmn: \"±\",\n\t\"pound;\": \"£\",\n\t\"prcue;\": \"≼\",\n\t\"Prime;\": \"″\",\n\t\"prime;\": \"′\",\n\t\"prnap;\": \"⪹\",\n\t\"prsim;\": \"≾\",\n\t\"quest;\": \"?\",\n\t\"rAarr;\": \"⇛\",\n\t\"radic;\": \"√\",\n\t\"rangd;\": \"⦒\",\n\t\"range;\": \"⦥\",\n\t\"raquo;\": \"»\",\n\t\"rarrb;\": \"⇥\",\n\t\"rarrc;\": \"⤳\",\n\t\"rarrw;\": \"↝\",\n\t\"ratio;\": \"∶\",\n\t\"RBarr;\": \"⤐\",\n\t\"rBarr;\": \"⤏\",\n\t\"rbarr;\": \"⤍\",\n\t\"rbbrk;\": \"❳\",\n\t\"rbrke;\": \"⦌\",\n\t\"rceil;\": \"⌉\",\n\t\"rdquo;\": \"”\",\n\t\"reals;\": \"ℝ\",\n\t\"rhard;\": \"⇁\",\n\t\"rharu;\": \"⇀\",\n\t\"rlarr;\": \"⇄\",\n\t\"rlhar;\": \"⇌\",\n\t\"rnmid;\": \"⫮\",\n\t\"roang;\": \"⟭\",\n\t\"roarr;\": \"⇾\",\n\t\"robrk;\": \"⟧\",\n\t\"ropar;\": \"⦆\",\n\t\"rrarr;\": \"⇉\",\n\t\"rsquo;\": \"’\",\n\t\"rtrie;\": \"⊵\",\n\t\"rtrif;\": \"▸\",\n\t\"sbquo;\": \"‚\",\n\t\"sccue;\": \"≽\",\n\t\"Scirc;\": \"Ŝ\",\n\t\"scirc;\": \"ŝ\",\n\t\"scnap;\": \"⪺\",\n\t\"scsim;\": \"≿\",\n\t\"sdotb;\": \"⊡\",\n\t\"sdote;\": \"⩦\",\n\t\"seArr;\": \"⇘\",\n\t\"searr;\": \"↘\",\n\t\"setmn;\": \"∖\",\n\t\"sharp;\": \"♯\",\n\t\"Sigma;\": \"Σ\",\n\t\"sigma;\": \"σ\",\n\t\"simeq;\": \"≃\",\n\t\"simgE;\": \"⪠\",\n\t\"simlE;\": \"⪟\",\n\t\"simne;\": \"≆\",\n\t\"slarr;\": \"←\",\n\t\"smile;\": \"⌣\",\n\t\"smtes;\": \"⪬︀\",\n\t\"sqcap;\": \"⊓\",\n\t\"sqcup;\": \"⊔\",\n\t\"sqsub;\": \"⊏\",\n\t\"sqsup;\": \"⊐\",\n\t\"srarr;\": \"→\",\n\t\"starf;\": \"★\",\n\t\"strns;\": \"¯\",\n\t\"subnE;\": \"⫋\",\n\t\"subne;\": \"⊊\",\n\t\"supnE;\": \"⫌\",\n\t\"supne;\": \"⊋\",\n\t\"swArr;\": \"⇙\",\n\t\"swarr;\": \"↙\",\n\t\"szlig;\": \"ß\",\n\t\"Theta;\": \"Θ\",\n\t\"theta;\": \"θ\",\n\t\"thkap;\": \"≈\",\n\t\"THORN;\": \"Þ\",\n\t\"thorn;\": \"þ\",\n\t\"Tilde;\": \"∼\",\n\t\"tilde;\": \"˜\",\n\t\"times;\": \"×\",\n\t\"TRADE;\": \"™\",\n\t\"trade;\": \"™\",\n\t\"trisb;\": \"⧍\",\n\t\"TSHcy;\": \"Ћ\",\n\t\"tshcy;\": \"ћ\",\n\t\"twixt;\": \"≬\",\n\tUacute: \"Ú\",\n\tuacute: \"ú\",\n\t\"Ubrcy;\": \"Ў\",\n\t\"ubrcy;\": \"ў\",\n\t\"Ucirc;\": \"Û\",\n\t\"ucirc;\": \"û\",\n\t\"udarr;\": \"⇅\",\n\t\"udhar;\": \"⥮\",\n\tUgrave: \"Ù\",\n\tugrave: \"ù\",\n\t\"uharl;\": \"↿\",\n\t\"uharr;\": \"↾\",\n\t\"uhblk;\": \"▀\",\n\t\"ultri;\": \"◸\",\n\t\"Umacr;\": \"Ū\",\n\t\"umacr;\": \"ū\",\n\t\"Union;\": \"⋃\",\n\t\"Uogon;\": \"Ų\",\n\t\"uogon;\": \"ų\",\n\t\"uplus;\": \"⊎\",\n\t\"upsih;\": \"ϒ\",\n\t\"UpTee;\": \"⊥\",\n\t\"Uring;\": \"Ů\",\n\t\"uring;\": \"ů\",\n\t\"urtri;\": \"◹\",\n\t\"utdot;\": \"⋰\",\n\t\"utrif;\": \"▴\",\n\t\"uuarr;\": \"⇈\",\n\t\"varpi;\": \"ϖ\",\n\t\"vBarv;\": \"⫩\",\n\t\"VDash;\": \"⊫\",\n\t\"Vdash;\": \"⊩\",\n\t\"vDash;\": \"⊨\",\n\t\"vdash;\": \"⊢\",\n\t\"veeeq;\": \"≚\",\n\t\"vltri;\": \"⊲\",\n\t\"vnsub;\": \"⊂⃒\",\n\t\"vnsup;\": \"⊃⃒\",\n\t\"vprop;\": \"∝\",\n\t\"vrtri;\": \"⊳\",\n\t\"Wcirc;\": \"Ŵ\",\n\t\"wcirc;\": \"ŵ\",\n\t\"Wedge;\": \"⋀\",\n\t\"wedge;\": \"∧\",\n\t\"xcirc;\": \"◯\",\n\t\"xdtri;\": \"▽\",\n\t\"xhArr;\": \"⟺\",\n\t\"xharr;\": \"⟷\",\n\t\"xlArr;\": \"⟸\",\n\t\"xlarr;\": \"⟵\",\n\t\"xodot;\": \"⨀\",\n\t\"xrArr;\": \"⟹\",\n\t\"xrarr;\": \"⟶\",\n\t\"xutri;\": \"△\",\n\tYacute: \"Ý\",\n\tyacute: \"ý\",\n\t\"Ycirc;\": \"Ŷ\",\n\t\"ycirc;\": \"ŷ\",\n\t\"Aacute;\": \"Á\",\n\t\"aacute;\": \"á\",\n\t\"Abreve;\": \"Ă\",\n\t\"abreve;\": \"ă\",\n\t\"Agrave;\": \"À\",\n\t\"agrave;\": \"à\",\n\t\"andand;\": \"⩕\",\n\t\"angmsd;\": \"∡\",\n\t\"angsph;\": \"∢\",\n\t\"apacir;\": \"⩯\",\n\t\"approx;\": \"≈\",\n\t\"Assign;\": \"≔\",\n\t\"Atilde;\": \"Ã\",\n\t\"atilde;\": \"ã\",\n\t\"barvee;\": \"⊽\",\n\t\"Barwed;\": \"⌆\",\n\t\"barwed;\": \"⌅\",\n\t\"becaus;\": \"∵\",\n\t\"bernou;\": \"ℬ\",\n\t\"bigcap;\": \"⋂\",\n\t\"bigcup;\": \"⋃\",\n\t\"bigvee;\": \"⋁\",\n\t\"bkarow;\": \"⤍\",\n\t\"bottom;\": \"⊥\",\n\t\"bowtie;\": \"⋈\",\n\t\"boxbox;\": \"⧉\",\n\t\"bprime;\": \"‵\",\n\t\"brvbar;\": \"¦\",\n\t\"bullet;\": \"•\",\n\t\"Bumpeq;\": \"≎\",\n\t\"bumpeq;\": \"≏\",\n\t\"Cacute;\": \"Ć\",\n\t\"cacute;\": \"ć\",\n\t\"capand;\": \"⩄\",\n\t\"capcap;\": \"⩋\",\n\t\"capcup;\": \"⩇\",\n\t\"capdot;\": \"⩀\",\n\t\"Ccaron;\": \"Č\",\n\t\"ccaron;\": \"č\",\n\t\"Ccedil;\": \"Ç\",\n\t\"ccedil;\": \"ç\",\n\t\"circeq;\": \"≗\",\n\t\"cirmid;\": \"⫯\",\n\t\"Colone;\": \"⩴\",\n\t\"colone;\": \"≔\",\n\t\"commat;\": \"@\",\n\t\"compfn;\": \"∘\",\n\t\"Conint;\": \"∯\",\n\t\"conint;\": \"∮\",\n\t\"coprod;\": \"∐\",\n\t\"copysr;\": \"℗\",\n\t\"cularr;\": \"↶\",\n\t\"CupCap;\": \"≍\",\n\t\"cupcap;\": \"⩆\",\n\t\"cupcup;\": \"⩊\",\n\t\"cupdot;\": \"⊍\",\n\t\"curarr;\": \"↷\",\n\t\"curren;\": \"¤\",\n\t\"cylcty;\": \"⌭\",\n\t\"Dagger;\": \"‡\",\n\t\"dagger;\": \"†\",\n\t\"daleth;\": \"ℸ\",\n\t\"Dcaron;\": \"Ď\",\n\t\"dcaron;\": \"ď\",\n\t\"dfisht;\": \"⥿\",\n\t\"divide;\": \"÷\",\n\t\"divonx;\": \"⋇\",\n\t\"dlcorn;\": \"⌞\",\n\t\"dlcrop;\": \"⌍\",\n\t\"dollar;\": \"$\",\n\t\"DotDot;\": \"⃜\",\n\t\"drcorn;\": \"⌟\",\n\t\"drcrop;\": \"⌌\",\n\t\"Dstrok;\": \"Đ\",\n\t\"dstrok;\": \"đ\",\n\t\"Eacute;\": \"É\",\n\t\"eacute;\": \"é\",\n\t\"easter;\": \"⩮\",\n\t\"Ecaron;\": \"Ě\",\n\t\"ecaron;\": \"ě\",\n\t\"ecolon;\": \"≕\",\n\t\"Egrave;\": \"È\",\n\t\"egrave;\": \"è\",\n\t\"egsdot;\": \"⪘\",\n\t\"elsdot;\": \"⪗\",\n\t\"emptyv;\": \"∅\",\n\t\"emsp13;\": \" \",\n\t\"emsp14;\": \" \",\n\t\"eparsl;\": \"⧣\",\n\t\"eqcirc;\": \"≖\",\n\t\"equals;\": \"=\",\n\t\"equest;\": \"≟\",\n\t\"Exists;\": \"∃\",\n\t\"female;\": \"♀\",\n\t\"ffilig;\": \"ffi\",\n\t\"ffllig;\": \"ffl\",\n\t\"ForAll;\": \"∀\",\n\t\"forall;\": \"∀\",\n\t\"frac12;\": \"½\",\n\t\"frac13;\": \"⅓\",\n\t\"frac14;\": \"¼\",\n\t\"frac15;\": \"⅕\",\n\t\"frac16;\": \"⅙\",\n\t\"frac18;\": \"⅛\",\n\t\"frac23;\": \"⅔\",\n\t\"frac25;\": \"⅖\",\n\t\"frac34;\": \"¾\",\n\t\"frac35;\": \"⅗\",\n\t\"frac38;\": \"⅜\",\n\t\"frac45;\": \"⅘\",\n\t\"frac56;\": \"⅚\",\n\t\"frac58;\": \"⅝\",\n\t\"frac78;\": \"⅞\",\n\t\"gacute;\": \"ǵ\",\n\t\"Gammad;\": \"Ϝ\",\n\t\"gammad;\": \"ϝ\",\n\t\"Gbreve;\": \"Ğ\",\n\t\"gbreve;\": \"ğ\",\n\t\"Gcedil;\": \"Ģ\",\n\t\"gesdot;\": \"⪀\",\n\t\"gesles;\": \"⪔\",\n\t\"gtlPar;\": \"⦕\",\n\t\"gtrarr;\": \"⥸\",\n\t\"gtrdot;\": \"⋗\",\n\t\"gtrsim;\": \"≳\",\n\t\"hairsp;\": \" \",\n\t\"hamilt;\": \"ℋ\",\n\t\"HARDcy;\": \"Ъ\",\n\t\"hardcy;\": \"ъ\",\n\t\"hearts;\": \"♥\",\n\t\"hellip;\": \"…\",\n\t\"hercon;\": \"⊹\",\n\t\"homtht;\": \"∻\",\n\t\"horbar;\": \"―\",\n\t\"hslash;\": \"ℏ\",\n\t\"Hstrok;\": \"Ħ\",\n\t\"hstrok;\": \"ħ\",\n\t\"hybull;\": \"⁃\",\n\t\"hyphen;\": \"‐\",\n\t\"Iacute;\": \"Í\",\n\t\"iacute;\": \"í\",\n\t\"Igrave;\": \"Ì\",\n\t\"igrave;\": \"ì\",\n\t\"iiiint;\": \"⨌\",\n\t\"iinfin;\": \"⧜\",\n\t\"incare;\": \"℅\",\n\t\"inodot;\": \"ı\",\n\t\"intcal;\": \"⊺\",\n\t\"iquest;\": \"¿\",\n\t\"isinsv;\": \"⋳\",\n\t\"Itilde;\": \"Ĩ\",\n\t\"itilde;\": \"ĩ\",\n\t\"Jsercy;\": \"Ј\",\n\t\"jsercy;\": \"ј\",\n\t\"kappav;\": \"ϰ\",\n\t\"Kcedil;\": \"Ķ\",\n\t\"kcedil;\": \"ķ\",\n\t\"kgreen;\": \"ĸ\",\n\t\"Lacute;\": \"Ĺ\",\n\t\"lacute;\": \"ĺ\",\n\t\"lagran;\": \"ℒ\",\n\t\"Lambda;\": \"Λ\",\n\t\"lambda;\": \"λ\",\n\t\"langle;\": \"⟨\",\n\t\"larrfs;\": \"⤝\",\n\t\"larrhk;\": \"↩\",\n\t\"larrlp;\": \"↫\",\n\t\"larrpl;\": \"⤹\",\n\t\"larrtl;\": \"↢\",\n\t\"lAtail;\": \"⤛\",\n\t\"latail;\": \"⤙\",\n\t\"lbrace;\": \"{\",\n\t\"lbrack;\": \"[\",\n\t\"Lcaron;\": \"Ľ\",\n\t\"lcaron;\": \"ľ\",\n\t\"Lcedil;\": \"Ļ\",\n\t\"lcedil;\": \"ļ\",\n\t\"ldquor;\": \"„\",\n\t\"lesdot;\": \"⩿\",\n\t\"lesges;\": \"⪓\",\n\t\"lfisht;\": \"⥼\",\n\t\"lfloor;\": \"⌊\",\n\t\"lharul;\": \"⥪\",\n\t\"llhard;\": \"⥫\",\n\t\"Lmidot;\": \"Ŀ\",\n\t\"lmidot;\": \"ŀ\",\n\t\"lmoust;\": \"⎰\",\n\t\"loplus;\": \"⨭\",\n\t\"lowast;\": \"∗\",\n\t\"lowbar;\": \"_\",\n\t\"lparlt;\": \"⦓\",\n\t\"lrhard;\": \"⥭\",\n\t\"lsaquo;\": \"‹\",\n\t\"lsquor;\": \"‚\",\n\t\"Lstrok;\": \"Ł\",\n\t\"lstrok;\": \"ł\",\n\t\"lthree;\": \"⋋\",\n\t\"ltimes;\": \"⋉\",\n\t\"ltlarr;\": \"⥶\",\n\t\"ltrPar;\": \"⦖\",\n\t\"mapsto;\": \"↦\",\n\t\"marker;\": \"▮\",\n\t\"mcomma;\": \"⨩\",\n\t\"midast;\": \"*\",\n\t\"midcir;\": \"⫰\",\n\t\"middot;\": \"·\",\n\t\"minusb;\": \"⊟\",\n\t\"minusd;\": \"∸\",\n\t\"mnplus;\": \"∓\",\n\t\"models;\": \"⊧\",\n\t\"mstpos;\": \"∾\",\n\t\"Nacute;\": \"Ń\",\n\t\"nacute;\": \"ń\",\n\t\"nbumpe;\": \"≏̸\",\n\t\"Ncaron;\": \"Ň\",\n\t\"ncaron;\": \"ň\",\n\t\"Ncedil;\": \"Ņ\",\n\t\"ncedil;\": \"ņ\",\n\t\"nearhk;\": \"⤤\",\n\t\"nequiv;\": \"≢\",\n\t\"nesear;\": \"⤨\",\n\t\"nexist;\": \"∄\",\n\t\"nltrie;\": \"⋬\",\n\t\"notinE;\": \"⋹̸\",\n\t\"nparsl;\": \"⫽⃥\",\n\t\"nprcue;\": \"⋠\",\n\t\"nrarrc;\": \"⤳̸\",\n\t\"nrarrw;\": \"↝̸\",\n\t\"nrtrie;\": \"⋭\",\n\t\"nsccue;\": \"⋡\",\n\t\"nsimeq;\": \"≄\",\n\t\"Ntilde;\": \"Ñ\",\n\t\"ntilde;\": \"ñ\",\n\t\"numero;\": \"№\",\n\t\"nVDash;\": \"⊯\",\n\t\"nVdash;\": \"⊮\",\n\t\"nvDash;\": \"⊭\",\n\t\"nvdash;\": \"⊬\",\n\t\"nvHarr;\": \"⤄\",\n\t\"nvlArr;\": \"⤂\",\n\t\"nvrArr;\": \"⤃\",\n\t\"nwarhk;\": \"⤣\",\n\t\"nwnear;\": \"⤧\",\n\t\"Oacute;\": \"Ó\",\n\t\"oacute;\": \"ó\",\n\t\"Odblac;\": \"Ő\",\n\t\"odblac;\": \"ő\",\n\t\"odsold;\": \"⦼\",\n\t\"Ograve;\": \"Ò\",\n\t\"ograve;\": \"ò\",\n\t\"ominus;\": \"⊖\",\n\t\"origof;\": \"⊶\",\n\t\"Oslash;\": \"Ø\",\n\t\"oslash;\": \"ø\",\n\t\"Otilde;\": \"Õ\",\n\t\"otilde;\": \"õ\",\n\t\"Otimes;\": \"⨷\",\n\t\"otimes;\": \"⊗\",\n\t\"parsim;\": \"⫳\",\n\t\"percnt;\": \"%\",\n\t\"period;\": \".\",\n\t\"permil;\": \"‰\",\n\t\"phmmat;\": \"ℳ\",\n\t\"planck;\": \"ℏ\",\n\t\"plankv;\": \"ℏ\",\n\t\"plusdo;\": \"∔\",\n\t\"plusdu;\": \"⨥\",\n\t\"plusmn;\": \"±\",\n\t\"preceq;\": \"⪯\",\n\t\"primes;\": \"ℙ\",\n\t\"prnsim;\": \"⋨\",\n\t\"propto;\": \"∝\",\n\t\"prurel;\": \"⊰\",\n\t\"puncsp;\": \" \",\n\t\"qprime;\": \"⁗\",\n\t\"Racute;\": \"Ŕ\",\n\t\"racute;\": \"ŕ\",\n\t\"rangle;\": \"⟩\",\n\t\"rarrap;\": \"⥵\",\n\t\"rarrfs;\": \"⤞\",\n\t\"rarrhk;\": \"↪\",\n\t\"rarrlp;\": \"↬\",\n\t\"rarrpl;\": \"⥅\",\n\t\"Rarrtl;\": \"⤖\",\n\t\"rarrtl;\": \"↣\",\n\t\"rAtail;\": \"⤜\",\n\t\"ratail;\": \"⤚\",\n\t\"rbrace;\": \"}\",\n\t\"rbrack;\": \"]\",\n\t\"Rcaron;\": \"Ř\",\n\t\"rcaron;\": \"ř\",\n\t\"Rcedil;\": \"Ŗ\",\n\t\"rcedil;\": \"ŗ\",\n\t\"rdquor;\": \"”\",\n\t\"rfisht;\": \"⥽\",\n\t\"rfloor;\": \"⌋\",\n\t\"rharul;\": \"⥬\",\n\t\"rmoust;\": \"⎱\",\n\t\"roplus;\": \"⨮\",\n\t\"rpargt;\": \"⦔\",\n\t\"rsaquo;\": \"›\",\n\t\"rsquor;\": \"’\",\n\t\"rthree;\": \"⋌\",\n\t\"rtimes;\": \"⋊\",\n\t\"Sacute;\": \"Ś\",\n\t\"sacute;\": \"ś\",\n\t\"Scaron;\": \"Š\",\n\t\"scaron;\": \"š\",\n\t\"Scedil;\": \"Ş\",\n\t\"scedil;\": \"ş\",\n\t\"scnsim;\": \"⋩\",\n\t\"searhk;\": \"⤥\",\n\t\"seswar;\": \"⤩\",\n\t\"sfrown;\": \"⌢\",\n\t\"SHCHcy;\": \"Щ\",\n\t\"shchcy;\": \"щ\",\n\t\"sigmaf;\": \"ς\",\n\t\"sigmav;\": \"ς\",\n\t\"simdot;\": \"⩪\",\n\t\"smashp;\": \"⨳\",\n\t\"SOFTcy;\": \"Ь\",\n\t\"softcy;\": \"ь\",\n\t\"solbar;\": \"⌿\",\n\t\"spades;\": \"♠\",\n\t\"sqcaps;\": \"⊓︀\",\n\t\"sqcups;\": \"⊔︀\",\n\t\"sqsube;\": \"⊑\",\n\t\"sqsupe;\": \"⊒\",\n\t\"Square;\": \"□\",\n\t\"square;\": \"□\",\n\t\"squarf;\": \"▪\",\n\t\"ssetmn;\": \"∖\",\n\t\"ssmile;\": \"⌣\",\n\t\"sstarf;\": \"⋆\",\n\t\"subdot;\": \"⪽\",\n\t\"Subset;\": \"⋐\",\n\t\"subset;\": \"⊂\",\n\t\"subsim;\": \"⫇\",\n\t\"subsub;\": \"⫕\",\n\t\"subsup;\": \"⫓\",\n\t\"succeq;\": \"⪰\",\n\t\"supdot;\": \"⪾\",\n\t\"Supset;\": \"⋑\",\n\t\"supset;\": \"⊃\",\n\t\"supsim;\": \"⫈\",\n\t\"supsub;\": \"⫔\",\n\t\"supsup;\": \"⫖\",\n\t\"swarhk;\": \"⤦\",\n\t\"swnwar;\": \"⤪\",\n\t\"target;\": \"⌖\",\n\t\"Tcaron;\": \"Ť\",\n\t\"tcaron;\": \"ť\",\n\t\"Tcedil;\": \"Ţ\",\n\t\"tcedil;\": \"ţ\",\n\t\"telrec;\": \"⌕\",\n\t\"there4;\": \"∴\",\n\t\"thetav;\": \"ϑ\",\n\t\"thinsp;\": \" \",\n\t\"thksim;\": \"∼\",\n\t\"timesb;\": \"⊠\",\n\t\"timesd;\": \"⨰\",\n\t\"topbot;\": \"⌶\",\n\t\"topcir;\": \"⫱\",\n\t\"tprime;\": \"‴\",\n\t\"tridot;\": \"◬\",\n\t\"Tstrok;\": \"Ŧ\",\n\t\"tstrok;\": \"ŧ\",\n\t\"Uacute;\": \"Ú\",\n\t\"uacute;\": \"ú\",\n\t\"Ubreve;\": \"Ŭ\",\n\t\"ubreve;\": \"ŭ\",\n\t\"Udblac;\": \"Ű\",\n\t\"udblac;\": \"ű\",\n\t\"ufisht;\": \"⥾\",\n\t\"Ugrave;\": \"Ù\",\n\t\"ugrave;\": \"ù\",\n\t\"ulcorn;\": \"⌜\",\n\t\"ulcrop;\": \"⌏\",\n\t\"urcorn;\": \"⌝\",\n\t\"urcrop;\": \"⌎\",\n\t\"Utilde;\": \"Ũ\",\n\t\"utilde;\": \"ũ\",\n\t\"vangrt;\": \"⦜\",\n\t\"varphi;\": \"ϕ\",\n\t\"varrho;\": \"ϱ\",\n\t\"Vdashl;\": \"⫦\",\n\t\"veebar;\": \"⊻\",\n\t\"vellip;\": \"⋮\",\n\t\"Verbar;\": \"‖\",\n\t\"verbar;\": \"|\",\n\t\"vsubnE;\": \"⫋︀\",\n\t\"vsubne;\": \"⊊︀\",\n\t\"vsupnE;\": \"⫌︀\",\n\t\"vsupne;\": \"⊋︀\",\n\t\"Vvdash;\": \"⊪\",\n\t\"wedbar;\": \"⩟\",\n\t\"wedgeq;\": \"≙\",\n\t\"weierp;\": \"℘\",\n\t\"wreath;\": \"≀\",\n\t\"xoplus;\": \"⨁\",\n\t\"xotime;\": \"⨂\",\n\t\"xsqcup;\": \"⨆\",\n\t\"xuplus;\": \"⨄\",\n\t\"xwedge;\": \"⋀\",\n\t\"Yacute;\": \"Ý\",\n\t\"yacute;\": \"ý\",\n\t\"Zacute;\": \"Ź\",\n\t\"zacute;\": \"ź\",\n\t\"Zcaron;\": \"Ž\",\n\t\"zcaron;\": \"ž\",\n\t\"zeetrf;\": \"ℨ\",\n\t\"alefsym;\": \"ℵ\",\n\t\"angrtvb;\": \"⊾\",\n\t\"angzarr;\": \"⍼\",\n\t\"asympeq;\": \"≍\",\n\t\"backsim;\": \"∽\",\n\t\"Because;\": \"∵\",\n\t\"because;\": \"∵\",\n\t\"bemptyv;\": \"⦰\",\n\t\"between;\": \"≬\",\n\t\"bigcirc;\": \"◯\",\n\t\"bigodot;\": \"⨀\",\n\t\"bigstar;\": \"★\",\n\t\"bnequiv;\": \"≡⃥\",\n\t\"boxplus;\": \"⊞\",\n\t\"Cayleys;\": \"ℭ\",\n\t\"Cconint;\": \"∰\",\n\t\"ccupssm;\": \"⩐\",\n\t\"Cedilla;\": \"¸\",\n\t\"cemptyv;\": \"⦲\",\n\t\"cirscir;\": \"⧂\",\n\t\"coloneq;\": \"≔\",\n\t\"congdot;\": \"⩭\",\n\t\"cudarrl;\": \"⤸\",\n\t\"cudarrr;\": \"⤵\",\n\t\"cularrp;\": \"⤽\",\n\t\"curarrm;\": \"⤼\",\n\t\"dbkarow;\": \"⤏\",\n\t\"ddagger;\": \"‡\",\n\t\"ddotseq;\": \"⩷\",\n\t\"demptyv;\": \"⦱\",\n\t\"Diamond;\": \"⋄\",\n\t\"diamond;\": \"⋄\",\n\t\"digamma;\": \"ϝ\",\n\t\"dotplus;\": \"∔\",\n\t\"DownTee;\": \"⊤\",\n\t\"dwangle;\": \"⦦\",\n\t\"Element;\": \"∈\",\n\t\"Epsilon;\": \"Ε\",\n\t\"epsilon;\": \"ε\",\n\t\"eqcolon;\": \"≕\",\n\t\"equivDD;\": \"⩸\",\n\t\"gesdoto;\": \"⪂\",\n\t\"gtquest;\": \"⩼\",\n\t\"gtrless;\": \"≷\",\n\t\"harrcir;\": \"⥈\",\n\t\"Implies;\": \"⇒\",\n\t\"intprod;\": \"⨼\",\n\t\"isindot;\": \"⋵\",\n\t\"larrbfs;\": \"⤟\",\n\t\"larrsim;\": \"⥳\",\n\t\"lbrksld;\": \"⦏\",\n\t\"lbrkslu;\": \"⦍\",\n\t\"ldrdhar;\": \"⥧\",\n\t\"LeftTee;\": \"⊣\",\n\t\"lesdoto;\": \"⪁\",\n\t\"lessdot;\": \"⋖\",\n\t\"lessgtr;\": \"≶\",\n\t\"lesssim;\": \"≲\",\n\t\"lotimes;\": \"⨴\",\n\t\"lozenge;\": \"◊\",\n\t\"ltquest;\": \"⩻\",\n\t\"luruhar;\": \"⥦\",\n\t\"maltese;\": \"✠\",\n\t\"minusdu;\": \"⨪\",\n\t\"napprox;\": \"≉\",\n\t\"natural;\": \"♮\",\n\t\"nearrow;\": \"↗\",\n\t\"NewLine;\": \"\\n\",\n\t\"nexists;\": \"∄\",\n\t\"NoBreak;\": \"⁠\",\n\t\"notinva;\": \"∉\",\n\t\"notinvb;\": \"⋷\",\n\t\"notinvc;\": \"⋶\",\n\t\"NotLess;\": \"≮\",\n\t\"notniva;\": \"∌\",\n\t\"notnivb;\": \"⋾\",\n\t\"notnivc;\": \"⋽\",\n\t\"npolint;\": \"⨔\",\n\t\"npreceq;\": \"⪯̸\",\n\t\"nsqsube;\": \"⋢\",\n\t\"nsqsupe;\": \"⋣\",\n\t\"nsubset;\": \"⊂⃒\",\n\t\"nsucceq;\": \"⪰̸\",\n\t\"nsupset;\": \"⊃⃒\",\n\t\"nvinfin;\": \"⧞\",\n\t\"nvltrie;\": \"⊴⃒\",\n\t\"nvrtrie;\": \"⊵⃒\",\n\t\"nwarrow;\": \"↖\",\n\t\"olcross;\": \"⦻\",\n\t\"Omicron;\": \"Ο\",\n\t\"omicron;\": \"ο\",\n\t\"orderof;\": \"ℴ\",\n\t\"orslope;\": \"⩗\",\n\t\"OverBar;\": \"‾\",\n\t\"pertenk;\": \"‱\",\n\t\"planckh;\": \"ℎ\",\n\t\"pluscir;\": \"⨢\",\n\t\"plussim;\": \"⨦\",\n\t\"plustwo;\": \"⨧\",\n\t\"precsim;\": \"≾\",\n\t\"Product;\": \"∏\",\n\t\"quatint;\": \"⨖\",\n\t\"questeq;\": \"≟\",\n\t\"rarrbfs;\": \"⤠\",\n\t\"rarrsim;\": \"⥴\",\n\t\"rbrksld;\": \"⦎\",\n\t\"rbrkslu;\": \"⦐\",\n\t\"rdldhar;\": \"⥩\",\n\t\"realine;\": \"ℛ\",\n\t\"rotimes;\": \"⨵\",\n\t\"ruluhar;\": \"⥨\",\n\t\"searrow;\": \"↘\",\n\t\"simplus;\": \"⨤\",\n\t\"simrarr;\": \"⥲\",\n\t\"subedot;\": \"⫃\",\n\t\"submult;\": \"⫁\",\n\t\"subplus;\": \"⪿\",\n\t\"subrarr;\": \"⥹\",\n\t\"succsim;\": \"≿\",\n\t\"supdsub;\": \"⫘\",\n\t\"supedot;\": \"⫄\",\n\t\"suphsol;\": \"⟉\",\n\t\"suphsub;\": \"⫗\",\n\t\"suplarr;\": \"⥻\",\n\t\"supmult;\": \"⫂\",\n\t\"supplus;\": \"⫀\",\n\t\"swarrow;\": \"↙\",\n\t\"topfork;\": \"⫚\",\n\t\"triplus;\": \"⨹\",\n\t\"tritime;\": \"⨻\",\n\t\"UpArrow;\": \"↑\",\n\t\"Uparrow;\": \"⇑\",\n\t\"uparrow;\": \"↑\",\n\t\"Upsilon;\": \"Υ\",\n\t\"upsilon;\": \"υ\",\n\t\"uwangle;\": \"⦧\",\n\t\"vzigzag;\": \"⦚\",\n\t\"zigrarr;\": \"⇝\",\n\t\"andslope;\": \"⩘\",\n\t\"angmsdaa;\": \"⦨\",\n\t\"angmsdab;\": \"⦩\",\n\t\"angmsdac;\": \"⦪\",\n\t\"angmsdad;\": \"⦫\",\n\t\"angmsdae;\": \"⦬\",\n\t\"angmsdaf;\": \"⦭\",\n\t\"angmsdag;\": \"⦮\",\n\t\"angmsdah;\": \"⦯\",\n\t\"angrtvbd;\": \"⦝\",\n\t\"approxeq;\": \"≊\",\n\t\"awconint;\": \"∳\",\n\t\"backcong;\": \"≌\",\n\t\"barwedge;\": \"⌅\",\n\t\"bbrktbrk;\": \"⎶\",\n\t\"bigoplus;\": \"⨁\",\n\t\"bigsqcup;\": \"⨆\",\n\t\"biguplus;\": \"⨄\",\n\t\"bigwedge;\": \"⋀\",\n\t\"boxminus;\": \"⊟\",\n\t\"boxtimes;\": \"⊠\",\n\t\"bsolhsub;\": \"⟈\",\n\t\"capbrcup;\": \"⩉\",\n\t\"circledR;\": \"®\",\n\t\"circledS;\": \"Ⓢ\",\n\t\"cirfnint;\": \"⨐\",\n\t\"clubsuit;\": \"♣\",\n\t\"cupbrcap;\": \"⩈\",\n\t\"curlyvee;\": \"⋎\",\n\t\"cwconint;\": \"∲\",\n\t\"DDotrahd;\": \"⤑\",\n\t\"doteqdot;\": \"≑\",\n\t\"DotEqual;\": \"≐\",\n\t\"dotminus;\": \"∸\",\n\t\"drbkarow;\": \"⤐\",\n\t\"dzigrarr;\": \"⟿\",\n\t\"elinters;\": \"⏧\",\n\t\"emptyset;\": \"∅\",\n\t\"eqvparsl;\": \"⧥\",\n\t\"fpartint;\": \"⨍\",\n\t\"geqslant;\": \"⩾\",\n\t\"gesdotol;\": \"⪄\",\n\t\"gnapprox;\": \"⪊\",\n\t\"hksearow;\": \"⤥\",\n\t\"hkswarow;\": \"⤦\",\n\t\"imagline;\": \"ℐ\",\n\t\"imagpart;\": \"ℑ\",\n\t\"infintie;\": \"⧝\",\n\t\"integers;\": \"ℤ\",\n\t\"Integral;\": \"∫\",\n\t\"intercal;\": \"⊺\",\n\t\"intlarhk;\": \"⨗\",\n\t\"laemptyv;\": \"⦴\",\n\t\"ldrushar;\": \"⥋\",\n\t\"leqslant;\": \"⩽\",\n\t\"lesdotor;\": \"⪃\",\n\t\"LessLess;\": \"⪡\",\n\t\"llcorner;\": \"⌞\",\n\t\"lnapprox;\": \"⪉\",\n\t\"lrcorner;\": \"⌟\",\n\t\"lurdshar;\": \"⥊\",\n\t\"mapstoup;\": \"↥\",\n\t\"multimap;\": \"⊸\",\n\t\"naturals;\": \"ℕ\",\n\t\"ncongdot;\": \"⩭̸\",\n\t\"NotEqual;\": \"≠\",\n\t\"notindot;\": \"⋵̸\",\n\t\"NotTilde;\": \"≁\",\n\t\"otimesas;\": \"⨶\",\n\t\"parallel;\": \"∥\",\n\t\"PartialD;\": \"∂\",\n\t\"plusacir;\": \"⨣\",\n\t\"pointint;\": \"⨕\",\n\t\"Precedes;\": \"≺\",\n\t\"precneqq;\": \"⪵\",\n\t\"precnsim;\": \"⋨\",\n\t\"profalar;\": \"⌮\",\n\t\"profline;\": \"⌒\",\n\t\"profsurf;\": \"⌓\",\n\t\"raemptyv;\": \"⦳\",\n\t\"realpart;\": \"ℜ\",\n\t\"RightTee;\": \"⊢\",\n\t\"rppolint;\": \"⨒\",\n\t\"rtriltri;\": \"⧎\",\n\t\"scpolint;\": \"⨓\",\n\t\"setminus;\": \"∖\",\n\t\"shortmid;\": \"∣\",\n\t\"smeparsl;\": \"⧤\",\n\t\"sqsubset;\": \"⊏\",\n\t\"sqsupset;\": \"⊐\",\n\t\"subseteq;\": \"⊆\",\n\t\"Succeeds;\": \"≻\",\n\t\"succneqq;\": \"⪶\",\n\t\"succnsim;\": \"⋩\",\n\t\"SuchThat;\": \"∋\",\n\t\"Superset;\": \"⊃\",\n\t\"supseteq;\": \"⊇\",\n\t\"thetasym;\": \"ϑ\",\n\t\"thicksim;\": \"∼\",\n\t\"timesbar;\": \"⨱\",\n\t\"triangle;\": \"▵\",\n\t\"triminus;\": \"⨺\",\n\t\"trpezium;\": \"⏢\",\n\t\"Uarrocir;\": \"⥉\",\n\t\"ulcorner;\": \"⌜\",\n\t\"UnderBar;\": \"_\",\n\t\"urcorner;\": \"⌝\",\n\t\"varkappa;\": \"ϰ\",\n\t\"varsigma;\": \"ς\",\n\t\"vartheta;\": \"ϑ\",\n\t\"backprime;\": \"‵\",\n\t\"backsimeq;\": \"⋍\",\n\t\"Backslash;\": \"∖\",\n\t\"bigotimes;\": \"⨂\",\n\t\"CenterDot;\": \"·\",\n\t\"centerdot;\": \"·\",\n\t\"checkmark;\": \"✓\",\n\t\"CircleDot;\": \"⊙\",\n\t\"complexes;\": \"ℂ\",\n\t\"Congruent;\": \"≡\",\n\t\"Coproduct;\": \"∐\",\n\t\"dotsquare;\": \"⊡\",\n\t\"DoubleDot;\": \"¨\",\n\t\"DownArrow;\": \"↓\",\n\t\"Downarrow;\": \"⇓\",\n\t\"downarrow;\": \"↓\",\n\t\"DownBreve;\": \"̑\",\n\t\"gtrapprox;\": \"⪆\",\n\t\"gtreqless;\": \"⋛\",\n\t\"gvertneqq;\": \"≩︀\",\n\t\"heartsuit;\": \"♥\",\n\t\"HumpEqual;\": \"≏\",\n\t\"LeftArrow;\": \"←\",\n\t\"Leftarrow;\": \"⇐\",\n\t\"leftarrow;\": \"←\",\n\t\"LeftFloor;\": \"⌊\",\n\t\"lesseqgtr;\": \"⋚\",\n\t\"LessTilde;\": \"≲\",\n\t\"lvertneqq;\": \"≨︀\",\n\t\"Mellintrf;\": \"ℳ\",\n\t\"MinusPlus;\": \"∓\",\n\t\"ngeqslant;\": \"⩾̸\",\n\t\"nleqslant;\": \"⩽̸\",\n\t\"NotCupCap;\": \"≭\",\n\t\"NotExists;\": \"∄\",\n\t\"NotSubset;\": \"⊂⃒\",\n\t\"nparallel;\": \"∦\",\n\t\"nshortmid;\": \"∤\",\n\t\"nsubseteq;\": \"⊈\",\n\t\"nsupseteq;\": \"⊉\",\n\t\"OverBrace;\": \"⏞\",\n\t\"pitchfork;\": \"⋔\",\n\t\"PlusMinus;\": \"±\",\n\t\"rationals;\": \"ℚ\",\n\t\"spadesuit;\": \"♠\",\n\t\"subseteqq;\": \"⫅\",\n\t\"subsetneq;\": \"⊊\",\n\t\"supseteqq;\": \"⫆\",\n\t\"supsetneq;\": \"⊋\",\n\t\"Therefore;\": \"∴\",\n\t\"therefore;\": \"∴\",\n\t\"ThinSpace;\": \" \",\n\t\"triangleq;\": \"≜\",\n\t\"TripleDot;\": \"⃛\",\n\t\"UnionPlus;\": \"⊎\",\n\t\"varpropto;\": \"∝\",\n\t\"Bernoullis;\": \"ℬ\",\n\t\"circledast;\": \"⊛\",\n\t\"CirclePlus;\": \"⊕\",\n\t\"complement;\": \"∁\",\n\t\"curlywedge;\": \"⋏\",\n\t\"eqslantgtr;\": \"⪖\",\n\t\"EqualTilde;\": \"≂\",\n\t\"Fouriertrf;\": \"ℱ\",\n\t\"gtreqqless;\": \"⪌\",\n\t\"ImaginaryI;\": \"ⅈ\",\n\t\"Laplacetrf;\": \"ℒ\",\n\t\"LeftVector;\": \"↼\",\n\t\"lessapprox;\": \"⪅\",\n\t\"lesseqqgtr;\": \"⪋\",\n\t\"Lleftarrow;\": \"⇚\",\n\t\"lmoustache;\": \"⎰\",\n\t\"longmapsto;\": \"⟼\",\n\t\"mapstodown;\": \"↧\",\n\t\"mapstoleft;\": \"↤\",\n\t\"nLeftarrow;\": \"⇍\",\n\t\"nleftarrow;\": \"↚\",\n\t\"NotElement;\": \"∉\",\n\t\"NotGreater;\": \"≯\",\n\t\"nsubseteqq;\": \"⫅̸\",\n\t\"nsupseteqq;\": \"⫆̸\",\n\t\"precapprox;\": \"⪷\",\n\t\"Proportion;\": \"∷\",\n\t\"RightArrow;\": \"→\",\n\t\"Rightarrow;\": \"⇒\",\n\t\"rightarrow;\": \"→\",\n\t\"RightFloor;\": \"⌋\",\n\t\"rmoustache;\": \"⎱\",\n\t\"sqsubseteq;\": \"⊑\",\n\t\"sqsupseteq;\": \"⊒\",\n\t\"subsetneqq;\": \"⫋\",\n\t\"succapprox;\": \"⪸\",\n\t\"supsetneqq;\": \"⫌\",\n\t\"ThickSpace;\": \"  \",\n\t\"TildeEqual;\": \"≃\",\n\t\"TildeTilde;\": \"≈\",\n\t\"UnderBrace;\": \"⏟\",\n\t\"UpArrowBar;\": \"⤒\",\n\t\"UpTeeArrow;\": \"↥\",\n\t\"upuparrows;\": \"⇈\",\n\t\"varepsilon;\": \"ϵ\",\n\t\"varnothing;\": \"∅\",\n\t\"backepsilon;\": \"϶\",\n\t\"blacksquare;\": \"▪\",\n\t\"circledcirc;\": \"⊚\",\n\t\"circleddash;\": \"⊝\",\n\t\"CircleMinus;\": \"⊖\",\n\t\"CircleTimes;\": \"⊗\",\n\t\"curlyeqprec;\": \"⋞\",\n\t\"curlyeqsucc;\": \"⋟\",\n\t\"diamondsuit;\": \"♦\",\n\t\"eqslantless;\": \"⪕\",\n\t\"Equilibrium;\": \"⇌\",\n\t\"expectation;\": \"ℰ\",\n\t\"GreaterLess;\": \"≷\",\n\t\"LeftCeiling;\": \"⌈\",\n\t\"LessGreater;\": \"≶\",\n\t\"MediumSpace;\": \" \",\n\t\"NotLessLess;\": \"≪̸\",\n\t\"NotPrecedes;\": \"⊀\",\n\t\"NotSucceeds;\": \"⊁\",\n\t\"NotSuperset;\": \"⊃⃒\",\n\t\"nRightarrow;\": \"⇏\",\n\t\"nrightarrow;\": \"↛\",\n\t\"OverBracket;\": \"⎴\",\n\t\"preccurlyeq;\": \"≼\",\n\t\"precnapprox;\": \"⪹\",\n\t\"quaternions;\": \"ℍ\",\n\t\"RightVector;\": \"⇀\",\n\t\"Rrightarrow;\": \"⇛\",\n\t\"RuleDelayed;\": \"⧴\",\n\t\"SmallCircle;\": \"∘\",\n\t\"SquareUnion;\": \"⊔\",\n\t\"straightphi;\": \"ϕ\",\n\t\"SubsetEqual;\": \"⊆\",\n\t\"succcurlyeq;\": \"≽\",\n\t\"succnapprox;\": \"⪺\",\n\t\"thickapprox;\": \"≈\",\n\t\"UpDownArrow;\": \"↕\",\n\t\"Updownarrow;\": \"⇕\",\n\t\"updownarrow;\": \"↕\",\n\t\"VerticalBar;\": \"∣\",\n\t\"blacklozenge;\": \"⧫\",\n\t\"DownArrowBar;\": \"⤓\",\n\t\"DownTeeArrow;\": \"↧\",\n\t\"ExponentialE;\": \"ⅇ\",\n\t\"exponentiale;\": \"ⅇ\",\n\t\"GreaterEqual;\": \"≥\",\n\t\"GreaterTilde;\": \"≳\",\n\t\"HilbertSpace;\": \"ℋ\",\n\t\"HumpDownHump;\": \"≎\",\n\t\"Intersection;\": \"⋂\",\n\t\"LeftArrowBar;\": \"⇤\",\n\t\"LeftTeeArrow;\": \"↤\",\n\t\"LeftTriangle;\": \"⊲\",\n\t\"LeftUpVector;\": \"↿\",\n\t\"NotCongruent;\": \"≢\",\n\t\"NotHumpEqual;\": \"≏̸\",\n\t\"NotLessEqual;\": \"≰\",\n\t\"NotLessTilde;\": \"≴\",\n\t\"Proportional;\": \"∝\",\n\t\"RightCeiling;\": \"⌉\",\n\t\"risingdotseq;\": \"≓\",\n\t\"RoundImplies;\": \"⥰\",\n\t\"ShortUpArrow;\": \"↑\",\n\t\"SquareSubset;\": \"⊏\",\n\t\"triangledown;\": \"▿\",\n\t\"triangleleft;\": \"◃\",\n\t\"UnderBracket;\": \"⎵\",\n\t\"varsubsetneq;\": \"⊊︀\",\n\t\"varsupsetneq;\": \"⊋︀\",\n\t\"VerticalLine;\": \"|\",\n\t\"ApplyFunction;\": \"⁡\",\n\t\"bigtriangleup;\": \"△\",\n\t\"blacktriangle;\": \"▴\",\n\t\"DifferentialD;\": \"ⅆ\",\n\t\"divideontimes;\": \"⋇\",\n\t\"DoubleLeftTee;\": \"⫤\",\n\t\"DoubleUpArrow;\": \"⇑\",\n\t\"fallingdotseq;\": \"≒\",\n\t\"hookleftarrow;\": \"↩\",\n\t\"leftarrowtail;\": \"↢\",\n\t\"leftharpoonup;\": \"↼\",\n\t\"LeftTeeVector;\": \"⥚\",\n\t\"LeftVectorBar;\": \"⥒\",\n\t\"LessFullEqual;\": \"≦\",\n\t\"LongLeftArrow;\": \"⟵\",\n\t\"Longleftarrow;\": \"⟸\",\n\t\"longleftarrow;\": \"⟵\",\n\t\"looparrowleft;\": \"↫\",\n\t\"measuredangle;\": \"∡\",\n\t\"NotEqualTilde;\": \"≂̸\",\n\t\"NotTildeEqual;\": \"≄\",\n\t\"NotTildeTilde;\": \"≉\",\n\t\"ntriangleleft;\": \"⋪\",\n\t\"Poincareplane;\": \"ℌ\",\n\t\"PrecedesEqual;\": \"⪯\",\n\t\"PrecedesTilde;\": \"≾\",\n\t\"RightArrowBar;\": \"⇥\",\n\t\"RightTeeArrow;\": \"↦\",\n\t\"RightTriangle;\": \"⊳\",\n\t\"RightUpVector;\": \"↾\",\n\t\"shortparallel;\": \"∥\",\n\t\"smallsetminus;\": \"∖\",\n\t\"SucceedsEqual;\": \"⪰\",\n\t\"SucceedsTilde;\": \"≿\",\n\t\"SupersetEqual;\": \"⊇\",\n\t\"triangleright;\": \"▹\",\n\t\"UpEquilibrium;\": \"⥮\",\n\t\"upharpoonleft;\": \"↿\",\n\t\"varsubsetneqq;\": \"⫋︀\",\n\t\"varsupsetneqq;\": \"⫌︀\",\n\t\"VerticalTilde;\": \"≀\",\n\t\"VeryThinSpace;\": \" \",\n\t\"curvearrowleft;\": \"↶\",\n\t\"DiacriticalDot;\": \"˙\",\n\t\"doublebarwedge;\": \"⌆\",\n\t\"DoubleRightTee;\": \"⊨\",\n\t\"downdownarrows;\": \"⇊\",\n\t\"DownLeftVector;\": \"↽\",\n\t\"GreaterGreater;\": \"⪢\",\n\t\"hookrightarrow;\": \"↪\",\n\t\"HorizontalLine;\": \"─\",\n\t\"InvisibleComma;\": \"⁣\",\n\t\"InvisibleTimes;\": \"⁢\",\n\t\"LeftDownVector;\": \"⇃\",\n\t\"leftleftarrows;\": \"⇇\",\n\t\"LeftRightArrow;\": \"↔\",\n\t\"Leftrightarrow;\": \"⇔\",\n\t\"leftrightarrow;\": \"↔\",\n\t\"leftthreetimes;\": \"⋋\",\n\t\"LessSlantEqual;\": \"⩽\",\n\t\"LongRightArrow;\": \"⟶\",\n\t\"Longrightarrow;\": \"⟹\",\n\t\"longrightarrow;\": \"⟶\",\n\t\"looparrowright;\": \"↬\",\n\t\"LowerLeftArrow;\": \"↙\",\n\t\"NestedLessLess;\": \"≪\",\n\t\"NotGreaterLess;\": \"≹\",\n\t\"NotLessGreater;\": \"≸\",\n\t\"NotSubsetEqual;\": \"⊈\",\n\t\"NotVerticalBar;\": \"∤\",\n\t\"nshortparallel;\": \"∦\",\n\t\"ntriangleright;\": \"⋫\",\n\t\"OpenCurlyQuote;\": \"‘\",\n\t\"ReverseElement;\": \"∋\",\n\t\"rightarrowtail;\": \"↣\",\n\t\"rightharpoonup;\": \"⇀\",\n\t\"RightTeeVector;\": \"⥛\",\n\t\"RightVectorBar;\": \"⥓\",\n\t\"ShortDownArrow;\": \"↓\",\n\t\"ShortLeftArrow;\": \"←\",\n\t\"SquareSuperset;\": \"⊐\",\n\t\"TildeFullEqual;\": \"≅\",\n\t\"trianglelefteq;\": \"⊴\",\n\t\"upharpoonright;\": \"↾\",\n\t\"UpperLeftArrow;\": \"↖\",\n\t\"ZeroWidthSpace;\": \"​\",\n\t\"bigtriangledown;\": \"▽\",\n\t\"circlearrowleft;\": \"↺\",\n\t\"CloseCurlyQuote;\": \"’\",\n\t\"ContourIntegral;\": \"∮\",\n\t\"curvearrowright;\": \"↷\",\n\t\"DoubleDownArrow;\": \"⇓\",\n\t\"DoubleLeftArrow;\": \"⇐\",\n\t\"downharpoonleft;\": \"⇃\",\n\t\"DownRightVector;\": \"⇁\",\n\t\"leftharpoondown;\": \"↽\",\n\t\"leftrightarrows;\": \"⇆\",\n\t\"LeftRightVector;\": \"⥎\",\n\t\"LeftTriangleBar;\": \"⧏\",\n\t\"LeftUpTeeVector;\": \"⥠\",\n\t\"LeftUpVectorBar;\": \"⥘\",\n\t\"LowerRightArrow;\": \"↘\",\n\t\"nLeftrightarrow;\": \"⇎\",\n\t\"nleftrightarrow;\": \"↮\",\n\t\"NotGreaterEqual;\": \"≱\",\n\t\"NotGreaterTilde;\": \"≵\",\n\t\"NotHumpDownHump;\": \"≎̸\",\n\t\"NotLeftTriangle;\": \"⋪\",\n\t\"NotSquareSubset;\": \"⊏̸\",\n\t\"ntrianglelefteq;\": \"⋬\",\n\t\"OverParenthesis;\": \"⏜\",\n\t\"RightDownVector;\": \"⇂\",\n\t\"rightleftarrows;\": \"⇄\",\n\t\"rightsquigarrow;\": \"↝\",\n\t\"rightthreetimes;\": \"⋌\",\n\t\"ShortRightArrow;\": \"→\",\n\t\"straightepsilon;\": \"ϵ\",\n\t\"trianglerighteq;\": \"⊵\",\n\t\"UpperRightArrow;\": \"↗\",\n\t\"vartriangleleft;\": \"⊲\",\n\t\"circlearrowright;\": \"↻\",\n\t\"DiacriticalAcute;\": \"´\",\n\t\"DiacriticalGrave;\": \"`\",\n\t\"DiacriticalTilde;\": \"˜\",\n\t\"DoubleRightArrow;\": \"⇒\",\n\t\"DownArrowUpArrow;\": \"⇵\",\n\t\"downharpoonright;\": \"⇂\",\n\t\"EmptySmallSquare;\": \"◻\",\n\t\"GreaterEqualLess;\": \"⋛\",\n\t\"GreaterFullEqual;\": \"≧\",\n\t\"LeftAngleBracket;\": \"⟨\",\n\t\"LeftUpDownVector;\": \"⥑\",\n\t\"LessEqualGreater;\": \"⋚\",\n\t\"NonBreakingSpace;\": \" \",\n\t\"NotPrecedesEqual;\": \"⪯̸\",\n\t\"NotRightTriangle;\": \"⋫\",\n\t\"NotSucceedsEqual;\": \"⪰̸\",\n\t\"NotSucceedsTilde;\": \"≿̸\",\n\t\"NotSupersetEqual;\": \"⊉\",\n\t\"ntrianglerighteq;\": \"⋭\",\n\t\"rightharpoondown;\": \"⇁\",\n\t\"rightrightarrows;\": \"⇉\",\n\t\"RightTriangleBar;\": \"⧐\",\n\t\"RightUpTeeVector;\": \"⥜\",\n\t\"RightUpVectorBar;\": \"⥔\",\n\t\"twoheadleftarrow;\": \"↞\",\n\t\"UnderParenthesis;\": \"⏝\",\n\t\"UpArrowDownArrow;\": \"⇅\",\n\t\"vartriangleright;\": \"⊳\",\n\t\"blacktriangledown;\": \"▾\",\n\t\"blacktriangleleft;\": \"◂\",\n\t\"DoubleUpDownArrow;\": \"⇕\",\n\t\"DoubleVerticalBar;\": \"∥\",\n\t\"DownLeftTeeVector;\": \"⥞\",\n\t\"DownLeftVectorBar;\": \"⥖\",\n\t\"FilledSmallSquare;\": \"◼\",\n\t\"GreaterSlantEqual;\": \"⩾\",\n\t\"LeftDoubleBracket;\": \"⟦\",\n\t\"LeftDownTeeVector;\": \"⥡\",\n\t\"LeftDownVectorBar;\": \"⥙\",\n\t\"leftrightharpoons;\": \"⇋\",\n\t\"LeftTriangleEqual;\": \"⊴\",\n\t\"NegativeThinSpace;\": \"​\",\n\t\"NotGreaterGreater;\": \"≫̸\",\n\t\"NotLessSlantEqual;\": \"⩽̸\",\n\t\"NotNestedLessLess;\": \"⪡̸\",\n\t\"NotReverseElement;\": \"∌\",\n\t\"NotSquareSuperset;\": \"⊐̸\",\n\t\"NotTildeFullEqual;\": \"≇\",\n\t\"RightAngleBracket;\": \"⟩\",\n\t\"rightleftharpoons;\": \"⇌\",\n\t\"RightUpDownVector;\": \"⥏\",\n\t\"SquareSubsetEqual;\": \"⊑\",\n\t\"twoheadrightarrow;\": \"↠\",\n\t\"VerticalSeparator;\": \"❘\",\n\t\"blacktriangleright;\": \"▸\",\n\t\"DownRightTeeVector;\": \"⥟\",\n\t\"DownRightVectorBar;\": \"⥗\",\n\t\"LongLeftRightArrow;\": \"⟷\",\n\t\"Longleftrightarrow;\": \"⟺\",\n\t\"longleftrightarrow;\": \"⟷\",\n\t\"NegativeThickSpace;\": \"​\",\n\t\"NotLeftTriangleBar;\": \"⧏̸\",\n\t\"PrecedesSlantEqual;\": \"≼\",\n\t\"ReverseEquilibrium;\": \"⇋\",\n\t\"RightDoubleBracket;\": \"⟧\",\n\t\"RightDownTeeVector;\": \"⥝\",\n\t\"RightDownVectorBar;\": \"⥕\",\n\t\"RightTriangleEqual;\": \"⊵\",\n\t\"SquareIntersection;\": \"⊓\",\n\t\"SucceedsSlantEqual;\": \"≽\",\n\t\"DoubleLongLeftArrow;\": \"⟸\",\n\t\"DownLeftRightVector;\": \"⥐\",\n\t\"LeftArrowRightArrow;\": \"⇆\",\n\t\"leftrightsquigarrow;\": \"↭\",\n\t\"NegativeMediumSpace;\": \"​\",\n\t\"NotGreaterFullEqual;\": \"≧̸\",\n\t\"NotRightTriangleBar;\": \"⧐̸\",\n\t\"RightArrowLeftArrow;\": \"⇄\",\n\t\"SquareSupersetEqual;\": \"⊒\",\n\t\"CapitalDifferentialD;\": \"ⅅ\",\n\t\"DoubleLeftRightArrow;\": \"⇔\",\n\t\"DoubleLongRightArrow;\": \"⟹\",\n\t\"EmptyVerySmallSquare;\": \"▫\",\n\t\"NestedGreaterGreater;\": \"≫\",\n\t\"NotDoubleVerticalBar;\": \"∦\",\n\t\"NotGreaterSlantEqual;\": \"⩾̸\",\n\t\"NotLeftTriangleEqual;\": \"⋬\",\n\t\"NotSquareSubsetEqual;\": \"⋢\",\n\t\"OpenCurlyDoubleQuote;\": \"“\",\n\t\"ReverseUpEquilibrium;\": \"⥯\",\n\t\"CloseCurlyDoubleQuote;\": \"”\",\n\t\"DoubleContourIntegral;\": \"∯\",\n\t\"FilledVerySmallSquare;\": \"▪\",\n\t\"NegativeVeryThinSpace;\": \"​\",\n\t\"NotPrecedesSlantEqual;\": \"⋠\",\n\t\"NotRightTriangleEqual;\": \"⋭\",\n\t\"NotSucceedsSlantEqual;\": \"⋡\",\n\t\"DiacriticalDoubleAcute;\": \"˝\",\n\t\"NotSquareSupersetEqual;\": \"⋣\",\n\t\"NotNestedGreaterGreater;\": \"⪢̸\",\n\t\"ClockwiseContourIntegral;\": \"∲\",\n\t\"DoubleLongLeftRightArrow;\": \"⟺\",\n\t\"CounterClockwiseContourIntegral;\": \"∳\"\n};\n\n// lazy compute this to make this file tree-shakable for browser\r\nlet maxCRNameLength;\r\nconst decodeHtml = (rawText, asAttr) => {\r\n    let offset = 0;\r\n    const end = rawText.length;\r\n    let decodedText = '';\r\n    function advance(length) {\r\n        offset += length;\r\n        rawText = rawText.slice(length);\r\n    }\r\n    while (offset < end) {\r\n        const head = /&(?:#x?)?/i.exec(rawText);\r\n        if (!head || offset + head.index >= end) {\r\n            const remaining = end - offset;\r\n            decodedText += rawText.slice(0, remaining);\r\n            advance(remaining);\r\n            break;\r\n        }\r\n        // Advance to the \"&\".\r\n        decodedText += rawText.slice(0, head.index);\r\n        advance(head.index);\r\n        if (head[0] === '&') {\r\n            // Named character reference.\r\n            let name = '';\r\n            let value = undefined;\r\n            if (/[0-9a-z]/i.test(rawText[1])) {\r\n                if (!maxCRNameLength) {\r\n                    maxCRNameLength = Object.keys(namedCharacterReferences).reduce((max, name) => Math.max(max, name.length), 0);\r\n                }\r\n                for (let length = maxCRNameLength; !value && length > 0; --length) {\r\n                    name = rawText.substr(1, length);\r\n                    value = namedCharacterReferences[name];\r\n                }\r\n                if (value) {\r\n                    const semi = name.endsWith(';');\r\n                    if (asAttr &&\r\n                        !semi &&\r\n                        /[=a-z0-9]/i.test(rawText[name.length + 1] || '')) {\r\n                        decodedText += '&' + name;\r\n                        advance(1 + name.length);\r\n                    }\r\n                    else {\r\n                        decodedText += value;\r\n                        advance(1 + name.length);\r\n                    }\r\n                }\r\n                else {\r\n                    decodedText += '&' + name;\r\n                    advance(1 + name.length);\r\n                }\r\n            }\r\n            else {\r\n                decodedText += '&';\r\n                advance(1);\r\n            }\r\n        }\r\n        else {\r\n            // Numeric character reference.\r\n            const hex = head[0] === '&#x';\r\n            const pattern = hex ? /^&#x([0-9a-f]+);?/i : /^&#([0-9]+);?/;\r\n            const body = pattern.exec(rawText);\r\n            if (!body) {\r\n                decodedText += head[0];\r\n                advance(head[0].length);\r\n            }\r\n            else {\r\n                // https://html.spec.whatwg.org/multipage/parsing.html#numeric-character-reference-end-state\r\n                let cp = Number.parseInt(body[1], hex ? 16 : 10);\r\n                if (cp === 0) {\r\n                    cp = 0xfffd;\r\n                }\r\n                else if (cp > 0x10ffff) {\r\n                    cp = 0xfffd;\r\n                }\r\n                else if (cp >= 0xd800 && cp <= 0xdfff) {\r\n                    cp = 0xfffd;\r\n                }\r\n                else if ((cp >= 0xfdd0 && cp <= 0xfdef) || (cp & 0xfffe) === 0xfffe) ;\r\n                else if ((cp >= 0x01 && cp <= 0x08) ||\r\n                    cp === 0x0b ||\r\n                    (cp >= 0x0d && cp <= 0x1f) ||\r\n                    (cp >= 0x7f && cp <= 0x9f)) {\r\n                    cp = CCR_REPLACEMENTS[cp] || cp;\r\n                }\r\n                decodedText += String.fromCodePoint(cp);\r\n                advance(body[0].length);\r\n            }\r\n        }\r\n    }\r\n    return decodedText;\r\n};\r\n// https://html.spec.whatwg.org/multipage/parsing.html#numeric-character-reference-end-state\r\nconst CCR_REPLACEMENTS = {\r\n    0x80: 0x20ac,\r\n    0x82: 0x201a,\r\n    0x83: 0x0192,\r\n    0x84: 0x201e,\r\n    0x85: 0x2026,\r\n    0x86: 0x2020,\r\n    0x87: 0x2021,\r\n    0x88: 0x02c6,\r\n    0x89: 0x2030,\r\n    0x8a: 0x0160,\r\n    0x8b: 0x2039,\r\n    0x8c: 0x0152,\r\n    0x8e: 0x017d,\r\n    0x91: 0x2018,\r\n    0x92: 0x2019,\r\n    0x93: 0x201c,\r\n    0x94: 0x201d,\r\n    0x95: 0x2022,\r\n    0x96: 0x2013,\r\n    0x97: 0x2014,\r\n    0x98: 0x02dc,\r\n    0x99: 0x2122,\r\n    0x9a: 0x0161,\r\n    0x9b: 0x203a,\r\n    0x9c: 0x0153,\r\n    0x9e: 0x017e,\r\n    0x9f: 0x0178\r\n};\n\nconst isRawTextContainer = /*#__PURE__*/ shared.makeMap('style,iframe,script,noscript', true);\r\nconst parserOptions = {\r\n    isVoidTag: shared.isVoidTag,\r\n    isNativeTag: tag => shared.isHTMLTag(tag) || shared.isSVGTag(tag),\r\n    isPreTag: tag => tag === 'pre',\r\n    decodeEntities: decodeHtml,\r\n    isBuiltInComponent: (tag) => {\r\n        if (compilerCore.isBuiltInType(tag, `Transition`)) {\r\n            return TRANSITION;\r\n        }\r\n        else if (compilerCore.isBuiltInType(tag, `TransitionGroup`)) {\r\n            return TRANSITION_GROUP;\r\n        }\r\n    },\r\n    // https://html.spec.whatwg.org/multipage/parsing.html#tree-construction-dispatcher\r\n    getNamespace(tag, parent) {\r\n        let ns = parent ? parent.ns : 0 /* HTML */;\r\n        if (parent && ns === 2 /* MATH_ML */) {\r\n            if (parent.tag === 'annotation-xml') {\r\n                if (tag === 'svg') {\r\n                    return 1 /* SVG */;\r\n                }\r\n                if (parent.props.some(a => a.type === 6 /* ATTRIBUTE */ &&\r\n                    a.name === 'encoding' &&\r\n                    a.value != null &&\r\n                    (a.value.content === 'text/html' ||\r\n                        a.value.content === 'application/xhtml+xml'))) {\r\n                    ns = 0 /* HTML */;\r\n                }\r\n            }\r\n            else if (/^m(?:[ions]|text)$/.test(parent.tag) &&\r\n                tag !== 'mglyph' &&\r\n                tag !== 'malignmark') {\r\n                ns = 0 /* HTML */;\r\n            }\r\n        }\r\n        else if (parent && ns === 1 /* SVG */) {\r\n            if (parent.tag === 'foreignObject' ||\r\n                parent.tag === 'desc' ||\r\n                parent.tag === 'title') {\r\n                ns = 0 /* HTML */;\r\n            }\r\n        }\r\n        if (ns === 0 /* HTML */) {\r\n            if (tag === 'svg') {\r\n                return 1 /* SVG */;\r\n            }\r\n            if (tag === 'math') {\r\n                return 2 /* MATH_ML */;\r\n            }\r\n        }\r\n        return ns;\r\n    },\r\n    // https://html.spec.whatwg.org/multipage/parsing.html#parsing-html-fragments\r\n    getTextMode({ tag, ns }) {\r\n        if (ns === 0 /* HTML */) {\r\n            if (tag === 'textarea' || tag === 'title') {\r\n                return 1 /* RCDATA */;\r\n            }\r\n            if (isRawTextContainer(tag)) {\r\n                return 2 /* RAWTEXT */;\r\n            }\r\n        }\r\n        return 0 /* DATA */;\r\n    }\r\n};\n\n// Parse inline CSS strings for static style attributes into an object.\r\n// This is a NodeTransform since it works on the static `style` attribute and\r\n// converts it into a dynamic equivalent:\r\n// style=\"color: red\" -> :style='{ \"color\": \"red\" }'\r\n// It is then processed by `transformElement` and included in the generated\r\n// props.\r\nconst transformStyle = node => {\r\n    if (node.type === 1 /* ELEMENT */) {\r\n        node.props.forEach((p, i) => {\r\n            if (p.type === 6 /* ATTRIBUTE */ && p.name === 'style' && p.value) {\r\n                // replace p with an expression node\r\n                node.props[i] = {\r\n                    type: 7 /* DIRECTIVE */,\r\n                    name: `bind`,\r\n                    arg: compilerCore.createSimpleExpression(`style`, true, p.loc),\r\n                    exp: parseInlineCSS(p.value.content, p.loc),\r\n                    modifiers: [],\r\n                    loc: p.loc\r\n                };\r\n            }\r\n        });\r\n    }\r\n};\r\nconst parseInlineCSS = (cssText, loc) => {\r\n    const normalized = shared.parseStringStyle(cssText);\r\n    return compilerCore.createSimpleExpression(JSON.stringify(normalized), false, loc, 3 /* CAN_STRINGIFY */);\r\n};\n\nfunction createDOMCompilerError(code, loc) {\r\n    return compilerCore.createCompilerError(code, loc, DOMErrorMessages );\r\n}\r\nconst DOMErrorMessages = {\r\n    [49 /* X_V_HTML_NO_EXPRESSION */]: `v-html is missing expression.`,\r\n    [50 /* X_V_HTML_WITH_CHILDREN */]: `v-html will override element children.`,\r\n    [51 /* X_V_TEXT_NO_EXPRESSION */]: `v-text is missing expression.`,\r\n    [52 /* X_V_TEXT_WITH_CHILDREN */]: `v-text will override element children.`,\r\n    [53 /* X_V_MODEL_ON_INVALID_ELEMENT */]: `v-model can only be used on <input>, <textarea> and <select> elements.`,\r\n    [54 /* X_V_MODEL_ARG_ON_ELEMENT */]: `v-model argument is not supported on plain elements.`,\r\n    [55 /* X_V_MODEL_ON_FILE_INPUT_ELEMENT */]: `v-model cannot be used on file inputs since they are read-only. Use a v-on:change listener instead.`,\r\n    [56 /* X_V_MODEL_UNNECESSARY_VALUE */]: `Unnecessary value binding used alongside v-model. It will interfere with v-model's behavior.`,\r\n    [57 /* X_V_SHOW_NO_EXPRESSION */]: `v-show is missing expression.`,\r\n    [58 /* X_TRANSITION_INVALID_CHILDREN */]: `<Transition> expects exactly one child element or component.`,\r\n    [59 /* X_IGNORED_SIDE_EFFECT_TAG */]: `Tags with side effect (<script> and <style>) are ignored in client component templates.`\r\n};\n\nconst transformVHtml = (dir, node, context) => {\r\n    const { exp, loc } = dir;\r\n    if (!exp) {\r\n        context.onError(createDOMCompilerError(49 /* X_V_HTML_NO_EXPRESSION */, loc));\r\n    }\r\n    if (node.children.length) {\r\n        context.onError(createDOMCompilerError(50 /* X_V_HTML_WITH_CHILDREN */, loc));\r\n        node.children.length = 0;\r\n    }\r\n    return {\r\n        props: [\r\n            compilerCore.createObjectProperty(compilerCore.createSimpleExpression(`innerHTML`, true, loc), exp || compilerCore.createSimpleExpression('', true))\r\n        ]\r\n    };\r\n};\n\nconst transformVText = (dir, node, context) => {\r\n    const { exp, loc } = dir;\r\n    if (!exp) {\r\n        context.onError(createDOMCompilerError(51 /* X_V_TEXT_NO_EXPRESSION */, loc));\r\n    }\r\n    if (node.children.length) {\r\n        context.onError(createDOMCompilerError(52 /* X_V_TEXT_WITH_CHILDREN */, loc));\r\n        node.children.length = 0;\r\n    }\r\n    return {\r\n        props: [\r\n            compilerCore.createObjectProperty(compilerCore.createSimpleExpression(`textContent`, true), exp\r\n                ? compilerCore.createCallExpression(context.helperString(compilerCore.TO_DISPLAY_STRING), [exp], loc)\r\n                : compilerCore.createSimpleExpression('', true))\r\n        ]\r\n    };\r\n};\n\nconst transformModel = (dir, node, context) => {\r\n    const baseResult = compilerCore.transformModel(dir, node, context);\r\n    // base transform has errors OR component v-model (only need props)\r\n    if (!baseResult.props.length || node.tagType === 1 /* COMPONENT */) {\r\n        return baseResult;\r\n    }\r\n    if (dir.arg) {\r\n        context.onError(createDOMCompilerError(54 /* X_V_MODEL_ARG_ON_ELEMENT */, dir.arg.loc));\r\n    }\r\n    const { tag } = node;\r\n    const isCustomElement = context.isCustomElement(tag);\r\n    if (tag === 'input' ||\r\n        tag === 'textarea' ||\r\n        tag === 'select' ||\r\n        isCustomElement) {\r\n        let directiveToUse = V_MODEL_TEXT;\r\n        let isInvalidType = false;\r\n        if (tag === 'input' || isCustomElement) {\r\n            const type = compilerCore.findProp(node, `type`);\r\n            if (type) {\r\n                if (type.type === 7 /* DIRECTIVE */) {\r\n                    // :type=\"foo\"\r\n                    directiveToUse = V_MODEL_DYNAMIC;\r\n                }\r\n                else if (type.value) {\r\n                    switch (type.value.content) {\r\n                        case 'radio':\r\n                            directiveToUse = V_MODEL_RADIO;\r\n                            break;\r\n                        case 'checkbox':\r\n                            directiveToUse = V_MODEL_CHECKBOX;\r\n                            break;\r\n                        case 'file':\r\n                            isInvalidType = true;\r\n                            context.onError(createDOMCompilerError(55 /* X_V_MODEL_ON_FILE_INPUT_ELEMENT */, dir.loc));\r\n                            break;\r\n                    }\r\n                }\r\n            }\r\n            else if (compilerCore.hasDynamicKeyVBind(node)) {\r\n                // element has bindings with dynamic keys, which can possibly contain\r\n                // \"type\".\r\n                directiveToUse = V_MODEL_DYNAMIC;\r\n            }\r\n            else ;\r\n        }\r\n        else if (tag === 'select') {\r\n            directiveToUse = V_MODEL_SELECT;\r\n        }\r\n        else ;\r\n        // inject runtime directive\r\n        // by returning the helper symbol via needRuntime\r\n        // the import will replaced a resolveDirective call.\r\n        if (!isInvalidType) {\r\n            baseResult.needRuntime = context.helper(directiveToUse);\r\n        }\r\n    }\r\n    else {\r\n        context.onError(createDOMCompilerError(53 /* X_V_MODEL_ON_INVALID_ELEMENT */, dir.loc));\r\n    }\r\n    // native vmodel doesn't need the `modelValue` props since they are also\r\n    // passed to the runtime as `binding.value`. removing it reduces code size.\r\n    baseResult.props = baseResult.props.filter(p => !(p.key.type === 4 /* SIMPLE_EXPRESSION */ &&\r\n        p.key.content === 'modelValue'));\r\n    return baseResult;\r\n};\n\nconst isEventOptionModifier = /*#__PURE__*/ shared.makeMap(`passive,once,capture`);\r\nconst isNonKeyModifier = /*#__PURE__*/ shared.makeMap(\r\n// event propagation management\r\n`stop,prevent,self,` +\r\n    // system modifiers + exact\r\n    `ctrl,shift,alt,meta,exact,` +\r\n    // mouse\r\n    `middle`);\r\n// left & right could be mouse or key modifiers based on event type\r\nconst maybeKeyModifier = /*#__PURE__*/ shared.makeMap('left,right');\r\nconst isKeyboardEvent = /*#__PURE__*/ shared.makeMap(`onkeyup,onkeydown,onkeypress`, true);\r\nconst resolveModifiers = (key, modifiers, context, loc) => {\r\n    const keyModifiers = [];\r\n    const nonKeyModifiers = [];\r\n    const eventOptionModifiers = [];\r\n    for (let i = 0; i < modifiers.length; i++) {\r\n        const modifier = modifiers[i];\r\n        if (modifier === 'native' &&\r\n            compilerCore.checkCompatEnabled(\"COMPILER_V_ON_NATIVE\" /* COMPILER_V_ON_NATIVE */, context, loc)) {\r\n            eventOptionModifiers.push(modifier);\r\n        }\r\n        else if (isEventOptionModifier(modifier)) {\r\n            // eventOptionModifiers: modifiers for addEventListener() options,\r\n            // e.g. .passive & .capture\r\n            eventOptionModifiers.push(modifier);\r\n        }\r\n        else {\r\n            // runtimeModifiers: modifiers that needs runtime guards\r\n            if (maybeKeyModifier(modifier)) {\r\n                if (compilerCore.isStaticExp(key)) {\r\n                    if (isKeyboardEvent(key.content)) {\r\n                        keyModifiers.push(modifier);\r\n                    }\r\n                    else {\r\n                        nonKeyModifiers.push(modifier);\r\n                    }\r\n                }\r\n                else {\r\n                    keyModifiers.push(modifier);\r\n                    nonKeyModifiers.push(modifier);\r\n                }\r\n            }\r\n            else {\r\n                if (isNonKeyModifier(modifier)) {\r\n                    nonKeyModifiers.push(modifier);\r\n                }\r\n                else {\r\n                    keyModifiers.push(modifier);\r\n                }\r\n            }\r\n        }\r\n    }\r\n    return {\r\n        keyModifiers,\r\n        nonKeyModifiers,\r\n        eventOptionModifiers\r\n    };\r\n};\r\nconst transformClick = (key, event) => {\r\n    const isStaticClick = compilerCore.isStaticExp(key) && key.content.toLowerCase() === 'onclick';\r\n    return isStaticClick\r\n        ? compilerCore.createSimpleExpression(event, true)\r\n        : key.type !== 4 /* SIMPLE_EXPRESSION */\r\n            ? compilerCore.createCompoundExpression([\r\n                `(`,\r\n                key,\r\n                `) === \"onClick\" ? \"${event}\" : (`,\r\n                key,\r\n                `)`\r\n            ])\r\n            : key;\r\n};\r\nconst transformOn = (dir, node, context) => {\r\n    return compilerCore.transformOn(dir, node, context, baseResult => {\r\n        const { modifiers } = dir;\r\n        if (!modifiers.length)\r\n            return baseResult;\r\n        let { key, value: handlerExp } = baseResult.props[0];\r\n        const { keyModifiers, nonKeyModifiers, eventOptionModifiers } = resolveModifiers(key, modifiers, context, dir.loc);\r\n        // normalize click.right and click.middle since they don't actually fire\r\n        if (nonKeyModifiers.includes('right')) {\r\n            key = transformClick(key, `onContextmenu`);\r\n        }\r\n        if (nonKeyModifiers.includes('middle')) {\r\n            key = transformClick(key, `onMouseup`);\r\n        }\r\n        if (nonKeyModifiers.length) {\r\n            handlerExp = compilerCore.createCallExpression(context.helper(V_ON_WITH_MODIFIERS), [\r\n                handlerExp,\r\n                JSON.stringify(nonKeyModifiers)\r\n            ]);\r\n        }\r\n        if (keyModifiers.length &&\r\n            // if event name is dynamic, always wrap with keys guard\r\n            (!compilerCore.isStaticExp(key) || isKeyboardEvent(key.content))) {\r\n            handlerExp = compilerCore.createCallExpression(context.helper(V_ON_WITH_KEYS), [\r\n                handlerExp,\r\n                JSON.stringify(keyModifiers)\r\n            ]);\r\n        }\r\n        if (eventOptionModifiers.length) {\r\n            const modifierPostfix = eventOptionModifiers.map(shared.capitalize).join('');\r\n            key = compilerCore.isStaticExp(key)\r\n                ? compilerCore.createSimpleExpression(`${key.content}${modifierPostfix}`, true)\r\n                : compilerCore.createCompoundExpression([`(`, key, `) + \"${modifierPostfix}\"`]);\r\n        }\r\n        return {\r\n            props: [compilerCore.createObjectProperty(key, handlerExp)]\r\n        };\r\n    });\r\n};\n\nconst transformShow = (dir, node, context) => {\r\n    const { exp, loc } = dir;\r\n    if (!exp) {\r\n        context.onError(createDOMCompilerError(57 /* X_V_SHOW_NO_EXPRESSION */, loc));\r\n    }\r\n    return {\r\n        props: [],\r\n        needRuntime: context.helper(V_SHOW)\r\n    };\r\n};\n\n/**\r\n * This module is Node-only.\r\n */\r\n/**\r\n * Turn eligible hoisted static trees into stringified static nodes, e.g.\r\n *\r\n * ```js\r\n * const _hoisted_1 = createStaticVNode(`<div class=\"foo\">bar</div>`)\r\n * ```\r\n *\r\n * A single static vnode can contain stringified content for **multiple**\r\n * consecutive nodes (element and plain text), called a \"chunk\".\r\n * `@vue/runtime-dom` will create the content via innerHTML in a hidden\r\n * container element and insert all the nodes in place. The call must also\r\n * provide the number of nodes contained in the chunk so that during hydration\r\n * we can know how many nodes the static vnode should adopt.\r\n *\r\n * The optimization scans a children list that contains hoisted nodes, and\r\n * tries to find the largest chunk of consecutive hoisted nodes before running\r\n * into a non-hoisted node or the end of the list. A chunk is then converted\r\n * into a single static vnode and replaces the hoisted expression of the first\r\n * node in the chunk. Other nodes in the chunk are considered \"merged\" and\r\n * therefore removed from both the hoist list and the children array.\r\n *\r\n * This optimization is only performed in Node.js.\r\n */\r\nconst stringifyStatic = (children, context, parent) => {\r\n    // bail stringification for slot content\r\n    if (context.scopes.vSlot > 0) {\r\n        return;\r\n    }\r\n    let nc = 0; // current node count\r\n    let ec = 0; // current element with binding count\r\n    const currentChunk = [];\r\n    const stringifyCurrentChunk = (currentIndex) => {\r\n        if (nc >= 20 /* NODE_COUNT */ ||\r\n            ec >= 5 /* ELEMENT_WITH_BINDING_COUNT */) {\r\n            // combine all currently eligible nodes into a single static vnode call\r\n            const staticCall = compilerCore.createCallExpression(context.helper(compilerCore.CREATE_STATIC), [\r\n                JSON.stringify(currentChunk.map(node => stringifyNode(node, context)).join('')),\r\n                // the 2nd argument indicates the number of DOM nodes this static vnode\r\n                // will insert / hydrate\r\n                String(currentChunk.length)\r\n            ]);\r\n            // replace the first node's hoisted expression with the static vnode call\r\n            replaceHoist(currentChunk[0], staticCall, context);\r\n            if (currentChunk.length > 1) {\r\n                for (let i = 1; i < currentChunk.length; i++) {\r\n                    // for the merged nodes, set their hoisted expression to null\r\n                    replaceHoist(currentChunk[i], null, context);\r\n                }\r\n                // also remove merged nodes from children\r\n                const deleteCount = currentChunk.length - 1;\r\n                children.splice(currentIndex - currentChunk.length + 1, deleteCount);\r\n                return deleteCount;\r\n            }\r\n        }\r\n        return 0;\r\n    };\r\n    let i = 0;\r\n    for (; i < children.length; i++) {\r\n        const child = children[i];\r\n        const hoisted = getHoistedNode(child);\r\n        if (hoisted) {\r\n            // presence of hoisted means child must be a stringifiable node\r\n            const node = child;\r\n            const result = analyzeNode(node);\r\n            if (result) {\r\n                // node is stringifiable, record state\r\n                nc += result[0];\r\n                ec += result[1];\r\n                currentChunk.push(node);\r\n                continue;\r\n            }\r\n        }\r\n        // we only reach here if we ran into a node that is not stringifiable\r\n        // check if currently analyzed nodes meet criteria for stringification.\r\n        // adjust iteration index\r\n        i -= stringifyCurrentChunk(i);\r\n        // reset state\r\n        nc = 0;\r\n        ec = 0;\r\n        currentChunk.length = 0;\r\n    }\r\n    // in case the last node was also stringifiable\r\n    stringifyCurrentChunk(i);\r\n};\r\nconst getHoistedNode = (node) => ((node.type === 1 /* ELEMENT */ && node.tagType === 0 /* ELEMENT */) ||\r\n    node.type == 12 /* TEXT_CALL */) &&\r\n    node.codegenNode &&\r\n    node.codegenNode.type === 4 /* SIMPLE_EXPRESSION */ &&\r\n    node.codegenNode.hoisted;\r\nconst dataAriaRE = /^(data|aria)-/;\r\nconst isStringifiableAttr = (name) => {\r\n    return shared.isKnownAttr(name) || dataAriaRE.test(name);\r\n};\r\nconst replaceHoist = (node, replacement, context) => {\r\n    const hoistToReplace = node.codegenNode.hoisted;\r\n    context.hoists[context.hoists.indexOf(hoistToReplace)] = replacement;\r\n};\r\nconst isNonStringifiable = /*#__PURE__*/ shared.makeMap(`caption,thead,tr,th,tbody,td,tfoot,colgroup,col`);\r\n/**\r\n * for a hoisted node, analyze it and return:\r\n * - false: bailed (contains runtime constant)\r\n * - [nc, ec] where\r\n *   - nc is the number of nodes inside\r\n *   - ec is the number of element with bindings inside\r\n */\r\nfunction analyzeNode(node) {\r\n    if (node.type === 1 /* ELEMENT */ && isNonStringifiable(node.tag)) {\r\n        return false;\r\n    }\r\n    if (node.type === 12 /* TEXT_CALL */) {\r\n        return [1, 0];\r\n    }\r\n    let nc = 1; // node count\r\n    let ec = node.props.length > 0 ? 1 : 0; // element w/ binding count\r\n    let bailed = false;\r\n    const bail = () => {\r\n        bailed = true;\r\n        return false;\r\n    };\r\n    // TODO: check for cases where using innerHTML will result in different\r\n    // output compared to imperative node insertions.\r\n    // probably only need to check for most common case\r\n    // i.e. non-phrasing-content tags inside `<p>`\r\n    function walk(node) {\r\n        for (let i = 0; i < node.props.length; i++) {\r\n            const p = node.props[i];\r\n            // bail on non-attr bindings\r\n            if (p.type === 6 /* ATTRIBUTE */ && !isStringifiableAttr(p.name)) {\r\n                return bail();\r\n            }\r\n            if (p.type === 7 /* DIRECTIVE */ && p.name === 'bind') {\r\n                // bail on non-attr bindings\r\n                if (p.arg &&\r\n                    (p.arg.type === 8 /* COMPOUND_EXPRESSION */ ||\r\n                        (p.arg.isStatic && !isStringifiableAttr(p.arg.content)))) {\r\n                    return bail();\r\n                }\r\n            }\r\n        }\r\n        for (let i = 0; i < node.children.length; i++) {\r\n            nc++;\r\n            const child = node.children[i];\r\n            if (child.type === 1 /* ELEMENT */) {\r\n                if (child.props.length > 0) {\r\n                    ec++;\r\n                }\r\n                walk(child);\r\n                if (bailed) {\r\n                    return false;\r\n                }\r\n            }\r\n        }\r\n        return true;\r\n    }\r\n    return walk(node) ? [nc, ec] : false;\r\n}\r\nfunction stringifyNode(node, context) {\r\n    if (shared.isString(node)) {\r\n        return node;\r\n    }\r\n    if (shared.isSymbol(node)) {\r\n        return ``;\r\n    }\r\n    switch (node.type) {\r\n        case 1 /* ELEMENT */:\r\n            return stringifyElement(node, context);\r\n        case 2 /* TEXT */:\r\n            return shared.escapeHtml(node.content);\r\n        case 3 /* COMMENT */:\r\n            return `<!--${shared.escapeHtml(node.content)}-->`;\r\n        case 5 /* INTERPOLATION */:\r\n            return shared.escapeHtml(shared.toDisplayString(evaluateConstant(node.content)));\r\n        case 8 /* COMPOUND_EXPRESSION */:\r\n            return shared.escapeHtml(evaluateConstant(node));\r\n        case 12 /* TEXT_CALL */:\r\n            return stringifyNode(node.content, context);\r\n        default:\r\n            // static trees will not contain if/for nodes\r\n            return '';\r\n    }\r\n}\r\nfunction stringifyElement(node, context) {\r\n    let res = `<${node.tag}`;\r\n    for (let i = 0; i < node.props.length; i++) {\r\n        const p = node.props[i];\r\n        if (p.type === 6 /* ATTRIBUTE */) {\r\n            res += ` ${p.name}`;\r\n            if (p.value) {\r\n                res += `=\"${shared.escapeHtml(p.value.content)}\"`;\r\n            }\r\n        }\r\n        else if (p.type === 7 /* DIRECTIVE */ && p.name === 'bind') {\r\n            // constant v-bind, e.g. :foo=\"1\"\r\n            let evaluated = evaluateConstant(p.exp);\r\n            if (evaluated != null) {\r\n                const arg = p.arg && p.arg.content;\r\n                if (arg === 'class') {\r\n                    evaluated = shared.normalizeClass(evaluated);\r\n                }\r\n                else if (arg === 'style') {\r\n                    evaluated = shared.stringifyStyle(shared.normalizeStyle(evaluated));\r\n                }\r\n                res += ` ${p.arg.content}=\"${shared.escapeHtml(evaluated)}\"`;\r\n            }\r\n        }\r\n    }\r\n    if (context.scopeId) {\r\n        res += ` ${context.scopeId}`;\r\n    }\r\n    res += `>`;\r\n    for (let i = 0; i < node.children.length; i++) {\r\n        res += stringifyNode(node.children[i], context);\r\n    }\r\n    if (!shared.isVoidTag(node.tag)) {\r\n        res += `</${node.tag}>`;\r\n    }\r\n    return res;\r\n}\r\n// __UNSAFE__\r\n// Reason: eval.\r\n// It's technically safe to eval because only constant expressions are possible\r\n// here, e.g. `{{ 1 }}` or `{{ 'foo' }}`\r\n// in addition, constant exps bail on presence of parens so you can't even\r\n// run JSFuck in here. But we mark it unsafe for security review purposes.\r\n// (see compiler-core/src/transformExpressions)\r\nfunction evaluateConstant(exp) {\r\n    if (exp.type === 4 /* SIMPLE_EXPRESSION */) {\r\n        return new Function(`return ${exp.content}`)();\r\n    }\r\n    else {\r\n        // compound\r\n        let res = ``;\r\n        exp.children.forEach(c => {\r\n            if (shared.isString(c) || shared.isSymbol(c)) {\r\n                return;\r\n            }\r\n            if (c.type === 2 /* TEXT */) {\r\n                res += c.content;\r\n            }\r\n            else if (c.type === 5 /* INTERPOLATION */) {\r\n                res += shared.toDisplayString(evaluateConstant(c.content));\r\n            }\r\n            else {\r\n                res += evaluateConstant(c);\r\n            }\r\n        });\r\n        return res;\r\n    }\r\n}\n\nconst ignoreSideEffectTags = (node, context) => {\r\n    if (node.type === 1 /* ELEMENT */ &&\r\n        node.tagType === 0 /* ELEMENT */ &&\r\n        (node.tag === 'script' || node.tag === 'style')) {\r\n        context.onError(createDOMCompilerError(59 /* X_IGNORED_SIDE_EFFECT_TAG */, node.loc));\r\n        context.removeNode();\r\n    }\r\n};\n\nconst DOMNodeTransforms = [\r\n    transformStyle,\r\n    ...([])\r\n];\r\nconst DOMDirectiveTransforms = {\r\n    cloak: compilerCore.noopDirectiveTransform,\r\n    html: transformVHtml,\r\n    text: transformVText,\r\n    model: transformModel,\r\n    on: transformOn,\r\n    show: transformShow\r\n};\r\nfunction compile(template, options = {}) {\r\n    return compilerCore.baseCompile(template, shared.extend({}, parserOptions, options, {\r\n        nodeTransforms: [\r\n            // ignore <script> and <tag>\r\n            // this is not put inside DOMNodeTransforms because that list is used\r\n            // by compiler-ssr to generate vnode fallback branches\r\n            ignoreSideEffectTags,\r\n            ...DOMNodeTransforms,\r\n            ...(options.nodeTransforms || [])\r\n        ],\r\n        directiveTransforms: shared.extend({}, DOMDirectiveTransforms, options.directiveTransforms || {}),\r\n        transformHoist: stringifyStatic\r\n    }));\r\n}\r\nfunction parse(template, options = {}) {\r\n    return compilerCore.baseParse(template, shared.extend({}, parserOptions, options));\r\n}\n\nObject.keys(compilerCore).forEach(function (k) {\n  if (k !== 'default') exports[k] = compilerCore[k];\n});\nexports.DOMDirectiveTransforms = DOMDirectiveTransforms;\nexports.DOMNodeTransforms = DOMNodeTransforms;\nexports.TRANSITION = TRANSITION;\nexports.TRANSITION_GROUP = TRANSITION_GROUP;\nexports.V_MODEL_CHECKBOX = V_MODEL_CHECKBOX;\nexports.V_MODEL_DYNAMIC = V_MODEL_DYNAMIC;\nexports.V_MODEL_RADIO = V_MODEL_RADIO;\nexports.V_MODEL_SELECT = V_MODEL_SELECT;\nexports.V_MODEL_TEXT = V_MODEL_TEXT;\nexports.V_ON_WITH_KEYS = V_ON_WITH_KEYS;\nexports.V_ON_WITH_MODIFIERS = V_ON_WITH_MODIFIERS;\nexports.V_SHOW = V_SHOW;\nexports.compile = compile;\nexports.createDOMCompilerError = createDOMCompilerError;\nexports.parse = parse;\nexports.parserOptions = parserOptions;\nexports.transformStyle = transformStyle;\n","'use strict'\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./dist/compiler-core.cjs.prod.js')\n} else {\n  module.exports = require('./dist/compiler-core.cjs.js')\n}\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar shared = require('@vue/shared');\nvar sourceMap = require('source-map');\nvar parser = require('@babel/parser');\nvar estreeWalker = require('estree-walker');\n\nfunction defaultOnError(error) {\r\n    throw error;\r\n}\r\nfunction defaultOnWarn(msg) {\r\n}\r\nfunction createCompilerError(code, loc, messages, additionalMessage) {\r\n    const msg = (messages || errorMessages)[code] + (additionalMessage || ``)\r\n        ;\r\n    const error = new SyntaxError(String(msg));\r\n    error.code = code;\r\n    error.loc = loc;\r\n    return error;\r\n}\r\nconst errorMessages = {\r\n    // parse errors\r\n    [0 /* ABRUPT_CLOSING_OF_EMPTY_COMMENT */]: 'Illegal comment.',\r\n    [1 /* CDATA_IN_HTML_CONTENT */]: 'CDATA section is allowed only in XML context.',\r\n    [2 /* DUPLICATE_ATTRIBUTE */]: 'Duplicate attribute.',\r\n    [3 /* END_TAG_WITH_ATTRIBUTES */]: 'End tag cannot have attributes.',\r\n    [4 /* END_TAG_WITH_TRAILING_SOLIDUS */]: \"Illegal '/' in tags.\",\r\n    [5 /* EOF_BEFORE_TAG_NAME */]: 'Unexpected EOF in tag.',\r\n    [6 /* EOF_IN_CDATA */]: 'Unexpected EOF in CDATA section.',\r\n    [7 /* EOF_IN_COMMENT */]: 'Unexpected EOF in comment.',\r\n    [8 /* EOF_IN_SCRIPT_HTML_COMMENT_LIKE_TEXT */]: 'Unexpected EOF in script.',\r\n    [9 /* EOF_IN_TAG */]: 'Unexpected EOF in tag.',\r\n    [10 /* INCORRECTLY_CLOSED_COMMENT */]: 'Incorrectly closed comment.',\r\n    [11 /* INCORRECTLY_OPENED_COMMENT */]: 'Incorrectly opened comment.',\r\n    [12 /* INVALID_FIRST_CHARACTER_OF_TAG_NAME */]: \"Illegal tag name. Use '&lt;' to print '<'.\",\r\n    [13 /* MISSING_ATTRIBUTE_VALUE */]: 'Attribute value was expected.',\r\n    [14 /* MISSING_END_TAG_NAME */]: 'End tag name was expected.',\r\n    [15 /* MISSING_WHITESPACE_BETWEEN_ATTRIBUTES */]: 'Whitespace was expected.',\r\n    [16 /* NESTED_COMMENT */]: \"Unexpected '<!--' in comment.\",\r\n    [17 /* UNEXPECTED_CHARACTER_IN_ATTRIBUTE_NAME */]: 'Attribute name cannot contain U+0022 (\"), U+0027 (\\'), and U+003C (<).',\r\n    [18 /* UNEXPECTED_CHARACTER_IN_UNQUOTED_ATTRIBUTE_VALUE */]: 'Unquoted attribute value cannot contain U+0022 (\"), U+0027 (\\'), U+003C (<), U+003D (=), and U+0060 (`).',\r\n    [19 /* UNEXPECTED_EQUALS_SIGN_BEFORE_ATTRIBUTE_NAME */]: \"Attribute name cannot start with '='.\",\r\n    [21 /* UNEXPECTED_QUESTION_MARK_INSTEAD_OF_TAG_NAME */]: \"'<?' is allowed only in XML context.\",\r\n    [20 /* UNEXPECTED_NULL_CHARACTER */]: `Unexpected null cahracter.`,\r\n    [22 /* UNEXPECTED_SOLIDUS_IN_TAG */]: \"Illegal '/' in tags.\",\r\n    // Vue-specific parse errors\r\n    [23 /* X_INVALID_END_TAG */]: 'Invalid end tag.',\r\n    [24 /* X_MISSING_END_TAG */]: 'Element is missing end tag.',\r\n    [25 /* X_MISSING_INTERPOLATION_END */]: 'Interpolation end sign was not found.',\r\n    [26 /* X_MISSING_DYNAMIC_DIRECTIVE_ARGUMENT_END */]: 'End bracket for dynamic directive argument was not found. ' +\r\n        'Note that dynamic directive argument cannot contain spaces.',\r\n    // transform errors\r\n    [27 /* X_V_IF_NO_EXPRESSION */]: `v-if/v-else-if is missing expression.`,\r\n    [28 /* X_V_IF_SAME_KEY */]: `v-if/else branches must use unique keys.`,\r\n    [29 /* X_V_ELSE_NO_ADJACENT_IF */]: `v-else/v-else-if has no adjacent v-if.`,\r\n    [30 /* X_V_FOR_NO_EXPRESSION */]: `v-for is missing expression.`,\r\n    [31 /* X_V_FOR_MALFORMED_EXPRESSION */]: `v-for has invalid expression.`,\r\n    [32 /* X_V_FOR_TEMPLATE_KEY_PLACEMENT */]: `<template v-for> key should be placed on the <template> tag.`,\r\n    [33 /* X_V_BIND_NO_EXPRESSION */]: `v-bind is missing expression.`,\r\n    [34 /* X_V_ON_NO_EXPRESSION */]: `v-on is missing expression.`,\r\n    [35 /* X_V_SLOT_UNEXPECTED_DIRECTIVE_ON_SLOT_OUTLET */]: `Unexpected custom directive on <slot> outlet.`,\r\n    [36 /* X_V_SLOT_MIXED_SLOT_USAGE */]: `Mixed v-slot usage on both the component and nested <template>.` +\r\n        `When there are multiple named slots, all slots should use <template> ` +\r\n        `syntax to avoid scope ambiguity.`,\r\n    [37 /* X_V_SLOT_DUPLICATE_SLOT_NAMES */]: `Duplicate slot names found. `,\r\n    [38 /* X_V_SLOT_EXTRANEOUS_DEFAULT_SLOT_CHILDREN */]: `Extraneous children found when component already has explicitly named ` +\r\n        `default slot. These children will be ignored.`,\r\n    [39 /* X_V_SLOT_MISPLACED */]: `v-slot can only be used on components or <template> tags.`,\r\n    [40 /* X_V_MODEL_NO_EXPRESSION */]: `v-model is missing expression.`,\r\n    [41 /* X_V_MODEL_MALFORMED_EXPRESSION */]: `v-model value must be a valid JavaScript member expression.`,\r\n    [42 /* X_V_MODEL_ON_SCOPE_VARIABLE */]: `v-model cannot be used on v-for or v-slot scope variables because they are not writable.`,\r\n    [43 /* X_INVALID_EXPRESSION */]: `Error parsing JavaScript expression: `,\r\n    [44 /* X_KEEP_ALIVE_INVALID_CHILDREN */]: `<KeepAlive> expects exactly one child component.`,\r\n    // generic errors\r\n    [45 /* X_PREFIX_ID_NOT_SUPPORTED */]: `\"prefixIdentifiers\" option is not supported in this build of compiler.`,\r\n    [46 /* X_MODULE_MODE_NOT_SUPPORTED */]: `ES module mode is not supported in this build of compiler.`,\r\n    [47 /* X_CACHE_HANDLER_NOT_SUPPORTED */]: `\"cacheHandlers\" option is only supported when the \"prefixIdentifiers\" option is enabled.`,\r\n    [48 /* X_SCOPE_ID_NOT_SUPPORTED */]: `\"scopeId\" option is only supported in module mode.`,\r\n    // just to fullfill types\r\n    [49 /* __EXTEND_POINT__ */]: ``\r\n};\n\nconst FRAGMENT = Symbol(``);\r\nconst TELEPORT = Symbol(``);\r\nconst SUSPENSE = Symbol(``);\r\nconst KEEP_ALIVE = Symbol(``);\r\nconst BASE_TRANSITION = Symbol(``);\r\nconst OPEN_BLOCK = Symbol(``);\r\nconst CREATE_BLOCK = Symbol(``);\r\nconst CREATE_VNODE = Symbol(``);\r\nconst CREATE_COMMENT = Symbol(``);\r\nconst CREATE_TEXT = Symbol(``);\r\nconst CREATE_STATIC = Symbol(``);\r\nconst RESOLVE_COMPONENT = Symbol(``);\r\nconst RESOLVE_DYNAMIC_COMPONENT = Symbol(``);\r\nconst RESOLVE_DIRECTIVE = Symbol(``);\r\nconst RESOLVE_FILTER = Symbol(``);\r\nconst WITH_DIRECTIVES = Symbol(``);\r\nconst RENDER_LIST = Symbol(``);\r\nconst RENDER_SLOT = Symbol(``);\r\nconst CREATE_SLOTS = Symbol(``);\r\nconst TO_DISPLAY_STRING = Symbol(``);\r\nconst MERGE_PROPS = Symbol(``);\r\nconst TO_HANDLERS = Symbol(``);\r\nconst CAMELIZE = Symbol(``);\r\nconst CAPITALIZE = Symbol(``);\r\nconst TO_HANDLER_KEY = Symbol(``);\r\nconst SET_BLOCK_TRACKING = Symbol(``);\r\nconst PUSH_SCOPE_ID = Symbol(``);\r\nconst POP_SCOPE_ID = Symbol(``);\r\nconst WITH_SCOPE_ID = Symbol(``);\r\nconst WITH_CTX = Symbol(``);\r\nconst UNREF = Symbol(``);\r\nconst IS_REF = Symbol(``);\r\n// Name mapping for runtime helpers that need to be imported from 'vue' in\r\n// generated code. Make sure these are correctly exported in the runtime!\r\n// Using `any` here because TS doesn't allow symbols as index type.\r\nconst helperNameMap = {\r\n    [FRAGMENT]: `Fragment`,\r\n    [TELEPORT]: `Teleport`,\r\n    [SUSPENSE]: `Suspense`,\r\n    [KEEP_ALIVE]: `KeepAlive`,\r\n    [BASE_TRANSITION]: `BaseTransition`,\r\n    [OPEN_BLOCK]: `openBlock`,\r\n    [CREATE_BLOCK]: `createBlock`,\r\n    [CREATE_VNODE]: `createVNode`,\r\n    [CREATE_COMMENT]: `createCommentVNode`,\r\n    [CREATE_TEXT]: `createTextVNode`,\r\n    [CREATE_STATIC]: `createStaticVNode`,\r\n    [RESOLVE_COMPONENT]: `resolveComponent`,\r\n    [RESOLVE_DYNAMIC_COMPONENT]: `resolveDynamicComponent`,\r\n    [RESOLVE_DIRECTIVE]: `resolveDirective`,\r\n    [RESOLVE_FILTER]: `resolveFilter`,\r\n    [WITH_DIRECTIVES]: `withDirectives`,\r\n    [RENDER_LIST]: `renderList`,\r\n    [RENDER_SLOT]: `renderSlot`,\r\n    [CREATE_SLOTS]: `createSlots`,\r\n    [TO_DISPLAY_STRING]: `toDisplayString`,\r\n    [MERGE_PROPS]: `mergeProps`,\r\n    [TO_HANDLERS]: `toHandlers`,\r\n    [CAMELIZE]: `camelize`,\r\n    [CAPITALIZE]: `capitalize`,\r\n    [TO_HANDLER_KEY]: `toHandlerKey`,\r\n    [SET_BLOCK_TRACKING]: `setBlockTracking`,\r\n    [PUSH_SCOPE_ID]: `pushScopeId`,\r\n    [POP_SCOPE_ID]: `popScopeId`,\r\n    [WITH_SCOPE_ID]: `withScopeId`,\r\n    [WITH_CTX]: `withCtx`,\r\n    [UNREF]: `unref`,\r\n    [IS_REF]: `isRef`\r\n};\r\nfunction registerRuntimeHelpers(helpers) {\r\n    Object.getOwnPropertySymbols(helpers).forEach(s => {\r\n        helperNameMap[s] = helpers[s];\r\n    });\r\n}\n\n// AST Utilities ---------------------------------------------------------------\r\n// Some expressions, e.g. sequence and conditional expressions, are never\r\n// associated with template nodes, so their source locations are just a stub.\r\n// Container types like CompoundExpression also don't need a real location.\r\nconst locStub = {\r\n    source: '',\r\n    start: { line: 1, column: 1, offset: 0 },\r\n    end: { line: 1, column: 1, offset: 0 }\r\n};\r\nfunction createRoot(children, loc = locStub) {\r\n    return {\r\n        type: 0 /* ROOT */,\r\n        children,\r\n        helpers: [],\r\n        components: [],\r\n        directives: [],\r\n        hoists: [],\r\n        imports: [],\r\n        cached: 0,\r\n        temps: 0,\r\n        codegenNode: undefined,\r\n        loc\r\n    };\r\n}\r\nfunction createVNodeCall(context, tag, props, children, patchFlag, dynamicProps, directives, isBlock = false, disableTracking = false, loc = locStub) {\r\n    if (context) {\r\n        if (isBlock) {\r\n            context.helper(OPEN_BLOCK);\r\n            context.helper(CREATE_BLOCK);\r\n        }\r\n        else {\r\n            context.helper(CREATE_VNODE);\r\n        }\r\n        if (directives) {\r\n            context.helper(WITH_DIRECTIVES);\r\n        }\r\n    }\r\n    return {\r\n        type: 13 /* VNODE_CALL */,\r\n        tag,\r\n        props,\r\n        children,\r\n        patchFlag,\r\n        dynamicProps,\r\n        directives,\r\n        isBlock,\r\n        disableTracking,\r\n        loc\r\n    };\r\n}\r\nfunction createArrayExpression(elements, loc = locStub) {\r\n    return {\r\n        type: 17 /* JS_ARRAY_EXPRESSION */,\r\n        loc,\r\n        elements\r\n    };\r\n}\r\nfunction createObjectExpression(properties, loc = locStub) {\r\n    return {\r\n        type: 15 /* JS_OBJECT_EXPRESSION */,\r\n        loc,\r\n        properties\r\n    };\r\n}\r\nfunction createObjectProperty(key, value) {\r\n    return {\r\n        type: 16 /* JS_PROPERTY */,\r\n        loc: locStub,\r\n        key: shared.isString(key) ? createSimpleExpression(key, true) : key,\r\n        value\r\n    };\r\n}\r\nfunction createSimpleExpression(content, isStatic, loc = locStub, constType = 0 /* NOT_CONSTANT */) {\r\n    return {\r\n        type: 4 /* SIMPLE_EXPRESSION */,\r\n        loc,\r\n        content,\r\n        isStatic,\r\n        constType: isStatic ? 3 /* CAN_STRINGIFY */ : constType\r\n    };\r\n}\r\nfunction createInterpolation(content, loc) {\r\n    return {\r\n        type: 5 /* INTERPOLATION */,\r\n        loc,\r\n        content: shared.isString(content)\r\n            ? createSimpleExpression(content, false, loc)\r\n            : content\r\n    };\r\n}\r\nfunction createCompoundExpression(children, loc = locStub) {\r\n    return {\r\n        type: 8 /* COMPOUND_EXPRESSION */,\r\n        loc,\r\n        children\r\n    };\r\n}\r\nfunction createCallExpression(callee, args = [], loc = locStub) {\r\n    return {\r\n        type: 14 /* JS_CALL_EXPRESSION */,\r\n        loc,\r\n        callee,\r\n        arguments: args\r\n    };\r\n}\r\nfunction createFunctionExpression(params, returns = undefined, newline = false, isSlot = false, loc = locStub) {\r\n    return {\r\n        type: 18 /* JS_FUNCTION_EXPRESSION */,\r\n        params,\r\n        returns,\r\n        newline,\r\n        isSlot,\r\n        loc\r\n    };\r\n}\r\nfunction createConditionalExpression(test, consequent, alternate, newline = true) {\r\n    return {\r\n        type: 19 /* JS_CONDITIONAL_EXPRESSION */,\r\n        test,\r\n        consequent,\r\n        alternate,\r\n        newline,\r\n        loc: locStub\r\n    };\r\n}\r\nfunction createCacheExpression(index, value, isVNode = false) {\r\n    return {\r\n        type: 20 /* JS_CACHE_EXPRESSION */,\r\n        index,\r\n        value,\r\n        isVNode,\r\n        loc: locStub\r\n    };\r\n}\r\nfunction createBlockStatement(body) {\r\n    return {\r\n        type: 21 /* JS_BLOCK_STATEMENT */,\r\n        body,\r\n        loc: locStub\r\n    };\r\n}\r\nfunction createTemplateLiteral(elements) {\r\n    return {\r\n        type: 22 /* JS_TEMPLATE_LITERAL */,\r\n        elements,\r\n        loc: locStub\r\n    };\r\n}\r\nfunction createIfStatement(test, consequent, alternate) {\r\n    return {\r\n        type: 23 /* JS_IF_STATEMENT */,\r\n        test,\r\n        consequent,\r\n        alternate,\r\n        loc: locStub\r\n    };\r\n}\r\nfunction createAssignmentExpression(left, right) {\r\n    return {\r\n        type: 24 /* JS_ASSIGNMENT_EXPRESSION */,\r\n        left,\r\n        right,\r\n        loc: locStub\r\n    };\r\n}\r\nfunction createSequenceExpression(expressions) {\r\n    return {\r\n        type: 25 /* JS_SEQUENCE_EXPRESSION */,\r\n        expressions,\r\n        loc: locStub\r\n    };\r\n}\r\nfunction createReturnStatement(returns) {\r\n    return {\r\n        type: 26 /* JS_RETURN_STATEMENT */,\r\n        returns,\r\n        loc: locStub\r\n    };\r\n}\n\nconst isStaticExp = (p) => p.type === 4 /* SIMPLE_EXPRESSION */ && p.isStatic;\r\nconst isBuiltInType = (tag, expected) => tag === expected || tag === shared.hyphenate(expected);\r\nfunction isCoreComponent(tag) {\r\n    if (isBuiltInType(tag, 'Teleport')) {\r\n        return TELEPORT;\r\n    }\r\n    else if (isBuiltInType(tag, 'Suspense')) {\r\n        return SUSPENSE;\r\n    }\r\n    else if (isBuiltInType(tag, 'KeepAlive')) {\r\n        return KEEP_ALIVE;\r\n    }\r\n    else if (isBuiltInType(tag, 'BaseTransition')) {\r\n        return BASE_TRANSITION;\r\n    }\r\n}\r\nconst nonIdentifierRE = /^\\d|[^\\$\\w]/;\r\nconst isSimpleIdentifier = (name) => !nonIdentifierRE.test(name);\r\nconst memberExpRE = /^[A-Za-z_$\\xA0-\\uFFFF][\\w$\\xA0-\\uFFFF]*(?:\\s*\\.\\s*[A-Za-z_$\\xA0-\\uFFFF][\\w$\\xA0-\\uFFFF]*|\\[(.+)\\])*$/;\r\nconst isMemberExpression = (path) => {\r\n    if (!path)\r\n        return false;\r\n    const matched = memberExpRE.exec(path.trim());\r\n    if (!matched)\r\n        return false;\r\n    if (!matched[1])\r\n        return true;\r\n    if (!/[\\[\\]]/.test(matched[1]))\r\n        return true;\r\n    return isMemberExpression(matched[1].trim());\r\n};\r\nfunction getInnerRange(loc, offset, length) {\r\n    const source = loc.source.substr(offset, length);\r\n    const newLoc = {\r\n        source,\r\n        start: advancePositionWithClone(loc.start, loc.source, offset),\r\n        end: loc.end\r\n    };\r\n    if (length != null) {\r\n        newLoc.end = advancePositionWithClone(loc.start, loc.source, offset + length);\r\n    }\r\n    return newLoc;\r\n}\r\nfunction advancePositionWithClone(pos, source, numberOfCharacters = source.length) {\r\n    return advancePositionWithMutation(shared.extend({}, pos), source, numberOfCharacters);\r\n}\r\n// advance by mutation without cloning (for performance reasons), since this\r\n// gets called a lot in the parser\r\nfunction advancePositionWithMutation(pos, source, numberOfCharacters = source.length) {\r\n    let linesCount = 0;\r\n    let lastNewLinePos = -1;\r\n    for (let i = 0; i < numberOfCharacters; i++) {\r\n        if (source.charCodeAt(i) === 10 /* newline char code */) {\r\n            linesCount++;\r\n            lastNewLinePos = i;\r\n        }\r\n    }\r\n    pos.offset += numberOfCharacters;\r\n    pos.line += linesCount;\r\n    pos.column =\r\n        lastNewLinePos === -1\r\n            ? pos.column + numberOfCharacters\r\n            : numberOfCharacters - lastNewLinePos;\r\n    return pos;\r\n}\r\nfunction assert(condition, msg) {\r\n    /* istanbul ignore if */\r\n    if (!condition) {\r\n        throw new Error(msg || `unexpected compiler condition`);\r\n    }\r\n}\r\nfunction findDir(node, name, allowEmpty = false) {\r\n    for (let i = 0; i < node.props.length; i++) {\r\n        const p = node.props[i];\r\n        if (p.type === 7 /* DIRECTIVE */ &&\r\n            (allowEmpty || p.exp) &&\r\n            (shared.isString(name) ? p.name === name : name.test(p.name))) {\r\n            return p;\r\n        }\r\n    }\r\n}\r\nfunction findProp(node, name, dynamicOnly = false, allowEmpty = false) {\r\n    for (let i = 0; i < node.props.length; i++) {\r\n        const p = node.props[i];\r\n        if (p.type === 6 /* ATTRIBUTE */) {\r\n            if (dynamicOnly)\r\n                continue;\r\n            if (p.name === name && (p.value || allowEmpty)) {\r\n                return p;\r\n            }\r\n        }\r\n        else if (p.name === 'bind' &&\r\n            (p.exp || allowEmpty) &&\r\n            isBindKey(p.arg, name)) {\r\n            return p;\r\n        }\r\n    }\r\n}\r\nfunction isBindKey(arg, name) {\r\n    return !!(arg && isStaticExp(arg) && arg.content === name);\r\n}\r\nfunction hasDynamicKeyVBind(node) {\r\n    return node.props.some(p => p.type === 7 /* DIRECTIVE */ &&\r\n        p.name === 'bind' &&\r\n        (!p.arg || // v-bind=\"obj\"\r\n            p.arg.type !== 4 /* SIMPLE_EXPRESSION */ || // v-bind:[_ctx.foo]\r\n            !p.arg.isStatic) // v-bind:[foo]\r\n    );\r\n}\r\nfunction isText(node) {\r\n    return node.type === 5 /* INTERPOLATION */ || node.type === 2 /* TEXT */;\r\n}\r\nfunction isVSlot(p) {\r\n    return p.type === 7 /* DIRECTIVE */ && p.name === 'slot';\r\n}\r\nfunction isTemplateNode(node) {\r\n    return (node.type === 1 /* ELEMENT */ && node.tagType === 3 /* TEMPLATE */);\r\n}\r\nfunction isSlotOutlet(node) {\r\n    return node.type === 1 /* ELEMENT */ && node.tagType === 2 /* SLOT */;\r\n}\r\nfunction injectProp(node, prop, context) {\r\n    let propsWithInjection;\r\n    const props = node.type === 13 /* VNODE_CALL */ ? node.props : node.arguments[2];\r\n    if (props == null || shared.isString(props)) {\r\n        propsWithInjection = createObjectExpression([prop]);\r\n    }\r\n    else if (props.type === 14 /* JS_CALL_EXPRESSION */) {\r\n        // merged props... add ours\r\n        // only inject key to object literal if it's the first argument so that\r\n        // if doesn't override user provided keys\r\n        const first = props.arguments[0];\r\n        if (!shared.isString(first) && first.type === 15 /* JS_OBJECT_EXPRESSION */) {\r\n            first.properties.unshift(prop);\r\n        }\r\n        else {\r\n            if (props.callee === TO_HANDLERS) {\r\n                // #2366\r\n                propsWithInjection = createCallExpression(context.helper(MERGE_PROPS), [\r\n                    createObjectExpression([prop]),\r\n                    props\r\n                ]);\r\n            }\r\n            else {\r\n                props.arguments.unshift(createObjectExpression([prop]));\r\n            }\r\n        }\r\n        !propsWithInjection && (propsWithInjection = props);\r\n    }\r\n    else if (props.type === 15 /* JS_OBJECT_EXPRESSION */) {\r\n        let alreadyExists = false;\r\n        // check existing key to avoid overriding user provided keys\r\n        if (prop.key.type === 4 /* SIMPLE_EXPRESSION */) {\r\n            const propKeyName = prop.key.content;\r\n            alreadyExists = props.properties.some(p => p.key.type === 4 /* SIMPLE_EXPRESSION */ &&\r\n                p.key.content === propKeyName);\r\n        }\r\n        if (!alreadyExists) {\r\n            props.properties.unshift(prop);\r\n        }\r\n        propsWithInjection = props;\r\n    }\r\n    else {\r\n        // single v-bind with expression, return a merged replacement\r\n        propsWithInjection = createCallExpression(context.helper(MERGE_PROPS), [\r\n            createObjectExpression([prop]),\r\n            props\r\n        ]);\r\n    }\r\n    if (node.type === 13 /* VNODE_CALL */) {\r\n        node.props = propsWithInjection;\r\n    }\r\n    else {\r\n        node.arguments[2] = propsWithInjection;\r\n    }\r\n}\r\nfunction toValidAssetId(name, type) {\r\n    return `_${type}_${name.replace(/[^\\w]/g, '_')}`;\r\n}\r\n// Check if a node contains expressions that reference current context scope ids\r\nfunction hasScopeRef(node, ids) {\r\n    if (!node || Object.keys(ids).length === 0) {\r\n        return false;\r\n    }\r\n    switch (node.type) {\r\n        case 1 /* ELEMENT */:\r\n            for (let i = 0; i < node.props.length; i++) {\r\n                const p = node.props[i];\r\n                if (p.type === 7 /* DIRECTIVE */ &&\r\n                    (hasScopeRef(p.arg, ids) || hasScopeRef(p.exp, ids))) {\r\n                    return true;\r\n                }\r\n            }\r\n            return node.children.some(c => hasScopeRef(c, ids));\r\n        case 11 /* FOR */:\r\n            if (hasScopeRef(node.source, ids)) {\r\n                return true;\r\n            }\r\n            return node.children.some(c => hasScopeRef(c, ids));\r\n        case 9 /* IF */:\r\n            return node.branches.some(b => hasScopeRef(b, ids));\r\n        case 10 /* IF_BRANCH */:\r\n            if (hasScopeRef(node.condition, ids)) {\r\n                return true;\r\n            }\r\n            return node.children.some(c => hasScopeRef(c, ids));\r\n        case 4 /* SIMPLE_EXPRESSION */:\r\n            return (!node.isStatic &&\r\n                isSimpleIdentifier(node.content) &&\r\n                !!ids[node.content]);\r\n        case 8 /* COMPOUND_EXPRESSION */:\r\n            return node.children.some(c => shared.isObject(c) && hasScopeRef(c, ids));\r\n        case 5 /* INTERPOLATION */:\r\n        case 12 /* TEXT_CALL */:\r\n            return hasScopeRef(node.content, ids);\r\n        case 2 /* TEXT */:\r\n        case 3 /* COMMENT */:\r\n            return false;\r\n        default:\r\n            return false;\r\n    }\r\n}\n\nconst deprecationData = {\r\n    [\"COMPILER_IS_ON_ELEMENT\" /* COMPILER_IS_ON_ELEMENT */]: {\r\n        message: `Platform-native elements with \"is\" prop will no longer be ` +\r\n            `treated as components in Vue 3 unless the \"is\" value is explicitly ` +\r\n            `prefixed with \"vue:\".`,\r\n        link: `https://v3.vuejs.org/guide/migration/custom-elements-interop.html`\r\n    },\r\n    [\"COMPILER_V_BIND_SYNC\" /* COMPILER_V_BIND_SYNC */]: {\r\n        message: key => `.sync modifier for v-bind has been removed. Use v-model with ` +\r\n            `argument instead. \\`v-bind:${key}.sync\\` should be changed to ` +\r\n            `\\`v-model:${key}\\`.`,\r\n        link: `https://v3.vuejs.org/guide/migration/v-model.html`\r\n    },\r\n    [\"COMPILER_V_BIND_PROP\" /* COMPILER_V_BIND_PROP */]: {\r\n        message: `.prop modifier for v-bind has been removed and no longer necessary. ` +\r\n            `Vue 3 will automatically set a binding as DOM property when appropriate.`\r\n    },\r\n    [\"COMPILER_V_BIND_OBJECT_ORDER\" /* COMPILER_V_BIND_OBJECT_ORDER */]: {\r\n        message: `v-bind=\"obj\" usage is now order sensitive and behaves like JavaScript ` +\r\n            `object spread: it will now overwrite an existing non-mergeable attribute ` +\r\n            `that appears before v-bind in the case of conflict. ` +\r\n            `To retain 2.x behavior, move v-bind to make it the first attribute. ` +\r\n            `You can also suppress this warning if the usage is intended.`,\r\n        link: `https://v3.vuejs.org/guide/migration/v-bind.html`\r\n    },\r\n    [\"COMPILER_V_ON_NATIVE\" /* COMPILER_V_ON_NATIVE */]: {\r\n        message: `.native modifier for v-on has been removed as is no longer necessary.`,\r\n        link: `https://v3.vuejs.org/guide/migration/v-on-native-modifier-removed.html`\r\n    },\r\n    [\"COMPILER_V_IF_V_FOR_PRECEDENCE\" /* COMPILER_V_IF_V_FOR_PRECEDENCE */]: {\r\n        message: `v-if / v-for precedence when used on the same element has changed ` +\r\n            `in Vue 3: v-if now takes higher precedence and will no longer have ` +\r\n            `access to v-for scope variables. It is best to avoid the ambiguity ` +\r\n            `with <template> tags or use a computed property that filters v-for ` +\r\n            `data source.`,\r\n        link: `https://v3.vuejs.org/guide/migration/v-if-v-for.html`\r\n    },\r\n    [\"COMPILER_V_FOR_REF\" /* COMPILER_V_FOR_REF */]: {\r\n        message: `Ref usage on v-for no longer creates array ref values in Vue 3. ` +\r\n            `Consider using function refs or refactor to avoid ref usage altogether.`,\r\n        link: `https://v3.vuejs.org/guide/migration/array-refs.html`\r\n    },\r\n    [\"COMPILER_NATIVE_TEMPLATE\" /* COMPILER_NATIVE_TEMPLATE */]: {\r\n        message: `<template> with no special directives will render as a native template ` +\r\n            `element instead of its inner content in Vue 3.`\r\n    },\r\n    [\"COMPILER_INLINE_TEMPLATE\" /* COMPILER_INLINE_TEMPLATE */]: {\r\n        message: `\"inline-template\" has been removed in Vue 3.`,\r\n        link: `https://v3.vuejs.org/guide/migration/inline-template-attribute.html`\r\n    },\r\n    [\"COMPILER_FILTER\" /* COMPILER_FILTERS */]: {\r\n        message: `filters have been removed in Vue 3. ` +\r\n            `The \"|\" symbol will be treated as native JavaScript bitwise OR operator. ` +\r\n            `Use method calls or computed properties instead.`,\r\n        link: `https://v3.vuejs.org/guide/migration/filters.html`\r\n    }\r\n};\r\nfunction getCompatValue(key, context) {\r\n    const config = context.options\r\n        ? context.options.compatConfig\r\n        : context.compatConfig;\r\n    const value = config && config[key];\r\n    if (key === 'MODE') {\r\n        return value || 3; // compiler defaults to v3 behavior\r\n    }\r\n    else {\r\n        return value;\r\n    }\r\n}\r\nfunction isCompatEnabled(key, context) {\r\n    const mode = getCompatValue('MODE', context);\r\n    const value = getCompatValue(key, context);\r\n    // in v3 mode, only enable if explicitly set to true\r\n    // otherwise enable for any non-false value\r\n    return mode === 3 ? value === true : value !== false;\r\n}\r\nfunction checkCompatEnabled(key, context, loc, ...args) {\r\n    const enabled = isCompatEnabled(key, context);\r\n    return enabled;\r\n}\r\nfunction warnDeprecation(key, context, loc, ...args) {\r\n    const val = getCompatValue(key, context);\r\n    if (val === 'suppress-warning') {\r\n        return;\r\n    }\r\n    const { message, link } = deprecationData[key];\r\n    const msg = `(deprecation ${key}) ${typeof message === 'function' ? message(...args) : message}${link ? `\\n  Details: ${link}` : ``}`;\r\n    const err = new SyntaxError(msg);\r\n    err.code = key;\r\n    if (loc)\r\n        err.loc = loc;\r\n    context.onWarn(err);\r\n}\n\n// The default decoder only provides escapes for characters reserved as part of\r\n// the template syntax, and is only used if the custom renderer did not provide\r\n// a platform-specific decoder.\r\nconst decodeRE = /&(gt|lt|amp|apos|quot);/g;\r\nconst decodeMap = {\r\n    gt: '>',\r\n    lt: '<',\r\n    amp: '&',\r\n    apos: \"'\",\r\n    quot: '\"'\r\n};\r\nconst defaultParserOptions = {\r\n    delimiters: [`{{`, `}}`],\r\n    getNamespace: () => 0 /* HTML */,\r\n    getTextMode: () => 0 /* DATA */,\r\n    isVoidTag: shared.NO,\r\n    isPreTag: shared.NO,\r\n    isCustomElement: shared.NO,\r\n    decodeEntities: (rawText) => rawText.replace(decodeRE, (_, p1) => decodeMap[p1]),\r\n    onError: defaultOnError,\r\n    onWarn: defaultOnWarn,\r\n    comments: false\r\n};\r\nfunction baseParse(content, options = {}) {\r\n    const context = createParserContext(content, options);\r\n    const start = getCursor(context);\r\n    return createRoot(parseChildren(context, 0 /* DATA */, []), getSelection(context, start));\r\n}\r\nfunction createParserContext(content, rawOptions) {\r\n    const options = shared.extend({}, defaultParserOptions);\r\n    for (const key in rawOptions) {\r\n        // @ts-ignore\r\n        options[key] = rawOptions[key] || defaultParserOptions[key];\r\n    }\r\n    return {\r\n        options,\r\n        column: 1,\r\n        line: 1,\r\n        offset: 0,\r\n        originalSource: content,\r\n        source: content,\r\n        inPre: false,\r\n        inVPre: false,\r\n        onWarn: options.onWarn\r\n    };\r\n}\r\nfunction parseChildren(context, mode, ancestors) {\r\n    const parent = last(ancestors);\r\n    const ns = parent ? parent.ns : 0 /* HTML */;\r\n    const nodes = [];\r\n    while (!isEnd(context, mode, ancestors)) {\r\n        const s = context.source;\r\n        let node = undefined;\r\n        if (mode === 0 /* DATA */ || mode === 1 /* RCDATA */) {\r\n            if (!context.inVPre && startsWith(s, context.options.delimiters[0])) {\r\n                // '{{'\r\n                node = parseInterpolation(context, mode);\r\n            }\r\n            else if (mode === 0 /* DATA */ && s[0] === '<') {\r\n                // https://html.spec.whatwg.org/multipage/parsing.html#tag-open-state\r\n                if (s.length === 1) {\r\n                    emitError(context, 5 /* EOF_BEFORE_TAG_NAME */, 1);\r\n                }\r\n                else if (s[1] === '!') {\r\n                    // https://html.spec.whatwg.org/multipage/parsing.html#markup-declaration-open-state\r\n                    if (startsWith(s, '<!--')) {\r\n                        node = parseComment(context);\r\n                    }\r\n                    else if (startsWith(s, '<!DOCTYPE')) {\r\n                        // Ignore DOCTYPE by a limitation.\r\n                        node = parseBogusComment(context);\r\n                    }\r\n                    else if (startsWith(s, '<![CDATA[')) {\r\n                        if (ns !== 0 /* HTML */) {\r\n                            node = parseCDATA(context, ancestors);\r\n                        }\r\n                        else {\r\n                            emitError(context, 1 /* CDATA_IN_HTML_CONTENT */);\r\n                            node = parseBogusComment(context);\r\n                        }\r\n                    }\r\n                    else {\r\n                        emitError(context, 11 /* INCORRECTLY_OPENED_COMMENT */);\r\n                        node = parseBogusComment(context);\r\n                    }\r\n                }\r\n                else if (s[1] === '/') {\r\n                    // https://html.spec.whatwg.org/multipage/parsing.html#end-tag-open-state\r\n                    if (s.length === 2) {\r\n                        emitError(context, 5 /* EOF_BEFORE_TAG_NAME */, 2);\r\n                    }\r\n                    else if (s[2] === '>') {\r\n                        emitError(context, 14 /* MISSING_END_TAG_NAME */, 2);\r\n                        advanceBy(context, 3);\r\n                        continue;\r\n                    }\r\n                    else if (/[a-z]/i.test(s[2])) {\r\n                        emitError(context, 23 /* X_INVALID_END_TAG */);\r\n                        parseTag(context, 1 /* End */, parent);\r\n                        continue;\r\n                    }\r\n                    else {\r\n                        emitError(context, 12 /* INVALID_FIRST_CHARACTER_OF_TAG_NAME */, 2);\r\n                        node = parseBogusComment(context);\r\n                    }\r\n                }\r\n                else if (/[a-z]/i.test(s[1])) {\r\n                    node = parseElement(context, ancestors);\r\n                    // 2.x <template> with no directive compat\r\n                    if (isCompatEnabled(\"COMPILER_NATIVE_TEMPLATE\" /* COMPILER_NATIVE_TEMPLATE */, context) &&\r\n                        node &&\r\n                        node.tag === 'template' &&\r\n                        !node.props.some(p => p.type === 7 /* DIRECTIVE */ &&\r\n                            isSpecialTemplateDirective(p.name))) {\r\n                        node = node.children;\r\n                    }\r\n                }\r\n                else if (s[1] === '?') {\r\n                    emitError(context, 21 /* UNEXPECTED_QUESTION_MARK_INSTEAD_OF_TAG_NAME */, 1);\r\n                    node = parseBogusComment(context);\r\n                }\r\n                else {\r\n                    emitError(context, 12 /* INVALID_FIRST_CHARACTER_OF_TAG_NAME */, 1);\r\n                }\r\n            }\r\n        }\r\n        if (!node) {\r\n            node = parseText(context, mode);\r\n        }\r\n        if (shared.isArray(node)) {\r\n            for (let i = 0; i < node.length; i++) {\r\n                pushNode(nodes, node[i]);\r\n            }\r\n        }\r\n        else {\r\n            pushNode(nodes, node);\r\n        }\r\n    }\r\n    // Whitespace handling strategy like v2\r\n    let removedWhitespace = false;\r\n    if (mode !== 2 /* RAWTEXT */ && mode !== 1 /* RCDATA */) {\r\n        const preserve = context.options.whitespace === 'preserve';\r\n        for (let i = 0; i < nodes.length; i++) {\r\n            const node = nodes[i];\r\n            if (!context.inPre && node.type === 2 /* TEXT */) {\r\n                if (!/[^\\t\\r\\n\\f ]/.test(node.content)) {\r\n                    const prev = nodes[i - 1];\r\n                    const next = nodes[i + 1];\r\n                    // Remove if:\r\n                    // - the whitespace is the first or last node, or:\r\n                    // - (condense mode) the whitespace is adjacent to a comment, or:\r\n                    // - (condense mode) the whitespace is between two elements AND contains newline\r\n                    if (!prev ||\r\n                        !next ||\r\n                        (!preserve &&\r\n                            (prev.type === 3 /* COMMENT */ ||\r\n                                next.type === 3 /* COMMENT */ ||\r\n                                (prev.type === 1 /* ELEMENT */ &&\r\n                                    next.type === 1 /* ELEMENT */ &&\r\n                                    /[\\r\\n]/.test(node.content))))) {\r\n                        removedWhitespace = true;\r\n                        nodes[i] = null;\r\n                    }\r\n                    else {\r\n                        // Otherwise, the whitespace is condensed into a single space\r\n                        node.content = ' ';\r\n                    }\r\n                }\r\n                else if (!preserve) {\r\n                    // in condense mode, consecutive whitespaces in text are condensed\r\n                    // down to a single space.\r\n                    node.content = node.content.replace(/[\\t\\r\\n\\f ]+/g, ' ');\r\n                }\r\n            }\r\n            // also remove comment nodes in prod by default\r\n            if (node.type === 3 /* COMMENT */ &&\r\n                !context.options.comments) {\r\n                removedWhitespace = true;\r\n                nodes[i] = null;\r\n            }\r\n        }\r\n        if (context.inPre && parent && context.options.isPreTag(parent.tag)) {\r\n            // remove leading newline per html spec\r\n            // https://html.spec.whatwg.org/multipage/grouping-content.html#the-pre-element\r\n            const first = nodes[0];\r\n            if (first && first.type === 2 /* TEXT */) {\r\n                first.content = first.content.replace(/^\\r?\\n/, '');\r\n            }\r\n        }\r\n    }\r\n    return removedWhitespace ? nodes.filter(Boolean) : nodes;\r\n}\r\nfunction pushNode(nodes, node) {\r\n    if (node.type === 2 /* TEXT */) {\r\n        const prev = last(nodes);\r\n        // Merge if both this and the previous node are text and those are\r\n        // consecutive. This happens for cases like \"a < b\".\r\n        if (prev &&\r\n            prev.type === 2 /* TEXT */ &&\r\n            prev.loc.end.offset === node.loc.start.offset) {\r\n            prev.content += node.content;\r\n            prev.loc.end = node.loc.end;\r\n            prev.loc.source += node.loc.source;\r\n            return;\r\n        }\r\n    }\r\n    nodes.push(node);\r\n}\r\nfunction parseCDATA(context, ancestors) {\r\n    advanceBy(context, 9);\r\n    const nodes = parseChildren(context, 3 /* CDATA */, ancestors);\r\n    if (context.source.length === 0) {\r\n        emitError(context, 6 /* EOF_IN_CDATA */);\r\n    }\r\n    else {\r\n        advanceBy(context, 3);\r\n    }\r\n    return nodes;\r\n}\r\nfunction parseComment(context) {\r\n    const start = getCursor(context);\r\n    let content;\r\n    // Regular comment.\r\n    const match = /--(\\!)?>/.exec(context.source);\r\n    if (!match) {\r\n        content = context.source.slice(4);\r\n        advanceBy(context, context.source.length);\r\n        emitError(context, 7 /* EOF_IN_COMMENT */);\r\n    }\r\n    else {\r\n        if (match.index <= 3) {\r\n            emitError(context, 0 /* ABRUPT_CLOSING_OF_EMPTY_COMMENT */);\r\n        }\r\n        if (match[1]) {\r\n            emitError(context, 10 /* INCORRECTLY_CLOSED_COMMENT */);\r\n        }\r\n        content = context.source.slice(4, match.index);\r\n        // Advancing with reporting nested comments.\r\n        const s = context.source.slice(0, match.index);\r\n        let prevIndex = 1, nestedIndex = 0;\r\n        while ((nestedIndex = s.indexOf('<!--', prevIndex)) !== -1) {\r\n            advanceBy(context, nestedIndex - prevIndex + 1);\r\n            if (nestedIndex + 4 < s.length) {\r\n                emitError(context, 16 /* NESTED_COMMENT */);\r\n            }\r\n            prevIndex = nestedIndex + 1;\r\n        }\r\n        advanceBy(context, match.index + match[0].length - prevIndex + 1);\r\n    }\r\n    return {\r\n        type: 3 /* COMMENT */,\r\n        content,\r\n        loc: getSelection(context, start)\r\n    };\r\n}\r\nfunction parseBogusComment(context) {\r\n    const start = getCursor(context);\r\n    const contentStart = context.source[1] === '?' ? 1 : 2;\r\n    let content;\r\n    const closeIndex = context.source.indexOf('>');\r\n    if (closeIndex === -1) {\r\n        content = context.source.slice(contentStart);\r\n        advanceBy(context, context.source.length);\r\n    }\r\n    else {\r\n        content = context.source.slice(contentStart, closeIndex);\r\n        advanceBy(context, closeIndex + 1);\r\n    }\r\n    return {\r\n        type: 3 /* COMMENT */,\r\n        content,\r\n        loc: getSelection(context, start)\r\n    };\r\n}\r\nfunction parseElement(context, ancestors) {\r\n    // Start tag.\r\n    const wasInPre = context.inPre;\r\n    const wasInVPre = context.inVPre;\r\n    const parent = last(ancestors);\r\n    const element = parseTag(context, 0 /* Start */, parent);\r\n    const isPreBoundary = context.inPre && !wasInPre;\r\n    const isVPreBoundary = context.inVPre && !wasInVPre;\r\n    if (element.isSelfClosing || context.options.isVoidTag(element.tag)) {\r\n        return element;\r\n    }\r\n    // Children.\r\n    ancestors.push(element);\r\n    const mode = context.options.getTextMode(element, parent);\r\n    const children = parseChildren(context, mode, ancestors);\r\n    ancestors.pop();\r\n    // 2.x inline-template compat\r\n    {\r\n        const inlineTemplateProp = element.props.find(p => p.type === 6 /* ATTRIBUTE */ && p.name === 'inline-template');\r\n        if (inlineTemplateProp &&\r\n            checkCompatEnabled(\"COMPILER_INLINE_TEMPLATE\" /* COMPILER_INLINE_TEMPLATE */, context, inlineTemplateProp.loc)) {\r\n            const loc = getSelection(context, element.loc.end);\r\n            inlineTemplateProp.value = {\r\n                type: 2 /* TEXT */,\r\n                content: loc.source,\r\n                loc\r\n            };\r\n        }\r\n    }\r\n    element.children = children;\r\n    // End tag.\r\n    if (startsWithEndTagOpen(context.source, element.tag)) {\r\n        parseTag(context, 1 /* End */, parent);\r\n    }\r\n    else {\r\n        emitError(context, 24 /* X_MISSING_END_TAG */, 0, element.loc.start);\r\n        if (context.source.length === 0 && element.tag.toLowerCase() === 'script') {\r\n            const first = children[0];\r\n            if (first && startsWith(first.loc.source, '<!--')) {\r\n                emitError(context, 8 /* EOF_IN_SCRIPT_HTML_COMMENT_LIKE_TEXT */);\r\n            }\r\n        }\r\n    }\r\n    element.loc = getSelection(context, element.loc.start);\r\n    if (isPreBoundary) {\r\n        context.inPre = false;\r\n    }\r\n    if (isVPreBoundary) {\r\n        context.inVPre = false;\r\n    }\r\n    return element;\r\n}\r\nconst isSpecialTemplateDirective = /*#__PURE__*/ shared.makeMap(`if,else,else-if,for,slot`);\r\nfunction parseTag(context, type, parent) {\r\n    // Tag open.\r\n    const start = getCursor(context);\r\n    const match = /^<\\/?([a-z][^\\t\\r\\n\\f />]*)/i.exec(context.source);\r\n    const tag = match[1];\r\n    const ns = context.options.getNamespace(tag, parent);\r\n    advanceBy(context, match[0].length);\r\n    advanceSpaces(context);\r\n    // save current state in case we need to re-parse attributes with v-pre\r\n    const cursor = getCursor(context);\r\n    const currentSource = context.source;\r\n    // Attributes.\r\n    let props = parseAttributes(context, type);\r\n    // check <pre> tag\r\n    if (context.options.isPreTag(tag)) {\r\n        context.inPre = true;\r\n    }\r\n    // check v-pre\r\n    if (type === 0 /* Start */ &&\r\n        !context.inVPre &&\r\n        props.some(p => p.type === 7 /* DIRECTIVE */ && p.name === 'pre')) {\r\n        context.inVPre = true;\r\n        // reset context\r\n        shared.extend(context, cursor);\r\n        context.source = currentSource;\r\n        // re-parse attrs and filter out v-pre itself\r\n        props = parseAttributes(context, type).filter(p => p.name !== 'v-pre');\r\n    }\r\n    // Tag close.\r\n    let isSelfClosing = false;\r\n    if (context.source.length === 0) {\r\n        emitError(context, 9 /* EOF_IN_TAG */);\r\n    }\r\n    else {\r\n        isSelfClosing = startsWith(context.source, '/>');\r\n        if (type === 1 /* End */ && isSelfClosing) {\r\n            emitError(context, 4 /* END_TAG_WITH_TRAILING_SOLIDUS */);\r\n        }\r\n        advanceBy(context, isSelfClosing ? 2 : 1);\r\n    }\r\n    if (type === 1 /* End */) {\r\n        return;\r\n    }\r\n    let tagType = 0 /* ELEMENT */;\r\n    const options = context.options;\r\n    if (!context.inVPre && !options.isCustomElement(tag)) {\r\n        const hasVIs = props.some(p => {\r\n            if (p.name !== 'is')\r\n                return;\r\n            // v-is=\"xxx\" (TODO: deprecate)\r\n            if (p.type === 7 /* DIRECTIVE */) {\r\n                return true;\r\n            }\r\n            // is=\"vue:xxx\"\r\n            if (p.value && p.value.content.startsWith('vue:')) {\r\n                return true;\r\n            }\r\n            // in compat mode, any is usage is considered a component\r\n            if (checkCompatEnabled(\"COMPILER_IS_ON_ELEMENT\" /* COMPILER_IS_ON_ELEMENT */, context, p.loc)) {\r\n                return true;\r\n            }\r\n        });\r\n        if (options.isNativeTag && !hasVIs) {\r\n            if (!options.isNativeTag(tag))\r\n                tagType = 1 /* COMPONENT */;\r\n        }\r\n        else if (hasVIs ||\r\n            isCoreComponent(tag) ||\r\n            (options.isBuiltInComponent && options.isBuiltInComponent(tag)) ||\r\n            /^[A-Z]/.test(tag) ||\r\n            tag === 'component') {\r\n            tagType = 1 /* COMPONENT */;\r\n        }\r\n        if (tag === 'slot') {\r\n            tagType = 2 /* SLOT */;\r\n        }\r\n        else if (tag === 'template' &&\r\n            props.some(p => p.type === 7 /* DIRECTIVE */ && isSpecialTemplateDirective(p.name))) {\r\n            tagType = 3 /* TEMPLATE */;\r\n        }\r\n    }\r\n    return {\r\n        type: 1 /* ELEMENT */,\r\n        ns,\r\n        tag,\r\n        tagType,\r\n        props,\r\n        isSelfClosing,\r\n        children: [],\r\n        loc: getSelection(context, start),\r\n        codegenNode: undefined // to be created during transform phase\r\n    };\r\n}\r\nfunction parseAttributes(context, type) {\r\n    const props = [];\r\n    const attributeNames = new Set();\r\n    while (context.source.length > 0 &&\r\n        !startsWith(context.source, '>') &&\r\n        !startsWith(context.source, '/>')) {\r\n        if (startsWith(context.source, '/')) {\r\n            emitError(context, 22 /* UNEXPECTED_SOLIDUS_IN_TAG */);\r\n            advanceBy(context, 1);\r\n            advanceSpaces(context);\r\n            continue;\r\n        }\r\n        if (type === 1 /* End */) {\r\n            emitError(context, 3 /* END_TAG_WITH_ATTRIBUTES */);\r\n        }\r\n        const attr = parseAttribute(context, attributeNames);\r\n        if (type === 0 /* Start */) {\r\n            props.push(attr);\r\n        }\r\n        if (/^[^\\t\\r\\n\\f />]/.test(context.source)) {\r\n            emitError(context, 15 /* MISSING_WHITESPACE_BETWEEN_ATTRIBUTES */);\r\n        }\r\n        advanceSpaces(context);\r\n    }\r\n    return props;\r\n}\r\nfunction parseAttribute(context, nameSet) {\r\n    // Name.\r\n    const start = getCursor(context);\r\n    const match = /^[^\\t\\r\\n\\f />][^\\t\\r\\n\\f />=]*/.exec(context.source);\r\n    const name = match[0];\r\n    if (nameSet.has(name)) {\r\n        emitError(context, 2 /* DUPLICATE_ATTRIBUTE */);\r\n    }\r\n    nameSet.add(name);\r\n    if (name[0] === '=') {\r\n        emitError(context, 19 /* UNEXPECTED_EQUALS_SIGN_BEFORE_ATTRIBUTE_NAME */);\r\n    }\r\n    {\r\n        const pattern = /[\"'<]/g;\r\n        let m;\r\n        while ((m = pattern.exec(name))) {\r\n            emitError(context, 17 /* UNEXPECTED_CHARACTER_IN_ATTRIBUTE_NAME */, m.index);\r\n        }\r\n    }\r\n    advanceBy(context, name.length);\r\n    // Value\r\n    let value = undefined;\r\n    if (/^[\\t\\r\\n\\f ]*=/.test(context.source)) {\r\n        advanceSpaces(context);\r\n        advanceBy(context, 1);\r\n        advanceSpaces(context);\r\n        value = parseAttributeValue(context);\r\n        if (!value) {\r\n            emitError(context, 13 /* MISSING_ATTRIBUTE_VALUE */);\r\n        }\r\n    }\r\n    const loc = getSelection(context, start);\r\n    if (!context.inVPre && /^(v-|:|@|#)/.test(name)) {\r\n        const match = /(?:^v-([a-z0-9-]+))?(?:(?::|^@|^#)(\\[[^\\]]+\\]|[^\\.]+))?(.+)?$/i.exec(name);\r\n        let dirName = match[1] ||\r\n            (startsWith(name, ':') ? 'bind' : startsWith(name, '@') ? 'on' : 'slot');\r\n        let arg;\r\n        if (match[2]) {\r\n            const isSlot = dirName === 'slot';\r\n            const startOffset = name.lastIndexOf(match[2]);\r\n            const loc = getSelection(context, getNewPosition(context, start, startOffset), getNewPosition(context, start, startOffset + match[2].length + ((isSlot && match[3]) || '').length));\r\n            let content = match[2];\r\n            let isStatic = true;\r\n            if (content.startsWith('[')) {\r\n                isStatic = false;\r\n                if (!content.endsWith(']')) {\r\n                    emitError(context, 26 /* X_MISSING_DYNAMIC_DIRECTIVE_ARGUMENT_END */);\r\n                }\r\n                content = content.substr(1, content.length - 2);\r\n            }\r\n            else if (isSlot) {\r\n                // #1241 special case for v-slot: vuetify relies extensively on slot\r\n                // names containing dots. v-slot doesn't have any modifiers and Vue 2.x\r\n                // supports such usage so we are keeping it consistent with 2.x.\r\n                content += match[3] || '';\r\n            }\r\n            arg = {\r\n                type: 4 /* SIMPLE_EXPRESSION */,\r\n                content,\r\n                isStatic,\r\n                constType: isStatic\r\n                    ? 3 /* CAN_STRINGIFY */\r\n                    : 0 /* NOT_CONSTANT */,\r\n                loc\r\n            };\r\n        }\r\n        if (value && value.isQuoted) {\r\n            const valueLoc = value.loc;\r\n            valueLoc.start.offset++;\r\n            valueLoc.start.column++;\r\n            valueLoc.end = advancePositionWithClone(valueLoc.start, value.content);\r\n            valueLoc.source = valueLoc.source.slice(1, -1);\r\n        }\r\n        const modifiers = match[3] ? match[3].substr(1).split('.') : [];\r\n        // 2.x compat v-bind:foo.sync -> v-model:foo\r\n        if (dirName === 'bind' && arg) {\r\n            if (modifiers.includes('sync') &&\r\n                checkCompatEnabled(\"COMPILER_V_BIND_SYNC\" /* COMPILER_V_BIND_SYNC */, context, loc, arg.loc.source)) {\r\n                dirName = 'model';\r\n                modifiers.splice(modifiers.indexOf('sync'), 1);\r\n            }\r\n        }\r\n        return {\r\n            type: 7 /* DIRECTIVE */,\r\n            name: dirName,\r\n            exp: value && {\r\n                type: 4 /* SIMPLE_EXPRESSION */,\r\n                content: value.content,\r\n                isStatic: false,\r\n                // Treat as non-constant by default. This can be potentially set to\r\n                // other values by `transformExpression` to make it eligible for hoisting.\r\n                constType: 0 /* NOT_CONSTANT */,\r\n                loc: value.loc\r\n            },\r\n            arg,\r\n            modifiers,\r\n            loc\r\n        };\r\n    }\r\n    return {\r\n        type: 6 /* ATTRIBUTE */,\r\n        name,\r\n        value: value && {\r\n            type: 2 /* TEXT */,\r\n            content: value.content,\r\n            loc: value.loc\r\n        },\r\n        loc\r\n    };\r\n}\r\nfunction parseAttributeValue(context) {\r\n    const start = getCursor(context);\r\n    let content;\r\n    const quote = context.source[0];\r\n    const isQuoted = quote === `\"` || quote === `'`;\r\n    if (isQuoted) {\r\n        // Quoted value.\r\n        advanceBy(context, 1);\r\n        const endIndex = context.source.indexOf(quote);\r\n        if (endIndex === -1) {\r\n            content = parseTextData(context, context.source.length, 4 /* ATTRIBUTE_VALUE */);\r\n        }\r\n        else {\r\n            content = parseTextData(context, endIndex, 4 /* ATTRIBUTE_VALUE */);\r\n            advanceBy(context, 1);\r\n        }\r\n    }\r\n    else {\r\n        // Unquoted\r\n        const match = /^[^\\t\\r\\n\\f >]+/.exec(context.source);\r\n        if (!match) {\r\n            return undefined;\r\n        }\r\n        const unexpectedChars = /[\"'<=`]/g;\r\n        let m;\r\n        while ((m = unexpectedChars.exec(match[0]))) {\r\n            emitError(context, 18 /* UNEXPECTED_CHARACTER_IN_UNQUOTED_ATTRIBUTE_VALUE */, m.index);\r\n        }\r\n        content = parseTextData(context, match[0].length, 4 /* ATTRIBUTE_VALUE */);\r\n    }\r\n    return { content, isQuoted, loc: getSelection(context, start) };\r\n}\r\nfunction parseInterpolation(context, mode) {\r\n    const [open, close] = context.options.delimiters;\r\n    const closeIndex = context.source.indexOf(close, open.length);\r\n    if (closeIndex === -1) {\r\n        emitError(context, 25 /* X_MISSING_INTERPOLATION_END */);\r\n        return undefined;\r\n    }\r\n    const start = getCursor(context);\r\n    advanceBy(context, open.length);\r\n    const innerStart = getCursor(context);\r\n    const innerEnd = getCursor(context);\r\n    const rawContentLength = closeIndex - open.length;\r\n    const rawContent = context.source.slice(0, rawContentLength);\r\n    const preTrimContent = parseTextData(context, rawContentLength, mode);\r\n    const content = preTrimContent.trim();\r\n    const startOffset = preTrimContent.indexOf(content);\r\n    if (startOffset > 0) {\r\n        advancePositionWithMutation(innerStart, rawContent, startOffset);\r\n    }\r\n    const endOffset = rawContentLength - (preTrimContent.length - content.length - startOffset);\r\n    advancePositionWithMutation(innerEnd, rawContent, endOffset);\r\n    advanceBy(context, close.length);\r\n    return {\r\n        type: 5 /* INTERPOLATION */,\r\n        content: {\r\n            type: 4 /* SIMPLE_EXPRESSION */,\r\n            isStatic: false,\r\n            // Set `isConstant` to false by default and will decide in transformExpression\r\n            constType: 0 /* NOT_CONSTANT */,\r\n            content,\r\n            loc: getSelection(context, innerStart, innerEnd)\r\n        },\r\n        loc: getSelection(context, start)\r\n    };\r\n}\r\nfunction parseText(context, mode) {\r\n    const endTokens = ['<', context.options.delimiters[0]];\r\n    if (mode === 3 /* CDATA */) {\r\n        endTokens.push(']]>');\r\n    }\r\n    let endIndex = context.source.length;\r\n    for (let i = 0; i < endTokens.length; i++) {\r\n        const index = context.source.indexOf(endTokens[i], 1);\r\n        if (index !== -1 && endIndex > index) {\r\n            endIndex = index;\r\n        }\r\n    }\r\n    const start = getCursor(context);\r\n    const content = parseTextData(context, endIndex, mode);\r\n    return {\r\n        type: 2 /* TEXT */,\r\n        content,\r\n        loc: getSelection(context, start)\r\n    };\r\n}\r\n/**\r\n * Get text data with a given length from the current location.\r\n * This translates HTML entities in the text data.\r\n */\r\nfunction parseTextData(context, length, mode) {\r\n    const rawText = context.source.slice(0, length);\r\n    advanceBy(context, length);\r\n    if (mode === 2 /* RAWTEXT */ ||\r\n        mode === 3 /* CDATA */ ||\r\n        rawText.indexOf('&') === -1) {\r\n        return rawText;\r\n    }\r\n    else {\r\n        // DATA or RCDATA containing \"&\"\". Entity decoding required.\r\n        return context.options.decodeEntities(rawText, mode === 4 /* ATTRIBUTE_VALUE */);\r\n    }\r\n}\r\nfunction getCursor(context) {\r\n    const { column, line, offset } = context;\r\n    return { column, line, offset };\r\n}\r\nfunction getSelection(context, start, end) {\r\n    end = end || getCursor(context);\r\n    return {\r\n        start,\r\n        end,\r\n        source: context.originalSource.slice(start.offset, end.offset)\r\n    };\r\n}\r\nfunction last(xs) {\r\n    return xs[xs.length - 1];\r\n}\r\nfunction startsWith(source, searchString) {\r\n    return source.startsWith(searchString);\r\n}\r\nfunction advanceBy(context, numberOfCharacters) {\r\n    const { source } = context;\r\n    advancePositionWithMutation(context, source, numberOfCharacters);\r\n    context.source = source.slice(numberOfCharacters);\r\n}\r\nfunction advanceSpaces(context) {\r\n    const match = /^[\\t\\r\\n\\f ]+/.exec(context.source);\r\n    if (match) {\r\n        advanceBy(context, match[0].length);\r\n    }\r\n}\r\nfunction getNewPosition(context, start, numberOfCharacters) {\r\n    return advancePositionWithClone(start, context.originalSource.slice(start.offset, numberOfCharacters), numberOfCharacters);\r\n}\r\nfunction emitError(context, code, offset, loc = getCursor(context)) {\r\n    if (offset) {\r\n        loc.offset += offset;\r\n        loc.column += offset;\r\n    }\r\n    context.options.onError(createCompilerError(code, {\r\n        start: loc,\r\n        end: loc,\r\n        source: ''\r\n    }));\r\n}\r\nfunction isEnd(context, mode, ancestors) {\r\n    const s = context.source;\r\n    switch (mode) {\r\n        case 0 /* DATA */:\r\n            if (startsWith(s, '</')) {\r\n                // TODO: probably bad performance\r\n                for (let i = ancestors.length - 1; i >= 0; --i) {\r\n                    if (startsWithEndTagOpen(s, ancestors[i].tag)) {\r\n                        return true;\r\n                    }\r\n                }\r\n            }\r\n            break;\r\n        case 1 /* RCDATA */:\r\n        case 2 /* RAWTEXT */: {\r\n            const parent = last(ancestors);\r\n            if (parent && startsWithEndTagOpen(s, parent.tag)) {\r\n                return true;\r\n            }\r\n            break;\r\n        }\r\n        case 3 /* CDATA */:\r\n            if (startsWith(s, ']]>')) {\r\n                return true;\r\n            }\r\n            break;\r\n    }\r\n    return !s;\r\n}\r\nfunction startsWithEndTagOpen(source, tag) {\r\n    return (startsWith(source, '</') &&\r\n        source.substr(2, tag.length).toLowerCase() === tag.toLowerCase() &&\r\n        /[\\t\\r\\n\\f />]/.test(source[2 + tag.length] || '>'));\r\n}\n\nfunction hoistStatic(root, context) {\r\n    walk(root, context, \r\n    // Root node is unfortunately non-hoistable due to potential parent\r\n    // fallthrough attributes.\r\n    isSingleElementRoot(root, root.children[0]));\r\n}\r\nfunction isSingleElementRoot(root, child) {\r\n    const { children } = root;\r\n    return (children.length === 1 &&\r\n        child.type === 1 /* ELEMENT */ &&\r\n        !isSlotOutlet(child));\r\n}\r\nfunction walk(node, context, doNotHoistNode = false) {\r\n    let hasHoistedNode = false;\r\n    // Some transforms, e.g. transformAssetUrls from @vue/compiler-sfc, replaces\r\n    // static bindings with expressions. These expressions are guaranteed to be\r\n    // constant so they are still eligible for hoisting, but they are only\r\n    // available at runtime and therefore cannot be evaluated ahead of time.\r\n    // This is only a concern for pre-stringification (via transformHoist by\r\n    // @vue/compiler-dom), but doing it here allows us to perform only one full\r\n    // walk of the AST and allow `stringifyStatic` to stop walking as soon as its\r\n    // stringficiation threshold is met.\r\n    let canStringify = true;\r\n    const { children } = node;\r\n    for (let i = 0; i < children.length; i++) {\r\n        const child = children[i];\r\n        // only plain elements & text calls are eligible for hoisting.\r\n        if (child.type === 1 /* ELEMENT */ &&\r\n            child.tagType === 0 /* ELEMENT */) {\r\n            const constantType = doNotHoistNode\r\n                ? 0 /* NOT_CONSTANT */\r\n                : getConstantType(child, context);\r\n            if (constantType > 0 /* NOT_CONSTANT */) {\r\n                if (constantType < 3 /* CAN_STRINGIFY */) {\r\n                    canStringify = false;\r\n                }\r\n                if (constantType >= 2 /* CAN_HOIST */) {\r\n                    child.codegenNode.patchFlag =\r\n                        -1 /* HOISTED */ + (``);\r\n                    child.codegenNode = context.hoist(child.codegenNode);\r\n                    hasHoistedNode = true;\r\n                    continue;\r\n                }\r\n            }\r\n            else {\r\n                // node may contain dynamic children, but its props may be eligible for\r\n                // hoisting.\r\n                const codegenNode = child.codegenNode;\r\n                if (codegenNode.type === 13 /* VNODE_CALL */) {\r\n                    const flag = getPatchFlag(codegenNode);\r\n                    if ((!flag ||\r\n                        flag === 512 /* NEED_PATCH */ ||\r\n                        flag === 1 /* TEXT */) &&\r\n                        getGeneratedPropsConstantType(child, context) >=\r\n                            2 /* CAN_HOIST */) {\r\n                        const props = getNodeProps(child);\r\n                        if (props) {\r\n                            codegenNode.props = context.hoist(props);\r\n                        }\r\n                    }\r\n                }\r\n            }\r\n        }\r\n        else if (child.type === 12 /* TEXT_CALL */) {\r\n            const contentType = getConstantType(child.content, context);\r\n            if (contentType > 0) {\r\n                if (contentType < 3 /* CAN_STRINGIFY */) {\r\n                    canStringify = false;\r\n                }\r\n                if (contentType >= 2 /* CAN_HOIST */) {\r\n                    child.codegenNode = context.hoist(child.codegenNode);\r\n                    hasHoistedNode = true;\r\n                }\r\n            }\r\n        }\r\n        // walk further\r\n        if (child.type === 1 /* ELEMENT */) {\r\n            const isComponent = child.tagType === 1 /* COMPONENT */;\r\n            if (isComponent) {\r\n                context.scopes.vSlot++;\r\n            }\r\n            walk(child, context);\r\n            if (isComponent) {\r\n                context.scopes.vSlot--;\r\n            }\r\n        }\r\n        else if (child.type === 11 /* FOR */) {\r\n            // Do not hoist v-for single child because it has to be a block\r\n            walk(child, context, child.children.length === 1);\r\n        }\r\n        else if (child.type === 9 /* IF */) {\r\n            for (let i = 0; i < child.branches.length; i++) {\r\n                // Do not hoist v-if single child because it has to be a block\r\n                walk(child.branches[i], context, child.branches[i].children.length === 1);\r\n            }\r\n        }\r\n    }\r\n    if (canStringify && hasHoistedNode && context.transformHoist) {\r\n        context.transformHoist(children, context, node);\r\n    }\r\n}\r\nfunction getConstantType(node, context) {\r\n    const { constantCache } = context;\r\n    switch (node.type) {\r\n        case 1 /* ELEMENT */:\r\n            if (node.tagType !== 0 /* ELEMENT */) {\r\n                return 0 /* NOT_CONSTANT */;\r\n            }\r\n            const cached = constantCache.get(node);\r\n            if (cached !== undefined) {\r\n                return cached;\r\n            }\r\n            const codegenNode = node.codegenNode;\r\n            if (codegenNode.type !== 13 /* VNODE_CALL */) {\r\n                return 0 /* NOT_CONSTANT */;\r\n            }\r\n            const flag = getPatchFlag(codegenNode);\r\n            if (!flag) {\r\n                let returnType = 3 /* CAN_STRINGIFY */;\r\n                // Element itself has no patch flag. However we still need to check:\r\n                // 1. Even for a node with no patch flag, it is possible for it to contain\r\n                // non-hoistable expressions that refers to scope variables, e.g. compiler\r\n                // injected keys or cached event handlers. Therefore we need to always\r\n                // check the codegenNode's props to be sure.\r\n                const generatedPropsType = getGeneratedPropsConstantType(node, context);\r\n                if (generatedPropsType === 0 /* NOT_CONSTANT */) {\r\n                    constantCache.set(node, 0 /* NOT_CONSTANT */);\r\n                    return 0 /* NOT_CONSTANT */;\r\n                }\r\n                if (generatedPropsType < returnType) {\r\n                    returnType = generatedPropsType;\r\n                }\r\n                // 2. its children.\r\n                for (let i = 0; i < node.children.length; i++) {\r\n                    const childType = getConstantType(node.children[i], context);\r\n                    if (childType === 0 /* NOT_CONSTANT */) {\r\n                        constantCache.set(node, 0 /* NOT_CONSTANT */);\r\n                        return 0 /* NOT_CONSTANT */;\r\n                    }\r\n                    if (childType < returnType) {\r\n                        returnType = childType;\r\n                    }\r\n                }\r\n                // 3. if the type is not already CAN_SKIP_PATCH which is the lowest non-0\r\n                // type, check if any of the props can cause the type to be lowered\r\n                // we can skip can_patch because it's guaranteed by the absence of a\r\n                // patchFlag.\r\n                if (returnType > 1 /* CAN_SKIP_PATCH */) {\r\n                    for (let i = 0; i < node.props.length; i++) {\r\n                        const p = node.props[i];\r\n                        if (p.type === 7 /* DIRECTIVE */ && p.name === 'bind' && p.exp) {\r\n                            const expType = getConstantType(p.exp, context);\r\n                            if (expType === 0 /* NOT_CONSTANT */) {\r\n                                constantCache.set(node, 0 /* NOT_CONSTANT */);\r\n                                return 0 /* NOT_CONSTANT */;\r\n                            }\r\n                            if (expType < returnType) {\r\n                                returnType = expType;\r\n                            }\r\n                        }\r\n                    }\r\n                }\r\n                // only svg/foreignObject could be block here, however if they are\r\n                // static then they don't need to be blocks since there will be no\r\n                // nested updates.\r\n                if (codegenNode.isBlock) {\r\n                    context.removeHelper(OPEN_BLOCK);\r\n                    context.removeHelper(CREATE_BLOCK);\r\n                    codegenNode.isBlock = false;\r\n                    context.helper(CREATE_VNODE);\r\n                }\r\n                constantCache.set(node, returnType);\r\n                return returnType;\r\n            }\r\n            else {\r\n                constantCache.set(node, 0 /* NOT_CONSTANT */);\r\n                return 0 /* NOT_CONSTANT */;\r\n            }\r\n        case 2 /* TEXT */:\r\n        case 3 /* COMMENT */:\r\n            return 3 /* CAN_STRINGIFY */;\r\n        case 9 /* IF */:\r\n        case 11 /* FOR */:\r\n        case 10 /* IF_BRANCH */:\r\n            return 0 /* NOT_CONSTANT */;\r\n        case 5 /* INTERPOLATION */:\r\n        case 12 /* TEXT_CALL */:\r\n            return getConstantType(node.content, context);\r\n        case 4 /* SIMPLE_EXPRESSION */:\r\n            return node.constType;\r\n        case 8 /* COMPOUND_EXPRESSION */:\r\n            let returnType = 3 /* CAN_STRINGIFY */;\r\n            for (let i = 0; i < node.children.length; i++) {\r\n                const child = node.children[i];\r\n                if (shared.isString(child) || shared.isSymbol(child)) {\r\n                    continue;\r\n                }\r\n                const childType = getConstantType(child, context);\r\n                if (childType === 0 /* NOT_CONSTANT */) {\r\n                    return 0 /* NOT_CONSTANT */;\r\n                }\r\n                else if (childType < returnType) {\r\n                    returnType = childType;\r\n                }\r\n            }\r\n            return returnType;\r\n        default:\r\n            return 0 /* NOT_CONSTANT */;\r\n    }\r\n}\r\nfunction getGeneratedPropsConstantType(node, context) {\r\n    let returnType = 3 /* CAN_STRINGIFY */;\r\n    const props = getNodeProps(node);\r\n    if (props && props.type === 15 /* JS_OBJECT_EXPRESSION */) {\r\n        const { properties } = props;\r\n        for (let i = 0; i < properties.length; i++) {\r\n            const { key, value } = properties[i];\r\n            const keyType = getConstantType(key, context);\r\n            if (keyType === 0 /* NOT_CONSTANT */) {\r\n                return keyType;\r\n            }\r\n            if (keyType < returnType) {\r\n                returnType = keyType;\r\n            }\r\n            if (value.type !== 4 /* SIMPLE_EXPRESSION */) {\r\n                return 0 /* NOT_CONSTANT */;\r\n            }\r\n            const valueType = getConstantType(value, context);\r\n            if (valueType === 0 /* NOT_CONSTANT */) {\r\n                return valueType;\r\n            }\r\n            if (valueType < returnType) {\r\n                returnType = valueType;\r\n            }\r\n        }\r\n    }\r\n    return returnType;\r\n}\r\nfunction getNodeProps(node) {\r\n    const codegenNode = node.codegenNode;\r\n    if (codegenNode.type === 13 /* VNODE_CALL */) {\r\n        return codegenNode.props;\r\n    }\r\n}\r\nfunction getPatchFlag(node) {\r\n    const flag = node.patchFlag;\r\n    return flag ? parseInt(flag, 10) : undefined;\r\n}\n\nfunction createTransformContext(root, { filename = '', prefixIdentifiers = false, hoistStatic = false, cacheHandlers = false, nodeTransforms = [], directiveTransforms = {}, transformHoist = null, isBuiltInComponent = shared.NOOP, isCustomElement = shared.NOOP, expressionPlugins = [], scopeId = null, slotted = true, ssr = false, ssrCssVars = ``, bindingMetadata = shared.EMPTY_OBJ, inline = false, isTS = false, onError = defaultOnError, onWarn = defaultOnWarn, compatConfig }) {\r\n    const nameMatch = filename.replace(/\\?.*$/, '').match(/([^/\\\\]+)\\.\\w+$/);\r\n    const context = {\r\n        // options\r\n        selfName: nameMatch && shared.capitalize(shared.camelize(nameMatch[1])),\r\n        prefixIdentifiers,\r\n        hoistStatic,\r\n        cacheHandlers,\r\n        nodeTransforms,\r\n        directiveTransforms,\r\n        transformHoist,\r\n        isBuiltInComponent,\r\n        isCustomElement,\r\n        expressionPlugins,\r\n        scopeId,\r\n        slotted,\r\n        ssr,\r\n        ssrCssVars,\r\n        bindingMetadata,\r\n        inline,\r\n        isTS,\r\n        onError,\r\n        onWarn,\r\n        compatConfig,\r\n        // state\r\n        root,\r\n        helpers: new Map(),\r\n        components: new Set(),\r\n        directives: new Set(),\r\n        hoists: [],\r\n        imports: [],\r\n        constantCache: new Map(),\r\n        temps: 0,\r\n        cached: 0,\r\n        identifiers: Object.create(null),\r\n        scopes: {\r\n            vFor: 0,\r\n            vSlot: 0,\r\n            vPre: 0,\r\n            vOnce: 0\r\n        },\r\n        parent: null,\r\n        currentNode: root,\r\n        childIndex: 0,\r\n        // methods\r\n        helper(name) {\r\n            const count = context.helpers.get(name) || 0;\r\n            context.helpers.set(name, count + 1);\r\n            return name;\r\n        },\r\n        removeHelper(name) {\r\n            const count = context.helpers.get(name);\r\n            if (count) {\r\n                const currentCount = count - 1;\r\n                if (!currentCount) {\r\n                    context.helpers.delete(name);\r\n                }\r\n                else {\r\n                    context.helpers.set(name, currentCount);\r\n                }\r\n            }\r\n        },\r\n        helperString(name) {\r\n            return `_${helperNameMap[context.helper(name)]}`;\r\n        },\r\n        replaceNode(node) {\r\n            context.parent.children[context.childIndex] = context.currentNode = node;\r\n        },\r\n        removeNode(node) {\r\n            const list = context.parent.children;\r\n            const removalIndex = node\r\n                ? list.indexOf(node)\r\n                : context.currentNode\r\n                    ? context.childIndex\r\n                    : -1;\r\n            if (!node || node === context.currentNode) {\r\n                // current node removed\r\n                context.currentNode = null;\r\n                context.onNodeRemoved();\r\n            }\r\n            else {\r\n                // sibling node removed\r\n                if (context.childIndex > removalIndex) {\r\n                    context.childIndex--;\r\n                    context.onNodeRemoved();\r\n                }\r\n            }\r\n            context.parent.children.splice(removalIndex, 1);\r\n        },\r\n        onNodeRemoved: () => { },\r\n        addIdentifiers(exp) {\r\n            // identifier tracking only happens in non-browser builds.\r\n            {\r\n                if (shared.isString(exp)) {\r\n                    addId(exp);\r\n                }\r\n                else if (exp.identifiers) {\r\n                    exp.identifiers.forEach(addId);\r\n                }\r\n                else if (exp.type === 4 /* SIMPLE_EXPRESSION */) {\r\n                    addId(exp.content);\r\n                }\r\n            }\r\n        },\r\n        removeIdentifiers(exp) {\r\n            {\r\n                if (shared.isString(exp)) {\r\n                    removeId(exp);\r\n                }\r\n                else if (exp.identifiers) {\r\n                    exp.identifiers.forEach(removeId);\r\n                }\r\n                else if (exp.type === 4 /* SIMPLE_EXPRESSION */) {\r\n                    removeId(exp.content);\r\n                }\r\n            }\r\n        },\r\n        hoist(exp) {\r\n            context.hoists.push(exp);\r\n            const identifier = createSimpleExpression(`_hoisted_${context.hoists.length}`, false, exp.loc, 2 /* CAN_HOIST */);\r\n            identifier.hoisted = exp;\r\n            return identifier;\r\n        },\r\n        cache(exp, isVNode = false) {\r\n            return createCacheExpression(++context.cached, exp, isVNode);\r\n        }\r\n    };\r\n    {\r\n        context.filters = new Set();\r\n    }\r\n    function addId(id) {\r\n        const { identifiers } = context;\r\n        if (identifiers[id] === undefined) {\r\n            identifiers[id] = 0;\r\n        }\r\n        identifiers[id]++;\r\n    }\r\n    function removeId(id) {\r\n        context.identifiers[id]--;\r\n    }\r\n    return context;\r\n}\r\nfunction transform(root, options) {\r\n    const context = createTransformContext(root, options);\r\n    traverseNode(root, context);\r\n    if (options.hoistStatic) {\r\n        hoistStatic(root, context);\r\n    }\r\n    if (!options.ssr) {\r\n        createRootCodegen(root, context);\r\n    }\r\n    // finalize meta information\r\n    root.helpers = [...context.helpers.keys()];\r\n    root.components = [...context.components];\r\n    root.directives = [...context.directives];\r\n    root.imports = context.imports;\r\n    root.hoists = context.hoists;\r\n    root.temps = context.temps;\r\n    root.cached = context.cached;\r\n    {\r\n        root.filters = [...context.filters];\r\n    }\r\n}\r\nfunction createRootCodegen(root, context) {\r\n    const { helper, removeHelper } = context;\r\n    const { children } = root;\r\n    if (children.length === 1) {\r\n        const child = children[0];\r\n        // if the single child is an element, turn it into a block.\r\n        if (isSingleElementRoot(root, child) && child.codegenNode) {\r\n            // single element root is never hoisted so codegenNode will never be\r\n            // SimpleExpressionNode\r\n            const codegenNode = child.codegenNode;\r\n            if (codegenNode.type === 13 /* VNODE_CALL */) {\r\n                if (!codegenNode.isBlock) {\r\n                    removeHelper(CREATE_VNODE);\r\n                    codegenNode.isBlock = true;\r\n                    helper(OPEN_BLOCK);\r\n                    helper(CREATE_BLOCK);\r\n                }\r\n            }\r\n            root.codegenNode = codegenNode;\r\n        }\r\n        else {\r\n            // - single <slot/>, IfNode, ForNode: already blocks.\r\n            // - single text node: always patched.\r\n            // root codegen falls through via genNode()\r\n            root.codegenNode = child;\r\n        }\r\n    }\r\n    else if (children.length > 1) {\r\n        // root has multiple nodes - return a fragment block.\r\n        let patchFlag = 64 /* STABLE_FRAGMENT */;\r\n        shared.PatchFlagNames[64 /* STABLE_FRAGMENT */];\r\n        root.codegenNode = createVNodeCall(context, helper(FRAGMENT), undefined, root.children, patchFlag + (``), undefined, undefined, true);\r\n    }\r\n    else ;\r\n}\r\nfunction traverseChildren(parent, context) {\r\n    let i = 0;\r\n    const nodeRemoved = () => {\r\n        i--;\r\n    };\r\n    for (; i < parent.children.length; i++) {\r\n        const child = parent.children[i];\r\n        if (shared.isString(child))\r\n            continue;\r\n        context.parent = parent;\r\n        context.childIndex = i;\r\n        context.onNodeRemoved = nodeRemoved;\r\n        traverseNode(child, context);\r\n    }\r\n}\r\nfunction traverseNode(node, context) {\r\n    context.currentNode = node;\r\n    // apply transform plugins\r\n    const { nodeTransforms } = context;\r\n    const exitFns = [];\r\n    for (let i = 0; i < nodeTransforms.length; i++) {\r\n        const onExit = nodeTransforms[i](node, context);\r\n        if (onExit) {\r\n            if (shared.isArray(onExit)) {\r\n                exitFns.push(...onExit);\r\n            }\r\n            else {\r\n                exitFns.push(onExit);\r\n            }\r\n        }\r\n        if (!context.currentNode) {\r\n            // node was removed\r\n            return;\r\n        }\r\n        else {\r\n            // node may have been replaced\r\n            node = context.currentNode;\r\n        }\r\n    }\r\n    switch (node.type) {\r\n        case 3 /* COMMENT */:\r\n            if (!context.ssr) {\r\n                // inject import for the Comment symbol, which is needed for creating\r\n                // comment nodes with `createVNode`\r\n                context.helper(CREATE_COMMENT);\r\n            }\r\n            break;\r\n        case 5 /* INTERPOLATION */:\r\n            // no need to traverse, but we need to inject toString helper\r\n            if (!context.ssr) {\r\n                context.helper(TO_DISPLAY_STRING);\r\n            }\r\n            break;\r\n        // for container types, further traverse downwards\r\n        case 9 /* IF */:\r\n            for (let i = 0; i < node.branches.length; i++) {\r\n                traverseNode(node.branches[i], context);\r\n            }\r\n            break;\r\n        case 10 /* IF_BRANCH */:\r\n        case 11 /* FOR */:\r\n        case 1 /* ELEMENT */:\r\n        case 0 /* ROOT */:\r\n            traverseChildren(node, context);\r\n            break;\r\n    }\r\n    // exit transforms\r\n    context.currentNode = node;\r\n    let i = exitFns.length;\r\n    while (i--) {\r\n        exitFns[i]();\r\n    }\r\n}\r\nfunction createStructuralDirectiveTransform(name, fn) {\r\n    const matches = shared.isString(name)\r\n        ? (n) => n === name\r\n        : (n) => name.test(n);\r\n    return (node, context) => {\r\n        if (node.type === 1 /* ELEMENT */) {\r\n            const { props } = node;\r\n            // structural directive transforms are not concerned with slots\r\n            // as they are handled separately in vSlot.ts\r\n            if (node.tagType === 3 /* TEMPLATE */ && props.some(isVSlot)) {\r\n                return;\r\n            }\r\n            const exitFns = [];\r\n            for (let i = 0; i < props.length; i++) {\r\n                const prop = props[i];\r\n                if (prop.type === 7 /* DIRECTIVE */ && matches(prop.name)) {\r\n                    // structural directives are removed to avoid infinite recursion\r\n                    // also we remove them *before* applying so that it can further\r\n                    // traverse itself in case it moves the node around\r\n                    props.splice(i, 1);\r\n                    i--;\r\n                    const onExit = fn(node, prop, context);\r\n                    if (onExit)\r\n                        exitFns.push(onExit);\r\n                }\r\n            }\r\n            return exitFns;\r\n        }\r\n    };\r\n}\n\nconst PURE_ANNOTATION = `/*#__PURE__*/`;\r\nconst WITH_ID = `_withId`;\r\nfunction createCodegenContext(ast, { mode = 'function', prefixIdentifiers = mode === 'module', sourceMap: sourceMap$1 = false, filename = `template.vue.html`, scopeId = null, optimizeImports = false, runtimeGlobalName = `Vue`, runtimeModuleName = `vue`, ssr = false }) {\r\n    const context = {\r\n        mode,\r\n        prefixIdentifiers,\r\n        sourceMap: sourceMap$1,\r\n        filename,\r\n        scopeId,\r\n        optimizeImports,\r\n        runtimeGlobalName,\r\n        runtimeModuleName,\r\n        ssr,\r\n        source: ast.loc.source,\r\n        code: ``,\r\n        column: 1,\r\n        line: 1,\r\n        offset: 0,\r\n        indentLevel: 0,\r\n        pure: false,\r\n        map: undefined,\r\n        helper(key) {\r\n            return `_${helperNameMap[key]}`;\r\n        },\r\n        push(code, node) {\r\n            context.code += code;\r\n            if (context.map) {\r\n                if (node) {\r\n                    let name;\r\n                    if (node.type === 4 /* SIMPLE_EXPRESSION */ && !node.isStatic) {\r\n                        const content = node.content.replace(/^_ctx\\./, '');\r\n                        if (content !== node.content && isSimpleIdentifier(content)) {\r\n                            name = content;\r\n                        }\r\n                    }\r\n                    addMapping(node.loc.start, name);\r\n                }\r\n                advancePositionWithMutation(context, code);\r\n                if (node && node.loc !== locStub) {\r\n                    addMapping(node.loc.end);\r\n                }\r\n            }\r\n        },\r\n        indent() {\r\n            newline(++context.indentLevel);\r\n        },\r\n        deindent(withoutNewLine = false) {\r\n            if (withoutNewLine) {\r\n                --context.indentLevel;\r\n            }\r\n            else {\r\n                newline(--context.indentLevel);\r\n            }\r\n        },\r\n        newline() {\r\n            newline(context.indentLevel);\r\n        }\r\n    };\r\n    function newline(n) {\r\n        context.push('\\n' + `  `.repeat(n));\r\n    }\r\n    function addMapping(loc, name) {\r\n        context.map.addMapping({\r\n            name,\r\n            source: context.filename,\r\n            original: {\r\n                line: loc.line,\r\n                column: loc.column - 1 // source-map column is 0 based\r\n            },\r\n            generated: {\r\n                line: context.line,\r\n                column: context.column - 1\r\n            }\r\n        });\r\n    }\r\n    if (sourceMap$1) {\r\n        // lazy require source-map implementation, only in non-browser builds\r\n        context.map = new sourceMap.SourceMapGenerator();\r\n        context.map.setSourceContent(filename, context.source);\r\n    }\r\n    return context;\r\n}\r\nfunction generate(ast, options = {}) {\r\n    const context = createCodegenContext(ast, options);\r\n    if (options.onContextCreated)\r\n        options.onContextCreated(context);\r\n    const { mode, push, prefixIdentifiers, indent, deindent, newline, scopeId, ssr } = context;\r\n    const hasHelpers = ast.helpers.length > 0;\r\n    const useWithBlock = !prefixIdentifiers && mode !== 'module';\r\n    const genScopeId = scopeId != null && mode === 'module';\r\n    const isSetupInlined = !!options.inline;\r\n    // preambles\r\n    // in setup() inline mode, the preamble is generated in a sub context\r\n    // and returned separately.\r\n    const preambleContext = isSetupInlined\r\n        ? createCodegenContext(ast, options)\r\n        : context;\r\n    if (mode === 'module') {\r\n        genModulePreamble(ast, preambleContext, genScopeId, isSetupInlined);\r\n    }\r\n    else {\r\n        genFunctionPreamble(ast, preambleContext);\r\n    }\r\n    // enter render function\r\n    const functionName = ssr ? `ssrRender` : `render`;\r\n    const args = ssr ? ['_ctx', '_push', '_parent', '_attrs'] : ['_ctx', '_cache'];\r\n    if (options.bindingMetadata && !options.inline) {\r\n        // binding optimization args\r\n        args.push('$props', '$setup', '$data', '$options');\r\n    }\r\n    const signature = options.isTS\r\n        ? args.map(arg => `${arg}: any`).join(',')\r\n        : args.join(', ');\r\n    if (genScopeId && !isSetupInlined) {\r\n        // root-level _withId wrapping is no longer necessary after 3.0.8 and is\r\n        // a noop, it's only kept so that code compiled with 3.0.8+ can run with\r\n        // runtime < 3.0.8.\r\n        // TODO: consider removing in 3.1\r\n        push(`const ${functionName} = ${PURE_ANNOTATION}${WITH_ID}(`);\r\n    }\r\n    if (isSetupInlined || genScopeId) {\r\n        push(`(${signature}) => {`);\r\n    }\r\n    else {\r\n        push(`function ${functionName}(${signature}) {`);\r\n    }\r\n    indent();\r\n    if (useWithBlock) {\r\n        push(`with (_ctx) {`);\r\n        indent();\r\n        // function mode const declarations should be inside with block\r\n        // also they should be renamed to avoid collision with user properties\r\n        if (hasHelpers) {\r\n            push(`const { ${ast.helpers\r\n                .map(s => `${helperNameMap[s]}: _${helperNameMap[s]}`)\r\n                .join(', ')} } = _Vue`);\r\n            push(`\\n`);\r\n            newline();\r\n        }\r\n    }\r\n    // generate asset resolution statements\r\n    if (ast.components.length) {\r\n        genAssets(ast.components, 'component', context);\r\n        if (ast.directives.length || ast.temps > 0) {\r\n            newline();\r\n        }\r\n    }\r\n    if (ast.directives.length) {\r\n        genAssets(ast.directives, 'directive', context);\r\n        if (ast.temps > 0) {\r\n            newline();\r\n        }\r\n    }\r\n    if (ast.filters && ast.filters.length) {\r\n        newline();\r\n        genAssets(ast.filters, 'filter', context);\r\n        newline();\r\n    }\r\n    if (ast.temps > 0) {\r\n        push(`let `);\r\n        for (let i = 0; i < ast.temps; i++) {\r\n            push(`${i > 0 ? `, ` : ``}_temp${i}`);\r\n        }\r\n    }\r\n    if (ast.components.length || ast.directives.length || ast.temps) {\r\n        push(`\\n`);\r\n        newline();\r\n    }\r\n    // generate the VNode tree expression\r\n    if (!ssr) {\r\n        push(`return `);\r\n    }\r\n    if (ast.codegenNode) {\r\n        genNode(ast.codegenNode, context);\r\n    }\r\n    else {\r\n        push(`null`);\r\n    }\r\n    if (useWithBlock) {\r\n        deindent();\r\n        push(`}`);\r\n    }\r\n    deindent();\r\n    push(`}`);\r\n    if (genScopeId && !isSetupInlined) {\r\n        push(`)`);\r\n    }\r\n    return {\r\n        ast,\r\n        code: context.code,\r\n        preamble: isSetupInlined ? preambleContext.code : ``,\r\n        // SourceMapGenerator does have toJSON() method but it's not in the types\r\n        map: context.map ? context.map.toJSON() : undefined\r\n    };\r\n}\r\nfunction genFunctionPreamble(ast, context) {\r\n    const { ssr, prefixIdentifiers, push, newline, runtimeModuleName, runtimeGlobalName } = context;\r\n    const VueBinding = ssr\r\n        ? `require(${JSON.stringify(runtimeModuleName)})`\r\n        : runtimeGlobalName;\r\n    const aliasHelper = (s) => `${helperNameMap[s]}: _${helperNameMap[s]}`;\r\n    // Generate const declaration for helpers\r\n    // In prefix mode, we place the const declaration at top so it's done\r\n    // only once; But if we not prefixing, we place the declaration inside the\r\n    // with block so it doesn't incur the `in` check cost for every helper access.\r\n    if (ast.helpers.length > 0) {\r\n        if (prefixIdentifiers) {\r\n            push(`const { ${ast.helpers.map(aliasHelper).join(', ')} } = ${VueBinding}\\n`);\r\n        }\r\n        else {\r\n            // \"with\" mode.\r\n            // save Vue in a separate variable to avoid collision\r\n            push(`const _Vue = ${VueBinding}\\n`);\r\n            // in \"with\" mode, helpers are declared inside the with block to avoid\r\n            // has check cost, but hoists are lifted out of the function - we need\r\n            // to provide the helper here.\r\n            if (ast.hoists.length) {\r\n                const staticHelpers = [\r\n                    CREATE_VNODE,\r\n                    CREATE_COMMENT,\r\n                    CREATE_TEXT,\r\n                    CREATE_STATIC\r\n                ]\r\n                    .filter(helper => ast.helpers.includes(helper))\r\n                    .map(aliasHelper)\r\n                    .join(', ');\r\n                push(`const { ${staticHelpers} } = _Vue\\n`);\r\n            }\r\n        }\r\n    }\r\n    // generate variables for ssr helpers\r\n    if (ast.ssrHelpers && ast.ssrHelpers.length) {\r\n        // ssr guarantees prefixIdentifier: true\r\n        push(`const { ${ast.ssrHelpers\r\n            .map(aliasHelper)\r\n            .join(', ')} } = require(\"@vue/server-renderer\")\\n`);\r\n    }\r\n    genHoists(ast.hoists, context);\r\n    newline();\r\n    push(`return `);\r\n}\r\nfunction genModulePreamble(ast, context, genScopeId, inline) {\r\n    const { push, newline, optimizeImports, runtimeModuleName, scopeId, helper } = context;\r\n    if (genScopeId) {\r\n        ast.helpers.push(WITH_SCOPE_ID);\r\n        if (ast.hoists.length) {\r\n            ast.helpers.push(PUSH_SCOPE_ID, POP_SCOPE_ID);\r\n        }\r\n    }\r\n    // generate import statements for helpers\r\n    if (ast.helpers.length) {\r\n        if (optimizeImports) {\r\n            // when bundled with webpack with code-split, calling an import binding\r\n            // as a function leads to it being wrapped with `Object(a.b)` or `(0,a.b)`,\r\n            // incurring both payload size increase and potential perf overhead.\r\n            // therefore we assign the imports to variables (which is a constant ~50b\r\n            // cost per-component instead of scaling with template size)\r\n            push(`import { ${ast.helpers\r\n                .map(s => helperNameMap[s])\r\n                .join(', ')} } from ${JSON.stringify(runtimeModuleName)}\\n`);\r\n            push(`\\n// Binding optimization for webpack code-split\\nconst ${ast.helpers\r\n                .map(s => `_${helperNameMap[s]} = ${helperNameMap[s]}`)\r\n                .join(', ')}\\n`);\r\n        }\r\n        else {\r\n            push(`import { ${ast.helpers\r\n                .map(s => `${helperNameMap[s]} as _${helperNameMap[s]}`)\r\n                .join(', ')} } from ${JSON.stringify(runtimeModuleName)}\\n`);\r\n        }\r\n    }\r\n    if (ast.ssrHelpers && ast.ssrHelpers.length) {\r\n        push(`import { ${ast.ssrHelpers\r\n            .map(s => `${helperNameMap[s]} as _${helperNameMap[s]}`)\r\n            .join(', ')} } from \"@vue/server-renderer\"\\n`);\r\n    }\r\n    if (ast.imports.length) {\r\n        genImports(ast.imports, context);\r\n        newline();\r\n    }\r\n    // we technically don't need this anymore since `withCtx` already sets the\r\n    // correct scopeId, but this is necessary for backwards compat\r\n    // TODO: consider removing in 3.1\r\n    if (genScopeId) {\r\n        push(`const ${WITH_ID} = ${PURE_ANNOTATION}${helper(WITH_SCOPE_ID)}(\"${scopeId}\")`);\r\n        newline();\r\n    }\r\n    genHoists(ast.hoists, context);\r\n    newline();\r\n    if (!inline) {\r\n        push(`export `);\r\n    }\r\n}\r\nfunction genAssets(assets, type, { helper, push, newline }) {\r\n    const resolver = helper(type === 'filter'\r\n        ? RESOLVE_FILTER\r\n        : type === 'component'\r\n            ? RESOLVE_COMPONENT\r\n            : RESOLVE_DIRECTIVE);\r\n    for (let i = 0; i < assets.length; i++) {\r\n        let id = assets[i];\r\n        // potential component implicit self-reference inferred from SFC filename\r\n        const maybeSelfReference = id.endsWith('__self');\r\n        if (maybeSelfReference) {\r\n            id = id.slice(0, -6);\r\n        }\r\n        push(`const ${toValidAssetId(id, type)} = ${resolver}(${JSON.stringify(id)}${maybeSelfReference ? `, true` : ``})`);\r\n        if (i < assets.length - 1) {\r\n            newline();\r\n        }\r\n    }\r\n}\r\nfunction genHoists(hoists, context) {\r\n    if (!hoists.length) {\r\n        return;\r\n    }\r\n    context.pure = true;\r\n    const { push, newline, helper, scopeId, mode } = context;\r\n    const genScopeId = scopeId != null && mode !== 'function';\r\n    newline();\r\n    // push scope Id before initializing hoisted vnodes so that these vnodes\r\n    // get the proper scopeId as well.\r\n    if (genScopeId) {\r\n        push(`${helper(PUSH_SCOPE_ID)}(\"${scopeId}\")`);\r\n        newline();\r\n    }\r\n    hoists.forEach((exp, i) => {\r\n        if (exp) {\r\n            push(`const _hoisted_${i + 1} = `);\r\n            genNode(exp, context);\r\n            newline();\r\n        }\r\n    });\r\n    if (genScopeId) {\r\n        push(`${helper(POP_SCOPE_ID)}()`);\r\n        newline();\r\n    }\r\n    context.pure = false;\r\n}\r\nfunction genImports(importsOptions, context) {\r\n    if (!importsOptions.length) {\r\n        return;\r\n    }\r\n    importsOptions.forEach(imports => {\r\n        context.push(`import `);\r\n        genNode(imports.exp, context);\r\n        context.push(` from '${imports.path}'`);\r\n        context.newline();\r\n    });\r\n}\r\nfunction isText$1(n) {\r\n    return (shared.isString(n) ||\r\n        n.type === 4 /* SIMPLE_EXPRESSION */ ||\r\n        n.type === 2 /* TEXT */ ||\r\n        n.type === 5 /* INTERPOLATION */ ||\r\n        n.type === 8 /* COMPOUND_EXPRESSION */);\r\n}\r\nfunction genNodeListAsArray(nodes, context) {\r\n    const multilines = nodes.length > 3 ||\r\n        (nodes.some(n => shared.isArray(n) || !isText$1(n)));\r\n    context.push(`[`);\r\n    multilines && context.indent();\r\n    genNodeList(nodes, context, multilines);\r\n    multilines && context.deindent();\r\n    context.push(`]`);\r\n}\r\nfunction genNodeList(nodes, context, multilines = false, comma = true) {\r\n    const { push, newline } = context;\r\n    for (let i = 0; i < nodes.length; i++) {\r\n        const node = nodes[i];\r\n        if (shared.isString(node)) {\r\n            push(node);\r\n        }\r\n        else if (shared.isArray(node)) {\r\n            genNodeListAsArray(node, context);\r\n        }\r\n        else {\r\n            genNode(node, context);\r\n        }\r\n        if (i < nodes.length - 1) {\r\n            if (multilines) {\r\n                comma && push(',');\r\n                newline();\r\n            }\r\n            else {\r\n                comma && push(', ');\r\n            }\r\n        }\r\n    }\r\n}\r\nfunction genNode(node, context) {\r\n    if (shared.isString(node)) {\r\n        context.push(node);\r\n        return;\r\n    }\r\n    if (shared.isSymbol(node)) {\r\n        context.push(context.helper(node));\r\n        return;\r\n    }\r\n    switch (node.type) {\r\n        case 1 /* ELEMENT */:\r\n        case 9 /* IF */:\r\n        case 11 /* FOR */:\r\n            genNode(node.codegenNode, context);\r\n            break;\r\n        case 2 /* TEXT */:\r\n            genText(node, context);\r\n            break;\r\n        case 4 /* SIMPLE_EXPRESSION */:\r\n            genExpression(node, context);\r\n            break;\r\n        case 5 /* INTERPOLATION */:\r\n            genInterpolation(node, context);\r\n            break;\r\n        case 12 /* TEXT_CALL */:\r\n            genNode(node.codegenNode, context);\r\n            break;\r\n        case 8 /* COMPOUND_EXPRESSION */:\r\n            genCompoundExpression(node, context);\r\n            break;\r\n        case 3 /* COMMENT */:\r\n            genComment(node, context);\r\n            break;\r\n        case 13 /* VNODE_CALL */:\r\n            genVNodeCall(node, context);\r\n            break;\r\n        case 14 /* JS_CALL_EXPRESSION */:\r\n            genCallExpression(node, context);\r\n            break;\r\n        case 15 /* JS_OBJECT_EXPRESSION */:\r\n            genObjectExpression(node, context);\r\n            break;\r\n        case 17 /* JS_ARRAY_EXPRESSION */:\r\n            genArrayExpression(node, context);\r\n            break;\r\n        case 18 /* JS_FUNCTION_EXPRESSION */:\r\n            genFunctionExpression(node, context);\r\n            break;\r\n        case 19 /* JS_CONDITIONAL_EXPRESSION */:\r\n            genConditionalExpression(node, context);\r\n            break;\r\n        case 20 /* JS_CACHE_EXPRESSION */:\r\n            genCacheExpression(node, context);\r\n            break;\r\n        // SSR only types\r\n        case 21 /* JS_BLOCK_STATEMENT */:\r\n            genNodeList(node.body, context, true, false);\r\n            break;\r\n        case 22 /* JS_TEMPLATE_LITERAL */:\r\n            genTemplateLiteral(node, context);\r\n            break;\r\n        case 23 /* JS_IF_STATEMENT */:\r\n            genIfStatement(node, context);\r\n            break;\r\n        case 24 /* JS_ASSIGNMENT_EXPRESSION */:\r\n            genAssignmentExpression(node, context);\r\n            break;\r\n        case 25 /* JS_SEQUENCE_EXPRESSION */:\r\n            genSequenceExpression(node, context);\r\n            break;\r\n        case 26 /* JS_RETURN_STATEMENT */:\r\n            genReturnStatement(node, context);\r\n            break;\r\n    }\r\n}\r\nfunction genText(node, context) {\r\n    context.push(JSON.stringify(node.content), node);\r\n}\r\nfunction genExpression(node, context) {\r\n    const { content, isStatic } = node;\r\n    context.push(isStatic ? JSON.stringify(content) : content, node);\r\n}\r\nfunction genInterpolation(node, context) {\r\n    const { push, helper, pure } = context;\r\n    if (pure)\r\n        push(PURE_ANNOTATION);\r\n    push(`${helper(TO_DISPLAY_STRING)}(`);\r\n    genNode(node.content, context);\r\n    push(`)`);\r\n}\r\nfunction genCompoundExpression(node, context) {\r\n    for (let i = 0; i < node.children.length; i++) {\r\n        const child = node.children[i];\r\n        if (shared.isString(child)) {\r\n            context.push(child);\r\n        }\r\n        else {\r\n            genNode(child, context);\r\n        }\r\n    }\r\n}\r\nfunction genExpressionAsPropertyKey(node, context) {\r\n    const { push } = context;\r\n    if (node.type === 8 /* COMPOUND_EXPRESSION */) {\r\n        push(`[`);\r\n        genCompoundExpression(node, context);\r\n        push(`]`);\r\n    }\r\n    else if (node.isStatic) {\r\n        // only quote keys if necessary\r\n        const text = isSimpleIdentifier(node.content)\r\n            ? node.content\r\n            : JSON.stringify(node.content);\r\n        push(text, node);\r\n    }\r\n    else {\r\n        push(`[${node.content}]`, node);\r\n    }\r\n}\r\nfunction genComment(node, context) {\r\n    const { push, helper, pure } = context;\r\n    if (pure) {\r\n        push(PURE_ANNOTATION);\r\n    }\r\n    push(`${helper(CREATE_COMMENT)}(${JSON.stringify(node.content)})`, node);\r\n}\r\nfunction genVNodeCall(node, context) {\r\n    const { push, helper, pure } = context;\r\n    const { tag, props, children, patchFlag, dynamicProps, directives, isBlock, disableTracking } = node;\r\n    if (directives) {\r\n        push(helper(WITH_DIRECTIVES) + `(`);\r\n    }\r\n    if (isBlock) {\r\n        push(`(${helper(OPEN_BLOCK)}(${disableTracking ? `true` : ``}), `);\r\n    }\r\n    if (pure) {\r\n        push(PURE_ANNOTATION);\r\n    }\r\n    push(helper(isBlock ? CREATE_BLOCK : CREATE_VNODE) + `(`, node);\r\n    genNodeList(genNullableArgs([tag, props, children, patchFlag, dynamicProps]), context);\r\n    push(`)`);\r\n    if (isBlock) {\r\n        push(`)`);\r\n    }\r\n    if (directives) {\r\n        push(`, `);\r\n        genNode(directives, context);\r\n        push(`)`);\r\n    }\r\n}\r\nfunction genNullableArgs(args) {\r\n    let i = args.length;\r\n    while (i--) {\r\n        if (args[i] != null)\r\n            break;\r\n    }\r\n    return args.slice(0, i + 1).map(arg => arg || `null`);\r\n}\r\n// JavaScript\r\nfunction genCallExpression(node, context) {\r\n    const { push, helper, pure } = context;\r\n    const callee = shared.isString(node.callee) ? node.callee : helper(node.callee);\r\n    if (pure) {\r\n        push(PURE_ANNOTATION);\r\n    }\r\n    push(callee + `(`, node);\r\n    genNodeList(node.arguments, context);\r\n    push(`)`);\r\n}\r\nfunction genObjectExpression(node, context) {\r\n    const { push, indent, deindent, newline } = context;\r\n    const { properties } = node;\r\n    if (!properties.length) {\r\n        push(`{}`, node);\r\n        return;\r\n    }\r\n    const multilines = properties.length > 1 ||\r\n        (properties.some(p => p.value.type !== 4 /* SIMPLE_EXPRESSION */));\r\n    push(multilines ? `{` : `{ `);\r\n    multilines && indent();\r\n    for (let i = 0; i < properties.length; i++) {\r\n        const { key, value } = properties[i];\r\n        // key\r\n        genExpressionAsPropertyKey(key, context);\r\n        push(`: `);\r\n        // value\r\n        genNode(value, context);\r\n        if (i < properties.length - 1) {\r\n            // will only reach this if it's multilines\r\n            push(`,`);\r\n            newline();\r\n        }\r\n    }\r\n    multilines && deindent();\r\n    push(multilines ? `}` : ` }`);\r\n}\r\nfunction genArrayExpression(node, context) {\r\n    genNodeListAsArray(node.elements, context);\r\n}\r\nfunction genFunctionExpression(node, context) {\r\n    const { push, indent, deindent, scopeId, mode } = context;\r\n    const { params, returns, body, newline, isSlot } = node;\r\n    // slot functions also need to push scopeId before rendering its content\r\n    const genScopeId = isSlot && scopeId != null && mode !== 'function';\r\n    if (isSlot) {\r\n        // wrap slot functions with owner context\r\n        push(genScopeId ? `${WITH_ID}(` : `_${helperNameMap[WITH_CTX]}(`);\r\n    }\r\n    push(`(`, node);\r\n    if (shared.isArray(params)) {\r\n        genNodeList(params, context);\r\n    }\r\n    else if (params) {\r\n        genNode(params, context);\r\n    }\r\n    push(`) => `);\r\n    if (newline || body) {\r\n        push(`{`);\r\n        indent();\r\n    }\r\n    if (returns) {\r\n        if (newline) {\r\n            push(`return `);\r\n        }\r\n        if (shared.isArray(returns)) {\r\n            genNodeListAsArray(returns, context);\r\n        }\r\n        else {\r\n            genNode(returns, context);\r\n        }\r\n    }\r\n    else if (body) {\r\n        genNode(body, context);\r\n    }\r\n    if (newline || body) {\r\n        deindent();\r\n        push(`}`);\r\n    }\r\n    if (isSlot) {\r\n        if (node.isNonScopedSlot) {\r\n            push(`, undefined, true`);\r\n        }\r\n        push(`)`);\r\n    }\r\n}\r\nfunction genConditionalExpression(node, context) {\r\n    const { test, consequent, alternate, newline: needNewline } = node;\r\n    const { push, indent, deindent, newline } = context;\r\n    if (test.type === 4 /* SIMPLE_EXPRESSION */) {\r\n        const needsParens = !isSimpleIdentifier(test.content);\r\n        needsParens && push(`(`);\r\n        genExpression(test, context);\r\n        needsParens && push(`)`);\r\n    }\r\n    else {\r\n        push(`(`);\r\n        genNode(test, context);\r\n        push(`)`);\r\n    }\r\n    needNewline && indent();\r\n    context.indentLevel++;\r\n    needNewline || push(` `);\r\n    push(`? `);\r\n    genNode(consequent, context);\r\n    context.indentLevel--;\r\n    needNewline && newline();\r\n    needNewline || push(` `);\r\n    push(`: `);\r\n    const isNested = alternate.type === 19 /* JS_CONDITIONAL_EXPRESSION */;\r\n    if (!isNested) {\r\n        context.indentLevel++;\r\n    }\r\n    genNode(alternate, context);\r\n    if (!isNested) {\r\n        context.indentLevel--;\r\n    }\r\n    needNewline && deindent(true /* without newline */);\r\n}\r\nfunction genCacheExpression(node, context) {\r\n    const { push, helper, indent, deindent, newline } = context;\r\n    push(`_cache[${node.index}] || (`);\r\n    if (node.isVNode) {\r\n        indent();\r\n        push(`${helper(SET_BLOCK_TRACKING)}(-1),`);\r\n        newline();\r\n    }\r\n    push(`_cache[${node.index}] = `);\r\n    genNode(node.value, context);\r\n    if (node.isVNode) {\r\n        push(`,`);\r\n        newline();\r\n        push(`${helper(SET_BLOCK_TRACKING)}(1),`);\r\n        newline();\r\n        push(`_cache[${node.index}]`);\r\n        deindent();\r\n    }\r\n    push(`)`);\r\n}\r\nfunction genTemplateLiteral(node, context) {\r\n    const { push, indent, deindent } = context;\r\n    push('`');\r\n    const l = node.elements.length;\r\n    const multilines = l > 3;\r\n    for (let i = 0; i < l; i++) {\r\n        const e = node.elements[i];\r\n        if (shared.isString(e)) {\r\n            push(e.replace(/(`|\\$|\\\\)/g, '\\\\$1'));\r\n        }\r\n        else {\r\n            push('${');\r\n            if (multilines)\r\n                indent();\r\n            genNode(e, context);\r\n            if (multilines)\r\n                deindent();\r\n            push('}');\r\n        }\r\n    }\r\n    push('`');\r\n}\r\nfunction genIfStatement(node, context) {\r\n    const { push, indent, deindent } = context;\r\n    const { test, consequent, alternate } = node;\r\n    push(`if (`);\r\n    genNode(test, context);\r\n    push(`) {`);\r\n    indent();\r\n    genNode(consequent, context);\r\n    deindent();\r\n    push(`}`);\r\n    if (alternate) {\r\n        push(` else `);\r\n        if (alternate.type === 23 /* JS_IF_STATEMENT */) {\r\n            genIfStatement(alternate, context);\r\n        }\r\n        else {\r\n            push(`{`);\r\n            indent();\r\n            genNode(alternate, context);\r\n            deindent();\r\n            push(`}`);\r\n        }\r\n    }\r\n}\r\nfunction genAssignmentExpression(node, context) {\r\n    genNode(node.left, context);\r\n    context.push(` = `);\r\n    genNode(node.right, context);\r\n}\r\nfunction genSequenceExpression(node, context) {\r\n    context.push(`(`);\r\n    genNodeList(node.expressions, context);\r\n    context.push(`)`);\r\n}\r\nfunction genReturnStatement({ returns }, context) {\r\n    context.push(`return `);\r\n    if (shared.isArray(returns)) {\r\n        genNodeListAsArray(returns, context);\r\n    }\r\n    else {\r\n        genNode(returns, context);\r\n    }\r\n}\n\nconst isLiteralWhitelisted = /*#__PURE__*/ shared.makeMap('true,false,null,this');\r\nconst transformExpression = (node, context) => {\r\n    if (node.type === 5 /* INTERPOLATION */) {\r\n        node.content = processExpression(node.content, context);\r\n    }\r\n    else if (node.type === 1 /* ELEMENT */) {\r\n        // handle directives on element\r\n        for (let i = 0; i < node.props.length; i++) {\r\n            const dir = node.props[i];\r\n            // do not process for v-on & v-for since they are special handled\r\n            if (dir.type === 7 /* DIRECTIVE */ && dir.name !== 'for') {\r\n                const exp = dir.exp;\r\n                const arg = dir.arg;\r\n                // do not process exp if this is v-on:arg - we need special handling\r\n                // for wrapping inline statements.\r\n                if (exp &&\r\n                    exp.type === 4 /* SIMPLE_EXPRESSION */ &&\r\n                    !(dir.name === 'on' && arg)) {\r\n                    dir.exp = processExpression(exp, context, \r\n                    // slot args must be processed as function params\r\n                    dir.name === 'slot');\r\n                }\r\n                if (arg && arg.type === 4 /* SIMPLE_EXPRESSION */ && !arg.isStatic) {\r\n                    dir.arg = processExpression(arg, context);\r\n                }\r\n            }\r\n        }\r\n    }\r\n};\r\n// Important: since this function uses Node.js only dependencies, it should\r\n// always be used with a leading !false check so that it can be\r\n// tree-shaken from the browser build.\r\nfunction processExpression(node, context, \r\n// some expressions like v-slot props & v-for aliases should be parsed as\r\n// function params\r\nasParams = false, \r\n// v-on handler values may contain multiple statements\r\nasRawStatements = false) {\r\n    if (!context.prefixIdentifiers || !node.content.trim()) {\r\n        return node;\r\n    }\r\n    const { inline, bindingMetadata } = context;\r\n    const rewriteIdentifier = (raw, parent, id) => {\r\n        const type = shared.hasOwn(bindingMetadata, raw) && bindingMetadata[raw];\r\n        if (inline) {\r\n            // x = y\r\n            const isAssignmentLVal = parent && parent.type === 'AssignmentExpression' && parent.left === id;\r\n            // x++\r\n            const isUpdateArg = parent && parent.type === 'UpdateExpression' && parent.argument === id;\r\n            // ({ x } = y)\r\n            const isDestructureAssignment = parent && isInDestructureAssignment(parent, parentStack);\r\n            if (type === \"setup-const\" /* SETUP_CONST */) {\r\n                return raw;\r\n            }\r\n            else if (type === \"setup-ref\" /* SETUP_REF */) {\r\n                return `${raw}.value`;\r\n            }\r\n            else if (type === \"setup-maybe-ref\" /* SETUP_MAYBE_REF */) {\r\n                // const binding that may or may not be ref\r\n                // if it's not a ref, then assignments don't make sense -\r\n                // so we ignore the non-ref assignment case and generate code\r\n                // that assumes the value to be a ref for more efficiency\r\n                return isAssignmentLVal || isUpdateArg || isDestructureAssignment\r\n                    ? `${raw}.value`\r\n                    : `${context.helperString(UNREF)}(${raw})`;\r\n            }\r\n            else if (type === \"setup-let\" /* SETUP_LET */) {\r\n                if (isAssignmentLVal) {\r\n                    // let binding.\r\n                    // this is a bit more tricky as we need to cover the case where\r\n                    // let is a local non-ref value, and we need to replicate the\r\n                    // right hand side value.\r\n                    // x = y --> isRef(x) ? x.value = y : x = y\r\n                    const { right: rVal, operator } = parent;\r\n                    const rExp = rawExp.slice(rVal.start - 1, rVal.end - 1);\r\n                    const rExpString = stringifyExpression(processExpression(createSimpleExpression(rExp, false), context));\r\n                    return `${context.helperString(IS_REF)}(${raw})${context.isTS ? ` //@ts-ignore\\n` : ``} ? ${raw}.value ${operator} ${rExpString} : ${raw}`;\r\n                }\r\n                else if (isUpdateArg) {\r\n                    // make id replace parent in the code range so the raw update operator\r\n                    // is removed\r\n                    id.start = parent.start;\r\n                    id.end = parent.end;\r\n                    const { prefix: isPrefix, operator } = parent;\r\n                    const prefix = isPrefix ? operator : ``;\r\n                    const postfix = isPrefix ? `` : operator;\r\n                    // let binding.\r\n                    // x++ --> isRef(a) ? a.value++ : a++\r\n                    return `${context.helperString(IS_REF)}(${raw})${context.isTS ? ` //@ts-ignore\\n` : ``} ? ${prefix}${raw}.value${postfix} : ${prefix}${raw}${postfix}`;\r\n                }\r\n                else if (isDestructureAssignment) {\r\n                    // TODO\r\n                    // let binding in a destructure assignment - it's very tricky to\r\n                    // handle both possible cases here without altering the original\r\n                    // structure of the code, so we just assume it's not a ref here\r\n                    // for now\r\n                    return raw;\r\n                }\r\n                else {\r\n                    return `${context.helperString(UNREF)}(${raw})`;\r\n                }\r\n            }\r\n            else if (type === \"props\" /* PROPS */) {\r\n                // use __props which is generated by compileScript so in ts mode\r\n                // it gets correct type\r\n                return `__props.${raw}`;\r\n            }\r\n        }\r\n        else {\r\n            if (type && type.startsWith('setup')) {\r\n                // setup bindings in non-inline mode\r\n                return `$setup.${raw}`;\r\n            }\r\n            else if (type) {\r\n                return `$${type}.${raw}`;\r\n            }\r\n        }\r\n        // fallback to ctx\r\n        return `_ctx.${raw}`;\r\n    };\r\n    // fast path if expression is a simple identifier.\r\n    const rawExp = node.content;\r\n    // bail constant on parens (function invocation) and dot (member access)\r\n    const bailConstant = rawExp.indexOf(`(`) > -1 || rawExp.indexOf('.') > 0;\r\n    if (isSimpleIdentifier(rawExp)) {\r\n        const isScopeVarReference = context.identifiers[rawExp];\r\n        const isAllowedGlobal = shared.isGloballyWhitelisted(rawExp);\r\n        const isLiteral = isLiteralWhitelisted(rawExp);\r\n        if (!asParams && !isScopeVarReference && !isAllowedGlobal && !isLiteral) {\r\n            // const bindings exposed from setup can be skipped for patching but\r\n            // cannot be hoisted to module scope\r\n            if (bindingMetadata[node.content] === \"setup-const\" /* SETUP_CONST */) {\r\n                node.constType = 1 /* CAN_SKIP_PATCH */;\r\n            }\r\n            node.content = rewriteIdentifier(rawExp);\r\n        }\r\n        else if (!isScopeVarReference) {\r\n            if (isLiteral) {\r\n                node.constType = 3 /* CAN_STRINGIFY */;\r\n            }\r\n            else {\r\n                node.constType = 2 /* CAN_HOIST */;\r\n            }\r\n        }\r\n        return node;\r\n    }\r\n    let ast;\r\n    // exp needs to be parsed differently:\r\n    // 1. Multiple inline statements (v-on, with presence of `;`): parse as raw\r\n    //    exp, but make sure to pad with spaces for consistent ranges\r\n    // 2. Expressions: wrap with parens (for e.g. object expressions)\r\n    // 3. Function arguments (v-for, v-slot): place in a function argument position\r\n    const source = asRawStatements\r\n        ? ` ${rawExp} `\r\n        : `(${rawExp})${asParams ? `=>{}` : ``}`;\r\n    try {\r\n        ast = parser.parse(source, {\r\n            plugins: [...context.expressionPlugins, ...shared.babelParserDefaultPlugins]\r\n        }).program;\r\n    }\r\n    catch (e) {\r\n        context.onError(createCompilerError(43 /* X_INVALID_EXPRESSION */, node.loc, undefined, e.message));\r\n        return node;\r\n    }\r\n    const ids = [];\r\n    const knownIds = Object.create(context.identifiers);\r\n    const isDuplicate = (node) => ids.some(id => id.start === node.start);\r\n    const parentStack = [];\r\n    estreeWalker.walk(ast, {\r\n        enter(node, parent) {\r\n            parent && parentStack.push(parent);\r\n            if (node.type === 'Identifier') {\r\n                if (!isDuplicate(node)) {\r\n                    // v2 wrapped filter call\r\n                    if (node.name.startsWith('_filter_')) {\r\n                        return;\r\n                    }\r\n                    const needPrefix = shouldPrefix(node, parent, parentStack);\r\n                    if (!knownIds[node.name] && needPrefix) {\r\n                        if (isStaticProperty(parent) && parent.shorthand) {\r\n                            // property shorthand like { foo }, we need to add the key since\r\n                            // we rewrite the value\r\n                            node.prefix = `${node.name}: `;\r\n                        }\r\n                        node.name = rewriteIdentifier(node.name, parent, node);\r\n                        ids.push(node);\r\n                    }\r\n                    else if (!isStaticPropertyKey(node, parent)) {\r\n                        // The identifier is considered constant unless it's pointing to a\r\n                        // scope variable (a v-for alias, or a v-slot prop)\r\n                        if (!(needPrefix && knownIds[node.name]) && !bailConstant) {\r\n                            node.isConstant = true;\r\n                        }\r\n                        // also generate sub-expressions for other identifiers for better\r\n                        // source map support. (except for property keys which are static)\r\n                        ids.push(node);\r\n                    }\r\n                }\r\n            }\r\n            else if (isFunction(node)) {\r\n                // walk function expressions and add its arguments to known identifiers\r\n                // so that we don't prefix them\r\n                node.params.forEach(p => estreeWalker.walk(p, {\r\n                    enter(child, parent) {\r\n                        if (child.type === 'Identifier' &&\r\n                            // do not record as scope variable if is a destructured key\r\n                            !isStaticPropertyKey(child, parent) &&\r\n                            // do not record if this is a default value\r\n                            // assignment of a destructured variable\r\n                            !(parent &&\r\n                                parent.type === 'AssignmentPattern' &&\r\n                                parent.right === child)) {\r\n                            const { name } = child;\r\n                            if (node.scopeIds && node.scopeIds.has(name)) {\r\n                                return;\r\n                            }\r\n                            if (name in knownIds) {\r\n                                knownIds[name]++;\r\n                            }\r\n                            else {\r\n                                knownIds[name] = 1;\r\n                            }\r\n                            (node.scopeIds || (node.scopeIds = new Set())).add(name);\r\n                        }\r\n                    }\r\n                }));\r\n            }\r\n        },\r\n        leave(node, parent) {\r\n            parent && parentStack.pop();\r\n            if (node !== ast.body[0].expression && node.scopeIds) {\r\n                node.scopeIds.forEach((id) => {\r\n                    knownIds[id]--;\r\n                    if (knownIds[id] === 0) {\r\n                        delete knownIds[id];\r\n                    }\r\n                });\r\n            }\r\n        }\r\n    });\r\n    // We break up the compound expression into an array of strings and sub\r\n    // expressions (for identifiers that have been prefixed). In codegen, if\r\n    // an ExpressionNode has the `.children` property, it will be used instead of\r\n    // `.content`.\r\n    const children = [];\r\n    ids.sort((a, b) => a.start - b.start);\r\n    ids.forEach((id, i) => {\r\n        // range is offset by -1 due to the wrapping parens when parsed\r\n        const start = id.start - 1;\r\n        const end = id.end - 1;\r\n        const last = ids[i - 1];\r\n        const leadingText = rawExp.slice(last ? last.end - 1 : 0, start);\r\n        if (leadingText.length || id.prefix) {\r\n            children.push(leadingText + (id.prefix || ``));\r\n        }\r\n        const source = rawExp.slice(start, end);\r\n        children.push(createSimpleExpression(id.name, false, {\r\n            source,\r\n            start: advancePositionWithClone(node.loc.start, source, start),\r\n            end: advancePositionWithClone(node.loc.start, source, end)\r\n        }, id.isConstant ? 3 /* CAN_STRINGIFY */ : 0 /* NOT_CONSTANT */));\r\n        if (i === ids.length - 1 && end < rawExp.length) {\r\n            children.push(rawExp.slice(end));\r\n        }\r\n    });\r\n    let ret;\r\n    if (children.length) {\r\n        ret = createCompoundExpression(children, node.loc);\r\n    }\r\n    else {\r\n        ret = node;\r\n        ret.constType = bailConstant\r\n            ? 0 /* NOT_CONSTANT */\r\n            : 3 /* CAN_STRINGIFY */;\r\n    }\r\n    ret.identifiers = Object.keys(knownIds);\r\n    return ret;\r\n}\r\nconst isFunction = (node) => {\r\n    return /Function(?:Expression|Declaration)$|Method$/.test(node.type);\r\n};\r\nconst isStaticProperty = (node) => node &&\r\n    (node.type === 'ObjectProperty' || node.type === 'ObjectMethod') &&\r\n    !node.computed;\r\nconst isStaticPropertyKey = (node, parent) => isStaticProperty(parent) && parent.key === node;\r\nfunction shouldPrefix(id, parent, parentStack) {\r\n    // declaration id\r\n    if ((parent.type === 'VariableDeclarator' ||\r\n        parent.type === 'ClassDeclaration') &&\r\n        parent.id === id) {\r\n        return false;\r\n    }\r\n    if (isFunction(parent)) {\r\n        // function decalration/expression id\r\n        if (parent.id === id) {\r\n            return false;\r\n        }\r\n        // params list\r\n        if (parent.params.includes(id)) {\r\n            return false;\r\n        }\r\n    }\r\n    // property key\r\n    // this also covers object destructure pattern\r\n    if (isStaticPropertyKey(id, parent)) {\r\n        return false;\r\n    }\r\n    // non-assignment array destructure pattern\r\n    if (parent.type === 'ArrayPattern' &&\r\n        !isInDestructureAssignment(parent, parentStack)) {\r\n        return false;\r\n    }\r\n    // member expression property\r\n    if ((parent.type === 'MemberExpression' ||\r\n        parent.type === 'OptionalMemberExpression') &&\r\n        parent.property === id &&\r\n        !parent.computed) {\r\n        return false;\r\n    }\r\n    // is a special keyword but parsed as identifier\r\n    if (id.name === 'arguments') {\r\n        return false;\r\n    }\r\n    // skip whitelisted globals\r\n    if (shared.isGloballyWhitelisted(id.name)) {\r\n        return false;\r\n    }\r\n    // special case for webpack compilation\r\n    if (id.name === 'require') {\r\n        return false;\r\n    }\r\n    return true;\r\n}\r\nfunction isInDestructureAssignment(parent, parentStack) {\r\n    if (parent &&\r\n        (parent.type === 'ObjectProperty' || parent.type === 'ArrayPattern')) {\r\n        let i = parentStack.length;\r\n        while (i--) {\r\n            const p = parentStack[i];\r\n            if (p.type === 'AssignmentExpression') {\r\n                return true;\r\n            }\r\n            else if (p.type !== 'ObjectProperty' && !p.type.endsWith('Pattern')) {\r\n                break;\r\n            }\r\n        }\r\n    }\r\n    return false;\r\n}\r\nfunction stringifyExpression(exp) {\r\n    if (shared.isString(exp)) {\r\n        return exp;\r\n    }\r\n    else if (exp.type === 4 /* SIMPLE_EXPRESSION */) {\r\n        return exp.content;\r\n    }\r\n    else {\r\n        return exp.children\r\n            .map(stringifyExpression)\r\n            .join('');\r\n    }\r\n}\n\nconst transformIf = createStructuralDirectiveTransform(/^(if|else|else-if)$/, (node, dir, context) => {\r\n    return processIf(node, dir, context, (ifNode, branch, isRoot) => {\r\n        // #1587: We need to dynamically increment the key based on the current\r\n        // node's sibling nodes, since chained v-if/else branches are\r\n        // rendered at the same depth\r\n        const siblings = context.parent.children;\r\n        let i = siblings.indexOf(ifNode);\r\n        let key = 0;\r\n        while (i-- >= 0) {\r\n            const sibling = siblings[i];\r\n            if (sibling && sibling.type === 9 /* IF */) {\r\n                key += sibling.branches.length;\r\n            }\r\n        }\r\n        // Exit callback. Complete the codegenNode when all children have been\r\n        // transformed.\r\n        return () => {\r\n            if (isRoot) {\r\n                ifNode.codegenNode = createCodegenNodeForBranch(branch, key, context);\r\n            }\r\n            else {\r\n                // attach this branch's codegen node to the v-if root.\r\n                const parentCondition = getParentCondition(ifNode.codegenNode);\r\n                parentCondition.alternate = createCodegenNodeForBranch(branch, key + ifNode.branches.length - 1, context);\r\n            }\r\n        };\r\n    });\r\n});\r\n// target-agnostic transform used for both Client and SSR\r\nfunction processIf(node, dir, context, processCodegen) {\r\n    if (dir.name !== 'else' &&\r\n        (!dir.exp || !dir.exp.content.trim())) {\r\n        const loc = dir.exp ? dir.exp.loc : node.loc;\r\n        context.onError(createCompilerError(27 /* X_V_IF_NO_EXPRESSION */, dir.loc));\r\n        dir.exp = createSimpleExpression(`true`, false, loc);\r\n    }\r\n    if (context.prefixIdentifiers && dir.exp) {\r\n        // dir.exp can only be simple expression because vIf transform is applied\r\n        // before expression transform.\r\n        dir.exp = processExpression(dir.exp, context);\r\n    }\r\n    if (dir.name === 'if') {\r\n        const branch = createIfBranch(node, dir);\r\n        const ifNode = {\r\n            type: 9 /* IF */,\r\n            loc: node.loc,\r\n            branches: [branch]\r\n        };\r\n        context.replaceNode(ifNode);\r\n        if (processCodegen) {\r\n            return processCodegen(ifNode, branch, true);\r\n        }\r\n    }\r\n    else {\r\n        // locate the adjacent v-if\r\n        const siblings = context.parent.children;\r\n        let i = siblings.indexOf(node);\r\n        while (i-- >= -1) {\r\n            const sibling = siblings[i];\r\n            if (sibling &&\r\n                sibling.type === 2 /* TEXT */ &&\r\n                !sibling.content.trim().length) {\r\n                context.removeNode(sibling);\r\n                continue;\r\n            }\r\n            if (sibling && sibling.type === 9 /* IF */) {\r\n                // move the node to the if node's branches\r\n                context.removeNode();\r\n                const branch = createIfBranch(node, dir);\r\n                // check if user is forcing same key on different branches\r\n                {\r\n                    const key = branch.userKey;\r\n                    if (key) {\r\n                        sibling.branches.forEach(({ userKey }) => {\r\n                            if (isSameKey(userKey, key)) {\r\n                                context.onError(createCompilerError(28 /* X_V_IF_SAME_KEY */, branch.userKey.loc));\r\n                            }\r\n                        });\r\n                    }\r\n                }\r\n                sibling.branches.push(branch);\r\n                const onExit = processCodegen && processCodegen(sibling, branch, false);\r\n                // since the branch was removed, it will not be traversed.\r\n                // make sure to traverse here.\r\n                traverseNode(branch, context);\r\n                // call on exit\r\n                if (onExit)\r\n                    onExit();\r\n                // make sure to reset currentNode after traversal to indicate this\r\n                // node has been removed.\r\n                context.currentNode = null;\r\n            }\r\n            else {\r\n                context.onError(createCompilerError(29 /* X_V_ELSE_NO_ADJACENT_IF */, node.loc));\r\n            }\r\n            break;\r\n        }\r\n    }\r\n}\r\nfunction createIfBranch(node, dir) {\r\n    return {\r\n        type: 10 /* IF_BRANCH */,\r\n        loc: node.loc,\r\n        condition: dir.name === 'else' ? undefined : dir.exp,\r\n        children: node.tagType === 3 /* TEMPLATE */ && !findDir(node, 'for')\r\n            ? node.children\r\n            : [node],\r\n        userKey: findProp(node, `key`)\r\n    };\r\n}\r\nfunction createCodegenNodeForBranch(branch, keyIndex, context) {\r\n    if (branch.condition) {\r\n        return createConditionalExpression(branch.condition, createChildrenCodegenNode(branch, keyIndex, context), \r\n        // make sure to pass in asBlock: true so that the comment node call\r\n        // closes the current block.\r\n        createCallExpression(context.helper(CREATE_COMMENT), [\r\n            '\"\"',\r\n            'true'\r\n        ]));\r\n    }\r\n    else {\r\n        return createChildrenCodegenNode(branch, keyIndex, context);\r\n    }\r\n}\r\nfunction createChildrenCodegenNode(branch, keyIndex, context) {\r\n    const { helper, removeHelper } = context;\r\n    const keyProperty = createObjectProperty(`key`, createSimpleExpression(`${keyIndex}`, false, locStub, 2 /* CAN_HOIST */));\r\n    const { children } = branch;\r\n    const firstChild = children[0];\r\n    const needFragmentWrapper = children.length !== 1 || firstChild.type !== 1 /* ELEMENT */;\r\n    if (needFragmentWrapper) {\r\n        if (children.length === 1 && firstChild.type === 11 /* FOR */) {\r\n            // optimize away nested fragments when child is a ForNode\r\n            const vnodeCall = firstChild.codegenNode;\r\n            injectProp(vnodeCall, keyProperty, context);\r\n            return vnodeCall;\r\n        }\r\n        else {\r\n            let patchFlag = 64 /* STABLE_FRAGMENT */;\r\n            shared.PatchFlagNames[64 /* STABLE_FRAGMENT */];\r\n            return createVNodeCall(context, helper(FRAGMENT), createObjectExpression([keyProperty]), children, patchFlag + (``), undefined, undefined, true, false, branch.loc);\r\n        }\r\n    }\r\n    else {\r\n        const vnodeCall = firstChild\r\n            .codegenNode;\r\n        // Change createVNode to createBlock.\r\n        if (vnodeCall.type === 13 /* VNODE_CALL */ && !vnodeCall.isBlock) {\r\n            removeHelper(CREATE_VNODE);\r\n            vnodeCall.isBlock = true;\r\n            helper(OPEN_BLOCK);\r\n            helper(CREATE_BLOCK);\r\n        }\r\n        // inject branch key\r\n        injectProp(vnodeCall, keyProperty, context);\r\n        return vnodeCall;\r\n    }\r\n}\r\nfunction isSameKey(a, b) {\r\n    if (!a || a.type !== b.type) {\r\n        return false;\r\n    }\r\n    if (a.type === 6 /* ATTRIBUTE */) {\r\n        if (a.value.content !== b.value.content) {\r\n            return false;\r\n        }\r\n    }\r\n    else {\r\n        // directive\r\n        const exp = a.exp;\r\n        const branchExp = b.exp;\r\n        if (exp.type !== branchExp.type) {\r\n            return false;\r\n        }\r\n        if (exp.type !== 4 /* SIMPLE_EXPRESSION */ ||\r\n            (exp.isStatic !== branchExp.isStatic ||\r\n                exp.content !== branchExp.content)) {\r\n            return false;\r\n        }\r\n    }\r\n    return true;\r\n}\r\nfunction getParentCondition(node) {\r\n    while (true) {\r\n        if (node.type === 19 /* JS_CONDITIONAL_EXPRESSION */) {\r\n            if (node.alternate.type === 19 /* JS_CONDITIONAL_EXPRESSION */) {\r\n                node = node.alternate;\r\n            }\r\n            else {\r\n                return node;\r\n            }\r\n        }\r\n        else if (node.type === 20 /* JS_CACHE_EXPRESSION */) {\r\n            node = node.value;\r\n        }\r\n    }\r\n}\n\nconst transformFor = createStructuralDirectiveTransform('for', (node, dir, context) => {\r\n    const { helper, removeHelper } = context;\r\n    return processFor(node, dir, context, forNode => {\r\n        // create the loop render function expression now, and add the\r\n        // iterator on exit after all children have been traversed\r\n        const renderExp = createCallExpression(helper(RENDER_LIST), [\r\n            forNode.source\r\n        ]);\r\n        const keyProp = findProp(node, `key`);\r\n        const keyProperty = keyProp\r\n            ? createObjectProperty(`key`, keyProp.type === 6 /* ATTRIBUTE */\r\n                ? createSimpleExpression(keyProp.value.content, true)\r\n                : keyProp.exp)\r\n            : null;\r\n        if (context.prefixIdentifiers && keyProperty) {\r\n            // #2085 process :key expression needs to be processed in order for it\r\n            // to behave consistently for <template v-for> and <div v-for>.\r\n            // In the case of `<template v-for>`, the node is discarded and never\r\n            // traversed so its key expression won't be processed by the normal\r\n            // transforms.\r\n            keyProperty.value = processExpression(keyProperty.value, context);\r\n        }\r\n        const isStableFragment = forNode.source.type === 4 /* SIMPLE_EXPRESSION */ &&\r\n            forNode.source.constType > 0 /* NOT_CONSTANT */;\r\n        const fragmentFlag = isStableFragment\r\n            ? 64 /* STABLE_FRAGMENT */\r\n            : keyProp\r\n                ? 128 /* KEYED_FRAGMENT */\r\n                : 256 /* UNKEYED_FRAGMENT */;\r\n        forNode.codegenNode = createVNodeCall(context, helper(FRAGMENT), undefined, renderExp, fragmentFlag +\r\n            (``), undefined, undefined, true /* isBlock */, !isStableFragment /* disableTracking */, node.loc);\r\n        return () => {\r\n            // finish the codegen now that all children have been traversed\r\n            let childBlock;\r\n            const isTemplate = isTemplateNode(node);\r\n            const { children } = forNode;\r\n            // check <template v-for> key placement\r\n            if (isTemplate) {\r\n                node.children.some(c => {\r\n                    if (c.type === 1 /* ELEMENT */) {\r\n                        const key = findProp(c, 'key');\r\n                        if (key) {\r\n                            context.onError(createCompilerError(32 /* X_V_FOR_TEMPLATE_KEY_PLACEMENT */, key.loc));\r\n                            return true;\r\n                        }\r\n                    }\r\n                });\r\n            }\r\n            const needFragmentWrapper = children.length !== 1 || children[0].type !== 1 /* ELEMENT */;\r\n            const slotOutlet = isSlotOutlet(node)\r\n                ? node\r\n                : isTemplate &&\r\n                    node.children.length === 1 &&\r\n                    isSlotOutlet(node.children[0])\r\n                    ? node.children[0] // api-extractor somehow fails to infer this\r\n                    : null;\r\n            if (slotOutlet) {\r\n                // <slot v-for=\"...\"> or <template v-for=\"...\"><slot/></template>\r\n                childBlock = slotOutlet.codegenNode;\r\n                if (isTemplate && keyProperty) {\r\n                    // <template v-for=\"...\" :key=\"...\"><slot/></template>\r\n                    // we need to inject the key to the renderSlot() call.\r\n                    // the props for renderSlot is passed as the 3rd argument.\r\n                    injectProp(childBlock, keyProperty, context);\r\n                }\r\n            }\r\n            else if (needFragmentWrapper) {\r\n                // <template v-for=\"...\"> with text or multi-elements\r\n                // should generate a fragment block for each loop\r\n                childBlock = createVNodeCall(context, helper(FRAGMENT), keyProperty ? createObjectExpression([keyProperty]) : undefined, node.children, 64 /* STABLE_FRAGMENT */ +\r\n                    (``), undefined, undefined, true);\r\n            }\r\n            else {\r\n                // Normal element v-for. Directly use the child's codegenNode\r\n                // but mark it as a block.\r\n                childBlock = children[0]\r\n                    .codegenNode;\r\n                if (isTemplate && keyProperty) {\r\n                    injectProp(childBlock, keyProperty, context);\r\n                }\r\n                if (childBlock.isBlock !== !isStableFragment) {\r\n                    if (childBlock.isBlock) {\r\n                        // switch from block to vnode\r\n                        removeHelper(OPEN_BLOCK);\r\n                        removeHelper(CREATE_BLOCK);\r\n                    }\r\n                    else {\r\n                        // switch from vnode to block\r\n                        removeHelper(CREATE_VNODE);\r\n                    }\r\n                }\r\n                childBlock.isBlock = !isStableFragment;\r\n                if (childBlock.isBlock) {\r\n                    helper(OPEN_BLOCK);\r\n                    helper(CREATE_BLOCK);\r\n                }\r\n                else {\r\n                    helper(CREATE_VNODE);\r\n                }\r\n            }\r\n            renderExp.arguments.push(createFunctionExpression(createForLoopParams(forNode.parseResult), childBlock, true /* force newline */));\r\n        };\r\n    });\r\n});\r\n// target-agnostic transform used for both Client and SSR\r\nfunction processFor(node, dir, context, processCodegen) {\r\n    if (!dir.exp) {\r\n        context.onError(createCompilerError(30 /* X_V_FOR_NO_EXPRESSION */, dir.loc));\r\n        return;\r\n    }\r\n    const parseResult = parseForExpression(\r\n    // can only be simple expression because vFor transform is applied\r\n    // before expression transform.\r\n    dir.exp, context);\r\n    if (!parseResult) {\r\n        context.onError(createCompilerError(31 /* X_V_FOR_MALFORMED_EXPRESSION */, dir.loc));\r\n        return;\r\n    }\r\n    const { addIdentifiers, removeIdentifiers, scopes } = context;\r\n    const { source, value, key, index } = parseResult;\r\n    const forNode = {\r\n        type: 11 /* FOR */,\r\n        loc: dir.loc,\r\n        source,\r\n        valueAlias: value,\r\n        keyAlias: key,\r\n        objectIndexAlias: index,\r\n        parseResult,\r\n        children: isTemplateNode(node) ? node.children : [node]\r\n    };\r\n    context.replaceNode(forNode);\r\n    // bookkeeping\r\n    scopes.vFor++;\r\n    if (context.prefixIdentifiers) {\r\n        // scope management\r\n        // inject identifiers to context\r\n        value && addIdentifiers(value);\r\n        key && addIdentifiers(key);\r\n        index && addIdentifiers(index);\r\n    }\r\n    const onExit = processCodegen && processCodegen(forNode);\r\n    return () => {\r\n        scopes.vFor--;\r\n        if (context.prefixIdentifiers) {\r\n            value && removeIdentifiers(value);\r\n            key && removeIdentifiers(key);\r\n            index && removeIdentifiers(index);\r\n        }\r\n        if (onExit)\r\n            onExit();\r\n    };\r\n}\r\nconst forAliasRE = /([\\s\\S]*?)\\s+(?:in|of)\\s+([\\s\\S]*)/;\r\n// This regex doesn't cover the case if key or index aliases have destructuring,\r\n// but those do not make sense in the first place, so this works in practice.\r\nconst forIteratorRE = /,([^,\\}\\]]*)(?:,([^,\\}\\]]*))?$/;\r\nconst stripParensRE = /^\\(|\\)$/g;\r\nfunction parseForExpression(input, context) {\r\n    const loc = input.loc;\r\n    const exp = input.content;\r\n    const inMatch = exp.match(forAliasRE);\r\n    if (!inMatch)\r\n        return;\r\n    const [, LHS, RHS] = inMatch;\r\n    const result = {\r\n        source: createAliasExpression(loc, RHS.trim(), exp.indexOf(RHS, LHS.length)),\r\n        value: undefined,\r\n        key: undefined,\r\n        index: undefined\r\n    };\r\n    if (context.prefixIdentifiers) {\r\n        result.source = processExpression(result.source, context);\r\n    }\r\n    let valueContent = LHS.trim()\r\n        .replace(stripParensRE, '')\r\n        .trim();\r\n    const trimmedOffset = LHS.indexOf(valueContent);\r\n    const iteratorMatch = valueContent.match(forIteratorRE);\r\n    if (iteratorMatch) {\r\n        valueContent = valueContent.replace(forIteratorRE, '').trim();\r\n        const keyContent = iteratorMatch[1].trim();\r\n        let keyOffset;\r\n        if (keyContent) {\r\n            keyOffset = exp.indexOf(keyContent, trimmedOffset + valueContent.length);\r\n            result.key = createAliasExpression(loc, keyContent, keyOffset);\r\n            if (context.prefixIdentifiers) {\r\n                result.key = processExpression(result.key, context, true);\r\n            }\r\n        }\r\n        if (iteratorMatch[2]) {\r\n            const indexContent = iteratorMatch[2].trim();\r\n            if (indexContent) {\r\n                result.index = createAliasExpression(loc, indexContent, exp.indexOf(indexContent, result.key\r\n                    ? keyOffset + keyContent.length\r\n                    : trimmedOffset + valueContent.length));\r\n                if (context.prefixIdentifiers) {\r\n                    result.index = processExpression(result.index, context, true);\r\n                }\r\n            }\r\n        }\r\n    }\r\n    if (valueContent) {\r\n        result.value = createAliasExpression(loc, valueContent, trimmedOffset);\r\n        if (context.prefixIdentifiers) {\r\n            result.value = processExpression(result.value, context, true);\r\n        }\r\n    }\r\n    return result;\r\n}\r\nfunction createAliasExpression(range, content, offset) {\r\n    return createSimpleExpression(content, false, getInnerRange(range, offset, content.length));\r\n}\r\nfunction createForLoopParams({ value, key, index }) {\r\n    const params = [];\r\n    if (value) {\r\n        params.push(value);\r\n    }\r\n    if (key) {\r\n        if (!value) {\r\n            params.push(createSimpleExpression(`_`, false));\r\n        }\r\n        params.push(key);\r\n    }\r\n    if (index) {\r\n        if (!key) {\r\n            if (!value) {\r\n                params.push(createSimpleExpression(`_`, false));\r\n            }\r\n            params.push(createSimpleExpression(`__`, false));\r\n        }\r\n        params.push(index);\r\n    }\r\n    return params;\r\n}\n\nconst defaultFallback = createSimpleExpression(`undefined`, false);\r\n// A NodeTransform that:\r\n// 1. Tracks scope identifiers for scoped slots so that they don't get prefixed\r\n//    by transformExpression. This is only applied in non-browser builds with\r\n//    { prefixIdentifiers: true }.\r\n// 2. Track v-slot depths so that we know a slot is inside another slot.\r\n//    Note the exit callback is executed before buildSlots() on the same node,\r\n//    so only nested slots see positive numbers.\r\nconst trackSlotScopes = (node, context) => {\r\n    if (node.type === 1 /* ELEMENT */ &&\r\n        (node.tagType === 1 /* COMPONENT */ ||\r\n            node.tagType === 3 /* TEMPLATE */)) {\r\n        // We are only checking non-empty v-slot here\r\n        // since we only care about slots that introduce scope variables.\r\n        const vSlot = findDir(node, 'slot');\r\n        if (vSlot) {\r\n            const slotProps = vSlot.exp;\r\n            if (context.prefixIdentifiers) {\r\n                slotProps && context.addIdentifiers(slotProps);\r\n            }\r\n            context.scopes.vSlot++;\r\n            return () => {\r\n                if (context.prefixIdentifiers) {\r\n                    slotProps && context.removeIdentifiers(slotProps);\r\n                }\r\n                context.scopes.vSlot--;\r\n            };\r\n        }\r\n    }\r\n};\r\n// A NodeTransform that tracks scope identifiers for scoped slots with v-for.\r\n// This transform is only applied in non-browser builds with { prefixIdentifiers: true }\r\nconst trackVForSlotScopes = (node, context) => {\r\n    let vFor;\r\n    if (isTemplateNode(node) &&\r\n        node.props.some(isVSlot) &&\r\n        (vFor = findDir(node, 'for'))) {\r\n        const result = (vFor.parseResult = parseForExpression(vFor.exp, context));\r\n        if (result) {\r\n            const { value, key, index } = result;\r\n            const { addIdentifiers, removeIdentifiers } = context;\r\n            value && addIdentifiers(value);\r\n            key && addIdentifiers(key);\r\n            index && addIdentifiers(index);\r\n            return () => {\r\n                value && removeIdentifiers(value);\r\n                key && removeIdentifiers(key);\r\n                index && removeIdentifiers(index);\r\n            };\r\n        }\r\n    }\r\n};\r\nconst buildClientSlotFn = (props, children, loc) => createFunctionExpression(props, children, false /* newline */, true /* isSlot */, children.length ? children[0].loc : loc);\r\n// Instead of being a DirectiveTransform, v-slot processing is called during\r\n// transformElement to build the slots object for a component.\r\nfunction buildSlots(node, context, buildSlotFn = buildClientSlotFn) {\r\n    context.helper(WITH_CTX);\r\n    const { children, loc } = node;\r\n    const slotsProperties = [];\r\n    const dynamicSlots = [];\r\n    // If the slot is inside a v-for or another v-slot, force it to be dynamic\r\n    // since it likely uses a scope variable.\r\n    let hasDynamicSlots = context.scopes.vSlot > 0 || context.scopes.vFor > 0;\r\n    // with `prefixIdentifiers: true`, this can be further optimized to make\r\n    // it dynamic only when the slot actually uses the scope variables.\r\n    if (!context.ssr && context.prefixIdentifiers) {\r\n        hasDynamicSlots = hasScopeRef(node, context.identifiers);\r\n    }\r\n    // 1. Check for slot with slotProps on component itself.\r\n    //    <Comp v-slot=\"{ prop }\"/>\r\n    const onComponentSlot = findDir(node, 'slot', true);\r\n    if (onComponentSlot) {\r\n        const { arg, exp } = onComponentSlot;\r\n        if (arg && !isStaticExp(arg)) {\r\n            hasDynamicSlots = true;\r\n        }\r\n        slotsProperties.push(createObjectProperty(arg || createSimpleExpression('default', true), buildSlotFn(exp, children, loc)));\r\n    }\r\n    // 2. Iterate through children and check for template slots\r\n    //    <template v-slot:foo=\"{ prop }\">\r\n    let hasTemplateSlots = false;\r\n    let hasNamedDefaultSlot = false;\r\n    const implicitDefaultChildren = [];\r\n    const seenSlotNames = new Set();\r\n    for (let i = 0; i < children.length; i++) {\r\n        const slotElement = children[i];\r\n        let slotDir;\r\n        if (!isTemplateNode(slotElement) ||\r\n            !(slotDir = findDir(slotElement, 'slot', true))) {\r\n            // not a <template v-slot>, skip.\r\n            if (slotElement.type !== 3 /* COMMENT */) {\r\n                implicitDefaultChildren.push(slotElement);\r\n            }\r\n            continue;\r\n        }\r\n        if (onComponentSlot) {\r\n            // already has on-component slot - this is incorrect usage.\r\n            context.onError(createCompilerError(36 /* X_V_SLOT_MIXED_SLOT_USAGE */, slotDir.loc));\r\n            break;\r\n        }\r\n        hasTemplateSlots = true;\r\n        const { children: slotChildren, loc: slotLoc } = slotElement;\r\n        const { arg: slotName = createSimpleExpression(`default`, true), exp: slotProps, loc: dirLoc } = slotDir;\r\n        // check if name is dynamic.\r\n        let staticSlotName;\r\n        if (isStaticExp(slotName)) {\r\n            staticSlotName = slotName ? slotName.content : `default`;\r\n        }\r\n        else {\r\n            hasDynamicSlots = true;\r\n        }\r\n        const slotFunction = buildSlotFn(slotProps, slotChildren, slotLoc);\r\n        // check if this slot is conditional (v-if/v-for)\r\n        let vIf;\r\n        let vElse;\r\n        let vFor;\r\n        if ((vIf = findDir(slotElement, 'if'))) {\r\n            hasDynamicSlots = true;\r\n            dynamicSlots.push(createConditionalExpression(vIf.exp, buildDynamicSlot(slotName, slotFunction), defaultFallback));\r\n        }\r\n        else if ((vElse = findDir(slotElement, /^else(-if)?$/, true /* allowEmpty */))) {\r\n            // find adjacent v-if\r\n            let j = i;\r\n            let prev;\r\n            while (j--) {\r\n                prev = children[j];\r\n                if (prev.type !== 3 /* COMMENT */) {\r\n                    break;\r\n                }\r\n            }\r\n            if (prev && isTemplateNode(prev) && findDir(prev, 'if')) {\r\n                // remove node\r\n                children.splice(i, 1);\r\n                i--;\r\n                // attach this slot to previous conditional\r\n                let conditional = dynamicSlots[dynamicSlots.length - 1];\r\n                while (conditional.alternate.type === 19 /* JS_CONDITIONAL_EXPRESSION */) {\r\n                    conditional = conditional.alternate;\r\n                }\r\n                conditional.alternate = vElse.exp\r\n                    ? createConditionalExpression(vElse.exp, buildDynamicSlot(slotName, slotFunction), defaultFallback)\r\n                    : buildDynamicSlot(slotName, slotFunction);\r\n            }\r\n            else {\r\n                context.onError(createCompilerError(29 /* X_V_ELSE_NO_ADJACENT_IF */, vElse.loc));\r\n            }\r\n        }\r\n        else if ((vFor = findDir(slotElement, 'for'))) {\r\n            hasDynamicSlots = true;\r\n            const parseResult = vFor.parseResult ||\r\n                parseForExpression(vFor.exp, context);\r\n            if (parseResult) {\r\n                // Render the dynamic slots as an array and add it to the createSlot()\r\n                // args. The runtime knows how to handle it appropriately.\r\n                dynamicSlots.push(createCallExpression(context.helper(RENDER_LIST), [\r\n                    parseResult.source,\r\n                    createFunctionExpression(createForLoopParams(parseResult), buildDynamicSlot(slotName, slotFunction), true /* force newline */)\r\n                ]));\r\n            }\r\n            else {\r\n                context.onError(createCompilerError(31 /* X_V_FOR_MALFORMED_EXPRESSION */, vFor.loc));\r\n            }\r\n        }\r\n        else {\r\n            // check duplicate static names\r\n            if (staticSlotName) {\r\n                if (seenSlotNames.has(staticSlotName)) {\r\n                    context.onError(createCompilerError(37 /* X_V_SLOT_DUPLICATE_SLOT_NAMES */, dirLoc));\r\n                    continue;\r\n                }\r\n                seenSlotNames.add(staticSlotName);\r\n                if (staticSlotName === 'default') {\r\n                    hasNamedDefaultSlot = true;\r\n                }\r\n            }\r\n            slotsProperties.push(createObjectProperty(slotName, slotFunction));\r\n        }\r\n    }\r\n    if (!onComponentSlot) {\r\n        const buildDefaultSlotProperty = (props, children) => {\r\n            const fn = buildSlotFn(props, children, loc);\r\n            if (context.compatConfig) {\r\n                fn.isNonScopedSlot = true;\r\n            }\r\n            return createObjectProperty(`default`, fn);\r\n        };\r\n        if (!hasTemplateSlots) {\r\n            // implicit default slot (on component)\r\n            slotsProperties.push(buildDefaultSlotProperty(undefined, children));\r\n        }\r\n        else if (implicitDefaultChildren.length &&\r\n            // #3766\r\n            // with whitespace: 'preserve', whitespaces between slots will end up in\r\n            // implicitDefaultChildren. Ignore if all implicit children are whitespaces.\r\n            implicitDefaultChildren.some(node => isNonWhitespaceContent(node))) {\r\n            // implicit default slot (mixed with named slots)\r\n            if (hasNamedDefaultSlot) {\r\n                context.onError(createCompilerError(38 /* X_V_SLOT_EXTRANEOUS_DEFAULT_SLOT_CHILDREN */, implicitDefaultChildren[0].loc));\r\n            }\r\n            else {\r\n                slotsProperties.push(buildDefaultSlotProperty(undefined, implicitDefaultChildren));\r\n            }\r\n        }\r\n    }\r\n    const slotFlag = hasDynamicSlots\r\n        ? 2 /* DYNAMIC */\r\n        : hasForwardedSlots(node.children)\r\n            ? 3 /* FORWARDED */\r\n            : 1 /* STABLE */;\r\n    let slots = createObjectExpression(slotsProperties.concat(createObjectProperty(`_`, \r\n    // 2 = compiled but dynamic = can skip normalization, but must run diff\r\n    // 1 = compiled and static = can skip normalization AND diff as optimized\r\n    createSimpleExpression(slotFlag + (``), false))), loc);\r\n    if (dynamicSlots.length) {\r\n        slots = createCallExpression(context.helper(CREATE_SLOTS), [\r\n            slots,\r\n            createArrayExpression(dynamicSlots)\r\n        ]);\r\n    }\r\n    return {\r\n        slots,\r\n        hasDynamicSlots\r\n    };\r\n}\r\nfunction buildDynamicSlot(name, fn) {\r\n    return createObjectExpression([\r\n        createObjectProperty(`name`, name),\r\n        createObjectProperty(`fn`, fn)\r\n    ]);\r\n}\r\nfunction hasForwardedSlots(children) {\r\n    for (let i = 0; i < children.length; i++) {\r\n        const child = children[i];\r\n        switch (child.type) {\r\n            case 1 /* ELEMENT */:\r\n                if (child.tagType === 2 /* SLOT */ ||\r\n                    (child.tagType === 0 /* ELEMENT */ &&\r\n                        hasForwardedSlots(child.children))) {\r\n                    return true;\r\n                }\r\n                break;\r\n            case 9 /* IF */:\r\n                if (hasForwardedSlots(child.branches))\r\n                    return true;\r\n                break;\r\n            case 10 /* IF_BRANCH */:\r\n            case 11 /* FOR */:\r\n                if (hasForwardedSlots(child.children))\r\n                    return true;\r\n                break;\r\n        }\r\n    }\r\n    return false;\r\n}\r\nfunction isNonWhitespaceContent(node) {\r\n    if (node.type !== 2 /* TEXT */ && node.type !== 12 /* TEXT_CALL */)\r\n        return true;\r\n    return node.type === 2 /* TEXT */\r\n        ? !!node.content.trim()\r\n        : isNonWhitespaceContent(node.content);\r\n}\n\n// some directive transforms (e.g. v-model) may return a symbol for runtime\r\n// import, which should be used instead of a resolveDirective call.\r\nconst directiveImportMap = new WeakMap();\r\n// generate a JavaScript AST for this element's codegen\r\nconst transformElement = (node, context) => {\r\n    // perform the work on exit, after all child expressions have been\r\n    // processed and merged.\r\n    return function postTransformElement() {\r\n        node = context.currentNode;\r\n        if (!(node.type === 1 /* ELEMENT */ &&\r\n            (node.tagType === 0 /* ELEMENT */ ||\r\n                node.tagType === 1 /* COMPONENT */))) {\r\n            return;\r\n        }\r\n        const { tag, props } = node;\r\n        const isComponent = node.tagType === 1 /* COMPONENT */;\r\n        // The goal of the transform is to create a codegenNode implementing the\r\n        // VNodeCall interface.\r\n        let vnodeTag = isComponent\r\n            ? resolveComponentType(node, context)\r\n            : `\"${tag}\"`;\r\n        const isDynamicComponent = shared.isObject(vnodeTag) && vnodeTag.callee === RESOLVE_DYNAMIC_COMPONENT;\r\n        let vnodeProps;\r\n        let vnodeChildren;\r\n        let vnodePatchFlag;\r\n        let patchFlag = 0;\r\n        let vnodeDynamicProps;\r\n        let dynamicPropNames;\r\n        let vnodeDirectives;\r\n        let shouldUseBlock = \r\n        // dynamic component may resolve to plain elements\r\n        isDynamicComponent ||\r\n            vnodeTag === TELEPORT ||\r\n            vnodeTag === SUSPENSE ||\r\n            (!isComponent &&\r\n                // <svg> and <foreignObject> must be forced into blocks so that block\r\n                // updates inside get proper isSVG flag at runtime. (#639, #643)\r\n                // This is technically web-specific, but splitting the logic out of core\r\n                // leads to too much unnecessary complexity.\r\n                (tag === 'svg' ||\r\n                    tag === 'foreignObject' ||\r\n                    // #938: elements with dynamic keys should be forced into blocks\r\n                    findProp(node, 'key', true)));\r\n        // props\r\n        if (props.length > 0) {\r\n            const propsBuildResult = buildProps(node, context);\r\n            vnodeProps = propsBuildResult.props;\r\n            patchFlag = propsBuildResult.patchFlag;\r\n            dynamicPropNames = propsBuildResult.dynamicPropNames;\r\n            const directives = propsBuildResult.directives;\r\n            vnodeDirectives =\r\n                directives && directives.length\r\n                    ? createArrayExpression(directives.map(dir => buildDirectiveArgs(dir, context)))\r\n                    : undefined;\r\n        }\r\n        // children\r\n        if (node.children.length > 0) {\r\n            if (vnodeTag === KEEP_ALIVE) {\r\n                // Although a built-in component, we compile KeepAlive with raw children\r\n                // instead of slot functions so that it can be used inside Transition\r\n                // or other Transition-wrapping HOCs.\r\n                // To ensure correct updates with block optimizations, we need to:\r\n                // 1. Force keep-alive into a block. This avoids its children being\r\n                //    collected by a parent block.\r\n                shouldUseBlock = true;\r\n                // 2. Force keep-alive to always be updated, since it uses raw children.\r\n                patchFlag |= 1024 /* DYNAMIC_SLOTS */;\r\n            }\r\n            const shouldBuildAsSlots = isComponent &&\r\n                // Teleport is not a real component and has dedicated runtime handling\r\n                vnodeTag !== TELEPORT &&\r\n                // explained above.\r\n                vnodeTag !== KEEP_ALIVE;\r\n            if (shouldBuildAsSlots) {\r\n                const { slots, hasDynamicSlots } = buildSlots(node, context);\r\n                vnodeChildren = slots;\r\n                if (hasDynamicSlots) {\r\n                    patchFlag |= 1024 /* DYNAMIC_SLOTS */;\r\n                }\r\n            }\r\n            else if (node.children.length === 1 && vnodeTag !== TELEPORT) {\r\n                const child = node.children[0];\r\n                const type = child.type;\r\n                // check for dynamic text children\r\n                const hasDynamicTextChild = type === 5 /* INTERPOLATION */ ||\r\n                    type === 8 /* COMPOUND_EXPRESSION */;\r\n                if (hasDynamicTextChild &&\r\n                    getConstantType(child, context) === 0 /* NOT_CONSTANT */) {\r\n                    patchFlag |= 1 /* TEXT */;\r\n                }\r\n                // pass directly if the only child is a text node\r\n                // (plain / interpolation / expression)\r\n                if (hasDynamicTextChild || type === 2 /* TEXT */) {\r\n                    vnodeChildren = child;\r\n                }\r\n                else {\r\n                    vnodeChildren = node.children;\r\n                }\r\n            }\r\n            else {\r\n                vnodeChildren = node.children;\r\n            }\r\n        }\r\n        // patchFlag & dynamicPropNames\r\n        if (patchFlag !== 0) {\r\n            {\r\n                vnodePatchFlag = String(patchFlag);\r\n            }\r\n            if (dynamicPropNames && dynamicPropNames.length) {\r\n                vnodeDynamicProps = stringifyDynamicPropNames(dynamicPropNames);\r\n            }\r\n        }\r\n        node.codegenNode = createVNodeCall(context, vnodeTag, vnodeProps, vnodeChildren, vnodePatchFlag, vnodeDynamicProps, vnodeDirectives, !!shouldUseBlock, false /* disableTracking */, node.loc);\r\n    };\r\n};\r\nfunction resolveComponentType(node, context, ssr = false) {\r\n    let { tag } = node;\r\n    // 1. dynamic component\r\n    const isExplicitDynamic = isComponentTag(tag);\r\n    const isProp = findProp(node, 'is') || (!isExplicitDynamic && findDir(node, 'is'));\r\n    if (isProp) {\r\n        if (!isExplicitDynamic && isProp.type === 6 /* ATTRIBUTE */) {\r\n            // <button is=\"vue:xxx\">\r\n            // if not <component>, only is value that starts with \"vue:\" will be\r\n            // treated as component by the parse phase and reach here, unless it's\r\n            // compat mode where all is values are considered components\r\n            tag = isProp.value.content.replace(/^vue:/, '');\r\n        }\r\n        else {\r\n            const exp = isProp.type === 6 /* ATTRIBUTE */\r\n                ? isProp.value && createSimpleExpression(isProp.value.content, true)\r\n                : isProp.exp;\r\n            if (exp) {\r\n                return createCallExpression(context.helper(RESOLVE_DYNAMIC_COMPONENT), [\r\n                    exp\r\n                ]);\r\n            }\r\n        }\r\n    }\r\n    // 2. built-in components (Teleport, Transition, KeepAlive, Suspense...)\r\n    const builtIn = isCoreComponent(tag) || context.isBuiltInComponent(tag);\r\n    if (builtIn) {\r\n        // built-ins are simply fallthroughs / have special handling during ssr\r\n        // so we don't need to import their runtime equivalents\r\n        if (!ssr)\r\n            context.helper(builtIn);\r\n        return builtIn;\r\n    }\r\n    // 3. user component (from setup bindings)\r\n    // this is skipped in browser build since browser builds do not perform\r\n    // binding analysis.\r\n    {\r\n        const fromSetup = resolveSetupReference(tag, context);\r\n        if (fromSetup) {\r\n            return fromSetup;\r\n        }\r\n    }\r\n    // 4. Self referencing component (inferred from filename)\r\n    if (context.selfName &&\r\n        shared.capitalize(shared.camelize(tag)) === context.selfName) {\r\n        context.helper(RESOLVE_COMPONENT);\r\n        // codegen.ts has special check for __self postfix when generating\r\n        // component imports, which will pass additional `maybeSelfReference` flag\r\n        // to `resolveComponent`.\r\n        context.components.add(tag + `__self`);\r\n        return toValidAssetId(tag, `component`);\r\n    }\r\n    // 5. user component (resolve)\r\n    context.helper(RESOLVE_COMPONENT);\r\n    context.components.add(tag);\r\n    return toValidAssetId(tag, `component`);\r\n}\r\nfunction resolveSetupReference(name, context) {\r\n    const bindings = context.bindingMetadata;\r\n    if (!bindings || bindings.__isScriptSetup === false) {\r\n        return;\r\n    }\r\n    const camelName = shared.camelize(name);\r\n    const PascalName = shared.capitalize(camelName);\r\n    const checkType = (type) => {\r\n        if (bindings[name] === type) {\r\n            return name;\r\n        }\r\n        if (bindings[camelName] === type) {\r\n            return camelName;\r\n        }\r\n        if (bindings[PascalName] === type) {\r\n            return PascalName;\r\n        }\r\n    };\r\n    const fromConst = checkType(\"setup-const\" /* SETUP_CONST */);\r\n    if (fromConst) {\r\n        return context.inline\r\n            ? // in inline mode, const setup bindings (e.g. imports) can be used as-is\r\n                fromConst\r\n            : `$setup[${JSON.stringify(fromConst)}]`;\r\n    }\r\n    const fromMaybeRef = checkType(\"setup-let\" /* SETUP_LET */) ||\r\n        checkType(\"setup-ref\" /* SETUP_REF */) ||\r\n        checkType(\"setup-maybe-ref\" /* SETUP_MAYBE_REF */);\r\n    if (fromMaybeRef) {\r\n        return context.inline\r\n            ? // setup scope bindings that may be refs need to be unrefed\r\n                `${context.helperString(UNREF)}(${fromMaybeRef})`\r\n            : `$setup[${JSON.stringify(fromMaybeRef)}]`;\r\n    }\r\n}\r\nfunction buildProps(node, context, props = node.props, ssr = false) {\r\n    const { tag, loc: elementLoc } = node;\r\n    const isComponent = node.tagType === 1 /* COMPONENT */;\r\n    let properties = [];\r\n    const mergeArgs = [];\r\n    const runtimeDirectives = [];\r\n    // patchFlag analysis\r\n    let patchFlag = 0;\r\n    let hasRef = false;\r\n    let hasClassBinding = false;\r\n    let hasStyleBinding = false;\r\n    let hasHydrationEventBinding = false;\r\n    let hasDynamicKeys = false;\r\n    let hasVnodeHook = false;\r\n    const dynamicPropNames = [];\r\n    const analyzePatchFlag = ({ key, value }) => {\r\n        if (isStaticExp(key)) {\r\n            const name = key.content;\r\n            const isEventHandler = shared.isOn(name);\r\n            if (!isComponent &&\r\n                isEventHandler &&\r\n                // omit the flag for click handlers because hydration gives click\r\n                // dedicated fast path.\r\n                name.toLowerCase() !== 'onclick' &&\r\n                // omit v-model handlers\r\n                name !== 'onUpdate:modelValue' &&\r\n                // omit onVnodeXXX hooks\r\n                !shared.isReservedProp(name)) {\r\n                hasHydrationEventBinding = true;\r\n            }\r\n            if (isEventHandler && shared.isReservedProp(name)) {\r\n                hasVnodeHook = true;\r\n            }\r\n            if (value.type === 20 /* JS_CACHE_EXPRESSION */ ||\r\n                ((value.type === 4 /* SIMPLE_EXPRESSION */ ||\r\n                    value.type === 8 /* COMPOUND_EXPRESSION */) &&\r\n                    getConstantType(value, context) > 0)) {\r\n                // skip if the prop is a cached handler or has constant value\r\n                return;\r\n            }\r\n            if (name === 'ref') {\r\n                hasRef = true;\r\n            }\r\n            else if (name === 'class' && !isComponent) {\r\n                hasClassBinding = true;\r\n            }\r\n            else if (name === 'style' && !isComponent) {\r\n                hasStyleBinding = true;\r\n            }\r\n            else if (name !== 'key' && !dynamicPropNames.includes(name)) {\r\n                dynamicPropNames.push(name);\r\n            }\r\n        }\r\n        else {\r\n            hasDynamicKeys = true;\r\n        }\r\n    };\r\n    for (let i = 0; i < props.length; i++) {\r\n        // static attribute\r\n        const prop = props[i];\r\n        if (prop.type === 6 /* ATTRIBUTE */) {\r\n            const { loc, name, value } = prop;\r\n            let isStatic = true;\r\n            if (name === 'ref') {\r\n                hasRef = true;\r\n                // in inline mode there is no setupState object, so we can't use string\r\n                // keys to set the ref. Instead, we need to transform it to pass the\r\n                // acrtual ref instead.\r\n                if (context.inline) {\r\n                    isStatic = false;\r\n                }\r\n            }\r\n            // skip is on <component>, or is=\"vue:xxx\"\r\n            if (name === 'is' &&\r\n                (isComponentTag(tag) || (value && value.content.startsWith('vue:')))) {\r\n                continue;\r\n            }\r\n            properties.push(createObjectProperty(createSimpleExpression(name, true, getInnerRange(loc, 0, name.length)), createSimpleExpression(value ? value.content : '', isStatic, value ? value.loc : loc)));\r\n        }\r\n        else {\r\n            // directives\r\n            const { name, arg, exp, loc } = prop;\r\n            const isVBind = name === 'bind';\r\n            const isVOn = name === 'on';\r\n            // skip v-slot - it is handled by its dedicated transform.\r\n            if (name === 'slot') {\r\n                if (!isComponent) {\r\n                    context.onError(createCompilerError(39 /* X_V_SLOT_MISPLACED */, loc));\r\n                }\r\n                continue;\r\n            }\r\n            // skip v-once - it is handled by its dedicated transform.\r\n            if (name === 'once') {\r\n                continue;\r\n            }\r\n            // skip v-is and :is on <component>\r\n            if (name === 'is' ||\r\n                (isVBind && isComponentTag(tag) && isBindKey(arg, 'is'))) {\r\n                continue;\r\n            }\r\n            // skip v-on in SSR compilation\r\n            if (isVOn && ssr) {\r\n                continue;\r\n            }\r\n            // special case for v-bind and v-on with no argument\r\n            if (!arg && (isVBind || isVOn)) {\r\n                hasDynamicKeys = true;\r\n                if (exp) {\r\n                    if (properties.length) {\r\n                        mergeArgs.push(createObjectExpression(dedupeProperties(properties), elementLoc));\r\n                        properties = [];\r\n                    }\r\n                    if (isVBind) {\r\n                        {\r\n                            if (isCompatEnabled(\"COMPILER_V_BIND_OBJECT_ORDER\" /* COMPILER_V_BIND_OBJECT_ORDER */, context)) {\r\n                                mergeArgs.unshift(exp);\r\n                                continue;\r\n                            }\r\n                        }\r\n                        mergeArgs.push(exp);\r\n                    }\r\n                    else {\r\n                        // v-on=\"obj\" -> toHandlers(obj)\r\n                        mergeArgs.push({\r\n                            type: 14 /* JS_CALL_EXPRESSION */,\r\n                            loc,\r\n                            callee: context.helper(TO_HANDLERS),\r\n                            arguments: [exp]\r\n                        });\r\n                    }\r\n                }\r\n                else {\r\n                    context.onError(createCompilerError(isVBind\r\n                        ? 33 /* X_V_BIND_NO_EXPRESSION */\r\n                        : 34 /* X_V_ON_NO_EXPRESSION */, loc));\r\n                }\r\n                continue;\r\n            }\r\n            const directiveTransform = context.directiveTransforms[name];\r\n            if (directiveTransform) {\r\n                // has built-in directive transform.\r\n                const { props, needRuntime } = directiveTransform(prop, node, context);\r\n                !ssr && props.forEach(analyzePatchFlag);\r\n                properties.push(...props);\r\n                if (needRuntime) {\r\n                    runtimeDirectives.push(prop);\r\n                    if (shared.isSymbol(needRuntime)) {\r\n                        directiveImportMap.set(prop, needRuntime);\r\n                    }\r\n                }\r\n            }\r\n            else {\r\n                // no built-in transform, this is a user custom directive.\r\n                runtimeDirectives.push(prop);\r\n            }\r\n        }\r\n        if (prop.type === 6 /* ATTRIBUTE */ &&\r\n            prop.name === 'ref' &&\r\n            context.scopes.vFor > 0 &&\r\n            checkCompatEnabled(\"COMPILER_V_FOR_REF\" /* COMPILER_V_FOR_REF */, context, prop.loc)) {\r\n            properties.push(createObjectProperty(createSimpleExpression('refInFor', true), createSimpleExpression('true', false)));\r\n        }\r\n    }\r\n    let propsExpression = undefined;\r\n    // has v-bind=\"object\" or v-on=\"object\", wrap with mergeProps\r\n    if (mergeArgs.length) {\r\n        if (properties.length) {\r\n            mergeArgs.push(createObjectExpression(dedupeProperties(properties), elementLoc));\r\n        }\r\n        if (mergeArgs.length > 1) {\r\n            propsExpression = createCallExpression(context.helper(MERGE_PROPS), mergeArgs, elementLoc);\r\n        }\r\n        else {\r\n            // single v-bind with nothing else - no need for a mergeProps call\r\n            propsExpression = mergeArgs[0];\r\n        }\r\n    }\r\n    else if (properties.length) {\r\n        propsExpression = createObjectExpression(dedupeProperties(properties), elementLoc);\r\n    }\r\n    // patchFlag analysis\r\n    if (hasDynamicKeys) {\r\n        patchFlag |= 16 /* FULL_PROPS */;\r\n    }\r\n    else {\r\n        if (hasClassBinding) {\r\n            patchFlag |= 2 /* CLASS */;\r\n        }\r\n        if (hasStyleBinding) {\r\n            patchFlag |= 4 /* STYLE */;\r\n        }\r\n        if (dynamicPropNames.length) {\r\n            patchFlag |= 8 /* PROPS */;\r\n        }\r\n        if (hasHydrationEventBinding) {\r\n            patchFlag |= 32 /* HYDRATE_EVENTS */;\r\n        }\r\n    }\r\n    if ((patchFlag === 0 || patchFlag === 32 /* HYDRATE_EVENTS */) &&\r\n        (hasRef || hasVnodeHook || runtimeDirectives.length > 0)) {\r\n        patchFlag |= 512 /* NEED_PATCH */;\r\n    }\r\n    return {\r\n        props: propsExpression,\r\n        directives: runtimeDirectives,\r\n        patchFlag,\r\n        dynamicPropNames\r\n    };\r\n}\r\n// Dedupe props in an object literal.\r\n// Literal duplicated attributes would have been warned during the parse phase,\r\n// however, it's possible to encounter duplicated `onXXX` handlers with different\r\n// modifiers. We also need to merge static and dynamic class / style attributes.\r\n// - onXXX handlers / style: merge into array\r\n// - class: merge into single expression with concatenation\r\nfunction dedupeProperties(properties) {\r\n    const knownProps = new Map();\r\n    const deduped = [];\r\n    for (let i = 0; i < properties.length; i++) {\r\n        const prop = properties[i];\r\n        // dynamic keys are always allowed\r\n        if (prop.key.type === 8 /* COMPOUND_EXPRESSION */ || !prop.key.isStatic) {\r\n            deduped.push(prop);\r\n            continue;\r\n        }\r\n        const name = prop.key.content;\r\n        const existing = knownProps.get(name);\r\n        if (existing) {\r\n            if (name === 'style' || name === 'class' || name.startsWith('on')) {\r\n                mergeAsArray(existing, prop);\r\n            }\r\n            // unexpected duplicate, should have emitted error during parse\r\n        }\r\n        else {\r\n            knownProps.set(name, prop);\r\n            deduped.push(prop);\r\n        }\r\n    }\r\n    return deduped;\r\n}\r\nfunction mergeAsArray(existing, incoming) {\r\n    if (existing.value.type === 17 /* JS_ARRAY_EXPRESSION */) {\r\n        existing.value.elements.push(incoming.value);\r\n    }\r\n    else {\r\n        existing.value = createArrayExpression([existing.value, incoming.value], existing.loc);\r\n    }\r\n}\r\nfunction buildDirectiveArgs(dir, context) {\r\n    const dirArgs = [];\r\n    const runtime = directiveImportMap.get(dir);\r\n    if (runtime) {\r\n        // built-in directive with runtime\r\n        dirArgs.push(context.helperString(runtime));\r\n    }\r\n    else {\r\n        // user directive.\r\n        // see if we have directives exposed via <script setup>\r\n        const fromSetup = resolveSetupReference(dir.name, context);\r\n        if (fromSetup) {\r\n            dirArgs.push(fromSetup);\r\n        }\r\n        else {\r\n            // inject statement for resolving directive\r\n            context.helper(RESOLVE_DIRECTIVE);\r\n            context.directives.add(dir.name);\r\n            dirArgs.push(toValidAssetId(dir.name, `directive`));\r\n        }\r\n    }\r\n    const { loc } = dir;\r\n    if (dir.exp)\r\n        dirArgs.push(dir.exp);\r\n    if (dir.arg) {\r\n        if (!dir.exp) {\r\n            dirArgs.push(`void 0`);\r\n        }\r\n        dirArgs.push(dir.arg);\r\n    }\r\n    if (Object.keys(dir.modifiers).length) {\r\n        if (!dir.arg) {\r\n            if (!dir.exp) {\r\n                dirArgs.push(`void 0`);\r\n            }\r\n            dirArgs.push(`void 0`);\r\n        }\r\n        const trueExpression = createSimpleExpression(`true`, false, loc);\r\n        dirArgs.push(createObjectExpression(dir.modifiers.map(modifier => createObjectProperty(modifier, trueExpression)), loc));\r\n    }\r\n    return createArrayExpression(dirArgs, dir.loc);\r\n}\r\nfunction stringifyDynamicPropNames(props) {\r\n    let propsNamesString = `[`;\r\n    for (let i = 0, l = props.length; i < l; i++) {\r\n        propsNamesString += JSON.stringify(props[i]);\r\n        if (i < l - 1)\r\n            propsNamesString += ', ';\r\n    }\r\n    return propsNamesString + `]`;\r\n}\r\nfunction isComponentTag(tag) {\r\n    return tag[0].toLowerCase() + tag.slice(1) === 'component';\r\n}\n\nconst cacheStringFunction = (fn) => {\r\n    const cache = Object.create(null);\r\n    return ((str) => {\r\n        const hit = cache[str];\r\n        return hit || (cache[str] = fn(str));\r\n    });\r\n};\r\nconst camelizeRE = /-(\\w)/g;\r\n/**\r\n * @private\r\n */\r\nconst camelize = cacheStringFunction((str) => {\r\n    return str.replace(camelizeRE, (_, c) => (c ? c.toUpperCase() : ''));\r\n});\n\nconst transformSlotOutlet = (node, context) => {\r\n    if (isSlotOutlet(node)) {\r\n        const { children, loc } = node;\r\n        const { slotName, slotProps } = processSlotOutlet(node, context);\r\n        const slotArgs = [\r\n            context.prefixIdentifiers ? `_ctx.$slots` : `$slots`,\r\n            slotName\r\n        ];\r\n        if (slotProps) {\r\n            slotArgs.push(slotProps);\r\n        }\r\n        if (children.length) {\r\n            if (!slotProps) {\r\n                slotArgs.push(`{}`);\r\n            }\r\n            slotArgs.push(createFunctionExpression([], children, false, false, loc));\r\n        }\r\n        if (context.scopeId && !context.slotted) {\r\n            if (!slotProps) {\r\n                slotArgs.push(`{}`);\r\n            }\r\n            if (!children.length) {\r\n                slotArgs.push(`undefined`);\r\n            }\r\n            slotArgs.push(`true`);\r\n        }\r\n        node.codegenNode = createCallExpression(context.helper(RENDER_SLOT), slotArgs, loc);\r\n    }\r\n};\r\nfunction processSlotOutlet(node, context) {\r\n    let slotName = `\"default\"`;\r\n    let slotProps = undefined;\r\n    const nonNameProps = [];\r\n    for (let i = 0; i < node.props.length; i++) {\r\n        const p = node.props[i];\r\n        if (p.type === 6 /* ATTRIBUTE */) {\r\n            if (p.value) {\r\n                if (p.name === 'name') {\r\n                    slotName = JSON.stringify(p.value.content);\r\n                }\r\n                else {\r\n                    p.name = camelize(p.name);\r\n                    nonNameProps.push(p);\r\n                }\r\n            }\r\n        }\r\n        else {\r\n            if (p.name === 'bind' && isBindKey(p.arg, 'name')) {\r\n                if (p.exp)\r\n                    slotName = p.exp;\r\n            }\r\n            else {\r\n                if (p.name === 'bind' && p.arg && isStaticExp(p.arg)) {\r\n                    p.arg.content = camelize(p.arg.content);\r\n                }\r\n                nonNameProps.push(p);\r\n            }\r\n        }\r\n    }\r\n    if (nonNameProps.length > 0) {\r\n        const { props, directives } = buildProps(node, context, nonNameProps);\r\n        slotProps = props;\r\n        if (directives.length) {\r\n            context.onError(createCompilerError(35 /* X_V_SLOT_UNEXPECTED_DIRECTIVE_ON_SLOT_OUTLET */, directives[0].loc));\r\n        }\r\n    }\r\n    return {\r\n        slotName,\r\n        slotProps\r\n    };\r\n}\n\nconst fnExpRE = /^\\s*([\\w$_]+|\\([^)]*?\\))\\s*=>|^\\s*function(?:\\s+[\\w$]+)?\\s*\\(/;\r\nconst transformOn = (dir, node, context, augmentor) => {\r\n    const { loc, modifiers, arg } = dir;\r\n    if (!dir.exp && !modifiers.length) {\r\n        context.onError(createCompilerError(34 /* X_V_ON_NO_EXPRESSION */, loc));\r\n    }\r\n    let eventName;\r\n    if (arg.type === 4 /* SIMPLE_EXPRESSION */) {\r\n        if (arg.isStatic) {\r\n            const rawName = arg.content;\r\n            // for all event listeners, auto convert it to camelCase. See issue #2249\r\n            eventName = createSimpleExpression(shared.toHandlerKey(shared.camelize(rawName)), true, arg.loc);\r\n        }\r\n        else {\r\n            // #2388\r\n            eventName = createCompoundExpression([\r\n                `${context.helperString(TO_HANDLER_KEY)}(`,\r\n                arg,\r\n                `)`\r\n            ]);\r\n        }\r\n    }\r\n    else {\r\n        // already a compound expression.\r\n        eventName = arg;\r\n        eventName.children.unshift(`${context.helperString(TO_HANDLER_KEY)}(`);\r\n        eventName.children.push(`)`);\r\n    }\r\n    // handler processing\r\n    let exp = dir.exp;\r\n    if (exp && !exp.content.trim()) {\r\n        exp = undefined;\r\n    }\r\n    let shouldCache = context.cacheHandlers && !exp;\r\n    if (exp) {\r\n        const isMemberExp = isMemberExpression(exp.content);\r\n        const isInlineStatement = !(isMemberExp || fnExpRE.test(exp.content));\r\n        const hasMultipleStatements = exp.content.includes(`;`);\r\n        // process the expression since it's been skipped\r\n        if (context.prefixIdentifiers) {\r\n            isInlineStatement && context.addIdentifiers(`$event`);\r\n            exp = dir.exp = processExpression(exp, context, false, hasMultipleStatements);\r\n            isInlineStatement && context.removeIdentifiers(`$event`);\r\n            // with scope analysis, the function is hoistable if it has no reference\r\n            // to scope variables.\r\n            shouldCache =\r\n                context.cacheHandlers &&\r\n                    // runtime constants don't need to be cached\r\n                    // (this is analyzed by compileScript in SFC <script setup>)\r\n                    !(exp.type === 4 /* SIMPLE_EXPRESSION */ && exp.constType > 0) &&\r\n                    // #1541 bail if this is a member exp handler passed to a component -\r\n                    // we need to use the original function to preserve arity,\r\n                    // e.g. <transition> relies on checking cb.length to determine\r\n                    // transition end handling. Inline function is ok since its arity\r\n                    // is preserved even when cached.\r\n                    !(isMemberExp && node.tagType === 1 /* COMPONENT */) &&\r\n                    // bail if the function references closure variables (v-for, v-slot)\r\n                    // it must be passed fresh to avoid stale values.\r\n                    !hasScopeRef(exp, context.identifiers);\r\n            // If the expression is optimizable and is a member expression pointing\r\n            // to a function, turn it into invocation (and wrap in an arrow function\r\n            // below) so that it always accesses the latest value when called - thus\r\n            // avoiding the need to be patched.\r\n            if (shouldCache && isMemberExp) {\r\n                if (exp.type === 4 /* SIMPLE_EXPRESSION */) {\r\n                    exp.content = `${exp.content} && ${exp.content}(...args)`;\r\n                }\r\n                else {\r\n                    exp.children = [...exp.children, ` && `, ...exp.children, `(...args)`];\r\n                }\r\n            }\r\n        }\r\n        if (isInlineStatement || (shouldCache && isMemberExp)) {\r\n            // wrap inline statement in a function expression\r\n            exp = createCompoundExpression([\r\n                `${isInlineStatement\r\n                    ? context.isTS\r\n                        ? `($event: any)`\r\n                        : `$event`\r\n                    : `${context.isTS ? `\\n//@ts-ignore\\n` : ``}(...args)`} => ${hasMultipleStatements ? `{` : `(`}`,\r\n                exp,\r\n                hasMultipleStatements ? `}` : `)`\r\n            ]);\r\n        }\r\n    }\r\n    let ret = {\r\n        props: [\r\n            createObjectProperty(eventName, exp || createSimpleExpression(`() => {}`, false, loc))\r\n        ]\r\n    };\r\n    // apply extended compiler augmentor\r\n    if (augmentor) {\r\n        ret = augmentor(ret);\r\n    }\r\n    if (shouldCache) {\r\n        // cache handlers so that it's always the same handler being passed down.\r\n        // this avoids unnecessary re-renders when users use inline handlers on\r\n        // components.\r\n        ret.props[0].value = context.cache(ret.props[0].value);\r\n    }\r\n    return ret;\r\n};\n\n// v-bind without arg is handled directly in ./transformElements.ts due to it affecting\r\n// codegen for the entire props object. This transform here is only for v-bind\r\n// *with* args.\r\nconst transformBind = (dir, _node, context) => {\r\n    const { exp, modifiers, loc } = dir;\r\n    const arg = dir.arg;\r\n    if (arg.type !== 4 /* SIMPLE_EXPRESSION */) {\r\n        arg.children.unshift(`(`);\r\n        arg.children.push(`) || \"\"`);\r\n    }\r\n    else if (!arg.isStatic) {\r\n        arg.content = `${arg.content} || \"\"`;\r\n    }\r\n    // .prop is no longer necessary due to new patch behavior\r\n    // .sync is replaced by v-model:arg\r\n    if (modifiers.includes('camel')) {\r\n        if (arg.type === 4 /* SIMPLE_EXPRESSION */) {\r\n            if (arg.isStatic) {\r\n                arg.content = shared.camelize(arg.content);\r\n            }\r\n            else {\r\n                arg.content = `${context.helperString(CAMELIZE)}(${arg.content})`;\r\n            }\r\n        }\r\n        else {\r\n            arg.children.unshift(`${context.helperString(CAMELIZE)}(`);\r\n            arg.children.push(`)`);\r\n        }\r\n    }\r\n    if (!exp ||\r\n        (exp.type === 4 /* SIMPLE_EXPRESSION */ && !exp.content.trim())) {\r\n        context.onError(createCompilerError(33 /* X_V_BIND_NO_EXPRESSION */, loc));\r\n        return {\r\n            props: [createObjectProperty(arg, createSimpleExpression('', true, loc))]\r\n        };\r\n    }\r\n    return {\r\n        props: [createObjectProperty(arg, exp)]\r\n    };\r\n};\n\n// Merge adjacent text nodes and expressions into a single expression\r\n// e.g. <div>abc {{ d }} {{ e }}</div> should have a single expression node as child.\r\nconst transformText = (node, context) => {\r\n    if (node.type === 0 /* ROOT */ ||\r\n        node.type === 1 /* ELEMENT */ ||\r\n        node.type === 11 /* FOR */ ||\r\n        node.type === 10 /* IF_BRANCH */) {\r\n        // perform the transform on node exit so that all expressions have already\r\n        // been processed.\r\n        return () => {\r\n            const children = node.children;\r\n            let currentContainer = undefined;\r\n            let hasText = false;\r\n            for (let i = 0; i < children.length; i++) {\r\n                const child = children[i];\r\n                if (isText(child)) {\r\n                    hasText = true;\r\n                    for (let j = i + 1; j < children.length; j++) {\r\n                        const next = children[j];\r\n                        if (isText(next)) {\r\n                            if (!currentContainer) {\r\n                                currentContainer = children[i] = {\r\n                                    type: 8 /* COMPOUND_EXPRESSION */,\r\n                                    loc: child.loc,\r\n                                    children: [child]\r\n                                };\r\n                            }\r\n                            // merge adjacent text node into current\r\n                            currentContainer.children.push(` + `, next);\r\n                            children.splice(j, 1);\r\n                            j--;\r\n                        }\r\n                        else {\r\n                            currentContainer = undefined;\r\n                            break;\r\n                        }\r\n                    }\r\n                }\r\n            }\r\n            if (!hasText ||\r\n                // if this is a plain element with a single text child, leave it\r\n                // as-is since the runtime has dedicated fast path for this by directly\r\n                // setting textContent of the element.\r\n                // for component root it's always normalized anyway.\r\n                (children.length === 1 &&\r\n                    (node.type === 0 /* ROOT */ ||\r\n                        (node.type === 1 /* ELEMENT */ &&\r\n                            node.tagType === 0 /* ELEMENT */ &&\r\n                            // #3756\r\n                            // custom directives can potentially add DOM elements arbitrarily,\r\n                            // we need to avoid setting textContent of the element at runtime\r\n                            // to avoid accidentally overwriting the DOM elements added\r\n                            // by the user through custom directives.\r\n                            !node.props.find(p => p.type === 7 /* DIRECTIVE */ &&\r\n                                !context.directiveTransforms[p.name]) &&\r\n                            // in compat mode, <template> tags with no special directives\r\n                            // will be rendered as a fragment so its children must be\r\n                            // converted into vnodes.\r\n                            !(node.tag === 'template'))))) {\r\n                return;\r\n            }\r\n            // pre-convert text nodes into createTextVNode(text) calls to avoid\r\n            // runtime normalization.\r\n            for (let i = 0; i < children.length; i++) {\r\n                const child = children[i];\r\n                if (isText(child) || child.type === 8 /* COMPOUND_EXPRESSION */) {\r\n                    const callArgs = [];\r\n                    // createTextVNode defaults to single whitespace, so if it is a\r\n                    // single space the code could be an empty call to save bytes.\r\n                    if (child.type !== 2 /* TEXT */ || child.content !== ' ') {\r\n                        callArgs.push(child);\r\n                    }\r\n                    // mark dynamic text with flag so it gets patched inside a block\r\n                    if (!context.ssr &&\r\n                        getConstantType(child, context) === 0 /* NOT_CONSTANT */) {\r\n                        callArgs.push(1 /* TEXT */ +\r\n                            (``));\r\n                    }\r\n                    children[i] = {\r\n                        type: 12 /* TEXT_CALL */,\r\n                        content: child,\r\n                        loc: child.loc,\r\n                        codegenNode: createCallExpression(context.helper(CREATE_TEXT), callArgs)\r\n                    };\r\n                }\r\n            }\r\n        };\r\n    }\r\n};\n\nconst seen = new WeakSet();\r\nconst transformOnce = (node, context) => {\r\n    if (node.type === 1 /* ELEMENT */ && findDir(node, 'once', true)) {\r\n        if (seen.has(node)) {\r\n            return;\r\n        }\r\n        seen.add(node);\r\n        context.helper(SET_BLOCK_TRACKING);\r\n        return () => {\r\n            const cur = context.currentNode;\r\n            if (cur.codegenNode) {\r\n                cur.codegenNode = context.cache(cur.codegenNode, true /* isVNode */);\r\n            }\r\n        };\r\n    }\r\n};\n\nconst transformModel = (dir, node, context) => {\r\n    const { exp, arg } = dir;\r\n    if (!exp) {\r\n        context.onError(createCompilerError(40 /* X_V_MODEL_NO_EXPRESSION */, dir.loc));\r\n        return createTransformProps();\r\n    }\r\n    const rawExp = exp.loc.source;\r\n    const expString = exp.type === 4 /* SIMPLE_EXPRESSION */ ? exp.content : rawExp;\r\n    // im SFC <script setup> inline mode, the exp may have been transformed into\r\n    // _unref(exp)\r\n    const bindingType = context.bindingMetadata[rawExp];\r\n    const maybeRef = context.inline &&\r\n        bindingType &&\r\n        bindingType !== \"setup-const\" /* SETUP_CONST */;\r\n    if (!isMemberExpression(expString) && !maybeRef) {\r\n        context.onError(createCompilerError(41 /* X_V_MODEL_MALFORMED_EXPRESSION */, exp.loc));\r\n        return createTransformProps();\r\n    }\r\n    if (context.prefixIdentifiers &&\r\n        isSimpleIdentifier(expString) &&\r\n        context.identifiers[expString]) {\r\n        context.onError(createCompilerError(42 /* X_V_MODEL_ON_SCOPE_VARIABLE */, exp.loc));\r\n        return createTransformProps();\r\n    }\r\n    const propName = arg ? arg : createSimpleExpression('modelValue', true);\r\n    const eventName = arg\r\n        ? isStaticExp(arg)\r\n            ? `onUpdate:${arg.content}`\r\n            : createCompoundExpression(['\"onUpdate:\" + ', arg])\r\n        : `onUpdate:modelValue`;\r\n    let assignmentExp;\r\n    const eventArg = context.isTS ? `($event: any)` : `$event`;\r\n    if (maybeRef) {\r\n        if (bindingType === \"setup-ref\" /* SETUP_REF */) {\r\n            // v-model used on known ref.\r\n            assignmentExp = createCompoundExpression([\r\n                `${eventArg} => (`,\r\n                createSimpleExpression(rawExp, false, exp.loc),\r\n                `.value = $event)`\r\n            ]);\r\n        }\r\n        else {\r\n            // v-model used on a potentially ref binding in <script setup> inline mode.\r\n            // the assignment needs to check whether the binding is actually a ref.\r\n            const altAssignment = bindingType === \"setup-let\" /* SETUP_LET */ ? `${rawExp} = $event` : `null`;\r\n            assignmentExp = createCompoundExpression([\r\n                `${eventArg} => (${context.helperString(IS_REF)}(${rawExp}) ? `,\r\n                createSimpleExpression(rawExp, false, exp.loc),\r\n                `.value = $event : ${altAssignment})`\r\n            ]);\r\n        }\r\n    }\r\n    else {\r\n        assignmentExp = createCompoundExpression([\r\n            `${eventArg} => (`,\r\n            exp,\r\n            ` = $event)`\r\n        ]);\r\n    }\r\n    const props = [\r\n        // modelValue: foo\r\n        createObjectProperty(propName, dir.exp),\r\n        // \"onUpdate:modelValue\": $event => (foo = $event)\r\n        createObjectProperty(eventName, assignmentExp)\r\n    ];\r\n    // cache v-model handler if applicable (when it doesn't refer any scope vars)\r\n    if (context.prefixIdentifiers &&\r\n        context.cacheHandlers &&\r\n        !hasScopeRef(exp, context.identifiers)) {\r\n        props[1].value = context.cache(props[1].value);\r\n    }\r\n    // modelModifiers: { foo: true, \"bar-baz\": true }\r\n    if (dir.modifiers.length && node.tagType === 1 /* COMPONENT */) {\r\n        const modifiers = dir.modifiers\r\n            .map(m => (isSimpleIdentifier(m) ? m : JSON.stringify(m)) + `: true`)\r\n            .join(`, `);\r\n        const modifiersKey = arg\r\n            ? isStaticExp(arg)\r\n                ? `${arg.content}Modifiers`\r\n                : createCompoundExpression([arg, ' + \"Modifiers\"'])\r\n            : `modelModifiers`;\r\n        props.push(createObjectProperty(modifiersKey, createSimpleExpression(`{ ${modifiers} }`, false, dir.loc, 2 /* CAN_HOIST */)));\r\n    }\r\n    return createTransformProps(props);\r\n};\r\nfunction createTransformProps(props = []) {\r\n    return { props };\r\n}\n\nconst validDivisionCharRE = /[\\w).+\\-_$\\]]/;\r\nconst transformFilter = (node, context) => {\r\n    if (!isCompatEnabled(\"COMPILER_FILTER\" /* COMPILER_FILTERS */, context)) {\r\n        return;\r\n    }\r\n    if (node.type === 5 /* INTERPOLATION */) {\r\n        // filter rewrite is applied before expression transform so only\r\n        // simple expressions are possible at this stage\r\n        rewriteFilter(node.content, context);\r\n    }\r\n    if (node.type === 1 /* ELEMENT */) {\r\n        node.props.forEach((prop) => {\r\n            if (prop.type === 7 /* DIRECTIVE */ &&\r\n                prop.name !== 'for' &&\r\n                prop.exp) {\r\n                rewriteFilter(prop.exp, context);\r\n            }\r\n        });\r\n    }\r\n};\r\nfunction rewriteFilter(node, context) {\r\n    if (node.type === 4 /* SIMPLE_EXPRESSION */) {\r\n        parseFilter(node, context);\r\n    }\r\n    else {\r\n        for (let i = 0; i < node.children.length; i++) {\r\n            const child = node.children[i];\r\n            if (typeof child !== 'object')\r\n                continue;\r\n            if (child.type === 4 /* SIMPLE_EXPRESSION */) {\r\n                parseFilter(child, context);\r\n            }\r\n            else if (child.type === 8 /* COMPOUND_EXPRESSION */) {\r\n                rewriteFilter(node, context);\r\n            }\r\n            else if (child.type === 5 /* INTERPOLATION */) {\r\n                rewriteFilter(child.content, context);\r\n            }\r\n        }\r\n    }\r\n}\r\nfunction parseFilter(node, context) {\r\n    const exp = node.content;\r\n    let inSingle = false;\r\n    let inDouble = false;\r\n    let inTemplateString = false;\r\n    let inRegex = false;\r\n    let curly = 0;\r\n    let square = 0;\r\n    let paren = 0;\r\n    let lastFilterIndex = 0;\r\n    let c, prev, i, expression, filters = [];\r\n    for (i = 0; i < exp.length; i++) {\r\n        prev = c;\r\n        c = exp.charCodeAt(i);\r\n        if (inSingle) {\r\n            if (c === 0x27 && prev !== 0x5c)\r\n                inSingle = false;\r\n        }\r\n        else if (inDouble) {\r\n            if (c === 0x22 && prev !== 0x5c)\r\n                inDouble = false;\r\n        }\r\n        else if (inTemplateString) {\r\n            if (c === 0x60 && prev !== 0x5c)\r\n                inTemplateString = false;\r\n        }\r\n        else if (inRegex) {\r\n            if (c === 0x2f && prev !== 0x5c)\r\n                inRegex = false;\r\n        }\r\n        else if (c === 0x7c && // pipe\r\n            exp.charCodeAt(i + 1) !== 0x7c &&\r\n            exp.charCodeAt(i - 1) !== 0x7c &&\r\n            !curly &&\r\n            !square &&\r\n            !paren) {\r\n            if (expression === undefined) {\r\n                // first filter, end of expression\r\n                lastFilterIndex = i + 1;\r\n                expression = exp.slice(0, i).trim();\r\n            }\r\n            else {\r\n                pushFilter();\r\n            }\r\n        }\r\n        else {\r\n            switch (c) {\r\n                case 0x22:\r\n                    inDouble = true;\r\n                    break; // \"\r\n                case 0x27:\r\n                    inSingle = true;\r\n                    break; // '\r\n                case 0x60:\r\n                    inTemplateString = true;\r\n                    break; // `\r\n                case 0x28:\r\n                    paren++;\r\n                    break; // (\r\n                case 0x29:\r\n                    paren--;\r\n                    break; // )\r\n                case 0x5b:\r\n                    square++;\r\n                    break; // [\r\n                case 0x5d:\r\n                    square--;\r\n                    break; // ]\r\n                case 0x7b:\r\n                    curly++;\r\n                    break; // {\r\n                case 0x7d:\r\n                    curly--;\r\n                    break; // }\r\n            }\r\n            if (c === 0x2f) {\r\n                // /\r\n                let j = i - 1;\r\n                let p;\r\n                // find first non-whitespace prev char\r\n                for (; j >= 0; j--) {\r\n                    p = exp.charAt(j);\r\n                    if (p !== ' ')\r\n                        break;\r\n                }\r\n                if (!p || !validDivisionCharRE.test(p)) {\r\n                    inRegex = true;\r\n                }\r\n            }\r\n        }\r\n    }\r\n    if (expression === undefined) {\r\n        expression = exp.slice(0, i).trim();\r\n    }\r\n    else if (lastFilterIndex !== 0) {\r\n        pushFilter();\r\n    }\r\n    function pushFilter() {\r\n        filters.push(exp.slice(lastFilterIndex, i).trim());\r\n        lastFilterIndex = i + 1;\r\n    }\r\n    if (filters.length) {\r\n        for (i = 0; i < filters.length; i++) {\r\n            expression = wrapFilter(expression, filters[i], context);\r\n        }\r\n        node.content = expression;\r\n    }\r\n}\r\nfunction wrapFilter(exp, filter, context) {\r\n    context.helper(RESOLVE_FILTER);\r\n    const i = filter.indexOf('(');\r\n    if (i < 0) {\r\n        context.filters.add(filter);\r\n        return `${toValidAssetId(filter, 'filter')}(${exp})`;\r\n    }\r\n    else {\r\n        const name = filter.slice(0, i);\r\n        const args = filter.slice(i + 1);\r\n        context.filters.add(name);\r\n        return `${toValidAssetId(name, 'filter')}(${exp}${args !== ')' ? ',' + args : args}`;\r\n    }\r\n}\n\nfunction getBaseTransformPreset(prefixIdentifiers) {\r\n    return [\r\n        [\r\n            transformOnce,\r\n            transformIf,\r\n            transformFor,\r\n            ...([transformFilter] ),\r\n            ...(prefixIdentifiers\r\n                ? [\r\n                    // order is important\r\n                    trackVForSlotScopes,\r\n                    transformExpression\r\n                ]\r\n                : []),\r\n            transformSlotOutlet,\r\n            transformElement,\r\n            trackSlotScopes,\r\n            transformText\r\n        ],\r\n        {\r\n            on: transformOn,\r\n            bind: transformBind,\r\n            model: transformModel\r\n        }\r\n    ];\r\n}\r\n// we name it `baseCompile` so that higher order compilers like\r\n// @vue/compiler-dom can export `compile` while re-exporting everything else.\r\nfunction baseCompile(template, options = {}) {\r\n    const onError = options.onError || defaultOnError;\r\n    const isModuleMode = options.mode === 'module';\r\n    const prefixIdentifiers = (options.prefixIdentifiers === true || isModuleMode);\r\n    if (!prefixIdentifiers && options.cacheHandlers) {\r\n        onError(createCompilerError(47 /* X_CACHE_HANDLER_NOT_SUPPORTED */));\r\n    }\r\n    if (options.scopeId && !isModuleMode) {\r\n        onError(createCompilerError(48 /* X_SCOPE_ID_NOT_SUPPORTED */));\r\n    }\r\n    const ast = shared.isString(template) ? baseParse(template, options) : template;\r\n    const [nodeTransforms, directiveTransforms] = getBaseTransformPreset(prefixIdentifiers);\r\n    transform(ast, shared.extend({}, options, {\r\n        prefixIdentifiers,\r\n        nodeTransforms: [\r\n            ...nodeTransforms,\r\n            ...(options.nodeTransforms || []) // user transforms\r\n        ],\r\n        directiveTransforms: shared.extend({}, directiveTransforms, options.directiveTransforms || {} // user transforms\r\n        )\r\n    }));\r\n    return generate(ast, shared.extend({}, options, {\r\n        prefixIdentifiers\r\n    }));\r\n}\n\nconst noopDirectiveTransform = () => ({ props: [] });\n\nexports.generateCodeFrame = shared.generateCodeFrame;\nexports.BASE_TRANSITION = BASE_TRANSITION;\nexports.CAMELIZE = CAMELIZE;\nexports.CAPITALIZE = CAPITALIZE;\nexports.CREATE_BLOCK = CREATE_BLOCK;\nexports.CREATE_COMMENT = CREATE_COMMENT;\nexports.CREATE_SLOTS = CREATE_SLOTS;\nexports.CREATE_STATIC = CREATE_STATIC;\nexports.CREATE_TEXT = CREATE_TEXT;\nexports.CREATE_VNODE = CREATE_VNODE;\nexports.FRAGMENT = FRAGMENT;\nexports.IS_REF = IS_REF;\nexports.KEEP_ALIVE = KEEP_ALIVE;\nexports.MERGE_PROPS = MERGE_PROPS;\nexports.OPEN_BLOCK = OPEN_BLOCK;\nexports.POP_SCOPE_ID = POP_SCOPE_ID;\nexports.PUSH_SCOPE_ID = PUSH_SCOPE_ID;\nexports.RENDER_LIST = RENDER_LIST;\nexports.RENDER_SLOT = RENDER_SLOT;\nexports.RESOLVE_COMPONENT = RESOLVE_COMPONENT;\nexports.RESOLVE_DIRECTIVE = RESOLVE_DIRECTIVE;\nexports.RESOLVE_DYNAMIC_COMPONENT = RESOLVE_DYNAMIC_COMPONENT;\nexports.RESOLVE_FILTER = RESOLVE_FILTER;\nexports.SET_BLOCK_TRACKING = SET_BLOCK_TRACKING;\nexports.SUSPENSE = SUSPENSE;\nexports.TELEPORT = TELEPORT;\nexports.TO_DISPLAY_STRING = TO_DISPLAY_STRING;\nexports.TO_HANDLERS = TO_HANDLERS;\nexports.TO_HANDLER_KEY = TO_HANDLER_KEY;\nexports.UNREF = UNREF;\nexports.WITH_CTX = WITH_CTX;\nexports.WITH_DIRECTIVES = WITH_DIRECTIVES;\nexports.WITH_SCOPE_ID = WITH_SCOPE_ID;\nexports.advancePositionWithClone = advancePositionWithClone;\nexports.advancePositionWithMutation = advancePositionWithMutation;\nexports.assert = assert;\nexports.baseCompile = baseCompile;\nexports.baseParse = baseParse;\nexports.buildProps = buildProps;\nexports.buildSlots = buildSlots;\nexports.checkCompatEnabled = checkCompatEnabled;\nexports.createArrayExpression = createArrayExpression;\nexports.createAssignmentExpression = createAssignmentExpression;\nexports.createBlockStatement = createBlockStatement;\nexports.createCacheExpression = createCacheExpression;\nexports.createCallExpression = createCallExpression;\nexports.createCompilerError = createCompilerError;\nexports.createCompoundExpression = createCompoundExpression;\nexports.createConditionalExpression = createConditionalExpression;\nexports.createForLoopParams = createForLoopParams;\nexports.createFunctionExpression = createFunctionExpression;\nexports.createIfStatement = createIfStatement;\nexports.createInterpolation = createInterpolation;\nexports.createObjectExpression = createObjectExpression;\nexports.createObjectProperty = createObjectProperty;\nexports.createReturnStatement = createReturnStatement;\nexports.createRoot = createRoot;\nexports.createSequenceExpression = createSequenceExpression;\nexports.createSimpleExpression = createSimpleExpression;\nexports.createStructuralDirectiveTransform = createStructuralDirectiveTransform;\nexports.createTemplateLiteral = createTemplateLiteral;\nexports.createTransformContext = createTransformContext;\nexports.createVNodeCall = createVNodeCall;\nexports.findDir = findDir;\nexports.findProp = findProp;\nexports.generate = generate;\nexports.getBaseTransformPreset = getBaseTransformPreset;\nexports.getInnerRange = getInnerRange;\nexports.hasDynamicKeyVBind = hasDynamicKeyVBind;\nexports.hasScopeRef = hasScopeRef;\nexports.helperNameMap = helperNameMap;\nexports.injectProp = injectProp;\nexports.isBindKey = isBindKey;\nexports.isBuiltInType = isBuiltInType;\nexports.isCoreComponent = isCoreComponent;\nexports.isMemberExpression = isMemberExpression;\nexports.isSimpleIdentifier = isSimpleIdentifier;\nexports.isSlotOutlet = isSlotOutlet;\nexports.isStaticExp = isStaticExp;\nexports.isTemplateNode = isTemplateNode;\nexports.isText = isText;\nexports.isVSlot = isVSlot;\nexports.locStub = locStub;\nexports.noopDirectiveTransform = noopDirectiveTransform;\nexports.processExpression = processExpression;\nexports.processFor = processFor;\nexports.processIf = processIf;\nexports.processSlotOutlet = processSlotOutlet;\nexports.registerRuntimeHelpers = registerRuntimeHelpers;\nexports.resolveComponentType = resolveComponentType;\nexports.toValidAssetId = toValidAssetId;\nexports.trackSlotScopes = trackSlotScopes;\nexports.trackVForSlotScopes = trackVForSlotScopes;\nexports.transform = transform;\nexports.transformBind = transformBind;\nexports.transformElement = transformElement;\nexports.transformExpression = transformExpression;\nexports.transformModel = transformModel;\nexports.transformOn = transformOn;\nexports.traverseNode = traverseNode;\nexports.warnDeprecation = warnDeprecation;\n","'use strict'\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./dist/shared.cjs.prod.js')\n} else {\n  module.exports = require('./dist/shared.cjs.js')\n}\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\n/**\r\n * Make a map and return a function for checking if a key\r\n * is in that map.\r\n * IMPORTANT: all calls of this function must be prefixed with\r\n * \\/\\*#\\_\\_PURE\\_\\_\\*\\/\r\n * So that rollup can tree-shake them if necessary.\r\n */\r\nfunction makeMap(str, expectsLowerCase) {\r\n    const map = Object.create(null);\r\n    const list = str.split(',');\r\n    for (let i = 0; i < list.length; i++) {\r\n        map[list[i]] = true;\r\n    }\r\n    return expectsLowerCase ? val => !!map[val.toLowerCase()] : val => !!map[val];\r\n}\n\n/**\r\n * dev only flag -> name mapping\r\n */\r\nconst PatchFlagNames = {\r\n    [1 /* TEXT */]: `TEXT`,\r\n    [2 /* CLASS */]: `CLASS`,\r\n    [4 /* STYLE */]: `STYLE`,\r\n    [8 /* PROPS */]: `PROPS`,\r\n    [16 /* FULL_PROPS */]: `FULL_PROPS`,\r\n    [32 /* HYDRATE_EVENTS */]: `HYDRATE_EVENTS`,\r\n    [64 /* STABLE_FRAGMENT */]: `STABLE_FRAGMENT`,\r\n    [128 /* KEYED_FRAGMENT */]: `KEYED_FRAGMENT`,\r\n    [256 /* UNKEYED_FRAGMENT */]: `UNKEYED_FRAGMENT`,\r\n    [512 /* NEED_PATCH */]: `NEED_PATCH`,\r\n    [1024 /* DYNAMIC_SLOTS */]: `DYNAMIC_SLOTS`,\r\n    [2048 /* DEV_ROOT_FRAGMENT */]: `DEV_ROOT_FRAGMENT`,\r\n    [-1 /* HOISTED */]: `HOISTED`,\r\n    [-2 /* BAIL */]: `BAIL`\r\n};\n\n/**\r\n * Dev only\r\n */\r\nconst slotFlagsText = {\r\n    [1 /* STABLE */]: 'STABLE',\r\n    [2 /* DYNAMIC */]: 'DYNAMIC',\r\n    [3 /* FORWARDED */]: 'FORWARDED'\r\n};\n\nconst GLOBALS_WHITE_LISTED = 'Infinity,undefined,NaN,isFinite,isNaN,parseFloat,parseInt,decodeURI,' +\r\n    'decodeURIComponent,encodeURI,encodeURIComponent,Math,Number,Date,Array,' +\r\n    'Object,Boolean,String,RegExp,Map,Set,JSON,Intl,BigInt';\r\nconst isGloballyWhitelisted = /*#__PURE__*/ makeMap(GLOBALS_WHITE_LISTED);\n\nconst range = 2;\r\nfunction generateCodeFrame(source, start = 0, end = source.length) {\r\n    const lines = source.split(/\\r?\\n/);\r\n    let count = 0;\r\n    const res = [];\r\n    for (let i = 0; i < lines.length; i++) {\r\n        count += lines[i].length + 1;\r\n        if (count >= start) {\r\n            for (let j = i - range; j <= i + range || end > count; j++) {\r\n                if (j < 0 || j >= lines.length)\r\n                    continue;\r\n                const line = j + 1;\r\n                res.push(`${line}${' '.repeat(Math.max(3 - String(line).length, 0))}|  ${lines[j]}`);\r\n                const lineLength = lines[j].length;\r\n                if (j === i) {\r\n                    // push underline\r\n                    const pad = start - (count - lineLength) + 1;\r\n                    const length = Math.max(1, end > count ? lineLength - pad : end - start);\r\n                    res.push(`   |  ` + ' '.repeat(pad) + '^'.repeat(length));\r\n                }\r\n                else if (j > i) {\r\n                    if (end > count) {\r\n                        const length = Math.max(Math.min(end - count, lineLength), 1);\r\n                        res.push(`   |  ` + '^'.repeat(length));\r\n                    }\r\n                    count += lineLength + 1;\r\n                }\r\n            }\r\n            break;\r\n        }\r\n    }\r\n    return res.join('\\n');\r\n}\n\n/**\r\n * On the client we only need to offer special cases for boolean attributes that\r\n * have different names from their corresponding dom properties:\r\n * - itemscope -> N/A\r\n * - allowfullscreen -> allowFullscreen\r\n * - formnovalidate -> formNoValidate\r\n * - ismap -> isMap\r\n * - nomodule -> noModule\r\n * - novalidate -> noValidate\r\n * - readonly -> readOnly\r\n */\r\nconst specialBooleanAttrs = `itemscope,allowfullscreen,formnovalidate,ismap,nomodule,novalidate,readonly`;\r\nconst isSpecialBooleanAttr = /*#__PURE__*/ makeMap(specialBooleanAttrs);\r\n/**\r\n * The full list is needed during SSR to produce the correct initial markup.\r\n */\r\nconst isBooleanAttr = /*#__PURE__*/ makeMap(specialBooleanAttrs +\r\n    `,async,autofocus,autoplay,controls,default,defer,disabled,hidden,` +\r\n    `loop,open,required,reversed,scoped,seamless,` +\r\n    `checked,muted,multiple,selected`);\r\nconst unsafeAttrCharRE = /[>/=\"'\\u0009\\u000a\\u000c\\u0020]/;\r\nconst attrValidationCache = {};\r\nfunction isSSRSafeAttrName(name) {\r\n    if (attrValidationCache.hasOwnProperty(name)) {\r\n        return attrValidationCache[name];\r\n    }\r\n    const isUnsafe = unsafeAttrCharRE.test(name);\r\n    if (isUnsafe) {\r\n        console.error(`unsafe attribute name: ${name}`);\r\n    }\r\n    return (attrValidationCache[name] = !isUnsafe);\r\n}\r\nconst propsToAttrMap = {\r\n    acceptCharset: 'accept-charset',\r\n    className: 'class',\r\n    htmlFor: 'for',\r\n    httpEquiv: 'http-equiv'\r\n};\r\n/**\r\n * CSS properties that accept plain numbers\r\n */\r\nconst isNoUnitNumericStyleProp = /*#__PURE__*/ makeMap(`animation-iteration-count,border-image-outset,border-image-slice,` +\r\n    `border-image-width,box-flex,box-flex-group,box-ordinal-group,column-count,` +\r\n    `columns,flex,flex-grow,flex-positive,flex-shrink,flex-negative,flex-order,` +\r\n    `grid-row,grid-row-end,grid-row-span,grid-row-start,grid-column,` +\r\n    `grid-column-end,grid-column-span,grid-column-start,font-weight,line-clamp,` +\r\n    `line-height,opacity,order,orphans,tab-size,widows,z-index,zoom,` +\r\n    // SVG\r\n    `fill-opacity,flood-opacity,stop-opacity,stroke-dasharray,stroke-dashoffset,` +\r\n    `stroke-miterlimit,stroke-opacity,stroke-width`);\r\n/**\r\n * Known attributes, this is used for stringification of runtime static nodes\r\n * so that we don't stringify bindings that cannot be set from HTML.\r\n * Don't also forget to allow `data-*` and `aria-*`!\r\n * Generated from https://developer.mozilla.org/en-US/docs/Web/HTML/Attributes\r\n */\r\nconst isKnownAttr = /*#__PURE__*/ makeMap(`accept,accept-charset,accesskey,action,align,allow,alt,async,` +\r\n    `autocapitalize,autocomplete,autofocus,autoplay,background,bgcolor,` +\r\n    `border,buffered,capture,challenge,charset,checked,cite,class,code,` +\r\n    `codebase,color,cols,colspan,content,contenteditable,contextmenu,controls,` +\r\n    `coords,crossorigin,csp,data,datetime,decoding,default,defer,dir,dirname,` +\r\n    `disabled,download,draggable,dropzone,enctype,enterkeyhint,for,form,` +\r\n    `formaction,formenctype,formmethod,formnovalidate,formtarget,headers,` +\r\n    `height,hidden,high,href,hreflang,http-equiv,icon,id,importance,integrity,` +\r\n    `ismap,itemprop,keytype,kind,label,lang,language,loading,list,loop,low,` +\r\n    `manifest,max,maxlength,minlength,media,min,multiple,muted,name,novalidate,` +\r\n    `open,optimum,pattern,ping,placeholder,poster,preload,radiogroup,readonly,` +\r\n    `referrerpolicy,rel,required,reversed,rows,rowspan,sandbox,scope,scoped,` +\r\n    `selected,shape,size,sizes,slot,span,spellcheck,src,srcdoc,srclang,srcset,` +\r\n    `start,step,style,summary,tabindex,target,title,translate,type,usemap,` +\r\n    `value,width,wrap`);\n\nfunction normalizeStyle(value) {\r\n    if (isArray(value)) {\r\n        const res = {};\r\n        for (let i = 0; i < value.length; i++) {\r\n            const item = value[i];\r\n            const normalized = normalizeStyle(isString(item) ? parseStringStyle(item) : item);\r\n            if (normalized) {\r\n                for (const key in normalized) {\r\n                    res[key] = normalized[key];\r\n                }\r\n            }\r\n        }\r\n        return res;\r\n    }\r\n    else if (isObject(value)) {\r\n        return value;\r\n    }\r\n}\r\nconst listDelimiterRE = /;(?![^(]*\\))/g;\r\nconst propertyDelimiterRE = /:(.+)/;\r\nfunction parseStringStyle(cssText) {\r\n    const ret = {};\r\n    cssText.split(listDelimiterRE).forEach(item => {\r\n        if (item) {\r\n            const tmp = item.split(propertyDelimiterRE);\r\n            tmp.length > 1 && (ret[tmp[0].trim()] = tmp[1].trim());\r\n        }\r\n    });\r\n    return ret;\r\n}\r\nfunction stringifyStyle(styles) {\r\n    let ret = '';\r\n    if (!styles) {\r\n        return ret;\r\n    }\r\n    for (const key in styles) {\r\n        const value = styles[key];\r\n        const normalizedKey = key.startsWith(`--`) ? key : hyphenate(key);\r\n        if (isString(value) ||\r\n            (typeof value === 'number' && isNoUnitNumericStyleProp(normalizedKey))) {\r\n            // only render valid values\r\n            ret += `${normalizedKey}:${value};`;\r\n        }\r\n    }\r\n    return ret;\r\n}\r\nfunction normalizeClass(value) {\r\n    let res = '';\r\n    if (isString(value)) {\r\n        res = value;\r\n    }\r\n    else if (isArray(value)) {\r\n        for (let i = 0; i < value.length; i++) {\r\n            const normalized = normalizeClass(value[i]);\r\n            if (normalized) {\r\n                res += normalized + ' ';\r\n            }\r\n        }\r\n    }\r\n    else if (isObject(value)) {\r\n        for (const name in value) {\r\n            if (value[name]) {\r\n                res += name + ' ';\r\n            }\r\n        }\r\n    }\r\n    return res.trim();\r\n}\n\n// These tag configs are shared between compiler-dom and runtime-dom, so they\r\n// https://developer.mozilla.org/en-US/docs/Web/HTML/Element\r\nconst HTML_TAGS = 'html,body,base,head,link,meta,style,title,address,article,aside,footer,' +\r\n    'header,h1,h2,h3,h4,h5,h6,hgroup,nav,section,div,dd,dl,dt,figcaption,' +\r\n    'figure,picture,hr,img,li,main,ol,p,pre,ul,a,b,abbr,bdi,bdo,br,cite,code,' +\r\n    'data,dfn,em,i,kbd,mark,q,rp,rt,rtc,ruby,s,samp,small,span,strong,sub,sup,' +\r\n    'time,u,var,wbr,area,audio,map,track,video,embed,object,param,source,' +\r\n    'canvas,script,noscript,del,ins,caption,col,colgroup,table,thead,tbody,td,' +\r\n    'th,tr,button,datalist,fieldset,form,input,label,legend,meter,optgroup,' +\r\n    'option,output,progress,select,textarea,details,dialog,menu,' +\r\n    'summary,template,blockquote,iframe,tfoot';\r\n// https://developer.mozilla.org/en-US/docs/Web/SVG/Element\r\nconst SVG_TAGS = 'svg,animate,animateMotion,animateTransform,circle,clipPath,color-profile,' +\r\n    'defs,desc,discard,ellipse,feBlend,feColorMatrix,feComponentTransfer,' +\r\n    'feComposite,feConvolveMatrix,feDiffuseLighting,feDisplacementMap,' +\r\n    'feDistanceLight,feDropShadow,feFlood,feFuncA,feFuncB,feFuncG,feFuncR,' +\r\n    'feGaussianBlur,feImage,feMerge,feMergeNode,feMorphology,feOffset,' +\r\n    'fePointLight,feSpecularLighting,feSpotLight,feTile,feTurbulence,filter,' +\r\n    'foreignObject,g,hatch,hatchpath,image,line,linearGradient,marker,mask,' +\r\n    'mesh,meshgradient,meshpatch,meshrow,metadata,mpath,path,pattern,' +\r\n    'polygon,polyline,radialGradient,rect,set,solidcolor,stop,switch,symbol,' +\r\n    'text,textPath,title,tspan,unknown,use,view';\r\nconst VOID_TAGS = 'area,base,br,col,embed,hr,img,input,link,meta,param,source,track,wbr';\r\nconst isHTMLTag = /*#__PURE__*/ makeMap(HTML_TAGS);\r\nconst isSVGTag = /*#__PURE__*/ makeMap(SVG_TAGS);\r\nconst isVoidTag = /*#__PURE__*/ makeMap(VOID_TAGS);\n\nconst escapeRE = /[\"'&<>]/;\r\nfunction escapeHtml(string) {\r\n    const str = '' + string;\r\n    const match = escapeRE.exec(str);\r\n    if (!match) {\r\n        return str;\r\n    }\r\n    let html = '';\r\n    let escaped;\r\n    let index;\r\n    let lastIndex = 0;\r\n    for (index = match.index; index < str.length; index++) {\r\n        switch (str.charCodeAt(index)) {\r\n            case 34: // \"\r\n                escaped = '&quot;';\r\n                break;\r\n            case 38: // &\r\n                escaped = '&amp;';\r\n                break;\r\n            case 39: // '\r\n                escaped = '&#39;';\r\n                break;\r\n            case 60: // <\r\n                escaped = '&lt;';\r\n                break;\r\n            case 62: // >\r\n                escaped = '&gt;';\r\n                break;\r\n            default:\r\n                continue;\r\n        }\r\n        if (lastIndex !== index) {\r\n            html += str.substring(lastIndex, index);\r\n        }\r\n        lastIndex = index + 1;\r\n        html += escaped;\r\n    }\r\n    return lastIndex !== index ? html + str.substring(lastIndex, index) : html;\r\n}\r\n// https://www.w3.org/TR/html52/syntax.html#comments\r\nconst commentStripRE = /^-?>|<!--|-->|--!>|<!-$/g;\r\nfunction escapeHtmlComment(src) {\r\n    return src.replace(commentStripRE, '');\r\n}\n\nfunction looseCompareArrays(a, b) {\r\n    if (a.length !== b.length)\r\n        return false;\r\n    let equal = true;\r\n    for (let i = 0; equal && i < a.length; i++) {\r\n        equal = looseEqual(a[i], b[i]);\r\n    }\r\n    return equal;\r\n}\r\nfunction looseEqual(a, b) {\r\n    if (a === b)\r\n        return true;\r\n    let aValidType = isDate(a);\r\n    let bValidType = isDate(b);\r\n    if (aValidType || bValidType) {\r\n        return aValidType && bValidType ? a.getTime() === b.getTime() : false;\r\n    }\r\n    aValidType = isArray(a);\r\n    bValidType = isArray(b);\r\n    if (aValidType || bValidType) {\r\n        return aValidType && bValidType ? looseCompareArrays(a, b) : false;\r\n    }\r\n    aValidType = isObject(a);\r\n    bValidType = isObject(b);\r\n    if (aValidType || bValidType) {\r\n        /* istanbul ignore if: this if will probably never be called */\r\n        if (!aValidType || !bValidType) {\r\n            return false;\r\n        }\r\n        const aKeysCount = Object.keys(a).length;\r\n        const bKeysCount = Object.keys(b).length;\r\n        if (aKeysCount !== bKeysCount) {\r\n            return false;\r\n        }\r\n        for (const key in a) {\r\n            const aHasKey = a.hasOwnProperty(key);\r\n            const bHasKey = b.hasOwnProperty(key);\r\n            if ((aHasKey && !bHasKey) ||\r\n                (!aHasKey && bHasKey) ||\r\n                !looseEqual(a[key], b[key])) {\r\n                return false;\r\n            }\r\n        }\r\n    }\r\n    return String(a) === String(b);\r\n}\r\nfunction looseIndexOf(arr, val) {\r\n    return arr.findIndex(item => looseEqual(item, val));\r\n}\n\n/**\r\n * For converting {{ interpolation }} values to displayed strings.\r\n * @private\r\n */\r\nconst toDisplayString = (val) => {\r\n    return val == null\r\n        ? ''\r\n        : isObject(val)\r\n            ? JSON.stringify(val, replacer, 2)\r\n            : String(val);\r\n};\r\nconst replacer = (_key, val) => {\r\n    if (isMap(val)) {\r\n        return {\r\n            [`Map(${val.size})`]: [...val.entries()].reduce((entries, [key, val]) => {\r\n                entries[`${key} =>`] = val;\r\n                return entries;\r\n            }, {})\r\n        };\r\n    }\r\n    else if (isSet(val)) {\r\n        return {\r\n            [`Set(${val.size})`]: [...val.values()]\r\n        };\r\n    }\r\n    else if (isObject(val) && !isArray(val) && !isPlainObject(val)) {\r\n        return String(val);\r\n    }\r\n    return val;\r\n};\n\n/**\r\n * List of @babel/parser plugins that are used for template expression\r\n * transforms and SFC script transforms. By default we enable proposals slated\r\n * for ES2020. This will need to be updated as the spec moves forward.\r\n * Full list at https://babeljs.io/docs/en/next/babel-parser#plugins\r\n */\r\nconst babelParserDefaultPlugins = [\r\n    'bigInt',\r\n    'optionalChaining',\r\n    'nullishCoalescingOperator'\r\n];\r\nconst EMPTY_OBJ = {};\r\nconst EMPTY_ARR = [];\r\nconst NOOP = () => { };\r\n/**\r\n * Always return false.\r\n */\r\nconst NO = () => false;\r\nconst onRE = /^on[^a-z]/;\r\nconst isOn = (key) => onRE.test(key);\r\nconst isModelListener = (key) => key.startsWith('onUpdate:');\r\nconst extend = Object.assign;\r\nconst remove = (arr, el) => {\r\n    const i = arr.indexOf(el);\r\n    if (i > -1) {\r\n        arr.splice(i, 1);\r\n    }\r\n};\r\nconst hasOwnProperty = Object.prototype.hasOwnProperty;\r\nconst hasOwn = (val, key) => hasOwnProperty.call(val, key);\r\nconst isArray = Array.isArray;\r\nconst isMap = (val) => toTypeString(val) === '[object Map]';\r\nconst isSet = (val) => toTypeString(val) === '[object Set]';\r\nconst isDate = (val) => val instanceof Date;\r\nconst isFunction = (val) => typeof val === 'function';\r\nconst isString = (val) => typeof val === 'string';\r\nconst isSymbol = (val) => typeof val === 'symbol';\r\nconst isObject = (val) => val !== null && typeof val === 'object';\r\nconst isPromise = (val) => {\r\n    return isObject(val) && isFunction(val.then) && isFunction(val.catch);\r\n};\r\nconst objectToString = Object.prototype.toString;\r\nconst toTypeString = (value) => objectToString.call(value);\r\nconst toRawType = (value) => {\r\n    // extract \"RawType\" from strings like \"[object RawType]\"\r\n    return toTypeString(value).slice(8, -1);\r\n};\r\nconst isPlainObject = (val) => toTypeString(val) === '[object Object]';\r\nconst isIntegerKey = (key) => isString(key) &&\r\n    key !== 'NaN' &&\r\n    key[0] !== '-' &&\r\n    '' + parseInt(key, 10) === key;\r\nconst isReservedProp = /*#__PURE__*/ makeMap(\r\n// the leading comma is intentional so empty string \"\" is also included\r\n',key,ref,' +\r\n    'onVnodeBeforeMount,onVnodeMounted,' +\r\n    'onVnodeBeforeUpdate,onVnodeUpdated,' +\r\n    'onVnodeBeforeUnmount,onVnodeUnmounted');\r\nconst cacheStringFunction = (fn) => {\r\n    const cache = Object.create(null);\r\n    return ((str) => {\r\n        const hit = cache[str];\r\n        return hit || (cache[str] = fn(str));\r\n    });\r\n};\r\nconst camelizeRE = /-(\\w)/g;\r\n/**\r\n * @private\r\n */\r\nconst camelize = cacheStringFunction((str) => {\r\n    return str.replace(camelizeRE, (_, c) => (c ? c.toUpperCase() : ''));\r\n});\r\nconst hyphenateRE = /\\B([A-Z])/g;\r\n/**\r\n * @private\r\n */\r\nconst hyphenate = cacheStringFunction((str) => str.replace(hyphenateRE, '-$1').toLowerCase());\r\n/**\r\n * @private\r\n */\r\nconst capitalize = cacheStringFunction((str) => str.charAt(0).toUpperCase() + str.slice(1));\r\n/**\r\n * @private\r\n */\r\nconst toHandlerKey = cacheStringFunction((str) => (str ? `on${capitalize(str)}` : ``));\r\n// compare whether a value has changed, accounting for NaN.\r\nconst hasChanged = (value, oldValue) => value !== oldValue && (value === value || oldValue === oldValue);\r\nconst invokeArrayFns = (fns, arg) => {\r\n    for (let i = 0; i < fns.length; i++) {\r\n        fns[i](arg);\r\n    }\r\n};\r\nconst def = (obj, key, value) => {\r\n    Object.defineProperty(obj, key, {\r\n        configurable: true,\r\n        enumerable: false,\r\n        value\r\n    });\r\n};\r\nconst toNumber = (val) => {\r\n    const n = parseFloat(val);\r\n    return isNaN(n) ? val : n;\r\n};\r\nlet _globalThis;\r\nconst getGlobalThis = () => {\r\n    return (_globalThis ||\r\n        (_globalThis =\r\n            typeof globalThis !== 'undefined'\r\n                ? globalThis\r\n                : typeof self !== 'undefined'\r\n                    ? self\r\n                    : typeof window !== 'undefined'\r\n                        ? window\r\n                        : typeof global !== 'undefined'\r\n                            ? global\r\n                            : {}));\r\n};\n\nexports.EMPTY_ARR = EMPTY_ARR;\nexports.EMPTY_OBJ = EMPTY_OBJ;\nexports.NO = NO;\nexports.NOOP = NOOP;\nexports.PatchFlagNames = PatchFlagNames;\nexports.babelParserDefaultPlugins = babelParserDefaultPlugins;\nexports.camelize = camelize;\nexports.capitalize = capitalize;\nexports.def = def;\nexports.escapeHtml = escapeHtml;\nexports.escapeHtmlComment = escapeHtmlComment;\nexports.extend = extend;\nexports.generateCodeFrame = generateCodeFrame;\nexports.getGlobalThis = getGlobalThis;\nexports.hasChanged = hasChanged;\nexports.hasOwn = hasOwn;\nexports.hyphenate = hyphenate;\nexports.invokeArrayFns = invokeArrayFns;\nexports.isArray = isArray;\nexports.isBooleanAttr = isBooleanAttr;\nexports.isDate = isDate;\nexports.isFunction = isFunction;\nexports.isGloballyWhitelisted = isGloballyWhitelisted;\nexports.isHTMLTag = isHTMLTag;\nexports.isIntegerKey = isIntegerKey;\nexports.isKnownAttr = isKnownAttr;\nexports.isMap = isMap;\nexports.isModelListener = isModelListener;\nexports.isNoUnitNumericStyleProp = isNoUnitNumericStyleProp;\nexports.isObject = isObject;\nexports.isOn = isOn;\nexports.isPlainObject = isPlainObject;\nexports.isPromise = isPromise;\nexports.isReservedProp = isReservedProp;\nexports.isSSRSafeAttrName = isSSRSafeAttrName;\nexports.isSVGTag = isSVGTag;\nexports.isSet = isSet;\nexports.isSpecialBooleanAttr = isSpecialBooleanAttr;\nexports.isString = isString;\nexports.isSymbol = isSymbol;\nexports.isVoidTag = isVoidTag;\nexports.looseEqual = looseEqual;\nexports.looseIndexOf = looseIndexOf;\nexports.makeMap = makeMap;\nexports.normalizeClass = normalizeClass;\nexports.normalizeStyle = normalizeStyle;\nexports.objectToString = objectToString;\nexports.parseStringStyle = parseStringStyle;\nexports.propsToAttrMap = propsToAttrMap;\nexports.remove = remove;\nexports.slotFlagsText = slotFlagsText;\nexports.stringifyStyle = stringifyStyle;\nexports.toDisplayString = toDisplayString;\nexports.toHandlerKey = toHandlerKey;\nexports.toNumber = toNumber;\nexports.toRawType = toRawType;\nexports.toTypeString = toTypeString;\n","/*\n * Copyright 2009-2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE.txt or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\nexports.SourceMapGenerator = require('./lib/source-map-generator').SourceMapGenerator;\nexports.SourceMapConsumer = require('./lib/source-map-consumer').SourceMapConsumer;\nexports.SourceNode = require('./lib/source-node').SourceNode;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar base64VLQ = require('./base64-vlq');\nvar util = require('./util');\nvar ArraySet = require('./array-set').ArraySet;\nvar MappingList = require('./mapping-list').MappingList;\n\n/**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n *   - file: The filename of the generated source.\n *   - sourceRoot: A root for all relative URLs in this source map.\n */\nfunction SourceMapGenerator(aArgs) {\n  if (!aArgs) {\n    aArgs = {};\n  }\n  this._file = util.getArg(aArgs, 'file', null);\n  this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n  this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n  this._sources = new ArraySet();\n  this._names = new ArraySet();\n  this._mappings = new MappingList();\n  this._sourcesContents = null;\n}\n\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n  function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n    var sourceRoot = aSourceMapConsumer.sourceRoot;\n    var generator = new SourceMapGenerator({\n      file: aSourceMapConsumer.file,\n      sourceRoot: sourceRoot\n    });\n    aSourceMapConsumer.eachMapping(function (mapping) {\n      var newMapping = {\n        generated: {\n          line: mapping.generatedLine,\n          column: mapping.generatedColumn\n        }\n      };\n\n      if (mapping.source != null) {\n        newMapping.source = mapping.source;\n        if (sourceRoot != null) {\n          newMapping.source = util.relative(sourceRoot, newMapping.source);\n        }\n\n        newMapping.original = {\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        };\n\n        if (mapping.name != null) {\n          newMapping.name = mapping.name;\n        }\n      }\n\n      generator.addMapping(newMapping);\n    });\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var sourceRelative = sourceFile;\n      if (sourceRoot !== null) {\n        sourceRelative = util.relative(sourceRoot, sourceFile);\n      }\n\n      if (!generator._sources.has(sourceRelative)) {\n        generator._sources.add(sourceRelative);\n      }\n\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        generator.setSourceContent(sourceFile, content);\n      }\n    });\n    return generator;\n  };\n\n/**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n *   - generated: An object with the generated line and column positions.\n *   - original: An object with the original line and column positions.\n *   - source: The original source file (relative to the sourceRoot).\n *   - name: An optional original token name for this mapping.\n */\nSourceMapGenerator.prototype.addMapping =\n  function SourceMapGenerator_addMapping(aArgs) {\n    var generated = util.getArg(aArgs, 'generated');\n    var original = util.getArg(aArgs, 'original', null);\n    var source = util.getArg(aArgs, 'source', null);\n    var name = util.getArg(aArgs, 'name', null);\n\n    if (!this._skipValidation) {\n      this._validateMapping(generated, original, source, name);\n    }\n\n    if (source != null) {\n      source = String(source);\n      if (!this._sources.has(source)) {\n        this._sources.add(source);\n      }\n    }\n\n    if (name != null) {\n      name = String(name);\n      if (!this._names.has(name)) {\n        this._names.add(name);\n      }\n    }\n\n    this._mappings.add({\n      generatedLine: generated.line,\n      generatedColumn: generated.column,\n      originalLine: original != null && original.line,\n      originalColumn: original != null && original.column,\n      source: source,\n      name: name\n    });\n  };\n\n/**\n * Set the source content for a source file.\n */\nSourceMapGenerator.prototype.setSourceContent =\n  function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n    var source = aSourceFile;\n    if (this._sourceRoot != null) {\n      source = util.relative(this._sourceRoot, source);\n    }\n\n    if (aSourceContent != null) {\n      // Add the source content to the _sourcesContents map.\n      // Create a new _sourcesContents map if the property is null.\n      if (!this._sourcesContents) {\n        this._sourcesContents = Object.create(null);\n      }\n      this._sourcesContents[util.toSetString(source)] = aSourceContent;\n    } else if (this._sourcesContents) {\n      // Remove the source file from the _sourcesContents map.\n      // If the _sourcesContents map is empty, set the property to null.\n      delete this._sourcesContents[util.toSetString(source)];\n      if (Object.keys(this._sourcesContents).length === 0) {\n        this._sourcesContents = null;\n      }\n    }\n  };\n\n/**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n *        If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n *        to be applied. If relative, it is relative to the SourceMapConsumer.\n *        This parameter is needed when the two source maps aren't in the same\n *        directory, and the source map to be applied contains relative source\n *        paths. If so, those relative source paths need to be rewritten\n *        relative to the SourceMapGenerator.\n */\nSourceMapGenerator.prototype.applySourceMap =\n  function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n    var sourceFile = aSourceFile;\n    // If aSourceFile is omitted, we will use the file property of the SourceMap\n    if (aSourceFile == null) {\n      if (aSourceMapConsumer.file == null) {\n        throw new Error(\n          'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n          'or the source map\\'s \"file\" property. Both were omitted.'\n        );\n      }\n      sourceFile = aSourceMapConsumer.file;\n    }\n    var sourceRoot = this._sourceRoot;\n    // Make \"sourceFile\" relative if an absolute Url is passed.\n    if (sourceRoot != null) {\n      sourceFile = util.relative(sourceRoot, sourceFile);\n    }\n    // Applying the SourceMap can add and remove items from the sources and\n    // the names array.\n    var newSources = new ArraySet();\n    var newNames = new ArraySet();\n\n    // Find mappings for the \"sourceFile\"\n    this._mappings.unsortedForEach(function (mapping) {\n      if (mapping.source === sourceFile && mapping.originalLine != null) {\n        // Check if it can be mapped by the source map, then update the mapping.\n        var original = aSourceMapConsumer.originalPositionFor({\n          line: mapping.originalLine,\n          column: mapping.originalColumn\n        });\n        if (original.source != null) {\n          // Copy mapping\n          mapping.source = original.source;\n          if (aSourceMapPath != null) {\n            mapping.source = util.join(aSourceMapPath, mapping.source)\n          }\n          if (sourceRoot != null) {\n            mapping.source = util.relative(sourceRoot, mapping.source);\n          }\n          mapping.originalLine = original.line;\n          mapping.originalColumn = original.column;\n          if (original.name != null) {\n            mapping.name = original.name;\n          }\n        }\n      }\n\n      var source = mapping.source;\n      if (source != null && !newSources.has(source)) {\n        newSources.add(source);\n      }\n\n      var name = mapping.name;\n      if (name != null && !newNames.has(name)) {\n        newNames.add(name);\n      }\n\n    }, this);\n    this._sources = newSources;\n    this._names = newNames;\n\n    // Copy sourcesContents of applied map.\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        if (aSourceMapPath != null) {\n          sourceFile = util.join(aSourceMapPath, sourceFile);\n        }\n        if (sourceRoot != null) {\n          sourceFile = util.relative(sourceRoot, sourceFile);\n        }\n        this.setSourceContent(sourceFile, content);\n      }\n    }, this);\n  };\n\n/**\n * A mapping can have one of the three levels of data:\n *\n *   1. Just the generated position.\n *   2. The Generated position, original position, and original source.\n *   3. Generated and original position, original source, as well as a name\n *      token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */\nSourceMapGenerator.prototype._validateMapping =\n  function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n                                              aName) {\n    // When aOriginal is truthy but has empty values for .line and .column,\n    // it is most likely a programmer error. In this case we throw a very\n    // specific error message to try to guide them the right way.\n    // For example: https://github.com/Polymer/polymer-bundler/pull/519\n    if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n        throw new Error(\n            'original.line and original.column are not numbers -- you probably meant to omit ' +\n            'the original mapping entirely and only map the generated position. If so, pass ' +\n            'null for the original mapping instead of an object with empty or null values.'\n        );\n    }\n\n    if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n        && aGenerated.line > 0 && aGenerated.column >= 0\n        && !aOriginal && !aSource && !aName) {\n      // Case 1.\n      return;\n    }\n    else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n             && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n             && aGenerated.line > 0 && aGenerated.column >= 0\n             && aOriginal.line > 0 && aOriginal.column >= 0\n             && aSource) {\n      // Cases 2 and 3.\n      return;\n    }\n    else {\n      throw new Error('Invalid mapping: ' + JSON.stringify({\n        generated: aGenerated,\n        source: aSource,\n        original: aOriginal,\n        name: aName\n      }));\n    }\n  };\n\n/**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */\nSourceMapGenerator.prototype._serializeMappings =\n  function SourceMapGenerator_serializeMappings() {\n    var previousGeneratedColumn = 0;\n    var previousGeneratedLine = 1;\n    var previousOriginalColumn = 0;\n    var previousOriginalLine = 0;\n    var previousName = 0;\n    var previousSource = 0;\n    var result = '';\n    var next;\n    var mapping;\n    var nameIdx;\n    var sourceIdx;\n\n    var mappings = this._mappings.toArray();\n    for (var i = 0, len = mappings.length; i < len; i++) {\n      mapping = mappings[i];\n      next = ''\n\n      if (mapping.generatedLine !== previousGeneratedLine) {\n        previousGeneratedColumn = 0;\n        while (mapping.generatedLine !== previousGeneratedLine) {\n          next += ';';\n          previousGeneratedLine++;\n        }\n      }\n      else {\n        if (i > 0) {\n          if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n            continue;\n          }\n          next += ',';\n        }\n      }\n\n      next += base64VLQ.encode(mapping.generatedColumn\n                                 - previousGeneratedColumn);\n      previousGeneratedColumn = mapping.generatedColumn;\n\n      if (mapping.source != null) {\n        sourceIdx = this._sources.indexOf(mapping.source);\n        next += base64VLQ.encode(sourceIdx - previousSource);\n        previousSource = sourceIdx;\n\n        // lines are stored 0-based in SourceMap spec version 3\n        next += base64VLQ.encode(mapping.originalLine - 1\n                                   - previousOriginalLine);\n        previousOriginalLine = mapping.originalLine - 1;\n\n        next += base64VLQ.encode(mapping.originalColumn\n                                   - previousOriginalColumn);\n        previousOriginalColumn = mapping.originalColumn;\n\n        if (mapping.name != null) {\n          nameIdx = this._names.indexOf(mapping.name);\n          next += base64VLQ.encode(nameIdx - previousName);\n          previousName = nameIdx;\n        }\n      }\n\n      result += next;\n    }\n\n    return result;\n  };\n\nSourceMapGenerator.prototype._generateSourcesContent =\n  function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n    return aSources.map(function (source) {\n      if (!this._sourcesContents) {\n        return null;\n      }\n      if (aSourceRoot != null) {\n        source = util.relative(aSourceRoot, source);\n      }\n      var key = util.toSetString(source);\n      return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n        ? this._sourcesContents[key]\n        : null;\n    }, this);\n  };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n  function SourceMapGenerator_toJSON() {\n    var map = {\n      version: this._version,\n      sources: this._sources.toArray(),\n      names: this._names.toArray(),\n      mappings: this._serializeMappings()\n    };\n    if (this._file != null) {\n      map.file = this._file;\n    }\n    if (this._sourceRoot != null) {\n      map.sourceRoot = this._sourceRoot;\n    }\n    if (this._sourcesContents) {\n      map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n    }\n\n    return map;\n  };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n  function SourceMapGenerator_toString() {\n    return JSON.stringify(this.toJSON());\n  };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * Based on the Base 64 VLQ implementation in Closure Compiler:\n * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n *\n * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n *  * Redistributions of source code must retain the above copyright\n *    notice, this list of conditions and the following disclaimer.\n *  * Redistributions in binary form must reproduce the above\n *    copyright notice, this list of conditions and the following\n *    disclaimer in the documentation and/or other materials provided\n *    with the distribution.\n *  * Neither the name of Google Inc. nor the names of its\n *    contributors may be used to endorse or promote products derived\n *    from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar base64 = require('./base64');\n\n// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n// length quantities we use in the source map spec, the first bit is the sign,\n// the next four bits are the actual value, and the 6th bit is the\n// continuation bit. The continuation bit tells us whether there are more\n// digits in this value following this digit.\n//\n//   Continuation\n//   |    Sign\n//   |    |\n//   V    V\n//   101011\n\nvar VLQ_BASE_SHIFT = 5;\n\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\n// binary: 100000\nvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n\n/**\n * Converts from a two-complement value to a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n */\nfunction toVLQSigned(aValue) {\n  return aValue < 0\n    ? ((-aValue) << 1) + 1\n    : (aValue << 1) + 0;\n}\n\n/**\n * Converts to a two-complement value from a value where the sign bit is\n * placed in the least significant bit.  For example, as decimals:\n *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n */\nfunction fromVLQSigned(aValue) {\n  var isNegative = (aValue & 1) === 1;\n  var shifted = aValue >> 1;\n  return isNegative\n    ? -shifted\n    : shifted;\n}\n\n/**\n * Returns the base 64 VLQ encoded value.\n */\nexports.encode = function base64VLQ_encode(aValue) {\n  var encoded = \"\";\n  var digit;\n\n  var vlq = toVLQSigned(aValue);\n\n  do {\n    digit = vlq & VLQ_BASE_MASK;\n    vlq >>>= VLQ_BASE_SHIFT;\n    if (vlq > 0) {\n      // There are still more digits in this value, so we must make sure the\n      // continuation bit is marked.\n      digit |= VLQ_CONTINUATION_BIT;\n    }\n    encoded += base64.encode(digit);\n  } while (vlq > 0);\n\n  return encoded;\n};\n\n/**\n * Decodes the next base 64 VLQ value from the given string and returns the\n * value and the rest of the string via the out parameter.\n */\nexports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n  var strLen = aStr.length;\n  var result = 0;\n  var shift = 0;\n  var continuation, digit;\n\n  do {\n    if (aIndex >= strLen) {\n      throw new Error(\"Expected more digits in base 64 VLQ value.\");\n    }\n\n    digit = base64.decode(aStr.charCodeAt(aIndex++));\n    if (digit === -1) {\n      throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n    }\n\n    continuation = !!(digit & VLQ_CONTINUATION_BIT);\n    digit &= VLQ_BASE_MASK;\n    result = result + (digit << shift);\n    shift += VLQ_BASE_SHIFT;\n  } while (continuation);\n\n  aOutParam.value = fromVLQSigned(result);\n  aOutParam.rest = aIndex;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\nexports.encode = function (number) {\n  if (0 <= number && number < intToCharMap.length) {\n    return intToCharMap[number];\n  }\n  throw new TypeError(\"Must be between 0 and 63: \" + number);\n};\n\n/**\n * Decode a single base 64 character code digit to an integer. Returns -1 on\n * failure.\n */\nexports.decode = function (charCode) {\n  var bigA = 65;     // 'A'\n  var bigZ = 90;     // 'Z'\n\n  var littleA = 97;  // 'a'\n  var littleZ = 122; // 'z'\n\n  var zero = 48;     // '0'\n  var nine = 57;     // '9'\n\n  var plus = 43;     // '+'\n  var slash = 47;    // '/'\n\n  var littleOffset = 26;\n  var numberOffset = 52;\n\n  // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n  if (bigA <= charCode && charCode <= bigZ) {\n    return (charCode - bigA);\n  }\n\n  // 26 - 51: abcdefghijklmnopqrstuvwxyz\n  if (littleA <= charCode && charCode <= littleZ) {\n    return (charCode - littleA + littleOffset);\n  }\n\n  // 52 - 61: 0123456789\n  if (zero <= charCode && charCode <= nine) {\n    return (charCode - zero + numberOffset);\n  }\n\n  // 62: +\n  if (charCode == plus) {\n    return 62;\n  }\n\n  // 63: /\n  if (charCode == slash) {\n    return 63;\n  }\n\n  // Invalid base64 digit.\n  return -1;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n/**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */\nfunction getArg(aArgs, aName, aDefaultValue) {\n  if (aName in aArgs) {\n    return aArgs[aName];\n  } else if (arguments.length === 3) {\n    return aDefaultValue;\n  } else {\n    throw new Error('\"' + aName + '\" is a required argument.');\n  }\n}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction urlParse(aUrl) {\n  var match = aUrl.match(urlRegexp);\n  if (!match) {\n    return null;\n  }\n  return {\n    scheme: match[1],\n    auth: match[2],\n    host: match[3],\n    port: match[4],\n    path: match[5]\n  };\n}\nexports.urlParse = urlParse;\n\nfunction urlGenerate(aParsedUrl) {\n  var url = '';\n  if (aParsedUrl.scheme) {\n    url += aParsedUrl.scheme + ':';\n  }\n  url += '//';\n  if (aParsedUrl.auth) {\n    url += aParsedUrl.auth + '@';\n  }\n  if (aParsedUrl.host) {\n    url += aParsedUrl.host;\n  }\n  if (aParsedUrl.port) {\n    url += \":\" + aParsedUrl.port\n  }\n  if (aParsedUrl.path) {\n    url += aParsedUrl.path;\n  }\n  return url;\n}\nexports.urlGenerate = urlGenerate;\n\n/**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nfunction normalize(aPath) {\n  var path = aPath;\n  var url = urlParse(aPath);\n  if (url) {\n    if (!url.path) {\n      return aPath;\n    }\n    path = url.path;\n  }\n  var isAbsolute = exports.isAbsolute(path);\n\n  var parts = path.split(/\\/+/);\n  for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n    part = parts[i];\n    if (part === '.') {\n      parts.splice(i, 1);\n    } else if (part === '..') {\n      up++;\n    } else if (up > 0) {\n      if (part === '') {\n        // The first part is blank if the path is absolute. Trying to go\n        // above the root is a no-op. Therefore we can remove all '..' parts\n        // directly after the root.\n        parts.splice(i + 1, up);\n        up = 0;\n      } else {\n        parts.splice(i, 2);\n        up--;\n      }\n    }\n  }\n  path = parts.join('/');\n\n  if (path === '') {\n    path = isAbsolute ? '/' : '.';\n  }\n\n  if (url) {\n    url.path = path;\n    return urlGenerate(url);\n  }\n  return path;\n}\nexports.normalize = normalize;\n\n/**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n *   scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n *   first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n *   is updated with the result and aRoot is returned. Otherwise the result\n *   is returned.\n *   - If aPath is absolute, the result is aPath.\n *   - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */\nfunction join(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n  if (aPath === \"\") {\n    aPath = \".\";\n  }\n  var aPathUrl = urlParse(aPath);\n  var aRootUrl = urlParse(aRoot);\n  if (aRootUrl) {\n    aRoot = aRootUrl.path || '/';\n  }\n\n  // `join(foo, '//www.example.org')`\n  if (aPathUrl && !aPathUrl.scheme) {\n    if (aRootUrl) {\n      aPathUrl.scheme = aRootUrl.scheme;\n    }\n    return urlGenerate(aPathUrl);\n  }\n\n  if (aPathUrl || aPath.match(dataUrlRegexp)) {\n    return aPath;\n  }\n\n  // `join('http://', 'www.example.com')`\n  if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n    aRootUrl.host = aPath;\n    return urlGenerate(aRootUrl);\n  }\n\n  var joined = aPath.charAt(0) === '/'\n    ? aPath\n    : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\n  if (aRootUrl) {\n    aRootUrl.path = joined;\n    return urlGenerate(aRootUrl);\n  }\n  return joined;\n}\nexports.join = join;\n\nexports.isAbsolute = function (aPath) {\n  return aPath.charAt(0) === '/' || urlRegexp.test(aPath);\n};\n\n/**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */\nfunction relative(aRoot, aPath) {\n  if (aRoot === \"\") {\n    aRoot = \".\";\n  }\n\n  aRoot = aRoot.replace(/\\/$/, '');\n\n  // It is possible for the path to be above the root. In this case, simply\n  // checking whether the root is a prefix of the path won't work. Instead, we\n  // need to remove components from the root one by one, until either we find\n  // a prefix that fits, or we run out of components to remove.\n  var level = 0;\n  while (aPath.indexOf(aRoot + '/') !== 0) {\n    var index = aRoot.lastIndexOf(\"/\");\n    if (index < 0) {\n      return aPath;\n    }\n\n    // If the only part of the root that is left is the scheme (i.e. http://,\n    // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n    // have exhausted all components, so the path is not relative to the root.\n    aRoot = aRoot.slice(0, index);\n    if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n      return aPath;\n    }\n\n    ++level;\n  }\n\n  // Make sure we add a \"../\" for each component we removed from the root.\n  return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n  var obj = Object.create(null);\n  return !('__proto__' in obj);\n}());\n\nfunction identity (s) {\n  return s;\n}\n\n/**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */\nfunction toSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return '$' + aStr;\n  }\n\n  return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n  if (isProtoString(aStr)) {\n    return aStr.slice(1);\n  }\n\n  return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction isProtoString(s) {\n  if (!s) {\n    return false;\n  }\n\n  var length = s.length;\n\n  if (length < 9 /* \"__proto__\".length */) {\n    return false;\n  }\n\n  if (s.charCodeAt(length - 1) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 2) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n      s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n      s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n      s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n      s.charCodeAt(length - 8) !== 95  /* '_' */ ||\n      s.charCodeAt(length - 9) !== 95  /* '_' */) {\n    return false;\n  }\n\n  for (var i = length - 10; i >= 0; i--) {\n    if (s.charCodeAt(i) !== 36 /* '$' */) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n  var cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0 || onlyCompareOriginal) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByOriginalPositions = compareByOriginalPositions;\n\n/**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0 || onlyCompareGenerated) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction strcmp(aStr1, aStr2) {\n  if (aStr1 === aStr2) {\n    return 0;\n  }\n\n  if (aStr1 === null) {\n    return 1; // aStr2 !== null\n  }\n\n  if (aStr2 === null) {\n    return -1; // aStr1 !== null\n  }\n\n  if (aStr1 > aStr2) {\n    return 1;\n  }\n\n  return -1;\n}\n\n/**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */\nfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n  var cmp = mappingA.generatedLine - mappingB.generatedLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = strcmp(mappingA.source, mappingB.source);\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalLine - mappingB.originalLine;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  cmp = mappingA.originalColumn - mappingB.originalColumn;\n  if (cmp !== 0) {\n    return cmp;\n  }\n\n  return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\n/**\n * Strip any JSON XSSI avoidance prefix from the string (as documented\n * in the source maps specification), and then parse the string as\n * JSON.\n */\nfunction parseSourceMapInput(str) {\n  return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, ''));\n}\nexports.parseSourceMapInput = parseSourceMapInput;\n\n/**\n * Compute the URL of a source given the the source root, the source's\n * URL, and the source map's URL.\n */\nfunction computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n  sourceURL = sourceURL || '';\n\n  if (sourceRoot) {\n    // This follows what Chrome does.\n    if (sourceRoot[sourceRoot.length - 1] !== '/' && sourceURL[0] !== '/') {\n      sourceRoot += '/';\n    }\n    // The spec says:\n    //   Line 4: An optional source root, useful for relocating source\n    //   files on a server or removing repeated values in the\n    //   “sources” entry.  This value is prepended to the individual\n    //   entries in the “source” field.\n    sourceURL = sourceRoot + sourceURL;\n  }\n\n  // Historically, SourceMapConsumer did not take the sourceMapURL as\n  // a parameter.  This mode is still somewhat supported, which is why\n  // this code block is conditional.  However, it's preferable to pass\n  // the source map URL to SourceMapConsumer, so that this function\n  // can implement the source URL resolution algorithm as outlined in\n  // the spec.  This block is basically the equivalent of:\n  //    new URL(sourceURL, sourceMapURL).toString()\n  // ... except it avoids using URL, which wasn't available in the\n  // older releases of node still supported by this library.\n  //\n  // The spec says:\n  //   If the sources are not absolute URLs after prepending of the\n  //   “sourceRoot”, the sources are resolved relative to the\n  //   SourceMap (like resolving script src in a html document).\n  if (sourceMapURL) {\n    var parsed = urlParse(sourceMapURL);\n    if (!parsed) {\n      throw new Error(\"sourceMapURL could not be parsed\");\n    }\n    if (parsed.path) {\n      // Strip the last path component, but keep the \"/\".\n      var index = parsed.path.lastIndexOf('/');\n      if (index >= 0) {\n        parsed.path = parsed.path.substring(0, index + 1);\n      }\n    }\n    sourceURL = join(urlGenerate(parsed), sourceURL);\n  }\n\n  return normalize(sourceURL);\n}\nexports.computeSourceURL = computeSourceURL;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar has = Object.prototype.hasOwnProperty;\nvar hasNativeMap = typeof Map !== \"undefined\";\n\n/**\n * A data structure which is a combination of an array and a set. Adding a new\n * member is O(1), testing for membership is O(1), and finding the index of an\n * element is O(1). Removing elements from the set is not supported. Only\n * strings are supported for membership.\n */\nfunction ArraySet() {\n  this._array = [];\n  this._set = hasNativeMap ? new Map() : Object.create(null);\n}\n\n/**\n * Static method for creating ArraySet instances from an existing array.\n */\nArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n  var set = new ArraySet();\n  for (var i = 0, len = aArray.length; i < len; i++) {\n    set.add(aArray[i], aAllowDuplicates);\n  }\n  return set;\n};\n\n/**\n * Return how many unique items are in this ArraySet. If duplicates have been\n * added, than those do not count towards the size.\n *\n * @returns Number\n */\nArraySet.prototype.size = function ArraySet_size() {\n  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */\nArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n  var idx = this._array.length;\n  if (!isDuplicate || aAllowDuplicates) {\n    this._array.push(aStr);\n  }\n  if (!isDuplicate) {\n    if (hasNativeMap) {\n      this._set.set(aStr, idx);\n    } else {\n      this._set[sStr] = idx;\n    }\n  }\n};\n\n/**\n * Is the given string a member of this set?\n *\n * @param String aStr\n */\nArraySet.prototype.has = function ArraySet_has(aStr) {\n  if (hasNativeMap) {\n    return this._set.has(aStr);\n  } else {\n    var sStr = util.toSetString(aStr);\n    return has.call(this._set, sStr);\n  }\n};\n\n/**\n * What is the index of the given string in the array?\n *\n * @param String aStr\n */\nArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n  if (hasNativeMap) {\n    var idx = this._set.get(aStr);\n    if (idx >= 0) {\n        return idx;\n    }\n  } else {\n    var sStr = util.toSetString(aStr);\n    if (has.call(this._set, sStr)) {\n      return this._set[sStr];\n    }\n  }\n\n  throw new Error('\"' + aStr + '\" is not in the set.');\n};\n\n/**\n * What is the element at the given index?\n *\n * @param Number aIdx\n */\nArraySet.prototype.at = function ArraySet_at(aIdx) {\n  if (aIdx >= 0 && aIdx < this._array.length) {\n    return this._array[aIdx];\n  }\n  throw new Error('No element indexed by ' + aIdx);\n};\n\n/**\n * Returns the array representation of this set (which has the proper indices\n * indicated by indexOf). Note that this is a copy of the internal array used\n * for storing the members so that no one can mess with internal state.\n */\nArraySet.prototype.toArray = function ArraySet_toArray() {\n  return this._array.slice();\n};\n\nexports.ArraySet = ArraySet;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2014 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\n\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\nfunction generatedPositionAfter(mappingA, mappingB) {\n  // Optimized for most common case\n  var lineA = mappingA.generatedLine;\n  var lineB = mappingB.generatedLine;\n  var columnA = mappingA.generatedColumn;\n  var columnB = mappingB.generatedColumn;\n  return lineB > lineA || lineB == lineA && columnB >= columnA ||\n         util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n}\n\n/**\n * A data structure to provide a sorted view of accumulated mappings in a\n * performance conscious manner. It trades a neglibable overhead in general\n * case for a large speedup in case of mappings being added in order.\n */\nfunction MappingList() {\n  this._array = [];\n  this._sorted = true;\n  // Serves as infimum\n  this._last = {generatedLine: -1, generatedColumn: 0};\n}\n\n/**\n * Iterate through internal items. This method takes the same arguments that\n * `Array.prototype.forEach` takes.\n *\n * NOTE: The order of the mappings is NOT guaranteed.\n */\nMappingList.prototype.unsortedForEach =\n  function MappingList_forEach(aCallback, aThisArg) {\n    this._array.forEach(aCallback, aThisArg);\n  };\n\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\nMappingList.prototype.add = function MappingList_add(aMapping) {\n  if (generatedPositionAfter(this._last, aMapping)) {\n    this._last = aMapping;\n    this._array.push(aMapping);\n  } else {\n    this._sorted = false;\n    this._array.push(aMapping);\n  }\n};\n\n/**\n * Returns the flat, sorted array of mappings. The mappings are sorted by\n * generated position.\n *\n * WARNING: This method returns internal data without copying, for\n * performance. The return value must NOT be mutated, and should be treated as\n * an immutable borrow. If you want to take ownership, you must make your own\n * copy.\n */\nMappingList.prototype.toArray = function MappingList_toArray() {\n  if (!this._sorted) {\n    this._array.sort(util.compareByGeneratedPositionsInflated);\n    this._sorted = true;\n  }\n  return this._array;\n};\n\nexports.MappingList = MappingList;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = require('./util');\nvar binarySearch = require('./binary-search');\nvar ArraySet = require('./array-set').ArraySet;\nvar base64VLQ = require('./base64-vlq');\nvar quickSort = require('./quick-sort').quickSort;\n\nfunction SourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  return sourceMap.sections != null\n    ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)\n    : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);\n}\n\nSourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n  return BasicSourceMapConsumer.fromSourceMap(aSourceMap, aSourceMapURL);\n}\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nSourceMapConsumer.prototype._version = 3;\n\n// `__generatedMappings` and `__originalMappings` are arrays that hold the\n// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n// are lazily instantiated, accessed via the `_generatedMappings` and\n// `_originalMappings` getters respectively, and we only parse the mappings\n// and create these arrays once queried for a source location. We jump through\n// these hoops because there can be many thousands of mappings, and parsing\n// them is expensive, so we only want to do it if we must.\n//\n// Each object in the arrays is of the form:\n//\n//     {\n//       generatedLine: The line number in the generated code,\n//       generatedColumn: The column number in the generated code,\n//       source: The path to the original source file that generated this\n//               chunk of code,\n//       originalLine: The line number in the original source that\n//                     corresponds to this chunk of generated code,\n//       originalColumn: The column number in the original source that\n//                       corresponds to this chunk of generated code,\n//       name: The name of the original symbol which generated this chunk of\n//             code.\n//     }\n//\n// All properties except for `generatedLine` and `generatedColumn` can be\n// `null`.\n//\n// `_generatedMappings` is ordered by the generated positions.\n//\n// `_originalMappings` is ordered by the original positions.\n\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n  configurable: true,\n  enumerable: true,\n  get: function () {\n    if (!this.__generatedMappings) {\n      this._parseMappings(this._mappings, this.sourceRoot);\n    }\n\n    return this.__generatedMappings;\n  }\n});\n\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n  configurable: true,\n  enumerable: true,\n  get: function () {\n    if (!this.__originalMappings) {\n      this._parseMappings(this._mappings, this.sourceRoot);\n    }\n\n    return this.__originalMappings;\n  }\n});\n\nSourceMapConsumer.prototype._charIsMappingSeparator =\n  function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n    var c = aStr.charAt(index);\n    return c === \";\" || c === \",\";\n  };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    throw new Error(\"Subclasses must implement _parseMappings\");\n  };\n\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\n\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\n/**\n * Iterate over each mapping between an original source/line/column and a\n * generated line/column in this source map.\n *\n * @param Function aCallback\n *        The function that is called with each mapping.\n * @param Object aContext\n *        Optional. If specified, this object will be the value of `this` every\n *        time that `aCallback` is called.\n * @param aOrder\n *        Either `SourceMapConsumer.GENERATED_ORDER` or\n *        `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n *        iterate over the mappings sorted by the generated file's line/column\n *        order or the original's source/line/column order, respectively. Defaults to\n *        `SourceMapConsumer.GENERATED_ORDER`.\n */\nSourceMapConsumer.prototype.eachMapping =\n  function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n    var context = aContext || null;\n    var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\n    var mappings;\n    switch (order) {\n    case SourceMapConsumer.GENERATED_ORDER:\n      mappings = this._generatedMappings;\n      break;\n    case SourceMapConsumer.ORIGINAL_ORDER:\n      mappings = this._originalMappings;\n      break;\n    default:\n      throw new Error(\"Unknown order of iteration.\");\n    }\n\n    var sourceRoot = this.sourceRoot;\n    mappings.map(function (mapping) {\n      var source = mapping.source === null ? null : this._sources.at(mapping.source);\n      source = util.computeSourceURL(sourceRoot, source, this._sourceMapURL);\n      return {\n        source: source,\n        generatedLine: mapping.generatedLine,\n        generatedColumn: mapping.generatedColumn,\n        originalLine: mapping.originalLine,\n        originalColumn: mapping.originalColumn,\n        name: mapping.name === null ? null : this._names.at(mapping.name)\n      };\n    }, this).forEach(aCallback, context);\n  };\n\n/**\n * Returns all generated line and column information for the original source,\n * line, and column provided. If no column is provided, returns all mappings\n * corresponding to a either the line we are searching for or the next\n * closest line that has any mappings. Otherwise, returns all mappings\n * corresponding to the given line and either the column we are searching for\n * or the next closest column that has any offsets.\n *\n * The only argument is an object with the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number is 1-based.\n *   - column: Optional. the column number in the original source.\n *    The column number is 0-based.\n *\n * and an array of objects is returned, each with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *    line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *    The column number is 0-based.\n */\nSourceMapConsumer.prototype.allGeneratedPositionsFor =\n  function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n    var line = util.getArg(aArgs, 'line');\n\n    // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n    // returns the index of the closest mapping less than the needle. By\n    // setting needle.originalColumn to 0, we thus find the last mapping for\n    // the given line, provided such a mapping exists.\n    var needle = {\n      source: util.getArg(aArgs, 'source'),\n      originalLine: line,\n      originalColumn: util.getArg(aArgs, 'column', 0)\n    };\n\n    needle.source = this._findSourceIndex(needle.source);\n    if (needle.source < 0) {\n      return [];\n    }\n\n    var mappings = [];\n\n    var index = this._findMapping(needle,\n                                  this._originalMappings,\n                                  \"originalLine\",\n                                  \"originalColumn\",\n                                  util.compareByOriginalPositions,\n                                  binarySearch.LEAST_UPPER_BOUND);\n    if (index >= 0) {\n      var mapping = this._originalMappings[index];\n\n      if (aArgs.column === undefined) {\n        var originalLine = mapping.originalLine;\n\n        // Iterate until either we run out of mappings, or we run into\n        // a mapping for a different line than the one we found. Since\n        // mappings are sorted, this is guaranteed to find all mappings for\n        // the line we found.\n        while (mapping && mapping.originalLine === originalLine) {\n          mappings.push({\n            line: util.getArg(mapping, 'generatedLine', null),\n            column: util.getArg(mapping, 'generatedColumn', null),\n            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n          });\n\n          mapping = this._originalMappings[++index];\n        }\n      } else {\n        var originalColumn = mapping.originalColumn;\n\n        // Iterate until either we run out of mappings, or we run into\n        // a mapping for a different line than the one we were searching for.\n        // Since mappings are sorted, this is guaranteed to find all mappings for\n        // the line we are searching for.\n        while (mapping &&\n               mapping.originalLine === line &&\n               mapping.originalColumn == originalColumn) {\n          mappings.push({\n            line: util.getArg(mapping, 'generatedLine', null),\n            column: util.getArg(mapping, 'generatedColumn', null),\n            lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n          });\n\n          mapping = this._originalMappings[++index];\n        }\n      }\n    }\n\n    return mappings;\n  };\n\nexports.SourceMapConsumer = SourceMapConsumer;\n\n/**\n * A BasicSourceMapConsumer instance represents a parsed source map which we can\n * query for information about the original file positions by giving it a file\n * position in the generated source.\n *\n * The first parameter is the raw source map (either as a JSON string, or\n * already parsed to an object). According to the spec, source maps have the\n * following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - sources: An array of URLs to the original source files.\n *   - names: An array of identifiers which can be referrenced by individual mappings.\n *   - sourceRoot: Optional. The URL root from which all sources are relative.\n *   - sourcesContent: Optional. An array of contents of the original source files.\n *   - mappings: A string of base64 VLQs which contain the actual mappings.\n *   - file: Optional. The generated file this source map is associated with.\n *\n * Here is an example source map, taken from the source map spec[0]:\n *\n *     {\n *       version : 3,\n *       file: \"out.js\",\n *       sourceRoot : \"\",\n *       sources: [\"foo.js\", \"bar.js\"],\n *       names: [\"src\", \"maps\", \"are\", \"fun\"],\n *       mappings: \"AA,AB;;ABCDE;\"\n *     }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n */\nfunction BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  var version = util.getArg(sourceMap, 'version');\n  var sources = util.getArg(sourceMap, 'sources');\n  // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n  // requires the array) to play nice here.\n  var names = util.getArg(sourceMap, 'names', []);\n  var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n  var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n  var mappings = util.getArg(sourceMap, 'mappings');\n  var file = util.getArg(sourceMap, 'file', null);\n\n  // Once again, Sass deviates from the spec and supplies the version as a\n  // string rather than a number, so we use loose equality checking here.\n  if (version != this._version) {\n    throw new Error('Unsupported version: ' + version);\n  }\n\n  if (sourceRoot) {\n    sourceRoot = util.normalize(sourceRoot);\n  }\n\n  sources = sources\n    .map(String)\n    // Some source maps produce relative source paths like \"./foo.js\" instead of\n    // \"foo.js\".  Normalize these first so that future comparisons will succeed.\n    // See bugzil.la/1090768.\n    .map(util.normalize)\n    // Always ensure that absolute sources are internally stored relative to\n    // the source root, if the source root is absolute. Not doing this would\n    // be particularly problematic when the source root is a prefix of the\n    // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n    .map(function (source) {\n      return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)\n        ? util.relative(sourceRoot, source)\n        : source;\n    });\n\n  // Pass `true` below to allow duplicate names and sources. While source maps\n  // are intended to be compressed and deduplicated, the TypeScript compiler\n  // sometimes generates source maps with duplicates in them. See Github issue\n  // #72 and bugzil.la/889492.\n  this._names = ArraySet.fromArray(names.map(String), true);\n  this._sources = ArraySet.fromArray(sources, true);\n\n  this._absoluteSources = this._sources.toArray().map(function (s) {\n    return util.computeSourceURL(sourceRoot, s, aSourceMapURL);\n  });\n\n  this.sourceRoot = sourceRoot;\n  this.sourcesContent = sourcesContent;\n  this._mappings = mappings;\n  this._sourceMapURL = aSourceMapURL;\n  this.file = file;\n}\n\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n/**\n * Utility function to find the index of a source.  Returns -1 if not\n * found.\n */\nBasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {\n  var relativeSource = aSource;\n  if (this.sourceRoot != null) {\n    relativeSource = util.relative(this.sourceRoot, relativeSource);\n  }\n\n  if (this._sources.has(relativeSource)) {\n    return this._sources.indexOf(relativeSource);\n  }\n\n  // Maybe aSource is an absolute URL as returned by |sources|.  In\n  // this case we can't simply undo the transform.\n  var i;\n  for (i = 0; i < this._absoluteSources.length; ++i) {\n    if (this._absoluteSources[i] == aSource) {\n      return i;\n    }\n  }\n\n  return -1;\n};\n\n/**\n * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n *\n * @param SourceMapGenerator aSourceMap\n *        The source map that will be consumed.\n * @param String aSourceMapURL\n *        The URL at which the source map can be found (optional)\n * @returns BasicSourceMapConsumer\n */\nBasicSourceMapConsumer.fromSourceMap =\n  function SourceMapConsumer_fromSourceMap(aSourceMap, aSourceMapURL) {\n    var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n    var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n    var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n    smc.sourceRoot = aSourceMap._sourceRoot;\n    smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n                                                            smc.sourceRoot);\n    smc.file = aSourceMap._file;\n    smc._sourceMapURL = aSourceMapURL;\n    smc._absoluteSources = smc._sources.toArray().map(function (s) {\n      return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);\n    });\n\n    // Because we are modifying the entries (by converting string sources and\n    // names to indices into the sources and names ArraySets), we have to make\n    // a copy of the entry or else bad things happen. Shared mutable state\n    // strikes again! See github issue #191.\n\n    var generatedMappings = aSourceMap._mappings.toArray().slice();\n    var destGeneratedMappings = smc.__generatedMappings = [];\n    var destOriginalMappings = smc.__originalMappings = [];\n\n    for (var i = 0, length = generatedMappings.length; i < length; i++) {\n      var srcMapping = generatedMappings[i];\n      var destMapping = new Mapping;\n      destMapping.generatedLine = srcMapping.generatedLine;\n      destMapping.generatedColumn = srcMapping.generatedColumn;\n\n      if (srcMapping.source) {\n        destMapping.source = sources.indexOf(srcMapping.source);\n        destMapping.originalLine = srcMapping.originalLine;\n        destMapping.originalColumn = srcMapping.originalColumn;\n\n        if (srcMapping.name) {\n          destMapping.name = names.indexOf(srcMapping.name);\n        }\n\n        destOriginalMappings.push(destMapping);\n      }\n\n      destGeneratedMappings.push(destMapping);\n    }\n\n    quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\n    return smc;\n  };\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nBasicSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    return this._absoluteSources.slice();\n  }\n});\n\n/**\n * Provide the JIT with a nice shape / hidden class.\n */\nfunction Mapping() {\n  this.generatedLine = 0;\n  this.generatedColumn = 0;\n  this.source = null;\n  this.originalLine = null;\n  this.originalColumn = null;\n  this.name = null;\n}\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nBasicSourceMapConsumer.prototype._parseMappings =\n  function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    var generatedLine = 1;\n    var previousGeneratedColumn = 0;\n    var previousOriginalLine = 0;\n    var previousOriginalColumn = 0;\n    var previousSource = 0;\n    var previousName = 0;\n    var length = aStr.length;\n    var index = 0;\n    var cachedSegments = {};\n    var temp = {};\n    var originalMappings = [];\n    var generatedMappings = [];\n    var mapping, str, segment, end, value;\n\n    while (index < length) {\n      if (aStr.charAt(index) === ';') {\n        generatedLine++;\n        index++;\n        previousGeneratedColumn = 0;\n      }\n      else if (aStr.charAt(index) === ',') {\n        index++;\n      }\n      else {\n        mapping = new Mapping();\n        mapping.generatedLine = generatedLine;\n\n        // Because each offset is encoded relative to the previous one,\n        // many segments often have the same encoding. We can exploit this\n        // fact by caching the parsed variable length fields of each segment,\n        // allowing us to avoid a second parse if we encounter the same\n        // segment again.\n        for (end = index; end < length; end++) {\n          if (this._charIsMappingSeparator(aStr, end)) {\n            break;\n          }\n        }\n        str = aStr.slice(index, end);\n\n        segment = cachedSegments[str];\n        if (segment) {\n          index += str.length;\n        } else {\n          segment = [];\n          while (index < end) {\n            base64VLQ.decode(aStr, index, temp);\n            value = temp.value;\n            index = temp.rest;\n            segment.push(value);\n          }\n\n          if (segment.length === 2) {\n            throw new Error('Found a source, but no line and column');\n          }\n\n          if (segment.length === 3) {\n            throw new Error('Found a source and line, but no column');\n          }\n\n          cachedSegments[str] = segment;\n        }\n\n        // Generated column.\n        mapping.generatedColumn = previousGeneratedColumn + segment[0];\n        previousGeneratedColumn = mapping.generatedColumn;\n\n        if (segment.length > 1) {\n          // Original source.\n          mapping.source = previousSource + segment[1];\n          previousSource += segment[1];\n\n          // Original line.\n          mapping.originalLine = previousOriginalLine + segment[2];\n          previousOriginalLine = mapping.originalLine;\n          // Lines are stored 0-based\n          mapping.originalLine += 1;\n\n          // Original column.\n          mapping.originalColumn = previousOriginalColumn + segment[3];\n          previousOriginalColumn = mapping.originalColumn;\n\n          if (segment.length > 4) {\n            // Original name.\n            mapping.name = previousName + segment[4];\n            previousName += segment[4];\n          }\n        }\n\n        generatedMappings.push(mapping);\n        if (typeof mapping.originalLine === 'number') {\n          originalMappings.push(mapping);\n        }\n      }\n    }\n\n    quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);\n    this.__generatedMappings = generatedMappings;\n\n    quickSort(originalMappings, util.compareByOriginalPositions);\n    this.__originalMappings = originalMappings;\n  };\n\n/**\n * Find the mapping that best matches the hypothetical \"needle\" mapping that\n * we are searching for in the given \"haystack\" of mappings.\n */\nBasicSourceMapConsumer.prototype._findMapping =\n  function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n                                         aColumnName, aComparator, aBias) {\n    // To return the position we are searching for, we must first find the\n    // mapping for the given position and then return the opposite position it\n    // points to. Because the mappings are sorted, we can use binary search to\n    // find the best mapping.\n\n    if (aNeedle[aLineName] <= 0) {\n      throw new TypeError('Line must be greater than or equal to 1, got '\n                          + aNeedle[aLineName]);\n    }\n    if (aNeedle[aColumnName] < 0) {\n      throw new TypeError('Column must be greater than or equal to 0, got '\n                          + aNeedle[aColumnName]);\n    }\n\n    return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n  };\n\n/**\n * Compute the last column for each generated mapping. The last column is\n * inclusive.\n */\nBasicSourceMapConsumer.prototype.computeColumnSpans =\n  function SourceMapConsumer_computeColumnSpans() {\n    for (var index = 0; index < this._generatedMappings.length; ++index) {\n      var mapping = this._generatedMappings[index];\n\n      // Mappings do not contain a field for the last generated columnt. We\n      // can come up with an optimistic estimate, however, by assuming that\n      // mappings are contiguous (i.e. given two consecutive mappings, the\n      // first mapping ends where the second one starts).\n      if (index + 1 < this._generatedMappings.length) {\n        var nextMapping = this._generatedMappings[index + 1];\n\n        if (mapping.generatedLine === nextMapping.generatedLine) {\n          mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n          continue;\n        }\n      }\n\n      // The last mapping for each line spans the entire line.\n      mapping.lastGeneratedColumn = Infinity;\n    }\n  };\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */\nBasicSourceMapConsumer.prototype.originalPositionFor =\n  function SourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n      generatedLine: util.getArg(aArgs, 'line'),\n      generatedColumn: util.getArg(aArgs, 'column')\n    };\n\n    var index = this._findMapping(\n      needle,\n      this._generatedMappings,\n      \"generatedLine\",\n      \"generatedColumn\",\n      util.compareByGeneratedPositionsDeflated,\n      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n    );\n\n    if (index >= 0) {\n      var mapping = this._generatedMappings[index];\n\n      if (mapping.generatedLine === needle.generatedLine) {\n        var source = util.getArg(mapping, 'source', null);\n        if (source !== null) {\n          source = this._sources.at(source);\n          source = util.computeSourceURL(this.sourceRoot, source, this._sourceMapURL);\n        }\n        var name = util.getArg(mapping, 'name', null);\n        if (name !== null) {\n          name = this._names.at(name);\n        }\n        return {\n          source: source,\n          line: util.getArg(mapping, 'originalLine', null),\n          column: util.getArg(mapping, 'originalColumn', null),\n          name: name\n        };\n      }\n    }\n\n    return {\n      source: null,\n      line: null,\n      column: null,\n      name: null\n    };\n  };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function BasicSourceMapConsumer_hasContentsOfAllSources() {\n    if (!this.sourcesContent) {\n      return false;\n    }\n    return this.sourcesContent.length >= this._sources.size() &&\n      !this.sourcesContent.some(function (sc) { return sc == null; });\n  };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nBasicSourceMapConsumer.prototype.sourceContentFor =\n  function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    if (!this.sourcesContent) {\n      return null;\n    }\n\n    var index = this._findSourceIndex(aSource);\n    if (index >= 0) {\n      return this.sourcesContent[index];\n    }\n\n    var relativeSource = aSource;\n    if (this.sourceRoot != null) {\n      relativeSource = util.relative(this.sourceRoot, relativeSource);\n    }\n\n    var url;\n    if (this.sourceRoot != null\n        && (url = util.urlParse(this.sourceRoot))) {\n      // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n      // many users. We can help them out when they expect file:// URIs to\n      // behave like it would if they were running a local HTTP server. See\n      // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n      var fileUriAbsPath = relativeSource.replace(/^file:\\/\\//, \"\");\n      if (url.scheme == \"file\"\n          && this._sources.has(fileUriAbsPath)) {\n        return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n      }\n\n      if ((!url.path || url.path == \"/\")\n          && this._sources.has(\"/\" + relativeSource)) {\n        return this.sourcesContent[this._sources.indexOf(\"/\" + relativeSource)];\n      }\n    }\n\n    // This function is used recursively from\n    // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n    // don't want to throw if we can't find the source - we just want to\n    // return null, so we provide a flag to exit gracefully.\n    if (nullOnMissing) {\n      return null;\n    }\n    else {\n      throw new Error('\"' + relativeSource + '\" is not in the SourceMap.');\n    }\n  };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *   - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n *     'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */\nBasicSourceMapConsumer.prototype.generatedPositionFor =\n  function SourceMapConsumer_generatedPositionFor(aArgs) {\n    var source = util.getArg(aArgs, 'source');\n    source = this._findSourceIndex(source);\n    if (source < 0) {\n      return {\n        line: null,\n        column: null,\n        lastColumn: null\n      };\n    }\n\n    var needle = {\n      source: source,\n      originalLine: util.getArg(aArgs, 'line'),\n      originalColumn: util.getArg(aArgs, 'column')\n    };\n\n    var index = this._findMapping(\n      needle,\n      this._originalMappings,\n      \"originalLine\",\n      \"originalColumn\",\n      util.compareByOriginalPositions,\n      util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n    );\n\n    if (index >= 0) {\n      var mapping = this._originalMappings[index];\n\n      if (mapping.source === needle.source) {\n        return {\n          line: util.getArg(mapping, 'generatedLine', null),\n          column: util.getArg(mapping, 'generatedColumn', null),\n          lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n        };\n      }\n    }\n\n    return {\n      line: null,\n      column: null,\n      lastColumn: null\n    };\n  };\n\nexports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\n/**\n * An IndexedSourceMapConsumer instance represents a parsed source map which\n * we can query for information. It differs from BasicSourceMapConsumer in\n * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n * input.\n *\n * The first parameter is a raw source map (either as a JSON string, or already\n * parsed to an object). According to the spec for indexed source maps, they\n * have the following attributes:\n *\n *   - version: Which version of the source map spec this map is following.\n *   - file: Optional. The generated file this source map is associated with.\n *   - sections: A list of section definitions.\n *\n * Each value under the \"sections\" field has two fields:\n *   - offset: The offset into the original specified at which this section\n *       begins to apply, defined as an object with a \"line\" and \"column\"\n *       field.\n *   - map: A source map definition. This source map could also be indexed,\n *       but doesn't have to be.\n *\n * Instead of the \"map\" field, it's also possible to have a \"url\" field\n * specifying a URL to retrieve a source map from, but that's currently\n * unsupported.\n *\n * Here's an example source map, taken from the source map spec[0], but\n * modified to omit a section which uses the \"url\" field.\n *\n *  {\n *    version : 3,\n *    file: \"app.js\",\n *    sections: [{\n *      offset: {line:100, column:10},\n *      map: {\n *        version : 3,\n *        file: \"section.js\",\n *        sources: [\"foo.js\", \"bar.js\"],\n *        names: [\"src\", \"maps\", \"are\", \"fun\"],\n *        mappings: \"AAAA,E;;ABCDE;\"\n *      }\n *    }],\n *  }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found.  This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n */\nfunction IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {\n  var sourceMap = aSourceMap;\n  if (typeof aSourceMap === 'string') {\n    sourceMap = util.parseSourceMapInput(aSourceMap);\n  }\n\n  var version = util.getArg(sourceMap, 'version');\n  var sections = util.getArg(sourceMap, 'sections');\n\n  if (version != this._version) {\n    throw new Error('Unsupported version: ' + version);\n  }\n\n  this._sources = new ArraySet();\n  this._names = new ArraySet();\n\n  var lastOffset = {\n    line: -1,\n    column: 0\n  };\n  this._sections = sections.map(function (s) {\n    if (s.url) {\n      // The url field will require support for asynchronicity.\n      // See https://github.com/mozilla/source-map/issues/16\n      throw new Error('Support for url field in sections not implemented.');\n    }\n    var offset = util.getArg(s, 'offset');\n    var offsetLine = util.getArg(offset, 'line');\n    var offsetColumn = util.getArg(offset, 'column');\n\n    if (offsetLine < lastOffset.line ||\n        (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n      throw new Error('Section offsets must be ordered and non-overlapping.');\n    }\n    lastOffset = offset;\n\n    return {\n      generatedOffset: {\n        // The offset fields are 0-based, but we use 1-based indices when\n        // encoding/decoding from VLQ.\n        generatedLine: offsetLine + 1,\n        generatedColumn: offsetColumn + 1\n      },\n      consumer: new SourceMapConsumer(util.getArg(s, 'map'), aSourceMapURL)\n    }\n  });\n}\n\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nIndexedSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n  get: function () {\n    var sources = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\n        sources.push(this._sections[i].consumer.sources[j]);\n      }\n    }\n    return sources;\n  }\n});\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n *   - line: The line number in the generated source.  The line number\n *     is 1-based.\n *   - column: The column number in the generated source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - source: The original source file, or null.\n *   - line: The line number in the original source, or null.  The\n *     line number is 1-based.\n *   - column: The column number in the original source, or null.  The\n *     column number is 0-based.\n *   - name: The original identifier, or null.\n */\nIndexedSourceMapConsumer.prototype.originalPositionFor =\n  function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n    var needle = {\n      generatedLine: util.getArg(aArgs, 'line'),\n      generatedColumn: util.getArg(aArgs, 'column')\n    };\n\n    // Find the section containing the generated position we're trying to map\n    // to an original position.\n    var sectionIndex = binarySearch.search(needle, this._sections,\n      function(needle, section) {\n        var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n        if (cmp) {\n          return cmp;\n        }\n\n        return (needle.generatedColumn -\n                section.generatedOffset.generatedColumn);\n      });\n    var section = this._sections[sectionIndex];\n\n    if (!section) {\n      return {\n        source: null,\n        line: null,\n        column: null,\n        name: null\n      };\n    }\n\n    return section.consumer.originalPositionFor({\n      line: needle.generatedLine -\n        (section.generatedOffset.generatedLine - 1),\n      column: needle.generatedColumn -\n        (section.generatedOffset.generatedLine === needle.generatedLine\n         ? section.generatedOffset.generatedColumn - 1\n         : 0),\n      bias: aArgs.bias\n    });\n  };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n  function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n    return this._sections.every(function (s) {\n      return s.consumer.hasContentsOfAllSources();\n    });\n  };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nIndexedSourceMapConsumer.prototype.sourceContentFor =\n  function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n\n      var content = section.consumer.sourceContentFor(aSource, true);\n      if (content) {\n        return content;\n      }\n    }\n    if (nullOnMissing) {\n      return null;\n    }\n    else {\n      throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n    }\n  };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n *   - source: The filename of the original source.\n *   - line: The line number in the original source.  The line number\n *     is 1-based.\n *   - column: The column number in the original source.  The column\n *     number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n *   - line: The line number in the generated source, or null.  The\n *     line number is 1-based. \n *   - column: The column number in the generated source, or null.\n *     The column number is 0-based.\n */\nIndexedSourceMapConsumer.prototype.generatedPositionFor =\n  function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n\n      // Only consider this section if the requested source is in the list of\n      // sources of the consumer.\n      if (section.consumer._findSourceIndex(util.getArg(aArgs, 'source')) === -1) {\n        continue;\n      }\n      var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n      if (generatedPosition) {\n        var ret = {\n          line: generatedPosition.line +\n            (section.generatedOffset.generatedLine - 1),\n          column: generatedPosition.column +\n            (section.generatedOffset.generatedLine === generatedPosition.line\n             ? section.generatedOffset.generatedColumn - 1\n             : 0)\n        };\n        return ret;\n      }\n    }\n\n    return {\n      line: null,\n      column: null\n    };\n  };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nIndexedSourceMapConsumer.prototype._parseMappings =\n  function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n    this.__generatedMappings = [];\n    this.__originalMappings = [];\n    for (var i = 0; i < this._sections.length; i++) {\n      var section = this._sections[i];\n      var sectionMappings = section.consumer._generatedMappings;\n      for (var j = 0; j < sectionMappings.length; j++) {\n        var mapping = sectionMappings[j];\n\n        var source = section.consumer._sources.at(mapping.source);\n        source = util.computeSourceURL(section.consumer.sourceRoot, source, this._sourceMapURL);\n        this._sources.add(source);\n        source = this._sources.indexOf(source);\n\n        var name = null;\n        if (mapping.name) {\n          name = section.consumer._names.at(mapping.name);\n          this._names.add(name);\n          name = this._names.indexOf(name);\n        }\n\n        // The mappings coming from the consumer for the section have\n        // generated positions relative to the start of the section, so we\n        // need to offset them to be relative to the start of the concatenated\n        // generated file.\n        var adjustedMapping = {\n          source: source,\n          generatedLine: mapping.generatedLine +\n            (section.generatedOffset.generatedLine - 1),\n          generatedColumn: mapping.generatedColumn +\n            (section.generatedOffset.generatedLine === mapping.generatedLine\n            ? section.generatedOffset.generatedColumn - 1\n            : 0),\n          originalLine: mapping.originalLine,\n          originalColumn: mapping.originalColumn,\n          name: name\n        };\n\n        this.__generatedMappings.push(adjustedMapping);\n        if (typeof adjustedMapping.originalLine === 'number') {\n          this.__originalMappings.push(adjustedMapping);\n        }\n      }\n    }\n\n    quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n    quickSort(this.__originalMappings, util.compareByOriginalPositions);\n  };\n\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nexports.GREATEST_LOWER_BOUND = 1;\nexports.LEAST_UPPER_BOUND = 2;\n\n/**\n * Recursive implementation of binary search.\n *\n * @param aLow Indices here and lower do not contain the needle.\n * @param aHigh Indices here and higher do not contain the needle.\n * @param aNeedle The element being searched for.\n * @param aHaystack The non-empty array being searched.\n * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n */\nfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\n  // This function terminates when one of the following is true:\n  //\n  //   1. We find the exact element we are looking for.\n  //\n  //   2. We did not find the exact element, but we can return the index of\n  //      the next-closest element.\n  //\n  //   3. We did not find the exact element, and there is no next-closest\n  //      element than the one we are searching for, so we return -1.\n  var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n  var cmp = aCompare(aNeedle, aHaystack[mid], true);\n  if (cmp === 0) {\n    // Found the element we are looking for.\n    return mid;\n  }\n  else if (cmp > 0) {\n    // Our needle is greater than aHaystack[mid].\n    if (aHigh - mid > 1) {\n      // The element is in the upper half.\n      return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\n    }\n\n    // The exact needle element was not found in this haystack. Determine if\n    // we are in termination case (3) or (2) and return the appropriate thing.\n    if (aBias == exports.LEAST_UPPER_BOUND) {\n      return aHigh < aHaystack.length ? aHigh : -1;\n    } else {\n      return mid;\n    }\n  }\n  else {\n    // Our needle is less than aHaystack[mid].\n    if (mid - aLow > 1) {\n      // The element is in the lower half.\n      return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\n    }\n\n    // we are in termination case (3) or (2) and return the appropriate thing.\n    if (aBias == exports.LEAST_UPPER_BOUND) {\n      return mid;\n    } else {\n      return aLow < 0 ? -1 : aLow;\n    }\n  }\n}\n\n/**\n * This is an implementation of binary search which will always try and return\n * the index of the closest element if there is no exact hit. This is because\n * mappings between original and generated line/col pairs are single points,\n * and there is an implicit region between each of them, so a miss just means\n * that you aren't on the very start of a region.\n *\n * @param aNeedle The element you are looking for.\n * @param aHaystack The array that is being searched.\n * @param aCompare A function which takes the needle and an element in the\n *     array and returns -1, 0, or 1 depending on whether the needle is less\n *     than, equal to, or greater than the element, respectively.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n *     'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n *     closest element that is smaller than or greater than the one we are\n *     searching for, respectively, if the exact element cannot be found.\n *     Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n */\nexports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n  if (aHaystack.length === 0) {\n    return -1;\n  }\n\n  var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n                              aCompare, aBias || exports.GREATEST_LOWER_BOUND);\n  if (index < 0) {\n    return -1;\n  }\n\n  // We have found either the exact element, or the next-closest element than\n  // the one we are searching for. However, there may be more than one such\n  // element. Make sure we always return the smallest of these.\n  while (index - 1 >= 0) {\n    if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {\n      break;\n    }\n    --index;\n  }\n\n  return index;\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n// It turns out that some (most?) JavaScript engines don't self-host\n// `Array.prototype.sort`. This makes sense because C++ will likely remain\n// faster than JS when doing raw CPU-intensive sorting. However, when using a\n// custom comparator function, calling back and forth between the VM's C++ and\n// JIT'd JS is rather slow *and* loses JIT type information, resulting in\n// worse generated code for the comparator function than would be optimal. In\n// fact, when sorting with a comparator, these costs outweigh the benefits of\n// sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n// a ~3500ms mean speed-up in `bench/bench.html`.\n\n/**\n * Swap the elements indexed by `x` and `y` in the array `ary`.\n *\n * @param {Array} ary\n *        The array.\n * @param {Number} x\n *        The index of the first item.\n * @param {Number} y\n *        The index of the second item.\n */\nfunction swap(ary, x, y) {\n  var temp = ary[x];\n  ary[x] = ary[y];\n  ary[y] = temp;\n}\n\n/**\n * Returns a random integer within the range `low .. high` inclusive.\n *\n * @param {Number} low\n *        The lower bound on the range.\n * @param {Number} high\n *        The upper bound on the range.\n */\nfunction randomIntInRange(low, high) {\n  return Math.round(low + (Math.random() * (high - low)));\n}\n\n/**\n * The Quick Sort algorithm.\n *\n * @param {Array} ary\n *        An array to sort.\n * @param {function} comparator\n *        Function to use to compare two items.\n * @param {Number} p\n *        Start index of the array\n * @param {Number} r\n *        End index of the array\n */\nfunction doQuickSort(ary, comparator, p, r) {\n  // If our lower bound is less than our upper bound, we (1) partition the\n  // array into two pieces and (2) recurse on each half. If it is not, this is\n  // the empty array and our base case.\n\n  if (p < r) {\n    // (1) Partitioning.\n    //\n    // The partitioning chooses a pivot between `p` and `r` and moves all\n    // elements that are less than or equal to the pivot to the before it, and\n    // all the elements that are greater than it after it. The effect is that\n    // once partition is done, the pivot is in the exact place it will be when\n    // the array is put in sorted order, and it will not need to be moved\n    // again. This runs in O(n) time.\n\n    // Always choose a random pivot so that an input array which is reverse\n    // sorted does not cause O(n^2) running time.\n    var pivotIndex = randomIntInRange(p, r);\n    var i = p - 1;\n\n    swap(ary, pivotIndex, r);\n    var pivot = ary[r];\n\n    // Immediately after `j` is incremented in this loop, the following hold\n    // true:\n    //\n    //   * Every element in `ary[p .. i]` is less than or equal to the pivot.\n    //\n    //   * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n    for (var j = p; j < r; j++) {\n      if (comparator(ary[j], pivot) <= 0) {\n        i += 1;\n        swap(ary, i, j);\n      }\n    }\n\n    swap(ary, i + 1, j);\n    var q = i + 1;\n\n    // (2) Recurse on each half.\n\n    doQuickSort(ary, comparator, p, q - 1);\n    doQuickSort(ary, comparator, q + 1, r);\n  }\n}\n\n/**\n * Sort the given array in-place with the given comparator function.\n *\n * @param {Array} ary\n *        An array to sort.\n * @param {function} comparator\n *        Function to use to compare two items.\n */\nexports.quickSort = function (ary, comparator) {\n  doQuickSort(ary, comparator, 0, ary.length - 1);\n};\n","/* -*- Mode: js; js-indent-level: 2; -*- */\n/*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar SourceMapGenerator = require('./source-map-generator').SourceMapGenerator;\nvar util = require('./util');\n\n// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n// operating systems these days (capturing the result).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n\n// Newline character code for charCodeAt() comparisons\nvar NEWLINE_CODE = 10;\n\n// Private symbol for identifying `SourceNode`s when multiple versions of\n// the source-map library are loaded. This MUST NOT CHANGE across\n// versions!\nvar isSourceNode = \"$$$isSourceNode$$$\";\n\n/**\n * SourceNodes provide a way to abstract over interpolating/concatenating\n * snippets of generated JavaScript source code while maintaining the line and\n * column information associated with the original source code.\n *\n * @param aLine The original line number.\n * @param aColumn The original column number.\n * @param aSource The original source's filename.\n * @param aChunks Optional. An array of strings which are snippets of\n *        generated JS, or other SourceNodes.\n * @param aName The original identifier.\n */\nfunction SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n  this.children = [];\n  this.sourceContents = {};\n  this.line = aLine == null ? null : aLine;\n  this.column = aColumn == null ? null : aColumn;\n  this.source = aSource == null ? null : aSource;\n  this.name = aName == null ? null : aName;\n  this[isSourceNode] = true;\n  if (aChunks != null) this.add(aChunks);\n}\n\n/**\n * Creates a SourceNode from generated code and a SourceMapConsumer.\n *\n * @param aGeneratedCode The generated code\n * @param aSourceMapConsumer The SourceMap for the generated code\n * @param aRelativePath Optional. The path that relative sources in the\n *        SourceMapConsumer should be relative to.\n */\nSourceNode.fromStringWithSourceMap =\n  function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n    // The SourceNode we want to fill with the generated code\n    // and the SourceMap\n    var node = new SourceNode();\n\n    // All even indices of this array are one line of the generated code,\n    // while all odd indices are the newlines between two adjacent lines\n    // (since `REGEX_NEWLINE` captures its match).\n    // Processed fragments are accessed by calling `shiftNextLine`.\n    var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n    var remainingLinesIndex = 0;\n    var shiftNextLine = function() {\n      var lineContents = getNextLine();\n      // The last line of a file might not have a newline.\n      var newLine = getNextLine() || \"\";\n      return lineContents + newLine;\n\n      function getNextLine() {\n        return remainingLinesIndex < remainingLines.length ?\n            remainingLines[remainingLinesIndex++] : undefined;\n      }\n    };\n\n    // We need to remember the position of \"remainingLines\"\n    var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n\n    // The generate SourceNodes we need a code range.\n    // To extract it current and last mapping is used.\n    // Here we store the last mapping.\n    var lastMapping = null;\n\n    aSourceMapConsumer.eachMapping(function (mapping) {\n      if (lastMapping !== null) {\n        // We add the code from \"lastMapping\" to \"mapping\":\n        // First check if there is a new line in between.\n        if (lastGeneratedLine < mapping.generatedLine) {\n          // Associate first line with \"lastMapping\"\n          addMappingWithCode(lastMapping, shiftNextLine());\n          lastGeneratedLine++;\n          lastGeneratedColumn = 0;\n          // The remaining code is added without mapping\n        } else {\n          // There is no new line in between.\n          // Associate the code between \"lastGeneratedColumn\" and\n          // \"mapping.generatedColumn\" with \"lastMapping\"\n          var nextLine = remainingLines[remainingLinesIndex] || '';\n          var code = nextLine.substr(0, mapping.generatedColumn -\n                                        lastGeneratedColumn);\n          remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n                                              lastGeneratedColumn);\n          lastGeneratedColumn = mapping.generatedColumn;\n          addMappingWithCode(lastMapping, code);\n          // No more remaining code, continue\n          lastMapping = mapping;\n          return;\n        }\n      }\n      // We add the generated code until the first mapping\n      // to the SourceNode without any mapping.\n      // Each line is added as separate string.\n      while (lastGeneratedLine < mapping.generatedLine) {\n        node.add(shiftNextLine());\n        lastGeneratedLine++;\n      }\n      if (lastGeneratedColumn < mapping.generatedColumn) {\n        var nextLine = remainingLines[remainingLinesIndex] || '';\n        node.add(nextLine.substr(0, mapping.generatedColumn));\n        remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n        lastGeneratedColumn = mapping.generatedColumn;\n      }\n      lastMapping = mapping;\n    }, this);\n    // We have processed all mappings.\n    if (remainingLinesIndex < remainingLines.length) {\n      if (lastMapping) {\n        // Associate the remaining code in the current line with \"lastMapping\"\n        addMappingWithCode(lastMapping, shiftNextLine());\n      }\n      // and add the remaining lines without any mapping\n      node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n    }\n\n    // Copy sourcesContent into SourceNode\n    aSourceMapConsumer.sources.forEach(function (sourceFile) {\n      var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n      if (content != null) {\n        if (aRelativePath != null) {\n          sourceFile = util.join(aRelativePath, sourceFile);\n        }\n        node.setSourceContent(sourceFile, content);\n      }\n    });\n\n    return node;\n\n    function addMappingWithCode(mapping, code) {\n      if (mapping === null || mapping.source === undefined) {\n        node.add(code);\n      } else {\n        var source = aRelativePath\n          ? util.join(aRelativePath, mapping.source)\n          : mapping.source;\n        node.add(new SourceNode(mapping.originalLine,\n                                mapping.originalColumn,\n                                source,\n                                code,\n                                mapping.name));\n      }\n    }\n  };\n\n/**\n * Add a chunk of generated JS to this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.add = function SourceNode_add(aChunk) {\n  if (Array.isArray(aChunk)) {\n    aChunk.forEach(function (chunk) {\n      this.add(chunk);\n    }, this);\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    if (aChunk) {\n      this.children.push(aChunk);\n    }\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n    );\n  }\n  return this;\n};\n\n/**\n * Add a chunk of generated JS to the beginning of this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n *        SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n  if (Array.isArray(aChunk)) {\n    for (var i = aChunk.length-1; i >= 0; i--) {\n      this.prepend(aChunk[i]);\n    }\n  }\n  else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n    this.children.unshift(aChunk);\n  }\n  else {\n    throw new TypeError(\n      \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n    );\n  }\n  return this;\n};\n\n/**\n * Walk over the tree of JS snippets in this node and its children. The\n * walking function is called once for each snippet of JS and is passed that\n * snippet and the its original associated source's line/column location.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walk = function SourceNode_walk(aFn) {\n  var chunk;\n  for (var i = 0, len = this.children.length; i < len; i++) {\n    chunk = this.children[i];\n    if (chunk[isSourceNode]) {\n      chunk.walk(aFn);\n    }\n    else {\n      if (chunk !== '') {\n        aFn(chunk, { source: this.source,\n                     line: this.line,\n                     column: this.column,\n                     name: this.name });\n      }\n    }\n  }\n};\n\n/**\n * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n * each of `this.children`.\n *\n * @param aSep The separator.\n */\nSourceNode.prototype.join = function SourceNode_join(aSep) {\n  var newChildren;\n  var i;\n  var len = this.children.length;\n  if (len > 0) {\n    newChildren = [];\n    for (i = 0; i < len-1; i++) {\n      newChildren.push(this.children[i]);\n      newChildren.push(aSep);\n    }\n    newChildren.push(this.children[i]);\n    this.children = newChildren;\n  }\n  return this;\n};\n\n/**\n * Call String.prototype.replace on the very right-most source snippet. Useful\n * for trimming whitespace from the end of a source node, etc.\n *\n * @param aPattern The pattern to replace.\n * @param aReplacement The thing to replace the pattern with.\n */\nSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n  var lastChild = this.children[this.children.length - 1];\n  if (lastChild[isSourceNode]) {\n    lastChild.replaceRight(aPattern, aReplacement);\n  }\n  else if (typeof lastChild === 'string') {\n    this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n  }\n  else {\n    this.children.push(''.replace(aPattern, aReplacement));\n  }\n  return this;\n};\n\n/**\n * Set the source content for a source file. This will be added to the SourceMapGenerator\n * in the sourcesContent field.\n *\n * @param aSourceFile The filename of the source file\n * @param aSourceContent The content of the source file\n */\nSourceNode.prototype.setSourceContent =\n  function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n    this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n  };\n\n/**\n * Walk over the tree of SourceNodes. The walking function is called for each\n * source file content and is passed the filename and source content.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walkSourceContents =\n  function SourceNode_walkSourceContents(aFn) {\n    for (var i = 0, len = this.children.length; i < len; i++) {\n      if (this.children[i][isSourceNode]) {\n        this.children[i].walkSourceContents(aFn);\n      }\n    }\n\n    var sources = Object.keys(this.sourceContents);\n    for (var i = 0, len = sources.length; i < len; i++) {\n      aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n    }\n  };\n\n/**\n * Return the string representation of this source node. Walks over the tree\n * and concatenates all the various snippets together to one string.\n */\nSourceNode.prototype.toString = function SourceNode_toString() {\n  var str = \"\";\n  this.walk(function (chunk) {\n    str += chunk;\n  });\n  return str;\n};\n\n/**\n * Returns the string representation of this source node along with a source\n * map.\n */\nSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n  var generated = {\n    code: \"\",\n    line: 1,\n    column: 0\n  };\n  var map = new SourceMapGenerator(aArgs);\n  var sourceMappingActive = false;\n  var lastOriginalSource = null;\n  var lastOriginalLine = null;\n  var lastOriginalColumn = null;\n  var lastOriginalName = null;\n  this.walk(function (chunk, original) {\n    generated.code += chunk;\n    if (original.source !== null\n        && original.line !== null\n        && original.column !== null) {\n      if(lastOriginalSource !== original.source\n         || lastOriginalLine !== original.line\n         || lastOriginalColumn !== original.column\n         || lastOriginalName !== original.name) {\n        map.addMapping({\n          source: original.source,\n          original: {\n            line: original.line,\n            column: original.column\n          },\n          generated: {\n            line: generated.line,\n            column: generated.column\n          },\n          name: original.name\n        });\n      }\n      lastOriginalSource = original.source;\n      lastOriginalLine = original.line;\n      lastOriginalColumn = original.column;\n      lastOriginalName = original.name;\n      sourceMappingActive = true;\n    } else if (sourceMappingActive) {\n      map.addMapping({\n        generated: {\n          line: generated.line,\n          column: generated.column\n        }\n      });\n      lastOriginalSource = null;\n      sourceMappingActive = false;\n    }\n    for (var idx = 0, length = chunk.length; idx < length; idx++) {\n      if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n        generated.line++;\n        generated.column = 0;\n        // Mappings end at eol\n        if (idx + 1 === length) {\n          lastOriginalSource = null;\n          sourceMappingActive = false;\n        } else if (sourceMappingActive) {\n          map.addMapping({\n            source: original.source,\n            original: {\n              line: original.line,\n              column: original.column\n            },\n            generated: {\n              line: generated.line,\n              column: generated.column\n            },\n            name: original.name\n          });\n        }\n      } else {\n        generated.column++;\n      }\n    }\n  });\n  this.walkSourceContents(function (sourceFile, sourceContent) {\n    map.setSourceContent(sourceFile, sourceContent);\n  });\n\n  return { code: generated.code, map: map };\n};\n\nexports.SourceNode = SourceNode;\n","// @flow\nimport type { TokContext } from \"./context\";\n// ## Token types\n\n// The assignment of fine-grained, information-carrying type objects\n// allows the tokenizer to store the information it has about a\n// token in a way that is very cheap for the parser to look up.\n\n// All token type variables start with an underscore, to make them\n// easy to recognize.\n\n// The `beforeExpr` property is used to disambiguate between 1) binary\n// expression (<) and JSX Tag start (<name>); 2) object literal and JSX\n// texts. It is set on the `updateContext` function in the JSX plugin.\n\n// The `startsExpr` property is used to determine whether an expression\n// may be the “argument” subexpression of a `yield` expression or\n// `yield` statement. It is set on all token types that may be at the\n// start of a subexpression.\n\n// `isLoop` marks a keyword as starting a loop, which is important\n// to know when parsing a label, in order to allow or disallow\n// continue jumps to that label.\n\nconst beforeExpr = true;\nconst startsExpr = true;\nconst isLoop = true;\nconst isAssign = true;\nconst prefix = true;\nconst postfix = true;\n\ntype TokenOptions = {\n  keyword?: string,\n  beforeExpr?: boolean,\n  startsExpr?: boolean,\n  rightAssociative?: boolean,\n  isLoop?: boolean,\n  isAssign?: boolean,\n  prefix?: boolean,\n  postfix?: boolean,\n  binop?: ?number,\n};\n\nexport class TokenType {\n  label: string;\n  keyword: ?string;\n  beforeExpr: boolean;\n  startsExpr: boolean;\n  rightAssociative: boolean;\n  isLoop: boolean;\n  isAssign: boolean;\n  prefix: boolean;\n  postfix: boolean;\n  binop: ?number;\n  updateContext: ?(context: Array<TokContext>) => void;\n\n  constructor(label: string, conf: TokenOptions = {}) {\n    this.label = label;\n    this.keyword = conf.keyword;\n    this.beforeExpr = !!conf.beforeExpr;\n    this.startsExpr = !!conf.startsExpr;\n    this.rightAssociative = !!conf.rightAssociative;\n    this.isLoop = !!conf.isLoop;\n    this.isAssign = !!conf.isAssign;\n    this.prefix = !!conf.prefix;\n    this.postfix = !!conf.postfix;\n    this.binop = conf.binop != null ? conf.binop : null;\n    this.updateContext = null;\n  }\n}\n\nexport const keywords = new Map<string, TokenType>();\n\nfunction createKeyword(name: string, options: TokenOptions = {}): TokenType {\n  options.keyword = name;\n  const token = new TokenType(name, options);\n  keywords.set(name, token);\n  return token;\n}\n\nfunction createBinop(name: string, binop: number) {\n  return new TokenType(name, { beforeExpr, binop });\n}\n\nexport const types: { [name: string]: TokenType } = {\n  num: new TokenType(\"num\", { startsExpr }),\n  bigint: new TokenType(\"bigint\", { startsExpr }),\n  decimal: new TokenType(\"decimal\", { startsExpr }),\n  regexp: new TokenType(\"regexp\", { startsExpr }),\n  string: new TokenType(\"string\", { startsExpr }),\n  name: new TokenType(\"name\", { startsExpr }),\n  privateName: new TokenType(\"#name\", { startsExpr }),\n  eof: new TokenType(\"eof\"),\n\n  // Punctuation token types.\n  bracketL: new TokenType(\"[\", { beforeExpr, startsExpr }),\n  bracketHashL: new TokenType(\"#[\", { beforeExpr, startsExpr }),\n  bracketBarL: new TokenType(\"[|\", { beforeExpr, startsExpr }),\n  bracketR: new TokenType(\"]\"),\n  bracketBarR: new TokenType(\"|]\"),\n  braceL: new TokenType(\"{\", { beforeExpr, startsExpr }),\n  braceBarL: new TokenType(\"{|\", { beforeExpr, startsExpr }),\n  braceHashL: new TokenType(\"#{\", { beforeExpr, startsExpr }),\n  braceR: new TokenType(\"}\", { beforeExpr }),\n  braceBarR: new TokenType(\"|}\"),\n  parenL: new TokenType(\"(\", { beforeExpr, startsExpr }),\n  parenR: new TokenType(\")\"),\n  comma: new TokenType(\",\", { beforeExpr }),\n  semi: new TokenType(\";\", { beforeExpr }),\n  colon: new TokenType(\":\", { beforeExpr }),\n  doubleColon: new TokenType(\"::\", { beforeExpr }),\n  dot: new TokenType(\".\"),\n  question: new TokenType(\"?\", { beforeExpr }),\n  questionDot: new TokenType(\"?.\"),\n  arrow: new TokenType(\"=>\", { beforeExpr }),\n  template: new TokenType(\"template\"),\n  ellipsis: new TokenType(\"...\", { beforeExpr }),\n  backQuote: new TokenType(\"`\", { startsExpr }),\n  dollarBraceL: new TokenType(\"${\", { beforeExpr, startsExpr }),\n  at: new TokenType(\"@\"),\n  hash: new TokenType(\"#\", { startsExpr }),\n\n  // Special hashbang token.\n  interpreterDirective: new TokenType(\"#!...\"),\n\n  // Operators. These carry several kinds of properties to help the\n  // parser use them properly (the presence of these properties is\n  // what categorizes them as operators).\n  //\n  // `binop`, when present, specifies that this operator is a binary\n  // operator, and will refer to its precedence.\n  //\n  // `prefix` and `postfix` mark the operator as a prefix or postfix\n  // unary operator.\n  //\n  // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as\n  // binary operators with a very low precedence, that should result\n  // in AssignmentExpression nodes.\n\n  eq: new TokenType(\"=\", { beforeExpr, isAssign }),\n  assign: new TokenType(\"_=\", { beforeExpr, isAssign }),\n  slashAssign: new TokenType(\"_=\", { beforeExpr, isAssign }),\n  incDec: new TokenType(\"++/--\", { prefix, postfix, startsExpr }),\n  bang: new TokenType(\"!\", { beforeExpr, prefix, startsExpr }),\n  tilde: new TokenType(\"~\", { beforeExpr, prefix, startsExpr }),\n  pipeline: createBinop(\"|>\", 0),\n  nullishCoalescing: createBinop(\"??\", 1),\n  logicalOR: createBinop(\"||\", 1),\n  logicalAND: createBinop(\"&&\", 2),\n  bitwiseOR: createBinop(\"|\", 3),\n  bitwiseXOR: createBinop(\"^\", 4),\n  bitwiseAND: createBinop(\"&\", 5),\n  equality: createBinop(\"==/!=/===/!==\", 6),\n  relational: createBinop(\"</>/<=/>=\", 7),\n  bitShift: createBinop(\"<</>>/>>>\", 8),\n  plusMin: new TokenType(\"+/-\", { beforeExpr, binop: 9, prefix, startsExpr }),\n  // startsExpr: required by v8intrinsic plugin\n  modulo: new TokenType(\"%\", { beforeExpr, binop: 10, startsExpr }),\n  // unset `beforeExpr` as it can be `function *`\n  star: new TokenType(\"*\", { binop: 10 }),\n  slash: createBinop(\"/\", 10),\n  exponent: new TokenType(\"**\", {\n    beforeExpr,\n    binop: 11,\n    rightAssociative: true,\n  }),\n\n  // Keywords\n  // Don't forget to update packages/babel-helper-validator-identifier/src/keyword.js\n  // when new keywords are added\n  _break: createKeyword(\"break\"),\n  _case: createKeyword(\"case\", { beforeExpr }),\n  _catch: createKeyword(\"catch\"),\n  _continue: createKeyword(\"continue\"),\n  _debugger: createKeyword(\"debugger\"),\n  _default: createKeyword(\"default\", { beforeExpr }),\n  _do: createKeyword(\"do\", { isLoop, beforeExpr }),\n  _else: createKeyword(\"else\", { beforeExpr }),\n  _finally: createKeyword(\"finally\"),\n  _for: createKeyword(\"for\", { isLoop }),\n  _function: createKeyword(\"function\", { startsExpr }),\n  _if: createKeyword(\"if\"),\n  _return: createKeyword(\"return\", { beforeExpr }),\n  _switch: createKeyword(\"switch\"),\n  _throw: createKeyword(\"throw\", { beforeExpr, prefix, startsExpr }),\n  _try: createKeyword(\"try\"),\n  _var: createKeyword(\"var\"),\n  _const: createKeyword(\"const\"),\n  _while: createKeyword(\"while\", { isLoop }),\n  _with: createKeyword(\"with\"),\n  _new: createKeyword(\"new\", { beforeExpr, startsExpr }),\n  _this: createKeyword(\"this\", { startsExpr }),\n  _super: createKeyword(\"super\", { startsExpr }),\n  _class: createKeyword(\"class\", { startsExpr }),\n  _extends: createKeyword(\"extends\", { beforeExpr }),\n  _export: createKeyword(\"export\"),\n  _import: createKeyword(\"import\", { startsExpr }),\n  _null: createKeyword(\"null\", { startsExpr }),\n  _true: createKeyword(\"true\", { startsExpr }),\n  _false: createKeyword(\"false\", { startsExpr }),\n  _in: createKeyword(\"in\", { beforeExpr, binop: 7 }),\n  _instanceof: createKeyword(\"instanceof\", { beforeExpr, binop: 7 }),\n  _typeof: createKeyword(\"typeof\", { beforeExpr, prefix, startsExpr }),\n  _void: createKeyword(\"void\", { beforeExpr, prefix, startsExpr }),\n  _delete: createKeyword(\"delete\", { beforeExpr, prefix, startsExpr }),\n};\n","// @flow\n\nimport * as charCodes from \"charcodes\";\n\n// Matches a whole line break (where CRLF is considered a single\n// line break). Used to count lines.\nexport const lineBreak = /\\r\\n?|[\\n\\u2028\\u2029]/;\nexport const lineBreakG = new RegExp(lineBreak.source, \"g\");\n\n// https://tc39.github.io/ecma262/#sec-line-terminators\nexport function isNewLine(code: number): boolean {\n  switch (code) {\n    case charCodes.lineFeed:\n    case charCodes.carriageReturn:\n    case charCodes.lineSeparator:\n    case charCodes.paragraphSeparator:\n      return true;\n\n    default:\n      return false;\n  }\n}\n\nexport const skipWhiteSpace = /(?:\\s|\\/\\/.*|\\/\\*[^]*?\\*\\/)*/g;\n\n// https://tc39.github.io/ecma262/#sec-white-space\nexport function isWhitespace(code: number): boolean {\n  switch (code) {\n    case 0x0009: // CHARACTER TABULATION\n    case 0x000b: // LINE TABULATION\n    case 0x000c: // FORM FEED\n    case charCodes.space:\n    case charCodes.nonBreakingSpace:\n    case charCodes.oghamSpaceMark:\n    case 0x2000: // EN QUAD\n    case 0x2001: // EM QUAD\n    case 0x2002: // EN SPACE\n    case 0x2003: // EM SPACE\n    case 0x2004: // THREE-PER-EM SPACE\n    case 0x2005: // FOUR-PER-EM SPACE\n    case 0x2006: // SIX-PER-EM SPACE\n    case 0x2007: // FIGURE SPACE\n    case 0x2008: // PUNCTUATION SPACE\n    case 0x2009: // THIN SPACE\n    case 0x200a: // HAIR SPACE\n    case 0x202f: // NARROW NO-BREAK SPACE\n    case 0x205f: // MEDIUM MATHEMATICAL SPACE\n    case 0x3000: // IDEOGRAPHIC SPACE\n    case 0xfeff: // ZERO WIDTH NO-BREAK SPACE\n      return true;\n\n    default:\n      return false;\n  }\n}\n","// @flow\n\nimport { lineBreakG } from \"./whitespace\";\n\nexport type Pos = {\n  start: number,\n};\n\n// These are used when `options.locations` is on, for the\n// `startLoc` and `endLoc` properties.\n\nexport class Position {\n  line: number;\n  column: number;\n\n  constructor(line: number, col: number) {\n    this.line = line;\n    this.column = col;\n  }\n}\n\nexport class SourceLocation {\n  start: Position;\n  end: Position;\n  filename: string;\n  identifierName: ?string;\n\n  constructor(start: Position, end?: Position) {\n    this.start = start;\n    // $FlowIgnore (may start as null, but initialized later)\n    this.end = end;\n  }\n}\n\n// The `getLineInfo` function is mostly useful when the\n// `locations` option is off (for performance reasons) and you\n// want to find the line/column position for a given character\n// offset. `input` should be the code string that the offset refers\n// into.\n\nexport function getLineInfo(input: string, offset: number): Position {\n  let line = 1;\n  let lineStart = 0;\n  let match;\n  lineBreakG.lastIndex = 0;\n  while ((match = lineBreakG.exec(input)) && match.index < offset) {\n    line++;\n    lineStart = lineBreakG.lastIndex;\n  }\n\n  return new Position(line, offset - lineStart);\n}\n","// @flow\n\n/**\n * Based on the comment attachment algorithm used in espree and estraverse.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\n *   notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n *   notice, this list of conditions and the following disclaimer in the\n *   documentation and/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nimport BaseParser from \"./base\";\nimport type { Comment, Node } from \"../types\";\n\nfunction last<T>(stack: $ReadOnlyArray<T>): T {\n  return stack[stack.length - 1];\n}\n\nexport default class CommentsParser extends BaseParser {\n  addComment(comment: Comment): void {\n    if (this.filename) comment.loc.filename = this.filename;\n    this.state.trailingComments.push(comment);\n    this.state.leadingComments.push(comment);\n  }\n\n  adjustCommentsAfterTrailingComma(\n    node: Node,\n    elements: (Node | null)[],\n    // When the current node is followed by a token which hasn't a respective AST node, we\n    // need to take all the trailing comments to prevent them from being attached to an\n    // unrelated node. e.g. in\n    //     var { x } /* cmt */ = { y }\n    // we don't want /* cmt */ to be attached to { y }.\n    // On the other hand, in\n    //     fn(x) [new line] /* cmt */ [new line] y\n    // /* cmt */ is both a trailing comment of fn(x) and a leading comment of y\n    takeAllComments?: boolean,\n  ) {\n    if (this.state.leadingComments.length === 0) {\n      return;\n    }\n\n    let lastElement = null;\n    let i = elements.length;\n    while (lastElement === null && i > 0) {\n      lastElement = elements[--i];\n    }\n    if (lastElement === null) {\n      return;\n    }\n\n    for (let j = 0; j < this.state.leadingComments.length; j++) {\n      if (\n        this.state.leadingComments[j].end < this.state.commentPreviousNode.end\n      ) {\n        this.state.leadingComments.splice(j, 1);\n        j--;\n      }\n    }\n\n    const newTrailingComments = [];\n    for (let i = 0; i < this.state.leadingComments.length; i++) {\n      const leadingComment = this.state.leadingComments[i];\n      if (leadingComment.end < node.end) {\n        newTrailingComments.push(leadingComment);\n\n        // Perf: we don't need to splice if we are going to reset the array anyway\n        if (!takeAllComments) {\n          this.state.leadingComments.splice(i, 1);\n          i--;\n        }\n      } else {\n        if (node.trailingComments === undefined) {\n          node.trailingComments = [];\n        }\n        node.trailingComments.push(leadingComment);\n      }\n    }\n    if (takeAllComments) this.state.leadingComments = [];\n\n    if (newTrailingComments.length > 0) {\n      lastElement.trailingComments = newTrailingComments;\n    } else if (lastElement.trailingComments !== undefined) {\n      lastElement.trailingComments = [];\n    }\n  }\n\n  processComment(node: Node): void {\n    if (node.type === \"Program\" && node.body.length > 0) return;\n\n    const stack = this.state.commentStack;\n\n    let firstChild, lastChild, trailingComments, i, j;\n\n    if (this.state.trailingComments.length > 0) {\n      // If the first comment in trailingComments comes after the\n      // current node, then we're good - all comments in the array will\n      // come after the node and so it's safe to add them as official\n      // trailingComments.\n      if (this.state.trailingComments[0].start >= node.end) {\n        trailingComments = this.state.trailingComments;\n        this.state.trailingComments = [];\n      } else {\n        // Otherwise, if the first comment doesn't come after the\n        // current node, that means we have a mix of leading and trailing\n        // comments in the array and that leadingComments contains the\n        // same items as trailingComments. Reset trailingComments to\n        // zero items and we'll handle this by evaluating leadingComments\n        // later.\n        this.state.trailingComments.length = 0;\n      }\n    } else if (stack.length > 0) {\n      const lastInStack = last(stack);\n      if (\n        lastInStack.trailingComments &&\n        lastInStack.trailingComments[0].start >= node.end\n      ) {\n        trailingComments = lastInStack.trailingComments;\n        delete lastInStack.trailingComments;\n      }\n    }\n\n    // Eating the stack.\n    if (stack.length > 0 && last(stack).start >= node.start) {\n      firstChild = stack.pop();\n    }\n\n    while (stack.length > 0 && last(stack).start >= node.start) {\n      lastChild = stack.pop();\n    }\n\n    if (!lastChild && firstChild) lastChild = firstChild;\n\n    // Adjust comments that follow a trailing comma on the last element in a\n    // comma separated list of nodes to be the trailing comments on the last\n    // element\n    if (firstChild) {\n      switch (node.type) {\n        case \"ObjectExpression\":\n          this.adjustCommentsAfterTrailingComma(node, node.properties);\n          break;\n        case \"ObjectPattern\":\n          this.adjustCommentsAfterTrailingComma(node, node.properties, true);\n          break;\n        case \"CallExpression\":\n          this.adjustCommentsAfterTrailingComma(node, node.arguments);\n          break;\n        case \"ArrayExpression\":\n          this.adjustCommentsAfterTrailingComma(node, node.elements);\n          break;\n        case \"ArrayPattern\":\n          this.adjustCommentsAfterTrailingComma(node, node.elements, true);\n          break;\n      }\n    } else if (\n      this.state.commentPreviousNode &&\n      ((this.state.commentPreviousNode.type === \"ImportSpecifier\" &&\n        node.type !== \"ImportSpecifier\") ||\n        (this.state.commentPreviousNode.type === \"ExportSpecifier\" &&\n          node.type !== \"ExportSpecifier\"))\n    ) {\n      this.adjustCommentsAfterTrailingComma(node, [\n        this.state.commentPreviousNode,\n      ]);\n    }\n\n    if (lastChild) {\n      if (lastChild.leadingComments) {\n        if (\n          lastChild !== node &&\n          lastChild.leadingComments.length > 0 &&\n          last(lastChild.leadingComments).end <= node.start\n        ) {\n          node.leadingComments = lastChild.leadingComments;\n          delete lastChild.leadingComments;\n        } else {\n          // A leading comment for an anonymous class had been stolen by its first ClassMethod,\n          // so this takes back the leading comment.\n          // See also: https://github.com/eslint/espree/issues/158\n          for (i = lastChild.leadingComments.length - 2; i >= 0; --i) {\n            if (lastChild.leadingComments[i].end <= node.start) {\n              node.leadingComments = lastChild.leadingComments.splice(0, i + 1);\n              break;\n            }\n          }\n        }\n      }\n    } else if (this.state.leadingComments.length > 0) {\n      if (last(this.state.leadingComments).end <= node.start) {\n        if (this.state.commentPreviousNode) {\n          for (j = 0; j < this.state.leadingComments.length; j++) {\n            if (\n              this.state.leadingComments[j].end <\n              this.state.commentPreviousNode.end\n            ) {\n              this.state.leadingComments.splice(j, 1);\n              j--;\n            }\n          }\n        }\n        if (this.state.leadingComments.length > 0) {\n          node.leadingComments = this.state.leadingComments;\n          this.state.leadingComments = [];\n        }\n      } else {\n        // https://github.com/eslint/espree/issues/2\n        //\n        // In special cases, such as return (without a value) and\n        // debugger, all comments will end up as leadingComments and\n        // will otherwise be eliminated. This step runs when the\n        // commentStack is empty and there are comments left\n        // in leadingComments.\n        //\n        // This loop figures out the stopping point between the actual\n        // leading and trailing comments by finding the location of the\n        // first comment that comes after the given node.\n        for (i = 0; i < this.state.leadingComments.length; i++) {\n          if (this.state.leadingComments[i].end > node.start) {\n            break;\n          }\n        }\n\n        // Split the array based on the location of the first comment\n        // that comes after the node. Keep in mind that this could\n        // result in an empty array, and if so, the array must be\n        // deleted.\n        const leadingComments = this.state.leadingComments.slice(0, i);\n\n        if (leadingComments.length) {\n          node.leadingComments = leadingComments;\n        }\n\n        // Similarly, trailing comments are attached later. The variable\n        // must be reset to null if there are no trailing comments.\n        trailingComments = this.state.leadingComments.slice(i);\n        if (trailingComments.length === 0) {\n          trailingComments = null;\n        }\n      }\n    }\n\n    this.state.commentPreviousNode = node;\n\n    if (trailingComments) {\n      if (\n        trailingComments.length &&\n        trailingComments[0].start >= node.start &&\n        last(trailingComments).end <= node.end\n      ) {\n        node.innerComments = trailingComments;\n      } else {\n        // TrailingComments maybe contain innerComments\n        const firstTrailingCommentIndex = trailingComments.findIndex(\n          comment => comment.end >= node.end,\n        );\n\n        if (firstTrailingCommentIndex > 0) {\n          node.innerComments = trailingComments.slice(\n            0,\n            firstTrailingCommentIndex,\n          );\n          node.trailingComments = trailingComments.slice(\n            firstTrailingCommentIndex,\n          );\n        } else {\n          node.trailingComments = trailingComments;\n        }\n      }\n    }\n\n    stack.push(node);\n  }\n}\n","// @flow\n\nexport const ErrorCodes = Object.freeze({\n  SyntaxError: \"BABEL_PARSER_SYNTAX_ERROR\",\n  SourceTypeModuleError: \"BABEL_PARSER_SOURCETYPE_MODULE_REQUIRED\",\n});\n\nexport type ErrorCode = $Values<typeof ErrorCodes>;\n","// @flow\n\nimport { makeErrorTemplates, ErrorCodes } from \"./error\";\n\n/* eslint sort-keys: \"error\" */\n\n/**\n * @module parser/error-message\n */\n\n// The Errors key follows https://cs.chromium.org/chromium/src/v8/src/common/message-template.h unless it does not exist\nexport const ErrorMessages = makeErrorTemplates(\n  {\n    AccessorIsGenerator: \"A %0ter cannot be a generator.\",\n    ArgumentsInClass:\n      \"'arguments' is only allowed in functions and class methods.\",\n    AsyncFunctionInSingleStatementContext:\n      \"Async functions can only be declared at the top level or inside a block.\",\n    AwaitBindingIdentifier:\n      \"Can not use 'await' as identifier inside an async function.\",\n    AwaitBindingIdentifierInStaticBlock:\n      \"Can not use 'await' as identifier inside a static block.\",\n    AwaitExpressionFormalParameter:\n      \"'await' is not allowed in async function parameters.\",\n    AwaitNotInAsyncContext:\n      \"'await' is only allowed within async functions and at the top levels of modules.\",\n    AwaitNotInAsyncFunction: \"'await' is only allowed within async functions.\",\n    BadGetterArity: \"A 'get' accesor must not have any formal parameters.\",\n    BadSetterArity: \"A 'set' accesor must have exactly one formal parameter.\",\n    BadSetterRestParameter:\n      \"A 'set' accesor function argument must not be a rest parameter.\",\n    ConstructorClassField: \"Classes may not have a field named 'constructor'.\",\n    ConstructorClassPrivateField:\n      \"Classes may not have a private field named '#constructor'.\",\n    ConstructorIsAccessor: \"Class constructor may not be an accessor.\",\n    ConstructorIsAsync: \"Constructor can't be an async function.\",\n    ConstructorIsGenerator: \"Constructor can't be a generator.\",\n    DeclarationMissingInitializer: \"'%0' require an initialization value.\",\n    DecoratorBeforeExport:\n      \"Decorators must be placed *before* the 'export' keyword. You can set the 'decoratorsBeforeExport' option to false to use the 'export @decorator class {}' syntax.\",\n    DecoratorConstructor:\n      \"Decorators can't be used with a constructor. Did you mean '@dec class { ... }'?\",\n    DecoratorExportClass:\n      \"Using the export keyword between a decorator and a class is not allowed. Please use `export @dec class` instead.\",\n    DecoratorSemicolon: \"Decorators must not be followed by a semicolon.\",\n    DecoratorStaticBlock: \"Decorators can't be used with a static block.\",\n    DeletePrivateField: \"Deleting a private field is not allowed.\",\n    DestructureNamedImport:\n      \"ES2015 named imports do not destructure. Use another statement for destructuring after the import.\",\n    DuplicateConstructor: \"Duplicate constructor in the same class.\",\n    DuplicateDefaultExport: \"Only one default export allowed per module.\",\n    DuplicateExport:\n      \"`%0` has already been exported. Exported identifiers must be unique.\",\n    DuplicateProto: \"Redefinition of __proto__ property.\",\n    DuplicateRegExpFlags: \"Duplicate regular expression flag.\",\n    ElementAfterRest: \"Rest element must be last element.\",\n    EscapedCharNotAnIdentifier: \"Invalid Unicode escape.\",\n    ExportBindingIsString:\n      \"A string literal cannot be used as an exported binding without `from`.\\n- Did you mean `export { '%0' as '%1' } from 'some-module'`?\",\n    ExportDefaultFromAsIdentifier:\n      \"'from' is not allowed as an identifier after 'export default'.\",\n    ForInOfLoopInitializer:\n      \"'%0' loop variable declaration may not have an initializer.\",\n    ForOfAsync: \"The left-hand side of a for-of loop may not be 'async'.\",\n    ForOfLet: \"The left-hand side of a for-of loop may not start with 'let'.\",\n    GeneratorInSingleStatementContext:\n      \"Generators can only be declared at the top level or inside a block.\",\n    IllegalBreakContinue: \"Unsyntactic %0.\",\n    IllegalLanguageModeDirective:\n      \"Illegal 'use strict' directive in function with non-simple parameter list.\",\n    IllegalReturn: \"'return' outside of function.\",\n    ImportBindingIsString:\n      'A string literal cannot be used as an imported binding.\\n- Did you mean `import { \"%0\" as foo }`?',\n    ImportCallArgumentTrailingComma:\n      \"Trailing comma is disallowed inside import(...) arguments.\",\n    ImportCallArity: \"`import()` requires exactly %0.\",\n    ImportCallNotNewExpression: \"Cannot use new with import(...).\",\n    ImportCallSpreadArgument: \"`...` is not allowed in `import()`.\",\n    InvalidBigIntLiteral: \"Invalid BigIntLiteral.\",\n    InvalidCodePoint: \"Code point out of bounds.\",\n    InvalidDecimal: \"Invalid decimal.\",\n    InvalidDigit: \"Expected number in radix %0.\",\n    InvalidEscapeSequence: \"Bad character escape sequence.\",\n    InvalidEscapeSequenceTemplate: \"Invalid escape sequence in template.\",\n    InvalidEscapedReservedWord: \"Escape sequence in keyword %0.\",\n    InvalidIdentifier: \"Invalid identifier %0.\",\n    InvalidLhs: \"Invalid left-hand side in %0.\",\n    InvalidLhsBinding: \"Binding invalid left-hand side in %0.\",\n    InvalidNumber: \"Invalid number.\",\n    InvalidOrMissingExponent:\n      \"Floating-point numbers require a valid exponent after the 'e'.\",\n    InvalidOrUnexpectedToken: \"Unexpected character '%0'.\",\n    InvalidParenthesizedAssignment: \"Invalid parenthesized assignment pattern.\",\n    InvalidPrivateFieldResolution: \"Private name #%0 is not defined.\",\n    InvalidPropertyBindingPattern: \"Binding member expression.\",\n    InvalidRecordProperty:\n      \"Only properties and spread elements are allowed in record definitions.\",\n    InvalidRestAssignmentPattern: \"Invalid rest operator's argument.\",\n    LabelRedeclaration: \"Label '%0' is already declared.\",\n    LetInLexicalBinding:\n      \"'let' is not allowed to be used as a name in 'let' or 'const' declarations.\",\n    LineTerminatorBeforeArrow: \"No line break is allowed before '=>'.\",\n    MalformedRegExpFlags: \"Invalid regular expression flag.\",\n    MissingClassName: \"A class name is required.\",\n    MissingEqInAssignment:\n      \"Only '=' operator can be used for specifying default value.\",\n    MissingSemicolon: \"Missing semicolon.\",\n    MissingUnicodeEscape: \"Expecting Unicode escape sequence \\\\uXXXX.\",\n    MixingCoalesceWithLogical:\n      \"Nullish coalescing operator(??) requires parens when mixing with logical operators.\",\n    ModuleAttributeDifferentFromType:\n      \"The only accepted module attribute is `type`.\",\n    ModuleAttributeInvalidValue:\n      \"Only string literals are allowed as module attribute values.\",\n    ModuleAttributesWithDuplicateKeys:\n      'Duplicate key \"%0\" is not allowed in module attributes.',\n    ModuleExportNameHasLoneSurrogate:\n      \"An export name cannot include a lone surrogate, found '\\\\u%0'.\",\n    ModuleExportUndefined: \"Export '%0' is not defined.\",\n    MultipleDefaultsInSwitch: \"Multiple default clauses.\",\n    NewlineAfterThrow: \"Illegal newline after throw.\",\n    NoCatchOrFinally: \"Missing catch or finally clause.\",\n    NumberIdentifier: \"Identifier directly after number.\",\n    NumericSeparatorInEscapeSequence:\n      \"Numeric separators are not allowed inside unicode escape sequences or hex escape sequences.\",\n    ObsoleteAwaitStar:\n      \"'await*' has been removed from the async functions proposal. Use Promise.all() instead.\",\n    OptionalChainingNoNew:\n      \"Constructors in/after an Optional Chain are not allowed.\",\n    OptionalChainingNoTemplate:\n      \"Tagged Template Literals are not allowed in optionalChain.\",\n    OverrideOnConstructor:\n      \"'override' modifier cannot appear on a constructor declaration.\",\n    ParamDupe: \"Argument name clash.\",\n    PatternHasAccessor: \"Object pattern can't contain getter or setter.\",\n    PatternHasMethod: \"Object pattern can't contain methods.\",\n    PipelineBodyNoArrow:\n      'Unexpected arrow \"=>\" after pipeline body; arrow function in pipeline body must be parenthesized.',\n    PipelineBodySequenceExpression:\n      \"Pipeline body may not be a comma-separated sequence expression.\",\n    PipelineHeadSequenceExpression:\n      \"Pipeline head should not be a comma-separated sequence expression.\",\n    PipelineTopicUnused:\n      \"Pipeline is in topic style but does not use topic reference.\",\n    PrimaryTopicNotAllowed:\n      \"Topic reference was used in a lexical context without topic binding.\",\n    PrimaryTopicRequiresSmartPipeline:\n      \"Primary Topic Reference found but pipelineOperator not passed 'smart' for 'proposal' option.\",\n    PrivateInExpectedIn:\n      \"Private names are only allowed in property accesses (`obj.#%0`) or in `in` expressions (`#%0 in obj`).\",\n    PrivateNameRedeclaration: \"Duplicate private name #%0.\",\n    RecordExpressionBarIncorrectEndSyntaxType:\n      \"Record expressions ending with '|}' are only allowed when the 'syntaxType' option of the 'recordAndTuple' plugin is set to 'bar'.\",\n    RecordExpressionBarIncorrectStartSyntaxType:\n      \"Record expressions starting with '{|' are only allowed when the 'syntaxType' option of the 'recordAndTuple' plugin is set to 'bar'.\",\n    RecordExpressionHashIncorrectStartSyntaxType:\n      \"Record expressions starting with '#{' are only allowed when the 'syntaxType' option of the 'recordAndTuple' plugin is set to 'hash'.\",\n    RecordNoProto: \"'__proto__' is not allowed in Record expressions.\",\n    RestTrailingComma: \"Unexpected trailing comma after rest element.\",\n    SloppyFunction:\n      \"In non-strict mode code, functions can only be declared at top level, inside a block, or as the body of an if statement.\",\n    StaticPrototype: \"Classes may not have static property named prototype.\",\n    StrictDelete: \"Deleting local variable in strict mode.\",\n    StrictEvalArguments: \"Assigning to '%0' in strict mode.\",\n    StrictEvalArgumentsBinding: \"Binding '%0' in strict mode.\",\n    StrictFunction:\n      \"In strict mode code, functions can only be declared at top level or inside a block.\",\n    StrictNumericEscape:\n      \"The only valid numeric escape in strict mode is '\\\\0'.\",\n    StrictOctalLiteral: \"Legacy octal literals are not allowed in strict mode.\",\n    StrictWith: \"'with' in strict mode.\",\n    SuperNotAllowed:\n      \"`super()` is only valid inside a class constructor of a subclass. Maybe a typo in the method name ('constructor') or not extending another class?\",\n    SuperPrivateField: \"Private fields can't be accessed on super.\",\n    TrailingDecorator: \"Decorators must be attached to a class element.\",\n    TupleExpressionBarIncorrectEndSyntaxType:\n      \"Tuple expressions ending with '|]' are only allowed when the 'syntaxType' option of the 'recordAndTuple' plugin is set to 'bar'.\",\n    TupleExpressionBarIncorrectStartSyntaxType:\n      \"Tuple expressions starting with '[|' are only allowed when the 'syntaxType' option of the 'recordAndTuple' plugin is set to 'bar'.\",\n    TupleExpressionHashIncorrectStartSyntaxType:\n      \"Tuple expressions starting with '#[' are only allowed when the 'syntaxType' option of the 'recordAndTuple' plugin is set to 'hash'.\",\n    UnexpectedArgumentPlaceholder: \"Unexpected argument placeholder.\",\n    UnexpectedAwaitAfterPipelineBody:\n      'Unexpected \"await\" after pipeline body; await must have parentheses in minimal proposal.',\n    UnexpectedDigitAfterHash: \"Unexpected digit after hash token.\",\n    UnexpectedImportExport:\n      \"'import' and 'export' may only appear at the top level.\",\n    UnexpectedKeyword: \"Unexpected keyword '%0'.\",\n    UnexpectedLeadingDecorator:\n      \"Leading decorators must be attached to a class declaration.\",\n    UnexpectedLexicalDeclaration:\n      \"Lexical declaration cannot appear in a single-statement context.\",\n    UnexpectedNewTarget:\n      \"`new.target` can only be used in functions or class properties.\",\n    UnexpectedNumericSeparator:\n      \"A numeric separator is only allowed between two digits.\",\n    UnexpectedPrivateField:\n      \"Private names can only be used as the name of a class element (i.e. class C { #p = 42; #m() {} } )\\n or a property of member expression (i.e. this.#p).\",\n    UnexpectedReservedWord: \"Unexpected reserved word '%0'.\",\n    UnexpectedSuper: \"'super' is only allowed in object methods and classes.\",\n    UnexpectedToken: \"Unexpected token '%0'.\",\n    UnexpectedTokenUnaryExponentiation:\n      \"Illegal expression. Wrap left hand side or entire exponentiation in parentheses.\",\n    UnsupportedBind: \"Binding should be performed on object property.\",\n    UnsupportedDecoratorExport:\n      \"A decorated export must export a class declaration.\",\n    UnsupportedDefaultExport:\n      \"Only expressions, functions or classes are allowed as the `default` export.\",\n    UnsupportedImport:\n      \"`import` can only be used in `import()` or `import.meta`.\",\n    UnsupportedMetaProperty: \"The only valid meta property for %0 is %0.%1.\",\n    UnsupportedParameterDecorator:\n      \"Decorators cannot be used to decorate parameters.\",\n    UnsupportedPropertyDecorator:\n      \"Decorators cannot be used to decorate object literal properties.\",\n    UnsupportedSuper:\n      \"'super' can only be used with function calls (i.e. super()) or in property accesses (i.e. super.prop or super[prop]).\",\n    UnterminatedComment: \"Unterminated comment.\",\n    UnterminatedRegExp: \"Unterminated regular expression.\",\n    UnterminatedString: \"Unterminated string constant.\",\n    UnterminatedTemplate: \"Unterminated template.\",\n    VarRedeclaration: \"Identifier '%0' has already been declared.\",\n    YieldBindingIdentifier:\n      \"Can not use 'yield' as identifier inside a generator.\",\n    YieldInParameter: \"Yield expression is not allowed in formal parameters.\",\n    ZeroDigitNumericSeparator:\n      \"Numeric separator can not be used after leading 0.\",\n  },\n  /* code */ ErrorCodes.SyntaxError,\n);\n\nexport const SourceTypeModuleErrorMessages = makeErrorTemplates(\n  {\n    ImportMetaOutsideModule: `import.meta may appear only with 'sourceType: \"module\"'`,\n    ImportOutsideModule: `'import' and 'export' may appear only with 'sourceType: \"module\"'`,\n  },\n  /* code */ ErrorCodes.SourceTypeModuleError,\n);\n","// @flow\n/* eslint sort-keys: \"error\" */\nimport { getLineInfo, type Position } from \"../util/location\";\nimport CommentsParser from \"./comments\";\nimport { type ErrorCode, ErrorCodes } from \"./error-codes\";\n\n// This function is used to raise exceptions on parse errors. It\n// takes an offset integer (into the current `input`) to indicate\n// the location of the error, attaches the position to the end\n// of the error message, and then raises a `SyntaxError` with that\n// message.\n\ntype ErrorContext = {\n  pos: number,\n  loc: Position,\n  missingPlugin?: Array<string>,\n  code?: string,\n  reasonCode?: String,\n};\nexport type ParsingError = SyntaxError & ErrorContext;\n\nexport type ErrorTemplate = {\n  code: ErrorCode,\n  template: string,\n  reasonCode: string,\n};\nexport type ErrorTemplates = {\n  [key: string]: ErrorTemplate,\n};\n\nexport function makeErrorTemplates(\n  messages: {\n    [key: string]: string,\n  },\n  code: ErrorCode,\n): ErrorTemplates {\n  const templates: ErrorTemplates = {};\n  Object.keys(messages).forEach(reasonCode => {\n    templates[reasonCode] = Object.freeze({\n      code,\n      reasonCode,\n      template: messages[reasonCode],\n    });\n  });\n  return Object.freeze(templates);\n}\n\nexport { ErrorCodes };\nexport {\n  ErrorMessages as Errors,\n  SourceTypeModuleErrorMessages as SourceTypeModuleErrors,\n} from \"./error-message\";\n\nexport type raiseFunction = (number, ErrorTemplate, ...any) => void;\n\nexport default class ParserError extends CommentsParser {\n  // Forward-declaration: defined in tokenizer/index.js\n  /*::\n  +isLookahead: boolean;\n  */\n\n  getLocationForPosition(pos: number): Position {\n    let loc;\n    if (pos === this.state.start) loc = this.state.startLoc;\n    else if (pos === this.state.lastTokStart) loc = this.state.lastTokStartLoc;\n    else if (pos === this.state.end) loc = this.state.endLoc;\n    else if (pos === this.state.lastTokEnd) loc = this.state.lastTokEndLoc;\n    else loc = getLineInfo(this.input, pos);\n\n    return loc;\n  }\n\n  raise(\n    pos: number,\n    { code, reasonCode, template }: ErrorTemplate,\n    ...params: any\n  ): Error | empty {\n    return this.raiseWithData(pos, { code, reasonCode }, template, ...params);\n  }\n\n  /**\n   * Raise a parsing error on given position pos. If errorRecovery is true,\n   * it will first search current errors and overwrite the error thrown on the exact\n   * position before with the new error message. If errorRecovery is false, it\n   * fallbacks to `raise`.\n   *\n   * @param {number} pos\n   * @param {string} errorTemplate\n   * @param {...any} params\n   * @returns {(Error | empty)}\n   * @memberof ParserError\n   */\n  raiseOverwrite(\n    pos: number,\n    { code, template }: ErrorTemplate,\n    ...params: any\n  ): Error | empty {\n    const loc = this.getLocationForPosition(pos);\n    const message =\n      template.replace(/%(\\d+)/g, (_, i: number) => params[i]) +\n      ` (${loc.line}:${loc.column})`;\n    if (this.options.errorRecovery) {\n      const errors = this.state.errors;\n      for (let i = errors.length - 1; i >= 0; i--) {\n        const error = errors[i];\n        if (error.pos === pos) {\n          return Object.assign(error, { message });\n        } else if (error.pos < pos) {\n          break;\n        }\n      }\n    }\n    return this._raise({ code, loc, pos }, message);\n  }\n\n  raiseWithData(\n    pos: number,\n    data?: {\n      missingPlugin?: Array<string>,\n      code?: string,\n    },\n    errorTemplate: string,\n    ...params: any\n  ): Error | empty {\n    const loc = this.getLocationForPosition(pos);\n    const message =\n      errorTemplate.replace(/%(\\d+)/g, (_, i: number) => params[i]) +\n      ` (${loc.line}:${loc.column})`;\n    return this._raise(Object.assign(({ loc, pos }: Object), data), message);\n  }\n\n  _raise(errorContext: ErrorContext, message: string): Error | empty {\n    // $FlowIgnore\n    const err: SyntaxError & ErrorContext = new SyntaxError(message);\n    Object.assign(err, errorContext);\n    if (this.options.errorRecovery) {\n      if (!this.isLookahead) this.state.errors.push(err);\n      return err;\n    } else {\n      throw err;\n    }\n  }\n}\n","// @flow\n\n// The token context is used to track whether `}` matches\n// a template quasi `${` or other tokens containing `{`:\n// namely tt.braceL `{` and tt.braceHashL `#{`\n\nimport { types as tt } from \"./types\";\n\nexport class TokContext {\n  constructor(token: string, preserveSpace?: boolean) {\n    this.token = token;\n    this.preserveSpace = !!preserveSpace;\n  }\n\n  token: string;\n  preserveSpace: boolean;\n}\n\nexport const types: {\n  [key: string]: TokContext,\n} = {\n  brace: new TokContext(\"{\"),\n  templateQuasi: new TokContext(\"${\"),\n  template: new TokContext(\"`\", true),\n};\n\n// Token-specific context update code\n// Note that we should avoid accessing `this.prodParam` in context update,\n// because it is executed immediately when last token is consumed, which may be\n// before `this.prodParam` is updated. e.g.\n// ```\n// function *g() { () => yield / 2 }\n// ```\n// When `=>` is eaten, the context update of `yield` is executed, however,\n// `this.prodParam` still has `[Yield]` production because it is not yet updated\n\ntt.braceR.updateContext = context => {\n  if (context.length > 1) {\n    context.pop();\n  }\n};\n\n// we don't need to update context for tt.braceBarL because we do not pop context for tt.braceBarR\ntt.braceL.updateContext = tt.braceHashL.updateContext = context => {\n  context.push(types.brace);\n};\n\ntt.dollarBraceL.updateContext = context => {\n  context.push(types.templateQuasi);\n};\n\ntt.backQuote.updateContext = context => {\n  if (context[context.length - 1] === types.template) {\n    context.pop();\n  } else {\n    context.push(types.template);\n  }\n};\n","import * as charCodes from \"charcodes\";\n\n// ## Character categories\n\n// Big ugly regular expressions that match characters in the\n// whitespace, identifier, and identifier-start categories. These\n// are only applied when a character is found to actually have a\n// code point between 0x80 and 0xffff.\n// Generated by `scripts/generate-identifier-regex.js`.\n\n/* prettier-ignore */\nlet nonASCIIidentifierStartChars = \"\\xaa\\xb5\\xba\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\u02c1\\u02c6-\\u02d1\\u02e0-\\u02e4\\u02ec\\u02ee\\u0370-\\u0374\\u0376\\u0377\\u037a-\\u037d\\u037f\\u0386\\u0388-\\u038a\\u038c\\u038e-\\u03a1\\u03a3-\\u03f5\\u03f7-\\u0481\\u048a-\\u052f\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05d0-\\u05ea\\u05ef-\\u05f2\\u0620-\\u064a\\u066e\\u066f\\u0671-\\u06d3\\u06d5\\u06e5\\u06e6\\u06ee\\u06ef\\u06fa-\\u06fc\\u06ff\\u0710\\u0712-\\u072f\\u074d-\\u07a5\\u07b1\\u07ca-\\u07ea\\u07f4\\u07f5\\u07fa\\u0800-\\u0815\\u081a\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086a\\u08a0-\\u08b4\\u08b6-\\u08c7\\u0904-\\u0939\\u093d\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098c\\u098f\\u0990\\u0993-\\u09a8\\u09aa-\\u09b0\\u09b2\\u09b6-\\u09b9\\u09bd\\u09ce\\u09dc\\u09dd\\u09df-\\u09e1\\u09f0\\u09f1\\u09fc\\u0a05-\\u0a0a\\u0a0f\\u0a10\\u0a13-\\u0a28\\u0a2a-\\u0a30\\u0a32\\u0a33\\u0a35\\u0a36\\u0a38\\u0a39\\u0a59-\\u0a5c\\u0a5e\\u0a72-\\u0a74\\u0a85-\\u0a8d\\u0a8f-\\u0a91\\u0a93-\\u0aa8\\u0aaa-\\u0ab0\\u0ab2\\u0ab3\\u0ab5-\\u0ab9\\u0abd\\u0ad0\\u0ae0\\u0ae1\\u0af9\\u0b05-\\u0b0c\\u0b0f\\u0b10\\u0b13-\\u0b28\\u0b2a-\\u0b30\\u0b32\\u0b33\\u0b35-\\u0b39\\u0b3d\\u0b5c\\u0b5d\\u0b5f-\\u0b61\\u0b71\\u0b83\\u0b85-\\u0b8a\\u0b8e-\\u0b90\\u0b92-\\u0b95\\u0b99\\u0b9a\\u0b9c\\u0b9e\\u0b9f\\u0ba3\\u0ba4\\u0ba8-\\u0baa\\u0bae-\\u0bb9\\u0bd0\\u0c05-\\u0c0c\\u0c0e-\\u0c10\\u0c12-\\u0c28\\u0c2a-\\u0c39\\u0c3d\\u0c58-\\u0c5a\\u0c60\\u0c61\\u0c80\\u0c85-\\u0c8c\\u0c8e-\\u0c90\\u0c92-\\u0ca8\\u0caa-\\u0cb3\\u0cb5-\\u0cb9\\u0cbd\\u0cde\\u0ce0\\u0ce1\\u0cf1\\u0cf2\\u0d04-\\u0d0c\\u0d0e-\\u0d10\\u0d12-\\u0d3a\\u0d3d\\u0d4e\\u0d54-\\u0d56\\u0d5f-\\u0d61\\u0d7a-\\u0d7f\\u0d85-\\u0d96\\u0d9a-\\u0db1\\u0db3-\\u0dbb\\u0dbd\\u0dc0-\\u0dc6\\u0e01-\\u0e30\\u0e32\\u0e33\\u0e40-\\u0e46\\u0e81\\u0e82\\u0e84\\u0e86-\\u0e8a\\u0e8c-\\u0ea3\\u0ea5\\u0ea7-\\u0eb0\\u0eb2\\u0eb3\\u0ebd\\u0ec0-\\u0ec4\\u0ec6\\u0edc-\\u0edf\\u0f00\\u0f40-\\u0f47\\u0f49-\\u0f6c\\u0f88-\\u0f8c\\u1000-\\u102a\\u103f\\u1050-\\u1055\\u105a-\\u105d\\u1061\\u1065\\u1066\\u106e-\\u1070\\u1075-\\u1081\\u108e\\u10a0-\\u10c5\\u10c7\\u10cd\\u10d0-\\u10fa\\u10fc-\\u1248\\u124a-\\u124d\\u1250-\\u1256\\u1258\\u125a-\\u125d\\u1260-\\u1288\\u128a-\\u128d\\u1290-\\u12b0\\u12b2-\\u12b5\\u12b8-\\u12be\\u12c0\\u12c2-\\u12c5\\u12c8-\\u12d6\\u12d8-\\u1310\\u1312-\\u1315\\u1318-\\u135a\\u1380-\\u138f\\u13a0-\\u13f5\\u13f8-\\u13fd\\u1401-\\u166c\\u166f-\\u167f\\u1681-\\u169a\\u16a0-\\u16ea\\u16ee-\\u16f8\\u1700-\\u170c\\u170e-\\u1711\\u1720-\\u1731\\u1740-\\u1751\\u1760-\\u176c\\u176e-\\u1770\\u1780-\\u17b3\\u17d7\\u17dc\\u1820-\\u1878\\u1880-\\u18a8\\u18aa\\u18b0-\\u18f5\\u1900-\\u191e\\u1950-\\u196d\\u1970-\\u1974\\u1980-\\u19ab\\u19b0-\\u19c9\\u1a00-\\u1a16\\u1a20-\\u1a54\\u1aa7\\u1b05-\\u1b33\\u1b45-\\u1b4b\\u1b83-\\u1ba0\\u1bae\\u1baf\\u1bba-\\u1be5\\u1c00-\\u1c23\\u1c4d-\\u1c4f\\u1c5a-\\u1c7d\\u1c80-\\u1c88\\u1c90-\\u1cba\\u1cbd-\\u1cbf\\u1ce9-\\u1cec\\u1cee-\\u1cf3\\u1cf5\\u1cf6\\u1cfa\\u1d00-\\u1dbf\\u1e00-\\u1f15\\u1f18-\\u1f1d\\u1f20-\\u1f45\\u1f48-\\u1f4d\\u1f50-\\u1f57\\u1f59\\u1f5b\\u1f5d\\u1f5f-\\u1f7d\\u1f80-\\u1fb4\\u1fb6-\\u1fbc\\u1fbe\\u1fc2-\\u1fc4\\u1fc6-\\u1fcc\\u1fd0-\\u1fd3\\u1fd6-\\u1fdb\\u1fe0-\\u1fec\\u1ff2-\\u1ff4\\u1ff6-\\u1ffc\\u2071\\u207f\\u2090-\\u209c\\u2102\\u2107\\u210a-\\u2113\\u2115\\u2118-\\u211d\\u2124\\u2126\\u2128\\u212a-\\u2139\\u213c-\\u213f\\u2145-\\u2149\\u214e\\u2160-\\u2188\\u2c00-\\u2c2e\\u2c30-\\u2c5e\\u2c60-\\u2ce4\\u2ceb-\\u2cee\\u2cf2\\u2cf3\\u2d00-\\u2d25\\u2d27\\u2d2d\\u2d30-\\u2d67\\u2d6f\\u2d80-\\u2d96\\u2da0-\\u2da6\\u2da8-\\u2dae\\u2db0-\\u2db6\\u2db8-\\u2dbe\\u2dc0-\\u2dc6\\u2dc8-\\u2dce\\u2dd0-\\u2dd6\\u2dd8-\\u2dde\\u3005-\\u3007\\u3021-\\u3029\\u3031-\\u3035\\u3038-\\u303c\\u3041-\\u3096\\u309b-\\u309f\\u30a1-\\u30fa\\u30fc-\\u30ff\\u3105-\\u312f\\u3131-\\u318e\\u31a0-\\u31bf\\u31f0-\\u31ff\\u3400-\\u4dbf\\u4e00-\\u9ffc\\ua000-\\ua48c\\ua4d0-\\ua4fd\\ua500-\\ua60c\\ua610-\\ua61f\\ua62a\\ua62b\\ua640-\\ua66e\\ua67f-\\ua69d\\ua6a0-\\ua6ef\\ua717-\\ua71f\\ua722-\\ua788\\ua78b-\\ua7bf\\ua7c2-\\ua7ca\\ua7f5-\\ua801\\ua803-\\ua805\\ua807-\\ua80a\\ua80c-\\ua822\\ua840-\\ua873\\ua882-\\ua8b3\\ua8f2-\\ua8f7\\ua8fb\\ua8fd\\ua8fe\\ua90a-\\ua925\\ua930-\\ua946\\ua960-\\ua97c\\ua984-\\ua9b2\\ua9cf\\ua9e0-\\ua9e4\\ua9e6-\\ua9ef\\ua9fa-\\ua9fe\\uaa00-\\uaa28\\uaa40-\\uaa42\\uaa44-\\uaa4b\\uaa60-\\uaa76\\uaa7a\\uaa7e-\\uaaaf\\uaab1\\uaab5\\uaab6\\uaab9-\\uaabd\\uaac0\\uaac2\\uaadb-\\uaadd\\uaae0-\\uaaea\\uaaf2-\\uaaf4\\uab01-\\uab06\\uab09-\\uab0e\\uab11-\\uab16\\uab20-\\uab26\\uab28-\\uab2e\\uab30-\\uab5a\\uab5c-\\uab69\\uab70-\\uabe2\\uac00-\\ud7a3\\ud7b0-\\ud7c6\\ud7cb-\\ud7fb\\uf900-\\ufa6d\\ufa70-\\ufad9\\ufb00-\\ufb06\\ufb13-\\ufb17\\ufb1d\\ufb1f-\\ufb28\\ufb2a-\\ufb36\\ufb38-\\ufb3c\\ufb3e\\ufb40\\ufb41\\ufb43\\ufb44\\ufb46-\\ufbb1\\ufbd3-\\ufd3d\\ufd50-\\ufd8f\\ufd92-\\ufdc7\\ufdf0-\\ufdfb\\ufe70-\\ufe74\\ufe76-\\ufefc\\uff21-\\uff3a\\uff41-\\uff5a\\uff66-\\uffbe\\uffc2-\\uffc7\\uffca-\\uffcf\\uffd2-\\uffd7\\uffda-\\uffdc\";\n/* prettier-ignore */\nlet nonASCIIidentifierChars = \"\\u200c\\u200d\\xb7\\u0300-\\u036f\\u0387\\u0483-\\u0487\\u0591-\\u05bd\\u05bf\\u05c1\\u05c2\\u05c4\\u05c5\\u05c7\\u0610-\\u061a\\u064b-\\u0669\\u0670\\u06d6-\\u06dc\\u06df-\\u06e4\\u06e7\\u06e8\\u06ea-\\u06ed\\u06f0-\\u06f9\\u0711\\u0730-\\u074a\\u07a6-\\u07b0\\u07c0-\\u07c9\\u07eb-\\u07f3\\u07fd\\u0816-\\u0819\\u081b-\\u0823\\u0825-\\u0827\\u0829-\\u082d\\u0859-\\u085b\\u08d3-\\u08e1\\u08e3-\\u0903\\u093a-\\u093c\\u093e-\\u094f\\u0951-\\u0957\\u0962\\u0963\\u0966-\\u096f\\u0981-\\u0983\\u09bc\\u09be-\\u09c4\\u09c7\\u09c8\\u09cb-\\u09cd\\u09d7\\u09e2\\u09e3\\u09e6-\\u09ef\\u09fe\\u0a01-\\u0a03\\u0a3c\\u0a3e-\\u0a42\\u0a47\\u0a48\\u0a4b-\\u0a4d\\u0a51\\u0a66-\\u0a71\\u0a75\\u0a81-\\u0a83\\u0abc\\u0abe-\\u0ac5\\u0ac7-\\u0ac9\\u0acb-\\u0acd\\u0ae2\\u0ae3\\u0ae6-\\u0aef\\u0afa-\\u0aff\\u0b01-\\u0b03\\u0b3c\\u0b3e-\\u0b44\\u0b47\\u0b48\\u0b4b-\\u0b4d\\u0b55-\\u0b57\\u0b62\\u0b63\\u0b66-\\u0b6f\\u0b82\\u0bbe-\\u0bc2\\u0bc6-\\u0bc8\\u0bca-\\u0bcd\\u0bd7\\u0be6-\\u0bef\\u0c00-\\u0c04\\u0c3e-\\u0c44\\u0c46-\\u0c48\\u0c4a-\\u0c4d\\u0c55\\u0c56\\u0c62\\u0c63\\u0c66-\\u0c6f\\u0c81-\\u0c83\\u0cbc\\u0cbe-\\u0cc4\\u0cc6-\\u0cc8\\u0cca-\\u0ccd\\u0cd5\\u0cd6\\u0ce2\\u0ce3\\u0ce6-\\u0cef\\u0d00-\\u0d03\\u0d3b\\u0d3c\\u0d3e-\\u0d44\\u0d46-\\u0d48\\u0d4a-\\u0d4d\\u0d57\\u0d62\\u0d63\\u0d66-\\u0d6f\\u0d81-\\u0d83\\u0dca\\u0dcf-\\u0dd4\\u0dd6\\u0dd8-\\u0ddf\\u0de6-\\u0def\\u0df2\\u0df3\\u0e31\\u0e34-\\u0e3a\\u0e47-\\u0e4e\\u0e50-\\u0e59\\u0eb1\\u0eb4-\\u0ebc\\u0ec8-\\u0ecd\\u0ed0-\\u0ed9\\u0f18\\u0f19\\u0f20-\\u0f29\\u0f35\\u0f37\\u0f39\\u0f3e\\u0f3f\\u0f71-\\u0f84\\u0f86\\u0f87\\u0f8d-\\u0f97\\u0f99-\\u0fbc\\u0fc6\\u102b-\\u103e\\u1040-\\u1049\\u1056-\\u1059\\u105e-\\u1060\\u1062-\\u1064\\u1067-\\u106d\\u1071-\\u1074\\u1082-\\u108d\\u108f-\\u109d\\u135d-\\u135f\\u1369-\\u1371\\u1712-\\u1714\\u1732-\\u1734\\u1752\\u1753\\u1772\\u1773\\u17b4-\\u17d3\\u17dd\\u17e0-\\u17e9\\u180b-\\u180d\\u1810-\\u1819\\u18a9\\u1920-\\u192b\\u1930-\\u193b\\u1946-\\u194f\\u19d0-\\u19da\\u1a17-\\u1a1b\\u1a55-\\u1a5e\\u1a60-\\u1a7c\\u1a7f-\\u1a89\\u1a90-\\u1a99\\u1ab0-\\u1abd\\u1abf\\u1ac0\\u1b00-\\u1b04\\u1b34-\\u1b44\\u1b50-\\u1b59\\u1b6b-\\u1b73\\u1b80-\\u1b82\\u1ba1-\\u1bad\\u1bb0-\\u1bb9\\u1be6-\\u1bf3\\u1c24-\\u1c37\\u1c40-\\u1c49\\u1c50-\\u1c59\\u1cd0-\\u1cd2\\u1cd4-\\u1ce8\\u1ced\\u1cf4\\u1cf7-\\u1cf9\\u1dc0-\\u1df9\\u1dfb-\\u1dff\\u203f\\u2040\\u2054\\u20d0-\\u20dc\\u20e1\\u20e5-\\u20f0\\u2cef-\\u2cf1\\u2d7f\\u2de0-\\u2dff\\u302a-\\u302f\\u3099\\u309a\\ua620-\\ua629\\ua66f\\ua674-\\ua67d\\ua69e\\ua69f\\ua6f0\\ua6f1\\ua802\\ua806\\ua80b\\ua823-\\ua827\\ua82c\\ua880\\ua881\\ua8b4-\\ua8c5\\ua8d0-\\ua8d9\\ua8e0-\\ua8f1\\ua8ff-\\ua909\\ua926-\\ua92d\\ua947-\\ua953\\ua980-\\ua983\\ua9b3-\\ua9c0\\ua9d0-\\ua9d9\\ua9e5\\ua9f0-\\ua9f9\\uaa29-\\uaa36\\uaa43\\uaa4c\\uaa4d\\uaa50-\\uaa59\\uaa7b-\\uaa7d\\uaab0\\uaab2-\\uaab4\\uaab7\\uaab8\\uaabe\\uaabf\\uaac1\\uaaeb-\\uaaef\\uaaf5\\uaaf6\\uabe3-\\uabea\\uabec\\uabed\\uabf0-\\uabf9\\ufb1e\\ufe00-\\ufe0f\\ufe20-\\ufe2f\\ufe33\\ufe34\\ufe4d-\\ufe4f\\uff10-\\uff19\\uff3f\";\n\nconst nonASCIIidentifierStart = new RegExp(\n  \"[\" + nonASCIIidentifierStartChars + \"]\",\n);\nconst nonASCIIidentifier = new RegExp(\n  \"[\" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + \"]\",\n);\n\nnonASCIIidentifierStartChars = nonASCIIidentifierChars = null;\n\n// These are a run-length and offset-encoded representation of the\n// >0xffff code points that are a valid part of identifiers. The\n// offset starts at 0x10000, and each pair of numbers represents an\n// offset to the next range, and then a size of the range. They were\n// generated by `scripts/generate-identifier-regex.js`.\n/* prettier-ignore */\n/* prettier-ignore */\nconst astralIdentifierStartCodes = [0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,14,29,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,157,310,10,21,11,7,153,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,28,43,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,14,35,349,41,7,1,79,28,11,0,9,21,107,20,28,22,13,52,76,44,33,24,27,35,30,0,3,0,9,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,21,2,31,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,14,0,72,26,230,43,117,63,32,7,3,0,3,7,2,1,2,23,16,0,2,0,95,7,3,38,17,0,2,0,29,0,11,39,8,0,22,0,12,45,20,0,35,56,264,8,2,36,18,0,50,29,113,6,2,1,2,37,22,0,26,5,2,1,2,31,15,0,328,18,190,0,80,921,103,110,18,195,2749,1070,4050,582,8634,568,8,30,114,29,19,47,17,3,32,20,6,18,689,63,129,74,6,0,67,12,65,1,2,0,29,6135,9,1237,43,8,8952,286,50,2,18,3,9,395,2309,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,2357,44,11,6,17,0,370,43,1301,196,60,67,8,0,1205,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42717,35,4148,12,221,3,5761,15,7472,3104,541,1507,4938];\n/* prettier-ignore */\nconst astralIdentifierCodes = [509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,574,3,9,9,370,1,154,10,176,2,54,14,32,9,16,3,46,10,54,9,7,2,37,13,2,9,6,1,45,0,13,2,49,13,9,3,2,11,83,11,7,0,161,11,6,9,7,3,56,1,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,5,0,82,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,243,14,166,9,71,5,2,1,3,3,2,0,2,1,13,9,120,6,3,6,4,0,29,9,41,6,2,3,9,0,10,10,47,15,406,7,2,7,17,9,57,21,2,13,123,5,4,0,2,1,2,6,2,0,9,9,49,4,2,1,2,4,9,9,330,3,19306,9,135,4,60,6,26,9,1014,0,2,54,8,3,82,0,12,1,19628,1,5319,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,262,6,10,9,419,13,1495,6,110,6,6,9,4759,9,787719,239];\n\n// This has a complexity linear to the value of the code. The\n// assumption is that looking up astral identifier characters is\n// rare.\nfunction isInAstralSet(code: number, set: readonly number[]): boolean {\n  let pos = 0x10000;\n  for (let i = 0, length = set.length; i < length; i += 2) {\n    pos += set[i];\n    if (pos > code) return false;\n\n    pos += set[i + 1];\n    if (pos >= code) return true;\n  }\n  return false;\n}\n\n// Test whether a given character code starts an identifier.\n\nexport function isIdentifierStart(code: number): boolean {\n  if (code < charCodes.uppercaseA) return code === charCodes.dollarSign;\n  if (code <= charCodes.uppercaseZ) return true;\n  if (code < charCodes.lowercaseA) return code === charCodes.underscore;\n  if (code <= charCodes.lowercaseZ) return true;\n  if (code <= 0xffff) {\n    return (\n      code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code))\n    );\n  }\n  return isInAstralSet(code, astralIdentifierStartCodes);\n}\n\n// Test whether a given character is part of an identifier.\n\nexport function isIdentifierChar(code: number): boolean {\n  if (code < charCodes.digit0) return code === charCodes.dollarSign;\n  if (code < charCodes.colon) return true;\n  if (code < charCodes.uppercaseA) return false;\n  if (code <= charCodes.uppercaseZ) return true;\n  if (code < charCodes.lowercaseA) return code === charCodes.underscore;\n  if (code <= charCodes.lowercaseZ) return true;\n  if (code <= 0xffff) {\n    return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code));\n  }\n  return (\n    isInAstralSet(code, astralIdentifierStartCodes) ||\n    isInAstralSet(code, astralIdentifierCodes)\n  );\n}\n\n// Test whether a given string is a valid identifier name\n\nexport function isIdentifierName(name: string): boolean {\n  let isFirst = true;\n  for (let i = 0; i < name.length; i++) {\n    // The implementation is based on\n    // https://source.chromium.org/chromium/chromium/src/+/master:v8/src/builtins/builtins-string-gen.cc;l=1455;drc=221e331b49dfefadbc6fa40b0c68e6f97606d0b3;bpv=0;bpt=1\n    // We reimplement `codePointAt` because `codePointAt` is a V8 builtin which is not inlined by TurboFan (as of M91)\n    // since `name` is mostly ASCII, an inlined `charCodeAt` wins here\n    let cp = name.charCodeAt(i);\n    if ((cp & 0xfc00) === 0xd800 && i + 1 < name.length) {\n      const trail = name.charCodeAt(++i);\n      if ((trail & 0xfc00) === 0xdc00) {\n        cp = 0x10000 + ((cp & 0x3ff) << 10) + (trail & 0x3ff);\n      }\n    }\n    if (isFirst) {\n      isFirst = false;\n      if (!isIdentifierStart(cp)) {\n        return false;\n      }\n    } else if (!isIdentifierChar(cp)) {\n      return false;\n    }\n  }\n  return !isFirst;\n}\n","const reservedWords = {\n  keyword: [\n    \"break\",\n    \"case\",\n    \"catch\",\n    \"continue\",\n    \"debugger\",\n    \"default\",\n    \"do\",\n    \"else\",\n    \"finally\",\n    \"for\",\n    \"function\",\n    \"if\",\n    \"return\",\n    \"switch\",\n    \"throw\",\n    \"try\",\n    \"var\",\n    \"const\",\n    \"while\",\n    \"with\",\n    \"new\",\n    \"this\",\n    \"super\",\n    \"class\",\n    \"extends\",\n    \"export\",\n    \"import\",\n    \"null\",\n    \"true\",\n    \"false\",\n    \"in\",\n    \"instanceof\",\n    \"typeof\",\n    \"void\",\n    \"delete\",\n  ],\n  strict: [\n    \"implements\",\n    \"interface\",\n    \"let\",\n    \"package\",\n    \"private\",\n    \"protected\",\n    \"public\",\n    \"static\",\n    \"yield\",\n  ],\n  strictBind: [\"eval\", \"arguments\"],\n};\nconst keywords = new Set(reservedWords.keyword);\nconst reservedWordsStrictSet = new Set(reservedWords.strict);\nconst reservedWordsStrictBindSet = new Set(reservedWords.strictBind);\n\n/**\n * Checks if word is a reserved word in non-strict mode\n */\nexport function isReservedWord(word: string, inModule: boolean): boolean {\n  return (inModule && word === \"await\") || word === \"enum\";\n}\n\n/**\n * Checks if word is a reserved word in non-binding strict mode\n *\n * Includes non-strict reserved words\n */\nexport function isStrictReservedWord(word: string, inModule: boolean): boolean {\n  return isReservedWord(word, inModule) || reservedWordsStrictSet.has(word);\n}\n\n/**\n * Checks if word is a reserved word in binding strict mode, but it is allowed as\n * a normal identifier.\n */\nexport function isStrictBindOnlyReservedWord(word: string): boolean {\n  return reservedWordsStrictBindSet.has(word);\n}\n\n/**\n * Checks if word is a reserved word in binding strict mode\n *\n * Includes non-strict reserved words and non-binding strict reserved words\n */\nexport function isStrictBindReservedWord(\n  word: string,\n  inModule: boolean,\n): boolean {\n  return (\n    isStrictReservedWord(word, inModule) || isStrictBindOnlyReservedWord(word)\n  );\n}\n\nexport function isKeyword(word: string): boolean {\n  return keywords.has(word);\n}\n","/* eslint max-len: 0 */\n\n// @flow\n\nimport * as charCodes from \"charcodes\";\n\nexport {\n  isIdentifierStart,\n  isIdentifierChar,\n  isReservedWord,\n  isStrictBindOnlyReservedWord,\n  isStrictBindReservedWord,\n  isStrictReservedWord,\n  isKeyword,\n} from \"@babel/helper-validator-identifier\";\n\nexport const keywordRelationalOperator = /^in(stanceof)?$/;\n\n// Test whether a current state character code and next character code is @\n\nexport function isIteratorStart(current: number, next: number): boolean {\n  return current === charCodes.atSign && next === charCodes.atSign;\n}\n\n// This is the comprehensive set of JavaScript reserved words\n// If a word is in this set, it could be a reserved word,\n// depending on sourceType/strictMode/binding info. In other words\n// if a word is not in this set, it is not a reserved word under\n// any circumstance.\nconst reservedWordLikeSet = new Set([\n  \"break\",\n  \"case\",\n  \"catch\",\n  \"continue\",\n  \"debugger\",\n  \"default\",\n  \"do\",\n  \"else\",\n  \"finally\",\n  \"for\",\n  \"function\",\n  \"if\",\n  \"return\",\n  \"switch\",\n  \"throw\",\n  \"try\",\n  \"var\",\n  \"const\",\n  \"while\",\n  \"with\",\n  \"new\",\n  \"this\",\n  \"super\",\n  \"class\",\n  \"extends\",\n  \"export\",\n  \"import\",\n  \"null\",\n  \"true\",\n  \"false\",\n  \"in\",\n  \"instanceof\",\n  \"typeof\",\n  \"void\",\n  \"delete\",\n  // strict\n  \"implements\",\n  \"interface\",\n  \"let\",\n  \"package\",\n  \"private\",\n  \"protected\",\n  \"public\",\n  \"static\",\n  \"yield\",\n  // strictBind\n  \"eval\",\n  \"arguments\",\n  // reservedWorkLike\n  \"enum\",\n  \"await\",\n]);\n\nexport function canBeReservedWord(word: string): boolean {\n  return reservedWordLikeSet.has(word);\n}\n","// @flow\n\n// Each scope gets a bitset that may contain these flags\n// prettier-ignore\nexport const SCOPE_OTHER        = 0b000000000,\n             SCOPE_PROGRAM      = 0b000000001,\n             SCOPE_FUNCTION     = 0b000000010,\n             SCOPE_ARROW        = 0b000000100,\n             SCOPE_SIMPLE_CATCH = 0b000001000,\n             SCOPE_SUPER        = 0b000010000,\n             SCOPE_DIRECT_SUPER = 0b000100000,\n             SCOPE_CLASS        = 0b001000000,\n             SCOPE_STATIC_BLOCK = 0b010000000,\n             SCOPE_TS_MODULE    = 0b100000000,\n             SCOPE_VAR = SCOPE_PROGRAM | SCOPE_FUNCTION | SCOPE_TS_MODULE;\n\nexport type ScopeFlags =\n  | typeof SCOPE_OTHER\n  | typeof SCOPE_PROGRAM\n  | typeof SCOPE_FUNCTION\n  | typeof SCOPE_VAR\n  | typeof SCOPE_ARROW\n  | typeof SCOPE_SIMPLE_CATCH\n  | typeof SCOPE_SUPER\n  | typeof SCOPE_DIRECT_SUPER\n  | typeof SCOPE_CLASS\n  | typeof SCOPE_STATIC_BLOCK;\n\n// These flags are meant to be _only_ used inside the Scope class (or subclasses).\n// prettier-ignore\nexport const BIND_KIND_VALUE            = 0b000000_0000_01,\n             BIND_KIND_TYPE             = 0b000000_0000_10,\n             // Used in checkLVal and declareName to determine the type of a binding\n             BIND_SCOPE_VAR             = 0b000000_0001_00, // Var-style binding\n             BIND_SCOPE_LEXICAL         = 0b000000_0010_00, // Let- or const-style binding\n             BIND_SCOPE_FUNCTION        = 0b000000_0100_00, // Function declaration\n             BIND_SCOPE_OUTSIDE         = 0b000000_1000_00, // Special case for function names as\n                                                   // bound inside the function\n             // Misc flags\n             BIND_FLAGS_NONE            = 0b000001_0000_00,\n             BIND_FLAGS_CLASS           = 0b000010_0000_00,\n             BIND_FLAGS_TS_ENUM         = 0b000100_0000_00,\n             BIND_FLAGS_TS_CONST_ENUM   = 0b001000_0000_00,\n             BIND_FLAGS_TS_EXPORT_ONLY  = 0b010000_0000_00,\n             BIND_FLAGS_FLOW_DECLARE_FN = 0b100000_0000_00;\n\n// These flags are meant to be _only_ used by Scope consumers\n// prettier-ignore\n/*                              =    is value?    |    is type?    |      scope          |    misc flags    */\nexport const BIND_CLASS         = BIND_KIND_VALUE | BIND_KIND_TYPE | BIND_SCOPE_LEXICAL  | BIND_FLAGS_CLASS  ,\n             BIND_LEXICAL       = BIND_KIND_VALUE | 0              | BIND_SCOPE_LEXICAL  | 0                 ,\n             BIND_VAR           = BIND_KIND_VALUE | 0              | BIND_SCOPE_VAR      | 0                 ,\n             BIND_FUNCTION      = BIND_KIND_VALUE | 0              | BIND_SCOPE_FUNCTION | 0                 ,\n             BIND_TS_INTERFACE  = 0               | BIND_KIND_TYPE | 0                   | BIND_FLAGS_CLASS  ,\n             BIND_TS_TYPE       = 0               | BIND_KIND_TYPE | 0                   | 0                 ,\n             BIND_TS_ENUM       = BIND_KIND_VALUE | BIND_KIND_TYPE | BIND_SCOPE_LEXICAL  | BIND_FLAGS_TS_ENUM,\n             BIND_TS_AMBIENT    = 0               | 0              | 0            | BIND_FLAGS_TS_EXPORT_ONLY,\n             // These bindings don't introduce anything in the scope. They are used for assignments and\n             // function expressions IDs.\n             BIND_NONE          = 0               | 0              | 0                   | BIND_FLAGS_NONE   ,\n             BIND_OUTSIDE       = BIND_KIND_VALUE | 0              | 0                   | BIND_FLAGS_NONE   ,\n\n             BIND_TS_CONST_ENUM = BIND_TS_ENUM | BIND_FLAGS_TS_CONST_ENUM,\n             BIND_TS_NAMESPACE  = 0               | 0              | 0            | BIND_FLAGS_TS_EXPORT_ONLY,\n\n             BIND_FLOW_DECLARE_FN = BIND_FLAGS_FLOW_DECLARE_FN;\n\nexport type BindingTypes =\n  | typeof BIND_NONE\n  | typeof BIND_OUTSIDE\n  | typeof BIND_VAR\n  | typeof BIND_LEXICAL\n  | typeof BIND_CLASS\n  | typeof BIND_FUNCTION\n  | typeof BIND_TS_INTERFACE\n  | typeof BIND_TS_TYPE\n  | typeof BIND_TS_ENUM\n  | typeof BIND_TS_AMBIENT\n  | typeof BIND_TS_NAMESPACE;\n\n// prettier-ignore\nexport const CLASS_ELEMENT_FLAG_STATIC = 0b1_00,\n             CLASS_ELEMENT_KIND_GETTER = 0b0_10,\n             CLASS_ELEMENT_KIND_SETTER = 0b0_01,\n             CLASS_ELEMENT_KIND_ACCESSOR = CLASS_ELEMENT_KIND_GETTER | CLASS_ELEMENT_KIND_SETTER;\n\n// prettier-ignore\nexport const CLASS_ELEMENT_STATIC_GETTER   = CLASS_ELEMENT_KIND_GETTER | CLASS_ELEMENT_FLAG_STATIC,\n             CLASS_ELEMENT_STATIC_SETTER   = CLASS_ELEMENT_KIND_SETTER | CLASS_ELEMENT_FLAG_STATIC,\n             CLASS_ELEMENT_INSTANCE_GETTER = CLASS_ELEMENT_KIND_GETTER,\n             CLASS_ELEMENT_INSTANCE_SETTER = CLASS_ELEMENT_KIND_SETTER,\n             CLASS_ELEMENT_OTHER           = 0;\n\nexport type ClassElementTypes =\n  | typeof CLASS_ELEMENT_STATIC_GETTER\n  | typeof CLASS_ELEMENT_STATIC_SETTER\n  | typeof CLASS_ELEMENT_INSTANCE_GETTER\n  | typeof CLASS_ELEMENT_INSTANCE_SETTER\n  | typeof CLASS_ELEMENT_OTHER;\n","// @flow\nimport {\n  SCOPE_ARROW,\n  SCOPE_DIRECT_SUPER,\n  SCOPE_FUNCTION,\n  SCOPE_SIMPLE_CATCH,\n  SCOPE_SUPER,\n  SCOPE_PROGRAM,\n  SCOPE_VAR,\n  SCOPE_CLASS,\n  SCOPE_STATIC_BLOCK,\n  BIND_SCOPE_FUNCTION,\n  BIND_SCOPE_VAR,\n  BIND_SCOPE_LEXICAL,\n  BIND_KIND_VALUE,\n  type ScopeFlags,\n  type BindingTypes,\n} from \"./scopeflags\";\nimport * as N from \"../types\";\nimport { Errors, type raiseFunction } from \"../parser/error\";\n\n// Start an AST node, attaching a start offset.\nexport class Scope {\n  declare flags: ScopeFlags;\n  // A set of var-declared names in the current lexical scope\n  var: Set<string> = new Set();\n  // A set of lexically-declared names in the current lexical scope\n  lexical: Set<string> = new Set();\n  // A set of lexically-declared FunctionDeclaration names in the current lexical scope\n  functions: Set<string> = new Set();\n\n  constructor(flags: ScopeFlags) {\n    this.flags = flags;\n  }\n}\n\n// The functions in this module keep track of declared variables in the\n// current scope in order to detect duplicate variable names.\nexport default class ScopeHandler<IScope: Scope = Scope> {\n  scopeStack: Array<IScope> = [];\n  declare raise: raiseFunction;\n  declare inModule: boolean;\n  undefinedExports: Map<string, number> = new Map();\n  undefinedPrivateNames: Map<string, number> = new Map();\n\n  constructor(raise: raiseFunction, inModule: boolean) {\n    this.raise = raise;\n    this.inModule = inModule;\n  }\n\n  get inFunction() {\n    return (this.currentVarScopeFlags() & SCOPE_FUNCTION) > 0;\n  }\n  get allowSuper() {\n    return (this.currentThisScopeFlags() & SCOPE_SUPER) > 0;\n  }\n  get allowDirectSuper() {\n    return (this.currentThisScopeFlags() & SCOPE_DIRECT_SUPER) > 0;\n  }\n  get inClass() {\n    return (this.currentThisScopeFlags() & SCOPE_CLASS) > 0;\n  }\n  get inClassAndNotInNonArrowFunction() {\n    const flags = this.currentThisScopeFlags();\n    return (flags & SCOPE_CLASS) > 0 && (flags & SCOPE_FUNCTION) === 0;\n  }\n  get inStaticBlock() {\n    return (this.currentThisScopeFlags() & SCOPE_STATIC_BLOCK) > 0;\n  }\n  get inNonArrowFunction() {\n    return (this.currentThisScopeFlags() & SCOPE_FUNCTION) > 0;\n  }\n  get treatFunctionsAsVar() {\n    return this.treatFunctionsAsVarInScope(this.currentScope());\n  }\n\n  createScope(flags: ScopeFlags): Scope {\n    return new Scope(flags);\n  }\n  // This method will be overwritten by subclasses\n  /*:: +createScope: (flags: ScopeFlags) => IScope; */\n\n  enter(flags: ScopeFlags) {\n    this.scopeStack.push(this.createScope(flags));\n  }\n\n  exit() {\n    this.scopeStack.pop();\n  }\n\n  // The spec says:\n  // > At the top level of a function, or script, function declarations are\n  // > treated like var declarations rather than like lexical declarations.\n  treatFunctionsAsVarInScope(scope: IScope): boolean {\n    return !!(\n      scope.flags & SCOPE_FUNCTION ||\n      (!this.inModule && scope.flags & SCOPE_PROGRAM)\n    );\n  }\n\n  declareName(name: string, bindingType: BindingTypes, pos: number) {\n    let scope = this.currentScope();\n    if (bindingType & BIND_SCOPE_LEXICAL || bindingType & BIND_SCOPE_FUNCTION) {\n      this.checkRedeclarationInScope(scope, name, bindingType, pos);\n\n      if (bindingType & BIND_SCOPE_FUNCTION) {\n        scope.functions.add(name);\n      } else {\n        scope.lexical.add(name);\n      }\n\n      if (bindingType & BIND_SCOPE_LEXICAL) {\n        this.maybeExportDefined(scope, name);\n      }\n    } else if (bindingType & BIND_SCOPE_VAR) {\n      for (let i = this.scopeStack.length - 1; i >= 0; --i) {\n        scope = this.scopeStack[i];\n        this.checkRedeclarationInScope(scope, name, bindingType, pos);\n        scope.var.add(name);\n        this.maybeExportDefined(scope, name);\n\n        if (scope.flags & SCOPE_VAR) break;\n      }\n    }\n    if (this.inModule && scope.flags & SCOPE_PROGRAM) {\n      this.undefinedExports.delete(name);\n    }\n  }\n\n  maybeExportDefined(scope: IScope, name: string) {\n    if (this.inModule && scope.flags & SCOPE_PROGRAM) {\n      this.undefinedExports.delete(name);\n    }\n  }\n\n  checkRedeclarationInScope(\n    scope: IScope,\n    name: string,\n    bindingType: BindingTypes,\n    pos: number,\n  ) {\n    if (this.isRedeclaredInScope(scope, name, bindingType)) {\n      this.raise(pos, Errors.VarRedeclaration, name);\n    }\n  }\n\n  isRedeclaredInScope(\n    scope: IScope,\n    name: string,\n    bindingType: BindingTypes,\n  ): boolean {\n    if (!(bindingType & BIND_KIND_VALUE)) return false;\n\n    if (bindingType & BIND_SCOPE_LEXICAL) {\n      return (\n        scope.lexical.has(name) ||\n        scope.functions.has(name) ||\n        scope.var.has(name)\n      );\n    }\n\n    if (bindingType & BIND_SCOPE_FUNCTION) {\n      return (\n        scope.lexical.has(name) ||\n        (!this.treatFunctionsAsVarInScope(scope) && scope.var.has(name))\n      );\n    }\n\n    return (\n      (scope.lexical.has(name) &&\n        !(\n          scope.flags & SCOPE_SIMPLE_CATCH &&\n          scope.lexical.values().next().value === name\n        )) ||\n      (!this.treatFunctionsAsVarInScope(scope) && scope.functions.has(name))\n    );\n  }\n\n  checkLocalExport(id: N.Identifier) {\n    const { name } = id;\n    const topLevelScope = this.scopeStack[0];\n    if (\n      !topLevelScope.lexical.has(name) &&\n      !topLevelScope.var.has(name) &&\n      // In strict mode, scope.functions will always be empty.\n      // Modules are strict by default, but the `scriptMode` option\n      // can overwrite this behavior.\n      !topLevelScope.functions.has(name)\n    ) {\n      this.undefinedExports.set(name, id.start);\n    }\n  }\n\n  currentScope(): IScope {\n    return this.scopeStack[this.scopeStack.length - 1];\n  }\n\n  // $FlowIgnore\n  currentVarScopeFlags(): ScopeFlags {\n    for (let i = this.scopeStack.length - 1; ; i--) {\n      const { flags } = this.scopeStack[i];\n      if (flags & SCOPE_VAR) {\n        return flags;\n      }\n    }\n  }\n\n  // Could be useful for `arguments`, `this`, `new.target`, `super()`, `super.property`, and `super[property]`.\n  // $FlowIgnore\n  currentThisScopeFlags(): ScopeFlags {\n    for (let i = this.scopeStack.length - 1; ; i--) {\n      const { flags } = this.scopeStack[i];\n      if (flags & (SCOPE_VAR | SCOPE_CLASS) && !(flags & SCOPE_ARROW)) {\n        return flags;\n      }\n    }\n  }\n}\n","// @flow\n\nimport ScopeHandler, { Scope } from \"../../util/scope\";\nimport {\n  BIND_FLAGS_FLOW_DECLARE_FN,\n  type ScopeFlags,\n  type BindingTypes,\n} from \"../../util/scopeflags\";\nimport * as N from \"../../types\";\n\n// Reference implementation: https://github.com/facebook/flow/blob/23aeb2a2ef6eb4241ce178fde5d8f17c5f747fb5/src/typing/env.ml#L536-L584\nclass FlowScope extends Scope {\n  // declare function foo(): type;\n  declareFunctions: Set<string> = new Set();\n}\n\nexport default class FlowScopeHandler extends ScopeHandler<FlowScope> {\n  createScope(flags: ScopeFlags): FlowScope {\n    return new FlowScope(flags);\n  }\n\n  declareName(name: string, bindingType: BindingTypes, pos: number) {\n    const scope = this.currentScope();\n    if (bindingType & BIND_FLAGS_FLOW_DECLARE_FN) {\n      this.checkRedeclarationInScope(scope, name, bindingType, pos);\n      this.maybeExportDefined(scope, name);\n      scope.declareFunctions.add(name);\n      return;\n    }\n\n    super.declareName(...arguments);\n  }\n\n  isRedeclaredInScope(\n    scope: FlowScope,\n    name: string,\n    bindingType: BindingTypes,\n  ): boolean {\n    if (super.isRedeclaredInScope(...arguments)) return true;\n\n    if (bindingType & BIND_FLAGS_FLOW_DECLARE_FN) {\n      return (\n        !scope.declareFunctions.has(name) &&\n        (scope.lexical.has(name) || scope.functions.has(name))\n      );\n    }\n\n    return false;\n  }\n\n  checkLocalExport(id: N.Identifier) {\n    if (!this.scopeStack[0].declareFunctions.has(id.name)) {\n      super.checkLocalExport(id);\n    }\n  }\n}\n","// @flow\n\n/*:: declare var invariant; */\n\n// Error messages are colocated with the plugin.\n/* eslint-disable @babel/development-internal/dry-error-messages */\n\nimport type Parser from \"../../parser\";\nimport { types as tt, type TokenType } from \"../../tokenizer/types\";\nimport * as N from \"../../types\";\nimport type { Pos, Position } from \"../../util/location\";\nimport { types as tc } from \"../../tokenizer/context\";\nimport * as charCodes from \"charcodes\";\nimport { isIteratorStart, isKeyword } from \"../../util/identifier\";\nimport FlowScopeHandler from \"./scope\";\nimport {\n  type BindingTypes,\n  BIND_LEXICAL,\n  BIND_VAR,\n  BIND_FUNCTION,\n  BIND_FLOW_DECLARE_FN,\n  SCOPE_ARROW,\n  SCOPE_FUNCTION,\n  SCOPE_OTHER,\n} from \"../../util/scopeflags\";\nimport type { ExpressionErrors } from \"../../parser/util\";\nimport { Errors, makeErrorTemplates, ErrorCodes } from \"../../parser/error\";\n\nconst reservedTypes = new Set([\n  \"_\",\n  \"any\",\n  \"bool\",\n  \"boolean\",\n  \"empty\",\n  \"extends\",\n  \"false\",\n  \"interface\",\n  \"mixed\",\n  \"null\",\n  \"number\",\n  \"static\",\n  \"string\",\n  \"true\",\n  \"typeof\",\n  \"void\",\n]);\n\n/* eslint sort-keys: \"error\" */\n// The Errors key follows https://github.com/facebook/flow/blob/master/src/parser/parse_error.ml unless it does not exist\nconst FlowErrors = makeErrorTemplates(\n  {\n    AmbiguousConditionalArrow:\n      \"Ambiguous expression: wrap the arrow functions in parentheses to disambiguate.\",\n    AmbiguousDeclareModuleKind:\n      \"Found both `declare module.exports` and `declare export` in the same module. Modules can only have 1 since they are either an ES module or they are a CommonJS module.\",\n    AssignReservedType: \"Cannot overwrite reserved type %0.\",\n    DeclareClassElement:\n      \"The `declare` modifier can only appear on class fields.\",\n    DeclareClassFieldInitializer:\n      \"Initializers are not allowed in fields with the `declare` modifier.\",\n    DuplicateDeclareModuleExports:\n      \"Duplicate `declare module.exports` statement.\",\n    EnumBooleanMemberNotInitialized:\n      \"Boolean enum members need to be initialized. Use either `%0 = true,` or `%0 = false,` in enum `%1`.\",\n    EnumDuplicateMemberName:\n      \"Enum member names need to be unique, but the name `%0` has already been used before in enum `%1`.\",\n    EnumInconsistentMemberValues:\n      \"Enum `%0` has inconsistent member initializers. Either use no initializers, or consistently use literals (either booleans, numbers, or strings) for all member initializers.\",\n    EnumInvalidExplicitType:\n      \"Enum type `%1` is not valid. Use one of `boolean`, `number`, `string`, or `symbol` in enum `%0`.\",\n    EnumInvalidExplicitTypeUnknownSupplied:\n      \"Supplied enum type is not valid. Use one of `boolean`, `number`, `string`, or `symbol` in enum `%0`.\",\n    EnumInvalidMemberInitializerPrimaryType:\n      \"Enum `%0` has type `%2`, so the initializer of `%1` needs to be a %2 literal.\",\n    EnumInvalidMemberInitializerSymbolType:\n      \"Symbol enum members cannot be initialized. Use `%1,` in enum `%0`.\",\n    EnumInvalidMemberInitializerUnknownType:\n      \"The enum member initializer for `%1` needs to be a literal (either a boolean, number, or string) in enum `%0`.\",\n    EnumInvalidMemberName:\n      \"Enum member names cannot start with lowercase 'a' through 'z'. Instead of using `%0`, consider using `%1`, in enum `%2`.\",\n    EnumNumberMemberNotInitialized:\n      \"Number enum members need to be initialized, e.g. `%1 = 1` in enum `%0`.\",\n    EnumStringMemberInconsistentlyInitailized:\n      \"String enum members need to consistently either all use initializers, or use no initializers, in enum `%0`.\",\n    GetterMayNotHaveThisParam: \"A getter cannot have a `this` parameter.\",\n    ImportTypeShorthandOnlyInPureImport:\n      \"The `type` and `typeof` keywords on named imports can only be used on regular `import` statements. It cannot be used with `import type` or `import typeof` statements.\",\n    InexactInsideExact:\n      \"Explicit inexact syntax cannot appear inside an explicit exact object type.\",\n    InexactInsideNonObject:\n      \"Explicit inexact syntax cannot appear in class or interface definitions.\",\n    InexactVariance: \"Explicit inexact syntax cannot have variance.\",\n    InvalidNonTypeImportInDeclareModule:\n      \"Imports within a `declare module` body must always be `import type` or `import typeof`.\",\n    MissingTypeParamDefault:\n      \"Type parameter declaration needs a default, since a preceding type parameter declaration has a default.\",\n    NestedDeclareModule:\n      \"`declare module` cannot be used inside another `declare module`.\",\n    NestedFlowComment:\n      \"Cannot have a flow comment inside another flow comment.\",\n    OptionalBindingPattern:\n      \"A binding pattern parameter cannot be optional in an implementation signature.\",\n    SetterMayNotHaveThisParam: \"A setter cannot have a `this` parameter.\",\n    SpreadVariance: \"Spread properties cannot have variance.\",\n    ThisParamAnnotationRequired:\n      \"A type annotation is required for the `this` parameter.\",\n    ThisParamBannedInConstructor:\n      \"Constructors cannot have a `this` parameter; constructors don't bind `this` like other functions.\",\n    ThisParamMayNotBeOptional: \"The `this` parameter cannot be optional.\",\n    ThisParamMustBeFirst:\n      \"The `this` parameter must be the first function parameter.\",\n    ThisParamNoDefault: \"The `this` parameter may not have a default value.\",\n    TypeBeforeInitializer:\n      \"Type annotations must come before default assignments, e.g. instead of `age = 25: number` use `age: number = 25`.\",\n    TypeCastInPattern:\n      \"The type cast expression is expected to be wrapped with parenthesis.\",\n    UnexpectedExplicitInexactInObject:\n      \"Explicit inexact syntax must appear at the end of an inexact object.\",\n    UnexpectedReservedType: \"Unexpected reserved type %0.\",\n    UnexpectedReservedUnderscore:\n      \"`_` is only allowed as a type argument to call or new.\",\n    UnexpectedSpaceBetweenModuloChecks:\n      \"Spaces between `%` and `checks` are not allowed here.\",\n    UnexpectedSpreadType:\n      \"Spread operator cannot appear in class or interface definitions.\",\n    UnexpectedSubtractionOperand:\n      'Unexpected token, expected \"number\" or \"bigint\".',\n    UnexpectedTokenAfterTypeParameter:\n      \"Expected an arrow function after this type parameter declaration.\",\n    UnexpectedTypeParameterBeforeAsyncArrowFunction:\n      \"Type parameters must come after the async keyword, e.g. instead of `<T> async () => {}`, use `async <T>() => {}`.\",\n    UnsupportedDeclareExportKind:\n      \"`declare export %0` is not supported. Use `%1` instead.\",\n    UnsupportedStatementInDeclareModule:\n      \"Only declares and type imports are allowed inside declare module.\",\n    UnterminatedFlowComment: \"Unterminated flow-comment.\",\n  },\n  /* code */ ErrorCodes.SyntaxError,\n);\n/* eslint-disable sort-keys */\n\nfunction isEsModuleType(bodyElement: N.Node): boolean {\n  return (\n    bodyElement.type === \"DeclareExportAllDeclaration\" ||\n    (bodyElement.type === \"DeclareExportDeclaration\" &&\n      (!bodyElement.declaration ||\n        (bodyElement.declaration.type !== \"TypeAlias\" &&\n          bodyElement.declaration.type !== \"InterfaceDeclaration\")))\n  );\n}\n\nfunction hasTypeImportKind(node: N.Node): boolean {\n  return node.importKind === \"type\" || node.importKind === \"typeof\";\n}\n\nfunction isMaybeDefaultImport(state: { type: TokenType, value: any }): boolean {\n  return (\n    (state.type === tt.name || !!state.type.keyword) && state.value !== \"from\"\n  );\n}\n\nconst exportSuggestions = {\n  const: \"declare export var\",\n  let: \"declare export var\",\n  type: \"export type\",\n  interface: \"export interface\",\n};\n\n// Like Array#filter, but returns a tuple [ acceptedElements, discardedElements ]\nfunction partition<T>(\n  list: T[],\n  test: (T, number, T[]) => ?boolean,\n): [T[], T[]] {\n  const list1 = [];\n  const list2 = [];\n  for (let i = 0; i < list.length; i++) {\n    (test(list[i], i, list) ? list1 : list2).push(list[i]);\n  }\n  return [list1, list2];\n}\n\nconst FLOW_PRAGMA_REGEX = /\\*?\\s*@((?:no)?flow)\\b/;\n\n// Flow enums types\ntype EnumExplicitType = null | \"boolean\" | \"number\" | \"string\" | \"symbol\";\ntype EnumContext = {|\n  enumName: string,\n  explicitType: EnumExplicitType,\n  memberName: string,\n|};\ntype EnumMemberInit =\n  | {| type: \"number\", pos: number, value: N.Node |}\n  | {| type: \"string\", pos: number, value: N.Node |}\n  | {| type: \"boolean\", pos: number, value: N.Node |}\n  | {| type: \"invalid\", pos: number |}\n  | {| type: \"none\", pos: number |};\n\nexport default (superClass: Class<Parser>): Class<Parser> =>\n  class extends superClass {\n    // The value of the @flow/@noflow pragma. Initially undefined, transitions\n    // to \"@flow\" or \"@noflow\" if we see a pragma. Transitions to null if we are\n    // past the initial comment.\n    flowPragma: void | null | \"flow\" | \"noflow\" = undefined;\n\n    getScopeHandler(): Class<FlowScopeHandler> {\n      return FlowScopeHandler;\n    }\n\n    shouldParseTypes(): boolean {\n      return this.getPluginOption(\"flow\", \"all\") || this.flowPragma === \"flow\";\n    }\n\n    shouldParseEnums(): boolean {\n      return !!this.getPluginOption(\"flow\", \"enums\");\n    }\n\n    finishToken(type: TokenType, val: any): void {\n      if (\n        type !== tt.string &&\n        type !== tt.semi &&\n        type !== tt.interpreterDirective\n      ) {\n        if (this.flowPragma === undefined) {\n          this.flowPragma = null;\n        }\n      }\n      return super.finishToken(type, val);\n    }\n\n    addComment(comment: N.Comment): void {\n      if (this.flowPragma === undefined) {\n        // Try to parse a flow pragma.\n        const matches = FLOW_PRAGMA_REGEX.exec(comment.value);\n        if (!matches) {\n          // do nothing\n        } else if (matches[1] === \"flow\") {\n          this.flowPragma = \"flow\";\n        } else if (matches[1] === \"noflow\") {\n          this.flowPragma = \"noflow\";\n        } else {\n          throw new Error(\"Unexpected flow pragma\");\n        }\n      }\n      return super.addComment(comment);\n    }\n\n    flowParseTypeInitialiser(tok?: TokenType): N.FlowType {\n      const oldInType = this.state.inType;\n      this.state.inType = true;\n      this.expect(tok || tt.colon);\n\n      const type = this.flowParseType();\n      this.state.inType = oldInType;\n      return type;\n    }\n\n    flowParsePredicate(): N.FlowType {\n      const node = this.startNode();\n      const moduloPos = this.state.start;\n      this.next(); // eat `%`\n      this.expectContextual(\"checks\");\n      // Force '%' and 'checks' to be adjacent\n      if (this.state.lastTokStart > moduloPos + 1) {\n        this.raise(moduloPos, FlowErrors.UnexpectedSpaceBetweenModuloChecks);\n      }\n      if (this.eat(tt.parenL)) {\n        node.value = this.parseExpression();\n        this.expect(tt.parenR);\n        return this.finishNode(node, \"DeclaredPredicate\");\n      } else {\n        return this.finishNode(node, \"InferredPredicate\");\n      }\n    }\n\n    flowParseTypeAndPredicateInitialiser(): [?N.FlowType, ?N.FlowPredicate] {\n      const oldInType = this.state.inType;\n      this.state.inType = true;\n      this.expect(tt.colon);\n      let type = null;\n      let predicate = null;\n      if (this.match(tt.modulo)) {\n        this.state.inType = oldInType;\n        predicate = this.flowParsePredicate();\n      } else {\n        type = this.flowParseType();\n        this.state.inType = oldInType;\n        if (this.match(tt.modulo)) {\n          predicate = this.flowParsePredicate();\n        }\n      }\n      return [type, predicate];\n    }\n\n    flowParseDeclareClass(node: N.FlowDeclareClass): N.FlowDeclareClass {\n      this.next();\n      this.flowParseInterfaceish(node, /*isClass*/ true);\n      return this.finishNode(node, \"DeclareClass\");\n    }\n\n    flowParseDeclareFunction(\n      node: N.FlowDeclareFunction,\n    ): N.FlowDeclareFunction {\n      this.next();\n\n      const id = (node.id = this.parseIdentifier());\n\n      const typeNode = this.startNode();\n      const typeContainer = this.startNode();\n\n      if (this.isRelational(\"<\")) {\n        typeNode.typeParameters = this.flowParseTypeParameterDeclaration();\n      } else {\n        typeNode.typeParameters = null;\n      }\n\n      this.expect(tt.parenL);\n      const tmp = this.flowParseFunctionTypeParams();\n      typeNode.params = tmp.params;\n      typeNode.rest = tmp.rest;\n      typeNode.this = tmp._this;\n      this.expect(tt.parenR);\n\n      [\n        // $FlowFixMe (destructuring not supported yet)\n        typeNode.returnType,\n        // $FlowFixMe (destructuring not supported yet)\n        node.predicate,\n      ] = this.flowParseTypeAndPredicateInitialiser();\n\n      typeContainer.typeAnnotation = this.finishNode(\n        typeNode,\n        \"FunctionTypeAnnotation\",\n      );\n\n      id.typeAnnotation = this.finishNode(typeContainer, \"TypeAnnotation\");\n\n      this.resetEndLocation(id);\n      this.semicolon();\n\n      this.scope.declareName(node.id.name, BIND_FLOW_DECLARE_FN, node.id.start);\n\n      return this.finishNode(node, \"DeclareFunction\");\n    }\n\n    flowParseDeclare(\n      node: N.FlowDeclare,\n      insideModule?: boolean,\n    ): N.FlowDeclare {\n      if (this.match(tt._class)) {\n        return this.flowParseDeclareClass(node);\n      } else if (this.match(tt._function)) {\n        return this.flowParseDeclareFunction(node);\n      } else if (this.match(tt._var)) {\n        return this.flowParseDeclareVariable(node);\n      } else if (this.eatContextual(\"module\")) {\n        if (this.match(tt.dot)) {\n          return this.flowParseDeclareModuleExports(node);\n        } else {\n          if (insideModule) {\n            this.raise(this.state.lastTokStart, FlowErrors.NestedDeclareModule);\n          }\n          return this.flowParseDeclareModule(node);\n        }\n      } else if (this.isContextual(\"type\")) {\n        return this.flowParseDeclareTypeAlias(node);\n      } else if (this.isContextual(\"opaque\")) {\n        return this.flowParseDeclareOpaqueType(node);\n      } else if (this.isContextual(\"interface\")) {\n        return this.flowParseDeclareInterface(node);\n      } else if (this.match(tt._export)) {\n        return this.flowParseDeclareExportDeclaration(node, insideModule);\n      } else {\n        throw this.unexpected();\n      }\n    }\n\n    flowParseDeclareVariable(\n      node: N.FlowDeclareVariable,\n    ): N.FlowDeclareVariable {\n      this.next();\n      node.id = this.flowParseTypeAnnotatableIdentifier(\n        /*allowPrimitiveOverride*/ true,\n      );\n      this.scope.declareName(node.id.name, BIND_VAR, node.id.start);\n      this.semicolon();\n      return this.finishNode(node, \"DeclareVariable\");\n    }\n\n    flowParseDeclareModule(node: N.FlowDeclareModule): N.FlowDeclareModule {\n      this.scope.enter(SCOPE_OTHER);\n\n      if (this.match(tt.string)) {\n        node.id = this.parseExprAtom();\n      } else {\n        node.id = this.parseIdentifier();\n      }\n\n      const bodyNode = (node.body = this.startNode());\n      const body = (bodyNode.body = []);\n      this.expect(tt.braceL);\n      while (!this.match(tt.braceR)) {\n        let bodyNode = this.startNode();\n\n        if (this.match(tt._import)) {\n          this.next();\n          if (!this.isContextual(\"type\") && !this.match(tt._typeof)) {\n            this.raise(\n              this.state.lastTokStart,\n              FlowErrors.InvalidNonTypeImportInDeclareModule,\n            );\n          }\n          this.parseImport(bodyNode);\n        } else {\n          this.expectContextual(\n            \"declare\",\n            FlowErrors.UnsupportedStatementInDeclareModule,\n          );\n\n          bodyNode = this.flowParseDeclare(bodyNode, true);\n        }\n\n        body.push(bodyNode);\n      }\n\n      this.scope.exit();\n\n      this.expect(tt.braceR);\n\n      this.finishNode(bodyNode, \"BlockStatement\");\n\n      let kind = null;\n      let hasModuleExport = false;\n      body.forEach(bodyElement => {\n        if (isEsModuleType(bodyElement)) {\n          if (kind === \"CommonJS\") {\n            this.raise(\n              bodyElement.start,\n              FlowErrors.AmbiguousDeclareModuleKind,\n            );\n          }\n          kind = \"ES\";\n        } else if (bodyElement.type === \"DeclareModuleExports\") {\n          if (hasModuleExport) {\n            this.raise(\n              bodyElement.start,\n              FlowErrors.DuplicateDeclareModuleExports,\n            );\n          }\n          if (kind === \"ES\") {\n            this.raise(\n              bodyElement.start,\n              FlowErrors.AmbiguousDeclareModuleKind,\n            );\n          }\n          kind = \"CommonJS\";\n          hasModuleExport = true;\n        }\n      });\n\n      node.kind = kind || \"CommonJS\";\n      return this.finishNode(node, \"DeclareModule\");\n    }\n\n    flowParseDeclareExportDeclaration(\n      node: N.FlowDeclareExportDeclaration,\n      insideModule: ?boolean,\n    ): N.FlowDeclareExportDeclaration {\n      this.expect(tt._export);\n\n      if (this.eat(tt._default)) {\n        if (this.match(tt._function) || this.match(tt._class)) {\n          // declare export default class ...\n          // declare export default function ...\n          node.declaration = this.flowParseDeclare(this.startNode());\n        } else {\n          // declare export default [type];\n          node.declaration = this.flowParseType();\n          this.semicolon();\n        }\n        node.default = true;\n\n        return this.finishNode(node, \"DeclareExportDeclaration\");\n      } else {\n        if (\n          this.match(tt._const) ||\n          this.isLet() ||\n          ((this.isContextual(\"type\") || this.isContextual(\"interface\")) &&\n            !insideModule)\n        ) {\n          const label = this.state.value;\n          const suggestion = exportSuggestions[label];\n\n          throw this.raise(\n            this.state.start,\n            FlowErrors.UnsupportedDeclareExportKind,\n            label,\n            suggestion,\n          );\n        }\n\n        if (\n          this.match(tt._var) || // declare export var ...\n          this.match(tt._function) || // declare export function ...\n          this.match(tt._class) || // declare export class ...\n          this.isContextual(\"opaque\") // declare export opaque ..\n        ) {\n          node.declaration = this.flowParseDeclare(this.startNode());\n          node.default = false;\n\n          return this.finishNode(node, \"DeclareExportDeclaration\");\n        } else if (\n          this.match(tt.star) || // declare export * from ''\n          this.match(tt.braceL) || // declare export {} ...\n          this.isContextual(\"interface\") || // declare export interface ...\n          this.isContextual(\"type\") || // declare export type ...\n          this.isContextual(\"opaque\") // declare export opaque type ...\n        ) {\n          node = this.parseExport(node);\n          if (node.type === \"ExportNamedDeclaration\") {\n            // flow does not support the ExportNamedDeclaration\n            // $FlowIgnore\n            node.type = \"ExportDeclaration\";\n            // $FlowFixMe\n            node.default = false;\n            delete node.exportKind;\n          }\n\n          // $FlowIgnore\n          node.type = \"Declare\" + node.type;\n\n          return node;\n        }\n      }\n\n      throw this.unexpected();\n    }\n\n    flowParseDeclareModuleExports(\n      node: N.FlowDeclareModuleExports,\n    ): N.FlowDeclareModuleExports {\n      this.next();\n      this.expectContextual(\"exports\");\n      node.typeAnnotation = this.flowParseTypeAnnotation();\n      this.semicolon();\n\n      return this.finishNode(node, \"DeclareModuleExports\");\n    }\n\n    flowParseDeclareTypeAlias(\n      node: N.FlowDeclareTypeAlias,\n    ): N.FlowDeclareTypeAlias {\n      this.next();\n      this.flowParseTypeAlias(node);\n      // Don't do finishNode as we don't want to process comments twice\n      node.type = \"DeclareTypeAlias\";\n      return node;\n    }\n\n    flowParseDeclareOpaqueType(\n      node: N.FlowDeclareOpaqueType,\n    ): N.FlowDeclareOpaqueType {\n      this.next();\n      this.flowParseOpaqueType(node, true);\n      // Don't do finishNode as we don't want to process comments twice\n      node.type = \"DeclareOpaqueType\";\n      return node;\n    }\n\n    flowParseDeclareInterface(\n      node: N.FlowDeclareInterface,\n    ): N.FlowDeclareInterface {\n      this.next();\n      this.flowParseInterfaceish(node);\n      return this.finishNode(node, \"DeclareInterface\");\n    }\n\n    // Interfaces\n\n    flowParseInterfaceish(\n      node: N.FlowDeclare,\n      isClass?: boolean = false,\n    ): void {\n      node.id = this.flowParseRestrictedIdentifier(\n        /* liberal */ !isClass,\n        /* declaration */ true,\n      );\n\n      this.scope.declareName(\n        node.id.name,\n        isClass ? BIND_FUNCTION : BIND_LEXICAL,\n        node.id.start,\n      );\n\n      if (this.isRelational(\"<\")) {\n        node.typeParameters = this.flowParseTypeParameterDeclaration();\n      } else {\n        node.typeParameters = null;\n      }\n\n      node.extends = [];\n      node.implements = [];\n      node.mixins = [];\n\n      if (this.eat(tt._extends)) {\n        do {\n          node.extends.push(this.flowParseInterfaceExtends());\n        } while (!isClass && this.eat(tt.comma));\n      }\n\n      if (this.isContextual(\"mixins\")) {\n        this.next();\n        do {\n          node.mixins.push(this.flowParseInterfaceExtends());\n        } while (this.eat(tt.comma));\n      }\n\n      if (this.isContextual(\"implements\")) {\n        this.next();\n        do {\n          node.implements.push(this.flowParseInterfaceExtends());\n        } while (this.eat(tt.comma));\n      }\n\n      node.body = this.flowParseObjectType({\n        allowStatic: isClass,\n        allowExact: false,\n        allowSpread: false,\n        allowProto: isClass,\n        allowInexact: false,\n      });\n    }\n\n    flowParseInterfaceExtends(): N.FlowInterfaceExtends {\n      const node = this.startNode();\n\n      node.id = this.flowParseQualifiedTypeIdentifier();\n      if (this.isRelational(\"<\")) {\n        node.typeParameters = this.flowParseTypeParameterInstantiation();\n      } else {\n        node.typeParameters = null;\n      }\n\n      return this.finishNode(node, \"InterfaceExtends\");\n    }\n\n    flowParseInterface(node: N.FlowInterface): N.FlowInterface {\n      this.flowParseInterfaceish(node);\n      return this.finishNode(node, \"InterfaceDeclaration\");\n    }\n\n    checkNotUnderscore(word: string) {\n      if (word === \"_\") {\n        this.raise(this.state.start, FlowErrors.UnexpectedReservedUnderscore);\n      }\n    }\n\n    checkReservedType(word: string, startLoc: number, declaration?: boolean) {\n      if (!reservedTypes.has(word)) return;\n\n      this.raise(\n        startLoc,\n        declaration\n          ? FlowErrors.AssignReservedType\n          : FlowErrors.UnexpectedReservedType,\n        word,\n      );\n    }\n\n    flowParseRestrictedIdentifier(\n      liberal?: boolean,\n      declaration?: boolean,\n    ): N.Identifier {\n      this.checkReservedType(this.state.value, this.state.start, declaration);\n      return this.parseIdentifier(liberal);\n    }\n\n    // Type aliases\n\n    flowParseTypeAlias(node: N.FlowTypeAlias): N.FlowTypeAlias {\n      node.id = this.flowParseRestrictedIdentifier(\n        /* liberal */ false,\n        /* declaration */ true,\n      );\n      this.scope.declareName(node.id.name, BIND_LEXICAL, node.id.start);\n\n      if (this.isRelational(\"<\")) {\n        node.typeParameters = this.flowParseTypeParameterDeclaration();\n      } else {\n        node.typeParameters = null;\n      }\n\n      node.right = this.flowParseTypeInitialiser(tt.eq);\n      this.semicolon();\n\n      return this.finishNode(node, \"TypeAlias\");\n    }\n\n    flowParseOpaqueType(\n      node: N.FlowOpaqueType,\n      declare: boolean,\n    ): N.FlowOpaqueType {\n      this.expectContextual(\"type\");\n      node.id = this.flowParseRestrictedIdentifier(\n        /* liberal */ true,\n        /* declaration */ true,\n      );\n      this.scope.declareName(node.id.name, BIND_LEXICAL, node.id.start);\n\n      if (this.isRelational(\"<\")) {\n        node.typeParameters = this.flowParseTypeParameterDeclaration();\n      } else {\n        node.typeParameters = null;\n      }\n\n      // Parse the supertype\n      node.supertype = null;\n      if (this.match(tt.colon)) {\n        node.supertype = this.flowParseTypeInitialiser(tt.colon);\n      }\n\n      node.impltype = null;\n      if (!declare) {\n        node.impltype = this.flowParseTypeInitialiser(tt.eq);\n      }\n      this.semicolon();\n\n      return this.finishNode(node, \"OpaqueType\");\n    }\n\n    // Type annotations\n\n    flowParseTypeParameter(requireDefault?: boolean = false): N.TypeParameter {\n      const nodeStart = this.state.start;\n\n      const node = this.startNode();\n\n      const variance = this.flowParseVariance();\n\n      const ident = this.flowParseTypeAnnotatableIdentifier();\n      node.name = ident.name;\n      node.variance = variance;\n      node.bound = ident.typeAnnotation;\n\n      if (this.match(tt.eq)) {\n        this.eat(tt.eq);\n        node.default = this.flowParseType();\n      } else {\n        if (requireDefault) {\n          this.raise(nodeStart, FlowErrors.MissingTypeParamDefault);\n        }\n      }\n\n      return this.finishNode(node, \"TypeParameter\");\n    }\n\n    flowParseTypeParameterDeclaration(): N.TypeParameterDeclaration {\n      const oldInType = this.state.inType;\n      const node = this.startNode();\n      node.params = [];\n\n      this.state.inType = true;\n\n      // istanbul ignore else: this condition is already checked at all call sites\n      if (this.isRelational(\"<\") || this.match(tt.jsxTagStart)) {\n        this.next();\n      } else {\n        this.unexpected();\n      }\n\n      let defaultRequired = false;\n\n      do {\n        const typeParameter = this.flowParseTypeParameter(defaultRequired);\n\n        node.params.push(typeParameter);\n\n        if (typeParameter.default) {\n          defaultRequired = true;\n        }\n\n        if (!this.isRelational(\">\")) {\n          this.expect(tt.comma);\n        }\n      } while (!this.isRelational(\">\"));\n      this.expectRelational(\">\");\n\n      this.state.inType = oldInType;\n\n      return this.finishNode(node, \"TypeParameterDeclaration\");\n    }\n\n    flowParseTypeParameterInstantiation(): N.TypeParameterInstantiation {\n      const node = this.startNode();\n      const oldInType = this.state.inType;\n      node.params = [];\n\n      this.state.inType = true;\n\n      this.expectRelational(\"<\");\n      const oldNoAnonFunctionType = this.state.noAnonFunctionType;\n      this.state.noAnonFunctionType = false;\n      while (!this.isRelational(\">\")) {\n        node.params.push(this.flowParseType());\n        if (!this.isRelational(\">\")) {\n          this.expect(tt.comma);\n        }\n      }\n      this.state.noAnonFunctionType = oldNoAnonFunctionType;\n      this.expectRelational(\">\");\n\n      this.state.inType = oldInType;\n\n      return this.finishNode(node, \"TypeParameterInstantiation\");\n    }\n\n    flowParseTypeParameterInstantiationCallOrNew(): N.TypeParameterInstantiation {\n      const node = this.startNode();\n      const oldInType = this.state.inType;\n      node.params = [];\n\n      this.state.inType = true;\n\n      this.expectRelational(\"<\");\n      while (!this.isRelational(\">\")) {\n        node.params.push(this.flowParseTypeOrImplicitInstantiation());\n        if (!this.isRelational(\">\")) {\n          this.expect(tt.comma);\n        }\n      }\n      this.expectRelational(\">\");\n\n      this.state.inType = oldInType;\n\n      return this.finishNode(node, \"TypeParameterInstantiation\");\n    }\n\n    flowParseInterfaceType(): N.FlowInterfaceType {\n      const node = this.startNode();\n      this.expectContextual(\"interface\");\n\n      node.extends = [];\n      if (this.eat(tt._extends)) {\n        do {\n          node.extends.push(this.flowParseInterfaceExtends());\n        } while (this.eat(tt.comma));\n      }\n\n      node.body = this.flowParseObjectType({\n        allowStatic: false,\n        allowExact: false,\n        allowSpread: false,\n        allowProto: false,\n        allowInexact: false,\n      });\n\n      return this.finishNode(node, \"InterfaceTypeAnnotation\");\n    }\n\n    flowParseObjectPropertyKey(): N.Expression {\n      return this.match(tt.num) || this.match(tt.string)\n        ? this.parseExprAtom()\n        : this.parseIdentifier(true);\n    }\n\n    flowParseObjectTypeIndexer(\n      node: N.FlowObjectTypeIndexer,\n      isStatic: boolean,\n      variance: ?N.FlowVariance,\n    ): N.FlowObjectTypeIndexer {\n      node.static = isStatic;\n\n      // Note: bracketL has already been consumed\n      if (this.lookahead().type === tt.colon) {\n        node.id = this.flowParseObjectPropertyKey();\n        node.key = this.flowParseTypeInitialiser();\n      } else {\n        node.id = null;\n        node.key = this.flowParseType();\n      }\n      this.expect(tt.bracketR);\n      node.value = this.flowParseTypeInitialiser();\n      node.variance = variance;\n\n      return this.finishNode(node, \"ObjectTypeIndexer\");\n    }\n\n    flowParseObjectTypeInternalSlot(\n      node: N.FlowObjectTypeInternalSlot,\n      isStatic: boolean,\n    ): N.FlowObjectTypeInternalSlot {\n      node.static = isStatic;\n      // Note: both bracketL have already been consumed\n      node.id = this.flowParseObjectPropertyKey();\n      this.expect(tt.bracketR);\n      this.expect(tt.bracketR);\n      if (this.isRelational(\"<\") || this.match(tt.parenL)) {\n        node.method = true;\n        node.optional = false;\n        node.value = this.flowParseObjectTypeMethodish(\n          this.startNodeAt(node.start, node.loc.start),\n        );\n      } else {\n        node.method = false;\n        if (this.eat(tt.question)) {\n          node.optional = true;\n        }\n        node.value = this.flowParseTypeInitialiser();\n      }\n      return this.finishNode(node, \"ObjectTypeInternalSlot\");\n    }\n\n    flowParseObjectTypeMethodish(\n      node: N.FlowFunctionTypeAnnotation,\n    ): N.FlowFunctionTypeAnnotation {\n      node.params = [];\n      node.rest = null;\n      node.typeParameters = null;\n      node.this = null;\n\n      if (this.isRelational(\"<\")) {\n        node.typeParameters = this.flowParseTypeParameterDeclaration();\n      }\n\n      this.expect(tt.parenL);\n      if (this.match(tt._this)) {\n        node.this = this.flowParseFunctionTypeParam(/* first */ true);\n        // match Flow parser behavior\n        node.this.name = null;\n        if (!this.match(tt.parenR)) {\n          this.expect(tt.comma);\n        }\n      }\n      while (!this.match(tt.parenR) && !this.match(tt.ellipsis)) {\n        node.params.push(this.flowParseFunctionTypeParam(false));\n        if (!this.match(tt.parenR)) {\n          this.expect(tt.comma);\n        }\n      }\n\n      if (this.eat(tt.ellipsis)) {\n        node.rest = this.flowParseFunctionTypeParam(false);\n      }\n      this.expect(tt.parenR);\n      node.returnType = this.flowParseTypeInitialiser();\n\n      return this.finishNode(node, \"FunctionTypeAnnotation\");\n    }\n\n    flowParseObjectTypeCallProperty(\n      node: N.FlowObjectTypeCallProperty,\n      isStatic: boolean,\n    ): N.FlowObjectTypeCallProperty {\n      const valueNode = this.startNode();\n      node.static = isStatic;\n      node.value = this.flowParseObjectTypeMethodish(valueNode);\n      return this.finishNode(node, \"ObjectTypeCallProperty\");\n    }\n\n    flowParseObjectType({\n      allowStatic,\n      allowExact,\n      allowSpread,\n      allowProto,\n      allowInexact,\n    }: {\n      allowStatic: boolean,\n      allowExact: boolean,\n      allowSpread: boolean,\n      allowProto: boolean,\n      allowInexact: boolean,\n    }): N.FlowObjectTypeAnnotation {\n      const oldInType = this.state.inType;\n      this.state.inType = true;\n\n      const nodeStart = this.startNode();\n\n      nodeStart.callProperties = [];\n      nodeStart.properties = [];\n      nodeStart.indexers = [];\n      nodeStart.internalSlots = [];\n\n      let endDelim;\n      let exact;\n      let inexact = false;\n      if (allowExact && this.match(tt.braceBarL)) {\n        this.expect(tt.braceBarL);\n        endDelim = tt.braceBarR;\n        exact = true;\n      } else {\n        this.expect(tt.braceL);\n        endDelim = tt.braceR;\n        exact = false;\n      }\n\n      nodeStart.exact = exact;\n\n      while (!this.match(endDelim)) {\n        let isStatic = false;\n        let protoStart: ?number = null;\n        let inexactStart: ?number = null;\n        const node = this.startNode();\n\n        if (allowProto && this.isContextual(\"proto\")) {\n          const lookahead = this.lookahead();\n\n          if (lookahead.type !== tt.colon && lookahead.type !== tt.question) {\n            this.next();\n            protoStart = this.state.start;\n            allowStatic = false;\n          }\n        }\n\n        if (allowStatic && this.isContextual(\"static\")) {\n          const lookahead = this.lookahead();\n\n          // static is a valid identifier name\n          if (lookahead.type !== tt.colon && lookahead.type !== tt.question) {\n            this.next();\n            isStatic = true;\n          }\n        }\n\n        const variance = this.flowParseVariance();\n\n        if (this.eat(tt.bracketL)) {\n          if (protoStart != null) {\n            this.unexpected(protoStart);\n          }\n          if (this.eat(tt.bracketL)) {\n            if (variance) {\n              this.unexpected(variance.start);\n            }\n            nodeStart.internalSlots.push(\n              this.flowParseObjectTypeInternalSlot(node, isStatic),\n            );\n          } else {\n            nodeStart.indexers.push(\n              this.flowParseObjectTypeIndexer(node, isStatic, variance),\n            );\n          }\n        } else if (this.match(tt.parenL) || this.isRelational(\"<\")) {\n          if (protoStart != null) {\n            this.unexpected(protoStart);\n          }\n          if (variance) {\n            this.unexpected(variance.start);\n          }\n          nodeStart.callProperties.push(\n            this.flowParseObjectTypeCallProperty(node, isStatic),\n          );\n        } else {\n          let kind = \"init\";\n\n          if (this.isContextual(\"get\") || this.isContextual(\"set\")) {\n            const lookahead = this.lookahead();\n            if (\n              lookahead.type === tt.name ||\n              lookahead.type === tt.string ||\n              lookahead.type === tt.num\n            ) {\n              kind = this.state.value;\n              this.next();\n            }\n          }\n\n          const propOrInexact = this.flowParseObjectTypeProperty(\n            node,\n            isStatic,\n            protoStart,\n            variance,\n            kind,\n            allowSpread,\n            allowInexact ?? !exact,\n          );\n\n          if (propOrInexact === null) {\n            inexact = true;\n            inexactStart = this.state.lastTokStart;\n          } else {\n            nodeStart.properties.push(propOrInexact);\n          }\n        }\n\n        this.flowObjectTypeSemicolon();\n\n        if (\n          inexactStart &&\n          !this.match(tt.braceR) &&\n          !this.match(tt.braceBarR)\n        ) {\n          this.raise(\n            inexactStart,\n            FlowErrors.UnexpectedExplicitInexactInObject,\n          );\n        }\n      }\n\n      this.expect(endDelim);\n\n      /* The inexact flag should only be added on ObjectTypeAnnotations that\n       * are not the body of an interface, declare interface, or declare class.\n       * Since spreads are only allowed in object types, checking that is\n       * sufficient here.\n       */\n      if (allowSpread) {\n        nodeStart.inexact = inexact;\n      }\n\n      const out = this.finishNode(nodeStart, \"ObjectTypeAnnotation\");\n\n      this.state.inType = oldInType;\n\n      return out;\n    }\n\n    flowParseObjectTypeProperty(\n      node: N.FlowObjectTypeProperty | N.FlowObjectTypeSpreadProperty,\n      isStatic: boolean,\n      protoStart: ?number,\n      variance: ?N.FlowVariance,\n      kind: string,\n      allowSpread: boolean,\n      allowInexact: boolean,\n    ): (N.FlowObjectTypeProperty | N.FlowObjectTypeSpreadProperty) | null {\n      if (this.eat(tt.ellipsis)) {\n        const isInexactToken =\n          this.match(tt.comma) ||\n          this.match(tt.semi) ||\n          this.match(tt.braceR) ||\n          this.match(tt.braceBarR);\n\n        if (isInexactToken) {\n          if (!allowSpread) {\n            this.raise(\n              this.state.lastTokStart,\n              FlowErrors.InexactInsideNonObject,\n            );\n          } else if (!allowInexact) {\n            this.raise(this.state.lastTokStart, FlowErrors.InexactInsideExact);\n          }\n          if (variance) {\n            this.raise(variance.start, FlowErrors.InexactVariance);\n          }\n\n          return null;\n        }\n\n        if (!allowSpread) {\n          this.raise(this.state.lastTokStart, FlowErrors.UnexpectedSpreadType);\n        }\n        if (protoStart != null) {\n          this.unexpected(protoStart);\n        }\n        if (variance) {\n          this.raise(variance.start, FlowErrors.SpreadVariance);\n        }\n\n        node.argument = this.flowParseType();\n        return this.finishNode(node, \"ObjectTypeSpreadProperty\");\n      } else {\n        node.key = this.flowParseObjectPropertyKey();\n        node.static = isStatic;\n        node.proto = protoStart != null;\n        node.kind = kind;\n\n        let optional = false;\n        if (this.isRelational(\"<\") || this.match(tt.parenL)) {\n          // This is a method property\n          node.method = true;\n\n          if (protoStart != null) {\n            this.unexpected(protoStart);\n          }\n          if (variance) {\n            this.unexpected(variance.start);\n          }\n\n          node.value = this.flowParseObjectTypeMethodish(\n            this.startNodeAt(node.start, node.loc.start),\n          );\n          if (kind === \"get\" || kind === \"set\") {\n            this.flowCheckGetterSetterParams(node);\n          }\n          /** Declared classes/interfaces do not allow spread */\n          if (\n            !allowSpread &&\n            node.key.name === \"constructor\" &&\n            node.value.this\n          ) {\n            this.raise(\n              node.value.this.start,\n              FlowErrors.ThisParamBannedInConstructor,\n            );\n          }\n        } else {\n          if (kind !== \"init\") this.unexpected();\n\n          node.method = false;\n\n          if (this.eat(tt.question)) {\n            optional = true;\n          }\n          node.value = this.flowParseTypeInitialiser();\n          node.variance = variance;\n        }\n\n        node.optional = optional;\n\n        return this.finishNode(node, \"ObjectTypeProperty\");\n      }\n    }\n\n    // This is similar to checkGetterSetterParams, but as\n    // @babel/parser uses non estree properties we cannot reuse it here\n    flowCheckGetterSetterParams(\n      property: N.FlowObjectTypeProperty | N.FlowObjectTypeSpreadProperty,\n    ): void {\n      const paramCount = property.kind === \"get\" ? 0 : 1;\n      const start = property.start;\n      const length =\n        property.value.params.length + (property.value.rest ? 1 : 0);\n\n      if (property.value.this) {\n        this.raise(\n          property.value.this.start,\n          property.kind === \"get\"\n            ? FlowErrors.GetterMayNotHaveThisParam\n            : FlowErrors.SetterMayNotHaveThisParam,\n        );\n      }\n\n      if (length !== paramCount) {\n        if (property.kind === \"get\") {\n          this.raise(start, Errors.BadGetterArity);\n        } else {\n          this.raise(start, Errors.BadSetterArity);\n        }\n      }\n\n      if (property.kind === \"set\" && property.value.rest) {\n        this.raise(start, Errors.BadSetterRestParameter);\n      }\n    }\n\n    flowObjectTypeSemicolon(): void {\n      if (\n        !this.eat(tt.semi) &&\n        !this.eat(tt.comma) &&\n        !this.match(tt.braceR) &&\n        !this.match(tt.braceBarR)\n      ) {\n        this.unexpected();\n      }\n    }\n\n    flowParseQualifiedTypeIdentifier(\n      startPos?: number,\n      startLoc?: Position,\n      id?: N.Identifier,\n    ): N.FlowQualifiedTypeIdentifier {\n      startPos = startPos || this.state.start;\n      startLoc = startLoc || this.state.startLoc;\n      let node = id || this.flowParseRestrictedIdentifier(true);\n\n      while (this.eat(tt.dot)) {\n        const node2 = this.startNodeAt(startPos, startLoc);\n        node2.qualification = node;\n        node2.id = this.flowParseRestrictedIdentifier(true);\n        node = this.finishNode(node2, \"QualifiedTypeIdentifier\");\n      }\n\n      return node;\n    }\n\n    flowParseGenericType(\n      startPos: number,\n      startLoc: Position,\n      id: N.Identifier,\n    ): N.FlowGenericTypeAnnotation {\n      const node = this.startNodeAt(startPos, startLoc);\n\n      node.typeParameters = null;\n      node.id = this.flowParseQualifiedTypeIdentifier(startPos, startLoc, id);\n\n      if (this.isRelational(\"<\")) {\n        node.typeParameters = this.flowParseTypeParameterInstantiation();\n      }\n\n      return this.finishNode(node, \"GenericTypeAnnotation\");\n    }\n\n    flowParseTypeofType(): N.FlowTypeofTypeAnnotation {\n      const node = this.startNode();\n      this.expect(tt._typeof);\n      node.argument = this.flowParsePrimaryType();\n      return this.finishNode(node, \"TypeofTypeAnnotation\");\n    }\n\n    flowParseTupleType(): N.FlowTupleTypeAnnotation {\n      const node = this.startNode();\n      node.types = [];\n      this.expect(tt.bracketL);\n      // We allow trailing commas\n      while (this.state.pos < this.length && !this.match(tt.bracketR)) {\n        node.types.push(this.flowParseType());\n        if (this.match(tt.bracketR)) break;\n        this.expect(tt.comma);\n      }\n      this.expect(tt.bracketR);\n      return this.finishNode(node, \"TupleTypeAnnotation\");\n    }\n\n    flowParseFunctionTypeParam(first: boolean): N.FlowFunctionTypeParam {\n      let name = null;\n      let optional = false;\n      let typeAnnotation = null;\n      const node = this.startNode();\n      const lh = this.lookahead();\n      const isThis = this.state.type === tt._this;\n\n      if (lh.type === tt.colon || lh.type === tt.question) {\n        if (isThis && !first) {\n          this.raise(node.start, FlowErrors.ThisParamMustBeFirst);\n        }\n        name = this.parseIdentifier(isThis);\n        if (this.eat(tt.question)) {\n          optional = true;\n          if (isThis) {\n            this.raise(node.start, FlowErrors.ThisParamMayNotBeOptional);\n          }\n        }\n        typeAnnotation = this.flowParseTypeInitialiser();\n      } else {\n        typeAnnotation = this.flowParseType();\n      }\n      node.name = name;\n      node.optional = optional;\n      node.typeAnnotation = typeAnnotation;\n      return this.finishNode(node, \"FunctionTypeParam\");\n    }\n\n    reinterpretTypeAsFunctionTypeParam(\n      type: N.FlowType,\n    ): N.FlowFunctionTypeParam {\n      const node = this.startNodeAt(type.start, type.loc.start);\n      node.name = null;\n      node.optional = false;\n      node.typeAnnotation = type;\n      return this.finishNode(node, \"FunctionTypeParam\");\n    }\n\n    flowParseFunctionTypeParams(params: N.FlowFunctionTypeParam[] = []): {\n      params: N.FlowFunctionTypeParam[],\n      rest: ?N.FlowFunctionTypeParam,\n      _this: ?N.FlowFunctionTypeParam,\n    } {\n      let rest: ?N.FlowFunctionTypeParam = null;\n      let _this: ?N.FlowFunctionTypeParam = null;\n      if (this.match(tt._this)) {\n        _this = this.flowParseFunctionTypeParam(/* first */ true);\n        // match Flow parser behavior\n        _this.name = null;\n        if (!this.match(tt.parenR)) {\n          this.expect(tt.comma);\n        }\n      }\n      while (!this.match(tt.parenR) && !this.match(tt.ellipsis)) {\n        params.push(this.flowParseFunctionTypeParam(false));\n        if (!this.match(tt.parenR)) {\n          this.expect(tt.comma);\n        }\n      }\n      if (this.eat(tt.ellipsis)) {\n        rest = this.flowParseFunctionTypeParam(false);\n      }\n      return { params, rest, _this };\n    }\n\n    flowIdentToTypeAnnotation(\n      startPos: number,\n      startLoc: Position,\n      node: N.FlowTypeAnnotation,\n      id: N.Identifier,\n    ): N.FlowTypeAnnotation {\n      switch (id.name) {\n        case \"any\":\n          return this.finishNode(node, \"AnyTypeAnnotation\");\n\n        case \"bool\":\n        case \"boolean\":\n          return this.finishNode(node, \"BooleanTypeAnnotation\");\n\n        case \"mixed\":\n          return this.finishNode(node, \"MixedTypeAnnotation\");\n\n        case \"empty\":\n          return this.finishNode(node, \"EmptyTypeAnnotation\");\n\n        case \"number\":\n          return this.finishNode(node, \"NumberTypeAnnotation\");\n\n        case \"string\":\n          return this.finishNode(node, \"StringTypeAnnotation\");\n\n        case \"symbol\":\n          return this.finishNode(node, \"SymbolTypeAnnotation\");\n\n        default:\n          this.checkNotUnderscore(id.name);\n          return this.flowParseGenericType(startPos, startLoc, id);\n      }\n    }\n\n    // The parsing of types roughly parallels the parsing of expressions, and\n    // primary types are kind of like primary expressions...they're the\n    // primitives with which other types are constructed.\n    flowParsePrimaryType(): N.FlowTypeAnnotation {\n      const startPos = this.state.start;\n      const startLoc = this.state.startLoc;\n      const node = this.startNode();\n      let tmp;\n      let type;\n      let isGroupedType = false;\n      const oldNoAnonFunctionType = this.state.noAnonFunctionType;\n\n      switch (this.state.type) {\n        case tt.name:\n          if (this.isContextual(\"interface\")) {\n            return this.flowParseInterfaceType();\n          }\n\n          return this.flowIdentToTypeAnnotation(\n            startPos,\n            startLoc,\n            node,\n            this.parseIdentifier(),\n          );\n\n        case tt.braceL:\n          return this.flowParseObjectType({\n            allowStatic: false,\n            allowExact: false,\n            allowSpread: true,\n            allowProto: false,\n            allowInexact: true,\n          });\n\n        case tt.braceBarL:\n          return this.flowParseObjectType({\n            allowStatic: false,\n            allowExact: true,\n            allowSpread: true,\n            allowProto: false,\n            allowInexact: false,\n          });\n\n        case tt.bracketL:\n          this.state.noAnonFunctionType = false;\n          type = this.flowParseTupleType();\n          this.state.noAnonFunctionType = oldNoAnonFunctionType;\n          return type;\n\n        case tt.relational:\n          if (this.state.value === \"<\") {\n            node.typeParameters = this.flowParseTypeParameterDeclaration();\n            this.expect(tt.parenL);\n            tmp = this.flowParseFunctionTypeParams();\n            node.params = tmp.params;\n            node.rest = tmp.rest;\n            node.this = tmp._this;\n            this.expect(tt.parenR);\n\n            this.expect(tt.arrow);\n\n            node.returnType = this.flowParseType();\n\n            return this.finishNode(node, \"FunctionTypeAnnotation\");\n          }\n          break;\n\n        case tt.parenL:\n          this.next();\n\n          // Check to see if this is actually a grouped type\n          if (!this.match(tt.parenR) && !this.match(tt.ellipsis)) {\n            if (this.match(tt.name) || this.match(tt._this)) {\n              const token = this.lookahead().type;\n              isGroupedType = token !== tt.question && token !== tt.colon;\n            } else {\n              isGroupedType = true;\n            }\n          }\n\n          if (isGroupedType) {\n            this.state.noAnonFunctionType = false;\n            type = this.flowParseType();\n            this.state.noAnonFunctionType = oldNoAnonFunctionType;\n\n            // A `,` or a `) =>` means this is an anonymous function type\n            if (\n              this.state.noAnonFunctionType ||\n              !(\n                this.match(tt.comma) ||\n                (this.match(tt.parenR) && this.lookahead().type === tt.arrow)\n              )\n            ) {\n              this.expect(tt.parenR);\n              return type;\n            } else {\n              // Eat a comma if there is one\n              this.eat(tt.comma);\n            }\n          }\n\n          if (type) {\n            tmp = this.flowParseFunctionTypeParams([\n              this.reinterpretTypeAsFunctionTypeParam(type),\n            ]);\n          } else {\n            tmp = this.flowParseFunctionTypeParams();\n          }\n\n          node.params = tmp.params;\n          node.rest = tmp.rest;\n          node.this = tmp._this;\n\n          this.expect(tt.parenR);\n\n          this.expect(tt.arrow);\n\n          node.returnType = this.flowParseType();\n\n          node.typeParameters = null;\n\n          return this.finishNode(node, \"FunctionTypeAnnotation\");\n\n        case tt.string:\n          return this.parseLiteral<N.StringLiteralTypeAnnotation>(\n            this.state.value,\n            \"StringLiteralTypeAnnotation\",\n          );\n\n        case tt._true:\n        case tt._false:\n          node.value = this.match(tt._true);\n          this.next();\n          return this.finishNode<N.BooleanLiteralTypeAnnotation>(\n            node,\n            \"BooleanLiteralTypeAnnotation\",\n          );\n\n        case tt.plusMin:\n          if (this.state.value === \"-\") {\n            this.next();\n            if (this.match(tt.num)) {\n              return this.parseLiteralAtNode<N.NumberLiteralTypeAnnotation>(\n                -this.state.value,\n                \"NumberLiteralTypeAnnotation\",\n                node,\n              );\n            }\n\n            if (this.match(tt.bigint)) {\n              return this.parseLiteralAtNode<N.BigIntLiteralTypeAnnotation>(\n                -this.state.value,\n                \"BigIntLiteralTypeAnnotation\",\n                node,\n              );\n            }\n\n            throw this.raise(\n              this.state.start,\n              FlowErrors.UnexpectedSubtractionOperand,\n            );\n          }\n\n          throw this.unexpected();\n        case tt.num:\n          return this.parseLiteral(\n            this.state.value,\n            \"NumberLiteralTypeAnnotation\",\n          );\n\n        case tt.bigint:\n          return this.parseLiteral(\n            this.state.value,\n            \"BigIntLiteralTypeAnnotation\",\n          );\n\n        case tt._void:\n          this.next();\n          return this.finishNode(node, \"VoidTypeAnnotation\");\n\n        case tt._null:\n          this.next();\n          return this.finishNode(node, \"NullLiteralTypeAnnotation\");\n\n        case tt._this:\n          this.next();\n          return this.finishNode(node, \"ThisTypeAnnotation\");\n\n        case tt.star:\n          this.next();\n          return this.finishNode(node, \"ExistsTypeAnnotation\");\n\n        default:\n          if (this.state.type.keyword === \"typeof\") {\n            return this.flowParseTypeofType();\n          } else if (this.state.type.keyword) {\n            const label = this.state.type.label;\n            this.next();\n            return super.createIdentifier(node, label);\n          }\n      }\n\n      throw this.unexpected();\n    }\n\n    flowParsePostfixType(): N.FlowTypeAnnotation {\n      const startPos = this.state.start;\n      const startLoc = this.state.startLoc;\n      let type = this.flowParsePrimaryType();\n      let seenOptionalIndexedAccess = false;\n      while (\n        (this.match(tt.bracketL) || this.match(tt.questionDot)) &&\n        !this.canInsertSemicolon()\n      ) {\n        const node = this.startNodeAt(startPos, startLoc);\n        const optional = this.eat(tt.questionDot);\n        seenOptionalIndexedAccess = seenOptionalIndexedAccess || optional;\n        this.expect(tt.bracketL);\n        if (!optional && this.match(tt.bracketR)) {\n          node.elementType = type;\n          this.next(); // eat `]`\n          type = this.finishNode(node, \"ArrayTypeAnnotation\");\n        } else {\n          node.objectType = type;\n          node.indexType = this.flowParseType();\n          this.expect(tt.bracketR);\n          if (seenOptionalIndexedAccess) {\n            node.optional = optional;\n            type = this.finishNode<N.FlowOptionalIndexedAccessType>(\n              node,\n              \"OptionalIndexedAccessType\",\n            );\n          } else {\n            type = this.finishNode<N.FlowIndexedAccessType>(\n              node,\n              \"IndexedAccessType\",\n            );\n          }\n        }\n      }\n      return type;\n    }\n\n    flowParsePrefixType(): N.FlowTypeAnnotation {\n      const node = this.startNode();\n      if (this.eat(tt.question)) {\n        node.typeAnnotation = this.flowParsePrefixType();\n        return this.finishNode(node, \"NullableTypeAnnotation\");\n      } else {\n        return this.flowParsePostfixType();\n      }\n    }\n\n    flowParseAnonFunctionWithoutParens(): N.FlowTypeAnnotation {\n      const param = this.flowParsePrefixType();\n      if (!this.state.noAnonFunctionType && this.eat(tt.arrow)) {\n        // TODO: This should be a type error. Passing in a SourceLocation, and it expects a Position.\n        const node = this.startNodeAt(param.start, param.loc.start);\n        node.params = [this.reinterpretTypeAsFunctionTypeParam(param)];\n        node.rest = null;\n        node.this = null;\n        node.returnType = this.flowParseType();\n        node.typeParameters = null;\n        return this.finishNode(node, \"FunctionTypeAnnotation\");\n      }\n      return param;\n    }\n\n    flowParseIntersectionType(): N.FlowTypeAnnotation {\n      const node = this.startNode();\n      this.eat(tt.bitwiseAND);\n      const type = this.flowParseAnonFunctionWithoutParens();\n      node.types = [type];\n      while (this.eat(tt.bitwiseAND)) {\n        node.types.push(this.flowParseAnonFunctionWithoutParens());\n      }\n      return node.types.length === 1\n        ? type\n        : this.finishNode(node, \"IntersectionTypeAnnotation\");\n    }\n\n    flowParseUnionType(): N.FlowTypeAnnotation {\n      const node = this.startNode();\n      this.eat(tt.bitwiseOR);\n      const type = this.flowParseIntersectionType();\n      node.types = [type];\n      while (this.eat(tt.bitwiseOR)) {\n        node.types.push(this.flowParseIntersectionType());\n      }\n      return node.types.length === 1\n        ? type\n        : this.finishNode(node, \"UnionTypeAnnotation\");\n    }\n\n    flowParseType(): N.FlowTypeAnnotation {\n      const oldInType = this.state.inType;\n      this.state.inType = true;\n      const type = this.flowParseUnionType();\n      this.state.inType = oldInType;\n      return type;\n    }\n\n    flowParseTypeOrImplicitInstantiation(): N.FlowTypeAnnotation {\n      if (this.state.type === tt.name && this.state.value === \"_\") {\n        const startPos = this.state.start;\n        const startLoc = this.state.startLoc;\n        const node = this.parseIdentifier();\n        return this.flowParseGenericType(startPos, startLoc, node);\n      } else {\n        return this.flowParseType();\n      }\n    }\n\n    flowParseTypeAnnotation(): N.FlowTypeAnnotation {\n      const node = this.startNode();\n      node.typeAnnotation = this.flowParseTypeInitialiser();\n      return this.finishNode(node, \"TypeAnnotation\");\n    }\n\n    flowParseTypeAnnotatableIdentifier(\n      allowPrimitiveOverride?: boolean,\n    ): N.Identifier {\n      const ident = allowPrimitiveOverride\n        ? this.parseIdentifier()\n        : this.flowParseRestrictedIdentifier();\n      if (this.match(tt.colon)) {\n        ident.typeAnnotation = this.flowParseTypeAnnotation();\n        this.resetEndLocation(ident);\n      }\n      return ident;\n    }\n\n    typeCastToParameter(node: N.Node): N.Node {\n      node.expression.typeAnnotation = node.typeAnnotation;\n\n      this.resetEndLocation(\n        node.expression,\n        node.typeAnnotation.end,\n        node.typeAnnotation.loc.end,\n      );\n\n      return node.expression;\n    }\n\n    flowParseVariance(): ?N.FlowVariance {\n      let variance = null;\n      if (this.match(tt.plusMin)) {\n        variance = this.startNode();\n        if (this.state.value === \"+\") {\n          variance.kind = \"plus\";\n        } else {\n          variance.kind = \"minus\";\n        }\n        this.next();\n        this.finishNode(variance, \"Variance\");\n      }\n      return variance;\n    }\n\n    // ==================================\n    // Overrides\n    // ==================================\n\n    parseFunctionBody(\n      node: N.Function,\n      allowExpressionBody: ?boolean,\n      isMethod?: boolean = false,\n    ): void {\n      if (allowExpressionBody) {\n        return this.forwardNoArrowParamsConversionAt(node, () =>\n          super.parseFunctionBody(node, true, isMethod),\n        );\n      }\n\n      return super.parseFunctionBody(node, false, isMethod);\n    }\n\n    parseFunctionBodyAndFinish(\n      node: N.BodilessFunctionOrMethodBase,\n      type: string,\n      isMethod?: boolean = false,\n    ): void {\n      if (this.match(tt.colon)) {\n        const typeNode = this.startNode();\n\n        [\n          // $FlowFixMe (destructuring not supported yet)\n          typeNode.typeAnnotation,\n          // $FlowFixMe (destructuring not supported yet)\n          node.predicate,\n        ] = this.flowParseTypeAndPredicateInitialiser();\n\n        node.returnType = typeNode.typeAnnotation\n          ? this.finishNode(typeNode, \"TypeAnnotation\")\n          : null;\n      }\n\n      super.parseFunctionBodyAndFinish(node, type, isMethod);\n    }\n\n    // interfaces and enums\n    parseStatement(context: ?string, topLevel?: boolean): N.Statement {\n      // strict mode handling of `interface` since it's a reserved word\n      if (\n        this.state.strict &&\n        this.match(tt.name) &&\n        this.state.value === \"interface\"\n      ) {\n        const lookahead = this.lookahead();\n        if (lookahead.type === tt.name || isKeyword(lookahead.value)) {\n          const node = this.startNode();\n          this.next();\n          return this.flowParseInterface(node);\n        }\n      } else if (this.shouldParseEnums() && this.isContextual(\"enum\")) {\n        const node = this.startNode();\n        this.next();\n        return this.flowParseEnumDeclaration(node);\n      }\n      const stmt = super.parseStatement(context, topLevel);\n      // We will parse a flow pragma in any comment before the first statement.\n      if (this.flowPragma === undefined && !this.isValidDirective(stmt)) {\n        this.flowPragma = null;\n      }\n      return stmt;\n    }\n\n    // declares, interfaces and type aliases\n    parseExpressionStatement(\n      node: N.ExpressionStatement,\n      expr: N.Expression,\n    ): N.ExpressionStatement {\n      if (expr.type === \"Identifier\") {\n        if (expr.name === \"declare\") {\n          if (\n            this.match(tt._class) ||\n            this.match(tt.name) ||\n            this.match(tt._function) ||\n            this.match(tt._var) ||\n            this.match(tt._export)\n          ) {\n            return this.flowParseDeclare(node);\n          }\n        } else if (this.match(tt.name)) {\n          if (expr.name === \"interface\") {\n            return this.flowParseInterface(node);\n          } else if (expr.name === \"type\") {\n            return this.flowParseTypeAlias(node);\n          } else if (expr.name === \"opaque\") {\n            return this.flowParseOpaqueType(node, false);\n          }\n        }\n      }\n\n      return super.parseExpressionStatement(node, expr);\n    }\n\n    // export type\n    shouldParseExportDeclaration(): boolean {\n      return (\n        this.isContextual(\"type\") ||\n        this.isContextual(\"interface\") ||\n        this.isContextual(\"opaque\") ||\n        (this.shouldParseEnums() && this.isContextual(\"enum\")) ||\n        super.shouldParseExportDeclaration()\n      );\n    }\n\n    isExportDefaultSpecifier(): boolean {\n      if (\n        this.match(tt.name) &&\n        (this.state.value === \"type\" ||\n          this.state.value === \"interface\" ||\n          this.state.value === \"opaque\" ||\n          (this.shouldParseEnums() && this.state.value === \"enum\"))\n      ) {\n        return false;\n      }\n\n      return super.isExportDefaultSpecifier();\n    }\n\n    parseExportDefaultExpression(): N.Expression | N.Declaration {\n      if (this.shouldParseEnums() && this.isContextual(\"enum\")) {\n        const node = this.startNode();\n        this.next();\n        return this.flowParseEnumDeclaration(node);\n      }\n      return super.parseExportDefaultExpression();\n    }\n\n    parseConditional(\n      expr: N.Expression,\n      startPos: number,\n      startLoc: Position,\n      refNeedsArrowPos?: ?Pos,\n    ): N.Expression {\n      if (!this.match(tt.question)) return expr;\n\n      // only use the expensive \"tryParse\" method if there is a question mark\n      // and if we come from inside parens\n      if (refNeedsArrowPos) {\n        const result = this.tryParse(() =>\n          super.parseConditional(expr, startPos, startLoc),\n        );\n\n        if (!result.node) {\n          // $FlowIgnore\n          refNeedsArrowPos.start = result.error.pos || this.state.start;\n          return expr;\n        }\n\n        if (result.error) this.state = result.failState;\n        return result.node;\n      }\n\n      this.expect(tt.question);\n      const state = this.state.clone();\n      const originalNoArrowAt = this.state.noArrowAt;\n      const node = this.startNodeAt(startPos, startLoc);\n      let { consequent, failed } = this.tryParseConditionalConsequent();\n      let [valid, invalid] = this.getArrowLikeExpressions(consequent);\n\n      if (failed || invalid.length > 0) {\n        const noArrowAt = [...originalNoArrowAt];\n\n        if (invalid.length > 0) {\n          this.state = state;\n          this.state.noArrowAt = noArrowAt;\n\n          for (let i = 0; i < invalid.length; i++) {\n            noArrowAt.push(invalid[i].start);\n          }\n\n          ({ consequent, failed } = this.tryParseConditionalConsequent());\n          [valid, invalid] = this.getArrowLikeExpressions(consequent);\n        }\n\n        if (failed && valid.length > 1) {\n          // if there are two or more possible correct ways of parsing, throw an\n          // error.\n          // e.g.   Source: a ? (b): c => (d): e => f\n          //      Result 1: a ? b : (c => ((d): e => f))\n          //      Result 2: a ? ((b): c => d) : (e => f)\n          this.raise(state.start, FlowErrors.AmbiguousConditionalArrow);\n        }\n\n        if (failed && valid.length === 1) {\n          this.state = state;\n          this.state.noArrowAt = noArrowAt.concat(valid[0].start);\n          ({ consequent, failed } = this.tryParseConditionalConsequent());\n        }\n      }\n\n      this.getArrowLikeExpressions(consequent, true);\n\n      this.state.noArrowAt = originalNoArrowAt;\n      this.expect(tt.colon);\n\n      node.test = expr;\n      node.consequent = consequent;\n      node.alternate = this.forwardNoArrowParamsConversionAt(node, () =>\n        this.parseMaybeAssign(undefined, undefined, undefined),\n      );\n\n      return this.finishNode(node, \"ConditionalExpression\");\n    }\n\n    tryParseConditionalConsequent(): {\n      consequent: N.Expression,\n      failed: boolean,\n    } {\n      this.state.noArrowParamsConversionAt.push(this.state.start);\n\n      const consequent = this.parseMaybeAssignAllowIn();\n      const failed = !this.match(tt.colon);\n\n      this.state.noArrowParamsConversionAt.pop();\n\n      return { consequent, failed };\n    }\n\n    // Given an expression, walks through out its arrow functions whose body is\n    // an expression and through out conditional expressions. It returns every\n    // function which has been parsed with a return type but could have been\n    // parenthesized expressions.\n    // These functions are separated into two arrays: one containing the ones\n    // whose parameters can be converted to assignable lists, one containing the\n    // others.\n    getArrowLikeExpressions(\n      node: N.Expression,\n      disallowInvalid?: boolean,\n    ): [N.ArrowFunctionExpression[], N.ArrowFunctionExpression[]] {\n      const stack = [node];\n      const arrows: N.ArrowFunctionExpression[] = [];\n\n      while (stack.length !== 0) {\n        const node = stack.pop();\n        if (node.type === \"ArrowFunctionExpression\") {\n          if (node.typeParameters || !node.returnType) {\n            // This is an arrow expression without ambiguity, so check its parameters\n            this.finishArrowValidation(node);\n          } else {\n            arrows.push(node);\n          }\n          stack.push(node.body);\n        } else if (node.type === \"ConditionalExpression\") {\n          stack.push(node.consequent);\n          stack.push(node.alternate);\n        }\n      }\n\n      if (disallowInvalid) {\n        arrows.forEach(node => this.finishArrowValidation(node));\n        return [arrows, []];\n      }\n\n      return partition(arrows, node =>\n        node.params.every(param => this.isAssignable(param, true)),\n      );\n    }\n\n    finishArrowValidation(node: N.ArrowFunctionExpression) {\n      this.toAssignableList(\n        // node.params is Expression[] instead of $ReadOnlyArray<Pattern> because it\n        // has not been converted yet.\n        ((node.params: any): N.Expression[]),\n        node.extra?.trailingComma,\n        /* isLHS */ false,\n      );\n      // Enter scope, as checkParams defines bindings\n      this.scope.enter(SCOPE_FUNCTION | SCOPE_ARROW);\n      // Use super's method to force the parameters to be checked\n      super.checkParams(node, false, true);\n      this.scope.exit();\n    }\n\n    forwardNoArrowParamsConversionAt<T>(node: N.Node, parse: () => T): T {\n      let result: T;\n      if (this.state.noArrowParamsConversionAt.indexOf(node.start) !== -1) {\n        this.state.noArrowParamsConversionAt.push(this.state.start);\n        result = parse();\n        this.state.noArrowParamsConversionAt.pop();\n      } else {\n        result = parse();\n      }\n\n      return result;\n    }\n\n    parseParenItem(\n      node: N.Expression,\n      startPos: number,\n      startLoc: Position,\n    ): N.Expression {\n      node = super.parseParenItem(node, startPos, startLoc);\n      if (this.eat(tt.question)) {\n        node.optional = true;\n        // Include questionmark in location of node\n        // Don't use this.finishNode() as otherwise we might process comments twice and\n        // include already consumed parens\n        this.resetEndLocation(node);\n      }\n\n      if (this.match(tt.colon)) {\n        const typeCastNode = this.startNodeAt(startPos, startLoc);\n        typeCastNode.expression = node;\n        typeCastNode.typeAnnotation = this.flowParseTypeAnnotation();\n\n        return this.finishNode(typeCastNode, \"TypeCastExpression\");\n      }\n\n      return node;\n    }\n\n    assertModuleNodeAllowed(node: N.Node) {\n      if (\n        (node.type === \"ImportDeclaration\" &&\n          (node.importKind === \"type\" || node.importKind === \"typeof\")) ||\n        (node.type === \"ExportNamedDeclaration\" &&\n          node.exportKind === \"type\") ||\n        (node.type === \"ExportAllDeclaration\" && node.exportKind === \"type\")\n      ) {\n        // Allow Flowtype imports and exports in all conditions because\n        // Flow itself does not care about 'sourceType'.\n        return;\n      }\n\n      super.assertModuleNodeAllowed(node);\n    }\n\n    parseExport(node: N.Node): N.AnyExport {\n      const decl = super.parseExport(node);\n      if (\n        decl.type === \"ExportNamedDeclaration\" ||\n        decl.type === \"ExportAllDeclaration\"\n      ) {\n        decl.exportKind = decl.exportKind || \"value\";\n      }\n      return decl;\n    }\n\n    parseExportDeclaration(node: N.ExportNamedDeclaration): ?N.Declaration {\n      if (this.isContextual(\"type\")) {\n        node.exportKind = \"type\";\n\n        const declarationNode = this.startNode();\n        this.next();\n\n        if (this.match(tt.braceL)) {\n          // export type { foo, bar };\n          node.specifiers = this.parseExportSpecifiers();\n          this.parseExportFrom(node);\n          return null;\n        } else {\n          // export type Foo = Bar;\n          return this.flowParseTypeAlias(declarationNode);\n        }\n      } else if (this.isContextual(\"opaque\")) {\n        node.exportKind = \"type\";\n\n        const declarationNode = this.startNode();\n        this.next();\n        // export opaque type Foo = Bar;\n        return this.flowParseOpaqueType(declarationNode, false);\n      } else if (this.isContextual(\"interface\")) {\n        node.exportKind = \"type\";\n        const declarationNode = this.startNode();\n        this.next();\n        return this.flowParseInterface(declarationNode);\n      } else if (this.shouldParseEnums() && this.isContextual(\"enum\")) {\n        node.exportKind = \"value\";\n        const declarationNode = this.startNode();\n        this.next();\n        return this.flowParseEnumDeclaration(declarationNode);\n      } else {\n        return super.parseExportDeclaration(node);\n      }\n    }\n\n    eatExportStar(node: N.Node): boolean {\n      if (super.eatExportStar(...arguments)) return true;\n\n      if (this.isContextual(\"type\") && this.lookahead().type === tt.star) {\n        node.exportKind = \"type\";\n        this.next();\n        this.next();\n        return true;\n      }\n\n      return false;\n    }\n\n    maybeParseExportNamespaceSpecifier(node: N.Node): boolean {\n      const pos = this.state.start;\n      const hasNamespace = super.maybeParseExportNamespaceSpecifier(node);\n      if (hasNamespace && node.exportKind === \"type\") {\n        this.unexpected(pos);\n      }\n      return hasNamespace;\n    }\n\n    parseClassId(node: N.Class, isStatement: boolean, optionalId: ?boolean) {\n      super.parseClassId(node, isStatement, optionalId);\n      if (this.isRelational(\"<\")) {\n        node.typeParameters = this.flowParseTypeParameterDeclaration();\n      }\n    }\n\n    parseClassMember(\n      classBody: N.ClassBody,\n      member: any,\n      state: N.ParseClassMemberState,\n    ): void {\n      const pos = this.state.start;\n      if (this.isContextual(\"declare\")) {\n        if (this.parseClassMemberFromModifier(classBody, member)) {\n          // 'declare' is a class element name\n          return;\n        }\n\n        member.declare = true;\n      }\n\n      super.parseClassMember(classBody, member, state);\n\n      if (member.declare) {\n        if (\n          member.type !== \"ClassProperty\" &&\n          member.type !== \"ClassPrivateProperty\" &&\n          member.type !== \"PropertyDefinition\" // Used by estree plugin\n        ) {\n          this.raise(pos, FlowErrors.DeclareClassElement);\n        } else if (member.value) {\n          this.raise(\n            member.value.start,\n            FlowErrors.DeclareClassFieldInitializer,\n          );\n        }\n      }\n    }\n\n    isIterator(word: string): boolean {\n      return word === \"iterator\" || word === \"asyncIterator\";\n    }\n\n    readIterator(): void {\n      const word = super.readWord1();\n      const fullWord = \"@@\" + word;\n\n      // Allow @@iterator and @@asyncIterator as a identifier only inside type\n      if (!this.isIterator(word) || !this.state.inType) {\n        this.raise(this.state.pos, Errors.InvalidIdentifier, fullWord);\n      }\n\n      this.finishToken(tt.name, fullWord);\n    }\n\n    // ensure that inside flow types, we bypass the jsx parser plugin\n    getTokenFromCode(code: number): void {\n      const next = this.input.charCodeAt(this.state.pos + 1);\n      if (code === charCodes.leftCurlyBrace && next === charCodes.verticalBar) {\n        return this.finishOp(tt.braceBarL, 2);\n      } else if (\n        this.state.inType &&\n        (code === charCodes.greaterThan || code === charCodes.lessThan)\n      ) {\n        return this.finishOp(tt.relational, 1);\n      } else if (this.state.inType && code === charCodes.questionMark) {\n        if (next === charCodes.dot) {\n          return this.finishOp(tt.questionDot, 2);\n        }\n        // allow double nullable types in Flow: ??string\n        return this.finishOp(tt.question, 1);\n      } else if (isIteratorStart(code, next)) {\n        this.state.pos += 2; // eat \"@@\"\n        return this.readIterator();\n      } else {\n        return super.getTokenFromCode(code);\n      }\n    }\n\n    isAssignable(node: N.Node, isBinding?: boolean): boolean {\n      switch (node.type) {\n        case \"Identifier\":\n        case \"ObjectPattern\":\n        case \"ArrayPattern\":\n        case \"AssignmentPattern\":\n          return true;\n\n        case \"ObjectExpression\": {\n          const last = node.properties.length - 1;\n          return node.properties.every((prop, i) => {\n            return (\n              prop.type !== \"ObjectMethod\" &&\n              (i === last || prop.type === \"SpreadElement\") &&\n              this.isAssignable(prop)\n            );\n          });\n        }\n\n        case \"ObjectProperty\":\n          return this.isAssignable(node.value);\n\n        case \"SpreadElement\":\n          return this.isAssignable(node.argument);\n\n        case \"ArrayExpression\":\n          return node.elements.every(element => this.isAssignable(element));\n\n        case \"AssignmentExpression\":\n          return node.operator === \"=\";\n\n        case \"ParenthesizedExpression\":\n        case \"TypeCastExpression\":\n          return this.isAssignable(node.expression);\n\n        case \"MemberExpression\":\n        case \"OptionalMemberExpression\":\n          return !isBinding;\n\n        default:\n          return false;\n      }\n    }\n\n    toAssignable(node: N.Node, isLHS: boolean = false): N.Node {\n      if (node.type === \"TypeCastExpression\") {\n        return super.toAssignable(this.typeCastToParameter(node), isLHS);\n      } else {\n        return super.toAssignable(node, isLHS);\n      }\n    }\n\n    // turn type casts that we found in function parameter head into type annotated params\n    toAssignableList(\n      exprList: N.Expression[],\n      trailingCommaPos?: ?number,\n      isLHS: boolean,\n    ): $ReadOnlyArray<N.Pattern> {\n      for (let i = 0; i < exprList.length; i++) {\n        const expr = exprList[i];\n        if (expr?.type === \"TypeCastExpression\") {\n          exprList[i] = this.typeCastToParameter(expr);\n        }\n      }\n      return super.toAssignableList(exprList, trailingCommaPos, isLHS);\n    }\n\n    // this is a list of nodes, from something like a call expression, we need to filter the\n    // type casts that we've found that are illegal in this context\n    toReferencedList(\n      exprList: $ReadOnlyArray<?N.Expression>,\n      isParenthesizedExpr?: boolean,\n    ): $ReadOnlyArray<?N.Expression> {\n      for (let i = 0; i < exprList.length; i++) {\n        const expr = exprList[i];\n        if (\n          expr &&\n          expr.type === \"TypeCastExpression\" &&\n          !expr.extra?.parenthesized &&\n          (exprList.length > 1 || !isParenthesizedExpr)\n        ) {\n          this.raise(expr.typeAnnotation.start, FlowErrors.TypeCastInPattern);\n        }\n      }\n\n      return exprList;\n    }\n\n    parseArrayLike(\n      close: TokenType,\n      canBePattern: boolean,\n      isTuple: boolean,\n      refExpressionErrors: ?ExpressionErrors,\n    ): N.ArrayExpression | N.TupleExpression {\n      const node = super.parseArrayLike(\n        close,\n        canBePattern,\n        isTuple,\n        refExpressionErrors,\n      );\n\n      // This could be an array pattern:\n      //   ([a: string, b: string]) => {}\n      // In this case, we don't have to call toReferencedList. We will\n      // call it, if needed, when we are sure that it is a parenthesized\n      // expression by calling toReferencedListDeep.\n      if (canBePattern && !this.state.maybeInArrowParameters) {\n        this.toReferencedList(node.elements);\n      }\n\n      return node;\n    }\n\n    checkLVal(\n      expr: N.Expression,\n      ...args:\n        | [string, BindingTypes | void]\n        | [\n            string,\n            BindingTypes | void,\n            ?Set<string>,\n            boolean | void,\n            boolean | void,\n          ]\n    ): void {\n      if (expr.type !== \"TypeCastExpression\") {\n        return super.checkLVal(expr, ...args);\n      }\n    }\n\n    // parse class property type annotations\n    parseClassProperty(node: N.ClassProperty): N.ClassProperty {\n      if (this.match(tt.colon)) {\n        node.typeAnnotation = this.flowParseTypeAnnotation();\n      }\n      return super.parseClassProperty(node);\n    }\n\n    parseClassPrivateProperty(\n      node: N.ClassPrivateProperty,\n    ): N.ClassPrivateProperty {\n      if (this.match(tt.colon)) {\n        node.typeAnnotation = this.flowParseTypeAnnotation();\n      }\n      return super.parseClassPrivateProperty(node);\n    }\n\n    // determine whether or not we're currently in the position where a class method would appear\n    isClassMethod(): boolean {\n      return this.isRelational(\"<\") || super.isClassMethod();\n    }\n\n    // determine whether or not we're currently in the position where a class property would appear\n    isClassProperty(): boolean {\n      return this.match(tt.colon) || super.isClassProperty();\n    }\n\n    isNonstaticConstructor(method: N.ClassMethod | N.ClassProperty): boolean {\n      return !this.match(tt.colon) && super.isNonstaticConstructor(method);\n    }\n\n    // parse type parameters for class methods\n    pushClassMethod(\n      classBody: N.ClassBody,\n      method: N.ClassMethod,\n      isGenerator: boolean,\n      isAsync: boolean,\n      isConstructor: boolean,\n      allowsDirectSuper: boolean,\n    ): void {\n      if ((method: $FlowFixMe).variance) {\n        this.unexpected((method: $FlowFixMe).variance.start);\n      }\n      delete (method: $FlowFixMe).variance;\n      if (this.isRelational(\"<\")) {\n        method.typeParameters = this.flowParseTypeParameterDeclaration();\n      }\n\n      super.pushClassMethod(\n        classBody,\n        method,\n        isGenerator,\n        isAsync,\n        isConstructor,\n        allowsDirectSuper,\n      );\n\n      if (method.params && isConstructor) {\n        const params = method.params;\n        if (params.length > 0 && this.isThisParam(params[0])) {\n          this.raise(method.start, FlowErrors.ThisParamBannedInConstructor);\n        }\n        // estree support\n      } else if (\n        // $FlowFixMe flow does not know about the face that estree can replace ClassMethod with MethodDefinition\n        method.type === \"MethodDefinition\" &&\n        isConstructor &&\n        method.value.params\n      ) {\n        const params = method.value.params;\n        if (params.length > 0 && this.isThisParam(params[0])) {\n          this.raise(method.start, FlowErrors.ThisParamBannedInConstructor);\n        }\n      }\n    }\n\n    pushClassPrivateMethod(\n      classBody: N.ClassBody,\n      method: N.ClassPrivateMethod,\n      isGenerator: boolean,\n      isAsync: boolean,\n    ): void {\n      if ((method: $FlowFixMe).variance) {\n        this.unexpected((method: $FlowFixMe).variance.start);\n      }\n      delete (method: $FlowFixMe).variance;\n      if (this.isRelational(\"<\")) {\n        method.typeParameters = this.flowParseTypeParameterDeclaration();\n      }\n\n      super.pushClassPrivateMethod(classBody, method, isGenerator, isAsync);\n    }\n\n    // parse a the super class type parameters and implements\n    parseClassSuper(node: N.Class): void {\n      super.parseClassSuper(node);\n      if (node.superClass && this.isRelational(\"<\")) {\n        node.superTypeParameters = this.flowParseTypeParameterInstantiation();\n      }\n      if (this.isContextual(\"implements\")) {\n        this.next();\n        const implemented: N.FlowClassImplements[] = (node.implements = []);\n        do {\n          const node = this.startNode();\n          node.id = this.flowParseRestrictedIdentifier(/*liberal*/ true);\n          if (this.isRelational(\"<\")) {\n            node.typeParameters = this.flowParseTypeParameterInstantiation();\n          } else {\n            node.typeParameters = null;\n          }\n          implemented.push(this.finishNode(node, \"ClassImplements\"));\n        } while (this.eat(tt.comma));\n      }\n    }\n\n    checkGetterSetterParams(method: N.ObjectMethod | N.ClassMethod): void {\n      super.checkGetterSetterParams(method);\n      const params = this.getObjectOrClassMethodParams(method);\n      if (params.length > 0) {\n        const param = params[0];\n        if (this.isThisParam(param) && method.kind === \"get\") {\n          this.raise(param.start, FlowErrors.GetterMayNotHaveThisParam);\n        } else if (this.isThisParam(param)) {\n          this.raise(param.start, FlowErrors.SetterMayNotHaveThisParam);\n        }\n      }\n    }\n\n    parsePropertyName(\n      node: N.ObjectOrClassMember | N.ClassMember | N.TsNamedTypeElementBase,\n      isPrivateNameAllowed: boolean,\n    ): N.Identifier {\n      const variance = this.flowParseVariance();\n      const key = super.parsePropertyName(node, isPrivateNameAllowed);\n      // $FlowIgnore (\"variance\" not defined on TsNamedTypeElementBase)\n      node.variance = variance;\n      return key;\n    }\n\n    // parse type parameters for object method shorthand\n    parseObjPropValue(\n      prop: N.ObjectMember,\n      startPos: ?number,\n      startLoc: ?Position,\n      isGenerator: boolean,\n      isAsync: boolean,\n      isPattern: boolean,\n      isAccessor: boolean,\n      refExpressionErrors: ?ExpressionErrors,\n    ): void {\n      if ((prop: $FlowFixMe).variance) {\n        this.unexpected((prop: $FlowFixMe).variance.start);\n      }\n      delete (prop: $FlowFixMe).variance;\n\n      let typeParameters;\n\n      // method shorthand\n      if (this.isRelational(\"<\") && !isAccessor) {\n        typeParameters = this.flowParseTypeParameterDeclaration();\n        if (!this.match(tt.parenL)) this.unexpected();\n      }\n\n      super.parseObjPropValue(\n        prop,\n        startPos,\n        startLoc,\n        isGenerator,\n        isAsync,\n        isPattern,\n        isAccessor,\n        refExpressionErrors,\n      );\n\n      // add typeParameters if we found them\n      if (typeParameters) {\n        (prop.value || prop).typeParameters = typeParameters;\n      }\n    }\n\n    parseAssignableListItemTypes(param: N.Pattern): N.Pattern {\n      if (this.eat(tt.question)) {\n        if (param.type !== \"Identifier\") {\n          this.raise(param.start, FlowErrors.OptionalBindingPattern);\n        }\n        if (this.isThisParam(param)) {\n          this.raise(param.start, FlowErrors.ThisParamMayNotBeOptional);\n        }\n\n        ((param: any): N.Identifier).optional = true;\n      }\n      if (this.match(tt.colon)) {\n        param.typeAnnotation = this.flowParseTypeAnnotation();\n      } else if (this.isThisParam(param)) {\n        this.raise(param.start, FlowErrors.ThisParamAnnotationRequired);\n      }\n\n      if (this.match(tt.eq) && this.isThisParam(param)) {\n        this.raise(param.start, FlowErrors.ThisParamNoDefault);\n      }\n\n      this.resetEndLocation(param);\n      return param;\n    }\n\n    parseMaybeDefault(\n      startPos?: ?number,\n      startLoc?: ?Position,\n      left?: ?N.Pattern,\n    ): N.Pattern {\n      const node = super.parseMaybeDefault(startPos, startLoc, left);\n\n      if (\n        node.type === \"AssignmentPattern\" &&\n        node.typeAnnotation &&\n        node.right.start < node.typeAnnotation.start\n      ) {\n        this.raise(node.typeAnnotation.start, FlowErrors.TypeBeforeInitializer);\n      }\n\n      return node;\n    }\n\n    shouldParseDefaultImport(node: N.ImportDeclaration): boolean {\n      if (!hasTypeImportKind(node)) {\n        return super.shouldParseDefaultImport(node);\n      }\n\n      return isMaybeDefaultImport(this.state);\n    }\n\n    parseImportSpecifierLocal(\n      node: N.ImportDeclaration,\n      specifier: N.Node,\n      type: string,\n      contextDescription: string,\n    ): void {\n      specifier.local = hasTypeImportKind(node)\n        ? this.flowParseRestrictedIdentifier(\n            /* liberal */ true,\n            /* declaration */ true,\n          )\n        : this.parseIdentifier();\n\n      this.checkLVal(specifier.local, contextDescription, BIND_LEXICAL);\n      node.specifiers.push(this.finishNode(specifier, type));\n    }\n\n    // parse typeof and type imports\n    maybeParseDefaultImportSpecifier(node: N.ImportDeclaration): boolean {\n      node.importKind = \"value\";\n\n      let kind = null;\n      if (this.match(tt._typeof)) {\n        kind = \"typeof\";\n      } else if (this.isContextual(\"type\")) {\n        kind = \"type\";\n      }\n      if (kind) {\n        const lh = this.lookahead();\n\n        // import type * is not allowed\n        if (kind === \"type\" && lh.type === tt.star) {\n          this.unexpected(lh.start);\n        }\n\n        if (\n          isMaybeDefaultImport(lh) ||\n          lh.type === tt.braceL ||\n          lh.type === tt.star\n        ) {\n          this.next();\n          node.importKind = kind;\n        }\n      }\n\n      return super.maybeParseDefaultImportSpecifier(node);\n    }\n\n    // parse import-type/typeof shorthand\n    parseImportSpecifier(node: N.ImportDeclaration): void {\n      const specifier = this.startNode();\n      const firstIdentIsString = this.match(tt.string);\n      const firstIdent = this.parseModuleExportName();\n\n      let specifierTypeKind = null;\n      if (firstIdent.type === \"Identifier\") {\n        if (firstIdent.name === \"type\") {\n          specifierTypeKind = \"type\";\n        } else if (firstIdent.name === \"typeof\") {\n          specifierTypeKind = \"typeof\";\n        }\n      }\n\n      let isBinding = false;\n      if (this.isContextual(\"as\") && !this.isLookaheadContextual(\"as\")) {\n        const as_ident = this.parseIdentifier(true);\n        if (\n          specifierTypeKind !== null &&\n          !this.match(tt.name) &&\n          !this.state.type.keyword\n        ) {\n          // `import {type as ,` or `import {type as }`\n          specifier.imported = as_ident;\n          specifier.importKind = specifierTypeKind;\n          specifier.local = as_ident.__clone();\n        } else {\n          // `import {type as foo`\n          specifier.imported = firstIdent;\n          specifier.importKind = null;\n          specifier.local = this.parseIdentifier();\n        }\n      } else if (\n        specifierTypeKind !== null &&\n        (this.match(tt.name) || this.state.type.keyword)\n      ) {\n        // `import {type foo`\n        specifier.imported = this.parseIdentifier(true);\n        specifier.importKind = specifierTypeKind;\n        if (this.eatContextual(\"as\")) {\n          specifier.local = this.parseIdentifier();\n        } else {\n          isBinding = true;\n          specifier.local = specifier.imported.__clone();\n        }\n      } else {\n        if (firstIdentIsString) {\n          /*:: invariant(firstIdent instanceof N.StringLiteral) */\n          throw this.raise(\n            specifier.start,\n            Errors.ImportBindingIsString,\n            firstIdent.value,\n          );\n        }\n        /*:: invariant(firstIdent instanceof N.Node) */\n        isBinding = true;\n        specifier.imported = firstIdent;\n        specifier.importKind = null;\n        specifier.local = specifier.imported.__clone();\n      }\n\n      const nodeIsTypeImport = hasTypeImportKind(node);\n      const specifierIsTypeImport = hasTypeImportKind(specifier);\n\n      if (nodeIsTypeImport && specifierIsTypeImport) {\n        this.raise(\n          specifier.start,\n          FlowErrors.ImportTypeShorthandOnlyInPureImport,\n        );\n      }\n\n      if (nodeIsTypeImport || specifierIsTypeImport) {\n        this.checkReservedType(\n          specifier.local.name,\n          specifier.local.start,\n          /* declaration */ true,\n        );\n      }\n\n      if (isBinding && !nodeIsTypeImport && !specifierIsTypeImport) {\n        this.checkReservedWord(\n          specifier.local.name,\n          specifier.start,\n          true,\n          true,\n        );\n      }\n\n      this.checkLVal(specifier.local, \"import specifier\", BIND_LEXICAL);\n      node.specifiers.push(this.finishNode(specifier, \"ImportSpecifier\"));\n    }\n\n    parseBindingAtom(): N.Pattern {\n      switch (this.state.type) {\n        case tt._this:\n          // \"this\" may be the name of a parameter, so allow it.\n          return this.parseIdentifier(/* liberal */ true);\n        default:\n          return super.parseBindingAtom();\n      }\n    }\n\n    // parse function type parameters - function foo<T>() {}\n    parseFunctionParams(node: N.Function, allowModifiers?: boolean): void {\n      // $FlowFixMe\n      const kind = node.kind;\n      if (kind !== \"get\" && kind !== \"set\" && this.isRelational(\"<\")) {\n        node.typeParameters = this.flowParseTypeParameterDeclaration();\n      }\n      super.parseFunctionParams(node, allowModifiers);\n    }\n\n    // parse flow type annotations on variable declarator heads - let foo: string = bar\n    parseVarId(\n      decl: N.VariableDeclarator,\n      kind: \"var\" | \"let\" | \"const\",\n    ): void {\n      super.parseVarId(decl, kind);\n      if (this.match(tt.colon)) {\n        decl.id.typeAnnotation = this.flowParseTypeAnnotation();\n        this.resetEndLocation(decl.id); // set end position to end of type\n      }\n    }\n\n    // parse the return type of an async arrow function - let foo = (async (): number => {});\n    parseAsyncArrowFromCallExpression(\n      node: N.ArrowFunctionExpression,\n      call: N.CallExpression,\n    ): N.ArrowFunctionExpression {\n      if (this.match(tt.colon)) {\n        const oldNoAnonFunctionType = this.state.noAnonFunctionType;\n        this.state.noAnonFunctionType = true;\n        node.returnType = this.flowParseTypeAnnotation();\n        this.state.noAnonFunctionType = oldNoAnonFunctionType;\n      }\n\n      return super.parseAsyncArrowFromCallExpression(node, call);\n    }\n\n    // todo description\n    shouldParseAsyncArrow(): boolean {\n      return this.match(tt.colon) || super.shouldParseAsyncArrow();\n    }\n\n    // We need to support type parameter declarations for arrow functions. This\n    // is tricky. There are three situations we need to handle\n    //\n    // 1. This is either JSX or an arrow function. We'll try JSX first. If that\n    //    fails, we'll try an arrow function. If that fails, we'll throw the JSX\n    //    error.\n    // 2. This is an arrow function. We'll parse the type parameter declaration,\n    //    parse the rest, make sure the rest is an arrow function, and go from\n    //    there\n    // 3. This is neither. Just call the super method\n    parseMaybeAssign(\n      refExpressionErrors?: ?ExpressionErrors,\n      afterLeftParse?: Function,\n      refNeedsArrowPos?: ?Pos,\n    ): N.Expression {\n      let state = null;\n\n      let jsx;\n\n      if (\n        this.hasPlugin(\"jsx\") &&\n        (this.match(tt.jsxTagStart) || this.isRelational(\"<\"))\n      ) {\n        state = this.state.clone();\n\n        jsx = this.tryParse(\n          () =>\n            super.parseMaybeAssign(\n              refExpressionErrors,\n              afterLeftParse,\n              refNeedsArrowPos,\n            ),\n          state,\n        );\n        /*:: invariant(!jsx.aborted) */\n\n        if (!jsx.error) return jsx.node;\n\n        // Remove `tc.j_expr` and `tc.j_oTag` from context added\n        // by parsing `jsxTagStart` to stop the JSX plugin from\n        // messing with the tokens\n        const { context } = this.state;\n        if (context[context.length - 1] === tc.j_oTag) {\n          context.length -= 2;\n        } else if (context[context.length - 1] === tc.j_expr) {\n          context.length -= 1;\n        }\n      }\n\n      if (jsx?.error || this.isRelational(\"<\")) {\n        state = state || this.state.clone();\n\n        let typeParameters;\n\n        const arrow = this.tryParse(abort => {\n          typeParameters = this.flowParseTypeParameterDeclaration();\n\n          const arrowExpression = this.forwardNoArrowParamsConversionAt(\n            typeParameters,\n            () => {\n              const result = super.parseMaybeAssign(\n                refExpressionErrors,\n                afterLeftParse,\n                refNeedsArrowPos,\n              );\n\n              this.resetStartLocationFromNode(result, typeParameters);\n\n              return result;\n            },\n          );\n\n          // <T>(() => {}: any);\n          if (\n            arrowExpression.type !== \"ArrowFunctionExpression\" &&\n            arrowExpression.extra?.parenthesized\n          ) {\n            abort();\n          }\n\n          // The above can return a TypeCastExpression when the arrow\n          // expression is not wrapped in parens. See also `this.parseParenItem`.\n          const expr = this.maybeUnwrapTypeCastExpression(arrowExpression);\n          expr.typeParameters = typeParameters;\n          this.resetStartLocationFromNode(expr, typeParameters);\n\n          return arrowExpression;\n        }, state);\n\n        let arrowExpression: ?(\n          | N.ArrowFunctionExpression\n          | N.TypeCastExpression\n        ) = null;\n\n        if (\n          arrow.node &&\n          this.maybeUnwrapTypeCastExpression(arrow.node).type ===\n            \"ArrowFunctionExpression\"\n        ) {\n          if (!arrow.error && !arrow.aborted) {\n            // <T> async () => {}\n            if (arrow.node.async) {\n              /*:: invariant(typeParameters) */\n              this.raise(\n                typeParameters.start,\n                FlowErrors.UnexpectedTypeParameterBeforeAsyncArrowFunction,\n              );\n            }\n\n            return arrow.node;\n          }\n\n          arrowExpression = arrow.node;\n        }\n\n        // If we are here, both JSX and Flow parsing attempts failed.\n        // Give the precedence to the JSX error, except if JSX had an\n        // unrecoverable error while Flow didn't.\n        // If the error is recoverable, we can only re-report it if there is\n        // a node we can return.\n\n        if (jsx?.node) {\n          /*:: invariant(jsx.failState) */\n          this.state = jsx.failState;\n          return jsx.node;\n        }\n\n        if (arrowExpression) {\n          /*:: invariant(arrow.failState) */\n          this.state = arrow.failState;\n          return arrowExpression;\n        }\n\n        if (jsx?.thrown) throw jsx.error;\n        if (arrow.thrown) throw arrow.error;\n\n        /*:: invariant(typeParameters) */\n        throw this.raise(\n          typeParameters.start,\n          FlowErrors.UnexpectedTokenAfterTypeParameter,\n        );\n      }\n\n      return super.parseMaybeAssign(\n        refExpressionErrors,\n        afterLeftParse,\n        refNeedsArrowPos,\n      );\n    }\n\n    // handle return types for arrow functions\n    parseArrow(node: N.ArrowFunctionExpression): ?N.ArrowFunctionExpression {\n      if (this.match(tt.colon)) {\n        const result = this.tryParse(() => {\n          const oldNoAnonFunctionType = this.state.noAnonFunctionType;\n          this.state.noAnonFunctionType = true;\n\n          const typeNode = this.startNode();\n\n          [\n            // $FlowFixMe (destructuring not supported yet)\n            typeNode.typeAnnotation,\n            // $FlowFixMe (destructuring not supported yet)\n            node.predicate,\n          ] = this.flowParseTypeAndPredicateInitialiser();\n\n          this.state.noAnonFunctionType = oldNoAnonFunctionType;\n\n          if (this.canInsertSemicolon()) this.unexpected();\n          if (!this.match(tt.arrow)) this.unexpected();\n\n          return typeNode;\n        });\n\n        if (result.thrown) return null;\n        /*:: invariant(result.node) */\n\n        if (result.error) this.state = result.failState;\n\n        // assign after it is clear it is an arrow\n        node.returnType = result.node.typeAnnotation\n          ? this.finishNode(result.node, \"TypeAnnotation\")\n          : null;\n      }\n\n      return super.parseArrow(node);\n    }\n\n    shouldParseArrow(): boolean {\n      return this.match(tt.colon) || super.shouldParseArrow();\n    }\n\n    setArrowFunctionParameters(\n      node: N.ArrowFunctionExpression,\n      params: N.Expression[],\n    ): void {\n      if (this.state.noArrowParamsConversionAt.indexOf(node.start) !== -1) {\n        node.params = params;\n      } else {\n        super.setArrowFunctionParameters(node, params);\n      }\n    }\n\n    checkParams(\n      node: N.Function,\n      allowDuplicates: boolean,\n      isArrowFunction: ?boolean,\n    ): void {\n      if (\n        isArrowFunction &&\n        this.state.noArrowParamsConversionAt.indexOf(node.start) !== -1\n      ) {\n        return;\n      }\n\n      // ensure the `this` param is first, if it exists\n      for (let i = 0; i < node.params.length; i++) {\n        if (this.isThisParam(node.params[i]) && i > 0) {\n          this.raise(node.params[i].start, FlowErrors.ThisParamMustBeFirst);\n        }\n      }\n\n      return super.checkParams(...arguments);\n    }\n\n    parseParenAndDistinguishExpression(canBeArrow: boolean): N.Expression {\n      return super.parseParenAndDistinguishExpression(\n        canBeArrow && this.state.noArrowAt.indexOf(this.state.start) === -1,\n      );\n    }\n\n    parseSubscripts(\n      base: N.Expression,\n      startPos: number,\n      startLoc: Position,\n      noCalls?: ?boolean,\n    ): N.Expression {\n      if (\n        base.type === \"Identifier\" &&\n        base.name === \"async\" &&\n        this.state.noArrowAt.indexOf(startPos) !== -1\n      ) {\n        this.next();\n\n        const node = this.startNodeAt(startPos, startLoc);\n        node.callee = base;\n        node.arguments = this.parseCallExpressionArguments(tt.parenR, false);\n        base = this.finishNode(node, \"CallExpression\");\n      } else if (\n        base.type === \"Identifier\" &&\n        base.name === \"async\" &&\n        this.isRelational(\"<\")\n      ) {\n        const state = this.state.clone();\n        const arrow = this.tryParse(\n          abort =>\n            this.parseAsyncArrowWithTypeParameters(startPos, startLoc) ||\n            abort(),\n          state,\n        );\n\n        if (!arrow.error && !arrow.aborted) return arrow.node;\n\n        const result = this.tryParse(\n          () => super.parseSubscripts(base, startPos, startLoc, noCalls),\n          state,\n        );\n\n        if (result.node && !result.error) return result.node;\n\n        if (arrow.node) {\n          this.state = arrow.failState;\n          return arrow.node;\n        }\n\n        if (result.node) {\n          this.state = result.failState;\n          return result.node;\n        }\n\n        throw arrow.error || result.error;\n      }\n\n      return super.parseSubscripts(base, startPos, startLoc, noCalls);\n    }\n\n    parseSubscript(\n      base: N.Expression,\n      startPos: number,\n      startLoc: Position,\n      noCalls: ?boolean,\n      subscriptState: N.ParseSubscriptState,\n    ): N.Expression {\n      if (this.match(tt.questionDot) && this.isLookaheadToken_lt()) {\n        subscriptState.optionalChainMember = true;\n        if (noCalls) {\n          subscriptState.stop = true;\n          return base;\n        }\n        this.next();\n        const node: N.OptionalCallExpression = this.startNodeAt(\n          startPos,\n          startLoc,\n        );\n        node.callee = base;\n        node.typeArguments = this.flowParseTypeParameterInstantiation();\n        this.expect(tt.parenL);\n        // $FlowFixMe\n        node.arguments = this.parseCallExpressionArguments(tt.parenR, false);\n        node.optional = true;\n        return this.finishCallExpression(node, /* optional */ true);\n      } else if (\n        !noCalls &&\n        this.shouldParseTypes() &&\n        this.isRelational(\"<\")\n      ) {\n        const node = this.startNodeAt(startPos, startLoc);\n        node.callee = base;\n\n        const result = this.tryParse(() => {\n          node.typeArguments =\n            this.flowParseTypeParameterInstantiationCallOrNew();\n          this.expect(tt.parenL);\n          node.arguments = this.parseCallExpressionArguments(tt.parenR, false);\n          if (subscriptState.optionalChainMember) node.optional = false;\n          return this.finishCallExpression(\n            node,\n            subscriptState.optionalChainMember,\n          );\n        });\n\n        if (result.node) {\n          if (result.error) this.state = result.failState;\n          return result.node;\n        }\n      }\n\n      return super.parseSubscript(\n        base,\n        startPos,\n        startLoc,\n        noCalls,\n        subscriptState,\n      );\n    }\n\n    parseNewArguments(node: N.NewExpression): void {\n      let targs = null;\n      if (this.shouldParseTypes() && this.isRelational(\"<\")) {\n        targs = this.tryParse(() =>\n          this.flowParseTypeParameterInstantiationCallOrNew(),\n        ).node;\n      }\n      node.typeArguments = targs;\n\n      super.parseNewArguments(node);\n    }\n\n    parseAsyncArrowWithTypeParameters(\n      startPos: number,\n      startLoc: Position,\n    ): ?N.ArrowFunctionExpression {\n      const node = this.startNodeAt(startPos, startLoc);\n      this.parseFunctionParams(node);\n      if (!this.parseArrow(node)) return;\n      return this.parseArrowExpression(\n        node,\n        /* params */ undefined,\n        /* isAsync */ true,\n      );\n    }\n\n    readToken_mult_modulo(code: number): void {\n      const next = this.input.charCodeAt(this.state.pos + 1);\n      if (\n        code === charCodes.asterisk &&\n        next === charCodes.slash &&\n        this.state.hasFlowComment\n      ) {\n        this.state.hasFlowComment = false;\n        this.state.pos += 2;\n        this.nextToken();\n        return;\n      }\n\n      super.readToken_mult_modulo(code);\n    }\n\n    readToken_pipe_amp(code: number): void {\n      const next = this.input.charCodeAt(this.state.pos + 1);\n      if (\n        code === charCodes.verticalBar &&\n        next === charCodes.rightCurlyBrace\n      ) {\n        // '|}'\n        this.finishOp(tt.braceBarR, 2);\n        return;\n      }\n\n      super.readToken_pipe_amp(code);\n    }\n\n    parseTopLevel(file: N.File, program: N.Program): N.File {\n      const fileNode = super.parseTopLevel(file, program);\n      if (this.state.hasFlowComment) {\n        this.raise(this.state.pos, FlowErrors.UnterminatedFlowComment);\n      }\n      return fileNode;\n    }\n\n    skipBlockComment(): void {\n      if (this.hasPlugin(\"flowComments\") && this.skipFlowComment()) {\n        if (this.state.hasFlowComment) {\n          this.unexpected(null, FlowErrors.NestedFlowComment);\n        }\n        this.hasFlowCommentCompletion();\n        this.state.pos += this.skipFlowComment();\n        this.state.hasFlowComment = true;\n        return;\n      }\n\n      if (this.state.hasFlowComment) {\n        const end = this.input.indexOf(\"*-/\", (this.state.pos += 2));\n        if (end === -1) {\n          throw this.raise(this.state.pos - 2, Errors.UnterminatedComment);\n        }\n        this.state.pos = end + 3;\n        return;\n      }\n\n      super.skipBlockComment();\n    }\n\n    skipFlowComment(): number | boolean {\n      const { pos } = this.state;\n      let shiftToFirstNonWhiteSpace = 2;\n      while (\n        [charCodes.space, charCodes.tab].includes(\n          this.input.charCodeAt(pos + shiftToFirstNonWhiteSpace),\n        )\n      ) {\n        shiftToFirstNonWhiteSpace++;\n      }\n\n      const ch2 = this.input.charCodeAt(shiftToFirstNonWhiteSpace + pos);\n      const ch3 = this.input.charCodeAt(shiftToFirstNonWhiteSpace + pos + 1);\n\n      if (ch2 === charCodes.colon && ch3 === charCodes.colon) {\n        return shiftToFirstNonWhiteSpace + 2; // check for /*::\n      }\n      if (\n        this.input.slice(\n          shiftToFirstNonWhiteSpace + pos,\n          shiftToFirstNonWhiteSpace + pos + 12,\n        ) === \"flow-include\"\n      ) {\n        return shiftToFirstNonWhiteSpace + 12; // check for /*flow-include\n      }\n      if (ch2 === charCodes.colon && ch3 !== charCodes.colon) {\n        return shiftToFirstNonWhiteSpace; // check for /*:, advance up to :\n      }\n      return false;\n    }\n\n    hasFlowCommentCompletion(): void {\n      const end = this.input.indexOf(\"*/\", this.state.pos);\n      if (end === -1) {\n        throw this.raise(this.state.pos, Errors.UnterminatedComment);\n      }\n    }\n\n    // Flow enum parsing\n\n    flowEnumErrorBooleanMemberNotInitialized(\n      pos: number,\n      { enumName, memberName }: { enumName: string, memberName: string },\n    ): void {\n      this.raise(\n        pos,\n        FlowErrors.EnumBooleanMemberNotInitialized,\n        memberName,\n        enumName,\n      );\n    }\n\n    flowEnumErrorInvalidMemberName(\n      pos: number,\n      { enumName, memberName }: { enumName: string, memberName: string },\n    ): void {\n      const suggestion = memberName[0].toUpperCase() + memberName.slice(1);\n      this.raise(\n        pos,\n        FlowErrors.EnumInvalidMemberName,\n        memberName,\n        suggestion,\n        enumName,\n      );\n    }\n\n    flowEnumErrorDuplicateMemberName(\n      pos: number,\n      { enumName, memberName }: { enumName: string, memberName: string },\n    ): void {\n      this.raise(pos, FlowErrors.EnumDuplicateMemberName, memberName, enumName);\n    }\n\n    flowEnumErrorInconsistentMemberValues(\n      pos: number,\n      { enumName }: { enumName: string },\n    ): void {\n      this.raise(pos, FlowErrors.EnumInconsistentMemberValues, enumName);\n    }\n\n    flowEnumErrorInvalidExplicitType(\n      pos: number,\n      {\n        enumName,\n        suppliedType,\n      }: { enumName: string, suppliedType: null | string },\n    ) {\n      return this.raise(\n        pos,\n        suppliedType === null\n          ? FlowErrors.EnumInvalidExplicitTypeUnknownSupplied\n          : FlowErrors.EnumInvalidExplicitType,\n        enumName,\n        suppliedType,\n      );\n    }\n\n    flowEnumErrorInvalidMemberInitializer(\n      pos: number,\n      { enumName, explicitType, memberName }: EnumContext,\n    ) {\n      let message = null;\n      switch (explicitType) {\n        case \"boolean\":\n        case \"number\":\n        case \"string\":\n          message = FlowErrors.EnumInvalidMemberInitializerPrimaryType;\n          break;\n        case \"symbol\":\n          message = FlowErrors.EnumInvalidMemberInitializerSymbolType;\n          break;\n        default:\n          // null\n          message = FlowErrors.EnumInvalidMemberInitializerUnknownType;\n      }\n      return this.raise(pos, message, enumName, memberName, explicitType);\n    }\n\n    flowEnumErrorNumberMemberNotInitialized(\n      pos: number,\n      { enumName, memberName }: { enumName: string, memberName: string },\n    ): void {\n      this.raise(\n        pos,\n        FlowErrors.EnumNumberMemberNotInitialized,\n        enumName,\n        memberName,\n      );\n    }\n\n    flowEnumErrorStringMemberInconsistentlyInitailized(\n      pos: number,\n      { enumName }: { enumName: string },\n    ): void {\n      this.raise(\n        pos,\n        FlowErrors.EnumStringMemberInconsistentlyInitailized,\n        enumName,\n      );\n    }\n\n    flowEnumMemberInit(): EnumMemberInit {\n      const startPos = this.state.start;\n      const endOfInit = () => this.match(tt.comma) || this.match(tt.braceR);\n      switch (this.state.type) {\n        case tt.num: {\n          const literal = this.parseNumericLiteral(this.state.value);\n          if (endOfInit()) {\n            return { type: \"number\", pos: literal.start, value: literal };\n          }\n          return { type: \"invalid\", pos: startPos };\n        }\n        case tt.string: {\n          const literal = this.parseStringLiteral(this.state.value);\n          if (endOfInit()) {\n            return { type: \"string\", pos: literal.start, value: literal };\n          }\n          return { type: \"invalid\", pos: startPos };\n        }\n        case tt._true:\n        case tt._false: {\n          const literal = this.parseBooleanLiteral(this.match(tt._true));\n          if (endOfInit()) {\n            return {\n              type: \"boolean\",\n              pos: literal.start,\n              value: literal,\n            };\n          }\n          return { type: \"invalid\", pos: startPos };\n        }\n        default:\n          return { type: \"invalid\", pos: startPos };\n      }\n    }\n\n    flowEnumMemberRaw(): { id: N.Node, init: EnumMemberInit } {\n      const pos = this.state.start;\n      const id = this.parseIdentifier(true);\n      const init = this.eat(tt.eq)\n        ? this.flowEnumMemberInit()\n        : { type: \"none\", pos };\n      return { id, init };\n    }\n\n    flowEnumCheckExplicitTypeMismatch(\n      pos: number,\n      context: EnumContext,\n      expectedType: EnumExplicitType,\n    ): void {\n      const { explicitType } = context;\n      if (explicitType === null) {\n        return;\n      }\n      if (explicitType !== expectedType) {\n        this.flowEnumErrorInvalidMemberInitializer(pos, context);\n      }\n    }\n\n    flowEnumMembers({\n      enumName,\n      explicitType,\n    }: {\n      enumName: string,\n      explicitType: EnumExplicitType,\n    }): {|\n      members: {|\n        booleanMembers: Array<N.Node>,\n        numberMembers: Array<N.Node>,\n        stringMembers: Array<N.Node>,\n        defaultedMembers: Array<N.Node>,\n      |},\n      hasUnknownMembers: boolean,\n    |} {\n      const seenNames = new Set();\n      const members = {\n        booleanMembers: [],\n        numberMembers: [],\n        stringMembers: [],\n        defaultedMembers: [],\n      };\n      let hasUnknownMembers = false;\n      while (!this.match(tt.braceR)) {\n        if (this.eat(tt.ellipsis)) {\n          hasUnknownMembers = true;\n          break;\n        }\n        const memberNode = this.startNode();\n        const { id, init } = this.flowEnumMemberRaw();\n        const memberName = id.name;\n        if (memberName === \"\") {\n          continue;\n        }\n        if (/^[a-z]/.test(memberName)) {\n          this.flowEnumErrorInvalidMemberName(id.start, {\n            enumName,\n            memberName,\n          });\n        }\n        if (seenNames.has(memberName)) {\n          this.flowEnumErrorDuplicateMemberName(id.start, {\n            enumName,\n            memberName,\n          });\n        }\n        seenNames.add(memberName);\n        const context = { enumName, explicitType, memberName };\n        memberNode.id = id;\n        switch (init.type) {\n          case \"boolean\": {\n            this.flowEnumCheckExplicitTypeMismatch(\n              init.pos,\n              context,\n              \"boolean\",\n            );\n            memberNode.init = init.value;\n            members.booleanMembers.push(\n              this.finishNode(memberNode, \"EnumBooleanMember\"),\n            );\n            break;\n          }\n          case \"number\": {\n            this.flowEnumCheckExplicitTypeMismatch(init.pos, context, \"number\");\n            memberNode.init = init.value;\n            members.numberMembers.push(\n              this.finishNode(memberNode, \"EnumNumberMember\"),\n            );\n            break;\n          }\n          case \"string\": {\n            this.flowEnumCheckExplicitTypeMismatch(init.pos, context, \"string\");\n            memberNode.init = init.value;\n            members.stringMembers.push(\n              this.finishNode(memberNode, \"EnumStringMember\"),\n            );\n            break;\n          }\n          case \"invalid\": {\n            throw this.flowEnumErrorInvalidMemberInitializer(init.pos, context);\n          }\n          case \"none\": {\n            switch (explicitType) {\n              case \"boolean\":\n                this.flowEnumErrorBooleanMemberNotInitialized(\n                  init.pos,\n                  context,\n                );\n                break;\n              case \"number\":\n                this.flowEnumErrorNumberMemberNotInitialized(init.pos, context);\n                break;\n              default:\n                members.defaultedMembers.push(\n                  this.finishNode(memberNode, \"EnumDefaultedMember\"),\n                );\n            }\n          }\n        }\n\n        if (!this.match(tt.braceR)) {\n          this.expect(tt.comma);\n        }\n      }\n      return { members, hasUnknownMembers };\n    }\n\n    flowEnumStringMembers(\n      initializedMembers: Array<N.Node>,\n      defaultedMembers: Array<N.Node>,\n      { enumName }: { enumName: string },\n    ): Array<N.Node> {\n      if (initializedMembers.length === 0) {\n        return defaultedMembers;\n      } else if (defaultedMembers.length === 0) {\n        return initializedMembers;\n      } else if (defaultedMembers.length > initializedMembers.length) {\n        for (const member of initializedMembers) {\n          this.flowEnumErrorStringMemberInconsistentlyInitailized(\n            member.start,\n            { enumName },\n          );\n        }\n        return defaultedMembers;\n      } else {\n        for (const member of defaultedMembers) {\n          this.flowEnumErrorStringMemberInconsistentlyInitailized(\n            member.start,\n            { enumName },\n          );\n        }\n        return initializedMembers;\n      }\n    }\n\n    flowEnumParseExplicitType({\n      enumName,\n    }: {\n      enumName: string,\n    }): EnumExplicitType {\n      if (this.eatContextual(\"of\")) {\n        if (!this.match(tt.name)) {\n          throw this.flowEnumErrorInvalidExplicitType(this.state.start, {\n            enumName,\n            suppliedType: null,\n          });\n        }\n\n        const { value } = this.state;\n        this.next();\n\n        if (\n          value !== \"boolean\" &&\n          value !== \"number\" &&\n          value !== \"string\" &&\n          value !== \"symbol\"\n        ) {\n          this.flowEnumErrorInvalidExplicitType(this.state.start, {\n            enumName,\n            suppliedType: value,\n          });\n        }\n\n        return value;\n      }\n      return null;\n    }\n\n    flowEnumBody(node: N.Node, { enumName, nameLoc }): N.Node {\n      const explicitType = this.flowEnumParseExplicitType({ enumName });\n      this.expect(tt.braceL);\n      const { members, hasUnknownMembers } = this.flowEnumMembers({\n        enumName,\n        explicitType,\n      });\n      node.hasUnknownMembers = hasUnknownMembers;\n\n      switch (explicitType) {\n        case \"boolean\":\n          node.explicitType = true;\n          node.members = members.booleanMembers;\n          this.expect(tt.braceR);\n          return this.finishNode(node, \"EnumBooleanBody\");\n        case \"number\":\n          node.explicitType = true;\n          node.members = members.numberMembers;\n          this.expect(tt.braceR);\n          return this.finishNode(node, \"EnumNumberBody\");\n        case \"string\":\n          node.explicitType = true;\n          node.members = this.flowEnumStringMembers(\n            members.stringMembers,\n            members.defaultedMembers,\n            { enumName },\n          );\n          this.expect(tt.braceR);\n          return this.finishNode(node, \"EnumStringBody\");\n        case \"symbol\":\n          node.members = members.defaultedMembers;\n          this.expect(tt.braceR);\n          return this.finishNode(node, \"EnumSymbolBody\");\n        default: {\n          // `explicitType` is `null`\n          const empty = () => {\n            node.members = [];\n            this.expect(tt.braceR);\n            return this.finishNode(node, \"EnumStringBody\");\n          };\n          node.explicitType = false;\n\n          const boolsLen = members.booleanMembers.length;\n          const numsLen = members.numberMembers.length;\n          const strsLen = members.stringMembers.length;\n          const defaultedLen = members.defaultedMembers.length;\n\n          if (!boolsLen && !numsLen && !strsLen && !defaultedLen) {\n            return empty();\n          } else if (!boolsLen && !numsLen) {\n            node.members = this.flowEnumStringMembers(\n              members.stringMembers,\n              members.defaultedMembers,\n              { enumName },\n            );\n            this.expect(tt.braceR);\n            return this.finishNode(node, \"EnumStringBody\");\n          } else if (!numsLen && !strsLen && boolsLen >= defaultedLen) {\n            for (const member of members.defaultedMembers) {\n              this.flowEnumErrorBooleanMemberNotInitialized(member.start, {\n                enumName,\n                memberName: member.id.name,\n              });\n            }\n            node.members = members.booleanMembers;\n            this.expect(tt.braceR);\n            return this.finishNode(node, \"EnumBooleanBody\");\n          } else if (!boolsLen && !strsLen && numsLen >= defaultedLen) {\n            for (const member of members.defaultedMembers) {\n              this.flowEnumErrorNumberMemberNotInitialized(member.start, {\n                enumName,\n                memberName: member.id.name,\n              });\n            }\n            node.members = members.numberMembers;\n            this.expect(tt.braceR);\n            return this.finishNode(node, \"EnumNumberBody\");\n          } else {\n            this.flowEnumErrorInconsistentMemberValues(nameLoc, { enumName });\n            return empty();\n          }\n        }\n      }\n    }\n\n    flowParseEnumDeclaration(node: N.Node): N.Node {\n      const id = this.parseIdentifier();\n      node.id = id;\n      node.body = this.flowEnumBody(this.startNode(), {\n        enumName: id.name,\n        nameLoc: id.start,\n      });\n      return this.finishNode(node, \"EnumDeclaration\");\n    }\n\n    // check if the next token is a tt.relation(\"<\")\n    isLookaheadToken_lt(): boolean {\n      const next = this.nextTokenStart();\n      if (this.input.charCodeAt(next) === charCodes.lessThan) {\n        const afterNext = this.input.charCodeAt(next + 1);\n        return (\n          afterNext !== charCodes.lessThan && afterNext !== charCodes.equalsTo\n        );\n      }\n      return false;\n    }\n\n    maybeUnwrapTypeCastExpression(node: N.Node) {\n      return node.type === \"TypeCastExpression\" ? node.expression : node;\n    }\n  };\n","// @flow\n\nconst entities: { [name: string]: string } = {\n  quot: \"\\u0022\",\n  amp: \"&\",\n  apos: \"\\u0027\",\n  lt: \"<\",\n  gt: \">\",\n  nbsp: \"\\u00A0\",\n  iexcl: \"\\u00A1\",\n  cent: \"\\u00A2\",\n  pound: \"\\u00A3\",\n  curren: \"\\u00A4\",\n  yen: \"\\u00A5\",\n  brvbar: \"\\u00A6\",\n  sect: \"\\u00A7\",\n  uml: \"\\u00A8\",\n  copy: \"\\u00A9\",\n  ordf: \"\\u00AA\",\n  laquo: \"\\u00AB\",\n  not: \"\\u00AC\",\n  shy: \"\\u00AD\",\n  reg: \"\\u00AE\",\n  macr: \"\\u00AF\",\n  deg: \"\\u00B0\",\n  plusmn: \"\\u00B1\",\n  sup2: \"\\u00B2\",\n  sup3: \"\\u00B3\",\n  acute: \"\\u00B4\",\n  micro: \"\\u00B5\",\n  para: \"\\u00B6\",\n  middot: \"\\u00B7\",\n  cedil: \"\\u00B8\",\n  sup1: \"\\u00B9\",\n  ordm: \"\\u00BA\",\n  raquo: \"\\u00BB\",\n  frac14: \"\\u00BC\",\n  frac12: \"\\u00BD\",\n  frac34: \"\\u00BE\",\n  iquest: \"\\u00BF\",\n  Agrave: \"\\u00C0\",\n  Aacute: \"\\u00C1\",\n  Acirc: \"\\u00C2\",\n  Atilde: \"\\u00C3\",\n  Auml: \"\\u00C4\",\n  Aring: \"\\u00C5\",\n  AElig: \"\\u00C6\",\n  Ccedil: \"\\u00C7\",\n  Egrave: \"\\u00C8\",\n  Eacute: \"\\u00C9\",\n  Ecirc: \"\\u00CA\",\n  Euml: \"\\u00CB\",\n  Igrave: \"\\u00CC\",\n  Iacute: \"\\u00CD\",\n  Icirc: \"\\u00CE\",\n  Iuml: \"\\u00CF\",\n  ETH: \"\\u00D0\",\n  Ntilde: \"\\u00D1\",\n  Ograve: \"\\u00D2\",\n  Oacute: \"\\u00D3\",\n  Ocirc: \"\\u00D4\",\n  Otilde: \"\\u00D5\",\n  Ouml: \"\\u00D6\",\n  times: \"\\u00D7\",\n  Oslash: \"\\u00D8\",\n  Ugrave: \"\\u00D9\",\n  Uacute: \"\\u00DA\",\n  Ucirc: \"\\u00DB\",\n  Uuml: \"\\u00DC\",\n  Yacute: \"\\u00DD\",\n  THORN: \"\\u00DE\",\n  szlig: \"\\u00DF\",\n  agrave: \"\\u00E0\",\n  aacute: \"\\u00E1\",\n  acirc: \"\\u00E2\",\n  atilde: \"\\u00E3\",\n  auml: \"\\u00E4\",\n  aring: \"\\u00E5\",\n  aelig: \"\\u00E6\",\n  ccedil: \"\\u00E7\",\n  egrave: \"\\u00E8\",\n  eacute: \"\\u00E9\",\n  ecirc: \"\\u00EA\",\n  euml: \"\\u00EB\",\n  igrave: \"\\u00EC\",\n  iacute: \"\\u00ED\",\n  icirc: \"\\u00EE\",\n  iuml: \"\\u00EF\",\n  eth: \"\\u00F0\",\n  ntilde: \"\\u00F1\",\n  ograve: \"\\u00F2\",\n  oacute: \"\\u00F3\",\n  ocirc: \"\\u00F4\",\n  otilde: \"\\u00F5\",\n  ouml: \"\\u00F6\",\n  divide: \"\\u00F7\",\n  oslash: \"\\u00F8\",\n  ugrave: \"\\u00F9\",\n  uacute: \"\\u00FA\",\n  ucirc: \"\\u00FB\",\n  uuml: \"\\u00FC\",\n  yacute: \"\\u00FD\",\n  thorn: \"\\u00FE\",\n  yuml: \"\\u00FF\",\n  OElig: \"\\u0152\",\n  oelig: \"\\u0153\",\n  Scaron: \"\\u0160\",\n  scaron: \"\\u0161\",\n  Yuml: \"\\u0178\",\n  fnof: \"\\u0192\",\n  circ: \"\\u02C6\",\n  tilde: \"\\u02DC\",\n  Alpha: \"\\u0391\",\n  Beta: \"\\u0392\",\n  Gamma: \"\\u0393\",\n  Delta: \"\\u0394\",\n  Epsilon: \"\\u0395\",\n  Zeta: \"\\u0396\",\n  Eta: \"\\u0397\",\n  Theta: \"\\u0398\",\n  Iota: \"\\u0399\",\n  Kappa: \"\\u039A\",\n  Lambda: \"\\u039B\",\n  Mu: \"\\u039C\",\n  Nu: \"\\u039D\",\n  Xi: \"\\u039E\",\n  Omicron: \"\\u039F\",\n  Pi: \"\\u03A0\",\n  Rho: \"\\u03A1\",\n  Sigma: \"\\u03A3\",\n  Tau: \"\\u03A4\",\n  Upsilon: \"\\u03A5\",\n  Phi: \"\\u03A6\",\n  Chi: \"\\u03A7\",\n  Psi: \"\\u03A8\",\n  Omega: \"\\u03A9\",\n  alpha: \"\\u03B1\",\n  beta: \"\\u03B2\",\n  gamma: \"\\u03B3\",\n  delta: \"\\u03B4\",\n  epsilon: \"\\u03B5\",\n  zeta: \"\\u03B6\",\n  eta: \"\\u03B7\",\n  theta: \"\\u03B8\",\n  iota: \"\\u03B9\",\n  kappa: \"\\u03BA\",\n  lambda: \"\\u03BB\",\n  mu: \"\\u03BC\",\n  nu: \"\\u03BD\",\n  xi: \"\\u03BE\",\n  omicron: \"\\u03BF\",\n  pi: \"\\u03C0\",\n  rho: \"\\u03C1\",\n  sigmaf: \"\\u03C2\",\n  sigma: \"\\u03C3\",\n  tau: \"\\u03C4\",\n  upsilon: \"\\u03C5\",\n  phi: \"\\u03C6\",\n  chi: \"\\u03C7\",\n  psi: \"\\u03C8\",\n  omega: \"\\u03C9\",\n  thetasym: \"\\u03D1\",\n  upsih: \"\\u03D2\",\n  piv: \"\\u03D6\",\n  ensp: \"\\u2002\",\n  emsp: \"\\u2003\",\n  thinsp: \"\\u2009\",\n  zwnj: \"\\u200C\",\n  zwj: \"\\u200D\",\n  lrm: \"\\u200E\",\n  rlm: \"\\u200F\",\n  ndash: \"\\u2013\",\n  mdash: \"\\u2014\",\n  lsquo: \"\\u2018\",\n  rsquo: \"\\u2019\",\n  sbquo: \"\\u201A\",\n  ldquo: \"\\u201C\",\n  rdquo: \"\\u201D\",\n  bdquo: \"\\u201E\",\n  dagger: \"\\u2020\",\n  Dagger: \"\\u2021\",\n  bull: \"\\u2022\",\n  hellip: \"\\u2026\",\n  permil: \"\\u2030\",\n  prime: \"\\u2032\",\n  Prime: \"\\u2033\",\n  lsaquo: \"\\u2039\",\n  rsaquo: \"\\u203A\",\n  oline: \"\\u203E\",\n  frasl: \"\\u2044\",\n  euro: \"\\u20AC\",\n  image: \"\\u2111\",\n  weierp: \"\\u2118\",\n  real: \"\\u211C\",\n  trade: \"\\u2122\",\n  alefsym: \"\\u2135\",\n  larr: \"\\u2190\",\n  uarr: \"\\u2191\",\n  rarr: \"\\u2192\",\n  darr: \"\\u2193\",\n  harr: \"\\u2194\",\n  crarr: \"\\u21B5\",\n  lArr: \"\\u21D0\",\n  uArr: \"\\u21D1\",\n  rArr: \"\\u21D2\",\n  dArr: \"\\u21D3\",\n  hArr: \"\\u21D4\",\n  forall: \"\\u2200\",\n  part: \"\\u2202\",\n  exist: \"\\u2203\",\n  empty: \"\\u2205\",\n  nabla: \"\\u2207\",\n  isin: \"\\u2208\",\n  notin: \"\\u2209\",\n  ni: \"\\u220B\",\n  prod: \"\\u220F\",\n  sum: \"\\u2211\",\n  minus: \"\\u2212\",\n  lowast: \"\\u2217\",\n  radic: \"\\u221A\",\n  prop: \"\\u221D\",\n  infin: \"\\u221E\",\n  ang: \"\\u2220\",\n  and: \"\\u2227\",\n  or: \"\\u2228\",\n  cap: \"\\u2229\",\n  cup: \"\\u222A\",\n  int: \"\\u222B\",\n  there4: \"\\u2234\",\n  sim: \"\\u223C\",\n  cong: \"\\u2245\",\n  asymp: \"\\u2248\",\n  ne: \"\\u2260\",\n  equiv: \"\\u2261\",\n  le: \"\\u2264\",\n  ge: \"\\u2265\",\n  sub: \"\\u2282\",\n  sup: \"\\u2283\",\n  nsub: \"\\u2284\",\n  sube: \"\\u2286\",\n  supe: \"\\u2287\",\n  oplus: \"\\u2295\",\n  otimes: \"\\u2297\",\n  perp: \"\\u22A5\",\n  sdot: \"\\u22C5\",\n  lceil: \"\\u2308\",\n  rceil: \"\\u2309\",\n  lfloor: \"\\u230A\",\n  rfloor: \"\\u230B\",\n  lang: \"\\u2329\",\n  rang: \"\\u232A\",\n  loz: \"\\u25CA\",\n  spades: \"\\u2660\",\n  clubs: \"\\u2663\",\n  hearts: \"\\u2665\",\n  diams: \"\\u2666\",\n};\nexport default entities;\n","// @flow\n\nimport type { Options } from \"../options\";\nimport * as N from \"../types\";\nimport { Position } from \"../util/location\";\n\nimport { types as ct, type TokContext } from \"./context\";\nimport { types as tt, type TokenType } from \"./types\";\nimport type { ParsingError, ErrorTemplate } from \"../parser/error\";\n\ntype TopicContextState = {\n  // When a topic binding has been currently established,\n  // then this is 1. Otherwise, it is 0. This is forwards compatible\n  // with a future plugin for multiple lexical topics.\n  maxNumOfResolvableTopics: number,\n\n  // When a topic binding has been currently established, and if that binding\n  // has been used as a topic reference `#`, then this is 0. Otherwise, it is\n  // `null`. This is forwards compatible with a future plugin for multiple\n  // lexical topics.\n  maxTopicIndex: null | 0,\n};\n\nexport default class State {\n  strict: boolean;\n  curLine: number;\n\n  // And, if locations are used, the {line, column} object\n  // corresponding to those offsets\n  startLoc: Position;\n  endLoc: Position;\n\n  init(options: Options): void {\n    this.strict =\n      options.strictMode === false ? false : options.sourceType === \"module\";\n\n    this.curLine = options.startLine;\n    this.startLoc = this.endLoc = this.curPosition();\n  }\n\n  errors: ParsingError[] = [];\n\n  // Used to signify the start of a potential arrow function\n  potentialArrowAt: number = -1;\n\n  // Used to signify the start of an expression which looks like a\n  // typed arrow function, but it isn't\n  // e.g. a ? (b) : c => d\n  //          ^\n  noArrowAt: number[] = [];\n\n  // Used to signify the start of an expression whose params, if it looks like\n  // an arrow function, shouldn't be converted to assignable nodes.\n  // This is used to defer the validation of typed arrow functions inside\n  // conditional expressions.\n  // e.g. a ? (b) : c => d\n  //          ^\n  noArrowParamsConversionAt: number[] = [];\n\n  // Flags to track\n  maybeInArrowParameters: boolean = false;\n  inPipeline: boolean = false;\n  inType: boolean = false;\n  noAnonFunctionType: boolean = false;\n  inPropertyName: boolean = false;\n  hasFlowComment: boolean = false;\n  isAmbientContext: boolean = false;\n  inAbstractClass: boolean = false;\n\n  // For the smartPipelines plugin:\n  topicContext: TopicContextState = {\n    maxNumOfResolvableTopics: 0,\n    maxTopicIndex: null,\n  };\n\n  // For the F# plugin\n  soloAwait: boolean = false;\n  inFSharpPipelineDirectBody: boolean = false;\n\n  // Labels in scope.\n  labels: Array<{\n    kind: ?(\"loop\" | \"switch\"),\n    name?: ?string,\n    statementStart?: number,\n  }> = [];\n\n  // Leading decorators. Last element of the stack represents the decorators in current context.\n  // Supports nesting of decorators, e.g. @foo(@bar class inner {}) class outer {}\n  // where @foo belongs to the outer class and @bar to the inner\n  decoratorStack: Array<Array<N.Decorator>> = [[]];\n\n  // Comment store.\n  comments: Array<N.Comment> = [];\n\n  // Comment attachment store\n  trailingComments: Array<N.Comment> = [];\n  leadingComments: Array<N.Comment> = [];\n  commentStack: Array<{\n    start: number,\n    leadingComments: ?Array<N.Comment>,\n    trailingComments: ?Array<N.Comment>,\n    type: string,\n  }> = [];\n  // $FlowIgnore this is initialized when the parser starts.\n  commentPreviousNode: N.Node = null;\n\n  // The current position of the tokenizer in the input.\n  pos: number = 0;\n  lineStart: number = 0;\n\n  // Properties of the current token:\n  // Its type\n  type: TokenType = tt.eof;\n\n  // For tokens that include more information than their type, the value\n  value: any = null;\n\n  // Its start and end offset\n  start: number = 0;\n  end: number = 0;\n\n  // Position information for the previous token\n  // $FlowIgnore this is initialized when generating the second token.\n  lastTokEndLoc: Position = null;\n  // $FlowIgnore this is initialized when generating the second token.\n  lastTokStartLoc: Position = null;\n  lastTokStart: number = 0;\n  lastTokEnd: number = 0;\n\n  // The context stack is used to superficially track syntactic\n  // context to predict whether a regular expression is allowed in a\n  // given position.\n  context: Array<TokContext> = [ct.brace];\n  exprAllowed: boolean = true;\n\n  // Used to signal to callers of `readWord1` whether the word\n  // contained any escape sequences. This is needed because words with\n  // escape sequences must not be interpreted as keywords.\n  containsEsc: boolean = false;\n\n  // This property is used to track the following errors\n  // - StrictNumericEscape\n  // - StrictOctalLiteral\n  //\n  // in a literal that occurs prior to/immediately after a \"use strict\" directive.\n\n  // todo(JLHwung): set strictErrors to null and avoid recording string errors\n  // after a non-directive is parsed\n  strictErrors: Map<number, ErrorTemplate> = new Map();\n\n  // Tokens length in token store\n  tokensLength: number = 0;\n\n  curPosition(): Position {\n    return new Position(this.curLine, this.pos - this.lineStart);\n  }\n\n  clone(skipArrays?: boolean): State {\n    const state = new State();\n    const keys = Object.keys(this);\n    for (let i = 0, length = keys.length; i < length; i++) {\n      const key = keys[i];\n      // $FlowIgnore\n      let val = this[key];\n\n      if (!skipArrays && Array.isArray(val)) {\n        val = val.slice();\n      }\n\n      // $FlowIgnore\n      state[key] = val;\n    }\n\n    return state;\n  }\n}\n\nexport type LookaheadState = {\n  pos: number,\n  value: any,\n  type: TokenType,\n  start: number,\n  end: number,\n  /* Used only in readToken_mult_modulo */\n  inType: boolean,\n};\n","// @flow\n\n// Error messages are colocated with the plugin.\n/* eslint-disable @babel/development-internal/dry-error-messages */\n\nimport * as charCodes from \"charcodes\";\n\nimport XHTMLEntities from \"./xhtml\";\nimport type Parser from \"../../parser\";\nimport type { ExpressionErrors } from \"../../parser/util\";\nimport { TokenType, types as tt } from \"../../tokenizer/types\";\nimport { TokContext, types as tc } from \"../../tokenizer/context\";\nimport * as N from \"../../types\";\nimport { isIdentifierChar, isIdentifierStart } from \"../../util/identifier\";\nimport type { Position } from \"../../util/location\";\nimport { isNewLine } from \"../../util/whitespace\";\nimport { Errors, makeErrorTemplates, ErrorCodes } from \"../../parser/error\";\nimport type { LookaheadState } from \"../../tokenizer/state\";\nimport State from \"../../tokenizer/state\";\n\ntype JSXLookaheadState = LookaheadState & { inPropertyName: boolean };\n\nconst HEX_NUMBER = /^[\\da-fA-F]+$/;\nconst DECIMAL_NUMBER = /^\\d+$/;\n\n/* eslint sort-keys: \"error\" */\nconst JsxErrors = makeErrorTemplates(\n  {\n    AttributeIsEmpty:\n      \"JSX attributes must only be assigned a non-empty expression.\",\n    MissingClosingTagElement:\n      \"Expected corresponding JSX closing tag for <%0>.\",\n    MissingClosingTagFragment: \"Expected corresponding JSX closing tag for <>.\",\n    UnexpectedSequenceExpression:\n      \"Sequence expressions cannot be directly nested inside JSX. Did you mean to wrap it in parentheses (...)?\",\n    UnsupportedJsxValue:\n      \"JSX value should be either an expression or a quoted JSX text.\",\n    UnterminatedJsxContent: \"Unterminated JSX contents.\",\n    UnwrappedAdjacentJSXElements:\n      \"Adjacent JSX elements must be wrapped in an enclosing tag. Did you want a JSX fragment <>...</>?\",\n  },\n  /* code */ ErrorCodes.SyntaxError,\n);\n/* eslint-disable sort-keys */\n\n// Be aware that this file is always executed and not only when the plugin is enabled.\n// Therefore this contexts and tokens do always exist.\ntc.j_oTag = new TokContext(\"<tag\");\ntc.j_cTag = new TokContext(\"</tag\");\ntc.j_expr = new TokContext(\"<tag>...</tag>\", true);\n\ntt.jsxName = new TokenType(\"jsxName\");\ntt.jsxText = new TokenType(\"jsxText\", { beforeExpr: true });\ntt.jsxTagStart = new TokenType(\"jsxTagStart\", { startsExpr: true });\ntt.jsxTagEnd = new TokenType(\"jsxTagEnd\");\n\ntt.jsxTagStart.updateContext = context => {\n  context.push(tc.j_expr); // treat as beginning of JSX expression\n  context.push(tc.j_oTag); // start opening tag context\n};\n\nfunction isFragment(object: ?N.JSXElement): boolean {\n  return object\n    ? object.type === \"JSXOpeningFragment\" ||\n        object.type === \"JSXClosingFragment\"\n    : false;\n}\n\n// Transforms JSX element name to string.\n\nfunction getQualifiedJSXName(\n  object: N.JSXIdentifier | N.JSXNamespacedName | N.JSXMemberExpression,\n): string {\n  if (object.type === \"JSXIdentifier\") {\n    return object.name;\n  }\n\n  if (object.type === \"JSXNamespacedName\") {\n    return object.namespace.name + \":\" + object.name.name;\n  }\n\n  if (object.type === \"JSXMemberExpression\") {\n    return (\n      getQualifiedJSXName(object.object) +\n      \".\" +\n      getQualifiedJSXName(object.property)\n    );\n  }\n\n  // istanbul ignore next\n  throw new Error(\"Node had unexpected type: \" + object.type);\n}\n\nexport default (superClass: Class<Parser>): Class<Parser> =>\n  class extends superClass {\n    // Reads inline JSX contents token.\n\n    jsxReadToken(): void {\n      let out = \"\";\n      let chunkStart = this.state.pos;\n      for (;;) {\n        if (this.state.pos >= this.length) {\n          throw this.raise(this.state.start, JsxErrors.UnterminatedJsxContent);\n        }\n\n        const ch = this.input.charCodeAt(this.state.pos);\n\n        switch (ch) {\n          case charCodes.lessThan:\n          case charCodes.leftCurlyBrace:\n            if (this.state.pos === this.state.start) {\n              if (ch === charCodes.lessThan && this.state.exprAllowed) {\n                ++this.state.pos;\n                return this.finishToken(tt.jsxTagStart);\n              }\n              return super.getTokenFromCode(ch);\n            }\n            out += this.input.slice(chunkStart, this.state.pos);\n            return this.finishToken(tt.jsxText, out);\n\n          case charCodes.ampersand:\n            out += this.input.slice(chunkStart, this.state.pos);\n            out += this.jsxReadEntity();\n            chunkStart = this.state.pos;\n            break;\n\n          case charCodes.greaterThan:\n          case charCodes.rightCurlyBrace:\n            if (process.env.BABEL_8_BREAKING) {\n              const htmlEntity =\n                ch === charCodes.rightCurlyBrace ? \"&rbrace;\" : \"&gt;\";\n              const char = this.input[this.state.pos];\n              this.raise(this.state.pos, {\n                code: ErrorCodes.SyntaxError,\n                reasonCode: \"UnexpectedToken\",\n                template: `Unexpected token \\`${char}\\`. Did you mean \\`${htmlEntity}\\` or \\`{'${char}'}\\`?`,\n              });\n            }\n          /* falls through */\n\n          default:\n            if (isNewLine(ch)) {\n              out += this.input.slice(chunkStart, this.state.pos);\n              out += this.jsxReadNewLine(true);\n              chunkStart = this.state.pos;\n            } else {\n              ++this.state.pos;\n            }\n        }\n      }\n    }\n\n    jsxReadNewLine(normalizeCRLF: boolean): string {\n      const ch = this.input.charCodeAt(this.state.pos);\n      let out;\n      ++this.state.pos;\n      if (\n        ch === charCodes.carriageReturn &&\n        this.input.charCodeAt(this.state.pos) === charCodes.lineFeed\n      ) {\n        ++this.state.pos;\n        out = normalizeCRLF ? \"\\n\" : \"\\r\\n\";\n      } else {\n        out = String.fromCharCode(ch);\n      }\n      ++this.state.curLine;\n      this.state.lineStart = this.state.pos;\n\n      return out;\n    }\n\n    jsxReadString(quote: number): void {\n      let out = \"\";\n      let chunkStart = ++this.state.pos;\n      for (;;) {\n        if (this.state.pos >= this.length) {\n          throw this.raise(this.state.start, Errors.UnterminatedString);\n        }\n\n        const ch = this.input.charCodeAt(this.state.pos);\n        if (ch === quote) break;\n        if (ch === charCodes.ampersand) {\n          out += this.input.slice(chunkStart, this.state.pos);\n          out += this.jsxReadEntity();\n          chunkStart = this.state.pos;\n        } else if (isNewLine(ch)) {\n          out += this.input.slice(chunkStart, this.state.pos);\n          out += this.jsxReadNewLine(false);\n          chunkStart = this.state.pos;\n        } else {\n          ++this.state.pos;\n        }\n      }\n      out += this.input.slice(chunkStart, this.state.pos++);\n      return this.finishToken(tt.string, out);\n    }\n\n    jsxReadEntity(): string {\n      let str = \"\";\n      let count = 0;\n      let entity;\n      let ch = this.input[this.state.pos];\n\n      const startPos = ++this.state.pos;\n      while (this.state.pos < this.length && count++ < 10) {\n        ch = this.input[this.state.pos++];\n        if (ch === \";\") {\n          if (str[0] === \"#\") {\n            if (str[1] === \"x\") {\n              str = str.substr(2);\n              if (HEX_NUMBER.test(str)) {\n                entity = String.fromCodePoint(parseInt(str, 16));\n              }\n            } else {\n              str = str.substr(1);\n              if (DECIMAL_NUMBER.test(str)) {\n                entity = String.fromCodePoint(parseInt(str, 10));\n              }\n            }\n          } else {\n            entity = XHTMLEntities[str];\n          }\n          break;\n        }\n        str += ch;\n      }\n      if (!entity) {\n        this.state.pos = startPos;\n        return \"&\";\n      }\n      return entity;\n    }\n\n    // Read a JSX identifier (valid tag or attribute name).\n    //\n    // Optimized version since JSX identifiers can\"t contain\n    // escape characters and so can be read as single slice.\n    // Also assumes that first character was already checked\n    // by isIdentifierStart in readToken.\n\n    jsxReadWord(): void {\n      let ch;\n      const start = this.state.pos;\n      do {\n        ch = this.input.charCodeAt(++this.state.pos);\n      } while (isIdentifierChar(ch) || ch === charCodes.dash);\n      return this.finishToken(\n        tt.jsxName,\n        this.input.slice(start, this.state.pos),\n      );\n    }\n\n    // Parse next token as JSX identifier\n\n    jsxParseIdentifier(): N.JSXIdentifier {\n      const node = this.startNode();\n      if (this.match(tt.jsxName)) {\n        node.name = this.state.value;\n      } else if (this.state.type.keyword) {\n        node.name = this.state.type.keyword;\n      } else {\n        this.unexpected();\n      }\n      this.next();\n      return this.finishNode(node, \"JSXIdentifier\");\n    }\n\n    // Parse namespaced identifier.\n\n    jsxParseNamespacedName(): N.JSXNamespacedName {\n      const startPos = this.state.start;\n      const startLoc = this.state.startLoc;\n      const name = this.jsxParseIdentifier();\n      if (!this.eat(tt.colon)) return name;\n\n      const node = this.startNodeAt(startPos, startLoc);\n      node.namespace = name;\n      node.name = this.jsxParseIdentifier();\n      return this.finishNode(node, \"JSXNamespacedName\");\n    }\n\n    // Parses element name in any form - namespaced, member\n    // or single identifier.\n\n    jsxParseElementName():\n      | N.JSXIdentifier\n      | N.JSXNamespacedName\n      | N.JSXMemberExpression {\n      const startPos = this.state.start;\n      const startLoc = this.state.startLoc;\n      let node = this.jsxParseNamespacedName();\n      if (node.type === \"JSXNamespacedName\") {\n        return node;\n      }\n      while (this.eat(tt.dot)) {\n        const newNode = this.startNodeAt(startPos, startLoc);\n        newNode.object = node;\n        newNode.property = this.jsxParseIdentifier();\n        node = this.finishNode(newNode, \"JSXMemberExpression\");\n      }\n      return node;\n    }\n\n    // Parses any type of JSX attribute value.\n\n    jsxParseAttributeValue(): N.Expression {\n      let node;\n      switch (this.state.type) {\n        case tt.braceL:\n          node = this.startNode();\n          this.next();\n          node = this.jsxParseExpressionContainer(node);\n          if (node.expression.type === \"JSXEmptyExpression\") {\n            this.raise(node.start, JsxErrors.AttributeIsEmpty);\n          }\n          return node;\n\n        case tt.jsxTagStart:\n        case tt.string:\n          return this.parseExprAtom();\n\n        default:\n          throw this.raise(this.state.start, JsxErrors.UnsupportedJsxValue);\n      }\n    }\n\n    // JSXEmptyExpression is unique type since it doesn't actually parse anything,\n    // and so it should start at the end of last read token (left brace) and finish\n    // at the beginning of the next one (right brace).\n\n    jsxParseEmptyExpression(): N.JSXEmptyExpression {\n      const node = this.startNodeAt(\n        this.state.lastTokEnd,\n        this.state.lastTokEndLoc,\n      );\n      return this.finishNodeAt(\n        node,\n        \"JSXEmptyExpression\",\n        this.state.start,\n        this.state.startLoc,\n      );\n    }\n\n    // Parse JSX spread child\n\n    jsxParseSpreadChild(node: N.JSXSpreadChild): N.JSXSpreadChild {\n      this.next(); // ellipsis\n      node.expression = this.parseExpression();\n      this.expect(tt.braceR);\n\n      return this.finishNode(node, \"JSXSpreadChild\");\n    }\n\n    // Parses JSX expression enclosed into curly brackets.\n\n    jsxParseExpressionContainer(\n      node: N.JSXExpressionContainer,\n    ): N.JSXExpressionContainer {\n      if (this.match(tt.braceR)) {\n        node.expression = this.jsxParseEmptyExpression();\n      } else {\n        const expression = this.parseExpression();\n\n        if (process.env.BABEL_8_BREAKING) {\n          if (\n            expression.type === \"SequenceExpression\" &&\n            !expression.extra?.parenthesized\n          ) {\n            this.raise(\n              expression.expressions[1].start,\n              JsxErrors.UnexpectedSequenceExpression,\n            );\n          }\n        }\n\n        node.expression = expression;\n      }\n      this.expect(tt.braceR);\n\n      return this.finishNode(node, \"JSXExpressionContainer\");\n    }\n\n    // Parses following JSX attribute name-value pair.\n\n    jsxParseAttribute(): N.JSXAttribute {\n      const node = this.startNode();\n      if (this.eat(tt.braceL)) {\n        this.expect(tt.ellipsis);\n        node.argument = this.parseMaybeAssignAllowIn();\n        this.expect(tt.braceR);\n        return this.finishNode(node, \"JSXSpreadAttribute\");\n      }\n      node.name = this.jsxParseNamespacedName();\n      node.value = this.eat(tt.eq) ? this.jsxParseAttributeValue() : null;\n      return this.finishNode(node, \"JSXAttribute\");\n    }\n\n    // Parses JSX opening tag starting after \"<\".\n\n    jsxParseOpeningElementAt(\n      startPos: number,\n      startLoc: Position,\n    ): N.JSXOpeningElement {\n      const node = this.startNodeAt(startPos, startLoc);\n      if (this.match(tt.jsxTagEnd)) {\n        this.expect(tt.jsxTagEnd);\n        return this.finishNode(node, \"JSXOpeningFragment\");\n      }\n      node.name = this.jsxParseElementName();\n      return this.jsxParseOpeningElementAfterName(node);\n    }\n\n    jsxParseOpeningElementAfterName(\n      node: N.JSXOpeningElement,\n    ): N.JSXOpeningElement {\n      const attributes: N.JSXAttribute[] = [];\n      while (!this.match(tt.slash) && !this.match(tt.jsxTagEnd)) {\n        attributes.push(this.jsxParseAttribute());\n      }\n      node.attributes = attributes;\n      node.selfClosing = this.eat(tt.slash);\n      this.expect(tt.jsxTagEnd);\n      return this.finishNode(node, \"JSXOpeningElement\");\n    }\n\n    // Parses JSX closing tag starting after \"</\".\n\n    jsxParseClosingElementAt(\n      startPos: number,\n      startLoc: Position,\n    ): N.JSXClosingElement {\n      const node = this.startNodeAt(startPos, startLoc);\n      if (this.match(tt.jsxTagEnd)) {\n        this.expect(tt.jsxTagEnd);\n        return this.finishNode(node, \"JSXClosingFragment\");\n      }\n      node.name = this.jsxParseElementName();\n      this.expect(tt.jsxTagEnd);\n      return this.finishNode(node, \"JSXClosingElement\");\n    }\n\n    // Parses entire JSX element, including it\"s opening tag\n    // (starting after \"<\"), attributes, contents and closing tag.\n\n    jsxParseElementAt(startPos: number, startLoc: Position): N.JSXElement {\n      const node = this.startNodeAt(startPos, startLoc);\n      const children = [];\n      const openingElement = this.jsxParseOpeningElementAt(startPos, startLoc);\n      let closingElement = null;\n\n      if (!openingElement.selfClosing) {\n        contents: for (;;) {\n          switch (this.state.type) {\n            case tt.jsxTagStart:\n              startPos = this.state.start;\n              startLoc = this.state.startLoc;\n              this.next();\n              if (this.eat(tt.slash)) {\n                closingElement = this.jsxParseClosingElementAt(\n                  startPos,\n                  startLoc,\n                );\n                break contents;\n              }\n              children.push(this.jsxParseElementAt(startPos, startLoc));\n              break;\n\n            case tt.jsxText:\n              children.push(this.parseExprAtom());\n              break;\n\n            case tt.braceL: {\n              const node = this.startNode();\n              this.next();\n              if (this.match(tt.ellipsis)) {\n                children.push(this.jsxParseSpreadChild(node));\n              } else {\n                children.push(this.jsxParseExpressionContainer(node));\n              }\n\n              break;\n            }\n            // istanbul ignore next - should never happen\n            default:\n              throw this.unexpected();\n          }\n        }\n\n        if (isFragment(openingElement) && !isFragment(closingElement)) {\n          this.raise(\n            // $FlowIgnore\n            closingElement.start,\n            JsxErrors.MissingClosingTagFragment,\n          );\n        } else if (!isFragment(openingElement) && isFragment(closingElement)) {\n          this.raise(\n            // $FlowIgnore\n            closingElement.start,\n            JsxErrors.MissingClosingTagElement,\n            getQualifiedJSXName(openingElement.name),\n          );\n        } else if (!isFragment(openingElement) && !isFragment(closingElement)) {\n          if (\n            // $FlowIgnore\n            getQualifiedJSXName(closingElement.name) !==\n            getQualifiedJSXName(openingElement.name)\n          ) {\n            this.raise(\n              // $FlowIgnore\n              closingElement.start,\n              JsxErrors.MissingClosingTagElement,\n              getQualifiedJSXName(openingElement.name),\n            );\n          }\n        }\n      }\n\n      if (isFragment(openingElement)) {\n        node.openingFragment = openingElement;\n        node.closingFragment = closingElement;\n      } else {\n        node.openingElement = openingElement;\n        node.closingElement = closingElement;\n      }\n      node.children = children;\n      if (this.isRelational(\"<\")) {\n        throw this.raise(\n          this.state.start,\n          JsxErrors.UnwrappedAdjacentJSXElements,\n        );\n      }\n\n      return isFragment(openingElement)\n        ? this.finishNode(node, \"JSXFragment\")\n        : this.finishNode(node, \"JSXElement\");\n    }\n\n    // Parses entire JSX element from current position.\n\n    jsxParseElement(): N.JSXElement {\n      const startPos = this.state.start;\n      const startLoc = this.state.startLoc;\n      this.next();\n      return this.jsxParseElementAt(startPos, startLoc);\n    }\n\n    // ==================================\n    // Overrides\n    // ==================================\n\n    parseExprAtom(refExpressionErrors: ?ExpressionErrors): N.Expression {\n      if (this.match(tt.jsxText)) {\n        return this.parseLiteral(this.state.value, \"JSXText\");\n      } else if (this.match(tt.jsxTagStart)) {\n        return this.jsxParseElement();\n      } else if (\n        this.isRelational(\"<\") &&\n        this.input.charCodeAt(this.state.pos) !== charCodes.exclamationMark\n      ) {\n        // In case we encounter an lt token here it will always be the start of\n        // jsx as the lt sign is not allowed in places that expect an expression\n        this.finishToken(tt.jsxTagStart);\n        return this.jsxParseElement();\n      } else {\n        return super.parseExprAtom(refExpressionErrors);\n      }\n    }\n\n    createLookaheadState(state: State): JSXLookaheadState {\n      const lookaheadState = ((super.createLookaheadState(\n        state,\n      ): any): JSXLookaheadState);\n      lookaheadState.inPropertyName = state.inPropertyName;\n      return lookaheadState;\n    }\n\n    getTokenFromCode(code: number): void {\n      if (this.state.inPropertyName) return super.getTokenFromCode(code);\n\n      const context = this.curContext();\n\n      if (context === tc.j_expr) {\n        return this.jsxReadToken();\n      }\n\n      if (context === tc.j_oTag || context === tc.j_cTag) {\n        if (isIdentifierStart(code)) {\n          return this.jsxReadWord();\n        }\n\n        if (code === charCodes.greaterThan) {\n          ++this.state.pos;\n          return this.finishToken(tt.jsxTagEnd);\n        }\n\n        if (\n          (code === charCodes.quotationMark || code === charCodes.apostrophe) &&\n          context === tc.j_oTag\n        ) {\n          return this.jsxReadString(code);\n        }\n      }\n\n      if (\n        code === charCodes.lessThan &&\n        this.state.exprAllowed &&\n        this.input.charCodeAt(this.state.pos + 1) !== charCodes.exclamationMark\n      ) {\n        ++this.state.pos;\n        return this.finishToken(tt.jsxTagStart);\n      }\n\n      return super.getTokenFromCode(code);\n    }\n\n    updateContext(prevType: TokenType): void {\n      super.updateContext(prevType);\n      const { context, type } = this.state;\n      if (type === tt.braceL) {\n        const curContext = context[context.length - 1];\n        if (curContext === tc.j_oTag) {\n          context.push(tc.brace);\n        } else if (curContext === tc.j_expr) {\n          context.push(tc.templateQuasi);\n        }\n        this.state.exprAllowed = true;\n      } else if (type === tt.slash && prevType === tt.jsxTagStart) {\n        context.length -= 2; // do not consider JSX expr -> JSX open tag -> ... anymore\n        context.push(tc.j_cTag); // reconsider as closing tag context\n        this.state.exprAllowed = false;\n      } else if (type === tt.jsxTagEnd) {\n        const out = context.pop();\n        if ((out === tc.j_oTag && prevType === tt.slash) || out === tc.j_cTag) {\n          context.pop();\n          this.state.exprAllowed = context[context.length - 1] === tc.j_expr;\n        } else {\n          this.state.exprAllowed = true;\n        }\n      } else if (\n        type.keyword &&\n        (prevType === tt.dot || prevType === tt.questionDot)\n      ) {\n        this.state.exprAllowed = false;\n      } else {\n        this.state.exprAllowed = type.beforeExpr;\n      }\n    }\n  };\n","// @flow\n\nimport ScopeHandler, { Scope } from \"../../util/scope\";\nimport {\n  BIND_KIND_TYPE,\n  BIND_FLAGS_TS_ENUM,\n  BIND_FLAGS_TS_CONST_ENUM,\n  BIND_FLAGS_TS_EXPORT_ONLY,\n  BIND_KIND_VALUE,\n  BIND_FLAGS_CLASS,\n  type ScopeFlags,\n  type BindingTypes,\n} from \"../../util/scopeflags\";\nimport * as N from \"../../types\";\n\nclass TypeScriptScope extends Scope {\n  types: Set<string> = new Set();\n\n  // enums (which are also in .types)\n  enums: Set<string> = new Set();\n\n  // const enums (which are also in .enums and .types)\n  constEnums: Set<string> = new Set();\n\n  // classes (which are also in .lexical) and interface (which are also in .types)\n  classes: Set<string> = new Set();\n\n  // namespaces and ambient functions (or classes) are too difficult to track,\n  // especially without type analysis.\n  // We need to track them anyway, to avoid \"X is not defined\" errors\n  // when exporting them.\n  exportOnlyBindings: Set<string> = new Set();\n}\n\n// See https://github.com/babel/babel/pull/9766#discussion_r268920730 for an\n// explanation of how typescript handles scope.\n\nexport default class TypeScriptScopeHandler extends ScopeHandler<TypeScriptScope> {\n  createScope(flags: ScopeFlags): TypeScriptScope {\n    return new TypeScriptScope(flags);\n  }\n\n  declareName(name: string, bindingType: BindingTypes, pos: number) {\n    const scope = this.currentScope();\n    if (bindingType & BIND_FLAGS_TS_EXPORT_ONLY) {\n      this.maybeExportDefined(scope, name);\n      scope.exportOnlyBindings.add(name);\n      return;\n    }\n\n    super.declareName(...arguments);\n\n    if (bindingType & BIND_KIND_TYPE) {\n      if (!(bindingType & BIND_KIND_VALUE)) {\n        // \"Value\" bindings have already been registered by the superclass.\n        this.checkRedeclarationInScope(scope, name, bindingType, pos);\n        this.maybeExportDefined(scope, name);\n      }\n      scope.types.add(name);\n    }\n    if (bindingType & BIND_FLAGS_TS_ENUM) scope.enums.add(name);\n    if (bindingType & BIND_FLAGS_TS_CONST_ENUM) scope.constEnums.add(name);\n    if (bindingType & BIND_FLAGS_CLASS) scope.classes.add(name);\n  }\n\n  isRedeclaredInScope(\n    scope: TypeScriptScope,\n    name: string,\n    bindingType: BindingTypes,\n  ): boolean {\n    if (scope.enums.has(name)) {\n      if (bindingType & BIND_FLAGS_TS_ENUM) {\n        // Enums can be merged with other enums if they are both\n        //  const or both non-const.\n        const isConst = !!(bindingType & BIND_FLAGS_TS_CONST_ENUM);\n        const wasConst = scope.constEnums.has(name);\n        return isConst !== wasConst;\n      }\n      return true;\n    }\n    if (bindingType & BIND_FLAGS_CLASS && scope.classes.has(name)) {\n      if (scope.lexical.has(name)) {\n        // Classes can be merged with interfaces\n        return !!(bindingType & BIND_KIND_VALUE);\n      } else {\n        // Interface can be merged with other classes or interfaces\n        return false;\n      }\n    }\n    if (bindingType & BIND_KIND_TYPE && scope.types.has(name)) {\n      return true;\n    }\n\n    return super.isRedeclaredInScope(...arguments);\n  }\n\n  checkLocalExport(id: N.Identifier) {\n    const topLevelScope = this.scopeStack[0];\n    const { name } = id;\n    if (\n      !topLevelScope.types.has(name) &&\n      !topLevelScope.exportOnlyBindings.has(name)\n    ) {\n      super.checkLocalExport(id);\n    }\n  }\n}\n","// @flow\nexport const PARAM = 0b0000, // Initial Parameter flags\n  PARAM_YIELD = 0b0001, // track [Yield] production parameter\n  PARAM_AWAIT = 0b0010, // track [Await] production parameter\n  PARAM_RETURN = 0b0100, // track [Return] production parameter\n  PARAM_IN = 0b1000; // track [In] production parameter\n\n// ProductionParameterHandler is a stack fashioned production parameter tracker\n// https://tc39.es/ecma262/#sec-grammar-notation\n// The tracked parameters are defined above.\n//\n// Whenever [+Await]/[+Yield] appears in the right-hand sides of a production,\n// we must enter a new tracking stack. For example when parsing\n//\n// AsyncFunctionDeclaration [Yield, Await]:\n//   async [no LineTerminator here] function BindingIdentifier[?Yield, ?Await]\n//     ( FormalParameters[~Yield, +Await] ) { AsyncFunctionBody }\n//\n// we must follow such process:\n//\n// 1. parse async keyword\n// 2. parse function keyword\n// 3. parse bindingIdentifier <= inherit current parameters: [?Await]\n// 4. enter new stack with (PARAM_AWAIT)\n// 5. parse formal parameters <= must have [Await] parameter [+Await]\n// 6. parse function body\n// 7. exit current stack\n\nexport type ParamKind =\n  | typeof PARAM\n  | typeof PARAM_AWAIT\n  | typeof PARAM_IN\n  | typeof PARAM_RETURN\n  | typeof PARAM_YIELD;\n\nexport default class ProductionParameterHandler {\n  stacks: Array<ParamKind> = [];\n  enter(flags: ParamKind) {\n    this.stacks.push(flags);\n  }\n\n  exit() {\n    this.stacks.pop();\n  }\n\n  currentFlags(): ParamKind {\n    return this.stacks[this.stacks.length - 1];\n  }\n\n  get hasAwait(): boolean {\n    return (this.currentFlags() & PARAM_AWAIT) > 0;\n  }\n\n  get hasYield(): boolean {\n    return (this.currentFlags() & PARAM_YIELD) > 0;\n  }\n\n  get hasReturn(): boolean {\n    return (this.currentFlags() & PARAM_RETURN) > 0;\n  }\n\n  get hasIn(): boolean {\n    return (this.currentFlags() & PARAM_IN) > 0;\n  }\n}\n\nexport function functionFlags(\n  isAsync: boolean,\n  isGenerator: boolean,\n): ParamKind {\n  return (isAsync ? PARAM_AWAIT : 0) | (isGenerator ? PARAM_YIELD : 0);\n}\n","// @flow\n\n/*:: declare var invariant; */\n\n// Error messages are colocated with the plugin.\n/* eslint-disable @babel/development-internal/dry-error-messages */\n\nimport type { TokenType } from \"../../tokenizer/types\";\nimport type State from \"../../tokenizer/state\";\nimport { types as tt } from \"../../tokenizer/types\";\nimport { types as ct } from \"../../tokenizer/context\";\nimport * as N from \"../../types\";\nimport type { Pos, Position } from \"../../util/location\";\nimport type Parser from \"../../parser\";\nimport {\n  type BindingTypes,\n  SCOPE_TS_MODULE,\n  SCOPE_OTHER,\n  BIND_TS_ENUM,\n  BIND_TS_CONST_ENUM,\n  BIND_TS_TYPE,\n  BIND_TS_INTERFACE,\n  BIND_TS_AMBIENT,\n  BIND_TS_NAMESPACE,\n  BIND_CLASS,\n  BIND_LEXICAL,\n} from \"../../util/scopeflags\";\nimport TypeScriptScopeHandler from \"./scope\";\nimport * as charCodes from \"charcodes\";\nimport type { ExpressionErrors } from \"../../parser/util\";\nimport { PARAM } from \"../../util/production-parameter\";\nimport {\n  Errors,\n  makeErrorTemplates,\n  type ErrorTemplate,\n  ErrorCodes,\n} from \"../../parser/error\";\n\ntype TsModifier =\n  | \"readonly\"\n  | \"abstract\"\n  | \"declare\"\n  | \"static\"\n  | \"override\"\n  | N.Accessibility;\n\nfunction nonNull<T>(x: ?T): T {\n  if (x == null) {\n    // $FlowIgnore\n    throw new Error(`Unexpected ${x} value.`);\n  }\n  return x;\n}\n\nfunction assert(x: boolean): void {\n  if (!x) {\n    throw new Error(\"Assert fail\");\n  }\n}\n\ntype ParsingContext =\n  | \"EnumMembers\"\n  | \"HeritageClauseElement\"\n  | \"TupleElementTypes\"\n  | \"TypeMembers\"\n  | \"TypeParametersOrArguments\";\n\n/* eslint sort-keys: \"error\" */\nconst TSErrors = makeErrorTemplates(\n  {\n    AbstractMethodHasImplementation:\n      \"Method '%0' cannot have an implementation because it is marked abstract.\",\n    AccesorCannotDeclareThisParameter:\n      \"'get' and 'set' accessors cannot declare 'this' parameters.\",\n    AccesorCannotHaveTypeParameters: \"An accessor cannot have type parameters.\",\n    ClassMethodHasDeclare: \"Class methods cannot have the 'declare' modifier.\",\n    ClassMethodHasReadonly:\n      \"Class methods cannot have the 'readonly' modifier.\",\n    ConstructorHasTypeParameters:\n      \"Type parameters cannot appear on a constructor declaration.\",\n    DeclareAccessor: \"'declare' is not allowed in %0ters.\",\n    DeclareClassFieldHasInitializer:\n      \"Initializers are not allowed in ambient contexts.\",\n    DeclareFunctionHasImplementation:\n      \"An implementation cannot be declared in ambient contexts.\",\n    DuplicateAccessibilityModifier: \"Accessibility modifier already seen.\",\n    DuplicateModifier: \"Duplicate modifier: '%0'.\",\n    EmptyHeritageClauseType: \"'%0' list cannot be empty.\",\n    EmptyTypeArguments: \"Type argument list cannot be empty.\",\n    EmptyTypeParameters: \"Type parameter list cannot be empty.\",\n    ExpectedAmbientAfterExportDeclare:\n      \"'export declare' must be followed by an ambient declaration.\",\n    ImportAliasHasImportType: \"An import alias can not use 'import type'.\",\n    IncompatibleModifiers: \"'%0' modifier cannot be used with '%1' modifier.\",\n    IndexSignatureHasAbstract:\n      \"Index signatures cannot have the 'abstract' modifier.\",\n    IndexSignatureHasAccessibility:\n      \"Index signatures cannot have an accessibility modifier ('%0').\",\n    IndexSignatureHasDeclare:\n      \"Index signatures cannot have the 'declare' modifier.\",\n    IndexSignatureHasOverride:\n      \"'override' modifier cannot appear on an index signature.\",\n    IndexSignatureHasStatic:\n      \"Index signatures cannot have the 'static' modifier.\",\n    InvalidModifierOnTypeMember:\n      \"'%0' modifier cannot appear on a type member.\",\n    InvalidModifiersOrder: \"'%0' modifier must precede '%1' modifier.\",\n    InvalidTupleMemberLabel:\n      \"Tuple members must be labeled with a simple identifier.\",\n    MixedLabeledAndUnlabeledElements:\n      \"Tuple members must all have names or all not have names.\",\n    NonAbstractClassHasAbstractMethod:\n      \"Abstract methods can only appear within an abstract class.\",\n    NonClassMethodPropertyHasAbstractModifer:\n      \"'abstract' modifier can only appear on a class, method, or property declaration.\",\n    OptionalTypeBeforeRequired:\n      \"A required element cannot follow an optional element.\",\n    OverrideNotInSubClass:\n      \"This member cannot have an 'override' modifier because its containing class does not extend another class.\",\n    PatternIsOptional:\n      \"A binding pattern parameter cannot be optional in an implementation signature.\",\n    PrivateElementHasAbstract:\n      \"Private elements cannot have the 'abstract' modifier.\",\n    PrivateElementHasAccessibility:\n      \"Private elements cannot have an accessibility modifier ('%0').\",\n    ReadonlyForMethodSignature:\n      \"'readonly' modifier can only appear on a property declaration or index signature.\",\n    SetAccesorCannotHaveOptionalParameter:\n      \"A 'set' accessor cannot have an optional parameter.\",\n    SetAccesorCannotHaveRestParameter:\n      \"A 'set' accessor cannot have rest parameter.\",\n    SetAccesorCannotHaveReturnType:\n      \"A 'set' accessor cannot have a return type annotation.\",\n    StaticBlockCannotHaveModifier:\n      \"Static class blocks cannot have any modifier.\",\n    TypeAnnotationAfterAssign:\n      \"Type annotations must come before default assignments, e.g. instead of `age = 25: number` use `age: number = 25`.\",\n    TypeImportCannotSpecifyDefaultAndNamed:\n      \"A type-only import can specify a default import or named bindings, but not both.\",\n    UnexpectedParameterModifier:\n      \"A parameter property is only allowed in a constructor implementation.\",\n    UnexpectedReadonly:\n      \"'readonly' type modifier is only permitted on array and tuple literal types.\",\n    UnexpectedTypeAnnotation: \"Did not expect a type annotation here.\",\n    UnexpectedTypeCastInParameter:\n      \"Unexpected type cast in parameter position.\",\n    UnsupportedImportTypeArgument:\n      \"Argument in a type import must be a string literal.\",\n    UnsupportedParameterPropertyKind:\n      \"A parameter property may not be declared using a binding pattern.\",\n    UnsupportedSignatureParameterKind:\n      \"Name in a signature must be an Identifier, ObjectPattern or ArrayPattern, instead got %0.\",\n  },\n  /* code */ ErrorCodes.SyntaxError,\n);\n/* eslint-disable sort-keys */\n\n// Doesn't handle \"void\" or \"null\" because those are keywords, not identifiers.\n// It also doesn't handle \"intrinsic\", since usually it's not a keyword.\nfunction keywordTypeFromName(\n  value: string,\n): N.TsKeywordTypeType | typeof undefined {\n  switch (value) {\n    case \"any\":\n      return \"TSAnyKeyword\";\n    case \"boolean\":\n      return \"TSBooleanKeyword\";\n    case \"bigint\":\n      return \"TSBigIntKeyword\";\n    case \"never\":\n      return \"TSNeverKeyword\";\n    case \"number\":\n      return \"TSNumberKeyword\";\n    case \"object\":\n      return \"TSObjectKeyword\";\n    case \"string\":\n      return \"TSStringKeyword\";\n    case \"symbol\":\n      return \"TSSymbolKeyword\";\n    case \"undefined\":\n      return \"TSUndefinedKeyword\";\n    case \"unknown\":\n      return \"TSUnknownKeyword\";\n    default:\n      return undefined;\n  }\n}\n\nfunction tsIsAccessModifier(modifier: string): boolean %checks {\n  return (\n    modifier === \"private\" || modifier === \"public\" || modifier === \"protected\"\n  );\n}\n\nexport default (superClass: Class<Parser>): Class<Parser> =>\n  class extends superClass {\n    getScopeHandler(): Class<TypeScriptScopeHandler> {\n      return TypeScriptScopeHandler;\n    }\n\n    tsIsIdentifier(): boolean {\n      // TODO: actually a bit more complex in TypeScript, but shouldn't matter.\n      // See https://github.com/Microsoft/TypeScript/issues/15008\n      return this.match(tt.name);\n    }\n\n    tsTokenCanFollowModifier() {\n      return (\n        (this.match(tt.bracketL) ||\n          this.match(tt.braceL) ||\n          this.match(tt.star) ||\n          this.match(tt.ellipsis) ||\n          this.match(tt.privateName) ||\n          this.isLiteralPropertyName()) &&\n        !this.hasPrecedingLineBreak()\n      );\n    }\n\n    tsNextTokenCanFollowModifier() {\n      // Note: TypeScript's implementation is much more complicated because\n      // more things are considered modifiers there.\n      // This implementation only handles modifiers not handled by @babel/parser itself. And \"static\".\n      // TODO: Would be nice to avoid lookahead. Want a hasLineBreakUpNext() method...\n      this.next();\n      return this.tsTokenCanFollowModifier();\n    }\n\n    /** Parses a modifier matching one the given modifier names. */\n    tsParseModifier<T: TsModifier>(allowedModifiers: T[]): ?T {\n      if (!this.match(tt.name)) {\n        return undefined;\n      }\n\n      const modifier = this.state.value;\n      if (\n        allowedModifiers.indexOf(modifier) !== -1 &&\n        this.tsTryParse(this.tsNextTokenCanFollowModifier.bind(this))\n      ) {\n        return modifier;\n      }\n      return undefined;\n    }\n\n    /** Parses a list of modifiers, in any order.\n     *  If you need a specific order, you must call this function multiple times:\n     *    this.tsParseModifiers(node, [\"public\"]);\n     *    this.tsParseModifiers(node, [\"abstract\", \"readonly\"]);\n     */\n    tsParseModifiers(\n      modified: {\n        [key: TsModifier]: ?true,\n        accessibility?: N.Accessibility,\n      },\n      allowedModifiers: TsModifier[],\n      disallowedModifiers?: TsModifier[],\n      errorTemplate?: ErrorTemplate,\n    ): void {\n      const enforceOrder = (pos, modifier, before, after) => {\n        if (modifier === before && modified[after]) {\n          this.raise(pos, TSErrors.InvalidModifiersOrder, before, after);\n        }\n      };\n      const incompatible = (pos, modifier, mod1, mod2) => {\n        if (\n          (modified[mod1] && modifier === mod2) ||\n          (modified[mod2] && modifier === mod1)\n        ) {\n          this.raise(pos, TSErrors.IncompatibleModifiers, mod1, mod2);\n        }\n      };\n\n      for (;;) {\n        const startPos = this.state.start;\n        const modifier: ?TsModifier = this.tsParseModifier(\n          allowedModifiers.concat(disallowedModifiers ?? []),\n        );\n\n        if (!modifier) break;\n\n        if (tsIsAccessModifier(modifier)) {\n          if (modified.accessibility) {\n            this.raise(startPos, TSErrors.DuplicateAccessibilityModifier);\n          } else {\n            enforceOrder(startPos, modifier, modifier, \"override\");\n            enforceOrder(startPos, modifier, modifier, \"static\");\n\n            modified.accessibility = modifier;\n          }\n        } else {\n          if (Object.hasOwnProperty.call(modified, modifier)) {\n            this.raise(startPos, TSErrors.DuplicateModifier, modifier);\n          } else {\n            enforceOrder(startPos, modifier, \"static\", \"readonly\");\n            enforceOrder(startPos, modifier, \"static\", \"override\");\n            enforceOrder(startPos, modifier, \"override\", \"readonly\");\n            enforceOrder(startPos, modifier, \"abstract\", \"override\");\n\n            incompatible(startPos, modifier, \"declare\", \"override\");\n            incompatible(startPos, modifier, \"static\", \"abstract\");\n          }\n          modified[modifier] = true;\n        }\n\n        if (disallowedModifiers?.includes(modifier)) {\n          this.raise(\n            startPos,\n            // $FlowIgnore\n            errorTemplate,\n            modifier,\n          );\n        }\n      }\n    }\n\n    tsIsListTerminator(kind: ParsingContext): boolean {\n      switch (kind) {\n        case \"EnumMembers\":\n        case \"TypeMembers\":\n          return this.match(tt.braceR);\n        case \"HeritageClauseElement\":\n          return this.match(tt.braceL);\n        case \"TupleElementTypes\":\n          return this.match(tt.bracketR);\n        case \"TypeParametersOrArguments\":\n          return this.isRelational(\">\");\n      }\n\n      throw new Error(\"Unreachable\");\n    }\n\n    tsParseList<T: N.Node>(kind: ParsingContext, parseElement: () => T): T[] {\n      const result: T[] = [];\n      while (!this.tsIsListTerminator(kind)) {\n        // Skipping \"parseListElement\" from the TS source since that's just for error handling.\n        result.push(parseElement());\n      }\n      return result;\n    }\n\n    tsParseDelimitedList<T: N.Node>(\n      kind: ParsingContext,\n      parseElement: () => T,\n    ): T[] {\n      return nonNull(\n        this.tsParseDelimitedListWorker(\n          kind,\n          parseElement,\n          /* expectSuccess */ true,\n        ),\n      );\n    }\n\n    /**\n     * If !expectSuccess, returns undefined instead of failing to parse.\n     * If expectSuccess, parseElement should always return a defined value.\n     */\n    tsParseDelimitedListWorker<T: N.Node>(\n      kind: ParsingContext,\n      parseElement: () => ?T,\n      expectSuccess: boolean,\n    ): ?(T[]) {\n      const result = [];\n\n      for (;;) {\n        if (this.tsIsListTerminator(kind)) {\n          break;\n        }\n\n        const element = parseElement();\n        if (element == null) {\n          return undefined;\n        }\n        result.push(element);\n\n        if (this.eat(tt.comma)) {\n          continue;\n        }\n\n        if (this.tsIsListTerminator(kind)) {\n          break;\n        }\n\n        if (expectSuccess) {\n          // This will fail with an error about a missing comma\n          this.expect(tt.comma);\n        }\n        return undefined;\n      }\n\n      return result;\n    }\n\n    tsParseBracketedList<T: N.Node>(\n      kind: ParsingContext,\n      parseElement: () => T,\n      bracket: boolean,\n      skipFirstToken: boolean,\n    ): T[] {\n      if (!skipFirstToken) {\n        if (bracket) {\n          this.expect(tt.bracketL);\n        } else {\n          this.expectRelational(\"<\");\n        }\n      }\n\n      const result = this.tsParseDelimitedList(kind, parseElement);\n\n      if (bracket) {\n        this.expect(tt.bracketR);\n      } else {\n        this.expectRelational(\">\");\n      }\n\n      return result;\n    }\n\n    tsParseImportType(): N.TsImportType {\n      const node: N.TsImportType = this.startNode();\n      this.expect(tt._import);\n      this.expect(tt.parenL);\n      if (!this.match(tt.string)) {\n        this.raise(this.state.start, TSErrors.UnsupportedImportTypeArgument);\n      }\n\n      // For compatibility to estree we cannot call parseLiteral directly here\n      node.argument = this.parseExprAtom();\n      this.expect(tt.parenR);\n\n      if (this.eat(tt.dot)) {\n        node.qualifier = this.tsParseEntityName(/* allowReservedWords */ true);\n      }\n      if (this.isRelational(\"<\")) {\n        node.typeParameters = this.tsParseTypeArguments();\n      }\n      return this.finishNode(node, \"TSImportType\");\n    }\n\n    tsParseEntityName(allowReservedWords: boolean): N.TsEntityName {\n      let entity: N.TsEntityName = this.parseIdentifier();\n      while (this.eat(tt.dot)) {\n        const node: N.TsQualifiedName = this.startNodeAtNode(entity);\n        node.left = entity;\n        node.right = this.parseIdentifier(allowReservedWords);\n        entity = this.finishNode(node, \"TSQualifiedName\");\n      }\n      return entity;\n    }\n\n    tsParseTypeReference(): N.TsTypeReference {\n      const node: N.TsTypeReference = this.startNode();\n      node.typeName = this.tsParseEntityName(/* allowReservedWords */ false);\n      if (!this.hasPrecedingLineBreak() && this.isRelational(\"<\")) {\n        node.typeParameters = this.tsParseTypeArguments();\n      }\n      return this.finishNode(node, \"TSTypeReference\");\n    }\n\n    tsParseThisTypePredicate(lhs: N.TsThisType): N.TsTypePredicate {\n      this.next();\n      const node: N.TsTypePredicate = this.startNodeAtNode(lhs);\n      node.parameterName = lhs;\n      node.typeAnnotation = this.tsParseTypeAnnotation(/* eatColon */ false);\n      node.asserts = false;\n      return this.finishNode(node, \"TSTypePredicate\");\n    }\n\n    tsParseThisTypeNode(): N.TsThisType {\n      const node: N.TsThisType = this.startNode();\n      this.next();\n      return this.finishNode(node, \"TSThisType\");\n    }\n\n    tsParseTypeQuery(): N.TsTypeQuery {\n      const node: N.TsTypeQuery = this.startNode();\n      this.expect(tt._typeof);\n      if (this.match(tt._import)) {\n        node.exprName = this.tsParseImportType();\n      } else {\n        node.exprName = this.tsParseEntityName(/* allowReservedWords */ true);\n      }\n      return this.finishNode(node, \"TSTypeQuery\");\n    }\n\n    tsParseTypeParameter(): N.TsTypeParameter {\n      const node: N.TsTypeParameter = this.startNode();\n      node.name = this.parseIdentifierName(node.start);\n      node.constraint = this.tsEatThenParseType(tt._extends);\n      node.default = this.tsEatThenParseType(tt.eq);\n      return this.finishNode(node, \"TSTypeParameter\");\n    }\n\n    tsTryParseTypeParameters(): ?N.TsTypeParameterDeclaration {\n      if (this.isRelational(\"<\")) {\n        return this.tsParseTypeParameters();\n      }\n    }\n\n    tsParseTypeParameters() {\n      const node: N.TsTypeParameterDeclaration = this.startNode();\n\n      if (this.isRelational(\"<\") || this.match(tt.jsxTagStart)) {\n        this.next();\n      } else {\n        this.unexpected();\n      }\n\n      node.params = this.tsParseBracketedList(\n        \"TypeParametersOrArguments\",\n        this.tsParseTypeParameter.bind(this),\n        /* bracket */ false,\n        /* skipFirstToken */ true,\n      );\n      if (node.params.length === 0) {\n        this.raise(node.start, TSErrors.EmptyTypeParameters);\n      }\n      return this.finishNode(node, \"TSTypeParameterDeclaration\");\n    }\n\n    tsTryNextParseConstantContext(): ?N.TsTypeReference {\n      if (this.lookahead().type === tt._const) {\n        this.next();\n        return this.tsParseTypeReference();\n      }\n      return null;\n    }\n\n    // Note: In TypeScript implementation we must provide `yieldContext` and `awaitContext`,\n    // but here it's always false, because this is only used for types.\n    tsFillSignature(\n      returnToken: TokenType,\n      signature: N.TsSignatureDeclaration,\n    ): void {\n      // Arrow fns *must* have return token (`=>`). Normal functions can omit it.\n      const returnTokenRequired = returnToken === tt.arrow;\n      signature.typeParameters = this.tsTryParseTypeParameters();\n      this.expect(tt.parenL);\n      signature.parameters = this.tsParseBindingListForSignature();\n      if (returnTokenRequired) {\n        signature.typeAnnotation =\n          this.tsParseTypeOrTypePredicateAnnotation(returnToken);\n      } else if (this.match(returnToken)) {\n        signature.typeAnnotation =\n          this.tsParseTypeOrTypePredicateAnnotation(returnToken);\n      }\n    }\n\n    tsParseBindingListForSignature(): $ReadOnlyArray<\n      N.Identifier | N.RestElement | N.ObjectPattern | N.ArrayPattern,\n    > {\n      return this.parseBindingList(tt.parenR, charCodes.rightParenthesis).map(\n        pattern => {\n          if (\n            pattern.type !== \"Identifier\" &&\n            pattern.type !== \"RestElement\" &&\n            pattern.type !== \"ObjectPattern\" &&\n            pattern.type !== \"ArrayPattern\"\n          ) {\n            this.raise(\n              pattern.start,\n              TSErrors.UnsupportedSignatureParameterKind,\n              pattern.type,\n            );\n          }\n          return (pattern: any);\n        },\n      );\n    }\n\n    tsParseTypeMemberSemicolon(): void {\n      if (!this.eat(tt.comma) && !this.isLineTerminator()) {\n        this.expect(tt.semi);\n      }\n    }\n\n    tsParseSignatureMember(\n      kind: \"TSCallSignatureDeclaration\" | \"TSConstructSignatureDeclaration\",\n      node: N.TsCallSignatureDeclaration | N.TsConstructSignatureDeclaration,\n    ): N.TsCallSignatureDeclaration | N.TsConstructSignatureDeclaration {\n      this.tsFillSignature(tt.colon, node);\n      this.tsParseTypeMemberSemicolon();\n      return this.finishNode(node, kind);\n    }\n\n    tsIsUnambiguouslyIndexSignature() {\n      this.next(); // Skip '{'\n      return this.eat(tt.name) && this.match(tt.colon);\n    }\n\n    tsTryParseIndexSignature(node: N.Node): ?N.TsIndexSignature {\n      if (\n        !(\n          this.match(tt.bracketL) &&\n          this.tsLookAhead(this.tsIsUnambiguouslyIndexSignature.bind(this))\n        )\n      ) {\n        return undefined;\n      }\n\n      this.expect(tt.bracketL);\n      const id = this.parseIdentifier();\n      id.typeAnnotation = this.tsParseTypeAnnotation();\n      this.resetEndLocation(id); // set end position to end of type\n\n      this.expect(tt.bracketR);\n      node.parameters = [id];\n\n      const type = this.tsTryParseTypeAnnotation();\n      if (type) node.typeAnnotation = type;\n      this.tsParseTypeMemberSemicolon();\n      return this.finishNode(node, \"TSIndexSignature\");\n    }\n\n    tsParsePropertyOrMethodSignature(\n      node: N.TsPropertySignature | N.TsMethodSignature,\n      readonly: boolean,\n    ): N.TsPropertySignature | N.TsMethodSignature {\n      if (this.eat(tt.question)) node.optional = true;\n      const nodeAny: any = node;\n\n      if (this.match(tt.parenL) || this.isRelational(\"<\")) {\n        if (readonly) {\n          this.raise(node.start, TSErrors.ReadonlyForMethodSignature);\n        }\n        const method: N.TsMethodSignature = nodeAny;\n        if (method.kind && this.isRelational(\"<\")) {\n          this.raise(this.state.pos, TSErrors.AccesorCannotHaveTypeParameters);\n        }\n        this.tsFillSignature(tt.colon, method);\n        this.tsParseTypeMemberSemicolon();\n        if (method.kind === \"get\") {\n          if (method.parameters.length > 0) {\n            this.raise(this.state.pos, Errors.BadGetterArity);\n            if (this.isThisParam(method.parameters[0])) {\n              this.raise(\n                this.state.pos,\n                TSErrors.AccesorCannotDeclareThisParameter,\n              );\n            }\n          }\n        } else if (method.kind === \"set\") {\n          if (method.parameters.length !== 1) {\n            this.raise(this.state.pos, Errors.BadSetterArity);\n          } else {\n            const firstParameter = method.parameters[0];\n            if (this.isThisParam(firstParameter)) {\n              this.raise(\n                this.state.pos,\n                TSErrors.AccesorCannotDeclareThisParameter,\n              );\n            }\n            if (\n              firstParameter.type === \"Identifier\" &&\n              firstParameter.optional\n            ) {\n              this.raise(\n                this.state.pos,\n                TSErrors.SetAccesorCannotHaveOptionalParameter,\n              );\n            }\n            if (firstParameter.type === \"RestElement\") {\n              this.raise(\n                this.state.pos,\n                TSErrors.SetAccesorCannotHaveRestParameter,\n              );\n            }\n          }\n          if (method.typeAnnotation) {\n            this.raise(\n              method.typeAnnotation.start,\n              TSErrors.SetAccesorCannotHaveReturnType,\n            );\n          }\n        } else {\n          method.kind = \"method\";\n        }\n        return this.finishNode(method, \"TSMethodSignature\");\n      } else {\n        const property: N.TsPropertySignature = nodeAny;\n        if (readonly) property.readonly = true;\n        const type = this.tsTryParseTypeAnnotation();\n        if (type) property.typeAnnotation = type;\n        this.tsParseTypeMemberSemicolon();\n        return this.finishNode(property, \"TSPropertySignature\");\n      }\n    }\n\n    tsParseTypeMember(): N.TsTypeElement {\n      const node: any = this.startNode();\n\n      if (this.match(tt.parenL) || this.isRelational(\"<\")) {\n        return this.tsParseSignatureMember(\"TSCallSignatureDeclaration\", node);\n      }\n\n      if (this.match(tt._new)) {\n        const id: N.Identifier = this.startNode();\n        this.next();\n        if (this.match(tt.parenL) || this.isRelational(\"<\")) {\n          return this.tsParseSignatureMember(\n            \"TSConstructSignatureDeclaration\",\n            node,\n          );\n        } else {\n          node.key = this.createIdentifier(id, \"new\");\n          return this.tsParsePropertyOrMethodSignature(node, false);\n        }\n      }\n\n      this.tsParseModifiers(\n        node,\n        [\"readonly\"],\n        [\n          \"declare\",\n          \"abstract\",\n          \"private\",\n          \"protected\",\n          \"public\",\n          \"static\",\n          \"override\",\n        ],\n        TSErrors.InvalidModifierOnTypeMember,\n      );\n\n      const idx = this.tsTryParseIndexSignature(node);\n      if (idx) {\n        return idx;\n      }\n\n      this.parsePropertyName(node, /* isPrivateNameAllowed */ false);\n      if (\n        !node.computed &&\n        node.key.type === \"Identifier\" &&\n        (node.key.name === \"get\" || node.key.name === \"set\") &&\n        this.tsTokenCanFollowModifier()\n      ) {\n        node.kind = node.key.name;\n        this.parsePropertyName(node, /* isPrivateNameAllowed */ false);\n      }\n      return this.tsParsePropertyOrMethodSignature(node, !!node.readonly);\n    }\n\n    tsParseTypeLiteral(): N.TsTypeLiteral {\n      const node: N.TsTypeLiteral = this.startNode();\n      node.members = this.tsParseObjectTypeMembers();\n      return this.finishNode(node, \"TSTypeLiteral\");\n    }\n\n    tsParseObjectTypeMembers(): $ReadOnlyArray<N.TsTypeElement> {\n      this.expect(tt.braceL);\n      const members = this.tsParseList(\n        \"TypeMembers\",\n        this.tsParseTypeMember.bind(this),\n      );\n      this.expect(tt.braceR);\n      return members;\n    }\n\n    tsIsStartOfMappedType(): boolean {\n      this.next();\n      if (this.eat(tt.plusMin)) {\n        return this.isContextual(\"readonly\");\n      }\n      if (this.isContextual(\"readonly\")) {\n        this.next();\n      }\n      if (!this.match(tt.bracketL)) {\n        return false;\n      }\n      this.next();\n      if (!this.tsIsIdentifier()) {\n        return false;\n      }\n      this.next();\n      return this.match(tt._in);\n    }\n\n    tsParseMappedTypeParameter(): N.TsTypeParameter {\n      const node: N.TsTypeParameter = this.startNode();\n      node.name = this.parseIdentifierName(node.start);\n      node.constraint = this.tsExpectThenParseType(tt._in);\n      return this.finishNode(node, \"TSTypeParameter\");\n    }\n\n    tsParseMappedType(): N.TsMappedType {\n      const node: N.TsMappedType = this.startNode();\n\n      this.expect(tt.braceL);\n\n      if (this.match(tt.plusMin)) {\n        node.readonly = this.state.value;\n        this.next();\n        this.expectContextual(\"readonly\");\n      } else if (this.eatContextual(\"readonly\")) {\n        node.readonly = true;\n      }\n\n      this.expect(tt.bracketL);\n      node.typeParameter = this.tsParseMappedTypeParameter();\n      node.nameType = this.eatContextual(\"as\") ? this.tsParseType() : null;\n\n      this.expect(tt.bracketR);\n\n      if (this.match(tt.plusMin)) {\n        node.optional = this.state.value;\n        this.next();\n        this.expect(tt.question);\n      } else if (this.eat(tt.question)) {\n        node.optional = true;\n      }\n\n      node.typeAnnotation = this.tsTryParseType();\n      this.semicolon();\n      this.expect(tt.braceR);\n\n      return this.finishNode(node, \"TSMappedType\");\n    }\n\n    tsParseTupleType(): N.TsTupleType {\n      const node: N.TsTupleType = this.startNode();\n      node.elementTypes = this.tsParseBracketedList(\n        \"TupleElementTypes\",\n        this.tsParseTupleElementType.bind(this),\n        /* bracket */ true,\n        /* skipFirstToken */ false,\n      );\n\n      // Validate the elementTypes to ensure that no mandatory elements\n      // follow optional elements\n      let seenOptionalElement = false;\n      let labeledElements = null;\n      node.elementTypes.forEach(elementNode => {\n        let { type } = elementNode;\n\n        if (\n          seenOptionalElement &&\n          type !== \"TSRestType\" &&\n          type !== \"TSOptionalType\" &&\n          !(type === \"TSNamedTupleMember\" && elementNode.optional)\n        ) {\n          this.raise(elementNode.start, TSErrors.OptionalTypeBeforeRequired);\n        }\n\n        // Flow doesn't support ||=\n        seenOptionalElement =\n          seenOptionalElement ||\n          (type === \"TSNamedTupleMember\" && elementNode.optional) ||\n          type === \"TSOptionalType\";\n\n        // When checking labels, check the argument of the spread operator\n        if (type === \"TSRestType\") {\n          elementNode = elementNode.typeAnnotation;\n          type = elementNode.type;\n        }\n\n        const isLabeled = type === \"TSNamedTupleMember\";\n        // Flow doesn't support ??=\n        labeledElements = labeledElements ?? isLabeled;\n        if (labeledElements !== isLabeled) {\n          this.raise(\n            elementNode.start,\n            TSErrors.MixedLabeledAndUnlabeledElements,\n          );\n        }\n      });\n\n      return this.finishNode(node, \"TSTupleType\");\n    }\n\n    tsParseTupleElementType(): N.TsType | N.TsNamedTupleMember {\n      // parses `...TsType[]`\n\n      const { start: startPos, startLoc } = this.state;\n\n      const rest = this.eat(tt.ellipsis);\n      let type = this.tsParseType();\n      const optional = this.eat(tt.question);\n      const labeled = this.eat(tt.colon);\n\n      if (labeled) {\n        const labeledNode: N.TsNamedTupleMember = this.startNodeAtNode(type);\n        labeledNode.optional = optional;\n\n        if (\n          type.type === \"TSTypeReference\" &&\n          !type.typeParameters &&\n          type.typeName.type === \"Identifier\"\n        ) {\n          labeledNode.label = (type.typeName: N.Identifier);\n        } else {\n          this.raise(type.start, TSErrors.InvalidTupleMemberLabel);\n          // This produces an invalid AST, but at least we don't drop\n          // nodes representing the invalid source.\n          // $FlowIgnore\n          labeledNode.label = type;\n        }\n\n        labeledNode.elementType = this.tsParseType();\n        type = this.finishNode(labeledNode, \"TSNamedTupleMember\");\n      } else if (optional) {\n        const optionalTypeNode: N.TsOptionalType = this.startNodeAtNode(type);\n        optionalTypeNode.typeAnnotation = type;\n        type = this.finishNode(optionalTypeNode, \"TSOptionalType\");\n      }\n\n      if (rest) {\n        const restNode: N.TsRestType = this.startNodeAt(startPos, startLoc);\n        restNode.typeAnnotation = type;\n        type = this.finishNode(restNode, \"TSRestType\");\n      }\n\n      return type;\n    }\n\n    tsParseParenthesizedType(): N.TsParenthesizedType {\n      const node = this.startNode();\n      this.expect(tt.parenL);\n      node.typeAnnotation = this.tsParseType();\n      this.expect(tt.parenR);\n      return this.finishNode(node, \"TSParenthesizedType\");\n    }\n\n    tsParseFunctionOrConstructorType(\n      type: \"TSFunctionType\" | \"TSConstructorType\",\n      abstract?: boolean,\n    ): N.TsFunctionOrConstructorType {\n      const node: N.TsFunctionOrConstructorType = this.startNode();\n      if (type === \"TSConstructorType\") {\n        // $FlowIgnore\n        node.abstract = !!abstract;\n        if (abstract) this.next();\n        this.next(); // eat `new`\n      }\n      this.tsFillSignature(tt.arrow, node);\n      return this.finishNode(node, type);\n    }\n\n    tsParseLiteralTypeNode(): N.TsLiteralType {\n      const node: N.TsLiteralType = this.startNode();\n      node.literal = (() => {\n        switch (this.state.type) {\n          case tt.num:\n          case tt.bigint:\n          case tt.string:\n          case tt._true:\n          case tt._false:\n            // For compatibility to estree we cannot call parseLiteral directly here\n            return this.parseExprAtom();\n          default:\n            throw this.unexpected();\n        }\n      })();\n      return this.finishNode(node, \"TSLiteralType\");\n    }\n\n    tsParseTemplateLiteralType(): N.TsType {\n      const node: N.TsLiteralType = this.startNode();\n      node.literal = this.parseTemplate(false);\n      return this.finishNode(node, \"TSLiteralType\");\n    }\n\n    parseTemplateSubstitution(): N.TsType {\n      if (this.state.inType) return this.tsParseType();\n      return super.parseTemplateSubstitution();\n    }\n\n    tsParseThisTypeOrThisTypePredicate(): N.TsThisType | N.TsTypePredicate {\n      const thisKeyword = this.tsParseThisTypeNode();\n      if (this.isContextual(\"is\") && !this.hasPrecedingLineBreak()) {\n        return this.tsParseThisTypePredicate(thisKeyword);\n      } else {\n        return thisKeyword;\n      }\n    }\n\n    tsParseNonArrayType(): N.TsType {\n      switch (this.state.type) {\n        case tt.name:\n        case tt._void:\n        case tt._null: {\n          const type = this.match(tt._void)\n            ? \"TSVoidKeyword\"\n            : this.match(tt._null)\n            ? \"TSNullKeyword\"\n            : keywordTypeFromName(this.state.value);\n          if (\n            type !== undefined &&\n            this.lookaheadCharCode() !== charCodes.dot\n          ) {\n            const node: N.TsKeywordType = this.startNode();\n            this.next();\n            return this.finishNode(node, type);\n          }\n          return this.tsParseTypeReference();\n        }\n        case tt.string:\n        case tt.num:\n        case tt.bigint:\n        case tt._true:\n        case tt._false:\n          return this.tsParseLiteralTypeNode();\n        case tt.plusMin:\n          if (this.state.value === \"-\") {\n            const node: N.TsLiteralType = this.startNode();\n            const nextToken = this.lookahead();\n            if (nextToken.type !== tt.num && nextToken.type !== tt.bigint) {\n              throw this.unexpected();\n            }\n            node.literal = this.parseMaybeUnary();\n            return this.finishNode(node, \"TSLiteralType\");\n          }\n          break;\n        case tt._this:\n          return this.tsParseThisTypeOrThisTypePredicate();\n        case tt._typeof:\n          return this.tsParseTypeQuery();\n        case tt._import:\n          return this.tsParseImportType();\n        case tt.braceL:\n          return this.tsLookAhead(this.tsIsStartOfMappedType.bind(this))\n            ? this.tsParseMappedType()\n            : this.tsParseTypeLiteral();\n        case tt.bracketL:\n          return this.tsParseTupleType();\n        case tt.parenL:\n          if (process.env.BABEL_8_BREAKING) {\n            if (!this.options.createParenthesizedExpressions) {\n              const startPos = this.state.start;\n              this.next();\n              const type = this.tsParseType();\n              this.expect(tt.parenR);\n              this.addExtra(type, \"parenthesized\", true);\n              this.addExtra(type, \"parenStart\", startPos);\n              return type;\n            }\n          }\n\n          return this.tsParseParenthesizedType();\n        case tt.backQuote:\n          return this.tsParseTemplateLiteralType();\n      }\n\n      throw this.unexpected();\n    }\n\n    tsParseArrayTypeOrHigher(): N.TsType {\n      let type = this.tsParseNonArrayType();\n      while (!this.hasPrecedingLineBreak() && this.eat(tt.bracketL)) {\n        if (this.match(tt.bracketR)) {\n          const node: N.TsArrayType = this.startNodeAtNode(type);\n          node.elementType = type;\n          this.expect(tt.bracketR);\n          type = this.finishNode(node, \"TSArrayType\");\n        } else {\n          const node: N.TsIndexedAccessType = this.startNodeAtNode(type);\n          node.objectType = type;\n          node.indexType = this.tsParseType();\n          this.expect(tt.bracketR);\n          type = this.finishNode(node, \"TSIndexedAccessType\");\n        }\n      }\n      return type;\n    }\n\n    tsParseTypeOperator(\n      operator: \"keyof\" | \"unique\" | \"readonly\",\n    ): N.TsTypeOperator {\n      const node: N.TsTypeOperator = this.startNode();\n      this.expectContextual(operator);\n      node.operator = operator;\n      node.typeAnnotation = this.tsParseTypeOperatorOrHigher();\n\n      if (operator === \"readonly\") {\n        this.tsCheckTypeAnnotationForReadOnly(node);\n      }\n\n      return this.finishNode(node, \"TSTypeOperator\");\n    }\n\n    tsCheckTypeAnnotationForReadOnly(node: N.Node) {\n      switch (node.typeAnnotation.type) {\n        case \"TSTupleType\":\n        case \"TSArrayType\":\n          return;\n        default:\n          this.raise(node.start, TSErrors.UnexpectedReadonly);\n      }\n    }\n\n    tsParseInferType(): N.TsInferType {\n      const node = this.startNode();\n      this.expectContextual(\"infer\");\n      const typeParameter = this.startNode();\n      typeParameter.name = this.parseIdentifierName(typeParameter.start);\n      node.typeParameter = this.finishNode(typeParameter, \"TSTypeParameter\");\n      return this.finishNode(node, \"TSInferType\");\n    }\n\n    tsParseTypeOperatorOrHigher(): N.TsType {\n      const operator = [\"keyof\", \"unique\", \"readonly\"].find(kw =>\n        this.isContextual(kw),\n      );\n      return operator\n        ? this.tsParseTypeOperator(operator)\n        : this.isContextual(\"infer\")\n        ? this.tsParseInferType()\n        : this.tsParseArrayTypeOrHigher();\n    }\n\n    tsParseUnionOrIntersectionType(\n      kind: \"TSUnionType\" | \"TSIntersectionType\",\n      parseConstituentType: () => N.TsType,\n      operator: TokenType,\n    ): N.TsType {\n      const node: N.TsUnionType | N.TsIntersectionType = this.startNode();\n      const hasLeadingOperator = this.eat(operator);\n      const types = [];\n      do {\n        types.push(parseConstituentType());\n      } while (this.eat(operator));\n      if (types.length === 1 && !hasLeadingOperator) {\n        return types[0];\n      }\n      node.types = types;\n      return this.finishNode(node, kind);\n    }\n\n    tsParseIntersectionTypeOrHigher(): N.TsType {\n      return this.tsParseUnionOrIntersectionType(\n        \"TSIntersectionType\",\n        this.tsParseTypeOperatorOrHigher.bind(this),\n        tt.bitwiseAND,\n      );\n    }\n\n    tsParseUnionTypeOrHigher() {\n      return this.tsParseUnionOrIntersectionType(\n        \"TSUnionType\",\n        this.tsParseIntersectionTypeOrHigher.bind(this),\n        tt.bitwiseOR,\n      );\n    }\n\n    tsIsStartOfFunctionType() {\n      if (this.isRelational(\"<\")) {\n        return true;\n      }\n      return (\n        this.match(tt.parenL) &&\n        this.tsLookAhead(this.tsIsUnambiguouslyStartOfFunctionType.bind(this))\n      );\n    }\n\n    tsSkipParameterStart(): boolean {\n      if (this.match(tt.name) || this.match(tt._this)) {\n        this.next();\n        return true;\n      }\n\n      if (this.match(tt.braceL)) {\n        let braceStackCounter = 1;\n        this.next();\n\n        while (braceStackCounter > 0) {\n          if (this.match(tt.braceL)) {\n            ++braceStackCounter;\n          } else if (this.match(tt.braceR)) {\n            --braceStackCounter;\n          }\n          this.next();\n        }\n        return true;\n      }\n\n      if (this.match(tt.bracketL)) {\n        let braceStackCounter = 1;\n        this.next();\n\n        while (braceStackCounter > 0) {\n          if (this.match(tt.bracketL)) {\n            ++braceStackCounter;\n          } else if (this.match(tt.bracketR)) {\n            --braceStackCounter;\n          }\n          this.next();\n        }\n        return true;\n      }\n\n      return false;\n    }\n\n    tsIsUnambiguouslyStartOfFunctionType(): boolean {\n      this.next();\n      if (this.match(tt.parenR) || this.match(tt.ellipsis)) {\n        // ( )\n        // ( ...\n        return true;\n      }\n      if (this.tsSkipParameterStart()) {\n        if (\n          this.match(tt.colon) ||\n          this.match(tt.comma) ||\n          this.match(tt.question) ||\n          this.match(tt.eq)\n        ) {\n          // ( xxx :\n          // ( xxx ,\n          // ( xxx ?\n          // ( xxx =\n          return true;\n        }\n        if (this.match(tt.parenR)) {\n          this.next();\n          if (this.match(tt.arrow)) {\n            // ( xxx ) =>\n            return true;\n          }\n        }\n      }\n      return false;\n    }\n\n    tsParseTypeOrTypePredicateAnnotation(\n      returnToken: TokenType,\n    ): N.TsTypeAnnotation {\n      return this.tsInType(() => {\n        const t: N.TsTypeAnnotation = this.startNode();\n        this.expect(returnToken);\n\n        const node = this.startNode<N.TsTypePredicate>();\n\n        const asserts = !!this.tsTryParse(\n          this.tsParseTypePredicateAsserts.bind(this),\n        );\n\n        if (asserts && this.match(tt._this)) {\n          // When asserts is false, thisKeyword is handled by tsParseNonArrayType\n          // : asserts this is type\n          let thisTypePredicate = this.tsParseThisTypeOrThisTypePredicate();\n          // if it turns out to be a `TSThisType`, wrap it with `TSTypePredicate`\n          // : asserts this\n          if (thisTypePredicate.type === \"TSThisType\") {\n            node.parameterName = (thisTypePredicate: N.TsThisType);\n            node.asserts = true;\n            (node: N.TsTypePredicate).typeAnnotation = null;\n            thisTypePredicate = this.finishNode(node, \"TSTypePredicate\");\n          } else {\n            this.resetStartLocationFromNode(thisTypePredicate, node);\n            (thisTypePredicate: N.TsTypePredicate).asserts = true;\n          }\n          t.typeAnnotation = thisTypePredicate;\n          return this.finishNode(t, \"TSTypeAnnotation\");\n        }\n\n        const typePredicateVariable =\n          this.tsIsIdentifier() &&\n          this.tsTryParse(this.tsParseTypePredicatePrefix.bind(this));\n\n        if (!typePredicateVariable) {\n          if (!asserts) {\n            // : type\n            return this.tsParseTypeAnnotation(/* eatColon */ false, t);\n          }\n\n          // : asserts foo\n          node.parameterName = this.parseIdentifier();\n          node.asserts = asserts;\n          (node: N.TsTypePredicate).typeAnnotation = null;\n          t.typeAnnotation = this.finishNode(node, \"TSTypePredicate\");\n          return this.finishNode(t, \"TSTypeAnnotation\");\n        }\n\n        // : asserts foo is type\n        const type = this.tsParseTypeAnnotation(/* eatColon */ false);\n        node.parameterName = typePredicateVariable;\n        node.typeAnnotation = type;\n        node.asserts = asserts;\n        t.typeAnnotation = this.finishNode(node, \"TSTypePredicate\");\n        return this.finishNode(t, \"TSTypeAnnotation\");\n      });\n    }\n\n    tsTryParseTypeOrTypePredicateAnnotation(): ?N.TsTypeAnnotation {\n      return this.match(tt.colon)\n        ? this.tsParseTypeOrTypePredicateAnnotation(tt.colon)\n        : undefined;\n    }\n\n    tsTryParseTypeAnnotation(): ?N.TsTypeAnnotation {\n      return this.match(tt.colon) ? this.tsParseTypeAnnotation() : undefined;\n    }\n\n    tsTryParseType(): ?N.TsType {\n      return this.tsEatThenParseType(tt.colon);\n    }\n\n    tsParseTypePredicatePrefix(): ?N.Identifier {\n      const id = this.parseIdentifier();\n      if (this.isContextual(\"is\") && !this.hasPrecedingLineBreak()) {\n        this.next();\n        return id;\n      }\n    }\n\n    tsParseTypePredicateAsserts(): boolean {\n      if (\n        !this.match(tt.name) ||\n        this.state.value !== \"asserts\" ||\n        this.hasPrecedingLineBreak()\n      ) {\n        return false;\n      }\n      const containsEsc = this.state.containsEsc;\n      this.next();\n      if (!this.match(tt.name) && !this.match(tt._this)) {\n        return false;\n      }\n\n      if (containsEsc) {\n        this.raise(\n          this.state.lastTokStart,\n          Errors.InvalidEscapedReservedWord,\n          \"asserts\",\n        );\n      }\n\n      return true;\n    }\n\n    tsParseTypeAnnotation(\n      eatColon = true,\n      t: N.TsTypeAnnotation = this.startNode(),\n    ): N.TsTypeAnnotation {\n      this.tsInType(() => {\n        if (eatColon) this.expect(tt.colon);\n        t.typeAnnotation = this.tsParseType();\n      });\n      return this.finishNode(t, \"TSTypeAnnotation\");\n    }\n\n    /** Be sure to be in a type context before calling this, using `tsInType`. */\n    tsParseType(): N.TsType {\n      // Need to set `state.inType` so that we don't parse JSX in a type context.\n      assert(this.state.inType);\n      const type = this.tsParseNonConditionalType();\n      if (this.hasPrecedingLineBreak() || !this.eat(tt._extends)) {\n        return type;\n      }\n      const node: N.TsConditionalType = this.startNodeAtNode(type);\n      node.checkType = type;\n      node.extendsType = this.tsParseNonConditionalType();\n      this.expect(tt.question);\n      node.trueType = this.tsParseType();\n      this.expect(tt.colon);\n      node.falseType = this.tsParseType();\n      return this.finishNode(node, \"TSConditionalType\");\n    }\n\n    isAbstractConstructorSignature(): boolean {\n      return this.isContextual(\"abstract\") && this.lookahead().type === tt._new;\n    }\n\n    tsParseNonConditionalType(): N.TsType {\n      if (this.tsIsStartOfFunctionType()) {\n        return this.tsParseFunctionOrConstructorType(\"TSFunctionType\");\n      }\n      if (this.match(tt._new)) {\n        // As in `new () => Date`\n        return this.tsParseFunctionOrConstructorType(\"TSConstructorType\");\n      } else if (this.isAbstractConstructorSignature()) {\n        // As in `abstract new () => Date`\n        return this.tsParseFunctionOrConstructorType(\n          \"TSConstructorType\",\n          /* abstract */ true,\n        );\n      }\n      return this.tsParseUnionTypeOrHigher();\n    }\n\n    tsParseTypeAssertion(): N.TsTypeAssertion {\n      const node: N.TsTypeAssertion = this.startNode();\n      const _const = this.tsTryNextParseConstantContext();\n      node.typeAnnotation = _const || this.tsNextThenParseType();\n      this.expectRelational(\">\");\n      node.expression = this.parseMaybeUnary();\n      return this.finishNode(node, \"TSTypeAssertion\");\n    }\n\n    tsParseHeritageClause(\n      descriptor: string,\n    ): $ReadOnlyArray<N.TsExpressionWithTypeArguments> {\n      const originalStart = this.state.start;\n\n      const delimitedList = this.tsParseDelimitedList(\n        \"HeritageClauseElement\",\n        this.tsParseExpressionWithTypeArguments.bind(this),\n      );\n\n      if (!delimitedList.length) {\n        this.raise(originalStart, TSErrors.EmptyHeritageClauseType, descriptor);\n      }\n\n      return delimitedList;\n    }\n\n    tsParseExpressionWithTypeArguments(): N.TsExpressionWithTypeArguments {\n      const node: N.TsExpressionWithTypeArguments = this.startNode();\n      // Note: TS uses parseLeftHandSideExpressionOrHigher,\n      // then has grammar errors later if it's not an EntityName.\n      node.expression = this.tsParseEntityName(/* allowReservedWords */ false);\n      if (this.isRelational(\"<\")) {\n        node.typeParameters = this.tsParseTypeArguments();\n      }\n\n      return this.finishNode(node, \"TSExpressionWithTypeArguments\");\n    }\n\n    tsParseInterfaceDeclaration(\n      node: N.TsInterfaceDeclaration,\n    ): N.TsInterfaceDeclaration {\n      node.id = this.parseIdentifier();\n      this.checkLVal(\n        node.id,\n        \"typescript interface declaration\",\n        BIND_TS_INTERFACE,\n      );\n      node.typeParameters = this.tsTryParseTypeParameters();\n      if (this.eat(tt._extends)) {\n        node.extends = this.tsParseHeritageClause(\"extends\");\n      }\n      const body: N.TSInterfaceBody = this.startNode();\n      body.body = this.tsInType(this.tsParseObjectTypeMembers.bind(this));\n      node.body = this.finishNode(body, \"TSInterfaceBody\");\n      return this.finishNode(node, \"TSInterfaceDeclaration\");\n    }\n\n    tsParseTypeAliasDeclaration(\n      node: N.TsTypeAliasDeclaration,\n    ): N.TsTypeAliasDeclaration {\n      node.id = this.parseIdentifier();\n      this.checkLVal(node.id, \"typescript type alias\", BIND_TS_TYPE);\n\n      node.typeParameters = this.tsTryParseTypeParameters();\n      node.typeAnnotation = this.tsInType(() => {\n        this.expect(tt.eq);\n\n        if (\n          this.isContextual(\"intrinsic\") &&\n          this.lookahead().type !== tt.dot\n        ) {\n          const node: N.TsKeywordType = this.startNode();\n          this.next();\n          return this.finishNode(node, \"TSIntrinsicKeyword\");\n        }\n\n        return this.tsParseType();\n      });\n\n      this.semicolon();\n      return this.finishNode(node, \"TSTypeAliasDeclaration\");\n    }\n\n    tsInNoContext<T>(cb: () => T): T {\n      const oldContext = this.state.context;\n      this.state.context = [oldContext[0]];\n      try {\n        return cb();\n      } finally {\n        this.state.context = oldContext;\n      }\n    }\n\n    /**\n     * Runs `cb` in a type context.\n     * This should be called one token *before* the first type token,\n     * so that the call to `next()` is run in type context.\n     */\n    tsInType<T>(cb: () => T): T {\n      const oldInType = this.state.inType;\n      this.state.inType = true;\n      try {\n        return cb();\n      } finally {\n        this.state.inType = oldInType;\n      }\n    }\n\n    tsEatThenParseType(token: TokenType): N.TsType | typeof undefined {\n      return !this.match(token) ? undefined : this.tsNextThenParseType();\n    }\n\n    tsExpectThenParseType(token: TokenType): N.TsType {\n      return this.tsDoThenParseType(() => this.expect(token));\n    }\n\n    tsNextThenParseType(): N.TsType {\n      return this.tsDoThenParseType(() => this.next());\n    }\n\n    tsDoThenParseType(cb: () => void): N.TsType {\n      return this.tsInType(() => {\n        cb();\n        return this.tsParseType();\n      });\n    }\n\n    tsParseEnumMember(): N.TsEnumMember {\n      const node: N.TsEnumMember = this.startNode();\n      // Computed property names are grammar errors in an enum, so accept just string literal or identifier.\n      node.id = this.match(tt.string)\n        ? this.parseExprAtom()\n        : this.parseIdentifier(/* liberal */ true);\n      if (this.eat(tt.eq)) {\n        node.initializer = this.parseMaybeAssignAllowIn();\n      }\n      return this.finishNode(node, \"TSEnumMember\");\n    }\n\n    tsParseEnumDeclaration(\n      node: N.TsEnumDeclaration,\n      isConst: boolean,\n    ): N.TsEnumDeclaration {\n      if (isConst) node.const = true;\n      node.id = this.parseIdentifier();\n      this.checkLVal(\n        node.id,\n        \"typescript enum declaration\",\n        isConst ? BIND_TS_CONST_ENUM : BIND_TS_ENUM,\n      );\n\n      this.expect(tt.braceL);\n      node.members = this.tsParseDelimitedList(\n        \"EnumMembers\",\n        this.tsParseEnumMember.bind(this),\n      );\n      this.expect(tt.braceR);\n      return this.finishNode(node, \"TSEnumDeclaration\");\n    }\n\n    tsParseModuleBlock(): N.TsModuleBlock {\n      const node: N.TsModuleBlock = this.startNode();\n      this.scope.enter(SCOPE_OTHER);\n\n      this.expect(tt.braceL);\n      // Inside of a module block is considered \"top-level\", meaning it can have imports and exports.\n      this.parseBlockOrModuleBlockBody(\n        (node.body = []),\n        /* directives */ undefined,\n        /* topLevel */ true,\n        /* end */ tt.braceR,\n      );\n      this.scope.exit();\n      return this.finishNode(node, \"TSModuleBlock\");\n    }\n\n    tsParseModuleOrNamespaceDeclaration(\n      node: N.TsModuleDeclaration,\n      nested?: boolean = false,\n    ): N.TsModuleDeclaration {\n      node.id = this.parseIdentifier();\n\n      if (!nested) {\n        this.checkLVal(\n          node.id,\n          \"module or namespace declaration\",\n          BIND_TS_NAMESPACE,\n        );\n      }\n\n      if (this.eat(tt.dot)) {\n        const inner = this.startNode();\n        this.tsParseModuleOrNamespaceDeclaration(inner, true);\n        node.body = inner;\n      } else {\n        this.scope.enter(SCOPE_TS_MODULE);\n        this.prodParam.enter(PARAM);\n        node.body = this.tsParseModuleBlock();\n        this.prodParam.exit();\n        this.scope.exit();\n      }\n      return this.finishNode(node, \"TSModuleDeclaration\");\n    }\n\n    tsParseAmbientExternalModuleDeclaration(\n      node: N.TsModuleDeclaration,\n    ): N.TsModuleDeclaration {\n      if (this.isContextual(\"global\")) {\n        node.global = true;\n        node.id = this.parseIdentifier();\n      } else if (this.match(tt.string)) {\n        node.id = this.parseExprAtom();\n      } else {\n        this.unexpected();\n      }\n      if (this.match(tt.braceL)) {\n        this.scope.enter(SCOPE_TS_MODULE);\n        this.prodParam.enter(PARAM);\n        node.body = this.tsParseModuleBlock();\n        this.prodParam.exit();\n        this.scope.exit();\n      } else {\n        this.semicolon();\n      }\n\n      return this.finishNode(node, \"TSModuleDeclaration\");\n    }\n\n    tsParseImportEqualsDeclaration(\n      node: N.TsImportEqualsDeclaration,\n      isExport?: boolean,\n    ): N.TsImportEqualsDeclaration {\n      node.isExport = isExport || false;\n      node.id = this.parseIdentifier();\n      this.checkLVal(node.id, \"import equals declaration\", BIND_LEXICAL);\n      this.expect(tt.eq);\n      const moduleReference = this.tsParseModuleReference();\n      if (\n        node.importKind === \"type\" &&\n        moduleReference.type !== \"TSExternalModuleReference\"\n      ) {\n        this.raise(moduleReference.start, TSErrors.ImportAliasHasImportType);\n      }\n      node.moduleReference = moduleReference;\n      this.semicolon();\n      return this.finishNode(node, \"TSImportEqualsDeclaration\");\n    }\n\n    tsIsExternalModuleReference(): boolean {\n      return (\n        this.isContextual(\"require\") &&\n        this.lookaheadCharCode() === charCodes.leftParenthesis\n      );\n    }\n\n    tsParseModuleReference(): N.TsModuleReference {\n      return this.tsIsExternalModuleReference()\n        ? this.tsParseExternalModuleReference()\n        : this.tsParseEntityName(/* allowReservedWords */ false);\n    }\n\n    tsParseExternalModuleReference(): N.TsExternalModuleReference {\n      const node: N.TsExternalModuleReference = this.startNode();\n      this.expectContextual(\"require\");\n      this.expect(tt.parenL);\n      if (!this.match(tt.string)) {\n        throw this.unexpected();\n      }\n      // For compatibility to estree we cannot call parseLiteral directly here\n      node.expression = this.parseExprAtom();\n      this.expect(tt.parenR);\n      return this.finishNode(node, \"TSExternalModuleReference\");\n    }\n\n    // Utilities\n\n    tsLookAhead<T>(f: () => T): T {\n      const state = this.state.clone();\n      const res = f();\n      this.state = state;\n      return res;\n    }\n\n    tsTryParseAndCatch<T: ?N.NodeBase>(f: () => T): ?T {\n      const result = this.tryParse(abort => f() || abort());\n\n      if (result.aborted || !result.node) return undefined;\n      if (result.error) this.state = result.failState;\n      return result.node;\n    }\n\n    tsTryParse<T>(f: () => ?T): ?T {\n      const state = this.state.clone();\n      const result = f();\n      if (result !== undefined && result !== false) {\n        return result;\n      } else {\n        this.state = state;\n        return undefined;\n      }\n    }\n\n    tsTryParseDeclare(nany: any): ?N.Declaration {\n      if (this.isLineTerminator()) {\n        return;\n      }\n      let starttype = this.state.type;\n      let kind;\n\n      if (this.isContextual(\"let\")) {\n        starttype = tt._var;\n        kind = \"let\";\n      }\n\n      return this.tsInAmbientContext(() => {\n        switch (starttype) {\n          case tt._function:\n            nany.declare = true;\n            return this.parseFunctionStatement(\n              nany,\n              /* async */ false,\n              /* declarationPosition */ true,\n            );\n          case tt._class:\n            // While this is also set by tsParseExpressionStatement, we need to set it\n            // before parsing the class declaration to now how to register it in the scope.\n            nany.declare = true;\n            return this.parseClass(\n              nany,\n              /* isStatement */ true,\n              /* optionalId */ false,\n            );\n          case tt._const:\n            if (this.match(tt._const) && this.isLookaheadContextual(\"enum\")) {\n              // `const enum = 0;` not allowed because \"enum\" is a strict mode reserved word.\n              this.expect(tt._const);\n              this.expectContextual(\"enum\");\n              return this.tsParseEnumDeclaration(nany, /* isConst */ true);\n            }\n          // falls through\n          case tt._var:\n            kind = kind || this.state.value;\n            return this.parseVarStatement(nany, kind);\n          case tt.name: {\n            const value = this.state.value;\n            if (value === \"global\") {\n              return this.tsParseAmbientExternalModuleDeclaration(nany);\n            } else {\n              return this.tsParseDeclaration(nany, value, /* next */ true);\n            }\n          }\n        }\n      });\n    }\n\n    // Note: this won't be called unless the keyword is allowed in `shouldParseExportDeclaration`.\n    tsTryParseExportDeclaration(): ?N.Declaration {\n      return this.tsParseDeclaration(\n        this.startNode(),\n        this.state.value,\n        /* next */ true,\n      );\n    }\n\n    tsParseExpressionStatement(node: any, expr: N.Identifier): ?N.Declaration {\n      switch (expr.name) {\n        case \"declare\": {\n          const declaration = this.tsTryParseDeclare(node);\n          if (declaration) {\n            declaration.declare = true;\n            return declaration;\n          }\n          break;\n        }\n        case \"global\":\n          // `global { }` (with no `declare`) may appear inside an ambient module declaration.\n          // Would like to use tsParseAmbientExternalModuleDeclaration here, but already ran past \"global\".\n          if (this.match(tt.braceL)) {\n            this.scope.enter(SCOPE_TS_MODULE);\n            this.prodParam.enter(PARAM);\n            const mod: N.TsModuleDeclaration = node;\n            mod.global = true;\n            mod.id = expr;\n            mod.body = this.tsParseModuleBlock();\n            this.scope.exit();\n            this.prodParam.exit();\n            return this.finishNode(mod, \"TSModuleDeclaration\");\n          }\n          break;\n\n        default:\n          return this.tsParseDeclaration(node, expr.name, /* next */ false);\n      }\n    }\n\n    // Common to tsTryParseDeclare, tsTryParseExportDeclaration, and tsParseExpressionStatement.\n    tsParseDeclaration(\n      node: any,\n      value: string,\n      next: boolean,\n    ): ?N.Declaration {\n      // no declaration apart from enum can be followed by a line break.\n      switch (value) {\n        case \"abstract\":\n          if (\n            this.tsCheckLineTerminator(next) &&\n            (this.match(tt._class) || this.match(tt.name))\n          ) {\n            return this.tsParseAbstractDeclaration(node);\n          }\n          break;\n\n        case \"enum\":\n          if (next || this.match(tt.name)) {\n            if (next) this.next();\n            return this.tsParseEnumDeclaration(node, /* isConst */ false);\n          }\n          break;\n\n        case \"interface\":\n          if (this.tsCheckLineTerminator(next) && this.match(tt.name)) {\n            return this.tsParseInterfaceDeclaration(node);\n          }\n          break;\n\n        case \"module\":\n          if (this.tsCheckLineTerminator(next)) {\n            if (this.match(tt.string)) {\n              return this.tsParseAmbientExternalModuleDeclaration(node);\n            } else if (this.match(tt.name)) {\n              return this.tsParseModuleOrNamespaceDeclaration(node);\n            }\n          }\n          break;\n\n        case \"namespace\":\n          if (this.tsCheckLineTerminator(next) && this.match(tt.name)) {\n            return this.tsParseModuleOrNamespaceDeclaration(node);\n          }\n          break;\n\n        case \"type\":\n          if (this.tsCheckLineTerminator(next) && this.match(tt.name)) {\n            return this.tsParseTypeAliasDeclaration(node);\n          }\n          break;\n      }\n    }\n\n    tsCheckLineTerminator(next: boolean) {\n      if (next) {\n        if (this.hasFollowingLineBreak()) return false;\n        this.next();\n        return true;\n      }\n      return !this.isLineTerminator();\n    }\n\n    tsTryParseGenericAsyncArrowFunction(\n      startPos: number,\n      startLoc: Position,\n    ): ?N.ArrowFunctionExpression {\n      if (!this.isRelational(\"<\")) {\n        return undefined;\n      }\n\n      const oldMaybeInArrowParameters = this.state.maybeInArrowParameters;\n      this.state.maybeInArrowParameters = true;\n\n      const res: ?N.ArrowFunctionExpression = this.tsTryParseAndCatch(() => {\n        const node: N.ArrowFunctionExpression = this.startNodeAt(\n          startPos,\n          startLoc,\n        );\n        node.typeParameters = this.tsParseTypeParameters();\n        // Don't use overloaded parseFunctionParams which would look for \"<\" again.\n        super.parseFunctionParams(node);\n        node.returnType = this.tsTryParseTypeOrTypePredicateAnnotation();\n        this.expect(tt.arrow);\n        return node;\n      });\n\n      this.state.maybeInArrowParameters = oldMaybeInArrowParameters;\n\n      if (!res) {\n        return undefined;\n      }\n\n      return this.parseArrowExpression(\n        res,\n        /* params are already set */ null,\n        /* async */ true,\n      );\n    }\n\n    tsParseTypeArguments(): N.TsTypeParameterInstantiation {\n      const node = this.startNode();\n      node.params = this.tsInType(() =>\n        // Temporarily remove a JSX parsing context, which makes us scan different tokens.\n        this.tsInNoContext(() => {\n          this.expectRelational(\"<\");\n          return this.tsParseDelimitedList(\n            \"TypeParametersOrArguments\",\n            this.tsParseType.bind(this),\n          );\n        }),\n      );\n      if (node.params.length === 0) {\n        this.raise(node.start, TSErrors.EmptyTypeArguments);\n      }\n      this.expectRelational(\">\");\n      return this.finishNode(node, \"TSTypeParameterInstantiation\");\n    }\n\n    tsIsDeclarationStart(): boolean {\n      if (this.match(tt.name)) {\n        switch (this.state.value) {\n          case \"abstract\":\n          case \"declare\":\n          case \"enum\":\n          case \"interface\":\n          case \"module\":\n          case \"namespace\":\n          case \"type\":\n            return true;\n        }\n      }\n\n      return false;\n    }\n\n    // ======================================================\n    // OVERRIDES\n    // ======================================================\n\n    isExportDefaultSpecifier(): boolean {\n      if (this.tsIsDeclarationStart()) return false;\n      return super.isExportDefaultSpecifier();\n    }\n\n    parseAssignableListItem(\n      allowModifiers: ?boolean,\n      decorators: N.Decorator[],\n    ): N.Pattern | N.TSParameterProperty {\n      // Store original location/position to include modifiers in range\n      const startPos = this.state.start;\n      const startLoc = this.state.startLoc;\n\n      let accessibility: ?N.Accessibility;\n      let readonly = false;\n      if (allowModifiers !== undefined) {\n        accessibility = this.parseAccessModifier();\n        readonly = !!this.tsParseModifier([\"readonly\"]);\n        if (allowModifiers === false && (accessibility || readonly)) {\n          this.raise(startPos, TSErrors.UnexpectedParameterModifier);\n        }\n      }\n\n      const left = this.parseMaybeDefault();\n      this.parseAssignableListItemTypes(left);\n      const elt = this.parseMaybeDefault(left.start, left.loc.start, left);\n      if (accessibility || readonly) {\n        const pp: N.TSParameterProperty = this.startNodeAt(startPos, startLoc);\n        if (decorators.length) {\n          pp.decorators = decorators;\n        }\n        if (accessibility) pp.accessibility = accessibility;\n        if (readonly) pp.readonly = readonly;\n        if (elt.type !== \"Identifier\" && elt.type !== \"AssignmentPattern\") {\n          this.raise(pp.start, TSErrors.UnsupportedParameterPropertyKind);\n        }\n        pp.parameter = ((elt: any): N.Identifier | N.AssignmentPattern);\n        return this.finishNode(pp, \"TSParameterProperty\");\n      }\n\n      if (decorators.length) {\n        left.decorators = decorators;\n      }\n\n      return elt;\n    }\n\n    parseFunctionBodyAndFinish(\n      node: N.BodilessFunctionOrMethodBase,\n      type: string,\n      isMethod?: boolean = false,\n    ): void {\n      if (this.match(tt.colon)) {\n        node.returnType = this.tsParseTypeOrTypePredicateAnnotation(tt.colon);\n      }\n\n      const bodilessType =\n        type === \"FunctionDeclaration\"\n          ? \"TSDeclareFunction\"\n          : type === \"ClassMethod\"\n          ? \"TSDeclareMethod\"\n          : undefined;\n      if (bodilessType && !this.match(tt.braceL) && this.isLineTerminator()) {\n        this.finishNode(node, bodilessType);\n        return;\n      }\n      if (bodilessType === \"TSDeclareFunction\" && this.state.isAmbientContext) {\n        this.raise(node.start, TSErrors.DeclareFunctionHasImplementation);\n        if (\n          // $FlowIgnore\n          node.declare\n        ) {\n          super.parseFunctionBodyAndFinish(node, bodilessType, isMethod);\n          return;\n        }\n      }\n\n      super.parseFunctionBodyAndFinish(node, type, isMethod);\n    }\n\n    registerFunctionStatementId(node: N.Function): void {\n      if (!node.body && node.id) {\n        // Function ids are validated after parsing their body.\n        // For bodyless function, we need to do it here.\n        this.checkLVal(node.id, \"function name\", BIND_TS_AMBIENT);\n      } else {\n        super.registerFunctionStatementId(...arguments);\n      }\n    }\n\n    tsCheckForInvalidTypeCasts(items: $ReadOnlyArray<?N.Expression>) {\n      items.forEach(node => {\n        if (node?.type === \"TSTypeCastExpression\") {\n          this.raise(\n            node.typeAnnotation.start,\n            TSErrors.UnexpectedTypeAnnotation,\n          );\n        }\n      });\n    }\n\n    toReferencedList(\n      exprList: $ReadOnlyArray<?N.Expression>,\n      isInParens?: boolean, // eslint-disable-line no-unused-vars\n    ): $ReadOnlyArray<?N.Expression> {\n      // Handles invalid scenarios like: `f(a:b)`, `(a:b);`, and `(a:b,c:d)`.\n      //\n      // Note that `f<T>(a:b)` goes through a different path and is handled\n      // in `parseSubscript` directly.\n      this.tsCheckForInvalidTypeCasts(exprList);\n      return exprList;\n    }\n\n    parseArrayLike(...args): N.ArrayExpression | N.TupleExpression {\n      const node = super.parseArrayLike(...args);\n\n      if (node.type === \"ArrayExpression\") {\n        this.tsCheckForInvalidTypeCasts(node.elements);\n      }\n\n      return node;\n    }\n\n    parseSubscript(\n      base: N.Expression,\n      startPos: number,\n      startLoc: Position,\n      noCalls: ?boolean,\n      state: N.ParseSubscriptState,\n    ): N.Expression {\n      if (!this.hasPrecedingLineBreak() && this.match(tt.bang)) {\n        this.next();\n\n        const nonNullExpression: N.TsNonNullExpression = this.startNodeAt(\n          startPos,\n          startLoc,\n        );\n        nonNullExpression.expression = base;\n        return this.finishNode(nonNullExpression, \"TSNonNullExpression\");\n      }\n\n      if (this.isRelational(\"<\")) {\n        // tsTryParseAndCatch is expensive, so avoid if not necessary.\n        // There are number of things we are going to \"maybe\" parse, like type arguments on\n        // tagged template expressions. If any of them fail, walk it back and continue.\n        const result = this.tsTryParseAndCatch(() => {\n          if (!noCalls && this.atPossibleAsyncArrow(base)) {\n            // Almost certainly this is a generic async function `async <T>() => ...\n            // But it might be a call with a type argument `async<T>();`\n            const asyncArrowFn = this.tsTryParseGenericAsyncArrowFunction(\n              startPos,\n              startLoc,\n            );\n            if (asyncArrowFn) {\n              return asyncArrowFn;\n            }\n          }\n\n          const node: N.CallExpression = this.startNodeAt(startPos, startLoc);\n          node.callee = base;\n\n          const typeArguments = this.tsParseTypeArguments();\n\n          if (typeArguments) {\n            if (!noCalls && this.eat(tt.parenL)) {\n              // possibleAsync always false here, because we would have handled it above.\n              // $FlowIgnore (won't be any undefined arguments)\n              node.arguments = this.parseCallExpressionArguments(\n                tt.parenR,\n                /* possibleAsync */ false,\n              );\n\n              // Handles invalid case: `f<T>(a:b)`\n              this.tsCheckForInvalidTypeCasts(node.arguments);\n\n              node.typeParameters = typeArguments;\n              if (state.optionalChainMember) {\n                // $FlowIgnore\n                node.optional = false;\n              }\n              return this.finishCallExpression(node, state.optionalChainMember);\n            } else if (this.match(tt.backQuote)) {\n              const result = this.parseTaggedTemplateExpression(\n                base,\n                startPos,\n                startLoc,\n                state,\n              );\n              result.typeParameters = typeArguments;\n              return result;\n            }\n          }\n\n          this.unexpected();\n        });\n\n        if (result) return result;\n      }\n\n      return super.parseSubscript(base, startPos, startLoc, noCalls, state);\n    }\n\n    parseNewArguments(node: N.NewExpression): void {\n      if (this.isRelational(\"<\")) {\n        // tsTryParseAndCatch is expensive, so avoid if not necessary.\n        // 99% certain this is `new C<T>();`. But may be `new C < T;`, which is also legal.\n        const typeParameters = this.tsTryParseAndCatch(() => {\n          const args = this.tsParseTypeArguments();\n          if (!this.match(tt.parenL)) this.unexpected();\n          return args;\n        });\n        if (typeParameters) {\n          node.typeParameters = typeParameters;\n        }\n      }\n\n      super.parseNewArguments(node);\n    }\n\n    parseExprOp(\n      left: N.Expression,\n      leftStartPos: number,\n      leftStartLoc: Position,\n      minPrec: number,\n    ) {\n      if (\n        nonNull(tt._in.binop) > minPrec &&\n        !this.hasPrecedingLineBreak() &&\n        this.isContextual(\"as\")\n      ) {\n        const node: N.TsAsExpression = this.startNodeAt(\n          leftStartPos,\n          leftStartLoc,\n        );\n        node.expression = left;\n        const _const = this.tsTryNextParseConstantContext();\n        if (_const) {\n          node.typeAnnotation = _const;\n        } else {\n          node.typeAnnotation = this.tsNextThenParseType();\n        }\n        this.finishNode(node, \"TSAsExpression\");\n        // rescan `<`, `>` because they were scanned when this.state.inType was true\n        this.reScan_lt_gt();\n        return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec);\n      }\n\n      return super.parseExprOp(left, leftStartPos, leftStartLoc, minPrec);\n    }\n\n    checkReservedWord(\n      word: string, // eslint-disable-line no-unused-vars\n      startLoc: number, // eslint-disable-line no-unused-vars\n      checkKeywords: boolean, // eslint-disable-line no-unused-vars\n      // eslint-disable-next-line no-unused-vars\n      isBinding: boolean,\n    ): void {\n      // Don't bother checking for TypeScript code.\n      // Strict mode words may be allowed as in `declare namespace N { const static: number; }`.\n      // And we have a type checker anyway, so don't bother having the parser do it.\n    }\n\n    /*\n    Don't bother doing this check in TypeScript code because:\n    1. We may have a nested export statement with the same name:\n      export const x = 0;\n      export namespace N {\n        export const x = 1;\n      }\n    2. We have a type checker to warn us about this sort of thing.\n    */\n    checkDuplicateExports() {}\n\n    parseImport(node: N.Node): N.AnyImport {\n      node.importKind = \"value\";\n      if (this.match(tt.name) || this.match(tt.star) || this.match(tt.braceL)) {\n        let ahead = this.lookahead();\n\n        if (\n          this.isContextual(\"type\") &&\n          // import type, { a } from \"b\";\n          ahead.type !== tt.comma &&\n          // import type from \"a\";\n          !(ahead.type === tt.name && ahead.value === \"from\") &&\n          // import type = require(\"a\");\n          ahead.type !== tt.eq\n        ) {\n          node.importKind = \"type\";\n          this.next();\n          ahead = this.lookahead();\n        }\n\n        if (this.match(tt.name) && ahead.type === tt.eq) {\n          return this.tsParseImportEqualsDeclaration(node);\n        }\n      }\n\n      const importNode = super.parseImport(node);\n      /*:: invariant(importNode.type !== \"TSImportEqualsDeclaration\") */\n\n      // `import type` can only be used on imports with named imports or with a\n      // default import - but not both\n      if (\n        importNode.importKind === \"type\" &&\n        importNode.specifiers.length > 1 &&\n        importNode.specifiers[0].type === \"ImportDefaultSpecifier\"\n      ) {\n        this.raise(\n          importNode.start,\n          TSErrors.TypeImportCannotSpecifyDefaultAndNamed,\n        );\n      }\n\n      return importNode;\n    }\n\n    parseExport(node: N.Node): N.AnyExport {\n      if (this.match(tt._import)) {\n        // `export import A = B;`\n        this.next(); // eat `tt._import`\n        if (\n          this.isContextual(\"type\") &&\n          this.lookaheadCharCode() !== charCodes.equalsTo\n        ) {\n          node.importKind = \"type\";\n          this.next(); // eat \"type\"\n        } else {\n          node.importKind = \"value\";\n        }\n        return this.tsParseImportEqualsDeclaration(node, /* isExport */ true);\n      } else if (this.eat(tt.eq)) {\n        // `export = x;`\n        const assign: N.TsExportAssignment = node;\n        assign.expression = this.parseExpression();\n        this.semicolon();\n        return this.finishNode(assign, \"TSExportAssignment\");\n      } else if (this.eatContextual(\"as\")) {\n        // `export as namespace A;`\n        const decl: N.TsNamespaceExportDeclaration = node;\n        // See `parseNamespaceExportDeclaration` in TypeScript's own parser\n        this.expectContextual(\"namespace\");\n        decl.id = this.parseIdentifier();\n        this.semicolon();\n        return this.finishNode(decl, \"TSNamespaceExportDeclaration\");\n      } else {\n        if (this.isContextual(\"type\") && this.lookahead().type === tt.braceL) {\n          this.next();\n          node.exportKind = \"type\";\n        } else {\n          node.exportKind = \"value\";\n        }\n\n        return super.parseExport(node);\n      }\n    }\n\n    isAbstractClass(): boolean {\n      return (\n        this.isContextual(\"abstract\") && this.lookahead().type === tt._class\n      );\n    }\n\n    parseExportDefaultExpression(): N.Expression | N.Declaration {\n      if (this.isAbstractClass()) {\n        const cls = this.startNode();\n        this.next(); // Skip \"abstract\"\n        cls.abstract = true;\n        this.parseClass(cls, true, true);\n        return cls;\n      }\n\n      // export default interface allowed in:\n      // https://github.com/Microsoft/TypeScript/pull/16040\n      if (this.state.value === \"interface\") {\n        const result = this.tsParseDeclaration(\n          this.startNode(),\n          this.state.value,\n          true,\n        );\n\n        if (result) return result;\n      }\n\n      return super.parseExportDefaultExpression();\n    }\n\n    parseStatementContent(context: ?string, topLevel: ?boolean): N.Statement {\n      if (this.state.type === tt._const) {\n        const ahead = this.lookahead();\n        if (ahead.type === tt.name && ahead.value === \"enum\") {\n          const node: N.TsEnumDeclaration = this.startNode();\n          this.expect(tt._const);\n          this.expectContextual(\"enum\");\n          return this.tsParseEnumDeclaration(node, /* isConst */ true);\n        }\n      }\n      return super.parseStatementContent(context, topLevel);\n    }\n\n    parseAccessModifier(): ?N.Accessibility {\n      return this.tsParseModifier([\"public\", \"protected\", \"private\"]);\n    }\n\n    tsHasSomeModifiers(member: any, modifiers: TsModifier[]): boolean {\n      return modifiers.some(modifier => {\n        if (tsIsAccessModifier(modifier)) {\n          return member.accessibility === modifier;\n        }\n        return !!member[modifier];\n      });\n    }\n\n    parseClassMember(\n      classBody: N.ClassBody,\n      member: any,\n      state: N.ParseClassMemberState,\n    ): void {\n      const invalidModifersForStaticBlocks = [\n        \"declare\",\n        \"private\",\n        \"public\",\n        \"protected\",\n        \"override\",\n        \"abstract\",\n        \"readonly\",\n      ];\n      this.tsParseModifiers(\n        member,\n        invalidModifersForStaticBlocks.concat([\"static\"]),\n      );\n\n      const callParseClassMemberWithIsStatic = () => {\n        const isStatic = !!member.static;\n        if (isStatic && this.eat(tt.braceL)) {\n          if (this.tsHasSomeModifiers(member, invalidModifersForStaticBlocks)) {\n            this.raise(this.state.pos, TSErrors.StaticBlockCannotHaveModifier);\n          }\n          this.parseClassStaticBlock(classBody, ((member: any): N.StaticBlock));\n        } else {\n          this.parseClassMemberWithIsStatic(classBody, member, state, isStatic);\n        }\n      };\n      if (member.declare) {\n        this.tsInAmbientContext(callParseClassMemberWithIsStatic);\n      } else {\n        callParseClassMemberWithIsStatic();\n      }\n    }\n\n    parseClassMemberWithIsStatic(\n      classBody: N.ClassBody,\n      member: N.ClassMember | N.TsIndexSignature,\n      state: N.ParseClassMemberState,\n      isStatic: boolean,\n    ): void {\n      const idx = this.tsTryParseIndexSignature(member);\n      if (idx) {\n        classBody.body.push(idx);\n\n        if ((member: any).abstract) {\n          this.raise(member.start, TSErrors.IndexSignatureHasAbstract);\n        }\n        if ((member: any).accessibility) {\n          this.raise(\n            member.start,\n            TSErrors.IndexSignatureHasAccessibility,\n            (member: any).accessibility,\n          );\n        }\n        if ((member: any).declare) {\n          this.raise(member.start, TSErrors.IndexSignatureHasDeclare);\n        }\n        if ((member: any).override) {\n          this.raise(member.start, TSErrors.IndexSignatureHasOverride);\n        }\n\n        return;\n      }\n\n      if (!this.state.inAbstractClass && (member: any).abstract) {\n        this.raise(member.start, TSErrors.NonAbstractClassHasAbstractMethod);\n      }\n\n      if ((member: any).override) {\n        if (!state.hadSuperClass) {\n          this.raise(member.start, TSErrors.OverrideNotInSubClass);\n        }\n      }\n\n      /*:: invariant(member.type !== \"TSIndexSignature\") */\n\n      super.parseClassMemberWithIsStatic(classBody, member, state, isStatic);\n    }\n\n    parsePostMemberNameModifiers(\n      methodOrProp: N.ClassMethod | N.ClassProperty | N.ClassPrivateProperty,\n    ): void {\n      const optional = this.eat(tt.question);\n      if (optional) methodOrProp.optional = true;\n\n      if ((methodOrProp: any).readonly && this.match(tt.parenL)) {\n        this.raise(methodOrProp.start, TSErrors.ClassMethodHasReadonly);\n      }\n\n      if ((methodOrProp: any).declare && this.match(tt.parenL)) {\n        this.raise(methodOrProp.start, TSErrors.ClassMethodHasDeclare);\n      }\n    }\n\n    // Note: The reason we do this in `parseExpressionStatement` and not `parseStatement`\n    // is that e.g. `type()` is valid JS, so we must try parsing that first.\n    // If it's really a type, we will parse `type` as the statement, and can correct it here\n    // by parsing the rest.\n    parseExpressionStatement(\n      node: N.ExpressionStatement,\n      expr: N.Expression,\n    ): N.Statement {\n      const decl =\n        expr.type === \"Identifier\"\n          ? this.tsParseExpressionStatement(node, expr)\n          : undefined;\n      return decl || super.parseExpressionStatement(node, expr);\n    }\n\n    // export type\n    // Should be true for anything parsed by `tsTryParseExportDeclaration`.\n    shouldParseExportDeclaration(): boolean {\n      if (this.tsIsDeclarationStart()) return true;\n      return super.shouldParseExportDeclaration();\n    }\n\n    // An apparent conditional expression could actually be an optional parameter in an arrow function.\n    parseConditional(\n      expr: N.Expression,\n      startPos: number,\n      startLoc: Position,\n      refNeedsArrowPos?: ?Pos,\n    ): N.Expression {\n      // only do the expensive clone if there is a question mark\n      // and if we come from inside parens\n      if (!refNeedsArrowPos || !this.match(tt.question)) {\n        return super.parseConditional(\n          expr,\n          startPos,\n          startLoc,\n          refNeedsArrowPos,\n        );\n      }\n\n      const result = this.tryParse(() =>\n        super.parseConditional(expr, startPos, startLoc),\n      );\n\n      if (!result.node) {\n        // $FlowIgnore\n        refNeedsArrowPos.start = result.error.pos || this.state.start;\n        return expr;\n      }\n      if (result.error) this.state = result.failState;\n      return result.node;\n    }\n\n    // Note: These \"type casts\" are *not* valid TS expressions.\n    // But we parse them here and change them when completing the arrow function.\n    parseParenItem(\n      node: N.Expression,\n      startPos: number,\n      startLoc: Position,\n    ): N.Expression {\n      node = super.parseParenItem(node, startPos, startLoc);\n      if (this.eat(tt.question)) {\n        node.optional = true;\n        // Include questionmark in location of node\n        // Don't use this.finishNode() as otherwise we might process comments twice and\n        // include already consumed parens\n        this.resetEndLocation(node);\n      }\n\n      if (this.match(tt.colon)) {\n        const typeCastNode: N.TsTypeCastExpression = this.startNodeAt(\n          startPos,\n          startLoc,\n        );\n        typeCastNode.expression = node;\n        typeCastNode.typeAnnotation = this.tsParseTypeAnnotation();\n\n        return this.finishNode(typeCastNode, \"TSTypeCastExpression\");\n      }\n\n      return node;\n    }\n\n    parseExportDeclaration(node: N.ExportNamedDeclaration): ?N.Declaration {\n      // Store original location/position\n      const startPos = this.state.start;\n      const startLoc = this.state.startLoc;\n\n      // \"export declare\" is equivalent to just \"export\".\n      const isDeclare = this.eatContextual(\"declare\");\n\n      if (\n        isDeclare &&\n        (this.isContextual(\"declare\") || !this.shouldParseExportDeclaration())\n      ) {\n        throw this.raise(\n          this.state.start,\n          TSErrors.ExpectedAmbientAfterExportDeclare,\n        );\n      }\n\n      let declaration: ?N.Declaration;\n\n      if (this.match(tt.name)) {\n        declaration = this.tsTryParseExportDeclaration();\n      }\n      if (!declaration) {\n        declaration = super.parseExportDeclaration(node);\n      }\n      if (\n        declaration &&\n        (declaration.type === \"TSInterfaceDeclaration\" ||\n          declaration.type === \"TSTypeAliasDeclaration\" ||\n          isDeclare)\n      ) {\n        node.exportKind = \"type\";\n      }\n\n      if (declaration && isDeclare) {\n        // Reset location to include `declare` in range\n        this.resetStartLocation(declaration, startPos, startLoc);\n\n        declaration.declare = true;\n      }\n\n      return declaration;\n    }\n\n    parseClassId(\n      node: N.Class,\n      isStatement: boolean,\n      optionalId: ?boolean,\n    ): void {\n      if ((!isStatement || optionalId) && this.isContextual(\"implements\")) {\n        return;\n      }\n\n      super.parseClassId(\n        node,\n        isStatement,\n        optionalId,\n        (node: any).declare ? BIND_TS_AMBIENT : BIND_CLASS,\n      );\n      const typeParameters = this.tsTryParseTypeParameters();\n      if (typeParameters) node.typeParameters = typeParameters;\n    }\n\n    parseClassPropertyAnnotation(\n      node: N.ClassProperty | N.ClassPrivateProperty,\n    ): void {\n      if (!node.optional && this.eat(tt.bang)) {\n        node.definite = true;\n      }\n\n      const type = this.tsTryParseTypeAnnotation();\n      if (type) node.typeAnnotation = type;\n    }\n\n    parseClassProperty(node: N.ClassProperty): N.ClassProperty {\n      this.parseClassPropertyAnnotation(node);\n\n      if (this.state.isAmbientContext && this.match(tt.eq)) {\n        this.raise(this.state.start, TSErrors.DeclareClassFieldHasInitializer);\n      }\n\n      return super.parseClassProperty(node);\n    }\n\n    parseClassPrivateProperty(\n      node: N.ClassPrivateProperty,\n    ): N.ClassPrivateProperty {\n      // $FlowIgnore\n      if (node.abstract) {\n        this.raise(node.start, TSErrors.PrivateElementHasAbstract);\n      }\n\n      // $FlowIgnore\n      if (node.accessibility) {\n        this.raise(\n          node.start,\n          TSErrors.PrivateElementHasAccessibility,\n          node.accessibility,\n        );\n      }\n\n      this.parseClassPropertyAnnotation(node);\n      return super.parseClassPrivateProperty(node);\n    }\n\n    pushClassMethod(\n      classBody: N.ClassBody,\n      method: N.ClassMethod,\n      isGenerator: boolean,\n      isAsync: boolean,\n      isConstructor: boolean,\n      allowsDirectSuper: boolean,\n    ): void {\n      const typeParameters = this.tsTryParseTypeParameters();\n      if (typeParameters && isConstructor) {\n        this.raise(typeParameters.start, TSErrors.ConstructorHasTypeParameters);\n      }\n\n      // $FlowIgnore\n      if (method.declare && (method.kind === \"get\" || method.kind === \"set\")) {\n        this.raise(method.start, TSErrors.DeclareAccessor, method.kind);\n      }\n      if (typeParameters) method.typeParameters = typeParameters;\n      super.pushClassMethod(\n        classBody,\n        method,\n        isGenerator,\n        isAsync,\n        isConstructor,\n        allowsDirectSuper,\n      );\n    }\n\n    pushClassPrivateMethod(\n      classBody: N.ClassBody,\n      method: N.ClassPrivateMethod,\n      isGenerator: boolean,\n      isAsync: boolean,\n    ): void {\n      const typeParameters = this.tsTryParseTypeParameters();\n      if (typeParameters) method.typeParameters = typeParameters;\n      super.pushClassPrivateMethod(classBody, method, isGenerator, isAsync);\n    }\n\n    parseClassSuper(node: N.Class): void {\n      super.parseClassSuper(node);\n      if (node.superClass && this.isRelational(\"<\")) {\n        node.superTypeParameters = this.tsParseTypeArguments();\n      }\n      if (this.eatContextual(\"implements\")) {\n        node.implements = this.tsParseHeritageClause(\"implements\");\n      }\n    }\n\n    parseObjPropValue(prop: N.ObjectMember, ...args): void {\n      const typeParameters = this.tsTryParseTypeParameters();\n      if (typeParameters) prop.typeParameters = typeParameters;\n\n      super.parseObjPropValue(prop, ...args);\n    }\n\n    parseFunctionParams(node: N.Function, allowModifiers?: boolean): void {\n      const typeParameters = this.tsTryParseTypeParameters();\n      if (typeParameters) node.typeParameters = typeParameters;\n      super.parseFunctionParams(node, allowModifiers);\n    }\n\n    // `let x: number;`\n    parseVarId(\n      decl: N.VariableDeclarator,\n      kind: \"var\" | \"let\" | \"const\",\n    ): void {\n      super.parseVarId(decl, kind);\n      if (decl.id.type === \"Identifier\" && this.eat(tt.bang)) {\n        decl.definite = true;\n      }\n\n      const type = this.tsTryParseTypeAnnotation();\n      if (type) {\n        decl.id.typeAnnotation = type;\n        this.resetEndLocation(decl.id); // set end position to end of type\n      }\n    }\n\n    // parse the return type of an async arrow function - let foo = (async (): number => {});\n    parseAsyncArrowFromCallExpression(\n      node: N.ArrowFunctionExpression,\n      call: N.CallExpression,\n    ): N.ArrowFunctionExpression {\n      if (this.match(tt.colon)) {\n        node.returnType = this.tsParseTypeAnnotation();\n      }\n      return super.parseAsyncArrowFromCallExpression(node, call);\n    }\n\n    parseMaybeAssign(...args): N.Expression {\n      // Note: When the JSX plugin is on, type assertions (`<T> x`) aren't valid syntax.\n\n      let state: ?State;\n      let jsx;\n      let typeCast;\n\n      if (\n        this.hasPlugin(\"jsx\") &&\n        (this.match(tt.jsxTagStart) || this.isRelational(\"<\"))\n      ) {\n        // Prefer to parse JSX if possible. But may be an arrow fn.\n        state = this.state.clone();\n\n        jsx = this.tryParse(() => super.parseMaybeAssign(...args), state);\n        /*:: invariant(!jsx.aborted) */\n\n        if (!jsx.error) return jsx.node;\n\n        // Remove `tc.j_expr` and `tc.j_oTag` from context added\n        // by parsing `jsxTagStart` to stop the JSX plugin from\n        // messing with the tokens\n        const { context } = this.state;\n        if (context[context.length - 1] === ct.j_oTag) {\n          context.length -= 2;\n        } else if (context[context.length - 1] === ct.j_expr) {\n          context.length -= 1;\n        }\n      }\n\n      if (!jsx?.error && !this.isRelational(\"<\")) {\n        return super.parseMaybeAssign(...args);\n      }\n\n      // Either way, we're looking at a '<': tt.jsxTagStart or relational.\n\n      let typeParameters: N.TsTypeParameterDeclaration;\n      state = state || this.state.clone();\n\n      const arrow = this.tryParse(abort => {\n        // This is similar to TypeScript's `tryParseParenthesizedArrowFunctionExpression`.\n        typeParameters = this.tsParseTypeParameters();\n        const expr = super.parseMaybeAssign(...args);\n\n        if (\n          expr.type !== \"ArrowFunctionExpression\" ||\n          expr.extra?.parenthesized\n        ) {\n          abort();\n        }\n\n        // Correct TypeScript code should have at least 1 type parameter, but don't crash on bad code.\n        if (typeParameters?.params.length !== 0) {\n          this.resetStartLocationFromNode(expr, typeParameters);\n        }\n        expr.typeParameters = typeParameters;\n        return expr;\n      }, state);\n\n      if (!arrow.error && !arrow.aborted) return arrow.node;\n\n      if (!jsx) {\n        // Try parsing a type cast instead of an arrow function.\n        // This will never happen outside of JSX.\n        // (Because in JSX the '<' should be a jsxTagStart and not a relational.\n        assert(!this.hasPlugin(\"jsx\"));\n\n        // This will start with a type assertion (via parseMaybeUnary).\n        // But don't directly call `this.tsParseTypeAssertion` because we want to handle any binary after it.\n        typeCast = this.tryParse(() => super.parseMaybeAssign(...args), state);\n        /*:: invariant(!typeCast.aborted) */\n        if (!typeCast.error) return typeCast.node;\n      }\n\n      if (jsx?.node) {\n        /*:: invariant(jsx.failState) */\n        this.state = jsx.failState;\n        return jsx.node;\n      }\n\n      if (arrow.node) {\n        /*:: invariant(arrow.failState) */\n        this.state = arrow.failState;\n        return arrow.node;\n      }\n\n      if (typeCast?.node) {\n        /*:: invariant(typeCast.failState) */\n        this.state = typeCast.failState;\n        return typeCast.node;\n      }\n\n      if (jsx?.thrown) throw jsx.error;\n      if (arrow.thrown) throw arrow.error;\n      if (typeCast?.thrown) throw typeCast.error;\n\n      throw jsx?.error || arrow.error || typeCast?.error;\n    }\n\n    // Handle type assertions\n    parseMaybeUnary(refExpressionErrors?: ?ExpressionErrors): N.Expression {\n      if (!this.hasPlugin(\"jsx\") && this.isRelational(\"<\")) {\n        return this.tsParseTypeAssertion();\n      } else {\n        return super.parseMaybeUnary(refExpressionErrors);\n      }\n    }\n\n    parseArrow(node: N.ArrowFunctionExpression): ?N.ArrowFunctionExpression {\n      if (this.match(tt.colon)) {\n        // This is different from how the TS parser does it.\n        // TS uses lookahead. The Babel Parser parses it as a parenthesized expression and converts.\n\n        const result = this.tryParse(abort => {\n          const returnType = this.tsParseTypeOrTypePredicateAnnotation(\n            tt.colon,\n          );\n          if (this.canInsertSemicolon() || !this.match(tt.arrow)) abort();\n          return returnType;\n        });\n\n        if (result.aborted) return;\n\n        if (!result.thrown) {\n          if (result.error) this.state = result.failState;\n          node.returnType = result.node;\n        }\n      }\n\n      return super.parseArrow(node);\n    }\n\n    // Allow type annotations inside of a parameter list.\n    parseAssignableListItemTypes(param: N.Pattern) {\n      if (this.eat(tt.question)) {\n        if (\n          param.type !== \"Identifier\" &&\n          !this.state.isAmbientContext &&\n          !this.state.inType\n        ) {\n          this.raise(param.start, TSErrors.PatternIsOptional);\n        }\n\n        ((param: any): N.Identifier).optional = true;\n      }\n      const type = this.tsTryParseTypeAnnotation();\n      if (type) param.typeAnnotation = type;\n      this.resetEndLocation(param);\n\n      return param;\n    }\n\n    toAssignable(node: N.Node, isLHS: boolean = false): N.Node {\n      switch (node.type) {\n        case \"TSTypeCastExpression\":\n          return super.toAssignable(this.typeCastToParameter(node), isLHS);\n        case \"TSParameterProperty\":\n          return super.toAssignable(node, isLHS);\n        case \"ParenthesizedExpression\":\n          return this.toAssignableParenthesizedExpression(node, isLHS);\n        case \"TSAsExpression\":\n        case \"TSNonNullExpression\":\n        case \"TSTypeAssertion\":\n          node.expression = this.toAssignable(node.expression, isLHS);\n          return node;\n        default:\n          return super.toAssignable(node, isLHS);\n      }\n    }\n\n    toAssignableParenthesizedExpression(node: N.Node, isLHS: boolean) {\n      switch (node.expression.type) {\n        case \"TSAsExpression\":\n        case \"TSNonNullExpression\":\n        case \"TSTypeAssertion\":\n        case \"ParenthesizedExpression\":\n          node.expression = this.toAssignable(node.expression, isLHS);\n          return node;\n        default:\n          return super.toAssignable(node, isLHS);\n      }\n    }\n\n    checkLVal(\n      expr: N.Expression,\n      contextDescription: string,\n      ...args:\n        | [BindingTypes | void]\n        | [BindingTypes | void, ?Set<string>, boolean | void, boolean | void]\n    ): void {\n      switch (expr.type) {\n        case \"TSTypeCastExpression\":\n          // Allow \"typecasts\" to appear on the left of assignment expressions,\n          // because it may be in an arrow function.\n          // e.g. `const f = (foo: number = 0) => foo;`\n          return;\n        case \"TSParameterProperty\":\n          this.checkLVal(expr.parameter, \"parameter property\", ...args);\n          return;\n        case \"TSAsExpression\":\n        case \"TSTypeAssertion\":\n          if (\n            /*bindingType*/ !args[0] &&\n            contextDescription !== \"parenthesized expression\" &&\n            !expr.extra?.parenthesized\n          ) {\n            this.raise(expr.start, Errors.InvalidLhs, contextDescription);\n            break;\n          }\n          this.checkLVal(expr.expression, \"parenthesized expression\", ...args);\n          return;\n        case \"TSNonNullExpression\":\n          this.checkLVal(expr.expression, contextDescription, ...args);\n          return;\n        default:\n          super.checkLVal(expr, contextDescription, ...args);\n          return;\n      }\n    }\n\n    parseBindingAtom(): N.Pattern {\n      switch (this.state.type) {\n        case tt._this:\n          // \"this\" may be the name of a parameter, so allow it.\n          return this.parseIdentifier(/* liberal */ true);\n        default:\n          return super.parseBindingAtom();\n      }\n    }\n\n    parseMaybeDecoratorArguments(expr: N.Expression): N.Expression {\n      if (this.isRelational(\"<\")) {\n        const typeArguments = this.tsParseTypeArguments();\n\n        if (this.match(tt.parenL)) {\n          const call = super.parseMaybeDecoratorArguments(expr);\n          call.typeParameters = typeArguments;\n          return call;\n        }\n\n        this.unexpected(this.state.start, tt.parenL);\n      }\n\n      return super.parseMaybeDecoratorArguments(expr);\n    }\n\n    checkCommaAfterRest(close) {\n      if (\n        this.state.isAmbientContext &&\n        this.match(tt.comma) &&\n        this.lookaheadCharCode() === close\n      ) {\n        this.next();\n      } else {\n        super.checkCommaAfterRest(close);\n      }\n    }\n\n    // === === === === === === === === === === === === === === === ===\n    // Note: All below methods are duplicates of something in flow.js.\n    // Not sure what the best way to combine these is.\n    // === === === === === === === === === === === === === === === ===\n\n    isClassMethod(): boolean {\n      return this.isRelational(\"<\") || super.isClassMethod();\n    }\n\n    isClassProperty(): boolean {\n      return (\n        this.match(tt.bang) || this.match(tt.colon) || super.isClassProperty()\n      );\n    }\n\n    parseMaybeDefault(...args): N.Pattern {\n      const node = super.parseMaybeDefault(...args);\n\n      if (\n        node.type === \"AssignmentPattern\" &&\n        node.typeAnnotation &&\n        node.right.start < node.typeAnnotation.start\n      ) {\n        this.raise(\n          node.typeAnnotation.start,\n          TSErrors.TypeAnnotationAfterAssign,\n        );\n      }\n\n      return node;\n    }\n\n    // ensure that inside types, we bypass the jsx parser plugin\n    getTokenFromCode(code: number): void {\n      if (\n        this.state.inType &&\n        (code === charCodes.greaterThan || code === charCodes.lessThan)\n      ) {\n        return this.finishOp(tt.relational, 1);\n      } else {\n        return super.getTokenFromCode(code);\n      }\n    }\n\n    // used after we have finished parsing types\n    reScan_lt_gt() {\n      if (this.match(tt.relational)) {\n        const code = this.input.charCodeAt(this.state.start);\n        if (code === charCodes.lessThan || code === charCodes.greaterThan) {\n          this.state.pos -= 1;\n          this.readToken_lt_gt(code);\n        }\n      }\n    }\n\n    toAssignableList(exprList: N.Expression[]): $ReadOnlyArray<N.Pattern> {\n      for (let i = 0; i < exprList.length; i++) {\n        const expr = exprList[i];\n        if (!expr) continue;\n        switch (expr.type) {\n          case \"TSTypeCastExpression\":\n            exprList[i] = this.typeCastToParameter(expr);\n            break;\n          case \"TSAsExpression\":\n          case \"TSTypeAssertion\":\n            if (!this.state.maybeInArrowParameters) {\n              exprList[i] = this.typeCastToParameter(expr);\n            } else {\n              this.raise(expr.start, TSErrors.UnexpectedTypeCastInParameter);\n            }\n            break;\n        }\n      }\n      return super.toAssignableList(...arguments);\n    }\n\n    typeCastToParameter(node: N.TsTypeCastExpression): N.Node {\n      node.expression.typeAnnotation = node.typeAnnotation;\n\n      this.resetEndLocation(\n        node.expression,\n        node.typeAnnotation.end,\n        node.typeAnnotation.loc.end,\n      );\n\n      return node.expression;\n    }\n\n    shouldParseArrow() {\n      return this.match(tt.colon) || super.shouldParseArrow();\n    }\n\n    shouldParseAsyncArrow(): boolean {\n      return this.match(tt.colon) || super.shouldParseAsyncArrow();\n    }\n\n    canHaveLeadingDecorator() {\n      // Avoid unnecessary lookahead in checking for abstract class unless needed!\n      return super.canHaveLeadingDecorator() || this.isAbstractClass();\n    }\n\n    jsxParseOpeningElementAfterName(\n      node: N.JSXOpeningElement,\n    ): N.JSXOpeningElement {\n      if (this.isRelational(\"<\")) {\n        const typeArguments = this.tsTryParseAndCatch(() =>\n          this.tsParseTypeArguments(),\n        );\n        if (typeArguments) node.typeParameters = typeArguments;\n      }\n      return super.jsxParseOpeningElementAfterName(node);\n    }\n\n    getGetterSetterExpectedParamCount(\n      method: N.ObjectMethod | N.ClassMethod,\n    ): number {\n      const baseCount = super.getGetterSetterExpectedParamCount(method);\n      const params = this.getObjectOrClassMethodParams(method);\n      const firstParam = params[0];\n      const hasContextParam = firstParam && this.isThisParam(firstParam);\n\n      return hasContextParam ? baseCount + 1 : baseCount;\n    }\n\n    parseCatchClauseParam(): N.Pattern {\n      const param = super.parseCatchClauseParam();\n      const type = this.tsTryParseTypeAnnotation();\n\n      if (type) {\n        param.typeAnnotation = type;\n        this.resetEndLocation(param);\n      }\n\n      return param;\n    }\n\n    tsInAmbientContext<T>(cb: () => T): T {\n      const oldIsAmbientContext = this.state.isAmbientContext;\n      this.state.isAmbientContext = true;\n      try {\n        return cb();\n      } finally {\n        this.state.isAmbientContext = oldIsAmbientContext;\n      }\n    }\n\n    parseClass<T: N.Class>(node: T, ...args: any[]): T {\n      const oldInAbstractClass = this.state.inAbstractClass;\n      this.state.inAbstractClass = !!(node: any).abstract;\n      try {\n        return super.parseClass(node, ...args);\n      } finally {\n        this.state.inAbstractClass = oldInAbstractClass;\n      }\n    }\n\n    tsParseAbstractDeclaration(\n      node: any,\n    ): N.ClassDeclaration | N.TsInterfaceDeclaration | typeof undefined {\n      if (this.match(tt._class)) {\n        node.abstract = true;\n        return this.parseClass<N.ClassDeclaration>(\n          (node: N.ClassDeclaration),\n          /* isStatement */ true,\n          /* optionalId */ false,\n        );\n      } else if (this.isContextual(\"interface\")) {\n        // for invalid abstract interface\n\n        // To avoid\n        //   abstract interface\n        //   Foo {}\n        if (!this.hasFollowingLineBreak()) {\n          node.abstract = true;\n          this.raise(\n            node.start,\n            TSErrors.NonClassMethodPropertyHasAbstractModifer,\n          );\n          this.next();\n          return this.tsParseInterfaceDeclaration(\n            (node: N.TsInterfaceDeclaration),\n          );\n        }\n      } else {\n        this.unexpected(null, tt._class);\n      }\n    }\n\n    parseMethod(...args: any[]) {\n      const method = super.parseMethod(...args);\n      if (method.abstract) {\n        const hasBody = this.hasPlugin(\"estree\")\n          ? !!method.value.body\n          : !!method.body;\n        if (hasBody) {\n          const { key } = method;\n          this.raise(\n            method.start,\n            TSErrors.AbstractMethodHasImplementation,\n            key.type === \"Identifier\"\n              ? key.name\n              : `[${this.input.slice(key.start, key.end)}]`,\n          );\n        }\n      }\n      return method;\n    }\n\n    shouldParseAsAmbientContext(): boolean {\n      return !!this.getPluginOption(\"typescript\", \"dts\");\n    }\n\n    parse() {\n      if (this.shouldParseAsAmbientContext()) {\n        this.state.isAmbientContext = true;\n      }\n      return super.parse();\n    }\n\n    getExpression() {\n      if (this.shouldParseAsAmbientContext()) {\n        this.state.isAmbientContext = true;\n      }\n      return super.getExpression();\n    }\n  };\n","// @flow\n\nimport * as charCodes from \"charcodes\";\n\nimport { types as tt, TokenType } from \"../tokenizer/types\";\nimport type Parser from \"../parser\";\nimport * as N from \"../types\";\nimport { makeErrorTemplates, ErrorCodes } from \"../parser/error\";\n\ntt.placeholder = new TokenType(\"%%\", { startsExpr: true });\n\nexport type PlaceholderTypes =\n  | \"Identifier\"\n  | \"StringLiteral\"\n  | \"Expression\"\n  | \"Statement\"\n  | \"Declaration\"\n  | \"BlockStatement\"\n  | \"ClassBody\"\n  | \"Pattern\";\n\n// $PropertyType doesn't support enums. Use a fake \"switch\" (GetPlaceholderNode)\n//type MaybePlaceholder<T: PlaceholderTypes> = $PropertyType<N, T> | N.Placeholder<T>;\n\ntype _Switch<Value, Cases, Index> = $Call<\n  (\n    $ElementType<$ElementType<Cases, Index>, 0>,\n  ) => $ElementType<$ElementType<Cases, Index>, 1>,\n  Value,\n>;\ntype $Switch<Value, Cases> = _Switch<Value, Cases, *>;\n\ntype NodeOf<T: PlaceholderTypes> = $Switch<\n  T,\n  [\n    [\"Identifier\", N.Identifier],\n    [\"StringLiteral\", N.StringLiteral],\n    [\"Expression\", N.Expression],\n    [\"Statement\", N.Statement],\n    [\"Declaration\", N.Declaration],\n    [\"BlockStatement\", N.BlockStatement],\n    [\"ClassBody\", N.ClassBody],\n    [\"Pattern\", N.Pattern],\n  ],\n>;\n\n// Placeholder<T> breaks everything, because its type is incompatible with\n// the substituted nodes.\ntype MaybePlaceholder<T: PlaceholderTypes> = NodeOf<T>; // | Placeholder<T>\n\nconst PlaceHolderErrors = makeErrorTemplates(\n  {\n    ClassNameIsRequired: \"A class name is required.\",\n  },\n  /* code */ ErrorCodes.SyntaxError,\n);\n\nexport default (superClass: Class<Parser>): Class<Parser> =>\n  class extends superClass {\n    parsePlaceholder<T: PlaceholderTypes>(\n      expectedNode: T,\n    ): /*?N.Placeholder<T>*/ ?MaybePlaceholder<T> {\n      if (this.match(tt.placeholder)) {\n        const node = this.startNode();\n        this.next();\n        this.assertNoSpace(\"Unexpected space in placeholder.\");\n\n        // We can't use this.parseIdentifier because\n        // we don't want nested placeholders.\n        node.name = super.parseIdentifier(/* liberal */ true);\n\n        this.assertNoSpace(\"Unexpected space in placeholder.\");\n        this.expect(tt.placeholder);\n        return this.finishPlaceholder(node, expectedNode);\n      }\n    }\n\n    finishPlaceholder<T: PlaceholderTypes>(\n      node: N.Node,\n      expectedNode: T,\n    ): /*N.Placeholder<T>*/ MaybePlaceholder<T> {\n      const isFinished = !!(node.expectedNode && node.type === \"Placeholder\");\n      node.expectedNode = expectedNode;\n\n      return isFinished ? node : this.finishNode(node, \"Placeholder\");\n    }\n\n    /* ============================================================ *\n     * tokenizer/index.js                                           *\n     * ============================================================ */\n\n    getTokenFromCode(code: number) {\n      if (\n        code === charCodes.percentSign &&\n        this.input.charCodeAt(this.state.pos + 1) === charCodes.percentSign\n      ) {\n        return this.finishOp(tt.placeholder, 2);\n      }\n\n      return super.getTokenFromCode(...arguments);\n    }\n\n    /* ============================================================ *\n     * parser/expression.js                                         *\n     * ============================================================ */\n\n    parseExprAtom(): MaybePlaceholder<\"Expression\"> {\n      return (\n        this.parsePlaceholder(\"Expression\") || super.parseExprAtom(...arguments)\n      );\n    }\n\n    parseIdentifier(): MaybePlaceholder<\"Identifier\"> {\n      // NOTE: This function only handles identifiers outside of\n      // expressions and binding patterns, since they are already\n      // handled by the parseExprAtom and parseBindingAtom functions.\n      // This is needed, for example, to parse \"class %%NAME%% {}\".\n      return (\n        this.parsePlaceholder(\"Identifier\") ||\n        super.parseIdentifier(...arguments)\n      );\n    }\n\n    checkReservedWord(word: string): void {\n      // Sometimes we call #checkReservedWord(node.name), expecting\n      // that node is an Identifier. If it is a Placeholder, name\n      // will be undefined.\n      if (word !== undefined) super.checkReservedWord(...arguments);\n    }\n\n    /* ============================================================ *\n     * parser/lval.js                                               *\n     * ============================================================ */\n\n    parseBindingAtom(): MaybePlaceholder<\"Pattern\"> {\n      return (\n        this.parsePlaceholder(\"Pattern\") || super.parseBindingAtom(...arguments)\n      );\n    }\n\n    checkLVal(expr: N.Expression): void {\n      if (expr.type !== \"Placeholder\") super.checkLVal(...arguments);\n    }\n\n    toAssignable(node: N.Node): N.Node {\n      if (\n        node &&\n        node.type === \"Placeholder\" &&\n        node.expectedNode === \"Expression\"\n      ) {\n        node.expectedNode = \"Pattern\";\n        return node;\n      }\n      return super.toAssignable(...arguments);\n    }\n\n    /* ============================================================ *\n     * parser/statement.js                                          *\n     * ============================================================ */\n\n    isLet(context: ?string): boolean {\n      if (super.isLet(context)) {\n        return true;\n      }\n\n      // Replicate the original checks that lead to looking ahead for an\n      // identifier.\n      if (!this.isContextual(\"let\")) {\n        return false;\n      }\n      if (context) return false;\n\n      // Accept \"let %%\" as the start of \"let %%placeholder%%\", as though the\n      // placeholder were an identifier.\n      const nextToken = this.lookahead();\n      if (nextToken.type === tt.placeholder) {\n        return true;\n      }\n\n      return false;\n    }\n\n    verifyBreakContinue(node: N.BreakStatement | N.ContinueStatement) {\n      if (node.label && node.label.type === \"Placeholder\") return;\n      super.verifyBreakContinue(...arguments);\n    }\n\n    parseExpressionStatement(\n      node: MaybePlaceholder<\"Statement\">,\n      expr: N.Expression,\n    ): MaybePlaceholder<\"Statement\"> {\n      if (\n        expr.type !== \"Placeholder\" ||\n        (expr.extra && expr.extra.parenthesized)\n      ) {\n        return super.parseExpressionStatement(...arguments);\n      }\n\n      if (this.match(tt.colon)) {\n        const stmt: N.LabeledStatement = node;\n        stmt.label = this.finishPlaceholder(expr, \"Identifier\");\n        this.next();\n        stmt.body = this.parseStatement(\"label\");\n        return this.finishNode(stmt, \"LabeledStatement\");\n      }\n\n      this.semicolon();\n\n      node.name = expr.name;\n      return this.finishPlaceholder(node, \"Statement\");\n    }\n\n    parseBlock(): MaybePlaceholder<\"BlockStatement\"> {\n      return (\n        this.parsePlaceholder(\"BlockStatement\") ||\n        super.parseBlock(...arguments)\n      );\n    }\n\n    parseFunctionId(): ?MaybePlaceholder<\"Identifier\"> {\n      return (\n        this.parsePlaceholder(\"Identifier\") ||\n        super.parseFunctionId(...arguments)\n      );\n    }\n\n    parseClass<T: N.Class>(\n      node: T,\n      isStatement: /* T === ClassDeclaration */ boolean,\n      optionalId?: boolean,\n    ): T {\n      const type = isStatement ? \"ClassDeclaration\" : \"ClassExpression\";\n\n      this.next();\n      this.takeDecorators(node);\n      const oldStrict = this.state.strict;\n\n      const placeholder = this.parsePlaceholder(\"Identifier\");\n      if (placeholder) {\n        if (\n          this.match(tt._extends) ||\n          this.match(tt.placeholder) ||\n          this.match(tt.braceL)\n        ) {\n          node.id = placeholder;\n        } else if (optionalId || !isStatement) {\n          node.id = null;\n          node.body = this.finishPlaceholder(placeholder, \"ClassBody\");\n          return this.finishNode(node, type);\n        } else {\n          this.unexpected(null, PlaceHolderErrors.ClassNameIsRequired);\n        }\n      } else {\n        this.parseClassId(node, isStatement, optionalId);\n      }\n\n      this.parseClassSuper(node);\n      node.body =\n        this.parsePlaceholder(\"ClassBody\") ||\n        this.parseClassBody(!!node.superClass, oldStrict);\n      return this.finishNode(node, type);\n    }\n\n    parseExport(node: N.Node): N.Node {\n      const placeholder = this.parsePlaceholder(\"Identifier\");\n      if (!placeholder) return super.parseExport(...arguments);\n\n      if (!this.isContextual(\"from\") && !this.match(tt.comma)) {\n        // export %%DECL%%;\n        node.specifiers = [];\n        node.source = null;\n        node.declaration = this.finishPlaceholder(placeholder, \"Declaration\");\n        return this.finishNode(node, \"ExportNamedDeclaration\");\n      }\n\n      // export %%NAME%% from \"foo\";\n      this.expectPlugin(\"exportDefaultFrom\");\n      const specifier = this.startNode();\n      specifier.exported = placeholder;\n      node.specifiers = [this.finishNode(specifier, \"ExportDefaultSpecifier\")];\n\n      return super.parseExport(node);\n    }\n\n    isExportDefaultSpecifier(): boolean {\n      if (this.match(tt._default)) {\n        const next = this.nextTokenStart();\n        if (this.isUnparsedContextual(next, \"from\")) {\n          if (\n            this.input.startsWith(\n              tt.placeholder.label,\n              this.nextTokenStartSince(next + 4),\n            )\n          ) {\n            return true;\n          }\n        }\n      }\n      return super.isExportDefaultSpecifier();\n    }\n\n    maybeParseExportDefaultSpecifier(node: N.Node): boolean {\n      if (node.specifiers && node.specifiers.length > 0) {\n        // \"export %%NAME%%\" has already been parsed by #parseExport.\n        return true;\n      }\n      return super.maybeParseExportDefaultSpecifier(...arguments);\n    }\n\n    checkExport(node: N.ExportNamedDeclaration): void {\n      const { specifiers } = node;\n      if (specifiers?.length) {\n        node.specifiers = specifiers.filter(\n          node => node.exported.type === \"Placeholder\",\n        );\n      }\n      super.checkExport(node);\n      node.specifiers = specifiers;\n    }\n\n    parseImport(\n      node: N.Node,\n    ): N.ImportDeclaration | N.TsImportEqualsDeclaration {\n      const placeholder = this.parsePlaceholder(\"Identifier\");\n      if (!placeholder) return super.parseImport(...arguments);\n\n      node.specifiers = [];\n\n      if (!this.isContextual(\"from\") && !this.match(tt.comma)) {\n        // import %%STRING%%;\n        node.source = this.finishPlaceholder(placeholder, \"StringLiteral\");\n        this.semicolon();\n        return this.finishNode(node, \"ImportDeclaration\");\n      }\n\n      // import %%DEFAULT%% ...\n      const specifier = this.startNodeAtNode(placeholder);\n      specifier.local = placeholder;\n      this.finishNode(specifier, \"ImportDefaultSpecifier\");\n      node.specifiers.push(specifier);\n\n      if (this.eat(tt.comma)) {\n        // import %%DEFAULT%%, * as ...\n        const hasStarImport = this.maybeParseStarImportSpecifier(node);\n\n        // import %%DEFAULT%%, { ...\n        if (!hasStarImport) this.parseNamedImportSpecifiers(node);\n      }\n\n      this.expectContextual(\"from\");\n      node.source = this.parseImportSource();\n      this.semicolon();\n      return this.finishNode(node, \"ImportDeclaration\");\n    }\n\n    parseImportSource(): MaybePlaceholder<\"StringLiteral\"> {\n      // import ... from %%STRING%%;\n\n      return (\n        this.parsePlaceholder(\"StringLiteral\") ||\n        super.parseImportSource(...arguments)\n      );\n    }\n  };\n","// @flow\n\nimport type Parser from \"./parser\";\n\nexport type Plugin = string | [string, Object];\n\nexport type PluginList = $ReadOnlyArray<Plugin>;\n\nexport type MixinPlugin = (superClass: Class<Parser>) => Class<Parser>;\n\nexport function hasPlugin(plugins: PluginList, name: string): boolean {\n  return plugins.some(plugin => {\n    if (Array.isArray(plugin)) {\n      return plugin[0] === name;\n    } else {\n      return plugin === name;\n    }\n  });\n}\n\nexport function getPluginOption(\n  plugins: PluginList,\n  name: string,\n  option: string,\n) {\n  const plugin = plugins.find(plugin => {\n    if (Array.isArray(plugin)) {\n      return plugin[0] === name;\n    } else {\n      return plugin === name;\n    }\n  });\n\n  if (plugin && Array.isArray(plugin)) {\n    return plugin[1][option];\n  }\n\n  return null;\n}\n\nconst PIPELINE_PROPOSALS = [\"minimal\", \"smart\", \"fsharp\"];\nconst RECORD_AND_TUPLE_SYNTAX_TYPES = [\"hash\", \"bar\"];\n\nexport function validatePlugins(plugins: PluginList) {\n  if (hasPlugin(plugins, \"decorators\")) {\n    if (hasPlugin(plugins, \"decorators-legacy\")) {\n      throw new Error(\n        \"Cannot use the decorators and decorators-legacy plugin together\",\n      );\n    }\n\n    const decoratorsBeforeExport = getPluginOption(\n      plugins,\n      \"decorators\",\n      \"decoratorsBeforeExport\",\n    );\n    if (decoratorsBeforeExport == null) {\n      throw new Error(\n        \"The 'decorators' plugin requires a 'decoratorsBeforeExport' option,\" +\n          \" whose value must be a boolean. If you are migrating from\" +\n          \" Babylon/Babel 6 or want to use the old decorators proposal, you\" +\n          \" should use the 'decorators-legacy' plugin instead of 'decorators'.\",\n      );\n    } else if (typeof decoratorsBeforeExport !== \"boolean\") {\n      throw new Error(\"'decoratorsBeforeExport' must be a boolean.\");\n    }\n  }\n\n  if (hasPlugin(plugins, \"flow\") && hasPlugin(plugins, \"typescript\")) {\n    throw new Error(\"Cannot combine flow and typescript plugins.\");\n  }\n\n  if (hasPlugin(plugins, \"placeholders\") && hasPlugin(plugins, \"v8intrinsic\")) {\n    throw new Error(\"Cannot combine placeholders and v8intrinsic plugins.\");\n  }\n\n  if (\n    hasPlugin(plugins, \"pipelineOperator\") &&\n    !PIPELINE_PROPOSALS.includes(\n      getPluginOption(plugins, \"pipelineOperator\", \"proposal\"),\n    )\n  ) {\n    throw new Error(\n      \"'pipelineOperator' requires 'proposal' option whose value should be one of: \" +\n        PIPELINE_PROPOSALS.map(p => `'${p}'`).join(\", \"),\n    );\n  }\n\n  if (hasPlugin(plugins, \"moduleAttributes\")) {\n    if (process.env.BABEL_8_BREAKING) {\n      throw new Error(\n        \"`moduleAttributes` has been removed in Babel 8, please use `importAssertions` parser plugin, or `@babel/plugin-syntax-import-assertions`.\",\n      );\n    } else {\n      if (hasPlugin(plugins, \"importAssertions\")) {\n        throw new Error(\n          \"Cannot combine importAssertions and moduleAttributes plugins.\",\n        );\n      }\n      const moduleAttributesVerionPluginOption = getPluginOption(\n        plugins,\n        \"moduleAttributes\",\n        \"version\",\n      );\n      if (moduleAttributesVerionPluginOption !== \"may-2020\") {\n        throw new Error(\n          \"The 'moduleAttributes' plugin requires a 'version' option,\" +\n            \" representing the last proposal update. Currently, the\" +\n            \" only supported value is 'may-2020'.\",\n        );\n      }\n    }\n  }\n\n  if (\n    hasPlugin(plugins, \"recordAndTuple\") &&\n    !RECORD_AND_TUPLE_SYNTAX_TYPES.includes(\n      getPluginOption(plugins, \"recordAndTuple\", \"syntaxType\"),\n    )\n  ) {\n    throw new Error(\n      \"'recordAndTuple' requires 'syntaxType' option whose value should be one of: \" +\n        RECORD_AND_TUPLE_SYNTAX_TYPES.map(p => `'${p}'`).join(\", \"),\n    );\n  }\n\n  if (\n    hasPlugin(plugins, \"asyncDoExpressions\") &&\n    !hasPlugin(plugins, \"doExpressions\")\n  ) {\n    const error = new Error(\n      \"'asyncDoExpressions' requires 'doExpressions', please add 'doExpressions' to parser plugins.\",\n    );\n    // $FlowIgnore\n    error.missingPlugins = \"doExpressions\"; // so @babel/core can provide better error message\n    throw error;\n  }\n}\n\n// These plugins are defined using a mixin which extends the parser class.\n\nimport estree from \"./plugins/estree\";\nimport flow from \"./plugins/flow\";\nimport jsx from \"./plugins/jsx\";\nimport typescript from \"./plugins/typescript\";\nimport placeholders from \"./plugins/placeholders\";\nimport v8intrinsic from \"./plugins/v8intrinsic\";\n\n// NOTE: order is important. estree must come first; placeholders must come last.\nexport const mixinPlugins: { [name: string]: MixinPlugin } = {\n  estree,\n  jsx,\n  flow,\n  typescript,\n  v8intrinsic,\n  placeholders,\n};\n\nexport const mixinPluginNames: $ReadOnlyArray<string> =\n  Object.keys(mixinPlugins);\n","// @flow\n\nimport { TokenType } from \"../tokenizer/types\";\nimport type Parser from \"../parser\";\nimport type { ExpressionErrors } from \"../parser/util\";\nimport * as N from \"../types\";\nimport type { Position } from \"../util/location\";\nimport { Errors } from \"../parser/error\";\n\nexport default (superClass: Class<Parser>): Class<Parser> =>\n  class extends superClass {\n    parseRegExpLiteral({ pattern, flags }): N.Node {\n      let regex = null;\n      try {\n        regex = new RegExp(pattern, flags);\n      } catch (e) {\n        // In environments that don't support these flags value will\n        // be null as the regex can't be represented natively.\n      }\n      const node = this.estreeParseLiteral<N.EstreeRegExpLiteral>(regex);\n      node.regex = { pattern, flags };\n\n      return node;\n    }\n\n    parseBigIntLiteral(value: any): N.Node {\n      // https://github.com/estree/estree/blob/master/es2020.md#bigintliteral\n      let bigInt;\n      try {\n        // $FlowIgnore\n        bigInt = BigInt(value);\n      } catch {\n        bigInt = null;\n      }\n      const node = this.estreeParseLiteral<N.EstreeBigIntLiteral>(bigInt);\n      node.bigint = String(node.value || value);\n\n      return node;\n    }\n\n    parseDecimalLiteral(value: any): N.Node {\n      // https://github.com/estree/estree/blob/master/experimental/decimal.md\n      // todo: use BigDecimal when node supports it.\n      const decimal = null;\n      const node = this.estreeParseLiteral(decimal);\n      node.decimal = String(node.value || value);\n\n      return node;\n    }\n\n    estreeParseLiteral<T: N.Node>(value: any) {\n      return this.parseLiteral<T>(value, \"Literal\");\n    }\n\n    parseStringLiteral(value: any): N.Node {\n      return this.estreeParseLiteral(value);\n    }\n\n    parseNumericLiteral(value: any): any {\n      return this.estreeParseLiteral(value);\n    }\n\n    parseNullLiteral(): N.Node {\n      return this.estreeParseLiteral(null);\n    }\n\n    parseBooleanLiteral(value: boolean): N.BooleanLiteral {\n      return this.estreeParseLiteral(value);\n    }\n\n    directiveToStmt(directive: N.Directive): N.ExpressionStatement {\n      const directiveLiteral = directive.value;\n\n      const stmt = this.startNodeAt(directive.start, directive.loc.start);\n      const expression = this.startNodeAt(\n        directiveLiteral.start,\n        directiveLiteral.loc.start,\n      );\n\n      expression.value = directiveLiteral.extra.expressionValue;\n      expression.raw = directiveLiteral.extra.raw;\n\n      stmt.expression = this.finishNodeAt(\n        expression,\n        \"Literal\",\n        directiveLiteral.end,\n        directiveLiteral.loc.end,\n      );\n      stmt.directive = directiveLiteral.extra.raw.slice(1, -1);\n\n      return this.finishNodeAt(\n        stmt,\n        \"ExpressionStatement\",\n        directive.end,\n        directive.loc.end,\n      );\n    }\n\n    // ==================================\n    // Overrides\n    // ==================================\n\n    initFunction(\n      node: N.BodilessFunctionOrMethodBase,\n      isAsync: ?boolean,\n    ): void {\n      super.initFunction(node, isAsync);\n      node.expression = false;\n    }\n\n    checkDeclaration(node: N.Pattern | N.ObjectProperty): void {\n      if (node != null && this.isObjectProperty(node)) {\n        this.checkDeclaration(((node: any): N.EstreeProperty).value);\n      } else {\n        super.checkDeclaration(node);\n      }\n    }\n\n    getObjectOrClassMethodParams(method: N.ObjectMethod | N.ClassMethod) {\n      return ((method: any): N.EstreeProperty | N.EstreeMethodDefinition).value\n        .params;\n    }\n\n    isValidDirective(stmt: N.Statement): boolean {\n      return (\n        stmt.type === \"ExpressionStatement\" &&\n        stmt.expression.type === \"Literal\" &&\n        typeof stmt.expression.value === \"string\" &&\n        !stmt.expression.extra?.parenthesized\n      );\n    }\n\n    stmtToDirective(stmt: N.Statement): N.Directive {\n      const directive = super.stmtToDirective(stmt);\n      const value = stmt.expression.value;\n\n      // Record the expression value as in estree mode we want\n      // the stmt to have the real value e.g. (\"use strict\") and\n      // not the raw value e.g. (\"use\\\\x20strict\")\n      this.addExtra(directive.value, \"expressionValue\", value);\n\n      return directive;\n    }\n\n    parseBlockBody(\n      node: N.BlockStatementLike,\n      ...args: [?boolean, boolean, TokenType, void | (boolean => void)]\n    ): void {\n      super.parseBlockBody(node, ...args);\n\n      const directiveStatements = node.directives.map(d =>\n        this.directiveToStmt(d),\n      );\n      node.body = directiveStatements.concat(node.body);\n      // $FlowIgnore - directives isn't optional in the type definition\n      delete node.directives;\n    }\n\n    pushClassMethod(\n      classBody: N.ClassBody,\n      method: N.ClassMethod,\n      isGenerator: boolean,\n      isAsync: boolean,\n      isConstructor: boolean,\n      allowsDirectSuper: boolean,\n    ): void {\n      this.parseMethod(\n        method,\n        isGenerator,\n        isAsync,\n        isConstructor,\n        allowsDirectSuper,\n        \"ClassMethod\",\n        true,\n      );\n      if (method.typeParameters) {\n        // $FlowIgnore\n        method.value.typeParameters = method.typeParameters;\n        delete method.typeParameters;\n      }\n      classBody.body.push(method);\n    }\n\n    parseMaybePrivateName(...args: [boolean]): any {\n      const node = super.parseMaybePrivateName(...args);\n      if (\n        node.type === \"PrivateName\" &&\n        this.getPluginOption(\"estree\", \"classFeatures\")\n      ) {\n        return this.convertPrivateNameToPrivateIdentifier(node);\n      }\n      return node;\n    }\n\n    convertPrivateNameToPrivateIdentifier(\n      node: N.PrivateName,\n    ): N.EstreePrivateIdentifier {\n      const name = super.getPrivateNameSV(node);\n      node = (node: any);\n      delete node.id;\n      node.name = name;\n      node.type = \"PrivateIdentifier\";\n      return node;\n    }\n\n    isPrivateName(node: N.Node): boolean {\n      if (!this.getPluginOption(\"estree\", \"classFeatures\")) {\n        return super.isPrivateName(node);\n      }\n      return node.type === \"PrivateIdentifier\";\n    }\n\n    getPrivateNameSV(node: N.Node): string {\n      if (!this.getPluginOption(\"estree\", \"classFeatures\")) {\n        return super.getPrivateNameSV(node);\n      }\n      return node.name;\n    }\n\n    parseLiteral<T: N.Node>(value: any, type: $ElementType<T, \"type\">): T {\n      const node = super.parseLiteral<T>(value, type);\n      node.raw = node.extra.raw;\n      delete node.extra;\n\n      return node;\n    }\n\n    parseFunctionBody(\n      node: N.Function,\n      allowExpression: ?boolean,\n      isMethod?: boolean = false,\n    ): void {\n      super.parseFunctionBody(node, allowExpression, isMethod);\n      node.expression = node.body.type !== \"BlockStatement\";\n    }\n\n    parseMethod<T: N.MethodLike>(\n      node: T,\n      isGenerator: boolean,\n      isAsync: boolean,\n      isConstructor: boolean,\n      allowDirectSuper: boolean,\n      type: string,\n      inClassScope: boolean = false,\n    ): T {\n      let funcNode = this.startNode();\n      funcNode.kind = node.kind; // provide kind, so super method correctly sets state\n      funcNode = super.parseMethod(\n        funcNode,\n        isGenerator,\n        isAsync,\n        isConstructor,\n        allowDirectSuper,\n        type,\n        inClassScope,\n      );\n      funcNode.type = \"FunctionExpression\";\n      delete funcNode.kind;\n      // $FlowIgnore\n      node.value = funcNode;\n      if (type === \"ClassPrivateMethod\") {\n        // $FlowIgnore\n        node.computed = false;\n      }\n      type = \"MethodDefinition\";\n      return this.finishNode(node, type);\n    }\n\n    parseClassProperty(...args: [N.ClassProperty]): any {\n      const propertyNode = (super.parseClassProperty(...args): any);\n      if (this.getPluginOption(\"estree\", \"classFeatures\")) {\n        propertyNode.type = \"PropertyDefinition\";\n      }\n      return (propertyNode: N.EstreePropertyDefinition);\n    }\n\n    parseClassPrivateProperty(...args: [N.ClassPrivateProperty]): any {\n      const propertyNode = (super.parseClassPrivateProperty(...args): any);\n      if (this.getPluginOption(\"estree\", \"classFeatures\")) {\n        propertyNode.type = \"PropertyDefinition\";\n        propertyNode.computed = false;\n      }\n      return (propertyNode: N.EstreePropertyDefinition);\n    }\n\n    parseObjectMethod(\n      prop: N.ObjectMethod,\n      isGenerator: boolean,\n      isAsync: boolean,\n      isPattern: boolean,\n      isAccessor: boolean,\n    ): ?N.ObjectMethod {\n      const node: N.EstreeProperty = (super.parseObjectMethod(\n        prop,\n        isGenerator,\n        isAsync,\n        isPattern,\n        isAccessor,\n      ): any);\n\n      if (node) {\n        node.type = \"Property\";\n        if (((node: any): N.ClassMethod).kind === \"method\") node.kind = \"init\";\n        node.shorthand = false;\n      }\n\n      return (node: any);\n    }\n\n    parseObjectProperty(\n      prop: N.ObjectProperty,\n      startPos: ?number,\n      startLoc: ?Position,\n      isPattern: boolean,\n      refExpressionErrors: ?ExpressionErrors,\n    ): ?N.ObjectProperty {\n      const node: N.EstreeProperty = (super.parseObjectProperty(\n        prop,\n        startPos,\n        startLoc,\n        isPattern,\n        refExpressionErrors,\n      ): any);\n\n      if (node) {\n        node.kind = \"init\";\n        node.type = \"Property\";\n      }\n\n      return (node: any);\n    }\n\n    toAssignable(node: N.Node, isLHS: boolean = false): N.Node {\n      if (node != null && this.isObjectProperty(node)) {\n        this.toAssignable(node.value, isLHS);\n\n        return node;\n      }\n\n      return super.toAssignable(node, isLHS);\n    }\n\n    toAssignableObjectExpressionProp(prop: N.Node, ...args) {\n      if (prop.kind === \"get\" || prop.kind === \"set\") {\n        this.raise(prop.key.start, Errors.PatternHasAccessor);\n      } else if (prop.method) {\n        this.raise(prop.key.start, Errors.PatternHasMethod);\n      } else {\n        super.toAssignableObjectExpressionProp(prop, ...args);\n      }\n    }\n\n    finishCallExpression<T: N.CallExpression | N.OptionalCallExpression>(\n      node: T,\n      optional: boolean,\n    ): N.Expression {\n      super.finishCallExpression(node, optional);\n\n      if (node.callee.type === \"Import\") {\n        ((node: N.Node): N.EstreeImportExpression).type = \"ImportExpression\";\n        ((node: N.Node): N.EstreeImportExpression).source = node.arguments[0];\n        if (this.hasPlugin(\"importAssertions\")) {\n          ((node: N.Node): N.EstreeImportExpression).attributes =\n            node.arguments[1] ?? null;\n        }\n        // $FlowIgnore - arguments isn't optional in the type definition\n        delete node.arguments;\n        // $FlowIgnore - callee isn't optional in the type definition\n        delete node.callee;\n      }\n\n      return node;\n    }\n\n    toReferencedArguments(\n      node:\n        | N.CallExpression\n        | N.OptionalCallExpression\n        | N.EstreeImportExpression,\n      /* isParenthesizedExpr?: boolean, */\n    ) {\n      // ImportExpressions do not have an arguments array.\n      if (node.type === \"ImportExpression\") {\n        return;\n      }\n\n      super.toReferencedArguments(node);\n    }\n\n    parseExport(node: N.Node) {\n      super.parseExport(node);\n\n      switch (node.type) {\n        case \"ExportAllDeclaration\":\n          node.exported = null;\n          break;\n\n        case \"ExportNamedDeclaration\":\n          if (\n            node.specifiers.length === 1 &&\n            node.specifiers[0].type === \"ExportNamespaceSpecifier\"\n          ) {\n            node.type = \"ExportAllDeclaration\";\n            node.exported = node.specifiers[0].exported;\n            delete node.specifiers;\n          }\n\n          break;\n      }\n\n      return node;\n    }\n\n    parseSubscript(\n      base: N.Expression,\n      startPos: number,\n      startLoc: Position,\n      noCalls: ?boolean,\n      state: N.ParseSubscriptState,\n    ) {\n      const node = super.parseSubscript(\n        base,\n        startPos,\n        startLoc,\n        noCalls,\n        state,\n      );\n\n      if (state.optionalChainMember) {\n        // https://github.com/estree/estree/blob/master/es2020.md#chainexpression\n        if (\n          node.type === \"OptionalMemberExpression\" ||\n          node.type === \"OptionalCallExpression\"\n        ) {\n          node.type = node.type.substring(8); // strip Optional prefix\n        }\n        if (state.stop) {\n          const chain = this.startNodeAtNode(node);\n          chain.expression = node;\n          return this.finishNode(chain, \"ChainExpression\");\n        }\n      } else if (\n        node.type === \"MemberExpression\" ||\n        node.type === \"CallExpression\"\n      ) {\n        node.optional = false;\n      }\n\n      return node;\n    }\n\n    hasPropertyAsPrivateName(node: N.Node): boolean {\n      if (node.type === \"ChainExpression\") {\n        node = node.expression;\n      }\n      return super.hasPropertyAsPrivateName(node);\n    }\n\n    isOptionalChain(node: N.Node): boolean {\n      return node.type === \"ChainExpression\";\n    }\n\n    isObjectProperty(node: N.Node): boolean {\n      return node.type === \"Property\" && node.kind === \"init\" && !node.method;\n    }\n\n    isObjectMethod(node: N.Node): boolean {\n      return node.method || node.kind === \"get\" || node.kind === \"set\";\n    }\n  };\n","import type Parser from \"../parser\";\nimport { types as tt } from \"../tokenizer/types\";\nimport * as N from \"../types\";\n\nexport default (superClass: Class<Parser>): Class<Parser> =>\n  class extends superClass {\n    parseV8Intrinsic(): N.Expression {\n      if (this.match(tt.modulo)) {\n        const v8IntrinsicStart = this.state.start;\n        // let the `loc` of Identifier starts from `%`\n        const node = this.startNode();\n        this.eat(tt.modulo);\n        if (this.match(tt.name)) {\n          const name = this.parseIdentifierName(this.state.start);\n          const identifier = this.createIdentifier(node, name);\n          identifier.type = \"V8IntrinsicIdentifier\";\n          if (this.match(tt.parenL)) {\n            return identifier;\n          }\n        }\n        this.unexpected(v8IntrinsicStart);\n      }\n    }\n\n    /* ============================================================ *\n     * parser/expression.js                                         *\n     * ============================================================ */\n\n    parseExprAtom(): N.Expression {\n      return this.parseV8Intrinsic() || super.parseExprAtom(...arguments);\n    }\n  };\n","// @flow\n\nimport type { PluginList } from \"./plugin-utils\";\n\n// A second optional argument can be given to further configure\n// the parser process. These options are recognized:\n\nexport type SourceType = \"script\" | \"module\" | \"unambiguous\";\n\nexport type Options = {\n  sourceType: SourceType,\n  sourceFilename?: string,\n  startLine: number,\n  allowAwaitOutsideFunction: boolean,\n  allowReturnOutsideFunction: boolean,\n  allowImportExportEverywhere: boolean,\n  allowSuperOutsideMethod: boolean,\n  allowUndeclaredExports: boolean,\n  plugins: PluginList,\n  strictMode: ?boolean,\n  ranges: boolean,\n  tokens: boolean,\n  createParenthesizedExpressions: boolean,\n  errorRecovery: boolean,\n};\n\nexport const defaultOptions: Options = {\n  // Source type (\"script\" or \"module\") for different semantics\n  sourceType: \"script\",\n  // Source filename.\n  sourceFilename: undefined,\n  // Line from which to start counting source. Useful for\n  // integration with other tools.\n  startLine: 1,\n  // When enabled, await at the top level is not considered an\n  // error.\n  allowAwaitOutsideFunction: false,\n  // When enabled, a return at the top level is not considered an\n  // error.\n  allowReturnOutsideFunction: false,\n  // When enabled, import/export statements are not constrained to\n  // appearing at the top of the program.\n  allowImportExportEverywhere: false,\n  // TODO\n  allowSuperOutsideMethod: false,\n  // When enabled, export statements can reference undeclared variables.\n  allowUndeclaredExports: false,\n  // An array of plugins to enable\n  plugins: [],\n  // TODO\n  strictMode: null,\n  // Nodes have their start and end characters offsets recorded in\n  // `start` and `end` properties (directly on the node, rather than\n  // the `loc` object, which holds line/column data. To also add a\n  // [semi-standardized][range] `range` property holding a `[start,\n  // end]` array with the same numbers, set the `ranges` option to\n  // `true`.\n  //\n  // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678\n  ranges: false,\n  // Adds all parsed tokens to a `tokens` property on the `File` node\n  tokens: false,\n  // Whether to create ParenthesizedExpression AST nodes (if false\n  // the parser sets extra.parenthesized on the expression nodes instead).\n  createParenthesizedExpressions: false,\n  // When enabled, errors are attached to the AST instead of being directly thrown.\n  // Some errors will still throw, because @babel/parser can't always recover.\n  errorRecovery: false,\n};\n\n// Interpret and default an options object\n\nexport function getOptions(opts: ?Options): Options {\n  const options: any = {};\n  for (const key of Object.keys(defaultOptions)) {\n    options[key] = opts && opts[key] != null ? opts[key] : defaultOptions[key];\n  }\n  return options;\n}\n","// @flow\n\n/*:: declare var invariant; */\n\nimport type { Options } from \"../options\";\nimport * as N from \"../types\";\nimport type { Position } from \"../util/location\";\nimport * as charCodes from \"charcodes\";\nimport { isIdentifierStart, isIdentifierChar } from \"../util/identifier\";\nimport { types as tt, keywords as keywordTypes, type TokenType } from \"./types\";\nimport { type TokContext, types as ct } from \"./context\";\nimport ParserErrors, { Errors, type ErrorTemplate } from \"../parser/error\";\nimport { SourceLocation } from \"../util/location\";\nimport {\n  lineBreak,\n  lineBreakG,\n  isNewLine,\n  isWhitespace,\n  skipWhiteSpace,\n} from \"../util/whitespace\";\nimport State from \"./state\";\nimport type { LookaheadState } from \"./state\";\n\nconst VALID_REGEX_FLAGS = new Set([\"g\", \"m\", \"s\", \"i\", \"y\", \"u\", \"d\"]);\n\n// The following character codes are forbidden from being\n// an immediate sibling of NumericLiteralSeparator _\n\nconst forbiddenNumericSeparatorSiblings = {\n  decBinOct: [\n    charCodes.dot,\n    charCodes.uppercaseB,\n    charCodes.uppercaseE,\n    charCodes.uppercaseO,\n    charCodes.underscore, // multiple separators are not allowed\n    charCodes.lowercaseB,\n    charCodes.lowercaseE,\n    charCodes.lowercaseO,\n  ],\n  hex: [\n    charCodes.dot,\n    charCodes.uppercaseX,\n    charCodes.underscore, // multiple separators are not allowed\n    charCodes.lowercaseX,\n  ],\n};\n\nconst allowedNumericSeparatorSiblings = {};\nallowedNumericSeparatorSiblings.bin = [\n  // 0 - 1\n  charCodes.digit0,\n  charCodes.digit1,\n];\nallowedNumericSeparatorSiblings.oct = [\n  // 0 - 7\n  ...allowedNumericSeparatorSiblings.bin,\n\n  charCodes.digit2,\n  charCodes.digit3,\n  charCodes.digit4,\n  charCodes.digit5,\n  charCodes.digit6,\n  charCodes.digit7,\n];\nallowedNumericSeparatorSiblings.dec = [\n  // 0 - 9\n  ...allowedNumericSeparatorSiblings.oct,\n\n  charCodes.digit8,\n  charCodes.digit9,\n];\n\nallowedNumericSeparatorSiblings.hex = [\n  // 0 - 9, A - F, a - f,\n  ...allowedNumericSeparatorSiblings.dec,\n\n  charCodes.uppercaseA,\n  charCodes.uppercaseB,\n  charCodes.uppercaseC,\n  charCodes.uppercaseD,\n  charCodes.uppercaseE,\n  charCodes.uppercaseF,\n\n  charCodes.lowercaseA,\n  charCodes.lowercaseB,\n  charCodes.lowercaseC,\n  charCodes.lowercaseD,\n  charCodes.lowercaseE,\n  charCodes.lowercaseF,\n];\n\n// Object type used to represent tokens. Note that normally, tokens\n// simply exist as properties on the parser object. This is only\n// used for the onToken callback and the external tokenizer.\n\nexport class Token {\n  constructor(state: State) {\n    this.type = state.type;\n    this.value = state.value;\n    this.start = state.start;\n    this.end = state.end;\n    this.loc = new SourceLocation(state.startLoc, state.endLoc);\n  }\n\n  declare type: TokenType;\n  declare value: any;\n  declare start: number;\n  declare end: number;\n  declare loc: SourceLocation;\n}\n\n// ## Tokenizer\n\nexport default class Tokenizer extends ParserErrors {\n  // Forward-declarations\n  // parser/util.js\n  /*::\n  +hasPrecedingLineBreak: () => boolean;\n  +unexpected: (pos?: ?number, messageOrType?: ErrorTemplate | TokenType) => empty;\n  +expectPlugin: (name: string, pos?: ?number) => true;\n  */\n\n  isLookahead: boolean;\n\n  // Token store.\n  tokens: Array<Token | N.Comment> = [];\n\n  constructor(options: Options, input: string) {\n    super();\n    this.state = new State();\n    this.state.init(options);\n    this.input = input;\n    this.length = input.length;\n    this.isLookahead = false;\n  }\n\n  pushToken(token: Token | N.Comment) {\n    // Pop out invalid tokens trapped by try-catch parsing.\n    // Those parsing branches are mainly created by typescript and flow plugins.\n    this.tokens.length = this.state.tokensLength;\n    this.tokens.push(token);\n    ++this.state.tokensLength;\n  }\n\n  // Move to the next token\n\n  next(): void {\n    this.checkKeywordEscapes();\n    if (this.options.tokens) {\n      this.pushToken(new Token(this.state));\n    }\n\n    this.state.lastTokEnd = this.state.end;\n    this.state.lastTokStart = this.state.start;\n    this.state.lastTokEndLoc = this.state.endLoc;\n    this.state.lastTokStartLoc = this.state.startLoc;\n    this.nextToken();\n  }\n\n  // TODO\n\n  eat(type: TokenType): boolean {\n    if (this.match(type)) {\n      this.next();\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  // TODO\n\n  match(type: TokenType): boolean {\n    return this.state.type === type;\n  }\n\n  /**\n   * Create a LookaheadState from current parser state\n   *\n   * @param {State} state\n   * @returns {LookaheadState}\n   * @memberof Tokenizer\n   */\n  createLookaheadState(state: State): LookaheadState {\n    return {\n      pos: state.pos,\n      value: null,\n      type: state.type,\n      start: state.start,\n      end: state.end,\n      lastTokEnd: state.end,\n      context: [this.curContext()],\n      inType: state.inType,\n    };\n  }\n\n  /**\n   * lookahead peeks the next token, skipping changes to token context and\n   * comment stack. For performance it returns a limited LookaheadState\n   * instead of full parser state.\n   *\n   * The { column, line } Loc info is not included in lookahead since such usage\n   * is rare. Although it may return other location properties e.g. `curLine` and\n   * `lineStart`, these properties are not listed in the LookaheadState interface\n   * and thus the returned value is _NOT_ reliable.\n   *\n   * The tokenizer should make best efforts to avoid using any parser state\n   * other than those defined in LookaheadState\n   *\n   * @returns {LookaheadState}\n   * @memberof Tokenizer\n   */\n  lookahead(): LookaheadState {\n    const old = this.state;\n    // For performance we use a simpified tokenizer state structure\n    // $FlowIgnore\n    this.state = this.createLookaheadState(old);\n\n    this.isLookahead = true;\n    this.nextToken();\n    this.isLookahead = false;\n\n    const curr = this.state;\n    this.state = old;\n    return curr;\n  }\n\n  nextTokenStart(): number {\n    return this.nextTokenStartSince(this.state.pos);\n  }\n\n  nextTokenStartSince(pos: number): number {\n    skipWhiteSpace.lastIndex = pos;\n    const skip = skipWhiteSpace.exec(this.input);\n    // $FlowIgnore: The skipWhiteSpace ensures to match any string\n    return pos + skip[0].length;\n  }\n\n  lookaheadCharCode(): number {\n    return this.input.charCodeAt(this.nextTokenStart());\n  }\n\n  codePointAtPos(pos: number): number {\n    // The implementation is based on\n    // https://source.chromium.org/chromium/chromium/src/+/master:v8/src/builtins/builtins-string-gen.cc;l=1455;drc=221e331b49dfefadbc6fa40b0c68e6f97606d0b3;bpv=0;bpt=1\n    // We reimplement `codePointAt` because `codePointAt` is a V8 builtin which is not inlined by TurboFan (as of M91)\n    // since `input` is mostly ASCII, an inlined `charCodeAt` wins here\n    let cp = this.input.charCodeAt(pos);\n    if ((cp & 0xfc00) === 0xd800 && ++pos < this.input.length) {\n      const trail = this.input.charCodeAt(pos);\n      if ((trail & 0xfc00) === 0xdc00) {\n        cp = 0x10000 + ((cp & 0x3ff) << 10) + (trail & 0x3ff);\n      }\n    }\n    return cp;\n  }\n\n  // Toggle strict mode. Re-reads the next number or string to please\n  // pedantic tests (`\"use strict\"; 010;` should fail).\n\n  setStrict(strict: boolean): void {\n    this.state.strict = strict;\n    if (strict) {\n      // Throw an error for any string decimal escape found before/immediately\n      // after a \"use strict\" directive. Strict mode will be set at parse\n      // time for any literals that occur after the next node of the strict\n      // directive.\n      this.state.strictErrors.forEach((message, pos) =>\n        /* eslint-disable @babel/development-internal/dry-error-messages */\n        this.raise(pos, message),\n      );\n      this.state.strictErrors.clear();\n    }\n  }\n\n  curContext(): TokContext {\n    return this.state.context[this.state.context.length - 1];\n  }\n\n  // Read a single token, updating the parser object's token-related\n  // properties.\n\n  nextToken(): void {\n    const curContext = this.curContext();\n    if (!curContext.preserveSpace) this.skipSpace();\n    this.state.start = this.state.pos;\n    if (!this.isLookahead) this.state.startLoc = this.state.curPosition();\n    if (this.state.pos >= this.length) {\n      this.finishToken(tt.eof);\n      return;\n    }\n\n    if (curContext === ct.template) {\n      this.readTmplToken();\n    } else {\n      this.getTokenFromCode(this.codePointAtPos(this.state.pos));\n    }\n  }\n\n  pushComment(\n    block: boolean,\n    text: string,\n    start: number,\n    end: number,\n    startLoc: Position,\n    endLoc: Position,\n  ): void {\n    const comment = {\n      type: block ? \"CommentBlock\" : \"CommentLine\",\n      value: text,\n      start: start,\n      end: end,\n      loc: new SourceLocation(startLoc, endLoc),\n    };\n\n    if (this.options.tokens) this.pushToken(comment);\n    this.state.comments.push(comment);\n    this.addComment(comment);\n  }\n\n  skipBlockComment(): void {\n    let startLoc;\n    if (!this.isLookahead) startLoc = this.state.curPosition();\n    const start = this.state.pos;\n    const end = this.input.indexOf(\"*/\", this.state.pos + 2);\n    if (end === -1) throw this.raise(start, Errors.UnterminatedComment);\n\n    this.state.pos = end + 2;\n    lineBreakG.lastIndex = start;\n    let match;\n    while (\n      (match = lineBreakG.exec(this.input)) &&\n      match.index < this.state.pos\n    ) {\n      ++this.state.curLine;\n      this.state.lineStart = match.index + match[0].length;\n    }\n\n    // If we are doing a lookahead right now we need to advance the position (above code)\n    // but we do not want to push the comment to the state.\n    if (this.isLookahead) return;\n    /*:: invariant(startLoc) */\n\n    this.pushComment(\n      true,\n      this.input.slice(start + 2, end),\n      start,\n      this.state.pos,\n      startLoc,\n      this.state.curPosition(),\n    );\n  }\n\n  skipLineComment(startSkip: number): void {\n    const start = this.state.pos;\n    let startLoc;\n    if (!this.isLookahead) startLoc = this.state.curPosition();\n    let ch = this.input.charCodeAt((this.state.pos += startSkip));\n    if (this.state.pos < this.length) {\n      while (!isNewLine(ch) && ++this.state.pos < this.length) {\n        ch = this.input.charCodeAt(this.state.pos);\n      }\n    }\n\n    // If we are doing a lookahead right now we need to advance the position (above code)\n    // but we do not want to push the comment to the state.\n    if (this.isLookahead) return;\n    /*:: invariant(startLoc) */\n\n    this.pushComment(\n      false,\n      this.input.slice(start + startSkip, this.state.pos),\n      start,\n      this.state.pos,\n      startLoc,\n      this.state.curPosition(),\n    );\n  }\n\n  // Called at the start of the parse and after every token. Skips\n  // whitespace and comments, and.\n\n  skipSpace(): void {\n    loop: while (this.state.pos < this.length) {\n      const ch = this.input.charCodeAt(this.state.pos);\n      switch (ch) {\n        case charCodes.space:\n        case charCodes.nonBreakingSpace:\n        case charCodes.tab:\n          ++this.state.pos;\n          break;\n        case charCodes.carriageReturn:\n          if (\n            this.input.charCodeAt(this.state.pos + 1) === charCodes.lineFeed\n          ) {\n            ++this.state.pos;\n          }\n        // fall through\n        case charCodes.lineFeed:\n        case charCodes.lineSeparator:\n        case charCodes.paragraphSeparator:\n          ++this.state.pos;\n          ++this.state.curLine;\n          this.state.lineStart = this.state.pos;\n          break;\n\n        case charCodes.slash:\n          switch (this.input.charCodeAt(this.state.pos + 1)) {\n            case charCodes.asterisk:\n              this.skipBlockComment();\n              break;\n\n            case charCodes.slash:\n              this.skipLineComment(2);\n              break;\n\n            default:\n              break loop;\n          }\n          break;\n\n        default:\n          if (isWhitespace(ch)) {\n            ++this.state.pos;\n          } else {\n            break loop;\n          }\n      }\n    }\n  }\n\n  // Called at the end of every token. Sets `end`, `val`, and\n  // maintains `context` and `exprAllowed`, and skips the space after\n  // the token, so that the next one's `start` will point at the\n  // right position.\n\n  finishToken(type: TokenType, val: any): void {\n    this.state.end = this.state.pos;\n    const prevType = this.state.type;\n    this.state.type = type;\n    this.state.value = val;\n\n    if (!this.isLookahead) {\n      this.state.endLoc = this.state.curPosition();\n      this.updateContext(prevType);\n    }\n  }\n\n  // ### Token reading\n\n  // This is the function that is called to fetch the next token. It\n  // is somewhat obscure, because it works in character codes rather\n  // than characters, and because operator parsing has been inlined\n  // into it.\n  //\n  // All in the name of speed.\n\n  // number sign is \"#\"\n  readToken_numberSign(): void {\n    if (this.state.pos === 0 && this.readToken_interpreter()) {\n      return;\n    }\n\n    const nextPos = this.state.pos + 1;\n    const next = this.codePointAtPos(nextPos);\n    if (next >= charCodes.digit0 && next <= charCodes.digit9) {\n      throw this.raise(this.state.pos, Errors.UnexpectedDigitAfterHash);\n    }\n\n    if (\n      next === charCodes.leftCurlyBrace ||\n      (next === charCodes.leftSquareBracket && this.hasPlugin(\"recordAndTuple\"))\n    ) {\n      // When we see `#{`, it is likely to be a hash record.\n      // However we don't yell at `#[` since users may intend to use \"computed private fields\",\n      // which is not allowed in the spec. Throwing expecting recordAndTuple is\n      // misleading\n      this.expectPlugin(\"recordAndTuple\");\n      if (this.getPluginOption(\"recordAndTuple\", \"syntaxType\") !== \"hash\") {\n        throw this.raise(\n          this.state.pos,\n          next === charCodes.leftCurlyBrace\n            ? Errors.RecordExpressionHashIncorrectStartSyntaxType\n            : Errors.TupleExpressionHashIncorrectStartSyntaxType,\n        );\n      }\n\n      this.state.pos += 2;\n      if (next === charCodes.leftCurlyBrace) {\n        // #{\n        this.finishToken(tt.braceHashL);\n      } else {\n        // #[\n        this.finishToken(tt.bracketHashL);\n      }\n    } else if (isIdentifierStart(next)) {\n      ++this.state.pos;\n      this.finishToken(tt.privateName, this.readWord1(next));\n    } else if (next === charCodes.backslash) {\n      ++this.state.pos;\n      this.finishToken(tt.privateName, this.readWord1());\n    } else {\n      this.finishOp(tt.hash, 1);\n    }\n  }\n\n  readToken_dot(): void {\n    const next = this.input.charCodeAt(this.state.pos + 1);\n    if (next >= charCodes.digit0 && next <= charCodes.digit9) {\n      this.readNumber(true);\n      return;\n    }\n\n    if (\n      next === charCodes.dot &&\n      this.input.charCodeAt(this.state.pos + 2) === charCodes.dot\n    ) {\n      this.state.pos += 3;\n      this.finishToken(tt.ellipsis);\n    } else {\n      ++this.state.pos;\n      this.finishToken(tt.dot);\n    }\n  }\n\n  readToken_slash(): void {\n    const next = this.input.charCodeAt(this.state.pos + 1);\n    if (next === charCodes.equalsTo) {\n      this.finishOp(tt.slashAssign, 2);\n    } else {\n      this.finishOp(tt.slash, 1);\n    }\n  }\n\n  readToken_interpreter(): boolean {\n    if (this.state.pos !== 0 || this.length < 2) return false;\n\n    let ch = this.input.charCodeAt(this.state.pos + 1);\n    if (ch !== charCodes.exclamationMark) return false;\n\n    const start = this.state.pos;\n    this.state.pos += 1;\n\n    while (!isNewLine(ch) && ++this.state.pos < this.length) {\n      ch = this.input.charCodeAt(this.state.pos);\n    }\n\n    const value = this.input.slice(start + 2, this.state.pos);\n\n    this.finishToken(tt.interpreterDirective, value);\n\n    return true;\n  }\n\n  readToken_mult_modulo(code: number): void {\n    // '%*'\n    let type = code === charCodes.asterisk ? tt.star : tt.modulo;\n    let width = 1;\n    let next = this.input.charCodeAt(this.state.pos + 1);\n\n    // Exponentiation operator **\n    if (code === charCodes.asterisk && next === charCodes.asterisk) {\n      width++;\n      next = this.input.charCodeAt(this.state.pos + 2);\n      type = tt.exponent;\n    }\n\n    if (next === charCodes.equalsTo && !this.state.inType) {\n      width++;\n      type = tt.assign;\n    }\n\n    this.finishOp(type, width);\n  }\n\n  readToken_pipe_amp(code: number): void {\n    // '||' '&&' '||=' '&&='\n    const next = this.input.charCodeAt(this.state.pos + 1);\n\n    if (next === code) {\n      if (this.input.charCodeAt(this.state.pos + 2) === charCodes.equalsTo) {\n        this.finishOp(tt.assign, 3);\n      } else {\n        this.finishOp(\n          code === charCodes.verticalBar ? tt.logicalOR : tt.logicalAND,\n          2,\n        );\n      }\n      return;\n    }\n\n    if (code === charCodes.verticalBar) {\n      // '|>'\n      if (next === charCodes.greaterThan) {\n        this.finishOp(tt.pipeline, 2);\n        return;\n      }\n      // '|}'\n      if (\n        this.hasPlugin(\"recordAndTuple\") &&\n        next === charCodes.rightCurlyBrace\n      ) {\n        if (this.getPluginOption(\"recordAndTuple\", \"syntaxType\") !== \"bar\") {\n          throw this.raise(\n            this.state.pos,\n            Errors.RecordExpressionBarIncorrectEndSyntaxType,\n          );\n        }\n        this.state.pos += 2;\n        this.finishToken(tt.braceBarR);\n        return;\n      }\n\n      // '|]'\n      if (\n        this.hasPlugin(\"recordAndTuple\") &&\n        next === charCodes.rightSquareBracket\n      ) {\n        if (this.getPluginOption(\"recordAndTuple\", \"syntaxType\") !== \"bar\") {\n          throw this.raise(\n            this.state.pos,\n            Errors.TupleExpressionBarIncorrectEndSyntaxType,\n          );\n        }\n        this.state.pos += 2;\n        this.finishToken(tt.bracketBarR);\n        return;\n      }\n    }\n\n    if (next === charCodes.equalsTo) {\n      this.finishOp(tt.assign, 2);\n      return;\n    }\n\n    this.finishOp(\n      code === charCodes.verticalBar ? tt.bitwiseOR : tt.bitwiseAND,\n      1,\n    );\n  }\n\n  readToken_caret(): void {\n    // '^'\n    const next = this.input.charCodeAt(this.state.pos + 1);\n    if (next === charCodes.equalsTo) {\n      this.finishOp(tt.assign, 2);\n    } else {\n      this.finishOp(tt.bitwiseXOR, 1);\n    }\n  }\n\n  readToken_plus_min(code: number): void {\n    // '+-'\n    const next = this.input.charCodeAt(this.state.pos + 1);\n\n    if (next === code) {\n      if (\n        next === charCodes.dash &&\n        !this.inModule &&\n        this.input.charCodeAt(this.state.pos + 2) === charCodes.greaterThan &&\n        (this.state.lastTokEnd === 0 || this.hasPrecedingLineBreak())\n      ) {\n        // A `-->` line comment\n        this.skipLineComment(3);\n        this.skipSpace();\n        this.nextToken();\n        return;\n      }\n      this.finishOp(tt.incDec, 2);\n      return;\n    }\n\n    if (next === charCodes.equalsTo) {\n      this.finishOp(tt.assign, 2);\n    } else {\n      this.finishOp(tt.plusMin, 1);\n    }\n  }\n\n  readToken_lt_gt(code: number): void {\n    // '<>'\n    const next = this.input.charCodeAt(this.state.pos + 1);\n    let size = 1;\n\n    if (next === code) {\n      size =\n        code === charCodes.greaterThan &&\n        this.input.charCodeAt(this.state.pos + 2) === charCodes.greaterThan\n          ? 3\n          : 2;\n      if (this.input.charCodeAt(this.state.pos + size) === charCodes.equalsTo) {\n        this.finishOp(tt.assign, size + 1);\n        return;\n      }\n      this.finishOp(tt.bitShift, size);\n      return;\n    }\n\n    if (\n      next === charCodes.exclamationMark &&\n      code === charCodes.lessThan &&\n      !this.inModule &&\n      this.input.charCodeAt(this.state.pos + 2) === charCodes.dash &&\n      this.input.charCodeAt(this.state.pos + 3) === charCodes.dash\n    ) {\n      // `<!--`, an XML-style comment that should be interpreted as a line comment\n      this.skipLineComment(4);\n      this.skipSpace();\n      this.nextToken();\n      return;\n    }\n\n    if (next === charCodes.equalsTo) {\n      // <= | >=\n      size = 2;\n    }\n\n    this.finishOp(tt.relational, size);\n  }\n\n  readToken_eq_excl(code: number): void {\n    // '=!'\n    const next = this.input.charCodeAt(this.state.pos + 1);\n    if (next === charCodes.equalsTo) {\n      this.finishOp(\n        tt.equality,\n        this.input.charCodeAt(this.state.pos + 2) === charCodes.equalsTo\n          ? 3\n          : 2,\n      );\n      return;\n    }\n    if (code === charCodes.equalsTo && next === charCodes.greaterThan) {\n      // '=>'\n      this.state.pos += 2;\n      this.finishToken(tt.arrow);\n      return;\n    }\n    this.finishOp(code === charCodes.equalsTo ? tt.eq : tt.bang, 1);\n  }\n\n  readToken_question(): void {\n    // '?'\n    const next = this.input.charCodeAt(this.state.pos + 1);\n    const next2 = this.input.charCodeAt(this.state.pos + 2);\n    if (next === charCodes.questionMark) {\n      if (next2 === charCodes.equalsTo) {\n        // '??='\n        this.finishOp(tt.assign, 3);\n      } else {\n        // '??'\n        this.finishOp(tt.nullishCoalescing, 2);\n      }\n    } else if (\n      next === charCodes.dot &&\n      !(next2 >= charCodes.digit0 && next2 <= charCodes.digit9)\n    ) {\n      // '.' not followed by a number\n      this.state.pos += 2;\n      this.finishToken(tt.questionDot);\n    } else {\n      ++this.state.pos;\n      this.finishToken(tt.question);\n    }\n  }\n\n  getTokenFromCode(code: number): void {\n    switch (code) {\n      // The interpretation of a dot depends on whether it is followed\n      // by a digit or another two dots.\n\n      case charCodes.dot:\n        this.readToken_dot();\n        return;\n\n      // Punctuation tokens.\n      case charCodes.leftParenthesis:\n        ++this.state.pos;\n        this.finishToken(tt.parenL);\n        return;\n      case charCodes.rightParenthesis:\n        ++this.state.pos;\n        this.finishToken(tt.parenR);\n        return;\n      case charCodes.semicolon:\n        ++this.state.pos;\n        this.finishToken(tt.semi);\n        return;\n      case charCodes.comma:\n        ++this.state.pos;\n        this.finishToken(tt.comma);\n        return;\n      case charCodes.leftSquareBracket:\n        if (\n          this.hasPlugin(\"recordAndTuple\") &&\n          this.input.charCodeAt(this.state.pos + 1) === charCodes.verticalBar\n        ) {\n          if (this.getPluginOption(\"recordAndTuple\", \"syntaxType\") !== \"bar\") {\n            throw this.raise(\n              this.state.pos,\n              Errors.TupleExpressionBarIncorrectStartSyntaxType,\n            );\n          }\n\n          // [|\n          this.state.pos += 2;\n          this.finishToken(tt.bracketBarL);\n        } else {\n          ++this.state.pos;\n          this.finishToken(tt.bracketL);\n        }\n        return;\n      case charCodes.rightSquareBracket:\n        ++this.state.pos;\n        this.finishToken(tt.bracketR);\n        return;\n      case charCodes.leftCurlyBrace:\n        if (\n          this.hasPlugin(\"recordAndTuple\") &&\n          this.input.charCodeAt(this.state.pos + 1) === charCodes.verticalBar\n        ) {\n          if (this.getPluginOption(\"recordAndTuple\", \"syntaxType\") !== \"bar\") {\n            throw this.raise(\n              this.state.pos,\n              Errors.RecordExpressionBarIncorrectStartSyntaxType,\n            );\n          }\n\n          // {|\n          this.state.pos += 2;\n          this.finishToken(tt.braceBarL);\n        } else {\n          ++this.state.pos;\n          this.finishToken(tt.braceL);\n        }\n        return;\n      case charCodes.rightCurlyBrace:\n        ++this.state.pos;\n        this.finishToken(tt.braceR);\n        return;\n\n      case charCodes.colon:\n        if (\n          this.hasPlugin(\"functionBind\") &&\n          this.input.charCodeAt(this.state.pos + 1) === charCodes.colon\n        ) {\n          this.finishOp(tt.doubleColon, 2);\n        } else {\n          ++this.state.pos;\n          this.finishToken(tt.colon);\n        }\n        return;\n\n      case charCodes.questionMark:\n        this.readToken_question();\n        return;\n\n      case charCodes.graveAccent:\n        ++this.state.pos;\n        this.finishToken(tt.backQuote);\n        return;\n\n      case charCodes.digit0: {\n        const next = this.input.charCodeAt(this.state.pos + 1);\n        // '0x', '0X' - hex number\n        if (next === charCodes.lowercaseX || next === charCodes.uppercaseX) {\n          this.readRadixNumber(16);\n          return;\n        }\n        // '0o', '0O' - octal number\n        if (next === charCodes.lowercaseO || next === charCodes.uppercaseO) {\n          this.readRadixNumber(8);\n          return;\n        }\n        // '0b', '0B' - binary number\n        if (next === charCodes.lowercaseB || next === charCodes.uppercaseB) {\n          this.readRadixNumber(2);\n          return;\n        }\n      }\n      // Anything else beginning with a digit is an integer, octal\n      // number, or float. (fall through)\n      case charCodes.digit1:\n      case charCodes.digit2:\n      case charCodes.digit3:\n      case charCodes.digit4:\n      case charCodes.digit5:\n      case charCodes.digit6:\n      case charCodes.digit7:\n      case charCodes.digit8:\n      case charCodes.digit9:\n        this.readNumber(false);\n        return;\n\n      // Quotes produce strings.\n      case charCodes.quotationMark:\n      case charCodes.apostrophe:\n        this.readString(code);\n        return;\n\n      // Operators are parsed inline in tiny state machines. '=' (charCodes.equalsTo) is\n      // often referred to. `finishOp` simply skips the amount of\n      // characters it is given as second argument, and returns a token\n      // of the type given by its first argument.\n\n      case charCodes.slash:\n        this.readToken_slash();\n        return;\n\n      case charCodes.percentSign:\n      case charCodes.asterisk:\n        this.readToken_mult_modulo(code);\n        return;\n\n      case charCodes.verticalBar:\n      case charCodes.ampersand:\n        this.readToken_pipe_amp(code);\n        return;\n\n      case charCodes.caret:\n        this.readToken_caret();\n        return;\n\n      case charCodes.plusSign:\n      case charCodes.dash:\n        this.readToken_plus_min(code);\n        return;\n\n      case charCodes.lessThan:\n      case charCodes.greaterThan:\n        this.readToken_lt_gt(code);\n        return;\n\n      case charCodes.equalsTo:\n      case charCodes.exclamationMark:\n        this.readToken_eq_excl(code);\n        return;\n\n      case charCodes.tilde:\n        this.finishOp(tt.tilde, 1);\n        return;\n\n      case charCodes.atSign:\n        ++this.state.pos;\n        this.finishToken(tt.at);\n        return;\n\n      case charCodes.numberSign:\n        this.readToken_numberSign();\n        return;\n\n      case charCodes.backslash:\n        this.readWord();\n        return;\n\n      default:\n        if (isIdentifierStart(code)) {\n          this.readWord(code);\n          return;\n        }\n    }\n\n    throw this.raise(\n      this.state.pos,\n      Errors.InvalidOrUnexpectedToken,\n      String.fromCodePoint(code),\n    );\n  }\n\n  finishOp(type: TokenType, size: number): void {\n    const str = this.input.slice(this.state.pos, this.state.pos + size);\n    this.state.pos += size;\n    this.finishToken(type, str);\n  }\n\n  readRegexp(): void {\n    const start = this.state.start + 1;\n    let escaped, inClass;\n    for (;;) {\n      if (this.state.pos >= this.length) {\n        throw this.raise(start, Errors.UnterminatedRegExp);\n      }\n      const ch = this.input.charAt(this.state.pos);\n      if (lineBreak.test(ch)) {\n        throw this.raise(start, Errors.UnterminatedRegExp);\n      }\n      if (escaped) {\n        escaped = false;\n      } else {\n        if (ch === \"[\") {\n          inClass = true;\n        } else if (ch === \"]\" && inClass) {\n          inClass = false;\n        } else if (ch === \"/\" && !inClass) {\n          break;\n        }\n        escaped = ch === \"\\\\\";\n      }\n      ++this.state.pos;\n    }\n    const content = this.input.slice(start, this.state.pos);\n    ++this.state.pos;\n\n    let mods = \"\";\n\n    while (this.state.pos < this.length) {\n      const char = this.input[this.state.pos];\n      const charCode = this.codePointAtPos(this.state.pos);\n\n      if (VALID_REGEX_FLAGS.has(char)) {\n        if (mods.indexOf(char) > -1) {\n          this.raise(this.state.pos + 1, Errors.DuplicateRegExpFlags);\n        }\n      } else if (\n        isIdentifierChar(charCode) ||\n        charCode === charCodes.backslash\n      ) {\n        this.raise(this.state.pos + 1, Errors.MalformedRegExpFlags);\n      } else {\n        break;\n      }\n\n      ++this.state.pos;\n      mods += char;\n    }\n\n    this.finishToken(tt.regexp, {\n      pattern: content,\n      flags: mods,\n    });\n  }\n\n  // Read an integer in the given radix. Return null if zero digits\n  // were read, the integer value otherwise. When `len` is given, this\n  // will return `null` unless the integer has exactly `len` digits.\n  // When `forceLen` is `true`, it means that we already know that in case\n  // of a malformed number we have to skip `len` characters anyway, instead\n  // of bailing out early. For example, in \"\\u{123Z}\" we want to read up to }\n  // anyway, while in \"\\u00Z\" we will stop at Z instead of consuming four\n  // characters (and thus the closing quote).\n\n  readInt(\n    radix: number,\n    len?: number,\n    forceLen?: boolean,\n    allowNumSeparator: boolean = true,\n  ): number | null {\n    const start = this.state.pos;\n    const forbiddenSiblings =\n      radix === 16\n        ? forbiddenNumericSeparatorSiblings.hex\n        : forbiddenNumericSeparatorSiblings.decBinOct;\n    const allowedSiblings =\n      radix === 16\n        ? allowedNumericSeparatorSiblings.hex\n        : radix === 10\n        ? allowedNumericSeparatorSiblings.dec\n        : radix === 8\n        ? allowedNumericSeparatorSiblings.oct\n        : allowedNumericSeparatorSiblings.bin;\n\n    let invalid = false;\n    let total = 0;\n\n    for (let i = 0, e = len == null ? Infinity : len; i < e; ++i) {\n      const code = this.input.charCodeAt(this.state.pos);\n      let val;\n\n      if (code === charCodes.underscore) {\n        const prev = this.input.charCodeAt(this.state.pos - 1);\n        const next = this.input.charCodeAt(this.state.pos + 1);\n        if (allowedSiblings.indexOf(next) === -1) {\n          this.raise(this.state.pos, Errors.UnexpectedNumericSeparator);\n        } else if (\n          forbiddenSiblings.indexOf(prev) > -1 ||\n          forbiddenSiblings.indexOf(next) > -1 ||\n          Number.isNaN(next)\n        ) {\n          this.raise(this.state.pos, Errors.UnexpectedNumericSeparator);\n        }\n\n        if (!allowNumSeparator) {\n          this.raise(this.state.pos, Errors.NumericSeparatorInEscapeSequence);\n        }\n\n        // Ignore this _ character\n        ++this.state.pos;\n        continue;\n      }\n\n      if (code >= charCodes.lowercaseA) {\n        val = code - charCodes.lowercaseA + charCodes.lineFeed;\n      } else if (code >= charCodes.uppercaseA) {\n        val = code - charCodes.uppercaseA + charCodes.lineFeed;\n      } else if (charCodes.isDigit(code)) {\n        val = code - charCodes.digit0; // 0-9\n      } else {\n        val = Infinity;\n      }\n      if (val >= radix) {\n        // If we are in \"errorRecovery\" mode and we found a digit which is too big,\n        // don't break the loop.\n\n        if (this.options.errorRecovery && val <= 9) {\n          val = 0;\n          this.raise(this.state.start + i + 2, Errors.InvalidDigit, radix);\n        } else if (forceLen) {\n          val = 0;\n          invalid = true;\n        } else {\n          break;\n        }\n      }\n      ++this.state.pos;\n      total = total * radix + val;\n    }\n    if (\n      this.state.pos === start ||\n      (len != null && this.state.pos - start !== len) ||\n      invalid\n    ) {\n      return null;\n    }\n\n    return total;\n  }\n\n  readRadixNumber(radix: number): void {\n    const start = this.state.pos;\n    let isBigInt = false;\n\n    this.state.pos += 2; // 0x\n    const val = this.readInt(radix);\n    if (val == null) {\n      this.raise(this.state.start + 2, Errors.InvalidDigit, radix);\n    }\n    const next = this.input.charCodeAt(this.state.pos);\n\n    if (next === charCodes.lowercaseN) {\n      ++this.state.pos;\n      isBigInt = true;\n    } else if (next === charCodes.lowercaseM) {\n      throw this.raise(start, Errors.InvalidDecimal);\n    }\n\n    if (isIdentifierStart(this.codePointAtPos(this.state.pos))) {\n      throw this.raise(this.state.pos, Errors.NumberIdentifier);\n    }\n\n    if (isBigInt) {\n      const str = this.input.slice(start, this.state.pos).replace(/[_n]/g, \"\");\n      this.finishToken(tt.bigint, str);\n      return;\n    }\n\n    this.finishToken(tt.num, val);\n  }\n\n  // Read an integer, octal integer, or floating-point number.\n\n  readNumber(startsWithDot: boolean): void {\n    const start = this.state.pos;\n    let isFloat = false;\n    let isBigInt = false;\n    let isDecimal = false;\n    let hasExponent = false;\n    let isOctal = false;\n\n    if (!startsWithDot && this.readInt(10) === null) {\n      this.raise(start, Errors.InvalidNumber);\n    }\n    const hasLeadingZero =\n      this.state.pos - start >= 2 &&\n      this.input.charCodeAt(start) === charCodes.digit0;\n\n    if (hasLeadingZero) {\n      const integer = this.input.slice(start, this.state.pos);\n      this.recordStrictModeErrors(start, Errors.StrictOctalLiteral);\n      if (!this.state.strict) {\n        // disallow numeric separators in non octal decimals and legacy octal likes\n        const underscorePos = integer.indexOf(\"_\");\n        if (underscorePos > 0) {\n          this.raise(underscorePos + start, Errors.ZeroDigitNumericSeparator);\n        }\n      }\n      isOctal = hasLeadingZero && !/[89]/.test(integer);\n    }\n\n    let next = this.input.charCodeAt(this.state.pos);\n    if (next === charCodes.dot && !isOctal) {\n      ++this.state.pos;\n      this.readInt(10);\n      isFloat = true;\n      next = this.input.charCodeAt(this.state.pos);\n    }\n\n    if (\n      (next === charCodes.uppercaseE || next === charCodes.lowercaseE) &&\n      !isOctal\n    ) {\n      next = this.input.charCodeAt(++this.state.pos);\n      if (next === charCodes.plusSign || next === charCodes.dash) {\n        ++this.state.pos;\n      }\n      if (this.readInt(10) === null) {\n        this.raise(start, Errors.InvalidOrMissingExponent);\n      }\n      isFloat = true;\n      hasExponent = true;\n      next = this.input.charCodeAt(this.state.pos);\n    }\n\n    if (next === charCodes.lowercaseN) {\n      // disallow floats, legacy octal syntax and non octal decimals\n      // new style octal (\"0o\") is handled in this.readRadixNumber\n      if (isFloat || hasLeadingZero) {\n        this.raise(start, Errors.InvalidBigIntLiteral);\n      }\n      ++this.state.pos;\n      isBigInt = true;\n    }\n\n    if (next === charCodes.lowercaseM) {\n      this.expectPlugin(\"decimal\", this.state.pos);\n      if (hasExponent || hasLeadingZero) {\n        this.raise(start, Errors.InvalidDecimal);\n      }\n      ++this.state.pos;\n      isDecimal = true;\n    }\n\n    if (isIdentifierStart(this.codePointAtPos(this.state.pos))) {\n      throw this.raise(this.state.pos, Errors.NumberIdentifier);\n    }\n\n    // remove \"_\" for numeric literal separator, and trailing `m` or `n`\n    const str = this.input.slice(start, this.state.pos).replace(/[_mn]/g, \"\");\n\n    if (isBigInt) {\n      this.finishToken(tt.bigint, str);\n      return;\n    }\n\n    if (isDecimal) {\n      this.finishToken(tt.decimal, str);\n      return;\n    }\n\n    const val = isOctal ? parseInt(str, 8) : parseFloat(str);\n    this.finishToken(tt.num, val);\n  }\n\n  // Read a string value, interpreting backslash-escapes.\n\n  readCodePoint(throwOnInvalid: boolean): number | null {\n    const ch = this.input.charCodeAt(this.state.pos);\n    let code;\n\n    if (ch === charCodes.leftCurlyBrace) {\n      const codePos = ++this.state.pos;\n      code = this.readHexChar(\n        this.input.indexOf(\"}\", this.state.pos) - this.state.pos,\n        true,\n        throwOnInvalid,\n      );\n      ++this.state.pos;\n      if (code !== null && code > 0x10ffff) {\n        if (throwOnInvalid) {\n          this.raise(codePos, Errors.InvalidCodePoint);\n        } else {\n          return null;\n        }\n      }\n    } else {\n      code = this.readHexChar(4, false, throwOnInvalid);\n    }\n    return code;\n  }\n\n  readString(quote: number): void {\n    let out = \"\",\n      chunkStart = ++this.state.pos;\n    for (;;) {\n      if (this.state.pos >= this.length) {\n        throw this.raise(this.state.start, Errors.UnterminatedString);\n      }\n      const ch = this.input.charCodeAt(this.state.pos);\n      if (ch === quote) break;\n      if (ch === charCodes.backslash) {\n        out += this.input.slice(chunkStart, this.state.pos);\n        // $FlowFixMe\n        out += this.readEscapedChar(false);\n        chunkStart = this.state.pos;\n      } else if (\n        ch === charCodes.lineSeparator ||\n        ch === charCodes.paragraphSeparator\n      ) {\n        ++this.state.pos;\n        ++this.state.curLine;\n        this.state.lineStart = this.state.pos;\n      } else if (isNewLine(ch)) {\n        throw this.raise(this.state.start, Errors.UnterminatedString);\n      } else {\n        ++this.state.pos;\n      }\n    }\n    out += this.input.slice(chunkStart, this.state.pos++);\n    this.finishToken(tt.string, out);\n  }\n\n  // Reads template string tokens.\n\n  readTmplToken(): void {\n    let out = \"\",\n      chunkStart = this.state.pos,\n      containsInvalid = false;\n    for (;;) {\n      if (this.state.pos >= this.length) {\n        throw this.raise(this.state.start, Errors.UnterminatedTemplate);\n      }\n      const ch = this.input.charCodeAt(this.state.pos);\n      if (\n        ch === charCodes.graveAccent ||\n        (ch === charCodes.dollarSign &&\n          this.input.charCodeAt(this.state.pos + 1) ===\n            charCodes.leftCurlyBrace)\n      ) {\n        if (this.state.pos === this.state.start && this.match(tt.template)) {\n          if (ch === charCodes.dollarSign) {\n            this.state.pos += 2;\n            this.finishToken(tt.dollarBraceL);\n            return;\n          } else {\n            ++this.state.pos;\n            this.finishToken(tt.backQuote);\n            return;\n          }\n        }\n        out += this.input.slice(chunkStart, this.state.pos);\n        this.finishToken(tt.template, containsInvalid ? null : out);\n        return;\n      }\n      if (ch === charCodes.backslash) {\n        out += this.input.slice(chunkStart, this.state.pos);\n        const escaped = this.readEscapedChar(true);\n        if (escaped === null) {\n          containsInvalid = true;\n        } else {\n          out += escaped;\n        }\n        chunkStart = this.state.pos;\n      } else if (isNewLine(ch)) {\n        out += this.input.slice(chunkStart, this.state.pos);\n        ++this.state.pos;\n        switch (ch) {\n          case charCodes.carriageReturn:\n            if (this.input.charCodeAt(this.state.pos) === charCodes.lineFeed) {\n              ++this.state.pos;\n            }\n          // fall through\n          case charCodes.lineFeed:\n            out += \"\\n\";\n            break;\n          default:\n            out += String.fromCharCode(ch);\n            break;\n        }\n        ++this.state.curLine;\n        this.state.lineStart = this.state.pos;\n        chunkStart = this.state.pos;\n      } else {\n        ++this.state.pos;\n      }\n    }\n  }\n\n  recordStrictModeErrors(pos: number, message: ErrorTemplate) {\n    if (this.state.strict && !this.state.strictErrors.has(pos)) {\n      this.raise(pos, message);\n    } else {\n      this.state.strictErrors.set(pos, message);\n    }\n  }\n\n  // Used to read escaped characters\n  readEscapedChar(inTemplate: boolean): string | null {\n    const throwOnInvalid = !inTemplate;\n    const ch = this.input.charCodeAt(++this.state.pos);\n    ++this.state.pos;\n    switch (ch) {\n      case charCodes.lowercaseN:\n        return \"\\n\";\n      case charCodes.lowercaseR:\n        return \"\\r\";\n      case charCodes.lowercaseX: {\n        const code = this.readHexChar(2, false, throwOnInvalid);\n        return code === null ? null : String.fromCharCode(code);\n      }\n      case charCodes.lowercaseU: {\n        const code = this.readCodePoint(throwOnInvalid);\n        return code === null ? null : String.fromCodePoint(code);\n      }\n      case charCodes.lowercaseT:\n        return \"\\t\";\n      case charCodes.lowercaseB:\n        return \"\\b\";\n      case charCodes.lowercaseV:\n        return \"\\u000b\";\n      case charCodes.lowercaseF:\n        return \"\\f\";\n      case charCodes.carriageReturn:\n        if (this.input.charCodeAt(this.state.pos) === charCodes.lineFeed) {\n          ++this.state.pos;\n        }\n      // fall through\n      case charCodes.lineFeed:\n        this.state.lineStart = this.state.pos;\n        ++this.state.curLine;\n      // fall through\n      case charCodes.lineSeparator:\n      case charCodes.paragraphSeparator:\n        return \"\";\n      case charCodes.digit8:\n      case charCodes.digit9:\n        if (inTemplate) {\n          return null;\n        } else {\n          this.recordStrictModeErrors(\n            this.state.pos - 1,\n            Errors.StrictNumericEscape,\n          );\n        }\n      // fall through\n      default:\n        if (ch >= charCodes.digit0 && ch <= charCodes.digit7) {\n          const codePos = this.state.pos - 1;\n          const match = this.input\n            .substr(this.state.pos - 1, 3)\n            .match(/^[0-7]+/);\n\n          // This is never null, because of the if condition above.\n          /*:: invariant(match !== null) */\n          let octalStr = match[0];\n\n          let octal = parseInt(octalStr, 8);\n          if (octal > 255) {\n            octalStr = octalStr.slice(0, -1);\n            octal = parseInt(octalStr, 8);\n          }\n          this.state.pos += octalStr.length - 1;\n          const next = this.input.charCodeAt(this.state.pos);\n          if (\n            octalStr !== \"0\" ||\n            next === charCodes.digit8 ||\n            next === charCodes.digit9\n          ) {\n            if (inTemplate) {\n              return null;\n            } else {\n              this.recordStrictModeErrors(codePos, Errors.StrictNumericEscape);\n            }\n          }\n\n          return String.fromCharCode(octal);\n        }\n\n        return String.fromCharCode(ch);\n    }\n  }\n\n  // Used to read character escape sequences ('\\x', '\\u').\n\n  readHexChar(\n    len: number,\n    forceLen: boolean,\n    throwOnInvalid: boolean,\n  ): number | null {\n    const codePos = this.state.pos;\n    const n = this.readInt(16, len, forceLen, false);\n    if (n === null) {\n      if (throwOnInvalid) {\n        this.raise(codePos, Errors.InvalidEscapeSequence);\n      } else {\n        this.state.pos = codePos - 1;\n      }\n    }\n    return n;\n  }\n\n  // Read an identifier, and return it as a string. Sets `this.state.containsEsc`\n  // to whether the word contained a '\\u' escape.\n  //\n  // Incrementally adds only escaped chars, adding other chunks as-is\n  // as a micro-optimization.\n  //\n  // When `firstCode` is given, it assumes it is always an identifier start and\n  // will skip reading start position again\n\n  readWord1(firstCode: number | void): string {\n    this.state.containsEsc = false;\n    let word = \"\";\n    const start = this.state.pos;\n    let chunkStart = this.state.pos;\n    if (firstCode !== undefined) {\n      this.state.pos += firstCode <= 0xffff ? 1 : 2;\n    }\n\n    while (this.state.pos < this.length) {\n      const ch = this.codePointAtPos(this.state.pos);\n      if (isIdentifierChar(ch)) {\n        this.state.pos += ch <= 0xffff ? 1 : 2;\n      } else if (ch === charCodes.backslash) {\n        this.state.containsEsc = true;\n\n        word += this.input.slice(chunkStart, this.state.pos);\n        const escStart = this.state.pos;\n        const identifierCheck =\n          this.state.pos === start ? isIdentifierStart : isIdentifierChar;\n\n        if (this.input.charCodeAt(++this.state.pos) !== charCodes.lowercaseU) {\n          this.raise(this.state.pos, Errors.MissingUnicodeEscape);\n          chunkStart = this.state.pos - 1;\n          continue;\n        }\n\n        ++this.state.pos;\n        const esc = this.readCodePoint(true);\n        if (esc !== null) {\n          if (!identifierCheck(esc)) {\n            this.raise(escStart, Errors.EscapedCharNotAnIdentifier);\n          }\n\n          word += String.fromCodePoint(esc);\n        }\n        chunkStart = this.state.pos;\n      } else {\n        break;\n      }\n    }\n    return word + this.input.slice(chunkStart, this.state.pos);\n  }\n\n  // Read an identifier or keyword token. Will check for reserved\n  // words when necessary.\n\n  readWord(firstCode: number | void): void {\n    const word = this.readWord1(firstCode);\n    const type = keywordTypes.get(word) || tt.name;\n    this.finishToken(type, word);\n  }\n\n  checkKeywordEscapes(): void {\n    const kw = this.state.type.keyword;\n    if (kw && this.state.containsEsc) {\n      this.raise(this.state.start, Errors.InvalidEscapedReservedWord, kw);\n    }\n  }\n\n  // the prevType is required by the jsx plugin\n  // eslint-disable-next-line no-unused-vars\n  updateContext(prevType: TokenType): void {\n    this.state.type.updateContext?.(this.state.context);\n  }\n}\n","// @flow\n\nimport {\n  CLASS_ELEMENT_KIND_ACCESSOR,\n  CLASS_ELEMENT_FLAG_STATIC,\n  type ClassElementTypes,\n} from \"./scopeflags\";\nimport { Errors, type raiseFunction } from \"../parser/error\";\n\nexport class ClassScope {\n  // A list of private named declared in the current class\n  privateNames: Set<string> = new Set();\n\n  // A list of private getters of setters without their counterpart\n  loneAccessors: Map<string, ClassElementTypes> = new Map();\n\n  // A list of private names used before being defined, mapping to\n  // their position.\n  undefinedPrivateNames: Map<string, number> = new Map();\n}\n\nexport default class ClassScopeHandler {\n  stack: Array<ClassScope> = [];\n  declare raise: raiseFunction;\n  undefinedPrivateNames: Map<string, number> = new Map();\n\n  constructor(raise: raiseFunction) {\n    this.raise = raise;\n  }\n\n  current(): ClassScope {\n    return this.stack[this.stack.length - 1];\n  }\n\n  enter() {\n    this.stack.push(new ClassScope());\n  }\n\n  exit() {\n    const oldClassScope = this.stack.pop();\n\n    // Migrate the usage of not yet defined private names to the outer\n    // class scope, or raise an error if we reached the top-level scope.\n\n    const current = this.current();\n\n    // Array.from is needed because this is compiled to an array-like for loop\n    for (const [name, pos] of Array.from(oldClassScope.undefinedPrivateNames)) {\n      if (current) {\n        if (!current.undefinedPrivateNames.has(name)) {\n          current.undefinedPrivateNames.set(name, pos);\n        }\n      } else {\n        this.raise(pos, Errors.InvalidPrivateFieldResolution, name);\n      }\n    }\n  }\n\n  declarePrivateName(\n    name: string,\n    elementType: ClassElementTypes,\n    pos: number,\n  ) {\n    const classScope = this.current();\n    let redefined = classScope.privateNames.has(name);\n\n    if (elementType & CLASS_ELEMENT_KIND_ACCESSOR) {\n      const accessor = redefined && classScope.loneAccessors.get(name);\n      if (accessor) {\n        const oldStatic = accessor & CLASS_ELEMENT_FLAG_STATIC;\n        const newStatic = elementType & CLASS_ELEMENT_FLAG_STATIC;\n\n        const oldKind = accessor & CLASS_ELEMENT_KIND_ACCESSOR;\n        const newKind = elementType & CLASS_ELEMENT_KIND_ACCESSOR;\n\n        // The private name can be duplicated only if it is used by\n        // two accessors with different kind (get and set), and if\n        // they have the same placement (static or not).\n        redefined = oldKind === newKind || oldStatic !== newStatic;\n\n        if (!redefined) classScope.loneAccessors.delete(name);\n      } else if (!redefined) {\n        classScope.loneAccessors.set(name, elementType);\n      }\n    }\n\n    if (redefined) {\n      this.raise(pos, Errors.PrivateNameRedeclaration, name);\n    }\n\n    classScope.privateNames.add(name);\n    classScope.undefinedPrivateNames.delete(name);\n  }\n\n  usePrivateName(name: string, pos: number) {\n    let classScope;\n    for (classScope of this.stack) {\n      if (classScope.privateNames.has(name)) return;\n    }\n\n    if (classScope) {\n      classScope.undefinedPrivateNames.set(name, pos);\n    } else {\n      // top-level\n      this.raise(pos, Errors.InvalidPrivateFieldResolution, name);\n    }\n  }\n}\n","// @flow\n\nimport type { ErrorTemplate, raiseFunction } from \"../parser/error\";\n\n/*:: declare var invariant; */\n/**\n * @module util/expression-scope\n\nExpressionScope is used to track declaration errors in these ambiguous patterns:\n\n- CoverParenthesizedExpressionAndArrowParameterList\n  e.g. we don't know if `({ x })` is an parenthesized expression or an\n  arrow function parameters until we see an `=>` after `)`.\n\n- CoverCallExpressionAndAsyncArrowHead\n   e.g. we don't know if `async({ x })` is a call expression or an async arrow\n   function parameters until we see an `=>` after `)`\n\nThe following declaration errors (@see parser/error-message) will be recorded in\nsome expression scopes and thrown later when we know what the ambigous pattern is\n\n- AwaitBindingIdentifier\n- AwaitExpressionFormalParameter\n- YieldInParameter\n- InvalidParenthesizedAssignment when parenthesized is an identifier\n\nThere are four different expression scope\n- Expression\n  A general scope that represents program / function body / static block. No errors\n  will be recorded nor thrown in this scope.\n\n- MaybeArrowParameterDeclaration\n  A scope that represents ambiguous arrow head e.g. `(x)`. Errors will be recorded\n  alongside parent scopes and thrown when `ExpressionScopeHandler#validateAsPattern`\n  is called.\n\n- MaybeAsyncArrowParameterDeclaration\n  A scope that represents ambiguous async arrow head e.g. `async(x)`. Errors will\n  be recorded alongside parent scopes and thrown when\n  `ExpressionScopeHandler#validateAsPattern` is called.\n\n- ParameterDeclaration\n  A scope that represents unambiguous function parameters `function(x)`. Errors\n  recorded in this scope will be thrown immediately. No errors will be recorded in\n  this scope.\n\n// @see {@link https://docs.google.com/document/d/1FAvEp9EUK-G8kHfDIEo_385Hs2SUBCYbJ5H-NnLvq8M|V8 Expression Scope design docs}\n */\n\nconst kExpression = 0,\n  kMaybeArrowParameterDeclaration = 1,\n  kMaybeAsyncArrowParameterDeclaration = 2,\n  kParameterDeclaration = 3;\n\ntype ExpressionScopeType = 0 | 1 | 2 | 3;\n\nclass ExpressionScope {\n  type: ExpressionScopeType;\n\n  constructor(type: ExpressionScopeType = kExpression) {\n    this.type = type;\n  }\n\n  canBeArrowParameterDeclaration() {\n    return (\n      this.type === kMaybeAsyncArrowParameterDeclaration ||\n      this.type === kMaybeArrowParameterDeclaration\n    );\n  }\n\n  isCertainlyParameterDeclaration() {\n    return this.type === kParameterDeclaration;\n  }\n}\n\nclass ArrowHeadParsingScope extends ExpressionScope {\n  errors: Map</* pos */ number, /* message */ ErrorTemplate> = new Map();\n  constructor(type: 1 | 2) {\n    super(type);\n  }\n  recordDeclarationError(pos: number, template: ErrorTemplate) {\n    this.errors.set(pos, template);\n  }\n  clearDeclarationError(pos: number) {\n    this.errors.delete(pos);\n  }\n  iterateErrors(iterator: (template: ErrorTemplate, pos: number) => void) {\n    this.errors.forEach(iterator);\n  }\n}\n\nexport default class ExpressionScopeHandler {\n  stack: Array<ExpressionScope> = [new ExpressionScope()];\n  declare raise: raiseFunction;\n  constructor(raise: raiseFunction) {\n    this.raise = raise;\n  }\n  enter(scope: ExpressionScope) {\n    this.stack.push(scope);\n  }\n\n  exit() {\n    this.stack.pop();\n  }\n\n  /**\n   * Record likely parameter initializer errors\n   *\n   * When current scope is a ParameterDeclaration, the error will be thrown immediately,\n   * otherwise it will be recorded to any ancestry MaybeArrowParameterDeclaration and\n   * MaybeAsyncArrowParameterDeclaration scope until an Expression scope is seen.\n   * @param {number} pos Error position\n   * @param {ErrorTemplate} template Error template\n   * @memberof ExpressionScopeHandler\n   */\n  recordParameterInitializerError(pos: number, template: ErrorTemplate): void {\n    const { stack } = this;\n    let i = stack.length - 1;\n    let scope: ExpressionScope = stack[i];\n    while (!scope.isCertainlyParameterDeclaration()) {\n      if (scope.canBeArrowParameterDeclaration()) {\n        /*:: invariant(scope instanceof ArrowHeadParsingScope) */\n        scope.recordDeclarationError(pos, template);\n      } else {\n        /*:: invariant(scope.type == kExpression) */\n        // Type-Expression is the boundary where initializer error can populate to\n        return;\n      }\n      scope = stack[--i];\n    }\n    /* eslint-disable @babel/development-internal/dry-error-messages */\n    this.raise(pos, template);\n  }\n\n  /**\n   * Record parenthesized identifier errors\n   *\n   * A parenthesized identifier in LHS can be ambiguous because the assignment\n   * can be transformed to an assignable later, but not vice versa:\n   * For example, in `([(a) = []] = []) => {}`, we think `(a) = []` is an LHS in `[(a) = []]`,\n   * an LHS within `[(a) = []] = []`. However the LHS chain is then transformed by toAssignable,\n   * and we should throw assignment `(a)`, which is only valid in LHS. Hence we record the\n   * location of parenthesized `(a)` to current scope if it is one of MaybeArrowParameterDeclaration\n   * and MaybeAsyncArrowParameterDeclaration\n   *\n   * Unlike `recordParameterInitializerError`, we don't record to ancestry scope because we\n   * validate arrow head parsing scope before exit, and then the LHS will be unambiguous:\n   * For example, in `( x = ( [(a) = []] = [] ) ) => {}`, we should not record `(a)` in `( x = ... ) =>`\n   * arrow scope because when we finish parsing `( [(a) = []] = [] )`, it is an unambiguous assignment\n   * expression and can not be cast to pattern\n   * @param {number} pos\n   * @param {ErrorTemplate} template\n   * @returns {void}\n   * @memberof ExpressionScopeHandler\n   */\n  recordParenthesizedIdentifierError(\n    pos: number,\n    template: ErrorTemplate,\n  ): void {\n    const { stack } = this;\n    const scope: ExpressionScope = stack[stack.length - 1];\n    if (scope.isCertainlyParameterDeclaration()) {\n      this.raise(pos, template);\n    } else if (scope.canBeArrowParameterDeclaration()) {\n      /*:: invariant(scope instanceof ArrowHeadParsingScope) */\n      scope.recordDeclarationError(pos, template);\n    } else {\n      return;\n    }\n  }\n\n  /**\n   * Record likely async arrow parameter errors\n   *\n   * Errors will be recorded to any ancestry MaybeAsyncArrowParameterDeclaration\n   * scope until an Expression scope is seen.\n   * @param {number} pos\n   * @param {ErrorTemplate} template\n   * @memberof ExpressionScopeHandler\n   */\n  recordAsyncArrowParametersError(pos: number, template: ErrorTemplate): void {\n    const { stack } = this;\n    let i = stack.length - 1;\n    let scope: ExpressionScope = stack[i];\n    while (scope.canBeArrowParameterDeclaration()) {\n      if (scope.type === kMaybeAsyncArrowParameterDeclaration) {\n        /*:: invariant(scope instanceof ArrowHeadParsingScope) */\n        scope.recordDeclarationError(pos, template);\n      }\n      scope = stack[--i];\n    }\n  }\n\n  validateAsPattern(): void {\n    const { stack } = this;\n    const currentScope = stack[stack.length - 1];\n    if (!currentScope.canBeArrowParameterDeclaration()) return;\n    /*:: invariant(currentScope instanceof ArrowHeadParsingScope) */\n    currentScope.iterateErrors((template, pos) => {\n      /* eslint-disable @babel/development-internal/dry-error-messages */\n      this.raise(pos, template);\n      // iterate from parent scope\n      let i = stack.length - 2;\n      let scope = stack[i];\n      while (scope.canBeArrowParameterDeclaration()) {\n        /*:: invariant(scope instanceof ArrowHeadParsingScope) */\n        scope.clearDeclarationError(pos);\n        scope = stack[--i];\n      }\n    });\n  }\n}\n\nexport function newParameterDeclarationScope() {\n  return new ExpressionScope(kParameterDeclaration);\n}\n\nexport function newArrowHeadScope() {\n  return new ArrowHeadParsingScope(kMaybeArrowParameterDeclaration);\n}\n\nexport function newAsyncArrowScope() {\n  return new ArrowHeadParsingScope(kMaybeAsyncArrowParameterDeclaration);\n}\n\nexport function newExpressionScope() {\n  return new ExpressionScope();\n}\n","// @flow\n\nimport { types as tt, TokenType } from \"../tokenizer/types\";\nimport Tokenizer from \"../tokenizer\";\nimport State from \"../tokenizer/state\";\nimport type { Node } from \"../types\";\nimport { lineBreak } from \"../util/whitespace\";\nimport { isIdentifierChar } from \"../util/identifier\";\nimport ClassScopeHandler from \"../util/class-scope\";\nimport ExpressionScopeHandler from \"../util/expression-scope\";\nimport { SCOPE_PROGRAM } from \"../util/scopeflags\";\nimport ProductionParameterHandler, {\n  PARAM_AWAIT,\n  PARAM,\n} from \"../util/production-parameter\";\nimport { Errors, type ErrorTemplate, ErrorCodes } from \"./error\";\n/*::\nimport type ScopeHandler from \"../util/scope\";\n*/\n\ntype TryParse<Node, Error, Thrown, Aborted, FailState> = {\n  node: Node,\n  error: Error,\n  thrown: Thrown,\n  aborted: Aborted,\n  failState: FailState,\n};\n\n// ## Parser utilities\n\nexport default class UtilParser extends Tokenizer {\n  // Forward-declaration: defined in parser/index.js\n  /*::\n  +getScopeHandler: () => Class<ScopeHandler<*>>;\n  */\n\n  // TODO\n\n  addExtra(node: Node, key: string, val: any): void {\n    if (!node) return;\n\n    const extra = (node.extra = node.extra || {});\n    extra[key] = val;\n  }\n\n  // TODO\n\n  isRelational(op: \"<\" | \">\"): boolean {\n    return this.match(tt.relational) && this.state.value === op;\n  }\n\n  // TODO\n\n  expectRelational(op: \"<\" | \">\"): void {\n    if (this.isRelational(op)) {\n      this.next();\n    } else {\n      this.unexpected(null, tt.relational);\n    }\n  }\n\n  // Tests whether parsed token is a contextual keyword.\n\n  isContextual(name: string): boolean {\n    return (\n      this.match(tt.name) &&\n      this.state.value === name &&\n      !this.state.containsEsc\n    );\n  }\n\n  isUnparsedContextual(nameStart: number, name: string): boolean {\n    const nameEnd = nameStart + name.length;\n    if (this.input.slice(nameStart, nameEnd) === name) {\n      const nextCh = this.input.charCodeAt(nameEnd);\n      return !(\n        isIdentifierChar(nextCh) ||\n        // check if `nextCh is between 0xd800 - 0xdbff,\n        // if `nextCh` is NaN, `NaN & 0xfc00` is 0, the function\n        // returns true\n        (nextCh & 0xfc00) === 0xd800\n      );\n    }\n    return false;\n  }\n\n  isLookaheadContextual(name: string): boolean {\n    const next = this.nextTokenStart();\n    return this.isUnparsedContextual(next, name);\n  }\n\n  // Consumes contextual keyword if possible.\n\n  eatContextual(name: string): boolean {\n    return this.isContextual(name) && this.eat(tt.name);\n  }\n\n  // Asserts that following token is given contextual keyword.\n\n  expectContextual(name: string, template?: ErrorTemplate): void {\n    if (!this.eatContextual(name)) this.unexpected(null, template);\n  }\n\n  // Test whether a semicolon can be inserted at the current position.\n\n  canInsertSemicolon(): boolean {\n    return (\n      this.match(tt.eof) ||\n      this.match(tt.braceR) ||\n      this.hasPrecedingLineBreak()\n    );\n  }\n\n  hasPrecedingLineBreak(): boolean {\n    return lineBreak.test(\n      this.input.slice(this.state.lastTokEnd, this.state.start),\n    );\n  }\n\n  hasFollowingLineBreak(): boolean {\n    return lineBreak.test(\n      this.input.slice(this.state.end, this.nextTokenStart()),\n    );\n  }\n\n  // TODO\n\n  isLineTerminator(): boolean {\n    return this.eat(tt.semi) || this.canInsertSemicolon();\n  }\n\n  // Consume a semicolon, or, failing that, see if we are allowed to\n  // pretend that there is a semicolon at this position.\n\n  semicolon(allowAsi: boolean = true): void {\n    if (allowAsi ? this.isLineTerminator() : this.eat(tt.semi)) return;\n    this.raise(this.state.lastTokEnd, Errors.MissingSemicolon);\n  }\n\n  // Expect a token of a given type. If found, consume it, otherwise,\n  // raise an unexpected token error at given pos.\n\n  expect(type: TokenType, pos?: ?number): void {\n    this.eat(type) || this.unexpected(pos, type);\n  }\n\n  // Throws if the current token and the prev one are separated by a space.\n  assertNoSpace(message: string = \"Unexpected space.\"): void {\n    if (this.state.start > this.state.lastTokEnd) {\n      /* eslint-disable @babel/development-internal/dry-error-messages */\n      this.raise(this.state.lastTokEnd, {\n        code: ErrorCodes.SyntaxError,\n        reasonCode: \"UnexpectedSpace\",\n        template: message,\n      });\n      /* eslint-enable @babel/development-internal/dry-error-messages */\n    }\n  }\n\n  // Raise an unexpected token error. Can take the expected token type\n  // instead of a message string.\n\n  unexpected(\n    pos: ?number,\n    messageOrType: ErrorTemplate | TokenType = {\n      code: ErrorCodes.SyntaxError,\n      reasonCode: \"UnexpectedToken\",\n      template: \"Unexpected token\",\n    },\n  ): empty {\n    if (messageOrType instanceof TokenType) {\n      messageOrType = {\n        code: ErrorCodes.SyntaxError,\n        reasonCode: \"UnexpectedToken\",\n        template: `Unexpected token, expected \"${messageOrType.label}\"`,\n      };\n    }\n    /* eslint-disable @babel/development-internal/dry-error-messages */\n    throw this.raise(pos != null ? pos : this.state.start, messageOrType);\n    /* eslint-enable @babel/development-internal/dry-error-messages */\n  }\n\n  expectPlugin(name: string, pos?: ?number): true {\n    if (!this.hasPlugin(name)) {\n      throw this.raiseWithData(\n        pos != null ? pos : this.state.start,\n        { missingPlugin: [name] },\n        `This experimental syntax requires enabling the parser plugin: '${name}'`,\n      );\n    }\n\n    return true;\n  }\n\n  expectOnePlugin(names: Array<string>, pos?: ?number): void {\n    if (!names.some(n => this.hasPlugin(n))) {\n      throw this.raiseWithData(\n        pos != null ? pos : this.state.start,\n        { missingPlugin: names },\n        `This experimental syntax requires enabling one of the following parser plugin(s): '${names.join(\n          \", \",\n        )}'`,\n      );\n    }\n  }\n\n  // tryParse will clone parser state.\n  // It is expensive and should be used with cautions\n  tryParse<T: Node | $ReadOnlyArray<Node>>(\n    fn: (abort: (node?: T) => empty) => T,\n    oldState: State = this.state.clone(),\n  ):\n    | TryParse<T, null, false, false, null>\n    | TryParse<T | null, SyntaxError, boolean, false, State>\n    | TryParse<T | null, null, false, true, State> {\n    const abortSignal: { node: T | null } = { node: null };\n    try {\n      const node = fn((node = null) => {\n        abortSignal.node = node;\n        throw abortSignal;\n      });\n      if (this.state.errors.length > oldState.errors.length) {\n        const failState = this.state;\n        this.state = oldState;\n        // tokensLength should be preserved during error recovery mode\n        // since the parser does not halt and will instead parse the\n        // remaining tokens\n        this.state.tokensLength = failState.tokensLength;\n        return {\n          node,\n          error: (failState.errors[oldState.errors.length]: SyntaxError),\n          thrown: false,\n          aborted: false,\n          failState,\n        };\n      }\n\n      return {\n        node,\n        error: null,\n        thrown: false,\n        aborted: false,\n        failState: null,\n      };\n    } catch (error) {\n      const failState = this.state;\n      this.state = oldState;\n      if (error instanceof SyntaxError) {\n        return { node: null, error, thrown: true, aborted: false, failState };\n      }\n      if (error === abortSignal) {\n        return {\n          node: abortSignal.node,\n          error: null,\n          thrown: false,\n          aborted: true,\n          failState,\n        };\n      }\n\n      throw error;\n    }\n  }\n\n  checkExpressionErrors(\n    refExpressionErrors: ?ExpressionErrors,\n    andThrow: boolean,\n  ) {\n    if (!refExpressionErrors) return false;\n    const { shorthandAssign, doubleProto } = refExpressionErrors;\n    if (!andThrow) return shorthandAssign >= 0 || doubleProto >= 0;\n    if (shorthandAssign >= 0) {\n      this.unexpected(shorthandAssign);\n    }\n    if (doubleProto >= 0) {\n      this.raise(doubleProto, Errors.DuplicateProto);\n    }\n  }\n\n  /**\n   * Test if current token is a literal property name\n   * https://tc39.es/ecma262/#prod-LiteralPropertyName\n   * LiteralPropertyName:\n   *   IdentifierName\n   *   StringLiteral\n   *   NumericLiteral\n   *   BigIntLiteral\n   */\n  isLiteralPropertyName(): boolean {\n    return (\n      this.match(tt.name) ||\n      !!this.state.type.keyword ||\n      this.match(tt.string) ||\n      this.match(tt.num) ||\n      this.match(tt.bigint) ||\n      this.match(tt.decimal)\n    );\n  }\n\n  /*\n   * Test if given node is a PrivateName\n   * will be overridden in ESTree plugin\n   */\n  isPrivateName(node: Node): boolean {\n    return node.type === \"PrivateName\";\n  }\n\n  /*\n   * Return the string value of a given private name\n   * WITHOUT `#`\n   * @see {@link https://tc39.es/proposal-class-fields/#sec-private-names-static-semantics-stringvalue}\n   */\n  getPrivateNameSV(node: Node): string {\n    return node.id.name;\n  }\n\n  /*\n   * Return whether the given node is a member/optional chain that\n   * contains a private name as its property\n   * It is overridden in ESTree plugin\n   */\n  hasPropertyAsPrivateName(node: Node): boolean {\n    return (\n      (node.type === \"MemberExpression\" ||\n        node.type === \"OptionalMemberExpression\") &&\n      this.isPrivateName(node.property)\n    );\n  }\n\n  isOptionalChain(node: Node): boolean {\n    return (\n      node.type === \"OptionalMemberExpression\" ||\n      node.type === \"OptionalCallExpression\"\n    );\n  }\n\n  isObjectProperty(node: Node): boolean {\n    return node.type === \"ObjectProperty\";\n  }\n\n  isObjectMethod(node: Node): boolean {\n    return node.type === \"ObjectMethod\";\n  }\n\n  initializeScopes(\n    inModule: boolean = this.options.sourceType === \"module\",\n  ): () => void {\n    // Initialize state\n    const oldLabels = this.state.labels;\n    this.state.labels = [];\n\n    const oldExportedIdentifiers = this.exportedIdentifiers;\n    this.exportedIdentifiers = new Set();\n\n    // initialize scopes\n    const oldInModule = this.inModule;\n    this.inModule = inModule;\n\n    const oldScope = this.scope;\n    const ScopeHandler = this.getScopeHandler();\n    this.scope = new ScopeHandler(this.raise.bind(this), this.inModule);\n\n    const oldProdParam = this.prodParam;\n    this.prodParam = new ProductionParameterHandler();\n\n    const oldClassScope = this.classScope;\n    this.classScope = new ClassScopeHandler(this.raise.bind(this));\n\n    const oldExpressionScope = this.expressionScope;\n    this.expressionScope = new ExpressionScopeHandler(this.raise.bind(this));\n\n    return () => {\n      // Revert state\n      this.state.labels = oldLabels;\n      this.exportedIdentifiers = oldExportedIdentifiers;\n\n      // Revert scopes\n      this.inModule = oldInModule;\n      this.scope = oldScope;\n      this.prodParam = oldProdParam;\n      this.classScope = oldClassScope;\n      this.expressionScope = oldExpressionScope;\n    };\n  }\n\n  enterInitialScopes() {\n    let paramFlags = PARAM;\n    if (this.hasPlugin(\"topLevelAwait\") && this.inModule) {\n      paramFlags |= PARAM_AWAIT;\n    }\n    this.scope.enter(SCOPE_PROGRAM);\n    this.prodParam.enter(paramFlags);\n  }\n}\n\n/**\n * The ExpressionErrors is a context struct used to track\n * - **shorthandAssign**: track initializer `=` position when parsing ambiguous\n *   patterns. When we are sure the parsed pattern is a RHS, which means it is\n *   not a pattern, we will throw on this position on invalid assign syntax,\n *   otherwise it will be reset to -1\n * - **doubleProto**: track the duplicate `__proto__` key position when parsing\n *   ambiguous object patterns. When we are sure the parsed pattern is a RHS,\n *   which means it is an object literal, we will throw on this position for\n *   __proto__ redefinition, otherwise it will be reset to -1\n */\nexport class ExpressionErrors {\n  shorthandAssign = -1;\n  doubleProto = -1;\n}\n","// @flow\n\nimport type Parser from \"./index\";\nimport UtilParser from \"./util\";\nimport { SourceLocation, type Position } from \"../util/location\";\nimport type { Comment, Node as NodeType, NodeBase } from \"../types\";\n\n// Start an AST node, attaching a start offset.\n\nclass Node implements NodeBase {\n  constructor(parser: Parser, pos: number, loc: Position) {\n    this.type = \"\";\n    this.start = pos;\n    this.end = 0;\n    this.loc = new SourceLocation(loc);\n    if (parser?.options.ranges) this.range = [pos, 0];\n    if (parser?.filename) this.loc.filename = parser.filename;\n  }\n\n  type: string;\n  start: number;\n  end: number;\n  loc: SourceLocation;\n  range: [number, number];\n  leadingComments: Array<Comment>;\n  trailingComments: Array<Comment>;\n  innerComments: Array<Comment>;\n  extra: { [key: string]: any };\n\n  __clone(): this {\n    // $FlowIgnore\n    const newNode: any = new Node();\n    const keys = Object.keys(this);\n    for (let i = 0, length = keys.length; i < length; i++) {\n      const key = keys[i];\n      // Do not clone comments that are already attached to the node\n      if (\n        key !== \"leadingComments\" &&\n        key !== \"trailingComments\" &&\n        key !== \"innerComments\"\n      ) {\n        // $FlowIgnore\n        newNode[key] = this[key];\n      }\n    }\n\n    return newNode;\n  }\n}\n\nexport class NodeUtils extends UtilParser {\n  startNode<T: NodeType>(): T {\n    // $FlowIgnore\n    return new Node(this, this.state.start, this.state.startLoc);\n  }\n\n  startNodeAt<T: NodeType>(pos: number, loc: Position): T {\n    // $FlowIgnore\n    return new Node(this, pos, loc);\n  }\n\n  /** Start a new node with a previous node's location. */\n  startNodeAtNode<T: NodeType>(type: NodeType): T {\n    return this.startNodeAt(type.start, type.loc.start);\n  }\n\n  // Finish an AST node, adding `type` and `end` properties.\n\n  finishNode<T: NodeType>(node: T, type: string): T {\n    return this.finishNodeAt(\n      node,\n      type,\n      this.state.lastTokEnd,\n      this.state.lastTokEndLoc,\n    );\n  }\n\n  // Finish node at given position\n\n  finishNodeAt<T: NodeType>(\n    node: T,\n    type: string,\n    pos: number,\n    loc: Position,\n  ): T {\n    if (process.env.NODE_ENV !== \"production\" && node.end > 0) {\n      throw new Error(\n        \"Do not call finishNode*() twice on the same node.\" +\n          \" Instead use resetEndLocation() or change type directly.\",\n      );\n    }\n    node.type = type;\n    node.end = pos;\n    node.loc.end = loc;\n    if (this.options.ranges) node.range[1] = pos;\n    this.processComment(node);\n    return node;\n  }\n\n  resetStartLocation(node: NodeBase, start: number, startLoc: Position): void {\n    node.start = start;\n    node.loc.start = startLoc;\n    if (this.options.ranges) node.range[0] = start;\n  }\n\n  resetEndLocation(\n    node: NodeBase,\n    end?: number = this.state.lastTokEnd,\n    endLoc?: Position = this.state.lastTokEndLoc,\n  ): void {\n    node.end = end;\n    node.loc.end = endLoc;\n    if (this.options.ranges) node.range[1] = end;\n  }\n\n  /**\n   * Reset the start location of node to the start location of locationNode\n   */\n  resetStartLocationFromNode(node: NodeBase, locationNode: NodeBase): void {\n    this.resetStartLocation(node, locationNode.start, locationNode.loc.start);\n  }\n}\n","// @flow\n\n/*:: declare var invariant; */\nimport * as charCodes from \"charcodes\";\nimport { types as tt, type TokenType } from \"../tokenizer/types\";\nimport type {\n  TSParameterProperty,\n  Decorator,\n  Expression,\n  Node,\n  Pattern,\n  RestElement,\n  SpreadElement,\n  /*:: Identifier, */\n  /*:: ObjectExpression, */\n  /*:: ObjectPattern, */\n} from \"../types\";\nimport type { Pos, Position } from \"../util/location\";\nimport {\n  isStrictBindOnlyReservedWord,\n  isStrictBindReservedWord,\n} from \"../util/identifier\";\nimport { NodeUtils } from \"./node\";\nimport { type BindingTypes, BIND_NONE } from \"../util/scopeflags\";\nimport { ExpressionErrors } from \"./util\";\nimport { Errors } from \"./error\";\n\nconst unwrapParenthesizedExpression = (node: Node): Node => {\n  return node.type === \"ParenthesizedExpression\"\n    ? unwrapParenthesizedExpression(node.expression)\n    : node;\n};\n\nexport default class LValParser extends NodeUtils {\n  // Forward-declaration: defined in expression.js\n  /*::\n  +parseIdentifier: (liberal?: boolean) => Identifier;\n  +parseMaybeAssignAllowIn: (\n    refExpressionErrors?: ?ExpressionErrors,\n    afterLeftParse?: Function,\n    refNeedsArrowPos?: ?Pos,\n  ) => Expression;\n  +parseObjectLike: <T: ObjectPattern | ObjectExpression>(\n    close: TokenType,\n    isPattern: boolean,\n    isRecord?: ?boolean,\n    refExpressionErrors?: ?ExpressionErrors,\n  ) => T;\n  */\n  // Forward-declaration: defined in statement.js\n  /*::\n  +parseDecorator: () => Decorator;\n  */\n\n  /**\n   * Convert existing expression atom to assignable pattern\n   * if possible. Also checks invalid destructuring targets:\n\n   - Parenthesized Destructuring patterns\n   - RestElement is not the last element\n   - Missing `=` in assignment pattern\n\n   NOTE: There is a corresponding \"isAssignable\" method in flow.js.\n   When this one is updated, please check if also that one needs to be updated.\n\n   * @param {Node} node The expression atom\n   * @param {boolean} [isLHS=false] Whether we are parsing a LeftHandSideExpression. If isLHS is `true`, the following cases are allowed:\n                                    `[(a)] = [0]`, `[(a.b)] = [0]`\n\n   * @returns {Node} The converted assignable pattern\n   * @memberof LValParser\n   */\n  toAssignable(node: Node, isLHS: boolean = false): Node {\n    let parenthesized = undefined;\n    if (node.type === \"ParenthesizedExpression\" || node.extra?.parenthesized) {\n      parenthesized = unwrapParenthesizedExpression(node);\n      if (isLHS) {\n        // an LHS can be reinterpreted to a binding pattern but not vice versa.\n        // therefore a parenthesized identifier is ambiguous until we are sure it is an assignment expression\n        // i.e. `([(a) = []] = []) => {}`\n        // see also `recordParenthesizedIdentifierError` signature in packages/babel-parser/src/util/expression-scope.js\n        if (parenthesized.type === \"Identifier\") {\n          this.expressionScope.recordParenthesizedIdentifierError(\n            node.start,\n            Errors.InvalidParenthesizedAssignment,\n          );\n        } else if (parenthesized.type !== \"MemberExpression\") {\n          // A parenthesized member expression can be in LHS but not in pattern.\n          // If the LHS is later interpreted as a pattern, `checkLVal` will throw for member expression binding\n          // i.e. `([(a.b) = []] = []) => {}`\n          this.raise(node.start, Errors.InvalidParenthesizedAssignment);\n        }\n      } else {\n        this.raise(node.start, Errors.InvalidParenthesizedAssignment);\n      }\n    }\n\n    switch (node.type) {\n      case \"Identifier\":\n      case \"ObjectPattern\":\n      case \"ArrayPattern\":\n      case \"AssignmentPattern\":\n        break;\n\n      case \"ObjectExpression\":\n        node.type = \"ObjectPattern\";\n        for (\n          let i = 0, length = node.properties.length, last = length - 1;\n          i < length;\n          i++\n        ) {\n          const prop = node.properties[i];\n          const isLast = i === last;\n          this.toAssignableObjectExpressionProp(prop, isLast, isLHS);\n\n          if (\n            isLast &&\n            prop.type === \"RestElement\" &&\n            node.extra?.trailingComma\n          ) {\n            this.raiseRestNotLast(node.extra.trailingComma);\n          }\n        }\n        break;\n\n      case \"ObjectProperty\":\n        this.toAssignable(node.value, isLHS);\n        break;\n\n      case \"SpreadElement\": {\n        this.checkToRestConversion(node);\n\n        node.type = \"RestElement\";\n        const arg = node.argument;\n        this.toAssignable(arg, isLHS);\n        break;\n      }\n\n      case \"ArrayExpression\":\n        node.type = \"ArrayPattern\";\n        this.toAssignableList(node.elements, node.extra?.trailingComma, isLHS);\n        break;\n\n      case \"AssignmentExpression\":\n        if (node.operator !== \"=\") {\n          this.raise(node.left.end, Errors.MissingEqInAssignment);\n        }\n\n        node.type = \"AssignmentPattern\";\n        delete node.operator;\n        this.toAssignable(node.left, isLHS);\n        break;\n\n      case \"ParenthesizedExpression\":\n        /*::invariant (parenthesized !== undefined) */\n        this.toAssignable(parenthesized, isLHS);\n        break;\n\n      default:\n      // We don't know how to deal with this node. It will\n      // be reported by a later call to checkLVal\n    }\n    return node;\n  }\n\n  toAssignableObjectExpressionProp(\n    prop: Node,\n    isLast: boolean,\n    isLHS: boolean,\n  ) {\n    if (prop.type === \"ObjectMethod\") {\n      const error =\n        prop.kind === \"get\" || prop.kind === \"set\"\n          ? Errors.PatternHasAccessor\n          : Errors.PatternHasMethod;\n\n      /* eslint-disable @babel/development-internal/dry-error-messages */\n      this.raise(prop.key.start, error);\n      /* eslint-enable @babel/development-internal/dry-error-messages */\n    } else if (prop.type === \"SpreadElement\" && !isLast) {\n      this.raiseRestNotLast(prop.start);\n    } else {\n      this.toAssignable(prop, isLHS);\n    }\n  }\n\n  // Convert list of expression atoms to binding list.\n\n  toAssignableList(\n    exprList: Expression[],\n    trailingCommaPos?: ?number,\n    isLHS: boolean,\n  ): $ReadOnlyArray<Pattern> {\n    let end = exprList.length;\n    if (end) {\n      const last = exprList[end - 1];\n      if (last?.type === \"RestElement\") {\n        --end;\n      } else if (last?.type === \"SpreadElement\") {\n        last.type = \"RestElement\";\n        let arg = last.argument;\n        this.toAssignable(arg, isLHS);\n        arg = unwrapParenthesizedExpression(arg);\n        if (\n          arg.type !== \"Identifier\" &&\n          arg.type !== \"MemberExpression\" &&\n          arg.type !== \"ArrayPattern\" &&\n          arg.type !== \"ObjectPattern\"\n        ) {\n          this.unexpected(arg.start);\n        }\n\n        if (trailingCommaPos) {\n          this.raiseTrailingCommaAfterRest(trailingCommaPos);\n        }\n\n        --end;\n      }\n    }\n    for (let i = 0; i < end; i++) {\n      const elt = exprList[i];\n      if (elt) {\n        this.toAssignable(elt, isLHS);\n        if (elt.type === \"RestElement\") {\n          this.raiseRestNotLast(elt.start);\n        }\n      }\n    }\n    return exprList;\n  }\n\n  // Convert list of expression atoms to a list of\n\n  toReferencedList(\n    exprList: $ReadOnlyArray<?Expression>,\n    isParenthesizedExpr?: boolean, // eslint-disable-line no-unused-vars\n  ): $ReadOnlyArray<?Expression> {\n    return exprList;\n  }\n\n  toReferencedListDeep(\n    exprList: $ReadOnlyArray<?Expression>,\n    isParenthesizedExpr?: boolean,\n  ): void {\n    this.toReferencedList(exprList, isParenthesizedExpr);\n\n    for (const expr of exprList) {\n      if (expr?.type === \"ArrayExpression\") {\n        this.toReferencedListDeep(expr.elements);\n      }\n    }\n  }\n\n  // Parses spread element.\n\n  parseSpread(\n    refExpressionErrors: ?ExpressionErrors,\n    refNeedsArrowPos?: ?Pos,\n  ): SpreadElement {\n    const node = this.startNode();\n    this.next();\n    node.argument = this.parseMaybeAssignAllowIn(\n      refExpressionErrors,\n      undefined,\n      refNeedsArrowPos,\n    );\n    return this.finishNode(node, \"SpreadElement\");\n  }\n\n  // https://tc39.es/ecma262/#prod-BindingRestProperty\n  // https://tc39.es/ecma262/#prod-BindingRestElement\n  parseRestBinding(): RestElement {\n    const node = this.startNode();\n    this.next(); // eat `...`\n    node.argument = this.parseBindingAtom();\n    return this.finishNode(node, \"RestElement\");\n  }\n\n  // Parses lvalue (assignable) atom.\n  parseBindingAtom(): Pattern {\n    // https://tc39.es/ecma262/#prod-BindingPattern\n    switch (this.state.type) {\n      case tt.bracketL: {\n        const node = this.startNode();\n        this.next();\n        node.elements = this.parseBindingList(\n          tt.bracketR,\n          charCodes.rightSquareBracket,\n          true,\n        );\n        return this.finishNode(node, \"ArrayPattern\");\n      }\n\n      case tt.braceL:\n        return this.parseObjectLike(tt.braceR, true);\n    }\n\n    // https://tc39.es/ecma262/#prod-BindingIdentifier\n    return this.parseIdentifier();\n  }\n\n  // https://tc39.es/ecma262/#prod-BindingElementList\n  parseBindingList(\n    close: TokenType,\n    closeCharCode: $Values<typeof charCodes>,\n    allowEmpty?: boolean,\n    allowModifiers?: boolean,\n  ): $ReadOnlyArray<Pattern | TSParameterProperty> {\n    const elts: Array<Pattern | TSParameterProperty> = [];\n    let first = true;\n    while (!this.eat(close)) {\n      if (first) {\n        first = false;\n      } else {\n        this.expect(tt.comma);\n      }\n      if (allowEmpty && this.match(tt.comma)) {\n        // $FlowFixMe This method returns `$ReadOnlyArray<?Pattern>` if `allowEmpty` is set.\n        elts.push(null);\n      } else if (this.eat(close)) {\n        break;\n      } else if (this.match(tt.ellipsis)) {\n        elts.push(this.parseAssignableListItemTypes(this.parseRestBinding()));\n        this.checkCommaAfterRest(closeCharCode);\n        this.expect(close);\n        break;\n      } else {\n        const decorators = [];\n        if (this.match(tt.at) && this.hasPlugin(\"decorators\")) {\n          this.raise(this.state.start, Errors.UnsupportedParameterDecorator);\n        }\n        // invariant: hasPlugin(\"decorators-legacy\")\n        while (this.match(tt.at)) {\n          decorators.push(this.parseDecorator());\n        }\n        elts.push(this.parseAssignableListItem(allowModifiers, decorators));\n      }\n    }\n    return elts;\n  }\n\n  parseAssignableListItem(\n    allowModifiers: ?boolean,\n    decorators: Decorator[],\n  ): Pattern | TSParameterProperty {\n    const left = this.parseMaybeDefault();\n    this.parseAssignableListItemTypes(left);\n    const elt = this.parseMaybeDefault(left.start, left.loc.start, left);\n    if (decorators.length) {\n      left.decorators = decorators;\n    }\n    return elt;\n  }\n\n  // Used by flow/typescript plugin to add type annotations to binding elements\n  parseAssignableListItemTypes(param: Pattern): Pattern {\n    return param;\n  }\n\n  // Parses assignment pattern around given atom if possible.\n  // https://tc39.es/ecma262/#prod-BindingElement\n  parseMaybeDefault(\n    startPos?: ?number,\n    startLoc?: ?Position,\n    left?: ?Pattern,\n  ): Pattern {\n    startLoc = startLoc ?? this.state.startLoc;\n    startPos = startPos ?? this.state.start;\n    // $FlowIgnore\n    left = left ?? this.parseBindingAtom();\n    if (!this.eat(tt.eq)) return left;\n\n    const node = this.startNodeAt(startPos, startLoc);\n    node.left = left;\n    node.right = this.parseMaybeAssignAllowIn();\n    return this.finishNode(node, \"AssignmentPattern\");\n  }\n\n  /**\n   * Verify that if a node is an lval - something that can be assigned to.\n   *\n   * @param {Expression} expr The given node\n   * @param {string} contextDescription The auxiliary context information printed when error is thrown\n   * @param {BindingTypes} [bindingType=BIND_NONE] The desired binding type. If the given node is an identifier and `bindingType` is not\n                                                   BIND_NONE, `checkLVal` will register binding to the parser scope\n                                                   See also src/util/scopeflags.js\n   * @param {?Set<string>} checkClashes An optional string set to check if an identifier name is included. `checkLVal` will add checked\n                                        identifier name to `checkClashes` It is used in tracking duplicates in function parameter lists. If\n                                        it is nullish, `checkLVal` will skip duplicate checks\n   * @param {boolean} [disallowLetBinding] Whether an identifier named \"let\" should be disallowed\n   * @param {boolean} [strictModeChanged=false] Whether an identifier has been parsed in a sloppy context but should be reinterpreted as\n                                                strict-mode. e.g. `(arguments) => { \"use strict \"}`\n   * @memberof LValParser\n   */\n  checkLVal(\n    expr: Expression,\n    contextDescription: string,\n    bindingType: BindingTypes = BIND_NONE,\n    checkClashes: ?Set<string>,\n    disallowLetBinding?: boolean,\n    strictModeChanged?: boolean = false,\n  ): void {\n    switch (expr.type) {\n      case \"Identifier\": {\n        const { name } = expr;\n        if (\n          this.state.strict &&\n          // \"Global\" reserved words have already been checked by parseIdentifier,\n          // unless they have been found in the id or parameters of a strict-mode\n          // function in a sloppy context.\n          (strictModeChanged\n            ? isStrictBindReservedWord(name, this.inModule)\n            : isStrictBindOnlyReservedWord(name))\n        ) {\n          this.raise(\n            expr.start,\n            bindingType === BIND_NONE\n              ? Errors.StrictEvalArguments\n              : Errors.StrictEvalArgumentsBinding,\n            name,\n          );\n        }\n\n        if (checkClashes) {\n          if (checkClashes.has(name)) {\n            this.raise(expr.start, Errors.ParamDupe);\n          } else {\n            checkClashes.add(name);\n          }\n        }\n        if (disallowLetBinding && name === \"let\") {\n          this.raise(expr.start, Errors.LetInLexicalBinding);\n        }\n        if (!(bindingType & BIND_NONE)) {\n          this.scope.declareName(name, bindingType, expr.start);\n        }\n        break;\n      }\n\n      case \"MemberExpression\":\n        if (bindingType !== BIND_NONE) {\n          this.raise(expr.start, Errors.InvalidPropertyBindingPattern);\n        }\n        break;\n\n      case \"ObjectPattern\":\n        for (let prop of expr.properties) {\n          if (this.isObjectProperty(prop)) prop = prop.value;\n          // If we find here an ObjectMethod, it's because this was originally\n          // an ObjectExpression which has then been converted.\n          // toAssignable already reported this error with a nicer message.\n          else if (this.isObjectMethod(prop)) continue;\n\n          this.checkLVal(\n            prop,\n            \"object destructuring pattern\",\n            bindingType,\n            checkClashes,\n            disallowLetBinding,\n          );\n        }\n        break;\n\n      case \"ArrayPattern\":\n        for (const elem of expr.elements) {\n          if (elem) {\n            this.checkLVal(\n              elem,\n              \"array destructuring pattern\",\n              bindingType,\n              checkClashes,\n              disallowLetBinding,\n            );\n          }\n        }\n        break;\n\n      case \"AssignmentPattern\":\n        this.checkLVal(\n          expr.left,\n          \"assignment pattern\",\n          bindingType,\n          checkClashes,\n        );\n        break;\n\n      case \"RestElement\":\n        this.checkLVal(\n          expr.argument,\n          \"rest element\",\n          bindingType,\n          checkClashes,\n        );\n        break;\n\n      case \"ParenthesizedExpression\":\n        this.checkLVal(\n          expr.expression,\n          \"parenthesized expression\",\n          bindingType,\n          checkClashes,\n        );\n        break;\n\n      default: {\n        this.raise(\n          expr.start,\n          bindingType === BIND_NONE\n            ? Errors.InvalidLhs\n            : Errors.InvalidLhsBinding,\n          contextDescription,\n        );\n      }\n    }\n  }\n\n  checkToRestConversion(node: SpreadElement): void {\n    if (\n      node.argument.type !== \"Identifier\" &&\n      node.argument.type !== \"MemberExpression\"\n    ) {\n      this.raise(node.argument.start, Errors.InvalidRestAssignmentPattern);\n    }\n  }\n\n  checkCommaAfterRest(close: $Values<typeof charCodes>): void {\n    if (this.match(tt.comma)) {\n      if (this.lookaheadCharCode() === close) {\n        this.raiseTrailingCommaAfterRest(this.state.start);\n      } else {\n        this.raiseRestNotLast(this.state.start);\n      }\n    }\n  }\n\n  raiseRestNotLast(pos: number) {\n    throw this.raise(pos, Errors.ElementAfterRest);\n  }\n\n  raiseTrailingCommaAfterRest(pos: number) {\n    this.raise(pos, Errors.RestTrailingComma);\n  }\n}\n","// @flow\n\nimport * as N from \"../types\";\nimport { types as tt, type TokenType } from \"../tokenizer/types\";\nimport ExpressionParser from \"./expression\";\nimport { Errors, SourceTypeModuleErrors } from \"./error\";\nimport { isIdentifierChar, isIdentifierStart } from \"../util/identifier\";\nimport { lineBreak } from \"../util/whitespace\";\nimport * as charCodes from \"charcodes\";\nimport {\n  BIND_CLASS,\n  BIND_LEXICAL,\n  BIND_VAR,\n  BIND_FUNCTION,\n  SCOPE_CLASS,\n  SCOPE_FUNCTION,\n  SCOPE_OTHER,\n  SCOPE_SIMPLE_CATCH,\n  SCOPE_STATIC_BLOCK,\n  SCOPE_SUPER,\n  CLASS_ELEMENT_OTHER,\n  CLASS_ELEMENT_INSTANCE_GETTER,\n  CLASS_ELEMENT_INSTANCE_SETTER,\n  CLASS_ELEMENT_STATIC_GETTER,\n  CLASS_ELEMENT_STATIC_SETTER,\n  type BindingTypes,\n} from \"../util/scopeflags\";\nimport { ExpressionErrors } from \"./util\";\nimport { PARAM, functionFlags } from \"../util/production-parameter\";\nimport {\n  newExpressionScope,\n  newParameterDeclarationScope,\n} from \"../util/expression-scope\";\nimport type { SourceType } from \"../options\";\nimport { Token } from \"../tokenizer\";\nimport { Position } from \"../util/location\";\n\nconst loopLabel = { kind: \"loop\" },\n  switchLabel = { kind: \"switch\" };\n\nconst FUNC_NO_FLAGS = 0b000,\n  FUNC_STATEMENT = 0b001,\n  FUNC_HANGING_STATEMENT = 0b010,\n  FUNC_NULLABLE_ID = 0b100;\n\nconst loneSurrogate = /[\\uD800-\\uDFFF]/u;\n\nconst keywordRelationalOperator = /in(?:stanceof)?/y;\n\n/**\n * Convert tt.privateName to tt.hash + tt.name for backward Babel 7 compat.\n * For performance reasons this routine mutates `tokens`, it is okay\n * here since we execute `parseTopLevel` once for every file.\n * @param {*} tokens\n * @returns\n */\nfunction babel7CompatTokens(tokens) {\n  if (!process.env.BABEL_8_BREAKING) {\n    for (let i = 0; i < tokens.length; i++) {\n      const token = tokens[i];\n      if (token.type === tt.privateName) {\n        const { loc, start, value, end } = token;\n        const hashEndPos = start + 1;\n        const hashEndLoc = new Position(loc.start.line, loc.start.column + 1);\n        tokens.splice(\n          i,\n          1,\n          // $FlowIgnore: hacky way to create token\n          new Token({\n            type: tt.hash,\n            value: \"#\",\n            start: start,\n            end: hashEndPos,\n            startLoc: loc.start,\n            endLoc: hashEndLoc,\n          }),\n          // $FlowIgnore: hacky way to create token\n          new Token({\n            type: tt.name,\n            value: value,\n            start: hashEndPos,\n            end: end,\n            startLoc: hashEndLoc,\n            endLoc: loc.end,\n          }),\n        );\n      }\n    }\n  }\n  return tokens;\n}\nexport default class StatementParser extends ExpressionParser {\n  // ### Statement parsing\n\n  // Parse a program. Initializes the parser, reads any number of\n  // statements, and wraps them in a Program node.  Optionally takes a\n  // `program` argument.  If present, the statements will be appended\n  // to its body instead of creating a new node.\n\n  parseTopLevel(file: N.File, program: N.Program): N.File {\n    file.program = this.parseProgram(program);\n    file.comments = this.state.comments;\n\n    if (this.options.tokens) file.tokens = babel7CompatTokens(this.tokens);\n\n    return this.finishNode(file, \"File\");\n  }\n\n  parseProgram(\n    program: N.Program,\n    end: TokenType = tt.eof,\n    sourceType: SourceType = this.options.sourceType,\n  ): N.Program {\n    program.sourceType = sourceType;\n    program.interpreter = this.parseInterpreterDirective();\n    this.parseBlockBody(program, true, true, end);\n    if (\n      this.inModule &&\n      !this.options.allowUndeclaredExports &&\n      this.scope.undefinedExports.size > 0\n    ) {\n      for (const [name] of Array.from(this.scope.undefinedExports)) {\n        const pos = this.scope.undefinedExports.get(name);\n        // $FlowIssue\n        this.raise(pos, Errors.ModuleExportUndefined, name);\n      }\n    }\n    return this.finishNode<N.Program>(program, \"Program\");\n  }\n\n  // TODO\n\n  stmtToDirective(stmt: N.Statement): N.Directive {\n    const expr = stmt.expression;\n\n    const directiveLiteral = this.startNodeAt(expr.start, expr.loc.start);\n    const directive = this.startNodeAt(stmt.start, stmt.loc.start);\n\n    const raw = this.input.slice(expr.start, expr.end);\n    const val = (directiveLiteral.value = raw.slice(1, -1)); // remove quotes\n\n    this.addExtra(directiveLiteral, \"raw\", raw);\n    this.addExtra(directiveLiteral, \"rawValue\", val);\n\n    directive.value = this.finishNodeAt(\n      directiveLiteral,\n      \"DirectiveLiteral\",\n      expr.end,\n      expr.loc.end,\n    );\n\n    return this.finishNodeAt(directive, \"Directive\", stmt.end, stmt.loc.end);\n  }\n\n  parseInterpreterDirective(): N.InterpreterDirective | null {\n    if (!this.match(tt.interpreterDirective)) {\n      return null;\n    }\n\n    const node = this.startNode();\n    node.value = this.state.value;\n    this.next();\n    return this.finishNode(node, \"InterpreterDirective\");\n  }\n\n  isLet(context: ?string): boolean {\n    if (!this.isContextual(\"let\")) {\n      return false;\n    }\n    return this.isLetKeyword(context);\n  }\n\n  /**\n   * Assuming we have seen a contextual `let`, check if it starts a variable declaration\n   so that `left` should be interpreted as a `let` keyword.\n   *\n   * @param {?string} context When `context` is non nullish, it will return early and _skip_ checking\n                              if the next token after `let` is `{` or a keyword relational operator\n   * @returns {boolean}\n   * @memberof StatementParser\n   */\n  isLetKeyword(context: ?string): boolean {\n    const next = this.nextTokenStart();\n    const nextCh = this.codePointAtPos(next);\n    // For ambiguous cases, determine if a LexicalDeclaration (or only a\n    // Statement) is allowed here. If context is not empty then only a Statement\n    // is allowed. However, `let [` is an explicit negative lookahead for\n    // ExpressionStatement, so special-case it first.\n    // Also, `let \\` is never valid as an expression so this must be a keyword.\n    if (\n      nextCh === charCodes.backslash ||\n      nextCh === charCodes.leftSquareBracket\n    ) {\n      return true;\n    }\n    if (context) return false;\n\n    if (nextCh === charCodes.leftCurlyBrace) return true;\n\n    if (isIdentifierStart(nextCh)) {\n      keywordRelationalOperator.lastIndex = next;\n      const matched = keywordRelationalOperator.exec(this.input);\n      if (matched !== null) {\n        // We have seen `in` or `instanceof` so far, now check if the identfier\n        // ends here\n        const endCh = this.codePointAtPos(next + matched[0].length);\n        if (!isIdentifierChar(endCh) && endCh !== charCodes.backslash) {\n          return false;\n        }\n      }\n      return true;\n    }\n    return false;\n  }\n\n  // Parse a single statement.\n  //\n  // If expecting a statement and finding a slash operator, parse a\n  // regular expression literal. This is to handle cases like\n  // `if (foo) /blah/.exec(foo)`, where looking at the previous token\n  // does not help.\n  // https://tc39.es/ecma262/#prod-Statement\n  // ImportDeclaration and ExportDeclaration are also handled here so we can throw recoverable errors\n  // when they are not at the top level\n  parseStatement(context: ?string, topLevel?: boolean): N.Statement {\n    if (this.match(tt.at)) {\n      this.parseDecorators(true);\n    }\n    return this.parseStatementContent(context, topLevel);\n  }\n\n  parseStatementContent(context: ?string, topLevel: ?boolean): N.Statement {\n    let starttype = this.state.type;\n    const node = this.startNode();\n    let kind;\n\n    if (this.isLet(context)) {\n      starttype = tt._var;\n      kind = \"let\";\n    }\n\n    // Most types of statements are recognized by the keyword they\n    // start with. Many are trivial to parse, some require a bit of\n    // complexity.\n\n    switch (starttype) {\n      case tt._break:\n      case tt._continue:\n        // $FlowFixMe\n        return this.parseBreakContinueStatement(node, starttype.keyword);\n      case tt._debugger:\n        return this.parseDebuggerStatement(node);\n      case tt._do:\n        return this.parseDoStatement(node);\n      case tt._for:\n        return this.parseForStatement(node);\n      case tt._function:\n        if (this.lookaheadCharCode() === charCodes.dot) break;\n        if (context) {\n          if (this.state.strict) {\n            this.raise(this.state.start, Errors.StrictFunction);\n          } else if (context !== \"if\" && context !== \"label\") {\n            this.raise(this.state.start, Errors.SloppyFunction);\n          }\n        }\n        return this.parseFunctionStatement(node, false, !context);\n\n      case tt._class:\n        if (context) this.unexpected();\n        return this.parseClass(node, true);\n\n      case tt._if:\n        return this.parseIfStatement(node);\n      case tt._return:\n        return this.parseReturnStatement(node);\n      case tt._switch:\n        return this.parseSwitchStatement(node);\n      case tt._throw:\n        return this.parseThrowStatement(node);\n      case tt._try:\n        return this.parseTryStatement(node);\n\n      case tt._const:\n      case tt._var:\n        kind = kind || this.state.value;\n        if (context && kind !== \"var\") {\n          this.raise(this.state.start, Errors.UnexpectedLexicalDeclaration);\n        }\n        return this.parseVarStatement(node, kind);\n\n      case tt._while:\n        return this.parseWhileStatement(node);\n      case tt._with:\n        return this.parseWithStatement(node);\n      case tt.braceL:\n        return this.parseBlock();\n      case tt.semi:\n        return this.parseEmptyStatement(node);\n      case tt._import: {\n        const nextTokenCharCode = this.lookaheadCharCode();\n        if (\n          nextTokenCharCode === charCodes.leftParenthesis || // import()\n          nextTokenCharCode === charCodes.dot // import.meta\n        ) {\n          break;\n        }\n      }\n      // fall through\n      case tt._export: {\n        if (!this.options.allowImportExportEverywhere && !topLevel) {\n          this.raise(this.state.start, Errors.UnexpectedImportExport);\n        }\n\n        this.next(); // eat `import`/`export`\n\n        let result;\n        if (starttype === tt._import) {\n          result = this.parseImport(node);\n\n          if (\n            result.type === \"ImportDeclaration\" &&\n            (!result.importKind || result.importKind === \"value\")\n          ) {\n            this.sawUnambiguousESM = true;\n          }\n        } else {\n          result = this.parseExport(node);\n\n          if (\n            (result.type === \"ExportNamedDeclaration\" &&\n              (!result.exportKind || result.exportKind === \"value\")) ||\n            (result.type === \"ExportAllDeclaration\" &&\n              (!result.exportKind || result.exportKind === \"value\")) ||\n            result.type === \"ExportDefaultDeclaration\"\n          ) {\n            this.sawUnambiguousESM = true;\n          }\n        }\n\n        this.assertModuleNodeAllowed(node);\n\n        return result;\n      }\n\n      default: {\n        if (this.isAsyncFunction()) {\n          if (context) {\n            this.raise(\n              this.state.start,\n              Errors.AsyncFunctionInSingleStatementContext,\n            );\n          }\n          this.next();\n          return this.parseFunctionStatement(node, true, !context);\n        }\n      }\n    }\n\n    // If the statement does not start with a statement keyword or a\n    // brace, it's an ExpressionStatement or LabeledStatement. We\n    // simply start parsing an expression, and afterwards, if the\n    // next token is a colon and the expression was a simple\n    // Identifier node, we switch to interpreting it as a label.\n    const maybeName = this.state.value;\n    const expr = this.parseExpression();\n\n    if (\n      starttype === tt.name &&\n      expr.type === \"Identifier\" &&\n      this.eat(tt.colon)\n    ) {\n      return this.parseLabeledStatement(node, maybeName, expr, context);\n    } else {\n      return this.parseExpressionStatement(node, expr);\n    }\n  }\n\n  assertModuleNodeAllowed(node: N.Node): void {\n    if (!this.options.allowImportExportEverywhere && !this.inModule) {\n      this.raise(node.start, SourceTypeModuleErrors.ImportOutsideModule);\n    }\n  }\n\n  takeDecorators(node: N.HasDecorators): void {\n    const decorators =\n      this.state.decoratorStack[this.state.decoratorStack.length - 1];\n    if (decorators.length) {\n      node.decorators = decorators;\n      this.resetStartLocationFromNode(node, decorators[0]);\n      this.state.decoratorStack[this.state.decoratorStack.length - 1] = [];\n    }\n  }\n\n  canHaveLeadingDecorator(): boolean {\n    return this.match(tt._class);\n  }\n\n  parseDecorators(allowExport?: boolean): void {\n    const currentContextDecorators =\n      this.state.decoratorStack[this.state.decoratorStack.length - 1];\n    while (this.match(tt.at)) {\n      const decorator = this.parseDecorator();\n      currentContextDecorators.push(decorator);\n    }\n\n    if (this.match(tt._export)) {\n      if (!allowExport) {\n        this.unexpected();\n      }\n\n      if (\n        this.hasPlugin(\"decorators\") &&\n        !this.getPluginOption(\"decorators\", \"decoratorsBeforeExport\")\n      ) {\n        this.raise(this.state.start, Errors.DecoratorExportClass);\n      }\n    } else if (!this.canHaveLeadingDecorator()) {\n      throw this.raise(this.state.start, Errors.UnexpectedLeadingDecorator);\n    }\n  }\n\n  parseDecorator(): N.Decorator {\n    this.expectOnePlugin([\"decorators-legacy\", \"decorators\"]);\n\n    const node = this.startNode();\n    this.next();\n\n    if (this.hasPlugin(\"decorators\")) {\n      // Every time a decorator class expression is evaluated, a new empty array is pushed onto the stack\n      // So that the decorators of any nested class expressions will be dealt with separately\n      this.state.decoratorStack.push([]);\n\n      const startPos = this.state.start;\n      const startLoc = this.state.startLoc;\n      let expr: N.Expression;\n\n      if (this.eat(tt.parenL)) {\n        expr = this.parseExpression();\n        this.expect(tt.parenR);\n      } else {\n        expr = this.parseIdentifier(false);\n\n        while (this.eat(tt.dot)) {\n          const node = this.startNodeAt(startPos, startLoc);\n          node.object = expr;\n          node.property = this.parseIdentifier(true);\n          node.computed = false;\n          expr = this.finishNode(node, \"MemberExpression\");\n        }\n      }\n\n      node.expression = this.parseMaybeDecoratorArguments(expr);\n      this.state.decoratorStack.pop();\n    } else {\n      node.expression = this.parseExprSubscripts();\n    }\n    return this.finishNode(node, \"Decorator\");\n  }\n\n  parseMaybeDecoratorArguments(expr: N.Expression): N.Expression {\n    if (this.eat(tt.parenL)) {\n      const node = this.startNodeAtNode(expr);\n      node.callee = expr;\n      node.arguments = this.parseCallExpressionArguments(tt.parenR, false);\n      this.toReferencedList(node.arguments);\n      return this.finishNode(node, \"CallExpression\");\n    }\n\n    return expr;\n  }\n\n  parseBreakContinueStatement(\n    node: N.BreakStatement | N.ContinueStatement,\n    keyword: string,\n  ): N.BreakStatement | N.ContinueStatement {\n    const isBreak = keyword === \"break\";\n    this.next();\n\n    if (this.isLineTerminator()) {\n      node.label = null;\n    } else {\n      node.label = this.parseIdentifier();\n      this.semicolon();\n    }\n\n    this.verifyBreakContinue(node, keyword);\n\n    return this.finishNode(\n      node,\n      isBreak ? \"BreakStatement\" : \"ContinueStatement\",\n    );\n  }\n\n  verifyBreakContinue(\n    node: N.BreakStatement | N.ContinueStatement,\n    keyword: string,\n  ) {\n    const isBreak = keyword === \"break\";\n    let i;\n    for (i = 0; i < this.state.labels.length; ++i) {\n      const lab = this.state.labels[i];\n      if (node.label == null || lab.name === node.label.name) {\n        if (lab.kind != null && (isBreak || lab.kind === \"loop\")) break;\n        if (node.label && isBreak) break;\n      }\n    }\n    if (i === this.state.labels.length) {\n      this.raise(node.start, Errors.IllegalBreakContinue, keyword);\n    }\n  }\n\n  parseDebuggerStatement(node: N.DebuggerStatement): N.DebuggerStatement {\n    this.next();\n    this.semicolon();\n    return this.finishNode(node, \"DebuggerStatement\");\n  }\n\n  parseHeaderExpression(): N.Expression {\n    this.expect(tt.parenL);\n    const val = this.parseExpression();\n    this.expect(tt.parenR);\n    return val;\n  }\n\n  parseDoStatement(node: N.DoWhileStatement): N.DoWhileStatement {\n    this.next();\n    this.state.labels.push(loopLabel);\n\n    node.body =\n      // For the smartPipelines plugin: Disable topic references from outer\n      // contexts within the loop body. They are permitted in test expressions,\n      // outside of the loop body.\n      this.withTopicForbiddingContext(() =>\n        // Parse the loop body's body.\n        this.parseStatement(\"do\"),\n      );\n\n    this.state.labels.pop();\n\n    this.expect(tt._while);\n    node.test = this.parseHeaderExpression();\n    this.eat(tt.semi);\n    return this.finishNode(node, \"DoWhileStatement\");\n  }\n\n  // Disambiguating between a `for` and a `for`/`in` or `for`/`of`\n  // loop is non-trivial. Basically, we have to parse the init `var`\n  // statement or expression, disallowing the `in` operator (see\n  // the second parameter to `parseExpression`), and then check\n  // whether the next token is `in` or `of`. When there is no init\n  // part (semicolon immediately after the opening parenthesis), it\n  // is a regular `for` loop.\n\n  parseForStatement(node: N.Node): N.ForLike {\n    this.next();\n    this.state.labels.push(loopLabel);\n\n    let awaitAt = -1;\n    if (this.isAwaitAllowed() && this.eatContextual(\"await\")) {\n      awaitAt = this.state.lastTokStart;\n    }\n    this.scope.enter(SCOPE_OTHER);\n    this.expect(tt.parenL);\n\n    if (this.match(tt.semi)) {\n      if (awaitAt > -1) {\n        this.unexpected(awaitAt);\n      }\n      return this.parseFor(node, null);\n    }\n\n    const startsWithLet = this.isContextual(\"let\");\n    const isLet = startsWithLet && this.isLetKeyword();\n    if (this.match(tt._var) || this.match(tt._const) || isLet) {\n      const init = this.startNode();\n      const kind = isLet ? \"let\" : this.state.value;\n      this.next();\n      this.parseVar(init, true, kind);\n      this.finishNode(init, \"VariableDeclaration\");\n\n      if (\n        (this.match(tt._in) || this.isContextual(\"of\")) &&\n        init.declarations.length === 1\n      ) {\n        return this.parseForIn(node, init, awaitAt);\n      }\n      if (awaitAt > -1) {\n        this.unexpected(awaitAt);\n      }\n      return this.parseFor(node, init);\n    }\n\n    // Check whether the first token is possibly a contextual keyword, so that\n    // we can forbid `for (async of` if this turns out to be a for-of loop.\n    const startsWithUnescapedName =\n      this.match(tt.name) && !this.state.containsEsc;\n\n    const refExpressionErrors = new ExpressionErrors();\n    const init = this.parseExpression(true, refExpressionErrors);\n    const isForOf = this.isContextual(\"of\");\n    if (isForOf) {\n      // Check for leading tokens that are forbidden in for-of loops:\n      if (startsWithLet) {\n        this.raise(init.start, Errors.ForOfLet);\n      } else if (\n        // `for await (async of []);` is allowed.\n        awaitAt === -1 &&\n        startsWithUnescapedName &&\n        init.type === \"Identifier\" &&\n        init.name === \"async\"\n      ) {\n        // This catches the case where the `async` in `for (async of` was\n        // parsed as an identifier. If it was parsed as the start of an async\n        // arrow function (e.g. `for (async of => {} of []);`), the LVal check\n        // further down will raise a more appropriate error.\n        this.raise(init.start, Errors.ForOfAsync);\n      }\n    }\n    if (isForOf || this.match(tt._in)) {\n      this.toAssignable(init, /* isLHS */ true);\n      const description = isForOf ? \"for-of statement\" : \"for-in statement\";\n      this.checkLVal(init, description);\n      return this.parseForIn(node, init, awaitAt);\n    } else {\n      this.checkExpressionErrors(refExpressionErrors, true);\n    }\n    if (awaitAt > -1) {\n      this.unexpected(awaitAt);\n    }\n    return this.parseFor(node, init);\n  }\n\n  parseFunctionStatement(\n    node: N.FunctionDeclaration,\n    isAsync?: boolean,\n    declarationPosition?: boolean,\n  ): N.FunctionDeclaration {\n    this.next();\n    return this.parseFunction(\n      node,\n      FUNC_STATEMENT | (declarationPosition ? 0 : FUNC_HANGING_STATEMENT),\n      isAsync,\n    );\n  }\n\n  parseIfStatement(node: N.IfStatement): N.IfStatement {\n    this.next();\n    node.test = this.parseHeaderExpression();\n    node.consequent = this.parseStatement(\"if\");\n    node.alternate = this.eat(tt._else) ? this.parseStatement(\"if\") : null;\n    return this.finishNode(node, \"IfStatement\");\n  }\n\n  parseReturnStatement(node: N.ReturnStatement): N.ReturnStatement {\n    if (!this.prodParam.hasReturn && !this.options.allowReturnOutsideFunction) {\n      this.raise(this.state.start, Errors.IllegalReturn);\n    }\n\n    this.next();\n\n    // In `return` (and `break`/`continue`), the keywords with\n    // optional arguments, we eagerly look for a semicolon or the\n    // possibility to insert one.\n\n    if (this.isLineTerminator()) {\n      node.argument = null;\n    } else {\n      node.argument = this.parseExpression();\n      this.semicolon();\n    }\n\n    return this.finishNode(node, \"ReturnStatement\");\n  }\n\n  parseSwitchStatement(node: N.SwitchStatement): N.SwitchStatement {\n    this.next();\n    node.discriminant = this.parseHeaderExpression();\n    const cases = (node.cases = []);\n    this.expect(tt.braceL);\n    this.state.labels.push(switchLabel);\n    this.scope.enter(SCOPE_OTHER);\n\n    // Statements under must be grouped (by label) in SwitchCase\n    // nodes. `cur` is used to keep the node that we are currently\n    // adding statements to.\n\n    let cur;\n    for (let sawDefault; !this.match(tt.braceR); ) {\n      if (this.match(tt._case) || this.match(tt._default)) {\n        const isCase = this.match(tt._case);\n        if (cur) this.finishNode(cur, \"SwitchCase\");\n        cases.push((cur = this.startNode()));\n        cur.consequent = [];\n        this.next();\n        if (isCase) {\n          cur.test = this.parseExpression();\n        } else {\n          if (sawDefault) {\n            this.raise(\n              this.state.lastTokStart,\n              Errors.MultipleDefaultsInSwitch,\n            );\n          }\n          sawDefault = true;\n          cur.test = null;\n        }\n        this.expect(tt.colon);\n      } else {\n        if (cur) {\n          cur.consequent.push(this.parseStatement(null));\n        } else {\n          this.unexpected();\n        }\n      }\n    }\n    this.scope.exit();\n    if (cur) this.finishNode(cur, \"SwitchCase\");\n    this.next(); // Closing brace\n    this.state.labels.pop();\n    return this.finishNode(node, \"SwitchStatement\");\n  }\n\n  parseThrowStatement(node: N.ThrowStatement): N.ThrowStatement {\n    this.next();\n    if (this.hasPrecedingLineBreak()) {\n      this.raise(this.state.lastTokEnd, Errors.NewlineAfterThrow);\n    }\n    node.argument = this.parseExpression();\n    this.semicolon();\n    return this.finishNode(node, \"ThrowStatement\");\n  }\n\n  parseCatchClauseParam(): N.Pattern {\n    const param = this.parseBindingAtom();\n\n    const simple = param.type === \"Identifier\";\n    this.scope.enter(simple ? SCOPE_SIMPLE_CATCH : 0);\n    this.checkLVal(param, \"catch clause\", BIND_LEXICAL);\n\n    return param;\n  }\n\n  parseTryStatement(node: N.TryStatement): N.TryStatement {\n    this.next();\n\n    node.block = this.parseBlock();\n    node.handler = null;\n\n    if (this.match(tt._catch)) {\n      const clause = this.startNode();\n      this.next();\n      if (this.match(tt.parenL)) {\n        this.expect(tt.parenL);\n        clause.param = this.parseCatchClauseParam();\n        this.expect(tt.parenR);\n      } else {\n        clause.param = null;\n        this.scope.enter(SCOPE_OTHER);\n      }\n\n      clause.body =\n        // For the smartPipelines plugin: Disable topic references from outer\n        // contexts within the catch clause's body.\n        this.withTopicForbiddingContext(() =>\n          // Parse the catch clause's body.\n          this.parseBlock(false, false),\n        );\n      this.scope.exit();\n\n      node.handler = this.finishNode(clause, \"CatchClause\");\n    }\n\n    node.finalizer = this.eat(tt._finally) ? this.parseBlock() : null;\n\n    if (!node.handler && !node.finalizer) {\n      this.raise(node.start, Errors.NoCatchOrFinally);\n    }\n\n    return this.finishNode(node, \"TryStatement\");\n  }\n\n  parseVarStatement(\n    node: N.VariableDeclaration,\n    kind: \"var\" | \"let\" | \"const\",\n  ): N.VariableDeclaration {\n    this.next();\n    this.parseVar(node, false, kind);\n    this.semicolon();\n    return this.finishNode(node, \"VariableDeclaration\");\n  }\n\n  parseWhileStatement(node: N.WhileStatement): N.WhileStatement {\n    this.next();\n    node.test = this.parseHeaderExpression();\n    this.state.labels.push(loopLabel);\n\n    node.body =\n      // For the smartPipelines plugin:\n      // Disable topic references from outer contexts within the loop body.\n      // They are permitted in test expressions, outside of the loop body.\n      this.withTopicForbiddingContext(() =>\n        // Parse loop body.\n        this.parseStatement(\"while\"),\n      );\n\n    this.state.labels.pop();\n\n    return this.finishNode(node, \"WhileStatement\");\n  }\n\n  parseWithStatement(node: N.WithStatement): N.WithStatement {\n    if (this.state.strict) {\n      this.raise(this.state.start, Errors.StrictWith);\n    }\n    this.next();\n    node.object = this.parseHeaderExpression();\n\n    node.body =\n      // For the smartPipelines plugin:\n      // Disable topic references from outer contexts within the with statement's body.\n      // They are permitted in function default-parameter expressions, which are\n      // part of the outer context, outside of the with statement's body.\n      this.withTopicForbiddingContext(() =>\n        // Parse the statement body.\n        this.parseStatement(\"with\"),\n      );\n\n    return this.finishNode(node, \"WithStatement\");\n  }\n\n  parseEmptyStatement(node: N.EmptyStatement): N.EmptyStatement {\n    this.next();\n    return this.finishNode(node, \"EmptyStatement\");\n  }\n\n  parseLabeledStatement(\n    node: N.LabeledStatement,\n    maybeName: string,\n    expr: N.Identifier,\n    context: ?string,\n  ): N.LabeledStatement {\n    for (const label of this.state.labels) {\n      if (label.name === maybeName) {\n        this.raise(expr.start, Errors.LabelRedeclaration, maybeName);\n      }\n    }\n\n    const kind = this.state.type.isLoop\n      ? \"loop\"\n      : this.match(tt._switch)\n      ? \"switch\"\n      : null;\n    for (let i = this.state.labels.length - 1; i >= 0; i--) {\n      const label = this.state.labels[i];\n      if (label.statementStart === node.start) {\n        label.statementStart = this.state.start;\n        label.kind = kind;\n      } else {\n        break;\n      }\n    }\n\n    this.state.labels.push({\n      name: maybeName,\n      kind: kind,\n      statementStart: this.state.start,\n    });\n    node.body = this.parseStatement(\n      context\n        ? context.indexOf(\"label\") === -1\n          ? context + \"label\"\n          : context\n        : \"label\",\n    );\n\n    this.state.labels.pop();\n    node.label = expr;\n    return this.finishNode(node, \"LabeledStatement\");\n  }\n\n  parseExpressionStatement(\n    node: N.ExpressionStatement,\n    expr: N.Expression,\n  ): N.Statement {\n    node.expression = expr;\n    this.semicolon();\n    return this.finishNode(node, \"ExpressionStatement\");\n  }\n\n  // Parse a semicolon-enclosed block of statements, handling `\"use\n  // strict\"` declarations when `allowDirectives` is true (used for\n  // function bodies).\n\n  parseBlock(\n    allowDirectives?: boolean = false,\n    createNewLexicalScope?: boolean = true,\n    afterBlockParse?: (hasStrictModeDirective: boolean) => void,\n  ): N.BlockStatement {\n    const node = this.startNode();\n    if (allowDirectives) {\n      this.state.strictErrors.clear();\n    }\n    this.expect(tt.braceL);\n    if (createNewLexicalScope) {\n      this.scope.enter(SCOPE_OTHER);\n    }\n    this.parseBlockBody(\n      node,\n      allowDirectives,\n      false,\n      tt.braceR,\n      afterBlockParse,\n    );\n    if (createNewLexicalScope) {\n      this.scope.exit();\n    }\n    return this.finishNode(node, \"BlockStatement\");\n  }\n\n  isValidDirective(stmt: N.Statement): boolean {\n    return (\n      stmt.type === \"ExpressionStatement\" &&\n      stmt.expression.type === \"StringLiteral\" &&\n      !stmt.expression.extra.parenthesized\n    );\n  }\n\n  parseBlockBody(\n    node: N.BlockStatementLike,\n    allowDirectives: ?boolean,\n    topLevel: boolean,\n    end: TokenType,\n    afterBlockParse?: (hasStrictModeDirective: boolean) => void,\n  ): void {\n    const body = (node.body = []);\n    const directives = (node.directives = []);\n    this.parseBlockOrModuleBlockBody(\n      body,\n      allowDirectives ? directives : undefined,\n      topLevel,\n      end,\n      afterBlockParse,\n    );\n  }\n\n  // Undefined directives means that directives are not allowed.\n  // https://tc39.es/ecma262/#prod-Block\n  // https://tc39.es/ecma262/#prod-ModuleBody\n  parseBlockOrModuleBlockBody(\n    body: N.Statement[],\n    directives: ?(N.Directive[]),\n    topLevel: boolean,\n    end: TokenType,\n    afterBlockParse?: (hasStrictModeDirective: boolean) => void,\n  ): void {\n    const oldStrict = this.state.strict;\n    let hasStrictModeDirective = false;\n    let parsedNonDirective = false;\n\n    while (!this.match(end)) {\n      const stmt = this.parseStatement(null, topLevel);\n\n      if (directives && !parsedNonDirective) {\n        if (this.isValidDirective(stmt)) {\n          const directive = this.stmtToDirective(stmt);\n          directives.push(directive);\n\n          if (\n            !hasStrictModeDirective &&\n            directive.value.value === \"use strict\"\n          ) {\n            hasStrictModeDirective = true;\n            this.setStrict(true);\n          }\n\n          continue;\n        }\n        parsedNonDirective = true;\n        // clear strict errors since the strict mode will not change within the block\n        this.state.strictErrors.clear();\n      }\n      body.push(stmt);\n    }\n\n    if (afterBlockParse) {\n      afterBlockParse.call(this, hasStrictModeDirective);\n    }\n\n    if (!oldStrict) {\n      this.setStrict(false);\n    }\n\n    this.next();\n  }\n\n  // Parse a regular `for` loop. The disambiguation code in\n  // `parseStatement` will already have parsed the init statement or\n  // expression.\n\n  parseFor(\n    node: N.ForStatement,\n    init: ?(N.VariableDeclaration | N.Expression),\n  ): N.ForStatement {\n    node.init = init;\n    this.semicolon(/* allowAsi */ false);\n    node.test = this.match(tt.semi) ? null : this.parseExpression();\n    this.semicolon(/* allowAsi */ false);\n    node.update = this.match(tt.parenR) ? null : this.parseExpression();\n    this.expect(tt.parenR);\n\n    node.body =\n      // For the smartPipelines plugin: Disable topic references from outer\n      // contexts within the loop body. They are permitted in test expressions,\n      // outside of the loop body.\n      this.withTopicForbiddingContext(() =>\n        // Parse the loop body.\n        this.parseStatement(\"for\"),\n      );\n\n    this.scope.exit();\n    this.state.labels.pop();\n\n    return this.finishNode(node, \"ForStatement\");\n  }\n\n  // Parse a `for`/`in` and `for`/`of` loop, which are almost\n  // same from parser's perspective.\n\n  parseForIn(\n    node: N.ForInOf,\n    init: N.VariableDeclaration | N.AssignmentPattern,\n    awaitAt: number,\n  ): N.ForInOf {\n    const isForIn = this.match(tt._in);\n    this.next();\n\n    if (isForIn) {\n      if (awaitAt > -1) this.unexpected(awaitAt);\n    } else {\n      node.await = awaitAt > -1;\n    }\n\n    if (\n      init.type === \"VariableDeclaration\" &&\n      init.declarations[0].init != null &&\n      (!isForIn ||\n        this.state.strict ||\n        init.kind !== \"var\" ||\n        init.declarations[0].id.type !== \"Identifier\")\n    ) {\n      this.raise(\n        init.start,\n        Errors.ForInOfLoopInitializer,\n        isForIn ? \"for-in\" : \"for-of\",\n      );\n    } else if (init.type === \"AssignmentPattern\") {\n      this.raise(init.start, Errors.InvalidLhs, \"for-loop\");\n    }\n\n    node.left = init;\n    node.right = isForIn\n      ? this.parseExpression()\n      : this.parseMaybeAssignAllowIn();\n    this.expect(tt.parenR);\n\n    node.body =\n      // For the smartPipelines plugin:\n      // Disable topic references from outer contexts within the loop body.\n      // They are permitted in test expressions, outside of the loop body.\n      this.withTopicForbiddingContext(() =>\n        // Parse loop body.\n        this.parseStatement(\"for\"),\n      );\n\n    this.scope.exit();\n    this.state.labels.pop();\n\n    return this.finishNode(node, isForIn ? \"ForInStatement\" : \"ForOfStatement\");\n  }\n\n  // Parse a list of variable declarations.\n\n  parseVar(\n    node: N.VariableDeclaration,\n    isFor: boolean,\n    kind: \"var\" | \"let\" | \"const\",\n  ): N.VariableDeclaration {\n    const declarations = (node.declarations = []);\n    const isTypescript = this.hasPlugin(\"typescript\");\n    node.kind = kind;\n    for (;;) {\n      const decl = this.startNode();\n      this.parseVarId(decl, kind);\n      if (this.eat(tt.eq)) {\n        decl.init = isFor\n          ? this.parseMaybeAssignDisallowIn()\n          : this.parseMaybeAssignAllowIn();\n      } else {\n        if (\n          kind === \"const\" &&\n          !(this.match(tt._in) || this.isContextual(\"of\"))\n        ) {\n          // `const` with no initializer is allowed in TypeScript.\n          // It could be a declaration like `const x: number;`.\n          if (!isTypescript) {\n            this.raise(\n              this.state.lastTokEnd,\n              Errors.DeclarationMissingInitializer,\n              \"Const declarations\",\n            );\n          }\n        } else if (\n          decl.id.type !== \"Identifier\" &&\n          !(isFor && (this.match(tt._in) || this.isContextual(\"of\")))\n        ) {\n          this.raise(\n            this.state.lastTokEnd,\n            Errors.DeclarationMissingInitializer,\n            \"Complex binding patterns\",\n          );\n        }\n        decl.init = null;\n      }\n      declarations.push(this.finishNode(decl, \"VariableDeclarator\"));\n      if (!this.eat(tt.comma)) break;\n    }\n    return node;\n  }\n\n  parseVarId(decl: N.VariableDeclarator, kind: \"var\" | \"let\" | \"const\"): void {\n    decl.id = this.parseBindingAtom();\n    this.checkLVal(\n      decl.id,\n      \"variable declaration\",\n      kind === \"var\" ? BIND_VAR : BIND_LEXICAL,\n      undefined,\n      kind !== \"var\",\n    );\n  }\n\n  // Parse a function declaration or literal (depending on the\n  // `isStatement` parameter).\n\n  parseFunction<T: N.NormalFunction>(\n    node: T,\n    statement?: number = FUNC_NO_FLAGS,\n    isAsync?: boolean = false,\n  ): T {\n    const isStatement = statement & FUNC_STATEMENT;\n    const isHangingStatement = statement & FUNC_HANGING_STATEMENT;\n    const requireId = !!isStatement && !(statement & FUNC_NULLABLE_ID);\n\n    this.initFunction(node, isAsync);\n\n    if (this.match(tt.star) && isHangingStatement) {\n      this.raise(this.state.start, Errors.GeneratorInSingleStatementContext);\n    }\n    node.generator = this.eat(tt.star);\n\n    if (isStatement) {\n      node.id = this.parseFunctionId(requireId);\n    }\n\n    const oldMaybeInArrowParameters = this.state.maybeInArrowParameters;\n    this.state.maybeInArrowParameters = false;\n    this.scope.enter(SCOPE_FUNCTION);\n    this.prodParam.enter(functionFlags(isAsync, node.generator));\n\n    if (!isStatement) {\n      node.id = this.parseFunctionId();\n    }\n\n    this.parseFunctionParams(node, /* allowModifiers */ false);\n\n    // For the smartPipelines plugin: Disable topic references from outer\n    // contexts within the function body. They are permitted in function\n    // default-parameter expressions, outside of the function body.\n    this.withTopicForbiddingContext(() => {\n      // Parse the function body.\n      this.parseFunctionBodyAndFinish(\n        node,\n        isStatement ? \"FunctionDeclaration\" : \"FunctionExpression\",\n      );\n    });\n\n    this.prodParam.exit();\n    this.scope.exit();\n\n    if (isStatement && !isHangingStatement) {\n      // We need to register this _after_ parsing the function body\n      // because of TypeScript body-less function declarations,\n      // which shouldn't be added to the scope.\n      this.registerFunctionStatementId(node);\n    }\n\n    this.state.maybeInArrowParameters = oldMaybeInArrowParameters;\n    return node;\n  }\n\n  parseFunctionId(requireId?: boolean): ?N.Identifier {\n    return requireId || this.match(tt.name) ? this.parseIdentifier() : null;\n  }\n\n  parseFunctionParams(node: N.Function, allowModifiers?: boolean): void {\n    this.expect(tt.parenL);\n    this.expressionScope.enter(newParameterDeclarationScope());\n    node.params = this.parseBindingList(\n      tt.parenR,\n      charCodes.rightParenthesis,\n      /* allowEmpty */ false,\n      allowModifiers,\n    );\n\n    this.expressionScope.exit();\n  }\n\n  registerFunctionStatementId(node: N.Function): void {\n    if (!node.id) return;\n\n    // If it is a regular function declaration in sloppy mode, then it is\n    // subject to Annex B semantics (BIND_FUNCTION). Otherwise, the binding\n    // mode depends on properties of the current scope (see\n    // treatFunctionsAsVar).\n    this.scope.declareName(\n      node.id.name,\n      this.state.strict || node.generator || node.async\n        ? this.scope.treatFunctionsAsVar\n          ? BIND_VAR\n          : BIND_LEXICAL\n        : BIND_FUNCTION,\n      node.id.start,\n    );\n  }\n\n  // Parse a class declaration or literal (depending on the\n  // `isStatement` parameter).\n\n  parseClass<T: N.Class>(\n    node: T,\n    isStatement: /* T === ClassDeclaration */ boolean,\n    optionalId?: boolean,\n  ): T {\n    this.next();\n    this.takeDecorators(node);\n\n    // A class definition is always strict mode code.\n    const oldStrict = this.state.strict;\n    this.state.strict = true;\n\n    this.parseClassId(node, isStatement, optionalId);\n    this.parseClassSuper(node);\n    // this.state.strict is restored in parseClassBody\n    node.body = this.parseClassBody(!!node.superClass, oldStrict);\n\n    return this.finishNode(\n      node,\n      isStatement ? \"ClassDeclaration\" : \"ClassExpression\",\n    );\n  }\n\n  isClassProperty(): boolean {\n    return this.match(tt.eq) || this.match(tt.semi) || this.match(tt.braceR);\n  }\n\n  isClassMethod(): boolean {\n    return this.match(tt.parenL);\n  }\n\n  isNonstaticConstructor(method: N.ClassMethod | N.ClassProperty): boolean {\n    return (\n      !method.computed &&\n      !method.static &&\n      (method.key.name === \"constructor\" || // Identifier\n        method.key.value === \"constructor\") // String literal\n    );\n  }\n\n  // https://tc39.es/ecma262/#prod-ClassBody\n  parseClassBody(hadSuperClass: boolean, oldStrict: boolean): N.ClassBody {\n    this.classScope.enter();\n\n    const state: N.ParseClassMemberState = {\n      hadConstructor: false,\n      hadSuperClass,\n    };\n    let decorators: N.Decorator[] = [];\n    const classBody: N.ClassBody = this.startNode();\n    classBody.body = [];\n\n    this.expect(tt.braceL);\n\n    // For the smartPipelines plugin: Disable topic references from outer\n    // contexts within the class body.\n    this.withTopicForbiddingContext(() => {\n      while (!this.match(tt.braceR)) {\n        if (this.eat(tt.semi)) {\n          if (decorators.length > 0) {\n            throw this.raise(this.state.lastTokEnd, Errors.DecoratorSemicolon);\n          }\n          continue;\n        }\n\n        if (this.match(tt.at)) {\n          decorators.push(this.parseDecorator());\n          continue;\n        }\n\n        const member = this.startNode();\n\n        // steal the decorators if there are any\n        if (decorators.length) {\n          member.decorators = decorators;\n          this.resetStartLocationFromNode(member, decorators[0]);\n          decorators = [];\n        }\n\n        this.parseClassMember(classBody, member, state);\n\n        if (\n          member.kind === \"constructor\" &&\n          member.decorators &&\n          member.decorators.length > 0\n        ) {\n          this.raise(member.start, Errors.DecoratorConstructor);\n        }\n      }\n    });\n\n    this.state.strict = oldStrict;\n\n    this.next(); // eat `}`\n\n    if (decorators.length) {\n      throw this.raise(this.state.start, Errors.TrailingDecorator);\n    }\n\n    this.classScope.exit();\n\n    return this.finishNode(classBody, \"ClassBody\");\n  }\n\n  // returns true if the current identifier is a method/field name,\n  // false if it is a modifier\n  parseClassMemberFromModifier(\n    classBody: N.ClassBody,\n    member: N.ClassMember,\n  ): boolean {\n    const key = this.parseIdentifier(true); // eats the modifier\n\n    if (this.isClassMethod()) {\n      const method: N.ClassMethod = (member: any);\n\n      // a method named like the modifier\n      method.kind = \"method\";\n      method.computed = false;\n      method.key = key;\n      method.static = false;\n      this.pushClassMethod(\n        classBody,\n        method,\n        false,\n        false,\n        /* isConstructor */ false,\n        false,\n      );\n      return true;\n    } else if (this.isClassProperty()) {\n      const prop: N.ClassProperty = (member: any);\n\n      // a property named like the modifier\n      prop.computed = false;\n      prop.key = key;\n      prop.static = false;\n      classBody.body.push(this.parseClassProperty(prop));\n      return true;\n    }\n    return false;\n  }\n\n  parseClassMember(\n    classBody: N.ClassBody,\n    member: N.ClassMember,\n    state: N.ParseClassMemberState,\n  ): void {\n    const isStatic = this.isContextual(\"static\");\n\n    if (isStatic) {\n      if (this.parseClassMemberFromModifier(classBody, member)) {\n        // a class element named 'static'\n        return;\n      }\n      if (this.eat(tt.braceL)) {\n        this.parseClassStaticBlock(classBody, ((member: any): N.StaticBlock));\n        return;\n      }\n    }\n\n    this.parseClassMemberWithIsStatic(classBody, member, state, isStatic);\n  }\n\n  parseClassMemberWithIsStatic(\n    classBody: N.ClassBody,\n    member: N.ClassMember,\n    state: N.ParseClassMemberState,\n    isStatic: boolean,\n  ) {\n    const publicMethod: $FlowSubtype<N.ClassMethod> = member;\n    const privateMethod: $FlowSubtype<N.ClassPrivateMethod> = member;\n    const publicProp: $FlowSubtype<N.ClassMethod> = member;\n    const privateProp: $FlowSubtype<N.ClassPrivateMethod> = member;\n\n    const method: typeof publicMethod | typeof privateMethod = publicMethod;\n    const publicMember: typeof publicMethod | typeof publicProp = publicMethod;\n\n    member.static = isStatic;\n\n    if (this.eat(tt.star)) {\n      // a generator\n      method.kind = \"method\";\n      const isPrivateName = this.match(tt.privateName);\n      this.parseClassElementName(method);\n\n      if (isPrivateName) {\n        // Private generator method\n        this.pushClassPrivateMethod(classBody, privateMethod, true, false);\n        return;\n      }\n\n      if (this.isNonstaticConstructor(publicMethod)) {\n        this.raise(publicMethod.key.start, Errors.ConstructorIsGenerator);\n      }\n\n      this.pushClassMethod(\n        classBody,\n        publicMethod,\n        true,\n        false,\n        /* isConstructor */ false,\n        false,\n      );\n\n      return;\n    }\n\n    const containsEsc = this.state.containsEsc;\n    const isPrivate = this.match(tt.privateName);\n    const key = this.parseClassElementName(member);\n    // Check the key is not a computed expression or string literal.\n    const isSimple = key.type === \"Identifier\";\n    const maybeQuestionTokenStart = this.state.start;\n\n    this.parsePostMemberNameModifiers(publicMember);\n\n    if (this.isClassMethod()) {\n      method.kind = \"method\";\n\n      if (isPrivate) {\n        this.pushClassPrivateMethod(classBody, privateMethod, false, false);\n        return;\n      }\n\n      // a normal method\n      const isConstructor = this.isNonstaticConstructor(publicMethod);\n      let allowsDirectSuper = false;\n      if (isConstructor) {\n        publicMethod.kind = \"constructor\";\n\n        // TypeScript allows multiple overloaded constructor declarations.\n        if (state.hadConstructor && !this.hasPlugin(\"typescript\")) {\n          this.raise(key.start, Errors.DuplicateConstructor);\n        }\n        if (isConstructor && this.hasPlugin(\"typescript\") && member.override) {\n          this.raise(key.start, Errors.OverrideOnConstructor);\n        }\n        state.hadConstructor = true;\n        allowsDirectSuper = state.hadSuperClass;\n      }\n\n      this.pushClassMethod(\n        classBody,\n        publicMethod,\n        false,\n        false,\n        isConstructor,\n        allowsDirectSuper,\n      );\n    } else if (this.isClassProperty()) {\n      if (isPrivate) {\n        this.pushClassPrivateProperty(classBody, privateProp);\n      } else {\n        this.pushClassProperty(classBody, publicProp);\n      }\n    } else if (\n      isSimple &&\n      key.name === \"async\" &&\n      !containsEsc &&\n      !this.isLineTerminator()\n    ) {\n      // an async method\n      const isGenerator = this.eat(tt.star);\n\n      if (publicMember.optional) {\n        this.unexpected(maybeQuestionTokenStart);\n      }\n\n      method.kind = \"method\";\n      // The so-called parsed name would have been \"async\": get the real name.\n      const isPrivate = this.match(tt.privateName);\n      this.parseClassElementName(method);\n      this.parsePostMemberNameModifiers(publicMember);\n\n      if (isPrivate) {\n        // private async method\n        this.pushClassPrivateMethod(\n          classBody,\n          privateMethod,\n          isGenerator,\n          true,\n        );\n      } else {\n        if (this.isNonstaticConstructor(publicMethod)) {\n          this.raise(publicMethod.key.start, Errors.ConstructorIsAsync);\n        }\n\n        this.pushClassMethod(\n          classBody,\n          publicMethod,\n          isGenerator,\n          true,\n          /* isConstructor */ false,\n          false,\n        );\n      }\n    } else if (\n      isSimple &&\n      (key.name === \"get\" || key.name === \"set\") &&\n      !containsEsc &&\n      !(this.match(tt.star) && this.isLineTerminator())\n    ) {\n      // `get\\n*` is an uninitialized property named 'get' followed by a generator.\n      // a getter or setter\n      method.kind = key.name;\n      // The so-called parsed name would have been \"get/set\": get the real name.\n      const isPrivate = this.match(tt.privateName);\n      this.parseClassElementName(publicMethod);\n\n      if (isPrivate) {\n        // private getter/setter\n        this.pushClassPrivateMethod(classBody, privateMethod, false, false);\n      } else {\n        if (this.isNonstaticConstructor(publicMethod)) {\n          this.raise(publicMethod.key.start, Errors.ConstructorIsAccessor);\n        }\n        this.pushClassMethod(\n          classBody,\n          publicMethod,\n          false,\n          false,\n          /* isConstructor */ false,\n          false,\n        );\n      }\n\n      this.checkGetterSetterParams(publicMethod);\n    } else if (this.isLineTerminator()) {\n      // an uninitialized class property (due to ASI, since we don't otherwise recognize the next token)\n      if (isPrivate) {\n        this.pushClassPrivateProperty(classBody, privateProp);\n      } else {\n        this.pushClassProperty(classBody, publicProp);\n      }\n    } else {\n      this.unexpected();\n    }\n  }\n\n  // https://tc39.es/proposal-class-fields/#prod-ClassElementName\n  parseClassElementName(member: N.ClassMember): N.Expression | N.Identifier {\n    const { type, value, start } = this.state;\n    if (\n      (type === tt.name || type === tt.string) &&\n      member.static &&\n      value === \"prototype\"\n    ) {\n      this.raise(start, Errors.StaticPrototype);\n    }\n\n    if (type === tt.privateName && value === \"constructor\") {\n      this.raise(start, Errors.ConstructorClassPrivateField);\n    }\n\n    return this.parsePropertyName(member, /* isPrivateNameAllowed */ true);\n  }\n\n  parseClassStaticBlock(\n    classBody: N.ClassBody,\n    member: N.StaticBlock & { decorators?: Array<N.Decorator> },\n  ) {\n    this.expectPlugin(\"classStaticBlock\", member.start);\n    // Start a new lexical scope\n    this.scope.enter(SCOPE_CLASS | SCOPE_STATIC_BLOCK | SCOPE_SUPER);\n    // Start a new scope with regard to loop labels\n    const oldLabels = this.state.labels;\n    this.state.labels = [];\n    // ClassStaticBlockStatementList:\n    //   StatementList[~Yield, ~Await, ~Return] opt\n    this.prodParam.enter(PARAM);\n    const body = (member.body = []);\n    this.parseBlockOrModuleBlockBody(body, undefined, false, tt.braceR);\n    this.prodParam.exit();\n    this.scope.exit();\n    this.state.labels = oldLabels;\n    classBody.body.push(this.finishNode<N.StaticBlock>(member, \"StaticBlock\"));\n    if (member.decorators?.length) {\n      this.raise(member.start, Errors.DecoratorStaticBlock);\n    }\n  }\n\n  pushClassProperty(classBody: N.ClassBody, prop: N.ClassProperty) {\n    if (\n      !prop.computed &&\n      (prop.key.name === \"constructor\" || prop.key.value === \"constructor\")\n    ) {\n      // Non-computed field, which is either an identifier named \"constructor\"\n      // or a string literal named \"constructor\"\n      this.raise(prop.key.start, Errors.ConstructorClassField);\n    }\n\n    classBody.body.push(this.parseClassProperty(prop));\n  }\n\n  pushClassPrivateProperty(\n    classBody: N.ClassBody,\n    prop: N.ClassPrivateProperty,\n  ) {\n    const node = this.parseClassPrivateProperty(prop);\n    classBody.body.push(node);\n\n    this.classScope.declarePrivateName(\n      this.getPrivateNameSV(node.key),\n      CLASS_ELEMENT_OTHER,\n      node.key.start,\n    );\n  }\n\n  pushClassMethod(\n    classBody: N.ClassBody,\n    method: N.ClassMethod,\n    isGenerator: boolean,\n    isAsync: boolean,\n    isConstructor: boolean,\n    allowsDirectSuper: boolean,\n  ): void {\n    classBody.body.push(\n      this.parseMethod(\n        method,\n        isGenerator,\n        isAsync,\n        isConstructor,\n        allowsDirectSuper,\n        \"ClassMethod\",\n        true,\n      ),\n    );\n  }\n\n  pushClassPrivateMethod(\n    classBody: N.ClassBody,\n    method: N.ClassPrivateMethod,\n    isGenerator: boolean,\n    isAsync: boolean,\n  ): void {\n    const node = this.parseMethod(\n      method,\n      isGenerator,\n      isAsync,\n      /* isConstructor */ false,\n      false,\n      \"ClassPrivateMethod\",\n      true,\n    );\n    classBody.body.push(node);\n\n    const kind =\n      node.kind === \"get\"\n        ? node.static\n          ? CLASS_ELEMENT_STATIC_GETTER\n          : CLASS_ELEMENT_INSTANCE_GETTER\n        : node.kind === \"set\"\n        ? node.static\n          ? CLASS_ELEMENT_STATIC_SETTER\n          : CLASS_ELEMENT_INSTANCE_SETTER\n        : CLASS_ELEMENT_OTHER;\n    this.classScope.declarePrivateName(\n      this.getPrivateNameSV(node.key),\n      kind,\n      node.key.start,\n    );\n  }\n\n  // Overridden in typescript.js\n  parsePostMemberNameModifiers(\n    // eslint-disable-next-line no-unused-vars\n    methodOrProp: N.ClassMethod | N.ClassProperty,\n  ): void {}\n\n  // https://tc39.es/proposal-class-fields/#prod-FieldDefinition\n  parseClassPrivateProperty(\n    node: N.ClassPrivateProperty,\n  ): N.ClassPrivateProperty {\n    this.parseInitializer(node);\n    this.semicolon();\n    return this.finishNode(node, \"ClassPrivateProperty\");\n  }\n\n  // https://tc39.es/proposal-class-fields/#prod-FieldDefinition\n  parseClassProperty(node: N.ClassProperty): N.ClassProperty {\n    this.parseInitializer(node);\n    this.semicolon();\n    return this.finishNode(node, \"ClassProperty\");\n  }\n\n  // https://tc39.es/proposal-class-fields/#prod-Initializer\n  parseInitializer(node: N.ClassProperty | N.ClassPrivateProperty): void {\n    this.scope.enter(SCOPE_CLASS | SCOPE_SUPER);\n    this.expressionScope.enter(newExpressionScope());\n    this.prodParam.enter(PARAM);\n    node.value = this.eat(tt.eq) ? this.parseMaybeAssignAllowIn() : null;\n    this.expressionScope.exit();\n    this.prodParam.exit();\n    this.scope.exit();\n  }\n\n  parseClassId(\n    node: N.Class,\n    isStatement: boolean,\n    optionalId: ?boolean,\n    bindingType: BindingTypes = BIND_CLASS,\n  ): void {\n    if (this.match(tt.name)) {\n      node.id = this.parseIdentifier();\n      if (isStatement) {\n        this.checkLVal(node.id, \"class name\", bindingType);\n      }\n    } else {\n      if (optionalId || !isStatement) {\n        node.id = null;\n      } else {\n        this.unexpected(null, Errors.MissingClassName);\n      }\n    }\n  }\n\n  // https://tc39.es/ecma262/#prod-ClassHeritage\n  parseClassSuper(node: N.Class): void {\n    node.superClass = this.eat(tt._extends) ? this.parseExprSubscripts() : null;\n  }\n\n  // Parses module export declaration.\n  // https://tc39.es/ecma262/#prod-ExportDeclaration\n\n  parseExport(node: N.Node): N.AnyExport {\n    const hasDefault = this.maybeParseExportDefaultSpecifier(node);\n    const parseAfterDefault = !hasDefault || this.eat(tt.comma);\n    const hasStar = parseAfterDefault && this.eatExportStar(node);\n    const hasNamespace =\n      hasStar && this.maybeParseExportNamespaceSpecifier(node);\n    const parseAfterNamespace =\n      parseAfterDefault && (!hasNamespace || this.eat(tt.comma));\n    const isFromRequired = hasDefault || hasStar;\n\n    if (hasStar && !hasNamespace) {\n      if (hasDefault) this.unexpected();\n      this.parseExportFrom(node, true);\n\n      return this.finishNode(node, \"ExportAllDeclaration\");\n    }\n\n    const hasSpecifiers = this.maybeParseExportNamedSpecifiers(node);\n\n    if (\n      (hasDefault && parseAfterDefault && !hasStar && !hasSpecifiers) ||\n      (hasNamespace && parseAfterNamespace && !hasSpecifiers)\n    ) {\n      throw this.unexpected(null, tt.braceL);\n    }\n\n    let hasDeclaration;\n    if (isFromRequired || hasSpecifiers) {\n      hasDeclaration = false;\n      this.parseExportFrom(node, isFromRequired);\n    } else {\n      hasDeclaration = this.maybeParseExportDeclaration(node);\n    }\n\n    if (isFromRequired || hasSpecifiers || hasDeclaration) {\n      this.checkExport(node, true, false, !!node.source);\n      return this.finishNode(node, \"ExportNamedDeclaration\");\n    }\n\n    if (this.eat(tt._default)) {\n      // export default ...\n      node.declaration = this.parseExportDefaultExpression();\n      this.checkExport(node, true, true);\n\n      return this.finishNode(node, \"ExportDefaultDeclaration\");\n    }\n\n    throw this.unexpected(null, tt.braceL);\n  }\n\n  // eslint-disable-next-line no-unused-vars\n  eatExportStar(node: N.Node): boolean {\n    return this.eat(tt.star);\n  }\n\n  maybeParseExportDefaultSpecifier(node: N.Node): boolean {\n    if (this.isExportDefaultSpecifier()) {\n      // export defaultObj ...\n      this.expectPlugin(\"exportDefaultFrom\");\n      const specifier = this.startNode();\n      specifier.exported = this.parseIdentifier(true);\n      node.specifiers = [this.finishNode(specifier, \"ExportDefaultSpecifier\")];\n      return true;\n    }\n    return false;\n  }\n\n  maybeParseExportNamespaceSpecifier(node: N.Node): boolean {\n    if (this.isContextual(\"as\")) {\n      if (!node.specifiers) node.specifiers = [];\n\n      const specifier = this.startNodeAt(\n        this.state.lastTokStart,\n        this.state.lastTokStartLoc,\n      );\n\n      this.next();\n\n      specifier.exported = this.parseModuleExportName();\n      node.specifiers.push(\n        this.finishNode(specifier, \"ExportNamespaceSpecifier\"),\n      );\n      return true;\n    }\n    return false;\n  }\n\n  maybeParseExportNamedSpecifiers(node: N.Node): boolean {\n    if (this.match(tt.braceL)) {\n      if (!node.specifiers) node.specifiers = [];\n      node.specifiers.push(...this.parseExportSpecifiers());\n\n      node.source = null;\n      node.declaration = null;\n\n      return true;\n    }\n    return false;\n  }\n\n  maybeParseExportDeclaration(node: N.Node): boolean {\n    if (this.shouldParseExportDeclaration()) {\n      node.specifiers = [];\n      node.source = null;\n      node.declaration = this.parseExportDeclaration(node);\n      return true;\n    }\n    return false;\n  }\n\n  isAsyncFunction(): boolean {\n    if (!this.isContextual(\"async\")) return false;\n    const next = this.nextTokenStart();\n    return (\n      !lineBreak.test(this.input.slice(this.state.pos, next)) &&\n      this.isUnparsedContextual(next, \"function\")\n    );\n  }\n\n  parseExportDefaultExpression(): N.Expression | N.Declaration {\n    const expr = this.startNode();\n\n    const isAsync = this.isAsyncFunction();\n\n    if (this.match(tt._function) || isAsync) {\n      this.next();\n      if (isAsync) {\n        this.next();\n      }\n\n      return this.parseFunction(\n        expr,\n        FUNC_STATEMENT | FUNC_NULLABLE_ID,\n        isAsync,\n      );\n    } else if (this.match(tt._class)) {\n      return this.parseClass(expr, true, true);\n    } else if (this.match(tt.at)) {\n      if (\n        this.hasPlugin(\"decorators\") &&\n        this.getPluginOption(\"decorators\", \"decoratorsBeforeExport\")\n      ) {\n        this.raise(this.state.start, Errors.DecoratorBeforeExport);\n      }\n      this.parseDecorators(false);\n      return this.parseClass(expr, true, true);\n    } else if (this.match(tt._const) || this.match(tt._var) || this.isLet()) {\n      throw this.raise(this.state.start, Errors.UnsupportedDefaultExport);\n    } else {\n      const res = this.parseMaybeAssignAllowIn();\n      this.semicolon();\n      return res;\n    }\n  }\n\n  // eslint-disable-next-line no-unused-vars\n  parseExportDeclaration(node: N.ExportNamedDeclaration): ?N.Declaration {\n    return this.parseStatement(null);\n  }\n\n  isExportDefaultSpecifier(): boolean {\n    if (this.match(tt.name)) {\n      const value = this.state.value;\n      if ((value === \"async\" && !this.state.containsEsc) || value === \"let\") {\n        return false;\n      }\n      if (\n        (value === \"type\" || value === \"interface\") &&\n        !this.state.containsEsc\n      ) {\n        const l = this.lookahead();\n        // If we see any variable name other than `from` after `type` keyword,\n        // we consider it as flow/typescript type exports\n        // note that this approach may fail on some pedantic cases\n        // export type from = number\n        if (\n          (l.type === tt.name && l.value !== \"from\") ||\n          l.type === tt.braceL\n        ) {\n          this.expectOnePlugin([\"flow\", \"typescript\"]);\n          return false;\n        }\n      }\n    } else if (!this.match(tt._default)) {\n      return false;\n    }\n\n    const next = this.nextTokenStart();\n    const hasFrom = this.isUnparsedContextual(next, \"from\");\n    if (\n      this.input.charCodeAt(next) === charCodes.comma ||\n      (this.match(tt.name) && hasFrom)\n    ) {\n      return true;\n    }\n    // lookahead again when `export default from` is seen\n    if (this.match(tt._default) && hasFrom) {\n      const nextAfterFrom = this.input.charCodeAt(\n        this.nextTokenStartSince(next + 4),\n      );\n      return (\n        nextAfterFrom === charCodes.quotationMark ||\n        nextAfterFrom === charCodes.apostrophe\n      );\n    }\n    return false;\n  }\n\n  parseExportFrom(node: N.ExportNamedDeclaration, expect?: boolean): void {\n    if (this.eatContextual(\"from\")) {\n      node.source = this.parseImportSource();\n      this.checkExport(node);\n      const assertions = this.maybeParseImportAssertions();\n      if (assertions) {\n        node.assertions = assertions;\n      }\n    } else {\n      if (expect) {\n        this.unexpected();\n      } else {\n        node.source = null;\n      }\n    }\n\n    this.semicolon();\n  }\n\n  shouldParseExportDeclaration(): boolean {\n    if (this.match(tt.at)) {\n      this.expectOnePlugin([\"decorators\", \"decorators-legacy\"]);\n      if (this.hasPlugin(\"decorators\")) {\n        if (this.getPluginOption(\"decorators\", \"decoratorsBeforeExport\")) {\n          this.unexpected(this.state.start, Errors.DecoratorBeforeExport);\n        } else {\n          return true;\n        }\n      }\n    }\n\n    return (\n      this.state.type.keyword === \"var\" ||\n      this.state.type.keyword === \"const\" ||\n      this.state.type.keyword === \"function\" ||\n      this.state.type.keyword === \"class\" ||\n      this.isLet() ||\n      this.isAsyncFunction()\n    );\n  }\n\n  checkExport(\n    node: N.ExportNamedDeclaration,\n    checkNames?: boolean,\n    isDefault?: boolean,\n    isFrom?: boolean,\n  ): void {\n    if (checkNames) {\n      // Check for duplicate exports\n      if (isDefault) {\n        // Default exports\n        this.checkDuplicateExports(node, \"default\");\n        if (this.hasPlugin(\"exportDefaultFrom\")) {\n          const declaration = ((node: any): N.ExportDefaultDeclaration)\n            .declaration;\n          if (\n            declaration.type === \"Identifier\" &&\n            declaration.name === \"from\" &&\n            declaration.end - declaration.start === 4 && // does not contain escape\n            !declaration.extra?.parenthesized\n          ) {\n            this.raise(declaration.start, Errors.ExportDefaultFromAsIdentifier);\n          }\n        }\n      } else if (node.specifiers && node.specifiers.length) {\n        // Named exports\n        for (const specifier of node.specifiers) {\n          const { exported } = specifier;\n          const exportedName =\n            exported.type === \"Identifier\" ? exported.name : exported.value;\n          this.checkDuplicateExports(specifier, exportedName);\n          // $FlowIgnore\n          if (!isFrom && specifier.local) {\n            const { local } = specifier;\n            if (local.type !== \"Identifier\") {\n              this.raise(\n                specifier.start,\n                Errors.ExportBindingIsString,\n                local.value,\n                exportedName,\n              );\n            } else {\n              // check for keywords used as local names\n              this.checkReservedWord(local.name, local.start, true, false);\n              // check if export is defined\n              this.scope.checkLocalExport(local);\n            }\n          }\n        }\n      } else if (node.declaration) {\n        // Exported declarations\n        if (\n          node.declaration.type === \"FunctionDeclaration\" ||\n          node.declaration.type === \"ClassDeclaration\"\n        ) {\n          const id = node.declaration.id;\n          if (!id) throw new Error(\"Assertion failure\");\n\n          this.checkDuplicateExports(node, id.name);\n        } else if (node.declaration.type === \"VariableDeclaration\") {\n          for (const declaration of node.declaration.declarations) {\n            this.checkDeclaration(declaration.id);\n          }\n        }\n      }\n    }\n\n    const currentContextDecorators =\n      this.state.decoratorStack[this.state.decoratorStack.length - 1];\n    // If node.declaration is a class, it will take all decorators in the current context.\n    // Thus we should throw if we see non-empty decorators here.\n    if (currentContextDecorators.length) {\n      throw this.raise(node.start, Errors.UnsupportedDecoratorExport);\n    }\n  }\n\n  checkDeclaration(node: N.Pattern | N.ObjectProperty): void {\n    if (node.type === \"Identifier\") {\n      this.checkDuplicateExports(node, node.name);\n    } else if (node.type === \"ObjectPattern\") {\n      for (const prop of node.properties) {\n        this.checkDeclaration(prop);\n      }\n    } else if (node.type === \"ArrayPattern\") {\n      for (const elem of node.elements) {\n        if (elem) {\n          this.checkDeclaration(elem);\n        }\n      }\n    } else if (node.type === \"ObjectProperty\") {\n      this.checkDeclaration(node.value);\n    } else if (node.type === \"RestElement\") {\n      this.checkDeclaration(node.argument);\n    } else if (node.type === \"AssignmentPattern\") {\n      this.checkDeclaration(node.left);\n    }\n  }\n\n  checkDuplicateExports(\n    node:\n      | N.Identifier\n      | N.StringLiteral\n      | N.ExportNamedDeclaration\n      | N.ExportSpecifier\n      | N.ExportDefaultSpecifier,\n    name: string,\n  ): void {\n    if (this.exportedIdentifiers.has(name)) {\n      this.raise(\n        node.start,\n        name === \"default\"\n          ? Errors.DuplicateDefaultExport\n          : Errors.DuplicateExport,\n        name,\n      );\n    }\n    this.exportedIdentifiers.add(name);\n  }\n\n  // Parses a comma-separated list of module exports.\n\n  parseExportSpecifiers(): Array<N.ExportSpecifier> {\n    const nodes = [];\n    let first = true;\n\n    // export { x, y as z } [from '...']\n    this.expect(tt.braceL);\n\n    while (!this.eat(tt.braceR)) {\n      if (first) {\n        first = false;\n      } else {\n        this.expect(tt.comma);\n        if (this.eat(tt.braceR)) break;\n      }\n\n      const node = this.startNode();\n      node.local = this.parseModuleExportName();\n      node.exported = this.eatContextual(\"as\")\n        ? this.parseModuleExportName()\n        : node.local.__clone();\n      nodes.push(this.finishNode(node, \"ExportSpecifier\"));\n    }\n\n    return nodes;\n  }\n\n  // https://tc39.es/ecma262/#prod-ModuleExportName\n  parseModuleExportName(): N.StringLiteral | N.Identifier {\n    if (this.match(tt.string)) {\n      const result = this.parseStringLiteral(this.state.value);\n      const surrogate = result.value.match(loneSurrogate);\n      if (surrogate) {\n        this.raise(\n          result.start,\n          Errors.ModuleExportNameHasLoneSurrogate,\n          surrogate[0].charCodeAt(0).toString(16),\n        );\n      }\n      return result;\n    }\n    return this.parseIdentifier(true);\n  }\n\n  // Parses import declaration.\n  // https://tc39.es/ecma262/#prod-ImportDeclaration\n\n  parseImport(node: N.Node): N.AnyImport {\n    // import '...'\n    node.specifiers = [];\n    if (!this.match(tt.string)) {\n      // check if we have a default import like\n      // import React from \"react\";\n      const hasDefault = this.maybeParseDefaultImportSpecifier(node);\n      /* we are checking if we do not have a default import, then it is obvious that we need named imports\n       * import { get } from \"axios\";\n       * but if we do have a default import\n       * we need to check if we have a comma after that and\n       * that is where this `|| this.eat` condition comes into play\n       */\n      const parseNext = !hasDefault || this.eat(tt.comma);\n      // if we do have to parse the next set of specifiers, we first check for star imports\n      // import React, * from \"react\";\n      const hasStar = parseNext && this.maybeParseStarImportSpecifier(node);\n      // now we check if we need to parse the next imports\n      // but only if they are not importing * (everything)\n      if (parseNext && !hasStar) this.parseNamedImportSpecifiers(node);\n      this.expectContextual(\"from\");\n    }\n    node.source = this.parseImportSource();\n    // https://github.com/tc39/proposal-import-assertions\n    // parse module import assertions if the next token is `assert` or ignore\n    // and finish the ImportDeclaration node.\n    const assertions = this.maybeParseImportAssertions();\n    if (assertions) {\n      node.assertions = assertions;\n    } else if (!process.env.BABEL_8_BREAKING) {\n      const attributes = this.maybeParseModuleAttributes();\n      if (attributes) {\n        node.attributes = attributes;\n      }\n    }\n\n    this.semicolon();\n    return this.finishNode(node, \"ImportDeclaration\");\n  }\n\n  parseImportSource(): N.StringLiteral {\n    if (!this.match(tt.string)) this.unexpected();\n    return this.parseExprAtom();\n  }\n\n  // eslint-disable-next-line no-unused-vars\n  shouldParseDefaultImport(node: N.ImportDeclaration): boolean {\n    return this.match(tt.name);\n  }\n\n  parseImportSpecifierLocal(\n    node: N.ImportDeclaration,\n    specifier: N.Node,\n    type: string,\n    contextDescription: string,\n  ): void {\n    specifier.local = this.parseIdentifier();\n    this.checkLVal(specifier.local, contextDescription, BIND_LEXICAL);\n    node.specifiers.push(this.finishNode(specifier, type));\n  }\n\n  /**\n   * parse assert entries\n   *\n   * @see {@link https://tc39.es/proposal-import-assertions/#prod-AssertEntries |AssertEntries}\n   * @returns {N.ImportAttribute[]}\n   * @memberof StatementParser\n   */\n  parseAssertEntries(): N.ImportAttribute[] {\n    const attrs = [];\n    const attrNames = new Set();\n\n    do {\n      if (this.match(tt.braceR)) {\n        break;\n      }\n\n      const node = this.startNode<N.ImportAttribute>();\n\n      // parse AssertionKey : IdentifierName, StringLiteral\n      const keyName = this.state.value;\n      // check if we already have an entry for an attribute\n      // if a duplicate entry is found, throw an error\n      // for now this logic will come into play only when someone declares `type` twice\n      if (attrNames.has(keyName)) {\n        this.raise(\n          this.state.start,\n          Errors.ModuleAttributesWithDuplicateKeys,\n          keyName,\n        );\n      }\n      attrNames.add(keyName);\n      if (this.match(tt.string)) {\n        node.key = this.parseStringLiteral(keyName);\n      } else {\n        node.key = this.parseIdentifier(true);\n      }\n      this.expect(tt.colon);\n\n      if (!this.match(tt.string)) {\n        throw this.unexpected(\n          this.state.start,\n          Errors.ModuleAttributeInvalidValue,\n        );\n      }\n      node.value = this.parseStringLiteral(this.state.value);\n      this.finishNode<N.ImportAttribute>(node, \"ImportAttribute\");\n      attrs.push(node);\n    } while (this.eat(tt.comma));\n\n    return attrs;\n  }\n\n  /**\n   * parse module attributes\n   * @deprecated It will be removed in Babel 8\n   * @returns\n   * @memberof StatementParser\n   */\n  maybeParseModuleAttributes() {\n    if (this.match(tt._with) && !this.hasPrecedingLineBreak()) {\n      this.expectPlugin(\"moduleAttributes\");\n      this.next();\n    } else {\n      if (this.hasPlugin(\"moduleAttributes\")) return [];\n      return null;\n    }\n    const attrs = [];\n    const attributes = new Set();\n    do {\n      const node = this.startNode();\n      node.key = this.parseIdentifier(true);\n\n      if (node.key.name !== \"type\") {\n        this.raise(\n          node.key.start,\n          Errors.ModuleAttributeDifferentFromType,\n          node.key.name,\n        );\n      }\n\n      if (attributes.has(node.key.name)) {\n        this.raise(\n          node.key.start,\n          Errors.ModuleAttributesWithDuplicateKeys,\n          node.key.name,\n        );\n      }\n      attributes.add(node.key.name);\n      this.expect(tt.colon);\n      if (!this.match(tt.string)) {\n        throw this.unexpected(\n          this.state.start,\n          Errors.ModuleAttributeInvalidValue,\n        );\n      }\n      node.value = this.parseStringLiteral(this.state.value);\n      this.finishNode(node, \"ImportAttribute\");\n      attrs.push(node);\n    } while (this.eat(tt.comma));\n\n    return attrs;\n  }\n\n  maybeParseImportAssertions() {\n    // [no LineTerminator here] AssertClause\n    if (this.isContextual(\"assert\") && !this.hasPrecedingLineBreak()) {\n      this.expectPlugin(\"importAssertions\");\n      this.next(); // eat `assert`\n    } else {\n      if (this.hasPlugin(\"importAssertions\")) return [];\n      return null;\n    }\n    // https://tc39.es/proposal-import-assertions/#prod-AssertClause\n    this.eat(tt.braceL);\n    const attrs = this.parseAssertEntries();\n    this.eat(tt.braceR);\n\n    return attrs;\n  }\n\n  maybeParseDefaultImportSpecifier(node: N.ImportDeclaration): boolean {\n    if (this.shouldParseDefaultImport(node)) {\n      // import defaultObj, { x, y as z } from '...'\n      this.parseImportSpecifierLocal(\n        node,\n        this.startNode(),\n        \"ImportDefaultSpecifier\",\n        \"default import specifier\",\n      );\n      return true;\n    }\n    return false;\n  }\n\n  maybeParseStarImportSpecifier(node: N.ImportDeclaration): boolean {\n    if (this.match(tt.star)) {\n      const specifier = this.startNode();\n      this.next();\n      this.expectContextual(\"as\");\n\n      this.parseImportSpecifierLocal(\n        node,\n        specifier,\n        \"ImportNamespaceSpecifier\",\n        \"import namespace specifier\",\n      );\n      return true;\n    }\n    return false;\n  }\n\n  parseNamedImportSpecifiers(node: N.ImportDeclaration) {\n    let first = true;\n    this.expect(tt.braceL);\n    while (!this.eat(tt.braceR)) {\n      if (first) {\n        first = false;\n      } else {\n        // Detect an attempt to deep destructure\n        if (this.eat(tt.colon)) {\n          throw this.raise(this.state.start, Errors.DestructureNamedImport);\n        }\n\n        this.expect(tt.comma);\n        if (this.eat(tt.braceR)) break;\n      }\n\n      this.parseImportSpecifier(node);\n    }\n  }\n\n  // https://tc39.es/ecma262/#prod-ImportSpecifier\n  parseImportSpecifier(node: N.ImportDeclaration): void {\n    const specifier = this.startNode();\n    const importedIsString = this.match(tt.string);\n    specifier.imported = this.parseModuleExportName();\n    if (this.eatContextual(\"as\")) {\n      specifier.local = this.parseIdentifier();\n    } else {\n      const { imported } = specifier;\n      if (importedIsString) {\n        throw this.raise(\n          specifier.start,\n          Errors.ImportBindingIsString,\n          imported.value,\n        );\n      }\n      this.checkReservedWord(imported.name, specifier.start, true, true);\n      specifier.local = imported.__clone();\n    }\n    this.checkLVal(specifier.local, \"import specifier\", BIND_LEXICAL);\n    node.specifiers.push(this.finishNode(specifier, \"ImportSpecifier\"));\n  }\n\n  // This is used in flow and typescript plugin\n  // Determine whether a parameter is a this param\n  isThisParam(\n    param: N.Pattern | N.Identifier | N.TSParameterProperty,\n  ): boolean {\n    return param.type === \"Identifier\" && param.name === \"this\";\n  }\n}\n","// @flow\n\nimport type { Options } from \"../options\";\nimport type { File /*::, JSXOpeningElement */ } from \"../types\";\nimport type { PluginList } from \"../plugin-utils\";\nimport { getOptions } from \"../options\";\nimport StatementParser from \"./statement\";\nimport ScopeHandler from \"../util/scope\";\n\nexport type PluginsMap = Map<string, { [string]: any }>;\n\nexport default class Parser extends StatementParser {\n  // Forward-declaration so typescript plugin can override jsx plugin\n  /*::\n  +jsxParseOpeningElementAfterName: (\n    node: JSXOpeningElement,\n  ) => JSXOpeningElement;\n  */\n\n  constructor(options: ?Options, input: string) {\n    options = getOptions(options);\n    super(options, input);\n\n    this.options = options;\n    this.initializeScopes();\n    this.plugins = pluginsMap(this.options.plugins);\n    this.filename = options.sourceFilename;\n  }\n\n  // This can be overwritten, for example, by the TypeScript plugin.\n  getScopeHandler(): Class<ScopeHandler<*>> {\n    return ScopeHandler;\n  }\n\n  parse(): File {\n    this.enterInitialScopes();\n    const file = this.startNode();\n    const program = this.startNode();\n    this.nextToken();\n    file.errors = null;\n    this.parseTopLevel(file, program);\n    file.errors = this.state.errors;\n    return file;\n  }\n}\n\nfunction pluginsMap(plugins: PluginList): PluginsMap {\n  const pluginMap: PluginsMap = new Map();\n  for (const plugin of plugins) {\n    const [name, options] = Array.isArray(plugin) ? plugin : [plugin, {}];\n    if (!pluginMap.has(name)) pluginMap.set(name, options || {});\n  }\n  return pluginMap;\n}\n","// @flow\n\n// A recursive descent parser operates by defining functions for all\n// syntactic elements, and recursively calling those, each function\n// advancing the input stream and returning an AST node. Precedence\n// of constructs (for example, the fact that `!x[1]` means `!(x[1])`\n// instead of `(!x)[1]` is handled by the fact that the parser\n// function that parses unary prefix operators is called first, and\n// in turn calls the function that parses `[]` subscripts — that\n// way, it'll receive the node for `x[1]` already parsed, and wraps\n// *that* in the unary operator node.\n//\n// Acorn uses an [operator precedence parser][opp] to handle binary\n// operator precedence, because it is much more compact than using\n// the technique outlined above, which uses different, nesting\n// functions to specify precedence, for all of the ten binary\n// precedence levels that JavaScript defines.\n//\n// [opp]: http://en.wikipedia.org/wiki/Operator-precedence_parser\n\nimport { types as tt, type TokenType } from \"../tokenizer/types\";\nimport { types as ct } from \"../tokenizer/context\";\nimport * as N from \"../types\";\nimport LValParser from \"./lval\";\nimport {\n  isKeyword,\n  isReservedWord,\n  isStrictReservedWord,\n  isStrictBindReservedWord,\n  isIdentifierStart,\n  canBeReservedWord,\n} from \"../util/identifier\";\nimport type { Pos } from \"../util/location\";\nimport { Position } from \"../util/location\";\nimport * as charCodes from \"charcodes\";\nimport {\n  BIND_OUTSIDE,\n  BIND_VAR,\n  SCOPE_ARROW,\n  SCOPE_CLASS,\n  SCOPE_DIRECT_SUPER,\n  SCOPE_FUNCTION,\n  SCOPE_SUPER,\n  SCOPE_PROGRAM,\n} from \"../util/scopeflags\";\nimport { ExpressionErrors } from \"./util\";\nimport {\n  PARAM_AWAIT,\n  PARAM_IN,\n  PARAM_RETURN,\n  PARAM,\n  functionFlags,\n} from \"../util/production-parameter\";\nimport {\n  newArrowHeadScope,\n  newAsyncArrowScope,\n  newExpressionScope,\n} from \"../util/expression-scope\";\nimport { Errors, SourceTypeModuleErrors } from \"./error\";\n\n/*::\nimport type { SourceType } from \"../options\";\n*/\n\nexport default class ExpressionParser extends LValParser {\n  // Forward-declaration: defined in statement.js\n  /*::\n  +parseBlock: (\n    allowDirectives?: boolean,\n    createNewLexicalScope?: boolean,\n    afterBlockParse?: (hasStrictModeDirective: boolean) => void,\n  ) => N.BlockStatement;\n  +parseClass: (\n    node: N.Class,\n    isStatement: boolean,\n    optionalId?: boolean,\n  ) => N.Class;\n  +parseDecorators: (allowExport?: boolean) => void;\n  +parseFunction: <T: N.NormalFunction>(\n    node: T,\n    statement?: number,\n    allowExpressionBody?: boolean,\n    isAsync?: boolean,\n  ) => T;\n  +parseFunctionParams: (node: N.Function, allowModifiers?: boolean) => void;\n  +takeDecorators: (node: N.HasDecorators) => void;\n  +parseBlockOrModuleBlockBody: (\n    body: N.Statement[],\n    directives: ?(N.Directive[]),\n    topLevel: boolean,\n    end: TokenType,\n    afterBlockParse?: (hasStrictModeDirective: boolean) => void\n  ) => void\n  +parseProgram: (\n    program: N.Program, end: TokenType, sourceType?: SourceType\n  ) => N.Program\n  */\n\n  // For object literal, check if property __proto__ has been used more than once.\n  // If the expression is a destructuring assignment, then __proto__ may appear\n  // multiple times. Otherwise, __proto__ is a duplicated key.\n\n  // For record expression, check if property __proto__ exists\n\n  checkProto(\n    prop: N.ObjectMember | N.SpreadElement,\n    isRecord: boolean,\n    protoRef: { used: boolean },\n    refExpressionErrors: ?ExpressionErrors,\n  ): void {\n    if (\n      prop.type === \"SpreadElement\" ||\n      this.isObjectMethod(prop) ||\n      prop.computed ||\n      // $FlowIgnore\n      prop.shorthand\n    ) {\n      return;\n    }\n\n    const key = prop.key;\n    // It is either an Identifier or a String/NumericLiteral\n    const name = key.type === \"Identifier\" ? key.name : key.value;\n\n    if (name === \"__proto__\") {\n      if (isRecord) {\n        this.raise(key.start, Errors.RecordNoProto);\n        return;\n      }\n      if (protoRef.used) {\n        if (refExpressionErrors) {\n          // Store the first redefinition's position, otherwise ignore because\n          // we are parsing ambiguous pattern\n          if (refExpressionErrors.doubleProto === -1) {\n            refExpressionErrors.doubleProto = key.start;\n          }\n        } else {\n          this.raise(key.start, Errors.DuplicateProto);\n        }\n      }\n\n      protoRef.used = true;\n    }\n  }\n\n  shouldExitDescending(expr: N.Expression, potentialArrowAt: number): boolean {\n    return (\n      expr.type === \"ArrowFunctionExpression\" && expr.start === potentialArrowAt\n    );\n  }\n\n  // Convenience method to parse an Expression only\n  getExpression(): N.Expression & N.ParserOutput {\n    let paramFlags = PARAM;\n    if (this.hasPlugin(\"topLevelAwait\") && this.inModule) {\n      paramFlags |= PARAM_AWAIT;\n    }\n    this.scope.enter(SCOPE_PROGRAM);\n    this.prodParam.enter(paramFlags);\n    this.nextToken();\n    const expr = this.parseExpression();\n    if (!this.match(tt.eof)) {\n      this.unexpected();\n    }\n    expr.comments = this.state.comments;\n    expr.errors = this.state.errors;\n    if (this.options.tokens) {\n      expr.tokens = this.tokens;\n    }\n    return expr;\n  }\n\n  // ### Expression parsing\n\n  // These nest, from the most general expression type at the top to\n  // 'atomic', nondivisible expression types at the bottom. Most of\n  // the functions will simply let the function (s) below them parse,\n  // and, *if* the syntactic construct they handle is present, wrap\n  // the AST node that the inner parser gave them in another node.\n\n  // Parse a full expression.\n  // - `disallowIn`\n  //   is used to forbid the `in` operator (in for loops initialization expressions)\n  //   When `disallowIn` is true, the production parameter [In] is not present.\n\n  // - `refExpressionErrors `\n  //   provides reference for storing '=' operator inside shorthand\n  //   property assignment in contexts where both object expression\n  //   and object pattern might appear (so it's possible to raise\n  //   delayed syntax error at correct position).\n\n  parseExpression(\n    disallowIn?: boolean,\n    refExpressionErrors?: ExpressionErrors,\n  ): N.Expression {\n    if (disallowIn) {\n      return this.disallowInAnd(() =>\n        this.parseExpressionBase(refExpressionErrors),\n      );\n    }\n    return this.allowInAnd(() => this.parseExpressionBase(refExpressionErrors));\n  }\n\n  // https://tc39.es/ecma262/#prod-Expression\n  parseExpressionBase(refExpressionErrors?: ExpressionErrors): N.Expression {\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n    const expr = this.parseMaybeAssign(refExpressionErrors);\n    if (this.match(tt.comma)) {\n      const node = this.startNodeAt(startPos, startLoc);\n      node.expressions = [expr];\n      while (this.eat(tt.comma)) {\n        node.expressions.push(this.parseMaybeAssign(refExpressionErrors));\n      }\n      this.toReferencedList(node.expressions);\n      return this.finishNode(node, \"SequenceExpression\");\n    }\n    return expr;\n  }\n\n  // Set [~In] parameter for assignment expression\n  parseMaybeAssignDisallowIn(\n    refExpressionErrors?: ?ExpressionErrors,\n    afterLeftParse?: Function,\n    refNeedsArrowPos?: ?Pos,\n  ) {\n    return this.disallowInAnd(() =>\n      this.parseMaybeAssign(\n        refExpressionErrors,\n        afterLeftParse,\n        refNeedsArrowPos,\n      ),\n    );\n  }\n\n  // Set [+In] parameter for assignment expression\n  parseMaybeAssignAllowIn(\n    refExpressionErrors?: ?ExpressionErrors,\n    afterLeftParse?: Function,\n    refNeedsArrowPos?: ?Pos,\n  ) {\n    return this.allowInAnd(() =>\n      this.parseMaybeAssign(\n        refExpressionErrors,\n        afterLeftParse,\n        refNeedsArrowPos,\n      ),\n    );\n  }\n\n  // Parse an assignment expression. This includes applications of\n  // operators like `+=`.\n\n  // https://tc39.es/ecma262/#prod-AssignmentExpression\n  parseMaybeAssign(\n    refExpressionErrors?: ?ExpressionErrors,\n    afterLeftParse?: Function,\n    refNeedsArrowPos?: ?Pos,\n  ): N.Expression {\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n    if (this.isContextual(\"yield\")) {\n      if (this.prodParam.hasYield) {\n        let left = this.parseYield();\n        if (afterLeftParse) {\n          left = afterLeftParse.call(this, left, startPos, startLoc);\n        }\n        return left;\n      }\n    }\n\n    let ownExpressionErrors;\n    if (refExpressionErrors) {\n      ownExpressionErrors = false;\n    } else {\n      refExpressionErrors = new ExpressionErrors();\n      ownExpressionErrors = true;\n    }\n\n    if (this.match(tt.parenL) || this.match(tt.name)) {\n      this.state.potentialArrowAt = this.state.start;\n    }\n\n    let left = this.parseMaybeConditional(\n      refExpressionErrors,\n      refNeedsArrowPos,\n    );\n    if (afterLeftParse) {\n      left = afterLeftParse.call(this, left, startPos, startLoc);\n    }\n    if (this.state.type.isAssign) {\n      const node = this.startNodeAt(startPos, startLoc);\n      const operator = this.state.value;\n      node.operator = operator;\n\n      if (this.match(tt.eq)) {\n        node.left = this.toAssignable(left, /* isLHS */ true);\n        refExpressionErrors.doubleProto = -1; // reset because double __proto__ is valid in assignment expression\n      } else {\n        node.left = left;\n      }\n\n      if (refExpressionErrors.shorthandAssign >= node.left.start) {\n        refExpressionErrors.shorthandAssign = -1; // reset because shorthand default was used correctly\n      }\n\n      this.checkLVal(left, \"assignment expression\");\n\n      this.next();\n      node.right = this.parseMaybeAssign();\n      return this.finishNode(node, \"AssignmentExpression\");\n    } else if (ownExpressionErrors) {\n      this.checkExpressionErrors(refExpressionErrors, true);\n    }\n\n    return left;\n  }\n\n  // Parse a ternary conditional (`?:`) operator.\n  // https://tc39.es/ecma262/#prod-ConditionalExpression\n\n  parseMaybeConditional(\n    refExpressionErrors: ExpressionErrors,\n    refNeedsArrowPos?: ?Pos,\n  ): N.Expression {\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n    const potentialArrowAt = this.state.potentialArrowAt;\n    const expr = this.parseExprOps(refExpressionErrors);\n\n    if (this.shouldExitDescending(expr, potentialArrowAt)) {\n      return expr;\n    }\n\n    return this.parseConditional(expr, startPos, startLoc, refNeedsArrowPos);\n  }\n\n  parseConditional(\n    expr: N.Expression,\n    startPos: number,\n    startLoc: Position,\n    // FIXME: Disabling this for now since can't seem to get it to play nicely\n    // eslint-disable-next-line no-unused-vars\n    refNeedsArrowPos?: ?Pos,\n  ): N.Expression {\n    if (this.eat(tt.question)) {\n      const node = this.startNodeAt(startPos, startLoc);\n      node.test = expr;\n      node.consequent = this.parseMaybeAssignAllowIn();\n      this.expect(tt.colon);\n      node.alternate = this.parseMaybeAssign();\n      return this.finishNode(node, \"ConditionalExpression\");\n    }\n    return expr;\n  }\n\n  // Start the precedence parser.\n  // https://tc39.es/ecma262/#prod-ShortCircuitExpression\n\n  parseExprOps(refExpressionErrors: ExpressionErrors): N.Expression {\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n    const potentialArrowAt = this.state.potentialArrowAt;\n    const expr = this.parseMaybeUnary(refExpressionErrors);\n\n    if (this.shouldExitDescending(expr, potentialArrowAt)) {\n      return expr;\n    }\n\n    return this.parseExprOp(expr, startPos, startLoc, -1);\n  }\n\n  // Parse binary operators with the operator precedence parsing\n  // algorithm. `left` is the left-hand side of the operator.\n  // `minPrec` provides context that allows the function to stop and\n  // defer further parser to one of its callers when it encounters an\n  // operator that has a lower precedence than the set it is parsing.\n\n  parseExprOp(\n    left: N.Expression,\n    leftStartPos: number,\n    leftStartLoc: Position,\n    minPrec: number,\n  ): N.Expression {\n    let prec = this.state.type.binop;\n    if (prec != null && (this.prodParam.hasIn || !this.match(tt._in))) {\n      if (prec > minPrec) {\n        const op = this.state.type;\n        if (op === tt.pipeline) {\n          this.expectPlugin(\"pipelineOperator\");\n          if (this.state.inFSharpPipelineDirectBody) {\n            return left;\n          }\n          this.state.inPipeline = true;\n          this.checkPipelineAtInfixOperator(left, leftStartPos);\n        }\n        const node = this.startNodeAt(leftStartPos, leftStartLoc);\n        node.left = left;\n        node.operator = this.state.value;\n\n        const logical = op === tt.logicalOR || op === tt.logicalAND;\n        const coalesce = op === tt.nullishCoalescing;\n\n        if (coalesce) {\n          // Handle the precedence of `tt.coalesce` as equal to the range of logical expressions.\n          // In other words, `node.right` shouldn't contain logical expressions in order to check the mixed error.\n          prec = ((tt.logicalAND: any): { binop: number }).binop;\n        }\n\n        this.next();\n\n        if (\n          op === tt.pipeline &&\n          this.getPluginOption(\"pipelineOperator\", \"proposal\") === \"minimal\"\n        ) {\n          if (\n            this.match(tt.name) &&\n            this.state.value === \"await\" &&\n            this.prodParam.hasAwait\n          ) {\n            throw this.raise(\n              this.state.start,\n              Errors.UnexpectedAwaitAfterPipelineBody,\n            );\n          }\n        }\n\n        node.right = this.parseExprOpRightExpr(op, prec);\n        this.finishNode(\n          node,\n          logical || coalesce ? \"LogicalExpression\" : \"BinaryExpression\",\n        );\n        /* this check is for all ?? operators\n         * a ?? b && c for this example\n         * when op is coalesce and nextOp is logical (&&), throw at the pos of nextOp that it can not be mixed.\n         * Symmetrically it also throws when op is logical and nextOp is coalesce\n         */\n        const nextOp = this.state.type;\n        if (\n          (coalesce && (nextOp === tt.logicalOR || nextOp === tt.logicalAND)) ||\n          (logical && nextOp === tt.nullishCoalescing)\n        ) {\n          throw this.raise(this.state.start, Errors.MixingCoalesceWithLogical);\n        }\n\n        return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec);\n      }\n    }\n    return left;\n  }\n\n  // Helper function for `parseExprOp`. Parse the right-hand side of binary-\n  // operator expressions, then apply any operator-specific functions.\n\n  parseExprOpRightExpr(op: TokenType, prec: number): N.Expression {\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n    switch (op) {\n      case tt.pipeline:\n        switch (this.getPluginOption(\"pipelineOperator\", \"proposal\")) {\n          case \"smart\":\n            return this.withTopicPermittingContext(() => {\n              return this.parseSmartPipelineBody(\n                this.parseExprOpBaseRightExpr(op, prec),\n                startPos,\n                startLoc,\n              );\n            });\n          case \"fsharp\":\n            return this.withSoloAwaitPermittingContext(() => {\n              return this.parseFSharpPipelineBody(prec);\n            });\n        }\n      // falls through\n\n      default:\n        return this.parseExprOpBaseRightExpr(op, prec);\n    }\n  }\n\n  // Helper function for `parseExprOpRightExpr`. Parse the right-hand side of\n  // binary-operator expressions without applying any operator-specific functions.\n\n  parseExprOpBaseRightExpr(op: TokenType, prec: number): N.Expression {\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n\n    return this.parseExprOp(\n      this.parseMaybeUnary(),\n      startPos,\n      startLoc,\n      op.rightAssociative ? prec - 1 : prec,\n    );\n  }\n\n  checkExponentialAfterUnary(node: N.AwaitExpression | N.UnaryExpression) {\n    if (this.match(tt.exponent)) {\n      this.raise(\n        node.argument.start,\n        Errors.UnexpectedTokenUnaryExponentiation,\n      );\n    }\n  }\n\n  // Parse unary operators, both prefix and postfix.\n  // https://tc39.es/ecma262/#prod-UnaryExpression\n  parseMaybeUnary(\n    refExpressionErrors: ?ExpressionErrors,\n    sawUnary?: boolean,\n  ): N.Expression {\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n    const isAwait = this.isContextual(\"await\");\n\n    if (isAwait && this.isAwaitAllowed()) {\n      this.next();\n      const expr = this.parseAwait(startPos, startLoc);\n      if (!sawUnary) this.checkExponentialAfterUnary(expr);\n      return expr;\n    }\n    if (\n      this.isContextual(\"module\") &&\n      this.lookaheadCharCode() === charCodes.leftCurlyBrace &&\n      !this.hasFollowingLineBreak()\n    ) {\n      return this.parseModuleExpression();\n    }\n    const update = this.match(tt.incDec);\n    const node = this.startNode();\n    if (this.state.type.prefix) {\n      node.operator = this.state.value;\n      node.prefix = true;\n\n      if (this.match(tt._throw)) {\n        this.expectPlugin(\"throwExpressions\");\n      }\n      const isDelete = this.match(tt._delete);\n      this.next();\n\n      node.argument = this.parseMaybeUnary(null, true);\n\n      this.checkExpressionErrors(refExpressionErrors, true);\n\n      if (this.state.strict && isDelete) {\n        const arg = node.argument;\n\n        if (arg.type === \"Identifier\") {\n          this.raise(node.start, Errors.StrictDelete);\n        } else if (this.hasPropertyAsPrivateName(arg)) {\n          this.raise(node.start, Errors.DeletePrivateField);\n        }\n      }\n\n      if (!update) {\n        if (!sawUnary) this.checkExponentialAfterUnary(node);\n        return this.finishNode(node, \"UnaryExpression\");\n      }\n    }\n\n    const expr = this.parseUpdate(node, update, refExpressionErrors);\n\n    if (isAwait) {\n      const startsExpr = this.hasPlugin(\"v8intrinsic\")\n        ? this.state.type.startsExpr\n        : this.state.type.startsExpr && !this.match(tt.modulo);\n      if (startsExpr && !this.isAmbiguousAwait()) {\n        this.raiseOverwrite(\n          startPos,\n          this.hasPlugin(\"topLevelAwait\")\n            ? Errors.AwaitNotInAsyncContext\n            : Errors.AwaitNotInAsyncFunction,\n        );\n        return this.parseAwait(startPos, startLoc);\n      }\n    }\n\n    return expr;\n  }\n\n  // https://tc39.es/ecma262/#prod-UpdateExpression\n  parseUpdate(\n    node: N.Expression,\n    update: boolean,\n    refExpressionErrors: ?ExpressionErrors,\n  ): N.Expression {\n    if (update) {\n      this.checkLVal(node.argument, \"prefix operation\");\n      return this.finishNode(node, \"UpdateExpression\");\n    }\n\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n    let expr = this.parseExprSubscripts(refExpressionErrors);\n    if (this.checkExpressionErrors(refExpressionErrors, false)) return expr;\n    while (this.state.type.postfix && !this.canInsertSemicolon()) {\n      const node = this.startNodeAt(startPos, startLoc);\n      node.operator = this.state.value;\n      node.prefix = false;\n      node.argument = expr;\n      this.checkLVal(expr, \"postfix operation\");\n      this.next();\n      expr = this.finishNode(node, \"UpdateExpression\");\n    }\n    return expr;\n  }\n\n  // Parse call, dot, and `[]`-subscript expressions.\n  // https://tc39.es/ecma262/#prod-LeftHandSideExpression\n  parseExprSubscripts(refExpressionErrors: ?ExpressionErrors): N.Expression {\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n    const potentialArrowAt = this.state.potentialArrowAt;\n    const expr = this.parseExprAtom(refExpressionErrors);\n\n    if (this.shouldExitDescending(expr, potentialArrowAt)) {\n      return expr;\n    }\n\n    return this.parseSubscripts(expr, startPos, startLoc);\n  }\n\n  parseSubscripts(\n    base: N.Expression,\n    startPos: number,\n    startLoc: Position,\n    noCalls?: ?boolean,\n  ): N.Expression {\n    const state = {\n      optionalChainMember: false,\n      maybeAsyncArrow: this.atPossibleAsyncArrow(base),\n      stop: false,\n    };\n    do {\n      base = this.parseSubscript(base, startPos, startLoc, noCalls, state);\n\n      // After parsing a subscript, this isn't \"async\" for sure.\n      state.maybeAsyncArrow = false;\n    } while (!state.stop);\n    return base;\n  }\n\n  /**\n   * @param state Set 'state.stop = true' to indicate that we should stop parsing subscripts.\n   *   state.optionalChainMember to indicate that the member is currently in OptionalChain\n   */\n  parseSubscript(\n    base: N.Expression,\n    startPos: number,\n    startLoc: Position,\n    noCalls: ?boolean,\n    state: N.ParseSubscriptState,\n  ): N.Expression {\n    if (!noCalls && this.eat(tt.doubleColon)) {\n      return this.parseBind(base, startPos, startLoc, noCalls, state);\n    } else if (this.match(tt.backQuote)) {\n      return this.parseTaggedTemplateExpression(\n        base,\n        startPos,\n        startLoc,\n        state,\n      );\n    }\n\n    let optional = false;\n    if (this.match(tt.questionDot)) {\n      if (noCalls && this.lookaheadCharCode() === charCodes.leftParenthesis) {\n        // stop at `?.` when parsing `new a?.()`\n        state.stop = true;\n        return base;\n      }\n      state.optionalChainMember = optional = true;\n      this.next();\n    }\n\n    if (!noCalls && this.match(tt.parenL)) {\n      return this.parseCoverCallAndAsyncArrowHead(\n        base,\n        startPos,\n        startLoc,\n        state,\n        optional,\n      );\n    } else if (optional || this.match(tt.bracketL) || this.eat(tt.dot)) {\n      return this.parseMember(base, startPos, startLoc, state, optional);\n    } else {\n      state.stop = true;\n      return base;\n    }\n  }\n\n  // base[?Yield, ?Await] [ Expression[+In, ?Yield, ?Await] ]\n  // base[?Yield, ?Await] . IdentifierName\n  // base[?Yield, ?Await] . PrivateIdentifier\n  //   where `base` is one of CallExpression, MemberExpression and OptionalChain\n  parseMember(\n    base: N.Expression,\n    startPos: number,\n    startLoc: Position,\n    state: N.ParseSubscriptState,\n    optional: boolean,\n  ): N.OptionalMemberExpression | N.MemberExpression {\n    const node = this.startNodeAt(startPos, startLoc);\n    const computed = this.eat(tt.bracketL);\n    node.object = base;\n    node.computed = computed;\n    const privateName =\n      !computed && this.match(tt.privateName) && this.state.value;\n    const property = computed\n      ? this.parseExpression()\n      : privateName\n      ? this.parsePrivateName()\n      : this.parseIdentifier(true);\n\n    if (privateName !== false) {\n      if (node.object.type === \"Super\") {\n        this.raise(startPos, Errors.SuperPrivateField);\n      }\n      this.classScope.usePrivateName(privateName, property.start);\n    }\n    node.property = property;\n\n    if (computed) {\n      this.expect(tt.bracketR);\n    }\n\n    if (state.optionalChainMember) {\n      node.optional = optional;\n      return this.finishNode(node, \"OptionalMemberExpression\");\n    } else {\n      return this.finishNode(node, \"MemberExpression\");\n    }\n  }\n\n  // https://github.com/tc39/proposal-bind-operator#syntax\n  parseBind(\n    base: N.Expression,\n    startPos: number,\n    startLoc: Position,\n    noCalls: ?boolean,\n    state: N.ParseSubscriptState,\n  ): N.Expression {\n    const node = this.startNodeAt(startPos, startLoc);\n    node.object = base;\n    node.callee = this.parseNoCallExpr();\n    state.stop = true;\n    return this.parseSubscripts(\n      this.finishNode(node, \"BindExpression\"),\n      startPos,\n      startLoc,\n      noCalls,\n    );\n  }\n\n  // https://tc39.es/ecma262/#prod-CoverCallExpressionAndAsyncArrowHead\n  // CoverCallExpressionAndAsyncArrowHead\n  // CallExpression[?Yield, ?Await] Arguments[?Yield, ?Await]\n  // OptionalChain[?Yield, ?Await] Arguments[?Yield, ?Await]\n  parseCoverCallAndAsyncArrowHead(\n    base: N.Expression,\n    startPos: number,\n    startLoc: Position,\n    state: N.ParseSubscriptState,\n    optional: boolean,\n  ): N.Expression {\n    const oldMaybeInArrowParameters = this.state.maybeInArrowParameters;\n    let refExpressionErrors = null;\n\n    this.state.maybeInArrowParameters = true;\n    this.next(); // eat `(`\n\n    let node = this.startNodeAt(startPos, startLoc);\n    node.callee = base;\n\n    if (state.maybeAsyncArrow) {\n      this.expressionScope.enter(newAsyncArrowScope());\n      refExpressionErrors = new ExpressionErrors();\n    }\n\n    if (state.optionalChainMember) {\n      node.optional = optional;\n    }\n\n    if (optional) {\n      node.arguments = this.parseCallExpressionArguments(tt.parenR);\n    } else {\n      node.arguments = this.parseCallExpressionArguments(\n        tt.parenR,\n        base.type === \"Import\",\n        base.type !== \"Super\",\n        node,\n        refExpressionErrors,\n      );\n    }\n    this.finishCallExpression(node, state.optionalChainMember);\n\n    if (state.maybeAsyncArrow && this.shouldParseAsyncArrow() && !optional) {\n      state.stop = true;\n      this.expressionScope.validateAsPattern();\n      this.expressionScope.exit();\n      node = this.parseAsyncArrowFromCallExpression(\n        this.startNodeAt(startPos, startLoc),\n        node,\n      );\n    } else {\n      if (state.maybeAsyncArrow) {\n        this.checkExpressionErrors(refExpressionErrors, true);\n        this.expressionScope.exit();\n      }\n      this.toReferencedArguments(node);\n    }\n\n    this.state.maybeInArrowParameters = oldMaybeInArrowParameters;\n\n    return node;\n  }\n\n  toReferencedArguments(\n    node: N.CallExpression | N.OptionalCallExpression,\n    isParenthesizedExpr?: boolean,\n  ) {\n    this.toReferencedListDeep(node.arguments, isParenthesizedExpr);\n  }\n\n  // MemberExpression [?Yield, ?Await] TemplateLiteral[?Yield, ?Await, +Tagged]\n  // CallExpression [?Yield, ?Await] TemplateLiteral[?Yield, ?Await, +Tagged]\n  parseTaggedTemplateExpression(\n    base: N.Expression,\n    startPos: number,\n    startLoc: Position,\n    state: N.ParseSubscriptState,\n  ): N.TaggedTemplateExpression {\n    const node: N.TaggedTemplateExpression = this.startNodeAt(\n      startPos,\n      startLoc,\n    );\n    node.tag = base;\n    node.quasi = this.parseTemplate(true);\n    if (state.optionalChainMember) {\n      this.raise(startPos, Errors.OptionalChainingNoTemplate);\n    }\n    return this.finishNode(node, \"TaggedTemplateExpression\");\n  }\n\n  atPossibleAsyncArrow(base: N.Expression): boolean {\n    return (\n      base.type === \"Identifier\" &&\n      base.name === \"async\" &&\n      this.state.lastTokEnd === base.end &&\n      !this.canInsertSemicolon() &&\n      // check there are no escape sequences, such as \\u{61}sync\n      base.end - base.start === 5 &&\n      base.start === this.state.potentialArrowAt\n    );\n  }\n\n  finishCallExpression<T: N.CallExpression | N.OptionalCallExpression>(\n    node: T,\n    optional: boolean,\n  ): N.Expression {\n    if (node.callee.type === \"Import\") {\n      if (node.arguments.length === 2) {\n        if (process.env.BABEL_8_BREAKING) {\n          this.expectPlugin(\"importAssertions\");\n        } else {\n          if (!this.hasPlugin(\"moduleAttributes\")) {\n            this.expectPlugin(\"importAssertions\");\n          }\n        }\n      }\n      if (node.arguments.length === 0 || node.arguments.length > 2) {\n        this.raise(\n          node.start,\n          Errors.ImportCallArity,\n          this.hasPlugin(\"importAssertions\") ||\n            this.hasPlugin(\"moduleAttributes\")\n            ? \"one or two arguments\"\n            : \"one argument\",\n        );\n      } else {\n        for (const arg of node.arguments) {\n          if (arg.type === \"SpreadElement\") {\n            this.raise(arg.start, Errors.ImportCallSpreadArgument);\n          }\n        }\n      }\n    }\n    return this.finishNode(\n      node,\n      optional ? \"OptionalCallExpression\" : \"CallExpression\",\n    );\n  }\n\n  parseCallExpressionArguments(\n    close: TokenType,\n    dynamicImport?: boolean,\n    allowPlaceholder?: boolean,\n    nodeForExtra?: ?N.Node,\n    refExpressionErrors?: ?ExpressionErrors,\n  ): $ReadOnlyArray<?N.Expression> {\n    const elts = [];\n    let first = true;\n    const oldInFSharpPipelineDirectBody = this.state.inFSharpPipelineDirectBody;\n    this.state.inFSharpPipelineDirectBody = false;\n\n    while (!this.eat(close)) {\n      if (first) {\n        first = false;\n      } else {\n        this.expect(tt.comma);\n        if (this.match(close)) {\n          if (\n            dynamicImport &&\n            !this.hasPlugin(\"importAssertions\") &&\n            !this.hasPlugin(\"moduleAttributes\")\n          ) {\n            this.raise(\n              this.state.lastTokStart,\n              Errors.ImportCallArgumentTrailingComma,\n            );\n          }\n          if (nodeForExtra) {\n            this.addExtra(\n              nodeForExtra,\n              \"trailingComma\",\n              this.state.lastTokStart,\n            );\n          }\n          this.next();\n          break;\n        }\n      }\n\n      elts.push(\n        this.parseExprListItem(\n          false,\n          refExpressionErrors,\n          { start: 0 },\n          allowPlaceholder,\n        ),\n      );\n    }\n\n    this.state.inFSharpPipelineDirectBody = oldInFSharpPipelineDirectBody;\n\n    return elts;\n  }\n\n  shouldParseAsyncArrow(): boolean {\n    return this.match(tt.arrow) && !this.canInsertSemicolon();\n  }\n\n  parseAsyncArrowFromCallExpression(\n    node: N.ArrowFunctionExpression,\n    call: N.CallExpression,\n  ): N.ArrowFunctionExpression {\n    this.expect(tt.arrow);\n    this.parseArrowExpression(\n      node,\n      call.arguments,\n      true,\n      call.extra?.trailingComma,\n    );\n    return node;\n  }\n\n  // Parse a no-call expression (like argument of `new` or `::` operators).\n  // https://tc39.es/ecma262/#prod-MemberExpression\n  parseNoCallExpr(): N.Expression {\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n    return this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true);\n  }\n\n  // Parse an atomic expression — either a single token that is an\n  // expression, an expression started by a keyword like `function` or\n  // `new`, or an expression wrapped in punctuation like `()`, `[]`,\n  // or `{}`.\n\n  // https://tc39.es/ecma262/#prod-PrimaryExpression\n  // https://tc39.es/ecma262/#prod-AsyncArrowFunction\n  // PrimaryExpression\n  // Super\n  // Import\n  // AsyncArrowFunction\n\n  parseExprAtom(refExpressionErrors?: ?ExpressionErrors): N.Expression {\n    let node;\n\n    switch (this.state.type) {\n      case tt._super:\n        return this.parseSuper();\n\n      case tt._import:\n        node = this.startNode();\n        this.next();\n\n        if (this.match(tt.dot)) {\n          return this.parseImportMetaProperty(node);\n        }\n\n        if (!this.match(tt.parenL)) {\n          this.raise(this.state.lastTokStart, Errors.UnsupportedImport);\n        }\n        return this.finishNode(node, \"Import\");\n      case tt._this:\n        node = this.startNode();\n        this.next();\n        return this.finishNode(node, \"ThisExpression\");\n\n      case tt.name: {\n        const canBeArrow = this.state.potentialArrowAt === this.state.start;\n        const containsEsc = this.state.containsEsc;\n        const id = this.parseIdentifier();\n\n        if (!containsEsc && id.name === \"async\" && !this.canInsertSemicolon()) {\n          if (this.match(tt._function)) {\n            this.next();\n            return this.parseFunction(\n              this.startNodeAtNode(id),\n              undefined,\n              true,\n            );\n          } else if (this.match(tt.name)) {\n            // If the next token begins with \"=\", commit to parsing an async\n            // arrow function. (Peeking ahead for \"=\" lets us avoid a more\n            // expensive full-token lookahead on this common path.)\n            if (this.lookaheadCharCode() === charCodes.equalsTo) {\n              return this.parseAsyncArrowUnaryFunction(id);\n            } else {\n              // Otherwise, treat \"async\" as an identifier and let calling code\n              // deal with the current tt.name token.\n              return id;\n            }\n          } else if (this.match(tt._do)) {\n            return this.parseDo(true);\n          }\n        }\n\n        if (canBeArrow && this.match(tt.arrow) && !this.canInsertSemicolon()) {\n          this.next();\n          return this.parseArrowExpression(\n            this.startNodeAtNode(id),\n            [id],\n            false,\n          );\n        }\n\n        return id;\n      }\n\n      case tt._do: {\n        return this.parseDo(false);\n      }\n\n      case tt.slash:\n      case tt.slashAssign: {\n        this.readRegexp();\n        return this.parseRegExpLiteral(this.state.value);\n      }\n\n      case tt.num:\n        return this.parseNumericLiteral(this.state.value);\n\n      case tt.bigint:\n        return this.parseBigIntLiteral(this.state.value);\n\n      case tt.decimal:\n        return this.parseDecimalLiteral(this.state.value);\n\n      case tt.string:\n        return this.parseStringLiteral(this.state.value);\n\n      case tt._null:\n        return this.parseNullLiteral();\n\n      case tt._true:\n        return this.parseBooleanLiteral(true);\n      case tt._false:\n        return this.parseBooleanLiteral(false);\n\n      case tt.parenL: {\n        const canBeArrow = this.state.potentialArrowAt === this.state.start;\n        return this.parseParenAndDistinguishExpression(canBeArrow);\n      }\n\n      case tt.bracketBarL:\n      case tt.bracketHashL: {\n        return this.parseArrayLike(\n          this.state.type === tt.bracketBarL ? tt.bracketBarR : tt.bracketR,\n          /* canBePattern */ false,\n          /* isTuple */ true,\n          refExpressionErrors,\n        );\n      }\n      case tt.bracketL: {\n        return this.parseArrayLike(\n          tt.bracketR,\n          /* canBePattern */ true,\n          /* isTuple */ false,\n          refExpressionErrors,\n        );\n      }\n      case tt.braceBarL:\n      case tt.braceHashL: {\n        return this.parseObjectLike(\n          this.state.type === tt.braceBarL ? tt.braceBarR : tt.braceR,\n          /* isPattern */ false,\n          /* isRecord */ true,\n          refExpressionErrors,\n        );\n      }\n      case tt.braceL: {\n        return this.parseObjectLike(\n          tt.braceR,\n          /* isPattern */ false,\n          /* isRecord */ false,\n          refExpressionErrors,\n        );\n      }\n      case tt._function:\n        return this.parseFunctionOrFunctionSent();\n\n      case tt.at:\n        this.parseDecorators();\n      // fall through\n      case tt._class:\n        node = this.startNode();\n        this.takeDecorators(node);\n        return this.parseClass(node, false);\n\n      case tt._new:\n        return this.parseNewOrNewTarget();\n\n      case tt.backQuote:\n        return this.parseTemplate(false);\n\n      // BindExpression[Yield]\n      //   :: MemberExpression[?Yield]\n      case tt.doubleColon: {\n        node = this.startNode();\n        this.next();\n        node.object = null;\n        const callee = (node.callee = this.parseNoCallExpr());\n        if (callee.type === \"MemberExpression\") {\n          return this.finishNode(node, \"BindExpression\");\n        } else {\n          throw this.raise(callee.start, Errors.UnsupportedBind);\n        }\n      }\n\n      case tt.privateName: {\n        // https://tc39.es/proposal-private-fields-in-in\n        // RelationalExpression [In, Yield, Await]\n        //   [+In] PrivateIdentifier in ShiftExpression[?Yield, ?Await]\n        const start = this.state.start;\n        const value = this.state.value;\n        node = this.parsePrivateName();\n        if (this.match(tt._in)) {\n          this.expectPlugin(\"privateIn\");\n          this.classScope.usePrivateName(value, node.start);\n        } else if (this.hasPlugin(\"privateIn\")) {\n          this.raise(this.state.start, Errors.PrivateInExpectedIn, value);\n        } else {\n          throw this.unexpected(start);\n        }\n        return node;\n      }\n      case tt.hash: {\n        if (this.state.inPipeline) {\n          node = this.startNode();\n\n          if (\n            this.getPluginOption(\"pipelineOperator\", \"proposal\") !== \"smart\"\n          ) {\n            this.raise(node.start, Errors.PrimaryTopicRequiresSmartPipeline);\n          }\n\n          this.next();\n\n          if (!this.primaryTopicReferenceIsAllowedInCurrentTopicContext()) {\n            this.raise(node.start, Errors.PrimaryTopicNotAllowed);\n          }\n\n          this.registerTopicReference();\n          return this.finishNode(node, \"PipelinePrimaryTopicReference\");\n        }\n      }\n      // fall through\n      case tt.relational: {\n        if (this.state.value === \"<\") {\n          const lookaheadCh = this.input.codePointAt(this.nextTokenStart());\n          if (\n            isIdentifierStart(lookaheadCh) || // Element/Type Parameter <foo>\n            lookaheadCh === charCodes.greaterThan // Fragment <>\n          ) {\n            this.expectOnePlugin([\"jsx\", \"flow\", \"typescript\"]);\n          }\n        }\n      }\n      // fall through\n      default:\n        throw this.unexpected();\n    }\n  }\n\n  // async [no LineTerminator here] AsyncArrowBindingIdentifier[?Yield] [no LineTerminator here] => AsyncConciseBody[?In]\n  parseAsyncArrowUnaryFunction(id: N.Expression): N.ArrowFunctionExpression {\n    const node = this.startNodeAtNode(id);\n    // We don't need to push a new ParameterDeclarationScope here since we are sure\n    // 1) it is an async arrow, 2) no biding pattern is allowed in params\n    this.prodParam.enter(functionFlags(true, this.prodParam.hasYield));\n    const params = [this.parseIdentifier()];\n    this.prodParam.exit();\n    if (this.hasPrecedingLineBreak()) {\n      this.raise(this.state.pos, Errors.LineTerminatorBeforeArrow);\n    }\n    this.expect(tt.arrow);\n    // let foo = async bar => {};\n    this.parseArrowExpression(node, params, true);\n    return node;\n  }\n\n  // https://github.com/tc39/proposal-do-expressions\n  // https://github.com/tc39/proposal-async-do-expressions\n  parseDo(isAsync: boolean): N.DoExpression {\n    this.expectPlugin(\"doExpressions\");\n    if (isAsync) {\n      this.expectPlugin(\"asyncDoExpressions\");\n    }\n    const node = this.startNode();\n    node.async = isAsync;\n    this.next(); // eat `do`\n    const oldLabels = this.state.labels;\n    this.state.labels = [];\n    if (isAsync) {\n      // AsyncDoExpression :\n      // async [no LineTerminator here] do Block[~Yield, +Await, ~Return]\n      this.prodParam.enter(PARAM_AWAIT);\n      node.body = this.parseBlock();\n      this.prodParam.exit();\n    } else {\n      node.body = this.parseBlock();\n    }\n\n    this.state.labels = oldLabels;\n    return this.finishNode(node, \"DoExpression\");\n  }\n\n  // Parse the `super` keyword\n  parseSuper(): N.Super {\n    const node = this.startNode();\n    this.next(); // eat `super`\n    if (\n      this.match(tt.parenL) &&\n      !this.scope.allowDirectSuper &&\n      !this.options.allowSuperOutsideMethod\n    ) {\n      this.raise(node.start, Errors.SuperNotAllowed);\n    } else if (\n      !this.scope.allowSuper &&\n      !this.options.allowSuperOutsideMethod\n    ) {\n      this.raise(node.start, Errors.UnexpectedSuper);\n    }\n\n    if (\n      !this.match(tt.parenL) &&\n      !this.match(tt.bracketL) &&\n      !this.match(tt.dot)\n    ) {\n      this.raise(node.start, Errors.UnsupportedSuper);\n    }\n\n    return this.finishNode(node, \"Super\");\n  }\n\n  parseMaybePrivateName(\n    isPrivateNameAllowed: boolean,\n  ): N.PrivateName | N.Identifier {\n    const isPrivate = this.match(tt.privateName);\n\n    if (isPrivate) {\n      if (!isPrivateNameAllowed) {\n        this.raise(this.state.start + 1, Errors.UnexpectedPrivateField);\n      }\n      return this.parsePrivateName();\n    } else {\n      return this.parseIdentifier(true);\n    }\n  }\n\n  parsePrivateName(): N.PrivateName {\n    const node = this.startNode();\n    const id = this.startNodeAt(\n      this.state.start + 1,\n      // The position is hardcoded because we merge `#` and name into a single\n      // tt.privateName token\n      new Position(\n        this.state.curLine,\n        this.state.start + 1 - this.state.lineStart,\n      ),\n    );\n    const name = this.state.value;\n    this.next(); // eat #name;\n    node.id = this.createIdentifier(id, name);\n    return this.finishNode(node, \"PrivateName\");\n  }\n\n  parseFunctionOrFunctionSent(): N.FunctionExpression | N.MetaProperty {\n    const node = this.startNode();\n\n    // We do not do parseIdentifier here because when parseFunctionOrFunctionSent\n    // is called we already know that the current token is a \"name\" with the value \"function\"\n    // This will improve perf a tiny little bit as we do not do validation but more importantly\n    // here is that parseIdentifier will remove an item from the expression stack\n    // if \"function\" or \"class\" is parsed as identifier (in objects e.g.), which should not happen here.\n    this.next(); // eat `function`\n\n    if (this.prodParam.hasYield && this.match(tt.dot)) {\n      const meta = this.createIdentifier(\n        this.startNodeAtNode(node),\n        \"function\",\n      );\n      this.next(); // eat `.`\n      return this.parseMetaProperty(node, meta, \"sent\");\n    }\n    return this.parseFunction(node);\n  }\n\n  parseMetaProperty(\n    node: N.MetaProperty,\n    meta: N.Identifier,\n    propertyName: string,\n  ): N.MetaProperty {\n    node.meta = meta;\n\n    if (meta.name === \"function\" && propertyName === \"sent\") {\n      // https://github.com/tc39/proposal-function.sent#syntax-1\n      if (this.isContextual(propertyName)) {\n        this.expectPlugin(\"functionSent\");\n      } else if (!this.hasPlugin(\"functionSent\")) {\n        // The code wasn't `function.sent` but just `function.`, so a simple error is less confusing.\n        this.unexpected();\n      }\n    }\n\n    const containsEsc = this.state.containsEsc;\n\n    node.property = this.parseIdentifier(true);\n\n    if (node.property.name !== propertyName || containsEsc) {\n      this.raise(\n        node.property.start,\n        Errors.UnsupportedMetaProperty,\n        meta.name,\n        propertyName,\n      );\n    }\n\n    return this.finishNode(node, \"MetaProperty\");\n  }\n\n  // https://tc39.es/ecma262/#prod-ImportMeta\n  parseImportMetaProperty(node: N.MetaProperty): N.MetaProperty {\n    const id = this.createIdentifier(this.startNodeAtNode(node), \"import\");\n    this.next(); // eat `.`\n\n    if (this.isContextual(\"meta\")) {\n      if (!this.inModule) {\n        this.raise(id.start, SourceTypeModuleErrors.ImportMetaOutsideModule);\n      }\n      this.sawUnambiguousESM = true;\n    }\n\n    return this.parseMetaProperty(node, id, \"meta\");\n  }\n\n  parseLiteralAtNode<T: N.Node>(\n    value: any,\n    type: $ElementType<T, \"type\">,\n    node: any,\n  ): T {\n    this.addExtra(node, \"rawValue\", value);\n    this.addExtra(node, \"raw\", this.input.slice(node.start, this.state.end));\n    node.value = value;\n    this.next();\n    return this.finishNode<T>(node, type);\n  }\n\n  parseLiteral<T: N.Node>(value: any, type: $ElementType<T, \"type\">): T {\n    const node = this.startNode();\n    return this.parseLiteralAtNode(value, type, node);\n  }\n\n  parseStringLiteral(value: any) {\n    return this.parseLiteral<N.StringLiteral>(value, \"StringLiteral\");\n  }\n\n  parseNumericLiteral(value: any) {\n    return this.parseLiteral<N.NumericLiteral>(value, \"NumericLiteral\");\n  }\n\n  parseBigIntLiteral(value: any) {\n    return this.parseLiteral<N.BigIntLiteral>(value, \"BigIntLiteral\");\n  }\n\n  parseDecimalLiteral(value: any) {\n    return this.parseLiteral<N.DecimalLiteral>(value, \"DecimalLiteral\");\n  }\n\n  parseRegExpLiteral(value: { value: any, pattern: string, flags: string }) {\n    const node = this.parseLiteral<N.RegExpLiteral>(\n      value.value,\n      \"RegExpLiteral\",\n    );\n    node.pattern = value.pattern;\n    node.flags = value.flags;\n    return node;\n  }\n\n  parseBooleanLiteral(value: boolean) {\n    const node = this.startNode();\n    node.value = value;\n    this.next();\n    return this.finishNode<N.BooleanLiteral>(node, \"BooleanLiteral\");\n  }\n\n  parseNullLiteral() {\n    const node = this.startNode();\n    this.next();\n    return this.finishNode<N.NullLiteral>(node, \"NullLiteral\");\n  }\n\n  // https://tc39.es/ecma262/#prod-CoverParenthesizedExpressionAndArrowParameterList\n  parseParenAndDistinguishExpression(canBeArrow: boolean): N.Expression {\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n\n    let val;\n    this.next(); // eat `(`\n    this.expressionScope.enter(newArrowHeadScope());\n\n    const oldMaybeInArrowParameters = this.state.maybeInArrowParameters;\n    const oldInFSharpPipelineDirectBody = this.state.inFSharpPipelineDirectBody;\n    this.state.maybeInArrowParameters = true;\n    this.state.inFSharpPipelineDirectBody = false;\n\n    const innerStartPos = this.state.start;\n    const innerStartLoc = this.state.startLoc;\n    const exprList = [];\n    const refExpressionErrors = new ExpressionErrors();\n    const refNeedsArrowPos = { start: 0 };\n    let first = true;\n    let spreadStart;\n    let optionalCommaStart;\n\n    while (!this.match(tt.parenR)) {\n      if (first) {\n        first = false;\n      } else {\n        this.expect(tt.comma, refNeedsArrowPos.start || null);\n        if (this.match(tt.parenR)) {\n          optionalCommaStart = this.state.start;\n          break;\n        }\n      }\n\n      if (this.match(tt.ellipsis)) {\n        const spreadNodeStartPos = this.state.start;\n        const spreadNodeStartLoc = this.state.startLoc;\n        spreadStart = this.state.start;\n        exprList.push(\n          this.parseParenItem(\n            this.parseRestBinding(),\n            spreadNodeStartPos,\n            spreadNodeStartLoc,\n          ),\n        );\n\n        this.checkCommaAfterRest(charCodes.rightParenthesis);\n\n        break;\n      } else {\n        exprList.push(\n          this.parseMaybeAssignAllowIn(\n            refExpressionErrors,\n            this.parseParenItem,\n            refNeedsArrowPos,\n          ),\n        );\n      }\n    }\n\n    const innerEndPos = this.state.lastTokEnd;\n    const innerEndLoc = this.state.lastTokEndLoc;\n    this.expect(tt.parenR);\n\n    this.state.maybeInArrowParameters = oldMaybeInArrowParameters;\n    this.state.inFSharpPipelineDirectBody = oldInFSharpPipelineDirectBody;\n\n    let arrowNode = this.startNodeAt(startPos, startLoc);\n    if (\n      canBeArrow &&\n      this.shouldParseArrow() &&\n      (arrowNode = this.parseArrow(arrowNode))\n    ) {\n      this.expressionScope.validateAsPattern();\n      this.expressionScope.exit();\n      this.parseArrowExpression(arrowNode, exprList, false);\n      return arrowNode;\n    }\n    this.expressionScope.exit();\n\n    if (!exprList.length) {\n      this.unexpected(this.state.lastTokStart);\n    }\n    if (optionalCommaStart) this.unexpected(optionalCommaStart);\n    if (spreadStart) this.unexpected(spreadStart);\n    this.checkExpressionErrors(refExpressionErrors, true);\n    if (refNeedsArrowPos.start) this.unexpected(refNeedsArrowPos.start);\n\n    this.toReferencedListDeep(exprList, /* isParenthesizedExpr */ true);\n    if (exprList.length > 1) {\n      val = this.startNodeAt(innerStartPos, innerStartLoc);\n      val.expressions = exprList;\n      this.finishNodeAt(val, \"SequenceExpression\", innerEndPos, innerEndLoc);\n    } else {\n      val = exprList[0];\n    }\n\n    if (!this.options.createParenthesizedExpressions) {\n      this.addExtra(val, \"parenthesized\", true);\n      this.addExtra(val, \"parenStart\", startPos);\n      return val;\n    }\n\n    const parenExpression = this.startNodeAt(startPos, startLoc);\n    parenExpression.expression = val;\n    this.finishNode(parenExpression, \"ParenthesizedExpression\");\n    return parenExpression;\n  }\n\n  shouldParseArrow(): boolean {\n    return !this.canInsertSemicolon();\n  }\n\n  parseArrow(node: N.ArrowFunctionExpression): ?N.ArrowFunctionExpression {\n    if (this.eat(tt.arrow)) {\n      return node;\n    }\n  }\n\n  parseParenItem(\n    node: N.Expression,\n    startPos: number, // eslint-disable-line no-unused-vars\n    startLoc: Position, // eslint-disable-line no-unused-vars\n  ): N.Expression {\n    return node;\n  }\n\n  parseNewOrNewTarget(): N.NewExpression | N.MetaProperty {\n    const node = this.startNode();\n    this.next();\n    if (this.match(tt.dot)) {\n      // https://tc39.es/ecma262/#prod-NewTarget\n      const meta = this.createIdentifier(this.startNodeAtNode(node), \"new\");\n      this.next();\n      const metaProp = this.parseMetaProperty(node, meta, \"target\");\n\n      if (!this.scope.inNonArrowFunction && !this.scope.inClass) {\n        this.raise(metaProp.start, Errors.UnexpectedNewTarget);\n      }\n\n      return metaProp;\n    }\n\n    return this.parseNew(node);\n  }\n\n  // New's precedence is slightly tricky. It must allow its argument to\n  // be a `[]` or dot subscript expression, but not a call — at least,\n  // not without wrapping it in parentheses. Thus, it uses the noCalls\n  // argument to parseSubscripts to prevent it from consuming the\n  // argument list.\n  // https://tc39.es/ecma262/#prod-NewExpression\n  parseNew(node: N.Expression): N.NewExpression {\n    node.callee = this.parseNoCallExpr();\n    if (node.callee.type === \"Import\") {\n      this.raise(node.callee.start, Errors.ImportCallNotNewExpression);\n    } else if (this.isOptionalChain(node.callee)) {\n      this.raise(this.state.lastTokEnd, Errors.OptionalChainingNoNew);\n    } else if (this.eat(tt.questionDot)) {\n      this.raise(this.state.start, Errors.OptionalChainingNoNew);\n    }\n\n    this.parseNewArguments(node);\n    return this.finishNode(node, \"NewExpression\");\n  }\n\n  parseNewArguments(node: N.NewExpression): void {\n    if (this.eat(tt.parenL)) {\n      const args = this.parseExprList(tt.parenR);\n      this.toReferencedList(args);\n      // $FlowFixMe (parseExprList should be all non-null in this case)\n      node.arguments = args;\n    } else {\n      node.arguments = [];\n    }\n  }\n\n  // Parse template expression.\n\n  parseTemplateElement(isTagged: boolean): N.TemplateElement {\n    const elem = this.startNode();\n    if (this.state.value === null) {\n      if (!isTagged) {\n        this.raise(this.state.start + 1, Errors.InvalidEscapeSequenceTemplate);\n      }\n    }\n    elem.value = {\n      raw: this.input\n        .slice(this.state.start, this.state.end)\n        .replace(/\\r\\n?/g, \"\\n\"),\n      cooked: this.state.value,\n    };\n    this.next();\n    elem.tail = this.match(tt.backQuote);\n    return this.finishNode(elem, \"TemplateElement\");\n  }\n\n  // https://tc39.es/ecma262/#prod-TemplateLiteral\n  parseTemplate(isTagged: boolean): N.TemplateLiteral {\n    const node = this.startNode();\n    this.next();\n    node.expressions = [];\n    let curElt = this.parseTemplateElement(isTagged);\n    node.quasis = [curElt];\n    while (!curElt.tail) {\n      this.expect(tt.dollarBraceL);\n      node.expressions.push(this.parseTemplateSubstitution());\n      this.expect(tt.braceR);\n      node.quasis.push((curElt = this.parseTemplateElement(isTagged)));\n    }\n    this.next();\n    return this.finishNode(node, \"TemplateLiteral\");\n  }\n\n  // This is overwritten by the TypeScript plugin to parse template types\n  parseTemplateSubstitution(): N.Expression {\n    return this.parseExpression();\n  }\n\n  // Parse an object literal, binding pattern, or record.\n\n  parseObjectLike<T: N.ObjectPattern | N.ObjectExpression>(\n    close: TokenType,\n    isPattern: boolean,\n    isRecord?: ?boolean,\n    refExpressionErrors?: ?ExpressionErrors,\n  ): T {\n    if (isRecord) {\n      this.expectPlugin(\"recordAndTuple\");\n    }\n    const oldInFSharpPipelineDirectBody = this.state.inFSharpPipelineDirectBody;\n    this.state.inFSharpPipelineDirectBody = false;\n    const propHash: any = Object.create(null);\n    let first = true;\n    const node = this.startNode();\n\n    node.properties = [];\n    this.next();\n\n    while (!this.match(close)) {\n      if (first) {\n        first = false;\n      } else {\n        this.expect(tt.comma);\n        if (this.match(close)) {\n          this.addExtra(node, \"trailingComma\", this.state.lastTokStart);\n          break;\n        }\n      }\n\n      const prop = this.parsePropertyDefinition(isPattern, refExpressionErrors);\n      if (!isPattern) {\n        // $FlowIgnore RestElement will never be returned if !isPattern\n        this.checkProto(prop, isRecord, propHash, refExpressionErrors);\n      }\n\n      if (\n        isRecord &&\n        !this.isObjectProperty(prop) &&\n        prop.type !== \"SpreadElement\"\n      ) {\n        this.raise(prop.start, Errors.InvalidRecordProperty);\n      }\n\n      // $FlowIgnore\n      if (prop.shorthand) {\n        this.addExtra(prop, \"shorthand\", true);\n      }\n\n      node.properties.push(prop);\n    }\n\n    this.next();\n\n    this.state.inFSharpPipelineDirectBody = oldInFSharpPipelineDirectBody;\n    let type = \"ObjectExpression\";\n    if (isPattern) {\n      type = \"ObjectPattern\";\n    } else if (isRecord) {\n      type = \"RecordExpression\";\n    }\n    return this.finishNode(node, type);\n  }\n\n  // Check grammar production:\n  //   IdentifierName *_opt PropertyName\n  // It is used in `parsePropertyDefinition` to detect AsyncMethod and Accessors\n  maybeAsyncOrAccessorProp(prop: N.ObjectProperty): boolean {\n    return (\n      !prop.computed &&\n      prop.key.type === \"Identifier\" &&\n      (this.isLiteralPropertyName() ||\n        this.match(tt.bracketL) ||\n        this.match(tt.star))\n    );\n  }\n\n  // https://tc39.es/ecma262/#prod-PropertyDefinition\n  parsePropertyDefinition(\n    isPattern: boolean,\n    refExpressionErrors?: ?ExpressionErrors,\n  ): N.ObjectMember | N.SpreadElement | N.RestElement {\n    let decorators = [];\n    if (this.match(tt.at)) {\n      if (this.hasPlugin(\"decorators\")) {\n        this.raise(this.state.start, Errors.UnsupportedPropertyDecorator);\n      }\n\n      // we needn't check if decorators (stage 0) plugin is enabled since it's checked by\n      // the call to this.parseDecorator\n      while (this.match(tt.at)) {\n        decorators.push(this.parseDecorator());\n      }\n    }\n\n    const prop = this.startNode();\n    let isGenerator = false;\n    let isAsync = false;\n    let isAccessor = false;\n    let startPos;\n    let startLoc;\n\n    if (this.match(tt.ellipsis)) {\n      if (decorators.length) this.unexpected();\n      if (isPattern) {\n        this.next();\n        // Don't use parseRestBinding() as we only allow Identifier here.\n        prop.argument = this.parseIdentifier();\n        this.checkCommaAfterRest(charCodes.rightCurlyBrace);\n        return this.finishNode(prop, \"RestElement\");\n      }\n\n      return this.parseSpread();\n    }\n\n    if (decorators.length) {\n      prop.decorators = decorators;\n      decorators = [];\n    }\n\n    prop.method = false;\n\n    if (isPattern || refExpressionErrors) {\n      startPos = this.state.start;\n      startLoc = this.state.startLoc;\n    }\n\n    if (!isPattern) {\n      isGenerator = this.eat(tt.star);\n    }\n\n    const containsEsc = this.state.containsEsc;\n    const key = this.parsePropertyName(prop, /* isPrivateNameAllowed */ false);\n\n    if (\n      !isPattern &&\n      !isGenerator &&\n      !containsEsc &&\n      this.maybeAsyncOrAccessorProp(prop)\n    ) {\n      const keyName = key.name;\n      // https://tc39.es/ecma262/#prod-AsyncMethod\n      // https://tc39.es/ecma262/#prod-AsyncGeneratorMethod\n      if (keyName === \"async\" && !this.hasPrecedingLineBreak()) {\n        isAsync = true;\n        isGenerator = this.eat(tt.star);\n        this.parsePropertyName(prop, /* isPrivateNameAllowed */ false);\n      }\n      // get PropertyName[?Yield, ?Await] () { FunctionBody[~Yield, ~Await] }\n      // set PropertyName[?Yield, ?Await] ( PropertySetParameterList ) { FunctionBody[~Yield, ~Await] }\n      if (keyName === \"get\" || keyName === \"set\") {\n        isAccessor = true;\n        prop.kind = keyName;\n        if (this.match(tt.star)) {\n          isGenerator = true;\n          this.raise(this.state.pos, Errors.AccessorIsGenerator, keyName);\n          this.next();\n        }\n        this.parsePropertyName(prop, /* isPrivateNameAllowed */ false);\n      }\n    }\n\n    this.parseObjPropValue(\n      prop,\n      startPos,\n      startLoc,\n      isGenerator,\n      isAsync,\n      isPattern,\n      isAccessor,\n      refExpressionErrors,\n    );\n\n    return prop;\n  }\n\n  getGetterSetterExpectedParamCount(\n    method: N.ObjectMethod | N.ClassMethod,\n  ): number {\n    return method.kind === \"get\" ? 0 : 1;\n  }\n\n  // This exists so we can override within the ESTree plugin\n  getObjectOrClassMethodParams(method: N.ObjectMethod | N.ClassMethod) {\n    return method.params;\n  }\n\n  // get methods aren't allowed to have any parameters\n  // set methods must have exactly 1 parameter which is not a rest parameter\n  checkGetterSetterParams(method: N.ObjectMethod | N.ClassMethod): void {\n    const paramCount = this.getGetterSetterExpectedParamCount(method);\n    const params = this.getObjectOrClassMethodParams(method);\n\n    const start = method.start;\n\n    if (params.length !== paramCount) {\n      if (method.kind === \"get\") {\n        this.raise(start, Errors.BadGetterArity);\n      } else {\n        this.raise(start, Errors.BadSetterArity);\n      }\n    }\n\n    if (\n      method.kind === \"set\" &&\n      params[params.length - 1]?.type === \"RestElement\"\n    ) {\n      this.raise(start, Errors.BadSetterRestParameter);\n    }\n  }\n\n  // https://tc39.es/ecma262/#prod-MethodDefinition\n  parseObjectMethod(\n    prop: N.ObjectMethod,\n    isGenerator: boolean,\n    isAsync: boolean,\n    isPattern: boolean,\n    isAccessor: boolean,\n  ): ?N.ObjectMethod {\n    if (isAccessor) {\n      // isAccessor implies isAsync: false, isPattern: false, isGenerator: false\n      this.parseMethod(\n        prop,\n        // This _should_ be false, but with error recovery, we allow it to be\n        // set for informational purposes\n        isGenerator,\n        /* isAsync */ false,\n        /* isConstructor */ false,\n        false,\n        \"ObjectMethod\",\n      );\n      this.checkGetterSetterParams(prop);\n      return prop;\n    }\n\n    if (isAsync || isGenerator || this.match(tt.parenL)) {\n      if (isPattern) this.unexpected();\n      prop.kind = \"method\";\n      prop.method = true;\n      return this.parseMethod(\n        prop,\n        isGenerator,\n        isAsync,\n        /* isConstructor */ false,\n        false,\n        \"ObjectMethod\",\n      );\n    }\n  }\n\n  // if `isPattern` is true, parse https://tc39.es/ecma262/#prod-BindingProperty\n  // else https://tc39.es/ecma262/#prod-PropertyDefinition\n  parseObjectProperty(\n    prop: N.ObjectProperty,\n    startPos: ?number,\n    startLoc: ?Position,\n    isPattern: boolean,\n    refExpressionErrors: ?ExpressionErrors,\n  ): ?N.ObjectProperty {\n    prop.shorthand = false;\n\n    if (this.eat(tt.colon)) {\n      prop.value = isPattern\n        ? this.parseMaybeDefault(this.state.start, this.state.startLoc)\n        : this.parseMaybeAssignAllowIn(refExpressionErrors);\n\n      return this.finishNode(prop, \"ObjectProperty\");\n    }\n\n    if (!prop.computed && prop.key.type === \"Identifier\") {\n      // PropertyDefinition:\n      //   IdentifierReference\n      //   CoveredInitializedName\n      // Note: `{ eval } = {}` will be checked in `checkLVal` later.\n      this.checkReservedWord(prop.key.name, prop.key.start, true, false);\n\n      if (isPattern) {\n        prop.value = this.parseMaybeDefault(\n          startPos,\n          startLoc,\n          prop.key.__clone(),\n        );\n      } else if (this.match(tt.eq) && refExpressionErrors) {\n        if (refExpressionErrors.shorthandAssign === -1) {\n          refExpressionErrors.shorthandAssign = this.state.start;\n        }\n        prop.value = this.parseMaybeDefault(\n          startPos,\n          startLoc,\n          prop.key.__clone(),\n        );\n      } else {\n        prop.value = prop.key.__clone();\n      }\n      prop.shorthand = true;\n\n      return this.finishNode(prop, \"ObjectProperty\");\n    }\n  }\n\n  parseObjPropValue(\n    prop: any,\n    startPos: ?number,\n    startLoc: ?Position,\n    isGenerator: boolean,\n    isAsync: boolean,\n    isPattern: boolean,\n    isAccessor: boolean,\n    refExpressionErrors?: ?ExpressionErrors,\n  ): void {\n    const node =\n      this.parseObjectMethod(\n        prop,\n        isGenerator,\n        isAsync,\n        isPattern,\n        isAccessor,\n      ) ||\n      this.parseObjectProperty(\n        prop,\n        startPos,\n        startLoc,\n        isPattern,\n        refExpressionErrors,\n      );\n\n    if (!node) this.unexpected();\n\n    // $FlowFixMe\n    return node;\n  }\n\n  parsePropertyName(\n    prop: N.ObjectOrClassMember | N.ClassMember | N.TsNamedTypeElementBase,\n    isPrivateNameAllowed: boolean,\n  ): N.Expression | N.Identifier {\n    if (this.eat(tt.bracketL)) {\n      (prop: $FlowSubtype<N.ObjectOrClassMember>).computed = true;\n      prop.key = this.parseMaybeAssignAllowIn();\n      this.expect(tt.bracketR);\n    } else {\n      const oldInPropertyName = this.state.inPropertyName;\n      this.state.inPropertyName = true;\n      // We check if it's valid for it to be a private name when we push it.\n      const type = this.state.type;\n      (prop: $FlowFixMe).key =\n        type === tt.num ||\n        type === tt.string ||\n        type === tt.bigint ||\n        type === tt.decimal\n          ? this.parseExprAtom()\n          : this.parseMaybePrivateName(isPrivateNameAllowed);\n\n      if (type !== tt.privateName) {\n        // ClassPrivateProperty is never computed, so we don't assign in that case.\n        prop.computed = false;\n      }\n\n      this.state.inPropertyName = oldInPropertyName;\n    }\n\n    return prop.key;\n  }\n\n  // Initialize empty function node.\n\n  initFunction(node: N.BodilessFunctionOrMethodBase, isAsync: ?boolean): void {\n    node.id = null;\n    node.generator = false;\n    node.async = !!isAsync;\n  }\n\n  // Parse object or class method.\n\n  parseMethod<T: N.MethodLike>(\n    node: T,\n    isGenerator: boolean,\n    isAsync: boolean,\n    isConstructor: boolean,\n    allowDirectSuper: boolean,\n    type: string,\n    inClassScope: boolean = false,\n  ): T {\n    this.initFunction(node, isAsync);\n    node.generator = !!isGenerator;\n    const allowModifiers = isConstructor; // For TypeScript parameter properties\n    this.scope.enter(\n      SCOPE_FUNCTION |\n        SCOPE_SUPER |\n        (inClassScope ? SCOPE_CLASS : 0) |\n        (allowDirectSuper ? SCOPE_DIRECT_SUPER : 0),\n    );\n    this.prodParam.enter(functionFlags(isAsync, node.generator));\n    this.parseFunctionParams((node: any), allowModifiers);\n    this.parseFunctionBodyAndFinish(node, type, true);\n    this.prodParam.exit();\n    this.scope.exit();\n\n    return node;\n  }\n\n  // parse an array literal or tuple literal\n  // https://tc39.es/ecma262/#prod-ArrayLiteral\n  // https://tc39.es/proposal-record-tuple/#prod-TupleLiteral\n  parseArrayLike(\n    close: TokenType,\n    canBePattern: boolean,\n    isTuple: boolean,\n    refExpressionErrors: ?ExpressionErrors,\n  ): N.ArrayExpression | N.TupleExpression {\n    if (isTuple) {\n      this.expectPlugin(\"recordAndTuple\");\n    }\n    const oldInFSharpPipelineDirectBody = this.state.inFSharpPipelineDirectBody;\n    this.state.inFSharpPipelineDirectBody = false;\n    const node = this.startNode();\n    this.next();\n    node.elements = this.parseExprList(\n      close,\n      /* allowEmpty */ !isTuple,\n      refExpressionErrors,\n      node,\n    );\n    this.state.inFSharpPipelineDirectBody = oldInFSharpPipelineDirectBody;\n    return this.finishNode(\n      node,\n      isTuple ? \"TupleExpression\" : \"ArrayExpression\",\n    );\n  }\n\n  // Parse arrow function expression.\n  // If the parameters are provided, they will be converted to an\n  // assignable list.\n  parseArrowExpression(\n    node: N.ArrowFunctionExpression,\n    params: ?(N.Expression[]),\n    isAsync: boolean,\n    trailingCommaPos: ?number,\n  ): N.ArrowFunctionExpression {\n    this.scope.enter(SCOPE_FUNCTION | SCOPE_ARROW);\n    let flags = functionFlags(isAsync, false);\n    // ConciseBody and AsyncConciseBody inherit [In]\n    if (!this.match(tt.bracketL) && this.prodParam.hasIn) {\n      flags |= PARAM_IN;\n    }\n    this.prodParam.enter(flags);\n    this.initFunction(node, isAsync);\n    const oldMaybeInArrowParameters = this.state.maybeInArrowParameters;\n\n    if (params) {\n      this.state.maybeInArrowParameters = true;\n      this.setArrowFunctionParameters(node, params, trailingCommaPos);\n    }\n    this.state.maybeInArrowParameters = false;\n    this.parseFunctionBody(node, true);\n\n    this.prodParam.exit();\n    this.scope.exit();\n    this.state.maybeInArrowParameters = oldMaybeInArrowParameters;\n\n    return this.finishNode(node, \"ArrowFunctionExpression\");\n  }\n\n  setArrowFunctionParameters(\n    node: N.ArrowFunctionExpression,\n    params: N.Expression[],\n    trailingCommaPos: ?number,\n  ): void {\n    node.params = this.toAssignableList(params, trailingCommaPos, false);\n  }\n\n  parseFunctionBodyAndFinish(\n    node: N.BodilessFunctionOrMethodBase,\n    type: string,\n    isMethod?: boolean = false,\n  ): void {\n    // $FlowIgnore (node is not bodiless if we get here)\n    this.parseFunctionBody(node, false, isMethod);\n    this.finishNode(node, type);\n  }\n\n  // Parse function body and check parameters.\n  parseFunctionBody(\n    node: N.Function,\n    allowExpression: ?boolean,\n    isMethod?: boolean = false,\n  ): void {\n    const isExpression = allowExpression && !this.match(tt.braceL);\n    this.expressionScope.enter(newExpressionScope());\n\n    if (isExpression) {\n      // https://tc39.es/ecma262/#prod-ExpressionBody\n      node.body = this.parseMaybeAssign();\n      this.checkParams(node, false, allowExpression, false);\n    } else {\n      const oldStrict = this.state.strict;\n      // Start a new scope with regard to labels\n      // flag (restore them to their old value afterwards).\n      const oldLabels = this.state.labels;\n      this.state.labels = [];\n\n      // FunctionBody[Yield, Await]:\n      //   StatementList[?Yield, ?Await, +Return] opt\n      this.prodParam.enter(this.prodParam.currentFlags() | PARAM_RETURN);\n      node.body = this.parseBlock(\n        true,\n        false,\n        // Strict mode function checks after we parse the statements in the function body.\n        (hasStrictModeDirective: boolean) => {\n          const nonSimple = !this.isSimpleParamList(node.params);\n\n          if (hasStrictModeDirective && nonSimple) {\n            // This logic is here to align the error location with the ESTree plugin.\n            const errorPos =\n              // $FlowIgnore\n              (node.kind === \"method\" || node.kind === \"constructor\") &&\n              // $FlowIgnore\n              !!node.key\n                ? node.key.end\n                : node.start;\n            this.raise(errorPos, Errors.IllegalLanguageModeDirective);\n          }\n\n          const strictModeChanged = !oldStrict && this.state.strict;\n\n          // Add the params to varDeclaredNames to ensure that an error is thrown\n          // if a let/const declaration in the function clashes with one of the params.\n          this.checkParams(\n            node,\n            !this.state.strict && !allowExpression && !isMethod && !nonSimple,\n            allowExpression,\n            strictModeChanged,\n          );\n\n          // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval'\n          if (this.state.strict && node.id) {\n            this.checkLVal(\n              node.id,\n              \"function name\",\n              BIND_OUTSIDE,\n              undefined,\n              undefined,\n              strictModeChanged,\n            );\n          }\n        },\n      );\n      this.prodParam.exit();\n      this.expressionScope.exit();\n      this.state.labels = oldLabels;\n    }\n  }\n\n  isSimpleParamList(\n    params: $ReadOnlyArray<N.Pattern | N.TSParameterProperty>,\n  ): boolean {\n    for (let i = 0, len = params.length; i < len; i++) {\n      if (params[i].type !== \"Identifier\") return false;\n    }\n    return true;\n  }\n\n  checkParams(\n    node: N.Function,\n    allowDuplicates: boolean,\n    // eslint-disable-next-line no-unused-vars\n    isArrowFunction: ?boolean,\n    strictModeChanged?: boolean = true,\n  ): void {\n    const checkClashes = new Set();\n    for (const param of node.params) {\n      this.checkLVal(\n        param,\n        \"function parameter list\",\n        BIND_VAR,\n        allowDuplicates ? null : checkClashes,\n        undefined,\n        strictModeChanged,\n      );\n    }\n  }\n\n  // Parses a comma-separated list of expressions, and returns them as\n  // an array. `close` is the token type that ends the list, and\n  // `allowEmpty` can be turned on to allow subsequent commas with\n  // nothing in between them to be parsed as `null` (which is needed\n  // for array literals).\n\n  parseExprList(\n    close: TokenType,\n    allowEmpty?: boolean,\n    refExpressionErrors?: ?ExpressionErrors,\n    nodeForExtra?: ?N.Node,\n  ): $ReadOnlyArray<?N.Expression> {\n    const elts = [];\n    let first = true;\n\n    while (!this.eat(close)) {\n      if (first) {\n        first = false;\n      } else {\n        this.expect(tt.comma);\n        if (this.match(close)) {\n          if (nodeForExtra) {\n            this.addExtra(\n              nodeForExtra,\n              \"trailingComma\",\n              this.state.lastTokStart,\n            );\n          }\n          this.next();\n          break;\n        }\n      }\n\n      elts.push(this.parseExprListItem(allowEmpty, refExpressionErrors));\n    }\n    return elts;\n  }\n\n  parseExprListItem(\n    allowEmpty: ?boolean,\n    refExpressionErrors?: ?ExpressionErrors,\n    refNeedsArrowPos: ?Pos,\n    allowPlaceholder: ?boolean,\n  ): ?N.Expression {\n    let elt;\n    if (this.match(tt.comma)) {\n      if (!allowEmpty) {\n        this.raise(this.state.pos, Errors.UnexpectedToken, \",\");\n      }\n      elt = null;\n    } else if (this.match(tt.ellipsis)) {\n      const spreadNodeStartPos = this.state.start;\n      const spreadNodeStartLoc = this.state.startLoc;\n      elt = this.parseParenItem(\n        this.parseSpread(refExpressionErrors, refNeedsArrowPos),\n        spreadNodeStartPos,\n        spreadNodeStartLoc,\n      );\n    } else if (this.match(tt.question)) {\n      this.expectPlugin(\"partialApplication\");\n      if (!allowPlaceholder) {\n        this.raise(this.state.start, Errors.UnexpectedArgumentPlaceholder);\n      }\n      const node = this.startNode();\n      this.next();\n      elt = this.finishNode(node, \"ArgumentPlaceholder\");\n    } else {\n      elt = this.parseMaybeAssignAllowIn(\n        refExpressionErrors,\n        this.parseParenItem,\n        refNeedsArrowPos,\n      );\n    }\n    return elt;\n  }\n\n  // Parse the next token as an identifier. If `liberal` is true (used\n  // when parsing properties), it will also convert keywords into\n  // identifiers.\n  // This shouldn't be used to parse the keywords of meta properties, since they\n  // are not identifiers and cannot contain escape sequences.\n\n  parseIdentifier(liberal?: boolean): N.Identifier {\n    const node = this.startNode();\n    const name = this.parseIdentifierName(node.start, liberal);\n\n    return this.createIdentifier(node, name);\n  }\n\n  createIdentifier(node: N.Identifier, name: string): N.Identifier {\n    node.name = name;\n    node.loc.identifierName = name;\n\n    return this.finishNode(node, \"Identifier\");\n  }\n\n  parseIdentifierName(pos: number, liberal?: boolean): string {\n    let name: string;\n\n    const { start, type } = this.state;\n\n    if (type === tt.name) {\n      name = this.state.value;\n    } else if (type.keyword) {\n      name = type.keyword;\n\n      // `class` and `function` keywords push function-type token context into this.context.\n      // But there is no chance to pop the context if the keyword is consumed\n      // as an identifier such as a property name.\n      if (type === tt._class || type === tt._function) {\n        const curContext = this.curContext();\n        if (\n          curContext === ct.functionStatement ||\n          curContext === ct.functionExpression\n        ) {\n          this.state.context.pop();\n        }\n      }\n    } else {\n      throw this.unexpected();\n    }\n\n    if (liberal) {\n      // If the current token is not used as a keyword, set its type to \"tt.name\".\n      // This will prevent this.next() from throwing about unexpected escapes.\n      this.state.type = tt.name;\n    } else {\n      this.checkReservedWord(name, start, !!type.keyword, false);\n    }\n\n    this.next();\n\n    return name;\n  }\n\n  checkReservedWord(\n    word: string,\n    startLoc: number,\n    checkKeywords: boolean,\n    isBinding: boolean,\n  ): void {\n    // Every JavaScript reserved word is 10 characters or less.\n    if (word.length > 10) {\n      return;\n    }\n    // Most identifiers are not reservedWord-like, they don't need special\n    // treatments afterward, which very likely ends up throwing errors\n    if (!canBeReservedWord(word)) {\n      return;\n    }\n\n    if (word === \"yield\") {\n      if (this.prodParam.hasYield) {\n        this.raise(startLoc, Errors.YieldBindingIdentifier);\n        return;\n      }\n    } else if (word === \"await\") {\n      if (this.prodParam.hasAwait) {\n        this.raise(startLoc, Errors.AwaitBindingIdentifier);\n        return;\n      } else if (this.scope.inStaticBlock && !this.scope.inNonArrowFunction) {\n        this.raise(startLoc, Errors.AwaitBindingIdentifierInStaticBlock);\n        return;\n      } else {\n        this.expressionScope.recordAsyncArrowParametersError(\n          startLoc,\n          Errors.AwaitBindingIdentifier,\n        );\n      }\n    } else if (word === \"arguments\") {\n      if (this.scope.inClassAndNotInNonArrowFunction) {\n        this.raise(startLoc, Errors.ArgumentsInClass);\n        return;\n      }\n    }\n\n    if (checkKeywords && isKeyword(word)) {\n      this.raise(startLoc, Errors.UnexpectedKeyword, word);\n      return;\n    }\n\n    const reservedTest = !this.state.strict\n      ? isReservedWord\n      : isBinding\n      ? isStrictBindReservedWord\n      : isStrictReservedWord;\n\n    if (reservedTest(word, this.inModule)) {\n      this.raise(startLoc, Errors.UnexpectedReservedWord, word);\n    }\n  }\n\n  isAwaitAllowed(): boolean {\n    if (this.prodParam.hasAwait) return true;\n    if (this.options.allowAwaitOutsideFunction && !this.scope.inFunction) {\n      return true;\n    }\n    return false;\n  }\n\n  // Parses await expression inside async function.\n\n  parseAwait(startPos: number, startLoc: Position): N.AwaitExpression {\n    const node = this.startNodeAt(startPos, startLoc);\n\n    this.expressionScope.recordParameterInitializerError(\n      node.start,\n      Errors.AwaitExpressionFormalParameter,\n    );\n\n    if (this.eat(tt.star)) {\n      this.raise(node.start, Errors.ObsoleteAwaitStar);\n    }\n\n    if (!this.scope.inFunction && !this.options.allowAwaitOutsideFunction) {\n      if (this.isAmbiguousAwait()) {\n        this.ambiguousScriptDifferentAst = true;\n      } else {\n        this.sawUnambiguousESM = true;\n      }\n    }\n\n    if (!this.state.soloAwait) {\n      node.argument = this.parseMaybeUnary(null, true);\n    }\n\n    return this.finishNode(node, \"AwaitExpression\");\n  }\n\n  isAmbiguousAwait(): boolean {\n    return (\n      this.hasPrecedingLineBreak() ||\n      // All the following expressions are ambiguous:\n      //   await + 0, await - 0, await ( 0 ), await [ 0 ], await / 0 /u, await ``\n      this.match(tt.plusMin) ||\n      this.match(tt.parenL) ||\n      this.match(tt.bracketL) ||\n      this.match(tt.backQuote) ||\n      // Sometimes the tokenizer generates tt.slash for regexps, and this is\n      // handler by parseExprAtom\n      this.match(tt.regexp) ||\n      this.match(tt.slash) ||\n      // This code could be parsed both as a modulo operator or as an intrinsic:\n      //   await %x(0)\n      (this.hasPlugin(\"v8intrinsic\") && this.match(tt.modulo))\n    );\n  }\n\n  // Parses yield expression inside generator.\n\n  parseYield(): N.YieldExpression {\n    const node = this.startNode();\n\n    this.expressionScope.recordParameterInitializerError(\n      node.start,\n      Errors.YieldInParameter,\n    );\n\n    this.next();\n    let delegating = false;\n    let argument = null;\n    if (!this.hasPrecedingLineBreak()) {\n      delegating = this.eat(tt.star);\n      switch (this.state.type) {\n        case tt.semi:\n        case tt.eof:\n        case tt.braceR:\n        case tt.parenR:\n        case tt.bracketR:\n        case tt.braceBarR:\n        case tt.colon:\n        case tt.comma:\n          // The above is the complete set of tokens that can\n          // follow an AssignmentExpression, and none of them\n          // can start an AssignmentExpression\n          if (!delegating) break;\n        /* fallthrough */\n        default:\n          argument = this.parseMaybeAssign();\n      }\n    }\n    node.delegate = delegating;\n    node.argument = argument;\n    return this.finishNode(node, \"YieldExpression\");\n  }\n\n  // Validates a pipeline (for any of the pipeline Babylon plugins) at the point\n  // of the infix operator `|>`.\n\n  checkPipelineAtInfixOperator(left: N.Expression, leftStartPos: number) {\n    if (this.getPluginOption(\"pipelineOperator\", \"proposal\") === \"smart\") {\n      if (left.type === \"SequenceExpression\") {\n        // Ensure that the pipeline head is not a comma-delimited\n        // sequence expression.\n        this.raise(leftStartPos, Errors.PipelineHeadSequenceExpression);\n      }\n    }\n  }\n\n  parseSmartPipelineBody(\n    childExpression: N.Expression,\n    startPos: number,\n    startLoc: Position,\n  ): N.PipelineBody {\n    this.checkSmartPipelineBodyEarlyErrors(childExpression, startPos);\n\n    return this.parseSmartPipelineBodyInStyle(\n      childExpression,\n      startPos,\n      startLoc,\n    );\n  }\n\n  checkSmartPipelineBodyEarlyErrors(\n    childExpression: N.Expression,\n    startPos: number,\n  ): void {\n    if (this.match(tt.arrow)) {\n      // If the following token is invalidly `=>`, then throw a human-friendly error\n      // instead of something like 'Unexpected token, expected \";\"'.\n      throw this.raise(this.state.start, Errors.PipelineBodyNoArrow);\n    } else if (childExpression.type === \"SequenceExpression\") {\n      this.raise(startPos, Errors.PipelineBodySequenceExpression);\n    }\n  }\n\n  parseSmartPipelineBodyInStyle(\n    childExpression: N.Expression,\n    startPos: number,\n    startLoc: Position,\n  ): N.PipelineBody {\n    const bodyNode = this.startNodeAt(startPos, startLoc);\n    const isSimpleReference = this.isSimpleReference(childExpression);\n    if (isSimpleReference) {\n      bodyNode.callee = childExpression;\n    } else {\n      if (!this.topicReferenceWasUsedInCurrentTopicContext()) {\n        this.raise(startPos, Errors.PipelineTopicUnused);\n      }\n      bodyNode.expression = childExpression;\n    }\n    return this.finishNode(\n      bodyNode,\n      isSimpleReference ? \"PipelineBareFunction\" : \"PipelineTopicExpression\",\n    );\n  }\n\n  isSimpleReference(expression: N.Expression): boolean {\n    switch (expression.type) {\n      case \"MemberExpression\":\n        return (\n          !expression.computed && this.isSimpleReference(expression.object)\n        );\n      case \"Identifier\":\n        return true;\n      default:\n        return false;\n    }\n  }\n\n  // Enable topic references from outer contexts within smart pipeline bodies.\n  // The function modifies the parser's topic-context state to enable or disable\n  // the use of topic references with the smartPipelines plugin. They then run a\n  // callback, then they reset the parser to the old topic-context state that it\n  // had before the function was called.\n\n  withTopicPermittingContext<T>(callback: () => T): T {\n    const outerContextTopicState = this.state.topicContext;\n    this.state.topicContext = {\n      // Enable the use of the primary topic reference.\n      maxNumOfResolvableTopics: 1,\n      // Hide the use of any topic references from outer contexts.\n      maxTopicIndex: null,\n    };\n\n    try {\n      return callback();\n    } finally {\n      this.state.topicContext = outerContextTopicState;\n    }\n  }\n\n  // Disable topic references from outer contexts within syntax constructs\n  // such as the bodies of iteration statements.\n  // The function modifies the parser's topic-context state to enable or disable\n  // the use of topic references with the smartPipelines plugin. They then run a\n  // callback, then they reset the parser to the old topic-context state that it\n  // had before the function was called.\n\n  withTopicForbiddingContext<T>(callback: () => T): T {\n    const outerContextTopicState = this.state.topicContext;\n    this.state.topicContext = {\n      // Disable the use of the primary topic reference.\n      maxNumOfResolvableTopics: 0,\n      // Hide the use of any topic references from outer contexts.\n      maxTopicIndex: null,\n    };\n\n    try {\n      return callback();\n    } finally {\n      this.state.topicContext = outerContextTopicState;\n    }\n  }\n\n  withSoloAwaitPermittingContext<T>(callback: () => T): T {\n    const outerContextSoloAwaitState = this.state.soloAwait;\n    this.state.soloAwait = true;\n\n    try {\n      return callback();\n    } finally {\n      this.state.soloAwait = outerContextSoloAwaitState;\n    }\n  }\n\n  allowInAnd<T>(callback: () => T): T {\n    const flags = this.prodParam.currentFlags();\n    const prodParamToSet = PARAM_IN & ~flags;\n    if (prodParamToSet) {\n      this.prodParam.enter(flags | PARAM_IN);\n      try {\n        return callback();\n      } finally {\n        this.prodParam.exit();\n      }\n    }\n    return callback();\n  }\n\n  disallowInAnd<T>(callback: () => T): T {\n    const flags = this.prodParam.currentFlags();\n    const prodParamToClear = PARAM_IN & flags;\n    if (prodParamToClear) {\n      this.prodParam.enter(flags & ~PARAM_IN);\n      try {\n        return callback();\n      } finally {\n        this.prodParam.exit();\n      }\n    }\n    return callback();\n  }\n\n  // Register the use of a primary topic reference (`#`) within the current\n  // topic context.\n  registerTopicReference(): void {\n    this.state.topicContext.maxTopicIndex = 0;\n  }\n\n  primaryTopicReferenceIsAllowedInCurrentTopicContext(): boolean {\n    return this.state.topicContext.maxNumOfResolvableTopics >= 1;\n  }\n\n  topicReferenceWasUsedInCurrentTopicContext(): boolean {\n    return (\n      this.state.topicContext.maxTopicIndex != null &&\n      this.state.topicContext.maxTopicIndex >= 0\n    );\n  }\n\n  parseFSharpPipelineBody(prec: number): N.Expression {\n    const startPos = this.state.start;\n    const startLoc = this.state.startLoc;\n\n    this.state.potentialArrowAt = this.state.start;\n    const oldInFSharpPipelineDirectBody = this.state.inFSharpPipelineDirectBody;\n    this.state.inFSharpPipelineDirectBody = true;\n\n    const ret = this.parseExprOp(\n      this.parseMaybeUnary(),\n      startPos,\n      startLoc,\n      prec,\n    );\n\n    this.state.inFSharpPipelineDirectBody = oldInFSharpPipelineDirectBody;\n\n    return ret;\n  }\n\n  // https://github.com/tc39/proposal-js-module-blocks\n  parseModuleExpression(): N.ModuleExpression {\n    this.expectPlugin(\"moduleBlocks\");\n    const node = this.startNode<N.ModuleExpression>();\n    this.next(); // eat \"module\"\n    this.eat(tt.braceL);\n\n    const revertScopes = this.initializeScopes(/** inModule */ true);\n    this.enterInitialScopes();\n\n    const program = this.startNode<N.Program>();\n    try {\n      node.body = this.parseProgram(program, tt.braceR, \"module\");\n    } finally {\n      revertScopes();\n    }\n    this.eat(tt.braceR);\n    return this.finishNode<N.ModuleExpression>(node, \"ModuleExpression\");\n  }\n}\n","// @flow\n\nimport type { Options } from \"../options\";\nimport type State from \"../tokenizer/state\";\nimport type { PluginsMap } from \"./index\";\nimport type ScopeHandler from \"../util/scope\";\nimport type ExpressionScopeHandler from \"../util/expression-scope\";\nimport type ClassScopeHandler from \"../util/class-scope\";\nimport type ProductionParameterHandler from \"../util/production-parameter\";\n\nexport default class BaseParser {\n  // Properties set by constructor in index.js\n  declare options: Options;\n  declare inModule: boolean;\n  declare scope: ScopeHandler<*>;\n  declare classScope: ClassScopeHandler;\n  declare prodParam: ProductionParameterHandler;\n  declare expressionScope: ExpressionScopeHandler;\n  declare plugins: PluginsMap;\n  declare filename: ?string;\n  // Names of exports store. `default` is stored as a name for both\n  // `export default foo;` and `export { foo as default };`.\n  declare exportedIdentifiers: Set<string>;\n  sawUnambiguousESM: boolean = false;\n  ambiguousScriptDifferentAst: boolean = false;\n\n  // Initialized by Tokenizer\n  declare state: State;\n  // input and length are not in state as they are constant and we do\n  // not want to ever copy them, which happens if state gets cloned\n  declare input: string;\n  declare length: number;\n\n  hasPlugin(name: string): boolean {\n    return this.plugins.has(name);\n  }\n\n  getPluginOption(plugin: string, name: string) {\n    // $FlowIssue\n    if (this.hasPlugin(plugin)) return this.plugins.get(plugin)[name];\n  }\n}\n","// @flow\n\nimport { type Options } from \"./options\";\nimport {\n  hasPlugin,\n  validatePlugins,\n  mixinPluginNames,\n  mixinPlugins,\n  type PluginList,\n} from \"./plugin-utils\";\nimport Parser from \"./parser\";\n\nimport { types as tokTypes } from \"./tokenizer/types\";\nimport \"./tokenizer/context\";\n\nimport type { Expression, File } from \"./types\";\n\nexport function parse(input: string, options?: Options): File {\n  if (options?.sourceType === \"unambiguous\") {\n    options = {\n      ...options,\n    };\n    try {\n      options.sourceType = \"module\";\n      const parser = getParser(options, input);\n      const ast = parser.parse();\n\n      if (parser.sawUnambiguousESM) {\n        return ast;\n      }\n\n      if (parser.ambiguousScriptDifferentAst) {\n        // Top level await introduces code which can be both a valid script and\n        // a valid module, but which produces different ASTs:\n        //    await\n        //    0\n        // can be parsed either as an AwaitExpression, or as two ExpressionStatements.\n        try {\n          options.sourceType = \"script\";\n          return getParser(options, input).parse();\n        } catch {}\n      } else {\n        // This is both a valid module and a valid script, but\n        // we parse it as a script by default\n        ast.program.sourceType = \"script\";\n      }\n\n      return ast;\n    } catch (moduleError) {\n      try {\n        options.sourceType = \"script\";\n        return getParser(options, input).parse();\n      } catch {}\n\n      throw moduleError;\n    }\n  } else {\n    return getParser(options, input).parse();\n  }\n}\n\nexport function parseExpression(input: string, options?: Options): Expression {\n  const parser = getParser(options, input);\n  if (parser.options.strictMode) {\n    parser.state.strict = true;\n  }\n  return parser.getExpression();\n}\n\nexport { tokTypes };\n\nfunction getParser(options: ?Options, input: string): Parser {\n  let cls = Parser;\n  if (options?.plugins) {\n    validatePlugins(options.plugins);\n    cls = getParserClass(options.plugins);\n  }\n\n  return new cls(options, input);\n}\n\nconst parserClassCache: { [key: string]: Class<Parser> } = {};\n\n/** Get a Parser class with plugins applied. */\nfunction getParserClass(pluginsFromOptions: PluginList): Class<Parser> {\n  const pluginList = mixinPluginNames.filter(name =>\n    hasPlugin(pluginsFromOptions, name),\n  );\n\n  const key = pluginList.join(\"/\");\n  let cls = parserClassCache[key];\n  if (!cls) {\n    cls = Parser;\n    for (const plugin of pluginList) {\n      cls = mixinPlugins[plugin](cls);\n    }\n    parserClassCache[key] = cls;\n  }\n  return cls;\n}\n","(function (global, factory) {\n\ttypeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :\n\ttypeof define === 'function' && define.amd ? define(['exports'], factory) :\n\t(global = global || self, factory(global.estreeWalker = {}));\n}(this, (function (exports) { 'use strict';\n\n\t// @ts-check\n\t/** @typedef { import('estree').BaseNode} BaseNode */\n\n\t/** @typedef {{\n\t\tskip: () => void;\n\t\tremove: () => void;\n\t\treplace: (node: BaseNode) => void;\n\t}} WalkerContext */\n\n\tclass WalkerBase {\n\t\tconstructor() {\n\t\t\t/** @type {boolean} */\n\t\t\tthis.should_skip = false;\n\n\t\t\t/** @type {boolean} */\n\t\t\tthis.should_remove = false;\n\n\t\t\t/** @type {BaseNode | null} */\n\t\t\tthis.replacement = null;\n\n\t\t\t/** @type {WalkerContext} */\n\t\t\tthis.context = {\n\t\t\t\tskip: () => (this.should_skip = true),\n\t\t\t\tremove: () => (this.should_remove = true),\n\t\t\t\treplace: (node) => (this.replacement = node)\n\t\t\t};\n\t\t}\n\n\t\t/**\n\t\t *\n\t\t * @param {any} parent\n\t\t * @param {string} prop\n\t\t * @param {number} index\n\t\t * @param {BaseNode} node\n\t\t */\n\t\treplace(parent, prop, index, node) {\n\t\t\tif (parent) {\n\t\t\t\tif (index !== null) {\n\t\t\t\t\tparent[prop][index] = node;\n\t\t\t\t} else {\n\t\t\t\t\tparent[prop] = node;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t *\n\t\t * @param {any} parent\n\t\t * @param {string} prop\n\t\t * @param {number} index\n\t\t */\n\t\tremove(parent, prop, index) {\n\t\t\tif (parent) {\n\t\t\t\tif (index !== null) {\n\t\t\t\t\tparent[prop].splice(index, 1);\n\t\t\t\t} else {\n\t\t\t\t\tdelete parent[prop];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// @ts-check\n\n\t/** @typedef { import('estree').BaseNode} BaseNode */\n\t/** @typedef { import('./walker.js').WalkerContext} WalkerContext */\n\n\t/** @typedef {(\n\t *    this: WalkerContext,\n\t *    node: BaseNode,\n\t *    parent: BaseNode,\n\t *    key: string,\n\t *    index: number\n\t * ) => void} SyncHandler */\n\n\tclass SyncWalker extends WalkerBase {\n\t\t/**\n\t\t *\n\t\t * @param {SyncHandler} enter\n\t\t * @param {SyncHandler} leave\n\t\t */\n\t\tconstructor(enter, leave) {\n\t\t\tsuper();\n\n\t\t\t/** @type {SyncHandler} */\n\t\t\tthis.enter = enter;\n\n\t\t\t/** @type {SyncHandler} */\n\t\t\tthis.leave = leave;\n\t\t}\n\n\t\t/**\n\t\t *\n\t\t * @param {BaseNode} node\n\t\t * @param {BaseNode} parent\n\t\t * @param {string} [prop]\n\t\t * @param {number} [index]\n\t\t * @returns {BaseNode}\n\t\t */\n\t\tvisit(node, parent, prop, index) {\n\t\t\tif (node) {\n\t\t\t\tif (this.enter) {\n\t\t\t\t\tconst _should_skip = this.should_skip;\n\t\t\t\t\tconst _should_remove = this.should_remove;\n\t\t\t\t\tconst _replacement = this.replacement;\n\t\t\t\t\tthis.should_skip = false;\n\t\t\t\t\tthis.should_remove = false;\n\t\t\t\t\tthis.replacement = null;\n\n\t\t\t\t\tthis.enter.call(this.context, node, parent, prop, index);\n\n\t\t\t\t\tif (this.replacement) {\n\t\t\t\t\t\tnode = this.replacement;\n\t\t\t\t\t\tthis.replace(parent, prop, index, node);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (this.should_remove) {\n\t\t\t\t\t\tthis.remove(parent, prop, index);\n\t\t\t\t\t}\n\n\t\t\t\t\tconst skipped = this.should_skip;\n\t\t\t\t\tconst removed = this.should_remove;\n\n\t\t\t\t\tthis.should_skip = _should_skip;\n\t\t\t\t\tthis.should_remove = _should_remove;\n\t\t\t\t\tthis.replacement = _replacement;\n\n\t\t\t\t\tif (skipped) return node;\n\t\t\t\t\tif (removed) return null;\n\t\t\t\t}\n\n\t\t\t\tfor (const key in node) {\n\t\t\t\t\tconst value = node[key];\n\n\t\t\t\t\tif (typeof value !== \"object\") {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t} else if (Array.isArray(value)) {\n\t\t\t\t\t\tfor (let i = 0; i < value.length; i += 1) {\n\t\t\t\t\t\t\tif (value[i] !== null && typeof value[i].type === 'string') {\n\t\t\t\t\t\t\t\tif (!this.visit(value[i], node, key, i)) {\n\t\t\t\t\t\t\t\t\t// removed\n\t\t\t\t\t\t\t\t\ti--;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (value !== null && typeof value.type === \"string\") {\n\t\t\t\t\t\tthis.visit(value, node, key, null);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (this.leave) {\n\t\t\t\t\tconst _replacement = this.replacement;\n\t\t\t\t\tconst _should_remove = this.should_remove;\n\t\t\t\t\tthis.replacement = null;\n\t\t\t\t\tthis.should_remove = false;\n\n\t\t\t\t\tthis.leave.call(this.context, node, parent, prop, index);\n\n\t\t\t\t\tif (this.replacement) {\n\t\t\t\t\t\tnode = this.replacement;\n\t\t\t\t\t\tthis.replace(parent, prop, index, node);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (this.should_remove) {\n\t\t\t\t\t\tthis.remove(parent, prop, index);\n\t\t\t\t\t}\n\n\t\t\t\t\tconst removed = this.should_remove;\n\n\t\t\t\t\tthis.replacement = _replacement;\n\t\t\t\t\tthis.should_remove = _should_remove;\n\n\t\t\t\t\tif (removed) return null;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn node;\n\t\t}\n\t}\n\n\t// @ts-check\n\n\t/** @typedef { import('estree').BaseNode} BaseNode */\n\t/** @typedef { import('./walker').WalkerContext} WalkerContext */\n\n\t/** @typedef {(\n\t *    this: WalkerContext,\n\t *    node: BaseNode,\n\t *    parent: BaseNode,\n\t *    key: string,\n\t *    index: number\n\t * ) => Promise<void>} AsyncHandler */\n\n\tclass AsyncWalker extends WalkerBase {\n\t\t/**\n\t\t *\n\t\t * @param {AsyncHandler} enter\n\t\t * @param {AsyncHandler} leave\n\t\t */\n\t\tconstructor(enter, leave) {\n\t\t\tsuper();\n\n\t\t\t/** @type {AsyncHandler} */\n\t\t\tthis.enter = enter;\n\n\t\t\t/** @type {AsyncHandler} */\n\t\t\tthis.leave = leave;\n\t\t}\n\n\t\t/**\n\t\t *\n\t\t * @param {BaseNode} node\n\t\t * @param {BaseNode} parent\n\t\t * @param {string} [prop]\n\t\t * @param {number} [index]\n\t\t * @returns {Promise<BaseNode>}\n\t\t */\n\t\tasync visit(node, parent, prop, index) {\n\t\t\tif (node) {\n\t\t\t\tif (this.enter) {\n\t\t\t\t\tconst _should_skip = this.should_skip;\n\t\t\t\t\tconst _should_remove = this.should_remove;\n\t\t\t\t\tconst _replacement = this.replacement;\n\t\t\t\t\tthis.should_skip = false;\n\t\t\t\t\tthis.should_remove = false;\n\t\t\t\t\tthis.replacement = null;\n\n\t\t\t\t\tawait this.enter.call(this.context, node, parent, prop, index);\n\n\t\t\t\t\tif (this.replacement) {\n\t\t\t\t\t\tnode = this.replacement;\n\t\t\t\t\t\tthis.replace(parent, prop, index, node);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (this.should_remove) {\n\t\t\t\t\t\tthis.remove(parent, prop, index);\n\t\t\t\t\t}\n\n\t\t\t\t\tconst skipped = this.should_skip;\n\t\t\t\t\tconst removed = this.should_remove;\n\n\t\t\t\t\tthis.should_skip = _should_skip;\n\t\t\t\t\tthis.should_remove = _should_remove;\n\t\t\t\t\tthis.replacement = _replacement;\n\n\t\t\t\t\tif (skipped) return node;\n\t\t\t\t\tif (removed) return null;\n\t\t\t\t}\n\n\t\t\t\tfor (const key in node) {\n\t\t\t\t\tconst value = node[key];\n\n\t\t\t\t\tif (typeof value !== \"object\") {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t} else if (Array.isArray(value)) {\n\t\t\t\t\t\tfor (let i = 0; i < value.length; i += 1) {\n\t\t\t\t\t\t\tif (value[i] !== null && typeof value[i].type === 'string') {\n\t\t\t\t\t\t\t\tif (!(await this.visit(value[i], node, key, i))) {\n\t\t\t\t\t\t\t\t\t// removed\n\t\t\t\t\t\t\t\t\ti--;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (value !== null && typeof value.type === \"string\") {\n\t\t\t\t\t\tawait this.visit(value, node, key, null);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (this.leave) {\n\t\t\t\t\tconst _replacement = this.replacement;\n\t\t\t\t\tconst _should_remove = this.should_remove;\n\t\t\t\t\tthis.replacement = null;\n\t\t\t\t\tthis.should_remove = false;\n\n\t\t\t\t\tawait this.leave.call(this.context, node, parent, prop, index);\n\n\t\t\t\t\tif (this.replacement) {\n\t\t\t\t\t\tnode = this.replacement;\n\t\t\t\t\t\tthis.replace(parent, prop, index, node);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (this.should_remove) {\n\t\t\t\t\t\tthis.remove(parent, prop, index);\n\t\t\t\t\t}\n\n\t\t\t\t\tconst removed = this.should_remove;\n\n\t\t\t\t\tthis.replacement = _replacement;\n\t\t\t\t\tthis.should_remove = _should_remove;\n\n\t\t\t\t\tif (removed) return null;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn node;\n\t\t}\n\t}\n\n\t// @ts-check\n\n\t/** @typedef { import('estree').BaseNode} BaseNode */\n\t/** @typedef { import('./sync.js').SyncHandler} SyncHandler */\n\t/** @typedef { import('./async.js').AsyncHandler} AsyncHandler */\n\n\t/**\n\t *\n\t * @param {BaseNode} ast\n\t * @param {{\n\t *   enter?: SyncHandler\n\t *   leave?: SyncHandler\n\t * }} walker\n\t * @returns {BaseNode}\n\t */\n\tfunction walk(ast, { enter, leave }) {\n\t\tconst instance = new SyncWalker(enter, leave);\n\t\treturn instance.visit(ast, null);\n\t}\n\n\t/**\n\t *\n\t * @param {BaseNode} ast\n\t * @param {{\n\t *   enter?: AsyncHandler\n\t *   leave?: AsyncHandler\n\t * }} walker\n\t * @returns {Promise<BaseNode>}\n\t */\n\tasync function asyncWalk(ast, { enter, leave }) {\n\t\tconst instance = new AsyncWalker(enter, leave);\n\t\treturn await instance.visit(ast, null);\n\t}\n\n\texports.asyncWalk = asyncWalk;\n\texports.walk = walk;\n\n\tObject.defineProperty(exports, '__esModule', { value: true });\n\n})));\n","'use strict'\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./dist/runtime-dom.cjs.prod.js')\n} else {\n  module.exports = require('./dist/runtime-dom.cjs.js')\n}\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar runtimeCore = require('@vue/runtime-core');\nvar shared = require('@vue/shared');\n\nconst svgNS = 'http://www.w3.org/2000/svg';\r\nconst doc = (typeof document !== 'undefined' ? document : null);\r\nlet tempContainer;\r\nlet tempSVGContainer;\r\nconst nodeOps = {\r\n    insert: (child, parent, anchor) => {\r\n        parent.insertBefore(child, anchor || null);\r\n    },\r\n    remove: child => {\r\n        const parent = child.parentNode;\r\n        if (parent) {\r\n            parent.removeChild(child);\r\n        }\r\n    },\r\n    createElement: (tag, isSVG, is, props) => {\r\n        const el = isSVG\r\n            ? doc.createElementNS(svgNS, tag)\r\n            : doc.createElement(tag, is ? { is } : undefined);\r\n        if (tag === 'select' && props && props.multiple != null) {\r\n            el.setAttribute('multiple', props.multiple);\r\n        }\r\n        return el;\r\n    },\r\n    createText: text => doc.createTextNode(text),\r\n    createComment: text => doc.createComment(text),\r\n    setText: (node, text) => {\r\n        node.nodeValue = text;\r\n    },\r\n    setElementText: (el, text) => {\r\n        el.textContent = text;\r\n    },\r\n    parentNode: node => node.parentNode,\r\n    nextSibling: node => node.nextSibling,\r\n    querySelector: selector => doc.querySelector(selector),\r\n    setScopeId(el, id) {\r\n        el.setAttribute(id, '');\r\n    },\r\n    cloneNode(el) {\r\n        const cloned = el.cloneNode(true);\r\n        // #3072\r\n        // - in `patchDOMProp`, we store the actual value in the `el._value` property.\r\n        // - normally, elements using `:value` bindings will not be hoisted, but if\r\n        //   the bound value is a constant, e.g. `:value=\"true\"` - they do get\r\n        //   hoisted.\r\n        // - in production, hoisted nodes are cloned when subsequent inserts, but\r\n        //   cloneNode() does not copy the custom property we attached.\r\n        // - This may need to account for other custom DOM properties we attach to\r\n        //   elements in addition to `_value` in the future.\r\n        if (`_value` in el) {\r\n            cloned._value = el._value;\r\n        }\r\n        return cloned;\r\n    },\r\n    // __UNSAFE__\r\n    // Reason: innerHTML.\r\n    // Static content here can only come from compiled templates.\r\n    // As long as the user only uses trusted templates, this is safe.\r\n    insertStaticContent(content, parent, anchor, isSVG) {\r\n        const temp = isSVG\r\n            ? tempSVGContainer ||\r\n                (tempSVGContainer = doc.createElementNS(svgNS, 'svg'))\r\n            : tempContainer || (tempContainer = doc.createElement('div'));\r\n        temp.innerHTML = content;\r\n        const first = temp.firstChild;\r\n        let node = first;\r\n        let last = node;\r\n        while (node) {\r\n            last = node;\r\n            nodeOps.insert(node, parent, anchor);\r\n            node = temp.firstChild;\r\n        }\r\n        return [first, last];\r\n    }\r\n};\n\n// compiler should normalize class + :class bindings on the same element\r\n// into a single binding ['staticClass', dynamic]\r\nfunction patchClass(el, value, isSVG) {\r\n    if (value == null) {\r\n        value = '';\r\n    }\r\n    if (isSVG) {\r\n        el.setAttribute('class', value);\r\n    }\r\n    else {\r\n        // directly setting className should be faster than setAttribute in theory\r\n        // if this is an element during a transition, take the temporary transition\r\n        // classes into account.\r\n        const transitionClasses = el._vtc;\r\n        if (transitionClasses) {\r\n            value = (value\r\n                ? [value, ...transitionClasses]\r\n                : [...transitionClasses]).join(' ');\r\n        }\r\n        el.className = value;\r\n    }\r\n}\n\nfunction patchStyle(el, prev, next) {\r\n    const style = el.style;\r\n    if (!next) {\r\n        el.removeAttribute('style');\r\n    }\r\n    else if (shared.isString(next)) {\r\n        if (prev !== next) {\r\n            const current = style.display;\r\n            style.cssText = next;\r\n            // indicates that the `display` of the element is controlled by `v-show`,\r\n            // so we always keep the current `display` value regardless of the `style` value,\r\n            // thus handing over control to `v-show`.\r\n            if ('_vod' in el) {\r\n                style.display = current;\r\n            }\r\n        }\r\n    }\r\n    else {\r\n        for (const key in next) {\r\n            setStyle(style, key, next[key]);\r\n        }\r\n        if (prev && !shared.isString(prev)) {\r\n            for (const key in prev) {\r\n                if (next[key] == null) {\r\n                    setStyle(style, key, '');\r\n                }\r\n            }\r\n        }\r\n    }\r\n}\r\nconst importantRE = /\\s*!important$/;\r\nfunction setStyle(style, name, val) {\r\n    if (shared.isArray(val)) {\r\n        val.forEach(v => setStyle(style, name, v));\r\n    }\r\n    else {\r\n        if (name.startsWith('--')) {\r\n            // custom property definition\r\n            style.setProperty(name, val);\r\n        }\r\n        else {\r\n            const prefixed = autoPrefix(style, name);\r\n            if (importantRE.test(val)) {\r\n                // !important\r\n                style.setProperty(shared.hyphenate(prefixed), val.replace(importantRE, ''), 'important');\r\n            }\r\n            else {\r\n                style[prefixed] = val;\r\n            }\r\n        }\r\n    }\r\n}\r\nconst prefixes = ['Webkit', 'Moz', 'ms'];\r\nconst prefixCache = {};\r\nfunction autoPrefix(style, rawName) {\r\n    const cached = prefixCache[rawName];\r\n    if (cached) {\r\n        return cached;\r\n    }\r\n    let name = runtimeCore.camelize(rawName);\r\n    if (name !== 'filter' && name in style) {\r\n        return (prefixCache[rawName] = name);\r\n    }\r\n    name = shared.capitalize(name);\r\n    for (let i = 0; i < prefixes.length; i++) {\r\n        const prefixed = prefixes[i] + name;\r\n        if (prefixed in style) {\r\n            return (prefixCache[rawName] = prefixed);\r\n        }\r\n    }\r\n    return rawName;\r\n}\n\nconst xlinkNS = 'http://www.w3.org/1999/xlink';\r\nfunction patchAttr(el, key, value, isSVG, instance) {\r\n    if (isSVG && key.startsWith('xlink:')) {\r\n        if (value == null) {\r\n            el.removeAttributeNS(xlinkNS, key.slice(6, key.length));\r\n        }\r\n        else {\r\n            el.setAttributeNS(xlinkNS, key, value);\r\n        }\r\n    }\r\n    else {\r\n        // note we are only checking boolean attributes that don't have a\r\n        // corresponding dom prop of the same name here.\r\n        const isBoolean = shared.isSpecialBooleanAttr(key);\r\n        if (value == null || (isBoolean && value === false)) {\r\n            el.removeAttribute(key);\r\n        }\r\n        else {\r\n            el.setAttribute(key, isBoolean ? '' : value);\r\n        }\r\n    }\r\n}\n\n// __UNSAFE__\r\n// functions. The user is responsible for using them with only trusted content.\r\nfunction patchDOMProp(el, key, value, \r\n// the following args are passed only due to potential innerHTML/textContent\r\n// overriding existing VNodes, in which case the old tree must be properly\r\n// unmounted.\r\nprevChildren, parentComponent, parentSuspense, unmountChildren) {\r\n    if (key === 'innerHTML' || key === 'textContent') {\r\n        if (prevChildren) {\r\n            unmountChildren(prevChildren, parentComponent, parentSuspense);\r\n        }\r\n        el[key] = value == null ? '' : value;\r\n        return;\r\n    }\r\n    if (key === 'value' && el.tagName !== 'PROGRESS') {\r\n        // store value as _value as well since\r\n        // non-string values will be stringified.\r\n        el._value = value;\r\n        const newValue = value == null ? '' : value;\r\n        if (el.value !== newValue) {\r\n            el.value = newValue;\r\n        }\r\n        if (value == null) {\r\n            el.removeAttribute(key);\r\n        }\r\n        return;\r\n    }\r\n    if (value === '' || value == null) {\r\n        const type = typeof el[key];\r\n        if (value === '' && type === 'boolean') {\r\n            // e.g. <select multiple> compiles to { multiple: '' }\r\n            el[key] = true;\r\n            return;\r\n        }\r\n        else if (value == null && type === 'string') {\r\n            // e.g. <div :id=\"null\">\r\n            el[key] = '';\r\n            el.removeAttribute(key);\r\n            return;\r\n        }\r\n        else if (type === 'number') {\r\n            // e.g. <img :width=\"null\">\r\n            el[key] = 0;\r\n            el.removeAttribute(key);\r\n            return;\r\n        }\r\n    }\r\n    // some properties perform value validation and throw\r\n    try {\r\n        el[key] = value;\r\n    }\r\n    catch (e) {\r\n    }\r\n}\n\n// Async edge case fix requires storing an event listener's attach timestamp.\r\nlet _getNow = Date.now;\r\nlet skipTimestampCheck = false;\r\nif (typeof window !== 'undefined') {\r\n    // Determine what event timestamp the browser is using. Annoyingly, the\r\n    // timestamp can either be hi-res (relative to page load) or low-res\r\n    // (relative to UNIX epoch), so in order to compare time we have to use the\r\n    // same timestamp type when saving the flush timestamp.\r\n    if (_getNow() > document.createEvent('Event').timeStamp) {\r\n        // if the low-res timestamp which is bigger than the event timestamp\r\n        // (which is evaluated AFTER) it means the event is using a hi-res timestamp,\r\n        // and we need to use the hi-res version for event listeners as well.\r\n        _getNow = () => performance.now();\r\n    }\r\n    // #3485: Firefox <= 53 has incorrect Event.timeStamp implementation\r\n    // and does not fire microtasks in between event propagation, so safe to exclude.\r\n    const ffMatch = navigator.userAgent.match(/firefox\\/(\\d+)/i);\r\n    skipTimestampCheck = !!(ffMatch && Number(ffMatch[1]) <= 53);\r\n}\r\n// To avoid the overhead of repeatedly calling performance.now(), we cache\r\n// and use the same timestamp for all event listeners attached in the same tick.\r\nlet cachedNow = 0;\r\nconst p = Promise.resolve();\r\nconst reset = () => {\r\n    cachedNow = 0;\r\n};\r\nconst getNow = () => cachedNow || (p.then(reset), (cachedNow = _getNow()));\r\nfunction addEventListener(el, event, handler, options) {\r\n    el.addEventListener(event, handler, options);\r\n}\r\nfunction removeEventListener(el, event, handler, options) {\r\n    el.removeEventListener(event, handler, options);\r\n}\r\nfunction patchEvent(el, rawName, prevValue, nextValue, instance = null) {\r\n    // vei = vue event invokers\r\n    const invokers = el._vei || (el._vei = {});\r\n    const existingInvoker = invokers[rawName];\r\n    if (nextValue && existingInvoker) {\r\n        // patch\r\n        existingInvoker.value = nextValue;\r\n    }\r\n    else {\r\n        const [name, options] = parseName(rawName);\r\n        if (nextValue) {\r\n            // add\r\n            const invoker = (invokers[rawName] = createInvoker(nextValue, instance));\r\n            addEventListener(el, name, invoker, options);\r\n        }\r\n        else if (existingInvoker) {\r\n            // remove\r\n            removeEventListener(el, name, existingInvoker, options);\r\n            invokers[rawName] = undefined;\r\n        }\r\n    }\r\n}\r\nconst optionsModifierRE = /(?:Once|Passive|Capture)$/;\r\nfunction parseName(name) {\r\n    let options;\r\n    if (optionsModifierRE.test(name)) {\r\n        options = {};\r\n        let m;\r\n        while ((m = name.match(optionsModifierRE))) {\r\n            name = name.slice(0, name.length - m[0].length);\r\n            options[m[0].toLowerCase()] = true;\r\n        }\r\n    }\r\n    return [shared.hyphenate(name.slice(2)), options];\r\n}\r\nfunction createInvoker(initialValue, instance) {\r\n    const invoker = (e) => {\r\n        // async edge case #6566: inner click event triggers patch, event handler\r\n        // attached to outer element during patch, and triggered again. This\r\n        // happens because browsers fire microtask ticks between event propagation.\r\n        // the solution is simple: we save the timestamp when a handler is attached,\r\n        // and the handler would only fire if the event passed to it was fired\r\n        // AFTER it was attached.\r\n        const timeStamp = e.timeStamp || _getNow();\r\n        if (skipTimestampCheck || timeStamp >= invoker.attached - 1) {\r\n            runtimeCore.callWithAsyncErrorHandling(patchStopImmediatePropagation(e, invoker.value), instance, 5 /* NATIVE_EVENT_HANDLER */, [e]);\r\n        }\r\n    };\r\n    invoker.value = initialValue;\r\n    invoker.attached = getNow();\r\n    return invoker;\r\n}\r\nfunction patchStopImmediatePropagation(e, value) {\r\n    if (shared.isArray(value)) {\r\n        const originalStop = e.stopImmediatePropagation;\r\n        e.stopImmediatePropagation = () => {\r\n            originalStop.call(e);\r\n            e._stopped = true;\r\n        };\r\n        return value.map(fn => (e) => !e._stopped && fn(e));\r\n    }\r\n    else {\r\n        return value;\r\n    }\r\n}\n\nconst nativeOnRE = /^on[a-z]/;\r\nconst forcePatchProp = (_, key) => key === 'value';\r\nconst patchProp = (el, key, prevValue, nextValue, isSVG = false, prevChildren, parentComponent, parentSuspense, unmountChildren) => {\r\n    switch (key) {\r\n        // special\r\n        case 'class':\r\n            patchClass(el, nextValue, isSVG);\r\n            break;\r\n        case 'style':\r\n            patchStyle(el, prevValue, nextValue);\r\n            break;\r\n        default:\r\n            if (shared.isOn(key)) {\r\n                // ignore v-model listeners\r\n                if (!shared.isModelListener(key)) {\r\n                    patchEvent(el, key, prevValue, nextValue, parentComponent);\r\n                }\r\n            }\r\n            else if (shouldSetAsProp(el, key, nextValue, isSVG)) {\r\n                patchDOMProp(el, key, nextValue, prevChildren, parentComponent, parentSuspense, unmountChildren);\r\n            }\r\n            else {\r\n                // special case for <input v-model type=\"checkbox\"> with\r\n                // :true-value & :false-value\r\n                // store value as dom properties since non-string values will be\r\n                // stringified.\r\n                if (key === 'true-value') {\r\n                    el._trueValue = nextValue;\r\n                }\r\n                else if (key === 'false-value') {\r\n                    el._falseValue = nextValue;\r\n                }\r\n                patchAttr(el, key, nextValue, isSVG);\r\n            }\r\n            break;\r\n    }\r\n};\r\nfunction shouldSetAsProp(el, key, value, isSVG) {\r\n    if (isSVG) {\r\n        // most keys must be set as attribute on svg elements to work\r\n        // ...except innerHTML\r\n        if (key === 'innerHTML') {\r\n            return true;\r\n        }\r\n        // or native onclick with function values\r\n        if (key in el && nativeOnRE.test(key) && shared.isFunction(value)) {\r\n            return true;\r\n        }\r\n        return false;\r\n    }\r\n    // spellcheck and draggable are numerated attrs, however their\r\n    // corresponding DOM properties are actually booleans - this leads to\r\n    // setting it with a string \"false\" value leading it to be coerced to\r\n    // `true`, so we need to always treat them as attributes.\r\n    // Note that `contentEditable` doesn't have this problem: its DOM\r\n    // property is also enumerated string values.\r\n    if (key === 'spellcheck' || key === 'draggable') {\r\n        return false;\r\n    }\r\n    // #1787, #2840 form property on form elements is readonly and must be set as\r\n    // attribute.\r\n    if (key === 'form') {\r\n        return false;\r\n    }\r\n    // #1526 <input list> must be set as attribute\r\n    if (key === 'list' && el.tagName === 'INPUT') {\r\n        return false;\r\n    }\r\n    // #2766 <textarea type> must be set as attribute\r\n    if (key === 'type' && el.tagName === 'TEXTAREA') {\r\n        return false;\r\n    }\r\n    // native onclick with string value, must be set as attribute\r\n    if (nativeOnRE.test(key) && shared.isString(value)) {\r\n        return false;\r\n    }\r\n    return key in el;\r\n}\n\nfunction useCssModule(name = '$style') {\r\n    /* istanbul ignore else */\r\n    {\r\n        const instance = runtimeCore.getCurrentInstance();\r\n        if (!instance) {\r\n            return shared.EMPTY_OBJ;\r\n        }\r\n        const modules = instance.type.__cssModules;\r\n        if (!modules) {\r\n            return shared.EMPTY_OBJ;\r\n        }\r\n        const mod = modules[name];\r\n        if (!mod) {\r\n            return shared.EMPTY_OBJ;\r\n        }\r\n        return mod;\r\n    }\r\n}\n\n/**\r\n * Runtime helper for SFC's CSS variable injection feature.\r\n * @private\r\n */\r\nfunction useCssVars(getter) {\r\n    return;\r\n}\n\nconst TRANSITION = 'transition';\r\nconst ANIMATION = 'animation';\r\n// DOM Transition is a higher-order-component based on the platform-agnostic\r\n// base Transition component, with DOM-specific logic.\r\nconst Transition = (props, { slots }) => runtimeCore.h(runtimeCore.BaseTransition, resolveTransitionProps(props), slots);\r\nTransition.displayName = 'Transition';\r\nconst DOMTransitionPropsValidators = {\r\n    name: String,\r\n    type: String,\r\n    css: {\r\n        type: Boolean,\r\n        default: true\r\n    },\r\n    duration: [String, Number, Object],\r\n    enterFromClass: String,\r\n    enterActiveClass: String,\r\n    enterToClass: String,\r\n    appearFromClass: String,\r\n    appearActiveClass: String,\r\n    appearToClass: String,\r\n    leaveFromClass: String,\r\n    leaveActiveClass: String,\r\n    leaveToClass: String\r\n};\r\nconst TransitionPropsValidators = (Transition.props = /*#__PURE__*/ shared.extend({}, runtimeCore.BaseTransition.props, DOMTransitionPropsValidators));\r\n/**\r\n * #3227 Incoming hooks may be merged into arrays when wrapping Transition\r\n * with custom HOCs.\r\n */\r\nconst callHook = (hook, args = []) => {\r\n    if (shared.isArray(hook)) {\r\n        hook.forEach(h => h(...args));\r\n    }\r\n    else if (hook) {\r\n        hook(...args);\r\n    }\r\n};\r\n/**\r\n * Check if a hook expects a callback (2nd arg), which means the user\r\n * intends to explicitly control the end of the transition.\r\n */\r\nconst hasExplicitCallback = (hook) => {\r\n    return hook\r\n        ? shared.isArray(hook)\r\n            ? hook.some(h => h.length > 1)\r\n            : hook.length > 1\r\n        : false;\r\n};\r\nfunction resolveTransitionProps(rawProps) {\r\n    const baseProps = {};\r\n    for (const key in rawProps) {\r\n        if (!(key in DOMTransitionPropsValidators)) {\r\n            baseProps[key] = rawProps[key];\r\n        }\r\n    }\r\n    if (rawProps.css === false) {\r\n        return baseProps;\r\n    }\r\n    const { name = 'v', type, duration, enterFromClass = `${name}-enter-from`, enterActiveClass = `${name}-enter-active`, enterToClass = `${name}-enter-to`, appearFromClass = enterFromClass, appearActiveClass = enterActiveClass, appearToClass = enterToClass, leaveFromClass = `${name}-leave-from`, leaveActiveClass = `${name}-leave-active`, leaveToClass = `${name}-leave-to` } = rawProps;\r\n    const durations = normalizeDuration(duration);\r\n    const enterDuration = durations && durations[0];\r\n    const leaveDuration = durations && durations[1];\r\n    const { onBeforeEnter, onEnter, onEnterCancelled, onLeave, onLeaveCancelled, onBeforeAppear = onBeforeEnter, onAppear = onEnter, onAppearCancelled = onEnterCancelled } = baseProps;\r\n    const finishEnter = (el, isAppear, done) => {\r\n        removeTransitionClass(el, isAppear ? appearToClass : enterToClass);\r\n        removeTransitionClass(el, isAppear ? appearActiveClass : enterActiveClass);\r\n        done && done();\r\n    };\r\n    const finishLeave = (el, done) => {\r\n        removeTransitionClass(el, leaveToClass);\r\n        removeTransitionClass(el, leaveActiveClass);\r\n        done && done();\r\n    };\r\n    const makeEnterHook = (isAppear) => {\r\n        return (el, done) => {\r\n            const hook = isAppear ? onAppear : onEnter;\r\n            const resolve = () => finishEnter(el, isAppear, done);\r\n            callHook(hook, [el, resolve]);\r\n            nextFrame(() => {\r\n                removeTransitionClass(el, isAppear ? appearFromClass : enterFromClass);\r\n                addTransitionClass(el, isAppear ? appearToClass : enterToClass);\r\n                if (!hasExplicitCallback(hook)) {\r\n                    whenTransitionEnds(el, type, enterDuration, resolve);\r\n                }\r\n            });\r\n        };\r\n    };\r\n    return shared.extend(baseProps, {\r\n        onBeforeEnter(el) {\r\n            callHook(onBeforeEnter, [el]);\r\n            addTransitionClass(el, enterFromClass);\r\n            addTransitionClass(el, enterActiveClass);\r\n        },\r\n        onBeforeAppear(el) {\r\n            callHook(onBeforeAppear, [el]);\r\n            addTransitionClass(el, appearFromClass);\r\n            addTransitionClass(el, appearActiveClass);\r\n        },\r\n        onEnter: makeEnterHook(false),\r\n        onAppear: makeEnterHook(true),\r\n        onLeave(el, done) {\r\n            const resolve = () => finishLeave(el, done);\r\n            addTransitionClass(el, leaveFromClass);\r\n            // force reflow so *-leave-from classes immediately take effect (#2593)\r\n            forceReflow();\r\n            addTransitionClass(el, leaveActiveClass);\r\n            nextFrame(() => {\r\n                removeTransitionClass(el, leaveFromClass);\r\n                addTransitionClass(el, leaveToClass);\r\n                if (!hasExplicitCallback(onLeave)) {\r\n                    whenTransitionEnds(el, type, leaveDuration, resolve);\r\n                }\r\n            });\r\n            callHook(onLeave, [el, resolve]);\r\n        },\r\n        onEnterCancelled(el) {\r\n            finishEnter(el, false);\r\n            callHook(onEnterCancelled, [el]);\r\n        },\r\n        onAppearCancelled(el) {\r\n            finishEnter(el, true);\r\n            callHook(onAppearCancelled, [el]);\r\n        },\r\n        onLeaveCancelled(el) {\r\n            finishLeave(el);\r\n            callHook(onLeaveCancelled, [el]);\r\n        }\r\n    });\r\n}\r\nfunction normalizeDuration(duration) {\r\n    if (duration == null) {\r\n        return null;\r\n    }\r\n    else if (shared.isObject(duration)) {\r\n        return [NumberOf(duration.enter), NumberOf(duration.leave)];\r\n    }\r\n    else {\r\n        const n = NumberOf(duration);\r\n        return [n, n];\r\n    }\r\n}\r\nfunction NumberOf(val) {\r\n    const res = shared.toNumber(val);\r\n    return res;\r\n}\r\nfunction addTransitionClass(el, cls) {\r\n    cls.split(/\\s+/).forEach(c => c && el.classList.add(c));\r\n    (el._vtc ||\r\n        (el._vtc = new Set())).add(cls);\r\n}\r\nfunction removeTransitionClass(el, cls) {\r\n    cls.split(/\\s+/).forEach(c => c && el.classList.remove(c));\r\n    const { _vtc } = el;\r\n    if (_vtc) {\r\n        _vtc.delete(cls);\r\n        if (!_vtc.size) {\r\n            el._vtc = undefined;\r\n        }\r\n    }\r\n}\r\nfunction nextFrame(cb) {\r\n    requestAnimationFrame(() => {\r\n        requestAnimationFrame(cb);\r\n    });\r\n}\r\nlet endId = 0;\r\nfunction whenTransitionEnds(el, expectedType, explicitTimeout, resolve) {\r\n    const id = (el._endId = ++endId);\r\n    const resolveIfNotStale = () => {\r\n        if (id === el._endId) {\r\n            resolve();\r\n        }\r\n    };\r\n    if (explicitTimeout) {\r\n        return setTimeout(resolveIfNotStale, explicitTimeout);\r\n    }\r\n    const { type, timeout, propCount } = getTransitionInfo(el, expectedType);\r\n    if (!type) {\r\n        return resolve();\r\n    }\r\n    const endEvent = type + 'end';\r\n    let ended = 0;\r\n    const end = () => {\r\n        el.removeEventListener(endEvent, onEnd);\r\n        resolveIfNotStale();\r\n    };\r\n    const onEnd = (e) => {\r\n        if (e.target === el && ++ended >= propCount) {\r\n            end();\r\n        }\r\n    };\r\n    setTimeout(() => {\r\n        if (ended < propCount) {\r\n            end();\r\n        }\r\n    }, timeout + 1);\r\n    el.addEventListener(endEvent, onEnd);\r\n}\r\nfunction getTransitionInfo(el, expectedType) {\r\n    const styles = window.getComputedStyle(el);\r\n    // JSDOM may return undefined for transition properties\r\n    const getStyleProperties = (key) => (styles[key] || '').split(', ');\r\n    const transitionDelays = getStyleProperties(TRANSITION + 'Delay');\r\n    const transitionDurations = getStyleProperties(TRANSITION + 'Duration');\r\n    const transitionTimeout = getTimeout(transitionDelays, transitionDurations);\r\n    const animationDelays = getStyleProperties(ANIMATION + 'Delay');\r\n    const animationDurations = getStyleProperties(ANIMATION + 'Duration');\r\n    const animationTimeout = getTimeout(animationDelays, animationDurations);\r\n    let type = null;\r\n    let timeout = 0;\r\n    let propCount = 0;\r\n    /* istanbul ignore if */\r\n    if (expectedType === TRANSITION) {\r\n        if (transitionTimeout > 0) {\r\n            type = TRANSITION;\r\n            timeout = transitionTimeout;\r\n            propCount = transitionDurations.length;\r\n        }\r\n    }\r\n    else if (expectedType === ANIMATION) {\r\n        if (animationTimeout > 0) {\r\n            type = ANIMATION;\r\n            timeout = animationTimeout;\r\n            propCount = animationDurations.length;\r\n        }\r\n    }\r\n    else {\r\n        timeout = Math.max(transitionTimeout, animationTimeout);\r\n        type =\r\n            timeout > 0\r\n                ? transitionTimeout > animationTimeout\r\n                    ? TRANSITION\r\n                    : ANIMATION\r\n                : null;\r\n        propCount = type\r\n            ? type === TRANSITION\r\n                ? transitionDurations.length\r\n                : animationDurations.length\r\n            : 0;\r\n    }\r\n    const hasTransform = type === TRANSITION &&\r\n        /\\b(transform|all)(,|$)/.test(styles[TRANSITION + 'Property']);\r\n    return {\r\n        type,\r\n        timeout,\r\n        propCount,\r\n        hasTransform\r\n    };\r\n}\r\nfunction getTimeout(delays, durations) {\r\n    while (delays.length < durations.length) {\r\n        delays = delays.concat(delays);\r\n    }\r\n    return Math.max(...durations.map((d, i) => toMs(d) + toMs(delays[i])));\r\n}\r\n// Old versions of Chromium (below 61.0.3163.100) formats floating pointer\r\n// numbers in a locale-dependent way, using a comma instead of a dot.\r\n// If comma is not replaced with a dot, the input will be rounded down\r\n// (i.e. acting as a floor function) causing unexpected behaviors\r\nfunction toMs(s) {\r\n    return Number(s.slice(0, -1).replace(',', '.')) * 1000;\r\n}\r\n// synchronously force layout to put elements into a certain state\r\nfunction forceReflow() {\r\n    return document.body.offsetHeight;\r\n}\n\nconst positionMap = new WeakMap();\r\nconst newPositionMap = new WeakMap();\r\nconst TransitionGroupImpl = {\r\n    name: 'TransitionGroup',\r\n    props: /*#__PURE__*/ shared.extend({}, TransitionPropsValidators, {\r\n        tag: String,\r\n        moveClass: String\r\n    }),\r\n    setup(props, { slots }) {\r\n        const instance = runtimeCore.getCurrentInstance();\r\n        const state = runtimeCore.useTransitionState();\r\n        let prevChildren;\r\n        let children;\r\n        runtimeCore.onUpdated(() => {\r\n            // children is guaranteed to exist after initial render\r\n            if (!prevChildren.length) {\r\n                return;\r\n            }\r\n            const moveClass = props.moveClass || `${props.name || 'v'}-move`;\r\n            if (!hasCSSTransform(prevChildren[0].el, instance.vnode.el, moveClass)) {\r\n                return;\r\n            }\r\n            // we divide the work into three loops to avoid mixing DOM reads and writes\r\n            // in each iteration - which helps prevent layout thrashing.\r\n            prevChildren.forEach(callPendingCbs);\r\n            prevChildren.forEach(recordPosition);\r\n            const movedChildren = prevChildren.filter(applyTranslation);\r\n            // force reflow to put everything in position\r\n            forceReflow();\r\n            movedChildren.forEach(c => {\r\n                const el = c.el;\r\n                const style = el.style;\r\n                addTransitionClass(el, moveClass);\r\n                style.transform = style.webkitTransform = style.transitionDuration = '';\r\n                const cb = (el._moveCb = (e) => {\r\n                    if (e && e.target !== el) {\r\n                        return;\r\n                    }\r\n                    if (!e || /transform$/.test(e.propertyName)) {\r\n                        el.removeEventListener('transitionend', cb);\r\n                        el._moveCb = null;\r\n                        removeTransitionClass(el, moveClass);\r\n                    }\r\n                });\r\n                el.addEventListener('transitionend', cb);\r\n            });\r\n        });\r\n        return () => {\r\n            const rawProps = runtimeCore.toRaw(props);\r\n            const cssTransitionProps = resolveTransitionProps(rawProps);\r\n            let tag = rawProps.tag || runtimeCore.Fragment;\r\n            prevChildren = children;\r\n            children = slots.default ? runtimeCore.getTransitionRawChildren(slots.default()) : [];\r\n            for (let i = 0; i < children.length; i++) {\r\n                const child = children[i];\r\n                if (child.key != null) {\r\n                    runtimeCore.setTransitionHooks(child, runtimeCore.resolveTransitionHooks(child, cssTransitionProps, state, instance));\r\n                }\r\n            }\r\n            if (prevChildren) {\r\n                for (let i = 0; i < prevChildren.length; i++) {\r\n                    const child = prevChildren[i];\r\n                    runtimeCore.setTransitionHooks(child, runtimeCore.resolveTransitionHooks(child, cssTransitionProps, state, instance));\r\n                    positionMap.set(child, child.el.getBoundingClientRect());\r\n                }\r\n            }\r\n            return runtimeCore.createVNode(tag, null, children);\r\n        };\r\n    }\r\n};\r\nconst TransitionGroup = TransitionGroupImpl;\r\nfunction callPendingCbs(c) {\r\n    const el = c.el;\r\n    if (el._moveCb) {\r\n        el._moveCb();\r\n    }\r\n    if (el._enterCb) {\r\n        el._enterCb();\r\n    }\r\n}\r\nfunction recordPosition(c) {\r\n    newPositionMap.set(c, c.el.getBoundingClientRect());\r\n}\r\nfunction applyTranslation(c) {\r\n    const oldPos = positionMap.get(c);\r\n    const newPos = newPositionMap.get(c);\r\n    const dx = oldPos.left - newPos.left;\r\n    const dy = oldPos.top - newPos.top;\r\n    if (dx || dy) {\r\n        const s = c.el.style;\r\n        s.transform = s.webkitTransform = `translate(${dx}px,${dy}px)`;\r\n        s.transitionDuration = '0s';\r\n        return c;\r\n    }\r\n}\r\nfunction hasCSSTransform(el, root, moveClass) {\r\n    // Detect whether an element with the move class applied has\r\n    // CSS transitions. Since the element may be inside an entering\r\n    // transition at this very moment, we make a clone of it and remove\r\n    // all other transition classes applied to ensure only the move class\r\n    // is applied.\r\n    const clone = el.cloneNode();\r\n    if (el._vtc) {\r\n        el._vtc.forEach(cls => {\r\n            cls.split(/\\s+/).forEach(c => c && clone.classList.remove(c));\r\n        });\r\n    }\r\n    moveClass.split(/\\s+/).forEach(c => c && clone.classList.add(c));\r\n    clone.style.display = 'none';\r\n    const container = (root.nodeType === 1\r\n        ? root\r\n        : root.parentNode);\r\n    container.appendChild(clone);\r\n    const { hasTransform } = getTransitionInfo(clone);\r\n    container.removeChild(clone);\r\n    return hasTransform;\r\n}\n\nconst getModelAssigner = (vnode) => {\r\n    const fn = vnode.props['onUpdate:modelValue'];\r\n    return shared.isArray(fn) ? value => shared.invokeArrayFns(fn, value) : fn;\r\n};\r\nfunction onCompositionStart(e) {\r\n    e.target.composing = true;\r\n}\r\nfunction onCompositionEnd(e) {\r\n    const target = e.target;\r\n    if (target.composing) {\r\n        target.composing = false;\r\n        trigger(target, 'input');\r\n    }\r\n}\r\nfunction trigger(el, type) {\r\n    const e = document.createEvent('HTMLEvents');\r\n    e.initEvent(type, true, true);\r\n    el.dispatchEvent(e);\r\n}\r\n// We are exporting the v-model runtime directly as vnode hooks so that it can\r\n// be tree-shaken in case v-model is never used.\r\nconst vModelText = {\r\n    created(el, { modifiers: { lazy, trim, number } }, vnode) {\r\n        el._assign = getModelAssigner(vnode);\r\n        const castToNumber = number || el.type === 'number';\r\n        addEventListener(el, lazy ? 'change' : 'input', e => {\r\n            if (e.target.composing)\r\n                return;\r\n            let domValue = el.value;\r\n            if (trim) {\r\n                domValue = domValue.trim();\r\n            }\r\n            else if (castToNumber) {\r\n                domValue = shared.toNumber(domValue);\r\n            }\r\n            el._assign(domValue);\r\n        });\r\n        if (trim) {\r\n            addEventListener(el, 'change', () => {\r\n                el.value = el.value.trim();\r\n            });\r\n        }\r\n        if (!lazy) {\r\n            addEventListener(el, 'compositionstart', onCompositionStart);\r\n            addEventListener(el, 'compositionend', onCompositionEnd);\r\n            // Safari < 10.2 & UIWebView doesn't fire compositionend when\r\n            // switching focus before confirming composition choice\r\n            // this also fixes the issue where some browsers e.g. iOS Chrome\r\n            // fires \"change\" instead of \"input\" on autocomplete.\r\n            addEventListener(el, 'change', onCompositionEnd);\r\n        }\r\n    },\r\n    // set value on mounted so it's after min/max for type=\"range\"\r\n    mounted(el, { value }) {\r\n        el.value = value == null ? '' : value;\r\n    },\r\n    beforeUpdate(el, { value, modifiers: { trim, number } }, vnode) {\r\n        el._assign = getModelAssigner(vnode);\r\n        // avoid clearing unresolved text. #2302\r\n        if (el.composing)\r\n            return;\r\n        if (document.activeElement === el) {\r\n            if (trim && el.value.trim() === value) {\r\n                return;\r\n            }\r\n            if ((number || el.type === 'number') && shared.toNumber(el.value) === value) {\r\n                return;\r\n            }\r\n        }\r\n        const newValue = value == null ? '' : value;\r\n        if (el.value !== newValue) {\r\n            el.value = newValue;\r\n        }\r\n    }\r\n};\r\nconst vModelCheckbox = {\r\n    created(el, _, vnode) {\r\n        el._assign = getModelAssigner(vnode);\r\n        addEventListener(el, 'change', () => {\r\n            const modelValue = el._modelValue;\r\n            const elementValue = getValue(el);\r\n            const checked = el.checked;\r\n            const assign = el._assign;\r\n            if (shared.isArray(modelValue)) {\r\n                const index = shared.looseIndexOf(modelValue, elementValue);\r\n                const found = index !== -1;\r\n                if (checked && !found) {\r\n                    assign(modelValue.concat(elementValue));\r\n                }\r\n                else if (!checked && found) {\r\n                    const filtered = [...modelValue];\r\n                    filtered.splice(index, 1);\r\n                    assign(filtered);\r\n                }\r\n            }\r\n            else if (shared.isSet(modelValue)) {\r\n                const cloned = new Set(modelValue);\r\n                if (checked) {\r\n                    cloned.add(elementValue);\r\n                }\r\n                else {\r\n                    cloned.delete(elementValue);\r\n                }\r\n                assign(cloned);\r\n            }\r\n            else {\r\n                assign(getCheckboxValue(el, checked));\r\n            }\r\n        });\r\n    },\r\n    // set initial checked on mount to wait for true-value/false-value\r\n    mounted: setChecked,\r\n    beforeUpdate(el, binding, vnode) {\r\n        el._assign = getModelAssigner(vnode);\r\n        setChecked(el, binding, vnode);\r\n    }\r\n};\r\nfunction setChecked(el, { value, oldValue }, vnode) {\r\n    el._modelValue = value;\r\n    if (shared.isArray(value)) {\r\n        el.checked = shared.looseIndexOf(value, vnode.props.value) > -1;\r\n    }\r\n    else if (shared.isSet(value)) {\r\n        el.checked = value.has(vnode.props.value);\r\n    }\r\n    else if (value !== oldValue) {\r\n        el.checked = shared.looseEqual(value, getCheckboxValue(el, true));\r\n    }\r\n}\r\nconst vModelRadio = {\r\n    created(el, { value }, vnode) {\r\n        el.checked = shared.looseEqual(value, vnode.props.value);\r\n        el._assign = getModelAssigner(vnode);\r\n        addEventListener(el, 'change', () => {\r\n            el._assign(getValue(el));\r\n        });\r\n    },\r\n    beforeUpdate(el, { value, oldValue }, vnode) {\r\n        el._assign = getModelAssigner(vnode);\r\n        if (value !== oldValue) {\r\n            el.checked = shared.looseEqual(value, vnode.props.value);\r\n        }\r\n    }\r\n};\r\nconst vModelSelect = {\r\n    created(el, { value, modifiers: { number } }, vnode) {\r\n        const isSetModel = shared.isSet(value);\r\n        addEventListener(el, 'change', () => {\r\n            const selectedVal = Array.prototype.filter\r\n                .call(el.options, (o) => o.selected)\r\n                .map((o) => number ? shared.toNumber(getValue(o)) : getValue(o));\r\n            el._assign(el.multiple\r\n                ? isSetModel\r\n                    ? new Set(selectedVal)\r\n                    : selectedVal\r\n                : selectedVal[0]);\r\n        });\r\n        el._assign = getModelAssigner(vnode);\r\n    },\r\n    // set value in mounted & updated because <select> relies on its children\r\n    // <option>s.\r\n    mounted(el, { value }) {\r\n        setSelected(el, value);\r\n    },\r\n    beforeUpdate(el, _binding, vnode) {\r\n        el._assign = getModelAssigner(vnode);\r\n    },\r\n    updated(el, { value }) {\r\n        setSelected(el, value);\r\n    }\r\n};\r\nfunction setSelected(el, value) {\r\n    const isMultiple = el.multiple;\r\n    if (isMultiple && !shared.isArray(value) && !shared.isSet(value)) {\r\n        return;\r\n    }\r\n    for (let i = 0, l = el.options.length; i < l; i++) {\r\n        const option = el.options[i];\r\n        const optionValue = getValue(option);\r\n        if (isMultiple) {\r\n            if (shared.isArray(value)) {\r\n                option.selected = shared.looseIndexOf(value, optionValue) > -1;\r\n            }\r\n            else {\r\n                option.selected = value.has(optionValue);\r\n            }\r\n        }\r\n        else {\r\n            if (shared.looseEqual(getValue(option), value)) {\r\n                if (el.selectedIndex !== i)\r\n                    el.selectedIndex = i;\r\n                return;\r\n            }\r\n        }\r\n    }\r\n    if (!isMultiple && el.selectedIndex !== -1) {\r\n        el.selectedIndex = -1;\r\n    }\r\n}\r\n// retrieve raw value set via :value bindings\r\nfunction getValue(el) {\r\n    return '_value' in el ? el._value : el.value;\r\n}\r\n// retrieve raw value for true-value and false-value set via :true-value or :false-value bindings\r\nfunction getCheckboxValue(el, checked) {\r\n    const key = checked ? '_trueValue' : '_falseValue';\r\n    return key in el ? el[key] : checked;\r\n}\r\nconst vModelDynamic = {\r\n    created(el, binding, vnode) {\r\n        callModelHook(el, binding, vnode, null, 'created');\r\n    },\r\n    mounted(el, binding, vnode) {\r\n        callModelHook(el, binding, vnode, null, 'mounted');\r\n    },\r\n    beforeUpdate(el, binding, vnode, prevVNode) {\r\n        callModelHook(el, binding, vnode, prevVNode, 'beforeUpdate');\r\n    },\r\n    updated(el, binding, vnode, prevVNode) {\r\n        callModelHook(el, binding, vnode, prevVNode, 'updated');\r\n    }\r\n};\r\nfunction callModelHook(el, binding, vnode, prevVNode, hook) {\r\n    let modelToUse;\r\n    switch (el.tagName) {\r\n        case 'SELECT':\r\n            modelToUse = vModelSelect;\r\n            break;\r\n        case 'TEXTAREA':\r\n            modelToUse = vModelText;\r\n            break;\r\n        default:\r\n            switch (vnode.props && vnode.props.type) {\r\n                case 'checkbox':\r\n                    modelToUse = vModelCheckbox;\r\n                    break;\r\n                case 'radio':\r\n                    modelToUse = vModelRadio;\r\n                    break;\r\n                default:\r\n                    modelToUse = vModelText;\r\n            }\r\n    }\r\n    const fn = modelToUse[hook];\r\n    fn && fn(el, binding, vnode, prevVNode);\r\n}\r\n// SSR vnode transforms\r\n{\r\n    vModelText.getSSRProps = ({ value }) => ({ value });\r\n    vModelRadio.getSSRProps = ({ value }, vnode) => {\r\n        if (vnode.props && shared.looseEqual(vnode.props.value, value)) {\r\n            return { checked: true };\r\n        }\r\n    };\r\n    vModelCheckbox.getSSRProps = ({ value }, vnode) => {\r\n        if (shared.isArray(value)) {\r\n            if (vnode.props && shared.looseIndexOf(value, vnode.props.value) > -1) {\r\n                return { checked: true };\r\n            }\r\n        }\r\n        else if (shared.isSet(value)) {\r\n            if (vnode.props && value.has(vnode.props.value)) {\r\n                return { checked: true };\r\n            }\r\n        }\r\n        else if (value) {\r\n            return { checked: true };\r\n        }\r\n    };\r\n}\n\nconst systemModifiers = ['ctrl', 'shift', 'alt', 'meta'];\r\nconst modifierGuards = {\r\n    stop: e => e.stopPropagation(),\r\n    prevent: e => e.preventDefault(),\r\n    self: e => e.target !== e.currentTarget,\r\n    ctrl: e => !e.ctrlKey,\r\n    shift: e => !e.shiftKey,\r\n    alt: e => !e.altKey,\r\n    meta: e => !e.metaKey,\r\n    left: e => 'button' in e && e.button !== 0,\r\n    middle: e => 'button' in e && e.button !== 1,\r\n    right: e => 'button' in e && e.button !== 2,\r\n    exact: (e, modifiers) => systemModifiers.some(m => e[`${m}Key`] && !modifiers.includes(m))\r\n};\r\n/**\r\n * @private\r\n */\r\nconst withModifiers = (fn, modifiers) => {\r\n    return (event, ...args) => {\r\n        for (let i = 0; i < modifiers.length; i++) {\r\n            const guard = modifierGuards[modifiers[i]];\r\n            if (guard && guard(event, modifiers))\r\n                return;\r\n        }\r\n        return fn(event, ...args);\r\n    };\r\n};\r\n// Kept for 2.x compat.\r\n// Note: IE11 compat for `spacebar` and `del` is removed for now.\r\nconst keyNames = {\r\n    esc: 'escape',\r\n    space: ' ',\r\n    up: 'arrow-up',\r\n    left: 'arrow-left',\r\n    right: 'arrow-right',\r\n    down: 'arrow-down',\r\n    delete: 'backspace'\r\n};\r\n/**\r\n * @private\r\n */\r\nconst withKeys = (fn, modifiers) => {\r\n    return (event) => {\r\n        if (!('key' in event)) {\r\n            return;\r\n        }\r\n        const eventKey = shared.hyphenate(event.key);\r\n        if (modifiers.some(k => k === eventKey || keyNames[k] === eventKey)) {\r\n            return fn(event);\r\n        }\r\n    };\r\n};\n\nconst vShow = {\r\n    beforeMount(el, { value }, { transition }) {\r\n        el._vod = el.style.display === 'none' ? '' : el.style.display;\r\n        if (transition && value) {\r\n            transition.beforeEnter(el);\r\n        }\r\n        else {\r\n            setDisplay(el, value);\r\n        }\r\n    },\r\n    mounted(el, { value }, { transition }) {\r\n        if (transition && value) {\r\n            transition.enter(el);\r\n        }\r\n    },\r\n    updated(el, { value, oldValue }, { transition }) {\r\n        if (!value === !oldValue)\r\n            return;\r\n        if (transition) {\r\n            if (value) {\r\n                transition.beforeEnter(el);\r\n                setDisplay(el, true);\r\n                transition.enter(el);\r\n            }\r\n            else {\r\n                transition.leave(el, () => {\r\n                    setDisplay(el, false);\r\n                });\r\n            }\r\n        }\r\n        else {\r\n            setDisplay(el, value);\r\n        }\r\n    },\r\n    beforeUnmount(el, { value }) {\r\n        setDisplay(el, value);\r\n    }\r\n};\r\n{\r\n    vShow.getSSRProps = ({ value }) => {\r\n        if (!value) {\r\n            return { style: { display: 'none' } };\r\n        }\r\n    };\r\n}\r\nfunction setDisplay(el, value) {\r\n    el.style.display = value ? el._vod : 'none';\r\n}\n\nconst rendererOptions = shared.extend({ patchProp, forcePatchProp }, nodeOps);\r\n// lazy create the renderer - this makes core renderer logic tree-shakable\r\n// in case the user only imports reactivity utilities from Vue.\r\nlet renderer;\r\nlet enabledHydration = false;\r\nfunction ensureRenderer() {\r\n    return renderer || (renderer = runtimeCore.createRenderer(rendererOptions));\r\n}\r\nfunction ensureHydrationRenderer() {\r\n    renderer = enabledHydration\r\n        ? renderer\r\n        : runtimeCore.createHydrationRenderer(rendererOptions);\r\n    enabledHydration = true;\r\n    return renderer;\r\n}\r\n// use explicit type casts here to avoid import() calls in rolled-up d.ts\r\nconst render = ((...args) => {\r\n    ensureRenderer().render(...args);\r\n});\r\nconst hydrate = ((...args) => {\r\n    ensureHydrationRenderer().hydrate(...args);\r\n});\r\nconst createApp = ((...args) => {\r\n    const app = ensureRenderer().createApp(...args);\r\n    const { mount } = app;\r\n    app.mount = (containerOrSelector) => {\r\n        const container = normalizeContainer(containerOrSelector);\r\n        if (!container)\r\n            return;\r\n        const component = app._component;\r\n        if (!shared.isFunction(component) && !component.render && !component.template) {\r\n            // __UNSAFE__\r\n            // Reason: potential execution of JS expressions in in-DOM template.\r\n            // The user must make sure the in-DOM template is trusted. If it's\r\n            // rendered by the server, the template should not contain any user data.\r\n            component.template = container.innerHTML;\r\n        }\r\n        // clear content before mounting\r\n        container.innerHTML = '';\r\n        const proxy = mount(container, false, container instanceof SVGElement);\r\n        if (container instanceof Element) {\r\n            container.removeAttribute('v-cloak');\r\n            container.setAttribute('data-v-app', '');\r\n        }\r\n        return proxy;\r\n    };\r\n    return app;\r\n});\r\nconst createSSRApp = ((...args) => {\r\n    const app = ensureHydrationRenderer().createApp(...args);\r\n    const { mount } = app;\r\n    app.mount = (containerOrSelector) => {\r\n        const container = normalizeContainer(containerOrSelector);\r\n        if (container) {\r\n            return mount(container, true, container instanceof SVGElement);\r\n        }\r\n    };\r\n    return app;\r\n});\r\nfunction normalizeContainer(container) {\r\n    if (shared.isString(container)) {\r\n        const res = document.querySelector(container);\r\n        return res;\r\n    }\r\n    return container;\r\n}\n\nObject.keys(runtimeCore).forEach(function (k) {\n  if (k !== 'default') exports[k] = runtimeCore[k];\n});\nexports.Transition = Transition;\nexports.TransitionGroup = TransitionGroup;\nexports.createApp = createApp;\nexports.createSSRApp = createSSRApp;\nexports.hydrate = hydrate;\nexports.render = render;\nexports.useCssModule = useCssModule;\nexports.useCssVars = useCssVars;\nexports.vModelCheckbox = vModelCheckbox;\nexports.vModelDynamic = vModelDynamic;\nexports.vModelRadio = vModelRadio;\nexports.vModelSelect = vModelSelect;\nexports.vModelText = vModelText;\nexports.vShow = vShow;\nexports.withKeys = withKeys;\nexports.withModifiers = withModifiers;\n","'use strict'\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./dist/runtime-core.cjs.prod.js')\n} else {\n  module.exports = require('./dist/runtime-core.cjs.js')\n}\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar reactivity = require('@vue/reactivity');\nvar shared = require('@vue/shared');\n\nconst stack = [];\r\nfunction warn(msg, ...args) {\r\n    // avoid props formatting or warn handler tracking deps that might be mutated\r\n    // during patch, leading to infinite recursion.\r\n    reactivity.pauseTracking();\r\n    const instance = stack.length ? stack[stack.length - 1].component : null;\r\n    const appWarnHandler = instance && instance.appContext.config.warnHandler;\r\n    const trace = getComponentTrace();\r\n    if (appWarnHandler) {\r\n        callWithErrorHandling(appWarnHandler, instance, 11 /* APP_WARN_HANDLER */, [\r\n            msg + args.join(''),\r\n            instance && instance.proxy,\r\n            trace\r\n                .map(({ vnode }) => `at <${formatComponentName(instance, vnode.type)}>`)\r\n                .join('\\n'),\r\n            trace\r\n        ]);\r\n    }\r\n    else {\r\n        const warnArgs = [`[Vue warn]: ${msg}`, ...args];\r\n        /* istanbul ignore if */\r\n        if (trace.length &&\r\n            // avoid spamming console during tests\r\n            !false) {\r\n            warnArgs.push(`\\n`, ...formatTrace(trace));\r\n        }\r\n        console.warn(...warnArgs);\r\n    }\r\n    reactivity.resetTracking();\r\n}\r\nfunction getComponentTrace() {\r\n    let currentVNode = stack[stack.length - 1];\r\n    if (!currentVNode) {\r\n        return [];\r\n    }\r\n    // we can't just use the stack because it will be incomplete during updates\r\n    // that did not start from the root. Re-construct the parent chain using\r\n    // instance parent pointers.\r\n    const normalizedStack = [];\r\n    while (currentVNode) {\r\n        const last = normalizedStack[0];\r\n        if (last && last.vnode === currentVNode) {\r\n            last.recurseCount++;\r\n        }\r\n        else {\r\n            normalizedStack.push({\r\n                vnode: currentVNode,\r\n                recurseCount: 0\r\n            });\r\n        }\r\n        const parentInstance = currentVNode.component && currentVNode.component.parent;\r\n        currentVNode = parentInstance && parentInstance.vnode;\r\n    }\r\n    return normalizedStack;\r\n}\r\n/* istanbul ignore next */\r\nfunction formatTrace(trace) {\r\n    const logs = [];\r\n    trace.forEach((entry, i) => {\r\n        logs.push(...(i === 0 ? [] : [`\\n`]), ...formatTraceEntry(entry));\r\n    });\r\n    return logs;\r\n}\r\nfunction formatTraceEntry({ vnode, recurseCount }) {\r\n    const postfix = recurseCount > 0 ? `... (${recurseCount} recursive calls)` : ``;\r\n    const isRoot = vnode.component ? vnode.component.parent == null : false;\r\n    const open = ` at <${formatComponentName(vnode.component, vnode.type, isRoot)}`;\r\n    const close = `>` + postfix;\r\n    return vnode.props\r\n        ? [open, ...formatProps(vnode.props), close]\r\n        : [open + close];\r\n}\r\n/* istanbul ignore next */\r\nfunction formatProps(props) {\r\n    const res = [];\r\n    const keys = Object.keys(props);\r\n    keys.slice(0, 3).forEach(key => {\r\n        res.push(...formatProp(key, props[key]));\r\n    });\r\n    if (keys.length > 3) {\r\n        res.push(` ...`);\r\n    }\r\n    return res;\r\n}\r\n/* istanbul ignore next */\r\nfunction formatProp(key, value, raw) {\r\n    if (shared.isString(value)) {\r\n        value = JSON.stringify(value);\r\n        return raw ? value : [`${key}=${value}`];\r\n    }\r\n    else if (typeof value === 'number' ||\r\n        typeof value === 'boolean' ||\r\n        value == null) {\r\n        return raw ? value : [`${key}=${value}`];\r\n    }\r\n    else if (reactivity.isRef(value)) {\r\n        value = formatProp(key, reactivity.toRaw(value.value), true);\r\n        return raw ? value : [`${key}=Ref<`, value, `>`];\r\n    }\r\n    else if (shared.isFunction(value)) {\r\n        return [`${key}=fn${value.name ? `<${value.name}>` : ``}`];\r\n    }\r\n    else {\r\n        value = reactivity.toRaw(value);\r\n        return raw ? value : [`${key}=`, value];\r\n    }\r\n}\n\nfunction callWithErrorHandling(fn, instance, type, args) {\r\n    let res;\r\n    try {\r\n        res = args ? fn(...args) : fn();\r\n    }\r\n    catch (err) {\r\n        handleError(err, instance, type);\r\n    }\r\n    return res;\r\n}\r\nfunction callWithAsyncErrorHandling(fn, instance, type, args) {\r\n    if (shared.isFunction(fn)) {\r\n        const res = callWithErrorHandling(fn, instance, type, args);\r\n        if (res && shared.isPromise(res)) {\r\n            res.catch(err => {\r\n                handleError(err, instance, type);\r\n            });\r\n        }\r\n        return res;\r\n    }\r\n    const values = [];\r\n    for (let i = 0; i < fn.length; i++) {\r\n        values.push(callWithAsyncErrorHandling(fn[i], instance, type, args));\r\n    }\r\n    return values;\r\n}\r\nfunction handleError(err, instance, type, throwInDev = true) {\r\n    const contextVNode = instance ? instance.vnode : null;\r\n    if (instance) {\r\n        let cur = instance.parent;\r\n        // the exposed instance is the render proxy to keep it consistent with 2.x\r\n        const exposedInstance = instance.proxy;\r\n        // in production the hook receives only the error code\r\n        const errorInfo = type;\r\n        while (cur) {\r\n            const errorCapturedHooks = cur.ec;\r\n            if (errorCapturedHooks) {\r\n                for (let i = 0; i < errorCapturedHooks.length; i++) {\r\n                    if (errorCapturedHooks[i](err, exposedInstance, errorInfo) === false) {\r\n                        return;\r\n                    }\r\n                }\r\n            }\r\n            cur = cur.parent;\r\n        }\r\n        // app-level handling\r\n        const appErrorHandler = instance.appContext.config.errorHandler;\r\n        if (appErrorHandler) {\r\n            callWithErrorHandling(appErrorHandler, null, 10 /* APP_ERROR_HANDLER */, [err, exposedInstance, errorInfo]);\r\n            return;\r\n        }\r\n    }\r\n    logError(err, type, contextVNode, throwInDev);\r\n}\r\nfunction logError(err, type, contextVNode, throwInDev = true) {\r\n    {\r\n        // recover in prod to reduce the impact on end-user\r\n        console.error(err);\r\n    }\r\n}\n\nlet isFlushing = false;\r\nlet isFlushPending = false;\r\nconst queue = [];\r\nlet flushIndex = 0;\r\nconst pendingPreFlushCbs = [];\r\nlet activePreFlushCbs = null;\r\nlet preFlushIndex = 0;\r\nconst pendingPostFlushCbs = [];\r\nlet activePostFlushCbs = null;\r\nlet postFlushIndex = 0;\r\nconst resolvedPromise = Promise.resolve();\r\nlet currentFlushPromise = null;\r\nlet currentPreFlushParentJob = null;\r\nconst RECURSION_LIMIT = 100;\r\nfunction nextTick(fn) {\r\n    const p = currentFlushPromise || resolvedPromise;\r\n    return fn ? p.then(this ? fn.bind(this) : fn) : p;\r\n}\r\n// #2768\r\n// Use binary-search to find a suitable position in the queue,\r\n// so that the queue maintains the increasing order of job's id,\r\n// which can prevent the job from being skipped and also can avoid repeated patching.\r\nfunction findInsertionIndex(job) {\r\n    // the start index should be `flushIndex + 1`\r\n    let start = flushIndex + 1;\r\n    let end = queue.length;\r\n    const jobId = getId(job);\r\n    while (start < end) {\r\n        const middle = (start + end) >>> 1;\r\n        const middleJobId = getId(queue[middle]);\r\n        middleJobId < jobId ? (start = middle + 1) : (end = middle);\r\n    }\r\n    return start;\r\n}\r\nfunction queueJob(job) {\r\n    // the dedupe search uses the startIndex argument of Array.includes()\r\n    // by default the search index includes the current job that is being run\r\n    // so it cannot recursively trigger itself again.\r\n    // if the job is a watch() callback, the search will start with a +1 index to\r\n    // allow it recursively trigger itself - it is the user's responsibility to\r\n    // ensure it doesn't end up in an infinite loop.\r\n    if ((!queue.length ||\r\n        !queue.includes(job, isFlushing && job.allowRecurse ? flushIndex + 1 : flushIndex)) &&\r\n        job !== currentPreFlushParentJob) {\r\n        const pos = findInsertionIndex(job);\r\n        if (pos > -1) {\r\n            queue.splice(pos, 0, job);\r\n        }\r\n        else {\r\n            queue.push(job);\r\n        }\r\n        queueFlush();\r\n    }\r\n}\r\nfunction queueFlush() {\r\n    if (!isFlushing && !isFlushPending) {\r\n        isFlushPending = true;\r\n        currentFlushPromise = resolvedPromise.then(flushJobs);\r\n    }\r\n}\r\nfunction invalidateJob(job) {\r\n    const i = queue.indexOf(job);\r\n    if (i > flushIndex) {\r\n        queue.splice(i, 1);\r\n    }\r\n}\r\nfunction queueCb(cb, activeQueue, pendingQueue, index) {\r\n    if (!shared.isArray(cb)) {\r\n        if (!activeQueue ||\r\n            !activeQueue.includes(cb, cb.allowRecurse ? index + 1 : index)) {\r\n            pendingQueue.push(cb);\r\n        }\r\n    }\r\n    else {\r\n        // if cb is an array, it is a component lifecycle hook which can only be\r\n        // triggered by a job, which is already deduped in the main queue, so\r\n        // we can skip duplicate check here to improve perf\r\n        pendingQueue.push(...cb);\r\n    }\r\n    queueFlush();\r\n}\r\nfunction queuePreFlushCb(cb) {\r\n    queueCb(cb, activePreFlushCbs, pendingPreFlushCbs, preFlushIndex);\r\n}\r\nfunction queuePostFlushCb(cb) {\r\n    queueCb(cb, activePostFlushCbs, pendingPostFlushCbs, postFlushIndex);\r\n}\r\nfunction flushPreFlushCbs(seen, parentJob = null) {\r\n    if (pendingPreFlushCbs.length) {\r\n        currentPreFlushParentJob = parentJob;\r\n        activePreFlushCbs = [...new Set(pendingPreFlushCbs)];\r\n        pendingPreFlushCbs.length = 0;\r\n        for (preFlushIndex = 0; preFlushIndex < activePreFlushCbs.length; preFlushIndex++) {\r\n            activePreFlushCbs[preFlushIndex]();\r\n        }\r\n        activePreFlushCbs = null;\r\n        preFlushIndex = 0;\r\n        currentPreFlushParentJob = null;\r\n        // recursively flush until it drains\r\n        flushPreFlushCbs(seen, parentJob);\r\n    }\r\n}\r\nfunction flushPostFlushCbs(seen) {\r\n    if (pendingPostFlushCbs.length) {\r\n        const deduped = [...new Set(pendingPostFlushCbs)];\r\n        pendingPostFlushCbs.length = 0;\r\n        // #1947 already has active queue, nested flushPostFlushCbs call\r\n        if (activePostFlushCbs) {\r\n            activePostFlushCbs.push(...deduped);\r\n            return;\r\n        }\r\n        activePostFlushCbs = deduped;\r\n        activePostFlushCbs.sort((a, b) => getId(a) - getId(b));\r\n        for (postFlushIndex = 0; postFlushIndex < activePostFlushCbs.length; postFlushIndex++) {\r\n            activePostFlushCbs[postFlushIndex]();\r\n        }\r\n        activePostFlushCbs = null;\r\n        postFlushIndex = 0;\r\n    }\r\n}\r\nconst getId = (job) => job.id == null ? Infinity : job.id;\r\nfunction flushJobs(seen) {\r\n    isFlushPending = false;\r\n    isFlushing = true;\r\n    flushPreFlushCbs(seen);\r\n    // Sort queue before flush.\r\n    // This ensures that:\r\n    // 1. Components are updated from parent to child. (because parent is always\r\n    //    created before the child so its render effect will have smaller\r\n    //    priority number)\r\n    // 2. If a component is unmounted during a parent component's update,\r\n    //    its update can be skipped.\r\n    queue.sort((a, b) => getId(a) - getId(b));\r\n    try {\r\n        for (flushIndex = 0; flushIndex < queue.length; flushIndex++) {\r\n            const job = queue[flushIndex];\r\n            if (job && job.active !== false) {\r\n                if (false && checkRecursiveUpdates(seen, job)) ;\r\n                callWithErrorHandling(job, null, 14 /* SCHEDULER */);\r\n            }\r\n        }\r\n    }\r\n    finally {\r\n        flushIndex = 0;\r\n        queue.length = 0;\r\n        flushPostFlushCbs();\r\n        isFlushing = false;\r\n        currentFlushPromise = null;\r\n        // some postFlushCb queued jobs!\r\n        // keep flushing until it drains.\r\n        if (queue.length ||\r\n            pendingPreFlushCbs.length ||\r\n            pendingPostFlushCbs.length) {\r\n            flushJobs(seen);\r\n        }\r\n    }\r\n}\r\nfunction checkRecursiveUpdates(seen, fn) {\r\n    if (!seen.has(fn)) {\r\n        seen.set(fn, 1);\r\n    }\r\n    else {\r\n        const count = seen.get(fn);\r\n        if (count > RECURSION_LIMIT) {\r\n            const instance = fn.ownerInstance;\r\n            const componentName = instance && getComponentName(instance.type);\r\n            warn(`Maximum recursive updates exceeded${componentName ? ` in component <${componentName}>` : ``}. ` +\r\n                `This means you have a reactive effect that is mutating its own ` +\r\n                `dependencies and thus recursively triggering itself. Possible sources ` +\r\n                `include component template, render function, updated hook or ` +\r\n                `watcher source function.`);\r\n            return true;\r\n        }\r\n        else {\r\n            seen.set(fn, count + 1);\r\n        }\r\n    }\r\n}\n\nfunction setDevtoolsHook(hook) {\r\n    exports.devtools = hook;\r\n}\n\nfunction warnDeprecation(key, instance, ...args) {\r\n    {\r\n        return;\r\n    }\r\n}\r\nconst globalCompatConfig = {\r\n    MODE: 2\r\n};\r\nfunction getCompatConfigForKey(key, instance) {\r\n    const instanceConfig = instance && instance.type.compatConfig;\r\n    if (instanceConfig && key in instanceConfig) {\r\n        return instanceConfig[key];\r\n    }\r\n    return globalCompatConfig[key];\r\n}\r\nfunction isCompatEnabled(key, instance, enableForBuiltIn = false) {\r\n    // skip compat for built-in components\r\n    if (!enableForBuiltIn && instance && instance.type.__isBuiltIn) {\r\n        return false;\r\n    }\r\n    const rawMode = getCompatConfigForKey('MODE', instance) || 2;\r\n    const val = getCompatConfigForKey(key, instance);\r\n    const mode = shared.isFunction(rawMode)\r\n        ? rawMode(instance && instance.type)\r\n        : rawMode;\r\n    if (mode === 2) {\r\n        return val !== false;\r\n    }\r\n    else {\r\n        return val === true || val === 'suppress-warning';\r\n    }\r\n}\n\nfunction emit(instance, event, ...rawArgs) {\r\n    const props = instance.vnode.props || shared.EMPTY_OBJ;\r\n    let args = rawArgs;\r\n    const isModelListener = event.startsWith('update:');\r\n    // for v-model update:xxx events, apply modifiers on args\r\n    const modelArg = isModelListener && event.slice(7);\r\n    if (modelArg && modelArg in props) {\r\n        const modifiersKey = `${modelArg === 'modelValue' ? 'model' : modelArg}Modifiers`;\r\n        const { number, trim } = props[modifiersKey] || shared.EMPTY_OBJ;\r\n        if (trim) {\r\n            args = rawArgs.map(a => a.trim());\r\n        }\r\n        else if (number) {\r\n            args = rawArgs.map(shared.toNumber);\r\n        }\r\n    }\r\n    let handlerName;\r\n    let handler = props[(handlerName = shared.toHandlerKey(event))] ||\r\n        // also try camelCase event handler (#2249)\r\n        props[(handlerName = shared.toHandlerKey(shared.camelize(event)))];\r\n    // for v-model update:xxx events, also trigger kebab-case equivalent\r\n    // for props passed via kebab-case\r\n    if (!handler && isModelListener) {\r\n        handler = props[(handlerName = shared.toHandlerKey(shared.hyphenate(event)))];\r\n    }\r\n    if (handler) {\r\n        callWithAsyncErrorHandling(handler, instance, 6 /* COMPONENT_EVENT_HANDLER */, args);\r\n    }\r\n    const onceHandler = props[handlerName + `Once`];\r\n    if (onceHandler) {\r\n        if (!instance.emitted) {\r\n            (instance.emitted = {})[handlerName] = true;\r\n        }\r\n        else if (instance.emitted[handlerName]) {\r\n            return;\r\n        }\r\n        callWithAsyncErrorHandling(onceHandler, instance, 6 /* COMPONENT_EVENT_HANDLER */, args);\r\n    }\r\n}\r\nfunction normalizeEmitsOptions(comp, appContext, asMixin = false) {\r\n    const cache = appContext.emitsCache;\r\n    const cached = cache.get(comp);\r\n    if (cached !== undefined) {\r\n        return cached;\r\n    }\r\n    const raw = comp.emits;\r\n    let normalized = {};\r\n    // apply mixin/extends props\r\n    let hasExtends = false;\r\n    if (!shared.isFunction(comp)) {\r\n        const extendEmits = (raw) => {\r\n            const normalizedFromExtend = normalizeEmitsOptions(raw, appContext, true);\r\n            if (normalizedFromExtend) {\r\n                hasExtends = true;\r\n                shared.extend(normalized, normalizedFromExtend);\r\n            }\r\n        };\r\n        if (!asMixin && appContext.mixins.length) {\r\n            appContext.mixins.forEach(extendEmits);\r\n        }\r\n        if (comp.extends) {\r\n            extendEmits(comp.extends);\r\n        }\r\n        if (comp.mixins) {\r\n            comp.mixins.forEach(extendEmits);\r\n        }\r\n    }\r\n    if (!raw && !hasExtends) {\r\n        cache.set(comp, null);\r\n        return null;\r\n    }\r\n    if (shared.isArray(raw)) {\r\n        raw.forEach(key => (normalized[key] = null));\r\n    }\r\n    else {\r\n        shared.extend(normalized, raw);\r\n    }\r\n    cache.set(comp, normalized);\r\n    return normalized;\r\n}\r\n// Check if an incoming prop key is a declared emit event listener.\r\n// e.g. With `emits: { click: null }`, props named `onClick` and `onclick` are\r\n// both considered matched listeners.\r\nfunction isEmitListener(options, key) {\r\n    if (!options || !shared.isOn(key)) {\r\n        return false;\r\n    }\r\n    key = key.slice(2).replace(/Once$/, '');\r\n    return (shared.hasOwn(options, key[0].toLowerCase() + key.slice(1)) ||\r\n        shared.hasOwn(options, shared.hyphenate(key)) ||\r\n        shared.hasOwn(options, key));\r\n}\n\n/**\r\n * mark the current rendering instance for asset resolution (e.g.\r\n * resolveComponent, resolveDirective) during render\r\n */\r\nlet currentRenderingInstance = null;\r\nlet currentScopeId = null;\r\n/**\r\n * Note: rendering calls maybe nested. The function returns the parent rendering\r\n * instance if present, which should be restored after the render is done:\r\n *\r\n * ```js\r\n * const prev = setCurrentRenderingInstance(i)\r\n * // ...render\r\n * setCurrentRenderingInstance(prev)\r\n * ```\r\n */\r\nfunction setCurrentRenderingInstance(instance) {\r\n    const prev = currentRenderingInstance;\r\n    currentRenderingInstance = instance;\r\n    currentScopeId = (instance && instance.type.__scopeId) || null;\r\n    return prev;\r\n}\r\n/**\r\n * Set scope id when creating hoisted vnodes.\r\n * @private compiler helper\r\n */\r\nfunction pushScopeId(id) {\r\n    currentScopeId = id;\r\n}\r\n/**\r\n * Technically we no longer need this after 3.0.8 but we need to keep the same\r\n * API for backwards compat w/ code generated by compilers.\r\n * @private\r\n */\r\nfunction popScopeId() {\r\n    currentScopeId = null;\r\n}\r\n/**\r\n * Only for backwards compat\r\n * @private\r\n */\r\nconst withScopeId = (_id) => withCtx;\r\n/**\r\n * Wrap a slot function to memoize current rendering instance\r\n * @private compiler helper\r\n */\r\nfunction withCtx(fn, ctx = currentRenderingInstance, isNonScopedSlot // false only\r\n) {\r\n    if (!ctx)\r\n        return fn;\r\n    // already normalized\r\n    if (fn._n) {\r\n        return fn;\r\n    }\r\n    const renderFnWithContext = (...args) => {\r\n        // If a user calls a compiled slot inside a template expression (#1745), it\r\n        // can mess up block tracking, so by default we disable block tracking and\r\n        // force bail out when invoking a compiled slot (indicated by the ._d flag).\r\n        // This isn't necessary if rendering a compiled `<slot>`, so we flip the\r\n        // ._d flag off when invoking the wrapped fn inside `renderSlot`.\r\n        if (renderFnWithContext._d) {\r\n            setBlockTracking(-1);\r\n        }\r\n        const prevInstance = setCurrentRenderingInstance(ctx);\r\n        const res = fn(...args);\r\n        setCurrentRenderingInstance(prevInstance);\r\n        if (renderFnWithContext._d) {\r\n            setBlockTracking(1);\r\n        }\r\n        return res;\r\n    };\r\n    // mark normalized to avoid duplicated wrapping\r\n    renderFnWithContext._n = true;\r\n    // mark this as compiled by default\r\n    // this is used in vnode.ts -> normalizeChildren() to set the slot\r\n    // rendering flag.\r\n    renderFnWithContext._c = true;\r\n    // disable block tracking by default\r\n    renderFnWithContext._d = true;\r\n    return renderFnWithContext;\r\n}\n\n/**\r\n * dev only flag to track whether $attrs was used during render.\r\n * If $attrs was used during render then the warning for failed attrs\r\n * fallthrough can be suppressed.\r\n */\r\nlet accessedAttrs = false;\r\nfunction markAttrsAccessed() {\r\n    accessedAttrs = true;\r\n}\r\nfunction renderComponentRoot(instance) {\r\n    const { type: Component, vnode, proxy, withProxy, props, propsOptions: [propsOptions], slots, attrs, emit, render, renderCache, data, setupState, ctx, inheritAttrs } = instance;\r\n    let result;\r\n    const prev = setCurrentRenderingInstance(instance);\r\n    try {\r\n        let fallthroughAttrs;\r\n        if (vnode.shapeFlag & 4 /* STATEFUL_COMPONENT */) {\r\n            // withProxy is a proxy with a different `has` trap only for\r\n            // runtime-compiled render functions using `with` block.\r\n            const proxyToUse = withProxy || proxy;\r\n            result = normalizeVNode(render.call(proxyToUse, proxyToUse, renderCache, props, setupState, data, ctx));\r\n            fallthroughAttrs = attrs;\r\n        }\r\n        else {\r\n            // functional\r\n            const render = Component;\r\n            // in dev, mark attrs accessed if optional props (attrs === props)\r\n            if (false && attrs === props) ;\r\n            result = normalizeVNode(render.length > 1\r\n                ? render(props, false\r\n                    ? {\r\n                        get attrs() {\r\n                            markAttrsAccessed();\r\n                            return attrs;\r\n                        },\r\n                        slots,\r\n                        emit\r\n                    }\r\n                    : { attrs, slots, emit })\r\n                : render(props, null /* we know it doesn't need it */));\r\n            fallthroughAttrs = Component.props\r\n                ? attrs\r\n                : getFunctionalFallthrough(attrs);\r\n        }\r\n        // attr merging\r\n        // in dev mode, comments are preserved, and it's possible for a template\r\n        // to have comments along side the root element which makes it a fragment\r\n        let root = result;\r\n        let setRoot = undefined;\r\n        if (false &&\r\n            result.patchFlag > 0 &&\r\n            result.patchFlag & 2048 /* DEV_ROOT_FRAGMENT */) ;\r\n        if (fallthroughAttrs && inheritAttrs !== false) {\r\n            const keys = Object.keys(fallthroughAttrs);\r\n            const { shapeFlag } = root;\r\n            if (keys.length) {\r\n                if (shapeFlag & 1 /* ELEMENT */ ||\r\n                    shapeFlag & 6 /* COMPONENT */) {\r\n                    if (propsOptions && keys.some(shared.isModelListener)) {\r\n                        // If a v-model listener (onUpdate:xxx) has a corresponding declared\r\n                        // prop, it indicates this component expects to handle v-model and\r\n                        // it should not fallthrough.\r\n                        // related: #1543, #1643, #1989\r\n                        fallthroughAttrs = filterModelListeners(fallthroughAttrs, propsOptions);\r\n                    }\r\n                    root = cloneVNode(root, fallthroughAttrs);\r\n                }\r\n                else if (false && !accessedAttrs && root.type !== Comment$1) ;\r\n            }\r\n        }\r\n        if (false &&\r\n            isCompatEnabled(\"INSTANCE_ATTRS_CLASS_STYLE\" /* INSTANCE_ATTRS_CLASS_STYLE */, instance) &&\r\n            vnode.shapeFlag & 4 /* STATEFUL_COMPONENT */ &&\r\n            (root.shapeFlag & 1 /* ELEMENT */ ||\r\n                root.shapeFlag & 6 /* COMPONENT */)) ;\r\n        // inherit directives\r\n        if (vnode.dirs) {\r\n            if (false && !isElementRoot(root)) ;\r\n            root.dirs = root.dirs ? root.dirs.concat(vnode.dirs) : vnode.dirs;\r\n        }\r\n        // inherit transition data\r\n        if (vnode.transition) {\r\n            if (false && !isElementRoot(root)) ;\r\n            root.transition = vnode.transition;\r\n        }\r\n        if (false && setRoot) ;\r\n        else {\r\n            result = root;\r\n        }\r\n    }\r\n    catch (err) {\r\n        blockStack.length = 0;\r\n        handleError(err, instance, 1 /* RENDER_FUNCTION */);\r\n        result = createVNode(Comment$1);\r\n    }\r\n    setCurrentRenderingInstance(prev);\r\n    return result;\r\n}\r\n/**\r\n * dev only\r\n * In dev mode, template root level comments are rendered, which turns the\r\n * template into a fragment root, but we need to locate the single element\r\n * root for attrs and scope id processing.\r\n */\r\nconst getChildRoot = (vnode) => {\r\n    const rawChildren = vnode.children;\r\n    const dynamicChildren = vnode.dynamicChildren;\r\n    const childRoot = filterSingleRoot(rawChildren);\r\n    if (!childRoot) {\r\n        return [vnode, undefined];\r\n    }\r\n    const index = rawChildren.indexOf(childRoot);\r\n    const dynamicIndex = dynamicChildren ? dynamicChildren.indexOf(childRoot) : -1;\r\n    const setRoot = (updatedRoot) => {\r\n        rawChildren[index] = updatedRoot;\r\n        if (dynamicChildren) {\r\n            if (dynamicIndex > -1) {\r\n                dynamicChildren[dynamicIndex] = updatedRoot;\r\n            }\r\n            else if (updatedRoot.patchFlag > 0) {\r\n                vnode.dynamicChildren = [...dynamicChildren, updatedRoot];\r\n            }\r\n        }\r\n    };\r\n    return [normalizeVNode(childRoot), setRoot];\r\n};\r\nfunction filterSingleRoot(children) {\r\n    let singleRoot;\r\n    for (let i = 0; i < children.length; i++) {\r\n        const child = children[i];\r\n        if (isVNode(child)) {\r\n            // ignore user comment\r\n            if (child.type !== Comment$1 || child.children === 'v-if') {\r\n                if (singleRoot) {\r\n                    // has more than 1 non-comment child, return now\r\n                    return;\r\n                }\r\n                else {\r\n                    singleRoot = child;\r\n                }\r\n            }\r\n        }\r\n        else {\r\n            return;\r\n        }\r\n    }\r\n    return singleRoot;\r\n}\r\nconst getFunctionalFallthrough = (attrs) => {\r\n    let res;\r\n    for (const key in attrs) {\r\n        if (key === 'class' || key === 'style' || shared.isOn(key)) {\r\n            (res || (res = {}))[key] = attrs[key];\r\n        }\r\n    }\r\n    return res;\r\n};\r\nconst filterModelListeners = (attrs, props) => {\r\n    const res = {};\r\n    for (const key in attrs) {\r\n        if (!shared.isModelListener(key) || !(key.slice(9) in props)) {\r\n            res[key] = attrs[key];\r\n        }\r\n    }\r\n    return res;\r\n};\r\nconst isElementRoot = (vnode) => {\r\n    return (vnode.shapeFlag & 6 /* COMPONENT */ ||\r\n        vnode.shapeFlag & 1 /* ELEMENT */ ||\r\n        vnode.type === Comment$1 // potential v-if branch switch\r\n    );\r\n};\r\nfunction shouldUpdateComponent(prevVNode, nextVNode, optimized) {\r\n    const { props: prevProps, children: prevChildren, component } = prevVNode;\r\n    const { props: nextProps, children: nextChildren, patchFlag } = nextVNode;\r\n    const emits = component.emitsOptions;\r\n    // force child update for runtime directive or transition on component vnode.\r\n    if (nextVNode.dirs || nextVNode.transition) {\r\n        return true;\r\n    }\r\n    if (optimized && patchFlag >= 0) {\r\n        if (patchFlag & 1024 /* DYNAMIC_SLOTS */) {\r\n            // slot content that references values that might have changed,\r\n            // e.g. in a v-for\r\n            return true;\r\n        }\r\n        if (patchFlag & 16 /* FULL_PROPS */) {\r\n            if (!prevProps) {\r\n                return !!nextProps;\r\n            }\r\n            // presence of this flag indicates props are always non-null\r\n            return hasPropsChanged(prevProps, nextProps, emits);\r\n        }\r\n        else if (patchFlag & 8 /* PROPS */) {\r\n            const dynamicProps = nextVNode.dynamicProps;\r\n            for (let i = 0; i < dynamicProps.length; i++) {\r\n                const key = dynamicProps[i];\r\n                if (nextProps[key] !== prevProps[key] &&\r\n                    !isEmitListener(emits, key)) {\r\n                    return true;\r\n                }\r\n            }\r\n        }\r\n    }\r\n    else {\r\n        // this path is only taken by manually written render functions\r\n        // so presence of any children leads to a forced update\r\n        if (prevChildren || nextChildren) {\r\n            if (!nextChildren || !nextChildren.$stable) {\r\n                return true;\r\n            }\r\n        }\r\n        if (prevProps === nextProps) {\r\n            return false;\r\n        }\r\n        if (!prevProps) {\r\n            return !!nextProps;\r\n        }\r\n        if (!nextProps) {\r\n            return true;\r\n        }\r\n        return hasPropsChanged(prevProps, nextProps, emits);\r\n    }\r\n    return false;\r\n}\r\nfunction hasPropsChanged(prevProps, nextProps, emitsOptions) {\r\n    const nextKeys = Object.keys(nextProps);\r\n    if (nextKeys.length !== Object.keys(prevProps).length) {\r\n        return true;\r\n    }\r\n    for (let i = 0; i < nextKeys.length; i++) {\r\n        const key = nextKeys[i];\r\n        if (nextProps[key] !== prevProps[key] &&\r\n            !isEmitListener(emitsOptions, key)) {\r\n            return true;\r\n        }\r\n    }\r\n    return false;\r\n}\r\nfunction updateHOCHostEl({ vnode, parent }, el // HostNode\r\n) {\r\n    while (parent && parent.subTree === vnode) {\r\n        (vnode = parent.vnode).el = el;\r\n        parent = parent.parent;\r\n    }\r\n}\n\nconst isSuspense = (type) => type.__isSuspense;\r\n// Suspense exposes a component-like API, and is treated like a component\r\n// in the compiler, but internally it's a special built-in type that hooks\r\n// directly into the renderer.\r\nconst SuspenseImpl = {\r\n    name: 'Suspense',\r\n    // In order to make Suspense tree-shakable, we need to avoid importing it\r\n    // directly in the renderer. The renderer checks for the __isSuspense flag\r\n    // on a vnode's type and calls the `process` method, passing in renderer\r\n    // internals.\r\n    __isSuspense: true,\r\n    process(n1, n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized, \r\n    // platform-specific impl passed from renderer\r\n    rendererInternals) {\r\n        if (n1 == null) {\r\n            mountSuspense(n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized, rendererInternals);\r\n        }\r\n        else {\r\n            patchSuspense(n1, n2, container, anchor, parentComponent, isSVG, slotScopeIds, optimized, rendererInternals);\r\n        }\r\n    },\r\n    hydrate: hydrateSuspense,\r\n    create: createSuspenseBoundary,\r\n    normalize: normalizeSuspenseChildren\r\n};\r\n// Force-casted public typing for h and TSX props inference\r\nconst Suspense = (SuspenseImpl\r\n    );\r\nfunction mountSuspense(vnode, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized, rendererInternals) {\r\n    const { p: patch, o: { createElement } } = rendererInternals;\r\n    const hiddenContainer = createElement('div');\r\n    const suspense = (vnode.suspense = createSuspenseBoundary(vnode, parentSuspense, parentComponent, container, hiddenContainer, anchor, isSVG, slotScopeIds, optimized, rendererInternals));\r\n    // start mounting the content subtree in an off-dom container\r\n    patch(null, (suspense.pendingBranch = vnode.ssContent), hiddenContainer, null, parentComponent, suspense, isSVG, slotScopeIds);\r\n    // now check if we have encountered any async deps\r\n    if (suspense.deps > 0) {\r\n        // has async\r\n        // mount the fallback tree\r\n        patch(null, vnode.ssFallback, container, anchor, parentComponent, null, // fallback tree will not have suspense context\r\n        isSVG, slotScopeIds);\r\n        setActiveBranch(suspense, vnode.ssFallback);\r\n    }\r\n    else {\r\n        // Suspense has no async deps. Just resolve.\r\n        suspense.resolve();\r\n    }\r\n}\r\nfunction patchSuspense(n1, n2, container, anchor, parentComponent, isSVG, slotScopeIds, optimized, { p: patch, um: unmount, o: { createElement } }) {\r\n    const suspense = (n2.suspense = n1.suspense);\r\n    suspense.vnode = n2;\r\n    n2.el = n1.el;\r\n    const newBranch = n2.ssContent;\r\n    const newFallback = n2.ssFallback;\r\n    const { activeBranch, pendingBranch, isInFallback, isHydrating } = suspense;\r\n    if (pendingBranch) {\r\n        suspense.pendingBranch = newBranch;\r\n        if (isSameVNodeType(newBranch, pendingBranch)) {\r\n            // same root type but content may have changed.\r\n            patch(pendingBranch, newBranch, suspense.hiddenContainer, null, parentComponent, suspense, isSVG, slotScopeIds, optimized);\r\n            if (suspense.deps <= 0) {\r\n                suspense.resolve();\r\n            }\r\n            else if (isInFallback) {\r\n                patch(activeBranch, newFallback, container, anchor, parentComponent, null, // fallback tree will not have suspense context\r\n                isSVG, slotScopeIds, optimized);\r\n                setActiveBranch(suspense, newFallback);\r\n            }\r\n        }\r\n        else {\r\n            // toggled before pending tree is resolved\r\n            suspense.pendingId++;\r\n            if (isHydrating) {\r\n                // if toggled before hydration is finished, the current DOM tree is\r\n                // no longer valid. set it as the active branch so it will be unmounted\r\n                // when resolved\r\n                suspense.isHydrating = false;\r\n                suspense.activeBranch = pendingBranch;\r\n            }\r\n            else {\r\n                unmount(pendingBranch, parentComponent, suspense);\r\n            }\r\n            // increment pending ID. this is used to invalidate async callbacks\r\n            // reset suspense state\r\n            suspense.deps = 0;\r\n            // discard effects from pending branch\r\n            suspense.effects.length = 0;\r\n            // discard previous container\r\n            suspense.hiddenContainer = createElement('div');\r\n            if (isInFallback) {\r\n                // already in fallback state\r\n                patch(null, newBranch, suspense.hiddenContainer, null, parentComponent, suspense, isSVG, slotScopeIds, optimized);\r\n                if (suspense.deps <= 0) {\r\n                    suspense.resolve();\r\n                }\r\n                else {\r\n                    patch(activeBranch, newFallback, container, anchor, parentComponent, null, // fallback tree will not have suspense context\r\n                    isSVG, slotScopeIds, optimized);\r\n                    setActiveBranch(suspense, newFallback);\r\n                }\r\n            }\r\n            else if (activeBranch && isSameVNodeType(newBranch, activeBranch)) {\r\n                // toggled \"back\" to current active branch\r\n                patch(activeBranch, newBranch, container, anchor, parentComponent, suspense, isSVG, slotScopeIds, optimized);\r\n                // force resolve\r\n                suspense.resolve(true);\r\n            }\r\n            else {\r\n                // switched to a 3rd branch\r\n                patch(null, newBranch, suspense.hiddenContainer, null, parentComponent, suspense, isSVG, slotScopeIds, optimized);\r\n                if (suspense.deps <= 0) {\r\n                    suspense.resolve();\r\n                }\r\n            }\r\n        }\r\n    }\r\n    else {\r\n        if (activeBranch && isSameVNodeType(newBranch, activeBranch)) {\r\n            // root did not change, just normal patch\r\n            patch(activeBranch, newBranch, container, anchor, parentComponent, suspense, isSVG, slotScopeIds, optimized);\r\n            setActiveBranch(suspense, newBranch);\r\n        }\r\n        else {\r\n            // root node toggled\r\n            // invoke @pending event\r\n            const onPending = n2.props && n2.props.onPending;\r\n            if (shared.isFunction(onPending)) {\r\n                onPending();\r\n            }\r\n            // mount pending branch in off-dom container\r\n            suspense.pendingBranch = newBranch;\r\n            suspense.pendingId++;\r\n            patch(null, newBranch, suspense.hiddenContainer, null, parentComponent, suspense, isSVG, slotScopeIds, optimized);\r\n            if (suspense.deps <= 0) {\r\n                // incoming branch has no async deps, resolve now.\r\n                suspense.resolve();\r\n            }\r\n            else {\r\n                const { timeout, pendingId } = suspense;\r\n                if (timeout > 0) {\r\n                    setTimeout(() => {\r\n                        if (suspense.pendingId === pendingId) {\r\n                            suspense.fallback(newFallback);\r\n                        }\r\n                    }, timeout);\r\n                }\r\n                else if (timeout === 0) {\r\n                    suspense.fallback(newFallback);\r\n                }\r\n            }\r\n        }\r\n    }\r\n}\r\nfunction createSuspenseBoundary(vnode, parent, parentComponent, container, hiddenContainer, anchor, isSVG, slotScopeIds, optimized, rendererInternals, isHydrating = false) {\r\n    const { p: patch, m: move, um: unmount, n: next, o: { parentNode, remove } } = rendererInternals;\r\n    const timeout = shared.toNumber(vnode.props && vnode.props.timeout);\r\n    const suspense = {\r\n        vnode,\r\n        parent,\r\n        parentComponent,\r\n        isSVG,\r\n        container,\r\n        hiddenContainer,\r\n        anchor,\r\n        deps: 0,\r\n        pendingId: 0,\r\n        timeout: typeof timeout === 'number' ? timeout : -1,\r\n        activeBranch: null,\r\n        pendingBranch: null,\r\n        isInFallback: true,\r\n        isHydrating,\r\n        isUnmounted: false,\r\n        effects: [],\r\n        resolve(resume = false) {\r\n            const { vnode, activeBranch, pendingBranch, pendingId, effects, parentComponent, container } = suspense;\r\n            if (suspense.isHydrating) {\r\n                suspense.isHydrating = false;\r\n            }\r\n            else if (!resume) {\r\n                const delayEnter = activeBranch &&\r\n                    pendingBranch.transition &&\r\n                    pendingBranch.transition.mode === 'out-in';\r\n                if (delayEnter) {\r\n                    activeBranch.transition.afterLeave = () => {\r\n                        if (pendingId === suspense.pendingId) {\r\n                            move(pendingBranch, container, anchor, 0 /* ENTER */);\r\n                        }\r\n                    };\r\n                }\r\n                // this is initial anchor on mount\r\n                let { anchor } = suspense;\r\n                // unmount current active tree\r\n                if (activeBranch) {\r\n                    // if the fallback tree was mounted, it may have been moved\r\n                    // as part of a parent suspense. get the latest anchor for insertion\r\n                    anchor = next(activeBranch);\r\n                    unmount(activeBranch, parentComponent, suspense, true);\r\n                }\r\n                if (!delayEnter) {\r\n                    // move content from off-dom container to actual container\r\n                    move(pendingBranch, container, anchor, 0 /* ENTER */);\r\n                }\r\n            }\r\n            setActiveBranch(suspense, pendingBranch);\r\n            suspense.pendingBranch = null;\r\n            suspense.isInFallback = false;\r\n            // flush buffered effects\r\n            // check if there is a pending parent suspense\r\n            let parent = suspense.parent;\r\n            let hasUnresolvedAncestor = false;\r\n            while (parent) {\r\n                if (parent.pendingBranch) {\r\n                    // found a pending parent suspense, merge buffered post jobs\r\n                    // into that parent\r\n                    parent.effects.push(...effects);\r\n                    hasUnresolvedAncestor = true;\r\n                    break;\r\n                }\r\n                parent = parent.parent;\r\n            }\r\n            // no pending parent suspense, flush all jobs\r\n            if (!hasUnresolvedAncestor) {\r\n                queuePostFlushCb(effects);\r\n            }\r\n            suspense.effects = [];\r\n            // invoke @resolve event\r\n            const onResolve = vnode.props && vnode.props.onResolve;\r\n            if (shared.isFunction(onResolve)) {\r\n                onResolve();\r\n            }\r\n        },\r\n        fallback(fallbackVNode) {\r\n            if (!suspense.pendingBranch) {\r\n                return;\r\n            }\r\n            const { vnode, activeBranch, parentComponent, container, isSVG } = suspense;\r\n            // invoke @fallback event\r\n            const onFallback = vnode.props && vnode.props.onFallback;\r\n            if (shared.isFunction(onFallback)) {\r\n                onFallback();\r\n            }\r\n            const anchor = next(activeBranch);\r\n            const mountFallback = () => {\r\n                if (!suspense.isInFallback) {\r\n                    return;\r\n                }\r\n                // mount the fallback tree\r\n                patch(null, fallbackVNode, container, anchor, parentComponent, null, // fallback tree will not have suspense context\r\n                isSVG, slotScopeIds, optimized);\r\n                setActiveBranch(suspense, fallbackVNode);\r\n            };\r\n            const delayEnter = fallbackVNode.transition && fallbackVNode.transition.mode === 'out-in';\r\n            if (delayEnter) {\r\n                activeBranch.transition.afterLeave = mountFallback;\r\n            }\r\n            // unmount current active branch\r\n            unmount(activeBranch, parentComponent, null, // no suspense so unmount hooks fire now\r\n            true // shouldRemove\r\n            );\r\n            suspense.isInFallback = true;\r\n            if (!delayEnter) {\r\n                mountFallback();\r\n            }\r\n        },\r\n        move(container, anchor, type) {\r\n            suspense.activeBranch &&\r\n                move(suspense.activeBranch, container, anchor, type);\r\n            suspense.container = container;\r\n        },\r\n        next() {\r\n            return suspense.activeBranch && next(suspense.activeBranch);\r\n        },\r\n        registerDep(instance, setupRenderEffect) {\r\n            const isInPendingSuspense = !!suspense.pendingBranch;\r\n            if (isInPendingSuspense) {\r\n                suspense.deps++;\r\n            }\r\n            const hydratedEl = instance.vnode.el;\r\n            instance\r\n                .asyncDep.catch(err => {\r\n                handleError(err, instance, 0 /* SETUP_FUNCTION */);\r\n            })\r\n                .then(asyncSetupResult => {\r\n                // retry when the setup() promise resolves.\r\n                // component may have been unmounted before resolve.\r\n                if (instance.isUnmounted ||\r\n                    suspense.isUnmounted ||\r\n                    suspense.pendingId !== instance.suspenseId) {\r\n                    return;\r\n                }\r\n                // retry from this component\r\n                instance.asyncResolved = true;\r\n                const { vnode } = instance;\r\n                handleSetupResult(instance, asyncSetupResult, false);\r\n                if (hydratedEl) {\r\n                    // vnode may have been replaced if an update happened before the\r\n                    // async dep is resolved.\r\n                    vnode.el = hydratedEl;\r\n                }\r\n                const placeholder = !hydratedEl && instance.subTree.el;\r\n                setupRenderEffect(instance, vnode, \r\n                // component may have been moved before resolve.\r\n                // if this is not a hydration, instance.subTree will be the comment\r\n                // placeholder.\r\n                parentNode(hydratedEl || instance.subTree.el), \r\n                // anchor will not be used if this is hydration, so only need to\r\n                // consider the comment placeholder case.\r\n                hydratedEl ? null : next(instance.subTree), suspense, isSVG, optimized);\r\n                if (placeholder) {\r\n                    remove(placeholder);\r\n                }\r\n                updateHOCHostEl(instance, vnode.el);\r\n                // only decrease deps count if suspense is not already resolved\r\n                if (isInPendingSuspense && --suspense.deps === 0) {\r\n                    suspense.resolve();\r\n                }\r\n            });\r\n        },\r\n        unmount(parentSuspense, doRemove) {\r\n            suspense.isUnmounted = true;\r\n            if (suspense.activeBranch) {\r\n                unmount(suspense.activeBranch, parentComponent, parentSuspense, doRemove);\r\n            }\r\n            if (suspense.pendingBranch) {\r\n                unmount(suspense.pendingBranch, parentComponent, parentSuspense, doRemove);\r\n            }\r\n        }\r\n    };\r\n    return suspense;\r\n}\r\nfunction hydrateSuspense(node, vnode, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized, rendererInternals, hydrateNode) {\r\n    /* eslint-disable no-restricted-globals */\r\n    const suspense = (vnode.suspense = createSuspenseBoundary(vnode, parentSuspense, parentComponent, node.parentNode, document.createElement('div'), null, isSVG, slotScopeIds, optimized, rendererInternals, true /* hydrating */));\r\n    // there are two possible scenarios for server-rendered suspense:\r\n    // - success: ssr content should be fully resolved\r\n    // - failure: ssr content should be the fallback branch.\r\n    // however, on the client we don't really know if it has failed or not\r\n    // attempt to hydrate the DOM assuming it has succeeded, but we still\r\n    // need to construct a suspense boundary first\r\n    const result = hydrateNode(node, (suspense.pendingBranch = vnode.ssContent), parentComponent, suspense, slotScopeIds, optimized);\r\n    if (suspense.deps === 0) {\r\n        suspense.resolve();\r\n    }\r\n    return result;\r\n    /* eslint-enable no-restricted-globals */\r\n}\r\nfunction normalizeSuspenseChildren(vnode) {\r\n    const { shapeFlag, children } = vnode;\r\n    const isSlotChildren = shapeFlag & 32 /* SLOTS_CHILDREN */;\r\n    vnode.ssContent = normalizeSuspenseSlot(isSlotChildren ? children.default : children);\r\n    vnode.ssFallback = isSlotChildren\r\n        ? normalizeSuspenseSlot(children.fallback)\r\n        : createVNode(Comment);\r\n}\r\nfunction normalizeSuspenseSlot(s) {\r\n    let block;\r\n    if (shared.isFunction(s)) {\r\n        const isCompiledSlot = s._c;\r\n        if (isCompiledSlot) {\r\n            // disableTracking: false\r\n            // allow block tracking for compiled slots\r\n            // (see ./componentRenderContext.ts)\r\n            s._d = false;\r\n            openBlock();\r\n        }\r\n        s = s();\r\n        if (isCompiledSlot) {\r\n            s._d = true;\r\n            block = currentBlock;\r\n            closeBlock();\r\n        }\r\n    }\r\n    if (shared.isArray(s)) {\r\n        const singleChild = filterSingleRoot(s);\r\n        s = singleChild;\r\n    }\r\n    s = normalizeVNode(s);\r\n    if (block) {\r\n        s.dynamicChildren = block.filter(c => c !== s);\r\n    }\r\n    return s;\r\n}\r\nfunction queueEffectWithSuspense(fn, suspense) {\r\n    if (suspense && suspense.pendingBranch) {\r\n        if (shared.isArray(fn)) {\r\n            suspense.effects.push(...fn);\r\n        }\r\n        else {\r\n            suspense.effects.push(fn);\r\n        }\r\n    }\r\n    else {\r\n        queuePostFlushCb(fn);\r\n    }\r\n}\r\nfunction setActiveBranch(suspense, branch) {\r\n    suspense.activeBranch = branch;\r\n    const { vnode, parentComponent } = suspense;\r\n    const el = (vnode.el = branch.el);\r\n    // in case suspense is the root node of a component,\r\n    // recursively update the HOC el\r\n    if (parentComponent && parentComponent.subTree === vnode) {\r\n        parentComponent.vnode.el = el;\r\n        updateHOCHostEl(parentComponent, el);\r\n    }\r\n}\n\nfunction provide(key, value) {\r\n    if (!currentInstance) ;\r\n    else {\r\n        let provides = currentInstance.provides;\r\n        // by default an instance inherits its parent's provides object\r\n        // but when it needs to provide values of its own, it creates its\r\n        // own provides object using parent provides object as prototype.\r\n        // this way in `inject` we can simply look up injections from direct\r\n        // parent and let the prototype chain do the work.\r\n        const parentProvides = currentInstance.parent && currentInstance.parent.provides;\r\n        if (parentProvides === provides) {\r\n            provides = currentInstance.provides = Object.create(parentProvides);\r\n        }\r\n        // TS doesn't allow symbol as index type\r\n        provides[key] = value;\r\n    }\r\n}\r\nfunction inject(key, defaultValue, treatDefaultAsFactory = false) {\r\n    // fallback to `currentRenderingInstance` so that this can be called in\r\n    // a functional component\r\n    const instance = currentInstance || currentRenderingInstance;\r\n    if (instance) {\r\n        // #2400\r\n        // to support `app.use` plugins,\r\n        // fallback to appContext's `provides` if the intance is at root\r\n        const provides = instance.parent == null\r\n            ? instance.vnode.appContext && instance.vnode.appContext.provides\r\n            : instance.parent.provides;\r\n        if (provides && key in provides) {\r\n            // TS doesn't allow symbol as index type\r\n            return provides[key];\r\n        }\r\n        else if (arguments.length > 1) {\r\n            return treatDefaultAsFactory && shared.isFunction(defaultValue)\r\n                ? defaultValue()\r\n                : defaultValue;\r\n        }\r\n        else ;\r\n    }\r\n}\n\n// Simple effect.\r\nfunction watchEffect(effect, options) {\r\n    return doWatch(effect, null, options);\r\n}\r\n// initial value for watchers to trigger on undefined initial values\r\nconst INITIAL_WATCHER_VALUE = {};\r\n// implementation\r\nfunction watch(source, cb, options) {\r\n    return doWatch(source, cb, options);\r\n}\r\nfunction doWatch(source, cb, { immediate, deep, flush, onTrack, onTrigger } = shared.EMPTY_OBJ, instance = currentInstance) {\r\n    let getter;\r\n    let forceTrigger = false;\r\n    let isMultiSource = false;\r\n    if (reactivity.isRef(source)) {\r\n        getter = () => source.value;\r\n        forceTrigger = !!source._shallow;\r\n    }\r\n    else if (reactivity.isReactive(source)) {\r\n        getter = () => source;\r\n        deep = true;\r\n    }\r\n    else if (shared.isArray(source)) {\r\n        isMultiSource = true;\r\n        forceTrigger = source.some(reactivity.isReactive);\r\n        getter = () => source.map(s => {\r\n            if (reactivity.isRef(s)) {\r\n                return s.value;\r\n            }\r\n            else if (reactivity.isReactive(s)) {\r\n                return traverse(s);\r\n            }\r\n            else if (shared.isFunction(s)) {\r\n                return callWithErrorHandling(s, instance, 2 /* WATCH_GETTER */);\r\n            }\r\n            else ;\r\n        });\r\n    }\r\n    else if (shared.isFunction(source)) {\r\n        if (cb) {\r\n            // getter with cb\r\n            getter = () => callWithErrorHandling(source, instance, 2 /* WATCH_GETTER */);\r\n        }\r\n        else {\r\n            // no cb -> simple effect\r\n            getter = () => {\r\n                if (instance && instance.isUnmounted) {\r\n                    return;\r\n                }\r\n                if (cleanup) {\r\n                    cleanup();\r\n                }\r\n                return callWithAsyncErrorHandling(source, instance, 3 /* WATCH_CALLBACK */, [onInvalidate]);\r\n            };\r\n        }\r\n    }\r\n    else {\r\n        getter = shared.NOOP;\r\n    }\r\n    if (cb && deep) {\r\n        const baseGetter = getter;\r\n        getter = () => traverse(baseGetter());\r\n    }\r\n    let cleanup;\r\n    let onInvalidate = (fn) => {\r\n        cleanup = runner.options.onStop = () => {\r\n            callWithErrorHandling(fn, instance, 4 /* WATCH_CLEANUP */);\r\n        };\r\n    };\r\n    // in SSR there is no need to setup an actual effect, and it should be noop\r\n    // unless it's eager\r\n    if (isInSSRComponentSetup) {\r\n        // we will also not call the invalidate callback (+ runner is not set up)\r\n        onInvalidate = shared.NOOP;\r\n        if (!cb) {\r\n            getter();\r\n        }\r\n        else if (immediate) {\r\n            callWithAsyncErrorHandling(cb, instance, 3 /* WATCH_CALLBACK */, [\r\n                getter(),\r\n                undefined,\r\n                onInvalidate\r\n            ]);\r\n        }\r\n        return shared.NOOP;\r\n    }\r\n    let oldValue = isMultiSource ? [] : INITIAL_WATCHER_VALUE;\r\n    const job = () => {\r\n        if (!runner.active) {\r\n            return;\r\n        }\r\n        if (cb) {\r\n            // watch(source, cb)\r\n            const newValue = runner();\r\n            if (deep ||\r\n                forceTrigger ||\r\n                (isMultiSource\r\n                    ? newValue.some((v, i) => shared.hasChanged(v, oldValue[i]))\r\n                    : shared.hasChanged(newValue, oldValue)) ||\r\n                (false  )) {\r\n                // cleanup before running cb again\r\n                if (cleanup) {\r\n                    cleanup();\r\n                }\r\n                callWithAsyncErrorHandling(cb, instance, 3 /* WATCH_CALLBACK */, [\r\n                    newValue,\r\n                    // pass undefined as the old value when it's changed for the first time\r\n                    oldValue === INITIAL_WATCHER_VALUE ? undefined : oldValue,\r\n                    onInvalidate\r\n                ]);\r\n                oldValue = newValue;\r\n            }\r\n        }\r\n        else {\r\n            // watchEffect\r\n            runner();\r\n        }\r\n    };\r\n    // important: mark the job as a watcher callback so that scheduler knows\r\n    // it is allowed to self-trigger (#1727)\r\n    job.allowRecurse = !!cb;\r\n    let scheduler;\r\n    if (flush === 'sync') {\r\n        scheduler = job; // the scheduler function gets called directly\r\n    }\r\n    else if (flush === 'post') {\r\n        scheduler = () => queuePostRenderEffect(job, instance && instance.suspense);\r\n    }\r\n    else {\r\n        // default: 'pre'\r\n        scheduler = () => {\r\n            if (!instance || instance.isMounted) {\r\n                queuePreFlushCb(job);\r\n            }\r\n            else {\r\n                // with 'pre' option, the first call must happen before\r\n                // the component is mounted so it is called synchronously.\r\n                job();\r\n            }\r\n        };\r\n    }\r\n    const runner = reactivity.effect(getter, {\r\n        lazy: true,\r\n        onTrack,\r\n        onTrigger,\r\n        scheduler\r\n    });\r\n    recordInstanceBoundEffect(runner, instance);\r\n    // initial run\r\n    if (cb) {\r\n        if (immediate) {\r\n            job();\r\n        }\r\n        else {\r\n            oldValue = runner();\r\n        }\r\n    }\r\n    else if (flush === 'post') {\r\n        queuePostRenderEffect(runner, instance && instance.suspense);\r\n    }\r\n    else {\r\n        runner();\r\n    }\r\n    return () => {\r\n        reactivity.stop(runner);\r\n        if (instance) {\r\n            shared.remove(instance.effects, runner);\r\n        }\r\n    };\r\n}\r\n// this.$watch\r\nfunction instanceWatch(source, value, options) {\r\n    const publicThis = this.proxy;\r\n    const getter = shared.isString(source)\r\n        ? source.includes('.')\r\n            ? createPathGetter(publicThis, source)\r\n            : () => publicThis[source]\r\n        : source.bind(publicThis, publicThis);\r\n    let cb;\r\n    if (shared.isFunction(value)) {\r\n        cb = value;\r\n    }\r\n    else {\r\n        cb = value.handler;\r\n        options = value;\r\n    }\r\n    return doWatch(getter, cb.bind(publicThis), options, this);\r\n}\r\nfunction createPathGetter(ctx, path) {\r\n    const segments = path.split('.');\r\n    return () => {\r\n        let cur = ctx;\r\n        for (let i = 0; i < segments.length && cur; i++) {\r\n            cur = cur[segments[i]];\r\n        }\r\n        return cur;\r\n    };\r\n}\r\nfunction traverse(value, seen = new Set()) {\r\n    if (!shared.isObject(value) ||\r\n        seen.has(value) ||\r\n        value[\"__v_skip\" /* SKIP */]) {\r\n        return value;\r\n    }\r\n    seen.add(value);\r\n    if (reactivity.isRef(value)) {\r\n        traverse(value.value, seen);\r\n    }\r\n    else if (shared.isArray(value)) {\r\n        for (let i = 0; i < value.length; i++) {\r\n            traverse(value[i], seen);\r\n        }\r\n    }\r\n    else if (shared.isSet(value) || shared.isMap(value)) {\r\n        value.forEach((v) => {\r\n            traverse(v, seen);\r\n        });\r\n    }\r\n    else if (shared.isPlainObject(value)) {\r\n        for (const key in value) {\r\n            traverse(value[key], seen);\r\n        }\r\n    }\r\n    return value;\r\n}\n\nfunction useTransitionState() {\r\n    const state = {\r\n        isMounted: false,\r\n        isLeaving: false,\r\n        isUnmounting: false,\r\n        leavingVNodes: new Map()\r\n    };\r\n    onMounted(() => {\r\n        state.isMounted = true;\r\n    });\r\n    onBeforeUnmount(() => {\r\n        state.isUnmounting = true;\r\n    });\r\n    return state;\r\n}\r\nconst TransitionHookValidator = [Function, Array];\r\nconst BaseTransitionImpl = {\r\n    name: `BaseTransition`,\r\n    props: {\r\n        mode: String,\r\n        appear: Boolean,\r\n        persisted: Boolean,\r\n        // enter\r\n        onBeforeEnter: TransitionHookValidator,\r\n        onEnter: TransitionHookValidator,\r\n        onAfterEnter: TransitionHookValidator,\r\n        onEnterCancelled: TransitionHookValidator,\r\n        // leave\r\n        onBeforeLeave: TransitionHookValidator,\r\n        onLeave: TransitionHookValidator,\r\n        onAfterLeave: TransitionHookValidator,\r\n        onLeaveCancelled: TransitionHookValidator,\r\n        // appear\r\n        onBeforeAppear: TransitionHookValidator,\r\n        onAppear: TransitionHookValidator,\r\n        onAfterAppear: TransitionHookValidator,\r\n        onAppearCancelled: TransitionHookValidator\r\n    },\r\n    setup(props, { slots }) {\r\n        const instance = getCurrentInstance();\r\n        const state = useTransitionState();\r\n        let prevTransitionKey;\r\n        return () => {\r\n            const children = slots.default && getTransitionRawChildren(slots.default(), true);\r\n            if (!children || !children.length) {\r\n                return;\r\n            }\r\n            // there's no need to track reactivity for these props so use the raw\r\n            // props for a bit better perf\r\n            const rawProps = reactivity.toRaw(props);\r\n            const { mode } = rawProps;\r\n            // at this point children has a guaranteed length of 1.\r\n            const child = children[0];\r\n            if (state.isLeaving) {\r\n                return emptyPlaceholder(child);\r\n            }\r\n            // in the case of <transition><keep-alive/></transition>, we need to\r\n            // compare the type of the kept-alive children.\r\n            const innerChild = getKeepAliveChild(child);\r\n            if (!innerChild) {\r\n                return emptyPlaceholder(child);\r\n            }\r\n            const enterHooks = resolveTransitionHooks(innerChild, rawProps, state, instance);\r\n            setTransitionHooks(innerChild, enterHooks);\r\n            const oldChild = instance.subTree;\r\n            const oldInnerChild = oldChild && getKeepAliveChild(oldChild);\r\n            let transitionKeyChanged = false;\r\n            const { getTransitionKey } = innerChild.type;\r\n            if (getTransitionKey) {\r\n                const key = getTransitionKey();\r\n                if (prevTransitionKey === undefined) {\r\n                    prevTransitionKey = key;\r\n                }\r\n                else if (key !== prevTransitionKey) {\r\n                    prevTransitionKey = key;\r\n                    transitionKeyChanged = true;\r\n                }\r\n            }\r\n            // handle mode\r\n            if (oldInnerChild &&\r\n                oldInnerChild.type !== Comment$1 &&\r\n                (!isSameVNodeType(innerChild, oldInnerChild) || transitionKeyChanged)) {\r\n                const leavingHooks = resolveTransitionHooks(oldInnerChild, rawProps, state, instance);\r\n                // update old tree's hooks in case of dynamic transition\r\n                setTransitionHooks(oldInnerChild, leavingHooks);\r\n                // switching between different views\r\n                if (mode === 'out-in') {\r\n                    state.isLeaving = true;\r\n                    // return placeholder node and queue update when leave finishes\r\n                    leavingHooks.afterLeave = () => {\r\n                        state.isLeaving = false;\r\n                        instance.update();\r\n                    };\r\n                    return emptyPlaceholder(child);\r\n                }\r\n                else if (mode === 'in-out' && innerChild.type !== Comment$1) {\r\n                    leavingHooks.delayLeave = (el, earlyRemove, delayedLeave) => {\r\n                        const leavingVNodesCache = getLeavingNodesForType(state, oldInnerChild);\r\n                        leavingVNodesCache[String(oldInnerChild.key)] = oldInnerChild;\r\n                        // early removal callback\r\n                        el._leaveCb = () => {\r\n                            earlyRemove();\r\n                            el._leaveCb = undefined;\r\n                            delete enterHooks.delayedLeave;\r\n                        };\r\n                        enterHooks.delayedLeave = delayedLeave;\r\n                    };\r\n                }\r\n            }\r\n            return child;\r\n        };\r\n    }\r\n};\r\n// export the public type for h/tsx inference\r\n// also to avoid inline import() in generated d.ts files\r\nconst BaseTransition = BaseTransitionImpl;\r\nfunction getLeavingNodesForType(state, vnode) {\r\n    const { leavingVNodes } = state;\r\n    let leavingVNodesCache = leavingVNodes.get(vnode.type);\r\n    if (!leavingVNodesCache) {\r\n        leavingVNodesCache = Object.create(null);\r\n        leavingVNodes.set(vnode.type, leavingVNodesCache);\r\n    }\r\n    return leavingVNodesCache;\r\n}\r\n// The transition hooks are attached to the vnode as vnode.transition\r\n// and will be called at appropriate timing in the renderer.\r\nfunction resolveTransitionHooks(vnode, props, state, instance) {\r\n    const { appear, mode, persisted = false, onBeforeEnter, onEnter, onAfterEnter, onEnterCancelled, onBeforeLeave, onLeave, onAfterLeave, onLeaveCancelled, onBeforeAppear, onAppear, onAfterAppear, onAppearCancelled } = props;\r\n    const key = String(vnode.key);\r\n    const leavingVNodesCache = getLeavingNodesForType(state, vnode);\r\n    const callHook = (hook, args) => {\r\n        hook &&\r\n            callWithAsyncErrorHandling(hook, instance, 9 /* TRANSITION_HOOK */, args);\r\n    };\r\n    const hooks = {\r\n        mode,\r\n        persisted,\r\n        beforeEnter(el) {\r\n            let hook = onBeforeEnter;\r\n            if (!state.isMounted) {\r\n                if (appear) {\r\n                    hook = onBeforeAppear || onBeforeEnter;\r\n                }\r\n                else {\r\n                    return;\r\n                }\r\n            }\r\n            // for same element (v-show)\r\n            if (el._leaveCb) {\r\n                el._leaveCb(true /* cancelled */);\r\n            }\r\n            // for toggled element with same key (v-if)\r\n            const leavingVNode = leavingVNodesCache[key];\r\n            if (leavingVNode &&\r\n                isSameVNodeType(vnode, leavingVNode) &&\r\n                leavingVNode.el._leaveCb) {\r\n                // force early removal (not cancelled)\r\n                leavingVNode.el._leaveCb();\r\n            }\r\n            callHook(hook, [el]);\r\n        },\r\n        enter(el) {\r\n            let hook = onEnter;\r\n            let afterHook = onAfterEnter;\r\n            let cancelHook = onEnterCancelled;\r\n            if (!state.isMounted) {\r\n                if (appear) {\r\n                    hook = onAppear || onEnter;\r\n                    afterHook = onAfterAppear || onAfterEnter;\r\n                    cancelHook = onAppearCancelled || onEnterCancelled;\r\n                }\r\n                else {\r\n                    return;\r\n                }\r\n            }\r\n            let called = false;\r\n            const done = (el._enterCb = (cancelled) => {\r\n                if (called)\r\n                    return;\r\n                called = true;\r\n                if (cancelled) {\r\n                    callHook(cancelHook, [el]);\r\n                }\r\n                else {\r\n                    callHook(afterHook, [el]);\r\n                }\r\n                if (hooks.delayedLeave) {\r\n                    hooks.delayedLeave();\r\n                }\r\n                el._enterCb = undefined;\r\n            });\r\n            if (hook) {\r\n                hook(el, done);\r\n                if (hook.length <= 1) {\r\n                    done();\r\n                }\r\n            }\r\n            else {\r\n                done();\r\n            }\r\n        },\r\n        leave(el, remove) {\r\n            const key = String(vnode.key);\r\n            if (el._enterCb) {\r\n                el._enterCb(true /* cancelled */);\r\n            }\r\n            if (state.isUnmounting) {\r\n                return remove();\r\n            }\r\n            callHook(onBeforeLeave, [el]);\r\n            let called = false;\r\n            const done = (el._leaveCb = (cancelled) => {\r\n                if (called)\r\n                    return;\r\n                called = true;\r\n                remove();\r\n                if (cancelled) {\r\n                    callHook(onLeaveCancelled, [el]);\r\n                }\r\n                else {\r\n                    callHook(onAfterLeave, [el]);\r\n                }\r\n                el._leaveCb = undefined;\r\n                if (leavingVNodesCache[key] === vnode) {\r\n                    delete leavingVNodesCache[key];\r\n                }\r\n            });\r\n            leavingVNodesCache[key] = vnode;\r\n            if (onLeave) {\r\n                onLeave(el, done);\r\n                if (onLeave.length <= 1) {\r\n                    done();\r\n                }\r\n            }\r\n            else {\r\n                done();\r\n            }\r\n        },\r\n        clone(vnode) {\r\n            return resolveTransitionHooks(vnode, props, state, instance);\r\n        }\r\n    };\r\n    return hooks;\r\n}\r\n// the placeholder really only handles one special case: KeepAlive\r\n// in the case of a KeepAlive in a leave phase we need to return a KeepAlive\r\n// placeholder with empty content to avoid the KeepAlive instance from being\r\n// unmounted.\r\nfunction emptyPlaceholder(vnode) {\r\n    if (isKeepAlive(vnode)) {\r\n        vnode = cloneVNode(vnode);\r\n        vnode.children = null;\r\n        return vnode;\r\n    }\r\n}\r\nfunction getKeepAliveChild(vnode) {\r\n    return isKeepAlive(vnode)\r\n        ? vnode.children\r\n            ? vnode.children[0]\r\n            : undefined\r\n        : vnode;\r\n}\r\nfunction setTransitionHooks(vnode, hooks) {\r\n    if (vnode.shapeFlag & 6 /* COMPONENT */ && vnode.component) {\r\n        setTransitionHooks(vnode.component.subTree, hooks);\r\n    }\r\n    else if (vnode.shapeFlag & 128 /* SUSPENSE */) {\r\n        vnode.ssContent.transition = hooks.clone(vnode.ssContent);\r\n        vnode.ssFallback.transition = hooks.clone(vnode.ssFallback);\r\n    }\r\n    else {\r\n        vnode.transition = hooks;\r\n    }\r\n}\r\nfunction getTransitionRawChildren(children, keepComment = false) {\r\n    let ret = [];\r\n    let keyedFragmentCount = 0;\r\n    for (let i = 0; i < children.length; i++) {\r\n        const child = children[i];\r\n        // handle fragment children case, e.g. v-for\r\n        if (child.type === Fragment) {\r\n            if (child.patchFlag & 128 /* KEYED_FRAGMENT */)\r\n                keyedFragmentCount++;\r\n            ret = ret.concat(getTransitionRawChildren(child.children, keepComment));\r\n        }\r\n        // comment placeholders should be skipped, e.g. v-if\r\n        else if (keepComment || child.type !== Comment$1) {\r\n            ret.push(child);\r\n        }\r\n    }\r\n    // #1126 if a transition children list contains multiple sub fragments, these\r\n    // fragments will be merged into a flat children array. Since each v-for\r\n    // fragment may contain different static bindings inside, we need to de-op\r\n    // these children to force full diffs to ensure correct behavior.\r\n    if (keyedFragmentCount > 1) {\r\n        for (let i = 0; i < ret.length; i++) {\r\n            ret[i].patchFlag = -2 /* BAIL */;\r\n        }\r\n    }\r\n    return ret;\r\n}\n\n// implementation, close to no-op\r\nfunction defineComponent(options) {\r\n    return shared.isFunction(options) ? { setup: options, name: options.name } : options;\r\n}\n\nconst isAsyncWrapper = (i) => !!i.type.__asyncLoader;\r\nfunction defineAsyncComponent(source) {\r\n    if (shared.isFunction(source)) {\r\n        source = { loader: source };\r\n    }\r\n    const { loader, loadingComponent, errorComponent, delay = 200, timeout, // undefined = never times out\r\n    suspensible = true, onError: userOnError } = source;\r\n    let pendingRequest = null;\r\n    let resolvedComp;\r\n    let retries = 0;\r\n    const retry = () => {\r\n        retries++;\r\n        pendingRequest = null;\r\n        return load();\r\n    };\r\n    const load = () => {\r\n        let thisRequest;\r\n        return (pendingRequest ||\r\n            (thisRequest = pendingRequest = loader()\r\n                .catch(err => {\r\n                err = err instanceof Error ? err : new Error(String(err));\r\n                if (userOnError) {\r\n                    return new Promise((resolve, reject) => {\r\n                        const userRetry = () => resolve(retry());\r\n                        const userFail = () => reject(err);\r\n                        userOnError(err, userRetry, userFail, retries + 1);\r\n                    });\r\n                }\r\n                else {\r\n                    throw err;\r\n                }\r\n            })\r\n                .then((comp) => {\r\n                if (thisRequest !== pendingRequest && pendingRequest) {\r\n                    return pendingRequest;\r\n                }\r\n                // interop module default\r\n                if (comp &&\r\n                    (comp.__esModule || comp[Symbol.toStringTag] === 'Module')) {\r\n                    comp = comp.default;\r\n                }\r\n                resolvedComp = comp;\r\n                return comp;\r\n            })));\r\n    };\r\n    return defineComponent({\r\n        name: 'AsyncComponentWrapper',\r\n        __asyncLoader: load,\r\n        get __asyncResolved() {\r\n            return resolvedComp;\r\n        },\r\n        setup() {\r\n            const instance = currentInstance;\r\n            // already resolved\r\n            if (resolvedComp) {\r\n                return () => createInnerComp(resolvedComp, instance);\r\n            }\r\n            const onError = (err) => {\r\n                pendingRequest = null;\r\n                handleError(err, instance, 13 /* ASYNC_COMPONENT_LOADER */, !errorComponent /* do not throw in dev if user provided error component */);\r\n            };\r\n            // suspense-controlled or SSR.\r\n            if ((suspensible && instance.suspense) ||\r\n                (isInSSRComponentSetup)) {\r\n                return load()\r\n                    .then(comp => {\r\n                    return () => createInnerComp(comp, instance);\r\n                })\r\n                    .catch(err => {\r\n                    onError(err);\r\n                    return () => errorComponent\r\n                        ? createVNode(errorComponent, {\r\n                            error: err\r\n                        })\r\n                        : null;\r\n                });\r\n            }\r\n            const loaded = reactivity.ref(false);\r\n            const error = reactivity.ref();\r\n            const delayed = reactivity.ref(!!delay);\r\n            if (delay) {\r\n                setTimeout(() => {\r\n                    delayed.value = false;\r\n                }, delay);\r\n            }\r\n            if (timeout != null) {\r\n                setTimeout(() => {\r\n                    if (!loaded.value && !error.value) {\r\n                        const err = new Error(`Async component timed out after ${timeout}ms.`);\r\n                        onError(err);\r\n                        error.value = err;\r\n                    }\r\n                }, timeout);\r\n            }\r\n            load()\r\n                .then(() => {\r\n                loaded.value = true;\r\n                if (instance.parent && isKeepAlive(instance.parent.vnode)) {\r\n                    // parent is keep-alive, force update so the loaded component's\r\n                    // name is taken into account\r\n                    queueJob(instance.parent.update);\r\n                }\r\n            })\r\n                .catch(err => {\r\n                onError(err);\r\n                error.value = err;\r\n            });\r\n            return () => {\r\n                if (loaded.value && resolvedComp) {\r\n                    return createInnerComp(resolvedComp, instance);\r\n                }\r\n                else if (error.value && errorComponent) {\r\n                    return createVNode(errorComponent, {\r\n                        error: error.value\r\n                    });\r\n                }\r\n                else if (loadingComponent && !delayed.value) {\r\n                    return createVNode(loadingComponent);\r\n                }\r\n            };\r\n        }\r\n    });\r\n}\r\nfunction createInnerComp(comp, { vnode: { ref, props, children } }) {\r\n    const vnode = createVNode(comp, props, children);\r\n    // ensure inner component inherits the async wrapper's ref owner\r\n    vnode.ref = ref;\r\n    return vnode;\r\n}\n\nconst isKeepAlive = (vnode) => vnode.type.__isKeepAlive;\r\nconst KeepAliveImpl = {\r\n    name: `KeepAlive`,\r\n    // Marker for special handling inside the renderer. We are not using a ===\r\n    // check directly on KeepAlive in the renderer, because importing it directly\r\n    // would prevent it from being tree-shaken.\r\n    __isKeepAlive: true,\r\n    props: {\r\n        include: [String, RegExp, Array],\r\n        exclude: [String, RegExp, Array],\r\n        max: [String, Number]\r\n    },\r\n    setup(props, { slots }) {\r\n        const instance = getCurrentInstance();\r\n        // KeepAlive communicates with the instantiated renderer via the\r\n        // ctx where the renderer passes in its internals,\r\n        // and the KeepAlive instance exposes activate/deactivate implementations.\r\n        // The whole point of this is to avoid importing KeepAlive directly in the\r\n        // renderer to facilitate tree-shaking.\r\n        const sharedContext = instance.ctx;\r\n        // if the internal renderer is not registered, it indicates that this is server-side rendering,\r\n        // for KeepAlive, we just need to render its children\r\n        if (!sharedContext.renderer) {\r\n            return slots.default;\r\n        }\r\n        const cache = new Map();\r\n        const keys = new Set();\r\n        let current = null;\r\n        const parentSuspense = instance.suspense;\r\n        const { renderer: { p: patch, m: move, um: _unmount, o: { createElement } } } = sharedContext;\r\n        const storageContainer = createElement('div');\r\n        sharedContext.activate = (vnode, container, anchor, isSVG, optimized) => {\r\n            const instance = vnode.component;\r\n            move(vnode, container, anchor, 0 /* ENTER */, parentSuspense);\r\n            // in case props have changed\r\n            patch(instance.vnode, vnode, container, anchor, instance, parentSuspense, isSVG, vnode.slotScopeIds, optimized);\r\n            queuePostRenderEffect(() => {\r\n                instance.isDeactivated = false;\r\n                if (instance.a) {\r\n                    shared.invokeArrayFns(instance.a);\r\n                }\r\n                const vnodeHook = vnode.props && vnode.props.onVnodeMounted;\r\n                if (vnodeHook) {\r\n                    invokeVNodeHook(vnodeHook, instance.parent, vnode);\r\n                }\r\n            }, parentSuspense);\r\n        };\r\n        sharedContext.deactivate = (vnode) => {\r\n            const instance = vnode.component;\r\n            move(vnode, storageContainer, null, 1 /* LEAVE */, parentSuspense);\r\n            queuePostRenderEffect(() => {\r\n                if (instance.da) {\r\n                    shared.invokeArrayFns(instance.da);\r\n                }\r\n                const vnodeHook = vnode.props && vnode.props.onVnodeUnmounted;\r\n                if (vnodeHook) {\r\n                    invokeVNodeHook(vnodeHook, instance.parent, vnode);\r\n                }\r\n                instance.isDeactivated = true;\r\n            }, parentSuspense);\r\n        };\r\n        function unmount(vnode) {\r\n            // reset the shapeFlag so it can be properly unmounted\r\n            resetShapeFlag(vnode);\r\n            _unmount(vnode, instance, parentSuspense);\r\n        }\r\n        function pruneCache(filter) {\r\n            cache.forEach((vnode, key) => {\r\n                const name = getComponentName(vnode.type);\r\n                if (name && (!filter || !filter(name))) {\r\n                    pruneCacheEntry(key);\r\n                }\r\n            });\r\n        }\r\n        function pruneCacheEntry(key) {\r\n            const cached = cache.get(key);\r\n            if (!current || cached.type !== current.type) {\r\n                unmount(cached);\r\n            }\r\n            else if (current) {\r\n                // current active instance should no longer be kept-alive.\r\n                // we can't unmount it now but it might be later, so reset its flag now.\r\n                resetShapeFlag(current);\r\n            }\r\n            cache.delete(key);\r\n            keys.delete(key);\r\n        }\r\n        // prune cache on include/exclude prop change\r\n        watch(() => [props.include, props.exclude], ([include, exclude]) => {\r\n            include && pruneCache(name => matches(include, name));\r\n            exclude && pruneCache(name => !matches(exclude, name));\r\n        }, \r\n        // prune post-render after `current` has been updated\r\n        { flush: 'post', deep: true });\r\n        // cache sub tree after render\r\n        let pendingCacheKey = null;\r\n        const cacheSubtree = () => {\r\n            // fix #1621, the pendingCacheKey could be 0\r\n            if (pendingCacheKey != null) {\r\n                cache.set(pendingCacheKey, getInnerChild(instance.subTree));\r\n            }\r\n        };\r\n        onMounted(cacheSubtree);\r\n        onUpdated(cacheSubtree);\r\n        onBeforeUnmount(() => {\r\n            cache.forEach(cached => {\r\n                const { subTree, suspense } = instance;\r\n                const vnode = getInnerChild(subTree);\r\n                if (cached.type === vnode.type) {\r\n                    // current instance will be unmounted as part of keep-alive's unmount\r\n                    resetShapeFlag(vnode);\r\n                    // but invoke its deactivated hook here\r\n                    const da = vnode.component.da;\r\n                    da && queuePostRenderEffect(da, suspense);\r\n                    return;\r\n                }\r\n                unmount(cached);\r\n            });\r\n        });\r\n        return () => {\r\n            pendingCacheKey = null;\r\n            if (!slots.default) {\r\n                return null;\r\n            }\r\n            const children = slots.default();\r\n            const rawVNode = children[0];\r\n            if (children.length > 1) {\r\n                current = null;\r\n                return children;\r\n            }\r\n            else if (!isVNode(rawVNode) ||\r\n                (!(rawVNode.shapeFlag & 4 /* STATEFUL_COMPONENT */) &&\r\n                    !(rawVNode.shapeFlag & 128 /* SUSPENSE */))) {\r\n                current = null;\r\n                return rawVNode;\r\n            }\r\n            let vnode = getInnerChild(rawVNode);\r\n            const comp = vnode.type;\r\n            // for async components, name check should be based in its loaded\r\n            // inner component if available\r\n            const name = getComponentName(isAsyncWrapper(vnode)\r\n                ? vnode.type.__asyncResolved || {}\r\n                : comp);\r\n            const { include, exclude, max } = props;\r\n            if ((include && (!name || !matches(include, name))) ||\r\n                (exclude && name && matches(exclude, name))) {\r\n                current = vnode;\r\n                return rawVNode;\r\n            }\r\n            const key = vnode.key == null ? comp : vnode.key;\r\n            const cachedVNode = cache.get(key);\r\n            // clone vnode if it's reused because we are going to mutate it\r\n            if (vnode.el) {\r\n                vnode = cloneVNode(vnode);\r\n                if (rawVNode.shapeFlag & 128 /* SUSPENSE */) {\r\n                    rawVNode.ssContent = vnode;\r\n                }\r\n            }\r\n            // #1513 it's possible for the returned vnode to be cloned due to attr\r\n            // fallthrough or scopeId, so the vnode here may not be the final vnode\r\n            // that is mounted. Instead of caching it directly, we store the pending\r\n            // key and cache `instance.subTree` (the normalized vnode) in\r\n            // beforeMount/beforeUpdate hooks.\r\n            pendingCacheKey = key;\r\n            if (cachedVNode) {\r\n                // copy over mounted state\r\n                vnode.el = cachedVNode.el;\r\n                vnode.component = cachedVNode.component;\r\n                if (vnode.transition) {\r\n                    // recursively update transition hooks on subTree\r\n                    setTransitionHooks(vnode, vnode.transition);\r\n                }\r\n                // avoid vnode being mounted as fresh\r\n                vnode.shapeFlag |= 512 /* COMPONENT_KEPT_ALIVE */;\r\n                // make this key the freshest\r\n                keys.delete(key);\r\n                keys.add(key);\r\n            }\r\n            else {\r\n                keys.add(key);\r\n                // prune oldest entry\r\n                if (max && keys.size > parseInt(max, 10)) {\r\n                    pruneCacheEntry(keys.values().next().value);\r\n                }\r\n            }\r\n            // avoid vnode being unmounted\r\n            vnode.shapeFlag |= 256 /* COMPONENT_SHOULD_KEEP_ALIVE */;\r\n            current = vnode;\r\n            return rawVNode;\r\n        };\r\n    }\r\n};\r\n// export the public type for h/tsx inference\r\n// also to avoid inline import() in generated d.ts files\r\nconst KeepAlive = KeepAliveImpl;\r\nfunction matches(pattern, name) {\r\n    if (shared.isArray(pattern)) {\r\n        return pattern.some((p) => matches(p, name));\r\n    }\r\n    else if (shared.isString(pattern)) {\r\n        return pattern.split(',').indexOf(name) > -1;\r\n    }\r\n    else if (pattern.test) {\r\n        return pattern.test(name);\r\n    }\r\n    /* istanbul ignore next */\r\n    return false;\r\n}\r\nfunction onActivated(hook, target) {\r\n    registerKeepAliveHook(hook, \"a\" /* ACTIVATED */, target);\r\n}\r\nfunction onDeactivated(hook, target) {\r\n    registerKeepAliveHook(hook, \"da\" /* DEACTIVATED */, target);\r\n}\r\nfunction registerKeepAliveHook(hook, type, target = currentInstance) {\r\n    // cache the deactivate branch check wrapper for injected hooks so the same\r\n    // hook can be properly deduped by the scheduler. \"__wdc\" stands for \"with\r\n    // deactivation check\".\r\n    const wrappedHook = hook.__wdc ||\r\n        (hook.__wdc = () => {\r\n            // only fire the hook if the target instance is NOT in a deactivated branch.\r\n            let current = target;\r\n            while (current) {\r\n                if (current.isDeactivated) {\r\n                    return;\r\n                }\r\n                current = current.parent;\r\n            }\r\n            hook();\r\n        });\r\n    injectHook(type, wrappedHook, target);\r\n    // In addition to registering it on the target instance, we walk up the parent\r\n    // chain and register it on all ancestor instances that are keep-alive roots.\r\n    // This avoids the need to walk the entire component tree when invoking these\r\n    // hooks, and more importantly, avoids the need to track child components in\r\n    // arrays.\r\n    if (target) {\r\n        let current = target.parent;\r\n        while (current && current.parent) {\r\n            if (isKeepAlive(current.parent.vnode)) {\r\n                injectToKeepAliveRoot(wrappedHook, type, target, current);\r\n            }\r\n            current = current.parent;\r\n        }\r\n    }\r\n}\r\nfunction injectToKeepAliveRoot(hook, type, target, keepAliveRoot) {\r\n    // injectHook wraps the original for error handling, so make sure to remove\r\n    // the wrapped version.\r\n    const injected = injectHook(type, hook, keepAliveRoot, true /* prepend */);\r\n    onUnmounted(() => {\r\n        shared.remove(keepAliveRoot[type], injected);\r\n    }, target);\r\n}\r\nfunction resetShapeFlag(vnode) {\r\n    let shapeFlag = vnode.shapeFlag;\r\n    if (shapeFlag & 256 /* COMPONENT_SHOULD_KEEP_ALIVE */) {\r\n        shapeFlag -= 256 /* COMPONENT_SHOULD_KEEP_ALIVE */;\r\n    }\r\n    if (shapeFlag & 512 /* COMPONENT_KEPT_ALIVE */) {\r\n        shapeFlag -= 512 /* COMPONENT_KEPT_ALIVE */;\r\n    }\r\n    vnode.shapeFlag = shapeFlag;\r\n}\r\nfunction getInnerChild(vnode) {\r\n    return vnode.shapeFlag & 128 /* SUSPENSE */ ? vnode.ssContent : vnode;\r\n}\n\nfunction injectHook(type, hook, target = currentInstance, prepend = false) {\r\n    if (target) {\r\n        const hooks = target[type] || (target[type] = []);\r\n        // cache the error handling wrapper for injected hooks so the same hook\r\n        // can be properly deduped by the scheduler. \"__weh\" stands for \"with error\r\n        // handling\".\r\n        const wrappedHook = hook.__weh ||\r\n            (hook.__weh = (...args) => {\r\n                if (target.isUnmounted) {\r\n                    return;\r\n                }\r\n                // disable tracking inside all lifecycle hooks\r\n                // since they can potentially be called inside effects.\r\n                reactivity.pauseTracking();\r\n                // Set currentInstance during hook invocation.\r\n                // This assumes the hook does not synchronously trigger other hooks, which\r\n                // can only be false when the user does something really funky.\r\n                setCurrentInstance(target);\r\n                const res = callWithAsyncErrorHandling(hook, target, type, args);\r\n                setCurrentInstance(null);\r\n                reactivity.resetTracking();\r\n                return res;\r\n            });\r\n        if (prepend) {\r\n            hooks.unshift(wrappedHook);\r\n        }\r\n        else {\r\n            hooks.push(wrappedHook);\r\n        }\r\n        return wrappedHook;\r\n    }\r\n}\r\nconst createHook = (lifecycle) => (hook, target = currentInstance) => \r\n// post-create lifecycle registrations are noops during SSR (except for serverPrefetch)\r\n(!isInSSRComponentSetup || lifecycle === \"sp\" /* SERVER_PREFETCH */) &&\r\n    injectHook(lifecycle, hook, target);\r\nconst onBeforeMount = createHook(\"bm\" /* BEFORE_MOUNT */);\r\nconst onMounted = createHook(\"m\" /* MOUNTED */);\r\nconst onBeforeUpdate = createHook(\"bu\" /* BEFORE_UPDATE */);\r\nconst onUpdated = createHook(\"u\" /* UPDATED */);\r\nconst onBeforeUnmount = createHook(\"bum\" /* BEFORE_UNMOUNT */);\r\nconst onUnmounted = createHook(\"um\" /* UNMOUNTED */);\r\nconst onServerPrefetch = createHook(\"sp\" /* SERVER_PREFETCH */);\r\nconst onRenderTriggered = createHook(\"rtg\" /* RENDER_TRIGGERED */);\r\nconst onRenderTracked = createHook(\"rtc\" /* RENDER_TRACKED */);\r\nfunction onErrorCaptured(hook, target = currentInstance) {\r\n    injectHook(\"ec\" /* ERROR_CAPTURED */, hook, target);\r\n}\n\nlet shouldCacheAccess = true;\r\nfunction applyOptions(instance) {\r\n    const options = resolveMergedOptions(instance);\r\n    const publicThis = instance.proxy;\r\n    const ctx = instance.ctx;\r\n    // do not cache property access on public proxy during state initialization\r\n    shouldCacheAccess = false;\r\n    // call beforeCreate first before accessing other options since\r\n    // the hook may mutate resolved options (#2791)\r\n    if (options.beforeCreate) {\r\n        callHook(options.beforeCreate, instance, \"bc\" /* BEFORE_CREATE */);\r\n    }\r\n    const { \r\n    // state\r\n    data: dataOptions, computed: computedOptions, methods, watch: watchOptions, provide: provideOptions, inject: injectOptions, \r\n    // lifecycle\r\n    created, beforeMount, mounted, beforeUpdate, updated, activated, deactivated, beforeDestroy, beforeUnmount, destroyed, unmounted, render, renderTracked, renderTriggered, errorCaptured, serverPrefetch, \r\n    // public API\r\n    expose, inheritAttrs, \r\n    // assets\r\n    components, directives, filters } = options;\r\n    const checkDuplicateProperties = null;\r\n    // options initialization order (to be consistent with Vue 2):\r\n    // - props (already done outside of this function)\r\n    // - inject\r\n    // - methods\r\n    // - data (deferred since it relies on `this` access)\r\n    // - computed\r\n    // - watch (deferred since it relies on `this` access)\r\n    if (injectOptions) {\r\n        resolveInjections(injectOptions, ctx, checkDuplicateProperties);\r\n    }\r\n    if (methods) {\r\n        for (const key in methods) {\r\n            const methodHandler = methods[key];\r\n            if (shared.isFunction(methodHandler)) {\r\n                // In dev mode, we use the `createRenderContext` function to define methods to the proxy target,\r\n                // and those are read-only but reconfigurable, so it needs to be redefined here\r\n                {\r\n                    ctx[key] = methodHandler.bind(publicThis);\r\n                }\r\n            }\r\n        }\r\n    }\r\n    if (dataOptions) {\r\n        const data = dataOptions.call(publicThis, publicThis);\r\n        if (!shared.isObject(data)) ;\r\n        else {\r\n            instance.data = reactivity.reactive(data);\r\n        }\r\n    }\r\n    // state initialization complete at this point - start caching access\r\n    shouldCacheAccess = true;\r\n    if (computedOptions) {\r\n        for (const key in computedOptions) {\r\n            const opt = computedOptions[key];\r\n            const get = shared.isFunction(opt)\r\n                ? opt.bind(publicThis, publicThis)\r\n                : shared.isFunction(opt.get)\r\n                    ? opt.get.bind(publicThis, publicThis)\r\n                    : shared.NOOP;\r\n            const set = !shared.isFunction(opt) && shared.isFunction(opt.set)\r\n                ? opt.set.bind(publicThis)\r\n                : shared.NOOP;\r\n            const c = computed({\r\n                get,\r\n                set\r\n            });\r\n            Object.defineProperty(ctx, key, {\r\n                enumerable: true,\r\n                configurable: true,\r\n                get: () => c.value,\r\n                set: v => (c.value = v)\r\n            });\r\n        }\r\n    }\r\n    if (watchOptions) {\r\n        for (const key in watchOptions) {\r\n            createWatcher(watchOptions[key], ctx, publicThis, key);\r\n        }\r\n    }\r\n    if (provideOptions) {\r\n        const provides = shared.isFunction(provideOptions)\r\n            ? provideOptions.call(publicThis)\r\n            : provideOptions;\r\n        Reflect.ownKeys(provides).forEach(key => {\r\n            provide(key, provides[key]);\r\n        });\r\n    }\r\n    if (created) {\r\n        callHook(created, instance, \"c\" /* CREATED */);\r\n    }\r\n    function registerLifecycleHook(register, hook) {\r\n        if (shared.isArray(hook)) {\r\n            hook.forEach(_hook => register(_hook.bind(publicThis)));\r\n        }\r\n        else if (hook) {\r\n            register(hook.bind(publicThis));\r\n        }\r\n    }\r\n    registerLifecycleHook(onBeforeMount, beforeMount);\r\n    registerLifecycleHook(onMounted, mounted);\r\n    registerLifecycleHook(onBeforeUpdate, beforeUpdate);\r\n    registerLifecycleHook(onUpdated, updated);\r\n    registerLifecycleHook(onActivated, activated);\r\n    registerLifecycleHook(onDeactivated, deactivated);\r\n    registerLifecycleHook(onErrorCaptured, errorCaptured);\r\n    registerLifecycleHook(onRenderTracked, renderTracked);\r\n    registerLifecycleHook(onRenderTriggered, renderTriggered);\r\n    registerLifecycleHook(onBeforeUnmount, beforeUnmount);\r\n    registerLifecycleHook(onUnmounted, unmounted);\r\n    registerLifecycleHook(onServerPrefetch, serverPrefetch);\r\n    if (shared.isArray(expose)) {\r\n        if (expose.length) {\r\n            const exposed = instance.exposed || (instance.exposed = reactivity.proxyRefs({}));\r\n            expose.forEach(key => {\r\n                exposed[key] = reactivity.toRef(publicThis, key);\r\n            });\r\n        }\r\n        else if (!instance.exposed) {\r\n            instance.exposed = shared.EMPTY_OBJ;\r\n        }\r\n    }\r\n    // options that are handled when creating the instance but also need to be\r\n    // applied from mixins\r\n    if (render && instance.render === shared.NOOP) {\r\n        instance.render = render;\r\n    }\r\n    if (inheritAttrs != null) {\r\n        instance.inheritAttrs = inheritAttrs;\r\n    }\r\n    // asset options.\r\n    if (components)\r\n        instance.components = components;\r\n    if (directives)\r\n        instance.directives = directives;\r\n}\r\nfunction resolveInjections(injectOptions, ctx, checkDuplicateProperties = shared.NOOP) {\r\n    if (shared.isArray(injectOptions)) {\r\n        injectOptions = normalizeInject(injectOptions);\r\n    }\r\n    for (const key in injectOptions) {\r\n        const opt = injectOptions[key];\r\n        if (shared.isObject(opt)) {\r\n            if ('default' in opt) {\r\n                ctx[key] = inject(opt.from || key, opt.default, true /* treat default function as factory */);\r\n            }\r\n            else {\r\n                ctx[key] = inject(opt.from || key);\r\n            }\r\n        }\r\n        else {\r\n            ctx[key] = inject(opt);\r\n        }\r\n    }\r\n}\r\nfunction callHook(hook, instance, type) {\r\n    callWithAsyncErrorHandling(shared.isArray(hook)\r\n        ? hook.map(h => h.bind(instance.proxy))\r\n        : hook.bind(instance.proxy), instance, type);\r\n}\r\nfunction createWatcher(raw, ctx, publicThis, key) {\r\n    const getter = key.includes('.')\r\n        ? createPathGetter(publicThis, key)\r\n        : () => publicThis[key];\r\n    if (shared.isString(raw)) {\r\n        const handler = ctx[raw];\r\n        if (shared.isFunction(handler)) {\r\n            watch(getter, handler);\r\n        }\r\n    }\r\n    else if (shared.isFunction(raw)) {\r\n        watch(getter, raw.bind(publicThis));\r\n    }\r\n    else if (shared.isObject(raw)) {\r\n        if (shared.isArray(raw)) {\r\n            raw.forEach(r => createWatcher(r, ctx, publicThis, key));\r\n        }\r\n        else {\r\n            const handler = shared.isFunction(raw.handler)\r\n                ? raw.handler.bind(publicThis)\r\n                : ctx[raw.handler];\r\n            if (shared.isFunction(handler)) {\r\n                watch(getter, handler, raw);\r\n            }\r\n        }\r\n    }\r\n    else ;\r\n}\r\n/**\r\n * Resolve merged options and cache it on the component.\r\n * This is done only once per-component since the merging does not involve\r\n * instances.\r\n */\r\nfunction resolveMergedOptions(instance) {\r\n    const base = instance.type;\r\n    const { mixins, extends: extendsOptions } = base;\r\n    const { mixins: globalMixins, optionsCache: cache, config: { optionMergeStrategies } } = instance.appContext;\r\n    const cached = cache.get(base);\r\n    let resolved;\r\n    if (cached) {\r\n        resolved = cached;\r\n    }\r\n    else if (!globalMixins.length && !mixins && !extendsOptions) {\r\n        {\r\n            resolved = base;\r\n        }\r\n    }\r\n    else {\r\n        resolved = {};\r\n        if (globalMixins.length) {\r\n            globalMixins.forEach(m => mergeOptions(resolved, m, optionMergeStrategies, true));\r\n        }\r\n        mergeOptions(resolved, base, optionMergeStrategies);\r\n    }\r\n    cache.set(base, resolved);\r\n    return resolved;\r\n}\r\nfunction mergeOptions(to, from, strats, asMixin = false) {\r\n    const { mixins, extends: extendsOptions } = from;\r\n    if (extendsOptions) {\r\n        mergeOptions(to, extendsOptions, strats, true);\r\n    }\r\n    if (mixins) {\r\n        mixins.forEach((m) => mergeOptions(to, m, strats, true));\r\n    }\r\n    for (const key in from) {\r\n        if (asMixin && key === 'expose') ;\r\n        else {\r\n            const strat = internalOptionMergeStrats[key] || (strats && strats[key]);\r\n            to[key] = strat ? strat(to[key], from[key]) : from[key];\r\n        }\r\n    }\r\n    return to;\r\n}\r\nconst internalOptionMergeStrats = {\r\n    data: mergeDataFn,\r\n    props: mergeObjectOptions,\r\n    emits: mergeObjectOptions,\r\n    // objects\r\n    methods: mergeObjectOptions,\r\n    computed: mergeObjectOptions,\r\n    // lifecycle\r\n    beforeCreate: mergeHook,\r\n    created: mergeHook,\r\n    beforeMount: mergeHook,\r\n    mounted: mergeHook,\r\n    beforeUpdate: mergeHook,\r\n    updated: mergeHook,\r\n    beforeDestroy: mergeHook,\r\n    destroyed: mergeHook,\r\n    activated: mergeHook,\r\n    deactivated: mergeHook,\r\n    errorCaptured: mergeHook,\r\n    serverPrefetch: mergeHook,\r\n    // assets\r\n    components: mergeObjectOptions,\r\n    directives: mergeObjectOptions,\r\n    // watch has special merge behavior in v2, but isn't actually needed in v3.\r\n    // since we are only exposing these for compat and nobody should be relying\r\n    // on the watch-specific behavior, just expose the object merge strat.\r\n    watch: mergeObjectOptions,\r\n    // provide / inject\r\n    provide: mergeDataFn,\r\n    inject: mergeInject\r\n};\r\nfunction mergeDataFn(to, from) {\r\n    if (!from) {\r\n        return to;\r\n    }\r\n    if (!to) {\r\n        return from;\r\n    }\r\n    return function mergedDataFn() {\r\n        return (shared.extend)(shared.isFunction(to) ? to.call(this, this) : to, shared.isFunction(from) ? from.call(this, this) : from);\r\n    };\r\n}\r\nfunction mergeInject(to, from) {\r\n    return mergeObjectOptions(normalizeInject(to), normalizeInject(from));\r\n}\r\nfunction normalizeInject(raw) {\r\n    if (shared.isArray(raw)) {\r\n        const res = {};\r\n        for (let i = 0; i < raw.length; i++) {\r\n            res[raw[i]] = raw[i];\r\n        }\r\n        return res;\r\n    }\r\n    return raw;\r\n}\r\nfunction mergeHook(to, from) {\r\n    return to ? [...new Set([].concat(to, from))] : from;\r\n}\r\nfunction mergeObjectOptions(to, from) {\r\n    return to ? shared.extend(shared.extend(Object.create(null), to), from) : from;\r\n}\n\nfunction initProps(instance, rawProps, isStateful, // result of bitwise flag comparison\r\nisSSR = false) {\r\n    const props = {};\r\n    const attrs = {};\r\n    shared.def(attrs, InternalObjectKey, 1);\r\n    instance.propsDefaults = Object.create(null);\r\n    setFullProps(instance, rawProps, props, attrs);\r\n    // ensure all declared prop keys are present\r\n    for (const key in instance.propsOptions[0]) {\r\n        if (!(key in props)) {\r\n            props[key] = undefined;\r\n        }\r\n    }\r\n    if (isStateful) {\r\n        // stateful\r\n        instance.props = isSSR ? props : reactivity.shallowReactive(props);\r\n    }\r\n    else {\r\n        if (!instance.type.props) {\r\n            // functional w/ optional props, props === attrs\r\n            instance.props = attrs;\r\n        }\r\n        else {\r\n            // functional w/ declared props\r\n            instance.props = props;\r\n        }\r\n    }\r\n    instance.attrs = attrs;\r\n}\r\nfunction updateProps(instance, rawProps, rawPrevProps, optimized) {\r\n    const { props, attrs, vnode: { patchFlag } } = instance;\r\n    const rawCurrentProps = reactivity.toRaw(props);\r\n    const [options] = instance.propsOptions;\r\n    let hasAttrsChanged = false;\r\n    if (\r\n    // always force full diff in dev\r\n    // - #1942 if hmr is enabled with sfc component\r\n    // - vite#872 non-sfc component used by sfc component\r\n    (optimized || patchFlag > 0) &&\r\n        !(patchFlag & 16 /* FULL_PROPS */)) {\r\n        if (patchFlag & 8 /* PROPS */) {\r\n            // Compiler-generated props & no keys change, just set the updated\r\n            // the props.\r\n            const propsToUpdate = instance.vnode.dynamicProps;\r\n            for (let i = 0; i < propsToUpdate.length; i++) {\r\n                let key = propsToUpdate[i];\r\n                // PROPS flag guarantees rawProps to be non-null\r\n                const value = rawProps[key];\r\n                if (options) {\r\n                    // attr / props separation was done on init and will be consistent\r\n                    // in this code path, so just check if attrs have it.\r\n                    if (shared.hasOwn(attrs, key)) {\r\n                        if (value !== attrs[key]) {\r\n                            attrs[key] = value;\r\n                            hasAttrsChanged = true;\r\n                        }\r\n                    }\r\n                    else {\r\n                        const camelizedKey = shared.camelize(key);\r\n                        props[camelizedKey] = resolvePropValue(options, rawCurrentProps, camelizedKey, value, instance, false /* isAbsent */);\r\n                    }\r\n                }\r\n                else {\r\n                    if (value !== attrs[key]) {\r\n                        attrs[key] = value;\r\n                        hasAttrsChanged = true;\r\n                    }\r\n                }\r\n            }\r\n        }\r\n    }\r\n    else {\r\n        // full props update.\r\n        if (setFullProps(instance, rawProps, props, attrs)) {\r\n            hasAttrsChanged = true;\r\n        }\r\n        // in case of dynamic props, check if we need to delete keys from\r\n        // the props object\r\n        let kebabKey;\r\n        for (const key in rawCurrentProps) {\r\n            if (!rawProps ||\r\n                // for camelCase\r\n                (!shared.hasOwn(rawProps, key) &&\r\n                    // it's possible the original props was passed in as kebab-case\r\n                    // and converted to camelCase (#955)\r\n                    ((kebabKey = shared.hyphenate(key)) === key || !shared.hasOwn(rawProps, kebabKey)))) {\r\n                if (options) {\r\n                    if (rawPrevProps &&\r\n                        // for camelCase\r\n                        (rawPrevProps[key] !== undefined ||\r\n                            // for kebab-case\r\n                            rawPrevProps[kebabKey] !== undefined)) {\r\n                        props[key] = resolvePropValue(options, rawCurrentProps, key, undefined, instance, true /* isAbsent */);\r\n                    }\r\n                }\r\n                else {\r\n                    delete props[key];\r\n                }\r\n            }\r\n        }\r\n        // in the case of functional component w/o props declaration, props and\r\n        // attrs point to the same object so it should already have been updated.\r\n        if (attrs !== rawCurrentProps) {\r\n            for (const key in attrs) {\r\n                if (!rawProps || !shared.hasOwn(rawProps, key)) {\r\n                    delete attrs[key];\r\n                    hasAttrsChanged = true;\r\n                }\r\n            }\r\n        }\r\n    }\r\n    // trigger updates for $attrs in case it's used in component slots\r\n    if (hasAttrsChanged) {\r\n        reactivity.trigger(instance, \"set\" /* SET */, '$attrs');\r\n    }\r\n}\r\nfunction setFullProps(instance, rawProps, props, attrs) {\r\n    const [options, needCastKeys] = instance.propsOptions;\r\n    let hasAttrsChanged = false;\r\n    let rawCastValues;\r\n    if (rawProps) {\r\n        for (let key in rawProps) {\r\n            // key, ref are reserved and never passed down\r\n            if (shared.isReservedProp(key)) {\r\n                continue;\r\n            }\r\n            const value = rawProps[key];\r\n            // prop option names are camelized during normalization, so to support\r\n            // kebab -> camel conversion here we need to camelize the key.\r\n            let camelKey;\r\n            if (options && shared.hasOwn(options, (camelKey = shared.camelize(key)))) {\r\n                if (!needCastKeys || !needCastKeys.includes(camelKey)) {\r\n                    props[camelKey] = value;\r\n                }\r\n                else {\r\n                    (rawCastValues || (rawCastValues = {}))[camelKey] = value;\r\n                }\r\n            }\r\n            else if (!isEmitListener(instance.emitsOptions, key)) {\r\n                if (value !== attrs[key]) {\r\n                    attrs[key] = value;\r\n                    hasAttrsChanged = true;\r\n                }\r\n            }\r\n        }\r\n    }\r\n    if (needCastKeys) {\r\n        const rawCurrentProps = reactivity.toRaw(props);\r\n        const castValues = rawCastValues || shared.EMPTY_OBJ;\r\n        for (let i = 0; i < needCastKeys.length; i++) {\r\n            const key = needCastKeys[i];\r\n            props[key] = resolvePropValue(options, rawCurrentProps, key, castValues[key], instance, !shared.hasOwn(castValues, key));\r\n        }\r\n    }\r\n    return hasAttrsChanged;\r\n}\r\nfunction resolvePropValue(options, props, key, value, instance, isAbsent) {\r\n    const opt = options[key];\r\n    if (opt != null) {\r\n        const hasDefault = shared.hasOwn(opt, 'default');\r\n        // default values\r\n        if (hasDefault && value === undefined) {\r\n            const defaultValue = opt.default;\r\n            if (opt.type !== Function && shared.isFunction(defaultValue)) {\r\n                const { propsDefaults } = instance;\r\n                if (key in propsDefaults) {\r\n                    value = propsDefaults[key];\r\n                }\r\n                else {\r\n                    setCurrentInstance(instance);\r\n                    value = propsDefaults[key] = defaultValue.call(null, props);\r\n                    setCurrentInstance(null);\r\n                }\r\n            }\r\n            else {\r\n                value = defaultValue;\r\n            }\r\n        }\r\n        // boolean casting\r\n        if (opt[0 /* shouldCast */]) {\r\n            if (isAbsent && !hasDefault) {\r\n                value = false;\r\n            }\r\n            else if (opt[1 /* shouldCastTrue */] &&\r\n                (value === '' || value === shared.hyphenate(key))) {\r\n                value = true;\r\n            }\r\n        }\r\n    }\r\n    return value;\r\n}\r\nfunction normalizePropsOptions(comp, appContext, asMixin = false) {\r\n    const cache = appContext.propsCache;\r\n    const cached = cache.get(comp);\r\n    if (cached) {\r\n        return cached;\r\n    }\r\n    const raw = comp.props;\r\n    const normalized = {};\r\n    const needCastKeys = [];\r\n    // apply mixin/extends props\r\n    let hasExtends = false;\r\n    if (!shared.isFunction(comp)) {\r\n        const extendProps = (raw) => {\r\n            hasExtends = true;\r\n            const [props, keys] = normalizePropsOptions(raw, appContext, true);\r\n            shared.extend(normalized, props);\r\n            if (keys)\r\n                needCastKeys.push(...keys);\r\n        };\r\n        if (!asMixin && appContext.mixins.length) {\r\n            appContext.mixins.forEach(extendProps);\r\n        }\r\n        if (comp.extends) {\r\n            extendProps(comp.extends);\r\n        }\r\n        if (comp.mixins) {\r\n            comp.mixins.forEach(extendProps);\r\n        }\r\n    }\r\n    if (!raw && !hasExtends) {\r\n        cache.set(comp, shared.EMPTY_ARR);\r\n        return shared.EMPTY_ARR;\r\n    }\r\n    if (shared.isArray(raw)) {\r\n        for (let i = 0; i < raw.length; i++) {\r\n            const normalizedKey = shared.camelize(raw[i]);\r\n            if (validatePropName(normalizedKey)) {\r\n                normalized[normalizedKey] = shared.EMPTY_OBJ;\r\n            }\r\n        }\r\n    }\r\n    else if (raw) {\r\n        for (const key in raw) {\r\n            const normalizedKey = shared.camelize(key);\r\n            if (validatePropName(normalizedKey)) {\r\n                const opt = raw[key];\r\n                const prop = (normalized[normalizedKey] =\r\n                    shared.isArray(opt) || shared.isFunction(opt) ? { type: opt } : opt);\r\n                if (prop) {\r\n                    const booleanIndex = getTypeIndex(Boolean, prop.type);\r\n                    const stringIndex = getTypeIndex(String, prop.type);\r\n                    prop[0 /* shouldCast */] = booleanIndex > -1;\r\n                    prop[1 /* shouldCastTrue */] =\r\n                        stringIndex < 0 || booleanIndex < stringIndex;\r\n                    // if the prop needs boolean casting or default value\r\n                    if (booleanIndex > -1 || shared.hasOwn(prop, 'default')) {\r\n                        needCastKeys.push(normalizedKey);\r\n                    }\r\n                }\r\n            }\r\n        }\r\n    }\r\n    const res = [normalized, needCastKeys];\r\n    cache.set(comp, res);\r\n    return res;\r\n}\r\nfunction validatePropName(key) {\r\n    if (key[0] !== '$') {\r\n        return true;\r\n    }\r\n    return false;\r\n}\r\n// use function string name to check type constructors\r\n// so that it works across vms / iframes.\r\nfunction getType(ctor) {\r\n    const match = ctor && ctor.toString().match(/^\\s*function (\\w+)/);\r\n    return match ? match[1] : '';\r\n}\r\nfunction isSameType(a, b) {\r\n    return getType(a) === getType(b);\r\n}\r\nfunction getTypeIndex(type, expectedTypes) {\r\n    if (shared.isArray(expectedTypes)) {\r\n        return expectedTypes.findIndex(t => isSameType(t, type));\r\n    }\r\n    else if (shared.isFunction(expectedTypes)) {\r\n        return isSameType(expectedTypes, type) ? 0 : -1;\r\n    }\r\n    return -1;\r\n}\n\nconst isInternalKey = (key) => key[0] === '_' || key === '$stable';\r\nconst normalizeSlotValue = (value) => shared.isArray(value)\r\n    ? value.map(normalizeVNode)\r\n    : [normalizeVNode(value)];\r\nconst normalizeSlot = (key, rawSlot, ctx) => {\r\n    const normalized = withCtx((props) => {\r\n        return normalizeSlotValue(rawSlot(props));\r\n    }, ctx);\r\n    normalized._c = false;\r\n    return normalized;\r\n};\r\nconst normalizeObjectSlots = (rawSlots, slots, instance) => {\r\n    const ctx = rawSlots._ctx;\r\n    for (const key in rawSlots) {\r\n        if (isInternalKey(key))\r\n            continue;\r\n        const value = rawSlots[key];\r\n        if (shared.isFunction(value)) {\r\n            slots[key] = normalizeSlot(key, value, ctx);\r\n        }\r\n        else if (value != null) {\r\n            const normalized = normalizeSlotValue(value);\r\n            slots[key] = () => normalized;\r\n        }\r\n    }\r\n};\r\nconst normalizeVNodeSlots = (instance, children) => {\r\n    const normalized = normalizeSlotValue(children);\r\n    instance.slots.default = () => normalized;\r\n};\r\nconst initSlots = (instance, children) => {\r\n    if (instance.vnode.shapeFlag & 32 /* SLOTS_CHILDREN */) {\r\n        const type = children._;\r\n        if (type) {\r\n            // users can get the shallow readonly version of the slots object through `this.$slots`,\r\n            // we should avoid the proxy object polluting the slots of the internal instance\r\n            instance.slots = reactivity.toRaw(children);\r\n            // make compiler marker non-enumerable\r\n            shared.def(children, '_', type);\r\n        }\r\n        else {\r\n            normalizeObjectSlots(children, (instance.slots = {}));\r\n        }\r\n    }\r\n    else {\r\n        instance.slots = {};\r\n        if (children) {\r\n            normalizeVNodeSlots(instance, children);\r\n        }\r\n    }\r\n    shared.def(instance.slots, InternalObjectKey, 1);\r\n};\r\nconst updateSlots = (instance, children, optimized) => {\r\n    const { vnode, slots } = instance;\r\n    let needDeletionCheck = true;\r\n    let deletionComparisonTarget = shared.EMPTY_OBJ;\r\n    if (vnode.shapeFlag & 32 /* SLOTS_CHILDREN */) {\r\n        const type = children._;\r\n        if (type) {\r\n            // compiled slots.\r\n            if (optimized && type === 1 /* STABLE */) {\r\n                // compiled AND stable.\r\n                // no need to update, and skip stale slots removal.\r\n                needDeletionCheck = false;\r\n            }\r\n            else {\r\n                // compiled but dynamic (v-if/v-for on slots) - update slots, but skip\r\n                // normalization.\r\n                shared.extend(slots, children);\r\n                // #2893\r\n                // when rendering the optimized slots by manually written render function,\r\n                // we need to delete the `slots._` flag if necessary to make subsequent updates reliable,\r\n                // i.e. let the `renderSlot` create the bailed Fragment\r\n                if (!optimized && type === 1 /* STABLE */) {\r\n                    delete slots._;\r\n                }\r\n            }\r\n        }\r\n        else {\r\n            needDeletionCheck = !children.$stable;\r\n            normalizeObjectSlots(children, slots);\r\n        }\r\n        deletionComparisonTarget = children;\r\n    }\r\n    else if (children) {\r\n        // non slot object children (direct value) passed to a component\r\n        normalizeVNodeSlots(instance, children);\r\n        deletionComparisonTarget = { default: 1 };\r\n    }\r\n    // delete stale slots\r\n    if (needDeletionCheck) {\r\n        for (const key in slots) {\r\n            if (!isInternalKey(key) && !(key in deletionComparisonTarget)) {\r\n                delete slots[key];\r\n            }\r\n        }\r\n    }\r\n};\n\n/**\r\nRuntime helper for applying directives to a vnode. Example usage:\r\n\nconst comp = resolveComponent('comp')\r\nconst foo = resolveDirective('foo')\r\nconst bar = resolveDirective('bar')\r\n\nreturn withDirectives(h(comp), [\r\n  [foo, this.x],\r\n  [bar, this.y]\r\n])\r\n*/\r\n/**\r\n * Adds directives to a VNode.\r\n */\r\nfunction withDirectives(vnode, directives) {\r\n    const internalInstance = currentRenderingInstance;\r\n    if (internalInstance === null) {\r\n        return vnode;\r\n    }\r\n    const instance = internalInstance.proxy;\r\n    const bindings = vnode.dirs || (vnode.dirs = []);\r\n    for (let i = 0; i < directives.length; i++) {\r\n        let [dir, value, arg, modifiers = shared.EMPTY_OBJ] = directives[i];\r\n        if (shared.isFunction(dir)) {\r\n            dir = {\r\n                mounted: dir,\r\n                updated: dir\r\n            };\r\n        }\r\n        bindings.push({\r\n            dir,\r\n            instance,\r\n            value,\r\n            oldValue: void 0,\r\n            arg,\r\n            modifiers\r\n        });\r\n    }\r\n    return vnode;\r\n}\r\nfunction invokeDirectiveHook(vnode, prevVNode, instance, name) {\r\n    const bindings = vnode.dirs;\r\n    const oldBindings = prevVNode && prevVNode.dirs;\r\n    for (let i = 0; i < bindings.length; i++) {\r\n        const binding = bindings[i];\r\n        if (oldBindings) {\r\n            binding.oldValue = oldBindings[i].value;\r\n        }\r\n        let hook = binding.dir[name];\r\n        if (hook) {\r\n            // disable tracking inside all lifecycle hooks\r\n            // since they can potentially be called inside effects.\r\n            reactivity.pauseTracking();\r\n            callWithAsyncErrorHandling(hook, instance, 8 /* DIRECTIVE_HOOK */, [\r\n                vnode.el,\r\n                binding,\r\n                vnode,\r\n                prevVNode\r\n            ]);\r\n            reactivity.resetTracking();\r\n        }\r\n    }\r\n}\n\nfunction createAppContext() {\r\n    return {\r\n        app: null,\r\n        config: {\r\n            isNativeTag: shared.NO,\r\n            performance: false,\r\n            globalProperties: {},\r\n            optionMergeStrategies: {},\r\n            errorHandler: undefined,\r\n            warnHandler: undefined,\r\n            compilerOptions: {}\r\n        },\r\n        mixins: [],\r\n        components: {},\r\n        directives: {},\r\n        provides: Object.create(null),\r\n        optionsCache: new WeakMap(),\r\n        propsCache: new WeakMap(),\r\n        emitsCache: new WeakMap()\r\n    };\r\n}\r\nlet uid = 0;\r\nfunction createAppAPI(render, hydrate) {\r\n    return function createApp(rootComponent, rootProps = null) {\r\n        if (rootProps != null && !shared.isObject(rootProps)) {\r\n            rootProps = null;\r\n        }\r\n        const context = createAppContext();\r\n        const installedPlugins = new Set();\r\n        let isMounted = false;\r\n        const app = (context.app = {\r\n            _uid: uid++,\r\n            _component: rootComponent,\r\n            _props: rootProps,\r\n            _container: null,\r\n            _context: context,\r\n            version,\r\n            get config() {\r\n                return context.config;\r\n            },\r\n            set config(v) {\r\n            },\r\n            use(plugin, ...options) {\r\n                if (installedPlugins.has(plugin)) ;\r\n                else if (plugin && shared.isFunction(plugin.install)) {\r\n                    installedPlugins.add(plugin);\r\n                    plugin.install(app, ...options);\r\n                }\r\n                else if (shared.isFunction(plugin)) {\r\n                    installedPlugins.add(plugin);\r\n                    plugin(app, ...options);\r\n                }\r\n                else ;\r\n                return app;\r\n            },\r\n            mixin(mixin) {\r\n                {\r\n                    if (!context.mixins.includes(mixin)) {\r\n                        context.mixins.push(mixin);\r\n                    }\r\n                }\r\n                return app;\r\n            },\r\n            component(name, component) {\r\n                if (!component) {\r\n                    return context.components[name];\r\n                }\r\n                context.components[name] = component;\r\n                return app;\r\n            },\r\n            directive(name, directive) {\r\n                if (!directive) {\r\n                    return context.directives[name];\r\n                }\r\n                context.directives[name] = directive;\r\n                return app;\r\n            },\r\n            mount(rootContainer, isHydrate, isSVG) {\r\n                if (!isMounted) {\r\n                    const vnode = createVNode(rootComponent, rootProps);\r\n                    // store app context on the root VNode.\r\n                    // this will be set on the root instance on initial mount.\r\n                    vnode.appContext = context;\r\n                    if (isHydrate && hydrate) {\r\n                        hydrate(vnode, rootContainer);\r\n                    }\r\n                    else {\r\n                        render(vnode, rootContainer, isSVG);\r\n                    }\r\n                    isMounted = true;\r\n                    app._container = rootContainer;\r\n                    rootContainer.__vue_app__ = app;\r\n                    return vnode.component.proxy;\r\n                }\r\n            },\r\n            unmount() {\r\n                if (isMounted) {\r\n                    render(null, app._container);\r\n                    delete app._container.__vue_app__;\r\n                }\r\n            },\r\n            provide(key, value) {\r\n                // TypeScript doesn't allow symbols as index type\r\n                // https://github.com/Microsoft/TypeScript/issues/24587\r\n                context.provides[key] = value;\r\n                return app;\r\n            }\r\n        });\r\n        return app;\r\n    };\r\n}\n\nlet hasMismatch = false;\r\nconst isSVGContainer = (container) => /svg/.test(container.namespaceURI) && container.tagName !== 'foreignObject';\r\nconst isComment = (node) => node.nodeType === 8 /* COMMENT */;\r\n// Note: hydration is DOM-specific\r\n// But we have to place it in core due to tight coupling with core - splitting\r\n// it out creates a ton of unnecessary complexity.\r\n// Hydration also depends on some renderer internal logic which needs to be\r\n// passed in via arguments.\r\nfunction createHydrationFunctions(rendererInternals) {\r\n    const { mt: mountComponent, p: patch, o: { patchProp, nextSibling, parentNode, remove, insert, createComment } } = rendererInternals;\r\n    const hydrate = (vnode, container) => {\r\n        hasMismatch = false;\r\n        hydrateNode(container.firstChild, vnode, null, null, null);\r\n        flushPostFlushCbs();\r\n        if (hasMismatch && !false) {\r\n            // this error should show up in production\r\n            console.error(`Hydration completed but contains mismatches.`);\r\n        }\r\n    };\r\n    const hydrateNode = (node, vnode, parentComponent, parentSuspense, slotScopeIds, optimized = false) => {\r\n        const isFragmentStart = isComment(node) && node.data === '[';\r\n        const onMismatch = () => handleMismatch(node, vnode, parentComponent, parentSuspense, slotScopeIds, isFragmentStart);\r\n        const { type, ref, shapeFlag } = vnode;\r\n        const domType = node.nodeType;\r\n        vnode.el = node;\r\n        let nextNode = null;\r\n        switch (type) {\r\n            case Text:\r\n                if (domType !== 3 /* TEXT */) {\r\n                    nextNode = onMismatch();\r\n                }\r\n                else {\r\n                    if (node.data !== vnode.children) {\r\n                        hasMismatch = true;\r\n                        node.data = vnode.children;\r\n                    }\r\n                    nextNode = nextSibling(node);\r\n                }\r\n                break;\r\n            case Comment$1:\r\n                if (domType !== 8 /* COMMENT */ || isFragmentStart) {\r\n                    nextNode = onMismatch();\r\n                }\r\n                else {\r\n                    nextNode = nextSibling(node);\r\n                }\r\n                break;\r\n            case Static:\r\n                if (domType !== 1 /* ELEMENT */) {\r\n                    nextNode = onMismatch();\r\n                }\r\n                else {\r\n                    // determine anchor, adopt content\r\n                    nextNode = node;\r\n                    // if the static vnode has its content stripped during build,\r\n                    // adopt it from the server-rendered HTML.\r\n                    const needToAdoptContent = !vnode.children.length;\r\n                    for (let i = 0; i < vnode.staticCount; i++) {\r\n                        if (needToAdoptContent)\r\n                            vnode.children += nextNode.outerHTML;\r\n                        if (i === vnode.staticCount - 1) {\r\n                            vnode.anchor = nextNode;\r\n                        }\r\n                        nextNode = nextSibling(nextNode);\r\n                    }\r\n                    return nextNode;\r\n                }\r\n                break;\r\n            case Fragment:\r\n                if (!isFragmentStart) {\r\n                    nextNode = onMismatch();\r\n                }\r\n                else {\r\n                    nextNode = hydrateFragment(node, vnode, parentComponent, parentSuspense, slotScopeIds, optimized);\r\n                }\r\n                break;\r\n            default:\r\n                if (shapeFlag & 1 /* ELEMENT */) {\r\n                    if (domType !== 1 /* ELEMENT */ ||\r\n                        vnode.type.toLowerCase() !==\r\n                            node.tagName.toLowerCase()) {\r\n                        nextNode = onMismatch();\r\n                    }\r\n                    else {\r\n                        nextNode = hydrateElement(node, vnode, parentComponent, parentSuspense, slotScopeIds, optimized);\r\n                    }\r\n                }\r\n                else if (shapeFlag & 6 /* COMPONENT */) {\r\n                    // when setting up the render effect, if the initial vnode already\r\n                    // has .el set, the component will perform hydration instead of mount\r\n                    // on its sub-tree.\r\n                    vnode.slotScopeIds = slotScopeIds;\r\n                    const container = parentNode(node);\r\n                    mountComponent(vnode, container, null, parentComponent, parentSuspense, isSVGContainer(container), optimized);\r\n                    // component may be async, so in the case of fragments we cannot rely\r\n                    // on component's rendered output to determine the end of the fragment\r\n                    // instead, we do a lookahead to find the end anchor node.\r\n                    nextNode = isFragmentStart\r\n                        ? locateClosingAsyncAnchor(node)\r\n                        : nextSibling(node);\r\n                    // #3787\r\n                    // if component is async, it may get moved / unmounted before its\r\n                    // inner component is loaded, so we need to give it a placeholder\r\n                    // vnode that matches its adopted DOM.\r\n                    if (isAsyncWrapper(vnode)) {\r\n                        let subTree;\r\n                        if (isFragmentStart) {\r\n                            subTree = createVNode(Fragment);\r\n                            subTree.anchor = nextNode\r\n                                ? nextNode.previousSibling\r\n                                : container.lastChild;\r\n                        }\r\n                        else {\r\n                            subTree =\r\n                                node.nodeType === 3 ? createTextVNode('') : createVNode('div');\r\n                        }\r\n                        subTree.el = node;\r\n                        vnode.component.subTree = subTree;\r\n                    }\r\n                }\r\n                else if (shapeFlag & 64 /* TELEPORT */) {\r\n                    if (domType !== 8 /* COMMENT */) {\r\n                        nextNode = onMismatch();\r\n                    }\r\n                    else {\r\n                        nextNode = vnode.type.hydrate(node, vnode, parentComponent, parentSuspense, slotScopeIds, optimized, rendererInternals, hydrateChildren);\r\n                    }\r\n                }\r\n                else if (shapeFlag & 128 /* SUSPENSE */) {\r\n                    nextNode = vnode.type.hydrate(node, vnode, parentComponent, parentSuspense, isSVGContainer(parentNode(node)), slotScopeIds, optimized, rendererInternals, hydrateNode);\r\n                }\r\n                else ;\r\n        }\r\n        if (ref != null) {\r\n            setRef(ref, null, parentSuspense, vnode);\r\n        }\r\n        return nextNode;\r\n    };\r\n    const hydrateElement = (el, vnode, parentComponent, parentSuspense, slotScopeIds, optimized) => {\r\n        optimized = optimized || !!vnode.dynamicChildren;\r\n        const { props, patchFlag, shapeFlag, dirs } = vnode;\r\n        // skip props & children if this is hoisted static nodes\r\n        if (patchFlag !== -1 /* HOISTED */) {\r\n            if (dirs) {\r\n                invokeDirectiveHook(vnode, null, parentComponent, 'created');\r\n            }\r\n            // props\r\n            if (props) {\r\n                if (!optimized ||\r\n                    (patchFlag & 16 /* FULL_PROPS */ ||\r\n                        patchFlag & 32 /* HYDRATE_EVENTS */)) {\r\n                    for (const key in props) {\r\n                        if (!shared.isReservedProp(key) && shared.isOn(key)) {\r\n                            patchProp(el, key, null, props[key]);\r\n                        }\r\n                    }\r\n                }\r\n                else if (props.onClick) {\r\n                    // Fast path for click listeners (which is most often) to avoid\r\n                    // iterating through props.\r\n                    patchProp(el, 'onClick', null, props.onClick);\r\n                }\r\n            }\r\n            // vnode / directive hooks\r\n            let vnodeHooks;\r\n            if ((vnodeHooks = props && props.onVnodeBeforeMount)) {\r\n                invokeVNodeHook(vnodeHooks, parentComponent, vnode);\r\n            }\r\n            if (dirs) {\r\n                invokeDirectiveHook(vnode, null, parentComponent, 'beforeMount');\r\n            }\r\n            if ((vnodeHooks = props && props.onVnodeMounted) || dirs) {\r\n                queueEffectWithSuspense(() => {\r\n                    vnodeHooks && invokeVNodeHook(vnodeHooks, parentComponent, vnode);\r\n                    dirs && invokeDirectiveHook(vnode, null, parentComponent, 'mounted');\r\n                }, parentSuspense);\r\n            }\r\n            // children\r\n            if (shapeFlag & 16 /* ARRAY_CHILDREN */ &&\r\n                // skip if element has innerHTML / textContent\r\n                !(props && (props.innerHTML || props.textContent))) {\r\n                let next = hydrateChildren(el.firstChild, vnode, el, parentComponent, parentSuspense, slotScopeIds, optimized);\r\n                while (next) {\r\n                    hasMismatch = true;\r\n                    // The SSRed DOM contains more nodes than it should. Remove them.\r\n                    const cur = next;\r\n                    next = next.nextSibling;\r\n                    remove(cur);\r\n                }\r\n            }\r\n            else if (shapeFlag & 8 /* TEXT_CHILDREN */) {\r\n                if (el.textContent !== vnode.children) {\r\n                    hasMismatch = true;\r\n                    el.textContent = vnode.children;\r\n                }\r\n            }\r\n        }\r\n        return el.nextSibling;\r\n    };\r\n    const hydrateChildren = (node, parentVNode, container, parentComponent, parentSuspense, slotScopeIds, optimized) => {\r\n        optimized = optimized || !!parentVNode.dynamicChildren;\r\n        const children = parentVNode.children;\r\n        const l = children.length;\r\n        for (let i = 0; i < l; i++) {\r\n            const vnode = optimized\r\n                ? children[i]\r\n                : (children[i] = normalizeVNode(children[i]));\r\n            if (node) {\r\n                node = hydrateNode(node, vnode, parentComponent, parentSuspense, slotScopeIds, optimized);\r\n            }\r\n            else if (vnode.type === Text && !vnode.children) {\r\n                continue;\r\n            }\r\n            else {\r\n                hasMismatch = true;\r\n                // the SSRed DOM didn't contain enough nodes. Mount the missing ones.\r\n                patch(null, vnode, container, null, parentComponent, parentSuspense, isSVGContainer(container), slotScopeIds);\r\n            }\r\n        }\r\n        return node;\r\n    };\r\n    const hydrateFragment = (node, vnode, parentComponent, parentSuspense, slotScopeIds, optimized) => {\r\n        const { slotScopeIds: fragmentSlotScopeIds } = vnode;\r\n        if (fragmentSlotScopeIds) {\r\n            slotScopeIds = slotScopeIds\r\n                ? slotScopeIds.concat(fragmentSlotScopeIds)\r\n                : fragmentSlotScopeIds;\r\n        }\r\n        const container = parentNode(node);\r\n        const next = hydrateChildren(nextSibling(node), vnode, container, parentComponent, parentSuspense, slotScopeIds, optimized);\r\n        if (next && isComment(next) && next.data === ']') {\r\n            return nextSibling((vnode.anchor = next));\r\n        }\r\n        else {\r\n            // fragment didn't hydrate successfully, since we didn't get a end anchor\r\n            // back. This should have led to node/children mismatch warnings.\r\n            hasMismatch = true;\r\n            // since the anchor is missing, we need to create one and insert it\r\n            insert((vnode.anchor = createComment(`]`)), container, next);\r\n            return next;\r\n        }\r\n    };\r\n    const handleMismatch = (node, vnode, parentComponent, parentSuspense, slotScopeIds, isFragment) => {\r\n        hasMismatch = true;\r\n        vnode.el = null;\r\n        if (isFragment) {\r\n            // remove excessive fragment nodes\r\n            const end = locateClosingAsyncAnchor(node);\r\n            while (true) {\r\n                const next = nextSibling(node);\r\n                if (next && next !== end) {\r\n                    remove(next);\r\n                }\r\n                else {\r\n                    break;\r\n                }\r\n            }\r\n        }\r\n        const next = nextSibling(node);\r\n        const container = parentNode(node);\r\n        remove(node);\r\n        patch(null, vnode, container, next, parentComponent, parentSuspense, isSVGContainer(container), slotScopeIds);\r\n        return next;\r\n    };\r\n    const locateClosingAsyncAnchor = (node) => {\r\n        let match = 0;\r\n        while (node) {\r\n            node = nextSibling(node);\r\n            if (node && isComment(node)) {\r\n                if (node.data === '[')\r\n                    match++;\r\n                if (node.data === ']') {\r\n                    if (match === 0) {\r\n                        return nextSibling(node);\r\n                    }\r\n                    else {\r\n                        match--;\r\n                    }\r\n                }\r\n            }\r\n        }\r\n        return node;\r\n    };\r\n    return [hydrate, hydrateNode];\r\n}\n\nconst prodEffectOptions = {\r\n    scheduler: queueJob,\r\n    // #1801, #2043 component render effects should allow recursive updates\r\n    allowRecurse: true\r\n};\r\nconst queuePostRenderEffect = queueEffectWithSuspense\r\n    ;\r\nconst setRef = (rawRef, oldRawRef, parentSuspense, vnode, isUnmount = false) => {\r\n    if (shared.isArray(rawRef)) {\r\n        rawRef.forEach((r, i) => setRef(r, oldRawRef && (shared.isArray(oldRawRef) ? oldRawRef[i] : oldRawRef), parentSuspense, vnode, isUnmount));\r\n        return;\r\n    }\r\n    if (isAsyncWrapper(vnode) && !isUnmount) {\r\n        // when mounting async components, nothing needs to be done,\r\n        // because the template ref is forwarded to inner component\r\n        return;\r\n    }\r\n    const refValue = vnode.shapeFlag & 4 /* STATEFUL_COMPONENT */\r\n        ? vnode.component.exposed || vnode.component.proxy\r\n        : vnode.el;\r\n    const value = isUnmount ? null : refValue;\r\n    const { i: owner, r: ref } = rawRef;\r\n    const oldRef = oldRawRef && oldRawRef.r;\r\n    const refs = owner.refs === shared.EMPTY_OBJ ? (owner.refs = {}) : owner.refs;\r\n    const setupState = owner.setupState;\r\n    // dynamic ref changed. unset old ref\r\n    if (oldRef != null && oldRef !== ref) {\r\n        if (shared.isString(oldRef)) {\r\n            refs[oldRef] = null;\r\n            if (shared.hasOwn(setupState, oldRef)) {\r\n                setupState[oldRef] = null;\r\n            }\r\n        }\r\n        else if (reactivity.isRef(oldRef)) {\r\n            oldRef.value = null;\r\n        }\r\n    }\r\n    if (shared.isString(ref)) {\r\n        const doSet = () => {\r\n            {\r\n                refs[ref] = value;\r\n            }\r\n            if (shared.hasOwn(setupState, ref)) {\r\n                setupState[ref] = value;\r\n            }\r\n        };\r\n        // #1789: for non-null values, set them after render\r\n        // null values means this is unmount and it should not overwrite another\r\n        // ref with the same key\r\n        if (value) {\r\n            doSet.id = -1;\r\n            queuePostRenderEffect(doSet, parentSuspense);\r\n        }\r\n        else {\r\n            doSet();\r\n        }\r\n    }\r\n    else if (reactivity.isRef(ref)) {\r\n        const doSet = () => {\r\n            ref.value = value;\r\n        };\r\n        if (value) {\r\n            doSet.id = -1;\r\n            queuePostRenderEffect(doSet, parentSuspense);\r\n        }\r\n        else {\r\n            doSet();\r\n        }\r\n    }\r\n    else if (shared.isFunction(ref)) {\r\n        callWithErrorHandling(ref, owner, 12 /* FUNCTION_REF */, [value, refs]);\r\n    }\r\n    else ;\r\n};\r\n/**\r\n * The createRenderer function accepts two generic arguments:\r\n * HostNode and HostElement, corresponding to Node and Element types in the\r\n * host environment. For example, for runtime-dom, HostNode would be the DOM\r\n * `Node` interface and HostElement would be the DOM `Element` interface.\r\n *\r\n * Custom renderers can pass in the platform specific types like this:\r\n *\r\n * ``` js\r\n * const { render, createApp } = createRenderer<Node, Element>({\r\n *   patchProp,\r\n *   ...nodeOps\r\n * })\r\n * ```\r\n */\r\nfunction createRenderer(options) {\r\n    return baseCreateRenderer(options);\r\n}\r\n// Separate API for creating hydration-enabled renderer.\r\n// Hydration logic is only used when calling this function, making it\r\n// tree-shakable.\r\nfunction createHydrationRenderer(options) {\r\n    return baseCreateRenderer(options, createHydrationFunctions);\r\n}\r\n// implementation\r\nfunction baseCreateRenderer(options, createHydrationFns) {\r\n    const { insert: hostInsert, remove: hostRemove, patchProp: hostPatchProp, forcePatchProp: hostForcePatchProp, createElement: hostCreateElement, createText: hostCreateText, createComment: hostCreateComment, setText: hostSetText, setElementText: hostSetElementText, parentNode: hostParentNode, nextSibling: hostNextSibling, setScopeId: hostSetScopeId = shared.NOOP, cloneNode: hostCloneNode, insertStaticContent: hostInsertStaticContent } = options;\r\n    // Note: functions inside this closure should use `const xxx = () => {}`\r\n    // style in order to prevent being inlined by minifiers.\r\n    const patch = (n1, n2, container, anchor = null, parentComponent = null, parentSuspense = null, isSVG = false, slotScopeIds = null, optimized = false) => {\r\n        // patching & not same type, unmount old tree\r\n        if (n1 && !isSameVNodeType(n1, n2)) {\r\n            anchor = getNextHostNode(n1);\r\n            unmount(n1, parentComponent, parentSuspense, true);\r\n            n1 = null;\r\n        }\r\n        if (n2.patchFlag === -2 /* BAIL */) {\r\n            optimized = false;\r\n            n2.dynamicChildren = null;\r\n        }\r\n        const { type, ref, shapeFlag } = n2;\r\n        switch (type) {\r\n            case Text:\r\n                processText(n1, n2, container, anchor);\r\n                break;\r\n            case Comment$1:\r\n                processCommentNode(n1, n2, container, anchor);\r\n                break;\r\n            case Static:\r\n                if (n1 == null) {\r\n                    mountStaticNode(n2, container, anchor, isSVG);\r\n                }\r\n                break;\r\n            case Fragment:\r\n                processFragment(n1, n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n                break;\r\n            default:\r\n                if (shapeFlag & 1 /* ELEMENT */) {\r\n                    processElement(n1, n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n                }\r\n                else if (shapeFlag & 6 /* COMPONENT */) {\r\n                    processComponent(n1, n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n                }\r\n                else if (shapeFlag & 64 /* TELEPORT */) {\r\n                    type.process(n1, n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized, internals);\r\n                }\r\n                else if (shapeFlag & 128 /* SUSPENSE */) {\r\n                    type.process(n1, n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized, internals);\r\n                }\r\n                else ;\r\n        }\r\n        // set ref\r\n        if (ref != null && parentComponent) {\r\n            setRef(ref, n1 && n1.ref, parentSuspense, n2 || n1, !n2);\r\n        }\r\n    };\r\n    const processText = (n1, n2, container, anchor) => {\r\n        if (n1 == null) {\r\n            hostInsert((n2.el = hostCreateText(n2.children)), container, anchor);\r\n        }\r\n        else {\r\n            const el = (n2.el = n1.el);\r\n            if (n2.children !== n1.children) {\r\n                hostSetText(el, n2.children);\r\n            }\r\n        }\r\n    };\r\n    const processCommentNode = (n1, n2, container, anchor) => {\r\n        if (n1 == null) {\r\n            hostInsert((n2.el = hostCreateComment(n2.children || '')), container, anchor);\r\n        }\r\n        else {\r\n            // there's no support for dynamic comments\r\n            n2.el = n1.el;\r\n        }\r\n    };\r\n    const mountStaticNode = (n2, container, anchor, isSVG) => {\r\n        [n2.el, n2.anchor] = hostInsertStaticContent(n2.children, container, anchor, isSVG);\r\n    };\r\n    const moveStaticNode = ({ el, anchor }, container, nextSibling) => {\r\n        let next;\r\n        while (el && el !== anchor) {\r\n            next = hostNextSibling(el);\r\n            hostInsert(el, container, nextSibling);\r\n            el = next;\r\n        }\r\n        hostInsert(anchor, container, nextSibling);\r\n    };\r\n    const removeStaticNode = ({ el, anchor }) => {\r\n        let next;\r\n        while (el && el !== anchor) {\r\n            next = hostNextSibling(el);\r\n            hostRemove(el);\r\n            el = next;\r\n        }\r\n        hostRemove(anchor);\r\n    };\r\n    const processElement = (n1, n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized) => {\r\n        isSVG = isSVG || n2.type === 'svg';\r\n        if (n1 == null) {\r\n            mountElement(n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n        }\r\n        else {\r\n            patchElement(n1, n2, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n        }\r\n    };\r\n    const mountElement = (vnode, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized) => {\r\n        let el;\r\n        let vnodeHook;\r\n        const { type, props, shapeFlag, transition, patchFlag, dirs } = vnode;\r\n        if (vnode.el &&\r\n            hostCloneNode !== undefined &&\r\n            patchFlag === -1 /* HOISTED */) {\r\n            // If a vnode has non-null el, it means it's being reused.\r\n            // Only static vnodes can be reused, so its mounted DOM nodes should be\r\n            // exactly the same, and we can simply do a clone here.\r\n            // only do this in production since cloned trees cannot be HMR updated.\r\n            el = vnode.el = hostCloneNode(vnode.el);\r\n        }\r\n        else {\r\n            el = vnode.el = hostCreateElement(vnode.type, isSVG, props && props.is, props);\r\n            // mount children first, since some props may rely on child content\r\n            // being already rendered, e.g. `<select value>`\r\n            if (shapeFlag & 8 /* TEXT_CHILDREN */) {\r\n                hostSetElementText(el, vnode.children);\r\n            }\r\n            else if (shapeFlag & 16 /* ARRAY_CHILDREN */) {\r\n                mountChildren(vnode.children, el, null, parentComponent, parentSuspense, isSVG && type !== 'foreignObject', slotScopeIds, optimized || !!vnode.dynamicChildren);\r\n            }\r\n            if (dirs) {\r\n                invokeDirectiveHook(vnode, null, parentComponent, 'created');\r\n            }\r\n            // props\r\n            if (props) {\r\n                for (const key in props) {\r\n                    if (!shared.isReservedProp(key)) {\r\n                        hostPatchProp(el, key, null, props[key], isSVG, vnode.children, parentComponent, parentSuspense, unmountChildren);\r\n                    }\r\n                }\r\n                if ((vnodeHook = props.onVnodeBeforeMount)) {\r\n                    invokeVNodeHook(vnodeHook, parentComponent, vnode);\r\n                }\r\n            }\r\n            // scopeId\r\n            setScopeId(el, vnode, vnode.scopeId, slotScopeIds, parentComponent);\r\n        }\r\n        if (dirs) {\r\n            invokeDirectiveHook(vnode, null, parentComponent, 'beforeMount');\r\n        }\r\n        // #1583 For inside suspense + suspense not resolved case, enter hook should call when suspense resolved\r\n        // #1689 For inside suspense + suspense resolved case, just call it\r\n        const needCallTransitionHooks = (!parentSuspense || (parentSuspense && !parentSuspense.pendingBranch)) &&\r\n            transition &&\r\n            !transition.persisted;\r\n        if (needCallTransitionHooks) {\r\n            transition.beforeEnter(el);\r\n        }\r\n        hostInsert(el, container, anchor);\r\n        if ((vnodeHook = props && props.onVnodeMounted) ||\r\n            needCallTransitionHooks ||\r\n            dirs) {\r\n            queuePostRenderEffect(() => {\r\n                vnodeHook && invokeVNodeHook(vnodeHook, parentComponent, vnode);\r\n                needCallTransitionHooks && transition.enter(el);\r\n                dirs && invokeDirectiveHook(vnode, null, parentComponent, 'mounted');\r\n            }, parentSuspense);\r\n        }\r\n    };\r\n    const setScopeId = (el, vnode, scopeId, slotScopeIds, parentComponent) => {\r\n        if (scopeId) {\r\n            hostSetScopeId(el, scopeId);\r\n        }\r\n        if (slotScopeIds) {\r\n            for (let i = 0; i < slotScopeIds.length; i++) {\r\n                hostSetScopeId(el, slotScopeIds[i]);\r\n            }\r\n        }\r\n        if (parentComponent) {\r\n            let subTree = parentComponent.subTree;\r\n            if (vnode === subTree) {\r\n                const parentVNode = parentComponent.vnode;\r\n                setScopeId(el, parentVNode, parentVNode.scopeId, parentVNode.slotScopeIds, parentComponent.parent);\r\n            }\r\n        }\r\n    };\r\n    const mountChildren = (children, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized, start = 0) => {\r\n        for (let i = start; i < children.length; i++) {\r\n            const child = (children[i] = optimized\r\n                ? cloneIfMounted(children[i])\r\n                : normalizeVNode(children[i]));\r\n            patch(null, child, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n        }\r\n    };\r\n    const patchElement = (n1, n2, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized) => {\r\n        const el = (n2.el = n1.el);\r\n        let { patchFlag, dynamicChildren, dirs } = n2;\r\n        // #1426 take the old vnode's patch flag into account since user may clone a\r\n        // compiler-generated vnode, which de-opts to FULL_PROPS\r\n        patchFlag |= n1.patchFlag & 16 /* FULL_PROPS */;\r\n        const oldProps = n1.props || shared.EMPTY_OBJ;\r\n        const newProps = n2.props || shared.EMPTY_OBJ;\r\n        let vnodeHook;\r\n        if ((vnodeHook = newProps.onVnodeBeforeUpdate)) {\r\n            invokeVNodeHook(vnodeHook, parentComponent, n2, n1);\r\n        }\r\n        if (dirs) {\r\n            invokeDirectiveHook(n2, n1, parentComponent, 'beforeUpdate');\r\n        }\r\n        if (patchFlag > 0) {\r\n            // the presence of a patchFlag means this element's render code was\r\n            // generated by the compiler and can take the fast path.\r\n            // in this path old node and new node are guaranteed to have the same shape\r\n            // (i.e. at the exact same position in the source template)\r\n            if (patchFlag & 16 /* FULL_PROPS */) {\r\n                // element props contain dynamic keys, full diff needed\r\n                patchProps(el, n2, oldProps, newProps, parentComponent, parentSuspense, isSVG);\r\n            }\r\n            else {\r\n                // class\r\n                // this flag is matched when the element has dynamic class bindings.\r\n                if (patchFlag & 2 /* CLASS */) {\r\n                    if (oldProps.class !== newProps.class) {\r\n                        hostPatchProp(el, 'class', null, newProps.class, isSVG);\r\n                    }\r\n                }\r\n                // style\r\n                // this flag is matched when the element has dynamic style bindings\r\n                if (patchFlag & 4 /* STYLE */) {\r\n                    hostPatchProp(el, 'style', oldProps.style, newProps.style, isSVG);\r\n                }\r\n                // props\r\n                // This flag is matched when the element has dynamic prop/attr bindings\r\n                // other than class and style. The keys of dynamic prop/attrs are saved for\r\n                // faster iteration.\r\n                // Note dynamic keys like :[foo]=\"bar\" will cause this optimization to\r\n                // bail out and go through a full diff because we need to unset the old key\r\n                if (patchFlag & 8 /* PROPS */) {\r\n                    // if the flag is present then dynamicProps must be non-null\r\n                    const propsToUpdate = n2.dynamicProps;\r\n                    for (let i = 0; i < propsToUpdate.length; i++) {\r\n                        const key = propsToUpdate[i];\r\n                        const prev = oldProps[key];\r\n                        const next = newProps[key];\r\n                        if (next !== prev ||\r\n                            (hostForcePatchProp && hostForcePatchProp(el, key))) {\r\n                            hostPatchProp(el, key, prev, next, isSVG, n1.children, parentComponent, parentSuspense, unmountChildren);\r\n                        }\r\n                    }\r\n                }\r\n            }\r\n            // text\r\n            // This flag is matched when the element has only dynamic text children.\r\n            if (patchFlag & 1 /* TEXT */) {\r\n                if (n1.children !== n2.children) {\r\n                    hostSetElementText(el, n2.children);\r\n                }\r\n            }\r\n        }\r\n        else if (!optimized && dynamicChildren == null) {\r\n            // unoptimized, full diff\r\n            patchProps(el, n2, oldProps, newProps, parentComponent, parentSuspense, isSVG);\r\n        }\r\n        const areChildrenSVG = isSVG && n2.type !== 'foreignObject';\r\n        if (dynamicChildren) {\r\n            patchBlockChildren(n1.dynamicChildren, dynamicChildren, el, parentComponent, parentSuspense, areChildrenSVG, slotScopeIds);\r\n        }\r\n        else if (!optimized) {\r\n            // full diff\r\n            patchChildren(n1, n2, el, null, parentComponent, parentSuspense, areChildrenSVG, slotScopeIds, false);\r\n        }\r\n        if ((vnodeHook = newProps.onVnodeUpdated) || dirs) {\r\n            queuePostRenderEffect(() => {\r\n                vnodeHook && invokeVNodeHook(vnodeHook, parentComponent, n2, n1);\r\n                dirs && invokeDirectiveHook(n2, n1, parentComponent, 'updated');\r\n            }, parentSuspense);\r\n        }\r\n    };\r\n    // The fast path for blocks.\r\n    const patchBlockChildren = (oldChildren, newChildren, fallbackContainer, parentComponent, parentSuspense, isSVG, slotScopeIds) => {\r\n        for (let i = 0; i < newChildren.length; i++) {\r\n            const oldVNode = oldChildren[i];\r\n            const newVNode = newChildren[i];\r\n            // Determine the container (parent element) for the patch.\r\n            const container = \r\n            // oldVNode may be an errored async setup() component inside Suspense\r\n            // which will not have a mounted element\r\n            oldVNode.el &&\r\n                // - In the case of a Fragment, we need to provide the actual parent\r\n                // of the Fragment itself so it can move its children.\r\n                (oldVNode.type === Fragment ||\r\n                    // - In the case of different nodes, there is going to be a replacement\r\n                    // which also requires the correct parent container\r\n                    !isSameVNodeType(oldVNode, newVNode) ||\r\n                    // - In the case of a component, it could contain anything.\r\n                    oldVNode.shapeFlag & 6 /* COMPONENT */ ||\r\n                    oldVNode.shapeFlag & 64 /* TELEPORT */)\r\n                ? hostParentNode(oldVNode.el)\r\n                : // In other cases, the parent container is not actually used so we\r\n                    // just pass the block element here to avoid a DOM parentNode call.\r\n                    fallbackContainer;\r\n            patch(oldVNode, newVNode, container, null, parentComponent, parentSuspense, isSVG, slotScopeIds, true);\r\n        }\r\n    };\r\n    const patchProps = (el, vnode, oldProps, newProps, parentComponent, parentSuspense, isSVG) => {\r\n        if (oldProps !== newProps) {\r\n            for (const key in newProps) {\r\n                // empty string is not valid prop\r\n                if (shared.isReservedProp(key))\r\n                    continue;\r\n                const next = newProps[key];\r\n                const prev = oldProps[key];\r\n                if (next !== prev ||\r\n                    (hostForcePatchProp && hostForcePatchProp(el, key))) {\r\n                    hostPatchProp(el, key, prev, next, isSVG, vnode.children, parentComponent, parentSuspense, unmountChildren);\r\n                }\r\n            }\r\n            if (oldProps !== shared.EMPTY_OBJ) {\r\n                for (const key in oldProps) {\r\n                    if (!shared.isReservedProp(key) && !(key in newProps)) {\r\n                        hostPatchProp(el, key, oldProps[key], null, isSVG, vnode.children, parentComponent, parentSuspense, unmountChildren);\r\n                    }\r\n                }\r\n            }\r\n        }\r\n    };\r\n    const processFragment = (n1, n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized) => {\r\n        const fragmentStartAnchor = (n2.el = n1 ? n1.el : hostCreateText(''));\r\n        const fragmentEndAnchor = (n2.anchor = n1 ? n1.anchor : hostCreateText(''));\r\n        let { patchFlag, dynamicChildren, slotScopeIds: fragmentSlotScopeIds } = n2;\r\n        if (dynamicChildren) {\r\n            optimized = true;\r\n        }\r\n        // check if this is a slot fragment with :slotted scope ids\r\n        if (fragmentSlotScopeIds) {\r\n            slotScopeIds = slotScopeIds\r\n                ? slotScopeIds.concat(fragmentSlotScopeIds)\r\n                : fragmentSlotScopeIds;\r\n        }\r\n        if (n1 == null) {\r\n            hostInsert(fragmentStartAnchor, container, anchor);\r\n            hostInsert(fragmentEndAnchor, container, anchor);\r\n            // a fragment can only have array children\r\n            // since they are either generated by the compiler, or implicitly created\r\n            // from arrays.\r\n            mountChildren(n2.children, container, fragmentEndAnchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n        }\r\n        else {\r\n            if (patchFlag > 0 &&\r\n                patchFlag & 64 /* STABLE_FRAGMENT */ &&\r\n                dynamicChildren &&\r\n                // #2715 the previous fragment could've been a BAILed one as a result\r\n                // of renderSlot() with no valid children\r\n                n1.dynamicChildren) {\r\n                // a stable fragment (template root or <template v-for>) doesn't need to\r\n                // patch children order, but it may contain dynamicChildren.\r\n                patchBlockChildren(n1.dynamicChildren, dynamicChildren, container, parentComponent, parentSuspense, isSVG, slotScopeIds);\r\n                if (\r\n                // #2080 if the stable fragment has a key, it's a <template v-for> that may\r\n                //  get moved around. Make sure all root level vnodes inherit el.\r\n                // #2134 or if it's a component root, it may also get moved around\r\n                // as the component is being moved.\r\n                n2.key != null ||\r\n                    (parentComponent && n2 === parentComponent.subTree)) {\r\n                    traverseStaticChildren(n1, n2, true /* shallow */);\r\n                }\r\n            }\r\n            else {\r\n                // keyed / unkeyed, or manual fragments.\r\n                // for keyed & unkeyed, since they are compiler generated from v-for,\r\n                // each child is guaranteed to be a block so the fragment will never\r\n                // have dynamicChildren.\r\n                patchChildren(n1, n2, container, fragmentEndAnchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n            }\r\n        }\r\n    };\r\n    const processComponent = (n1, n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized) => {\r\n        n2.slotScopeIds = slotScopeIds;\r\n        if (n1 == null) {\r\n            if (n2.shapeFlag & 512 /* COMPONENT_KEPT_ALIVE */) {\r\n                parentComponent.ctx.activate(n2, container, anchor, isSVG, optimized);\r\n            }\r\n            else {\r\n                mountComponent(n2, container, anchor, parentComponent, parentSuspense, isSVG, optimized);\r\n            }\r\n        }\r\n        else {\r\n            updateComponent(n1, n2, optimized);\r\n        }\r\n    };\r\n    const mountComponent = (initialVNode, container, anchor, parentComponent, parentSuspense, isSVG, optimized) => {\r\n        const instance = (initialVNode.component = createComponentInstance(initialVNode, parentComponent, parentSuspense));\r\n        // inject renderer internals for keepAlive\r\n        if (isKeepAlive(initialVNode)) {\r\n            instance.ctx.renderer = internals;\r\n        }\r\n        // resolve props and slots for setup context\r\n        {\r\n            setupComponent(instance);\r\n        }\r\n        // setup() is async. This component relies on async logic to be resolved\r\n        // before proceeding\r\n        if (instance.asyncDep) {\r\n            parentSuspense && parentSuspense.registerDep(instance, setupRenderEffect);\r\n            // Give it a placeholder if this is not hydration\r\n            // TODO handle self-defined fallback\r\n            if (!initialVNode.el) {\r\n                const placeholder = (instance.subTree = createVNode(Comment$1));\r\n                processCommentNode(null, placeholder, container, anchor);\r\n            }\r\n            return;\r\n        }\r\n        setupRenderEffect(instance, initialVNode, container, anchor, parentSuspense, isSVG, optimized);\r\n    };\r\n    const updateComponent = (n1, n2, optimized) => {\r\n        const instance = (n2.component = n1.component);\r\n        if (shouldUpdateComponent(n1, n2, optimized)) {\r\n            if (instance.asyncDep &&\r\n                !instance.asyncResolved) {\r\n                updateComponentPreRender(instance, n2, optimized);\r\n                return;\r\n            }\r\n            else {\r\n                // normal update\r\n                instance.next = n2;\r\n                // in case the child component is also queued, remove it to avoid\r\n                // double updating the same child component in the same flush.\r\n                invalidateJob(instance.update);\r\n                // instance.update is the reactive effect runner.\r\n                instance.update();\r\n            }\r\n        }\r\n        else {\r\n            // no update needed. just copy over properties\r\n            n2.component = n1.component;\r\n            n2.el = n1.el;\r\n            instance.vnode = n2;\r\n        }\r\n    };\r\n    const setupRenderEffect = (instance, initialVNode, container, anchor, parentSuspense, isSVG, optimized) => {\r\n        // create reactive effect for rendering\r\n        instance.update = reactivity.effect(function componentEffect() {\r\n            if (!instance.isMounted) {\r\n                let vnodeHook;\r\n                const { el, props } = initialVNode;\r\n                const { bm, m, parent } = instance;\r\n                // beforeMount hook\r\n                if (bm) {\r\n                    shared.invokeArrayFns(bm);\r\n                }\r\n                // onVnodeBeforeMount\r\n                if ((vnodeHook = props && props.onVnodeBeforeMount)) {\r\n                    invokeVNodeHook(vnodeHook, parent, initialVNode);\r\n                }\r\n                if (el && hydrateNode) {\r\n                    // vnode has adopted host node - perform hydration instead of mount.\r\n                    const hydrateSubTree = () => {\r\n                        instance.subTree = renderComponentRoot(instance);\r\n                        hydrateNode(el, instance.subTree, instance, parentSuspense, null);\r\n                    };\r\n                    if (isAsyncWrapper(initialVNode)) {\r\n                        initialVNode.type.__asyncLoader().then(\r\n                        // note: we are moving the render call into an async callback,\r\n                        // which means it won't track dependencies - but it's ok because\r\n                        // a server-rendered async wrapper is already in resolved state\r\n                        // and it will never need to change.\r\n                        () => !instance.isUnmounted && hydrateSubTree());\r\n                    }\r\n                    else {\r\n                        hydrateSubTree();\r\n                    }\r\n                }\r\n                else {\r\n                    const subTree = (instance.subTree = renderComponentRoot(instance));\r\n                    patch(null, subTree, container, anchor, instance, parentSuspense, isSVG);\r\n                    initialVNode.el = subTree.el;\r\n                }\r\n                // mounted hook\r\n                if (m) {\r\n                    queuePostRenderEffect(m, parentSuspense);\r\n                }\r\n                // onVnodeMounted\r\n                if ((vnodeHook = props && props.onVnodeMounted)) {\r\n                    const scopedInitialVNode = initialVNode;\r\n                    queuePostRenderEffect(() => invokeVNodeHook(vnodeHook, parent, scopedInitialVNode), parentSuspense);\r\n                }\r\n                // activated hook for keep-alive roots.\r\n                // #1742 activated hook must be accessed after first render\r\n                // since the hook may be injected by a child keep-alive\r\n                if (initialVNode.shapeFlag & 256 /* COMPONENT_SHOULD_KEEP_ALIVE */) {\r\n                    instance.a && queuePostRenderEffect(instance.a, parentSuspense);\r\n                }\r\n                instance.isMounted = true;\r\n                // #2458: deference mount-only object parameters to prevent memleaks\r\n                initialVNode = container = anchor = null;\r\n            }\r\n            else {\r\n                // updateComponent\r\n                // This is triggered by mutation of component's own state (next: null)\r\n                // OR parent calling processComponent (next: VNode)\r\n                let { next, bu, u, parent, vnode } = instance;\r\n                let originNext = next;\r\n                let vnodeHook;\r\n                if (next) {\r\n                    next.el = vnode.el;\r\n                    updateComponentPreRender(instance, next, optimized);\r\n                }\r\n                else {\r\n                    next = vnode;\r\n                }\r\n                // beforeUpdate hook\r\n                if (bu) {\r\n                    shared.invokeArrayFns(bu);\r\n                }\r\n                // onVnodeBeforeUpdate\r\n                if ((vnodeHook = next.props && next.props.onVnodeBeforeUpdate)) {\r\n                    invokeVNodeHook(vnodeHook, parent, next, vnode);\r\n                }\r\n                const nextTree = renderComponentRoot(instance);\r\n                const prevTree = instance.subTree;\r\n                instance.subTree = nextTree;\r\n                patch(prevTree, nextTree, \r\n                // parent may have changed if it's in a teleport\r\n                hostParentNode(prevTree.el), \r\n                // anchor may have changed if it's in a fragment\r\n                getNextHostNode(prevTree), instance, parentSuspense, isSVG);\r\n                next.el = nextTree.el;\r\n                if (originNext === null) {\r\n                    // self-triggered update. In case of HOC, update parent component\r\n                    // vnode el. HOC is indicated by parent instance's subTree pointing\r\n                    // to child component's vnode\r\n                    updateHOCHostEl(instance, nextTree.el);\r\n                }\r\n                // updated hook\r\n                if (u) {\r\n                    queuePostRenderEffect(u, parentSuspense);\r\n                }\r\n                // onVnodeUpdated\r\n                if ((vnodeHook = next.props && next.props.onVnodeUpdated)) {\r\n                    queuePostRenderEffect(() => invokeVNodeHook(vnodeHook, parent, next, vnode), parentSuspense);\r\n                }\r\n            }\r\n        }, prodEffectOptions);\r\n    };\r\n    const updateComponentPreRender = (instance, nextVNode, optimized) => {\r\n        nextVNode.component = instance;\r\n        const prevProps = instance.vnode.props;\r\n        instance.vnode = nextVNode;\r\n        instance.next = null;\r\n        updateProps(instance, nextVNode.props, prevProps, optimized);\r\n        updateSlots(instance, nextVNode.children, optimized);\r\n        reactivity.pauseTracking();\r\n        // props update may have triggered pre-flush watchers.\r\n        // flush them before the render update.\r\n        flushPreFlushCbs(undefined, instance.update);\r\n        reactivity.resetTracking();\r\n    };\r\n    const patchChildren = (n1, n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized = false) => {\r\n        const c1 = n1 && n1.children;\r\n        const prevShapeFlag = n1 ? n1.shapeFlag : 0;\r\n        const c2 = n2.children;\r\n        const { patchFlag, shapeFlag } = n2;\r\n        // fast path\r\n        if (patchFlag > 0) {\r\n            if (patchFlag & 128 /* KEYED_FRAGMENT */) {\r\n                // this could be either fully-keyed or mixed (some keyed some not)\r\n                // presence of patchFlag means children are guaranteed to be arrays\r\n                patchKeyedChildren(c1, c2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n                return;\r\n            }\r\n            else if (patchFlag & 256 /* UNKEYED_FRAGMENT */) {\r\n                // unkeyed\r\n                patchUnkeyedChildren(c1, c2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n                return;\r\n            }\r\n        }\r\n        // children has 3 possibilities: text, array or no children.\r\n        if (shapeFlag & 8 /* TEXT_CHILDREN */) {\r\n            // text children fast path\r\n            if (prevShapeFlag & 16 /* ARRAY_CHILDREN */) {\r\n                unmountChildren(c1, parentComponent, parentSuspense);\r\n            }\r\n            if (c2 !== c1) {\r\n                hostSetElementText(container, c2);\r\n            }\r\n        }\r\n        else {\r\n            if (prevShapeFlag & 16 /* ARRAY_CHILDREN */) {\r\n                // prev children was array\r\n                if (shapeFlag & 16 /* ARRAY_CHILDREN */) {\r\n                    // two arrays, cannot assume anything, do full diff\r\n                    patchKeyedChildren(c1, c2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n                }\r\n                else {\r\n                    // no new children, just unmount old\r\n                    unmountChildren(c1, parentComponent, parentSuspense, true);\r\n                }\r\n            }\r\n            else {\r\n                // prev children was text OR null\r\n                // new children is array OR null\r\n                if (prevShapeFlag & 8 /* TEXT_CHILDREN */) {\r\n                    hostSetElementText(container, '');\r\n                }\r\n                // mount new if array\r\n                if (shapeFlag & 16 /* ARRAY_CHILDREN */) {\r\n                    mountChildren(c2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n                }\r\n            }\r\n        }\r\n    };\r\n    const patchUnkeyedChildren = (c1, c2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized) => {\r\n        c1 = c1 || shared.EMPTY_ARR;\r\n        c2 = c2 || shared.EMPTY_ARR;\r\n        const oldLength = c1.length;\r\n        const newLength = c2.length;\r\n        const commonLength = Math.min(oldLength, newLength);\r\n        let i;\r\n        for (i = 0; i < commonLength; i++) {\r\n            const nextChild = (c2[i] = optimized\r\n                ? cloneIfMounted(c2[i])\r\n                : normalizeVNode(c2[i]));\r\n            patch(c1[i], nextChild, container, null, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n        }\r\n        if (oldLength > newLength) {\r\n            // remove old\r\n            unmountChildren(c1, parentComponent, parentSuspense, true, false, commonLength);\r\n        }\r\n        else {\r\n            // mount new\r\n            mountChildren(c2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized, commonLength);\r\n        }\r\n    };\r\n    // can be all-keyed or mixed\r\n    const patchKeyedChildren = (c1, c2, container, parentAnchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized) => {\r\n        let i = 0;\r\n        const l2 = c2.length;\r\n        let e1 = c1.length - 1; // prev ending index\r\n        let e2 = l2 - 1; // next ending index\r\n        // 1. sync from start\r\n        // (a b) c\r\n        // (a b) d e\r\n        while (i <= e1 && i <= e2) {\r\n            const n1 = c1[i];\r\n            const n2 = (c2[i] = optimized\r\n                ? cloneIfMounted(c2[i])\r\n                : normalizeVNode(c2[i]));\r\n            if (isSameVNodeType(n1, n2)) {\r\n                patch(n1, n2, container, null, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n            }\r\n            else {\r\n                break;\r\n            }\r\n            i++;\r\n        }\r\n        // 2. sync from end\r\n        // a (b c)\r\n        // d e (b c)\r\n        while (i <= e1 && i <= e2) {\r\n            const n1 = c1[e1];\r\n            const n2 = (c2[e2] = optimized\r\n                ? cloneIfMounted(c2[e2])\r\n                : normalizeVNode(c2[e2]));\r\n            if (isSameVNodeType(n1, n2)) {\r\n                patch(n1, n2, container, null, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n            }\r\n            else {\r\n                break;\r\n            }\r\n            e1--;\r\n            e2--;\r\n        }\r\n        // 3. common sequence + mount\r\n        // (a b)\r\n        // (a b) c\r\n        // i = 2, e1 = 1, e2 = 2\r\n        // (a b)\r\n        // c (a b)\r\n        // i = 0, e1 = -1, e2 = 0\r\n        if (i > e1) {\r\n            if (i <= e2) {\r\n                const nextPos = e2 + 1;\r\n                const anchor = nextPos < l2 ? c2[nextPos].el : parentAnchor;\r\n                while (i <= e2) {\r\n                    patch(null, (c2[i] = optimized\r\n                        ? cloneIfMounted(c2[i])\r\n                        : normalizeVNode(c2[i])), container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n                    i++;\r\n                }\r\n            }\r\n        }\r\n        // 4. common sequence + unmount\r\n        // (a b) c\r\n        // (a b)\r\n        // i = 2, e1 = 2, e2 = 1\r\n        // a (b c)\r\n        // (b c)\r\n        // i = 0, e1 = 0, e2 = -1\r\n        else if (i > e2) {\r\n            while (i <= e1) {\r\n                unmount(c1[i], parentComponent, parentSuspense, true);\r\n                i++;\r\n            }\r\n        }\r\n        // 5. unknown sequence\r\n        // [i ... e1 + 1]: a b [c d e] f g\r\n        // [i ... e2 + 1]: a b [e d c h] f g\r\n        // i = 2, e1 = 4, e2 = 5\r\n        else {\r\n            const s1 = i; // prev starting index\r\n            const s2 = i; // next starting index\r\n            // 5.1 build key:index map for newChildren\r\n            const keyToNewIndexMap = new Map();\r\n            for (i = s2; i <= e2; i++) {\r\n                const nextChild = (c2[i] = optimized\r\n                    ? cloneIfMounted(c2[i])\r\n                    : normalizeVNode(c2[i]));\r\n                if (nextChild.key != null) {\r\n                    keyToNewIndexMap.set(nextChild.key, i);\r\n                }\r\n            }\r\n            // 5.2 loop through old children left to be patched and try to patch\r\n            // matching nodes & remove nodes that are no longer present\r\n            let j;\r\n            let patched = 0;\r\n            const toBePatched = e2 - s2 + 1;\r\n            let moved = false;\r\n            // used to track whether any node has moved\r\n            let maxNewIndexSoFar = 0;\r\n            // works as Map<newIndex, oldIndex>\r\n            // Note that oldIndex is offset by +1\r\n            // and oldIndex = 0 is a special value indicating the new node has\r\n            // no corresponding old node.\r\n            // used for determining longest stable subsequence\r\n            const newIndexToOldIndexMap = new Array(toBePatched);\r\n            for (i = 0; i < toBePatched; i++)\r\n                newIndexToOldIndexMap[i] = 0;\r\n            for (i = s1; i <= e1; i++) {\r\n                const prevChild = c1[i];\r\n                if (patched >= toBePatched) {\r\n                    // all new children have been patched so this can only be a removal\r\n                    unmount(prevChild, parentComponent, parentSuspense, true);\r\n                    continue;\r\n                }\r\n                let newIndex;\r\n                if (prevChild.key != null) {\r\n                    newIndex = keyToNewIndexMap.get(prevChild.key);\r\n                }\r\n                else {\r\n                    // key-less node, try to locate a key-less node of the same type\r\n                    for (j = s2; j <= e2; j++) {\r\n                        if (newIndexToOldIndexMap[j - s2] === 0 &&\r\n                            isSameVNodeType(prevChild, c2[j])) {\r\n                            newIndex = j;\r\n                            break;\r\n                        }\r\n                    }\r\n                }\r\n                if (newIndex === undefined) {\r\n                    unmount(prevChild, parentComponent, parentSuspense, true);\r\n                }\r\n                else {\r\n                    newIndexToOldIndexMap[newIndex - s2] = i + 1;\r\n                    if (newIndex >= maxNewIndexSoFar) {\r\n                        maxNewIndexSoFar = newIndex;\r\n                    }\r\n                    else {\r\n                        moved = true;\r\n                    }\r\n                    patch(prevChild, c2[newIndex], container, null, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n                    patched++;\r\n                }\r\n            }\r\n            // 5.3 move and mount\r\n            // generate longest stable subsequence only when nodes have moved\r\n            const increasingNewIndexSequence = moved\r\n                ? getSequence(newIndexToOldIndexMap)\r\n                : shared.EMPTY_ARR;\r\n            j = increasingNewIndexSequence.length - 1;\r\n            // looping backwards so that we can use last patched node as anchor\r\n            for (i = toBePatched - 1; i >= 0; i--) {\r\n                const nextIndex = s2 + i;\r\n                const nextChild = c2[nextIndex];\r\n                const anchor = nextIndex + 1 < l2 ? c2[nextIndex + 1].el : parentAnchor;\r\n                if (newIndexToOldIndexMap[i] === 0) {\r\n                    // mount new\r\n                    patch(null, nextChild, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n                }\r\n                else if (moved) {\r\n                    // move if:\r\n                    // There is no stable subsequence (e.g. a reverse)\r\n                    // OR current node is not among the stable sequence\r\n                    if (j < 0 || i !== increasingNewIndexSequence[j]) {\r\n                        move(nextChild, container, anchor, 2 /* REORDER */);\r\n                    }\r\n                    else {\r\n                        j--;\r\n                    }\r\n                }\r\n            }\r\n        }\r\n    };\r\n    const move = (vnode, container, anchor, moveType, parentSuspense = null) => {\r\n        const { el, type, transition, children, shapeFlag } = vnode;\r\n        if (shapeFlag & 6 /* COMPONENT */) {\r\n            move(vnode.component.subTree, container, anchor, moveType);\r\n            return;\r\n        }\r\n        if (shapeFlag & 128 /* SUSPENSE */) {\r\n            vnode.suspense.move(container, anchor, moveType);\r\n            return;\r\n        }\r\n        if (shapeFlag & 64 /* TELEPORT */) {\r\n            type.move(vnode, container, anchor, internals);\r\n            return;\r\n        }\r\n        if (type === Fragment) {\r\n            hostInsert(el, container, anchor);\r\n            for (let i = 0; i < children.length; i++) {\r\n                move(children[i], container, anchor, moveType);\r\n            }\r\n            hostInsert(vnode.anchor, container, anchor);\r\n            return;\r\n        }\r\n        if (type === Static) {\r\n            moveStaticNode(vnode, container, anchor);\r\n            return;\r\n        }\r\n        // single nodes\r\n        const needTransition = moveType !== 2 /* REORDER */ &&\r\n            shapeFlag & 1 /* ELEMENT */ &&\r\n            transition;\r\n        if (needTransition) {\r\n            if (moveType === 0 /* ENTER */) {\r\n                transition.beforeEnter(el);\r\n                hostInsert(el, container, anchor);\r\n                queuePostRenderEffect(() => transition.enter(el), parentSuspense);\r\n            }\r\n            else {\r\n                const { leave, delayLeave, afterLeave } = transition;\r\n                const remove = () => hostInsert(el, container, anchor);\r\n                const performLeave = () => {\r\n                    leave(el, () => {\r\n                        remove();\r\n                        afterLeave && afterLeave();\r\n                    });\r\n                };\r\n                if (delayLeave) {\r\n                    delayLeave(el, remove, performLeave);\r\n                }\r\n                else {\r\n                    performLeave();\r\n                }\r\n            }\r\n        }\r\n        else {\r\n            hostInsert(el, container, anchor);\r\n        }\r\n    };\r\n    const unmount = (vnode, parentComponent, parentSuspense, doRemove = false, optimized = false) => {\r\n        const { type, props, ref, children, dynamicChildren, shapeFlag, patchFlag, dirs } = vnode;\r\n        // unset ref\r\n        if (ref != null) {\r\n            setRef(ref, null, parentSuspense, vnode, true);\r\n        }\r\n        if (shapeFlag & 256 /* COMPONENT_SHOULD_KEEP_ALIVE */) {\r\n            parentComponent.ctx.deactivate(vnode);\r\n            return;\r\n        }\r\n        const shouldInvokeDirs = shapeFlag & 1 /* ELEMENT */ && dirs;\r\n        let vnodeHook;\r\n        if ((vnodeHook = props && props.onVnodeBeforeUnmount)) {\r\n            invokeVNodeHook(vnodeHook, parentComponent, vnode);\r\n        }\r\n        if (shapeFlag & 6 /* COMPONENT */) {\r\n            unmountComponent(vnode.component, parentSuspense, doRemove);\r\n        }\r\n        else {\r\n            if (shapeFlag & 128 /* SUSPENSE */) {\r\n                vnode.suspense.unmount(parentSuspense, doRemove);\r\n                return;\r\n            }\r\n            if (shouldInvokeDirs) {\r\n                invokeDirectiveHook(vnode, null, parentComponent, 'beforeUnmount');\r\n            }\r\n            if (shapeFlag & 64 /* TELEPORT */) {\r\n                vnode.type.remove(vnode, parentComponent, parentSuspense, optimized, internals, doRemove);\r\n            }\r\n            else if (dynamicChildren &&\r\n                // #1153: fast path should not be taken for non-stable (v-for) fragments\r\n                (type !== Fragment ||\r\n                    (patchFlag > 0 && patchFlag & 64 /* STABLE_FRAGMENT */))) {\r\n                // fast path for block nodes: only need to unmount dynamic children.\r\n                unmountChildren(dynamicChildren, parentComponent, parentSuspense, false, true);\r\n            }\r\n            else if ((type === Fragment &&\r\n                (patchFlag & 128 /* KEYED_FRAGMENT */ ||\r\n                    patchFlag & 256 /* UNKEYED_FRAGMENT */)) ||\r\n                (!optimized && shapeFlag & 16 /* ARRAY_CHILDREN */)) {\r\n                unmountChildren(children, parentComponent, parentSuspense);\r\n            }\r\n            if (doRemove) {\r\n                remove(vnode);\r\n            }\r\n        }\r\n        if ((vnodeHook = props && props.onVnodeUnmounted) || shouldInvokeDirs) {\r\n            queuePostRenderEffect(() => {\r\n                vnodeHook && invokeVNodeHook(vnodeHook, parentComponent, vnode);\r\n                shouldInvokeDirs &&\r\n                    invokeDirectiveHook(vnode, null, parentComponent, 'unmounted');\r\n            }, parentSuspense);\r\n        }\r\n    };\r\n    const remove = vnode => {\r\n        const { type, el, anchor, transition } = vnode;\r\n        if (type === Fragment) {\r\n            removeFragment(el, anchor);\r\n            return;\r\n        }\r\n        if (type === Static) {\r\n            removeStaticNode(vnode);\r\n            return;\r\n        }\r\n        const performRemove = () => {\r\n            hostRemove(el);\r\n            if (transition && !transition.persisted && transition.afterLeave) {\r\n                transition.afterLeave();\r\n            }\r\n        };\r\n        if (vnode.shapeFlag & 1 /* ELEMENT */ &&\r\n            transition &&\r\n            !transition.persisted) {\r\n            const { leave, delayLeave } = transition;\r\n            const performLeave = () => leave(el, performRemove);\r\n            if (delayLeave) {\r\n                delayLeave(vnode.el, performRemove, performLeave);\r\n            }\r\n            else {\r\n                performLeave();\r\n            }\r\n        }\r\n        else {\r\n            performRemove();\r\n        }\r\n    };\r\n    const removeFragment = (cur, end) => {\r\n        // For fragments, directly remove all contained DOM nodes.\r\n        // (fragment child nodes cannot have transition)\r\n        let next;\r\n        while (cur !== end) {\r\n            next = hostNextSibling(cur);\r\n            hostRemove(cur);\r\n            cur = next;\r\n        }\r\n        hostRemove(end);\r\n    };\r\n    const unmountComponent = (instance, parentSuspense, doRemove) => {\r\n        const { bum, effects, update, subTree, um } = instance;\r\n        // beforeUnmount hook\r\n        if (bum) {\r\n            shared.invokeArrayFns(bum);\r\n        }\r\n        if (effects) {\r\n            for (let i = 0; i < effects.length; i++) {\r\n                reactivity.stop(effects[i]);\r\n            }\r\n        }\r\n        // update may be null if a component is unmounted before its async\r\n        // setup has resolved.\r\n        if (update) {\r\n            reactivity.stop(update);\r\n            unmount(subTree, instance, parentSuspense, doRemove);\r\n        }\r\n        // unmounted hook\r\n        if (um) {\r\n            queuePostRenderEffect(um, parentSuspense);\r\n        }\r\n        queuePostRenderEffect(() => {\r\n            instance.isUnmounted = true;\r\n        }, parentSuspense);\r\n        // A component with async dep inside a pending suspense is unmounted before\r\n        // its async dep resolves. This should remove the dep from the suspense, and\r\n        // cause the suspense to resolve immediately if that was the last dep.\r\n        if (parentSuspense &&\r\n            parentSuspense.pendingBranch &&\r\n            !parentSuspense.isUnmounted &&\r\n            instance.asyncDep &&\r\n            !instance.asyncResolved &&\r\n            instance.suspenseId === parentSuspense.pendingId) {\r\n            parentSuspense.deps--;\r\n            if (parentSuspense.deps === 0) {\r\n                parentSuspense.resolve();\r\n            }\r\n        }\r\n    };\r\n    const unmountChildren = (children, parentComponent, parentSuspense, doRemove = false, optimized = false, start = 0) => {\r\n        for (let i = start; i < children.length; i++) {\r\n            unmount(children[i], parentComponent, parentSuspense, doRemove, optimized);\r\n        }\r\n    };\r\n    const getNextHostNode = vnode => {\r\n        if (vnode.shapeFlag & 6 /* COMPONENT */) {\r\n            return getNextHostNode(vnode.component.subTree);\r\n        }\r\n        if (vnode.shapeFlag & 128 /* SUSPENSE */) {\r\n            return vnode.suspense.next();\r\n        }\r\n        return hostNextSibling((vnode.anchor || vnode.el));\r\n    };\r\n    const render = (vnode, container, isSVG) => {\r\n        if (vnode == null) {\r\n            if (container._vnode) {\r\n                unmount(container._vnode, null, null, true);\r\n            }\r\n        }\r\n        else {\r\n            patch(container._vnode || null, vnode, container, null, null, null, isSVG);\r\n        }\r\n        flushPostFlushCbs();\r\n        container._vnode = vnode;\r\n    };\r\n    const internals = {\r\n        p: patch,\r\n        um: unmount,\r\n        m: move,\r\n        r: remove,\r\n        mt: mountComponent,\r\n        mc: mountChildren,\r\n        pc: patchChildren,\r\n        pbc: patchBlockChildren,\r\n        n: getNextHostNode,\r\n        o: options\r\n    };\r\n    let hydrate;\r\n    let hydrateNode;\r\n    if (createHydrationFns) {\r\n        [hydrate, hydrateNode] = createHydrationFns(internals);\r\n    }\r\n    return {\r\n        render,\r\n        hydrate,\r\n        createApp: createAppAPI(render, hydrate)\r\n    };\r\n}\r\nfunction invokeVNodeHook(hook, instance, vnode, prevVNode = null) {\r\n    callWithAsyncErrorHandling(hook, instance, 7 /* VNODE_HOOK */, [\r\n        vnode,\r\n        prevVNode\r\n    ]);\r\n}\r\n/**\r\n * #1156\r\n * When a component is HMR-enabled, we need to make sure that all static nodes\r\n * inside a block also inherit the DOM element from the previous tree so that\r\n * HMR updates (which are full updates) can retrieve the element for patching.\r\n *\r\n * #2080\r\n * Inside keyed `template` fragment static children, if a fragment is moved,\r\n * the children will always moved so that need inherit el form previous nodes\r\n * to ensure correct moved position.\r\n */\r\nfunction traverseStaticChildren(n1, n2, shallow = false) {\r\n    const ch1 = n1.children;\r\n    const ch2 = n2.children;\r\n    if (shared.isArray(ch1) && shared.isArray(ch2)) {\r\n        for (let i = 0; i < ch1.length; i++) {\r\n            // this is only called in the optimized path so array children are\r\n            // guaranteed to be vnodes\r\n            const c1 = ch1[i];\r\n            let c2 = ch2[i];\r\n            if (c2.shapeFlag & 1 /* ELEMENT */ && !c2.dynamicChildren) {\r\n                if (c2.patchFlag <= 0 || c2.patchFlag === 32 /* HYDRATE_EVENTS */) {\r\n                    c2 = ch2[i] = cloneIfMounted(ch2[i]);\r\n                    c2.el = c1.el;\r\n                }\r\n                if (!shallow)\r\n                    traverseStaticChildren(c1, c2);\r\n            }\r\n        }\r\n    }\r\n}\r\n// https://en.wikipedia.org/wiki/Longest_increasing_subsequence\r\nfunction getSequence(arr) {\r\n    const p = arr.slice();\r\n    const result = [0];\r\n    let i, j, u, v, c;\r\n    const len = arr.length;\r\n    for (i = 0; i < len; i++) {\r\n        const arrI = arr[i];\r\n        if (arrI !== 0) {\r\n            j = result[result.length - 1];\r\n            if (arr[j] < arrI) {\r\n                p[i] = j;\r\n                result.push(i);\r\n                continue;\r\n            }\r\n            u = 0;\r\n            v = result.length - 1;\r\n            while (u < v) {\r\n                c = ((u + v) / 2) | 0;\r\n                if (arr[result[c]] < arrI) {\r\n                    u = c + 1;\r\n                }\r\n                else {\r\n                    v = c;\r\n                }\r\n            }\r\n            if (arrI < arr[result[u]]) {\r\n                if (u > 0) {\r\n                    p[i] = result[u - 1];\r\n                }\r\n                result[u] = i;\r\n            }\r\n        }\r\n    }\r\n    u = result.length;\r\n    v = result[u - 1];\r\n    while (u-- > 0) {\r\n        result[u] = v;\r\n        v = p[v];\r\n    }\r\n    return result;\r\n}\n\nconst isTeleport = (type) => type.__isTeleport;\r\nconst isTeleportDisabled = (props) => props && (props.disabled || props.disabled === '');\r\nconst isTargetSVG = (target) => typeof SVGElement !== 'undefined' && target instanceof SVGElement;\r\nconst resolveTarget = (props, select) => {\r\n    const targetSelector = props && props.to;\r\n    if (shared.isString(targetSelector)) {\r\n        if (!select) {\r\n            return null;\r\n        }\r\n        else {\r\n            const target = select(targetSelector);\r\n            return target;\r\n        }\r\n    }\r\n    else {\r\n        return targetSelector;\r\n    }\r\n};\r\nconst TeleportImpl = {\r\n    __isTeleport: true,\r\n    process(n1, n2, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized, internals) {\r\n        const { mc: mountChildren, pc: patchChildren, pbc: patchBlockChildren, o: { insert, querySelector, createText, createComment } } = internals;\r\n        const disabled = isTeleportDisabled(n2.props);\r\n        let { shapeFlag, children, dynamicChildren } = n2;\r\n        if (n1 == null) {\r\n            // insert anchors in the main view\r\n            const placeholder = (n2.el = createText(''));\r\n            const mainAnchor = (n2.anchor = createText(''));\r\n            insert(placeholder, container, anchor);\r\n            insert(mainAnchor, container, anchor);\r\n            const target = (n2.target = resolveTarget(n2.props, querySelector));\r\n            const targetAnchor = (n2.targetAnchor = createText(''));\r\n            if (target) {\r\n                insert(targetAnchor, target);\r\n                // #2652 we could be teleporting from a non-SVG tree into an SVG tree\r\n                isSVG = isSVG || isTargetSVG(target);\r\n            }\r\n            const mount = (container, anchor) => {\r\n                // Teleport *always* has Array children. This is enforced in both the\r\n                // compiler and vnode children normalization.\r\n                if (shapeFlag & 16 /* ARRAY_CHILDREN */) {\r\n                    mountChildren(children, container, anchor, parentComponent, parentSuspense, isSVG, slotScopeIds, optimized);\r\n                }\r\n            };\r\n            if (disabled) {\r\n                mount(container, mainAnchor);\r\n            }\r\n            else if (target) {\r\n                mount(target, targetAnchor);\r\n            }\r\n        }\r\n        else {\r\n            // update content\r\n            n2.el = n1.el;\r\n            const mainAnchor = (n2.anchor = n1.anchor);\r\n            const target = (n2.target = n1.target);\r\n            const targetAnchor = (n2.targetAnchor = n1.targetAnchor);\r\n            const wasDisabled = isTeleportDisabled(n1.props);\r\n            const currentContainer = wasDisabled ? container : target;\r\n            const currentAnchor = wasDisabled ? mainAnchor : targetAnchor;\r\n            isSVG = isSVG || isTargetSVG(target);\r\n            if (dynamicChildren) {\r\n                // fast path when the teleport happens to be a block root\r\n                patchBlockChildren(n1.dynamicChildren, dynamicChildren, currentContainer, parentComponent, parentSuspense, isSVG, slotScopeIds);\r\n                // even in block tree mode we need to make sure all root-level nodes\r\n                // in the teleport inherit previous DOM references so that they can\r\n                // be moved in future patches.\r\n                traverseStaticChildren(n1, n2, true);\r\n            }\r\n            else if (!optimized) {\r\n                patchChildren(n1, n2, currentContainer, currentAnchor, parentComponent, parentSuspense, isSVG, slotScopeIds, false);\r\n            }\r\n            if (disabled) {\r\n                if (!wasDisabled) {\r\n                    // enabled -> disabled\r\n                    // move into main container\r\n                    moveTeleport(n2, container, mainAnchor, internals, 1 /* TOGGLE */);\r\n                }\r\n            }\r\n            else {\r\n                // target changed\r\n                if ((n2.props && n2.props.to) !== (n1.props && n1.props.to)) {\r\n                    const nextTarget = (n2.target = resolveTarget(n2.props, querySelector));\r\n                    if (nextTarget) {\r\n                        moveTeleport(n2, nextTarget, null, internals, 0 /* TARGET_CHANGE */);\r\n                    }\r\n                }\r\n                else if (wasDisabled) {\r\n                    // disabled -> enabled\r\n                    // move into teleport target\r\n                    moveTeleport(n2, target, targetAnchor, internals, 1 /* TOGGLE */);\r\n                }\r\n            }\r\n        }\r\n    },\r\n    remove(vnode, parentComponent, parentSuspense, optimized, { um: unmount, o: { remove: hostRemove } }, doRemove) {\r\n        const { shapeFlag, children, anchor, targetAnchor, target, props } = vnode;\r\n        if (target) {\r\n            hostRemove(targetAnchor);\r\n        }\r\n        // an unmounted teleport should always remove its children if not disabled\r\n        if (doRemove || !isTeleportDisabled(props)) {\r\n            hostRemove(anchor);\r\n            if (shapeFlag & 16 /* ARRAY_CHILDREN */) {\r\n                for (let i = 0; i < children.length; i++) {\r\n                    const child = children[i];\r\n                    unmount(child, parentComponent, parentSuspense, true, !!child.dynamicChildren);\r\n                }\r\n            }\r\n        }\r\n    },\r\n    move: moveTeleport,\r\n    hydrate: hydrateTeleport\r\n};\r\nfunction moveTeleport(vnode, container, parentAnchor, { o: { insert }, m: move }, moveType = 2 /* REORDER */) {\r\n    // move target anchor if this is a target change.\r\n    if (moveType === 0 /* TARGET_CHANGE */) {\r\n        insert(vnode.targetAnchor, container, parentAnchor);\r\n    }\r\n    const { el, anchor, shapeFlag, children, props } = vnode;\r\n    const isReorder = moveType === 2 /* REORDER */;\r\n    // move main view anchor if this is a re-order.\r\n    if (isReorder) {\r\n        insert(el, container, parentAnchor);\r\n    }\r\n    // if this is a re-order and teleport is enabled (content is in target)\r\n    // do not move children. So the opposite is: only move children if this\r\n    // is not a reorder, or the teleport is disabled\r\n    if (!isReorder || isTeleportDisabled(props)) {\r\n        // Teleport has either Array children or no children.\r\n        if (shapeFlag & 16 /* ARRAY_CHILDREN */) {\r\n            for (let i = 0; i < children.length; i++) {\r\n                move(children[i], container, parentAnchor, 2 /* REORDER */);\r\n            }\r\n        }\r\n    }\r\n    // move main view anchor if this is a re-order.\r\n    if (isReorder) {\r\n        insert(anchor, container, parentAnchor);\r\n    }\r\n}\r\nfunction hydrateTeleport(node, vnode, parentComponent, parentSuspense, slotScopeIds, optimized, { o: { nextSibling, parentNode, querySelector } }, hydrateChildren) {\r\n    const target = (vnode.target = resolveTarget(vnode.props, querySelector));\r\n    if (target) {\r\n        // if multiple teleports rendered to the same target element, we need to\r\n        // pick up from where the last teleport finished instead of the first node\r\n        const targetNode = target._lpa || target.firstChild;\r\n        if (vnode.shapeFlag & 16 /* ARRAY_CHILDREN */) {\r\n            if (isTeleportDisabled(vnode.props)) {\r\n                vnode.anchor = hydrateChildren(nextSibling(node), vnode, parentNode(node), parentComponent, parentSuspense, slotScopeIds, optimized);\r\n                vnode.targetAnchor = targetNode;\r\n            }\r\n            else {\r\n                vnode.anchor = nextSibling(node);\r\n                vnode.targetAnchor = hydrateChildren(targetNode, vnode, target, parentComponent, parentSuspense, slotScopeIds, optimized);\r\n            }\r\n            target._lpa =\r\n                vnode.targetAnchor && nextSibling(vnode.targetAnchor);\r\n        }\r\n    }\r\n    return vnode.anchor && nextSibling(vnode.anchor);\r\n}\r\n// Force-casted public typing for h and TSX props inference\r\nconst Teleport = TeleportImpl;\n\nconst COMPONENTS = 'components';\r\nconst DIRECTIVES = 'directives';\r\n/**\r\n * @private\r\n */\r\nfunction resolveComponent(name, maybeSelfReference) {\r\n    return resolveAsset(COMPONENTS, name, true, maybeSelfReference) || name;\r\n}\r\nconst NULL_DYNAMIC_COMPONENT = Symbol();\r\n/**\r\n * @private\r\n */\r\nfunction resolveDynamicComponent(component) {\r\n    if (shared.isString(component)) {\r\n        return resolveAsset(COMPONENTS, component, false) || component;\r\n    }\r\n    else {\r\n        // invalid types will fallthrough to createVNode and raise warning\r\n        return (component || NULL_DYNAMIC_COMPONENT);\r\n    }\r\n}\r\n/**\r\n * @private\r\n */\r\nfunction resolveDirective(name) {\r\n    return resolveAsset(DIRECTIVES, name);\r\n}\r\n// implementation\r\nfunction resolveAsset(type, name, warnMissing = true, maybeSelfReference = false) {\r\n    const instance = currentRenderingInstance || currentInstance;\r\n    if (instance) {\r\n        const Component = instance.type;\r\n        // explicit self name has highest priority\r\n        if (type === COMPONENTS) {\r\n            const selfName = getComponentName(Component);\r\n            if (selfName &&\r\n                (selfName === name ||\r\n                    selfName === shared.camelize(name) ||\r\n                    selfName === shared.capitalize(shared.camelize(name)))) {\r\n                return Component;\r\n            }\r\n        }\r\n        const res = \r\n        // local registration\r\n        // check instance[type] first which is resolved for options API\r\n        resolve(instance[type] || Component[type], name) ||\r\n            // global registration\r\n            resolve(instance.appContext[type], name);\r\n        if (!res && maybeSelfReference) {\r\n            // fallback to implicit self-reference\r\n            return Component;\r\n        }\r\n        return res;\r\n    }\r\n}\r\nfunction resolve(registry, name) {\r\n    return (registry &&\r\n        (registry[name] ||\r\n            registry[shared.camelize(name)] ||\r\n            registry[shared.capitalize(shared.camelize(name))]));\r\n}\n\nconst Fragment = Symbol(undefined);\r\nconst Text = Symbol(undefined);\r\nconst Comment$1 = Symbol(undefined);\r\nconst Static = Symbol(undefined);\r\n// Since v-if and v-for are the two possible ways node structure can dynamically\r\n// change, once we consider v-if branches and each v-for fragment a block, we\r\n// can divide a template into nested blocks, and within each block the node\r\n// structure would be stable. This allows us to skip most children diffing\r\n// and only worry about the dynamic nodes (indicated by patch flags).\r\nconst blockStack = [];\r\nlet currentBlock = null;\r\n/**\r\n * Open a block.\r\n * This must be called before `createBlock`. It cannot be part of `createBlock`\r\n * because the children of the block are evaluated before `createBlock` itself\r\n * is called. The generated code typically looks like this:\r\n *\r\n * ```js\r\n * function render() {\r\n *   return (openBlock(),createBlock('div', null, [...]))\r\n * }\r\n * ```\r\n * disableTracking is true when creating a v-for fragment block, since a v-for\r\n * fragment always diffs its children.\r\n *\r\n * @private\r\n */\r\nfunction openBlock(disableTracking = false) {\r\n    blockStack.push((currentBlock = disableTracking ? null : []));\r\n}\r\nfunction closeBlock() {\r\n    blockStack.pop();\r\n    currentBlock = blockStack[blockStack.length - 1] || null;\r\n}\r\n// Whether we should be tracking dynamic child nodes inside a block.\r\n// Only tracks when this value is > 0\r\n// We are not using a simple boolean because this value may need to be\r\n// incremented/decremented by nested usage of v-once (see below)\r\nlet isBlockTreeEnabled = 1;\r\n/**\r\n * Block tracking sometimes needs to be disabled, for example during the\r\n * creation of a tree that needs to be cached by v-once. The compiler generates\r\n * code like this:\r\n *\r\n * ``` js\r\n * _cache[1] || (\r\n *   setBlockTracking(-1),\r\n *   _cache[1] = createVNode(...),\r\n *   setBlockTracking(1),\r\n *   _cache[1]\r\n * )\r\n * ```\r\n *\r\n * @private\r\n */\r\nfunction setBlockTracking(value) {\r\n    isBlockTreeEnabled += value;\r\n}\r\n/**\r\n * Create a block root vnode. Takes the same exact arguments as `createVNode`.\r\n * A block root keeps track of dynamic nodes within the block in the\r\n * `dynamicChildren` array.\r\n *\r\n * @private\r\n */\r\nfunction createBlock(type, props, children, patchFlag, dynamicProps) {\r\n    const vnode = createVNode(type, props, children, patchFlag, dynamicProps, true /* isBlock: prevent a block from tracking itself */);\r\n    // save current block children on the block vnode\r\n    vnode.dynamicChildren =\r\n        isBlockTreeEnabled > 0 ? currentBlock || shared.EMPTY_ARR : null;\r\n    // close block\r\n    closeBlock();\r\n    // a block is always going to be patched, so track it as a child of its\r\n    // parent block\r\n    if (isBlockTreeEnabled > 0 && currentBlock) {\r\n        currentBlock.push(vnode);\r\n    }\r\n    return vnode;\r\n}\r\nfunction isVNode(value) {\r\n    return value ? value.__v_isVNode === true : false;\r\n}\r\nfunction isSameVNodeType(n1, n2) {\r\n    return n1.type === n2.type && n1.key === n2.key;\r\n}\r\n/**\r\n * Internal API for registering an arguments transform for createVNode\r\n * used for creating stubs in the test-utils\r\n * It is *internal* but needs to be exposed for test-utils to pick up proper\r\n * typings\r\n */\r\nfunction transformVNodeArgs(transformer) {\r\n}\r\nconst InternalObjectKey = `__vInternal`;\r\nconst normalizeKey = ({ key }) => key != null ? key : null;\r\nconst normalizeRef = ({ ref }) => {\r\n    return (ref != null\r\n        ? shared.isString(ref) || reactivity.isRef(ref) || shared.isFunction(ref)\r\n            ? { i: currentRenderingInstance, r: ref }\r\n            : ref\r\n        : null);\r\n};\r\nconst createVNode = (_createVNode);\r\nfunction _createVNode(type, props = null, children = null, patchFlag = 0, dynamicProps = null, isBlockNode = false) {\r\n    if (!type || type === NULL_DYNAMIC_COMPONENT) {\r\n        type = Comment$1;\r\n    }\r\n    if (isVNode(type)) {\r\n        // createVNode receiving an existing vnode. This happens in cases like\r\n        // <component :is=\"vnode\"/>\r\n        // #2078 make sure to merge refs during the clone instead of overwriting it\r\n        const cloned = cloneVNode(type, props, true /* mergeRef: true */);\r\n        if (children) {\r\n            normalizeChildren(cloned, children);\r\n        }\r\n        return cloned;\r\n    }\r\n    // class component normalization.\r\n    if (isClassComponent(type)) {\r\n        type = type.__vccOpts;\r\n    }\r\n    // class & style normalization.\r\n    if (props) {\r\n        // for reactive or proxy objects, we need to clone it to enable mutation.\r\n        if (reactivity.isProxy(props) || InternalObjectKey in props) {\r\n            props = shared.extend({}, props);\r\n        }\r\n        let { class: klass, style } = props;\r\n        if (klass && !shared.isString(klass)) {\r\n            props.class = shared.normalizeClass(klass);\r\n        }\r\n        if (shared.isObject(style)) {\r\n            // reactive state objects need to be cloned since they are likely to be\r\n            // mutated\r\n            if (reactivity.isProxy(style) && !shared.isArray(style)) {\r\n                style = shared.extend({}, style);\r\n            }\r\n            props.style = shared.normalizeStyle(style);\r\n        }\r\n    }\r\n    // encode the vnode type information into a bitmap\r\n    const shapeFlag = shared.isString(type)\r\n        ? 1 /* ELEMENT */\r\n        : isSuspense(type)\r\n            ? 128 /* SUSPENSE */\r\n            : isTeleport(type)\r\n                ? 64 /* TELEPORT */\r\n                : shared.isObject(type)\r\n                    ? 4 /* STATEFUL_COMPONENT */\r\n                    : shared.isFunction(type)\r\n                        ? 2 /* FUNCTIONAL_COMPONENT */\r\n                        : 0;\r\n    const vnode = {\r\n        __v_isVNode: true,\r\n        __v_skip: true,\r\n        type,\r\n        props,\r\n        key: props && normalizeKey(props),\r\n        ref: props && normalizeRef(props),\r\n        scopeId: currentScopeId,\r\n        slotScopeIds: null,\r\n        children: null,\r\n        component: null,\r\n        suspense: null,\r\n        ssContent: null,\r\n        ssFallback: null,\r\n        dirs: null,\r\n        transition: null,\r\n        el: null,\r\n        anchor: null,\r\n        target: null,\r\n        targetAnchor: null,\r\n        staticCount: 0,\r\n        shapeFlag,\r\n        patchFlag,\r\n        dynamicProps,\r\n        dynamicChildren: null,\r\n        appContext: null\r\n    };\r\n    normalizeChildren(vnode, children);\r\n    // normalize suspense children\r\n    if (shapeFlag & 128 /* SUSPENSE */) {\r\n        type.normalize(vnode);\r\n    }\r\n    if (isBlockTreeEnabled > 0 &&\r\n        // avoid a block node from tracking itself\r\n        !isBlockNode &&\r\n        // has current parent block\r\n        currentBlock &&\r\n        // presence of a patch flag indicates this node needs patching on updates.\r\n        // component nodes also should always be patched, because even if the\r\n        // component doesn't need to update, it needs to persist the instance on to\r\n        // the next vnode so that it can be properly unmounted later.\r\n        (patchFlag > 0 || shapeFlag & 6 /* COMPONENT */) &&\r\n        // the EVENTS flag is only for hydration and if it is the only flag, the\r\n        // vnode should not be considered dynamic due to handler caching.\r\n        patchFlag !== 32 /* HYDRATE_EVENTS */) {\r\n        currentBlock.push(vnode);\r\n    }\r\n    return vnode;\r\n}\r\nfunction cloneVNode(vnode, extraProps, mergeRef = false) {\r\n    // This is intentionally NOT using spread or extend to avoid the runtime\r\n    // key enumeration cost.\r\n    const { props, ref, patchFlag, children } = vnode;\r\n    const mergedProps = extraProps ? mergeProps(props || {}, extraProps) : props;\r\n    const cloned = {\r\n        __v_isVNode: true,\r\n        __v_skip: true,\r\n        type: vnode.type,\r\n        props: mergedProps,\r\n        key: mergedProps && normalizeKey(mergedProps),\r\n        ref: extraProps && extraProps.ref\r\n            ? // #2078 in the case of <component :is=\"vnode\" ref=\"extra\"/>\r\n                // if the vnode itself already has a ref, cloneVNode will need to merge\r\n                // the refs so the single vnode can be set on multiple refs\r\n                mergeRef && ref\r\n                    ? shared.isArray(ref)\r\n                        ? ref.concat(normalizeRef(extraProps))\r\n                        : [ref, normalizeRef(extraProps)]\r\n                    : normalizeRef(extraProps)\r\n            : ref,\r\n        scopeId: vnode.scopeId,\r\n        slotScopeIds: vnode.slotScopeIds,\r\n        children: children,\r\n        target: vnode.target,\r\n        targetAnchor: vnode.targetAnchor,\r\n        staticCount: vnode.staticCount,\r\n        shapeFlag: vnode.shapeFlag,\r\n        // if the vnode is cloned with extra props, we can no longer assume its\r\n        // existing patch flag to be reliable and need to add the FULL_PROPS flag.\r\n        // note: perserve flag for fragments since they use the flag for children\r\n        // fast paths only.\r\n        patchFlag: extraProps && vnode.type !== Fragment\r\n            ? patchFlag === -1 // hoisted node\r\n                ? 16 /* FULL_PROPS */\r\n                : patchFlag | 16 /* FULL_PROPS */\r\n            : patchFlag,\r\n        dynamicProps: vnode.dynamicProps,\r\n        dynamicChildren: vnode.dynamicChildren,\r\n        appContext: vnode.appContext,\r\n        dirs: vnode.dirs,\r\n        transition: vnode.transition,\r\n        // These should technically only be non-null on mounted VNodes. However,\r\n        // they *should* be copied for kept-alive vnodes. So we just always copy\r\n        // them since them being non-null during a mount doesn't affect the logic as\r\n        // they will simply be overwritten.\r\n        component: vnode.component,\r\n        suspense: vnode.suspense,\r\n        ssContent: vnode.ssContent && cloneVNode(vnode.ssContent),\r\n        ssFallback: vnode.ssFallback && cloneVNode(vnode.ssFallback),\r\n        el: vnode.el,\r\n        anchor: vnode.anchor\r\n    };\r\n    return cloned;\r\n}\r\n/**\r\n * @private\r\n */\r\nfunction createTextVNode(text = ' ', flag = 0) {\r\n    return createVNode(Text, null, text, flag);\r\n}\r\n/**\r\n * @private\r\n */\r\nfunction createStaticVNode(content, numberOfNodes) {\r\n    // A static vnode can contain multiple stringified elements, and the number\r\n    // of elements is necessary for hydration.\r\n    const vnode = createVNode(Static, null, content);\r\n    vnode.staticCount = numberOfNodes;\r\n    return vnode;\r\n}\r\n/**\r\n * @private\r\n */\r\nfunction createCommentVNode(text = '', \r\n// when used as the v-else branch, the comment node must be created as a\r\n// block to ensure correct updates.\r\nasBlock = false) {\r\n    return asBlock\r\n        ? (openBlock(), createBlock(Comment$1, null, text))\r\n        : createVNode(Comment$1, null, text);\r\n}\r\nfunction normalizeVNode(child) {\r\n    if (child == null || typeof child === 'boolean') {\r\n        // empty placeholder\r\n        return createVNode(Comment$1);\r\n    }\r\n    else if (shared.isArray(child)) {\r\n        // fragment\r\n        return createVNode(Fragment, null, \r\n        // #3666, avoid reference pollution when reusing vnode\r\n        child.slice());\r\n    }\r\n    else if (typeof child === 'object') {\r\n        // already vnode, this should be the most common since compiled templates\r\n        // always produce all-vnode children arrays\r\n        return cloneIfMounted(child);\r\n    }\r\n    else {\r\n        // strings and numbers\r\n        return createVNode(Text, null, String(child));\r\n    }\r\n}\r\n// optimized normalization for template-compiled render fns\r\nfunction cloneIfMounted(child) {\r\n    return child.el === null ? child : cloneVNode(child);\r\n}\r\nfunction normalizeChildren(vnode, children) {\r\n    let type = 0;\r\n    const { shapeFlag } = vnode;\r\n    if (children == null) {\r\n        children = null;\r\n    }\r\n    else if (shared.isArray(children)) {\r\n        type = 16 /* ARRAY_CHILDREN */;\r\n    }\r\n    else if (typeof children === 'object') {\r\n        if (shapeFlag & 1 /* ELEMENT */ || shapeFlag & 64 /* TELEPORT */) {\r\n            // Normalize slot to plain children for plain element and Teleport\r\n            const slot = children.default;\r\n            if (slot) {\r\n                // _c marker is added by withCtx() indicating this is a compiled slot\r\n                slot._c && (slot._d = false);\r\n                normalizeChildren(vnode, slot());\r\n                slot._c && (slot._d = true);\r\n            }\r\n            return;\r\n        }\r\n        else {\r\n            type = 32 /* SLOTS_CHILDREN */;\r\n            const slotFlag = children._;\r\n            if (!slotFlag && !(InternalObjectKey in children)) {\r\n                children._ctx = currentRenderingInstance;\r\n            }\r\n            else if (slotFlag === 3 /* FORWARDED */ && currentRenderingInstance) {\r\n                // a child component receives forwarded slots from the parent.\r\n                // its slot type is determined by its parent's slot type.\r\n                if (currentRenderingInstance.slots._ === 1 /* STABLE */) {\r\n                    children._ = 1 /* STABLE */;\r\n                }\r\n                else {\r\n                    children._ = 2 /* DYNAMIC */;\r\n                    vnode.patchFlag |= 1024 /* DYNAMIC_SLOTS */;\r\n                }\r\n            }\r\n        }\r\n    }\r\n    else if (shared.isFunction(children)) {\r\n        children = { default: children, _ctx: currentRenderingInstance };\r\n        type = 32 /* SLOTS_CHILDREN */;\r\n    }\r\n    else {\r\n        children = String(children);\r\n        // force teleport children to array so it can be moved around\r\n        if (shapeFlag & 64 /* TELEPORT */) {\r\n            type = 16 /* ARRAY_CHILDREN */;\r\n            children = [createTextVNode(children)];\r\n        }\r\n        else {\r\n            type = 8 /* TEXT_CHILDREN */;\r\n        }\r\n    }\r\n    vnode.children = children;\r\n    vnode.shapeFlag |= type;\r\n}\r\nfunction mergeProps(...args) {\r\n    const ret = shared.extend({}, args[0]);\r\n    for (let i = 1; i < args.length; i++) {\r\n        const toMerge = args[i];\r\n        for (const key in toMerge) {\r\n            if (key === 'class') {\r\n                if (ret.class !== toMerge.class) {\r\n                    ret.class = shared.normalizeClass([ret.class, toMerge.class]);\r\n                }\r\n            }\r\n            else if (key === 'style') {\r\n                ret.style = shared.normalizeStyle([ret.style, toMerge.style]);\r\n            }\r\n            else if (shared.isOn(key)) {\r\n                const existing = ret[key];\r\n                const incoming = toMerge[key];\r\n                if (existing !== incoming) {\r\n                    ret[key] = existing\r\n                        ? [].concat(existing, incoming)\r\n                        : incoming;\r\n                }\r\n            }\r\n            else if (key !== '') {\r\n                ret[key] = toMerge[key];\r\n            }\r\n        }\r\n    }\r\n    return ret;\r\n}\n\n/**\r\n * Actual implementation\r\n */\r\nfunction renderList(source, renderItem) {\r\n    let ret;\r\n    if (shared.isArray(source) || shared.isString(source)) {\r\n        ret = new Array(source.length);\r\n        for (let i = 0, l = source.length; i < l; i++) {\r\n            ret[i] = renderItem(source[i], i);\r\n        }\r\n    }\r\n    else if (typeof source === 'number') {\r\n        ret = new Array(source);\r\n        for (let i = 0; i < source; i++) {\r\n            ret[i] = renderItem(i + 1, i);\r\n        }\r\n    }\r\n    else if (shared.isObject(source)) {\r\n        if (source[Symbol.iterator]) {\r\n            ret = Array.from(source, renderItem);\r\n        }\r\n        else {\r\n            const keys = Object.keys(source);\r\n            ret = new Array(keys.length);\r\n            for (let i = 0, l = keys.length; i < l; i++) {\r\n                const key = keys[i];\r\n                ret[i] = renderItem(source[key], key, i);\r\n            }\r\n        }\r\n    }\r\n    else {\r\n        ret = [];\r\n    }\r\n    return ret;\r\n}\n\n/**\r\n * Compiler runtime helper for creating dynamic slots object\r\n * @private\r\n */\r\nfunction createSlots(slots, dynamicSlots) {\r\n    for (let i = 0; i < dynamicSlots.length; i++) {\r\n        const slot = dynamicSlots[i];\r\n        // array of dynamic slot generated by <template v-for=\"...\" #[...]>\r\n        if (shared.isArray(slot)) {\r\n            for (let j = 0; j < slot.length; j++) {\r\n                slots[slot[j].name] = slot[j].fn;\r\n            }\r\n        }\r\n        else if (slot) {\r\n            // conditional single slot generated by <template v-if=\"...\" #foo>\r\n            slots[slot.name] = slot.fn;\r\n        }\r\n    }\r\n    return slots;\r\n}\n\n/**\r\n * Compiler runtime helper for rendering `<slot/>`\r\n * @private\r\n */\r\nfunction renderSlot(slots, name, props = {}, \r\n// this is not a user-facing function, so the fallback is always generated by\r\n// the compiler and guaranteed to be a function returning an array\r\nfallback, noSlotted) {\r\n    let slot = slots[name];\r\n    // a compiled slot disables block tracking by default to avoid manual\r\n    // invocation interfering with template-based block tracking, but in\r\n    // `renderSlot` we can be sure that it's template-based so we can force\r\n    // enable it.\r\n    if (slot && slot._c) {\r\n        slot._d = false;\r\n    }\r\n    openBlock();\r\n    const validSlotContent = slot && ensureValidVNode(slot(props));\r\n    const rendered = createBlock(Fragment, { key: props.key || `_${name}` }, validSlotContent || (fallback ? fallback() : []), validSlotContent && slots._ === 1 /* STABLE */\r\n        ? 64 /* STABLE_FRAGMENT */\r\n        : -2 /* BAIL */);\r\n    if (!noSlotted && rendered.scopeId) {\r\n        rendered.slotScopeIds = [rendered.scopeId + '-s'];\r\n    }\r\n    if (slot && slot._c) {\r\n        slot._d = true;\r\n    }\r\n    return rendered;\r\n}\r\nfunction ensureValidVNode(vnodes) {\r\n    return vnodes.some(child => {\r\n        if (!isVNode(child))\r\n            return true;\r\n        if (child.type === Comment$1)\r\n            return false;\r\n        if (child.type === Fragment &&\r\n            !ensureValidVNode(child.children))\r\n            return false;\r\n        return true;\r\n    })\r\n        ? vnodes\r\n        : null;\r\n}\n\n/**\r\n * For prefixing keys in v-on=\"obj\" with \"on\"\r\n * @private\r\n */\r\nfunction toHandlers(obj) {\r\n    const ret = {};\r\n    for (const key in obj) {\r\n        ret[shared.toHandlerKey(key)] = obj[key];\r\n    }\r\n    return ret;\r\n}\n\n/**\r\n * #2437 In Vue 3, functional components do not have a public instance proxy but\r\n * they exist in the internal parent chain. For code that relies on traversing\r\n * public $parent chains, skip functional ones and go to the parent instead.\r\n */\r\nconst getPublicInstance = (i) => {\r\n    if (!i)\r\n        return null;\r\n    if (isStatefulComponent(i))\r\n        return i.exposed ? i.exposed : i.proxy;\r\n    return getPublicInstance(i.parent);\r\n};\r\nconst publicPropertiesMap = shared.extend(Object.create(null), {\r\n    $: i => i,\r\n    $el: i => i.vnode.el,\r\n    $data: i => i.data,\r\n    $props: i => (i.props),\r\n    $attrs: i => (i.attrs),\r\n    $slots: i => (i.slots),\r\n    $refs: i => (i.refs),\r\n    $parent: i => getPublicInstance(i.parent),\r\n    $root: i => getPublicInstance(i.root),\r\n    $emit: i => i.emit,\r\n    $options: i => (resolveMergedOptions(i) ),\r\n    $forceUpdate: i => () => queueJob(i.update),\r\n    $nextTick: i => nextTick.bind(i.proxy),\r\n    $watch: i => (instanceWatch.bind(i) )\r\n});\r\nconst PublicInstanceProxyHandlers = {\r\n    get({ _: instance }, key) {\r\n        const { ctx, setupState, data, props, accessCache, type, appContext } = instance;\r\n        // let @vue/reactivity know it should never observe Vue public instances.\r\n        if (key === \"__v_skip\" /* SKIP */) {\r\n            return true;\r\n        }\r\n        // data / props / ctx\r\n        // This getter gets called for every property access on the render context\r\n        // during render and is a major hotspot. The most expensive part of this\r\n        // is the multiple hasOwn() calls. It's much faster to do a simple property\r\n        // access on a plain object, so we use an accessCache object (with null\r\n        // prototype) to memoize what access type a key corresponds to.\r\n        let normalizedProps;\r\n        if (key[0] !== '$') {\r\n            const n = accessCache[key];\r\n            if (n !== undefined) {\r\n                switch (n) {\r\n                    case 0 /* SETUP */:\r\n                        return setupState[key];\r\n                    case 1 /* DATA */:\r\n                        return data[key];\r\n                    case 3 /* CONTEXT */:\r\n                        return ctx[key];\r\n                    case 2 /* PROPS */:\r\n                        return props[key];\r\n                    // default: just fallthrough\r\n                }\r\n            }\r\n            else if (setupState !== shared.EMPTY_OBJ && shared.hasOwn(setupState, key)) {\r\n                accessCache[key] = 0 /* SETUP */;\r\n                return setupState[key];\r\n            }\r\n            else if (data !== shared.EMPTY_OBJ && shared.hasOwn(data, key)) {\r\n                accessCache[key] = 1 /* DATA */;\r\n                return data[key];\r\n            }\r\n            else if (\r\n            // only cache other properties when instance has declared (thus stable)\r\n            // props\r\n            (normalizedProps = instance.propsOptions[0]) &&\r\n                shared.hasOwn(normalizedProps, key)) {\r\n                accessCache[key] = 2 /* PROPS */;\r\n                return props[key];\r\n            }\r\n            else if (ctx !== shared.EMPTY_OBJ && shared.hasOwn(ctx, key)) {\r\n                accessCache[key] = 3 /* CONTEXT */;\r\n                return ctx[key];\r\n            }\r\n            else if (shouldCacheAccess) {\r\n                accessCache[key] = 4 /* OTHER */;\r\n            }\r\n        }\r\n        const publicGetter = publicPropertiesMap[key];\r\n        let cssModule, globalProperties;\r\n        // public $xxx properties\r\n        if (publicGetter) {\r\n            if (key === '$attrs') {\r\n                reactivity.track(instance, \"get\" /* GET */, key);\r\n            }\r\n            return publicGetter(instance);\r\n        }\r\n        else if (\r\n        // css module (injected by vue-loader)\r\n        (cssModule = type.__cssModules) &&\r\n            (cssModule = cssModule[key])) {\r\n            return cssModule;\r\n        }\r\n        else if (ctx !== shared.EMPTY_OBJ && shared.hasOwn(ctx, key)) {\r\n            // user may set custom properties to `this` that start with `$`\r\n            accessCache[key] = 3 /* CONTEXT */;\r\n            return ctx[key];\r\n        }\r\n        else if (\r\n        // global properties\r\n        ((globalProperties = appContext.config.globalProperties),\r\n            shared.hasOwn(globalProperties, key))) {\r\n            {\r\n                return globalProperties[key];\r\n            }\r\n        }\r\n        else ;\r\n    },\r\n    set({ _: instance }, key, value) {\r\n        const { data, setupState, ctx } = instance;\r\n        if (setupState !== shared.EMPTY_OBJ && shared.hasOwn(setupState, key)) {\r\n            setupState[key] = value;\r\n        }\r\n        else if (data !== shared.EMPTY_OBJ && shared.hasOwn(data, key)) {\r\n            data[key] = value;\r\n        }\r\n        else if (shared.hasOwn(instance.props, key)) {\r\n            return false;\r\n        }\r\n        if (key[0] === '$' && key.slice(1) in instance) {\r\n            return false;\r\n        }\r\n        else {\r\n            {\r\n                ctx[key] = value;\r\n            }\r\n        }\r\n        return true;\r\n    },\r\n    has({ _: { data, setupState, accessCache, ctx, appContext, propsOptions } }, key) {\r\n        let normalizedProps;\r\n        return (accessCache[key] !== undefined ||\r\n            (data !== shared.EMPTY_OBJ && shared.hasOwn(data, key)) ||\r\n            (setupState !== shared.EMPTY_OBJ && shared.hasOwn(setupState, key)) ||\r\n            ((normalizedProps = propsOptions[0]) && shared.hasOwn(normalizedProps, key)) ||\r\n            shared.hasOwn(ctx, key) ||\r\n            shared.hasOwn(publicPropertiesMap, key) ||\r\n            shared.hasOwn(appContext.config.globalProperties, key));\r\n    }\r\n};\r\nconst RuntimeCompiledPublicInstanceProxyHandlers = shared.extend({}, PublicInstanceProxyHandlers, {\r\n    get(target, key) {\r\n        // fast path for unscopables when using `with` block\r\n        if (key === Symbol.unscopables) {\r\n            return;\r\n        }\r\n        return PublicInstanceProxyHandlers.get(target, key, target);\r\n    },\r\n    has(_, key) {\r\n        const has = key[0] !== '_' && !shared.isGloballyWhitelisted(key);\r\n        return has;\r\n    }\r\n});\n\nconst emptyAppContext = createAppContext();\r\nlet uid$1 = 0;\r\nfunction createComponentInstance(vnode, parent, suspense) {\r\n    const type = vnode.type;\r\n    // inherit parent app context - or - if root, adopt from root vnode\r\n    const appContext = (parent ? parent.appContext : vnode.appContext) || emptyAppContext;\r\n    const instance = {\r\n        uid: uid$1++,\r\n        vnode,\r\n        type,\r\n        parent,\r\n        appContext,\r\n        root: null,\r\n        next: null,\r\n        subTree: null,\r\n        update: null,\r\n        render: null,\r\n        proxy: null,\r\n        exposed: null,\r\n        withProxy: null,\r\n        effects: null,\r\n        provides: parent ? parent.provides : Object.create(appContext.provides),\r\n        accessCache: null,\r\n        renderCache: [],\r\n        // local resovled assets\r\n        components: null,\r\n        directives: null,\r\n        // resolved props and emits options\r\n        propsOptions: normalizePropsOptions(type, appContext),\r\n        emitsOptions: normalizeEmitsOptions(type, appContext),\r\n        // emit\r\n        emit: null,\r\n        emitted: null,\r\n        // props default value\r\n        propsDefaults: shared.EMPTY_OBJ,\r\n        // inheritAttrs\r\n        inheritAttrs: type.inheritAttrs,\r\n        // state\r\n        ctx: shared.EMPTY_OBJ,\r\n        data: shared.EMPTY_OBJ,\r\n        props: shared.EMPTY_OBJ,\r\n        attrs: shared.EMPTY_OBJ,\r\n        slots: shared.EMPTY_OBJ,\r\n        refs: shared.EMPTY_OBJ,\r\n        setupState: shared.EMPTY_OBJ,\r\n        setupContext: null,\r\n        // suspense related\r\n        suspense,\r\n        suspenseId: suspense ? suspense.pendingId : 0,\r\n        asyncDep: null,\r\n        asyncResolved: false,\r\n        // lifecycle hooks\r\n        // not using enums here because it results in computed properties\r\n        isMounted: false,\r\n        isUnmounted: false,\r\n        isDeactivated: false,\r\n        bc: null,\r\n        c: null,\r\n        bm: null,\r\n        m: null,\r\n        bu: null,\r\n        u: null,\r\n        um: null,\r\n        bum: null,\r\n        da: null,\r\n        a: null,\r\n        rtg: null,\r\n        rtc: null,\r\n        ec: null,\r\n        sp: null\r\n    };\r\n    {\r\n        instance.ctx = { _: instance };\r\n    }\r\n    instance.root = parent ? parent.root : instance;\r\n    instance.emit = emit.bind(null, instance);\r\n    return instance;\r\n}\r\nlet currentInstance = null;\r\nconst getCurrentInstance = () => currentInstance || currentRenderingInstance;\r\nconst setCurrentInstance = (instance) => {\r\n    currentInstance = instance;\r\n};\r\nfunction isStatefulComponent(instance) {\r\n    return instance.vnode.shapeFlag & 4 /* STATEFUL_COMPONENT */;\r\n}\r\nlet isInSSRComponentSetup = false;\r\nfunction setupComponent(instance, isSSR = false) {\r\n    isInSSRComponentSetup = isSSR;\r\n    const { props, children } = instance.vnode;\r\n    const isStateful = isStatefulComponent(instance);\r\n    initProps(instance, props, isStateful, isSSR);\r\n    initSlots(instance, children);\r\n    const setupResult = isStateful\r\n        ? setupStatefulComponent(instance, isSSR)\r\n        : undefined;\r\n    isInSSRComponentSetup = false;\r\n    return setupResult;\r\n}\r\nfunction setupStatefulComponent(instance, isSSR) {\r\n    const Component = instance.type;\r\n    // 0. create render proxy property access cache\r\n    instance.accessCache = Object.create(null);\r\n    // 1. create public instance / render proxy\r\n    // also mark it raw so it's never observed\r\n    instance.proxy = new Proxy(instance.ctx, PublicInstanceProxyHandlers);\r\n    // 2. call setup()\r\n    const { setup } = Component;\r\n    if (setup) {\r\n        const setupContext = (instance.setupContext =\r\n            setup.length > 1 ? createSetupContext(instance) : null);\r\n        currentInstance = instance;\r\n        reactivity.pauseTracking();\r\n        const setupResult = callWithErrorHandling(setup, instance, 0 /* SETUP_FUNCTION */, [instance.props, setupContext]);\r\n        reactivity.resetTracking();\r\n        currentInstance = null;\r\n        if (shared.isPromise(setupResult)) {\r\n            if (isSSR) {\r\n                // return the promise so server-renderer can wait on it\r\n                return setupResult\r\n                    .then((resolvedResult) => {\r\n                    handleSetupResult(instance, resolvedResult, isSSR);\r\n                })\r\n                    .catch(e => {\r\n                    handleError(e, instance, 0 /* SETUP_FUNCTION */);\r\n                });\r\n            }\r\n            else {\r\n                // async setup returned Promise.\r\n                // bail here and wait for re-entry.\r\n                instance.asyncDep = setupResult;\r\n            }\r\n        }\r\n        else {\r\n            handleSetupResult(instance, setupResult, isSSR);\r\n        }\r\n    }\r\n    else {\r\n        finishComponentSetup(instance, isSSR);\r\n    }\r\n}\r\nfunction handleSetupResult(instance, setupResult, isSSR) {\r\n    if (shared.isFunction(setupResult)) {\r\n        // setup returned an inline render function\r\n        if (instance.type.__ssrInlineRender) {\r\n            // when the function's name is `ssrRender` (compiled by SFC inline mode),\r\n            // set it as ssrRender instead.\r\n            instance.ssrRender = setupResult;\r\n        }\r\n        else {\r\n            instance.render = setupResult;\r\n        }\r\n    }\r\n    else if (shared.isObject(setupResult)) {\r\n        instance.setupState = reactivity.proxyRefs(setupResult);\r\n    }\r\n    else ;\r\n    finishComponentSetup(instance, isSSR);\r\n}\r\nlet compile;\r\n// dev only\r\nconst isRuntimeOnly = () => !compile;\r\n/**\r\n * For runtime-dom to register the compiler.\r\n * Note the exported method uses any to avoid d.ts relying on the compiler types.\r\n */\r\nfunction registerRuntimeCompiler(_compile) {\r\n    compile = _compile;\r\n}\r\nfunction finishComponentSetup(instance, isSSR, skipOptions) {\r\n    const Component = instance.type;\r\n    // template / render function normalization\r\n    if (isSSR) {\r\n        // 1. the render function may already exist, returned by `setup`\r\n        // 2. otherwise try to use the `Component.render`\r\n        // 3. if the component doesn't have a render function,\r\n        //    set `instance.render` to NOOP so that it can inherit the render\r\n        //    function from mixins/extend\r\n        instance.render = (instance.render ||\r\n            Component.render ||\r\n            shared.NOOP);\r\n    }\r\n    else if (!instance.render) {\r\n        // could be set from setup()\r\n        if (compile && !Component.render) {\r\n            const template = Component.template;\r\n            if (template) {\r\n                const { isCustomElement, compilerOptions } = instance.appContext.config;\r\n                const { delimiters, compilerOptions: componentCompilerOptions } = Component;\r\n                const finalCompilerOptions = shared.extend(shared.extend({\r\n                    isCustomElement,\r\n                    delimiters\r\n                }, compilerOptions), componentCompilerOptions);\r\n                Component.render = compile(template, finalCompilerOptions);\r\n            }\r\n        }\r\n        instance.render = (Component.render || shared.NOOP);\r\n        // for runtime-compiled render functions using `with` blocks, the render\r\n        // proxy used needs a different `has` handler which is more performant and\r\n        // also only allows a whitelist of globals to fallthrough.\r\n        if (instance.render._rc) {\r\n            instance.withProxy = new Proxy(instance.ctx, RuntimeCompiledPublicInstanceProxyHandlers);\r\n        }\r\n    }\r\n    // support for 2.x options\r\n    {\r\n        currentInstance = instance;\r\n        reactivity.pauseTracking();\r\n        applyOptions(instance);\r\n        reactivity.resetTracking();\r\n        currentInstance = null;\r\n    }\r\n}\r\nfunction createSetupContext(instance) {\r\n    const expose = exposed => {\r\n        instance.exposed = reactivity.proxyRefs(exposed);\r\n    };\r\n    {\r\n        return {\r\n            attrs: instance.attrs,\r\n            slots: instance.slots,\r\n            emit: instance.emit,\r\n            expose\r\n        };\r\n    }\r\n}\r\n// record effects created during a component's setup() so that they can be\r\n// stopped when the component unmounts\r\nfunction recordInstanceBoundEffect(effect, instance = currentInstance) {\r\n    if (instance) {\r\n        (instance.effects || (instance.effects = [])).push(effect);\r\n    }\r\n}\r\nconst classifyRE = /(?:^|[-_])(\\w)/g;\r\nconst classify = (str) => str.replace(classifyRE, c => c.toUpperCase()).replace(/[-_]/g, '');\r\nfunction getComponentName(Component) {\r\n    return shared.isFunction(Component)\r\n        ? Component.displayName || Component.name\r\n        : Component.name;\r\n}\r\n/* istanbul ignore next */\r\nfunction formatComponentName(instance, Component, isRoot = false) {\r\n    let name = getComponentName(Component);\r\n    if (!name && Component.__file) {\r\n        const match = Component.__file.match(/([^/\\\\]+)\\.\\w+$/);\r\n        if (match) {\r\n            name = match[1];\r\n        }\r\n    }\r\n    if (!name && instance && instance.parent) {\r\n        // try to infer the name based on reverse resolution\r\n        const inferFromRegistry = (registry) => {\r\n            for (const key in registry) {\r\n                if (registry[key] === Component) {\r\n                    return key;\r\n                }\r\n            }\r\n        };\r\n        name =\r\n            inferFromRegistry(instance.components ||\r\n                instance.parent.type.components) || inferFromRegistry(instance.appContext.components);\r\n    }\r\n    return name ? classify(name) : isRoot ? `App` : `Anonymous`;\r\n}\r\nfunction isClassComponent(value) {\r\n    return shared.isFunction(value) && '__vccOpts' in value;\r\n}\n\nfunction computed(getterOrOptions) {\r\n    const c = reactivity.computed(getterOrOptions);\r\n    recordInstanceBoundEffect(c.effect);\r\n    return c;\r\n}\n\n// implementation\r\nfunction defineProps() {\r\n    return null;\r\n}\r\n// implementation\r\nfunction defineEmit() {\r\n    return null;\r\n}\r\nfunction useContext() {\r\n    const i = getCurrentInstance();\r\n    return i.setupContext || (i.setupContext = createSetupContext(i));\r\n}\n\n// Actual implementation\r\nfunction h(type, propsOrChildren, children) {\r\n    const l = arguments.length;\r\n    if (l === 2) {\r\n        if (shared.isObject(propsOrChildren) && !shared.isArray(propsOrChildren)) {\r\n            // single vnode without props\r\n            if (isVNode(propsOrChildren)) {\r\n                return createVNode(type, null, [propsOrChildren]);\r\n            }\r\n            // props without children\r\n            return createVNode(type, propsOrChildren);\r\n        }\r\n        else {\r\n            // omit props\r\n            return createVNode(type, null, propsOrChildren);\r\n        }\r\n    }\r\n    else {\r\n        if (l > 3) {\r\n            children = Array.prototype.slice.call(arguments, 2);\r\n        }\r\n        else if (l === 3 && isVNode(children)) {\r\n            children = [children];\r\n        }\r\n        return createVNode(type, propsOrChildren, children);\r\n    }\r\n}\n\nconst ssrContextKey = Symbol(``);\r\nconst useSSRContext = () => {\r\n    {\r\n        const ctx = inject(ssrContextKey);\r\n        if (!ctx) {\r\n            warn(`Server rendering context not provided. Make sure to only call ` +\r\n                `useSSRContext() conditionally in the server build.`);\r\n        }\r\n        return ctx;\r\n    }\r\n};\n\nfunction initCustomFormatter() {\r\n    /* eslint-disable no-restricted-globals */\r\n    {\r\n        return;\r\n    }\r\n}\n\n// Core API ------------------------------------------------------------------\r\nconst version = \"3.1.1\";\r\nconst _ssrUtils = {\r\n    createComponentInstance,\r\n    setupComponent,\r\n    renderComponentRoot,\r\n    setCurrentRenderingInstance,\r\n    isVNode,\r\n    normalizeVNode\r\n};\r\n/**\r\n * SSR utils for \\@vue/server-renderer. Only exposed in cjs builds.\r\n * @internal\r\n */\r\nconst ssrUtils = (_ssrUtils );\r\n/**\r\n * @internal only exposed in compat builds\r\n */\r\nconst resolveFilter = null;\r\n/**\r\n * @internal only exposed in compat builds.\r\n */\r\nconst compatUtils = (null);\n\nexports.customRef = reactivity.customRef;\nexports.isProxy = reactivity.isProxy;\nexports.isReactive = reactivity.isReactive;\nexports.isReadonly = reactivity.isReadonly;\nexports.isRef = reactivity.isRef;\nexports.markRaw = reactivity.markRaw;\nexports.proxyRefs = reactivity.proxyRefs;\nexports.reactive = reactivity.reactive;\nexports.readonly = reactivity.readonly;\nexports.ref = reactivity.ref;\nexports.shallowReactive = reactivity.shallowReactive;\nexports.shallowReadonly = reactivity.shallowReadonly;\nexports.shallowRef = reactivity.shallowRef;\nexports.toRaw = reactivity.toRaw;\nexports.toRef = reactivity.toRef;\nexports.toRefs = reactivity.toRefs;\nexports.triggerRef = reactivity.triggerRef;\nexports.unref = reactivity.unref;\nexports.camelize = shared.camelize;\nexports.capitalize = shared.capitalize;\nexports.toDisplayString = shared.toDisplayString;\nexports.toHandlerKey = shared.toHandlerKey;\nexports.BaseTransition = BaseTransition;\nexports.Comment = Comment$1;\nexports.Fragment = Fragment;\nexports.KeepAlive = KeepAlive;\nexports.Static = Static;\nexports.Suspense = Suspense;\nexports.Teleport = Teleport;\nexports.Text = Text;\nexports.callWithAsyncErrorHandling = callWithAsyncErrorHandling;\nexports.callWithErrorHandling = callWithErrorHandling;\nexports.cloneVNode = cloneVNode;\nexports.compatUtils = compatUtils;\nexports.computed = computed;\nexports.createBlock = createBlock;\nexports.createCommentVNode = createCommentVNode;\nexports.createHydrationRenderer = createHydrationRenderer;\nexports.createRenderer = createRenderer;\nexports.createSlots = createSlots;\nexports.createStaticVNode = createStaticVNode;\nexports.createTextVNode = createTextVNode;\nexports.createVNode = createVNode;\nexports.defineAsyncComponent = defineAsyncComponent;\nexports.defineComponent = defineComponent;\nexports.defineEmit = defineEmit;\nexports.defineProps = defineProps;\nexports.getCurrentInstance = getCurrentInstance;\nexports.getTransitionRawChildren = getTransitionRawChildren;\nexports.h = h;\nexports.handleError = handleError;\nexports.initCustomFormatter = initCustomFormatter;\nexports.inject = inject;\nexports.isRuntimeOnly = isRuntimeOnly;\nexports.isVNode = isVNode;\nexports.mergeProps = mergeProps;\nexports.nextTick = nextTick;\nexports.onActivated = onActivated;\nexports.onBeforeMount = onBeforeMount;\nexports.onBeforeUnmount = onBeforeUnmount;\nexports.onBeforeUpdate = onBeforeUpdate;\nexports.onDeactivated = onDeactivated;\nexports.onErrorCaptured = onErrorCaptured;\nexports.onMounted = onMounted;\nexports.onRenderTracked = onRenderTracked;\nexports.onRenderTriggered = onRenderTriggered;\nexports.onServerPrefetch = onServerPrefetch;\nexports.onUnmounted = onUnmounted;\nexports.onUpdated = onUpdated;\nexports.openBlock = openBlock;\nexports.popScopeId = popScopeId;\nexports.provide = provide;\nexports.pushScopeId = pushScopeId;\nexports.queuePostFlushCb = queuePostFlushCb;\nexports.registerRuntimeCompiler = registerRuntimeCompiler;\nexports.renderList = renderList;\nexports.renderSlot = renderSlot;\nexports.resolveComponent = resolveComponent;\nexports.resolveDirective = resolveDirective;\nexports.resolveDynamicComponent = resolveDynamicComponent;\nexports.resolveFilter = resolveFilter;\nexports.resolveTransitionHooks = resolveTransitionHooks;\nexports.setBlockTracking = setBlockTracking;\nexports.setDevtoolsHook = setDevtoolsHook;\nexports.setTransitionHooks = setTransitionHooks;\nexports.ssrContextKey = ssrContextKey;\nexports.ssrUtils = ssrUtils;\nexports.toHandlers = toHandlers;\nexports.transformVNodeArgs = transformVNodeArgs;\nexports.useContext = useContext;\nexports.useSSRContext = useSSRContext;\nexports.useTransitionState = useTransitionState;\nexports.version = version;\nexports.warn = warn;\nexports.watch = watch;\nexports.watchEffect = watchEffect;\nexports.withCtx = withCtx;\nexports.withDirectives = withDirectives;\nexports.withScopeId = withScopeId;\n","'use strict'\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./dist/reactivity.cjs.prod.js')\n} else {\n  module.exports = require('./dist/reactivity.cjs.js')\n}\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar shared = require('@vue/shared');\n\nconst targetMap = new WeakMap();\r\nconst effectStack = [];\r\nlet activeEffect;\r\nconst ITERATE_KEY = Symbol('');\r\nconst MAP_KEY_ITERATE_KEY = Symbol('');\r\nfunction isEffect(fn) {\r\n    return fn && fn._isEffect === true;\r\n}\r\nfunction effect(fn, options = shared.EMPTY_OBJ) {\r\n    if (isEffect(fn)) {\r\n        fn = fn.raw;\r\n    }\r\n    const effect = createReactiveEffect(fn, options);\r\n    if (!options.lazy) {\r\n        effect();\r\n    }\r\n    return effect;\r\n}\r\nfunction stop(effect) {\r\n    if (effect.active) {\r\n        cleanup(effect);\r\n        if (effect.options.onStop) {\r\n            effect.options.onStop();\r\n        }\r\n        effect.active = false;\r\n    }\r\n}\r\nlet uid = 0;\r\nfunction createReactiveEffect(fn, options) {\r\n    const effect = function reactiveEffect() {\r\n        if (!effect.active) {\r\n            return fn();\r\n        }\r\n        if (!effectStack.includes(effect)) {\r\n            cleanup(effect);\r\n            try {\r\n                enableTracking();\r\n                effectStack.push(effect);\r\n                activeEffect = effect;\r\n                return fn();\r\n            }\r\n            finally {\r\n                effectStack.pop();\r\n                resetTracking();\r\n                activeEffect = effectStack[effectStack.length - 1];\r\n            }\r\n        }\r\n    };\r\n    effect.id = uid++;\r\n    effect.allowRecurse = !!options.allowRecurse;\r\n    effect._isEffect = true;\r\n    effect.active = true;\r\n    effect.raw = fn;\r\n    effect.deps = [];\r\n    effect.options = options;\r\n    return effect;\r\n}\r\nfunction cleanup(effect) {\r\n    const { deps } = effect;\r\n    if (deps.length) {\r\n        for (let i = 0; i < deps.length; i++) {\r\n            deps[i].delete(effect);\r\n        }\r\n        deps.length = 0;\r\n    }\r\n}\r\nlet shouldTrack = true;\r\nconst trackStack = [];\r\nfunction pauseTracking() {\r\n    trackStack.push(shouldTrack);\r\n    shouldTrack = false;\r\n}\r\nfunction enableTracking() {\r\n    trackStack.push(shouldTrack);\r\n    shouldTrack = true;\r\n}\r\nfunction resetTracking() {\r\n    const last = trackStack.pop();\r\n    shouldTrack = last === undefined ? true : last;\r\n}\r\nfunction track(target, type, key) {\r\n    if (!shouldTrack || activeEffect === undefined) {\r\n        return;\r\n    }\r\n    let depsMap = targetMap.get(target);\r\n    if (!depsMap) {\r\n        targetMap.set(target, (depsMap = new Map()));\r\n    }\r\n    let dep = depsMap.get(key);\r\n    if (!dep) {\r\n        depsMap.set(key, (dep = new Set()));\r\n    }\r\n    if (!dep.has(activeEffect)) {\r\n        dep.add(activeEffect);\r\n        activeEffect.deps.push(dep);\r\n    }\r\n}\r\nfunction trigger(target, type, key, newValue, oldValue, oldTarget) {\r\n    const depsMap = targetMap.get(target);\r\n    if (!depsMap) {\r\n        // never been tracked\r\n        return;\r\n    }\r\n    const effects = new Set();\r\n    const add = (effectsToAdd) => {\r\n        if (effectsToAdd) {\r\n            effectsToAdd.forEach(effect => {\r\n                if (effect !== activeEffect || effect.allowRecurse) {\r\n                    effects.add(effect);\r\n                }\r\n            });\r\n        }\r\n    };\r\n    if (type === \"clear\" /* CLEAR */) {\r\n        // collection being cleared\r\n        // trigger all effects for target\r\n        depsMap.forEach(add);\r\n    }\r\n    else if (key === 'length' && shared.isArray(target)) {\r\n        depsMap.forEach((dep, key) => {\r\n            if (key === 'length' || key >= newValue) {\r\n                add(dep);\r\n            }\r\n        });\r\n    }\r\n    else {\r\n        // schedule runs for SET | ADD | DELETE\r\n        if (key !== void 0) {\r\n            add(depsMap.get(key));\r\n        }\r\n        // also run for iteration key on ADD | DELETE | Map.SET\r\n        switch (type) {\r\n            case \"add\" /* ADD */:\r\n                if (!shared.isArray(target)) {\r\n                    add(depsMap.get(ITERATE_KEY));\r\n                    if (shared.isMap(target)) {\r\n                        add(depsMap.get(MAP_KEY_ITERATE_KEY));\r\n                    }\r\n                }\r\n                else if (shared.isIntegerKey(key)) {\r\n                    // new index added to array -> length changes\r\n                    add(depsMap.get('length'));\r\n                }\r\n                break;\r\n            case \"delete\" /* DELETE */:\r\n                if (!shared.isArray(target)) {\r\n                    add(depsMap.get(ITERATE_KEY));\r\n                    if (shared.isMap(target)) {\r\n                        add(depsMap.get(MAP_KEY_ITERATE_KEY));\r\n                    }\r\n                }\r\n                break;\r\n            case \"set\" /* SET */:\r\n                if (shared.isMap(target)) {\r\n                    add(depsMap.get(ITERATE_KEY));\r\n                }\r\n                break;\r\n        }\r\n    }\r\n    const run = (effect) => {\r\n        if (effect.options.scheduler) {\r\n            effect.options.scheduler(effect);\r\n        }\r\n        else {\r\n            effect();\r\n        }\r\n    };\r\n    effects.forEach(run);\r\n}\n\nconst isNonTrackableKeys = /*#__PURE__*/ shared.makeMap(`__proto__,__v_isRef,__isVue`);\r\nconst builtInSymbols = new Set(Object.getOwnPropertyNames(Symbol)\r\n    .map(key => Symbol[key])\r\n    .filter(shared.isSymbol));\r\nconst get = /*#__PURE__*/ createGetter();\r\nconst shallowGet = /*#__PURE__*/ createGetter(false, true);\r\nconst readonlyGet = /*#__PURE__*/ createGetter(true);\r\nconst shallowReadonlyGet = /*#__PURE__*/ createGetter(true, true);\r\nconst arrayInstrumentations = {};\r\n['includes', 'indexOf', 'lastIndexOf'].forEach(key => {\r\n    const method = Array.prototype[key];\r\n    arrayInstrumentations[key] = function (...args) {\r\n        const arr = toRaw(this);\r\n        for (let i = 0, l = this.length; i < l; i++) {\r\n            track(arr, \"get\" /* GET */, i + '');\r\n        }\r\n        // we run the method using the original args first (which may be reactive)\r\n        const res = method.apply(arr, args);\r\n        if (res === -1 || res === false) {\r\n            // if that didn't work, run it again using raw values.\r\n            return method.apply(arr, args.map(toRaw));\r\n        }\r\n        else {\r\n            return res;\r\n        }\r\n    };\r\n});\r\n['push', 'pop', 'shift', 'unshift', 'splice'].forEach(key => {\r\n    const method = Array.prototype[key];\r\n    arrayInstrumentations[key] = function (...args) {\r\n        pauseTracking();\r\n        const res = method.apply(this, args);\r\n        resetTracking();\r\n        return res;\r\n    };\r\n});\r\nfunction createGetter(isReadonly = false, shallow = false) {\r\n    return function get(target, key, receiver) {\r\n        if (key === \"__v_isReactive\" /* IS_REACTIVE */) {\r\n            return !isReadonly;\r\n        }\r\n        else if (key === \"__v_isReadonly\" /* IS_READONLY */) {\r\n            return isReadonly;\r\n        }\r\n        else if (key === \"__v_raw\" /* RAW */ &&\r\n            receiver ===\r\n                (isReadonly\r\n                    ? shallow\r\n                        ? shallowReadonlyMap\r\n                        : readonlyMap\r\n                    : shallow\r\n                        ? shallowReactiveMap\r\n                        : reactiveMap).get(target)) {\r\n            return target;\r\n        }\r\n        const targetIsArray = shared.isArray(target);\r\n        if (!isReadonly && targetIsArray && shared.hasOwn(arrayInstrumentations, key)) {\r\n            return Reflect.get(arrayInstrumentations, key, receiver);\r\n        }\r\n        const res = Reflect.get(target, key, receiver);\r\n        if (shared.isSymbol(key) ? builtInSymbols.has(key) : isNonTrackableKeys(key)) {\r\n            return res;\r\n        }\r\n        if (!isReadonly) {\r\n            track(target, \"get\" /* GET */, key);\r\n        }\r\n        if (shallow) {\r\n            return res;\r\n        }\r\n        if (isRef(res)) {\r\n            // ref unwrapping - does not apply for Array + integer key.\r\n            const shouldUnwrap = !targetIsArray || !shared.isIntegerKey(key);\r\n            return shouldUnwrap ? res.value : res;\r\n        }\r\n        if (shared.isObject(res)) {\r\n            // Convert returned value into a proxy as well. we do the isObject check\r\n            // here to avoid invalid value warning. Also need to lazy access readonly\r\n            // and reactive here to avoid circular dependency.\r\n            return isReadonly ? readonly(res) : reactive(res);\r\n        }\r\n        return res;\r\n    };\r\n}\r\nconst set = /*#__PURE__*/ createSetter();\r\nconst shallowSet = /*#__PURE__*/ createSetter(true);\r\nfunction createSetter(shallow = false) {\r\n    return function set(target, key, value, receiver) {\r\n        let oldValue = target[key];\r\n        if (!shallow) {\r\n            value = toRaw(value);\r\n            oldValue = toRaw(oldValue);\r\n            if (!shared.isArray(target) && isRef(oldValue) && !isRef(value)) {\r\n                oldValue.value = value;\r\n                return true;\r\n            }\r\n        }\r\n        const hadKey = shared.isArray(target) && shared.isIntegerKey(key)\r\n            ? Number(key) < target.length\r\n            : shared.hasOwn(target, key);\r\n        const result = Reflect.set(target, key, value, receiver);\r\n        // don't trigger if target is something up in the prototype chain of original\r\n        if (target === toRaw(receiver)) {\r\n            if (!hadKey) {\r\n                trigger(target, \"add\" /* ADD */, key, value);\r\n            }\r\n            else if (shared.hasChanged(value, oldValue)) {\r\n                trigger(target, \"set\" /* SET */, key, value);\r\n            }\r\n        }\r\n        return result;\r\n    };\r\n}\r\nfunction deleteProperty(target, key) {\r\n    const hadKey = shared.hasOwn(target, key);\r\n    target[key];\r\n    const result = Reflect.deleteProperty(target, key);\r\n    if (result && hadKey) {\r\n        trigger(target, \"delete\" /* DELETE */, key, undefined);\r\n    }\r\n    return result;\r\n}\r\nfunction has(target, key) {\r\n    const result = Reflect.has(target, key);\r\n    if (!shared.isSymbol(key) || !builtInSymbols.has(key)) {\r\n        track(target, \"has\" /* HAS */, key);\r\n    }\r\n    return result;\r\n}\r\nfunction ownKeys(target) {\r\n    track(target, \"iterate\" /* ITERATE */, shared.isArray(target) ? 'length' : ITERATE_KEY);\r\n    return Reflect.ownKeys(target);\r\n}\r\nconst mutableHandlers = {\r\n    get,\r\n    set,\r\n    deleteProperty,\r\n    has,\r\n    ownKeys\r\n};\r\nconst readonlyHandlers = {\r\n    get: readonlyGet,\r\n    set(target, key) {\r\n        return true;\r\n    },\r\n    deleteProperty(target, key) {\r\n        return true;\r\n    }\r\n};\r\nconst shallowReactiveHandlers = shared.extend({}, mutableHandlers, {\r\n    get: shallowGet,\r\n    set: shallowSet\r\n});\r\n// Props handlers are special in the sense that it should not unwrap top-level\r\n// refs (in order to allow refs to be explicitly passed down), but should\r\n// retain the reactivity of the normal readonly object.\r\nconst shallowReadonlyHandlers = shared.extend({}, readonlyHandlers, {\r\n    get: shallowReadonlyGet\r\n});\n\nconst toReactive = (value) => shared.isObject(value) ? reactive(value) : value;\r\nconst toReadonly = (value) => shared.isObject(value) ? readonly(value) : value;\r\nconst toShallow = (value) => value;\r\nconst getProto = (v) => Reflect.getPrototypeOf(v);\r\nfunction get$1(target, key, isReadonly = false, isShallow = false) {\r\n    // #1772: readonly(reactive(Map)) should return readonly + reactive version\r\n    // of the value\r\n    target = target[\"__v_raw\" /* RAW */];\r\n    const rawTarget = toRaw(target);\r\n    const rawKey = toRaw(key);\r\n    if (key !== rawKey) {\r\n        !isReadonly && track(rawTarget, \"get\" /* GET */, key);\r\n    }\r\n    !isReadonly && track(rawTarget, \"get\" /* GET */, rawKey);\r\n    const { has } = getProto(rawTarget);\r\n    const wrap = isShallow ? toShallow : isReadonly ? toReadonly : toReactive;\r\n    if (has.call(rawTarget, key)) {\r\n        return wrap(target.get(key));\r\n    }\r\n    else if (has.call(rawTarget, rawKey)) {\r\n        return wrap(target.get(rawKey));\r\n    }\r\n    else if (target !== rawTarget) {\r\n        // #3602 readonly(reactive(Map))\r\n        // ensure that the nested reactive `Map` can do tracking for itself\r\n        target.get(key);\r\n    }\r\n}\r\nfunction has$1(key, isReadonly = false) {\r\n    const target = this[\"__v_raw\" /* RAW */];\r\n    const rawTarget = toRaw(target);\r\n    const rawKey = toRaw(key);\r\n    if (key !== rawKey) {\r\n        !isReadonly && track(rawTarget, \"has\" /* HAS */, key);\r\n    }\r\n    !isReadonly && track(rawTarget, \"has\" /* HAS */, rawKey);\r\n    return key === rawKey\r\n        ? target.has(key)\r\n        : target.has(key) || target.has(rawKey);\r\n}\r\nfunction size(target, isReadonly = false) {\r\n    target = target[\"__v_raw\" /* RAW */];\r\n    !isReadonly && track(toRaw(target), \"iterate\" /* ITERATE */, ITERATE_KEY);\r\n    return Reflect.get(target, 'size', target);\r\n}\r\nfunction add(value) {\r\n    value = toRaw(value);\r\n    const target = toRaw(this);\r\n    const proto = getProto(target);\r\n    const hadKey = proto.has.call(target, value);\r\n    if (!hadKey) {\r\n        target.add(value);\r\n        trigger(target, \"add\" /* ADD */, value, value);\r\n    }\r\n    return this;\r\n}\r\nfunction set$1(key, value) {\r\n    value = toRaw(value);\r\n    const target = toRaw(this);\r\n    const { has, get } = getProto(target);\r\n    let hadKey = has.call(target, key);\r\n    if (!hadKey) {\r\n        key = toRaw(key);\r\n        hadKey = has.call(target, key);\r\n    }\r\n    const oldValue = get.call(target, key);\r\n    target.set(key, value);\r\n    if (!hadKey) {\r\n        trigger(target, \"add\" /* ADD */, key, value);\r\n    }\r\n    else if (shared.hasChanged(value, oldValue)) {\r\n        trigger(target, \"set\" /* SET */, key, value);\r\n    }\r\n    return this;\r\n}\r\nfunction deleteEntry(key) {\r\n    const target = toRaw(this);\r\n    const { has, get } = getProto(target);\r\n    let hadKey = has.call(target, key);\r\n    if (!hadKey) {\r\n        key = toRaw(key);\r\n        hadKey = has.call(target, key);\r\n    }\r\n    get ? get.call(target, key) : undefined;\r\n    // forward the operation before queueing reactions\r\n    const result = target.delete(key);\r\n    if (hadKey) {\r\n        trigger(target, \"delete\" /* DELETE */, key, undefined);\r\n    }\r\n    return result;\r\n}\r\nfunction clear() {\r\n    const target = toRaw(this);\r\n    const hadItems = target.size !== 0;\r\n    // forward the operation before queueing reactions\r\n    const result = target.clear();\r\n    if (hadItems) {\r\n        trigger(target, \"clear\" /* CLEAR */, undefined, undefined);\r\n    }\r\n    return result;\r\n}\r\nfunction createForEach(isReadonly, isShallow) {\r\n    return function forEach(callback, thisArg) {\r\n        const observed = this;\r\n        const target = observed[\"__v_raw\" /* RAW */];\r\n        const rawTarget = toRaw(target);\r\n        const wrap = isShallow ? toShallow : isReadonly ? toReadonly : toReactive;\r\n        !isReadonly && track(rawTarget, \"iterate\" /* ITERATE */, ITERATE_KEY);\r\n        return target.forEach((value, key) => {\r\n            // important: make sure the callback is\r\n            // 1. invoked with the reactive map as `this` and 3rd arg\r\n            // 2. the value received should be a corresponding reactive/readonly.\r\n            return callback.call(thisArg, wrap(value), wrap(key), observed);\r\n        });\r\n    };\r\n}\r\nfunction createIterableMethod(method, isReadonly, isShallow) {\r\n    return function (...args) {\r\n        const target = this[\"__v_raw\" /* RAW */];\r\n        const rawTarget = toRaw(target);\r\n        const targetIsMap = shared.isMap(rawTarget);\r\n        const isPair = method === 'entries' || (method === Symbol.iterator && targetIsMap);\r\n        const isKeyOnly = method === 'keys' && targetIsMap;\r\n        const innerIterator = target[method](...args);\r\n        const wrap = isShallow ? toShallow : isReadonly ? toReadonly : toReactive;\r\n        !isReadonly &&\r\n            track(rawTarget, \"iterate\" /* ITERATE */, isKeyOnly ? MAP_KEY_ITERATE_KEY : ITERATE_KEY);\r\n        // return a wrapped iterator which returns observed versions of the\r\n        // values emitted from the real iterator\r\n        return {\r\n            // iterator protocol\r\n            next() {\r\n                const { value, done } = innerIterator.next();\r\n                return done\r\n                    ? { value, done }\r\n                    : {\r\n                        value: isPair ? [wrap(value[0]), wrap(value[1])] : wrap(value),\r\n                        done\r\n                    };\r\n            },\r\n            // iterable protocol\r\n            [Symbol.iterator]() {\r\n                return this;\r\n            }\r\n        };\r\n    };\r\n}\r\nfunction createReadonlyMethod(type) {\r\n    return function (...args) {\r\n        return type === \"delete\" /* DELETE */ ? false : this;\r\n    };\r\n}\r\nconst mutableInstrumentations = {\r\n    get(key) {\r\n        return get$1(this, key);\r\n    },\r\n    get size() {\r\n        return size(this);\r\n    },\r\n    has: has$1,\r\n    add,\r\n    set: set$1,\r\n    delete: deleteEntry,\r\n    clear,\r\n    forEach: createForEach(false, false)\r\n};\r\nconst shallowInstrumentations = {\r\n    get(key) {\r\n        return get$1(this, key, false, true);\r\n    },\r\n    get size() {\r\n        return size(this);\r\n    },\r\n    has: has$1,\r\n    add,\r\n    set: set$1,\r\n    delete: deleteEntry,\r\n    clear,\r\n    forEach: createForEach(false, true)\r\n};\r\nconst readonlyInstrumentations = {\r\n    get(key) {\r\n        return get$1(this, key, true);\r\n    },\r\n    get size() {\r\n        return size(this, true);\r\n    },\r\n    has(key) {\r\n        return has$1.call(this, key, true);\r\n    },\r\n    add: createReadonlyMethod(\"add\" /* ADD */),\r\n    set: createReadonlyMethod(\"set\" /* SET */),\r\n    delete: createReadonlyMethod(\"delete\" /* DELETE */),\r\n    clear: createReadonlyMethod(\"clear\" /* CLEAR */),\r\n    forEach: createForEach(true, false)\r\n};\r\nconst shallowReadonlyInstrumentations = {\r\n    get(key) {\r\n        return get$1(this, key, true, true);\r\n    },\r\n    get size() {\r\n        return size(this, true);\r\n    },\r\n    has(key) {\r\n        return has$1.call(this, key, true);\r\n    },\r\n    add: createReadonlyMethod(\"add\" /* ADD */),\r\n    set: createReadonlyMethod(\"set\" /* SET */),\r\n    delete: createReadonlyMethod(\"delete\" /* DELETE */),\r\n    clear: createReadonlyMethod(\"clear\" /* CLEAR */),\r\n    forEach: createForEach(true, true)\r\n};\r\nconst iteratorMethods = ['keys', 'values', 'entries', Symbol.iterator];\r\niteratorMethods.forEach(method => {\r\n    mutableInstrumentations[method] = createIterableMethod(method, false, false);\r\n    readonlyInstrumentations[method] = createIterableMethod(method, true, false);\r\n    shallowInstrumentations[method] = createIterableMethod(method, false, true);\r\n    shallowReadonlyInstrumentations[method] = createIterableMethod(method, true, true);\r\n});\r\nfunction createInstrumentationGetter(isReadonly, shallow) {\r\n    const instrumentations = shallow\r\n        ? isReadonly\r\n            ? shallowReadonlyInstrumentations\r\n            : shallowInstrumentations\r\n        : isReadonly\r\n            ? readonlyInstrumentations\r\n            : mutableInstrumentations;\r\n    return (target, key, receiver) => {\r\n        if (key === \"__v_isReactive\" /* IS_REACTIVE */) {\r\n            return !isReadonly;\r\n        }\r\n        else if (key === \"__v_isReadonly\" /* IS_READONLY */) {\r\n            return isReadonly;\r\n        }\r\n        else if (key === \"__v_raw\" /* RAW */) {\r\n            return target;\r\n        }\r\n        return Reflect.get(shared.hasOwn(instrumentations, key) && key in target\r\n            ? instrumentations\r\n            : target, key, receiver);\r\n    };\r\n}\r\nconst mutableCollectionHandlers = {\r\n    get: createInstrumentationGetter(false, false)\r\n};\r\nconst shallowCollectionHandlers = {\r\n    get: createInstrumentationGetter(false, true)\r\n};\r\nconst readonlyCollectionHandlers = {\r\n    get: createInstrumentationGetter(true, false)\r\n};\r\nconst shallowReadonlyCollectionHandlers = {\r\n    get: createInstrumentationGetter(true, true)\r\n};\n\nconst reactiveMap = new WeakMap();\r\nconst shallowReactiveMap = new WeakMap();\r\nconst readonlyMap = new WeakMap();\r\nconst shallowReadonlyMap = new WeakMap();\r\nfunction targetTypeMap(rawType) {\r\n    switch (rawType) {\r\n        case 'Object':\r\n        case 'Array':\r\n            return 1 /* COMMON */;\r\n        case 'Map':\r\n        case 'Set':\r\n        case 'WeakMap':\r\n        case 'WeakSet':\r\n            return 2 /* COLLECTION */;\r\n        default:\r\n            return 0 /* INVALID */;\r\n    }\r\n}\r\nfunction getTargetType(value) {\r\n    return value[\"__v_skip\" /* SKIP */] || !Object.isExtensible(value)\r\n        ? 0 /* INVALID */\r\n        : targetTypeMap(shared.toRawType(value));\r\n}\r\nfunction reactive(target) {\r\n    // if trying to observe a readonly proxy, return the readonly version.\r\n    if (target && target[\"__v_isReadonly\" /* IS_READONLY */]) {\r\n        return target;\r\n    }\r\n    return createReactiveObject(target, false, mutableHandlers, mutableCollectionHandlers, reactiveMap);\r\n}\r\n/**\r\n * Return a shallowly-reactive copy of the original object, where only the root\r\n * level properties are reactive. It also does not auto-unwrap refs (even at the\r\n * root level).\r\n */\r\nfunction shallowReactive(target) {\r\n    return createReactiveObject(target, false, shallowReactiveHandlers, shallowCollectionHandlers, shallowReactiveMap);\r\n}\r\n/**\r\n * Creates a readonly copy of the original object. Note the returned copy is not\r\n * made reactive, but `readonly` can be called on an already reactive object.\r\n */\r\nfunction readonly(target) {\r\n    return createReactiveObject(target, true, readonlyHandlers, readonlyCollectionHandlers, readonlyMap);\r\n}\r\n/**\r\n * Returns a reactive-copy of the original object, where only the root level\r\n * properties are readonly, and does NOT unwrap refs nor recursively convert\r\n * returned properties.\r\n * This is used for creating the props proxy object for stateful components.\r\n */\r\nfunction shallowReadonly(target) {\r\n    return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\r\n}\r\nfunction createReactiveObject(target, isReadonly, baseHandlers, collectionHandlers, proxyMap) {\r\n    if (!shared.isObject(target)) {\r\n        return target;\r\n    }\r\n    // target is already a Proxy, return it.\r\n    // exception: calling readonly() on a reactive object\r\n    if (target[\"__v_raw\" /* RAW */] &&\r\n        !(isReadonly && target[\"__v_isReactive\" /* IS_REACTIVE */])) {\r\n        return target;\r\n    }\r\n    // target already has corresponding Proxy\r\n    const existingProxy = proxyMap.get(target);\r\n    if (existingProxy) {\r\n        return existingProxy;\r\n    }\r\n    // only a whitelist of value types can be observed.\r\n    const targetType = getTargetType(target);\r\n    if (targetType === 0 /* INVALID */) {\r\n        return target;\r\n    }\r\n    const proxy = new Proxy(target, targetType === 2 /* COLLECTION */ ? collectionHandlers : baseHandlers);\r\n    proxyMap.set(target, proxy);\r\n    return proxy;\r\n}\r\nfunction isReactive(value) {\r\n    if (isReadonly(value)) {\r\n        return isReactive(value[\"__v_raw\" /* RAW */]);\r\n    }\r\n    return !!(value && value[\"__v_isReactive\" /* IS_REACTIVE */]);\r\n}\r\nfunction isReadonly(value) {\r\n    return !!(value && value[\"__v_isReadonly\" /* IS_READONLY */]);\r\n}\r\nfunction isProxy(value) {\r\n    return isReactive(value) || isReadonly(value);\r\n}\r\nfunction toRaw(observed) {\r\n    return ((observed && toRaw(observed[\"__v_raw\" /* RAW */])) || observed);\r\n}\r\nfunction markRaw(value) {\r\n    shared.def(value, \"__v_skip\" /* SKIP */, true);\r\n    return value;\r\n}\n\nconst convert = (val) => shared.isObject(val) ? reactive(val) : val;\r\nfunction isRef(r) {\r\n    return Boolean(r && r.__v_isRef === true);\r\n}\r\nfunction ref(value) {\r\n    return createRef(value);\r\n}\r\nfunction shallowRef(value) {\r\n    return createRef(value, true);\r\n}\r\nclass RefImpl {\r\n    constructor(_rawValue, _shallow = false) {\r\n        this._rawValue = _rawValue;\r\n        this._shallow = _shallow;\r\n        this.__v_isRef = true;\r\n        this._value = _shallow ? _rawValue : convert(_rawValue);\r\n    }\r\n    get value() {\r\n        track(toRaw(this), \"get\" /* GET */, 'value');\r\n        return this._value;\r\n    }\r\n    set value(newVal) {\r\n        if (shared.hasChanged(toRaw(newVal), this._rawValue)) {\r\n            this._rawValue = newVal;\r\n            this._value = this._shallow ? newVal : convert(newVal);\r\n            trigger(toRaw(this), \"set\" /* SET */, 'value', newVal);\r\n        }\r\n    }\r\n}\r\nfunction createRef(rawValue, shallow = false) {\r\n    if (isRef(rawValue)) {\r\n        return rawValue;\r\n    }\r\n    return new RefImpl(rawValue, shallow);\r\n}\r\nfunction triggerRef(ref) {\r\n    trigger(toRaw(ref), \"set\" /* SET */, 'value', void 0);\r\n}\r\nfunction unref(ref) {\r\n    return isRef(ref) ? ref.value : ref;\r\n}\r\nconst shallowUnwrapHandlers = {\r\n    get: (target, key, receiver) => unref(Reflect.get(target, key, receiver)),\r\n    set: (target, key, value, receiver) => {\r\n        const oldValue = target[key];\r\n        if (isRef(oldValue) && !isRef(value)) {\r\n            oldValue.value = value;\r\n            return true;\r\n        }\r\n        else {\r\n            return Reflect.set(target, key, value, receiver);\r\n        }\r\n    }\r\n};\r\nfunction proxyRefs(objectWithRefs) {\r\n    return isReactive(objectWithRefs)\r\n        ? objectWithRefs\r\n        : new Proxy(objectWithRefs, shallowUnwrapHandlers);\r\n}\r\nclass CustomRefImpl {\r\n    constructor(factory) {\r\n        this.__v_isRef = true;\r\n        const { get, set } = factory(() => track(this, \"get\" /* GET */, 'value'), () => trigger(this, \"set\" /* SET */, 'value'));\r\n        this._get = get;\r\n        this._set = set;\r\n    }\r\n    get value() {\r\n        return this._get();\r\n    }\r\n    set value(newVal) {\r\n        this._set(newVal);\r\n    }\r\n}\r\nfunction customRef(factory) {\r\n    return new CustomRefImpl(factory);\r\n}\r\nfunction toRefs(object) {\r\n    const ret = shared.isArray(object) ? new Array(object.length) : {};\r\n    for (const key in object) {\r\n        ret[key] = toRef(object, key);\r\n    }\r\n    return ret;\r\n}\r\nclass ObjectRefImpl {\r\n    constructor(_object, _key) {\r\n        this._object = _object;\r\n        this._key = _key;\r\n        this.__v_isRef = true;\r\n    }\r\n    get value() {\r\n        return this._object[this._key];\r\n    }\r\n    set value(newVal) {\r\n        this._object[this._key] = newVal;\r\n    }\r\n}\r\nfunction toRef(object, key) {\r\n    return isRef(object[key])\r\n        ? object[key]\r\n        : new ObjectRefImpl(object, key);\r\n}\n\nclass ComputedRefImpl {\r\n    constructor(getter, _setter, isReadonly) {\r\n        this._setter = _setter;\r\n        this._dirty = true;\r\n        this.__v_isRef = true;\r\n        this.effect = effect(getter, {\r\n            lazy: true,\r\n            scheduler: () => {\r\n                if (!this._dirty) {\r\n                    this._dirty = true;\r\n                    trigger(toRaw(this), \"set\" /* SET */, 'value');\r\n                }\r\n            }\r\n        });\r\n        this[\"__v_isReadonly\" /* IS_READONLY */] = isReadonly;\r\n    }\r\n    get value() {\r\n        // the computed ref may get wrapped by other proxies e.g. readonly() #3376\r\n        const self = toRaw(this);\r\n        if (self._dirty) {\r\n            self._value = this.effect();\r\n            self._dirty = false;\r\n        }\r\n        track(self, \"get\" /* GET */, 'value');\r\n        return self._value;\r\n    }\r\n    set value(newValue) {\r\n        this._setter(newValue);\r\n    }\r\n}\r\nfunction computed(getterOrOptions) {\r\n    let getter;\r\n    let setter;\r\n    if (shared.isFunction(getterOrOptions)) {\r\n        getter = getterOrOptions;\r\n        setter = shared.NOOP;\r\n    }\r\n    else {\r\n        getter = getterOrOptions.get;\r\n        setter = getterOrOptions.set;\r\n    }\r\n    return new ComputedRefImpl(getter, setter, shared.isFunction(getterOrOptions) || !getterOrOptions.set);\r\n}\n\nexports.ITERATE_KEY = ITERATE_KEY;\nexports.computed = computed;\nexports.customRef = customRef;\nexports.effect = effect;\nexports.enableTracking = enableTracking;\nexports.isProxy = isProxy;\nexports.isReactive = isReactive;\nexports.isReadonly = isReadonly;\nexports.isRef = isRef;\nexports.markRaw = markRaw;\nexports.pauseTracking = pauseTracking;\nexports.proxyRefs = proxyRefs;\nexports.reactive = reactive;\nexports.readonly = readonly;\nexports.ref = ref;\nexports.resetTracking = resetTracking;\nexports.shallowReactive = shallowReactive;\nexports.shallowReadonly = shallowReadonly;\nexports.shallowRef = shallowRef;\nexports.stop = stop;\nexports.toRaw = toRaw;\nexports.toRef = toRef;\nexports.toRefs = toRefs;\nexports.track = track;\nexports.trigger = trigger;\nexports.triggerRef = triggerRef;\nexports.unref = unref;\n","/*!\n  * vue-router v4.0.8\n  * (c) 2021 Eduardo San Martin Morote\n  * @license MIT\n  */\n'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar vue = require('vue');\nvar devtoolsApi = require('@vue/devtools-api');\n\nconst hasSymbol = typeof Symbol === 'function' && typeof Symbol.toStringTag === 'symbol';\r\nconst PolySymbol = (name) => \r\n// vr = vue router\r\nhasSymbol\r\n    ? Symbol('[vue-router]: ' + name )\r\n    : ('[vue-router]: ' ) + name;\r\n// rvlm = Router View Location Matched\r\n/**\r\n * RouteRecord being rendered by the closest ancestor Router View. Used for\r\n * `onBeforeRouteUpdate` and `onBeforeRouteLeave`. rvlm stands for Router View\r\n * Location Matched\r\n *\r\n * @internal\r\n */\r\nconst matchedRouteKey = /*#__PURE__*/ PolySymbol('router view location matched' );\r\n/**\r\n * Allows overriding the router view depth to control which component in\r\n * `matched` is rendered. rvd stands for Router View Depth\r\n *\r\n * @internal\r\n */\r\nconst viewDepthKey = /*#__PURE__*/ PolySymbol('router view depth' );\r\n/**\r\n * Allows overriding the router instance returned by `useRouter` in tests. r\r\n * stands for router\r\n *\r\n * @internal\r\n */\r\nconst routerKey = /*#__PURE__*/ PolySymbol('router' );\r\n/**\r\n * Allows overriding the current route returned by `useRoute` in tests. rl\r\n * stands for route location\r\n *\r\n * @internal\r\n */\r\nconst routeLocationKey = /*#__PURE__*/ PolySymbol('route location' );\r\n/**\r\n * Allows overriding the current route used by router-view. Internally this is\r\n * used when the `route` prop is passed.\r\n *\r\n * @internal\r\n */\r\nconst routerViewLocationKey = /*#__PURE__*/ PolySymbol('router view location' );\n\nconst isBrowser = typeof window !== 'undefined';\n\nfunction isESModule(obj) {\r\n    return obj.__esModule || (hasSymbol && obj[Symbol.toStringTag] === 'Module');\r\n}\r\nconst assign = Object.assign;\r\nfunction applyToParams(fn, params) {\r\n    const newParams = {};\r\n    for (const key in params) {\r\n        const value = params[key];\r\n        newParams[key] = Array.isArray(value) ? value.map(fn) : fn(value);\r\n    }\r\n    return newParams;\r\n}\r\nlet noop = () => { };\n\nfunction warn(msg) {\r\n    // avoid using ...args as it breaks in older Edge builds\r\n    const args = Array.from(arguments).slice(1);\r\n    console.warn.apply(console, ['[Vue Router warn]: ' + msg].concat(args));\r\n}\n\nconst TRAILING_SLASH_RE = /\\/$/;\r\nconst removeTrailingSlash = (path) => path.replace(TRAILING_SLASH_RE, '');\r\n/**\r\n * Transforms an URI into a normalized history location\r\n *\r\n * @param parseQuery\r\n * @param location - URI to normalize\r\n * @param currentLocation - current absolute location. Allows resolving relative\r\n * paths. Must start with `/`. Defaults to `/`\r\n * @returns a normalized history location\r\n */\r\nfunction parseURL(parseQuery, location, currentLocation = '/') {\r\n    let path, query = {}, searchString = '', hash = '';\r\n    // Could use URL and URLSearchParams but IE 11 doesn't support it\r\n    const searchPos = location.indexOf('?');\r\n    const hashPos = location.indexOf('#', searchPos > -1 ? searchPos : 0);\r\n    if (searchPos > -1) {\r\n        path = location.slice(0, searchPos);\r\n        searchString = location.slice(searchPos + 1, hashPos > -1 ? hashPos : location.length);\r\n        query = parseQuery(searchString);\r\n    }\r\n    if (hashPos > -1) {\r\n        path = path || location.slice(0, hashPos);\r\n        // keep the # character\r\n        hash = location.slice(hashPos, location.length);\r\n    }\r\n    // no search and no query\r\n    path = resolveRelativePath(path != null ? path : location, currentLocation);\r\n    // empty path means a relative query or hash `?foo=f`, `#thing`\r\n    return {\r\n        fullPath: path + (searchString && '?') + searchString + hash,\r\n        path,\r\n        query,\r\n        hash,\r\n    };\r\n}\r\n/**\r\n * Stringifies a URL object\r\n *\r\n * @param stringifyQuery\r\n * @param location\r\n */\r\nfunction stringifyURL(stringifyQuery, location) {\r\n    let query = location.query ? stringifyQuery(location.query) : '';\r\n    return location.path + (query && '?') + query + (location.hash || '');\r\n}\r\n/**\r\n * Strips off the base from the beginning of a location.pathname in a non\r\n * case-sensitive way.\r\n *\r\n * @param pathname - location.pathname\r\n * @param base - base to strip off\r\n */\r\nfunction stripBase(pathname, base) {\r\n    // no base or base is not found at the beginning\r\n    if (!base || pathname.toLowerCase().indexOf(base.toLowerCase()))\r\n        return pathname;\r\n    return pathname.slice(base.length) || '/';\r\n}\r\n/**\r\n * Checks if two RouteLocation are equal. This means that both locations are\r\n * pointing towards the same {@link RouteRecord} and that all `params`, `query`\r\n * parameters and `hash` are the same\r\n *\r\n * @param a - first {@link RouteLocation}\r\n * @param b - second {@link RouteLocation}\r\n */\r\nfunction isSameRouteLocation(stringifyQuery, a, b) {\r\n    let aLastIndex = a.matched.length - 1;\r\n    let bLastIndex = b.matched.length - 1;\r\n    return (aLastIndex > -1 &&\r\n        aLastIndex === bLastIndex &&\r\n        isSameRouteRecord(a.matched[aLastIndex], b.matched[bLastIndex]) &&\r\n        isSameRouteLocationParams(a.params, b.params) &&\r\n        stringifyQuery(a.query) === stringifyQuery(b.query) &&\r\n        a.hash === b.hash);\r\n}\r\n/**\r\n * Check if two `RouteRecords` are equal. Takes into account aliases: they are\r\n * considered equal to the `RouteRecord` they are aliasing.\r\n *\r\n * @param a - first {@link RouteRecord}\r\n * @param b - second {@link RouteRecord}\r\n */\r\nfunction isSameRouteRecord(a, b) {\r\n    // since the original record has an undefined value for aliasOf\r\n    // but all aliases point to the original record, this will always compare\r\n    // the original record\r\n    return (a.aliasOf || a) === (b.aliasOf || b);\r\n}\r\nfunction isSameRouteLocationParams(a, b) {\r\n    if (Object.keys(a).length !== Object.keys(b).length)\r\n        return false;\r\n    for (let key in a) {\r\n        if (!isSameRouteLocationParamsValue(a[key], b[key]))\r\n            return false;\r\n    }\r\n    return true;\r\n}\r\nfunction isSameRouteLocationParamsValue(a, b) {\r\n    return Array.isArray(a)\r\n        ? isEquivalentArray(a, b)\r\n        : Array.isArray(b)\r\n            ? isEquivalentArray(b, a)\r\n            : a === b;\r\n}\r\n/**\r\n * Check if two arrays are the same or if an array with one single entry is the\r\n * same as another primitive value. Used to check query and parameters\r\n *\r\n * @param a - array of values\r\n * @param b - array of values or a single value\r\n */\r\nfunction isEquivalentArray(a, b) {\r\n    return Array.isArray(b)\r\n        ? a.length === b.length && a.every((value, i) => value === b[i])\r\n        : a.length === 1 && a[0] === b;\r\n}\r\n/**\r\n * Resolves a relative path that starts with `.`.\r\n *\r\n * @param to - path location we are resolving\r\n * @param from - currentLocation.path, should start with `/`\r\n */\r\nfunction resolveRelativePath(to, from) {\r\n    if (to.startsWith('/'))\r\n        return to;\r\n    if (!from.startsWith('/')) {\r\n        warn(`Cannot resolve a relative location without an absolute path. Trying to resolve \"${to}\" from \"${from}\". It should look like \"/${from}\".`);\r\n        return to;\r\n    }\r\n    if (!to)\r\n        return from;\r\n    const fromSegments = from.split('/');\r\n    const toSegments = to.split('/');\r\n    let position = fromSegments.length - 1;\r\n    let toPosition;\r\n    let segment;\r\n    for (toPosition = 0; toPosition < toSegments.length; toPosition++) {\r\n        segment = toSegments[toPosition];\r\n        // can't go below zero\r\n        if (position === 1 || segment === '.')\r\n            continue;\r\n        if (segment === '..')\r\n            position--;\r\n        // found something that is not relative path\r\n        else\r\n            break;\r\n    }\r\n    return (fromSegments.slice(0, position).join('/') +\r\n        '/' +\r\n        toSegments\r\n            .slice(toPosition - (toPosition === toSegments.length ? 1 : 0))\r\n            .join('/'));\r\n}\n\nvar NavigationType;\r\n(function (NavigationType) {\r\n    NavigationType[\"pop\"] = \"pop\";\r\n    NavigationType[\"push\"] = \"push\";\r\n})(NavigationType || (NavigationType = {}));\r\nvar NavigationDirection;\r\n(function (NavigationDirection) {\r\n    NavigationDirection[\"back\"] = \"back\";\r\n    NavigationDirection[\"forward\"] = \"forward\";\r\n    NavigationDirection[\"unknown\"] = \"\";\r\n})(NavigationDirection || (NavigationDirection = {}));\r\n/**\r\n * Starting location for Histories\r\n */\r\nconst START = '';\r\n// Generic utils\r\n/**\r\n * Normalizes a base by removing any trailing slash and reading the base tag if\r\n * present.\r\n *\r\n * @param base - base to normalize\r\n */\r\nfunction normalizeBase(base) {\r\n    if (!base) {\r\n        if (isBrowser) {\r\n            // respect <base> tag\r\n            const baseEl = document.querySelector('base');\r\n            base = (baseEl && baseEl.getAttribute('href')) || '/';\r\n            // strip full URL origin\r\n            base = base.replace(/^\\w+:\\/\\/[^\\/]+/, '');\r\n        }\r\n        else {\r\n            base = '/';\r\n        }\r\n    }\r\n    // ensure leading slash when it was removed by the regex above avoid leading\r\n    // slash with hash because the file could be read from the disk like file://\r\n    // and the leading slash would cause problems\r\n    if (base[0] !== '/' && base[0] !== '#')\r\n        base = '/' + base;\r\n    // remove the trailing slash so all other method can just do `base + fullPath`\r\n    // to build an href\r\n    return removeTrailingSlash(base);\r\n}\r\n// remove any character before the hash\r\nconst BEFORE_HASH_RE = /^[^#]+#/;\r\nfunction createHref(base, location) {\r\n    return base.replace(BEFORE_HASH_RE, '#') + location;\r\n}\n\nfunction getElementPosition(el, offset) {\r\n    const docRect = document.documentElement.getBoundingClientRect();\r\n    const elRect = el.getBoundingClientRect();\r\n    return {\r\n        behavior: offset.behavior,\r\n        left: elRect.left - docRect.left - (offset.left || 0),\r\n        top: elRect.top - docRect.top - (offset.top || 0),\r\n    };\r\n}\r\nconst computeScrollPosition = () => ({\r\n    left: window.pageXOffset,\r\n    top: window.pageYOffset,\r\n});\r\nfunction scrollToPosition(position) {\r\n    let scrollToOptions;\r\n    if ('el' in position) {\r\n        let positionEl = position.el;\r\n        const isIdSelector = typeof positionEl === 'string' && positionEl.startsWith('#');\r\n        /**\r\n         * `id`s can accept pretty much any characters, including CSS combinators\r\n         * like `>` or `~`. It's still possible to retrieve elements using\r\n         * `document.getElementById('~')` but it needs to be escaped when using\r\n         * `document.querySelector('#\\\\~')` for it to be valid. The only\r\n         * requirements for `id`s are them to be unique on the page and to not be\r\n         * empty (`id=\"\"`). Because of that, when passing an id selector, it should\r\n         * be properly escaped for it to work with `querySelector`. We could check\r\n         * for the id selector to be simple (no CSS combinators `+ >~`) but that\r\n         * would make things inconsistent since they are valid characters for an\r\n         * `id` but would need to be escaped when using `querySelector`, breaking\r\n         * their usage and ending up in no selector returned. Selectors need to be\r\n         * escaped:\r\n         *\r\n         * - `#1-thing` becomes `#\\31 -thing`\r\n         * - `#with~symbols` becomes `#with\\\\~symbols`\r\n         *\r\n         * - More information about  the topic can be found at\r\n         *   https://mathiasbynens.be/notes/html5-id-class.\r\n         * - Practical example: https://mathiasbynens.be/demo/html5-id\r\n         */\r\n        if (typeof position.el === 'string') {\r\n            if (!isIdSelector || !document.getElementById(position.el.slice(1))) {\r\n                try {\r\n                    let foundEl = document.querySelector(position.el);\r\n                    if (isIdSelector && foundEl) {\r\n                        warn(`The selector \"${position.el}\" should be passed as \"el: document.querySelector('${position.el}')\" because it starts with \"#\".`);\r\n                        // return to avoid other warnings\r\n                        return;\r\n                    }\r\n                }\r\n                catch (err) {\r\n                    warn(`The selector \"${position.el}\" is invalid. If you are using an id selector, make sure to escape it. You can find more information about escaping characters in selectors at https://mathiasbynens.be/notes/css-escapes or use CSS.escape (https://developer.mozilla.org/en-US/docs/Web/API/CSS/escape).`);\r\n                    // return to avoid other warnings\r\n                    return;\r\n                }\r\n            }\r\n        }\r\n        const el = typeof positionEl === 'string'\r\n            ? isIdSelector\r\n                ? document.getElementById(positionEl.slice(1))\r\n                : document.querySelector(positionEl)\r\n            : positionEl;\r\n        if (!el) {\r\n            warn(`Couldn't find element using selector \"${position.el}\" returned by scrollBehavior.`);\r\n            return;\r\n        }\r\n        scrollToOptions = getElementPosition(el, position);\r\n    }\r\n    else {\r\n        scrollToOptions = position;\r\n    }\r\n    if ('scrollBehavior' in document.documentElement.style)\r\n        window.scrollTo(scrollToOptions);\r\n    else {\r\n        window.scrollTo(scrollToOptions.left != null ? scrollToOptions.left : window.pageXOffset, scrollToOptions.top != null ? scrollToOptions.top : window.pageYOffset);\r\n    }\r\n}\r\nfunction getScrollKey(path, delta) {\r\n    const position = history.state ? history.state.position - delta : -1;\r\n    return position + path;\r\n}\r\nconst scrollPositions = new Map();\r\nfunction saveScrollPosition(key, scrollPosition) {\r\n    scrollPositions.set(key, scrollPosition);\r\n}\r\nfunction getSavedScrollPosition(key) {\r\n    const scroll = scrollPositions.get(key);\r\n    // consume it so it's not used again\r\n    scrollPositions.delete(key);\r\n    return scroll;\r\n}\r\n// TODO: RFC about how to save scroll position\r\n/**\r\n * ScrollBehavior instance used by the router to compute and restore the scroll\r\n * position when navigating.\r\n */\r\n// export interface ScrollHandler<ScrollPositionEntry extends HistoryStateValue, ScrollPosition extends ScrollPositionEntry> {\r\n//   // returns a scroll position that can be saved in history\r\n//   compute(): ScrollPositionEntry\r\n//   // can take an extended ScrollPositionEntry\r\n//   scroll(position: ScrollPosition): void\r\n// }\r\n// export const scrollHandler: ScrollHandler<ScrollPosition> = {\r\n//   compute: computeScroll,\r\n//   scroll: scrollToPosition,\r\n// }\n\nlet createBaseLocation = () => location.protocol + '//' + location.host;\r\n/**\r\n * Creates a normalized history location from a window.location object\r\n * @param location -\r\n */\r\nfunction createCurrentLocation(base, location) {\r\n    const { pathname, search, hash } = location;\r\n    // allows hash bases like #, /#, #/, #!, #!/, /#!/, or even /folder#end\r\n    const hashPos = base.indexOf('#');\r\n    if (hashPos > -1) {\r\n        let slicePos = hash.includes(base.slice(hashPos))\r\n            ? base.slice(hashPos).length\r\n            : 1;\r\n        let pathFromHash = hash.slice(slicePos);\r\n        // prepend the starting slash to hash so the url starts with /#\r\n        if (pathFromHash[0] !== '/')\r\n            pathFromHash = '/' + pathFromHash;\r\n        return stripBase(pathFromHash, '');\r\n    }\r\n    const path = stripBase(pathname, base);\r\n    return path + search + hash;\r\n}\r\nfunction useHistoryListeners(base, historyState, currentLocation, replace) {\r\n    let listeners = [];\r\n    let teardowns = [];\r\n    // TODO: should it be a stack? a Dict. Check if the popstate listener\r\n    // can trigger twice\r\n    let pauseState = null;\r\n    const popStateHandler = ({ state, }) => {\r\n        const to = createCurrentLocation(base, location);\r\n        const from = currentLocation.value;\r\n        const fromState = historyState.value;\r\n        let delta = 0;\r\n        if (state) {\r\n            currentLocation.value = to;\r\n            historyState.value = state;\r\n            // ignore the popstate and reset the pauseState\r\n            if (pauseState && pauseState === from) {\r\n                pauseState = null;\r\n                return;\r\n            }\r\n            delta = fromState ? state.position - fromState.position : 0;\r\n        }\r\n        else {\r\n            replace(to);\r\n        }\r\n        // console.log({ deltaFromCurrent })\r\n        // Here we could also revert the navigation by calling history.go(-delta)\r\n        // this listener will have to be adapted to not trigger again and to wait for the url\r\n        // to be updated before triggering the listeners. Some kind of validation function would also\r\n        // need to be passed to the listeners so the navigation can be accepted\r\n        // call all listeners\r\n        listeners.forEach(listener => {\r\n            listener(currentLocation.value, from, {\r\n                delta,\r\n                type: NavigationType.pop,\r\n                direction: delta\r\n                    ? delta > 0\r\n                        ? NavigationDirection.forward\r\n                        : NavigationDirection.back\r\n                    : NavigationDirection.unknown,\r\n            });\r\n        });\r\n    };\r\n    function pauseListeners() {\r\n        pauseState = currentLocation.value;\r\n    }\r\n    function listen(callback) {\r\n        // setup the listener and prepare teardown callbacks\r\n        listeners.push(callback);\r\n        const teardown = () => {\r\n            const index = listeners.indexOf(callback);\r\n            if (index > -1)\r\n                listeners.splice(index, 1);\r\n        };\r\n        teardowns.push(teardown);\r\n        return teardown;\r\n    }\r\n    function beforeUnloadListener() {\r\n        const { history } = window;\r\n        if (!history.state)\r\n            return;\r\n        history.replaceState(assign({}, history.state, { scroll: computeScrollPosition() }), '');\r\n    }\r\n    function destroy() {\r\n        for (const teardown of teardowns)\r\n            teardown();\r\n        teardowns = [];\r\n        window.removeEventListener('popstate', popStateHandler);\r\n        window.removeEventListener('beforeunload', beforeUnloadListener);\r\n    }\r\n    // setup the listeners and prepare teardown callbacks\r\n    window.addEventListener('popstate', popStateHandler);\r\n    window.addEventListener('beforeunload', beforeUnloadListener);\r\n    return {\r\n        pauseListeners,\r\n        listen,\r\n        destroy,\r\n    };\r\n}\r\n/**\r\n * Creates a state object\r\n */\r\nfunction buildState(back, current, forward, replaced = false, computeScroll = false) {\r\n    return {\r\n        back,\r\n        current,\r\n        forward,\r\n        replaced,\r\n        position: window.history.length,\r\n        scroll: computeScroll ? computeScrollPosition() : null,\r\n    };\r\n}\r\nfunction useHistoryStateNavigation(base) {\r\n    const { history, location } = window;\r\n    // private variables\r\n    let currentLocation = {\r\n        value: createCurrentLocation(base, location),\r\n    };\r\n    let historyState = { value: history.state };\r\n    // build current history entry as this is a fresh navigation\r\n    if (!historyState.value) {\r\n        changeLocation(currentLocation.value, {\r\n            back: null,\r\n            current: currentLocation.value,\r\n            forward: null,\r\n            // the length is off by one, we need to decrease it\r\n            position: history.length - 1,\r\n            replaced: true,\r\n            // don't add a scroll as the user may have an anchor and we want\r\n            // scrollBehavior to be triggered without a saved position\r\n            scroll: null,\r\n        }, true);\r\n    }\r\n    function changeLocation(to, state, replace) {\r\n        /**\r\n         * if a base tag is provided and we are on a normal domain, we have to\r\n         * respect the provided `base` attribute because pushState() will use it and\r\n         * potentially erase anything before the `#` like at\r\n         * https://github.com/vuejs/vue-router-next/issues/685 where a base of\r\n         * `/folder/#` but a base of `/` would erase the `/folder/` section. If\r\n         * there is no host, the `<base>` tag makes no sense and if there isn't a\r\n         * base tag we can just use everything after the `#`.\r\n         */\r\n        const hashIndex = base.indexOf('#');\r\n        const url = hashIndex > -1\r\n            ? (location.host && document.querySelector('base')\r\n                ? base\r\n                : base.slice(hashIndex)) + to\r\n            : createBaseLocation() + base + to;\r\n        try {\r\n            // BROWSER QUIRK\r\n            // NOTE: Safari throws a SecurityError when calling this function 100 times in 30 seconds\r\n            history[replace ? 'replaceState' : 'pushState'](state, '', url);\r\n            historyState.value = state;\r\n        }\r\n        catch (err) {\r\n            {\r\n                warn('Error with push/replace State', err);\r\n            }\r\n            // Force the navigation, this also resets the call count\r\n            location[replace ? 'replace' : 'assign'](url);\r\n        }\r\n    }\r\n    function replace(to, data) {\r\n        const state = assign({}, history.state, buildState(historyState.value.back, \r\n        // keep back and forward entries but override current position\r\n        to, historyState.value.forward, true), data, { position: historyState.value.position });\r\n        changeLocation(to, state, true);\r\n        currentLocation.value = to;\r\n    }\r\n    function push(to, data) {\r\n        // Add to current entry the information of where we are going\r\n        // as well as saving the current position\r\n        const currentState = assign({}, \r\n        // use current history state to gracefully handle a wrong call to\r\n        // history.replaceState\r\n        // https://github.com/vuejs/vue-router-next/issues/366\r\n        historyState.value, history.state, {\r\n            forward: to,\r\n            scroll: computeScrollPosition(),\r\n        });\r\n        if (!history.state) {\r\n            warn(`history.state seems to have been manually replaced without preserving the necessary values. Make sure to preserve existing history state if you are manually calling history.replaceState:\\n\\n` +\r\n                `history.replaceState(history.state, '', url)\\n\\n` +\r\n                `You can find more information at https://next.router.vuejs.org/guide/migration/#usage-of-history-state.`);\r\n        }\r\n        changeLocation(currentState.current, currentState, true);\r\n        const state = assign({}, buildState(currentLocation.value, to, null), { position: currentState.position + 1 }, data);\r\n        changeLocation(to, state, false);\r\n        currentLocation.value = to;\r\n    }\r\n    return {\r\n        location: currentLocation,\r\n        state: historyState,\r\n        push,\r\n        replace,\r\n    };\r\n}\r\n/**\r\n * Creates an HTML5 history. Most common history for single page applications.\r\n *\r\n * @param base -\r\n */\r\nfunction createWebHistory(base) {\r\n    base = normalizeBase(base);\r\n    const historyNavigation = useHistoryStateNavigation(base);\r\n    const historyListeners = useHistoryListeners(base, historyNavigation.state, historyNavigation.location, historyNavigation.replace);\r\n    function go(delta, triggerListeners = true) {\r\n        if (!triggerListeners)\r\n            historyListeners.pauseListeners();\r\n        history.go(delta);\r\n    }\r\n    const routerHistory = assign({\r\n        // it's overridden right after\r\n        location: '',\r\n        base,\r\n        go,\r\n        createHref: createHref.bind(null, base),\r\n    }, historyNavigation, historyListeners);\r\n    Object.defineProperty(routerHistory, 'location', {\r\n        enumerable: true,\r\n        get: () => historyNavigation.location.value,\r\n    });\r\n    Object.defineProperty(routerHistory, 'state', {\r\n        enumerable: true,\r\n        get: () => historyNavigation.state.value,\r\n    });\r\n    return routerHistory;\r\n}\n\n/**\r\n * Creates a in-memory based history. The main purpose of this history is to handle SSR. It starts in a special location that is nowhere.\r\n * It's up to the user to replace that location with the starter location by either calling `router.push` or `router.replace`.\r\n *\r\n * @param base - Base applied to all urls, defaults to '/'\r\n * @returns a history object that can be passed to the router constructor\r\n */\r\nfunction createMemoryHistory(base = '') {\r\n    let listeners = [];\r\n    let queue = [START];\r\n    let position = 0;\r\n    function setLocation(location) {\r\n        position++;\r\n        if (position === queue.length) {\r\n            // we are at the end, we can simply append a new entry\r\n            queue.push(location);\r\n        }\r\n        else {\r\n            // we are in the middle, we remove everything from here in the queue\r\n            queue.splice(position);\r\n            queue.push(location);\r\n        }\r\n    }\r\n    function triggerListeners(to, from, { direction, delta }) {\r\n        const info = {\r\n            direction,\r\n            delta,\r\n            type: NavigationType.pop,\r\n        };\r\n        for (let callback of listeners) {\r\n            callback(to, from, info);\r\n        }\r\n    }\r\n    const routerHistory = {\r\n        // rewritten by Object.defineProperty\r\n        location: START,\r\n        // TODO: should be kept in queue\r\n        state: {},\r\n        base,\r\n        createHref: createHref.bind(null, base),\r\n        replace(to) {\r\n            // remove current entry and decrement position\r\n            queue.splice(position--, 1);\r\n            setLocation(to);\r\n        },\r\n        push(to, data) {\r\n            setLocation(to);\r\n        },\r\n        listen(callback) {\r\n            listeners.push(callback);\r\n            return () => {\r\n                const index = listeners.indexOf(callback);\r\n                if (index > -1)\r\n                    listeners.splice(index, 1);\r\n            };\r\n        },\r\n        destroy() {\r\n            listeners = [];\r\n            queue = [START];\r\n            position = 0;\r\n        },\r\n        go(delta, shouldTrigger = true) {\r\n            const from = this.location;\r\n            const direction = \r\n            // we are considering delta === 0 going forward, but in abstract mode\r\n            // using 0 for the delta doesn't make sense like it does in html5 where\r\n            // it reloads the page\r\n            delta < 0 ? NavigationDirection.back : NavigationDirection.forward;\r\n            position = Math.max(0, Math.min(position + delta, queue.length - 1));\r\n            if (shouldTrigger) {\r\n                triggerListeners(this.location, from, {\r\n                    direction,\r\n                    delta,\r\n                });\r\n            }\r\n        },\r\n    };\r\n    Object.defineProperty(routerHistory, 'location', {\r\n        enumerable: true,\r\n        get: () => queue[position],\r\n    });\r\n    return routerHistory;\r\n}\n\n/**\r\n * Creates a hash history. Useful for web applications with no host (e.g.\r\n * `file://`) or when configuring a server to handle any URL is not possible.\r\n *\r\n * @param base - optional base to provide. Defaults to `location.pathname +\r\n * location.search` If there is a `<base>` tag in the `head`, its value will be\r\n * ignored in favor of this parameter **but note it affects all the\r\n * history.pushState() calls**, meaning that if you use a `<base>` tag, it's\r\n * `href` value **has to match this parameter** (ignoring anything after the\r\n * `#`).\r\n *\r\n * @example\r\n * ```js\r\n * // at https://example.com/folder\r\n * createWebHashHistory() // gives a url of `https://example.com/folder#`\r\n * createWebHashHistory('/folder/') // gives a url of `https://example.com/folder/#`\r\n * // if the `#` is provided in the base, it won't be added by `createWebHashHistory`\r\n * createWebHashHistory('/folder/#/app/') // gives a url of `https://example.com/folder/#/app/`\r\n * // you should avoid doing this because it changes the original url and breaks copying urls\r\n * createWebHashHistory('/other-folder/') // gives a url of `https://example.com/other-folder/#`\r\n *\r\n * // at file:///usr/etc/folder/index.html\r\n * // for locations with no `host`, the base is ignored\r\n * createWebHashHistory('/iAmIgnored') // gives a url of `file:///usr/etc/folder/index.html#`\r\n * ```\r\n */\r\nfunction createWebHashHistory(base) {\r\n    // Make sure this implementation is fine in terms of encoding, specially for IE11\r\n    // for `file://`, directly use the pathname and ignore the base\r\n    // location.pathname contains an initial `/` even at the root: `https://example.com`\r\n    base = location.host ? base || location.pathname + location.search : '';\r\n    // allow the user to provide a `#` in the middle: `/base/#/app`\r\n    if (base.indexOf('#') < 0)\r\n        base += '#';\r\n    if (!base.endsWith('#/') && !base.endsWith('#')) {\r\n        warn(`A hash base must end with a \"#\":\\n\"${base}\" should be \"${base.replace(/#.*$/, '#')}\".`);\r\n    }\r\n    return createWebHistory(base);\r\n}\n\nfunction isRouteLocation(route) {\r\n    return typeof route === 'string' || (route && typeof route === 'object');\r\n}\r\nfunction isRouteName(name) {\r\n    return typeof name === 'string' || typeof name === 'symbol';\r\n}\n\n/**\r\n * Initial route location where the router is. Can be used in navigation guards\r\n * to differentiate the initial navigation.\r\n *\r\n * @example\r\n * ```js\r\n * import { START_LOCATION } from 'vue-router'\r\n *\r\n * router.beforeEach((to, from) => {\r\n *   if (from === START_LOCATION) {\r\n *     // initial navigation\r\n *   }\r\n * })\r\n * ```\r\n */\r\nconst START_LOCATION_NORMALIZED = {\r\n    path: '/',\r\n    name: undefined,\r\n    params: {},\r\n    query: {},\r\n    hash: '',\r\n    fullPath: '/',\r\n    matched: [],\r\n    meta: {},\r\n    redirectedFrom: undefined,\r\n};\n\nconst NavigationFailureSymbol = /*#__PURE__*/ PolySymbol('navigation failure' );\r\n/**\r\n * Enumeration with all possible types for navigation failures. Can be passed to\r\n * {@link isNavigationFailure} to check for specific failures.\r\n */\r\nexports.NavigationFailureType = void 0;\r\n(function (NavigationFailureType) {\r\n    /**\r\n     * An aborted navigation is a navigation that failed because a navigation\r\n     * guard returned `false` or called `next(false)`\r\n     */\r\n    NavigationFailureType[NavigationFailureType[\"aborted\"] = 4] = \"aborted\";\r\n    /**\r\n     * A cancelled navigation is a navigation that failed because a more recent\r\n     * navigation finished started (not necessarily finished).\r\n     */\r\n    NavigationFailureType[NavigationFailureType[\"cancelled\"] = 8] = \"cancelled\";\r\n    /**\r\n     * A duplicated navigation is a navigation that failed because it was\r\n     * initiated while already being at the exact same location.\r\n     */\r\n    NavigationFailureType[NavigationFailureType[\"duplicated\"] = 16] = \"duplicated\";\r\n})(exports.NavigationFailureType || (exports.NavigationFailureType = {}));\r\n// DEV only debug messages\r\nconst ErrorTypeMessages = {\r\n    [1 /* MATCHER_NOT_FOUND */]({ location, currentLocation }) {\r\n        return `No match for\\n ${JSON.stringify(location)}${currentLocation\r\n            ? '\\nwhile being at\\n' + JSON.stringify(currentLocation)\r\n            : ''}`;\r\n    },\r\n    [2 /* NAVIGATION_GUARD_REDIRECT */]({ from, to, }) {\r\n        return `Redirected from \"${from.fullPath}\" to \"${stringifyRoute(to)}\" via a navigation guard.`;\r\n    },\r\n    [4 /* NAVIGATION_ABORTED */]({ from, to }) {\r\n        return `Navigation aborted from \"${from.fullPath}\" to \"${to.fullPath}\" via a navigation guard.`;\r\n    },\r\n    [8 /* NAVIGATION_CANCELLED */]({ from, to }) {\r\n        return `Navigation cancelled from \"${from.fullPath}\" to \"${to.fullPath}\" with a new navigation.`;\r\n    },\r\n    [16 /* NAVIGATION_DUPLICATED */]({ from, to }) {\r\n        return `Avoided redundant navigation to current location: \"${from.fullPath}\".`;\r\n    },\r\n};\r\nfunction createRouterError(type, params) {\r\n    // keep full error messages in cjs versions\r\n    {\r\n        return assign(new Error(ErrorTypeMessages[type](params)), {\r\n            type,\r\n            [NavigationFailureSymbol]: true,\r\n        }, params);\r\n    }\r\n}\r\nfunction isNavigationFailure(error, type) {\r\n    return (error instanceof Error &&\r\n        NavigationFailureSymbol in error &&\r\n        (type == null || !!(error.type & type)));\r\n}\r\nconst propertiesToLog = ['params', 'query', 'hash'];\r\nfunction stringifyRoute(to) {\r\n    if (typeof to === 'string')\r\n        return to;\r\n    if ('path' in to)\r\n        return to.path;\r\n    const location = {};\r\n    for (const key of propertiesToLog) {\r\n        if (key in to)\r\n            location[key] = to[key];\r\n    }\r\n    return JSON.stringify(location, null, 2);\r\n}\n\n// default pattern for a param: non greedy everything but /\r\nconst BASE_PARAM_PATTERN = '[^/]+?';\r\nconst BASE_PATH_PARSER_OPTIONS = {\r\n    sensitive: false,\r\n    strict: false,\r\n    start: true,\r\n    end: true,\r\n};\r\n// Special Regex characters that must be escaped in static tokens\r\nconst REGEX_CHARS_RE = /[.+*?^${}()[\\]/\\\\]/g;\r\n/**\r\n * Creates a path parser from an array of Segments (a segment is an array of Tokens)\r\n *\r\n * @param segments - array of segments returned by tokenizePath\r\n * @param extraOptions - optional options for the regexp\r\n * @returns a PathParser\r\n */\r\nfunction tokensToParser(segments, extraOptions) {\r\n    const options = assign({}, BASE_PATH_PARSER_OPTIONS, extraOptions);\r\n    // the amount of scores is the same as the length of segments except for the root segment \"/\"\r\n    let score = [];\r\n    // the regexp as a string\r\n    let pattern = options.start ? '^' : '';\r\n    // extracted keys\r\n    const keys = [];\r\n    for (const segment of segments) {\r\n        // the root segment needs special treatment\r\n        const segmentScores = segment.length ? [] : [90 /* Root */];\r\n        // allow trailing slash\r\n        if (options.strict && !segment.length)\r\n            pattern += '/';\r\n        for (let tokenIndex = 0; tokenIndex < segment.length; tokenIndex++) {\r\n            const token = segment[tokenIndex];\r\n            // resets the score if we are inside a sub segment /:a-other-:b\r\n            let subSegmentScore = 40 /* Segment */ +\r\n                (options.sensitive ? 0.25 /* BonusCaseSensitive */ : 0);\r\n            if (token.type === 0 /* Static */) {\r\n                // prepend the slash if we are starting a new segment\r\n                if (!tokenIndex)\r\n                    pattern += '/';\r\n                pattern += token.value.replace(REGEX_CHARS_RE, '\\\\$&');\r\n                subSegmentScore += 40 /* Static */;\r\n            }\r\n            else if (token.type === 1 /* Param */) {\r\n                const { value, repeatable, optional, regexp } = token;\r\n                keys.push({\r\n                    name: value,\r\n                    repeatable,\r\n                    optional,\r\n                });\r\n                const re = regexp ? regexp : BASE_PARAM_PATTERN;\r\n                // the user provided a custom regexp /:id(\\\\d+)\r\n                if (re !== BASE_PARAM_PATTERN) {\r\n                    subSegmentScore += 10 /* BonusCustomRegExp */;\r\n                    // make sure the regexp is valid before using it\r\n                    try {\r\n                        new RegExp(`(${re})`);\r\n                    }\r\n                    catch (err) {\r\n                        throw new Error(`Invalid custom RegExp for param \"${value}\" (${re}): ` +\r\n                            err.message);\r\n                    }\r\n                }\r\n                // when we repeat we must take care of the repeating leading slash\r\n                let subPattern = repeatable ? `((?:${re})(?:/(?:${re}))*)` : `(${re})`;\r\n                // prepend the slash if we are starting a new segment\r\n                if (!tokenIndex)\r\n                    subPattern =\r\n                        // avoid an optional / if there are more segments e.g. /:p?-static\r\n                        // or /:p?-:p2\r\n                        optional && segment.length < 2\r\n                            ? `(?:/${subPattern})`\r\n                            : '/' + subPattern;\r\n                if (optional)\r\n                    subPattern += '?';\r\n                pattern += subPattern;\r\n                subSegmentScore += 20 /* Dynamic */;\r\n                if (optional)\r\n                    subSegmentScore += -8 /* BonusOptional */;\r\n                if (repeatable)\r\n                    subSegmentScore += -20 /* BonusRepeatable */;\r\n                if (re === '.*')\r\n                    subSegmentScore += -50 /* BonusWildcard */;\r\n            }\r\n            segmentScores.push(subSegmentScore);\r\n        }\r\n        // an empty array like /home/ -> [[{home}], []]\r\n        // if (!segment.length) pattern += '/'\r\n        score.push(segmentScores);\r\n    }\r\n    // only apply the strict bonus to the last score\r\n    if (options.strict && options.end) {\r\n        const i = score.length - 1;\r\n        score[i][score[i].length - 1] += 0.7000000000000001 /* BonusStrict */;\r\n    }\r\n    // TODO: dev only warn double trailing slash\r\n    if (!options.strict)\r\n        pattern += '/?';\r\n    if (options.end)\r\n        pattern += '$';\r\n    // allow paths like /dynamic to only match dynamic or dynamic/... but not dynamic_something_else\r\n    else if (options.strict)\r\n        pattern += '(?:/|$)';\r\n    const re = new RegExp(pattern, options.sensitive ? '' : 'i');\r\n    function parse(path) {\r\n        const match = path.match(re);\r\n        const params = {};\r\n        if (!match)\r\n            return null;\r\n        for (let i = 1; i < match.length; i++) {\r\n            const value = match[i] || '';\r\n            const key = keys[i - 1];\r\n            params[key.name] = value && key.repeatable ? value.split('/') : value;\r\n        }\r\n        return params;\r\n    }\r\n    function stringify(params) {\r\n        let path = '';\r\n        // for optional parameters to allow to be empty\r\n        let avoidDuplicatedSlash = false;\r\n        for (const segment of segments) {\r\n            if (!avoidDuplicatedSlash || !path.endsWith('/'))\r\n                path += '/';\r\n            avoidDuplicatedSlash = false;\r\n            for (const token of segment) {\r\n                if (token.type === 0 /* Static */) {\r\n                    path += token.value;\r\n                }\r\n                else if (token.type === 1 /* Param */) {\r\n                    const { value, repeatable, optional } = token;\r\n                    const param = value in params ? params[value] : '';\r\n                    if (Array.isArray(param) && !repeatable)\r\n                        throw new Error(`Provided param \"${value}\" is an array but it is not repeatable (* or + modifiers)`);\r\n                    const text = Array.isArray(param) ? param.join('/') : param;\r\n                    if (!text) {\r\n                        if (optional) {\r\n                            // if we have more than one optional param like /:a?-static we\r\n                            // don't need to care about the optional param\r\n                            if (segment.length < 2) {\r\n                                // remove the last slash as we could be at the end\r\n                                if (path.endsWith('/'))\r\n                                    path = path.slice(0, -1);\r\n                                // do not append a slash on the next iteration\r\n                                else\r\n                                    avoidDuplicatedSlash = true;\r\n                            }\r\n                        }\r\n                        else\r\n                            throw new Error(`Missing required param \"${value}\"`);\r\n                    }\r\n                    path += text;\r\n                }\r\n            }\r\n        }\r\n        return path;\r\n    }\r\n    return {\r\n        re,\r\n        score,\r\n        keys,\r\n        parse,\r\n        stringify,\r\n    };\r\n}\r\n/**\r\n * Compares an array of numbers as used in PathParser.score and returns a\r\n * number. This function can be used to `sort` an array\r\n * @param a - first array of numbers\r\n * @param b - second array of numbers\r\n * @returns 0 if both are equal, < 0 if a should be sorted first, > 0 if b\r\n * should be sorted first\r\n */\r\nfunction compareScoreArray(a, b) {\r\n    let i = 0;\r\n    while (i < a.length && i < b.length) {\r\n        const diff = b[i] - a[i];\r\n        // only keep going if diff === 0\r\n        if (diff)\r\n            return diff;\r\n        i++;\r\n    }\r\n    // if the last subsegment was Static, the shorter segments should be sorted first\r\n    // otherwise sort the longest segment first\r\n    if (a.length < b.length) {\r\n        return a.length === 1 && a[0] === 40 /* Static */ + 40 /* Segment */\r\n            ? -1\r\n            : 1;\r\n    }\r\n    else if (a.length > b.length) {\r\n        return b.length === 1 && b[0] === 40 /* Static */ + 40 /* Segment */\r\n            ? 1\r\n            : -1;\r\n    }\r\n    return 0;\r\n}\r\n/**\r\n * Compare function that can be used with `sort` to sort an array of PathParser\r\n * @param a - first PathParser\r\n * @param b - second PathParser\r\n * @returns 0 if both are equal, < 0 if a should be sorted first, > 0 if b\r\n */\r\nfunction comparePathParserScore(a, b) {\r\n    let i = 0;\r\n    const aScore = a.score;\r\n    const bScore = b.score;\r\n    while (i < aScore.length && i < bScore.length) {\r\n        const comp = compareScoreArray(aScore[i], bScore[i]);\r\n        // do not return if both are equal\r\n        if (comp)\r\n            return comp;\r\n        i++;\r\n    }\r\n    // if a and b share the same score entries but b has more, sort b first\r\n    return bScore.length - aScore.length;\r\n    // this is the ternary version\r\n    // return aScore.length < bScore.length\r\n    //   ? 1\r\n    //   : aScore.length > bScore.length\r\n    //   ? -1\r\n    //   : 0\r\n}\n\nconst ROOT_TOKEN = {\r\n    type: 0 /* Static */,\r\n    value: '',\r\n};\r\nconst VALID_PARAM_RE = /[a-zA-Z0-9_]/;\r\n// After some profiling, the cache seems to be unnecessary because tokenizePath\r\n// (the slowest part of adding a route) is very fast\r\n// const tokenCache = new Map<string, Token[][]>()\r\nfunction tokenizePath(path) {\r\n    if (!path)\r\n        return [[]];\r\n    if (path === '/')\r\n        return [[ROOT_TOKEN]];\r\n    if (!path.startsWith('/')) {\r\n        throw new Error(`Route paths should start with a \"/\": \"${path}\" should be \"/${path}\".`\r\n            );\r\n    }\r\n    // if (tokenCache.has(path)) return tokenCache.get(path)!\r\n    function crash(message) {\r\n        throw new Error(`ERR (${state})/\"${buffer}\": ${message}`);\r\n    }\r\n    let state = 0 /* Static */;\r\n    let previousState = state;\r\n    const tokens = [];\r\n    // the segment will always be valid because we get into the initial state\r\n    // with the leading /\r\n    let segment;\r\n    function finalizeSegment() {\r\n        if (segment)\r\n            tokens.push(segment);\r\n        segment = [];\r\n    }\r\n    // index on the path\r\n    let i = 0;\r\n    // char at index\r\n    let char;\r\n    // buffer of the value read\r\n    let buffer = '';\r\n    // custom regexp for a param\r\n    let customRe = '';\r\n    function consumeBuffer() {\r\n        if (!buffer)\r\n            return;\r\n        if (state === 0 /* Static */) {\r\n            segment.push({\r\n                type: 0 /* Static */,\r\n                value: buffer,\r\n            });\r\n        }\r\n        else if (state === 1 /* Param */ ||\r\n            state === 2 /* ParamRegExp */ ||\r\n            state === 3 /* ParamRegExpEnd */) {\r\n            if (segment.length > 1 && (char === '*' || char === '+'))\r\n                crash(`A repeatable param (${buffer}) must be alone in its segment. eg: '/:ids+.`);\r\n            segment.push({\r\n                type: 1 /* Param */,\r\n                value: buffer,\r\n                regexp: customRe,\r\n                repeatable: char === '*' || char === '+',\r\n                optional: char === '*' || char === '?',\r\n            });\r\n        }\r\n        else {\r\n            crash('Invalid state to consume buffer');\r\n        }\r\n        buffer = '';\r\n    }\r\n    function addCharToBuffer() {\r\n        buffer += char;\r\n    }\r\n    while (i < path.length) {\r\n        char = path[i++];\r\n        if (char === '\\\\' && state !== 2 /* ParamRegExp */) {\r\n            previousState = state;\r\n            state = 4 /* EscapeNext */;\r\n            continue;\r\n        }\r\n        switch (state) {\r\n            case 0 /* Static */:\r\n                if (char === '/') {\r\n                    if (buffer) {\r\n                        consumeBuffer();\r\n                    }\r\n                    finalizeSegment();\r\n                }\r\n                else if (char === ':') {\r\n                    consumeBuffer();\r\n                    state = 1 /* Param */;\r\n                }\r\n                else {\r\n                    addCharToBuffer();\r\n                }\r\n                break;\r\n            case 4 /* EscapeNext */:\r\n                addCharToBuffer();\r\n                state = previousState;\r\n                break;\r\n            case 1 /* Param */:\r\n                if (char === '(') {\r\n                    state = 2 /* ParamRegExp */;\r\n                }\r\n                else if (VALID_PARAM_RE.test(char)) {\r\n                    addCharToBuffer();\r\n                }\r\n                else {\r\n                    consumeBuffer();\r\n                    state = 0 /* Static */;\r\n                    // go back one character if we were not modifying\r\n                    if (char !== '*' && char !== '?' && char !== '+')\r\n                        i--;\r\n                }\r\n                break;\r\n            case 2 /* ParamRegExp */:\r\n                // TODO: is it worth handling nested regexp? like :p(?:prefix_([^/]+)_suffix)\r\n                // it already works by escaping the closing )\r\n                // https://paths.esm.dev/?p=AAMeJbiAwQEcDKbAoAAkP60PG2R6QAvgNaA6AFACM2ABuQBB#\r\n                // is this really something people need since you can also write\r\n                // /prefix_:p()_suffix\r\n                if (char === ')') {\r\n                    // handle the escaped )\r\n                    if (customRe[customRe.length - 1] == '\\\\')\r\n                        customRe = customRe.slice(0, -1) + char;\r\n                    else\r\n                        state = 3 /* ParamRegExpEnd */;\r\n                }\r\n                else {\r\n                    customRe += char;\r\n                }\r\n                break;\r\n            case 3 /* ParamRegExpEnd */:\r\n                // same as finalizing a param\r\n                consumeBuffer();\r\n                state = 0 /* Static */;\r\n                // go back one character if we were not modifying\r\n                if (char !== '*' && char !== '?' && char !== '+')\r\n                    i--;\r\n                customRe = '';\r\n                break;\r\n            default:\r\n                crash('Unknown state');\r\n                break;\r\n        }\r\n    }\r\n    if (state === 2 /* ParamRegExp */)\r\n        crash(`Unfinished custom RegExp for param \"${buffer}\"`);\r\n    consumeBuffer();\r\n    finalizeSegment();\r\n    // tokenCache.set(path, tokens)\r\n    return tokens;\r\n}\n\nfunction createRouteRecordMatcher(record, parent, options) {\r\n    const parser = tokensToParser(tokenizePath(record.path), options);\r\n    // warn against params with the same name\r\n    {\r\n        const existingKeys = new Set();\r\n        for (const key of parser.keys) {\r\n            if (existingKeys.has(key.name))\r\n                warn(`Found duplicated params with name \"${key.name}\" for path \"${record.path}\". Only the last one will be available on \"$route.params\".`);\r\n            existingKeys.add(key.name);\r\n        }\r\n    }\r\n    const matcher = assign(parser, {\r\n        record,\r\n        parent,\r\n        // these needs to be populated by the parent\r\n        children: [],\r\n        alias: [],\r\n    });\r\n    if (parent) {\r\n        // both are aliases or both are not aliases\r\n        // we don't want to mix them because the order is used when\r\n        // passing originalRecord in Matcher.addRoute\r\n        if (!matcher.record.aliasOf === !parent.record.aliasOf)\r\n            parent.children.push(matcher);\r\n    }\r\n    return matcher;\r\n}\n\n/**\r\n * Creates a Router Matcher.\r\n *\r\n * @internal\r\n * @param routes - array of initial routes\r\n * @param globalOptions - global route options\r\n */\r\nfunction createRouterMatcher(routes, globalOptions) {\r\n    // normalized ordered array of matchers\r\n    const matchers = [];\r\n    const matcherMap = new Map();\r\n    globalOptions = mergeOptions({ strict: false, end: true, sensitive: false }, globalOptions);\r\n    function getRecordMatcher(name) {\r\n        return matcherMap.get(name);\r\n    }\r\n    function addRoute(record, parent, originalRecord) {\r\n        // used later on to remove by name\r\n        let isRootAdd = !originalRecord;\r\n        let mainNormalizedRecord = normalizeRouteRecord(record);\r\n        // we might be the child of an alias\r\n        mainNormalizedRecord.aliasOf = originalRecord && originalRecord.record;\r\n        const options = mergeOptions(globalOptions, record);\r\n        // generate an array of records to correctly handle aliases\r\n        const normalizedRecords = [\r\n            mainNormalizedRecord,\r\n        ];\r\n        if ('alias' in record) {\r\n            const aliases = typeof record.alias === 'string' ? [record.alias] : record.alias;\r\n            for (const alias of aliases) {\r\n                normalizedRecords.push(assign({}, mainNormalizedRecord, {\r\n                    // this allows us to hold a copy of the `components` option\r\n                    // so that async components cache is hold on the original record\r\n                    components: originalRecord\r\n                        ? originalRecord.record.components\r\n                        : mainNormalizedRecord.components,\r\n                    path: alias,\r\n                    // we might be the child of an alias\r\n                    aliasOf: originalRecord\r\n                        ? originalRecord.record\r\n                        : mainNormalizedRecord,\r\n                    // the aliases are always of the same kind as the original since they\r\n                    // are defined on the same record\r\n                }));\r\n            }\r\n        }\r\n        let matcher;\r\n        let originalMatcher;\r\n        for (const normalizedRecord of normalizedRecords) {\r\n            let { path } = normalizedRecord;\r\n            // Build up the path for nested routes if the child isn't an absolute\r\n            // route. Only add the / delimiter if the child path isn't empty and if the\r\n            // parent path doesn't have a trailing slash\r\n            if (parent && path[0] !== '/') {\r\n                let parentPath = parent.record.path;\r\n                let connectingSlash = parentPath[parentPath.length - 1] === '/' ? '' : '/';\r\n                normalizedRecord.path =\r\n                    parent.record.path + (path && connectingSlash + path);\r\n            }\r\n            if (normalizedRecord.path === '*') {\r\n                throw new Error('Catch all routes (\"*\") must now be defined using a param with a custom regexp.\\n' +\r\n                    'See more at https://next.router.vuejs.org/guide/migration/#removed-star-or-catch-all-routes.');\r\n            }\r\n            // create the object before hand so it can be passed to children\r\n            matcher = createRouteRecordMatcher(normalizedRecord, parent, options);\r\n            if (parent && path[0] === '/')\r\n                checkMissingParamsInAbsolutePath(matcher, parent);\r\n            // if we are an alias we must tell the original record that we exist\r\n            // so we can be removed\r\n            if (originalRecord) {\r\n                originalRecord.alias.push(matcher);\r\n                {\r\n                    checkSameParams(originalRecord, matcher);\r\n                }\r\n            }\r\n            else {\r\n                // otherwise, the first record is the original and others are aliases\r\n                originalMatcher = originalMatcher || matcher;\r\n                if (originalMatcher !== matcher)\r\n                    originalMatcher.alias.push(matcher);\r\n                // remove the route if named and only for the top record (avoid in nested calls)\r\n                // this works because the original record is the first one\r\n                if (isRootAdd && record.name && !isAliasRecord(matcher))\r\n                    removeRoute(record.name);\r\n            }\r\n            if ('children' in mainNormalizedRecord) {\r\n                let children = mainNormalizedRecord.children;\r\n                for (let i = 0; i < children.length; i++) {\r\n                    addRoute(children[i], matcher, originalRecord && originalRecord.children[i]);\r\n                }\r\n            }\r\n            // if there was no original record, then the first one was not an alias and all\r\n            // other alias (if any) need to reference this record when adding children\r\n            originalRecord = originalRecord || matcher;\r\n            // TODO: add normalized records for more flexibility\r\n            // if (parent && isAliasRecord(originalRecord)) {\r\n            //   parent.children.push(originalRecord)\r\n            // }\r\n            insertMatcher(matcher);\r\n        }\r\n        return originalMatcher\r\n            ? () => {\r\n                // since other matchers are aliases, they should be removed by the original matcher\r\n                removeRoute(originalMatcher);\r\n            }\r\n            : noop;\r\n    }\r\n    function removeRoute(matcherRef) {\r\n        if (isRouteName(matcherRef)) {\r\n            const matcher = matcherMap.get(matcherRef);\r\n            if (matcher) {\r\n                matcherMap.delete(matcherRef);\r\n                matchers.splice(matchers.indexOf(matcher), 1);\r\n                matcher.children.forEach(removeRoute);\r\n                matcher.alias.forEach(removeRoute);\r\n            }\r\n        }\r\n        else {\r\n            let index = matchers.indexOf(matcherRef);\r\n            if (index > -1) {\r\n                matchers.splice(index, 1);\r\n                if (matcherRef.record.name)\r\n                    matcherMap.delete(matcherRef.record.name);\r\n                matcherRef.children.forEach(removeRoute);\r\n                matcherRef.alias.forEach(removeRoute);\r\n            }\r\n        }\r\n    }\r\n    function getRoutes() {\r\n        return matchers;\r\n    }\r\n    function insertMatcher(matcher) {\r\n        let i = 0;\r\n        // console.log('i is', { i })\r\n        while (i < matchers.length &&\r\n            comparePathParserScore(matcher, matchers[i]) >= 0)\r\n            i++;\r\n        // console.log('END i is', { i })\r\n        // while (i < matchers.length && matcher.score <= matchers[i].score) i++\r\n        matchers.splice(i, 0, matcher);\r\n        // only add the original record to the name map\r\n        if (matcher.record.name && !isAliasRecord(matcher))\r\n            matcherMap.set(matcher.record.name, matcher);\r\n    }\r\n    function resolve(location, currentLocation) {\r\n        let matcher;\r\n        let params = {};\r\n        let path;\r\n        let name;\r\n        if ('name' in location && location.name) {\r\n            matcher = matcherMap.get(location.name);\r\n            if (!matcher)\r\n                throw createRouterError(1 /* MATCHER_NOT_FOUND */, {\r\n                    location,\r\n                });\r\n            name = matcher.record.name;\r\n            params = assign(\r\n            // paramsFromLocation is a new object\r\n            paramsFromLocation(currentLocation.params, \r\n            // only keep params that exist in the resolved location\r\n            // TODO: only keep optional params coming from a parent record\r\n            matcher.keys.filter(k => !k.optional).map(k => k.name)), location.params);\r\n            // throws if cannot be stringified\r\n            path = matcher.stringify(params);\r\n        }\r\n        else if ('path' in location) {\r\n            // no need to resolve the path with the matcher as it was provided\r\n            // this also allows the user to control the encoding\r\n            path = location.path;\r\n            if (!path.startsWith('/')) {\r\n                warn(`The Matcher cannot resolve relative paths but received \"${path}\". Unless you directly called \\`matcher.resolve(\"${path}\")\\`, this is probably a bug in vue-router. Please open an issue at https://new-issue.vuejs.org/?repo=vuejs/vue-router-next.`);\r\n            }\r\n            matcher = matchers.find(m => m.re.test(path));\r\n            // matcher should have a value after the loop\r\n            if (matcher) {\r\n                // TODO: dev warning of unused params if provided\r\n                // we know the matcher works because we tested the regexp\r\n                params = matcher.parse(path);\r\n                name = matcher.record.name;\r\n            }\r\n            // location is a relative path\r\n        }\r\n        else {\r\n            // match by name or path of current route\r\n            matcher = currentLocation.name\r\n                ? matcherMap.get(currentLocation.name)\r\n                : matchers.find(m => m.re.test(currentLocation.path));\r\n            if (!matcher)\r\n                throw createRouterError(1 /* MATCHER_NOT_FOUND */, {\r\n                    location,\r\n                    currentLocation,\r\n                });\r\n            name = matcher.record.name;\r\n            // since we are navigating to the same location, we don't need to pick the\r\n            // params like when `name` is provided\r\n            params = assign({}, currentLocation.params, location.params);\r\n            path = matcher.stringify(params);\r\n        }\r\n        const matched = [];\r\n        let parentMatcher = matcher;\r\n        while (parentMatcher) {\r\n            // reversed order so parents are at the beginning\r\n            matched.unshift(parentMatcher.record);\r\n            parentMatcher = parentMatcher.parent;\r\n        }\r\n        return {\r\n            name,\r\n            path,\r\n            params,\r\n            matched,\r\n            meta: mergeMetaFields(matched),\r\n        };\r\n    }\r\n    // add initial routes\r\n    routes.forEach(route => addRoute(route));\r\n    return { addRoute, resolve, removeRoute, getRoutes, getRecordMatcher };\r\n}\r\nfunction paramsFromLocation(params, keys) {\r\n    let newParams = {};\r\n    for (let key of keys) {\r\n        if (key in params)\r\n            newParams[key] = params[key];\r\n    }\r\n    return newParams;\r\n}\r\n/**\r\n * Normalizes a RouteRecordRaw. Creates a copy\r\n *\r\n * @param record\r\n * @returns the normalized version\r\n */\r\nfunction normalizeRouteRecord(record) {\r\n    return {\r\n        path: record.path,\r\n        redirect: record.redirect,\r\n        name: record.name,\r\n        meta: record.meta || {},\r\n        aliasOf: undefined,\r\n        beforeEnter: record.beforeEnter,\r\n        props: normalizeRecordProps(record),\r\n        children: record.children || [],\r\n        instances: {},\r\n        leaveGuards: new Set(),\r\n        updateGuards: new Set(),\r\n        enterCallbacks: {},\r\n        components: 'components' in record\r\n            ? record.components || {}\r\n            : { default: record.component },\r\n    };\r\n}\r\n/**\r\n * Normalize the optional `props` in a record to always be an object similar to\r\n * components. Also accept a boolean for components.\r\n * @param record\r\n */\r\nfunction normalizeRecordProps(record) {\r\n    const propsObject = {};\r\n    // props does not exist on redirect records but we can set false directly\r\n    const props = record.props || false;\r\n    if ('component' in record) {\r\n        propsObject.default = props;\r\n    }\r\n    else {\r\n        // NOTE: we could also allow a function to be applied to every component.\r\n        // Would need user feedback for use cases\r\n        for (let name in record.components)\r\n            propsObject[name] = typeof props === 'boolean' ? props : props[name];\r\n    }\r\n    return propsObject;\r\n}\r\n/**\r\n * Checks if a record or any of its parent is an alias\r\n * @param record\r\n */\r\nfunction isAliasRecord(record) {\r\n    while (record) {\r\n        if (record.record.aliasOf)\r\n            return true;\r\n        record = record.parent;\r\n    }\r\n    return false;\r\n}\r\n/**\r\n * Merge meta fields of an array of records\r\n *\r\n * @param matched - array of matched records\r\n */\r\nfunction mergeMetaFields(matched) {\r\n    return matched.reduce((meta, record) => assign(meta, record.meta), {});\r\n}\r\nfunction mergeOptions(defaults, partialOptions) {\r\n    let options = {};\r\n    for (let key in defaults) {\r\n        options[key] =\r\n            key in partialOptions ? partialOptions[key] : defaults[key];\r\n    }\r\n    return options;\r\n}\r\nfunction isSameParam(a, b) {\r\n    return (a.name === b.name &&\r\n        a.optional === b.optional &&\r\n        a.repeatable === b.repeatable);\r\n}\r\n/**\r\n * Check if a path and its alias have the same required params\r\n *\r\n * @param a - original record\r\n * @param b - alias record\r\n */\r\nfunction checkSameParams(a, b) {\r\n    for (let key of a.keys) {\r\n        if (!key.optional && !b.keys.find(isSameParam.bind(null, key)))\r\n            return warn(`Alias \"${b.record.path}\" and the original record: \"${a.record.path}\" should have the exact same param named \"${key.name}\"`);\r\n    }\r\n    for (let key of b.keys) {\r\n        if (!key.optional && !a.keys.find(isSameParam.bind(null, key)))\r\n            return warn(`Alias \"${b.record.path}\" and the original record: \"${a.record.path}\" should have the exact same param named \"${key.name}\"`);\r\n    }\r\n}\r\nfunction checkMissingParamsInAbsolutePath(record, parent) {\r\n    for (let key of parent.keys) {\r\n        if (!record.keys.find(isSameParam.bind(null, key)))\r\n            return warn(`Absolute path \"${record.record.path}\" should have the exact same param named \"${key.name}\" as its parent \"${parent.record.path}\".`);\r\n    }\r\n}\n\n/**\r\n * Encoding Rules ␣ = Space Path: ␣ \" < > # ? { } Query: ␣ \" < > # & = Hash: ␣ \"\r\n * < > `\r\n *\r\n * On top of that, the RFC3986 (https://tools.ietf.org/html/rfc3986#section-2.2)\r\n * defines some extra characters to be encoded. Most browsers do not encode them\r\n * in encodeURI https://github.com/whatwg/url/issues/369, so it may be safer to\r\n * also encode `!'()*`. Leaving unencoded only ASCII alphanumeric(`a-zA-Z0-9`)\r\n * plus `-._~`. This extra safety should be applied to query by patching the\r\n * string returned by encodeURIComponent encodeURI also encodes `[\\]^`. `\\`\r\n * should be encoded to avoid ambiguity. Browsers (IE, FF, C) transform a `\\`\r\n * into a `/` if directly typed in. The _backtick_ (`````) should also be\r\n * encoded everywhere because some browsers like FF encode it when directly\r\n * written while others don't. Safari and IE don't encode ``\"<>{}``` in hash.\r\n */\r\n// const EXTRA_RESERVED_RE = /[!'()*]/g\r\n// const encodeReservedReplacer = (c: string) => '%' + c.charCodeAt(0).toString(16)\r\nconst HASH_RE = /#/g; // %23\r\nconst AMPERSAND_RE = /&/g; // %26\r\nconst SLASH_RE = /\\//g; // %2F\r\nconst EQUAL_RE = /=/g; // %3D\r\nconst IM_RE = /\\?/g; // %3F\r\nconst PLUS_RE = /\\+/g; // %2B\r\n/**\r\n * NOTE: It's not clear to me if we should encode the + symbol in queries, it\r\n * seems to be less flexible than not doing so and I can't find out the legacy\r\n * systems requiring this for regular requests like text/html. In the standard,\r\n * the encoding of the plus character is only mentioned for\r\n * application/x-www-form-urlencoded\r\n * (https://url.spec.whatwg.org/#urlencoded-parsing) and most browsers seems lo\r\n * leave the plus character as is in queries. To be more flexible, we allow the\r\n * plus character on the query but it can also be manually encoded by the user.\r\n *\r\n * Resources:\r\n * - https://url.spec.whatwg.org/#urlencoded-parsing\r\n * - https://stackoverflow.com/questions/1634271/url-encoding-the-space-character-or-20\r\n */\r\nconst ENC_BRACKET_OPEN_RE = /%5B/g; // [\r\nconst ENC_BRACKET_CLOSE_RE = /%5D/g; // ]\r\nconst ENC_CARET_RE = /%5E/g; // ^\r\nconst ENC_BACKTICK_RE = /%60/g; // `\r\nconst ENC_CURLY_OPEN_RE = /%7B/g; // {\r\nconst ENC_PIPE_RE = /%7C/g; // |\r\nconst ENC_CURLY_CLOSE_RE = /%7D/g; // }\r\nconst ENC_SPACE_RE = /%20/g; // }\r\n/**\r\n * Encode characters that need to be encoded on the path, search and hash\r\n * sections of the URL.\r\n *\r\n * @internal\r\n * @param text - string to encode\r\n * @returns encoded string\r\n */\r\nfunction commonEncode(text) {\r\n    return encodeURI('' + text)\r\n        .replace(ENC_PIPE_RE, '|')\r\n        .replace(ENC_BRACKET_OPEN_RE, '[')\r\n        .replace(ENC_BRACKET_CLOSE_RE, ']');\r\n}\r\n/**\r\n * Encode characters that need to be encoded on the hash section of the URL.\r\n *\r\n * @param text - string to encode\r\n * @returns encoded string\r\n */\r\nfunction encodeHash(text) {\r\n    return commonEncode(text)\r\n        .replace(ENC_CURLY_OPEN_RE, '{')\r\n        .replace(ENC_CURLY_CLOSE_RE, '}')\r\n        .replace(ENC_CARET_RE, '^');\r\n}\r\n/**\r\n * Encode characters that need to be encoded query values on the query\r\n * section of the URL.\r\n *\r\n * @param text - string to encode\r\n * @returns encoded string\r\n */\r\nfunction encodeQueryValue(text) {\r\n    return (commonEncode(text)\r\n        // Encode the space as +, encode the + to differentiate it from the space\r\n        .replace(PLUS_RE, '%2B')\r\n        .replace(ENC_SPACE_RE, '+')\r\n        .replace(HASH_RE, '%23')\r\n        .replace(AMPERSAND_RE, '%26')\r\n        .replace(ENC_BACKTICK_RE, '`')\r\n        .replace(ENC_CURLY_OPEN_RE, '{')\r\n        .replace(ENC_CURLY_CLOSE_RE, '}')\r\n        .replace(ENC_CARET_RE, '^'));\r\n}\r\n/**\r\n * Like `encodeQueryValue` but also encodes the `=` character.\r\n *\r\n * @param text - string to encode\r\n */\r\nfunction encodeQueryKey(text) {\r\n    return encodeQueryValue(text).replace(EQUAL_RE, '%3D');\r\n}\r\n/**\r\n * Encode characters that need to be encoded on the path section of the URL.\r\n *\r\n * @param text - string to encode\r\n * @returns encoded string\r\n */\r\nfunction encodePath(text) {\r\n    return commonEncode(text).replace(HASH_RE, '%23').replace(IM_RE, '%3F');\r\n}\r\n/**\r\n * Encode characters that need to be encoded on the path section of the URL as a\r\n * param. This function encodes everything {@link encodePath} does plus the\r\n * slash (`/`) character.\r\n *\r\n * @param text - string to encode\r\n * @returns encoded string\r\n */\r\nfunction encodeParam(text) {\r\n    return encodePath(text).replace(SLASH_RE, '%2F');\r\n}\r\n/**\r\n * Decode text using `decodeURIComponent`. Returns the original text if it\r\n * fails.\r\n *\r\n * @param text - string to decode\r\n * @returns decoded string\r\n */\r\nfunction decode(text) {\r\n    try {\r\n        return decodeURIComponent('' + text);\r\n    }\r\n    catch (err) {\r\n        warn(`Error decoding \"${text}\". Using original value`);\r\n    }\r\n    return '' + text;\r\n}\n\n/**\r\n * Transforms a queryString into a {@link LocationQuery} object. Accept both, a\r\n * version with the leading `?` and without Should work as URLSearchParams\r\n\n * @internal\r\n *\r\n * @param search - search string to parse\r\n * @returns a query object\r\n */\r\nfunction parseQuery(search) {\r\n    const query = {};\r\n    // avoid creating an object with an empty key and empty value\r\n    // because of split('&')\r\n    if (search === '' || search === '?')\r\n        return query;\r\n    const hasLeadingIM = search[0] === '?';\r\n    const searchParams = (hasLeadingIM ? search.slice(1) : search).split('&');\r\n    for (let i = 0; i < searchParams.length; ++i) {\r\n        // pre decode the + into space\r\n        const searchParam = searchParams[i].replace(PLUS_RE, ' ');\r\n        // allow the = character\r\n        let eqPos = searchParam.indexOf('=');\r\n        let key = decode(eqPos < 0 ? searchParam : searchParam.slice(0, eqPos));\r\n        // this ignores ?__proto__&toString\r\n        if (Object.prototype.hasOwnProperty(key)) {\r\n            continue;\r\n        }\r\n        let value = eqPos < 0 ? null : decode(searchParam.slice(eqPos + 1));\r\n        if (key in query) {\r\n            // an extra variable for ts types\r\n            let currentValue = query[key];\r\n            if (!Array.isArray(currentValue)) {\r\n                currentValue = query[key] = [currentValue];\r\n            }\r\n            currentValue.push(value);\r\n        }\r\n        else {\r\n            query[key] = value;\r\n        }\r\n    }\r\n    return query;\r\n}\r\n/**\r\n * Stringifies a {@link LocationQueryRaw} object. Like `URLSearchParams`, it\r\n * doesn't prepend a `?`\r\n *\r\n * @internal\r\n *\r\n * @param query - query object to stringify\r\n * @returns string version of the query without the leading `?`\r\n */\r\nfunction stringifyQuery(query) {\r\n    let search = '';\r\n    for (let key in query) {\r\n        const value = query[key];\r\n        key = encodeQueryKey(key);\r\n        if (value == null) {\r\n            // only null adds the value\r\n            if (value !== undefined) {\r\n                search += (search.length ? '&' : '') + key;\r\n            }\r\n            continue;\r\n        }\r\n        // keep null values\r\n        let values = Array.isArray(value)\r\n            ? value.map(v => v && encodeQueryValue(v))\r\n            : [value && encodeQueryValue(value)];\r\n        values.forEach(value => {\r\n            // skip undefined values in arrays as if they were not present\r\n            // smaller code than using filter\r\n            if (value !== undefined) {\r\n                // only append & with non-empty search\r\n                search += (search.length ? '&' : '') + key;\r\n                if (value != null)\r\n                    search += '=' + value;\r\n            }\r\n        });\r\n    }\r\n    return search;\r\n}\r\n/**\r\n * Transforms a {@link LocationQueryRaw} into a {@link LocationQuery} by casting\r\n * numbers into strings, removing keys with an undefined value and replacing\r\n * undefined with null in arrays\r\n *\r\n * @param query - query object to normalize\r\n * @returns a normalized query object\r\n */\r\nfunction normalizeQuery(query) {\r\n    const normalizedQuery = {};\r\n    for (let key in query) {\r\n        let value = query[key];\r\n        if (value !== undefined) {\r\n            normalizedQuery[key] = Array.isArray(value)\r\n                ? value.map(v => (v == null ? null : '' + v))\r\n                : value == null\r\n                    ? value\r\n                    : '' + value;\r\n        }\r\n    }\r\n    return normalizedQuery;\r\n}\n\n/**\r\n * Create a list of callbacks that can be reset. Used to create before and after navigation guards list\r\n */\r\nfunction useCallbacks() {\r\n    let handlers = [];\r\n    function add(handler) {\r\n        handlers.push(handler);\r\n        return () => {\r\n            const i = handlers.indexOf(handler);\r\n            if (i > -1)\r\n                handlers.splice(i, 1);\r\n        };\r\n    }\r\n    function reset() {\r\n        handlers = [];\r\n    }\r\n    return {\r\n        add,\r\n        list: () => handlers,\r\n        reset,\r\n    };\r\n}\n\nfunction registerGuard(record, name, guard) {\r\n    const removeFromList = () => {\r\n        record[name].delete(guard);\r\n    };\r\n    vue.onUnmounted(removeFromList);\r\n    vue.onDeactivated(removeFromList);\r\n    vue.onActivated(() => {\r\n        record[name].add(guard);\r\n    });\r\n    record[name].add(guard);\r\n}\r\n/**\r\n * Add a navigation guard that triggers whenever the component for the current\r\n * location is about to be left. Similar to {@link beforeRouteLeave} but can be\r\n * used in any component. The guard is removed when the component is unmounted.\r\n *\r\n * @param leaveGuard - {@link NavigationGuard}\r\n */\r\nfunction onBeforeRouteLeave(leaveGuard) {\r\n    if (!vue.getCurrentInstance()) {\r\n        warn('getCurrentInstance() returned null. onBeforeRouteLeave() must be called at the top of a setup function');\r\n        return;\r\n    }\r\n    const activeRecord = vue.inject(matchedRouteKey, {}).value;\r\n    if (!activeRecord) {\r\n        warn('No active route record was found. Are you missing a <router-view> component?');\r\n        return;\r\n    }\r\n    registerGuard(activeRecord, 'leaveGuards', leaveGuard);\r\n}\r\n/**\r\n * Add a navigation guard that triggers whenever the current location is about\r\n * to be updated. Similar to {@link beforeRouteUpdate} but can be used in any\r\n * component. The guard is removed when the component is unmounted.\r\n *\r\n * @param updateGuard - {@link NavigationGuard}\r\n */\r\nfunction onBeforeRouteUpdate(updateGuard) {\r\n    if (!vue.getCurrentInstance()) {\r\n        warn('getCurrentInstance() returned null. onBeforeRouteUpdate() must be called at the top of a setup function');\r\n        return;\r\n    }\r\n    const activeRecord = vue.inject(matchedRouteKey, {}).value;\r\n    if (!activeRecord) {\r\n        warn('No active route record was found. Are you missing a <router-view> component?');\r\n        return;\r\n    }\r\n    registerGuard(activeRecord, 'updateGuards', updateGuard);\r\n}\r\nfunction guardToPromiseFn(guard, to, from, record, name) {\r\n    // keep a reference to the enterCallbackArray to prevent pushing callbacks if a new navigation took place\r\n    const enterCallbackArray = record &&\r\n        // name is defined if record is because of the function overload\r\n        (record.enterCallbacks[name] = record.enterCallbacks[name] || []);\r\n    return () => new Promise((resolve, reject) => {\r\n        const next = (valid) => {\r\n            if (valid === false)\r\n                reject(createRouterError(4 /* NAVIGATION_ABORTED */, {\r\n                    from,\r\n                    to,\r\n                }));\r\n            else if (valid instanceof Error) {\r\n                reject(valid);\r\n            }\r\n            else if (isRouteLocation(valid)) {\r\n                reject(createRouterError(2 /* NAVIGATION_GUARD_REDIRECT */, {\r\n                    from: to,\r\n                    to: valid,\r\n                }));\r\n            }\r\n            else {\r\n                if (enterCallbackArray &&\r\n                    // since enterCallbackArray is truthy, both record and name also are\r\n                    record.enterCallbacks[name] === enterCallbackArray &&\r\n                    typeof valid === 'function')\r\n                    enterCallbackArray.push(valid);\r\n                resolve();\r\n            }\r\n        };\r\n        // wrapping with Promise.resolve allows it to work with both async and sync guards\r\n        const guardReturn = guard.call(record && record.instances[name], to, from, canOnlyBeCalledOnce(next, to, from) );\r\n        let guardCall = Promise.resolve(guardReturn);\r\n        if (guard.length < 3)\r\n            guardCall = guardCall.then(next);\r\n        if (guard.length > 2) {\r\n            const message = `The \"next\" callback was never called inside of ${guard.name ? '\"' + guard.name + '\"' : ''}:\\n${guard.toString()}\\n. If you are returning a value instead of calling \"next\", make sure to remove the \"next\" parameter from your function.`;\r\n            if (typeof guardReturn === 'object' && 'then' in guardReturn) {\r\n                guardCall = guardCall.then(resolvedValue => {\r\n                    // @ts-ignore: _called is added at canOnlyBeCalledOnce\r\n                    if (!next._called) {\r\n                        warn(message);\r\n                        return Promise.reject(new Error('Invalid navigation guard'));\r\n                    }\r\n                    return resolvedValue;\r\n                });\r\n                // TODO: test me!\r\n            }\r\n            else if (guardReturn !== undefined) {\r\n                // @ts-ignore: _called is added at canOnlyBeCalledOnce\r\n                if (!next._called) {\r\n                    warn(message);\r\n                    reject(new Error('Invalid navigation guard'));\r\n                    return;\r\n                }\r\n            }\r\n        }\r\n        guardCall.catch(err => reject(err));\r\n    });\r\n}\r\nfunction canOnlyBeCalledOnce(next, to, from) {\r\n    let called = 0;\r\n    return function () {\r\n        if (called++ === 1)\r\n            warn(`The \"next\" callback was called more than once in one navigation guard when going from \"${from.fullPath}\" to \"${to.fullPath}\". It should be called exactly one time in each navigation guard. This will fail in production.`);\r\n        // @ts-ignore: we put it in the original one because it's easier to check\r\n        next._called = true;\r\n        if (called === 1)\r\n            next.apply(null, arguments);\r\n    };\r\n}\r\nfunction extractComponentsGuards(matched, guardType, to, from) {\r\n    const guards = [];\r\n    for (const record of matched) {\r\n        for (const name in record.components) {\r\n            let rawComponent = record.components[name];\r\n            {\r\n                if (!rawComponent ||\r\n                    (typeof rawComponent !== 'object' &&\r\n                        typeof rawComponent !== 'function')) {\r\n                    warn(`Component \"${name}\" in record with path \"${record.path}\" is not` +\r\n                        ` a valid component. Received \"${String(rawComponent)}\".`);\r\n                    // throw to ensure we stop here but warn to ensure the message isn't\r\n                    // missed by the user\r\n                    throw new Error('Invalid route component');\r\n                }\r\n                else if ('then' in rawComponent) {\r\n                    // warn if user wrote import('/component.vue') instead of () =>\r\n                    // import('./component.vue')\r\n                    warn(`Component \"${name}\" in record with path \"${record.path}\" is a ` +\r\n                        `Promise instead of a function that returns a Promise. Did you ` +\r\n                        `write \"import('./MyPage.vue')\" instead of ` +\r\n                        `\"() => import('./MyPage.vue')\" ? This will break in ` +\r\n                        `production if not fixed.`);\r\n                    let promise = rawComponent;\r\n                    rawComponent = () => promise;\r\n                }\r\n                else if (rawComponent.__asyncLoader &&\r\n                    // warn only once per component\r\n                    !rawComponent.__warnedDefineAsync) {\r\n                    rawComponent.__warnedDefineAsync = true;\r\n                    warn(`Component \"${name}\" in record with path \"${record.path}\" is defined ` +\r\n                        `using \"defineAsyncComponent()\". ` +\r\n                        `Write \"() => import('./MyPage.vue')\" instead of ` +\r\n                        `\"defineAsyncComponent(() => import('./MyPage.vue'))\".`);\r\n                }\r\n            }\r\n            // skip update and leave guards if the route component is not mounted\r\n            if (guardType !== 'beforeRouteEnter' && !record.instances[name])\r\n                continue;\r\n            if (isRouteComponent(rawComponent)) {\r\n                // __vccOpts is added by vue-class-component and contain the regular options\r\n                let options = rawComponent.__vccOpts || rawComponent;\r\n                const guard = options[guardType];\r\n                guard && guards.push(guardToPromiseFn(guard, to, from, record, name));\r\n            }\r\n            else {\r\n                // start requesting the chunk already\r\n                let componentPromise = rawComponent();\r\n                if (!('catch' in componentPromise)) {\r\n                    warn(`Component \"${name}\" in record with path \"${record.path}\" is a function that does not return a Promise. If you were passing a functional component, make sure to add a \"displayName\" to the component. This will break in production if not fixed.`);\r\n                    componentPromise = Promise.resolve(componentPromise);\r\n                }\r\n                else {\r\n                    // display the error if any\r\n                    componentPromise = componentPromise.catch(console.error);\r\n                }\r\n                guards.push(() => componentPromise.then(resolved => {\r\n                    if (!resolved)\r\n                        return Promise.reject(new Error(`Couldn't resolve component \"${name}\" at \"${record.path}\"`));\r\n                    const resolvedComponent = isESModule(resolved)\r\n                        ? resolved.default\r\n                        : resolved;\r\n                    // replace the function with the resolved component\r\n                    record.components[name] = resolvedComponent;\r\n                    // __vccOpts is added by vue-class-component and contain the regular options\r\n                    let options = resolvedComponent.__vccOpts || resolvedComponent;\r\n                    const guard = options[guardType];\r\n                    return guard && guardToPromiseFn(guard, to, from, record, name)();\r\n                }));\r\n            }\r\n        }\r\n    }\r\n    return guards;\r\n}\r\n/**\r\n * Allows differentiating lazy components from functional components and vue-class-component\r\n * @param component\r\n */\r\nfunction isRouteComponent(component) {\r\n    return (typeof component === 'object' ||\r\n        'displayName' in component ||\r\n        'props' in component ||\r\n        '__vccOpts' in component);\r\n}\n\n// TODO: we could allow currentRoute as a prop to expose `isActive` and\r\n// `isExactActive` behavior should go through an RFC\r\nfunction useLink(props) {\r\n    const router = vue.inject(routerKey);\r\n    const currentRoute = vue.inject(routeLocationKey);\r\n    const route = vue.computed(() => router.resolve(vue.unref(props.to)));\r\n    const activeRecordIndex = vue.computed(() => {\r\n        let { matched } = route.value;\r\n        let { length } = matched;\r\n        const routeMatched = matched[length - 1];\r\n        let currentMatched = currentRoute.matched;\r\n        if (!routeMatched || !currentMatched.length)\r\n            return -1;\r\n        let index = currentMatched.findIndex(isSameRouteRecord.bind(null, routeMatched));\r\n        if (index > -1)\r\n            return index;\r\n        // possible parent record\r\n        let parentRecordPath = getOriginalPath(matched[length - 2]);\r\n        return (\r\n        // we are dealing with nested routes\r\n        length > 1 &&\r\n            // if the parent and matched route have the same path, this link is\r\n            // referring to the empty child. Or we currently are on a different\r\n            // child of the same parent\r\n            getOriginalPath(routeMatched) === parentRecordPath &&\r\n            // avoid comparing the child with its parent\r\n            currentMatched[currentMatched.length - 1].path !== parentRecordPath\r\n            ? currentMatched.findIndex(isSameRouteRecord.bind(null, matched[length - 2]))\r\n            : index);\r\n    });\r\n    const isActive = vue.computed(() => activeRecordIndex.value > -1 &&\r\n        includesParams(currentRoute.params, route.value.params));\r\n    const isExactActive = vue.computed(() => activeRecordIndex.value > -1 &&\r\n        activeRecordIndex.value === currentRoute.matched.length - 1 &&\r\n        isSameRouteLocationParams(currentRoute.params, route.value.params));\r\n    function navigate(e = {}) {\r\n        if (guardEvent(e))\r\n            return router[vue.unref(props.replace) ? 'replace' : 'push'](vue.unref(props.to));\r\n        return Promise.resolve();\r\n    }\r\n    return {\r\n        route,\r\n        href: vue.computed(() => route.value.href),\r\n        isActive,\r\n        isExactActive,\r\n        navigate,\r\n    };\r\n}\r\nconst RouterLinkImpl = /*#__PURE__*/ vue.defineComponent({\r\n    name: 'RouterLink',\r\n    props: {\r\n        to: {\r\n            type: [String, Object],\r\n            required: true,\r\n        },\r\n        replace: Boolean,\r\n        activeClass: String,\r\n        // inactiveClass: String,\r\n        exactActiveClass: String,\r\n        custom: Boolean,\r\n        ariaCurrentValue: {\r\n            type: String,\r\n            default: 'page',\r\n        },\r\n    },\r\n    setup(props, { slots }) {\r\n        const link = vue.reactive(useLink(props));\r\n        const { options } = vue.inject(routerKey);\r\n        const elClass = vue.computed(() => ({\r\n            [getLinkClass(props.activeClass, options.linkActiveClass, 'router-link-active')]: link.isActive,\r\n            // [getLinkClass(\r\n            //   props.inactiveClass,\r\n            //   options.linkInactiveClass,\r\n            //   'router-link-inactive'\r\n            // )]: !link.isExactActive,\r\n            [getLinkClass(props.exactActiveClass, options.linkExactActiveClass, 'router-link-exact-active')]: link.isExactActive,\r\n        }));\r\n        // devtools only\r\n        if (isBrowser) {\r\n            const instance = vue.getCurrentInstance();\r\n            vue.watchEffect(() => {\r\n                if (!instance)\r\n                    return;\r\n                instance.__vrl_route = link.route;\r\n            }, { flush: 'post' });\r\n            vue.watchEffect(() => {\r\n                if (!instance)\r\n                    return;\r\n                instance.__vrl_active = link.isActive;\r\n                instance.__vrl_exactActive = link.isExactActive;\r\n            }, { flush: 'post' });\r\n        }\r\n        return () => {\r\n            const children = slots.default && slots.default(link);\r\n            return props.custom\r\n                ? children\r\n                : vue.h('a', {\r\n                    'aria-current': link.isExactActive\r\n                        ? props.ariaCurrentValue\r\n                        : null,\r\n                    href: link.href,\r\n                    // this would override user added attrs but Vue will still add\r\n                    // the listener so we end up triggering both\r\n                    onClick: link.navigate,\r\n                    class: elClass.value,\r\n                }, children);\r\n        };\r\n    },\r\n});\r\n// export the public type for h/tsx inference\r\n// also to avoid inline import() in generated d.ts files\r\n/**\r\n * Component to render a link that triggers a navigation on click.\r\n */\r\nconst RouterLink = RouterLinkImpl;\r\nfunction guardEvent(e) {\r\n    // don't redirect with control keys\r\n    if (e.metaKey || e.altKey || e.ctrlKey || e.shiftKey)\r\n        return;\r\n    // don't redirect when preventDefault called\r\n    if (e.defaultPrevented)\r\n        return;\r\n    // don't redirect on right click\r\n    if (e.button !== undefined && e.button !== 0)\r\n        return;\r\n    // don't redirect if `target=\"_blank\"`\r\n    // @ts-ignore getAttribute does exist\r\n    if (e.currentTarget && e.currentTarget.getAttribute) {\r\n        // @ts-ignore getAttribute exists\r\n        const target = e.currentTarget.getAttribute('target');\r\n        if (/\\b_blank\\b/i.test(target))\r\n            return;\r\n    }\r\n    // this may be a Weex event which doesn't have this method\r\n    if (e.preventDefault)\r\n        e.preventDefault();\r\n    return true;\r\n}\r\nfunction includesParams(outer, inner) {\r\n    for (let key in inner) {\r\n        let innerValue = inner[key];\r\n        let outerValue = outer[key];\r\n        if (typeof innerValue === 'string') {\r\n            if (innerValue !== outerValue)\r\n                return false;\r\n        }\r\n        else {\r\n            if (!Array.isArray(outerValue) ||\r\n                outerValue.length !== innerValue.length ||\r\n                innerValue.some((value, i) => value !== outerValue[i]))\r\n                return false;\r\n        }\r\n    }\r\n    return true;\r\n}\r\n/**\r\n * Get the original path value of a record by following its aliasOf\r\n * @param record\r\n */\r\nfunction getOriginalPath(record) {\r\n    return record ? (record.aliasOf ? record.aliasOf.path : record.path) : '';\r\n}\r\n/**\r\n * Utility class to get the active class based on defaults.\r\n * @param propClass\r\n * @param globalClass\r\n * @param defaultClass\r\n */\r\nconst getLinkClass = (propClass, globalClass, defaultClass) => propClass != null\r\n    ? propClass\r\n    : globalClass != null\r\n        ? globalClass\r\n        : defaultClass;\n\nconst RouterViewImpl = /*#__PURE__*/ vue.defineComponent({\r\n    name: 'RouterView',\r\n    // #674 we manually inherit them\r\n    inheritAttrs: false,\r\n    props: {\r\n        name: {\r\n            type: String,\r\n            default: 'default',\r\n        },\r\n        route: Object,\r\n    },\r\n    setup(props, { attrs, slots }) {\r\n        warnDeprecatedUsage();\r\n        const injectedRoute = vue.inject(routerViewLocationKey);\r\n        const routeToDisplay = vue.computed(() => props.route || injectedRoute.value);\r\n        const depth = vue.inject(viewDepthKey, 0);\r\n        const matchedRouteRef = vue.computed(() => routeToDisplay.value.matched[depth]);\r\n        vue.provide(viewDepthKey, depth + 1);\r\n        vue.provide(matchedRouteKey, matchedRouteRef);\r\n        vue.provide(routerViewLocationKey, routeToDisplay);\r\n        const viewRef = vue.ref();\r\n        // watch at the same time the component instance, the route record we are\r\n        // rendering, and the name\r\n        vue.watch(() => [viewRef.value, matchedRouteRef.value, props.name], ([instance, to, name], [oldInstance, from, oldName]) => {\r\n            // copy reused instances\r\n            if (to) {\r\n                // this will update the instance for new instances as well as reused\r\n                // instances when navigating to a new route\r\n                to.instances[name] = instance;\r\n                // the component instance is reused for a different route or name so\r\n                // we copy any saved update or leave guards. With async setup, the\r\n                // mounting component will mount before the matchedRoute changes,\r\n                // making instance === oldInstance, so we check if guards have been\r\n                // added before. This works because we remove guards when\r\n                // unmounting/deactivating components\r\n                if (from && from !== to && instance && instance === oldInstance) {\r\n                    if (!to.leaveGuards.size) {\r\n                        to.leaveGuards = from.leaveGuards;\r\n                    }\r\n                    if (!to.updateGuards.size) {\r\n                        to.updateGuards = from.updateGuards;\r\n                    }\r\n                }\r\n            }\r\n            // trigger beforeRouteEnter next callbacks\r\n            if (instance &&\r\n                to &&\r\n                // if there is no instance but to and from are the same this might be\r\n                // the first visit\r\n                (!from || !isSameRouteRecord(to, from) || !oldInstance)) {\r\n                (to.enterCallbacks[name] || []).forEach(callback => callback(instance));\r\n            }\r\n        }, { flush: 'post' });\r\n        return () => {\r\n            const route = routeToDisplay.value;\r\n            const matchedRoute = matchedRouteRef.value;\r\n            const ViewComponent = matchedRoute && matchedRoute.components[props.name];\r\n            // we need the value at the time we render because when we unmount, we\r\n            // navigated to a different location so the value is different\r\n            const currentName = props.name;\r\n            if (!ViewComponent) {\r\n                return normalizeSlot(slots.default, { Component: ViewComponent, route });\r\n            }\r\n            // props from route configuration\r\n            const routePropsOption = matchedRoute.props[props.name];\r\n            const routeProps = routePropsOption\r\n                ? routePropsOption === true\r\n                    ? route.params\r\n                    : typeof routePropsOption === 'function'\r\n                        ? routePropsOption(route)\r\n                        : routePropsOption\r\n                : null;\r\n            const onVnodeUnmounted = vnode => {\r\n                // remove the instance reference to prevent leak\r\n                if (vnode.component.isUnmounted) {\r\n                    matchedRoute.instances[currentName] = null;\r\n                }\r\n            };\r\n            const component = vue.h(ViewComponent, assign({}, routeProps, attrs, {\r\n                onVnodeUnmounted,\r\n                ref: viewRef,\r\n            }));\r\n            return (\r\n            // pass the vnode to the slot as a prop.\r\n            // h and <component :is=\"...\"> both accept vnodes\r\n            normalizeSlot(slots.default, { Component: component, route }) ||\r\n                component);\r\n        };\r\n    },\r\n});\r\nfunction normalizeSlot(slot, data) {\r\n    if (!slot)\r\n        return null;\r\n    const slotContent = slot(data);\r\n    return slotContent.length === 1 ? slotContent[0] : slotContent;\r\n}\r\n// export the public type for h/tsx inference\r\n// also to avoid inline import() in generated d.ts files\r\n/**\r\n * Component to display the current route the user is at.\r\n */\r\nconst RouterView = RouterViewImpl;\r\n// warn against deprecated usage with <transition> & <keep-alive>\r\n// due to functional component being no longer eager in Vue 3\r\nfunction warnDeprecatedUsage() {\r\n    const instance = vue.getCurrentInstance();\r\n    const parentName = instance.parent && instance.parent.type.name;\r\n    if (parentName &&\r\n        (parentName === 'KeepAlive' || parentName.includes('Transition'))) {\r\n        const comp = parentName === 'KeepAlive' ? 'keep-alive' : 'transition';\r\n        warn(`<router-view> can no longer be used directly inside <transition> or <keep-alive>.\\n` +\r\n            `Use slot props instead:\\n\\n` +\r\n            `<router-view v-slot=\"{ Component }\">\\n` +\r\n            `  <${comp}>\\n` +\r\n            `    <component :is=\"Component\" />\\n` +\r\n            `  </${comp}>\\n` +\r\n            `</router-view>`);\r\n    }\r\n}\n\nfunction formatRouteLocation(routeLocation, tooltip) {\r\n    const copy = assign({}, routeLocation, {\r\n        // remove variables that can contain vue instances\r\n        matched: routeLocation.matched.map(matched => omit(matched, ['instances', 'children', 'aliasOf'])),\r\n    });\r\n    return {\r\n        _custom: {\r\n            type: null,\r\n            readOnly: true,\r\n            display: routeLocation.fullPath,\r\n            tooltip,\r\n            value: copy,\r\n        },\r\n    };\r\n}\r\nfunction formatDisplay(display) {\r\n    return {\r\n        _custom: {\r\n            display,\r\n        },\r\n    };\r\n}\r\n// to support multiple router instances\r\nlet routerId = 0;\r\nfunction addDevtools(app, router, matcher) {\r\n    // Take over router.beforeEach and afterEach\r\n    // make sure we are not registering the devtool twice\r\n    if (router.__hasDevtools)\r\n        return;\r\n    router.__hasDevtools = true;\r\n    // increment to support multiple router instances\r\n    const id = routerId++;\r\n    devtoolsApi.setupDevtoolsPlugin({\r\n        id: 'org.vuejs.router' + (id ? '.' + id : ''),\r\n        label: 'Vue Router',\r\n        packageName: 'vue-router',\r\n        homepage: 'https://next.router.vuejs.org/',\r\n        logo: 'https://vuejs.org/images/icons/favicon-96x96.png',\r\n        componentStateTypes: ['Routing'],\r\n        app,\r\n    }, api => {\r\n        // display state added by the router\r\n        api.on.inspectComponent((payload, ctx) => {\r\n            if (payload.instanceData) {\r\n                payload.instanceData.state.push({\r\n                    type: 'Routing',\r\n                    key: '$route',\r\n                    editable: false,\r\n                    value: formatRouteLocation(router.currentRoute.value, 'Current Route'),\r\n                });\r\n            }\r\n        });\r\n        // mark router-link as active\r\n        api.on.visitComponentTree(({ treeNode: node, componentInstance }) => {\r\n            if (node.name === 'RouterLink') {\r\n                if (componentInstance.__vrl_route) {\r\n                    node.tags.push({\r\n                        label: componentInstance.__vrl_route.path,\r\n                        textColor: 0,\r\n                        backgroundColor: ORANGE_400,\r\n                    });\r\n                }\r\n                if (componentInstance.__vrl_exactActive) {\r\n                    node.tags.push({\r\n                        label: 'exact',\r\n                        textColor: 0,\r\n                        backgroundColor: LIME_500,\r\n                    });\r\n                }\r\n                if (componentInstance.__vrl_active) {\r\n                    node.tags.push({\r\n                        label: 'active',\r\n                        textColor: 0,\r\n                        backgroundColor: BLUE_600,\r\n                    });\r\n                }\r\n            }\r\n        });\r\n        vue.watch(router.currentRoute, () => {\r\n            // refresh active state\r\n            refreshRoutesView();\r\n            api.notifyComponentUpdate();\r\n            api.sendInspectorTree(routerInspectorId);\r\n        });\r\n        const navigationsLayerId = 'router:navigations:' + id;\r\n        api.addTimelineLayer({\r\n            id: navigationsLayerId,\r\n            label: `Router${id ? ' ' + id : ''} Navigations`,\r\n            color: 0x40a8c4,\r\n        });\r\n        // const errorsLayerId = 'router:errors'\r\n        // api.addTimelineLayer({\r\n        //   id: errorsLayerId,\r\n        //   label: 'Router Errors',\r\n        //   color: 0xea5455,\r\n        // })\r\n        router.onError(error => {\r\n            api.addTimelineEvent({\r\n                layerId: navigationsLayerId,\r\n                event: {\r\n                    title: 'Error',\r\n                    subtitle: 'An uncaught error happened during navigation',\r\n                    logType: 'error',\r\n                    time: Date.now(),\r\n                    data: { error },\r\n                },\r\n            });\r\n        });\r\n        // attached to `meta` and used to group events\r\n        let navigationId = 0;\r\n        router.beforeEach((to, from) => {\r\n            const data = {\r\n                guard: formatDisplay('beforeEach'),\r\n                from: formatRouteLocation(from, 'Current Location during this navigation'),\r\n                to: formatRouteLocation(to, 'Target location'),\r\n            };\r\n            // Used to group navigations together, hide from devtools\r\n            Object.defineProperty(to.meta, '__navigationId', {\r\n                value: navigationId++,\r\n            });\r\n            api.addTimelineEvent({\r\n                layerId: navigationsLayerId,\r\n                event: {\r\n                    time: Date.now(),\r\n                    title: 'Start of navigation',\r\n                    data,\r\n                    groupId: to.meta.__navigationId,\r\n                },\r\n            });\r\n        });\r\n        router.afterEach((to, from, failure) => {\r\n            const data = {\r\n                guard: formatDisplay('afterEach'),\r\n            };\r\n            if (failure) {\r\n                data.failure = {\r\n                    _custom: {\r\n                        type: Error,\r\n                        readOnly: true,\r\n                        display: failure ? failure.message : '',\r\n                        tooltip: 'Navigation Failure',\r\n                        value: failure,\r\n                    },\r\n                };\r\n                data.status = formatDisplay('❌');\r\n            }\r\n            else {\r\n                data.status = formatDisplay('✅');\r\n            }\r\n            // we set here to have the right order\r\n            data.from = formatRouteLocation(from, 'Current Location during this navigation');\r\n            data.to = formatRouteLocation(to, 'Target location');\r\n            api.addTimelineEvent({\r\n                layerId: navigationsLayerId,\r\n                event: {\r\n                    title: 'End of navigation',\r\n                    time: Date.now(),\r\n                    data,\r\n                    logType: failure ? 'warning' : 'default',\r\n                    groupId: to.meta.__navigationId,\r\n                },\r\n            });\r\n        });\r\n        /**\r\n         * Inspector of Existing routes\r\n         */\r\n        const routerInspectorId = 'router-inspector:' + id;\r\n        api.addInspector({\r\n            id: routerInspectorId,\r\n            label: 'Routes' + (id ? ' ' + id : ''),\r\n            icon: 'book',\r\n            treeFilterPlaceholder: 'Search routes',\r\n        });\r\n        function refreshRoutesView() {\r\n            // the routes view isn't active\r\n            if (!activeRoutesPayload)\r\n                return;\r\n            const payload = activeRoutesPayload;\r\n            // children routes will appear as nested\r\n            let routes = matcher.getRoutes().filter(route => !route.parent);\r\n            // reset match state to false\r\n            routes.forEach(resetMatchStateOnRouteRecord);\r\n            // apply a match state if there is a payload\r\n            if (payload.filter) {\r\n                routes = routes.filter(route => \r\n                // save matches state based on the payload\r\n                isRouteMatching(route, payload.filter.toLowerCase()));\r\n            }\r\n            // mark active routes\r\n            routes.forEach(route => markRouteRecordActive(route, router.currentRoute.value));\r\n            payload.rootNodes = routes.map(formatRouteRecordForInspector);\r\n        }\r\n        let activeRoutesPayload;\r\n        api.on.getInspectorTree(payload => {\r\n            activeRoutesPayload = payload;\r\n            if (payload.app === app && payload.inspectorId === routerInspectorId) {\r\n                refreshRoutesView();\r\n            }\r\n        });\r\n        /**\r\n         * Display information about the currently selected route record\r\n         */\r\n        api.on.getInspectorState(payload => {\r\n            if (payload.app === app && payload.inspectorId === routerInspectorId) {\r\n                const routes = matcher.getRoutes();\r\n                const route = routes.find(route => route.record.__vd_id === payload.nodeId);\r\n                if (route) {\r\n                    payload.state = {\r\n                        options: formatRouteRecordMatcherForStateInspector(route),\r\n                    };\r\n                }\r\n            }\r\n        });\r\n        api.sendInspectorTree(routerInspectorId);\r\n        api.sendInspectorState(routerInspectorId);\r\n    });\r\n}\r\nfunction modifierForKey(key) {\r\n    if (key.optional) {\r\n        return key.repeatable ? '*' : '?';\r\n    }\r\n    else {\r\n        return key.repeatable ? '+' : '';\r\n    }\r\n}\r\nfunction formatRouteRecordMatcherForStateInspector(route) {\r\n    const { record } = route;\r\n    const fields = [\r\n        { editable: false, key: 'path', value: record.path },\r\n    ];\r\n    if (record.name != null) {\r\n        fields.push({\r\n            editable: false,\r\n            key: 'name',\r\n            value: record.name,\r\n        });\r\n    }\r\n    fields.push({ editable: false, key: 'regexp', value: route.re });\r\n    if (route.keys.length) {\r\n        fields.push({\r\n            editable: false,\r\n            key: 'keys',\r\n            value: {\r\n                _custom: {\r\n                    type: null,\r\n                    readOnly: true,\r\n                    display: route.keys\r\n                        .map(key => `${key.name}${modifierForKey(key)}`)\r\n                        .join(' '),\r\n                    tooltip: 'Param keys',\r\n                    value: route.keys,\r\n                },\r\n            },\r\n        });\r\n    }\r\n    if (record.redirect != null) {\r\n        fields.push({\r\n            editable: false,\r\n            key: 'redirect',\r\n            value: record.redirect,\r\n        });\r\n    }\r\n    if (route.alias.length) {\r\n        fields.push({\r\n            editable: false,\r\n            key: 'aliases',\r\n            value: route.alias.map(alias => alias.record.path),\r\n        });\r\n    }\r\n    fields.push({\r\n        key: 'score',\r\n        editable: false,\r\n        value: {\r\n            _custom: {\r\n                type: null,\r\n                readOnly: true,\r\n                display: route.score.map(score => score.join(', ')).join(' | '),\r\n                tooltip: 'Score used to sort routes',\r\n                value: route.score,\r\n            },\r\n        },\r\n    });\r\n    return fields;\r\n}\r\n/**\r\n * Extracted from tailwind palette\r\n */\r\nconst PINK_500 = 0xec4899;\r\nconst BLUE_600 = 0x2563eb;\r\nconst LIME_500 = 0x84cc16;\r\nconst CYAN_400 = 0x22d3ee;\r\nconst ORANGE_400 = 0xfb923c;\r\n// const GRAY_100 = 0xf4f4f5\r\nconst DARK = 0x666666;\r\nfunction formatRouteRecordForInspector(route) {\r\n    const tags = [];\r\n    const { record } = route;\r\n    if (record.name != null) {\r\n        tags.push({\r\n            label: String(record.name),\r\n            textColor: 0,\r\n            backgroundColor: CYAN_400,\r\n        });\r\n    }\r\n    if (record.aliasOf) {\r\n        tags.push({\r\n            label: 'alias',\r\n            textColor: 0,\r\n            backgroundColor: ORANGE_400,\r\n        });\r\n    }\r\n    if (route.__vd_match) {\r\n        tags.push({\r\n            label: 'matches',\r\n            textColor: 0,\r\n            backgroundColor: PINK_500,\r\n        });\r\n    }\r\n    if (route.__vd_exactActive) {\r\n        tags.push({\r\n            label: 'exact',\r\n            textColor: 0,\r\n            backgroundColor: LIME_500,\r\n        });\r\n    }\r\n    if (route.__vd_active) {\r\n        tags.push({\r\n            label: 'active',\r\n            textColor: 0,\r\n            backgroundColor: BLUE_600,\r\n        });\r\n    }\r\n    if (record.redirect) {\r\n        tags.push({\r\n            label: 'redirect: ' +\r\n                (typeof record.redirect === 'string' ? record.redirect : 'Object'),\r\n            textColor: 0xffffff,\r\n            backgroundColor: DARK,\r\n        });\r\n    }\r\n    // add an id to be able to select it. Using the `path` is not possible because\r\n    // empty path children would collide with their parents\r\n    let id = record.__vd_id;\r\n    if (id == null) {\r\n        id = String(routeRecordId++);\r\n        record.__vd_id = id;\r\n    }\r\n    return {\r\n        id,\r\n        label: record.path,\r\n        tags,\r\n        children: route.children.map(formatRouteRecordForInspector),\r\n    };\r\n}\r\n//  incremental id for route records and inspector state\r\nlet routeRecordId = 0;\r\nconst EXTRACT_REGEXP_RE = /^\\/(.*)\\/([a-z]*)$/;\r\nfunction markRouteRecordActive(route, currentRoute) {\r\n    // no route will be active if matched is empty\r\n    // reset the matching state\r\n    const isExactActive = currentRoute.matched.length &&\r\n        isSameRouteRecord(currentRoute.matched[currentRoute.matched.length - 1], route.record);\r\n    route.__vd_exactActive = route.__vd_active = isExactActive;\r\n    if (!isExactActive) {\r\n        route.__vd_active = currentRoute.matched.some(match => isSameRouteRecord(match, route.record));\r\n    }\r\n    route.children.forEach(childRoute => markRouteRecordActive(childRoute, currentRoute));\r\n}\r\nfunction resetMatchStateOnRouteRecord(route) {\r\n    route.__vd_match = false;\r\n    route.children.forEach(resetMatchStateOnRouteRecord);\r\n}\r\nfunction isRouteMatching(route, filter) {\r\n    const found = String(route.re).match(EXTRACT_REGEXP_RE);\r\n    route.__vd_match = false;\r\n    if (!found || found.length < 3) {\r\n        return false;\r\n    }\r\n    // use a regexp without $ at the end to match nested routes better\r\n    const nonEndingRE = new RegExp(found[1].replace(/\\$$/, ''), found[2]);\r\n    if (nonEndingRE.test(filter)) {\r\n        // mark children as matches\r\n        route.children.forEach(child => isRouteMatching(child, filter));\r\n        // exception case: `/`\r\n        if (route.record.path !== '/' || filter === '/') {\r\n            route.__vd_match = route.re.test(filter);\r\n            return true;\r\n        }\r\n        // hide the / route\r\n        return false;\r\n    }\r\n    const path = route.record.path.toLowerCase();\r\n    const decodedPath = decode(path);\r\n    // also allow partial matching on the path\r\n    if (!filter.startsWith('/') &&\r\n        (decodedPath.includes(filter) || path.includes(filter)))\r\n        return true;\r\n    if (decodedPath.startsWith(filter) || path.startsWith(filter))\r\n        return true;\r\n    if (route.record.name && String(route.record.name).includes(filter))\r\n        return true;\r\n    return route.children.some(child => isRouteMatching(child, filter));\r\n}\r\nfunction omit(obj, keys) {\r\n    const ret = {};\r\n    for (let key in obj) {\r\n        if (!keys.includes(key)) {\r\n            // @ts-ignore\r\n            ret[key] = obj[key];\r\n        }\r\n    }\r\n    return ret;\r\n}\n\n/**\r\n * Creates a Router instance that can be used by a Vue app.\r\n *\r\n * @param options - {@link RouterOptions}\r\n */\r\nfunction createRouter(options) {\r\n    const matcher = createRouterMatcher(options.routes, options);\r\n    let parseQuery$1 = options.parseQuery || parseQuery;\r\n    let stringifyQuery$1 = options.stringifyQuery || stringifyQuery;\r\n    let routerHistory = options.history;\r\n    if (!routerHistory)\r\n        throw new Error('Provide the \"history\" option when calling \"createRouter()\":' +\r\n            ' https://next.router.vuejs.org/api/#history.');\r\n    const beforeGuards = useCallbacks();\r\n    const beforeResolveGuards = useCallbacks();\r\n    const afterGuards = useCallbacks();\r\n    const currentRoute = vue.shallowRef(START_LOCATION_NORMALIZED);\r\n    let pendingLocation = START_LOCATION_NORMALIZED;\r\n    // leave the scrollRestoration if no scrollBehavior is provided\r\n    if (isBrowser && options.scrollBehavior && 'scrollRestoration' in history) {\r\n        history.scrollRestoration = 'manual';\r\n    }\r\n    const normalizeParams = applyToParams.bind(null, paramValue => '' + paramValue);\r\n    const encodeParams = applyToParams.bind(null, encodeParam);\r\n    const decodeParams = applyToParams.bind(null, decode);\r\n    function addRoute(parentOrRoute, route) {\r\n        let parent;\r\n        let record;\r\n        if (isRouteName(parentOrRoute)) {\r\n            parent = matcher.getRecordMatcher(parentOrRoute);\r\n            record = route;\r\n        }\r\n        else {\r\n            record = parentOrRoute;\r\n        }\r\n        return matcher.addRoute(record, parent);\r\n    }\r\n    function removeRoute(name) {\r\n        let recordMatcher = matcher.getRecordMatcher(name);\r\n        if (recordMatcher) {\r\n            matcher.removeRoute(recordMatcher);\r\n        }\r\n        else {\r\n            warn(`Cannot remove non-existent route \"${String(name)}\"`);\r\n        }\r\n    }\r\n    function getRoutes() {\r\n        return matcher.getRoutes().map(routeMatcher => routeMatcher.record);\r\n    }\r\n    function hasRoute(name) {\r\n        return !!matcher.getRecordMatcher(name);\r\n    }\r\n    function resolve(rawLocation, currentLocation) {\r\n        // const objectLocation = routerLocationAsObject(rawLocation)\r\n        // we create a copy to modify it later\r\n        currentLocation = assign({}, currentLocation || currentRoute.value);\r\n        if (typeof rawLocation === 'string') {\r\n            let locationNormalized = parseURL(parseQuery$1, rawLocation, currentLocation.path);\r\n            let matchedRoute = matcher.resolve({ path: locationNormalized.path }, currentLocation);\r\n            let href = routerHistory.createHref(locationNormalized.fullPath);\r\n            {\r\n                if (href.startsWith('//'))\r\n                    warn(`Location \"${rawLocation}\" resolved to \"${href}\". A resolved location cannot start with multiple slashes.`);\r\n                else if (!matchedRoute.matched.length) {\r\n                    warn(`No match found for location with path \"${rawLocation}\"`);\r\n                }\r\n            }\r\n            // locationNormalized is always a new object\r\n            return assign(locationNormalized, matchedRoute, {\r\n                params: decodeParams(matchedRoute.params),\r\n                hash: decode(locationNormalized.hash),\r\n                redirectedFrom: undefined,\r\n                href,\r\n            });\r\n        }\r\n        let matcherLocation;\r\n        // path could be relative in object as well\r\n        if ('path' in rawLocation) {\r\n            if ('params' in rawLocation &&\r\n                !('name' in rawLocation) &&\r\n                Object.keys(rawLocation.params).length) {\r\n                warn(`Path \"${rawLocation.path}\" was passed with params but they will be ignored. Use a named route alongside params instead.`);\r\n            }\r\n            matcherLocation = assign({}, rawLocation, {\r\n                path: parseURL(parseQuery$1, rawLocation.path, currentLocation.path).path,\r\n            });\r\n        }\r\n        else {\r\n            // pass encoded values to the matcher so it can produce encoded path and fullPath\r\n            matcherLocation = assign({}, rawLocation, {\r\n                params: encodeParams(rawLocation.params),\r\n            });\r\n            // current location params are decoded, we need to encode them in case the\r\n            // matcher merges the params\r\n            currentLocation.params = encodeParams(currentLocation.params);\r\n        }\r\n        let matchedRoute = matcher.resolve(matcherLocation, currentLocation);\r\n        const hash = rawLocation.hash || '';\r\n        if (hash && !hash.startsWith('#')) {\r\n            warn(`A \\`hash\\` should always start with the character \"#\". Replace \"${hash}\" with \"#${hash}\".`);\r\n        }\r\n        // decoding them) the matcher might have merged current location params so\r\n        // we need to run the decoding again\r\n        matchedRoute.params = normalizeParams(decodeParams(matchedRoute.params));\r\n        const fullPath = stringifyURL(stringifyQuery$1, assign({}, rawLocation, {\r\n            hash: encodeHash(hash),\r\n            path: matchedRoute.path,\r\n        }));\r\n        let href = routerHistory.createHref(fullPath);\r\n        {\r\n            if (href.startsWith('//')) {\r\n                warn(`Location \"${rawLocation}\" resolved to \"${href}\". A resolved location cannot start with multiple slashes.`);\r\n            }\r\n            else if (!matchedRoute.matched.length) {\r\n                warn(`No match found for location with path \"${'path' in rawLocation ? rawLocation.path : rawLocation}\"`);\r\n            }\r\n        }\r\n        return assign({\r\n            fullPath,\r\n            // keep the hash encoded so fullPath is effectively path + encodedQuery +\r\n            // hash\r\n            hash,\r\n            query: \r\n            // if the user is using a custom query lib like qs, we might have\r\n            // nested objects, so we keep the query as is, meaning it can contain\r\n            // numbers at `$route.query`, but at the point, the user will have to\r\n            // use their own type anyway.\r\n            // https://github.com/vuejs/vue-router-next/issues/328#issuecomment-649481567\r\n            stringifyQuery$1 === stringifyQuery\r\n                ? normalizeQuery(rawLocation.query)\r\n                : rawLocation.query,\r\n        }, matchedRoute, {\r\n            redirectedFrom: undefined,\r\n            href,\r\n        });\r\n    }\r\n    function locationAsObject(to) {\r\n        return typeof to === 'string'\r\n            ? parseURL(parseQuery$1, to, currentRoute.value.path)\r\n            : assign({}, to);\r\n    }\r\n    function checkCanceledNavigation(to, from) {\r\n        if (pendingLocation !== to) {\r\n            return createRouterError(8 /* NAVIGATION_CANCELLED */, {\r\n                from,\r\n                to,\r\n            });\r\n        }\r\n    }\r\n    function push(to) {\r\n        return pushWithRedirect(to);\r\n    }\r\n    function replace(to) {\r\n        return push(assign(locationAsObject(to), { replace: true }));\r\n    }\r\n    function handleRedirectRecord(to) {\r\n        const lastMatched = to.matched[to.matched.length - 1];\r\n        if (lastMatched && lastMatched.redirect) {\r\n            const { redirect } = lastMatched;\r\n            let newTargetLocation = typeof redirect === 'function' ? redirect(to) : redirect;\r\n            if (typeof newTargetLocation === 'string') {\r\n                newTargetLocation =\r\n                    newTargetLocation.indexOf('?') > -1 ||\r\n                        newTargetLocation.indexOf('#') > -1\r\n                        ? (newTargetLocation = locationAsObject(newTargetLocation))\r\n                        : { path: newTargetLocation };\r\n            }\r\n            if (!('path' in newTargetLocation) &&\r\n                !('name' in newTargetLocation)) {\r\n                warn(`Invalid redirect found:\\n${JSON.stringify(newTargetLocation, null, 2)}\\n when navigating to \"${to.fullPath}\". A redirect must contain a name or path. This will break in production.`);\r\n                throw new Error('Invalid redirect');\r\n            }\r\n            return assign({\r\n                query: to.query,\r\n                hash: to.hash,\r\n                params: to.params,\r\n            }, newTargetLocation);\r\n        }\r\n    }\r\n    function pushWithRedirect(to, redirectedFrom) {\r\n        const targetLocation = (pendingLocation = resolve(to));\r\n        const from = currentRoute.value;\r\n        const data = to.state;\r\n        const force = to.force;\r\n        // to could be a string where `replace` is a function\r\n        const replace = to.replace === true;\r\n        const shouldRedirect = handleRedirectRecord(targetLocation);\r\n        if (shouldRedirect)\r\n            return pushWithRedirect(assign(locationAsObject(shouldRedirect), {\r\n                state: data,\r\n                force,\r\n                replace,\r\n            }), \r\n            // keep original redirectedFrom if it exists\r\n            redirectedFrom || targetLocation);\r\n        // if it was a redirect we already called `pushWithRedirect` above\r\n        const toLocation = targetLocation;\r\n        toLocation.redirectedFrom = redirectedFrom;\r\n        let failure;\r\n        if (!force && isSameRouteLocation(stringifyQuery$1, from, targetLocation)) {\r\n            failure = createRouterError(16 /* NAVIGATION_DUPLICATED */, { to: toLocation, from });\r\n            // trigger scroll to allow scrolling to the same anchor\r\n            handleScroll(from, from, \r\n            // this is a push, the only way for it to be triggered from a\r\n            // history.listen is with a redirect, which makes it become a push\r\n            true, \r\n            // This cannot be the first navigation because the initial location\r\n            // cannot be manually navigated to\r\n            false);\r\n        }\r\n        return (failure ? Promise.resolve(failure) : navigate(toLocation, from))\r\n            .catch((error) => isNavigationFailure(error)\r\n            ? error\r\n            : // reject any unknown error\r\n                triggerError(error))\r\n            .then((failure) => {\r\n            if (failure) {\r\n                if (isNavigationFailure(failure, 2 /* NAVIGATION_GUARD_REDIRECT */)) {\r\n                    if (// we are redirecting to the same location we were already at\r\n                        isSameRouteLocation(stringifyQuery$1, resolve(failure.to), toLocation) &&\r\n                        // and we have done it a couple of times\r\n                        redirectedFrom &&\r\n                        // @ts-ignore\r\n                        (redirectedFrom._count = redirectedFrom._count\r\n                            ? // @ts-ignore\r\n                                redirectedFrom._count + 1\r\n                            : 1) > 10) {\r\n                        warn(`Detected an infinite redirection in a navigation guard when going from \"${from.fullPath}\" to \"${toLocation.fullPath}\". Aborting to avoid a Stack Overflow. This will break in production if not fixed.`);\r\n                        return Promise.reject(new Error('Infinite redirect in navigation guard'));\r\n                    }\r\n                    return pushWithRedirect(\r\n                    // keep options\r\n                    assign(locationAsObject(failure.to), {\r\n                        state: data,\r\n                        force,\r\n                        replace,\r\n                    }), \r\n                    // preserve the original redirectedFrom if any\r\n                    redirectedFrom || toLocation);\r\n                }\r\n            }\r\n            else {\r\n                // if we fail we don't finalize the navigation\r\n                failure = finalizeNavigation(toLocation, from, true, replace, data);\r\n            }\r\n            triggerAfterEach(toLocation, from, failure);\r\n            return failure;\r\n        });\r\n    }\r\n    /**\r\n     * Helper to reject and skip all navigation guards if a new navigation happened\r\n     * @param to\r\n     * @param from\r\n     */\r\n    function checkCanceledNavigationAndReject(to, from) {\r\n        const error = checkCanceledNavigation(to, from);\r\n        return error ? Promise.reject(error) : Promise.resolve();\r\n    }\r\n    // TODO: refactor the whole before guards by internally using router.beforeEach\r\n    function navigate(to, from) {\r\n        let guards;\r\n        const [leavingRecords, updatingRecords, enteringRecords] = extractChangingRecords(to, from);\r\n        // all components here have been resolved once because we are leaving\r\n        guards = extractComponentsGuards(leavingRecords.reverse(), 'beforeRouteLeave', to, from);\r\n        // leavingRecords is already reversed\r\n        for (const record of leavingRecords) {\r\n            record.leaveGuards.forEach(guard => {\r\n                guards.push(guardToPromiseFn(guard, to, from));\r\n            });\r\n        }\r\n        const canceledNavigationCheck = checkCanceledNavigationAndReject.bind(null, to, from);\r\n        guards.push(canceledNavigationCheck);\r\n        // run the queue of per route beforeRouteLeave guards\r\n        return (runGuardQueue(guards)\r\n            .then(() => {\r\n            // check global guards beforeEach\r\n            guards = [];\r\n            for (const guard of beforeGuards.list()) {\r\n                guards.push(guardToPromiseFn(guard, to, from));\r\n            }\r\n            guards.push(canceledNavigationCheck);\r\n            return runGuardQueue(guards);\r\n        })\r\n            .then(() => {\r\n            // check in components beforeRouteUpdate\r\n            guards = extractComponentsGuards(updatingRecords, 'beforeRouteUpdate', to, from);\r\n            for (const record of updatingRecords) {\r\n                record.updateGuards.forEach(guard => {\r\n                    guards.push(guardToPromiseFn(guard, to, from));\r\n                });\r\n            }\r\n            guards.push(canceledNavigationCheck);\r\n            // run the queue of per route beforeEnter guards\r\n            return runGuardQueue(guards);\r\n        })\r\n            .then(() => {\r\n            // check the route beforeEnter\r\n            guards = [];\r\n            for (const record of to.matched) {\r\n                // do not trigger beforeEnter on reused views\r\n                if (record.beforeEnter && from.matched.indexOf(record) < 0) {\r\n                    if (Array.isArray(record.beforeEnter)) {\r\n                        for (const beforeEnter of record.beforeEnter)\r\n                            guards.push(guardToPromiseFn(beforeEnter, to, from));\r\n                    }\r\n                    else {\r\n                        guards.push(guardToPromiseFn(record.beforeEnter, to, from));\r\n                    }\r\n                }\r\n            }\r\n            guards.push(canceledNavigationCheck);\r\n            // run the queue of per route beforeEnter guards\r\n            return runGuardQueue(guards);\r\n        })\r\n            .then(() => {\r\n            // NOTE: at this point to.matched is normalized and does not contain any () => Promise<Component>\r\n            // clear existing enterCallbacks, these are added by extractComponentsGuards\r\n            to.matched.forEach(record => (record.enterCallbacks = {}));\r\n            // check in-component beforeRouteEnter\r\n            guards = extractComponentsGuards(enteringRecords, 'beforeRouteEnter', to, from);\r\n            guards.push(canceledNavigationCheck);\r\n            // run the queue of per route beforeEnter guards\r\n            return runGuardQueue(guards);\r\n        })\r\n            .then(() => {\r\n            // check global guards beforeResolve\r\n            guards = [];\r\n            for (const guard of beforeResolveGuards.list()) {\r\n                guards.push(guardToPromiseFn(guard, to, from));\r\n            }\r\n            guards.push(canceledNavigationCheck);\r\n            return runGuardQueue(guards);\r\n        })\r\n            // catch any navigation canceled\r\n            .catch(err => isNavigationFailure(err, 8 /* NAVIGATION_CANCELLED */)\r\n            ? err\r\n            : Promise.reject(err)));\r\n    }\r\n    function triggerAfterEach(to, from, failure) {\r\n        // navigation is confirmed, call afterGuards\r\n        // TODO: wrap with error handlers\r\n        for (const guard of afterGuards.list())\r\n            guard(to, from, failure);\r\n    }\r\n    /**\r\n     * - Cleans up any navigation guards\r\n     * - Changes the url if necessary\r\n     * - Calls the scrollBehavior\r\n     */\r\n    function finalizeNavigation(toLocation, from, isPush, replace, data) {\r\n        // a more recent navigation took place\r\n        const error = checkCanceledNavigation(toLocation, from);\r\n        if (error)\r\n            return error;\r\n        // only consider as push if it's not the first navigation\r\n        const isFirstNavigation = from === START_LOCATION_NORMALIZED;\r\n        const state = !isBrowser ? {} : history.state;\r\n        // change URL only if the user did a push/replace and if it's not the initial navigation because\r\n        // it's just reflecting the url\r\n        if (isPush) {\r\n            // on the initial navigation, we want to reuse the scroll position from\r\n            // history state if it exists\r\n            if (replace || isFirstNavigation)\r\n                routerHistory.replace(toLocation.fullPath, assign({\r\n                    scroll: isFirstNavigation && state && state.scroll,\r\n                }, data));\r\n            else\r\n                routerHistory.push(toLocation.fullPath, data);\r\n        }\r\n        // accept current navigation\r\n        currentRoute.value = toLocation;\r\n        handleScroll(toLocation, from, isPush, isFirstNavigation);\r\n        markAsReady();\r\n    }\r\n    let removeHistoryListener;\r\n    // attach listener to history to trigger navigations\r\n    function setupListeners() {\r\n        removeHistoryListener = routerHistory.listen((to, _from, info) => {\r\n            // cannot be a redirect route because it was in history\r\n            let toLocation = resolve(to);\r\n            // due to dynamic routing, and to hash history with manual navigation\r\n            // (manually changing the url or calling history.hash = '#/somewhere'),\r\n            // there could be a redirect record in history\r\n            const shouldRedirect = handleRedirectRecord(toLocation);\r\n            if (shouldRedirect) {\r\n                pushWithRedirect(assign(shouldRedirect, { replace: true }), toLocation).catch(noop);\r\n                return;\r\n            }\r\n            pendingLocation = toLocation;\r\n            const from = currentRoute.value;\r\n            // TODO: should be moved to web history?\r\n            if (isBrowser) {\r\n                saveScrollPosition(getScrollKey(from.fullPath, info.delta), computeScrollPosition());\r\n            }\r\n            navigate(toLocation, from)\r\n                .catch((error) => {\r\n                if (isNavigationFailure(error, 4 /* NAVIGATION_ABORTED */ | 8 /* NAVIGATION_CANCELLED */)) {\r\n                    return error;\r\n                }\r\n                if (isNavigationFailure(error, 2 /* NAVIGATION_GUARD_REDIRECT */)) {\r\n                    // Here we could call if (info.delta) routerHistory.go(-info.delta,\r\n                    // false) but this is bug prone as we have no way to wait the\r\n                    // navigation to be finished before calling pushWithRedirect. Using\r\n                    // a setTimeout of 16ms seems to work but there is not guarantee for\r\n                    // it to work on every browser. So Instead we do not restore the\r\n                    // history entry and trigger a new navigation as requested by the\r\n                    // navigation guard.\r\n                    // the error is already handled by router.push we just want to avoid\r\n                    // logging the error\r\n                    pushWithRedirect(error.to, toLocation\r\n                    // avoid an uncaught rejection, let push call triggerError\r\n                    ).catch(noop);\r\n                    // avoid the then branch\r\n                    return Promise.reject();\r\n                }\r\n                // do not restore history on unknown direction\r\n                if (info.delta)\r\n                    routerHistory.go(-info.delta, false);\r\n                // unrecognized error, transfer to the global handler\r\n                return triggerError(error);\r\n            })\r\n                .then((failure) => {\r\n                failure =\r\n                    failure ||\r\n                        finalizeNavigation(\r\n                        // after navigation, all matched components are resolved\r\n                        toLocation, from, false);\r\n                // revert the navigation\r\n                if (failure && info.delta)\r\n                    routerHistory.go(-info.delta, false);\r\n                triggerAfterEach(toLocation, from, failure);\r\n            })\r\n                .catch(noop);\r\n        });\r\n    }\r\n    // Initialization and Errors\r\n    let readyHandlers = useCallbacks();\r\n    let errorHandlers = useCallbacks();\r\n    let ready;\r\n    /**\r\n     * Trigger errorHandlers added via onError and throws the error as well\r\n     * @param error - error to throw\r\n     * @returns the error as a rejected promise\r\n     */\r\n    function triggerError(error) {\r\n        markAsReady(error);\r\n        errorHandlers.list().forEach(handler => handler(error));\r\n        return Promise.reject(error);\r\n    }\r\n    function isReady() {\r\n        if (ready && currentRoute.value !== START_LOCATION_NORMALIZED)\r\n            return Promise.resolve();\r\n        return new Promise((resolve, reject) => {\r\n            readyHandlers.add([resolve, reject]);\r\n        });\r\n    }\r\n    /**\r\n     * Mark the router as ready, resolving the promised returned by isReady(). Can\r\n     * only be called once, otherwise does nothing.\r\n     * @param err - optional error\r\n     */\r\n    function markAsReady(err) {\r\n        if (ready)\r\n            return;\r\n        ready = true;\r\n        setupListeners();\r\n        readyHandlers\r\n            .list()\r\n            .forEach(([resolve, reject]) => (err ? reject(err) : resolve()));\r\n        readyHandlers.reset();\r\n    }\r\n    // Scroll behavior\r\n    function handleScroll(to, from, isPush, isFirstNavigation) {\r\n        const { scrollBehavior } = options;\r\n        if (!isBrowser || !scrollBehavior)\r\n            return Promise.resolve();\r\n        let scrollPosition = (!isPush && getSavedScrollPosition(getScrollKey(to.fullPath, 0))) ||\r\n            ((isFirstNavigation || !isPush) &&\r\n                history.state &&\r\n                history.state.scroll) ||\r\n            null;\r\n        return vue.nextTick()\r\n            .then(() => scrollBehavior(to, from, scrollPosition))\r\n            .then(position => position && scrollToPosition(position))\r\n            .catch(triggerError);\r\n    }\r\n    const go = (delta) => routerHistory.go(delta);\r\n    let started;\r\n    const installedApps = new Set();\r\n    const router = {\r\n        currentRoute,\r\n        addRoute,\r\n        removeRoute,\r\n        hasRoute,\r\n        getRoutes,\r\n        resolve,\r\n        options,\r\n        push,\r\n        replace,\r\n        go,\r\n        back: () => go(-1),\r\n        forward: () => go(1),\r\n        beforeEach: beforeGuards.add,\r\n        beforeResolve: beforeResolveGuards.add,\r\n        afterEach: afterGuards.add,\r\n        onError: errorHandlers.add,\r\n        isReady,\r\n        install(app) {\r\n            const router = this;\r\n            app.component('RouterLink', RouterLink);\r\n            app.component('RouterView', RouterView);\r\n            app.config.globalProperties.$router = router;\r\n            Object.defineProperty(app.config.globalProperties, '$route', {\r\n                enumerable: true,\r\n                get: () => vue.unref(currentRoute),\r\n            });\r\n            // this initial navigation is only necessary on client, on server it doesn't\r\n            // make sense because it will create an extra unnecessary navigation and could\r\n            // lead to problems\r\n            if (isBrowser &&\r\n                // used for the initial navigation client side to avoid pushing\r\n                // multiple times when the router is used in multiple apps\r\n                !started &&\r\n                currentRoute.value === START_LOCATION_NORMALIZED) {\r\n                // see above\r\n                started = true;\r\n                push(routerHistory.location).catch(err => {\r\n                    warn('Unexpected error when starting the router:', err);\r\n                });\r\n            }\r\n            const reactiveRoute = {};\r\n            for (let key in START_LOCATION_NORMALIZED) {\r\n                // @ts-ignore: the key matches\r\n                reactiveRoute[key] = vue.computed(() => currentRoute.value[key]);\r\n            }\r\n            app.provide(routerKey, router);\r\n            app.provide(routeLocationKey, vue.reactive(reactiveRoute));\r\n            app.provide(routerViewLocationKey, currentRoute);\r\n            let unmountApp = app.unmount;\r\n            installedApps.add(app);\r\n            app.unmount = function () {\r\n                installedApps.delete(app);\r\n                if (installedApps.size < 1) {\r\n                    removeHistoryListener();\r\n                    currentRoute.value = START_LOCATION_NORMALIZED;\r\n                    started = false;\r\n                    ready = false;\r\n                }\r\n                unmountApp();\r\n            };\r\n            if (isBrowser) {\r\n                addDevtools(app, router, matcher);\r\n            }\r\n        },\r\n    };\r\n    return router;\r\n}\r\nfunction runGuardQueue(guards) {\r\n    return guards.reduce((promise, guard) => promise.then(() => guard()), Promise.resolve());\r\n}\r\nfunction extractChangingRecords(to, from) {\r\n    const leavingRecords = [];\r\n    const updatingRecords = [];\r\n    const enteringRecords = [];\r\n    const len = Math.max(from.matched.length, to.matched.length);\r\n    for (let i = 0; i < len; i++) {\r\n        const recordFrom = from.matched[i];\r\n        if (recordFrom) {\r\n            if (to.matched.find(record => isSameRouteRecord(record, recordFrom)))\r\n                updatingRecords.push(recordFrom);\r\n            else\r\n                leavingRecords.push(recordFrom);\r\n        }\r\n        const recordTo = to.matched[i];\r\n        if (recordTo) {\r\n            // the type doesn't matter because we are comparing per reference\r\n            if (!from.matched.find(record => isSameRouteRecord(record, recordTo))) {\r\n                enteringRecords.push(recordTo);\r\n            }\r\n        }\r\n    }\r\n    return [leavingRecords, updatingRecords, enteringRecords];\r\n}\n\n/**\r\n * Returns the router instance. Equivalent to using `$router` inside\r\n * templates.\r\n */\r\nfunction useRouter() {\r\n    return vue.inject(routerKey);\r\n}\r\n/**\r\n * Returns the current route location. Equivalent to using `$route` inside\r\n * templates.\r\n */\r\nfunction useRoute() {\r\n    return vue.inject(routeLocationKey);\r\n}\n\nexports.RouterLink = RouterLink;\nexports.RouterView = RouterView;\nexports.START_LOCATION = START_LOCATION_NORMALIZED;\nexports.createMemoryHistory = createMemoryHistory;\nexports.createRouter = createRouter;\nexports.createRouterMatcher = createRouterMatcher;\nexports.createWebHashHistory = createWebHashHistory;\nexports.createWebHistory = createWebHistory;\nexports.isNavigationFailure = isNavigationFailure;\nexports.matchedRouteKey = matchedRouteKey;\nexports.onBeforeRouteLeave = onBeforeRouteLeave;\nexports.onBeforeRouteUpdate = onBeforeRouteUpdate;\nexports.parseQuery = parseQuery;\nexports.routeLocationKey = routeLocationKey;\nexports.routerKey = routerKey;\nexports.routerViewLocationKey = routerViewLocationKey;\nexports.stringifyQuery = stringifyQuery;\nexports.useLink = useLink;\nexports.useRoute = useRoute;\nexports.useRouter = useRouter;\nexports.viewDepthKey = viewDepthKey;\n","import { getTarget, getDevtoolsGlobalHook } from './env';\nimport { HOOK_SETUP } from './const';\nexport * from './api';\nexport function setupDevtoolsPlugin(pluginDescriptor, setupFn) {\n    const hook = getDevtoolsGlobalHook();\n    if (hook) {\n        hook.emit(HOOK_SETUP, pluginDescriptor, setupFn);\n    }\n    else {\n        const target = getTarget();\n        const list = target.__VUE_DEVTOOLS_PLUGINS__ = target.__VUE_DEVTOOLS_PLUGINS__ || [];\n        list.push({\n            pluginDescriptor,\n            setupFn\n        });\n    }\n}\n","export function getDevtoolsGlobalHook() {\n    return getTarget().__VUE_DEVTOOLS_GLOBAL_HOOK__;\n}\nexport function getTarget() {\n    // @ts-ignore\n    return typeof navigator !== 'undefined'\n        ? window\n        : typeof global !== 'undefined'\n            ? global\n            : {};\n}\n","\"use strict\";\n\nexports.interopDefault = function (a) {\n  return a && a.__esModule ? a : {\n    default: a\n  };\n};\n\nexports.defineInteropFlag = function (a) {\n  Object.defineProperty(a, '__esModule', {\n    value: true\n  });\n};\n\nexports.exportAll = function (source, dest) {\n  Object.keys(source).forEach(function (key) {\n    if (key === 'default' || key === '__esModule') {\n      return;\n    } // Skip duplicate re-exports when they have the same value.\n\n\n    if (key in dest && dest[key] === source[key]) {\n      return;\n    }\n\n    Object.defineProperty(dest, key, {\n      enumerable: true,\n      get: function () {\n        return source[key];\n      }\n    });\n  });\n  return dest;\n};\n\nexports.export = function (dest, destName, get) {\n  Object.defineProperty(dest, destName, {\n    enumerable: true,\n    get: get\n  });\n};","export const HOOK_SETUP = 'devtools-plugin:setup';\n","export * from './api';\nexport * from './app';\nexport * from './component';\nexport * from './context';\nexport * from './hooks';\nexport * from './util';\n","/**\n * vue-meta v3.0.0-alpha.9\n * (c) 2021\n * - Pim (@pimlie)\n * - All the amazing contributors\n * @license MIT\n */\nimport{markRaw as t,h as e,getCurrentInstance as o,isProxy as r,watch as n,inject as s,defineComponent as i,reactive as c,onUnmounted as a,Teleport as u,Comment as l,computed as f}from\"vue\";const d=(t,e)=>(o,r)=>{let n=-1;if(r.reduce(((e,o,r)=>{const s=t(e,o);return s!==e?(n=r,s):e}),e),n>-1)return o[n]},p=d(((t,e)=>{const{depth:o}=e;return!t||o>t?o:t}));var m=Object.freeze({__proto__:null,setup:t=>{let e=0;if(t.vm){let{vm:o}=t;do{o.parent&&(e++,o=o.parent)}while(o&&o.parent&&o!==o.root)}t.depth=e},resolve:p});const b={body:{tag:\"script\",to:\"body\"},base:{valueAttribute:\"href\"},charset:{tag:\"meta\",nameless:!0,valueAttribute:\"charset\"},description:{tag:\"meta\"},og:{group:!0,namespacedAttribute:!0,tag:\"meta\",keyAttribute:\"property\"},twitter:{group:!0,namespacedAttribute:!0,tag:\"meta\"},htmlAttrs:{attributesFor:\"html\"},headAttrs:{attributesFor:\"head\"},bodyAttrs:{attributesFor:\"body\"}},h={title:{attributes:!1},base:{contentAsAttribute:!0,attributes:[\"href\",\"target\"]},meta:{contentAsAttribute:!0,keyAttribute:\"name\",attributes:[\"content\",\"name\",\"http-equiv\",\"charset\"]},link:{contentAsAttribute:!0,attributes:[\"href\",\"crossorigin\",\"rel\",\"media\",\"integrity\",\"hreflang\",\"type\",\"referrerpolicy\",\"sizes\",\"imagesrcset\",\"imagesizes\",\"as\",\"color\"]},style:{attributes:[\"media\"]},script:{attributes:[\"src\",\"type\",\"nomodule\",\"async\",\"defer\",\"crossorigin\",\"integrity\",\"referrerpolicy\"]},noscript:{attributes:!1}};Object.freeze({}),Object.freeze([]);const g=Array.isArray,y=t=>\"function\"==typeof t,v=t=>\"string\"==typeof t,S=t=>null!==t&&\"object\"==typeof t,A=Object.prototype.toString,k=t=>\"[object Object]\"===A.call(t),N=Symbol(\"kIsProxy\"),j=Symbol(\"kProxySources\"),R=Symbol(\"kProxyTarget\"),w=Symbol(\"kResolveContext\");function x(t){if(g(t))return t.map(x);if(S(t)){const e={};for(const o in t)e[o]=\"context\"===o?t[o]:x(t[o]);return e}return t}const O=(t,e,o)=>{const r=[];for(const n of t)n&&e in n&&(r.push(n[e]),o&&o(n));return r},$=(t,e=[],o,r)=>{if(!o&&!r&&(({active:o,sources:r}=t),e.length))for(let t=0;t<e.length;t++){const n=e[t];if(!o||!o[n])return void console.error(`recompute: segment ${n} not found on target`,e,o);o=o[n],r=r.map((t=>t[n])).filter(Boolean)}if(!o||!r)return;const n=((t,...e)=>{const o=t?Object.keys(t):[];if(e)for(const t of e)if(t&&S(t))for(const e in t)o.includes(e)||o.push(e);return o})(...r),s=Object.keys(o);for(const t of s)n.includes(t)||delete o[t];for(const s of n){let n=!1;for(let t=0;t<r.length;t++){const e=r[t];if(e&&s in e&&void 0!==e[s]){n=k(e[s]);break}}if(n){o[s]||(o[s]={});const n=[];for(const t of r)s in t&&n.push(t[s]);$(t,[...e,s],o[s],n);continue}!o[s]&&g(r[0][s])&&(o[s]=[]);const i=[],c=O(r,s,(t=>i.push(t[w])));let a=t.resolve(c,i,o[s],s,e);k(a)&&(a=x(a)),o[s]=a}},P=(e,o,r,n=[])=>{const s=C(e,r,n),i=t(new Proxy(o,s));return!n.length&&e.sources&&e.sources.push(i),i},C=(t,e,o=[])=>({get:(r,n,s)=>{if(n===N)return!0;if(n===j)return t.sources;if(n===R)return r;if(n===w)return e;let i=Reflect.get(r,n,s);if(!S(i))return i;if(!i[N]){const s=[...o,n];i=P(t,i,e,s),Reflect.set(r,n,i)}return i},set:(e,r,n)=>{const s=Reflect.set(e,r,n);if(s){const i=g(e);let c,a=!1,{sources:u,active:l}=t,f=0;for(const t of o){if(u=O(u,t),i&&f===o.length-1){c=t;break}g(l)&&(a=!0),l=l[t],f++}if(a)return $(t),s;if(k(n))return $(t,o),s;let d,p=[];i?(d=u,p=u.map((t=>t[w]))):d=O(u,r,(t=>p.push(t[w])));let m=t.resolve(d,p,l,r,o);k(m)&&(m=x(m)),i&&c?l[c]=m:l[r]=m}return s},deleteProperty:(e,r)=>{const n=Reflect.deleteProperty(e,r);if(n){const n=g(e);let s,i=t.sources,c=t.active,a=0;for(const t of o){if(i=i.map((e=>e&&e[t])),n&&a===o.length-1){s=t;break}c=c[t],a++}if(i.some((t=>t&&r in t))){let e,a=[];n?(e=i,a=i.map((t=>t[w]))):e=O(i,r,(t=>a.push(t[w])));let u=t.resolve(e,a,c,r,o);k(u)&&(u=x(u)),n&&s?c[s]=u:c[r]=u}else delete c[r]}return n}}),M={};function F(t,o,r,n){return\"attributesFor\"in n?function(t,o,r,n){const{attributesFor:s}=n;if(!s||!r)return;if(t.isSSR)return{to:\"\",vnode:e(`ssr-${s}`,r)};if(!M[s]){const[t,e]=Array.from(document.querySelectorAll(s));if(!t)return void console.error(\"Could not find element for selector\",s,\", won't render attributes\");e&&console.warn(\"Found multiple elements for selector\",s),M[s]={el:t,attrs:[]}}const{el:i,attrs:c}=M[s];for(const e in r){let n=U(t,`${o}(${e})`,r[e],r);g(n)&&(n=n.join(\",\")),i.setAttribute(e,n||\"\"),c.includes(e)||c.push(e)}const a=c.filter((t=>!r[t]));for(const t of a)i.removeAttribute(t)}(t,o,r,n):\"group\"in n?function(t,e,o,r){if(g(o))return console.warn(\"Specifying an array for group properties isnt supported\"),[];return Object.keys(o).map((n=>{const s={group:e,data:o};if(r.namespaced)s.tagNamespace=!0===r.namespaced?e:r.namespaced;else if(r.namespacedAttribute){const t=!0===r.namespacedAttribute?e:r.namespacedAttribute;s.fullName=`${t}:${n}`,s.slotName=`${t}(${n})`}return E(t,e,o[n],r,s)})).filter(Boolean).flat()}(t,o,r,n):E(t,o,r,n)}function E(t,o,r,n={},s){const i=[\"content\",\"json\",\"rawContent\"],c=t=>function(t,e){for(const o of t){const t=h[o];if(o&&t)return t[e]}}([a,n.tag],t);if(g(r))return r.map((e=>E(t,o,e,n,s))).filter(Boolean).flat();const{tag:a=n.tag||o}=r;let u=\"\",l=!1,f=!1;if(v(r))u=r;else if(r.children&&g(r.children))l=!0,u=r.children.map((e=>{const r=E(t,o,e,n,s);return g(r)?r.map((({vnode:t})=>t)):r&&r.vnode}));else{let t=0;for(const e of i){if(!u&&r[e]){u=1===t?JSON.stringify(r[e]):r[e],f=t>1;break}t++}}const d=s&&s.fullName||o,p=s&&s.slotName||o;let{attrs:m}=r;if(m||\"object\"!=typeof r)m||(m={});else{m={...r},delete m.tag,delete m.children,delete m.to;for(const t of i)delete m[t]}if(l)u=U(t,p,u,r);else{const e=!!c(\"contentAsAttribute\");let{valueAttribute:o}=n;if(!o&&e){const[t]=c(\"attributes\");o=v(e)?e:t}if(o){const{nameless:e}=n;if(!e){const t=n.keyAttribute||c(\"keyAttribute\");t&&(m[t]=d)}m[o]=U(t,p,m[o]||u,s),u=\"\"}else u=U(t,p,u,r)}const b=s&&s.tagNamespace?`${s.tagNamespace}:${a}`:a;if(\"title\"===b&&!t.isSSR)return void(document.title=u);f&&u&&(m.innerHTML=u);const y=e(b,m,u||void 0);return{to:r.to,vnode:y}}function U({metainfo:t,slots:e},o,r,n){const s=e&&e[o];if(!s||!y(s))return r;const i={content:r,metainfo:t};if(n&&n.group){const{group:t,data:e}=n;i[t]=e}const c=s(i);if(c&&c.length){const{children:t}=c[0];return t?t.toString():\"\"}return r}const z=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.toStringTag,_=(t=>z?Symbol(\"[vue-meta]: \"+t):\"[vue-meta]: \"+t)(\"meta_active\");function L(t,e,o){for(const r in e)r in o?S(t[r])?L(t[r],e[r],o[r]):e[r]!==o[r]&&(t[r]=e[r]):t[r]=e[r];for(const r in o)e&&r in e||delete t[r]}function q(t){if(t||(t=o()||void 0),t)return t.appContext.config.globalProperties.$metaManager}function B(t,e){const s=o()||void 0;if(!e&&s&&(e=q(s)),!e)throw new Error(\"No manager or current instance\");r(t)&&(n(t,((t,e)=>{L(i.meta,t,e)})),t=t.value);const i=e.addMeta(t,s);return i}function I(){return s(_)}const T=i({name:\"Metainfo\",inheritAttrs:!1,setup:(t,{slots:e})=>()=>{const t=q();if(t)return t.render({slots:e})}});function D(t,e,o,r){const n=g(r)?r:[r];t?o.endsWith(\"Attrs\")||n.forEach((t=>{t.props||(t.props={}),t.props[\"data-vm-ssr\"]=!0})):n.forEach(((t,e)=>{t.type===l&&n.splice(e,1)})),e[o]||(e[o]=[]),e[o].push(...n)}const H=(t=!1,e,o)=>J.create(t,e||b,o||m);class J{isSSR=!1;config;target;resolver;ssrCleanedUp=!1;constructor(t,e,o,r){this.isSSR=t,this.config=e,this.target=o,r&&\"setup\"in r&&y(r.setup)&&(this.resolver=r)}static create=(t,e,o)=>{const r=((t,e)=>{const o=[],r={active:e,resolve:t,sources:o},n=()=>$(r);return{context:r,compute:n,addSource:(t,e,o=!1)=>{const s=P(r,t,e||{});return o&&n(),s},delSource:(t,e=!0)=>{const r=o.findIndex((e=>e===t||e[R]===t));return r>-1&&(o.splice(r,1),e&&n(),!0)}}})(((t,e,r,n,s)=>y(o)?o(t,e,r,n,s):o.resolve(t,e,r,n,s)),c({}));return new J(t,e,r,o)};install(t){t.component(\"Metainfo\",T),t.config.globalProperties.$metaManager=this,t.provide(_,this.target.context.active)}addMeta(t,e){e||(e=o()||void 0);const r={removed:[]},n={vm:e},{resolver:s}=this;s&&s.setup&&s.setup(n);const i=this.target.addSource(t,n,!0),c=t=>this.unmount(!!t,i,r,e);return e&&a(c),{meta:i,onRemoved:t=>r.removed.push(t),unmount:c}}unmount(t,e,o,r){if(r){const{$el:n}=r.proxy;if(n&&n.offsetParent){let r=new MutationObserver((s=>{for(const{removedNodes:i}of s)i&&i.forEach((s=>{s===n&&r&&(r.disconnect(),r=void 0,this.reallyUnmount(t,e,o))}))}));return void r.observe(n.parentNode,{childList:!0})}}this.reallyUnmount(t,e,o)}async reallyUnmount(t,e,o){this.target.delSource(e),!t&&o&&await Promise.all(o.removed.map((t=>t())))}render({slots:t}={}){const o=this.target.context.active,{isSSR:r}=this;if(!r&&!this.ssrCleanedUp){this.ssrCleanedUp=!0;const t=()=>{const t=document.querySelectorAll(\"[data-vm-ssr]\");t&&t.length&&t.forEach((t=>t.parentNode&&t.parentNode.removeChild(t)))};\"loading\"===document.readyState?window.addEventListener(\"DOMContentLoaded\",t,{once:!0}):t()}const n={};for(const e in o){const s=this.config[e]||{};let i=F({isSSR:r,metainfo:o,slots:t},e,o[e],s);if(!i)continue;g(i)||(i=[i]);let c=\"base\"!==e&&o[e].to;!c&&\"to\"in s&&(c=s.to),!c&&\"attributesFor\"in s&&(c=e);for(const{to:t,vnode:e}of i)D(this.isSSR,n,t||c||\"head\",e)}if(t)for(const e in t){const r=\"default\"===e?\"head\":e;if(\"head\"!==r&&\"body\"!==r)continue;const s=t[e];y(s)&&D(this.isSSR,n,r,s({metainfo:o}))}return Object.keys(n).map((t=>e(u,{to:t},n[t])))}}const W={keyName:\"metaInfo\"},G=(t,e={})=>{const r=Object.assign({},W,e);t.mixin((t=>({created(){const e=o();if(!e?.type||!(t.keyName in e.type))return;const r=e.type[t.keyName];y(r)?B(f(r)):B(r)}}))(r))};export{H as createMetaManager,m as deepestResolver,b as defaultConfig,q as getCurrentManager,G as plugin,d as resolveOption,I as useActiveMeta,B as useMeta};\n","<template>\n  <metainfo />\n  <router-view></router-view>\n</template>\n\n<script>\nimport { useMeta } from \"vue-meta\";\n\nexport default {\n  metaInfo() {\n    return {\n      title: \"IPFS video player\",\n      description: \"Play a video from the IPFS CDN using js-ipfs or the ipfs.io gateway.\"\n    };\n  },\n};\n</script>\n","<template>\n  <div class=\"content\">\n    <h1 class=\"title\">Welcome to the IPFS video player</h1>\n    <p>\n      Below is a form where you can put in the\n      <a href=\"https://docs.ipfs.io/guides/concepts/cid/\"\n        >IPFS content id or path</a\n      >\n      of the video you would like to see and choose to use either IPFS directly\n      or a gateway.\n    </p>\n    <p>\n      If you have not found any good example to view yet, you can try\n      <router-link to=\"/ipfs/QmQWM1qDPasxm5sXAQeVMfmhnECBzyYkLgfK23yPif1Ftx\"\n        >Blender Half full</router-link\n      >, a\n      <router-link\n        to=\"/ipfs/Qme4QjkyZQuFtN2SDhELfXVshMyAEec53jaFQ8kR4maLeV/Alan Kay at OOPSLA 1997 - The computer revolution hasnt happened yet.webm\"\n        >talk by Alan Kay</router-link\n      >,\n      <router-link to=\"/ipfs/Qmcd7D6TnnzZzsk12DBwCMRYx1a8TVX4tq4eemYqspL4Rv\"\n        >a 4K UHD chick</router-link\n      >\n      from\n      <a\n        href=\"https://www.pexels.com/video/close-up-video-of-a-person-holding-a-chick-5913245/\"\n        >Pexel videos</a\n      >,\n      <router-link to=\"/ipfs/QmbGtJg23skhvFmu9mJiePVByhfzu5rwo74MEkVDYAmF5T\"\n        >Big Buck Bunny</router-link\n      >, or the\n      <a href=\"https://cloud.blender.org/films/caminandes-2/\">Caminandes</a>\n      series\n      <router-link\n        to=\"/ipfs/QmYHDhsgUgdKSAimguGC92MzQ8VNFHZw3yp6kAHwiXCFLm/01_llama_drama_1080p.webm\"\n        >1</router-link\n      >,\n      <router-link\n        to=\"/ipfs/QmYHDhsgUgdKSAimguGC92MzQ8VNFHZw3yp6kAHwiXCFLm/02_gran_dillama_1080p.webm\"\n        >2</router-link\n      >,\n      <router-link\n        to=\"/ipfs/QmYHDhsgUgdKSAimguGC92MzQ8VNFHZw3yp6kAHwiXCFLm/03_caminandes_llamigos_1080p.webm\"\n        >3</router-link\n      >.\n    </p>\n  </div>\n  <div class=\"block\">\n    <path-form />\n  </div>\n  <div class=\"content\">\n    <h2>IPFS directly vs gateway</h2>\n    <p>\n      IPFS directly is the coolest option, it uses\n      <a href=\"https://js.ipfs.io/\">js-ipfs</a> in the browser to stream the\n      video. However, there is\n      <em>only support for VP8 video with OPUS audio in a WEBM container</em>.\n    </p>\n    <p>\n      The gateway uses <a href=\"https://ipfs.io/\">ipfs.io</a> to access the\n      video via an HTTP gateway. This supports all video content supported by\n      your browser, but does not use cool technology.\n    </p>\n    <p>\n      If you want to host a video directly from IPFS, make sure you recode it\n      first. For example, to recode a file called <code>monkey.avi</code> you\n      could use <code>ffmpeg</code> with the following commandline:\n    </p>\n    <pre>\nffmpeg -i monkey.avi -c:v libvpx -crf 45 -b:v 10M -r 25 -c:a libopus -b:a 96K monkey.webm</pre\n    >\n    <p>\n      Host the resulting <code>monkey.webm</code> on IPFS and point this website\n      to the CID or path. If you have bash available, you can also download\n      <a\n        href=\"https://github.com/bneijt/ipfs-video-frontend/blob/main/recode_vp8_webm.sh\"\n        >a recode script from GitHub</a\n      >.\n    </p>\n    <h2>Submit issues</h2>\n    <p>\n      This project is open source and you are invited to submit issues at\n      <a href=\"https://github.com/bneijt/ipfs-video-frontend\"\n        >the Github project page</a\n      >.\n    </p>\n    <h2>See also</h2>\n    <p>\n      A <a href=\"https://kodi.tv/\">Kodi</a> plugin under development that will\n      complement this website, available at:<a\n        href=\"https://github.com/bneijt/ipfs-video-kodi\"\n        >https://github.com/bneijt/ipfs-video-kodi</a\n      >\n    </p>\n    <p>\n      <a href=\"https://ipfstube.erindachtler.me/\">IPFSTube</a>: same idea, but\n      different implementation. Has a great\n      <a\n        href=\"https://ipfstube.erindachtler.me/v/QmU1GSqu4w29Pt7EEM57Lhte8Lce6e7kuhRHo6rSNb2UaC\"\n        >demo video</a\n      >.\n    </p>\n    <p>\n      <a href=\"https://pinata.cloud/\">Pinata</a>: a simple web interface to\n      easily manage and host/pin content on IPFS.\n    </p>\n    <p>\n      <a href=\"https://www.reddit.com/r/IPFS_Hashes\">Reddit IPFS_Hashes</a>: a\n      reddit page where people share IPFS hashes, some are video hashes as well.\n    </p>\n    <p>\n      A project to help you host your own IPFS pinning gateway easily:\n      <a href=\"https://github.com/bneijt/ipfs-video-gateway\"\n        >https://github.com/bneijt/ipfs-video-gateway</a\n      >\n    </p>\n  </div>\n</template>\n\n<script>\nexport default {};\n</script>\n","<template>\n  <div class=\"block\">\n    <h1 class=\"title\">{{ title }}</h1>\n    <video ref=\"video\" controls muted autoplay />\n    <p class=\"has-text-right\">\n      <small>{{ status }}</small>\n    </p>\n  </div>\n  <div class=\"block\">\n    <path-form />\n  </div>\n</template>\n\n<script>\nimport { useMeta } from \"vue-meta\";\nimport { useRoute } from \"vue-router\";\n\n\n// MP4 mime info: https://gist.github.com/jimkang/f23ce12c359c7465e83f\nconst V_VP8 = new TextEncoder().encode(\"V_VP8\"),\n  V_VP9 = new TextEncoder().encode(\"V_VP9\"),\n  V_AV1 = new TextEncoder().encode(\"V_AV1\"),\n  A_OPUS = new TextEncoder().encode(\"A_OPUS\"),\n  A_VORBIS = new TextEncoder().encode(\"A_VORBIS\"),\n  A_MP4A = new TextEncoder().encode(\"mp4a\"),\n  V_AVC1_42E01E = [0x42, 0xe0, 0x1e],\n  V_AVC1_640032 = [0x64, 0x00, 0x32];\n\nfunction isSubsequenceOf(subsequence, offset, data) {\n  return subsequence.every(function (value, index) {\n    return value === data[offset + index];\n  });\n}\nfunction containsSubsequence(needle, haystack) {\n  var startIndex = haystack.indexOf(needle[0]);\n  do {\n    if (isSubsequenceOf(needle, startIndex, haystack)) {\n      return true;\n    }\n    startIndex = haystack.indexOf(needle[0], startIndex + 1);\n  } while (startIndex > 0);\n  return false;\n}\nfunction findFirstSubsequence(needles, haystack) {\n  for (let needle_name in needles) {\n    if (containsSubsequence(needles[needle_name], haystack)) {\n      return needle_name;\n    }\n  }\n  return undefined;\n}\n\nfunction mimeCodecFor(blob) {\n  //See also https://www.garykessler.net/library/file_sigs.html\n  // mime, offset, magic bytes\n  var container = \"video/webm\",\n    codecs = \"\";\n  const mimes = [\n      [\"video/mp4\", 4, [0x66, 0x74, 0x79, 0x70, 0x4d, 0x53, 0x4e, 0x56]],\n      [\"video/mp4\", 4, [0x66, 0x74, 0x79, 0x70, 0x69, 0x73, 0x6f, 0x6d]],\n      [\"video/mp4\", 4, [0x66, 0x74, 0x79, 0x70, 0x6d, 0x70, 0x34, 0x32]],\n      [\"video/webm\", 0, [0x1a, 0x45, 0xdf, 0xa3]],\n    ],\n    firstChunk = blob.slice(0, 0x3b0);\n\n  for (const match of mimes) {\n    const name = match[0],\n      magicBytesOffset = match[1],\n      magicBytes = match[2];\n    if (isSubsequenceOf(magicBytes, magicBytesOffset, firstChunk)) {\n      container = name;\n      break;\n    }\n  }\n\n  //Sniff codecs\n  if (container == \"video/webm\") {\n    const video_formats = {\n        vp8: V_VP8,\n        vp9: V_VP9,\n        av1: V_AV1,\n      },\n      audio_formats = {\n        opus: A_OPUS,\n        vorbis: A_VORBIS,\n      };\n\n    codecs = [\n      findFirstSubsequence(video_formats, firstChunk),\n      findFirstSubsequence(audio_formats, firstChunk),\n    ]\n      .filter((i) => i !== undefined)\n      .join(\", \");\n  } else if (container == \"video/mp4\") {\n    const video_formats = {\n        \"avc1.42E01E\": V_AVC1_42E01E,\n        \"avc1.640032\": V_AVC1_640032,\n      },\n      audio_formats = {\n        \"mp4a.40.2\": A_MP4A,\n      };\n    codecs = [\n      findFirstSubsequence(video_formats, firstChunk),\n      findFirstSubsequence(audio_formats, firstChunk),\n    ]\n      .filter((i) => i !== undefined)\n      .join(\", \");\n  }\n\n  if (codecs.length > 0) {\n    return `${container}; codecs=\"${codecs}\"`;\n  }\n  return `${container}`;\n}\n\nasync function loadIpfsPath(ipfs, path, errorHandler) {\n  var mediaSource = new MediaSource();\n\n  mediaSource.addEventListener(\"sourceopen\", onMediaSourceOpen);\n\n  async function onMediaSourceOpen() {\n    try {\n      for await (const file of ipfs.get(path)) {\n        if (file.type == \"dir\") {\n          errorHandler(\"This points to a directory\", \"ls\");\n          return;\n        }\n        if (!file.content) {\n          errorHandler(\"Given path does not point to a file\");\n          return;\n        }\n        var firstChunk = await file.content.next();\n        var mimeCodec = mimeCodecFor(firstChunk.value),\n          sourceBuffer = mediaSource.addSourceBuffer(mimeCodec);\n\n        console.log(\"Detected mime codec: \", mimeCodec);\n        if (!MediaSource.isTypeSupported(mimeCodec)) {\n          errorHandler(\"Your browser does not support \" + mimeCodec);\n          return;\n        }\n        sourceBuffer.addEventListener(\"abort\", function (ev) {\n          errorHandler(ev);\n        });\n        sourceBuffer.addEventListener(\"error\", function (ev) {\n          errorHandler(ev);\n        });\n        sourceBuffer.addEventListener(\n          \"updateend\",\n          onUpdateEndContinue(file.content)\n        );\n        sourceBuffer.appendBuffer(firstChunk.value);\n      }\n    } catch (err) {\n      errorHandler(err);\n    }\n  }\n  function onUpdateEndContinue(asyncIterableContents) {\n    return async function appendNext(ev) {\n      var sourceBuffer = ev.target,\n        chunk = await asyncIterableContents.next();\n      if (chunk.done) {\n        sourceBuffer.removeEventListener(\"updateend\", appendNext);\n        mediaSource.endOfStream();\n      } else {\n        try {\n          sourceBuffer.appendBuffer(chunk.value);\n        } catch (exp) {\n          //Quota exceeded if the video element was already removed\n          console.error(\"Failed to append video buffer.\", exp);\n          errorHandler(`Failed to append video buffer: '${exp}' `);\n          sourceBuffer.removeEventListener(\"updateend\", appendNext);\n        }\n      }\n    };\n  }\n\n  return mediaSource;\n}\n\nfunction extractMeta(route) {\n  if (route.params.ipfsPath !== undefined) {\n    const titleValue = route.params.ipfsPath[route.params.ipfsPath.length - 1];\n    return {\n      title: titleValue,\n      description: `IPFS video player playing '${titleValue}'`,\n    };\n  }\n  return {\n    title: \"IPFS video player using js-ipfs\",\n    description: \"IPFS video player using js-ipfs\",\n  };\n}\n\nexport default {\n  inject: [\"ipfs\"],\n  setup() {\n    const route = useRoute();\n    useMeta(extractMeta(route));\n  },\n  data() {\n    if (!window.MediaSource) {\n      return {\n        status: \"No Media Source API available, you can't use IPFS directly.\",\n      };\n    }\n\n    return {\n      status: \"Initializing...\",\n    };\n  },\n  mounted: function () {\n    this.loadVideo();\n  },\n  computed: {\n    title: function () {\n      return extractMeta(this.$route).title;\n    },\n    ipfsPath: function () {\n      if (this.$route.params.ipfsPath !== undefined) {\n        return this.$route.params.ipfsPath.join(\"/\");\n      }\n      return \"\";\n    },\n  },\n  watch: {\n    ipfsPath(newPath, oldPath) {\n      if (newPath !== undefined && newPath.length) {\n        this.loadVideo();\n      }\n    },\n  },\n  methods: {\n    async loadVideo() {\n      const component = this;\n      try {\n        const ipfs = await this.$ipfs,\n          ipfsPath = this.ipfsPath;\n\n        const { agentVersion, node_id } = await ipfs.id();\n        this.status = \"Loading\";\n\n        video_element = this.$refs[\"video\"];\n        var mediaSource = await loadIpfsPath(\n          ipfs,\n          ipfsPath,\n          function errorHandler(msg, reroute) {\n            component.status = `Failed to use IPFS directly: ${msg}`;\n            if (reroute !== undefined) {\n              component.$router.push(`/${reroute}/${ipfsPath}`);\n            }\n          }\n        );\n        if (mediaSource !== undefined) {\n          video_element.src = window.URL.createObjectURL(mediaSource);\n          mediaSource.addEventListener(\"sourceended\", function sourceEnded() {\n            component.status = \"Media source ended\";\n          });\n          mediaSource.addEventListener(\"sourceclose\", function sourceClose() {\n            component.status = \"Media source closed\";\n          });\n          mediaSource.addEventListener(\"sourceopen\", function () {\n            URL.revokeObjectURL(video_element.src);\n          });\n        }\n      } catch (err) {\n        // Set error status text.\n        this.status = `Error: ${err}`;\n      }\n    },\n  },\n};\n</script>\n","<template>\n  <div class=\"columns\">\n    <div class=\"column\">\n      <div class=\"field\">\n        <label class=\"label\">IPFS Path</label>\n        <div class=\"control\">\n          <input\n            placeholder=\"IPFS path or CID\"\n            class=\"input is-link\"\n            minlength=\"46\"\n            v-bind:class=\"{ 'is-danger': isInvalidIpfsPath }\"\n            type=\"text\"\n            v-model.trim=\"ipfsPath\"\n          />\n        </div>\n        <p class=\"help\">\n          For more information on this, read the\n          <router-link to=\"/\">help text on the homepage</router-link>.\n        </p>\n      </div>\n      <div class=\"field is-grouped\">\n        <div class=\"control\">\n          <button\n            @click=\"useIpfs\"\n            class=\"button\"\n            title=\"Use js-ipfs from the browser\"\n            v-bind:disabled=\"isInvalidIpfsPath\"\n          >\n            Use IPFS directly\n          </button>\n        </div>\n        <div class=\"control\">\n          <button\n            @click=\"useGateway\"\n            class=\"button\"\n            title=\"Use the ipfs.io HTTP gateway\"\n            v-bind:disabled=\"isInvalidIpfsPath\"\n          >\n            Use ipfs.io gateway\n          </button>\n        </div>\n      </div>\n    </div>\n  </div>\n</template>\n\n<script>\nconst MIN_CID_LENGTH = 46;\n\nexport default {\n  data() {\n    var ipfsPath = \"\";\n    if (this.$route.params.ipfsPath !== undefined) {\n      ipfsPath = this.$route.params.ipfsPath.join(\"/\");\n    }\n    return {\n      ipfsPath: ipfsPath,\n    };\n  },\n  computed: {\n    isInvalidIpfsPath() {\n      return (\n        this.ipfsPath === undefined || this.ipfsPath.length < MIN_CID_LENGTH\n      );\n    }\n  },\n  methods: {\n    useIpfs() {\n      this.$router.push(`/ipfs/${this.ipfsPath}`);\n    },\n    useGateway() {\n      this.$router.push(`/gw/${this.ipfsPath}`);\n    },\n  },\n};\n</script>\n","<template>\n  <div class=\"block\">\n    <h1 class=\"title\">{{ title }}</h1>\n    <video ref=\"video\" v-bind:src=\"gatewayUrl\" controls muted autoplay />\n    <p>\n      Direct link <a v-bind:href=\"gatewayUrl\">to ipfs.io</a> or\n      <a v-bind:href=\"localhostGatewayUrl\" target=\"_blank\">to localhost</a>.\n    </p>\n  </div>\n  <div class=\"block\">\n    <path-form />\n  </div>\n</template>\n\n<script>\nimport { useMeta } from \"vue-meta\";\nimport { useRoute } from \"vue-router\";\n\nfunction extractMeta(route) {\n  if (route.params.ipfsPath !== undefined) {\n    const titleValue = route.params.ipfsPath[route.params.ipfsPath.length - 1];\n    return {\n      title: titleValue,\n      description: `IPFS video player playing '${titleValue}' using the IPFS network`,\n    };\n  }\n  return {\n    title: \"IPFS gateway video\",\n    description: \"IPFS video player using the ipfs.io gateway\",\n  };\n}\n\nexport default {\n  setup() {\n    const route = useRoute();\n    useMeta(extractMeta(route));\n  },\n\n  computed: {\n    title: function () {\n      return extractMeta(this.$route).title;\n    },\n    localhostGatewayUrl: function () {\n      if (this.$route.params.ipfsPath !== undefined) {\n        const ipfsPath = this.$route.params.ipfsPath.join(\"/\");\n        return `http://localhost:8080/ipfs/${ipfsPath}`;\n      }\n      return \"\";\n    },\n    gatewayUrl: function () {\n      if (this.$route.params.ipfsPath !== undefined) {\n        const ipfsPath = this.$route.params.ipfsPath.join(\"/\");\n        return `https://ipfs.io/ipfs/${ipfsPath}`;\n      }\n      return \"\";\n    },\n  },\n};\n</script>\n","<template>\n  <div class=\"block\">\n    <h1 class=\"title\">{{ title }}</h1>\n    <h2 class=\"subtitle\">IPFS listing</h2>\n    <table class=\"table\">\n      <thead>\n        <tr>\n          <th>Name</th>\n          <th>Size</th>\n          <th><abbr title=\"Content Identifier\">CID</abbr></th>\n        </tr>\n      </thead>\n      <tbody>\n        <tr v-for=\"entry in entries\" v-bind:key=\"entry.cid\">\n          <td>\n            <router-link v-bind:to=\"'/ipfs/' + entry.path\">{{\n              entry.name\n            }}</router-link>\n          </td>\n          <td>{{ entry.size }}</td>\n          <td>\n            <code>{{ entry.cid }}</code>\n          </td>\n        </tr>\n      </tbody>\n    </table>\n    <p class=\"has-text-right\">\n      <small>{{ status }}</small>\n    </p>\n  </div>\n  <div class=\"block\">\n    <path-form />\n  </div>\n</template>\n\n<script>\nfunction entryInformationFrom(block) {\n  var entry = {\n    path: block.path,\n    cid: block.cid.string,\n    name: block.name,\n    size: block.size,\n  };\n  return entry;\n}\nexport default {\n  inject: [\"ipfs\"],\n  data() {\n    return {\n      status: \"Initializing...\",\n      entries: [],\n    };\n  },\n  mounted: function () {\n    this.getBlockInfo();\n  },\n  computed: {\n    ipfsPath: function () {\n      if (this.$route.params.ipfsPath !== undefined) {\n        return this.$route.params.ipfsPath.join(\"/\");\n      }\n      return \"\";\n    },\n    title: function () {\n      var titleValue = \"IPFS listing\";\n      if (this.$route.params.ipfsPath !== undefined) {\n        titleValue =\n          this.$route.params.ipfsPath[this.$route.params.ipfsPath.length - 1];\n        document.title = titleValue + \" - IPFS listing\";\n      }\n      return titleValue;\n    },\n  },\n  methods: {\n    async getBlockInfo() {\n      const component = this;\n      try {\n        const ipfs = await this.$ipfs,\n          ipfsPath = this.ipfsPath;\n\n        this.status = \"Looking up: \" + ipfsPath;\n        for await (const chunk of ipfs.ls(ipfsPath)) {\n          this.entries.push(entryInformationFrom(chunk));\n        }\n        this.status = \"\";\n      } catch (err) {\n        // Set error status text.\n        this.status = `Error: ${err}`;\n      }\n    },\n  },\n};\n</script>\n","<template>\n  <div class=\"block\">\n    <h1 class=\"title\">Not found</h1>\n    <p><router-link to=\"/\">go home</router-link></p>\n  </div>\n</template>\n\n<script>\nexport default {\n  metaInfo: {\n       title: \"Not found\",\n       description: \"Page not found\",\n       //meta: {\"http-equiv\":\"refresh\", content:\"2;url=http://example.com/\"}\n  },\n};\n</script>\n","import IPFS from 'ipfs'\n\nconst plugin = {\n  install: (app, options = {}) => {\n    app.config.globalProperties.$ipfs = IPFS.create(options)\n\n    app.provide('ipfs', options)\n  }\n}\n\n// Auto-install\nif (typeof window !== 'undefined' && window.Vue) {\n  window.Vue.use(plugin)\n}\n\nexport default plugin\n","'use strict'\n\n/**\n * @typedef {import('ipfs-core/src/components')} IPFS\n */\n\nmodule.exports = { ...require('ipfs-core') }\n","'use strict'\n\nconst globSource = require('ipfs-utils/src/files/glob-source')\nconst urlSource = require('ipfs-utils/src/files/url-source')\nconst PeerId = require('peer-id')\nconst crypto = require('libp2p-crypto')\nconst isIPFS = require('is-ipfs')\nconst { multiaddr } = require('multiaddr')\nconst multibase = require('multibase')\nconst multicodec = require('multicodec')\nconst multihashing = require('multihashing-async')\nconst multihash = multihashing.multihash\nconst CID = require('cids')\nconst { create } = require('./components')\n\n/**\n * @typedef {import('./components')} IPFS\n * @typedef {import('./types').Options} Options\n */\n\nmodule.exports = {\n  create,\n  crypto,\n  isIPFS,\n  CID,\n  multiaddr,\n  multibase,\n  multihash,\n  multihashing,\n  multicodec,\n  PeerId,\n  globSource,\n  urlSource\n}\n","'use strict'\n\nconst HTTP = require('../http')\n\n/**\n *\n * @param {string} url\n * @param {import(\"../types\").HTTPOptions} [options]\n * @returns {{ path: string; content?: AsyncIterable<Uint8Array> }}\n */\nconst urlSource = (url, options) => {\n  return {\n    path: decodeURIComponent(new URL(url).pathname.split('/').pop() || ''),\n    content: readURLContent(url, options)\n  }\n}\n\n/**\n *\n * @param {string} url\n * @param {import(\"../types\").HTTPOptions} [options]\n * @returns {AsyncIterable<Uint8Array>}\n */\nasync function * readURLContent (url, options) {\n  const http = new HTTP()\n  const response = await http.get(url, options)\n\n  yield * response.iterator()\n}\n\nmodule.exports = urlSource\n","/* eslint-disable no-undef */\n'use strict'\n\nconst { fetch, Request, Headers } = require('./http/fetch')\nconst { TimeoutError, HTTPError } = require('./http/error')\nconst merge = require('merge-options').bind({ ignoreUndefined: true })\nconst { URL, URLSearchParams } = require('iso-url')\nconst { AbortController } = require('native-abort-controller')\nconst anySignal = require('any-signal')\n\n/**\n * @typedef {import('stream').Readable} NodeReadableStream\n * @typedef {import('./types').HTTPOptions} HTTPOptions\n * @typedef {import('./types').ExtendedResponse} ExtendedResponse\n */\n\n/**\n * @template TResponse\n * @param {Promise<TResponse>} promise\n * @param {number | undefined} ms\n * @param {AbortController} abortController\n * @returns {Promise<TResponse>}\n */\nconst timeout = (promise, ms, abortController) => {\n  if (ms === undefined) {\n    return promise\n  }\n\n  const start = Date.now()\n\n  const timedOut = () => {\n    const time = Date.now() - start\n\n    return time >= ms\n  }\n\n  return new Promise((resolve, reject) => {\n    const timeoutID = setTimeout(() => {\n      if (timedOut()) {\n        reject(new TimeoutError())\n        abortController.abort()\n      }\n    }, ms)\n\n    /**\n     * @param {(value: any) => void } next\n     */\n    const after = (next) => {\n      /**\n       * @param {any} res\n       */\n      const fn = (res) => {\n        clearTimeout(timeoutID)\n\n        if (timedOut()) {\n          reject(new TimeoutError())\n          return\n        }\n\n        next(res)\n      }\n      return fn\n    }\n\n    promise\n      .then(after(resolve), after(reject))\n  })\n}\n\nconst defaults = {\n  throwHttpErrors: true,\n  credentials: 'same-origin'\n}\n\nclass HTTP {\n  /**\n   *\n   * @param {HTTPOptions} options\n   */\n  constructor (options = {}) {\n    /** @type {HTTPOptions} */\n    this.opts = merge(defaults, options)\n  }\n\n  /**\n   * Fetch\n   *\n   * @param {string | Request} resource\n   * @param {HTTPOptions} options\n   * @returns {Promise<ExtendedResponse>}\n   */\n  async fetch (resource, options = {}) {\n    /** @type {HTTPOptions} */\n    const opts = merge(this.opts, options)\n    const headers = new Headers(opts.headers)\n\n    // validate resource type\n    if (typeof resource !== 'string' && !(resource instanceof URL || resource instanceof Request)) {\n      throw new TypeError('`resource` must be a string, URL, or Request')\n    }\n\n    const url = new URL(resource.toString(), opts.base)\n\n    const {\n      searchParams,\n      transformSearchParams,\n      json\n    } = opts\n\n    if (searchParams) {\n      if (typeof transformSearchParams === 'function') {\n        // @ts-ignore\n        url.search = transformSearchParams(new URLSearchParams(opts.searchParams))\n      } else {\n        // @ts-ignore\n        url.search = new URLSearchParams(opts.searchParams)\n      }\n    }\n\n    if (json) {\n      opts.body = JSON.stringify(opts.json)\n      headers.set('content-type', 'application/json')\n    }\n\n    const abortController = new AbortController()\n    // @ts-ignore\n    const signal = anySignal([abortController.signal, opts.signal])\n\n    const response = await timeout(\n      fetch(\n        url.toString(),\n        {\n          ...opts,\n          signal,\n          timeout: undefined,\n          headers\n        }\n      ),\n      opts.timeout,\n      abortController\n    )\n\n    if (!response.ok && opts.throwHttpErrors) {\n      if (opts.handleError) {\n        await opts.handleError(response)\n      }\n      throw new HTTPError(response)\n    }\n\n    response.iterator = function () {\n      return fromStream(response.body)\n    }\n\n    response.ndjson = async function * () {\n      for await (const chunk of ndjson(response.iterator())) {\n        if (options.transform) {\n          yield options.transform(chunk)\n        } else {\n          yield chunk\n        }\n      }\n    }\n\n    return response\n  }\n\n  /**\n   * @param {string | Request} resource\n   * @param {HTTPOptions} options\n   */\n  post (resource, options = {}) {\n    return this.fetch(resource, { ...options, method: 'POST' })\n  }\n\n  /**\n   * @param {string | Request} resource\n   * @param {HTTPOptions} options\n   */\n  get (resource, options = {}) {\n    return this.fetch(resource, { ...options, method: 'GET' })\n  }\n\n  /**\n   * @param {string | Request} resource\n   * @param {HTTPOptions} options\n   */\n  put (resource, options = {}) {\n    return this.fetch(resource, { ...options, method: 'PUT' })\n  }\n\n  /**\n   * @param {string | Request} resource\n   * @param {HTTPOptions} options\n   */\n  delete (resource, options = {}) {\n    return this.fetch(resource, { ...options, method: 'DELETE' })\n  }\n\n  /**\n   * @param {string | Request} resource\n   * @param {HTTPOptions} options\n   */\n  options (resource, options = {}) {\n    return this.fetch(resource, { ...options, method: 'OPTIONS' })\n  }\n}\n\n/**\n * Parses NDJSON chunks from an iterator\n *\n * @param {AsyncIterable<Uint8Array>} source\n * @returns {AsyncIterable<any>}\n */\nconst ndjson = async function * (source) {\n  const decoder = new TextDecoder()\n  let buf = ''\n\n  for await (const chunk of source) {\n    buf += decoder.decode(chunk, { stream: true })\n    const lines = buf.split(/\\r?\\n/)\n\n    for (let i = 0; i < lines.length - 1; i++) {\n      const l = lines[i].trim()\n      if (l.length > 0) {\n        yield JSON.parse(l)\n      }\n    }\n    buf = lines[lines.length - 1]\n  }\n  buf += decoder.decode()\n  buf = buf.trim()\n  if (buf.length !== 0) {\n    yield JSON.parse(buf)\n  }\n}\n\n/**\n * Stream to AsyncIterable\n *\n * @template TChunk\n * @param {ReadableStream<TChunk> | NodeReadableStream | null} source\n * @returns {AsyncIterable<TChunk>}\n */\nconst fromStream = (source) => {\n  // Workaround for https://github.com/node-fetch/node-fetch/issues/766\n  if (isNodeReadableStream(source)) {\n    const iter = source[Symbol.asyncIterator]()\n    return {\n      [Symbol.asyncIterator] () {\n        return {\n          next: iter.next.bind(iter),\n          return (value) {\n            source.destroy()\n            if (typeof iter.return === 'function') {\n              return iter.return()\n            }\n            return Promise.resolve({ done: true, value })\n          }\n        }\n      }\n    }\n  }\n\n  if (isWebReadableStream(source)) {\n    const reader = source.getReader()\n    return (async function * () {\n      try {\n        while (true) {\n          // Read from the stream\n          const { done, value } = await reader.read()\n          // Exit if we're done\n          if (done) return\n          // Else yield the chunk\n          if (value) {\n            yield value\n          }\n        }\n      } finally {\n        reader.releaseLock()\n      }\n    })()\n  }\n\n  if (isAsyncIterable(source)) {\n    return source\n  }\n\n  throw new TypeError('Body can\\'t be converted to AsyncIterable')\n}\n\n/**\n * Check if it's an AsyncIterable\n *\n * @template {unknown} TChunk\n * @template {any} Other\n * @param {Other|AsyncIterable<TChunk>} value\n * @returns {value is AsyncIterable<TChunk>}\n */\nconst isAsyncIterable = (value) => {\n  return typeof value === 'object' &&\n  value !== null &&\n  typeof /** @type {any} */(value)[Symbol.asyncIterator] === 'function'\n}\n\n/**\n * Check for web readable stream\n *\n * @template {unknown} TChunk\n * @template {any} Other\n * @param {Other|ReadableStream<TChunk>} value\n * @returns {value is ReadableStream<TChunk>}\n */\nconst isWebReadableStream = (value) => {\n  return value && typeof /** @type {any} */(value).getReader === 'function'\n}\n\n/**\n * @param {any} value\n * @returns {value is NodeReadableStream}\n */\nconst isNodeReadableStream = (value) =>\n  Object.prototype.hasOwnProperty.call(value, 'readable') &&\n  Object.prototype.hasOwnProperty.call(value, 'writable')\n\nHTTP.HTTPError = HTTPError\nHTTP.TimeoutError = TimeoutError\nHTTP.streamToAsyncIterator = fromStream\n\n/**\n * @param {string | Request} resource\n * @param {HTTPOptions} [options]\n */\nHTTP.post = (resource, options) => new HTTP(options).post(resource, options)\n\n/**\n * @param {string | Request} resource\n * @param {HTTPOptions} [options]\n */\nHTTP.get = (resource, options) => new HTTP(options).get(resource, options)\n\n/**\n * @param {string | Request} resource\n * @param {HTTPOptions} [options]\n */\nHTTP.put = (resource, options) => new HTTP(options).put(resource, options)\n\n/**\n * @param {string | Request} resource\n * @param {HTTPOptions} [options]\n */\nHTTP.delete = (resource, options) => new HTTP(options).delete(resource, options)\n\n/**\n * @param {string | Request} resource\n * @param {HTTPOptions} [options]\n */\nHTTP.options = (resource, options) => new HTTP(options).options(resource, options)\n\nmodule.exports = HTTP\n","'use strict'\n\nconst { TimeoutError, AbortError } = require('./error')\nconst { Response, Request, Headers, default: fetch } = require('../fetch')\n\n/**\n * @typedef {import('../types').FetchOptions} FetchOptions\n * @typedef {import('../types').ProgressFn} ProgressFn\n */\n\n/**\n * Fetch with progress\n *\n * @param {string | Request} url\n * @param {FetchOptions} [options]\n * @returns {Promise<ResponseWithURL>}\n */\nconst fetchWithProgress = (url, options = {}) => {\n  const request = new XMLHttpRequest()\n  request.open(options.method || 'GET', url.toString(), true)\n\n  const { timeout, headers } = options\n\n  if (timeout && timeout > 0 && timeout < Infinity) {\n    request.timeout = timeout\n  }\n\n  if (options.overrideMimeType != null) {\n    request.overrideMimeType(options.overrideMimeType)\n  }\n\n  if (headers) {\n    for (const [name, value] of new Headers(headers)) {\n      request.setRequestHeader(name, value)\n    }\n  }\n\n  if (options.signal) {\n    options.signal.onabort = () => request.abort()\n  }\n\n  if (options.onUploadProgress) {\n    request.upload.onprogress = options.onUploadProgress\n  }\n\n  // Note: Need to use `arraybuffer` here instead of `blob` because `Blob`\n  // instances coming from JSDOM are not compatible with `Response` from\n  // node-fetch (which is the setup we get when testing with jest because\n  // it uses JSDOM which does not provide a global fetch\n  // https://github.com/jsdom/jsdom/issues/1724)\n  request.responseType = 'arraybuffer'\n\n  return new Promise((resolve, reject) => {\n    /**\n     * @param {Event} event\n     */\n    const handleEvent = (event) => {\n      switch (event.type) {\n        case 'error': {\n          resolve(Response.error())\n          break\n        }\n        case 'load': {\n          resolve(\n            new ResponseWithURL(request.responseURL, request.response, {\n              status: request.status,\n              statusText: request.statusText,\n              headers: parseHeaders(request.getAllResponseHeaders())\n            })\n          )\n          break\n        }\n        case 'timeout': {\n          reject(new TimeoutError())\n          break\n        }\n        case 'abort': {\n          reject(new AbortError())\n          break\n        }\n        default: {\n          break\n        }\n      }\n    }\n    request.onerror = handleEvent\n    request.onload = handleEvent\n    request.ontimeout = handleEvent\n    request.onabort = handleEvent\n\n    request.send(/** @type {BodyInit} */(options.body))\n  })\n}\n\nconst fetchWithStreaming = fetch\n\n/**\n * @param {string | Request} url\n * @param {FetchOptions} options\n */\nconst fetchWith = (url, options = {}) =>\n  (options.onUploadProgress != null)\n    ? fetchWithProgress(url, options)\n    : fetchWithStreaming(url, options)\n\n/**\n * Parse Headers from a XMLHttpRequest\n *\n * @param {string} input\n * @returns {Headers}\n */\nconst parseHeaders = (input) => {\n  const headers = new Headers()\n  for (const line of input.trim().split(/[\\r\\n]+/)) {\n    const index = line.indexOf(': ')\n    if (index > 0) {\n      headers.set(line.slice(0, index), line.slice(index + 1))\n    }\n  }\n\n  return headers\n}\n\nclass ResponseWithURL extends Response {\n  /**\n   * @param {string} url\n   * @param {BodyInit} body\n   * @param {ResponseInit} options\n   */\n  constructor (url, body, options) {\n    super(body, options)\n    Object.defineProperty(this, 'url', { value: url })\n  }\n}\n\nmodule.exports = {\n  fetch: fetchWith,\n  Request,\n  Headers\n}\n","'use strict'\n\nclass TimeoutError extends Error {\n  constructor (message = 'Request timed out') {\n    super(message)\n    this.name = 'TimeoutError'\n  }\n}\nexports.TimeoutError = TimeoutError\n\nclass AbortError extends Error {\n  constructor (message = 'The operation was aborted.') {\n    super(message)\n    this.name = 'AbortError'\n  }\n}\nexports.AbortError = AbortError\n\nclass HTTPError extends Error {\n  /**\n   * @param {Response} response\n   */\n  constructor (response) {\n    super(response.statusText)\n    this.name = 'HTTPError'\n    this.response = response\n  }\n}\nexports.HTTPError = HTTPError\n","'use strict'\n\nconst { isElectronMain } = require('./env')\n\nif (isElectronMain) {\n  module.exports = require('electron-fetch')\n} else {\n// use window.fetch if it is available, fall back to node-fetch if not\n  module.exports = require('native-fetch')\n}\n","'use strict'\nconst isElectron = require('is-electron')\n\nconst IS_ENV_WITH_DOM = typeof window === 'object' && typeof document === 'object' && document.nodeType === 9\n// @ts-ignore\nconst IS_ELECTRON = isElectron()\nconst IS_BROWSER = IS_ENV_WITH_DOM && !IS_ELECTRON\nconst IS_ELECTRON_MAIN = IS_ELECTRON && !IS_ENV_WITH_DOM\nconst IS_ELECTRON_RENDERER = IS_ELECTRON && IS_ENV_WITH_DOM\nconst IS_NODE = typeof require === 'function' && typeof process !== 'undefined' && typeof process.release !== 'undefined' && process.release.name === 'node' && !IS_ELECTRON\n// @ts-ignore - we either ignore worker scope or dom scope\nconst IS_WEBWORKER = typeof importScripts === 'function' && typeof self !== 'undefined' && typeof WorkerGlobalScope !== 'undefined' && self instanceof WorkerGlobalScope\nconst IS_TEST = typeof process !== 'undefined' && typeof process.env !== 'undefined' && process.env.NODE_ENV === 'test'\nconst IS_REACT_NATIVE = typeof navigator !== 'undefined' && navigator.product === 'ReactNative'\n\nmodule.exports = {\n  isTest: IS_TEST,\n  isElectron: IS_ELECTRON,\n  isElectronMain: IS_ELECTRON_MAIN,\n  isElectronRenderer: IS_ELECTRON_RENDERER,\n  isNode: IS_NODE,\n  /**\n   * Detects browser main thread  **NOT** web worker or service worker\n   */\n  isBrowser: IS_BROWSER,\n  isWebWorker: IS_WEBWORKER,\n  isEnvWithDom: IS_ENV_WITH_DOM,\n  isReactNative: IS_REACT_NATIVE\n}\n","// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ())\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","// https://github.com/electron/electron/issues/2288\nfunction isElectron() {\n    // Renderer process\n    if (typeof window !== 'undefined' && typeof window.process === 'object' && window.process.type === 'renderer') {\n        return true;\n    }\n\n    // Main process\n    if (typeof process !== 'undefined' && typeof process.versions === 'object' && !!process.versions.electron) {\n        return true;\n    }\n\n    // Detect the user agent when the `nodeIntegration` option is set to true\n    if (typeof navigator === 'object' && typeof navigator.userAgent === 'string' && navigator.userAgent.indexOf('Electron') >= 0) {\n        return true;\n    }\n\n    return false;\n}\n\nmodule.exports = isElectron;\n","'use strict'\n\nif (globalThis.fetch && globalThis.Headers && globalThis.Request && globalThis.Response) {\n  module.exports = {\n    default: globalThis.fetch,\n    Headers: globalThis.Headers,\n    Request: globalThis.Request,\n    Response: globalThis.Response\n  }\n} else {\n  module.exports = {\n    default: require('node-fetch').default,\n    Headers: require('node-fetch').Headers,\n    Request: require('node-fetch').Request,\n    Response: require('node-fetch').Response\n  }\n}\n","\"use strict\";\n\n// ref: https://github.com/tc39/proposal-global\nvar getGlobal = function () {\n\t// the only reliable means to get the global object is\n\t// `Function('return this')()`\n\t// However, this causes CSP violations in Chrome apps.\n\tif (typeof self !== 'undefined') { return self; }\n\tif (typeof window !== 'undefined') { return window; }\n\tif (typeof global !== 'undefined') { return global; }\n\tthrow new Error('unable to locate global object');\n}\n\nvar global = getGlobal();\n\nmodule.exports = exports = global.fetch;\n\n// Needed for TypeScript and Webpack.\nif (global.fetch) {\n\texports.default = global.fetch.bind(global);\n}\n\nexports.Headers = global.Headers;\nexports.Request = global.Request;\nexports.Response = global.Response;","'use strict';\nconst isOptionObject = require('is-plain-obj');\n\nconst {hasOwnProperty} = Object.prototype;\nconst {propertyIsEnumerable} = Object;\nconst defineProperty = (object, name, value) => Object.defineProperty(object, name, {\n\tvalue,\n\twritable: true,\n\tenumerable: true,\n\tconfigurable: true\n});\n\nconst globalThis = this;\nconst defaultMergeOptions = {\n\tconcatArrays: false,\n\tignoreUndefined: false\n};\n\nconst getEnumerableOwnPropertyKeys = value => {\n\tconst keys = [];\n\n\tfor (const key in value) {\n\t\tif (hasOwnProperty.call(value, key)) {\n\t\t\tkeys.push(key);\n\t\t}\n\t}\n\n\t/* istanbul ignore else  */\n\tif (Object.getOwnPropertySymbols) {\n\t\tconst symbols = Object.getOwnPropertySymbols(value);\n\n\t\tfor (const symbol of symbols) {\n\t\t\tif (propertyIsEnumerable.call(value, symbol)) {\n\t\t\t\tkeys.push(symbol);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn keys;\n};\n\nfunction clone(value) {\n\tif (Array.isArray(value)) {\n\t\treturn cloneArray(value);\n\t}\n\n\tif (isOptionObject(value)) {\n\t\treturn cloneOptionObject(value);\n\t}\n\n\treturn value;\n}\n\nfunction cloneArray(array) {\n\tconst result = array.slice(0, 0);\n\n\tgetEnumerableOwnPropertyKeys(array).forEach(key => {\n\t\tdefineProperty(result, key, clone(array[key]));\n\t});\n\n\treturn result;\n}\n\nfunction cloneOptionObject(object) {\n\tconst result = Object.getPrototypeOf(object) === null ? Object.create(null) : {};\n\n\tgetEnumerableOwnPropertyKeys(object).forEach(key => {\n\t\tdefineProperty(result, key, clone(object[key]));\n\t});\n\n\treturn result;\n}\n\n/**\n * @param {*} merged already cloned\n * @param {*} source something to merge\n * @param {string[]} keys keys to merge\n * @param {Object} config Config Object\n * @returns {*} cloned Object\n */\nconst mergeKeys = (merged, source, keys, config) => {\n\tkeys.forEach(key => {\n\t\tif (typeof source[key] === 'undefined' && config.ignoreUndefined) {\n\t\t\treturn;\n\t\t}\n\n\t\t// Do not recurse into prototype chain of merged\n\t\tif (key in merged && merged[key] !== Object.getPrototypeOf(merged)) {\n\t\t\tdefineProperty(merged, key, merge(merged[key], source[key], config));\n\t\t} else {\n\t\t\tdefineProperty(merged, key, clone(source[key]));\n\t\t}\n\t});\n\n\treturn merged;\n};\n\n/**\n * @param {*} merged already cloned\n * @param {*} source something to merge\n * @param {Object} config Config Object\n * @returns {*} cloned Object\n *\n * see [Array.prototype.concat ( ...arguments )](http://www.ecma-international.org/ecma-262/6.0/#sec-array.prototype.concat)\n */\nconst concatArrays = (merged, source, config) => {\n\tlet result = merged.slice(0, 0);\n\tlet resultIndex = 0;\n\n\t[merged, source].forEach(array => {\n\t\tconst indices = [];\n\n\t\t// `result.concat(array)` with cloning\n\t\tfor (let k = 0; k < array.length; k++) {\n\t\t\tif (!hasOwnProperty.call(array, k)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tindices.push(String(k));\n\n\t\t\tif (array === merged) {\n\t\t\t\t// Already cloned\n\t\t\t\tdefineProperty(result, resultIndex++, array[k]);\n\t\t\t} else {\n\t\t\t\tdefineProperty(result, resultIndex++, clone(array[k]));\n\t\t\t}\n\t\t}\n\n\t\t// Merge non-index keys\n\t\tresult = mergeKeys(result, array, getEnumerableOwnPropertyKeys(array).filter(key => !indices.includes(key)), config);\n\t});\n\n\treturn result;\n};\n\n/**\n * @param {*} merged already cloned\n * @param {*} source something to merge\n * @param {Object} config Config Object\n * @returns {*} cloned Object\n */\nfunction merge(merged, source, config) {\n\tif (config.concatArrays && Array.isArray(merged) && Array.isArray(source)) {\n\t\treturn concatArrays(merged, source, config);\n\t}\n\n\tif (!isOptionObject(source) || !isOptionObject(merged)) {\n\t\treturn clone(source);\n\t}\n\n\treturn mergeKeys(merged, source, getEnumerableOwnPropertyKeys(source), config);\n}\n\nmodule.exports = function (...options) {\n\tconst config = merge(clone(defaultMergeOptions), (this !== globalThis && this) || {}, defaultMergeOptions);\n\tlet merged = {_: {}};\n\n\tfor (const option of options) {\n\t\tif (option === undefined) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!isOptionObject(option)) {\n\t\t\tthrow new TypeError('`' + option + '` is not an Option Object');\n\t\t}\n\n\t\tmerged = merge(merged, {_: option}, config);\n\t}\n\n\treturn merged._;\n};\n","'use strict';\n\nmodule.exports = value => {\n\tif (Object.prototype.toString.call(value) !== '[object Object]') {\n\t\treturn false;\n\t}\n\n\tconst prototype = Object.getPrototypeOf(value);\n\treturn prototype === null || prototype === Object.prototype;\n};\n","'use strict'\n\nconst {\n  URLWithLegacySupport,\n  format,\n  URLSearchParams,\n  defaultBase\n} = require('./src/url')\nconst relative = require('./src/relative')\n\nmodule.exports = {\n  URL: URLWithLegacySupport,\n  URLSearchParams,\n  format,\n  relative,\n  defaultBase\n}\n","'use strict'\n\nconst isReactNative =\n    typeof navigator !== 'undefined' &&\n    navigator.product === 'ReactNative'\n\nfunction getDefaultBase () {\n  if (isReactNative) {\n    return 'http://localhost'\n  }\n\n  return self.location.protocol + '//' + self.location.host\n}\n\nconst URL = self.URL\nconst defaultBase = getDefaultBase()\n\nclass URLWithLegacySupport {\n  constructor (url = '', base = defaultBase) {\n    this.super = new URL(url, base)\n    this.path = this.pathname + this.search\n    this.auth =\n            this.username && this.password\n              ? this.username + ':' + this.password\n              : null\n\n    this.query =\n            this.search && this.search.startsWith('?')\n              ? this.search.slice(1)\n              : null\n  }\n\n  get hash () {\n    return this.super.hash\n  }\n\n  get host () {\n    return this.super.host\n  }\n\n  get hostname () {\n    return this.super.hostname\n  }\n\n  get href () {\n    return this.super.href\n  }\n\n  get origin () {\n    return this.super.origin\n  }\n\n  get password () {\n    return this.super.password\n  }\n\n  get pathname () {\n    return this.super.pathname\n  }\n\n  get port () {\n    return this.super.port\n  }\n\n  get protocol () {\n    return this.super.protocol\n  }\n\n  get search () {\n    return this.super.search\n  }\n\n  get searchParams () {\n    return this.super.searchParams\n  }\n\n  get username () {\n    return this.super.username\n  }\n\n  set hash (hash) {\n    this.super.hash = hash\n  }\n\n  set host (host) {\n    this.super.host = host\n  }\n\n  set hostname (hostname) {\n    this.super.hostname = hostname\n  }\n\n  set href (href) {\n    this.super.href = href\n  }\n\n  set password (password) {\n    this.super.password = password\n  }\n\n  set pathname (pathname) {\n    this.super.pathname = pathname\n  }\n\n  set port (port) {\n    this.super.port = port\n  }\n\n  set protocol (protocol) {\n    this.super.protocol = protocol\n  }\n\n  set search (search) {\n    this.super.search = search\n  }\n\n  set username (username) {\n    this.super.username = username\n  }\n\n  /**\n   * @param {any} o\n   */\n  static createObjectURL (o) {\n    return URL.createObjectURL(o)\n  }\n\n  /**\n   * @param {string} o\n   */\n  static revokeObjectURL (o) {\n    URL.revokeObjectURL(o)\n  }\n\n  toJSON () {\n    return this.super.toJSON()\n  }\n\n  toString () {\n    return this.super.toString()\n  }\n\n  format () {\n    return this.toString()\n  }\n}\n\n/**\n * @param {string | import('url').UrlObject} obj\n */\nfunction format (obj) {\n  if (typeof obj === 'string') {\n    const url = new URL(obj)\n\n    return url.toString()\n  }\n\n  if (!(obj instanceof URL)) {\n    const userPass =\n            // @ts-ignore its not supported in node but we normalise\n            obj.username && obj.password\n              // @ts-ignore its not supported in node but we normalise\n              ? `${obj.username}:${obj.password}@`\n              : ''\n    const auth = obj.auth ? obj.auth + '@' : ''\n    const port = obj.port ? ':' + obj.port : ''\n    const protocol = obj.protocol ? obj.protocol + '//' : ''\n    const host = obj.host || ''\n    const hostname = obj.hostname || ''\n    const search = obj.search || (obj.query ? '?' + obj.query : '')\n    const hash = obj.hash || ''\n    const pathname = obj.pathname || ''\n    // @ts-ignore - path is not supported in node but we normalise\n    const path = obj.path || pathname + search\n\n    return `${protocol}${userPass || auth}${\n            host || hostname + port\n        }${path}${hash}`\n  }\n}\n\nmodule.exports = {\n  URLWithLegacySupport,\n  URLSearchParams: self.URLSearchParams,\n  defaultBase,\n  format\n}\n","'use strict'\n\nconst { URLWithLegacySupport, format } = require('./url')\n\n/**\n * @param {string | undefined} url\n * @param {any} [location]\n * @param {any} [protocolMap]\n * @param {any} [defaultProtocol]\n */\nmodule.exports = (url, location = {}, protocolMap = {}, defaultProtocol) => {\n  let protocol = location.protocol\n    ? location.protocol.replace(':', '')\n    : 'http'\n\n  // Check protocol map\n  protocol = (protocolMap[protocol] || defaultProtocol || protocol) + ':'\n  let urlParsed\n\n  try {\n    urlParsed = new URLWithLegacySupport(url)\n  } catch (err) {\n    urlParsed = {}\n  }\n\n  const base = Object.assign({}, location, {\n    protocol: protocol || urlParsed.protocol,\n    host: location.host || urlParsed.host\n  })\n\n  return new URLWithLegacySupport(url, format(base)).toString()\n}\n","'use strict'\n\nlet impl\n\nif (globalThis.AbortController && globalThis.AbortSignal) {\n  impl = globalThis\n} else {\n  impl = require('abort-controller')\n}\n\nmodule.exports = {\n  AbortController: impl.AbortController,\n  AbortSignal: impl.AbortSignal\n}\n","/*globals self, window */\n\"use strict\"\n\n/*eslint-disable @mysticatea/prettier */\nconst { AbortController, AbortSignal } =\n    typeof self !== \"undefined\" ? self :\n    typeof window !== \"undefined\" ? window :\n    /* otherwise */ undefined\n/*eslint-enable @mysticatea/prettier */\n\nmodule.exports = AbortController\nmodule.exports.AbortSignal = AbortSignal\nmodule.exports.default = AbortController\n","const { AbortController } = require('native-abort-controller')\n\n/**\n * Takes an array of AbortSignals and returns a single signal.\n * If any signals are aborted, the returned signal will be aborted.\n * @param {Array<AbortSignal>} signals\n * @returns {AbortSignal}\n */\nfunction anySignal (signals) {\n  const controller = new AbortController()\n\n  function onAbort () {\n    controller.abort()\n\n    for (const signal of signals) {\n      if (!signal || !signal.removeEventListener) continue\n      signal.removeEventListener('abort', onAbort)\n    }\n  }\n\n  for (const signal of signals) {\n    if (!signal || !signal.addEventListener) continue\n    if (signal.aborted) {\n      onAbort()\n      break\n    }\n    signal.addEventListener('abort', onAbort)\n  }\n\n  return controller.signal\n}\n\nmodule.exports = anySignal\nmodule.exports.anySignal = anySignal\n","/*\n * Id is an object representation of a peer Id. a peer Id is a multihash\n */\n\n'use strict'\n\nconst mh = require('multihashes')\nconst CID = require('cids')\nconst cryptoKeys = require('libp2p-crypto/src/keys')\nconst withIs = require('class-is')\nconst { PeerIdProto } = require('./proto')\nconst uint8ArrayEquals = require('uint8arrays/equals')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nclass PeerId {\n  constructor (id, privKey, pubKey) {\n    if (!(id instanceof Uint8Array)) {\n      throw new Error('invalid id provided')\n    }\n\n    if (privKey && pubKey && !uint8ArrayEquals(privKey.public.bytes, pubKey.bytes)) {\n      throw new Error('inconsistent arguments')\n    }\n\n    this._id = id\n    this._idB58String = mh.toB58String(this.id)\n    this._privKey = privKey\n    this._pubKey = pubKey\n  }\n\n  get id () {\n    return this._id\n  }\n\n  set id (val) {\n    throw new Error('Id is immutable')\n  }\n\n  get privKey () {\n    return this._privKey\n  }\n\n  set privKey (privKey) {\n    this._privKey = privKey\n  }\n\n  get pubKey () {\n    if (this._pubKey) {\n      return this._pubKey\n    }\n\n    if (this._privKey) {\n      return this._privKey.public\n    }\n\n    try {\n      const decoded = mh.decode(this.id)\n\n      if (decoded.name === 'identity') {\n        this._pubKey = cryptoKeys.unmarshalPublicKey(decoded.digest)\n      }\n    } catch (_) {\n      // Ignore, there is no valid public key\n    }\n\n    return this._pubKey\n  }\n\n  set pubKey (pubKey) {\n    this._pubKey = pubKey\n  }\n\n  // Return the protobuf version of the public key, matching go ipfs formatting\n  marshalPubKey () {\n    if (this.pubKey) {\n      return cryptoKeys.marshalPublicKey(this.pubKey)\n    }\n  }\n\n  // Return the protobuf version of the private key, matching go ipfs formatting\n  marshalPrivKey () {\n    if (this.privKey) {\n      return cryptoKeys.marshalPrivateKey(this.privKey)\n    }\n  }\n\n  // Return the protobuf version of the peer-id\n  marshal (excludePriv) {\n    return PeerIdProto.encode({\n      id: this.toBytes(),\n      pubKey: this.marshalPubKey(),\n      privKey: excludePriv ? null : this.marshalPrivKey()\n    }).finish()\n  }\n\n  toPrint () {\n    let pid = this.toB58String()\n    // All sha256 nodes start with Qm\n    // We can skip the Qm to make the peer.ID more useful\n    if (pid.startsWith('Qm')) {\n      pid = pid.slice(2)\n    }\n    let maxRunes = 6\n    if (pid.length < maxRunes) {\n      maxRunes = pid.length\n    }\n\n    return '<peer.ID ' + pid.substr(0, maxRunes) + '>'\n  }\n\n  // return the jsonified version of the key, matching the formatting\n  // of go-ipfs for its config file\n  toJSON () {\n    return {\n      id: this.toB58String(),\n      privKey: toB64Opt(this.marshalPrivKey()),\n      pubKey: toB64Opt(this.marshalPubKey())\n    }\n  }\n\n  // encode/decode functions\n  toHexString () {\n    return mh.toHexString(this.id)\n  }\n\n  toBytes () {\n    return this.id\n  }\n\n  toB58String () {\n    return this._idB58String\n  }\n\n  // return self-describing String representation\n  // in default format from RFC 0001: https://github.com/libp2p/specs/pull/209\n  toString () {\n    if (!this._idCIDString) {\n      const cid = new CID(1, 'libp2p-key', this.id, 'base32')\n\n      Object.defineProperty(this, '_idCIDString', {\n        value: cid.toBaseEncodedString('base32'),\n        enumerable: false\n      })\n    }\n    return this._idCIDString\n  }\n\n  /**\n   * Checks the equality of `this` peer against a given PeerId.\n   *\n   * @param {Uint8Array|PeerId} id\n   * @returns {boolean}\n   */\n  equals (id) {\n    if (id instanceof Uint8Array) {\n      return uint8ArrayEquals(this.id, id)\n    } else if (id.id) {\n      return uint8ArrayEquals(this.id, id.id)\n    } else {\n      throw new Error('not valid Id')\n    }\n  }\n\n  /**\n   * Checks the equality of `this` peer against a given PeerId.\n   *\n   * @deprecated Use `.equals`\n   * @param {Uint8Array|PeerId} id\n   * @returns {boolean}\n   */\n  isEqual (id) {\n    return this.equals(id)\n  }\n\n  /*\n   * Check if this PeerId instance is valid (privKey -> pubKey -> Id)\n   */\n  isValid () {\n    // TODO: needs better checking\n    return Boolean(this.privKey &&\n      this.privKey.public &&\n      this.privKey.public.bytes &&\n      this.pubKey.bytes instanceof Uint8Array &&\n        uint8ArrayEquals(this.privKey.public.bytes, this.pubKey.bytes))\n  }\n\n  /**\n   * Check if the PeerId has an inline public key.\n   *\n   * @returns {boolean}\n   */\n  hasInlinePublicKey () {\n    try {\n      const decoded = mh.decode(this.id)\n      if (decoded.name === 'identity') {\n        return true\n      }\n    } catch (_) {\n      // Ignore, there is no valid public key\n    }\n\n    return false\n  }\n}\n\nconst PeerIdWithIs = withIs(PeerId, {\n  className: 'PeerId',\n  symbolName: '@libp2p/js-peer-id/PeerId'\n})\n\nexports = module.exports = PeerIdWithIs\n\nconst computeDigest = (pubKey) => {\n  if (pubKey.bytes.length <= 42) {\n    return mh.encode(pubKey.bytes, 'identity')\n  } else {\n    return pubKey.hash()\n  }\n}\n\nconst computePeerId = async (privKey, pubKey) => {\n  const digest = await computeDigest(pubKey)\n  return new PeerIdWithIs(digest, privKey, pubKey)\n}\n\n// generation\nexports.create = async (opts) => {\n  opts = opts || {}\n  opts.bits = opts.bits || 2048\n  opts.keyType = opts.keyType || 'RSA'\n\n  const key = await cryptoKeys.generateKeyPair(opts.keyType, opts.bits)\n  return computePeerId(key, key.public)\n}\n\nexports.createFromHexString = (str) => {\n  return new PeerIdWithIs(mh.fromHexString(str))\n}\n\nexports.createFromBytes = (buf) => {\n  return new PeerIdWithIs(buf)\n}\n\nexports.createFromB58String = (str) => {\n  return exports.createFromCID(str) // B58String is CIDv0\n}\n\nconst validMulticodec = (cid) => {\n  // supported: 'libp2p-key' (CIDv1) and 'dag-pb' (CIDv0 converted to CIDv1)\n  return cid.codec === 'libp2p-key' || cid.codec === 'dag-pb'\n}\n\nexports.createFromCID = (cid) => {\n  cid = CID.isCID(cid) ? cid : new CID(cid)\n  if (!validMulticodec(cid)) throw new Error('Supplied PeerID CID has invalid multicodec: ' + cid.codec)\n  return new PeerIdWithIs(cid.multihash)\n}\n\n// Public Key input will be a Uint8Array\nexports.createFromPubKey = async (key) => {\n  let buf = key\n\n  if (typeof buf === 'string') {\n    buf = uint8ArrayFromString(key, 'base64pad')\n  }\n\n  if (!(buf instanceof Uint8Array)) {\n    throw new Error('Supplied key is neither a base64 string nor a Uint8Array')\n  }\n\n  const pubKey = await cryptoKeys.unmarshalPublicKey(buf)\n  return computePeerId(null, pubKey)\n}\n\n// Private key input will be a string\nexports.createFromPrivKey = async (key) => {\n  if (typeof key === 'string') {\n    key = uint8ArrayFromString(key, 'base64pad')\n  }\n\n  if (!(key instanceof Uint8Array)) {\n    throw new Error('Supplied key is neither a base64 string nor a Uint8Array')\n  }\n\n  const privKey = await cryptoKeys.unmarshalPrivateKey(key)\n  return computePeerId(privKey, privKey.public)\n}\n\nexports.createFromJSON = async (obj) => {\n  const id = mh.fromB58String(obj.id)\n  const rawPrivKey = obj.privKey && uint8ArrayFromString(obj.privKey, 'base64pad')\n  const rawPubKey = obj.pubKey && uint8ArrayFromString(obj.pubKey, 'base64pad')\n  const pub = rawPubKey && await cryptoKeys.unmarshalPublicKey(rawPubKey)\n\n  if (!rawPrivKey) {\n    return new PeerIdWithIs(id, null, pub)\n  }\n\n  const privKey = await cryptoKeys.unmarshalPrivateKey(rawPrivKey)\n  const privDigest = await computeDigest(privKey.public)\n\n  let pubDigest\n\n  if (pub) {\n    pubDigest = await computeDigest(pub)\n  }\n\n  if (pub && !uint8ArrayEquals(privDigest, pubDigest)) {\n    throw new Error('Public and private key do not match')\n  }\n\n  if (id && !uint8ArrayEquals(privDigest, id)) {\n    throw new Error('Id and private key do not match')\n  }\n\n  return new PeerIdWithIs(id, privKey, pub)\n}\n\nexports.createFromProtobuf = async (buf) => {\n  if (typeof buf === 'string') {\n    buf = uint8ArrayFromString(buf, 'base16')\n  }\n\n  let { id, privKey, pubKey } = PeerIdProto.decode(buf)\n\n  privKey = privKey ? await cryptoKeys.unmarshalPrivateKey(privKey) : false\n  pubKey = pubKey ? await cryptoKeys.unmarshalPublicKey(pubKey) : false\n\n  let pubDigest\n  let privDigest\n\n  if (privKey) {\n    privDigest = await computeDigest(privKey.public)\n  }\n\n  if (pubKey) {\n    pubDigest = await computeDigest(pubKey)\n  }\n\n  if (privKey) {\n    if (pubKey) {\n      if (!uint8ArrayEquals(privDigest, pubDigest)) {\n        throw new Error('Public and private key do not match')\n      }\n    }\n    return new PeerIdWithIs(privDigest, privKey, privKey.public)\n  }\n\n  // TODO: val id and pubDigest\n\n  if (pubKey) {\n    return new PeerIdWithIs(pubDigest, null, pubKey)\n  }\n\n  if (id) {\n    return new PeerIdWithIs(id)\n  }\n\n  throw new Error('Protobuf did not contain any usable key material')\n}\n\nexports.isPeerId = (peerId) => {\n  return Boolean(typeof peerId === 'object' &&\n    peerId._id &&\n    peerId._idB58String)\n}\n\nfunction toB64Opt (val) {\n  if (val) {\n    return uint8ArrayToString(val, 'base64pad')\n  }\n}\n","/**\n * Multihash implementation in JavaScript.\n */\n'use strict'\n\nconst multibase = require('multibase')\nconst varint = require('varint')\nconst { names } = require('./constants')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayConcat = require('uint8arrays/concat')\n\nconst codes = /** @type {import('./types').CodeNameMap} */({})\n\n// eslint-disable-next-line guard-for-in\nfor (const key in names) {\n  const name = /** @type {HashName} */(key)\n  codes[names[name]] = name\n}\nObject.freeze(codes)\n\n/**\n * Convert the given multihash to a hex encoded string.\n *\n * @param {Uint8Array} hash\n * @returns {string}\n */\nfunction toHexString (hash) {\n  if (!(hash instanceof Uint8Array)) {\n    throw new Error('must be passed a Uint8Array')\n  }\n\n  return uint8ArrayToString(hash, 'base16')\n}\n\n/**\n * Convert the given hex encoded string to a multihash.\n *\n * @param {string} hash\n * @returns {Uint8Array}\n */\nfunction fromHexString (hash) {\n  return uint8ArrayFromString(hash, 'base16')\n}\n\n/**\n * Convert the given multihash to a base58 encoded string.\n *\n * @param {Uint8Array} hash\n * @returns {string}\n */\nfunction toB58String (hash) {\n  if (!(hash instanceof Uint8Array)) {\n    throw new Error('must be passed a Uint8Array')\n  }\n\n  return uint8ArrayToString(multibase.encode('base58btc', hash)).slice(1)\n}\n\n/**\n * Convert the given base58 encoded string to a multihash.\n *\n * @param {string|Uint8Array} hash\n * @returns {Uint8Array}\n */\nfunction fromB58String (hash) {\n  const encoded = hash instanceof Uint8Array\n    ? uint8ArrayToString(hash)\n    : hash\n\n  return multibase.decode('z' + encoded)\n}\n\n/**\n * Decode a hash from the given multihash.\n *\n * @param {Uint8Array} bytes\n * @returns {{code: HashCode, name: HashName, length: number, digest: Uint8Array}} result\n */\nfunction decode (bytes) {\n  if (!(bytes instanceof Uint8Array)) {\n    throw new Error('multihash must be a Uint8Array')\n  }\n\n  if (bytes.length < 2) {\n    throw new Error('multihash too short. must be > 2 bytes.')\n  }\n\n  const code = /** @type {HashCode} */(varint.decode(bytes))\n  if (!isValidCode(code)) {\n    throw new Error(`multihash unknown function code: 0x${code.toString(16)}`)\n  }\n  bytes = bytes.slice(varint.decode.bytes)\n\n  const len = varint.decode(bytes)\n  if (len < 0) {\n    throw new Error(`multihash invalid length: ${len}`)\n  }\n  bytes = bytes.slice(varint.decode.bytes)\n\n  if (bytes.length !== len) {\n    throw new Error(`multihash length inconsistent: 0x${uint8ArrayToString(bytes, 'base16')}`)\n  }\n\n  return {\n    code,\n    name: codes[code],\n    length: len,\n    digest: bytes\n  }\n}\n\n/**\n * Encode a hash digest along with the specified function code.\n *\n * > **Note:** the length is derived from the length of the digest itself.\n *\n * @param {Uint8Array} digest\n * @param {HashName | HashCode} code\n * @param {number} [length]\n * @returns {Uint8Array}\n */\nfunction encode (digest, code, length) {\n  if (!digest || code === undefined) {\n    throw new Error('multihash encode requires at least two args: digest, code')\n  }\n\n  // ensure it's a hashfunction code.\n  const hashfn = coerceCode(code)\n\n  if (!(digest instanceof Uint8Array)) {\n    throw new Error('digest should be a Uint8Array')\n  }\n\n  if (length == null) {\n    length = digest.length\n  }\n\n  if (length && digest.length !== length) {\n    throw new Error('digest length should be equal to specified length.')\n  }\n\n  const hash = varint.encode(hashfn)\n  const len = varint.encode(length)\n  return uint8ArrayConcat([hash, len, digest], hash.length + len.length + digest.length)\n}\n\n/**\n * Converts a hash function name into the matching code.\n * If passed a number it will return the number if it's a valid code.\n *\n * @param {HashName | number} name\n * @returns {number}\n */\nfunction coerceCode (name) {\n  let code = name\n\n  if (typeof name === 'string') {\n    if (names[name] === undefined) {\n      throw new Error(`Unrecognized hash function named: ${name}`)\n    }\n    code = names[name]\n  }\n\n  if (typeof code !== 'number') {\n    throw new Error(`Hash function code should be a number. Got: ${code}`)\n  }\n\n  // @ts-ignore\n  if (codes[code] === undefined && !isAppCode(code)) {\n    throw new Error(`Unrecognized function code: ${code}`)\n  }\n\n  return code\n}\n\n/**\n * Checks if a code is part of the app range\n *\n * @param {number} code\n * @returns {boolean}\n */\nfunction isAppCode (code) {\n  return code > 0 && code < 0x10\n}\n\n/**\n * Checks whether a multihash code is valid.\n *\n * @param {HashCode} code\n * @returns {boolean}\n */\nfunction isValidCode (code) {\n  if (isAppCode(code)) {\n    return true\n  }\n\n  if (codes[code]) {\n    return true\n  }\n\n  return false\n}\n\n/**\n * Check if the given buffer is a valid multihash. Throws an error if it is not valid.\n *\n * @param {Uint8Array} multihash\n * @returns {void}\n * @throws {Error}\n */\nfunction validate (multihash) {\n  decode(multihash) // throws if bad.\n}\n\n/**\n * Returns a prefix from a valid multihash. Throws an error if it is not valid.\n *\n * @param {Uint8Array} multihash\n * @returns {Uint8Array}\n * @throws {Error}\n */\nfunction prefix (multihash) {\n  validate(multihash)\n\n  return multihash.subarray(0, 2)\n}\n\nmodule.exports = {\n  names,\n  codes,\n  toHexString,\n  fromHexString,\n  toB58String,\n  fromB58String,\n  decode,\n  encode,\n  coerceCode,\n  isAppCode,\n  validate,\n  prefix,\n  isValidCode\n}\n\n/**\n * @typedef { import(\"./constants\").HashCode } HashCode\n * @typedef { import(\"./constants\").HashName } HashName\n */\n","/**\n * Implementation of the [multibase](https://github.com/multiformats/multibase) specification.\n *\n */\n'use strict'\n\nconst constants = require('./constants')\nconst { encodeText, decodeText, concat } = require('./util')\n\n/** @typedef {import('./base')} Base */\n/** @typedef {import(\"./types\").BaseNameOrCode} BaseNameOrCode */\n/** @typedef {import(\"./types\").BaseCode} BaseCode */\n/** @typedef {import(\"./types\").BaseName} BaseName */\n\n/**\n * Create a new Uint8Array with the multibase varint+code.\n *\n * @param {BaseNameOrCode} nameOrCode - The multibase name or code number.\n * @param {Uint8Array} buf - The data to be prefixed with multibase.\n * @returns {Uint8Array}\n * @throws {Error} Will throw if the encoding is not supported\n */\nfunction multibase (nameOrCode, buf) {\n  if (!buf) {\n    throw new Error('requires an encoded Uint8Array')\n  }\n  const { name, codeBuf } = encoding(nameOrCode)\n  validEncode(name, buf)\n\n  return concat([codeBuf, buf], codeBuf.length + buf.length)\n}\n\n/**\n * Encode data with the specified base and add the multibase prefix.\n *\n * @param {BaseNameOrCode} nameOrCode - The multibase name or code number.\n * @param {Uint8Array} buf - The data to be encoded.\n * @returns {Uint8Array}\n * @throws {Error} Will throw if the encoding is not supported\n *\n */\nfunction encode (nameOrCode, buf) {\n  const enc = encoding(nameOrCode)\n  const data = encodeText(enc.encode(buf))\n\n  return concat([enc.codeBuf, data], enc.codeBuf.length + data.length)\n}\n\n/**\n * Takes a Uint8Array or string encoded with multibase header, decodes it and\n * returns the decoded buffer\n *\n * @param {Uint8Array|string} data\n * @returns {Uint8Array}\n * @throws {Error} Will throw if the encoding is not supported\n *\n */\nfunction decode (data) {\n  if (data instanceof Uint8Array) {\n    data = decodeText(data)\n  }\n  const prefix = data[0]\n\n  // Make all encodings case-insensitive except the ones that include upper and lower chars in the alphabet\n  if (['f', 'F', 'v', 'V', 't', 'T', 'b', 'B', 'c', 'C', 'h', 'k', 'K'].includes(prefix)) {\n    data = data.toLowerCase()\n  }\n  const enc = encoding(/** @type {BaseCode} */(data[0]))\n  return enc.decode(data.substring(1))\n}\n\n/**\n * Is the given data multibase encoded?\n *\n * @param {Uint8Array|string} data\n */\nfunction isEncoded (data) {\n  if (data instanceof Uint8Array) {\n    data = decodeText(data)\n  }\n\n  // Ensure bufOrString is a string\n  if (Object.prototype.toString.call(data) !== '[object String]') {\n    return false\n  }\n\n  try {\n    const enc = encoding(/** @type {BaseCode} */(data[0]))\n    return enc.name\n  } catch (err) {\n    return false\n  }\n}\n\n/**\n * Validate encoded data\n *\n * @param {BaseNameOrCode} name\n * @param {Uint8Array} buf\n * @returns {void}\n * @throws {Error} Will throw if the encoding is not supported\n */\nfunction validEncode (name, buf) {\n  const enc = encoding(name)\n  enc.decode(decodeText(buf))\n}\n\n/**\n * Get the encoding by name or code\n *\n * @param {BaseNameOrCode} nameOrCode\n * @returns {Base}\n * @throws {Error} Will throw if the encoding is not supported\n */\nfunction encoding (nameOrCode) {\n  if (Object.prototype.hasOwnProperty.call(constants.names, /** @type {BaseName} */(nameOrCode))) {\n    return constants.names[/** @type {BaseName} */(nameOrCode)]\n  } else if (Object.prototype.hasOwnProperty.call(constants.codes, /** @type {BaseCode} */(nameOrCode))) {\n    return constants.codes[/** @type {BaseCode} */(nameOrCode)]\n  } else {\n    throw new Error(`Unsupported encoding: ${nameOrCode}`)\n  }\n}\n\n/**\n * Get encoding from data\n *\n * @param {string|Uint8Array} data\n * @returns {Base}\n * @throws {Error} Will throw if the encoding is not supported\n */\nfunction encodingFromData (data) {\n  if (data instanceof Uint8Array) {\n    data = decodeText(data)\n  }\n\n  return encoding(/** @type {BaseCode} */(data[0]))\n}\n\nexports = module.exports = multibase\nexports.encode = encode\nexports.decode = decode\nexports.isEncoded = isEncoded\nexports.encoding = encoding\nexports.encodingFromData = encodingFromData\nconst names = Object.freeze(constants.names)\nconst codes = Object.freeze(constants.codes)\nexports.names = names\nexports.codes = codes\n","'use strict'\n\nconst baseX = require('@multiformats/base-x')\nconst Base = require('./base.js')\nconst { rfc4648 } = require('./rfc4648')\nconst { decodeText, encodeText } = require('./util')\n\n/** @typedef {import('./types').CodecFactory} CodecFactory */\n/** @typedef {import('./types').Codec} Codec */\n/** @typedef {import('./types').BaseName} BaseName */\n/** @typedef {import('./types').BaseCode} BaseCode */\n\n/** @type {CodecFactory} */\nconst identity = () => {\n  return {\n    encode: decodeText,\n    decode: encodeText\n  }\n}\n\n/**\n *\n * name, code, implementation, alphabet\n *\n * @type {Array<[BaseName, BaseCode, CodecFactory, string]>}\n */\nconst constants = [\n  ['identity', '\\x00', identity, ''],\n  ['base2', '0', rfc4648(1), '01'],\n  ['base8', '7', rfc4648(3), '01234567'],\n  ['base10', '9', baseX, '0123456789'],\n  ['base16', 'f', rfc4648(4), '0123456789abcdef'],\n  ['base16upper', 'F', rfc4648(4), '0123456789ABCDEF'],\n  ['base32hex', 'v', rfc4648(5), '0123456789abcdefghijklmnopqrstuv'],\n  ['base32hexupper', 'V', rfc4648(5), '0123456789ABCDEFGHIJKLMNOPQRSTUV'],\n  ['base32hexpad', 't', rfc4648(5), '0123456789abcdefghijklmnopqrstuv='],\n  ['base32hexpadupper', 'T', rfc4648(5), '0123456789ABCDEFGHIJKLMNOPQRSTUV='],\n  ['base32', 'b', rfc4648(5), 'abcdefghijklmnopqrstuvwxyz234567'],\n  ['base32upper', 'B', rfc4648(5), 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567'],\n  ['base32pad', 'c', rfc4648(5), 'abcdefghijklmnopqrstuvwxyz234567='],\n  ['base32padupper', 'C', rfc4648(5), 'ABCDEFGHIJKLMNOPQRSTUVWXYZ234567='],\n  ['base32z', 'h', rfc4648(5), 'ybndrfg8ejkmcpqxot1uwisza345h769'],\n  ['base36', 'k', baseX, '0123456789abcdefghijklmnopqrstuvwxyz'],\n  ['base36upper', 'K', baseX, '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'],\n  ['base58btc', 'z', baseX, '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'],\n  ['base58flickr', 'Z', baseX, '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'],\n  ['base64', 'm', rfc4648(6), 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'],\n  ['base64pad', 'M', rfc4648(6), 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='],\n  ['base64url', 'u', rfc4648(6), 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'],\n  ['base64urlpad', 'U', rfc4648(6), 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=']\n]\n\n/** @type {Record<BaseName,Base>} */\nconst names = constants.reduce((prev, tupple) => {\n  prev[tupple[0]] = new Base(tupple[0], tupple[1], tupple[2], tupple[3])\n  return prev\n}, /** @type {Record<BaseName,Base>} */({}))\n\n/** @type {Record<BaseCode,Base>} */\nconst codes = constants.reduce((prev, tupple) => {\n  prev[tupple[1]] = names[tupple[0]]\n  return prev\n}, /** @type {Record<BaseCode,Base>} */({}))\n\nmodule.exports = {\n  names,\n  codes\n}\n","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\nfunction base (ALPHABET) {\n  if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n  var BASE_MAP = new Uint8Array(256)\n  for (var j = 0; j < BASE_MAP.length; j++) {\n    BASE_MAP[j] = 255\n  }\n  for (var i = 0; i < ALPHABET.length; i++) {\n    var x = ALPHABET.charAt(i)\n    var xc = x.charCodeAt(0)\n    if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n    BASE_MAP[xc] = i\n  }\n  var BASE = ALPHABET.length\n  var LEADER = ALPHABET.charAt(0)\n  var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n  var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n  function encode (source) {\n    if (source instanceof Uint8Array) {\n    } else if (ArrayBuffer.isView(source)) {\n      source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n    } else if (Array.isArray(source)) {\n      source = Uint8Array.from(source)\n    }\n    if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') }\n    if (source.length === 0) { return '' }\n        // Skip & count leading zeroes.\n    var zeroes = 0\n    var length = 0\n    var pbegin = 0\n    var pend = source.length\n    while (pbegin !== pend && source[pbegin] === 0) {\n      pbegin++\n      zeroes++\n    }\n        // Allocate enough space in big-endian base58 representation.\n    var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n    var b58 = new Uint8Array(size)\n        // Process the bytes.\n    while (pbegin !== pend) {\n      var carry = source[pbegin]\n            // Apply \"b58 = b58 * 256 + ch\".\n      var i = 0\n      for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n        carry += (256 * b58[it1]) >>> 0\n        b58[it1] = (carry % BASE) >>> 0\n        carry = (carry / BASE) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      pbegin++\n    }\n        // Skip leading zeroes in base58 result.\n    var it2 = size - length\n    while (it2 !== size && b58[it2] === 0) {\n      it2++\n    }\n        // Translate the result into a string.\n    var str = LEADER.repeat(zeroes)\n    for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n    return str\n  }\n  function decodeUnsafe (source) {\n    if (typeof source !== 'string') { throw new TypeError('Expected String') }\n    if (source.length === 0) { return new Uint8Array() }\n    var psz = 0\n        // Skip leading spaces.\n    if (source[psz] === ' ') { return }\n        // Skip and count leading '1's.\n    var zeroes = 0\n    var length = 0\n    while (source[psz] === LEADER) {\n      zeroes++\n      psz++\n    }\n        // Allocate enough space in big-endian base256 representation.\n    var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n    var b256 = new Uint8Array(size)\n        // Process the characters.\n    while (source[psz]) {\n            // Decode character\n      var carry = BASE_MAP[source.charCodeAt(psz)]\n            // Invalid character\n      if (carry === 255) { return }\n      var i = 0\n      for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n        carry += (BASE * b256[it3]) >>> 0\n        b256[it3] = (carry % 256) >>> 0\n        carry = (carry / 256) >>> 0\n      }\n      if (carry !== 0) { throw new Error('Non-zero carry') }\n      length = i\n      psz++\n    }\n        // Skip trailing spaces.\n    if (source[psz] === ' ') { return }\n        // Skip leading zeroes in b256.\n    var it4 = size - length\n    while (it4 !== size && b256[it4] === 0) {\n      it4++\n    }\n    var vch = new Uint8Array(zeroes + (size - it4))\n    var j = zeroes\n    while (it4 !== size) {\n      vch[j++] = b256[it4++]\n    }\n    return vch\n  }\n  function decode (string) {\n    var buffer = decodeUnsafe(string)\n    if (buffer) { return buffer }\n    throw new Error('Non-base' + BASE + ' character')\n  }\n  return {\n    encode: encode,\n    decodeUnsafe: decodeUnsafe,\n    decode: decode\n  }\n}\nmodule.exports = base\n","'use strict'\n\nconst { encodeText } = require('./util')\n\n/** @typedef {import('./types').CodecFactory} CodecFactory */\n/** @typedef {import(\"./types\").BaseName} BaseName */\n/** @typedef {import(\"./types\").BaseCode} BaseCode */\n\n/**\n * Class to encode/decode in the supported Bases\n *\n */\nclass Base {\n  /**\n   * @param {BaseName} name\n   * @param {BaseCode} code\n   * @param {CodecFactory} factory\n   * @param {string} alphabet\n   */\n  constructor (name, code, factory, alphabet) {\n    this.name = name\n    this.code = code\n    this.codeBuf = encodeText(this.code)\n    this.alphabet = alphabet\n    this.codec = factory(alphabet)\n  }\n\n  /**\n   * @param {Uint8Array} buf\n   * @returns {string}\n   */\n  encode (buf) {\n    return this.codec.encode(buf)\n  }\n\n  /**\n   * @param {string} string\n   * @returns {Uint8Array}\n   */\n  decode (string) {\n    for (const char of string) {\n      if (this.alphabet && this.alphabet.indexOf(char) < 0) {\n        throw new Error(`invalid character '${char}' in '${string}'`)\n      }\n    }\n    return this.codec.decode(string)\n  }\n}\n\nmodule.exports = Base\n","'use strict'\n\nconst textDecoder = new TextDecoder()\n/**\n * @param {ArrayBufferView|ArrayBuffer} bytes\n * @returns {string}\n */\nconst decodeText = (bytes) => textDecoder.decode(bytes)\n\nconst textEncoder = new TextEncoder()\n/**\n * @param {string} text\n * @returns {Uint8Array}\n */\nconst encodeText = (text) => textEncoder.encode(text)\n\n/**\n * Returns a new Uint8Array created by concatenating the passed Arrays\n *\n * @param {Array<ArrayLike<number>>} arrs\n * @param {number} length\n * @returns {Uint8Array}\n */\nfunction concat (arrs, length) {\n  const output = new Uint8Array(length)\n  let offset = 0\n\n  for (const arr of arrs) {\n    output.set(arr, offset)\n    offset += arr.length\n  }\n\n  return output\n}\n\nmodule.exports = { decodeText, encodeText, concat }\n","'use strict'\n\n/** @typedef {import('./types').CodecFactory} CodecFactory */\n\n/**\n * @param {string} string\n * @param {string} alphabet\n * @param {number} bitsPerChar\n * @returns {Uint8Array}\n */\nconst decode = (string, alphabet, bitsPerChar) => {\n  // Build the character lookup table:\n  /** @type {Record<string, number>} */\n  const codes = {}\n  for (let i = 0; i < alphabet.length; ++i) {\n    codes[alphabet[i]] = i\n  }\n\n  // Count the padding bytes:\n  let end = string.length\n  while (string[end - 1] === '=') {\n    --end\n  }\n\n  // Allocate the output:\n  const out = new Uint8Array((end * bitsPerChar / 8) | 0)\n\n  // Parse the data:\n  let bits = 0 // Number of bits currently in the buffer\n  let buffer = 0 // Bits waiting to be written out, MSB first\n  let written = 0 // Next byte to write\n  for (let i = 0; i < end; ++i) {\n    // Read one character from the string:\n    const value = codes[string[i]]\n    if (value === undefined) {\n      throw new SyntaxError('Invalid character ' + string[i])\n    }\n\n    // Append the bits to the buffer:\n    buffer = (buffer << bitsPerChar) | value\n    bits += bitsPerChar\n\n    // Write out some bits if the buffer has a byte's worth:\n    if (bits >= 8) {\n      bits -= 8\n      out[written++] = 0xff & (buffer >> bits)\n    }\n  }\n\n  // Verify that we have received just enough bits:\n  if (bits >= bitsPerChar || 0xff & (buffer << (8 - bits))) {\n    throw new SyntaxError('Unexpected end of data')\n  }\n\n  return out\n}\n\n/**\n * @param {Uint8Array} data\n * @param {string} alphabet\n * @param {number} bitsPerChar\n * @returns {string}\n */\nconst encode = (data, alphabet, bitsPerChar) => {\n  const pad = alphabet[alphabet.length - 1] === '='\n  const mask = (1 << bitsPerChar) - 1\n  let out = ''\n\n  let bits = 0 // Number of bits currently in the buffer\n  let buffer = 0 // Bits waiting to be written out, MSB first\n  for (let i = 0; i < data.length; ++i) {\n    // Slurp data into the buffer:\n    buffer = (buffer << 8) | data[i]\n    bits += 8\n\n    // Write out as much as we can:\n    while (bits > bitsPerChar) {\n      bits -= bitsPerChar\n      out += alphabet[mask & (buffer >> bits)]\n    }\n  }\n\n  // Partial character:\n  if (bits) {\n    out += alphabet[mask & (buffer << (bitsPerChar - bits))]\n  }\n\n  // Add padding characters until we hit a byte boundary:\n  if (pad) {\n    while ((out.length * bitsPerChar) & 7) {\n      out += '='\n    }\n  }\n\n  return out\n}\n\n/**\n * RFC4648 Factory\n *\n * @param {number} bitsPerChar\n * @returns {CodecFactory}\n */\nconst rfc4648 = (bitsPerChar) => (alphabet) => {\n  return {\n    /**\n     * @param {Uint8Array} input\n     * @returns {string}\n     */\n    encode (input) {\n      return encode(input, alphabet, bitsPerChar)\n    },\n    /**\n     * @param {string} input\n     * @returns {Uint8Array}\n     */\n    decode (input) {\n      return decode(input, alphabet, bitsPerChar)\n    }\n  }\n}\n\nmodule.exports = { rfc4648 }\n","module.exports = {\n    encode: require('./encode.js')\n  , decode: require('./decode.js')\n  , encodingLength: require('./length.js')\n}\n","module.exports = encode\n\nvar MSB = 0x80\n  , REST = 0x7F\n  , MSBALL = ~REST\n  , INT = Math.pow(2, 31)\n\nfunction encode(num, out, offset) {\n  out = out || []\n  offset = offset || 0\n  var oldOffset = offset\n\n  while(num >= INT) {\n    out[offset++] = (num & 0xFF) | MSB\n    num /= 128\n  }\n  while(num & MSBALL) {\n    out[offset++] = (num & 0xFF) | MSB\n    num >>>= 7\n  }\n  out[offset] = num | 0\n  \n  encode.bytes = offset - oldOffset + 1\n  \n  return out\n}\n","module.exports = read\n\nvar MSB = 0x80\n  , REST = 0x7F\n\nfunction read(buf, offset) {\n  var res    = 0\n    , offset = offset || 0\n    , shift  = 0\n    , counter = offset\n    , b\n    , l = buf.length\n\n  do {\n    if (counter >= l) {\n      read.bytes = 0\n      throw new RangeError('Could not decode varint')\n    }\n    b = buf[counter++]\n    res += shift < 28\n      ? (b & REST) << shift\n      : (b & REST) * Math.pow(2, shift)\n    shift += 7\n  } while (b >= MSB)\n\n  read.bytes = counter - offset\n\n  return res\n}\n","\nvar N1 = Math.pow(2,  7)\nvar N2 = Math.pow(2, 14)\nvar N3 = Math.pow(2, 21)\nvar N4 = Math.pow(2, 28)\nvar N5 = Math.pow(2, 35)\nvar N6 = Math.pow(2, 42)\nvar N7 = Math.pow(2, 49)\nvar N8 = Math.pow(2, 56)\nvar N9 = Math.pow(2, 63)\n\nmodule.exports = function (value) {\n  return (\n    value < N1 ? 1\n  : value < N2 ? 2\n  : value < N3 ? 3\n  : value < N4 ? 4\n  : value < N5 ? 5\n  : value < N6 ? 6\n  : value < N7 ? 7\n  : value < N8 ? 8\n  : value < N9 ? 9\n  :              10\n  )\n}\n","/* eslint quote-props: off */\n'use strict'\n\n/**\n * Names for all available hashes\n *\n * @typedef { \"identity\" | \"sha1\" | \"sha2-256\" | \"sha2-512\" | \"sha3-512\" | \"sha3-384\" | \"sha3-256\" | \"sha3-224\" | \"shake-128\" | \"shake-256\" | \"keccak-224\" | \"keccak-256\" | \"keccak-384\" | \"keccak-512\" | \"blake3\" | \"murmur3-128\" | \"murmur3-32\" | \"dbl-sha2-256\" | \"md4\" | \"md5\" | \"bmt\" | \"sha2-256-trunc254-padded\" | \"ripemd-128\" | \"ripemd-160\" | \"ripemd-256\" | \"ripemd-320\" | \"x11\" | \"kangarootwelve\" | \"sm3-256\" | \"blake2b-8\" | \"blake2b-16\" | \"blake2b-24\" | \"blake2b-32\" | \"blake2b-40\" | \"blake2b-48\" | \"blake2b-56\" | \"blake2b-64\" | \"blake2b-72\" | \"blake2b-80\" | \"blake2b-88\" | \"blake2b-96\" | \"blake2b-104\" | \"blake2b-112\" | \"blake2b-120\" | \"blake2b-128\" | \"blake2b-136\" | \"blake2b-144\" | \"blake2b-152\" | \"blake2b-160\" | \"blake2b-168\" | \"blake2b-176\" | \"blake2b-184\" | \"blake2b-192\" | \"blake2b-200\" | \"blake2b-208\" | \"blake2b-216\" | \"blake2b-224\" | \"blake2b-232\" | \"blake2b-240\" | \"blake2b-248\" | \"blake2b-256\" | \"blake2b-264\" | \"blake2b-272\" | \"blake2b-280\" | \"blake2b-288\" | \"blake2b-296\" | \"blake2b-304\" | \"blake2b-312\" | \"blake2b-320\" | \"blake2b-328\" | \"blake2b-336\" | \"blake2b-344\" | \"blake2b-352\" | \"blake2b-360\" | \"blake2b-368\" | \"blake2b-376\" | \"blake2b-384\" | \"blake2b-392\" | \"blake2b-400\" | \"blake2b-408\" | \"blake2b-416\" | \"blake2b-424\" | \"blake2b-432\" | \"blake2b-440\" | \"blake2b-448\" | \"blake2b-456\" | \"blake2b-464\" | \"blake2b-472\" | \"blake2b-480\" | \"blake2b-488\" | \"blake2b-496\" | \"blake2b-504\" | \"blake2b-512\" | \"blake2s-8\" | \"blake2s-16\" | \"blake2s-24\" | \"blake2s-32\" | \"blake2s-40\" | \"blake2s-48\" | \"blake2s-56\" | \"blake2s-64\" | \"blake2s-72\" | \"blake2s-80\" | \"blake2s-88\" | \"blake2s-96\" | \"blake2s-104\" | \"blake2s-112\" | \"blake2s-120\" | \"blake2s-128\" | \"blake2s-136\" | \"blake2s-144\" | \"blake2s-152\" | \"blake2s-160\" | \"blake2s-168\" | \"blake2s-176\" | \"blake2s-184\" | \"blake2s-192\" | \"blake2s-200\" | \"blake2s-208\" | \"blake2s-216\" | \"blake2s-224\" | \"blake2s-232\" | \"blake2s-240\" | \"blake2s-248\" | \"blake2s-256\" | \"skein256-8\" | \"skein256-16\" | \"skein256-24\" | \"skein256-32\" | \"skein256-40\" | \"skein256-48\" | \"skein256-56\" | \"skein256-64\" | \"skein256-72\" | \"skein256-80\" | \"skein256-88\" | \"skein256-96\" | \"skein256-104\" | \"skein256-112\" | \"skein256-120\" | \"skein256-128\" | \"skein256-136\" | \"skein256-144\" | \"skein256-152\" | \"skein256-160\" | \"skein256-168\" | \"skein256-176\" | \"skein256-184\" | \"skein256-192\" | \"skein256-200\" | \"skein256-208\" | \"skein256-216\" | \"skein256-224\" | \"skein256-232\" | \"skein256-240\" | \"skein256-248\" | \"skein256-256\" | \"skein512-8\" | \"skein512-16\" | \"skein512-24\" | \"skein512-32\" | \"skein512-40\" | \"skein512-48\" | \"skein512-56\" | \"skein512-64\" | \"skein512-72\" | \"skein512-80\" | \"skein512-88\" | \"skein512-96\" | \"skein512-104\" | \"skein512-112\" | \"skein512-120\" | \"skein512-128\" | \"skein512-136\" | \"skein512-144\" | \"skein512-152\" | \"skein512-160\" | \"skein512-168\" | \"skein512-176\" | \"skein512-184\" | \"skein512-192\" | \"skein512-200\" | \"skein512-208\" | \"skein512-216\" | \"skein512-224\" | \"skein512-232\" | \"skein512-240\" | \"skein512-248\" | \"skein512-256\" | \"skein512-264\" | \"skein512-272\" | \"skein512-280\" | \"skein512-288\" | \"skein512-296\" | \"skein512-304\" | \"skein512-312\" | \"skein512-320\" | \"skein512-328\" | \"skein512-336\" | \"skein512-344\" | \"skein512-352\" | \"skein512-360\" | \"skein512-368\" | \"skein512-376\" | \"skein512-384\" | \"skein512-392\" | \"skein512-400\" | \"skein512-408\" | \"skein512-416\" | \"skein512-424\" | \"skein512-432\" | \"skein512-440\" | \"skein512-448\" | \"skein512-456\" | \"skein512-464\" | \"skein512-472\" | \"skein512-480\" | \"skein512-488\" | \"skein512-496\" | \"skein512-504\" | \"skein512-512\" | \"skein1024-8\" | \"skein1024-16\" | \"skein1024-24\" | \"skein1024-32\" | \"skein1024-40\" | \"skein1024-48\" | \"skein1024-56\" | \"skein1024-64\" | \"skein1024-72\" | \"skein1024-80\" | \"skein1024-88\" | \"skein1024-96\" | \"skein1024-104\" | \"skein1024-112\" | \"skein1024-120\" | \"skein1024-128\" | \"skein1024-136\" | \"skein1024-144\" | \"skein1024-152\" | \"skein1024-160\" | \"skein1024-168\" | \"skein1024-176\" | \"skein1024-184\" | \"skein1024-192\" | \"skein1024-200\" | \"skein1024-208\" | \"skein1024-216\" | \"skein1024-224\" | \"skein1024-232\" | \"skein1024-240\" | \"skein1024-248\" | \"skein1024-256\" | \"skein1024-264\" | \"skein1024-272\" | \"skein1024-280\" | \"skein1024-288\" | \"skein1024-296\" | \"skein1024-304\" | \"skein1024-312\" | \"skein1024-320\" | \"skein1024-328\" | \"skein1024-336\" | \"skein1024-344\" | \"skein1024-352\" | \"skein1024-360\" | \"skein1024-368\" | \"skein1024-376\" | \"skein1024-384\" | \"skein1024-392\" | \"skein1024-400\" | \"skein1024-408\" | \"skein1024-416\" | \"skein1024-424\" | \"skein1024-432\" | \"skein1024-440\" | \"skein1024-448\" | \"skein1024-456\" | \"skein1024-464\" | \"skein1024-472\" | \"skein1024-480\" | \"skein1024-488\" | \"skein1024-496\" | \"skein1024-504\" | \"skein1024-512\" | \"skein1024-520\" | \"skein1024-528\" | \"skein1024-536\" | \"skein1024-544\" | \"skein1024-552\" | \"skein1024-560\" | \"skein1024-568\" | \"skein1024-576\" | \"skein1024-584\" | \"skein1024-592\" | \"skein1024-600\" | \"skein1024-608\" | \"skein1024-616\" | \"skein1024-624\" | \"skein1024-632\" | \"skein1024-640\" | \"skein1024-648\" | \"skein1024-656\" | \"skein1024-664\" | \"skein1024-672\" | \"skein1024-680\" | \"skein1024-688\" | \"skein1024-696\" | \"skein1024-704\" | \"skein1024-712\" | \"skein1024-720\" | \"skein1024-728\" | \"skein1024-736\" | \"skein1024-744\" | \"skein1024-752\" | \"skein1024-760\" | \"skein1024-768\" | \"skein1024-776\" | \"skein1024-784\" | \"skein1024-792\" | \"skein1024-800\" | \"skein1024-808\" | \"skein1024-816\" | \"skein1024-824\" | \"skein1024-832\" | \"skein1024-840\" | \"skein1024-848\" | \"skein1024-856\" | \"skein1024-864\" | \"skein1024-872\" | \"skein1024-880\" | \"skein1024-888\" | \"skein1024-896\" | \"skein1024-904\" | \"skein1024-912\" | \"skein1024-920\" | \"skein1024-928\" | \"skein1024-936\" | \"skein1024-944\" | \"skein1024-952\" | \"skein1024-960\" | \"skein1024-968\" | \"skein1024-976\" | \"skein1024-984\" | \"skein1024-992\" | \"skein1024-1000\" | \"skein1024-1008\" | \"skein1024-1016\" | \"skein1024-1024\" | \"poseidon-bls12_381-a2-fc1\" | \"poseidon-bls12_381-a2-fc1-sc\" } HashName\n */\n/**\n * Codes for all available hashes\n *\n * @typedef { 0x00 | 0x11 | 0x12 | 0x13 | 0x14 | 0x15 | 0x16 | 0x17 | 0x18 | 0x19 | 0x1a | 0x1b | 0x1c | 0x1d | 0x1e | 0x22 | 0x23 | 0x56 | 0xd4 | 0xd5 | 0xd6 | 0x1012 | 0x1052 | 0x1053 | 0x1054 | 0x1055 | 0x1100 | 0x1d01 | 0x534d | 0xb201 | 0xb202 | 0xb203 | 0xb204 | 0xb205 | 0xb206 | 0xb207 | 0xb208 | 0xb209 | 0xb20a | 0xb20b | 0xb20c | 0xb20d | 0xb20e | 0xb20f | 0xb210 | 0xb211 | 0xb212 | 0xb213 | 0xb214 | 0xb215 | 0xb216 | 0xb217 | 0xb218 | 0xb219 | 0xb21a | 0xb21b | 0xb21c | 0xb21d | 0xb21e | 0xb21f | 0xb220 | 0xb221 | 0xb222 | 0xb223 | 0xb224 | 0xb225 | 0xb226 | 0xb227 | 0xb228 | 0xb229 | 0xb22a | 0xb22b | 0xb22c | 0xb22d | 0xb22e | 0xb22f | 0xb230 | 0xb231 | 0xb232 | 0xb233 | 0xb234 | 0xb235 | 0xb236 | 0xb237 | 0xb238 | 0xb239 | 0xb23a | 0xb23b | 0xb23c | 0xb23d | 0xb23e | 0xb23f | 0xb240 | 0xb241 | 0xb242 | 0xb243 | 0xb244 | 0xb245 | 0xb246 | 0xb247 | 0xb248 | 0xb249 | 0xb24a | 0xb24b | 0xb24c | 0xb24d | 0xb24e | 0xb24f | 0xb250 | 0xb251 | 0xb252 | 0xb253 | 0xb254 | 0xb255 | 0xb256 | 0xb257 | 0xb258 | 0xb259 | 0xb25a | 0xb25b | 0xb25c | 0xb25d | 0xb25e | 0xb25f | 0xb260 | 0xb301 | 0xb302 | 0xb303 | 0xb304 | 0xb305 | 0xb306 | 0xb307 | 0xb308 | 0xb309 | 0xb30a | 0xb30b | 0xb30c | 0xb30d | 0xb30e | 0xb30f | 0xb310 | 0xb311 | 0xb312 | 0xb313 | 0xb314 | 0xb315 | 0xb316 | 0xb317 | 0xb318 | 0xb319 | 0xb31a | 0xb31b | 0xb31c | 0xb31d | 0xb31e | 0xb31f | 0xb320 | 0xb321 | 0xb322 | 0xb323 | 0xb324 | 0xb325 | 0xb326 | 0xb327 | 0xb328 | 0xb329 | 0xb32a | 0xb32b | 0xb32c | 0xb32d | 0xb32e | 0xb32f | 0xb330 | 0xb331 | 0xb332 | 0xb333 | 0xb334 | 0xb335 | 0xb336 | 0xb337 | 0xb338 | 0xb339 | 0xb33a | 0xb33b | 0xb33c | 0xb33d | 0xb33e | 0xb33f | 0xb340 | 0xb341 | 0xb342 | 0xb343 | 0xb344 | 0xb345 | 0xb346 | 0xb347 | 0xb348 | 0xb349 | 0xb34a | 0xb34b | 0xb34c | 0xb34d | 0xb34e | 0xb34f | 0xb350 | 0xb351 | 0xb352 | 0xb353 | 0xb354 | 0xb355 | 0xb356 | 0xb357 | 0xb358 | 0xb359 | 0xb35a | 0xb35b | 0xb35c | 0xb35d | 0xb35e | 0xb35f | 0xb360 | 0xb361 | 0xb362 | 0xb363 | 0xb364 | 0xb365 | 0xb366 | 0xb367 | 0xb368 | 0xb369 | 0xb36a | 0xb36b | 0xb36c | 0xb36d | 0xb36e | 0xb36f | 0xb370 | 0xb371 | 0xb372 | 0xb373 | 0xb374 | 0xb375 | 0xb376 | 0xb377 | 0xb378 | 0xb379 | 0xb37a | 0xb37b | 0xb37c | 0xb37d | 0xb37e | 0xb37f | 0xb380 | 0xb381 | 0xb382 | 0xb383 | 0xb384 | 0xb385 | 0xb386 | 0xb387 | 0xb388 | 0xb389 | 0xb38a | 0xb38b | 0xb38c | 0xb38d | 0xb38e | 0xb38f | 0xb390 | 0xb391 | 0xb392 | 0xb393 | 0xb394 | 0xb395 | 0xb396 | 0xb397 | 0xb398 | 0xb399 | 0xb39a | 0xb39b | 0xb39c | 0xb39d | 0xb39e | 0xb39f | 0xb3a0 | 0xb3a1 | 0xb3a2 | 0xb3a3 | 0xb3a4 | 0xb3a5 | 0xb3a6 | 0xb3a7 | 0xb3a8 | 0xb3a9 | 0xb3aa | 0xb3ab | 0xb3ac | 0xb3ad | 0xb3ae | 0xb3af | 0xb3b0 | 0xb3b1 | 0xb3b2 | 0xb3b3 | 0xb3b4 | 0xb3b5 | 0xb3b6 | 0xb3b7 | 0xb3b8 | 0xb3b9 | 0xb3ba | 0xb3bb | 0xb3bc | 0xb3bd | 0xb3be | 0xb3bf | 0xb3c0 | 0xb3c1 | 0xb3c2 | 0xb3c3 | 0xb3c4 | 0xb3c5 | 0xb3c6 | 0xb3c7 | 0xb3c8 | 0xb3c9 | 0xb3ca | 0xb3cb | 0xb3cc | 0xb3cd | 0xb3ce | 0xb3cf | 0xb3d0 | 0xb3d1 | 0xb3d2 | 0xb3d3 | 0xb3d4 | 0xb3d5 | 0xb3d6 | 0xb3d7 | 0xb3d8 | 0xb3d9 | 0xb3da | 0xb3db | 0xb3dc | 0xb3dd | 0xb3de | 0xb3df | 0xb3e0 | 0xb401 | 0xb402 } HashCode\n */\n\n/**\n * @type { Record<HashName,HashCode> }\n */\nconst names = Object.freeze({\n  'identity': 0x00,\n  'sha1': 0x11,\n  'sha2-256': 0x12,\n  'sha2-512': 0x13,\n  'sha3-512': 0x14,\n  'sha3-384': 0x15,\n  'sha3-256': 0x16,\n  'sha3-224': 0x17,\n  'shake-128': 0x18,\n  'shake-256': 0x19,\n  'keccak-224': 0x1a,\n  'keccak-256': 0x1b,\n  'keccak-384': 0x1c,\n  'keccak-512': 0x1d,\n  'blake3': 0x1e,\n  'murmur3-128': 0x22,\n  'murmur3-32': 0x23,\n  'dbl-sha2-256': 0x56,\n  'md4': 0xd4,\n  'md5': 0xd5,\n  'bmt': 0xd6,\n  'sha2-256-trunc254-padded': 0x1012,\n  'ripemd-128': 0x1052,\n  'ripemd-160': 0x1053,\n  'ripemd-256': 0x1054,\n  'ripemd-320': 0x1055,\n  'x11': 0x1100,\n  'kangarootwelve': 0x1d01,\n  'sm3-256': 0x534d,\n  'blake2b-8': 0xb201,\n  'blake2b-16': 0xb202,\n  'blake2b-24': 0xb203,\n  'blake2b-32': 0xb204,\n  'blake2b-40': 0xb205,\n  'blake2b-48': 0xb206,\n  'blake2b-56': 0xb207,\n  'blake2b-64': 0xb208,\n  'blake2b-72': 0xb209,\n  'blake2b-80': 0xb20a,\n  'blake2b-88': 0xb20b,\n  'blake2b-96': 0xb20c,\n  'blake2b-104': 0xb20d,\n  'blake2b-112': 0xb20e,\n  'blake2b-120': 0xb20f,\n  'blake2b-128': 0xb210,\n  'blake2b-136': 0xb211,\n  'blake2b-144': 0xb212,\n  'blake2b-152': 0xb213,\n  'blake2b-160': 0xb214,\n  'blake2b-168': 0xb215,\n  'blake2b-176': 0xb216,\n  'blake2b-184': 0xb217,\n  'blake2b-192': 0xb218,\n  'blake2b-200': 0xb219,\n  'blake2b-208': 0xb21a,\n  'blake2b-216': 0xb21b,\n  'blake2b-224': 0xb21c,\n  'blake2b-232': 0xb21d,\n  'blake2b-240': 0xb21e,\n  'blake2b-248': 0xb21f,\n  'blake2b-256': 0xb220,\n  'blake2b-264': 0xb221,\n  'blake2b-272': 0xb222,\n  'blake2b-280': 0xb223,\n  'blake2b-288': 0xb224,\n  'blake2b-296': 0xb225,\n  'blake2b-304': 0xb226,\n  'blake2b-312': 0xb227,\n  'blake2b-320': 0xb228,\n  'blake2b-328': 0xb229,\n  'blake2b-336': 0xb22a,\n  'blake2b-344': 0xb22b,\n  'blake2b-352': 0xb22c,\n  'blake2b-360': 0xb22d,\n  'blake2b-368': 0xb22e,\n  'blake2b-376': 0xb22f,\n  'blake2b-384': 0xb230,\n  'blake2b-392': 0xb231,\n  'blake2b-400': 0xb232,\n  'blake2b-408': 0xb233,\n  'blake2b-416': 0xb234,\n  'blake2b-424': 0xb235,\n  'blake2b-432': 0xb236,\n  'blake2b-440': 0xb237,\n  'blake2b-448': 0xb238,\n  'blake2b-456': 0xb239,\n  'blake2b-464': 0xb23a,\n  'blake2b-472': 0xb23b,\n  'blake2b-480': 0xb23c,\n  'blake2b-488': 0xb23d,\n  'blake2b-496': 0xb23e,\n  'blake2b-504': 0xb23f,\n  'blake2b-512': 0xb240,\n  'blake2s-8': 0xb241,\n  'blake2s-16': 0xb242,\n  'blake2s-24': 0xb243,\n  'blake2s-32': 0xb244,\n  'blake2s-40': 0xb245,\n  'blake2s-48': 0xb246,\n  'blake2s-56': 0xb247,\n  'blake2s-64': 0xb248,\n  'blake2s-72': 0xb249,\n  'blake2s-80': 0xb24a,\n  'blake2s-88': 0xb24b,\n  'blake2s-96': 0xb24c,\n  'blake2s-104': 0xb24d,\n  'blake2s-112': 0xb24e,\n  'blake2s-120': 0xb24f,\n  'blake2s-128': 0xb250,\n  'blake2s-136': 0xb251,\n  'blake2s-144': 0xb252,\n  'blake2s-152': 0xb253,\n  'blake2s-160': 0xb254,\n  'blake2s-168': 0xb255,\n  'blake2s-176': 0xb256,\n  'blake2s-184': 0xb257,\n  'blake2s-192': 0xb258,\n  'blake2s-200': 0xb259,\n  'blake2s-208': 0xb25a,\n  'blake2s-216': 0xb25b,\n  'blake2s-224': 0xb25c,\n  'blake2s-232': 0xb25d,\n  'blake2s-240': 0xb25e,\n  'blake2s-248': 0xb25f,\n  'blake2s-256': 0xb260,\n  'skein256-8': 0xb301,\n  'skein256-16': 0xb302,\n  'skein256-24': 0xb303,\n  'skein256-32': 0xb304,\n  'skein256-40': 0xb305,\n  'skein256-48': 0xb306,\n  'skein256-56': 0xb307,\n  'skein256-64': 0xb308,\n  'skein256-72': 0xb309,\n  'skein256-80': 0xb30a,\n  'skein256-88': 0xb30b,\n  'skein256-96': 0xb30c,\n  'skein256-104': 0xb30d,\n  'skein256-112': 0xb30e,\n  'skein256-120': 0xb30f,\n  'skein256-128': 0xb310,\n  'skein256-136': 0xb311,\n  'skein256-144': 0xb312,\n  'skein256-152': 0xb313,\n  'skein256-160': 0xb314,\n  'skein256-168': 0xb315,\n  'skein256-176': 0xb316,\n  'skein256-184': 0xb317,\n  'skein256-192': 0xb318,\n  'skein256-200': 0xb319,\n  'skein256-208': 0xb31a,\n  'skein256-216': 0xb31b,\n  'skein256-224': 0xb31c,\n  'skein256-232': 0xb31d,\n  'skein256-240': 0xb31e,\n  'skein256-248': 0xb31f,\n  'skein256-256': 0xb320,\n  'skein512-8': 0xb321,\n  'skein512-16': 0xb322,\n  'skein512-24': 0xb323,\n  'skein512-32': 0xb324,\n  'skein512-40': 0xb325,\n  'skein512-48': 0xb326,\n  'skein512-56': 0xb327,\n  'skein512-64': 0xb328,\n  'skein512-72': 0xb329,\n  'skein512-80': 0xb32a,\n  'skein512-88': 0xb32b,\n  'skein512-96': 0xb32c,\n  'skein512-104': 0xb32d,\n  'skein512-112': 0xb32e,\n  'skein512-120': 0xb32f,\n  'skein512-128': 0xb330,\n  'skein512-136': 0xb331,\n  'skein512-144': 0xb332,\n  'skein512-152': 0xb333,\n  'skein512-160': 0xb334,\n  'skein512-168': 0xb335,\n  'skein512-176': 0xb336,\n  'skein512-184': 0xb337,\n  'skein512-192': 0xb338,\n  'skein512-200': 0xb339,\n  'skein512-208': 0xb33a,\n  'skein512-216': 0xb33b,\n  'skein512-224': 0xb33c,\n  'skein512-232': 0xb33d,\n  'skein512-240': 0xb33e,\n  'skein512-248': 0xb33f,\n  'skein512-256': 0xb340,\n  'skein512-264': 0xb341,\n  'skein512-272': 0xb342,\n  'skein512-280': 0xb343,\n  'skein512-288': 0xb344,\n  'skein512-296': 0xb345,\n  'skein512-304': 0xb346,\n  'skein512-312': 0xb347,\n  'skein512-320': 0xb348,\n  'skein512-328': 0xb349,\n  'skein512-336': 0xb34a,\n  'skein512-344': 0xb34b,\n  'skein512-352': 0xb34c,\n  'skein512-360': 0xb34d,\n  'skein512-368': 0xb34e,\n  'skein512-376': 0xb34f,\n  'skein512-384': 0xb350,\n  'skein512-392': 0xb351,\n  'skein512-400': 0xb352,\n  'skein512-408': 0xb353,\n  'skein512-416': 0xb354,\n  'skein512-424': 0xb355,\n  'skein512-432': 0xb356,\n  'skein512-440': 0xb357,\n  'skein512-448': 0xb358,\n  'skein512-456': 0xb359,\n  'skein512-464': 0xb35a,\n  'skein512-472': 0xb35b,\n  'skein512-480': 0xb35c,\n  'skein512-488': 0xb35d,\n  'skein512-496': 0xb35e,\n  'skein512-504': 0xb35f,\n  'skein512-512': 0xb360,\n  'skein1024-8': 0xb361,\n  'skein1024-16': 0xb362,\n  'skein1024-24': 0xb363,\n  'skein1024-32': 0xb364,\n  'skein1024-40': 0xb365,\n  'skein1024-48': 0xb366,\n  'skein1024-56': 0xb367,\n  'skein1024-64': 0xb368,\n  'skein1024-72': 0xb369,\n  'skein1024-80': 0xb36a,\n  'skein1024-88': 0xb36b,\n  'skein1024-96': 0xb36c,\n  'skein1024-104': 0xb36d,\n  'skein1024-112': 0xb36e,\n  'skein1024-120': 0xb36f,\n  'skein1024-128': 0xb370,\n  'skein1024-136': 0xb371,\n  'skein1024-144': 0xb372,\n  'skein1024-152': 0xb373,\n  'skein1024-160': 0xb374,\n  'skein1024-168': 0xb375,\n  'skein1024-176': 0xb376,\n  'skein1024-184': 0xb377,\n  'skein1024-192': 0xb378,\n  'skein1024-200': 0xb379,\n  'skein1024-208': 0xb37a,\n  'skein1024-216': 0xb37b,\n  'skein1024-224': 0xb37c,\n  'skein1024-232': 0xb37d,\n  'skein1024-240': 0xb37e,\n  'skein1024-248': 0xb37f,\n  'skein1024-256': 0xb380,\n  'skein1024-264': 0xb381,\n  'skein1024-272': 0xb382,\n  'skein1024-280': 0xb383,\n  'skein1024-288': 0xb384,\n  'skein1024-296': 0xb385,\n  'skein1024-304': 0xb386,\n  'skein1024-312': 0xb387,\n  'skein1024-320': 0xb388,\n  'skein1024-328': 0xb389,\n  'skein1024-336': 0xb38a,\n  'skein1024-344': 0xb38b,\n  'skein1024-352': 0xb38c,\n  'skein1024-360': 0xb38d,\n  'skein1024-368': 0xb38e,\n  'skein1024-376': 0xb38f,\n  'skein1024-384': 0xb390,\n  'skein1024-392': 0xb391,\n  'skein1024-400': 0xb392,\n  'skein1024-408': 0xb393,\n  'skein1024-416': 0xb394,\n  'skein1024-424': 0xb395,\n  'skein1024-432': 0xb396,\n  'skein1024-440': 0xb397,\n  'skein1024-448': 0xb398,\n  'skein1024-456': 0xb399,\n  'skein1024-464': 0xb39a,\n  'skein1024-472': 0xb39b,\n  'skein1024-480': 0xb39c,\n  'skein1024-488': 0xb39d,\n  'skein1024-496': 0xb39e,\n  'skein1024-504': 0xb39f,\n  'skein1024-512': 0xb3a0,\n  'skein1024-520': 0xb3a1,\n  'skein1024-528': 0xb3a2,\n  'skein1024-536': 0xb3a3,\n  'skein1024-544': 0xb3a4,\n  'skein1024-552': 0xb3a5,\n  'skein1024-560': 0xb3a6,\n  'skein1024-568': 0xb3a7,\n  'skein1024-576': 0xb3a8,\n  'skein1024-584': 0xb3a9,\n  'skein1024-592': 0xb3aa,\n  'skein1024-600': 0xb3ab,\n  'skein1024-608': 0xb3ac,\n  'skein1024-616': 0xb3ad,\n  'skein1024-624': 0xb3ae,\n  'skein1024-632': 0xb3af,\n  'skein1024-640': 0xb3b0,\n  'skein1024-648': 0xb3b1,\n  'skein1024-656': 0xb3b2,\n  'skein1024-664': 0xb3b3,\n  'skein1024-672': 0xb3b4,\n  'skein1024-680': 0xb3b5,\n  'skein1024-688': 0xb3b6,\n  'skein1024-696': 0xb3b7,\n  'skein1024-704': 0xb3b8,\n  'skein1024-712': 0xb3b9,\n  'skein1024-720': 0xb3ba,\n  'skein1024-728': 0xb3bb,\n  'skein1024-736': 0xb3bc,\n  'skein1024-744': 0xb3bd,\n  'skein1024-752': 0xb3be,\n  'skein1024-760': 0xb3bf,\n  'skein1024-768': 0xb3c0,\n  'skein1024-776': 0xb3c1,\n  'skein1024-784': 0xb3c2,\n  'skein1024-792': 0xb3c3,\n  'skein1024-800': 0xb3c4,\n  'skein1024-808': 0xb3c5,\n  'skein1024-816': 0xb3c6,\n  'skein1024-824': 0xb3c7,\n  'skein1024-832': 0xb3c8,\n  'skein1024-840': 0xb3c9,\n  'skein1024-848': 0xb3ca,\n  'skein1024-856': 0xb3cb,\n  'skein1024-864': 0xb3cc,\n  'skein1024-872': 0xb3cd,\n  'skein1024-880': 0xb3ce,\n  'skein1024-888': 0xb3cf,\n  'skein1024-896': 0xb3d0,\n  'skein1024-904': 0xb3d1,\n  'skein1024-912': 0xb3d2,\n  'skein1024-920': 0xb3d3,\n  'skein1024-928': 0xb3d4,\n  'skein1024-936': 0xb3d5,\n  'skein1024-944': 0xb3d6,\n  'skein1024-952': 0xb3d7,\n  'skein1024-960': 0xb3d8,\n  'skein1024-968': 0xb3d9,\n  'skein1024-976': 0xb3da,\n  'skein1024-984': 0xb3db,\n  'skein1024-992': 0xb3dc,\n  'skein1024-1000': 0xb3dd,\n  'skein1024-1008': 0xb3de,\n  'skein1024-1016': 0xb3df,\n  'skein1024-1024': 0xb3e0,\n  'poseidon-bls12_381-a2-fc1': 0xb401,\n  'poseidon-bls12_381-a2-fc1-sc': 0xb402\n})\n\nmodule.exports = { names }\n","'use strict'\n\nconst { encoding: getCodec } = require('multibase')\nconst utf8Decoder = new TextDecoder('utf8')\n\n/**\n * @typedef {import('multibase/src/types').BaseName | 'utf8' | 'utf-8' | 'ascii' | undefined} SupportedEncodings\n */\n\n/**\n * Turns a Uint8Array of bytes into a string with each\n * character being the char code of the corresponding byte\n *\n * @param {Uint8Array} array - The array to turn into a string\n */\nfunction uint8ArrayToAsciiString (array) {\n  let string = ''\n\n  for (let i = 0; i < array.length; i++) {\n    string += String.fromCharCode(array[i])\n  }\n  return string\n}\n\n/**\n * Turns a `Uint8Array` into a string.\n *\n * Supports `utf8`, `utf-8` and any encoding supported by the multibase module.\n *\n * Also `ascii` which is similar to node's 'binary' encoding.\n *\n * @param {Uint8Array} array - The array to turn into a string\n * @param {SupportedEncodings} [encoding=utf8] - The encoding to use\n * @returns {string}\n */\nfunction toString (array, encoding = 'utf8') {\n  if (encoding === 'utf8' || encoding === 'utf-8') {\n    return utf8Decoder.decode(array)\n  }\n\n  if (encoding === 'ascii') {\n    return uint8ArrayToAsciiString(array)\n  }\n\n  return getCodec(encoding).encode(array)\n}\n\nmodule.exports = toString\n","'use strict'\n\nconst { encoding: getCodec } = require('multibase')\nconst utf8Encoder = new TextEncoder()\n\n/**\n * @typedef {import('multibase/src/types').BaseName | 'utf8' | 'utf-8' | 'ascii' | undefined} SupportedEncodings\n */\n\n/**\n * Interprets each character in a string as a byte and\n * returns a Uint8Array of those bytes.\n *\n * @param {string} string - The string to turn into an array\n */\nfunction asciiStringToUint8Array (string) {\n  const array = new Uint8Array(string.length)\n\n  for (let i = 0; i < string.length; i++) {\n    array[i] = string.charCodeAt(i)\n  }\n\n  return array\n}\n\n/**\n * Create a `Uint8Array` from the passed string\n *\n * Supports `utf8`, `utf-8` and any encoding supported by the multibase module.\n *\n * Also `ascii` which is similar to node's 'binary' encoding.\n *\n * @param {string} string\n * @param {SupportedEncodings} [encoding=utf8] - utf8, base16, base64, base64urlpad, etc\n * @returns {Uint8Array}\n */\nfunction fromString (string, encoding = 'utf8') {\n  if (encoding === 'utf8' || encoding === 'utf-8') {\n    return utf8Encoder.encode(string)\n  }\n\n  if (encoding === 'ascii') {\n    return asciiStringToUint8Array(string)\n  }\n\n  return getCodec(encoding).decode(string)\n}\n\nmodule.exports = fromString\n","'use strict'\n\n/**\n * Returns a new Uint8Array created by concatenating the passed ArrayLikes\n *\n * @param {Array<ArrayLike<number>>} arrays\n * @param {number} [length]\n */\nfunction concat (arrays, length) {\n  if (!length) {\n    length = arrays.reduce((acc, curr) => acc + curr.length, 0)\n  }\n\n  const output = new Uint8Array(length)\n  let offset = 0\n\n  for (const arr of arrays) {\n    output.set(arr, offset)\n    offset += arr.length\n  }\n\n  return output\n}\n\nmodule.exports = concat\n","'use strict'\n\nconst mh = require('multihashes')\nconst multibase = require('multibase')\nconst multicodec = require('multicodec')\nconst CIDUtil = require('./cid-util')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\nconst codecs = multicodec.nameToCode\nconst codecInts = /** @type {CodecName[]} */(Object.keys(codecs)).reduce((p, name) => {\n  p[codecs[name]] = name\n  return p\n}, /** @type {Record<CodecCode, CodecName>} */({}))\n\nconst symbol = Symbol.for('@ipld/js-cid/CID')\n\n/**\n * @typedef {Object} SerializedCID\n * @property {string} codec\n * @property {number} version\n * @property {Uint8Array} hash\n */\n/**\n * @typedef {0|1} CIDVersion\n * @typedef {import('multibase').BaseNameOrCode} BaseNameOrCode\n * @typedef {import('multicodec').CodecName} CodecName\n * @typedef {import('multicodec').CodecCode} CodecCode\n */\n\n/**\n * Class representing a CID `<mbase><version><mcodec><mhash>`\n * , as defined in [ipld/cid](https://github.com/multiformats/cid).\n *\n * @class CID\n */\nclass CID {\n  /**\n   * Create a new CID.\n   *\n   * The algorithm for argument input is roughly:\n   * ```\n   * if (cid)\n   *   -> create a copy\n   * else if (str)\n   *   if (1st char is on multibase table) -> CID String\n   *   else -> bs58 encoded multihash\n   * else if (Uint8Array)\n   *   if (1st byte is 0 or 1) -> CID\n   *   else -> multihash\n   * else if (Number)\n   *   -> construct CID by parts\n   * ```\n   *\n   * @param {CIDVersion | string | Uint8Array | CID} version\n   * @param {string|number} [codec]\n   * @param {Uint8Array} [multihash]\n   * @param {string} [multibaseName]\n   *\n   * @example\n   * new CID(<version>, <codec>, <multihash>, <multibaseName>)\n   * new CID(<cidStr>)\n   * new CID(<cid.bytes>)\n   * new CID(<multihash>)\n   * new CID(<bs58 encoded multihash>)\n   * new CID(<cid>)\n   */\n  constructor (version, codec, multihash, multibaseName) {\n    // We have below three blank field accessors only because\n    // otherwise TS will not pick them up if done after assignemnts\n\n    /**\n     * The version of the CID.\n     *\n     * @type {CIDVersion}\n     */\n    // eslint-disable-next-line no-unused-expressions\n    this.version\n\n    /**\n     * The codec of the CID.\n     *\n     * @deprecated\n     * @type {CodecName}\n     */\n    // eslint-disable-next-line no-unused-expressions\n    this.codec\n\n    /**\n     * The multihash of the CID.\n     *\n     * @type {Uint8Array}\n     */\n    // eslint-disable-next-line no-unused-expressions\n    this.multihash\n\n    Object.defineProperty(this, symbol, { value: true })\n    if (CID.isCID(version)) {\n      // version is an exising CID instance\n      const cid = /** @type {CID} */(version)\n      this.version = cid.version\n      this.codec = cid.codec\n      this.multihash = cid.multihash\n      // Default guard for when a CID < 0.7 is passed with no multibaseName\n      // @ts-ignore\n      this.multibaseName = cid.multibaseName || (cid.version === 0 ? 'base58btc' : 'base32')\n      return\n    }\n\n    if (typeof version === 'string') {\n      // e.g. 'base32' or false\n      const baseName = multibase.isEncoded(version)\n      if (baseName) {\n        // version is a CID String encoded with multibase, so v1\n        const cid = multibase.decode(version)\n        this.version = /** @type {CIDVersion} */(parseInt(cid[0].toString(), 16))\n        this.codec = multicodec.getCodec(cid.slice(1))\n        this.multihash = multicodec.rmPrefix(cid.slice(1))\n        this.multibaseName = baseName\n      } else {\n        // version is a base58btc string multihash, so v0\n        this.version = 0\n        this.codec = 'dag-pb'\n        this.multihash = mh.fromB58String(version)\n        this.multibaseName = 'base58btc'\n      }\n      CID.validateCID(this)\n      Object.defineProperty(this, 'string', { value: version })\n      return\n    }\n\n    if (version instanceof Uint8Array) {\n      const v = parseInt(version[0].toString(), 16)\n      if (v === 1) {\n        // version is a CID Uint8Array\n        const cid = version\n        this.version = v\n        this.codec = multicodec.getCodec(cid.slice(1))\n        this.multihash = multicodec.rmPrefix(cid.slice(1))\n        this.multibaseName = 'base32'\n      } else {\n        // version is a raw multihash Uint8Array, so v0\n        this.version = 0\n        this.codec = 'dag-pb'\n        this.multihash = version\n        this.multibaseName = 'base58btc'\n      }\n      CID.validateCID(this)\n      return\n    }\n\n    // otherwise, assemble the CID from the parameters\n\n    this.version = version\n\n    if (typeof codec === 'number') {\n      // @ts-ignore\n      codec = codecInts[codec]\n    }\n\n    this.codec = /** @type {CodecName} */ (codec)\n\n    this.multihash = /** @type {Uint8Array} */ (multihash)\n\n    /**\n     * Multibase name as string.\n     *\n     * @deprecated\n     * @type {string}\n     */\n    this.multibaseName = multibaseName || (version === 0 ? 'base58btc' : 'base32')\n\n    CID.validateCID(this)\n  }\n\n  /**\n   * The CID as a `Uint8Array`\n   *\n   * @returns {Uint8Array}\n   *\n   */\n  get bytes () {\n    // @ts-ignore\n    let bytes = this._bytes\n\n    if (!bytes) {\n      if (this.version === 0) {\n        bytes = this.multihash\n      } else if (this.version === 1) {\n        const codec = multicodec.getCodeVarint(this.codec)\n        bytes = uint8ArrayConcat([\n          [1], codec, this.multihash\n        ], 1 + codec.byteLength + this.multihash.byteLength)\n      } else {\n        throw new Error('unsupported version')\n      }\n\n      // Cache this Uint8Array so it doesn't have to be recreated\n      Object.defineProperty(this, '_bytes', { value: bytes })\n    }\n\n    return bytes\n  }\n\n  /**\n   * The prefix of the CID.\n   *\n   * @returns {Uint8Array}\n   */\n  get prefix () {\n    const codec = multicodec.getCodeVarint(this.codec)\n    const multihash = mh.prefix(this.multihash)\n    const prefix = uint8ArrayConcat([\n      [this.version], codec, multihash\n    ], 1 + codec.byteLength + multihash.byteLength)\n\n    return prefix\n  }\n\n  /**\n   * The codec of the CID in its number form.\n   *\n   * @returns {CodecCode}\n   */\n  get code () {\n    return codecs[this.codec]\n  }\n\n  /**\n   * Convert to a CID of version `0`.\n   *\n   * @returns {CID}\n   */\n  toV0 () {\n    if (this.codec !== 'dag-pb') {\n      throw new Error('Cannot convert a non dag-pb CID to CIDv0')\n    }\n\n    const { name, length } = mh.decode(this.multihash)\n\n    if (name !== 'sha2-256') {\n      throw new Error('Cannot convert non sha2-256 multihash CID to CIDv0')\n    }\n\n    if (length !== 32) {\n      throw new Error('Cannot convert non 32 byte multihash CID to CIDv0')\n    }\n\n    return new CID(0, this.codec, this.multihash)\n  }\n\n  /**\n   * Convert to a CID of version `1`.\n   *\n   * @returns {CID}\n   */\n  toV1 () {\n    return new CID(1, this.codec, this.multihash)\n  }\n\n  /**\n   * Encode the CID into a string.\n   *\n   * @param {BaseNameOrCode} [base=this.multibaseName] - Base encoding to use.\n   * @returns {string}\n   */\n  toBaseEncodedString (base = this.multibaseName) {\n    // @ts-ignore non enumerable cache property\n    if (this.string && this.string.length !== 0 && base === this.multibaseName) {\n      // @ts-ignore non enumerable cache property\n      return this.string\n    }\n    let str\n    if (this.version === 0) {\n      if (base !== 'base58btc') {\n        throw new Error('not supported with CIDv0, to support different bases, please migrate the instance do CIDv1, you can do that through cid.toV1()')\n      }\n      str = mh.toB58String(this.multihash)\n    } else if (this.version === 1) {\n      str = uint8ArrayToString(multibase.encode(base, this.bytes))\n    } else {\n      throw new Error('unsupported version')\n    }\n    if (base === this.multibaseName) {\n      // cache the string value\n      Object.defineProperty(this, 'string', { value: str })\n    }\n    return str\n  }\n\n  /**\n   * CID(QmdfTbBqBPQ7VNxZEYEj14VmRuZBkqFbiwReogJgS1zR1n)\n   *\n   * @returns {string}\n   */\n  [Symbol.for('nodejs.util.inspect.custom')] () {\n    return 'CID(' + this.toString() + ')'\n  }\n\n  /**\n   * Encode the CID into a string.\n   *\n   * @param {BaseNameOrCode} [base=this.multibaseName] - Base encoding to use.\n   * @returns {string}\n   */\n  toString (base) {\n    return this.toBaseEncodedString(base)\n  }\n\n  /**\n   * Serialize to a plain object.\n   *\n   * @returns {SerializedCID}\n   */\n  toJSON () {\n    return {\n      codec: this.codec,\n      version: this.version,\n      hash: this.multihash\n    }\n  }\n\n  /**\n   * Compare equality with another CID.\n   *\n   * @param {CID} other\n   * @returns {boolean}\n   */\n  equals (other) {\n    return this.codec === other.codec &&\n      this.version === other.version &&\n      uint8ArrayEquals(this.multihash, other.multihash)\n  }\n\n  /**\n   * Test if the given input is a valid CID object.\n   * Throws if it is not.\n   *\n   * @param {any} other - The other CID.\n   * @returns {void}\n   */\n  static validateCID (other) {\n    const errorMsg = CIDUtil.checkCIDComponents(other)\n    if (errorMsg) {\n      throw new Error(errorMsg)\n    }\n  }\n\n  /**\n   * Check if object is a CID instance\n   *\n   * @param {any} value\n   * @returns {value is CID}\n   */\n  static isCID (value) {\n    return value instanceof CID || Boolean(value && value[symbol])\n  }\n}\n\nCID.codecs = codecs\n\nmodule.exports = CID\n","/**\n * Implementation of the multicodec specification.\n *\n * @module multicodec\n * @example\n * const multicodec = require('multicodec')\n *\n * const prefixedProtobuf = multicodec.addPrefix('protobuf', protobufBuffer)\n * // prefixedProtobuf 0x50...\n *\n */\n'use strict'\n\n/** @typedef {import('./generated-types').CodecName} CodecName */\n/** @typedef {import('./generated-types').CodecCode} CodecCode */\n\nconst varint = require('varint')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst util = require('./util')\nconst { nameToVarint, constantToCode, nameToCode, codeToName } = require('./maps')\n\n/**\n * Prefix a buffer with a multicodec-packed.\n *\n * @param {CodecName|Uint8Array} multicodecStrOrCode\n * @param {Uint8Array} data\n * @returns {Uint8Array}\n */\nfunction addPrefix (multicodecStrOrCode, data) {\n  let prefix\n\n  if (multicodecStrOrCode instanceof Uint8Array) {\n    prefix = util.varintUint8ArrayEncode(multicodecStrOrCode)\n  } else {\n    if (nameToVarint[multicodecStrOrCode]) {\n      prefix = nameToVarint[multicodecStrOrCode]\n    } else {\n      throw new Error('multicodec not recognized')\n    }\n  }\n\n  return uint8ArrayConcat([prefix, data], prefix.length + data.length)\n}\n\n/**\n * Decapsulate the multicodec-packed prefix from the data.\n *\n * @param {Uint8Array} data\n * @returns {Uint8Array}\n */\nfunction rmPrefix (data) {\n  varint.decode(/** @type {Buffer} */(data))\n  return data.slice(varint.decode.bytes)\n}\n\n/**\n * Get the codec name of the prefixed data.\n *\n * @param {Uint8Array} prefixedData\n * @returns {CodecName}\n */\nfunction getNameFromData (prefixedData) {\n  const code = /** @type {CodecCode} */(varint.decode(/** @type {Buffer} */(prefixedData)))\n  const name = codeToName[code]\n  if (name === undefined) {\n    throw new Error(`Code \"${code}\" not found`)\n  }\n  return name\n}\n\n/**\n * Get the codec name from a code.\n *\n * @param {CodecCode} codec\n * @returns {CodecName}\n */\nfunction getNameFromCode (codec) {\n  return codeToName[codec]\n}\n\n/**\n * Get the code of the codec\n *\n * @param {CodecName} name\n * @returns {CodecCode}\n */\nfunction getCodeFromName (name) {\n  const code = nameToCode[name]\n  if (code === undefined) {\n    throw new Error(`Codec \"${name}\" not found`)\n  }\n  return code\n}\n\n/**\n * Get the code of the prefixed data.\n *\n * @param {Uint8Array} prefixedData\n * @returns {CodecCode}\n */\nfunction getCodeFromData (prefixedData) {\n  return /** @type {CodecCode} */(varint.decode(/** @type {Buffer} */(prefixedData)))\n}\n\n/**\n * Get the code as varint of a codec name.\n *\n * @param {CodecName} name\n * @returns {Uint8Array}\n */\nfunction getVarintFromName (name) {\n  const code = nameToVarint[name]\n  if (code === undefined) {\n    throw new Error(`Codec \"${name}\" not found`)\n  }\n  return code\n}\n\n/**\n * Get the varint of a code.\n *\n * @param {CodecCode} code\n * @returns {Uint8Array}\n */\nfunction getVarintFromCode (code) {\n  return util.varintEncode(code)\n}\n\n/**\n * Get the codec name of the prefixed data.\n *\n * @deprecated use getNameFromData instead.\n * @param {Uint8Array} prefixedData\n * @returns {CodecName}\n */\nfunction getCodec (prefixedData) {\n  return getNameFromData(prefixedData)\n}\n\n/**\n * Get the codec name from a code.\n *\n * @deprecated use getNameFromCode instead.\n * @param {CodecCode} codec\n * @returns {CodecName}\n */\nfunction getName (codec) {\n  return getNameFromCode(codec)\n}\n\n/**\n * Get the code of the codec\n *\n * @deprecated use getCodeFromName instead.\n * @param {CodecName} name\n * @returns {CodecCode}\n */\nfunction getNumber (name) {\n  return getCodeFromName(name)\n}\n\n/**\n * Get the code of the prefixed data.\n *\n * @deprecated use getCodeFromData instead.\n * @param {Uint8Array} prefixedData\n * @returns {CodecCode}\n */\nfunction getCode (prefixedData) {\n  return getCodeFromData(prefixedData)\n}\n\n/**\n * Get the code as varint of a codec name.\n *\n * @deprecated use getVarintFromName instead.\n * @param {CodecName} name\n * @returns {Uint8Array}\n */\nfunction getCodeVarint (name) {\n  return getVarintFromName(name)\n}\n\n/**\n * Get the varint of a code.\n *\n * @deprecated use getVarintFromCode instead.\n * @param {CodecCode} code\n * @returns {Array.<number>}\n */\nfunction getVarint (code) {\n  return Array.from(getVarintFromCode(code))\n}\n\nmodule.exports = {\n  addPrefix,\n  rmPrefix,\n  getNameFromData,\n  getNameFromCode,\n  getCodeFromName,\n  getCodeFromData,\n  getVarintFromName,\n  getVarintFromCode,\n  // Deprecated\n  getCodec,\n  getName,\n  getNumber,\n  getCode,\n  getCodeVarint,\n  getVarint,\n  // Make the constants top-level constants\n  ...constantToCode,\n  // Export the maps\n  nameToVarint,\n  nameToCode,\n  codeToName\n}\n","module.exports = {\n    encode: require('./encode.js')\n  , decode: require('./decode.js')\n  , encodingLength: require('./length.js')\n}\n","module.exports = encode\n\nvar MSB = 0x80\n  , REST = 0x7F\n  , MSBALL = ~REST\n  , INT = Math.pow(2, 31)\n\nfunction encode(num, out, offset) {\n  out = out || []\n  offset = offset || 0\n  var oldOffset = offset\n\n  while(num >= INT) {\n    out[offset++] = (num & 0xFF) | MSB\n    num /= 128\n  }\n  while(num & MSBALL) {\n    out[offset++] = (num & 0xFF) | MSB\n    num >>>= 7\n  }\n  out[offset] = num | 0\n  \n  encode.bytes = offset - oldOffset + 1\n  \n  return out\n}\n","module.exports = read\n\nvar MSB = 0x80\n  , REST = 0x7F\n\nfunction read(buf, offset) {\n  var res    = 0\n    , offset = offset || 0\n    , shift  = 0\n    , counter = offset\n    , b\n    , l = buf.length\n\n  do {\n    if (counter >= l) {\n      read.bytes = 0\n      throw new RangeError('Could not decode varint')\n    }\n    b = buf[counter++]\n    res += shift < 28\n      ? (b & REST) << shift\n      : (b & REST) * Math.pow(2, shift)\n    shift += 7\n  } while (b >= MSB)\n\n  read.bytes = counter - offset\n\n  return res\n}\n","\nvar N1 = Math.pow(2,  7)\nvar N2 = Math.pow(2, 14)\nvar N3 = Math.pow(2, 21)\nvar N4 = Math.pow(2, 28)\nvar N5 = Math.pow(2, 35)\nvar N6 = Math.pow(2, 42)\nvar N7 = Math.pow(2, 49)\nvar N8 = Math.pow(2, 56)\nvar N9 = Math.pow(2, 63)\n\nmodule.exports = function (value) {\n  return (\n    value < N1 ? 1\n  : value < N2 ? 2\n  : value < N3 ? 3\n  : value < N4 ? 4\n  : value < N5 ? 5\n  : value < N6 ? 6\n  : value < N7 ? 7\n  : value < N8 ? 8\n  : value < N9 ? 9\n  :              10\n  )\n}\n","'use strict'\n\nconst varint = require('varint')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\nmodule.exports = {\n  numberToUint8Array,\n  uint8ArrayToNumber,\n  varintUint8ArrayEncode,\n  varintEncode\n}\n\n/**\n * @param {Uint8Array} buf\n */\nfunction uint8ArrayToNumber (buf) {\n  return parseInt(uint8ArrayToString(buf, 'base16'), 16)\n}\n\n/**\n * @param {number} num\n */\nfunction numberToUint8Array (num) {\n  let hexString = num.toString(16)\n  if (hexString.length % 2 === 1) {\n    hexString = '0' + hexString\n  }\n  return uint8ArrayFromString(hexString, 'base16')\n}\n\n/**\n * @param {Uint8Array} input\n */\nfunction varintUint8ArrayEncode (input) {\n  return Uint8Array.from(varint.encode(uint8ArrayToNumber(input)))\n}\n\n/**\n * @param {number} num\n */\nfunction varintEncode (num) {\n  return Uint8Array.from(varint.encode(num))\n}\n","'use strict'\n\n/** @typedef {import('./generated-types').ConstantCodeMap} ConstantCodeMap */\n/** @typedef {import('./generated-types').NameUint8ArrayMap} NameUint8ArrayMap */\n/** @typedef {import('./generated-types').CodeNameMap} CodeNameMap */\n/** @typedef {import('./generated-types').CodecName} CodecName */\n/** @typedef {import('./generated-types').CodecConstant} CodecConstant */\n\nconst { baseTable } = require('./generated-table')\nconst varintEncode = require('./util').varintEncode\n\nconst nameToVarint = /** @type {NameUint8ArrayMap} */ ({})\nconst constantToCode = /** @type {ConstantCodeMap} */({})\nconst codeToName = /** @type {CodeNameMap} */({})\n\n// eslint-disable-next-line guard-for-in\nfor (const name in baseTable) {\n  const codecName = /** @type {CodecName} */(name)\n  const code = baseTable[codecName]\n  nameToVarint[codecName] = varintEncode(code)\n\n  const constant = /** @type {CodecConstant} */(codecName.toUpperCase().replace(/-/g, '_'))\n  constantToCode[constant] = code\n\n  if (!codeToName[code]) {\n    codeToName[code] = codecName\n  }\n}\n\nObject.freeze(nameToVarint)\nObject.freeze(constantToCode)\nObject.freeze(codeToName)\nconst nameToCode = Object.freeze(baseTable)\nmodule.exports = {\n  nameToVarint,\n  constantToCode,\n  nameToCode,\n  codeToName\n}\n","// DO NOT CHANGE THIS FILE. IT IS GENERATED BY tools/update-table.js\n/* eslint quote-props: off */\n'use strict'\n\n/**\n * @type {import('./generated-types').NameCodeMap}\n */\nconst baseTable = Object.freeze({\n  'identity': 0x00,\n  'cidv1': 0x01,\n  'cidv2': 0x02,\n  'cidv3': 0x03,\n  'ip4': 0x04,\n  'tcp': 0x06,\n  'sha1': 0x11,\n  'sha2-256': 0x12,\n  'sha2-512': 0x13,\n  'sha3-512': 0x14,\n  'sha3-384': 0x15,\n  'sha3-256': 0x16,\n  'sha3-224': 0x17,\n  'shake-128': 0x18,\n  'shake-256': 0x19,\n  'keccak-224': 0x1a,\n  'keccak-256': 0x1b,\n  'keccak-384': 0x1c,\n  'keccak-512': 0x1d,\n  'blake3': 0x1e,\n  'dccp': 0x21,\n  'murmur3-128': 0x22,\n  'murmur3-32': 0x23,\n  'ip6': 0x29,\n  'ip6zone': 0x2a,\n  'path': 0x2f,\n  'multicodec': 0x30,\n  'multihash': 0x31,\n  'multiaddr': 0x32,\n  'multibase': 0x33,\n  'dns': 0x35,\n  'dns4': 0x36,\n  'dns6': 0x37,\n  'dnsaddr': 0x38,\n  'protobuf': 0x50,\n  'cbor': 0x51,\n  'raw': 0x55,\n  'dbl-sha2-256': 0x56,\n  'rlp': 0x60,\n  'bencode': 0x63,\n  'dag-pb': 0x70,\n  'dag-cbor': 0x71,\n  'libp2p-key': 0x72,\n  'git-raw': 0x78,\n  'torrent-info': 0x7b,\n  'torrent-file': 0x7c,\n  'leofcoin-block': 0x81,\n  'leofcoin-tx': 0x82,\n  'leofcoin-pr': 0x83,\n  'sctp': 0x84,\n  'dag-jose': 0x85,\n  'dag-cose': 0x86,\n  'eth-block': 0x90,\n  'eth-block-list': 0x91,\n  'eth-tx-trie': 0x92,\n  'eth-tx': 0x93,\n  'eth-tx-receipt-trie': 0x94,\n  'eth-tx-receipt': 0x95,\n  'eth-state-trie': 0x96,\n  'eth-account-snapshot': 0x97,\n  'eth-storage-trie': 0x98,\n  'bitcoin-block': 0xb0,\n  'bitcoin-tx': 0xb1,\n  'bitcoin-witness-commitment': 0xb2,\n  'zcash-block': 0xc0,\n  'zcash-tx': 0xc1,\n  'docid': 0xce,\n  'stellar-block': 0xd0,\n  'stellar-tx': 0xd1,\n  'md4': 0xd4,\n  'md5': 0xd5,\n  'bmt': 0xd6,\n  'decred-block': 0xe0,\n  'decred-tx': 0xe1,\n  'ipld-ns': 0xe2,\n  'ipfs-ns': 0xe3,\n  'swarm-ns': 0xe4,\n  'ipns-ns': 0xe5,\n  'zeronet': 0xe6,\n  'secp256k1-pub': 0xe7,\n  'bls12_381-g1-pub': 0xea,\n  'bls12_381-g2-pub': 0xeb,\n  'x25519-pub': 0xec,\n  'ed25519-pub': 0xed,\n  'bls12_381-g1g2-pub': 0xee,\n  'dash-block': 0xf0,\n  'dash-tx': 0xf1,\n  'swarm-manifest': 0xfa,\n  'swarm-feed': 0xfb,\n  'udp': 0x0111,\n  'p2p-webrtc-star': 0x0113,\n  'p2p-webrtc-direct': 0x0114,\n  'p2p-stardust': 0x0115,\n  'p2p-circuit': 0x0122,\n  'dag-json': 0x0129,\n  'udt': 0x012d,\n  'utp': 0x012e,\n  'unix': 0x0190,\n  'thread': 0x0196,\n  'p2p': 0x01a5,\n  'ipfs': 0x01a5,\n  'https': 0x01bb,\n  'onion': 0x01bc,\n  'onion3': 0x01bd,\n  'garlic64': 0x01be,\n  'garlic32': 0x01bf,\n  'tls': 0x01c0,\n  'quic': 0x01cc,\n  'ws': 0x01dd,\n  'wss': 0x01de,\n  'p2p-websocket-star': 0x01df,\n  'http': 0x01e0,\n  'json': 0x0200,\n  'messagepack': 0x0201,\n  'libp2p-peer-record': 0x0301,\n  'sha2-256-trunc254-padded': 0x1012,\n  'ripemd-128': 0x1052,\n  'ripemd-160': 0x1053,\n  'ripemd-256': 0x1054,\n  'ripemd-320': 0x1055,\n  'x11': 0x1100,\n  'p256-pub': 0x1200,\n  'p384-pub': 0x1201,\n  'p521-pub': 0x1202,\n  'ed448-pub': 0x1203,\n  'x448-pub': 0x1204,\n  'ed25519-priv': 0x1300,\n  'kangarootwelve': 0x1d01,\n  'sm3-256': 0x534d,\n  'blake2b-8': 0xb201,\n  'blake2b-16': 0xb202,\n  'blake2b-24': 0xb203,\n  'blake2b-32': 0xb204,\n  'blake2b-40': 0xb205,\n  'blake2b-48': 0xb206,\n  'blake2b-56': 0xb207,\n  'blake2b-64': 0xb208,\n  'blake2b-72': 0xb209,\n  'blake2b-80': 0xb20a,\n  'blake2b-88': 0xb20b,\n  'blake2b-96': 0xb20c,\n  'blake2b-104': 0xb20d,\n  'blake2b-112': 0xb20e,\n  'blake2b-120': 0xb20f,\n  'blake2b-128': 0xb210,\n  'blake2b-136': 0xb211,\n  'blake2b-144': 0xb212,\n  'blake2b-152': 0xb213,\n  'blake2b-160': 0xb214,\n  'blake2b-168': 0xb215,\n  'blake2b-176': 0xb216,\n  'blake2b-184': 0xb217,\n  'blake2b-192': 0xb218,\n  'blake2b-200': 0xb219,\n  'blake2b-208': 0xb21a,\n  'blake2b-216': 0xb21b,\n  'blake2b-224': 0xb21c,\n  'blake2b-232': 0xb21d,\n  'blake2b-240': 0xb21e,\n  'blake2b-248': 0xb21f,\n  'blake2b-256': 0xb220,\n  'blake2b-264': 0xb221,\n  'blake2b-272': 0xb222,\n  'blake2b-280': 0xb223,\n  'blake2b-288': 0xb224,\n  'blake2b-296': 0xb225,\n  'blake2b-304': 0xb226,\n  'blake2b-312': 0xb227,\n  'blake2b-320': 0xb228,\n  'blake2b-328': 0xb229,\n  'blake2b-336': 0xb22a,\n  'blake2b-344': 0xb22b,\n  'blake2b-352': 0xb22c,\n  'blake2b-360': 0xb22d,\n  'blake2b-368': 0xb22e,\n  'blake2b-376': 0xb22f,\n  'blake2b-384': 0xb230,\n  'blake2b-392': 0xb231,\n  'blake2b-400': 0xb232,\n  'blake2b-408': 0xb233,\n  'blake2b-416': 0xb234,\n  'blake2b-424': 0xb235,\n  'blake2b-432': 0xb236,\n  'blake2b-440': 0xb237,\n  'blake2b-448': 0xb238,\n  'blake2b-456': 0xb239,\n  'blake2b-464': 0xb23a,\n  'blake2b-472': 0xb23b,\n  'blake2b-480': 0xb23c,\n  'blake2b-488': 0xb23d,\n  'blake2b-496': 0xb23e,\n  'blake2b-504': 0xb23f,\n  'blake2b-512': 0xb240,\n  'blake2s-8': 0xb241,\n  'blake2s-16': 0xb242,\n  'blake2s-24': 0xb243,\n  'blake2s-32': 0xb244,\n  'blake2s-40': 0xb245,\n  'blake2s-48': 0xb246,\n  'blake2s-56': 0xb247,\n  'blake2s-64': 0xb248,\n  'blake2s-72': 0xb249,\n  'blake2s-80': 0xb24a,\n  'blake2s-88': 0xb24b,\n  'blake2s-96': 0xb24c,\n  'blake2s-104': 0xb24d,\n  'blake2s-112': 0xb24e,\n  'blake2s-120': 0xb24f,\n  'blake2s-128': 0xb250,\n  'blake2s-136': 0xb251,\n  'blake2s-144': 0xb252,\n  'blake2s-152': 0xb253,\n  'blake2s-160': 0xb254,\n  'blake2s-168': 0xb255,\n  'blake2s-176': 0xb256,\n  'blake2s-184': 0xb257,\n  'blake2s-192': 0xb258,\n  'blake2s-200': 0xb259,\n  'blake2s-208': 0xb25a,\n  'blake2s-216': 0xb25b,\n  'blake2s-224': 0xb25c,\n  'blake2s-232': 0xb25d,\n  'blake2s-240': 0xb25e,\n  'blake2s-248': 0xb25f,\n  'blake2s-256': 0xb260,\n  'skein256-8': 0xb301,\n  'skein256-16': 0xb302,\n  'skein256-24': 0xb303,\n  'skein256-32': 0xb304,\n  'skein256-40': 0xb305,\n  'skein256-48': 0xb306,\n  'skein256-56': 0xb307,\n  'skein256-64': 0xb308,\n  'skein256-72': 0xb309,\n  'skein256-80': 0xb30a,\n  'skein256-88': 0xb30b,\n  'skein256-96': 0xb30c,\n  'skein256-104': 0xb30d,\n  'skein256-112': 0xb30e,\n  'skein256-120': 0xb30f,\n  'skein256-128': 0xb310,\n  'skein256-136': 0xb311,\n  'skein256-144': 0xb312,\n  'skein256-152': 0xb313,\n  'skein256-160': 0xb314,\n  'skein256-168': 0xb315,\n  'skein256-176': 0xb316,\n  'skein256-184': 0xb317,\n  'skein256-192': 0xb318,\n  'skein256-200': 0xb319,\n  'skein256-208': 0xb31a,\n  'skein256-216': 0xb31b,\n  'skein256-224': 0xb31c,\n  'skein256-232': 0xb31d,\n  'skein256-240': 0xb31e,\n  'skein256-248': 0xb31f,\n  'skein256-256': 0xb320,\n  'skein512-8': 0xb321,\n  'skein512-16': 0xb322,\n  'skein512-24': 0xb323,\n  'skein512-32': 0xb324,\n  'skein512-40': 0xb325,\n  'skein512-48': 0xb326,\n  'skein512-56': 0xb327,\n  'skein512-64': 0xb328,\n  'skein512-72': 0xb329,\n  'skein512-80': 0xb32a,\n  'skein512-88': 0xb32b,\n  'skein512-96': 0xb32c,\n  'skein512-104': 0xb32d,\n  'skein512-112': 0xb32e,\n  'skein512-120': 0xb32f,\n  'skein512-128': 0xb330,\n  'skein512-136': 0xb331,\n  'skein512-144': 0xb332,\n  'skein512-152': 0xb333,\n  'skein512-160': 0xb334,\n  'skein512-168': 0xb335,\n  'skein512-176': 0xb336,\n  'skein512-184': 0xb337,\n  'skein512-192': 0xb338,\n  'skein512-200': 0xb339,\n  'skein512-208': 0xb33a,\n  'skein512-216': 0xb33b,\n  'skein512-224': 0xb33c,\n  'skein512-232': 0xb33d,\n  'skein512-240': 0xb33e,\n  'skein512-248': 0xb33f,\n  'skein512-256': 0xb340,\n  'skein512-264': 0xb341,\n  'skein512-272': 0xb342,\n  'skein512-280': 0xb343,\n  'skein512-288': 0xb344,\n  'skein512-296': 0xb345,\n  'skein512-304': 0xb346,\n  'skein512-312': 0xb347,\n  'skein512-320': 0xb348,\n  'skein512-328': 0xb349,\n  'skein512-336': 0xb34a,\n  'skein512-344': 0xb34b,\n  'skein512-352': 0xb34c,\n  'skein512-360': 0xb34d,\n  'skein512-368': 0xb34e,\n  'skein512-376': 0xb34f,\n  'skein512-384': 0xb350,\n  'skein512-392': 0xb351,\n  'skein512-400': 0xb352,\n  'skein512-408': 0xb353,\n  'skein512-416': 0xb354,\n  'skein512-424': 0xb355,\n  'skein512-432': 0xb356,\n  'skein512-440': 0xb357,\n  'skein512-448': 0xb358,\n  'skein512-456': 0xb359,\n  'skein512-464': 0xb35a,\n  'skein512-472': 0xb35b,\n  'skein512-480': 0xb35c,\n  'skein512-488': 0xb35d,\n  'skein512-496': 0xb35e,\n  'skein512-504': 0xb35f,\n  'skein512-512': 0xb360,\n  'skein1024-8': 0xb361,\n  'skein1024-16': 0xb362,\n  'skein1024-24': 0xb363,\n  'skein1024-32': 0xb364,\n  'skein1024-40': 0xb365,\n  'skein1024-48': 0xb366,\n  'skein1024-56': 0xb367,\n  'skein1024-64': 0xb368,\n  'skein1024-72': 0xb369,\n  'skein1024-80': 0xb36a,\n  'skein1024-88': 0xb36b,\n  'skein1024-96': 0xb36c,\n  'skein1024-104': 0xb36d,\n  'skein1024-112': 0xb36e,\n  'skein1024-120': 0xb36f,\n  'skein1024-128': 0xb370,\n  'skein1024-136': 0xb371,\n  'skein1024-144': 0xb372,\n  'skein1024-152': 0xb373,\n  'skein1024-160': 0xb374,\n  'skein1024-168': 0xb375,\n  'skein1024-176': 0xb376,\n  'skein1024-184': 0xb377,\n  'skein1024-192': 0xb378,\n  'skein1024-200': 0xb379,\n  'skein1024-208': 0xb37a,\n  'skein1024-216': 0xb37b,\n  'skein1024-224': 0xb37c,\n  'skein1024-232': 0xb37d,\n  'skein1024-240': 0xb37e,\n  'skein1024-248': 0xb37f,\n  'skein1024-256': 0xb380,\n  'skein1024-264': 0xb381,\n  'skein1024-272': 0xb382,\n  'skein1024-280': 0xb383,\n  'skein1024-288': 0xb384,\n  'skein1024-296': 0xb385,\n  'skein1024-304': 0xb386,\n  'skein1024-312': 0xb387,\n  'skein1024-320': 0xb388,\n  'skein1024-328': 0xb389,\n  'skein1024-336': 0xb38a,\n  'skein1024-344': 0xb38b,\n  'skein1024-352': 0xb38c,\n  'skein1024-360': 0xb38d,\n  'skein1024-368': 0xb38e,\n  'skein1024-376': 0xb38f,\n  'skein1024-384': 0xb390,\n  'skein1024-392': 0xb391,\n  'skein1024-400': 0xb392,\n  'skein1024-408': 0xb393,\n  'skein1024-416': 0xb394,\n  'skein1024-424': 0xb395,\n  'skein1024-432': 0xb396,\n  'skein1024-440': 0xb397,\n  'skein1024-448': 0xb398,\n  'skein1024-456': 0xb399,\n  'skein1024-464': 0xb39a,\n  'skein1024-472': 0xb39b,\n  'skein1024-480': 0xb39c,\n  'skein1024-488': 0xb39d,\n  'skein1024-496': 0xb39e,\n  'skein1024-504': 0xb39f,\n  'skein1024-512': 0xb3a0,\n  'skein1024-520': 0xb3a1,\n  'skein1024-528': 0xb3a2,\n  'skein1024-536': 0xb3a3,\n  'skein1024-544': 0xb3a4,\n  'skein1024-552': 0xb3a5,\n  'skein1024-560': 0xb3a6,\n  'skein1024-568': 0xb3a7,\n  'skein1024-576': 0xb3a8,\n  'skein1024-584': 0xb3a9,\n  'skein1024-592': 0xb3aa,\n  'skein1024-600': 0xb3ab,\n  'skein1024-608': 0xb3ac,\n  'skein1024-616': 0xb3ad,\n  'skein1024-624': 0xb3ae,\n  'skein1024-632': 0xb3af,\n  'skein1024-640': 0xb3b0,\n  'skein1024-648': 0xb3b1,\n  'skein1024-656': 0xb3b2,\n  'skein1024-664': 0xb3b3,\n  'skein1024-672': 0xb3b4,\n  'skein1024-680': 0xb3b5,\n  'skein1024-688': 0xb3b6,\n  'skein1024-696': 0xb3b7,\n  'skein1024-704': 0xb3b8,\n  'skein1024-712': 0xb3b9,\n  'skein1024-720': 0xb3ba,\n  'skein1024-728': 0xb3bb,\n  'skein1024-736': 0xb3bc,\n  'skein1024-744': 0xb3bd,\n  'skein1024-752': 0xb3be,\n  'skein1024-760': 0xb3bf,\n  'skein1024-768': 0xb3c0,\n  'skein1024-776': 0xb3c1,\n  'skein1024-784': 0xb3c2,\n  'skein1024-792': 0xb3c3,\n  'skein1024-800': 0xb3c4,\n  'skein1024-808': 0xb3c5,\n  'skein1024-816': 0xb3c6,\n  'skein1024-824': 0xb3c7,\n  'skein1024-832': 0xb3c8,\n  'skein1024-840': 0xb3c9,\n  'skein1024-848': 0xb3ca,\n  'skein1024-856': 0xb3cb,\n  'skein1024-864': 0xb3cc,\n  'skein1024-872': 0xb3cd,\n  'skein1024-880': 0xb3ce,\n  'skein1024-888': 0xb3cf,\n  'skein1024-896': 0xb3d0,\n  'skein1024-904': 0xb3d1,\n  'skein1024-912': 0xb3d2,\n  'skein1024-920': 0xb3d3,\n  'skein1024-928': 0xb3d4,\n  'skein1024-936': 0xb3d5,\n  'skein1024-944': 0xb3d6,\n  'skein1024-952': 0xb3d7,\n  'skein1024-960': 0xb3d8,\n  'skein1024-968': 0xb3d9,\n  'skein1024-976': 0xb3da,\n  'skein1024-984': 0xb3db,\n  'skein1024-992': 0xb3dc,\n  'skein1024-1000': 0xb3dd,\n  'skein1024-1008': 0xb3de,\n  'skein1024-1016': 0xb3df,\n  'skein1024-1024': 0xb3e0,\n  'poseidon-bls12_381-a2-fc1': 0xb401,\n  'poseidon-bls12_381-a2-fc1-sc': 0xb402,\n  'zeroxcert-imprint-256': 0xce11,\n  'fil-commitment-unsealed': 0xf101,\n  'fil-commitment-sealed': 0xf102,\n  'holochain-adr-v0': 0x807124,\n  'holochain-adr-v1': 0x817124,\n  'holochain-key-v0': 0x947124,\n  'holochain-key-v1': 0x957124,\n  'holochain-sig-v0': 0xa27124,\n  'holochain-sig-v1': 0xa37124,\n  'skynet-ns': 0xb19910\n})\n\nmodule.exports = { baseTable }\n","'use strict'\n\nconst mh = require('multihashes')\n\nconst CIDUtil = {\n  /**\n   * Test if the given input is a valid CID object.\n   * Returns an error message if it is not.\n   * Returns undefined if it is a valid CID.\n   *\n   * @param {any} other\n   * @returns {string|undefined}\n   */\n  checkCIDComponents: function (other) {\n    if (other == null) {\n      return 'null values are not valid CIDs'\n    }\n\n    if (!(other.version === 0 || other.version === 1)) {\n      return 'Invalid version, must be a number equal to 1 or 0'\n    }\n\n    if (typeof other.codec !== 'string') {\n      return 'codec must be string'\n    }\n\n    if (other.version === 0) {\n      if (other.codec !== 'dag-pb') {\n        return \"codec must be 'dag-pb' for CIDv0\"\n      }\n      if (other.multibaseName !== 'base58btc') {\n        return \"multibaseName must be 'base58btc' for CIDv0\"\n      }\n    }\n\n    if (!(other.multihash instanceof Uint8Array)) {\n      return 'multihash must be a Uint8Array'\n    }\n\n    try {\n      mh.validate(other.multihash)\n    } catch (err) {\n      let errorMsg = err.message\n      if (!errorMsg) { // Just in case mh.validate() throws an error with empty error message\n        errorMsg = 'Multihash validation failed'\n      }\n      return errorMsg\n    }\n  }\n}\n\nmodule.exports = CIDUtil\n","'use strict'\n\n/**\n * Returns true if the two passed Uint8Arrays have the same content\n *\n * @param {Uint8Array} a\n * @param {Uint8Array} b\n */\nfunction equals (a, b) {\n  if (a === b) {\n    return true\n  }\n\n  if (a.byteLength !== b.byteLength) {\n    return false\n  }\n\n  for (let i = 0; i < a.byteLength; i++) {\n    if (a[i] !== b[i]) {\n      return false\n    }\n  }\n\n  return true\n}\n\nmodule.exports = equals\n","'use strict'\n\nconst keysPBM = require('./keys')\nrequire('node-forge/lib/asn1')\nrequire('node-forge/lib/pbe')\nconst forge = require('node-forge/lib/forge')\nconst errcode = require('err-code')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\nconst importer = require('./importer')\n\nconst supportedKeys = {\n  rsa: require('./rsa-class'),\n  ed25519: require('./ed25519-class'),\n  secp256k1: require('./secp256k1-class')(keysPBM, require('../random-bytes'))\n}\n\nconst ErrMissingSecp256K1 = {\n  message: 'secp256k1 support requires libp2p-crypto-secp256k1 package',\n  code: 'ERR_MISSING_PACKAGE'\n}\n\nfunction typeToKey (type) {\n  const key = supportedKeys[type.toLowerCase()]\n  if (!key) {\n    const supported = Object.keys(supportedKeys).join(' / ')\n    throw errcode(new Error(`invalid or unsupported key type ${type}. Must be ${supported}`), 'ERR_UNSUPPORTED_KEY_TYPE')\n  }\n  return key\n}\n\n// Generates a keypair of the given type and bitsize\nconst generateKeyPair = async (type, bits) => { // eslint-disable-line require-await\n  return typeToKey(type).generateKeyPair(bits)\n}\n\n// Generates a keypair of the given type and bitsize\n// seed is a 32 byte uint8array\nconst generateKeyPairFromSeed = async (type, seed, bits) => { // eslint-disable-line require-await\n  const key = typeToKey(type)\n  if (type.toLowerCase() !== 'ed25519') {\n    throw errcode(new Error('Seed key derivation is unimplemented for RSA or secp256k1'), 'ERR_UNSUPPORTED_KEY_DERIVATION_TYPE')\n  }\n  return key.generateKeyPairFromSeed(seed, bits)\n}\n\n// Converts a protobuf serialized public key into its\n// representative object\nconst unmarshalPublicKey = (buf) => {\n  const decoded = keysPBM.PublicKey.decode(buf)\n  const data = decoded.Data\n\n  switch (decoded.Type) {\n    case keysPBM.KeyType.RSA:\n      return supportedKeys.rsa.unmarshalRsaPublicKey(data)\n    case keysPBM.KeyType.Ed25519:\n      return supportedKeys.ed25519.unmarshalEd25519PublicKey(data)\n    case keysPBM.KeyType.Secp256k1:\n      if (supportedKeys.secp256k1) {\n        return supportedKeys.secp256k1.unmarshalSecp256k1PublicKey(data)\n      } else {\n        throw errcode(new Error(ErrMissingSecp256K1.message), ErrMissingSecp256K1.code)\n      }\n    default:\n      typeToKey(decoded.Type) // throws because type is not supported\n  }\n}\n\n// Converts a public key object into a protobuf serialized public key\nconst marshalPublicKey = (key, type) => {\n  type = (type || 'rsa').toLowerCase()\n  typeToKey(type) // check type\n  return key.bytes\n}\n\n// Converts a protobuf serialized private key into its\n// representative object\nconst unmarshalPrivateKey = async (buf) => { // eslint-disable-line require-await\n  const decoded = keysPBM.PrivateKey.decode(buf)\n  const data = decoded.Data\n\n  switch (decoded.Type) {\n    case keysPBM.KeyType.RSA:\n      return supportedKeys.rsa.unmarshalRsaPrivateKey(data)\n    case keysPBM.KeyType.Ed25519:\n      return supportedKeys.ed25519.unmarshalEd25519PrivateKey(data)\n    case keysPBM.KeyType.Secp256k1:\n      if (supportedKeys.secp256k1) {\n        return supportedKeys.secp256k1.unmarshalSecp256k1PrivateKey(data)\n      } else {\n        throw errcode(new Error(ErrMissingSecp256K1.message), ErrMissingSecp256K1.code)\n      }\n    default:\n      typeToKey(decoded.Type) // throws because type is not supported\n  }\n}\n\n// Converts a private key object into a protobuf serialized private key\nconst marshalPrivateKey = (key, type) => {\n  type = (type || 'rsa').toLowerCase()\n  typeToKey(type) // check type\n  return key.bytes\n}\n\n/**\n *\n * @param {string} encryptedKey\n * @param {string} password\n */\nconst importKey = async (encryptedKey, password) => { // eslint-disable-line require-await\n  try {\n    const key = await importer.import(encryptedKey, password)\n    return unmarshalPrivateKey(key)\n  } catch (_) {\n    // Ignore and try the old pem decrypt\n  }\n\n  // Only rsa supports pem right now\n  const key = forge.pki.decryptRsaPrivateKey(encryptedKey, password)\n  if (key === null) {\n    throw errcode(new Error('Cannot read the key, most likely the password is wrong or not a RSA key'), 'ERR_CANNOT_DECRYPT_PEM')\n  }\n  let der = forge.asn1.toDer(forge.pki.privateKeyToAsn1(key))\n  der = uint8ArrayFromString(der.getBytes(), 'ascii')\n  return supportedKeys.rsa.unmarshalRsaPrivateKey(der)\n}\n\nmodule.exports = {\n  supportedKeys,\n  keysPBM,\n  keyStretcher: require('./key-stretcher'),\n  generateEphemeralKeyPair: require('./ephemeral-keys'),\n  generateKeyPair,\n  generateKeyPairFromSeed,\n  unmarshalPublicKey,\n  marshalPublicKey,\n  unmarshalPrivateKey,\n  marshalPrivateKey,\n  import: importKey\n}\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"libp2p-crypto-keys\"] || ($protobuf.roots[\"libp2p-crypto-keys\"] = {});\n\n/**\n * KeyType enum.\n * @exports KeyType\n * @enum {number}\n * @property {number} RSA=0 RSA value\n * @property {number} Ed25519=1 Ed25519 value\n * @property {number} Secp256k1=2 Secp256k1 value\n */\n$root.KeyType = (function() {\n    var valuesById = {}, values = Object.create(valuesById);\n    values[valuesById[0] = \"RSA\"] = 0;\n    values[valuesById[1] = \"Ed25519\"] = 1;\n    values[valuesById[2] = \"Secp256k1\"] = 2;\n    return values;\n})();\n\n$root.PublicKey = (function() {\n\n    /**\n     * Properties of a PublicKey.\n     * @exports IPublicKey\n     * @interface IPublicKey\n     * @property {KeyType} Type PublicKey Type\n     * @property {Uint8Array} Data PublicKey Data\n     */\n\n    /**\n     * Constructs a new PublicKey.\n     * @exports PublicKey\n     * @classdesc Represents a PublicKey.\n     * @implements IPublicKey\n     * @constructor\n     * @param {IPublicKey=} [p] Properties to set\n     */\n    function PublicKey(p) {\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * PublicKey Type.\n     * @member {KeyType} Type\n     * @memberof PublicKey\n     * @instance\n     */\n    PublicKey.prototype.Type = 0;\n\n    /**\n     * PublicKey Data.\n     * @member {Uint8Array} Data\n     * @memberof PublicKey\n     * @instance\n     */\n    PublicKey.prototype.Data = $util.newBuffer([]);\n\n    /**\n     * Encodes the specified PublicKey message. Does not implicitly {@link PublicKey.verify|verify} messages.\n     * @function encode\n     * @memberof PublicKey\n     * @static\n     * @param {IPublicKey} m PublicKey message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    PublicKey.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        w.uint32(8).int32(m.Type);\n        w.uint32(18).bytes(m.Data);\n        return w;\n    };\n\n    /**\n     * Decodes a PublicKey message from the specified reader or buffer.\n     * @function decode\n     * @memberof PublicKey\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {PublicKey} PublicKey\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    PublicKey.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.PublicKey();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.Type = r.int32();\n                break;\n            case 2:\n                m.Data = r.bytes();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        if (!m.hasOwnProperty(\"Type\"))\n            throw $util.ProtocolError(\"missing required 'Type'\", { instance: m });\n        if (!m.hasOwnProperty(\"Data\"))\n            throw $util.ProtocolError(\"missing required 'Data'\", { instance: m });\n        return m;\n    };\n\n    /**\n     * Creates a PublicKey message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof PublicKey\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {PublicKey} PublicKey\n     */\n    PublicKey.fromObject = function fromObject(d) {\n        if (d instanceof $root.PublicKey)\n            return d;\n        var m = new $root.PublicKey();\n        switch (d.Type) {\n        case \"RSA\":\n        case 0:\n            m.Type = 0;\n            break;\n        case \"Ed25519\":\n        case 1:\n            m.Type = 1;\n            break;\n        case \"Secp256k1\":\n        case 2:\n            m.Type = 2;\n            break;\n        }\n        if (d.Data != null) {\n            if (typeof d.Data === \"string\")\n                $util.base64.decode(d.Data, m.Data = $util.newBuffer($util.base64.length(d.Data)), 0);\n            else if (d.Data.length)\n                m.Data = d.Data;\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a PublicKey message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof PublicKey\n     * @static\n     * @param {PublicKey} m PublicKey\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    PublicKey.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.defaults) {\n            d.Type = o.enums === String ? \"RSA\" : 0;\n            if (o.bytes === String)\n                d.Data = \"\";\n            else {\n                d.Data = [];\n                if (o.bytes !== Array)\n                    d.Data = $util.newBuffer(d.Data);\n            }\n        }\n        if (m.Type != null && m.hasOwnProperty(\"Type\")) {\n            d.Type = o.enums === String ? $root.KeyType[m.Type] : m.Type;\n        }\n        if (m.Data != null && m.hasOwnProperty(\"Data\")) {\n            d.Data = o.bytes === String ? $util.base64.encode(m.Data, 0, m.Data.length) : o.bytes === Array ? Array.prototype.slice.call(m.Data) : m.Data;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this PublicKey to JSON.\n     * @function toJSON\n     * @memberof PublicKey\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    PublicKey.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return PublicKey;\n})();\n\n$root.PrivateKey = (function() {\n\n    /**\n     * Properties of a PrivateKey.\n     * @exports IPrivateKey\n     * @interface IPrivateKey\n     * @property {KeyType} Type PrivateKey Type\n     * @property {Uint8Array} Data PrivateKey Data\n     */\n\n    /**\n     * Constructs a new PrivateKey.\n     * @exports PrivateKey\n     * @classdesc Represents a PrivateKey.\n     * @implements IPrivateKey\n     * @constructor\n     * @param {IPrivateKey=} [p] Properties to set\n     */\n    function PrivateKey(p) {\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * PrivateKey Type.\n     * @member {KeyType} Type\n     * @memberof PrivateKey\n     * @instance\n     */\n    PrivateKey.prototype.Type = 0;\n\n    /**\n     * PrivateKey Data.\n     * @member {Uint8Array} Data\n     * @memberof PrivateKey\n     * @instance\n     */\n    PrivateKey.prototype.Data = $util.newBuffer([]);\n\n    /**\n     * Encodes the specified PrivateKey message. Does not implicitly {@link PrivateKey.verify|verify} messages.\n     * @function encode\n     * @memberof PrivateKey\n     * @static\n     * @param {IPrivateKey} m PrivateKey message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    PrivateKey.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        w.uint32(8).int32(m.Type);\n        w.uint32(18).bytes(m.Data);\n        return w;\n    };\n\n    /**\n     * Decodes a PrivateKey message from the specified reader or buffer.\n     * @function decode\n     * @memberof PrivateKey\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {PrivateKey} PrivateKey\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    PrivateKey.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.PrivateKey();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.Type = r.int32();\n                break;\n            case 2:\n                m.Data = r.bytes();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        if (!m.hasOwnProperty(\"Type\"))\n            throw $util.ProtocolError(\"missing required 'Type'\", { instance: m });\n        if (!m.hasOwnProperty(\"Data\"))\n            throw $util.ProtocolError(\"missing required 'Data'\", { instance: m });\n        return m;\n    };\n\n    /**\n     * Creates a PrivateKey message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof PrivateKey\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {PrivateKey} PrivateKey\n     */\n    PrivateKey.fromObject = function fromObject(d) {\n        if (d instanceof $root.PrivateKey)\n            return d;\n        var m = new $root.PrivateKey();\n        switch (d.Type) {\n        case \"RSA\":\n        case 0:\n            m.Type = 0;\n            break;\n        case \"Ed25519\":\n        case 1:\n            m.Type = 1;\n            break;\n        case \"Secp256k1\":\n        case 2:\n            m.Type = 2;\n            break;\n        }\n        if (d.Data != null) {\n            if (typeof d.Data === \"string\")\n                $util.base64.decode(d.Data, m.Data = $util.newBuffer($util.base64.length(d.Data)), 0);\n            else if (d.Data.length)\n                m.Data = d.Data;\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a PrivateKey message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof PrivateKey\n     * @static\n     * @param {PrivateKey} m PrivateKey\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    PrivateKey.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.defaults) {\n            d.Type = o.enums === String ? \"RSA\" : 0;\n            if (o.bytes === String)\n                d.Data = \"\";\n            else {\n                d.Data = [];\n                if (o.bytes !== Array)\n                    d.Data = $util.newBuffer(d.Data);\n            }\n        }\n        if (m.Type != null && m.hasOwnProperty(\"Type\")) {\n            d.Type = o.enums === String ? $root.KeyType[m.Type] : m.Type;\n        }\n        if (m.Data != null && m.hasOwnProperty(\"Data\")) {\n            d.Data = o.bytes === String ? $util.base64.encode(m.Data, 0, m.Data.length) : o.bytes === Array ? Array.prototype.slice.call(m.Data) : m.Data;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this PrivateKey to JSON.\n     * @function toJSON\n     * @memberof PrivateKey\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    PrivateKey.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return PrivateKey;\n})();\n\nmodule.exports = $root;\n","// minimal library entry point.\n\n\"use strict\";\nmodule.exports = require(\"./src/index-minimal\");\n","\"use strict\";\nvar protobuf = exports;\n\n/**\n * Build type, one of `\"full\"`, `\"light\"` or `\"minimal\"`.\n * @name build\n * @type {string}\n * @const\n */\nprotobuf.build = \"minimal\";\n\n// Serialization\nprotobuf.Writer       = require(\"./writer\");\nprotobuf.BufferWriter = require(\"./writer_buffer\");\nprotobuf.Reader       = require(\"./reader\");\nprotobuf.BufferReader = require(\"./reader_buffer\");\n\n// Utility\nprotobuf.util         = require(\"./util/minimal\");\nprotobuf.rpc          = require(\"./rpc\");\nprotobuf.roots        = require(\"./roots\");\nprotobuf.configure    = configure;\n\n/* istanbul ignore next */\n/**\n * Reconfigures the library according to the environment.\n * @returns {undefined}\n */\nfunction configure() {\n    protobuf.util._configure();\n    protobuf.Writer._configure(protobuf.BufferWriter);\n    protobuf.Reader._configure(protobuf.BufferReader);\n}\n\n// Set up buffer utility according to the environment\nconfigure();\n","\"use strict\";\nmodule.exports = Writer;\n\nvar util      = require(\"./util/minimal\");\n\nvar BufferWriter; // cyclic\n\nvar LongBits  = util.LongBits,\n    base64    = util.base64,\n    utf8      = util.utf8;\n\n/**\n * Constructs a new writer operation instance.\n * @classdesc Scheduled writer operation.\n * @constructor\n * @param {function(*, Uint8Array, number)} fn Function to call\n * @param {number} len Value byte length\n * @param {*} val Value to write\n * @ignore\n */\nfunction Op(fn, len, val) {\n\n    /**\n     * Function to call.\n     * @type {function(Uint8Array, number, *)}\n     */\n    this.fn = fn;\n\n    /**\n     * Value byte length.\n     * @type {number}\n     */\n    this.len = len;\n\n    /**\n     * Next operation.\n     * @type {Writer.Op|undefined}\n     */\n    this.next = undefined;\n\n    /**\n     * Value to write.\n     * @type {*}\n     */\n    this.val = val; // type varies\n}\n\n/* istanbul ignore next */\nfunction noop() {} // eslint-disable-line no-empty-function\n\n/**\n * Constructs a new writer state instance.\n * @classdesc Copied writer state.\n * @memberof Writer\n * @constructor\n * @param {Writer} writer Writer to copy state from\n * @ignore\n */\nfunction State(writer) {\n\n    /**\n     * Current head.\n     * @type {Writer.Op}\n     */\n    this.head = writer.head;\n\n    /**\n     * Current tail.\n     * @type {Writer.Op}\n     */\n    this.tail = writer.tail;\n\n    /**\n     * Current buffer length.\n     * @type {number}\n     */\n    this.len = writer.len;\n\n    /**\n     * Next state.\n     * @type {State|null}\n     */\n    this.next = writer.states;\n}\n\n/**\n * Constructs a new writer instance.\n * @classdesc Wire format writer using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n */\nfunction Writer() {\n\n    /**\n     * Current length.\n     * @type {number}\n     */\n    this.len = 0;\n\n    /**\n     * Operations head.\n     * @type {Object}\n     */\n    this.head = new Op(noop, 0, 0);\n\n    /**\n     * Operations tail\n     * @type {Object}\n     */\n    this.tail = this.head;\n\n    /**\n     * Linked forked states.\n     * @type {Object|null}\n     */\n    this.states = null;\n\n    // When a value is written, the writer calculates its byte length and puts it into a linked\n    // list of operations to perform when finish() is called. This both allows us to allocate\n    // buffers of the exact required size and reduces the amount of work we have to do compared\n    // to first calculating over objects and then encoding over objects. In our case, the encoding\n    // part is just a linked list walk calling operations with already prepared values.\n}\n\nvar create = function create() {\n    return util.Buffer\n        ? function create_buffer_setup() {\n            return (Writer.create = function create_buffer() {\n                return new BufferWriter();\n            })();\n        }\n        /* istanbul ignore next */\n        : function create_array() {\n            return new Writer();\n        };\n};\n\n/**\n * Creates a new writer.\n * @function\n * @returns {BufferWriter|Writer} A {@link BufferWriter} when Buffers are supported, otherwise a {@link Writer}\n */\nWriter.create = create();\n\n/**\n * Allocates a buffer of the specified size.\n * @param {number} size Buffer size\n * @returns {Uint8Array} Buffer\n */\nWriter.alloc = function alloc(size) {\n    return new util.Array(size);\n};\n\n// Use Uint8Array buffer pool in the browser, just like node does with buffers\n/* istanbul ignore else */\nif (util.Array !== Array)\n    Writer.alloc = util.pool(Writer.alloc, util.Array.prototype.subarray);\n\n/**\n * Pushes a new operation to the queue.\n * @param {function(Uint8Array, number, *)} fn Function to call\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @returns {Writer} `this`\n * @private\n */\nWriter.prototype._push = function push(fn, len, val) {\n    this.tail = this.tail.next = new Op(fn, len, val);\n    this.len += len;\n    return this;\n};\n\nfunction writeByte(val, buf, pos) {\n    buf[pos] = val & 255;\n}\n\nfunction writeVarint32(val, buf, pos) {\n    while (val > 127) {\n        buf[pos++] = val & 127 | 128;\n        val >>>= 7;\n    }\n    buf[pos] = val;\n}\n\n/**\n * Constructs a new varint writer operation instance.\n * @classdesc Scheduled varint writer operation.\n * @extends Op\n * @constructor\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @ignore\n */\nfunction VarintOp(len, val) {\n    this.len = len;\n    this.next = undefined;\n    this.val = val;\n}\n\nVarintOp.prototype = Object.create(Op.prototype);\nVarintOp.prototype.fn = writeVarint32;\n\n/**\n * Writes an unsigned 32 bit value as a varint.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.uint32 = function write_uint32(value) {\n    // here, the call to this.push has been inlined and a varint specific Op subclass is used.\n    // uint32 is by far the most frequently used operation and benefits significantly from this.\n    this.len += (this.tail = this.tail.next = new VarintOp(\n        (value = value >>> 0)\n                < 128       ? 1\n        : value < 16384     ? 2\n        : value < 2097152   ? 3\n        : value < 268435456 ? 4\n        :                     5,\n    value)).len;\n    return this;\n};\n\n/**\n * Writes a signed 32 bit value as a varint.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.int32 = function write_int32(value) {\n    return value < 0\n        ? this._push(writeVarint64, 10, LongBits.fromNumber(value)) // 10 bytes per spec\n        : this.uint32(value);\n};\n\n/**\n * Writes a 32 bit value as a varint, zig-zag encoded.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sint32 = function write_sint32(value) {\n    return this.uint32((value << 1 ^ value >> 31) >>> 0);\n};\n\nfunction writeVarint64(val, buf, pos) {\n    while (val.hi) {\n        buf[pos++] = val.lo & 127 | 128;\n        val.lo = (val.lo >>> 7 | val.hi << 25) >>> 0;\n        val.hi >>>= 7;\n    }\n    while (val.lo > 127) {\n        buf[pos++] = val.lo & 127 | 128;\n        val.lo = val.lo >>> 7;\n    }\n    buf[pos++] = val.lo;\n}\n\n/**\n * Writes an unsigned 64 bit value as a varint.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.uint64 = function write_uint64(value) {\n    var bits = LongBits.from(value);\n    return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a signed 64 bit value as a varint.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.int64 = Writer.prototype.uint64;\n\n/**\n * Writes a signed 64 bit value as a varint, zig-zag encoded.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sint64 = function write_sint64(value) {\n    var bits = LongBits.from(value).zzEncode();\n    return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a boolish value as a varint.\n * @param {boolean} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bool = function write_bool(value) {\n    return this._push(writeByte, 1, value ? 1 : 0);\n};\n\nfunction writeFixed32(val, buf, pos) {\n    buf[pos    ] =  val         & 255;\n    buf[pos + 1] =  val >>> 8   & 255;\n    buf[pos + 2] =  val >>> 16  & 255;\n    buf[pos + 3] =  val >>> 24;\n}\n\n/**\n * Writes an unsigned 32 bit value as fixed 32 bits.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.fixed32 = function write_fixed32(value) {\n    return this._push(writeFixed32, 4, value >>> 0);\n};\n\n/**\n * Writes a signed 32 bit value as fixed 32 bits.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sfixed32 = Writer.prototype.fixed32;\n\n/**\n * Writes an unsigned 64 bit value as fixed 64 bits.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.fixed64 = function write_fixed64(value) {\n    var bits = LongBits.from(value);\n    return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\n};\n\n/**\n * Writes a signed 64 bit value as fixed 64 bits.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sfixed64 = Writer.prototype.fixed64;\n\n/**\n * Writes a float (32 bit).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.float = function write_float(value) {\n    return this._push(util.float.writeFloatLE, 4, value);\n};\n\n/**\n * Writes a double (64 bit float).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.double = function write_double(value) {\n    return this._push(util.float.writeDoubleLE, 8, value);\n};\n\nvar writeBytes = util.Array.prototype.set\n    ? function writeBytes_set(val, buf, pos) {\n        buf.set(val, pos); // also works for plain array values\n    }\n    /* istanbul ignore next */\n    : function writeBytes_for(val, buf, pos) {\n        for (var i = 0; i < val.length; ++i)\n            buf[pos + i] = val[i];\n    };\n\n/**\n * Writes a sequence of bytes.\n * @param {Uint8Array|string} value Buffer or base64 encoded string to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bytes = function write_bytes(value) {\n    var len = value.length >>> 0;\n    if (!len)\n        return this._push(writeByte, 1, 0);\n    if (util.isString(value)) {\n        var buf = Writer.alloc(len = base64.length(value));\n        base64.decode(value, buf, 0);\n        value = buf;\n    }\n    return this.uint32(len)._push(writeBytes, len, value);\n};\n\n/**\n * Writes a string.\n * @param {string} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.string = function write_string(value) {\n    var len = utf8.length(value);\n    return len\n        ? this.uint32(len)._push(utf8.write, len, value)\n        : this._push(writeByte, 1, 0);\n};\n\n/**\n * Forks this writer's state by pushing it to a stack.\n * Calling {@link Writer#reset|reset} or {@link Writer#ldelim|ldelim} resets the writer to the previous state.\n * @returns {Writer} `this`\n */\nWriter.prototype.fork = function fork() {\n    this.states = new State(this);\n    this.head = this.tail = new Op(noop, 0, 0);\n    this.len = 0;\n    return this;\n};\n\n/**\n * Resets this instance to the last state.\n * @returns {Writer} `this`\n */\nWriter.prototype.reset = function reset() {\n    if (this.states) {\n        this.head   = this.states.head;\n        this.tail   = this.states.tail;\n        this.len    = this.states.len;\n        this.states = this.states.next;\n    } else {\n        this.head = this.tail = new Op(noop, 0, 0);\n        this.len  = 0;\n    }\n    return this;\n};\n\n/**\n * Resets to the last state and appends the fork state's current write length as a varint followed by its operations.\n * @returns {Writer} `this`\n */\nWriter.prototype.ldelim = function ldelim() {\n    var head = this.head,\n        tail = this.tail,\n        len  = this.len;\n    this.reset().uint32(len);\n    if (len) {\n        this.tail.next = head.next; // skip noop\n        this.tail = tail;\n        this.len += len;\n    }\n    return this;\n};\n\n/**\n * Finishes the write operation.\n * @returns {Uint8Array} Finished buffer\n */\nWriter.prototype.finish = function finish() {\n    var head = this.head.next, // skip noop\n        buf  = this.constructor.alloc(this.len),\n        pos  = 0;\n    while (head) {\n        head.fn(head.val, buf, pos);\n        pos += head.len;\n        head = head.next;\n    }\n    // this.head = this.tail = null;\n    return buf;\n};\n\nWriter._configure = function(BufferWriter_) {\n    BufferWriter = BufferWriter_;\n    Writer.create = create();\n    BufferWriter._configure();\n};\n","\"use strict\";\nvar util = exports;\n\n// used to return a Promise where callback is omitted\nutil.asPromise = require(\"@protobufjs/aspromise\");\n\n// converts to / from base64 encoded strings\nutil.base64 = require(\"@protobufjs/base64\");\n\n// base class of rpc.Service\nutil.EventEmitter = require(\"@protobufjs/eventemitter\");\n\n// float handling accross browsers\nutil.float = require(\"@protobufjs/float\");\n\n// requires modules optionally and hides the call from bundlers\nutil.inquire = require(\"@protobufjs/inquire\");\n\n// converts to / from utf8 encoded strings\nutil.utf8 = require(\"@protobufjs/utf8\");\n\n// provides a node-like buffer pool in the browser\nutil.pool = require(\"@protobufjs/pool\");\n\n// utility to work with the low and high bits of a 64 bit value\nutil.LongBits = require(\"./longbits\");\n\n/**\n * Whether running within node or not.\n * @memberof util\n * @type {boolean}\n */\nutil.isNode = Boolean(typeof global !== \"undefined\"\n                   && global\n                   && global.process\n                   && global.process.versions\n                   && global.process.versions.node);\n\n/**\n * Global object reference.\n * @memberof util\n * @type {Object}\n */\nutil.global = util.isNode && global\n           || typeof window !== \"undefined\" && window\n           || typeof self   !== \"undefined\" && self\n           || this; // eslint-disable-line no-invalid-this\n\n/**\n * An immuable empty array.\n * @memberof util\n * @type {Array.<*>}\n * @const\n */\nutil.emptyArray = Object.freeze ? Object.freeze([]) : /* istanbul ignore next */ []; // used on prototypes\n\n/**\n * An immutable empty object.\n * @type {Object}\n * @const\n */\nutil.emptyObject = Object.freeze ? Object.freeze({}) : /* istanbul ignore next */ {}; // used on prototypes\n\n/**\n * Tests if the specified value is an integer.\n * @function\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is an integer\n */\nutil.isInteger = Number.isInteger || /* istanbul ignore next */ function isInteger(value) {\n    return typeof value === \"number\" && isFinite(value) && Math.floor(value) === value;\n};\n\n/**\n * Tests if the specified value is a string.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a string\n */\nutil.isString = function isString(value) {\n    return typeof value === \"string\" || value instanceof String;\n};\n\n/**\n * Tests if the specified value is a non-null object.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a non-null object\n */\nutil.isObject = function isObject(value) {\n    return value && typeof value === \"object\";\n};\n\n/**\n * Checks if a property on a message is considered to be present.\n * This is an alias of {@link util.isSet}.\n * @function\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isset =\n\n/**\n * Checks if a property on a message is considered to be present.\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isSet = function isSet(obj, prop) {\n    var value = obj[prop];\n    if (value != null && obj.hasOwnProperty(prop)) // eslint-disable-line eqeqeq, no-prototype-builtins\n        return typeof value !== \"object\" || (Array.isArray(value) ? value.length : Object.keys(value).length) > 0;\n    return false;\n};\n\n/**\n * Any compatible Buffer instance.\n * This is a minimal stand-alone definition of a Buffer instance. The actual type is that exported by node's typings.\n * @interface Buffer\n * @extends Uint8Array\n */\n\n/**\n * Node's Buffer class if available.\n * @type {Constructor<Buffer>}\n */\nutil.Buffer = (function() {\n    try {\n        var Buffer = util.inquire(\"buffer\").Buffer;\n        // refuse to use non-node buffers if not explicitly assigned (perf reasons):\n        return Buffer.prototype.utf8Write ? Buffer : /* istanbul ignore next */ null;\n    } catch (e) {\n        /* istanbul ignore next */\n        return null;\n    }\n})();\n\n// Internal alias of or polyfull for Buffer.from.\nutil._Buffer_from = null;\n\n// Internal alias of or polyfill for Buffer.allocUnsafe.\nutil._Buffer_allocUnsafe = null;\n\n/**\n * Creates a new buffer of whatever type supported by the environment.\n * @param {number|number[]} [sizeOrArray=0] Buffer size or number array\n * @returns {Uint8Array|Buffer} Buffer\n */\nutil.newBuffer = function newBuffer(sizeOrArray) {\n    /* istanbul ignore next */\n    return typeof sizeOrArray === \"number\"\n        ? util.Buffer\n            ? util._Buffer_allocUnsafe(sizeOrArray)\n            : new util.Array(sizeOrArray)\n        : util.Buffer\n            ? util._Buffer_from(sizeOrArray)\n            : typeof Uint8Array === \"undefined\"\n                ? sizeOrArray\n                : new Uint8Array(sizeOrArray);\n};\n\n/**\n * Array implementation used in the browser. `Uint8Array` if supported, otherwise `Array`.\n * @type {Constructor<Uint8Array>}\n */\nutil.Array = typeof Uint8Array !== \"undefined\" ? Uint8Array /* istanbul ignore next */ : Array;\n\n/**\n * Any compatible Long instance.\n * This is a minimal stand-alone definition of a Long instance. The actual type is that exported by long.js.\n * @interface Long\n * @property {number} low Low bits\n * @property {number} high High bits\n * @property {boolean} unsigned Whether unsigned or not\n */\n\n/**\n * Long.js's Long class if available.\n * @type {Constructor<Long>}\n */\nutil.Long = /* istanbul ignore next */ util.global.dcodeIO && /* istanbul ignore next */ util.global.dcodeIO.Long\n         || /* istanbul ignore next */ util.global.Long\n         || util.inquire(\"long\");\n\n/**\n * Regular expression used to verify 2 bit (`bool`) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key2Re = /^true|false|0|1$/;\n\n/**\n * Regular expression used to verify 32 bit (`int32` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key32Re = /^-?(?:0|[1-9][0-9]*)$/;\n\n/**\n * Regular expression used to verify 64 bit (`int64` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key64Re = /^(?:[\\\\x00-\\\\xff]{8}|-?(?:0|[1-9][0-9]*))$/;\n\n/**\n * Converts a number or long to an 8 characters long hash string.\n * @param {Long|number} value Value to convert\n * @returns {string} Hash\n */\nutil.longToHash = function longToHash(value) {\n    return value\n        ? util.LongBits.from(value).toHash()\n        : util.LongBits.zeroHash;\n};\n\n/**\n * Converts an 8 characters long hash string to a long or number.\n * @param {string} hash Hash\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long|number} Original value\n */\nutil.longFromHash = function longFromHash(hash, unsigned) {\n    var bits = util.LongBits.fromHash(hash);\n    if (util.Long)\n        return util.Long.fromBits(bits.lo, bits.hi, unsigned);\n    return bits.toNumber(Boolean(unsigned));\n};\n\n/**\n * Merges the properties of the source object into the destination object.\n * @memberof util\n * @param {Object.<string,*>} dst Destination object\n * @param {Object.<string,*>} src Source object\n * @param {boolean} [ifNotSet=false] Merges only if the key is not already set\n * @returns {Object.<string,*>} Destination object\n */\nfunction merge(dst, src, ifNotSet) { // used by converters\n    for (var keys = Object.keys(src), i = 0; i < keys.length; ++i)\n        if (dst[keys[i]] === undefined || !ifNotSet)\n            dst[keys[i]] = src[keys[i]];\n    return dst;\n}\n\nutil.merge = merge;\n\n/**\n * Converts the first character of a string to lower case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.lcFirst = function lcFirst(str) {\n    return str.charAt(0).toLowerCase() + str.substring(1);\n};\n\n/**\n * Creates a custom error constructor.\n * @memberof util\n * @param {string} name Error name\n * @returns {Constructor<Error>} Custom error constructor\n */\nfunction newError(name) {\n\n    function CustomError(message, properties) {\n\n        if (!(this instanceof CustomError))\n            return new CustomError(message, properties);\n\n        // Error.call(this, message);\n        // ^ just returns a new error instance because the ctor can be called as a function\n\n        Object.defineProperty(this, \"message\", { get: function() { return message; } });\n\n        /* istanbul ignore next */\n        if (Error.captureStackTrace) // node\n            Error.captureStackTrace(this, CustomError);\n        else\n            Object.defineProperty(this, \"stack\", { value: new Error().stack || \"\" });\n\n        if (properties)\n            merge(this, properties);\n    }\n\n    (CustomError.prototype = Object.create(Error.prototype)).constructor = CustomError;\n\n    Object.defineProperty(CustomError.prototype, \"name\", { get: function() { return name; } });\n\n    CustomError.prototype.toString = function toString() {\n        return this.name + \": \" + this.message;\n    };\n\n    return CustomError;\n}\n\nutil.newError = newError;\n\n/**\n * Constructs a new protocol error.\n * @classdesc Error subclass indicating a protocol specifc error.\n * @memberof util\n * @extends Error\n * @template T extends Message<T>\n * @constructor\n * @param {string} message Error message\n * @param {Object.<string,*>} [properties] Additional properties\n * @example\n * try {\n *     MyMessage.decode(someBuffer); // throws if required fields are missing\n * } catch (e) {\n *     if (e instanceof ProtocolError && e.instance)\n *         console.log(\"decoded so far: \" + JSON.stringify(e.instance));\n * }\n */\nutil.ProtocolError = newError(\"ProtocolError\");\n\n/**\n * So far decoded message instance.\n * @name util.ProtocolError#instance\n * @type {Message<T>}\n */\n\n/**\n * A OneOf getter as returned by {@link util.oneOfGetter}.\n * @typedef OneOfGetter\n * @type {function}\n * @returns {string|undefined} Set field name, if any\n */\n\n/**\n * Builds a getter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfGetter} Unbound getter\n */\nutil.oneOfGetter = function getOneOf(fieldNames) {\n    var fieldMap = {};\n    for (var i = 0; i < fieldNames.length; ++i)\n        fieldMap[fieldNames[i]] = 1;\n\n    /**\n     * @returns {string|undefined} Set field name, if any\n     * @this Object\n     * @ignore\n     */\n    return function() { // eslint-disable-line consistent-return\n        for (var keys = Object.keys(this), i = keys.length - 1; i > -1; --i)\n            if (fieldMap[keys[i]] === 1 && this[keys[i]] !== undefined && this[keys[i]] !== null)\n                return keys[i];\n    };\n};\n\n/**\n * A OneOf setter as returned by {@link util.oneOfSetter}.\n * @typedef OneOfSetter\n * @type {function}\n * @param {string|undefined} value Field name\n * @returns {undefined}\n */\n\n/**\n * Builds a setter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfSetter} Unbound setter\n */\nutil.oneOfSetter = function setOneOf(fieldNames) {\n\n    /**\n     * @param {string} name Field name\n     * @returns {undefined}\n     * @this Object\n     * @ignore\n     */\n    return function(name) {\n        for (var i = 0; i < fieldNames.length; ++i)\n            if (fieldNames[i] !== name)\n                delete this[fieldNames[i]];\n    };\n};\n\n/**\n * Default conversion options used for {@link Message#toJSON} implementations.\n *\n * These options are close to proto3's JSON mapping with the exception that internal types like Any are handled just like messages. More precisely:\n *\n * - Longs become strings\n * - Enums become string keys\n * - Bytes become base64 encoded strings\n * - (Sub-)Messages become plain objects\n * - Maps become plain objects with all string keys\n * - Repeated fields become arrays\n * - NaN and Infinity for float and double fields become strings\n *\n * @type {IConversionOptions}\n * @see https://developers.google.com/protocol-buffers/docs/proto3?hl=en#json\n */\nutil.toJSONOptions = {\n    longs: String,\n    enums: String,\n    bytes: String,\n    json: true\n};\n\n// Sets up buffer utility according to the environment (called in index-minimal)\nutil._configure = function() {\n    var Buffer = util.Buffer;\n    /* istanbul ignore if */\n    if (!Buffer) {\n        util._Buffer_from = util._Buffer_allocUnsafe = null;\n        return;\n    }\n    // because node 4.x buffers are incompatible & immutable\n    // see: https://github.com/dcodeIO/protobuf.js/pull/665\n    util._Buffer_from = Buffer.from !== Uint8Array.from && Buffer.from ||\n        /* istanbul ignore next */\n        function Buffer_from(value, encoding) {\n            return new Buffer(value, encoding);\n        };\n    util._Buffer_allocUnsafe = Buffer.allocUnsafe ||\n        /* istanbul ignore next */\n        function Buffer_allocUnsafe(size) {\n            return new Buffer(size);\n        };\n};\n","\"use strict\";\r\nmodule.exports = asPromise;\r\n\r\n/**\r\n * Callback as used by {@link util.asPromise}.\r\n * @typedef asPromiseCallback\r\n * @type {function}\r\n * @param {Error|null} error Error, if any\r\n * @param {...*} params Additional arguments\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Returns a promise from a node-style callback function.\r\n * @memberof util\r\n * @param {asPromiseCallback} fn Function to call\r\n * @param {*} ctx Function context\r\n * @param {...*} params Function arguments\r\n * @returns {Promise<*>} Promisified function\r\n */\r\nfunction asPromise(fn, ctx/*, varargs */) {\r\n    var params  = new Array(arguments.length - 1),\r\n        offset  = 0,\r\n        index   = 2,\r\n        pending = true;\r\n    while (index < arguments.length)\r\n        params[offset++] = arguments[index++];\r\n    return new Promise(function executor(resolve, reject) {\r\n        params[offset] = function callback(err/*, varargs */) {\r\n            if (pending) {\r\n                pending = false;\r\n                if (err)\r\n                    reject(err);\r\n                else {\r\n                    var params = new Array(arguments.length - 1),\r\n                        offset = 0;\r\n                    while (offset < params.length)\r\n                        params[offset++] = arguments[offset];\r\n                    resolve.apply(null, params);\r\n                }\r\n            }\r\n        };\r\n        try {\r\n            fn.apply(ctx || null, params);\r\n        } catch (err) {\r\n            if (pending) {\r\n                pending = false;\r\n                reject(err);\r\n            }\r\n        }\r\n    });\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal base64 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar base64 = exports;\r\n\r\n/**\r\n * Calculates the byte length of a base64 encoded string.\r\n * @param {string} string Base64 encoded string\r\n * @returns {number} Byte length\r\n */\r\nbase64.length = function length(string) {\r\n    var p = string.length;\r\n    if (!p)\r\n        return 0;\r\n    var n = 0;\r\n    while (--p % 4 > 1 && string.charAt(p) === \"=\")\r\n        ++n;\r\n    return Math.ceil(string.length * 3) / 4 - n;\r\n};\r\n\r\n// Base64 encoding table\r\nvar b64 = new Array(64);\r\n\r\n// Base64 decoding table\r\nvar s64 = new Array(123);\r\n\r\n// 65..90, 97..122, 48..57, 43, 47\r\nfor (var i = 0; i < 64;)\r\n    s64[b64[i] = i < 26 ? i + 65 : i < 52 ? i + 71 : i < 62 ? i - 4 : i - 59 | 43] = i++;\r\n\r\n/**\r\n * Encodes a buffer to a base64 encoded string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} Base64 encoded string\r\n */\r\nbase64.encode = function encode(buffer, start, end) {\r\n    var parts = null,\r\n        chunk = [];\r\n    var i = 0, // output index\r\n        j = 0, // goto index\r\n        t;     // temporary\r\n    while (start < end) {\r\n        var b = buffer[start++];\r\n        switch (j) {\r\n            case 0:\r\n                chunk[i++] = b64[b >> 2];\r\n                t = (b & 3) << 4;\r\n                j = 1;\r\n                break;\r\n            case 1:\r\n                chunk[i++] = b64[t | b >> 4];\r\n                t = (b & 15) << 2;\r\n                j = 2;\r\n                break;\r\n            case 2:\r\n                chunk[i++] = b64[t | b >> 6];\r\n                chunk[i++] = b64[b & 63];\r\n                j = 0;\r\n                break;\r\n        }\r\n        if (i > 8191) {\r\n            (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n            i = 0;\r\n        }\r\n    }\r\n    if (j) {\r\n        chunk[i++] = b64[t];\r\n        chunk[i++] = 61;\r\n        if (j === 1)\r\n            chunk[i++] = 61;\r\n    }\r\n    if (parts) {\r\n        if (i)\r\n            parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n        return parts.join(\"\");\r\n    }\r\n    return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\nvar invalidEncoding = \"invalid encoding\";\r\n\r\n/**\r\n * Decodes a base64 encoded string to a buffer.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Number of bytes written\r\n * @throws {Error} If encoding is invalid\r\n */\r\nbase64.decode = function decode(string, buffer, offset) {\r\n    var start = offset;\r\n    var j = 0, // goto index\r\n        t;     // temporary\r\n    for (var i = 0; i < string.length;) {\r\n        var c = string.charCodeAt(i++);\r\n        if (c === 61 && j > 1)\r\n            break;\r\n        if ((c = s64[c]) === undefined)\r\n            throw Error(invalidEncoding);\r\n        switch (j) {\r\n            case 0:\r\n                t = c;\r\n                j = 1;\r\n                break;\r\n            case 1:\r\n                buffer[offset++] = t << 2 | (c & 48) >> 4;\r\n                t = c;\r\n                j = 2;\r\n                break;\r\n            case 2:\r\n                buffer[offset++] = (t & 15) << 4 | (c & 60) >> 2;\r\n                t = c;\r\n                j = 3;\r\n                break;\r\n            case 3:\r\n                buffer[offset++] = (t & 3) << 6 | c;\r\n                j = 0;\r\n                break;\r\n        }\r\n    }\r\n    if (j === 1)\r\n        throw Error(invalidEncoding);\r\n    return offset - start;\r\n};\r\n\r\n/**\r\n * Tests if the specified string appears to be base64 encoded.\r\n * @param {string} string String to test\r\n * @returns {boolean} `true` if probably base64 encoded, otherwise false\r\n */\r\nbase64.test = function test(string) {\r\n    return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(string);\r\n};\r\n","\"use strict\";\r\nmodule.exports = EventEmitter;\r\n\r\n/**\r\n * Constructs a new event emitter instance.\r\n * @classdesc A minimal event emitter.\r\n * @memberof util\r\n * @constructor\r\n */\r\nfunction EventEmitter() {\r\n\r\n    /**\r\n     * Registered listeners.\r\n     * @type {Object.<string,*>}\r\n     * @private\r\n     */\r\n    this._listeners = {};\r\n}\r\n\r\n/**\r\n * Registers an event listener.\r\n * @param {string} evt Event name\r\n * @param {function} fn Listener\r\n * @param {*} [ctx] Listener context\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.on = function on(evt, fn, ctx) {\r\n    (this._listeners[evt] || (this._listeners[evt] = [])).push({\r\n        fn  : fn,\r\n        ctx : ctx || this\r\n    });\r\n    return this;\r\n};\r\n\r\n/**\r\n * Removes an event listener or any matching listeners if arguments are omitted.\r\n * @param {string} [evt] Event name. Removes all listeners if omitted.\r\n * @param {function} [fn] Listener to remove. Removes all listeners of `evt` if omitted.\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.off = function off(evt, fn) {\r\n    if (evt === undefined)\r\n        this._listeners = {};\r\n    else {\r\n        if (fn === undefined)\r\n            this._listeners[evt] = [];\r\n        else {\r\n            var listeners = this._listeners[evt];\r\n            for (var i = 0; i < listeners.length;)\r\n                if (listeners[i].fn === fn)\r\n                    listeners.splice(i, 1);\r\n                else\r\n                    ++i;\r\n        }\r\n    }\r\n    return this;\r\n};\r\n\r\n/**\r\n * Emits an event by calling its listeners with the specified arguments.\r\n * @param {string} evt Event name\r\n * @param {...*} args Arguments\r\n * @returns {util.EventEmitter} `this`\r\n */\r\nEventEmitter.prototype.emit = function emit(evt) {\r\n    var listeners = this._listeners[evt];\r\n    if (listeners) {\r\n        var args = [],\r\n            i = 1;\r\n        for (; i < arguments.length;)\r\n            args.push(arguments[i++]);\r\n        for (i = 0; i < listeners.length;)\r\n            listeners[i].fn.apply(listeners[i++].ctx, args);\r\n    }\r\n    return this;\r\n};\r\n","\"use strict\";\r\n\r\nmodule.exports = factory(factory);\r\n\r\n/**\r\n * Reads / writes floats / doubles from / to buffers.\r\n * @name util.float\r\n * @namespace\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using little endian byte order.\r\n * @name util.float.writeFloatLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 32 bit float to a buffer using big endian byte order.\r\n * @name util.float.writeFloatBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using little endian byte order.\r\n * @name util.float.readFloatLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 32 bit float from a buffer using big endian byte order.\r\n * @name util.float.readFloatBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using little endian byte order.\r\n * @name util.float.writeDoubleLE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Writes a 64 bit double to a buffer using big endian byte order.\r\n * @name util.float.writeDoubleBE\r\n * @function\r\n * @param {number} val Value to write\r\n * @param {Uint8Array} buf Target buffer\r\n * @param {number} pos Target buffer offset\r\n * @returns {undefined}\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using little endian byte order.\r\n * @name util.float.readDoubleLE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n/**\r\n * Reads a 64 bit double from a buffer using big endian byte order.\r\n * @name util.float.readDoubleBE\r\n * @function\r\n * @param {Uint8Array} buf Source buffer\r\n * @param {number} pos Source buffer offset\r\n * @returns {number} Value read\r\n */\r\n\r\n// Factory function for the purpose of node-based testing in modified global environments\r\nfunction factory(exports) {\r\n\r\n    // float: typed array\r\n    if (typeof Float32Array !== \"undefined\") (function() {\r\n\r\n        var f32 = new Float32Array([ -0 ]),\r\n            f8b = new Uint8Array(f32.buffer),\r\n            le  = f8b[3] === 128;\r\n\r\n        function writeFloat_f32_cpy(val, buf, pos) {\r\n            f32[0] = val;\r\n            buf[pos    ] = f8b[0];\r\n            buf[pos + 1] = f8b[1];\r\n            buf[pos + 2] = f8b[2];\r\n            buf[pos + 3] = f8b[3];\r\n        }\r\n\r\n        function writeFloat_f32_rev(val, buf, pos) {\r\n            f32[0] = val;\r\n            buf[pos    ] = f8b[3];\r\n            buf[pos + 1] = f8b[2];\r\n            buf[pos + 2] = f8b[1];\r\n            buf[pos + 3] = f8b[0];\r\n        }\r\n\r\n        /* istanbul ignore next */\r\n        exports.writeFloatLE = le ? writeFloat_f32_cpy : writeFloat_f32_rev;\r\n        /* istanbul ignore next */\r\n        exports.writeFloatBE = le ? writeFloat_f32_rev : writeFloat_f32_cpy;\r\n\r\n        function readFloat_f32_cpy(buf, pos) {\r\n            f8b[0] = buf[pos    ];\r\n            f8b[1] = buf[pos + 1];\r\n            f8b[2] = buf[pos + 2];\r\n            f8b[3] = buf[pos + 3];\r\n            return f32[0];\r\n        }\r\n\r\n        function readFloat_f32_rev(buf, pos) {\r\n            f8b[3] = buf[pos    ];\r\n            f8b[2] = buf[pos + 1];\r\n            f8b[1] = buf[pos + 2];\r\n            f8b[0] = buf[pos + 3];\r\n            return f32[0];\r\n        }\r\n\r\n        /* istanbul ignore next */\r\n        exports.readFloatLE = le ? readFloat_f32_cpy : readFloat_f32_rev;\r\n        /* istanbul ignore next */\r\n        exports.readFloatBE = le ? readFloat_f32_rev : readFloat_f32_cpy;\r\n\r\n    // float: ieee754\r\n    })(); else (function() {\r\n\r\n        function writeFloat_ieee754(writeUint, val, buf, pos) {\r\n            var sign = val < 0 ? 1 : 0;\r\n            if (sign)\r\n                val = -val;\r\n            if (val === 0)\r\n                writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos);\r\n            else if (isNaN(val))\r\n                writeUint(2143289344, buf, pos);\r\n            else if (val > 3.4028234663852886e+38) // +-Infinity\r\n                writeUint((sign << 31 | 2139095040) >>> 0, buf, pos);\r\n            else if (val < 1.1754943508222875e-38) // denormal\r\n                writeUint((sign << 31 | Math.round(val / 1.401298464324817e-45)) >>> 0, buf, pos);\r\n            else {\r\n                var exponent = Math.floor(Math.log(val) / Math.LN2),\r\n                    mantissa = Math.round(val * Math.pow(2, -exponent) * 8388608) & 8388607;\r\n                writeUint((sign << 31 | exponent + 127 << 23 | mantissa) >>> 0, buf, pos);\r\n            }\r\n        }\r\n\r\n        exports.writeFloatLE = writeFloat_ieee754.bind(null, writeUintLE);\r\n        exports.writeFloatBE = writeFloat_ieee754.bind(null, writeUintBE);\r\n\r\n        function readFloat_ieee754(readUint, buf, pos) {\r\n            var uint = readUint(buf, pos),\r\n                sign = (uint >> 31) * 2 + 1,\r\n                exponent = uint >>> 23 & 255,\r\n                mantissa = uint & 8388607;\r\n            return exponent === 255\r\n                ? mantissa\r\n                ? NaN\r\n                : sign * Infinity\r\n                : exponent === 0 // denormal\r\n                ? sign * 1.401298464324817e-45 * mantissa\r\n                : sign * Math.pow(2, exponent - 150) * (mantissa + 8388608);\r\n        }\r\n\r\n        exports.readFloatLE = readFloat_ieee754.bind(null, readUintLE);\r\n        exports.readFloatBE = readFloat_ieee754.bind(null, readUintBE);\r\n\r\n    })();\r\n\r\n    // double: typed array\r\n    if (typeof Float64Array !== \"undefined\") (function() {\r\n\r\n        var f64 = new Float64Array([-0]),\r\n            f8b = new Uint8Array(f64.buffer),\r\n            le  = f8b[7] === 128;\r\n\r\n        function writeDouble_f64_cpy(val, buf, pos) {\r\n            f64[0] = val;\r\n            buf[pos    ] = f8b[0];\r\n            buf[pos + 1] = f8b[1];\r\n            buf[pos + 2] = f8b[2];\r\n            buf[pos + 3] = f8b[3];\r\n            buf[pos + 4] = f8b[4];\r\n            buf[pos + 5] = f8b[5];\r\n            buf[pos + 6] = f8b[6];\r\n            buf[pos + 7] = f8b[7];\r\n        }\r\n\r\n        function writeDouble_f64_rev(val, buf, pos) {\r\n            f64[0] = val;\r\n            buf[pos    ] = f8b[7];\r\n            buf[pos + 1] = f8b[6];\r\n            buf[pos + 2] = f8b[5];\r\n            buf[pos + 3] = f8b[4];\r\n            buf[pos + 4] = f8b[3];\r\n            buf[pos + 5] = f8b[2];\r\n            buf[pos + 6] = f8b[1];\r\n            buf[pos + 7] = f8b[0];\r\n        }\r\n\r\n        /* istanbul ignore next */\r\n        exports.writeDoubleLE = le ? writeDouble_f64_cpy : writeDouble_f64_rev;\r\n        /* istanbul ignore next */\r\n        exports.writeDoubleBE = le ? writeDouble_f64_rev : writeDouble_f64_cpy;\r\n\r\n        function readDouble_f64_cpy(buf, pos) {\r\n            f8b[0] = buf[pos    ];\r\n            f8b[1] = buf[pos + 1];\r\n            f8b[2] = buf[pos + 2];\r\n            f8b[3] = buf[pos + 3];\r\n            f8b[4] = buf[pos + 4];\r\n            f8b[5] = buf[pos + 5];\r\n            f8b[6] = buf[pos + 6];\r\n            f8b[7] = buf[pos + 7];\r\n            return f64[0];\r\n        }\r\n\r\n        function readDouble_f64_rev(buf, pos) {\r\n            f8b[7] = buf[pos    ];\r\n            f8b[6] = buf[pos + 1];\r\n            f8b[5] = buf[pos + 2];\r\n            f8b[4] = buf[pos + 3];\r\n            f8b[3] = buf[pos + 4];\r\n            f8b[2] = buf[pos + 5];\r\n            f8b[1] = buf[pos + 6];\r\n            f8b[0] = buf[pos + 7];\r\n            return f64[0];\r\n        }\r\n\r\n        /* istanbul ignore next */\r\n        exports.readDoubleLE = le ? readDouble_f64_cpy : readDouble_f64_rev;\r\n        /* istanbul ignore next */\r\n        exports.readDoubleBE = le ? readDouble_f64_rev : readDouble_f64_cpy;\r\n\r\n    // double: ieee754\r\n    })(); else (function() {\r\n\r\n        function writeDouble_ieee754(writeUint, off0, off1, val, buf, pos) {\r\n            var sign = val < 0 ? 1 : 0;\r\n            if (sign)\r\n                val = -val;\r\n            if (val === 0) {\r\n                writeUint(0, buf, pos + off0);\r\n                writeUint(1 / val > 0 ? /* positive */ 0 : /* negative 0 */ 2147483648, buf, pos + off1);\r\n            } else if (isNaN(val)) {\r\n                writeUint(0, buf, pos + off0);\r\n                writeUint(2146959360, buf, pos + off1);\r\n            } else if (val > 1.7976931348623157e+308) { // +-Infinity\r\n                writeUint(0, buf, pos + off0);\r\n                writeUint((sign << 31 | 2146435072) >>> 0, buf, pos + off1);\r\n            } else {\r\n                var mantissa;\r\n                if (val < 2.2250738585072014e-308) { // denormal\r\n                    mantissa = val / 5e-324;\r\n                    writeUint(mantissa >>> 0, buf, pos + off0);\r\n                    writeUint((sign << 31 | mantissa / 4294967296) >>> 0, buf, pos + off1);\r\n                } else {\r\n                    var exponent = Math.floor(Math.log(val) / Math.LN2);\r\n                    if (exponent === 1024)\r\n                        exponent = 1023;\r\n                    mantissa = val * Math.pow(2, -exponent);\r\n                    writeUint(mantissa * 4503599627370496 >>> 0, buf, pos + off0);\r\n                    writeUint((sign << 31 | exponent + 1023 << 20 | mantissa * 1048576 & 1048575) >>> 0, buf, pos + off1);\r\n                }\r\n            }\r\n        }\r\n\r\n        exports.writeDoubleLE = writeDouble_ieee754.bind(null, writeUintLE, 0, 4);\r\n        exports.writeDoubleBE = writeDouble_ieee754.bind(null, writeUintBE, 4, 0);\r\n\r\n        function readDouble_ieee754(readUint, off0, off1, buf, pos) {\r\n            var lo = readUint(buf, pos + off0),\r\n                hi = readUint(buf, pos + off1);\r\n            var sign = (hi >> 31) * 2 + 1,\r\n                exponent = hi >>> 20 & 2047,\r\n                mantissa = 4294967296 * (hi & 1048575) + lo;\r\n            return exponent === 2047\r\n                ? mantissa\r\n                ? NaN\r\n                : sign * Infinity\r\n                : exponent === 0 // denormal\r\n                ? sign * 5e-324 * mantissa\r\n                : sign * Math.pow(2, exponent - 1075) * (mantissa + 4503599627370496);\r\n        }\r\n\r\n        exports.readDoubleLE = readDouble_ieee754.bind(null, readUintLE, 0, 4);\r\n        exports.readDoubleBE = readDouble_ieee754.bind(null, readUintBE, 4, 0);\r\n\r\n    })();\r\n\r\n    return exports;\r\n}\r\n\r\n// uint helpers\r\n\r\nfunction writeUintLE(val, buf, pos) {\r\n    buf[pos    ] =  val        & 255;\r\n    buf[pos + 1] =  val >>> 8  & 255;\r\n    buf[pos + 2] =  val >>> 16 & 255;\r\n    buf[pos + 3] =  val >>> 24;\r\n}\r\n\r\nfunction writeUintBE(val, buf, pos) {\r\n    buf[pos    ] =  val >>> 24;\r\n    buf[pos + 1] =  val >>> 16 & 255;\r\n    buf[pos + 2] =  val >>> 8  & 255;\r\n    buf[pos + 3] =  val        & 255;\r\n}\r\n\r\nfunction readUintLE(buf, pos) {\r\n    return (buf[pos    ]\r\n          | buf[pos + 1] << 8\r\n          | buf[pos + 2] << 16\r\n          | buf[pos + 3] << 24) >>> 0;\r\n}\r\n\r\nfunction readUintBE(buf, pos) {\r\n    return (buf[pos    ] << 24\r\n          | buf[pos + 1] << 16\r\n          | buf[pos + 2] << 8\r\n          | buf[pos + 3]) >>> 0;\r\n}\r\n","\"use strict\";\r\nmodule.exports = inquire;\r\n\r\n/**\r\n * Requires a module only if available.\r\n * @memberof util\r\n * @param {string} moduleName Module to require\r\n * @returns {?Object} Required module if available and not empty, otherwise `null`\r\n */\r\nfunction inquire(moduleName) {\r\n    try {\r\n        var mod = eval(\"quire\".replace(/^/,\"re\"))(moduleName); // eslint-disable-line no-eval\r\n        if (mod && (mod.length || Object.keys(mod).length))\r\n            return mod;\r\n    } catch (e) {} // eslint-disable-line no-empty\r\n    return null;\r\n}\r\n","\"use strict\";\r\n\r\n/**\r\n * A minimal UTF8 implementation for number arrays.\r\n * @memberof util\r\n * @namespace\r\n */\r\nvar utf8 = exports;\r\n\r\n/**\r\n * Calculates the UTF8 byte length of a string.\r\n * @param {string} string String\r\n * @returns {number} Byte length\r\n */\r\nutf8.length = function utf8_length(string) {\r\n    var len = 0,\r\n        c = 0;\r\n    for (var i = 0; i < string.length; ++i) {\r\n        c = string.charCodeAt(i);\r\n        if (c < 128)\r\n            len += 1;\r\n        else if (c < 2048)\r\n            len += 2;\r\n        else if ((c & 0xFC00) === 0xD800 && (string.charCodeAt(i + 1) & 0xFC00) === 0xDC00) {\r\n            ++i;\r\n            len += 4;\r\n        } else\r\n            len += 3;\r\n    }\r\n    return len;\r\n};\r\n\r\n/**\r\n * Reads UTF8 bytes as a string.\r\n * @param {Uint8Array} buffer Source buffer\r\n * @param {number} start Source start\r\n * @param {number} end Source end\r\n * @returns {string} String read\r\n */\r\nutf8.read = function utf8_read(buffer, start, end) {\r\n    var len = end - start;\r\n    if (len < 1)\r\n        return \"\";\r\n    var parts = null,\r\n        chunk = [],\r\n        i = 0, // char offset\r\n        t;     // temporary\r\n    while (start < end) {\r\n        t = buffer[start++];\r\n        if (t < 128)\r\n            chunk[i++] = t;\r\n        else if (t > 191 && t < 224)\r\n            chunk[i++] = (t & 31) << 6 | buffer[start++] & 63;\r\n        else if (t > 239 && t < 365) {\r\n            t = ((t & 7) << 18 | (buffer[start++] & 63) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63) - 0x10000;\r\n            chunk[i++] = 0xD800 + (t >> 10);\r\n            chunk[i++] = 0xDC00 + (t & 1023);\r\n        } else\r\n            chunk[i++] = (t & 15) << 12 | (buffer[start++] & 63) << 6 | buffer[start++] & 63;\r\n        if (i > 8191) {\r\n            (parts || (parts = [])).push(String.fromCharCode.apply(String, chunk));\r\n            i = 0;\r\n        }\r\n    }\r\n    if (parts) {\r\n        if (i)\r\n            parts.push(String.fromCharCode.apply(String, chunk.slice(0, i)));\r\n        return parts.join(\"\");\r\n    }\r\n    return String.fromCharCode.apply(String, chunk.slice(0, i));\r\n};\r\n\r\n/**\r\n * Writes a string as UTF8 bytes.\r\n * @param {string} string Source string\r\n * @param {Uint8Array} buffer Destination buffer\r\n * @param {number} offset Destination offset\r\n * @returns {number} Bytes written\r\n */\r\nutf8.write = function utf8_write(string, buffer, offset) {\r\n    var start = offset,\r\n        c1, // character 1\r\n        c2; // character 2\r\n    for (var i = 0; i < string.length; ++i) {\r\n        c1 = string.charCodeAt(i);\r\n        if (c1 < 128) {\r\n            buffer[offset++] = c1;\r\n        } else if (c1 < 2048) {\r\n            buffer[offset++] = c1 >> 6       | 192;\r\n            buffer[offset++] = c1       & 63 | 128;\r\n        } else if ((c1 & 0xFC00) === 0xD800 && ((c2 = string.charCodeAt(i + 1)) & 0xFC00) === 0xDC00) {\r\n            c1 = 0x10000 + ((c1 & 0x03FF) << 10) + (c2 & 0x03FF);\r\n            ++i;\r\n            buffer[offset++] = c1 >> 18      | 240;\r\n            buffer[offset++] = c1 >> 12 & 63 | 128;\r\n            buffer[offset++] = c1 >> 6  & 63 | 128;\r\n            buffer[offset++] = c1       & 63 | 128;\r\n        } else {\r\n            buffer[offset++] = c1 >> 12      | 224;\r\n            buffer[offset++] = c1 >> 6  & 63 | 128;\r\n            buffer[offset++] = c1       & 63 | 128;\r\n        }\r\n    }\r\n    return offset - start;\r\n};\r\n","\"use strict\";\r\nmodule.exports = pool;\r\n\r\n/**\r\n * An allocator as used by {@link util.pool}.\r\n * @typedef PoolAllocator\r\n * @type {function}\r\n * @param {number} size Buffer size\r\n * @returns {Uint8Array} Buffer\r\n */\r\n\r\n/**\r\n * A slicer as used by {@link util.pool}.\r\n * @typedef PoolSlicer\r\n * @type {function}\r\n * @param {number} start Start offset\r\n * @param {number} end End offset\r\n * @returns {Uint8Array} Buffer slice\r\n * @this {Uint8Array}\r\n */\r\n\r\n/**\r\n * A general purpose buffer pool.\r\n * @memberof util\r\n * @function\r\n * @param {PoolAllocator} alloc Allocator\r\n * @param {PoolSlicer} slice Slicer\r\n * @param {number} [size=8192] Slab size\r\n * @returns {PoolAllocator} Pooled allocator\r\n */\r\nfunction pool(alloc, slice, size) {\r\n    var SIZE   = size || 8192;\r\n    var MAX    = SIZE >>> 1;\r\n    var slab   = null;\r\n    var offset = SIZE;\r\n    return function pool_alloc(size) {\r\n        if (size < 1 || size > MAX)\r\n            return alloc(size);\r\n        if (offset + size > SIZE) {\r\n            slab = alloc(SIZE);\r\n            offset = 0;\r\n        }\r\n        var buf = slice.call(slab, offset, offset += size);\r\n        if (offset & 7) // align to 32 bit\r\n            offset = (offset | 7) + 1;\r\n        return buf;\r\n    };\r\n}\r\n","\"use strict\";\nmodule.exports = LongBits;\n\nvar util = require(\"../util/minimal\");\n\n/**\n * Constructs new long bits.\n * @classdesc Helper class for working with the low and high bits of a 64 bit value.\n * @memberof util\n * @constructor\n * @param {number} lo Low 32 bits, unsigned\n * @param {number} hi High 32 bits, unsigned\n */\nfunction LongBits(lo, hi) {\n\n    // note that the casts below are theoretically unnecessary as of today, but older statically\n    // generated converter code might still call the ctor with signed 32bits. kept for compat.\n\n    /**\n     * Low bits.\n     * @type {number}\n     */\n    this.lo = lo >>> 0;\n\n    /**\n     * High bits.\n     * @type {number}\n     */\n    this.hi = hi >>> 0;\n}\n\n/**\n * Zero bits.\n * @memberof util.LongBits\n * @type {util.LongBits}\n */\nvar zero = LongBits.zero = new LongBits(0, 0);\n\nzero.toNumber = function() { return 0; };\nzero.zzEncode = zero.zzDecode = function() { return this; };\nzero.length = function() { return 1; };\n\n/**\n * Zero hash.\n * @memberof util.LongBits\n * @type {string}\n */\nvar zeroHash = LongBits.zeroHash = \"\\0\\0\\0\\0\\0\\0\\0\\0\";\n\n/**\n * Constructs new long bits from the specified number.\n * @param {number} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.fromNumber = function fromNumber(value) {\n    if (value === 0)\n        return zero;\n    var sign = value < 0;\n    if (sign)\n        value = -value;\n    var lo = value >>> 0,\n        hi = (value - lo) / 4294967296 >>> 0;\n    if (sign) {\n        hi = ~hi >>> 0;\n        lo = ~lo >>> 0;\n        if (++lo > 4294967295) {\n            lo = 0;\n            if (++hi > 4294967295)\n                hi = 0;\n        }\n    }\n    return new LongBits(lo, hi);\n};\n\n/**\n * Constructs new long bits from a number, long or string.\n * @param {Long|number|string} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.from = function from(value) {\n    if (typeof value === \"number\")\n        return LongBits.fromNumber(value);\n    if (util.isString(value)) {\n        /* istanbul ignore else */\n        if (util.Long)\n            value = util.Long.fromString(value);\n        else\n            return LongBits.fromNumber(parseInt(value, 10));\n    }\n    return value.low || value.high ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;\n};\n\n/**\n * Converts this long bits to a possibly unsafe JavaScript number.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {number} Possibly unsafe number\n */\nLongBits.prototype.toNumber = function toNumber(unsigned) {\n    if (!unsigned && this.hi >>> 31) {\n        var lo = ~this.lo + 1 >>> 0,\n            hi = ~this.hi     >>> 0;\n        if (!lo)\n            hi = hi + 1 >>> 0;\n        return -(lo + hi * 4294967296);\n    }\n    return this.lo + this.hi * 4294967296;\n};\n\n/**\n * Converts this long bits to a long.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long} Long\n */\nLongBits.prototype.toLong = function toLong(unsigned) {\n    return util.Long\n        ? new util.Long(this.lo | 0, this.hi | 0, Boolean(unsigned))\n        /* istanbul ignore next */\n        : { low: this.lo | 0, high: this.hi | 0, unsigned: Boolean(unsigned) };\n};\n\nvar charCodeAt = String.prototype.charCodeAt;\n\n/**\n * Constructs new long bits from the specified 8 characters long hash.\n * @param {string} hash Hash\n * @returns {util.LongBits} Bits\n */\nLongBits.fromHash = function fromHash(hash) {\n    if (hash === zeroHash)\n        return zero;\n    return new LongBits(\n        ( charCodeAt.call(hash, 0)\n        | charCodeAt.call(hash, 1) << 8\n        | charCodeAt.call(hash, 2) << 16\n        | charCodeAt.call(hash, 3) << 24) >>> 0\n    ,\n        ( charCodeAt.call(hash, 4)\n        | charCodeAt.call(hash, 5) << 8\n        | charCodeAt.call(hash, 6) << 16\n        | charCodeAt.call(hash, 7) << 24) >>> 0\n    );\n};\n\n/**\n * Converts this long bits to a 8 characters long hash.\n * @returns {string} Hash\n */\nLongBits.prototype.toHash = function toHash() {\n    return String.fromCharCode(\n        this.lo        & 255,\n        this.lo >>> 8  & 255,\n        this.lo >>> 16 & 255,\n        this.lo >>> 24      ,\n        this.hi        & 255,\n        this.hi >>> 8  & 255,\n        this.hi >>> 16 & 255,\n        this.hi >>> 24\n    );\n};\n\n/**\n * Zig-zag encodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzEncode = function zzEncode() {\n    var mask =   this.hi >> 31;\n    this.hi  = ((this.hi << 1 | this.lo >>> 31) ^ mask) >>> 0;\n    this.lo  = ( this.lo << 1                   ^ mask) >>> 0;\n    return this;\n};\n\n/**\n * Zig-zag decodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzDecode = function zzDecode() {\n    var mask = -(this.lo & 1);\n    this.lo  = ((this.lo >>> 1 | this.hi << 31) ^ mask) >>> 0;\n    this.hi  = ( this.hi >>> 1                  ^ mask) >>> 0;\n    return this;\n};\n\n/**\n * Calculates the length of this longbits when encoded as a varint.\n * @returns {number} Length\n */\nLongBits.prototype.length = function length() {\n    var part0 =  this.lo,\n        part1 = (this.lo >>> 28 | this.hi << 4) >>> 0,\n        part2 =  this.hi >>> 24;\n    return part2 === 0\n         ? part1 === 0\n           ? part0 < 16384\n             ? part0 < 128 ? 1 : 2\n             : part0 < 2097152 ? 3 : 4\n           : part1 < 16384\n             ? part1 < 128 ? 5 : 6\n             : part1 < 2097152 ? 7 : 8\n         : part2 < 128 ? 9 : 10;\n};\n","\"use strict\";\nmodule.exports = BufferWriter;\n\n// extends Writer\nvar Writer = require(\"./writer\");\n(BufferWriter.prototype = Object.create(Writer.prototype)).constructor = BufferWriter;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new buffer writer instance.\n * @classdesc Wire format writer using node buffers.\n * @extends Writer\n * @constructor\n */\nfunction BufferWriter() {\n    Writer.call(this);\n}\n\nBufferWriter._configure = function () {\n    /**\n     * Allocates a buffer of the specified size.\n     * @function\n     * @param {number} size Buffer size\n     * @returns {Buffer} Buffer\n     */\n    BufferWriter.alloc = util._Buffer_allocUnsafe;\n\n    BufferWriter.writeBytesBuffer = util.Buffer && util.Buffer.prototype instanceof Uint8Array && util.Buffer.prototype.set.name === \"set\"\n        ? function writeBytesBuffer_set(val, buf, pos) {\n          buf.set(val, pos); // faster than copy (requires node >= 4 where Buffers extend Uint8Array and set is properly inherited)\n          // also works for plain array values\n        }\n        /* istanbul ignore next */\n        : function writeBytesBuffer_copy(val, buf, pos) {\n          if (val.copy) // Buffer values\n            val.copy(buf, pos, 0, val.length);\n          else for (var i = 0; i < val.length;) // plain array values\n            buf[pos++] = val[i++];\n        };\n};\n\n\n/**\n * @override\n */\nBufferWriter.prototype.bytes = function write_bytes_buffer(value) {\n    if (util.isString(value))\n        value = util._Buffer_from(value, \"base64\");\n    var len = value.length >>> 0;\n    this.uint32(len);\n    if (len)\n        this._push(BufferWriter.writeBytesBuffer, len, value);\n    return this;\n};\n\nfunction writeStringBuffer(val, buf, pos) {\n    if (val.length < 40) // plain js is faster for short strings (probably due to redundant assertions)\n        util.utf8.write(val, buf, pos);\n    else if (buf.utf8Write)\n        buf.utf8Write(val, pos);\n    else\n        buf.write(val, pos);\n}\n\n/**\n * @override\n */\nBufferWriter.prototype.string = function write_string_buffer(value) {\n    var len = util.Buffer.byteLength(value);\n    this.uint32(len);\n    if (len)\n        this._push(writeStringBuffer, len, value);\n    return this;\n};\n\n\n/**\n * Finishes the write operation.\n * @name BufferWriter#finish\n * @function\n * @returns {Buffer} Finished buffer\n */\n\nBufferWriter._configure();\n","\"use strict\";\nmodule.exports = Reader;\n\nvar util      = require(\"./util/minimal\");\n\nvar BufferReader; // cyclic\n\nvar LongBits  = util.LongBits,\n    utf8      = util.utf8;\n\n/* istanbul ignore next */\nfunction indexOutOfRange(reader, writeLength) {\n    return RangeError(\"index out of range: \" + reader.pos + \" + \" + (writeLength || 1) + \" > \" + reader.len);\n}\n\n/**\n * Constructs a new reader instance using the specified buffer.\n * @classdesc Wire format reader using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n * @param {Uint8Array} buffer Buffer to read from\n */\nfunction Reader(buffer) {\n\n    /**\n     * Read buffer.\n     * @type {Uint8Array}\n     */\n    this.buf = buffer;\n\n    /**\n     * Read buffer position.\n     * @type {number}\n     */\n    this.pos = 0;\n\n    /**\n     * Read buffer length.\n     * @type {number}\n     */\n    this.len = buffer.length;\n}\n\nvar create_array = typeof Uint8Array !== \"undefined\"\n    ? function create_typed_array(buffer) {\n        if (buffer instanceof Uint8Array || Array.isArray(buffer))\n            return new Reader(buffer);\n        throw Error(\"illegal buffer\");\n    }\n    /* istanbul ignore next */\n    : function create_array(buffer) {\n        if (Array.isArray(buffer))\n            return new Reader(buffer);\n        throw Error(\"illegal buffer\");\n    };\n\nvar create = function create() {\n    return util.Buffer\n        ? function create_buffer_setup(buffer) {\n            return (Reader.create = function create_buffer(buffer) {\n                return util.Buffer.isBuffer(buffer)\n                    ? new BufferReader(buffer)\n                    /* istanbul ignore next */\n                    : create_array(buffer);\n            })(buffer);\n        }\n        /* istanbul ignore next */\n        : create_array;\n};\n\n/**\n * Creates a new reader using the specified buffer.\n * @function\n * @param {Uint8Array|Buffer} buffer Buffer to read from\n * @returns {Reader|BufferReader} A {@link BufferReader} if `buffer` is a Buffer, otherwise a {@link Reader}\n * @throws {Error} If `buffer` is not a valid buffer\n */\nReader.create = create();\n\nReader.prototype._slice = util.Array.prototype.subarray || /* istanbul ignore next */ util.Array.prototype.slice;\n\n/**\n * Reads a varint as an unsigned 32 bit value.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.uint32 = (function read_uint32_setup() {\n    var value = 4294967295; // optimizer type-hint, tends to deopt otherwise (?!)\n    return function read_uint32() {\n        value = (         this.buf[this.pos] & 127       ) >>> 0; if (this.buf[this.pos++] < 128) return value;\n        value = (value | (this.buf[this.pos] & 127) <<  7) >>> 0; if (this.buf[this.pos++] < 128) return value;\n        value = (value | (this.buf[this.pos] & 127) << 14) >>> 0; if (this.buf[this.pos++] < 128) return value;\n        value = (value | (this.buf[this.pos] & 127) << 21) >>> 0; if (this.buf[this.pos++] < 128) return value;\n        value = (value | (this.buf[this.pos] &  15) << 28) >>> 0; if (this.buf[this.pos++] < 128) return value;\n\n        /* istanbul ignore if */\n        if ((this.pos += 5) > this.len) {\n            this.pos = this.len;\n            throw indexOutOfRange(this, 10);\n        }\n        return value;\n    };\n})();\n\n/**\n * Reads a varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.int32 = function read_int32() {\n    return this.uint32() | 0;\n};\n\n/**\n * Reads a zig-zag encoded varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.sint32 = function read_sint32() {\n    var value = this.uint32();\n    return value >>> 1 ^ -(value & 1) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readLongVarint() {\n    // tends to deopt with local vars for octet etc.\n    var bits = new LongBits(0, 0);\n    var i = 0;\n    if (this.len - this.pos > 4) { // fast route (lo)\n        for (; i < 4; ++i) {\n            // 1st..4th\n            bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n            if (this.buf[this.pos++] < 128)\n                return bits;\n        }\n        // 5th\n        bits.lo = (bits.lo | (this.buf[this.pos] & 127) << 28) >>> 0;\n        bits.hi = (bits.hi | (this.buf[this.pos] & 127) >>  4) >>> 0;\n        if (this.buf[this.pos++] < 128)\n            return bits;\n        i = 0;\n    } else {\n        for (; i < 3; ++i) {\n            /* istanbul ignore if */\n            if (this.pos >= this.len)\n                throw indexOutOfRange(this);\n            // 1st..3th\n            bits.lo = (bits.lo | (this.buf[this.pos] & 127) << i * 7) >>> 0;\n            if (this.buf[this.pos++] < 128)\n                return bits;\n        }\n        // 4th\n        bits.lo = (bits.lo | (this.buf[this.pos++] & 127) << i * 7) >>> 0;\n        return bits;\n    }\n    if (this.len - this.pos > 4) { // fast route (hi)\n        for (; i < 5; ++i) {\n            // 6th..10th\n            bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n            if (this.buf[this.pos++] < 128)\n                return bits;\n        }\n    } else {\n        for (; i < 5; ++i) {\n            /* istanbul ignore if */\n            if (this.pos >= this.len)\n                throw indexOutOfRange(this);\n            // 6th..10th\n            bits.hi = (bits.hi | (this.buf[this.pos] & 127) << i * 7 + 3) >>> 0;\n            if (this.buf[this.pos++] < 128)\n                return bits;\n        }\n    }\n    /* istanbul ignore next */\n    throw Error(\"invalid varint encoding\");\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads a varint as a signed 64 bit value.\n * @name Reader#int64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as an unsigned 64 bit value.\n * @name Reader#uint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a zig-zag encoded varint as a signed 64 bit value.\n * @name Reader#sint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as a boolean.\n * @returns {boolean} Value read\n */\nReader.prototype.bool = function read_bool() {\n    return this.uint32() !== 0;\n};\n\nfunction readFixed32_end(buf, end) { // note that this uses `end`, not `pos`\n    return (buf[end - 4]\n          | buf[end - 3] << 8\n          | buf[end - 2] << 16\n          | buf[end - 1] << 24) >>> 0;\n}\n\n/**\n * Reads fixed 32 bits as an unsigned 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.fixed32 = function read_fixed32() {\n\n    /* istanbul ignore if */\n    if (this.pos + 4 > this.len)\n        throw indexOutOfRange(this, 4);\n\n    return readFixed32_end(this.buf, this.pos += 4);\n};\n\n/**\n * Reads fixed 32 bits as a signed 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.sfixed32 = function read_sfixed32() {\n\n    /* istanbul ignore if */\n    if (this.pos + 4 > this.len)\n        throw indexOutOfRange(this, 4);\n\n    return readFixed32_end(this.buf, this.pos += 4) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readFixed64(/* this: Reader */) {\n\n    /* istanbul ignore if */\n    if (this.pos + 8 > this.len)\n        throw indexOutOfRange(this, 8);\n\n    return new LongBits(readFixed32_end(this.buf, this.pos += 4), readFixed32_end(this.buf, this.pos += 4));\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads fixed 64 bits.\n * @name Reader#fixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads zig-zag encoded fixed 64 bits.\n * @name Reader#sfixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a float (32 bit) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.float = function read_float() {\n\n    /* istanbul ignore if */\n    if (this.pos + 4 > this.len)\n        throw indexOutOfRange(this, 4);\n\n    var value = util.float.readFloatLE(this.buf, this.pos);\n    this.pos += 4;\n    return value;\n};\n\n/**\n * Reads a double (64 bit float) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.double = function read_double() {\n\n    /* istanbul ignore if */\n    if (this.pos + 8 > this.len)\n        throw indexOutOfRange(this, 4);\n\n    var value = util.float.readDoubleLE(this.buf, this.pos);\n    this.pos += 8;\n    return value;\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @returns {Uint8Array} Value read\n */\nReader.prototype.bytes = function read_bytes() {\n    var length = this.uint32(),\n        start  = this.pos,\n        end    = this.pos + length;\n\n    /* istanbul ignore if */\n    if (end > this.len)\n        throw indexOutOfRange(this, length);\n\n    this.pos += length;\n    if (Array.isArray(this.buf)) // plain array\n        return this.buf.slice(start, end);\n    return start === end // fix for IE 10/Win8 and others' subarray returning array of size 1\n        ? new this.buf.constructor(0)\n        : this._slice.call(this.buf, start, end);\n};\n\n/**\n * Reads a string preceeded by its byte length as a varint.\n * @returns {string} Value read\n */\nReader.prototype.string = function read_string() {\n    var bytes = this.bytes();\n    return utf8.read(bytes, 0, bytes.length);\n};\n\n/**\n * Skips the specified number of bytes if specified, otherwise skips a varint.\n * @param {number} [length] Length if known, otherwise a varint is assumed\n * @returns {Reader} `this`\n */\nReader.prototype.skip = function skip(length) {\n    if (typeof length === \"number\") {\n        /* istanbul ignore if */\n        if (this.pos + length > this.len)\n            throw indexOutOfRange(this, length);\n        this.pos += length;\n    } else {\n        do {\n            /* istanbul ignore if */\n            if (this.pos >= this.len)\n                throw indexOutOfRange(this);\n        } while (this.buf[this.pos++] & 128);\n    }\n    return this;\n};\n\n/**\n * Skips the next element of the specified wire type.\n * @param {number} wireType Wire type received\n * @returns {Reader} `this`\n */\nReader.prototype.skipType = function(wireType) {\n    switch (wireType) {\n        case 0:\n            this.skip();\n            break;\n        case 1:\n            this.skip(8);\n            break;\n        case 2:\n            this.skip(this.uint32());\n            break;\n        case 3:\n            while ((wireType = this.uint32() & 7) !== 4) {\n                this.skipType(wireType);\n            }\n            break;\n        case 5:\n            this.skip(4);\n            break;\n\n        /* istanbul ignore next */\n        default:\n            throw Error(\"invalid wire type \" + wireType + \" at offset \" + this.pos);\n    }\n    return this;\n};\n\nReader._configure = function(BufferReader_) {\n    BufferReader = BufferReader_;\n    Reader.create = create();\n    BufferReader._configure();\n\n    var fn = util.Long ? \"toLong\" : /* istanbul ignore next */ \"toNumber\";\n    util.merge(Reader.prototype, {\n\n        int64: function read_int64() {\n            return readLongVarint.call(this)[fn](false);\n        },\n\n        uint64: function read_uint64() {\n            return readLongVarint.call(this)[fn](true);\n        },\n\n        sint64: function read_sint64() {\n            return readLongVarint.call(this).zzDecode()[fn](false);\n        },\n\n        fixed64: function read_fixed64() {\n            return readFixed64.call(this)[fn](true);\n        },\n\n        sfixed64: function read_sfixed64() {\n            return readFixed64.call(this)[fn](false);\n        }\n\n    });\n};\n","\"use strict\";\nmodule.exports = BufferReader;\n\n// extends Reader\nvar Reader = require(\"./reader\");\n(BufferReader.prototype = Object.create(Reader.prototype)).constructor = BufferReader;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new buffer reader instance.\n * @classdesc Wire format reader using node buffers.\n * @extends Reader\n * @constructor\n * @param {Buffer} buffer Buffer to read from\n */\nfunction BufferReader(buffer) {\n    Reader.call(this, buffer);\n\n    /**\n     * Read buffer.\n     * @name BufferReader#buf\n     * @type {Buffer}\n     */\n}\n\nBufferReader._configure = function () {\n    /* istanbul ignore else */\n    if (util.Buffer)\n        BufferReader.prototype._slice = util.Buffer.prototype.slice;\n};\n\n\n/**\n * @override\n */\nBufferReader.prototype.string = function read_string_buffer() {\n    var len = this.uint32(); // modifies pos\n    return this.buf.utf8Slice\n        ? this.buf.utf8Slice(this.pos, this.pos = Math.min(this.pos + len, this.len))\n        : this.buf.toString(\"utf-8\", this.pos, this.pos = Math.min(this.pos + len, this.len));\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @name BufferReader#bytes\n * @function\n * @returns {Buffer} Value read\n */\n\nBufferReader._configure();\n","\"use strict\";\n\n/**\n * Streaming RPC helpers.\n * @namespace\n */\nvar rpc = exports;\n\n/**\n * RPC implementation passed to {@link Service#create} performing a service request on network level, i.e. by utilizing http requests or websockets.\n * @typedef RPCImpl\n * @type {function}\n * @param {Method|rpc.ServiceMethod<Message<{}>,Message<{}>>} method Reflected or static method being called\n * @param {Uint8Array} requestData Request data\n * @param {RPCImplCallback} callback Callback function\n * @returns {undefined}\n * @example\n * function rpcImpl(method, requestData, callback) {\n *     if (protobuf.util.lcFirst(method.name) !== \"myMethod\") // compatible with static code\n *         throw Error(\"no such method\");\n *     asynchronouslyObtainAResponse(requestData, function(err, responseData) {\n *         callback(err, responseData);\n *     });\n * }\n */\n\n/**\n * Node-style callback as used by {@link RPCImpl}.\n * @typedef RPCImplCallback\n * @type {function}\n * @param {Error|null} error Error, if any, otherwise `null`\n * @param {Uint8Array|null} [response] Response data or `null` to signal end of stream, if there hasn't been an error\n * @returns {undefined}\n */\n\nrpc.Service = require(\"./rpc/service\");\n","\"use strict\";\nmodule.exports = Service;\n\nvar util = require(\"../util/minimal\");\n\n// Extends EventEmitter\n(Service.prototype = Object.create(util.EventEmitter.prototype)).constructor = Service;\n\n/**\n * A service method callback as used by {@link rpc.ServiceMethod|ServiceMethod}.\n *\n * Differs from {@link RPCImplCallback} in that it is an actual callback of a service method which may not return `response = null`.\n * @typedef rpc.ServiceMethodCallback\n * @template TRes extends Message<TRes>\n * @type {function}\n * @param {Error|null} error Error, if any\n * @param {TRes} [response] Response message\n * @returns {undefined}\n */\n\n/**\n * A service method part of a {@link rpc.Service} as created by {@link Service.create}.\n * @typedef rpc.ServiceMethod\n * @template TReq extends Message<TReq>\n * @template TRes extends Message<TRes>\n * @type {function}\n * @param {TReq|Properties<TReq>} request Request message or plain object\n * @param {rpc.ServiceMethodCallback<TRes>} [callback] Node-style callback called with the error, if any, and the response message\n * @returns {Promise<Message<TRes>>} Promise if `callback` has been omitted, otherwise `undefined`\n */\n\n/**\n * Constructs a new RPC service instance.\n * @classdesc An RPC service as returned by {@link Service#create}.\n * @exports rpc.Service\n * @extends util.EventEmitter\n * @constructor\n * @param {RPCImpl} rpcImpl RPC implementation\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\n */\nfunction Service(rpcImpl, requestDelimited, responseDelimited) {\n\n    if (typeof rpcImpl !== \"function\")\n        throw TypeError(\"rpcImpl must be a function\");\n\n    util.EventEmitter.call(this);\n\n    /**\n     * RPC implementation. Becomes `null` once the service is ended.\n     * @type {RPCImpl|null}\n     */\n    this.rpcImpl = rpcImpl;\n\n    /**\n     * Whether requests are length-delimited.\n     * @type {boolean}\n     */\n    this.requestDelimited = Boolean(requestDelimited);\n\n    /**\n     * Whether responses are length-delimited.\n     * @type {boolean}\n     */\n    this.responseDelimited = Boolean(responseDelimited);\n}\n\n/**\n * Calls a service method through {@link rpc.Service#rpcImpl|rpcImpl}.\n * @param {Method|rpc.ServiceMethod<TReq,TRes>} method Reflected or static method\n * @param {Constructor<TReq>} requestCtor Request constructor\n * @param {Constructor<TRes>} responseCtor Response constructor\n * @param {TReq|Properties<TReq>} request Request message or plain object\n * @param {rpc.ServiceMethodCallback<TRes>} callback Service callback\n * @returns {undefined}\n * @template TReq extends Message<TReq>\n * @template TRes extends Message<TRes>\n */\nService.prototype.rpcCall = function rpcCall(method, requestCtor, responseCtor, request, callback) {\n\n    if (!request)\n        throw TypeError(\"request must be specified\");\n\n    var self = this;\n    if (!callback)\n        return util.asPromise(rpcCall, self, method, requestCtor, responseCtor, request);\n\n    if (!self.rpcImpl) {\n        setTimeout(function() { callback(Error(\"already ended\")); }, 0);\n        return undefined;\n    }\n\n    try {\n        return self.rpcImpl(\n            method,\n            requestCtor[self.requestDelimited ? \"encodeDelimited\" : \"encode\"](request).finish(),\n            function rpcCallback(err, response) {\n\n                if (err) {\n                    self.emit(\"error\", err, method);\n                    return callback(err);\n                }\n\n                if (response === null) {\n                    self.end(/* endedByRPC */ true);\n                    return undefined;\n                }\n\n                if (!(response instanceof responseCtor)) {\n                    try {\n                        response = responseCtor[self.responseDelimited ? \"decodeDelimited\" : \"decode\"](response);\n                    } catch (err) {\n                        self.emit(\"error\", err, method);\n                        return callback(err);\n                    }\n                }\n\n                self.emit(\"data\", response, method);\n                return callback(null, response);\n            }\n        );\n    } catch (err) {\n        self.emit(\"error\", err, method);\n        setTimeout(function() { callback(err); }, 0);\n        return undefined;\n    }\n};\n\n/**\n * Ends this service and emits the `end` event.\n * @param {boolean} [endedByRPC=false] Whether the service has been ended by the RPC implementation.\n * @returns {rpc.Service} `this`\n */\nService.prototype.end = function end(endedByRPC) {\n    if (this.rpcImpl) {\n        if (!endedByRPC) // signal end to rpcImpl\n            this.rpcImpl(null, null, null);\n        this.rpcImpl = null;\n        this.emit(\"end\").off();\n    }\n    return this;\n};\n","\"use strict\";\nmodule.exports = {};\n\n/**\n * Named roots.\n * This is where pbjs stores generated structures (the option `-r, --root` specifies a name).\n * Can also be used manually to make roots available accross modules.\n * @name roots\n * @type {Object.<string,Root>}\n * @example\n * // pbjs -r myroot -o compiled.js ...\n *\n * // in another module:\n * require(\"./compiled.js\");\n *\n * // in any subsequent module:\n * var root = protobuf.roots[\"myroot\"];\n */\n","/**\n * Javascript implementation of Abstract Syntax Notation Number One.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2015 Digital Bazaar, Inc.\n *\n * An API for storing data using the Abstract Syntax Notation Number One\n * format using DER (Distinguished Encoding Rules) encoding. This encoding is\n * commonly used to store data for PKI, i.e. X.509 Certificates, and this\n * implementation exists for that purpose.\n *\n * Abstract Syntax Notation Number One (ASN.1) is used to define the abstract\n * syntax of information without restricting the way the information is encoded\n * for transmission. It provides a standard that allows for open systems\n * communication. ASN.1 defines the syntax of information data and a number of\n * simple data types as well as a notation for describing them and specifying\n * values for them.\n *\n * The RSA algorithm creates public and private keys that are often stored in\n * X.509 or PKCS#X formats -- which use ASN.1 (encoded in DER format). This\n * class provides the most basic functionality required to store and load DSA\n * keys that are encoded according to ASN.1.\n *\n * The most common binary encodings for ASN.1 are BER (Basic Encoding Rules)\n * and DER (Distinguished Encoding Rules). DER is just a subset of BER that\n * has stricter requirements for how data must be encoded.\n *\n * Each ASN.1 structure has a tag (a byte identifying the ASN.1 structure type)\n * and a byte array for the value of this ASN1 structure which may be data or a\n * list of ASN.1 structures.\n *\n * Each ASN.1 structure using BER is (Tag-Length-Value):\n *\n * | byte 0 | bytes X | bytes Y |\n * |--------|---------|----------\n * |  tag   | length  |  value  |\n *\n * ASN.1 allows for tags to be of \"High-tag-number form\" which allows a tag to\n * be two or more octets, but that is not supported by this class. A tag is\n * only 1 byte. Bits 1-5 give the tag number (ie the data type within a\n * particular 'class'), 6 indicates whether or not the ASN.1 value is\n * constructed from other ASN.1 values, and bits 7 and 8 give the 'class'. If\n * bits 7 and 8 are both zero, the class is UNIVERSAL. If only bit 7 is set,\n * then the class is APPLICATION. If only bit 8 is set, then the class is\n * CONTEXT_SPECIFIC. If both bits 7 and 8 are set, then the class is PRIVATE.\n * The tag numbers for the data types for the class UNIVERSAL are listed below:\n *\n * UNIVERSAL 0 Reserved for use by the encoding rules\n * UNIVERSAL 1 Boolean type\n * UNIVERSAL 2 Integer type\n * UNIVERSAL 3 Bitstring type\n * UNIVERSAL 4 Octetstring type\n * UNIVERSAL 5 Null type\n * UNIVERSAL 6 Object identifier type\n * UNIVERSAL 7 Object descriptor type\n * UNIVERSAL 8 External type and Instance-of type\n * UNIVERSAL 9 Real type\n * UNIVERSAL 10 Enumerated type\n * UNIVERSAL 11 Embedded-pdv type\n * UNIVERSAL 12 UTF8String type\n * UNIVERSAL 13 Relative object identifier type\n * UNIVERSAL 14-15 Reserved for future editions\n * UNIVERSAL 16 Sequence and Sequence-of types\n * UNIVERSAL 17 Set and Set-of types\n * UNIVERSAL 18-22, 25-30 Character string types\n * UNIVERSAL 23-24 Time types\n *\n * The length of an ASN.1 structure is specified after the tag identifier.\n * There is a definite form and an indefinite form. The indefinite form may\n * be used if the encoding is constructed and not all immediately available.\n * The indefinite form is encoded using a length byte with only the 8th bit\n * set. The end of the constructed object is marked using end-of-contents\n * octets (two zero bytes).\n *\n * The definite form looks like this:\n *\n * The length may take up 1 or more bytes, it depends on the length of the\n * value of the ASN.1 structure. DER encoding requires that if the ASN.1\n * structure has a value that has a length greater than 127, more than 1 byte\n * will be used to store its length, otherwise just one byte will be used.\n * This is strict.\n *\n * In the case that the length of the ASN.1 value is less than 127, 1 octet\n * (byte) is used to store the \"short form\" length. The 8th bit has a value of\n * 0 indicating the length is \"short form\" and not \"long form\" and bits 7-1\n * give the length of the data. (The 8th bit is the left-most, most significant\n * bit: also known as big endian or network format).\n *\n * In the case that the length of the ASN.1 value is greater than 127, 2 to\n * 127 octets (bytes) are used to store the \"long form\" length. The first\n * byte's 8th bit is set to 1 to indicate the length is \"long form.\" Bits 7-1\n * give the number of additional octets. All following octets are in base 256\n * with the most significant digit first (typical big-endian binary unsigned\n * integer storage). So, for instance, if the length of a value was 257, the\n * first byte would be set to:\n *\n * 10000010 = 130 = 0x82.\n *\n * This indicates there are 2 octets (base 256) for the length. The second and\n * third bytes (the octets just mentioned) would store the length in base 256:\n *\n * octet 2: 00000001 = 1 * 256^1 = 256\n * octet 3: 00000001 = 1 * 256^0 = 1\n * total = 257\n *\n * The algorithm for converting a js integer value of 257 to base-256 is:\n *\n * var value = 257;\n * var bytes = [];\n * bytes[0] = (value >>> 8) & 0xFF; // most significant byte first\n * bytes[1] = value & 0xFF;        // least significant byte last\n *\n * On the ASN.1 UNIVERSAL Object Identifier (OID) type:\n *\n * An OID can be written like: \"value1.value2.value3...valueN\"\n *\n * The DER encoding rules:\n *\n * The first byte has the value 40 * value1 + value2.\n * The following bytes, if any, encode the remaining values. Each value is\n * encoded in base 128, most significant digit first (big endian), with as\n * few digits as possible, and the most significant bit of each byte set\n * to 1 except the last in each value's encoding. For example: Given the\n * OID \"1.2.840.113549\", its DER encoding is (remember each byte except the\n * last one in each encoding is OR'd with 0x80):\n *\n * byte 1: 40 * 1 + 2 = 42 = 0x2A.\n * bytes 2-3: 128 * 6 + 72 = 840 = 6 72 = 6 72 = 0x0648 = 0x8648\n * bytes 4-6: 16384 * 6 + 128 * 119 + 13 = 6 119 13 = 0x06770D = 0x86F70D\n *\n * The final value is: 0x2A864886F70D.\n * The full OID (including ASN.1 tag and length of 6 bytes) is:\n * 0x06062A864886F70D\n */\nvar forge = require('./forge');\nrequire('./util');\nrequire('./oids');\n\n/* ASN.1 API */\nvar asn1 = module.exports = forge.asn1 = forge.asn1 || {};\n\n/**\n * ASN.1 classes.\n */\nasn1.Class = {\n  UNIVERSAL:        0x00,\n  APPLICATION:      0x40,\n  CONTEXT_SPECIFIC: 0x80,\n  PRIVATE:          0xC0\n};\n\n/**\n * ASN.1 types. Not all types are supported by this implementation, only\n * those necessary to implement a simple PKI are implemented.\n */\nasn1.Type = {\n  NONE:             0,\n  BOOLEAN:          1,\n  INTEGER:          2,\n  BITSTRING:        3,\n  OCTETSTRING:      4,\n  NULL:             5,\n  OID:              6,\n  ODESC:            7,\n  EXTERNAL:         8,\n  REAL:             9,\n  ENUMERATED:      10,\n  EMBEDDED:        11,\n  UTF8:            12,\n  ROID:            13,\n  SEQUENCE:        16,\n  SET:             17,\n  PRINTABLESTRING: 19,\n  IA5STRING:       22,\n  UTCTIME:         23,\n  GENERALIZEDTIME: 24,\n  BMPSTRING:       30\n};\n\n/**\n * Creates a new asn1 object.\n *\n * @param tagClass the tag class for the object.\n * @param type the data type (tag number) for the object.\n * @param constructed true if the asn1 object is in constructed form.\n * @param value the value for the object, if it is not constructed.\n * @param [options] the options to use:\n *          [bitStringContents] the plain BIT STRING content including padding\n *            byte.\n *\n * @return the asn1 object.\n */\nasn1.create = function(tagClass, type, constructed, value, options) {\n  /* An asn1 object has a tagClass, a type, a constructed flag, and a\n    value. The value's type depends on the constructed flag. If\n    constructed, it will contain a list of other asn1 objects. If not,\n    it will contain the ASN.1 value as an array of bytes formatted\n    according to the ASN.1 data type. */\n\n  // remove undefined values\n  if(forge.util.isArray(value)) {\n    var tmp = [];\n    for(var i = 0; i < value.length; ++i) {\n      if(value[i] !== undefined) {\n        tmp.push(value[i]);\n      }\n    }\n    value = tmp;\n  }\n\n  var obj = {\n    tagClass: tagClass,\n    type: type,\n    constructed: constructed,\n    composed: constructed || forge.util.isArray(value),\n    value: value\n  };\n  if(options && 'bitStringContents' in options) {\n    // TODO: copy byte buffer if it's a buffer not a string\n    obj.bitStringContents = options.bitStringContents;\n    // TODO: add readonly flag to avoid this overhead\n    // save copy to detect changes\n    obj.original = asn1.copy(obj);\n  }\n  return obj;\n};\n\n/**\n * Copies an asn1 object.\n *\n * @param obj the asn1 object.\n * @param [options] copy options:\n *          [excludeBitStringContents] true to not copy bitStringContents\n *\n * @return the a copy of the asn1 object.\n */\nasn1.copy = function(obj, options) {\n  var copy;\n\n  if(forge.util.isArray(obj)) {\n    copy = [];\n    for(var i = 0; i < obj.length; ++i) {\n      copy.push(asn1.copy(obj[i], options));\n    }\n    return copy;\n  }\n\n  if(typeof obj === 'string') {\n    // TODO: copy byte buffer if it's a buffer not a string\n    return obj;\n  }\n\n  copy = {\n    tagClass: obj.tagClass,\n    type: obj.type,\n    constructed: obj.constructed,\n    composed: obj.composed,\n    value: asn1.copy(obj.value, options)\n  };\n  if(options && !options.excludeBitStringContents) {\n    // TODO: copy byte buffer if it's a buffer not a string\n    copy.bitStringContents = obj.bitStringContents;\n  }\n  return copy;\n};\n\n/**\n * Compares asn1 objects for equality.\n *\n * Note this function does not run in constant time.\n *\n * @param obj1 the first asn1 object.\n * @param obj2 the second asn1 object.\n * @param [options] compare options:\n *          [includeBitStringContents] true to compare bitStringContents\n *\n * @return true if the asn1 objects are equal.\n */\nasn1.equals = function(obj1, obj2, options) {\n  if(forge.util.isArray(obj1)) {\n    if(!forge.util.isArray(obj2)) {\n      return false;\n    }\n    if(obj1.length !== obj2.length) {\n      return false;\n    }\n    for(var i = 0; i < obj1.length; ++i) {\n      if(!asn1.equals(obj1[i], obj2[i])) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  if(typeof obj1 !== typeof obj2) {\n    return false;\n  }\n\n  if(typeof obj1 === 'string') {\n    return obj1 === obj2;\n  }\n\n  var equal = obj1.tagClass === obj2.tagClass &&\n    obj1.type === obj2.type &&\n    obj1.constructed === obj2.constructed &&\n    obj1.composed === obj2.composed &&\n    asn1.equals(obj1.value, obj2.value);\n  if(options && options.includeBitStringContents) {\n    equal = equal && (obj1.bitStringContents === obj2.bitStringContents);\n  }\n\n  return equal;\n};\n\n/**\n * Gets the length of a BER-encoded ASN.1 value.\n *\n * In case the length is not specified, undefined is returned.\n *\n * @param b the BER-encoded ASN.1 byte buffer, starting with the first\n *          length byte.\n *\n * @return the length of the BER-encoded ASN.1 value or undefined.\n */\nasn1.getBerValueLength = function(b) {\n  // TODO: move this function and related DER/BER functions to a der.js\n  // file; better abstract ASN.1 away from der/ber.\n  var b2 = b.getByte();\n  if(b2 === 0x80) {\n    return undefined;\n  }\n\n  // see if the length is \"short form\" or \"long form\" (bit 8 set)\n  var length;\n  var longForm = b2 & 0x80;\n  if(!longForm) {\n    // length is just the first byte\n    length = b2;\n  } else {\n    // the number of bytes the length is specified in bits 7 through 1\n    // and each length byte is in big-endian base-256\n    length = b.getInt((b2 & 0x7F) << 3);\n  }\n  return length;\n};\n\n/**\n * Check if the byte buffer has enough bytes. Throws an Error if not.\n *\n * @param bytes the byte buffer to parse from.\n * @param remaining the bytes remaining in the current parsing state.\n * @param n the number of bytes the buffer must have.\n */\nfunction _checkBufferLength(bytes, remaining, n) {\n  if(n > remaining) {\n    var error = new Error('Too few bytes to parse DER.');\n    error.available = bytes.length();\n    error.remaining = remaining;\n    error.requested = n;\n    throw error;\n  }\n}\n\n/**\n * Gets the length of a BER-encoded ASN.1 value.\n *\n * In case the length is not specified, undefined is returned.\n *\n * @param bytes the byte buffer to parse from.\n * @param remaining the bytes remaining in the current parsing state.\n *\n * @return the length of the BER-encoded ASN.1 value or undefined.\n */\nvar _getValueLength = function(bytes, remaining) {\n  // TODO: move this function and related DER/BER functions to a der.js\n  // file; better abstract ASN.1 away from der/ber.\n  // fromDer already checked that this byte exists\n  var b2 = bytes.getByte();\n  remaining--;\n  if(b2 === 0x80) {\n    return undefined;\n  }\n\n  // see if the length is \"short form\" or \"long form\" (bit 8 set)\n  var length;\n  var longForm = b2 & 0x80;\n  if(!longForm) {\n    // length is just the first byte\n    length = b2;\n  } else {\n    // the number of bytes the length is specified in bits 7 through 1\n    // and each length byte is in big-endian base-256\n    var longFormBytes = b2 & 0x7F;\n    _checkBufferLength(bytes, remaining, longFormBytes);\n    length = bytes.getInt(longFormBytes << 3);\n  }\n  // FIXME: this will only happen for 32 bit getInt with high bit set\n  if(length < 0) {\n    throw new Error('Negative length: ' + length);\n  }\n  return length;\n};\n\n/**\n * Parses an asn1 object from a byte buffer in DER format.\n *\n * @param bytes the byte buffer to parse from.\n * @param [strict] true to be strict when checking value lengths, false to\n *          allow truncated values (default: true).\n * @param [options] object with options or boolean strict flag\n *          [strict] true to be strict when checking value lengths, false to\n *            allow truncated values (default: true).\n *          [decodeBitStrings] true to attempt to decode the content of\n *            BIT STRINGs (not OCTET STRINGs) using strict mode. Note that\n *            without schema support to understand the data context this can\n *            erroneously decode values that happen to be valid ASN.1. This\n *            flag will be deprecated or removed as soon as schema support is\n *            available. (default: true)\n *\n * @return the parsed asn1 object.\n */\nasn1.fromDer = function(bytes, options) {\n  if(options === undefined) {\n    options = {\n      strict: true,\n      decodeBitStrings: true\n    };\n  }\n  if(typeof options === 'boolean') {\n    options = {\n      strict: options,\n      decodeBitStrings: true\n    };\n  }\n  if(!('strict' in options)) {\n    options.strict = true;\n  }\n  if(!('decodeBitStrings' in options)) {\n    options.decodeBitStrings = true;\n  }\n\n  // wrap in buffer if needed\n  if(typeof bytes === 'string') {\n    bytes = forge.util.createBuffer(bytes);\n  }\n\n  return _fromDer(bytes, bytes.length(), 0, options);\n};\n\n/**\n * Internal function to parse an asn1 object from a byte buffer in DER format.\n *\n * @param bytes the byte buffer to parse from.\n * @param remaining the number of bytes remaining for this chunk.\n * @param depth the current parsing depth.\n * @param options object with same options as fromDer().\n *\n * @return the parsed asn1 object.\n */\nfunction _fromDer(bytes, remaining, depth, options) {\n  // temporary storage for consumption calculations\n  var start;\n\n  // minimum length for ASN.1 DER structure is 2\n  _checkBufferLength(bytes, remaining, 2);\n\n  // get the first byte\n  var b1 = bytes.getByte();\n  // consumed one byte\n  remaining--;\n\n  // get the tag class\n  var tagClass = (b1 & 0xC0);\n\n  // get the type (bits 1-5)\n  var type = b1 & 0x1F;\n\n  // get the variable value length and adjust remaining bytes\n  start = bytes.length();\n  var length = _getValueLength(bytes, remaining);\n  remaining -= start - bytes.length();\n\n  // ensure there are enough bytes to get the value\n  if(length !== undefined && length > remaining) {\n    if(options.strict) {\n      var error = new Error('Too few bytes to read ASN.1 value.');\n      error.available = bytes.length();\n      error.remaining = remaining;\n      error.requested = length;\n      throw error;\n    }\n    // Note: be lenient with truncated values and use remaining state bytes\n    length = remaining;\n  }\n\n  // value storage\n  var value;\n  // possible BIT STRING contents storage\n  var bitStringContents;\n\n  // constructed flag is bit 6 (32 = 0x20) of the first byte\n  var constructed = ((b1 & 0x20) === 0x20);\n  if(constructed) {\n    // parse child asn1 objects from the value\n    value = [];\n    if(length === undefined) {\n      // asn1 object of indefinite length, read until end tag\n      for(;;) {\n        _checkBufferLength(bytes, remaining, 2);\n        if(bytes.bytes(2) === String.fromCharCode(0, 0)) {\n          bytes.getBytes(2);\n          remaining -= 2;\n          break;\n        }\n        start = bytes.length();\n        value.push(_fromDer(bytes, remaining, depth + 1, options));\n        remaining -= start - bytes.length();\n      }\n    } else {\n      // parsing asn1 object of definite length\n      while(length > 0) {\n        start = bytes.length();\n        value.push(_fromDer(bytes, length, depth + 1, options));\n        remaining -= start - bytes.length();\n        length -= start - bytes.length();\n      }\n    }\n  }\n\n  // if a BIT STRING, save the contents including padding\n  if(value === undefined && tagClass === asn1.Class.UNIVERSAL &&\n    type === asn1.Type.BITSTRING) {\n    bitStringContents = bytes.bytes(length);\n  }\n\n  // determine if a non-constructed value should be decoded as a composed\n  // value that contains other ASN.1 objects. BIT STRINGs (and OCTET STRINGs)\n  // can be used this way.\n  if(value === undefined && options.decodeBitStrings &&\n    tagClass === asn1.Class.UNIVERSAL &&\n    // FIXME: OCTET STRINGs not yet supported here\n    // .. other parts of forge expect to decode OCTET STRINGs manually\n    (type === asn1.Type.BITSTRING /*|| type === asn1.Type.OCTETSTRING*/) &&\n    length > 1) {\n    // save read position\n    var savedRead = bytes.read;\n    var savedRemaining = remaining;\n    var unused = 0;\n    if(type === asn1.Type.BITSTRING) {\n      /* The first octet gives the number of bits by which the length of the\n        bit string is less than the next multiple of eight (this is called\n        the \"number of unused bits\").\n\n        The second and following octets give the value of the bit string\n        converted to an octet string. */\n      _checkBufferLength(bytes, remaining, 1);\n      unused = bytes.getByte();\n      remaining--;\n    }\n    // if all bits are used, maybe the BIT/OCTET STRING holds ASN.1 objs\n    if(unused === 0) {\n      try {\n        // attempt to parse child asn1 object from the value\n        // (stored in array to signal composed value)\n        start = bytes.length();\n        var subOptions = {\n          // enforce strict mode to avoid parsing ASN.1 from plain data\n          verbose: options.verbose,\n          strict: true,\n          decodeBitStrings: true\n        };\n        var composed = _fromDer(bytes, remaining, depth + 1, subOptions);\n        var used = start - bytes.length();\n        remaining -= used;\n        if(type == asn1.Type.BITSTRING) {\n          used++;\n        }\n\n        // if the data all decoded and the class indicates UNIVERSAL or\n        // CONTEXT_SPECIFIC then assume we've got an encapsulated ASN.1 object\n        var tc = composed.tagClass;\n        if(used === length &&\n          (tc === asn1.Class.UNIVERSAL || tc === asn1.Class.CONTEXT_SPECIFIC)) {\n          value = [composed];\n        }\n      } catch(ex) {\n      }\n    }\n    if(value === undefined) {\n      // restore read position\n      bytes.read = savedRead;\n      remaining = savedRemaining;\n    }\n  }\n\n  if(value === undefined) {\n    // asn1 not constructed or composed, get raw value\n    // TODO: do DER to OID conversion and vice-versa in .toDer?\n\n    if(length === undefined) {\n      if(options.strict) {\n        throw new Error('Non-constructed ASN.1 object of indefinite length.');\n      }\n      // be lenient and use remaining state bytes\n      length = remaining;\n    }\n\n    if(type === asn1.Type.BMPSTRING) {\n      value = '';\n      for(; length > 0; length -= 2) {\n        _checkBufferLength(bytes, remaining, 2);\n        value += String.fromCharCode(bytes.getInt16());\n        remaining -= 2;\n      }\n    } else {\n      value = bytes.getBytes(length);\n    }\n  }\n\n  // add BIT STRING contents if available\n  var asn1Options = bitStringContents === undefined ? null : {\n    bitStringContents: bitStringContents\n  };\n\n  // create and return asn1 object\n  return asn1.create(tagClass, type, constructed, value, asn1Options);\n}\n\n/**\n * Converts the given asn1 object to a buffer of bytes in DER format.\n *\n * @param asn1 the asn1 object to convert to bytes.\n *\n * @return the buffer of bytes.\n */\nasn1.toDer = function(obj) {\n  var bytes = forge.util.createBuffer();\n\n  // build the first byte\n  var b1 = obj.tagClass | obj.type;\n\n  // for storing the ASN.1 value\n  var value = forge.util.createBuffer();\n\n  // use BIT STRING contents if available and data not changed\n  var useBitStringContents = false;\n  if('bitStringContents' in obj) {\n    useBitStringContents = true;\n    if(obj.original) {\n      useBitStringContents = asn1.equals(obj, obj.original);\n    }\n  }\n\n  if(useBitStringContents) {\n    value.putBytes(obj.bitStringContents);\n  } else if(obj.composed) {\n    // if composed, use each child asn1 object's DER bytes as value\n    // turn on 6th bit (0x20 = 32) to indicate asn1 is constructed\n    // from other asn1 objects\n    if(obj.constructed) {\n      b1 |= 0x20;\n    } else {\n      // type is a bit string, add unused bits of 0x00\n      value.putByte(0x00);\n    }\n\n    // add all of the child DER bytes together\n    for(var i = 0; i < obj.value.length; ++i) {\n      if(obj.value[i] !== undefined) {\n        value.putBuffer(asn1.toDer(obj.value[i]));\n      }\n    }\n  } else {\n    // use asn1.value directly\n    if(obj.type === asn1.Type.BMPSTRING) {\n      for(var i = 0; i < obj.value.length; ++i) {\n        value.putInt16(obj.value.charCodeAt(i));\n      }\n    } else {\n      // ensure integer is minimally-encoded\n      // TODO: should all leading bytes be stripped vs just one?\n      // .. ex '00 00 01' => '01'?\n      if(obj.type === asn1.Type.INTEGER &&\n        obj.value.length > 1 &&\n        // leading 0x00 for positive integer\n        ((obj.value.charCodeAt(0) === 0 &&\n        (obj.value.charCodeAt(1) & 0x80) === 0) ||\n        // leading 0xFF for negative integer\n        (obj.value.charCodeAt(0) === 0xFF &&\n        (obj.value.charCodeAt(1) & 0x80) === 0x80))) {\n        value.putBytes(obj.value.substr(1));\n      } else {\n        value.putBytes(obj.value);\n      }\n    }\n  }\n\n  // add tag byte\n  bytes.putByte(b1);\n\n  // use \"short form\" encoding\n  if(value.length() <= 127) {\n    // one byte describes the length\n    // bit 8 = 0 and bits 7-1 = length\n    bytes.putByte(value.length() & 0x7F);\n  } else {\n    // use \"long form\" encoding\n    // 2 to 127 bytes describe the length\n    // first byte: bit 8 = 1 and bits 7-1 = # of additional bytes\n    // other bytes: length in base 256, big-endian\n    var len = value.length();\n    var lenBytes = '';\n    do {\n      lenBytes += String.fromCharCode(len & 0xFF);\n      len = len >>> 8;\n    } while(len > 0);\n\n    // set first byte to # bytes used to store the length and turn on\n    // bit 8 to indicate long-form length is used\n    bytes.putByte(lenBytes.length | 0x80);\n\n    // concatenate length bytes in reverse since they were generated\n    // little endian and we need big endian\n    for(var i = lenBytes.length - 1; i >= 0; --i) {\n      bytes.putByte(lenBytes.charCodeAt(i));\n    }\n  }\n\n  // concatenate value bytes\n  bytes.putBuffer(value);\n  return bytes;\n};\n\n/**\n * Converts an OID dot-separated string to a byte buffer. The byte buffer\n * contains only the DER-encoded value, not any tag or length bytes.\n *\n * @param oid the OID dot-separated string.\n *\n * @return the byte buffer.\n */\nasn1.oidToDer = function(oid) {\n  // split OID into individual values\n  var values = oid.split('.');\n  var bytes = forge.util.createBuffer();\n\n  // first byte is 40 * value1 + value2\n  bytes.putByte(40 * parseInt(values[0], 10) + parseInt(values[1], 10));\n  // other bytes are each value in base 128 with 8th bit set except for\n  // the last byte for each value\n  var last, valueBytes, value, b;\n  for(var i = 2; i < values.length; ++i) {\n    // produce value bytes in reverse because we don't know how many\n    // bytes it will take to store the value\n    last = true;\n    valueBytes = [];\n    value = parseInt(values[i], 10);\n    do {\n      b = value & 0x7F;\n      value = value >>> 7;\n      // if value is not last, then turn on 8th bit\n      if(!last) {\n        b |= 0x80;\n      }\n      valueBytes.push(b);\n      last = false;\n    } while(value > 0);\n\n    // add value bytes in reverse (needs to be in big endian)\n    for(var n = valueBytes.length - 1; n >= 0; --n) {\n      bytes.putByte(valueBytes[n]);\n    }\n  }\n\n  return bytes;\n};\n\n/**\n * Converts a DER-encoded byte buffer to an OID dot-separated string. The\n * byte buffer should contain only the DER-encoded value, not any tag or\n * length bytes.\n *\n * @param bytes the byte buffer.\n *\n * @return the OID dot-separated string.\n */\nasn1.derToOid = function(bytes) {\n  var oid;\n\n  // wrap in buffer if needed\n  if(typeof bytes === 'string') {\n    bytes = forge.util.createBuffer(bytes);\n  }\n\n  // first byte is 40 * value1 + value2\n  var b = bytes.getByte();\n  oid = Math.floor(b / 40) + '.' + (b % 40);\n\n  // other bytes are each value in base 128 with 8th bit set except for\n  // the last byte for each value\n  var value = 0;\n  while(bytes.length() > 0) {\n    b = bytes.getByte();\n    value = value << 7;\n    // not the last byte for the value\n    if(b & 0x80) {\n      value += b & 0x7F;\n    } else {\n      // last byte\n      oid += '.' + (value + b);\n      value = 0;\n    }\n  }\n\n  return oid;\n};\n\n/**\n * Converts a UTCTime value to a date.\n *\n * Note: GeneralizedTime has 4 digits for the year and is used for X.509\n * dates past 2049. Parsing that structure hasn't been implemented yet.\n *\n * @param utc the UTCTime value to convert.\n *\n * @return the date.\n */\nasn1.utcTimeToDate = function(utc) {\n  /* The following formats can be used:\n\n    YYMMDDhhmmZ\n    YYMMDDhhmm+hh'mm'\n    YYMMDDhhmm-hh'mm'\n    YYMMDDhhmmssZ\n    YYMMDDhhmmss+hh'mm'\n    YYMMDDhhmmss-hh'mm'\n\n    Where:\n\n    YY is the least significant two digits of the year\n    MM is the month (01 to 12)\n    DD is the day (01 to 31)\n    hh is the hour (00 to 23)\n    mm are the minutes (00 to 59)\n    ss are the seconds (00 to 59)\n    Z indicates that local time is GMT, + indicates that local time is\n    later than GMT, and - indicates that local time is earlier than GMT\n    hh' is the absolute value of the offset from GMT in hours\n    mm' is the absolute value of the offset from GMT in minutes */\n  var date = new Date();\n\n  // if YY >= 50 use 19xx, if YY < 50 use 20xx\n  var year = parseInt(utc.substr(0, 2), 10);\n  year = (year >= 50) ? 1900 + year : 2000 + year;\n  var MM = parseInt(utc.substr(2, 2), 10) - 1; // use 0-11 for month\n  var DD = parseInt(utc.substr(4, 2), 10);\n  var hh = parseInt(utc.substr(6, 2), 10);\n  var mm = parseInt(utc.substr(8, 2), 10);\n  var ss = 0;\n\n  // not just YYMMDDhhmmZ\n  if(utc.length > 11) {\n    // get character after minutes\n    var c = utc.charAt(10);\n    var end = 10;\n\n    // see if seconds are present\n    if(c !== '+' && c !== '-') {\n      // get seconds\n      ss = parseInt(utc.substr(10, 2), 10);\n      end += 2;\n    }\n  }\n\n  // update date\n  date.setUTCFullYear(year, MM, DD);\n  date.setUTCHours(hh, mm, ss, 0);\n\n  if(end) {\n    // get +/- after end of time\n    c = utc.charAt(end);\n    if(c === '+' || c === '-') {\n      // get hours+minutes offset\n      var hhoffset = parseInt(utc.substr(end + 1, 2), 10);\n      var mmoffset = parseInt(utc.substr(end + 4, 2), 10);\n\n      // calculate offset in milliseconds\n      var offset = hhoffset * 60 + mmoffset;\n      offset *= 60000;\n\n      // apply offset\n      if(c === '+') {\n        date.setTime(+date - offset);\n      } else {\n        date.setTime(+date + offset);\n      }\n    }\n  }\n\n  return date;\n};\n\n/**\n * Converts a GeneralizedTime value to a date.\n *\n * @param gentime the GeneralizedTime value to convert.\n *\n * @return the date.\n */\nasn1.generalizedTimeToDate = function(gentime) {\n  /* The following formats can be used:\n\n    YYYYMMDDHHMMSS\n    YYYYMMDDHHMMSS.fff\n    YYYYMMDDHHMMSSZ\n    YYYYMMDDHHMMSS.fffZ\n    YYYYMMDDHHMMSS+hh'mm'\n    YYYYMMDDHHMMSS.fff+hh'mm'\n    YYYYMMDDHHMMSS-hh'mm'\n    YYYYMMDDHHMMSS.fff-hh'mm'\n\n    Where:\n\n    YYYY is the year\n    MM is the month (01 to 12)\n    DD is the day (01 to 31)\n    hh is the hour (00 to 23)\n    mm are the minutes (00 to 59)\n    ss are the seconds (00 to 59)\n    .fff is the second fraction, accurate to three decimal places\n    Z indicates that local time is GMT, + indicates that local time is\n    later than GMT, and - indicates that local time is earlier than GMT\n    hh' is the absolute value of the offset from GMT in hours\n    mm' is the absolute value of the offset from GMT in minutes */\n  var date = new Date();\n\n  var YYYY = parseInt(gentime.substr(0, 4), 10);\n  var MM = parseInt(gentime.substr(4, 2), 10) - 1; // use 0-11 for month\n  var DD = parseInt(gentime.substr(6, 2), 10);\n  var hh = parseInt(gentime.substr(8, 2), 10);\n  var mm = parseInt(gentime.substr(10, 2), 10);\n  var ss = parseInt(gentime.substr(12, 2), 10);\n  var fff = 0;\n  var offset = 0;\n  var isUTC = false;\n\n  if(gentime.charAt(gentime.length - 1) === 'Z') {\n    isUTC = true;\n  }\n\n  var end = gentime.length - 5, c = gentime.charAt(end);\n  if(c === '+' || c === '-') {\n    // get hours+minutes offset\n    var hhoffset = parseInt(gentime.substr(end + 1, 2), 10);\n    var mmoffset = parseInt(gentime.substr(end + 4, 2), 10);\n\n    // calculate offset in milliseconds\n    offset = hhoffset * 60 + mmoffset;\n    offset *= 60000;\n\n    // apply offset\n    if(c === '+') {\n      offset *= -1;\n    }\n\n    isUTC = true;\n  }\n\n  // check for second fraction\n  if(gentime.charAt(14) === '.') {\n    fff = parseFloat(gentime.substr(14), 10) * 1000;\n  }\n\n  if(isUTC) {\n    date.setUTCFullYear(YYYY, MM, DD);\n    date.setUTCHours(hh, mm, ss, fff);\n\n    // apply offset\n    date.setTime(+date + offset);\n  } else {\n    date.setFullYear(YYYY, MM, DD);\n    date.setHours(hh, mm, ss, fff);\n  }\n\n  return date;\n};\n\n/**\n * Converts a date to a UTCTime value.\n *\n * Note: GeneralizedTime has 4 digits for the year and is used for X.509\n * dates past 2049. Converting to a GeneralizedTime hasn't been\n * implemented yet.\n *\n * @param date the date to convert.\n *\n * @return the UTCTime value.\n */\nasn1.dateToUtcTime = function(date) {\n  // TODO: validate; currently assumes proper format\n  if(typeof date === 'string') {\n    return date;\n  }\n\n  var rval = '';\n\n  // create format YYMMDDhhmmssZ\n  var format = [];\n  format.push(('' + date.getUTCFullYear()).substr(2));\n  format.push('' + (date.getUTCMonth() + 1));\n  format.push('' + date.getUTCDate());\n  format.push('' + date.getUTCHours());\n  format.push('' + date.getUTCMinutes());\n  format.push('' + date.getUTCSeconds());\n\n  // ensure 2 digits are used for each format entry\n  for(var i = 0; i < format.length; ++i) {\n    if(format[i].length < 2) {\n      rval += '0';\n    }\n    rval += format[i];\n  }\n  rval += 'Z';\n\n  return rval;\n};\n\n/**\n * Converts a date to a GeneralizedTime value.\n *\n * @param date the date to convert.\n *\n * @return the GeneralizedTime value as a string.\n */\nasn1.dateToGeneralizedTime = function(date) {\n  // TODO: validate; currently assumes proper format\n  if(typeof date === 'string') {\n    return date;\n  }\n\n  var rval = '';\n\n  // create format YYYYMMDDHHMMSSZ\n  var format = [];\n  format.push('' + date.getUTCFullYear());\n  format.push('' + (date.getUTCMonth() + 1));\n  format.push('' + date.getUTCDate());\n  format.push('' + date.getUTCHours());\n  format.push('' + date.getUTCMinutes());\n  format.push('' + date.getUTCSeconds());\n\n  // ensure 2 digits are used for each format entry\n  for(var i = 0; i < format.length; ++i) {\n    if(format[i].length < 2) {\n      rval += '0';\n    }\n    rval += format[i];\n  }\n  rval += 'Z';\n\n  return rval;\n};\n\n/**\n * Converts a javascript integer to a DER-encoded byte buffer to be used\n * as the value for an INTEGER type.\n *\n * @param x the integer.\n *\n * @return the byte buffer.\n */\nasn1.integerToDer = function(x) {\n  var rval = forge.util.createBuffer();\n  if(x >= -0x80 && x < 0x80) {\n    return rval.putSignedInt(x, 8);\n  }\n  if(x >= -0x8000 && x < 0x8000) {\n    return rval.putSignedInt(x, 16);\n  }\n  if(x >= -0x800000 && x < 0x800000) {\n    return rval.putSignedInt(x, 24);\n  }\n  if(x >= -0x80000000 && x < 0x80000000) {\n    return rval.putSignedInt(x, 32);\n  }\n  var error = new Error('Integer too large; max is 32-bits.');\n  error.integer = x;\n  throw error;\n};\n\n/**\n * Converts a DER-encoded byte buffer to a javascript integer. This is\n * typically used to decode the value of an INTEGER type.\n *\n * @param bytes the byte buffer.\n *\n * @return the integer.\n */\nasn1.derToInteger = function(bytes) {\n  // wrap in buffer if needed\n  if(typeof bytes === 'string') {\n    bytes = forge.util.createBuffer(bytes);\n  }\n\n  var n = bytes.length() * 8;\n  if(n > 32) {\n    throw new Error('Integer too large; max is 32-bits.');\n  }\n  return bytes.getSignedInt(n);\n};\n\n/**\n * Validates that the given ASN.1 object is at least a super set of the\n * given ASN.1 structure. Only tag classes and types are checked. An\n * optional map may also be provided to capture ASN.1 values while the\n * structure is checked.\n *\n * To capture an ASN.1 value, set an object in the validator's 'capture'\n * parameter to the key to use in the capture map. To capture the full\n * ASN.1 object, specify 'captureAsn1'. To capture BIT STRING bytes, including\n * the leading unused bits counter byte, specify 'captureBitStringContents'.\n * To capture BIT STRING bytes, without the leading unused bits counter byte,\n * specify 'captureBitStringValue'.\n *\n * Objects in the validator may set a field 'optional' to true to indicate\n * that it isn't necessary to pass validation.\n *\n * @param obj the ASN.1 object to validate.\n * @param v the ASN.1 structure validator.\n * @param capture an optional map to capture values in.\n * @param errors an optional array for storing validation errors.\n *\n * @return true on success, false on failure.\n */\nasn1.validate = function(obj, v, capture, errors) {\n  var rval = false;\n\n  // ensure tag class and type are the same if specified\n  if((obj.tagClass === v.tagClass || typeof(v.tagClass) === 'undefined') &&\n    (obj.type === v.type || typeof(v.type) === 'undefined')) {\n    // ensure constructed flag is the same if specified\n    if(obj.constructed === v.constructed ||\n      typeof(v.constructed) === 'undefined') {\n      rval = true;\n\n      // handle sub values\n      if(v.value && forge.util.isArray(v.value)) {\n        var j = 0;\n        for(var i = 0; rval && i < v.value.length; ++i) {\n          rval = v.value[i].optional || false;\n          if(obj.value[j]) {\n            rval = asn1.validate(obj.value[j], v.value[i], capture, errors);\n            if(rval) {\n              ++j;\n            } else if(v.value[i].optional) {\n              rval = true;\n            }\n          }\n          if(!rval && errors) {\n            errors.push(\n              '[' + v.name + '] ' +\n              'Tag class \"' + v.tagClass + '\", type \"' +\n              v.type + '\" expected value length \"' +\n              v.value.length + '\", got \"' +\n              obj.value.length + '\"');\n          }\n        }\n      }\n\n      if(rval && capture) {\n        if(v.capture) {\n          capture[v.capture] = obj.value;\n        }\n        if(v.captureAsn1) {\n          capture[v.captureAsn1] = obj;\n        }\n        if(v.captureBitStringContents && 'bitStringContents' in obj) {\n          capture[v.captureBitStringContents] = obj.bitStringContents;\n        }\n        if(v.captureBitStringValue && 'bitStringContents' in obj) {\n          var value;\n          if(obj.bitStringContents.length < 2) {\n            capture[v.captureBitStringValue] = '';\n          } else {\n            // FIXME: support unused bits with data shifting\n            var unused = obj.bitStringContents.charCodeAt(0);\n            if(unused !== 0) {\n              throw new Error(\n                'captureBitStringValue only supported for zero unused bits');\n            }\n            capture[v.captureBitStringValue] = obj.bitStringContents.slice(1);\n          }\n        }\n      }\n    } else if(errors) {\n      errors.push(\n        '[' + v.name + '] ' +\n        'Expected constructed \"' + v.constructed + '\", got \"' +\n        obj.constructed + '\"');\n    }\n  } else if(errors) {\n    if(obj.tagClass !== v.tagClass) {\n      errors.push(\n        '[' + v.name + '] ' +\n        'Expected tag class \"' + v.tagClass + '\", got \"' +\n        obj.tagClass + '\"');\n    }\n    if(obj.type !== v.type) {\n      errors.push(\n        '[' + v.name + '] ' +\n        'Expected type \"' + v.type + '\", got \"' + obj.type + '\"');\n    }\n  }\n  return rval;\n};\n\n// regex for testing for non-latin characters\nvar _nonLatinRegex = /[^\\\\u0000-\\\\u00ff]/;\n\n/**\n * Pretty prints an ASN.1 object to a string.\n *\n * @param obj the object to write out.\n * @param level the level in the tree.\n * @param indentation the indentation to use.\n *\n * @return the string.\n */\nasn1.prettyPrint = function(obj, level, indentation) {\n  var rval = '';\n\n  // set default level and indentation\n  level = level || 0;\n  indentation = indentation || 2;\n\n  // start new line for deep levels\n  if(level > 0) {\n    rval += '\\n';\n  }\n\n  // create indent\n  var indent = '';\n  for(var i = 0; i < level * indentation; ++i) {\n    indent += ' ';\n  }\n\n  // print class:type\n  rval += indent + 'Tag: ';\n  switch(obj.tagClass) {\n  case asn1.Class.UNIVERSAL:\n    rval += 'Universal:';\n    break;\n  case asn1.Class.APPLICATION:\n    rval += 'Application:';\n    break;\n  case asn1.Class.CONTEXT_SPECIFIC:\n    rval += 'Context-Specific:';\n    break;\n  case asn1.Class.PRIVATE:\n    rval += 'Private:';\n    break;\n  }\n\n  if(obj.tagClass === asn1.Class.UNIVERSAL) {\n    rval += obj.type;\n\n    // known types\n    switch(obj.type) {\n    case asn1.Type.NONE:\n      rval += ' (None)';\n      break;\n    case asn1.Type.BOOLEAN:\n      rval += ' (Boolean)';\n      break;\n    case asn1.Type.INTEGER:\n      rval += ' (Integer)';\n      break;\n    case asn1.Type.BITSTRING:\n      rval += ' (Bit string)';\n      break;\n    case asn1.Type.OCTETSTRING:\n      rval += ' (Octet string)';\n      break;\n    case asn1.Type.NULL:\n      rval += ' (Null)';\n      break;\n    case asn1.Type.OID:\n      rval += ' (Object Identifier)';\n      break;\n    case asn1.Type.ODESC:\n      rval += ' (Object Descriptor)';\n      break;\n    case asn1.Type.EXTERNAL:\n      rval += ' (External or Instance of)';\n      break;\n    case asn1.Type.REAL:\n      rval += ' (Real)';\n      break;\n    case asn1.Type.ENUMERATED:\n      rval += ' (Enumerated)';\n      break;\n    case asn1.Type.EMBEDDED:\n      rval += ' (Embedded PDV)';\n      break;\n    case asn1.Type.UTF8:\n      rval += ' (UTF8)';\n      break;\n    case asn1.Type.ROID:\n      rval += ' (Relative Object Identifier)';\n      break;\n    case asn1.Type.SEQUENCE:\n      rval += ' (Sequence)';\n      break;\n    case asn1.Type.SET:\n      rval += ' (Set)';\n      break;\n    case asn1.Type.PRINTABLESTRING:\n      rval += ' (Printable String)';\n      break;\n    case asn1.Type.IA5String:\n      rval += ' (IA5String (ASCII))';\n      break;\n    case asn1.Type.UTCTIME:\n      rval += ' (UTC time)';\n      break;\n    case asn1.Type.GENERALIZEDTIME:\n      rval += ' (Generalized time)';\n      break;\n    case asn1.Type.BMPSTRING:\n      rval += ' (BMP String)';\n      break;\n    }\n  } else {\n    rval += obj.type;\n  }\n\n  rval += '\\n';\n  rval += indent + 'Constructed: ' + obj.constructed + '\\n';\n\n  if(obj.composed) {\n    var subvalues = 0;\n    var sub = '';\n    for(var i = 0; i < obj.value.length; ++i) {\n      if(obj.value[i] !== undefined) {\n        subvalues += 1;\n        sub += asn1.prettyPrint(obj.value[i], level + 1, indentation);\n        if((i + 1) < obj.value.length) {\n          sub += ',';\n        }\n      }\n    }\n    rval += indent + 'Sub values: ' + subvalues + sub;\n  } else {\n    rval += indent + 'Value: ';\n    if(obj.type === asn1.Type.OID) {\n      var oid = asn1.derToOid(obj.value);\n      rval += oid;\n      if(forge.pki && forge.pki.oids) {\n        if(oid in forge.pki.oids) {\n          rval += ' (' + forge.pki.oids[oid] + ') ';\n        }\n      }\n    }\n    if(obj.type === asn1.Type.INTEGER) {\n      try {\n        rval += asn1.derToInteger(obj.value);\n      } catch(ex) {\n        rval += '0x' + forge.util.bytesToHex(obj.value);\n      }\n    } else if(obj.type === asn1.Type.BITSTRING) {\n      // TODO: shift bits as needed to display without padding\n      if(obj.value.length > 1) {\n        // remove unused bits field\n        rval += '0x' + forge.util.bytesToHex(obj.value.slice(1));\n      } else {\n        rval += '(none)';\n      }\n      // show unused bit count\n      if(obj.value.length > 0) {\n        var unused = obj.value.charCodeAt(0);\n        if(unused == 1) {\n          rval += ' (1 unused bit shown)';\n        } else if(unused > 1) {\n          rval += ' (' + unused + ' unused bits shown)';\n        }\n      }\n    } else if(obj.type === asn1.Type.OCTETSTRING) {\n      if(!_nonLatinRegex.test(obj.value)) {\n        rval += '(' + obj.value + ') ';\n      }\n      rval += '0x' + forge.util.bytesToHex(obj.value);\n    } else if(obj.type === asn1.Type.UTF8) {\n      rval += forge.util.decodeUtf8(obj.value);\n    } else if(obj.type === asn1.Type.PRINTABLESTRING ||\n      obj.type === asn1.Type.IA5String) {\n      rval += obj.value;\n    } else if(_nonLatinRegex.test(obj.value)) {\n      rval += '0x' + forge.util.bytesToHex(obj.value);\n    } else if(obj.value.length === 0) {\n      rval += '[null]';\n    } else {\n      rval += obj.value;\n    }\n  }\n\n  return rval;\n};\n","/**\n * Node.js module for Forge.\n *\n * @author Dave Longley\n *\n * Copyright 2011-2016 Digital Bazaar, Inc.\n */\nmodule.exports = {\n  // default options\n  options: {\n    usePureJavaScript: false\n  }\n};\n","/**\n * Utility functions for web applications.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2018 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nvar baseN = require('./baseN');\n\n/* Utilities API */\nvar util = module.exports = forge.util = forge.util || {};\n\n// define setImmediate and nextTick\n(function() {\n  // use native nextTick (unless we're in webpack)\n  // webpack (or better node-libs-browser polyfill) sets process.browser.\n  // this way we can detect webpack properly\n  if(typeof process !== 'undefined' && process.nextTick && !process.browser) {\n    util.nextTick = process.nextTick;\n    if(typeof setImmediate === 'function') {\n      util.setImmediate = setImmediate;\n    } else {\n      // polyfill setImmediate with nextTick, older versions of node\n      // (those w/o setImmediate) won't totally starve IO\n      util.setImmediate = util.nextTick;\n    }\n    return;\n  }\n\n  // polyfill nextTick with native setImmediate\n  if(typeof setImmediate === 'function') {\n    util.setImmediate = function() { return setImmediate.apply(undefined, arguments); };\n    util.nextTick = function(callback) {\n      return setImmediate(callback);\n    };\n    return;\n  }\n\n  /* Note: A polyfill upgrade pattern is used here to allow combining\n  polyfills. For example, MutationObserver is fast, but blocks UI updates,\n  so it needs to allow UI updates periodically, so it falls back on\n  postMessage or setTimeout. */\n\n  // polyfill with setTimeout\n  util.setImmediate = function(callback) {\n    setTimeout(callback, 0);\n  };\n\n  // upgrade polyfill to use postMessage\n  if(typeof window !== 'undefined' &&\n    typeof window.postMessage === 'function') {\n    var msg = 'forge.setImmediate';\n    var callbacks = [];\n    util.setImmediate = function(callback) {\n      callbacks.push(callback);\n      // only send message when one hasn't been sent in\n      // the current turn of the event loop\n      if(callbacks.length === 1) {\n        window.postMessage(msg, '*');\n      }\n    };\n    function handler(event) {\n      if(event.source === window && event.data === msg) {\n        event.stopPropagation();\n        var copy = callbacks.slice();\n        callbacks.length = 0;\n        copy.forEach(function(callback) {\n          callback();\n        });\n      }\n    }\n    window.addEventListener('message', handler, true);\n  }\n\n  // upgrade polyfill to use MutationObserver\n  if(typeof MutationObserver !== 'undefined') {\n    // polyfill with MutationObserver\n    var now = Date.now();\n    var attr = true;\n    var div = document.createElement('div');\n    var callbacks = [];\n    new MutationObserver(function() {\n      var copy = callbacks.slice();\n      callbacks.length = 0;\n      copy.forEach(function(callback) {\n        callback();\n      });\n    }).observe(div, {attributes: true});\n    var oldSetImmediate = util.setImmediate;\n    util.setImmediate = function(callback) {\n      if(Date.now() - now > 15) {\n        now = Date.now();\n        oldSetImmediate(callback);\n      } else {\n        callbacks.push(callback);\n        // only trigger observer when it hasn't been triggered in\n        // the current turn of the event loop\n        if(callbacks.length === 1) {\n          div.setAttribute('a', attr = !attr);\n        }\n      }\n    };\n  }\n\n  util.nextTick = util.setImmediate;\n})();\n\n// check if running under Node.js\nutil.isNodejs =\n  typeof process !== 'undefined' && process.versions && process.versions.node;\n\n\n// 'self' will also work in Web Workers (instance of WorkerGlobalScope) while\n// it will point to `window` in the main thread.\n// To remain compatible with older browsers, we fall back to 'window' if 'self'\n// is not available.\nutil.globalScope = (function() {\n  if(util.isNodejs) {\n    return global;\n  }\n\n  return typeof self === 'undefined' ? window : self;\n})();\n\n// define isArray\nutil.isArray = Array.isArray || function(x) {\n  return Object.prototype.toString.call(x) === '[object Array]';\n};\n\n// define isArrayBuffer\nutil.isArrayBuffer = function(x) {\n  return typeof ArrayBuffer !== 'undefined' && x instanceof ArrayBuffer;\n};\n\n// define isArrayBufferView\nutil.isArrayBufferView = function(x) {\n  return x && util.isArrayBuffer(x.buffer) && x.byteLength !== undefined;\n};\n\n/**\n * Ensure a bits param is 8, 16, 24, or 32. Used to validate input for\n * algorithms where bit manipulation, JavaScript limitations, and/or algorithm\n * design only allow for byte operations of a limited size.\n *\n * @param n number of bits.\n *\n * Throw Error if n invalid.\n */\nfunction _checkBitsParam(n) {\n  if(!(n === 8 || n === 16 || n === 24 || n === 32)) {\n    throw new Error('Only 8, 16, 24, or 32 bits supported: ' + n);\n  }\n}\n\n// TODO: set ByteBuffer to best available backing\nutil.ByteBuffer = ByteStringBuffer;\n\n/** Buffer w/BinaryString backing */\n\n/**\n * Constructor for a binary string backed byte buffer.\n *\n * @param [b] the bytes to wrap (either encoded as string, one byte per\n *          character, or as an ArrayBuffer or Typed Array).\n */\nfunction ByteStringBuffer(b) {\n  // TODO: update to match DataBuffer API\n\n  // the data in this buffer\n  this.data = '';\n  // the pointer for reading from this buffer\n  this.read = 0;\n\n  if(typeof b === 'string') {\n    this.data = b;\n  } else if(util.isArrayBuffer(b) || util.isArrayBufferView(b)) {\n    if(typeof Buffer !== 'undefined' && b instanceof Buffer) {\n      this.data = b.toString('binary');\n    } else {\n      // convert native buffer to forge buffer\n      // FIXME: support native buffers internally instead\n      var arr = new Uint8Array(b);\n      try {\n        this.data = String.fromCharCode.apply(null, arr);\n      } catch(e) {\n        for(var i = 0; i < arr.length; ++i) {\n          this.putByte(arr[i]);\n        }\n      }\n    }\n  } else if(b instanceof ByteStringBuffer ||\n    (typeof b === 'object' && typeof b.data === 'string' &&\n    typeof b.read === 'number')) {\n    // copy existing buffer\n    this.data = b.data;\n    this.read = b.read;\n  }\n\n  // used for v8 optimization\n  this._constructedStringLength = 0;\n}\nutil.ByteStringBuffer = ByteStringBuffer;\n\n/* Note: This is an optimization for V8-based browsers. When V8 concatenates\n  a string, the strings are only joined logically using a \"cons string\" or\n  \"constructed/concatenated string\". These containers keep references to one\n  another and can result in very large memory usage. For example, if a 2MB\n  string is constructed by concatenating 4 bytes together at a time, the\n  memory usage will be ~44MB; so ~22x increase. The strings are only joined\n  together when an operation requiring their joining takes place, such as\n  substr(). This function is called when adding data to this buffer to ensure\n  these types of strings are periodically joined to reduce the memory\n  footprint. */\nvar _MAX_CONSTRUCTED_STRING_LENGTH = 4096;\nutil.ByteStringBuffer.prototype._optimizeConstructedString = function(x) {\n  this._constructedStringLength += x;\n  if(this._constructedStringLength > _MAX_CONSTRUCTED_STRING_LENGTH) {\n    // this substr() should cause the constructed string to join\n    this.data.substr(0, 1);\n    this._constructedStringLength = 0;\n  }\n};\n\n/**\n * Gets the number of bytes in this buffer.\n *\n * @return the number of bytes in this buffer.\n */\nutil.ByteStringBuffer.prototype.length = function() {\n  return this.data.length - this.read;\n};\n\n/**\n * Gets whether or not this buffer is empty.\n *\n * @return true if this buffer is empty, false if not.\n */\nutil.ByteStringBuffer.prototype.isEmpty = function() {\n  return this.length() <= 0;\n};\n\n/**\n * Puts a byte in this buffer.\n *\n * @param b the byte to put.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putByte = function(b) {\n  return this.putBytes(String.fromCharCode(b));\n};\n\n/**\n * Puts a byte in this buffer N times.\n *\n * @param b the byte to put.\n * @param n the number of bytes of value b to put.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.fillWithByte = function(b, n) {\n  b = String.fromCharCode(b);\n  var d = this.data;\n  while(n > 0) {\n    if(n & 1) {\n      d += b;\n    }\n    n >>>= 1;\n    if(n > 0) {\n      b += b;\n    }\n  }\n  this.data = d;\n  this._optimizeConstructedString(n);\n  return this;\n};\n\n/**\n * Puts bytes in this buffer.\n *\n * @param bytes the bytes (as a binary encoded string) to put.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putBytes = function(bytes) {\n  this.data += bytes;\n  this._optimizeConstructedString(bytes.length);\n  return this;\n};\n\n/**\n * Puts a UTF-16 encoded string into this buffer.\n *\n * @param str the string to put.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putString = function(str) {\n  return this.putBytes(util.encodeUtf8(str));\n};\n\n/**\n * Puts a 16-bit integer in this buffer in big-endian order.\n *\n * @param i the 16-bit integer.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putInt16 = function(i) {\n  return this.putBytes(\n    String.fromCharCode(i >> 8 & 0xFF) +\n    String.fromCharCode(i & 0xFF));\n};\n\n/**\n * Puts a 24-bit integer in this buffer in big-endian order.\n *\n * @param i the 24-bit integer.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putInt24 = function(i) {\n  return this.putBytes(\n    String.fromCharCode(i >> 16 & 0xFF) +\n    String.fromCharCode(i >> 8 & 0xFF) +\n    String.fromCharCode(i & 0xFF));\n};\n\n/**\n * Puts a 32-bit integer in this buffer in big-endian order.\n *\n * @param i the 32-bit integer.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putInt32 = function(i) {\n  return this.putBytes(\n    String.fromCharCode(i >> 24 & 0xFF) +\n    String.fromCharCode(i >> 16 & 0xFF) +\n    String.fromCharCode(i >> 8 & 0xFF) +\n    String.fromCharCode(i & 0xFF));\n};\n\n/**\n * Puts a 16-bit integer in this buffer in little-endian order.\n *\n * @param i the 16-bit integer.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putInt16Le = function(i) {\n  return this.putBytes(\n    String.fromCharCode(i & 0xFF) +\n    String.fromCharCode(i >> 8 & 0xFF));\n};\n\n/**\n * Puts a 24-bit integer in this buffer in little-endian order.\n *\n * @param i the 24-bit integer.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putInt24Le = function(i) {\n  return this.putBytes(\n    String.fromCharCode(i & 0xFF) +\n    String.fromCharCode(i >> 8 & 0xFF) +\n    String.fromCharCode(i >> 16 & 0xFF));\n};\n\n/**\n * Puts a 32-bit integer in this buffer in little-endian order.\n *\n * @param i the 32-bit integer.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putInt32Le = function(i) {\n  return this.putBytes(\n    String.fromCharCode(i & 0xFF) +\n    String.fromCharCode(i >> 8 & 0xFF) +\n    String.fromCharCode(i >> 16 & 0xFF) +\n    String.fromCharCode(i >> 24 & 0xFF));\n};\n\n/**\n * Puts an n-bit integer in this buffer in big-endian order.\n *\n * @param i the n-bit integer.\n * @param n the number of bits in the integer (8, 16, 24, or 32).\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putInt = function(i, n) {\n  _checkBitsParam(n);\n  var bytes = '';\n  do {\n    n -= 8;\n    bytes += String.fromCharCode((i >> n) & 0xFF);\n  } while(n > 0);\n  return this.putBytes(bytes);\n};\n\n/**\n * Puts a signed n-bit integer in this buffer in big-endian order. Two's\n * complement representation is used.\n *\n * @param i the n-bit integer.\n * @param n the number of bits in the integer (8, 16, 24, or 32).\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putSignedInt = function(i, n) {\n  // putInt checks n\n  if(i < 0) {\n    i += 2 << (n - 1);\n  }\n  return this.putInt(i, n);\n};\n\n/**\n * Puts the given buffer into this buffer.\n *\n * @param buffer the buffer to put into this one.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.putBuffer = function(buffer) {\n  return this.putBytes(buffer.getBytes());\n};\n\n/**\n * Gets a byte from this buffer and advances the read pointer by 1.\n *\n * @return the byte.\n */\nutil.ByteStringBuffer.prototype.getByte = function() {\n  return this.data.charCodeAt(this.read++);\n};\n\n/**\n * Gets a uint16 from this buffer in big-endian order and advances the read\n * pointer by 2.\n *\n * @return the uint16.\n */\nutil.ByteStringBuffer.prototype.getInt16 = function() {\n  var rval = (\n    this.data.charCodeAt(this.read) << 8 ^\n    this.data.charCodeAt(this.read + 1));\n  this.read += 2;\n  return rval;\n};\n\n/**\n * Gets a uint24 from this buffer in big-endian order and advances the read\n * pointer by 3.\n *\n * @return the uint24.\n */\nutil.ByteStringBuffer.prototype.getInt24 = function() {\n  var rval = (\n    this.data.charCodeAt(this.read) << 16 ^\n    this.data.charCodeAt(this.read + 1) << 8 ^\n    this.data.charCodeAt(this.read + 2));\n  this.read += 3;\n  return rval;\n};\n\n/**\n * Gets a uint32 from this buffer in big-endian order and advances the read\n * pointer by 4.\n *\n * @return the word.\n */\nutil.ByteStringBuffer.prototype.getInt32 = function() {\n  var rval = (\n    this.data.charCodeAt(this.read) << 24 ^\n    this.data.charCodeAt(this.read + 1) << 16 ^\n    this.data.charCodeAt(this.read + 2) << 8 ^\n    this.data.charCodeAt(this.read + 3));\n  this.read += 4;\n  return rval;\n};\n\n/**\n * Gets a uint16 from this buffer in little-endian order and advances the read\n * pointer by 2.\n *\n * @return the uint16.\n */\nutil.ByteStringBuffer.prototype.getInt16Le = function() {\n  var rval = (\n    this.data.charCodeAt(this.read) ^\n    this.data.charCodeAt(this.read + 1) << 8);\n  this.read += 2;\n  return rval;\n};\n\n/**\n * Gets a uint24 from this buffer in little-endian order and advances the read\n * pointer by 3.\n *\n * @return the uint24.\n */\nutil.ByteStringBuffer.prototype.getInt24Le = function() {\n  var rval = (\n    this.data.charCodeAt(this.read) ^\n    this.data.charCodeAt(this.read + 1) << 8 ^\n    this.data.charCodeAt(this.read + 2) << 16);\n  this.read += 3;\n  return rval;\n};\n\n/**\n * Gets a uint32 from this buffer in little-endian order and advances the read\n * pointer by 4.\n *\n * @return the word.\n */\nutil.ByteStringBuffer.prototype.getInt32Le = function() {\n  var rval = (\n    this.data.charCodeAt(this.read) ^\n    this.data.charCodeAt(this.read + 1) << 8 ^\n    this.data.charCodeAt(this.read + 2) << 16 ^\n    this.data.charCodeAt(this.read + 3) << 24);\n  this.read += 4;\n  return rval;\n};\n\n/**\n * Gets an n-bit integer from this buffer in big-endian order and advances the\n * read pointer by ceil(n/8).\n *\n * @param n the number of bits in the integer (8, 16, 24, or 32).\n *\n * @return the integer.\n */\nutil.ByteStringBuffer.prototype.getInt = function(n) {\n  _checkBitsParam(n);\n  var rval = 0;\n  do {\n    // TODO: Use (rval * 0x100) if adding support for 33 to 53 bits.\n    rval = (rval << 8) + this.data.charCodeAt(this.read++);\n    n -= 8;\n  } while(n > 0);\n  return rval;\n};\n\n/**\n * Gets a signed n-bit integer from this buffer in big-endian order, using\n * two's complement, and advances the read pointer by n/8.\n *\n * @param n the number of bits in the integer (8, 16, 24, or 32).\n *\n * @return the integer.\n */\nutil.ByteStringBuffer.prototype.getSignedInt = function(n) {\n  // getInt checks n\n  var x = this.getInt(n);\n  var max = 2 << (n - 2);\n  if(x >= max) {\n    x -= max << 1;\n  }\n  return x;\n};\n\n/**\n * Reads bytes out as a binary encoded string and clears them from the\n * buffer. Note that the resulting string is binary encoded (in node.js this\n * encoding is referred to as `binary`, it is *not* `utf8`).\n *\n * @param count the number of bytes to read, undefined or null for all.\n *\n * @return a binary encoded string of bytes.\n */\nutil.ByteStringBuffer.prototype.getBytes = function(count) {\n  var rval;\n  if(count) {\n    // read count bytes\n    count = Math.min(this.length(), count);\n    rval = this.data.slice(this.read, this.read + count);\n    this.read += count;\n  } else if(count === 0) {\n    rval = '';\n  } else {\n    // read all bytes, optimize to only copy when needed\n    rval = (this.read === 0) ? this.data : this.data.slice(this.read);\n    this.clear();\n  }\n  return rval;\n};\n\n/**\n * Gets a binary encoded string of the bytes from this buffer without\n * modifying the read pointer.\n *\n * @param count the number of bytes to get, omit to get all.\n *\n * @return a string full of binary encoded characters.\n */\nutil.ByteStringBuffer.prototype.bytes = function(count) {\n  return (typeof(count) === 'undefined' ?\n    this.data.slice(this.read) :\n    this.data.slice(this.read, this.read + count));\n};\n\n/**\n * Gets a byte at the given index without modifying the read pointer.\n *\n * @param i the byte index.\n *\n * @return the byte.\n */\nutil.ByteStringBuffer.prototype.at = function(i) {\n  return this.data.charCodeAt(this.read + i);\n};\n\n/**\n * Puts a byte at the given index without modifying the read pointer.\n *\n * @param i the byte index.\n * @param b the byte to put.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.setAt = function(i, b) {\n  this.data = this.data.substr(0, this.read + i) +\n    String.fromCharCode(b) +\n    this.data.substr(this.read + i + 1);\n  return this;\n};\n\n/**\n * Gets the last byte without modifying the read pointer.\n *\n * @return the last byte.\n */\nutil.ByteStringBuffer.prototype.last = function() {\n  return this.data.charCodeAt(this.data.length - 1);\n};\n\n/**\n * Creates a copy of this buffer.\n *\n * @return the copy.\n */\nutil.ByteStringBuffer.prototype.copy = function() {\n  var c = util.createBuffer(this.data);\n  c.read = this.read;\n  return c;\n};\n\n/**\n * Compacts this buffer.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.compact = function() {\n  if(this.read > 0) {\n    this.data = this.data.slice(this.read);\n    this.read = 0;\n  }\n  return this;\n};\n\n/**\n * Clears this buffer.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.clear = function() {\n  this.data = '';\n  this.read = 0;\n  return this;\n};\n\n/**\n * Shortens this buffer by triming bytes off of the end of this buffer.\n *\n * @param count the number of bytes to trim off.\n *\n * @return this buffer.\n */\nutil.ByteStringBuffer.prototype.truncate = function(count) {\n  var len = Math.max(0, this.length() - count);\n  this.data = this.data.substr(this.read, len);\n  this.read = 0;\n  return this;\n};\n\n/**\n * Converts this buffer to a hexadecimal string.\n *\n * @return a hexadecimal string.\n */\nutil.ByteStringBuffer.prototype.toHex = function() {\n  var rval = '';\n  for(var i = this.read; i < this.data.length; ++i) {\n    var b = this.data.charCodeAt(i);\n    if(b < 16) {\n      rval += '0';\n    }\n    rval += b.toString(16);\n  }\n  return rval;\n};\n\n/**\n * Converts this buffer to a UTF-16 string (standard JavaScript string).\n *\n * @return a UTF-16 string.\n */\nutil.ByteStringBuffer.prototype.toString = function() {\n  return util.decodeUtf8(this.bytes());\n};\n\n/** End Buffer w/BinaryString backing */\n\n/** Buffer w/UInt8Array backing */\n\n/**\n * FIXME: Experimental. Do not use yet.\n *\n * Constructor for an ArrayBuffer-backed byte buffer.\n *\n * The buffer may be constructed from a string, an ArrayBuffer, DataView, or a\n * TypedArray.\n *\n * If a string is given, its encoding should be provided as an option,\n * otherwise it will default to 'binary'. A 'binary' string is encoded such\n * that each character is one byte in length and size.\n *\n * If an ArrayBuffer, DataView, or TypedArray is given, it will be used\n * *directly* without any copying. Note that, if a write to the buffer requires\n * more space, the buffer will allocate a new backing ArrayBuffer to\n * accommodate. The starting read and write offsets for the buffer may be\n * given as options.\n *\n * @param [b] the initial bytes for this buffer.\n * @param options the options to use:\n *          [readOffset] the starting read offset to use (default: 0).\n *          [writeOffset] the starting write offset to use (default: the\n *            length of the first parameter).\n *          [growSize] the minimum amount, in bytes, to grow the buffer by to\n *            accommodate writes (default: 1024).\n *          [encoding] the encoding ('binary', 'utf8', 'utf16', 'hex') for the\n *            first parameter, if it is a string (default: 'binary').\n */\nfunction DataBuffer(b, options) {\n  // default options\n  options = options || {};\n\n  // pointers for read from/write to buffer\n  this.read = options.readOffset || 0;\n  this.growSize = options.growSize || 1024;\n\n  var isArrayBuffer = util.isArrayBuffer(b);\n  var isArrayBufferView = util.isArrayBufferView(b);\n  if(isArrayBuffer || isArrayBufferView) {\n    // use ArrayBuffer directly\n    if(isArrayBuffer) {\n      this.data = new DataView(b);\n    } else {\n      // TODO: adjust read/write offset based on the type of view\n      // or specify that this must be done in the options ... that the\n      // offsets are byte-based\n      this.data = new DataView(b.buffer, b.byteOffset, b.byteLength);\n    }\n    this.write = ('writeOffset' in options ?\n      options.writeOffset : this.data.byteLength);\n    return;\n  }\n\n  // initialize to empty array buffer and add any given bytes using putBytes\n  this.data = new DataView(new ArrayBuffer(0));\n  this.write = 0;\n\n  if(b !== null && b !== undefined) {\n    this.putBytes(b);\n  }\n\n  if('writeOffset' in options) {\n    this.write = options.writeOffset;\n  }\n}\nutil.DataBuffer = DataBuffer;\n\n/**\n * Gets the number of bytes in this buffer.\n *\n * @return the number of bytes in this buffer.\n */\nutil.DataBuffer.prototype.length = function() {\n  return this.write - this.read;\n};\n\n/**\n * Gets whether or not this buffer is empty.\n *\n * @return true if this buffer is empty, false if not.\n */\nutil.DataBuffer.prototype.isEmpty = function() {\n  return this.length() <= 0;\n};\n\n/**\n * Ensures this buffer has enough empty space to accommodate the given number\n * of bytes. An optional parameter may be given that indicates a minimum\n * amount to grow the buffer if necessary. If the parameter is not given,\n * the buffer will be grown by some previously-specified default amount\n * or heuristic.\n *\n * @param amount the number of bytes to accommodate.\n * @param [growSize] the minimum amount, in bytes, to grow the buffer by if\n *          necessary.\n */\nutil.DataBuffer.prototype.accommodate = function(amount, growSize) {\n  if(this.length() >= amount) {\n    return this;\n  }\n  growSize = Math.max(growSize || this.growSize, amount);\n\n  // grow buffer\n  var src = new Uint8Array(\n    this.data.buffer, this.data.byteOffset, this.data.byteLength);\n  var dst = new Uint8Array(this.length() + growSize);\n  dst.set(src);\n  this.data = new DataView(dst.buffer);\n\n  return this;\n};\n\n/**\n * Puts a byte in this buffer.\n *\n * @param b the byte to put.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putByte = function(b) {\n  this.accommodate(1);\n  this.data.setUint8(this.write++, b);\n  return this;\n};\n\n/**\n * Puts a byte in this buffer N times.\n *\n * @param b the byte to put.\n * @param n the number of bytes of value b to put.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.fillWithByte = function(b, n) {\n  this.accommodate(n);\n  for(var i = 0; i < n; ++i) {\n    this.data.setUint8(b);\n  }\n  return this;\n};\n\n/**\n * Puts bytes in this buffer. The bytes may be given as a string, an\n * ArrayBuffer, a DataView, or a TypedArray.\n *\n * @param bytes the bytes to put.\n * @param [encoding] the encoding for the first parameter ('binary', 'utf8',\n *          'utf16', 'hex'), if it is a string (default: 'binary').\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putBytes = function(bytes, encoding) {\n  if(util.isArrayBufferView(bytes)) {\n    var src = new Uint8Array(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n    var len = src.byteLength - src.byteOffset;\n    this.accommodate(len);\n    var dst = new Uint8Array(this.data.buffer, this.write);\n    dst.set(src);\n    this.write += len;\n    return this;\n  }\n\n  if(util.isArrayBuffer(bytes)) {\n    var src = new Uint8Array(bytes);\n    this.accommodate(src.byteLength);\n    var dst = new Uint8Array(this.data.buffer);\n    dst.set(src, this.write);\n    this.write += src.byteLength;\n    return this;\n  }\n\n  // bytes is a util.DataBuffer or equivalent\n  if(bytes instanceof util.DataBuffer ||\n    (typeof bytes === 'object' &&\n    typeof bytes.read === 'number' && typeof bytes.write === 'number' &&\n    util.isArrayBufferView(bytes.data))) {\n    var src = new Uint8Array(bytes.data.byteLength, bytes.read, bytes.length());\n    this.accommodate(src.byteLength);\n    var dst = new Uint8Array(bytes.data.byteLength, this.write);\n    dst.set(src);\n    this.write += src.byteLength;\n    return this;\n  }\n\n  if(bytes instanceof util.ByteStringBuffer) {\n    // copy binary string and process as the same as a string parameter below\n    bytes = bytes.data;\n    encoding = 'binary';\n  }\n\n  // string conversion\n  encoding = encoding || 'binary';\n  if(typeof bytes === 'string') {\n    var view;\n\n    // decode from string\n    if(encoding === 'hex') {\n      this.accommodate(Math.ceil(bytes.length / 2));\n      view = new Uint8Array(this.data.buffer, this.write);\n      this.write += util.binary.hex.decode(bytes, view, this.write);\n      return this;\n    }\n    if(encoding === 'base64') {\n      this.accommodate(Math.ceil(bytes.length / 4) * 3);\n      view = new Uint8Array(this.data.buffer, this.write);\n      this.write += util.binary.base64.decode(bytes, view, this.write);\n      return this;\n    }\n\n    // encode text as UTF-8 bytes\n    if(encoding === 'utf8') {\n      // encode as UTF-8 then decode string as raw binary\n      bytes = util.encodeUtf8(bytes);\n      encoding = 'binary';\n    }\n\n    // decode string as raw binary\n    if(encoding === 'binary' || encoding === 'raw') {\n      // one byte per character\n      this.accommodate(bytes.length);\n      view = new Uint8Array(this.data.buffer, this.write);\n      this.write += util.binary.raw.decode(view);\n      return this;\n    }\n\n    // encode text as UTF-16 bytes\n    if(encoding === 'utf16') {\n      // two bytes per character\n      this.accommodate(bytes.length * 2);\n      view = new Uint16Array(this.data.buffer, this.write);\n      this.write += util.text.utf16.encode(view);\n      return this;\n    }\n\n    throw new Error('Invalid encoding: ' + encoding);\n  }\n\n  throw Error('Invalid parameter: ' + bytes);\n};\n\n/**\n * Puts the given buffer into this buffer.\n *\n * @param buffer the buffer to put into this one.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putBuffer = function(buffer) {\n  this.putBytes(buffer);\n  buffer.clear();\n  return this;\n};\n\n/**\n * Puts a string into this buffer.\n *\n * @param str the string to put.\n * @param [encoding] the encoding for the string (default: 'utf16').\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putString = function(str) {\n  return this.putBytes(str, 'utf16');\n};\n\n/**\n * Puts a 16-bit integer in this buffer in big-endian order.\n *\n * @param i the 16-bit integer.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putInt16 = function(i) {\n  this.accommodate(2);\n  this.data.setInt16(this.write, i);\n  this.write += 2;\n  return this;\n};\n\n/**\n * Puts a 24-bit integer in this buffer in big-endian order.\n *\n * @param i the 24-bit integer.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putInt24 = function(i) {\n  this.accommodate(3);\n  this.data.setInt16(this.write, i >> 8 & 0xFFFF);\n  this.data.setInt8(this.write, i >> 16 & 0xFF);\n  this.write += 3;\n  return this;\n};\n\n/**\n * Puts a 32-bit integer in this buffer in big-endian order.\n *\n * @param i the 32-bit integer.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putInt32 = function(i) {\n  this.accommodate(4);\n  this.data.setInt32(this.write, i);\n  this.write += 4;\n  return this;\n};\n\n/**\n * Puts a 16-bit integer in this buffer in little-endian order.\n *\n * @param i the 16-bit integer.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putInt16Le = function(i) {\n  this.accommodate(2);\n  this.data.setInt16(this.write, i, true);\n  this.write += 2;\n  return this;\n};\n\n/**\n * Puts a 24-bit integer in this buffer in little-endian order.\n *\n * @param i the 24-bit integer.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putInt24Le = function(i) {\n  this.accommodate(3);\n  this.data.setInt8(this.write, i >> 16 & 0xFF);\n  this.data.setInt16(this.write, i >> 8 & 0xFFFF, true);\n  this.write += 3;\n  return this;\n};\n\n/**\n * Puts a 32-bit integer in this buffer in little-endian order.\n *\n * @param i the 32-bit integer.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putInt32Le = function(i) {\n  this.accommodate(4);\n  this.data.setInt32(this.write, i, true);\n  this.write += 4;\n  return this;\n};\n\n/**\n * Puts an n-bit integer in this buffer in big-endian order.\n *\n * @param i the n-bit integer.\n * @param n the number of bits in the integer (8, 16, 24, or 32).\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putInt = function(i, n) {\n  _checkBitsParam(n);\n  this.accommodate(n / 8);\n  do {\n    n -= 8;\n    this.data.setInt8(this.write++, (i >> n) & 0xFF);\n  } while(n > 0);\n  return this;\n};\n\n/**\n * Puts a signed n-bit integer in this buffer in big-endian order. Two's\n * complement representation is used.\n *\n * @param i the n-bit integer.\n * @param n the number of bits in the integer.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.putSignedInt = function(i, n) {\n  _checkBitsParam(n);\n  this.accommodate(n / 8);\n  if(i < 0) {\n    i += 2 << (n - 1);\n  }\n  return this.putInt(i, n);\n};\n\n/**\n * Gets a byte from this buffer and advances the read pointer by 1.\n *\n * @return the byte.\n */\nutil.DataBuffer.prototype.getByte = function() {\n  return this.data.getInt8(this.read++);\n};\n\n/**\n * Gets a uint16 from this buffer in big-endian order and advances the read\n * pointer by 2.\n *\n * @return the uint16.\n */\nutil.DataBuffer.prototype.getInt16 = function() {\n  var rval = this.data.getInt16(this.read);\n  this.read += 2;\n  return rval;\n};\n\n/**\n * Gets a uint24 from this buffer in big-endian order and advances the read\n * pointer by 3.\n *\n * @return the uint24.\n */\nutil.DataBuffer.prototype.getInt24 = function() {\n  var rval = (\n    this.data.getInt16(this.read) << 8 ^\n    this.data.getInt8(this.read + 2));\n  this.read += 3;\n  return rval;\n};\n\n/**\n * Gets a uint32 from this buffer in big-endian order and advances the read\n * pointer by 4.\n *\n * @return the word.\n */\nutil.DataBuffer.prototype.getInt32 = function() {\n  var rval = this.data.getInt32(this.read);\n  this.read += 4;\n  return rval;\n};\n\n/**\n * Gets a uint16 from this buffer in little-endian order and advances the read\n * pointer by 2.\n *\n * @return the uint16.\n */\nutil.DataBuffer.prototype.getInt16Le = function() {\n  var rval = this.data.getInt16(this.read, true);\n  this.read += 2;\n  return rval;\n};\n\n/**\n * Gets a uint24 from this buffer in little-endian order and advances the read\n * pointer by 3.\n *\n * @return the uint24.\n */\nutil.DataBuffer.prototype.getInt24Le = function() {\n  var rval = (\n    this.data.getInt8(this.read) ^\n    this.data.getInt16(this.read + 1, true) << 8);\n  this.read += 3;\n  return rval;\n};\n\n/**\n * Gets a uint32 from this buffer in little-endian order and advances the read\n * pointer by 4.\n *\n * @return the word.\n */\nutil.DataBuffer.prototype.getInt32Le = function() {\n  var rval = this.data.getInt32(this.read, true);\n  this.read += 4;\n  return rval;\n};\n\n/**\n * Gets an n-bit integer from this buffer in big-endian order and advances the\n * read pointer by n/8.\n *\n * @param n the number of bits in the integer (8, 16, 24, or 32).\n *\n * @return the integer.\n */\nutil.DataBuffer.prototype.getInt = function(n) {\n  _checkBitsParam(n);\n  var rval = 0;\n  do {\n    // TODO: Use (rval * 0x100) if adding support for 33 to 53 bits.\n    rval = (rval << 8) + this.data.getInt8(this.read++);\n    n -= 8;\n  } while(n > 0);\n  return rval;\n};\n\n/**\n * Gets a signed n-bit integer from this buffer in big-endian order, using\n * two's complement, and advances the read pointer by n/8.\n *\n * @param n the number of bits in the integer (8, 16, 24, or 32).\n *\n * @return the integer.\n */\nutil.DataBuffer.prototype.getSignedInt = function(n) {\n  // getInt checks n\n  var x = this.getInt(n);\n  var max = 2 << (n - 2);\n  if(x >= max) {\n    x -= max << 1;\n  }\n  return x;\n};\n\n/**\n * Reads bytes out as a binary encoded string and clears them from the\n * buffer.\n *\n * @param count the number of bytes to read, undefined or null for all.\n *\n * @return a binary encoded string of bytes.\n */\nutil.DataBuffer.prototype.getBytes = function(count) {\n  // TODO: deprecate this method, it is poorly named and\n  // this.toString('binary') replaces it\n  // add a toTypedArray()/toArrayBuffer() function\n  var rval;\n  if(count) {\n    // read count bytes\n    count = Math.min(this.length(), count);\n    rval = this.data.slice(this.read, this.read + count);\n    this.read += count;\n  } else if(count === 0) {\n    rval = '';\n  } else {\n    // read all bytes, optimize to only copy when needed\n    rval = (this.read === 0) ? this.data : this.data.slice(this.read);\n    this.clear();\n  }\n  return rval;\n};\n\n/**\n * Gets a binary encoded string of the bytes from this buffer without\n * modifying the read pointer.\n *\n * @param count the number of bytes to get, omit to get all.\n *\n * @return a string full of binary encoded characters.\n */\nutil.DataBuffer.prototype.bytes = function(count) {\n  // TODO: deprecate this method, it is poorly named, add \"getString()\"\n  return (typeof(count) === 'undefined' ?\n    this.data.slice(this.read) :\n    this.data.slice(this.read, this.read + count));\n};\n\n/**\n * Gets a byte at the given index without modifying the read pointer.\n *\n * @param i the byte index.\n *\n * @return the byte.\n */\nutil.DataBuffer.prototype.at = function(i) {\n  return this.data.getUint8(this.read + i);\n};\n\n/**\n * Puts a byte at the given index without modifying the read pointer.\n *\n * @param i the byte index.\n * @param b the byte to put.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.setAt = function(i, b) {\n  this.data.setUint8(i, b);\n  return this;\n};\n\n/**\n * Gets the last byte without modifying the read pointer.\n *\n * @return the last byte.\n */\nutil.DataBuffer.prototype.last = function() {\n  return this.data.getUint8(this.write - 1);\n};\n\n/**\n * Creates a copy of this buffer.\n *\n * @return the copy.\n */\nutil.DataBuffer.prototype.copy = function() {\n  return new util.DataBuffer(this);\n};\n\n/**\n * Compacts this buffer.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.compact = function() {\n  if(this.read > 0) {\n    var src = new Uint8Array(this.data.buffer, this.read);\n    var dst = new Uint8Array(src.byteLength);\n    dst.set(src);\n    this.data = new DataView(dst);\n    this.write -= this.read;\n    this.read = 0;\n  }\n  return this;\n};\n\n/**\n * Clears this buffer.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.clear = function() {\n  this.data = new DataView(new ArrayBuffer(0));\n  this.read = this.write = 0;\n  return this;\n};\n\n/**\n * Shortens this buffer by triming bytes off of the end of this buffer.\n *\n * @param count the number of bytes to trim off.\n *\n * @return this buffer.\n */\nutil.DataBuffer.prototype.truncate = function(count) {\n  this.write = Math.max(0, this.length() - count);\n  this.read = Math.min(this.read, this.write);\n  return this;\n};\n\n/**\n * Converts this buffer to a hexadecimal string.\n *\n * @return a hexadecimal string.\n */\nutil.DataBuffer.prototype.toHex = function() {\n  var rval = '';\n  for(var i = this.read; i < this.data.byteLength; ++i) {\n    var b = this.data.getUint8(i);\n    if(b < 16) {\n      rval += '0';\n    }\n    rval += b.toString(16);\n  }\n  return rval;\n};\n\n/**\n * Converts this buffer to a string, using the given encoding. If no\n * encoding is given, 'utf8' (UTF-8) is used.\n *\n * @param [encoding] the encoding to use: 'binary', 'utf8', 'utf16', 'hex',\n *          'base64' (default: 'utf8').\n *\n * @return a string representation of the bytes in this buffer.\n */\nutil.DataBuffer.prototype.toString = function(encoding) {\n  var view = new Uint8Array(this.data, this.read, this.length());\n  encoding = encoding || 'utf8';\n\n  // encode to string\n  if(encoding === 'binary' || encoding === 'raw') {\n    return util.binary.raw.encode(view);\n  }\n  if(encoding === 'hex') {\n    return util.binary.hex.encode(view);\n  }\n  if(encoding === 'base64') {\n    return util.binary.base64.encode(view);\n  }\n\n  // decode to text\n  if(encoding === 'utf8') {\n    return util.text.utf8.decode(view);\n  }\n  if(encoding === 'utf16') {\n    return util.text.utf16.decode(view);\n  }\n\n  throw new Error('Invalid encoding: ' + encoding);\n};\n\n/** End Buffer w/UInt8Array backing */\n\n/**\n * Creates a buffer that stores bytes. A value may be given to populate the\n * buffer with data. This value can either be string of encoded bytes or a\n * regular string of characters. When passing a string of binary encoded\n * bytes, the encoding `raw` should be given. This is also the default. When\n * passing a string of characters, the encoding `utf8` should be given.\n *\n * @param [input] a string with encoded bytes to store in the buffer.\n * @param [encoding] (default: 'raw', other: 'utf8').\n */\nutil.createBuffer = function(input, encoding) {\n  // TODO: deprecate, use new ByteBuffer() instead\n  encoding = encoding || 'raw';\n  if(input !== undefined && encoding === 'utf8') {\n    input = util.encodeUtf8(input);\n  }\n  return new util.ByteBuffer(input);\n};\n\n/**\n * Fills a string with a particular value. If you want the string to be a byte\n * string, pass in String.fromCharCode(theByte).\n *\n * @param c the character to fill the string with, use String.fromCharCode\n *          to fill the string with a byte value.\n * @param n the number of characters of value c to fill with.\n *\n * @return the filled string.\n */\nutil.fillString = function(c, n) {\n  var s = '';\n  while(n > 0) {\n    if(n & 1) {\n      s += c;\n    }\n    n >>>= 1;\n    if(n > 0) {\n      c += c;\n    }\n  }\n  return s;\n};\n\n/**\n * Performs a per byte XOR between two byte strings and returns the result as a\n * string of bytes.\n *\n * @param s1 first string of bytes.\n * @param s2 second string of bytes.\n * @param n the number of bytes to XOR.\n *\n * @return the XOR'd result.\n */\nutil.xorBytes = function(s1, s2, n) {\n  var s3 = '';\n  var b = '';\n  var t = '';\n  var i = 0;\n  var c = 0;\n  for(; n > 0; --n, ++i) {\n    b = s1.charCodeAt(i) ^ s2.charCodeAt(i);\n    if(c >= 10) {\n      s3 += t;\n      t = '';\n      c = 0;\n    }\n    t += String.fromCharCode(b);\n    ++c;\n  }\n  s3 += t;\n  return s3;\n};\n\n/**\n * Converts a hex string into a 'binary' encoded string of bytes.\n *\n * @param hex the hexadecimal string to convert.\n *\n * @return the binary-encoded string of bytes.\n */\nutil.hexToBytes = function(hex) {\n  // TODO: deprecate: \"Deprecated. Use util.binary.hex.decode instead.\"\n  var rval = '';\n  var i = 0;\n  if(hex.length & 1 == 1) {\n    // odd number of characters, convert first character alone\n    i = 1;\n    rval += String.fromCharCode(parseInt(hex[0], 16));\n  }\n  // convert 2 characters (1 byte) at a time\n  for(; i < hex.length; i += 2) {\n    rval += String.fromCharCode(parseInt(hex.substr(i, 2), 16));\n  }\n  return rval;\n};\n\n/**\n * Converts a 'binary' encoded string of bytes to hex.\n *\n * @param bytes the byte string to convert.\n *\n * @return the string of hexadecimal characters.\n */\nutil.bytesToHex = function(bytes) {\n  // TODO: deprecate: \"Deprecated. Use util.binary.hex.encode instead.\"\n  return util.createBuffer(bytes).toHex();\n};\n\n/**\n * Converts an 32-bit integer to 4-big-endian byte string.\n *\n * @param i the integer.\n *\n * @return the byte string.\n */\nutil.int32ToBytes = function(i) {\n  return (\n    String.fromCharCode(i >> 24 & 0xFF) +\n    String.fromCharCode(i >> 16 & 0xFF) +\n    String.fromCharCode(i >> 8 & 0xFF) +\n    String.fromCharCode(i & 0xFF));\n};\n\n// base64 characters, reverse mapping\nvar _base64 =\n  'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';\nvar _base64Idx = [\n/*43 -43 = 0*/\n/*'+',  1,  2,  3,'/' */\n   62, -1, -1, -1, 63,\n\n/*'0','1','2','3','4','5','6','7','8','9' */\n   52, 53, 54, 55, 56, 57, 58, 59, 60, 61,\n\n/*15, 16, 17,'=', 19, 20, 21 */\n  -1, -1, -1, 64, -1, -1, -1,\n\n/*65 - 43 = 22*/\n/*'A','B','C','D','E','F','G','H','I','J','K','L','M', */\n   0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12,\n\n/*'N','O','P','Q','R','S','T','U','V','W','X','Y','Z' */\n   13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,\n\n/*91 - 43 = 48 */\n/*48, 49, 50, 51, 52, 53 */\n  -1, -1, -1, -1, -1, -1,\n\n/*97 - 43 = 54*/\n/*'a','b','c','d','e','f','g','h','i','j','k','l','m' */\n   26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38,\n\n/*'n','o','p','q','r','s','t','u','v','w','x','y','z' */\n   39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51\n];\n\n// base58 characters (Bitcoin alphabet)\nvar _base58 = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';\n\n/**\n * Base64 encodes a 'binary' encoded string of bytes.\n *\n * @param input the binary encoded string of bytes to base64-encode.\n * @param maxline the maximum number of encoded characters per line to use,\n *          defaults to none.\n *\n * @return the base64-encoded output.\n */\nutil.encode64 = function(input, maxline) {\n  // TODO: deprecate: \"Deprecated. Use util.binary.base64.encode instead.\"\n  var line = '';\n  var output = '';\n  var chr1, chr2, chr3;\n  var i = 0;\n  while(i < input.length) {\n    chr1 = input.charCodeAt(i++);\n    chr2 = input.charCodeAt(i++);\n    chr3 = input.charCodeAt(i++);\n\n    // encode 4 character group\n    line += _base64.charAt(chr1 >> 2);\n    line += _base64.charAt(((chr1 & 3) << 4) | (chr2 >> 4));\n    if(isNaN(chr2)) {\n      line += '==';\n    } else {\n      line += _base64.charAt(((chr2 & 15) << 2) | (chr3 >> 6));\n      line += isNaN(chr3) ? '=' : _base64.charAt(chr3 & 63);\n    }\n\n    if(maxline && line.length > maxline) {\n      output += line.substr(0, maxline) + '\\r\\n';\n      line = line.substr(maxline);\n    }\n  }\n  output += line;\n  return output;\n};\n\n/**\n * Base64 decodes a string into a 'binary' encoded string of bytes.\n *\n * @param input the base64-encoded input.\n *\n * @return the binary encoded string.\n */\nutil.decode64 = function(input) {\n  // TODO: deprecate: \"Deprecated. Use util.binary.base64.decode instead.\"\n\n  // remove all non-base64 characters\n  input = input.replace(/[^A-Za-z0-9\\+\\/\\=]/g, '');\n\n  var output = '';\n  var enc1, enc2, enc3, enc4;\n  var i = 0;\n\n  while(i < input.length) {\n    enc1 = _base64Idx[input.charCodeAt(i++) - 43];\n    enc2 = _base64Idx[input.charCodeAt(i++) - 43];\n    enc3 = _base64Idx[input.charCodeAt(i++) - 43];\n    enc4 = _base64Idx[input.charCodeAt(i++) - 43];\n\n    output += String.fromCharCode((enc1 << 2) | (enc2 >> 4));\n    if(enc3 !== 64) {\n      // decoded at least 2 bytes\n      output += String.fromCharCode(((enc2 & 15) << 4) | (enc3 >> 2));\n      if(enc4 !== 64) {\n        // decoded 3 bytes\n        output += String.fromCharCode(((enc3 & 3) << 6) | enc4);\n      }\n    }\n  }\n\n  return output;\n};\n\n/**\n * Encodes the given string of characters (a standard JavaScript\n * string) as a binary encoded string where the bytes represent\n * a UTF-8 encoded string of characters. Non-ASCII characters will be\n * encoded as multiple bytes according to UTF-8.\n *\n * @param str a standard string of characters to encode.\n *\n * @return the binary encoded string.\n */\nutil.encodeUtf8 = function(str) {\n  return unescape(encodeURIComponent(str));\n};\n\n/**\n * Decodes a binary encoded string that contains bytes that\n * represent a UTF-8 encoded string of characters -- into a\n * string of characters (a standard JavaScript string).\n *\n * @param str the binary encoded string to decode.\n *\n * @return the resulting standard string of characters.\n */\nutil.decodeUtf8 = function(str) {\n  return decodeURIComponent(escape(str));\n};\n\n// binary encoding/decoding tools\n// FIXME: Experimental. Do not use yet.\nutil.binary = {\n  raw: {},\n  hex: {},\n  base64: {},\n  base58: {},\n  baseN : {\n    encode: baseN.encode,\n    decode: baseN.decode\n  }\n};\n\n/**\n * Encodes a Uint8Array as a binary-encoded string. This encoding uses\n * a value between 0 and 255 for each character.\n *\n * @param bytes the Uint8Array to encode.\n *\n * @return the binary-encoded string.\n */\nutil.binary.raw.encode = function(bytes) {\n  return String.fromCharCode.apply(null, bytes);\n};\n\n/**\n * Decodes a binary-encoded string to a Uint8Array. This encoding uses\n * a value between 0 and 255 for each character.\n *\n * @param str the binary-encoded string to decode.\n * @param [output] an optional Uint8Array to write the output to; if it\n *          is too small, an exception will be thrown.\n * @param [offset] the start offset for writing to the output (default: 0).\n *\n * @return the Uint8Array or the number of bytes written if output was given.\n */\nutil.binary.raw.decode = function(str, output, offset) {\n  var out = output;\n  if(!out) {\n    out = new Uint8Array(str.length);\n  }\n  offset = offset || 0;\n  var j = offset;\n  for(var i = 0; i < str.length; ++i) {\n    out[j++] = str.charCodeAt(i);\n  }\n  return output ? (j - offset) : out;\n};\n\n/**\n * Encodes a 'binary' string, ArrayBuffer, DataView, TypedArray, or\n * ByteBuffer as a string of hexadecimal characters.\n *\n * @param bytes the bytes to convert.\n *\n * @return the string of hexadecimal characters.\n */\nutil.binary.hex.encode = util.bytesToHex;\n\n/**\n * Decodes a hex-encoded string to a Uint8Array.\n *\n * @param hex the hexadecimal string to convert.\n * @param [output] an optional Uint8Array to write the output to; if it\n *          is too small, an exception will be thrown.\n * @param [offset] the start offset for writing to the output (default: 0).\n *\n * @return the Uint8Array or the number of bytes written if output was given.\n */\nutil.binary.hex.decode = function(hex, output, offset) {\n  var out = output;\n  if(!out) {\n    out = new Uint8Array(Math.ceil(hex.length / 2));\n  }\n  offset = offset || 0;\n  var i = 0, j = offset;\n  if(hex.length & 1) {\n    // odd number of characters, convert first character alone\n    i = 1;\n    out[j++] = parseInt(hex[0], 16);\n  }\n  // convert 2 characters (1 byte) at a time\n  for(; i < hex.length; i += 2) {\n    out[j++] = parseInt(hex.substr(i, 2), 16);\n  }\n  return output ? (j - offset) : out;\n};\n\n/**\n * Base64-encodes a Uint8Array.\n *\n * @param input the Uint8Array to encode.\n * @param maxline the maximum number of encoded characters per line to use,\n *          defaults to none.\n *\n * @return the base64-encoded output string.\n */\nutil.binary.base64.encode = function(input, maxline) {\n  var line = '';\n  var output = '';\n  var chr1, chr2, chr3;\n  var i = 0;\n  while(i < input.byteLength) {\n    chr1 = input[i++];\n    chr2 = input[i++];\n    chr3 = input[i++];\n\n    // encode 4 character group\n    line += _base64.charAt(chr1 >> 2);\n    line += _base64.charAt(((chr1 & 3) << 4) | (chr2 >> 4));\n    if(isNaN(chr2)) {\n      line += '==';\n    } else {\n      line += _base64.charAt(((chr2 & 15) << 2) | (chr3 >> 6));\n      line += isNaN(chr3) ? '=' : _base64.charAt(chr3 & 63);\n    }\n\n    if(maxline && line.length > maxline) {\n      output += line.substr(0, maxline) + '\\r\\n';\n      line = line.substr(maxline);\n    }\n  }\n  output += line;\n  return output;\n};\n\n/**\n * Decodes a base64-encoded string to a Uint8Array.\n *\n * @param input the base64-encoded input string.\n * @param [output] an optional Uint8Array to write the output to; if it\n *          is too small, an exception will be thrown.\n * @param [offset] the start offset for writing to the output (default: 0).\n *\n * @return the Uint8Array or the number of bytes written if output was given.\n */\nutil.binary.base64.decode = function(input, output, offset) {\n  var out = output;\n  if(!out) {\n    out = new Uint8Array(Math.ceil(input.length / 4) * 3);\n  }\n\n  // remove all non-base64 characters\n  input = input.replace(/[^A-Za-z0-9\\+\\/\\=]/g, '');\n\n  offset = offset || 0;\n  var enc1, enc2, enc3, enc4;\n  var i = 0, j = offset;\n\n  while(i < input.length) {\n    enc1 = _base64Idx[input.charCodeAt(i++) - 43];\n    enc2 = _base64Idx[input.charCodeAt(i++) - 43];\n    enc3 = _base64Idx[input.charCodeAt(i++) - 43];\n    enc4 = _base64Idx[input.charCodeAt(i++) - 43];\n\n    out[j++] = (enc1 << 2) | (enc2 >> 4);\n    if(enc3 !== 64) {\n      // decoded at least 2 bytes\n      out[j++] = ((enc2 & 15) << 4) | (enc3 >> 2);\n      if(enc4 !== 64) {\n        // decoded 3 bytes\n        out[j++] = ((enc3 & 3) << 6) | enc4;\n      }\n    }\n  }\n\n  // make sure result is the exact decoded length\n  return output ? (j - offset) : out.subarray(0, j);\n};\n\n// add support for base58 encoding/decoding with Bitcoin alphabet\nutil.binary.base58.encode = function(input, maxline) {\n  return util.binary.baseN.encode(input, _base58, maxline);\n};\nutil.binary.base58.decode = function(input, maxline) {\n  return util.binary.baseN.decode(input, _base58, maxline);\n};\n\n// text encoding/decoding tools\n// FIXME: Experimental. Do not use yet.\nutil.text = {\n  utf8: {},\n  utf16: {}\n};\n\n/**\n * Encodes the given string as UTF-8 in a Uint8Array.\n *\n * @param str the string to encode.\n * @param [output] an optional Uint8Array to write the output to; if it\n *          is too small, an exception will be thrown.\n * @param [offset] the start offset for writing to the output (default: 0).\n *\n * @return the Uint8Array or the number of bytes written if output was given.\n */\nutil.text.utf8.encode = function(str, output, offset) {\n  str = util.encodeUtf8(str);\n  var out = output;\n  if(!out) {\n    out = new Uint8Array(str.length);\n  }\n  offset = offset || 0;\n  var j = offset;\n  for(var i = 0; i < str.length; ++i) {\n    out[j++] = str.charCodeAt(i);\n  }\n  return output ? (j - offset) : out;\n};\n\n/**\n * Decodes the UTF-8 contents from a Uint8Array.\n *\n * @param bytes the Uint8Array to decode.\n *\n * @return the resulting string.\n */\nutil.text.utf8.decode = function(bytes) {\n  return util.decodeUtf8(String.fromCharCode.apply(null, bytes));\n};\n\n/**\n * Encodes the given string as UTF-16 in a Uint8Array.\n *\n * @param str the string to encode.\n * @param [output] an optional Uint8Array to write the output to; if it\n *          is too small, an exception will be thrown.\n * @param [offset] the start offset for writing to the output (default: 0).\n *\n * @return the Uint8Array or the number of bytes written if output was given.\n */\nutil.text.utf16.encode = function(str, output, offset) {\n  var out = output;\n  if(!out) {\n    out = new Uint8Array(str.length * 2);\n  }\n  var view = new Uint16Array(out.buffer);\n  offset = offset || 0;\n  var j = offset;\n  var k = offset;\n  for(var i = 0; i < str.length; ++i) {\n    view[k++] = str.charCodeAt(i);\n    j += 2;\n  }\n  return output ? (j - offset) : out;\n};\n\n/**\n * Decodes the UTF-16 contents from a Uint8Array.\n *\n * @param bytes the Uint8Array to decode.\n *\n * @return the resulting string.\n */\nutil.text.utf16.decode = function(bytes) {\n  return String.fromCharCode.apply(null, new Uint16Array(bytes.buffer));\n};\n\n/**\n * Deflates the given data using a flash interface.\n *\n * @param api the flash interface.\n * @param bytes the data.\n * @param raw true to return only raw deflate data, false to include zlib\n *          header and trailer.\n *\n * @return the deflated data as a string.\n */\nutil.deflate = function(api, bytes, raw) {\n  bytes = util.decode64(api.deflate(util.encode64(bytes)).rval);\n\n  // strip zlib header and trailer if necessary\n  if(raw) {\n    // zlib header is 2 bytes (CMF,FLG) where FLG indicates that\n    // there is a 4-byte DICT (alder-32) block before the data if\n    // its 5th bit is set\n    var start = 2;\n    var flg = bytes.charCodeAt(1);\n    if(flg & 0x20) {\n      start = 6;\n    }\n    // zlib trailer is 4 bytes of adler-32\n    bytes = bytes.substring(start, bytes.length - 4);\n  }\n\n  return bytes;\n};\n\n/**\n * Inflates the given data using a flash interface.\n *\n * @param api the flash interface.\n * @param bytes the data.\n * @param raw true if the incoming data has no zlib header or trailer and is\n *          raw DEFLATE data.\n *\n * @return the inflated data as a string, null on error.\n */\nutil.inflate = function(api, bytes, raw) {\n  // TODO: add zlib header and trailer if necessary/possible\n  var rval = api.inflate(util.encode64(bytes)).rval;\n  return (rval === null) ? null : util.decode64(rval);\n};\n\n/**\n * Sets a storage object.\n *\n * @param api the storage interface.\n * @param id the storage ID to use.\n * @param obj the storage object, null to remove.\n */\nvar _setStorageObject = function(api, id, obj) {\n  if(!api) {\n    throw new Error('WebStorage not available.');\n  }\n\n  var rval;\n  if(obj === null) {\n    rval = api.removeItem(id);\n  } else {\n    // json-encode and base64-encode object\n    obj = util.encode64(JSON.stringify(obj));\n    rval = api.setItem(id, obj);\n  }\n\n  // handle potential flash error\n  if(typeof(rval) !== 'undefined' && rval.rval !== true) {\n    var error = new Error(rval.error.message);\n    error.id = rval.error.id;\n    error.name = rval.error.name;\n    throw error;\n  }\n};\n\n/**\n * Gets a storage object.\n *\n * @param api the storage interface.\n * @param id the storage ID to use.\n *\n * @return the storage object entry or null if none exists.\n */\nvar _getStorageObject = function(api, id) {\n  if(!api) {\n    throw new Error('WebStorage not available.');\n  }\n\n  // get the existing entry\n  var rval = api.getItem(id);\n\n  /* Note: We check api.init because we can't do (api == localStorage)\n    on IE because of \"Class doesn't support Automation\" exception. Only\n    the flash api has an init method so this works too, but we need a\n    better solution in the future. */\n\n  // flash returns item wrapped in an object, handle special case\n  if(api.init) {\n    if(rval.rval === null) {\n      if(rval.error) {\n        var error = new Error(rval.error.message);\n        error.id = rval.error.id;\n        error.name = rval.error.name;\n        throw error;\n      }\n      // no error, but also no item\n      rval = null;\n    } else {\n      rval = rval.rval;\n    }\n  }\n\n  // handle decoding\n  if(rval !== null) {\n    // base64-decode and json-decode data\n    rval = JSON.parse(util.decode64(rval));\n  }\n\n  return rval;\n};\n\n/**\n * Stores an item in local storage.\n *\n * @param api the storage interface.\n * @param id the storage ID to use.\n * @param key the key for the item.\n * @param data the data for the item (any javascript object/primitive).\n */\nvar _setItem = function(api, id, key, data) {\n  // get storage object\n  var obj = _getStorageObject(api, id);\n  if(obj === null) {\n    // create a new storage object\n    obj = {};\n  }\n  // update key\n  obj[key] = data;\n\n  // set storage object\n  _setStorageObject(api, id, obj);\n};\n\n/**\n * Gets an item from local storage.\n *\n * @param api the storage interface.\n * @param id the storage ID to use.\n * @param key the key for the item.\n *\n * @return the item.\n */\nvar _getItem = function(api, id, key) {\n  // get storage object\n  var rval = _getStorageObject(api, id);\n  if(rval !== null) {\n    // return data at key\n    rval = (key in rval) ? rval[key] : null;\n  }\n\n  return rval;\n};\n\n/**\n * Removes an item from local storage.\n *\n * @param api the storage interface.\n * @param id the storage ID to use.\n * @param key the key for the item.\n */\nvar _removeItem = function(api, id, key) {\n  // get storage object\n  var obj = _getStorageObject(api, id);\n  if(obj !== null && key in obj) {\n    // remove key\n    delete obj[key];\n\n    // see if entry has no keys remaining\n    var empty = true;\n    for(var prop in obj) {\n      empty = false;\n      break;\n    }\n    if(empty) {\n      // remove entry entirely if no keys are left\n      obj = null;\n    }\n\n    // set storage object\n    _setStorageObject(api, id, obj);\n  }\n};\n\n/**\n * Clears the local disk storage identified by the given ID.\n *\n * @param api the storage interface.\n * @param id the storage ID to use.\n */\nvar _clearItems = function(api, id) {\n  _setStorageObject(api, id, null);\n};\n\n/**\n * Calls a storage function.\n *\n * @param func the function to call.\n * @param args the arguments for the function.\n * @param location the location argument.\n *\n * @return the return value from the function.\n */\nvar _callStorageFunction = function(func, args, location) {\n  var rval = null;\n\n  // default storage types\n  if(typeof(location) === 'undefined') {\n    location = ['web', 'flash'];\n  }\n\n  // apply storage types in order of preference\n  var type;\n  var done = false;\n  var exception = null;\n  for(var idx in location) {\n    type = location[idx];\n    try {\n      if(type === 'flash' || type === 'both') {\n        if(args[0] === null) {\n          throw new Error('Flash local storage not available.');\n        }\n        rval = func.apply(this, args);\n        done = (type === 'flash');\n      }\n      if(type === 'web' || type === 'both') {\n        args[0] = localStorage;\n        rval = func.apply(this, args);\n        done = true;\n      }\n    } catch(ex) {\n      exception = ex;\n    }\n    if(done) {\n      break;\n    }\n  }\n\n  if(!done) {\n    throw exception;\n  }\n\n  return rval;\n};\n\n/**\n * Stores an item on local disk.\n *\n * The available types of local storage include 'flash', 'web', and 'both'.\n *\n * The type 'flash' refers to flash local storage (SharedObject). In order\n * to use flash local storage, the 'api' parameter must be valid. The type\n * 'web' refers to WebStorage, if supported by the browser. The type 'both'\n * refers to storing using both 'flash' and 'web', not just one or the\n * other.\n *\n * The location array should list the storage types to use in order of\n * preference:\n *\n * ['flash']: flash only storage\n * ['web']: web only storage\n * ['both']: try to store in both\n * ['flash','web']: store in flash first, but if not available, 'web'\n * ['web','flash']: store in web first, but if not available, 'flash'\n *\n * The location array defaults to: ['web', 'flash']\n *\n * @param api the flash interface, null to use only WebStorage.\n * @param id the storage ID to use.\n * @param key the key for the item.\n * @param data the data for the item (any javascript object/primitive).\n * @param location an array with the preferred types of storage to use.\n */\nutil.setItem = function(api, id, key, data, location) {\n  _callStorageFunction(_setItem, arguments, location);\n};\n\n/**\n * Gets an item on local disk.\n *\n * Set setItem() for details on storage types.\n *\n * @param api the flash interface, null to use only WebStorage.\n * @param id the storage ID to use.\n * @param key the key for the item.\n * @param location an array with the preferred types of storage to use.\n *\n * @return the item.\n */\nutil.getItem = function(api, id, key, location) {\n  return _callStorageFunction(_getItem, arguments, location);\n};\n\n/**\n * Removes an item on local disk.\n *\n * Set setItem() for details on storage types.\n *\n * @param api the flash interface.\n * @param id the storage ID to use.\n * @param key the key for the item.\n * @param location an array with the preferred types of storage to use.\n */\nutil.removeItem = function(api, id, key, location) {\n  _callStorageFunction(_removeItem, arguments, location);\n};\n\n/**\n * Clears the local disk storage identified by the given ID.\n *\n * Set setItem() for details on storage types.\n *\n * @param api the flash interface if flash is available.\n * @param id the storage ID to use.\n * @param location an array with the preferred types of storage to use.\n */\nutil.clearItems = function(api, id, location) {\n  _callStorageFunction(_clearItems, arguments, location);\n};\n\n/**\n * Parses the scheme, host, and port from an http(s) url.\n *\n * @param str the url string.\n *\n * @return the parsed url object or null if the url is invalid.\n */\nutil.parseUrl = function(str) {\n  // FIXME: this regex looks a bit broken\n  var regex = /^(https?):\\/\\/([^:&^\\/]*):?(\\d*)(.*)$/g;\n  regex.lastIndex = 0;\n  var m = regex.exec(str);\n  var url = (m === null) ? null : {\n    full: str,\n    scheme: m[1],\n    host: m[2],\n    port: m[3],\n    path: m[4]\n  };\n  if(url) {\n    url.fullHost = url.host;\n    if(url.port) {\n      if(url.port !== 80 && url.scheme === 'http') {\n        url.fullHost += ':' + url.port;\n      } else if(url.port !== 443 && url.scheme === 'https') {\n        url.fullHost += ':' + url.port;\n      }\n    } else if(url.scheme === 'http') {\n      url.port = 80;\n    } else if(url.scheme === 'https') {\n      url.port = 443;\n    }\n    url.full = url.scheme + '://' + url.fullHost;\n  }\n  return url;\n};\n\n/* Storage for query variables */\nvar _queryVariables = null;\n\n/**\n * Returns the window location query variables. Query is parsed on the first\n * call and the same object is returned on subsequent calls. The mapping\n * is from keys to an array of values. Parameters without values will have\n * an object key set but no value added to the value array. Values are\n * unescaped.\n *\n * ...?k1=v1&k2=v2:\n * {\n *   \"k1\": [\"v1\"],\n *   \"k2\": [\"v2\"]\n * }\n *\n * ...?k1=v1&k1=v2:\n * {\n *   \"k1\": [\"v1\", \"v2\"]\n * }\n *\n * ...?k1=v1&k2:\n * {\n *   \"k1\": [\"v1\"],\n *   \"k2\": []\n * }\n *\n * ...?k1=v1&k1:\n * {\n *   \"k1\": [\"v1\"]\n * }\n *\n * ...?k1&k1:\n * {\n *   \"k1\": []\n * }\n *\n * @param query the query string to parse (optional, default to cached\n *          results from parsing window location search query).\n *\n * @return object mapping keys to variables.\n */\nutil.getQueryVariables = function(query) {\n  var parse = function(q) {\n    var rval = {};\n    var kvpairs = q.split('&');\n    for(var i = 0; i < kvpairs.length; i++) {\n      var pos = kvpairs[i].indexOf('=');\n      var key;\n      var val;\n      if(pos > 0) {\n        key = kvpairs[i].substring(0, pos);\n        val = kvpairs[i].substring(pos + 1);\n      } else {\n        key = kvpairs[i];\n        val = null;\n      }\n      if(!(key in rval)) {\n        rval[key] = [];\n      }\n      // disallow overriding object prototype keys\n      if(!(key in Object.prototype) && val !== null) {\n        rval[key].push(unescape(val));\n      }\n    }\n    return rval;\n  };\n\n   var rval;\n   if(typeof(query) === 'undefined') {\n     // set cached variables if needed\n     if(_queryVariables === null) {\n       if(typeof(window) !== 'undefined' && window.location && window.location.search) {\n          // parse window search query\n          _queryVariables = parse(window.location.search.substring(1));\n       } else {\n          // no query variables available\n          _queryVariables = {};\n       }\n     }\n     rval = _queryVariables;\n   } else {\n     // parse given query\n     rval = parse(query);\n   }\n   return rval;\n};\n\n/**\n * Parses a fragment into a path and query. This method will take a URI\n * fragment and break it up as if it were the main URI. For example:\n *    /bar/baz?a=1&b=2\n * results in:\n *    {\n *       path: [\"bar\", \"baz\"],\n *       query: {\"k1\": [\"v1\"], \"k2\": [\"v2\"]}\n *    }\n *\n * @return object with a path array and query object.\n */\nutil.parseFragment = function(fragment) {\n  // default to whole fragment\n  var fp = fragment;\n  var fq = '';\n  // split into path and query if possible at the first '?'\n  var pos = fragment.indexOf('?');\n  if(pos > 0) {\n    fp = fragment.substring(0, pos);\n    fq = fragment.substring(pos + 1);\n  }\n  // split path based on '/' and ignore first element if empty\n  var path = fp.split('/');\n  if(path.length > 0 && path[0] === '') {\n    path.shift();\n  }\n  // convert query into object\n  var query = (fq === '') ? {} : util.getQueryVariables(fq);\n\n  return {\n    pathString: fp,\n    queryString: fq,\n    path: path,\n    query: query\n  };\n};\n\n/**\n * Makes a request out of a URI-like request string. This is intended to\n * be used where a fragment id (after a URI '#') is parsed as a URI with\n * path and query parts. The string should have a path beginning and\n * delimited by '/' and optional query parameters following a '?'. The\n * query should be a standard URL set of key value pairs delimited by\n * '&'. For backwards compatibility the initial '/' on the path is not\n * required. The request object has the following API, (fully described\n * in the method code):\n *    {\n *       path: <the path string part>.\n *       query: <the query string part>,\n *       getPath(i): get part or all of the split path array,\n *       getQuery(k, i): get part or all of a query key array,\n *       getQueryLast(k, _default): get last element of a query key array.\n *    }\n *\n * @return object with request parameters.\n */\nutil.makeRequest = function(reqString) {\n  var frag = util.parseFragment(reqString);\n  var req = {\n    // full path string\n    path: frag.pathString,\n    // full query string\n    query: frag.queryString,\n    /**\n     * Get path or element in path.\n     *\n     * @param i optional path index.\n     *\n     * @return path or part of path if i provided.\n     */\n    getPath: function(i) {\n      return (typeof(i) === 'undefined') ? frag.path : frag.path[i];\n    },\n    /**\n     * Get query, values for a key, or value for a key index.\n     *\n     * @param k optional query key.\n     * @param i optional query key index.\n     *\n     * @return query, values for a key, or value for a key index.\n     */\n    getQuery: function(k, i) {\n      var rval;\n      if(typeof(k) === 'undefined') {\n        rval = frag.query;\n      } else {\n        rval = frag.query[k];\n        if(rval && typeof(i) !== 'undefined') {\n           rval = rval[i];\n        }\n      }\n      return rval;\n    },\n    getQueryLast: function(k, _default) {\n      var rval;\n      var vals = req.getQuery(k);\n      if(vals) {\n        rval = vals[vals.length - 1];\n      } else {\n        rval = _default;\n      }\n      return rval;\n    }\n  };\n  return req;\n};\n\n/**\n * Makes a URI out of a path, an object with query parameters, and a\n * fragment. Uses jQuery.param() internally for query string creation.\n * If the path is an array, it will be joined with '/'.\n *\n * @param path string path or array of strings.\n * @param query object with query parameters. (optional)\n * @param fragment fragment string. (optional)\n *\n * @return string object with request parameters.\n */\nutil.makeLink = function(path, query, fragment) {\n  // join path parts if needed\n  path = jQuery.isArray(path) ? path.join('/') : path;\n\n  var qstr = jQuery.param(query || {});\n  fragment = fragment || '';\n  return path +\n    ((qstr.length > 0) ? ('?' + qstr) : '') +\n    ((fragment.length > 0) ? ('#' + fragment) : '');\n};\n\n/**\n * Check if an object is empty.\n *\n * Taken from:\n * http://stackoverflow.com/questions/679915/how-do-i-test-for-an-empty-javascript-object-from-json/679937#679937\n *\n * @param object the object to check.\n */\nutil.isEmpty = function(obj) {\n  for(var prop in obj) {\n    if(obj.hasOwnProperty(prop)) {\n      return false;\n    }\n  }\n  return true;\n};\n\n/**\n * Format with simple printf-style interpolation.\n *\n * %%: literal '%'\n * %s,%o: convert next argument into a string.\n *\n * @param format the string to format.\n * @param ... arguments to interpolate into the format string.\n */\nutil.format = function(format) {\n  var re = /%./g;\n  // current match\n  var match;\n  // current part\n  var part;\n  // current arg index\n  var argi = 0;\n  // collected parts to recombine later\n  var parts = [];\n  // last index found\n  var last = 0;\n  // loop while matches remain\n  while((match = re.exec(format))) {\n    part = format.substring(last, re.lastIndex - 2);\n    // don't add empty strings (ie, parts between %s%s)\n    if(part.length > 0) {\n      parts.push(part);\n    }\n    last = re.lastIndex;\n    // switch on % code\n    var code = match[0][1];\n    switch(code) {\n    case 's':\n    case 'o':\n      // check if enough arguments were given\n      if(argi < arguments.length) {\n        parts.push(arguments[argi++ + 1]);\n      } else {\n        parts.push('<?>');\n      }\n      break;\n    // FIXME: do proper formating for numbers, etc\n    //case 'f':\n    //case 'd':\n    case '%':\n      parts.push('%');\n      break;\n    default:\n      parts.push('<%' + code + '?>');\n    }\n  }\n  // add trailing part of format string\n  parts.push(format.substring(last));\n  return parts.join('');\n};\n\n/**\n * Formats a number.\n *\n * http://snipplr.com/view/5945/javascript-numberformat--ported-from-php/\n */\nutil.formatNumber = function(number, decimals, dec_point, thousands_sep) {\n  // http://kevin.vanzonneveld.net\n  // +   original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com)\n  // +   improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)\n  // +     bugfix by: Michael White (http://crestidg.com)\n  // +     bugfix by: Benjamin Lupton\n  // +     bugfix by: Allan Jensen (http://www.winternet.no)\n  // +    revised by: Jonas Raoni Soares Silva (http://www.jsfromhell.com)\n  // *     example 1: number_format(1234.5678, 2, '.', '');\n  // *     returns 1: 1234.57\n\n  var n = number, c = isNaN(decimals = Math.abs(decimals)) ? 2 : decimals;\n  var d = dec_point === undefined ? ',' : dec_point;\n  var t = thousands_sep === undefined ?\n   '.' : thousands_sep, s = n < 0 ? '-' : '';\n  var i = parseInt((n = Math.abs(+n || 0).toFixed(c)), 10) + '';\n  var j = (i.length > 3) ? i.length % 3 : 0;\n  return s + (j ? i.substr(0, j) + t : '') +\n    i.substr(j).replace(/(\\d{3})(?=\\d)/g, '$1' + t) +\n    (c ? d + Math.abs(n - i).toFixed(c).slice(2) : '');\n};\n\n/**\n * Formats a byte size.\n *\n * http://snipplr.com/view/5949/format-humanize-file-byte-size-presentation-in-javascript/\n */\nutil.formatSize = function(size) {\n  if(size >= 1073741824) {\n    size = util.formatNumber(size / 1073741824, 2, '.', '') + ' GiB';\n  } else if(size >= 1048576) {\n    size = util.formatNumber(size / 1048576, 2, '.', '') + ' MiB';\n  } else if(size >= 1024) {\n    size = util.formatNumber(size / 1024, 0) + ' KiB';\n  } else {\n    size = util.formatNumber(size, 0) + ' bytes';\n  }\n  return size;\n};\n\n/**\n * Converts an IPv4 or IPv6 string representation into bytes (in network order).\n *\n * @param ip the IPv4 or IPv6 address to convert.\n *\n * @return the 4-byte IPv6 or 16-byte IPv6 address or null if the address can't\n *         be parsed.\n */\nutil.bytesFromIP = function(ip) {\n  if(ip.indexOf('.') !== -1) {\n    return util.bytesFromIPv4(ip);\n  }\n  if(ip.indexOf(':') !== -1) {\n    return util.bytesFromIPv6(ip);\n  }\n  return null;\n};\n\n/**\n * Converts an IPv4 string representation into bytes (in network order).\n *\n * @param ip the IPv4 address to convert.\n *\n * @return the 4-byte address or null if the address can't be parsed.\n */\nutil.bytesFromIPv4 = function(ip) {\n  ip = ip.split('.');\n  if(ip.length !== 4) {\n    return null;\n  }\n  var b = util.createBuffer();\n  for(var i = 0; i < ip.length; ++i) {\n    var num = parseInt(ip[i], 10);\n    if(isNaN(num)) {\n      return null;\n    }\n    b.putByte(num);\n  }\n  return b.getBytes();\n};\n\n/**\n * Converts an IPv6 string representation into bytes (in network order).\n *\n * @param ip the IPv6 address to convert.\n *\n * @return the 16-byte address or null if the address can't be parsed.\n */\nutil.bytesFromIPv6 = function(ip) {\n  var blanks = 0;\n  ip = ip.split(':').filter(function(e) {\n    if(e.length === 0) ++blanks;\n    return true;\n  });\n  var zeros = (8 - ip.length + blanks) * 2;\n  var b = util.createBuffer();\n  for(var i = 0; i < 8; ++i) {\n    if(!ip[i] || ip[i].length === 0) {\n      b.fillWithByte(0, zeros);\n      zeros = 0;\n      continue;\n    }\n    var bytes = util.hexToBytes(ip[i]);\n    if(bytes.length < 2) {\n      b.putByte(0);\n    }\n    b.putBytes(bytes);\n  }\n  return b.getBytes();\n};\n\n/**\n * Converts 4-bytes into an IPv4 string representation or 16-bytes into\n * an IPv6 string representation. The bytes must be in network order.\n *\n * @param bytes the bytes to convert.\n *\n * @return the IPv4 or IPv6 string representation if 4 or 16 bytes,\n *         respectively, are given, otherwise null.\n */\nutil.bytesToIP = function(bytes) {\n  if(bytes.length === 4) {\n    return util.bytesToIPv4(bytes);\n  }\n  if(bytes.length === 16) {\n    return util.bytesToIPv6(bytes);\n  }\n  return null;\n};\n\n/**\n * Converts 4-bytes into an IPv4 string representation. The bytes must be\n * in network order.\n *\n * @param bytes the bytes to convert.\n *\n * @return the IPv4 string representation or null for an invalid # of bytes.\n */\nutil.bytesToIPv4 = function(bytes) {\n  if(bytes.length !== 4) {\n    return null;\n  }\n  var ip = [];\n  for(var i = 0; i < bytes.length; ++i) {\n    ip.push(bytes.charCodeAt(i));\n  }\n  return ip.join('.');\n};\n\n/**\n * Converts 16-bytes into an IPv16 string representation. The bytes must be\n * in network order.\n *\n * @param bytes the bytes to convert.\n *\n * @return the IPv16 string representation or null for an invalid # of bytes.\n */\nutil.bytesToIPv6 = function(bytes) {\n  if(bytes.length !== 16) {\n    return null;\n  }\n  var ip = [];\n  var zeroGroups = [];\n  var zeroMaxGroup = 0;\n  for(var i = 0; i < bytes.length; i += 2) {\n    var hex = util.bytesToHex(bytes[i] + bytes[i + 1]);\n    // canonicalize zero representation\n    while(hex[0] === '0' && hex !== '0') {\n      hex = hex.substr(1);\n    }\n    if(hex === '0') {\n      var last = zeroGroups[zeroGroups.length - 1];\n      var idx = ip.length;\n      if(!last || idx !== last.end + 1) {\n        zeroGroups.push({start: idx, end: idx});\n      } else {\n        last.end = idx;\n        if((last.end - last.start) >\n          (zeroGroups[zeroMaxGroup].end - zeroGroups[zeroMaxGroup].start)) {\n          zeroMaxGroup = zeroGroups.length - 1;\n        }\n      }\n    }\n    ip.push(hex);\n  }\n  if(zeroGroups.length > 0) {\n    var group = zeroGroups[zeroMaxGroup];\n    // only shorten group of length > 0\n    if(group.end - group.start > 0) {\n      ip.splice(group.start, group.end - group.start + 1, '');\n      if(group.start === 0) {\n        ip.unshift('');\n      }\n      if(group.end === 7) {\n        ip.push('');\n      }\n    }\n  }\n  return ip.join(':');\n};\n\n/**\n * Estimates the number of processes that can be run concurrently. If\n * creating Web Workers, keep in mind that the main JavaScript process needs\n * its own core.\n *\n * @param options the options to use:\n *          update true to force an update (not use the cached value).\n * @param callback(err, max) called once the operation completes.\n */\nutil.estimateCores = function(options, callback) {\n  if(typeof options === 'function') {\n    callback = options;\n    options = {};\n  }\n  options = options || {};\n  if('cores' in util && !options.update) {\n    return callback(null, util.cores);\n  }\n  if(typeof navigator !== 'undefined' &&\n    'hardwareConcurrency' in navigator &&\n    navigator.hardwareConcurrency > 0) {\n    util.cores = navigator.hardwareConcurrency;\n    return callback(null, util.cores);\n  }\n  if(typeof Worker === 'undefined') {\n    // workers not available\n    util.cores = 1;\n    return callback(null, util.cores);\n  }\n  if(typeof Blob === 'undefined') {\n    // can't estimate, default to 2\n    util.cores = 2;\n    return callback(null, util.cores);\n  }\n\n  // create worker concurrency estimation code as blob\n  var blobUrl = URL.createObjectURL(new Blob(['(',\n    function() {\n      self.addEventListener('message', function(e) {\n        // run worker for 4 ms\n        var st = Date.now();\n        var et = st + 4;\n        while(Date.now() < et);\n        self.postMessage({st: st, et: et});\n      });\n    }.toString(),\n  ')()'], {type: 'application/javascript'}));\n\n  // take 5 samples using 16 workers\n  sample([], 5, 16);\n\n  function sample(max, samples, numWorkers) {\n    if(samples === 0) {\n      // get overlap average\n      var avg = Math.floor(max.reduce(function(avg, x) {\n        return avg + x;\n      }, 0) / max.length);\n      util.cores = Math.max(1, avg);\n      URL.revokeObjectURL(blobUrl);\n      return callback(null, util.cores);\n    }\n    map(numWorkers, function(err, results) {\n      max.push(reduce(numWorkers, results));\n      sample(max, samples - 1, numWorkers);\n    });\n  }\n\n  function map(numWorkers, callback) {\n    var workers = [];\n    var results = [];\n    for(var i = 0; i < numWorkers; ++i) {\n      var worker = new Worker(blobUrl);\n      worker.addEventListener('message', function(e) {\n        results.push(e.data);\n        if(results.length === numWorkers) {\n          for(var i = 0; i < numWorkers; ++i) {\n            workers[i].terminate();\n          }\n          callback(null, results);\n        }\n      });\n      workers.push(worker);\n    }\n    for(var i = 0; i < numWorkers; ++i) {\n      workers[i].postMessage(i);\n    }\n  }\n\n  function reduce(numWorkers, results) {\n    // find overlapping time windows\n    var overlaps = [];\n    for(var n = 0; n < numWorkers; ++n) {\n      var r1 = results[n];\n      var overlap = overlaps[n] = [];\n      for(var i = 0; i < numWorkers; ++i) {\n        if(n === i) {\n          continue;\n        }\n        var r2 = results[i];\n        if((r1.st > r2.st && r1.st < r2.et) ||\n          (r2.st > r1.st && r2.st < r1.et)) {\n          overlap.push(i);\n        }\n      }\n    }\n    // get maximum overlaps ... don't include overlapping worker itself\n    // as the main JS process was also being scheduled during the work and\n    // would have to be subtracted from the estimate anyway\n    return overlaps.reduce(function(max, overlap) {\n      return Math.max(max, overlap.length);\n    }, 0);\n  }\n};\n","/**\n * Base-N/Base-X encoding/decoding functions.\n *\n * Original implementation from base-x:\n * https://github.com/cryptocoinjs/base-x\n *\n * Which is MIT licensed:\n *\n * The MIT License (MIT)\n *\n * Copyright base-x contributors (c) 2016\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n */\nvar api = {};\nmodule.exports = api;\n\n// baseN alphabet indexes\nvar _reverseAlphabets = {};\n\n/**\n * BaseN-encodes a Uint8Array using the given alphabet.\n *\n * @param input the Uint8Array to encode.\n * @param maxline the maximum number of encoded characters per line to use,\n *          defaults to none.\n *\n * @return the baseN-encoded output string.\n */\napi.encode = function(input, alphabet, maxline) {\n  if(typeof alphabet !== 'string') {\n    throw new TypeError('\"alphabet\" must be a string.');\n  }\n  if(maxline !== undefined && typeof maxline !== 'number') {\n    throw new TypeError('\"maxline\" must be a number.');\n  }\n\n  var output = '';\n\n  if(!(input instanceof Uint8Array)) {\n    // assume forge byte buffer\n    output = _encodeWithByteBuffer(input, alphabet);\n  } else {\n    var i = 0;\n    var base = alphabet.length;\n    var first = alphabet.charAt(0);\n    var digits = [0];\n    for(i = 0; i < input.length; ++i) {\n      for(var j = 0, carry = input[i]; j < digits.length; ++j) {\n        carry += digits[j] << 8;\n        digits[j] = carry % base;\n        carry = (carry / base) | 0;\n      }\n\n      while(carry > 0) {\n        digits.push(carry % base);\n        carry = (carry / base) | 0;\n      }\n    }\n\n    // deal with leading zeros\n    for(i = 0; input[i] === 0 && i < input.length - 1; ++i) {\n      output += first;\n    }\n    // convert digits to a string\n    for(i = digits.length - 1; i >= 0; --i) {\n      output += alphabet[digits[i]];\n    }\n  }\n\n  if(maxline) {\n    var regex = new RegExp('.{1,' + maxline + '}', 'g');\n    output = output.match(regex).join('\\r\\n');\n  }\n\n  return output;\n};\n\n/**\n * Decodes a baseN-encoded (using the given alphabet) string to a\n * Uint8Array.\n *\n * @param input the baseN-encoded input string.\n *\n * @return the Uint8Array.\n */\napi.decode = function(input, alphabet) {\n  if(typeof input !== 'string') {\n    throw new TypeError('\"input\" must be a string.');\n  }\n  if(typeof alphabet !== 'string') {\n    throw new TypeError('\"alphabet\" must be a string.');\n  }\n\n  var table = _reverseAlphabets[alphabet];\n  if(!table) {\n    // compute reverse alphabet\n    table = _reverseAlphabets[alphabet] = [];\n    for(var i = 0; i < alphabet.length; ++i) {\n      table[alphabet.charCodeAt(i)] = i;\n    }\n  }\n\n  // remove whitespace characters\n  input = input.replace(/\\s/g, '');\n\n  var base = alphabet.length;\n  var first = alphabet.charAt(0);\n  var bytes = [0];\n  for(var i = 0; i < input.length; i++) {\n    var value = table[input.charCodeAt(i)];\n    if(value === undefined) {\n      return;\n    }\n\n    for(var j = 0, carry = value; j < bytes.length; ++j) {\n      carry += bytes[j] * base;\n      bytes[j] = carry & 0xff;\n      carry >>= 8;\n    }\n\n    while(carry > 0) {\n      bytes.push(carry & 0xff);\n      carry >>= 8;\n    }\n  }\n\n  // deal with leading zeros\n  for(var k = 0; input[k] === first && k < input.length - 1; ++k) {\n    bytes.push(0);\n  }\n\n  if(typeof Buffer !== 'undefined') {\n    return Buffer.from(bytes.reverse());\n  }\n\n  return new Uint8Array(bytes.reverse());\n};\n\nfunction _encodeWithByteBuffer(input, alphabet) {\n  var i = 0;\n  var base = alphabet.length;\n  var first = alphabet.charAt(0);\n  var digits = [0];\n  for(i = 0; i < input.length(); ++i) {\n    for(var j = 0, carry = input.at(i); j < digits.length; ++j) {\n      carry += digits[j] << 8;\n      digits[j] = carry % base;\n      carry = (carry / base) | 0;\n    }\n\n    while(carry > 0) {\n      digits.push(carry % base);\n      carry = (carry / base) | 0;\n    }\n  }\n\n  var output = '';\n\n  // deal with leading zeros\n  for(i = 0; input.at(i) === 0 && i < input.length() - 1; ++i) {\n    output += first;\n  }\n  // convert digits to a string\n  for(i = digits.length - 1; i >= 0; --i) {\n    output += alphabet[digits[i]];\n  }\n\n  return output;\n}\n","/**\n * Object IDs for ASN.1.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2013 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\n\nforge.pki = forge.pki || {};\nvar oids = module.exports = forge.pki.oids = forge.oids = forge.oids || {};\n\n// set id to name mapping and name to id mapping\nfunction _IN(id, name) {\n  oids[id] = name;\n  oids[name] = id;\n}\n// set id to name mapping only\nfunction _I_(id, name) {\n  oids[id] = name;\n}\n\n// algorithm OIDs\n_IN('1.2.840.113549.1.1.1', 'rsaEncryption');\n// Note: md2 & md4 not implemented\n//_IN('1.2.840.113549.1.1.2', 'md2WithRSAEncryption');\n//_IN('1.2.840.113549.1.1.3', 'md4WithRSAEncryption');\n_IN('1.2.840.113549.1.1.4', 'md5WithRSAEncryption');\n_IN('1.2.840.113549.1.1.5', 'sha1WithRSAEncryption');\n_IN('1.2.840.113549.1.1.7', 'RSAES-OAEP');\n_IN('1.2.840.113549.1.1.8', 'mgf1');\n_IN('1.2.840.113549.1.1.9', 'pSpecified');\n_IN('1.2.840.113549.1.1.10', 'RSASSA-PSS');\n_IN('1.2.840.113549.1.1.11', 'sha256WithRSAEncryption');\n_IN('1.2.840.113549.1.1.12', 'sha384WithRSAEncryption');\n_IN('1.2.840.113549.1.1.13', 'sha512WithRSAEncryption');\n// Edwards-curve Digital Signature Algorithm (EdDSA) Ed25519\n_IN('1.3.101.112', 'EdDSA25519');\n\n_IN('1.2.840.10040.4.3', 'dsa-with-sha1');\n\n_IN('1.3.14.3.2.7', 'desCBC');\n\n_IN('1.3.14.3.2.26', 'sha1');\n_IN('2.16.840.1.101.3.4.2.1', 'sha256');\n_IN('2.16.840.1.101.3.4.2.2', 'sha384');\n_IN('2.16.840.1.101.3.4.2.3', 'sha512');\n_IN('1.2.840.113549.2.5', 'md5');\n\n// pkcs#7 content types\n_IN('1.2.840.113549.1.7.1', 'data');\n_IN('1.2.840.113549.1.7.2', 'signedData');\n_IN('1.2.840.113549.1.7.3', 'envelopedData');\n_IN('1.2.840.113549.1.7.4', 'signedAndEnvelopedData');\n_IN('1.2.840.113549.1.7.5', 'digestedData');\n_IN('1.2.840.113549.1.7.6', 'encryptedData');\n\n// pkcs#9 oids\n_IN('1.2.840.113549.1.9.1', 'emailAddress');\n_IN('1.2.840.113549.1.9.2', 'unstructuredName');\n_IN('1.2.840.113549.1.9.3', 'contentType');\n_IN('1.2.840.113549.1.9.4', 'messageDigest');\n_IN('1.2.840.113549.1.9.5', 'signingTime');\n_IN('1.2.840.113549.1.9.6', 'counterSignature');\n_IN('1.2.840.113549.1.9.7', 'challengePassword');\n_IN('1.2.840.113549.1.9.8', 'unstructuredAddress');\n_IN('1.2.840.113549.1.9.14', 'extensionRequest');\n\n_IN('1.2.840.113549.1.9.20', 'friendlyName');\n_IN('1.2.840.113549.1.9.21', 'localKeyId');\n_IN('1.2.840.113549.1.9.22.1', 'x509Certificate');\n\n// pkcs#12 safe bags\n_IN('1.2.840.113549.1.12.10.1.1', 'keyBag');\n_IN('1.2.840.113549.1.12.10.1.2', 'pkcs8ShroudedKeyBag');\n_IN('1.2.840.113549.1.12.10.1.3', 'certBag');\n_IN('1.2.840.113549.1.12.10.1.4', 'crlBag');\n_IN('1.2.840.113549.1.12.10.1.5', 'secretBag');\n_IN('1.2.840.113549.1.12.10.1.6', 'safeContentsBag');\n\n// password-based-encryption for pkcs#12\n_IN('1.2.840.113549.1.5.13', 'pkcs5PBES2');\n_IN('1.2.840.113549.1.5.12', 'pkcs5PBKDF2');\n\n_IN('1.2.840.113549.1.12.1.1', 'pbeWithSHAAnd128BitRC4');\n_IN('1.2.840.113549.1.12.1.2', 'pbeWithSHAAnd40BitRC4');\n_IN('1.2.840.113549.1.12.1.3', 'pbeWithSHAAnd3-KeyTripleDES-CBC');\n_IN('1.2.840.113549.1.12.1.4', 'pbeWithSHAAnd2-KeyTripleDES-CBC');\n_IN('1.2.840.113549.1.12.1.5', 'pbeWithSHAAnd128BitRC2-CBC');\n_IN('1.2.840.113549.1.12.1.6', 'pbewithSHAAnd40BitRC2-CBC');\n\n// hmac OIDs\n_IN('1.2.840.113549.2.7', 'hmacWithSHA1');\n_IN('1.2.840.113549.2.8', 'hmacWithSHA224');\n_IN('1.2.840.113549.2.9', 'hmacWithSHA256');\n_IN('1.2.840.113549.2.10', 'hmacWithSHA384');\n_IN('1.2.840.113549.2.11', 'hmacWithSHA512');\n\n// symmetric key algorithm oids\n_IN('1.2.840.113549.3.7', 'des-EDE3-CBC');\n_IN('2.16.840.1.101.3.4.1.2', 'aes128-CBC');\n_IN('2.16.840.1.101.3.4.1.22', 'aes192-CBC');\n_IN('2.16.840.1.101.3.4.1.42', 'aes256-CBC');\n\n// certificate issuer/subject OIDs\n_IN('2.5.4.3', 'commonName');\n_IN('2.5.4.5', 'serialName');\n_IN('2.5.4.6', 'countryName');\n_IN('2.5.4.7', 'localityName');\n_IN('2.5.4.8', 'stateOrProvinceName');\n_IN('2.5.4.9', 'streetAddress');\n_IN('2.5.4.10', 'organizationName');\n_IN('2.5.4.11', 'organizationalUnitName');\n_IN('2.5.4.13', 'description');\n_IN('2.5.4.15', 'businessCategory');\n_IN('2.5.4.17', 'postalCode');\n_IN('1.3.6.1.4.1.311.60.2.1.2', 'jurisdictionOfIncorporationStateOrProvinceName');\n_IN('1.3.6.1.4.1.311.60.2.1.3', 'jurisdictionOfIncorporationCountryName');\n\n// X.509 extension OIDs\n_IN('2.16.840.1.113730.1.1', 'nsCertType');\n_IN('2.16.840.1.113730.1.13', 'nsComment'); // deprecated in theory; still widely used\n_I_('2.5.29.1', 'authorityKeyIdentifier'); // deprecated, use .35\n_I_('2.5.29.2', 'keyAttributes'); // obsolete use .37 or .15\n_I_('2.5.29.3', 'certificatePolicies'); // deprecated, use .32\n_I_('2.5.29.4', 'keyUsageRestriction'); // obsolete use .37 or .15\n_I_('2.5.29.5', 'policyMapping'); // deprecated use .33\n_I_('2.5.29.6', 'subtreesConstraint'); // obsolete use .30\n_I_('2.5.29.7', 'subjectAltName'); // deprecated use .17\n_I_('2.5.29.8', 'issuerAltName'); // deprecated use .18\n_I_('2.5.29.9', 'subjectDirectoryAttributes');\n_I_('2.5.29.10', 'basicConstraints'); // deprecated use .19\n_I_('2.5.29.11', 'nameConstraints'); // deprecated use .30\n_I_('2.5.29.12', 'policyConstraints'); // deprecated use .36\n_I_('2.5.29.13', 'basicConstraints'); // deprecated use .19\n_IN('2.5.29.14', 'subjectKeyIdentifier');\n_IN('2.5.29.15', 'keyUsage');\n_I_('2.5.29.16', 'privateKeyUsagePeriod');\n_IN('2.5.29.17', 'subjectAltName');\n_IN('2.5.29.18', 'issuerAltName');\n_IN('2.5.29.19', 'basicConstraints');\n_I_('2.5.29.20', 'cRLNumber');\n_I_('2.5.29.21', 'cRLReason');\n_I_('2.5.29.22', 'expirationDate');\n_I_('2.5.29.23', 'instructionCode');\n_I_('2.5.29.24', 'invalidityDate');\n_I_('2.5.29.25', 'cRLDistributionPoints'); // deprecated use .31\n_I_('2.5.29.26', 'issuingDistributionPoint'); // deprecated use .28\n_I_('2.5.29.27', 'deltaCRLIndicator');\n_I_('2.5.29.28', 'issuingDistributionPoint');\n_I_('2.5.29.29', 'certificateIssuer');\n_I_('2.5.29.30', 'nameConstraints');\n_IN('2.5.29.31', 'cRLDistributionPoints');\n_IN('2.5.29.32', 'certificatePolicies');\n_I_('2.5.29.33', 'policyMappings');\n_I_('2.5.29.34', 'policyConstraints'); // deprecated use .36\n_IN('2.5.29.35', 'authorityKeyIdentifier');\n_I_('2.5.29.36', 'policyConstraints');\n_IN('2.5.29.37', 'extKeyUsage');\n_I_('2.5.29.46', 'freshestCRL');\n_I_('2.5.29.54', 'inhibitAnyPolicy');\n\n// extKeyUsage purposes\n_IN('1.3.6.1.4.1.11129.2.4.2', 'timestampList');\n_IN('1.3.6.1.5.5.7.1.1', 'authorityInfoAccess');\n_IN('1.3.6.1.5.5.7.3.1', 'serverAuth');\n_IN('1.3.6.1.5.5.7.3.2', 'clientAuth');\n_IN('1.3.6.1.5.5.7.3.3', 'codeSigning');\n_IN('1.3.6.1.5.5.7.3.4', 'emailProtection');\n_IN('1.3.6.1.5.5.7.3.8', 'timeStamping');\n","/**\n * Password-based encryption functions.\n *\n * @author Dave Longley\n * @author Stefan Siegl <stesie@brokenpipe.de>\n *\n * Copyright (c) 2010-2013 Digital Bazaar, Inc.\n * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>\n *\n * An EncryptedPrivateKeyInfo:\n *\n * EncryptedPrivateKeyInfo ::= SEQUENCE {\n *   encryptionAlgorithm  EncryptionAlgorithmIdentifier,\n *   encryptedData        EncryptedData }\n *\n * EncryptionAlgorithmIdentifier ::= AlgorithmIdentifier\n *\n * EncryptedData ::= OCTET STRING\n */\nvar forge = require('./forge');\nrequire('./aes');\nrequire('./asn1');\nrequire('./des');\nrequire('./md');\nrequire('./oids');\nrequire('./pbkdf2');\nrequire('./pem');\nrequire('./random');\nrequire('./rc2');\nrequire('./rsa');\nrequire('./util');\n\nif(typeof BigInteger === 'undefined') {\n  var BigInteger = forge.jsbn.BigInteger;\n}\n\n// shortcut for asn.1 API\nvar asn1 = forge.asn1;\n\n/* Password-based encryption implementation. */\nvar pki = forge.pki = forge.pki || {};\nmodule.exports = pki.pbe = forge.pbe = forge.pbe || {};\nvar oids = pki.oids;\n\n// validator for an EncryptedPrivateKeyInfo structure\n// Note: Currently only works w/algorithm params\nvar encryptedPrivateKeyValidator = {\n  name: 'EncryptedPrivateKeyInfo',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'EncryptedPrivateKeyInfo.encryptionAlgorithm',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'AlgorithmIdentifier.algorithm',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OID,\n      constructed: false,\n      capture: 'encryptionOid'\n    }, {\n      name: 'AlgorithmIdentifier.parameters',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      captureAsn1: 'encryptionParams'\n    }]\n  }, {\n    // encryptedData\n    name: 'EncryptedPrivateKeyInfo.encryptedData',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.OCTETSTRING,\n    constructed: false,\n    capture: 'encryptedData'\n  }]\n};\n\n// validator for a PBES2Algorithms structure\n// Note: Currently only works w/PBKDF2 + AES encryption schemes\nvar PBES2AlgorithmsValidator = {\n  name: 'PBES2Algorithms',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'PBES2Algorithms.keyDerivationFunc',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'PBES2Algorithms.keyDerivationFunc.oid',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OID,\n      constructed: false,\n      capture: 'kdfOid'\n    }, {\n      name: 'PBES2Algorithms.params',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      value: [{\n        name: 'PBES2Algorithms.params.salt',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.OCTETSTRING,\n        constructed: false,\n        capture: 'kdfSalt'\n      }, {\n        name: 'PBES2Algorithms.params.iterationCount',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.INTEGER,\n        constructed: false,\n        capture: 'kdfIterationCount'\n      }, {\n        name: 'PBES2Algorithms.params.keyLength',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.INTEGER,\n        constructed: false,\n        optional: true,\n        capture: 'keyLength'\n      }, {\n        // prf\n        name: 'PBES2Algorithms.params.prf',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.SEQUENCE,\n        constructed: true,\n        optional: true,\n        value: [{\n          name: 'PBES2Algorithms.params.prf.algorithm',\n          tagClass: asn1.Class.UNIVERSAL,\n          type: asn1.Type.OID,\n          constructed: false,\n          capture: 'prfOid'\n        }]\n      }]\n    }]\n  }, {\n    name: 'PBES2Algorithms.encryptionScheme',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'PBES2Algorithms.encryptionScheme.oid',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OID,\n      constructed: false,\n      capture: 'encOid'\n    }, {\n      name: 'PBES2Algorithms.encryptionScheme.iv',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OCTETSTRING,\n      constructed: false,\n      capture: 'encIv'\n    }]\n  }]\n};\n\nvar pkcs12PbeParamsValidator = {\n  name: 'pkcs-12PbeParams',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'pkcs-12PbeParams.salt',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.OCTETSTRING,\n    constructed: false,\n    capture: 'salt'\n  }, {\n    name: 'pkcs-12PbeParams.iterations',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'iterations'\n  }]\n};\n\n/**\n * Encrypts a ASN.1 PrivateKeyInfo object, producing an EncryptedPrivateKeyInfo.\n *\n * PBES2Algorithms ALGORITHM-IDENTIFIER ::=\n *   { {PBES2-params IDENTIFIED BY id-PBES2}, ...}\n *\n * id-PBES2 OBJECT IDENTIFIER ::= {pkcs-5 13}\n *\n * PBES2-params ::= SEQUENCE {\n *   keyDerivationFunc AlgorithmIdentifier {{PBES2-KDFs}},\n *   encryptionScheme AlgorithmIdentifier {{PBES2-Encs}}\n * }\n *\n * PBES2-KDFs ALGORITHM-IDENTIFIER ::=\n *   { {PBKDF2-params IDENTIFIED BY id-PBKDF2}, ... }\n *\n * PBES2-Encs ALGORITHM-IDENTIFIER ::= { ... }\n *\n * PBKDF2-params ::= SEQUENCE {\n *   salt CHOICE {\n *     specified OCTET STRING,\n *     otherSource AlgorithmIdentifier {{PBKDF2-SaltSources}}\n *   },\n *   iterationCount INTEGER (1..MAX),\n *   keyLength INTEGER (1..MAX) OPTIONAL,\n *   prf AlgorithmIdentifier {{PBKDF2-PRFs}} DEFAULT algid-hmacWithSHA1\n * }\n *\n * @param obj the ASN.1 PrivateKeyInfo object.\n * @param password the password to encrypt with.\n * @param options:\n *          algorithm the encryption algorithm to use\n *            ('aes128', 'aes192', 'aes256', '3des'), defaults to 'aes128'.\n *          count the iteration count to use.\n *          saltSize the salt size to use.\n *          prfAlgorithm the PRF message digest algorithm to use\n *            ('sha1', 'sha224', 'sha256', 'sha384', 'sha512')\n *\n * @return the ASN.1 EncryptedPrivateKeyInfo.\n */\npki.encryptPrivateKeyInfo = function(obj, password, options) {\n  // set default options\n  options = options || {};\n  options.saltSize = options.saltSize || 8;\n  options.count = options.count || 2048;\n  options.algorithm = options.algorithm || 'aes128';\n  options.prfAlgorithm = options.prfAlgorithm || 'sha1';\n\n  // generate PBE params\n  var salt = forge.random.getBytesSync(options.saltSize);\n  var count = options.count;\n  var countBytes = asn1.integerToDer(count);\n  var dkLen;\n  var encryptionAlgorithm;\n  var encryptedData;\n  if(options.algorithm.indexOf('aes') === 0 || options.algorithm === 'des') {\n    // do PBES2\n    var ivLen, encOid, cipherFn;\n    switch(options.algorithm) {\n    case 'aes128':\n      dkLen = 16;\n      ivLen = 16;\n      encOid = oids['aes128-CBC'];\n      cipherFn = forge.aes.createEncryptionCipher;\n      break;\n    case 'aes192':\n      dkLen = 24;\n      ivLen = 16;\n      encOid = oids['aes192-CBC'];\n      cipherFn = forge.aes.createEncryptionCipher;\n      break;\n    case 'aes256':\n      dkLen = 32;\n      ivLen = 16;\n      encOid = oids['aes256-CBC'];\n      cipherFn = forge.aes.createEncryptionCipher;\n      break;\n    case 'des':\n      dkLen = 8;\n      ivLen = 8;\n      encOid = oids['desCBC'];\n      cipherFn = forge.des.createEncryptionCipher;\n      break;\n    default:\n      var error = new Error('Cannot encrypt private key. Unknown encryption algorithm.');\n      error.algorithm = options.algorithm;\n      throw error;\n    }\n\n    // get PRF message digest\n    var prfAlgorithm = 'hmacWith' + options.prfAlgorithm.toUpperCase();\n    var md = prfAlgorithmToMessageDigest(prfAlgorithm);\n\n    // encrypt private key using pbe SHA-1 and AES/DES\n    var dk = forge.pkcs5.pbkdf2(password, salt, count, dkLen, md);\n    var iv = forge.random.getBytesSync(ivLen);\n    var cipher = cipherFn(dk);\n    cipher.start(iv);\n    cipher.update(asn1.toDer(obj));\n    cipher.finish();\n    encryptedData = cipher.output.getBytes();\n\n    // get PBKDF2-params\n    var params = createPbkdf2Params(salt, countBytes, dkLen, prfAlgorithm);\n\n    encryptionAlgorithm = asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n        asn1.oidToDer(oids['pkcs5PBES2']).getBytes()),\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n        // keyDerivationFunc\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n            asn1.oidToDer(oids['pkcs5PBKDF2']).getBytes()),\n          // PBKDF2-params\n          params\n        ]),\n        // encryptionScheme\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n            asn1.oidToDer(encOid).getBytes()),\n          // iv\n          asn1.create(\n            asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, iv)\n        ])\n      ])\n    ]);\n  } else if(options.algorithm === '3des') {\n    // Do PKCS12 PBE\n    dkLen = 24;\n\n    var saltBytes = new forge.util.ByteBuffer(salt);\n    var dk = pki.pbe.generatePkcs12Key(password, saltBytes, 1, count, dkLen);\n    var iv = pki.pbe.generatePkcs12Key(password, saltBytes, 2, count, dkLen);\n    var cipher = forge.des.createEncryptionCipher(dk);\n    cipher.start(iv);\n    cipher.update(asn1.toDer(obj));\n    cipher.finish();\n    encryptedData = cipher.output.getBytes();\n\n    encryptionAlgorithm = asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n        asn1.oidToDer(oids['pbeWithSHAAnd3-KeyTripleDES-CBC']).getBytes()),\n      // pkcs-12PbeParams\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n        // salt\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, salt),\n        // iteration count\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n          countBytes.getBytes())\n      ])\n    ]);\n  } else {\n    var error = new Error('Cannot encrypt private key. Unknown encryption algorithm.');\n    error.algorithm = options.algorithm;\n    throw error;\n  }\n\n  // EncryptedPrivateKeyInfo\n  var rval = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // encryptionAlgorithm\n    encryptionAlgorithm,\n    // encryptedData\n    asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, encryptedData)\n  ]);\n  return rval;\n};\n\n/**\n * Decrypts a ASN.1 PrivateKeyInfo object.\n *\n * @param obj the ASN.1 EncryptedPrivateKeyInfo object.\n * @param password the password to decrypt with.\n *\n * @return the ASN.1 PrivateKeyInfo on success, null on failure.\n */\npki.decryptPrivateKeyInfo = function(obj, password) {\n  var rval = null;\n\n  // get PBE params\n  var capture = {};\n  var errors = [];\n  if(!asn1.validate(obj, encryptedPrivateKeyValidator, capture, errors)) {\n    var error = new Error('Cannot read encrypted private key. ' +\n      'ASN.1 object is not a supported EncryptedPrivateKeyInfo.');\n    error.errors = errors;\n    throw error;\n  }\n\n  // get cipher\n  var oid = asn1.derToOid(capture.encryptionOid);\n  var cipher = pki.pbe.getCipher(oid, capture.encryptionParams, password);\n\n  // get encrypted data\n  var encrypted = forge.util.createBuffer(capture.encryptedData);\n\n  cipher.update(encrypted);\n  if(cipher.finish()) {\n    rval = asn1.fromDer(cipher.output);\n  }\n\n  return rval;\n};\n\n/**\n * Converts a EncryptedPrivateKeyInfo to PEM format.\n *\n * @param epki the EncryptedPrivateKeyInfo.\n * @param maxline the maximum characters per line, defaults to 64.\n *\n * @return the PEM-formatted encrypted private key.\n */\npki.encryptedPrivateKeyToPem = function(epki, maxline) {\n  // convert to DER, then PEM-encode\n  var msg = {\n    type: 'ENCRYPTED PRIVATE KEY',\n    body: asn1.toDer(epki).getBytes()\n  };\n  return forge.pem.encode(msg, {maxline: maxline});\n};\n\n/**\n * Converts a PEM-encoded EncryptedPrivateKeyInfo to ASN.1 format. Decryption\n * is not performed.\n *\n * @param pem the EncryptedPrivateKeyInfo in PEM-format.\n *\n * @return the ASN.1 EncryptedPrivateKeyInfo.\n */\npki.encryptedPrivateKeyFromPem = function(pem) {\n  var msg = forge.pem.decode(pem)[0];\n\n  if(msg.type !== 'ENCRYPTED PRIVATE KEY') {\n    var error = new Error('Could not convert encrypted private key from PEM; ' +\n      'PEM header type is \"ENCRYPTED PRIVATE KEY\".');\n    error.headerType = msg.type;\n    throw error;\n  }\n  if(msg.procType && msg.procType.type === 'ENCRYPTED') {\n    throw new Error('Could not convert encrypted private key from PEM; ' +\n      'PEM is encrypted.');\n  }\n\n  // convert DER to ASN.1 object\n  return asn1.fromDer(msg.body);\n};\n\n/**\n * Encrypts an RSA private key. By default, the key will be wrapped in\n * a PrivateKeyInfo and encrypted to produce a PKCS#8 EncryptedPrivateKeyInfo.\n * This is the standard, preferred way to encrypt a private key.\n *\n * To produce a non-standard PEM-encrypted private key that uses encapsulated\n * headers to indicate the encryption algorithm (old-style non-PKCS#8 OpenSSL\n * private key encryption), set the 'legacy' option to true. Note: Using this\n * option will cause the iteration count to be forced to 1.\n *\n * Note: The 'des' algorithm is supported, but it is not considered to be\n * secure because it only uses a single 56-bit key. If possible, it is highly\n * recommended that a different algorithm be used.\n *\n * @param rsaKey the RSA key to encrypt.\n * @param password the password to use.\n * @param options:\n *          algorithm: the encryption algorithm to use\n *            ('aes128', 'aes192', 'aes256', '3des', 'des').\n *          count: the iteration count to use.\n *          saltSize: the salt size to use.\n *          legacy: output an old non-PKCS#8 PEM-encrypted+encapsulated\n *            headers (DEK-Info) private key.\n *\n * @return the PEM-encoded ASN.1 EncryptedPrivateKeyInfo.\n */\npki.encryptRsaPrivateKey = function(rsaKey, password, options) {\n  // standard PKCS#8\n  options = options || {};\n  if(!options.legacy) {\n    // encrypt PrivateKeyInfo\n    var rval = pki.wrapRsaPrivateKey(pki.privateKeyToAsn1(rsaKey));\n    rval = pki.encryptPrivateKeyInfo(rval, password, options);\n    return pki.encryptedPrivateKeyToPem(rval);\n  }\n\n  // legacy non-PKCS#8\n  var algorithm;\n  var iv;\n  var dkLen;\n  var cipherFn;\n  switch(options.algorithm) {\n  case 'aes128':\n    algorithm = 'AES-128-CBC';\n    dkLen = 16;\n    iv = forge.random.getBytesSync(16);\n    cipherFn = forge.aes.createEncryptionCipher;\n    break;\n  case 'aes192':\n    algorithm = 'AES-192-CBC';\n    dkLen = 24;\n    iv = forge.random.getBytesSync(16);\n    cipherFn = forge.aes.createEncryptionCipher;\n    break;\n  case 'aes256':\n    algorithm = 'AES-256-CBC';\n    dkLen = 32;\n    iv = forge.random.getBytesSync(16);\n    cipherFn = forge.aes.createEncryptionCipher;\n    break;\n  case '3des':\n    algorithm = 'DES-EDE3-CBC';\n    dkLen = 24;\n    iv = forge.random.getBytesSync(8);\n    cipherFn = forge.des.createEncryptionCipher;\n    break;\n  case 'des':\n    algorithm = 'DES-CBC';\n    dkLen = 8;\n    iv = forge.random.getBytesSync(8);\n    cipherFn = forge.des.createEncryptionCipher;\n    break;\n  default:\n    var error = new Error('Could not encrypt RSA private key; unsupported ' +\n      'encryption algorithm \"' + options.algorithm + '\".');\n    error.algorithm = options.algorithm;\n    throw error;\n  }\n\n  // encrypt private key using OpenSSL legacy key derivation\n  var dk = forge.pbe.opensslDeriveBytes(password, iv.substr(0, 8), dkLen);\n  var cipher = cipherFn(dk);\n  cipher.start(iv);\n  cipher.update(asn1.toDer(pki.privateKeyToAsn1(rsaKey)));\n  cipher.finish();\n\n  var msg = {\n    type: 'RSA PRIVATE KEY',\n    procType: {\n      version: '4',\n      type: 'ENCRYPTED'\n    },\n    dekInfo: {\n      algorithm: algorithm,\n      parameters: forge.util.bytesToHex(iv).toUpperCase()\n    },\n    body: cipher.output.getBytes()\n  };\n  return forge.pem.encode(msg);\n};\n\n/**\n * Decrypts an RSA private key.\n *\n * @param pem the PEM-formatted EncryptedPrivateKeyInfo to decrypt.\n * @param password the password to use.\n *\n * @return the RSA key on success, null on failure.\n */\npki.decryptRsaPrivateKey = function(pem, password) {\n  var rval = null;\n\n  var msg = forge.pem.decode(pem)[0];\n\n  if(msg.type !== 'ENCRYPTED PRIVATE KEY' &&\n    msg.type !== 'PRIVATE KEY' &&\n    msg.type !== 'RSA PRIVATE KEY') {\n    var error = new Error('Could not convert private key from PEM; PEM header type ' +\n      'is not \"ENCRYPTED PRIVATE KEY\", \"PRIVATE KEY\", or \"RSA PRIVATE KEY\".');\n    error.headerType = error;\n    throw error;\n  }\n\n  if(msg.procType && msg.procType.type === 'ENCRYPTED') {\n    var dkLen;\n    var cipherFn;\n    switch(msg.dekInfo.algorithm) {\n    case 'DES-CBC':\n      dkLen = 8;\n      cipherFn = forge.des.createDecryptionCipher;\n      break;\n    case 'DES-EDE3-CBC':\n      dkLen = 24;\n      cipherFn = forge.des.createDecryptionCipher;\n      break;\n    case 'AES-128-CBC':\n      dkLen = 16;\n      cipherFn = forge.aes.createDecryptionCipher;\n      break;\n    case 'AES-192-CBC':\n      dkLen = 24;\n      cipherFn = forge.aes.createDecryptionCipher;\n      break;\n    case 'AES-256-CBC':\n      dkLen = 32;\n      cipherFn = forge.aes.createDecryptionCipher;\n      break;\n    case 'RC2-40-CBC':\n      dkLen = 5;\n      cipherFn = function(key) {\n        return forge.rc2.createDecryptionCipher(key, 40);\n      };\n      break;\n    case 'RC2-64-CBC':\n      dkLen = 8;\n      cipherFn = function(key) {\n        return forge.rc2.createDecryptionCipher(key, 64);\n      };\n      break;\n    case 'RC2-128-CBC':\n      dkLen = 16;\n      cipherFn = function(key) {\n        return forge.rc2.createDecryptionCipher(key, 128);\n      };\n      break;\n    default:\n      var error = new Error('Could not decrypt private key; unsupported ' +\n        'encryption algorithm \"' + msg.dekInfo.algorithm + '\".');\n      error.algorithm = msg.dekInfo.algorithm;\n      throw error;\n    }\n\n    // use OpenSSL legacy key derivation\n    var iv = forge.util.hexToBytes(msg.dekInfo.parameters);\n    var dk = forge.pbe.opensslDeriveBytes(password, iv.substr(0, 8), dkLen);\n    var cipher = cipherFn(dk);\n    cipher.start(iv);\n    cipher.update(forge.util.createBuffer(msg.body));\n    if(cipher.finish()) {\n      rval = cipher.output.getBytes();\n    } else {\n      return rval;\n    }\n  } else {\n    rval = msg.body;\n  }\n\n  if(msg.type === 'ENCRYPTED PRIVATE KEY') {\n    rval = pki.decryptPrivateKeyInfo(asn1.fromDer(rval), password);\n  } else {\n    // decryption already performed above\n    rval = asn1.fromDer(rval);\n  }\n\n  if(rval !== null) {\n    rval = pki.privateKeyFromAsn1(rval);\n  }\n\n  return rval;\n};\n\n/**\n * Derives a PKCS#12 key.\n *\n * @param password the password to derive the key material from, null or\n *          undefined for none.\n * @param salt the salt, as a ByteBuffer, to use.\n * @param id the PKCS#12 ID byte (1 = key material, 2 = IV, 3 = MAC).\n * @param iter the iteration count.\n * @param n the number of bytes to derive from the password.\n * @param md the message digest to use, defaults to SHA-1.\n *\n * @return a ByteBuffer with the bytes derived from the password.\n */\npki.pbe.generatePkcs12Key = function(password, salt, id, iter, n, md) {\n  var j, l;\n\n  if(typeof md === 'undefined' || md === null) {\n    if(!('sha1' in forge.md)) {\n      throw new Error('\"sha1\" hash algorithm unavailable.');\n    }\n    md = forge.md.sha1.create();\n  }\n\n  var u = md.digestLength;\n  var v = md.blockLength;\n  var result = new forge.util.ByteBuffer();\n\n  /* Convert password to Unicode byte buffer + trailing 0-byte. */\n  var passBuf = new forge.util.ByteBuffer();\n  if(password !== null && password !== undefined) {\n    for(l = 0; l < password.length; l++) {\n      passBuf.putInt16(password.charCodeAt(l));\n    }\n    passBuf.putInt16(0);\n  }\n\n  /* Length of salt and password in BYTES. */\n  var p = passBuf.length();\n  var s = salt.length();\n\n  /* 1. Construct a string, D (the \"diversifier\"), by concatenating\n        v copies of ID. */\n  var D = new forge.util.ByteBuffer();\n  D.fillWithByte(id, v);\n\n  /* 2. Concatenate copies of the salt together to create a string S of length\n        v * ceil(s / v) bytes (the final copy of the salt may be trunacted\n        to create S).\n        Note that if the salt is the empty string, then so is S. */\n  var Slen = v * Math.ceil(s / v);\n  var S = new forge.util.ByteBuffer();\n  for(l = 0; l < Slen; l++) {\n    S.putByte(salt.at(l % s));\n  }\n\n  /* 3. Concatenate copies of the password together to create a string P of\n        length v * ceil(p / v) bytes (the final copy of the password may be\n        truncated to create P).\n        Note that if the password is the empty string, then so is P. */\n  var Plen = v * Math.ceil(p / v);\n  var P = new forge.util.ByteBuffer();\n  for(l = 0; l < Plen; l++) {\n    P.putByte(passBuf.at(l % p));\n  }\n\n  /* 4. Set I=S||P to be the concatenation of S and P. */\n  var I = S;\n  I.putBuffer(P);\n\n  /* 5. Set c=ceil(n / u). */\n  var c = Math.ceil(n / u);\n\n  /* 6. For i=1, 2, ..., c, do the following: */\n  for(var i = 1; i <= c; i++) {\n    /* a) Set Ai=H^r(D||I). (l.e. the rth hash of D||I, H(H(H(...H(D||I)))) */\n    var buf = new forge.util.ByteBuffer();\n    buf.putBytes(D.bytes());\n    buf.putBytes(I.bytes());\n    for(var round = 0; round < iter; round++) {\n      md.start();\n      md.update(buf.getBytes());\n      buf = md.digest();\n    }\n\n    /* b) Concatenate copies of Ai to create a string B of length v bytes (the\n          final copy of Ai may be truncated to create B). */\n    var B = new forge.util.ByteBuffer();\n    for(l = 0; l < v; l++) {\n      B.putByte(buf.at(l % u));\n    }\n\n    /* c) Treating I as a concatenation I0, I1, ..., Ik-1 of v-byte blocks,\n          where k=ceil(s / v) + ceil(p / v), modify I by setting\n          Ij=(Ij+B+1) mod 2v for each j.  */\n    var k = Math.ceil(s / v) + Math.ceil(p / v);\n    var Inew = new forge.util.ByteBuffer();\n    for(j = 0; j < k; j++) {\n      var chunk = new forge.util.ByteBuffer(I.getBytes(v));\n      var x = 0x1ff;\n      for(l = B.length() - 1; l >= 0; l--) {\n        x = x >> 8;\n        x += B.at(l) + chunk.at(l);\n        chunk.setAt(l, x & 0xff);\n      }\n      Inew.putBuffer(chunk);\n    }\n    I = Inew;\n\n    /* Add Ai to A. */\n    result.putBuffer(buf);\n  }\n\n  result.truncate(result.length() - n);\n  return result;\n};\n\n/**\n * Get new Forge cipher object instance.\n *\n * @param oid the OID (in string notation).\n * @param params the ASN.1 params object.\n * @param password the password to decrypt with.\n *\n * @return new cipher object instance.\n */\npki.pbe.getCipher = function(oid, params, password) {\n  switch(oid) {\n  case pki.oids['pkcs5PBES2']:\n    return pki.pbe.getCipherForPBES2(oid, params, password);\n\n  case pki.oids['pbeWithSHAAnd3-KeyTripleDES-CBC']:\n  case pki.oids['pbewithSHAAnd40BitRC2-CBC']:\n    return pki.pbe.getCipherForPKCS12PBE(oid, params, password);\n\n  default:\n    var error = new Error('Cannot read encrypted PBE data block. Unsupported OID.');\n    error.oid = oid;\n    error.supportedOids = [\n      'pkcs5PBES2',\n      'pbeWithSHAAnd3-KeyTripleDES-CBC',\n      'pbewithSHAAnd40BitRC2-CBC'\n    ];\n    throw error;\n  }\n};\n\n/**\n * Get new Forge cipher object instance according to PBES2 params block.\n *\n * The returned cipher instance is already started using the IV\n * from PBES2 parameter block.\n *\n * @param oid the PKCS#5 PBKDF2 OID (in string notation).\n * @param params the ASN.1 PBES2-params object.\n * @param password the password to decrypt with.\n *\n * @return new cipher object instance.\n */\npki.pbe.getCipherForPBES2 = function(oid, params, password) {\n  // get PBE params\n  var capture = {};\n  var errors = [];\n  if(!asn1.validate(params, PBES2AlgorithmsValidator, capture, errors)) {\n    var error = new Error('Cannot read password-based-encryption algorithm ' +\n      'parameters. ASN.1 object is not a supported EncryptedPrivateKeyInfo.');\n    error.errors = errors;\n    throw error;\n  }\n\n  // check oids\n  oid = asn1.derToOid(capture.kdfOid);\n  if(oid !== pki.oids['pkcs5PBKDF2']) {\n    var error = new Error('Cannot read encrypted private key. ' +\n      'Unsupported key derivation function OID.');\n    error.oid = oid;\n    error.supportedOids = ['pkcs5PBKDF2'];\n    throw error;\n  }\n  oid = asn1.derToOid(capture.encOid);\n  if(oid !== pki.oids['aes128-CBC'] &&\n    oid !== pki.oids['aes192-CBC'] &&\n    oid !== pki.oids['aes256-CBC'] &&\n    oid !== pki.oids['des-EDE3-CBC'] &&\n    oid !== pki.oids['desCBC']) {\n    var error = new Error('Cannot read encrypted private key. ' +\n      'Unsupported encryption scheme OID.');\n    error.oid = oid;\n    error.supportedOids = [\n      'aes128-CBC', 'aes192-CBC', 'aes256-CBC', 'des-EDE3-CBC', 'desCBC'];\n    throw error;\n  }\n\n  // set PBE params\n  var salt = capture.kdfSalt;\n  var count = forge.util.createBuffer(capture.kdfIterationCount);\n  count = count.getInt(count.length() << 3);\n  var dkLen;\n  var cipherFn;\n  switch(pki.oids[oid]) {\n  case 'aes128-CBC':\n    dkLen = 16;\n    cipherFn = forge.aes.createDecryptionCipher;\n    break;\n  case 'aes192-CBC':\n    dkLen = 24;\n    cipherFn = forge.aes.createDecryptionCipher;\n    break;\n  case 'aes256-CBC':\n    dkLen = 32;\n    cipherFn = forge.aes.createDecryptionCipher;\n    break;\n  case 'des-EDE3-CBC':\n    dkLen = 24;\n    cipherFn = forge.des.createDecryptionCipher;\n    break;\n  case 'desCBC':\n    dkLen = 8;\n    cipherFn = forge.des.createDecryptionCipher;\n    break;\n  }\n\n  // get PRF message digest\n  var md = prfOidToMessageDigest(capture.prfOid);\n\n  // decrypt private key using pbe with chosen PRF and AES/DES\n  var dk = forge.pkcs5.pbkdf2(password, salt, count, dkLen, md);\n  var iv = capture.encIv;\n  var cipher = cipherFn(dk);\n  cipher.start(iv);\n\n  return cipher;\n};\n\n/**\n * Get new Forge cipher object instance for PKCS#12 PBE.\n *\n * The returned cipher instance is already started using the key & IV\n * derived from the provided password and PKCS#12 PBE salt.\n *\n * @param oid The PKCS#12 PBE OID (in string notation).\n * @param params The ASN.1 PKCS#12 PBE-params object.\n * @param password The password to decrypt with.\n *\n * @return the new cipher object instance.\n */\npki.pbe.getCipherForPKCS12PBE = function(oid, params, password) {\n  // get PBE params\n  var capture = {};\n  var errors = [];\n  if(!asn1.validate(params, pkcs12PbeParamsValidator, capture, errors)) {\n    var error = new Error('Cannot read password-based-encryption algorithm ' +\n      'parameters. ASN.1 object is not a supported EncryptedPrivateKeyInfo.');\n    error.errors = errors;\n    throw error;\n  }\n\n  var salt = forge.util.createBuffer(capture.salt);\n  var count = forge.util.createBuffer(capture.iterations);\n  count = count.getInt(count.length() << 3);\n\n  var dkLen, dIvLen, cipherFn;\n  switch(oid) {\n    case pki.oids['pbeWithSHAAnd3-KeyTripleDES-CBC']:\n      dkLen = 24;\n      dIvLen = 8;\n      cipherFn = forge.des.startDecrypting;\n      break;\n\n    case pki.oids['pbewithSHAAnd40BitRC2-CBC']:\n      dkLen = 5;\n      dIvLen = 8;\n      cipherFn = function(key, iv) {\n        var cipher = forge.rc2.createDecryptionCipher(key, 40);\n        cipher.start(iv, null);\n        return cipher;\n      };\n      break;\n\n    default:\n      var error = new Error('Cannot read PKCS #12 PBE data block. Unsupported OID.');\n      error.oid = oid;\n      throw error;\n  }\n\n  // get PRF message digest\n  var md = prfOidToMessageDigest(capture.prfOid);\n  var key = pki.pbe.generatePkcs12Key(password, salt, 1, count, dkLen, md);\n  md.start();\n  var iv = pki.pbe.generatePkcs12Key(password, salt, 2, count, dIvLen, md);\n\n  return cipherFn(key, iv);\n};\n\n/**\n * OpenSSL's legacy key derivation function.\n *\n * See: http://www.openssl.org/docs/crypto/EVP_BytesToKey.html\n *\n * @param password the password to derive the key from.\n * @param salt the salt to use, null for none.\n * @param dkLen the number of bytes needed for the derived key.\n * @param [options] the options to use:\n *          [md] an optional message digest object to use.\n */\npki.pbe.opensslDeriveBytes = function(password, salt, dkLen, md) {\n  if(typeof md === 'undefined' || md === null) {\n    if(!('md5' in forge.md)) {\n      throw new Error('\"md5\" hash algorithm unavailable.');\n    }\n    md = forge.md.md5.create();\n  }\n  if(salt === null) {\n    salt = '';\n  }\n  var digests = [hash(md, password + salt)];\n  for(var length = 16, i = 1; length < dkLen; ++i, length += 16) {\n    digests.push(hash(md, digests[i - 1] + password + salt));\n  }\n  return digests.join('').substr(0, dkLen);\n};\n\nfunction hash(md, bytes) {\n  return md.start().update(bytes).digest().getBytes();\n}\n\nfunction prfOidToMessageDigest(prfOid) {\n  // get PRF algorithm, default to SHA-1\n  var prfAlgorithm;\n  if(!prfOid) {\n    prfAlgorithm = 'hmacWithSHA1';\n  } else {\n    prfAlgorithm = pki.oids[asn1.derToOid(prfOid)];\n    if(!prfAlgorithm) {\n      var error = new Error('Unsupported PRF OID.');\n      error.oid = prfOid;\n      error.supported = [\n        'hmacWithSHA1', 'hmacWithSHA224', 'hmacWithSHA256', 'hmacWithSHA384',\n        'hmacWithSHA512'];\n      throw error;\n    }\n  }\n  return prfAlgorithmToMessageDigest(prfAlgorithm);\n}\n\nfunction prfAlgorithmToMessageDigest(prfAlgorithm) {\n  var factory = forge.md;\n  switch(prfAlgorithm) {\n  case 'hmacWithSHA224':\n    factory = forge.md.sha512;\n  case 'hmacWithSHA1':\n  case 'hmacWithSHA256':\n  case 'hmacWithSHA384':\n  case 'hmacWithSHA512':\n    prfAlgorithm = prfAlgorithm.substr(8).toLowerCase();\n    break;\n  default:\n    var error = new Error('Unsupported PRF algorithm.');\n    error.algorithm = prfAlgorithm;\n    error.supported = [\n      'hmacWithSHA1', 'hmacWithSHA224', 'hmacWithSHA256', 'hmacWithSHA384',\n      'hmacWithSHA512'];\n    throw error;\n  }\n  if(!factory || !(prfAlgorithm in factory)) {\n    throw new Error('Unknown hash algorithm: ' + prfAlgorithm);\n  }\n  return factory[prfAlgorithm].create();\n}\n\nfunction createPbkdf2Params(salt, countBytes, dkLen, prfAlgorithm) {\n  var params = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // salt\n    asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, salt),\n    // iteration count\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      countBytes.getBytes())\n  ]);\n  // when PRF algorithm is not SHA-1 default, add key length and PRF algorithm\n  if(prfAlgorithm !== 'hmacWithSHA1') {\n    params.value.push(\n      // key length\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n        forge.util.hexToBytes(dkLen.toString(16))),\n      // AlgorithmIdentifier\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n        // algorithm\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n          asn1.oidToDer(pki.oids[prfAlgorithm]).getBytes()),\n        // parameters (null)\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')\n      ]));\n  }\n  return params;\n}\n","/**\n * Advanced Encryption Standard (AES) implementation.\n *\n * This implementation is based on the public domain library 'jscrypto' which\n * was written by:\n *\n * Emily Stark (estark@stanford.edu)\n * Mike Hamburg (mhamburg@stanford.edu)\n * Dan Boneh (dabo@cs.stanford.edu)\n *\n * Parts of this code are based on the OpenSSL implementation of AES:\n * http://www.openssl.org\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./cipher');\nrequire('./cipherModes');\nrequire('./util');\n\n/* AES API */\nmodule.exports = forge.aes = forge.aes || {};\n\n/**\n * Deprecated. Instead, use:\n *\n * var cipher = forge.cipher.createCipher('AES-<mode>', key);\n * cipher.start({iv: iv});\n *\n * Creates an AES cipher object to encrypt data using the given symmetric key.\n * The output will be stored in the 'output' member of the returned cipher.\n *\n * The key and iv may be given as a string of bytes, an array of bytes,\n * a byte buffer, or an array of 32-bit words.\n *\n * @param key the symmetric key to use.\n * @param iv the initialization vector to use.\n * @param output the buffer to write to, null to create one.\n * @param mode the cipher mode to use (default: 'CBC').\n *\n * @return the cipher.\n */\nforge.aes.startEncrypting = function(key, iv, output, mode) {\n  var cipher = _createCipher({\n    key: key,\n    output: output,\n    decrypt: false,\n    mode: mode\n  });\n  cipher.start(iv);\n  return cipher;\n};\n\n/**\n * Deprecated. Instead, use:\n *\n * var cipher = forge.cipher.createCipher('AES-<mode>', key);\n *\n * Creates an AES cipher object to encrypt data using the given symmetric key.\n *\n * The key may be given as a string of bytes, an array of bytes, a\n * byte buffer, or an array of 32-bit words.\n *\n * @param key the symmetric key to use.\n * @param mode the cipher mode to use (default: 'CBC').\n *\n * @return the cipher.\n */\nforge.aes.createEncryptionCipher = function(key, mode) {\n  return _createCipher({\n    key: key,\n    output: null,\n    decrypt: false,\n    mode: mode\n  });\n};\n\n/**\n * Deprecated. Instead, use:\n *\n * var decipher = forge.cipher.createDecipher('AES-<mode>', key);\n * decipher.start({iv: iv});\n *\n * Creates an AES cipher object to decrypt data using the given symmetric key.\n * The output will be stored in the 'output' member of the returned cipher.\n *\n * The key and iv may be given as a string of bytes, an array of bytes,\n * a byte buffer, or an array of 32-bit words.\n *\n * @param key the symmetric key to use.\n * @param iv the initialization vector to use.\n * @param output the buffer to write to, null to create one.\n * @param mode the cipher mode to use (default: 'CBC').\n *\n * @return the cipher.\n */\nforge.aes.startDecrypting = function(key, iv, output, mode) {\n  var cipher = _createCipher({\n    key: key,\n    output: output,\n    decrypt: true,\n    mode: mode\n  });\n  cipher.start(iv);\n  return cipher;\n};\n\n/**\n * Deprecated. Instead, use:\n *\n * var decipher = forge.cipher.createDecipher('AES-<mode>', key);\n *\n * Creates an AES cipher object to decrypt data using the given symmetric key.\n *\n * The key may be given as a string of bytes, an array of bytes, a\n * byte buffer, or an array of 32-bit words.\n *\n * @param key the symmetric key to use.\n * @param mode the cipher mode to use (default: 'CBC').\n *\n * @return the cipher.\n */\nforge.aes.createDecryptionCipher = function(key, mode) {\n  return _createCipher({\n    key: key,\n    output: null,\n    decrypt: true,\n    mode: mode\n  });\n};\n\n/**\n * Creates a new AES cipher algorithm object.\n *\n * @param name the name of the algorithm.\n * @param mode the mode factory function.\n *\n * @return the AES algorithm object.\n */\nforge.aes.Algorithm = function(name, mode) {\n  if(!init) {\n    initialize();\n  }\n  var self = this;\n  self.name = name;\n  self.mode = new mode({\n    blockSize: 16,\n    cipher: {\n      encrypt: function(inBlock, outBlock) {\n        return _updateBlock(self._w, inBlock, outBlock, false);\n      },\n      decrypt: function(inBlock, outBlock) {\n        return _updateBlock(self._w, inBlock, outBlock, true);\n      }\n    }\n  });\n  self._init = false;\n};\n\n/**\n * Initializes this AES algorithm by expanding its key.\n *\n * @param options the options to use.\n *          key the key to use with this algorithm.\n *          decrypt true if the algorithm should be initialized for decryption,\n *            false for encryption.\n */\nforge.aes.Algorithm.prototype.initialize = function(options) {\n  if(this._init) {\n    return;\n  }\n\n  var key = options.key;\n  var tmp;\n\n  /* Note: The key may be a string of bytes, an array of bytes, a byte\n    buffer, or an array of 32-bit integers. If the key is in bytes, then\n    it must be 16, 24, or 32 bytes in length. If it is in 32-bit\n    integers, it must be 4, 6, or 8 integers long. */\n\n  if(typeof key === 'string' &&\n    (key.length === 16 || key.length === 24 || key.length === 32)) {\n    // convert key string into byte buffer\n    key = forge.util.createBuffer(key);\n  } else if(forge.util.isArray(key) &&\n    (key.length === 16 || key.length === 24 || key.length === 32)) {\n    // convert key integer array into byte buffer\n    tmp = key;\n    key = forge.util.createBuffer();\n    for(var i = 0; i < tmp.length; ++i) {\n      key.putByte(tmp[i]);\n    }\n  }\n\n  // convert key byte buffer into 32-bit integer array\n  if(!forge.util.isArray(key)) {\n    tmp = key;\n    key = [];\n\n    // key lengths of 16, 24, 32 bytes allowed\n    var len = tmp.length();\n    if(len === 16 || len === 24 || len === 32) {\n      len = len >>> 2;\n      for(var i = 0; i < len; ++i) {\n        key.push(tmp.getInt32());\n      }\n    }\n  }\n\n  // key must be an array of 32-bit integers by now\n  if(!forge.util.isArray(key) ||\n    !(key.length === 4 || key.length === 6 || key.length === 8)) {\n    throw new Error('Invalid key parameter.');\n  }\n\n  // encryption operation is always used for these modes\n  var mode = this.mode.name;\n  var encryptOp = (['CFB', 'OFB', 'CTR', 'GCM'].indexOf(mode) !== -1);\n\n  // do key expansion\n  this._w = _expandKey(key, options.decrypt && !encryptOp);\n  this._init = true;\n};\n\n/**\n * Expands a key. Typically only used for testing.\n *\n * @param key the symmetric key to expand, as an array of 32-bit words.\n * @param decrypt true to expand for decryption, false for encryption.\n *\n * @return the expanded key.\n */\nforge.aes._expandKey = function(key, decrypt) {\n  if(!init) {\n    initialize();\n  }\n  return _expandKey(key, decrypt);\n};\n\n/**\n * Updates a single block. Typically only used for testing.\n *\n * @param w the expanded key to use.\n * @param input an array of block-size 32-bit words.\n * @param output an array of block-size 32-bit words.\n * @param decrypt true to decrypt, false to encrypt.\n */\nforge.aes._updateBlock = _updateBlock;\n\n/** Register AES algorithms **/\n\nregisterAlgorithm('AES-ECB', forge.cipher.modes.ecb);\nregisterAlgorithm('AES-CBC', forge.cipher.modes.cbc);\nregisterAlgorithm('AES-CFB', forge.cipher.modes.cfb);\nregisterAlgorithm('AES-OFB', forge.cipher.modes.ofb);\nregisterAlgorithm('AES-CTR', forge.cipher.modes.ctr);\nregisterAlgorithm('AES-GCM', forge.cipher.modes.gcm);\n\nfunction registerAlgorithm(name, mode) {\n  var factory = function() {\n    return new forge.aes.Algorithm(name, mode);\n  };\n  forge.cipher.registerAlgorithm(name, factory);\n}\n\n/** AES implementation **/\n\nvar init = false; // not yet initialized\nvar Nb = 4;       // number of words comprising the state (AES = 4)\nvar sbox;         // non-linear substitution table used in key expansion\nvar isbox;        // inversion of sbox\nvar rcon;         // round constant word array\nvar mix;          // mix-columns table\nvar imix;         // inverse mix-columns table\n\n/**\n * Performs initialization, ie: precomputes tables to optimize for speed.\n *\n * One way to understand how AES works is to imagine that 'addition' and\n * 'multiplication' are interfaces that require certain mathematical\n * properties to hold true (ie: they are associative) but they might have\n * different implementations and produce different kinds of results ...\n * provided that their mathematical properties remain true. AES defines\n * its own methods of addition and multiplication but keeps some important\n * properties the same, ie: associativity and distributivity. The\n * explanation below tries to shed some light on how AES defines addition\n * and multiplication of bytes and 32-bit words in order to perform its\n * encryption and decryption algorithms.\n *\n * The basics:\n *\n * The AES algorithm views bytes as binary representations of polynomials\n * that have either 1 or 0 as the coefficients. It defines the addition\n * or subtraction of two bytes as the XOR operation. It also defines the\n * multiplication of two bytes as a finite field referred to as GF(2^8)\n * (Note: 'GF' means \"Galois Field\" which is a field that contains a finite\n * number of elements so GF(2^8) has 256 elements).\n *\n * This means that any two bytes can be represented as binary polynomials;\n * when they multiplied together and modularly reduced by an irreducible\n * polynomial of the 8th degree, the results are the field GF(2^8). The\n * specific irreducible polynomial that AES uses in hexadecimal is 0x11b.\n * This multiplication is associative with 0x01 as the identity:\n *\n * (b * 0x01 = GF(b, 0x01) = b).\n *\n * The operation GF(b, 0x02) can be performed at the byte level by left\n * shifting b once and then XOR'ing it (to perform the modular reduction)\n * with 0x11b if b is >= 128. Repeated application of the multiplication\n * of 0x02 can be used to implement the multiplication of any two bytes.\n *\n * For instance, multiplying 0x57 and 0x13, denoted as GF(0x57, 0x13), can\n * be performed by factoring 0x13 into 0x01, 0x02, and 0x10. Then these\n * factors can each be multiplied by 0x57 and then added together. To do\n * the multiplication, values for 0x57 multiplied by each of these 3 factors\n * can be precomputed and stored in a table. To add them, the values from\n * the table are XOR'd together.\n *\n * AES also defines addition and multiplication of words, that is 4-byte\n * numbers represented as polynomials of 3 degrees where the coefficients\n * are the values of the bytes.\n *\n * The word [a0, a1, a2, a3] is a polynomial a3x^3 + a2x^2 + a1x + a0.\n *\n * Addition is performed by XOR'ing like powers of x. Multiplication\n * is performed in two steps, the first is an algebriac expansion as\n * you would do normally (where addition is XOR). But the result is\n * a polynomial larger than 3 degrees and thus it cannot fit in a word. So\n * next the result is modularly reduced by an AES-specific polynomial of\n * degree 4 which will always produce a polynomial of less than 4 degrees\n * such that it will fit in a word. In AES, this polynomial is x^4 + 1.\n *\n * The modular product of two polynomials 'a' and 'b' is thus:\n *\n * d(x) = d3x^3 + d2x^2 + d1x + d0\n * with\n * d0 = GF(a0, b0) ^ GF(a3, b1) ^ GF(a2, b2) ^ GF(a1, b3)\n * d1 = GF(a1, b0) ^ GF(a0, b1) ^ GF(a3, b2) ^ GF(a2, b3)\n * d2 = GF(a2, b0) ^ GF(a1, b1) ^ GF(a0, b2) ^ GF(a3, b3)\n * d3 = GF(a3, b0) ^ GF(a2, b1) ^ GF(a1, b2) ^ GF(a0, b3)\n *\n * As a matrix:\n *\n * [d0] = [a0 a3 a2 a1][b0]\n * [d1]   [a1 a0 a3 a2][b1]\n * [d2]   [a2 a1 a0 a3][b2]\n * [d3]   [a3 a2 a1 a0][b3]\n *\n * Special polynomials defined by AES (0x02 == {02}):\n * a(x)    = {03}x^3 + {01}x^2 + {01}x + {02}\n * a^-1(x) = {0b}x^3 + {0d}x^2 + {09}x + {0e}.\n *\n * These polynomials are used in the MixColumns() and InverseMixColumns()\n * operations, respectively, to cause each element in the state to affect\n * the output (referred to as diffusing).\n *\n * RotWord() uses: a0 = a1 = a2 = {00} and a3 = {01}, which is the\n * polynomial x3.\n *\n * The ShiftRows() method modifies the last 3 rows in the state (where\n * the state is 4 words with 4 bytes per word) by shifting bytes cyclically.\n * The 1st byte in the second row is moved to the end of the row. The 1st\n * and 2nd bytes in the third row are moved to the end of the row. The 1st,\n * 2nd, and 3rd bytes are moved in the fourth row.\n *\n * More details on how AES arithmetic works:\n *\n * In the polynomial representation of binary numbers, XOR performs addition\n * and subtraction and multiplication in GF(2^8) denoted as GF(a, b)\n * corresponds with the multiplication of polynomials modulo an irreducible\n * polynomial of degree 8. In other words, for AES, GF(a, b) will multiply\n * polynomial 'a' with polynomial 'b' and then do a modular reduction by\n * an AES-specific irreducible polynomial of degree 8.\n *\n * A polynomial is irreducible if its only divisors are one and itself. For\n * the AES algorithm, this irreducible polynomial is:\n *\n * m(x) = x^8 + x^4 + x^3 + x + 1,\n *\n * or {01}{1b} in hexadecimal notation, where each coefficient is a bit:\n * 100011011 = 283 = 0x11b.\n *\n * For example, GF(0x57, 0x83) = 0xc1 because\n *\n * 0x57 = 87  = 01010111 = x^6 + x^4 + x^2 + x + 1\n * 0x85 = 131 = 10000101 = x^7 + x + 1\n *\n * (x^6 + x^4 + x^2 + x + 1) * (x^7 + x + 1)\n * =  x^13 + x^11 + x^9 + x^8 + x^7 +\n *    x^7 + x^5 + x^3 + x^2 + x +\n *    x^6 + x^4 + x^2 + x + 1\n * =  x^13 + x^11 + x^9 + x^8 + x^6 + x^5 + x^4 + x^3 + 1 = y\n *    y modulo (x^8 + x^4 + x^3 + x + 1)\n * =  x^7 + x^6 + 1.\n *\n * The modular reduction by m(x) guarantees the result will be a binary\n * polynomial of less than degree 8, so that it can fit in a byte.\n *\n * The operation to multiply a binary polynomial b with x (the polynomial\n * x in binary representation is 00000010) is:\n *\n * b_7x^8 + b_6x^7 + b_5x^6 + b_4x^5 + b_3x^4 + b_2x^3 + b_1x^2 + b_0x^1\n *\n * To get GF(b, x) we must reduce that by m(x). If b_7 is 0 (that is the\n * most significant bit is 0 in b) then the result is already reduced. If\n * it is 1, then we can reduce it by subtracting m(x) via an XOR.\n *\n * It follows that multiplication by x (00000010 or 0x02) can be implemented\n * by performing a left shift followed by a conditional bitwise XOR with\n * 0x1b. This operation on bytes is denoted by xtime(). Multiplication by\n * higher powers of x can be implemented by repeated application of xtime().\n *\n * By adding intermediate results, multiplication by any constant can be\n * implemented. For instance:\n *\n * GF(0x57, 0x13) = 0xfe because:\n *\n * xtime(b) = (b & 128) ? (b << 1 ^ 0x11b) : (b << 1)\n *\n * Note: We XOR with 0x11b instead of 0x1b because in javascript our\n * datatype for b can be larger than 1 byte, so a left shift will not\n * automatically eliminate bits that overflow a byte ... by XOR'ing the\n * overflow bit with 1 (the extra one from 0x11b) we zero it out.\n *\n * GF(0x57, 0x02) = xtime(0x57) = 0xae\n * GF(0x57, 0x04) = xtime(0xae) = 0x47\n * GF(0x57, 0x08) = xtime(0x47) = 0x8e\n * GF(0x57, 0x10) = xtime(0x8e) = 0x07\n *\n * GF(0x57, 0x13) = GF(0x57, (0x01 ^ 0x02 ^ 0x10))\n *\n * And by the distributive property (since XOR is addition and GF() is\n * multiplication):\n *\n * = GF(0x57, 0x01) ^ GF(0x57, 0x02) ^ GF(0x57, 0x10)\n * = 0x57 ^ 0xae ^ 0x07\n * = 0xfe.\n */\nfunction initialize() {\n  init = true;\n\n  /* Populate the Rcon table. These are the values given by\n    [x^(i-1),{00},{00},{00}] where x^(i-1) are powers of x (and x = 0x02)\n    in the field of GF(2^8), where i starts at 1.\n\n    rcon[0] = [0x00, 0x00, 0x00, 0x00]\n    rcon[1] = [0x01, 0x00, 0x00, 0x00] 2^(1-1) = 2^0 = 1\n    rcon[2] = [0x02, 0x00, 0x00, 0x00] 2^(2-1) = 2^1 = 2\n    ...\n    rcon[9]  = [0x1B, 0x00, 0x00, 0x00] 2^(9-1)  = 2^8 = 0x1B\n    rcon[10] = [0x36, 0x00, 0x00, 0x00] 2^(10-1) = 2^9 = 0x36\n\n    We only store the first byte because it is the only one used.\n  */\n  rcon = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1B, 0x36];\n\n  // compute xtime table which maps i onto GF(i, 0x02)\n  var xtime = new Array(256);\n  for(var i = 0; i < 128; ++i) {\n    xtime[i] = i << 1;\n    xtime[i + 128] = (i + 128) << 1 ^ 0x11B;\n  }\n\n  // compute all other tables\n  sbox = new Array(256);\n  isbox = new Array(256);\n  mix = new Array(4);\n  imix = new Array(4);\n  for(var i = 0; i < 4; ++i) {\n    mix[i] = new Array(256);\n    imix[i] = new Array(256);\n  }\n  var e = 0, ei = 0, e2, e4, e8, sx, sx2, me, ime;\n  for(var i = 0; i < 256; ++i) {\n    /* We need to generate the SubBytes() sbox and isbox tables so that\n      we can perform byte substitutions. This requires us to traverse\n      all of the elements in GF, find their multiplicative inverses,\n      and apply to each the following affine transformation:\n\n      bi' = bi ^ b(i + 4) mod 8 ^ b(i + 5) mod 8 ^ b(i + 6) mod 8 ^\n            b(i + 7) mod 8 ^ ci\n      for 0 <= i < 8, where bi is the ith bit of the byte, and ci is the\n      ith bit of a byte c with the value {63} or {01100011}.\n\n      It is possible to traverse every possible value in a Galois field\n      using what is referred to as a 'generator'. There are many\n      generators (128 out of 256): 3,5,6,9,11,82 to name a few. To fully\n      traverse GF we iterate 255 times, multiplying by our generator\n      each time.\n\n      On each iteration we can determine the multiplicative inverse for\n      the current element.\n\n      Suppose there is an element in GF 'e'. For a given generator 'g',\n      e = g^x. The multiplicative inverse of e is g^(255 - x). It turns\n      out that if use the inverse of a generator as another generator\n      it will produce all of the corresponding multiplicative inverses\n      at the same time. For this reason, we choose 5 as our inverse\n      generator because it only requires 2 multiplies and 1 add and its\n      inverse, 82, requires relatively few operations as well.\n\n      In order to apply the affine transformation, the multiplicative\n      inverse 'ei' of 'e' can be repeatedly XOR'd (4 times) with a\n      bit-cycling of 'ei'. To do this 'ei' is first stored in 's' and\n      'x'. Then 's' is left shifted and the high bit of 's' is made the\n      low bit. The resulting value is stored in 's'. Then 'x' is XOR'd\n      with 's' and stored in 'x'. On each subsequent iteration the same\n      operation is performed. When 4 iterations are complete, 'x' is\n      XOR'd with 'c' (0x63) and the transformed value is stored in 'x'.\n      For example:\n\n      s = 01000001\n      x = 01000001\n\n      iteration 1: s = 10000010, x ^= s\n      iteration 2: s = 00000101, x ^= s\n      iteration 3: s = 00001010, x ^= s\n      iteration 4: s = 00010100, x ^= s\n      x ^= 0x63\n\n      This can be done with a loop where s = (s << 1) | (s >> 7). However,\n      it can also be done by using a single 16-bit (in this case 32-bit)\n      number 'sx'. Since XOR is an associative operation, we can set 'sx'\n      to 'ei' and then XOR it with 'sx' left-shifted 1,2,3, and 4 times.\n      The most significant bits will flow into the high 8 bit positions\n      and be correctly XOR'd with one another. All that remains will be\n      to cycle the high 8 bits by XOR'ing them all with the lower 8 bits\n      afterwards.\n\n      At the same time we're populating sbox and isbox we can precompute\n      the multiplication we'll need to do to do MixColumns() later.\n    */\n\n    // apply affine transformation\n    sx = ei ^ (ei << 1) ^ (ei << 2) ^ (ei << 3) ^ (ei << 4);\n    sx = (sx >> 8) ^ (sx & 255) ^ 0x63;\n\n    // update tables\n    sbox[e] = sx;\n    isbox[sx] = e;\n\n    /* Mixing columns is done using matrix multiplication. The columns\n      that are to be mixed are each a single word in the current state.\n      The state has Nb columns (4 columns). Therefore each column is a\n      4 byte word. So to mix the columns in a single column 'c' where\n      its rows are r0, r1, r2, and r3, we use the following matrix\n      multiplication:\n\n      [2 3 1 1]*[r0,c]=[r'0,c]\n      [1 2 3 1] [r1,c] [r'1,c]\n      [1 1 2 3] [r2,c] [r'2,c]\n      [3 1 1 2] [r3,c] [r'3,c]\n\n      r0, r1, r2, and r3 are each 1 byte of one of the words in the\n      state (a column). To do matrix multiplication for each mixed\n      column c' we multiply the corresponding row from the left matrix\n      with the corresponding column from the right matrix. In total, we\n      get 4 equations:\n\n      r0,c' = 2*r0,c + 3*r1,c + 1*r2,c + 1*r3,c\n      r1,c' = 1*r0,c + 2*r1,c + 3*r2,c + 1*r3,c\n      r2,c' = 1*r0,c + 1*r1,c + 2*r2,c + 3*r3,c\n      r3,c' = 3*r0,c + 1*r1,c + 1*r2,c + 2*r3,c\n\n      As usual, the multiplication is as previously defined and the\n      addition is XOR. In order to optimize mixing columns we can store\n      the multiplication results in tables. If you think of the whole\n      column as a word (it might help to visualize by mentally rotating\n      the equations above by counterclockwise 90 degrees) then you can\n      see that it would be useful to map the multiplications performed on\n      each byte (r0, r1, r2, r3) onto a word as well. For instance, we\n      could map 2*r0,1*r0,1*r0,3*r0 onto a word by storing 2*r0 in the\n      highest 8 bits and 3*r0 in the lowest 8 bits (with the other two\n      respectively in the middle). This means that a table can be\n      constructed that uses r0 as an index to the word. We can do the\n      same with r1, r2, and r3, creating a total of 4 tables.\n\n      To construct a full c', we can just look up each byte of c in\n      their respective tables and XOR the results together.\n\n      Also, to build each table we only have to calculate the word\n      for 2,1,1,3 for every byte ... which we can do on each iteration\n      of this loop since we will iterate over every byte. After we have\n      calculated 2,1,1,3 we can get the results for the other tables\n      by cycling the byte at the end to the beginning. For instance\n      we can take the result of table 2,1,1,3 and produce table 3,2,1,1\n      by moving the right most byte to the left most position just like\n      how you can imagine the 3 moved out of 2,1,1,3 and to the front\n      to produce 3,2,1,1.\n\n      There is another optimization in that the same multiples of\n      the current element we need in order to advance our generator\n      to the next iteration can be reused in performing the 2,1,1,3\n      calculation. We also calculate the inverse mix column tables,\n      with e,9,d,b being the inverse of 2,1,1,3.\n\n      When we're done, and we need to actually mix columns, the first\n      byte of each state word should be put through mix[0] (2,1,1,3),\n      the second through mix[1] (3,2,1,1) and so forth. Then they should\n      be XOR'd together to produce the fully mixed column.\n    */\n\n    // calculate mix and imix table values\n    sx2 = xtime[sx];\n    e2 = xtime[e];\n    e4 = xtime[e2];\n    e8 = xtime[e4];\n    me =\n      (sx2 << 24) ^  // 2\n      (sx << 16) ^   // 1\n      (sx << 8) ^    // 1\n      (sx ^ sx2);    // 3\n    ime =\n      (e2 ^ e4 ^ e8) << 24 ^  // E (14)\n      (e ^ e8) << 16 ^        // 9\n      (e ^ e4 ^ e8) << 8 ^    // D (13)\n      (e ^ e2 ^ e8);          // B (11)\n    // produce each of the mix tables by rotating the 2,1,1,3 value\n    for(var n = 0; n < 4; ++n) {\n      mix[n][e] = me;\n      imix[n][sx] = ime;\n      // cycle the right most byte to the left most position\n      // ie: 2,1,1,3 becomes 3,2,1,1\n      me = me << 24 | me >>> 8;\n      ime = ime << 24 | ime >>> 8;\n    }\n\n    // get next element and inverse\n    if(e === 0) {\n      // 1 is the inverse of 1\n      e = ei = 1;\n    } else {\n      // e = 2e + 2*2*2*(10e)) = multiply e by 82 (chosen generator)\n      // ei = ei + 2*2*ei = multiply ei by 5 (inverse generator)\n      e = e2 ^ xtime[xtime[xtime[e2 ^ e8]]];\n      ei ^= xtime[xtime[ei]];\n    }\n  }\n}\n\n/**\n * Generates a key schedule using the AES key expansion algorithm.\n *\n * The AES algorithm takes the Cipher Key, K, and performs a Key Expansion\n * routine to generate a key schedule. The Key Expansion generates a total\n * of Nb*(Nr + 1) words: the algorithm requires an initial set of Nb words,\n * and each of the Nr rounds requires Nb words of key data. The resulting\n * key schedule consists of a linear array of 4-byte words, denoted [wi ],\n * with i in the range 0 <= i < Nb(Nr + 1).\n *\n * KeyExpansion(byte key[4*Nk], word w[Nb*(Nr+1)], Nk)\n * AES-128 (Nb=4, Nk=4, Nr=10)\n * AES-192 (Nb=4, Nk=6, Nr=12)\n * AES-256 (Nb=4, Nk=8, Nr=14)\n * Note: Nr=Nk+6.\n *\n * Nb is the number of columns (32-bit words) comprising the State (or\n * number of bytes in a block). For AES, Nb=4.\n *\n * @param key the key to schedule (as an array of 32-bit words).\n * @param decrypt true to modify the key schedule to decrypt, false not to.\n *\n * @return the generated key schedule.\n */\nfunction _expandKey(key, decrypt) {\n  // copy the key's words to initialize the key schedule\n  var w = key.slice(0);\n\n  /* RotWord() will rotate a word, moving the first byte to the last\n    byte's position (shifting the other bytes left).\n\n    We will be getting the value of Rcon at i / Nk. 'i' will iterate\n    from Nk to (Nb * Nr+1). Nk = 4 (4 byte key), Nb = 4 (4 words in\n    a block), Nr = Nk + 6 (10). Therefore 'i' will iterate from\n    4 to 44 (exclusive). Each time we iterate 4 times, i / Nk will\n    increase by 1. We use a counter iNk to keep track of this.\n   */\n\n  // go through the rounds expanding the key\n  var temp, iNk = 1;\n  var Nk = w.length;\n  var Nr1 = Nk + 6 + 1;\n  var end = Nb * Nr1;\n  for(var i = Nk; i < end; ++i) {\n    temp = w[i - 1];\n    if(i % Nk === 0) {\n      // temp = SubWord(RotWord(temp)) ^ Rcon[i / Nk]\n      temp =\n        sbox[temp >>> 16 & 255] << 24 ^\n        sbox[temp >>> 8 & 255] << 16 ^\n        sbox[temp & 255] << 8 ^\n        sbox[temp >>> 24] ^ (rcon[iNk] << 24);\n      iNk++;\n    } else if(Nk > 6 && (i % Nk === 4)) {\n      // temp = SubWord(temp)\n      temp =\n        sbox[temp >>> 24] << 24 ^\n        sbox[temp >>> 16 & 255] << 16 ^\n        sbox[temp >>> 8 & 255] << 8 ^\n        sbox[temp & 255];\n    }\n    w[i] = w[i - Nk] ^ temp;\n  }\n\n  /* When we are updating a cipher block we always use the code path for\n     encryption whether we are decrypting or not (to shorten code and\n     simplify the generation of look up tables). However, because there\n     are differences in the decryption algorithm, other than just swapping\n     in different look up tables, we must transform our key schedule to\n     account for these changes:\n\n     1. The decryption algorithm gets its key rounds in reverse order.\n     2. The decryption algorithm adds the round key before mixing columns\n       instead of afterwards.\n\n     We don't need to modify our key schedule to handle the first case,\n     we can just traverse the key schedule in reverse order when decrypting.\n\n     The second case requires a little work.\n\n     The tables we built for performing rounds will take an input and then\n     perform SubBytes() and MixColumns() or, for the decrypt version,\n     InvSubBytes() and InvMixColumns(). But the decrypt algorithm requires\n     us to AddRoundKey() before InvMixColumns(). This means we'll need to\n     apply some transformations to the round key to inverse-mix its columns\n     so they'll be correct for moving AddRoundKey() to after the state has\n     had its columns inverse-mixed.\n\n     To inverse-mix the columns of the state when we're decrypting we use a\n     lookup table that will apply InvSubBytes() and InvMixColumns() at the\n     same time. However, the round key's bytes are not inverse-substituted\n     in the decryption algorithm. To get around this problem, we can first\n     substitute the bytes in the round key so that when we apply the\n     transformation via the InvSubBytes()+InvMixColumns() table, it will\n     undo our substitution leaving us with the original value that we\n     want -- and then inverse-mix that value.\n\n     This change will correctly alter our key schedule so that we can XOR\n     each round key with our already transformed decryption state. This\n     allows us to use the same code path as the encryption algorithm.\n\n     We make one more change to the decryption key. Since the decryption\n     algorithm runs in reverse from the encryption algorithm, we reverse\n     the order of the round keys to avoid having to iterate over the key\n     schedule backwards when running the encryption algorithm later in\n     decryption mode. In addition to reversing the order of the round keys,\n     we also swap each round key's 2nd and 4th rows. See the comments\n     section where rounds are performed for more details about why this is\n     done. These changes are done inline with the other substitution\n     described above.\n  */\n  if(decrypt) {\n    var tmp;\n    var m0 = imix[0];\n    var m1 = imix[1];\n    var m2 = imix[2];\n    var m3 = imix[3];\n    var wnew = w.slice(0);\n    end = w.length;\n    for(var i = 0, wi = end - Nb; i < end; i += Nb, wi -= Nb) {\n      // do not sub the first or last round key (round keys are Nb\n      // words) as no column mixing is performed before they are added,\n      // but do change the key order\n      if(i === 0 || i === (end - Nb)) {\n        wnew[i] = w[wi];\n        wnew[i + 1] = w[wi + 3];\n        wnew[i + 2] = w[wi + 2];\n        wnew[i + 3] = w[wi + 1];\n      } else {\n        // substitute each round key byte because the inverse-mix\n        // table will inverse-substitute it (effectively cancel the\n        // substitution because round key bytes aren't sub'd in\n        // decryption mode) and swap indexes 3 and 1\n        for(var n = 0; n < Nb; ++n) {\n          tmp = w[wi + n];\n          wnew[i + (3&-n)] =\n            m0[sbox[tmp >>> 24]] ^\n            m1[sbox[tmp >>> 16 & 255]] ^\n            m2[sbox[tmp >>> 8 & 255]] ^\n            m3[sbox[tmp & 255]];\n        }\n      }\n    }\n    w = wnew;\n  }\n\n  return w;\n}\n\n/**\n * Updates a single block (16 bytes) using AES. The update will either\n * encrypt or decrypt the block.\n *\n * @param w the key schedule.\n * @param input the input block (an array of 32-bit words).\n * @param output the updated output block.\n * @param decrypt true to decrypt the block, false to encrypt it.\n */\nfunction _updateBlock(w, input, output, decrypt) {\n  /*\n  Cipher(byte in[4*Nb], byte out[4*Nb], word w[Nb*(Nr+1)])\n  begin\n    byte state[4,Nb]\n    state = in\n    AddRoundKey(state, w[0, Nb-1])\n    for round = 1 step 1 to Nr-1\n      SubBytes(state)\n      ShiftRows(state)\n      MixColumns(state)\n      AddRoundKey(state, w[round*Nb, (round+1)*Nb-1])\n    end for\n    SubBytes(state)\n    ShiftRows(state)\n    AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])\n    out = state\n  end\n\n  InvCipher(byte in[4*Nb], byte out[4*Nb], word w[Nb*(Nr+1)])\n  begin\n    byte state[4,Nb]\n    state = in\n    AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])\n    for round = Nr-1 step -1 downto 1\n      InvShiftRows(state)\n      InvSubBytes(state)\n      AddRoundKey(state, w[round*Nb, (round+1)*Nb-1])\n      InvMixColumns(state)\n    end for\n    InvShiftRows(state)\n    InvSubBytes(state)\n    AddRoundKey(state, w[0, Nb-1])\n    out = state\n  end\n  */\n\n  // Encrypt: AddRoundKey(state, w[0, Nb-1])\n  // Decrypt: AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])\n  var Nr = w.length / 4 - 1;\n  var m0, m1, m2, m3, sub;\n  if(decrypt) {\n    m0 = imix[0];\n    m1 = imix[1];\n    m2 = imix[2];\n    m3 = imix[3];\n    sub = isbox;\n  } else {\n    m0 = mix[0];\n    m1 = mix[1];\n    m2 = mix[2];\n    m3 = mix[3];\n    sub = sbox;\n  }\n  var a, b, c, d, a2, b2, c2;\n  a = input[0] ^ w[0];\n  b = input[decrypt ? 3 : 1] ^ w[1];\n  c = input[2] ^ w[2];\n  d = input[decrypt ? 1 : 3] ^ w[3];\n  var i = 3;\n\n  /* In order to share code we follow the encryption algorithm when both\n    encrypting and decrypting. To account for the changes required in the\n    decryption algorithm, we use different lookup tables when decrypting\n    and use a modified key schedule to account for the difference in the\n    order of transformations applied when performing rounds. We also get\n    key rounds in reverse order (relative to encryption). */\n  for(var round = 1; round < Nr; ++round) {\n    /* As described above, we'll be using table lookups to perform the\n      column mixing. Each column is stored as a word in the state (the\n      array 'input' has one column as a word at each index). In order to\n      mix a column, we perform these transformations on each row in c,\n      which is 1 byte in each word. The new column for c0 is c'0:\n\n               m0      m1      m2      m3\n      r0,c'0 = 2*r0,c0 + 3*r1,c0 + 1*r2,c0 + 1*r3,c0\n      r1,c'0 = 1*r0,c0 + 2*r1,c0 + 3*r2,c0 + 1*r3,c0\n      r2,c'0 = 1*r0,c0 + 1*r1,c0 + 2*r2,c0 + 3*r3,c0\n      r3,c'0 = 3*r0,c0 + 1*r1,c0 + 1*r2,c0 + 2*r3,c0\n\n      So using mix tables where c0 is a word with r0 being its upper\n      8 bits and r3 being its lower 8 bits:\n\n      m0[c0 >> 24] will yield this word: [2*r0,1*r0,1*r0,3*r0]\n      ...\n      m3[c0 & 255] will yield this word: [1*r3,1*r3,3*r3,2*r3]\n\n      Therefore to mix the columns in each word in the state we\n      do the following (& 255 omitted for brevity):\n      c'0,r0 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]\n      c'0,r1 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]\n      c'0,r2 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]\n      c'0,r3 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3]\n\n      However, before mixing, the algorithm requires us to perform\n      ShiftRows(). The ShiftRows() transformation cyclically shifts the\n      last 3 rows of the state over different offsets. The first row\n      (r = 0) is not shifted.\n\n      s'_r,c = s_r,(c + shift(r, Nb) mod Nb\n      for 0 < r < 4 and 0 <= c < Nb and\n      shift(1, 4) = 1\n      shift(2, 4) = 2\n      shift(3, 4) = 3.\n\n      This causes the first byte in r = 1 to be moved to the end of\n      the row, the first 2 bytes in r = 2 to be moved to the end of\n      the row, the first 3 bytes in r = 3 to be moved to the end of\n      the row:\n\n      r1: [c0 c1 c2 c3] => [c1 c2 c3 c0]\n      r2: [c0 c1 c2 c3]    [c2 c3 c0 c1]\n      r3: [c0 c1 c2 c3]    [c3 c0 c1 c2]\n\n      We can make these substitutions inline with our column mixing to\n      generate an updated set of equations to produce each word in the\n      state (note the columns have changed positions):\n\n      c0 c1 c2 c3 => c0 c1 c2 c3\n      c0 c1 c2 c3    c1 c2 c3 c0  (cycled 1 byte)\n      c0 c1 c2 c3    c2 c3 c0 c1  (cycled 2 bytes)\n      c0 c1 c2 c3    c3 c0 c1 c2  (cycled 3 bytes)\n\n      Therefore:\n\n      c'0 = 2*r0,c0 + 3*r1,c1 + 1*r2,c2 + 1*r3,c3\n      c'0 = 1*r0,c0 + 2*r1,c1 + 3*r2,c2 + 1*r3,c3\n      c'0 = 1*r0,c0 + 1*r1,c1 + 2*r2,c2 + 3*r3,c3\n      c'0 = 3*r0,c0 + 1*r1,c1 + 1*r2,c2 + 2*r3,c3\n\n      c'1 = 2*r0,c1 + 3*r1,c2 + 1*r2,c3 + 1*r3,c0\n      c'1 = 1*r0,c1 + 2*r1,c2 + 3*r2,c3 + 1*r3,c0\n      c'1 = 1*r0,c1 + 1*r1,c2 + 2*r2,c3 + 3*r3,c0\n      c'1 = 3*r0,c1 + 1*r1,c2 + 1*r2,c3 + 2*r3,c0\n\n      ... and so forth for c'2 and c'3. The important distinction is\n      that the columns are cycling, with c0 being used with the m0\n      map when calculating c0, but c1 being used with the m0 map when\n      calculating c1 ... and so forth.\n\n      When performing the inverse we transform the mirror image and\n      skip the bottom row, instead of the top one, and move upwards:\n\n      c3 c2 c1 c0 => c0 c3 c2 c1  (cycled 3 bytes) *same as encryption\n      c3 c2 c1 c0    c1 c0 c3 c2  (cycled 2 bytes)\n      c3 c2 c1 c0    c2 c1 c0 c3  (cycled 1 byte)  *same as encryption\n      c3 c2 c1 c0    c3 c2 c1 c0\n\n      If you compare the resulting matrices for ShiftRows()+MixColumns()\n      and for InvShiftRows()+InvMixColumns() the 2nd and 4th columns are\n      different (in encrypt mode vs. decrypt mode). So in order to use\n      the same code to handle both encryption and decryption, we will\n      need to do some mapping.\n\n      If in encryption mode we let a=c0, b=c1, c=c2, d=c3, and r<N> be\n      a row number in the state, then the resulting matrix in encryption\n      mode for applying the above transformations would be:\n\n      r1: a b c d\n      r2: b c d a\n      r3: c d a b\n      r4: d a b c\n\n      If we did the same in decryption mode we would get:\n\n      r1: a d c b\n      r2: b a d c\n      r3: c b a d\n      r4: d c b a\n\n      If instead we swap d and b (set b=c3 and d=c1), then we get:\n\n      r1: a b c d\n      r2: d a b c\n      r3: c d a b\n      r4: b c d a\n\n      Now the 1st and 3rd rows are the same as the encryption matrix. All\n      we need to do then to make the mapping exactly the same is to swap\n      the 2nd and 4th rows when in decryption mode. To do this without\n      having to do it on each iteration, we swapped the 2nd and 4th rows\n      in the decryption key schedule. We also have to do the swap above\n      when we first pull in the input and when we set the final output. */\n    a2 =\n      m0[a >>> 24] ^\n      m1[b >>> 16 & 255] ^\n      m2[c >>> 8 & 255] ^\n      m3[d & 255] ^ w[++i];\n    b2 =\n      m0[b >>> 24] ^\n      m1[c >>> 16 & 255] ^\n      m2[d >>> 8 & 255] ^\n      m3[a & 255] ^ w[++i];\n    c2 =\n      m0[c >>> 24] ^\n      m1[d >>> 16 & 255] ^\n      m2[a >>> 8 & 255] ^\n      m3[b & 255] ^ w[++i];\n    d =\n      m0[d >>> 24] ^\n      m1[a >>> 16 & 255] ^\n      m2[b >>> 8 & 255] ^\n      m3[c & 255] ^ w[++i];\n    a = a2;\n    b = b2;\n    c = c2;\n  }\n\n  /*\n    Encrypt:\n    SubBytes(state)\n    ShiftRows(state)\n    AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1])\n\n    Decrypt:\n    InvShiftRows(state)\n    InvSubBytes(state)\n    AddRoundKey(state, w[0, Nb-1])\n   */\n  // Note: rows are shifted inline\n  output[0] =\n    (sub[a >>> 24] << 24) ^\n    (sub[b >>> 16 & 255] << 16) ^\n    (sub[c >>> 8 & 255] << 8) ^\n    (sub[d & 255]) ^ w[++i];\n  output[decrypt ? 3 : 1] =\n    (sub[b >>> 24] << 24) ^\n    (sub[c >>> 16 & 255] << 16) ^\n    (sub[d >>> 8 & 255] << 8) ^\n    (sub[a & 255]) ^ w[++i];\n  output[2] =\n    (sub[c >>> 24] << 24) ^\n    (sub[d >>> 16 & 255] << 16) ^\n    (sub[a >>> 8 & 255] << 8) ^\n    (sub[b & 255]) ^ w[++i];\n  output[decrypt ? 1 : 3] =\n    (sub[d >>> 24] << 24) ^\n    (sub[a >>> 16 & 255] << 16) ^\n    (sub[b >>> 8 & 255] << 8) ^\n    (sub[c & 255]) ^ w[++i];\n}\n\n/**\n * Deprecated. Instead, use:\n *\n * forge.cipher.createCipher('AES-<mode>', key);\n * forge.cipher.createDecipher('AES-<mode>', key);\n *\n * Creates a deprecated AES cipher object. This object's mode will default to\n * CBC (cipher-block-chaining).\n *\n * The key and iv may be given as a string of bytes, an array of bytes, a\n * byte buffer, or an array of 32-bit words.\n *\n * @param options the options to use.\n *          key the symmetric key to use.\n *          output the buffer to write to.\n *          decrypt true for decryption, false for encryption.\n *          mode the cipher mode to use (default: 'CBC').\n *\n * @return the cipher.\n */\nfunction _createCipher(options) {\n  options = options || {};\n  var mode = (options.mode || 'CBC').toUpperCase();\n  var algorithm = 'AES-' + mode;\n\n  var cipher;\n  if(options.decrypt) {\n    cipher = forge.cipher.createDecipher(algorithm, options.key);\n  } else {\n    cipher = forge.cipher.createCipher(algorithm, options.key);\n  }\n\n  // backwards compatible start API\n  var start = cipher.start;\n  cipher.start = function(iv, options) {\n    // backwards compatibility: support second arg as output buffer\n    var output = null;\n    if(options instanceof forge.util.ByteBuffer) {\n      output = options;\n      options = {};\n    }\n    options = options || {};\n    options.output = output;\n    options.iv = iv;\n    start.call(cipher, options);\n  };\n\n  return cipher;\n}\n","/**\n * Cipher base API.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\n\nmodule.exports = forge.cipher = forge.cipher || {};\n\n// registered algorithms\nforge.cipher.algorithms = forge.cipher.algorithms || {};\n\n/**\n * Creates a cipher object that can be used to encrypt data using the given\n * algorithm and key. The algorithm may be provided as a string value for a\n * previously registered algorithm or it may be given as a cipher algorithm\n * API object.\n *\n * @param algorithm the algorithm to use, either a string or an algorithm API\n *          object.\n * @param key the key to use, as a binary-encoded string of bytes or a\n *          byte buffer.\n *\n * @return the cipher.\n */\nforge.cipher.createCipher = function(algorithm, key) {\n  var api = algorithm;\n  if(typeof api === 'string') {\n    api = forge.cipher.getAlgorithm(api);\n    if(api) {\n      api = api();\n    }\n  }\n  if(!api) {\n    throw new Error('Unsupported algorithm: ' + algorithm);\n  }\n\n  // assume block cipher\n  return new forge.cipher.BlockCipher({\n    algorithm: api,\n    key: key,\n    decrypt: false\n  });\n};\n\n/**\n * Creates a decipher object that can be used to decrypt data using the given\n * algorithm and key. The algorithm may be provided as a string value for a\n * previously registered algorithm or it may be given as a cipher algorithm\n * API object.\n *\n * @param algorithm the algorithm to use, either a string or an algorithm API\n *          object.\n * @param key the key to use, as a binary-encoded string of bytes or a\n *          byte buffer.\n *\n * @return the cipher.\n */\nforge.cipher.createDecipher = function(algorithm, key) {\n  var api = algorithm;\n  if(typeof api === 'string') {\n    api = forge.cipher.getAlgorithm(api);\n    if(api) {\n      api = api();\n    }\n  }\n  if(!api) {\n    throw new Error('Unsupported algorithm: ' + algorithm);\n  }\n\n  // assume block cipher\n  return new forge.cipher.BlockCipher({\n    algorithm: api,\n    key: key,\n    decrypt: true\n  });\n};\n\n/**\n * Registers an algorithm by name. If the name was already registered, the\n * algorithm API object will be overwritten.\n *\n * @param name the name of the algorithm.\n * @param algorithm the algorithm API object.\n */\nforge.cipher.registerAlgorithm = function(name, algorithm) {\n  name = name.toUpperCase();\n  forge.cipher.algorithms[name] = algorithm;\n};\n\n/**\n * Gets a registered algorithm by name.\n *\n * @param name the name of the algorithm.\n *\n * @return the algorithm, if found, null if not.\n */\nforge.cipher.getAlgorithm = function(name) {\n  name = name.toUpperCase();\n  if(name in forge.cipher.algorithms) {\n    return forge.cipher.algorithms[name];\n  }\n  return null;\n};\n\nvar BlockCipher = forge.cipher.BlockCipher = function(options) {\n  this.algorithm = options.algorithm;\n  this.mode = this.algorithm.mode;\n  this.blockSize = this.mode.blockSize;\n  this._finish = false;\n  this._input = null;\n  this.output = null;\n  this._op = options.decrypt ? this.mode.decrypt : this.mode.encrypt;\n  this._decrypt = options.decrypt;\n  this.algorithm.initialize(options);\n};\n\n/**\n * Starts or restarts the encryption or decryption process, whichever\n * was previously configured.\n *\n * For non-GCM mode, the IV may be a binary-encoded string of bytes, an array\n * of bytes, a byte buffer, or an array of 32-bit integers. If the IV is in\n * bytes, then it must be Nb (16) bytes in length. If the IV is given in as\n * 32-bit integers, then it must be 4 integers long.\n *\n * Note: an IV is not required or used in ECB mode.\n *\n * For GCM-mode, the IV must be given as a binary-encoded string of bytes or\n * a byte buffer. The number of bytes should be 12 (96 bits) as recommended\n * by NIST SP-800-38D but another length may be given.\n *\n * @param options the options to use:\n *          iv the initialization vector to use as a binary-encoded string of\n *            bytes, null to reuse the last ciphered block from a previous\n *            update() (this \"residue\" method is for legacy support only).\n *          additionalData additional authentication data as a binary-encoded\n *            string of bytes, for 'GCM' mode, (default: none).\n *          tagLength desired length of authentication tag, in bits, for\n *            'GCM' mode (0-128, default: 128).\n *          tag the authentication tag to check if decrypting, as a\n *             binary-encoded string of bytes.\n *          output the output the buffer to write to, null to create one.\n */\nBlockCipher.prototype.start = function(options) {\n  options = options || {};\n  var opts = {};\n  for(var key in options) {\n    opts[key] = options[key];\n  }\n  opts.decrypt = this._decrypt;\n  this._finish = false;\n  this._input = forge.util.createBuffer();\n  this.output = options.output || forge.util.createBuffer();\n  this.mode.start(opts);\n};\n\n/**\n * Updates the next block according to the cipher mode.\n *\n * @param input the buffer to read from.\n */\nBlockCipher.prototype.update = function(input) {\n  if(input) {\n    // input given, so empty it into the input buffer\n    this._input.putBuffer(input);\n  }\n\n  // do cipher operation until it needs more input and not finished\n  while(!this._op.call(this.mode, this._input, this.output, this._finish) &&\n    !this._finish) {}\n\n  // free consumed memory from input buffer\n  this._input.compact();\n};\n\n/**\n * Finishes encrypting or decrypting.\n *\n * @param pad a padding function to use in CBC mode, null for default,\n *          signature(blockSize, buffer, decrypt).\n *\n * @return true if successful, false on error.\n */\nBlockCipher.prototype.finish = function(pad) {\n  // backwards-compatibility w/deprecated padding API\n  // Note: will overwrite padding functions even after another start() call\n  if(pad && (this.mode.name === 'ECB' || this.mode.name === 'CBC')) {\n    this.mode.pad = function(input) {\n      return pad(this.blockSize, input, false);\n    };\n    this.mode.unpad = function(output) {\n      return pad(this.blockSize, output, true);\n    };\n  }\n\n  // build options for padding and afterFinish functions\n  var options = {};\n  options.decrypt = this._decrypt;\n\n  // get # of bytes that won't fill a block\n  options.overflow = this._input.length() % this.blockSize;\n\n  if(!this._decrypt && this.mode.pad) {\n    if(!this.mode.pad(this._input, options)) {\n      return false;\n    }\n  }\n\n  // do final update\n  this._finish = true;\n  this.update();\n\n  if(this._decrypt && this.mode.unpad) {\n    if(!this.mode.unpad(this.output, options)) {\n      return false;\n    }\n  }\n\n  if(this.mode.afterFinish) {\n    if(!this.mode.afterFinish(this.output, options)) {\n      return false;\n    }\n  }\n\n  return true;\n};\n","/**\n * Supported cipher modes.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\n\nforge.cipher = forge.cipher || {};\n\n// supported cipher modes\nvar modes = module.exports = forge.cipher.modes = forge.cipher.modes || {};\n\n/** Electronic codebook (ECB) (Don't use this; it's not secure) **/\n\nmodes.ecb = function(options) {\n  options = options || {};\n  this.name = 'ECB';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = new Array(this._ints);\n  this._outBlock = new Array(this._ints);\n};\n\nmodes.ecb.prototype.start = function(options) {};\n\nmodes.ecb.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n    return true;\n  }\n\n  // get next block\n  for(var i = 0; i < this._ints; ++i) {\n    this._inBlock[i] = input.getInt32();\n  }\n\n  // encrypt block\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // write output\n  for(var i = 0; i < this._ints; ++i) {\n    output.putInt32(this._outBlock[i]);\n  }\n};\n\nmodes.ecb.prototype.decrypt = function(input, output, finish) {\n  // not enough input to decrypt\n  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n    return true;\n  }\n\n  // get next block\n  for(var i = 0; i < this._ints; ++i) {\n    this._inBlock[i] = input.getInt32();\n  }\n\n  // decrypt block\n  this.cipher.decrypt(this._inBlock, this._outBlock);\n\n  // write output\n  for(var i = 0; i < this._ints; ++i) {\n    output.putInt32(this._outBlock[i]);\n  }\n};\n\nmodes.ecb.prototype.pad = function(input, options) {\n  // add PKCS#7 padding to block (each pad byte is the\n  // value of the number of pad bytes)\n  var padding = (input.length() === this.blockSize ?\n    this.blockSize : (this.blockSize - input.length()));\n  input.fillWithByte(padding, padding);\n  return true;\n};\n\nmodes.ecb.prototype.unpad = function(output, options) {\n  // check for error: input data not a multiple of blockSize\n  if(options.overflow > 0) {\n    return false;\n  }\n\n  // ensure padding byte count is valid\n  var len = output.length();\n  var count = output.at(len - 1);\n  if(count > (this.blockSize << 2)) {\n    return false;\n  }\n\n  // trim off padding bytes\n  output.truncate(count);\n  return true;\n};\n\n/** Cipher-block Chaining (CBC) **/\n\nmodes.cbc = function(options) {\n  options = options || {};\n  this.name = 'CBC';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = new Array(this._ints);\n  this._outBlock = new Array(this._ints);\n};\n\nmodes.cbc.prototype.start = function(options) {\n  // Note: legacy support for using IV residue (has security flaws)\n  // if IV is null, reuse block from previous processing\n  if(options.iv === null) {\n    // must have a previous block\n    if(!this._prev) {\n      throw new Error('Invalid IV parameter.');\n    }\n    this._iv = this._prev.slice(0);\n  } else if(!('iv' in options)) {\n    throw new Error('Invalid IV parameter.');\n  } else {\n    // save IV as \"previous\" block\n    this._iv = transformIV(options.iv, this.blockSize);\n    this._prev = this._iv.slice(0);\n  }\n};\n\nmodes.cbc.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n    return true;\n  }\n\n  // get next block\n  // CBC XOR's IV (or previous block) with plaintext\n  for(var i = 0; i < this._ints; ++i) {\n    this._inBlock[i] = this._prev[i] ^ input.getInt32();\n  }\n\n  // encrypt block\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // write output, save previous block\n  for(var i = 0; i < this._ints; ++i) {\n    output.putInt32(this._outBlock[i]);\n  }\n  this._prev = this._outBlock;\n};\n\nmodes.cbc.prototype.decrypt = function(input, output, finish) {\n  // not enough input to decrypt\n  if(input.length() < this.blockSize && !(finish && input.length() > 0)) {\n    return true;\n  }\n\n  // get next block\n  for(var i = 0; i < this._ints; ++i) {\n    this._inBlock[i] = input.getInt32();\n  }\n\n  // decrypt block\n  this.cipher.decrypt(this._inBlock, this._outBlock);\n\n  // write output, save previous ciphered block\n  // CBC XOR's IV (or previous block) with ciphertext\n  for(var i = 0; i < this._ints; ++i) {\n    output.putInt32(this._prev[i] ^ this._outBlock[i]);\n  }\n  this._prev = this._inBlock.slice(0);\n};\n\nmodes.cbc.prototype.pad = function(input, options) {\n  // add PKCS#7 padding to block (each pad byte is the\n  // value of the number of pad bytes)\n  var padding = (input.length() === this.blockSize ?\n    this.blockSize : (this.blockSize - input.length()));\n  input.fillWithByte(padding, padding);\n  return true;\n};\n\nmodes.cbc.prototype.unpad = function(output, options) {\n  // check for error: input data not a multiple of blockSize\n  if(options.overflow > 0) {\n    return false;\n  }\n\n  // ensure padding byte count is valid\n  var len = output.length();\n  var count = output.at(len - 1);\n  if(count > (this.blockSize << 2)) {\n    return false;\n  }\n\n  // trim off padding bytes\n  output.truncate(count);\n  return true;\n};\n\n/** Cipher feedback (CFB) **/\n\nmodes.cfb = function(options) {\n  options = options || {};\n  this.name = 'CFB';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = null;\n  this._outBlock = new Array(this._ints);\n  this._partialBlock = new Array(this._ints);\n  this._partialOutput = forge.util.createBuffer();\n  this._partialBytes = 0;\n};\n\nmodes.cfb.prototype.start = function(options) {\n  if(!('iv' in options)) {\n    throw new Error('Invalid IV parameter.');\n  }\n  // use IV as first input\n  this._iv = transformIV(options.iv, this.blockSize);\n  this._inBlock = this._iv.slice(0);\n  this._partialBytes = 0;\n};\n\nmodes.cfb.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  var inputLength = input.length();\n  if(inputLength === 0) {\n    return true;\n  }\n\n  // encrypt block\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // handle full block\n  if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n    // XOR input with output, write input as output\n    for(var i = 0; i < this._ints; ++i) {\n      this._inBlock[i] = input.getInt32() ^ this._outBlock[i];\n      output.putInt32(this._inBlock[i]);\n    }\n    return;\n  }\n\n  // handle partial block\n  var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n  if(partialBytes > 0) {\n    partialBytes = this.blockSize - partialBytes;\n  }\n\n  // XOR input with output, write input as partial output\n  this._partialOutput.clear();\n  for(var i = 0; i < this._ints; ++i) {\n    this._partialBlock[i] = input.getInt32() ^ this._outBlock[i];\n    this._partialOutput.putInt32(this._partialBlock[i]);\n  }\n\n  if(partialBytes > 0) {\n    // block still incomplete, restore input buffer\n    input.read -= this.blockSize;\n  } else {\n    // block complete, update input block\n    for(var i = 0; i < this._ints; ++i) {\n      this._inBlock[i] = this._partialBlock[i];\n    }\n  }\n\n  // skip any previous partial bytes\n  if(this._partialBytes > 0) {\n    this._partialOutput.getBytes(this._partialBytes);\n  }\n\n  if(partialBytes > 0 && !finish) {\n    output.putBytes(this._partialOutput.getBytes(\n      partialBytes - this._partialBytes));\n    this._partialBytes = partialBytes;\n    return true;\n  }\n\n  output.putBytes(this._partialOutput.getBytes(\n    inputLength - this._partialBytes));\n  this._partialBytes = 0;\n};\n\nmodes.cfb.prototype.decrypt = function(input, output, finish) {\n  // not enough input to decrypt\n  var inputLength = input.length();\n  if(inputLength === 0) {\n    return true;\n  }\n\n  // encrypt block (CFB always uses encryption mode)\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // handle full block\n  if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n    // XOR input with output, write input as output\n    for(var i = 0; i < this._ints; ++i) {\n      this._inBlock[i] = input.getInt32();\n      output.putInt32(this._inBlock[i] ^ this._outBlock[i]);\n    }\n    return;\n  }\n\n  // handle partial block\n  var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n  if(partialBytes > 0) {\n    partialBytes = this.blockSize - partialBytes;\n  }\n\n  // XOR input with output, write input as partial output\n  this._partialOutput.clear();\n  for(var i = 0; i < this._ints; ++i) {\n    this._partialBlock[i] = input.getInt32();\n    this._partialOutput.putInt32(this._partialBlock[i] ^ this._outBlock[i]);\n  }\n\n  if(partialBytes > 0) {\n    // block still incomplete, restore input buffer\n    input.read -= this.blockSize;\n  } else {\n    // block complete, update input block\n    for(var i = 0; i < this._ints; ++i) {\n      this._inBlock[i] = this._partialBlock[i];\n    }\n  }\n\n  // skip any previous partial bytes\n  if(this._partialBytes > 0) {\n    this._partialOutput.getBytes(this._partialBytes);\n  }\n\n  if(partialBytes > 0 && !finish) {\n    output.putBytes(this._partialOutput.getBytes(\n      partialBytes - this._partialBytes));\n    this._partialBytes = partialBytes;\n    return true;\n  }\n\n  output.putBytes(this._partialOutput.getBytes(\n    inputLength - this._partialBytes));\n  this._partialBytes = 0;\n};\n\n/** Output feedback (OFB) **/\n\nmodes.ofb = function(options) {\n  options = options || {};\n  this.name = 'OFB';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = null;\n  this._outBlock = new Array(this._ints);\n  this._partialOutput = forge.util.createBuffer();\n  this._partialBytes = 0;\n};\n\nmodes.ofb.prototype.start = function(options) {\n  if(!('iv' in options)) {\n    throw new Error('Invalid IV parameter.');\n  }\n  // use IV as first input\n  this._iv = transformIV(options.iv, this.blockSize);\n  this._inBlock = this._iv.slice(0);\n  this._partialBytes = 0;\n};\n\nmodes.ofb.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  var inputLength = input.length();\n  if(input.length() === 0) {\n    return true;\n  }\n\n  // encrypt block (OFB always uses encryption mode)\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // handle full block\n  if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n    // XOR input with output and update next input\n    for(var i = 0; i < this._ints; ++i) {\n      output.putInt32(input.getInt32() ^ this._outBlock[i]);\n      this._inBlock[i] = this._outBlock[i];\n    }\n    return;\n  }\n\n  // handle partial block\n  var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n  if(partialBytes > 0) {\n    partialBytes = this.blockSize - partialBytes;\n  }\n\n  // XOR input with output\n  this._partialOutput.clear();\n  for(var i = 0; i < this._ints; ++i) {\n    this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);\n  }\n\n  if(partialBytes > 0) {\n    // block still incomplete, restore input buffer\n    input.read -= this.blockSize;\n  } else {\n    // block complete, update input block\n    for(var i = 0; i < this._ints; ++i) {\n      this._inBlock[i] = this._outBlock[i];\n    }\n  }\n\n  // skip any previous partial bytes\n  if(this._partialBytes > 0) {\n    this._partialOutput.getBytes(this._partialBytes);\n  }\n\n  if(partialBytes > 0 && !finish) {\n    output.putBytes(this._partialOutput.getBytes(\n      partialBytes - this._partialBytes));\n    this._partialBytes = partialBytes;\n    return true;\n  }\n\n  output.putBytes(this._partialOutput.getBytes(\n    inputLength - this._partialBytes));\n  this._partialBytes = 0;\n};\n\nmodes.ofb.prototype.decrypt = modes.ofb.prototype.encrypt;\n\n/** Counter (CTR) **/\n\nmodes.ctr = function(options) {\n  options = options || {};\n  this.name = 'CTR';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = null;\n  this._outBlock = new Array(this._ints);\n  this._partialOutput = forge.util.createBuffer();\n  this._partialBytes = 0;\n};\n\nmodes.ctr.prototype.start = function(options) {\n  if(!('iv' in options)) {\n    throw new Error('Invalid IV parameter.');\n  }\n  // use IV as first input\n  this._iv = transformIV(options.iv, this.blockSize);\n  this._inBlock = this._iv.slice(0);\n  this._partialBytes = 0;\n};\n\nmodes.ctr.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  var inputLength = input.length();\n  if(inputLength === 0) {\n    return true;\n  }\n\n  // encrypt block (CTR always uses encryption mode)\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // handle full block\n  if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n    // XOR input with output\n    for(var i = 0; i < this._ints; ++i) {\n      output.putInt32(input.getInt32() ^ this._outBlock[i]);\n    }\n  } else {\n    // handle partial block\n    var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n    if(partialBytes > 0) {\n      partialBytes = this.blockSize - partialBytes;\n    }\n\n    // XOR input with output\n    this._partialOutput.clear();\n    for(var i = 0; i < this._ints; ++i) {\n      this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);\n    }\n\n    if(partialBytes > 0) {\n      // block still incomplete, restore input buffer\n      input.read -= this.blockSize;\n    }\n\n    // skip any previous partial bytes\n    if(this._partialBytes > 0) {\n      this._partialOutput.getBytes(this._partialBytes);\n    }\n\n    if(partialBytes > 0 && !finish) {\n      output.putBytes(this._partialOutput.getBytes(\n        partialBytes - this._partialBytes));\n      this._partialBytes = partialBytes;\n      return true;\n    }\n\n    output.putBytes(this._partialOutput.getBytes(\n      inputLength - this._partialBytes));\n    this._partialBytes = 0;\n  }\n\n  // block complete, increment counter (input block)\n  inc32(this._inBlock);\n};\n\nmodes.ctr.prototype.decrypt = modes.ctr.prototype.encrypt;\n\n/** Galois/Counter Mode (GCM) **/\n\nmodes.gcm = function(options) {\n  options = options || {};\n  this.name = 'GCM';\n  this.cipher = options.cipher;\n  this.blockSize = options.blockSize || 16;\n  this._ints = this.blockSize / 4;\n  this._inBlock = new Array(this._ints);\n  this._outBlock = new Array(this._ints);\n  this._partialOutput = forge.util.createBuffer();\n  this._partialBytes = 0;\n\n  // R is actually this value concatenated with 120 more zero bits, but\n  // we only XOR against R so the other zeros have no effect -- we just\n  // apply this value to the first integer in a block\n  this._R = 0xE1000000;\n};\n\nmodes.gcm.prototype.start = function(options) {\n  if(!('iv' in options)) {\n    throw new Error('Invalid IV parameter.');\n  }\n  // ensure IV is a byte buffer\n  var iv = forge.util.createBuffer(options.iv);\n\n  // no ciphered data processed yet\n  this._cipherLength = 0;\n\n  // default additional data is none\n  var additionalData;\n  if('additionalData' in options) {\n    additionalData = forge.util.createBuffer(options.additionalData);\n  } else {\n    additionalData = forge.util.createBuffer();\n  }\n\n  // default tag length is 128 bits\n  if('tagLength' in options) {\n    this._tagLength = options.tagLength;\n  } else {\n    this._tagLength = 128;\n  }\n\n  // if tag is given, ensure tag matches tag length\n  this._tag = null;\n  if(options.decrypt) {\n    // save tag to check later\n    this._tag = forge.util.createBuffer(options.tag).getBytes();\n    if(this._tag.length !== (this._tagLength / 8)) {\n      throw new Error('Authentication tag does not match tag length.');\n    }\n  }\n\n  // create tmp storage for hash calculation\n  this._hashBlock = new Array(this._ints);\n\n  // no tag generated yet\n  this.tag = null;\n\n  // generate hash subkey\n  // (apply block cipher to \"zero\" block)\n  this._hashSubkey = new Array(this._ints);\n  this.cipher.encrypt([0, 0, 0, 0], this._hashSubkey);\n\n  // generate table M\n  // use 4-bit tables (32 component decomposition of a 16 byte value)\n  // 8-bit tables take more space and are known to have security\n  // vulnerabilities (in native implementations)\n  this.componentBits = 4;\n  this._m = this.generateHashTable(this._hashSubkey, this.componentBits);\n\n  // Note: support IV length different from 96 bits? (only supporting\n  // 96 bits is recommended by NIST SP-800-38D)\n  // generate J_0\n  var ivLength = iv.length();\n  if(ivLength === 12) {\n    // 96-bit IV\n    this._j0 = [iv.getInt32(), iv.getInt32(), iv.getInt32(), 1];\n  } else {\n    // IV is NOT 96-bits\n    this._j0 = [0, 0, 0, 0];\n    while(iv.length() > 0) {\n      this._j0 = this.ghash(\n        this._hashSubkey, this._j0,\n        [iv.getInt32(), iv.getInt32(), iv.getInt32(), iv.getInt32()]);\n    }\n    this._j0 = this.ghash(\n      this._hashSubkey, this._j0, [0, 0].concat(from64To32(ivLength * 8)));\n  }\n\n  // generate ICB (initial counter block)\n  this._inBlock = this._j0.slice(0);\n  inc32(this._inBlock);\n  this._partialBytes = 0;\n\n  // consume authentication data\n  additionalData = forge.util.createBuffer(additionalData);\n  // save additional data length as a BE 64-bit number\n  this._aDataLength = from64To32(additionalData.length() * 8);\n  // pad additional data to 128 bit (16 byte) block size\n  var overflow = additionalData.length() % this.blockSize;\n  if(overflow) {\n    additionalData.fillWithByte(0, this.blockSize - overflow);\n  }\n  this._s = [0, 0, 0, 0];\n  while(additionalData.length() > 0) {\n    this._s = this.ghash(this._hashSubkey, this._s, [\n      additionalData.getInt32(),\n      additionalData.getInt32(),\n      additionalData.getInt32(),\n      additionalData.getInt32()\n    ]);\n  }\n};\n\nmodes.gcm.prototype.encrypt = function(input, output, finish) {\n  // not enough input to encrypt\n  var inputLength = input.length();\n  if(inputLength === 0) {\n    return true;\n  }\n\n  // encrypt block\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // handle full block\n  if(this._partialBytes === 0 && inputLength >= this.blockSize) {\n    // XOR input with output\n    for(var i = 0; i < this._ints; ++i) {\n      output.putInt32(this._outBlock[i] ^= input.getInt32());\n    }\n    this._cipherLength += this.blockSize;\n  } else {\n    // handle partial block\n    var partialBytes = (this.blockSize - inputLength) % this.blockSize;\n    if(partialBytes > 0) {\n      partialBytes = this.blockSize - partialBytes;\n    }\n\n    // XOR input with output\n    this._partialOutput.clear();\n    for(var i = 0; i < this._ints; ++i) {\n      this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]);\n    }\n\n    if(partialBytes <= 0 || finish) {\n      // handle overflow prior to hashing\n      if(finish) {\n        // get block overflow\n        var overflow = inputLength % this.blockSize;\n        this._cipherLength += overflow;\n        // truncate for hash function\n        this._partialOutput.truncate(this.blockSize - overflow);\n      } else {\n        this._cipherLength += this.blockSize;\n      }\n\n      // get output block for hashing\n      for(var i = 0; i < this._ints; ++i) {\n        this._outBlock[i] = this._partialOutput.getInt32();\n      }\n      this._partialOutput.read -= this.blockSize;\n    }\n\n    // skip any previous partial bytes\n    if(this._partialBytes > 0) {\n      this._partialOutput.getBytes(this._partialBytes);\n    }\n\n    if(partialBytes > 0 && !finish) {\n      // block still incomplete, restore input buffer, get partial output,\n      // and return early\n      input.read -= this.blockSize;\n      output.putBytes(this._partialOutput.getBytes(\n        partialBytes - this._partialBytes));\n      this._partialBytes = partialBytes;\n      return true;\n    }\n\n    output.putBytes(this._partialOutput.getBytes(\n      inputLength - this._partialBytes));\n    this._partialBytes = 0;\n  }\n\n  // update hash block S\n  this._s = this.ghash(this._hashSubkey, this._s, this._outBlock);\n\n  // increment counter (input block)\n  inc32(this._inBlock);\n};\n\nmodes.gcm.prototype.decrypt = function(input, output, finish) {\n  // not enough input to decrypt\n  var inputLength = input.length();\n  if(inputLength < this.blockSize && !(finish && inputLength > 0)) {\n    return true;\n  }\n\n  // encrypt block (GCM always uses encryption mode)\n  this.cipher.encrypt(this._inBlock, this._outBlock);\n\n  // increment counter (input block)\n  inc32(this._inBlock);\n\n  // update hash block S\n  this._hashBlock[0] = input.getInt32();\n  this._hashBlock[1] = input.getInt32();\n  this._hashBlock[2] = input.getInt32();\n  this._hashBlock[3] = input.getInt32();\n  this._s = this.ghash(this._hashSubkey, this._s, this._hashBlock);\n\n  // XOR hash input with output\n  for(var i = 0; i < this._ints; ++i) {\n    output.putInt32(this._outBlock[i] ^ this._hashBlock[i]);\n  }\n\n  // increment cipher data length\n  if(inputLength < this.blockSize) {\n    this._cipherLength += inputLength % this.blockSize;\n  } else {\n    this._cipherLength += this.blockSize;\n  }\n};\n\nmodes.gcm.prototype.afterFinish = function(output, options) {\n  var rval = true;\n\n  // handle overflow\n  if(options.decrypt && options.overflow) {\n    output.truncate(this.blockSize - options.overflow);\n  }\n\n  // handle authentication tag\n  this.tag = forge.util.createBuffer();\n\n  // concatenate additional data length with cipher length\n  var lengths = this._aDataLength.concat(from64To32(this._cipherLength * 8));\n\n  // include lengths in hash\n  this._s = this.ghash(this._hashSubkey, this._s, lengths);\n\n  // do GCTR(J_0, S)\n  var tag = [];\n  this.cipher.encrypt(this._j0, tag);\n  for(var i = 0; i < this._ints; ++i) {\n    this.tag.putInt32(this._s[i] ^ tag[i]);\n  }\n\n  // trim tag to length\n  this.tag.truncate(this.tag.length() % (this._tagLength / 8));\n\n  // check authentication tag\n  if(options.decrypt && this.tag.bytes() !== this._tag) {\n    rval = false;\n  }\n\n  return rval;\n};\n\n/**\n * See NIST SP-800-38D 6.3 (Algorithm 1). This function performs Galois\n * field multiplication. The field, GF(2^128), is defined by the polynomial:\n *\n * x^128 + x^7 + x^2 + x + 1\n *\n * Which is represented in little-endian binary form as: 11100001 (0xe1). When\n * the value of a coefficient is 1, a bit is set. The value R, is the\n * concatenation of this value and 120 zero bits, yielding a 128-bit value\n * which matches the block size.\n *\n * This function will multiply two elements (vectors of bytes), X and Y, in\n * the field GF(2^128). The result is initialized to zero. For each bit of\n * X (out of 128), x_i, if x_i is set, then the result is multiplied (XOR'd)\n * by the current value of Y. For each bit, the value of Y will be raised by\n * a power of x (multiplied by the polynomial x). This can be achieved by\n * shifting Y once to the right. If the current value of Y, prior to being\n * multiplied by x, has 0 as its LSB, then it is a 127th degree polynomial.\n * Otherwise, we must divide by R after shifting to find the remainder.\n *\n * @param x the first block to multiply by the second.\n * @param y the second block to multiply by the first.\n *\n * @return the block result of the multiplication.\n */\nmodes.gcm.prototype.multiply = function(x, y) {\n  var z_i = [0, 0, 0, 0];\n  var v_i = y.slice(0);\n\n  // calculate Z_128 (block has 128 bits)\n  for(var i = 0; i < 128; ++i) {\n    // if x_i is 0, Z_{i+1} = Z_i (unchanged)\n    // else Z_{i+1} = Z_i ^ V_i\n    // get x_i by finding 32-bit int position, then left shift 1 by remainder\n    var x_i = x[(i / 32) | 0] & (1 << (31 - i % 32));\n    if(x_i) {\n      z_i[0] ^= v_i[0];\n      z_i[1] ^= v_i[1];\n      z_i[2] ^= v_i[2];\n      z_i[3] ^= v_i[3];\n    }\n\n    // if LSB(V_i) is 1, V_i = V_i >> 1\n    // else V_i = (V_i >> 1) ^ R\n    this.pow(v_i, v_i);\n  }\n\n  return z_i;\n};\n\nmodes.gcm.prototype.pow = function(x, out) {\n  // if LSB(x) is 1, x = x >>> 1\n  // else x = (x >>> 1) ^ R\n  var lsb = x[3] & 1;\n\n  // always do x >>> 1:\n  // starting with the rightmost integer, shift each integer to the right\n  // one bit, pulling in the bit from the integer to the left as its top\n  // most bit (do this for the last 3 integers)\n  for(var i = 3; i > 0; --i) {\n    out[i] = (x[i] >>> 1) | ((x[i - 1] & 1) << 31);\n  }\n  // shift the first integer normally\n  out[0] = x[0] >>> 1;\n\n  // if lsb was not set, then polynomial had a degree of 127 and doesn't\n  // need to divided; otherwise, XOR with R to find the remainder; we only\n  // need to XOR the first integer since R technically ends w/120 zero bits\n  if(lsb) {\n    out[0] ^= this._R;\n  }\n};\n\nmodes.gcm.prototype.tableMultiply = function(x) {\n  // assumes 4-bit tables are used\n  var z = [0, 0, 0, 0];\n  for(var i = 0; i < 32; ++i) {\n    var idx = (i / 8) | 0;\n    var x_i = (x[idx] >>> ((7 - (i % 8)) * 4)) & 0xF;\n    var ah = this._m[i][x_i];\n    z[0] ^= ah[0];\n    z[1] ^= ah[1];\n    z[2] ^= ah[2];\n    z[3] ^= ah[3];\n  }\n  return z;\n};\n\n/**\n * A continuing version of the GHASH algorithm that operates on a single\n * block. The hash block, last hash value (Ym) and the new block to hash\n * are given.\n *\n * @param h the hash block.\n * @param y the previous value for Ym, use [0, 0, 0, 0] for a new hash.\n * @param x the block to hash.\n *\n * @return the hashed value (Ym).\n */\nmodes.gcm.prototype.ghash = function(h, y, x) {\n  y[0] ^= x[0];\n  y[1] ^= x[1];\n  y[2] ^= x[2];\n  y[3] ^= x[3];\n  return this.tableMultiply(y);\n  //return this.multiply(y, h);\n};\n\n/**\n * Precomputes a table for multiplying against the hash subkey. This\n * mechanism provides a substantial speed increase over multiplication\n * performed without a table. The table-based multiplication this table is\n * for solves X * H by multiplying each component of X by H and then\n * composing the results together using XOR.\n *\n * This function can be used to generate tables with different bit sizes\n * for the components, however, this implementation assumes there are\n * 32 components of X (which is a 16 byte vector), therefore each component\n * takes 4-bits (so the table is constructed with bits=4).\n *\n * @param h the hash subkey.\n * @param bits the bit size for a component.\n */\nmodes.gcm.prototype.generateHashTable = function(h, bits) {\n  // TODO: There are further optimizations that would use only the\n  // first table M_0 (or some variant) along with a remainder table;\n  // this can be explored in the future\n  var multiplier = 8 / bits;\n  var perInt = 4 * multiplier;\n  var size = 16 * multiplier;\n  var m = new Array(size);\n  for(var i = 0; i < size; ++i) {\n    var tmp = [0, 0, 0, 0];\n    var idx = (i / perInt) | 0;\n    var shft = ((perInt - 1 - (i % perInt)) * bits);\n    tmp[idx] = (1 << (bits - 1)) << shft;\n    m[i] = this.generateSubHashTable(this.multiply(tmp, h), bits);\n  }\n  return m;\n};\n\n/**\n * Generates a table for multiplying against the hash subkey for one\n * particular component (out of all possible component values).\n *\n * @param mid the pre-multiplied value for the middle key of the table.\n * @param bits the bit size for a component.\n */\nmodes.gcm.prototype.generateSubHashTable = function(mid, bits) {\n  // compute the table quickly by minimizing the number of\n  // POW operations -- they only need to be performed for powers of 2,\n  // all other entries can be composed from those powers using XOR\n  var size = 1 << bits;\n  var half = size >>> 1;\n  var m = new Array(size);\n  m[half] = mid.slice(0);\n  var i = half >>> 1;\n  while(i > 0) {\n    // raise m0[2 * i] and store in m0[i]\n    this.pow(m[2 * i], m[i] = []);\n    i >>= 1;\n  }\n  i = 2;\n  while(i < half) {\n    for(var j = 1; j < i; ++j) {\n      var m_i = m[i];\n      var m_j = m[j];\n      m[i + j] = [\n        m_i[0] ^ m_j[0],\n        m_i[1] ^ m_j[1],\n        m_i[2] ^ m_j[2],\n        m_i[3] ^ m_j[3]\n      ];\n    }\n    i *= 2;\n  }\n  m[0] = [0, 0, 0, 0];\n  /* Note: We could avoid storing these by doing composition during multiply\n  calculate top half using composition by speed is preferred. */\n  for(i = half + 1; i < size; ++i) {\n    var c = m[i ^ half];\n    m[i] = [mid[0] ^ c[0], mid[1] ^ c[1], mid[2] ^ c[2], mid[3] ^ c[3]];\n  }\n  return m;\n};\n\n/** Utility functions */\n\nfunction transformIV(iv, blockSize) {\n  if(typeof iv === 'string') {\n    // convert iv string into byte buffer\n    iv = forge.util.createBuffer(iv);\n  }\n\n  if(forge.util.isArray(iv) && iv.length > 4) {\n    // convert iv byte array into byte buffer\n    var tmp = iv;\n    iv = forge.util.createBuffer();\n    for(var i = 0; i < tmp.length; ++i) {\n      iv.putByte(tmp[i]);\n    }\n  }\n\n  if(iv.length() < blockSize) {\n    throw new Error(\n      'Invalid IV length; got ' + iv.length() +\n      ' bytes and expected ' + blockSize + ' bytes.');\n  }\n\n  if(!forge.util.isArray(iv)) {\n    // convert iv byte buffer into 32-bit integer array\n    var ints = [];\n    var blocks = blockSize / 4;\n    for(var i = 0; i < blocks; ++i) {\n      ints.push(iv.getInt32());\n    }\n    iv = ints;\n  }\n\n  return iv;\n}\n\nfunction inc32(block) {\n  // increment last 32 bits of block only\n  block[block.length - 1] = (block[block.length - 1] + 1) & 0xFFFFFFFF;\n}\n\nfunction from64To32(num) {\n  // convert 64-bit number to two BE Int32s\n  return [(num / 0x100000000) | 0, num & 0xFFFFFFFF];\n}\n","/**\n * DES (Data Encryption Standard) implementation.\n *\n * This implementation supports DES as well as 3DES-EDE in ECB and CBC mode.\n * It is based on the BSD-licensed implementation by Paul Tero:\n *\n * Paul Tero, July 2001\n * http://www.tero.co.uk/des/\n *\n * Optimised for performance with large blocks by\n * Michael Hayworth, November 2001\n * http://www.netdealing.com\n *\n * THIS SOFTWARE IS PROVIDED \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n *\n * @author Stefan Siegl\n * @author Dave Longley\n *\n * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>\n * Copyright (c) 2012-2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./cipher');\nrequire('./cipherModes');\nrequire('./util');\n\n/* DES API */\nmodule.exports = forge.des = forge.des || {};\n\n/**\n * Deprecated. Instead, use:\n *\n * var cipher = forge.cipher.createCipher('DES-<mode>', key);\n * cipher.start({iv: iv});\n *\n * Creates an DES cipher object to encrypt data using the given symmetric key.\n * The output will be stored in the 'output' member of the returned cipher.\n *\n * The key and iv may be given as binary-encoded strings of bytes or\n * byte buffers.\n *\n * @param key the symmetric key to use (64 or 192 bits).\n * @param iv the initialization vector to use.\n * @param output the buffer to write to, null to create one.\n * @param mode the cipher mode to use (default: 'CBC' if IV is\n *          given, 'ECB' if null).\n *\n * @return the cipher.\n */\nforge.des.startEncrypting = function(key, iv, output, mode) {\n  var cipher = _createCipher({\n    key: key,\n    output: output,\n    decrypt: false,\n    mode: mode || (iv === null ? 'ECB' : 'CBC')\n  });\n  cipher.start(iv);\n  return cipher;\n};\n\n/**\n * Deprecated. Instead, use:\n *\n * var cipher = forge.cipher.createCipher('DES-<mode>', key);\n *\n * Creates an DES cipher object to encrypt data using the given symmetric key.\n *\n * The key may be given as a binary-encoded string of bytes or a byte buffer.\n *\n * @param key the symmetric key to use (64 or 192 bits).\n * @param mode the cipher mode to use (default: 'CBC').\n *\n * @return the cipher.\n */\nforge.des.createEncryptionCipher = function(key, mode) {\n  return _createCipher({\n    key: key,\n    output: null,\n    decrypt: false,\n    mode: mode\n  });\n};\n\n/**\n * Deprecated. Instead, use:\n *\n * var decipher = forge.cipher.createDecipher('DES-<mode>', key);\n * decipher.start({iv: iv});\n *\n * Creates an DES cipher object to decrypt data using the given symmetric key.\n * The output will be stored in the 'output' member of the returned cipher.\n *\n * The key and iv may be given as binary-encoded strings of bytes or\n * byte buffers.\n *\n * @param key the symmetric key to use (64 or 192 bits).\n * @param iv the initialization vector to use.\n * @param output the buffer to write to, null to create one.\n * @param mode the cipher mode to use (default: 'CBC' if IV is\n *          given, 'ECB' if null).\n *\n * @return the cipher.\n */\nforge.des.startDecrypting = function(key, iv, output, mode) {\n  var cipher = _createCipher({\n    key: key,\n    output: output,\n    decrypt: true,\n    mode: mode || (iv === null ? 'ECB' : 'CBC')\n  });\n  cipher.start(iv);\n  return cipher;\n};\n\n/**\n * Deprecated. Instead, use:\n *\n * var decipher = forge.cipher.createDecipher('DES-<mode>', key);\n *\n * Creates an DES cipher object to decrypt data using the given symmetric key.\n *\n * The key may be given as a binary-encoded string of bytes or a byte buffer.\n *\n * @param key the symmetric key to use (64 or 192 bits).\n * @param mode the cipher mode to use (default: 'CBC').\n *\n * @return the cipher.\n */\nforge.des.createDecryptionCipher = function(key, mode) {\n  return _createCipher({\n    key: key,\n    output: null,\n    decrypt: true,\n    mode: mode\n  });\n};\n\n/**\n * Creates a new DES cipher algorithm object.\n *\n * @param name the name of the algorithm.\n * @param mode the mode factory function.\n *\n * @return the DES algorithm object.\n */\nforge.des.Algorithm = function(name, mode) {\n  var self = this;\n  self.name = name;\n  self.mode = new mode({\n    blockSize: 8,\n    cipher: {\n      encrypt: function(inBlock, outBlock) {\n        return _updateBlock(self._keys, inBlock, outBlock, false);\n      },\n      decrypt: function(inBlock, outBlock) {\n        return _updateBlock(self._keys, inBlock, outBlock, true);\n      }\n    }\n  });\n  self._init = false;\n};\n\n/**\n * Initializes this DES algorithm by expanding its key.\n *\n * @param options the options to use.\n *          key the key to use with this algorithm.\n *          decrypt true if the algorithm should be initialized for decryption,\n *            false for encryption.\n */\nforge.des.Algorithm.prototype.initialize = function(options) {\n  if(this._init) {\n    return;\n  }\n\n  var key = forge.util.createBuffer(options.key);\n  if(this.name.indexOf('3DES') === 0) {\n    if(key.length() !== 24) {\n      throw new Error('Invalid Triple-DES key size: ' + key.length() * 8);\n    }\n  }\n\n  // do key expansion to 16 or 48 subkeys (single or triple DES)\n  this._keys = _createKeys(key);\n  this._init = true;\n};\n\n/** Register DES algorithms **/\n\nregisterAlgorithm('DES-ECB', forge.cipher.modes.ecb);\nregisterAlgorithm('DES-CBC', forge.cipher.modes.cbc);\nregisterAlgorithm('DES-CFB', forge.cipher.modes.cfb);\nregisterAlgorithm('DES-OFB', forge.cipher.modes.ofb);\nregisterAlgorithm('DES-CTR', forge.cipher.modes.ctr);\n\nregisterAlgorithm('3DES-ECB', forge.cipher.modes.ecb);\nregisterAlgorithm('3DES-CBC', forge.cipher.modes.cbc);\nregisterAlgorithm('3DES-CFB', forge.cipher.modes.cfb);\nregisterAlgorithm('3DES-OFB', forge.cipher.modes.ofb);\nregisterAlgorithm('3DES-CTR', forge.cipher.modes.ctr);\n\nfunction registerAlgorithm(name, mode) {\n  var factory = function() {\n    return new forge.des.Algorithm(name, mode);\n  };\n  forge.cipher.registerAlgorithm(name, factory);\n}\n\n/** DES implementation **/\n\nvar spfunction1 = [0x1010400,0,0x10000,0x1010404,0x1010004,0x10404,0x4,0x10000,0x400,0x1010400,0x1010404,0x400,0x1000404,0x1010004,0x1000000,0x4,0x404,0x1000400,0x1000400,0x10400,0x10400,0x1010000,0x1010000,0x1000404,0x10004,0x1000004,0x1000004,0x10004,0,0x404,0x10404,0x1000000,0x10000,0x1010404,0x4,0x1010000,0x1010400,0x1000000,0x1000000,0x400,0x1010004,0x10000,0x10400,0x1000004,0x400,0x4,0x1000404,0x10404,0x1010404,0x10004,0x1010000,0x1000404,0x1000004,0x404,0x10404,0x1010400,0x404,0x1000400,0x1000400,0,0x10004,0x10400,0,0x1010004];\nvar spfunction2 = [-0x7fef7fe0,-0x7fff8000,0x8000,0x108020,0x100000,0x20,-0x7fefffe0,-0x7fff7fe0,-0x7fffffe0,-0x7fef7fe0,-0x7fef8000,-0x80000000,-0x7fff8000,0x100000,0x20,-0x7fefffe0,0x108000,0x100020,-0x7fff7fe0,0,-0x80000000,0x8000,0x108020,-0x7ff00000,0x100020,-0x7fffffe0,0,0x108000,0x8020,-0x7fef8000,-0x7ff00000,0x8020,0,0x108020,-0x7fefffe0,0x100000,-0x7fff7fe0,-0x7ff00000,-0x7fef8000,0x8000,-0x7ff00000,-0x7fff8000,0x20,-0x7fef7fe0,0x108020,0x20,0x8000,-0x80000000,0x8020,-0x7fef8000,0x100000,-0x7fffffe0,0x100020,-0x7fff7fe0,-0x7fffffe0,0x100020,0x108000,0,-0x7fff8000,0x8020,-0x80000000,-0x7fefffe0,-0x7fef7fe0,0x108000];\nvar spfunction3 = [0x208,0x8020200,0,0x8020008,0x8000200,0,0x20208,0x8000200,0x20008,0x8000008,0x8000008,0x20000,0x8020208,0x20008,0x8020000,0x208,0x8000000,0x8,0x8020200,0x200,0x20200,0x8020000,0x8020008,0x20208,0x8000208,0x20200,0x20000,0x8000208,0x8,0x8020208,0x200,0x8000000,0x8020200,0x8000000,0x20008,0x208,0x20000,0x8020200,0x8000200,0,0x200,0x20008,0x8020208,0x8000200,0x8000008,0x200,0,0x8020008,0x8000208,0x20000,0x8000000,0x8020208,0x8,0x20208,0x20200,0x8000008,0x8020000,0x8000208,0x208,0x8020000,0x20208,0x8,0x8020008,0x20200];\nvar spfunction4 = [0x802001,0x2081,0x2081,0x80,0x802080,0x800081,0x800001,0x2001,0,0x802000,0x802000,0x802081,0x81,0,0x800080,0x800001,0x1,0x2000,0x800000,0x802001,0x80,0x800000,0x2001,0x2080,0x800081,0x1,0x2080,0x800080,0x2000,0x802080,0x802081,0x81,0x800080,0x800001,0x802000,0x802081,0x81,0,0,0x802000,0x2080,0x800080,0x800081,0x1,0x802001,0x2081,0x2081,0x80,0x802081,0x81,0x1,0x2000,0x800001,0x2001,0x802080,0x800081,0x2001,0x2080,0x800000,0x802001,0x80,0x800000,0x2000,0x802080];\nvar spfunction5 = [0x100,0x2080100,0x2080000,0x42000100,0x80000,0x100,0x40000000,0x2080000,0x40080100,0x80000,0x2000100,0x40080100,0x42000100,0x42080000,0x80100,0x40000000,0x2000000,0x40080000,0x40080000,0,0x40000100,0x42080100,0x42080100,0x2000100,0x42080000,0x40000100,0,0x42000000,0x2080100,0x2000000,0x42000000,0x80100,0x80000,0x42000100,0x100,0x2000000,0x40000000,0x2080000,0x42000100,0x40080100,0x2000100,0x40000000,0x42080000,0x2080100,0x40080100,0x100,0x2000000,0x42080000,0x42080100,0x80100,0x42000000,0x42080100,0x2080000,0,0x40080000,0x42000000,0x80100,0x2000100,0x40000100,0x80000,0,0x40080000,0x2080100,0x40000100];\nvar spfunction6 = [0x20000010,0x20400000,0x4000,0x20404010,0x20400000,0x10,0x20404010,0x400000,0x20004000,0x404010,0x400000,0x20000010,0x400010,0x20004000,0x20000000,0x4010,0,0x400010,0x20004010,0x4000,0x404000,0x20004010,0x10,0x20400010,0x20400010,0,0x404010,0x20404000,0x4010,0x404000,0x20404000,0x20000000,0x20004000,0x10,0x20400010,0x404000,0x20404010,0x400000,0x4010,0x20000010,0x400000,0x20004000,0x20000000,0x4010,0x20000010,0x20404010,0x404000,0x20400000,0x404010,0x20404000,0,0x20400010,0x10,0x4000,0x20400000,0x404010,0x4000,0x400010,0x20004010,0,0x20404000,0x20000000,0x400010,0x20004010];\nvar spfunction7 = [0x200000,0x4200002,0x4000802,0,0x800,0x4000802,0x200802,0x4200800,0x4200802,0x200000,0,0x4000002,0x2,0x4000000,0x4200002,0x802,0x4000800,0x200802,0x200002,0x4000800,0x4000002,0x4200000,0x4200800,0x200002,0x4200000,0x800,0x802,0x4200802,0x200800,0x2,0x4000000,0x200800,0x4000000,0x200800,0x200000,0x4000802,0x4000802,0x4200002,0x4200002,0x2,0x200002,0x4000000,0x4000800,0x200000,0x4200800,0x802,0x200802,0x4200800,0x802,0x4000002,0x4200802,0x4200000,0x200800,0,0x2,0x4200802,0,0x200802,0x4200000,0x800,0x4000002,0x4000800,0x800,0x200002];\nvar spfunction8 = [0x10001040,0x1000,0x40000,0x10041040,0x10000000,0x10001040,0x40,0x10000000,0x40040,0x10040000,0x10041040,0x41000,0x10041000,0x41040,0x1000,0x40,0x10040000,0x10000040,0x10001000,0x1040,0x41000,0x40040,0x10040040,0x10041000,0x1040,0,0,0x10040040,0x10000040,0x10001000,0x41040,0x40000,0x41040,0x40000,0x10041000,0x1000,0x40,0x10040040,0x1000,0x41040,0x10001000,0x40,0x10000040,0x10040000,0x10040040,0x10000000,0x40000,0x10001040,0,0x10041040,0x40040,0x10000040,0x10040000,0x10001000,0x10001040,0,0x10041040,0x41000,0x41000,0x1040,0x1040,0x40040,0x10000000,0x10041000];\n\n/**\n * Create necessary sub keys.\n *\n * @param key the 64-bit or 192-bit key.\n *\n * @return the expanded keys.\n */\nfunction _createKeys(key) {\n  var pc2bytes0  = [0,0x4,0x20000000,0x20000004,0x10000,0x10004,0x20010000,0x20010004,0x200,0x204,0x20000200,0x20000204,0x10200,0x10204,0x20010200,0x20010204],\n      pc2bytes1  = [0,0x1,0x100000,0x100001,0x4000000,0x4000001,0x4100000,0x4100001,0x100,0x101,0x100100,0x100101,0x4000100,0x4000101,0x4100100,0x4100101],\n      pc2bytes2  = [0,0x8,0x800,0x808,0x1000000,0x1000008,0x1000800,0x1000808,0,0x8,0x800,0x808,0x1000000,0x1000008,0x1000800,0x1000808],\n      pc2bytes3  = [0,0x200000,0x8000000,0x8200000,0x2000,0x202000,0x8002000,0x8202000,0x20000,0x220000,0x8020000,0x8220000,0x22000,0x222000,0x8022000,0x8222000],\n      pc2bytes4  = [0,0x40000,0x10,0x40010,0,0x40000,0x10,0x40010,0x1000,0x41000,0x1010,0x41010,0x1000,0x41000,0x1010,0x41010],\n      pc2bytes5  = [0,0x400,0x20,0x420,0,0x400,0x20,0x420,0x2000000,0x2000400,0x2000020,0x2000420,0x2000000,0x2000400,0x2000020,0x2000420],\n      pc2bytes6  = [0,0x10000000,0x80000,0x10080000,0x2,0x10000002,0x80002,0x10080002,0,0x10000000,0x80000,0x10080000,0x2,0x10000002,0x80002,0x10080002],\n      pc2bytes7  = [0,0x10000,0x800,0x10800,0x20000000,0x20010000,0x20000800,0x20010800,0x20000,0x30000,0x20800,0x30800,0x20020000,0x20030000,0x20020800,0x20030800],\n      pc2bytes8  = [0,0x40000,0,0x40000,0x2,0x40002,0x2,0x40002,0x2000000,0x2040000,0x2000000,0x2040000,0x2000002,0x2040002,0x2000002,0x2040002],\n      pc2bytes9  = [0,0x10000000,0x8,0x10000008,0,0x10000000,0x8,0x10000008,0x400,0x10000400,0x408,0x10000408,0x400,0x10000400,0x408,0x10000408],\n      pc2bytes10 = [0,0x20,0,0x20,0x100000,0x100020,0x100000,0x100020,0x2000,0x2020,0x2000,0x2020,0x102000,0x102020,0x102000,0x102020],\n      pc2bytes11 = [0,0x1000000,0x200,0x1000200,0x200000,0x1200000,0x200200,0x1200200,0x4000000,0x5000000,0x4000200,0x5000200,0x4200000,0x5200000,0x4200200,0x5200200],\n      pc2bytes12 = [0,0x1000,0x8000000,0x8001000,0x80000,0x81000,0x8080000,0x8081000,0x10,0x1010,0x8000010,0x8001010,0x80010,0x81010,0x8080010,0x8081010],\n      pc2bytes13 = [0,0x4,0x100,0x104,0,0x4,0x100,0x104,0x1,0x5,0x101,0x105,0x1,0x5,0x101,0x105];\n\n  // how many iterations (1 for des, 3 for triple des)\n  // changed by Paul 16/6/2007 to use Triple DES for 9+ byte keys\n  var iterations = key.length() > 8 ? 3 : 1;\n\n  // stores the return keys\n  var keys = [];\n\n  // now define the left shifts which need to be done\n  var shifts = [0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0];\n\n  var n = 0, tmp;\n  for(var j = 0; j < iterations; j++) {\n    var left = key.getInt32();\n    var right = key.getInt32();\n\n    tmp = ((left >>> 4) ^ right) & 0x0f0f0f0f;\n    right ^= tmp;\n    left ^= (tmp << 4);\n\n    tmp = ((right >>> -16) ^ left) & 0x0000ffff;\n    left ^= tmp;\n    right ^= (tmp << -16);\n\n    tmp = ((left >>> 2) ^ right) & 0x33333333;\n    right ^= tmp;\n    left ^= (tmp << 2);\n\n    tmp = ((right >>> -16) ^ left) & 0x0000ffff;\n    left ^= tmp;\n    right ^= (tmp << -16);\n\n    tmp = ((left >>> 1) ^ right) & 0x55555555;\n    right ^= tmp;\n    left ^= (tmp << 1);\n\n    tmp = ((right >>> 8) ^ left) & 0x00ff00ff;\n    left ^= tmp;\n    right ^= (tmp << 8);\n\n    tmp = ((left >>> 1) ^ right) & 0x55555555;\n    right ^= tmp;\n    left ^= (tmp << 1);\n\n    // right needs to be shifted and OR'd with last four bits of left\n    tmp = (left << 8) | ((right >>> 20) & 0x000000f0);\n\n    // left needs to be put upside down\n    left = ((right << 24) | ((right << 8) & 0xff0000) |\n      ((right >>> 8) & 0xff00) | ((right >>> 24) & 0xf0));\n    right = tmp;\n\n    // now go through and perform these shifts on the left and right keys\n    for(var i = 0; i < shifts.length; ++i) {\n      //shift the keys either one or two bits to the left\n      if(shifts[i]) {\n        left = (left << 2) | (left >>> 26);\n        right = (right << 2) | (right >>> 26);\n      } else {\n        left = (left << 1) | (left >>> 27);\n        right = (right << 1) | (right >>> 27);\n      }\n      left &= -0xf;\n      right &= -0xf;\n\n      // now apply PC-2, in such a way that E is easier when encrypting or\n      // decrypting this conversion will look like PC-2 except only the last 6\n      // bits of each byte are used rather than 48 consecutive bits and the\n      // order of lines will be according to how the S selection functions will\n      // be applied: S2, S4, S6, S8, S1, S3, S5, S7\n      var lefttmp = (\n        pc2bytes0[left >>> 28] | pc2bytes1[(left >>> 24) & 0xf] |\n        pc2bytes2[(left >>> 20) & 0xf] | pc2bytes3[(left >>> 16) & 0xf] |\n        pc2bytes4[(left >>> 12) & 0xf] | pc2bytes5[(left >>> 8) & 0xf] |\n        pc2bytes6[(left >>> 4) & 0xf]);\n      var righttmp = (\n        pc2bytes7[right >>> 28] | pc2bytes8[(right >>> 24) & 0xf] |\n        pc2bytes9[(right >>> 20) & 0xf] | pc2bytes10[(right >>> 16) & 0xf] |\n        pc2bytes11[(right >>> 12) & 0xf] | pc2bytes12[(right >>> 8) & 0xf] |\n        pc2bytes13[(right >>> 4) & 0xf]);\n      tmp = ((righttmp >>> 16) ^ lefttmp) & 0x0000ffff;\n      keys[n++] = lefttmp ^ tmp;\n      keys[n++] = righttmp ^ (tmp << 16);\n    }\n  }\n\n  return keys;\n}\n\n/**\n * Updates a single block (1 byte) using DES. The update will either\n * encrypt or decrypt the block.\n *\n * @param keys the expanded keys.\n * @param input the input block (an array of 32-bit words).\n * @param output the updated output block.\n * @param decrypt true to decrypt the block, false to encrypt it.\n */\nfunction _updateBlock(keys, input, output, decrypt) {\n  // set up loops for single or triple DES\n  var iterations = keys.length === 32 ? 3 : 9;\n  var looping;\n  if(iterations === 3) {\n    looping = decrypt ? [30, -2, -2] : [0, 32, 2];\n  } else {\n    looping = (decrypt ?\n      [94, 62, -2, 32, 64, 2, 30, -2, -2] :\n      [0, 32, 2, 62, 30, -2, 64, 96, 2]);\n  }\n\n  var tmp;\n\n  var left = input[0];\n  var right = input[1];\n\n  // first each 64 bit chunk of the message must be permuted according to IP\n  tmp = ((left >>> 4) ^ right) & 0x0f0f0f0f;\n  right ^= tmp;\n  left ^= (tmp << 4);\n\n  tmp = ((left >>> 16) ^ right) & 0x0000ffff;\n  right ^= tmp;\n  left ^= (tmp << 16);\n\n  tmp = ((right >>> 2) ^ left) & 0x33333333;\n  left ^= tmp;\n  right ^= (tmp << 2);\n\n  tmp = ((right >>> 8) ^ left) & 0x00ff00ff;\n  left ^= tmp;\n  right ^= (tmp << 8);\n\n  tmp = ((left >>> 1) ^ right) & 0x55555555;\n  right ^= tmp;\n  left ^= (tmp << 1);\n\n  // rotate left 1 bit\n  left = ((left << 1) | (left >>> 31));\n  right = ((right << 1) | (right >>> 31));\n\n  for(var j = 0; j < iterations; j += 3) {\n    var endloop = looping[j + 1];\n    var loopinc = looping[j + 2];\n\n    // now go through and perform the encryption or decryption\n    for(var i = looping[j]; i != endloop; i += loopinc) {\n      var right1 = right ^ keys[i];\n      var right2 = ((right >>> 4) | (right << 28)) ^ keys[i + 1];\n\n      // passing these bytes through the S selection functions\n      tmp = left;\n      left = right;\n      right = tmp ^ (\n        spfunction2[(right1 >>> 24) & 0x3f] |\n        spfunction4[(right1 >>> 16) & 0x3f] |\n        spfunction6[(right1 >>>  8) & 0x3f] |\n        spfunction8[right1 & 0x3f] |\n        spfunction1[(right2 >>> 24) & 0x3f] |\n        spfunction3[(right2 >>> 16) & 0x3f] |\n        spfunction5[(right2 >>>  8) & 0x3f] |\n        spfunction7[right2 & 0x3f]);\n    }\n    // unreverse left and right\n    tmp = left;\n    left = right;\n    right = tmp;\n  }\n\n  // rotate right 1 bit\n  left = ((left >>> 1) | (left << 31));\n  right = ((right >>> 1) | (right << 31));\n\n  // now perform IP-1, which is IP in the opposite direction\n  tmp = ((left >>> 1) ^ right) & 0x55555555;\n  right ^= tmp;\n  left ^= (tmp << 1);\n\n  tmp = ((right >>> 8) ^ left) & 0x00ff00ff;\n  left ^= tmp;\n  right ^= (tmp << 8);\n\n  tmp = ((right >>> 2) ^ left) & 0x33333333;\n  left ^= tmp;\n  right ^= (tmp << 2);\n\n  tmp = ((left >>> 16) ^ right) & 0x0000ffff;\n  right ^= tmp;\n  left ^= (tmp << 16);\n\n  tmp = ((left >>> 4) ^ right) & 0x0f0f0f0f;\n  right ^= tmp;\n  left ^= (tmp << 4);\n\n  output[0] = left;\n  output[1] = right;\n}\n\n/**\n * Deprecated. Instead, use:\n *\n * forge.cipher.createCipher('DES-<mode>', key);\n * forge.cipher.createDecipher('DES-<mode>', key);\n *\n * Creates a deprecated DES cipher object. This object's mode will default to\n * CBC (cipher-block-chaining).\n *\n * The key may be given as a binary-encoded string of bytes or a byte buffer.\n *\n * @param options the options to use.\n *          key the symmetric key to use (64 or 192 bits).\n *          output the buffer to write to.\n *          decrypt true for decryption, false for encryption.\n *          mode the cipher mode to use (default: 'CBC').\n *\n * @return the cipher.\n */\nfunction _createCipher(options) {\n  options = options || {};\n  var mode = (options.mode || 'CBC').toUpperCase();\n  var algorithm = 'DES-' + mode;\n\n  var cipher;\n  if(options.decrypt) {\n    cipher = forge.cipher.createDecipher(algorithm, options.key);\n  } else {\n    cipher = forge.cipher.createCipher(algorithm, options.key);\n  }\n\n  // backwards compatible start API\n  var start = cipher.start;\n  cipher.start = function(iv, options) {\n    // backwards compatibility: support second arg as output buffer\n    var output = null;\n    if(options instanceof forge.util.ByteBuffer) {\n      output = options;\n      options = {};\n    }\n    options = options || {};\n    options.output = output;\n    options.iv = iv;\n    start.call(cipher, options);\n  };\n\n  return cipher;\n}\n","/**\n * Node.js module for Forge message digests.\n *\n * @author Dave Longley\n *\n * Copyright 2011-2017 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\n\nmodule.exports = forge.md = forge.md || {};\nforge.md.algorithms = forge.md.algorithms || {};\n","/**\n * Password-Based Key-Derivation Function #2 implementation.\n *\n * See RFC 2898 for details.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2013 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./hmac');\nrequire('./md');\nrequire('./util');\n\nvar pkcs5 = forge.pkcs5 = forge.pkcs5 || {};\n\nvar crypto;\nif(forge.util.isNodejs && !forge.options.usePureJavaScript) {\n  crypto = require('crypto');\n}\n\n/**\n * Derives a key from a password.\n *\n * @param p the password as a binary-encoded string of bytes.\n * @param s the salt as a binary-encoded string of bytes.\n * @param c the iteration count, a positive integer.\n * @param dkLen the intended length, in bytes, of the derived key,\n *          (max: 2^32 - 1) * hash length of the PRF.\n * @param [md] the message digest (or algorithm identifier as a string) to use\n *          in the PRF, defaults to SHA-1.\n * @param [callback(err, key)] presence triggers asynchronous version, called\n *          once the operation completes.\n *\n * @return the derived key, as a binary-encoded string of bytes, for the\n *           synchronous version (if no callback is specified).\n */\nmodule.exports = forge.pbkdf2 = pkcs5.pbkdf2 = function(\n  p, s, c, dkLen, md, callback) {\n  if(typeof md === 'function') {\n    callback = md;\n    md = null;\n  }\n\n  // use native implementation if possible and not disabled, note that\n  // some node versions only support SHA-1, others allow digest to be changed\n  if(forge.util.isNodejs && !forge.options.usePureJavaScript &&\n    crypto.pbkdf2 && (md === null || typeof md !== 'object') &&\n    (crypto.pbkdf2Sync.length > 4 || (!md || md === 'sha1'))) {\n    if(typeof md !== 'string') {\n      // default prf to SHA-1\n      md = 'sha1';\n    }\n    p = Buffer.from(p, 'binary');\n    s = Buffer.from(s, 'binary');\n    if(!callback) {\n      if(crypto.pbkdf2Sync.length === 4) {\n        return crypto.pbkdf2Sync(p, s, c, dkLen).toString('binary');\n      }\n      return crypto.pbkdf2Sync(p, s, c, dkLen, md).toString('binary');\n    }\n    if(crypto.pbkdf2Sync.length === 4) {\n      return crypto.pbkdf2(p, s, c, dkLen, function(err, key) {\n        if(err) {\n          return callback(err);\n        }\n        callback(null, key.toString('binary'));\n      });\n    }\n    return crypto.pbkdf2(p, s, c, dkLen, md, function(err, key) {\n      if(err) {\n        return callback(err);\n      }\n      callback(null, key.toString('binary'));\n    });\n  }\n\n  if(typeof md === 'undefined' || md === null) {\n    // default prf to SHA-1\n    md = 'sha1';\n  }\n  if(typeof md === 'string') {\n    if(!(md in forge.md.algorithms)) {\n      throw new Error('Unknown hash algorithm: ' + md);\n    }\n    md = forge.md[md].create();\n  }\n\n  var hLen = md.digestLength;\n\n  /* 1. If dkLen > (2^32 - 1) * hLen, output \"derived key too long\" and\n    stop. */\n  if(dkLen > (0xFFFFFFFF * hLen)) {\n    var err = new Error('Derived key is too long.');\n    if(callback) {\n      return callback(err);\n    }\n    throw err;\n  }\n\n  /* 2. Let len be the number of hLen-octet blocks in the derived key,\n    rounding up, and let r be the number of octets in the last\n    block:\n\n    len = CEIL(dkLen / hLen),\n    r = dkLen - (len - 1) * hLen. */\n  var len = Math.ceil(dkLen / hLen);\n  var r = dkLen - (len - 1) * hLen;\n\n  /* 3. For each block of the derived key apply the function F defined\n    below to the password P, the salt S, the iteration count c, and\n    the block index to compute the block:\n\n    T_1 = F(P, S, c, 1),\n    T_2 = F(P, S, c, 2),\n    ...\n    T_len = F(P, S, c, len),\n\n    where the function F is defined as the exclusive-or sum of the\n    first c iterates of the underlying pseudorandom function PRF\n    applied to the password P and the concatenation of the salt S\n    and the block index i:\n\n    F(P, S, c, i) = u_1 XOR u_2 XOR ... XOR u_c\n\n    where\n\n    u_1 = PRF(P, S || INT(i)),\n    u_2 = PRF(P, u_1),\n    ...\n    u_c = PRF(P, u_{c-1}).\n\n    Here, INT(i) is a four-octet encoding of the integer i, most\n    significant octet first. */\n  var prf = forge.hmac.create();\n  prf.start(md, p);\n  var dk = '';\n  var xor, u_c, u_c1;\n\n  // sync version\n  if(!callback) {\n    for(var i = 1; i <= len; ++i) {\n      // PRF(P, S || INT(i)) (first iteration)\n      prf.start(null, null);\n      prf.update(s);\n      prf.update(forge.util.int32ToBytes(i));\n      xor = u_c1 = prf.digest().getBytes();\n\n      // PRF(P, u_{c-1}) (other iterations)\n      for(var j = 2; j <= c; ++j) {\n        prf.start(null, null);\n        prf.update(u_c1);\n        u_c = prf.digest().getBytes();\n        // F(p, s, c, i)\n        xor = forge.util.xorBytes(xor, u_c, hLen);\n        u_c1 = u_c;\n      }\n\n      /* 4. Concatenate the blocks and extract the first dkLen octets to\n        produce a derived key DK:\n\n        DK = T_1 || T_2 ||  ...  || T_len<0..r-1> */\n      dk += (i < len) ? xor : xor.substr(0, r);\n    }\n    /* 5. Output the derived key DK. */\n    return dk;\n  }\n\n  // async version\n  var i = 1, j;\n  function outer() {\n    if(i > len) {\n      // done\n      return callback(null, dk);\n    }\n\n    // PRF(P, S || INT(i)) (first iteration)\n    prf.start(null, null);\n    prf.update(s);\n    prf.update(forge.util.int32ToBytes(i));\n    xor = u_c1 = prf.digest().getBytes();\n\n    // PRF(P, u_{c-1}) (other iterations)\n    j = 2;\n    inner();\n  }\n\n  function inner() {\n    if(j <= c) {\n      prf.start(null, null);\n      prf.update(u_c1);\n      u_c = prf.digest().getBytes();\n      // F(p, s, c, i)\n      xor = forge.util.xorBytes(xor, u_c, hLen);\n      u_c1 = u_c;\n      ++j;\n      return forge.util.setImmediate(inner);\n    }\n\n    /* 4. Concatenate the blocks and extract the first dkLen octets to\n      produce a derived key DK:\n\n      DK = T_1 || T_2 ||  ...  || T_len<0..r-1> */\n    dk += (i < len) ? xor : xor.substr(0, r);\n\n    ++i;\n    outer();\n  }\n\n  outer();\n};\n","/**\n * Hash-based Message Authentication Code implementation. Requires a message\n * digest object that can be obtained, for example, from forge.md.sha1 or\n * forge.md.md5.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2012 Digital Bazaar, Inc. All rights reserved.\n */\nvar forge = require('./forge');\nrequire('./md');\nrequire('./util');\n\n/* HMAC API */\nvar hmac = module.exports = forge.hmac = forge.hmac || {};\n\n/**\n * Creates an HMAC object that uses the given message digest object.\n *\n * @return an HMAC object.\n */\nhmac.create = function() {\n  // the hmac key to use\n  var _key = null;\n\n  // the message digest to use\n  var _md = null;\n\n  // the inner padding\n  var _ipadding = null;\n\n  // the outer padding\n  var _opadding = null;\n\n  // hmac context\n  var ctx = {};\n\n  /**\n   * Starts or restarts the HMAC with the given key and message digest.\n   *\n   * @param md the message digest to use, null to reuse the previous one,\n   *           a string to use builtin 'sha1', 'md5', 'sha256'.\n   * @param key the key to use as a string, array of bytes, byte buffer,\n   *           or null to reuse the previous key.\n   */\n  ctx.start = function(md, key) {\n    if(md !== null) {\n      if(typeof md === 'string') {\n        // create builtin message digest\n        md = md.toLowerCase();\n        if(md in forge.md.algorithms) {\n          _md = forge.md.algorithms[md].create();\n        } else {\n          throw new Error('Unknown hash algorithm \"' + md + '\"');\n        }\n      } else {\n        // store message digest\n        _md = md;\n      }\n    }\n\n    if(key === null) {\n      // reuse previous key\n      key = _key;\n    } else {\n      if(typeof key === 'string') {\n        // convert string into byte buffer\n        key = forge.util.createBuffer(key);\n      } else if(forge.util.isArray(key)) {\n        // convert byte array into byte buffer\n        var tmp = key;\n        key = forge.util.createBuffer();\n        for(var i = 0; i < tmp.length; ++i) {\n          key.putByte(tmp[i]);\n        }\n      }\n\n      // if key is longer than blocksize, hash it\n      var keylen = key.length();\n      if(keylen > _md.blockLength) {\n        _md.start();\n        _md.update(key.bytes());\n        key = _md.digest();\n      }\n\n      // mix key into inner and outer padding\n      // ipadding = [0x36 * blocksize] ^ key\n      // opadding = [0x5C * blocksize] ^ key\n      _ipadding = forge.util.createBuffer();\n      _opadding = forge.util.createBuffer();\n      keylen = key.length();\n      for(var i = 0; i < keylen; ++i) {\n        var tmp = key.at(i);\n        _ipadding.putByte(0x36 ^ tmp);\n        _opadding.putByte(0x5C ^ tmp);\n      }\n\n      // if key is shorter than blocksize, add additional padding\n      if(keylen < _md.blockLength) {\n        var tmp = _md.blockLength - keylen;\n        for(var i = 0; i < tmp; ++i) {\n          _ipadding.putByte(0x36);\n          _opadding.putByte(0x5C);\n        }\n      }\n      _key = key;\n      _ipadding = _ipadding.bytes();\n      _opadding = _opadding.bytes();\n    }\n\n    // digest is done like so: hash(opadding | hash(ipadding | message))\n\n    // prepare to do inner hash\n    // hash(ipadding | message)\n    _md.start();\n    _md.update(_ipadding);\n  };\n\n  /**\n   * Updates the HMAC with the given message bytes.\n   *\n   * @param bytes the bytes to update with.\n   */\n  ctx.update = function(bytes) {\n    _md.update(bytes);\n  };\n\n  /**\n   * Produces the Message Authentication Code (MAC).\n   *\n   * @return a byte buffer containing the digest value.\n   */\n  ctx.getMac = function() {\n    // digest is done like so: hash(opadding | hash(ipadding | message))\n    // here we do the outer hashing\n    var inner = _md.digest().bytes();\n    _md.start();\n    _md.update(_opadding);\n    _md.update(inner);\n    return _md.digest();\n  };\n  // alias for getMac\n  ctx.digest = ctx.getMac;\n\n  return ctx;\n};\n","/**\n * Javascript implementation of basic PEM (Privacy Enhanced Mail) algorithms.\n *\n * See: RFC 1421.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2013-2014 Digital Bazaar, Inc.\n *\n * A Forge PEM object has the following fields:\n *\n * type: identifies the type of message (eg: \"RSA PRIVATE KEY\").\n *\n * procType: identifies the type of processing performed on the message,\n *   it has two subfields: version and type, eg: 4,ENCRYPTED.\n *\n * contentDomain: identifies the type of content in the message, typically\n *   only uses the value: \"RFC822\".\n *\n * dekInfo: identifies the message encryption algorithm and mode and includes\n *   any parameters for the algorithm, it has two subfields: algorithm and\n *   parameters, eg: DES-CBC,F8143EDE5960C597.\n *\n * headers: contains all other PEM encapsulated headers -- where order is\n *   significant (for pairing data like recipient ID + key info).\n *\n * body: the binary-encoded body.\n */\nvar forge = require('./forge');\nrequire('./util');\n\n// shortcut for pem API\nvar pem = module.exports = forge.pem = forge.pem || {};\n\n/**\n * Encodes (serializes) the given PEM object.\n *\n * @param msg the PEM message object to encode.\n * @param options the options to use:\n *          maxline the maximum characters per line for the body, (default: 64).\n *\n * @return the PEM-formatted string.\n */\npem.encode = function(msg, options) {\n  options = options || {};\n  var rval = '-----BEGIN ' + msg.type + '-----\\r\\n';\n\n  // encode special headers\n  var header;\n  if(msg.procType) {\n    header = {\n      name: 'Proc-Type',\n      values: [String(msg.procType.version), msg.procType.type]\n    };\n    rval += foldHeader(header);\n  }\n  if(msg.contentDomain) {\n    header = {name: 'Content-Domain', values: [msg.contentDomain]};\n    rval += foldHeader(header);\n  }\n  if(msg.dekInfo) {\n    header = {name: 'DEK-Info', values: [msg.dekInfo.algorithm]};\n    if(msg.dekInfo.parameters) {\n      header.values.push(msg.dekInfo.parameters);\n    }\n    rval += foldHeader(header);\n  }\n\n  if(msg.headers) {\n    // encode all other headers\n    for(var i = 0; i < msg.headers.length; ++i) {\n      rval += foldHeader(msg.headers[i]);\n    }\n  }\n\n  // terminate header\n  if(msg.procType) {\n    rval += '\\r\\n';\n  }\n\n  // add body\n  rval += forge.util.encode64(msg.body, options.maxline || 64) + '\\r\\n';\n\n  rval += '-----END ' + msg.type + '-----\\r\\n';\n  return rval;\n};\n\n/**\n * Decodes (deserializes) all PEM messages found in the given string.\n *\n * @param str the PEM-formatted string to decode.\n *\n * @return the PEM message objects in an array.\n */\npem.decode = function(str) {\n  var rval = [];\n\n  // split string into PEM messages (be lenient w/EOF on BEGIN line)\n  var rMessage = /\\s*-----BEGIN ([A-Z0-9- ]+)-----\\r?\\n?([\\x21-\\x7e\\s]+?(?:\\r?\\n\\r?\\n))?([:A-Za-z0-9+\\/=\\s]+?)-----END \\1-----/g;\n  var rHeader = /([\\x21-\\x7e]+):\\s*([\\x21-\\x7e\\s^:]+)/;\n  var rCRLF = /\\r?\\n/;\n  var match;\n  while(true) {\n    match = rMessage.exec(str);\n    if(!match) {\n      break;\n    }\n\n    var msg = {\n      type: match[1],\n      procType: null,\n      contentDomain: null,\n      dekInfo: null,\n      headers: [],\n      body: forge.util.decode64(match[3])\n    };\n    rval.push(msg);\n\n    // no headers\n    if(!match[2]) {\n      continue;\n    }\n\n    // parse headers\n    var lines = match[2].split(rCRLF);\n    var li = 0;\n    while(match && li < lines.length) {\n      // get line, trim any rhs whitespace\n      var line = lines[li].replace(/\\s+$/, '');\n\n      // RFC2822 unfold any following folded lines\n      for(var nl = li + 1; nl < lines.length; ++nl) {\n        var next = lines[nl];\n        if(!/\\s/.test(next[0])) {\n          break;\n        }\n        line += next;\n        li = nl;\n      }\n\n      // parse header\n      match = line.match(rHeader);\n      if(match) {\n        var header = {name: match[1], values: []};\n        var values = match[2].split(',');\n        for(var vi = 0; vi < values.length; ++vi) {\n          header.values.push(ltrim(values[vi]));\n        }\n\n        // Proc-Type must be the first header\n        if(!msg.procType) {\n          if(header.name !== 'Proc-Type') {\n            throw new Error('Invalid PEM formatted message. The first ' +\n              'encapsulated header must be \"Proc-Type\".');\n          } else if(header.values.length !== 2) {\n            throw new Error('Invalid PEM formatted message. The \"Proc-Type\" ' +\n              'header must have two subfields.');\n          }\n          msg.procType = {version: values[0], type: values[1]};\n        } else if(!msg.contentDomain && header.name === 'Content-Domain') {\n          // special-case Content-Domain\n          msg.contentDomain = values[0] || '';\n        } else if(!msg.dekInfo && header.name === 'DEK-Info') {\n          // special-case DEK-Info\n          if(header.values.length === 0) {\n            throw new Error('Invalid PEM formatted message. The \"DEK-Info\" ' +\n              'header must have at least one subfield.');\n          }\n          msg.dekInfo = {algorithm: values[0], parameters: values[1] || null};\n        } else {\n          msg.headers.push(header);\n        }\n      }\n\n      ++li;\n    }\n\n    if(msg.procType === 'ENCRYPTED' && !msg.dekInfo) {\n      throw new Error('Invalid PEM formatted message. The \"DEK-Info\" ' +\n        'header must be present if \"Proc-Type\" is \"ENCRYPTED\".');\n    }\n  }\n\n  if(rval.length === 0) {\n    throw new Error('Invalid PEM formatted message.');\n  }\n\n  return rval;\n};\n\nfunction foldHeader(header) {\n  var rval = header.name + ': ';\n\n  // ensure values with CRLF are folded\n  var values = [];\n  var insertSpace = function(match, $1) {\n    return ' ' + $1;\n  };\n  for(var i = 0; i < header.values.length; ++i) {\n    values.push(header.values[i].replace(/^(\\S+\\r\\n)/, insertSpace));\n  }\n  rval += values.join(',') + '\\r\\n';\n\n  // do folding\n  var length = 0;\n  var candidate = -1;\n  for(var i = 0; i < rval.length; ++i, ++length) {\n    if(length > 65 && candidate !== -1) {\n      var insert = rval[candidate];\n      if(insert === ',') {\n        ++candidate;\n        rval = rval.substr(0, candidate) + '\\r\\n ' + rval.substr(candidate);\n      } else {\n        rval = rval.substr(0, candidate) +\n          '\\r\\n' + insert + rval.substr(candidate + 1);\n      }\n      length = (i - candidate - 1);\n      candidate = -1;\n      ++i;\n    } else if(rval[i] === ' ' || rval[i] === '\\t' || rval[i] === ',') {\n      candidate = i;\n    }\n  }\n\n  return rval;\n}\n\nfunction ltrim(str) {\n  return str.replace(/^\\s+/, '');\n}\n","/**\n * An API for getting cryptographically-secure random bytes. The bytes are\n * generated using the Fortuna algorithm devised by Bruce Schneier and\n * Niels Ferguson.\n *\n * Getting strong random bytes is not yet easy to do in javascript. The only\n * truish random entropy that can be collected is from the mouse, keyboard, or\n * from timing with respect to page loads, etc. This generator makes a poor\n * attempt at providing random bytes when those sources haven't yet provided\n * enough entropy to initially seed or to reseed the PRNG.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2009-2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./aes');\nrequire('./sha256');\nrequire('./prng');\nrequire('./util');\n\n(function() {\n\n// forge.random already defined\nif(forge.random && forge.random.getBytes) {\n  module.exports = forge.random;\n  return;\n}\n\n(function(jQuery) {\n\n// the default prng plugin, uses AES-128\nvar prng_aes = {};\nvar _prng_aes_output = new Array(4);\nvar _prng_aes_buffer = forge.util.createBuffer();\nprng_aes.formatKey = function(key) {\n  // convert the key into 32-bit integers\n  var tmp = forge.util.createBuffer(key);\n  key = new Array(4);\n  key[0] = tmp.getInt32();\n  key[1] = tmp.getInt32();\n  key[2] = tmp.getInt32();\n  key[3] = tmp.getInt32();\n\n  // return the expanded key\n  return forge.aes._expandKey(key, false);\n};\nprng_aes.formatSeed = function(seed) {\n  // convert seed into 32-bit integers\n  var tmp = forge.util.createBuffer(seed);\n  seed = new Array(4);\n  seed[0] = tmp.getInt32();\n  seed[1] = tmp.getInt32();\n  seed[2] = tmp.getInt32();\n  seed[3] = tmp.getInt32();\n  return seed;\n};\nprng_aes.cipher = function(key, seed) {\n  forge.aes._updateBlock(key, seed, _prng_aes_output, false);\n  _prng_aes_buffer.putInt32(_prng_aes_output[0]);\n  _prng_aes_buffer.putInt32(_prng_aes_output[1]);\n  _prng_aes_buffer.putInt32(_prng_aes_output[2]);\n  _prng_aes_buffer.putInt32(_prng_aes_output[3]);\n  return _prng_aes_buffer.getBytes();\n};\nprng_aes.increment = function(seed) {\n  // FIXME: do we care about carry or signed issues?\n  ++seed[3];\n  return seed;\n};\nprng_aes.md = forge.md.sha256;\n\n/**\n * Creates a new PRNG.\n */\nfunction spawnPrng() {\n  var ctx = forge.prng.create(prng_aes);\n\n  /**\n   * Gets random bytes. If a native secure crypto API is unavailable, this\n   * method tries to make the bytes more unpredictable by drawing from data that\n   * can be collected from the user of the browser, eg: mouse movement.\n   *\n   * If a callback is given, this method will be called asynchronously.\n   *\n   * @param count the number of random bytes to get.\n   * @param [callback(err, bytes)] called once the operation completes.\n   *\n   * @return the random bytes in a string.\n   */\n  ctx.getBytes = function(count, callback) {\n    return ctx.generate(count, callback);\n  };\n\n  /**\n   * Gets random bytes asynchronously. If a native secure crypto API is\n   * unavailable, this method tries to make the bytes more unpredictable by\n   * drawing from data that can be collected from the user of the browser,\n   * eg: mouse movement.\n   *\n   * @param count the number of random bytes to get.\n   *\n   * @return the random bytes in a string.\n   */\n  ctx.getBytesSync = function(count) {\n    return ctx.generate(count);\n  };\n\n  return ctx;\n}\n\n// create default prng context\nvar _ctx = spawnPrng();\n\n// add other sources of entropy only if window.crypto.getRandomValues is not\n// available -- otherwise this source will be automatically used by the prng\nvar getRandomValues = null;\nvar globalScope = forge.util.globalScope;\nvar _crypto = globalScope.crypto || globalScope.msCrypto;\nif(_crypto && _crypto.getRandomValues) {\n  getRandomValues = function(arr) {\n    return _crypto.getRandomValues(arr);\n  };\n}\n\nif(forge.options.usePureJavaScript ||\n  (!forge.util.isNodejs && !getRandomValues)) {\n  // if this is a web worker, do not use weak entropy, instead register to\n  // receive strong entropy asynchronously from the main thread\n  if(typeof window === 'undefined' || window.document === undefined) {\n    // FIXME:\n  }\n\n  // get load time entropy\n  _ctx.collectInt(+new Date(), 32);\n\n  // add some entropy from navigator object\n  if(typeof(navigator) !== 'undefined') {\n    var _navBytes = '';\n    for(var key in navigator) {\n      try {\n        if(typeof(navigator[key]) == 'string') {\n          _navBytes += navigator[key];\n        }\n      } catch(e) {\n        /* Some navigator keys might not be accessible, e.g. the geolocation\n          attribute throws an exception if touched in Mozilla chrome://\n          context.\n\n          Silently ignore this and just don't use this as a source of\n          entropy. */\n      }\n    }\n    _ctx.collect(_navBytes);\n    _navBytes = null;\n  }\n\n  // add mouse and keyboard collectors if jquery is available\n  if(jQuery) {\n    // set up mouse entropy capture\n    jQuery().mousemove(function(e) {\n      // add mouse coords\n      _ctx.collectInt(e.clientX, 16);\n      _ctx.collectInt(e.clientY, 16);\n    });\n\n    // set up keyboard entropy capture\n    jQuery().keypress(function(e) {\n      _ctx.collectInt(e.charCode, 8);\n    });\n  }\n}\n\n/* Random API */\nif(!forge.random) {\n  forge.random = _ctx;\n} else {\n  // extend forge.random with _ctx\n  for(var key in _ctx) {\n    forge.random[key] = _ctx[key];\n  }\n}\n\n// expose spawn PRNG\nforge.random.createInstance = spawnPrng;\n\nmodule.exports = forge.random;\n\n})(typeof(jQuery) !== 'undefined' ? jQuery : null);\n\n})();\n","/**\n * Secure Hash Algorithm with 256-bit digest (SHA-256) implementation.\n *\n * See FIPS 180-2 for details.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2015 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./md');\nrequire('./util');\n\nvar sha256 = module.exports = forge.sha256 = forge.sha256 || {};\nforge.md.sha256 = forge.md.algorithms.sha256 = sha256;\n\n/**\n * Creates a SHA-256 message digest object.\n *\n * @return a message digest object.\n */\nsha256.create = function() {\n  // do initialization as necessary\n  if(!_initialized) {\n    _init();\n  }\n\n  // SHA-256 state contains eight 32-bit integers\n  var _state = null;\n\n  // input buffer\n  var _input = forge.util.createBuffer();\n\n  // used for word storage\n  var _w = new Array(64);\n\n  // message digest object\n  var md = {\n    algorithm: 'sha256',\n    blockLength: 64,\n    digestLength: 32,\n    // 56-bit length of message so far (does not including padding)\n    messageLength: 0,\n    // true message length\n    fullMessageLength: null,\n    // size of message length in bytes\n    messageLengthSize: 8\n  };\n\n  /**\n   * Starts the digest.\n   *\n   * @return this digest object.\n   */\n  md.start = function() {\n    // up to 56-bit message length for convenience\n    md.messageLength = 0;\n\n    // full message length (set md.messageLength64 for backwards-compatibility)\n    md.fullMessageLength = md.messageLength64 = [];\n    var int32s = md.messageLengthSize / 4;\n    for(var i = 0; i < int32s; ++i) {\n      md.fullMessageLength.push(0);\n    }\n    _input = forge.util.createBuffer();\n    _state = {\n      h0: 0x6A09E667,\n      h1: 0xBB67AE85,\n      h2: 0x3C6EF372,\n      h3: 0xA54FF53A,\n      h4: 0x510E527F,\n      h5: 0x9B05688C,\n      h6: 0x1F83D9AB,\n      h7: 0x5BE0CD19\n    };\n    return md;\n  };\n  // start digest automatically for first time\n  md.start();\n\n  /**\n   * Updates the digest with the given message input. The given input can\n   * treated as raw input (no encoding will be applied) or an encoding of\n   * 'utf8' maybe given to encode the input using UTF-8.\n   *\n   * @param msg the message input to update with.\n   * @param encoding the encoding to use (default: 'raw', other: 'utf8').\n   *\n   * @return this digest object.\n   */\n  md.update = function(msg, encoding) {\n    if(encoding === 'utf8') {\n      msg = forge.util.encodeUtf8(msg);\n    }\n\n    // update message length\n    var len = msg.length;\n    md.messageLength += len;\n    len = [(len / 0x100000000) >>> 0, len >>> 0];\n    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {\n      md.fullMessageLength[i] += len[1];\n      len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);\n      md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;\n      len[0] = ((len[1] / 0x100000000) >>> 0);\n    }\n\n    // add bytes to input buffer\n    _input.putBytes(msg);\n\n    // process bytes\n    _update(_state, _w, _input);\n\n    // compact input buffer every 2K or if empty\n    if(_input.read > 2048 || _input.length() === 0) {\n      _input.compact();\n    }\n\n    return md;\n  };\n\n  /**\n   * Produces the digest.\n   *\n   * @return a byte buffer containing the digest value.\n   */\n  md.digest = function() {\n    /* Note: Here we copy the remaining bytes in the input buffer and\n    add the appropriate SHA-256 padding. Then we do the final update\n    on a copy of the state so that if the user wants to get\n    intermediate digests they can do so. */\n\n    /* Determine the number of bytes that must be added to the message\n    to ensure its length is congruent to 448 mod 512. In other words,\n    the data to be digested must be a multiple of 512 bits (or 128 bytes).\n    This data includes the message, some padding, and the length of the\n    message. Since the length of the message will be encoded as 8 bytes (64\n    bits), that means that the last segment of the data must have 56 bytes\n    (448 bits) of message and padding. Therefore, the length of the message\n    plus the padding must be congruent to 448 mod 512 because\n    512 - 128 = 448.\n\n    In order to fill up the message length it must be filled with\n    padding that begins with 1 bit followed by all 0 bits. Padding\n    must *always* be present, so if the message length is already\n    congruent to 448 mod 512, then 512 padding bits must be added. */\n\n    var finalBlock = forge.util.createBuffer();\n    finalBlock.putBytes(_input.bytes());\n\n    // compute remaining size to be digested (include message length size)\n    var remaining = (\n      md.fullMessageLength[md.fullMessageLength.length - 1] +\n      md.messageLengthSize);\n\n    // add padding for overflow blockSize - overflow\n    // _padding starts with 1 byte with first bit is set (byte value 128), then\n    // there may be up to (blockSize - 1) other pad bytes\n    var overflow = remaining & (md.blockLength - 1);\n    finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));\n\n    // serialize message length in bits in big-endian order; since length\n    // is stored in bytes we multiply by 8 and add carry from next int\n    var next, carry;\n    var bits = md.fullMessageLength[0] * 8;\n    for(var i = 0; i < md.fullMessageLength.length - 1; ++i) {\n      next = md.fullMessageLength[i + 1] * 8;\n      carry = (next / 0x100000000) >>> 0;\n      bits += carry;\n      finalBlock.putInt32(bits >>> 0);\n      bits = next >>> 0;\n    }\n    finalBlock.putInt32(bits);\n\n    var s2 = {\n      h0: _state.h0,\n      h1: _state.h1,\n      h2: _state.h2,\n      h3: _state.h3,\n      h4: _state.h4,\n      h5: _state.h5,\n      h6: _state.h6,\n      h7: _state.h7\n    };\n    _update(s2, _w, finalBlock);\n    var rval = forge.util.createBuffer();\n    rval.putInt32(s2.h0);\n    rval.putInt32(s2.h1);\n    rval.putInt32(s2.h2);\n    rval.putInt32(s2.h3);\n    rval.putInt32(s2.h4);\n    rval.putInt32(s2.h5);\n    rval.putInt32(s2.h6);\n    rval.putInt32(s2.h7);\n    return rval;\n  };\n\n  return md;\n};\n\n// sha-256 padding bytes not initialized yet\nvar _padding = null;\nvar _initialized = false;\n\n// table of constants\nvar _k = null;\n\n/**\n * Initializes the constant tables.\n */\nfunction _init() {\n  // create padding\n  _padding = String.fromCharCode(128);\n  _padding += forge.util.fillString(String.fromCharCode(0x00), 64);\n\n  // create K table for SHA-256\n  _k = [\n    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,\n    0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n    0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,\n    0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,\n    0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n    0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,\n    0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,\n    0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n    0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2];\n\n  // now initialized\n  _initialized = true;\n}\n\n/**\n * Updates a SHA-256 state with the given byte buffer.\n *\n * @param s the SHA-256 state to update.\n * @param w the array to use to store words.\n * @param bytes the byte buffer to update with.\n */\nfunction _update(s, w, bytes) {\n  // consume 512 bit (64 byte) chunks\n  var t1, t2, s0, s1, ch, maj, i, a, b, c, d, e, f, g, h;\n  var len = bytes.length();\n  while(len >= 64) {\n    // the w array will be populated with sixteen 32-bit big-endian words\n    // and then extended into 64 32-bit words according to SHA-256\n    for(i = 0; i < 16; ++i) {\n      w[i] = bytes.getInt32();\n    }\n    for(; i < 64; ++i) {\n      // XOR word 2 words ago rot right 17, rot right 19, shft right 10\n      t1 = w[i - 2];\n      t1 =\n        ((t1 >>> 17) | (t1 << 15)) ^\n        ((t1 >>> 19) | (t1 << 13)) ^\n        (t1 >>> 10);\n      // XOR word 15 words ago rot right 7, rot right 18, shft right 3\n      t2 = w[i - 15];\n      t2 =\n        ((t2 >>> 7) | (t2 << 25)) ^\n        ((t2 >>> 18) | (t2 << 14)) ^\n        (t2 >>> 3);\n      // sum(t1, word 7 ago, t2, word 16 ago) modulo 2^32\n      w[i] = (t1 + w[i - 7] + t2 + w[i - 16]) | 0;\n    }\n\n    // initialize hash value for this chunk\n    a = s.h0;\n    b = s.h1;\n    c = s.h2;\n    d = s.h3;\n    e = s.h4;\n    f = s.h5;\n    g = s.h6;\n    h = s.h7;\n\n    // round function\n    for(i = 0; i < 64; ++i) {\n      // Sum1(e)\n      s1 =\n        ((e >>> 6) | (e << 26)) ^\n        ((e >>> 11) | (e << 21)) ^\n        ((e >>> 25) | (e << 7));\n      // Ch(e, f, g) (optimized the same way as SHA-1)\n      ch = g ^ (e & (f ^ g));\n      // Sum0(a)\n      s0 =\n        ((a >>> 2) | (a << 30)) ^\n        ((a >>> 13) | (a << 19)) ^\n        ((a >>> 22) | (a << 10));\n      // Maj(a, b, c) (optimized the same way as SHA-1)\n      maj = (a & b) | (c & (a ^ b));\n\n      // main algorithm\n      t1 = h + s1 + ch + _k[i] + w[i];\n      t2 = s0 + maj;\n      h = g;\n      g = f;\n      f = e;\n      // `>>> 0` necessary to avoid iOS/Safari 10 optimization bug\n      // can't truncate with `| 0`\n      e = (d + t1) >>> 0;\n      d = c;\n      c = b;\n      b = a;\n      // `>>> 0` necessary to avoid iOS/Safari 10 optimization bug\n      // can't truncate with `| 0`\n      a = (t1 + t2) >>> 0;\n    }\n\n    // update hash state\n    s.h0 = (s.h0 + a) | 0;\n    s.h1 = (s.h1 + b) | 0;\n    s.h2 = (s.h2 + c) | 0;\n    s.h3 = (s.h3 + d) | 0;\n    s.h4 = (s.h4 + e) | 0;\n    s.h5 = (s.h5 + f) | 0;\n    s.h6 = (s.h6 + g) | 0;\n    s.h7 = (s.h7 + h) | 0;\n    len -= 64;\n  }\n}\n","/**\n * A javascript implementation of a cryptographically-secure\n * Pseudo Random Number Generator (PRNG). The Fortuna algorithm is followed\n * here though the use of SHA-256 is not enforced; when generating an\n * a PRNG context, the hashing algorithm and block cipher used for\n * the generator are specified via a plugin.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\n\nvar _crypto = null;\nif(forge.util.isNodejs && !forge.options.usePureJavaScript &&\n  !process.versions['node-webkit']) {\n  _crypto = require('crypto');\n}\n\n/* PRNG API */\nvar prng = module.exports = forge.prng = forge.prng || {};\n\n/**\n * Creates a new PRNG context.\n *\n * A PRNG plugin must be passed in that will provide:\n *\n * 1. A function that initializes the key and seed of a PRNG context. It\n *   will be given a 16 byte key and a 16 byte seed. Any key expansion\n *   or transformation of the seed from a byte string into an array of\n *   integers (or similar) should be performed.\n * 2. The cryptographic function used by the generator. It takes a key and\n *   a seed.\n * 3. A seed increment function. It takes the seed and returns seed + 1.\n * 4. An api to create a message digest.\n *\n * For an example, see random.js.\n *\n * @param plugin the PRNG plugin to use.\n */\nprng.create = function(plugin) {\n  var ctx = {\n    plugin: plugin,\n    key: null,\n    seed: null,\n    time: null,\n    // number of reseeds so far\n    reseeds: 0,\n    // amount of data generated so far\n    generated: 0,\n    // no initial key bytes\n    keyBytes: ''\n  };\n\n  // create 32 entropy pools (each is a message digest)\n  var md = plugin.md;\n  var pools = new Array(32);\n  for(var i = 0; i < 32; ++i) {\n    pools[i] = md.create();\n  }\n  ctx.pools = pools;\n\n  // entropy pools are written to cyclically, starting at index 0\n  ctx.pool = 0;\n\n  /**\n   * Generates random bytes. The bytes may be generated synchronously or\n   * asynchronously. Web workers must use the asynchronous interface or\n   * else the behavior is undefined.\n   *\n   * @param count the number of random bytes to generate.\n   * @param [callback(err, bytes)] called once the operation completes.\n   *\n   * @return count random bytes as a string.\n   */\n  ctx.generate = function(count, callback) {\n    // do synchronously\n    if(!callback) {\n      return ctx.generateSync(count);\n    }\n\n    // simple generator using counter-based CBC\n    var cipher = ctx.plugin.cipher;\n    var increment = ctx.plugin.increment;\n    var formatKey = ctx.plugin.formatKey;\n    var formatSeed = ctx.plugin.formatSeed;\n    var b = forge.util.createBuffer();\n\n    // paranoid deviation from Fortuna:\n    // reset key for every request to protect previously\n    // generated random bytes should the key be discovered;\n    // there is no 100ms based reseeding because of this\n    // forced reseed for every `generate` call\n    ctx.key = null;\n\n    generate();\n\n    function generate(err) {\n      if(err) {\n        return callback(err);\n      }\n\n      // sufficient bytes generated\n      if(b.length() >= count) {\n        return callback(null, b.getBytes(count));\n      }\n\n      // if amount of data generated is greater than 1 MiB, trigger reseed\n      if(ctx.generated > 0xfffff) {\n        ctx.key = null;\n      }\n\n      if(ctx.key === null) {\n        // prevent stack overflow\n        return forge.util.nextTick(function() {\n          _reseed(generate);\n        });\n      }\n\n      // generate the random bytes\n      var bytes = cipher(ctx.key, ctx.seed);\n      ctx.generated += bytes.length;\n      b.putBytes(bytes);\n\n      // generate bytes for a new key and seed\n      ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));\n      ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));\n\n      forge.util.setImmediate(generate);\n    }\n  };\n\n  /**\n   * Generates random bytes synchronously.\n   *\n   * @param count the number of random bytes to generate.\n   *\n   * @return count random bytes as a string.\n   */\n  ctx.generateSync = function(count) {\n    // simple generator using counter-based CBC\n    var cipher = ctx.plugin.cipher;\n    var increment = ctx.plugin.increment;\n    var formatKey = ctx.plugin.formatKey;\n    var formatSeed = ctx.plugin.formatSeed;\n\n    // paranoid deviation from Fortuna:\n    // reset key for every request to protect previously\n    // generated random bytes should the key be discovered;\n    // there is no 100ms based reseeding because of this\n    // forced reseed for every `generateSync` call\n    ctx.key = null;\n\n    var b = forge.util.createBuffer();\n    while(b.length() < count) {\n      // if amount of data generated is greater than 1 MiB, trigger reseed\n      if(ctx.generated > 0xfffff) {\n        ctx.key = null;\n      }\n\n      if(ctx.key === null) {\n        _reseedSync();\n      }\n\n      // generate the random bytes\n      var bytes = cipher(ctx.key, ctx.seed);\n      ctx.generated += bytes.length;\n      b.putBytes(bytes);\n\n      // generate bytes for a new key and seed\n      ctx.key = formatKey(cipher(ctx.key, increment(ctx.seed)));\n      ctx.seed = formatSeed(cipher(ctx.key, ctx.seed));\n    }\n\n    return b.getBytes(count);\n  };\n\n  /**\n   * Private function that asynchronously reseeds a generator.\n   *\n   * @param callback(err) called once the operation completes.\n   */\n  function _reseed(callback) {\n    if(ctx.pools[0].messageLength >= 32) {\n      _seed();\n      return callback();\n    }\n    // not enough seed data...\n    var needed = (32 - ctx.pools[0].messageLength) << 5;\n    ctx.seedFile(needed, function(err, bytes) {\n      if(err) {\n        return callback(err);\n      }\n      ctx.collect(bytes);\n      _seed();\n      callback();\n    });\n  }\n\n  /**\n   * Private function that synchronously reseeds a generator.\n   */\n  function _reseedSync() {\n    if(ctx.pools[0].messageLength >= 32) {\n      return _seed();\n    }\n    // not enough seed data...\n    var needed = (32 - ctx.pools[0].messageLength) << 5;\n    ctx.collect(ctx.seedFileSync(needed));\n    _seed();\n  }\n\n  /**\n   * Private function that seeds a generator once enough bytes are available.\n   */\n  function _seed() {\n    // update reseed count\n    ctx.reseeds = (ctx.reseeds === 0xffffffff) ? 0 : ctx.reseeds + 1;\n\n    // goal is to update `key` via:\n    // key = hash(key + s)\n    //   where 's' is all collected entropy from selected pools, then...\n\n    // create a plugin-based message digest\n    var md = ctx.plugin.md.create();\n\n    // consume current key bytes\n    md.update(ctx.keyBytes);\n\n    // digest the entropy of pools whose index k meet the\n    // condition 'n mod 2^k == 0' where n is the number of reseeds\n    var _2powK = 1;\n    for(var k = 0; k < 32; ++k) {\n      if(ctx.reseeds % _2powK === 0) {\n        md.update(ctx.pools[k].digest().getBytes());\n        ctx.pools[k].start();\n      }\n      _2powK = _2powK << 1;\n    }\n\n    // get digest for key bytes\n    ctx.keyBytes = md.digest().getBytes();\n\n    // paranoid deviation from Fortuna:\n    // update `seed` via `seed = hash(key)`\n    // instead of initializing to zero once and only\n    // ever incrementing it\n    md.start();\n    md.update(ctx.keyBytes);\n    var seedBytes = md.digest().getBytes();\n\n    // update state\n    ctx.key = ctx.plugin.formatKey(ctx.keyBytes);\n    ctx.seed = ctx.plugin.formatSeed(seedBytes);\n    ctx.generated = 0;\n  }\n\n  /**\n   * The built-in default seedFile. This seedFile is used when entropy\n   * is needed immediately.\n   *\n   * @param needed the number of bytes that are needed.\n   *\n   * @return the random bytes.\n   */\n  function defaultSeedFile(needed) {\n    // use window.crypto.getRandomValues strong source of entropy if available\n    var getRandomValues = null;\n    var globalScope = forge.util.globalScope;\n    var _crypto = globalScope.crypto || globalScope.msCrypto;\n    if(_crypto && _crypto.getRandomValues) {\n      getRandomValues = function(arr) {\n        return _crypto.getRandomValues(arr);\n      };\n    }\n\n    var b = forge.util.createBuffer();\n    if(getRandomValues) {\n      while(b.length() < needed) {\n        // max byte length is 65536 before QuotaExceededError is thrown\n        // http://www.w3.org/TR/WebCryptoAPI/#RandomSource-method-getRandomValues\n        var count = Math.max(1, Math.min(needed - b.length(), 65536) / 4);\n        var entropy = new Uint32Array(Math.floor(count));\n        try {\n          getRandomValues(entropy);\n          for(var i = 0; i < entropy.length; ++i) {\n            b.putInt32(entropy[i]);\n          }\n        } catch(e) {\n          /* only ignore QuotaExceededError */\n          if(!(typeof QuotaExceededError !== 'undefined' &&\n            e instanceof QuotaExceededError)) {\n            throw e;\n          }\n        }\n      }\n    }\n\n    // be sad and add some weak random data\n    if(b.length() < needed) {\n      /* Draws from Park-Miller \"minimal standard\" 31 bit PRNG,\n      implemented with David G. Carta's optimization: with 32 bit math\n      and without division (Public Domain). */\n      var hi, lo, next;\n      var seed = Math.floor(Math.random() * 0x010000);\n      while(b.length() < needed) {\n        lo = 16807 * (seed & 0xFFFF);\n        hi = 16807 * (seed >> 16);\n        lo += (hi & 0x7FFF) << 16;\n        lo += hi >> 15;\n        lo = (lo & 0x7FFFFFFF) + (lo >> 31);\n        seed = lo & 0xFFFFFFFF;\n\n        // consume lower 3 bytes of seed\n        for(var i = 0; i < 3; ++i) {\n          // throw in more pseudo random\n          next = seed >>> (i << 3);\n          next ^= Math.floor(Math.random() * 0x0100);\n          b.putByte(String.fromCharCode(next & 0xFF));\n        }\n      }\n    }\n\n    return b.getBytes(needed);\n  }\n  // initialize seed file APIs\n  if(_crypto) {\n    // use nodejs async API\n    ctx.seedFile = function(needed, callback) {\n      _crypto.randomBytes(needed, function(err, bytes) {\n        if(err) {\n          return callback(err);\n        }\n        callback(null, bytes.toString());\n      });\n    };\n    // use nodejs sync API\n    ctx.seedFileSync = function(needed) {\n      return _crypto.randomBytes(needed).toString();\n    };\n  } else {\n    ctx.seedFile = function(needed, callback) {\n      try {\n        callback(null, defaultSeedFile(needed));\n      } catch(e) {\n        callback(e);\n      }\n    };\n    ctx.seedFileSync = defaultSeedFile;\n  }\n\n  /**\n   * Adds entropy to a prng ctx's accumulator.\n   *\n   * @param bytes the bytes of entropy as a string.\n   */\n  ctx.collect = function(bytes) {\n    // iterate over pools distributing entropy cyclically\n    var count = bytes.length;\n    for(var i = 0; i < count; ++i) {\n      ctx.pools[ctx.pool].update(bytes.substr(i, 1));\n      ctx.pool = (ctx.pool === 31) ? 0 : ctx.pool + 1;\n    }\n  };\n\n  /**\n   * Collects an integer of n bits.\n   *\n   * @param i the integer entropy.\n   * @param n the number of bits in the integer.\n   */\n  ctx.collectInt = function(i, n) {\n    var bytes = '';\n    for(var x = 0; x < n; x += 8) {\n      bytes += String.fromCharCode((i >> x) & 0xFF);\n    }\n    ctx.collect(bytes);\n  };\n\n  /**\n   * Registers a Web Worker to receive immediate entropy from the main thread.\n   * This method is required until Web Workers can access the native crypto\n   * API. This method should be called twice for each created worker, once in\n   * the main thread, and once in the worker itself.\n   *\n   * @param worker the worker to register.\n   */\n  ctx.registerWorker = function(worker) {\n    // worker receives random bytes\n    if(worker === self) {\n      ctx.seedFile = function(needed, callback) {\n        function listener(e) {\n          var data = e.data;\n          if(data.forge && data.forge.prng) {\n            self.removeEventListener('message', listener);\n            callback(data.forge.prng.err, data.forge.prng.bytes);\n          }\n        }\n        self.addEventListener('message', listener);\n        self.postMessage({forge: {prng: {needed: needed}}});\n      };\n    } else {\n      // main thread sends random bytes upon request\n      var listener = function(e) {\n        var data = e.data;\n        if(data.forge && data.forge.prng) {\n          ctx.seedFile(data.forge.prng.needed, function(err, bytes) {\n            worker.postMessage({forge: {prng: {err: err, bytes: bytes}}});\n          });\n        }\n      };\n      // TODO: do we need to remove the event listener when the worker dies?\n      worker.addEventListener('message', listener);\n    }\n  };\n\n  return ctx;\n};\n","/**\n * RC2 implementation.\n *\n * @author Stefan Siegl\n *\n * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>\n *\n * Information on the RC2 cipher is available from RFC #2268,\n * http://www.ietf.org/rfc/rfc2268.txt\n */\nvar forge = require('./forge');\nrequire('./util');\n\nvar piTable = [\n  0xd9, 0x78, 0xf9, 0xc4, 0x19, 0xdd, 0xb5, 0xed, 0x28, 0xe9, 0xfd, 0x79, 0x4a, 0xa0, 0xd8, 0x9d,\n  0xc6, 0x7e, 0x37, 0x83, 0x2b, 0x76, 0x53, 0x8e, 0x62, 0x4c, 0x64, 0x88, 0x44, 0x8b, 0xfb, 0xa2,\n  0x17, 0x9a, 0x59, 0xf5, 0x87, 0xb3, 0x4f, 0x13, 0x61, 0x45, 0x6d, 0x8d, 0x09, 0x81, 0x7d, 0x32,\n  0xbd, 0x8f, 0x40, 0xeb, 0x86, 0xb7, 0x7b, 0x0b, 0xf0, 0x95, 0x21, 0x22, 0x5c, 0x6b, 0x4e, 0x82,\n  0x54, 0xd6, 0x65, 0x93, 0xce, 0x60, 0xb2, 0x1c, 0x73, 0x56, 0xc0, 0x14, 0xa7, 0x8c, 0xf1, 0xdc,\n  0x12, 0x75, 0xca, 0x1f, 0x3b, 0xbe, 0xe4, 0xd1, 0x42, 0x3d, 0xd4, 0x30, 0xa3, 0x3c, 0xb6, 0x26,\n  0x6f, 0xbf, 0x0e, 0xda, 0x46, 0x69, 0x07, 0x57, 0x27, 0xf2, 0x1d, 0x9b, 0xbc, 0x94, 0x43, 0x03,\n  0xf8, 0x11, 0xc7, 0xf6, 0x90, 0xef, 0x3e, 0xe7, 0x06, 0xc3, 0xd5, 0x2f, 0xc8, 0x66, 0x1e, 0xd7,\n  0x08, 0xe8, 0xea, 0xde, 0x80, 0x52, 0xee, 0xf7, 0x84, 0xaa, 0x72, 0xac, 0x35, 0x4d, 0x6a, 0x2a,\n  0x96, 0x1a, 0xd2, 0x71, 0x5a, 0x15, 0x49, 0x74, 0x4b, 0x9f, 0xd0, 0x5e, 0x04, 0x18, 0xa4, 0xec,\n  0xc2, 0xe0, 0x41, 0x6e, 0x0f, 0x51, 0xcb, 0xcc, 0x24, 0x91, 0xaf, 0x50, 0xa1, 0xf4, 0x70, 0x39,\n  0x99, 0x7c, 0x3a, 0x85, 0x23, 0xb8, 0xb4, 0x7a, 0xfc, 0x02, 0x36, 0x5b, 0x25, 0x55, 0x97, 0x31,\n  0x2d, 0x5d, 0xfa, 0x98, 0xe3, 0x8a, 0x92, 0xae, 0x05, 0xdf, 0x29, 0x10, 0x67, 0x6c, 0xba, 0xc9,\n  0xd3, 0x00, 0xe6, 0xcf, 0xe1, 0x9e, 0xa8, 0x2c, 0x63, 0x16, 0x01, 0x3f, 0x58, 0xe2, 0x89, 0xa9,\n  0x0d, 0x38, 0x34, 0x1b, 0xab, 0x33, 0xff, 0xb0, 0xbb, 0x48, 0x0c, 0x5f, 0xb9, 0xb1, 0xcd, 0x2e,\n  0xc5, 0xf3, 0xdb, 0x47, 0xe5, 0xa5, 0x9c, 0x77, 0x0a, 0xa6, 0x20, 0x68, 0xfe, 0x7f, 0xc1, 0xad\n];\n\nvar s = [1, 2, 3, 5];\n\n/**\n * Rotate a word left by given number of bits.\n *\n * Bits that are shifted out on the left are put back in on the right\n * hand side.\n *\n * @param word The word to shift left.\n * @param bits The number of bits to shift by.\n * @return The rotated word.\n */\nvar rol = function(word, bits) {\n  return ((word << bits) & 0xffff) | ((word & 0xffff) >> (16 - bits));\n};\n\n/**\n * Rotate a word right by given number of bits.\n *\n * Bits that are shifted out on the right are put back in on the left\n * hand side.\n *\n * @param word The word to shift right.\n * @param bits The number of bits to shift by.\n * @return The rotated word.\n */\nvar ror = function(word, bits) {\n  return ((word & 0xffff) >> bits) | ((word << (16 - bits)) & 0xffff);\n};\n\n/* RC2 API */\nmodule.exports = forge.rc2 = forge.rc2 || {};\n\n/**\n * Perform RC2 key expansion as per RFC #2268, section 2.\n *\n * @param key variable-length user key (between 1 and 128 bytes)\n * @param effKeyBits number of effective key bits (default: 128)\n * @return the expanded RC2 key (ByteBuffer of 128 bytes)\n */\nforge.rc2.expandKey = function(key, effKeyBits) {\n  if(typeof key === 'string') {\n    key = forge.util.createBuffer(key);\n  }\n  effKeyBits = effKeyBits || 128;\n\n  /* introduce variables that match the names used in RFC #2268 */\n  var L = key;\n  var T = key.length();\n  var T1 = effKeyBits;\n  var T8 = Math.ceil(T1 / 8);\n  var TM = 0xff >> (T1 & 0x07);\n  var i;\n\n  for(i = T; i < 128; i++) {\n    L.putByte(piTable[(L.at(i - 1) + L.at(i - T)) & 0xff]);\n  }\n\n  L.setAt(128 - T8, piTable[L.at(128 - T8) & TM]);\n\n  for(i = 127 - T8; i >= 0; i--) {\n    L.setAt(i, piTable[L.at(i + 1) ^ L.at(i + T8)]);\n  }\n\n  return L;\n};\n\n/**\n * Creates a RC2 cipher object.\n *\n * @param key the symmetric key to use (as base for key generation).\n * @param bits the number of effective key bits.\n * @param encrypt false for decryption, true for encryption.\n *\n * @return the cipher.\n */\nvar createCipher = function(key, bits, encrypt) {\n  var _finish = false, _input = null, _output = null, _iv = null;\n  var mixRound, mashRound;\n  var i, j, K = [];\n\n  /* Expand key and fill into K[] Array */\n  key = forge.rc2.expandKey(key, bits);\n  for(i = 0; i < 64; i++) {\n    K.push(key.getInt16Le());\n  }\n\n  if(encrypt) {\n    /**\n     * Perform one mixing round \"in place\".\n     *\n     * @param R Array of four words to perform mixing on.\n     */\n    mixRound = function(R) {\n      for(i = 0; i < 4; i++) {\n        R[i] += K[j] + (R[(i + 3) % 4] & R[(i + 2) % 4]) +\n          ((~R[(i + 3) % 4]) & R[(i + 1) % 4]);\n        R[i] = rol(R[i], s[i]);\n        j++;\n      }\n    };\n\n    /**\n     * Perform one mashing round \"in place\".\n     *\n     * @param R Array of four words to perform mashing on.\n     */\n    mashRound = function(R) {\n      for(i = 0; i < 4; i++) {\n        R[i] += K[R[(i + 3) % 4] & 63];\n      }\n    };\n  } else {\n    /**\n     * Perform one r-mixing round \"in place\".\n     *\n     * @param R Array of four words to perform mixing on.\n     */\n    mixRound = function(R) {\n      for(i = 3; i >= 0; i--) {\n        R[i] = ror(R[i], s[i]);\n        R[i] -= K[j] + (R[(i + 3) % 4] & R[(i + 2) % 4]) +\n          ((~R[(i + 3) % 4]) & R[(i + 1) % 4]);\n        j--;\n      }\n    };\n\n    /**\n     * Perform one r-mashing round \"in place\".\n     *\n     * @param R Array of four words to perform mashing on.\n     */\n    mashRound = function(R) {\n      for(i = 3; i >= 0; i--) {\n        R[i] -= K[R[(i + 3) % 4] & 63];\n      }\n    };\n  }\n\n  /**\n   * Run the specified cipher execution plan.\n   *\n   * This function takes four words from the input buffer, applies the IV on\n   * it (if requested) and runs the provided execution plan.\n   *\n   * The plan must be put together in form of a array of arrays.  Where the\n   * outer one is simply a list of steps to perform and the inner one needs\n   * to have two elements: the first one telling how many rounds to perform,\n   * the second one telling what to do (i.e. the function to call).\n   *\n   * @param {Array} plan The plan to execute.\n   */\n  var runPlan = function(plan) {\n    var R = [];\n\n    /* Get data from input buffer and fill the four words into R */\n    for(i = 0; i < 4; i++) {\n      var val = _input.getInt16Le();\n\n      if(_iv !== null) {\n        if(encrypt) {\n          /* We're encrypting, apply the IV first. */\n          val ^= _iv.getInt16Le();\n        } else {\n          /* We're decryption, keep cipher text for next block. */\n          _iv.putInt16Le(val);\n        }\n      }\n\n      R.push(val & 0xffff);\n    }\n\n    /* Reset global \"j\" variable as per spec. */\n    j = encrypt ? 0 : 63;\n\n    /* Run execution plan. */\n    for(var ptr = 0; ptr < plan.length; ptr++) {\n      for(var ctr = 0; ctr < plan[ptr][0]; ctr++) {\n        plan[ptr][1](R);\n      }\n    }\n\n    /* Write back result to output buffer. */\n    for(i = 0; i < 4; i++) {\n      if(_iv !== null) {\n        if(encrypt) {\n          /* We're encrypting in CBC-mode, feed back encrypted bytes into\n             IV buffer to carry it forward to next block. */\n          _iv.putInt16Le(R[i]);\n        } else {\n          R[i] ^= _iv.getInt16Le();\n        }\n      }\n\n      _output.putInt16Le(R[i]);\n    }\n  };\n\n  /* Create cipher object */\n  var cipher = null;\n  cipher = {\n    /**\n     * Starts or restarts the encryption or decryption process, whichever\n     * was previously configured.\n     *\n     * To use the cipher in CBC mode, iv may be given either as a string\n     * of bytes, or as a byte buffer.  For ECB mode, give null as iv.\n     *\n     * @param iv the initialization vector to use, null for ECB mode.\n     * @param output the output the buffer to write to, null to create one.\n     */\n    start: function(iv, output) {\n      if(iv) {\n        /* CBC mode */\n        if(typeof iv === 'string') {\n          iv = forge.util.createBuffer(iv);\n        }\n      }\n\n      _finish = false;\n      _input = forge.util.createBuffer();\n      _output = output || new forge.util.createBuffer();\n      _iv = iv;\n\n      cipher.output = _output;\n    },\n\n    /**\n     * Updates the next block.\n     *\n     * @param input the buffer to read from.\n     */\n    update: function(input) {\n      if(!_finish) {\n        // not finishing, so fill the input buffer with more input\n        _input.putBuffer(input);\n      }\n\n      while(_input.length() >= 8) {\n        runPlan([\n            [ 5, mixRound ],\n            [ 1, mashRound ],\n            [ 6, mixRound ],\n            [ 1, mashRound ],\n            [ 5, mixRound ]\n          ]);\n      }\n    },\n\n    /**\n     * Finishes encrypting or decrypting.\n     *\n     * @param pad a padding function to use, null for PKCS#7 padding,\n     *           signature(blockSize, buffer, decrypt).\n     *\n     * @return true if successful, false on error.\n     */\n    finish: function(pad) {\n      var rval = true;\n\n      if(encrypt) {\n        if(pad) {\n          rval = pad(8, _input, !encrypt);\n        } else {\n          // add PKCS#7 padding to block (each pad byte is the\n          // value of the number of pad bytes)\n          var padding = (_input.length() === 8) ? 8 : (8 - _input.length());\n          _input.fillWithByte(padding, padding);\n        }\n      }\n\n      if(rval) {\n        // do final update\n        _finish = true;\n        cipher.update();\n      }\n\n      if(!encrypt) {\n        // check for error: input data not a multiple of block size\n        rval = (_input.length() === 0);\n        if(rval) {\n          if(pad) {\n            rval = pad(8, _output, !encrypt);\n          } else {\n            // ensure padding byte count is valid\n            var len = _output.length();\n            var count = _output.at(len - 1);\n\n            if(count > len) {\n              rval = false;\n            } else {\n              // trim off padding bytes\n              _output.truncate(count);\n            }\n          }\n        }\n      }\n\n      return rval;\n    }\n  };\n\n  return cipher;\n};\n\n/**\n * Creates an RC2 cipher object to encrypt data in ECB or CBC mode using the\n * given symmetric key. The output will be stored in the 'output' member\n * of the returned cipher.\n *\n * The key and iv may be given as a string of bytes or a byte buffer.\n * The cipher is initialized to use 128 effective key bits.\n *\n * @param key the symmetric key to use.\n * @param iv the initialization vector to use.\n * @param output the buffer to write to, null to create one.\n *\n * @return the cipher.\n */\nforge.rc2.startEncrypting = function(key, iv, output) {\n  var cipher = forge.rc2.createEncryptionCipher(key, 128);\n  cipher.start(iv, output);\n  return cipher;\n};\n\n/**\n * Creates an RC2 cipher object to encrypt data in ECB or CBC mode using the\n * given symmetric key.\n *\n * The key may be given as a string of bytes or a byte buffer.\n *\n * To start encrypting call start() on the cipher with an iv and optional\n * output buffer.\n *\n * @param key the symmetric key to use.\n *\n * @return the cipher.\n */\nforge.rc2.createEncryptionCipher = function(key, bits) {\n  return createCipher(key, bits, true);\n};\n\n/**\n * Creates an RC2 cipher object to decrypt data in ECB or CBC mode using the\n * given symmetric key. The output will be stored in the 'output' member\n * of the returned cipher.\n *\n * The key and iv may be given as a string of bytes or a byte buffer.\n * The cipher is initialized to use 128 effective key bits.\n *\n * @param key the symmetric key to use.\n * @param iv the initialization vector to use.\n * @param output the buffer to write to, null to create one.\n *\n * @return the cipher.\n */\nforge.rc2.startDecrypting = function(key, iv, output) {\n  var cipher = forge.rc2.createDecryptionCipher(key, 128);\n  cipher.start(iv, output);\n  return cipher;\n};\n\n/**\n * Creates an RC2 cipher object to decrypt data in ECB or CBC mode using the\n * given symmetric key.\n *\n * The key may be given as a string of bytes or a byte buffer.\n *\n * To start decrypting call start() on the cipher with an iv and optional\n * output buffer.\n *\n * @param key the symmetric key to use.\n *\n * @return the cipher.\n */\nforge.rc2.createDecryptionCipher = function(key, bits) {\n  return createCipher(key, bits, false);\n};\n","/**\n * Javascript implementation of basic RSA algorithms.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2014 Digital Bazaar, Inc.\n *\n * The only algorithm currently supported for PKI is RSA.\n *\n * An RSA key is often stored in ASN.1 DER format. The SubjectPublicKeyInfo\n * ASN.1 structure is composed of an algorithm of type AlgorithmIdentifier\n * and a subjectPublicKey of type bit string.\n *\n * The AlgorithmIdentifier contains an Object Identifier (OID) and parameters\n * for the algorithm, if any. In the case of RSA, there aren't any.\n *\n * SubjectPublicKeyInfo ::= SEQUENCE {\n *   algorithm AlgorithmIdentifier,\n *   subjectPublicKey BIT STRING\n * }\n *\n * AlgorithmIdentifer ::= SEQUENCE {\n *   algorithm OBJECT IDENTIFIER,\n *   parameters ANY DEFINED BY algorithm OPTIONAL\n * }\n *\n * For an RSA public key, the subjectPublicKey is:\n *\n * RSAPublicKey ::= SEQUENCE {\n *   modulus            INTEGER,    -- n\n *   publicExponent     INTEGER     -- e\n * }\n *\n * PrivateKeyInfo ::= SEQUENCE {\n *   version                   Version,\n *   privateKeyAlgorithm       PrivateKeyAlgorithmIdentifier,\n *   privateKey                PrivateKey,\n *   attributes           [0]  IMPLICIT Attributes OPTIONAL\n * }\n *\n * Version ::= INTEGER\n * PrivateKeyAlgorithmIdentifier ::= AlgorithmIdentifier\n * PrivateKey ::= OCTET STRING\n * Attributes ::= SET OF Attribute\n *\n * An RSA private key as the following structure:\n *\n * RSAPrivateKey ::= SEQUENCE {\n *   version Version,\n *   modulus INTEGER, -- n\n *   publicExponent INTEGER, -- e\n *   privateExponent INTEGER, -- d\n *   prime1 INTEGER, -- p\n *   prime2 INTEGER, -- q\n *   exponent1 INTEGER, -- d mod (p-1)\n *   exponent2 INTEGER, -- d mod (q-1)\n *   coefficient INTEGER -- (inverse of q) mod p\n * }\n *\n * Version ::= INTEGER\n *\n * The OID for the RSA key algorithm is: 1.2.840.113549.1.1.1\n */\nvar forge = require('./forge');\nrequire('./asn1');\nrequire('./jsbn');\nrequire('./oids');\nrequire('./pkcs1');\nrequire('./prime');\nrequire('./random');\nrequire('./util');\n\nif(typeof BigInteger === 'undefined') {\n  var BigInteger = forge.jsbn.BigInteger;\n}\n\nvar _crypto = forge.util.isNodejs ? require('crypto') : null;\n\n// shortcut for asn.1 API\nvar asn1 = forge.asn1;\n\n// shortcut for util API\nvar util = forge.util;\n\n/*\n * RSA encryption and decryption, see RFC 2313.\n */\nforge.pki = forge.pki || {};\nmodule.exports = forge.pki.rsa = forge.rsa = forge.rsa || {};\nvar pki = forge.pki;\n\n// for finding primes, which are 30k+i for i = 1, 7, 11, 13, 17, 19, 23, 29\nvar GCD_30_DELTA = [6, 4, 2, 4, 2, 4, 6, 2];\n\n// validator for a PrivateKeyInfo structure\nvar privateKeyValidator = {\n  // PrivateKeyInfo\n  name: 'PrivateKeyInfo',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    // Version (INTEGER)\n    name: 'PrivateKeyInfo.version',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'privateKeyVersion'\n  }, {\n    // privateKeyAlgorithm\n    name: 'PrivateKeyInfo.privateKeyAlgorithm',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'AlgorithmIdentifier.algorithm',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OID,\n      constructed: false,\n      capture: 'privateKeyOid'\n    }]\n  }, {\n    // PrivateKey\n    name: 'PrivateKeyInfo',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.OCTETSTRING,\n    constructed: false,\n    capture: 'privateKey'\n  }]\n};\n\n// validator for an RSA private key\nvar rsaPrivateKeyValidator = {\n  // RSAPrivateKey\n  name: 'RSAPrivateKey',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    // Version (INTEGER)\n    name: 'RSAPrivateKey.version',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'privateKeyVersion'\n  }, {\n    // modulus (n)\n    name: 'RSAPrivateKey.modulus',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'privateKeyModulus'\n  }, {\n    // publicExponent (e)\n    name: 'RSAPrivateKey.publicExponent',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'privateKeyPublicExponent'\n  }, {\n    // privateExponent (d)\n    name: 'RSAPrivateKey.privateExponent',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'privateKeyPrivateExponent'\n  }, {\n    // prime1 (p)\n    name: 'RSAPrivateKey.prime1',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'privateKeyPrime1'\n  }, {\n    // prime2 (q)\n    name: 'RSAPrivateKey.prime2',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'privateKeyPrime2'\n  }, {\n    // exponent1 (d mod (p-1))\n    name: 'RSAPrivateKey.exponent1',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'privateKeyExponent1'\n  }, {\n    // exponent2 (d mod (q-1))\n    name: 'RSAPrivateKey.exponent2',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'privateKeyExponent2'\n  }, {\n    // coefficient ((inverse of q) mod p)\n    name: 'RSAPrivateKey.coefficient',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'privateKeyCoefficient'\n  }]\n};\n\n// validator for an RSA public key\nvar rsaPublicKeyValidator = {\n  // RSAPublicKey\n  name: 'RSAPublicKey',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    // modulus (n)\n    name: 'RSAPublicKey.modulus',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'publicKeyModulus'\n  }, {\n    // publicExponent (e)\n    name: 'RSAPublicKey.exponent',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'publicKeyExponent'\n  }]\n};\n\n// validator for an SubjectPublicKeyInfo structure\n// Note: Currently only works with an RSA public key\nvar publicKeyValidator = forge.pki.rsa.publicKeyValidator = {\n  name: 'SubjectPublicKeyInfo',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  captureAsn1: 'subjectPublicKeyInfo',\n  value: [{\n    name: 'SubjectPublicKeyInfo.AlgorithmIdentifier',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'AlgorithmIdentifier.algorithm',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OID,\n      constructed: false,\n      capture: 'publicKeyOid'\n    }]\n  }, {\n    // subjectPublicKey\n    name: 'SubjectPublicKeyInfo.subjectPublicKey',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.BITSTRING,\n    constructed: false,\n    value: [{\n      // RSAPublicKey\n      name: 'SubjectPublicKeyInfo.subjectPublicKey.RSAPublicKey',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      optional: true,\n      captureAsn1: 'rsaPublicKey'\n    }]\n  }]\n};\n\n/**\n * Wrap digest in DigestInfo object.\n *\n * This function implements EMSA-PKCS1-v1_5-ENCODE as per RFC 3447.\n *\n * DigestInfo ::= SEQUENCE {\n *   digestAlgorithm DigestAlgorithmIdentifier,\n *   digest Digest\n * }\n *\n * DigestAlgorithmIdentifier ::= AlgorithmIdentifier\n * Digest ::= OCTET STRING\n *\n * @param md the message digest object with the hash to sign.\n *\n * @return the encoded message (ready for RSA encrytion)\n */\nvar emsaPkcs1v15encode = function(md) {\n  // get the oid for the algorithm\n  var oid;\n  if(md.algorithm in pki.oids) {\n    oid = pki.oids[md.algorithm];\n  } else {\n    var error = new Error('Unknown message digest algorithm.');\n    error.algorithm = md.algorithm;\n    throw error;\n  }\n  var oidBytes = asn1.oidToDer(oid).getBytes();\n\n  // create the digest info\n  var digestInfo = asn1.create(\n    asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);\n  var digestAlgorithm = asn1.create(\n    asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);\n  digestAlgorithm.value.push(asn1.create(\n    asn1.Class.UNIVERSAL, asn1.Type.OID, false, oidBytes));\n  digestAlgorithm.value.push(asn1.create(\n    asn1.Class.UNIVERSAL, asn1.Type.NULL, false, ''));\n  var digest = asn1.create(\n    asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING,\n    false, md.digest().getBytes());\n  digestInfo.value.push(digestAlgorithm);\n  digestInfo.value.push(digest);\n\n  // encode digest info\n  return asn1.toDer(digestInfo).getBytes();\n};\n\n/**\n * Performs x^c mod n (RSA encryption or decryption operation).\n *\n * @param x the number to raise and mod.\n * @param key the key to use.\n * @param pub true if the key is public, false if private.\n *\n * @return the result of x^c mod n.\n */\nvar _modPow = function(x, key, pub) {\n  if(pub) {\n    return x.modPow(key.e, key.n);\n  }\n\n  if(!key.p || !key.q) {\n    // allow calculation without CRT params (slow)\n    return x.modPow(key.d, key.n);\n  }\n\n  // pre-compute dP, dQ, and qInv if necessary\n  if(!key.dP) {\n    key.dP = key.d.mod(key.p.subtract(BigInteger.ONE));\n  }\n  if(!key.dQ) {\n    key.dQ = key.d.mod(key.q.subtract(BigInteger.ONE));\n  }\n  if(!key.qInv) {\n    key.qInv = key.q.modInverse(key.p);\n  }\n\n  /* Chinese remainder theorem (CRT) states:\n\n    Suppose n1, n2, ..., nk are positive integers which are pairwise\n    coprime (n1 and n2 have no common factors other than 1). For any\n    integers x1, x2, ..., xk there exists an integer x solving the\n    system of simultaneous congruences (where ~= means modularly\n    congruent so a ~= b mod n means a mod n = b mod n):\n\n    x ~= x1 mod n1\n    x ~= x2 mod n2\n    ...\n    x ~= xk mod nk\n\n    This system of congruences has a single simultaneous solution x\n    between 0 and n - 1. Furthermore, each xk solution and x itself\n    is congruent modulo the product n = n1*n2*...*nk.\n    So x1 mod n = x2 mod n = xk mod n = x mod n.\n\n    The single simultaneous solution x can be solved with the following\n    equation:\n\n    x = sum(xi*ri*si) mod n where ri = n/ni and si = ri^-1 mod ni.\n\n    Where x is less than n, xi = x mod ni.\n\n    For RSA we are only concerned with k = 2. The modulus n = pq, where\n    p and q are coprime. The RSA decryption algorithm is:\n\n    y = x^d mod n\n\n    Given the above:\n\n    x1 = x^d mod p\n    r1 = n/p = q\n    s1 = q^-1 mod p\n    x2 = x^d mod q\n    r2 = n/q = p\n    s2 = p^-1 mod q\n\n    So y = (x1r1s1 + x2r2s2) mod n\n         = ((x^d mod p)q(q^-1 mod p) + (x^d mod q)p(p^-1 mod q)) mod n\n\n    According to Fermat's Little Theorem, if the modulus P is prime,\n    for any integer A not evenly divisible by P, A^(P-1) ~= 1 mod P.\n    Since A is not divisible by P it follows that if:\n    N ~= M mod (P - 1), then A^N mod P = A^M mod P. Therefore:\n\n    A^N mod P = A^(M mod (P - 1)) mod P. (The latter takes less effort\n    to calculate). In order to calculate x^d mod p more quickly the\n    exponent d mod (p - 1) is stored in the RSA private key (the same\n    is done for x^d mod q). These values are referred to as dP and dQ\n    respectively. Therefore we now have:\n\n    y = ((x^dP mod p)q(q^-1 mod p) + (x^dQ mod q)p(p^-1 mod q)) mod n\n\n    Since we'll be reducing x^dP by modulo p (same for q) we can also\n    reduce x by p (and q respectively) before hand. Therefore, let\n\n    xp = ((x mod p)^dP mod p), and\n    xq = ((x mod q)^dQ mod q), yielding:\n\n    y = (xp*q*(q^-1 mod p) + xq*p*(p^-1 mod q)) mod n\n\n    This can be further reduced to a simple algorithm that only\n    requires 1 inverse (the q inverse is used) to be used and stored.\n    The algorithm is called Garner's algorithm. If qInv is the\n    inverse of q, we simply calculate:\n\n    y = (qInv*(xp - xq) mod p) * q + xq\n\n    However, there are two further complications. First, we need to\n    ensure that xp > xq to prevent signed BigIntegers from being used\n    so we add p until this is true (since we will be mod'ing with\n    p anyway). Then, there is a known timing attack on algorithms\n    using the CRT. To mitigate this risk, \"cryptographic blinding\"\n    should be used. This requires simply generating a random number r\n    between 0 and n-1 and its inverse and multiplying x by r^e before\n    calculating y and then multiplying y by r^-1 afterwards. Note that\n    r must be coprime with n (gcd(r, n) === 1) in order to have an\n    inverse.\n  */\n\n  // cryptographic blinding\n  var r;\n  do {\n    r = new BigInteger(\n      forge.util.bytesToHex(forge.random.getBytes(key.n.bitLength() / 8)),\n      16);\n  } while(r.compareTo(key.n) >= 0 || !r.gcd(key.n).equals(BigInteger.ONE));\n  x = x.multiply(r.modPow(key.e, key.n)).mod(key.n);\n\n  // calculate xp and xq\n  var xp = x.mod(key.p).modPow(key.dP, key.p);\n  var xq = x.mod(key.q).modPow(key.dQ, key.q);\n\n  // xp must be larger than xq to avoid signed bit usage\n  while(xp.compareTo(xq) < 0) {\n    xp = xp.add(key.p);\n  }\n\n  // do last step\n  var y = xp.subtract(xq)\n    .multiply(key.qInv).mod(key.p)\n    .multiply(key.q).add(xq);\n\n  // remove effect of random for cryptographic blinding\n  y = y.multiply(r.modInverse(key.n)).mod(key.n);\n\n  return y;\n};\n\n/**\n * NOTE: THIS METHOD IS DEPRECATED, use 'sign' on a private key object or\n * 'encrypt' on a public key object instead.\n *\n * Performs RSA encryption.\n *\n * The parameter bt controls whether to put padding bytes before the\n * message passed in. Set bt to either true or false to disable padding\n * completely (in order to handle e.g. EMSA-PSS encoding seperately before),\n * signaling whether the encryption operation is a public key operation\n * (i.e. encrypting data) or not, i.e. private key operation (data signing).\n *\n * For PKCS#1 v1.5 padding pass in the block type to use, i.e. either 0x01\n * (for signing) or 0x02 (for encryption). The key operation mode (private\n * or public) is derived from this flag in that case).\n *\n * @param m the message to encrypt as a byte string.\n * @param key the RSA key to use.\n * @param bt for PKCS#1 v1.5 padding, the block type to use\n *   (0x01 for private key, 0x02 for public),\n *   to disable padding: true = public key, false = private key.\n *\n * @return the encrypted bytes as a string.\n */\npki.rsa.encrypt = function(m, key, bt) {\n  var pub = bt;\n  var eb;\n\n  // get the length of the modulus in bytes\n  var k = Math.ceil(key.n.bitLength() / 8);\n\n  if(bt !== false && bt !== true) {\n    // legacy, default to PKCS#1 v1.5 padding\n    pub = (bt === 0x02);\n    eb = _encodePkcs1_v1_5(m, key, bt);\n  } else {\n    eb = forge.util.createBuffer();\n    eb.putBytes(m);\n  }\n\n  // load encryption block as big integer 'x'\n  // FIXME: hex conversion inefficient, get BigInteger w/byte strings\n  var x = new BigInteger(eb.toHex(), 16);\n\n  // do RSA encryption\n  var y = _modPow(x, key, pub);\n\n  // convert y into the encrypted data byte string, if y is shorter in\n  // bytes than k, then prepend zero bytes to fill up ed\n  // FIXME: hex conversion inefficient, get BigInteger w/byte strings\n  var yhex = y.toString(16);\n  var ed = forge.util.createBuffer();\n  var zeros = k - Math.ceil(yhex.length / 2);\n  while(zeros > 0) {\n    ed.putByte(0x00);\n    --zeros;\n  }\n  ed.putBytes(forge.util.hexToBytes(yhex));\n  return ed.getBytes();\n};\n\n/**\n * NOTE: THIS METHOD IS DEPRECATED, use 'decrypt' on a private key object or\n * 'verify' on a public key object instead.\n *\n * Performs RSA decryption.\n *\n * The parameter ml controls whether to apply PKCS#1 v1.5 padding\n * or not.  Set ml = false to disable padding removal completely\n * (in order to handle e.g. EMSA-PSS later on) and simply pass back\n * the RSA encryption block.\n *\n * @param ed the encrypted data to decrypt in as a byte string.\n * @param key the RSA key to use.\n * @param pub true for a public key operation, false for private.\n * @param ml the message length, if known, false to disable padding.\n *\n * @return the decrypted message as a byte string.\n */\npki.rsa.decrypt = function(ed, key, pub, ml) {\n  // get the length of the modulus in bytes\n  var k = Math.ceil(key.n.bitLength() / 8);\n\n  // error if the length of the encrypted data ED is not k\n  if(ed.length !== k) {\n    var error = new Error('Encrypted message length is invalid.');\n    error.length = ed.length;\n    error.expected = k;\n    throw error;\n  }\n\n  // convert encrypted data into a big integer\n  // FIXME: hex conversion inefficient, get BigInteger w/byte strings\n  var y = new BigInteger(forge.util.createBuffer(ed).toHex(), 16);\n\n  // y must be less than the modulus or it wasn't the result of\n  // a previous mod operation (encryption) using that modulus\n  if(y.compareTo(key.n) >= 0) {\n    throw new Error('Encrypted message is invalid.');\n  }\n\n  // do RSA decryption\n  var x = _modPow(y, key, pub);\n\n  // create the encryption block, if x is shorter in bytes than k, then\n  // prepend zero bytes to fill up eb\n  // FIXME: hex conversion inefficient, get BigInteger w/byte strings\n  var xhex = x.toString(16);\n  var eb = forge.util.createBuffer();\n  var zeros = k - Math.ceil(xhex.length / 2);\n  while(zeros > 0) {\n    eb.putByte(0x00);\n    --zeros;\n  }\n  eb.putBytes(forge.util.hexToBytes(xhex));\n\n  if(ml !== false) {\n    // legacy, default to PKCS#1 v1.5 padding\n    return _decodePkcs1_v1_5(eb.getBytes(), key, pub);\n  }\n\n  // return message\n  return eb.getBytes();\n};\n\n/**\n * Creates an RSA key-pair generation state object. It is used to allow\n * key-generation to be performed in steps. It also allows for a UI to\n * display progress updates.\n *\n * @param bits the size for the private key in bits, defaults to 2048.\n * @param e the public exponent to use, defaults to 65537 (0x10001).\n * @param [options] the options to use.\n *          prng a custom crypto-secure pseudo-random number generator to use,\n *            that must define \"getBytesSync\".\n *          algorithm the algorithm to use (default: 'PRIMEINC').\n *\n * @return the state object to use to generate the key-pair.\n */\npki.rsa.createKeyPairGenerationState = function(bits, e, options) {\n  // TODO: migrate step-based prime generation code to forge.prime\n\n  // set default bits\n  if(typeof(bits) === 'string') {\n    bits = parseInt(bits, 10);\n  }\n  bits = bits || 2048;\n\n  // create prng with api that matches BigInteger secure random\n  options = options || {};\n  var prng = options.prng || forge.random;\n  var rng = {\n    // x is an array to fill with bytes\n    nextBytes: function(x) {\n      var b = prng.getBytesSync(x.length);\n      for(var i = 0; i < x.length; ++i) {\n        x[i] = b.charCodeAt(i);\n      }\n    }\n  };\n\n  var algorithm = options.algorithm || 'PRIMEINC';\n\n  // create PRIMEINC algorithm state\n  var rval;\n  if(algorithm === 'PRIMEINC') {\n    rval = {\n      algorithm: algorithm,\n      state: 0,\n      bits: bits,\n      rng: rng,\n      eInt: e || 65537,\n      e: new BigInteger(null),\n      p: null,\n      q: null,\n      qBits: bits >> 1,\n      pBits: bits - (bits >> 1),\n      pqState: 0,\n      num: null,\n      keys: null\n    };\n    rval.e.fromInt(rval.eInt);\n  } else {\n    throw new Error('Invalid key generation algorithm: ' + algorithm);\n  }\n\n  return rval;\n};\n\n/**\n * Attempts to runs the key-generation algorithm for at most n seconds\n * (approximately) using the given state. When key-generation has completed,\n * the keys will be stored in state.keys.\n *\n * To use this function to update a UI while generating a key or to prevent\n * causing browser lockups/warnings, set \"n\" to a value other than 0. A\n * simple pattern for generating a key and showing a progress indicator is:\n *\n * var state = pki.rsa.createKeyPairGenerationState(2048);\n * var step = function() {\n *   // step key-generation, run algorithm for 100 ms, repeat\n *   if(!forge.pki.rsa.stepKeyPairGenerationState(state, 100)) {\n *     setTimeout(step, 1);\n *   } else {\n *     // key-generation complete\n *     // TODO: turn off progress indicator here\n *     // TODO: use the generated key-pair in \"state.keys\"\n *   }\n * };\n * // TODO: turn on progress indicator here\n * setTimeout(step, 0);\n *\n * @param state the state to use.\n * @param n the maximum number of milliseconds to run the algorithm for, 0\n *          to run the algorithm to completion.\n *\n * @return true if the key-generation completed, false if not.\n */\npki.rsa.stepKeyPairGenerationState = function(state, n) {\n  // set default algorithm if not set\n  if(!('algorithm' in state)) {\n    state.algorithm = 'PRIMEINC';\n  }\n\n  // TODO: migrate step-based prime generation code to forge.prime\n  // TODO: abstract as PRIMEINC algorithm\n\n  // do key generation (based on Tom Wu's rsa.js, see jsbn.js license)\n  // with some minor optimizations and designed to run in steps\n\n  // local state vars\n  var THIRTY = new BigInteger(null);\n  THIRTY.fromInt(30);\n  var deltaIdx = 0;\n  var op_or = function(x, y) {return x | y;};\n\n  // keep stepping until time limit is reached or done\n  var t1 = +new Date();\n  var t2;\n  var total = 0;\n  while(state.keys === null && (n <= 0 || total < n)) {\n    // generate p or q\n    if(state.state === 0) {\n      /* Note: All primes are of the form:\n\n        30k+i, for i < 30 and gcd(30, i)=1, where there are 8 values for i\n\n        When we generate a random number, we always align it at 30k + 1. Each\n        time the number is determined not to be prime we add to get to the\n        next 'i', eg: if the number was at 30k + 1 we add 6. */\n      var bits = (state.p === null) ? state.pBits : state.qBits;\n      var bits1 = bits - 1;\n\n      // get a random number\n      if(state.pqState === 0) {\n        state.num = new BigInteger(bits, state.rng);\n        // force MSB set\n        if(!state.num.testBit(bits1)) {\n          state.num.bitwiseTo(\n            BigInteger.ONE.shiftLeft(bits1), op_or, state.num);\n        }\n        // align number on 30k+1 boundary\n        state.num.dAddOffset(31 - state.num.mod(THIRTY).byteValue(), 0);\n        deltaIdx = 0;\n\n        ++state.pqState;\n      } else if(state.pqState === 1) {\n        // try to make the number a prime\n        if(state.num.bitLength() > bits) {\n          // overflow, try again\n          state.pqState = 0;\n          // do primality test\n        } else if(state.num.isProbablePrime(\n          _getMillerRabinTests(state.num.bitLength()))) {\n          ++state.pqState;\n        } else {\n          // get next potential prime\n          state.num.dAddOffset(GCD_30_DELTA[deltaIdx++ % 8], 0);\n        }\n      } else if(state.pqState === 2) {\n        // ensure number is coprime with e\n        state.pqState =\n          (state.num.subtract(BigInteger.ONE).gcd(state.e)\n            .compareTo(BigInteger.ONE) === 0) ? 3 : 0;\n      } else if(state.pqState === 3) {\n        // store p or q\n        state.pqState = 0;\n        if(state.p === null) {\n          state.p = state.num;\n        } else {\n          state.q = state.num;\n        }\n\n        // advance state if both p and q are ready\n        if(state.p !== null && state.q !== null) {\n          ++state.state;\n        }\n        state.num = null;\n      }\n    } else if(state.state === 1) {\n      // ensure p is larger than q (swap them if not)\n      if(state.p.compareTo(state.q) < 0) {\n        state.num = state.p;\n        state.p = state.q;\n        state.q = state.num;\n      }\n      ++state.state;\n    } else if(state.state === 2) {\n      // compute phi: (p - 1)(q - 1) (Euler's totient function)\n      state.p1 = state.p.subtract(BigInteger.ONE);\n      state.q1 = state.q.subtract(BigInteger.ONE);\n      state.phi = state.p1.multiply(state.q1);\n      ++state.state;\n    } else if(state.state === 3) {\n      // ensure e and phi are coprime\n      if(state.phi.gcd(state.e).compareTo(BigInteger.ONE) === 0) {\n        // phi and e are coprime, advance\n        ++state.state;\n      } else {\n        // phi and e aren't coprime, so generate a new p and q\n        state.p = null;\n        state.q = null;\n        state.state = 0;\n      }\n    } else if(state.state === 4) {\n      // create n, ensure n is has the right number of bits\n      state.n = state.p.multiply(state.q);\n\n      // ensure n is right number of bits\n      if(state.n.bitLength() === state.bits) {\n        // success, advance\n        ++state.state;\n      } else {\n        // failed, get new q\n        state.q = null;\n        state.state = 0;\n      }\n    } else if(state.state === 5) {\n      // set keys\n      var d = state.e.modInverse(state.phi);\n      state.keys = {\n        privateKey: pki.rsa.setPrivateKey(\n          state.n, state.e, d, state.p, state.q,\n          d.mod(state.p1), d.mod(state.q1),\n          state.q.modInverse(state.p)),\n        publicKey: pki.rsa.setPublicKey(state.n, state.e)\n      };\n    }\n\n    // update timing\n    t2 = +new Date();\n    total += t2 - t1;\n    t1 = t2;\n  }\n\n  return state.keys !== null;\n};\n\n/**\n * Generates an RSA public-private key pair in a single call.\n *\n * To generate a key-pair in steps (to allow for progress updates and to\n * prevent blocking or warnings in slow browsers) then use the key-pair\n * generation state functions.\n *\n * To generate a key-pair asynchronously (either through web-workers, if\n * available, or by breaking up the work on the main thread), pass a\n * callback function.\n *\n * @param [bits] the size for the private key in bits, defaults to 2048.\n * @param [e] the public exponent to use, defaults to 65537.\n * @param [options] options for key-pair generation, if given then 'bits'\n *            and 'e' must *not* be given:\n *          bits the size for the private key in bits, (default: 2048).\n *          e the public exponent to use, (default: 65537 (0x10001)).\n *          workerScript the worker script URL.\n *          workers the number of web workers (if supported) to use,\n *            (default: 2).\n *          workLoad the size of the work load, ie: number of possible prime\n *            numbers for each web worker to check per work assignment,\n *            (default: 100).\n *          prng a custom crypto-secure pseudo-random number generator to use,\n *            that must define \"getBytesSync\". Disables use of native APIs.\n *          algorithm the algorithm to use (default: 'PRIMEINC').\n * @param [callback(err, keypair)] called once the operation completes.\n *\n * @return an object with privateKey and publicKey properties.\n */\npki.rsa.generateKeyPair = function(bits, e, options, callback) {\n  // (bits), (options), (callback)\n  if(arguments.length === 1) {\n    if(typeof bits === 'object') {\n      options = bits;\n      bits = undefined;\n    } else if(typeof bits === 'function') {\n      callback = bits;\n      bits = undefined;\n    }\n  } else if(arguments.length === 2) {\n    // (bits, e), (bits, options), (bits, callback), (options, callback)\n    if(typeof bits === 'number') {\n      if(typeof e === 'function') {\n        callback = e;\n        e = undefined;\n      } else if(typeof e !== 'number') {\n        options = e;\n        e = undefined;\n      }\n    } else {\n      options = bits;\n      callback = e;\n      bits = undefined;\n      e = undefined;\n    }\n  } else if(arguments.length === 3) {\n    // (bits, e, options), (bits, e, callback), (bits, options, callback)\n    if(typeof e === 'number') {\n      if(typeof options === 'function') {\n        callback = options;\n        options = undefined;\n      }\n    } else {\n      callback = options;\n      options = e;\n      e = undefined;\n    }\n  }\n  options = options || {};\n  if(bits === undefined) {\n    bits = options.bits || 2048;\n  }\n  if(e === undefined) {\n    e = options.e || 0x10001;\n  }\n\n  // use native code if permitted, available, and parameters are acceptable\n  if(!forge.options.usePureJavaScript && !options.prng &&\n    bits >= 256 && bits <= 16384 && (e === 0x10001 || e === 3)) {\n    if(callback) {\n      // try native async\n      if(_detectNodeCrypto('generateKeyPair')) {\n        return _crypto.generateKeyPair('rsa', {\n          modulusLength: bits,\n          publicExponent: e,\n          publicKeyEncoding: {\n            type: 'spki',\n            format: 'pem'\n          },\n          privateKeyEncoding: {\n            type: 'pkcs8',\n            format: 'pem'\n          }\n        }, function(err, pub, priv) {\n          if(err) {\n            return callback(err);\n          }\n          callback(null, {\n            privateKey: pki.privateKeyFromPem(priv),\n            publicKey: pki.publicKeyFromPem(pub)\n          });\n        });\n      }\n      if(_detectSubtleCrypto('generateKey') &&\n        _detectSubtleCrypto('exportKey')) {\n        // use standard native generateKey\n        return util.globalScope.crypto.subtle.generateKey({\n          name: 'RSASSA-PKCS1-v1_5',\n          modulusLength: bits,\n          publicExponent: _intToUint8Array(e),\n          hash: {name: 'SHA-256'}\n        }, true /* key can be exported*/, ['sign', 'verify'])\n        .then(function(pair) {\n          return util.globalScope.crypto.subtle.exportKey(\n            'pkcs8', pair.privateKey);\n        // avoiding catch(function(err) {...}) to support IE <= 8\n        }).then(undefined, function(err) {\n          callback(err);\n        }).then(function(pkcs8) {\n          if(pkcs8) {\n            var privateKey = pki.privateKeyFromAsn1(\n              asn1.fromDer(forge.util.createBuffer(pkcs8)));\n            callback(null, {\n              privateKey: privateKey,\n              publicKey: pki.setRsaPublicKey(privateKey.n, privateKey.e)\n            });\n          }\n        });\n      }\n      if(_detectSubtleMsCrypto('generateKey') &&\n        _detectSubtleMsCrypto('exportKey')) {\n        var genOp = util.globalScope.msCrypto.subtle.generateKey({\n          name: 'RSASSA-PKCS1-v1_5',\n          modulusLength: bits,\n          publicExponent: _intToUint8Array(e),\n          hash: {name: 'SHA-256'}\n        }, true /* key can be exported*/, ['sign', 'verify']);\n        genOp.oncomplete = function(e) {\n          var pair = e.target.result;\n          var exportOp = util.globalScope.msCrypto.subtle.exportKey(\n            'pkcs8', pair.privateKey);\n          exportOp.oncomplete = function(e) {\n            var pkcs8 = e.target.result;\n            var privateKey = pki.privateKeyFromAsn1(\n              asn1.fromDer(forge.util.createBuffer(pkcs8)));\n            callback(null, {\n              privateKey: privateKey,\n              publicKey: pki.setRsaPublicKey(privateKey.n, privateKey.e)\n            });\n          };\n          exportOp.onerror = function(err) {\n            callback(err);\n          };\n        };\n        genOp.onerror = function(err) {\n          callback(err);\n        };\n        return;\n      }\n    } else {\n      // try native sync\n      if(_detectNodeCrypto('generateKeyPairSync')) {\n        var keypair = _crypto.generateKeyPairSync('rsa', {\n          modulusLength: bits,\n          publicExponent: e,\n          publicKeyEncoding: {\n            type: 'spki',\n            format: 'pem'\n          },\n          privateKeyEncoding: {\n            type: 'pkcs8',\n            format: 'pem'\n          }\n        });\n        return {\n          privateKey: pki.privateKeyFromPem(keypair.privateKey),\n          publicKey: pki.publicKeyFromPem(keypair.publicKey)\n        };\n      }\n    }\n  }\n\n  // use JavaScript implementation\n  var state = pki.rsa.createKeyPairGenerationState(bits, e, options);\n  if(!callback) {\n    pki.rsa.stepKeyPairGenerationState(state, 0);\n    return state.keys;\n  }\n  _generateKeyPair(state, options, callback);\n};\n\n/**\n * Sets an RSA public key from BigIntegers modulus and exponent.\n *\n * @param n the modulus.\n * @param e the exponent.\n *\n * @return the public key.\n */\npki.setRsaPublicKey = pki.rsa.setPublicKey = function(n, e) {\n  var key = {\n    n: n,\n    e: e\n  };\n\n  /**\n   * Encrypts the given data with this public key. Newer applications\n   * should use the 'RSA-OAEP' decryption scheme, 'RSAES-PKCS1-V1_5' is for\n   * legacy applications.\n   *\n   * @param data the byte string to encrypt.\n   * @param scheme the encryption scheme to use:\n   *          'RSAES-PKCS1-V1_5' (default),\n   *          'RSA-OAEP',\n   *          'RAW', 'NONE', or null to perform raw RSA encryption,\n   *          an object with an 'encode' property set to a function\n   *          with the signature 'function(data, key)' that returns\n   *          a binary-encoded string representing the encoded data.\n   * @param schemeOptions any scheme-specific options.\n   *\n   * @return the encrypted byte string.\n   */\n  key.encrypt = function(data, scheme, schemeOptions) {\n    if(typeof scheme === 'string') {\n      scheme = scheme.toUpperCase();\n    } else if(scheme === undefined) {\n      scheme = 'RSAES-PKCS1-V1_5';\n    }\n\n    if(scheme === 'RSAES-PKCS1-V1_5') {\n      scheme = {\n        encode: function(m, key, pub) {\n          return _encodePkcs1_v1_5(m, key, 0x02).getBytes();\n        }\n      };\n    } else if(scheme === 'RSA-OAEP' || scheme === 'RSAES-OAEP') {\n      scheme = {\n        encode: function(m, key) {\n          return forge.pkcs1.encode_rsa_oaep(key, m, schemeOptions);\n        }\n      };\n    } else if(['RAW', 'NONE', 'NULL', null].indexOf(scheme) !== -1) {\n      scheme = {encode: function(e) {return e;}};\n    } else if(typeof scheme === 'string') {\n      throw new Error('Unsupported encryption scheme: \"' + scheme + '\".');\n    }\n\n    // do scheme-based encoding then rsa encryption\n    var e = scheme.encode(data, key, true);\n    return pki.rsa.encrypt(e, key, true);\n  };\n\n  /**\n   * Verifies the given signature against the given digest.\n   *\n   * PKCS#1 supports multiple (currently two) signature schemes:\n   * RSASSA-PKCS1-V1_5 and RSASSA-PSS.\n   *\n   * By default this implementation uses the \"old scheme\", i.e.\n   * RSASSA-PKCS1-V1_5, in which case once RSA-decrypted, the\n   * signature is an OCTET STRING that holds a DigestInfo.\n   *\n   * DigestInfo ::= SEQUENCE {\n   *   digestAlgorithm DigestAlgorithmIdentifier,\n   *   digest Digest\n   * }\n   * DigestAlgorithmIdentifier ::= AlgorithmIdentifier\n   * Digest ::= OCTET STRING\n   *\n   * To perform PSS signature verification, provide an instance\n   * of Forge PSS object as the scheme parameter.\n   *\n   * @param digest the message digest hash to compare against the signature,\n   *          as a binary-encoded string.\n   * @param signature the signature to verify, as a binary-encoded string.\n   * @param scheme signature verification scheme to use:\n   *          'RSASSA-PKCS1-V1_5' or undefined for RSASSA PKCS#1 v1.5,\n   *          a Forge PSS object for RSASSA-PSS,\n   *          'NONE' or null for none, DigestInfo will not be expected, but\n   *            PKCS#1 v1.5 padding will still be used.\n   *\n   * @return true if the signature was verified, false if not.\n   */\n  key.verify = function(digest, signature, scheme) {\n    if(typeof scheme === 'string') {\n      scheme = scheme.toUpperCase();\n    } else if(scheme === undefined) {\n      scheme = 'RSASSA-PKCS1-V1_5';\n    }\n\n    if(scheme === 'RSASSA-PKCS1-V1_5') {\n      scheme = {\n        verify: function(digest, d) {\n          // remove padding\n          d = _decodePkcs1_v1_5(d, key, true);\n          // d is ASN.1 BER-encoded DigestInfo\n          var obj = asn1.fromDer(d);\n          // compare the given digest to the decrypted one\n          return digest === obj.value[1].value;\n        }\n      };\n    } else if(scheme === 'NONE' || scheme === 'NULL' || scheme === null) {\n      scheme = {\n        verify: function(digest, d) {\n          // remove padding\n          d = _decodePkcs1_v1_5(d, key, true);\n          return digest === d;\n        }\n      };\n    }\n\n    // do rsa decryption w/o any decoding, then verify -- which does decoding\n    var d = pki.rsa.decrypt(signature, key, true, false);\n    return scheme.verify(digest, d, key.n.bitLength());\n  };\n\n  return key;\n};\n\n/**\n * Sets an RSA private key from BigIntegers modulus, exponent, primes,\n * prime exponents, and modular multiplicative inverse.\n *\n * @param n the modulus.\n * @param e the public exponent.\n * @param d the private exponent ((inverse of e) mod n).\n * @param p the first prime.\n * @param q the second prime.\n * @param dP exponent1 (d mod (p-1)).\n * @param dQ exponent2 (d mod (q-1)).\n * @param qInv ((inverse of q) mod p)\n *\n * @return the private key.\n */\npki.setRsaPrivateKey = pki.rsa.setPrivateKey = function(\n  n, e, d, p, q, dP, dQ, qInv) {\n  var key = {\n    n: n,\n    e: e,\n    d: d,\n    p: p,\n    q: q,\n    dP: dP,\n    dQ: dQ,\n    qInv: qInv\n  };\n\n  /**\n   * Decrypts the given data with this private key. The decryption scheme\n   * must match the one used to encrypt the data.\n   *\n   * @param data the byte string to decrypt.\n   * @param scheme the decryption scheme to use:\n   *          'RSAES-PKCS1-V1_5' (default),\n   *          'RSA-OAEP',\n   *          'RAW', 'NONE', or null to perform raw RSA decryption.\n   * @param schemeOptions any scheme-specific options.\n   *\n   * @return the decrypted byte string.\n   */\n  key.decrypt = function(data, scheme, schemeOptions) {\n    if(typeof scheme === 'string') {\n      scheme = scheme.toUpperCase();\n    } else if(scheme === undefined) {\n      scheme = 'RSAES-PKCS1-V1_5';\n    }\n\n    // do rsa decryption w/o any decoding\n    var d = pki.rsa.decrypt(data, key, false, false);\n\n    if(scheme === 'RSAES-PKCS1-V1_5') {\n      scheme = {decode: _decodePkcs1_v1_5};\n    } else if(scheme === 'RSA-OAEP' || scheme === 'RSAES-OAEP') {\n      scheme = {\n        decode: function(d, key) {\n          return forge.pkcs1.decode_rsa_oaep(key, d, schemeOptions);\n        }\n      };\n    } else if(['RAW', 'NONE', 'NULL', null].indexOf(scheme) !== -1) {\n      scheme = {decode: function(d) {return d;}};\n    } else {\n      throw new Error('Unsupported encryption scheme: \"' + scheme + '\".');\n    }\n\n    // decode according to scheme\n    return scheme.decode(d, key, false);\n  };\n\n  /**\n   * Signs the given digest, producing a signature.\n   *\n   * PKCS#1 supports multiple (currently two) signature schemes:\n   * RSASSA-PKCS1-V1_5 and RSASSA-PSS.\n   *\n   * By default this implementation uses the \"old scheme\", i.e.\n   * RSASSA-PKCS1-V1_5. In order to generate a PSS signature, provide\n   * an instance of Forge PSS object as the scheme parameter.\n   *\n   * @param md the message digest object with the hash to sign.\n   * @param scheme the signature scheme to use:\n   *          'RSASSA-PKCS1-V1_5' or undefined for RSASSA PKCS#1 v1.5,\n   *          a Forge PSS object for RSASSA-PSS,\n   *          'NONE' or null for none, DigestInfo will not be used but\n   *            PKCS#1 v1.5 padding will still be used.\n   *\n   * @return the signature as a byte string.\n   */\n  key.sign = function(md, scheme) {\n    /* Note: The internal implementation of RSA operations is being\n      transitioned away from a PKCS#1 v1.5 hard-coded scheme. Some legacy\n      code like the use of an encoding block identifier 'bt' will eventually\n      be removed. */\n\n    // private key operation\n    var bt = false;\n\n    if(typeof scheme === 'string') {\n      scheme = scheme.toUpperCase();\n    }\n\n    if(scheme === undefined || scheme === 'RSASSA-PKCS1-V1_5') {\n      scheme = {encode: emsaPkcs1v15encode};\n      bt = 0x01;\n    } else if(scheme === 'NONE' || scheme === 'NULL' || scheme === null) {\n      scheme = {encode: function() {return md;}};\n      bt = 0x01;\n    }\n\n    // encode and then encrypt\n    var d = scheme.encode(md, key.n.bitLength());\n    return pki.rsa.encrypt(d, key, bt);\n  };\n\n  return key;\n};\n\n/**\n * Wraps an RSAPrivateKey ASN.1 object in an ASN.1 PrivateKeyInfo object.\n *\n * @param rsaKey the ASN.1 RSAPrivateKey.\n *\n * @return the ASN.1 PrivateKeyInfo.\n */\npki.wrapRsaPrivateKey = function(rsaKey) {\n  // PrivateKeyInfo\n  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // version (0)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      asn1.integerToDer(0).getBytes()),\n    // privateKeyAlgorithm\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      asn1.create(\n        asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n        asn1.oidToDer(pki.oids.rsaEncryption).getBytes()),\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')\n    ]),\n    // PrivateKey\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,\n      asn1.toDer(rsaKey).getBytes())\n  ]);\n};\n\n/**\n * Converts a private key from an ASN.1 object.\n *\n * @param obj the ASN.1 representation of a PrivateKeyInfo containing an\n *          RSAPrivateKey or an RSAPrivateKey.\n *\n * @return the private key.\n */\npki.privateKeyFromAsn1 = function(obj) {\n  // get PrivateKeyInfo\n  var capture = {};\n  var errors = [];\n  if(asn1.validate(obj, privateKeyValidator, capture, errors)) {\n    obj = asn1.fromDer(forge.util.createBuffer(capture.privateKey));\n  }\n\n  // get RSAPrivateKey\n  capture = {};\n  errors = [];\n  if(!asn1.validate(obj, rsaPrivateKeyValidator, capture, errors)) {\n    var error = new Error('Cannot read private key. ' +\n      'ASN.1 object does not contain an RSAPrivateKey.');\n    error.errors = errors;\n    throw error;\n  }\n\n  // Note: Version is currently ignored.\n  // capture.privateKeyVersion\n  // FIXME: inefficient, get a BigInteger that uses byte strings\n  var n, e, d, p, q, dP, dQ, qInv;\n  n = forge.util.createBuffer(capture.privateKeyModulus).toHex();\n  e = forge.util.createBuffer(capture.privateKeyPublicExponent).toHex();\n  d = forge.util.createBuffer(capture.privateKeyPrivateExponent).toHex();\n  p = forge.util.createBuffer(capture.privateKeyPrime1).toHex();\n  q = forge.util.createBuffer(capture.privateKeyPrime2).toHex();\n  dP = forge.util.createBuffer(capture.privateKeyExponent1).toHex();\n  dQ = forge.util.createBuffer(capture.privateKeyExponent2).toHex();\n  qInv = forge.util.createBuffer(capture.privateKeyCoefficient).toHex();\n\n  // set private key\n  return pki.setRsaPrivateKey(\n    new BigInteger(n, 16),\n    new BigInteger(e, 16),\n    new BigInteger(d, 16),\n    new BigInteger(p, 16),\n    new BigInteger(q, 16),\n    new BigInteger(dP, 16),\n    new BigInteger(dQ, 16),\n    new BigInteger(qInv, 16));\n};\n\n/**\n * Converts a private key to an ASN.1 RSAPrivateKey.\n *\n * @param key the private key.\n *\n * @return the ASN.1 representation of an RSAPrivateKey.\n */\npki.privateKeyToAsn1 = pki.privateKeyToRSAPrivateKey = function(key) {\n  // RSAPrivateKey\n  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // version (0 = only 2 primes, 1 multiple primes)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      asn1.integerToDer(0).getBytes()),\n    // modulus (n)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      _bnToBytes(key.n)),\n    // publicExponent (e)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      _bnToBytes(key.e)),\n    // privateExponent (d)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      _bnToBytes(key.d)),\n    // privateKeyPrime1 (p)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      _bnToBytes(key.p)),\n    // privateKeyPrime2 (q)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      _bnToBytes(key.q)),\n    // privateKeyExponent1 (dP)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      _bnToBytes(key.dP)),\n    // privateKeyExponent2 (dQ)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      _bnToBytes(key.dQ)),\n    // coefficient (qInv)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      _bnToBytes(key.qInv))\n  ]);\n};\n\n/**\n * Converts a public key from an ASN.1 SubjectPublicKeyInfo or RSAPublicKey.\n *\n * @param obj the asn1 representation of a SubjectPublicKeyInfo or RSAPublicKey.\n *\n * @return the public key.\n */\npki.publicKeyFromAsn1 = function(obj) {\n  // get SubjectPublicKeyInfo\n  var capture = {};\n  var errors = [];\n  if(asn1.validate(obj, publicKeyValidator, capture, errors)) {\n    // get oid\n    var oid = asn1.derToOid(capture.publicKeyOid);\n    if(oid !== pki.oids.rsaEncryption) {\n      var error = new Error('Cannot read public key. Unknown OID.');\n      error.oid = oid;\n      throw error;\n    }\n    obj = capture.rsaPublicKey;\n  }\n\n  // get RSA params\n  errors = [];\n  if(!asn1.validate(obj, rsaPublicKeyValidator, capture, errors)) {\n    var error = new Error('Cannot read public key. ' +\n      'ASN.1 object does not contain an RSAPublicKey.');\n    error.errors = errors;\n    throw error;\n  }\n\n  // FIXME: inefficient, get a BigInteger that uses byte strings\n  var n = forge.util.createBuffer(capture.publicKeyModulus).toHex();\n  var e = forge.util.createBuffer(capture.publicKeyExponent).toHex();\n\n  // set public key\n  return pki.setRsaPublicKey(\n    new BigInteger(n, 16),\n    new BigInteger(e, 16));\n};\n\n/**\n * Converts a public key to an ASN.1 SubjectPublicKeyInfo.\n *\n * @param key the public key.\n *\n * @return the asn1 representation of a SubjectPublicKeyInfo.\n */\npki.publicKeyToAsn1 = pki.publicKeyToSubjectPublicKeyInfo = function(key) {\n  // SubjectPublicKeyInfo\n  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // AlgorithmIdentifier\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      // algorithm\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n        asn1.oidToDer(pki.oids.rsaEncryption).getBytes()),\n      // parameters (null)\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')\n    ]),\n    // subjectPublicKey\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false, [\n      pki.publicKeyToRSAPublicKey(key)\n    ])\n  ]);\n};\n\n/**\n * Converts a public key to an ASN.1 RSAPublicKey.\n *\n * @param key the public key.\n *\n * @return the asn1 representation of a RSAPublicKey.\n */\npki.publicKeyToRSAPublicKey = function(key) {\n  // RSAPublicKey\n  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // modulus (n)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      _bnToBytes(key.n)),\n    // publicExponent (e)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      _bnToBytes(key.e))\n  ]);\n};\n\n/**\n * Encodes a message using PKCS#1 v1.5 padding.\n *\n * @param m the message to encode.\n * @param key the RSA key to use.\n * @param bt the block type to use, i.e. either 0x01 (for signing) or 0x02\n *          (for encryption).\n *\n * @return the padded byte buffer.\n */\nfunction _encodePkcs1_v1_5(m, key, bt) {\n  var eb = forge.util.createBuffer();\n\n  // get the length of the modulus in bytes\n  var k = Math.ceil(key.n.bitLength() / 8);\n\n  /* use PKCS#1 v1.5 padding */\n  if(m.length > (k - 11)) {\n    var error = new Error('Message is too long for PKCS#1 v1.5 padding.');\n    error.length = m.length;\n    error.max = k - 11;\n    throw error;\n  }\n\n  /* A block type BT, a padding string PS, and the data D shall be\n    formatted into an octet string EB, the encryption block:\n\n    EB = 00 || BT || PS || 00 || D\n\n    The block type BT shall be a single octet indicating the structure of\n    the encryption block. For this version of the document it shall have\n    value 00, 01, or 02. For a private-key operation, the block type\n    shall be 00 or 01. For a public-key operation, it shall be 02.\n\n    The padding string PS shall consist of k-3-||D|| octets. For block\n    type 00, the octets shall have value 00; for block type 01, they\n    shall have value FF; and for block type 02, they shall be\n    pseudorandomly generated and nonzero. This makes the length of the\n    encryption block EB equal to k. */\n\n  // build the encryption block\n  eb.putByte(0x00);\n  eb.putByte(bt);\n\n  // create the padding\n  var padNum = k - 3 - m.length;\n  var padByte;\n  // private key op\n  if(bt === 0x00 || bt === 0x01) {\n    padByte = (bt === 0x00) ? 0x00 : 0xFF;\n    for(var i = 0; i < padNum; ++i) {\n      eb.putByte(padByte);\n    }\n  } else {\n    // public key op\n    // pad with random non-zero values\n    while(padNum > 0) {\n      var numZeros = 0;\n      var padBytes = forge.random.getBytes(padNum);\n      for(var i = 0; i < padNum; ++i) {\n        padByte = padBytes.charCodeAt(i);\n        if(padByte === 0) {\n          ++numZeros;\n        } else {\n          eb.putByte(padByte);\n        }\n      }\n      padNum = numZeros;\n    }\n  }\n\n  // zero followed by message\n  eb.putByte(0x00);\n  eb.putBytes(m);\n\n  return eb;\n}\n\n/**\n * Decodes a message using PKCS#1 v1.5 padding.\n *\n * @param em the message to decode.\n * @param key the RSA key to use.\n * @param pub true if the key is a public key, false if it is private.\n * @param ml the message length, if specified.\n *\n * @return the decoded bytes.\n */\nfunction _decodePkcs1_v1_5(em, key, pub, ml) {\n  // get the length of the modulus in bytes\n  var k = Math.ceil(key.n.bitLength() / 8);\n\n  /* It is an error if any of the following conditions occurs:\n\n    1. The encryption block EB cannot be parsed unambiguously.\n    2. The padding string PS consists of fewer than eight octets\n      or is inconsisent with the block type BT.\n    3. The decryption process is a public-key operation and the block\n      type BT is not 00 or 01, or the decryption process is a\n      private-key operation and the block type is not 02.\n   */\n\n  // parse the encryption block\n  var eb = forge.util.createBuffer(em);\n  var first = eb.getByte();\n  var bt = eb.getByte();\n  if(first !== 0x00 ||\n    (pub && bt !== 0x00 && bt !== 0x01) ||\n    (!pub && bt != 0x02) ||\n    (pub && bt === 0x00 && typeof(ml) === 'undefined')) {\n    throw new Error('Encryption block is invalid.');\n  }\n\n  var padNum = 0;\n  if(bt === 0x00) {\n    // check all padding bytes for 0x00\n    padNum = k - 3 - ml;\n    for(var i = 0; i < padNum; ++i) {\n      if(eb.getByte() !== 0x00) {\n        throw new Error('Encryption block is invalid.');\n      }\n    }\n  } else if(bt === 0x01) {\n    // find the first byte that isn't 0xFF, should be after all padding\n    padNum = 0;\n    while(eb.length() > 1) {\n      if(eb.getByte() !== 0xFF) {\n        --eb.read;\n        break;\n      }\n      ++padNum;\n    }\n  } else if(bt === 0x02) {\n    // look for 0x00 byte\n    padNum = 0;\n    while(eb.length() > 1) {\n      if(eb.getByte() === 0x00) {\n        --eb.read;\n        break;\n      }\n      ++padNum;\n    }\n  }\n\n  // zero must be 0x00 and padNum must be (k - 3 - message length)\n  var zero = eb.getByte();\n  if(zero !== 0x00 || padNum !== (k - 3 - eb.length())) {\n    throw new Error('Encryption block is invalid.');\n  }\n\n  return eb.getBytes();\n}\n\n/**\n * Runs the key-generation algorithm asynchronously, either in the background\n * via Web Workers, or using the main thread and setImmediate.\n *\n * @param state the key-pair generation state.\n * @param [options] options for key-pair generation:\n *          workerScript the worker script URL.\n *          workers the number of web workers (if supported) to use,\n *            (default: 2, -1 to use estimated cores minus one).\n *          workLoad the size of the work load, ie: number of possible prime\n *            numbers for each web worker to check per work assignment,\n *            (default: 100).\n * @param callback(err, keypair) called once the operation completes.\n */\nfunction _generateKeyPair(state, options, callback) {\n  if(typeof options === 'function') {\n    callback = options;\n    options = {};\n  }\n  options = options || {};\n\n  var opts = {\n    algorithm: {\n      name: options.algorithm || 'PRIMEINC',\n      options: {\n        workers: options.workers || 2,\n        workLoad: options.workLoad || 100,\n        workerScript: options.workerScript\n      }\n    }\n  };\n  if('prng' in options) {\n    opts.prng = options.prng;\n  }\n\n  generate();\n\n  function generate() {\n    // find p and then q (done in series to simplify)\n    getPrime(state.pBits, function(err, num) {\n      if(err) {\n        return callback(err);\n      }\n      state.p = num;\n      if(state.q !== null) {\n        return finish(err, state.q);\n      }\n      getPrime(state.qBits, finish);\n    });\n  }\n\n  function getPrime(bits, callback) {\n    forge.prime.generateProbablePrime(bits, opts, callback);\n  }\n\n  function finish(err, num) {\n    if(err) {\n      return callback(err);\n    }\n\n    // set q\n    state.q = num;\n\n    // ensure p is larger than q (swap them if not)\n    if(state.p.compareTo(state.q) < 0) {\n      var tmp = state.p;\n      state.p = state.q;\n      state.q = tmp;\n    }\n\n    // ensure p is coprime with e\n    if(state.p.subtract(BigInteger.ONE).gcd(state.e)\n      .compareTo(BigInteger.ONE) !== 0) {\n      state.p = null;\n      generate();\n      return;\n    }\n\n    // ensure q is coprime with e\n    if(state.q.subtract(BigInteger.ONE).gcd(state.e)\n      .compareTo(BigInteger.ONE) !== 0) {\n      state.q = null;\n      getPrime(state.qBits, finish);\n      return;\n    }\n\n    // compute phi: (p - 1)(q - 1) (Euler's totient function)\n    state.p1 = state.p.subtract(BigInteger.ONE);\n    state.q1 = state.q.subtract(BigInteger.ONE);\n    state.phi = state.p1.multiply(state.q1);\n\n    // ensure e and phi are coprime\n    if(state.phi.gcd(state.e).compareTo(BigInteger.ONE) !== 0) {\n      // phi and e aren't coprime, so generate a new p and q\n      state.p = state.q = null;\n      generate();\n      return;\n    }\n\n    // create n, ensure n is has the right number of bits\n    state.n = state.p.multiply(state.q);\n    if(state.n.bitLength() !== state.bits) {\n      // failed, get new q\n      state.q = null;\n      getPrime(state.qBits, finish);\n      return;\n    }\n\n    // set keys\n    var d = state.e.modInverse(state.phi);\n    state.keys = {\n      privateKey: pki.rsa.setPrivateKey(\n        state.n, state.e, d, state.p, state.q,\n        d.mod(state.p1), d.mod(state.q1),\n        state.q.modInverse(state.p)),\n      publicKey: pki.rsa.setPublicKey(state.n, state.e)\n    };\n\n    callback(null, state.keys);\n  }\n}\n\n/**\n * Converts a positive BigInteger into 2's-complement big-endian bytes.\n *\n * @param b the big integer to convert.\n *\n * @return the bytes.\n */\nfunction _bnToBytes(b) {\n  // prepend 0x00 if first byte >= 0x80\n  var hex = b.toString(16);\n  if(hex[0] >= '8') {\n    hex = '00' + hex;\n  }\n  var bytes = forge.util.hexToBytes(hex);\n\n  // ensure integer is minimally-encoded\n  if(bytes.length > 1 &&\n    // leading 0x00 for positive integer\n    ((bytes.charCodeAt(0) === 0 &&\n    (bytes.charCodeAt(1) & 0x80) === 0) ||\n    // leading 0xFF for negative integer\n    (bytes.charCodeAt(0) === 0xFF &&\n    (bytes.charCodeAt(1) & 0x80) === 0x80))) {\n    return bytes.substr(1);\n  }\n  return bytes;\n}\n\n/**\n * Returns the required number of Miller-Rabin tests to generate a\n * prime with an error probability of (1/2)^80.\n *\n * See Handbook of Applied Cryptography Chapter 4, Table 4.4.\n *\n * @param bits the bit size.\n *\n * @return the required number of iterations.\n */\nfunction _getMillerRabinTests(bits) {\n  if(bits <= 100) return 27;\n  if(bits <= 150) return 18;\n  if(bits <= 200) return 15;\n  if(bits <= 250) return 12;\n  if(bits <= 300) return 9;\n  if(bits <= 350) return 8;\n  if(bits <= 400) return 7;\n  if(bits <= 500) return 6;\n  if(bits <= 600) return 5;\n  if(bits <= 800) return 4;\n  if(bits <= 1250) return 3;\n  return 2;\n}\n\n/**\n * Performs feature detection on the Node crypto interface.\n *\n * @param fn the feature (function) to detect.\n *\n * @return true if detected, false if not.\n */\nfunction _detectNodeCrypto(fn) {\n  return forge.util.isNodejs && typeof _crypto[fn] === 'function';\n}\n\n/**\n * Performs feature detection on the SubtleCrypto interface.\n *\n * @param fn the feature (function) to detect.\n *\n * @return true if detected, false if not.\n */\nfunction _detectSubtleCrypto(fn) {\n  return (typeof util.globalScope !== 'undefined' &&\n    typeof util.globalScope.crypto === 'object' &&\n    typeof util.globalScope.crypto.subtle === 'object' &&\n    typeof util.globalScope.crypto.subtle[fn] === 'function');\n}\n\n/**\n * Performs feature detection on the deprecated Microsoft Internet Explorer\n * outdated SubtleCrypto interface. This function should only be used after\n * checking for the modern, standard SubtleCrypto interface.\n *\n * @param fn the feature (function) to detect.\n *\n * @return true if detected, false if not.\n */\nfunction _detectSubtleMsCrypto(fn) {\n  return (typeof util.globalScope !== 'undefined' &&\n    typeof util.globalScope.msCrypto === 'object' &&\n    typeof util.globalScope.msCrypto.subtle === 'object' &&\n    typeof util.globalScope.msCrypto.subtle[fn] === 'function');\n}\n\nfunction _intToUint8Array(x) {\n  var bytes = forge.util.hexToBytes(x.toString(16));\n  var buffer = new Uint8Array(bytes.length);\n  for(var i = 0; i < bytes.length; ++i) {\n    buffer[i] = bytes.charCodeAt(i);\n  }\n  return buffer;\n}\n\nfunction _privateKeyFromJwk(jwk) {\n  if(jwk.kty !== 'RSA') {\n    throw new Error(\n      'Unsupported key algorithm \"' + jwk.kty + '\"; algorithm must be \"RSA\".');\n  }\n  return pki.setRsaPrivateKey(\n    _base64ToBigInt(jwk.n),\n    _base64ToBigInt(jwk.e),\n    _base64ToBigInt(jwk.d),\n    _base64ToBigInt(jwk.p),\n    _base64ToBigInt(jwk.q),\n    _base64ToBigInt(jwk.dp),\n    _base64ToBigInt(jwk.dq),\n    _base64ToBigInt(jwk.qi));\n}\n\nfunction _publicKeyFromJwk(jwk) {\n  if(jwk.kty !== 'RSA') {\n    throw new Error('Key algorithm must be \"RSA\".');\n  }\n  return pki.setRsaPublicKey(\n    _base64ToBigInt(jwk.n),\n    _base64ToBigInt(jwk.e));\n}\n\nfunction _base64ToBigInt(b64) {\n  return new BigInteger(forge.util.bytesToHex(forge.util.decode64(b64)), 16);\n}\n","// Copyright (c) 2005  Tom Wu\n// All Rights Reserved.\n// See \"LICENSE\" for details.\n\n// Basic JavaScript BN library - subset useful for RSA encryption.\n\n/*\nLicensing (LICENSE)\n-------------------\n\nThis software is covered under the following copyright:\n*/\n/*\n * Copyright (c) 2003-2005  Tom Wu\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS-IS\" AND WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY\n * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.\n *\n * IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL,\n * INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER\n * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF\n * THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT\n * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\n * In addition, the following condition applies:\n *\n * All redistributions must retain an intact copy of this copyright notice\n * and disclaimer.\n */\n/*\nAddress all questions regarding this license to:\n\n  Tom Wu\n  tjw@cs.Stanford.EDU\n*/\nvar forge = require('./forge');\n\nmodule.exports = forge.jsbn = forge.jsbn || {};\n\n// Bits per digit\nvar dbits;\n\n// JavaScript engine analysis\nvar canary = 0xdeadbeefcafe;\nvar j_lm = ((canary&0xffffff)==0xefcafe);\n\n// (public) Constructor\nfunction BigInteger(a,b,c) {\n  this.data = [];\n  if(a != null)\n    if(\"number\" == typeof a) this.fromNumber(a,b,c);\n    else if(b == null && \"string\" != typeof a) this.fromString(a,256);\n    else this.fromString(a,b);\n}\nforge.jsbn.BigInteger = BigInteger;\n\n// return new, unset BigInteger\nfunction nbi() { return new BigInteger(null); }\n\n// am: Compute w_j += (x*this_i), propagate carries,\n// c is initial carry, returns final carry.\n// c < 3*dvalue, x < 2*dvalue, this_i < dvalue\n// We need to select the fastest one that works in this environment.\n\n// am1: use a single mult and divide to get the high bits,\n// max digit bits should be 26 because\n// max internal value = 2*dvalue^2-2*dvalue (< 2^53)\nfunction am1(i,x,w,j,c,n) {\n  while(--n >= 0) {\n    var v = x*this.data[i++]+w.data[j]+c;\n    c = Math.floor(v/0x4000000);\n    w.data[j++] = v&0x3ffffff;\n  }\n  return c;\n}\n// am2 avoids a big mult-and-extract completely.\n// Max digit bits should be <= 30 because we do bitwise ops\n// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)\nfunction am2(i,x,w,j,c,n) {\n  var xl = x&0x7fff, xh = x>>15;\n  while(--n >= 0) {\n    var l = this.data[i]&0x7fff;\n    var h = this.data[i++]>>15;\n    var m = xh*l+h*xl;\n    l = xl*l+((m&0x7fff)<<15)+w.data[j]+(c&0x3fffffff);\n    c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n    w.data[j++] = l&0x3fffffff;\n  }\n  return c;\n}\n// Alternately, set max digit bits to 28 since some\n// browsers slow down when dealing with 32-bit numbers.\nfunction am3(i,x,w,j,c,n) {\n  var xl = x&0x3fff, xh = x>>14;\n  while(--n >= 0) {\n    var l = this.data[i]&0x3fff;\n    var h = this.data[i++]>>14;\n    var m = xh*l+h*xl;\n    l = xl*l+((m&0x3fff)<<14)+w.data[j]+c;\n    c = (l>>28)+(m>>14)+xh*h;\n    w.data[j++] = l&0xfffffff;\n  }\n  return c;\n}\n\n// node.js (no browser)\nif(typeof(navigator) === 'undefined')\n{\n   BigInteger.prototype.am = am3;\n   dbits = 28;\n} else if(j_lm && (navigator.appName == \"Microsoft Internet Explorer\")) {\n  BigInteger.prototype.am = am2;\n  dbits = 30;\n} else if(j_lm && (navigator.appName != \"Netscape\")) {\n  BigInteger.prototype.am = am1;\n  dbits = 26;\n} else { // Mozilla/Netscape seems to prefer am3\n  BigInteger.prototype.am = am3;\n  dbits = 28;\n}\n\nBigInteger.prototype.DB = dbits;\nBigInteger.prototype.DM = ((1<<dbits)-1);\nBigInteger.prototype.DV = (1<<dbits);\n\nvar BI_FP = 52;\nBigInteger.prototype.FV = Math.pow(2,BI_FP);\nBigInteger.prototype.F1 = BI_FP-dbits;\nBigInteger.prototype.F2 = 2*dbits-BI_FP;\n\n// Digit conversions\nvar BI_RM = \"0123456789abcdefghijklmnopqrstuvwxyz\";\nvar BI_RC = new Array();\nvar rr,vv;\nrr = \"0\".charCodeAt(0);\nfor(vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;\nrr = \"a\".charCodeAt(0);\nfor(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;\nrr = \"A\".charCodeAt(0);\nfor(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;\n\nfunction int2char(n) { return BI_RM.charAt(n); }\nfunction intAt(s,i) {\n  var c = BI_RC[s.charCodeAt(i)];\n  return (c==null)?-1:c;\n}\n\n// (protected) copy this to r\nfunction bnpCopyTo(r) {\n  for(var i = this.t-1; i >= 0; --i) r.data[i] = this.data[i];\n  r.t = this.t;\n  r.s = this.s;\n}\n\n// (protected) set from integer value x, -DV <= x < DV\nfunction bnpFromInt(x) {\n  this.t = 1;\n  this.s = (x<0)?-1:0;\n  if(x > 0) this.data[0] = x;\n  else if(x < -1) this.data[0] = x+this.DV;\n  else this.t = 0;\n}\n\n// return bigint initialized to value\nfunction nbv(i) { var r = nbi(); r.fromInt(i); return r; }\n\n// (protected) set from string and radix\nfunction bnpFromString(s,b) {\n  var k;\n  if(b == 16) k = 4;\n  else if(b == 8) k = 3;\n  else if(b == 256) k = 8; // byte array\n  else if(b == 2) k = 1;\n  else if(b == 32) k = 5;\n  else if(b == 4) k = 2;\n  else { this.fromRadix(s,b); return; }\n  this.t = 0;\n  this.s = 0;\n  var i = s.length, mi = false, sh = 0;\n  while(--i >= 0) {\n    var x = (k==8)?s[i]&0xff:intAt(s,i);\n    if(x < 0) {\n      if(s.charAt(i) == \"-\") mi = true;\n      continue;\n    }\n    mi = false;\n    if(sh == 0)\n      this.data[this.t++] = x;\n    else if(sh+k > this.DB) {\n      this.data[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;\n      this.data[this.t++] = (x>>(this.DB-sh));\n    } else\n      this.data[this.t-1] |= x<<sh;\n    sh += k;\n    if(sh >= this.DB) sh -= this.DB;\n  }\n  if(k == 8 && (s[0]&0x80) != 0) {\n    this.s = -1;\n    if(sh > 0) this.data[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;\n  }\n  this.clamp();\n  if(mi) BigInteger.ZERO.subTo(this,this);\n}\n\n// (protected) clamp off excess high words\nfunction bnpClamp() {\n  var c = this.s&this.DM;\n  while(this.t > 0 && this.data[this.t-1] == c) --this.t;\n}\n\n// (public) return string representation in given radix\nfunction bnToString(b) {\n  if(this.s < 0) return \"-\"+this.negate().toString(b);\n  var k;\n  if(b == 16) k = 4;\n  else if(b == 8) k = 3;\n  else if(b == 2) k = 1;\n  else if(b == 32) k = 5;\n  else if(b == 4) k = 2;\n  else return this.toRadix(b);\n  var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n  var p = this.DB-(i*this.DB)%k;\n  if(i-- > 0) {\n    if(p < this.DB && (d = this.data[i]>>p) > 0) { m = true; r = int2char(d); }\n    while(i >= 0) {\n      if(p < k) {\n        d = (this.data[i]&((1<<p)-1))<<(k-p);\n        d |= this.data[--i]>>(p+=this.DB-k);\n      } else {\n        d = (this.data[i]>>(p-=k))&km;\n        if(p <= 0) { p += this.DB; --i; }\n      }\n      if(d > 0) m = true;\n      if(m) r += int2char(d);\n    }\n  }\n  return m?r:\"0\";\n}\n\n// (public) -this\nfunction bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); return r; }\n\n// (public) |this|\nfunction bnAbs() { return (this.s<0)?this.negate():this; }\n\n// (public) return + if this > a, - if this < a, 0 if equal\nfunction bnCompareTo(a) {\n  var r = this.s-a.s;\n  if(r != 0) return r;\n  var i = this.t;\n  r = i-a.t;\n  if(r != 0) return (this.s<0)?-r:r;\n  while(--i >= 0) if((r=this.data[i]-a.data[i]) != 0) return r;\n  return 0;\n}\n\n// returns bit length of the integer x\nfunction nbits(x) {\n  var r = 1, t;\n  if((t=x>>>16) != 0) { x = t; r += 16; }\n  if((t=x>>8) != 0) { x = t; r += 8; }\n  if((t=x>>4) != 0) { x = t; r += 4; }\n  if((t=x>>2) != 0) { x = t; r += 2; }\n  if((t=x>>1) != 0) { x = t; r += 1; }\n  return r;\n}\n\n// (public) return the number of bits in \"this\"\nfunction bnBitLength() {\n  if(this.t <= 0) return 0;\n  return this.DB*(this.t-1)+nbits(this.data[this.t-1]^(this.s&this.DM));\n}\n\n// (protected) r = this << n*DB\nfunction bnpDLShiftTo(n,r) {\n  var i;\n  for(i = this.t-1; i >= 0; --i) r.data[i+n] = this.data[i];\n  for(i = n-1; i >= 0; --i) r.data[i] = 0;\n  r.t = this.t+n;\n  r.s = this.s;\n}\n\n// (protected) r = this >> n*DB\nfunction bnpDRShiftTo(n,r) {\n  for(var i = n; i < this.t; ++i) r.data[i-n] = this.data[i];\n  r.t = Math.max(this.t-n,0);\n  r.s = this.s;\n}\n\n// (protected) r = this << n\nfunction bnpLShiftTo(n,r) {\n  var bs = n%this.DB;\n  var cbs = this.DB-bs;\n  var bm = (1<<cbs)-1;\n  var ds = Math.floor(n/this.DB), c = (this.s<<bs)&this.DM, i;\n  for(i = this.t-1; i >= 0; --i) {\n    r.data[i+ds+1] = (this.data[i]>>cbs)|c;\n    c = (this.data[i]&bm)<<bs;\n  }\n  for(i = ds-1; i >= 0; --i) r.data[i] = 0;\n  r.data[ds] = c;\n  r.t = this.t+ds+1;\n  r.s = this.s;\n  r.clamp();\n}\n\n// (protected) r = this >> n\nfunction bnpRShiftTo(n,r) {\n  r.s = this.s;\n  var ds = Math.floor(n/this.DB);\n  if(ds >= this.t) { r.t = 0; return; }\n  var bs = n%this.DB;\n  var cbs = this.DB-bs;\n  var bm = (1<<bs)-1;\n  r.data[0] = this.data[ds]>>bs;\n  for(var i = ds+1; i < this.t; ++i) {\n    r.data[i-ds-1] |= (this.data[i]&bm)<<cbs;\n    r.data[i-ds] = this.data[i]>>bs;\n  }\n  if(bs > 0) r.data[this.t-ds-1] |= (this.s&bm)<<cbs;\n  r.t = this.t-ds;\n  r.clamp();\n}\n\n// (protected) r = this - a\nfunction bnpSubTo(a,r) {\n  var i = 0, c = 0, m = Math.min(a.t,this.t);\n  while(i < m) {\n    c += this.data[i]-a.data[i];\n    r.data[i++] = c&this.DM;\n    c >>= this.DB;\n  }\n  if(a.t < this.t) {\n    c -= a.s;\n    while(i < this.t) {\n      c += this.data[i];\n      r.data[i++] = c&this.DM;\n      c >>= this.DB;\n    }\n    c += this.s;\n  } else {\n    c += this.s;\n    while(i < a.t) {\n      c -= a.data[i];\n      r.data[i++] = c&this.DM;\n      c >>= this.DB;\n    }\n    c -= a.s;\n  }\n  r.s = (c<0)?-1:0;\n  if(c < -1) r.data[i++] = this.DV+c;\n  else if(c > 0) r.data[i++] = c;\n  r.t = i;\n  r.clamp();\n}\n\n// (protected) r = this * a, r != this,a (HAC 14.12)\n// \"this\" should be the larger one if appropriate.\nfunction bnpMultiplyTo(a,r) {\n  var x = this.abs(), y = a.abs();\n  var i = x.t;\n  r.t = i+y.t;\n  while(--i >= 0) r.data[i] = 0;\n  for(i = 0; i < y.t; ++i) r.data[i+x.t] = x.am(0,y.data[i],r,i,0,x.t);\n  r.s = 0;\n  r.clamp();\n  if(this.s != a.s) BigInteger.ZERO.subTo(r,r);\n}\n\n// (protected) r = this^2, r != this (HAC 14.16)\nfunction bnpSquareTo(r) {\n  var x = this.abs();\n  var i = r.t = 2*x.t;\n  while(--i >= 0) r.data[i] = 0;\n  for(i = 0; i < x.t-1; ++i) {\n    var c = x.am(i,x.data[i],r,2*i,0,1);\n    if((r.data[i+x.t]+=x.am(i+1,2*x.data[i],r,2*i+1,c,x.t-i-1)) >= x.DV) {\n      r.data[i+x.t] -= x.DV;\n      r.data[i+x.t+1] = 1;\n    }\n  }\n  if(r.t > 0) r.data[r.t-1] += x.am(i,x.data[i],r,2*i,0,1);\n  r.s = 0;\n  r.clamp();\n}\n\n// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)\n// r != q, this != m.  q or r may be null.\nfunction bnpDivRemTo(m,q,r) {\n  var pm = m.abs();\n  if(pm.t <= 0) return;\n  var pt = this.abs();\n  if(pt.t < pm.t) {\n    if(q != null) q.fromInt(0);\n    if(r != null) this.copyTo(r);\n    return;\n  }\n  if(r == null) r = nbi();\n  var y = nbi(), ts = this.s, ms = m.s;\n  var nsh = this.DB-nbits(pm.data[pm.t-1]);\t// normalize modulus\n  if(nsh > 0) { pm.lShiftTo(nsh,y); pt.lShiftTo(nsh,r); } else { pm.copyTo(y); pt.copyTo(r); }\n  var ys = y.t;\n  var y0 = y.data[ys-1];\n  if(y0 == 0) return;\n  var yt = y0*(1<<this.F1)+((ys>1)?y.data[ys-2]>>this.F2:0);\n  var d1 = this.FV/yt, d2 = (1<<this.F1)/yt, e = 1<<this.F2;\n  var i = r.t, j = i-ys, t = (q==null)?nbi():q;\n  y.dlShiftTo(j,t);\n  if(r.compareTo(t) >= 0) {\n    r.data[r.t++] = 1;\n    r.subTo(t,r);\n  }\n  BigInteger.ONE.dlShiftTo(ys,t);\n  t.subTo(y,y);\t// \"negative\" y so we can replace sub with am later\n  while(y.t < ys) y.data[y.t++] = 0;\n  while(--j >= 0) {\n    // Estimate quotient digit\n    var qd = (r.data[--i]==y0)?this.DM:Math.floor(r.data[i]*d1+(r.data[i-1]+e)*d2);\n    if((r.data[i]+=y.am(0,qd,r,j,0,ys)) < qd) {\t// Try it out\n      y.dlShiftTo(j,t);\n      r.subTo(t,r);\n      while(r.data[i] < --qd) r.subTo(t,r);\n    }\n  }\n  if(q != null) {\n    r.drShiftTo(ys,q);\n    if(ts != ms) BigInteger.ZERO.subTo(q,q);\n  }\n  r.t = ys;\n  r.clamp();\n  if(nsh > 0) r.rShiftTo(nsh,r);\t// Denormalize remainder\n  if(ts < 0) BigInteger.ZERO.subTo(r,r);\n}\n\n// (public) this mod a\nfunction bnMod(a) {\n  var r = nbi();\n  this.abs().divRemTo(a,null,r);\n  if(this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r,r);\n  return r;\n}\n\n// Modular reduction using \"classic\" algorithm\nfunction Classic(m) { this.m = m; }\nfunction cConvert(x) {\n  if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);\n  else return x;\n}\nfunction cRevert(x) { return x; }\nfunction cReduce(x) { x.divRemTo(this.m,null,x); }\nfunction cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\nfunction cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\nClassic.prototype.convert = cConvert;\nClassic.prototype.revert = cRevert;\nClassic.prototype.reduce = cReduce;\nClassic.prototype.mulTo = cMulTo;\nClassic.prototype.sqrTo = cSqrTo;\n\n// (protected) return \"-1/this % 2^DB\"; useful for Mont. reduction\n// justification:\n//         xy == 1 (mod m)\n//         xy =  1+km\n//   xy(2-xy) = (1+km)(1-km)\n// x[y(2-xy)] = 1-k^2m^2\n// x[y(2-xy)] == 1 (mod m^2)\n// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2\n// should reduce x and y(2-xy) by m^2 at each step to keep size bounded.\n// JS multiply \"overflows\" differently from C/C++, so care is needed here.\nfunction bnpInvDigit() {\n  if(this.t < 1) return 0;\n  var x = this.data[0];\n  if((x&1) == 0) return 0;\n  var y = x&3;\t\t// y == 1/x mod 2^2\n  y = (y*(2-(x&0xf)*y))&0xf;\t// y == 1/x mod 2^4\n  y = (y*(2-(x&0xff)*y))&0xff;\t// y == 1/x mod 2^8\n  y = (y*(2-(((x&0xffff)*y)&0xffff)))&0xffff;\t// y == 1/x mod 2^16\n  // last step - calculate inverse mod DV directly;\n  // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints\n  y = (y*(2-x*y%this.DV))%this.DV;\t\t// y == 1/x mod 2^dbits\n  // we really want the negative inverse, and -DV < y < DV\n  return (y>0)?this.DV-y:-y;\n}\n\n// Montgomery reduction\nfunction Montgomery(m) {\n  this.m = m;\n  this.mp = m.invDigit();\n  this.mpl = this.mp&0x7fff;\n  this.mph = this.mp>>15;\n  this.um = (1<<(m.DB-15))-1;\n  this.mt2 = 2*m.t;\n}\n\n// xR mod m\nfunction montConvert(x) {\n  var r = nbi();\n  x.abs().dlShiftTo(this.m.t,r);\n  r.divRemTo(this.m,null,r);\n  if(x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r,r);\n  return r;\n}\n\n// x/R mod m\nfunction montRevert(x) {\n  var r = nbi();\n  x.copyTo(r);\n  this.reduce(r);\n  return r;\n}\n\n// x = x/R mod m (HAC 14.32)\nfunction montReduce(x) {\n  while(x.t <= this.mt2)\t// pad x so am has enough room later\n    x.data[x.t++] = 0;\n  for(var i = 0; i < this.m.t; ++i) {\n    // faster way of calculating u0 = x.data[i]*mp mod DV\n    var j = x.data[i]&0x7fff;\n    var u0 = (j*this.mpl+(((j*this.mph+(x.data[i]>>15)*this.mpl)&this.um)<<15))&x.DM;\n    // use am to combine the multiply-shift-add into one call\n    j = i+this.m.t;\n    x.data[j] += this.m.am(0,u0,x,i,0,this.m.t);\n    // propagate carry\n    while(x.data[j] >= x.DV) { x.data[j] -= x.DV; x.data[++j]++; }\n  }\n  x.clamp();\n  x.drShiftTo(this.m.t,x);\n  if(x.compareTo(this.m) >= 0) x.subTo(this.m,x);\n}\n\n// r = \"x^2/R mod m\"; x != r\nfunction montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n// r = \"xy/R mod m\"; x,y != r\nfunction montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n\nMontgomery.prototype.convert = montConvert;\nMontgomery.prototype.revert = montRevert;\nMontgomery.prototype.reduce = montReduce;\nMontgomery.prototype.mulTo = montMulTo;\nMontgomery.prototype.sqrTo = montSqrTo;\n\n// (protected) true iff this is even\nfunction bnpIsEven() { return ((this.t>0)?(this.data[0]&1):this.s) == 0; }\n\n// (protected) this^e, e < 2^32, doing sqr and mul with \"r\" (HAC 14.79)\nfunction bnpExp(e,z) {\n  if(e > 0xffffffff || e < 1) return BigInteger.ONE;\n  var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e)-1;\n  g.copyTo(r);\n  while(--i >= 0) {\n    z.sqrTo(r,r2);\n    if((e&(1<<i)) > 0) z.mulTo(r2,g,r);\n    else { var t = r; r = r2; r2 = t; }\n  }\n  return z.revert(r);\n}\n\n// (public) this^e % m, 0 <= e < 2^32\nfunction bnModPowInt(e,m) {\n  var z;\n  if(e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);\n  return this.exp(e,z);\n}\n\n// protected\nBigInteger.prototype.copyTo = bnpCopyTo;\nBigInteger.prototype.fromInt = bnpFromInt;\nBigInteger.prototype.fromString = bnpFromString;\nBigInteger.prototype.clamp = bnpClamp;\nBigInteger.prototype.dlShiftTo = bnpDLShiftTo;\nBigInteger.prototype.drShiftTo = bnpDRShiftTo;\nBigInteger.prototype.lShiftTo = bnpLShiftTo;\nBigInteger.prototype.rShiftTo = bnpRShiftTo;\nBigInteger.prototype.subTo = bnpSubTo;\nBigInteger.prototype.multiplyTo = bnpMultiplyTo;\nBigInteger.prototype.squareTo = bnpSquareTo;\nBigInteger.prototype.divRemTo = bnpDivRemTo;\nBigInteger.prototype.invDigit = bnpInvDigit;\nBigInteger.prototype.isEven = bnpIsEven;\nBigInteger.prototype.exp = bnpExp;\n\n// public\nBigInteger.prototype.toString = bnToString;\nBigInteger.prototype.negate = bnNegate;\nBigInteger.prototype.abs = bnAbs;\nBigInteger.prototype.compareTo = bnCompareTo;\nBigInteger.prototype.bitLength = bnBitLength;\nBigInteger.prototype.mod = bnMod;\nBigInteger.prototype.modPowInt = bnModPowInt;\n\n// \"constants\"\nBigInteger.ZERO = nbv(0);\nBigInteger.ONE = nbv(1);\n\n// jsbn2 lib\n\n//Copyright (c) 2005-2009  Tom Wu\n//All Rights Reserved.\n//See \"LICENSE\" for details (See jsbn.js for LICENSE).\n\n//Extended JavaScript BN functions, required for RSA private ops.\n\n//Version 1.1: new BigInteger(\"0\", 10) returns \"proper\" zero\n\n//(public)\nfunction bnClone() { var r = nbi(); this.copyTo(r); return r; }\n\n//(public) return value as integer\nfunction bnIntValue() {\nif(this.s < 0) {\n if(this.t == 1) return this.data[0]-this.DV;\n else if(this.t == 0) return -1;\n} else if(this.t == 1) return this.data[0];\nelse if(this.t == 0) return 0;\n// assumes 16 < DB < 32\nreturn ((this.data[1]&((1<<(32-this.DB))-1))<<this.DB)|this.data[0];\n}\n\n//(public) return value as byte\nfunction bnByteValue() { return (this.t==0)?this.s:(this.data[0]<<24)>>24; }\n\n//(public) return value as short (assumes DB>=16)\nfunction bnShortValue() { return (this.t==0)?this.s:(this.data[0]<<16)>>16; }\n\n//(protected) return x s.t. r^x < DV\nfunction bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }\n\n//(public) 0 if this == 0, 1 if this > 0\nfunction bnSigNum() {\nif(this.s < 0) return -1;\nelse if(this.t <= 0 || (this.t == 1 && this.data[0] <= 0)) return 0;\nelse return 1;\n}\n\n//(protected) convert to radix string\nfunction bnpToRadix(b) {\nif(b == null) b = 10;\nif(this.signum() == 0 || b < 2 || b > 36) return \"0\";\nvar cs = this.chunkSize(b);\nvar a = Math.pow(b,cs);\nvar d = nbv(a), y = nbi(), z = nbi(), r = \"\";\nthis.divRemTo(d,y,z);\nwhile(y.signum() > 0) {\n r = (a+z.intValue()).toString(b).substr(1) + r;\n y.divRemTo(d,y,z);\n}\nreturn z.intValue().toString(b) + r;\n}\n\n//(protected) convert from radix string\nfunction bnpFromRadix(s,b) {\nthis.fromInt(0);\nif(b == null) b = 10;\nvar cs = this.chunkSize(b);\nvar d = Math.pow(b,cs), mi = false, j = 0, w = 0;\nfor(var i = 0; i < s.length; ++i) {\n var x = intAt(s,i);\n if(x < 0) {\n   if(s.charAt(i) == \"-\" && this.signum() == 0) mi = true;\n   continue;\n }\n w = b*w+x;\n if(++j >= cs) {\n   this.dMultiply(d);\n   this.dAddOffset(w,0);\n   j = 0;\n   w = 0;\n }\n}\nif(j > 0) {\n this.dMultiply(Math.pow(b,j));\n this.dAddOffset(w,0);\n}\nif(mi) BigInteger.ZERO.subTo(this,this);\n}\n\n//(protected) alternate constructor\nfunction bnpFromNumber(a,b,c) {\nif(\"number\" == typeof b) {\n // new BigInteger(int,int,RNG)\n if(a < 2) this.fromInt(1);\n else {\n   this.fromNumber(a,c);\n   if(!this.testBit(a-1))  // force MSB set\n     this.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,this);\n   if(this.isEven()) this.dAddOffset(1,0); // force odd\n   while(!this.isProbablePrime(b)) {\n     this.dAddOffset(2,0);\n     if(this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a-1),this);\n   }\n }\n} else {\n // new BigInteger(int,RNG)\n var x = new Array(), t = a&7;\n x.length = (a>>3)+1;\n b.nextBytes(x);\n if(t > 0) x[0] &= ((1<<t)-1); else x[0] = 0;\n this.fromString(x,256);\n}\n}\n\n//(public) convert to bigendian byte array\nfunction bnToByteArray() {\nvar i = this.t, r = new Array();\nr[0] = this.s;\nvar p = this.DB-(i*this.DB)%8, d, k = 0;\nif(i-- > 0) {\n if(p < this.DB && (d = this.data[i]>>p) != (this.s&this.DM)>>p)\n   r[k++] = d|(this.s<<(this.DB-p));\n while(i >= 0) {\n   if(p < 8) {\n     d = (this.data[i]&((1<<p)-1))<<(8-p);\n     d |= this.data[--i]>>(p+=this.DB-8);\n   } else {\n     d = (this.data[i]>>(p-=8))&0xff;\n     if(p <= 0) { p += this.DB; --i; }\n   }\n   if((d&0x80) != 0) d |= -256;\n   if(k == 0 && (this.s&0x80) != (d&0x80)) ++k;\n   if(k > 0 || d != this.s) r[k++] = d;\n }\n}\nreturn r;\n}\n\nfunction bnEquals(a) { return(this.compareTo(a)==0); }\nfunction bnMin(a) { return(this.compareTo(a)<0)?this:a; }\nfunction bnMax(a) { return(this.compareTo(a)>0)?this:a; }\n\n//(protected) r = this op a (bitwise)\nfunction bnpBitwiseTo(a,op,r) {\nvar i, f, m = Math.min(a.t,this.t);\nfor(i = 0; i < m; ++i) r.data[i] = op(this.data[i],a.data[i]);\nif(a.t < this.t) {\n f = a.s&this.DM;\n for(i = m; i < this.t; ++i) r.data[i] = op(this.data[i],f);\n r.t = this.t;\n} else {\n f = this.s&this.DM;\n for(i = m; i < a.t; ++i) r.data[i] = op(f,a.data[i]);\n r.t = a.t;\n}\nr.s = op(this.s,a.s);\nr.clamp();\n}\n\n//(public) this & a\nfunction op_and(x,y) { return x&y; }\nfunction bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }\n\n//(public) this | a\nfunction op_or(x,y) { return x|y; }\nfunction bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }\n\n//(public) this ^ a\nfunction op_xor(x,y) { return x^y; }\nfunction bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }\n\n//(public) this & ~a\nfunction op_andnot(x,y) { return x&~y; }\nfunction bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }\n\n//(public) ~this\nfunction bnNot() {\nvar r = nbi();\nfor(var i = 0; i < this.t; ++i) r.data[i] = this.DM&~this.data[i];\nr.t = this.t;\nr.s = ~this.s;\nreturn r;\n}\n\n//(public) this << n\nfunction bnShiftLeft(n) {\nvar r = nbi();\nif(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);\nreturn r;\n}\n\n//(public) this >> n\nfunction bnShiftRight(n) {\nvar r = nbi();\nif(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r);\nreturn r;\n}\n\n//return index of lowest 1-bit in x, x < 2^31\nfunction lbit(x) {\nif(x == 0) return -1;\nvar r = 0;\nif((x&0xffff) == 0) { x >>= 16; r += 16; }\nif((x&0xff) == 0) { x >>= 8; r += 8; }\nif((x&0xf) == 0) { x >>= 4; r += 4; }\nif((x&3) == 0) { x >>= 2; r += 2; }\nif((x&1) == 0) ++r;\nreturn r;\n}\n\n//(public) returns index of lowest 1-bit (or -1 if none)\nfunction bnGetLowestSetBit() {\nfor(var i = 0; i < this.t; ++i)\n if(this.data[i] != 0) return i*this.DB+lbit(this.data[i]);\nif(this.s < 0) return this.t*this.DB;\nreturn -1;\n}\n\n//return number of 1 bits in x\nfunction cbit(x) {\nvar r = 0;\nwhile(x != 0) { x &= x-1; ++r; }\nreturn r;\n}\n\n//(public) return number of set bits\nfunction bnBitCount() {\nvar r = 0, x = this.s&this.DM;\nfor(var i = 0; i < this.t; ++i) r += cbit(this.data[i]^x);\nreturn r;\n}\n\n//(public) true iff nth bit is set\nfunction bnTestBit(n) {\nvar j = Math.floor(n/this.DB);\nif(j >= this.t) return(this.s!=0);\nreturn((this.data[j]&(1<<(n%this.DB)))!=0);\n}\n\n//(protected) this op (1<<n)\nfunction bnpChangeBit(n,op) {\nvar r = BigInteger.ONE.shiftLeft(n);\nthis.bitwiseTo(r,op,r);\nreturn r;\n}\n\n//(public) this | (1<<n)\nfunction bnSetBit(n) { return this.changeBit(n,op_or); }\n\n//(public) this & ~(1<<n)\nfunction bnClearBit(n) { return this.changeBit(n,op_andnot); }\n\n//(public) this ^ (1<<n)\nfunction bnFlipBit(n) { return this.changeBit(n,op_xor); }\n\n//(protected) r = this + a\nfunction bnpAddTo(a,r) {\nvar i = 0, c = 0, m = Math.min(a.t,this.t);\nwhile(i < m) {\n c += this.data[i]+a.data[i];\n r.data[i++] = c&this.DM;\n c >>= this.DB;\n}\nif(a.t < this.t) {\n c += a.s;\n while(i < this.t) {\n   c += this.data[i];\n   r.data[i++] = c&this.DM;\n   c >>= this.DB;\n }\n c += this.s;\n} else {\n c += this.s;\n while(i < a.t) {\n   c += a.data[i];\n   r.data[i++] = c&this.DM;\n   c >>= this.DB;\n }\n c += a.s;\n}\nr.s = (c<0)?-1:0;\nif(c > 0) r.data[i++] = c;\nelse if(c < -1) r.data[i++] = this.DV+c;\nr.t = i;\nr.clamp();\n}\n\n//(public) this + a\nfunction bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }\n\n//(public) this - a\nfunction bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }\n\n//(public) this * a\nfunction bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }\n\n//(public) this / a\nfunction bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }\n\n//(public) this % a\nfunction bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }\n\n//(public) [this/a,this%a]\nfunction bnDivideAndRemainder(a) {\nvar q = nbi(), r = nbi();\nthis.divRemTo(a,q,r);\nreturn new Array(q,r);\n}\n\n//(protected) this *= n, this >= 0, 1 < n < DV\nfunction bnpDMultiply(n) {\nthis.data[this.t] = this.am(0,n-1,this,0,0,this.t);\n++this.t;\nthis.clamp();\n}\n\n//(protected) this += n << w words, this >= 0\nfunction bnpDAddOffset(n,w) {\nif(n == 0) return;\nwhile(this.t <= w) this.data[this.t++] = 0;\nthis.data[w] += n;\nwhile(this.data[w] >= this.DV) {\n this.data[w] -= this.DV;\n if(++w >= this.t) this.data[this.t++] = 0;\n ++this.data[w];\n}\n}\n\n//A \"null\" reducer\nfunction NullExp() {}\nfunction nNop(x) { return x; }\nfunction nMulTo(x,y,r) { x.multiplyTo(y,r); }\nfunction nSqrTo(x,r) { x.squareTo(r); }\n\nNullExp.prototype.convert = nNop;\nNullExp.prototype.revert = nNop;\nNullExp.prototype.mulTo = nMulTo;\nNullExp.prototype.sqrTo = nSqrTo;\n\n//(public) this^e\nfunction bnPow(e) { return this.exp(e,new NullExp()); }\n\n//(protected) r = lower n words of \"this * a\", a.t <= n\n//\"this\" should be the larger one if appropriate.\nfunction bnpMultiplyLowerTo(a,n,r) {\nvar i = Math.min(this.t+a.t,n);\nr.s = 0; // assumes a,this >= 0\nr.t = i;\nwhile(i > 0) r.data[--i] = 0;\nvar j;\nfor(j = r.t-this.t; i < j; ++i) r.data[i+this.t] = this.am(0,a.data[i],r,i,0,this.t);\nfor(j = Math.min(a.t,n); i < j; ++i) this.am(0,a.data[i],r,i,0,n-i);\nr.clamp();\n}\n\n//(protected) r = \"this * a\" without lower n words, n > 0\n//\"this\" should be the larger one if appropriate.\nfunction bnpMultiplyUpperTo(a,n,r) {\n--n;\nvar i = r.t = this.t+a.t-n;\nr.s = 0; // assumes a,this >= 0\nwhile(--i >= 0) r.data[i] = 0;\nfor(i = Math.max(n-this.t,0); i < a.t; ++i)\n r.data[this.t+i-n] = this.am(n-i,a.data[i],r,0,0,this.t+i-n);\nr.clamp();\nr.drShiftTo(1,r);\n}\n\n//Barrett modular reduction\nfunction Barrett(m) {\n// setup Barrett\nthis.r2 = nbi();\nthis.q3 = nbi();\nBigInteger.ONE.dlShiftTo(2*m.t,this.r2);\nthis.mu = this.r2.divide(m);\nthis.m = m;\n}\n\nfunction barrettConvert(x) {\nif(x.s < 0 || x.t > 2*this.m.t) return x.mod(this.m);\nelse if(x.compareTo(this.m) < 0) return x;\nelse { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }\n}\n\nfunction barrettRevert(x) { return x; }\n\n//x = x mod m (HAC 14.42)\nfunction barrettReduce(x) {\nx.drShiftTo(this.m.t-1,this.r2);\nif(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); }\nthis.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3);\nthis.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);\nwhile(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1);\nx.subTo(this.r2,x);\nwhile(x.compareTo(this.m) >= 0) x.subTo(this.m,x);\n}\n\n//r = x^2 mod m; x != r\nfunction barrettSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n//r = x*y mod m; x,y != r\nfunction barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n\nBarrett.prototype.convert = barrettConvert;\nBarrett.prototype.revert = barrettRevert;\nBarrett.prototype.reduce = barrettReduce;\nBarrett.prototype.mulTo = barrettMulTo;\nBarrett.prototype.sqrTo = barrettSqrTo;\n\n//(public) this^e % m (HAC 14.85)\nfunction bnModPow(e,m) {\nvar i = e.bitLength(), k, r = nbv(1), z;\nif(i <= 0) return r;\nelse if(i < 18) k = 1;\nelse if(i < 48) k = 3;\nelse if(i < 144) k = 4;\nelse if(i < 768) k = 5;\nelse k = 6;\nif(i < 8)\n z = new Classic(m);\nelse if(m.isEven())\n z = new Barrett(m);\nelse\n z = new Montgomery(m);\n\n// precomputation\nvar g = new Array(), n = 3, k1 = k-1, km = (1<<k)-1;\ng[1] = z.convert(this);\nif(k > 1) {\n var g2 = nbi();\n z.sqrTo(g[1],g2);\n while(n <= km) {\n   g[n] = nbi();\n   z.mulTo(g2,g[n-2],g[n]);\n   n += 2;\n }\n}\n\nvar j = e.t-1, w, is1 = true, r2 = nbi(), t;\ni = nbits(e.data[j])-1;\nwhile(j >= 0) {\n if(i >= k1) w = (e.data[j]>>(i-k1))&km;\n else {\n   w = (e.data[j]&((1<<(i+1))-1))<<(k1-i);\n   if(j > 0) w |= e.data[j-1]>>(this.DB+i-k1);\n }\n\n n = k;\n while((w&1) == 0) { w >>= 1; --n; }\n if((i -= n) < 0) { i += this.DB; --j; }\n if(is1) {  // ret == 1, don't bother squaring or multiplying it\n   g[w].copyTo(r);\n   is1 = false;\n } else {\n   while(n > 1) { z.sqrTo(r,r2); z.sqrTo(r2,r); n -= 2; }\n   if(n > 0) z.sqrTo(r,r2); else { t = r; r = r2; r2 = t; }\n   z.mulTo(r2,g[w],r);\n }\n\n while(j >= 0 && (e.data[j]&(1<<i)) == 0) {\n   z.sqrTo(r,r2); t = r; r = r2; r2 = t;\n   if(--i < 0) { i = this.DB-1; --j; }\n }\n}\nreturn z.revert(r);\n}\n\n//(public) gcd(this,a) (HAC 14.54)\nfunction bnGCD(a) {\nvar x = (this.s<0)?this.negate():this.clone();\nvar y = (a.s<0)?a.negate():a.clone();\nif(x.compareTo(y) < 0) { var t = x; x = y; y = t; }\nvar i = x.getLowestSetBit(), g = y.getLowestSetBit();\nif(g < 0) return x;\nif(i < g) g = i;\nif(g > 0) {\n x.rShiftTo(g,x);\n y.rShiftTo(g,y);\n}\nwhile(x.signum() > 0) {\n if((i = x.getLowestSetBit()) > 0) x.rShiftTo(i,x);\n if((i = y.getLowestSetBit()) > 0) y.rShiftTo(i,y);\n if(x.compareTo(y) >= 0) {\n   x.subTo(y,x);\n   x.rShiftTo(1,x);\n } else {\n   y.subTo(x,y);\n   y.rShiftTo(1,y);\n }\n}\nif(g > 0) y.lShiftTo(g,y);\nreturn y;\n}\n\n//(protected) this % n, n < 2^26\nfunction bnpModInt(n) {\nif(n <= 0) return 0;\nvar d = this.DV%n, r = (this.s<0)?n-1:0;\nif(this.t > 0)\n if(d == 0) r = this.data[0]%n;\n else for(var i = this.t-1; i >= 0; --i) r = (d*r+this.data[i])%n;\nreturn r;\n}\n\n//(public) 1/this % m (HAC 14.61)\nfunction bnModInverse(m) {\nvar ac = m.isEven();\nif((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;\nvar u = m.clone(), v = this.clone();\nvar a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);\nwhile(u.signum() != 0) {\n while(u.isEven()) {\n   u.rShiftTo(1,u);\n   if(ac) {\n     if(!a.isEven() || !b.isEven()) { a.addTo(this,a); b.subTo(m,b); }\n     a.rShiftTo(1,a);\n   } else if(!b.isEven()) b.subTo(m,b);\n   b.rShiftTo(1,b);\n }\n while(v.isEven()) {\n   v.rShiftTo(1,v);\n   if(ac) {\n     if(!c.isEven() || !d.isEven()) { c.addTo(this,c); d.subTo(m,d); }\n     c.rShiftTo(1,c);\n   } else if(!d.isEven()) d.subTo(m,d);\n   d.rShiftTo(1,d);\n }\n if(u.compareTo(v) >= 0) {\n   u.subTo(v,u);\n   if(ac) a.subTo(c,a);\n   b.subTo(d,b);\n } else {\n   v.subTo(u,v);\n   if(ac) c.subTo(a,c);\n   d.subTo(b,d);\n }\n}\nif(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;\nif(d.compareTo(m) >= 0) return d.subtract(m);\nif(d.signum() < 0) d.addTo(m,d); else return d;\nif(d.signum() < 0) return d.add(m); else return d;\n}\n\nvar lowprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509];\nvar lplim = (1<<26)/lowprimes[lowprimes.length-1];\n\n//(public) test primality with certainty >= 1-.5^t\nfunction bnIsProbablePrime(t) {\nvar i, x = this.abs();\nif(x.t == 1 && x.data[0] <= lowprimes[lowprimes.length-1]) {\n for(i = 0; i < lowprimes.length; ++i)\n   if(x.data[0] == lowprimes[i]) return true;\n return false;\n}\nif(x.isEven()) return false;\ni = 1;\nwhile(i < lowprimes.length) {\n var m = lowprimes[i], j = i+1;\n while(j < lowprimes.length && m < lplim) m *= lowprimes[j++];\n m = x.modInt(m);\n while(i < j) if(m%lowprimes[i++] == 0) return false;\n}\nreturn x.millerRabin(t);\n}\n\n//(protected) true if probably prime (HAC 4.24, Miller-Rabin)\nfunction bnpMillerRabin(t) {\nvar n1 = this.subtract(BigInteger.ONE);\nvar k = n1.getLowestSetBit();\nif(k <= 0) return false;\nvar r = n1.shiftRight(k);\nvar prng = bnGetPrng();\nvar a;\nfor(var i = 0; i < t; ++i) {\n // select witness 'a' at random from between 1 and n1\n do {\n   a = new BigInteger(this.bitLength(), prng);\n }\n while(a.compareTo(BigInteger.ONE) <= 0 || a.compareTo(n1) >= 0);\n var y = a.modPow(r,this);\n if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {\n   var j = 1;\n   while(j++ < k && y.compareTo(n1) != 0) {\n     y = y.modPowInt(2,this);\n     if(y.compareTo(BigInteger.ONE) == 0) return false;\n   }\n   if(y.compareTo(n1) != 0) return false;\n }\n}\nreturn true;\n}\n\n// get pseudo random number generator\nfunction bnGetPrng() {\n  // create prng with api that matches BigInteger secure random\n  return {\n    // x is an array to fill with bytes\n    nextBytes: function(x) {\n      for(var i = 0; i < x.length; ++i) {\n        x[i] = Math.floor(Math.random() * 0x0100);\n      }\n    }\n  };\n}\n\n//protected\nBigInteger.prototype.chunkSize = bnpChunkSize;\nBigInteger.prototype.toRadix = bnpToRadix;\nBigInteger.prototype.fromRadix = bnpFromRadix;\nBigInteger.prototype.fromNumber = bnpFromNumber;\nBigInteger.prototype.bitwiseTo = bnpBitwiseTo;\nBigInteger.prototype.changeBit = bnpChangeBit;\nBigInteger.prototype.addTo = bnpAddTo;\nBigInteger.prototype.dMultiply = bnpDMultiply;\nBigInteger.prototype.dAddOffset = bnpDAddOffset;\nBigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;\nBigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;\nBigInteger.prototype.modInt = bnpModInt;\nBigInteger.prototype.millerRabin = bnpMillerRabin;\n\n//public\nBigInteger.prototype.clone = bnClone;\nBigInteger.prototype.intValue = bnIntValue;\nBigInteger.prototype.byteValue = bnByteValue;\nBigInteger.prototype.shortValue = bnShortValue;\nBigInteger.prototype.signum = bnSigNum;\nBigInteger.prototype.toByteArray = bnToByteArray;\nBigInteger.prototype.equals = bnEquals;\nBigInteger.prototype.min = bnMin;\nBigInteger.prototype.max = bnMax;\nBigInteger.prototype.and = bnAnd;\nBigInteger.prototype.or = bnOr;\nBigInteger.prototype.xor = bnXor;\nBigInteger.prototype.andNot = bnAndNot;\nBigInteger.prototype.not = bnNot;\nBigInteger.prototype.shiftLeft = bnShiftLeft;\nBigInteger.prototype.shiftRight = bnShiftRight;\nBigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;\nBigInteger.prototype.bitCount = bnBitCount;\nBigInteger.prototype.testBit = bnTestBit;\nBigInteger.prototype.setBit = bnSetBit;\nBigInteger.prototype.clearBit = bnClearBit;\nBigInteger.prototype.flipBit = bnFlipBit;\nBigInteger.prototype.add = bnAdd;\nBigInteger.prototype.subtract = bnSubtract;\nBigInteger.prototype.multiply = bnMultiply;\nBigInteger.prototype.divide = bnDivide;\nBigInteger.prototype.remainder = bnRemainder;\nBigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;\nBigInteger.prototype.modPow = bnModPow;\nBigInteger.prototype.modInverse = bnModInverse;\nBigInteger.prototype.pow = bnPow;\nBigInteger.prototype.gcd = bnGCD;\nBigInteger.prototype.isProbablePrime = bnIsProbablePrime;\n\n//BigInteger interfaces not implemented in jsbn:\n\n//BigInteger(int signum, byte[] magnitude)\n//double doubleValue()\n//float floatValue()\n//int hashCode()\n//long longValue()\n//static BigInteger valueOf(long val)\n","/**\n * Partial implementation of PKCS#1 v2.2: RSA-OEAP\n *\n * Modified but based on the following MIT and BSD licensed code:\n *\n * https://github.com/kjur/jsjws/blob/master/rsa.js:\n *\n * The 'jsjws'(JSON Web Signature JavaScript Library) License\n *\n * Copyright (c) 2012 Kenji Urushima\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n * http://webrsa.cvs.sourceforge.net/viewvc/webrsa/Client/RSAES-OAEP.js?content-type=text%2Fplain:\n *\n * RSAES-OAEP.js\n * $Id: RSAES-OAEP.js,v 1.1.1.1 2003/03/19 15:37:20 ellispritchard Exp $\n * JavaScript Implementation of PKCS #1 v2.1 RSA CRYPTOGRAPHY STANDARD (RSA Laboratories, June 14, 2002)\n * Copyright (C) Ellis Pritchard, Guardian Unlimited 2003.\n * Contact: ellis@nukinetics.com\n * Distributed under the BSD License.\n *\n * Official documentation: http://www.rsa.com/rsalabs/node.asp?id=2125\n *\n * @author Evan Jones (http://evanjones.ca/)\n * @author Dave Longley\n *\n * Copyright (c) 2013-2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\nrequire('./random');\nrequire('./sha1');\n\n// shortcut for PKCS#1 API\nvar pkcs1 = module.exports = forge.pkcs1 = forge.pkcs1 || {};\n\n/**\n * Encode the given RSAES-OAEP message (M) using key, with optional label (L)\n * and seed.\n *\n * This method does not perform RSA encryption, it only encodes the message\n * using RSAES-OAEP.\n *\n * @param key the RSA key to use.\n * @param message the message to encode.\n * @param options the options to use:\n *          label an optional label to use.\n *          seed the seed to use.\n *          md the message digest object to use, undefined for SHA-1.\n *          mgf1 optional mgf1 parameters:\n *            md the message digest object to use for MGF1.\n *\n * @return the encoded message bytes.\n */\npkcs1.encode_rsa_oaep = function(key, message, options) {\n  // parse arguments\n  var label;\n  var seed;\n  var md;\n  var mgf1Md;\n  // legacy args (label, seed, md)\n  if(typeof options === 'string') {\n    label = options;\n    seed = arguments[3] || undefined;\n    md = arguments[4] || undefined;\n  } else if(options) {\n    label = options.label || undefined;\n    seed = options.seed || undefined;\n    md = options.md || undefined;\n    if(options.mgf1 && options.mgf1.md) {\n      mgf1Md = options.mgf1.md;\n    }\n  }\n\n  // default OAEP to SHA-1 message digest\n  if(!md) {\n    md = forge.md.sha1.create();\n  } else {\n    md.start();\n  }\n\n  // default MGF-1 to same as OAEP\n  if(!mgf1Md) {\n    mgf1Md = md;\n  }\n\n  // compute length in bytes and check output\n  var keyLength = Math.ceil(key.n.bitLength() / 8);\n  var maxLength = keyLength - 2 * md.digestLength - 2;\n  if(message.length > maxLength) {\n    var error = new Error('RSAES-OAEP input message length is too long.');\n    error.length = message.length;\n    error.maxLength = maxLength;\n    throw error;\n  }\n\n  if(!label) {\n    label = '';\n  }\n  md.update(label, 'raw');\n  var lHash = md.digest();\n\n  var PS = '';\n  var PS_length = maxLength - message.length;\n  for(var i = 0; i < PS_length; i++) {\n    PS += '\\x00';\n  }\n\n  var DB = lHash.getBytes() + PS + '\\x01' + message;\n\n  if(!seed) {\n    seed = forge.random.getBytes(md.digestLength);\n  } else if(seed.length !== md.digestLength) {\n    var error = new Error('Invalid RSAES-OAEP seed. The seed length must ' +\n      'match the digest length.');\n    error.seedLength = seed.length;\n    error.digestLength = md.digestLength;\n    throw error;\n  }\n\n  var dbMask = rsa_mgf1(seed, keyLength - md.digestLength - 1, mgf1Md);\n  var maskedDB = forge.util.xorBytes(DB, dbMask, DB.length);\n\n  var seedMask = rsa_mgf1(maskedDB, md.digestLength, mgf1Md);\n  var maskedSeed = forge.util.xorBytes(seed, seedMask, seed.length);\n\n  // return encoded message\n  return '\\x00' + maskedSeed + maskedDB;\n};\n\n/**\n * Decode the given RSAES-OAEP encoded message (EM) using key, with optional\n * label (L).\n *\n * This method does not perform RSA decryption, it only decodes the message\n * using RSAES-OAEP.\n *\n * @param key the RSA key to use.\n * @param em the encoded message to decode.\n * @param options the options to use:\n *          label an optional label to use.\n *          md the message digest object to use for OAEP, undefined for SHA-1.\n *          mgf1 optional mgf1 parameters:\n *            md the message digest object to use for MGF1.\n *\n * @return the decoded message bytes.\n */\npkcs1.decode_rsa_oaep = function(key, em, options) {\n  // parse args\n  var label;\n  var md;\n  var mgf1Md;\n  // legacy args\n  if(typeof options === 'string') {\n    label = options;\n    md = arguments[3] || undefined;\n  } else if(options) {\n    label = options.label || undefined;\n    md = options.md || undefined;\n    if(options.mgf1 && options.mgf1.md) {\n      mgf1Md = options.mgf1.md;\n    }\n  }\n\n  // compute length in bytes\n  var keyLength = Math.ceil(key.n.bitLength() / 8);\n\n  if(em.length !== keyLength) {\n    var error = new Error('RSAES-OAEP encoded message length is invalid.');\n    error.length = em.length;\n    error.expectedLength = keyLength;\n    throw error;\n  }\n\n  // default OAEP to SHA-1 message digest\n  if(md === undefined) {\n    md = forge.md.sha1.create();\n  } else {\n    md.start();\n  }\n\n  // default MGF-1 to same as OAEP\n  if(!mgf1Md) {\n    mgf1Md = md;\n  }\n\n  if(keyLength < 2 * md.digestLength + 2) {\n    throw new Error('RSAES-OAEP key is too short for the hash function.');\n  }\n\n  if(!label) {\n    label = '';\n  }\n  md.update(label, 'raw');\n  var lHash = md.digest().getBytes();\n\n  // split the message into its parts\n  var y = em.charAt(0);\n  var maskedSeed = em.substring(1, md.digestLength + 1);\n  var maskedDB = em.substring(1 + md.digestLength);\n\n  var seedMask = rsa_mgf1(maskedDB, md.digestLength, mgf1Md);\n  var seed = forge.util.xorBytes(maskedSeed, seedMask, maskedSeed.length);\n\n  var dbMask = rsa_mgf1(seed, keyLength - md.digestLength - 1, mgf1Md);\n  var db = forge.util.xorBytes(maskedDB, dbMask, maskedDB.length);\n\n  var lHashPrime = db.substring(0, md.digestLength);\n\n  // constant time check that all values match what is expected\n  var error = (y !== '\\x00');\n\n  // constant time check lHash vs lHashPrime\n  for(var i = 0; i < md.digestLength; ++i) {\n    error |= (lHash.charAt(i) !== lHashPrime.charAt(i));\n  }\n\n  // \"constant time\" find the 0x1 byte separating the padding (zeros) from the\n  // message\n  // TODO: It must be possible to do this in a better/smarter way?\n  var in_ps = 1;\n  var index = md.digestLength;\n  for(var j = md.digestLength; j < db.length; j++) {\n    var code = db.charCodeAt(j);\n\n    var is_0 = (code & 0x1) ^ 0x1;\n\n    // non-zero if not 0 or 1 in the ps section\n    var error_mask = in_ps ? 0xfffe : 0x0000;\n    error |= (code & error_mask);\n\n    // latch in_ps to zero after we find 0x1\n    in_ps = in_ps & is_0;\n    index += in_ps;\n  }\n\n  if(error || db.charCodeAt(index) !== 0x1) {\n    throw new Error('Invalid RSAES-OAEP padding.');\n  }\n\n  return db.substring(index + 1);\n};\n\nfunction rsa_mgf1(seed, maskLength, hash) {\n  // default to SHA-1 message digest\n  if(!hash) {\n    hash = forge.md.sha1.create();\n  }\n  var t = '';\n  var count = Math.ceil(maskLength / hash.digestLength);\n  for(var i = 0; i < count; ++i) {\n    var c = String.fromCharCode(\n      (i >> 24) & 0xFF, (i >> 16) & 0xFF, (i >> 8) & 0xFF, i & 0xFF);\n    hash.start();\n    hash.update(seed + c);\n    t += hash.digest().getBytes();\n  }\n  return t.substring(0, maskLength);\n}\n","/**\n * Secure Hash Algorithm with 160-bit digest (SHA-1) implementation.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2015 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./md');\nrequire('./util');\n\nvar sha1 = module.exports = forge.sha1 = forge.sha1 || {};\nforge.md.sha1 = forge.md.algorithms.sha1 = sha1;\n\n/**\n * Creates a SHA-1 message digest object.\n *\n * @return a message digest object.\n */\nsha1.create = function() {\n  // do initialization as necessary\n  if(!_initialized) {\n    _init();\n  }\n\n  // SHA-1 state contains five 32-bit integers\n  var _state = null;\n\n  // input buffer\n  var _input = forge.util.createBuffer();\n\n  // used for word storage\n  var _w = new Array(80);\n\n  // message digest object\n  var md = {\n    algorithm: 'sha1',\n    blockLength: 64,\n    digestLength: 20,\n    // 56-bit length of message so far (does not including padding)\n    messageLength: 0,\n    // true message length\n    fullMessageLength: null,\n    // size of message length in bytes\n    messageLengthSize: 8\n  };\n\n  /**\n   * Starts the digest.\n   *\n   * @return this digest object.\n   */\n  md.start = function() {\n    // up to 56-bit message length for convenience\n    md.messageLength = 0;\n\n    // full message length (set md.messageLength64 for backwards-compatibility)\n    md.fullMessageLength = md.messageLength64 = [];\n    var int32s = md.messageLengthSize / 4;\n    for(var i = 0; i < int32s; ++i) {\n      md.fullMessageLength.push(0);\n    }\n    _input = forge.util.createBuffer();\n    _state = {\n      h0: 0x67452301,\n      h1: 0xEFCDAB89,\n      h2: 0x98BADCFE,\n      h3: 0x10325476,\n      h4: 0xC3D2E1F0\n    };\n    return md;\n  };\n  // start digest automatically for first time\n  md.start();\n\n  /**\n   * Updates the digest with the given message input. The given input can\n   * treated as raw input (no encoding will be applied) or an encoding of\n   * 'utf8' maybe given to encode the input using UTF-8.\n   *\n   * @param msg the message input to update with.\n   * @param encoding the encoding to use (default: 'raw', other: 'utf8').\n   *\n   * @return this digest object.\n   */\n  md.update = function(msg, encoding) {\n    if(encoding === 'utf8') {\n      msg = forge.util.encodeUtf8(msg);\n    }\n\n    // update message length\n    var len = msg.length;\n    md.messageLength += len;\n    len = [(len / 0x100000000) >>> 0, len >>> 0];\n    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {\n      md.fullMessageLength[i] += len[1];\n      len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);\n      md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;\n      len[0] = ((len[1] / 0x100000000) >>> 0);\n    }\n\n    // add bytes to input buffer\n    _input.putBytes(msg);\n\n    // process bytes\n    _update(_state, _w, _input);\n\n    // compact input buffer every 2K or if empty\n    if(_input.read > 2048 || _input.length() === 0) {\n      _input.compact();\n    }\n\n    return md;\n  };\n\n  /**\n   * Produces the digest.\n   *\n   * @return a byte buffer containing the digest value.\n   */\n  md.digest = function() {\n    /* Note: Here we copy the remaining bytes in the input buffer and\n    add the appropriate SHA-1 padding. Then we do the final update\n    on a copy of the state so that if the user wants to get\n    intermediate digests they can do so. */\n\n    /* Determine the number of bytes that must be added to the message\n    to ensure its length is congruent to 448 mod 512. In other words,\n    the data to be digested must be a multiple of 512 bits (or 128 bytes).\n    This data includes the message, some padding, and the length of the\n    message. Since the length of the message will be encoded as 8 bytes (64\n    bits), that means that the last segment of the data must have 56 bytes\n    (448 bits) of message and padding. Therefore, the length of the message\n    plus the padding must be congruent to 448 mod 512 because\n    512 - 128 = 448.\n\n    In order to fill up the message length it must be filled with\n    padding that begins with 1 bit followed by all 0 bits. Padding\n    must *always* be present, so if the message length is already\n    congruent to 448 mod 512, then 512 padding bits must be added. */\n\n    var finalBlock = forge.util.createBuffer();\n    finalBlock.putBytes(_input.bytes());\n\n    // compute remaining size to be digested (include message length size)\n    var remaining = (\n      md.fullMessageLength[md.fullMessageLength.length - 1] +\n      md.messageLengthSize);\n\n    // add padding for overflow blockSize - overflow\n    // _padding starts with 1 byte with first bit is set (byte value 128), then\n    // there may be up to (blockSize - 1) other pad bytes\n    var overflow = remaining & (md.blockLength - 1);\n    finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));\n\n    // serialize message length in bits in big-endian order; since length\n    // is stored in bytes we multiply by 8 and add carry from next int\n    var next, carry;\n    var bits = md.fullMessageLength[0] * 8;\n    for(var i = 0; i < md.fullMessageLength.length - 1; ++i) {\n      next = md.fullMessageLength[i + 1] * 8;\n      carry = (next / 0x100000000) >>> 0;\n      bits += carry;\n      finalBlock.putInt32(bits >>> 0);\n      bits = next >>> 0;\n    }\n    finalBlock.putInt32(bits);\n\n    var s2 = {\n      h0: _state.h0,\n      h1: _state.h1,\n      h2: _state.h2,\n      h3: _state.h3,\n      h4: _state.h4\n    };\n    _update(s2, _w, finalBlock);\n    var rval = forge.util.createBuffer();\n    rval.putInt32(s2.h0);\n    rval.putInt32(s2.h1);\n    rval.putInt32(s2.h2);\n    rval.putInt32(s2.h3);\n    rval.putInt32(s2.h4);\n    return rval;\n  };\n\n  return md;\n};\n\n// sha-1 padding bytes not initialized yet\nvar _padding = null;\nvar _initialized = false;\n\n/**\n * Initializes the constant tables.\n */\nfunction _init() {\n  // create padding\n  _padding = String.fromCharCode(128);\n  _padding += forge.util.fillString(String.fromCharCode(0x00), 64);\n\n  // now initialized\n  _initialized = true;\n}\n\n/**\n * Updates a SHA-1 state with the given byte buffer.\n *\n * @param s the SHA-1 state to update.\n * @param w the array to use to store words.\n * @param bytes the byte buffer to update with.\n */\nfunction _update(s, w, bytes) {\n  // consume 512 bit (64 byte) chunks\n  var t, a, b, c, d, e, f, i;\n  var len = bytes.length();\n  while(len >= 64) {\n    // the w array will be populated with sixteen 32-bit big-endian words\n    // and then extended into 80 32-bit words according to SHA-1 algorithm\n    // and for 32-79 using Max Locktyukhin's optimization\n\n    // initialize hash value for this chunk\n    a = s.h0;\n    b = s.h1;\n    c = s.h2;\n    d = s.h3;\n    e = s.h4;\n\n    // round 1\n    for(i = 0; i < 16; ++i) {\n      t = bytes.getInt32();\n      w[i] = t;\n      f = d ^ (b & (c ^ d));\n      t = ((a << 5) | (a >>> 27)) + f + e + 0x5A827999 + t;\n      e = d;\n      d = c;\n      // `>>> 0` necessary to avoid iOS/Safari 10 optimization bug\n      c = ((b << 30) | (b >>> 2)) >>> 0;\n      b = a;\n      a = t;\n    }\n    for(; i < 20; ++i) {\n      t = (w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]);\n      t = (t << 1) | (t >>> 31);\n      w[i] = t;\n      f = d ^ (b & (c ^ d));\n      t = ((a << 5) | (a >>> 27)) + f + e + 0x5A827999 + t;\n      e = d;\n      d = c;\n      // `>>> 0` necessary to avoid iOS/Safari 10 optimization bug\n      c = ((b << 30) | (b >>> 2)) >>> 0;\n      b = a;\n      a = t;\n    }\n    // round 2\n    for(; i < 32; ++i) {\n      t = (w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16]);\n      t = (t << 1) | (t >>> 31);\n      w[i] = t;\n      f = b ^ c ^ d;\n      t = ((a << 5) | (a >>> 27)) + f + e + 0x6ED9EBA1 + t;\n      e = d;\n      d = c;\n      // `>>> 0` necessary to avoid iOS/Safari 10 optimization bug\n      c = ((b << 30) | (b >>> 2)) >>> 0;\n      b = a;\n      a = t;\n    }\n    for(; i < 40; ++i) {\n      t = (w[i - 6] ^ w[i - 16] ^ w[i - 28] ^ w[i - 32]);\n      t = (t << 2) | (t >>> 30);\n      w[i] = t;\n      f = b ^ c ^ d;\n      t = ((a << 5) | (a >>> 27)) + f + e + 0x6ED9EBA1 + t;\n      e = d;\n      d = c;\n      // `>>> 0` necessary to avoid iOS/Safari 10 optimization bug\n      c = ((b << 30) | (b >>> 2)) >>> 0;\n      b = a;\n      a = t;\n    }\n    // round 3\n    for(; i < 60; ++i) {\n      t = (w[i - 6] ^ w[i - 16] ^ w[i - 28] ^ w[i - 32]);\n      t = (t << 2) | (t >>> 30);\n      w[i] = t;\n      f = (b & c) | (d & (b ^ c));\n      t = ((a << 5) | (a >>> 27)) + f + e + 0x8F1BBCDC + t;\n      e = d;\n      d = c;\n      // `>>> 0` necessary to avoid iOS/Safari 10 optimization bug\n      c = ((b << 30) | (b >>> 2)) >>> 0;\n      b = a;\n      a = t;\n    }\n    // round 4\n    for(; i < 80; ++i) {\n      t = (w[i - 6] ^ w[i - 16] ^ w[i - 28] ^ w[i - 32]);\n      t = (t << 2) | (t >>> 30);\n      w[i] = t;\n      f = b ^ c ^ d;\n      t = ((a << 5) | (a >>> 27)) + f + e + 0xCA62C1D6 + t;\n      e = d;\n      d = c;\n      // `>>> 0` necessary to avoid iOS/Safari 10 optimization bug\n      c = ((b << 30) | (b >>> 2)) >>> 0;\n      b = a;\n      a = t;\n    }\n\n    // update hash state\n    s.h0 = (s.h0 + a) | 0;\n    s.h1 = (s.h1 + b) | 0;\n    s.h2 = (s.h2 + c) | 0;\n    s.h3 = (s.h3 + d) | 0;\n    s.h4 = (s.h4 + e) | 0;\n\n    len -= 64;\n  }\n}\n","/**\n * Prime number generation API.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\nrequire('./jsbn');\nrequire('./random');\n\n(function() {\n\n// forge.prime already defined\nif(forge.prime) {\n  module.exports = forge.prime;\n  return;\n}\n\n/* PRIME API */\nvar prime = module.exports = forge.prime = forge.prime || {};\n\nvar BigInteger = forge.jsbn.BigInteger;\n\n// primes are 30k+i for i = 1, 7, 11, 13, 17, 19, 23, 29\nvar GCD_30_DELTA = [6, 4, 2, 4, 2, 4, 6, 2];\nvar THIRTY = new BigInteger(null);\nTHIRTY.fromInt(30);\nvar op_or = function(x, y) {return x|y;};\n\n/**\n * Generates a random probable prime with the given number of bits.\n *\n * Alternative algorithms can be specified by name as a string or as an\n * object with custom options like so:\n *\n * {\n *   name: 'PRIMEINC',\n *   options: {\n *     maxBlockTime: <the maximum amount of time to block the main\n *       thread before allowing I/O other JS to run>,\n *     millerRabinTests: <the number of miller-rabin tests to run>,\n *     workerScript: <the worker script URL>,\n *     workers: <the number of web workers (if supported) to use,\n *       -1 to use estimated cores minus one>.\n *     workLoad: the size of the work load, ie: number of possible prime\n *       numbers for each web worker to check per work assignment,\n *       (default: 100).\n *   }\n * }\n *\n * @param bits the number of bits for the prime number.\n * @param options the options to use.\n *          [algorithm] the algorithm to use (default: 'PRIMEINC').\n *          [prng] a custom crypto-secure pseudo-random number generator to use,\n *            that must define \"getBytesSync\".\n *\n * @return callback(err, num) called once the operation completes.\n */\nprime.generateProbablePrime = function(bits, options, callback) {\n  if(typeof options === 'function') {\n    callback = options;\n    options = {};\n  }\n  options = options || {};\n\n  // default to PRIMEINC algorithm\n  var algorithm = options.algorithm || 'PRIMEINC';\n  if(typeof algorithm === 'string') {\n    algorithm = {name: algorithm};\n  }\n  algorithm.options = algorithm.options || {};\n\n  // create prng with api that matches BigInteger secure random\n  var prng = options.prng || forge.random;\n  var rng = {\n    // x is an array to fill with bytes\n    nextBytes: function(x) {\n      var b = prng.getBytesSync(x.length);\n      for(var i = 0; i < x.length; ++i) {\n        x[i] = b.charCodeAt(i);\n      }\n    }\n  };\n\n  if(algorithm.name === 'PRIMEINC') {\n    return primeincFindPrime(bits, rng, algorithm.options, callback);\n  }\n\n  throw new Error('Invalid prime generation algorithm: ' + algorithm.name);\n};\n\nfunction primeincFindPrime(bits, rng, options, callback) {\n  if('workers' in options) {\n    return primeincFindPrimeWithWorkers(bits, rng, options, callback);\n  }\n  return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);\n}\n\nfunction primeincFindPrimeWithoutWorkers(bits, rng, options, callback) {\n  // initialize random number\n  var num = generateRandom(bits, rng);\n\n  /* Note: All primes are of the form 30k+i for i < 30 and gcd(30, i)=1. The\n  number we are given is always aligned at 30k + 1. Each time the number is\n  determined not to be prime we add to get to the next 'i', eg: if the number\n  was at 30k + 1 we add 6. */\n  var deltaIdx = 0;\n\n  // get required number of MR tests\n  var mrTests = getMillerRabinTests(num.bitLength());\n  if('millerRabinTests' in options) {\n    mrTests = options.millerRabinTests;\n  }\n\n  // find prime nearest to 'num' for maxBlockTime ms\n  // 10 ms gives 5ms of leeway for other calculations before dropping\n  // below 60fps (1000/60 == 16.67), but in reality, the number will\n  // likely be higher due to an 'atomic' big int modPow\n  var maxBlockTime = 10;\n  if('maxBlockTime' in options) {\n    maxBlockTime = options.maxBlockTime;\n  }\n\n  _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);\n}\n\nfunction _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback) {\n  var start = +new Date();\n  do {\n    // overflow, regenerate random number\n    if(num.bitLength() > bits) {\n      num = generateRandom(bits, rng);\n    }\n    // do primality test\n    if(num.isProbablePrime(mrTests)) {\n      return callback(null, num);\n    }\n    // get next potential prime\n    num.dAddOffset(GCD_30_DELTA[deltaIdx++ % 8], 0);\n  } while(maxBlockTime < 0 || (+new Date() - start < maxBlockTime));\n\n  // keep trying later\n  forge.util.setImmediate(function() {\n    _primeinc(num, bits, rng, deltaIdx, mrTests, maxBlockTime, callback);\n  });\n}\n\n// NOTE: This algorithm is indeterminate in nature because workers\n// run in parallel looking at different segments of numbers. Even if this\n// algorithm is run twice with the same input from a predictable RNG, it\n// may produce different outputs.\nfunction primeincFindPrimeWithWorkers(bits, rng, options, callback) {\n  // web workers unavailable\n  if(typeof Worker === 'undefined') {\n    return primeincFindPrimeWithoutWorkers(bits, rng, options, callback);\n  }\n\n  // initialize random number\n  var num = generateRandom(bits, rng);\n\n  // use web workers to generate keys\n  var numWorkers = options.workers;\n  var workLoad = options.workLoad || 100;\n  var range = workLoad * 30 / 8;\n  var workerScript = options.workerScript || 'forge/prime.worker.js';\n  if(numWorkers === -1) {\n    return forge.util.estimateCores(function(err, cores) {\n      if(err) {\n        // default to 2\n        cores = 2;\n      }\n      numWorkers = cores - 1;\n      generate();\n    });\n  }\n  generate();\n\n  function generate() {\n    // require at least 1 worker\n    numWorkers = Math.max(1, numWorkers);\n\n    // TODO: consider optimizing by starting workers outside getPrime() ...\n    // note that in order to clean up they will have to be made internally\n    // asynchronous which may actually be slower\n\n    // start workers immediately\n    var workers = [];\n    for(var i = 0; i < numWorkers; ++i) {\n      // FIXME: fix path or use blob URLs\n      workers[i] = new Worker(workerScript);\n    }\n    var running = numWorkers;\n\n    // listen for requests from workers and assign ranges to find prime\n    for(var i = 0; i < numWorkers; ++i) {\n      workers[i].addEventListener('message', workerMessage);\n    }\n\n    /* Note: The distribution of random numbers is unknown. Therefore, each\n    web worker is continuously allocated a range of numbers to check for a\n    random number until one is found.\n\n    Every 30 numbers will be checked just 8 times, because prime numbers\n    have the form:\n\n    30k+i, for i < 30 and gcd(30, i)=1 (there are 8 values of i for this)\n\n    Therefore, if we want a web worker to run N checks before asking for\n    a new range of numbers, each range must contain N*30/8 numbers.\n\n    For 100 checks (workLoad), this is a range of 375. */\n\n    var found = false;\n    function workerMessage(e) {\n      // ignore message, prime already found\n      if(found) {\n        return;\n      }\n\n      --running;\n      var data = e.data;\n      if(data.found) {\n        // terminate all workers\n        for(var i = 0; i < workers.length; ++i) {\n          workers[i].terminate();\n        }\n        found = true;\n        return callback(null, new BigInteger(data.prime, 16));\n      }\n\n      // overflow, regenerate random number\n      if(num.bitLength() > bits) {\n        num = generateRandom(bits, rng);\n      }\n\n      // assign new range to check\n      var hex = num.toString(16);\n\n      // start prime search\n      e.target.postMessage({\n        hex: hex,\n        workLoad: workLoad\n      });\n\n      num.dAddOffset(range, 0);\n    }\n  }\n}\n\n/**\n * Generates a random number using the given number of bits and RNG.\n *\n * @param bits the number of bits for the number.\n * @param rng the random number generator to use.\n *\n * @return the random number.\n */\nfunction generateRandom(bits, rng) {\n  var num = new BigInteger(bits, rng);\n  // force MSB set\n  var bits1 = bits - 1;\n  if(!num.testBit(bits1)) {\n    num.bitwiseTo(BigInteger.ONE.shiftLeft(bits1), op_or, num);\n  }\n  // align number on 30k+1 boundary\n  num.dAddOffset(31 - num.mod(THIRTY).byteValue(), 0);\n  return num;\n}\n\n/**\n * Returns the required number of Miller-Rabin tests to generate a\n * prime with an error probability of (1/2)^80.\n *\n * See Handbook of Applied Cryptography Chapter 4, Table 4.4.\n *\n * @param bits the bit size.\n *\n * @return the required number of iterations.\n */\nfunction getMillerRabinTests(bits) {\n  if(bits <= 100) return 27;\n  if(bits <= 150) return 18;\n  if(bits <= 200) return 15;\n  if(bits <= 250) return 12;\n  if(bits <= 300) return 9;\n  if(bits <= 350) return 8;\n  if(bits <= 400) return 7;\n  if(bits <= 500) return 6;\n  if(bits <= 600) return 5;\n  if(bits <= 800) return 4;\n  if(bits <= 1250) return 3;\n  return 2;\n}\n\n})();\n","'use strict';\n\n/**\n * @typedef {{ [key: string]: any }} Extensions\n * @typedef {Error} Err\n * @property {string} message\n */\n\n/**\n *\n * @param {Error} obj\n * @param {Extensions} props\n * @returns {Error & Extensions}\n */\nfunction assign(obj, props) {\n    for (const key in props) {\n        Object.defineProperty(obj, key, {\n            value: props[key],\n            enumerable: true,\n            configurable: true,\n        });\n    }\n\n    return obj;\n}\n\n/**\n *\n * @param {any} err - An Error\n * @param {string|Extensions} code - A string code or props to set on the error\n * @param {Extensions} [props] - Props to set on the error\n * @returns {Error & Extensions}\n */\nfunction createError(err, code, props) {\n    if (!err || typeof err === 'string') {\n        throw new TypeError('Please pass an Error to err-code');\n    }\n\n    if (!props) {\n        props = {};\n    }\n\n    if (typeof code === 'object') {\n        props = code;\n        code = '';\n    }\n\n    if (code) {\n        props.code = code;\n    }\n\n    try {\n        return assign(err, props);\n    } catch (_) {\n        props.message = err.message;\n        props.stack = err.stack;\n\n        const ErrClass = function () {};\n\n        ErrClass.prototype = Object.create(Object.getPrototypeOf(err));\n\n        // @ts-ignore\n        const output = assign(new ErrClass(), props);\n\n        return output;\n    }\n}\n\nmodule.exports = createError;\n","'use strict'\n\nconst multibase = require('multibase')\nconst ciphers = require('../ciphers/aes-gcm')\n\nmodule.exports = {\n  /**\n   * Attempts to decrypt a base64 encoded PrivateKey string\n   * with the given password. The privateKey must have been exported\n   * using the same password and underlying cipher (aes-gcm)\n   *\n   * @param {string} privateKey - A base64 encoded encrypted key\n   * @param {string} password\n   * @returns {Promise<Uint8Array>} The private key protobuf\n   */\n  import: async function (privateKey, password) {\n    const base64 = multibase.names.base64\n    const encryptedKey = base64.decode(privateKey)\n    const cipher = ciphers.create()\n    return await cipher.decrypt(encryptedKey, password)\n  }\n}\n","'use strict'\n\nconst concat = require('uint8arrays/concat')\nconst fromString = require('uint8arrays/from-string')\n\nconst webcrypto = require('../webcrypto')\n\n// Based off of code from https://github.com/luke-park/SecureCompatibleEncryptionExamples\n\n/**\n *\n * @param {object} [options]\n * @param {string} [options.algorithm=AES-GCM]\n * @param {number} [options.nonceLength=12]\n * @param {number} [options.keyLength=16]\n * @param {string} [options.digest=sha256]\n * @param {number} [options.saltLength=16]\n * @param {number} [options.iterations=32767]\n * @returns {*}\n */\nfunction create ({\n  algorithm = 'AES-GCM',\n  nonceLength = 12,\n  keyLength = 16,\n  digest = 'SHA-256',\n  saltLength = 16,\n  iterations = 32767\n} = {}) {\n  const crypto = webcrypto.get()\n  keyLength *= 8 // Browser crypto uses bits instead of bytes\n\n  /**\n   * Uses the provided password to derive a pbkdf2 key. The key\n   * will then be used to encrypt the data.\n   *\n   * @param {Uint8Array} data - The data to decrypt\n   * @param {string} password - A plain password\n   * @returns {Promise<Uint8Array>}\n   */\n  async function encrypt (data, password) { // eslint-disable-line require-await\n    const salt = crypto.getRandomValues(new Uint8Array(saltLength))\n    const nonce = crypto.getRandomValues(new Uint8Array(nonceLength))\n    const aesGcm = { name: algorithm, iv: nonce }\n\n    // Derive a key using PBKDF2.\n    const deriveParams = { name: 'PBKDF2', salt, iterations, hash: { name: digest } }\n    const rawKey = await crypto.subtle.importKey('raw', fromString(password), { name: 'PBKDF2' }, false, ['deriveKey', 'deriveBits'])\n    const cryptoKey = await crypto.subtle.deriveKey(deriveParams, rawKey, { name: algorithm, length: keyLength }, true, ['encrypt'])\n\n    // Encrypt the string.\n    const ciphertext = await crypto.subtle.encrypt(aesGcm, cryptoKey, data)\n    return concat([salt, aesGcm.iv, new Uint8Array(ciphertext)])\n  }\n\n  /**\n   * Uses the provided password to derive a pbkdf2 key. The key\n   * will then be used to decrypt the data. The options used to create\n   * this decryption cipher must be the same as those used to create\n   * the encryption cipher.\n   *\n   * @param {Uint8Array} data - The data to decrypt\n   * @param {string} password - A plain password\n   * @returns {Promise<Uint8Array>}\n   */\n  async function decrypt (data, password) {\n    const salt = data.slice(0, saltLength)\n    const nonce = data.slice(saltLength, saltLength + nonceLength)\n    const ciphertext = data.slice(saltLength + nonceLength)\n    const aesGcm = { name: algorithm, iv: nonce }\n\n    // Derive the key using PBKDF2.\n    const deriveParams = { name: 'PBKDF2', salt, iterations, hash: { name: digest } }\n    const rawKey = await crypto.subtle.importKey('raw', fromString(password), { name: 'PBKDF2' }, false, ['deriveKey', 'deriveBits'])\n    const cryptoKey = await crypto.subtle.deriveKey(deriveParams, rawKey, { name: algorithm, length: keyLength }, true, ['decrypt'])\n\n    // Decrypt the string.\n    const plaintext = await crypto.subtle.decrypt(aesGcm, cryptoKey, ciphertext)\n    return new Uint8Array(plaintext)\n  }\n\n  return {\n    encrypt,\n    decrypt\n  }\n}\n\nmodule.exports = {\n  create\n}\n","/* eslint-env browser */\n\n'use strict'\n\n// Check native crypto exists and is enabled (In insecure context `self.crypto`\n// exists but `self.crypto.subtle` does not).\nexports.get = (win = self) => {\n  const nativeCrypto = win.crypto || win.msCrypto\n\n  if (!nativeCrypto || !nativeCrypto.subtle) {\n    throw Object.assign(\n      new Error(\n        'Missing Web Crypto API. ' +\n        'The most likely cause of this error is that this page is being accessed ' +\n        'from an insecure context (i.e. not HTTPS). For more information and ' +\n        'possible resolutions see ' +\n        'https://github.com/libp2p/js-libp2p-crypto/blob/master/README.md#web-crypto-api'\n      ),\n      { code: 'ERR_MISSING_WEB_CRYPTO' }\n    )\n  }\n\n  return nativeCrypto\n}\n","'use strict'\n\nconst sha = require('multihashing-async/src/sha')\nconst errcode = require('err-code')\nconst uint8ArrayEquals = require('uint8arrays/equals')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nrequire('node-forge/lib/sha512')\nrequire('node-forge/lib/ed25519')\nconst forge = require('node-forge/lib/forge')\n\nconst crypto = require('./rsa')\nconst pbm = require('./keys')\nconst exporter = require('./exporter')\n\nclass RsaPublicKey {\n  constructor (key) {\n    this._key = key\n  }\n\n  async verify (data, sig) { // eslint-disable-line require-await\n    return crypto.hashAndVerify(this._key, sig, data)\n  }\n\n  marshal () {\n    return crypto.utils.jwkToPkix(this._key)\n  }\n\n  get bytes () {\n    return pbm.PublicKey.encode({\n      Type: pbm.KeyType.RSA,\n      Data: this.marshal()\n    }).finish()\n  }\n\n  encrypt (bytes) {\n    return crypto.encrypt(this._key, bytes)\n  }\n\n  equals (key) {\n    return uint8ArrayEquals(this.bytes, key.bytes)\n  }\n\n  async hash () { // eslint-disable-line require-await\n    return sha.multihashing(this.bytes, 'sha2-256')\n  }\n}\n\nclass RsaPrivateKey {\n  // key       - Object of the jwk format\n  // publicKey - Uint8Array of the spki format\n  constructor (key, publicKey) {\n    this._key = key\n    this._publicKey = publicKey\n  }\n\n  genSecret () {\n    return crypto.getRandomValues(16)\n  }\n\n  async sign (message) { // eslint-disable-line require-await\n    return crypto.hashAndSign(this._key, message)\n  }\n\n  get public () {\n    if (!this._publicKey) {\n      throw errcode(new Error('public key not provided'), 'ERR_PUBKEY_NOT_PROVIDED')\n    }\n\n    return new RsaPublicKey(this._publicKey)\n  }\n\n  decrypt (bytes) {\n    return crypto.decrypt(this._key, bytes)\n  }\n\n  marshal () {\n    return crypto.utils.jwkToPkcs1(this._key)\n  }\n\n  get bytes () {\n    return pbm.PrivateKey.encode({\n      Type: pbm.KeyType.RSA,\n      Data: this.marshal()\n    }).finish()\n  }\n\n  equals (key) {\n    return uint8ArrayEquals(this.bytes, key.bytes)\n  }\n\n  async hash () { // eslint-disable-line require-await\n    return sha.multihashing(this.bytes, 'sha2-256')\n  }\n\n  /**\n   * Gets the ID of the key.\n   *\n   * The key id is the base58 encoding of the SHA-256 multihash of its public key.\n   * The public key is a protobuf encoding containing a type and the DER encoding\n   * of the PKCS SubjectPublicKeyInfo.\n   *\n   * @returns {Promise<string>}\n   */\n  async id () {\n    const hash = await this.public.hash()\n    return uint8ArrayToString(hash, 'base58btc')\n  }\n\n  /**\n   * Exports the key into a password protected PEM format\n   *\n   * @param {string} password - The password to read the encrypted PEM\n   * @param {string} [format=pkcs-8] - The format in which to export as\n   */\n  async export (password, format = 'pkcs-8') { // eslint-disable-line require-await\n    if (format === 'pkcs-8') {\n      const buffer = new forge.util.ByteBuffer(this.marshal())\n      const asn1 = forge.asn1.fromDer(buffer)\n      const privateKey = forge.pki.privateKeyFromAsn1(asn1)\n\n      const options = {\n        algorithm: 'aes256',\n        count: 10000,\n        saltSize: 128 / 8,\n        prfAlgorithm: 'sha512'\n      }\n      return forge.pki.encryptRsaPrivateKey(privateKey, password, options)\n    } else if (format === 'libp2p-key') {\n      return exporter.export(this.bytes, password)\n    } else {\n      throw errcode(new Error(`export format '${format}' is not supported`), 'ERR_INVALID_EXPORT_FORMAT')\n    }\n  }\n}\n\nasync function unmarshalRsaPrivateKey (bytes) {\n  const jwk = crypto.utils.pkcs1ToJwk(bytes)\n  const keys = await crypto.unmarshalPrivateKey(jwk)\n  return new RsaPrivateKey(keys.privateKey, keys.publicKey)\n}\n\nfunction unmarshalRsaPublicKey (bytes) {\n  const jwk = crypto.utils.pkixToJwk(bytes)\n  return new RsaPublicKey(jwk)\n}\n\nasync function fromJwk (jwk) {\n  const keys = await crypto.unmarshalPrivateKey(jwk)\n  return new RsaPrivateKey(keys.privateKey, keys.publicKey)\n}\n\nasync function generateKeyPair (bits) {\n  const keys = await crypto.generateKey(bits)\n  return new RsaPrivateKey(keys.privateKey, keys.publicKey)\n}\n\nmodule.exports = {\n  RsaPublicKey,\n  RsaPrivateKey,\n  unmarshalRsaPublicKey,\n  unmarshalRsaPrivateKey,\n  generateKeyPair,\n  fromJwk\n}\n","/* eslint-disable require-await */\n'use strict'\n\nconst multihash = require('multihashes')\n/**\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('./types').Digest} Digest\n */\n\n/**\n * @type {Crypto}\n */\nconst crypto =\n  self.crypto ||\n  /** @type {typeof window.crypto} */\n  // @ts-ignore - unknown property\n  (self.msCrypto)\n\n/**\n *\n * @param {Uint8Array} data\n * @param {HashName} alg\n * @returns {Promise<Uint8Array>}\n */\nconst digest = async (data, alg) => {\n  if (typeof self === 'undefined' || !crypto) {\n    throw new Error(\n      'Please use a browser with webcrypto support and ensure the code has been delivered securely via HTTPS/TLS and run within a Secure Context'\n    )\n  }\n  switch (alg) {\n    case 'sha1':\n      return new Uint8Array(await crypto.subtle.digest({ name: 'SHA-1' }, data))\n    case 'sha2-256':\n      return new Uint8Array(await crypto.subtle.digest({ name: 'SHA-256' }, data))\n    case 'sha2-512':\n      return new Uint8Array(await crypto.subtle.digest({ name: 'SHA-512' }, data))\n    case 'dbl-sha2-256': {\n      const d = await crypto.subtle.digest({ name: 'SHA-256' }, data)\n      return new Uint8Array(await crypto.subtle.digest({ name: 'SHA-256' }, d))\n    }\n    default:\n      throw new Error(`${alg} is not a supported algorithm`)\n  }\n}\n\nmodule.exports = {\n  /**\n   * @param {HashName} alg\n   * @returns {Digest}\n   */\n  factory: (alg) => async (data) => {\n    return digest(data, alg)\n  },\n  digest,\n  /**\n   * @param {Uint8Array} buf\n   * @param {HashName} alg\n   * @param {number} [length]\n   */\n  multihashing: async (buf, alg, length) => {\n    const h = await digest(buf, alg)\n    return multihash.encode(h, alg, length)\n  }\n}\n","/**\n * Secure Hash Algorithm with a 1024-bit block size implementation.\n *\n * This includes: SHA-512, SHA-384, SHA-512/224, and SHA-512/256. For\n * SHA-256 (block size 512 bits), see sha256.js.\n *\n * See FIPS 180-4 for details.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2014-2015 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./md');\nrequire('./util');\n\nvar sha512 = module.exports = forge.sha512 = forge.sha512 || {};\n\n// SHA-512\nforge.md.sha512 = forge.md.algorithms.sha512 = sha512;\n\n// SHA-384\nvar sha384 = forge.sha384 = forge.sha512.sha384 = forge.sha512.sha384 || {};\nsha384.create = function() {\n  return sha512.create('SHA-384');\n};\nforge.md.sha384 = forge.md.algorithms.sha384 = sha384;\n\n// SHA-512/256\nforge.sha512.sha256 = forge.sha512.sha256 || {\n  create: function() {\n    return sha512.create('SHA-512/256');\n  }\n};\nforge.md['sha512/256'] = forge.md.algorithms['sha512/256'] =\n  forge.sha512.sha256;\n\n// SHA-512/224\nforge.sha512.sha224 = forge.sha512.sha224 || {\n  create: function() {\n    return sha512.create('SHA-512/224');\n  }\n};\nforge.md['sha512/224'] = forge.md.algorithms['sha512/224'] =\n  forge.sha512.sha224;\n\n/**\n * Creates a SHA-2 message digest object.\n *\n * @param algorithm the algorithm to use (SHA-512, SHA-384, SHA-512/224,\n *          SHA-512/256).\n *\n * @return a message digest object.\n */\nsha512.create = function(algorithm) {\n  // do initialization as necessary\n  if(!_initialized) {\n    _init();\n  }\n\n  if(typeof algorithm === 'undefined') {\n    algorithm = 'SHA-512';\n  }\n\n  if(!(algorithm in _states)) {\n    throw new Error('Invalid SHA-512 algorithm: ' + algorithm);\n  }\n\n  // SHA-512 state contains eight 64-bit integers (each as two 32-bit ints)\n  var _state = _states[algorithm];\n  var _h = null;\n\n  // input buffer\n  var _input = forge.util.createBuffer();\n\n  // used for 64-bit word storage\n  var _w = new Array(80);\n  for(var wi = 0; wi < 80; ++wi) {\n    _w[wi] = new Array(2);\n  }\n\n  // determine digest length by algorithm name (default)\n  var digestLength = 64;\n  switch(algorithm) {\n    case 'SHA-384':\n      digestLength = 48;\n      break;\n    case 'SHA-512/256':\n      digestLength = 32;\n      break;\n    case 'SHA-512/224':\n      digestLength = 28;\n      break;\n  }\n\n  // message digest object\n  var md = {\n    // SHA-512 => sha512\n    algorithm: algorithm.replace('-', '').toLowerCase(),\n    blockLength: 128,\n    digestLength: digestLength,\n    // 56-bit length of message so far (does not including padding)\n    messageLength: 0,\n    // true message length\n    fullMessageLength: null,\n    // size of message length in bytes\n    messageLengthSize: 16\n  };\n\n  /**\n   * Starts the digest.\n   *\n   * @return this digest object.\n   */\n  md.start = function() {\n    // up to 56-bit message length for convenience\n    md.messageLength = 0;\n\n    // full message length (set md.messageLength128 for backwards-compatibility)\n    md.fullMessageLength = md.messageLength128 = [];\n    var int32s = md.messageLengthSize / 4;\n    for(var i = 0; i < int32s; ++i) {\n      md.fullMessageLength.push(0);\n    }\n    _input = forge.util.createBuffer();\n    _h = new Array(_state.length);\n    for(var i = 0; i < _state.length; ++i) {\n      _h[i] = _state[i].slice(0);\n    }\n    return md;\n  };\n  // start digest automatically for first time\n  md.start();\n\n  /**\n   * Updates the digest with the given message input. The given input can\n   * treated as raw input (no encoding will be applied) or an encoding of\n   * 'utf8' maybe given to encode the input using UTF-8.\n   *\n   * @param msg the message input to update with.\n   * @param encoding the encoding to use (default: 'raw', other: 'utf8').\n   *\n   * @return this digest object.\n   */\n  md.update = function(msg, encoding) {\n    if(encoding === 'utf8') {\n      msg = forge.util.encodeUtf8(msg);\n    }\n\n    // update message length\n    var len = msg.length;\n    md.messageLength += len;\n    len = [(len / 0x100000000) >>> 0, len >>> 0];\n    for(var i = md.fullMessageLength.length - 1; i >= 0; --i) {\n      md.fullMessageLength[i] += len[1];\n      len[1] = len[0] + ((md.fullMessageLength[i] / 0x100000000) >>> 0);\n      md.fullMessageLength[i] = md.fullMessageLength[i] >>> 0;\n      len[0] = ((len[1] / 0x100000000) >>> 0);\n    }\n\n    // add bytes to input buffer\n    _input.putBytes(msg);\n\n    // process bytes\n    _update(_h, _w, _input);\n\n    // compact input buffer every 2K or if empty\n    if(_input.read > 2048 || _input.length() === 0) {\n      _input.compact();\n    }\n\n    return md;\n  };\n\n  /**\n   * Produces the digest.\n   *\n   * @return a byte buffer containing the digest value.\n   */\n  md.digest = function() {\n    /* Note: Here we copy the remaining bytes in the input buffer and\n    add the appropriate SHA-512 padding. Then we do the final update\n    on a copy of the state so that if the user wants to get\n    intermediate digests they can do so. */\n\n    /* Determine the number of bytes that must be added to the message\n    to ensure its length is congruent to 896 mod 1024. In other words,\n    the data to be digested must be a multiple of 1024 bits (or 128 bytes).\n    This data includes the message, some padding, and the length of the\n    message. Since the length of the message will be encoded as 16 bytes (128\n    bits), that means that the last segment of the data must have 112 bytes\n    (896 bits) of message and padding. Therefore, the length of the message\n    plus the padding must be congruent to 896 mod 1024 because\n    1024 - 128 = 896.\n\n    In order to fill up the message length it must be filled with\n    padding that begins with 1 bit followed by all 0 bits. Padding\n    must *always* be present, so if the message length is already\n    congruent to 896 mod 1024, then 1024 padding bits must be added. */\n\n    var finalBlock = forge.util.createBuffer();\n    finalBlock.putBytes(_input.bytes());\n\n    // compute remaining size to be digested (include message length size)\n    var remaining = (\n      md.fullMessageLength[md.fullMessageLength.length - 1] +\n      md.messageLengthSize);\n\n    // add padding for overflow blockSize - overflow\n    // _padding starts with 1 byte with first bit is set (byte value 128), then\n    // there may be up to (blockSize - 1) other pad bytes\n    var overflow = remaining & (md.blockLength - 1);\n    finalBlock.putBytes(_padding.substr(0, md.blockLength - overflow));\n\n    // serialize message length in bits in big-endian order; since length\n    // is stored in bytes we multiply by 8 and add carry from next int\n    var next, carry;\n    var bits = md.fullMessageLength[0] * 8;\n    for(var i = 0; i < md.fullMessageLength.length - 1; ++i) {\n      next = md.fullMessageLength[i + 1] * 8;\n      carry = (next / 0x100000000) >>> 0;\n      bits += carry;\n      finalBlock.putInt32(bits >>> 0);\n      bits = next >>> 0;\n    }\n    finalBlock.putInt32(bits);\n\n    var h = new Array(_h.length);\n    for(var i = 0; i < _h.length; ++i) {\n      h[i] = _h[i].slice(0);\n    }\n    _update(h, _w, finalBlock);\n    var rval = forge.util.createBuffer();\n    var hlen;\n    if(algorithm === 'SHA-512') {\n      hlen = h.length;\n    } else if(algorithm === 'SHA-384') {\n      hlen = h.length - 2;\n    } else {\n      hlen = h.length - 4;\n    }\n    for(var i = 0; i < hlen; ++i) {\n      rval.putInt32(h[i][0]);\n      if(i !== hlen - 1 || algorithm !== 'SHA-512/224') {\n        rval.putInt32(h[i][1]);\n      }\n    }\n    return rval;\n  };\n\n  return md;\n};\n\n// sha-512 padding bytes not initialized yet\nvar _padding = null;\nvar _initialized = false;\n\n// table of constants\nvar _k = null;\n\n// initial hash states\nvar _states = null;\n\n/**\n * Initializes the constant tables.\n */\nfunction _init() {\n  // create padding\n  _padding = String.fromCharCode(128);\n  _padding += forge.util.fillString(String.fromCharCode(0x00), 128);\n\n  // create K table for SHA-512\n  _k = [\n    [0x428a2f98, 0xd728ae22], [0x71374491, 0x23ef65cd],\n    [0xb5c0fbcf, 0xec4d3b2f], [0xe9b5dba5, 0x8189dbbc],\n    [0x3956c25b, 0xf348b538], [0x59f111f1, 0xb605d019],\n    [0x923f82a4, 0xaf194f9b], [0xab1c5ed5, 0xda6d8118],\n    [0xd807aa98, 0xa3030242], [0x12835b01, 0x45706fbe],\n    [0x243185be, 0x4ee4b28c], [0x550c7dc3, 0xd5ffb4e2],\n    [0x72be5d74, 0xf27b896f], [0x80deb1fe, 0x3b1696b1],\n    [0x9bdc06a7, 0x25c71235], [0xc19bf174, 0xcf692694],\n    [0xe49b69c1, 0x9ef14ad2], [0xefbe4786, 0x384f25e3],\n    [0x0fc19dc6, 0x8b8cd5b5], [0x240ca1cc, 0x77ac9c65],\n    [0x2de92c6f, 0x592b0275], [0x4a7484aa, 0x6ea6e483],\n    [0x5cb0a9dc, 0xbd41fbd4], [0x76f988da, 0x831153b5],\n    [0x983e5152, 0xee66dfab], [0xa831c66d, 0x2db43210],\n    [0xb00327c8, 0x98fb213f], [0xbf597fc7, 0xbeef0ee4],\n    [0xc6e00bf3, 0x3da88fc2], [0xd5a79147, 0x930aa725],\n    [0x06ca6351, 0xe003826f], [0x14292967, 0x0a0e6e70],\n    [0x27b70a85, 0x46d22ffc], [0x2e1b2138, 0x5c26c926],\n    [0x4d2c6dfc, 0x5ac42aed], [0x53380d13, 0x9d95b3df],\n    [0x650a7354, 0x8baf63de], [0x766a0abb, 0x3c77b2a8],\n    [0x81c2c92e, 0x47edaee6], [0x92722c85, 0x1482353b],\n    [0xa2bfe8a1, 0x4cf10364], [0xa81a664b, 0xbc423001],\n    [0xc24b8b70, 0xd0f89791], [0xc76c51a3, 0x0654be30],\n    [0xd192e819, 0xd6ef5218], [0xd6990624, 0x5565a910],\n    [0xf40e3585, 0x5771202a], [0x106aa070, 0x32bbd1b8],\n    [0x19a4c116, 0xb8d2d0c8], [0x1e376c08, 0x5141ab53],\n    [0x2748774c, 0xdf8eeb99], [0x34b0bcb5, 0xe19b48a8],\n    [0x391c0cb3, 0xc5c95a63], [0x4ed8aa4a, 0xe3418acb],\n    [0x5b9cca4f, 0x7763e373], [0x682e6ff3, 0xd6b2b8a3],\n    [0x748f82ee, 0x5defb2fc], [0x78a5636f, 0x43172f60],\n    [0x84c87814, 0xa1f0ab72], [0x8cc70208, 0x1a6439ec],\n    [0x90befffa, 0x23631e28], [0xa4506ceb, 0xde82bde9],\n    [0xbef9a3f7, 0xb2c67915], [0xc67178f2, 0xe372532b],\n    [0xca273ece, 0xea26619c], [0xd186b8c7, 0x21c0c207],\n    [0xeada7dd6, 0xcde0eb1e], [0xf57d4f7f, 0xee6ed178],\n    [0x06f067aa, 0x72176fba], [0x0a637dc5, 0xa2c898a6],\n    [0x113f9804, 0xbef90dae], [0x1b710b35, 0x131c471b],\n    [0x28db77f5, 0x23047d84], [0x32caab7b, 0x40c72493],\n    [0x3c9ebe0a, 0x15c9bebc], [0x431d67c4, 0x9c100d4c],\n    [0x4cc5d4be, 0xcb3e42b6], [0x597f299c, 0xfc657e2a],\n    [0x5fcb6fab, 0x3ad6faec], [0x6c44198c, 0x4a475817]\n  ];\n\n  // initial hash states\n  _states = {};\n  _states['SHA-512'] = [\n    [0x6a09e667, 0xf3bcc908],\n    [0xbb67ae85, 0x84caa73b],\n    [0x3c6ef372, 0xfe94f82b],\n    [0xa54ff53a, 0x5f1d36f1],\n    [0x510e527f, 0xade682d1],\n    [0x9b05688c, 0x2b3e6c1f],\n    [0x1f83d9ab, 0xfb41bd6b],\n    [0x5be0cd19, 0x137e2179]\n  ];\n  _states['SHA-384'] = [\n    [0xcbbb9d5d, 0xc1059ed8],\n    [0x629a292a, 0x367cd507],\n    [0x9159015a, 0x3070dd17],\n    [0x152fecd8, 0xf70e5939],\n    [0x67332667, 0xffc00b31],\n    [0x8eb44a87, 0x68581511],\n    [0xdb0c2e0d, 0x64f98fa7],\n    [0x47b5481d, 0xbefa4fa4]\n  ];\n  _states['SHA-512/256'] = [\n    [0x22312194, 0xFC2BF72C],\n    [0x9F555FA3, 0xC84C64C2],\n    [0x2393B86B, 0x6F53B151],\n    [0x96387719, 0x5940EABD],\n    [0x96283EE2, 0xA88EFFE3],\n    [0xBE5E1E25, 0x53863992],\n    [0x2B0199FC, 0x2C85B8AA],\n    [0x0EB72DDC, 0x81C52CA2]\n  ];\n  _states['SHA-512/224'] = [\n    [0x8C3D37C8, 0x19544DA2],\n    [0x73E19966, 0x89DCD4D6],\n    [0x1DFAB7AE, 0x32FF9C82],\n    [0x679DD514, 0x582F9FCF],\n    [0x0F6D2B69, 0x7BD44DA8],\n    [0x77E36F73, 0x04C48942],\n    [0x3F9D85A8, 0x6A1D36C8],\n    [0x1112E6AD, 0x91D692A1]\n  ];\n\n  // now initialized\n  _initialized = true;\n}\n\n/**\n * Updates a SHA-512 state with the given byte buffer.\n *\n * @param s the SHA-512 state to update.\n * @param w the array to use to store words.\n * @param bytes the byte buffer to update with.\n */\nfunction _update(s, w, bytes) {\n  // consume 512 bit (128 byte) chunks\n  var t1_hi, t1_lo;\n  var t2_hi, t2_lo;\n  var s0_hi, s0_lo;\n  var s1_hi, s1_lo;\n  var ch_hi, ch_lo;\n  var maj_hi, maj_lo;\n  var a_hi, a_lo;\n  var b_hi, b_lo;\n  var c_hi, c_lo;\n  var d_hi, d_lo;\n  var e_hi, e_lo;\n  var f_hi, f_lo;\n  var g_hi, g_lo;\n  var h_hi, h_lo;\n  var i, hi, lo, w2, w7, w15, w16;\n  var len = bytes.length();\n  while(len >= 128) {\n    // the w array will be populated with sixteen 64-bit big-endian words\n    // and then extended into 64 64-bit words according to SHA-512\n    for(i = 0; i < 16; ++i) {\n      w[i][0] = bytes.getInt32() >>> 0;\n      w[i][1] = bytes.getInt32() >>> 0;\n    }\n    for(; i < 80; ++i) {\n      // for word 2 words ago: ROTR 19(x) ^ ROTR 61(x) ^ SHR 6(x)\n      w2 = w[i - 2];\n      hi = w2[0];\n      lo = w2[1];\n\n      // high bits\n      t1_hi = (\n        ((hi >>> 19) | (lo << 13)) ^ // ROTR 19\n        ((lo >>> 29) | (hi << 3)) ^ // ROTR 61/(swap + ROTR 29)\n        (hi >>> 6)) >>> 0; // SHR 6\n      // low bits\n      t1_lo = (\n        ((hi << 13) | (lo >>> 19)) ^ // ROTR 19\n        ((lo << 3) | (hi >>> 29)) ^ // ROTR 61/(swap + ROTR 29)\n        ((hi << 26) | (lo >>> 6))) >>> 0; // SHR 6\n\n      // for word 15 words ago: ROTR 1(x) ^ ROTR 8(x) ^ SHR 7(x)\n      w15 = w[i - 15];\n      hi = w15[0];\n      lo = w15[1];\n\n      // high bits\n      t2_hi = (\n        ((hi >>> 1) | (lo << 31)) ^ // ROTR 1\n        ((hi >>> 8) | (lo << 24)) ^ // ROTR 8\n        (hi >>> 7)) >>> 0; // SHR 7\n      // low bits\n      t2_lo = (\n        ((hi << 31) | (lo >>> 1)) ^ // ROTR 1\n        ((hi << 24) | (lo >>> 8)) ^ // ROTR 8\n        ((hi << 25) | (lo >>> 7))) >>> 0; // SHR 7\n\n      // sum(t1, word 7 ago, t2, word 16 ago) modulo 2^64 (carry lo overflow)\n      w7 = w[i - 7];\n      w16 = w[i - 16];\n      lo = (t1_lo + w7[1] + t2_lo + w16[1]);\n      w[i][0] = (t1_hi + w7[0] + t2_hi + w16[0] +\n        ((lo / 0x100000000) >>> 0)) >>> 0;\n      w[i][1] = lo >>> 0;\n    }\n\n    // initialize hash value for this chunk\n    a_hi = s[0][0];\n    a_lo = s[0][1];\n    b_hi = s[1][0];\n    b_lo = s[1][1];\n    c_hi = s[2][0];\n    c_lo = s[2][1];\n    d_hi = s[3][0];\n    d_lo = s[3][1];\n    e_hi = s[4][0];\n    e_lo = s[4][1];\n    f_hi = s[5][0];\n    f_lo = s[5][1];\n    g_hi = s[6][0];\n    g_lo = s[6][1];\n    h_hi = s[7][0];\n    h_lo = s[7][1];\n\n    // round function\n    for(i = 0; i < 80; ++i) {\n      // Sum1(e) = ROTR 14(e) ^ ROTR 18(e) ^ ROTR 41(e)\n      s1_hi = (\n        ((e_hi >>> 14) | (e_lo << 18)) ^ // ROTR 14\n        ((e_hi >>> 18) | (e_lo << 14)) ^ // ROTR 18\n        ((e_lo >>> 9) | (e_hi << 23))) >>> 0; // ROTR 41/(swap + ROTR 9)\n      s1_lo = (\n        ((e_hi << 18) | (e_lo >>> 14)) ^ // ROTR 14\n        ((e_hi << 14) | (e_lo >>> 18)) ^ // ROTR 18\n        ((e_lo << 23) | (e_hi >>> 9))) >>> 0; // ROTR 41/(swap + ROTR 9)\n\n      // Ch(e, f, g) (optimized the same way as SHA-1)\n      ch_hi = (g_hi ^ (e_hi & (f_hi ^ g_hi))) >>> 0;\n      ch_lo = (g_lo ^ (e_lo & (f_lo ^ g_lo))) >>> 0;\n\n      // Sum0(a) = ROTR 28(a) ^ ROTR 34(a) ^ ROTR 39(a)\n      s0_hi = (\n        ((a_hi >>> 28) | (a_lo << 4)) ^ // ROTR 28\n        ((a_lo >>> 2) | (a_hi << 30)) ^ // ROTR 34/(swap + ROTR 2)\n        ((a_lo >>> 7) | (a_hi << 25))) >>> 0; // ROTR 39/(swap + ROTR 7)\n      s0_lo = (\n        ((a_hi << 4) | (a_lo >>> 28)) ^ // ROTR 28\n        ((a_lo << 30) | (a_hi >>> 2)) ^ // ROTR 34/(swap + ROTR 2)\n        ((a_lo << 25) | (a_hi >>> 7))) >>> 0; // ROTR 39/(swap + ROTR 7)\n\n      // Maj(a, b, c) (optimized the same way as SHA-1)\n      maj_hi = ((a_hi & b_hi) | (c_hi & (a_hi ^ b_hi))) >>> 0;\n      maj_lo = ((a_lo & b_lo) | (c_lo & (a_lo ^ b_lo))) >>> 0;\n\n      // main algorithm\n      // t1 = (h + s1 + ch + _k[i] + _w[i]) modulo 2^64 (carry lo overflow)\n      lo = (h_lo + s1_lo + ch_lo + _k[i][1] + w[i][1]);\n      t1_hi = (h_hi + s1_hi + ch_hi + _k[i][0] + w[i][0] +\n        ((lo / 0x100000000) >>> 0)) >>> 0;\n      t1_lo = lo >>> 0;\n\n      // t2 = s0 + maj modulo 2^64 (carry lo overflow)\n      lo = s0_lo + maj_lo;\n      t2_hi = (s0_hi + maj_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n      t2_lo = lo >>> 0;\n\n      h_hi = g_hi;\n      h_lo = g_lo;\n\n      g_hi = f_hi;\n      g_lo = f_lo;\n\n      f_hi = e_hi;\n      f_lo = e_lo;\n\n      // e = (d + t1) modulo 2^64 (carry lo overflow)\n      lo = d_lo + t1_lo;\n      e_hi = (d_hi + t1_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n      e_lo = lo >>> 0;\n\n      d_hi = c_hi;\n      d_lo = c_lo;\n\n      c_hi = b_hi;\n      c_lo = b_lo;\n\n      b_hi = a_hi;\n      b_lo = a_lo;\n\n      // a = (t1 + t2) modulo 2^64 (carry lo overflow)\n      lo = t1_lo + t2_lo;\n      a_hi = (t1_hi + t2_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n      a_lo = lo >>> 0;\n    }\n\n    // update hash state (additional modulo 2^64)\n    lo = s[0][1] + a_lo;\n    s[0][0] = (s[0][0] + a_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[0][1] = lo >>> 0;\n\n    lo = s[1][1] + b_lo;\n    s[1][0] = (s[1][0] + b_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[1][1] = lo >>> 0;\n\n    lo = s[2][1] + c_lo;\n    s[2][0] = (s[2][0] + c_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[2][1] = lo >>> 0;\n\n    lo = s[3][1] + d_lo;\n    s[3][0] = (s[3][0] + d_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[3][1] = lo >>> 0;\n\n    lo = s[4][1] + e_lo;\n    s[4][0] = (s[4][0] + e_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[4][1] = lo >>> 0;\n\n    lo = s[5][1] + f_lo;\n    s[5][0] = (s[5][0] + f_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[5][1] = lo >>> 0;\n\n    lo = s[6][1] + g_lo;\n    s[6][0] = (s[6][0] + g_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[6][1] = lo >>> 0;\n\n    lo = s[7][1] + h_lo;\n    s[7][0] = (s[7][0] + h_hi + ((lo / 0x100000000) >>> 0)) >>> 0;\n    s[7][1] = lo >>> 0;\n\n    len -= 128;\n  }\n}\n","/**\n * JavaScript implementation of Ed25519.\n *\n * Copyright (c) 2017-2019 Digital Bazaar, Inc.\n *\n * This implementation is based on the most excellent TweetNaCl which is\n * in the public domain. Many thanks to its contributors:\n *\n * https://github.com/dchest/tweetnacl-js\n */\nvar forge = require('./forge');\nrequire('./jsbn');\nrequire('./random');\nrequire('./sha512');\nrequire('./util');\nvar asn1Validator = require('./asn1-validator');\nvar publicKeyValidator = asn1Validator.publicKeyValidator;\nvar privateKeyValidator = asn1Validator.privateKeyValidator;\n\nif(typeof BigInteger === 'undefined') {\n  var BigInteger = forge.jsbn.BigInteger;\n}\n\nvar ByteBuffer = forge.util.ByteBuffer;\nvar NativeBuffer = typeof Buffer === 'undefined' ? Uint8Array : Buffer;\n\n/*\n * Ed25519 algorithms, see RFC 8032:\n * https://tools.ietf.org/html/rfc8032\n */\nforge.pki = forge.pki || {};\nmodule.exports = forge.pki.ed25519 = forge.ed25519 = forge.ed25519 || {};\nvar ed25519 = forge.ed25519;\n\ned25519.constants = {};\ned25519.constants.PUBLIC_KEY_BYTE_LENGTH = 32;\ned25519.constants.PRIVATE_KEY_BYTE_LENGTH = 64;\ned25519.constants.SEED_BYTE_LENGTH = 32;\ned25519.constants.SIGN_BYTE_LENGTH = 64;\ned25519.constants.HASH_BYTE_LENGTH = 64;\n\ned25519.generateKeyPair = function(options) {\n  options = options || {};\n  var seed = options.seed;\n  if(seed === undefined) {\n    // generate seed\n    seed = forge.random.getBytesSync(ed25519.constants.SEED_BYTE_LENGTH);\n  } else if(typeof seed === 'string') {\n    if(seed.length !== ed25519.constants.SEED_BYTE_LENGTH) {\n      throw new TypeError(\n        '\"seed\" must be ' + ed25519.constants.SEED_BYTE_LENGTH +\n        ' bytes in length.');\n    }\n  } else if(!(seed instanceof Uint8Array)) {\n    throw new TypeError(\n      '\"seed\" must be a node.js Buffer, Uint8Array, or a binary string.');\n  }\n\n  seed = messageToNativeBuffer({message: seed, encoding: 'binary'});\n\n  var pk = new NativeBuffer(ed25519.constants.PUBLIC_KEY_BYTE_LENGTH);\n  var sk = new NativeBuffer(ed25519.constants.PRIVATE_KEY_BYTE_LENGTH);\n  for(var i = 0; i < 32; ++i) {\n    sk[i] = seed[i];\n  }\n  crypto_sign_keypair(pk, sk);\n  return {publicKey: pk, privateKey: sk};\n};\n\n/**\n * Converts a private key from a RFC8410 ASN.1 encoding.\n *\n * @param obj - The asn1 representation of a private key.\n *\n * @returns {Object} keyInfo - The key information.\n * @returns {Buffer|Uint8Array} keyInfo.privateKeyBytes - 32 private key bytes.\n */\ned25519.privateKeyFromAsn1 = function(obj) {\n  var capture = {};\n  var errors = [];\n  var valid = forge.asn1.validate(obj, privateKeyValidator, capture, errors);\n  if(!valid) {\n    var error = new Error('Invalid Key.');\n    error.errors = errors;\n    throw error;\n  }\n  var oid = forge.asn1.derToOid(capture.privateKeyOid);\n  var ed25519Oid = forge.oids.EdDSA25519;\n  if(oid !== ed25519Oid) {\n    throw new Error('Invalid OID \"' + oid + '\"; OID must be \"' +\n      ed25519Oid + '\".');\n  }\n  var privateKey = capture.privateKey;\n  // manually extract the private key bytes from nested octet string, see FIXME:\n  // https://github.com/digitalbazaar/forge/blob/master/lib/asn1.js#L542\n  var privateKeyBytes = messageToNativeBuffer({\n    message: forge.asn1.fromDer(privateKey).value,\n    encoding: 'binary'\n  });\n  // TODO: RFC8410 specifies a format for encoding the public key bytes along\n  // with the private key bytes. `publicKeyBytes` can be returned in the\n  // future. https://tools.ietf.org/html/rfc8410#section-10.3\n  return {privateKeyBytes: privateKeyBytes};\n};\n\n/**\n * Converts a public key from a RFC8410 ASN.1 encoding.\n *\n * @param obj - The asn1 representation of a public key.\n *\n * @return {Buffer|Uint8Array} - 32 public key bytes.\n */\ned25519.publicKeyFromAsn1 = function(obj) {\n  // get SubjectPublicKeyInfo\n  var capture = {};\n  var errors = [];\n  var valid = forge.asn1.validate(obj, publicKeyValidator, capture, errors);\n  if(!valid) {\n    var error = new Error('Invalid Key.');\n    error.errors = errors;\n    throw error;\n  }\n  var oid = forge.asn1.derToOid(capture.publicKeyOid);\n  var ed25519Oid = forge.oids.EdDSA25519;\n  if(oid !== ed25519Oid) {\n    throw new Error('Invalid OID \"' + oid + '\"; OID must be \"' +\n      ed25519Oid + '\".');\n  }\n  var publicKeyBytes = capture.ed25519PublicKey;\n  if(publicKeyBytes.length !== ed25519.constants.PUBLIC_KEY_BYTE_LENGTH) {\n    throw new Error('Key length is invalid.');\n  }\n  return messageToNativeBuffer({\n    message: publicKeyBytes,\n    encoding: 'binary'\n  });\n};\n\ned25519.publicKeyFromPrivateKey = function(options) {\n  options = options || {};\n  var privateKey = messageToNativeBuffer({\n    message: options.privateKey, encoding: 'binary'\n  });\n  if(privateKey.length !== ed25519.constants.PRIVATE_KEY_BYTE_LENGTH) {\n    throw new TypeError(\n      '\"options.privateKey\" must have a byte length of ' +\n      ed25519.constants.PRIVATE_KEY_BYTE_LENGTH);\n  }\n\n  var pk = new NativeBuffer(ed25519.constants.PUBLIC_KEY_BYTE_LENGTH);\n  for(var i = 0; i < pk.length; ++i) {\n    pk[i] = privateKey[32 + i];\n  }\n  return pk;\n};\n\ned25519.sign = function(options) {\n  options = options || {};\n  var msg = messageToNativeBuffer(options);\n  var privateKey = messageToNativeBuffer({\n    message: options.privateKey,\n    encoding: 'binary'\n  });\n  if(privateKey.length === ed25519.constants.SEED_BYTE_LENGTH) {\n    var keyPair = ed25519.generateKeyPair({seed: privateKey});\n    privateKey = keyPair.privateKey;\n  } else if(privateKey.length !== ed25519.constants.PRIVATE_KEY_BYTE_LENGTH) {\n    throw new TypeError(\n      '\"options.privateKey\" must have a byte length of ' +\n      ed25519.constants.SEED_BYTE_LENGTH + ' or ' +\n      ed25519.constants.PRIVATE_KEY_BYTE_LENGTH);\n  }\n\n  var signedMsg = new NativeBuffer(\n    ed25519.constants.SIGN_BYTE_LENGTH + msg.length);\n  crypto_sign(signedMsg, msg, msg.length, privateKey);\n\n  var sig = new NativeBuffer(ed25519.constants.SIGN_BYTE_LENGTH);\n  for(var i = 0; i < sig.length; ++i) {\n    sig[i] = signedMsg[i];\n  }\n  return sig;\n};\n\ned25519.verify = function(options) {\n  options = options || {};\n  var msg = messageToNativeBuffer(options);\n  if(options.signature === undefined) {\n    throw new TypeError(\n      '\"options.signature\" must be a node.js Buffer, a Uint8Array, a forge ' +\n      'ByteBuffer, or a binary string.');\n  }\n  var sig = messageToNativeBuffer({\n    message: options.signature,\n    encoding: 'binary'\n  });\n  if(sig.length !== ed25519.constants.SIGN_BYTE_LENGTH) {\n    throw new TypeError(\n      '\"options.signature\" must have a byte length of ' +\n      ed25519.constants.SIGN_BYTE_LENGTH);\n  }\n  var publicKey = messageToNativeBuffer({\n    message: options.publicKey,\n    encoding: 'binary'\n  });\n  if(publicKey.length !== ed25519.constants.PUBLIC_KEY_BYTE_LENGTH) {\n    throw new TypeError(\n      '\"options.publicKey\" must have a byte length of ' +\n      ed25519.constants.PUBLIC_KEY_BYTE_LENGTH);\n  }\n\n  var sm = new NativeBuffer(ed25519.constants.SIGN_BYTE_LENGTH + msg.length);\n  var m = new NativeBuffer(ed25519.constants.SIGN_BYTE_LENGTH + msg.length);\n  var i;\n  for(i = 0; i < ed25519.constants.SIGN_BYTE_LENGTH; ++i) {\n    sm[i] = sig[i];\n  }\n  for(i = 0; i < msg.length; ++i) {\n    sm[i + ed25519.constants.SIGN_BYTE_LENGTH] = msg[i];\n  }\n  return (crypto_sign_open(m, sm, sm.length, publicKey) >= 0);\n};\n\nfunction messageToNativeBuffer(options) {\n  var message = options.message;\n  if(message instanceof Uint8Array || message instanceof NativeBuffer) {\n    return message;\n  }\n\n  var encoding = options.encoding;\n  if(message === undefined) {\n    if(options.md) {\n      // TODO: more rigorous validation that `md` is a MessageDigest\n      message = options.md.digest().getBytes();\n      encoding = 'binary';\n    } else {\n      throw new TypeError('\"options.message\" or \"options.md\" not specified.');\n    }\n  }\n\n  if(typeof message === 'string' && !encoding) {\n    throw new TypeError('\"options.encoding\" must be \"binary\" or \"utf8\".');\n  }\n\n  if(typeof message === 'string') {\n    if(typeof Buffer !== 'undefined') {\n      return Buffer.from(message, encoding);\n    }\n    message = new ByteBuffer(message, encoding);\n  } else if(!(message instanceof ByteBuffer)) {\n    throw new TypeError(\n      '\"options.message\" must be a node.js Buffer, a Uint8Array, a forge ' +\n      'ByteBuffer, or a string with \"options.encoding\" specifying its ' +\n      'encoding.');\n  }\n\n  // convert to native buffer\n  var buffer = new NativeBuffer(message.length());\n  for(var i = 0; i < buffer.length; ++i) {\n    buffer[i] = message.at(i);\n  }\n  return buffer;\n}\n\nvar gf0 = gf();\nvar gf1 = gf([1]);\nvar D = gf([\n  0x78a3, 0x1359, 0x4dca, 0x75eb, 0xd8ab, 0x4141, 0x0a4d, 0x0070,\n  0xe898, 0x7779, 0x4079, 0x8cc7, 0xfe73, 0x2b6f, 0x6cee, 0x5203]);\nvar D2 = gf([\n  0xf159, 0x26b2, 0x9b94, 0xebd6, 0xb156, 0x8283, 0x149a, 0x00e0,\n  0xd130, 0xeef3, 0x80f2, 0x198e, 0xfce7, 0x56df, 0xd9dc, 0x2406]);\nvar X = gf([\n  0xd51a, 0x8f25, 0x2d60, 0xc956, 0xa7b2, 0x9525, 0xc760, 0x692c,\n  0xdc5c, 0xfdd6, 0xe231, 0xc0a4, 0x53fe, 0xcd6e, 0x36d3, 0x2169]);\nvar Y = gf([\n  0x6658, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666,\n  0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666]);\nvar L = new Float64Array([\n  0xed, 0xd3, 0xf5, 0x5c, 0x1a, 0x63, 0x12, 0x58,\n  0xd6, 0x9c, 0xf7, 0xa2, 0xde, 0xf9, 0xde, 0x14,\n  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0x10]);\nvar I = gf([\n  0xa0b0, 0x4a0e, 0x1b27, 0xc4ee, 0xe478, 0xad2f, 0x1806, 0x2f43,\n  0xd7a7, 0x3dfb, 0x0099, 0x2b4d, 0xdf0b, 0x4fc1, 0x2480, 0x2b83]);\n\n// TODO: update forge buffer implementation to use `Buffer` or `Uint8Array`,\n// whichever is available, to improve performance\nfunction sha512(msg, msgLen) {\n  // Note: `out` and `msg` are NativeBuffer\n  var md = forge.md.sha512.create();\n  var buffer = new ByteBuffer(msg);\n  md.update(buffer.getBytes(msgLen), 'binary');\n  var hash = md.digest().getBytes();\n  if(typeof Buffer !== 'undefined') {\n    return Buffer.from(hash, 'binary');\n  }\n  var out = new NativeBuffer(ed25519.constants.HASH_BYTE_LENGTH);\n  for(var i = 0; i < 64; ++i) {\n    out[i] = hash.charCodeAt(i);\n  }\n  return out;\n}\n\nfunction crypto_sign_keypair(pk, sk) {\n  var p = [gf(), gf(), gf(), gf()];\n  var i;\n\n  var d = sha512(sk, 32);\n  d[0] &= 248;\n  d[31] &= 127;\n  d[31] |= 64;\n\n  scalarbase(p, d);\n  pack(pk, p);\n\n  for(i = 0; i < 32; ++i) {\n    sk[i + 32] = pk[i];\n  }\n  return 0;\n}\n\n// Note: difference from C - smlen returned, not passed as argument.\nfunction crypto_sign(sm, m, n, sk) {\n  var i, j, x = new Float64Array(64);\n  var p = [gf(), gf(), gf(), gf()];\n\n  var d = sha512(sk, 32);\n  d[0] &= 248;\n  d[31] &= 127;\n  d[31] |= 64;\n\n  var smlen = n + 64;\n  for(i = 0; i < n; ++i) {\n    sm[64 + i] = m[i];\n  }\n  for(i = 0; i < 32; ++i) {\n    sm[32 + i] = d[32 + i];\n  }\n\n  var r = sha512(sm.subarray(32), n + 32);\n  reduce(r);\n  scalarbase(p, r);\n  pack(sm, p);\n\n  for(i = 32; i < 64; ++i) {\n    sm[i] = sk[i];\n  }\n  var h = sha512(sm, n + 64);\n  reduce(h);\n\n  for(i = 32; i < 64; ++i) {\n    x[i] = 0;\n  }\n  for(i = 0; i < 32; ++i) {\n    x[i] = r[i];\n  }\n  for(i = 0; i < 32; ++i) {\n    for(j = 0; j < 32; j++) {\n      x[i + j] += h[i] * d[j];\n    }\n  }\n\n  modL(sm.subarray(32), x);\n  return smlen;\n}\n\nfunction crypto_sign_open(m, sm, n, pk) {\n  var i, mlen;\n  var t = new NativeBuffer(32);\n  var p = [gf(), gf(), gf(), gf()],\n      q = [gf(), gf(), gf(), gf()];\n\n  mlen = -1;\n  if(n < 64) {\n    return -1;\n  }\n\n  if(unpackneg(q, pk)) {\n    return -1;\n  }\n\n  for(i = 0; i < n; ++i) {\n    m[i] = sm[i];\n  }\n  for(i = 0; i < 32; ++i) {\n    m[i + 32] = pk[i];\n  }\n  var h = sha512(m, n);\n  reduce(h);\n  scalarmult(p, q, h);\n\n  scalarbase(q, sm.subarray(32));\n  add(p, q);\n  pack(t, p);\n\n  n -= 64;\n  if(crypto_verify_32(sm, 0, t, 0)) {\n    for(i = 0; i < n; ++i) {\n      m[i] = 0;\n    }\n    return -1;\n  }\n\n  for(i = 0; i < n; ++i) {\n    m[i] = sm[i + 64];\n  }\n  mlen = n;\n  return mlen;\n}\n\nfunction modL(r, x) {\n  var carry, i, j, k;\n  for(i = 63; i >= 32; --i) {\n    carry = 0;\n    for(j = i - 32, k = i - 12; j < k; ++j) {\n      x[j] += carry - 16 * x[i] * L[j - (i - 32)];\n      carry = (x[j] + 128) >> 8;\n      x[j] -= carry * 256;\n    }\n    x[j] += carry;\n    x[i] = 0;\n  }\n  carry = 0;\n  for(j = 0; j < 32; ++j) {\n    x[j] += carry - (x[31] >> 4) * L[j];\n    carry = x[j] >> 8;\n    x[j] &= 255;\n  }\n  for(j = 0; j < 32; ++j) {\n    x[j] -= carry * L[j];\n  }\n  for(i = 0; i < 32; ++i) {\n    x[i + 1] += x[i] >> 8;\n    r[i] = x[i] & 255;\n  }\n}\n\nfunction reduce(r) {\n  var x = new Float64Array(64);\n  for(var i = 0; i < 64; ++i) {\n    x[i] = r[i];\n    r[i] = 0;\n  }\n  modL(r, x);\n}\n\nfunction add(p, q) {\n  var a = gf(), b = gf(), c = gf(),\n      d = gf(), e = gf(), f = gf(),\n      g = gf(), h = gf(), t = gf();\n\n  Z(a, p[1], p[0]);\n  Z(t, q[1], q[0]);\n  M(a, a, t);\n  A(b, p[0], p[1]);\n  A(t, q[0], q[1]);\n  M(b, b, t);\n  M(c, p[3], q[3]);\n  M(c, c, D2);\n  M(d, p[2], q[2]);\n  A(d, d, d);\n  Z(e, b, a);\n  Z(f, d, c);\n  A(g, d, c);\n  A(h, b, a);\n\n  M(p[0], e, f);\n  M(p[1], h, g);\n  M(p[2], g, f);\n  M(p[3], e, h);\n}\n\nfunction cswap(p, q, b) {\n  for(var i = 0; i < 4; ++i) {\n    sel25519(p[i], q[i], b);\n  }\n}\n\nfunction pack(r, p) {\n  var tx = gf(), ty = gf(), zi = gf();\n  inv25519(zi, p[2]);\n  M(tx, p[0], zi);\n  M(ty, p[1], zi);\n  pack25519(r, ty);\n  r[31] ^= par25519(tx) << 7;\n}\n\nfunction pack25519(o, n) {\n  var i, j, b;\n  var m = gf(), t = gf();\n  for(i = 0; i < 16; ++i) {\n    t[i] = n[i];\n  }\n  car25519(t);\n  car25519(t);\n  car25519(t);\n  for(j = 0; j < 2; ++j) {\n    m[0] = t[0] - 0xffed;\n    for(i = 1; i < 15; ++i) {\n      m[i] = t[i] - 0xffff - ((m[i - 1] >> 16) & 1);\n      m[i-1] &= 0xffff;\n    }\n    m[15] = t[15] - 0x7fff - ((m[14] >> 16) & 1);\n    b = (m[15] >> 16) & 1;\n    m[14] &= 0xffff;\n    sel25519(t, m, 1 - b);\n  }\n  for (i = 0; i < 16; i++) {\n    o[2 * i] = t[i] & 0xff;\n    o[2 * i + 1] = t[i] >> 8;\n  }\n}\n\nfunction unpackneg(r, p) {\n  var t = gf(), chk = gf(), num = gf(),\n      den = gf(), den2 = gf(), den4 = gf(),\n      den6 = gf();\n\n  set25519(r[2], gf1);\n  unpack25519(r[1], p);\n  S(num, r[1]);\n  M(den, num, D);\n  Z(num, num, r[2]);\n  A(den, r[2], den);\n\n  S(den2, den);\n  S(den4, den2);\n  M(den6, den4, den2);\n  M(t, den6, num);\n  M(t, t, den);\n\n  pow2523(t, t);\n  M(t, t, num);\n  M(t, t, den);\n  M(t, t, den);\n  M(r[0], t, den);\n\n  S(chk, r[0]);\n  M(chk, chk, den);\n  if(neq25519(chk, num)) {\n    M(r[0], r[0], I);\n  }\n\n  S(chk, r[0]);\n  M(chk, chk, den);\n  if(neq25519(chk, num)) {\n    return -1;\n  }\n\n  if(par25519(r[0]) === (p[31] >> 7)) {\n    Z(r[0], gf0, r[0]);\n  }\n\n  M(r[3], r[0], r[1]);\n  return 0;\n}\n\nfunction unpack25519(o, n) {\n  var i;\n  for(i = 0; i < 16; ++i) {\n    o[i] = n[2 * i] + (n[2 * i + 1] << 8);\n  }\n  o[15] &= 0x7fff;\n}\n\nfunction pow2523(o, i) {\n  var c = gf();\n  var a;\n  for(a = 0; a < 16; ++a) {\n    c[a] = i[a];\n  }\n  for(a = 250; a >= 0; --a) {\n    S(c, c);\n    if(a !== 1) {\n      M(c, c, i);\n    }\n  }\n  for(a = 0; a < 16; ++a) {\n    o[a] = c[a];\n  }\n}\n\nfunction neq25519(a, b) {\n  var c = new NativeBuffer(32);\n  var d = new NativeBuffer(32);\n  pack25519(c, a);\n  pack25519(d, b);\n  return crypto_verify_32(c, 0, d, 0);\n}\n\nfunction crypto_verify_32(x, xi, y, yi) {\n  return vn(x, xi, y, yi, 32);\n}\n\nfunction vn(x, xi, y, yi, n) {\n  var i, d = 0;\n  for(i = 0; i < n; ++i) {\n    d |= x[xi + i] ^ y[yi + i];\n  }\n  return (1 & ((d - 1) >>> 8)) - 1;\n}\n\nfunction par25519(a) {\n  var d = new NativeBuffer(32);\n  pack25519(d, a);\n  return d[0] & 1;\n}\n\nfunction scalarmult(p, q, s) {\n  var b, i;\n  set25519(p[0], gf0);\n  set25519(p[1], gf1);\n  set25519(p[2], gf1);\n  set25519(p[3], gf0);\n  for(i = 255; i >= 0; --i) {\n    b = (s[(i / 8)|0] >> (i & 7)) & 1;\n    cswap(p, q, b);\n    add(q, p);\n    add(p, p);\n    cswap(p, q, b);\n  }\n}\n\nfunction scalarbase(p, s) {\n  var q = [gf(), gf(), gf(), gf()];\n  set25519(q[0], X);\n  set25519(q[1], Y);\n  set25519(q[2], gf1);\n  M(q[3], X, Y);\n  scalarmult(p, q, s);\n}\n\nfunction set25519(r, a) {\n  var i;\n  for(i = 0; i < 16; i++) {\n    r[i] = a[i] | 0;\n  }\n}\n\nfunction inv25519(o, i) {\n  var c = gf();\n  var a;\n  for(a = 0; a < 16; ++a) {\n    c[a] = i[a];\n  }\n  for(a = 253; a >= 0; --a) {\n    S(c, c);\n    if(a !== 2 && a !== 4) {\n      M(c, c, i);\n    }\n  }\n  for(a = 0; a < 16; ++a) {\n    o[a] = c[a];\n  }\n}\n\nfunction car25519(o) {\n  var i, v, c = 1;\n  for(i = 0; i < 16; ++i) {\n    v = o[i] + c + 65535;\n    c = Math.floor(v / 65536);\n    o[i] = v - c * 65536;\n  }\n  o[0] += c - 1 + 37 * (c - 1);\n}\n\nfunction sel25519(p, q, b) {\n  var t, c = ~(b - 1);\n  for(var i = 0; i < 16; ++i) {\n    t = c & (p[i] ^ q[i]);\n    p[i] ^= t;\n    q[i] ^= t;\n  }\n}\n\nfunction gf(init) {\n  var i, r = new Float64Array(16);\n  if(init) {\n    for(i = 0; i < init.length; ++i) {\n      r[i] = init[i];\n    }\n  }\n  return r;\n}\n\nfunction A(o, a, b) {\n  for(var i = 0; i < 16; ++i) {\n    o[i] = a[i] + b[i];\n  }\n}\n\nfunction Z(o, a, b) {\n  for(var i = 0; i < 16; ++i) {\n    o[i] = a[i] - b[i];\n  }\n}\n\nfunction S(o, a) {\n  M(o, a, a);\n}\n\nfunction M(o, a, b) {\n  var v, c,\n     t0 = 0,  t1 = 0,  t2 = 0,  t3 = 0,  t4 = 0,  t5 = 0,  t6 = 0,  t7 = 0,\n     t8 = 0,  t9 = 0, t10 = 0, t11 = 0, t12 = 0, t13 = 0, t14 = 0, t15 = 0,\n    t16 = 0, t17 = 0, t18 = 0, t19 = 0, t20 = 0, t21 = 0, t22 = 0, t23 = 0,\n    t24 = 0, t25 = 0, t26 = 0, t27 = 0, t28 = 0, t29 = 0, t30 = 0,\n    b0 = b[0],\n    b1 = b[1],\n    b2 = b[2],\n    b3 = b[3],\n    b4 = b[4],\n    b5 = b[5],\n    b6 = b[6],\n    b7 = b[7],\n    b8 = b[8],\n    b9 = b[9],\n    b10 = b[10],\n    b11 = b[11],\n    b12 = b[12],\n    b13 = b[13],\n    b14 = b[14],\n    b15 = b[15];\n\n  v = a[0];\n  t0 += v * b0;\n  t1 += v * b1;\n  t2 += v * b2;\n  t3 += v * b3;\n  t4 += v * b4;\n  t5 += v * b5;\n  t6 += v * b6;\n  t7 += v * b7;\n  t8 += v * b8;\n  t9 += v * b9;\n  t10 += v * b10;\n  t11 += v * b11;\n  t12 += v * b12;\n  t13 += v * b13;\n  t14 += v * b14;\n  t15 += v * b15;\n  v = a[1];\n  t1 += v * b0;\n  t2 += v * b1;\n  t3 += v * b2;\n  t4 += v * b3;\n  t5 += v * b4;\n  t6 += v * b5;\n  t7 += v * b6;\n  t8 += v * b7;\n  t9 += v * b8;\n  t10 += v * b9;\n  t11 += v * b10;\n  t12 += v * b11;\n  t13 += v * b12;\n  t14 += v * b13;\n  t15 += v * b14;\n  t16 += v * b15;\n  v = a[2];\n  t2 += v * b0;\n  t3 += v * b1;\n  t4 += v * b2;\n  t5 += v * b3;\n  t6 += v * b4;\n  t7 += v * b5;\n  t8 += v * b6;\n  t9 += v * b7;\n  t10 += v * b8;\n  t11 += v * b9;\n  t12 += v * b10;\n  t13 += v * b11;\n  t14 += v * b12;\n  t15 += v * b13;\n  t16 += v * b14;\n  t17 += v * b15;\n  v = a[3];\n  t3 += v * b0;\n  t4 += v * b1;\n  t5 += v * b2;\n  t6 += v * b3;\n  t7 += v * b4;\n  t8 += v * b5;\n  t9 += v * b6;\n  t10 += v * b7;\n  t11 += v * b8;\n  t12 += v * b9;\n  t13 += v * b10;\n  t14 += v * b11;\n  t15 += v * b12;\n  t16 += v * b13;\n  t17 += v * b14;\n  t18 += v * b15;\n  v = a[4];\n  t4 += v * b0;\n  t5 += v * b1;\n  t6 += v * b2;\n  t7 += v * b3;\n  t8 += v * b4;\n  t9 += v * b5;\n  t10 += v * b6;\n  t11 += v * b7;\n  t12 += v * b8;\n  t13 += v * b9;\n  t14 += v * b10;\n  t15 += v * b11;\n  t16 += v * b12;\n  t17 += v * b13;\n  t18 += v * b14;\n  t19 += v * b15;\n  v = a[5];\n  t5 += v * b0;\n  t6 += v * b1;\n  t7 += v * b2;\n  t8 += v * b3;\n  t9 += v * b4;\n  t10 += v * b5;\n  t11 += v * b6;\n  t12 += v * b7;\n  t13 += v * b8;\n  t14 += v * b9;\n  t15 += v * b10;\n  t16 += v * b11;\n  t17 += v * b12;\n  t18 += v * b13;\n  t19 += v * b14;\n  t20 += v * b15;\n  v = a[6];\n  t6 += v * b0;\n  t7 += v * b1;\n  t8 += v * b2;\n  t9 += v * b3;\n  t10 += v * b4;\n  t11 += v * b5;\n  t12 += v * b6;\n  t13 += v * b7;\n  t14 += v * b8;\n  t15 += v * b9;\n  t16 += v * b10;\n  t17 += v * b11;\n  t18 += v * b12;\n  t19 += v * b13;\n  t20 += v * b14;\n  t21 += v * b15;\n  v = a[7];\n  t7 += v * b0;\n  t8 += v * b1;\n  t9 += v * b2;\n  t10 += v * b3;\n  t11 += v * b4;\n  t12 += v * b5;\n  t13 += v * b6;\n  t14 += v * b7;\n  t15 += v * b8;\n  t16 += v * b9;\n  t17 += v * b10;\n  t18 += v * b11;\n  t19 += v * b12;\n  t20 += v * b13;\n  t21 += v * b14;\n  t22 += v * b15;\n  v = a[8];\n  t8 += v * b0;\n  t9 += v * b1;\n  t10 += v * b2;\n  t11 += v * b3;\n  t12 += v * b4;\n  t13 += v * b5;\n  t14 += v * b6;\n  t15 += v * b7;\n  t16 += v * b8;\n  t17 += v * b9;\n  t18 += v * b10;\n  t19 += v * b11;\n  t20 += v * b12;\n  t21 += v * b13;\n  t22 += v * b14;\n  t23 += v * b15;\n  v = a[9];\n  t9 += v * b0;\n  t10 += v * b1;\n  t11 += v * b2;\n  t12 += v * b3;\n  t13 += v * b4;\n  t14 += v * b5;\n  t15 += v * b6;\n  t16 += v * b7;\n  t17 += v * b8;\n  t18 += v * b9;\n  t19 += v * b10;\n  t20 += v * b11;\n  t21 += v * b12;\n  t22 += v * b13;\n  t23 += v * b14;\n  t24 += v * b15;\n  v = a[10];\n  t10 += v * b0;\n  t11 += v * b1;\n  t12 += v * b2;\n  t13 += v * b3;\n  t14 += v * b4;\n  t15 += v * b5;\n  t16 += v * b6;\n  t17 += v * b7;\n  t18 += v * b8;\n  t19 += v * b9;\n  t20 += v * b10;\n  t21 += v * b11;\n  t22 += v * b12;\n  t23 += v * b13;\n  t24 += v * b14;\n  t25 += v * b15;\n  v = a[11];\n  t11 += v * b0;\n  t12 += v * b1;\n  t13 += v * b2;\n  t14 += v * b3;\n  t15 += v * b4;\n  t16 += v * b5;\n  t17 += v * b6;\n  t18 += v * b7;\n  t19 += v * b8;\n  t20 += v * b9;\n  t21 += v * b10;\n  t22 += v * b11;\n  t23 += v * b12;\n  t24 += v * b13;\n  t25 += v * b14;\n  t26 += v * b15;\n  v = a[12];\n  t12 += v * b0;\n  t13 += v * b1;\n  t14 += v * b2;\n  t15 += v * b3;\n  t16 += v * b4;\n  t17 += v * b5;\n  t18 += v * b6;\n  t19 += v * b7;\n  t20 += v * b8;\n  t21 += v * b9;\n  t22 += v * b10;\n  t23 += v * b11;\n  t24 += v * b12;\n  t25 += v * b13;\n  t26 += v * b14;\n  t27 += v * b15;\n  v = a[13];\n  t13 += v * b0;\n  t14 += v * b1;\n  t15 += v * b2;\n  t16 += v * b3;\n  t17 += v * b4;\n  t18 += v * b5;\n  t19 += v * b6;\n  t20 += v * b7;\n  t21 += v * b8;\n  t22 += v * b9;\n  t23 += v * b10;\n  t24 += v * b11;\n  t25 += v * b12;\n  t26 += v * b13;\n  t27 += v * b14;\n  t28 += v * b15;\n  v = a[14];\n  t14 += v * b0;\n  t15 += v * b1;\n  t16 += v * b2;\n  t17 += v * b3;\n  t18 += v * b4;\n  t19 += v * b5;\n  t20 += v * b6;\n  t21 += v * b7;\n  t22 += v * b8;\n  t23 += v * b9;\n  t24 += v * b10;\n  t25 += v * b11;\n  t26 += v * b12;\n  t27 += v * b13;\n  t28 += v * b14;\n  t29 += v * b15;\n  v = a[15];\n  t15 += v * b0;\n  t16 += v * b1;\n  t17 += v * b2;\n  t18 += v * b3;\n  t19 += v * b4;\n  t20 += v * b5;\n  t21 += v * b6;\n  t22 += v * b7;\n  t23 += v * b8;\n  t24 += v * b9;\n  t25 += v * b10;\n  t26 += v * b11;\n  t27 += v * b12;\n  t28 += v * b13;\n  t29 += v * b14;\n  t30 += v * b15;\n\n  t0  += 38 * t16;\n  t1  += 38 * t17;\n  t2  += 38 * t18;\n  t3  += 38 * t19;\n  t4  += 38 * t20;\n  t5  += 38 * t21;\n  t6  += 38 * t22;\n  t7  += 38 * t23;\n  t8  += 38 * t24;\n  t9  += 38 * t25;\n  t10 += 38 * t26;\n  t11 += 38 * t27;\n  t12 += 38 * t28;\n  t13 += 38 * t29;\n  t14 += 38 * t30;\n  // t15 left as is\n\n  // first car\n  c = 1;\n  v =  t0 + c + 65535; c = Math.floor(v / 65536);  t0 = v - c * 65536;\n  v =  t1 + c + 65535; c = Math.floor(v / 65536);  t1 = v - c * 65536;\n  v =  t2 + c + 65535; c = Math.floor(v / 65536);  t2 = v - c * 65536;\n  v =  t3 + c + 65535; c = Math.floor(v / 65536);  t3 = v - c * 65536;\n  v =  t4 + c + 65535; c = Math.floor(v / 65536);  t4 = v - c * 65536;\n  v =  t5 + c + 65535; c = Math.floor(v / 65536);  t5 = v - c * 65536;\n  v =  t6 + c + 65535; c = Math.floor(v / 65536);  t6 = v - c * 65536;\n  v =  t7 + c + 65535; c = Math.floor(v / 65536);  t7 = v - c * 65536;\n  v =  t8 + c + 65535; c = Math.floor(v / 65536);  t8 = v - c * 65536;\n  v =  t9 + c + 65535; c = Math.floor(v / 65536);  t9 = v - c * 65536;\n  v = t10 + c + 65535; c = Math.floor(v / 65536); t10 = v - c * 65536;\n  v = t11 + c + 65535; c = Math.floor(v / 65536); t11 = v - c * 65536;\n  v = t12 + c + 65535; c = Math.floor(v / 65536); t12 = v - c * 65536;\n  v = t13 + c + 65535; c = Math.floor(v / 65536); t13 = v - c * 65536;\n  v = t14 + c + 65535; c = Math.floor(v / 65536); t14 = v - c * 65536;\n  v = t15 + c + 65535; c = Math.floor(v / 65536); t15 = v - c * 65536;\n  t0 += c-1 + 37 * (c-1);\n\n  // second car\n  c = 1;\n  v =  t0 + c + 65535; c = Math.floor(v / 65536);  t0 = v - c * 65536;\n  v =  t1 + c + 65535; c = Math.floor(v / 65536);  t1 = v - c * 65536;\n  v =  t2 + c + 65535; c = Math.floor(v / 65536);  t2 = v - c * 65536;\n  v =  t3 + c + 65535; c = Math.floor(v / 65536);  t3 = v - c * 65536;\n  v =  t4 + c + 65535; c = Math.floor(v / 65536);  t4 = v - c * 65536;\n  v =  t5 + c + 65535; c = Math.floor(v / 65536);  t5 = v - c * 65536;\n  v =  t6 + c + 65535; c = Math.floor(v / 65536);  t6 = v - c * 65536;\n  v =  t7 + c + 65535; c = Math.floor(v / 65536);  t7 = v - c * 65536;\n  v =  t8 + c + 65535; c = Math.floor(v / 65536);  t8 = v - c * 65536;\n  v =  t9 + c + 65535; c = Math.floor(v / 65536);  t9 = v - c * 65536;\n  v = t10 + c + 65535; c = Math.floor(v / 65536); t10 = v - c * 65536;\n  v = t11 + c + 65535; c = Math.floor(v / 65536); t11 = v - c * 65536;\n  v = t12 + c + 65535; c = Math.floor(v / 65536); t12 = v - c * 65536;\n  v = t13 + c + 65535; c = Math.floor(v / 65536); t13 = v - c * 65536;\n  v = t14 + c + 65535; c = Math.floor(v / 65536); t14 = v - c * 65536;\n  v = t15 + c + 65535; c = Math.floor(v / 65536); t15 = v - c * 65536;\n  t0 += c-1 + 37 * (c-1);\n\n  o[ 0] = t0;\n  o[ 1] = t1;\n  o[ 2] = t2;\n  o[ 3] = t3;\n  o[ 4] = t4;\n  o[ 5] = t5;\n  o[ 6] = t6;\n  o[ 7] = t7;\n  o[ 8] = t8;\n  o[ 9] = t9;\n  o[10] = t10;\n  o[11] = t11;\n  o[12] = t12;\n  o[13] = t13;\n  o[14] = t14;\n  o[15] = t15;\n}\n","/**\n * Copyright (c) 2019 Digital Bazaar, Inc.\n */\n\nvar forge = require('./forge');\nrequire('./asn1');\nvar asn1 = forge.asn1;\n\nexports.privateKeyValidator = {\n  // PrivateKeyInfo\n  name: 'PrivateKeyInfo',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    // Version (INTEGER)\n    name: 'PrivateKeyInfo.version',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'privateKeyVersion'\n  }, {\n    // privateKeyAlgorithm\n    name: 'PrivateKeyInfo.privateKeyAlgorithm',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'AlgorithmIdentifier.algorithm',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OID,\n      constructed: false,\n      capture: 'privateKeyOid'\n    }]\n  }, {\n    // PrivateKey\n    name: 'PrivateKeyInfo',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.OCTETSTRING,\n    constructed: false,\n    capture: 'privateKey'\n  }]\n};\n\nexports.publicKeyValidator = {\n  name: 'SubjectPublicKeyInfo',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  captureAsn1: 'subjectPublicKeyInfo',\n  value: [{\n    name: 'SubjectPublicKeyInfo.AlgorithmIdentifier',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'AlgorithmIdentifier.algorithm',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OID,\n      constructed: false,\n      capture: 'publicKeyOid'\n    }]\n  },\n  // capture group for ed25519PublicKey\n  {\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.BITSTRING,\n    constructed: false,\n    composed: true,\n    captureBitStringValue: 'ed25519PublicKey'\n  }\n  // FIXME: this is capture group for rsaPublicKey, use it in this API or\n  // discard?\n  /* {\n    // subjectPublicKey\n    name: 'SubjectPublicKeyInfo.subjectPublicKey',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.BITSTRING,\n    constructed: false,\n    value: [{\n      // RSAPublicKey\n      name: 'SubjectPublicKeyInfo.subjectPublicKey.RSAPublicKey',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      optional: true,\n      captureAsn1: 'rsaPublicKey'\n    }]\n  } */\n  ]\n};\n","'use strict'\n\nconst webcrypto = require('../webcrypto')\nconst randomBytes = require('../random-bytes')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\nexports.utils = require('./rsa-utils')\n\nexports.generateKey = async function (bits) {\n  const pair = await webcrypto.get().subtle.generateKey(\n    {\n      name: 'RSASSA-PKCS1-v1_5',\n      modulusLength: bits,\n      publicExponent: new Uint8Array([0x01, 0x00, 0x01]),\n      hash: { name: 'SHA-256' }\n    },\n    true,\n    ['sign', 'verify']\n  )\n\n  const keys = await exportKey(pair)\n\n  return {\n    privateKey: keys[0],\n    publicKey: keys[1]\n  }\n}\n\n// Takes a jwk key\nexports.unmarshalPrivateKey = async function (key) {\n  const privateKey = await webcrypto.get().subtle.importKey(\n    'jwk',\n    key,\n    {\n      name: 'RSASSA-PKCS1-v1_5',\n      hash: { name: 'SHA-256' }\n    },\n    true,\n    ['sign']\n  )\n\n  const pair = [\n    privateKey,\n    await derivePublicFromPrivate(key)\n  ]\n\n  const keys = await exportKey({\n    privateKey: pair[0],\n    publicKey: pair[1]\n  })\n\n  return {\n    privateKey: keys[0],\n    publicKey: keys[1]\n  }\n}\n\nexports.getRandomValues = randomBytes\n\nexports.hashAndSign = async function (key, msg) {\n  const privateKey = await webcrypto.get().subtle.importKey(\n    'jwk',\n    key,\n    {\n      name: 'RSASSA-PKCS1-v1_5',\n      hash: { name: 'SHA-256' }\n    },\n    false,\n    ['sign']\n  )\n\n  const sig = await webcrypto.get().subtle.sign(\n    { name: 'RSASSA-PKCS1-v1_5' },\n    privateKey,\n    Uint8Array.from(msg)\n  )\n\n  return new Uint8Array(sig, sig.byteOffset, sig.byteLength)\n}\n\nexports.hashAndVerify = async function (key, sig, msg) {\n  const publicKey = await webcrypto.get().subtle.importKey(\n    'jwk',\n    key,\n    {\n      name: 'RSASSA-PKCS1-v1_5',\n      hash: { name: 'SHA-256' }\n    },\n    false,\n    ['verify']\n  )\n\n  return webcrypto.get().subtle.verify(\n    { name: 'RSASSA-PKCS1-v1_5' },\n    publicKey,\n    sig,\n    msg\n  )\n}\n\nfunction exportKey (pair) {\n  return Promise.all([\n    webcrypto.get().subtle.exportKey('jwk', pair.privateKey),\n    webcrypto.get().subtle.exportKey('jwk', pair.publicKey)\n  ])\n}\n\nfunction derivePublicFromPrivate (jwKey) {\n  return webcrypto.get().subtle.importKey(\n    'jwk',\n    {\n      kty: jwKey.kty,\n      n: jwKey.n,\n      e: jwKey.e\n    },\n    {\n      name: 'RSASSA-PKCS1-v1_5',\n      hash: { name: 'SHA-256' }\n    },\n    true,\n    ['verify']\n  )\n}\n\n/*\n\nRSA encryption/decryption for the browser with webcrypto workarround\n\"bloody dark magic. webcrypto's why.\"\n\nExplanation:\n  - Convert JWK to nodeForge\n  - Convert msg Uint8Array to nodeForge buffer: ByteBuffer is a \"binary-string backed buffer\", so let's make our Uint8Array a binary string\n  - Convert resulting nodeForge buffer to Uint8Array: it returns a binary string, turn that into a Uint8Array\n\n*/\n\nconst { jwk2pub, jwk2priv } = require('./jwk2pem')\n\nfunction convertKey (key, pub, msg, handle) {\n  const fkey = pub ? jwk2pub(key) : jwk2priv(key)\n  const fmsg = uint8ArrayToString(Uint8Array.from(msg), 'ascii')\n  const fomsg = handle(fmsg, fkey)\n  return uint8ArrayFromString(fomsg, 'ascii')\n}\n\nexports.encrypt = function (key, msg) {\n  return convertKey(key, true, msg, (msg, key) => key.encrypt(msg))\n}\n\nexports.decrypt = function (key, msg) {\n  return convertKey(key, false, msg, (msg, key) => key.decrypt(msg))\n}\n","'use strict'\nconst randomBytes = require('iso-random-stream/src/random')\nconst errcode = require('err-code')\n\nmodule.exports = function (length) {\n  if (isNaN(length) || length <= 0) {\n    throw errcode(new Error('random bytes length must be a Number bigger than 0'), 'ERR_INVALID_LENGTH')\n  }\n  return randomBytes(length)\n}\n","'use strict'\n\n// limit of Crypto.getRandomValues()\n// https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues\nconst MAX_BYTES = 65536\n\n/**\n * @param {number} size\n */\nfunction randomBytes(size) {\n  const bytes = new Uint8Array(size)\n  let generated = 0\n\n  if (size > 0) {\n    // getRandomValues fails on IE if size == 0\n    if (size > MAX_BYTES) {\n      while (generated < size) {\n        if (generated + MAX_BYTES > size) {\n          crypto.getRandomValues(\n            bytes.subarray(generated, generated + (size - generated))\n          )\n          generated += size - generated\n        } else {\n          crypto.getRandomValues(\n            bytes.subarray(generated, generated + MAX_BYTES)\n          )\n          generated += MAX_BYTES\n        }\n      }\n    } else {\n      crypto.getRandomValues(bytes)\n    }\n  }\n\n  return bytes\n}\n\nmodule.exports = randomBytes\n","'use strict'\n\nrequire('node-forge/lib/asn1')\nrequire('node-forge/lib/rsa')\nconst forge = require('node-forge/lib/forge')\nconst { bigIntegerToUintBase64url, base64urlToBigInteger } = require('./../util')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\n// Convert a PKCS#1 in ASN1 DER format to a JWK key\nexports.pkcs1ToJwk = function (bytes) {\n  const asn1 = forge.asn1.fromDer(uint8ArrayToString(bytes, 'ascii'))\n  const privateKey = forge.pki.privateKeyFromAsn1(asn1)\n\n  // https://tools.ietf.org/html/rfc7518#section-6.3.1\n  return {\n    kty: 'RSA',\n    n: bigIntegerToUintBase64url(privateKey.n),\n    e: bigIntegerToUintBase64url(privateKey.e),\n    d: bigIntegerToUintBase64url(privateKey.d),\n    p: bigIntegerToUintBase64url(privateKey.p),\n    q: bigIntegerToUintBase64url(privateKey.q),\n    dp: bigIntegerToUintBase64url(privateKey.dP),\n    dq: bigIntegerToUintBase64url(privateKey.dQ),\n    qi: bigIntegerToUintBase64url(privateKey.qInv),\n    alg: 'RS256',\n    kid: '2011-04-29'\n  }\n}\n\n// Convert a JWK key into PKCS#1 in ASN1 DER format\nexports.jwkToPkcs1 = function (jwk) {\n  const asn1 = forge.pki.privateKeyToAsn1({\n    n: base64urlToBigInteger(jwk.n),\n    e: base64urlToBigInteger(jwk.e),\n    d: base64urlToBigInteger(jwk.d),\n    p: base64urlToBigInteger(jwk.p),\n    q: base64urlToBigInteger(jwk.q),\n    dP: base64urlToBigInteger(jwk.dp),\n    dQ: base64urlToBigInteger(jwk.dq),\n    qInv: base64urlToBigInteger(jwk.qi)\n  })\n\n  return uint8ArrayFromString(forge.asn1.toDer(asn1).getBytes(), 'ascii')\n}\n\n// Convert a PKCIX in ASN1 DER format to a JWK key\nexports.pkixToJwk = function (bytes) {\n  const asn1 = forge.asn1.fromDer(uint8ArrayToString(bytes, 'ascii'))\n  const publicKey = forge.pki.publicKeyFromAsn1(asn1)\n\n  return {\n    kty: 'RSA',\n    n: bigIntegerToUintBase64url(publicKey.n),\n    e: bigIntegerToUintBase64url(publicKey.e),\n    alg: 'RS256',\n    kid: '2011-04-29'\n  }\n}\n\n// Convert a JWK key to PKCIX in ASN1 DER format\nexports.jwkToPkix = function (jwk) {\n  const asn1 = forge.pki.publicKeyToAsn1({\n    n: base64urlToBigInteger(jwk.n),\n    e: base64urlToBigInteger(jwk.e)\n  })\n\n  return uint8ArrayFromString(forge.asn1.toDer(asn1).getBytes(), 'ascii')\n}\n","'use strict'\n\nrequire('node-forge/lib/util')\nrequire('node-forge/lib/jsbn')\nconst forge = require('node-forge/lib/forge')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayConcat = require('uint8arrays/concat')\n\nexports.bigIntegerToUintBase64url = (num, len) => {\n  // Call `.abs()` to convert to unsigned\n  let buf = Uint8Array.from(num.abs().toByteArray()) // toByteArray converts to big endian\n\n  // toByteArray() gives us back a signed array, which will include a leading 0\n  // byte if the most significant bit of the number is 1:\n  // https://docs.microsoft.com/en-us/windows/win32/seccertenroll/about-integer\n  // Our number will always be positive so we should remove the leading padding.\n  buf = buf[0] === 0 ? buf.slice(1) : buf\n\n  if (len != null) {\n    if (buf.length > len) throw new Error('byte array longer than desired length')\n    buf = uint8ArrayConcat([new Uint8Array(len - buf.length), buf])\n  }\n\n  return uint8ArrayToString(buf, 'base64url')\n}\n\n// Convert a base64url encoded string to a BigInteger\nexports.base64urlToBigInteger = str => {\n  const buf = exports.base64urlToBuffer(str)\n  return new forge.jsbn.BigInteger(uint8ArrayToString(buf, 'base16'), 16)\n}\n\nexports.base64urlToBuffer = (str, len) => {\n  let buf = uint8ArrayFromString(str, 'base64urlpad')\n\n  if (len != null) {\n    if (buf.length > len) throw new Error('byte array longer than desired length')\n    buf = uint8ArrayConcat([new Uint8Array(len - buf.length), buf])\n  }\n\n  return buf\n}\n","'use strict'\n\nrequire('node-forge/lib/rsa')\nconst forge = require('node-forge/lib/forge')\nconst { base64urlToBigInteger } = require('../util')\n\nfunction convert (key, types) {\n  return types.map(t => base64urlToBigInteger(key[t]))\n}\n\nfunction jwk2priv (key) {\n  return forge.pki.setRsaPrivateKey(...convert(key, ['n', 'e', 'd', 'p', 'q', 'dp', 'dq', 'qi']))\n}\n\nfunction jwk2pub (key) {\n  return forge.pki.setRsaPublicKey(...convert(key, ['n', 'e']))\n}\n\nmodule.exports = {\n  jwk2pub,\n  jwk2priv\n}\n","'use strict'\n\nconst multibase = require('multibase')\nconst ciphers = require('../ciphers/aes-gcm')\n\nmodule.exports = {\n  /**\n   * Exports the given PrivateKey as a base64 encoded string.\n   * The PrivateKey is encrypted via a password derived PBKDF2 key\n   * leveraging the aes-gcm cipher algorithm.\n   *\n   * @param {Uint8Array} privateKey - The PrivateKey protobuf\n   * @param {string} password\n   * @returns {Promise<string>} A base64 encoded string\n   */\n  export: async function (privateKey, password) {\n    const cipher = ciphers.create()\n    const encryptedKey = await cipher.encrypt(privateKey, password)\n    const base64 = multibase.names.base64\n    return base64.encode(encryptedKey)\n  }\n}\n","'use strict'\n\nconst sha = require('multihashing-async/src/sha')\nconst errcode = require('err-code')\nconst uint8ArrayEquals = require('uint8arrays/equals')\nconst mh = require('multihashes')\nconst crypto = require('./ed25519')\nconst pbm = require('./keys')\nconst exporter = require('./exporter')\n\nclass Ed25519PublicKey {\n  constructor (key) {\n    this._key = ensureKey(key, crypto.publicKeyLength)\n  }\n\n  async verify (data, sig) { // eslint-disable-line require-await\n    return crypto.hashAndVerify(this._key, sig, data)\n  }\n\n  marshal () {\n    return this._key\n  }\n\n  get bytes () {\n    return pbm.PublicKey.encode({\n      Type: pbm.KeyType.Ed25519,\n      Data: this.marshal()\n    }).finish()\n  }\n\n  equals (key) {\n    return uint8ArrayEquals(this.bytes, key.bytes)\n  }\n\n  async hash () { // eslint-disable-line require-await\n    return sha.multihashing(this.bytes, 'sha2-256')\n  }\n}\n\nclass Ed25519PrivateKey {\n  // key       - 64 byte Uint8Array containing private key\n  // publicKey - 32 byte Uint8Array containing public key\n  constructor (key, publicKey) {\n    this._key = ensureKey(key, crypto.privateKeyLength)\n    this._publicKey = ensureKey(publicKey, crypto.publicKeyLength)\n  }\n\n  async sign (message) { // eslint-disable-line require-await\n    return crypto.hashAndSign(this._key, message)\n  }\n\n  get public () {\n    return new Ed25519PublicKey(this._publicKey)\n  }\n\n  marshal () {\n    return this._key\n  }\n\n  get bytes () {\n    return pbm.PrivateKey.encode({\n      Type: pbm.KeyType.Ed25519,\n      Data: this.marshal()\n    }).finish()\n  }\n\n  equals (key) {\n    return uint8ArrayEquals(this.bytes, key.bytes)\n  }\n\n  async hash () { // eslint-disable-line require-await\n    return sha.multihashing(this.bytes, 'sha2-256')\n  }\n\n  /**\n   * Gets the ID of the key.\n   *\n   * The key id is the base58 encoding of the SHA-256 multihash of its public key.\n   * The public key is a protobuf encoding containing a type and the DER encoding\n   * of the PKCS SubjectPublicKeyInfo.\n   *\n   * @returns {Promise<string>}\n   */\n  async id () {\n    const encoding = mh.encode(this.public.bytes, 'identity')\n    return await mh.toB58String(encoding)\n  }\n\n  /**\n   * Exports the key into a password protected `format`\n   *\n   * @param {string} password - The password to encrypt the key\n   * @param {string} [format=libp2p-key] - The format in which to export as\n   * @returns {Promise<Uint8Array>} The encrypted private key\n   */\n  async export (password, format = 'libp2p-key') { // eslint-disable-line require-await\n    if (format === 'libp2p-key') {\n      return exporter.export(this.bytes, password)\n    } else {\n      throw errcode(new Error(`export format '${format}' is not supported`), 'ERR_INVALID_EXPORT_FORMAT')\n    }\n  }\n}\n\nfunction unmarshalEd25519PrivateKey (bytes) {\n  // Try the old, redundant public key version\n  if (bytes.length > crypto.privateKeyLength) {\n    bytes = ensureKey(bytes, crypto.privateKeyLength + crypto.publicKeyLength)\n    const privateKeyBytes = bytes.slice(0, crypto.privateKeyLength)\n    const publicKeyBytes = bytes.slice(crypto.privateKeyLength, bytes.length)\n    return new Ed25519PrivateKey(privateKeyBytes, publicKeyBytes)\n  }\n\n  bytes = ensureKey(bytes, crypto.privateKeyLength)\n  const privateKeyBytes = bytes.slice(0, crypto.privateKeyLength)\n  const publicKeyBytes = bytes.slice(crypto.publicKeyLength)\n  return new Ed25519PrivateKey(privateKeyBytes, publicKeyBytes)\n}\n\nfunction unmarshalEd25519PublicKey (bytes) {\n  bytes = ensureKey(bytes, crypto.publicKeyLength)\n  return new Ed25519PublicKey(bytes)\n}\n\nasync function generateKeyPair () {\n  const { privateKey, publicKey } = await crypto.generateKey()\n  return new Ed25519PrivateKey(privateKey, publicKey)\n}\n\nasync function generateKeyPairFromSeed (seed) {\n  const { privateKey, publicKey } = await crypto.generateKeyFromSeed(seed)\n  return new Ed25519PrivateKey(privateKey, publicKey)\n}\n\nfunction ensureKey (key, length) {\n  key = Uint8Array.from(key || [])\n  if (key.length !== length) {\n    throw errcode(new Error(`Key must be a Uint8Array of length ${length}, got ${key.length}`), 'ERR_INVALID_KEY_TYPE')\n  }\n  return key\n}\n\nmodule.exports = {\n  Ed25519PublicKey,\n  Ed25519PrivateKey,\n  unmarshalEd25519PrivateKey,\n  unmarshalEd25519PublicKey,\n  generateKeyPair,\n  generateKeyPairFromSeed\n}\n","'use strict'\n\nrequire('node-forge/lib/ed25519')\nconst forge = require('node-forge/lib/forge')\nexports.publicKeyLength = forge.pki.ed25519.constants.PUBLIC_KEY_BYTE_LENGTH\nexports.privateKeyLength = forge.pki.ed25519.constants.PRIVATE_KEY_BYTE_LENGTH\n\nexports.generateKey = async function () { // eslint-disable-line require-await\n  return forge.pki.ed25519.generateKeyPair()\n}\n\n// seed should be a 32 byte uint8array\nexports.generateKeyFromSeed = async function (seed) { // eslint-disable-line require-await\n  return forge.pki.ed25519.generateKeyPair({ seed })\n}\n\nexports.hashAndSign = async function (key, msg) { // eslint-disable-line require-await\n  return forge.pki.ed25519.sign({ message: msg, privateKey: key })\n  // return Uint8Array.from(nacl.sign.detached(msg, key))\n}\n\nexports.hashAndVerify = async function (key, sig, msg) { // eslint-disable-line require-await\n  return forge.pki.ed25519.verify({ signature: sig, message: msg, publicKey: key })\n}\n","'use strict'\n\nconst sha = require('multihashing-async/src/sha')\nconst errcode = require('err-code')\nconst uint8ArrayEquals = require('uint8arrays/equals')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nconst exporter = require('./exporter')\n\nmodule.exports = (keysProtobuf, randomBytes, crypto) => {\n  crypto = crypto || require('./secp256k1')(randomBytes)\n\n  class Secp256k1PublicKey {\n    constructor (key) {\n      crypto.validatePublicKey(key)\n      this._key = key\n    }\n\n    verify (data, sig) {\n      return crypto.hashAndVerify(this._key, sig, data)\n    }\n\n    marshal () {\n      return crypto.compressPublicKey(this._key)\n    }\n\n    get bytes () {\n      return keysProtobuf.PublicKey.encode({\n        Type: keysProtobuf.KeyType.Secp256k1,\n        Data: this.marshal()\n      }).finish()\n    }\n\n    equals (key) {\n      return uint8ArrayEquals(this.bytes, key.bytes)\n    }\n\n    hash () {\n      return sha.multihashing(this.bytes, 'sha2-256')\n    }\n  }\n\n  class Secp256k1PrivateKey {\n    constructor (key, publicKey) {\n      this._key = key\n      this._publicKey = publicKey || crypto.computePublicKey(key)\n      crypto.validatePrivateKey(this._key)\n      crypto.validatePublicKey(this._publicKey)\n    }\n\n    sign (message) {\n      return crypto.hashAndSign(this._key, message)\n    }\n\n    get public () {\n      return new Secp256k1PublicKey(this._publicKey)\n    }\n\n    marshal () {\n      return this._key\n    }\n\n    get bytes () {\n      return keysProtobuf.PrivateKey.encode({\n        Type: keysProtobuf.KeyType.Secp256k1,\n        Data: this.marshal()\n      }).finish()\n    }\n\n    equals (key) {\n      return uint8ArrayEquals(this.bytes, key.bytes)\n    }\n\n    hash () {\n      return sha.multihashing(this.bytes, 'sha2-256')\n    }\n\n    /**\n     * Gets the ID of the key.\n     *\n     * The key id is the base58 encoding of the SHA-256 multihash of its public key.\n     * The public key is a protobuf encoding containing a type and the DER encoding\n     * of the PKCS SubjectPublicKeyInfo.\n     *\n     * @returns {Promise<string>}\n     */\n    async id () {\n      const hash = await this.public.hash()\n      return uint8ArrayToString(hash, 'base58btc')\n    }\n\n    /**\n     * Exports the key into a password protected `format`\n     *\n     * @param {string} password - The password to encrypt the key\n     * @param {string} [format=libp2p-key] - The format in which to export as\n     * @returns {Promise<string>} The encrypted private key\n     */\n    async export (password, format = 'libp2p-key') { // eslint-disable-line require-await\n      if (format === 'libp2p-key') {\n        return exporter.export(this.bytes, password)\n      } else {\n        throw errcode(new Error(`export format '${format}' is not supported`), 'ERR_INVALID_EXPORT_FORMAT')\n      }\n    }\n  }\n\n  function unmarshalSecp256k1PrivateKey (bytes) {\n    return new Secp256k1PrivateKey(bytes)\n  }\n\n  function unmarshalSecp256k1PublicKey (bytes) {\n    return new Secp256k1PublicKey(bytes)\n  }\n\n  async function generateKeyPair () {\n    const privateKeyBytes = await crypto.generateKey()\n    return new Secp256k1PrivateKey(privateKeyBytes)\n  }\n\n  return {\n    Secp256k1PublicKey,\n    Secp256k1PrivateKey,\n    unmarshalSecp256k1PrivateKey,\n    unmarshalSecp256k1PublicKey,\n    generateKeyPair\n  }\n}\n","'use strict'\n\nconst secp256k1 = require('secp256k1')\nconst sha = require('multihashing-async/src/sha')\nconst HASH_ALGORITHM = 'sha2-256'\n\nmodule.exports = (randomBytes) => {\n  const privateKeyLength = 32\n\n  function generateKey () {\n    let privateKey\n    do {\n      privateKey = randomBytes(32)\n    } while (!secp256k1.privateKeyVerify(privateKey))\n    return privateKey\n  }\n\n  async function hashAndSign (key, msg) {\n    const digest = await sha.digest(msg, HASH_ALGORITHM)\n    const sig = secp256k1.ecdsaSign(digest, key)\n    return secp256k1.signatureExport(sig.signature)\n  }\n\n  async function hashAndVerify (key, sig, msg) {\n    const digest = await sha.digest(msg, HASH_ALGORITHM)\n    sig = secp256k1.signatureImport(sig)\n    return secp256k1.ecdsaVerify(sig, digest, key)\n  }\n\n  function compressPublicKey (key) {\n    if (!secp256k1.publicKeyVerify(key)) {\n      throw new Error('Invalid public key')\n    }\n    return secp256k1.publicKeyConvert(key, true)\n  }\n\n  function decompressPublicKey (key) {\n    return secp256k1.publicKeyConvert(key, false)\n  }\n\n  function validatePrivateKey (key) {\n    if (!secp256k1.privateKeyVerify(key)) {\n      throw new Error('Invalid private key')\n    }\n  }\n\n  function validatePublicKey (key) {\n    if (!secp256k1.publicKeyVerify(key)) {\n      throw new Error('Invalid public key')\n    }\n  }\n\n  function computePublicKey (privateKey) {\n    validatePrivateKey(privateKey)\n    return secp256k1.publicKeyCreate(privateKey)\n  }\n\n  return {\n    generateKey,\n    privateKeyLength,\n    hashAndSign,\n    hashAndVerify,\n    compressPublicKey,\n    decompressPublicKey,\n    validatePrivateKey,\n    validatePublicKey,\n    computePublicKey\n  }\n}\n","module.exports = require('./lib')(require('./lib/elliptic'))\n","const errors = {\n  IMPOSSIBLE_CASE: 'Impossible case. Please create issue.',\n  TWEAK_ADD:\n    'The tweak was out of range or the resulted private key is invalid',\n  TWEAK_MUL: 'The tweak was out of range or equal to zero',\n  CONTEXT_RANDOMIZE_UNKNOW: 'Unknow error on context randomization',\n  SECKEY_INVALID: 'Private Key is invalid',\n  PUBKEY_PARSE: 'Public Key could not be parsed',\n  PUBKEY_SERIALIZE: 'Public Key serialization error',\n  PUBKEY_COMBINE: 'The sum of the public keys is not valid',\n  SIG_PARSE: 'Signature could not be parsed',\n  SIGN: 'The nonce generation function failed, or the private key was invalid',\n  RECOVER: 'Public key could not be recover',\n  ECDH: 'Scalar was invalid (zero or overflow)'\n}\n\nfunction assert (cond, msg) {\n  if (!cond) throw new Error(msg)\n}\n\nfunction isUint8Array (name, value, length) {\n  assert(value instanceof Uint8Array, `Expected ${name} to be an Uint8Array`)\n\n  if (length !== undefined) {\n    if (Array.isArray(length)) {\n      const numbers = length.join(', ')\n      const msg = `Expected ${name} to be an Uint8Array with length [${numbers}]`\n      assert(length.includes(value.length), msg)\n    } else {\n      const msg = `Expected ${name} to be an Uint8Array with length ${length}`\n      assert(value.length === length, msg)\n    }\n  }\n}\n\nfunction isCompressed (value) {\n  assert(toTypeString(value) === 'Boolean', 'Expected compressed to be a Boolean')\n}\n\nfunction getAssertedOutput (output = (len) => new Uint8Array(len), length) {\n  if (typeof output === 'function') output = output(length)\n  isUint8Array('output', output, length)\n  return output\n}\n\nfunction toTypeString (value) {\n  return Object.prototype.toString.call(value).slice(8, -1)\n}\n\nmodule.exports = (secp256k1) => {\n  return {\n    contextRandomize (seed) {\n      assert(\n        seed === null || seed instanceof Uint8Array,\n        'Expected seed to be an Uint8Array or null'\n      )\n      if (seed !== null) isUint8Array('seed', seed, 32)\n\n      switch (secp256k1.contextRandomize(seed)) {\n        case 1:\n          throw new Error(errors.CONTEXT_RANDOMIZE_UNKNOW)\n      }\n    },\n\n    privateKeyVerify (seckey) {\n      isUint8Array('private key', seckey, 32)\n\n      return secp256k1.privateKeyVerify(seckey) === 0\n    },\n\n    privateKeyNegate (seckey) {\n      isUint8Array('private key', seckey, 32)\n\n      switch (secp256k1.privateKeyNegate(seckey)) {\n        case 0:\n          return seckey\n        case 1:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n      }\n    },\n\n    privateKeyTweakAdd (seckey, tweak) {\n      isUint8Array('private key', seckey, 32)\n      isUint8Array('tweak', tweak, 32)\n\n      switch (secp256k1.privateKeyTweakAdd(seckey, tweak)) {\n        case 0:\n          return seckey\n        case 1:\n          throw new Error(errors.TWEAK_ADD)\n      }\n    },\n\n    privateKeyTweakMul (seckey, tweak) {\n      isUint8Array('private key', seckey, 32)\n      isUint8Array('tweak', tweak, 32)\n\n      switch (secp256k1.privateKeyTweakMul(seckey, tweak)) {\n        case 0:\n          return seckey\n        case 1:\n          throw new Error(errors.TWEAK_MUL)\n      }\n    },\n\n    publicKeyVerify (pubkey) {\n      isUint8Array('public key', pubkey, [33, 65])\n\n      return secp256k1.publicKeyVerify(pubkey) === 0\n    },\n\n    publicKeyCreate (seckey, compressed = true, output) {\n      isUint8Array('private key', seckey, 32)\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyCreate(output, seckey)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.SECKEY_INVALID)\n        case 2:\n          throw new Error(errors.PUBKEY_SERIALIZE)\n      }\n    },\n\n    publicKeyConvert (pubkey, compressed = true, output) {\n      isUint8Array('public key', pubkey, [33, 65])\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyConvert(output, pubkey)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.PUBKEY_SERIALIZE)\n      }\n    },\n\n    publicKeyNegate (pubkey, compressed = true, output) {\n      isUint8Array('public key', pubkey, [33, 65])\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyNegate(output, pubkey)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n        case 3:\n          throw new Error(errors.PUBKEY_SERIALIZE)\n      }\n    },\n\n    publicKeyCombine (pubkeys, compressed = true, output) {\n      assert(Array.isArray(pubkeys), 'Expected public keys to be an Array')\n      assert(pubkeys.length > 0, 'Expected public keys array will have more than zero items')\n      for (const pubkey of pubkeys) {\n        isUint8Array('public key', pubkey, [33, 65])\n      }\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyCombine(output, pubkeys)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.PUBKEY_COMBINE)\n        case 3:\n          throw new Error(errors.PUBKEY_SERIALIZE)\n      }\n    },\n\n    publicKeyTweakAdd (pubkey, tweak, compressed = true, output) {\n      isUint8Array('public key', pubkey, [33, 65])\n      isUint8Array('tweak', tweak, 32)\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyTweakAdd(output, pubkey, tweak)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.TWEAK_ADD)\n      }\n    },\n\n    publicKeyTweakMul (pubkey, tweak, compressed = true, output) {\n      isUint8Array('public key', pubkey, [33, 65])\n      isUint8Array('tweak', tweak, 32)\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.publicKeyTweakMul(output, pubkey, tweak)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.TWEAK_MUL)\n      }\n    },\n\n    signatureNormalize (sig) {\n      isUint8Array('signature', sig, 64)\n\n      switch (secp256k1.signatureNormalize(sig)) {\n        case 0:\n          return sig\n        case 1:\n          throw new Error(errors.SIG_PARSE)\n      }\n    },\n\n    signatureExport (sig, output) {\n      isUint8Array('signature', sig, 64)\n      output = getAssertedOutput(output, 72)\n\n      const obj = { output, outputlen: 72 }\n      switch (secp256k1.signatureExport(obj, sig)) {\n        case 0:\n          return output.slice(0, obj.outputlen)\n        case 1:\n          throw new Error(errors.SIG_PARSE)\n        case 2:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n      }\n    },\n\n    signatureImport (sig, output) {\n      isUint8Array('signature', sig)\n      output = getAssertedOutput(output, 64)\n\n      switch (secp256k1.signatureImport(output, sig)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.SIG_PARSE)\n        case 2:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n      }\n    },\n\n    ecdsaSign (msg32, seckey, options = {}, output) {\n      isUint8Array('message', msg32, 32)\n      isUint8Array('private key', seckey, 32)\n      assert(toTypeString(options) === 'Object', 'Expected options to be an Object')\n      if (options.data !== undefined) isUint8Array('options.data', options.data)\n      if (options.noncefn !== undefined) assert(toTypeString(options.noncefn) === 'Function', 'Expected options.noncefn to be a Function')\n      output = getAssertedOutput(output, 64)\n\n      const obj = { signature: output, recid: null }\n      switch (secp256k1.ecdsaSign(obj, msg32, seckey, options.data, options.noncefn)) {\n        case 0:\n          return obj\n        case 1:\n          throw new Error(errors.SIGN)\n        case 2:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n      }\n    },\n\n    ecdsaVerify (sig, msg32, pubkey) {\n      isUint8Array('signature', sig, 64)\n      isUint8Array('message', msg32, 32)\n      isUint8Array('public key', pubkey, [33, 65])\n\n      switch (secp256k1.ecdsaVerify(sig, msg32, pubkey)) {\n        case 0:\n          return true\n        case 3:\n          return false\n        case 1:\n          throw new Error(errors.SIG_PARSE)\n        case 2:\n          throw new Error(errors.PUBKEY_PARSE)\n      }\n    },\n\n    ecdsaRecover (sig, recid, msg32, compressed = true, output) {\n      isUint8Array('signature', sig, 64)\n      assert(\n        toTypeString(recid) === 'Number' &&\n          recid >= 0 &&\n          recid <= 3,\n        'Expected recovery id to be a Number within interval [0, 3]'\n      )\n      isUint8Array('message', msg32, 32)\n      isCompressed(compressed)\n      output = getAssertedOutput(output, compressed ? 33 : 65)\n\n      switch (secp256k1.ecdsaRecover(output, sig, recid, msg32)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.SIG_PARSE)\n        case 2:\n          throw new Error(errors.RECOVER)\n        case 3:\n          throw new Error(errors.IMPOSSIBLE_CASE)\n      }\n    },\n\n    ecdh (pubkey, seckey, options = {}, output) {\n      isUint8Array('public key', pubkey, [33, 65])\n      isUint8Array('private key', seckey, 32)\n      assert(toTypeString(options) === 'Object', 'Expected options to be an Object')\n      if (options.data !== undefined) isUint8Array('options.data', options.data)\n      if (options.hashfn !== undefined) {\n        assert(toTypeString(options.hashfn) === 'Function', 'Expected options.hashfn to be a Function')\n        if (options.xbuf !== undefined) isUint8Array('options.xbuf', options.xbuf, 32)\n        if (options.ybuf !== undefined) isUint8Array('options.ybuf', options.ybuf, 32)\n        isUint8Array('output', output)\n      } else {\n        output = getAssertedOutput(output, 32)\n      }\n\n      switch (secp256k1.ecdh(output, pubkey, seckey, options.data, options.hashfn, options.xbuf, options.ybuf)) {\n        case 0:\n          return output\n        case 1:\n          throw new Error(errors.PUBKEY_PARSE)\n        case 2:\n          throw new Error(errors.ECDH)\n      }\n    }\n  }\n}\n","const EC = require('elliptic').ec\n\nconst ec = new EC('secp256k1')\nconst ecparams = ec.curve\n\n// Hack, we can not use bn.js@5, while elliptic uses bn.js@4\n// See https://github.com/indutny/elliptic/issues/191#issuecomment-569888758\nconst BN = ecparams.n.constructor\n\nfunction loadCompressedPublicKey (first, xbuf) {\n  let x = new BN(xbuf)\n\n  // overflow\n  if (x.cmp(ecparams.p) >= 0) return null\n  x = x.toRed(ecparams.red)\n\n  // compute corresponding Y\n  let y = x.redSqr().redIMul(x).redIAdd(ecparams.b).redSqrt()\n  if ((first === 0x03) !== y.isOdd()) y = y.redNeg()\n\n  return ec.keyPair({ pub: { x: x, y: y } })\n}\n\nfunction loadUncompressedPublicKey (first, xbuf, ybuf) {\n  let x = new BN(xbuf)\n  let y = new BN(ybuf)\n\n  // overflow\n  if (x.cmp(ecparams.p) >= 0 || y.cmp(ecparams.p) >= 0) return null\n\n  x = x.toRed(ecparams.red)\n  y = y.toRed(ecparams.red)\n\n  // is odd flag\n  if ((first === 0x06 || first === 0x07) && y.isOdd() !== (first === 0x07)) return null\n\n  // x*x*x + b = y*y\n  const x3 = x.redSqr().redIMul(x)\n  if (!y.redSqr().redISub(x3.redIAdd(ecparams.b)).isZero()) return null\n\n  return ec.keyPair({ pub: { x: x, y: y } })\n}\n\nfunction loadPublicKey (pubkey) {\n  // length should be validated in interface\n  const first = pubkey[0]\n  switch (first) {\n    case 0x02:\n    case 0x03:\n      if (pubkey.length !== 33) return null\n      return loadCompressedPublicKey(first, pubkey.subarray(1, 33))\n    case 0x04:\n    case 0x06:\n    case 0x07:\n      if (pubkey.length !== 65) return null\n      return loadUncompressedPublicKey(first, pubkey.subarray(1, 33), pubkey.subarray(33, 65))\n    default:\n      return null\n  }\n}\n\nfunction savePublicKey (output, point) {\n  const pubkey = point.encode(null, output.length === 33)\n  // Loop should be faster because we do not need create extra Uint8Array\n  // output.set(new Uint8Array(pubkey))\n  for (let i = 0; i < output.length; ++i) output[i] = pubkey[i]\n}\n\nmodule.exports = {\n  contextRandomize () {\n    return 0\n  },\n\n  privateKeyVerify (seckey) {\n    const bn = new BN(seckey)\n    return bn.cmp(ecparams.n) < 0 && !bn.isZero() ? 0 : 1\n  },\n\n  privateKeyNegate (seckey) {\n    const bn = new BN(seckey)\n    const negate = ecparams.n.sub(bn).umod(ecparams.n).toArrayLike(Uint8Array, 'be', 32)\n    seckey.set(negate)\n    return 0\n  },\n\n  privateKeyTweakAdd (seckey, tweak) {\n    const bn = new BN(tweak)\n    if (bn.cmp(ecparams.n) >= 0) return 1\n\n    bn.iadd(new BN(seckey))\n    if (bn.cmp(ecparams.n) >= 0) bn.isub(ecparams.n)\n    if (bn.isZero()) return 1\n\n    const tweaked = bn.toArrayLike(Uint8Array, 'be', 32)\n    seckey.set(tweaked)\n\n    return 0\n  },\n\n  privateKeyTweakMul (seckey, tweak) {\n    let bn = new BN(tweak)\n    if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) return 1\n\n    bn.imul(new BN(seckey))\n    if (bn.cmp(ecparams.n) >= 0) bn = bn.umod(ecparams.n)\n\n    const tweaked = bn.toArrayLike(Uint8Array, 'be', 32)\n    seckey.set(tweaked)\n\n    return 0\n  },\n\n  publicKeyVerify (pubkey) {\n    const pair = loadPublicKey(pubkey)\n    return pair === null ? 1 : 0\n  },\n\n  publicKeyCreate (output, seckey) {\n    const bn = new BN(seckey)\n    if (bn.cmp(ecparams.n) >= 0 || bn.isZero()) return 1\n\n    const point = ec.keyFromPrivate(seckey).getPublic()\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  publicKeyConvert (output, pubkey) {\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 1\n\n    const point = pair.getPublic()\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  publicKeyNegate (output, pubkey) {\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 1\n\n    const point = pair.getPublic()\n    point.y = point.y.redNeg()\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  publicKeyCombine (output, pubkeys) {\n    const pairs = new Array(pubkeys.length)\n    for (let i = 0; i < pubkeys.length; ++i) {\n      pairs[i] = loadPublicKey(pubkeys[i])\n      if (pairs[i] === null) return 1\n    }\n\n    let point = pairs[0].getPublic()\n    for (let i = 1; i < pairs.length; ++i) point = point.add(pairs[i].pub)\n    if (point.isInfinity()) return 2\n\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  publicKeyTweakAdd (output, pubkey, tweak) {\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 1\n\n    tweak = new BN(tweak)\n    if (tweak.cmp(ecparams.n) >= 0) return 2\n\n    const point = pair.getPublic().add(ecparams.g.mul(tweak))\n    if (point.isInfinity()) return 2\n\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  publicKeyTweakMul (output, pubkey, tweak) {\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 1\n\n    tweak = new BN(tweak)\n    if (tweak.cmp(ecparams.n) >= 0 || tweak.isZero()) return 2\n\n    const point = pair.getPublic().mul(tweak)\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  signatureNormalize (sig) {\n    const r = new BN(sig.subarray(0, 32))\n    const s = new BN(sig.subarray(32, 64))\n    if (r.cmp(ecparams.n) >= 0 || s.cmp(ecparams.n) >= 0) return 1\n\n    if (s.cmp(ec.nh) === 1) {\n      sig.set(ecparams.n.sub(s).toArrayLike(Uint8Array, 'be', 32), 32)\n    }\n\n    return 0\n  },\n\n  // Copied 1-to-1 from https://github.com/bitcoinjs/bip66/blob/master/index.js\n  // Adapted for Uint8Array instead Buffer\n  signatureExport (obj, sig) {\n    const sigR = sig.subarray(0, 32)\n    const sigS = sig.subarray(32, 64)\n    if (new BN(sigR).cmp(ecparams.n) >= 0) return 1\n    if (new BN(sigS).cmp(ecparams.n) >= 0) return 1\n\n    const { output } = obj\n\n    // Prepare R\n    let r = output.subarray(4, 4 + 33)\n    r[0] = 0x00\n    r.set(sigR, 1)\n\n    let lenR = 33\n    let posR = 0\n    for (; lenR > 1 && r[posR] === 0x00 && !(r[posR + 1] & 0x80); --lenR, ++posR);\n\n    r = r.subarray(posR)\n    if (r[0] & 0x80) return 1\n    if (lenR > 1 && (r[0] === 0x00) && !(r[1] & 0x80)) return 1\n\n    // Prepare S\n    let s = output.subarray(6 + 33, 6 + 33 + 33)\n    s[0] = 0x00\n    s.set(sigS, 1)\n\n    let lenS = 33\n    let posS = 0\n    for (; lenS > 1 && s[posS] === 0x00 && !(s[posS + 1] & 0x80); --lenS, ++posS);\n\n    s = s.subarray(posS)\n    if (s[0] & 0x80) return 1\n    if (lenS > 1 && (s[0] === 0x00) && !(s[1] & 0x80)) return 1\n\n    // Set output length for return\n    obj.outputlen = 6 + lenR + lenS\n\n    // Output in specified format\n    // 0x30 [total-length] 0x02 [R-length] [R] 0x02 [S-length] [S]\n    output[0] = 0x30\n    output[1] = obj.outputlen - 2\n    output[2] = 0x02\n    output[3] = r.length\n    output.set(r, 4)\n    output[4 + lenR] = 0x02\n    output[5 + lenR] = s.length\n    output.set(s, 6 + lenR)\n\n    return 0\n  },\n\n  // Copied 1-to-1 from https://github.com/bitcoinjs/bip66/blob/master/index.js\n  // Adapted for Uint8Array instead Buffer\n  signatureImport (output, sig) {\n    if (sig.length < 8) return 1\n    if (sig.length > 72) return 1\n    if (sig[0] !== 0x30) return 1\n    if (sig[1] !== sig.length - 2) return 1\n    if (sig[2] !== 0x02) return 1\n\n    const lenR = sig[3]\n    if (lenR === 0) return 1\n    if (5 + lenR >= sig.length) return 1\n    if (sig[4 + lenR] !== 0x02) return 1\n\n    const lenS = sig[5 + lenR]\n    if (lenS === 0) return 1\n    if ((6 + lenR + lenS) !== sig.length) return 1\n\n    if (sig[4] & 0x80) return 1\n    if (lenR > 1 && (sig[4] === 0x00) && !(sig[5] & 0x80)) return 1\n\n    if (sig[lenR + 6] & 0x80) return 1\n    if (lenS > 1 && (sig[lenR + 6] === 0x00) && !(sig[lenR + 7] & 0x80)) return 1\n\n    let sigR = sig.subarray(4, 4 + lenR)\n    if (sigR.length === 33 && sigR[0] === 0x00) sigR = sigR.subarray(1)\n    if (sigR.length > 32) return 1\n\n    let sigS = sig.subarray(6 + lenR)\n    if (sigS.length === 33 && sigS[0] === 0x00) sigS = sigS.slice(1)\n    if (sigS.length > 32) throw new Error('S length is too long')\n\n    let r = new BN(sigR)\n    if (r.cmp(ecparams.n) >= 0) r = new BN(0)\n\n    let s = new BN(sig.subarray(6 + lenR))\n    if (s.cmp(ecparams.n) >= 0) s = new BN(0)\n\n    output.set(r.toArrayLike(Uint8Array, 'be', 32), 0)\n    output.set(s.toArrayLike(Uint8Array, 'be', 32), 32)\n\n    return 0\n  },\n\n  ecdsaSign (obj, message, seckey, data, noncefn) {\n    if (noncefn) {\n      const _noncefn = noncefn\n      noncefn = (counter) => {\n        const nonce = _noncefn(message, seckey, null, data, counter)\n\n        const isValid = nonce instanceof Uint8Array && nonce.length === 32\n        if (!isValid) throw new Error('This is the way')\n\n        return new BN(nonce)\n      }\n    }\n\n    const d = new BN(seckey)\n    if (d.cmp(ecparams.n) >= 0 || d.isZero()) return 1\n\n    let sig\n    try {\n      sig = ec.sign(message, seckey, { canonical: true, k: noncefn, pers: data })\n    } catch (err) {\n      return 1\n    }\n\n    obj.signature.set(sig.r.toArrayLike(Uint8Array, 'be', 32), 0)\n    obj.signature.set(sig.s.toArrayLike(Uint8Array, 'be', 32), 32)\n    obj.recid = sig.recoveryParam\n\n    return 0\n  },\n\n  ecdsaVerify (sig, msg32, pubkey) {\n    const sigObj = { r: sig.subarray(0, 32), s: sig.subarray(32, 64) }\n\n    const sigr = new BN(sigObj.r)\n    const sigs = new BN(sigObj.s)\n    if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) return 1\n    if (sigs.cmp(ec.nh) === 1 || sigr.isZero() || sigs.isZero()) return 3\n\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 2\n\n    const point = pair.getPublic()\n    const isValid = ec.verify(msg32, sigObj, point)\n    return isValid ? 0 : 3\n  },\n\n  ecdsaRecover (output, sig, recid, msg32) {\n    const sigObj = { r: sig.slice(0, 32), s: sig.slice(32, 64) }\n\n    const sigr = new BN(sigObj.r)\n    const sigs = new BN(sigObj.s)\n    if (sigr.cmp(ecparams.n) >= 0 || sigs.cmp(ecparams.n) >= 0) return 1\n\n    if (sigr.isZero() || sigs.isZero()) return 2\n\n    // Can throw `throw new Error('Unable to find sencond key candinate');`\n    let point\n    try {\n      point = ec.recoverPubKey(msg32, sigObj, recid)\n    } catch (err) {\n      return 2\n    }\n\n    savePublicKey(output, point)\n\n    return 0\n  },\n\n  ecdh (output, pubkey, seckey, data, hashfn, xbuf, ybuf) {\n    const pair = loadPublicKey(pubkey)\n    if (pair === null) return 1\n\n    const scalar = new BN(seckey)\n    if (scalar.cmp(ecparams.n) >= 0 || scalar.isZero()) return 2\n\n    const point = pair.getPublic().mul(scalar)\n\n    if (hashfn === undefined) {\n      const data = point.encode(null, true)\n      const sha256 = ec.hash().update(data).digest()\n      for (let i = 0; i < 32; ++i) output[i] = sha256[i]\n    } else {\n      if (!xbuf) xbuf = new Uint8Array(32)\n      const x = point.getX().toArray('be', 32)\n      for (let i = 0; i < 32; ++i) xbuf[i] = x[i]\n\n      if (!ybuf) ybuf = new Uint8Array(32)\n      const y = point.getY().toArray('be', 32)\n      for (let i = 0; i < 32; ++i) ybuf[i] = y[i]\n\n      const hash = hashfn(xbuf, ybuf, data)\n\n      const isValid = hash instanceof Uint8Array && hash.length === output.length\n      if (!isValid) return 2\n\n      output.set(hash)\n    }\n\n    return 0\n  }\n}\n","'use strict';\n\nvar elliptic = exports;\n\nelliptic.version = require('../package.json').version;\nelliptic.utils = require('./elliptic/utils');\nelliptic.rand = require('brorand');\nelliptic.curve = require('./elliptic/curve');\nelliptic.curves = require('./elliptic/curves');\n\n// Protocols\nelliptic.ec = require('./elliptic/ec');\nelliptic.eddsa = require('./elliptic/eddsa');\n","'use strict';\n\nvar utils = exports;\nvar BN = require('bn.js');\nvar minAssert = require('minimalistic-assert');\nvar minUtils = require('minimalistic-crypto-utils');\n\nutils.assert = minAssert;\nutils.toArray = minUtils.toArray;\nutils.zero2 = minUtils.zero2;\nutils.toHex = minUtils.toHex;\nutils.encode = minUtils.encode;\n\n// Represent num in a w-NAF form\nfunction getNAF(num, w, bits) {\n  var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n  naf.fill(0);\n\n  var ws = 1 << (w + 1);\n  var k = num.clone();\n\n  for (var i = 0; i < naf.length; i++) {\n    var z;\n    var mod = k.andln(ws - 1);\n    if (k.isOdd()) {\n      if (mod > (ws >> 1) - 1)\n        z = (ws >> 1) - mod;\n      else\n        z = mod;\n      k.isubn(z);\n    } else {\n      z = 0;\n    }\n\n    naf[i] = z;\n    k.iushrn(1);\n  }\n\n  return naf;\n}\nutils.getNAF = getNAF;\n\n// Represent k1, k2 in a Joint Sparse Form\nfunction getJSF(k1, k2) {\n  var jsf = [\n    [],\n    [],\n  ];\n\n  k1 = k1.clone();\n  k2 = k2.clone();\n  var d1 = 0;\n  var d2 = 0;\n  var m8;\n  while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {\n    // First phase\n    var m14 = (k1.andln(3) + d1) & 3;\n    var m24 = (k2.andln(3) + d2) & 3;\n    if (m14 === 3)\n      m14 = -1;\n    if (m24 === 3)\n      m24 = -1;\n    var u1;\n    if ((m14 & 1) === 0) {\n      u1 = 0;\n    } else {\n      m8 = (k1.andln(7) + d1) & 7;\n      if ((m8 === 3 || m8 === 5) && m24 === 2)\n        u1 = -m14;\n      else\n        u1 = m14;\n    }\n    jsf[0].push(u1);\n\n    var u2;\n    if ((m24 & 1) === 0) {\n      u2 = 0;\n    } else {\n      m8 = (k2.andln(7) + d2) & 7;\n      if ((m8 === 3 || m8 === 5) && m14 === 2)\n        u2 = -m24;\n      else\n        u2 = m24;\n    }\n    jsf[1].push(u2);\n\n    // Second phase\n    if (2 * d1 === u1 + 1)\n      d1 = 1 - d1;\n    if (2 * d2 === u2 + 1)\n      d2 = 1 - d2;\n    k1.iushrn(1);\n    k2.iushrn(1);\n  }\n\n  return jsf;\n}\nutils.getJSF = getJSF;\n\nfunction cachedProperty(obj, name, computer) {\n  var key = '_' + name;\n  obj.prototype[name] = function cachedProperty() {\n    return this[key] !== undefined ? this[key] :\n      this[key] = computer.call(this);\n  };\n}\nutils.cachedProperty = cachedProperty;\n\nfunction parseBytes(bytes) {\n  return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') :\n    bytes;\n}\nutils.parseBytes = parseBytes;\n\nfunction intFromLE(bytes) {\n  return new BN(bytes, 'hex', 'le');\n}\nutils.intFromLE = intFromLE;\n\n","(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [ number & 0x3ffffff ];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [ 0 ];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this.strip();\n  };\n\n  function parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // 'A' - 'F'\n    if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    // '0' - '9'\n    } else {\n      return (c - 48) & 0xf;\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\n\n    this.strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        r += c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        r += c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        r += c;\n      }\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [ 0 ];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    this.strip();\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype.strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  BN.prototype.inspect = function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  };\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16);\n  };\n\n  BN.prototype.toBuffer = function toBuffer (endian, length) {\n    assert(typeof Buffer !== 'undefined');\n    return this.toArrayLike(Buffer, endian, length);\n  };\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    this.strip();\n    var littleEndian = endian === 'le';\n    var res = new ArrayType(reqLength);\n\n    var b, i;\n    var q = this.clone();\n    if (!littleEndian) {\n      // Assume big-endian\n      for (i = 0; i < reqLength - byteLength; i++) {\n        res[i] = 0;\n      }\n\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[reqLength - i - 1] = b;\n      }\n    } else {\n      for (i = 0; !q.isZero(); i++) {\n        b = q.andln(0xff);\n        q.iushrn(8);\n\n        res[i] = b;\n      }\n\n      for (; i < reqLength; i++) {\n        res[i] = 0;\n      }\n    }\n\n    return res;\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this.strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this.strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this.strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this.strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out.strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    var fftm = new FFTM();\n    return fftm.mulp(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out.strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this.strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) < num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this.strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this.strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q.strip();\n    }\n    a.strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modn = function modn (num) {\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return acc;\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    return this.strip();\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this.strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is BN v4 instance\n        r.strip();\n      } else {\n        // r is BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n    return a.umod(this.m)._forceRed(this);\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","module.exports = assert;\n\nfunction assert(val, msg) {\n  if (!val)\n    throw new Error(msg || 'Assertion failed');\n}\n\nassert.equal = function assertEqual(l, r, msg) {\n  if (l != r)\n    throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r));\n};\n","'use strict';\n\nvar utils = exports;\n\nfunction toArray(msg, enc) {\n  if (Array.isArray(msg))\n    return msg.slice();\n  if (!msg)\n    return [];\n  var res = [];\n  if (typeof msg !== 'string') {\n    for (var i = 0; i < msg.length; i++)\n      res[i] = msg[i] | 0;\n    return res;\n  }\n  if (enc === 'hex') {\n    msg = msg.replace(/[^a-z0-9]+/ig, '');\n    if (msg.length % 2 !== 0)\n      msg = '0' + msg;\n    for (var i = 0; i < msg.length; i += 2)\n      res.push(parseInt(msg[i] + msg[i + 1], 16));\n  } else {\n    for (var i = 0; i < msg.length; i++) {\n      var c = msg.charCodeAt(i);\n      var hi = c >> 8;\n      var lo = c & 0xff;\n      if (hi)\n        res.push(hi, lo);\n      else\n        res.push(lo);\n    }\n  }\n  return res;\n}\nutils.toArray = toArray;\n\nfunction zero2(word) {\n  if (word.length === 1)\n    return '0' + word;\n  else\n    return word;\n}\nutils.zero2 = zero2;\n\nfunction toHex(msg) {\n  var res = '';\n  for (var i = 0; i < msg.length; i++)\n    res += zero2(msg[i].toString(16));\n  return res;\n}\nutils.toHex = toHex;\n\nutils.encode = function encode(arr, enc) {\n  if (enc === 'hex')\n    return toHex(arr);\n  else\n    return arr;\n};\n","var r;\n\nmodule.exports = function rand(len) {\n  if (!r)\n    r = new Rand(null);\n\n  return r.generate(len);\n};\n\nfunction Rand(rand) {\n  this.rand = rand;\n}\nmodule.exports.Rand = Rand;\n\nRand.prototype.generate = function generate(len) {\n  return this._rand(len);\n};\n\n// Emulate crypto API using randy\nRand.prototype._rand = function _rand(n) {\n  if (this.rand.getBytes)\n    return this.rand.getBytes(n);\n\n  var res = new Uint8Array(n);\n  for (var i = 0; i < res.length; i++)\n    res[i] = this.rand.getByte();\n  return res;\n};\n\nif (typeof self === 'object') {\n  if (self.crypto && self.crypto.getRandomValues) {\n    // Modern browsers\n    Rand.prototype._rand = function _rand(n) {\n      var arr = new Uint8Array(n);\n      self.crypto.getRandomValues(arr);\n      return arr;\n    };\n  } else if (self.msCrypto && self.msCrypto.getRandomValues) {\n    // IE\n    Rand.prototype._rand = function _rand(n) {\n      var arr = new Uint8Array(n);\n      self.msCrypto.getRandomValues(arr);\n      return arr;\n    };\n\n  // Safari's WebWorkers do not have `crypto`\n  } else if (typeof window === 'object') {\n    // Old junk\n    Rand.prototype._rand = function() {\n      throw new Error('Not implemented yet');\n    };\n  }\n} else {\n  // Node.js or Web worker with no crypto support\n  try {\n    var crypto = require('crypto');\n    if (typeof crypto.randomBytes !== 'function')\n      throw new Error('Not supported');\n\n    Rand.prototype._rand = function _rand(n) {\n      return crypto.randomBytes(n);\n    };\n  } catch (e) {\n  }\n}\n","'use strict';\n\nvar curve = exports;\n\ncurve.base = require('./base');\ncurve.short = require('./short');\ncurve.mont = require('./mont');\ncurve.edwards = require('./edwards');\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar getNAF = utils.getNAF;\nvar getJSF = utils.getJSF;\nvar assert = utils.assert;\n\nfunction BaseCurve(type, conf) {\n  this.type = type;\n  this.p = new BN(conf.p, 16);\n\n  // Use Montgomery, when there is no fast reduction for the prime\n  this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p);\n\n  // Useful for many curves\n  this.zero = new BN(0).toRed(this.red);\n  this.one = new BN(1).toRed(this.red);\n  this.two = new BN(2).toRed(this.red);\n\n  // Curve configuration, optional\n  this.n = conf.n && new BN(conf.n, 16);\n  this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed);\n\n  // Temporary arrays\n  this._wnafT1 = new Array(4);\n  this._wnafT2 = new Array(4);\n  this._wnafT3 = new Array(4);\n  this._wnafT4 = new Array(4);\n\n  this._bitLength = this.n ? this.n.bitLength() : 0;\n\n  // Generalized Greg Maxwell's trick\n  var adjustCount = this.n && this.p.div(this.n);\n  if (!adjustCount || adjustCount.cmpn(100) > 0) {\n    this.redN = null;\n  } else {\n    this._maxwellTrick = true;\n    this.redN = this.n.toRed(this.red);\n  }\n}\nmodule.exports = BaseCurve;\n\nBaseCurve.prototype.point = function point() {\n  throw new Error('Not implemented');\n};\n\nBaseCurve.prototype.validate = function validate() {\n  throw new Error('Not implemented');\n};\n\nBaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) {\n  assert(p.precomputed);\n  var doubles = p._getDoubles();\n\n  var naf = getNAF(k, 1, this._bitLength);\n  var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n  I /= 3;\n\n  // Translate into more windowed form\n  var repr = [];\n  var j;\n  var nafW;\n  for (j = 0; j < naf.length; j += doubles.step) {\n    nafW = 0;\n    for (var l = j + doubles.step - 1; l >= j; l--)\n      nafW = (nafW << 1) + naf[l];\n    repr.push(nafW);\n  }\n\n  var a = this.jpoint(null, null, null);\n  var b = this.jpoint(null, null, null);\n  for (var i = I; i > 0; i--) {\n    for (j = 0; j < repr.length; j++) {\n      nafW = repr[j];\n      if (nafW === i)\n        b = b.mixedAdd(doubles.points[j]);\n      else if (nafW === -i)\n        b = b.mixedAdd(doubles.points[j].neg());\n    }\n    a = a.add(b);\n  }\n  return a.toP();\n};\n\nBaseCurve.prototype._wnafMul = function _wnafMul(p, k) {\n  var w = 4;\n\n  // Precompute window\n  var nafPoints = p._getNAFPoints(w);\n  w = nafPoints.wnd;\n  var wnd = nafPoints.points;\n\n  // Get NAF form\n  var naf = getNAF(k, w, this._bitLength);\n\n  // Add `this`*(N+1) for every w-NAF index\n  var acc = this.jpoint(null, null, null);\n  for (var i = naf.length - 1; i >= 0; i--) {\n    // Count zeroes\n    for (var l = 0; i >= 0 && naf[i] === 0; i--)\n      l++;\n    if (i >= 0)\n      l++;\n    acc = acc.dblp(l);\n\n    if (i < 0)\n      break;\n    var z = naf[i];\n    assert(z !== 0);\n    if (p.type === 'affine') {\n      // J +- P\n      if (z > 0)\n        acc = acc.mixedAdd(wnd[(z - 1) >> 1]);\n      else\n        acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg());\n    } else {\n      // J +- J\n      if (z > 0)\n        acc = acc.add(wnd[(z - 1) >> 1]);\n      else\n        acc = acc.add(wnd[(-z - 1) >> 1].neg());\n    }\n  }\n  return p.type === 'affine' ? acc.toP() : acc;\n};\n\nBaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW,\n  points,\n  coeffs,\n  len,\n  jacobianResult) {\n  var wndWidth = this._wnafT1;\n  var wnd = this._wnafT2;\n  var naf = this._wnafT3;\n\n  // Fill all arrays\n  var max = 0;\n  var i;\n  var j;\n  var p;\n  for (i = 0; i < len; i++) {\n    p = points[i];\n    var nafPoints = p._getNAFPoints(defW);\n    wndWidth[i] = nafPoints.wnd;\n    wnd[i] = nafPoints.points;\n  }\n\n  // Comb small window NAFs\n  for (i = len - 1; i >= 1; i -= 2) {\n    var a = i - 1;\n    var b = i;\n    if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n      naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength);\n      naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength);\n      max = Math.max(naf[a].length, max);\n      max = Math.max(naf[b].length, max);\n      continue;\n    }\n\n    var comb = [\n      points[a], /* 1 */\n      null, /* 3 */\n      null, /* 5 */\n      points[b], /* 7 */\n    ];\n\n    // Try to avoid Projective points, if possible\n    if (points[a].y.cmp(points[b].y) === 0) {\n      comb[1] = points[a].add(points[b]);\n      comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n    } else if (points[a].y.cmp(points[b].y.redNeg()) === 0) {\n      comb[1] = points[a].toJ().mixedAdd(points[b]);\n      comb[2] = points[a].add(points[b].neg());\n    } else {\n      comb[1] = points[a].toJ().mixedAdd(points[b]);\n      comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n    }\n\n    var index = [\n      -3, /* -1 -1 */\n      -1, /* -1 0 */\n      -5, /* -1 1 */\n      -7, /* 0 -1 */\n      0, /* 0 0 */\n      7, /* 0 1 */\n      5, /* 1 -1 */\n      1, /* 1 0 */\n      3,  /* 1 1 */\n    ];\n\n    var jsf = getJSF(coeffs[a], coeffs[b]);\n    max = Math.max(jsf[0].length, max);\n    naf[a] = new Array(max);\n    naf[b] = new Array(max);\n    for (j = 0; j < max; j++) {\n      var ja = jsf[0][j] | 0;\n      var jb = jsf[1][j] | 0;\n\n      naf[a][j] = index[(ja + 1) * 3 + (jb + 1)];\n      naf[b][j] = 0;\n      wnd[a] = comb;\n    }\n  }\n\n  var acc = this.jpoint(null, null, null);\n  var tmp = this._wnafT4;\n  for (i = max; i >= 0; i--) {\n    var k = 0;\n\n    while (i >= 0) {\n      var zero = true;\n      for (j = 0; j < len; j++) {\n        tmp[j] = naf[j][i] | 0;\n        if (tmp[j] !== 0)\n          zero = false;\n      }\n      if (!zero)\n        break;\n      k++;\n      i--;\n    }\n    if (i >= 0)\n      k++;\n    acc = acc.dblp(k);\n    if (i < 0)\n      break;\n\n    for (j = 0; j < len; j++) {\n      var z = tmp[j];\n      p;\n      if (z === 0)\n        continue;\n      else if (z > 0)\n        p = wnd[j][(z - 1) >> 1];\n      else if (z < 0)\n        p = wnd[j][(-z - 1) >> 1].neg();\n\n      if (p.type === 'affine')\n        acc = acc.mixedAdd(p);\n      else\n        acc = acc.add(p);\n    }\n  }\n  // Zeroify references\n  for (i = 0; i < len; i++)\n    wnd[i] = null;\n\n  if (jacobianResult)\n    return acc;\n  else\n    return acc.toP();\n};\n\nfunction BasePoint(curve, type) {\n  this.curve = curve;\n  this.type = type;\n  this.precomputed = null;\n}\nBaseCurve.BasePoint = BasePoint;\n\nBasePoint.prototype.eq = function eq(/*other*/) {\n  throw new Error('Not implemented');\n};\n\nBasePoint.prototype.validate = function validate() {\n  return this.curve.validate(this);\n};\n\nBaseCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n  bytes = utils.toArray(bytes, enc);\n\n  var len = this.p.byteLength();\n\n  // uncompressed, hybrid-odd, hybrid-even\n  if ((bytes[0] === 0x04 || bytes[0] === 0x06 || bytes[0] === 0x07) &&\n      bytes.length - 1 === 2 * len) {\n    if (bytes[0] === 0x06)\n      assert(bytes[bytes.length - 1] % 2 === 0);\n    else if (bytes[0] === 0x07)\n      assert(bytes[bytes.length - 1] % 2 === 1);\n\n    var res =  this.point(bytes.slice(1, 1 + len),\n      bytes.slice(1 + len, 1 + 2 * len));\n\n    return res;\n  } else if ((bytes[0] === 0x02 || bytes[0] === 0x03) &&\n              bytes.length - 1 === len) {\n    return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03);\n  }\n  throw new Error('Unknown point format');\n};\n\nBasePoint.prototype.encodeCompressed = function encodeCompressed(enc) {\n  return this.encode(enc, true);\n};\n\nBasePoint.prototype._encode = function _encode(compact) {\n  var len = this.curve.p.byteLength();\n  var x = this.getX().toArray('be', len);\n\n  if (compact)\n    return [ this.getY().isEven() ? 0x02 : 0x03 ].concat(x);\n\n  return [ 0x04 ].concat(x, this.getY().toArray('be', len));\n};\n\nBasePoint.prototype.encode = function encode(enc, compact) {\n  return utils.encode(this._encode(compact), enc);\n};\n\nBasePoint.prototype.precompute = function precompute(power) {\n  if (this.precomputed)\n    return this;\n\n  var precomputed = {\n    doubles: null,\n    naf: null,\n    beta: null,\n  };\n  precomputed.naf = this._getNAFPoints(8);\n  precomputed.doubles = this._getDoubles(4, power);\n  precomputed.beta = this._getBeta();\n  this.precomputed = precomputed;\n\n  return this;\n};\n\nBasePoint.prototype._hasDoubles = function _hasDoubles(k) {\n  if (!this.precomputed)\n    return false;\n\n  var doubles = this.precomputed.doubles;\n  if (!doubles)\n    return false;\n\n  return doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step);\n};\n\nBasePoint.prototype._getDoubles = function _getDoubles(step, power) {\n  if (this.precomputed && this.precomputed.doubles)\n    return this.precomputed.doubles;\n\n  var doubles = [ this ];\n  var acc = this;\n  for (var i = 0; i < power; i += step) {\n    for (var j = 0; j < step; j++)\n      acc = acc.dbl();\n    doubles.push(acc);\n  }\n  return {\n    step: step,\n    points: doubles,\n  };\n};\n\nBasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) {\n  if (this.precomputed && this.precomputed.naf)\n    return this.precomputed.naf;\n\n  var res = [ this ];\n  var max = (1 << wnd) - 1;\n  var dbl = max === 1 ? null : this.dbl();\n  for (var i = 1; i < max; i++)\n    res[i] = res[i - 1].add(dbl);\n  return {\n    wnd: wnd,\n    points: res,\n  };\n};\n\nBasePoint.prototype._getBeta = function _getBeta() {\n  return null;\n};\n\nBasePoint.prototype.dblp = function dblp(k) {\n  var r = this;\n  for (var i = 0; i < k; i++)\n    r = r.dbl();\n  return r;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction ShortCurve(conf) {\n  Base.call(this, 'short', conf);\n\n  this.a = new BN(conf.a, 16).toRed(this.red);\n  this.b = new BN(conf.b, 16).toRed(this.red);\n  this.tinv = this.two.redInvm();\n\n  this.zeroA = this.a.fromRed().cmpn(0) === 0;\n  this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0;\n\n  // If the curve is endomorphic, precalculate beta and lambda\n  this.endo = this._getEndomorphism(conf);\n  this._endoWnafT1 = new Array(4);\n  this._endoWnafT2 = new Array(4);\n}\ninherits(ShortCurve, Base);\nmodule.exports = ShortCurve;\n\nShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) {\n  // No efficient endomorphism\n  if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)\n    return;\n\n  // Compute beta and lambda, that lambda * P = (beta * Px; Py)\n  var beta;\n  var lambda;\n  if (conf.beta) {\n    beta = new BN(conf.beta, 16).toRed(this.red);\n  } else {\n    var betas = this._getEndoRoots(this.p);\n    // Choose the smallest beta\n    beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1];\n    beta = beta.toRed(this.red);\n  }\n  if (conf.lambda) {\n    lambda = new BN(conf.lambda, 16);\n  } else {\n    // Choose the lambda that is matching selected beta\n    var lambdas = this._getEndoRoots(this.n);\n    if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) {\n      lambda = lambdas[0];\n    } else {\n      lambda = lambdas[1];\n      assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0);\n    }\n  }\n\n  // Get basis vectors, used for balanced length-two representation\n  var basis;\n  if (conf.basis) {\n    basis = conf.basis.map(function(vec) {\n      return {\n        a: new BN(vec.a, 16),\n        b: new BN(vec.b, 16),\n      };\n    });\n  } else {\n    basis = this._getEndoBasis(lambda);\n  }\n\n  return {\n    beta: beta,\n    lambda: lambda,\n    basis: basis,\n  };\n};\n\nShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) {\n  // Find roots of for x^2 + x + 1 in F\n  // Root = (-1 +- Sqrt(-3)) / 2\n  //\n  var red = num === this.p ? this.red : BN.mont(num);\n  var tinv = new BN(2).toRed(red).redInvm();\n  var ntinv = tinv.redNeg();\n\n  var s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv);\n\n  var l1 = ntinv.redAdd(s).fromRed();\n  var l2 = ntinv.redSub(s).fromRed();\n  return [ l1, l2 ];\n};\n\nShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) {\n  // aprxSqrt >= sqrt(this.n)\n  var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2));\n\n  // 3.74\n  // Run EGCD, until r(L + 1) < aprxSqrt\n  var u = lambda;\n  var v = this.n.clone();\n  var x1 = new BN(1);\n  var y1 = new BN(0);\n  var x2 = new BN(0);\n  var y2 = new BN(1);\n\n  // NOTE: all vectors are roots of: a + b * lambda = 0 (mod n)\n  var a0;\n  var b0;\n  // First vector\n  var a1;\n  var b1;\n  // Second vector\n  var a2;\n  var b2;\n\n  var prevR;\n  var i = 0;\n  var r;\n  var x;\n  while (u.cmpn(0) !== 0) {\n    var q = v.div(u);\n    r = v.sub(q.mul(u));\n    x = x2.sub(q.mul(x1));\n    var y = y2.sub(q.mul(y1));\n\n    if (!a1 && r.cmp(aprxSqrt) < 0) {\n      a0 = prevR.neg();\n      b0 = x1;\n      a1 = r.neg();\n      b1 = x;\n    } else if (a1 && ++i === 2) {\n      break;\n    }\n    prevR = r;\n\n    v = u;\n    u = r;\n    x2 = x1;\n    x1 = x;\n    y2 = y1;\n    y1 = y;\n  }\n  a2 = r.neg();\n  b2 = x;\n\n  var len1 = a1.sqr().add(b1.sqr());\n  var len2 = a2.sqr().add(b2.sqr());\n  if (len2.cmp(len1) >= 0) {\n    a2 = a0;\n    b2 = b0;\n  }\n\n  // Normalize signs\n  if (a1.negative) {\n    a1 = a1.neg();\n    b1 = b1.neg();\n  }\n  if (a2.negative) {\n    a2 = a2.neg();\n    b2 = b2.neg();\n  }\n\n  return [\n    { a: a1, b: b1 },\n    { a: a2, b: b2 },\n  ];\n};\n\nShortCurve.prototype._endoSplit = function _endoSplit(k) {\n  var basis = this.endo.basis;\n  var v1 = basis[0];\n  var v2 = basis[1];\n\n  var c1 = v2.b.mul(k).divRound(this.n);\n  var c2 = v1.b.neg().mul(k).divRound(this.n);\n\n  var p1 = c1.mul(v1.a);\n  var p2 = c2.mul(v2.a);\n  var q1 = c1.mul(v1.b);\n  var q2 = c2.mul(v2.b);\n\n  // Calculate answer\n  var k1 = k.sub(p1).sub(p2);\n  var k2 = q1.add(q2).neg();\n  return { k1: k1, k2: k2 };\n};\n\nShortCurve.prototype.pointFromX = function pointFromX(x, odd) {\n  x = new BN(x, 16);\n  if (!x.red)\n    x = x.toRed(this.red);\n\n  var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b);\n  var y = y2.redSqrt();\n  if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n    throw new Error('invalid point');\n\n  // XXX Is there any way to tell if the number is odd without converting it\n  // to non-red form?\n  var isOdd = y.fromRed().isOdd();\n  if (odd && !isOdd || !odd && isOdd)\n    y = y.redNeg();\n\n  return this.point(x, y);\n};\n\nShortCurve.prototype.validate = function validate(point) {\n  if (point.inf)\n    return true;\n\n  var x = point.x;\n  var y = point.y;\n\n  var ax = this.a.redMul(x);\n  var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n  return y.redSqr().redISub(rhs).cmpn(0) === 0;\n};\n\nShortCurve.prototype._endoWnafMulAdd =\n    function _endoWnafMulAdd(points, coeffs, jacobianResult) {\n      var npoints = this._endoWnafT1;\n      var ncoeffs = this._endoWnafT2;\n      for (var i = 0; i < points.length; i++) {\n        var split = this._endoSplit(coeffs[i]);\n        var p = points[i];\n        var beta = p._getBeta();\n\n        if (split.k1.negative) {\n          split.k1.ineg();\n          p = p.neg(true);\n        }\n        if (split.k2.negative) {\n          split.k2.ineg();\n          beta = beta.neg(true);\n        }\n\n        npoints[i * 2] = p;\n        npoints[i * 2 + 1] = beta;\n        ncoeffs[i * 2] = split.k1;\n        ncoeffs[i * 2 + 1] = split.k2;\n      }\n      var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult);\n\n      // Clean-up references to points and coefficients\n      for (var j = 0; j < i * 2; j++) {\n        npoints[j] = null;\n        ncoeffs[j] = null;\n      }\n      return res;\n    };\n\nfunction Point(curve, x, y, isRed) {\n  Base.BasePoint.call(this, curve, 'affine');\n  if (x === null && y === null) {\n    this.x = null;\n    this.y = null;\n    this.inf = true;\n  } else {\n    this.x = new BN(x, 16);\n    this.y = new BN(y, 16);\n    // Force redgomery representation when loading from JSON\n    if (isRed) {\n      this.x.forceRed(this.curve.red);\n      this.y.forceRed(this.curve.red);\n    }\n    if (!this.x.red)\n      this.x = this.x.toRed(this.curve.red);\n    if (!this.y.red)\n      this.y = this.y.toRed(this.curve.red);\n    this.inf = false;\n  }\n}\ninherits(Point, Base.BasePoint);\n\nShortCurve.prototype.point = function point(x, y, isRed) {\n  return new Point(this, x, y, isRed);\n};\n\nShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) {\n  return Point.fromJSON(this, obj, red);\n};\n\nPoint.prototype._getBeta = function _getBeta() {\n  if (!this.curve.endo)\n    return;\n\n  var pre = this.precomputed;\n  if (pre && pre.beta)\n    return pre.beta;\n\n  var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n  if (pre) {\n    var curve = this.curve;\n    var endoMul = function(p) {\n      return curve.point(p.x.redMul(curve.endo.beta), p.y);\n    };\n    pre.beta = beta;\n    beta.precomputed = {\n      beta: null,\n      naf: pre.naf && {\n        wnd: pre.naf.wnd,\n        points: pre.naf.points.map(endoMul),\n      },\n      doubles: pre.doubles && {\n        step: pre.doubles.step,\n        points: pre.doubles.points.map(endoMul),\n      },\n    };\n  }\n  return beta;\n};\n\nPoint.prototype.toJSON = function toJSON() {\n  if (!this.precomputed)\n    return [ this.x, this.y ];\n\n  return [ this.x, this.y, this.precomputed && {\n    doubles: this.precomputed.doubles && {\n      step: this.precomputed.doubles.step,\n      points: this.precomputed.doubles.points.slice(1),\n    },\n    naf: this.precomputed.naf && {\n      wnd: this.precomputed.naf.wnd,\n      points: this.precomputed.naf.points.slice(1),\n    },\n  } ];\n};\n\nPoint.fromJSON = function fromJSON(curve, obj, red) {\n  if (typeof obj === 'string')\n    obj = JSON.parse(obj);\n  var res = curve.point(obj[0], obj[1], red);\n  if (!obj[2])\n    return res;\n\n  function obj2point(obj) {\n    return curve.point(obj[0], obj[1], red);\n  }\n\n  var pre = obj[2];\n  res.precomputed = {\n    beta: null,\n    doubles: pre.doubles && {\n      step: pre.doubles.step,\n      points: [ res ].concat(pre.doubles.points.map(obj2point)),\n    },\n    naf: pre.naf && {\n      wnd: pre.naf.wnd,\n      points: [ res ].concat(pre.naf.points.map(obj2point)),\n    },\n  };\n  return res;\n};\n\nPoint.prototype.inspect = function inspect() {\n  if (this.isInfinity())\n    return '<EC Point Infinity>';\n  return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +\n      ' y: ' + this.y.fromRed().toString(16, 2) + '>';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n  return this.inf;\n};\n\nPoint.prototype.add = function add(p) {\n  // O + P = P\n  if (this.inf)\n    return p;\n\n  // P + O = P\n  if (p.inf)\n    return this;\n\n  // P + P = 2P\n  if (this.eq(p))\n    return this.dbl();\n\n  // P + (-P) = O\n  if (this.neg().eq(p))\n    return this.curve.point(null, null);\n\n  // P + Q = O\n  if (this.x.cmp(p.x) === 0)\n    return this.curve.point(null, null);\n\n  var c = this.y.redSub(p.y);\n  if (c.cmpn(0) !== 0)\n    c = c.redMul(this.x.redSub(p.x).redInvm());\n  var nx = c.redSqr().redISub(this.x).redISub(p.x);\n  var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n  return this.curve.point(nx, ny);\n};\n\nPoint.prototype.dbl = function dbl() {\n  if (this.inf)\n    return this;\n\n  // 2P = O\n  var ys1 = this.y.redAdd(this.y);\n  if (ys1.cmpn(0) === 0)\n    return this.curve.point(null, null);\n\n  var a = this.curve.a;\n\n  var x2 = this.x.redSqr();\n  var dyinv = ys1.redInvm();\n  var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv);\n\n  var nx = c.redSqr().redISub(this.x.redAdd(this.x));\n  var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n  return this.curve.point(nx, ny);\n};\n\nPoint.prototype.getX = function getX() {\n  return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n  return this.y.fromRed();\n};\n\nPoint.prototype.mul = function mul(k) {\n  k = new BN(k, 16);\n  if (this.isInfinity())\n    return this;\n  else if (this._hasDoubles(k))\n    return this.curve._fixedNafMul(this, k);\n  else if (this.curve.endo)\n    return this.curve._endoWnafMulAdd([ this ], [ k ]);\n  else\n    return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p2, k2) {\n  var points = [ this, p2 ];\n  var coeffs = [ k1, k2 ];\n  if (this.curve.endo)\n    return this.curve._endoWnafMulAdd(points, coeffs);\n  else\n    return this.curve._wnafMulAdd(1, points, coeffs, 2);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p2, k2) {\n  var points = [ this, p2 ];\n  var coeffs = [ k1, k2 ];\n  if (this.curve.endo)\n    return this.curve._endoWnafMulAdd(points, coeffs, true);\n  else\n    return this.curve._wnafMulAdd(1, points, coeffs, 2, true);\n};\n\nPoint.prototype.eq = function eq(p) {\n  return this === p ||\n         this.inf === p.inf &&\n             (this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0);\n};\n\nPoint.prototype.neg = function neg(_precompute) {\n  if (this.inf)\n    return this;\n\n  var res = this.curve.point(this.x, this.y.redNeg());\n  if (_precompute && this.precomputed) {\n    var pre = this.precomputed;\n    var negate = function(p) {\n      return p.neg();\n    };\n    res.precomputed = {\n      naf: pre.naf && {\n        wnd: pre.naf.wnd,\n        points: pre.naf.points.map(negate),\n      },\n      doubles: pre.doubles && {\n        step: pre.doubles.step,\n        points: pre.doubles.points.map(negate),\n      },\n    };\n  }\n  return res;\n};\n\nPoint.prototype.toJ = function toJ() {\n  if (this.inf)\n    return this.curve.jpoint(null, null, null);\n\n  var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n  return res;\n};\n\nfunction JPoint(curve, x, y, z) {\n  Base.BasePoint.call(this, curve, 'jacobian');\n  if (x === null && y === null && z === null) {\n    this.x = this.curve.one;\n    this.y = this.curve.one;\n    this.z = new BN(0);\n  } else {\n    this.x = new BN(x, 16);\n    this.y = new BN(y, 16);\n    this.z = new BN(z, 16);\n  }\n  if (!this.x.red)\n    this.x = this.x.toRed(this.curve.red);\n  if (!this.y.red)\n    this.y = this.y.toRed(this.curve.red);\n  if (!this.z.red)\n    this.z = this.z.toRed(this.curve.red);\n\n  this.zOne = this.z === this.curve.one;\n}\ninherits(JPoint, Base.BasePoint);\n\nShortCurve.prototype.jpoint = function jpoint(x, y, z) {\n  return new JPoint(this, x, y, z);\n};\n\nJPoint.prototype.toP = function toP() {\n  if (this.isInfinity())\n    return this.curve.point(null, null);\n\n  var zinv = this.z.redInvm();\n  var zinv2 = zinv.redSqr();\n  var ax = this.x.redMul(zinv2);\n  var ay = this.y.redMul(zinv2).redMul(zinv);\n\n  return this.curve.point(ax, ay);\n};\n\nJPoint.prototype.neg = function neg() {\n  return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n};\n\nJPoint.prototype.add = function add(p) {\n  // O + P = P\n  if (this.isInfinity())\n    return p;\n\n  // P + O = P\n  if (p.isInfinity())\n    return this;\n\n  // 12M + 4S + 7A\n  var pz2 = p.z.redSqr();\n  var z2 = this.z.redSqr();\n  var u1 = this.x.redMul(pz2);\n  var u2 = p.x.redMul(z2);\n  var s1 = this.y.redMul(pz2.redMul(p.z));\n  var s2 = p.y.redMul(z2.redMul(this.z));\n\n  var h = u1.redSub(u2);\n  var r = s1.redSub(s2);\n  if (h.cmpn(0) === 0) {\n    if (r.cmpn(0) !== 0)\n      return this.curve.jpoint(null, null, null);\n    else\n      return this.dbl();\n  }\n\n  var h2 = h.redSqr();\n  var h3 = h2.redMul(h);\n  var v = u1.redMul(h2);\n\n  var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n  var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n  var nz = this.z.redMul(p.z).redMul(h);\n\n  return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mixedAdd = function mixedAdd(p) {\n  // O + P = P\n  if (this.isInfinity())\n    return p.toJ();\n\n  // P + O = P\n  if (p.isInfinity())\n    return this;\n\n  // 8M + 3S + 7A\n  var z2 = this.z.redSqr();\n  var u1 = this.x;\n  var u2 = p.x.redMul(z2);\n  var s1 = this.y;\n  var s2 = p.y.redMul(z2).redMul(this.z);\n\n  var h = u1.redSub(u2);\n  var r = s1.redSub(s2);\n  if (h.cmpn(0) === 0) {\n    if (r.cmpn(0) !== 0)\n      return this.curve.jpoint(null, null, null);\n    else\n      return this.dbl();\n  }\n\n  var h2 = h.redSqr();\n  var h3 = h2.redMul(h);\n  var v = u1.redMul(h2);\n\n  var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n  var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n  var nz = this.z.redMul(h);\n\n  return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.dblp = function dblp(pow) {\n  if (pow === 0)\n    return this;\n  if (this.isInfinity())\n    return this;\n  if (!pow)\n    return this.dbl();\n\n  var i;\n  if (this.curve.zeroA || this.curve.threeA) {\n    var r = this;\n    for (i = 0; i < pow; i++)\n      r = r.dbl();\n    return r;\n  }\n\n  // 1M + 2S + 1A + N * (4S + 5M + 8A)\n  // N = 1 => 6M + 6S + 9A\n  var a = this.curve.a;\n  var tinv = this.curve.tinv;\n\n  var jx = this.x;\n  var jy = this.y;\n  var jz = this.z;\n  var jz4 = jz.redSqr().redSqr();\n\n  // Reuse results\n  var jyd = jy.redAdd(jy);\n  for (i = 0; i < pow; i++) {\n    var jx2 = jx.redSqr();\n    var jyd2 = jyd.redSqr();\n    var jyd4 = jyd2.redSqr();\n    var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n    var t1 = jx.redMul(jyd2);\n    var nx = c.redSqr().redISub(t1.redAdd(t1));\n    var t2 = t1.redISub(nx);\n    var dny = c.redMul(t2);\n    dny = dny.redIAdd(dny).redISub(jyd4);\n    var nz = jyd.redMul(jz);\n    if (i + 1 < pow)\n      jz4 = jz4.redMul(jyd4);\n\n    jx = nx;\n    jz = nz;\n    jyd = dny;\n  }\n\n  return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n};\n\nJPoint.prototype.dbl = function dbl() {\n  if (this.isInfinity())\n    return this;\n\n  if (this.curve.zeroA)\n    return this._zeroDbl();\n  else if (this.curve.threeA)\n    return this._threeDbl();\n  else\n    return this._dbl();\n};\n\nJPoint.prototype._zeroDbl = function _zeroDbl() {\n  var nx;\n  var ny;\n  var nz;\n  // Z = 1\n  if (this.zOne) {\n    // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n    //     #doubling-mdbl-2007-bl\n    // 1M + 5S + 14A\n\n    // XX = X1^2\n    var xx = this.x.redSqr();\n    // YY = Y1^2\n    var yy = this.y.redSqr();\n    // YYYY = YY^2\n    var yyyy = yy.redSqr();\n    // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n    var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n    s = s.redIAdd(s);\n    // M = 3 * XX + a; a = 0\n    var m = xx.redAdd(xx).redIAdd(xx);\n    // T = M ^ 2 - 2*S\n    var t = m.redSqr().redISub(s).redISub(s);\n\n    // 8 * YYYY\n    var yyyy8 = yyyy.redIAdd(yyyy);\n    yyyy8 = yyyy8.redIAdd(yyyy8);\n    yyyy8 = yyyy8.redIAdd(yyyy8);\n\n    // X3 = T\n    nx = t;\n    // Y3 = M * (S - T) - 8 * YYYY\n    ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n    // Z3 = 2*Y1\n    nz = this.y.redAdd(this.y);\n  } else {\n    // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n    //     #doubling-dbl-2009-l\n    // 2M + 5S + 13A\n\n    // A = X1^2\n    var a = this.x.redSqr();\n    // B = Y1^2\n    var b = this.y.redSqr();\n    // C = B^2\n    var c = b.redSqr();\n    // D = 2 * ((X1 + B)^2 - A - C)\n    var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n    d = d.redIAdd(d);\n    // E = 3 * A\n    var e = a.redAdd(a).redIAdd(a);\n    // F = E^2\n    var f = e.redSqr();\n\n    // 8 * C\n    var c8 = c.redIAdd(c);\n    c8 = c8.redIAdd(c8);\n    c8 = c8.redIAdd(c8);\n\n    // X3 = F - 2 * D\n    nx = f.redISub(d).redISub(d);\n    // Y3 = E * (D - X3) - 8 * C\n    ny = e.redMul(d.redISub(nx)).redISub(c8);\n    // Z3 = 2 * Y1 * Z1\n    nz = this.y.redMul(this.z);\n    nz = nz.redIAdd(nz);\n  }\n\n  return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._threeDbl = function _threeDbl() {\n  var nx;\n  var ny;\n  var nz;\n  // Z = 1\n  if (this.zOne) {\n    // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html\n    //     #doubling-mdbl-2007-bl\n    // 1M + 5S + 15A\n\n    // XX = X1^2\n    var xx = this.x.redSqr();\n    // YY = Y1^2\n    var yy = this.y.redSqr();\n    // YYYY = YY^2\n    var yyyy = yy.redSqr();\n    // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n    var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n    s = s.redIAdd(s);\n    // M = 3 * XX + a\n    var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a);\n    // T = M^2 - 2 * S\n    var t = m.redSqr().redISub(s).redISub(s);\n    // X3 = T\n    nx = t;\n    // Y3 = M * (S - T) - 8 * YYYY\n    var yyyy8 = yyyy.redIAdd(yyyy);\n    yyyy8 = yyyy8.redIAdd(yyyy8);\n    yyyy8 = yyyy8.redIAdd(yyyy8);\n    ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n    // Z3 = 2 * Y1\n    nz = this.y.redAdd(this.y);\n  } else {\n    // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b\n    // 3M + 5S\n\n    // delta = Z1^2\n    var delta = this.z.redSqr();\n    // gamma = Y1^2\n    var gamma = this.y.redSqr();\n    // beta = X1 * gamma\n    var beta = this.x.redMul(gamma);\n    // alpha = 3 * (X1 - delta) * (X1 + delta)\n    var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n    alpha = alpha.redAdd(alpha).redIAdd(alpha);\n    // X3 = alpha^2 - 8 * beta\n    var beta4 = beta.redIAdd(beta);\n    beta4 = beta4.redIAdd(beta4);\n    var beta8 = beta4.redAdd(beta4);\n    nx = alpha.redSqr().redISub(beta8);\n    // Z3 = (Y1 + Z1)^2 - gamma - delta\n    nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta);\n    // Y3 = alpha * (4 * beta - X3) - 8 * gamma^2\n    var ggamma8 = gamma.redSqr();\n    ggamma8 = ggamma8.redIAdd(ggamma8);\n    ggamma8 = ggamma8.redIAdd(ggamma8);\n    ggamma8 = ggamma8.redIAdd(ggamma8);\n    ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8);\n  }\n\n  return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._dbl = function _dbl() {\n  var a = this.curve.a;\n\n  // 4M + 6S + 10A\n  var jx = this.x;\n  var jy = this.y;\n  var jz = this.z;\n  var jz4 = jz.redSqr().redSqr();\n\n  var jx2 = jx.redSqr();\n  var jy2 = jy.redSqr();\n\n  var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n  var jxd4 = jx.redAdd(jx);\n  jxd4 = jxd4.redIAdd(jxd4);\n  var t1 = jxd4.redMul(jy2);\n  var nx = c.redSqr().redISub(t1.redAdd(t1));\n  var t2 = t1.redISub(nx);\n\n  var jyd8 = jy2.redSqr();\n  jyd8 = jyd8.redIAdd(jyd8);\n  jyd8 = jyd8.redIAdd(jyd8);\n  jyd8 = jyd8.redIAdd(jyd8);\n  var ny = c.redMul(t2).redISub(jyd8);\n  var nz = jy.redAdd(jy).redMul(jz);\n\n  return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.trpl = function trpl() {\n  if (!this.curve.zeroA)\n    return this.dbl().add(this);\n\n  // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl\n  // 5M + 10S + ...\n\n  // XX = X1^2\n  var xx = this.x.redSqr();\n  // YY = Y1^2\n  var yy = this.y.redSqr();\n  // ZZ = Z1^2\n  var zz = this.z.redSqr();\n  // YYYY = YY^2\n  var yyyy = yy.redSqr();\n  // M = 3 * XX + a * ZZ2; a = 0\n  var m = xx.redAdd(xx).redIAdd(xx);\n  // MM = M^2\n  var mm = m.redSqr();\n  // E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM\n  var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n  e = e.redIAdd(e);\n  e = e.redAdd(e).redIAdd(e);\n  e = e.redISub(mm);\n  // EE = E^2\n  var ee = e.redSqr();\n  // T = 16*YYYY\n  var t = yyyy.redIAdd(yyyy);\n  t = t.redIAdd(t);\n  t = t.redIAdd(t);\n  t = t.redIAdd(t);\n  // U = (M + E)^2 - MM - EE - T\n  var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t);\n  // X3 = 4 * (X1 * EE - 4 * YY * U)\n  var yyu4 = yy.redMul(u);\n  yyu4 = yyu4.redIAdd(yyu4);\n  yyu4 = yyu4.redIAdd(yyu4);\n  var nx = this.x.redMul(ee).redISub(yyu4);\n  nx = nx.redIAdd(nx);\n  nx = nx.redIAdd(nx);\n  // Y3 = 8 * Y1 * (U * (T - U) - E * EE)\n  var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n  ny = ny.redIAdd(ny);\n  ny = ny.redIAdd(ny);\n  ny = ny.redIAdd(ny);\n  // Z3 = (Z1 + E)^2 - ZZ - EE\n  var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n\n  return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mul = function mul(k, kbase) {\n  k = new BN(k, kbase);\n\n  return this.curve._wnafMul(this, k);\n};\n\nJPoint.prototype.eq = function eq(p) {\n  if (p.type === 'affine')\n    return this.eq(p.toJ());\n\n  if (this === p)\n    return true;\n\n  // x1 * z2^2 == x2 * z1^2\n  var z2 = this.z.redSqr();\n  var pz2 = p.z.redSqr();\n  if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0)\n    return false;\n\n  // y1 * z2^3 == y2 * z1^3\n  var z3 = z2.redMul(this.z);\n  var pz3 = pz2.redMul(p.z);\n  return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n};\n\nJPoint.prototype.eqXToP = function eqXToP(x) {\n  var zs = this.z.redSqr();\n  var rx = x.toRed(this.curve.red).redMul(zs);\n  if (this.x.cmp(rx) === 0)\n    return true;\n\n  var xc = x.clone();\n  var t = this.curve.redN.redMul(zs);\n  for (;;) {\n    xc.iadd(this.curve.n);\n    if (xc.cmp(this.curve.p) >= 0)\n      return false;\n\n    rx.redIAdd(t);\n    if (this.x.cmp(rx) === 0)\n      return true;\n  }\n};\n\nJPoint.prototype.inspect = function inspect() {\n  if (this.isInfinity())\n    return '<EC JPoint Infinity>';\n  return '<EC JPoint x: ' + this.x.toString(16, 2) +\n      ' y: ' + this.y.toString(16, 2) +\n      ' z: ' + this.z.toString(16, 2) + '>';\n};\n\nJPoint.prototype.isInfinity = function isInfinity() {\n  // XXX This code assumes that zero is always zero in red\n  return this.z.cmpn(0) === 0;\n};\n","if (typeof Object.create === 'function') {\n  // implementation from standard node.js 'util' module\n  module.exports = function inherits(ctor, superCtor) {\n    if (superCtor) {\n      ctor.super_ = superCtor\n      ctor.prototype = Object.create(superCtor.prototype, {\n        constructor: {\n          value: ctor,\n          enumerable: false,\n          writable: true,\n          configurable: true\n        }\n      })\n    }\n  };\n} else {\n  // old school shim for old browsers\n  module.exports = function inherits(ctor, superCtor) {\n    if (superCtor) {\n      ctor.super_ = superCtor\n      var TempCtor = function () {}\n      TempCtor.prototype = superCtor.prototype\n      ctor.prototype = new TempCtor()\n      ctor.prototype.constructor = ctor\n    }\n  }\n}\n","'use strict';\n\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar utils = require('../utils');\n\nfunction MontCurve(conf) {\n  Base.call(this, 'mont', conf);\n\n  this.a = new BN(conf.a, 16).toRed(this.red);\n  this.b = new BN(conf.b, 16).toRed(this.red);\n  this.i4 = new BN(4).toRed(this.red).redInvm();\n  this.two = new BN(2).toRed(this.red);\n  this.a24 = this.i4.redMul(this.a.redAdd(this.two));\n}\ninherits(MontCurve, Base);\nmodule.exports = MontCurve;\n\nMontCurve.prototype.validate = function validate(point) {\n  var x = point.normalize().x;\n  var x2 = x.redSqr();\n  var rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x);\n  var y = rhs.redSqrt();\n\n  return y.redSqr().cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, z) {\n  Base.BasePoint.call(this, curve, 'projective');\n  if (x === null && z === null) {\n    this.x = this.curve.one;\n    this.z = this.curve.zero;\n  } else {\n    this.x = new BN(x, 16);\n    this.z = new BN(z, 16);\n    if (!this.x.red)\n      this.x = this.x.toRed(this.curve.red);\n    if (!this.z.red)\n      this.z = this.z.toRed(this.curve.red);\n  }\n}\ninherits(Point, Base.BasePoint);\n\nMontCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n  return this.point(utils.toArray(bytes, enc), 1);\n};\n\nMontCurve.prototype.point = function point(x, z) {\n  return new Point(this, x, z);\n};\n\nMontCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n  return Point.fromJSON(this, obj);\n};\n\nPoint.prototype.precompute = function precompute() {\n  // No-op\n};\n\nPoint.prototype._encode = function _encode() {\n  return this.getX().toArray('be', this.curve.p.byteLength());\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n  return new Point(curve, obj[0], obj[1] || curve.one);\n};\n\nPoint.prototype.inspect = function inspect() {\n  if (this.isInfinity())\n    return '<EC Point Infinity>';\n  return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +\n      ' z: ' + this.z.fromRed().toString(16, 2) + '>';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n  // XXX This code assumes that zero is always zero in red\n  return this.z.cmpn(0) === 0;\n};\n\nPoint.prototype.dbl = function dbl() {\n  // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3\n  // 2M + 2S + 4A\n\n  // A = X1 + Z1\n  var a = this.x.redAdd(this.z);\n  // AA = A^2\n  var aa = a.redSqr();\n  // B = X1 - Z1\n  var b = this.x.redSub(this.z);\n  // BB = B^2\n  var bb = b.redSqr();\n  // C = AA - BB\n  var c = aa.redSub(bb);\n  // X3 = AA * BB\n  var nx = aa.redMul(bb);\n  // Z3 = C * (BB + A24 * C)\n  var nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n  return this.curve.point(nx, nz);\n};\n\nPoint.prototype.add = function add() {\n  throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.diffAdd = function diffAdd(p, diff) {\n  // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#diffadd-dadd-1987-m-3\n  // 4M + 2S + 6A\n\n  // A = X2 + Z2\n  var a = this.x.redAdd(this.z);\n  // B = X2 - Z2\n  var b = this.x.redSub(this.z);\n  // C = X3 + Z3\n  var c = p.x.redAdd(p.z);\n  // D = X3 - Z3\n  var d = p.x.redSub(p.z);\n  // DA = D * A\n  var da = d.redMul(a);\n  // CB = C * B\n  var cb = c.redMul(b);\n  // X5 = Z1 * (DA + CB)^2\n  var nx = diff.z.redMul(da.redAdd(cb).redSqr());\n  // Z5 = X1 * (DA - CB)^2\n  var nz = diff.x.redMul(da.redISub(cb).redSqr());\n  return this.curve.point(nx, nz);\n};\n\nPoint.prototype.mul = function mul(k) {\n  var t = k.clone();\n  var a = this; // (N / 2) * Q + Q\n  var b = this.curve.point(null, null); // (N / 2) * Q\n  var c = this; // Q\n\n  for (var bits = []; t.cmpn(0) !== 0; t.iushrn(1))\n    bits.push(t.andln(1));\n\n  for (var i = bits.length - 1; i >= 0; i--) {\n    if (bits[i] === 0) {\n      // N * Q + Q = ((N / 2) * Q + Q)) + (N / 2) * Q\n      a = a.diffAdd(b, c);\n      // N * Q = 2 * ((N / 2) * Q + Q))\n      b = b.dbl();\n    } else {\n      // N * Q = ((N / 2) * Q + Q) + ((N / 2) * Q)\n      b = a.diffAdd(b, c);\n      // N * Q + Q = 2 * ((N / 2) * Q + Q)\n      a = a.dbl();\n    }\n  }\n  return b;\n};\n\nPoint.prototype.mulAdd = function mulAdd() {\n  throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.jumlAdd = function jumlAdd() {\n  throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.eq = function eq(other) {\n  return this.getX().cmp(other.getX()) === 0;\n};\n\nPoint.prototype.normalize = function normalize() {\n  this.x = this.x.redMul(this.z.redInvm());\n  this.z = this.curve.one;\n  return this;\n};\n\nPoint.prototype.getX = function getX() {\n  // Normalize coordinates\n  this.normalize();\n\n  return this.x.fromRed();\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction EdwardsCurve(conf) {\n  // NOTE: Important as we are creating point in Base.call()\n  this.twisted = (conf.a | 0) !== 1;\n  this.mOneA = this.twisted && (conf.a | 0) === -1;\n  this.extended = this.mOneA;\n\n  Base.call(this, 'edwards', conf);\n\n  this.a = new BN(conf.a, 16).umod(this.red.m);\n  this.a = this.a.toRed(this.red);\n  this.c = new BN(conf.c, 16).toRed(this.red);\n  this.c2 = this.c.redSqr();\n  this.d = new BN(conf.d, 16).toRed(this.red);\n  this.dd = this.d.redAdd(this.d);\n\n  assert(!this.twisted || this.c.fromRed().cmpn(1) === 0);\n  this.oneC = (conf.c | 0) === 1;\n}\ninherits(EdwardsCurve, Base);\nmodule.exports = EdwardsCurve;\n\nEdwardsCurve.prototype._mulA = function _mulA(num) {\n  if (this.mOneA)\n    return num.redNeg();\n  else\n    return this.a.redMul(num);\n};\n\nEdwardsCurve.prototype._mulC = function _mulC(num) {\n  if (this.oneC)\n    return num;\n  else\n    return this.c.redMul(num);\n};\n\n// Just for compatibility with Short curve\nEdwardsCurve.prototype.jpoint = function jpoint(x, y, z, t) {\n  return this.point(x, y, z, t);\n};\n\nEdwardsCurve.prototype.pointFromX = function pointFromX(x, odd) {\n  x = new BN(x, 16);\n  if (!x.red)\n    x = x.toRed(this.red);\n\n  var x2 = x.redSqr();\n  var rhs = this.c2.redSub(this.a.redMul(x2));\n  var lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2));\n\n  var y2 = rhs.redMul(lhs.redInvm());\n  var y = y2.redSqrt();\n  if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n    throw new Error('invalid point');\n\n  var isOdd = y.fromRed().isOdd();\n  if (odd && !isOdd || !odd && isOdd)\n    y = y.redNeg();\n\n  return this.point(x, y);\n};\n\nEdwardsCurve.prototype.pointFromY = function pointFromY(y, odd) {\n  y = new BN(y, 16);\n  if (!y.red)\n    y = y.toRed(this.red);\n\n  // x^2 = (y^2 - c^2) / (c^2 d y^2 - a)\n  var y2 = y.redSqr();\n  var lhs = y2.redSub(this.c2);\n  var rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a);\n  var x2 = lhs.redMul(rhs.redInvm());\n\n  if (x2.cmp(this.zero) === 0) {\n    if (odd)\n      throw new Error('invalid point');\n    else\n      return this.point(this.zero, y);\n  }\n\n  var x = x2.redSqrt();\n  if (x.redSqr().redSub(x2).cmp(this.zero) !== 0)\n    throw new Error('invalid point');\n\n  if (x.fromRed().isOdd() !== odd)\n    x = x.redNeg();\n\n  return this.point(x, y);\n};\n\nEdwardsCurve.prototype.validate = function validate(point) {\n  if (point.isInfinity())\n    return true;\n\n  // Curve: A * X^2 + Y^2 = C^2 * (1 + D * X^2 * Y^2)\n  point.normalize();\n\n  var x2 = point.x.redSqr();\n  var y2 = point.y.redSqr();\n  var lhs = x2.redMul(this.a).redAdd(y2);\n  var rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n\n  return lhs.cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, y, z, t) {\n  Base.BasePoint.call(this, curve, 'projective');\n  if (x === null && y === null && z === null) {\n    this.x = this.curve.zero;\n    this.y = this.curve.one;\n    this.z = this.curve.one;\n    this.t = this.curve.zero;\n    this.zOne = true;\n  } else {\n    this.x = new BN(x, 16);\n    this.y = new BN(y, 16);\n    this.z = z ? new BN(z, 16) : this.curve.one;\n    this.t = t && new BN(t, 16);\n    if (!this.x.red)\n      this.x = this.x.toRed(this.curve.red);\n    if (!this.y.red)\n      this.y = this.y.toRed(this.curve.red);\n    if (!this.z.red)\n      this.z = this.z.toRed(this.curve.red);\n    if (this.t && !this.t.red)\n      this.t = this.t.toRed(this.curve.red);\n    this.zOne = this.z === this.curve.one;\n\n    // Use extended coordinates\n    if (this.curve.extended && !this.t) {\n      this.t = this.x.redMul(this.y);\n      if (!this.zOne)\n        this.t = this.t.redMul(this.z.redInvm());\n    }\n  }\n}\ninherits(Point, Base.BasePoint);\n\nEdwardsCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n  return Point.fromJSON(this, obj);\n};\n\nEdwardsCurve.prototype.point = function point(x, y, z, t) {\n  return new Point(this, x, y, z, t);\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n  return new Point(curve, obj[0], obj[1], obj[2]);\n};\n\nPoint.prototype.inspect = function inspect() {\n  if (this.isInfinity())\n    return '<EC Point Infinity>';\n  return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +\n      ' y: ' + this.y.fromRed().toString(16, 2) +\n      ' z: ' + this.z.fromRed().toString(16, 2) + '>';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n  // XXX This code assumes that zero is always zero in red\n  return this.x.cmpn(0) === 0 &&\n    (this.y.cmp(this.z) === 0 ||\n    (this.zOne && this.y.cmp(this.curve.c) === 0));\n};\n\nPoint.prototype._extDbl = function _extDbl() {\n  // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n  //     #doubling-dbl-2008-hwcd\n  // 4M + 4S\n\n  // A = X1^2\n  var a = this.x.redSqr();\n  // B = Y1^2\n  var b = this.y.redSqr();\n  // C = 2 * Z1^2\n  var c = this.z.redSqr();\n  c = c.redIAdd(c);\n  // D = a * A\n  var d = this.curve._mulA(a);\n  // E = (X1 + Y1)^2 - A - B\n  var e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b);\n  // G = D + B\n  var g = d.redAdd(b);\n  // F = G - C\n  var f = g.redSub(c);\n  // H = D - B\n  var h = d.redSub(b);\n  // X3 = E * F\n  var nx = e.redMul(f);\n  // Y3 = G * H\n  var ny = g.redMul(h);\n  // T3 = E * H\n  var nt = e.redMul(h);\n  // Z3 = F * G\n  var nz = f.redMul(g);\n  return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projDbl = function _projDbl() {\n  // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n  //     #doubling-dbl-2008-bbjlp\n  //     #doubling-dbl-2007-bl\n  // and others\n  // Generally 3M + 4S or 2M + 4S\n\n  // B = (X1 + Y1)^2\n  var b = this.x.redAdd(this.y).redSqr();\n  // C = X1^2\n  var c = this.x.redSqr();\n  // D = Y1^2\n  var d = this.y.redSqr();\n\n  var nx;\n  var ny;\n  var nz;\n  var e;\n  var h;\n  var j;\n  if (this.curve.twisted) {\n    // E = a * C\n    e = this.curve._mulA(c);\n    // F = E + D\n    var f = e.redAdd(d);\n    if (this.zOne) {\n      // X3 = (B - C - D) * (F - 2)\n      nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two));\n      // Y3 = F * (E - D)\n      ny = f.redMul(e.redSub(d));\n      // Z3 = F^2 - 2 * F\n      nz = f.redSqr().redSub(f).redSub(f);\n    } else {\n      // H = Z1^2\n      h = this.z.redSqr();\n      // J = F - 2 * H\n      j = f.redSub(h).redISub(h);\n      // X3 = (B-C-D)*J\n      nx = b.redSub(c).redISub(d).redMul(j);\n      // Y3 = F * (E - D)\n      ny = f.redMul(e.redSub(d));\n      // Z3 = F * J\n      nz = f.redMul(j);\n    }\n  } else {\n    // E = C + D\n    e = c.redAdd(d);\n    // H = (c * Z1)^2\n    h = this.curve._mulC(this.z).redSqr();\n    // J = E - 2 * H\n    j = e.redSub(h).redSub(h);\n    // X3 = c * (B - E) * J\n    nx = this.curve._mulC(b.redISub(e)).redMul(j);\n    // Y3 = c * E * (C - D)\n    ny = this.curve._mulC(e).redMul(c.redISub(d));\n    // Z3 = E * J\n    nz = e.redMul(j);\n  }\n  return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.dbl = function dbl() {\n  if (this.isInfinity())\n    return this;\n\n  // Double in extended coordinates\n  if (this.curve.extended)\n    return this._extDbl();\n  else\n    return this._projDbl();\n};\n\nPoint.prototype._extAdd = function _extAdd(p) {\n  // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n  //     #addition-add-2008-hwcd-3\n  // 8M\n\n  // A = (Y1 - X1) * (Y2 - X2)\n  var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x));\n  // B = (Y1 + X1) * (Y2 + X2)\n  var b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x));\n  // C = T1 * k * T2\n  var c = this.t.redMul(this.curve.dd).redMul(p.t);\n  // D = Z1 * 2 * Z2\n  var d = this.z.redMul(p.z.redAdd(p.z));\n  // E = B - A\n  var e = b.redSub(a);\n  // F = D - C\n  var f = d.redSub(c);\n  // G = D + C\n  var g = d.redAdd(c);\n  // H = B + A\n  var h = b.redAdd(a);\n  // X3 = E * F\n  var nx = e.redMul(f);\n  // Y3 = G * H\n  var ny = g.redMul(h);\n  // T3 = E * H\n  var nt = e.redMul(h);\n  // Z3 = F * G\n  var nz = f.redMul(g);\n  return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projAdd = function _projAdd(p) {\n  // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n  //     #addition-add-2008-bbjlp\n  //     #addition-add-2007-bl\n  // 10M + 1S\n\n  // A = Z1 * Z2\n  var a = this.z.redMul(p.z);\n  // B = A^2\n  var b = a.redSqr();\n  // C = X1 * X2\n  var c = this.x.redMul(p.x);\n  // D = Y1 * Y2\n  var d = this.y.redMul(p.y);\n  // E = d * C * D\n  var e = this.curve.d.redMul(c).redMul(d);\n  // F = B - E\n  var f = b.redSub(e);\n  // G = B + E\n  var g = b.redAdd(e);\n  // X3 = A * F * ((X1 + Y1) * (X2 + Y2) - C - D)\n  var tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d);\n  var nx = a.redMul(f).redMul(tmp);\n  var ny;\n  var nz;\n  if (this.curve.twisted) {\n    // Y3 = A * G * (D - a * C)\n    ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)));\n    // Z3 = F * G\n    nz = f.redMul(g);\n  } else {\n    // Y3 = A * G * (D - C)\n    ny = a.redMul(g).redMul(d.redSub(c));\n    // Z3 = c * F * G\n    nz = this.curve._mulC(f).redMul(g);\n  }\n  return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.add = function add(p) {\n  if (this.isInfinity())\n    return p;\n  if (p.isInfinity())\n    return this;\n\n  if (this.curve.extended)\n    return this._extAdd(p);\n  else\n    return this._projAdd(p);\n};\n\nPoint.prototype.mul = function mul(k) {\n  if (this._hasDoubles(k))\n    return this.curve._fixedNafMul(this, k);\n  else\n    return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p, k2) {\n  return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, false);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p, k2) {\n  return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, true);\n};\n\nPoint.prototype.normalize = function normalize() {\n  if (this.zOne)\n    return this;\n\n  // Normalize coordinates\n  var zi = this.z.redInvm();\n  this.x = this.x.redMul(zi);\n  this.y = this.y.redMul(zi);\n  if (this.t)\n    this.t = this.t.redMul(zi);\n  this.z = this.curve.one;\n  this.zOne = true;\n  return this;\n};\n\nPoint.prototype.neg = function neg() {\n  return this.curve.point(this.x.redNeg(),\n    this.y,\n    this.z,\n    this.t && this.t.redNeg());\n};\n\nPoint.prototype.getX = function getX() {\n  this.normalize();\n  return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n  this.normalize();\n  return this.y.fromRed();\n};\n\nPoint.prototype.eq = function eq(other) {\n  return this === other ||\n         this.getX().cmp(other.getX()) === 0 &&\n         this.getY().cmp(other.getY()) === 0;\n};\n\nPoint.prototype.eqXToP = function eqXToP(x) {\n  var rx = x.toRed(this.curve.red).redMul(this.z);\n  if (this.x.cmp(rx) === 0)\n    return true;\n\n  var xc = x.clone();\n  var t = this.curve.redN.redMul(this.z);\n  for (;;) {\n    xc.iadd(this.curve.n);\n    if (xc.cmp(this.curve.p) >= 0)\n      return false;\n\n    rx.redIAdd(t);\n    if (this.x.cmp(rx) === 0)\n      return true;\n  }\n};\n\n// Compatibility with BaseCurve\nPoint.prototype.toP = Point.prototype.normalize;\nPoint.prototype.mixedAdd = Point.prototype.add;\n","'use strict';\n\nvar curves = exports;\n\nvar hash = require('hash.js');\nvar curve = require('./curve');\nvar utils = require('./utils');\n\nvar assert = utils.assert;\n\nfunction PresetCurve(options) {\n  if (options.type === 'short')\n    this.curve = new curve.short(options);\n  else if (options.type === 'edwards')\n    this.curve = new curve.edwards(options);\n  else\n    this.curve = new curve.mont(options);\n  this.g = this.curve.g;\n  this.n = this.curve.n;\n  this.hash = options.hash;\n\n  assert(this.g.validate(), 'Invalid curve');\n  assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O');\n}\ncurves.PresetCurve = PresetCurve;\n\nfunction defineCurve(name, options) {\n  Object.defineProperty(curves, name, {\n    configurable: true,\n    enumerable: true,\n    get: function() {\n      var curve = new PresetCurve(options);\n      Object.defineProperty(curves, name, {\n        configurable: true,\n        enumerable: true,\n        value: curve,\n      });\n      return curve;\n    },\n  });\n}\n\ndefineCurve('p192', {\n  type: 'short',\n  prime: 'p192',\n  p: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff',\n  a: 'ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc',\n  b: '64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1',\n  n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831',\n  hash: hash.sha256,\n  gRed: false,\n  g: [\n    '188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012',\n    '07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811',\n  ],\n});\n\ndefineCurve('p224', {\n  type: 'short',\n  prime: 'p224',\n  p: 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001',\n  a: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe',\n  b: 'b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4',\n  n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d',\n  hash: hash.sha256,\n  gRed: false,\n  g: [\n    'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21',\n    'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34',\n  ],\n});\n\ndefineCurve('p256', {\n  type: 'short',\n  prime: null,\n  p: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff',\n  a: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc',\n  b: '5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b',\n  n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551',\n  hash: hash.sha256,\n  gRed: false,\n  g: [\n    '6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296',\n    '4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5',\n  ],\n});\n\ndefineCurve('p384', {\n  type: 'short',\n  prime: null,\n  p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n     'fffffffe ffffffff 00000000 00000000 ffffffff',\n  a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n     'fffffffe ffffffff 00000000 00000000 fffffffc',\n  b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' +\n     '5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef',\n  n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' +\n     'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973',\n  hash: hash.sha384,\n  gRed: false,\n  g: [\n    'aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 ' +\n    '5502f25d bf55296c 3a545e38 72760ab7',\n    '3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 ' +\n    '0a60b1ce 1d7e819d 7a431d7c 90ea0e5f',\n  ],\n});\n\ndefineCurve('p521', {\n  type: 'short',\n  prime: null,\n  p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n     'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n     'ffffffff ffffffff ffffffff ffffffff ffffffff',\n  a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n     'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n     'ffffffff ffffffff ffffffff ffffffff fffffffc',\n  b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' +\n     '99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' +\n     '3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00',\n  n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n     'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' +\n     'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409',\n  hash: hash.sha512,\n  gRed: false,\n  g: [\n    '000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 ' +\n    '053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 ' +\n    'a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66',\n    '00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 ' +\n    '579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 ' +\n    '3fad0761 353c7086 a272c240 88be9476 9fd16650',\n  ],\n});\n\ndefineCurve('curve25519', {\n  type: 'mont',\n  prime: 'p25519',\n  p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',\n  a: '76d06',\n  b: '1',\n  n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',\n  hash: hash.sha256,\n  gRed: false,\n  g: [\n    '9',\n  ],\n});\n\ndefineCurve('ed25519', {\n  type: 'edwards',\n  prime: 'p25519',\n  p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',\n  a: '-1',\n  c: '1',\n  // -121665 * (121666^(-1)) (mod P)\n  d: '52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3',\n  n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',\n  hash: hash.sha256,\n  gRed: false,\n  g: [\n    '216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a',\n\n    // 4/5\n    '6666666666666666666666666666666666666666666666666666666666666658',\n  ],\n});\n\nvar pre;\ntry {\n  pre = require('./precomputed/secp256k1');\n} catch (e) {\n  pre = undefined;\n}\n\ndefineCurve('secp256k1', {\n  type: 'short',\n  prime: 'k256',\n  p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f',\n  a: '0',\n  b: '7',\n  n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141',\n  h: '1',\n  hash: hash.sha256,\n\n  // Precomputed endomorphism\n  beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee',\n  lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72',\n  basis: [\n    {\n      a: '3086d221a7d46bcde86c90e49284eb15',\n      b: '-e4437ed6010e88286f547fa90abfe4c3',\n    },\n    {\n      a: '114ca50f7a8e2f3f657c1108d9d44cfd8',\n      b: '3086d221a7d46bcde86c90e49284eb15',\n    },\n  ],\n\n  gRed: false,\n  g: [\n    '79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798',\n    '483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8',\n    pre,\n  ],\n});\n","var hash = exports;\n\nhash.utils = require('./hash/utils');\nhash.common = require('./hash/common');\nhash.sha = require('./hash/sha');\nhash.ripemd = require('./hash/ripemd');\nhash.hmac = require('./hash/hmac');\n\n// Proxy hash functions to the main object\nhash.sha1 = hash.sha.sha1;\nhash.sha256 = hash.sha.sha256;\nhash.sha224 = hash.sha.sha224;\nhash.sha384 = hash.sha.sha384;\nhash.sha512 = hash.sha.sha512;\nhash.ripemd160 = hash.ripemd.ripemd160;\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nexports.inherits = inherits;\n\nfunction isSurrogatePair(msg, i) {\n  if ((msg.charCodeAt(i) & 0xFC00) !== 0xD800) {\n    return false;\n  }\n  if (i < 0 || i + 1 >= msg.length) {\n    return false;\n  }\n  return (msg.charCodeAt(i + 1) & 0xFC00) === 0xDC00;\n}\n\nfunction toArray(msg, enc) {\n  if (Array.isArray(msg))\n    return msg.slice();\n  if (!msg)\n    return [];\n  var res = [];\n  if (typeof msg === 'string') {\n    if (!enc) {\n      // Inspired by stringToUtf8ByteArray() in closure-library by Google\n      // https://github.com/google/closure-library/blob/8598d87242af59aac233270742c8984e2b2bdbe0/closure/goog/crypt/crypt.js#L117-L143\n      // Apache License 2.0\n      // https://github.com/google/closure-library/blob/master/LICENSE\n      var p = 0;\n      for (var i = 0; i < msg.length; i++) {\n        var c = msg.charCodeAt(i);\n        if (c < 128) {\n          res[p++] = c;\n        } else if (c < 2048) {\n          res[p++] = (c >> 6) | 192;\n          res[p++] = (c & 63) | 128;\n        } else if (isSurrogatePair(msg, i)) {\n          c = 0x10000 + ((c & 0x03FF) << 10) + (msg.charCodeAt(++i) & 0x03FF);\n          res[p++] = (c >> 18) | 240;\n          res[p++] = ((c >> 12) & 63) | 128;\n          res[p++] = ((c >> 6) & 63) | 128;\n          res[p++] = (c & 63) | 128;\n        } else {\n          res[p++] = (c >> 12) | 224;\n          res[p++] = ((c >> 6) & 63) | 128;\n          res[p++] = (c & 63) | 128;\n        }\n      }\n    } else if (enc === 'hex') {\n      msg = msg.replace(/[^a-z0-9]+/ig, '');\n      if (msg.length % 2 !== 0)\n        msg = '0' + msg;\n      for (i = 0; i < msg.length; i += 2)\n        res.push(parseInt(msg[i] + msg[i + 1], 16));\n    }\n  } else {\n    for (i = 0; i < msg.length; i++)\n      res[i] = msg[i] | 0;\n  }\n  return res;\n}\nexports.toArray = toArray;\n\nfunction toHex(msg) {\n  var res = '';\n  for (var i = 0; i < msg.length; i++)\n    res += zero2(msg[i].toString(16));\n  return res;\n}\nexports.toHex = toHex;\n\nfunction htonl(w) {\n  var res = (w >>> 24) |\n            ((w >>> 8) & 0xff00) |\n            ((w << 8) & 0xff0000) |\n            ((w & 0xff) << 24);\n  return res >>> 0;\n}\nexports.htonl = htonl;\n\nfunction toHex32(msg, endian) {\n  var res = '';\n  for (var i = 0; i < msg.length; i++) {\n    var w = msg[i];\n    if (endian === 'little')\n      w = htonl(w);\n    res += zero8(w.toString(16));\n  }\n  return res;\n}\nexports.toHex32 = toHex32;\n\nfunction zero2(word) {\n  if (word.length === 1)\n    return '0' + word;\n  else\n    return word;\n}\nexports.zero2 = zero2;\n\nfunction zero8(word) {\n  if (word.length === 7)\n    return '0' + word;\n  else if (word.length === 6)\n    return '00' + word;\n  else if (word.length === 5)\n    return '000' + word;\n  else if (word.length === 4)\n    return '0000' + word;\n  else if (word.length === 3)\n    return '00000' + word;\n  else if (word.length === 2)\n    return '000000' + word;\n  else if (word.length === 1)\n    return '0000000' + word;\n  else\n    return word;\n}\nexports.zero8 = zero8;\n\nfunction join32(msg, start, end, endian) {\n  var len = end - start;\n  assert(len % 4 === 0);\n  var res = new Array(len / 4);\n  for (var i = 0, k = start; i < res.length; i++, k += 4) {\n    var w;\n    if (endian === 'big')\n      w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3];\n    else\n      w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k];\n    res[i] = w >>> 0;\n  }\n  return res;\n}\nexports.join32 = join32;\n\nfunction split32(msg, endian) {\n  var res = new Array(msg.length * 4);\n  for (var i = 0, k = 0; i < msg.length; i++, k += 4) {\n    var m = msg[i];\n    if (endian === 'big') {\n      res[k] = m >>> 24;\n      res[k + 1] = (m >>> 16) & 0xff;\n      res[k + 2] = (m >>> 8) & 0xff;\n      res[k + 3] = m & 0xff;\n    } else {\n      res[k + 3] = m >>> 24;\n      res[k + 2] = (m >>> 16) & 0xff;\n      res[k + 1] = (m >>> 8) & 0xff;\n      res[k] = m & 0xff;\n    }\n  }\n  return res;\n}\nexports.split32 = split32;\n\nfunction rotr32(w, b) {\n  return (w >>> b) | (w << (32 - b));\n}\nexports.rotr32 = rotr32;\n\nfunction rotl32(w, b) {\n  return (w << b) | (w >>> (32 - b));\n}\nexports.rotl32 = rotl32;\n\nfunction sum32(a, b) {\n  return (a + b) >>> 0;\n}\nexports.sum32 = sum32;\n\nfunction sum32_3(a, b, c) {\n  return (a + b + c) >>> 0;\n}\nexports.sum32_3 = sum32_3;\n\nfunction sum32_4(a, b, c, d) {\n  return (a + b + c + d) >>> 0;\n}\nexports.sum32_4 = sum32_4;\n\nfunction sum32_5(a, b, c, d, e) {\n  return (a + b + c + d + e) >>> 0;\n}\nexports.sum32_5 = sum32_5;\n\nfunction sum64(buf, pos, ah, al) {\n  var bh = buf[pos];\n  var bl = buf[pos + 1];\n\n  var lo = (al + bl) >>> 0;\n  var hi = (lo < al ? 1 : 0) + ah + bh;\n  buf[pos] = hi >>> 0;\n  buf[pos + 1] = lo;\n}\nexports.sum64 = sum64;\n\nfunction sum64_hi(ah, al, bh, bl) {\n  var lo = (al + bl) >>> 0;\n  var hi = (lo < al ? 1 : 0) + ah + bh;\n  return hi >>> 0;\n}\nexports.sum64_hi = sum64_hi;\n\nfunction sum64_lo(ah, al, bh, bl) {\n  var lo = al + bl;\n  return lo >>> 0;\n}\nexports.sum64_lo = sum64_lo;\n\nfunction sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n  var carry = 0;\n  var lo = al;\n  lo = (lo + bl) >>> 0;\n  carry += lo < al ? 1 : 0;\n  lo = (lo + cl) >>> 0;\n  carry += lo < cl ? 1 : 0;\n  lo = (lo + dl) >>> 0;\n  carry += lo < dl ? 1 : 0;\n\n  var hi = ah + bh + ch + dh + carry;\n  return hi >>> 0;\n}\nexports.sum64_4_hi = sum64_4_hi;\n\nfunction sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n  var lo = al + bl + cl + dl;\n  return lo >>> 0;\n}\nexports.sum64_4_lo = sum64_4_lo;\n\nfunction sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n  var carry = 0;\n  var lo = al;\n  lo = (lo + bl) >>> 0;\n  carry += lo < al ? 1 : 0;\n  lo = (lo + cl) >>> 0;\n  carry += lo < cl ? 1 : 0;\n  lo = (lo + dl) >>> 0;\n  carry += lo < dl ? 1 : 0;\n  lo = (lo + el) >>> 0;\n  carry += lo < el ? 1 : 0;\n\n  var hi = ah + bh + ch + dh + eh + carry;\n  return hi >>> 0;\n}\nexports.sum64_5_hi = sum64_5_hi;\n\nfunction sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n  var lo = al + bl + cl + dl + el;\n\n  return lo >>> 0;\n}\nexports.sum64_5_lo = sum64_5_lo;\n\nfunction rotr64_hi(ah, al, num) {\n  var r = (al << (32 - num)) | (ah >>> num);\n  return r >>> 0;\n}\nexports.rotr64_hi = rotr64_hi;\n\nfunction rotr64_lo(ah, al, num) {\n  var r = (ah << (32 - num)) | (al >>> num);\n  return r >>> 0;\n}\nexports.rotr64_lo = rotr64_lo;\n\nfunction shr64_hi(ah, al, num) {\n  return ah >>> num;\n}\nexports.shr64_hi = shr64_hi;\n\nfunction shr64_lo(ah, al, num) {\n  var r = (ah << (32 - num)) | (al >>> num);\n  return r >>> 0;\n}\nexports.shr64_lo = shr64_lo;\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction BlockHash() {\n  this.pending = null;\n  this.pendingTotal = 0;\n  this.blockSize = this.constructor.blockSize;\n  this.outSize = this.constructor.outSize;\n  this.hmacStrength = this.constructor.hmacStrength;\n  this.padLength = this.constructor.padLength / 8;\n  this.endian = 'big';\n\n  this._delta8 = this.blockSize / 8;\n  this._delta32 = this.blockSize / 32;\n}\nexports.BlockHash = BlockHash;\n\nBlockHash.prototype.update = function update(msg, enc) {\n  // Convert message to array, pad it, and join into 32bit blocks\n  msg = utils.toArray(msg, enc);\n  if (!this.pending)\n    this.pending = msg;\n  else\n    this.pending = this.pending.concat(msg);\n  this.pendingTotal += msg.length;\n\n  // Enough data, try updating\n  if (this.pending.length >= this._delta8) {\n    msg = this.pending;\n\n    // Process pending data in blocks\n    var r = msg.length % this._delta8;\n    this.pending = msg.slice(msg.length - r, msg.length);\n    if (this.pending.length === 0)\n      this.pending = null;\n\n    msg = utils.join32(msg, 0, msg.length - r, this.endian);\n    for (var i = 0; i < msg.length; i += this._delta32)\n      this._update(msg, i, i + this._delta32);\n  }\n\n  return this;\n};\n\nBlockHash.prototype.digest = function digest(enc) {\n  this.update(this._pad());\n  assert(this.pending === null);\n\n  return this._digest(enc);\n};\n\nBlockHash.prototype._pad = function pad() {\n  var len = this.pendingTotal;\n  var bytes = this._delta8;\n  var k = bytes - ((len + this.padLength) % bytes);\n  var res = new Array(k + this.padLength);\n  res[0] = 0x80;\n  for (var i = 1; i < k; i++)\n    res[i] = 0;\n\n  // Append length\n  len <<= 3;\n  if (this.endian === 'big') {\n    for (var t = 8; t < this.padLength; t++)\n      res[i++] = 0;\n\n    res[i++] = 0;\n    res[i++] = 0;\n    res[i++] = 0;\n    res[i++] = 0;\n    res[i++] = (len >>> 24) & 0xff;\n    res[i++] = (len >>> 16) & 0xff;\n    res[i++] = (len >>> 8) & 0xff;\n    res[i++] = len & 0xff;\n  } else {\n    res[i++] = len & 0xff;\n    res[i++] = (len >>> 8) & 0xff;\n    res[i++] = (len >>> 16) & 0xff;\n    res[i++] = (len >>> 24) & 0xff;\n    res[i++] = 0;\n    res[i++] = 0;\n    res[i++] = 0;\n    res[i++] = 0;\n\n    for (t = 8; t < this.padLength; t++)\n      res[i++] = 0;\n  }\n\n  return res;\n};\n","'use strict';\n\nexports.sha1 = require('./sha/1');\nexports.sha224 = require('./sha/224');\nexports.sha256 = require('./sha/256');\nexports.sha384 = require('./sha/384');\nexports.sha512 = require('./sha/512');\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_5 = utils.sum32_5;\nvar ft_1 = shaCommon.ft_1;\nvar BlockHash = common.BlockHash;\n\nvar sha1_K = [\n  0x5A827999, 0x6ED9EBA1,\n  0x8F1BBCDC, 0xCA62C1D6\n];\n\nfunction SHA1() {\n  if (!(this instanceof SHA1))\n    return new SHA1();\n\n  BlockHash.call(this);\n  this.h = [\n    0x67452301, 0xefcdab89, 0x98badcfe,\n    0x10325476, 0xc3d2e1f0 ];\n  this.W = new Array(80);\n}\n\nutils.inherits(SHA1, BlockHash);\nmodule.exports = SHA1;\n\nSHA1.blockSize = 512;\nSHA1.outSize = 160;\nSHA1.hmacStrength = 80;\nSHA1.padLength = 64;\n\nSHA1.prototype._update = function _update(msg, start) {\n  var W = this.W;\n\n  for (var i = 0; i < 16; i++)\n    W[i] = msg[start + i];\n\n  for(; i < W.length; i++)\n    W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n\n  var a = this.h[0];\n  var b = this.h[1];\n  var c = this.h[2];\n  var d = this.h[3];\n  var e = this.h[4];\n\n  for (i = 0; i < W.length; i++) {\n    var s = ~~(i / 20);\n    var t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n    e = d;\n    d = c;\n    c = rotl32(b, 30);\n    b = a;\n    a = t;\n  }\n\n  this.h[0] = sum32(this.h[0], a);\n  this.h[1] = sum32(this.h[1], b);\n  this.h[2] = sum32(this.h[2], c);\n  this.h[3] = sum32(this.h[3], d);\n  this.h[4] = sum32(this.h[4], e);\n};\n\nSHA1.prototype._digest = function digest(enc) {\n  if (enc === 'hex')\n    return utils.toHex32(this.h, 'big');\n  else\n    return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar rotr32 = utils.rotr32;\n\nfunction ft_1(s, x, y, z) {\n  if (s === 0)\n    return ch32(x, y, z);\n  if (s === 1 || s === 3)\n    return p32(x, y, z);\n  if (s === 2)\n    return maj32(x, y, z);\n}\nexports.ft_1 = ft_1;\n\nfunction ch32(x, y, z) {\n  return (x & y) ^ ((~x) & z);\n}\nexports.ch32 = ch32;\n\nfunction maj32(x, y, z) {\n  return (x & y) ^ (x & z) ^ (y & z);\n}\nexports.maj32 = maj32;\n\nfunction p32(x, y, z) {\n  return x ^ y ^ z;\n}\nexports.p32 = p32;\n\nfunction s0_256(x) {\n  return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n}\nexports.s0_256 = s0_256;\n\nfunction s1_256(x) {\n  return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n}\nexports.s1_256 = s1_256;\n\nfunction g0_256(x) {\n  return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n}\nexports.g0_256 = g0_256;\n\nfunction g1_256(x) {\n  return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n}\nexports.g1_256 = g1_256;\n","'use strict';\n\nvar utils = require('../utils');\nvar SHA256 = require('./256');\n\nfunction SHA224() {\n  if (!(this instanceof SHA224))\n    return new SHA224();\n\n  SHA256.call(this);\n  this.h = [\n    0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,\n    0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ];\n}\nutils.inherits(SHA224, SHA256);\nmodule.exports = SHA224;\n\nSHA224.blockSize = 512;\nSHA224.outSize = 224;\nSHA224.hmacStrength = 192;\nSHA224.padLength = 64;\n\nSHA224.prototype._digest = function digest(enc) {\n  // Just truncate output\n  if (enc === 'hex')\n    return utils.toHex32(this.h.slice(0, 7), 'big');\n  else\n    return utils.split32(this.h.slice(0, 7), 'big');\n};\n\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\nvar assert = require('minimalistic-assert');\n\nvar sum32 = utils.sum32;\nvar sum32_4 = utils.sum32_4;\nvar sum32_5 = utils.sum32_5;\nvar ch32 = shaCommon.ch32;\nvar maj32 = shaCommon.maj32;\nvar s0_256 = shaCommon.s0_256;\nvar s1_256 = shaCommon.s1_256;\nvar g0_256 = shaCommon.g0_256;\nvar g1_256 = shaCommon.g1_256;\n\nvar BlockHash = common.BlockHash;\n\nvar sha256_K = [\n  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,\n  0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n  0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,\n  0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,\n  0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n  0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,\n  0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,\n  0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n  0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n];\n\nfunction SHA256() {\n  if (!(this instanceof SHA256))\n    return new SHA256();\n\n  BlockHash.call(this);\n  this.h = [\n    0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,\n    0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n  ];\n  this.k = sha256_K;\n  this.W = new Array(64);\n}\nutils.inherits(SHA256, BlockHash);\nmodule.exports = SHA256;\n\nSHA256.blockSize = 512;\nSHA256.outSize = 256;\nSHA256.hmacStrength = 192;\nSHA256.padLength = 64;\n\nSHA256.prototype._update = function _update(msg, start) {\n  var W = this.W;\n\n  for (var i = 0; i < 16; i++)\n    W[i] = msg[start + i];\n  for (; i < W.length; i++)\n    W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n\n  var a = this.h[0];\n  var b = this.h[1];\n  var c = this.h[2];\n  var d = this.h[3];\n  var e = this.h[4];\n  var f = this.h[5];\n  var g = this.h[6];\n  var h = this.h[7];\n\n  assert(this.k.length === W.length);\n  for (i = 0; i < W.length; i++) {\n    var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]);\n    var T2 = sum32(s0_256(a), maj32(a, b, c));\n    h = g;\n    g = f;\n    f = e;\n    e = sum32(d, T1);\n    d = c;\n    c = b;\n    b = a;\n    a = sum32(T1, T2);\n  }\n\n  this.h[0] = sum32(this.h[0], a);\n  this.h[1] = sum32(this.h[1], b);\n  this.h[2] = sum32(this.h[2], c);\n  this.h[3] = sum32(this.h[3], d);\n  this.h[4] = sum32(this.h[4], e);\n  this.h[5] = sum32(this.h[5], f);\n  this.h[6] = sum32(this.h[6], g);\n  this.h[7] = sum32(this.h[7], h);\n};\n\nSHA256.prototype._digest = function digest(enc) {\n  if (enc === 'hex')\n    return utils.toHex32(this.h, 'big');\n  else\n    return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\n\nvar SHA512 = require('./512');\n\nfunction SHA384() {\n  if (!(this instanceof SHA384))\n    return new SHA384();\n\n  SHA512.call(this);\n  this.h = [\n    0xcbbb9d5d, 0xc1059ed8,\n    0x629a292a, 0x367cd507,\n    0x9159015a, 0x3070dd17,\n    0x152fecd8, 0xf70e5939,\n    0x67332667, 0xffc00b31,\n    0x8eb44a87, 0x68581511,\n    0xdb0c2e0d, 0x64f98fa7,\n    0x47b5481d, 0xbefa4fa4 ];\n}\nutils.inherits(SHA384, SHA512);\nmodule.exports = SHA384;\n\nSHA384.blockSize = 1024;\nSHA384.outSize = 384;\nSHA384.hmacStrength = 192;\nSHA384.padLength = 128;\n\nSHA384.prototype._digest = function digest(enc) {\n  if (enc === 'hex')\n    return utils.toHex32(this.h.slice(0, 12), 'big');\n  else\n    return utils.split32(this.h.slice(0, 12), 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar assert = require('minimalistic-assert');\n\nvar rotr64_hi = utils.rotr64_hi;\nvar rotr64_lo = utils.rotr64_lo;\nvar shr64_hi = utils.shr64_hi;\nvar shr64_lo = utils.shr64_lo;\nvar sum64 = utils.sum64;\nvar sum64_hi = utils.sum64_hi;\nvar sum64_lo = utils.sum64_lo;\nvar sum64_4_hi = utils.sum64_4_hi;\nvar sum64_4_lo = utils.sum64_4_lo;\nvar sum64_5_hi = utils.sum64_5_hi;\nvar sum64_5_lo = utils.sum64_5_lo;\n\nvar BlockHash = common.BlockHash;\n\nvar sha512_K = [\n  0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n  0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n  0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n  0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n  0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n  0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n  0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n  0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n  0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n  0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n  0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n  0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n  0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n  0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n  0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n  0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n  0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n  0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n  0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n  0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n  0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n  0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n  0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n  0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n  0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n  0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n  0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n  0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n  0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n  0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n  0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n  0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n  0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n  0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n  0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n  0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n  0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n  0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n  0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n  0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n];\n\nfunction SHA512() {\n  if (!(this instanceof SHA512))\n    return new SHA512();\n\n  BlockHash.call(this);\n  this.h = [\n    0x6a09e667, 0xf3bcc908,\n    0xbb67ae85, 0x84caa73b,\n    0x3c6ef372, 0xfe94f82b,\n    0xa54ff53a, 0x5f1d36f1,\n    0x510e527f, 0xade682d1,\n    0x9b05688c, 0x2b3e6c1f,\n    0x1f83d9ab, 0xfb41bd6b,\n    0x5be0cd19, 0x137e2179 ];\n  this.k = sha512_K;\n  this.W = new Array(160);\n}\nutils.inherits(SHA512, BlockHash);\nmodule.exports = SHA512;\n\nSHA512.blockSize = 1024;\nSHA512.outSize = 512;\nSHA512.hmacStrength = 192;\nSHA512.padLength = 128;\n\nSHA512.prototype._prepareBlock = function _prepareBlock(msg, start) {\n  var W = this.W;\n\n  // 32 x 32bit words\n  for (var i = 0; i < 32; i++)\n    W[i] = msg[start + i];\n  for (; i < W.length; i += 2) {\n    var c0_hi = g1_512_hi(W[i - 4], W[i - 3]);  // i - 2\n    var c0_lo = g1_512_lo(W[i - 4], W[i - 3]);\n    var c1_hi = W[i - 14];  // i - 7\n    var c1_lo = W[i - 13];\n    var c2_hi = g0_512_hi(W[i - 30], W[i - 29]);  // i - 15\n    var c2_lo = g0_512_lo(W[i - 30], W[i - 29]);\n    var c3_hi = W[i - 32];  // i - 16\n    var c3_lo = W[i - 31];\n\n    W[i] = sum64_4_hi(\n      c0_hi, c0_lo,\n      c1_hi, c1_lo,\n      c2_hi, c2_lo,\n      c3_hi, c3_lo);\n    W[i + 1] = sum64_4_lo(\n      c0_hi, c0_lo,\n      c1_hi, c1_lo,\n      c2_hi, c2_lo,\n      c3_hi, c3_lo);\n  }\n};\n\nSHA512.prototype._update = function _update(msg, start) {\n  this._prepareBlock(msg, start);\n\n  var W = this.W;\n\n  var ah = this.h[0];\n  var al = this.h[1];\n  var bh = this.h[2];\n  var bl = this.h[3];\n  var ch = this.h[4];\n  var cl = this.h[5];\n  var dh = this.h[6];\n  var dl = this.h[7];\n  var eh = this.h[8];\n  var el = this.h[9];\n  var fh = this.h[10];\n  var fl = this.h[11];\n  var gh = this.h[12];\n  var gl = this.h[13];\n  var hh = this.h[14];\n  var hl = this.h[15];\n\n  assert(this.k.length === W.length);\n  for (var i = 0; i < W.length; i += 2) {\n    var c0_hi = hh;\n    var c0_lo = hl;\n    var c1_hi = s1_512_hi(eh, el);\n    var c1_lo = s1_512_lo(eh, el);\n    var c2_hi = ch64_hi(eh, el, fh, fl, gh, gl);\n    var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl);\n    var c3_hi = this.k[i];\n    var c3_lo = this.k[i + 1];\n    var c4_hi = W[i];\n    var c4_lo = W[i + 1];\n\n    var T1_hi = sum64_5_hi(\n      c0_hi, c0_lo,\n      c1_hi, c1_lo,\n      c2_hi, c2_lo,\n      c3_hi, c3_lo,\n      c4_hi, c4_lo);\n    var T1_lo = sum64_5_lo(\n      c0_hi, c0_lo,\n      c1_hi, c1_lo,\n      c2_hi, c2_lo,\n      c3_hi, c3_lo,\n      c4_hi, c4_lo);\n\n    c0_hi = s0_512_hi(ah, al);\n    c0_lo = s0_512_lo(ah, al);\n    c1_hi = maj64_hi(ah, al, bh, bl, ch, cl);\n    c1_lo = maj64_lo(ah, al, bh, bl, ch, cl);\n\n    var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo);\n    var T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n\n    hh = gh;\n    hl = gl;\n\n    gh = fh;\n    gl = fl;\n\n    fh = eh;\n    fl = el;\n\n    eh = sum64_hi(dh, dl, T1_hi, T1_lo);\n    el = sum64_lo(dl, dl, T1_hi, T1_lo);\n\n    dh = ch;\n    dl = cl;\n\n    ch = bh;\n    cl = bl;\n\n    bh = ah;\n    bl = al;\n\n    ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo);\n    al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo);\n  }\n\n  sum64(this.h, 0, ah, al);\n  sum64(this.h, 2, bh, bl);\n  sum64(this.h, 4, ch, cl);\n  sum64(this.h, 6, dh, dl);\n  sum64(this.h, 8, eh, el);\n  sum64(this.h, 10, fh, fl);\n  sum64(this.h, 12, gh, gl);\n  sum64(this.h, 14, hh, hl);\n};\n\nSHA512.prototype._digest = function digest(enc) {\n  if (enc === 'hex')\n    return utils.toHex32(this.h, 'big');\n  else\n    return utils.split32(this.h, 'big');\n};\n\nfunction ch64_hi(xh, xl, yh, yl, zh) {\n  var r = (xh & yh) ^ ((~xh) & zh);\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n\nfunction ch64_lo(xh, xl, yh, yl, zh, zl) {\n  var r = (xl & yl) ^ ((~xl) & zl);\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n\nfunction maj64_hi(xh, xl, yh, yl, zh) {\n  var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n\nfunction maj64_lo(xh, xl, yh, yl, zh, zl) {\n  var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n\nfunction s0_512_hi(xh, xl) {\n  var c0_hi = rotr64_hi(xh, xl, 28);\n  var c1_hi = rotr64_hi(xl, xh, 2);  // 34\n  var c2_hi = rotr64_hi(xl, xh, 7);  // 39\n\n  var r = c0_hi ^ c1_hi ^ c2_hi;\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n\nfunction s0_512_lo(xh, xl) {\n  var c0_lo = rotr64_lo(xh, xl, 28);\n  var c1_lo = rotr64_lo(xl, xh, 2);  // 34\n  var c2_lo = rotr64_lo(xl, xh, 7);  // 39\n\n  var r = c0_lo ^ c1_lo ^ c2_lo;\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n\nfunction s1_512_hi(xh, xl) {\n  var c0_hi = rotr64_hi(xh, xl, 14);\n  var c1_hi = rotr64_hi(xh, xl, 18);\n  var c2_hi = rotr64_hi(xl, xh, 9);  // 41\n\n  var r = c0_hi ^ c1_hi ^ c2_hi;\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n\nfunction s1_512_lo(xh, xl) {\n  var c0_lo = rotr64_lo(xh, xl, 14);\n  var c1_lo = rotr64_lo(xh, xl, 18);\n  var c2_lo = rotr64_lo(xl, xh, 9);  // 41\n\n  var r = c0_lo ^ c1_lo ^ c2_lo;\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n\nfunction g0_512_hi(xh, xl) {\n  var c0_hi = rotr64_hi(xh, xl, 1);\n  var c1_hi = rotr64_hi(xh, xl, 8);\n  var c2_hi = shr64_hi(xh, xl, 7);\n\n  var r = c0_hi ^ c1_hi ^ c2_hi;\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n\nfunction g0_512_lo(xh, xl) {\n  var c0_lo = rotr64_lo(xh, xl, 1);\n  var c1_lo = rotr64_lo(xh, xl, 8);\n  var c2_lo = shr64_lo(xh, xl, 7);\n\n  var r = c0_lo ^ c1_lo ^ c2_lo;\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n\nfunction g1_512_hi(xh, xl) {\n  var c0_hi = rotr64_hi(xh, xl, 19);\n  var c1_hi = rotr64_hi(xl, xh, 29);  // 61\n  var c2_hi = shr64_hi(xh, xl, 6);\n\n  var r = c0_hi ^ c1_hi ^ c2_hi;\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n\nfunction g1_512_lo(xh, xl) {\n  var c0_lo = rotr64_lo(xh, xl, 19);\n  var c1_lo = rotr64_lo(xl, xh, 29);  // 61\n  var c2_lo = shr64_lo(xh, xl, 6);\n\n  var r = c0_lo ^ c1_lo ^ c2_lo;\n  if (r < 0)\n    r += 0x100000000;\n  return r;\n}\n","'use strict';\n\nvar utils = require('./utils');\nvar common = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_3 = utils.sum32_3;\nvar sum32_4 = utils.sum32_4;\nvar BlockHash = common.BlockHash;\n\nfunction RIPEMD160() {\n  if (!(this instanceof RIPEMD160))\n    return new RIPEMD160();\n\n  BlockHash.call(this);\n\n  this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ];\n  this.endian = 'little';\n}\nutils.inherits(RIPEMD160, BlockHash);\nexports.ripemd160 = RIPEMD160;\n\nRIPEMD160.blockSize = 512;\nRIPEMD160.outSize = 160;\nRIPEMD160.hmacStrength = 192;\nRIPEMD160.padLength = 64;\n\nRIPEMD160.prototype._update = function update(msg, start) {\n  var A = this.h[0];\n  var B = this.h[1];\n  var C = this.h[2];\n  var D = this.h[3];\n  var E = this.h[4];\n  var Ah = A;\n  var Bh = B;\n  var Ch = C;\n  var Dh = D;\n  var Eh = E;\n  for (var j = 0; j < 80; j++) {\n    var T = sum32(\n      rotl32(\n        sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)),\n        s[j]),\n      E);\n    A = E;\n    E = D;\n    D = rotl32(C, 10);\n    C = B;\n    B = T;\n    T = sum32(\n      rotl32(\n        sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)),\n        sh[j]),\n      Eh);\n    Ah = Eh;\n    Eh = Dh;\n    Dh = rotl32(Ch, 10);\n    Ch = Bh;\n    Bh = T;\n  }\n  T = sum32_3(this.h[1], C, Dh);\n  this.h[1] = sum32_3(this.h[2], D, Eh);\n  this.h[2] = sum32_3(this.h[3], E, Ah);\n  this.h[3] = sum32_3(this.h[4], A, Bh);\n  this.h[4] = sum32_3(this.h[0], B, Ch);\n  this.h[0] = T;\n};\n\nRIPEMD160.prototype._digest = function digest(enc) {\n  if (enc === 'hex')\n    return utils.toHex32(this.h, 'little');\n  else\n    return utils.split32(this.h, 'little');\n};\n\nfunction f(j, x, y, z) {\n  if (j <= 15)\n    return x ^ y ^ z;\n  else if (j <= 31)\n    return (x & y) | ((~x) & z);\n  else if (j <= 47)\n    return (x | (~y)) ^ z;\n  else if (j <= 63)\n    return (x & z) | (y & (~z));\n  else\n    return x ^ (y | (~z));\n}\n\nfunction K(j) {\n  if (j <= 15)\n    return 0x00000000;\n  else if (j <= 31)\n    return 0x5a827999;\n  else if (j <= 47)\n    return 0x6ed9eba1;\n  else if (j <= 63)\n    return 0x8f1bbcdc;\n  else\n    return 0xa953fd4e;\n}\n\nfunction Kh(j) {\n  if (j <= 15)\n    return 0x50a28be6;\n  else if (j <= 31)\n    return 0x5c4dd124;\n  else if (j <= 47)\n    return 0x6d703ef3;\n  else if (j <= 63)\n    return 0x7a6d76e9;\n  else\n    return 0x00000000;\n}\n\nvar r = [\n  0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n  7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n  3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n  1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n  4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n];\n\nvar rh = [\n  5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n  6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n  15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n  8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n  12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n];\n\nvar s = [\n  11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n  7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n  11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n  11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n  9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n];\n\nvar sh = [\n  8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n  9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n  9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n  15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n  8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n];\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction Hmac(hash, key, enc) {\n  if (!(this instanceof Hmac))\n    return new Hmac(hash, key, enc);\n  this.Hash = hash;\n  this.blockSize = hash.blockSize / 8;\n  this.outSize = hash.outSize / 8;\n  this.inner = null;\n  this.outer = null;\n\n  this._init(utils.toArray(key, enc));\n}\nmodule.exports = Hmac;\n\nHmac.prototype._init = function init(key) {\n  // Shorten key, if needed\n  if (key.length > this.blockSize)\n    key = new this.Hash().update(key).digest();\n  assert(key.length <= this.blockSize);\n\n  // Add padding to key\n  for (var i = key.length; i < this.blockSize; i++)\n    key.push(0);\n\n  for (i = 0; i < key.length; i++)\n    key[i] ^= 0x36;\n  this.inner = new this.Hash().update(key);\n\n  // 0x36 ^ 0x5c = 0x6a\n  for (i = 0; i < key.length; i++)\n    key[i] ^= 0x6a;\n  this.outer = new this.Hash().update(key);\n};\n\nHmac.prototype.update = function update(msg, enc) {\n  this.inner.update(msg, enc);\n  return this;\n};\n\nHmac.prototype.digest = function digest(enc) {\n  this.outer.update(this.inner.digest());\n  return this.outer.digest(enc);\n};\n","module.exports = {\n  doubles: {\n    step: 4,\n    points: [\n      [\n        'e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a',\n        'f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821',\n      ],\n      [\n        '8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508',\n        '11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf',\n      ],\n      [\n        '175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739',\n        'd3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695',\n      ],\n      [\n        '363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640',\n        '4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9',\n      ],\n      [\n        '8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c',\n        '4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36',\n      ],\n      [\n        '723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda',\n        '96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f',\n      ],\n      [\n        'eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa',\n        '5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999',\n      ],\n      [\n        '100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0',\n        'cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09',\n      ],\n      [\n        'e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d',\n        '9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d',\n      ],\n      [\n        'feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d',\n        'e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088',\n      ],\n      [\n        'da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1',\n        '9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d',\n      ],\n      [\n        '53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0',\n        '5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8',\n      ],\n      [\n        '8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047',\n        '10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a',\n      ],\n      [\n        '385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862',\n        '283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453',\n      ],\n      [\n        '6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7',\n        '7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160',\n      ],\n      [\n        '3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd',\n        '56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0',\n      ],\n      [\n        '85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83',\n        '7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6',\n      ],\n      [\n        '948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a',\n        '53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589',\n      ],\n      [\n        '6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8',\n        'bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17',\n      ],\n      [\n        'e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d',\n        '4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda',\n      ],\n      [\n        'e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725',\n        '7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd',\n      ],\n      [\n        '213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754',\n        '4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2',\n      ],\n      [\n        '4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c',\n        '17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6',\n      ],\n      [\n        'fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6',\n        '6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f',\n      ],\n      [\n        '76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39',\n        'c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01',\n      ],\n      [\n        'c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891',\n        '893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3',\n      ],\n      [\n        'd895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b',\n        'febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f',\n      ],\n      [\n        'b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03',\n        '2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7',\n      ],\n      [\n        'e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d',\n        'eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78',\n      ],\n      [\n        'a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070',\n        '7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1',\n      ],\n      [\n        '90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4',\n        'e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150',\n      ],\n      [\n        '8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da',\n        '662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82',\n      ],\n      [\n        'e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11',\n        '1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc',\n      ],\n      [\n        '8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e',\n        'efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b',\n      ],\n      [\n        'e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41',\n        '2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51',\n      ],\n      [\n        'b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef',\n        '67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45',\n      ],\n      [\n        'd68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8',\n        'db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120',\n      ],\n      [\n        '324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d',\n        '648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84',\n      ],\n      [\n        '4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96',\n        '35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d',\n      ],\n      [\n        '9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd',\n        'ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d',\n      ],\n      [\n        '6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5',\n        '9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8',\n      ],\n      [\n        'a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266',\n        '40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8',\n      ],\n      [\n        '7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71',\n        '34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac',\n      ],\n      [\n        '928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac',\n        'c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f',\n      ],\n      [\n        '85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751',\n        '1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962',\n      ],\n      [\n        'ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e',\n        '493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907',\n      ],\n      [\n        '827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241',\n        'c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec',\n      ],\n      [\n        'eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3',\n        'be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d',\n      ],\n      [\n        'e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f',\n        '4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414',\n      ],\n      [\n        '1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19',\n        'aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd',\n      ],\n      [\n        '146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be',\n        'b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0',\n      ],\n      [\n        'fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9',\n        '6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811',\n      ],\n      [\n        'da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2',\n        '8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1',\n      ],\n      [\n        'a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13',\n        '7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c',\n      ],\n      [\n        '174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c',\n        'ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73',\n      ],\n      [\n        '959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba',\n        '2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd',\n      ],\n      [\n        'd2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151',\n        'e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405',\n      ],\n      [\n        '64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073',\n        'd99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589',\n      ],\n      [\n        '8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458',\n        '38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e',\n      ],\n      [\n        '13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b',\n        '69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27',\n      ],\n      [\n        'bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366',\n        'd3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1',\n      ],\n      [\n        '8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa',\n        '40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482',\n      ],\n      [\n        '8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0',\n        '620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945',\n      ],\n      [\n        'dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787',\n        '7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573',\n      ],\n      [\n        'f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e',\n        'ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82',\n      ],\n    ],\n  },\n  naf: {\n    wnd: 7,\n    points: [\n      [\n        'f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9',\n        '388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672',\n      ],\n      [\n        '2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4',\n        'd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6',\n      ],\n      [\n        '5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc',\n        '6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da',\n      ],\n      [\n        'acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe',\n        'cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37',\n      ],\n      [\n        '774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb',\n        'd984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b',\n      ],\n      [\n        'f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8',\n        'ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81',\n      ],\n      [\n        'd7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e',\n        '581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58',\n      ],\n      [\n        'defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34',\n        '4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77',\n      ],\n      [\n        '2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c',\n        '85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a',\n      ],\n      [\n        '352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5',\n        '321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c',\n      ],\n      [\n        '2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f',\n        '2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67',\n      ],\n      [\n        '9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714',\n        '73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402',\n      ],\n      [\n        'daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729',\n        'a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55',\n      ],\n      [\n        'c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db',\n        '2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482',\n      ],\n      [\n        '6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4',\n        'e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82',\n      ],\n      [\n        '1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5',\n        'b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396',\n      ],\n      [\n        '605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479',\n        '2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49',\n      ],\n      [\n        '62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d',\n        '80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf',\n      ],\n      [\n        '80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f',\n        '1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a',\n      ],\n      [\n        '7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb',\n        'd0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7',\n      ],\n      [\n        'd528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9',\n        'eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933',\n      ],\n      [\n        '49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963',\n        '758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a',\n      ],\n      [\n        '77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74',\n        '958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6',\n      ],\n      [\n        'f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530',\n        'e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37',\n      ],\n      [\n        '463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b',\n        '5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e',\n      ],\n      [\n        'f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247',\n        'cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6',\n      ],\n      [\n        'caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1',\n        'cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476',\n      ],\n      [\n        '2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120',\n        '4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40',\n      ],\n      [\n        '7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435',\n        '91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61',\n      ],\n      [\n        '754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18',\n        '673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683',\n      ],\n      [\n        'e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8',\n        '59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5',\n      ],\n      [\n        '186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb',\n        '3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b',\n      ],\n      [\n        'df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f',\n        '55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417',\n      ],\n      [\n        '5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143',\n        'efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868',\n      ],\n      [\n        '290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba',\n        'e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a',\n      ],\n      [\n        'af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45',\n        'f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6',\n      ],\n      [\n        '766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a',\n        '744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996',\n      ],\n      [\n        '59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e',\n        'c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e',\n      ],\n      [\n        'f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8',\n        'e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d',\n      ],\n      [\n        '7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c',\n        '30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2',\n      ],\n      [\n        '948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519',\n        'e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e',\n      ],\n      [\n        '7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab',\n        '100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437',\n      ],\n      [\n        '3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca',\n        'ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311',\n      ],\n      [\n        'd3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf',\n        '8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4',\n      ],\n      [\n        '1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610',\n        '68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575',\n      ],\n      [\n        '733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4',\n        'f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d',\n      ],\n      [\n        '15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c',\n        'd56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d',\n      ],\n      [\n        'a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940',\n        'edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629',\n      ],\n      [\n        'e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980',\n        'a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06',\n      ],\n      [\n        '311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3',\n        '66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374',\n      ],\n      [\n        '34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf',\n        '9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee',\n      ],\n      [\n        'f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63',\n        '4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1',\n      ],\n      [\n        'd7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448',\n        'fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b',\n      ],\n      [\n        '32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf',\n        '5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661',\n      ],\n      [\n        '7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5',\n        '8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6',\n      ],\n      [\n        'ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6',\n        '8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e',\n      ],\n      [\n        '16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5',\n        '5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d',\n      ],\n      [\n        'eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99',\n        'f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc',\n      ],\n      [\n        '78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51',\n        'f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4',\n      ],\n      [\n        '494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5',\n        '42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c',\n      ],\n      [\n        'a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5',\n        '204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b',\n      ],\n      [\n        'c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997',\n        '4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913',\n      ],\n      [\n        '841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881',\n        '73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154',\n      ],\n      [\n        '5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5',\n        '39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865',\n      ],\n      [\n        '36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66',\n        'd2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc',\n      ],\n      [\n        '336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726',\n        'ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224',\n      ],\n      [\n        '8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede',\n        '6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e',\n      ],\n      [\n        '1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94',\n        '60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6',\n      ],\n      [\n        '85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31',\n        '3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511',\n      ],\n      [\n        '29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51',\n        'b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b',\n      ],\n      [\n        'a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252',\n        'ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2',\n      ],\n      [\n        '4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5',\n        'cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c',\n      ],\n      [\n        'd24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b',\n        '6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3',\n      ],\n      [\n        'ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4',\n        '322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d',\n      ],\n      [\n        'af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f',\n        '6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700',\n      ],\n      [\n        'e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889',\n        '2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4',\n      ],\n      [\n        '591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246',\n        'b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196',\n      ],\n      [\n        '11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984',\n        '998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4',\n      ],\n      [\n        '3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a',\n        'b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257',\n      ],\n      [\n        'cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030',\n        'bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13',\n      ],\n      [\n        'c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197',\n        '6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096',\n      ],\n      [\n        'c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593',\n        'c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38',\n      ],\n      [\n        'a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef',\n        '21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f',\n      ],\n      [\n        '347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38',\n        '60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448',\n      ],\n      [\n        'da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a',\n        '49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a',\n      ],\n      [\n        'c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111',\n        '5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4',\n      ],\n      [\n        '4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502',\n        '7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437',\n      ],\n      [\n        '3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea',\n        'be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7',\n      ],\n      [\n        'cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26',\n        '8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d',\n      ],\n      [\n        'b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986',\n        '39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a',\n      ],\n      [\n        'd4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e',\n        '62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54',\n      ],\n      [\n        '48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4',\n        '25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77',\n      ],\n      [\n        'dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda',\n        'ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517',\n      ],\n      [\n        '6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859',\n        'cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10',\n      ],\n      [\n        'e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f',\n        'f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125',\n      ],\n      [\n        'eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c',\n        '6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e',\n      ],\n      [\n        '13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942',\n        'fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1',\n      ],\n      [\n        'ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a',\n        '1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2',\n      ],\n      [\n        'b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80',\n        '5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423',\n      ],\n      [\n        'ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d',\n        '438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8',\n      ],\n      [\n        '8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1',\n        'cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758',\n      ],\n      [\n        '52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63',\n        'c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375',\n      ],\n      [\n        'e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352',\n        '6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d',\n      ],\n      [\n        '7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193',\n        'ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec',\n      ],\n      [\n        '5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00',\n        '9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0',\n      ],\n      [\n        '32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58',\n        'ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c',\n      ],\n      [\n        'e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7',\n        'd3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4',\n      ],\n      [\n        '8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8',\n        'c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f',\n      ],\n      [\n        '4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e',\n        '67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649',\n      ],\n      [\n        '3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d',\n        'cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826',\n      ],\n      [\n        '674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b',\n        '299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5',\n      ],\n      [\n        'd32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f',\n        'f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87',\n      ],\n      [\n        '30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6',\n        '462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b',\n      ],\n      [\n        'be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297',\n        '62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc',\n      ],\n      [\n        '93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a',\n        '7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c',\n      ],\n      [\n        'b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c',\n        'ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f',\n      ],\n      [\n        'd5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52',\n        '4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a',\n      ],\n      [\n        'd3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb',\n        'bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46',\n      ],\n      [\n        '463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065',\n        'bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f',\n      ],\n      [\n        '7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917',\n        '603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03',\n      ],\n      [\n        '74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9',\n        'cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08',\n      ],\n      [\n        '30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3',\n        '553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8',\n      ],\n      [\n        '9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57',\n        '712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373',\n      ],\n      [\n        '176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66',\n        'ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3',\n      ],\n      [\n        '75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8',\n        '9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8',\n      ],\n      [\n        '809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721',\n        '9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1',\n      ],\n      [\n        '1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180',\n        '4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9',\n      ],\n    ],\n  },\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar HmacDRBG = require('hmac-drbg');\nvar utils = require('../utils');\nvar curves = require('../curves');\nvar rand = require('brorand');\nvar assert = utils.assert;\n\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EC(options) {\n  if (!(this instanceof EC))\n    return new EC(options);\n\n  // Shortcut `elliptic.ec(curve-name)`\n  if (typeof options === 'string') {\n    assert(Object.prototype.hasOwnProperty.call(curves, options),\n      'Unknown curve ' + options);\n\n    options = curves[options];\n  }\n\n  // Shortcut for `elliptic.ec(elliptic.curves.curveName)`\n  if (options instanceof curves.PresetCurve)\n    options = { curve: options };\n\n  this.curve = options.curve.curve;\n  this.n = this.curve.n;\n  this.nh = this.n.ushrn(1);\n  this.g = this.curve.g;\n\n  // Point on curve\n  this.g = options.curve.g;\n  this.g.precompute(options.curve.n.bitLength() + 1);\n\n  // Hash for function for DRBG\n  this.hash = options.hash || options.curve.hash;\n}\nmodule.exports = EC;\n\nEC.prototype.keyPair = function keyPair(options) {\n  return new KeyPair(this, options);\n};\n\nEC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) {\n  return KeyPair.fromPrivate(this, priv, enc);\n};\n\nEC.prototype.keyFromPublic = function keyFromPublic(pub, enc) {\n  return KeyPair.fromPublic(this, pub, enc);\n};\n\nEC.prototype.genKeyPair = function genKeyPair(options) {\n  if (!options)\n    options = {};\n\n  // Instantiate Hmac_DRBG\n  var drbg = new HmacDRBG({\n    hash: this.hash,\n    pers: options.pers,\n    persEnc: options.persEnc || 'utf8',\n    entropy: options.entropy || rand(this.hash.hmacStrength),\n    entropyEnc: options.entropy && options.entropyEnc || 'utf8',\n    nonce: this.n.toArray(),\n  });\n\n  var bytes = this.n.byteLength();\n  var ns2 = this.n.sub(new BN(2));\n  for (;;) {\n    var priv = new BN(drbg.generate(bytes));\n    if (priv.cmp(ns2) > 0)\n      continue;\n\n    priv.iaddn(1);\n    return this.keyFromPrivate(priv);\n  }\n};\n\nEC.prototype._truncateToN = function _truncateToN(msg, truncOnly) {\n  var delta = msg.byteLength() * 8 - this.n.bitLength();\n  if (delta > 0)\n    msg = msg.ushrn(delta);\n  if (!truncOnly && msg.cmp(this.n) >= 0)\n    return msg.sub(this.n);\n  else\n    return msg;\n};\n\nEC.prototype.sign = function sign(msg, key, enc, options) {\n  if (typeof enc === 'object') {\n    options = enc;\n    enc = null;\n  }\n  if (!options)\n    options = {};\n\n  key = this.keyFromPrivate(key, enc);\n  msg = this._truncateToN(new BN(msg, 16));\n\n  // Zero-extend key to provide enough entropy\n  var bytes = this.n.byteLength();\n  var bkey = key.getPrivate().toArray('be', bytes);\n\n  // Zero-extend nonce to have the same byte size as N\n  var nonce = msg.toArray('be', bytes);\n\n  // Instantiate Hmac_DRBG\n  var drbg = new HmacDRBG({\n    hash: this.hash,\n    entropy: bkey,\n    nonce: nonce,\n    pers: options.pers,\n    persEnc: options.persEnc || 'utf8',\n  });\n\n  // Number of bytes to generate\n  var ns1 = this.n.sub(new BN(1));\n\n  for (var iter = 0; ; iter++) {\n    var k = options.k ?\n      options.k(iter) :\n      new BN(drbg.generate(this.n.byteLength()));\n    k = this._truncateToN(k, true);\n    if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0)\n      continue;\n\n    var kp = this.g.mul(k);\n    if (kp.isInfinity())\n      continue;\n\n    var kpX = kp.getX();\n    var r = kpX.umod(this.n);\n    if (r.cmpn(0) === 0)\n      continue;\n\n    var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n    s = s.umod(this.n);\n    if (s.cmpn(0) === 0)\n      continue;\n\n    var recoveryParam = (kp.getY().isOdd() ? 1 : 0) |\n                        (kpX.cmp(r) !== 0 ? 2 : 0);\n\n    // Use complement of `s`, if it is > `n / 2`\n    if (options.canonical && s.cmp(this.nh) > 0) {\n      s = this.n.sub(s);\n      recoveryParam ^= 1;\n    }\n\n    return new Signature({ r: r, s: s, recoveryParam: recoveryParam });\n  }\n};\n\nEC.prototype.verify = function verify(msg, signature, key, enc) {\n  msg = this._truncateToN(new BN(msg, 16));\n  key = this.keyFromPublic(key, enc);\n  signature = new Signature(signature, 'hex');\n\n  // Perform primitive values validation\n  var r = signature.r;\n  var s = signature.s;\n  if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0)\n    return false;\n  if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0)\n    return false;\n\n  // Validate signature\n  var sinv = s.invm(this.n);\n  var u1 = sinv.mul(msg).umod(this.n);\n  var u2 = sinv.mul(r).umod(this.n);\n  var p;\n\n  if (!this.curve._maxwellTrick) {\n    p = this.g.mulAdd(u1, key.getPublic(), u2);\n    if (p.isInfinity())\n      return false;\n\n    return p.getX().umod(this.n).cmp(r) === 0;\n  }\n\n  // NOTE: Greg Maxwell's trick, inspired by:\n  // https://git.io/vad3K\n\n  p = this.g.jmulAdd(u1, key.getPublic(), u2);\n  if (p.isInfinity())\n    return false;\n\n  // Compare `p.x` of Jacobian point with `r`,\n  // this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the\n  // inverse of `p.z^2`\n  return p.eqXToP(r);\n};\n\nEC.prototype.recoverPubKey = function(msg, signature, j, enc) {\n  assert((3 & j) === j, 'The recovery param is more than two bits');\n  signature = new Signature(signature, enc);\n\n  var n = this.n;\n  var e = new BN(msg);\n  var r = signature.r;\n  var s = signature.s;\n\n  // A set LSB signifies that the y-coordinate is odd\n  var isYOdd = j & 1;\n  var isSecondKey = j >> 1;\n  if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n    throw new Error('Unable to find sencond key candinate');\n\n  // 1.1. Let x = r + jn.\n  if (isSecondKey)\n    r = this.curve.pointFromX(r.add(this.curve.n), isYOdd);\n  else\n    r = this.curve.pointFromX(r, isYOdd);\n\n  var rInv = signature.r.invm(n);\n  var s1 = n.sub(e).mul(rInv).umod(n);\n  var s2 = s.mul(rInv).umod(n);\n\n  // 1.6.1 Compute Q = r^-1 (sR -  eG)\n  //               Q = r^-1 (sR + -eG)\n  return this.g.mulAdd(s1, r, s2);\n};\n\nEC.prototype.getKeyRecoveryParam = function(e, signature, Q, enc) {\n  signature = new Signature(signature, enc);\n  if (signature.recoveryParam !== null)\n    return signature.recoveryParam;\n\n  for (var i = 0; i < 4; i++) {\n    var Qprime;\n    try {\n      Qprime = this.recoverPubKey(e, signature, i);\n    } catch (e) {\n      continue;\n    }\n\n    if (Qprime.eq(Q))\n      return i;\n  }\n  throw new Error('Unable to find valid recovery factor');\n};\n","'use strict';\n\nvar hash = require('hash.js');\nvar utils = require('minimalistic-crypto-utils');\nvar assert = require('minimalistic-assert');\n\nfunction HmacDRBG(options) {\n  if (!(this instanceof HmacDRBG))\n    return new HmacDRBG(options);\n  this.hash = options.hash;\n  this.predResist = !!options.predResist;\n\n  this.outLen = this.hash.outSize;\n  this.minEntropy = options.minEntropy || this.hash.hmacStrength;\n\n  this._reseed = null;\n  this.reseedInterval = null;\n  this.K = null;\n  this.V = null;\n\n  var entropy = utils.toArray(options.entropy, options.entropyEnc || 'hex');\n  var nonce = utils.toArray(options.nonce, options.nonceEnc || 'hex');\n  var pers = utils.toArray(options.pers, options.persEnc || 'hex');\n  assert(entropy.length >= (this.minEntropy / 8),\n         'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n  this._init(entropy, nonce, pers);\n}\nmodule.exports = HmacDRBG;\n\nHmacDRBG.prototype._init = function init(entropy, nonce, pers) {\n  var seed = entropy.concat(nonce).concat(pers);\n\n  this.K = new Array(this.outLen / 8);\n  this.V = new Array(this.outLen / 8);\n  for (var i = 0; i < this.V.length; i++) {\n    this.K[i] = 0x00;\n    this.V[i] = 0x01;\n  }\n\n  this._update(seed);\n  this._reseed = 1;\n  this.reseedInterval = 0x1000000000000;  // 2^48\n};\n\nHmacDRBG.prototype._hmac = function hmac() {\n  return new hash.hmac(this.hash, this.K);\n};\n\nHmacDRBG.prototype._update = function update(seed) {\n  var kmac = this._hmac()\n                 .update(this.V)\n                 .update([ 0x00 ]);\n  if (seed)\n    kmac = kmac.update(seed);\n  this.K = kmac.digest();\n  this.V = this._hmac().update(this.V).digest();\n  if (!seed)\n    return;\n\n  this.K = this._hmac()\n               .update(this.V)\n               .update([ 0x01 ])\n               .update(seed)\n               .digest();\n  this.V = this._hmac().update(this.V).digest();\n};\n\nHmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) {\n  // Optional entropy enc\n  if (typeof entropyEnc !== 'string') {\n    addEnc = add;\n    add = entropyEnc;\n    entropyEnc = null;\n  }\n\n  entropy = utils.toArray(entropy, entropyEnc);\n  add = utils.toArray(add, addEnc);\n\n  assert(entropy.length >= (this.minEntropy / 8),\n         'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n\n  this._update(entropy.concat(add || []));\n  this._reseed = 1;\n};\n\nHmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) {\n  if (this._reseed > this.reseedInterval)\n    throw new Error('Reseed is required');\n\n  // Optional encoding\n  if (typeof enc !== 'string') {\n    addEnc = add;\n    add = enc;\n    enc = null;\n  }\n\n  // Optional additional data\n  if (add) {\n    add = utils.toArray(add, addEnc || 'hex');\n    this._update(add);\n  }\n\n  var temp = [];\n  while (temp.length < len) {\n    this.V = this._hmac().update(this.V).digest();\n    temp = temp.concat(this.V);\n  }\n\n  var res = temp.slice(0, len);\n  this._update(add);\n  this._reseed++;\n  return utils.encode(res, enc);\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction KeyPair(ec, options) {\n  this.ec = ec;\n  this.priv = null;\n  this.pub = null;\n\n  // KeyPair(ec, { priv: ..., pub: ... })\n  if (options.priv)\n    this._importPrivate(options.priv, options.privEnc);\n  if (options.pub)\n    this._importPublic(options.pub, options.pubEnc);\n}\nmodule.exports = KeyPair;\n\nKeyPair.fromPublic = function fromPublic(ec, pub, enc) {\n  if (pub instanceof KeyPair)\n    return pub;\n\n  return new KeyPair(ec, {\n    pub: pub,\n    pubEnc: enc,\n  });\n};\n\nKeyPair.fromPrivate = function fromPrivate(ec, priv, enc) {\n  if (priv instanceof KeyPair)\n    return priv;\n\n  return new KeyPair(ec, {\n    priv: priv,\n    privEnc: enc,\n  });\n};\n\nKeyPair.prototype.validate = function validate() {\n  var pub = this.getPublic();\n\n  if (pub.isInfinity())\n    return { result: false, reason: 'Invalid public key' };\n  if (!pub.validate())\n    return { result: false, reason: 'Public key is not a point' };\n  if (!pub.mul(this.ec.curve.n).isInfinity())\n    return { result: false, reason: 'Public key * N != O' };\n\n  return { result: true, reason: null };\n};\n\nKeyPair.prototype.getPublic = function getPublic(compact, enc) {\n  // compact is optional argument\n  if (typeof compact === 'string') {\n    enc = compact;\n    compact = null;\n  }\n\n  if (!this.pub)\n    this.pub = this.ec.g.mul(this.priv);\n\n  if (!enc)\n    return this.pub;\n\n  return this.pub.encode(enc, compact);\n};\n\nKeyPair.prototype.getPrivate = function getPrivate(enc) {\n  if (enc === 'hex')\n    return this.priv.toString(16, 2);\n  else\n    return this.priv;\n};\n\nKeyPair.prototype._importPrivate = function _importPrivate(key, enc) {\n  this.priv = new BN(key, enc || 16);\n\n  // Ensure that the priv won't be bigger than n, otherwise we may fail\n  // in fixed multiplication method\n  this.priv = this.priv.umod(this.ec.curve.n);\n};\n\nKeyPair.prototype._importPublic = function _importPublic(key, enc) {\n  if (key.x || key.y) {\n    // Montgomery points only have an `x` coordinate.\n    // Weierstrass/Edwards points on the other hand have both `x` and\n    // `y` coordinates.\n    if (this.ec.curve.type === 'mont') {\n      assert(key.x, 'Need x coordinate');\n    } else if (this.ec.curve.type === 'short' ||\n               this.ec.curve.type === 'edwards') {\n      assert(key.x && key.y, 'Need both x and y coordinate');\n    }\n    this.pub = this.ec.curve.point(key.x, key.y);\n    return;\n  }\n  this.pub = this.ec.curve.decodePoint(key, enc);\n};\n\n// ECDH\nKeyPair.prototype.derive = function derive(pub) {\n  if(!pub.validate()) {\n    assert(pub.validate(), 'public point not validated');\n  }\n  return pub.mul(this.priv).getX();\n};\n\n// ECDSA\nKeyPair.prototype.sign = function sign(msg, enc, options) {\n  return this.ec.sign(msg, this, enc, options);\n};\n\nKeyPair.prototype.verify = function verify(msg, signature) {\n  return this.ec.verify(msg, signature, this);\n};\n\nKeyPair.prototype.inspect = function inspect() {\n  return '<Key priv: ' + (this.priv && this.priv.toString(16, 2)) +\n         ' pub: ' + (this.pub && this.pub.inspect()) + ' >';\n};\n","'use strict';\n\nvar BN = require('bn.js');\n\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction Signature(options, enc) {\n  if (options instanceof Signature)\n    return options;\n\n  if (this._importDER(options, enc))\n    return;\n\n  assert(options.r && options.s, 'Signature without r or s');\n  this.r = new BN(options.r, 16);\n  this.s = new BN(options.s, 16);\n  if (options.recoveryParam === undefined)\n    this.recoveryParam = null;\n  else\n    this.recoveryParam = options.recoveryParam;\n}\nmodule.exports = Signature;\n\nfunction Position() {\n  this.place = 0;\n}\n\nfunction getLength(buf, p) {\n  var initial = buf[p.place++];\n  if (!(initial & 0x80)) {\n    return initial;\n  }\n  var octetLen = initial & 0xf;\n\n  // Indefinite length or overflow\n  if (octetLen === 0 || octetLen > 4) {\n    return false;\n  }\n\n  var val = 0;\n  for (var i = 0, off = p.place; i < octetLen; i++, off++) {\n    val <<= 8;\n    val |= buf[off];\n    val >>>= 0;\n  }\n\n  // Leading zeroes\n  if (val <= 0x7f) {\n    return false;\n  }\n\n  p.place = off;\n  return val;\n}\n\nfunction rmPadding(buf) {\n  var i = 0;\n  var len = buf.length - 1;\n  while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) {\n    i++;\n  }\n  if (i === 0) {\n    return buf;\n  }\n  return buf.slice(i);\n}\n\nSignature.prototype._importDER = function _importDER(data, enc) {\n  data = utils.toArray(data, enc);\n  var p = new Position();\n  if (data[p.place++] !== 0x30) {\n    return false;\n  }\n  var len = getLength(data, p);\n  if (len === false) {\n    return false;\n  }\n  if ((len + p.place) !== data.length) {\n    return false;\n  }\n  if (data[p.place++] !== 0x02) {\n    return false;\n  }\n  var rlen = getLength(data, p);\n  if (rlen === false) {\n    return false;\n  }\n  var r = data.slice(p.place, rlen + p.place);\n  p.place += rlen;\n  if (data[p.place++] !== 0x02) {\n    return false;\n  }\n  var slen = getLength(data, p);\n  if (slen === false) {\n    return false;\n  }\n  if (data.length !== slen + p.place) {\n    return false;\n  }\n  var s = data.slice(p.place, slen + p.place);\n  if (r[0] === 0) {\n    if (r[1] & 0x80) {\n      r = r.slice(1);\n    } else {\n      // Leading zeroes\n      return false;\n    }\n  }\n  if (s[0] === 0) {\n    if (s[1] & 0x80) {\n      s = s.slice(1);\n    } else {\n      // Leading zeroes\n      return false;\n    }\n  }\n\n  this.r = new BN(r);\n  this.s = new BN(s);\n  this.recoveryParam = null;\n\n  return true;\n};\n\nfunction constructLength(arr, len) {\n  if (len < 0x80) {\n    arr.push(len);\n    return;\n  }\n  var octets = 1 + (Math.log(len) / Math.LN2 >>> 3);\n  arr.push(octets | 0x80);\n  while (--octets) {\n    arr.push((len >>> (octets << 3)) & 0xff);\n  }\n  arr.push(len);\n}\n\nSignature.prototype.toDER = function toDER(enc) {\n  var r = this.r.toArray();\n  var s = this.s.toArray();\n\n  // Pad values\n  if (r[0] & 0x80)\n    r = [ 0 ].concat(r);\n  // Pad values\n  if (s[0] & 0x80)\n    s = [ 0 ].concat(s);\n\n  r = rmPadding(r);\n  s = rmPadding(s);\n\n  while (!s[0] && !(s[1] & 0x80)) {\n    s = s.slice(1);\n  }\n  var arr = [ 0x02 ];\n  constructLength(arr, r.length);\n  arr = arr.concat(r);\n  arr.push(0x02);\n  constructLength(arr, s.length);\n  var backHalf = arr.concat(s);\n  var res = [ 0x30 ];\n  constructLength(res, backHalf.length);\n  res = res.concat(backHalf);\n  return utils.encode(res, enc);\n};\n","'use strict';\n\nvar hash = require('hash.js');\nvar curves = require('../curves');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EDDSA(curve) {\n  assert(curve === 'ed25519', 'only tested with ed25519 so far');\n\n  if (!(this instanceof EDDSA))\n    return new EDDSA(curve);\n\n  curve = curves[curve].curve;\n  this.curve = curve;\n  this.g = curve.g;\n  this.g.precompute(curve.n.bitLength() + 1);\n\n  this.pointClass = curve.point().constructor;\n  this.encodingLength = Math.ceil(curve.n.bitLength() / 8);\n  this.hash = hash.sha512;\n}\n\nmodule.exports = EDDSA;\n\n/**\n* @param {Array|String} message - message bytes\n* @param {Array|String|KeyPair} secret - secret bytes or a keypair\n* @returns {Signature} - signature\n*/\nEDDSA.prototype.sign = function sign(message, secret) {\n  message = parseBytes(message);\n  var key = this.keyFromSecret(secret);\n  var r = this.hashInt(key.messagePrefix(), message);\n  var R = this.g.mul(r);\n  var Rencoded = this.encodePoint(R);\n  var s_ = this.hashInt(Rencoded, key.pubBytes(), message)\n    .mul(key.priv());\n  var S = r.add(s_).umod(this.curve.n);\n  return this.makeSignature({ R: R, S: S, Rencoded: Rencoded });\n};\n\n/**\n* @param {Array} message - message bytes\n* @param {Array|String|Signature} sig - sig bytes\n* @param {Array|String|Point|KeyPair} pub - public key\n* @returns {Boolean} - true if public key matches sig of message\n*/\nEDDSA.prototype.verify = function verify(message, sig, pub) {\n  message = parseBytes(message);\n  sig = this.makeSignature(sig);\n  var key = this.keyFromPublic(pub);\n  var h = this.hashInt(sig.Rencoded(), key.pubBytes(), message);\n  var SG = this.g.mul(sig.S());\n  var RplusAh = sig.R().add(key.pub().mul(h));\n  return RplusAh.eq(SG);\n};\n\nEDDSA.prototype.hashInt = function hashInt() {\n  var hash = this.hash();\n  for (var i = 0; i < arguments.length; i++)\n    hash.update(arguments[i]);\n  return utils.intFromLE(hash.digest()).umod(this.curve.n);\n};\n\nEDDSA.prototype.keyFromPublic = function keyFromPublic(pub) {\n  return KeyPair.fromPublic(this, pub);\n};\n\nEDDSA.prototype.keyFromSecret = function keyFromSecret(secret) {\n  return KeyPair.fromSecret(this, secret);\n};\n\nEDDSA.prototype.makeSignature = function makeSignature(sig) {\n  if (sig instanceof Signature)\n    return sig;\n  return new Signature(this, sig);\n};\n\n/**\n* * https://tools.ietf.org/html/draft-josefsson-eddsa-ed25519-03#section-5.2\n*\n* EDDSA defines methods for encoding and decoding points and integers. These are\n* helper convenience methods, that pass along to utility functions implied\n* parameters.\n*\n*/\nEDDSA.prototype.encodePoint = function encodePoint(point) {\n  var enc = point.getY().toArray('le', this.encodingLength);\n  enc[this.encodingLength - 1] |= point.getX().isOdd() ? 0x80 : 0;\n  return enc;\n};\n\nEDDSA.prototype.decodePoint = function decodePoint(bytes) {\n  bytes = utils.parseBytes(bytes);\n\n  var lastIx = bytes.length - 1;\n  var normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & ~0x80);\n  var xIsOdd = (bytes[lastIx] & 0x80) !== 0;\n\n  var y = utils.intFromLE(normed);\n  return this.curve.pointFromY(y, xIsOdd);\n};\n\nEDDSA.prototype.encodeInt = function encodeInt(num) {\n  return num.toArray('le', this.encodingLength);\n};\n\nEDDSA.prototype.decodeInt = function decodeInt(bytes) {\n  return utils.intFromLE(bytes);\n};\n\nEDDSA.prototype.isPoint = function isPoint(val) {\n  return val instanceof this.pointClass;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar cachedProperty = utils.cachedProperty;\n\n/**\n* @param {EDDSA} eddsa - instance\n* @param {Object} params - public/private key parameters\n*\n* @param {Array<Byte>} [params.secret] - secret seed bytes\n* @param {Point} [params.pub] - public key point (aka `A` in eddsa terms)\n* @param {Array<Byte>} [params.pub] - public key point encoded as bytes\n*\n*/\nfunction KeyPair(eddsa, params) {\n  this.eddsa = eddsa;\n  this._secret = parseBytes(params.secret);\n  if (eddsa.isPoint(params.pub))\n    this._pub = params.pub;\n  else\n    this._pubBytes = parseBytes(params.pub);\n}\n\nKeyPair.fromPublic = function fromPublic(eddsa, pub) {\n  if (pub instanceof KeyPair)\n    return pub;\n  return new KeyPair(eddsa, { pub: pub });\n};\n\nKeyPair.fromSecret = function fromSecret(eddsa, secret) {\n  if (secret instanceof KeyPair)\n    return secret;\n  return new KeyPair(eddsa, { secret: secret });\n};\n\nKeyPair.prototype.secret = function secret() {\n  return this._secret;\n};\n\ncachedProperty(KeyPair, 'pubBytes', function pubBytes() {\n  return this.eddsa.encodePoint(this.pub());\n});\n\ncachedProperty(KeyPair, 'pub', function pub() {\n  if (this._pubBytes)\n    return this.eddsa.decodePoint(this._pubBytes);\n  return this.eddsa.g.mul(this.priv());\n});\n\ncachedProperty(KeyPair, 'privBytes', function privBytes() {\n  var eddsa = this.eddsa;\n  var hash = this.hash();\n  var lastIx = eddsa.encodingLength - 1;\n\n  var a = hash.slice(0, eddsa.encodingLength);\n  a[0] &= 248;\n  a[lastIx] &= 127;\n  a[lastIx] |= 64;\n\n  return a;\n});\n\ncachedProperty(KeyPair, 'priv', function priv() {\n  return this.eddsa.decodeInt(this.privBytes());\n});\n\ncachedProperty(KeyPair, 'hash', function hash() {\n  return this.eddsa.hash().update(this.secret()).digest();\n});\n\ncachedProperty(KeyPair, 'messagePrefix', function messagePrefix() {\n  return this.hash().slice(this.eddsa.encodingLength);\n});\n\nKeyPair.prototype.sign = function sign(message) {\n  assert(this._secret, 'KeyPair can only verify');\n  return this.eddsa.sign(message, this);\n};\n\nKeyPair.prototype.verify = function verify(message, sig) {\n  return this.eddsa.verify(message, sig, this);\n};\n\nKeyPair.prototype.getSecret = function getSecret(enc) {\n  assert(this._secret, 'KeyPair is public only');\n  return utils.encode(this.secret(), enc);\n};\n\nKeyPair.prototype.getPublic = function getPublic(enc) {\n  return utils.encode(this.pubBytes(), enc);\n};\n\nmodule.exports = KeyPair;\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar cachedProperty = utils.cachedProperty;\nvar parseBytes = utils.parseBytes;\n\n/**\n* @param {EDDSA} eddsa - eddsa instance\n* @param {Array<Bytes>|Object} sig -\n* @param {Array<Bytes>|Point} [sig.R] - R point as Point or bytes\n* @param {Array<Bytes>|bn} [sig.S] - S scalar as bn or bytes\n* @param {Array<Bytes>} [sig.Rencoded] - R point encoded\n* @param {Array<Bytes>} [sig.Sencoded] - S scalar encoded\n*/\nfunction Signature(eddsa, sig) {\n  this.eddsa = eddsa;\n\n  if (typeof sig !== 'object')\n    sig = parseBytes(sig);\n\n  if (Array.isArray(sig)) {\n    sig = {\n      R: sig.slice(0, eddsa.encodingLength),\n      S: sig.slice(eddsa.encodingLength),\n    };\n  }\n\n  assert(sig.R && sig.S, 'Signature without R or S');\n\n  if (eddsa.isPoint(sig.R))\n    this._R = sig.R;\n  if (sig.S instanceof BN)\n    this._S = sig.S;\n\n  this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded;\n  this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded;\n}\n\ncachedProperty(Signature, 'S', function S() {\n  return this.eddsa.decodeInt(this.Sencoded());\n});\n\ncachedProperty(Signature, 'R', function R() {\n  return this.eddsa.decodePoint(this.Rencoded());\n});\n\ncachedProperty(Signature, 'Rencoded', function Rencoded() {\n  return this.eddsa.encodePoint(this.R());\n});\n\ncachedProperty(Signature, 'Sencoded', function Sencoded() {\n  return this.eddsa.encodeInt(this.S());\n});\n\nSignature.prototype.toBytes = function toBytes() {\n  return this.Rencoded().concat(this.Sencoded());\n};\n\nSignature.prototype.toHex = function toHex() {\n  return utils.encode(this.toBytes(), 'hex').toUpperCase();\n};\n\nmodule.exports = Signature;\n","'use strict'\n\nconst errcode = require('err-code')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst hmac = require('../hmac')\n\nconst cipherMap = {\n  'AES-128': {\n    ivSize: 16,\n    keySize: 16\n  },\n  'AES-256': {\n    ivSize: 16,\n    keySize: 32\n  },\n  Blowfish: {\n    ivSize: 8,\n    cipherKeySize: 32\n  }\n}\n\n// Generates a set of keys for each party by stretching the shared key.\n// (myIV, theirIV, myCipherKey, theirCipherKey, myMACKey, theirMACKey)\nmodule.exports = async (cipherType, hash, secret) => {\n  const cipher = cipherMap[cipherType]\n\n  if (!cipher) {\n    const allowed = Object.keys(cipherMap).join(' / ')\n    throw errcode(new Error(`unknown cipher type '${cipherType}'. Must be ${allowed}`), 'ERR_INVALID_CIPHER_TYPE')\n  }\n\n  if (!hash) {\n    throw errcode(new Error('missing hash type'), 'ERR_MISSING_HASH_TYPE')\n  }\n\n  const cipherKeySize = cipher.keySize\n  const ivSize = cipher.ivSize\n  const hmacKeySize = 20\n  const seed = uint8ArrayFromString('key expansion')\n  const resultLength = 2 * (ivSize + cipherKeySize + hmacKeySize)\n\n  const m = await hmac.create(hash, secret)\n  let a = await m.digest(seed)\n\n  const result = []\n  let j = 0\n\n  while (j < resultLength) {\n    const b = await m.digest(uint8ArrayConcat([a, seed]))\n    let todo = b.length\n\n    if (j + todo > resultLength) {\n      todo = resultLength - j\n    }\n\n    result.push(b)\n    j += todo\n    a = await m.digest(a)\n  }\n\n  const half = resultLength / 2\n  const resultBuffer = uint8ArrayConcat(result)\n  const r1 = resultBuffer.slice(0, half)\n  const r2 = resultBuffer.slice(half, resultLength)\n\n  const createKey = (res) => ({\n    iv: res.slice(0, ivSize),\n    cipherKey: res.slice(ivSize, ivSize + cipherKeySize),\n    macKey: res.slice(ivSize + cipherKeySize)\n  })\n\n  return {\n    k1: createKey(r1),\n    k2: createKey(r2)\n  }\n}\n","'use strict'\n\nconst webcrypto = require('../webcrypto')\nconst lengths = require('./lengths')\n\nconst hashTypes = {\n  SHA1: 'SHA-1',\n  SHA256: 'SHA-256',\n  SHA512: 'SHA-512'\n}\n\nconst sign = async (key, data) => {\n  const buf = await webcrypto.get().subtle.sign({ name: 'HMAC' }, key, data)\n  return new Uint8Array(buf, buf.byteOffset, buf.byteLength)\n}\n\nexports.create = async function (hashType, secret) {\n  const hash = hashTypes[hashType]\n\n  const key = await webcrypto.get().subtle.importKey(\n    'raw',\n    secret,\n    {\n      name: 'HMAC',\n      hash: { name: hash }\n    },\n    false,\n    ['sign']\n  )\n\n  return {\n    async digest (data) { // eslint-disable-line require-await\n      return sign(key, data)\n    },\n    length: lengths[hashType]\n  }\n}\n","'use strict'\n\nmodule.exports = {\n  SHA1: 20,\n  SHA256: 32,\n  SHA512: 64\n}\n","'use strict'\n\nconst ecdh = require('./ecdh')\n\n// Generates an ephemeral public key and returns a function that will compute\n// the shared secret key.\n//\n// Focuses only on ECDH now, but can be made more general in the future.\nmodule.exports = async (curve) => ecdh.generateEphmeralKeyPair(curve) // eslint-disable-line require-await\n","'use strict'\n\nconst errcode = require('err-code')\nconst webcrypto = require('../webcrypto')\nconst { base64urlToBuffer } = require('../util')\nconst validateCurveType = require('./validate-curve-type')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\nconst bits = {\n  'P-256': 256,\n  'P-384': 384,\n  'P-521': 521\n}\n\nexports.generateEphmeralKeyPair = async function (curve) {\n  validateCurveType(Object.keys(bits), curve)\n  const pair = await webcrypto.get().subtle.generateKey(\n    {\n      name: 'ECDH',\n      namedCurve: curve\n    },\n    true,\n    ['deriveBits']\n  )\n\n  // forcePrivate is used for testing only\n  const genSharedKey = async (theirPub, forcePrivate) => {\n    let privateKey\n\n    if (forcePrivate) {\n      privateKey = await webcrypto.get().subtle.importKey(\n        'jwk',\n        unmarshalPrivateKey(curve, forcePrivate),\n        {\n          name: 'ECDH',\n          namedCurve: curve\n        },\n        false,\n        ['deriveBits']\n      )\n    } else {\n      privateKey = pair.privateKey\n    }\n\n    const keys = [\n      await webcrypto.get().subtle.importKey(\n        'jwk',\n        unmarshalPublicKey(curve, theirPub),\n        {\n          name: 'ECDH',\n          namedCurve: curve\n        },\n        false,\n        []\n      ),\n      privateKey\n    ]\n\n    const buffer = await webcrypto.get().subtle.deriveBits(\n      {\n        name: 'ECDH',\n        namedCurve: curve,\n        public: keys[0]\n      },\n      keys[1],\n      bits[curve]\n    )\n\n    return new Uint8Array(buffer, buffer.byteOffset, buffer.byteLength)\n  }\n\n  const publicKey = await webcrypto.get().subtle.exportKey('jwk', pair.publicKey)\n\n  return {\n    key: marshalPublicKey(publicKey),\n    genSharedKey\n  }\n}\n\nconst curveLengths = {\n  'P-256': 32,\n  'P-384': 48,\n  'P-521': 66\n}\n\n// Marshal converts a jwk encodec ECDH public key into the\n// form specified in section 4.3.6 of ANSI X9.62. (This is the format\n// go-ipfs uses)\nfunction marshalPublicKey (jwk) {\n  const byteLen = curveLengths[jwk.crv]\n\n  return uint8ArrayConcat([\n    Uint8Array.from([4]), // uncompressed point\n    base64urlToBuffer(jwk.x, byteLen),\n    base64urlToBuffer(jwk.y, byteLen)\n  ], 1 + byteLen * 2)\n}\n\n// Unmarshal converts a point, serialized by Marshal, into an jwk encoded key\nfunction unmarshalPublicKey (curve, key) {\n  const byteLen = curveLengths[curve]\n\n  if (uint8ArrayEquals(!key.slice(0, 1), Uint8Array.from([4]))) {\n    throw errcode(new Error('Cannot unmarshal public key - invalid key format'), 'ERR_INVALID_KEY_FORMAT')\n  }\n\n  return {\n    kty: 'EC',\n    crv: curve,\n    x: uint8ArrayToString(key.slice(1, byteLen + 1), 'base64url'),\n    y: uint8ArrayToString(key.slice(1 + byteLen), 'base64url'),\n    ext: true\n  }\n}\n\nconst unmarshalPrivateKey = (curve, key) => ({\n  ...unmarshalPublicKey(curve, key.public),\n  d: uint8ArrayToString(key.private, 'base64url')\n})\n","'use strict'\n\nconst errcode = require('err-code')\n\nmodule.exports = function (curveTypes, type) {\n  if (!curveTypes.includes(type)) {\n    const names = curveTypes.join(' / ')\n    throw errcode(new Error(`Unknown curve: ${type}. Must be ${names}`), 'ERR_INVALID_CURVE')\n  }\n}\n","'use strict';\n\nfunction withIs(Class, { className, symbolName }) {\n    const symbol = Symbol.for(symbolName);\n\n    const ClassIsWrapper = {\n        // The code below assigns the class wrapper to an object to trick\n        // JavaScript engines to show the name of the extended class when\n        // logging an instances.\n        // We are assigning an anonymous class (class wrapper) to the object\n        // with key `className` to keep the correct name.\n        // If this is not supported it falls back to logging `ClassIsWrapper`.\n        [className]: class extends Class {\n            constructor(...args) {\n                super(...args);\n                Object.defineProperty(this, symbol, { value: true });\n            }\n\n            get [Symbol.toStringTag]() {\n                return className;\n            }\n        },\n    }[className];\n\n    ClassIsWrapper[`is${className}`] = (obj) => !!(obj && obj[symbol]);\n\n    return ClassIsWrapper;\n}\n\nfunction withIsProto(Class, { className, symbolName, withoutNew }) {\n    const symbol = Symbol.for(symbolName);\n\n    /* eslint-disable object-shorthand */\n    const ClassIsWrapper = {\n        [className]: function (...args) {\n            if (withoutNew && !(this instanceof ClassIsWrapper)) {\n                return new ClassIsWrapper(...args);\n            }\n\n            const _this = Class.call(this, ...args) || this;\n\n            if (_this && !_this[symbol]) {\n                Object.defineProperty(_this, symbol, { value: true });\n            }\n\n            return _this;\n        },\n    }[className];\n    /* eslint-enable object-shorthand */\n\n    ClassIsWrapper.prototype = Object.create(Class.prototype);\n    ClassIsWrapper.prototype.constructor = ClassIsWrapper;\n\n    Object.defineProperty(ClassIsWrapper.prototype, Symbol.toStringTag, {\n        get() {\n            return className;\n        },\n    });\n\n    ClassIsWrapper[`is${className}`] = (obj) => !!(obj && obj[symbol]);\n\n    return ClassIsWrapper;\n}\n\nmodule.exports = withIs;\nmodule.exports.proto = withIsProto;\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"libp2p-peer-id\"] || ($protobuf.roots[\"libp2p-peer-id\"] = {});\n\n$root.PeerIdProto = (function() {\n\n    /**\n     * Properties of a PeerIdProto.\n     * @exports IPeerIdProto\n     * @interface IPeerIdProto\n     * @property {Uint8Array} id PeerIdProto id\n     * @property {Uint8Array|null} [pubKey] PeerIdProto pubKey\n     * @property {Uint8Array|null} [privKey] PeerIdProto privKey\n     */\n\n    /**\n     * Constructs a new PeerIdProto.\n     * @exports PeerIdProto\n     * @classdesc Represents a PeerIdProto.\n     * @implements IPeerIdProto\n     * @constructor\n     * @param {IPeerIdProto=} [p] Properties to set\n     */\n    function PeerIdProto(p) {\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * PeerIdProto id.\n     * @member {Uint8Array} id\n     * @memberof PeerIdProto\n     * @instance\n     */\n    PeerIdProto.prototype.id = $util.newBuffer([]);\n\n    /**\n     * PeerIdProto pubKey.\n     * @member {Uint8Array} pubKey\n     * @memberof PeerIdProto\n     * @instance\n     */\n    PeerIdProto.prototype.pubKey = $util.newBuffer([]);\n\n    /**\n     * PeerIdProto privKey.\n     * @member {Uint8Array} privKey\n     * @memberof PeerIdProto\n     * @instance\n     */\n    PeerIdProto.prototype.privKey = $util.newBuffer([]);\n\n    /**\n     * Encodes the specified PeerIdProto message. Does not implicitly {@link PeerIdProto.verify|verify} messages.\n     * @function encode\n     * @memberof PeerIdProto\n     * @static\n     * @param {IPeerIdProto} m PeerIdProto message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    PeerIdProto.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        w.uint32(10).bytes(m.id);\n        if (m.pubKey != null && Object.hasOwnProperty.call(m, \"pubKey\"))\n            w.uint32(18).bytes(m.pubKey);\n        if (m.privKey != null && Object.hasOwnProperty.call(m, \"privKey\"))\n            w.uint32(26).bytes(m.privKey);\n        return w;\n    };\n\n    /**\n     * Decodes a PeerIdProto message from the specified reader or buffer.\n     * @function decode\n     * @memberof PeerIdProto\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {PeerIdProto} PeerIdProto\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    PeerIdProto.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.PeerIdProto();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.id = r.bytes();\n                break;\n            case 2:\n                m.pubKey = r.bytes();\n                break;\n            case 3:\n                m.privKey = r.bytes();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        if (!m.hasOwnProperty(\"id\"))\n            throw $util.ProtocolError(\"missing required 'id'\", { instance: m });\n        return m;\n    };\n\n    /**\n     * Creates a PeerIdProto message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof PeerIdProto\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {PeerIdProto} PeerIdProto\n     */\n    PeerIdProto.fromObject = function fromObject(d) {\n        if (d instanceof $root.PeerIdProto)\n            return d;\n        var m = new $root.PeerIdProto();\n        if (d.id != null) {\n            if (typeof d.id === \"string\")\n                $util.base64.decode(d.id, m.id = $util.newBuffer($util.base64.length(d.id)), 0);\n            else if (d.id.length)\n                m.id = d.id;\n        }\n        if (d.pubKey != null) {\n            if (typeof d.pubKey === \"string\")\n                $util.base64.decode(d.pubKey, m.pubKey = $util.newBuffer($util.base64.length(d.pubKey)), 0);\n            else if (d.pubKey.length)\n                m.pubKey = d.pubKey;\n        }\n        if (d.privKey != null) {\n            if (typeof d.privKey === \"string\")\n                $util.base64.decode(d.privKey, m.privKey = $util.newBuffer($util.base64.length(d.privKey)), 0);\n            else if (d.privKey.length)\n                m.privKey = d.privKey;\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a PeerIdProto message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof PeerIdProto\n     * @static\n     * @param {PeerIdProto} m PeerIdProto\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    PeerIdProto.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.defaults) {\n            if (o.bytes === String)\n                d.id = \"\";\n            else {\n                d.id = [];\n                if (o.bytes !== Array)\n                    d.id = $util.newBuffer(d.id);\n            }\n            if (o.bytes === String)\n                d.pubKey = \"\";\n            else {\n                d.pubKey = [];\n                if (o.bytes !== Array)\n                    d.pubKey = $util.newBuffer(d.pubKey);\n            }\n            if (o.bytes === String)\n                d.privKey = \"\";\n            else {\n                d.privKey = [];\n                if (o.bytes !== Array)\n                    d.privKey = $util.newBuffer(d.privKey);\n            }\n        }\n        if (m.id != null && m.hasOwnProperty(\"id\")) {\n            d.id = o.bytes === String ? $util.base64.encode(m.id, 0, m.id.length) : o.bytes === Array ? Array.prototype.slice.call(m.id) : m.id;\n        }\n        if (m.pubKey != null && m.hasOwnProperty(\"pubKey\")) {\n            d.pubKey = o.bytes === String ? $util.base64.encode(m.pubKey, 0, m.pubKey.length) : o.bytes === Array ? Array.prototype.slice.call(m.pubKey) : m.pubKey;\n        }\n        if (m.privKey != null && m.hasOwnProperty(\"privKey\")) {\n            d.privKey = o.bytes === String ? $util.base64.encode(m.privKey, 0, m.privKey.length) : o.bytes === Array ? Array.prototype.slice.call(m.privKey) : m.privKey;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this PeerIdProto to JSON.\n     * @function toJSON\n     * @memberof PeerIdProto\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    PeerIdProto.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return PeerIdProto;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\nconst hmac = require('./hmac')\nconst aes = require('./aes')\nconst keys = require('./keys')\n\nexports.aes = aes\nexports.hmac = hmac\nexports.keys = keys\nexports.randomBytes = require('./random-bytes')\nexports.pbkdf2 = require('./pbkdf2')\n","'use strict'\n\nconst ciphers = require('./ciphers')\nconst cipherMode = require('./cipher-mode')\n\nexports.create = async function (key, iv) { // eslint-disable-line require-await\n  const mode = cipherMode(key)\n  const cipher = ciphers.createCipheriv(mode, key, iv)\n  const decipher = ciphers.createDecipheriv(mode, key, iv)\n\n  const res = {\n    async encrypt (data) { // eslint-disable-line require-await\n      return cipher.update(data)\n    },\n\n    async decrypt (data) { // eslint-disable-line require-await\n      return decipher.update(data)\n    }\n  }\n\n  return res\n}\n","'use strict'\n\nrequire('node-forge/lib/aes')\nconst forge = require('node-forge/lib/forge')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\nmodule.exports = {\n  createCipheriv: (mode, key, iv) => {\n    const cipher2 = forge.cipher.createCipher('AES-CTR', uint8ArrayToString(key, 'ascii'))\n    cipher2.start({ iv: uint8ArrayToString(iv, 'ascii') })\n    return {\n      update: (data) => {\n        cipher2.update(forge.util.createBuffer(uint8ArrayToString(data, 'ascii')))\n        return uint8ArrayFromString(cipher2.output.getBytes(), 'ascii')\n      }\n    }\n  },\n  createDecipheriv: (mode, key, iv) => {\n    const cipher2 = forge.cipher.createDecipher('AES-CTR', uint8ArrayToString(key, 'ascii'))\n    cipher2.start({ iv: uint8ArrayToString(iv, 'ascii') })\n    return {\n      update: (data) => {\n        cipher2.update(forge.util.createBuffer(uint8ArrayToString(data, 'ascii')))\n        return uint8ArrayFromString(cipher2.output.getBytes(), 'ascii')\n      }\n    }\n  }\n}\n","'use strict'\n\nconst errcode = require('err-code')\n\nconst CIPHER_MODES = {\n  16: 'aes-128-ctr',\n  32: 'aes-256-ctr'\n}\n\nmodule.exports = function (key) {\n  const mode = CIPHER_MODES[key.length]\n  if (!mode) {\n    const modes = Object.entries(CIPHER_MODES).map(([k, v]) => `${k} (${v})`).join(' / ')\n    throw errcode(new Error(`Invalid key length ${key.length} bytes. Must be ${modes}`), 'ERR_INVALID_KEY_LENGTH')\n  }\n  return mode\n}\n","'use strict'\n\nconst forgePbkdf2 = require('node-forge/lib/pbkdf2')\nconst forgeUtil = require('node-forge/lib/util')\nconst errcode = require('err-code')\n\n/**\n * Maps an IPFS hash name to its node-forge equivalent.\n *\n * See https://github.com/multiformats/multihash/blob/master/hashtable.csv\n *\n * @private\n */\nconst hashName = {\n  sha1: 'sha1',\n  'sha2-256': 'sha256',\n  'sha2-512': 'sha512'\n}\n\n/**\n * Computes the Password-Based Key Derivation Function 2.\n *\n * @param {string} password\n * @param {string} salt\n * @param {number} iterations\n * @param {number} keySize - (in bytes)\n * @param {string} hash - The hash name ('sha1', 'sha2-512, ...)\n * @returns {string} - A new password\n */\nfunction pbkdf2 (password, salt, iterations, keySize, hash) {\n  const hasher = hashName[hash]\n  if (!hasher) {\n    const types = Object.keys(hashName).join(' / ')\n    throw errcode(new Error(`Hash '${hash}' is unknown or not supported. Must be ${types}`), 'ERR_UNSUPPORTED_HASH_TYPE')\n  }\n  const dek = forgePbkdf2(\n    password,\n    salt,\n    iterations,\n    keySize,\n    hasher)\n  return forgeUtil.encode64(dek)\n}\n\nmodule.exports = pbkdf2\n","'use strict'\n\nconst multihash = require('multihashes')\nconst multibase = require('multibase')\nconst { Multiaddr } = require('multiaddr')\nconst mafmt = require('mafmt')\nconst CID = require('cids')\nconst { URL } = require('iso-url')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nconst pathGatewayPattern = /^https?:\\/\\/[^/]+\\/(ip[fn]s)\\/([^/?#]+)/\nconst pathPattern = /^\\/(ip[fn]s)\\/([^/?#]+)/\nconst defaultProtocolMatch = 1\nconst defaultHashMath = 2\n\n// CID, libp2p-key or DNSLink\nconst subdomainGatewayPattern = /^https?:\\/\\/([^/]+)\\.(ip[fn]s)\\.[^/?]+/\nconst subdomainIdMatch = 1\nconst subdomainProtocolMatch = 2\n\n// Fully qualified domain name (FQDN) that has an explicit .tld suffix\nconst fqdnWithTld = /^(([a-z0-9]|[a-z0-9][a-z0-9-]*[a-z0-9])\\.)+([a-z0-9]|[a-z0-9][a-z0-9-]*[a-z0-9])$/\n\n/**\n * @param {*} hash\n */\nfunction isMultihash (hash) {\n  const formatted = convertToString(hash)\n  try {\n    multihash.decode(multibase.decode('z' + formatted))\n    return true\n  } catch (e) {\n    return false\n  }\n}\n\n/**\n * @param {*} hash\n */\nfunction isMultibase (hash) {\n  try {\n    return multibase.isEncoded(hash)\n  } catch (e) {\n    return false\n  }\n}\n\n/**\n * @param {*} hash\n */\nfunction isCID (hash) {\n  try {\n    new CID(hash) // eslint-disable-line no-new\n    return true\n  } catch (e) {\n    return false\n  }\n}\n\n/**\n * @param {*} input\n */\nfunction isMultiaddr (input) {\n  if (!input) return false\n  if (Multiaddr.isMultiaddr(input)) return true\n  try {\n    new Multiaddr(input) // eslint-disable-line no-new\n    return true\n  } catch (e) {\n    return false\n  }\n}\n\n/**\n * @param {string | Uint8Array | Multiaddr} input\n */\nfunction isPeerMultiaddr (input) {\n  return isMultiaddr(input) && mafmt.P2P.matches(input)\n}\n\n/**\n * @param {string | Uint8Array} input\n * @param {RegExp | string} pattern\n * @param {number} [protocolMatch=1]\n * @param {number} [hashMatch=2]\n */\nfunction isIpfs (input, pattern, protocolMatch = defaultProtocolMatch, hashMatch = defaultHashMath) {\n  const formatted = convertToString(input)\n  if (!formatted) {\n    return false\n  }\n\n  const match = formatted.match(pattern)\n  if (!match) {\n    return false\n  }\n\n  if (match[protocolMatch] !== 'ipfs') {\n    return false\n  }\n\n  let hash = match[hashMatch]\n\n  if (hash && pattern === subdomainGatewayPattern) {\n    // when doing checks for subdomain context\n    // ensure hash is case-insensitive\n    // (browsers force-lowercase authority component anyway)\n    hash = hash.toLowerCase()\n  }\n\n  return isCID(hash)\n}\n\n/**\n *\n * @param {string | Uint8Array} input\n * @param {string | RegExp} pattern\n * @param {number} [protocolMatch=1]\n * @param {number} [hashMatch=1]\n */\nfunction isIpns (input, pattern, protocolMatch = defaultProtocolMatch, hashMatch = defaultHashMath) {\n  const formatted = convertToString(input)\n  if (!formatted) {\n    return false\n  }\n  const match = formatted.match(pattern)\n  if (!match) {\n    return false\n  }\n\n  if (match[protocolMatch] !== 'ipns') {\n    return false\n  }\n\n  let ipnsId = match[hashMatch]\n\n  if (ipnsId && pattern === subdomainGatewayPattern) {\n    // when doing checks for subdomain context\n    // ensure ipnsId is case-insensitive\n    // (browsers force-lowercase authority compotent anyway)\n    ipnsId = ipnsId.toLowerCase()\n    // Check if it is cidv1\n    if (isCID(ipnsId)) return true\n    // Check if it looks like FQDN\n    try {\n      if (!ipnsId.includes('.') && ipnsId.includes('-')) {\n        // name without tld, assuming its inlined into a single DNS label\n        // (https://github.com/ipfs/in-web-browsers/issues/169)\n        // en-wikipedia--on--ipfs-org → en.wikipedia-on-ipfs.org\n        ipnsId = ipnsId.replace(/--/g, '@').replace(/-/g, '.').replace(/@/g, '-')\n      }\n      // URL implementation in web browsers forces lowercase of the hostname\n      const { hostname } = new URL(`http://${ipnsId}`) // eslint-disable-line no-new\n      // Check if potential FQDN has an explicit TLD\n      return fqdnWithTld.test(hostname)\n    } catch (e) {\n      return false\n    }\n  }\n\n  return true\n}\n\n/**\n * @param {any} input\n */\nfunction isString (input) {\n  return typeof input === 'string'\n}\n\n/**\n * @param {Uint8Array | string} input\n */\nfunction convertToString (input) {\n  if (input instanceof Uint8Array) {\n    return uint8ArrayToString(input, 'base58btc')\n  }\n\n  if (isString(input)) {\n    return input\n  }\n\n  return false\n}\n\n/**\n * @param {string | Uint8Array} url\n */\nconst ipfsSubdomain = (url) => isIpfs(url, subdomainGatewayPattern, subdomainProtocolMatch, subdomainIdMatch)\n/**\n * @param {string | Uint8Array} url\n */\nconst ipnsSubdomain = (url) => isIpns(url, subdomainGatewayPattern, subdomainProtocolMatch, subdomainIdMatch)\n/**\n * @param {string | Uint8Array} url\n */\nconst subdomain = (url) => ipfsSubdomain(url) || ipnsSubdomain(url)\n\n/**\n * @param {string | Uint8Array} url\n */\nconst ipfsUrl = (url) => isIpfs(url, pathGatewayPattern) || ipfsSubdomain(url)\n/**\n * @param {string | Uint8Array} url\n */\nconst ipnsUrl = (url) => isIpns(url, pathGatewayPattern) || ipnsSubdomain(url)\n/**\n * @param {string | Uint8Array} url\n */\nconst url = (url) => ipfsUrl(url) || ipnsUrl(url) || subdomain(url)\n\n/**\n * @param {string | Uint8Array} path\n */\nconst path = (path) => isIpfs(path, pathPattern) || isIpns(path, pathPattern)\n\nmodule.exports = {\n  multihash: isMultihash,\n  multiaddr: isMultiaddr,\n  peerMultiaddr: isPeerMultiaddr,\n  cid: isCID,\n  /**\n   * @param {CID | string | Uint8Array} cid\n   */\n  base32cid: (cid) => (isMultibase(cid) === 'base32' && isCID(cid)),\n  ipfsSubdomain,\n  ipnsSubdomain,\n  subdomain,\n  subdomainGatewayPattern,\n  ipfsUrl,\n  ipnsUrl,\n  url,\n  pathGatewayPattern: pathGatewayPattern,\n  /**\n   * @param {string | Uint8Array} path\n   */\n  ipfsPath: (path) => isIpfs(path, pathPattern),\n  /**\n   * @param {string | Uint8Array} path\n   */\n  ipnsPath: (path) => isIpns(path, pathPattern),\n  path,\n  pathPattern,\n  /**\n   * @param {string | Uint8Array} x\n   */\n  urlOrPath: (x) => url(x) || path(x),\n  /**\n   * @param {string | Uint8Array | CID} path\n   */\n  cidPath: path => isString(path) && !isCID(path) && isIpfs(`/ipfs/${path}`, pathPattern)\n}\n","'use strict'\n\nconst codec = require('./codec')\nconst protocols = require('./protocols-table')\nconst varint = require('varint')\nconst CID = require('cids')\nconst errCode = require('err-code')\nconst inspect = Symbol.for('nodejs.util.inspect.custom')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\n/**\n * @typedef {(addr: Multiaddr) => Promise<string[]>} Resolver\n * @typedef {string | Multiaddr | Uint8Array | null} MultiaddrInput\n * @typedef {import('./types').MultiaddrObject} MultiaddrObject\n * @typedef {import('./types').Protocol} Protocol\n */\n\n/** @type {Map<string, Resolver>} */\nconst resolvers = new Map()\nconst symbol = Symbol.for('@multiformats/js-multiaddr/multiaddr')\n\n/**\n * Creates a [multiaddr](https://github.com/multiformats/multiaddr) from\n * a Uint8Array, String or another Multiaddr instance\n * public key.\n *\n */\nclass Multiaddr {\n  /**\n   * @example\n   * ```js\n   * new Multiaddr('/ip4/127.0.0.1/tcp/4001')\n   * // <Multiaddr 047f000001060fa1 - /ip4/127.0.0.1/tcp/4001>\n   * ```\n   *\n   * @param {MultiaddrInput} [addr] - If String or Uint8Array, needs to adhere to the address format of a [multiaddr](https://github.com/multiformats/multiaddr#string-format)\n   */\n  constructor (addr) {\n    // default\n    if (addr == null) {\n      addr = ''\n    }\n\n    // Define symbol\n    Object.defineProperty(this, symbol, { value: true })\n\n    if (addr instanceof Uint8Array) {\n      /** @type {Uint8Array} - The raw bytes representing this multiaddress */\n      this.bytes = codec.fromBytes(addr)\n    } else if (typeof addr === 'string') {\n      if (addr.length > 0 && addr.charAt(0) !== '/') {\n        throw new Error(`multiaddr \"${addr}\" must start with a \"/\"`)\n      }\n      this.bytes = codec.fromString(addr)\n    } else if (Multiaddr.isMultiaddr(addr)) { // Multiaddr\n      this.bytes = codec.fromBytes(addr.bytes) // validate + copy buffer\n    } else {\n      throw new Error('addr must be a string, Buffer, or another Multiaddr')\n    }\n  }\n\n  /**\n   * Returns Multiaddr as a String\n   *\n   * @example\n   * ```js\n   * new Multiaddr('/ip4/127.0.0.1/tcp/4001').toString()\n   * // '/ip4/127.0.0.1/tcp/4001'\n   * ```\n   */\n  toString () {\n    return codec.bytesToString(this.bytes)\n  }\n\n  /**\n   * Returns Multiaddr as a JSON encoded object\n   *\n   * @example\n   * ```js\n   * JSON.stringify(new Multiaddr('/ip4/127.0.0.1/tcp/4001'))\n   * // '/ip4/127.0.0.1/tcp/4001'\n   * ```\n   */\n  toJSON () {\n    return this.toString()\n  }\n\n  /**\n   * Returns Multiaddr as a convinient options object to be used with net.createConnection\n   *\n   * @example\n   * ```js\n   * new Multiaddr('/ip4/127.0.0.1/tcp/4001').toOptions()\n   * // { family: 4, host: '127.0.0.1', transport: 'tcp', port: 4001 }\n   * ```\n   */\n  toOptions () {\n    /** @type {MultiaddrObject} */\n    const opts = {}\n    const parsed = this.toString().split('/')\n    opts.family = parsed[1] === 'ip4' ? 4 : 6\n    opts.host = parsed[2]\n    opts.transport = parsed[3]\n    opts.port = parseInt(parsed[4])\n    return opts\n  }\n\n  /**\n   * Returns the protocols the Multiaddr is defined with, as an array of objects, in\n   * left-to-right order. Each object contains the protocol code, protocol name,\n   * and the size of its address space in bits.\n   * [See list of protocols](https://github.com/multiformats/multiaddr/blob/master/protocols.csv)\n   *\n   * @example\n   * ```js\n   * new Multiaddr('/ip4/127.0.0.1/tcp/4001').protos()\n   * // [ { code: 4, size: 32, name: 'ip4' },\n   * //   { code: 6, size: 16, name: 'tcp' } ]\n   * ```\n   *\n   * @returns {Protocol[]} protocols - All the protocols the address is composed of\n   */\n  protos () {\n    return this.protoCodes().map(code => Object.assign({}, protocols(code)))\n  }\n\n  /**\n   * Returns the codes of the protocols in left-to-right order.\n   * [See list of protocols](https://github.com/multiformats/multiaddr/blob/master/protocols.csv)\n   *\n   * @example\n   * ```js\n   * Multiaddr('/ip4/127.0.0.1/tcp/4001').protoCodes()\n   * // [ 4, 6 ]\n   * ```\n   *\n   * @returns {number[]} protocol codes\n   */\n  protoCodes () {\n    const codes = []\n    const buf = this.bytes\n    let i = 0\n    while (i < buf.length) {\n      const code = varint.decode(buf, i)\n      const n = varint.decode.bytes\n\n      const p = protocols(code)\n      const size = codec.sizeForAddr(p, buf.slice(i + n))\n\n      i += (size + n)\n      codes.push(code)\n    }\n\n    return codes\n  }\n\n  /**\n   * Returns the names of the protocols in left-to-right order.\n   * [See list of protocols](https://github.com/multiformats/multiaddr/blob/master/protocols.csv)\n   *\n   * @example\n   * ```js\n   * new Multiaddr('/ip4/127.0.0.1/tcp/4001').protoNames()\n   * // [ 'ip4', 'tcp' ]\n   * ```\n   *\n   * @returns {string[]} protocol names\n   */\n  protoNames () {\n    return this.protos().map(proto => proto.name)\n  }\n\n  /**\n   * Returns a tuple of parts\n   *\n   * @example\n   * ```js\n   * new Multiaddr(\"/ip4/127.0.0.1/tcp/4001\").tuples()\n   * // [ [ 4, <Buffer 7f 00 00 01> ], [ 6, <Buffer 0f a1> ] ]\n   * ```\n   */\n  tuples () {\n    return codec.bytesToTuples(this.bytes)\n  }\n\n  /**\n   * Returns a tuple of string/number parts\n   * - tuples[][0] = code of protocol\n   * - tuples[][1] = contents of address\n   *\n   * @example\n   * ```js\n   * new Multiaddr(\"/ip4/127.0.0.1/tcp/4001\").stringTuples()\n   * // [ [ 4, '127.0.0.1' ], [ 6, '4001' ] ]\n   * ```\n   */\n  stringTuples () {\n    const t = codec.bytesToTuples(this.bytes)\n    return codec.tuplesToStringTuples(t)\n  }\n\n  /**\n   * Encapsulates a Multiaddr in another Multiaddr\n   *\n   * @example\n   * ```js\n   * const mh1 = new Multiaddr('/ip4/8.8.8.8/tcp/1080')\n   * // <Multiaddr 0408080808060438 - /ip4/8.8.8.8/tcp/1080>\n   *\n   * const mh2 = new Multiaddr('/ip4/127.0.0.1/tcp/4001')\n   * // <Multiaddr 047f000001060fa1 - /ip4/127.0.0.1/tcp/4001>\n   *\n   * const mh3 = mh1.encapsulate(mh2)\n   * // <Multiaddr 0408080808060438047f000001060fa1 - /ip4/8.8.8.8/tcp/1080/ip4/127.0.0.1/tcp/4001>\n   *\n   * mh3.toString()\n   * // '/ip4/8.8.8.8/tcp/1080/ip4/127.0.0.1/tcp/4001'\n   * ```\n   *\n   * @param {MultiaddrInput} addr - Multiaddr to add into this Multiaddr\n   */\n  encapsulate (addr) {\n    addr = new Multiaddr(addr)\n    return new Multiaddr(this.toString() + addr.toString())\n  }\n\n  /**\n   * Decapsulates a Multiaddr from another Multiaddr\n   *\n   * @example\n   * ```js\n   * const mh1 = new Multiaddr('/ip4/8.8.8.8/tcp/1080')\n   * // <Multiaddr 0408080808060438 - /ip4/8.8.8.8/tcp/1080>\n   *\n   * const mh2 = new Multiaddr('/ip4/127.0.0.1/tcp/4001')\n   * // <Multiaddr 047f000001060fa1 - /ip4/127.0.0.1/tcp/4001>\n   *\n   * const mh3 = mh1.encapsulate(mh2)\n   * // <Multiaddr 0408080808060438047f000001060fa1 - /ip4/8.8.8.8/tcp/1080/ip4/127.0.0.1/tcp/4001>\n   *\n   * mh3.decapsulate(mh2).toString()\n   * // '/ip4/8.8.8.8/tcp/1080'\n   * ```\n   *\n   * @param {Multiaddr | string} addr - Multiaddr to remove from this Multiaddr\n   * @returns {Multiaddr}\n   */\n  decapsulate (addr) {\n    const addrString = addr.toString()\n    const s = this.toString()\n    const i = s.lastIndexOf(addrString)\n    if (i < 0) {\n      throw new Error('Address ' + this + ' does not contain subaddress: ' + addr)\n    }\n    return new Multiaddr(s.slice(0, i))\n  }\n\n  /**\n   * A more reliable version of `decapsulate` if you are targeting a\n   * specific code, such as 421 (the `p2p` protocol code). The last index of the code\n   * will be removed from the `Multiaddr`, and a new instance will be returned.\n   * If the code is not present, the original `Multiaddr` is returned.\n   *\n   * @example\n   * ```js\n   * const addr = new Multiaddr('/ip4/0.0.0.0/tcp/8080/p2p/QmcgpsyWgH8Y8ajJz1Cu72KnS5uo2Aa2LpzU7kinSupNKC')\n   * // <Multiaddr 0400... - /ip4/0.0.0.0/tcp/8080/p2p/QmcgpsyWgH8Y8ajJz1Cu72KnS5uo2Aa2LpzU7kinSupNKC>\n   *\n   * addr.decapsulateCode(421).toString()\n   * // '/ip4/0.0.0.0/tcp/8080'\n   *\n   * new Multiaddr('/ip4/127.0.0.1/tcp/8080').decapsulateCode(421).toString()\n   * // '/ip4/127.0.0.1/tcp/8080'\n   * ```\n   *\n   * @param {number} code - The code of the protocol to decapsulate from this Multiaddr\n   * @returns {Multiaddr}\n   */\n  decapsulateCode (code) {\n    const tuples = this.tuples()\n    for (let i = tuples.length - 1; i >= 0; i--) {\n      if (tuples[i][0] === code) {\n        return new Multiaddr(codec.tuplesToBytes(tuples.slice(0, i)))\n      }\n    }\n    return this\n  }\n\n  /**\n   * Extract the peerId if the multiaddr contains one\n   *\n   * @example\n   * ```js\n   * const mh1 = new Multiaddr('/ip4/8.8.8.8/tcp/1080/ipfs/QmValidBase58string')\n   * // <Multiaddr 0408080808060438 - /ip4/8.8.8.8/tcp/1080/ipfs/QmValidBase58string>\n   *\n   * // should return QmValidBase58string or null if the id is missing or invalid\n   * const peerId = mh1.getPeerId()\n   * ```\n   *\n   * @returns {string | null} peerId - The id of the peer or null if invalid or missing from the ma\n   */\n  getPeerId () {\n    try {\n      const tuples = this.stringTuples().filter((tuple) => {\n        if (tuple[0] === protocols.names.ipfs.code) {\n          return true\n        }\n        return false\n      })\n\n      // Get the last ipfs tuple ['ipfs', 'peerid string']\n      const tuple = tuples.pop()\n      if (tuple && tuple[1]) {\n        // Get multihash, unwrap from CID if needed\n        return uint8ArrayToString(new CID(tuple[1]).multihash, 'base58btc')\n      } else {\n        return null\n      }\n    } catch (e) {\n      return null\n    }\n  }\n\n  /**\n   * Extract the path if the multiaddr contains one\n   *\n   * @example\n   * ```js\n   * const mh1 = new Multiaddr('/ip4/8.8.8.8/tcp/1080/unix/tmp/p2p.sock')\n   * // <Multiaddr 0408080808060438 - /ip4/8.8.8.8/tcp/1080/unix/tmp/p2p.sock>\n   *\n   * // should return utf8 string or null if the id is missing or invalid\n   * const path = mh1.getPath()\n   * ```js\n   *\n   * @returns {string | null} path - The path of the multiaddr, or null if no path protocol is present\n   */\n  getPath () {\n    let path = null\n    try {\n      path = this.stringTuples().filter((tuple) => {\n        const proto = protocols(tuple[0])\n        if (proto.path) {\n          return true\n        }\n        return false\n      })[0][1]\n\n      if (!path) {\n        path = null\n      }\n    } catch (e) {\n      path = null\n    }\n    return path\n  }\n\n  /**\n   * Checks if two Multiaddrs are the same\n   *\n   * @example\n   * ```js\n   * const mh1 = new Multiaddr('/ip4/8.8.8.8/tcp/1080')\n   * // <Multiaddr 0408080808060438 - /ip4/8.8.8.8/tcp/1080>\n   *\n   * const mh2 = new Multiaddr('/ip4/127.0.0.1/tcp/4001')\n   * // <Multiaddr 047f000001060fa1 - /ip4/127.0.0.1/tcp/4001>\n   *\n   * mh1.equals(mh1)\n   * // true\n   *\n   * mh1.equals(mh2)\n   * // false\n   * ```\n   *\n   * @param {Multiaddr} addr\n   * @returns {boolean}\n   */\n  equals (addr) {\n    return uint8ArrayEquals(this.bytes, addr.bytes)\n  }\n\n  /**\n   * Resolve multiaddr if containing resolvable hostname.\n   *\n   * @example\n   * ```js\n   * Multiaddr.resolvers.set('dnsaddr', resolverFunction)\n   * const mh1 = new Multiaddr('/dnsaddr/bootstrap.libp2p.io/p2p/QmbLHAnMoJPWSCR5Zhtx6BHJX9KiKNN6tpvbUcqanj75Nb')\n   * const resolvedMultiaddrs = await mh1.resolve()\n   * // [\n   * //   <Multiaddr 04934b5353060fa1a503221220c10f9319dac35c270a6b74cd644cb3acfc1f6efc8c821f8eb282599fd1814f64 - /ip4/147.75.83.83/tcp/4001/p2p/QmbLHAnMoJPWSCR5Zhtx6BHJX9KiKNN6tpvbUcqanj75Nb>,\n   * //   <Multiaddr 04934b53530601bbde03a503221220c10f9319dac35c270a6b74cd644cb3acfc1f6efc8c821f8eb282599fd1814f64 - /ip4/147.75.83.83/tcp/443/wss/p2p/QmbLHAnMoJPWSCR5Zhtx6BHJX9KiKNN6tpvbUcqanj75Nb>,\n   * //   <Multiaddr 04934b535391020fa1cc03a503221220c10f9319dac35c270a6b74cd644cb3acfc1f6efc8c821f8eb282599fd1814f64 - /ip4/147.75.83.83/udp/4001/quic/p2p/QmbLHAnMoJPWSCR5Zhtx6BHJX9KiKNN6tpvbUcqanj75Nb>\n   * // ]\n   * ```\n   *\n   * @returns {Promise<Array<Multiaddr>>}\n   */\n  async resolve () {\n    const resolvableProto = this.protos().find((p) => p.resolvable)\n\n    // Multiaddr is not resolvable?\n    if (!resolvableProto) {\n      return [this]\n    }\n\n    const resolver = resolvers.get(resolvableProto.name)\n    if (!resolver) {\n      throw errCode(new Error(`no available resolver for ${resolvableProto.name}`), 'ERR_NO_AVAILABLE_RESOLVER')\n    }\n\n    const addresses = await resolver(this)\n    return addresses.map((a) => new Multiaddr(a))\n  }\n\n  /**\n   * Gets a Multiaddrs node-friendly address object. Note that protocol information\n   * is left out: in Node (and most network systems) the protocol is unknowable\n   * given only the address.\n   *\n   * Has to be a ThinWaist Address, otherwise throws error\n   *\n   * @example\n   * ```js\n   * new Multiaddr('/ip4/127.0.0.1/tcp/4001').nodeAddress()\n   * // {family: 4, address: '127.0.0.1', port: 4001}\n   * ```\n   *\n   * @returns {{family: 4 | 6, address: string, port: number}}\n   * @throws {Error} Throws error if Multiaddr is not a Thin Waist address\n   */\n  nodeAddress () {\n    const codes = this.protoCodes()\n    const names = this.protoNames()\n    const parts = this.toString().split('/').slice(1)\n\n    if (parts.length < 4) {\n      throw new Error('multiaddr must have a valid format: \"/{ip4, ip6, dns4, dns6}/{address}/{tcp, udp}/{port}\".')\n    } else if (codes[0] !== 4 && codes[0] !== 41 && codes[0] !== 54 && codes[0] !== 55) {\n      throw new Error(`no protocol with name: \"'${names[0]}'\". Must have a valid family name: \"{ip4, ip6, dns4, dns6}\".`)\n    } else if (parts[2] !== 'tcp' && parts[2] !== 'udp') {\n      throw new Error(`no protocol with name: \"'${names[1]}'\". Must have a valid transport protocol: \"{tcp, udp}\".`)\n    }\n\n    return {\n      family: (codes[0] === 41 || codes[0] === 55) ? 6 : 4,\n      address: parts[1],\n      port: parseInt(parts[3]) // tcp or udp port\n    }\n  }\n\n  /**\n   * Returns if a Multiaddr is a Thin Waist address or not.\n   *\n   * Thin Waist is if a Multiaddr adheres to the standard combination of:\n   *\n   * `{IPv4, IPv6}/{TCP, UDP}`\n   *\n   * @example\n   * ```js\n   * const mh1 = new Multiaddr('/ip4/127.0.0.1/tcp/4001')\n   * // <Multiaddr 047f000001060fa1 - /ip4/127.0.0.1/tcp/4001>\n   * const mh2 = new Multiaddr('/ip4/192.168.2.1/tcp/5001')\n   * // <Multiaddr 04c0a80201061389 - /ip4/192.168.2.1/tcp/5001>\n   * const mh3 = mh1.encapsulate(mh2)\n   * // <Multiaddr 047f000001060fa104c0a80201061389 - /ip4/127.0.0.1/tcp/4001/ip4/192.168.2.1/tcp/5001>\n   * const mh4 = new Multiaddr('/ip4/127.0.0.1/tcp/2000/wss/p2p-webrtc-star/p2p/QmcgpsyWgH8Y8ajJz1Cu72KnS5uo2Aa2LpzU7kinSooo2a')\n   * // <Multiaddr 047f0000010607d0de039302a503221220d52ebb89d85b02a284948203a62ff28389c57c9f42beec4ec20db76a64835843 - /ip4/127.0.0.1/tcp/2000/wss/p2p-webrtc-star/p2p/QmcgpsyWgH8Y8ajJz1Cu72KnS5uo2Aa2LpzU7kinSooo2a>\n   * mh1.isThinWaistAddress()\n   * // true\n   * mh2.isThinWaistAddress()\n   * // true\n   * mh3.isThinWaistAddress()\n   * // false\n   * mh4.isThinWaistAddress()\n   * // false\n   * ```\n   *\n   * @param {Multiaddr} [addr] - Defaults to using `this` instance\n   */\n  isThinWaistAddress (addr) {\n    const protos = (addr || this).protos()\n\n    if (protos.length !== 2) {\n      return false\n    }\n\n    if (protos[0].code !== 4 && protos[0].code !== 41) {\n      return false\n    }\n    if (protos[1].code !== 6 && protos[1].code !== 273) {\n      return false\n    }\n    return true\n  }\n\n  /**\n   * Creates a Multiaddr from a node-friendly address object\n   *\n   * @example\n   * ```js\n   * Multiaddr.fromNodeAddress({address: '127.0.0.1', port: '4001'}, 'tcp')\n   * // <Multiaddr 047f000001060fa1 - /ip4/127.0.0.1/tcp/4001>\n   * ```\n   *\n   * @param {{family: 4 | 6, address: string, port: number}} addr\n   * @param {string} transport\n   */\n  static fromNodeAddress (addr, transport) {\n    if (!addr) { throw new Error('requires node address object') }\n    if (!transport) { throw new Error('requires transport protocol') }\n    let ip\n    switch (addr.family) {\n      case 4:\n        ip = 'ip4'\n        break\n      case 6:\n        ip = 'ip6'\n        break\n      default:\n        throw Error(`Invalid addr family. Got '${addr.family}' instead of 4 or 6`)\n    }\n    return new Multiaddr('/' + [ip, addr.address, transport, addr.port].join('/'))\n  }\n\n  /**\n   * Returns if something is a Multiaddr that is a name\n   *\n   * @param {Multiaddr} addr\n   * @returns {boolean} isName\n   */\n  static isName (addr) {\n    if (!Multiaddr.isMultiaddr(addr)) {\n      return false\n    }\n\n    // if a part of the multiaddr is resolvable, then return true\n    return addr.protos().some((proto) => proto.resolvable)\n  }\n\n  /**\n   * Check if object is a CID instance\n   *\n   * @param {any} value\n   * @returns {value is Multiaddr}\n   */\n  static isMultiaddr (value) {\n    return value instanceof Multiaddr || Boolean(value && value[symbol])\n  }\n\n  /**\n   * Returns Multiaddr as a human-readable string.\n   * For post Node.js v10.0.0.\n   * https://nodejs.org/api/deprecations.html#deprecations_dep0079_custom_inspection_function_on_objects_via_inspect\n   *\n   * @example\n   * ```js\n   * console.log(new Multiaddr('/ip4/127.0.0.1/tcp/4001'))\n   * // '<Multiaddr 047f000001060fa1 - /ip4/127.0.0.1/tcp/4001>'\n   * ```\n   *\n   * @returns {string}\n   */\n  [inspect] () {\n    return '<Multiaddr ' +\n    uint8ArrayToString(this.bytes, 'base16') + ' - ' +\n    codec.bytesToString(this.bytes) + '>'\n  }\n\n  /**\n   * Returns Multiaddr as a human-readable string.\n   * Fallback for pre Node.js v10.0.0.\n   * https://nodejs.org/api/deprecations.html#deprecations_dep0079_custom_inspection_function_on_objects_via_inspect\n   *\n   * @example\n   * ```js\n   * new Multiaddr('/ip4/127.0.0.1/tcp/4001').inspect()\n   * // '<Multiaddr 047f000001060fa1 - /ip4/127.0.0.1/tcp/4001>'\n   * ```\n   *\n   * @returns {string}\n   */\n  inspect () {\n    return '<Multiaddr ' +\n      uint8ArrayToString(this.bytes, 'base16') + ' - ' +\n      codec.bytesToString(this.bytes) + '>'\n  }\n}\n\n/**\n * Object containing table, names and codes of all supported protocols.\n * To get the protocol values from a Multiaddr, you can use\n * [`.protos()`](#multiaddrprotos),\n * [`.protoCodes()`](#multiaddrprotocodes) or\n * [`.protoNames()`](#multiaddrprotonames)\n *\n * @returns {{table: Array, names: Object, codes: Object}}\n */\nMultiaddr.protocols = protocols\n\nMultiaddr.resolvers = resolvers\n\n/**\n * Static factory\n *\n * @param {MultiaddrInput} addr\n */\nfunction multiaddr (addr) {\n  return new Multiaddr(addr)\n}\n\nmodule.exports = { Multiaddr, multiaddr, protocols, resolvers }\n","'use strict'\n\nconst convert = require('./convert')\nconst protocols = require('./protocols-table')\nconst varint = require('varint')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\n// export codec\nmodule.exports = {\n  stringToStringTuples,\n  stringTuplesToString,\n\n  tuplesToStringTuples,\n  stringTuplesToTuples,\n\n  bytesToTuples,\n  tuplesToBytes,\n\n  bytesToString,\n  stringToBytes,\n\n  fromString,\n  fromBytes,\n  validateBytes,\n  isValidBytes,\n  cleanPath,\n\n  ParseError,\n  protoFromTuple,\n\n  sizeForAddr\n}\n\n// string -> [[str name, str addr]... ]\n/**\n * @param {string} str\n */\nfunction stringToStringTuples (str) {\n  const tuples = []\n  const parts = str.split('/').slice(1) // skip first empty elem\n  if (parts.length === 1 && parts[0] === '') {\n    return []\n  }\n\n  for (let p = 0; p < parts.length; p++) {\n    const part = parts[p]\n    const proto = protocols(part)\n\n    if (proto.size === 0) {\n      tuples.push([part])\n      continue\n    }\n\n    p++ // advance addr part\n    if (p >= parts.length) {\n      throw ParseError('invalid address: ' + str)\n    }\n\n    // if it's a path proto, take the rest\n    if (proto.path) {\n      tuples.push([\n        part,\n        // TODO: should we need to check each path part to see if it's a proto?\n        // This would allow for other protocols to be added after a unix path,\n        // however it would have issues if the path had a protocol name in the path\n        cleanPath(parts.slice(p).join('/'))\n      ])\n      break\n    }\n\n    tuples.push([part, parts[p]])\n  }\n\n  return tuples\n}\n\n// [[str name, str addr]... ] -> string\n/**\n * @param {[number, string?][]} tuples\n */\nfunction stringTuplesToString (tuples) {\n  /** @type {Array<string | undefined>} */\n  const parts = []\n  tuples.map((tup) => {\n    const proto = protoFromTuple(tup)\n    parts.push(proto.name)\n    if (tup.length > 1) {\n      parts.push(tup[1])\n    }\n    return null\n  })\n\n  return cleanPath(parts.join('/'))\n}\n\n// [[str name, str addr]... ] -> [[int code, Uint8Array]... ]\n/**\n * @param {Array<string[] | string >} tuples\n * @returns {[number , Uint8Array?][]}\n */\nfunction stringTuplesToTuples (tuples) {\n  return tuples.map((tup) => {\n    if (!Array.isArray(tup)) {\n      tup = [tup]\n    }\n    const proto = protoFromTuple(tup)\n    if (tup.length > 1) {\n      return [proto.code, convert.toBytes(proto.code, tup[1])]\n    }\n    return [proto.code]\n  })\n}\n\n/**\n * Convert tuples to string tuples\n *\n * [[int code, Uint8Array]... ] -> [[int code, str addr]... ]\n *\n * @param {Array<[number, Uint8Array?]>} tuples\n * @returns {Array<[number, string?]>}\n */\n\nfunction tuplesToStringTuples (tuples) {\n  return tuples.map(tup => {\n    const proto = protoFromTuple(tup)\n    if (tup[1]) {\n      return [proto.code, convert.toString(proto.code, tup[1])]\n    }\n    return [proto.code]\n  })\n}\n\n// [[int code, Uint8Array ]... ] -> Uint8Array\n/**\n * @param {[number, Uint8Array?][]} tuples\n */\nfunction tuplesToBytes (tuples) {\n  return fromBytes(uint8ArrayConcat(tuples.map((/** @type {any[]} */ tup) => {\n    const proto = protoFromTuple(tup)\n    let buf = Uint8Array.from(varint.encode(proto.code))\n\n    if (tup.length > 1) {\n      buf = uint8ArrayConcat([buf, tup[1]]) // add address buffer\n    }\n\n    return buf\n  })))\n}\n\n/**\n * @param {import(\"./types\").Protocol} p\n * @param {Uint8Array | number[]} addr\n */\nfunction sizeForAddr (p, addr) {\n  if (p.size > 0) {\n    return p.size / 8\n  } else if (p.size === 0) {\n    return 0\n  } else {\n    const size = varint.decode(addr)\n    return size + varint.decode.bytes\n  }\n}\n\n/**\n *\n * @param {Uint8Array} buf\n * @returns {Array<[number, Uint8Array?]>}\n */\nfunction bytesToTuples (buf) {\n  /** @type {Array<[number, Uint8Array?]>} */\n  const tuples = []\n  let i = 0\n  while (i < buf.length) {\n    const code = varint.decode(buf, i)\n    const n = varint.decode.bytes\n\n    const p = protocols(code)\n\n    const size = sizeForAddr(p, buf.slice(i + n))\n\n    if (size === 0) {\n      tuples.push([code])\n      i += n\n      continue\n    }\n\n    const addr = buf.slice(i + n, i + n + size)\n\n    i += (size + n)\n\n    if (i > buf.length) { // did not end _exactly_ at buffer.length\n      throw ParseError('Invalid address Uint8Array: ' + uint8ArrayToString(buf, 'base16'))\n    }\n\n    // ok, tuple seems good.\n    tuples.push([code, addr])\n  }\n\n  return tuples\n}\n\n// Uint8Array -> String\n/**\n * @param {Uint8Array} buf\n */\nfunction bytesToString (buf) {\n  const a = bytesToTuples(buf)\n  const b = tuplesToStringTuples(a)\n  return stringTuplesToString(b)\n}\n\n// String -> Uint8Array\n/**\n * @param {string} str\n */\nfunction stringToBytes (str) {\n  str = cleanPath(str)\n  const a = stringToStringTuples(str)\n  const b = stringTuplesToTuples(a)\n\n  return tuplesToBytes(b)\n}\n\n// String -> Uint8Array\n/**\n * @param {string} str\n */\nfunction fromString (str) {\n  return stringToBytes(str)\n}\n\n// Uint8Array -> Uint8Array\n/**\n * @param {Uint8Array} buf\n */\nfunction fromBytes (buf) {\n  const err = validateBytes(buf)\n  if (err) throw err\n  return Uint8Array.from(buf) // copy\n}\n\n/**\n * @param {Uint8Array} buf\n */\nfunction validateBytes (buf) {\n  try {\n    bytesToTuples(buf) // try to parse. will throw if breaks\n  } catch (err) {\n    return err\n  }\n}\n\n/**\n * @param {Uint8Array} buf\n */\nfunction isValidBytes (buf) {\n  return validateBytes(buf) === undefined\n}\n\n/**\n * @param {string} str\n */\nfunction cleanPath (str) {\n  return '/' + str.trim().split('/').filter((/** @type {any} */ a) => a).join('/')\n}\n\n/**\n * @param {string} str\n */\nfunction ParseError (str) {\n  return new Error('Error parsing address: ' + str)\n}\n\n/**\n * @param {any[]} tup\n */\nfunction protoFromTuple (tup) {\n  const proto = protocols(tup[0])\n  return proto\n}\n","'use strict'\n\nconst ip = require('./ip')\nconst protocols = require('./protocols-table')\nconst CID = require('cids')\nconst multibase = require('multibase')\nconst varint = require('varint')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayConcat = require('uint8arrays/concat')\n\nmodule.exports = Convert\n\n// converts (serializes) addresses\n/**\n * @param {string} proto\n * @param {string | Uint8Array} a\n */\nfunction Convert (proto, a) {\n  if (a instanceof Uint8Array) {\n    return Convert.toString(proto, a)\n  } else {\n    return Convert.toBytes(proto, a)\n  }\n}\n\n/**\n * Convert [code,Uint8Array] to string\n *\n * @param {number|string} proto\n * @param {Uint8Array} buf\n * @returns {string}\n */\nConvert.toString = function convertToString (proto, buf) {\n  const protocol = protocols(proto)\n  switch (protocol.code) {\n    case 4: // ipv4\n    case 41: // ipv6\n      return bytes2ip(buf)\n\n    case 6: // tcp\n    case 273: // udp\n    case 33: // dccp\n    case 132: // sctp\n      return bytes2port(buf).toString()\n\n    case 53: // dns\n    case 54: // dns4\n    case 55: // dns6\n    case 56: // dnsaddr\n    case 400: // unix\n    case 777: // memory\n      return bytes2str(buf)\n\n    case 421: // ipfs\n      return bytes2mh(buf)\n    case 444: // onion\n      return bytes2onion(buf)\n    case 445: // onion3\n      return bytes2onion(buf)\n    default:\n      return uint8ArrayToString(buf, 'base16') // no clue. convert to hex\n  }\n}\n\nConvert.toBytes = function convertToBytes (/** @type {string | number } */ proto, /** @type {string} */ str) {\n  const protocol = protocols(proto)\n  switch (protocol.code) {\n    case 4: // ipv4\n      return ip2bytes(str)\n    case 41: // ipv6\n      return ip2bytes(str)\n\n    case 6: // tcp\n    case 273: // udp\n    case 33: // dccp\n    case 132: // sctp\n      return port2bytes(parseInt(str, 10))\n\n    case 53: // dns\n    case 54: // dns4\n    case 55: // dns6\n    case 56: // dnsaddr\n    case 400: // unix\n    case 777: // memory\n      return str2bytes(str)\n\n    case 421: // ipfs\n      return mh2bytes(str)\n    case 444: // onion\n      return onion2bytes(str)\n    case 445: // onion3\n      return onion32bytes(str)\n    default:\n      return uint8ArrayFromString(str, 'base16') // no clue. convert from hex\n  }\n}\n\n/**\n * @param {string} ipString\n */\nfunction ip2bytes (ipString) {\n  if (!ip.isIP(ipString)) {\n    throw new Error('invalid ip address')\n  }\n  return ip.toBytes(ipString)\n}\n\n/**\n * @param {Uint8Array} ipBuff\n */\nfunction bytes2ip (ipBuff) {\n  const ipString = ip.toString(ipBuff)\n  if (!ipString || !ip.isIP(ipString)) {\n    throw new Error('invalid ip address')\n  }\n  return ipString\n}\n\n/**\n * @param {number} port\n */\nfunction port2bytes (port) {\n  const buf = new ArrayBuffer(2)\n  const view = new DataView(buf)\n  view.setUint16(0, port)\n\n  return new Uint8Array(buf)\n}\n\n/**\n * @param {Uint8Array} buf\n */\nfunction bytes2port (buf) {\n  const view = new DataView(buf.buffer)\n  return view.getUint16(0)\n}\n\n/**\n * @param {string} str\n */\nfunction str2bytes (str) {\n  const buf = uint8ArrayFromString(str)\n  const size = Uint8Array.from(varint.encode(buf.length))\n  return uint8ArrayConcat([size, buf], size.length + buf.length)\n}\n\n/**\n * @param {Uint8Array} buf\n */\nfunction bytes2str (buf) {\n  const size = varint.decode(buf)\n  buf = buf.slice(varint.decode.bytes)\n\n  if (buf.length !== size) {\n    throw new Error('inconsistent lengths')\n  }\n\n  return uint8ArrayToString(buf)\n}\n\n/**\n * @param {string | Uint8Array | CID} hash\n */\nfunction mh2bytes (hash) {\n  // the address is a varint prefixed multihash string representation\n  const mh = new CID(hash).multihash\n  const size = Uint8Array.from(varint.encode(mh.length))\n  return uint8ArrayConcat([size, mh], size.length + mh.length)\n}\n\n/**\n * Converts bytes to bas58btc string\n *\n * @param {Uint8Array} buf\n * @returns {string} bas58btc string\n */\nfunction bytes2mh (buf) {\n  const size = varint.decode(buf)\n  const address = buf.slice(varint.decode.bytes)\n\n  if (address.length !== size) {\n    throw new Error('inconsistent lengths')\n  }\n\n  return uint8ArrayToString(address, 'base58btc')\n}\n\n/**\n * @param {string} str\n */\nfunction onion2bytes (str) {\n  const addr = str.split(':')\n  if (addr.length !== 2) {\n    throw new Error('failed to parse onion addr: ' + addr + ' does not contain a port number')\n  }\n  if (addr[0].length !== 16) {\n    throw new Error('failed to parse onion addr: ' + addr[0] + ' not a Tor onion address.')\n  }\n\n  // onion addresses do not include the multibase prefix, add it before decoding\n  const buf = multibase.decode('b' + addr[0])\n\n  // onion port number\n  const port = parseInt(addr[1], 10)\n  if (port < 1 || port > 65536) {\n    throw new Error('Port number is not in range(1, 65536)')\n  }\n  const portBuf = port2bytes(port)\n  return uint8ArrayConcat([buf, portBuf], buf.length + portBuf.length)\n}\n\n/**\n * @param {string} str\n */\nfunction onion32bytes (str) {\n  const addr = str.split(':')\n  if (addr.length !== 2) {\n    throw new Error('failed to parse onion addr: ' + addr + ' does not contain a port number')\n  }\n  if (addr[0].length !== 56) {\n    throw new Error('failed to parse onion addr: ' + addr[0] + ' not a Tor onion3 address.')\n  }\n  // onion addresses do not include the multibase prefix, add it before decoding\n  const buf = multibase.decode('b' + addr[0])\n\n  // onion port number\n  const port = parseInt(addr[1], 10)\n  if (port < 1 || port > 65536) {\n    throw new Error('Port number is not in range(1, 65536)')\n  }\n  const portBuf = port2bytes(port)\n  return uint8ArrayConcat([buf, portBuf], buf.length + portBuf.length)\n}\n\n/**\n * @param {Uint8Array} buf\n */\nfunction bytes2onion (buf) {\n  const addrBytes = buf.slice(0, buf.length - 2)\n  const portBytes = buf.slice(buf.length - 2)\n  const addr = uint8ArrayToString(addrBytes, 'base32')\n  const port = bytes2port(portBytes)\n  return addr + ':' + port\n}\n","'use strict'\n\nconst isIp = require('is-ip')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nconst isIP = isIp\nconst isV4 = isIp.v4\nconst isV6 = isIp.v6\n\n// Copied from https://github.com/indutny/node-ip/blob/master/lib/ip.js#L7\n// @ts-ignore - this is copied from the link above better to keep it the same\nconst toBytes = function (ip, buff, offset) {\n  offset = ~~offset\n\n  let result\n\n  if (isV4(ip)) {\n    result = buff || new Uint8Array(offset + 4)\n    // @ts-ignore\n    // eslint-disable-next-line array-callback-return\n    ip.split(/\\./g).map(function (byte) {\n      result[offset++] = parseInt(byte, 10) & 0xff\n    })\n  } else if (isV6(ip)) {\n    const sections = ip.split(':', 8)\n\n    let i\n    for (i = 0; i < sections.length; i++) {\n      const isv4 = isV4(sections[i])\n      var v4Buffer\n\n      if (isv4) {\n        v4Buffer = toBytes(sections[i])\n        sections[i] = uint8ArrayToString(v4Buffer.slice(0, 2), 'base16')\n      }\n\n      if (v4Buffer && ++i < 8) {\n        sections.splice(i, 0, uint8ArrayToString(v4Buffer.slice(2, 4), 'base16'))\n      }\n    }\n\n    if (sections[0] === '') {\n      while (sections.length < 8) sections.unshift('0')\n    } else if (sections[sections.length - 1] === '') {\n      while (sections.length < 8) sections.push('0')\n    } else if (sections.length < 8) {\n      for (i = 0; i < sections.length && sections[i] !== ''; i++);\n      const argv = [i, '1']\n      for (i = 9 - sections.length; i > 0; i--) {\n        argv.push('0')\n      }\n      sections.splice.apply(sections, argv)\n    }\n\n    result = buff || new Uint8Array(offset + 16)\n    for (i = 0; i < sections.length; i++) {\n      const word = parseInt(sections[i], 16)\n      result[offset++] = (word >> 8) & 0xff\n      result[offset++] = word & 0xff\n    }\n  }\n\n  if (!result) {\n    throw Error('Invalid ip address: ' + ip)\n  }\n\n  return result\n}\n\n// Copied from https://github.com/indutny/node-ip/blob/master/lib/ip.js#L63\n// @ts-ignore - this is copied from the link above better to keep it the same\nconst toString = function (buff, offset, length) {\n  offset = ~~offset\n  length = length || (buff.length - offset)\n\n  const result = []\n  let string\n  const view = new DataView(buff.buffer)\n  if (length === 4) {\n    // IPv4\n    for (let i = 0; i < length; i++) {\n      result.push(buff[offset + i])\n    }\n    string = result.join('.')\n  } else if (length === 16) {\n    // IPv6\n    for (let i = 0; i < length; i += 2) {\n      result.push(view.getUint16(offset + i).toString(16))\n    }\n    string = result.join(':')\n    string = string.replace(/(^|:)0(:0)*:0(:|$)/, '$1::$3')\n    string = string.replace(/:{3,4}/, '::')\n  }\n\n  return string\n}\n\nmodule.exports = {\n  isIP,\n  isV4,\n  isV6,\n  toBytes,\n  toString\n}\n","'use strict';\nconst ipRegex = require('ip-regex');\n\nconst isIp = string => ipRegex({exact: true}).test(string);\nisIp.v4 = string => ipRegex.v4({exact: true}).test(string);\nisIp.v6 = string => ipRegex.v6({exact: true}).test(string);\nisIp.version = string => isIp(string) ? (isIp.v4(string) ? 4 : 6) : undefined;\n\nmodule.exports = isIp;\n","'use strict';\n\nconst word = '[a-fA-F\\\\d:]';\nconst b = options => options && options.includeBoundaries ?\n\t`(?:(?<=\\\\s|^)(?=${word})|(?<=${word})(?=\\\\s|$))` :\n\t'';\n\nconst v4 = '(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)(?:\\\\.(?:25[0-5]|2[0-4]\\\\d|1\\\\d\\\\d|[1-9]\\\\d|\\\\d)){3}';\n\nconst v6seg = '[a-fA-F\\\\d]{1,4}';\nconst v6 = `\n(?:\n(?:${v6seg}:){7}(?:${v6seg}|:)|                                    // 1:2:3:4:5:6:7::  1:2:3:4:5:6:7:8\n(?:${v6seg}:){6}(?:${v4}|:${v6seg}|:)|                             // 1:2:3:4:5:6::    1:2:3:4:5:6::8   1:2:3:4:5:6::8  1:2:3:4:5:6::1.2.3.4\n(?:${v6seg}:){5}(?::${v4}|(?::${v6seg}){1,2}|:)|                   // 1:2:3:4:5::      1:2:3:4:5::7:8   1:2:3:4:5::8    1:2:3:4:5::7:1.2.3.4\n(?:${v6seg}:){4}(?:(?::${v6seg}){0,1}:${v4}|(?::${v6seg}){1,3}|:)| // 1:2:3:4::        1:2:3:4::6:7:8   1:2:3:4::8      1:2:3:4::6:7:1.2.3.4\n(?:${v6seg}:){3}(?:(?::${v6seg}){0,2}:${v4}|(?::${v6seg}){1,4}|:)| // 1:2:3::          1:2:3::5:6:7:8   1:2:3::8        1:2:3::5:6:7:1.2.3.4\n(?:${v6seg}:){2}(?:(?::${v6seg}){0,3}:${v4}|(?::${v6seg}){1,5}|:)| // 1:2::            1:2::4:5:6:7:8   1:2::8          1:2::4:5:6:7:1.2.3.4\n(?:${v6seg}:){1}(?:(?::${v6seg}){0,4}:${v4}|(?::${v6seg}){1,6}|:)| // 1::              1::3:4:5:6:7:8   1::8            1::3:4:5:6:7:1.2.3.4\n(?::(?:(?::${v6seg}){0,5}:${v4}|(?::${v6seg}){1,7}|:))             // ::2:3:4:5:6:7:8  ::2:3:4:5:6:7:8  ::8             ::1.2.3.4\n)(?:%[0-9a-zA-Z]{1,})?                                             // %eth0            %1\n`.replace(/\\s*\\/\\/.*$/gm, '').replace(/\\n/g, '').trim();\n\n// Pre-compile only the exact regexes because adding a global flag make regexes stateful\nconst v46Exact = new RegExp(`(?:^${v4}$)|(?:^${v6}$)`);\nconst v4exact = new RegExp(`^${v4}$`);\nconst v6exact = new RegExp(`^${v6}$`);\n\nconst ip = options => options && options.exact ?\n\tv46Exact :\n\tnew RegExp(`(?:${b(options)}${v4}${b(options)})|(?:${b(options)}${v6}${b(options)})`, 'g');\n\nip.v4 = options => options && options.exact ? v4exact : new RegExp(`${b(options)}${v4}${b(options)}`, 'g');\nip.v6 = options => options && options.exact ? v6exact : new RegExp(`${b(options)}${v6}${b(options)}`, 'g');\n\nmodule.exports = ip;\n","'use strict'\n/** @typedef {import(\"./types\").Protocol} Protocol */\n\n/**\n * Protocols\n *\n * @param {number | string} proto\n * @returns {Protocol}\n */\nfunction Protocols (proto) {\n  if (typeof (proto) === 'number') {\n    if (Protocols.codes[proto]) {\n      return Protocols.codes[proto]\n    }\n\n    throw new Error('no protocol with code: ' + proto)\n  } else if (typeof (proto) === 'string') {\n    if (Protocols.names[proto]) {\n      return Protocols.names[proto]\n    }\n\n    throw new Error('no protocol with name: ' + proto)\n  }\n\n  throw new Error('invalid protocol id type: ' + proto)\n}\n\nconst V = -1\nProtocols.lengthPrefixedVarSize = V\nProtocols.V = V\n\n/** @type {Array<[number, number, string, (string|boolean)?, string?]>} */\nProtocols.table = [\n  [4, 32, 'ip4'],\n  [6, 16, 'tcp'],\n  [33, 16, 'dccp'],\n  [41, 128, 'ip6'],\n  [42, V, 'ip6zone'],\n  [53, V, 'dns', 'resolvable'],\n  [54, V, 'dns4', 'resolvable'],\n  [55, V, 'dns6', 'resolvable'],\n  [56, V, 'dnsaddr', 'resolvable'],\n  [132, 16, 'sctp'],\n  [273, 16, 'udp'],\n  [275, 0, 'p2p-webrtc-star'],\n  [276, 0, 'p2p-webrtc-direct'],\n  [277, 0, 'p2p-stardust'],\n  [290, 0, 'p2p-circuit'],\n  [301, 0, 'udt'],\n  [302, 0, 'utp'],\n  [400, V, 'unix', false, 'path'],\n  // `ipfs` is added before `p2p` for legacy support.\n  // All text representations will default to `p2p`, but `ipfs` will\n  // still be supported\n  [421, V, 'ipfs'],\n  // `p2p` is the preferred name for 421, and is now the default\n  [421, V, 'p2p'],\n  [443, 0, 'https'],\n  [444, 96, 'onion'],\n  [445, 296, 'onion3'],\n  [446, V, 'garlic64'],\n  [460, 0, 'quic'],\n  [477, 0, 'ws'],\n  [478, 0, 'wss'],\n  [479, 0, 'p2p-websocket-star'],\n  [480, 0, 'http'],\n  [777, V, 'memory']\n]\n/** @type {Record<string,Protocol>} */\nProtocols.names = {}\n/** @type {Record<number,Protocol>} */\nProtocols.codes = {}\n\n// populate tables\nProtocols.table.map(row => {\n  const proto = p.apply(null, row)\n  Protocols.codes[proto.code] = proto\n  Protocols.names[proto.name] = proto\n  return null\n})\n\nProtocols.object = p\n\n/**\n *\n * Create a protocol\n *\n * @param {number} code\n * @param {number} size\n * @param {string} name\n * @param {any} [resolvable]\n * @param {any} [path]\n * @returns {Protocol}\n */\nfunction p (code, size, name, resolvable, path) {\n  return {\n    code,\n    size,\n    name,\n    resolvable: Boolean(resolvable),\n    path: Boolean(path)\n  }\n}\n\nmodule.exports = Protocols\n","module.exports = {\n    encode: require('./encode.js')\n  , decode: require('./decode.js')\n  , encodingLength: require('./length.js')\n}\n","module.exports = encode\n\nvar MSB = 0x80\n  , REST = 0x7F\n  , MSBALL = ~REST\n  , INT = Math.pow(2, 31)\n\nfunction encode(num, out, offset) {\n  if (Number.MAX_SAFE_INTEGER && num > Number.MAX_SAFE_INTEGER) {\n    encode.bytes = 0\n    throw new RangeError('Could not encode varint')\n  }\n  out = out || []\n  offset = offset || 0\n  var oldOffset = offset\n\n  while(num >= INT) {\n    out[offset++] = (num & 0xFF) | MSB\n    num /= 128\n  }\n  while(num & MSBALL) {\n    out[offset++] = (num & 0xFF) | MSB\n    num >>>= 7\n  }\n  out[offset] = num | 0\n  \n  encode.bytes = offset - oldOffset + 1\n  \n  return out\n}\n","module.exports = read\n\nvar MSB = 0x80\n  , REST = 0x7F\n\nfunction read(buf, offset) {\n  var res    = 0\n    , offset = offset || 0\n    , shift  = 0\n    , counter = offset\n    , b\n    , l = buf.length\n\n  do {\n    if (counter >= l || shift > 49) {\n      read.bytes = 0\n      throw new RangeError('Could not decode varint')\n    }\n    b = buf[counter++]\n    res += shift < 28\n      ? (b & REST) << shift\n      : (b & REST) * Math.pow(2, shift)\n    shift += 7\n  } while (b >= MSB)\n\n  read.bytes = counter - offset\n\n  return res\n}\n","\nvar N1 = Math.pow(2,  7)\nvar N2 = Math.pow(2, 14)\nvar N3 = Math.pow(2, 21)\nvar N4 = Math.pow(2, 28)\nvar N5 = Math.pow(2, 35)\nvar N6 = Math.pow(2, 42)\nvar N7 = Math.pow(2, 49)\nvar N8 = Math.pow(2, 56)\nvar N9 = Math.pow(2, 63)\n\nmodule.exports = function (value) {\n  return (\n    value < N1 ? 1\n  : value < N2 ? 2\n  : value < N3 ? 3\n  : value < N4 ? 4\n  : value < N5 ? 5\n  : value < N6 ? 6\n  : value < N7 ? 7\n  : value < N8 ? 8\n  : value < N9 ? 9\n  :              10\n  )\n}\n","'use strict'\n\nconst { Multiaddr } = require('multiaddr')\n\n/**\n * @typedef {import('./types').MatchesFunction} MatchesFunction\n * @typedef {import('./types').PartialMatchesFunction} PartialMatchesFunction\n * @typedef {import('./types').Mafmt} Mafmt\n */\n\n/*\n * Valid combinations\n */\nconst DNS4 = base('dns4')\nconst DNS6 = base('dns6')\nconst DNSADDR = base('dnsaddr')\nconst DNS = or(\n  base('dns'),\n  DNSADDR,\n  DNS4,\n  DNS6\n)\n\nconst IP = or(base('ip4'), base('ip6'))\nconst TCP = or(\n  and(IP, base('tcp')),\n  and(DNS, base('tcp'))\n)\nconst UDP = and(IP, base('udp'))\nconst UTP = and(UDP, base('utp'))\n\nconst QUIC = and(UDP, base('quic'))\n\nconst WebSockets = or(\n  and(TCP, base('ws')),\n  and(DNS, base('ws'))\n)\n\nconst WebSocketsSecure = or(\n  and(TCP, base('wss')),\n  and(DNS, base('wss'))\n)\n\nconst HTTP = or(\n  and(TCP, base('http')),\n  and(IP, base('http')),\n  and(DNS, base('http'))\n)\n\nconst HTTPS = or(\n  and(TCP, base('https')),\n  and(IP, base('https')),\n  and(DNS, base('https'))\n)\n\nconst WebRTCStar = or(\n  and(WebSockets, base('p2p-webrtc-star'), base('p2p')),\n  and(WebSocketsSecure, base('p2p-webrtc-star'), base('p2p')),\n  and(WebSockets, base('p2p-webrtc-star')),\n  and(WebSocketsSecure, base('p2p-webrtc-star'))\n)\n\nconst WebSocketStar = or(\n  and(WebSockets, base('p2p-websocket-star'), base('p2p')),\n  and(WebSocketsSecure, base('p2p-websocket-star'), base('p2p')),\n  and(WebSockets, base('p2p-websocket-star')),\n  and(WebSocketsSecure, base('p2p-websocket-star'))\n)\n\nconst WebRTCDirect = or(\n  and(HTTP, base('p2p-webrtc-direct'), base('p2p')),\n  and(HTTPS, base('p2p-webrtc-direct'), base('p2p')),\n  and(HTTP, base('p2p-webrtc-direct')),\n  and(HTTPS, base('p2p-webrtc-direct'))\n)\n\nconst Reliable = or(\n  WebSockets,\n  WebSocketsSecure,\n  HTTP,\n  HTTPS,\n  WebRTCStar,\n  WebRTCDirect,\n  TCP,\n  UTP,\n  QUIC,\n  DNS\n)\n\n// Unlike ws-star, stardust can run over any transport thus removing the requirement for websockets (but don't even think about running a stardust server over webrtc-star ;) )\nconst Stardust = or(\n  and(Reliable, base('p2p-stardust'), base('p2p')),\n  and(Reliable, base('p2p-stardust'))\n)\n\nconst _P2P = or(\n  and(Reliable, base('p2p')),\n  WebRTCStar,\n  WebRTCDirect,\n  base('p2p')\n)\n\nconst _Circuit = or(\n  and(_P2P, base('p2p-circuit'), _P2P),\n  and(_P2P, base('p2p-circuit')),\n  and(base('p2p-circuit'), _P2P),\n  and(Reliable, base('p2p-circuit')),\n  and(base('p2p-circuit'), Reliable),\n  base('p2p-circuit')\n)\n\nconst CircuitRecursive = () => or(\n  and(_Circuit, CircuitRecursive),\n  _Circuit\n)\n\nconst Circuit = CircuitRecursive()\n\nconst P2P = or(\n  and(Circuit, _P2P, Circuit),\n  and(_P2P, Circuit),\n  and(Circuit, _P2P),\n  Circuit,\n  _P2P\n)\n\nmodule.exports = {\n  DNS,\n  DNS4,\n  DNS6,\n  DNSADDR,\n  IP,\n  TCP,\n  UDP,\n  QUIC,\n  UTP,\n  HTTP,\n  HTTPS,\n  WebSockets,\n  WebSocketsSecure,\n  WebSocketStar,\n  WebRTCStar,\n  WebRTCDirect,\n  Reliable,\n  Stardust,\n  Circuit,\n  P2P,\n  IPFS: P2P\n}\n\n/*\n * Validation funcs\n */\n\n/**\n * @param {PartialMatchesFunction} partialMatch\n */\nfunction makeMatchesFunction (partialMatch) {\n  /**\n   * @type {MatchesFunction}\n   */\n  function matches (a) {\n    if (!Multiaddr.isMultiaddr(a)) {\n      try {\n        a = new Multiaddr(a)\n      } catch (err) { // catch error\n        return false // also if it's invalid it's propably not matching as well so return false\n      }\n    }\n    const out = partialMatch(a.protoNames())\n    if (out === null) {\n      return false\n    }\n\n    if (out === true || out === false) {\n      return out\n    }\n\n    return out.length === 0\n  }\n\n  return matches\n}\n\n/**\n * @param {Array<Mafmt | (() => Mafmt)>} args\n * @returns {Mafmt}\n */\nfunction and (...args) {\n  /**\n   * @type {PartialMatchesFunction}\n   */\n  function partialMatch (a) {\n    if (a.length < args.length) {\n      return null\n    }\n\n    /** @type {boolean | string[] | null} */\n    let out = a\n\n    args.some((arg) => {\n      out = typeof arg === 'function'\n        ? arg().partialMatch(a)\n        : arg.partialMatch(a)\n\n      if (Array.isArray(out)) {\n        a = out\n      }\n\n      if (out === null) {\n        return true\n      }\n\n      return false\n    })\n\n    return out\n  }\n\n  return {\n    toString: function () { return '{ ' + args.join(' ') + ' }' },\n    input: args,\n    matches: makeMatchesFunction(partialMatch),\n    partialMatch: partialMatch\n  }\n}\n\n/**\n * @param {Array<Mafmt | (() => Mafmt)>} args\n * @returns {Mafmt}\n */\nfunction or (...args) {\n  /**\n   * @type {PartialMatchesFunction}\n   */\n  function partialMatch (a) {\n    let out = null\n    args.some((arg) => {\n      const res = typeof arg === 'function'\n        ? arg().partialMatch(a)\n        : arg.partialMatch(a)\n      if (res) {\n        out = res\n        return true\n      }\n      return false\n    })\n\n    return out\n  }\n\n  const result = {\n    toString: function () { return '{ ' + args.join(' ') + ' }' },\n    input: args,\n    matches: makeMatchesFunction(partialMatch),\n    partialMatch: partialMatch\n  }\n\n  return result\n}\n\n/**\n * @param {string} n\n * @returns {Mafmt}\n */\nfunction base (n) {\n  const name = n\n\n  /**\n   * @type {MatchesFunction}\n   */\n  function matches (a) {\n    if (typeof a === 'string') {\n      try {\n        a = new Multiaddr(a)\n      } catch (err) { // catch error\n        return false // also if it's invalid it's propably not matching as well so return false\n      }\n    }\n\n    const pnames = a.protoNames()\n    if (pnames.length === 1 && pnames[0] === name) {\n      return true\n    }\n    return false\n  }\n\n  /**\n   * @type {PartialMatchesFunction}\n   */\n  function partialMatch (protos) {\n    if (protos.length === 0) {\n      return null\n    }\n\n    if (protos[0] === name) {\n      return protos.slice(1)\n    }\n    return null\n  }\n\n  return {\n    toString: function () { return name },\n    matches: matches,\n    partialMatch: partialMatch\n  }\n}\n","'use strict'\n\nconst errcode = require('err-code')\nconst multihash = require('multihashes')\nconst crypto = require('./crypto')\nconst equals = require('uint8arrays/equals')\n\n/**\n * @typedef {import(\"./types\").Digest} Digest\n * @typedef {import(\"multihashes\").HashName} HashName\n */\n\n/**\n * Hash the given `bytes` using the algorithm specified by `alg`.\n *\n * @param {Uint8Array} bytes - The value to hash.\n * @param {HashName} alg - The algorithm to use eg 'sha1'\n * @param {number} [length] - Optionally trim the result to this length.\n * @returns {Promise<Uint8Array>}\n */\nasync function Multihashing (bytes, alg, length) {\n  const digest = await Multihashing.digest(bytes, alg, length)\n  return multihash.encode(digest, alg, length)\n}\n\n/**\n * Expose multihash itself, to avoid silly double requires.\n */\nMultihashing.multihash = multihash\n\n/**\n * @param {Uint8Array} bytes - The value to hash.\n * @param {HashName} alg - The algorithm to use eg 'sha1'\n * @param {number} [length] - Optionally trim the result to this length.\n * @returns {Promise<Uint8Array>}\n */\nMultihashing.digest = async (bytes, alg, length) => {\n  const hash = Multihashing.createHash(alg)\n  const digest = await hash(bytes)\n  return length ? digest.slice(0, length) : digest\n}\n\n/**\n * Creates a function that hashes with the given algorithm\n *\n * @param {HashName} alg - The algorithm to use eg 'sha1'\n * @returns {Digest} - The hash function corresponding to `alg`\n */\nMultihashing.createHash = function (alg) {\n  if (!alg) {\n    const e = errcode(new Error('hash algorithm must be specified'), 'ERR_HASH_ALGORITHM_NOT_SPECIFIED')\n    throw e\n  }\n\n  const code = multihash.coerceCode(alg)\n  if (!Multihashing.functions[code]) {\n    throw errcode(new Error(`multihash function '${alg}' not yet supported`), 'ERR_HASH_ALGORITHM_NOT_SUPPORTED')\n  }\n\n  return Multihashing.functions[code]\n}\n\n/**\n * Mapping of multihash codes to their hashing functions.\n *\n * @type {Record<number, Digest>}\n */\n// @ts-ignore - most of those functions aren't typed\nMultihashing.functions = {\n  // identity\n  0x00: crypto.identity,\n  // sha1\n  0x11: crypto.sha1,\n  // sha2-256\n  0x12: crypto.sha2256,\n  // sha2-512\n  0x13: crypto.sha2512,\n  // sha3-512\n  0x14: crypto.sha3512,\n  // sha3-384\n  0x15: crypto.sha3384,\n  // sha3-256\n  0x16: crypto.sha3256,\n  // sha3-224\n  0x17: crypto.sha3224,\n  // shake-128\n  0x18: crypto.shake128,\n  // shake-256\n  0x19: crypto.shake256,\n  // keccak-224\n  0x1A: crypto.keccak224,\n  // keccak-256\n  0x1B: crypto.keccak256,\n  // keccak-384\n  0x1C: crypto.keccak384,\n  // keccak-512\n  0x1D: crypto.keccak512,\n  // murmur3-128\n  0x22: crypto.murmur3128,\n  // murmur3-32\n  0x23: crypto.murmur332,\n  // dbl-sha2-256\n  0x56: crypto.dblSha2256\n}\n\n// add blake functions\ncrypto.addBlake(Multihashing.functions)\n\n/**\n * @param {Uint8Array} bytes\n * @param {Uint8Array} hash\n * @returns {Promise<boolean>}\n */\nMultihashing.validate = async (bytes, hash) => {\n  const newHash = await Multihashing(bytes, multihash.decode(hash).name)\n\n  return equals(hash, newHash)\n}\n\nmodule.exports = Multihashing\n","'use strict'\n\nconst sha3 = require('js-sha3')\n// @ts-ignore - no types available\nconst mur = require('murmurhash3js-revisited')\nconst { factory: sha } = require('./sha')\nconst { fromNumberTo32BitBuf } = require('./utils')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n// Note that although this function doesn't do any asynchronous work, we mark\n// the function as async because it must return a Promise to match the API\n// for other functions that do perform asynchronous work (see sha.browser.js)\n// eslint-disable-next-line\n/**\n * @param {string} algorithm\n * @returns {import('./types').Digest}\n */\nconst hash = (algorithm) => async (data) => {\n  switch (algorithm) {\n    case 'sha3-224':\n      return new Uint8Array(sha3.sha3_224.arrayBuffer(data))\n    case 'sha3-256':\n      return new Uint8Array(sha3.sha3_256.arrayBuffer(data))\n    case 'sha3-384':\n      return new Uint8Array(sha3.sha3_384.arrayBuffer(data))\n    case 'sha3-512':\n      return new Uint8Array(sha3.sha3_512.arrayBuffer(data))\n    case 'shake-128':\n      return new Uint8Array(sha3.shake128.create(128).update(data).arrayBuffer())\n    case 'shake-256':\n      return new Uint8Array(sha3.shake256.create(256).update(data).arrayBuffer())\n    case 'keccak-224':\n      return new Uint8Array(sha3.keccak224.arrayBuffer(data))\n    case 'keccak-256':\n      return new Uint8Array(sha3.keccak256.arrayBuffer(data))\n    case 'keccak-384':\n      return new Uint8Array(sha3.keccak384.arrayBuffer(data))\n    case 'keccak-512':\n      return new Uint8Array(sha3.keccak512.arrayBuffer(data))\n    case 'murmur3-128':\n      return uint8ArrayFromString(mur.x64.hash128(data), 'base16')\n    case 'murmur3-32':\n      return fromNumberTo32BitBuf(mur.x86.hash32(data))\n\n    default:\n      throw new TypeError(`${algorithm} is not a supported algorithm`)\n  }\n}\n\n/** @type {import('./types').Digest} */\nconst identity = data => data\n\nmodule.exports = {\n  identity,\n  sha1: sha('sha1'),\n  sha2256: sha('sha2-256'),\n  sha2512: sha('sha2-512'),\n  dblSha2256: sha('dbl-sha2-256'),\n  sha3224: hash('sha3-224'),\n  sha3256: hash('sha3-256'),\n  sha3384: hash('sha3-384'),\n  sha3512: hash('sha3-512'),\n  shake128: hash('shake-128'),\n  shake256: hash('shake-256'),\n  keccak224: hash('keccak-224'),\n  keccak256: hash('keccak-256'),\n  keccak384: hash('keccak-384'),\n  keccak512: hash('keccak-512'),\n  murmur3128: hash('murmur3-128'),\n  murmur332: hash('murmur3-32'),\n  addBlake: require('./blake')\n}\n","/**\n * [js-sha3]{@link https://github.com/emn178/js-sha3}\n *\n * @version 0.8.0\n * @author Chen, Yi-Cyuan [emn178@gmail.com]\n * @copyright Chen, Yi-Cyuan 2015-2018\n * @license MIT\n */\n/*jslint bitwise: true */\n(function () {\n  'use strict';\n\n  var INPUT_ERROR = 'input is invalid type';\n  var FINALIZE_ERROR = 'finalize already called';\n  var WINDOW = typeof window === 'object';\n  var root = WINDOW ? window : {};\n  if (root.JS_SHA3_NO_WINDOW) {\n    WINDOW = false;\n  }\n  var WEB_WORKER = !WINDOW && typeof self === 'object';\n  var NODE_JS = !root.JS_SHA3_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;\n  if (NODE_JS) {\n    root = global;\n  } else if (WEB_WORKER) {\n    root = self;\n  }\n  var COMMON_JS = !root.JS_SHA3_NO_COMMON_JS && typeof module === 'object' && module.exports;\n  var AMD = typeof define === 'function' && define.amd;\n  var ARRAY_BUFFER = !root.JS_SHA3_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined';\n  var HEX_CHARS = '0123456789abcdef'.split('');\n  var SHAKE_PADDING = [31, 7936, 2031616, 520093696];\n  var CSHAKE_PADDING = [4, 1024, 262144, 67108864];\n  var KECCAK_PADDING = [1, 256, 65536, 16777216];\n  var PADDING = [6, 1536, 393216, 100663296];\n  var SHIFT = [0, 8, 16, 24];\n  var RC = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649,\n    0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0,\n    2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771,\n    2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648,\n    2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648];\n  var BITS = [224, 256, 384, 512];\n  var SHAKE_BITS = [128, 256];\n  var OUTPUT_TYPES = ['hex', 'buffer', 'arrayBuffer', 'array', 'digest'];\n  var CSHAKE_BYTEPAD = {\n    '128': 168,\n    '256': 136\n  };\n\n  if (root.JS_SHA3_NO_NODE_JS || !Array.isArray) {\n    Array.isArray = function (obj) {\n      return Object.prototype.toString.call(obj) === '[object Array]';\n    };\n  }\n\n  if (ARRAY_BUFFER && (root.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView)) {\n    ArrayBuffer.isView = function (obj) {\n      return typeof obj === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer;\n    };\n  }\n\n  var createOutputMethod = function (bits, padding, outputType) {\n    return function (message) {\n      return new Keccak(bits, padding, bits).update(message)[outputType]();\n    };\n  };\n\n  var createShakeOutputMethod = function (bits, padding, outputType) {\n    return function (message, outputBits) {\n      return new Keccak(bits, padding, outputBits).update(message)[outputType]();\n    };\n  };\n\n  var createCshakeOutputMethod = function (bits, padding, outputType) {\n    return function (message, outputBits, n, s) {\n      return methods['cshake' + bits].update(message, outputBits, n, s)[outputType]();\n    };\n  };\n\n  var createKmacOutputMethod = function (bits, padding, outputType) {\n    return function (key, message, outputBits, s) {\n      return methods['kmac' + bits].update(key, message, outputBits, s)[outputType]();\n    };\n  };\n\n  var createOutputMethods = function (method, createMethod, bits, padding) {\n    for (var i = 0; i < OUTPUT_TYPES.length; ++i) {\n      var type = OUTPUT_TYPES[i];\n      method[type] = createMethod(bits, padding, type);\n    }\n    return method;\n  };\n\n  var createMethod = function (bits, padding) {\n    var method = createOutputMethod(bits, padding, 'hex');\n    method.create = function () {\n      return new Keccak(bits, padding, bits);\n    };\n    method.update = function (message) {\n      return method.create().update(message);\n    };\n    return createOutputMethods(method, createOutputMethod, bits, padding);\n  };\n\n  var createShakeMethod = function (bits, padding) {\n    var method = createShakeOutputMethod(bits, padding, 'hex');\n    method.create = function (outputBits) {\n      return new Keccak(bits, padding, outputBits);\n    };\n    method.update = function (message, outputBits) {\n      return method.create(outputBits).update(message);\n    };\n    return createOutputMethods(method, createShakeOutputMethod, bits, padding);\n  };\n\n  var createCshakeMethod = function (bits, padding) {\n    var w = CSHAKE_BYTEPAD[bits];\n    var method = createCshakeOutputMethod(bits, padding, 'hex');\n    method.create = function (outputBits, n, s) {\n      if (!n && !s) {\n        return methods['shake' + bits].create(outputBits);\n      } else {\n        return new Keccak(bits, padding, outputBits).bytepad([n, s], w);\n      }\n    };\n    method.update = function (message, outputBits, n, s) {\n      return method.create(outputBits, n, s).update(message);\n    };\n    return createOutputMethods(method, createCshakeOutputMethod, bits, padding);\n  };\n\n  var createKmacMethod = function (bits, padding) {\n    var w = CSHAKE_BYTEPAD[bits];\n    var method = createKmacOutputMethod(bits, padding, 'hex');\n    method.create = function (key, outputBits, s) {\n      return new Kmac(bits, padding, outputBits).bytepad(['KMAC', s], w).bytepad([key], w);\n    };\n    method.update = function (key, message, outputBits, s) {\n      return method.create(key, outputBits, s).update(message);\n    };\n    return createOutputMethods(method, createKmacOutputMethod, bits, padding);\n  };\n\n  var algorithms = [\n    { name: 'keccak', padding: KECCAK_PADDING, bits: BITS, createMethod: createMethod },\n    { name: 'sha3', padding: PADDING, bits: BITS, createMethod: createMethod },\n    { name: 'shake', padding: SHAKE_PADDING, bits: SHAKE_BITS, createMethod: createShakeMethod },\n    { name: 'cshake', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createCshakeMethod },\n    { name: 'kmac', padding: CSHAKE_PADDING, bits: SHAKE_BITS, createMethod: createKmacMethod }\n  ];\n\n  var methods = {}, methodNames = [];\n\n  for (var i = 0; i < algorithms.length; ++i) {\n    var algorithm = algorithms[i];\n    var bits = algorithm.bits;\n    for (var j = 0; j < bits.length; ++j) {\n      var methodName = algorithm.name + '_' + bits[j];\n      methodNames.push(methodName);\n      methods[methodName] = algorithm.createMethod(bits[j], algorithm.padding);\n      if (algorithm.name !== 'sha3') {\n        var newMethodName = algorithm.name + bits[j];\n        methodNames.push(newMethodName);\n        methods[newMethodName] = methods[methodName];\n      }\n    }\n  }\n\n  function Keccak(bits, padding, outputBits) {\n    this.blocks = [];\n    this.s = [];\n    this.padding = padding;\n    this.outputBits = outputBits;\n    this.reset = true;\n    this.finalized = false;\n    this.block = 0;\n    this.start = 0;\n    this.blockCount = (1600 - (bits << 1)) >> 5;\n    this.byteCount = this.blockCount << 2;\n    this.outputBlocks = outputBits >> 5;\n    this.extraBytes = (outputBits & 31) >> 3;\n\n    for (var i = 0; i < 50; ++i) {\n      this.s[i] = 0;\n    }\n  }\n\n  Keccak.prototype.update = function (message) {\n    if (this.finalized) {\n      throw new Error(FINALIZE_ERROR);\n    }\n    var notString, type = typeof message;\n    if (type !== 'string') {\n      if (type === 'object') {\n        if (message === null) {\n          throw new Error(INPUT_ERROR);\n        } else if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {\n          message = new Uint8Array(message);\n        } else if (!Array.isArray(message)) {\n          if (!ARRAY_BUFFER || !ArrayBuffer.isView(message)) {\n            throw new Error(INPUT_ERROR);\n          }\n        }\n      } else {\n        throw new Error(INPUT_ERROR);\n      }\n      notString = true;\n    }\n    var blocks = this.blocks, byteCount = this.byteCount, length = message.length,\n      blockCount = this.blockCount, index = 0, s = this.s, i, code;\n\n    while (index < length) {\n      if (this.reset) {\n        this.reset = false;\n        blocks[0] = this.block;\n        for (i = 1; i < blockCount + 1; ++i) {\n          blocks[i] = 0;\n        }\n      }\n      if (notString) {\n        for (i = this.start; index < length && i < byteCount; ++index) {\n          blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];\n        }\n      } else {\n        for (i = this.start; index < length && i < byteCount; ++index) {\n          code = message.charCodeAt(index);\n          if (code < 0x80) {\n            blocks[i >> 2] |= code << SHIFT[i++ & 3];\n          } else if (code < 0x800) {\n            blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          } else if (code < 0xd800 || code >= 0xe000) {\n            blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          } else {\n            code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));\n            blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];\n            blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];\n          }\n        }\n      }\n      this.lastByteIndex = i;\n      if (i >= byteCount) {\n        this.start = i - byteCount;\n        this.block = blocks[blockCount];\n        for (i = 0; i < blockCount; ++i) {\n          s[i] ^= blocks[i];\n        }\n        f(s);\n        this.reset = true;\n      } else {\n        this.start = i;\n      }\n    }\n    return this;\n  };\n\n  Keccak.prototype.encode = function (x, right) {\n    var o = x & 255, n = 1;\n    var bytes = [o];\n    x = x >> 8;\n    o = x & 255;\n    while (o > 0) {\n      bytes.unshift(o);\n      x = x >> 8;\n      o = x & 255;\n      ++n;\n    }\n    if (right) {\n      bytes.push(n);\n    } else {\n      bytes.unshift(n);\n    }\n    this.update(bytes);\n    return bytes.length;\n  };\n\n  Keccak.prototype.encodeString = function (str) {\n    var notString, type = typeof str;\n    if (type !== 'string') {\n      if (type === 'object') {\n        if (str === null) {\n          throw new Error(INPUT_ERROR);\n        } else if (ARRAY_BUFFER && str.constructor === ArrayBuffer) {\n          str = new Uint8Array(str);\n        } else if (!Array.isArray(str)) {\n          if (!ARRAY_BUFFER || !ArrayBuffer.isView(str)) {\n            throw new Error(INPUT_ERROR);\n          }\n        }\n      } else {\n        throw new Error(INPUT_ERROR);\n      }\n      notString = true;\n    }\n    var bytes = 0, length = str.length;\n    if (notString) {\n      bytes = length;\n    } else {\n      for (var i = 0; i < str.length; ++i) {\n        var code = str.charCodeAt(i);\n        if (code < 0x80) {\n          bytes += 1;\n        } else if (code < 0x800) {\n          bytes += 2;\n        } else if (code < 0xd800 || code >= 0xe000) {\n          bytes += 3;\n        } else {\n          code = 0x10000 + (((code & 0x3ff) << 10) | (str.charCodeAt(++i) & 0x3ff));\n          bytes += 4;\n        }\n      }\n    }\n    bytes += this.encode(bytes * 8);\n    this.update(str);\n    return bytes;\n  };\n\n  Keccak.prototype.bytepad = function (strs, w) {\n    var bytes = this.encode(w);\n    for (var i = 0; i < strs.length; ++i) {\n      bytes += this.encodeString(strs[i]);\n    }\n    var paddingBytes = w - bytes % w;\n    var zeros = [];\n    zeros.length = paddingBytes;\n    this.update(zeros);\n    return this;\n  };\n\n  Keccak.prototype.finalize = function () {\n    if (this.finalized) {\n      return;\n    }\n    this.finalized = true;\n    var blocks = this.blocks, i = this.lastByteIndex, blockCount = this.blockCount, s = this.s;\n    blocks[i >> 2] |= this.padding[i & 3];\n    if (this.lastByteIndex === this.byteCount) {\n      blocks[0] = blocks[blockCount];\n      for (i = 1; i < blockCount + 1; ++i) {\n        blocks[i] = 0;\n      }\n    }\n    blocks[blockCount - 1] |= 0x80000000;\n    for (i = 0; i < blockCount; ++i) {\n      s[i] ^= blocks[i];\n    }\n    f(s);\n  };\n\n  Keccak.prototype.toString = Keccak.prototype.hex = function () {\n    this.finalize();\n\n    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n      extraBytes = this.extraBytes, i = 0, j = 0;\n    var hex = '', block;\n    while (j < outputBlocks) {\n      for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n        block = s[i];\n        hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F] +\n          HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F] +\n          HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F] +\n          HEX_CHARS[(block >> 28) & 0x0F] + HEX_CHARS[(block >> 24) & 0x0F];\n      }\n      if (j % blockCount === 0) {\n        f(s);\n        i = 0;\n      }\n    }\n    if (extraBytes) {\n      block = s[i];\n      hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F];\n      if (extraBytes > 1) {\n        hex += HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F];\n      }\n      if (extraBytes > 2) {\n        hex += HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F];\n      }\n    }\n    return hex;\n  };\n\n  Keccak.prototype.arrayBuffer = function () {\n    this.finalize();\n\n    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n      extraBytes = this.extraBytes, i = 0, j = 0;\n    var bytes = this.outputBits >> 3;\n    var buffer;\n    if (extraBytes) {\n      buffer = new ArrayBuffer((outputBlocks + 1) << 2);\n    } else {\n      buffer = new ArrayBuffer(bytes);\n    }\n    var array = new Uint32Array(buffer);\n    while (j < outputBlocks) {\n      for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n        array[j] = s[i];\n      }\n      if (j % blockCount === 0) {\n        f(s);\n      }\n    }\n    if (extraBytes) {\n      array[i] = s[i];\n      buffer = buffer.slice(0, bytes);\n    }\n    return buffer;\n  };\n\n  Keccak.prototype.buffer = Keccak.prototype.arrayBuffer;\n\n  Keccak.prototype.digest = Keccak.prototype.array = function () {\n    this.finalize();\n\n    var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,\n      extraBytes = this.extraBytes, i = 0, j = 0;\n    var array = [], offset, block;\n    while (j < outputBlocks) {\n      for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {\n        offset = j << 2;\n        block = s[i];\n        array[offset] = block & 0xFF;\n        array[offset + 1] = (block >> 8) & 0xFF;\n        array[offset + 2] = (block >> 16) & 0xFF;\n        array[offset + 3] = (block >> 24) & 0xFF;\n      }\n      if (j % blockCount === 0) {\n        f(s);\n      }\n    }\n    if (extraBytes) {\n      offset = j << 2;\n      block = s[i];\n      array[offset] = block & 0xFF;\n      if (extraBytes > 1) {\n        array[offset + 1] = (block >> 8) & 0xFF;\n      }\n      if (extraBytes > 2) {\n        array[offset + 2] = (block >> 16) & 0xFF;\n      }\n    }\n    return array;\n  };\n\n  function Kmac(bits, padding, outputBits) {\n    Keccak.call(this, bits, padding, outputBits);\n  }\n\n  Kmac.prototype = new Keccak();\n\n  Kmac.prototype.finalize = function () {\n    this.encode(this.outputBits, true);\n    return Keccak.prototype.finalize.call(this);\n  };\n\n  var f = function (s) {\n    var h, l, n, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9,\n      b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17,\n      b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33,\n      b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49;\n    for (n = 0; n < 48; n += 2) {\n      c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40];\n      c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41];\n      c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42];\n      c3 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43];\n      c4 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44];\n      c5 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45];\n      c6 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46];\n      c7 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47];\n      c8 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48];\n      c9 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49];\n\n      h = c8 ^ ((c2 << 1) | (c3 >>> 31));\n      l = c9 ^ ((c3 << 1) | (c2 >>> 31));\n      s[0] ^= h;\n      s[1] ^= l;\n      s[10] ^= h;\n      s[11] ^= l;\n      s[20] ^= h;\n      s[21] ^= l;\n      s[30] ^= h;\n      s[31] ^= l;\n      s[40] ^= h;\n      s[41] ^= l;\n      h = c0 ^ ((c4 << 1) | (c5 >>> 31));\n      l = c1 ^ ((c5 << 1) | (c4 >>> 31));\n      s[2] ^= h;\n      s[3] ^= l;\n      s[12] ^= h;\n      s[13] ^= l;\n      s[22] ^= h;\n      s[23] ^= l;\n      s[32] ^= h;\n      s[33] ^= l;\n      s[42] ^= h;\n      s[43] ^= l;\n      h = c2 ^ ((c6 << 1) | (c7 >>> 31));\n      l = c3 ^ ((c7 << 1) | (c6 >>> 31));\n      s[4] ^= h;\n      s[5] ^= l;\n      s[14] ^= h;\n      s[15] ^= l;\n      s[24] ^= h;\n      s[25] ^= l;\n      s[34] ^= h;\n      s[35] ^= l;\n      s[44] ^= h;\n      s[45] ^= l;\n      h = c4 ^ ((c8 << 1) | (c9 >>> 31));\n      l = c5 ^ ((c9 << 1) | (c8 >>> 31));\n      s[6] ^= h;\n      s[7] ^= l;\n      s[16] ^= h;\n      s[17] ^= l;\n      s[26] ^= h;\n      s[27] ^= l;\n      s[36] ^= h;\n      s[37] ^= l;\n      s[46] ^= h;\n      s[47] ^= l;\n      h = c6 ^ ((c0 << 1) | (c1 >>> 31));\n      l = c7 ^ ((c1 << 1) | (c0 >>> 31));\n      s[8] ^= h;\n      s[9] ^= l;\n      s[18] ^= h;\n      s[19] ^= l;\n      s[28] ^= h;\n      s[29] ^= l;\n      s[38] ^= h;\n      s[39] ^= l;\n      s[48] ^= h;\n      s[49] ^= l;\n\n      b0 = s[0];\n      b1 = s[1];\n      b32 = (s[11] << 4) | (s[10] >>> 28);\n      b33 = (s[10] << 4) | (s[11] >>> 28);\n      b14 = (s[20] << 3) | (s[21] >>> 29);\n      b15 = (s[21] << 3) | (s[20] >>> 29);\n      b46 = (s[31] << 9) | (s[30] >>> 23);\n      b47 = (s[30] << 9) | (s[31] >>> 23);\n      b28 = (s[40] << 18) | (s[41] >>> 14);\n      b29 = (s[41] << 18) | (s[40] >>> 14);\n      b20 = (s[2] << 1) | (s[3] >>> 31);\n      b21 = (s[3] << 1) | (s[2] >>> 31);\n      b2 = (s[13] << 12) | (s[12] >>> 20);\n      b3 = (s[12] << 12) | (s[13] >>> 20);\n      b34 = (s[22] << 10) | (s[23] >>> 22);\n      b35 = (s[23] << 10) | (s[22] >>> 22);\n      b16 = (s[33] << 13) | (s[32] >>> 19);\n      b17 = (s[32] << 13) | (s[33] >>> 19);\n      b48 = (s[42] << 2) | (s[43] >>> 30);\n      b49 = (s[43] << 2) | (s[42] >>> 30);\n      b40 = (s[5] << 30) | (s[4] >>> 2);\n      b41 = (s[4] << 30) | (s[5] >>> 2);\n      b22 = (s[14] << 6) | (s[15] >>> 26);\n      b23 = (s[15] << 6) | (s[14] >>> 26);\n      b4 = (s[25] << 11) | (s[24] >>> 21);\n      b5 = (s[24] << 11) | (s[25] >>> 21);\n      b36 = (s[34] << 15) | (s[35] >>> 17);\n      b37 = (s[35] << 15) | (s[34] >>> 17);\n      b18 = (s[45] << 29) | (s[44] >>> 3);\n      b19 = (s[44] << 29) | (s[45] >>> 3);\n      b10 = (s[6] << 28) | (s[7] >>> 4);\n      b11 = (s[7] << 28) | (s[6] >>> 4);\n      b42 = (s[17] << 23) | (s[16] >>> 9);\n      b43 = (s[16] << 23) | (s[17] >>> 9);\n      b24 = (s[26] << 25) | (s[27] >>> 7);\n      b25 = (s[27] << 25) | (s[26] >>> 7);\n      b6 = (s[36] << 21) | (s[37] >>> 11);\n      b7 = (s[37] << 21) | (s[36] >>> 11);\n      b38 = (s[47] << 24) | (s[46] >>> 8);\n      b39 = (s[46] << 24) | (s[47] >>> 8);\n      b30 = (s[8] << 27) | (s[9] >>> 5);\n      b31 = (s[9] << 27) | (s[8] >>> 5);\n      b12 = (s[18] << 20) | (s[19] >>> 12);\n      b13 = (s[19] << 20) | (s[18] >>> 12);\n      b44 = (s[29] << 7) | (s[28] >>> 25);\n      b45 = (s[28] << 7) | (s[29] >>> 25);\n      b26 = (s[38] << 8) | (s[39] >>> 24);\n      b27 = (s[39] << 8) | (s[38] >>> 24);\n      b8 = (s[48] << 14) | (s[49] >>> 18);\n      b9 = (s[49] << 14) | (s[48] >>> 18);\n\n      s[0] = b0 ^ (~b2 & b4);\n      s[1] = b1 ^ (~b3 & b5);\n      s[10] = b10 ^ (~b12 & b14);\n      s[11] = b11 ^ (~b13 & b15);\n      s[20] = b20 ^ (~b22 & b24);\n      s[21] = b21 ^ (~b23 & b25);\n      s[30] = b30 ^ (~b32 & b34);\n      s[31] = b31 ^ (~b33 & b35);\n      s[40] = b40 ^ (~b42 & b44);\n      s[41] = b41 ^ (~b43 & b45);\n      s[2] = b2 ^ (~b4 & b6);\n      s[3] = b3 ^ (~b5 & b7);\n      s[12] = b12 ^ (~b14 & b16);\n      s[13] = b13 ^ (~b15 & b17);\n      s[22] = b22 ^ (~b24 & b26);\n      s[23] = b23 ^ (~b25 & b27);\n      s[32] = b32 ^ (~b34 & b36);\n      s[33] = b33 ^ (~b35 & b37);\n      s[42] = b42 ^ (~b44 & b46);\n      s[43] = b43 ^ (~b45 & b47);\n      s[4] = b4 ^ (~b6 & b8);\n      s[5] = b5 ^ (~b7 & b9);\n      s[14] = b14 ^ (~b16 & b18);\n      s[15] = b15 ^ (~b17 & b19);\n      s[24] = b24 ^ (~b26 & b28);\n      s[25] = b25 ^ (~b27 & b29);\n      s[34] = b34 ^ (~b36 & b38);\n      s[35] = b35 ^ (~b37 & b39);\n      s[44] = b44 ^ (~b46 & b48);\n      s[45] = b45 ^ (~b47 & b49);\n      s[6] = b6 ^ (~b8 & b0);\n      s[7] = b7 ^ (~b9 & b1);\n      s[16] = b16 ^ (~b18 & b10);\n      s[17] = b17 ^ (~b19 & b11);\n      s[26] = b26 ^ (~b28 & b20);\n      s[27] = b27 ^ (~b29 & b21);\n      s[36] = b36 ^ (~b38 & b30);\n      s[37] = b37 ^ (~b39 & b31);\n      s[46] = b46 ^ (~b48 & b40);\n      s[47] = b47 ^ (~b49 & b41);\n      s[8] = b8 ^ (~b0 & b2);\n      s[9] = b9 ^ (~b1 & b3);\n      s[18] = b18 ^ (~b10 & b12);\n      s[19] = b19 ^ (~b11 & b13);\n      s[28] = b28 ^ (~b20 & b22);\n      s[29] = b29 ^ (~b21 & b23);\n      s[38] = b38 ^ (~b30 & b32);\n      s[39] = b39 ^ (~b31 & b33);\n      s[48] = b48 ^ (~b40 & b42);\n      s[49] = b49 ^ (~b41 & b43);\n\n      s[0] ^= RC[n];\n      s[1] ^= RC[n + 1];\n    }\n  };\n\n  if (COMMON_JS) {\n    module.exports = methods;\n  } else {\n    for (i = 0; i < methodNames.length; ++i) {\n      root[methodNames[i]] = methods[methodNames[i]];\n    }\n    if (AMD) {\n      define(function () {\n        return methods;\n      });\n    }\n  }\n})();\n","module.exports = require('./lib/murmurHash3js');\n","/* jshint -W086: true */\n// +----------------------------------------------------------------------+\n// | murmurHash3js.js v3.0.1 // https://github.com/pid/murmurHash3js\n// | A javascript implementation of MurmurHash3's x86 hashing algorithms. |\n// |----------------------------------------------------------------------|\n// | Copyright (c) 2012-2015 Karan Lyons                                       |\n// | https://github.com/karanlyons/murmurHash3.js/blob/c1778f75792abef7bdd74bc85d2d4e1a3d25cfe9/murmurHash3.js |\n// | Freely distributable under the MIT license.                          |\n// +----------------------------------------------------------------------+\n\n;(function (root, undefined) {\n    'use strict';\n\n    // Create a local object that'll be exported or referenced globally.\n    var library = {\n        'version': '3.0.0',\n        'x86': {},\n        'x64': {},\n        'inputValidation': true\n    };\n\n    // PRIVATE FUNCTIONS\n    // -----------------\n\n    function _validBytes(bytes) {\n        // check the input is an array or a typed array\n        if (!Array.isArray(bytes) && !ArrayBuffer.isView(bytes)) {\n            return false;\n        }\n\n        // check all bytes are actually bytes\n        for (var i = 0; i < bytes.length; i++) {\n            if (!Number.isInteger(bytes[i]) || bytes[i] < 0 || bytes[i] > 255) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    function _x86Multiply(m, n) {\n        //\n        // Given two 32bit ints, returns the two multiplied together as a\n        // 32bit int.\n        //\n\n        return ((m & 0xffff) * n) + ((((m >>> 16) * n) & 0xffff) << 16);\n    }\n\n    function _x86Rotl(m, n) {\n        //\n        // Given a 32bit int and an int representing a number of bit positions,\n        // returns the 32bit int rotated left by that number of positions.\n        //\n\n        return (m << n) | (m >>> (32 - n));\n    }\n\n    function _x86Fmix(h) {\n        //\n        // Given a block, returns murmurHash3's final x86 mix of that block.\n        //\n\n        h ^= h >>> 16;\n        h = _x86Multiply(h, 0x85ebca6b);\n        h ^= h >>> 13;\n        h = _x86Multiply(h, 0xc2b2ae35);\n        h ^= h >>> 16;\n\n        return h;\n    }\n\n    function _x64Add(m, n) {\n        //\n        // Given two 64bit ints (as an array of two 32bit ints) returns the two\n        // added together as a 64bit int (as an array of two 32bit ints).\n        //\n\n        m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n        n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n        var o = [0, 0, 0, 0];\n\n        o[3] += m[3] + n[3];\n        o[2] += o[3] >>> 16;\n        o[3] &= 0xffff;\n\n        o[2] += m[2] + n[2];\n        o[1] += o[2] >>> 16;\n        o[2] &= 0xffff;\n\n        o[1] += m[1] + n[1];\n        o[0] += o[1] >>> 16;\n        o[1] &= 0xffff;\n\n        o[0] += m[0] + n[0];\n        o[0] &= 0xffff;\n\n        return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n    }\n\n    function _x64Multiply(m, n) {\n        //\n        // Given two 64bit ints (as an array of two 32bit ints) returns the two\n        // multiplied together as a 64bit int (as an array of two 32bit ints).\n        //\n\n        m = [m[0] >>> 16, m[0] & 0xffff, m[1] >>> 16, m[1] & 0xffff];\n        n = [n[0] >>> 16, n[0] & 0xffff, n[1] >>> 16, n[1] & 0xffff];\n        var o = [0, 0, 0, 0];\n\n        o[3] += m[3] * n[3];\n        o[2] += o[3] >>> 16;\n        o[3] &= 0xffff;\n\n        o[2] += m[2] * n[3];\n        o[1] += o[2] >>> 16;\n        o[2] &= 0xffff;\n\n        o[2] += m[3] * n[2];\n        o[1] += o[2] >>> 16;\n        o[2] &= 0xffff;\n\n        o[1] += m[1] * n[3];\n        o[0] += o[1] >>> 16;\n        o[1] &= 0xffff;\n\n        o[1] += m[2] * n[2];\n        o[0] += o[1] >>> 16;\n        o[1] &= 0xffff;\n\n        o[1] += m[3] * n[1];\n        o[0] += o[1] >>> 16;\n        o[1] &= 0xffff;\n\n        o[0] += (m[0] * n[3]) + (m[1] * n[2]) + (m[2] * n[1]) + (m[3] * n[0]);\n        o[0] &= 0xffff;\n\n        return [(o[0] << 16) | o[1], (o[2] << 16) | o[3]];\n    }\n\n    function _x64Rotl(m, n) {\n        //\n        // Given a 64bit int (as an array of two 32bit ints) and an int\n        // representing a number of bit positions, returns the 64bit int (as an\n        // array of two 32bit ints) rotated left by that number of positions.\n        //\n\n        n %= 64;\n\n        if (n === 32) {\n            return [m[1], m[0]];\n        } else if (n < 32) {\n            return [(m[0] << n) | (m[1] >>> (32 - n)), (m[1] << n) | (m[0] >>> (32 - n))];\n        } else {\n            n -= 32;\n            return [(m[1] << n) | (m[0] >>> (32 - n)), (m[0] << n) | (m[1] >>> (32 - n))];\n        }\n    }\n\n    function _x64LeftShift(m, n) {\n        //\n        // Given a 64bit int (as an array of two 32bit ints) and an int\n        // representing a number of bit positions, returns the 64bit int (as an\n        // array of two 32bit ints) shifted left by that number of positions.\n        //\n\n        n %= 64;\n\n        if (n === 0) {\n            return m;\n        } else if (n < 32) {\n            return [(m[0] << n) | (m[1] >>> (32 - n)), m[1] << n];\n        } else {\n            return [m[1] << (n - 32), 0];\n        }\n    }\n\n    function _x64Xor(m, n) {\n        //\n        // Given two 64bit ints (as an array of two 32bit ints) returns the two\n        // xored together as a 64bit int (as an array of two 32bit ints).\n        //\n\n        return [m[0] ^ n[0], m[1] ^ n[1]];\n    }\n\n    function _x64Fmix(h) {\n        //\n        // Given a block, returns murmurHash3's final x64 mix of that block.\n        // (`[0, h[0] >>> 1]` is a 33 bit unsigned right shift. This is the\n        // only place where we need to right shift 64bit ints.)\n        //\n\n        h = _x64Xor(h, [0, h[0] >>> 1]);\n        h = _x64Multiply(h, [0xff51afd7, 0xed558ccd]);\n        h = _x64Xor(h, [0, h[0] >>> 1]);\n        h = _x64Multiply(h, [0xc4ceb9fe, 0x1a85ec53]);\n        h = _x64Xor(h, [0, h[0] >>> 1]);\n\n        return h;\n    }\n\n    // PUBLIC FUNCTIONS\n    // ----------------\n\n    library.x86.hash32 = function (bytes, seed) {\n        //\n        // Given a string and an optional seed as an int, returns a 32 bit hash\n        // using the x86 flavor of MurmurHash3, as an unsigned int.\n        //\n        if (library.inputValidation && !_validBytes(bytes)) {\n            return undefined;\n        }\n        seed = seed || 0;\n\n        var remainder = bytes.length % 4;\n        var blocks = bytes.length - remainder;\n\n        var h1 = seed;\n\n        var k1 = 0;\n\n        var c1 = 0xcc9e2d51;\n        var c2 = 0x1b873593;\n\n        for (var i = 0; i < blocks; i = i + 4) {\n            k1 = (bytes[i]) | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n\n            k1 = _x86Multiply(k1, c1);\n            k1 = _x86Rotl(k1, 15);\n            k1 = _x86Multiply(k1, c2);\n\n            h1 ^= k1;\n            h1 = _x86Rotl(h1, 13);\n            h1 = _x86Multiply(h1, 5) + 0xe6546b64;\n        }\n\n        k1 = 0;\n\n        switch (remainder) {\n            case 3:\n                k1 ^= bytes[i + 2] << 16;\n\n            case 2:\n                k1 ^= bytes[i + 1] << 8;\n\n            case 1:\n                k1 ^= bytes[i];\n                k1 = _x86Multiply(k1, c1);\n                k1 = _x86Rotl(k1, 15);\n                k1 = _x86Multiply(k1, c2);\n                h1 ^= k1;\n        }\n\n        h1 ^= bytes.length;\n        h1 = _x86Fmix(h1);\n\n        return h1 >>> 0;\n    };\n\n    library.x86.hash128 = function (bytes, seed) {\n        //\n        // Given a string and an optional seed as an int, returns a 128 bit\n        // hash using the x86 flavor of MurmurHash3, as an unsigned hex.\n        //\n        if (library.inputValidation && !_validBytes(bytes)) {\n            return undefined;\n        }\n\n        seed = seed || 0;\n        var remainder = bytes.length % 16;\n        var blocks = bytes.length - remainder;\n\n        var h1 = seed;\n        var h2 = seed;\n        var h3 = seed;\n        var h4 = seed;\n\n        var k1 = 0;\n        var k2 = 0;\n        var k3 = 0;\n        var k4 = 0;\n\n        var c1 = 0x239b961b;\n        var c2 = 0xab0e9789;\n        var c3 = 0x38b34ae5;\n        var c4 = 0xa1e38b93;\n\n        for (var i = 0; i < blocks; i = i + 16) {\n            k1 = (bytes[i]) | (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24);\n            k2 = (bytes[i + 4]) | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24);\n            k3 = (bytes[i + 8]) | (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24);\n            k4 = (bytes[i + 12]) | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24);\n\n            k1 = _x86Multiply(k1, c1);\n            k1 = _x86Rotl(k1, 15);\n            k1 = _x86Multiply(k1, c2);\n            h1 ^= k1;\n\n            h1 = _x86Rotl(h1, 19);\n            h1 += h2;\n            h1 = _x86Multiply(h1, 5) + 0x561ccd1b;\n\n            k2 = _x86Multiply(k2, c2);\n            k2 = _x86Rotl(k2, 16);\n            k2 = _x86Multiply(k2, c3);\n            h2 ^= k2;\n\n            h2 = _x86Rotl(h2, 17);\n            h2 += h3;\n            h2 = _x86Multiply(h2, 5) + 0x0bcaa747;\n\n            k3 = _x86Multiply(k3, c3);\n            k3 = _x86Rotl(k3, 17);\n            k3 = _x86Multiply(k3, c4);\n            h3 ^= k3;\n\n            h3 = _x86Rotl(h3, 15);\n            h3 += h4;\n            h3 = _x86Multiply(h3, 5) + 0x96cd1c35;\n\n            k4 = _x86Multiply(k4, c4);\n            k4 = _x86Rotl(k4, 18);\n            k4 = _x86Multiply(k4, c1);\n            h4 ^= k4;\n\n            h4 = _x86Rotl(h4, 13);\n            h4 += h1;\n            h4 = _x86Multiply(h4, 5) + 0x32ac3b17;\n        }\n\n        k1 = 0;\n        k2 = 0;\n        k3 = 0;\n        k4 = 0;\n\n        switch (remainder) {\n            case 15:\n                k4 ^= bytes[i + 14] << 16;\n\n            case 14:\n                k4 ^= bytes[i + 13] << 8;\n\n            case 13:\n                k4 ^= bytes[i + 12];\n                k4 = _x86Multiply(k4, c4);\n                k4 = _x86Rotl(k4, 18);\n                k4 = _x86Multiply(k4, c1);\n                h4 ^= k4;\n\n            case 12:\n                k3 ^= bytes[i + 11] << 24;\n\n            case 11:\n                k3 ^= bytes[i + 10] << 16;\n\n            case 10:\n                k3 ^= bytes[i + 9] << 8;\n\n            case 9:\n                k3 ^= bytes[i + 8];\n                k3 = _x86Multiply(k3, c3);\n                k3 = _x86Rotl(k3, 17);\n                k3 = _x86Multiply(k3, c4);\n                h3 ^= k3;\n\n            case 8:\n                k2 ^= bytes[i + 7] << 24;\n\n            case 7:\n                k2 ^= bytes[i + 6] << 16;\n\n            case 6:\n                k2 ^= bytes[i + 5] << 8;\n\n            case 5:\n                k2 ^= bytes[i + 4];\n                k2 = _x86Multiply(k2, c2);\n                k2 = _x86Rotl(k2, 16);\n                k2 = _x86Multiply(k2, c3);\n                h2 ^= k2;\n\n            case 4:\n                k1 ^= bytes[i + 3] << 24;\n\n            case 3:\n                k1 ^= bytes[i + 2] << 16;\n\n            case 2:\n                k1 ^= bytes[i + 1] << 8;\n\n            case 1:\n                k1 ^= bytes[i];\n                k1 = _x86Multiply(k1, c1);\n                k1 = _x86Rotl(k1, 15);\n                k1 = _x86Multiply(k1, c2);\n                h1 ^= k1;\n        }\n\n        h1 ^= bytes.length;\n        h2 ^= bytes.length;\n        h3 ^= bytes.length;\n        h4 ^= bytes.length;\n\n        h1 += h2;\n        h1 += h3;\n        h1 += h4;\n        h2 += h1;\n        h3 += h1;\n        h4 += h1;\n\n        h1 = _x86Fmix(h1);\n        h2 = _x86Fmix(h2);\n        h3 = _x86Fmix(h3);\n        h4 = _x86Fmix(h4);\n\n        h1 += h2;\n        h1 += h3;\n        h1 += h4;\n        h2 += h1;\n        h3 += h1;\n        h4 += h1;\n\n        return (\"00000000\" + (h1 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h3 >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h4 >>> 0).toString(16)).slice(-8);\n    };\n\n    library.x64.hash128 = function (bytes, seed) {\n        //\n        // Given a string and an optional seed as an int, returns a 128 bit\n        // hash using the x64 flavor of MurmurHash3, as an unsigned hex.\n        //\n        if (library.inputValidation && !_validBytes(bytes)) {\n            return undefined;\n        }\n        seed = seed || 0;\n\n        var remainder = bytes.length % 16;\n        var blocks = bytes.length - remainder;\n\n        var h1 = [0, seed];\n        var h2 = [0, seed];\n\n        var k1 = [0, 0];\n        var k2 = [0, 0];\n\n        var c1 = [0x87c37b91, 0x114253d5];\n        var c2 = [0x4cf5ad43, 0x2745937f];\n\n        for (var i = 0; i < blocks; i = i + 16) {\n            k1 = [(bytes[i + 4]) | (bytes[i + 5] << 8) | (bytes[i + 6] << 16) | (bytes[i + 7] << 24), (bytes[i]) |\n                (bytes[i + 1] << 8) | (bytes[i + 2] << 16) | (bytes[i + 3] << 24)];\n            k2 = [(bytes[i + 12]) | (bytes[i + 13] << 8) | (bytes[i + 14] << 16) | (bytes[i + 15] << 24), (bytes[i + 8]) |\n                (bytes[i + 9] << 8) | (bytes[i + 10] << 16) | (bytes[i + 11] << 24)];\n\n            k1 = _x64Multiply(k1, c1);\n            k1 = _x64Rotl(k1, 31);\n            k1 = _x64Multiply(k1, c2);\n            h1 = _x64Xor(h1, k1);\n\n            h1 = _x64Rotl(h1, 27);\n            h1 = _x64Add(h1, h2);\n            h1 = _x64Add(_x64Multiply(h1, [0, 5]), [0, 0x52dce729]);\n\n            k2 = _x64Multiply(k2, c2);\n            k2 = _x64Rotl(k2, 33);\n            k2 = _x64Multiply(k2, c1);\n            h2 = _x64Xor(h2, k2);\n\n            h2 = _x64Rotl(h2, 31);\n            h2 = _x64Add(h2, h1);\n            h2 = _x64Add(_x64Multiply(h2, [0, 5]), [0, 0x38495ab5]);\n        }\n\n        k1 = [0, 0];\n        k2 = [0, 0];\n\n        switch (remainder) {\n            case 15:\n                k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 14]], 48));\n\n            case 14:\n                k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 13]], 40));\n\n            case 13:\n                k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 12]], 32));\n\n            case 12:\n                k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 11]], 24));\n\n            case 11:\n                k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 10]], 16));\n\n            case 10:\n                k2 = _x64Xor(k2, _x64LeftShift([0, bytes[i + 9]], 8));\n\n            case 9:\n                k2 = _x64Xor(k2, [0, bytes[i + 8]]);\n                k2 = _x64Multiply(k2, c2);\n                k2 = _x64Rotl(k2, 33);\n                k2 = _x64Multiply(k2, c1);\n                h2 = _x64Xor(h2, k2);\n\n            case 8:\n                k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 7]], 56));\n\n            case 7:\n                k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 6]], 48));\n\n            case 6:\n                k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 5]], 40));\n\n            case 5:\n                k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 4]], 32));\n\n            case 4:\n                k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 3]], 24));\n\n            case 3:\n                k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 2]], 16));\n\n            case 2:\n                k1 = _x64Xor(k1, _x64LeftShift([0, bytes[i + 1]], 8));\n\n            case 1:\n                k1 = _x64Xor(k1, [0, bytes[i]]);\n                k1 = _x64Multiply(k1, c1);\n                k1 = _x64Rotl(k1, 31);\n                k1 = _x64Multiply(k1, c2);\n                h1 = _x64Xor(h1, k1);\n        }\n\n        h1 = _x64Xor(h1, [0, bytes.length]);\n        h2 = _x64Xor(h2, [0, bytes.length]);\n\n        h1 = _x64Add(h1, h2);\n        h2 = _x64Add(h2, h1);\n\n        h1 = _x64Fmix(h1);\n        h2 = _x64Fmix(h2);\n\n        h1 = _x64Add(h1, h2);\n        h2 = _x64Add(h2, h1);\n\n        return (\"00000000\" + (h1[0] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h1[1] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2[0] >>> 0).toString(16)).slice(-8) + (\"00000000\" + (h2[1] >>> 0).toString(16)).slice(-8);\n    };\n\n    // INITIALIZATION\n    // --------------\n\n    // Export murmurHash3 for CommonJS, either as an AMD module or just as part\n    // of the global object.\n    if (typeof exports !== 'undefined') {\n\n        if (typeof module !== 'undefined' && module.exports) {\n            exports = module.exports = library;\n        }\n\n        exports.murmurHash3 = library;\n\n    } else if (typeof define === 'function' && define.amd) {\n\n        define([], function () {\n            return library;\n        });\n    } else {\n\n        // Use murmurHash3.noConflict to restore `murmurHash3` back to its\n        // original value. Returns a reference to the library object, to allow\n        // it to be used under a different name.\n        library._murmurHash3 = root.murmurHash3;\n\n        library.noConflict = function () {\n            root.murmurHash3 = library._murmurHash3;\n            library._murmurHash3 = undefined;\n            library.noConflict = undefined;\n\n            return library;\n        };\n\n        root.murmurHash3 = library;\n    }\n})(this);\n","'use strict'\n\n/**\n * @param {number} number\n * @returns {Uint8Array}\n */\nconst fromNumberTo32BitBuf = (number) => {\n  const bytes = new Uint8Array(4)\n\n  for (let i = 0; i < 4; i++) {\n    bytes[i] = number & 0xff\n    number = number >> 8\n  }\n\n  return bytes\n}\n\nmodule.exports = {\n  fromNumberTo32BitBuf\n}\n","'use strict'\n\n// @ts-ignore - no types available\nconst blake = require('blakejs')\n\nconst minB = 0xb201\nconst minS = 0xb241\n\nconst blake2b = {\n  init: blake.blake2bInit,\n  update: blake.blake2bUpdate,\n  digest: blake.blake2bFinal\n}\n\nconst blake2s = {\n  init: blake.blake2sInit,\n  update: blake.blake2sUpdate,\n  digest: blake.blake2sFinal\n}\n\n// Note that although this function doesn't do any asynchronous work, we mark\n// the function as async because it must return a Promise to match the API\n// for other functions that do perform asynchronous work (see sha.browser.js)\n// eslint-disable-next-line\n\n/**\n * @param {number} size\n * @param {any} hf\n * @returns {import('./types').Digest}\n */\nconst makeB2Hash = (size, hf) => async (data) => {\n  const ctx = hf.init(size, null)\n  hf.update(ctx, data)\n  return hf.digest(ctx)\n}\n\n/**\n * @param {Record<number, import('./types').Digest>} table\n */\nmodule.exports = (table) => {\n  for (let i = 0; i < 64; i++) {\n    table[minB + i] = makeB2Hash(i + 1, blake2b)\n  }\n  for (let i = 0; i < 32; i++) {\n    table[minS + i] = makeB2Hash(i + 1, blake2s)\n  }\n}\n","var b2b = require('./blake2b')\nvar b2s = require('./blake2s')\n\nmodule.exports = {\n  blake2b: b2b.blake2b,\n  blake2bHex: b2b.blake2bHex,\n  blake2bInit: b2b.blake2bInit,\n  blake2bUpdate: b2b.blake2bUpdate,\n  blake2bFinal: b2b.blake2bFinal,\n  blake2s: b2s.blake2s,\n  blake2sHex: b2s.blake2sHex,\n  blake2sInit: b2s.blake2sInit,\n  blake2sUpdate: b2s.blake2sUpdate,\n  blake2sFinal: b2s.blake2sFinal\n}\n","// Blake2B in pure Javascript\n// Adapted from the reference implementation in RFC7693\n// Ported to Javascript by DC - https://github.com/dcposch\n\nvar util = require('./util')\n\n// 64-bit unsigned addition\n// Sets v[a,a+1] += v[b,b+1]\n// v should be a Uint32Array\nfunction ADD64AA (v, a, b) {\n  var o0 = v[a] + v[b]\n  var o1 = v[a + 1] + v[b + 1]\n  if (o0 >= 0x100000000) {\n    o1++\n  }\n  v[a] = o0\n  v[a + 1] = o1\n}\n\n// 64-bit unsigned addition\n// Sets v[a,a+1] += b\n// b0 is the low 32 bits of b, b1 represents the high 32 bits\nfunction ADD64AC (v, a, b0, b1) {\n  var o0 = v[a] + b0\n  if (b0 < 0) {\n    o0 += 0x100000000\n  }\n  var o1 = v[a + 1] + b1\n  if (o0 >= 0x100000000) {\n    o1++\n  }\n  v[a] = o0\n  v[a + 1] = o1\n}\n\n// Little-endian byte access\nfunction B2B_GET32 (arr, i) {\n  return (arr[i] ^\n  (arr[i + 1] << 8) ^\n  (arr[i + 2] << 16) ^\n  (arr[i + 3] << 24))\n}\n\n// G Mixing function\n// The ROTRs are inlined for speed\nfunction B2B_G (a, b, c, d, ix, iy) {\n  var x0 = m[ix]\n  var x1 = m[ix + 1]\n  var y0 = m[iy]\n  var y1 = m[iy + 1]\n\n  ADD64AA(v, a, b) // v[a,a+1] += v[b,b+1] ... in JS we must store a uint64 as two uint32s\n  ADD64AC(v, a, x0, x1) // v[a, a+1] += x ... x0 is the low 32 bits of x, x1 is the high 32 bits\n\n  // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated to the right by 32 bits\n  var xor0 = v[d] ^ v[a]\n  var xor1 = v[d + 1] ^ v[a + 1]\n  v[d] = xor1\n  v[d + 1] = xor0\n\n  ADD64AA(v, c, d)\n\n  // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 24 bits\n  xor0 = v[b] ^ v[c]\n  xor1 = v[b + 1] ^ v[c + 1]\n  v[b] = (xor0 >>> 24) ^ (xor1 << 8)\n  v[b + 1] = (xor1 >>> 24) ^ (xor0 << 8)\n\n  ADD64AA(v, a, b)\n  ADD64AC(v, a, y0, y1)\n\n  // v[d,d+1] = (v[d,d+1] xor v[a,a+1]) rotated right by 16 bits\n  xor0 = v[d] ^ v[a]\n  xor1 = v[d + 1] ^ v[a + 1]\n  v[d] = (xor0 >>> 16) ^ (xor1 << 16)\n  v[d + 1] = (xor1 >>> 16) ^ (xor0 << 16)\n\n  ADD64AA(v, c, d)\n\n  // v[b,b+1] = (v[b,b+1] xor v[c,c+1]) rotated right by 63 bits\n  xor0 = v[b] ^ v[c]\n  xor1 = v[b + 1] ^ v[c + 1]\n  v[b] = (xor1 >>> 31) ^ (xor0 << 1)\n  v[b + 1] = (xor0 >>> 31) ^ (xor1 << 1)\n}\n\n// Initialization Vector\nvar BLAKE2B_IV32 = new Uint32Array([\n  0xF3BCC908, 0x6A09E667, 0x84CAA73B, 0xBB67AE85,\n  0xFE94F82B, 0x3C6EF372, 0x5F1D36F1, 0xA54FF53A,\n  0xADE682D1, 0x510E527F, 0x2B3E6C1F, 0x9B05688C,\n  0xFB41BD6B, 0x1F83D9AB, 0x137E2179, 0x5BE0CD19\n])\n\nvar SIGMA8 = [\n  0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n  14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,\n  11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,\n  7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,\n  9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,\n  2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,\n  12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11,\n  13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10,\n  6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5,\n  10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0,\n  0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n  14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3\n]\n\n// These are offsets into a uint64 buffer.\n// Multiply them all by 2 to make them offsets into a uint32 buffer,\n// because this is Javascript and we don't have uint64s\nvar SIGMA82 = new Uint8Array(SIGMA8.map(function (x) { return x * 2 }))\n\n// Compression function. 'last' flag indicates last block.\n// Note we're representing 16 uint64s as 32 uint32s\nvar v = new Uint32Array(32)\nvar m = new Uint32Array(32)\nfunction blake2bCompress (ctx, last) {\n  var i = 0\n\n  // init work variables\n  for (i = 0; i < 16; i++) {\n    v[i] = ctx.h[i]\n    v[i + 16] = BLAKE2B_IV32[i]\n  }\n\n  // low 64 bits of offset\n  v[24] = v[24] ^ ctx.t\n  v[25] = v[25] ^ (ctx.t / 0x100000000)\n  // high 64 bits not supported, offset may not be higher than 2**53-1\n\n  // last block flag set ?\n  if (last) {\n    v[28] = ~v[28]\n    v[29] = ~v[29]\n  }\n\n  // get little-endian words\n  for (i = 0; i < 32; i++) {\n    m[i] = B2B_GET32(ctx.b, 4 * i)\n  }\n\n  // twelve rounds of mixing\n  // uncomment the DebugPrint calls to log the computation\n  // and match the RFC sample documentation\n  // util.debugPrint('          m[16]', m, 64)\n  for (i = 0; i < 12; i++) {\n    // util.debugPrint('   (i=' + (i < 10 ? ' ' : '') + i + ') v[16]', v, 64)\n    B2B_G(0, 8, 16, 24, SIGMA82[i * 16 + 0], SIGMA82[i * 16 + 1])\n    B2B_G(2, 10, 18, 26, SIGMA82[i * 16 + 2], SIGMA82[i * 16 + 3])\n    B2B_G(4, 12, 20, 28, SIGMA82[i * 16 + 4], SIGMA82[i * 16 + 5])\n    B2B_G(6, 14, 22, 30, SIGMA82[i * 16 + 6], SIGMA82[i * 16 + 7])\n    B2B_G(0, 10, 20, 30, SIGMA82[i * 16 + 8], SIGMA82[i * 16 + 9])\n    B2B_G(2, 12, 22, 24, SIGMA82[i * 16 + 10], SIGMA82[i * 16 + 11])\n    B2B_G(4, 14, 16, 26, SIGMA82[i * 16 + 12], SIGMA82[i * 16 + 13])\n    B2B_G(6, 8, 18, 28, SIGMA82[i * 16 + 14], SIGMA82[i * 16 + 15])\n  }\n  // util.debugPrint('   (i=12) v[16]', v, 64)\n\n  for (i = 0; i < 16; i++) {\n    ctx.h[i] = ctx.h[i] ^ v[i] ^ v[i + 16]\n  }\n  // util.debugPrint('h[8]', ctx.h, 64)\n}\n\n// Creates a BLAKE2b hashing context\n// Requires an output length between 1 and 64 bytes\n// Takes an optional Uint8Array key\nfunction blake2bInit (outlen, key) {\n  if (outlen === 0 || outlen > 64) {\n    throw new Error('Illegal output length, expected 0 < length <= 64')\n  }\n  if (key && key.length > 64) {\n    throw new Error('Illegal key, expected Uint8Array with 0 < length <= 64')\n  }\n\n  // state, 'param block'\n  var ctx = {\n    b: new Uint8Array(128),\n    h: new Uint32Array(16),\n    t: 0, // input count\n    c: 0, // pointer within buffer\n    outlen: outlen // output length in bytes\n  }\n\n  // initialize hash state\n  for (var i = 0; i < 16; i++) {\n    ctx.h[i] = BLAKE2B_IV32[i]\n  }\n  var keylen = key ? key.length : 0\n  ctx.h[0] ^= 0x01010000 ^ (keylen << 8) ^ outlen\n\n  // key the hash, if applicable\n  if (key) {\n    blake2bUpdate(ctx, key)\n    // at the end\n    ctx.c = 128\n  }\n\n  return ctx\n}\n\n// Updates a BLAKE2b streaming hash\n// Requires hash context and Uint8Array (byte array)\nfunction blake2bUpdate (ctx, input) {\n  for (var i = 0; i < input.length; i++) {\n    if (ctx.c === 128) { // buffer full ?\n      ctx.t += ctx.c // add counters\n      blake2bCompress(ctx, false) // compress (not last)\n      ctx.c = 0 // counter to zero\n    }\n    ctx.b[ctx.c++] = input[i]\n  }\n}\n\n// Completes a BLAKE2b streaming hash\n// Returns a Uint8Array containing the message digest\nfunction blake2bFinal (ctx) {\n  ctx.t += ctx.c // mark last block offset\n\n  while (ctx.c < 128) { // fill up with zeros\n    ctx.b[ctx.c++] = 0\n  }\n  blake2bCompress(ctx, true) // final block flag = 1\n\n  // little endian convert and store\n  var out = new Uint8Array(ctx.outlen)\n  for (var i = 0; i < ctx.outlen; i++) {\n    out[i] = ctx.h[i >> 2] >> (8 * (i & 3))\n  }\n  return out\n}\n\n// Computes the BLAKE2B hash of a string or byte array, and returns a Uint8Array\n//\n// Returns a n-byte Uint8Array\n//\n// Parameters:\n// - input - the input bytes, as a string, Buffer or Uint8Array\n// - key - optional key Uint8Array, up to 64 bytes\n// - outlen - optional output length in bytes, default 64\nfunction blake2b (input, key, outlen) {\n  // preprocess inputs\n  outlen = outlen || 64\n  input = util.normalizeInput(input)\n\n  // do the math\n  var ctx = blake2bInit(outlen, key)\n  blake2bUpdate(ctx, input)\n  return blake2bFinal(ctx)\n}\n\n// Computes the BLAKE2B hash of a string or byte array\n//\n// Returns an n-byte hash in hex, all lowercase\n//\n// Parameters:\n// - input - the input bytes, as a string, Buffer, or Uint8Array\n// - key - optional key Uint8Array, up to 64 bytes\n// - outlen - optional output length in bytes, default 64\nfunction blake2bHex (input, key, outlen) {\n  var output = blake2b(input, key, outlen)\n  return util.toHex(output)\n}\n\nmodule.exports = {\n  blake2b: blake2b,\n  blake2bHex: blake2bHex,\n  blake2bInit: blake2bInit,\n  blake2bUpdate: blake2bUpdate,\n  blake2bFinal: blake2bFinal\n}\n","var ERROR_MSG_INPUT = 'Input must be an string, Buffer or Uint8Array'\n\n// For convenience, let people hash a string, not just a Uint8Array\nfunction normalizeInput (input) {\n  var ret\n  if (input instanceof Uint8Array) {\n    ret = input\n  } else if (input instanceof Buffer) {\n    ret = new Uint8Array(input)\n  } else if (typeof (input) === 'string') {\n    ret = new Uint8Array(Buffer.from(input, 'utf8'))\n  } else {\n    throw new Error(ERROR_MSG_INPUT)\n  }\n  return ret\n}\n\n// Converts a Uint8Array to a hexadecimal string\n// For example, toHex([255, 0, 255]) returns \"ff00ff\"\nfunction toHex (bytes) {\n  return Array.prototype.map.call(bytes, function (n) {\n    return (n < 16 ? '0' : '') + n.toString(16)\n  }).join('')\n}\n\n// Converts any value in [0...2^32-1] to an 8-character hex string\nfunction uint32ToHex (val) {\n  return (0x100000000 + val).toString(16).substring(1)\n}\n\n// For debugging: prints out hash state in the same format as the RFC\n// sample computation exactly, so that you can diff\nfunction debugPrint (label, arr, size) {\n  var msg = '\\n' + label + ' = '\n  for (var i = 0; i < arr.length; i += 2) {\n    if (size === 32) {\n      msg += uint32ToHex(arr[i]).toUpperCase()\n      msg += ' '\n      msg += uint32ToHex(arr[i + 1]).toUpperCase()\n    } else if (size === 64) {\n      msg += uint32ToHex(arr[i + 1]).toUpperCase()\n      msg += uint32ToHex(arr[i]).toUpperCase()\n    } else throw new Error('Invalid size ' + size)\n    if (i % 6 === 4) {\n      msg += '\\n' + new Array(label.length + 4).join(' ')\n    } else if (i < arr.length - 2) {\n      msg += ' '\n    }\n  }\n  console.log(msg)\n}\n\n// For performance testing: generates N bytes of input, hashes M times\n// Measures and prints MB/second hash performance each time\nfunction testSpeed (hashFn, N, M) {\n  var startMs = new Date().getTime()\n\n  var input = new Uint8Array(N)\n  for (var i = 0; i < N; i++) {\n    input[i] = i % 256\n  }\n  var genMs = new Date().getTime()\n  console.log('Generated random input in ' + (genMs - startMs) + 'ms')\n  startMs = genMs\n\n  for (i = 0; i < M; i++) {\n    var hashHex = hashFn(input)\n    var hashMs = new Date().getTime()\n    var ms = hashMs - startMs\n    startMs = hashMs\n    console.log('Hashed in ' + ms + 'ms: ' + hashHex.substring(0, 20) + '...')\n    console.log(Math.round(N / (1 << 20) / (ms / 1000) * 100) / 100 + ' MB PER SECOND')\n  }\n}\n\nmodule.exports = {\n  normalizeInput: normalizeInput,\n  toHex: toHex,\n  debugPrint: debugPrint,\n  testSpeed: testSpeed\n}\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nvar base64 = require('base64-js')\nvar ieee754 = require('ieee754')\nvar customInspectSymbol =\n  (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n    ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n    : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nvar K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Print warning and recommend using `buffer` v4.x which has an Object\n *               implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n    typeof console.error === 'function') {\n  console.error(\n    'This browser lacks typed array (Uint8Array) support which is required by ' +\n    '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n  )\n}\n\nfunction typedArraySupport () {\n  // Can typed array instances can be augmented?\n  try {\n    var arr = new Uint8Array(1)\n    var proto = { foo: function () { return 42 } }\n    Object.setPrototypeOf(proto, Uint8Array.prototype)\n    Object.setPrototypeOf(arr, proto)\n    return arr.foo() === 42\n  } catch (e) {\n    return false\n  }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.buffer\n  }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.byteOffset\n  }\n})\n\nfunction createBuffer (length) {\n  if (length > K_MAX_LENGTH) {\n    throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n  }\n  // Return an augmented `Uint8Array` instance\n  var buf = new Uint8Array(length)\n  Object.setPrototypeOf(buf, Buffer.prototype)\n  return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new TypeError(\n        'The \"string\" argument must be of type string. Received type number'\n      )\n    }\n    return allocUnsafe(arg)\n  }\n  return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n  if (typeof value === 'string') {\n    return fromString(value, encodingOrOffset)\n  }\n\n  if (ArrayBuffer.isView(value)) {\n    return fromArrayView(value)\n  }\n\n  if (value == null) {\n    throw new TypeError(\n      'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n      'or Array-like Object. Received type ' + (typeof value)\n    )\n  }\n\n  if (isInstance(value, ArrayBuffer) ||\n      (value && isInstance(value.buffer, ArrayBuffer))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof SharedArrayBuffer !== 'undefined' &&\n      (isInstance(value, SharedArrayBuffer) ||\n      (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'number') {\n    throw new TypeError(\n      'The \"value\" argument must not be of type number. Received type number'\n    )\n  }\n\n  var valueOf = value.valueOf && value.valueOf()\n  if (valueOf != null && valueOf !== value) {\n    return Buffer.from(valueOf, encodingOrOffset, length)\n  }\n\n  var b = fromObject(value)\n  if (b) return b\n\n  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n      typeof value[Symbol.toPrimitive] === 'function') {\n    return Buffer.from(\n      value[Symbol.toPrimitive]('string'), encodingOrOffset, length\n    )\n  }\n\n  throw new TypeError(\n    'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n    'or Array-like Object. Received type ' + (typeof value)\n  )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be of type number')\n  } else if (size < 0) {\n    throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n  }\n}\n\nfunction alloc (size, fill, encoding) {\n  assertSize(size)\n  if (size <= 0) {\n    return createBuffer(size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpreted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(size).fill(fill, encoding)\n      : createBuffer(size).fill(fill)\n  }\n  return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n  assertSize(size)\n  return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8'\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('Unknown encoding: ' + encoding)\n  }\n\n  var length = byteLength(string, encoding) | 0\n  var buf = createBuffer(length)\n\n  var actual = buf.write(string, encoding)\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    buf = buf.slice(0, actual)\n  }\n\n  return buf\n}\n\nfunction fromArrayLike (array) {\n  var length = array.length < 0 ? 0 : checked(array.length) | 0\n  var buf = createBuffer(length)\n  for (var i = 0; i < length; i += 1) {\n    buf[i] = array[i] & 255\n  }\n  return buf\n}\n\nfunction fromArrayView (arrayView) {\n  if (isInstance(arrayView, Uint8Array)) {\n    var copy = new Uint8Array(arrayView)\n    return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n  }\n  return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\"offset\" is outside of buffer bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\"length\" is outside of buffer bounds')\n  }\n\n  var buf\n  if (byteOffset === undefined && length === undefined) {\n    buf = new Uint8Array(array)\n  } else if (length === undefined) {\n    buf = new Uint8Array(array, byteOffset)\n  } else {\n    buf = new Uint8Array(array, byteOffset, length)\n  }\n\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(buf, Buffer.prototype)\n\n  return buf\n}\n\nfunction fromObject (obj) {\n  if (Buffer.isBuffer(obj)) {\n    var len = checked(obj.length) | 0\n    var buf = createBuffer(len)\n\n    if (buf.length === 0) {\n      return buf\n    }\n\n    obj.copy(buf, 0, 0, len)\n    return buf\n  }\n\n  if (obj.length !== undefined) {\n    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n      return createBuffer(0)\n    }\n    return fromArrayLike(obj)\n  }\n\n  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n    return fromArrayLike(obj.data)\n  }\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= K_MAX_LENGTH) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return b != null && b._isBuffer === true &&\n    b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n  if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n  if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError(\n      'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n    )\n  }\n\n  if (a === b) return 0\n\n  var x = a.length\n  var y = b.length\n\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i]\n      y = b[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n}\n\nBuffer.concat = function concat (list, length) {\n  if (!Array.isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  var i\n  if (length === undefined) {\n    length = 0\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length\n    }\n  }\n\n  var buffer = Buffer.allocUnsafe(length)\n  var pos = 0\n  for (i = 0; i < list.length; ++i) {\n    var buf = list[i]\n    if (isInstance(buf, Uint8Array)) {\n      if (pos + buf.length > buffer.length) {\n        Buffer.from(buf).copy(buffer, pos)\n      } else {\n        Uint8Array.prototype.set.call(\n          buffer,\n          buf,\n          pos\n        )\n      }\n    } else if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    } else {\n      buf.copy(buffer, pos)\n    }\n    pos += buf.length\n  }\n  return buffer\n}\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    throw new TypeError(\n      'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n      'Received type ' + typeof string\n    )\n  }\n\n  var len = string.length\n  var mustMatch = (arguments.length > 2 && arguments[2] === true)\n  if (!mustMatch && len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  var loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) {\n          return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n        }\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n  var loweredCase = false\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0\n  start >>>= 0\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n  var i = b[n]\n  b[n] = b[m]\n  b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  var len = this.length\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (var i = 0; i < len; i += 2) {\n    swap(this, i, i + 1)\n  }\n  return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n  var len = this.length\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (var i = 0; i < len; i += 4) {\n    swap(this, i, i + 3)\n    swap(this, i + 1, i + 2)\n  }\n  return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n  var len = this.length\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (var i = 0; i < len; i += 8) {\n    swap(this, i, i + 7)\n    swap(this, i + 1, i + 6)\n    swap(this, i + 2, i + 5)\n    swap(this, i + 3, i + 4)\n  }\n  return this\n}\n\nBuffer.prototype.toString = function toString () {\n  var length = this.length\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n  var str = ''\n  var max = exports.INSPECT_MAX_BYTES\n  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n  if (this.length > max) str += ' ... '\n  return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n  Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (isInstance(target, Uint8Array)) {\n    target = Buffer.from(target, target.offset, target.byteLength)\n  }\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError(\n      'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n      'Received type ' + (typeof target)\n    )\n  }\n\n  if (start === undefined) {\n    start = 0\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0\n  }\n  if (thisStart === undefined) {\n    thisStart = 0\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0\n  end >>>= 0\n  thisStart >>>= 0\n  thisEnd >>>= 0\n\n  if (this === target) return 0\n\n  var x = thisEnd - thisStart\n  var y = end - start\n  var len = Math.min(x, y)\n\n  var thisCopy = this.slice(thisStart, thisEnd)\n  var targetCopy = target.slice(start, end)\n\n  for (var i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i]\n      y = targetCopy[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset\n    byteOffset = 0\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000\n  }\n  byteOffset = +byteOffset // Coerce to Number.\n  if (numberIsNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1)\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding)\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF // Search for a byte value [0-255]\n    if (typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  var indexSize = 1\n  var arrLength = arr.length\n  var valLength = val.length\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase()\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2\n      arrLength /= 2\n      valLength /= 2\n      byteOffset /= 2\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  var i\n  if (dir) {\n    var foundIndex = -1\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex\n        foundIndex = -1\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n    for (i = byteOffset; i >= 0; i--) {\n      var found = true\n      for (var j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0\n  var remaining = buf.length - offset\n  if (!length) {\n    length = remaining\n  } else {\n    length = Number(length)\n    if (length > remaining) {\n      length = remaining\n    }\n  }\n\n  var strLen = string.length\n\n  if (length > strLen / 2) {\n    length = strLen / 2\n  }\n  for (var i = 0; i < length; ++i) {\n    var parsed = parseInt(string.substr(i * 2, 2), 16)\n    if (numberIsNaN(parsed)) return i\n    buf[offset + i] = parsed\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8'\n    length = this.length\n    offset = 0\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset\n    length = this.length\n    offset = 0\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset >>> 0\n    if (isFinite(length)) {\n      length = length >>> 0\n      if (encoding === undefined) encoding = 'utf8'\n    } else {\n      encoding = length\n      length = undefined\n    }\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  var remaining = this.length - offset\n  if (length === undefined || length > remaining) length = remaining\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  var loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return asciiWrite(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n}\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end)\n  var res = []\n\n  var i = start\n  while (i < end) {\n    var firstByte = buf[i]\n    var codePoint = null\n    var bytesPerSequence = (firstByte > 0xEF)\n      ? 4\n      : (firstByte > 0xDF)\n          ? 3\n          : (firstByte > 0xBF)\n              ? 2\n              : 1\n\n    if (i + bytesPerSequence <= end) {\n      var secondByte, thirdByte, fourthByte, tempCodePoint\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1]\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          fourthByte = buf[i + 3]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD\n      bytesPerSequence = 1\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n      codePoint = 0xDC00 | codePoint & 0x3FF\n    }\n\n    res.push(codePoint)\n    i += bytesPerSequence\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nvar MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n  var len = codePoints.length\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  var res = ''\n  var i = 0\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    )\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  var ret = ''\n  end = Math.min(buf.length, end)\n\n  for (var i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F)\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  var ret = ''\n  end = Math.min(buf.length, end)\n\n  for (var i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i])\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  var len = buf.length\n\n  if (!start || start < 0) start = 0\n  if (!end || end < 0 || end > len) end = len\n\n  var out = ''\n  for (var i = start; i < end; ++i) {\n    out += hexSliceLookupTable[buf[i]]\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  var bytes = buf.slice(start, end)\n  var res = ''\n  // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n  for (var i = 0; i < bytes.length - 1; i += 2) {\n    res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  var len = this.length\n  start = ~~start\n  end = end === undefined ? len : ~~end\n\n  if (start < 0) {\n    start += len\n    if (start < 0) start = 0\n  } else if (start > len) {\n    start = len\n  }\n\n  if (end < 0) {\n    end += len\n    if (end < 0) end = 0\n  } else if (end > len) {\n    end = len\n  }\n\n  if (end < start) end = start\n\n  var newBuf = this.subarray(start, end)\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n  return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var val = this[offset]\n  var mul = 1\n  var i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length)\n  }\n\n  var val = this[offset + --byteLength]\n  var mul = 1\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n}\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var val = this[offset]\n  var mul = 1\n  var i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var i = byteLength\n  var mul = 1\n  var val = this[offset + --i]\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  var val = this[offset] | (this[offset + 1] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  var val = this[offset + 1] | (this[offset] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n}\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    var maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  var mul = 1\n  var i = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    var maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  var i = byteLength - 1\n  var mul = 1\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset + 3] = (value >>> 24)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 1] = (value >>> 8)\n  this[offset] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    var limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  var i = 0\n  var mul = 1\n  var sub = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    var limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  var i = byteLength - 1\n  var mul = 1\n  var sub = 0\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n  if (value < 0) value = 0xff + value + 1\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 3] = (value >>> 24)\n  return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (value < 0) value = 0xffffffff + value + 1\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4)\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8)\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n  if (!start) start = 0\n  if (!end && end !== 0) end = this.length\n  if (targetStart >= target.length) targetStart = target.length\n  if (!targetStart) targetStart = 0\n  if (end > 0 && end < start) end = start\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start\n  }\n\n  var len = end - start\n\n  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n    // Use built-in when available, missing from IE11\n    this.copyWithin(targetStart, start, end)\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, end),\n      targetStart\n    )\n  }\n\n  return len\n}\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start\n      start = 0\n      end = this.length\n    } else if (typeof end === 'string') {\n      encoding = end\n      end = this.length\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n    if (val.length === 1) {\n      var code = val.charCodeAt(0)\n      if ((encoding === 'utf8' && code < 128) ||\n          encoding === 'latin1') {\n        // Fast path: If `val` fits into a single byte, use that numeric value.\n        val = code\n      }\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255\n  } else if (typeof val === 'boolean') {\n    val = Number(val)\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0\n  end = end === undefined ? this.length : end >>> 0\n\n  if (!val) val = 0\n\n  var i\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val\n    }\n  } else {\n    var bytes = Buffer.isBuffer(val)\n      ? val\n      : Buffer.from(val, encoding)\n    var len = bytes.length\n    if (len === 0) {\n      throw new TypeError('The value \"' + val +\n        '\" is invalid for argument \"value\"')\n    }\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len]\n    }\n  }\n\n  return this\n}\n\n// HELPER FUNCTIONS\n// ================\n\nvar INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n  // Node takes equal signs as end of the Base64 encoding\n  str = str.split('=')[0]\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = str.trim().replace(INVALID_BASE64_RE, '')\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '='\n  }\n  return str\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity\n  var codePoint\n  var length = string.length\n  var leadSurrogate = null\n  var bytes = []\n\n  for (var i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i)\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n        leadSurrogate = codePoint\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n    }\n\n    leadSurrogate = null\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint)\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  var byteArray = []\n  for (var i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF)\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  var c, hi, lo\n  var byteArray = []\n  for (var i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i)\n    hi = c >> 8\n    lo = c % 256\n    byteArray.push(lo)\n    byteArray.push(hi)\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  for (var i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i]\n  }\n  return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n  return obj instanceof type ||\n    (obj != null && obj.constructor != null && obj.constructor.name != null &&\n      obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n  // For IE11 support\n  return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nvar hexSliceLookupTable = (function () {\n  var alphabet = '0123456789abcdef'\n  var table = new Array(256)\n  for (var i = 0; i < 16; ++i) {\n    var i16 = i * 16\n    for (var j = 0; j < 16; ++j) {\n      table[i16 + j] = alphabet[i] + alphabet[j]\n    }\n  }\n  return table\n})()\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n","// BLAKE2s hash function in pure Javascript\n// Adapted from the reference implementation in RFC7693\n// Ported to Javascript by DC - https://github.com/dcposch\n\nvar util = require('./util')\n\n// Little-endian byte access.\n// Expects a Uint8Array and an index\n// Returns the little-endian uint32 at v[i..i+3]\nfunction B2S_GET32 (v, i) {\n  return v[i] ^ (v[i + 1] << 8) ^ (v[i + 2] << 16) ^ (v[i + 3] << 24)\n}\n\n// Mixing function G.\nfunction B2S_G (a, b, c, d, x, y) {\n  v[a] = v[a] + v[b] + x\n  v[d] = ROTR32(v[d] ^ v[a], 16)\n  v[c] = v[c] + v[d]\n  v[b] = ROTR32(v[b] ^ v[c], 12)\n  v[a] = v[a] + v[b] + y\n  v[d] = ROTR32(v[d] ^ v[a], 8)\n  v[c] = v[c] + v[d]\n  v[b] = ROTR32(v[b] ^ v[c], 7)\n}\n\n// 32-bit right rotation\n// x should be a uint32\n// y must be between 1 and 31, inclusive\nfunction ROTR32 (x, y) {\n  return (x >>> y) ^ (x << (32 - y))\n}\n\n// Initialization Vector.\nvar BLAKE2S_IV = new Uint32Array([\n  0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A,\n  0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19])\n\nvar SIGMA = new Uint8Array([\n  0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n  14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3,\n  11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4,\n  7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8,\n  9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13,\n  2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9,\n  12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11,\n  13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10,\n  6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5,\n  10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0])\n\n// Compression function. \"last\" flag indicates last block\nvar v = new Uint32Array(16)\nvar m = new Uint32Array(16)\nfunction blake2sCompress (ctx, last) {\n  var i = 0\n  for (i = 0; i < 8; i++) { // init work variables\n    v[i] = ctx.h[i]\n    v[i + 8] = BLAKE2S_IV[i]\n  }\n\n  v[12] ^= ctx.t // low 32 bits of offset\n  v[13] ^= (ctx.t / 0x100000000) // high 32 bits\n  if (last) { // last block flag set ?\n    v[14] = ~v[14]\n  }\n\n  for (i = 0; i < 16; i++) { // get little-endian words\n    m[i] = B2S_GET32(ctx.b, 4 * i)\n  }\n\n  // ten rounds of mixing\n  // uncomment the DebugPrint calls to log the computation\n  // and match the RFC sample documentation\n  // util.debugPrint('          m[16]', m, 32)\n  for (i = 0; i < 10; i++) {\n    // util.debugPrint('   (i=' + i + ')  v[16]', v, 32)\n    B2S_G(0, 4, 8, 12, m[SIGMA[i * 16 + 0]], m[SIGMA[i * 16 + 1]])\n    B2S_G(1, 5, 9, 13, m[SIGMA[i * 16 + 2]], m[SIGMA[i * 16 + 3]])\n    B2S_G(2, 6, 10, 14, m[SIGMA[i * 16 + 4]], m[SIGMA[i * 16 + 5]])\n    B2S_G(3, 7, 11, 15, m[SIGMA[i * 16 + 6]], m[SIGMA[i * 16 + 7]])\n    B2S_G(0, 5, 10, 15, m[SIGMA[i * 16 + 8]], m[SIGMA[i * 16 + 9]])\n    B2S_G(1, 6, 11, 12, m[SIGMA[i * 16 + 10]], m[SIGMA[i * 16 + 11]])\n    B2S_G(2, 7, 8, 13, m[SIGMA[i * 16 + 12]], m[SIGMA[i * 16 + 13]])\n    B2S_G(3, 4, 9, 14, m[SIGMA[i * 16 + 14]], m[SIGMA[i * 16 + 15]])\n  }\n  // util.debugPrint('   (i=10) v[16]', v, 32)\n\n  for (i = 0; i < 8; i++) {\n    ctx.h[i] ^= v[i] ^ v[i + 8]\n  }\n  // util.debugPrint('h[8]', ctx.h, 32)\n}\n\n// Creates a BLAKE2s hashing context\n// Requires an output length between 1 and 32 bytes\n// Takes an optional Uint8Array key\nfunction blake2sInit (outlen, key) {\n  if (!(outlen > 0 && outlen <= 32)) {\n    throw new Error('Incorrect output length, should be in [1, 32]')\n  }\n  var keylen = key ? key.length : 0\n  if (key && !(keylen > 0 && keylen <= 32)) {\n    throw new Error('Incorrect key length, should be in [1, 32]')\n  }\n\n  var ctx = {\n    h: new Uint32Array(BLAKE2S_IV), // hash state\n    b: new Uint32Array(64), // input block\n    c: 0, // pointer within block\n    t: 0, // input count\n    outlen: outlen // output length in bytes\n  }\n  ctx.h[0] ^= 0x01010000 ^ (keylen << 8) ^ outlen\n\n  if (keylen > 0) {\n    blake2sUpdate(ctx, key)\n    ctx.c = 64 // at the end\n  }\n\n  return ctx\n}\n\n// Updates a BLAKE2s streaming hash\n// Requires hash context and Uint8Array (byte array)\nfunction blake2sUpdate (ctx, input) {\n  for (var i = 0; i < input.length; i++) {\n    if (ctx.c === 64) { // buffer full ?\n      ctx.t += ctx.c // add counters\n      blake2sCompress(ctx, false) // compress (not last)\n      ctx.c = 0 // counter to zero\n    }\n    ctx.b[ctx.c++] = input[i]\n  }\n}\n\n// Completes a BLAKE2s streaming hash\n// Returns a Uint8Array containing the message digest\nfunction blake2sFinal (ctx) {\n  ctx.t += ctx.c // mark last block offset\n  while (ctx.c < 64) { // fill up with zeros\n    ctx.b[ctx.c++] = 0\n  }\n  blake2sCompress(ctx, true) // final block flag = 1\n\n  // little endian convert and store\n  var out = new Uint8Array(ctx.outlen)\n  for (var i = 0; i < ctx.outlen; i++) {\n    out[i] = (ctx.h[i >> 2] >> (8 * (i & 3))) & 0xFF\n  }\n  return out\n}\n\n// Computes the BLAKE2S hash of a string or byte array, and returns a Uint8Array\n//\n// Returns a n-byte Uint8Array\n//\n// Parameters:\n// - input - the input bytes, as a string, Buffer, or Uint8Array\n// - key - optional key Uint8Array, up to 32 bytes\n// - outlen - optional output length in bytes, default 64\nfunction blake2s (input, key, outlen) {\n  // preprocess inputs\n  outlen = outlen || 32\n  input = util.normalizeInput(input)\n\n  // do the math\n  var ctx = blake2sInit(outlen, key)\n  blake2sUpdate(ctx, input)\n  return blake2sFinal(ctx)\n}\n\n// Computes the BLAKE2S hash of a string or byte array\n//\n// Returns an n-byte hash in hex, all lowercase\n//\n// Parameters:\n// - input - the input bytes, as a string, Buffer, or Uint8Array\n// - key - optional key Uint8Array, up to 32 bytes\n// - outlen - optional output length in bytes, default 64\nfunction blake2sHex (input, key, outlen) {\n  var output = blake2s(input, key, outlen)\n  return util.toHex(output)\n}\n\nmodule.exports = {\n  blake2s: blake2s,\n  blake2sHex: blake2sHex,\n  blake2sInit: blake2sInit,\n  blake2sUpdate: blake2sUpdate,\n  blake2sFinal: blake2sFinal\n}\n","'use strict'\n\nconst { mergeOptions } = require('../utils')\nconst { isTest } = require('ipfs-utils/src/env')\nconst log = require('debug')('ipfs')\nconst errCode = require('err-code')\nconst { DAGNode } = require('ipld-dag-pb')\nconst { UnixFS } = require('ipfs-unixfs')\nconst initAssets = require('../runtime/init-assets-nodejs')\nconst { AlreadyInitializedError } = require('../errors')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\nconst createStartAPI = require('./start')\nconst createStopAPI = require('./stop')\nconst createDNSAPI = require('./dns')\nconst createIsOnlineAPI = require('./is-online')\nconst createResolveAPI = require('./resolve')\nconst PinAPI = require('./pin')\nconst IPNSAPI = require('./ipns')\nconst NameAPI = require('./name')\nconst createRefsAPI = require('./refs')\nconst createRefsLocalAPI = require('./refs/local')\nconst BitswapAPI = require('./bitswap')\nconst BootstrapAPI = require('./bootstrap')\nconst BlockAPI = require('./block')\nconst RootAPI = require('./root')\nconst createVersionAPI = require('./version')\nconst createIDAPI = require('./id')\nconst createConfigAPI = require('./config')\nconst DagAPI = require('./dag')\nconst PinManagerAPI = require('./pin/pin-manager')\nconst createPreloadAPI = require('../preload')\nconst createMfsPreloadAPI = require('../mfs-preload')\nconst createFilesAPI = require('./files')\nconst KeyAPI = require('./key')\nconst ObjectAPI = require('./object')\nconst RepoAPI = require('./repo')\nconst StatsAPI = require('./stats')\nconst BlockService = require('ipfs-block-service')\nconst createIPLD = require('./ipld')\nconst Storage = require('./storage')\nconst Network = require('./network')\nconst Service = require('../utils/service')\nconst SwarmAPI = require('./swarm')\nconst createGCLockAPI = require('./gc-lock')\nconst createPingAPI = require('./ping')\nconst createDHTAPI = require('./dht')\nconst createPubSubAPI = require('./pubsub')\n\n/**\n * @typedef {import('../types').Options} Options\n * @typedef {import('../types').Print} Print\n * @typedef {import('./storage')} StorageAPI\n */\n\nclass IPFS {\n  /**\n   * @param {Object} config\n   * @param {Print} config.print\n   * @param {StorageAPI} config.storage\n   * @param {Options} config.options\n   */\n  constructor ({ print, storage, options }) {\n    const { peerId, repo, keychain } = storage\n    const network = Service.create(Network)\n\n    const preload = createPreloadAPI(options.preload)\n\n    const blockService = new BlockService(storage.repo)\n    const ipld = createIPLD({ blockService, options: options.ipld })\n\n    const gcLock = createGCLockAPI({\n      path: repo.path,\n      repoOwner: options.repoOwner\n    })\n    const dns = createDNSAPI()\n    const isOnline = createIsOnlineAPI({ network })\n    // @ts-ignore This type check fails as options.\n    // libp2p can be a function, while IPNS router config expects libp2p config\n    const ipns = new IPNSAPI(options)\n\n    const name = new NameAPI({\n      dns,\n      ipns,\n      ipld,\n      peerId,\n      isOnline,\n      keychain,\n      options\n    })\n    const resolve = createResolveAPI({ ipld, name })\n    const pinManager = new PinManagerAPI({ repo, ipld })\n    const pin = new PinAPI({ gcLock, pinManager, ipld })\n    const block = new BlockAPI({ blockService, preload, gcLock, pinManager, pin })\n    const dag = new DagAPI({ ipld, preload, gcLock, pin })\n    const refs = Object.assign(createRefsAPI({ ipld, resolve, preload }), {\n      local: createRefsLocalAPI({ repo: storage.repo })\n    })\n    const { add, addAll, cat, get, ls } = new RootAPI({\n      gcLock,\n      preload,\n      pin,\n      block,\n      ipld,\n      options: options.EXPERIMENTAL\n    })\n\n    const files = createFilesAPI({\n      ipld,\n      block,\n      blockService,\n      repo,\n      preload,\n      options\n    })\n\n    const mfsPreload = createMfsPreloadAPI({\n      files,\n      preload,\n      options: options.preload\n    })\n\n    this.preload = preload\n    this.name = name\n    this.ipld = ipld\n    this.ipns = ipns\n    this.pin = pin\n    this.resolve = resolve\n    this.block = block\n    this.refs = refs\n\n    this.start = createStartAPI({\n      network,\n      peerId,\n      repo,\n      blockService,\n      preload,\n      ipns,\n      mfsPreload,\n      print,\n      keychain,\n      options\n    })\n\n    this.stop = createStopAPI({\n      network,\n      preload,\n      mfsPreload,\n      blockService,\n      ipns,\n      repo\n    })\n\n    this.dht = createDHTAPI({ network, repo })\n    this.pubsub = createPubSubAPI({ network, config: options.config })\n    this.dns = dns\n    this.isOnline = isOnline\n    this.id = createIDAPI({ network, peerId })\n    this.version = createVersionAPI({ repo })\n    this.bitswap = new BitswapAPI({ network })\n    this.bootstrap = new BootstrapAPI({ repo })\n    this.config = createConfigAPI({ repo })\n    this.ping = createPingAPI({ network })\n\n    this.add = add\n    this.addAll = addAll\n    this.cat = cat\n    this.get = get\n    this.ls = ls\n\n    this.dag = dag\n    this.files = files\n    this.key = new KeyAPI({ keychain })\n    this.object = new ObjectAPI({ ipld, preload, gcLock })\n    this.repo = new RepoAPI({ gcLock, pin, repo, refs })\n    this.stats = new StatsAPI({ repo, network })\n    this.swarm = new SwarmAPI({ network })\n\n    // For the backwards compatibility\n    Object.defineProperty(this, 'libp2p', {\n      get () {\n        const net = network.try()\n        return net ? net.libp2p : undefined\n      }\n    })\n\n    // unimplemented methods\n    const notImplemented = () => Promise.reject(errCode(new Error('Not implemented'), 'ERR_NOT_IMPLEMENTED'))\n    const notImplementedIter = async function * () { throw errCode(new Error('Not implemented'), 'ERR_NOT_IMPLEMENTED') } // eslint-disable-line require-yield\n    this.commands = notImplemented\n    this.diag = {\n      cmds: notImplemented,\n      net: notImplemented,\n      sys: notImplemented\n    }\n    this.log = {\n      level: notImplemented,\n      ls: notImplemented,\n      tail: notImplementedIter\n    }\n    this.mount = notImplemented\n  }\n\n  /**\n   * `IPFS.create` will do the initialization. Keep this around for backwards\n   * compatibility.\n   *\n   * @deprecated\n   */\n  async init () { // eslint-disable-line require-await\n    throw new AlreadyInitializedError()\n  }\n\n  /**\n   * @param {Options} options\n   */\n  static async create (options = {}) {\n    options = mergeOptions(getDefaultOptions(), options)\n    const initOptions = options.init || {}\n\n    // eslint-disable-next-line no-console\n    const print = options.silent ? log : console.log\n    const storage = await Storage.start(print, options)\n    const config = await storage.repo.config.getAll()\n\n    const ipfs = new IPFS({\n      storage,\n      print,\n      options: { ...options, config }\n    })\n\n    await ipfs.preload.start()\n\n    ipfs.ipns.startOffline(storage)\n\n    if (storage.isNew && !initOptions.emptyRepo) {\n      // add empty unixfs dir object (go-ipfs assumes this exists)\n      const cid = await addEmptyDir(ipfs)\n\n      log('adding default assets')\n      await initAssets({ addAll: ipfs.addAll, print })\n\n      log('initializing IPNS keyspace')\n      await ipfs.ipns.initializeKeyspace(storage.peerId.privKey, uint8ArrayFromString(`/ipfs/${cid}`))\n    }\n\n    if (options.start !== false) {\n      await ipfs.start()\n    }\n\n    return ipfs\n  }\n}\n\nmodule.exports = IPFS\n\n/**\n * @param {IPFS} ipfs\n */\nconst addEmptyDir = async (ipfs) => {\n  const node = new DAGNode(new UnixFS({ type: 'directory' }).marshal())\n  const cid = await ipfs.dag.put(node, {\n    version: 0,\n    format: 'dag-pb',\n    hashAlg: 'sha2-256',\n    preload: false\n  })\n\n  await ipfs.pin.add(cid)\n\n  return cid\n}\n\n/**\n * @returns {Options}\n */\nconst getDefaultOptions = () => ({\n  start: true,\n  EXPERIMENTAL: {},\n  preload: {\n    enabled: !isTest, // preload by default, unless in test env\n    addresses: [\n      '/dns4/node0.preload.ipfs.io/https',\n      '/dns4/node1.preload.ipfs.io/https',\n      '/dns4/node2.preload.ipfs.io/https',\n      '/dns4/node3.preload.ipfs.io/https'\n    ]\n  }\n})\n","/* eslint-disable no-unreachable */\n'use strict'\n\nconst isIpfs = require('is-ipfs')\nconst CID = require('cids')\nconst Key = require('interface-datastore').Key\nconst errCode = require('err-code')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n/** @type {typeof Object.assign} */\nconst mergeOptions = require('merge-options')\nconst resolve = require('./components/dag/resolve')\n\n/**\n * @typedef {import('ipfs-core-types/src/utils').AbortOptions} AbortOptions\n */\n\nexports.mergeOptions = mergeOptions\n\nconst ERR_BAD_PATH = 'ERR_BAD_PATH'\n\nexports.OFFLINE_ERROR = 'This command must be run in online mode. Try running \\'ipfs daemon\\' first.'\nexports.MFS_ROOT_KEY = new Key('/local/filesroot')\nexports.MFS_MAX_CHUNK_SIZE = 262144\nexports.MFS_MAX_LINKS = 174\n\n/**\n * Returns a well-formed ipfs Path.\n * The returned path will always be prefixed with /ipfs/ or /ipns/.\n *\n * @param  {string | CID} pathStr - An ipfs-path, or ipns-path or a cid\n * @returns {string} - ipfs-path or ipns-path\n * @throws on an invalid @param pathStr\n */\nconst normalizePath = (pathStr) => {\n  if (isIpfs.cid(pathStr) || CID.isCID(pathStr)) {\n    return `/ipfs/${new CID(pathStr)}`\n  } else if (isIpfs.path(pathStr)) {\n    return pathStr\n  } else {\n    throw errCode(new Error(`invalid path: ${pathStr}`), ERR_BAD_PATH)\n  }\n}\n\n// TODO: do we need both normalizePath and normalizeCidPath?\n// TODO: don't forget ipfs-core-utils/src/to-cid-and-path\n/**\n * @param {Uint8Array|CID|string} path\n * @returns {string}\n */\nconst normalizeCidPath = (path) => {\n  if (path instanceof Uint8Array) {\n    return new CID(path).toString()\n  }\n  if (CID.isCID(path)) {\n    return path.toString()\n  }\n  if (path.indexOf('/ipfs/') === 0) {\n    path = path.substring('/ipfs/'.length)\n  }\n  if (path.charAt(path.length - 1) === '/') {\n    path = path.substring(0, path.length - 1)\n  }\n  return path\n}\n\n/**\n * Resolve various styles of an ipfs-path to the hash of the target node.\n * Follows links in the path.\n *\n * Accepts formats:\n * - <base58 string>\n * - <base58 string>/link/to/venus\n * - /ipfs/<base58 string>/link/to/pluto\n * - multihash Buffer\n *\n * @param {import('ipld')} ipld\n * @param {CID | string} ipfsPath - A CID or IPFS path\n * @param {Object} [options] - Optional options passed directly to dag.resolve\n * @returns {Promise<CID>}\n */\nconst resolvePath = async function (ipld, ipfsPath, options = {}) {\n  const preload = () => {}\n  preload.stop = () => {}\n  preload.start = () => {}\n\n  const { cid } = await resolve({ ipld, preload })(ipfsPath, { preload: false })\n\n  return cid\n}\n\n/**\n * @typedef {import('ipfs-unixfs-exporter').UnixFSEntry} UnixFSEntry\n *\n * @param {UnixFSEntry} file\n * @param {Object} [options]\n * @param {boolean} [options.includeContent]\n */\nconst mapFile = (file, options = {}) => {\n  if (file.type !== 'file' && file.type !== 'directory' && file.type !== 'raw') {\n    // file.type === object | identity not supported yet\n    throw new Error(`Unknown node type '${file.type}'`)\n  }\n\n  /** @type {import('ipfs-core-types/src/root').IPFSEntry} */\n  const output = {\n    cid: file.cid,\n    path: file.path,\n    name: file.name,\n    depth: file.path.split('/').length,\n    size: file.size,\n    type: 'file'\n  }\n\n  if (file.type === 'directory') {\n    // @ts-ignore - TS type can't be changed from File to Directory\n    output.type = 'dir'\n  }\n\n  if (file.type === 'file') {\n    output.size = file.unixfs.fileSize()\n  }\n\n  if (file.type === 'file' || file.type === 'directory') {\n    output.mode = file.unixfs.mode\n\n    if (file.unixfs.mtime !== undefined) {\n      output.mtime = file.unixfs.mtime\n    }\n  }\n\n  if (options.includeContent) {\n    if (file.type === 'file' || file.type === 'raw') {\n      // @ts-expect-error - content is readonly\n      output.content = file.content()\n    }\n  }\n\n  return output\n}\n\nconst withTimeout = withTimeoutOption(\n  /**\n   * @template T\n   * @param {Promise<T>|T} promise\n   * @param {AbortOptions} [_options]\n   * @returns {Promise<T>}\n   */\n  async (promise, _options) => await promise\n)\n\nexports.normalizePath = normalizePath\nexports.normalizeCidPath = normalizeCidPath\nexports.resolvePath = resolvePath\nexports.mapFile = mapFile\nexports.withTimeoutOption = withTimeoutOption\nexports.withTimeout = withTimeout\n","'use strict'\n\n/**\n * @typedef {import('./types').Datastore} Datastore\n * @typedef {import('./types').Batch} Batch\n * @typedef {import('interface-store').Options} Options\n * @typedef {import('./types').Query} Query\n * @typedef {import('./types').QueryFilter} QueryFilter\n * @typedef {import('./types').QueryOrder} QueryOrder\n * @typedef {import('./types').KeyQuery} KeyQuery\n * @typedef {import('./types').KeyQueryFilter} KeyQueryFilter\n * @typedef {import('./types').KeyQueryOrder} KeyQueryOrder\n * @typedef {import('./types').Pair} Pair\n */\n\nconst Key = require('./key')\nconst MemoryDatastore = require('./memory')\nconst utils = require('./utils')\nconst Errors = require('./errors')\nconst Adapter = require('./adapter')\n\nmodule.exports = {\n  Key,\n  MemoryDatastore,\n  utils,\n  Errors,\n  Adapter\n}\n","'use strict'\n\nconst { nanoid } = require('nanoid')\n\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\nconst symbol = Symbol.for('@ipfs/interface-datastore/key')\nconst pathSepS = '/'\nconst pathSepB = new TextEncoder().encode(pathSepS)\nconst pathSep = pathSepB[0]\n\n/**\n * A Key represents the unique identifier of an object.\n * Our Key scheme is inspired by file systems and Google App Engine key model.\n * Keys are meant to be unique across a system. Keys are hierarchical,\n * incorporating more and more specific namespaces. Thus keys can be deemed\n * 'children' or 'ancestors' of other keys:\n * - `new Key('/Comedy')`\n * - `new Key('/Comedy/MontyPython')`\n * Also, every namespace can be parametrized to embed relevant object\n * information. For example, the Key `name` (most specific namespace) could\n * include the object type:\n * - `new Key('/Comedy/MontyPython/Actor:JohnCleese')`\n * - `new Key('/Comedy/MontyPython/Sketch:CheeseShop')`\n * - `new Key('/Comedy/MontyPython/Sketch:CheeseShop/Character:Mousebender')`\n *\n */\nclass Key {\n  /**\n   * @param {string | Uint8Array} s\n   * @param {boolean} [clean]\n   */\n  constructor (s, clean) {\n    if (typeof s === 'string') {\n      this._buf = uint8ArrayFromString(s)\n    } else if (s instanceof Uint8Array) {\n      this._buf = s\n    } else {\n      throw new Error('Invalid key, should be String of Uint8Array')\n    }\n\n    if (clean == null) {\n      clean = true\n    }\n\n    if (clean) {\n      this.clean()\n    }\n\n    if (this._buf.byteLength === 0 || this._buf[0] !== pathSep) {\n      throw new Error('Invalid key')\n    }\n  }\n\n  /**\n   * Convert to the string representation\n   *\n   * @param {import('uint8arrays/to-string').SupportedEncodings} [encoding='utf8'] - The encoding to use.\n   * @returns {string}\n   */\n  toString (encoding = 'utf8') {\n    return uint8ArrayToString(this._buf, encoding)\n  }\n\n  /**\n   * Return the Uint8Array representation of the key\n   *\n   * @returns {Uint8Array}\n   */\n  uint8Array () {\n    return this._buf\n  }\n\n  get [symbol] () {\n    return true\n  }\n\n  /**\n   * Return string representation of the key\n   *\n   * @returns {string}\n   */\n  get [Symbol.toStringTag] () {\n    return `Key(${this.toString()})`\n  }\n\n  /**\n   * Constructs a key out of a namespace array.\n   *\n   * @param {Array<string>} list - The array of namespaces\n   * @returns {Key}\n   *\n   * @example\n   * ```js\n   * Key.withNamespaces(['one', 'two'])\n   * // => Key('/one/two')\n   * ```\n   */\n  static withNamespaces (list) {\n    return new Key(list.join(pathSepS))\n  }\n\n  /**\n   * Returns a randomly (uuid) generated key.\n   *\n   * @returns {Key}\n   *\n   * @example\n   * ```js\n   * Key.random()\n   * // => Key('/f98719ea086343f7b71f32ea9d9d521d')\n   * ```\n   */\n  static random () {\n    return new Key(nanoid().replace(/-/g, ''))\n  }\n\n  /**\n   * Cleanup the current key\n   *\n   * @returns {void}\n   */\n  clean () {\n    if (!this._buf || this._buf.byteLength === 0) {\n      this._buf = pathSepB\n    }\n\n    if (this._buf[0] !== pathSep) {\n      const bytes = new Uint8Array(this._buf.byteLength + 1)\n      bytes.fill(pathSep, 0, 1)\n      bytes.set(this._buf, 1)\n      this._buf = bytes\n    }\n\n    // normalize does not remove trailing slashes\n    while (this._buf.byteLength > 1 && this._buf[this._buf.byteLength - 1] === pathSep) {\n      this._buf = this._buf.subarray(0, -1)\n    }\n  }\n\n  /**\n   * Check if the given key is sorted lower than ourself.\n   *\n   * @param {Key} key - The other Key to check against\n   * @returns {boolean}\n   */\n  less (key) {\n    const list1 = this.list()\n    const list2 = key.list()\n\n    for (let i = 0; i < list1.length; i++) {\n      if (list2.length < i + 1) {\n        return false\n      }\n\n      const c1 = list1[i]\n      const c2 = list2[i]\n\n      if (c1 < c2) {\n        return true\n      } else if (c1 > c2) {\n        return false\n      }\n    }\n\n    return list1.length < list2.length\n  }\n\n  /**\n   * Returns the key with all parts in reversed order.\n   *\n   * @returns {Key}\n   *\n   * @example\n   * ```js\n   * new Key('/Comedy/MontyPython/Actor:JohnCleese').reverse()\n   * // => Key('/Actor:JohnCleese/MontyPython/Comedy')\n   * ```\n   */\n  reverse () {\n    return Key.withNamespaces(this.list().slice().reverse())\n  }\n\n  /**\n   * Returns the `namespaces` making up this Key.\n   *\n   * @returns {Array<string>}\n   */\n  namespaces () {\n    return this.list()\n  }\n\n  /** Returns the \"base\" namespace of this key.\n   *\n   * @returns {string}\n   *\n   * @example\n   * ```js\n   * new Key('/Comedy/MontyPython/Actor:JohnCleese').baseNamespace()\n   * // => 'Actor:JohnCleese'\n   * ```\n   */\n  baseNamespace () {\n    const ns = this.namespaces()\n    return ns[ns.length - 1]\n  }\n\n  /**\n   * Returns the `list` representation of this key.\n   *\n   * @returns {Array<string>}\n   *\n   * @example\n   * ```js\n   * new Key('/Comedy/MontyPython/Actor:JohnCleese').list()\n   * // => ['Comedy', 'MontyPythong', 'Actor:JohnCleese']\n   * ```\n   */\n  list () {\n    return this.toString().split(pathSepS).slice(1)\n  }\n\n  /**\n   * Returns the \"type\" of this key (value of last namespace).\n   *\n   * @returns {string}\n   *\n   * @example\n   * ```js\n   * new Key('/Comedy/MontyPython/Actor:JohnCleese').type()\n   * // => 'Actor'\n   * ```\n   */\n  type () {\n    return namespaceType(this.baseNamespace())\n  }\n\n  /**\n   * Returns the \"name\" of this key (field of last namespace).\n   *\n   * @returns {string}\n   *\n   * @example\n   * ```js\n   * new Key('/Comedy/MontyPython/Actor:JohnCleese').name()\n   * // => 'JohnCleese'\n   * ```\n   */\n  name () {\n    return namespaceValue(this.baseNamespace())\n  }\n\n  /**\n   * Returns an \"instance\" of this type key (appends value to namespace).\n   *\n   * @param {string} s - The string to append.\n   * @returns {Key}\n   *\n   * @example\n   * ```js\n   * new Key('/Comedy/MontyPython/Actor').instance('JohnClesse')\n   * // => Key('/Comedy/MontyPython/Actor:JohnCleese')\n   * ```\n   */\n  instance (s) {\n    return new Key(this.toString() + ':' + s)\n  }\n\n  /**\n   * Returns the \"path\" of this key (parent + type).\n   *\n   * @returns {Key}\n   *\n   * @example\n   * ```js\n   * new Key('/Comedy/MontyPython/Actor:JohnCleese').path()\n   * // => Key('/Comedy/MontyPython/Actor')\n   * ```\n   */\n  path () {\n    let p = this.parent().toString()\n    if (!p.endsWith(pathSepS)) {\n      p += pathSepS\n    }\n    p += this.type()\n    return new Key(p)\n  }\n\n  /**\n   * Returns the `parent` Key of this Key.\n   *\n   * @returns {Key}\n   *\n   * @example\n   * ```js\n   * new Key(\"/Comedy/MontyPython/Actor:JohnCleese\").parent()\n   * // => Key(\"/Comedy/MontyPython\")\n   * ```\n   */\n  parent () {\n    const list = this.list()\n    if (list.length === 1) {\n      return new Key(pathSepS)\n    }\n\n    return new Key(list.slice(0, -1).join(pathSepS))\n  }\n\n  /**\n   * Returns the `child` Key of this Key.\n   *\n   * @param {Key} key - The child Key to add\n   * @returns {Key}\n   *\n   * @example\n   * ```js\n   * new Key('/Comedy/MontyPython').child(new Key('Actor:JohnCleese'))\n   * // => Key('/Comedy/MontyPython/Actor:JohnCleese')\n   * ```\n   */\n  child (key) {\n    if (this.toString() === pathSepS) {\n      return key\n    } else if (key.toString() === pathSepS) {\n      return this\n    }\n\n    return new Key(this.toString() + key.toString(), false)\n  }\n\n  /**\n   * Returns whether this key is a prefix of `other`\n   *\n   * @param {Key} other - The other key to test against\n   * @returns {boolean}\n   *\n   * @example\n   * ```js\n   * new Key('/Comedy').isAncestorOf('/Comedy/MontyPython')\n   * // => true\n   * ```\n   */\n  isAncestorOf (other) {\n    if (other.toString() === this.toString()) {\n      return false\n    }\n\n    return other.toString().startsWith(this.toString())\n  }\n\n  /**\n   * Returns whether this key is a contains another as prefix.\n   *\n   * @param {Key} other - The other Key to test against\n   * @returns {boolean}\n   *\n   * @example\n   * ```js\n   * new Key('/Comedy/MontyPython').isDecendantOf('/Comedy')\n   * // => true\n   * ```\n   */\n  isDecendantOf (other) {\n    if (other.toString() === this.toString()) {\n      return false\n    }\n\n    return this.toString().startsWith(other.toString())\n  }\n\n  /**\n   * Checks if this key has only one namespace.\n   *\n   * @returns {boolean}\n   *\n   */\n  isTopLevel () {\n    return this.list().length === 1\n  }\n\n  /**\n   * Concats one or more Keys into one new Key.\n   *\n   * @param {Array<Key>} keys - The array of keys to concatenate\n   * @returns {Key}\n   */\n  concat (...keys) {\n    return Key.withNamespaces([...this.namespaces(), ...flatten(keys.map(key => key.namespaces()))])\n  }\n\n  /**\n   * Check if value is a Key instance\n   *\n   * @param {any} value - Value to check\n   * @returns {value is Key}\n   */\n  static isKey (value) {\n    return value instanceof Key || Boolean(value && value[symbol])\n  }\n}\n\n/**\n * The first component of a namespace. `foo` in `foo:bar`\n *\n * @param {string} ns\n * @returns {string}\n */\nfunction namespaceType (ns) {\n  const parts = ns.split(':')\n  if (parts.length < 2) {\n    return ''\n  }\n  return parts.slice(0, -1).join(':')\n}\n\n/**\n * The last component of a namespace, `baz` in `foo:bar:baz`.\n *\n * @param {string} ns\n * @returns {string}\n */\nfunction namespaceValue (ns) {\n  const parts = ns.split(':')\n  return parts[parts.length - 1]\n}\n\n/**\n * Flatten array of arrays (only one level)\n *\n * @template T\n * @param {Array<T|T[]>} arr\n * @returns {T[]}\n */\nfunction flatten (arr) {\n  return /** @type {T[]} */([]).concat(...arr)\n}\n\nmodule.exports = Key\n","let crypto = require('crypto')\n\nlet { urlAlphabet } = require('./url-alphabet/index.cjs')\n\n// It is best to make fewer, larger requests to the crypto module to\n// avoid system call overhead. So, random numbers are generated in a\n// pool. The pool is a Buffer that is larger than the initial random\n// request size by this multiplier. The pool is enlarged if subsequent\n// requests exceed the maximum buffer size.\nconst POOL_SIZE_MULTIPLIER = 32\nlet pool, poolOffset\n\nlet random = bytes => {\n  if (!pool || pool.length < bytes) {\n    pool = Buffer.allocUnsafe(bytes * POOL_SIZE_MULTIPLIER)\n    crypto.randomFillSync(pool)\n    poolOffset = 0\n  } else if (poolOffset + bytes > pool.length) {\n    crypto.randomFillSync(pool)\n    poolOffset = 0\n  }\n\n  let res = pool.subarray(poolOffset, poolOffset + bytes)\n  poolOffset += bytes\n  return res\n}\n\nlet customRandom = (alphabet, size, getRandom) => {\n  // First, a bitmask is necessary to generate the ID. The bitmask makes bytes\n  // values closer to the alphabet size. The bitmask calculates the closest\n  // `2^31 - 1` number, which exceeds the alphabet size.\n  // For example, the bitmask for the alphabet size 30 is 31 (00011111).\n  let mask = (2 << (31 - Math.clz32((alphabet.length - 1) | 1))) - 1\n  // Though, the bitmask solution is not perfect since the bytes exceeding\n  // the alphabet size are refused. Therefore, to reliably generate the ID,\n  // the random bytes redundancy has to be satisfied.\n\n  // Note: every hardware random generator call is performance expensive,\n  // because the system call for entropy collection takes a lot of time.\n  // So, to avoid additional system calls, extra bytes are requested in advance.\n\n  // Next, a step determines how many random bytes to generate.\n  // The number of random bytes gets decided upon the ID size, mask,\n  // alphabet size, and magic number 1.6 (using 1.6 peaks at performance\n  // according to benchmarks).\n  let step = Math.ceil((1.6 * mask * size) / alphabet.length)\n\n  return () => {\n    let id = ''\n    while (true) {\n      let bytes = getRandom(step)\n      // A compact alternative for `for (let i = 0; i < step; i++)`.\n      let i = step\n      while (i--) {\n        // Adding `|| ''` refuses a random byte that exceeds the alphabet size.\n        id += alphabet[bytes[i] & mask] || ''\n        if (id.length === size) return id\n      }\n    }\n  }\n}\n\nlet customAlphabet = (alphabet, size) => customRandom(alphabet, size, random)\n\nlet nanoid = (size = 21) => {\n  let bytes = random(size)\n  let id = ''\n  // A compact alternative for `for (let i = 0; i < size; i++)`.\n  while (size--) {\n    // It is incorrect to use bytes exceeding the alphabet size.\n    // The following mask reduces the random byte in the 0-255 value\n    // range to the 0-63 value range. Therefore, adding hacks, such\n    // as empty string fallback or magic numbers, is unneccessary because\n    // the bitmask trims bytes down to the alphabet size.\n    id += urlAlphabet[bytes[size] & 63]\n  }\n  return id\n}\n\nmodule.exports = { nanoid, customAlphabet, customRandom, urlAlphabet, random }\n","'use strict'\n\nexports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require('randombytes')\nexports.createHash = exports.Hash = require('create-hash')\nexports.createHmac = exports.Hmac = require('create-hmac')\n\nvar algos = require('browserify-sign/algos')\nvar algoKeys = Object.keys(algos)\nvar hashes = ['sha1', 'sha224', 'sha256', 'sha384', 'sha512', 'md5', 'rmd160'].concat(algoKeys)\nexports.getHashes = function () {\n  return hashes\n}\n\nvar p = require('pbkdf2')\nexports.pbkdf2 = p.pbkdf2\nexports.pbkdf2Sync = p.pbkdf2Sync\n\nvar aes = require('browserify-cipher')\n\nexports.Cipher = aes.Cipher\nexports.createCipher = aes.createCipher\nexports.Cipheriv = aes.Cipheriv\nexports.createCipheriv = aes.createCipheriv\nexports.Decipher = aes.Decipher\nexports.createDecipher = aes.createDecipher\nexports.Decipheriv = aes.Decipheriv\nexports.createDecipheriv = aes.createDecipheriv\nexports.getCiphers = aes.getCiphers\nexports.listCiphers = aes.listCiphers\n\nvar dh = require('diffie-hellman')\n\nexports.DiffieHellmanGroup = dh.DiffieHellmanGroup\nexports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup\nexports.getDiffieHellman = dh.getDiffieHellman\nexports.createDiffieHellman = dh.createDiffieHellman\nexports.DiffieHellman = dh.DiffieHellman\n\nvar sign = require('browserify-sign')\n\nexports.createSign = sign.createSign\nexports.Sign = sign.Sign\nexports.createVerify = sign.createVerify\nexports.Verify = sign.Verify\n\nexports.createECDH = require('create-ecdh')\n\nvar publicEncrypt = require('public-encrypt')\n\nexports.publicEncrypt = publicEncrypt.publicEncrypt\nexports.privateEncrypt = publicEncrypt.privateEncrypt\nexports.publicDecrypt = publicEncrypt.publicDecrypt\nexports.privateDecrypt = publicEncrypt.privateDecrypt\n\n// the least I can do is make error messages for the rest of the node.js/crypto api.\n// ;[\n//   'createCredentials'\n// ].forEach(function (name) {\n//   exports[name] = function () {\n//     throw new Error([\n//       'sorry, ' + name + ' is not implemented yet',\n//       'we accept pull requests',\n//       'https://github.com/crypto-browserify/crypto-browserify'\n//     ].join('\\n'))\n//   }\n// })\n\nvar rf = require('randomfill')\n\nexports.randomFill = rf.randomFill\nexports.randomFillSync = rf.randomFillSync\n\nexports.createCredentials = function () {\n  throw new Error([\n    'sorry, createCredentials is not implemented yet',\n    'we accept pull requests',\n    'https://github.com/crypto-browserify/crypto-browserify'\n  ].join('\\n'))\n}\n\nexports.constants = {\n  'DH_CHECK_P_NOT_SAFE_PRIME': 2,\n  'DH_CHECK_P_NOT_PRIME': 1,\n  'DH_UNABLE_TO_CHECK_GENERATOR': 4,\n  'DH_NOT_SUITABLE_GENERATOR': 8,\n  'NPN_ENABLED': 1,\n  'ALPN_ENABLED': 1,\n  'RSA_PKCS1_PADDING': 1,\n  'RSA_SSLV23_PADDING': 2,\n  'RSA_NO_PADDING': 3,\n  'RSA_PKCS1_OAEP_PADDING': 4,\n  'RSA_X931_PADDING': 5,\n  'RSA_PKCS1_PSS_PADDING': 6,\n  'POINT_CONVERSION_COMPRESSED': 2,\n  'POINT_CONVERSION_UNCOMPRESSED': 4,\n  'POINT_CONVERSION_HYBRID': 6\n}\n","'use strict'\n\n// limit of Crypto.getRandomValues()\n// https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues\nvar MAX_BYTES = 65536\n\n// Node supports requesting up to this number of bytes\n// https://github.com/nodejs/node/blob/master/lib/internal/crypto/random.js#L48\nvar MAX_UINT32 = 4294967295\n\nfunction oldBrowser () {\n  throw new Error('Secure random number generation is not supported by this browser.\\nUse Chrome, Firefox or Internet Explorer 11')\n}\n\nvar Buffer = require('safe-buffer').Buffer\nvar crypto = global.crypto || global.msCrypto\n\nif (crypto && crypto.getRandomValues) {\n  module.exports = randomBytes\n} else {\n  module.exports = oldBrowser\n}\n\nfunction randomBytes (size, cb) {\n  // phantomjs needs to throw\n  if (size > MAX_UINT32) throw new RangeError('requested too many random bytes')\n\n  var bytes = Buffer.allocUnsafe(size)\n\n  if (size > 0) {  // getRandomValues fails on IE if size == 0\n    if (size > MAX_BYTES) { // this is the max bytes crypto.getRandomValues\n      // can do at once see https://developer.mozilla.org/en-US/docs/Web/API/window.crypto.getRandomValues\n      for (var generated = 0; generated < size; generated += MAX_BYTES) {\n        // buffer.slice automatically checks if the end is past the end of\n        // the buffer so we don't have to here\n        crypto.getRandomValues(bytes.slice(generated, generated + MAX_BYTES))\n      }\n    } else {\n      crypto.getRandomValues(bytes)\n    }\n  }\n\n  if (typeof cb === 'function') {\n    return process.nextTick(function () {\n      cb(null, bytes)\n    })\n  }\n\n  return bytes\n}\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n  for (var key in src) {\n    dst[key] = src[key]\n  }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n  module.exports = buffer\n} else {\n  // Copy properties from require('buffer')\n  copyProps(buffer, exports)\n  exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n  return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n  if (typeof arg === 'number') {\n    throw new TypeError('Argument must not be a number')\n  }\n  return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  var buf = Buffer(size)\n  if (fill !== undefined) {\n    if (typeof encoding === 'string') {\n      buf.fill(fill, encoding)\n    } else {\n      buf.fill(fill)\n    }\n  } else {\n    buf.fill(0)\n  }\n  return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('Argument must be a number')\n  }\n  return buffer.SlowBuffer(size)\n}\n","'use strict'\nvar inherits = require('inherits')\nvar MD5 = require('md5.js')\nvar RIPEMD160 = require('ripemd160')\nvar sha = require('sha.js')\nvar Base = require('cipher-base')\n\nfunction Hash (hash) {\n  Base.call(this, 'digest')\n\n  this._hash = hash\n}\n\ninherits(Hash, Base)\n\nHash.prototype._update = function (data) {\n  this._hash.update(data)\n}\n\nHash.prototype._final = function () {\n  return this._hash.digest()\n}\n\nmodule.exports = function createHash (alg) {\n  alg = alg.toLowerCase()\n  if (alg === 'md5') return new MD5()\n  if (alg === 'rmd160' || alg === 'ripemd160') return new RIPEMD160()\n\n  return new Hash(sha(alg))\n}\n","'use strict'\nvar inherits = require('inherits')\nvar HashBase = require('hash-base')\nvar Buffer = require('safe-buffer').Buffer\n\nvar ARRAY16 = new Array(16)\n\nfunction MD5 () {\n  HashBase.call(this, 64)\n\n  // state\n  this._a = 0x67452301\n  this._b = 0xefcdab89\n  this._c = 0x98badcfe\n  this._d = 0x10325476\n}\n\ninherits(MD5, HashBase)\n\nMD5.prototype._update = function () {\n  var M = ARRAY16\n  for (var i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4)\n\n  var a = this._a\n  var b = this._b\n  var c = this._c\n  var d = this._d\n\n  a = fnF(a, b, c, d, M[0], 0xd76aa478, 7)\n  d = fnF(d, a, b, c, M[1], 0xe8c7b756, 12)\n  c = fnF(c, d, a, b, M[2], 0x242070db, 17)\n  b = fnF(b, c, d, a, M[3], 0xc1bdceee, 22)\n  a = fnF(a, b, c, d, M[4], 0xf57c0faf, 7)\n  d = fnF(d, a, b, c, M[5], 0x4787c62a, 12)\n  c = fnF(c, d, a, b, M[6], 0xa8304613, 17)\n  b = fnF(b, c, d, a, M[7], 0xfd469501, 22)\n  a = fnF(a, b, c, d, M[8], 0x698098d8, 7)\n  d = fnF(d, a, b, c, M[9], 0x8b44f7af, 12)\n  c = fnF(c, d, a, b, M[10], 0xffff5bb1, 17)\n  b = fnF(b, c, d, a, M[11], 0x895cd7be, 22)\n  a = fnF(a, b, c, d, M[12], 0x6b901122, 7)\n  d = fnF(d, a, b, c, M[13], 0xfd987193, 12)\n  c = fnF(c, d, a, b, M[14], 0xa679438e, 17)\n  b = fnF(b, c, d, a, M[15], 0x49b40821, 22)\n\n  a = fnG(a, b, c, d, M[1], 0xf61e2562, 5)\n  d = fnG(d, a, b, c, M[6], 0xc040b340, 9)\n  c = fnG(c, d, a, b, M[11], 0x265e5a51, 14)\n  b = fnG(b, c, d, a, M[0], 0xe9b6c7aa, 20)\n  a = fnG(a, b, c, d, M[5], 0xd62f105d, 5)\n  d = fnG(d, a, b, c, M[10], 0x02441453, 9)\n  c = fnG(c, d, a, b, M[15], 0xd8a1e681, 14)\n  b = fnG(b, c, d, a, M[4], 0xe7d3fbc8, 20)\n  a = fnG(a, b, c, d, M[9], 0x21e1cde6, 5)\n  d = fnG(d, a, b, c, M[14], 0xc33707d6, 9)\n  c = fnG(c, d, a, b, M[3], 0xf4d50d87, 14)\n  b = fnG(b, c, d, a, M[8], 0x455a14ed, 20)\n  a = fnG(a, b, c, d, M[13], 0xa9e3e905, 5)\n  d = fnG(d, a, b, c, M[2], 0xfcefa3f8, 9)\n  c = fnG(c, d, a, b, M[7], 0x676f02d9, 14)\n  b = fnG(b, c, d, a, M[12], 0x8d2a4c8a, 20)\n\n  a = fnH(a, b, c, d, M[5], 0xfffa3942, 4)\n  d = fnH(d, a, b, c, M[8], 0x8771f681, 11)\n  c = fnH(c, d, a, b, M[11], 0x6d9d6122, 16)\n  b = fnH(b, c, d, a, M[14], 0xfde5380c, 23)\n  a = fnH(a, b, c, d, M[1], 0xa4beea44, 4)\n  d = fnH(d, a, b, c, M[4], 0x4bdecfa9, 11)\n  c = fnH(c, d, a, b, M[7], 0xf6bb4b60, 16)\n  b = fnH(b, c, d, a, M[10], 0xbebfbc70, 23)\n  a = fnH(a, b, c, d, M[13], 0x289b7ec6, 4)\n  d = fnH(d, a, b, c, M[0], 0xeaa127fa, 11)\n  c = fnH(c, d, a, b, M[3], 0xd4ef3085, 16)\n  b = fnH(b, c, d, a, M[6], 0x04881d05, 23)\n  a = fnH(a, b, c, d, M[9], 0xd9d4d039, 4)\n  d = fnH(d, a, b, c, M[12], 0xe6db99e5, 11)\n  c = fnH(c, d, a, b, M[15], 0x1fa27cf8, 16)\n  b = fnH(b, c, d, a, M[2], 0xc4ac5665, 23)\n\n  a = fnI(a, b, c, d, M[0], 0xf4292244, 6)\n  d = fnI(d, a, b, c, M[7], 0x432aff97, 10)\n  c = fnI(c, d, a, b, M[14], 0xab9423a7, 15)\n  b = fnI(b, c, d, a, M[5], 0xfc93a039, 21)\n  a = fnI(a, b, c, d, M[12], 0x655b59c3, 6)\n  d = fnI(d, a, b, c, M[3], 0x8f0ccc92, 10)\n  c = fnI(c, d, a, b, M[10], 0xffeff47d, 15)\n  b = fnI(b, c, d, a, M[1], 0x85845dd1, 21)\n  a = fnI(a, b, c, d, M[8], 0x6fa87e4f, 6)\n  d = fnI(d, a, b, c, M[15], 0xfe2ce6e0, 10)\n  c = fnI(c, d, a, b, M[6], 0xa3014314, 15)\n  b = fnI(b, c, d, a, M[13], 0x4e0811a1, 21)\n  a = fnI(a, b, c, d, M[4], 0xf7537e82, 6)\n  d = fnI(d, a, b, c, M[11], 0xbd3af235, 10)\n  c = fnI(c, d, a, b, M[2], 0x2ad7d2bb, 15)\n  b = fnI(b, c, d, a, M[9], 0xeb86d391, 21)\n\n  this._a = (this._a + a) | 0\n  this._b = (this._b + b) | 0\n  this._c = (this._c + c) | 0\n  this._d = (this._d + d) | 0\n}\n\nMD5.prototype._digest = function () {\n  // create padding and handle blocks\n  this._block[this._blockOffset++] = 0x80\n  if (this._blockOffset > 56) {\n    this._block.fill(0, this._blockOffset, 64)\n    this._update()\n    this._blockOffset = 0\n  }\n\n  this._block.fill(0, this._blockOffset, 56)\n  this._block.writeUInt32LE(this._length[0], 56)\n  this._block.writeUInt32LE(this._length[1], 60)\n  this._update()\n\n  // produce result\n  var buffer = Buffer.allocUnsafe(16)\n  buffer.writeInt32LE(this._a, 0)\n  buffer.writeInt32LE(this._b, 4)\n  buffer.writeInt32LE(this._c, 8)\n  buffer.writeInt32LE(this._d, 12)\n  return buffer\n}\n\nfunction rotl (x, n) {\n  return (x << n) | (x >>> (32 - n))\n}\n\nfunction fnF (a, b, c, d, m, k, s) {\n  return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnG (a, b, c, d, m, k, s) {\n  return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnH (a, b, c, d, m, k, s) {\n  return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnI (a, b, c, d, m, k, s) {\n  return (rotl((a + ((c ^ (b | (~d)))) + m + k) | 0, s) + b) | 0\n}\n\nmodule.exports = MD5\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('readable-stream').Transform\nvar inherits = require('inherits')\n\nfunction throwIfNotStringOrBuffer (val, prefix) {\n  if (!Buffer.isBuffer(val) && typeof val !== 'string') {\n    throw new TypeError(prefix + ' must be a string or a buffer')\n  }\n}\n\nfunction HashBase (blockSize) {\n  Transform.call(this)\n\n  this._block = Buffer.allocUnsafe(blockSize)\n  this._blockSize = blockSize\n  this._blockOffset = 0\n  this._length = [0, 0, 0, 0]\n\n  this._finalized = false\n}\n\ninherits(HashBase, Transform)\n\nHashBase.prototype._transform = function (chunk, encoding, callback) {\n  var error = null\n  try {\n    this.update(chunk, encoding)\n  } catch (err) {\n    error = err\n  }\n\n  callback(error)\n}\n\nHashBase.prototype._flush = function (callback) {\n  var error = null\n  try {\n    this.push(this.digest())\n  } catch (err) {\n    error = err\n  }\n\n  callback(error)\n}\n\nHashBase.prototype.update = function (data, encoding) {\n  throwIfNotStringOrBuffer(data, 'Data')\n  if (this._finalized) throw new Error('Digest already called')\n  if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding)\n\n  // consume data\n  var block = this._block\n  var offset = 0\n  while (this._blockOffset + data.length - offset >= this._blockSize) {\n    for (var i = this._blockOffset; i < this._blockSize;) block[i++] = data[offset++]\n    this._update()\n    this._blockOffset = 0\n  }\n  while (offset < data.length) block[this._blockOffset++] = data[offset++]\n\n  // update length\n  for (var j = 0, carry = data.length * 8; carry > 0; ++j) {\n    this._length[j] += carry\n    carry = (this._length[j] / 0x0100000000) | 0\n    if (carry > 0) this._length[j] -= 0x0100000000 * carry\n  }\n\n  return this\n}\n\nHashBase.prototype._update = function () {\n  throw new Error('_update is not implemented')\n}\n\nHashBase.prototype.digest = function (encoding) {\n  if (this._finalized) throw new Error('Digest already called')\n  this._finalized = true\n\n  var digest = this._digest()\n  if (encoding !== undefined) digest = digest.toString(encoding)\n\n  // reset state\n  this._block.fill(0)\n  this._blockOffset = 0\n  for (var i = 0; i < 4; ++i) this._length[i] = 0\n\n  return digest\n}\n\nHashBase.prototype._digest = function () {\n  throw new Error('_digest is not implemented')\n}\n\nmodule.exports = HashBase\n","exports = module.exports = require('./lib/_stream_readable.js');\nexports.Stream = exports;\nexports.Readable = exports;\nexports.Writable = require('./lib/_stream_writable.js');\nexports.Duplex = require('./lib/_stream_duplex.js');\nexports.Transform = require('./lib/_stream_transform.js');\nexports.PassThrough = require('./lib/_stream_passthrough.js');\nexports.finished = require('./lib/internal/streams/end-of-stream.js');\nexports.pipeline = require('./lib/internal/streams/pipeline.js');\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n'use strict';\n\nmodule.exports = Readable;\n/*<replacement>*/\n\nvar Duplex;\n/*</replacement>*/\n\nReadable.ReadableState = ReadableState;\n/*<replacement>*/\n\nvar EE = require('events').EventEmitter;\n\nvar EElistenerCount = function EElistenerCount(emitter, type) {\n  return emitter.listeners(type).length;\n};\n/*</replacement>*/\n\n/*<replacement>*/\n\n\nvar Stream = require('./internal/streams/stream');\n/*</replacement>*/\n\n\nvar Buffer = require('buffer').Buffer;\n\nvar OurUint8Array = global.Uint8Array || function () {};\n\nfunction _uint8ArrayToBuffer(chunk) {\n  return Buffer.from(chunk);\n}\n\nfunction _isUint8Array(obj) {\n  return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n/*<replacement>*/\n\n\nvar debugUtil = require('util');\n\nvar debug;\n\nif (debugUtil && debugUtil.debuglog) {\n  debug = debugUtil.debuglog('stream');\n} else {\n  debug = function debug() {};\n}\n/*</replacement>*/\n\n\nvar BufferList = require('./internal/streams/buffer_list');\n\nvar destroyImpl = require('./internal/streams/destroy');\n\nvar _require = require('./internal/streams/state'),\n    getHighWaterMark = _require.getHighWaterMark;\n\nvar _require$codes = require('../errors').codes,\n    ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n    ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n    ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n    ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT; // Lazy loaded to improve the startup performance.\n\n\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\n\nrequire('inherits')(Readable, Stream);\n\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\nvar kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume'];\n\nfunction prependListener(emitter, event, fn) {\n  // Sadly this is not cacheable as some libraries bundle their own\n  // event emitter implementation with them.\n  if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn); // This is a hack to make sure that our error handler is attached before any\n  // userland ones.  NEVER DO THIS. This is here only because this code needs\n  // to continue to work with older versions of Node.js that do not include\n  // the prependListener() method. The goal is to eventually remove this hack.\n\n  if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\n\nfunction ReadableState(options, stream, isDuplex) {\n  Duplex = Duplex || require('./_stream_duplex');\n  options = options || {}; // Duplex streams are both readable and writable, but share\n  // the same options object.\n  // However, some cases require setting options to different\n  // values for the readable and the writable sides of the duplex stream.\n  // These options can be provided separately as readableXXX and writableXXX.\n\n  if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex; // object stream flag. Used to make read(n) ignore n and to\n  // make all the buffer merging and length checks go away\n\n  this.objectMode = !!options.objectMode;\n  if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode; // the point at which it stops calling _read() to fill the buffer\n  // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n\n  this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex); // A linked list is used to store data chunks instead of an array because the\n  // linked list can remove elements from the beginning faster than\n  // array.shift()\n\n  this.buffer = new BufferList();\n  this.length = 0;\n  this.pipes = null;\n  this.pipesCount = 0;\n  this.flowing = null;\n  this.ended = false;\n  this.endEmitted = false;\n  this.reading = false; // a flag to be able to tell if the event 'readable'/'data' is emitted\n  // immediately, or on a later tick.  We set this to true at first, because\n  // any actions that shouldn't happen until \"later\" should generally also\n  // not happen before the first read call.\n\n  this.sync = true; // whenever we return null, then we set a flag to say\n  // that we're awaiting a 'readable' event emission.\n\n  this.needReadable = false;\n  this.emittedReadable = false;\n  this.readableListening = false;\n  this.resumeScheduled = false;\n  this.paused = true; // Should close be emitted on destroy. Defaults to true.\n\n  this.emitClose = options.emitClose !== false; // Should .destroy() be called after 'end' (and potentially 'finish')\n\n  this.autoDestroy = !!options.autoDestroy; // has it been destroyed\n\n  this.destroyed = false; // Crypto is kind of old and crusty.  Historically, its default string\n  // encoding is 'binary' so we have to make this configurable.\n  // Everything else in the universe uses 'utf8', though.\n\n  this.defaultEncoding = options.defaultEncoding || 'utf8'; // the number of writers that are awaiting a drain event in .pipe()s\n\n  this.awaitDrain = 0; // if true, a maybeReadMore has been scheduled\n\n  this.readingMore = false;\n  this.decoder = null;\n  this.encoding = null;\n\n  if (options.encoding) {\n    if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n    this.decoder = new StringDecoder(options.encoding);\n    this.encoding = options.encoding;\n  }\n}\n\nfunction Readable(options) {\n  Duplex = Duplex || require('./_stream_duplex');\n  if (!(this instanceof Readable)) return new Readable(options); // Checking for a Stream.Duplex instance is faster here instead of inside\n  // the ReadableState constructor, at least with V8 6.5\n\n  var isDuplex = this instanceof Duplex;\n  this._readableState = new ReadableState(options, this, isDuplex); // legacy\n\n  this.readable = true;\n\n  if (options) {\n    if (typeof options.read === 'function') this._read = options.read;\n    if (typeof options.destroy === 'function') this._destroy = options.destroy;\n  }\n\n  Stream.call(this);\n}\n\nObject.defineProperty(Readable.prototype, 'destroyed', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    if (this._readableState === undefined) {\n      return false;\n    }\n\n    return this._readableState.destroyed;\n  },\n  set: function set(value) {\n    // we ignore the value if the stream\n    // has not been initialized yet\n    if (!this._readableState) {\n      return;\n    } // backward compatibility, the user is explicitly\n    // managing destroyed\n\n\n    this._readableState.destroyed = value;\n  }\n});\nReadable.prototype.destroy = destroyImpl.destroy;\nReadable.prototype._undestroy = destroyImpl.undestroy;\n\nReadable.prototype._destroy = function (err, cb) {\n  cb(err);\n}; // Manually shove something into the read() buffer.\n// This returns true if the highWaterMark has not been hit yet,\n// similar to how Writable.write() returns true if you should\n// write() some more.\n\n\nReadable.prototype.push = function (chunk, encoding) {\n  var state = this._readableState;\n  var skipChunkCheck;\n\n  if (!state.objectMode) {\n    if (typeof chunk === 'string') {\n      encoding = encoding || state.defaultEncoding;\n\n      if (encoding !== state.encoding) {\n        chunk = Buffer.from(chunk, encoding);\n        encoding = '';\n      }\n\n      skipChunkCheck = true;\n    }\n  } else {\n    skipChunkCheck = true;\n  }\n\n  return readableAddChunk(this, chunk, encoding, false, skipChunkCheck);\n}; // Unshift should *always* be something directly out of read()\n\n\nReadable.prototype.unshift = function (chunk) {\n  return readableAddChunk(this, chunk, null, true, false);\n};\n\nfunction readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) {\n  debug('readableAddChunk', chunk);\n  var state = stream._readableState;\n\n  if (chunk === null) {\n    state.reading = false;\n    onEofChunk(stream, state);\n  } else {\n    var er;\n    if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n\n    if (er) {\n      errorOrDestroy(stream, er);\n    } else if (state.objectMode || chunk && chunk.length > 0) {\n      if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) {\n        chunk = _uint8ArrayToBuffer(chunk);\n      }\n\n      if (addToFront) {\n        if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n      } else if (state.ended) {\n        errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n      } else if (state.destroyed) {\n        return false;\n      } else {\n        state.reading = false;\n\n        if (state.decoder && !encoding) {\n          chunk = state.decoder.write(chunk);\n          if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state);\n        } else {\n          addChunk(stream, state, chunk, false);\n        }\n      }\n    } else if (!addToFront) {\n      state.reading = false;\n      maybeReadMore(stream, state);\n    }\n  } // We can push more data if we are below the highWaterMark.\n  // Also, if we have no data yet, we can stand some more bytes.\n  // This is to work around cases where hwm=0, such as the repl.\n\n\n  return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\n\nfunction addChunk(stream, state, chunk, addToFront) {\n  if (state.flowing && state.length === 0 && !state.sync) {\n    state.awaitDrain = 0;\n    stream.emit('data', chunk);\n  } else {\n    // update the buffer info.\n    state.length += state.objectMode ? 1 : chunk.length;\n    if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk);\n    if (state.needReadable) emitReadable(stream);\n  }\n\n  maybeReadMore(stream, state);\n}\n\nfunction chunkInvalid(state, chunk) {\n  var er;\n\n  if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) {\n    er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n  }\n\n  return er;\n}\n\nReadable.prototype.isPaused = function () {\n  return this._readableState.flowing === false;\n}; // backwards compatibility.\n\n\nReadable.prototype.setEncoding = function (enc) {\n  if (!StringDecoder) StringDecoder = require('string_decoder/').StringDecoder;\n  var decoder = new StringDecoder(enc);\n  this._readableState.decoder = decoder; // If setEncoding(null), decoder.encoding equals utf8\n\n  this._readableState.encoding = this._readableState.decoder.encoding; // Iterate over current buffer to convert already stored Buffers:\n\n  var p = this._readableState.buffer.head;\n  var content = '';\n\n  while (p !== null) {\n    content += decoder.write(p.data);\n    p = p.next;\n  }\n\n  this._readableState.buffer.clear();\n\n  if (content !== '') this._readableState.buffer.push(content);\n  this._readableState.length = content.length;\n  return this;\n}; // Don't raise the hwm > 1GB\n\n\nvar MAX_HWM = 0x40000000;\n\nfunction computeNewHighWaterMark(n) {\n  if (n >= MAX_HWM) {\n    // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\n    n = MAX_HWM;\n  } else {\n    // Get the next highest power of 2 to prevent increasing hwm excessively in\n    // tiny amounts\n    n--;\n    n |= n >>> 1;\n    n |= n >>> 2;\n    n |= n >>> 4;\n    n |= n >>> 8;\n    n |= n >>> 16;\n    n++;\n  }\n\n  return n;\n} // This function is designed to be inlinable, so please take care when making\n// changes to the function body.\n\n\nfunction howMuchToRead(n, state) {\n  if (n <= 0 || state.length === 0 && state.ended) return 0;\n  if (state.objectMode) return 1;\n\n  if (n !== n) {\n    // Only flow one buffer at a time\n    if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length;\n  } // If we're asking for more than the current hwm, then raise the hwm.\n\n\n  if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n);\n  if (n <= state.length) return n; // Don't have enough\n\n  if (!state.ended) {\n    state.needReadable = true;\n    return 0;\n  }\n\n  return state.length;\n} // you can override either this method, or the async _read(n) below.\n\n\nReadable.prototype.read = function (n) {\n  debug('read', n);\n  n = parseInt(n, 10);\n  var state = this._readableState;\n  var nOrig = n;\n  if (n !== 0) state.emittedReadable = false; // if we're doing read(0) to trigger a readable event, but we\n  // already have a bunch of data in the buffer, then just trigger\n  // the 'readable' event and move on.\n\n  if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) {\n    debug('read: emitReadable', state.length, state.ended);\n    if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this);\n    return null;\n  }\n\n  n = howMuchToRead(n, state); // if we've ended, and we're now clear, then finish it up.\n\n  if (n === 0 && state.ended) {\n    if (state.length === 0) endReadable(this);\n    return null;\n  } // All the actual chunk generation logic needs to be\n  // *below* the call to _read.  The reason is that in certain\n  // synthetic stream cases, such as passthrough streams, _read\n  // may be a completely synchronous operation which may change\n  // the state of the read buffer, providing enough data when\n  // before there was *not* enough.\n  //\n  // So, the steps are:\n  // 1. Figure out what the state of things will be after we do\n  // a read from the buffer.\n  //\n  // 2. If that resulting state will trigger a _read, then call _read.\n  // Note that this may be asynchronous, or synchronous.  Yes, it is\n  // deeply ugly to write APIs this way, but that still doesn't mean\n  // that the Readable class should behave improperly, as streams are\n  // designed to be sync/async agnostic.\n  // Take note if the _read call is sync or async (ie, if the read call\n  // has returned yet), so that we know whether or not it's safe to emit\n  // 'readable' etc.\n  //\n  // 3. Actually pull the requested chunks out of the buffer and return.\n  // if we need a readable event, then we need to do some reading.\n\n\n  var doRead = state.needReadable;\n  debug('need readable', doRead); // if we currently have less than the highWaterMark, then also read some\n\n  if (state.length === 0 || state.length - n < state.highWaterMark) {\n    doRead = true;\n    debug('length less than watermark', doRead);\n  } // however, if we've ended, then there's no point, and if we're already\n  // reading, then it's unnecessary.\n\n\n  if (state.ended || state.reading) {\n    doRead = false;\n    debug('reading or ended', doRead);\n  } else if (doRead) {\n    debug('do read');\n    state.reading = true;\n    state.sync = true; // if the length is currently zero, then we *need* a readable event.\n\n    if (state.length === 0) state.needReadable = true; // call internal read method\n\n    this._read(state.highWaterMark);\n\n    state.sync = false; // If _read pushed data synchronously, then `reading` will be false,\n    // and we need to re-evaluate how much data we can return to the user.\n\n    if (!state.reading) n = howMuchToRead(nOrig, state);\n  }\n\n  var ret;\n  if (n > 0) ret = fromList(n, state);else ret = null;\n\n  if (ret === null) {\n    state.needReadable = state.length <= state.highWaterMark;\n    n = 0;\n  } else {\n    state.length -= n;\n    state.awaitDrain = 0;\n  }\n\n  if (state.length === 0) {\n    // If we have nothing in the buffer, then we want to know\n    // as soon as we *do* get something into the buffer.\n    if (!state.ended) state.needReadable = true; // If we tried to read() past the EOF, then emit end on the next tick.\n\n    if (nOrig !== n && state.ended) endReadable(this);\n  }\n\n  if (ret !== null) this.emit('data', ret);\n  return ret;\n};\n\nfunction onEofChunk(stream, state) {\n  debug('onEofChunk');\n  if (state.ended) return;\n\n  if (state.decoder) {\n    var chunk = state.decoder.end();\n\n    if (chunk && chunk.length) {\n      state.buffer.push(chunk);\n      state.length += state.objectMode ? 1 : chunk.length;\n    }\n  }\n\n  state.ended = true;\n\n  if (state.sync) {\n    // if we are sync, wait until next tick to emit the data.\n    // Otherwise we risk emitting data in the flow()\n    // the readable code triggers during a read() call\n    emitReadable(stream);\n  } else {\n    // emit 'readable' now to make sure it gets picked up.\n    state.needReadable = false;\n\n    if (!state.emittedReadable) {\n      state.emittedReadable = true;\n      emitReadable_(stream);\n    }\n  }\n} // Don't emit readable right away in sync mode, because this can trigger\n// another read() call => stack overflow.  This way, it might trigger\n// a nextTick recursion warning, but that's not so bad.\n\n\nfunction emitReadable(stream) {\n  var state = stream._readableState;\n  debug('emitReadable', state.needReadable, state.emittedReadable);\n  state.needReadable = false;\n\n  if (!state.emittedReadable) {\n    debug('emitReadable', state.flowing);\n    state.emittedReadable = true;\n    process.nextTick(emitReadable_, stream);\n  }\n}\n\nfunction emitReadable_(stream) {\n  var state = stream._readableState;\n  debug('emitReadable_', state.destroyed, state.length, state.ended);\n\n  if (!state.destroyed && (state.length || state.ended)) {\n    stream.emit('readable');\n    state.emittedReadable = false;\n  } // The stream needs another readable event if\n  // 1. It is not flowing, as the flow mechanism will take\n  //    care of it.\n  // 2. It is not ended.\n  // 3. It is below the highWaterMark, so we can schedule\n  //    another readable later.\n\n\n  state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\n  flow(stream);\n} // at this point, the user has presumably seen the 'readable' event,\n// and called read() to consume some data.  that may have triggered\n// in turn another _read(n) call, in which case reading = true if\n// it's in progress.\n// However, if we're not ended, or reading, and the length < hwm,\n// then go ahead and try to read some more preemptively.\n\n\nfunction maybeReadMore(stream, state) {\n  if (!state.readingMore) {\n    state.readingMore = true;\n    process.nextTick(maybeReadMore_, stream, state);\n  }\n}\n\nfunction maybeReadMore_(stream, state) {\n  // Attempt to read more data if we should.\n  //\n  // The conditions for reading more data are (one of):\n  // - Not enough data buffered (state.length < state.highWaterMark). The loop\n  //   is responsible for filling the buffer with enough data if such data\n  //   is available. If highWaterMark is 0 and we are not in the flowing mode\n  //   we should _not_ attempt to buffer any extra data. We'll get more data\n  //   when the stream consumer calls read() instead.\n  // - No data in the buffer, and the stream is in flowing mode. In this mode\n  //   the loop below is responsible for ensuring read() is called. Failing to\n  //   call read here would abort the flow and there's no other mechanism for\n  //   continuing the flow if the stream consumer has just subscribed to the\n  //   'data' event.\n  //\n  // In addition to the above conditions to keep reading data, the following\n  // conditions prevent the data from being read:\n  // - The stream has ended (state.ended).\n  // - There is already a pending 'read' operation (state.reading). This is a\n  //   case where the the stream has called the implementation defined _read()\n  //   method, but they are processing the call asynchronously and have _not_\n  //   called push() with new data. In this case we skip performing more\n  //   read()s. The execution ends in this method again after the _read() ends\n  //   up calling push() with more data.\n  while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n    var len = state.length;\n    debug('maybeReadMore read 0');\n    stream.read(0);\n    if (len === state.length) // didn't get any data, stop spinning.\n      break;\n  }\n\n  state.readingMore = false;\n} // abstract method.  to be overridden in specific implementation classes.\n// call cb(er, data) where data is <= n in length.\n// for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n// arbitrary, and perhaps not very meaningful.\n\n\nReadable.prototype._read = function (n) {\n  errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\n};\n\nReadable.prototype.pipe = function (dest, pipeOpts) {\n  var src = this;\n  var state = this._readableState;\n\n  switch (state.pipesCount) {\n    case 0:\n      state.pipes = dest;\n      break;\n\n    case 1:\n      state.pipes = [state.pipes, dest];\n      break;\n\n    default:\n      state.pipes.push(dest);\n      break;\n  }\n\n  state.pipesCount += 1;\n  debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);\n  var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr;\n  var endFn = doEnd ? onend : unpipe;\n  if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn);\n  dest.on('unpipe', onunpipe);\n\n  function onunpipe(readable, unpipeInfo) {\n    debug('onunpipe');\n\n    if (readable === src) {\n      if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n        unpipeInfo.hasUnpiped = true;\n        cleanup();\n      }\n    }\n  }\n\n  function onend() {\n    debug('onend');\n    dest.end();\n  } // when the dest drains, it reduces the awaitDrain counter\n  // on the source.  This would be more elegant with a .once()\n  // handler in flow(), but adding and removing repeatedly is\n  // too slow.\n\n\n  var ondrain = pipeOnDrain(src);\n  dest.on('drain', ondrain);\n  var cleanedUp = false;\n\n  function cleanup() {\n    debug('cleanup'); // cleanup event handlers once the pipe is broken\n\n    dest.removeListener('close', onclose);\n    dest.removeListener('finish', onfinish);\n    dest.removeListener('drain', ondrain);\n    dest.removeListener('error', onerror);\n    dest.removeListener('unpipe', onunpipe);\n    src.removeListener('end', onend);\n    src.removeListener('end', unpipe);\n    src.removeListener('data', ondata);\n    cleanedUp = true; // if the reader is waiting for a drain event from this\n    // specific writer, then it would cause it to never start\n    // flowing again.\n    // So, if this is awaiting a drain, then we just call it now.\n    // If we don't know, then assume that we are waiting for one.\n\n    if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain();\n  }\n\n  src.on('data', ondata);\n\n  function ondata(chunk) {\n    debug('ondata');\n    var ret = dest.write(chunk);\n    debug('dest.write', ret);\n\n    if (ret === false) {\n      // If the user unpiped during `dest.write()`, it is possible\n      // to get stuck in a permanently paused state if that write\n      // also returned false.\n      // => Check whether `dest` is still a piping destination.\n      if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) {\n        debug('false write response, pause', state.awaitDrain);\n        state.awaitDrain++;\n      }\n\n      src.pause();\n    }\n  } // if the dest has an error, then stop piping into it.\n  // however, don't suppress the throwing behavior for this.\n\n\n  function onerror(er) {\n    debug('onerror', er);\n    unpipe();\n    dest.removeListener('error', onerror);\n    if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n  } // Make sure our error handler is attached before userland ones.\n\n\n  prependListener(dest, 'error', onerror); // Both close and finish should trigger unpipe, but only once.\n\n  function onclose() {\n    dest.removeListener('finish', onfinish);\n    unpipe();\n  }\n\n  dest.once('close', onclose);\n\n  function onfinish() {\n    debug('onfinish');\n    dest.removeListener('close', onclose);\n    unpipe();\n  }\n\n  dest.once('finish', onfinish);\n\n  function unpipe() {\n    debug('unpipe');\n    src.unpipe(dest);\n  } // tell the dest that it's being piped to\n\n\n  dest.emit('pipe', src); // start the flow if it hasn't been started already.\n\n  if (!state.flowing) {\n    debug('pipe resume');\n    src.resume();\n  }\n\n  return dest;\n};\n\nfunction pipeOnDrain(src) {\n  return function pipeOnDrainFunctionResult() {\n    var state = src._readableState;\n    debug('pipeOnDrain', state.awaitDrain);\n    if (state.awaitDrain) state.awaitDrain--;\n\n    if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) {\n      state.flowing = true;\n      flow(src);\n    }\n  };\n}\n\nReadable.prototype.unpipe = function (dest) {\n  var state = this._readableState;\n  var unpipeInfo = {\n    hasUnpiped: false\n  }; // if we're not piping anywhere, then do nothing.\n\n  if (state.pipesCount === 0) return this; // just one destination.  most common case.\n\n  if (state.pipesCount === 1) {\n    // passed in one, but it's not the right one.\n    if (dest && dest !== state.pipes) return this;\n    if (!dest) dest = state.pipes; // got a match.\n\n    state.pipes = null;\n    state.pipesCount = 0;\n    state.flowing = false;\n    if (dest) dest.emit('unpipe', this, unpipeInfo);\n    return this;\n  } // slow case. multiple pipe destinations.\n\n\n  if (!dest) {\n    // remove all.\n    var dests = state.pipes;\n    var len = state.pipesCount;\n    state.pipes = null;\n    state.pipesCount = 0;\n    state.flowing = false;\n\n    for (var i = 0; i < len; i++) {\n      dests[i].emit('unpipe', this, {\n        hasUnpiped: false\n      });\n    }\n\n    return this;\n  } // try to find the right one.\n\n\n  var index = indexOf(state.pipes, dest);\n  if (index === -1) return this;\n  state.pipes.splice(index, 1);\n  state.pipesCount -= 1;\n  if (state.pipesCount === 1) state.pipes = state.pipes[0];\n  dest.emit('unpipe', this, unpipeInfo);\n  return this;\n}; // set up data events if they are asked for\n// Ensure readable listeners eventually get something\n\n\nReadable.prototype.on = function (ev, fn) {\n  var res = Stream.prototype.on.call(this, ev, fn);\n  var state = this._readableState;\n\n  if (ev === 'data') {\n    // update readableListening so that resume() may be a no-op\n    // a few lines down. This is needed to support once('readable').\n    state.readableListening = this.listenerCount('readable') > 0; // Try start flowing on next tick if stream isn't explicitly paused\n\n    if (state.flowing !== false) this.resume();\n  } else if (ev === 'readable') {\n    if (!state.endEmitted && !state.readableListening) {\n      state.readableListening = state.needReadable = true;\n      state.flowing = false;\n      state.emittedReadable = false;\n      debug('on readable', state.length, state.reading);\n\n      if (state.length) {\n        emitReadable(this);\n      } else if (!state.reading) {\n        process.nextTick(nReadingNextTick, this);\n      }\n    }\n  }\n\n  return res;\n};\n\nReadable.prototype.addListener = Readable.prototype.on;\n\nReadable.prototype.removeListener = function (ev, fn) {\n  var res = Stream.prototype.removeListener.call(this, ev, fn);\n\n  if (ev === 'readable') {\n    // We need to check if there is someone still listening to\n    // readable and reset the state. However this needs to happen\n    // after readable has been emitted but before I/O (nextTick) to\n    // support once('readable', fn) cycles. This means that calling\n    // resume within the same tick will have no\n    // effect.\n    process.nextTick(updateReadableListening, this);\n  }\n\n  return res;\n};\n\nReadable.prototype.removeAllListeners = function (ev) {\n  var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n\n  if (ev === 'readable' || ev === undefined) {\n    // We need to check if there is someone still listening to\n    // readable and reset the state. However this needs to happen\n    // after readable has been emitted but before I/O (nextTick) to\n    // support once('readable', fn) cycles. This means that calling\n    // resume within the same tick will have no\n    // effect.\n    process.nextTick(updateReadableListening, this);\n  }\n\n  return res;\n};\n\nfunction updateReadableListening(self) {\n  var state = self._readableState;\n  state.readableListening = self.listenerCount('readable') > 0;\n\n  if (state.resumeScheduled && !state.paused) {\n    // flowing needs to be set to true now, otherwise\n    // the upcoming resume will not flow.\n    state.flowing = true; // crude way to check if we should resume\n  } else if (self.listenerCount('data') > 0) {\n    self.resume();\n  }\n}\n\nfunction nReadingNextTick(self) {\n  debug('readable nexttick read 0');\n  self.read(0);\n} // pause() and resume() are remnants of the legacy readable stream API\n// If the user uses them, then switch into old mode.\n\n\nReadable.prototype.resume = function () {\n  var state = this._readableState;\n\n  if (!state.flowing) {\n    debug('resume'); // we flow only if there is no one listening\n    // for readable, but we still have to call\n    // resume()\n\n    state.flowing = !state.readableListening;\n    resume(this, state);\n  }\n\n  state.paused = false;\n  return this;\n};\n\nfunction resume(stream, state) {\n  if (!state.resumeScheduled) {\n    state.resumeScheduled = true;\n    process.nextTick(resume_, stream, state);\n  }\n}\n\nfunction resume_(stream, state) {\n  debug('resume', state.reading);\n\n  if (!state.reading) {\n    stream.read(0);\n  }\n\n  state.resumeScheduled = false;\n  stream.emit('resume');\n  flow(stream);\n  if (state.flowing && !state.reading) stream.read(0);\n}\n\nReadable.prototype.pause = function () {\n  debug('call pause flowing=%j', this._readableState.flowing);\n\n  if (this._readableState.flowing !== false) {\n    debug('pause');\n    this._readableState.flowing = false;\n    this.emit('pause');\n  }\n\n  this._readableState.paused = true;\n  return this;\n};\n\nfunction flow(stream) {\n  var state = stream._readableState;\n  debug('flow', state.flowing);\n\n  while (state.flowing && stream.read() !== null) {\n    ;\n  }\n} // wrap an old-style stream as the async data source.\n// This is *not* part of the readable stream interface.\n// It is an ugly unfortunate mess of history.\n\n\nReadable.prototype.wrap = function (stream) {\n  var _this = this;\n\n  var state = this._readableState;\n  var paused = false;\n  stream.on('end', function () {\n    debug('wrapped end');\n\n    if (state.decoder && !state.ended) {\n      var chunk = state.decoder.end();\n      if (chunk && chunk.length) _this.push(chunk);\n    }\n\n    _this.push(null);\n  });\n  stream.on('data', function (chunk) {\n    debug('wrapped data');\n    if (state.decoder) chunk = state.decoder.write(chunk); // don't skip over falsy values in objectMode\n\n    if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return;\n\n    var ret = _this.push(chunk);\n\n    if (!ret) {\n      paused = true;\n      stream.pause();\n    }\n  }); // proxy all the other methods.\n  // important when wrapping filters and duplexes.\n\n  for (var i in stream) {\n    if (this[i] === undefined && typeof stream[i] === 'function') {\n      this[i] = function methodWrap(method) {\n        return function methodWrapReturnFunction() {\n          return stream[method].apply(stream, arguments);\n        };\n      }(i);\n    }\n  } // proxy certain important events.\n\n\n  for (var n = 0; n < kProxyEvents.length; n++) {\n    stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n  } // when we try to consume some more bytes, simply unpause the\n  // underlying stream.\n\n\n  this._read = function (n) {\n    debug('wrapped _read', n);\n\n    if (paused) {\n      paused = false;\n      stream.resume();\n    }\n  };\n\n  return this;\n};\n\nif (typeof Symbol === 'function') {\n  Readable.prototype[Symbol.asyncIterator] = function () {\n    if (createReadableStreamAsyncIterator === undefined) {\n      createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n    }\n\n    return createReadableStreamAsyncIterator(this);\n  };\n}\n\nObject.defineProperty(Readable.prototype, 'readableHighWaterMark', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._readableState.highWaterMark;\n  }\n});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._readableState && this._readableState.buffer;\n  }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._readableState.flowing;\n  },\n  set: function set(state) {\n    if (this._readableState) {\n      this._readableState.flowing = state;\n    }\n  }\n}); // exposed for testing purposes only.\n\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._readableState.length;\n  }\n}); // Pluck off n bytes from an array of buffers.\n// Length is the combined lengths of all the buffers in the list.\n// This function is designed to be inlinable, so please take care when making\n// changes to the function body.\n\nfunction fromList(n, state) {\n  // nothing buffered\n  if (state.length === 0) return null;\n  var ret;\n  if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) {\n    // read it all, truncate the list\n    if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length);\n    state.buffer.clear();\n  } else {\n    // read part of list\n    ret = state.buffer.consume(n, state.decoder);\n  }\n  return ret;\n}\n\nfunction endReadable(stream) {\n  var state = stream._readableState;\n  debug('endReadable', state.endEmitted);\n\n  if (!state.endEmitted) {\n    state.ended = true;\n    process.nextTick(endReadableNT, state, stream);\n  }\n}\n\nfunction endReadableNT(state, stream) {\n  debug('endReadableNT', state.endEmitted, state.length); // Check that we didn't get one last unshift.\n\n  if (!state.endEmitted && state.length === 0) {\n    state.endEmitted = true;\n    stream.readable = false;\n    stream.emit('end');\n\n    if (state.autoDestroy) {\n      // In case of duplex streams we need a way to detect\n      // if the writable side is ready for autoDestroy as well\n      var wState = stream._writableState;\n\n      if (!wState || wState.autoDestroy && wState.finished) {\n        stream.destroy();\n      }\n    }\n  }\n}\n\nif (typeof Symbol === 'function') {\n  Readable.from = function (iterable, opts) {\n    if (from === undefined) {\n      from = require('./internal/streams/from');\n    }\n\n    return from(Readable, iterable, opts);\n  };\n}\n\nfunction indexOf(xs, x) {\n  for (var i = 0, l = xs.length; i < l; i++) {\n    if (xs[i] === x) return i;\n  }\n\n  return -1;\n}","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n  ? R.apply\n  : function ReflectApply(target, receiver, args) {\n    return Function.prototype.apply.call(target, receiver, args);\n  }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n  ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target)\n      .concat(Object.getOwnPropertySymbols(target));\n  };\n} else {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target);\n  };\n}\n\nfunction ProcessEmitWarning(warning) {\n  if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n  return value !== value;\n}\n\nfunction EventEmitter() {\n  EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n  if (typeof listener !== 'function') {\n    throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n  }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n  enumerable: true,\n  get: function() {\n    return defaultMaxListeners;\n  },\n  set: function(arg) {\n    if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n      throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n    }\n    defaultMaxListeners = arg;\n  }\n});\n\nEventEmitter.init = function() {\n\n  if (this._events === undefined ||\n      this._events === Object.getPrototypeOf(this)._events) {\n    this._events = Object.create(null);\n    this._eventsCount = 0;\n  }\n\n  this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n  if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n    throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n  }\n  this._maxListeners = n;\n  return this;\n};\n\nfunction _getMaxListeners(that) {\n  if (that._maxListeners === undefined)\n    return EventEmitter.defaultMaxListeners;\n  return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n  return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n  var args = [];\n  for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n  var doError = (type === 'error');\n\n  var events = this._events;\n  if (events !== undefined)\n    doError = (doError && events.error === undefined);\n  else if (!doError)\n    return false;\n\n  // If there is no 'error' event listener then throw.\n  if (doError) {\n    var er;\n    if (args.length > 0)\n      er = args[0];\n    if (er instanceof Error) {\n      // Note: The comments on the `throw` lines are intentional, they show\n      // up in Node's output if this results in an unhandled exception.\n      throw er; // Unhandled 'error' event\n    }\n    // At least give some kind of context to the user\n    var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n    err.context = er;\n    throw err; // Unhandled 'error' event\n  }\n\n  var handler = events[type];\n\n  if (handler === undefined)\n    return false;\n\n  if (typeof handler === 'function') {\n    ReflectApply(handler, this, args);\n  } else {\n    var len = handler.length;\n    var listeners = arrayClone(handler, len);\n    for (var i = 0; i < len; ++i)\n      ReflectApply(listeners[i], this, args);\n  }\n\n  return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n  var m;\n  var events;\n  var existing;\n\n  checkListener(listener);\n\n  events = target._events;\n  if (events === undefined) {\n    events = target._events = Object.create(null);\n    target._eventsCount = 0;\n  } else {\n    // To avoid recursion in the case that type === \"newListener\"! Before\n    // adding it to the listeners, first emit \"newListener\".\n    if (events.newListener !== undefined) {\n      target.emit('newListener', type,\n                  listener.listener ? listener.listener : listener);\n\n      // Re-assign `events` because a newListener handler could have caused the\n      // this._events to be assigned to a new object\n      events = target._events;\n    }\n    existing = events[type];\n  }\n\n  if (existing === undefined) {\n    // Optimize the case of one listener. Don't need the extra array object.\n    existing = events[type] = listener;\n    ++target._eventsCount;\n  } else {\n    if (typeof existing === 'function') {\n      // Adding the second element, need to change to array.\n      existing = events[type] =\n        prepend ? [listener, existing] : [existing, listener];\n      // If we've already got an array, just append.\n    } else if (prepend) {\n      existing.unshift(listener);\n    } else {\n      existing.push(listener);\n    }\n\n    // Check for listener leak\n    m = _getMaxListeners(target);\n    if (m > 0 && existing.length > m && !existing.warned) {\n      existing.warned = true;\n      // No error code for this since it is a Warning\n      // eslint-disable-next-line no-restricted-syntax\n      var w = new Error('Possible EventEmitter memory leak detected. ' +\n                          existing.length + ' ' + String(type) + ' listeners ' +\n                          'added. Use emitter.setMaxListeners() to ' +\n                          'increase limit');\n      w.name = 'MaxListenersExceededWarning';\n      w.emitter = target;\n      w.type = type;\n      w.count = existing.length;\n      ProcessEmitWarning(w);\n    }\n  }\n\n  return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n  return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n    function prependListener(type, listener) {\n      return _addListener(this, type, listener, true);\n    };\n\nfunction onceWrapper() {\n  if (!this.fired) {\n    this.target.removeListener(this.type, this.wrapFn);\n    this.fired = true;\n    if (arguments.length === 0)\n      return this.listener.call(this.target);\n    return this.listener.apply(this.target, arguments);\n  }\n}\n\nfunction _onceWrap(target, type, listener) {\n  var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n  var wrapped = onceWrapper.bind(state);\n  wrapped.listener = listener;\n  state.wrapFn = wrapped;\n  return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n  checkListener(listener);\n  this.on(type, _onceWrap(this, type, listener));\n  return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n    function prependOnceListener(type, listener) {\n      checkListener(listener);\n      this.prependListener(type, _onceWrap(this, type, listener));\n      return this;\n    };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n    function removeListener(type, listener) {\n      var list, events, position, i, originalListener;\n\n      checkListener(listener);\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      list = events[type];\n      if (list === undefined)\n        return this;\n\n      if (list === listener || list.listener === listener) {\n        if (--this._eventsCount === 0)\n          this._events = Object.create(null);\n        else {\n          delete events[type];\n          if (events.removeListener)\n            this.emit('removeListener', type, list.listener || listener);\n        }\n      } else if (typeof list !== 'function') {\n        position = -1;\n\n        for (i = list.length - 1; i >= 0; i--) {\n          if (list[i] === listener || list[i].listener === listener) {\n            originalListener = list[i].listener;\n            position = i;\n            break;\n          }\n        }\n\n        if (position < 0)\n          return this;\n\n        if (position === 0)\n          list.shift();\n        else {\n          spliceOne(list, position);\n        }\n\n        if (list.length === 1)\n          events[type] = list[0];\n\n        if (events.removeListener !== undefined)\n          this.emit('removeListener', type, originalListener || listener);\n      }\n\n      return this;\n    };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n    function removeAllListeners(type) {\n      var listeners, events, i;\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      // not listening for removeListener, no need to emit\n      if (events.removeListener === undefined) {\n        if (arguments.length === 0) {\n          this._events = Object.create(null);\n          this._eventsCount = 0;\n        } else if (events[type] !== undefined) {\n          if (--this._eventsCount === 0)\n            this._events = Object.create(null);\n          else\n            delete events[type];\n        }\n        return this;\n      }\n\n      // emit removeListener for all listeners on all events\n      if (arguments.length === 0) {\n        var keys = Object.keys(events);\n        var key;\n        for (i = 0; i < keys.length; ++i) {\n          key = keys[i];\n          if (key === 'removeListener') continue;\n          this.removeAllListeners(key);\n        }\n        this.removeAllListeners('removeListener');\n        this._events = Object.create(null);\n        this._eventsCount = 0;\n        return this;\n      }\n\n      listeners = events[type];\n\n      if (typeof listeners === 'function') {\n        this.removeListener(type, listeners);\n      } else if (listeners !== undefined) {\n        // LIFO order\n        for (i = listeners.length - 1; i >= 0; i--) {\n          this.removeListener(type, listeners[i]);\n        }\n      }\n\n      return this;\n    };\n\nfunction _listeners(target, type, unwrap) {\n  var events = target._events;\n\n  if (events === undefined)\n    return [];\n\n  var evlistener = events[type];\n  if (evlistener === undefined)\n    return [];\n\n  if (typeof evlistener === 'function')\n    return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n  return unwrap ?\n    unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n  return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n  return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n  if (typeof emitter.listenerCount === 'function') {\n    return emitter.listenerCount(type);\n  } else {\n    return listenerCount.call(emitter, type);\n  }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n  var events = this._events;\n\n  if (events !== undefined) {\n    var evlistener = events[type];\n\n    if (typeof evlistener === 'function') {\n      return 1;\n    } else if (evlistener !== undefined) {\n      return evlistener.length;\n    }\n  }\n\n  return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n  return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n  var copy = new Array(n);\n  for (var i = 0; i < n; ++i)\n    copy[i] = arr[i];\n  return copy;\n}\n\nfunction spliceOne(list, index) {\n  for (; index + 1 < list.length; index++)\n    list[index] = list[index + 1];\n  list.pop();\n}\n\nfunction unwrapListeners(arr) {\n  var ret = new Array(arr.length);\n  for (var i = 0; i < ret.length; ++i) {\n    ret[i] = arr[i].listener || arr[i];\n  }\n  return ret;\n}\n\nfunction once(emitter, name) {\n  return new Promise(function (resolve, reject) {\n    function errorListener(err) {\n      emitter.removeListener(name, resolver);\n      reject(err);\n    }\n\n    function resolver() {\n      if (typeof emitter.removeListener === 'function') {\n        emitter.removeListener('error', errorListener);\n      }\n      resolve([].slice.call(arguments));\n    };\n\n    eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n    if (name !== 'error') {\n      addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n    }\n  });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n  if (typeof emitter.on === 'function') {\n    eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n  }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n  if (typeof emitter.on === 'function') {\n    if (flags.once) {\n      emitter.once(name, listener);\n    } else {\n      emitter.on(name, listener);\n    }\n  } else if (typeof emitter.addEventListener === 'function') {\n    // EventTarget does not have `error` event semantics like Node\n    // EventEmitters, we do not listen for `error` events here.\n    emitter.addEventListener(name, function wrapListener(arg) {\n      // IE does not have builtin `{ once: true }` support so we\n      // have to do it manually.\n      if (flags.once) {\n        emitter.removeEventListener(name, wrapListener);\n      }\n      listener(arg);\n    });\n  } else {\n    throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n  }\n}\n","module.exports = require('events').EventEmitter;\n","'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nvar _require = require('buffer'),\n    Buffer = _require.Buffer;\n\nvar _require2 = require('util'),\n    inspect = _require2.inspect;\n\nvar custom = inspect && inspect.custom || 'inspect';\n\nfunction copyBuffer(src, target, offset) {\n  Buffer.prototype.copy.call(src, target, offset);\n}\n\nmodule.exports =\n/*#__PURE__*/\nfunction () {\n  function BufferList() {\n    _classCallCheck(this, BufferList);\n\n    this.head = null;\n    this.tail = null;\n    this.length = 0;\n  }\n\n  _createClass(BufferList, [{\n    key: \"push\",\n    value: function push(v) {\n      var entry = {\n        data: v,\n        next: null\n      };\n      if (this.length > 0) this.tail.next = entry;else this.head = entry;\n      this.tail = entry;\n      ++this.length;\n    }\n  }, {\n    key: \"unshift\",\n    value: function unshift(v) {\n      var entry = {\n        data: v,\n        next: this.head\n      };\n      if (this.length === 0) this.tail = entry;\n      this.head = entry;\n      ++this.length;\n    }\n  }, {\n    key: \"shift\",\n    value: function shift() {\n      if (this.length === 0) return;\n      var ret = this.head.data;\n      if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n      --this.length;\n      return ret;\n    }\n  }, {\n    key: \"clear\",\n    value: function clear() {\n      this.head = this.tail = null;\n      this.length = 0;\n    }\n  }, {\n    key: \"join\",\n    value: function join(s) {\n      if (this.length === 0) return '';\n      var p = this.head;\n      var ret = '' + p.data;\n\n      while (p = p.next) {\n        ret += s + p.data;\n      }\n\n      return ret;\n    }\n  }, {\n    key: \"concat\",\n    value: function concat(n) {\n      if (this.length === 0) return Buffer.alloc(0);\n      var ret = Buffer.allocUnsafe(n >>> 0);\n      var p = this.head;\n      var i = 0;\n\n      while (p) {\n        copyBuffer(p.data, ret, i);\n        i += p.data.length;\n        p = p.next;\n      }\n\n      return ret;\n    } // Consumes a specified amount of bytes or characters from the buffered data.\n\n  }, {\n    key: \"consume\",\n    value: function consume(n, hasStrings) {\n      var ret;\n\n      if (n < this.head.data.length) {\n        // `slice` is the same for buffers and strings.\n        ret = this.head.data.slice(0, n);\n        this.head.data = this.head.data.slice(n);\n      } else if (n === this.head.data.length) {\n        // First chunk is a perfect match.\n        ret = this.shift();\n      } else {\n        // Result spans more than one buffer.\n        ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n      }\n\n      return ret;\n    }\n  }, {\n    key: \"first\",\n    value: function first() {\n      return this.head.data;\n    } // Consumes a specified amount of characters from the buffered data.\n\n  }, {\n    key: \"_getString\",\n    value: function _getString(n) {\n      var p = this.head;\n      var c = 1;\n      var ret = p.data;\n      n -= ret.length;\n\n      while (p = p.next) {\n        var str = p.data;\n        var nb = n > str.length ? str.length : n;\n        if (nb === str.length) ret += str;else ret += str.slice(0, n);\n        n -= nb;\n\n        if (n === 0) {\n          if (nb === str.length) {\n            ++c;\n            if (p.next) this.head = p.next;else this.head = this.tail = null;\n          } else {\n            this.head = p;\n            p.data = str.slice(nb);\n          }\n\n          break;\n        }\n\n        ++c;\n      }\n\n      this.length -= c;\n      return ret;\n    } // Consumes a specified amount of bytes from the buffered data.\n\n  }, {\n    key: \"_getBuffer\",\n    value: function _getBuffer(n) {\n      var ret = Buffer.allocUnsafe(n);\n      var p = this.head;\n      var c = 1;\n      p.data.copy(ret);\n      n -= p.data.length;\n\n      while (p = p.next) {\n        var buf = p.data;\n        var nb = n > buf.length ? buf.length : n;\n        buf.copy(ret, ret.length - n, 0, nb);\n        n -= nb;\n\n        if (n === 0) {\n          if (nb === buf.length) {\n            ++c;\n            if (p.next) this.head = p.next;else this.head = this.tail = null;\n          } else {\n            this.head = p;\n            p.data = buf.slice(nb);\n          }\n\n          break;\n        }\n\n        ++c;\n      }\n\n      this.length -= c;\n      return ret;\n    } // Make sure the linked list only shows the minimal necessary information.\n\n  }, {\n    key: custom,\n    value: function value(_, options) {\n      return inspect(this, _objectSpread({}, options, {\n        // Only inspect one level.\n        depth: 0,\n        // It should not recurse.\n        customInspect: false\n      }));\n    }\n  }]);\n\n  return BufferList;\n}();","'use strict'; // undocumented cb() API, needed for core, not for public API\n\nfunction destroy(err, cb) {\n  var _this = this;\n\n  var readableDestroyed = this._readableState && this._readableState.destroyed;\n  var writableDestroyed = this._writableState && this._writableState.destroyed;\n\n  if (readableDestroyed || writableDestroyed) {\n    if (cb) {\n      cb(err);\n    } else if (err) {\n      if (!this._writableState) {\n        process.nextTick(emitErrorNT, this, err);\n      } else if (!this._writableState.errorEmitted) {\n        this._writableState.errorEmitted = true;\n        process.nextTick(emitErrorNT, this, err);\n      }\n    }\n\n    return this;\n  } // we set destroyed to true before firing error callbacks in order\n  // to make it re-entrance safe in case destroy() is called within callbacks\n\n\n  if (this._readableState) {\n    this._readableState.destroyed = true;\n  } // if this is a duplex stream mark the writable part as destroyed as well\n\n\n  if (this._writableState) {\n    this._writableState.destroyed = true;\n  }\n\n  this._destroy(err || null, function (err) {\n    if (!cb && err) {\n      if (!_this._writableState) {\n        process.nextTick(emitErrorAndCloseNT, _this, err);\n      } else if (!_this._writableState.errorEmitted) {\n        _this._writableState.errorEmitted = true;\n        process.nextTick(emitErrorAndCloseNT, _this, err);\n      } else {\n        process.nextTick(emitCloseNT, _this);\n      }\n    } else if (cb) {\n      process.nextTick(emitCloseNT, _this);\n      cb(err);\n    } else {\n      process.nextTick(emitCloseNT, _this);\n    }\n  });\n\n  return this;\n}\n\nfunction emitErrorAndCloseNT(self, err) {\n  emitErrorNT(self, err);\n  emitCloseNT(self);\n}\n\nfunction emitCloseNT(self) {\n  if (self._writableState && !self._writableState.emitClose) return;\n  if (self._readableState && !self._readableState.emitClose) return;\n  self.emit('close');\n}\n\nfunction undestroy() {\n  if (this._readableState) {\n    this._readableState.destroyed = false;\n    this._readableState.reading = false;\n    this._readableState.ended = false;\n    this._readableState.endEmitted = false;\n  }\n\n  if (this._writableState) {\n    this._writableState.destroyed = false;\n    this._writableState.ended = false;\n    this._writableState.ending = false;\n    this._writableState.finalCalled = false;\n    this._writableState.prefinished = false;\n    this._writableState.finished = false;\n    this._writableState.errorEmitted = false;\n  }\n}\n\nfunction emitErrorNT(self, err) {\n  self.emit('error', err);\n}\n\nfunction errorOrDestroy(stream, err) {\n  // We have tests that rely on errors being emitted\n  // in the same tick, so changing this is semver major.\n  // For now when you opt-in to autoDestroy we allow\n  // the error to be emitted nextTick. In a future\n  // semver major update we should change the default to this.\n  var rState = stream._readableState;\n  var wState = stream._writableState;\n  if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\n\nmodule.exports = {\n  destroy: destroy,\n  undestroy: undestroy,\n  errorOrDestroy: errorOrDestroy\n};","'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\n\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n  return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\n\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n  var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n\n  if (hwm != null) {\n    if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n      var name = isDuplex ? duplexKey : 'highWaterMark';\n      throw new ERR_INVALID_OPT_VALUE(name, hwm);\n    }\n\n    return Math.floor(hwm);\n  } // Default value\n\n\n  return state.objectMode ? 16 : 16 * 1024;\n}\n\nmodule.exports = {\n  getHighWaterMark: getHighWaterMark\n};","'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar codes = {};\n\nfunction createErrorType(code, message, Base) {\n  if (!Base) {\n    Base = Error;\n  }\n\n  function getMessage(arg1, arg2, arg3) {\n    if (typeof message === 'string') {\n      return message;\n    } else {\n      return message(arg1, arg2, arg3);\n    }\n  }\n\n  var NodeError =\n  /*#__PURE__*/\n  function (_Base) {\n    _inheritsLoose(NodeError, _Base);\n\n    function NodeError(arg1, arg2, arg3) {\n      return _Base.call(this, getMessage(arg1, arg2, arg3)) || this;\n    }\n\n    return NodeError;\n  }(Base);\n\n  NodeError.prototype.name = Base.name;\n  NodeError.prototype.code = code;\n  codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n  if (Array.isArray(expected)) {\n    var len = expected.length;\n    expected = expected.map(function (i) {\n      return String(i);\n    });\n\n    if (len > 2) {\n      return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n    } else if (len === 2) {\n      return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n    } else {\n      return \"of \".concat(thing, \" \").concat(expected[0]);\n    }\n  } else {\n    return \"of \".concat(thing, \" \").concat(String(expected));\n  }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n  return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n  if (this_len === undefined || this_len > str.length) {\n    this_len = str.length;\n  }\n\n  return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n  if (typeof start !== 'number') {\n    start = 0;\n  }\n\n  if (start + search.length > str.length) {\n    return false;\n  } else {\n    return str.indexOf(search, start) !== -1;\n  }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n  return 'The value \"' + value + '\" is invalid for option \"' + name + '\"';\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n  // determiner: 'must be' or 'must not be'\n  var determiner;\n\n  if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n    determiner = 'must not be';\n    expected = expected.replace(/^not /, '');\n  } else {\n    determiner = 'must be';\n  }\n\n  var msg;\n\n  if (endsWith(name, ' argument')) {\n    // For cases like 'first argument'\n    msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n  } else {\n    var type = includes(name, '.') ? 'property' : 'argument';\n    msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n  }\n\n  msg += \". Received type \".concat(typeof actual);\n  return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n  return 'The ' + name + ' method is not implemented';\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n  return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n  return 'Unknown encoding: ' + arg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\nmodule.exports.codes = codes;\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n// a duplex stream is just a stream that is both readable and writable.\n// Since JS doesn't have multiple prototypal inheritance, this class\n// prototypally inherits from Readable, and then parasitically from\n// Writable.\n'use strict';\n/*<replacement>*/\n\nvar objectKeys = Object.keys || function (obj) {\n  var keys = [];\n\n  for (var key in obj) {\n    keys.push(key);\n  }\n\n  return keys;\n};\n/*</replacement>*/\n\n\nmodule.exports = Duplex;\n\nvar Readable = require('./_stream_readable');\n\nvar Writable = require('./_stream_writable');\n\nrequire('inherits')(Duplex, Readable);\n\n{\n  // Allow the keys array to be GC'ed.\n  var keys = objectKeys(Writable.prototype);\n\n  for (var v = 0; v < keys.length; v++) {\n    var method = keys[v];\n    if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method];\n  }\n}\n\nfunction Duplex(options) {\n  if (!(this instanceof Duplex)) return new Duplex(options);\n  Readable.call(this, options);\n  Writable.call(this, options);\n  this.allowHalfOpen = true;\n\n  if (options) {\n    if (options.readable === false) this.readable = false;\n    if (options.writable === false) this.writable = false;\n\n    if (options.allowHalfOpen === false) {\n      this.allowHalfOpen = false;\n      this.once('end', onend);\n    }\n  }\n}\n\nObject.defineProperty(Duplex.prototype, 'writableHighWaterMark', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.highWaterMark;\n  }\n});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState && this._writableState.getBuffer();\n  }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.length;\n  }\n}); // the no-half-open enforcer\n\nfunction onend() {\n  // If the writable side ended, then we're ok.\n  if (this._writableState.ended) return; // no more data can be written.\n  // But allow more writes to happen in this tick.\n\n  process.nextTick(onEndNT, this);\n}\n\nfunction onEndNT(self) {\n  self.end();\n}\n\nObject.defineProperty(Duplex.prototype, 'destroyed', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    if (this._readableState === undefined || this._writableState === undefined) {\n      return false;\n    }\n\n    return this._readableState.destroyed && this._writableState.destroyed;\n  },\n  set: function set(value) {\n    // we ignore the value if the stream\n    // has not been initialized yet\n    if (this._readableState === undefined || this._writableState === undefined) {\n      return;\n    } // backward compatibility, the user is explicitly\n    // managing destroyed\n\n\n    this._readableState.destroyed = value;\n    this._writableState.destroyed = value;\n  }\n});","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n// A bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n'use strict';\n\nmodule.exports = Writable;\n/* <replacement> */\n\nfunction WriteReq(chunk, encoding, cb) {\n  this.chunk = chunk;\n  this.encoding = encoding;\n  this.callback = cb;\n  this.next = null;\n} // It seems a linked list but it is not\n// there will be only 2 of these for each stream\n\n\nfunction CorkedRequest(state) {\n  var _this = this;\n\n  this.next = null;\n  this.entry = null;\n\n  this.finish = function () {\n    onCorkedFinish(_this, state);\n  };\n}\n/* </replacement> */\n\n/*<replacement>*/\n\n\nvar Duplex;\n/*</replacement>*/\n\nWritable.WritableState = WritableState;\n/*<replacement>*/\n\nvar internalUtil = {\n  deprecate: require('util-deprecate')\n};\n/*</replacement>*/\n\n/*<replacement>*/\n\nvar Stream = require('./internal/streams/stream');\n/*</replacement>*/\n\n\nvar Buffer = require('buffer').Buffer;\n\nvar OurUint8Array = global.Uint8Array || function () {};\n\nfunction _uint8ArrayToBuffer(chunk) {\n  return Buffer.from(chunk);\n}\n\nfunction _isUint8Array(obj) {\n  return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n}\n\nvar destroyImpl = require('./internal/streams/destroy');\n\nvar _require = require('./internal/streams/state'),\n    getHighWaterMark = _require.getHighWaterMark;\n\nvar _require$codes = require('../errors').codes,\n    ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n    ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n    ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n    ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n    ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n    ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n    ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n    ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\n\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\n\nrequire('inherits')(Writable, Stream);\n\nfunction nop() {}\n\nfunction WritableState(options, stream, isDuplex) {\n  Duplex = Duplex || require('./_stream_duplex');\n  options = options || {}; // Duplex streams are both readable and writable, but share\n  // the same options object.\n  // However, some cases require setting options to different\n  // values for the readable and the writable sides of the duplex stream,\n  // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n\n  if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex; // object stream flag to indicate whether or not this stream\n  // contains buffers or objects.\n\n  this.objectMode = !!options.objectMode;\n  if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode; // the point at which write() starts returning false\n  // Note: 0 is a valid value, means that we always return false if\n  // the entire buffer is not flushed immediately on write()\n\n  this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex); // if _final has been called\n\n  this.finalCalled = false; // drain event flag.\n\n  this.needDrain = false; // at the start of calling end()\n\n  this.ending = false; // when end() has been called, and returned\n\n  this.ended = false; // when 'finish' is emitted\n\n  this.finished = false; // has it been destroyed\n\n  this.destroyed = false; // should we decode strings into buffers before passing to _write?\n  // this is here so that some node-core streams can optimize string\n  // handling at a lower level.\n\n  var noDecode = options.decodeStrings === false;\n  this.decodeStrings = !noDecode; // Crypto is kind of old and crusty.  Historically, its default string\n  // encoding is 'binary' so we have to make this configurable.\n  // Everything else in the universe uses 'utf8', though.\n\n  this.defaultEncoding = options.defaultEncoding || 'utf8'; // not an actual buffer we keep track of, but a measurement\n  // of how much we're waiting to get pushed to some underlying\n  // socket or file.\n\n  this.length = 0; // a flag to see when we're in the middle of a write.\n\n  this.writing = false; // when true all writes will be buffered until .uncork() call\n\n  this.corked = 0; // a flag to be able to tell if the onwrite cb is called immediately,\n  // or on a later tick.  We set this to true at first, because any\n  // actions that shouldn't happen until \"later\" should generally also\n  // not happen before the first write call.\n\n  this.sync = true; // a flag to know if we're processing previously buffered items, which\n  // may call the _write() callback in the same tick, so that we don't\n  // end up in an overlapped onwrite situation.\n\n  this.bufferProcessing = false; // the callback that's passed to _write(chunk,cb)\n\n  this.onwrite = function (er) {\n    onwrite(stream, er);\n  }; // the callback that the user supplies to write(chunk,encoding,cb)\n\n\n  this.writecb = null; // the amount that is being written when _write is called.\n\n  this.writelen = 0;\n  this.bufferedRequest = null;\n  this.lastBufferedRequest = null; // number of pending user-supplied write callbacks\n  // this must be 0 before 'finish' can be emitted\n\n  this.pendingcb = 0; // emit prefinish if the only thing we're waiting for is _write cbs\n  // This is relevant for synchronous Transform streams\n\n  this.prefinished = false; // True if the error was already emitted and should not be thrown again\n\n  this.errorEmitted = false; // Should close be emitted on destroy. Defaults to true.\n\n  this.emitClose = options.emitClose !== false; // Should .destroy() be called after 'finish' (and potentially 'end')\n\n  this.autoDestroy = !!options.autoDestroy; // count buffered requests\n\n  this.bufferedRequestCount = 0; // allocate the first CorkedRequest, there is always\n  // one allocated and free to use, and we maintain at most two\n\n  this.corkedRequestsFree = new CorkedRequest(this);\n}\n\nWritableState.prototype.getBuffer = function getBuffer() {\n  var current = this.bufferedRequest;\n  var out = [];\n\n  while (current) {\n    out.push(current);\n    current = current.next;\n  }\n\n  return out;\n};\n\n(function () {\n  try {\n    Object.defineProperty(WritableState.prototype, 'buffer', {\n      get: internalUtil.deprecate(function writableStateBufferGetter() {\n        return this.getBuffer();\n      }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003')\n    });\n  } catch (_) {}\n})(); // Test _writableState for inheritance to account for Duplex streams,\n// whose prototype chain only points to Readable.\n\n\nvar realHasInstance;\n\nif (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') {\n  realHasInstance = Function.prototype[Symbol.hasInstance];\n  Object.defineProperty(Writable, Symbol.hasInstance, {\n    value: function value(object) {\n      if (realHasInstance.call(this, object)) return true;\n      if (this !== Writable) return false;\n      return object && object._writableState instanceof WritableState;\n    }\n  });\n} else {\n  realHasInstance = function realHasInstance(object) {\n    return object instanceof this;\n  };\n}\n\nfunction Writable(options) {\n  Duplex = Duplex || require('./_stream_duplex'); // Writable ctor is applied to Duplexes, too.\n  // `realHasInstance` is necessary because using plain `instanceof`\n  // would return false, as no `_writableState` property is attached.\n  // Trying to use the custom `instanceof` for Writable here will also break the\n  // Node.js LazyTransform implementation, which has a non-trivial getter for\n  // `_writableState` that would lead to infinite recursion.\n  // Checking for a Stream.Duplex instance is faster here instead of inside\n  // the WritableState constructor, at least with V8 6.5\n\n  var isDuplex = this instanceof Duplex;\n  if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n  this._writableState = new WritableState(options, this, isDuplex); // legacy.\n\n  this.writable = true;\n\n  if (options) {\n    if (typeof options.write === 'function') this._write = options.write;\n    if (typeof options.writev === 'function') this._writev = options.writev;\n    if (typeof options.destroy === 'function') this._destroy = options.destroy;\n    if (typeof options.final === 'function') this._final = options.final;\n  }\n\n  Stream.call(this);\n} // Otherwise people can pipe Writable streams, which is just wrong.\n\n\nWritable.prototype.pipe = function () {\n  errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\n\nfunction writeAfterEnd(stream, cb) {\n  var er = new ERR_STREAM_WRITE_AFTER_END(); // TODO: defer error events consistently everywhere, not just the cb\n\n  errorOrDestroy(stream, er);\n  process.nextTick(cb, er);\n} // Checks that a user-supplied chunk is valid, especially for the particular\n// mode the stream is in. Currently this means that `null` is never accepted\n// and undefined/non-string values are only allowed in object mode.\n\n\nfunction validChunk(stream, state, chunk, cb) {\n  var er;\n\n  if (chunk === null) {\n    er = new ERR_STREAM_NULL_VALUES();\n  } else if (typeof chunk !== 'string' && !state.objectMode) {\n    er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n  }\n\n  if (er) {\n    errorOrDestroy(stream, er);\n    process.nextTick(cb, er);\n    return false;\n  }\n\n  return true;\n}\n\nWritable.prototype.write = function (chunk, encoding, cb) {\n  var state = this._writableState;\n  var ret = false;\n\n  var isBuf = !state.objectMode && _isUint8Array(chunk);\n\n  if (isBuf && !Buffer.isBuffer(chunk)) {\n    chunk = _uint8ArrayToBuffer(chunk);\n  }\n\n  if (typeof encoding === 'function') {\n    cb = encoding;\n    encoding = null;\n  }\n\n  if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding;\n  if (typeof cb !== 'function') cb = nop;\n  if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) {\n    state.pendingcb++;\n    ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n  }\n  return ret;\n};\n\nWritable.prototype.cork = function () {\n  this._writableState.corked++;\n};\n\nWritable.prototype.uncork = function () {\n  var state = this._writableState;\n\n  if (state.corked) {\n    state.corked--;\n    if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state);\n  }\n};\n\nWritable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {\n  // node::ParseEncoding() requires lower case.\n  if (typeof encoding === 'string') encoding = encoding.toLowerCase();\n  if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding);\n  this._writableState.defaultEncoding = encoding;\n  return this;\n};\n\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState && this._writableState.getBuffer();\n  }\n});\n\nfunction decodeChunk(state, chunk, encoding) {\n  if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') {\n    chunk = Buffer.from(chunk, encoding);\n  }\n\n  return chunk;\n}\n\nObject.defineProperty(Writable.prototype, 'writableHighWaterMark', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.highWaterMark;\n  }\n}); // if we're already writing something, then just put this\n// in the queue, and wait our turn.  Otherwise, call _write\n// If we return false, then we need a drain event, so set that flag.\n\nfunction writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n  if (!isBuf) {\n    var newChunk = decodeChunk(state, chunk, encoding);\n\n    if (chunk !== newChunk) {\n      isBuf = true;\n      encoding = 'buffer';\n      chunk = newChunk;\n    }\n  }\n\n  var len = state.objectMode ? 1 : chunk.length;\n  state.length += len;\n  var ret = state.length < state.highWaterMark; // we must ensure that previous needDrain will not be reset to false.\n\n  if (!ret) state.needDrain = true;\n\n  if (state.writing || state.corked) {\n    var last = state.lastBufferedRequest;\n    state.lastBufferedRequest = {\n      chunk: chunk,\n      encoding: encoding,\n      isBuf: isBuf,\n      callback: cb,\n      next: null\n    };\n\n    if (last) {\n      last.next = state.lastBufferedRequest;\n    } else {\n      state.bufferedRequest = state.lastBufferedRequest;\n    }\n\n    state.bufferedRequestCount += 1;\n  } else {\n    doWrite(stream, state, false, len, chunk, encoding, cb);\n  }\n\n  return ret;\n}\n\nfunction doWrite(stream, state, writev, len, chunk, encoding, cb) {\n  state.writelen = len;\n  state.writecb = cb;\n  state.writing = true;\n  state.sync = true;\n  if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite);\n  state.sync = false;\n}\n\nfunction onwriteError(stream, state, sync, er, cb) {\n  --state.pendingcb;\n\n  if (sync) {\n    // defer the callback if we are being called synchronously\n    // to avoid piling up things on the stack\n    process.nextTick(cb, er); // this can emit finish, and it will always happen\n    // after error\n\n    process.nextTick(finishMaybe, stream, state);\n    stream._writableState.errorEmitted = true;\n    errorOrDestroy(stream, er);\n  } else {\n    // the caller expect this to happen before if\n    // it is async\n    cb(er);\n    stream._writableState.errorEmitted = true;\n    errorOrDestroy(stream, er); // this can emit finish, but finish must\n    // always follow error\n\n    finishMaybe(stream, state);\n  }\n}\n\nfunction onwriteStateUpdate(state) {\n  state.writing = false;\n  state.writecb = null;\n  state.length -= state.writelen;\n  state.writelen = 0;\n}\n\nfunction onwrite(stream, er) {\n  var state = stream._writableState;\n  var sync = state.sync;\n  var cb = state.writecb;\n  if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\n  onwriteStateUpdate(state);\n  if (er) onwriteError(stream, state, sync, er, cb);else {\n    // Check if we're actually ready to finish, but don't emit yet\n    var finished = needFinish(state) || stream.destroyed;\n\n    if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n      clearBuffer(stream, state);\n    }\n\n    if (sync) {\n      process.nextTick(afterWrite, stream, state, finished, cb);\n    } else {\n      afterWrite(stream, state, finished, cb);\n    }\n  }\n}\n\nfunction afterWrite(stream, state, finished, cb) {\n  if (!finished) onwriteDrain(stream, state);\n  state.pendingcb--;\n  cb();\n  finishMaybe(stream, state);\n} // Must force callback to be called on nextTick, so that we don't\n// emit 'drain' before the write() consumer gets the 'false' return\n// value, and has a chance to attach a 'drain' listener.\n\n\nfunction onwriteDrain(stream, state) {\n  if (state.length === 0 && state.needDrain) {\n    state.needDrain = false;\n    stream.emit('drain');\n  }\n} // if there's something in the buffer waiting, then process it\n\n\nfunction clearBuffer(stream, state) {\n  state.bufferProcessing = true;\n  var entry = state.bufferedRequest;\n\n  if (stream._writev && entry && entry.next) {\n    // Fast case, write everything using _writev()\n    var l = state.bufferedRequestCount;\n    var buffer = new Array(l);\n    var holder = state.corkedRequestsFree;\n    holder.entry = entry;\n    var count = 0;\n    var allBuffers = true;\n\n    while (entry) {\n      buffer[count] = entry;\n      if (!entry.isBuf) allBuffers = false;\n      entry = entry.next;\n      count += 1;\n    }\n\n    buffer.allBuffers = allBuffers;\n    doWrite(stream, state, true, state.length, buffer, '', holder.finish); // doWrite is almost always async, defer these to save a bit of time\n    // as the hot path ends with doWrite\n\n    state.pendingcb++;\n    state.lastBufferedRequest = null;\n\n    if (holder.next) {\n      state.corkedRequestsFree = holder.next;\n      holder.next = null;\n    } else {\n      state.corkedRequestsFree = new CorkedRequest(state);\n    }\n\n    state.bufferedRequestCount = 0;\n  } else {\n    // Slow case, write chunks one-by-one\n    while (entry) {\n      var chunk = entry.chunk;\n      var encoding = entry.encoding;\n      var cb = entry.callback;\n      var len = state.objectMode ? 1 : chunk.length;\n      doWrite(stream, state, false, len, chunk, encoding, cb);\n      entry = entry.next;\n      state.bufferedRequestCount--; // if we didn't call the onwrite immediately, then\n      // it means that we need to wait until it does.\n      // also, that means that the chunk and cb are currently\n      // being processed, so move the buffer counter past them.\n\n      if (state.writing) {\n        break;\n      }\n    }\n\n    if (entry === null) state.lastBufferedRequest = null;\n  }\n\n  state.bufferedRequest = entry;\n  state.bufferProcessing = false;\n}\n\nWritable.prototype._write = function (chunk, encoding, cb) {\n  cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()'));\n};\n\nWritable.prototype._writev = null;\n\nWritable.prototype.end = function (chunk, encoding, cb) {\n  var state = this._writableState;\n\n  if (typeof chunk === 'function') {\n    cb = chunk;\n    chunk = null;\n    encoding = null;\n  } else if (typeof encoding === 'function') {\n    cb = encoding;\n    encoding = null;\n  }\n\n  if (chunk !== null && chunk !== undefined) this.write(chunk, encoding); // .end() fully uncorks\n\n  if (state.corked) {\n    state.corked = 1;\n    this.uncork();\n  } // ignore unnecessary end() calls.\n\n\n  if (!state.ending) endWritable(this, state, cb);\n  return this;\n};\n\nObject.defineProperty(Writable.prototype, 'writableLength', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    return this._writableState.length;\n  }\n});\n\nfunction needFinish(state) {\n  return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing;\n}\n\nfunction callFinal(stream, state) {\n  stream._final(function (err) {\n    state.pendingcb--;\n\n    if (err) {\n      errorOrDestroy(stream, err);\n    }\n\n    state.prefinished = true;\n    stream.emit('prefinish');\n    finishMaybe(stream, state);\n  });\n}\n\nfunction prefinish(stream, state) {\n  if (!state.prefinished && !state.finalCalled) {\n    if (typeof stream._final === 'function' && !state.destroyed) {\n      state.pendingcb++;\n      state.finalCalled = true;\n      process.nextTick(callFinal, stream, state);\n    } else {\n      state.prefinished = true;\n      stream.emit('prefinish');\n    }\n  }\n}\n\nfunction finishMaybe(stream, state) {\n  var need = needFinish(state);\n\n  if (need) {\n    prefinish(stream, state);\n\n    if (state.pendingcb === 0) {\n      state.finished = true;\n      stream.emit('finish');\n\n      if (state.autoDestroy) {\n        // In case of duplex streams we need a way to detect\n        // if the readable side is ready for autoDestroy as well\n        var rState = stream._readableState;\n\n        if (!rState || rState.autoDestroy && rState.endEmitted) {\n          stream.destroy();\n        }\n      }\n    }\n  }\n\n  return need;\n}\n\nfunction endWritable(stream, state, cb) {\n  state.ending = true;\n  finishMaybe(stream, state);\n\n  if (cb) {\n    if (state.finished) process.nextTick(cb);else stream.once('finish', cb);\n  }\n\n  state.ended = true;\n  stream.writable = false;\n}\n\nfunction onCorkedFinish(corkReq, state, err) {\n  var entry = corkReq.entry;\n  corkReq.entry = null;\n\n  while (entry) {\n    var cb = entry.callback;\n    state.pendingcb--;\n    cb(err);\n    entry = entry.next;\n  } // reuse the free corkReq.\n\n\n  state.corkedRequestsFree.next = corkReq;\n}\n\nObject.defineProperty(Writable.prototype, 'destroyed', {\n  // making it explicit this property is not enumerable\n  // because otherwise some prototype manipulation in\n  // userland will fail\n  enumerable: false,\n  get: function get() {\n    if (this._writableState === undefined) {\n      return false;\n    }\n\n    return this._writableState.destroyed;\n  },\n  set: function set(value) {\n    // we ignore the value if the stream\n    // has not been initialized yet\n    if (!this._writableState) {\n      return;\n    } // backward compatibility, the user is explicitly\n    // managing destroyed\n\n\n    this._writableState.destroyed = value;\n  }\n});\nWritable.prototype.destroy = destroyImpl.destroy;\nWritable.prototype._undestroy = destroyImpl.undestroy;\n\nWritable.prototype._destroy = function (err, cb) {\n  cb(err);\n};","\n/**\n * Module exports.\n */\n\nmodule.exports = deprecate;\n\n/**\n * Mark that a method should not be used.\n * Returns a modified function which warns once by default.\n *\n * If `localStorage.noDeprecation = true` is set, then it is a no-op.\n *\n * If `localStorage.throwDeprecation = true` is set, then deprecated functions\n * will throw an Error when invoked.\n *\n * If `localStorage.traceDeprecation = true` is set, then deprecated functions\n * will invoke `console.trace()` instead of `console.error()`.\n *\n * @param {Function} fn - the function to deprecate\n * @param {String} msg - the string to print to the console when `fn` is invoked\n * @returns {Function} a new \"deprecated\" version of `fn`\n * @api public\n */\n\nfunction deprecate (fn, msg) {\n  if (config('noDeprecation')) {\n    return fn;\n  }\n\n  var warned = false;\n  function deprecated() {\n    if (!warned) {\n      if (config('throwDeprecation')) {\n        throw new Error(msg);\n      } else if (config('traceDeprecation')) {\n        console.trace(msg);\n      } else {\n        console.warn(msg);\n      }\n      warned = true;\n    }\n    return fn.apply(this, arguments);\n  }\n\n  return deprecated;\n}\n\n/**\n * Checks `localStorage` for boolean values for the given `name`.\n *\n * @param {String} name\n * @returns {Boolean}\n * @api private\n */\n\nfunction config (name) {\n  // accessing global.localStorage can trigger a DOMException in sandboxed iframes\n  try {\n    if (!global.localStorage) return false;\n  } catch (_) {\n    return false;\n  }\n  var val = global.localStorage[name];\n  if (null == val) return false;\n  return String(val).toLowerCase() === 'true';\n}\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\n/*<replacement>*/\n\nvar Buffer = require('safe-buffer').Buffer;\n/*</replacement>*/\n\nvar isEncoding = Buffer.isEncoding || function (encoding) {\n  encoding = '' + encoding;\n  switch (encoding && encoding.toLowerCase()) {\n    case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw':\n      return true;\n    default:\n      return false;\n  }\n};\n\nfunction _normalizeEncoding(enc) {\n  if (!enc) return 'utf8';\n  var retried;\n  while (true) {\n    switch (enc) {\n      case 'utf8':\n      case 'utf-8':\n        return 'utf8';\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return 'utf16le';\n      case 'latin1':\n      case 'binary':\n        return 'latin1';\n      case 'base64':\n      case 'ascii':\n      case 'hex':\n        return enc;\n      default:\n        if (retried) return; // undefined\n        enc = ('' + enc).toLowerCase();\n        retried = true;\n    }\n  }\n};\n\n// Do not cache `Buffer.isEncoding` when checking encoding names as some\n// modules monkey-patch it to support additional encodings\nfunction normalizeEncoding(enc) {\n  var nenc = _normalizeEncoding(enc);\n  if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc);\n  return nenc || enc;\n}\n\n// StringDecoder provides an interface for efficiently splitting a series of\n// buffers into a series of JS strings without breaking apart multi-byte\n// characters.\nexports.StringDecoder = StringDecoder;\nfunction StringDecoder(encoding) {\n  this.encoding = normalizeEncoding(encoding);\n  var nb;\n  switch (this.encoding) {\n    case 'utf16le':\n      this.text = utf16Text;\n      this.end = utf16End;\n      nb = 4;\n      break;\n    case 'utf8':\n      this.fillLast = utf8FillLast;\n      nb = 4;\n      break;\n    case 'base64':\n      this.text = base64Text;\n      this.end = base64End;\n      nb = 3;\n      break;\n    default:\n      this.write = simpleWrite;\n      this.end = simpleEnd;\n      return;\n  }\n  this.lastNeed = 0;\n  this.lastTotal = 0;\n  this.lastChar = Buffer.allocUnsafe(nb);\n}\n\nStringDecoder.prototype.write = function (buf) {\n  if (buf.length === 0) return '';\n  var r;\n  var i;\n  if (this.lastNeed) {\n    r = this.fillLast(buf);\n    if (r === undefined) return '';\n    i = this.lastNeed;\n    this.lastNeed = 0;\n  } else {\n    i = 0;\n  }\n  if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);\n  return r || '';\n};\n\nStringDecoder.prototype.end = utf8End;\n\n// Returns only complete characters in a Buffer\nStringDecoder.prototype.text = utf8Text;\n\n// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\nStringDecoder.prototype.fillLast = function (buf) {\n  if (this.lastNeed <= buf.length) {\n    buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed);\n    return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n  }\n  buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length);\n  this.lastNeed -= buf.length;\n};\n\n// Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a\n// continuation byte. If an invalid byte is detected, -2 is returned.\nfunction utf8CheckByte(byte) {\n  if (byte <= 0x7F) return 0;else if (byte >> 5 === 0x06) return 2;else if (byte >> 4 === 0x0E) return 3;else if (byte >> 3 === 0x1E) return 4;\n  return byte >> 6 === 0x02 ? -1 : -2;\n}\n\n// Checks at most 3 bytes at the end of a Buffer in order to detect an\n// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4)\n// needed to complete the UTF-8 character (if applicable) are returned.\nfunction utf8CheckIncomplete(self, buf, i) {\n  var j = buf.length - 1;\n  if (j < i) return 0;\n  var nb = utf8CheckByte(buf[j]);\n  if (nb >= 0) {\n    if (nb > 0) self.lastNeed = nb - 1;\n    return nb;\n  }\n  if (--j < i || nb === -2) return 0;\n  nb = utf8CheckByte(buf[j]);\n  if (nb >= 0) {\n    if (nb > 0) self.lastNeed = nb - 2;\n    return nb;\n  }\n  if (--j < i || nb === -2) return 0;\n  nb = utf8CheckByte(buf[j]);\n  if (nb >= 0) {\n    if (nb > 0) {\n      if (nb === 2) nb = 0;else self.lastNeed = nb - 3;\n    }\n    return nb;\n  }\n  return 0;\n}\n\n// Validates as many continuation bytes for a multi-byte UTF-8 character as\n// needed or are available. If we see a non-continuation byte where we expect\n// one, we \"replace\" the validated continuation bytes we've seen so far with\n// a single UTF-8 replacement character ('\\ufffd'), to match v8's UTF-8 decoding\n// behavior. The continuation byte check is included three times in the case\n// where all of the continuation bytes for a character exist in the same buffer.\n// It is also done this way as a slight performance increase instead of using a\n// loop.\nfunction utf8CheckExtraBytes(self, buf, p) {\n  if ((buf[0] & 0xC0) !== 0x80) {\n    self.lastNeed = 0;\n    return '\\ufffd';\n  }\n  if (self.lastNeed > 1 && buf.length > 1) {\n    if ((buf[1] & 0xC0) !== 0x80) {\n      self.lastNeed = 1;\n      return '\\ufffd';\n    }\n    if (self.lastNeed > 2 && buf.length > 2) {\n      if ((buf[2] & 0xC0) !== 0x80) {\n        self.lastNeed = 2;\n        return '\\ufffd';\n      }\n    }\n  }\n}\n\n// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\nfunction utf8FillLast(buf) {\n  var p = this.lastTotal - this.lastNeed;\n  var r = utf8CheckExtraBytes(this, buf, p);\n  if (r !== undefined) return r;\n  if (this.lastNeed <= buf.length) {\n    buf.copy(this.lastChar, p, 0, this.lastNeed);\n    return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n  }\n  buf.copy(this.lastChar, p, 0, buf.length);\n  this.lastNeed -= buf.length;\n}\n\n// Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a\n// partial character, the character's bytes are buffered until the required\n// number of bytes are available.\nfunction utf8Text(buf, i) {\n  var total = utf8CheckIncomplete(this, buf, i);\n  if (!this.lastNeed) return buf.toString('utf8', i);\n  this.lastTotal = total;\n  var end = buf.length - (total - this.lastNeed);\n  buf.copy(this.lastChar, 0, end);\n  return buf.toString('utf8', i, end);\n}\n\n// For UTF-8, a replacement character is added when ending on a partial\n// character.\nfunction utf8End(buf) {\n  var r = buf && buf.length ? this.write(buf) : '';\n  if (this.lastNeed) return r + '\\ufffd';\n  return r;\n}\n\n// UTF-16LE typically needs two bytes per character, but even if we have an even\n// number of bytes available, we need to check if we end on a leading/high\n// surrogate. In that case, we need to wait for the next two bytes in order to\n// decode the last character properly.\nfunction utf16Text(buf, i) {\n  if ((buf.length - i) % 2 === 0) {\n    var r = buf.toString('utf16le', i);\n    if (r) {\n      var c = r.charCodeAt(r.length - 1);\n      if (c >= 0xD800 && c <= 0xDBFF) {\n        this.lastNeed = 2;\n        this.lastTotal = 4;\n        this.lastChar[0] = buf[buf.length - 2];\n        this.lastChar[1] = buf[buf.length - 1];\n        return r.slice(0, -1);\n      }\n    }\n    return r;\n  }\n  this.lastNeed = 1;\n  this.lastTotal = 2;\n  this.lastChar[0] = buf[buf.length - 1];\n  return buf.toString('utf16le', i, buf.length - 1);\n}\n\n// For UTF-16LE we do not explicitly append special replacement characters if we\n// end on a partial character, we simply let v8 handle that.\nfunction utf16End(buf) {\n  var r = buf && buf.length ? this.write(buf) : '';\n  if (this.lastNeed) {\n    var end = this.lastTotal - this.lastNeed;\n    return r + this.lastChar.toString('utf16le', 0, end);\n  }\n  return r;\n}\n\nfunction base64Text(buf, i) {\n  var n = (buf.length - i) % 3;\n  if (n === 0) return buf.toString('base64', i);\n  this.lastNeed = 3 - n;\n  this.lastTotal = 3;\n  if (n === 1) {\n    this.lastChar[0] = buf[buf.length - 1];\n  } else {\n    this.lastChar[0] = buf[buf.length - 2];\n    this.lastChar[1] = buf[buf.length - 1];\n  }\n  return buf.toString('base64', i, buf.length - n);\n}\n\nfunction base64End(buf) {\n  var r = buf && buf.length ? this.write(buf) : '';\n  if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed);\n  return r;\n}\n\n// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\nfunction simpleWrite(buf) {\n  return buf.toString(this.encoding);\n}\n\nfunction simpleEnd(buf) {\n  return buf && buf.length ? this.write(buf) : '';\n}","'use strict';\n\nvar _Object$setPrototypeO;\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nvar finished = require('./end-of-stream');\n\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\n\nfunction createIterResult(value, done) {\n  return {\n    value: value,\n    done: done\n  };\n}\n\nfunction readAndResolve(iter) {\n  var resolve = iter[kLastResolve];\n\n  if (resolve !== null) {\n    var data = iter[kStream].read(); // we defer if data is null\n    // we can be expecting either 'end' or\n    // 'error'\n\n    if (data !== null) {\n      iter[kLastPromise] = null;\n      iter[kLastResolve] = null;\n      iter[kLastReject] = null;\n      resolve(createIterResult(data, false));\n    }\n  }\n}\n\nfunction onReadable(iter) {\n  // we wait for the next tick, because it might\n  // emit an error with process.nextTick\n  process.nextTick(readAndResolve, iter);\n}\n\nfunction wrapForNext(lastPromise, iter) {\n  return function (resolve, reject) {\n    lastPromise.then(function () {\n      if (iter[kEnded]) {\n        resolve(createIterResult(undefined, true));\n        return;\n      }\n\n      iter[kHandlePromise](resolve, reject);\n    }, reject);\n  };\n}\n\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n  get stream() {\n    return this[kStream];\n  },\n\n  next: function next() {\n    var _this = this;\n\n    // if we have detected an error in the meanwhile\n    // reject straight away\n    var error = this[kError];\n\n    if (error !== null) {\n      return Promise.reject(error);\n    }\n\n    if (this[kEnded]) {\n      return Promise.resolve(createIterResult(undefined, true));\n    }\n\n    if (this[kStream].destroyed) {\n      // We need to defer via nextTick because if .destroy(err) is\n      // called, the error will be emitted via nextTick, and\n      // we cannot guarantee that there is no error lingering around\n      // waiting to be emitted.\n      return new Promise(function (resolve, reject) {\n        process.nextTick(function () {\n          if (_this[kError]) {\n            reject(_this[kError]);\n          } else {\n            resolve(createIterResult(undefined, true));\n          }\n        });\n      });\n    } // if we have multiple next() calls\n    // we will wait for the previous Promise to finish\n    // this logic is optimized to support for await loops,\n    // where next() is only called once at a time\n\n\n    var lastPromise = this[kLastPromise];\n    var promise;\n\n    if (lastPromise) {\n      promise = new Promise(wrapForNext(lastPromise, this));\n    } else {\n      // fast path needed to support multiple this.push()\n      // without triggering the next() queue\n      var data = this[kStream].read();\n\n      if (data !== null) {\n        return Promise.resolve(createIterResult(data, false));\n      }\n\n      promise = new Promise(this[kHandlePromise]);\n    }\n\n    this[kLastPromise] = promise;\n    return promise;\n  }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n  return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n  var _this2 = this;\n\n  // destroy(err, cb) is a private API\n  // we can guarantee we have that here, because we control the\n  // Readable class this is attached to\n  return new Promise(function (resolve, reject) {\n    _this2[kStream].destroy(null, function (err) {\n      if (err) {\n        reject(err);\n        return;\n      }\n\n      resolve(createIterResult(undefined, true));\n    });\n  });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\n\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n  var _Object$create;\n\n  var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n    value: stream,\n    writable: true\n  }), _defineProperty(_Object$create, kLastResolve, {\n    value: null,\n    writable: true\n  }), _defineProperty(_Object$create, kLastReject, {\n    value: null,\n    writable: true\n  }), _defineProperty(_Object$create, kError, {\n    value: null,\n    writable: true\n  }), _defineProperty(_Object$create, kEnded, {\n    value: stream._readableState.endEmitted,\n    writable: true\n  }), _defineProperty(_Object$create, kHandlePromise, {\n    value: function value(resolve, reject) {\n      var data = iterator[kStream].read();\n\n      if (data) {\n        iterator[kLastPromise] = null;\n        iterator[kLastResolve] = null;\n        iterator[kLastReject] = null;\n        resolve(createIterResult(data, false));\n      } else {\n        iterator[kLastResolve] = resolve;\n        iterator[kLastReject] = reject;\n      }\n    },\n    writable: true\n  }), _Object$create));\n  iterator[kLastPromise] = null;\n  finished(stream, function (err) {\n    if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n      var reject = iterator[kLastReject]; // reject if we are waiting for data in the Promise\n      // returned by next() and store the error\n\n      if (reject !== null) {\n        iterator[kLastPromise] = null;\n        iterator[kLastResolve] = null;\n        iterator[kLastReject] = null;\n        reject(err);\n      }\n\n      iterator[kError] = err;\n      return;\n    }\n\n    var resolve = iterator[kLastResolve];\n\n    if (resolve !== null) {\n      iterator[kLastPromise] = null;\n      iterator[kLastResolve] = null;\n      iterator[kLastReject] = null;\n      resolve(createIterResult(undefined, true));\n    }\n\n    iterator[kEnded] = true;\n  });\n  stream.on('readable', onReadable.bind(null, iterator));\n  return iterator;\n};\n\nmodule.exports = createReadableStreamAsyncIterator;","// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\n\nfunction once(callback) {\n  var called = false;\n  return function () {\n    if (called) return;\n    called = true;\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    callback.apply(this, args);\n  };\n}\n\nfunction noop() {}\n\nfunction isRequest(stream) {\n  return stream.setHeader && typeof stream.abort === 'function';\n}\n\nfunction eos(stream, opts, callback) {\n  if (typeof opts === 'function') return eos(stream, null, opts);\n  if (!opts) opts = {};\n  callback = once(callback || noop);\n  var readable = opts.readable || opts.readable !== false && stream.readable;\n  var writable = opts.writable || opts.writable !== false && stream.writable;\n\n  var onlegacyfinish = function onlegacyfinish() {\n    if (!stream.writable) onfinish();\n  };\n\n  var writableEnded = stream._writableState && stream._writableState.finished;\n\n  var onfinish = function onfinish() {\n    writable = false;\n    writableEnded = true;\n    if (!readable) callback.call(stream);\n  };\n\n  var readableEnded = stream._readableState && stream._readableState.endEmitted;\n\n  var onend = function onend() {\n    readable = false;\n    readableEnded = true;\n    if (!writable) callback.call(stream);\n  };\n\n  var onerror = function onerror(err) {\n    callback.call(stream, err);\n  };\n\n  var onclose = function onclose() {\n    var err;\n\n    if (readable && !readableEnded) {\n      if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n      return callback.call(stream, err);\n    }\n\n    if (writable && !writableEnded) {\n      if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n      return callback.call(stream, err);\n    }\n  };\n\n  var onrequest = function onrequest() {\n    stream.req.on('finish', onfinish);\n  };\n\n  if (isRequest(stream)) {\n    stream.on('complete', onfinish);\n    stream.on('abort', onclose);\n    if (stream.req) onrequest();else stream.on('request', onrequest);\n  } else if (writable && !stream._writableState) {\n    // legacy streams\n    stream.on('end', onlegacyfinish);\n    stream.on('close', onlegacyfinish);\n  }\n\n  stream.on('end', onend);\n  stream.on('finish', onfinish);\n  if (opts.error !== false) stream.on('error', onerror);\n  stream.on('close', onclose);\n  return function () {\n    stream.removeListener('complete', onfinish);\n    stream.removeListener('abort', onclose);\n    stream.removeListener('request', onrequest);\n    if (stream.req) stream.req.removeListener('finish', onfinish);\n    stream.removeListener('end', onlegacyfinish);\n    stream.removeListener('close', onlegacyfinish);\n    stream.removeListener('finish', onfinish);\n    stream.removeListener('end', onend);\n    stream.removeListener('error', onerror);\n    stream.removeListener('close', onclose);\n  };\n}\n\nmodule.exports = eos;","module.exports = function () {\n  throw new Error('Readable.from is not available in the browser')\n};\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n// a transform stream is a readable/writable stream where you do\n// something with the data.  Sometimes it's called a \"filter\",\n// but that's not a great name for it, since that implies a thing where\n// some bits pass through, and others are simply ignored.  (That would\n// be a valid example of a transform, of course.)\n//\n// While the output is causally related to the input, it's not a\n// necessarily symmetric or synchronous transformation.  For example,\n// a zlib stream might take multiple plain-text writes(), and then\n// emit a single compressed chunk some time in the future.\n//\n// Here's how this works:\n//\n// The Transform stream has all the aspects of the readable and writable\n// stream classes.  When you write(chunk), that calls _write(chunk,cb)\n// internally, and returns false if there's a lot of pending writes\n// buffered up.  When you call read(), that calls _read(n) until\n// there's enough pending readable data buffered up.\n//\n// In a transform stream, the written data is placed in a buffer.  When\n// _read(n) is called, it transforms the queued up data, calling the\n// buffered _write cb's as it consumes chunks.  If consuming a single\n// written chunk would result in multiple output chunks, then the first\n// outputted bit calls the readcb, and subsequent chunks just go into\n// the read buffer, and will cause it to emit 'readable' if necessary.\n//\n// This way, back-pressure is actually determined by the reading side,\n// since _read has to be called to start processing a new chunk.  However,\n// a pathological inflate type of transform can cause excessive buffering\n// here.  For example, imagine a stream where every byte of input is\n// interpreted as an integer from 0-255, and then results in that many\n// bytes of output.  Writing the 4 bytes {ff,ff,ff,ff} would result in\n// 1kb of data being output.  In this case, you could write a very small\n// amount of input, and end up with a very large amount of output.  In\n// such a pathological inflating mechanism, there'd be no way to tell\n// the system to stop doing the transform.  A single 4MB write could\n// cause the system to run out of memory.\n//\n// However, even in such a pathological case, only a single written chunk\n// would be consumed, and then the rest would wait (un-transformed) until\n// the results of the previous transformed chunk were consumed.\n'use strict';\n\nmodule.exports = Transform;\n\nvar _require$codes = require('../errors').codes,\n    ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n    ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n    ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n    ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\n\nvar Duplex = require('./_stream_duplex');\n\nrequire('inherits')(Transform, Duplex);\n\nfunction afterTransform(er, data) {\n  var ts = this._transformState;\n  ts.transforming = false;\n  var cb = ts.writecb;\n\n  if (cb === null) {\n    return this.emit('error', new ERR_MULTIPLE_CALLBACK());\n  }\n\n  ts.writechunk = null;\n  ts.writecb = null;\n  if (data != null) // single equals check for both `null` and `undefined`\n    this.push(data);\n  cb(er);\n  var rs = this._readableState;\n  rs.reading = false;\n\n  if (rs.needReadable || rs.length < rs.highWaterMark) {\n    this._read(rs.highWaterMark);\n  }\n}\n\nfunction Transform(options) {\n  if (!(this instanceof Transform)) return new Transform(options);\n  Duplex.call(this, options);\n  this._transformState = {\n    afterTransform: afterTransform.bind(this),\n    needTransform: false,\n    transforming: false,\n    writecb: null,\n    writechunk: null,\n    writeencoding: null\n  }; // start out asking for a readable event once data is transformed.\n\n  this._readableState.needReadable = true; // we have implemented the _read method, and done the other things\n  // that Readable wants before the first _read call, so unset the\n  // sync guard flag.\n\n  this._readableState.sync = false;\n\n  if (options) {\n    if (typeof options.transform === 'function') this._transform = options.transform;\n    if (typeof options.flush === 'function') this._flush = options.flush;\n  } // When the writable side finishes, then flush out anything remaining.\n\n\n  this.on('prefinish', prefinish);\n}\n\nfunction prefinish() {\n  var _this = this;\n\n  if (typeof this._flush === 'function' && !this._readableState.destroyed) {\n    this._flush(function (er, data) {\n      done(_this, er, data);\n    });\n  } else {\n    done(this, null, null);\n  }\n}\n\nTransform.prototype.push = function (chunk, encoding) {\n  this._transformState.needTransform = false;\n  return Duplex.prototype.push.call(this, chunk, encoding);\n}; // This is the part where you do stuff!\n// override this function in implementation classes.\n// 'chunk' is an input chunk.\n//\n// Call `push(newChunk)` to pass along transformed output\n// to the readable side.  You may call 'push' zero or more times.\n//\n// Call `cb(err)` when you are done with this chunk.  If you pass\n// an error, then that'll put the hurt on the whole operation.  If you\n// never call cb(), then you'll never get another chunk.\n\n\nTransform.prototype._transform = function (chunk, encoding, cb) {\n  cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\n};\n\nTransform.prototype._write = function (chunk, encoding, cb) {\n  var ts = this._transformState;\n  ts.writecb = cb;\n  ts.writechunk = chunk;\n  ts.writeencoding = encoding;\n\n  if (!ts.transforming) {\n    var rs = this._readableState;\n    if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark);\n  }\n}; // Doesn't matter what the args are here.\n// _transform does all the work.\n// That we got here means that the readable side wants more data.\n\n\nTransform.prototype._read = function (n) {\n  var ts = this._transformState;\n\n  if (ts.writechunk !== null && !ts.transforming) {\n    ts.transforming = true;\n\n    this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n  } else {\n    // mark that we need a transform, so that any data that comes in\n    // will get processed, now that we've asked for it.\n    ts.needTransform = true;\n  }\n};\n\nTransform.prototype._destroy = function (err, cb) {\n  Duplex.prototype._destroy.call(this, err, function (err2) {\n    cb(err2);\n  });\n};\n\nfunction done(stream, er, data) {\n  if (er) return stream.emit('error', er);\n  if (data != null) // single equals check for both `null` and `undefined`\n    stream.push(data); // TODO(BridgeAR): Write a test for these two error cases\n  // if there's nothing in the write buffer, then that means\n  // that nothing more will ever be provided\n\n  if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0();\n  if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n  return stream.push(null);\n}","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n// a passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n'use strict';\n\nmodule.exports = PassThrough;\n\nvar Transform = require('./_stream_transform');\n\nrequire('inherits')(PassThrough, Transform);\n\nfunction PassThrough(options) {\n  if (!(this instanceof PassThrough)) return new PassThrough(options);\n  Transform.call(this, options);\n}\n\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n  cb(null, chunk);\n};","// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n'use strict';\n\nvar eos;\n\nfunction once(callback) {\n  var called = false;\n  return function () {\n    if (called) return;\n    called = true;\n    callback.apply(void 0, arguments);\n  };\n}\n\nvar _require$codes = require('../../../errors').codes,\n    ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n    ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\n\nfunction noop(err) {\n  // Rethrow the error if it exists to avoid swallowing it\n  if (err) throw err;\n}\n\nfunction isRequest(stream) {\n  return stream.setHeader && typeof stream.abort === 'function';\n}\n\nfunction destroyer(stream, reading, writing, callback) {\n  callback = once(callback);\n  var closed = false;\n  stream.on('close', function () {\n    closed = true;\n  });\n  if (eos === undefined) eos = require('./end-of-stream');\n  eos(stream, {\n    readable: reading,\n    writable: writing\n  }, function (err) {\n    if (err) return callback(err);\n    closed = true;\n    callback();\n  });\n  var destroyed = false;\n  return function (err) {\n    if (closed) return;\n    if (destroyed) return;\n    destroyed = true; // request.destroy just do .end - .abort is what we want\n\n    if (isRequest(stream)) return stream.abort();\n    if (typeof stream.destroy === 'function') return stream.destroy();\n    callback(err || new ERR_STREAM_DESTROYED('pipe'));\n  };\n}\n\nfunction call(fn) {\n  fn();\n}\n\nfunction pipe(from, to) {\n  return from.pipe(to);\n}\n\nfunction popCallback(streams) {\n  if (!streams.length) return noop;\n  if (typeof streams[streams.length - 1] !== 'function') return noop;\n  return streams.pop();\n}\n\nfunction pipeline() {\n  for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n    streams[_key] = arguments[_key];\n  }\n\n  var callback = popCallback(streams);\n  if (Array.isArray(streams[0])) streams = streams[0];\n\n  if (streams.length < 2) {\n    throw new ERR_MISSING_ARGS('streams');\n  }\n\n  var error;\n  var destroys = streams.map(function (stream, i) {\n    var reading = i < streams.length - 1;\n    var writing = i > 0;\n    return destroyer(stream, reading, writing, function (err) {\n      if (!error) error = err;\n      if (err) destroys.forEach(call);\n      if (reading) return;\n      destroys.forEach(call);\n      callback(error);\n    });\n  });\n  return streams.reduce(pipe);\n}\n\nmodule.exports = pipeline;","'use strict'\nvar Buffer = require('buffer').Buffer\nvar inherits = require('inherits')\nvar HashBase = require('hash-base')\n\nvar ARRAY16 = new Array(16)\n\nvar zl = [\n  0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n  7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n  3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n  1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n  4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n]\n\nvar zr = [\n  5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n  6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n  15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n  8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n  12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n]\n\nvar sl = [\n  11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n  7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n  11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n  11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n  9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n]\n\nvar sr = [\n  8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n  9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n  9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n  15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n  8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n]\n\nvar hl = [0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e]\nvar hr = [0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000]\n\nfunction RIPEMD160 () {\n  HashBase.call(this, 64)\n\n  // state\n  this._a = 0x67452301\n  this._b = 0xefcdab89\n  this._c = 0x98badcfe\n  this._d = 0x10325476\n  this._e = 0xc3d2e1f0\n}\n\ninherits(RIPEMD160, HashBase)\n\nRIPEMD160.prototype._update = function () {\n  var words = ARRAY16\n  for (var j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4)\n\n  var al = this._a | 0\n  var bl = this._b | 0\n  var cl = this._c | 0\n  var dl = this._d | 0\n  var el = this._e | 0\n\n  var ar = this._a | 0\n  var br = this._b | 0\n  var cr = this._c | 0\n  var dr = this._d | 0\n  var er = this._e | 0\n\n  // computation\n  for (var i = 0; i < 80; i += 1) {\n    var tl\n    var tr\n    if (i < 16) {\n      tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i])\n      tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i])\n    } else if (i < 32) {\n      tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i])\n      tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i])\n    } else if (i < 48) {\n      tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i])\n      tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i])\n    } else if (i < 64) {\n      tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i])\n      tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i])\n    } else { // if (i<80) {\n      tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i])\n      tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i])\n    }\n\n    al = el\n    el = dl\n    dl = rotl(cl, 10)\n    cl = bl\n    bl = tl\n\n    ar = er\n    er = dr\n    dr = rotl(cr, 10)\n    cr = br\n    br = tr\n  }\n\n  // update state\n  var t = (this._b + cl + dr) | 0\n  this._b = (this._c + dl + er) | 0\n  this._c = (this._d + el + ar) | 0\n  this._d = (this._e + al + br) | 0\n  this._e = (this._a + bl + cr) | 0\n  this._a = t\n}\n\nRIPEMD160.prototype._digest = function () {\n  // create padding and handle blocks\n  this._block[this._blockOffset++] = 0x80\n  if (this._blockOffset > 56) {\n    this._block.fill(0, this._blockOffset, 64)\n    this._update()\n    this._blockOffset = 0\n  }\n\n  this._block.fill(0, this._blockOffset, 56)\n  this._block.writeUInt32LE(this._length[0], 56)\n  this._block.writeUInt32LE(this._length[1], 60)\n  this._update()\n\n  // produce result\n  var buffer = Buffer.alloc ? Buffer.alloc(20) : new Buffer(20)\n  buffer.writeInt32LE(this._a, 0)\n  buffer.writeInt32LE(this._b, 4)\n  buffer.writeInt32LE(this._c, 8)\n  buffer.writeInt32LE(this._d, 12)\n  buffer.writeInt32LE(this._e, 16)\n  return buffer\n}\n\nfunction rotl (x, n) {\n  return (x << n) | (x >>> (32 - n))\n}\n\nfunction fn1 (a, b, c, d, e, m, k, s) {\n  return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0\n}\n\nfunction fn2 (a, b, c, d, e, m, k, s) {\n  return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + e) | 0\n}\n\nfunction fn3 (a, b, c, d, e, m, k, s) {\n  return (rotl((a + ((b | (~c)) ^ d) + m + k) | 0, s) + e) | 0\n}\n\nfunction fn4 (a, b, c, d, e, m, k, s) {\n  return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + e) | 0\n}\n\nfunction fn5 (a, b, c, d, e, m, k, s) {\n  return (rotl((a + (b ^ (c | (~d))) + m + k) | 0, s) + e) | 0\n}\n\nmodule.exports = RIPEMD160\n","var exports = module.exports = function SHA (algorithm) {\n  algorithm = algorithm.toLowerCase()\n\n  var Algorithm = exports[algorithm]\n  if (!Algorithm) throw new Error(algorithm + ' is not supported (we accept pull requests)')\n\n  return new Algorithm()\n}\n\nexports.sha = require('./sha')\nexports.sha1 = require('./sha1')\nexports.sha224 = require('./sha224')\nexports.sha256 = require('./sha256')\nexports.sha384 = require('./sha384')\nexports.sha512 = require('./sha512')\n","/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-0, as defined\n * in FIPS PUB 180-1\n * This source code is derived from sha1.js of the same repository.\n * The difference between SHA-0 and SHA-1 is just a bitwise rotate left\n * operation was added.\n */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n  0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n]\n\nvar W = new Array(80)\n\nfunction Sha () {\n  this.init()\n  this._w = W\n\n  Hash.call(this, 64, 56)\n}\n\ninherits(Sha, Hash)\n\nSha.prototype.init = function () {\n  this._a = 0x67452301\n  this._b = 0xefcdab89\n  this._c = 0x98badcfe\n  this._d = 0x10325476\n  this._e = 0xc3d2e1f0\n\n  return this\n}\n\nfunction rotl5 (num) {\n  return (num << 5) | (num >>> 27)\n}\n\nfunction rotl30 (num) {\n  return (num << 30) | (num >>> 2)\n}\n\nfunction ft (s, b, c, d) {\n  if (s === 0) return (b & c) | ((~b) & d)\n  if (s === 2) return (b & c) | (b & d) | (c & d)\n  return b ^ c ^ d\n}\n\nSha.prototype._update = function (M) {\n  var W = this._w\n\n  var a = this._a | 0\n  var b = this._b | 0\n  var c = this._c | 0\n  var d = this._d | 0\n  var e = this._e | 0\n\n  for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)\n  for (; i < 80; ++i) W[i] = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16]\n\n  for (var j = 0; j < 80; ++j) {\n    var s = ~~(j / 20)\n    var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0\n\n    e = d\n    d = c\n    c = rotl30(b)\n    b = a\n    a = t\n  }\n\n  this._a = (a + this._a) | 0\n  this._b = (b + this._b) | 0\n  this._c = (c + this._c) | 0\n  this._d = (d + this._d) | 0\n  this._e = (e + this._e) | 0\n}\n\nSha.prototype._hash = function () {\n  var H = Buffer.allocUnsafe(20)\n\n  H.writeInt32BE(this._a | 0, 0)\n  H.writeInt32BE(this._b | 0, 4)\n  H.writeInt32BE(this._c | 0, 8)\n  H.writeInt32BE(this._d | 0, 12)\n  H.writeInt32BE(this._e | 0, 16)\n\n  return H\n}\n\nmodule.exports = Sha\n","var Buffer = require('safe-buffer').Buffer\n\n// prototype class for hash functions\nfunction Hash (blockSize, finalSize) {\n  this._block = Buffer.alloc(blockSize)\n  this._finalSize = finalSize\n  this._blockSize = blockSize\n  this._len = 0\n}\n\nHash.prototype.update = function (data, enc) {\n  if (typeof data === 'string') {\n    enc = enc || 'utf8'\n    data = Buffer.from(data, enc)\n  }\n\n  var block = this._block\n  var blockSize = this._blockSize\n  var length = data.length\n  var accum = this._len\n\n  for (var offset = 0; offset < length;) {\n    var assigned = accum % blockSize\n    var remainder = Math.min(length - offset, blockSize - assigned)\n\n    for (var i = 0; i < remainder; i++) {\n      block[assigned + i] = data[offset + i]\n    }\n\n    accum += remainder\n    offset += remainder\n\n    if ((accum % blockSize) === 0) {\n      this._update(block)\n    }\n  }\n\n  this._len += length\n  return this\n}\n\nHash.prototype.digest = function (enc) {\n  var rem = this._len % this._blockSize\n\n  this._block[rem] = 0x80\n\n  // zero (rem + 1) trailing bits, where (rem + 1) is the smallest\n  // non-negative solution to the equation (length + 1 + (rem + 1)) === finalSize mod blockSize\n  this._block.fill(0, rem + 1)\n\n  if (rem >= this._finalSize) {\n    this._update(this._block)\n    this._block.fill(0)\n  }\n\n  var bits = this._len * 8\n\n  // uint32\n  if (bits <= 0xffffffff) {\n    this._block.writeUInt32BE(bits, this._blockSize - 4)\n\n  // uint64\n  } else {\n    var lowBits = (bits & 0xffffffff) >>> 0\n    var highBits = (bits - lowBits) / 0x100000000\n\n    this._block.writeUInt32BE(highBits, this._blockSize - 8)\n    this._block.writeUInt32BE(lowBits, this._blockSize - 4)\n  }\n\n  this._update(this._block)\n  var hash = this._hash()\n\n  return enc ? hash.toString(enc) : hash\n}\n\nHash.prototype._update = function () {\n  throw new Error('_update must be implemented by subclass')\n}\n\nmodule.exports = Hash\n","/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined\n * in FIPS PUB 180-1\n * Version 2.1a Copyright Paul Johnston 2000 - 2002.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n * Distributed under the BSD License\n * See http://pajhome.org.uk/crypt/md5 for details.\n */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n  0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n]\n\nvar W = new Array(80)\n\nfunction Sha1 () {\n  this.init()\n  this._w = W\n\n  Hash.call(this, 64, 56)\n}\n\ninherits(Sha1, Hash)\n\nSha1.prototype.init = function () {\n  this._a = 0x67452301\n  this._b = 0xefcdab89\n  this._c = 0x98badcfe\n  this._d = 0x10325476\n  this._e = 0xc3d2e1f0\n\n  return this\n}\n\nfunction rotl1 (num) {\n  return (num << 1) | (num >>> 31)\n}\n\nfunction rotl5 (num) {\n  return (num << 5) | (num >>> 27)\n}\n\nfunction rotl30 (num) {\n  return (num << 30) | (num >>> 2)\n}\n\nfunction ft (s, b, c, d) {\n  if (s === 0) return (b & c) | ((~b) & d)\n  if (s === 2) return (b & c) | (b & d) | (c & d)\n  return b ^ c ^ d\n}\n\nSha1.prototype._update = function (M) {\n  var W = this._w\n\n  var a = this._a | 0\n  var b = this._b | 0\n  var c = this._c | 0\n  var d = this._d | 0\n  var e = this._e | 0\n\n  for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)\n  for (; i < 80; ++i) W[i] = rotl1(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16])\n\n  for (var j = 0; j < 80; ++j) {\n    var s = ~~(j / 20)\n    var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0\n\n    e = d\n    d = c\n    c = rotl30(b)\n    b = a\n    a = t\n  }\n\n  this._a = (a + this._a) | 0\n  this._b = (b + this._b) | 0\n  this._c = (c + this._c) | 0\n  this._d = (d + this._d) | 0\n  this._e = (e + this._e) | 0\n}\n\nSha1.prototype._hash = function () {\n  var H = Buffer.allocUnsafe(20)\n\n  H.writeInt32BE(this._a | 0, 0)\n  H.writeInt32BE(this._b | 0, 4)\n  H.writeInt32BE(this._c | 0, 8)\n  H.writeInt32BE(this._d | 0, 12)\n  H.writeInt32BE(this._e | 0, 16)\n\n  return H\n}\n\nmodule.exports = Sha1\n","/**\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined\n * in FIPS 180-2\n * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n *\n */\n\nvar inherits = require('inherits')\nvar Sha256 = require('./sha256')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar W = new Array(64)\n\nfunction Sha224 () {\n  this.init()\n\n  this._w = W // new Array(64)\n\n  Hash.call(this, 64, 56)\n}\n\ninherits(Sha224, Sha256)\n\nSha224.prototype.init = function () {\n  this._a = 0xc1059ed8\n  this._b = 0x367cd507\n  this._c = 0x3070dd17\n  this._d = 0xf70e5939\n  this._e = 0xffc00b31\n  this._f = 0x68581511\n  this._g = 0x64f98fa7\n  this._h = 0xbefa4fa4\n\n  return this\n}\n\nSha224.prototype._hash = function () {\n  var H = Buffer.allocUnsafe(28)\n\n  H.writeInt32BE(this._a, 0)\n  H.writeInt32BE(this._b, 4)\n  H.writeInt32BE(this._c, 8)\n  H.writeInt32BE(this._d, 12)\n  H.writeInt32BE(this._e, 16)\n  H.writeInt32BE(this._f, 20)\n  H.writeInt32BE(this._g, 24)\n\n  return H\n}\n\nmodule.exports = Sha224\n","/**\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined\n * in FIPS 180-2\n * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n *\n */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n  0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,\n  0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,\n  0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,\n  0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,\n  0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,\n  0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,\n  0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,\n  0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,\n  0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,\n  0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,\n  0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,\n  0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,\n  0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,\n  0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,\n  0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,\n  0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2\n]\n\nvar W = new Array(64)\n\nfunction Sha256 () {\n  this.init()\n\n  this._w = W // new Array(64)\n\n  Hash.call(this, 64, 56)\n}\n\ninherits(Sha256, Hash)\n\nSha256.prototype.init = function () {\n  this._a = 0x6a09e667\n  this._b = 0xbb67ae85\n  this._c = 0x3c6ef372\n  this._d = 0xa54ff53a\n  this._e = 0x510e527f\n  this._f = 0x9b05688c\n  this._g = 0x1f83d9ab\n  this._h = 0x5be0cd19\n\n  return this\n}\n\nfunction ch (x, y, z) {\n  return z ^ (x & (y ^ z))\n}\n\nfunction maj (x, y, z) {\n  return (x & y) | (z & (x | y))\n}\n\nfunction sigma0 (x) {\n  return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10)\n}\n\nfunction sigma1 (x) {\n  return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7)\n}\n\nfunction gamma0 (x) {\n  return (x >>> 7 | x << 25) ^ (x >>> 18 | x << 14) ^ (x >>> 3)\n}\n\nfunction gamma1 (x) {\n  return (x >>> 17 | x << 15) ^ (x >>> 19 | x << 13) ^ (x >>> 10)\n}\n\nSha256.prototype._update = function (M) {\n  var W = this._w\n\n  var a = this._a | 0\n  var b = this._b | 0\n  var c = this._c | 0\n  var d = this._d | 0\n  var e = this._e | 0\n  var f = this._f | 0\n  var g = this._g | 0\n  var h = this._h | 0\n\n  for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)\n  for (; i < 64; ++i) W[i] = (gamma1(W[i - 2]) + W[i - 7] + gamma0(W[i - 15]) + W[i - 16]) | 0\n\n  for (var j = 0; j < 64; ++j) {\n    var T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + W[j]) | 0\n    var T2 = (sigma0(a) + maj(a, b, c)) | 0\n\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\n  this._a = (a + this._a) | 0\n  this._b = (b + this._b) | 0\n  this._c = (c + this._c) | 0\n  this._d = (d + this._d) | 0\n  this._e = (e + this._e) | 0\n  this._f = (f + this._f) | 0\n  this._g = (g + this._g) | 0\n  this._h = (h + this._h) | 0\n}\n\nSha256.prototype._hash = function () {\n  var H = Buffer.allocUnsafe(32)\n\n  H.writeInt32BE(this._a, 0)\n  H.writeInt32BE(this._b, 4)\n  H.writeInt32BE(this._c, 8)\n  H.writeInt32BE(this._d, 12)\n  H.writeInt32BE(this._e, 16)\n  H.writeInt32BE(this._f, 20)\n  H.writeInt32BE(this._g, 24)\n  H.writeInt32BE(this._h, 28)\n\n  return H\n}\n\nmodule.exports = Sha256\n","var inherits = require('inherits')\nvar SHA512 = require('./sha512')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar W = new Array(160)\n\nfunction Sha384 () {\n  this.init()\n  this._w = W\n\n  Hash.call(this, 128, 112)\n}\n\ninherits(Sha384, SHA512)\n\nSha384.prototype.init = function () {\n  this._ah = 0xcbbb9d5d\n  this._bh = 0x629a292a\n  this._ch = 0x9159015a\n  this._dh = 0x152fecd8\n  this._eh = 0x67332667\n  this._fh = 0x8eb44a87\n  this._gh = 0xdb0c2e0d\n  this._hh = 0x47b5481d\n\n  this._al = 0xc1059ed8\n  this._bl = 0x367cd507\n  this._cl = 0x3070dd17\n  this._dl = 0xf70e5939\n  this._el = 0xffc00b31\n  this._fl = 0x68581511\n  this._gl = 0x64f98fa7\n  this._hl = 0xbefa4fa4\n\n  return this\n}\n\nSha384.prototype._hash = function () {\n  var H = Buffer.allocUnsafe(48)\n\n  function writeInt64BE (h, l, offset) {\n    H.writeInt32BE(h, offset)\n    H.writeInt32BE(l, offset + 4)\n  }\n\n  writeInt64BE(this._ah, this._al, 0)\n  writeInt64BE(this._bh, this._bl, 8)\n  writeInt64BE(this._ch, this._cl, 16)\n  writeInt64BE(this._dh, this._dl, 24)\n  writeInt64BE(this._eh, this._el, 32)\n  writeInt64BE(this._fh, this._fl, 40)\n\n  return H\n}\n\nmodule.exports = Sha384\n","var inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n  0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n  0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n  0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n  0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n  0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n  0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n  0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n  0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n  0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n  0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n  0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n  0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n  0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n  0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n  0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n  0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n  0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n  0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n  0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n  0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n  0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n  0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n  0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n  0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n  0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n  0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n  0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n  0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n  0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n  0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n  0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n  0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n  0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n  0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n  0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n  0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n  0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n  0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n  0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n  0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n]\n\nvar W = new Array(160)\n\nfunction Sha512 () {\n  this.init()\n  this._w = W\n\n  Hash.call(this, 128, 112)\n}\n\ninherits(Sha512, Hash)\n\nSha512.prototype.init = function () {\n  this._ah = 0x6a09e667\n  this._bh = 0xbb67ae85\n  this._ch = 0x3c6ef372\n  this._dh = 0xa54ff53a\n  this._eh = 0x510e527f\n  this._fh = 0x9b05688c\n  this._gh = 0x1f83d9ab\n  this._hh = 0x5be0cd19\n\n  this._al = 0xf3bcc908\n  this._bl = 0x84caa73b\n  this._cl = 0xfe94f82b\n  this._dl = 0x5f1d36f1\n  this._el = 0xade682d1\n  this._fl = 0x2b3e6c1f\n  this._gl = 0xfb41bd6b\n  this._hl = 0x137e2179\n\n  return this\n}\n\nfunction Ch (x, y, z) {\n  return z ^ (x & (y ^ z))\n}\n\nfunction maj (x, y, z) {\n  return (x & y) | (z & (x | y))\n}\n\nfunction sigma0 (x, xl) {\n  return (x >>> 28 | xl << 4) ^ (xl >>> 2 | x << 30) ^ (xl >>> 7 | x << 25)\n}\n\nfunction sigma1 (x, xl) {\n  return (x >>> 14 | xl << 18) ^ (x >>> 18 | xl << 14) ^ (xl >>> 9 | x << 23)\n}\n\nfunction Gamma0 (x, xl) {\n  return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7)\n}\n\nfunction Gamma0l (x, xl) {\n  return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7 | xl << 25)\n}\n\nfunction Gamma1 (x, xl) {\n  return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6)\n}\n\nfunction Gamma1l (x, xl) {\n  return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6 | xl << 26)\n}\n\nfunction getCarry (a, b) {\n  return (a >>> 0) < (b >>> 0) ? 1 : 0\n}\n\nSha512.prototype._update = function (M) {\n  var W = this._w\n\n  var ah = this._ah | 0\n  var bh = this._bh | 0\n  var ch = this._ch | 0\n  var dh = this._dh | 0\n  var eh = this._eh | 0\n  var fh = this._fh | 0\n  var gh = this._gh | 0\n  var hh = this._hh | 0\n\n  var al = this._al | 0\n  var bl = this._bl | 0\n  var cl = this._cl | 0\n  var dl = this._dl | 0\n  var el = this._el | 0\n  var fl = this._fl | 0\n  var gl = this._gl | 0\n  var hl = this._hl | 0\n\n  for (var i = 0; i < 32; i += 2) {\n    W[i] = M.readInt32BE(i * 4)\n    W[i + 1] = M.readInt32BE(i * 4 + 4)\n  }\n  for (; i < 160; i += 2) {\n    var xh = W[i - 15 * 2]\n    var xl = W[i - 15 * 2 + 1]\n    var gamma0 = Gamma0(xh, xl)\n    var gamma0l = Gamma0l(xl, xh)\n\n    xh = W[i - 2 * 2]\n    xl = W[i - 2 * 2 + 1]\n    var gamma1 = Gamma1(xh, xl)\n    var gamma1l = Gamma1l(xl, xh)\n\n    // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]\n    var Wi7h = W[i - 7 * 2]\n    var Wi7l = W[i - 7 * 2 + 1]\n\n    var Wi16h = W[i - 16 * 2]\n    var Wi16l = W[i - 16 * 2 + 1]\n\n    var Wil = (gamma0l + Wi7l) | 0\n    var Wih = (gamma0 + Wi7h + getCarry(Wil, gamma0l)) | 0\n    Wil = (Wil + gamma1l) | 0\n    Wih = (Wih + gamma1 + getCarry(Wil, gamma1l)) | 0\n    Wil = (Wil + Wi16l) | 0\n    Wih = (Wih + Wi16h + getCarry(Wil, Wi16l)) | 0\n\n    W[i] = Wih\n    W[i + 1] = Wil\n  }\n\n  for (var j = 0; j < 160; j += 2) {\n    Wih = W[j]\n    Wil = W[j + 1]\n\n    var majh = maj(ah, bh, ch)\n    var majl = maj(al, bl, cl)\n\n    var sigma0h = sigma0(ah, al)\n    var sigma0l = sigma0(al, ah)\n    var sigma1h = sigma1(eh, el)\n    var sigma1l = sigma1(el, eh)\n\n    // t1 = h + sigma1 + ch + K[j] + W[j]\n    var Kih = K[j]\n    var Kil = K[j + 1]\n\n    var chh = Ch(eh, fh, gh)\n    var chl = Ch(el, fl, gl)\n\n    var t1l = (hl + sigma1l) | 0\n    var t1h = (hh + sigma1h + getCarry(t1l, hl)) | 0\n    t1l = (t1l + chl) | 0\n    t1h = (t1h + chh + getCarry(t1l, chl)) | 0\n    t1l = (t1l + Kil) | 0\n    t1h = (t1h + Kih + getCarry(t1l, Kil)) | 0\n    t1l = (t1l + Wil) | 0\n    t1h = (t1h + Wih + getCarry(t1l, Wil)) | 0\n\n    // t2 = sigma0 + maj\n    var t2l = (sigma0l + majl) | 0\n    var t2h = (sigma0h + majh + getCarry(t2l, sigma0l)) | 0\n\n    hh = gh\n    hl = gl\n    gh = fh\n    gl = fl\n    fh = eh\n    fl = el\n    el = (dl + t1l) | 0\n    eh = (dh + t1h + getCarry(el, dl)) | 0\n    dh = ch\n    dl = cl\n    ch = bh\n    cl = bl\n    bh = ah\n    bl = al\n    al = (t1l + t2l) | 0\n    ah = (t1h + t2h + getCarry(al, t1l)) | 0\n  }\n\n  this._al = (this._al + al) | 0\n  this._bl = (this._bl + bl) | 0\n  this._cl = (this._cl + cl) | 0\n  this._dl = (this._dl + dl) | 0\n  this._el = (this._el + el) | 0\n  this._fl = (this._fl + fl) | 0\n  this._gl = (this._gl + gl) | 0\n  this._hl = (this._hl + hl) | 0\n\n  this._ah = (this._ah + ah + getCarry(this._al, al)) | 0\n  this._bh = (this._bh + bh + getCarry(this._bl, bl)) | 0\n  this._ch = (this._ch + ch + getCarry(this._cl, cl)) | 0\n  this._dh = (this._dh + dh + getCarry(this._dl, dl)) | 0\n  this._eh = (this._eh + eh + getCarry(this._el, el)) | 0\n  this._fh = (this._fh + fh + getCarry(this._fl, fl)) | 0\n  this._gh = (this._gh + gh + getCarry(this._gl, gl)) | 0\n  this._hh = (this._hh + hh + getCarry(this._hl, hl)) | 0\n}\n\nSha512.prototype._hash = function () {\n  var H = Buffer.allocUnsafe(64)\n\n  function writeInt64BE (h, l, offset) {\n    H.writeInt32BE(h, offset)\n    H.writeInt32BE(l, offset + 4)\n  }\n\n  writeInt64BE(this._ah, this._al, 0)\n  writeInt64BE(this._bh, this._bl, 8)\n  writeInt64BE(this._ch, this._cl, 16)\n  writeInt64BE(this._dh, this._dl, 24)\n  writeInt64BE(this._eh, this._el, 32)\n  writeInt64BE(this._fh, this._fl, 40)\n  writeInt64BE(this._gh, this._gl, 48)\n  writeInt64BE(this._hh, this._hl, 56)\n\n  return H\n}\n\nmodule.exports = Sha512\n","var Buffer = require('safe-buffer').Buffer\nvar Transform = require('stream').Transform\nvar StringDecoder = require('string_decoder').StringDecoder\nvar inherits = require('inherits')\n\nfunction CipherBase (hashMode) {\n  Transform.call(this)\n  this.hashMode = typeof hashMode === 'string'\n  if (this.hashMode) {\n    this[hashMode] = this._finalOrDigest\n  } else {\n    this.final = this._finalOrDigest\n  }\n  if (this._final) {\n    this.__final = this._final\n    this._final = null\n  }\n  this._decoder = null\n  this._encoding = null\n}\ninherits(CipherBase, Transform)\n\nCipherBase.prototype.update = function (data, inputEnc, outputEnc) {\n  if (typeof data === 'string') {\n    data = Buffer.from(data, inputEnc)\n  }\n\n  var outData = this._update(data)\n  if (this.hashMode) return this\n\n  if (outputEnc) {\n    outData = this._toString(outData, outputEnc)\n  }\n\n  return outData\n}\n\nCipherBase.prototype.setAutoPadding = function () {}\nCipherBase.prototype.getAuthTag = function () {\n  throw new Error('trying to get auth tag in unsupported state')\n}\n\nCipherBase.prototype.setAuthTag = function () {\n  throw new Error('trying to set auth tag in unsupported state')\n}\n\nCipherBase.prototype.setAAD = function () {\n  throw new Error('trying to set aad in unsupported state')\n}\n\nCipherBase.prototype._transform = function (data, _, next) {\n  var err\n  try {\n    if (this.hashMode) {\n      this._update(data)\n    } else {\n      this.push(this._update(data))\n    }\n  } catch (e) {\n    err = e\n  } finally {\n    next(err)\n  }\n}\nCipherBase.prototype._flush = function (done) {\n  var err\n  try {\n    this.push(this.__final())\n  } catch (e) {\n    err = e\n  }\n\n  done(err)\n}\nCipherBase.prototype._finalOrDigest = function (outputEnc) {\n  var outData = this.__final() || Buffer.alloc(0)\n  if (outputEnc) {\n    outData = this._toString(outData, outputEnc, true)\n  }\n  return outData\n}\n\nCipherBase.prototype._toString = function (value, enc, fin) {\n  if (!this._decoder) {\n    this._decoder = new StringDecoder(enc)\n    this._encoding = enc\n  }\n\n  if (this._encoding !== enc) throw new Error('can\\'t switch encodings')\n\n  var out = this._decoder.write(value)\n  if (fin) {\n    out += this._decoder.end()\n  }\n\n  return out\n}\n\nmodule.exports = CipherBase\n","'use strict'\nvar inherits = require('inherits')\nvar Legacy = require('./legacy')\nvar Base = require('cipher-base')\nvar Buffer = require('safe-buffer').Buffer\nvar md5 = require('create-hash/md5')\nvar RIPEMD160 = require('ripemd160')\n\nvar sha = require('sha.js')\n\nvar ZEROS = Buffer.alloc(128)\n\nfunction Hmac (alg, key) {\n  Base.call(this, 'digest')\n  if (typeof key === 'string') {\n    key = Buffer.from(key)\n  }\n\n  var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64\n\n  this._alg = alg\n  this._key = key\n  if (key.length > blocksize) {\n    var hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg)\n    key = hash.update(key).digest()\n  } else if (key.length < blocksize) {\n    key = Buffer.concat([key, ZEROS], blocksize)\n  }\n\n  var ipad = this._ipad = Buffer.allocUnsafe(blocksize)\n  var opad = this._opad = Buffer.allocUnsafe(blocksize)\n\n  for (var i = 0; i < blocksize; i++) {\n    ipad[i] = key[i] ^ 0x36\n    opad[i] = key[i] ^ 0x5C\n  }\n  this._hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg)\n  this._hash.update(ipad)\n}\n\ninherits(Hmac, Base)\n\nHmac.prototype._update = function (data) {\n  this._hash.update(data)\n}\n\nHmac.prototype._final = function () {\n  var h = this._hash.digest()\n  var hash = this._alg === 'rmd160' ? new RIPEMD160() : sha(this._alg)\n  return hash.update(this._opad).update(h).digest()\n}\n\nmodule.exports = function createHmac (alg, key) {\n  alg = alg.toLowerCase()\n  if (alg === 'rmd160' || alg === 'ripemd160') {\n    return new Hmac('rmd160', key)\n  }\n  if (alg === 'md5') {\n    return new Legacy(md5, key)\n  }\n  return new Hmac(alg, key)\n}\n","'use strict'\nvar inherits = require('inherits')\nvar Buffer = require('safe-buffer').Buffer\n\nvar Base = require('cipher-base')\n\nvar ZEROS = Buffer.alloc(128)\nvar blocksize = 64\n\nfunction Hmac (alg, key) {\n  Base.call(this, 'digest')\n  if (typeof key === 'string') {\n    key = Buffer.from(key)\n  }\n\n  this._alg = alg\n  this._key = key\n\n  if (key.length > blocksize) {\n    key = alg(key)\n  } else if (key.length < blocksize) {\n    key = Buffer.concat([key, ZEROS], blocksize)\n  }\n\n  var ipad = this._ipad = Buffer.allocUnsafe(blocksize)\n  var opad = this._opad = Buffer.allocUnsafe(blocksize)\n\n  for (var i = 0; i < blocksize; i++) {\n    ipad[i] = key[i] ^ 0x36\n    opad[i] = key[i] ^ 0x5C\n  }\n\n  this._hash = [ipad]\n}\n\ninherits(Hmac, Base)\n\nHmac.prototype._update = function (data) {\n  this._hash.push(data)\n}\n\nHmac.prototype._final = function () {\n  var h = this._alg(Buffer.concat(this._hash))\n  return this._alg(Buffer.concat([this._opad, h]))\n}\nmodule.exports = Hmac\n","var MD5 = require('md5.js')\n\nmodule.exports = function (buffer) {\n  return new MD5().update(buffer).digest()\n}\n","module.exports = require('./browser/algorithms.json')\n","exports.pbkdf2 = require('./lib/async')\nexports.pbkdf2Sync = require('./lib/sync')\n","var Buffer = require('safe-buffer').Buffer\n\nvar checkParameters = require('./precondition')\nvar defaultEncoding = require('./default-encoding')\nvar sync = require('./sync')\nvar toBuffer = require('./to-buffer')\n\nvar ZERO_BUF\nvar subtle = global.crypto && global.crypto.subtle\nvar toBrowser = {\n  sha: 'SHA-1',\n  'sha-1': 'SHA-1',\n  sha1: 'SHA-1',\n  sha256: 'SHA-256',\n  'sha-256': 'SHA-256',\n  sha384: 'SHA-384',\n  'sha-384': 'SHA-384',\n  'sha-512': 'SHA-512',\n  sha512: 'SHA-512'\n}\nvar checks = []\nfunction checkNative (algo) {\n  if (global.process && !global.process.browser) {\n    return Promise.resolve(false)\n  }\n  if (!subtle || !subtle.importKey || !subtle.deriveBits) {\n    return Promise.resolve(false)\n  }\n  if (checks[algo] !== undefined) {\n    return checks[algo]\n  }\n  ZERO_BUF = ZERO_BUF || Buffer.alloc(8)\n  var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n    .then(function () {\n      return true\n    }).catch(function () {\n      return false\n    })\n  checks[algo] = prom\n  return prom\n}\nvar nextTick\nfunction getNextTick () {\n  if (nextTick) {\n    return nextTick\n  }\n  if (global.process && global.process.nextTick) {\n    nextTick = global.process.nextTick\n  } else if (global.queueMicrotask) {\n    nextTick = global.queueMicrotask\n  } else if (global.setImmediate) {\n    nextTick = global.setImmediate\n  } else {\n    nextTick = global.setTimeout\n  }\n  return nextTick\n}\nfunction browserPbkdf2 (password, salt, iterations, length, algo) {\n  return subtle.importKey(\n    'raw', password, { name: 'PBKDF2' }, false, ['deriveBits']\n  ).then(function (key) {\n    return subtle.deriveBits({\n      name: 'PBKDF2',\n      salt: salt,\n      iterations: iterations,\n      hash: {\n        name: algo\n      }\n    }, key, length << 3)\n  }).then(function (res) {\n    return Buffer.from(res)\n  })\n}\n\nfunction resolvePromise (promise, callback) {\n  promise.then(function (out) {\n    getNextTick()(function () {\n      callback(null, out)\n    })\n  }, function (e) {\n    getNextTick()(function () {\n      callback(e)\n    })\n  })\n}\nmodule.exports = function (password, salt, iterations, keylen, digest, callback) {\n  if (typeof digest === 'function') {\n    callback = digest\n    digest = undefined\n  }\n\n  digest = digest || 'sha1'\n  var algo = toBrowser[digest.toLowerCase()]\n\n  if (!algo || typeof global.Promise !== 'function') {\n    getNextTick()(function () {\n      var out\n      try {\n        out = sync(password, salt, iterations, keylen, digest)\n      } catch (e) {\n        return callback(e)\n      }\n      callback(null, out)\n    })\n    return\n  }\n\n  checkParameters(iterations, keylen)\n  password = toBuffer(password, defaultEncoding, 'Password')\n  salt = toBuffer(salt, defaultEncoding, 'Salt')\n  if (typeof callback !== 'function') throw new Error('No callback provided to pbkdf2')\n\n  resolvePromise(checkNative(algo).then(function (resp) {\n    if (resp) return browserPbkdf2(password, salt, iterations, keylen, algo)\n\n    return sync(password, salt, iterations, keylen, digest)\n  }), callback)\n}\n","var MAX_ALLOC = Math.pow(2, 30) - 1 // default in iojs\n\nmodule.exports = function (iterations, keylen) {\n  if (typeof iterations !== 'number') {\n    throw new TypeError('Iterations not a number')\n  }\n\n  if (iterations < 0) {\n    throw new TypeError('Bad iterations')\n  }\n\n  if (typeof keylen !== 'number') {\n    throw new TypeError('Key length not a number')\n  }\n\n  if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) { /* eslint no-self-compare: 0 */\n    throw new TypeError('Bad key length')\n  }\n}\n","var defaultEncoding\n/* istanbul ignore next */\nif (global.process && global.process.browser) {\n  defaultEncoding = 'utf-8'\n} else if (global.process && global.process.version) {\n  var pVersionMajor = parseInt(process.version.split('.')[0].slice(1), 10)\n\n  defaultEncoding = pVersionMajor >= 6 ? 'utf-8' : 'binary'\n} else {\n  defaultEncoding = 'utf-8'\n}\nmodule.exports = defaultEncoding\n","var md5 = require('create-hash/md5')\nvar RIPEMD160 = require('ripemd160')\nvar sha = require('sha.js')\nvar Buffer = require('safe-buffer').Buffer\n\nvar checkParameters = require('./precondition')\nvar defaultEncoding = require('./default-encoding')\nvar toBuffer = require('./to-buffer')\n\nvar ZEROS = Buffer.alloc(128)\nvar sizes = {\n  md5: 16,\n  sha1: 20,\n  sha224: 28,\n  sha256: 32,\n  sha384: 48,\n  sha512: 64,\n  rmd160: 20,\n  ripemd160: 20\n}\n\nfunction Hmac (alg, key, saltLen) {\n  var hash = getDigest(alg)\n  var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64\n\n  if (key.length > blocksize) {\n    key = hash(key)\n  } else if (key.length < blocksize) {\n    key = Buffer.concat([key, ZEROS], blocksize)\n  }\n\n  var ipad = Buffer.allocUnsafe(blocksize + sizes[alg])\n  var opad = Buffer.allocUnsafe(blocksize + sizes[alg])\n  for (var i = 0; i < blocksize; i++) {\n    ipad[i] = key[i] ^ 0x36\n    opad[i] = key[i] ^ 0x5C\n  }\n\n  var ipad1 = Buffer.allocUnsafe(blocksize + saltLen + 4)\n  ipad.copy(ipad1, 0, 0, blocksize)\n  this.ipad1 = ipad1\n  this.ipad2 = ipad\n  this.opad = opad\n  this.alg = alg\n  this.blocksize = blocksize\n  this.hash = hash\n  this.size = sizes[alg]\n}\n\nHmac.prototype.run = function (data, ipad) {\n  data.copy(ipad, this.blocksize)\n  var h = this.hash(ipad)\n  h.copy(this.opad, this.blocksize)\n  return this.hash(this.opad)\n}\n\nfunction getDigest (alg) {\n  function shaFunc (data) {\n    return sha(alg).update(data).digest()\n  }\n  function rmd160Func (data) {\n    return new RIPEMD160().update(data).digest()\n  }\n\n  if (alg === 'rmd160' || alg === 'ripemd160') return rmd160Func\n  if (alg === 'md5') return md5\n  return shaFunc\n}\n\nfunction pbkdf2 (password, salt, iterations, keylen, digest) {\n  checkParameters(iterations, keylen)\n  password = toBuffer(password, defaultEncoding, 'Password')\n  salt = toBuffer(salt, defaultEncoding, 'Salt')\n\n  digest = digest || 'sha1'\n\n  var hmac = new Hmac(digest, password, salt.length)\n\n  var DK = Buffer.allocUnsafe(keylen)\n  var block1 = Buffer.allocUnsafe(salt.length + 4)\n  salt.copy(block1, 0, 0, salt.length)\n\n  var destPos = 0\n  var hLen = sizes[digest]\n  var l = Math.ceil(keylen / hLen)\n\n  for (var i = 1; i <= l; i++) {\n    block1.writeUInt32BE(i, salt.length)\n\n    var T = hmac.run(block1, hmac.ipad1)\n    var U = T\n\n    for (var j = 1; j < iterations; j++) {\n      U = hmac.run(U, hmac.ipad2)\n      for (var k = 0; k < hLen; k++) T[k] ^= U[k]\n    }\n\n    T.copy(DK, destPos)\n    destPos += hLen\n  }\n\n  return DK\n}\n\nmodule.exports = pbkdf2\n","var Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (thing, encoding, name) {\n  if (Buffer.isBuffer(thing)) {\n    return thing\n  } else if (typeof thing === 'string') {\n    return Buffer.from(thing, encoding)\n  } else if (ArrayBuffer.isView(thing)) {\n    return Buffer.from(thing.buffer)\n  } else {\n    throw new TypeError(name + ' must be a string, a Buffer, a typed array or a DataView')\n  }\n}\n","var DES = require('browserify-des')\nvar aes = require('browserify-aes/browser')\nvar aesModes = require('browserify-aes/modes')\nvar desModes = require('browserify-des/modes')\nvar ebtk = require('evp_bytestokey')\n\nfunction createCipher (suite, password) {\n  suite = suite.toLowerCase()\n\n  var keyLen, ivLen\n  if (aesModes[suite]) {\n    keyLen = aesModes[suite].key\n    ivLen = aesModes[suite].iv\n  } else if (desModes[suite]) {\n    keyLen = desModes[suite].key * 8\n    ivLen = desModes[suite].iv\n  } else {\n    throw new TypeError('invalid suite type')\n  }\n\n  var keys = ebtk(password, false, keyLen, ivLen)\n  return createCipheriv(suite, keys.key, keys.iv)\n}\n\nfunction createDecipher (suite, password) {\n  suite = suite.toLowerCase()\n\n  var keyLen, ivLen\n  if (aesModes[suite]) {\n    keyLen = aesModes[suite].key\n    ivLen = aesModes[suite].iv\n  } else if (desModes[suite]) {\n    keyLen = desModes[suite].key * 8\n    ivLen = desModes[suite].iv\n  } else {\n    throw new TypeError('invalid suite type')\n  }\n\n  var keys = ebtk(password, false, keyLen, ivLen)\n  return createDecipheriv(suite, keys.key, keys.iv)\n}\n\nfunction createCipheriv (suite, key, iv) {\n  suite = suite.toLowerCase()\n  if (aesModes[suite]) return aes.createCipheriv(suite, key, iv)\n  if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite })\n\n  throw new TypeError('invalid suite type')\n}\n\nfunction createDecipheriv (suite, key, iv) {\n  suite = suite.toLowerCase()\n  if (aesModes[suite]) return aes.createDecipheriv(suite, key, iv)\n  if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite, decrypt: true })\n\n  throw new TypeError('invalid suite type')\n}\n\nfunction getCiphers () {\n  return Object.keys(desModes).concat(aes.getCiphers())\n}\n\nexports.createCipher = exports.Cipher = createCipher\nexports.createCipheriv = exports.Cipheriv = createCipheriv\nexports.createDecipher = exports.Decipher = createDecipher\nexports.createDecipheriv = exports.Decipheriv = createDecipheriv\nexports.listCiphers = exports.getCiphers = getCiphers\n","var CipherBase = require('cipher-base')\nvar des = require('des.js')\nvar inherits = require('inherits')\nvar Buffer = require('safe-buffer').Buffer\n\nvar modes = {\n  'des-ede3-cbc': des.CBC.instantiate(des.EDE),\n  'des-ede3': des.EDE,\n  'des-ede-cbc': des.CBC.instantiate(des.EDE),\n  'des-ede': des.EDE,\n  'des-cbc': des.CBC.instantiate(des.DES),\n  'des-ecb': des.DES\n}\nmodes.des = modes['des-cbc']\nmodes.des3 = modes['des-ede3-cbc']\nmodule.exports = DES\ninherits(DES, CipherBase)\nfunction DES (opts) {\n  CipherBase.call(this)\n  var modeName = opts.mode.toLowerCase()\n  var mode = modes[modeName]\n  var type\n  if (opts.decrypt) {\n    type = 'decrypt'\n  } else {\n    type = 'encrypt'\n  }\n  var key = opts.key\n  if (!Buffer.isBuffer(key)) {\n    key = Buffer.from(key)\n  }\n  if (modeName === 'des-ede' || modeName === 'des-ede-cbc') {\n    key = Buffer.concat([key, key.slice(0, 8)])\n  }\n  var iv = opts.iv\n  if (!Buffer.isBuffer(iv)) {\n    iv = Buffer.from(iv)\n  }\n  this._des = mode.create({\n    key: key,\n    iv: iv,\n    type: type\n  })\n}\nDES.prototype._update = function (data) {\n  return Buffer.from(this._des.update(data))\n}\nDES.prototype._final = function () {\n  return Buffer.from(this._des.final())\n}\n","'use strict';\n\nexports.utils = require('./des/utils');\nexports.Cipher = require('./des/cipher');\nexports.DES = require('./des/des');\nexports.CBC = require('./des/cbc');\nexports.EDE = require('./des/ede');\n","'use strict';\n\nexports.readUInt32BE = function readUInt32BE(bytes, off) {\n  var res =  (bytes[0 + off] << 24) |\n             (bytes[1 + off] << 16) |\n             (bytes[2 + off] << 8) |\n             bytes[3 + off];\n  return res >>> 0;\n};\n\nexports.writeUInt32BE = function writeUInt32BE(bytes, value, off) {\n  bytes[0 + off] = value >>> 24;\n  bytes[1 + off] = (value >>> 16) & 0xff;\n  bytes[2 + off] = (value >>> 8) & 0xff;\n  bytes[3 + off] = value & 0xff;\n};\n\nexports.ip = function ip(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  for (var i = 6; i >= 0; i -= 2) {\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inR >>> (j + i)) & 1;\n    }\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inL >>> (j + i)) & 1;\n    }\n  }\n\n  for (var i = 6; i >= 0; i -= 2) {\n    for (var j = 1; j <= 25; j += 8) {\n      outR <<= 1;\n      outR |= (inR >>> (j + i)) & 1;\n    }\n    for (var j = 1; j <= 25; j += 8) {\n      outR <<= 1;\n      outR |= (inL >>> (j + i)) & 1;\n    }\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.rip = function rip(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  for (var i = 0; i < 4; i++) {\n    for (var j = 24; j >= 0; j -= 8) {\n      outL <<= 1;\n      outL |= (inR >>> (j + i)) & 1;\n      outL <<= 1;\n      outL |= (inL >>> (j + i)) & 1;\n    }\n  }\n  for (var i = 4; i < 8; i++) {\n    for (var j = 24; j >= 0; j -= 8) {\n      outR <<= 1;\n      outR |= (inR >>> (j + i)) & 1;\n      outR <<= 1;\n      outR |= (inL >>> (j + i)) & 1;\n    }\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.pc1 = function pc1(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  // 7, 15, 23, 31, 39, 47, 55, 63\n  // 6, 14, 22, 30, 39, 47, 55, 63\n  // 5, 13, 21, 29, 39, 47, 55, 63\n  // 4, 12, 20, 28\n  for (var i = 7; i >= 5; i--) {\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inR >> (j + i)) & 1;\n    }\n    for (var j = 0; j <= 24; j += 8) {\n      outL <<= 1;\n      outL |= (inL >> (j + i)) & 1;\n    }\n  }\n  for (var j = 0; j <= 24; j += 8) {\n    outL <<= 1;\n    outL |= (inR >> (j + i)) & 1;\n  }\n\n  // 1, 9, 17, 25, 33, 41, 49, 57\n  // 2, 10, 18, 26, 34, 42, 50, 58\n  // 3, 11, 19, 27, 35, 43, 51, 59\n  // 36, 44, 52, 60\n  for (var i = 1; i <= 3; i++) {\n    for (var j = 0; j <= 24; j += 8) {\n      outR <<= 1;\n      outR |= (inR >> (j + i)) & 1;\n    }\n    for (var j = 0; j <= 24; j += 8) {\n      outR <<= 1;\n      outR |= (inL >> (j + i)) & 1;\n    }\n  }\n  for (var j = 0; j <= 24; j += 8) {\n    outR <<= 1;\n    outR |= (inL >> (j + i)) & 1;\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.r28shl = function r28shl(num, shift) {\n  return ((num << shift) & 0xfffffff) | (num >>> (28 - shift));\n};\n\nvar pc2table = [\n  // inL => outL\n  14, 11, 17, 4, 27, 23, 25, 0,\n  13, 22, 7, 18, 5, 9, 16, 24,\n  2, 20, 12, 21, 1, 8, 15, 26,\n\n  // inR => outR\n  15, 4, 25, 19, 9, 1, 26, 16,\n  5, 11, 23, 8, 12, 7, 17, 0,\n  22, 3, 10, 14, 6, 20, 27, 24\n];\n\nexports.pc2 = function pc2(inL, inR, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  var len = pc2table.length >>> 1;\n  for (var i = 0; i < len; i++) {\n    outL <<= 1;\n    outL |= (inL >>> pc2table[i]) & 0x1;\n  }\n  for (var i = len; i < pc2table.length; i++) {\n    outR <<= 1;\n    outR |= (inR >>> pc2table[i]) & 0x1;\n  }\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nexports.expand = function expand(r, out, off) {\n  var outL = 0;\n  var outR = 0;\n\n  outL = ((r & 1) << 5) | (r >>> 27);\n  for (var i = 23; i >= 15; i -= 4) {\n    outL <<= 6;\n    outL |= (r >>> i) & 0x3f;\n  }\n  for (var i = 11; i >= 3; i -= 4) {\n    outR |= (r >>> i) & 0x3f;\n    outR <<= 6;\n  }\n  outR |= ((r & 0x1f) << 1) | (r >>> 31);\n\n  out[off + 0] = outL >>> 0;\n  out[off + 1] = outR >>> 0;\n};\n\nvar sTable = [\n  14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1,\n  3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8,\n  4, 15, 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7,\n  15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13,\n\n  15, 3, 1, 13, 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14,\n  9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5,\n  0, 13, 14, 8, 7, 10, 11, 1, 10, 3, 4, 15, 13, 4, 1, 2,\n  5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9,\n\n  10, 13, 0, 7, 9, 0, 14, 9, 6, 3, 3, 4, 15, 6, 5, 10,\n  1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1,\n  13, 1, 6, 10, 4, 13, 9, 0, 8, 6, 15, 9, 3, 8, 0, 7,\n  11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12,\n\n  7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6, 15, 9, 0, 10, 3,\n  1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9,\n  10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7, 13, 13, 8,\n  15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14,\n\n  2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13, 6, 1,\n  8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6,\n  4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n  15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3,\n\n  12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5,\n  0, 6, 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8,\n  9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10,\n  7, 11, 0, 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13,\n\n  4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10,\n  3, 14, 12, 3, 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6,\n  1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7,\n  10, 9, 15, 5, 6, 0, 8, 15, 0, 14, 5, 2, 9, 3, 2, 12,\n\n  13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4,\n  10, 12, 9, 5, 3, 6, 14, 11, 5, 0, 0, 14, 12, 9, 7, 2,\n  7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13,\n  0, 15, 6, 12, 10, 9, 13, 0, 15, 3, 3, 5, 5, 6, 8, 11\n];\n\nexports.substitute = function substitute(inL, inR) {\n  var out = 0;\n  for (var i = 0; i < 4; i++) {\n    var b = (inL >>> (18 - i * 6)) & 0x3f;\n    var sb = sTable[i * 0x40 + b];\n\n    out <<= 4;\n    out |= sb;\n  }\n  for (var i = 0; i < 4; i++) {\n    var b = (inR >>> (18 - i * 6)) & 0x3f;\n    var sb = sTable[4 * 0x40 + i * 0x40 + b];\n\n    out <<= 4;\n    out |= sb;\n  }\n  return out >>> 0;\n};\n\nvar permuteTable = [\n  16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22,\n  30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28, 7\n];\n\nexports.permute = function permute(num) {\n  var out = 0;\n  for (var i = 0; i < permuteTable.length; i++) {\n    out <<= 1;\n    out |= (num >>> permuteTable[i]) & 0x1;\n  }\n  return out >>> 0;\n};\n\nexports.padSplit = function padSplit(num, size, group) {\n  var str = num.toString(2);\n  while (str.length < size)\n    str = '0' + str;\n\n  var out = [];\n  for (var i = 0; i < size; i += group)\n    out.push(str.slice(i, i + group));\n  return out.join(' ');\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\n\nfunction Cipher(options) {\n  this.options = options;\n\n  this.type = this.options.type;\n  this.blockSize = 8;\n  this._init();\n\n  this.buffer = new Array(this.blockSize);\n  this.bufferOff = 0;\n}\nmodule.exports = Cipher;\n\nCipher.prototype._init = function _init() {\n  // Might be overrided\n};\n\nCipher.prototype.update = function update(data) {\n  if (data.length === 0)\n    return [];\n\n  if (this.type === 'decrypt')\n    return this._updateDecrypt(data);\n  else\n    return this._updateEncrypt(data);\n};\n\nCipher.prototype._buffer = function _buffer(data, off) {\n  // Append data to buffer\n  var min = Math.min(this.buffer.length - this.bufferOff, data.length - off);\n  for (var i = 0; i < min; i++)\n    this.buffer[this.bufferOff + i] = data[off + i];\n  this.bufferOff += min;\n\n  // Shift next\n  return min;\n};\n\nCipher.prototype._flushBuffer = function _flushBuffer(out, off) {\n  this._update(this.buffer, 0, out, off);\n  this.bufferOff = 0;\n  return this.blockSize;\n};\n\nCipher.prototype._updateEncrypt = function _updateEncrypt(data) {\n  var inputOff = 0;\n  var outputOff = 0;\n\n  var count = ((this.bufferOff + data.length) / this.blockSize) | 0;\n  var out = new Array(count * this.blockSize);\n\n  if (this.bufferOff !== 0) {\n    inputOff += this._buffer(data, inputOff);\n\n    if (this.bufferOff === this.buffer.length)\n      outputOff += this._flushBuffer(out, outputOff);\n  }\n\n  // Write blocks\n  var max = data.length - ((data.length - inputOff) % this.blockSize);\n  for (; inputOff < max; inputOff += this.blockSize) {\n    this._update(data, inputOff, out, outputOff);\n    outputOff += this.blockSize;\n  }\n\n  // Queue rest\n  for (; inputOff < data.length; inputOff++, this.bufferOff++)\n    this.buffer[this.bufferOff] = data[inputOff];\n\n  return out;\n};\n\nCipher.prototype._updateDecrypt = function _updateDecrypt(data) {\n  var inputOff = 0;\n  var outputOff = 0;\n\n  var count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1;\n  var out = new Array(count * this.blockSize);\n\n  // TODO(indutny): optimize it, this is far from optimal\n  for (; count > 0; count--) {\n    inputOff += this._buffer(data, inputOff);\n    outputOff += this._flushBuffer(out, outputOff);\n  }\n\n  // Buffer rest of the input\n  inputOff += this._buffer(data, inputOff);\n\n  return out;\n};\n\nCipher.prototype.final = function final(buffer) {\n  var first;\n  if (buffer)\n    first = this.update(buffer);\n\n  var last;\n  if (this.type === 'encrypt')\n    last = this._finalEncrypt();\n  else\n    last = this._finalDecrypt();\n\n  if (first)\n    return first.concat(last);\n  else\n    return last;\n};\n\nCipher.prototype._pad = function _pad(buffer, off) {\n  if (off === 0)\n    return false;\n\n  while (off < buffer.length)\n    buffer[off++] = 0;\n\n  return true;\n};\n\nCipher.prototype._finalEncrypt = function _finalEncrypt() {\n  if (!this._pad(this.buffer, this.bufferOff))\n    return [];\n\n  var out = new Array(this.blockSize);\n  this._update(this.buffer, 0, out, 0);\n  return out;\n};\n\nCipher.prototype._unpad = function _unpad(buffer) {\n  return buffer;\n};\n\nCipher.prototype._finalDecrypt = function _finalDecrypt() {\n  assert.equal(this.bufferOff, this.blockSize, 'Not enough data to decrypt');\n  var out = new Array(this.blockSize);\n  this._flushBuffer(out, 0);\n\n  return this._unpad(out);\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar utils = require('./utils');\nvar Cipher = require('./cipher');\n\nfunction DESState() {\n  this.tmp = new Array(2);\n  this.keys = null;\n}\n\nfunction DES(options) {\n  Cipher.call(this, options);\n\n  var state = new DESState();\n  this._desState = state;\n\n  this.deriveKeys(state, options.key);\n}\ninherits(DES, Cipher);\nmodule.exports = DES;\n\nDES.create = function create(options) {\n  return new DES(options);\n};\n\nvar shiftTable = [\n  1, 1, 2, 2, 2, 2, 2, 2,\n  1, 2, 2, 2, 2, 2, 2, 1\n];\n\nDES.prototype.deriveKeys = function deriveKeys(state, key) {\n  state.keys = new Array(16 * 2);\n\n  assert.equal(key.length, this.blockSize, 'Invalid key length');\n\n  var kL = utils.readUInt32BE(key, 0);\n  var kR = utils.readUInt32BE(key, 4);\n\n  utils.pc1(kL, kR, state.tmp, 0);\n  kL = state.tmp[0];\n  kR = state.tmp[1];\n  for (var i = 0; i < state.keys.length; i += 2) {\n    var shift = shiftTable[i >>> 1];\n    kL = utils.r28shl(kL, shift);\n    kR = utils.r28shl(kR, shift);\n    utils.pc2(kL, kR, state.keys, i);\n  }\n};\n\nDES.prototype._update = function _update(inp, inOff, out, outOff) {\n  var state = this._desState;\n\n  var l = utils.readUInt32BE(inp, inOff);\n  var r = utils.readUInt32BE(inp, inOff + 4);\n\n  // Initial Permutation\n  utils.ip(l, r, state.tmp, 0);\n  l = state.tmp[0];\n  r = state.tmp[1];\n\n  if (this.type === 'encrypt')\n    this._encrypt(state, l, r, state.tmp, 0);\n  else\n    this._decrypt(state, l, r, state.tmp, 0);\n\n  l = state.tmp[0];\n  r = state.tmp[1];\n\n  utils.writeUInt32BE(out, l, outOff);\n  utils.writeUInt32BE(out, r, outOff + 4);\n};\n\nDES.prototype._pad = function _pad(buffer, off) {\n  var value = buffer.length - off;\n  for (var i = off; i < buffer.length; i++)\n    buffer[i] = value;\n\n  return true;\n};\n\nDES.prototype._unpad = function _unpad(buffer) {\n  var pad = buffer[buffer.length - 1];\n  for (var i = buffer.length - pad; i < buffer.length; i++)\n    assert.equal(buffer[i], pad);\n\n  return buffer.slice(0, buffer.length - pad);\n};\n\nDES.prototype._encrypt = function _encrypt(state, lStart, rStart, out, off) {\n  var l = lStart;\n  var r = rStart;\n\n  // Apply f() x16 times\n  for (var i = 0; i < state.keys.length; i += 2) {\n    var keyL = state.keys[i];\n    var keyR = state.keys[i + 1];\n\n    // f(r, k)\n    utils.expand(r, state.tmp, 0);\n\n    keyL ^= state.tmp[0];\n    keyR ^= state.tmp[1];\n    var s = utils.substitute(keyL, keyR);\n    var f = utils.permute(s);\n\n    var t = r;\n    r = (l ^ f) >>> 0;\n    l = t;\n  }\n\n  // Reverse Initial Permutation\n  utils.rip(r, l, out, off);\n};\n\nDES.prototype._decrypt = function _decrypt(state, lStart, rStart, out, off) {\n  var l = rStart;\n  var r = lStart;\n\n  // Apply f() x16 times\n  for (var i = state.keys.length - 2; i >= 0; i -= 2) {\n    var keyL = state.keys[i];\n    var keyR = state.keys[i + 1];\n\n    // f(r, k)\n    utils.expand(l, state.tmp, 0);\n\n    keyL ^= state.tmp[0];\n    keyR ^= state.tmp[1];\n    var s = utils.substitute(keyL, keyR);\n    var f = utils.permute(s);\n\n    var t = l;\n    l = (r ^ f) >>> 0;\n    r = t;\n  }\n\n  // Reverse Initial Permutation\n  utils.rip(l, r, out, off);\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar proto = {};\n\nfunction CBCState(iv) {\n  assert.equal(iv.length, 8, 'Invalid IV length');\n\n  this.iv = new Array(8);\n  for (var i = 0; i < this.iv.length; i++)\n    this.iv[i] = iv[i];\n}\n\nfunction instantiate(Base) {\n  function CBC(options) {\n    Base.call(this, options);\n    this._cbcInit();\n  }\n  inherits(CBC, Base);\n\n  var keys = Object.keys(proto);\n  for (var i = 0; i < keys.length; i++) {\n    var key = keys[i];\n    CBC.prototype[key] = proto[key];\n  }\n\n  CBC.create = function create(options) {\n    return new CBC(options);\n  };\n\n  return CBC;\n}\n\nexports.instantiate = instantiate;\n\nproto._cbcInit = function _cbcInit() {\n  var state = new CBCState(this.options.iv);\n  this._cbcState = state;\n};\n\nproto._update = function _update(inp, inOff, out, outOff) {\n  var state = this._cbcState;\n  var superProto = this.constructor.super_.prototype;\n\n  var iv = state.iv;\n  if (this.type === 'encrypt') {\n    for (var i = 0; i < this.blockSize; i++)\n      iv[i] ^= inp[inOff + i];\n\n    superProto._update.call(this, iv, 0, out, outOff);\n\n    for (var i = 0; i < this.blockSize; i++)\n      iv[i] = out[outOff + i];\n  } else {\n    superProto._update.call(this, inp, inOff, out, outOff);\n\n    for (var i = 0; i < this.blockSize; i++)\n      out[outOff + i] ^= iv[i];\n\n    for (var i = 0; i < this.blockSize; i++)\n      iv[i] = inp[inOff + i];\n  }\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar Cipher = require('./cipher');\nvar DES = require('./des');\n\nfunction EDEState(type, key) {\n  assert.equal(key.length, 24, 'Invalid key length');\n\n  var k1 = key.slice(0, 8);\n  var k2 = key.slice(8, 16);\n  var k3 = key.slice(16, 24);\n\n  if (type === 'encrypt') {\n    this.ciphers = [\n      DES.create({ type: 'encrypt', key: k1 }),\n      DES.create({ type: 'decrypt', key: k2 }),\n      DES.create({ type: 'encrypt', key: k3 })\n    ];\n  } else {\n    this.ciphers = [\n      DES.create({ type: 'decrypt', key: k3 }),\n      DES.create({ type: 'encrypt', key: k2 }),\n      DES.create({ type: 'decrypt', key: k1 })\n    ];\n  }\n}\n\nfunction EDE(options) {\n  Cipher.call(this, options);\n\n  var state = new EDEState(this.type, this.options.key);\n  this._edeState = state;\n}\ninherits(EDE, Cipher);\n\nmodule.exports = EDE;\n\nEDE.create = function create(options) {\n  return new EDE(options);\n};\n\nEDE.prototype._update = function _update(inp, inOff, out, outOff) {\n  var state = this._edeState;\n\n  state.ciphers[0]._update(inp, inOff, out, outOff);\n  state.ciphers[1]._update(out, outOff, out, outOff);\n  state.ciphers[2]._update(out, outOff, out, outOff);\n};\n\nEDE.prototype._pad = DES.prototype._pad;\nEDE.prototype._unpad = DES.prototype._unpad;\n","var ciphers = require('./encrypter')\nvar deciphers = require('./decrypter')\nvar modes = require('./modes/list.json')\n\nfunction getCiphers () {\n  return Object.keys(modes)\n}\n\nexports.createCipher = exports.Cipher = ciphers.createCipher\nexports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv\nexports.createDecipher = exports.Decipher = deciphers.createDecipher\nexports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv\nexports.listCiphers = exports.getCiphers = getCiphers\n","var MODES = require('./modes')\nvar AuthCipher = require('./authCipher')\nvar Buffer = require('safe-buffer').Buffer\nvar StreamCipher = require('./streamCipher')\nvar Transform = require('cipher-base')\nvar aes = require('./aes')\nvar ebtk = require('evp_bytestokey')\nvar inherits = require('inherits')\n\nfunction Cipher (mode, key, iv) {\n  Transform.call(this)\n\n  this._cache = new Splitter()\n  this._cipher = new aes.AES(key)\n  this._prev = Buffer.from(iv)\n  this._mode = mode\n  this._autopadding = true\n}\n\ninherits(Cipher, Transform)\n\nCipher.prototype._update = function (data) {\n  this._cache.add(data)\n  var chunk\n  var thing\n  var out = []\n\n  while ((chunk = this._cache.get())) {\n    thing = this._mode.encrypt(this, chunk)\n    out.push(thing)\n  }\n\n  return Buffer.concat(out)\n}\n\nvar PADDING = Buffer.alloc(16, 0x10)\n\nCipher.prototype._final = function () {\n  var chunk = this._cache.flush()\n  if (this._autopadding) {\n    chunk = this._mode.encrypt(this, chunk)\n    this._cipher.scrub()\n    return chunk\n  }\n\n  if (!chunk.equals(PADDING)) {\n    this._cipher.scrub()\n    throw new Error('data not multiple of block length')\n  }\n}\n\nCipher.prototype.setAutoPadding = function (setTo) {\n  this._autopadding = !!setTo\n  return this\n}\n\nfunction Splitter () {\n  this.cache = Buffer.allocUnsafe(0)\n}\n\nSplitter.prototype.add = function (data) {\n  this.cache = Buffer.concat([this.cache, data])\n}\n\nSplitter.prototype.get = function () {\n  if (this.cache.length > 15) {\n    var out = this.cache.slice(0, 16)\n    this.cache = this.cache.slice(16)\n    return out\n  }\n  return null\n}\n\nSplitter.prototype.flush = function () {\n  var len = 16 - this.cache.length\n  var padBuff = Buffer.allocUnsafe(len)\n\n  var i = -1\n  while (++i < len) {\n    padBuff.writeUInt8(len, i)\n  }\n\n  return Buffer.concat([this.cache, padBuff])\n}\n\nfunction createCipheriv (suite, password, iv) {\n  var config = MODES[suite.toLowerCase()]\n  if (!config) throw new TypeError('invalid suite type')\n\n  if (typeof password === 'string') password = Buffer.from(password)\n  if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)\n\n  if (typeof iv === 'string') iv = Buffer.from(iv)\n  if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)\n\n  if (config.type === 'stream') {\n    return new StreamCipher(config.module, password, iv)\n  } else if (config.type === 'auth') {\n    return new AuthCipher(config.module, password, iv)\n  }\n\n  return new Cipher(config.module, password, iv)\n}\n\nfunction createCipher (suite, password) {\n  var config = MODES[suite.toLowerCase()]\n  if (!config) throw new TypeError('invalid suite type')\n\n  var keys = ebtk(password, false, config.key, config.iv)\n  return createCipheriv(suite, keys.key, keys.iv)\n}\n\nexports.createCipheriv = createCipheriv\nexports.createCipher = createCipher\n","var modeModules = {\n  ECB: require('./ecb'),\n  CBC: require('./cbc'),\n  CFB: require('./cfb'),\n  CFB8: require('./cfb8'),\n  CFB1: require('./cfb1'),\n  OFB: require('./ofb'),\n  CTR: require('./ctr'),\n  GCM: require('./ctr')\n}\n\nvar modes = require('./list.json')\n\nfor (var key in modes) {\n  modes[key].module = modeModules[modes[key].mode]\n}\n\nmodule.exports = modes\n","exports.encrypt = function (self, block) {\n  return self._cipher.encryptBlock(block)\n}\n\nexports.decrypt = function (self, block) {\n  return self._cipher.decryptBlock(block)\n}\n","var xor = require('buffer-xor')\n\nexports.encrypt = function (self, block) {\n  var data = xor(block, self._prev)\n\n  self._prev = self._cipher.encryptBlock(data)\n  return self._prev\n}\n\nexports.decrypt = function (self, block) {\n  var pad = self._prev\n\n  self._prev = block\n  var out = self._cipher.decryptBlock(block)\n\n  return xor(out, pad)\n}\n","module.exports = function xor (a, b) {\n  var length = Math.min(a.length, b.length)\n  var buffer = new Buffer(length)\n\n  for (var i = 0; i < length; ++i) {\n    buffer[i] = a[i] ^ b[i]\n  }\n\n  return buffer\n}\n","var Buffer = require('safe-buffer').Buffer\nvar xor = require('buffer-xor')\n\nfunction encryptStart (self, data, decrypt) {\n  var len = data.length\n  var out = xor(data, self._cache)\n  self._cache = self._cache.slice(len)\n  self._prev = Buffer.concat([self._prev, decrypt ? data : out])\n  return out\n}\n\nexports.encrypt = function (self, data, decrypt) {\n  var out = Buffer.allocUnsafe(0)\n  var len\n\n  while (data.length) {\n    if (self._cache.length === 0) {\n      self._cache = self._cipher.encryptBlock(self._prev)\n      self._prev = Buffer.allocUnsafe(0)\n    }\n\n    if (self._cache.length <= data.length) {\n      len = self._cache.length\n      out = Buffer.concat([out, encryptStart(self, data.slice(0, len), decrypt)])\n      data = data.slice(len)\n    } else {\n      out = Buffer.concat([out, encryptStart(self, data, decrypt)])\n      break\n    }\n  }\n\n  return out\n}\n","var Buffer = require('safe-buffer').Buffer\n\nfunction encryptByte (self, byteParam, decrypt) {\n  var pad = self._cipher.encryptBlock(self._prev)\n  var out = pad[0] ^ byteParam\n\n  self._prev = Buffer.concat([\n    self._prev.slice(1),\n    Buffer.from([decrypt ? byteParam : out])\n  ])\n\n  return out\n}\n\nexports.encrypt = function (self, chunk, decrypt) {\n  var len = chunk.length\n  var out = Buffer.allocUnsafe(len)\n  var i = -1\n\n  while (++i < len) {\n    out[i] = encryptByte(self, chunk[i], decrypt)\n  }\n\n  return out\n}\n","var Buffer = require('safe-buffer').Buffer\n\nfunction encryptByte (self, byteParam, decrypt) {\n  var pad\n  var i = -1\n  var len = 8\n  var out = 0\n  var bit, value\n  while (++i < len) {\n    pad = self._cipher.encryptBlock(self._prev)\n    bit = (byteParam & (1 << (7 - i))) ? 0x80 : 0\n    value = pad[0] ^ bit\n    out += ((value & 0x80) >> (i % 8))\n    self._prev = shiftIn(self._prev, decrypt ? bit : value)\n  }\n  return out\n}\n\nfunction shiftIn (buffer, value) {\n  var len = buffer.length\n  var i = -1\n  var out = Buffer.allocUnsafe(buffer.length)\n  buffer = Buffer.concat([buffer, Buffer.from([value])])\n\n  while (++i < len) {\n    out[i] = buffer[i] << 1 | buffer[i + 1] >> (7)\n  }\n\n  return out\n}\n\nexports.encrypt = function (self, chunk, decrypt) {\n  var len = chunk.length\n  var out = Buffer.allocUnsafe(len)\n  var i = -1\n\n  while (++i < len) {\n    out[i] = encryptByte(self, chunk[i], decrypt)\n  }\n\n  return out\n}\n","var xor = require('buffer-xor')\n\nfunction getBlock (self) {\n  self._prev = self._cipher.encryptBlock(self._prev)\n  return self._prev\n}\n\nexports.encrypt = function (self, chunk) {\n  while (self._cache.length < chunk.length) {\n    self._cache = Buffer.concat([self._cache, getBlock(self)])\n  }\n\n  var pad = self._cache.slice(0, chunk.length)\n  self._cache = self._cache.slice(chunk.length)\n  return xor(chunk, pad)\n}\n","var xor = require('buffer-xor')\nvar Buffer = require('safe-buffer').Buffer\nvar incr32 = require('../incr32')\n\nfunction getBlock (self) {\n  var out = self._cipher.encryptBlockRaw(self._prev)\n  incr32(self._prev)\n  return out\n}\n\nvar blockSize = 16\nexports.encrypt = function (self, chunk) {\n  var chunkNum = Math.ceil(chunk.length / blockSize)\n  var start = self._cache.length\n  self._cache = Buffer.concat([\n    self._cache,\n    Buffer.allocUnsafe(chunkNum * blockSize)\n  ])\n  for (var i = 0; i < chunkNum; i++) {\n    var out = getBlock(self)\n    var offset = start + i * blockSize\n    self._cache.writeUInt32BE(out[0], offset + 0)\n    self._cache.writeUInt32BE(out[1], offset + 4)\n    self._cache.writeUInt32BE(out[2], offset + 8)\n    self._cache.writeUInt32BE(out[3], offset + 12)\n  }\n  var pad = self._cache.slice(0, chunk.length)\n  self._cache = self._cache.slice(chunk.length)\n  return xor(chunk, pad)\n}\n","function incr32 (iv) {\n  var len = iv.length\n  var item\n  while (len--) {\n    item = iv.readUInt8(len)\n    if (item === 255) {\n      iv.writeUInt8(0, len)\n    } else {\n      item++\n      iv.writeUInt8(item, len)\n      break\n    }\n  }\n}\nmodule.exports = incr32\n","var aes = require('./aes')\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('cipher-base')\nvar inherits = require('inherits')\nvar GHASH = require('./ghash')\nvar xor = require('buffer-xor')\nvar incr32 = require('./incr32')\n\nfunction xorTest (a, b) {\n  var out = 0\n  if (a.length !== b.length) out++\n\n  var len = Math.min(a.length, b.length)\n  for (var i = 0; i < len; ++i) {\n    out += (a[i] ^ b[i])\n  }\n\n  return out\n}\n\nfunction calcIv (self, iv, ck) {\n  if (iv.length === 12) {\n    self._finID = Buffer.concat([iv, Buffer.from([0, 0, 0, 1])])\n    return Buffer.concat([iv, Buffer.from([0, 0, 0, 2])])\n  }\n  var ghash = new GHASH(ck)\n  var len = iv.length\n  var toPad = len % 16\n  ghash.update(iv)\n  if (toPad) {\n    toPad = 16 - toPad\n    ghash.update(Buffer.alloc(toPad, 0))\n  }\n  ghash.update(Buffer.alloc(8, 0))\n  var ivBits = len * 8\n  var tail = Buffer.alloc(8)\n  tail.writeUIntBE(ivBits, 0, 8)\n  ghash.update(tail)\n  self._finID = ghash.state\n  var out = Buffer.from(self._finID)\n  incr32(out)\n  return out\n}\nfunction StreamCipher (mode, key, iv, decrypt) {\n  Transform.call(this)\n\n  var h = Buffer.alloc(4, 0)\n\n  this._cipher = new aes.AES(key)\n  var ck = this._cipher.encryptBlock(h)\n  this._ghash = new GHASH(ck)\n  iv = calcIv(this, iv, ck)\n\n  this._prev = Buffer.from(iv)\n  this._cache = Buffer.allocUnsafe(0)\n  this._secCache = Buffer.allocUnsafe(0)\n  this._decrypt = decrypt\n  this._alen = 0\n  this._len = 0\n  this._mode = mode\n\n  this._authTag = null\n  this._called = false\n}\n\ninherits(StreamCipher, Transform)\n\nStreamCipher.prototype._update = function (chunk) {\n  if (!this._called && this._alen) {\n    var rump = 16 - (this._alen % 16)\n    if (rump < 16) {\n      rump = Buffer.alloc(rump, 0)\n      this._ghash.update(rump)\n    }\n  }\n\n  this._called = true\n  var out = this._mode.encrypt(this, chunk)\n  if (this._decrypt) {\n    this._ghash.update(chunk)\n  } else {\n    this._ghash.update(out)\n  }\n  this._len += chunk.length\n  return out\n}\n\nStreamCipher.prototype._final = function () {\n  if (this._decrypt && !this._authTag) throw new Error('Unsupported state or unable to authenticate data')\n\n  var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID))\n  if (this._decrypt && xorTest(tag, this._authTag)) throw new Error('Unsupported state or unable to authenticate data')\n\n  this._authTag = tag\n  this._cipher.scrub()\n}\n\nStreamCipher.prototype.getAuthTag = function getAuthTag () {\n  if (this._decrypt || !Buffer.isBuffer(this._authTag)) throw new Error('Attempting to get auth tag in unsupported state')\n\n  return this._authTag\n}\n\nStreamCipher.prototype.setAuthTag = function setAuthTag (tag) {\n  if (!this._decrypt) throw new Error('Attempting to set auth tag in unsupported state')\n\n  this._authTag = tag\n}\n\nStreamCipher.prototype.setAAD = function setAAD (buf) {\n  if (this._called) throw new Error('Attempting to set AAD in unsupported state')\n\n  this._ghash.update(buf)\n  this._alen += buf.length\n}\n\nmodule.exports = StreamCipher\n","// based on the aes implimentation in triple sec\n// https://github.com/keybase/triplesec\n// which is in turn based on the one from crypto-js\n// https://code.google.com/p/crypto-js/\n\nvar Buffer = require('safe-buffer').Buffer\n\nfunction asUInt32Array (buf) {\n  if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n\n  var len = (buf.length / 4) | 0\n  var out = new Array(len)\n\n  for (var i = 0; i < len; i++) {\n    out[i] = buf.readUInt32BE(i * 4)\n  }\n\n  return out\n}\n\nfunction scrubVec (v) {\n  for (var i = 0; i < v.length; v++) {\n    v[i] = 0\n  }\n}\n\nfunction cryptBlock (M, keySchedule, SUB_MIX, SBOX, nRounds) {\n  var SUB_MIX0 = SUB_MIX[0]\n  var SUB_MIX1 = SUB_MIX[1]\n  var SUB_MIX2 = SUB_MIX[2]\n  var SUB_MIX3 = SUB_MIX[3]\n\n  var s0 = M[0] ^ keySchedule[0]\n  var s1 = M[1] ^ keySchedule[1]\n  var s2 = M[2] ^ keySchedule[2]\n  var s3 = M[3] ^ keySchedule[3]\n  var t0, t1, t2, t3\n  var ksRow = 4\n\n  for (var round = 1; round < nRounds; round++) {\n    t0 = SUB_MIX0[s0 >>> 24] ^ SUB_MIX1[(s1 >>> 16) & 0xff] ^ SUB_MIX2[(s2 >>> 8) & 0xff] ^ SUB_MIX3[s3 & 0xff] ^ keySchedule[ksRow++]\n    t1 = SUB_MIX0[s1 >>> 24] ^ SUB_MIX1[(s2 >>> 16) & 0xff] ^ SUB_MIX2[(s3 >>> 8) & 0xff] ^ SUB_MIX3[s0 & 0xff] ^ keySchedule[ksRow++]\n    t2 = SUB_MIX0[s2 >>> 24] ^ SUB_MIX1[(s3 >>> 16) & 0xff] ^ SUB_MIX2[(s0 >>> 8) & 0xff] ^ SUB_MIX3[s1 & 0xff] ^ keySchedule[ksRow++]\n    t3 = SUB_MIX0[s3 >>> 24] ^ SUB_MIX1[(s0 >>> 16) & 0xff] ^ SUB_MIX2[(s1 >>> 8) & 0xff] ^ SUB_MIX3[s2 & 0xff] ^ keySchedule[ksRow++]\n    s0 = t0\n    s1 = t1\n    s2 = t2\n    s3 = t3\n  }\n\n  t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++]\n  t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++]\n  t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++]\n  t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++]\n  t0 = t0 >>> 0\n  t1 = t1 >>> 0\n  t2 = t2 >>> 0\n  t3 = t3 >>> 0\n\n  return [t0, t1, t2, t3]\n}\n\n// AES constants\nvar RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36]\nvar G = (function () {\n  // Compute double table\n  var d = new Array(256)\n  for (var j = 0; j < 256; j++) {\n    if (j < 128) {\n      d[j] = j << 1\n    } else {\n      d[j] = (j << 1) ^ 0x11b\n    }\n  }\n\n  var SBOX = []\n  var INV_SBOX = []\n  var SUB_MIX = [[], [], [], []]\n  var INV_SUB_MIX = [[], [], [], []]\n\n  // Walk GF(2^8)\n  var x = 0\n  var xi = 0\n  for (var i = 0; i < 256; ++i) {\n    // Compute sbox\n    var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4)\n    sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63\n    SBOX[x] = sx\n    INV_SBOX[sx] = x\n\n    // Compute multiplication\n    var x2 = d[x]\n    var x4 = d[x2]\n    var x8 = d[x4]\n\n    // Compute sub bytes, mix columns tables\n    var t = (d[sx] * 0x101) ^ (sx * 0x1010100)\n    SUB_MIX[0][x] = (t << 24) | (t >>> 8)\n    SUB_MIX[1][x] = (t << 16) | (t >>> 16)\n    SUB_MIX[2][x] = (t << 8) | (t >>> 24)\n    SUB_MIX[3][x] = t\n\n    // Compute inv sub bytes, inv mix columns tables\n    t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100)\n    INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)\n    INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)\n    INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)\n    INV_SUB_MIX[3][sx] = t\n\n    if (x === 0) {\n      x = xi = 1\n    } else {\n      x = x2 ^ d[d[d[x8 ^ x2]]]\n      xi ^= d[d[xi]]\n    }\n  }\n\n  return {\n    SBOX: SBOX,\n    INV_SBOX: INV_SBOX,\n    SUB_MIX: SUB_MIX,\n    INV_SUB_MIX: INV_SUB_MIX\n  }\n})()\n\nfunction AES (key) {\n  this._key = asUInt32Array(key)\n  this._reset()\n}\n\nAES.blockSize = 4 * 4\nAES.keySize = 256 / 8\nAES.prototype.blockSize = AES.blockSize\nAES.prototype.keySize = AES.keySize\nAES.prototype._reset = function () {\n  var keyWords = this._key\n  var keySize = keyWords.length\n  var nRounds = keySize + 6\n  var ksRows = (nRounds + 1) * 4\n\n  var keySchedule = []\n  for (var k = 0; k < keySize; k++) {\n    keySchedule[k] = keyWords[k]\n  }\n\n  for (k = keySize; k < ksRows; k++) {\n    var t = keySchedule[k - 1]\n\n    if (k % keySize === 0) {\n      t = (t << 8) | (t >>> 24)\n      t =\n        (G.SBOX[t >>> 24] << 24) |\n        (G.SBOX[(t >>> 16) & 0xff] << 16) |\n        (G.SBOX[(t >>> 8) & 0xff] << 8) |\n        (G.SBOX[t & 0xff])\n\n      t ^= RCON[(k / keySize) | 0] << 24\n    } else if (keySize > 6 && k % keySize === 4) {\n      t =\n        (G.SBOX[t >>> 24] << 24) |\n        (G.SBOX[(t >>> 16) & 0xff] << 16) |\n        (G.SBOX[(t >>> 8) & 0xff] << 8) |\n        (G.SBOX[t & 0xff])\n    }\n\n    keySchedule[k] = keySchedule[k - keySize] ^ t\n  }\n\n  var invKeySchedule = []\n  for (var ik = 0; ik < ksRows; ik++) {\n    var ksR = ksRows - ik\n    var tt = keySchedule[ksR - (ik % 4 ? 0 : 4)]\n\n    if (ik < 4 || ksR <= 4) {\n      invKeySchedule[ik] = tt\n    } else {\n      invKeySchedule[ik] =\n        G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^\n        G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 0xff]] ^\n        G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 0xff]] ^\n        G.INV_SUB_MIX[3][G.SBOX[tt & 0xff]]\n    }\n  }\n\n  this._nRounds = nRounds\n  this._keySchedule = keySchedule\n  this._invKeySchedule = invKeySchedule\n}\n\nAES.prototype.encryptBlockRaw = function (M) {\n  M = asUInt32Array(M)\n  return cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds)\n}\n\nAES.prototype.encryptBlock = function (M) {\n  var out = this.encryptBlockRaw(M)\n  var buf = Buffer.allocUnsafe(16)\n  buf.writeUInt32BE(out[0], 0)\n  buf.writeUInt32BE(out[1], 4)\n  buf.writeUInt32BE(out[2], 8)\n  buf.writeUInt32BE(out[3], 12)\n  return buf\n}\n\nAES.prototype.decryptBlock = function (M) {\n  M = asUInt32Array(M)\n\n  // swap\n  var m1 = M[1]\n  M[1] = M[3]\n  M[3] = m1\n\n  var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds)\n  var buf = Buffer.allocUnsafe(16)\n  buf.writeUInt32BE(out[0], 0)\n  buf.writeUInt32BE(out[3], 4)\n  buf.writeUInt32BE(out[2], 8)\n  buf.writeUInt32BE(out[1], 12)\n  return buf\n}\n\nAES.prototype.scrub = function () {\n  scrubVec(this._keySchedule)\n  scrubVec(this._invKeySchedule)\n  scrubVec(this._key)\n}\n\nmodule.exports.AES = AES\n","var Buffer = require('safe-buffer').Buffer\nvar ZEROES = Buffer.alloc(16, 0)\n\nfunction toArray (buf) {\n  return [\n    buf.readUInt32BE(0),\n    buf.readUInt32BE(4),\n    buf.readUInt32BE(8),\n    buf.readUInt32BE(12)\n  ]\n}\n\nfunction fromArray (out) {\n  var buf = Buffer.allocUnsafe(16)\n  buf.writeUInt32BE(out[0] >>> 0, 0)\n  buf.writeUInt32BE(out[1] >>> 0, 4)\n  buf.writeUInt32BE(out[2] >>> 0, 8)\n  buf.writeUInt32BE(out[3] >>> 0, 12)\n  return buf\n}\n\nfunction GHASH (key) {\n  this.h = key\n  this.state = Buffer.alloc(16, 0)\n  this.cache = Buffer.allocUnsafe(0)\n}\n\n// from http://bitwiseshiftleft.github.io/sjcl/doc/symbols/src/core_gcm.js.html\n// by Juho Vähä-Herttua\nGHASH.prototype.ghash = function (block) {\n  var i = -1\n  while (++i < block.length) {\n    this.state[i] ^= block[i]\n  }\n  this._multiply()\n}\n\nGHASH.prototype._multiply = function () {\n  var Vi = toArray(this.h)\n  var Zi = [0, 0, 0, 0]\n  var j, xi, lsbVi\n  var i = -1\n  while (++i < 128) {\n    xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0\n    if (xi) {\n      // Z_i+1 = Z_i ^ V_i\n      Zi[0] ^= Vi[0]\n      Zi[1] ^= Vi[1]\n      Zi[2] ^= Vi[2]\n      Zi[3] ^= Vi[3]\n    }\n\n    // Store the value of LSB(V_i)\n    lsbVi = (Vi[3] & 1) !== 0\n\n    // V_i+1 = V_i >> 1\n    for (j = 3; j > 0; j--) {\n      Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31)\n    }\n    Vi[0] = Vi[0] >>> 1\n\n    // If LSB(V_i) is 1, V_i+1 = (V_i >> 1) ^ R\n    if (lsbVi) {\n      Vi[0] = Vi[0] ^ (0xe1 << 24)\n    }\n  }\n  this.state = fromArray(Zi)\n}\n\nGHASH.prototype.update = function (buf) {\n  this.cache = Buffer.concat([this.cache, buf])\n  var chunk\n  while (this.cache.length >= 16) {\n    chunk = this.cache.slice(0, 16)\n    this.cache = this.cache.slice(16)\n    this.ghash(chunk)\n  }\n}\n\nGHASH.prototype.final = function (abl, bl) {\n  if (this.cache.length) {\n    this.ghash(Buffer.concat([this.cache, ZEROES], 16))\n  }\n\n  this.ghash(fromArray([0, abl, 0, bl]))\n  return this.state\n}\n\nmodule.exports = GHASH\n","var aes = require('./aes')\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('cipher-base')\nvar inherits = require('inherits')\n\nfunction StreamCipher (mode, key, iv, decrypt) {\n  Transform.call(this)\n\n  this._cipher = new aes.AES(key)\n  this._prev = Buffer.from(iv)\n  this._cache = Buffer.allocUnsafe(0)\n  this._secCache = Buffer.allocUnsafe(0)\n  this._decrypt = decrypt\n  this._mode = mode\n}\n\ninherits(StreamCipher, Transform)\n\nStreamCipher.prototype._update = function (chunk) {\n  return this._mode.encrypt(this, chunk, this._decrypt)\n}\n\nStreamCipher.prototype._final = function () {\n  this._cipher.scrub()\n}\n\nmodule.exports = StreamCipher\n","var Buffer = require('safe-buffer').Buffer\nvar MD5 = require('md5.js')\n\n/* eslint-disable camelcase */\nfunction EVP_BytesToKey (password, salt, keyBits, ivLen) {\n  if (!Buffer.isBuffer(password)) password = Buffer.from(password, 'binary')\n  if (salt) {\n    if (!Buffer.isBuffer(salt)) salt = Buffer.from(salt, 'binary')\n    if (salt.length !== 8) throw new RangeError('salt should be Buffer with 8 byte length')\n  }\n\n  var keyLen = keyBits / 8\n  var key = Buffer.alloc(keyLen)\n  var iv = Buffer.alloc(ivLen || 0)\n  var tmp = Buffer.alloc(0)\n\n  while (keyLen > 0 || ivLen > 0) {\n    var hash = new MD5()\n    hash.update(tmp)\n    hash.update(password)\n    if (salt) hash.update(salt)\n    tmp = hash.digest()\n\n    var used = 0\n\n    if (keyLen > 0) {\n      var keyStart = key.length - keyLen\n      used = Math.min(keyLen, tmp.length)\n      tmp.copy(key, keyStart, 0, used)\n      keyLen -= used\n    }\n\n    if (used < tmp.length && ivLen > 0) {\n      var ivStart = iv.length - ivLen\n      var length = Math.min(ivLen, tmp.length - used)\n      tmp.copy(iv, ivStart, used, used + length)\n      ivLen -= length\n    }\n  }\n\n  tmp.fill(0)\n  return { key: key, iv: iv }\n}\n\nmodule.exports = EVP_BytesToKey\n","var AuthCipher = require('./authCipher')\nvar Buffer = require('safe-buffer').Buffer\nvar MODES = require('./modes')\nvar StreamCipher = require('./streamCipher')\nvar Transform = require('cipher-base')\nvar aes = require('./aes')\nvar ebtk = require('evp_bytestokey')\nvar inherits = require('inherits')\n\nfunction Decipher (mode, key, iv) {\n  Transform.call(this)\n\n  this._cache = new Splitter()\n  this._last = void 0\n  this._cipher = new aes.AES(key)\n  this._prev = Buffer.from(iv)\n  this._mode = mode\n  this._autopadding = true\n}\n\ninherits(Decipher, Transform)\n\nDecipher.prototype._update = function (data) {\n  this._cache.add(data)\n  var chunk\n  var thing\n  var out = []\n  while ((chunk = this._cache.get(this._autopadding))) {\n    thing = this._mode.decrypt(this, chunk)\n    out.push(thing)\n  }\n  return Buffer.concat(out)\n}\n\nDecipher.prototype._final = function () {\n  var chunk = this._cache.flush()\n  if (this._autopadding) {\n    return unpad(this._mode.decrypt(this, chunk))\n  } else if (chunk) {\n    throw new Error('data not multiple of block length')\n  }\n}\n\nDecipher.prototype.setAutoPadding = function (setTo) {\n  this._autopadding = !!setTo\n  return this\n}\n\nfunction Splitter () {\n  this.cache = Buffer.allocUnsafe(0)\n}\n\nSplitter.prototype.add = function (data) {\n  this.cache = Buffer.concat([this.cache, data])\n}\n\nSplitter.prototype.get = function (autoPadding) {\n  var out\n  if (autoPadding) {\n    if (this.cache.length > 16) {\n      out = this.cache.slice(0, 16)\n      this.cache = this.cache.slice(16)\n      return out\n    }\n  } else {\n    if (this.cache.length >= 16) {\n      out = this.cache.slice(0, 16)\n      this.cache = this.cache.slice(16)\n      return out\n    }\n  }\n\n  return null\n}\n\nSplitter.prototype.flush = function () {\n  if (this.cache.length) return this.cache\n}\n\nfunction unpad (last) {\n  var padded = last[15]\n  if (padded < 1 || padded > 16) {\n    throw new Error('unable to decrypt data')\n  }\n  var i = -1\n  while (++i < padded) {\n    if (last[(i + (16 - padded))] !== padded) {\n      throw new Error('unable to decrypt data')\n    }\n  }\n  if (padded === 16) return\n\n  return last.slice(0, 16 - padded)\n}\n\nfunction createDecipheriv (suite, password, iv) {\n  var config = MODES[suite.toLowerCase()]\n  if (!config) throw new TypeError('invalid suite type')\n\n  if (typeof iv === 'string') iv = Buffer.from(iv)\n  if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)\n\n  if (typeof password === 'string') password = Buffer.from(password)\n  if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)\n\n  if (config.type === 'stream') {\n    return new StreamCipher(config.module, password, iv, true)\n  } else if (config.type === 'auth') {\n    return new AuthCipher(config.module, password, iv, true)\n  }\n\n  return new Decipher(config.module, password, iv)\n}\n\nfunction createDecipher (suite, password) {\n  var config = MODES[suite.toLowerCase()]\n  if (!config) throw new TypeError('invalid suite type')\n\n  var keys = ebtk(password, false, config.key, config.iv)\n  return createDecipheriv(suite, keys.key, keys.iv)\n}\n\nexports.createDecipher = createDecipher\nexports.createDecipheriv = createDecipheriv\n","exports['des-ecb'] = {\n  key: 8,\n  iv: 0\n}\nexports['des-cbc'] = exports.des = {\n  key: 8,\n  iv: 8\n}\nexports['des-ede3-cbc'] = exports.des3 = {\n  key: 24,\n  iv: 8\n}\nexports['des-ede3'] = {\n  key: 24,\n  iv: 0\n}\nexports['des-ede-cbc'] = {\n  key: 16,\n  iv: 8\n}\nexports['des-ede'] = {\n  key: 16,\n  iv: 0\n}\n","var generatePrime = require('./lib/generatePrime')\nvar primes = require('./lib/primes.json')\n\nvar DH = require('./lib/dh')\n\nfunction getDiffieHellman (mod) {\n  var prime = new Buffer(primes[mod].prime, 'hex')\n  var gen = new Buffer(primes[mod].gen, 'hex')\n\n  return new DH(prime, gen)\n}\n\nvar ENCODINGS = {\n  'binary': true, 'hex': true, 'base64': true\n}\n\nfunction createDiffieHellman (prime, enc, generator, genc) {\n  if (Buffer.isBuffer(enc) || ENCODINGS[enc] === undefined) {\n    return createDiffieHellman(prime, 'binary', enc, generator)\n  }\n\n  enc = enc || 'binary'\n  genc = genc || 'binary'\n  generator = generator || new Buffer([2])\n\n  if (!Buffer.isBuffer(generator)) {\n    generator = new Buffer(generator, genc)\n  }\n\n  if (typeof prime === 'number') {\n    return new DH(generatePrime(prime, generator), generator, true)\n  }\n\n  if (!Buffer.isBuffer(prime)) {\n    prime = new Buffer(prime, enc)\n  }\n\n  return new DH(prime, generator, true)\n}\n\nexports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman\nexports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman\n","var randomBytes = require('randombytes');\nmodule.exports = findPrime;\nfindPrime.simpleSieve = simpleSieve;\nfindPrime.fermatTest = fermatTest;\nvar BN = require('bn.js');\nvar TWENTYFOUR = new BN(24);\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar ONE = new BN(1);\nvar TWO = new BN(2);\nvar FIVE = new BN(5);\nvar SIXTEEN = new BN(16);\nvar EIGHT = new BN(8);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar ELEVEN = new BN(11);\nvar FOUR = new BN(4);\nvar TWELVE = new BN(12);\nvar primes = null;\n\nfunction _getPrimes() {\n  if (primes !== null)\n    return primes;\n\n  var limit = 0x100000;\n  var res = [];\n  res[0] = 2;\n  for (var i = 1, k = 3; k < limit; k += 2) {\n    var sqrt = Math.ceil(Math.sqrt(k));\n    for (var j = 0; j < i && res[j] <= sqrt; j++)\n      if (k % res[j] === 0)\n        break;\n\n    if (i !== j && res[j] <= sqrt)\n      continue;\n\n    res[i++] = k;\n  }\n  primes = res;\n  return res;\n}\n\nfunction simpleSieve(p) {\n  var primes = _getPrimes();\n\n  for (var i = 0; i < primes.length; i++)\n    if (p.modn(primes[i]) === 0) {\n      if (p.cmpn(primes[i]) === 0) {\n        return true;\n      } else {\n        return false;\n      }\n    }\n\n  return true;\n}\n\nfunction fermatTest(p) {\n  var red = BN.mont(p);\n  return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n}\n\nfunction findPrime(bits, gen) {\n  if (bits < 16) {\n    // this is what openssl does\n    if (gen === 2 || gen === 5) {\n      return new BN([0x8c, 0x7b]);\n    } else {\n      return new BN([0x8c, 0x27]);\n    }\n  }\n  gen = new BN(gen);\n\n  var num, n2;\n\n  while (true) {\n    num = new BN(randomBytes(Math.ceil(bits / 8)));\n    while (num.bitLength() > bits) {\n      num.ishrn(1);\n    }\n    if (num.isEven()) {\n      num.iadd(ONE);\n    }\n    if (!num.testn(1)) {\n      num.iadd(TWO);\n    }\n    if (!gen.cmp(TWO)) {\n      while (num.mod(TWENTYFOUR).cmp(ELEVEN)) {\n        num.iadd(FOUR);\n      }\n    } else if (!gen.cmp(FIVE)) {\n      while (num.mod(TEN).cmp(THREE)) {\n        num.iadd(FOUR);\n      }\n    }\n    n2 = num.shrn(1);\n    if (simpleSieve(n2) && simpleSieve(num) &&\n      fermatTest(n2) && fermatTest(num) &&\n      millerRabin.test(n2) && millerRabin.test(num)) {\n      return num;\n    }\n  }\n\n}\n","var bn = require('bn.js');\nvar brorand = require('brorand');\n\nfunction MillerRabin(rand) {\n  this.rand = rand || new brorand.Rand();\n}\nmodule.exports = MillerRabin;\n\nMillerRabin.create = function create(rand) {\n  return new MillerRabin(rand);\n};\n\nMillerRabin.prototype._randbelow = function _randbelow(n) {\n  var len = n.bitLength();\n  var min_bytes = Math.ceil(len / 8);\n\n  // Generage random bytes until a number less than n is found.\n  // This ensures that 0..n-1 have an equal probability of being selected.\n  do\n    var a = new bn(this.rand.generate(min_bytes));\n  while (a.cmp(n) >= 0);\n\n  return a;\n};\n\nMillerRabin.prototype._randrange = function _randrange(start, stop) {\n  // Generate a random number greater than or equal to start and less than stop.\n  var size = stop.sub(start);\n  return start.add(this._randbelow(size));\n};\n\nMillerRabin.prototype.test = function test(n, k, cb) {\n  var len = n.bitLength();\n  var red = bn.mont(n);\n  var rone = new bn(1).toRed(red);\n\n  if (!k)\n    k = Math.max(1, (len / 48) | 0);\n\n  // Find d and s, (n - 1) = (2 ^ s) * d;\n  var n1 = n.subn(1);\n  for (var s = 0; !n1.testn(s); s++) {}\n  var d = n.shrn(s);\n\n  var rn1 = n1.toRed(red);\n\n  var prime = true;\n  for (; k > 0; k--) {\n    var a = this._randrange(new bn(2), n1);\n    if (cb)\n      cb(a);\n\n    var x = a.toRed(red).redPow(d);\n    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n      continue;\n\n    for (var i = 1; i < s; i++) {\n      x = x.redSqr();\n\n      if (x.cmp(rone) === 0)\n        return false;\n      if (x.cmp(rn1) === 0)\n        break;\n    }\n\n    if (i === s)\n      return false;\n  }\n\n  return prime;\n};\n\nMillerRabin.prototype.getDivisor = function getDivisor(n, k) {\n  var len = n.bitLength();\n  var red = bn.mont(n);\n  var rone = new bn(1).toRed(red);\n\n  if (!k)\n    k = Math.max(1, (len / 48) | 0);\n\n  // Find d and s, (n - 1) = (2 ^ s) * d;\n  var n1 = n.subn(1);\n  for (var s = 0; !n1.testn(s); s++) {}\n  var d = n.shrn(s);\n\n  var rn1 = n1.toRed(red);\n\n  for (; k > 0; k--) {\n    var a = this._randrange(new bn(2), n1);\n\n    var g = n.gcd(a);\n    if (g.cmpn(1) !== 0)\n      return g;\n\n    var x = a.toRed(red).redPow(d);\n    if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n      continue;\n\n    for (var i = 1; i < s; i++) {\n      x = x.redSqr();\n\n      if (x.cmp(rone) === 0)\n        return x.fromRed().subn(1).gcd(n);\n      if (x.cmp(rn1) === 0)\n        break;\n    }\n\n    if (i === s) {\n      x = x.redSqr();\n      return x.fromRed().subn(1).gcd(n);\n    }\n  }\n\n  return false;\n};\n","var BN = require('bn.js');\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar TWENTYFOUR = new BN(24);\nvar ELEVEN = new BN(11);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar primes = require('./generatePrime');\nvar randomBytes = require('randombytes');\nmodule.exports = DH;\n\nfunction setPublicKey(pub, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(pub)) {\n    pub = new Buffer(pub, enc);\n  }\n  this._pub = new BN(pub);\n  return this;\n}\n\nfunction setPrivateKey(priv, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(priv)) {\n    priv = new Buffer(priv, enc);\n  }\n  this._priv = new BN(priv);\n  return this;\n}\n\nvar primeCache = {};\nfunction checkPrime(prime, generator) {\n  var gen = generator.toString('hex');\n  var hex = [gen, prime.toString(16)].join('_');\n  if (hex in primeCache) {\n    return primeCache[hex];\n  }\n  var error = 0;\n\n  if (prime.isEven() ||\n    !primes.simpleSieve ||\n    !primes.fermatTest(prime) ||\n    !millerRabin.test(prime)) {\n    //not a prime so +1\n    error += 1;\n\n    if (gen === '02' || gen === '05') {\n      // we'd be able to check the generator\n      // it would fail so +8\n      error += 8;\n    } else {\n      //we wouldn't be able to test the generator\n      // so +4\n      error += 4;\n    }\n    primeCache[hex] = error;\n    return error;\n  }\n  if (!millerRabin.test(prime.shrn(1))) {\n    //not a safe prime\n    error += 2;\n  }\n  var rem;\n  switch (gen) {\n    case '02':\n      if (prime.mod(TWENTYFOUR).cmp(ELEVEN)) {\n        // unsuidable generator\n        error += 8;\n      }\n      break;\n    case '05':\n      rem = prime.mod(TEN);\n      if (rem.cmp(THREE) && rem.cmp(SEVEN)) {\n        // prime mod 10 needs to equal 3 or 7\n        error += 8;\n      }\n      break;\n    default:\n      error += 4;\n  }\n  primeCache[hex] = error;\n  return error;\n}\n\nfunction DH(prime, generator, malleable) {\n  this.setGenerator(generator);\n  this.__prime = new BN(prime);\n  this._prime = BN.mont(this.__prime);\n  this._primeLen = prime.length;\n  this._pub = undefined;\n  this._priv = undefined;\n  this._primeCode = undefined;\n  if (malleable) {\n    this.setPublicKey = setPublicKey;\n    this.setPrivateKey = setPrivateKey;\n  } else {\n    this._primeCode = 8;\n  }\n}\nObject.defineProperty(DH.prototype, 'verifyError', {\n  enumerable: true,\n  get: function () {\n    if (typeof this._primeCode !== 'number') {\n      this._primeCode = checkPrime(this.__prime, this.__gen);\n    }\n    return this._primeCode;\n  }\n});\nDH.prototype.generateKeys = function () {\n  if (!this._priv) {\n    this._priv = new BN(randomBytes(this._primeLen));\n  }\n  this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed();\n  return this.getPublicKey();\n};\n\nDH.prototype.computeSecret = function (other) {\n  other = new BN(other);\n  other = other.toRed(this._prime);\n  var secret = other.redPow(this._priv).fromRed();\n  var out = new Buffer(secret.toArray());\n  var prime = this.getPrime();\n  if (out.length < prime.length) {\n    var front = new Buffer(prime.length - out.length);\n    front.fill(0);\n    out = Buffer.concat([front, out]);\n  }\n  return out;\n};\n\nDH.prototype.getPublicKey = function getPublicKey(enc) {\n  return formatReturnValue(this._pub, enc);\n};\n\nDH.prototype.getPrivateKey = function getPrivateKey(enc) {\n  return formatReturnValue(this._priv, enc);\n};\n\nDH.prototype.getPrime = function (enc) {\n  return formatReturnValue(this.__prime, enc);\n};\n\nDH.prototype.getGenerator = function (enc) {\n  return formatReturnValue(this._gen, enc);\n};\n\nDH.prototype.setGenerator = function (gen, enc) {\n  enc = enc || 'utf8';\n  if (!Buffer.isBuffer(gen)) {\n    gen = new Buffer(gen, enc);\n  }\n  this.__gen = gen;\n  this._gen = new BN(gen);\n  return this;\n};\n\nfunction formatReturnValue(bn, enc) {\n  var buf = new Buffer(bn.toArray());\n  if (!enc) {\n    return buf;\n  } else {\n    return buf.toString(enc);\n  }\n}\n","var Buffer = require('safe-buffer').Buffer\nvar createHash = require('create-hash')\nvar stream = require('readable-stream')\nvar inherits = require('inherits')\nvar sign = require('./sign')\nvar verify = require('./verify')\n\nvar algorithms = require('./algorithms.json')\nObject.keys(algorithms).forEach(function (key) {\n  algorithms[key].id = Buffer.from(algorithms[key].id, 'hex')\n  algorithms[key.toLowerCase()] = algorithms[key]\n})\n\nfunction Sign (algorithm) {\n  stream.Writable.call(this)\n\n  var data = algorithms[algorithm]\n  if (!data) throw new Error('Unknown message digest')\n\n  this._hashType = data.hash\n  this._hash = createHash(data.hash)\n  this._tag = data.id\n  this._signType = data.sign\n}\ninherits(Sign, stream.Writable)\n\nSign.prototype._write = function _write (data, _, done) {\n  this._hash.update(data)\n  done()\n}\n\nSign.prototype.update = function update (data, enc) {\n  if (typeof data === 'string') data = Buffer.from(data, enc)\n\n  this._hash.update(data)\n  return this\n}\n\nSign.prototype.sign = function signMethod (key, enc) {\n  this.end()\n  var hash = this._hash.digest()\n  var sig = sign(hash, key, this._hashType, this._signType, this._tag)\n\n  return enc ? sig.toString(enc) : sig\n}\n\nfunction Verify (algorithm) {\n  stream.Writable.call(this)\n\n  var data = algorithms[algorithm]\n  if (!data) throw new Error('Unknown message digest')\n\n  this._hash = createHash(data.hash)\n  this._tag = data.id\n  this._signType = data.sign\n}\ninherits(Verify, stream.Writable)\n\nVerify.prototype._write = function _write (data, _, done) {\n  this._hash.update(data)\n  done()\n}\n\nVerify.prototype.update = function update (data, enc) {\n  if (typeof data === 'string') data = Buffer.from(data, enc)\n\n  this._hash.update(data)\n  return this\n}\n\nVerify.prototype.verify = function verifyMethod (key, sig, enc) {\n  if (typeof sig === 'string') sig = Buffer.from(sig, enc)\n\n  this.end()\n  var hash = this._hash.digest()\n  return verify(sig, hash, key, this._signType, this._tag)\n}\n\nfunction createSign (algorithm) {\n  return new Sign(algorithm)\n}\n\nfunction createVerify (algorithm) {\n  return new Verify(algorithm)\n}\n\nmodule.exports = {\n  Sign: createSign,\n  Verify: createVerify,\n  createSign: createSign,\n  createVerify: createVerify\n}\n","// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('safe-buffer').Buffer\nvar createHmac = require('create-hmac')\nvar crt = require('browserify-rsa')\nvar EC = require('elliptic').ec\nvar BN = require('bn.js')\nvar parseKeys = require('parse-asn1')\nvar curves = require('./curves.json')\n\nfunction sign (hash, key, hashType, signType, tag) {\n  var priv = parseKeys(key)\n  if (priv.curve) {\n    // rsa keys can be interpreted as ecdsa ones in openssl\n    if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')\n    return ecSign(hash, priv)\n  } else if (priv.type === 'dsa') {\n    if (signType !== 'dsa') throw new Error('wrong private key type')\n    return dsaSign(hash, priv, hashType)\n  } else {\n    if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')\n  }\n  hash = Buffer.concat([tag, hash])\n  var len = priv.modulus.byteLength()\n  var pad = [0, 1]\n  while (hash.length + pad.length + 1 < len) pad.push(0xff)\n  pad.push(0x00)\n  var i = -1\n  while (++i < hash.length) pad.push(hash[i])\n\n  var out = crt(pad, priv)\n  return out\n}\n\nfunction ecSign (hash, priv) {\n  var curveId = curves[priv.curve.join('.')]\n  if (!curveId) throw new Error('unknown curve ' + priv.curve.join('.'))\n\n  var curve = new EC(curveId)\n  var key = curve.keyFromPrivate(priv.privateKey)\n  var out = key.sign(hash)\n\n  return Buffer.from(out.toDER())\n}\n\nfunction dsaSign (hash, priv, algo) {\n  var x = priv.params.priv_key\n  var p = priv.params.p\n  var q = priv.params.q\n  var g = priv.params.g\n  var r = new BN(0)\n  var k\n  var H = bits2int(hash, q).mod(q)\n  var s = false\n  var kv = getKey(x, q, hash, algo)\n  while (s === false) {\n    k = makeKey(q, kv, algo)\n    r = makeR(g, k, p, q)\n    s = k.invm(q).imul(H.add(x.mul(r))).mod(q)\n    if (s.cmpn(0) === 0) {\n      s = false\n      r = new BN(0)\n    }\n  }\n  return toDER(r, s)\n}\n\nfunction toDER (r, s) {\n  r = r.toArray()\n  s = s.toArray()\n\n  // Pad values\n  if (r[0] & 0x80) r = [0].concat(r)\n  if (s[0] & 0x80) s = [0].concat(s)\n\n  var total = r.length + s.length + 4\n  var res = [0x30, total, 0x02, r.length]\n  res = res.concat(r, [0x02, s.length], s)\n  return Buffer.from(res)\n}\n\nfunction getKey (x, q, hash, algo) {\n  x = Buffer.from(x.toArray())\n  if (x.length < q.byteLength()) {\n    var zeros = Buffer.alloc(q.byteLength() - x.length)\n    x = Buffer.concat([zeros, x])\n  }\n  var hlen = hash.length\n  var hbits = bits2octets(hash, q)\n  var v = Buffer.alloc(hlen)\n  v.fill(1)\n  var k = Buffer.alloc(hlen)\n  k = createHmac(algo, k).update(v).update(Buffer.from([0])).update(x).update(hbits).digest()\n  v = createHmac(algo, k).update(v).digest()\n  k = createHmac(algo, k).update(v).update(Buffer.from([1])).update(x).update(hbits).digest()\n  v = createHmac(algo, k).update(v).digest()\n  return { k: k, v: v }\n}\n\nfunction bits2int (obits, q) {\n  var bits = new BN(obits)\n  var shift = (obits.length << 3) - q.bitLength()\n  if (shift > 0) bits.ishrn(shift)\n  return bits\n}\n\nfunction bits2octets (bits, q) {\n  bits = bits2int(bits, q)\n  bits = bits.mod(q)\n  var out = Buffer.from(bits.toArray())\n  if (out.length < q.byteLength()) {\n    var zeros = Buffer.alloc(q.byteLength() - out.length)\n    out = Buffer.concat([zeros, out])\n  }\n  return out\n}\n\nfunction makeKey (q, kv, algo) {\n  var t\n  var k\n\n  do {\n    t = Buffer.alloc(0)\n\n    while (t.length * 8 < q.bitLength()) {\n      kv.v = createHmac(algo, kv.k).update(kv.v).digest()\n      t = Buffer.concat([t, kv.v])\n    }\n\n    k = bits2int(t, q)\n    kv.k = createHmac(algo, kv.k).update(kv.v).update(Buffer.from([0])).digest()\n    kv.v = createHmac(algo, kv.k).update(kv.v).digest()\n  } while (k.cmp(q) !== -1)\n\n  return k\n}\n\nfunction makeR (g, k, p, q) {\n  return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q)\n}\n\nmodule.exports = sign\nmodule.exports.getKey = getKey\nmodule.exports.makeKey = makeKey\n","var BN = require('bn.js')\nvar randomBytes = require('randombytes')\n\nfunction blind (priv) {\n  var r = getr(priv)\n  var blinder = r.toRed(BN.mont(priv.modulus)).redPow(new BN(priv.publicExponent)).fromRed()\n  return { blinder: blinder, unblinder: r.invm(priv.modulus) }\n}\n\nfunction getr (priv) {\n  var len = priv.modulus.byteLength()\n  var r\n  do {\n    r = new BN(randomBytes(len))\n  } while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2))\n  return r\n}\n\nfunction crt (msg, priv) {\n  var blinds = blind(priv)\n  var len = priv.modulus.byteLength()\n  var blinded = new BN(msg).mul(blinds.blinder).umod(priv.modulus)\n  var c1 = blinded.toRed(BN.mont(priv.prime1))\n  var c2 = blinded.toRed(BN.mont(priv.prime2))\n  var qinv = priv.coefficient\n  var p = priv.prime1\n  var q = priv.prime2\n  var m1 = c1.redPow(priv.exponent1).fromRed()\n  var m2 = c2.redPow(priv.exponent2).fromRed()\n  var h = m1.isub(m2).imul(qinv).umod(p).imul(q)\n  return m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, 'be', len)\n}\ncrt.getr = getr\n\nmodule.exports = crt\n","(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [number & 0x3ffffff];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [0];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this._strip();\n  };\n\n  function parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // '0' - '9'\n    if (c >= 48 && c <= 57) {\n      return c - 48;\n    // 'A' - 'F'\n    } else if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    } else {\n      assert(false, 'Invalid character in ' + string);\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\n\n    this._strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var b = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        b = c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        b = c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        b = c;\n      }\n      assert(c >= 0 && b < mul, 'Invalid character');\n      r += b;\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [0];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    this._strip();\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  function move (dest, src) {\n    dest.words = src.words;\n    dest.length = src.length;\n    dest.negative = src.negative;\n    dest.red = src.red;\n  }\n\n  BN.prototype._move = function _move (dest) {\n    move(dest, this);\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype._strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  // Check Symbol.for because not everywhere where Symbol defined\n  // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n  if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n    try {\n      BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n    } catch (e) {\n      BN.prototype.inspect = inspect;\n    }\n  } else {\n    BN.prototype.inspect = inspect;\n  }\n\n  function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  }\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modrn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16, 2);\n  };\n\n  if (Buffer) {\n    BN.prototype.toBuffer = function toBuffer (endian, length) {\n      return this.toArrayLike(Buffer, endian, length);\n    };\n  }\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  var allocate = function allocate (ArrayType, size) {\n    if (ArrayType.allocUnsafe) {\n      return ArrayType.allocUnsafe(size);\n    }\n    return new ArrayType(size);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    this._strip();\n\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    var res = allocate(ArrayType, reqLength);\n    var postfix = endian === 'le' ? 'LE' : 'BE';\n    this['_toArrayLike' + postfix](res, byteLength);\n    return res;\n  };\n\n  BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n    var position = 0;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position++] = word & 0xff;\n      if (position < res.length) {\n        res[position++] = (word >> 8) & 0xff;\n      }\n      if (position < res.length) {\n        res[position++] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position < res.length) {\n          res[position++] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position < res.length) {\n      res[position++] = carry;\n\n      while (position < res.length) {\n        res[position++] = 0;\n      }\n    }\n  };\n\n  BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n    var position = res.length - 1;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position--] = word & 0xff;\n      if (position >= 0) {\n        res[position--] = (word >> 8) & 0xff;\n      }\n      if (position >= 0) {\n        res[position--] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position >= 0) {\n          res[position--] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position >= 0) {\n      res[position--] = carry;\n\n      while (position >= 0) {\n        res[position--] = 0;\n      }\n    }\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] >>> wbit) & 0x01;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this._strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this._strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this._strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n    // var fftm = new FFTM();\n    // return fftm.mulp(self, num, out);\n    return bigMulTo(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out._strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this._strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) <= num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this._strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this._strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q._strip();\n    }\n    a._strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modrn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modrn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modrn = function modrn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return isNegNum ? -acc : acc;\n  };\n\n  // WARNING: DEPRECATED\n  BN.prototype.modn = function modn (num) {\n    return this.modrn(num);\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    this._strip();\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this._strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is a BN v4 instance\n        r.strip();\n      } else {\n        // r is a BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\n    move(a, a.umod(this.m)._forceRed(this));\n    return a;\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","(function (module, exports) {\n  'use strict';\n\n  // Utils\n  function assert (val, msg) {\n    if (!val) throw new Error(msg || 'Assertion failed');\n  }\n\n  // Could use `inherits` module, but don't want to move from single file\n  // architecture yet.\n  function inherits (ctor, superCtor) {\n    ctor.super_ = superCtor;\n    var TempCtor = function () {};\n    TempCtor.prototype = superCtor.prototype;\n    ctor.prototype = new TempCtor();\n    ctor.prototype.constructor = ctor;\n  }\n\n  // BN\n\n  function BN (number, base, endian) {\n    if (BN.isBN(number)) {\n      return number;\n    }\n\n    this.negative = 0;\n    this.words = null;\n    this.length = 0;\n\n    // Reduction context\n    this.red = null;\n\n    if (number !== null) {\n      if (base === 'le' || base === 'be') {\n        endian = base;\n        base = 10;\n      }\n\n      this._init(number || 0, base || 10, endian || 'be');\n    }\n  }\n  if (typeof module === 'object') {\n    module.exports = BN;\n  } else {\n    exports.BN = BN;\n  }\n\n  BN.BN = BN;\n  BN.wordSize = 26;\n\n  var Buffer;\n  try {\n    if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n      Buffer = window.Buffer;\n    } else {\n      Buffer = require('buffer').Buffer;\n    }\n  } catch (e) {\n  }\n\n  BN.isBN = function isBN (num) {\n    if (num instanceof BN) {\n      return true;\n    }\n\n    return num !== null && typeof num === 'object' &&\n      num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n  };\n\n  BN.max = function max (left, right) {\n    if (left.cmp(right) > 0) return left;\n    return right;\n  };\n\n  BN.min = function min (left, right) {\n    if (left.cmp(right) < 0) return left;\n    return right;\n  };\n\n  BN.prototype._init = function init (number, base, endian) {\n    if (typeof number === 'number') {\n      return this._initNumber(number, base, endian);\n    }\n\n    if (typeof number === 'object') {\n      return this._initArray(number, base, endian);\n    }\n\n    if (base === 'hex') {\n      base = 16;\n    }\n    assert(base === (base | 0) && base >= 2 && base <= 36);\n\n    number = number.toString().replace(/\\s+/g, '');\n    var start = 0;\n    if (number[0] === '-') {\n      start++;\n      this.negative = 1;\n    }\n\n    if (start < number.length) {\n      if (base === 16) {\n        this._parseHex(number, start, endian);\n      } else {\n        this._parseBase(number, base, start);\n        if (endian === 'le') {\n          this._initArray(this.toArray(), base, endian);\n        }\n      }\n    }\n  };\n\n  BN.prototype._initNumber = function _initNumber (number, base, endian) {\n    if (number < 0) {\n      this.negative = 1;\n      number = -number;\n    }\n    if (number < 0x4000000) {\n      this.words = [number & 0x3ffffff];\n      this.length = 1;\n    } else if (number < 0x10000000000000) {\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n      this.words = [\n        number & 0x3ffffff,\n        (number / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    if (endian !== 'le') return;\n\n    // Reverse the bytes\n    this._initArray(this.toArray(), base, endian);\n  };\n\n  BN.prototype._initArray = function _initArray (number, base, endian) {\n    // Perhaps a Uint8Array\n    assert(typeof number.length === 'number');\n    if (number.length <= 0) {\n      this.words = [0];\n      this.length = 1;\n      return this;\n    }\n\n    this.length = Math.ceil(number.length / 3);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    var j, w;\n    var off = 0;\n    if (endian === 'be') {\n      for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n        w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    } else if (endian === 'le') {\n      for (i = 0, j = 0; i < number.length; i += 3) {\n        w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n        off += 24;\n        if (off >= 26) {\n          off -= 26;\n          j++;\n        }\n      }\n    }\n    return this._strip();\n  };\n\n  function parseHex4Bits (string, index) {\n    var c = string.charCodeAt(index);\n    // '0' - '9'\n    if (c >= 48 && c <= 57) {\n      return c - 48;\n    // 'A' - 'F'\n    } else if (c >= 65 && c <= 70) {\n      return c - 55;\n    // 'a' - 'f'\n    } else if (c >= 97 && c <= 102) {\n      return c - 87;\n    } else {\n      assert(false, 'Invalid character in ' + string);\n    }\n  }\n\n  function parseHexByte (string, lowerBound, index) {\n    var r = parseHex4Bits(string, index);\n    if (index - 1 >= lowerBound) {\n      r |= parseHex4Bits(string, index - 1) << 4;\n    }\n    return r;\n  }\n\n  BN.prototype._parseHex = function _parseHex (number, start, endian) {\n    // Create possibly bigger array to ensure that it fits the number\n    this.length = Math.ceil((number.length - start) / 6);\n    this.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      this.words[i] = 0;\n    }\n\n    // 24-bits chunks\n    var off = 0;\n    var j = 0;\n\n    var w;\n    if (endian === 'be') {\n      for (i = number.length - 1; i >= start; i -= 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    } else {\n      var parseLength = number.length - start;\n      for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n        w = parseHexByte(number, start, i) << off;\n        this.words[j] |= w & 0x3ffffff;\n        if (off >= 18) {\n          off -= 18;\n          j += 1;\n          this.words[j] |= w >>> 26;\n        } else {\n          off += 8;\n        }\n      }\n    }\n\n    this._strip();\n  };\n\n  function parseBase (str, start, end, mul) {\n    var r = 0;\n    var b = 0;\n    var len = Math.min(str.length, end);\n    for (var i = start; i < len; i++) {\n      var c = str.charCodeAt(i) - 48;\n\n      r *= mul;\n\n      // 'a'\n      if (c >= 49) {\n        b = c - 49 + 0xa;\n\n      // 'A'\n      } else if (c >= 17) {\n        b = c - 17 + 0xa;\n\n      // '0' - '9'\n      } else {\n        b = c;\n      }\n      assert(c >= 0 && b < mul, 'Invalid character');\n      r += b;\n    }\n    return r;\n  }\n\n  BN.prototype._parseBase = function _parseBase (number, base, start) {\n    // Initialize as zero\n    this.words = [0];\n    this.length = 1;\n\n    // Find length of limb in base\n    for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n      limbLen++;\n    }\n    limbLen--;\n    limbPow = (limbPow / base) | 0;\n\n    var total = number.length - start;\n    var mod = total % limbLen;\n    var end = Math.min(total, total - mod) + start;\n\n    var word = 0;\n    for (var i = start; i < end; i += limbLen) {\n      word = parseBase(number, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    if (mod !== 0) {\n      var pow = 1;\n      word = parseBase(number, i, number.length, base);\n\n      for (i = 0; i < mod; i++) {\n        pow *= base;\n      }\n\n      this.imuln(pow);\n      if (this.words[0] + word < 0x4000000) {\n        this.words[0] += word;\n      } else {\n        this._iaddn(word);\n      }\n    }\n\n    this._strip();\n  };\n\n  BN.prototype.copy = function copy (dest) {\n    dest.words = new Array(this.length);\n    for (var i = 0; i < this.length; i++) {\n      dest.words[i] = this.words[i];\n    }\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n  };\n\n  function move (dest, src) {\n    dest.words = src.words;\n    dest.length = src.length;\n    dest.negative = src.negative;\n    dest.red = src.red;\n  }\n\n  BN.prototype._move = function _move (dest) {\n    move(dest, this);\n  };\n\n  BN.prototype.clone = function clone () {\n    var r = new BN(null);\n    this.copy(r);\n    return r;\n  };\n\n  BN.prototype._expand = function _expand (size) {\n    while (this.length < size) {\n      this.words[this.length++] = 0;\n    }\n    return this;\n  };\n\n  // Remove leading `0` from `this`\n  BN.prototype._strip = function strip () {\n    while (this.length > 1 && this.words[this.length - 1] === 0) {\n      this.length--;\n    }\n    return this._normSign();\n  };\n\n  BN.prototype._normSign = function _normSign () {\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0) {\n      this.negative = 0;\n    }\n    return this;\n  };\n\n  // Check Symbol.for because not everywhere where Symbol defined\n  // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n  if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n    try {\n      BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n    } catch (e) {\n      BN.prototype.inspect = inspect;\n    }\n  } else {\n    BN.prototype.inspect = inspect;\n  }\n\n  function inspect () {\n    return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n  }\n\n  /*\n\n  var zeros = [];\n  var groupSizes = [];\n  var groupBases = [];\n\n  var s = '';\n  var i = -1;\n  while (++i < BN.wordSize) {\n    zeros[i] = s;\n    s += '0';\n  }\n  groupSizes[0] = 0;\n  groupSizes[1] = 0;\n  groupBases[0] = 0;\n  groupBases[1] = 0;\n  var base = 2 - 1;\n  while (++base < 36 + 1) {\n    var groupSize = 0;\n    var groupBase = 1;\n    while (groupBase < (1 << BN.wordSize) / base) {\n      groupBase *= base;\n      groupSize += 1;\n    }\n    groupSizes[base] = groupSize;\n    groupBases[base] = groupBase;\n  }\n\n  */\n\n  var zeros = [\n    '',\n    '0',\n    '00',\n    '000',\n    '0000',\n    '00000',\n    '000000',\n    '0000000',\n    '00000000',\n    '000000000',\n    '0000000000',\n    '00000000000',\n    '000000000000',\n    '0000000000000',\n    '00000000000000',\n    '000000000000000',\n    '0000000000000000',\n    '00000000000000000',\n    '000000000000000000',\n    '0000000000000000000',\n    '00000000000000000000',\n    '000000000000000000000',\n    '0000000000000000000000',\n    '00000000000000000000000',\n    '000000000000000000000000',\n    '0000000000000000000000000'\n  ];\n\n  var groupSizes = [\n    0, 0,\n    25, 16, 12, 11, 10, 9, 8,\n    8, 7, 7, 7, 7, 6, 6,\n    6, 6, 6, 6, 6, 5, 5,\n    5, 5, 5, 5, 5, 5, 5,\n    5, 5, 5, 5, 5, 5, 5\n  ];\n\n  var groupBases = [\n    0, 0,\n    33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n    43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n    16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n    6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n    24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n  ];\n\n  BN.prototype.toString = function toString (base, padding) {\n    base = base || 10;\n    padding = padding | 0 || 1;\n\n    var out;\n    if (base === 16 || base === 'hex') {\n      out = '';\n      var off = 0;\n      var carry = 0;\n      for (var i = 0; i < this.length; i++) {\n        var w = this.words[i];\n        var word = (((w << off) | carry) & 0xffffff).toString(16);\n        carry = (w >>> (24 - off)) & 0xffffff;\n        if (carry !== 0 || i !== this.length - 1) {\n          out = zeros[6 - word.length] + word + out;\n        } else {\n          out = word + out;\n        }\n        off += 2;\n        if (off >= 26) {\n          off -= 26;\n          i--;\n        }\n      }\n      if (carry !== 0) {\n        out = carry.toString(16) + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    if (base === (base | 0) && base >= 2 && base <= 36) {\n      // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n      var groupSize = groupSizes[base];\n      // var groupBase = Math.pow(base, groupSize);\n      var groupBase = groupBases[base];\n      out = '';\n      var c = this.clone();\n      c.negative = 0;\n      while (!c.isZero()) {\n        var r = c.modrn(groupBase).toString(base);\n        c = c.idivn(groupBase);\n\n        if (!c.isZero()) {\n          out = zeros[groupSize - r.length] + r + out;\n        } else {\n          out = r + out;\n        }\n      }\n      if (this.isZero()) {\n        out = '0' + out;\n      }\n      while (out.length % padding !== 0) {\n        out = '0' + out;\n      }\n      if (this.negative !== 0) {\n        out = '-' + out;\n      }\n      return out;\n    }\n\n    assert(false, 'Base should be between 2 and 36');\n  };\n\n  BN.prototype.toNumber = function toNumber () {\n    var ret = this.words[0];\n    if (this.length === 2) {\n      ret += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // NOTE: at this stage it is known that the top bit is set\n      ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      assert(false, 'Number can only safely store up to 53 bits');\n    }\n    return (this.negative !== 0) ? -ret : ret;\n  };\n\n  BN.prototype.toJSON = function toJSON () {\n    return this.toString(16, 2);\n  };\n\n  if (Buffer) {\n    BN.prototype.toBuffer = function toBuffer (endian, length) {\n      return this.toArrayLike(Buffer, endian, length);\n    };\n  }\n\n  BN.prototype.toArray = function toArray (endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  };\n\n  var allocate = function allocate (ArrayType, size) {\n    if (ArrayType.allocUnsafe) {\n      return ArrayType.allocUnsafe(size);\n    }\n    return new ArrayType(size);\n  };\n\n  BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n    this._strip();\n\n    var byteLength = this.byteLength();\n    var reqLength = length || Math.max(1, byteLength);\n    assert(byteLength <= reqLength, 'byte array longer than desired length');\n    assert(reqLength > 0, 'Requested array length <= 0');\n\n    var res = allocate(ArrayType, reqLength);\n    var postfix = endian === 'le' ? 'LE' : 'BE';\n    this['_toArrayLike' + postfix](res, byteLength);\n    return res;\n  };\n\n  BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n    var position = 0;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position++] = word & 0xff;\n      if (position < res.length) {\n        res[position++] = (word >> 8) & 0xff;\n      }\n      if (position < res.length) {\n        res[position++] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position < res.length) {\n          res[position++] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position < res.length) {\n      res[position++] = carry;\n\n      while (position < res.length) {\n        res[position++] = 0;\n      }\n    }\n  };\n\n  BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n    var position = res.length - 1;\n    var carry = 0;\n\n    for (var i = 0, shift = 0; i < this.length; i++) {\n      var word = (this.words[i] << shift) | carry;\n\n      res[position--] = word & 0xff;\n      if (position >= 0) {\n        res[position--] = (word >> 8) & 0xff;\n      }\n      if (position >= 0) {\n        res[position--] = (word >> 16) & 0xff;\n      }\n\n      if (shift === 6) {\n        if (position >= 0) {\n          res[position--] = (word >> 24) & 0xff;\n        }\n        carry = 0;\n        shift = 0;\n      } else {\n        carry = word >>> 24;\n        shift += 2;\n      }\n    }\n\n    if (position >= 0) {\n      res[position--] = carry;\n\n      while (position >= 0) {\n        res[position--] = 0;\n      }\n    }\n  };\n\n  if (Math.clz32) {\n    BN.prototype._countBits = function _countBits (w) {\n      return 32 - Math.clz32(w);\n    };\n  } else {\n    BN.prototype._countBits = function _countBits (w) {\n      var t = w;\n      var r = 0;\n      if (t >= 0x1000) {\n        r += 13;\n        t >>>= 13;\n      }\n      if (t >= 0x40) {\n        r += 7;\n        t >>>= 7;\n      }\n      if (t >= 0x8) {\n        r += 4;\n        t >>>= 4;\n      }\n      if (t >= 0x02) {\n        r += 2;\n        t >>>= 2;\n      }\n      return r + t;\n    };\n  }\n\n  BN.prototype._zeroBits = function _zeroBits (w) {\n    // Short-cut\n    if (w === 0) return 26;\n\n    var t = w;\n    var r = 0;\n    if ((t & 0x1fff) === 0) {\n      r += 13;\n      t >>>= 13;\n    }\n    if ((t & 0x7f) === 0) {\n      r += 7;\n      t >>>= 7;\n    }\n    if ((t & 0xf) === 0) {\n      r += 4;\n      t >>>= 4;\n    }\n    if ((t & 0x3) === 0) {\n      r += 2;\n      t >>>= 2;\n    }\n    if ((t & 0x1) === 0) {\n      r++;\n    }\n    return r;\n  };\n\n  // Return number of used bits in a BN\n  BN.prototype.bitLength = function bitLength () {\n    var w = this.words[this.length - 1];\n    var hi = this._countBits(w);\n    return (this.length - 1) * 26 + hi;\n  };\n\n  function toBitArray (num) {\n    var w = new Array(num.bitLength());\n\n    for (var bit = 0; bit < w.length; bit++) {\n      var off = (bit / 26) | 0;\n      var wbit = bit % 26;\n\n      w[bit] = (num.words[off] >>> wbit) & 0x01;\n    }\n\n    return w;\n  }\n\n  // Number of trailing zero bits\n  BN.prototype.zeroBits = function zeroBits () {\n    if (this.isZero()) return 0;\n\n    var r = 0;\n    for (var i = 0; i < this.length; i++) {\n      var b = this._zeroBits(this.words[i]);\n      r += b;\n      if (b !== 26) break;\n    }\n    return r;\n  };\n\n  BN.prototype.byteLength = function byteLength () {\n    return Math.ceil(this.bitLength() / 8);\n  };\n\n  BN.prototype.toTwos = function toTwos (width) {\n    if (this.negative !== 0) {\n      return this.abs().inotn(width).iaddn(1);\n    }\n    return this.clone();\n  };\n\n  BN.prototype.fromTwos = function fromTwos (width) {\n    if (this.testn(width - 1)) {\n      return this.notn(width).iaddn(1).ineg();\n    }\n    return this.clone();\n  };\n\n  BN.prototype.isNeg = function isNeg () {\n    return this.negative !== 0;\n  };\n\n  // Return negative clone of `this`\n  BN.prototype.neg = function neg () {\n    return this.clone().ineg();\n  };\n\n  BN.prototype.ineg = function ineg () {\n    if (!this.isZero()) {\n      this.negative ^= 1;\n    }\n\n    return this;\n  };\n\n  // Or `num` with `this` in-place\n  BN.prototype.iuor = function iuor (num) {\n    while (this.length < num.length) {\n      this.words[this.length++] = 0;\n    }\n\n    for (var i = 0; i < num.length; i++) {\n      this.words[i] = this.words[i] | num.words[i];\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ior = function ior (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuor(num);\n  };\n\n  // Or `num` with `this`\n  BN.prototype.or = function or (num) {\n    if (this.length > num.length) return this.clone().ior(num);\n    return num.clone().ior(this);\n  };\n\n  BN.prototype.uor = function uor (num) {\n    if (this.length > num.length) return this.clone().iuor(num);\n    return num.clone().iuor(this);\n  };\n\n  // And `num` with `this` in-place\n  BN.prototype.iuand = function iuand (num) {\n    // b = min-length(num, this)\n    var b;\n    if (this.length > num.length) {\n      b = num;\n    } else {\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = this.words[i] & num.words[i];\n    }\n\n    this.length = b.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.iand = function iand (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuand(num);\n  };\n\n  // And `num` with `this`\n  BN.prototype.and = function and (num) {\n    if (this.length > num.length) return this.clone().iand(num);\n    return num.clone().iand(this);\n  };\n\n  BN.prototype.uand = function uand (num) {\n    if (this.length > num.length) return this.clone().iuand(num);\n    return num.clone().iuand(this);\n  };\n\n  // Xor `num` with `this` in-place\n  BN.prototype.iuxor = function iuxor (num) {\n    // a.length > b.length\n    var a;\n    var b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    for (var i = 0; i < b.length; i++) {\n      this.words[i] = a.words[i] ^ b.words[i];\n    }\n\n    if (this !== a) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = a.length;\n\n    return this._strip();\n  };\n\n  BN.prototype.ixor = function ixor (num) {\n    assert((this.negative | num.negative) === 0);\n    return this.iuxor(num);\n  };\n\n  // Xor `num` with `this`\n  BN.prototype.xor = function xor (num) {\n    if (this.length > num.length) return this.clone().ixor(num);\n    return num.clone().ixor(this);\n  };\n\n  BN.prototype.uxor = function uxor (num) {\n    if (this.length > num.length) return this.clone().iuxor(num);\n    return num.clone().iuxor(this);\n  };\n\n  // Not ``this`` with ``width`` bitwidth\n  BN.prototype.inotn = function inotn (width) {\n    assert(typeof width === 'number' && width >= 0);\n\n    var bytesNeeded = Math.ceil(width / 26) | 0;\n    var bitsLeft = width % 26;\n\n    // Extend the buffer with leading zeroes\n    this._expand(bytesNeeded);\n\n    if (bitsLeft > 0) {\n      bytesNeeded--;\n    }\n\n    // Handle complete words\n    for (var i = 0; i < bytesNeeded; i++) {\n      this.words[i] = ~this.words[i] & 0x3ffffff;\n    }\n\n    // Handle the residue\n    if (bitsLeft > 0) {\n      this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n    }\n\n    // And remove leading zeroes\n    return this._strip();\n  };\n\n  BN.prototype.notn = function notn (width) {\n    return this.clone().inotn(width);\n  };\n\n  // Set `bit` of `this`\n  BN.prototype.setn = function setn (bit, val) {\n    assert(typeof bit === 'number' && bit >= 0);\n\n    var off = (bit / 26) | 0;\n    var wbit = bit % 26;\n\n    this._expand(off + 1);\n\n    if (val) {\n      this.words[off] = this.words[off] | (1 << wbit);\n    } else {\n      this.words[off] = this.words[off] & ~(1 << wbit);\n    }\n\n    return this._strip();\n  };\n\n  // Add `num` to `this` in-place\n  BN.prototype.iadd = function iadd (num) {\n    var r;\n\n    // negative + positive\n    if (this.negative !== 0 && num.negative === 0) {\n      this.negative = 0;\n      r = this.isub(num);\n      this.negative ^= 1;\n      return this._normSign();\n\n    // positive + negative\n    } else if (this.negative === 0 && num.negative !== 0) {\n      num.negative = 0;\n      r = this.isub(num);\n      num.negative = 1;\n      return r._normSign();\n    }\n\n    // a.length > b.length\n    var a, b;\n    if (this.length > num.length) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      this.words[i] = r & 0x3ffffff;\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n    if (carry !== 0) {\n      this.words[this.length] = carry;\n      this.length++;\n    // Copy the rest of the words\n    } else if (a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    return this;\n  };\n\n  // Add `num` to `this`\n  BN.prototype.add = function add (num) {\n    var res;\n    if (num.negative !== 0 && this.negative === 0) {\n      num.negative = 0;\n      res = this.sub(num);\n      num.negative ^= 1;\n      return res;\n    } else if (num.negative === 0 && this.negative !== 0) {\n      this.negative = 0;\n      res = num.sub(this);\n      this.negative = 1;\n      return res;\n    }\n\n    if (this.length > num.length) return this.clone().iadd(num);\n\n    return num.clone().iadd(this);\n  };\n\n  // Subtract `num` from `this` in-place\n  BN.prototype.isub = function isub (num) {\n    // this - (-num) = this + num\n    if (num.negative !== 0) {\n      num.negative = 0;\n      var r = this.iadd(num);\n      num.negative = 1;\n      return r._normSign();\n\n    // -this - num = -(this + num)\n    } else if (this.negative !== 0) {\n      this.negative = 0;\n      this.iadd(num);\n      this.negative = 1;\n      return this._normSign();\n    }\n\n    // At this point both numbers are positive\n    var cmp = this.cmp(num);\n\n    // Optimization - zeroify\n    if (cmp === 0) {\n      this.negative = 0;\n      this.length = 1;\n      this.words[0] = 0;\n      return this;\n    }\n\n    // a > b\n    var a, b;\n    if (cmp > 0) {\n      a = this;\n      b = num;\n    } else {\n      a = num;\n      b = this;\n    }\n\n    var carry = 0;\n    for (var i = 0; i < b.length; i++) {\n      r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n    for (; carry !== 0 && i < a.length; i++) {\n      r = (a.words[i] | 0) + carry;\n      carry = r >> 26;\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    // Copy rest of the words\n    if (carry === 0 && i < a.length && a !== this) {\n      for (; i < a.length; i++) {\n        this.words[i] = a.words[i];\n      }\n    }\n\n    this.length = Math.max(this.length, i);\n\n    if (a !== this) {\n      this.negative = 1;\n    }\n\n    return this._strip();\n  };\n\n  // Subtract `num` from `this`\n  BN.prototype.sub = function sub (num) {\n    return this.clone().isub(num);\n  };\n\n  function smallMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    var len = (self.length + num.length) | 0;\n    out.length = len;\n    len = (len - 1) | 0;\n\n    // Peel one iteration (compiler can't do it, because of code complexity)\n    var a = self.words[0] | 0;\n    var b = num.words[0] | 0;\n    var r = a * b;\n\n    var lo = r & 0x3ffffff;\n    var carry = (r / 0x4000000) | 0;\n    out.words[0] = lo;\n\n    for (var k = 1; k < len; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = carry >>> 26;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = (k - j) | 0;\n        a = self.words[i] | 0;\n        b = num.words[j] | 0;\n        r = a * b + rword;\n        ncarry += (r / 0x4000000) | 0;\n        rword = r & 0x3ffffff;\n      }\n      out.words[k] = rword | 0;\n      carry = ncarry | 0;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry | 0;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  // TODO(indutny): it may be reasonable to omit it for users who don't need\n  // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n  // multiplication (like elliptic secp256k1).\n  var comb10MulTo = function comb10MulTo (self, num, out) {\n    var a = self.words;\n    var b = num.words;\n    var o = out.words;\n    var c = 0;\n    var lo;\n    var mid;\n    var hi;\n    var a0 = a[0] | 0;\n    var al0 = a0 & 0x1fff;\n    var ah0 = a0 >>> 13;\n    var a1 = a[1] | 0;\n    var al1 = a1 & 0x1fff;\n    var ah1 = a1 >>> 13;\n    var a2 = a[2] | 0;\n    var al2 = a2 & 0x1fff;\n    var ah2 = a2 >>> 13;\n    var a3 = a[3] | 0;\n    var al3 = a3 & 0x1fff;\n    var ah3 = a3 >>> 13;\n    var a4 = a[4] | 0;\n    var al4 = a4 & 0x1fff;\n    var ah4 = a4 >>> 13;\n    var a5 = a[5] | 0;\n    var al5 = a5 & 0x1fff;\n    var ah5 = a5 >>> 13;\n    var a6 = a[6] | 0;\n    var al6 = a6 & 0x1fff;\n    var ah6 = a6 >>> 13;\n    var a7 = a[7] | 0;\n    var al7 = a7 & 0x1fff;\n    var ah7 = a7 >>> 13;\n    var a8 = a[8] | 0;\n    var al8 = a8 & 0x1fff;\n    var ah8 = a8 >>> 13;\n    var a9 = a[9] | 0;\n    var al9 = a9 & 0x1fff;\n    var ah9 = a9 >>> 13;\n    var b0 = b[0] | 0;\n    var bl0 = b0 & 0x1fff;\n    var bh0 = b0 >>> 13;\n    var b1 = b[1] | 0;\n    var bl1 = b1 & 0x1fff;\n    var bh1 = b1 >>> 13;\n    var b2 = b[2] | 0;\n    var bl2 = b2 & 0x1fff;\n    var bh2 = b2 >>> 13;\n    var b3 = b[3] | 0;\n    var bl3 = b3 & 0x1fff;\n    var bh3 = b3 >>> 13;\n    var b4 = b[4] | 0;\n    var bl4 = b4 & 0x1fff;\n    var bh4 = b4 >>> 13;\n    var b5 = b[5] | 0;\n    var bl5 = b5 & 0x1fff;\n    var bh5 = b5 >>> 13;\n    var b6 = b[6] | 0;\n    var bl6 = b6 & 0x1fff;\n    var bh6 = b6 >>> 13;\n    var b7 = b[7] | 0;\n    var bl7 = b7 & 0x1fff;\n    var bh7 = b7 >>> 13;\n    var b8 = b[8] | 0;\n    var bl8 = b8 & 0x1fff;\n    var bh8 = b8 >>> 13;\n    var b9 = b[9] | 0;\n    var bl9 = b9 & 0x1fff;\n    var bh9 = b9 >>> 13;\n\n    out.negative = self.negative ^ num.negative;\n    out.length = 19;\n    /* k = 0 */\n    lo = Math.imul(al0, bl0);\n    mid = Math.imul(al0, bh0);\n    mid = (mid + Math.imul(ah0, bl0)) | 0;\n    hi = Math.imul(ah0, bh0);\n    var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n    w0 &= 0x3ffffff;\n    /* k = 1 */\n    lo = Math.imul(al1, bl0);\n    mid = Math.imul(al1, bh0);\n    mid = (mid + Math.imul(ah1, bl0)) | 0;\n    hi = Math.imul(ah1, bh0);\n    lo = (lo + Math.imul(al0, bl1)) | 0;\n    mid = (mid + Math.imul(al0, bh1)) | 0;\n    mid = (mid + Math.imul(ah0, bl1)) | 0;\n    hi = (hi + Math.imul(ah0, bh1)) | 0;\n    var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n    w1 &= 0x3ffffff;\n    /* k = 2 */\n    lo = Math.imul(al2, bl0);\n    mid = Math.imul(al2, bh0);\n    mid = (mid + Math.imul(ah2, bl0)) | 0;\n    hi = Math.imul(ah2, bh0);\n    lo = (lo + Math.imul(al1, bl1)) | 0;\n    mid = (mid + Math.imul(al1, bh1)) | 0;\n    mid = (mid + Math.imul(ah1, bl1)) | 0;\n    hi = (hi + Math.imul(ah1, bh1)) | 0;\n    lo = (lo + Math.imul(al0, bl2)) | 0;\n    mid = (mid + Math.imul(al0, bh2)) | 0;\n    mid = (mid + Math.imul(ah0, bl2)) | 0;\n    hi = (hi + Math.imul(ah0, bh2)) | 0;\n    var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n    w2 &= 0x3ffffff;\n    /* k = 3 */\n    lo = Math.imul(al3, bl0);\n    mid = Math.imul(al3, bh0);\n    mid = (mid + Math.imul(ah3, bl0)) | 0;\n    hi = Math.imul(ah3, bh0);\n    lo = (lo + Math.imul(al2, bl1)) | 0;\n    mid = (mid + Math.imul(al2, bh1)) | 0;\n    mid = (mid + Math.imul(ah2, bl1)) | 0;\n    hi = (hi + Math.imul(ah2, bh1)) | 0;\n    lo = (lo + Math.imul(al1, bl2)) | 0;\n    mid = (mid + Math.imul(al1, bh2)) | 0;\n    mid = (mid + Math.imul(ah1, bl2)) | 0;\n    hi = (hi + Math.imul(ah1, bh2)) | 0;\n    lo = (lo + Math.imul(al0, bl3)) | 0;\n    mid = (mid + Math.imul(al0, bh3)) | 0;\n    mid = (mid + Math.imul(ah0, bl3)) | 0;\n    hi = (hi + Math.imul(ah0, bh3)) | 0;\n    var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n    w3 &= 0x3ffffff;\n    /* k = 4 */\n    lo = Math.imul(al4, bl0);\n    mid = Math.imul(al4, bh0);\n    mid = (mid + Math.imul(ah4, bl0)) | 0;\n    hi = Math.imul(ah4, bh0);\n    lo = (lo + Math.imul(al3, bl1)) | 0;\n    mid = (mid + Math.imul(al3, bh1)) | 0;\n    mid = (mid + Math.imul(ah3, bl1)) | 0;\n    hi = (hi + Math.imul(ah3, bh1)) | 0;\n    lo = (lo + Math.imul(al2, bl2)) | 0;\n    mid = (mid + Math.imul(al2, bh2)) | 0;\n    mid = (mid + Math.imul(ah2, bl2)) | 0;\n    hi = (hi + Math.imul(ah2, bh2)) | 0;\n    lo = (lo + Math.imul(al1, bl3)) | 0;\n    mid = (mid + Math.imul(al1, bh3)) | 0;\n    mid = (mid + Math.imul(ah1, bl3)) | 0;\n    hi = (hi + Math.imul(ah1, bh3)) | 0;\n    lo = (lo + Math.imul(al0, bl4)) | 0;\n    mid = (mid + Math.imul(al0, bh4)) | 0;\n    mid = (mid + Math.imul(ah0, bl4)) | 0;\n    hi = (hi + Math.imul(ah0, bh4)) | 0;\n    var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n    w4 &= 0x3ffffff;\n    /* k = 5 */\n    lo = Math.imul(al5, bl0);\n    mid = Math.imul(al5, bh0);\n    mid = (mid + Math.imul(ah5, bl0)) | 0;\n    hi = Math.imul(ah5, bh0);\n    lo = (lo + Math.imul(al4, bl1)) | 0;\n    mid = (mid + Math.imul(al4, bh1)) | 0;\n    mid = (mid + Math.imul(ah4, bl1)) | 0;\n    hi = (hi + Math.imul(ah4, bh1)) | 0;\n    lo = (lo + Math.imul(al3, bl2)) | 0;\n    mid = (mid + Math.imul(al3, bh2)) | 0;\n    mid = (mid + Math.imul(ah3, bl2)) | 0;\n    hi = (hi + Math.imul(ah3, bh2)) | 0;\n    lo = (lo + Math.imul(al2, bl3)) | 0;\n    mid = (mid + Math.imul(al2, bh3)) | 0;\n    mid = (mid + Math.imul(ah2, bl3)) | 0;\n    hi = (hi + Math.imul(ah2, bh3)) | 0;\n    lo = (lo + Math.imul(al1, bl4)) | 0;\n    mid = (mid + Math.imul(al1, bh4)) | 0;\n    mid = (mid + Math.imul(ah1, bl4)) | 0;\n    hi = (hi + Math.imul(ah1, bh4)) | 0;\n    lo = (lo + Math.imul(al0, bl5)) | 0;\n    mid = (mid + Math.imul(al0, bh5)) | 0;\n    mid = (mid + Math.imul(ah0, bl5)) | 0;\n    hi = (hi + Math.imul(ah0, bh5)) | 0;\n    var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n    w5 &= 0x3ffffff;\n    /* k = 6 */\n    lo = Math.imul(al6, bl0);\n    mid = Math.imul(al6, bh0);\n    mid = (mid + Math.imul(ah6, bl0)) | 0;\n    hi = Math.imul(ah6, bh0);\n    lo = (lo + Math.imul(al5, bl1)) | 0;\n    mid = (mid + Math.imul(al5, bh1)) | 0;\n    mid = (mid + Math.imul(ah5, bl1)) | 0;\n    hi = (hi + Math.imul(ah5, bh1)) | 0;\n    lo = (lo + Math.imul(al4, bl2)) | 0;\n    mid = (mid + Math.imul(al4, bh2)) | 0;\n    mid = (mid + Math.imul(ah4, bl2)) | 0;\n    hi = (hi + Math.imul(ah4, bh2)) | 0;\n    lo = (lo + Math.imul(al3, bl3)) | 0;\n    mid = (mid + Math.imul(al3, bh3)) | 0;\n    mid = (mid + Math.imul(ah3, bl3)) | 0;\n    hi = (hi + Math.imul(ah3, bh3)) | 0;\n    lo = (lo + Math.imul(al2, bl4)) | 0;\n    mid = (mid + Math.imul(al2, bh4)) | 0;\n    mid = (mid + Math.imul(ah2, bl4)) | 0;\n    hi = (hi + Math.imul(ah2, bh4)) | 0;\n    lo = (lo + Math.imul(al1, bl5)) | 0;\n    mid = (mid + Math.imul(al1, bh5)) | 0;\n    mid = (mid + Math.imul(ah1, bl5)) | 0;\n    hi = (hi + Math.imul(ah1, bh5)) | 0;\n    lo = (lo + Math.imul(al0, bl6)) | 0;\n    mid = (mid + Math.imul(al0, bh6)) | 0;\n    mid = (mid + Math.imul(ah0, bl6)) | 0;\n    hi = (hi + Math.imul(ah0, bh6)) | 0;\n    var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n    w6 &= 0x3ffffff;\n    /* k = 7 */\n    lo = Math.imul(al7, bl0);\n    mid = Math.imul(al7, bh0);\n    mid = (mid + Math.imul(ah7, bl0)) | 0;\n    hi = Math.imul(ah7, bh0);\n    lo = (lo + Math.imul(al6, bl1)) | 0;\n    mid = (mid + Math.imul(al6, bh1)) | 0;\n    mid = (mid + Math.imul(ah6, bl1)) | 0;\n    hi = (hi + Math.imul(ah6, bh1)) | 0;\n    lo = (lo + Math.imul(al5, bl2)) | 0;\n    mid = (mid + Math.imul(al5, bh2)) | 0;\n    mid = (mid + Math.imul(ah5, bl2)) | 0;\n    hi = (hi + Math.imul(ah5, bh2)) | 0;\n    lo = (lo + Math.imul(al4, bl3)) | 0;\n    mid = (mid + Math.imul(al4, bh3)) | 0;\n    mid = (mid + Math.imul(ah4, bl3)) | 0;\n    hi = (hi + Math.imul(ah4, bh3)) | 0;\n    lo = (lo + Math.imul(al3, bl4)) | 0;\n    mid = (mid + Math.imul(al3, bh4)) | 0;\n    mid = (mid + Math.imul(ah3, bl4)) | 0;\n    hi = (hi + Math.imul(ah3, bh4)) | 0;\n    lo = (lo + Math.imul(al2, bl5)) | 0;\n    mid = (mid + Math.imul(al2, bh5)) | 0;\n    mid = (mid + Math.imul(ah2, bl5)) | 0;\n    hi = (hi + Math.imul(ah2, bh5)) | 0;\n    lo = (lo + Math.imul(al1, bl6)) | 0;\n    mid = (mid + Math.imul(al1, bh6)) | 0;\n    mid = (mid + Math.imul(ah1, bl6)) | 0;\n    hi = (hi + Math.imul(ah1, bh6)) | 0;\n    lo = (lo + Math.imul(al0, bl7)) | 0;\n    mid = (mid + Math.imul(al0, bh7)) | 0;\n    mid = (mid + Math.imul(ah0, bl7)) | 0;\n    hi = (hi + Math.imul(ah0, bh7)) | 0;\n    var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n    w7 &= 0x3ffffff;\n    /* k = 8 */\n    lo = Math.imul(al8, bl0);\n    mid = Math.imul(al8, bh0);\n    mid = (mid + Math.imul(ah8, bl0)) | 0;\n    hi = Math.imul(ah8, bh0);\n    lo = (lo + Math.imul(al7, bl1)) | 0;\n    mid = (mid + Math.imul(al7, bh1)) | 0;\n    mid = (mid + Math.imul(ah7, bl1)) | 0;\n    hi = (hi + Math.imul(ah7, bh1)) | 0;\n    lo = (lo + Math.imul(al6, bl2)) | 0;\n    mid = (mid + Math.imul(al6, bh2)) | 0;\n    mid = (mid + Math.imul(ah6, bl2)) | 0;\n    hi = (hi + Math.imul(ah6, bh2)) | 0;\n    lo = (lo + Math.imul(al5, bl3)) | 0;\n    mid = (mid + Math.imul(al5, bh3)) | 0;\n    mid = (mid + Math.imul(ah5, bl3)) | 0;\n    hi = (hi + Math.imul(ah5, bh3)) | 0;\n    lo = (lo + Math.imul(al4, bl4)) | 0;\n    mid = (mid + Math.imul(al4, bh4)) | 0;\n    mid = (mid + Math.imul(ah4, bl4)) | 0;\n    hi = (hi + Math.imul(ah4, bh4)) | 0;\n    lo = (lo + Math.imul(al3, bl5)) | 0;\n    mid = (mid + Math.imul(al3, bh5)) | 0;\n    mid = (mid + Math.imul(ah3, bl5)) | 0;\n    hi = (hi + Math.imul(ah3, bh5)) | 0;\n    lo = (lo + Math.imul(al2, bl6)) | 0;\n    mid = (mid + Math.imul(al2, bh6)) | 0;\n    mid = (mid + Math.imul(ah2, bl6)) | 0;\n    hi = (hi + Math.imul(ah2, bh6)) | 0;\n    lo = (lo + Math.imul(al1, bl7)) | 0;\n    mid = (mid + Math.imul(al1, bh7)) | 0;\n    mid = (mid + Math.imul(ah1, bl7)) | 0;\n    hi = (hi + Math.imul(ah1, bh7)) | 0;\n    lo = (lo + Math.imul(al0, bl8)) | 0;\n    mid = (mid + Math.imul(al0, bh8)) | 0;\n    mid = (mid + Math.imul(ah0, bl8)) | 0;\n    hi = (hi + Math.imul(ah0, bh8)) | 0;\n    var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n    w8 &= 0x3ffffff;\n    /* k = 9 */\n    lo = Math.imul(al9, bl0);\n    mid = Math.imul(al9, bh0);\n    mid = (mid + Math.imul(ah9, bl0)) | 0;\n    hi = Math.imul(ah9, bh0);\n    lo = (lo + Math.imul(al8, bl1)) | 0;\n    mid = (mid + Math.imul(al8, bh1)) | 0;\n    mid = (mid + Math.imul(ah8, bl1)) | 0;\n    hi = (hi + Math.imul(ah8, bh1)) | 0;\n    lo = (lo + Math.imul(al7, bl2)) | 0;\n    mid = (mid + Math.imul(al7, bh2)) | 0;\n    mid = (mid + Math.imul(ah7, bl2)) | 0;\n    hi = (hi + Math.imul(ah7, bh2)) | 0;\n    lo = (lo + Math.imul(al6, bl3)) | 0;\n    mid = (mid + Math.imul(al6, bh3)) | 0;\n    mid = (mid + Math.imul(ah6, bl3)) | 0;\n    hi = (hi + Math.imul(ah6, bh3)) | 0;\n    lo = (lo + Math.imul(al5, bl4)) | 0;\n    mid = (mid + Math.imul(al5, bh4)) | 0;\n    mid = (mid + Math.imul(ah5, bl4)) | 0;\n    hi = (hi + Math.imul(ah5, bh4)) | 0;\n    lo = (lo + Math.imul(al4, bl5)) | 0;\n    mid = (mid + Math.imul(al4, bh5)) | 0;\n    mid = (mid + Math.imul(ah4, bl5)) | 0;\n    hi = (hi + Math.imul(ah4, bh5)) | 0;\n    lo = (lo + Math.imul(al3, bl6)) | 0;\n    mid = (mid + Math.imul(al3, bh6)) | 0;\n    mid = (mid + Math.imul(ah3, bl6)) | 0;\n    hi = (hi + Math.imul(ah3, bh6)) | 0;\n    lo = (lo + Math.imul(al2, bl7)) | 0;\n    mid = (mid + Math.imul(al2, bh7)) | 0;\n    mid = (mid + Math.imul(ah2, bl7)) | 0;\n    hi = (hi + Math.imul(ah2, bh7)) | 0;\n    lo = (lo + Math.imul(al1, bl8)) | 0;\n    mid = (mid + Math.imul(al1, bh8)) | 0;\n    mid = (mid + Math.imul(ah1, bl8)) | 0;\n    hi = (hi + Math.imul(ah1, bh8)) | 0;\n    lo = (lo + Math.imul(al0, bl9)) | 0;\n    mid = (mid + Math.imul(al0, bh9)) | 0;\n    mid = (mid + Math.imul(ah0, bl9)) | 0;\n    hi = (hi + Math.imul(ah0, bh9)) | 0;\n    var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n    w9 &= 0x3ffffff;\n    /* k = 10 */\n    lo = Math.imul(al9, bl1);\n    mid = Math.imul(al9, bh1);\n    mid = (mid + Math.imul(ah9, bl1)) | 0;\n    hi = Math.imul(ah9, bh1);\n    lo = (lo + Math.imul(al8, bl2)) | 0;\n    mid = (mid + Math.imul(al8, bh2)) | 0;\n    mid = (mid + Math.imul(ah8, bl2)) | 0;\n    hi = (hi + Math.imul(ah8, bh2)) | 0;\n    lo = (lo + Math.imul(al7, bl3)) | 0;\n    mid = (mid + Math.imul(al7, bh3)) | 0;\n    mid = (mid + Math.imul(ah7, bl3)) | 0;\n    hi = (hi + Math.imul(ah7, bh3)) | 0;\n    lo = (lo + Math.imul(al6, bl4)) | 0;\n    mid = (mid + Math.imul(al6, bh4)) | 0;\n    mid = (mid + Math.imul(ah6, bl4)) | 0;\n    hi = (hi + Math.imul(ah6, bh4)) | 0;\n    lo = (lo + Math.imul(al5, bl5)) | 0;\n    mid = (mid + Math.imul(al5, bh5)) | 0;\n    mid = (mid + Math.imul(ah5, bl5)) | 0;\n    hi = (hi + Math.imul(ah5, bh5)) | 0;\n    lo = (lo + Math.imul(al4, bl6)) | 0;\n    mid = (mid + Math.imul(al4, bh6)) | 0;\n    mid = (mid + Math.imul(ah4, bl6)) | 0;\n    hi = (hi + Math.imul(ah4, bh6)) | 0;\n    lo = (lo + Math.imul(al3, bl7)) | 0;\n    mid = (mid + Math.imul(al3, bh7)) | 0;\n    mid = (mid + Math.imul(ah3, bl7)) | 0;\n    hi = (hi + Math.imul(ah3, bh7)) | 0;\n    lo = (lo + Math.imul(al2, bl8)) | 0;\n    mid = (mid + Math.imul(al2, bh8)) | 0;\n    mid = (mid + Math.imul(ah2, bl8)) | 0;\n    hi = (hi + Math.imul(ah2, bh8)) | 0;\n    lo = (lo + Math.imul(al1, bl9)) | 0;\n    mid = (mid + Math.imul(al1, bh9)) | 0;\n    mid = (mid + Math.imul(ah1, bl9)) | 0;\n    hi = (hi + Math.imul(ah1, bh9)) | 0;\n    var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n    w10 &= 0x3ffffff;\n    /* k = 11 */\n    lo = Math.imul(al9, bl2);\n    mid = Math.imul(al9, bh2);\n    mid = (mid + Math.imul(ah9, bl2)) | 0;\n    hi = Math.imul(ah9, bh2);\n    lo = (lo + Math.imul(al8, bl3)) | 0;\n    mid = (mid + Math.imul(al8, bh3)) | 0;\n    mid = (mid + Math.imul(ah8, bl3)) | 0;\n    hi = (hi + Math.imul(ah8, bh3)) | 0;\n    lo = (lo + Math.imul(al7, bl4)) | 0;\n    mid = (mid + Math.imul(al7, bh4)) | 0;\n    mid = (mid + Math.imul(ah7, bl4)) | 0;\n    hi = (hi + Math.imul(ah7, bh4)) | 0;\n    lo = (lo + Math.imul(al6, bl5)) | 0;\n    mid = (mid + Math.imul(al6, bh5)) | 0;\n    mid = (mid + Math.imul(ah6, bl5)) | 0;\n    hi = (hi + Math.imul(ah6, bh5)) | 0;\n    lo = (lo + Math.imul(al5, bl6)) | 0;\n    mid = (mid + Math.imul(al5, bh6)) | 0;\n    mid = (mid + Math.imul(ah5, bl6)) | 0;\n    hi = (hi + Math.imul(ah5, bh6)) | 0;\n    lo = (lo + Math.imul(al4, bl7)) | 0;\n    mid = (mid + Math.imul(al4, bh7)) | 0;\n    mid = (mid + Math.imul(ah4, bl7)) | 0;\n    hi = (hi + Math.imul(ah4, bh7)) | 0;\n    lo = (lo + Math.imul(al3, bl8)) | 0;\n    mid = (mid + Math.imul(al3, bh8)) | 0;\n    mid = (mid + Math.imul(ah3, bl8)) | 0;\n    hi = (hi + Math.imul(ah3, bh8)) | 0;\n    lo = (lo + Math.imul(al2, bl9)) | 0;\n    mid = (mid + Math.imul(al2, bh9)) | 0;\n    mid = (mid + Math.imul(ah2, bl9)) | 0;\n    hi = (hi + Math.imul(ah2, bh9)) | 0;\n    var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n    w11 &= 0x3ffffff;\n    /* k = 12 */\n    lo = Math.imul(al9, bl3);\n    mid = Math.imul(al9, bh3);\n    mid = (mid + Math.imul(ah9, bl3)) | 0;\n    hi = Math.imul(ah9, bh3);\n    lo = (lo + Math.imul(al8, bl4)) | 0;\n    mid = (mid + Math.imul(al8, bh4)) | 0;\n    mid = (mid + Math.imul(ah8, bl4)) | 0;\n    hi = (hi + Math.imul(ah8, bh4)) | 0;\n    lo = (lo + Math.imul(al7, bl5)) | 0;\n    mid = (mid + Math.imul(al7, bh5)) | 0;\n    mid = (mid + Math.imul(ah7, bl5)) | 0;\n    hi = (hi + Math.imul(ah7, bh5)) | 0;\n    lo = (lo + Math.imul(al6, bl6)) | 0;\n    mid = (mid + Math.imul(al6, bh6)) | 0;\n    mid = (mid + Math.imul(ah6, bl6)) | 0;\n    hi = (hi + Math.imul(ah6, bh6)) | 0;\n    lo = (lo + Math.imul(al5, bl7)) | 0;\n    mid = (mid + Math.imul(al5, bh7)) | 0;\n    mid = (mid + Math.imul(ah5, bl7)) | 0;\n    hi = (hi + Math.imul(ah5, bh7)) | 0;\n    lo = (lo + Math.imul(al4, bl8)) | 0;\n    mid = (mid + Math.imul(al4, bh8)) | 0;\n    mid = (mid + Math.imul(ah4, bl8)) | 0;\n    hi = (hi + Math.imul(ah4, bh8)) | 0;\n    lo = (lo + Math.imul(al3, bl9)) | 0;\n    mid = (mid + Math.imul(al3, bh9)) | 0;\n    mid = (mid + Math.imul(ah3, bl9)) | 0;\n    hi = (hi + Math.imul(ah3, bh9)) | 0;\n    var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n    w12 &= 0x3ffffff;\n    /* k = 13 */\n    lo = Math.imul(al9, bl4);\n    mid = Math.imul(al9, bh4);\n    mid = (mid + Math.imul(ah9, bl4)) | 0;\n    hi = Math.imul(ah9, bh4);\n    lo = (lo + Math.imul(al8, bl5)) | 0;\n    mid = (mid + Math.imul(al8, bh5)) | 0;\n    mid = (mid + Math.imul(ah8, bl5)) | 0;\n    hi = (hi + Math.imul(ah8, bh5)) | 0;\n    lo = (lo + Math.imul(al7, bl6)) | 0;\n    mid = (mid + Math.imul(al7, bh6)) | 0;\n    mid = (mid + Math.imul(ah7, bl6)) | 0;\n    hi = (hi + Math.imul(ah7, bh6)) | 0;\n    lo = (lo + Math.imul(al6, bl7)) | 0;\n    mid = (mid + Math.imul(al6, bh7)) | 0;\n    mid = (mid + Math.imul(ah6, bl7)) | 0;\n    hi = (hi + Math.imul(ah6, bh7)) | 0;\n    lo = (lo + Math.imul(al5, bl8)) | 0;\n    mid = (mid + Math.imul(al5, bh8)) | 0;\n    mid = (mid + Math.imul(ah5, bl8)) | 0;\n    hi = (hi + Math.imul(ah5, bh8)) | 0;\n    lo = (lo + Math.imul(al4, bl9)) | 0;\n    mid = (mid + Math.imul(al4, bh9)) | 0;\n    mid = (mid + Math.imul(ah4, bl9)) | 0;\n    hi = (hi + Math.imul(ah4, bh9)) | 0;\n    var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n    w13 &= 0x3ffffff;\n    /* k = 14 */\n    lo = Math.imul(al9, bl5);\n    mid = Math.imul(al9, bh5);\n    mid = (mid + Math.imul(ah9, bl5)) | 0;\n    hi = Math.imul(ah9, bh5);\n    lo = (lo + Math.imul(al8, bl6)) | 0;\n    mid = (mid + Math.imul(al8, bh6)) | 0;\n    mid = (mid + Math.imul(ah8, bl6)) | 0;\n    hi = (hi + Math.imul(ah8, bh6)) | 0;\n    lo = (lo + Math.imul(al7, bl7)) | 0;\n    mid = (mid + Math.imul(al7, bh7)) | 0;\n    mid = (mid + Math.imul(ah7, bl7)) | 0;\n    hi = (hi + Math.imul(ah7, bh7)) | 0;\n    lo = (lo + Math.imul(al6, bl8)) | 0;\n    mid = (mid + Math.imul(al6, bh8)) | 0;\n    mid = (mid + Math.imul(ah6, bl8)) | 0;\n    hi = (hi + Math.imul(ah6, bh8)) | 0;\n    lo = (lo + Math.imul(al5, bl9)) | 0;\n    mid = (mid + Math.imul(al5, bh9)) | 0;\n    mid = (mid + Math.imul(ah5, bl9)) | 0;\n    hi = (hi + Math.imul(ah5, bh9)) | 0;\n    var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n    w14 &= 0x3ffffff;\n    /* k = 15 */\n    lo = Math.imul(al9, bl6);\n    mid = Math.imul(al9, bh6);\n    mid = (mid + Math.imul(ah9, bl6)) | 0;\n    hi = Math.imul(ah9, bh6);\n    lo = (lo + Math.imul(al8, bl7)) | 0;\n    mid = (mid + Math.imul(al8, bh7)) | 0;\n    mid = (mid + Math.imul(ah8, bl7)) | 0;\n    hi = (hi + Math.imul(ah8, bh7)) | 0;\n    lo = (lo + Math.imul(al7, bl8)) | 0;\n    mid = (mid + Math.imul(al7, bh8)) | 0;\n    mid = (mid + Math.imul(ah7, bl8)) | 0;\n    hi = (hi + Math.imul(ah7, bh8)) | 0;\n    lo = (lo + Math.imul(al6, bl9)) | 0;\n    mid = (mid + Math.imul(al6, bh9)) | 0;\n    mid = (mid + Math.imul(ah6, bl9)) | 0;\n    hi = (hi + Math.imul(ah6, bh9)) | 0;\n    var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n    w15 &= 0x3ffffff;\n    /* k = 16 */\n    lo = Math.imul(al9, bl7);\n    mid = Math.imul(al9, bh7);\n    mid = (mid + Math.imul(ah9, bl7)) | 0;\n    hi = Math.imul(ah9, bh7);\n    lo = (lo + Math.imul(al8, bl8)) | 0;\n    mid = (mid + Math.imul(al8, bh8)) | 0;\n    mid = (mid + Math.imul(ah8, bl8)) | 0;\n    hi = (hi + Math.imul(ah8, bh8)) | 0;\n    lo = (lo + Math.imul(al7, bl9)) | 0;\n    mid = (mid + Math.imul(al7, bh9)) | 0;\n    mid = (mid + Math.imul(ah7, bl9)) | 0;\n    hi = (hi + Math.imul(ah7, bh9)) | 0;\n    var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n    w16 &= 0x3ffffff;\n    /* k = 17 */\n    lo = Math.imul(al9, bl8);\n    mid = Math.imul(al9, bh8);\n    mid = (mid + Math.imul(ah9, bl8)) | 0;\n    hi = Math.imul(ah9, bh8);\n    lo = (lo + Math.imul(al8, bl9)) | 0;\n    mid = (mid + Math.imul(al8, bh9)) | 0;\n    mid = (mid + Math.imul(ah8, bl9)) | 0;\n    hi = (hi + Math.imul(ah8, bh9)) | 0;\n    var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n    w17 &= 0x3ffffff;\n    /* k = 18 */\n    lo = Math.imul(al9, bl9);\n    mid = Math.imul(al9, bh9);\n    mid = (mid + Math.imul(ah9, bl9)) | 0;\n    hi = Math.imul(ah9, bh9);\n    var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n    c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n    w18 &= 0x3ffffff;\n    o[0] = w0;\n    o[1] = w1;\n    o[2] = w2;\n    o[3] = w3;\n    o[4] = w4;\n    o[5] = w5;\n    o[6] = w6;\n    o[7] = w7;\n    o[8] = w8;\n    o[9] = w9;\n    o[10] = w10;\n    o[11] = w11;\n    o[12] = w12;\n    o[13] = w13;\n    o[14] = w14;\n    o[15] = w15;\n    o[16] = w16;\n    o[17] = w17;\n    o[18] = w18;\n    if (c !== 0) {\n      o[19] = c;\n      out.length++;\n    }\n    return out;\n  };\n\n  // Polyfill comb\n  if (!Math.imul) {\n    comb10MulTo = smallMulTo;\n  }\n\n  function bigMulTo (self, num, out) {\n    out.negative = num.negative ^ self.negative;\n    out.length = self.length + num.length;\n\n    var carry = 0;\n    var hncarry = 0;\n    for (var k = 0; k < out.length - 1; k++) {\n      // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n      // note that ncarry could be >= 0x3ffffff\n      var ncarry = hncarry;\n      hncarry = 0;\n      var rword = carry & 0x3ffffff;\n      var maxJ = Math.min(k, num.length - 1);\n      for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n        var i = k - j;\n        var a = self.words[i] | 0;\n        var b = num.words[j] | 0;\n        var r = a * b;\n\n        var lo = r & 0x3ffffff;\n        ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n        lo = (lo + rword) | 0;\n        rword = lo & 0x3ffffff;\n        ncarry = (ncarry + (lo >>> 26)) | 0;\n\n        hncarry += ncarry >>> 26;\n        ncarry &= 0x3ffffff;\n      }\n      out.words[k] = rword;\n      carry = ncarry;\n      ncarry = hncarry;\n    }\n    if (carry !== 0) {\n      out.words[k] = carry;\n    } else {\n      out.length--;\n    }\n\n    return out._strip();\n  }\n\n  function jumboMulTo (self, num, out) {\n    // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n    // var fftm = new FFTM();\n    // return fftm.mulp(self, num, out);\n    return bigMulTo(self, num, out);\n  }\n\n  BN.prototype.mulTo = function mulTo (num, out) {\n    var res;\n    var len = this.length + num.length;\n    if (this.length === 10 && num.length === 10) {\n      res = comb10MulTo(this, num, out);\n    } else if (len < 63) {\n      res = smallMulTo(this, num, out);\n    } else if (len < 1024) {\n      res = bigMulTo(this, num, out);\n    } else {\n      res = jumboMulTo(this, num, out);\n    }\n\n    return res;\n  };\n\n  // Cooley-Tukey algorithm for FFT\n  // slightly revisited to rely on looping instead of recursion\n\n  function FFTM (x, y) {\n    this.x = x;\n    this.y = y;\n  }\n\n  FFTM.prototype.makeRBT = function makeRBT (N) {\n    var t = new Array(N);\n    var l = BN.prototype._countBits(N) - 1;\n    for (var i = 0; i < N; i++) {\n      t[i] = this.revBin(i, l, N);\n    }\n\n    return t;\n  };\n\n  // Returns binary-reversed representation of `x`\n  FFTM.prototype.revBin = function revBin (x, l, N) {\n    if (x === 0 || x === N - 1) return x;\n\n    var rb = 0;\n    for (var i = 0; i < l; i++) {\n      rb |= (x & 1) << (l - i - 1);\n      x >>= 1;\n    }\n\n    return rb;\n  };\n\n  // Performs \"tweedling\" phase, therefore 'emulating'\n  // behaviour of the recursive algorithm\n  FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n    for (var i = 0; i < N; i++) {\n      rtws[i] = rws[rbt[i]];\n      itws[i] = iws[rbt[i]];\n    }\n  };\n\n  FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n    this.permute(rbt, rws, iws, rtws, itws, N);\n\n    for (var s = 1; s < N; s <<= 1) {\n      var l = s << 1;\n\n      var rtwdf = Math.cos(2 * Math.PI / l);\n      var itwdf = Math.sin(2 * Math.PI / l);\n\n      for (var p = 0; p < N; p += l) {\n        var rtwdf_ = rtwdf;\n        var itwdf_ = itwdf;\n\n        for (var j = 0; j < s; j++) {\n          var re = rtws[p + j];\n          var ie = itws[p + j];\n\n          var ro = rtws[p + j + s];\n          var io = itws[p + j + s];\n\n          var rx = rtwdf_ * ro - itwdf_ * io;\n\n          io = rtwdf_ * io + itwdf_ * ro;\n          ro = rx;\n\n          rtws[p + j] = re + ro;\n          itws[p + j] = ie + io;\n\n          rtws[p + j + s] = re - ro;\n          itws[p + j + s] = ie - io;\n\n          /* jshint maxdepth : false */\n          if (j !== l) {\n            rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n            itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n            rtwdf_ = rx;\n          }\n        }\n      }\n    }\n  };\n\n  FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n    var N = Math.max(m, n) | 1;\n    var odd = N & 1;\n    var i = 0;\n    for (N = N / 2 | 0; N; N = N >>> 1) {\n      i++;\n    }\n\n    return 1 << i + 1 + odd;\n  };\n\n  FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n    if (N <= 1) return;\n\n    for (var i = 0; i < N / 2; i++) {\n      var t = rws[i];\n\n      rws[i] = rws[N - i - 1];\n      rws[N - i - 1] = t;\n\n      t = iws[i];\n\n      iws[i] = -iws[N - i - 1];\n      iws[N - i - 1] = -t;\n    }\n  };\n\n  FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n    var carry = 0;\n    for (var i = 0; i < N / 2; i++) {\n      var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n        Math.round(ws[2 * i] / N) +\n        carry;\n\n      ws[i] = w & 0x3ffffff;\n\n      if (w < 0x4000000) {\n        carry = 0;\n      } else {\n        carry = w / 0x4000000 | 0;\n      }\n    }\n\n    return ws;\n  };\n\n  FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n    var carry = 0;\n    for (var i = 0; i < len; i++) {\n      carry = carry + (ws[i] | 0);\n\n      rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n      rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n    }\n\n    // Pad with zeroes\n    for (i = 2 * len; i < N; ++i) {\n      rws[i] = 0;\n    }\n\n    assert(carry === 0);\n    assert((carry & ~0x1fff) === 0);\n  };\n\n  FFTM.prototype.stub = function stub (N) {\n    var ph = new Array(N);\n    for (var i = 0; i < N; i++) {\n      ph[i] = 0;\n    }\n\n    return ph;\n  };\n\n  FFTM.prototype.mulp = function mulp (x, y, out) {\n    var N = 2 * this.guessLen13b(x.length, y.length);\n\n    var rbt = this.makeRBT(N);\n\n    var _ = this.stub(N);\n\n    var rws = new Array(N);\n    var rwst = new Array(N);\n    var iwst = new Array(N);\n\n    var nrws = new Array(N);\n    var nrwst = new Array(N);\n    var niwst = new Array(N);\n\n    var rmws = out.words;\n    rmws.length = N;\n\n    this.convert13b(x.words, x.length, rws, N);\n    this.convert13b(y.words, y.length, nrws, N);\n\n    this.transform(rws, _, rwst, iwst, N, rbt);\n    this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n    for (var i = 0; i < N; i++) {\n      var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n      iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n      rwst[i] = rx;\n    }\n\n    this.conjugate(rwst, iwst, N);\n    this.transform(rwst, iwst, rmws, _, N, rbt);\n    this.conjugate(rmws, _, N);\n    this.normalize13b(rmws, N);\n\n    out.negative = x.negative ^ y.negative;\n    out.length = x.length + y.length;\n    return out._strip();\n  };\n\n  // Multiply `this` by `num`\n  BN.prototype.mul = function mul (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return this.mulTo(num, out);\n  };\n\n  // Multiply employing FFT\n  BN.prototype.mulf = function mulf (num) {\n    var out = new BN(null);\n    out.words = new Array(this.length + num.length);\n    return jumboMulTo(this, num, out);\n  };\n\n  // In-place Multiplication\n  BN.prototype.imul = function imul (num) {\n    return this.clone().mulTo(num, this);\n  };\n\n  BN.prototype.imuln = function imuln (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n\n    // Carry\n    var carry = 0;\n    for (var i = 0; i < this.length; i++) {\n      var w = (this.words[i] | 0) * num;\n      var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      // NOTE: lo is 27bit maximum\n      carry += lo >>> 26;\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.muln = function muln (num) {\n    return this.clone().imuln(num);\n  };\n\n  // `this` * `this`\n  BN.prototype.sqr = function sqr () {\n    return this.mul(this);\n  };\n\n  // `this` * `this` in-place\n  BN.prototype.isqr = function isqr () {\n    return this.imul(this.clone());\n  };\n\n  // Math.pow(`this`, `num`)\n  BN.prototype.pow = function pow (num) {\n    var w = toBitArray(num);\n    if (w.length === 0) return new BN(1);\n\n    // Skip leading zeroes\n    var res = this;\n    for (var i = 0; i < w.length; i++, res = res.sqr()) {\n      if (w[i] !== 0) break;\n    }\n\n    if (++i < w.length) {\n      for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n        if (w[i] === 0) continue;\n\n        res = res.mul(q);\n      }\n    }\n\n    return res;\n  };\n\n  // Shift-left in-place\n  BN.prototype.iushln = function iushln (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n    var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n    var i;\n\n    if (r !== 0) {\n      var carry = 0;\n\n      for (i = 0; i < this.length; i++) {\n        var newCarry = this.words[i] & carryMask;\n        var c = ((this.words[i] | 0) - newCarry) << r;\n        this.words[i] = c | carry;\n        carry = newCarry >>> (26 - r);\n      }\n\n      if (carry) {\n        this.words[i] = carry;\n        this.length++;\n      }\n    }\n\n    if (s !== 0) {\n      for (i = this.length - 1; i >= 0; i--) {\n        this.words[i + s] = this.words[i];\n      }\n\n      for (i = 0; i < s; i++) {\n        this.words[i] = 0;\n      }\n\n      this.length += s;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishln = function ishln (bits) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushln(bits);\n  };\n\n  // Shift-right in-place\n  // NOTE: `hint` is a lowest bit before trailing zeroes\n  // NOTE: if `extended` is present - it will be filled with destroyed bits\n  BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var h;\n    if (hint) {\n      h = (hint - (hint % 26)) / 26;\n    } else {\n      h = 0;\n    }\n\n    var r = bits % 26;\n    var s = Math.min((bits - r) / 26, this.length);\n    var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n    var maskedWords = extended;\n\n    h -= s;\n    h = Math.max(0, h);\n\n    // Extended mode, copy masked part\n    if (maskedWords) {\n      for (var i = 0; i < s; i++) {\n        maskedWords.words[i] = this.words[i];\n      }\n      maskedWords.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all\n    } else if (this.length > s) {\n      this.length -= s;\n      for (i = 0; i < this.length; i++) {\n        this.words[i] = this.words[i + s];\n      }\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    var carry = 0;\n    for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n      var word = this.words[i] | 0;\n      this.words[i] = (carry << (26 - r)) | (word >>> r);\n      carry = word & mask;\n    }\n\n    // Push carried bits as a mask\n    if (maskedWords && carry !== 0) {\n      maskedWords.words[maskedWords.length++] = carry;\n    }\n\n    if (this.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n    // TODO(indutny): implement me\n    assert(this.negative === 0);\n    return this.iushrn(bits, hint, extended);\n  };\n\n  // Shift-left\n  BN.prototype.shln = function shln (bits) {\n    return this.clone().ishln(bits);\n  };\n\n  BN.prototype.ushln = function ushln (bits) {\n    return this.clone().iushln(bits);\n  };\n\n  // Shift-right\n  BN.prototype.shrn = function shrn (bits) {\n    return this.clone().ishrn(bits);\n  };\n\n  BN.prototype.ushrn = function ushrn (bits) {\n    return this.clone().iushrn(bits);\n  };\n\n  // Test if n bit is set\n  BN.prototype.testn = function testn (bit) {\n    assert(typeof bit === 'number' && bit >= 0);\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) return false;\n\n    // Check bit and return\n    var w = this.words[s];\n\n    return !!(w & q);\n  };\n\n  // Return only lowers bits of number (in-place)\n  BN.prototype.imaskn = function imaskn (bits) {\n    assert(typeof bits === 'number' && bits >= 0);\n    var r = bits % 26;\n    var s = (bits - r) / 26;\n\n    assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n    if (this.length <= s) {\n      return this;\n    }\n\n    if (r !== 0) {\n      s++;\n    }\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0) {\n      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n      this.words[this.length - 1] &= mask;\n    }\n\n    return this._strip();\n  };\n\n  // Return only lowers bits of number\n  BN.prototype.maskn = function maskn (bits) {\n    return this.clone().imaskn(bits);\n  };\n\n  // Add plain number `num` to `this`\n  BN.prototype.iaddn = function iaddn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.isubn(-num);\n\n    // Possible sign change\n    if (this.negative !== 0) {\n      if (this.length === 1 && (this.words[0] | 0) <= num) {\n        this.words[0] = num - (this.words[0] | 0);\n        this.negative = 0;\n        return this;\n      }\n\n      this.negative = 0;\n      this.isubn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    // Add without checks\n    return this._iaddn(num);\n  };\n\n  BN.prototype._iaddn = function _iaddn (num) {\n    this.words[0] += num;\n\n    // Carry\n    for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      if (i === this.length - 1) {\n        this.words[i + 1] = 1;\n      } else {\n        this.words[i + 1]++;\n      }\n    }\n    this.length = Math.max(this.length, i + 1);\n\n    return this;\n  };\n\n  // Subtract plain number `num` from `this`\n  BN.prototype.isubn = function isubn (num) {\n    assert(typeof num === 'number');\n    assert(num < 0x4000000);\n    if (num < 0) return this.iaddn(-num);\n\n    if (this.negative !== 0) {\n      this.negative = 0;\n      this.iaddn(num);\n      this.negative = 1;\n      return this;\n    }\n\n    this.words[0] -= num;\n\n    if (this.length === 1 && this.words[0] < 0) {\n      this.words[0] = -this.words[0];\n      this.negative = 1;\n    } else {\n      // Carry\n      for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n        this.words[i] += 0x4000000;\n        this.words[i + 1] -= 1;\n      }\n    }\n\n    return this._strip();\n  };\n\n  BN.prototype.addn = function addn (num) {\n    return this.clone().iaddn(num);\n  };\n\n  BN.prototype.subn = function subn (num) {\n    return this.clone().isubn(num);\n  };\n\n  BN.prototype.iabs = function iabs () {\n    this.negative = 0;\n\n    return this;\n  };\n\n  BN.prototype.abs = function abs () {\n    return this.clone().iabs();\n  };\n\n  BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n    var len = num.length + shift;\n    var i;\n\n    this._expand(len);\n\n    var w;\n    var carry = 0;\n    for (i = 0; i < num.length; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      var right = (num.words[i] | 0) * mul;\n      w -= right & 0x3ffffff;\n      carry = (w >> 26) - ((right / 0x4000000) | 0);\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n    for (; i < this.length - shift; i++) {\n      w = (this.words[i + shift] | 0) + carry;\n      carry = w >> 26;\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0) return this._strip();\n\n    // Subtraction overflow\n    assert(carry === -1);\n    carry = 0;\n    for (i = 0; i < this.length; i++) {\n      w = -(this.words[i] | 0) + carry;\n      carry = w >> 26;\n      this.words[i] = w & 0x3ffffff;\n    }\n    this.negative = 1;\n\n    return this._strip();\n  };\n\n  BN.prototype._wordDiv = function _wordDiv (num, mode) {\n    var shift = this.length - num.length;\n\n    var a = this.clone();\n    var b = num;\n\n    // Normalize\n    var bhi = b.words[b.length - 1] | 0;\n    var bhiBits = this._countBits(bhi);\n    shift = 26 - bhiBits;\n    if (shift !== 0) {\n      b = b.ushln(shift);\n      a.iushln(shift);\n      bhi = b.words[b.length - 1] | 0;\n    }\n\n    // Initialize quotient\n    var m = a.length - b.length;\n    var q;\n\n    if (mode !== 'mod') {\n      q = new BN(null);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n      for (var i = 0; i < q.length; i++) {\n        q.words[i] = 0;\n      }\n    }\n\n    var diff = a.clone()._ishlnsubmul(b, 1, m);\n    if (diff.negative === 0) {\n      a = diff;\n      if (q) {\n        q.words[m] = 1;\n      }\n    }\n\n    for (var j = m - 1; j >= 0; j--) {\n      var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n        (a.words[b.length + j - 1] | 0);\n\n      // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n      // (0x7ffffff)\n      qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n      while (a.negative !== 0) {\n        qj--;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        if (!a.isZero()) {\n          a.negative ^= 1;\n        }\n      }\n      if (q) {\n        q.words[j] = qj;\n      }\n    }\n    if (q) {\n      q._strip();\n    }\n    a._strip();\n\n    // Denormalize\n    if (mode !== 'div' && shift !== 0) {\n      a.iushrn(shift);\n    }\n\n    return {\n      div: q || null,\n      mod: a\n    };\n  };\n\n  // NOTE: 1) `mode` can be set to `mod` to request mod only,\n  //       to `div` to request div only, or be absent to\n  //       request both div & mod\n  //       2) `positive` is true if unsigned mod is requested\n  BN.prototype.divmod = function divmod (num, mode, positive) {\n    assert(!num.isZero());\n\n    if (this.isZero()) {\n      return {\n        div: new BN(0),\n        mod: new BN(0)\n      };\n    }\n\n    var div, mod, res;\n    if (this.negative !== 0 && num.negative === 0) {\n      res = this.neg().divmod(num, mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.iadd(num);\n        }\n      }\n\n      return {\n        div: div,\n        mod: mod\n      };\n    }\n\n    if (this.negative === 0 && num.negative !== 0) {\n      res = this.divmod(num.neg(), mode);\n\n      if (mode !== 'mod') {\n        div = res.div.neg();\n      }\n\n      return {\n        div: div,\n        mod: res.mod\n      };\n    }\n\n    if ((this.negative & num.negative) !== 0) {\n      res = this.neg().divmod(num.neg(), mode);\n\n      if (mode !== 'div') {\n        mod = res.mod.neg();\n        if (positive && mod.negative !== 0) {\n          mod.isub(num);\n        }\n      }\n\n      return {\n        div: res.div,\n        mod: mod\n      };\n    }\n\n    // Both numbers are positive at this point\n\n    // Strip both numbers to approximate shift value\n    if (num.length > this.length || this.cmp(num) < 0) {\n      return {\n        div: new BN(0),\n        mod: this\n      };\n    }\n\n    // Very short reduction\n    if (num.length === 1) {\n      if (mode === 'div') {\n        return {\n          div: this.divn(num.words[0]),\n          mod: null\n        };\n      }\n\n      if (mode === 'mod') {\n        return {\n          div: null,\n          mod: new BN(this.modrn(num.words[0]))\n        };\n      }\n\n      return {\n        div: this.divn(num.words[0]),\n        mod: new BN(this.modrn(num.words[0]))\n      };\n    }\n\n    return this._wordDiv(num, mode);\n  };\n\n  // Find `this` / `num`\n  BN.prototype.div = function div (num) {\n    return this.divmod(num, 'div', false).div;\n  };\n\n  // Find `this` % `num`\n  BN.prototype.mod = function mod (num) {\n    return this.divmod(num, 'mod', false).mod;\n  };\n\n  BN.prototype.umod = function umod (num) {\n    return this.divmod(num, 'mod', true).mod;\n  };\n\n  // Find Round(`this` / `num`)\n  BN.prototype.divRound = function divRound (num) {\n    var dm = this.divmod(num);\n\n    // Fast case - exact division\n    if (dm.mod.isZero()) return dm.div;\n\n    var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n    var half = num.ushrn(1);\n    var r2 = num.andln(1);\n    var cmp = mod.cmp(half);\n\n    // Round down\n    if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n    // Round up\n    return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n  };\n\n  BN.prototype.modrn = function modrn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n    var p = (1 << 26) % num;\n\n    var acc = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      acc = (p * acc + (this.words[i] | 0)) % num;\n    }\n\n    return isNegNum ? -acc : acc;\n  };\n\n  // WARNING: DEPRECATED\n  BN.prototype.modn = function modn (num) {\n    return this.modrn(num);\n  };\n\n  // In-place division by number\n  BN.prototype.idivn = function idivn (num) {\n    var isNegNum = num < 0;\n    if (isNegNum) num = -num;\n\n    assert(num <= 0x3ffffff);\n\n    var carry = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var w = (this.words[i] | 0) + carry * 0x4000000;\n      this.words[i] = (w / num) | 0;\n      carry = w % num;\n    }\n\n    this._strip();\n    return isNegNum ? this.ineg() : this;\n  };\n\n  BN.prototype.divn = function divn (num) {\n    return this.clone().idivn(num);\n  };\n\n  BN.prototype.egcd = function egcd (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var x = this;\n    var y = p.clone();\n\n    if (x.negative !== 0) {\n      x = x.umod(p);\n    } else {\n      x = x.clone();\n    }\n\n    // A * x + B * y = x\n    var A = new BN(1);\n    var B = new BN(0);\n\n    // C * x + D * y = y\n    var C = new BN(0);\n    var D = new BN(1);\n\n    var g = 0;\n\n    while (x.isEven() && y.isEven()) {\n      x.iushrn(1);\n      y.iushrn(1);\n      ++g;\n    }\n\n    var yp = y.clone();\n    var xp = x.clone();\n\n    while (!x.isZero()) {\n      for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        x.iushrn(i);\n        while (i-- > 0) {\n          if (A.isOdd() || B.isOdd()) {\n            A.iadd(yp);\n            B.isub(xp);\n          }\n\n          A.iushrn(1);\n          B.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        y.iushrn(j);\n        while (j-- > 0) {\n          if (C.isOdd() || D.isOdd()) {\n            C.iadd(yp);\n            D.isub(xp);\n          }\n\n          C.iushrn(1);\n          D.iushrn(1);\n        }\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    return {\n      a: C,\n      b: D,\n      gcd: y.iushln(g)\n    };\n  };\n\n  // This is reduced incarnation of the binary EEA\n  // above, designated to invert members of the\n  // _prime_ fields F(p) at a maximal speed\n  BN.prototype._invmp = function _invmp (p) {\n    assert(p.negative === 0);\n    assert(!p.isZero());\n\n    var a = this;\n    var b = p.clone();\n\n    if (a.negative !== 0) {\n      a = a.umod(p);\n    } else {\n      a = a.clone();\n    }\n\n    var x1 = new BN(1);\n    var x2 = new BN(0);\n\n    var delta = b.clone();\n\n    while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n      for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n      if (i > 0) {\n        a.iushrn(i);\n        while (i-- > 0) {\n          if (x1.isOdd()) {\n            x1.iadd(delta);\n          }\n\n          x1.iushrn(1);\n        }\n      }\n\n      for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n      if (j > 0) {\n        b.iushrn(j);\n        while (j-- > 0) {\n          if (x2.isOdd()) {\n            x2.iadd(delta);\n          }\n\n          x2.iushrn(1);\n        }\n      }\n\n      if (a.cmp(b) >= 0) {\n        a.isub(b);\n        x1.isub(x2);\n      } else {\n        b.isub(a);\n        x2.isub(x1);\n      }\n    }\n\n    var res;\n    if (a.cmpn(1) === 0) {\n      res = x1;\n    } else {\n      res = x2;\n    }\n\n    if (res.cmpn(0) < 0) {\n      res.iadd(p);\n    }\n\n    return res;\n  };\n\n  BN.prototype.gcd = function gcd (num) {\n    if (this.isZero()) return num.abs();\n    if (num.isZero()) return this.abs();\n\n    var a = this.clone();\n    var b = num.clone();\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two\n    for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n      a.iushrn(1);\n      b.iushrn(1);\n    }\n\n    do {\n      while (a.isEven()) {\n        a.iushrn(1);\n      }\n      while (b.isEven()) {\n        b.iushrn(1);\n      }\n\n      var r = a.cmp(b);\n      if (r < 0) {\n        // Swap `a` and `b` to make `a` always bigger than `b`\n        var t = a;\n        a = b;\n        b = t;\n      } else if (r === 0 || b.cmpn(1) === 0) {\n        break;\n      }\n\n      a.isub(b);\n    } while (true);\n\n    return b.iushln(shift);\n  };\n\n  // Invert number in the field F(num)\n  BN.prototype.invm = function invm (num) {\n    return this.egcd(num).a.umod(num);\n  };\n\n  BN.prototype.isEven = function isEven () {\n    return (this.words[0] & 1) === 0;\n  };\n\n  BN.prototype.isOdd = function isOdd () {\n    return (this.words[0] & 1) === 1;\n  };\n\n  // And first word and num\n  BN.prototype.andln = function andln (num) {\n    return this.words[0] & num;\n  };\n\n  // Increment at the bit position in-line\n  BN.prototype.bincn = function bincn (bit) {\n    assert(typeof bit === 'number');\n    var r = bit % 26;\n    var s = (bit - r) / 26;\n    var q = 1 << r;\n\n    // Fast case: bit is much higher than all existing words\n    if (this.length <= s) {\n      this._expand(s + 1);\n      this.words[s] |= q;\n      return this;\n    }\n\n    // Add bit and propagate, if needed\n    var carry = q;\n    for (var i = s; carry !== 0 && i < this.length; i++) {\n      var w = this.words[i] | 0;\n      w += carry;\n      carry = w >>> 26;\n      w &= 0x3ffffff;\n      this.words[i] = w;\n    }\n    if (carry !== 0) {\n      this.words[i] = carry;\n      this.length++;\n    }\n    return this;\n  };\n\n  BN.prototype.isZero = function isZero () {\n    return this.length === 1 && this.words[0] === 0;\n  };\n\n  BN.prototype.cmpn = function cmpn (num) {\n    var negative = num < 0;\n\n    if (this.negative !== 0 && !negative) return -1;\n    if (this.negative === 0 && negative) return 1;\n\n    this._strip();\n\n    var res;\n    if (this.length > 1) {\n      res = 1;\n    } else {\n      if (negative) {\n        num = -num;\n      }\n\n      assert(num <= 0x3ffffff, 'Number is too big');\n\n      var w = this.words[0] | 0;\n      res = w === num ? 0 : w < num ? -1 : 1;\n    }\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Compare two numbers and return:\n  // 1 - if `this` > `num`\n  // 0 - if `this` == `num`\n  // -1 - if `this` < `num`\n  BN.prototype.cmp = function cmp (num) {\n    if (this.negative !== 0 && num.negative === 0) return -1;\n    if (this.negative === 0 && num.negative !== 0) return 1;\n\n    var res = this.ucmp(num);\n    if (this.negative !== 0) return -res | 0;\n    return res;\n  };\n\n  // Unsigned comparison\n  BN.prototype.ucmp = function ucmp (num) {\n    // At this point both numbers have the same sign\n    if (this.length > num.length) return 1;\n    if (this.length < num.length) return -1;\n\n    var res = 0;\n    for (var i = this.length - 1; i >= 0; i--) {\n      var a = this.words[i] | 0;\n      var b = num.words[i] | 0;\n\n      if (a === b) continue;\n      if (a < b) {\n        res = -1;\n      } else if (a > b) {\n        res = 1;\n      }\n      break;\n    }\n    return res;\n  };\n\n  BN.prototype.gtn = function gtn (num) {\n    return this.cmpn(num) === 1;\n  };\n\n  BN.prototype.gt = function gt (num) {\n    return this.cmp(num) === 1;\n  };\n\n  BN.prototype.gten = function gten (num) {\n    return this.cmpn(num) >= 0;\n  };\n\n  BN.prototype.gte = function gte (num) {\n    return this.cmp(num) >= 0;\n  };\n\n  BN.prototype.ltn = function ltn (num) {\n    return this.cmpn(num) === -1;\n  };\n\n  BN.prototype.lt = function lt (num) {\n    return this.cmp(num) === -1;\n  };\n\n  BN.prototype.lten = function lten (num) {\n    return this.cmpn(num) <= 0;\n  };\n\n  BN.prototype.lte = function lte (num) {\n    return this.cmp(num) <= 0;\n  };\n\n  BN.prototype.eqn = function eqn (num) {\n    return this.cmpn(num) === 0;\n  };\n\n  BN.prototype.eq = function eq (num) {\n    return this.cmp(num) === 0;\n  };\n\n  //\n  // A reduce context, could be using montgomery or something better, depending\n  // on the `m` itself.\n  //\n  BN.red = function red (num) {\n    return new Red(num);\n  };\n\n  BN.prototype.toRed = function toRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    assert(this.negative === 0, 'red works only with positives');\n    return ctx.convertTo(this)._forceRed(ctx);\n  };\n\n  BN.prototype.fromRed = function fromRed () {\n    assert(this.red, 'fromRed works only with numbers in reduction context');\n    return this.red.convertFrom(this);\n  };\n\n  BN.prototype._forceRed = function _forceRed (ctx) {\n    this.red = ctx;\n    return this;\n  };\n\n  BN.prototype.forceRed = function forceRed (ctx) {\n    assert(!this.red, 'Already a number in reduction context');\n    return this._forceRed(ctx);\n  };\n\n  BN.prototype.redAdd = function redAdd (num) {\n    assert(this.red, 'redAdd works only with red numbers');\n    return this.red.add(this, num);\n  };\n\n  BN.prototype.redIAdd = function redIAdd (num) {\n    assert(this.red, 'redIAdd works only with red numbers');\n    return this.red.iadd(this, num);\n  };\n\n  BN.prototype.redSub = function redSub (num) {\n    assert(this.red, 'redSub works only with red numbers');\n    return this.red.sub(this, num);\n  };\n\n  BN.prototype.redISub = function redISub (num) {\n    assert(this.red, 'redISub works only with red numbers');\n    return this.red.isub(this, num);\n  };\n\n  BN.prototype.redShl = function redShl (num) {\n    assert(this.red, 'redShl works only with red numbers');\n    return this.red.shl(this, num);\n  };\n\n  BN.prototype.redMul = function redMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.mul(this, num);\n  };\n\n  BN.prototype.redIMul = function redIMul (num) {\n    assert(this.red, 'redMul works only with red numbers');\n    this.red._verify2(this, num);\n    return this.red.imul(this, num);\n  };\n\n  BN.prototype.redSqr = function redSqr () {\n    assert(this.red, 'redSqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqr(this);\n  };\n\n  BN.prototype.redISqr = function redISqr () {\n    assert(this.red, 'redISqr works only with red numbers');\n    this.red._verify1(this);\n    return this.red.isqr(this);\n  };\n\n  // Square root over p\n  BN.prototype.redSqrt = function redSqrt () {\n    assert(this.red, 'redSqrt works only with red numbers');\n    this.red._verify1(this);\n    return this.red.sqrt(this);\n  };\n\n  BN.prototype.redInvm = function redInvm () {\n    assert(this.red, 'redInvm works only with red numbers');\n    this.red._verify1(this);\n    return this.red.invm(this);\n  };\n\n  // Return negative clone of `this` % `red modulo`\n  BN.prototype.redNeg = function redNeg () {\n    assert(this.red, 'redNeg works only with red numbers');\n    this.red._verify1(this);\n    return this.red.neg(this);\n  };\n\n  BN.prototype.redPow = function redPow (num) {\n    assert(this.red && !num.red, 'redPow(normalNum)');\n    this.red._verify1(this);\n    return this.red.pow(this, num);\n  };\n\n  // Prime numbers with efficient reduction\n  var primes = {\n    k256: null,\n    p224: null,\n    p192: null,\n    p25519: null\n  };\n\n  // Pseudo-Mersenne prime\n  function MPrime (name, p) {\n    // P = 2 ^ N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = new BN(1).iushln(this.n).isub(this.p);\n\n    this.tmp = this._tmp();\n  }\n\n  MPrime.prototype._tmp = function _tmp () {\n    var tmp = new BN(null);\n    tmp.words = new Array(Math.ceil(this.n / 13));\n    return tmp;\n  };\n\n  MPrime.prototype.ireduce = function ireduce (num) {\n    // Assumes that `num` is less than `P^2`\n    // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n    var r = num;\n    var rlen;\n\n    do {\n      this.split(r, this.tmp);\n      r = this.imulK(r);\n      r = r.iadd(this.tmp);\n      rlen = r.bitLength();\n    } while (rlen > this.n);\n\n    var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n    if (cmp === 0) {\n      r.words[0] = 0;\n      r.length = 1;\n    } else if (cmp > 0) {\n      r.isub(this.p);\n    } else {\n      if (r.strip !== undefined) {\n        // r is a BN v4 instance\n        r.strip();\n      } else {\n        // r is a BN v5 instance\n        r._strip();\n      }\n    }\n\n    return r;\n  };\n\n  MPrime.prototype.split = function split (input, out) {\n    input.iushrn(this.n, 0, out);\n  };\n\n  MPrime.prototype.imulK = function imulK (num) {\n    return num.imul(this.k);\n  };\n\n  function K256 () {\n    MPrime.call(\n      this,\n      'k256',\n      'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n  }\n  inherits(K256, MPrime);\n\n  K256.prototype.split = function split (input, output) {\n    // 256 = 9 * 26 + 22\n    var mask = 0x3fffff;\n\n    var outLen = Math.min(input.length, 9);\n    for (var i = 0; i < outLen; i++) {\n      output.words[i] = input.words[i];\n    }\n    output.length = outLen;\n\n    if (input.length <= 9) {\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs\n    var prev = input.words[9];\n    output.words[output.length++] = prev & mask;\n\n    for (i = 10; i < input.length; i++) {\n      var next = input.words[i] | 0;\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n      prev = next;\n    }\n    prev >>>= 22;\n    input.words[i - 10] = prev;\n    if (prev === 0 && input.length > 10) {\n      input.length -= 10;\n    } else {\n      input.length -= 9;\n    }\n  };\n\n  K256.prototype.imulK = function imulK (num) {\n    // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n    num.words[num.length] = 0;\n    num.words[num.length + 1] = 0;\n    num.length += 2;\n\n    // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    var lo = 0;\n    for (var i = 0; i < num.length; i++) {\n      var w = num.words[i] | 0;\n      lo += w * 0x3d1;\n      num.words[i] = lo & 0x3ffffff;\n      lo = w * 0x40 + ((lo / 0x4000000) | 0);\n    }\n\n    // Fast length reduction\n    if (num.words[num.length - 1] === 0) {\n      num.length--;\n      if (num.words[num.length - 1] === 0) {\n        num.length--;\n      }\n    }\n    return num;\n  };\n\n  function P224 () {\n    MPrime.call(\n      this,\n      'p224',\n      'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n  }\n  inherits(P224, MPrime);\n\n  function P192 () {\n    MPrime.call(\n      this,\n      'p192',\n      'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n  }\n  inherits(P192, MPrime);\n\n  function P25519 () {\n    // 2 ^ 255 - 19\n    MPrime.call(\n      this,\n      '25519',\n      '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n  }\n  inherits(P25519, MPrime);\n\n  P25519.prototype.imulK = function imulK (num) {\n    // K = 0x13\n    var carry = 0;\n    for (var i = 0; i < num.length; i++) {\n      var hi = (num.words[i] | 0) * 0x13 + carry;\n      var lo = hi & 0x3ffffff;\n      hi >>>= 26;\n\n      num.words[i] = lo;\n      carry = hi;\n    }\n    if (carry !== 0) {\n      num.words[num.length++] = carry;\n    }\n    return num;\n  };\n\n  // Exported mostly for testing purposes, use plain name instead\n  BN._prime = function prime (name) {\n    // Cached version of prime\n    if (primes[name]) return primes[name];\n\n    var prime;\n    if (name === 'k256') {\n      prime = new K256();\n    } else if (name === 'p224') {\n      prime = new P224();\n    } else if (name === 'p192') {\n      prime = new P192();\n    } else if (name === 'p25519') {\n      prime = new P25519();\n    } else {\n      throw new Error('Unknown prime ' + name);\n    }\n    primes[name] = prime;\n\n    return prime;\n  };\n\n  //\n  // Base reduction engine\n  //\n  function Red (m) {\n    if (typeof m === 'string') {\n      var prime = BN._prime(m);\n      this.m = prime.p;\n      this.prime = prime;\n    } else {\n      assert(m.gtn(1), 'modulus must be greater than 1');\n      this.m = m;\n      this.prime = null;\n    }\n  }\n\n  Red.prototype._verify1 = function _verify1 (a) {\n    assert(a.negative === 0, 'red works only with positives');\n    assert(a.red, 'red works only with red numbers');\n  };\n\n  Red.prototype._verify2 = function _verify2 (a, b) {\n    assert((a.negative | b.negative) === 0, 'red works only with positives');\n    assert(a.red && a.red === b.red,\n      'red works only with red numbers');\n  };\n\n  Red.prototype.imod = function imod (a) {\n    if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\n    move(a, a.umod(this.m)._forceRed(this));\n    return a;\n  };\n\n  Red.prototype.neg = function neg (a) {\n    if (a.isZero()) {\n      return a.clone();\n    }\n\n    return this.m.sub(a)._forceRed(this);\n  };\n\n  Red.prototype.add = function add (a, b) {\n    this._verify2(a, b);\n\n    var res = a.add(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.iadd = function iadd (a, b) {\n    this._verify2(a, b);\n\n    var res = a.iadd(b);\n    if (res.cmp(this.m) >= 0) {\n      res.isub(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.sub = function sub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.sub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res._forceRed(this);\n  };\n\n  Red.prototype.isub = function isub (a, b) {\n    this._verify2(a, b);\n\n    var res = a.isub(b);\n    if (res.cmpn(0) < 0) {\n      res.iadd(this.m);\n    }\n    return res;\n  };\n\n  Red.prototype.shl = function shl (a, num) {\n    this._verify1(a);\n    return this.imod(a.ushln(num));\n  };\n\n  Red.prototype.imul = function imul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  };\n\n  Red.prototype.mul = function mul (a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  };\n\n  Red.prototype.isqr = function isqr (a) {\n    return this.imul(a, a.clone());\n  };\n\n  Red.prototype.sqr = function sqr (a) {\n    return this.mul(a, a);\n  };\n\n  Red.prototype.sqrt = function sqrt (a) {\n    if (a.isZero()) return a.clone();\n\n    var mod3 = this.m.andln(3);\n    assert(mod3 % 2 === 1);\n\n    // Fast case\n    if (mod3 === 3) {\n      var pow = this.m.add(new BN(1)).iushrn(2);\n      return this.pow(a, pow);\n    }\n\n    // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n    //\n    // Find Q and S, that Q * 2 ^ S = (P - 1)\n    var q = this.m.subn(1);\n    var s = 0;\n    while (!q.isZero() && q.andln(1) === 0) {\n      s++;\n      q.iushrn(1);\n    }\n    assert(!q.isZero());\n\n    var one = new BN(1).toRed(this);\n    var nOne = one.redNeg();\n\n    // Find quadratic non-residue\n    // NOTE: Max is such because of generalized Riemann hypothesis.\n    var lpow = this.m.subn(1).iushrn(1);\n    var z = this.m.bitLength();\n    z = new BN(2 * z * z).toRed(this);\n\n    while (this.pow(z, lpow).cmp(nOne) !== 0) {\n      z.redIAdd(nOne);\n    }\n\n    var c = this.pow(z, q);\n    var r = this.pow(a, q.addn(1).iushrn(1));\n    var t = this.pow(a, q);\n    var m = s;\n    while (t.cmp(one) !== 0) {\n      var tmp = t;\n      for (var i = 0; tmp.cmp(one) !== 0; i++) {\n        tmp = tmp.redSqr();\n      }\n      assert(i < m);\n      var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n      r = r.redMul(b);\n      c = b.redSqr();\n      t = t.redMul(c);\n      m = i;\n    }\n\n    return r;\n  };\n\n  Red.prototype.invm = function invm (a) {\n    var inv = a._invmp(this.m);\n    if (inv.negative !== 0) {\n      inv.negative = 0;\n      return this.imod(inv).redNeg();\n    } else {\n      return this.imod(inv);\n    }\n  };\n\n  Red.prototype.pow = function pow (a, num) {\n    if (num.isZero()) return new BN(1).toRed(this);\n    if (num.cmpn(1) === 0) return a.clone();\n\n    var windowSize = 4;\n    var wnd = new Array(1 << windowSize);\n    wnd[0] = new BN(1).toRed(this);\n    wnd[1] = a;\n    for (var i = 2; i < wnd.length; i++) {\n      wnd[i] = this.mul(wnd[i - 1], a);\n    }\n\n    var res = wnd[0];\n    var current = 0;\n    var currentLen = 0;\n    var start = num.bitLength() % 26;\n    if (start === 0) {\n      start = 26;\n    }\n\n    for (i = num.length - 1; i >= 0; i--) {\n      var word = num.words[i];\n      for (var j = start - 1; j >= 0; j--) {\n        var bit = (word >> j) & 1;\n        if (res !== wnd[0]) {\n          res = this.sqr(res);\n        }\n\n        if (bit === 0 && current === 0) {\n          currentLen = 0;\n          continue;\n        }\n\n        current <<= 1;\n        current |= bit;\n        currentLen++;\n        if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n        res = this.mul(res, wnd[current]);\n        currentLen = 0;\n        current = 0;\n      }\n      start = 26;\n    }\n\n    return res;\n  };\n\n  Red.prototype.convertTo = function convertTo (num) {\n    var r = num.umod(this.m);\n\n    return r === num ? r.clone() : r;\n  };\n\n  Red.prototype.convertFrom = function convertFrom (num) {\n    var res = num.clone();\n    res.red = null;\n    return res;\n  };\n\n  //\n  // Montgomery method engine\n  //\n\n  BN.mont = function mont (num) {\n    return new Mont(num);\n  };\n\n  function Mont (m) {\n    Red.call(this, m);\n\n    this.shift = this.m.bitLength();\n    if (this.shift % 26 !== 0) {\n      this.shift += 26 - (this.shift % 26);\n    }\n\n    this.r = new BN(1).iushln(this.shift);\n    this.r2 = this.imod(this.r.sqr());\n    this.rinv = this.r._invmp(this.m);\n\n    this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n    this.minv = this.minv.umod(this.r);\n    this.minv = this.r.sub(this.minv);\n  }\n  inherits(Mont, Red);\n\n  Mont.prototype.convertTo = function convertTo (num) {\n    return this.imod(num.ushln(this.shift));\n  };\n\n  Mont.prototype.convertFrom = function convertFrom (num) {\n    var r = this.imod(num.mul(this.rinv));\n    r.red = null;\n    return r;\n  };\n\n  Mont.prototype.imul = function imul (a, b) {\n    if (a.isZero() || b.isZero()) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    var t = a.imul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.mul = function mul (a, b) {\n    if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n    var t = a.mul(b);\n    var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n    var u = t.isub(c).iushrn(this.shift);\n    var res = u;\n    if (u.cmp(this.m) >= 0) {\n      res = u.isub(this.m);\n    } else if (u.cmpn(0) < 0) {\n      res = u.iadd(this.m);\n    }\n\n    return res._forceRed(this);\n  };\n\n  Mont.prototype.invm = function invm (a) {\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    var res = this.imod(a._invmp(this.m).mul(this.r2));\n    return res._forceRed(this);\n  };\n})(typeof module === 'undefined' || module, this);\n","var asn1 = require('./asn1')\nvar aesid = require('./aesid.json')\nvar fixProc = require('./fixProc')\nvar ciphers = require('browserify-aes')\nvar compat = require('pbkdf2')\nvar Buffer = require('safe-buffer').Buffer\nmodule.exports = parseKeys\n\nfunction parseKeys (buffer) {\n  var password\n  if (typeof buffer === 'object' && !Buffer.isBuffer(buffer)) {\n    password = buffer.passphrase\n    buffer = buffer.key\n  }\n  if (typeof buffer === 'string') {\n    buffer = Buffer.from(buffer)\n  }\n\n  var stripped = fixProc(buffer, password)\n\n  var type = stripped.tag\n  var data = stripped.data\n  var subtype, ndata\n  switch (type) {\n    case 'CERTIFICATE':\n      ndata = asn1.certificate.decode(data, 'der').tbsCertificate.subjectPublicKeyInfo\n      // falls through\n    case 'PUBLIC KEY':\n      if (!ndata) {\n        ndata = asn1.PublicKey.decode(data, 'der')\n      }\n      subtype = ndata.algorithm.algorithm.join('.')\n      switch (subtype) {\n        case '1.2.840.113549.1.1.1':\n          return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, 'der')\n        case '1.2.840.10045.2.1':\n          ndata.subjectPrivateKey = ndata.subjectPublicKey\n          return {\n            type: 'ec',\n            data: ndata\n          }\n        case '1.2.840.10040.4.1':\n          ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, 'der')\n          return {\n            type: 'dsa',\n            data: ndata.algorithm.params\n          }\n        default: throw new Error('unknown key id ' + subtype)\n      }\n      // throw new Error('unknown key type ' + type)\n    case 'ENCRYPTED PRIVATE KEY':\n      data = asn1.EncryptedPrivateKey.decode(data, 'der')\n      data = decrypt(data, password)\n      // falls through\n    case 'PRIVATE KEY':\n      ndata = asn1.PrivateKey.decode(data, 'der')\n      subtype = ndata.algorithm.algorithm.join('.')\n      switch (subtype) {\n        case '1.2.840.113549.1.1.1':\n          return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, 'der')\n        case '1.2.840.10045.2.1':\n          return {\n            curve: ndata.algorithm.curve,\n            privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, 'der').privateKey\n          }\n        case '1.2.840.10040.4.1':\n          ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, 'der')\n          return {\n            type: 'dsa',\n            params: ndata.algorithm.params\n          }\n        default: throw new Error('unknown key id ' + subtype)\n      }\n      // throw new Error('unknown key type ' + type)\n    case 'RSA PUBLIC KEY':\n      return asn1.RSAPublicKey.decode(data, 'der')\n    case 'RSA PRIVATE KEY':\n      return asn1.RSAPrivateKey.decode(data, 'der')\n    case 'DSA PRIVATE KEY':\n      return {\n        type: 'dsa',\n        params: asn1.DSAPrivateKey.decode(data, 'der')\n      }\n    case 'EC PRIVATE KEY':\n      data = asn1.ECPrivateKey.decode(data, 'der')\n      return {\n        curve: data.parameters.value,\n        privateKey: data.privateKey\n      }\n    default: throw new Error('unknown key type ' + type)\n  }\n}\nparseKeys.signature = asn1.signature\nfunction decrypt (data, password) {\n  var salt = data.algorithm.decrypt.kde.kdeparams.salt\n  var iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10)\n  var algo = aesid[data.algorithm.decrypt.cipher.algo.join('.')]\n  var iv = data.algorithm.decrypt.cipher.iv\n  var cipherText = data.subjectPrivateKey\n  var keylen = parseInt(algo.split('-')[1], 10) / 8\n  var key = compat.pbkdf2Sync(password, salt, iters, keylen, 'sha1')\n  var cipher = ciphers.createDecipheriv(algo, key, iv)\n  var out = []\n  out.push(cipher.update(cipherText))\n  out.push(cipher.final())\n  return Buffer.concat(out)\n}\n","// from https://github.com/indutny/self-signed/blob/gh-pages/lib/asn1.js\n// Fedor, you are amazing.\n'use strict'\n\nvar asn1 = require('asn1.js')\n\nexports.certificate = require('./certificate')\n\nvar RSAPrivateKey = asn1.define('RSAPrivateKey', function () {\n  this.seq().obj(\n    this.key('version').int(),\n    this.key('modulus').int(),\n    this.key('publicExponent').int(),\n    this.key('privateExponent').int(),\n    this.key('prime1').int(),\n    this.key('prime2').int(),\n    this.key('exponent1').int(),\n    this.key('exponent2').int(),\n    this.key('coefficient').int()\n  )\n})\nexports.RSAPrivateKey = RSAPrivateKey\n\nvar RSAPublicKey = asn1.define('RSAPublicKey', function () {\n  this.seq().obj(\n    this.key('modulus').int(),\n    this.key('publicExponent').int()\n  )\n})\nexports.RSAPublicKey = RSAPublicKey\n\nvar PublicKey = asn1.define('SubjectPublicKeyInfo', function () {\n  this.seq().obj(\n    this.key('algorithm').use(AlgorithmIdentifier),\n    this.key('subjectPublicKey').bitstr()\n  )\n})\nexports.PublicKey = PublicKey\n\nvar AlgorithmIdentifier = asn1.define('AlgorithmIdentifier', function () {\n  this.seq().obj(\n    this.key('algorithm').objid(),\n    this.key('none').null_().optional(),\n    this.key('curve').objid().optional(),\n    this.key('params').seq().obj(\n      this.key('p').int(),\n      this.key('q').int(),\n      this.key('g').int()\n    ).optional()\n  )\n})\n\nvar PrivateKeyInfo = asn1.define('PrivateKeyInfo', function () {\n  this.seq().obj(\n    this.key('version').int(),\n    this.key('algorithm').use(AlgorithmIdentifier),\n    this.key('subjectPrivateKey').octstr()\n  )\n})\nexports.PrivateKey = PrivateKeyInfo\nvar EncryptedPrivateKeyInfo = asn1.define('EncryptedPrivateKeyInfo', function () {\n  this.seq().obj(\n    this.key('algorithm').seq().obj(\n      this.key('id').objid(),\n      this.key('decrypt').seq().obj(\n        this.key('kde').seq().obj(\n          this.key('id').objid(),\n          this.key('kdeparams').seq().obj(\n            this.key('salt').octstr(),\n            this.key('iters').int()\n          )\n        ),\n        this.key('cipher').seq().obj(\n          this.key('algo').objid(),\n          this.key('iv').octstr()\n        )\n      )\n    ),\n    this.key('subjectPrivateKey').octstr()\n  )\n})\n\nexports.EncryptedPrivateKey = EncryptedPrivateKeyInfo\n\nvar DSAPrivateKey = asn1.define('DSAPrivateKey', function () {\n  this.seq().obj(\n    this.key('version').int(),\n    this.key('p').int(),\n    this.key('q').int(),\n    this.key('g').int(),\n    this.key('pub_key').int(),\n    this.key('priv_key').int()\n  )\n})\nexports.DSAPrivateKey = DSAPrivateKey\n\nexports.DSAparam = asn1.define('DSAparam', function () {\n  this.int()\n})\n\nvar ECPrivateKey = asn1.define('ECPrivateKey', function () {\n  this.seq().obj(\n    this.key('version').int(),\n    this.key('privateKey').octstr(),\n    this.key('parameters').optional().explicit(0).use(ECParameters),\n    this.key('publicKey').optional().explicit(1).bitstr()\n  )\n})\nexports.ECPrivateKey = ECPrivateKey\n\nvar ECParameters = asn1.define('ECParameters', function () {\n  this.choice({\n    namedCurve: this.objid()\n  })\n})\n\nexports.signature = asn1.define('signature', function () {\n  this.seq().obj(\n    this.key('r').int(),\n    this.key('s').int()\n  )\n})\n","'use strict';\n\nconst asn1 = exports;\n\nasn1.bignum = require('bn.js');\n\nasn1.define = require('./asn1/api').define;\nasn1.base = require('./asn1/base');\nasn1.constants = require('./asn1/constants');\nasn1.decoders = require('./asn1/decoders');\nasn1.encoders = require('./asn1/encoders');\n","'use strict';\n\nconst encoders = require('./encoders');\nconst decoders = require('./decoders');\nconst inherits = require('inherits');\n\nconst api = exports;\n\napi.define = function define(name, body) {\n  return new Entity(name, body);\n};\n\nfunction Entity(name, body) {\n  this.name = name;\n  this.body = body;\n\n  this.decoders = {};\n  this.encoders = {};\n}\n\nEntity.prototype._createNamed = function createNamed(Base) {\n  const name = this.name;\n\n  function Generated(entity) {\n    this._initNamed(entity, name);\n  }\n  inherits(Generated, Base);\n  Generated.prototype._initNamed = function _initNamed(entity, name) {\n    Base.call(this, entity, name);\n  };\n\n  return new Generated(this);\n};\n\nEntity.prototype._getDecoder = function _getDecoder(enc) {\n  enc = enc || 'der';\n  // Lazily create decoder\n  if (!this.decoders.hasOwnProperty(enc))\n    this.decoders[enc] = this._createNamed(decoders[enc]);\n  return this.decoders[enc];\n};\n\nEntity.prototype.decode = function decode(data, enc, options) {\n  return this._getDecoder(enc).decode(data, options);\n};\n\nEntity.prototype._getEncoder = function _getEncoder(enc) {\n  enc = enc || 'der';\n  // Lazily create encoder\n  if (!this.encoders.hasOwnProperty(enc))\n    this.encoders[enc] = this._createNamed(encoders[enc]);\n  return this.encoders[enc];\n};\n\nEntity.prototype.encode = function encode(data, enc, /* internal */ reporter) {\n  return this._getEncoder(enc).encode(data, reporter);\n};\n","'use strict';\n\nconst encoders = exports;\n\nencoders.der = require('./der');\nencoders.pem = require('./pem');\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DEREncoder(entity) {\n  this.enc = 'der';\n  this.name = entity.name;\n  this.entity = entity;\n\n  // Construct base tree\n  this.tree = new DERNode();\n  this.tree._init(entity.body);\n}\nmodule.exports = DEREncoder;\n\nDEREncoder.prototype.encode = function encode(data, reporter) {\n  return this.tree._encode(data, reporter).join();\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n  Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._encodeComposite = function encodeComposite(tag,\n  primitive,\n  cls,\n  content) {\n  const encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n\n  // Short form\n  if (content.length < 0x80) {\n    const header = Buffer.alloc(2);\n    header[0] = encodedTag;\n    header[1] = content.length;\n    return this._createEncoderBuffer([ header, content ]);\n  }\n\n  // Long form\n  // Count octets required to store length\n  let lenOctets = 1;\n  for (let i = content.length; i >= 0x100; i >>= 8)\n    lenOctets++;\n\n  const header = Buffer.alloc(1 + 1 + lenOctets);\n  header[0] = encodedTag;\n  header[1] = 0x80 | lenOctets;\n\n  for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8)\n    header[i] = j & 0xff;\n\n  return this._createEncoderBuffer([ header, content ]);\n};\n\nDERNode.prototype._encodeStr = function encodeStr(str, tag) {\n  if (tag === 'bitstr') {\n    return this._createEncoderBuffer([ str.unused | 0, str.data ]);\n  } else if (tag === 'bmpstr') {\n    const buf = Buffer.alloc(str.length * 2);\n    for (let i = 0; i < str.length; i++) {\n      buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n    }\n    return this._createEncoderBuffer(buf);\n  } else if (tag === 'numstr') {\n    if (!this._isNumstr(str)) {\n      return this.reporter.error('Encoding of string type: numstr supports ' +\n                                 'only digits and space');\n    }\n    return this._createEncoderBuffer(str);\n  } else if (tag === 'printstr') {\n    if (!this._isPrintstr(str)) {\n      return this.reporter.error('Encoding of string type: printstr supports ' +\n                                 'only latin upper and lower case letters, ' +\n                                 'digits, space, apostrophe, left and rigth ' +\n                                 'parenthesis, plus sign, comma, hyphen, ' +\n                                 'dot, slash, colon, equal sign, ' +\n                                 'question mark');\n    }\n    return this._createEncoderBuffer(str);\n  } else if (/str$/.test(tag)) {\n    return this._createEncoderBuffer(str);\n  } else if (tag === 'objDesc') {\n    return this._createEncoderBuffer(str);\n  } else {\n    return this.reporter.error('Encoding of string type: ' + tag +\n                               ' unsupported');\n  }\n};\n\nDERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) {\n  if (typeof id === 'string') {\n    if (!values)\n      return this.reporter.error('string objid given, but no values map found');\n    if (!values.hasOwnProperty(id))\n      return this.reporter.error('objid not found in values map');\n    id = values[id].split(/[\\s.]+/g);\n    for (let i = 0; i < id.length; i++)\n      id[i] |= 0;\n  } else if (Array.isArray(id)) {\n    id = id.slice();\n    for (let i = 0; i < id.length; i++)\n      id[i] |= 0;\n  }\n\n  if (!Array.isArray(id)) {\n    return this.reporter.error('objid() should be either array or string, ' +\n                               'got: ' + JSON.stringify(id));\n  }\n\n  if (!relative) {\n    if (id[1] >= 40)\n      return this.reporter.error('Second objid identifier OOB');\n    id.splice(0, 2, id[0] * 40 + id[1]);\n  }\n\n  // Count number of octets\n  let size = 0;\n  for (let i = 0; i < id.length; i++) {\n    let ident = id[i];\n    for (size++; ident >= 0x80; ident >>= 7)\n      size++;\n  }\n\n  const objid = Buffer.alloc(size);\n  let offset = objid.length - 1;\n  for (let i = id.length - 1; i >= 0; i--) {\n    let ident = id[i];\n    objid[offset--] = ident & 0x7f;\n    while ((ident >>= 7) > 0)\n      objid[offset--] = 0x80 | (ident & 0x7f);\n  }\n\n  return this._createEncoderBuffer(objid);\n};\n\nfunction two(num) {\n  if (num < 10)\n    return '0' + num;\n  else\n    return num;\n}\n\nDERNode.prototype._encodeTime = function encodeTime(time, tag) {\n  let str;\n  const date = new Date(time);\n\n  if (tag === 'gentime') {\n    str = [\n      two(date.getUTCFullYear()),\n      two(date.getUTCMonth() + 1),\n      two(date.getUTCDate()),\n      two(date.getUTCHours()),\n      two(date.getUTCMinutes()),\n      two(date.getUTCSeconds()),\n      'Z'\n    ].join('');\n  } else if (tag === 'utctime') {\n    str = [\n      two(date.getUTCFullYear() % 100),\n      two(date.getUTCMonth() + 1),\n      two(date.getUTCDate()),\n      two(date.getUTCHours()),\n      two(date.getUTCMinutes()),\n      two(date.getUTCSeconds()),\n      'Z'\n    ].join('');\n  } else {\n    this.reporter.error('Encoding ' + tag + ' time is not supported yet');\n  }\n\n  return this._encodeStr(str, 'octstr');\n};\n\nDERNode.prototype._encodeNull = function encodeNull() {\n  return this._createEncoderBuffer('');\n};\n\nDERNode.prototype._encodeInt = function encodeInt(num, values) {\n  if (typeof num === 'string') {\n    if (!values)\n      return this.reporter.error('String int or enum given, but no values map');\n    if (!values.hasOwnProperty(num)) {\n      return this.reporter.error('Values map doesn\\'t contain: ' +\n                                 JSON.stringify(num));\n    }\n    num = values[num];\n  }\n\n  // Bignum, assume big endian\n  if (typeof num !== 'number' && !Buffer.isBuffer(num)) {\n    const numArray = num.toArray();\n    if (!num.sign && numArray[0] & 0x80) {\n      numArray.unshift(0);\n    }\n    num = Buffer.from(numArray);\n  }\n\n  if (Buffer.isBuffer(num)) {\n    let size = num.length;\n    if (num.length === 0)\n      size++;\n\n    const out = Buffer.alloc(size);\n    num.copy(out);\n    if (num.length === 0)\n      out[0] = 0;\n    return this._createEncoderBuffer(out);\n  }\n\n  if (num < 0x80)\n    return this._createEncoderBuffer(num);\n\n  if (num < 0x100)\n    return this._createEncoderBuffer([0, num]);\n\n  let size = 1;\n  for (let i = num; i >= 0x100; i >>= 8)\n    size++;\n\n  const out = new Array(size);\n  for (let i = out.length - 1; i >= 0; i--) {\n    out[i] = num & 0xff;\n    num >>= 8;\n  }\n  if(out[0] & 0x80) {\n    out.unshift(0);\n  }\n\n  return this._createEncoderBuffer(Buffer.from(out));\n};\n\nDERNode.prototype._encodeBool = function encodeBool(value) {\n  return this._createEncoderBuffer(value ? 0xff : 0);\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n  if (typeof entity === 'function')\n    entity = entity(obj);\n  return entity._getEncoder('der').tree;\n};\n\nDERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) {\n  const state = this._baseState;\n  let i;\n  if (state['default'] === null)\n    return false;\n\n  const data = dataBuffer.join();\n  if (state.defaultBuffer === undefined)\n    state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join();\n\n  if (data.length !== state.defaultBuffer.length)\n    return false;\n\n  for (i=0; i < data.length; i++)\n    if (data[i] !== state.defaultBuffer[i])\n      return false;\n\n  return true;\n};\n\n// Utility methods\n\nfunction encodeTag(tag, primitive, cls, reporter) {\n  let res;\n\n  if (tag === 'seqof')\n    tag = 'seq';\n  else if (tag === 'setof')\n    tag = 'set';\n\n  if (der.tagByName.hasOwnProperty(tag))\n    res = der.tagByName[tag];\n  else if (typeof tag === 'number' && (tag | 0) === tag)\n    res = tag;\n  else\n    return reporter.error('Unknown tag: ' + tag);\n\n  if (res >= 0x1f)\n    return reporter.error('Multi-octet tag encoding unsupported');\n\n  if (!primitive)\n    res |= 0x20;\n\n  res |= (der.tagClassByName[cls || 'universal'] << 6);\n\n  return res;\n}\n","/* eslint-disable node/no-deprecated-api */\n\n'use strict'\n\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\nvar safer = {}\n\nvar key\n\nfor (key in buffer) {\n  if (!buffer.hasOwnProperty(key)) continue\n  if (key === 'SlowBuffer' || key === 'Buffer') continue\n  safer[key] = buffer[key]\n}\n\nvar Safer = safer.Buffer = {}\nfor (key in Buffer) {\n  if (!Buffer.hasOwnProperty(key)) continue\n  if (key === 'allocUnsafe' || key === 'allocUnsafeSlow') continue\n  Safer[key] = Buffer[key]\n}\n\nsafer.Buffer.prototype = Buffer.prototype\n\nif (!Safer.from || Safer.from === Uint8Array.from) {\n  Safer.from = function (value, encodingOrOffset, length) {\n    if (typeof value === 'number') {\n      throw new TypeError('The \"value\" argument must not be of type number. Received type ' + typeof value)\n    }\n    if (value && typeof value.length === 'undefined') {\n      throw new TypeError('The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type ' + typeof value)\n    }\n    return Buffer(value, encodingOrOffset, length)\n  }\n}\n\nif (!Safer.alloc) {\n  Safer.alloc = function (size, fill, encoding) {\n    if (typeof size !== 'number') {\n      throw new TypeError('The \"size\" argument must be of type number. Received type ' + typeof size)\n    }\n    if (size < 0 || size >= 2 * (1 << 30)) {\n      throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n    }\n    var buf = Buffer(size)\n    if (!fill || fill.length === 0) {\n      buf.fill(0)\n    } else if (typeof encoding === 'string') {\n      buf.fill(fill, encoding)\n    } else {\n      buf.fill(fill)\n    }\n    return buf\n  }\n}\n\nif (!safer.kStringMaxLength) {\n  try {\n    safer.kStringMaxLength = process.binding('buffer').kStringMaxLength\n  } catch (e) {\n    // we can't determine kStringMaxLength in environments where process.binding\n    // is unsupported, so let's not set it\n  }\n}\n\nif (!safer.constants) {\n  safer.constants = {\n    MAX_LENGTH: safer.kMaxLength\n  }\n  if (safer.kStringMaxLength) {\n    safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength\n  }\n}\n\nmodule.exports = safer\n","'use strict';\n\nconst Reporter = require('../base/reporter').Reporter;\nconst EncoderBuffer = require('../base/buffer').EncoderBuffer;\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst assert = require('minimalistic-assert');\n\n// Supported tags\nconst tags = [\n  'seq', 'seqof', 'set', 'setof', 'objid', 'bool',\n  'gentime', 'utctime', 'null_', 'enum', 'int', 'objDesc',\n  'bitstr', 'bmpstr', 'charstr', 'genstr', 'graphstr', 'ia5str', 'iso646str',\n  'numstr', 'octstr', 'printstr', 't61str', 'unistr', 'utf8str', 'videostr'\n];\n\n// Public methods list\nconst methods = [\n  'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice',\n  'any', 'contains'\n].concat(tags);\n\n// Overrided methods list\nconst overrided = [\n  '_peekTag', '_decodeTag', '_use',\n  '_decodeStr', '_decodeObjid', '_decodeTime',\n  '_decodeNull', '_decodeInt', '_decodeBool', '_decodeList',\n\n  '_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime',\n  '_encodeNull', '_encodeInt', '_encodeBool'\n];\n\nfunction Node(enc, parent, name) {\n  const state = {};\n  this._baseState = state;\n\n  state.name = name;\n  state.enc = enc;\n\n  state.parent = parent || null;\n  state.children = null;\n\n  // State\n  state.tag = null;\n  state.args = null;\n  state.reverseArgs = null;\n  state.choice = null;\n  state.optional = false;\n  state.any = false;\n  state.obj = false;\n  state.use = null;\n  state.useDecoder = null;\n  state.key = null;\n  state['default'] = null;\n  state.explicit = null;\n  state.implicit = null;\n  state.contains = null;\n\n  // Should create new instance on each method\n  if (!state.parent) {\n    state.children = [];\n    this._wrap();\n  }\n}\nmodule.exports = Node;\n\nconst stateProps = [\n  'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice',\n  'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit',\n  'implicit', 'contains'\n];\n\nNode.prototype.clone = function clone() {\n  const state = this._baseState;\n  const cstate = {};\n  stateProps.forEach(function(prop) {\n    cstate[prop] = state[prop];\n  });\n  const res = new this.constructor(cstate.parent);\n  res._baseState = cstate;\n  return res;\n};\n\nNode.prototype._wrap = function wrap() {\n  const state = this._baseState;\n  methods.forEach(function(method) {\n    this[method] = function _wrappedMethod() {\n      const clone = new this.constructor(this);\n      state.children.push(clone);\n      return clone[method].apply(clone, arguments);\n    };\n  }, this);\n};\n\nNode.prototype._init = function init(body) {\n  const state = this._baseState;\n\n  assert(state.parent === null);\n  body.call(this);\n\n  // Filter children\n  state.children = state.children.filter(function(child) {\n    return child._baseState.parent === this;\n  }, this);\n  assert.equal(state.children.length, 1, 'Root node can have only one child');\n};\n\nNode.prototype._useArgs = function useArgs(args) {\n  const state = this._baseState;\n\n  // Filter children and args\n  const children = args.filter(function(arg) {\n    return arg instanceof this.constructor;\n  }, this);\n  args = args.filter(function(arg) {\n    return !(arg instanceof this.constructor);\n  }, this);\n\n  if (children.length !== 0) {\n    assert(state.children === null);\n    state.children = children;\n\n    // Replace parent to maintain backward link\n    children.forEach(function(child) {\n      child._baseState.parent = this;\n    }, this);\n  }\n  if (args.length !== 0) {\n    assert(state.args === null);\n    state.args = args;\n    state.reverseArgs = args.map(function(arg) {\n      if (typeof arg !== 'object' || arg.constructor !== Object)\n        return arg;\n\n      const res = {};\n      Object.keys(arg).forEach(function(key) {\n        if (key == (key | 0))\n          key |= 0;\n        const value = arg[key];\n        res[value] = key;\n      });\n      return res;\n    });\n  }\n};\n\n//\n// Overrided methods\n//\n\noverrided.forEach(function(method) {\n  Node.prototype[method] = function _overrided() {\n    const state = this._baseState;\n    throw new Error(method + ' not implemented for encoding: ' + state.enc);\n  };\n});\n\n//\n// Public methods\n//\n\ntags.forEach(function(tag) {\n  Node.prototype[tag] = function _tagMethod() {\n    const state = this._baseState;\n    const args = Array.prototype.slice.call(arguments);\n\n    assert(state.tag === null);\n    state.tag = tag;\n\n    this._useArgs(args);\n\n    return this;\n  };\n});\n\nNode.prototype.use = function use(item) {\n  assert(item);\n  const state = this._baseState;\n\n  assert(state.use === null);\n  state.use = item;\n\n  return this;\n};\n\nNode.prototype.optional = function optional() {\n  const state = this._baseState;\n\n  state.optional = true;\n\n  return this;\n};\n\nNode.prototype.def = function def(val) {\n  const state = this._baseState;\n\n  assert(state['default'] === null);\n  state['default'] = val;\n  state.optional = true;\n\n  return this;\n};\n\nNode.prototype.explicit = function explicit(num) {\n  const state = this._baseState;\n\n  assert(state.explicit === null && state.implicit === null);\n  state.explicit = num;\n\n  return this;\n};\n\nNode.prototype.implicit = function implicit(num) {\n  const state = this._baseState;\n\n  assert(state.explicit === null && state.implicit === null);\n  state.implicit = num;\n\n  return this;\n};\n\nNode.prototype.obj = function obj() {\n  const state = this._baseState;\n  const args = Array.prototype.slice.call(arguments);\n\n  state.obj = true;\n\n  if (args.length !== 0)\n    this._useArgs(args);\n\n  return this;\n};\n\nNode.prototype.key = function key(newKey) {\n  const state = this._baseState;\n\n  assert(state.key === null);\n  state.key = newKey;\n\n  return this;\n};\n\nNode.prototype.any = function any() {\n  const state = this._baseState;\n\n  state.any = true;\n\n  return this;\n};\n\nNode.prototype.choice = function choice(obj) {\n  const state = this._baseState;\n\n  assert(state.choice === null);\n  state.choice = obj;\n  this._useArgs(Object.keys(obj).map(function(key) {\n    return obj[key];\n  }));\n\n  return this;\n};\n\nNode.prototype.contains = function contains(item) {\n  const state = this._baseState;\n\n  assert(state.use === null);\n  state.contains = item;\n\n  return this;\n};\n\n//\n// Decoding\n//\n\nNode.prototype._decode = function decode(input, options) {\n  const state = this._baseState;\n\n  // Decode root node\n  if (state.parent === null)\n    return input.wrapResult(state.children[0]._decode(input, options));\n\n  let result = state['default'];\n  let present = true;\n\n  let prevKey = null;\n  if (state.key !== null)\n    prevKey = input.enterKey(state.key);\n\n  // Check if tag is there\n  if (state.optional) {\n    let tag = null;\n    if (state.explicit !== null)\n      tag = state.explicit;\n    else if (state.implicit !== null)\n      tag = state.implicit;\n    else if (state.tag !== null)\n      tag = state.tag;\n\n    if (tag === null && !state.any) {\n      // Trial and Error\n      const save = input.save();\n      try {\n        if (state.choice === null)\n          this._decodeGeneric(state.tag, input, options);\n        else\n          this._decodeChoice(input, options);\n        present = true;\n      } catch (e) {\n        present = false;\n      }\n      input.restore(save);\n    } else {\n      present = this._peekTag(input, tag, state.any);\n\n      if (input.isError(present))\n        return present;\n    }\n  }\n\n  // Push object on stack\n  let prevObj;\n  if (state.obj && present)\n    prevObj = input.enterObject();\n\n  if (present) {\n    // Unwrap explicit values\n    if (state.explicit !== null) {\n      const explicit = this._decodeTag(input, state.explicit);\n      if (input.isError(explicit))\n        return explicit;\n      input = explicit;\n    }\n\n    const start = input.offset;\n\n    // Unwrap implicit and normal values\n    if (state.use === null && state.choice === null) {\n      let save;\n      if (state.any)\n        save = input.save();\n      const body = this._decodeTag(\n        input,\n        state.implicit !== null ? state.implicit : state.tag,\n        state.any\n      );\n      if (input.isError(body))\n        return body;\n\n      if (state.any)\n        result = input.raw(save);\n      else\n        input = body;\n    }\n\n    if (options && options.track && state.tag !== null)\n      options.track(input.path(), start, input.length, 'tagged');\n\n    if (options && options.track && state.tag !== null)\n      options.track(input.path(), input.offset, input.length, 'content');\n\n    // Select proper method for tag\n    if (state.any) {\n      // no-op\n    } else if (state.choice === null) {\n      result = this._decodeGeneric(state.tag, input, options);\n    } else {\n      result = this._decodeChoice(input, options);\n    }\n\n    if (input.isError(result))\n      return result;\n\n    // Decode children\n    if (!state.any && state.choice === null && state.children !== null) {\n      state.children.forEach(function decodeChildren(child) {\n        // NOTE: We are ignoring errors here, to let parser continue with other\n        // parts of encoded data\n        child._decode(input, options);\n      });\n    }\n\n    // Decode contained/encoded by schema, only in bit or octet strings\n    if (state.contains && (state.tag === 'octstr' || state.tag === 'bitstr')) {\n      const data = new DecoderBuffer(result);\n      result = this._getUse(state.contains, input._reporterState.obj)\n        ._decode(data, options);\n    }\n  }\n\n  // Pop object\n  if (state.obj && present)\n    result = input.leaveObject(prevObj);\n\n  // Set key\n  if (state.key !== null && (result !== null || present === true))\n    input.leaveKey(prevKey, state.key, result);\n  else if (prevKey !== null)\n    input.exitKey(prevKey);\n\n  return result;\n};\n\nNode.prototype._decodeGeneric = function decodeGeneric(tag, input, options) {\n  const state = this._baseState;\n\n  if (tag === 'seq' || tag === 'set')\n    return null;\n  if (tag === 'seqof' || tag === 'setof')\n    return this._decodeList(input, tag, state.args[0], options);\n  else if (/str$/.test(tag))\n    return this._decodeStr(input, tag, options);\n  else if (tag === 'objid' && state.args)\n    return this._decodeObjid(input, state.args[0], state.args[1], options);\n  else if (tag === 'objid')\n    return this._decodeObjid(input, null, null, options);\n  else if (tag === 'gentime' || tag === 'utctime')\n    return this._decodeTime(input, tag, options);\n  else if (tag === 'null_')\n    return this._decodeNull(input, options);\n  else if (tag === 'bool')\n    return this._decodeBool(input, options);\n  else if (tag === 'objDesc')\n    return this._decodeStr(input, tag, options);\n  else if (tag === 'int' || tag === 'enum')\n    return this._decodeInt(input, state.args && state.args[0], options);\n\n  if (state.use !== null) {\n    return this._getUse(state.use, input._reporterState.obj)\n      ._decode(input, options);\n  } else {\n    return input.error('unknown tag: ' + tag);\n  }\n};\n\nNode.prototype._getUse = function _getUse(entity, obj) {\n\n  const state = this._baseState;\n  // Create altered use decoder if implicit is set\n  state.useDecoder = this._use(entity, obj);\n  assert(state.useDecoder._baseState.parent === null);\n  state.useDecoder = state.useDecoder._baseState.children[0];\n  if (state.implicit !== state.useDecoder._baseState.implicit) {\n    state.useDecoder = state.useDecoder.clone();\n    state.useDecoder._baseState.implicit = state.implicit;\n  }\n  return state.useDecoder;\n};\n\nNode.prototype._decodeChoice = function decodeChoice(input, options) {\n  const state = this._baseState;\n  let result = null;\n  let match = false;\n\n  Object.keys(state.choice).some(function(key) {\n    const save = input.save();\n    const node = state.choice[key];\n    try {\n      const value = node._decode(input, options);\n      if (input.isError(value))\n        return false;\n\n      result = { type: key, value: value };\n      match = true;\n    } catch (e) {\n      input.restore(save);\n      return false;\n    }\n    return true;\n  }, this);\n\n  if (!match)\n    return input.error('Choice not matched');\n\n  return result;\n};\n\n//\n// Encoding\n//\n\nNode.prototype._createEncoderBuffer = function createEncoderBuffer(data) {\n  return new EncoderBuffer(data, this.reporter);\n};\n\nNode.prototype._encode = function encode(data, reporter, parent) {\n  const state = this._baseState;\n  if (state['default'] !== null && state['default'] === data)\n    return;\n\n  const result = this._encodeValue(data, reporter, parent);\n  if (result === undefined)\n    return;\n\n  if (this._skipDefault(result, reporter, parent))\n    return;\n\n  return result;\n};\n\nNode.prototype._encodeValue = function encode(data, reporter, parent) {\n  const state = this._baseState;\n\n  // Decode root node\n  if (state.parent === null)\n    return state.children[0]._encode(data, reporter || new Reporter());\n\n  let result = null;\n\n  // Set reporter to share it with a child class\n  this.reporter = reporter;\n\n  // Check if data is there\n  if (state.optional && data === undefined) {\n    if (state['default'] !== null)\n      data = state['default'];\n    else\n      return;\n  }\n\n  // Encode children first\n  let content = null;\n  let primitive = false;\n  if (state.any) {\n    // Anything that was given is translated to buffer\n    result = this._createEncoderBuffer(data);\n  } else if (state.choice) {\n    result = this._encodeChoice(data, reporter);\n  } else if (state.contains) {\n    content = this._getUse(state.contains, parent)._encode(data, reporter);\n    primitive = true;\n  } else if (state.children) {\n    content = state.children.map(function(child) {\n      if (child._baseState.tag === 'null_')\n        return child._encode(null, reporter, data);\n\n      if (child._baseState.key === null)\n        return reporter.error('Child should have a key');\n      const prevKey = reporter.enterKey(child._baseState.key);\n\n      if (typeof data !== 'object')\n        return reporter.error('Child expected, but input is not object');\n\n      const res = child._encode(data[child._baseState.key], reporter, data);\n      reporter.leaveKey(prevKey);\n\n      return res;\n    }, this).filter(function(child) {\n      return child;\n    });\n    content = this._createEncoderBuffer(content);\n  } else {\n    if (state.tag === 'seqof' || state.tag === 'setof') {\n      // TODO(indutny): this should be thrown on DSL level\n      if (!(state.args && state.args.length === 1))\n        return reporter.error('Too many args for : ' + state.tag);\n\n      if (!Array.isArray(data))\n        return reporter.error('seqof/setof, but data is not Array');\n\n      const child = this.clone();\n      child._baseState.implicit = null;\n      content = this._createEncoderBuffer(data.map(function(item) {\n        const state = this._baseState;\n\n        return this._getUse(state.args[0], data)._encode(item, reporter);\n      }, child));\n    } else if (state.use !== null) {\n      result = this._getUse(state.use, parent)._encode(data, reporter);\n    } else {\n      content = this._encodePrimitive(state.tag, data);\n      primitive = true;\n    }\n  }\n\n  // Encode data itself\n  if (!state.any && state.choice === null) {\n    const tag = state.implicit !== null ? state.implicit : state.tag;\n    const cls = state.implicit === null ? 'universal' : 'context';\n\n    if (tag === null) {\n      if (state.use === null)\n        reporter.error('Tag could be omitted only for .use()');\n    } else {\n      if (state.use === null)\n        result = this._encodeComposite(tag, primitive, cls, content);\n    }\n  }\n\n  // Wrap in explicit\n  if (state.explicit !== null)\n    result = this._encodeComposite(state.explicit, false, 'context', result);\n\n  return result;\n};\n\nNode.prototype._encodeChoice = function encodeChoice(data, reporter) {\n  const state = this._baseState;\n\n  const node = state.choice[data.type];\n  if (!node) {\n    assert(\n      false,\n      data.type + ' not found in ' +\n            JSON.stringify(Object.keys(state.choice)));\n  }\n  return node._encode(data.value, reporter);\n};\n\nNode.prototype._encodePrimitive = function encodePrimitive(tag, data) {\n  const state = this._baseState;\n\n  if (/str$/.test(tag))\n    return this._encodeStr(data, tag);\n  else if (tag === 'objid' && state.args)\n    return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n  else if (tag === 'objid')\n    return this._encodeObjid(data, null, null);\n  else if (tag === 'gentime' || tag === 'utctime')\n    return this._encodeTime(data, tag);\n  else if (tag === 'null_')\n    return this._encodeNull();\n  else if (tag === 'int' || tag === 'enum')\n    return this._encodeInt(data, state.args && state.reverseArgs[0]);\n  else if (tag === 'bool')\n    return this._encodeBool(data);\n  else if (tag === 'objDesc')\n    return this._encodeStr(data, tag);\n  else\n    throw new Error('Unsupported tag: ' + tag);\n};\n\nNode.prototype._isNumstr = function isNumstr(str) {\n  return /^[0-9 ]*$/.test(str);\n};\n\nNode.prototype._isPrintstr = function isPrintstr(str) {\n  return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n};\n","'use strict';\n\nconst inherits = require('inherits');\n\nfunction Reporter(options) {\n  this._reporterState = {\n    obj: null,\n    path: [],\n    options: options || {},\n    errors: []\n  };\n}\nexports.Reporter = Reporter;\n\nReporter.prototype.isError = function isError(obj) {\n  return obj instanceof ReporterError;\n};\n\nReporter.prototype.save = function save() {\n  const state = this._reporterState;\n\n  return { obj: state.obj, pathLen: state.path.length };\n};\n\nReporter.prototype.restore = function restore(data) {\n  const state = this._reporterState;\n\n  state.obj = data.obj;\n  state.path = state.path.slice(0, data.pathLen);\n};\n\nReporter.prototype.enterKey = function enterKey(key) {\n  return this._reporterState.path.push(key);\n};\n\nReporter.prototype.exitKey = function exitKey(index) {\n  const state = this._reporterState;\n\n  state.path = state.path.slice(0, index - 1);\n};\n\nReporter.prototype.leaveKey = function leaveKey(index, key, value) {\n  const state = this._reporterState;\n\n  this.exitKey(index);\n  if (state.obj !== null)\n    state.obj[key] = value;\n};\n\nReporter.prototype.path = function path() {\n  return this._reporterState.path.join('/');\n};\n\nReporter.prototype.enterObject = function enterObject() {\n  const state = this._reporterState;\n\n  const prev = state.obj;\n  state.obj = {};\n  return prev;\n};\n\nReporter.prototype.leaveObject = function leaveObject(prev) {\n  const state = this._reporterState;\n\n  const now = state.obj;\n  state.obj = prev;\n  return now;\n};\n\nReporter.prototype.error = function error(msg) {\n  let err;\n  const state = this._reporterState;\n\n  const inherited = msg instanceof ReporterError;\n  if (inherited) {\n    err = msg;\n  } else {\n    err = new ReporterError(state.path.map(function(elem) {\n      return '[' + JSON.stringify(elem) + ']';\n    }).join(''), msg.message || msg, msg.stack);\n  }\n\n  if (!state.options.partial)\n    throw err;\n\n  if (!inherited)\n    state.errors.push(err);\n\n  return err;\n};\n\nReporter.prototype.wrapResult = function wrapResult(result) {\n  const state = this._reporterState;\n  if (!state.options.partial)\n    return result;\n\n  return {\n    result: this.isError(result) ? null : result,\n    errors: state.errors\n  };\n};\n\nfunction ReporterError(path, msg) {\n  this.path = path;\n  this.rethrow(msg);\n}\ninherits(ReporterError, Error);\n\nReporterError.prototype.rethrow = function rethrow(msg) {\n  this.message = msg + ' at: ' + (this.path || '(shallow)');\n  if (Error.captureStackTrace)\n    Error.captureStackTrace(this, ReporterError);\n\n  if (!this.stack) {\n    try {\n      // IE only adds stack when thrown\n      throw new Error(this.message);\n    } catch (e) {\n      this.stack = e.stack;\n    }\n  }\n  return this;\n};\n","'use strict';\n\nconst inherits = require('inherits');\nconst Reporter = require('../base/reporter').Reporter;\nconst Buffer = require('safer-buffer').Buffer;\n\nfunction DecoderBuffer(base, options) {\n  Reporter.call(this, options);\n  if (!Buffer.isBuffer(base)) {\n    this.error('Input not Buffer');\n    return;\n  }\n\n  this.base = base;\n  this.offset = 0;\n  this.length = base.length;\n}\ninherits(DecoderBuffer, Reporter);\nexports.DecoderBuffer = DecoderBuffer;\n\nDecoderBuffer.isDecoderBuffer = function isDecoderBuffer(data) {\n  if (data instanceof DecoderBuffer) {\n    return true;\n  }\n\n  // Or accept compatible API\n  const isCompatible = typeof data === 'object' &&\n    Buffer.isBuffer(data.base) &&\n    data.constructor.name === 'DecoderBuffer' &&\n    typeof data.offset === 'number' &&\n    typeof data.length === 'number' &&\n    typeof data.save === 'function' &&\n    typeof data.restore === 'function' &&\n    typeof data.isEmpty === 'function' &&\n    typeof data.readUInt8 === 'function' &&\n    typeof data.skip === 'function' &&\n    typeof data.raw === 'function';\n\n  return isCompatible;\n};\n\nDecoderBuffer.prototype.save = function save() {\n  return { offset: this.offset, reporter: Reporter.prototype.save.call(this) };\n};\n\nDecoderBuffer.prototype.restore = function restore(save) {\n  // Return skipped data\n  const res = new DecoderBuffer(this.base);\n  res.offset = save.offset;\n  res.length = this.offset;\n\n  this.offset = save.offset;\n  Reporter.prototype.restore.call(this, save.reporter);\n\n  return res;\n};\n\nDecoderBuffer.prototype.isEmpty = function isEmpty() {\n  return this.offset === this.length;\n};\n\nDecoderBuffer.prototype.readUInt8 = function readUInt8(fail) {\n  if (this.offset + 1 <= this.length)\n    return this.base.readUInt8(this.offset++, true);\n  else\n    return this.error(fail || 'DecoderBuffer overrun');\n};\n\nDecoderBuffer.prototype.skip = function skip(bytes, fail) {\n  if (!(this.offset + bytes <= this.length))\n    return this.error(fail || 'DecoderBuffer overrun');\n\n  const res = new DecoderBuffer(this.base);\n\n  // Share reporter state\n  res._reporterState = this._reporterState;\n\n  res.offset = this.offset;\n  res.length = this.offset + bytes;\n  this.offset += bytes;\n  return res;\n};\n\nDecoderBuffer.prototype.raw = function raw(save) {\n  return this.base.slice(save ? save.offset : this.offset, this.length);\n};\n\nfunction EncoderBuffer(value, reporter) {\n  if (Array.isArray(value)) {\n    this.length = 0;\n    this.value = value.map(function(item) {\n      if (!EncoderBuffer.isEncoderBuffer(item))\n        item = new EncoderBuffer(item, reporter);\n      this.length += item.length;\n      return item;\n    }, this);\n  } else if (typeof value === 'number') {\n    if (!(0 <= value && value <= 0xff))\n      return reporter.error('non-byte EncoderBuffer value');\n    this.value = value;\n    this.length = 1;\n  } else if (typeof value === 'string') {\n    this.value = value;\n    this.length = Buffer.byteLength(value);\n  } else if (Buffer.isBuffer(value)) {\n    this.value = value;\n    this.length = value.length;\n  } else {\n    return reporter.error('Unsupported type: ' + typeof value);\n  }\n}\nexports.EncoderBuffer = EncoderBuffer;\n\nEncoderBuffer.isEncoderBuffer = function isEncoderBuffer(data) {\n  if (data instanceof EncoderBuffer) {\n    return true;\n  }\n\n  // Or accept compatible API\n  const isCompatible = typeof data === 'object' &&\n    data.constructor.name === 'EncoderBuffer' &&\n    typeof data.length === 'number' &&\n    typeof data.join === 'function';\n\n  return isCompatible;\n};\n\nEncoderBuffer.prototype.join = function join(out, offset) {\n  if (!out)\n    out = Buffer.alloc(this.length);\n  if (!offset)\n    offset = 0;\n\n  if (this.length === 0)\n    return out;\n\n  if (Array.isArray(this.value)) {\n    this.value.forEach(function(item) {\n      item.join(out, offset);\n      offset += item.length;\n    });\n  } else {\n    if (typeof this.value === 'number')\n      out[offset] = this.value;\n    else if (typeof this.value === 'string')\n      out.write(this.value, offset);\n    else if (Buffer.isBuffer(this.value))\n      this.value.copy(out, offset);\n    offset += this.length;\n  }\n\n  return out;\n};\n","'use strict';\n\n// Helper\nfunction reverse(map) {\n  const res = {};\n\n  Object.keys(map).forEach(function(key) {\n    // Convert key to integer if it is stringified\n    if ((key | 0) == key)\n      key = key | 0;\n\n    const value = map[key];\n    res[value] = key;\n  });\n\n  return res;\n}\n\nexports.tagClass = {\n  0: 'universal',\n  1: 'application',\n  2: 'context',\n  3: 'private'\n};\nexports.tagClassByName = reverse(exports.tagClass);\n\nexports.tag = {\n  0x00: 'end',\n  0x01: 'bool',\n  0x02: 'int',\n  0x03: 'bitstr',\n  0x04: 'octstr',\n  0x05: 'null_',\n  0x06: 'objid',\n  0x07: 'objDesc',\n  0x08: 'external',\n  0x09: 'real',\n  0x0a: 'enum',\n  0x0b: 'embed',\n  0x0c: 'utf8str',\n  0x0d: 'relativeOid',\n  0x10: 'seq',\n  0x11: 'set',\n  0x12: 'numstr',\n  0x13: 'printstr',\n  0x14: 't61str',\n  0x15: 'videostr',\n  0x16: 'ia5str',\n  0x17: 'utctime',\n  0x18: 'gentime',\n  0x19: 'graphstr',\n  0x1a: 'iso646str',\n  0x1b: 'genstr',\n  0x1c: 'unistr',\n  0x1d: 'charstr',\n  0x1e: 'bmpstr'\n};\nexports.tagByName = reverse(exports.tag);\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst DEREncoder = require('./der');\n\nfunction PEMEncoder(entity) {\n  DEREncoder.call(this, entity);\n  this.enc = 'pem';\n}\ninherits(PEMEncoder, DEREncoder);\nmodule.exports = PEMEncoder;\n\nPEMEncoder.prototype.encode = function encode(data, options) {\n  const buf = DEREncoder.prototype.encode.call(this, data);\n\n  const p = buf.toString('base64');\n  const out = [ '-----BEGIN ' + options.label + '-----' ];\n  for (let i = 0; i < p.length; i += 64)\n    out.push(p.slice(i, i + 64));\n  out.push('-----END ' + options.label + '-----');\n  return out.join('\\n');\n};\n","'use strict';\n\nconst decoders = exports;\n\ndecoders.der = require('./der');\ndecoders.pem = require('./pem');\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst bignum = require('bn.js');\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DERDecoder(entity) {\n  this.enc = 'der';\n  this.name = entity.name;\n  this.entity = entity;\n\n  // Construct base tree\n  this.tree = new DERNode();\n  this.tree._init(entity.body);\n}\nmodule.exports = DERDecoder;\n\nDERDecoder.prototype.decode = function decode(data, options) {\n  if (!DecoderBuffer.isDecoderBuffer(data)) {\n    data = new DecoderBuffer(data, options);\n  }\n\n  return this.tree._decode(data, options);\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n  Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._peekTag = function peekTag(buffer, tag, any) {\n  if (buffer.isEmpty())\n    return false;\n\n  const state = buffer.save();\n  const decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n  if (buffer.isError(decodedTag))\n    return decodedTag;\n\n  buffer.restore(state);\n\n  return decodedTag.tag === tag || decodedTag.tagStr === tag ||\n    (decodedTag.tagStr + 'of') === tag || any;\n};\n\nDERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) {\n  const decodedTag = derDecodeTag(buffer,\n    'Failed to decode tag of \"' + tag + '\"');\n  if (buffer.isError(decodedTag))\n    return decodedTag;\n\n  let len = derDecodeLen(buffer,\n    decodedTag.primitive,\n    'Failed to get length of \"' + tag + '\"');\n\n  // Failure\n  if (buffer.isError(len))\n    return len;\n\n  if (!any &&\n      decodedTag.tag !== tag &&\n      decodedTag.tagStr !== tag &&\n      decodedTag.tagStr + 'of' !== tag) {\n    return buffer.error('Failed to match tag: \"' + tag + '\"');\n  }\n\n  if (decodedTag.primitive || len !== null)\n    return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n\n  // Indefinite length... find END tag\n  const state = buffer.save();\n  const res = this._skipUntilEnd(\n    buffer,\n    'Failed to skip indefinite length body: \"' + this.tag + '\"');\n  if (buffer.isError(res))\n    return res;\n\n  len = buffer.offset - state.offset;\n  buffer.restore(state);\n  return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n};\n\nDERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) {\n  for (;;) {\n    const tag = derDecodeTag(buffer, fail);\n    if (buffer.isError(tag))\n      return tag;\n    const len = derDecodeLen(buffer, tag.primitive, fail);\n    if (buffer.isError(len))\n      return len;\n\n    let res;\n    if (tag.primitive || len !== null)\n      res = buffer.skip(len);\n    else\n      res = this._skipUntilEnd(buffer, fail);\n\n    // Failure\n    if (buffer.isError(res))\n      return res;\n\n    if (tag.tagStr === 'end')\n      break;\n  }\n};\n\nDERNode.prototype._decodeList = function decodeList(buffer, tag, decoder,\n  options) {\n  const result = [];\n  while (!buffer.isEmpty()) {\n    const possibleEnd = this._peekTag(buffer, 'end');\n    if (buffer.isError(possibleEnd))\n      return possibleEnd;\n\n    const res = decoder.decode(buffer, 'der', options);\n    if (buffer.isError(res) && possibleEnd)\n      break;\n    result.push(res);\n  }\n  return result;\n};\n\nDERNode.prototype._decodeStr = function decodeStr(buffer, tag) {\n  if (tag === 'bitstr') {\n    const unused = buffer.readUInt8();\n    if (buffer.isError(unused))\n      return unused;\n    return { unused: unused, data: buffer.raw() };\n  } else if (tag === 'bmpstr') {\n    const raw = buffer.raw();\n    if (raw.length % 2 === 1)\n      return buffer.error('Decoding of string type: bmpstr length mismatch');\n\n    let str = '';\n    for (let i = 0; i < raw.length / 2; i++) {\n      str += String.fromCharCode(raw.readUInt16BE(i * 2));\n    }\n    return str;\n  } else if (tag === 'numstr') {\n    const numstr = buffer.raw().toString('ascii');\n    if (!this._isNumstr(numstr)) {\n      return buffer.error('Decoding of string type: ' +\n                          'numstr unsupported characters');\n    }\n    return numstr;\n  } else if (tag === 'octstr') {\n    return buffer.raw();\n  } else if (tag === 'objDesc') {\n    return buffer.raw();\n  } else if (tag === 'printstr') {\n    const printstr = buffer.raw().toString('ascii');\n    if (!this._isPrintstr(printstr)) {\n      return buffer.error('Decoding of string type: ' +\n                          'printstr unsupported characters');\n    }\n    return printstr;\n  } else if (/str$/.test(tag)) {\n    return buffer.raw().toString();\n  } else {\n    return buffer.error('Decoding of string type: ' + tag + ' unsupported');\n  }\n};\n\nDERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) {\n  let result;\n  const identifiers = [];\n  let ident = 0;\n  let subident = 0;\n  while (!buffer.isEmpty()) {\n    subident = buffer.readUInt8();\n    ident <<= 7;\n    ident |= subident & 0x7f;\n    if ((subident & 0x80) === 0) {\n      identifiers.push(ident);\n      ident = 0;\n    }\n  }\n  if (subident & 0x80)\n    identifiers.push(ident);\n\n  const first = (identifiers[0] / 40) | 0;\n  const second = identifiers[0] % 40;\n\n  if (relative)\n    result = identifiers;\n  else\n    result = [first, second].concat(identifiers.slice(1));\n\n  if (values) {\n    let tmp = values[result.join(' ')];\n    if (tmp === undefined)\n      tmp = values[result.join('.')];\n    if (tmp !== undefined)\n      result = tmp;\n  }\n\n  return result;\n};\n\nDERNode.prototype._decodeTime = function decodeTime(buffer, tag) {\n  const str = buffer.raw().toString();\n\n  let year;\n  let mon;\n  let day;\n  let hour;\n  let min;\n  let sec;\n  if (tag === 'gentime') {\n    year = str.slice(0, 4) | 0;\n    mon = str.slice(4, 6) | 0;\n    day = str.slice(6, 8) | 0;\n    hour = str.slice(8, 10) | 0;\n    min = str.slice(10, 12) | 0;\n    sec = str.slice(12, 14) | 0;\n  } else if (tag === 'utctime') {\n    year = str.slice(0, 2) | 0;\n    mon = str.slice(2, 4) | 0;\n    day = str.slice(4, 6) | 0;\n    hour = str.slice(6, 8) | 0;\n    min = str.slice(8, 10) | 0;\n    sec = str.slice(10, 12) | 0;\n    if (year < 70)\n      year = 2000 + year;\n    else\n      year = 1900 + year;\n  } else {\n    return buffer.error('Decoding ' + tag + ' time is not supported yet');\n  }\n\n  return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n};\n\nDERNode.prototype._decodeNull = function decodeNull() {\n  return null;\n};\n\nDERNode.prototype._decodeBool = function decodeBool(buffer) {\n  const res = buffer.readUInt8();\n  if (buffer.isError(res))\n    return res;\n  else\n    return res !== 0;\n};\n\nDERNode.prototype._decodeInt = function decodeInt(buffer, values) {\n  // Bigint, return as it is (assume big endian)\n  const raw = buffer.raw();\n  let res = new bignum(raw);\n\n  if (values)\n    res = values[res.toString(10)] || res;\n\n  return res;\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n  if (typeof entity === 'function')\n    entity = entity(obj);\n  return entity._getDecoder('der').tree;\n};\n\n// Utility methods\n\nfunction derDecodeTag(buf, fail) {\n  let tag = buf.readUInt8(fail);\n  if (buf.isError(tag))\n    return tag;\n\n  const cls = der.tagClass[tag >> 6];\n  const primitive = (tag & 0x20) === 0;\n\n  // Multi-octet tag - load\n  if ((tag & 0x1f) === 0x1f) {\n    let oct = tag;\n    tag = 0;\n    while ((oct & 0x80) === 0x80) {\n      oct = buf.readUInt8(fail);\n      if (buf.isError(oct))\n        return oct;\n\n      tag <<= 7;\n      tag |= oct & 0x7f;\n    }\n  } else {\n    tag &= 0x1f;\n  }\n  const tagStr = der.tag[tag];\n\n  return {\n    cls: cls,\n    primitive: primitive,\n    tag: tag,\n    tagStr: tagStr\n  };\n}\n\nfunction derDecodeLen(buf, primitive, fail) {\n  let len = buf.readUInt8(fail);\n  if (buf.isError(len))\n    return len;\n\n  // Indefinite form\n  if (!primitive && len === 0x80)\n    return null;\n\n  // Definite form\n  if ((len & 0x80) === 0) {\n    // Short form\n    return len;\n  }\n\n  // Long form\n  const num = len & 0x7f;\n  if (num > 4)\n    return buf.error('length octect is too long');\n\n  len = 0;\n  for (let i = 0; i < num; i++) {\n    len <<= 8;\n    const j = buf.readUInt8(fail);\n    if (buf.isError(j))\n      return j;\n    len |= j;\n  }\n\n  return len;\n}\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\n\nconst DERDecoder = require('./der');\n\nfunction PEMDecoder(entity) {\n  DERDecoder.call(this, entity);\n  this.enc = 'pem';\n}\ninherits(PEMDecoder, DERDecoder);\nmodule.exports = PEMDecoder;\n\nPEMDecoder.prototype.decode = function decode(data, options) {\n  const lines = data.toString().split(/[\\r\\n]+/g);\n\n  const label = options.label.toUpperCase();\n\n  const re = /^-----(BEGIN|END) ([^-]+)-----$/;\n  let start = -1;\n  let end = -1;\n  for (let i = 0; i < lines.length; i++) {\n    const match = lines[i].match(re);\n    if (match === null)\n      continue;\n\n    if (match[2] !== label)\n      continue;\n\n    if (start === -1) {\n      if (match[1] !== 'BEGIN')\n        break;\n      start = i;\n    } else {\n      if (match[1] !== 'END')\n        break;\n      end = i;\n      break;\n    }\n  }\n  if (start === -1 || end === -1)\n    throw new Error('PEM section not found for: ' + label);\n\n  const base64 = lines.slice(start + 1, end).join('');\n  // Remove excessive symbols\n  base64.replace(/[^a-z0-9+/=]+/gi, '');\n\n  const input = Buffer.from(base64, 'base64');\n  return DERDecoder.prototype.decode.call(this, input, options);\n};\n","'use strict';\n\nconst base = exports;\n\nbase.Reporter = require('./reporter').Reporter;\nbase.DecoderBuffer = require('./buffer').DecoderBuffer;\nbase.EncoderBuffer = require('./buffer').EncoderBuffer;\nbase.Node = require('./node');\n","'use strict';\n\nconst constants = exports;\n\n// Helper\nconstants._reverse = function reverse(map) {\n  const res = {};\n\n  Object.keys(map).forEach(function(key) {\n    // Convert key to integer if it is stringified\n    if ((key | 0) == key)\n      key = key | 0;\n\n    const value = map[key];\n    res[value] = key;\n  });\n\n  return res;\n};\n\nconstants.der = require('./der');\n","// from https://github.com/Rantanen/node-dtls/blob/25a7dc861bda38cfeac93a723500eea4f0ac2e86/Certificate.js\n// thanks to @Rantanen\n\n'use strict'\n\nvar asn = require('asn1.js')\n\nvar Time = asn.define('Time', function () {\n  this.choice({\n    utcTime: this.utctime(),\n    generalTime: this.gentime()\n  })\n})\n\nvar AttributeTypeValue = asn.define('AttributeTypeValue', function () {\n  this.seq().obj(\n    this.key('type').objid(),\n    this.key('value').any()\n  )\n})\n\nvar AlgorithmIdentifier = asn.define('AlgorithmIdentifier', function () {\n  this.seq().obj(\n    this.key('algorithm').objid(),\n    this.key('parameters').optional(),\n    this.key('curve').objid().optional()\n  )\n})\n\nvar SubjectPublicKeyInfo = asn.define('SubjectPublicKeyInfo', function () {\n  this.seq().obj(\n    this.key('algorithm').use(AlgorithmIdentifier),\n    this.key('subjectPublicKey').bitstr()\n  )\n})\n\nvar RelativeDistinguishedName = asn.define('RelativeDistinguishedName', function () {\n  this.setof(AttributeTypeValue)\n})\n\nvar RDNSequence = asn.define('RDNSequence', function () {\n  this.seqof(RelativeDistinguishedName)\n})\n\nvar Name = asn.define('Name', function () {\n  this.choice({\n    rdnSequence: this.use(RDNSequence)\n  })\n})\n\nvar Validity = asn.define('Validity', function () {\n  this.seq().obj(\n    this.key('notBefore').use(Time),\n    this.key('notAfter').use(Time)\n  )\n})\n\nvar Extension = asn.define('Extension', function () {\n  this.seq().obj(\n    this.key('extnID').objid(),\n    this.key('critical').bool().def(false),\n    this.key('extnValue').octstr()\n  )\n})\n\nvar TBSCertificate = asn.define('TBSCertificate', function () {\n  this.seq().obj(\n    this.key('version').explicit(0).int().optional(),\n    this.key('serialNumber').int(),\n    this.key('signature').use(AlgorithmIdentifier),\n    this.key('issuer').use(Name),\n    this.key('validity').use(Validity),\n    this.key('subject').use(Name),\n    this.key('subjectPublicKeyInfo').use(SubjectPublicKeyInfo),\n    this.key('issuerUniqueID').implicit(1).bitstr().optional(),\n    this.key('subjectUniqueID').implicit(2).bitstr().optional(),\n    this.key('extensions').explicit(3).seqof(Extension).optional()\n  )\n})\n\nvar X509Certificate = asn.define('X509Certificate', function () {\n  this.seq().obj(\n    this.key('tbsCertificate').use(TBSCertificate),\n    this.key('signatureAlgorithm').use(AlgorithmIdentifier),\n    this.key('signatureValue').bitstr()\n  )\n})\n\nmodule.exports = X509Certificate\n","// adapted from https://github.com/apatil/pemstrip\nvar findProc = /Proc-Type: 4,ENCRYPTED[\\n\\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\\n\\r]+([0-9A-z\\n\\r+/=]+)[\\n\\r]+/m\nvar startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m\nvar fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\\n\\r+/=]+)-----END \\1-----$/m\nvar evp = require('evp_bytestokey')\nvar ciphers = require('browserify-aes')\nvar Buffer = require('safe-buffer').Buffer\nmodule.exports = function (okey, password) {\n  var key = okey.toString()\n  var match = key.match(findProc)\n  var decrypted\n  if (!match) {\n    var match2 = key.match(fullRegex)\n    decrypted = Buffer.from(match2[2].replace(/[\\r\\n]/g, ''), 'base64')\n  } else {\n    var suite = 'aes' + match[1]\n    var iv = Buffer.from(match[2], 'hex')\n    var cipherText = Buffer.from(match[3].replace(/[\\r\\n]/g, ''), 'base64')\n    var cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key\n    var out = []\n    var cipher = ciphers.createDecipheriv(suite, cipherKey, iv)\n    out.push(cipher.update(cipherText))\n    out.push(cipher.final())\n    decrypted = Buffer.concat(out)\n  }\n  var tag = key.match(startRegex)[1]\n  return {\n    tag: tag,\n    data: decrypted\n  }\n}\n","// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('safe-buffer').Buffer\nvar BN = require('bn.js')\nvar EC = require('elliptic').ec\nvar parseKeys = require('parse-asn1')\nvar curves = require('./curves.json')\n\nfunction verify (sig, hash, key, signType, tag) {\n  var pub = parseKeys(key)\n  if (pub.type === 'ec') {\n    // rsa keys can be interpreted as ecdsa ones in openssl\n    if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')\n    return ecVerify(sig, hash, pub)\n  } else if (pub.type === 'dsa') {\n    if (signType !== 'dsa') throw new Error('wrong public key type')\n    return dsaVerify(sig, hash, pub)\n  } else {\n    if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')\n  }\n  hash = Buffer.concat([tag, hash])\n  var len = pub.modulus.byteLength()\n  var pad = [1]\n  var padNum = 0\n  while (hash.length + pad.length + 2 < len) {\n    pad.push(0xff)\n    padNum++\n  }\n  pad.push(0x00)\n  var i = -1\n  while (++i < hash.length) {\n    pad.push(hash[i])\n  }\n  pad = Buffer.from(pad)\n  var red = BN.mont(pub.modulus)\n  sig = new BN(sig).toRed(red)\n\n  sig = sig.redPow(new BN(pub.publicExponent))\n  sig = Buffer.from(sig.fromRed().toArray())\n  var out = padNum < 8 ? 1 : 0\n  len = Math.min(sig.length, pad.length)\n  if (sig.length !== pad.length) out = 1\n\n  i = -1\n  while (++i < len) out |= sig[i] ^ pad[i]\n  return out === 0\n}\n\nfunction ecVerify (sig, hash, pub) {\n  var curveId = curves[pub.data.algorithm.curve.join('.')]\n  if (!curveId) throw new Error('unknown curve ' + pub.data.algorithm.curve.join('.'))\n\n  var curve = new EC(curveId)\n  var pubkey = pub.data.subjectPrivateKey.data\n\n  return curve.verify(hash, sig, pubkey)\n}\n\nfunction dsaVerify (sig, hash, pub) {\n  var p = pub.data.p\n  var q = pub.data.q\n  var g = pub.data.g\n  var y = pub.data.pub_key\n  var unpacked = parseKeys.signature.decode(sig, 'der')\n  var s = unpacked.s\n  var r = unpacked.r\n  checkValue(s, q)\n  checkValue(r, q)\n  var montp = BN.mont(p)\n  var w = s.invm(q)\n  var v = g.toRed(montp)\n    .redPow(new BN(hash).mul(w).mod(q))\n    .fromRed()\n    .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n    .mod(p)\n    .mod(q)\n  return v.cmp(r) === 0\n}\n\nfunction checkValue (b, q) {\n  if (b.cmpn(0) <= 0) throw new Error('invalid sig')\n  if (b.cmp(q) >= q) throw new Error('invalid sig')\n}\n\nmodule.exports = verify\n","var elliptic = require('elliptic')\nvar BN = require('bn.js')\n\nmodule.exports = function createECDH (curve) {\n  return new ECDH(curve)\n}\n\nvar aliases = {\n  secp256k1: {\n    name: 'secp256k1',\n    byteLength: 32\n  },\n  secp224r1: {\n    name: 'p224',\n    byteLength: 28\n  },\n  prime256v1: {\n    name: 'p256',\n    byteLength: 32\n  },\n  prime192v1: {\n    name: 'p192',\n    byteLength: 24\n  },\n  ed25519: {\n    name: 'ed25519',\n    byteLength: 32\n  },\n  secp384r1: {\n    name: 'p384',\n    byteLength: 48\n  },\n  secp521r1: {\n    name: 'p521',\n    byteLength: 66\n  }\n}\n\naliases.p224 = aliases.secp224r1\naliases.p256 = aliases.secp256r1 = aliases.prime256v1\naliases.p192 = aliases.secp192r1 = aliases.prime192v1\naliases.p384 = aliases.secp384r1\naliases.p521 = aliases.secp521r1\n\nfunction ECDH (curve) {\n  this.curveType = aliases[curve]\n  if (!this.curveType) {\n    this.curveType = {\n      name: curve\n    }\n  }\n  this.curve = new elliptic.ec(this.curveType.name) // eslint-disable-line new-cap\n  this.keys = void 0\n}\n\nECDH.prototype.generateKeys = function (enc, format) {\n  this.keys = this.curve.genKeyPair()\n  return this.getPublicKey(enc, format)\n}\n\nECDH.prototype.computeSecret = function (other, inenc, enc) {\n  inenc = inenc || 'utf8'\n  if (!Buffer.isBuffer(other)) {\n    other = new Buffer(other, inenc)\n  }\n  var otherPub = this.curve.keyFromPublic(other).getPublic()\n  var out = otherPub.mul(this.keys.getPrivate()).getX()\n  return formatReturnValue(out, enc, this.curveType.byteLength)\n}\n\nECDH.prototype.getPublicKey = function (enc, format) {\n  var key = this.keys.getPublic(format === 'compressed', true)\n  if (format === 'hybrid') {\n    if (key[key.length - 1] % 2) {\n      key[0] = 7\n    } else {\n      key[0] = 6\n    }\n  }\n  return formatReturnValue(key, enc)\n}\n\nECDH.prototype.getPrivateKey = function (enc) {\n  return formatReturnValue(this.keys.getPrivate(), enc)\n}\n\nECDH.prototype.setPublicKey = function (pub, enc) {\n  enc = enc || 'utf8'\n  if (!Buffer.isBuffer(pub)) {\n    pub = new Buffer(pub, enc)\n  }\n  this.keys._importPublic(pub)\n  return this\n}\n\nECDH.prototype.setPrivateKey = function (priv, enc) {\n  enc = enc || 'utf8'\n  if (!Buffer.isBuffer(priv)) {\n    priv = new Buffer(priv, enc)\n  }\n\n  var _priv = new BN(priv)\n  _priv = _priv.toString(16)\n  this.keys = this.curve.genKeyPair()\n  this.keys._importPrivate(_priv)\n  return this\n}\n\nfunction formatReturnValue (bn, enc, len) {\n  if (!Array.isArray(bn)) {\n    bn = bn.toArray()\n  }\n  var buf = new Buffer(bn)\n  if (len && buf.length < len) {\n    var zeros = new Buffer(len - buf.length)\n    zeros.fill(0)\n    buf = Buffer.concat([zeros, buf])\n  }\n  if (!enc) {\n    return buf\n  } else {\n    return buf.toString(enc)\n  }\n}\n","exports.publicEncrypt = require('./publicEncrypt')\nexports.privateDecrypt = require('./privateDecrypt')\n\nexports.privateEncrypt = function privateEncrypt (key, buf) {\n  return exports.publicEncrypt(key, buf, true)\n}\n\nexports.publicDecrypt = function publicDecrypt (key, buf) {\n  return exports.privateDecrypt(key, buf, true)\n}\n","var parseKeys = require('parse-asn1')\nvar randomBytes = require('randombytes')\nvar createHash = require('create-hash')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar withPublic = require('./withPublic')\nvar crt = require('browserify-rsa')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function publicEncrypt (publicKey, msg, reverse) {\n  var padding\n  if (publicKey.padding) {\n    padding = publicKey.padding\n  } else if (reverse) {\n    padding = 1\n  } else {\n    padding = 4\n  }\n  var key = parseKeys(publicKey)\n  var paddedMsg\n  if (padding === 4) {\n    paddedMsg = oaep(key, msg)\n  } else if (padding === 1) {\n    paddedMsg = pkcs1(key, msg, reverse)\n  } else if (padding === 3) {\n    paddedMsg = new BN(msg)\n    if (paddedMsg.cmp(key.modulus) >= 0) {\n      throw new Error('data too long for modulus')\n    }\n  } else {\n    throw new Error('unknown padding')\n  }\n  if (reverse) {\n    return crt(paddedMsg, key)\n  } else {\n    return withPublic(paddedMsg, key)\n  }\n}\n\nfunction oaep (key, msg) {\n  var k = key.modulus.byteLength()\n  var mLen = msg.length\n  var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n  var hLen = iHash.length\n  var hLen2 = 2 * hLen\n  if (mLen > k - hLen2 - 2) {\n    throw new Error('message too long')\n  }\n  var ps = Buffer.alloc(k - mLen - hLen2 - 2)\n  var dblen = k - hLen - 1\n  var seed = randomBytes(hLen)\n  var maskedDb = xor(Buffer.concat([iHash, ps, Buffer.alloc(1, 1), msg], dblen), mgf(seed, dblen))\n  var maskedSeed = xor(seed, mgf(maskedDb, hLen))\n  return new BN(Buffer.concat([Buffer.alloc(1), maskedSeed, maskedDb], k))\n}\nfunction pkcs1 (key, msg, reverse) {\n  var mLen = msg.length\n  var k = key.modulus.byteLength()\n  if (mLen > k - 11) {\n    throw new Error('message too long')\n  }\n  var ps\n  if (reverse) {\n    ps = Buffer.alloc(k - mLen - 3, 0xff)\n  } else {\n    ps = nonZero(k - mLen - 3)\n  }\n  return new BN(Buffer.concat([Buffer.from([0, reverse ? 1 : 2]), ps, Buffer.alloc(1), msg], k))\n}\nfunction nonZero (len) {\n  var out = Buffer.allocUnsafe(len)\n  var i = 0\n  var cache = randomBytes(len * 2)\n  var cur = 0\n  var num\n  while (i < len) {\n    if (cur === cache.length) {\n      cache = randomBytes(len * 2)\n      cur = 0\n    }\n    num = cache[cur++]\n    if (num) {\n      out[i++] = num\n    }\n  }\n  return out\n}\n","var createHash = require('create-hash')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (seed, len) {\n  var t = Buffer.alloc(0)\n  var i = 0\n  var c\n  while (t.length < len) {\n    c = i2ops(i++)\n    t = Buffer.concat([t, createHash('sha1').update(seed).update(c).digest()])\n  }\n  return t.slice(0, len)\n}\n\nfunction i2ops (c) {\n  var out = Buffer.allocUnsafe(4)\n  out.writeUInt32BE(c, 0)\n  return out\n}\n","module.exports = function xor (a, b) {\n  var len = a.length\n  var i = -1\n  while (++i < len) {\n    a[i] ^= b[i]\n  }\n  return a\n}\n","var BN = require('bn.js')\nvar Buffer = require('safe-buffer').Buffer\n\nfunction withPublic (paddedMsg, key) {\n  return Buffer.from(paddedMsg\n    .toRed(BN.mont(key.modulus))\n    .redPow(new BN(key.publicExponent))\n    .fromRed()\n    .toArray())\n}\n\nmodule.exports = withPublic\n","var parseKeys = require('parse-asn1')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar crt = require('browserify-rsa')\nvar createHash = require('create-hash')\nvar withPublic = require('./withPublic')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function privateDecrypt (privateKey, enc, reverse) {\n  var padding\n  if (privateKey.padding) {\n    padding = privateKey.padding\n  } else if (reverse) {\n    padding = 1\n  } else {\n    padding = 4\n  }\n\n  var key = parseKeys(privateKey)\n  var k = key.modulus.byteLength()\n  if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) {\n    throw new Error('decryption error')\n  }\n  var msg\n  if (reverse) {\n    msg = withPublic(new BN(enc), key)\n  } else {\n    msg = crt(enc, key)\n  }\n  var zBuffer = Buffer.alloc(k - msg.length)\n  msg = Buffer.concat([zBuffer, msg], k)\n  if (padding === 4) {\n    return oaep(key, msg)\n  } else if (padding === 1) {\n    return pkcs1(key, msg, reverse)\n  } else if (padding === 3) {\n    return msg\n  } else {\n    throw new Error('unknown padding')\n  }\n}\n\nfunction oaep (key, msg) {\n  var k = key.modulus.byteLength()\n  var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n  var hLen = iHash.length\n  if (msg[0] !== 0) {\n    throw new Error('decryption error')\n  }\n  var maskedSeed = msg.slice(1, hLen + 1)\n  var maskedDb = msg.slice(hLen + 1)\n  var seed = xor(maskedSeed, mgf(maskedDb, hLen))\n  var db = xor(maskedDb, mgf(seed, k - hLen - 1))\n  if (compare(iHash, db.slice(0, hLen))) {\n    throw new Error('decryption error')\n  }\n  var i = hLen\n  while (db[i] === 0) {\n    i++\n  }\n  if (db[i++] !== 1) {\n    throw new Error('decryption error')\n  }\n  return db.slice(i)\n}\n\nfunction pkcs1 (key, msg, reverse) {\n  var p1 = msg.slice(0, 2)\n  var i = 2\n  var status = 0\n  while (msg[i++] !== 0) {\n    if (i >= msg.length) {\n      status++\n      break\n    }\n  }\n  var ps = msg.slice(2, i - 1)\n\n  if ((p1.toString('hex') !== '0002' && !reverse) || (p1.toString('hex') !== '0001' && reverse)) {\n    status++\n  }\n  if (ps.length < 8) {\n    status++\n  }\n  if (status) {\n    throw new Error('decryption error')\n  }\n  return msg.slice(i)\n}\nfunction compare (a, b) {\n  a = Buffer.from(a)\n  b = Buffer.from(b)\n  var dif = 0\n  var len = a.length\n  if (a.length !== b.length) {\n    dif++\n    len = Math.min(a.length, b.length)\n  }\n  var i = -1\n  while (++i < len) {\n    dif += (a[i] ^ b[i])\n  }\n  return dif\n}\n","'use strict'\n\nfunction oldBrowser () {\n  throw new Error('secure random number generation not supported by this browser\\nuse chrome, FireFox or Internet Explorer 11')\n}\nvar safeBuffer = require('safe-buffer')\nvar randombytes = require('randombytes')\nvar Buffer = safeBuffer.Buffer\nvar kBufferMaxLength = safeBuffer.kMaxLength\nvar crypto = global.crypto || global.msCrypto\nvar kMaxUint32 = Math.pow(2, 32) - 1\nfunction assertOffset (offset, length) {\n  if (typeof offset !== 'number' || offset !== offset) { // eslint-disable-line no-self-compare\n    throw new TypeError('offset must be a number')\n  }\n\n  if (offset > kMaxUint32 || offset < 0) {\n    throw new TypeError('offset must be a uint32')\n  }\n\n  if (offset > kBufferMaxLength || offset > length) {\n    throw new RangeError('offset out of range')\n  }\n}\n\nfunction assertSize (size, offset, length) {\n  if (typeof size !== 'number' || size !== size) { // eslint-disable-line no-self-compare\n    throw new TypeError('size must be a number')\n  }\n\n  if (size > kMaxUint32 || size < 0) {\n    throw new TypeError('size must be a uint32')\n  }\n\n  if (size + offset > length || size > kBufferMaxLength) {\n    throw new RangeError('buffer too small')\n  }\n}\nif ((crypto && crypto.getRandomValues) || !process.browser) {\n  exports.randomFill = randomFill\n  exports.randomFillSync = randomFillSync\n} else {\n  exports.randomFill = oldBrowser\n  exports.randomFillSync = oldBrowser\n}\nfunction randomFill (buf, offset, size, cb) {\n  if (!Buffer.isBuffer(buf) && !(buf instanceof global.Uint8Array)) {\n    throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array')\n  }\n\n  if (typeof offset === 'function') {\n    cb = offset\n    offset = 0\n    size = buf.length\n  } else if (typeof size === 'function') {\n    cb = size\n    size = buf.length - offset\n  } else if (typeof cb !== 'function') {\n    throw new TypeError('\"cb\" argument must be a function')\n  }\n  assertOffset(offset, buf.length)\n  assertSize(size, offset, buf.length)\n  return actualFill(buf, offset, size, cb)\n}\n\nfunction actualFill (buf, offset, size, cb) {\n  if (process.browser) {\n    var ourBuf = buf.buffer\n    var uint = new Uint8Array(ourBuf, offset, size)\n    crypto.getRandomValues(uint)\n    if (cb) {\n      process.nextTick(function () {\n        cb(null, buf)\n      })\n      return\n    }\n    return buf\n  }\n  if (cb) {\n    randombytes(size, function (err, bytes) {\n      if (err) {\n        return cb(err)\n      }\n      bytes.copy(buf, offset)\n      cb(null, buf)\n    })\n    return\n  }\n  var bytes = randombytes(size)\n  bytes.copy(buf, offset)\n  return buf\n}\nfunction randomFillSync (buf, offset, size) {\n  if (typeof offset === 'undefined') {\n    offset = 0\n  }\n  if (!Buffer.isBuffer(buf) && !(buf instanceof global.Uint8Array)) {\n    throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array')\n  }\n\n  assertOffset(offset, buf.length)\n\n  if (size === undefined) size = buf.length - offset\n\n  assertSize(size, offset, buf.length)\n\n  return actualFill(buf, offset, size)\n}\n","// This alphabet uses `A-Za-z0-9_-` symbols. The genetic algorithm helped\n// optimize the gzip compression for this alphabet.\nlet urlAlphabet =\n  'ModuleSymbhasOwnPr-0123456789ABCDEFGHNRVfgctiUvz_KqYTJkLxpZXIjQW'\n\nmodule.exports = { urlAlphabet }\n","'use strict'\n\nconst Key = require('./key')\nconst Adapter = require('./adapter')\nconst Errors = require('./errors')\n\n/**\n * @typedef {import('./types').Pair} Pair\n * @typedef {import('./types').Datastore} Datastore\n * @typedef {import('interface-store').Options} Options\n */\n\n/**\n * @class MemoryDatastore\n * @implements {Datastore}\n */\nclass MemoryDatastore extends Adapter {\n  constructor () {\n    super()\n\n    /** @type {Record<string, Uint8Array>} */\n    this.data = {}\n  }\n\n  open () {\n    return Promise.resolve()\n  }\n\n  close () {\n    return Promise.resolve()\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Uint8Array} val\n   */\n  async put (key, val) { // eslint-disable-line require-await\n    this.data[key.toString()] = val\n  }\n\n  /**\n   * @param {Key} key\n   */\n  async get (key) {\n    const exists = await this.has(key)\n    if (!exists) throw Errors.notFoundError()\n    return this.data[key.toString()]\n  }\n\n  /**\n   * @param {Key} key\n   */\n  async has (key) { // eslint-disable-line require-await\n    return this.data[key.toString()] !== undefined\n  }\n\n  /**\n   * @param {Key} key\n   */\n  async delete (key) { // eslint-disable-line require-await\n    delete this.data[key.toString()]\n  }\n\n  async * _all () {\n    yield * Object.entries(this.data)\n      .map(([key, value]) => ({ key: new Key(key), value }))\n  }\n\n  async * _allKeys () {\n    yield * Object.entries(this.data)\n      .map(([key]) => new Key(key))\n  }\n}\n\nmodule.exports = MemoryDatastore\n","'use strict'\n\nconst { sortAll } = require('./utils')\nconst drain = require('it-drain')\nconst filter = require('it-filter')\nconst take = require('it-take')\n\n/**\n * @typedef {import('interface-store').Options} Options\n * @typedef {import('./key')} Key\n * @typedef {import('./types').Pair} Pair\n * @typedef {import('./types').Datastore} Datastore\n * @typedef {import('./types').Query} Query\n * @typedef {import('./types').KeyQuery} KeyQuery\n * @typedef {import('./types').Batch} Batch\n */\n\n/**\n * @template O\n * @typedef {import('interface-store').AwaitIterable<O>} AwaitIterable\n */\n\n/**\n * @implements {Datastore}\n */\nclass Adapter {\n  /**\n   * @returns {Promise<void>}\n   */\n  open () {\n    return Promise.reject(new Error('.open is not implemented'))\n  }\n\n  /**\n   * @returns {Promise<void>}\n   */\n  close () {\n    return Promise.reject(new Error('.close is not implemented'))\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Uint8Array} val\n   * @param {Options} [options]\n   * @returns {Promise<void>}\n   */\n  put (key, val, options) {\n    return Promise.reject(new Error('.put is not implemented'))\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   * @returns {Promise<Uint8Array>}\n   */\n  get (key, options) {\n    return Promise.reject(new Error('.get is not implemented'))\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   * @returns {Promise<boolean>}\n   */\n  has (key, options) {\n    return Promise.reject(new Error('.has is not implemented'))\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   * @returns {Promise<void>}\n   */\n  delete (key, options) {\n    return Promise.reject(new Error('.delete is not implemented'))\n  }\n\n  /**\n   * @param {AwaitIterable<Pair>} source\n   * @param {Options} [options]\n   * @returns {AsyncIterable<Pair>}\n   */\n  async * putMany (source, options = {}) {\n    for await (const { key, value } of source) {\n      await this.put(key, value, options)\n      yield { key, value }\n    }\n  }\n\n  /**\n   * @param {AwaitIterable<Key>} source\n   * @param {Options} [options]\n   * @returns {AsyncIterable<Uint8Array>}\n   */\n  async * getMany (source, options = {}) {\n    for await (const key of source) {\n      yield this.get(key, options)\n    }\n  }\n\n  /**\n   * @param {AwaitIterable<Key>} source\n   * @param {Options} [options]\n   * @returns {AsyncIterable<Key>}\n   */\n  async * deleteMany (source, options = {}) {\n    for await (const key of source) {\n      await this.delete(key, options)\n      yield key\n    }\n  }\n\n  /**\n   * @returns {Batch}\n   */\n  batch () {\n    /** @type {Pair[]} */\n    let puts = []\n    /** @type {Key[]} */\n    let dels = []\n\n    return {\n      put (key, value) {\n        puts.push({ key, value })\n      },\n\n      delete (key) {\n        dels.push(key)\n      },\n      commit: async (options) => {\n        await drain(this.putMany(puts, options))\n        puts = []\n        await drain(this.deleteMany(dels, options))\n        dels = []\n      }\n    }\n  }\n\n  /**\n   * Extending classes should override `query` or implement this method\n   *\n   * @param {Query} q\n   * @param {Options} [options]\n   * @returns {AsyncIterable<Pair>}\n   */\n  // eslint-disable-next-line require-yield\n  async * _all (q, options) {\n    throw new Error('._all is not implemented')\n  }\n\n  /**\n   * Extending classes should override `queryKeys` or implement this method\n   *\n   * @param {KeyQuery} q\n   * @param {Options} [options]\n   * @returns {AsyncIterable<Key>}\n   */\n  // eslint-disable-next-line require-yield\n  async * _allKeys (q, options) {\n    throw new Error('._allKeys is not implemented')\n  }\n\n  /**\n   * @param {Query} q\n   * @param {Options} [options]\n   */\n  query (q, options) {\n    let it = this._all(q, options)\n\n    if (q.prefix != null) {\n      it = filter(it, (e) =>\n        e.key.toString().startsWith(/** @type {string} */ (q.prefix))\n      )\n    }\n\n    if (Array.isArray(q.filters)) {\n      it = q.filters.reduce((it, f) => filter(it, f), it)\n    }\n\n    if (Array.isArray(q.orders)) {\n      it = q.orders.reduce((it, f) => sortAll(it, f), it)\n    }\n\n    if (q.offset != null) {\n      let i = 0\n      it = filter(it, () => i++ >= /** @type {number} */ (q.offset))\n    }\n\n    if (q.limit != null) {\n      it = take(it, q.limit)\n    }\n\n    return it\n  }\n\n  /**\n   * @param {KeyQuery} q\n   * @param {Options} [options]\n   */\n  queryKeys (q, options) {\n    let it = this._allKeys(q, options)\n\n    if (q.prefix != null) {\n      it = filter(it, (key) =>\n        key.toString().startsWith(/** @type {string} */ (q.prefix))\n      )\n    }\n\n    if (Array.isArray(q.filters)) {\n      it = q.filters.reduce((it, f) => filter(it, f), it)\n    }\n\n    if (Array.isArray(q.orders)) {\n      it = q.orders.reduce((it, f) => sortAll(it, f), it)\n    }\n\n    if (q.offset != null) {\n      let i = 0\n      it = filter(it, () => i++ >= /** @type {number} */ (q.offset))\n    }\n\n    if (q.limit != null) {\n      it = take(it, q.limit)\n    }\n\n    return it\n  }\n}\n\nmodule.exports = Adapter\n","'use strict'\n\nconst tempdir = require('ipfs-utils/src/temp-dir')\nconst all = require('it-all')\n\n/**\n * Collect all values from the iterable and sort them using\n * the passed sorter function\n *\n * @template T\n * @param {AsyncIterable<T> | Iterable<T>} iterable\n * @param {(a: T, b: T) => -1 | 0 | 1} sorter\n * @returns {AsyncIterable<T>}\n */\nconst sortAll = (iterable, sorter) => {\n  return (async function * () {\n    const values = await all(iterable)\n    yield * values.sort(sorter)\n  })()\n}\n\n/**\n * @param {string} s\n * @param {string} r\n */\nconst replaceStartWith = (s, r) => {\n  const matcher = new RegExp('^' + r)\n  return s.replace(matcher, '')\n}\n\nmodule.exports = {\n  sortAll,\n  tmpdir: tempdir,\n  replaceStartWith\n}\n","'use strict'\n\nconst { nanoid } = require('nanoid')\n\n/**\n * Temporary folder\n *\n * @param {(uuid: string) => string} transform - Transform function to add prefixes or sufixes to the unique id\n * @returns {string} - Full real path to a temporary folder\n */\nconst tempdir = (transform = d => d) => {\n  return transform(nanoid())\n}\n\nmodule.exports = tempdir\n","'use strict'\n\n/**\n * Collects all values from an (async) iterable into an array and returns it.\n *\n * @template T\n * @param {AsyncIterable<T>|Iterable<T>} source\n */\nconst all = async (source) => {\n  const arr = []\n\n  for await (const entry of source) {\n    arr.push(entry)\n  }\n\n  return arr\n}\n\nmodule.exports = all\n","'use strict'\n\n/**\n * Drains an (async) iterable discarding its' content and does not return\n * anything.\n *\n * @template T\n * @param {AsyncIterable<T>|Iterable<T>} source\n * @returns {Promise<void>}\n */\nconst drain = async (source) => {\n  for await (const _ of source) { } // eslint-disable-line no-unused-vars,no-empty\n}\n\nmodule.exports = drain\n","'use strict'\n\n/**\n * Filters the passed (async) iterable by using the filter function\n *\n * @template T\n * @param {AsyncIterable<T>|Iterable<T>} source\n * @param {function(T):boolean|Promise<boolean>} fn\n */\nconst filter = async function * (source, fn) {\n  for await (const entry of source) {\n    if (await fn(entry)) {\n      yield entry\n    }\n  }\n}\n\nmodule.exports = filter\n","'use strict'\n\n/**\n * Stop iteration after n items have been received.\n *\n * @template T\n * @param {AsyncIterable<T>|Iterable<T>} source\n * @param {number} limit\n * @returns {AsyncIterable<T>}\n */\nconst take = async function * (source, limit) {\n  let items = 0\n\n  if (limit < 1) {\n    return\n  }\n\n  for await (const entry of source) {\n    yield entry\n\n    items++\n\n    if (items === limit) {\n      return\n    }\n  }\n}\n\nmodule.exports = take\n","'use strict'\n\nconst errCode = require('err-code')\n\n/**\n * @param {Error} [err]\n */\nfunction dbOpenFailedError (err) {\n  err = err || new Error('Cannot open database')\n  return errCode(err, 'ERR_DB_OPEN_FAILED')\n}\n\n/**\n * @param {Error} [err]\n */\nfunction dbDeleteFailedError (err) {\n  err = err || new Error('Delete failed')\n  return errCode(err, 'ERR_DB_DELETE_FAILED')\n}\n\n/**\n * @param {Error} [err]\n */\nfunction dbWriteFailedError (err) {\n  err = err || new Error('Write failed')\n  return errCode(err, 'ERR_DB_WRITE_FAILED')\n}\n\n/**\n * @param {Error} [err]\n */\nfunction notFoundError (err) {\n  err = err || new Error('Not Found')\n  return errCode(err, 'ERR_NOT_FOUND')\n}\n\n/**\n * @param {Error} [err]\n */\nfunction abortedError (err) {\n  err = err || new Error('Aborted')\n  return errCode(err, 'ERR_ABORTED')\n}\n\nmodule.exports = {\n  dbOpenFailedError,\n  dbDeleteFailedError,\n  dbWriteFailedError,\n  notFoundError,\n  abortedError\n}\n","/* eslint-disable no-unreachable */\n'use strict'\n\n// @ts-ignore\nconst TimeoutController = require('timeout-abort-controller')\nconst { anySignal } = require('any-signal')\nconst { default: parseDuration } = require('parse-duration')\nconst { TimeoutError } = require('./errors')\n\n/**\n * @template {any[]} Args\n * @template {Promise<any> | AsyncIterable<any>} R - The return type of `fn`\n * @param {(...args:Args) => R} fn\n * @param {number} [optionsArgIndex]\n * @returns {(...args:Args) => R}\n */\nfunction withTimeoutOption (fn, optionsArgIndex) {\n  // eslint-disable-next-line\n  return /** @returns {R} */(/** @type {Args} */...args) => {\n    const options = args[optionsArgIndex == null ? args.length - 1 : optionsArgIndex]\n    if (!options || !options.timeout) return fn(...args)\n\n    const timeout = typeof options.timeout === 'string'\n      ? parseDuration(options.timeout)\n      : options.timeout\n\n    const controller = new TimeoutController(timeout)\n\n    options.signal = anySignal([options.signal, controller.signal])\n\n    const fnRes = fn(...args)\n    // eslint-disable-next-line promise/param-names\n    const timeoutPromise = new Promise((_resolve, reject) => {\n      controller.signal.addEventListener('abort', () => {\n        reject(new TimeoutError())\n      })\n    })\n\n    const start = Date.now()\n\n    const maybeThrowTimeoutError = () => {\n      if (controller.signal.aborted) {\n        throw new TimeoutError()\n      }\n\n      const timeTaken = Date.now() - start\n\n      // if we have starved the event loop by adding microtasks, we could have\n      // timed out already but the TimeoutController will never know because it's\n      // setTimeout will not fire until we stop adding microtasks\n      if (timeTaken > timeout) {\n        controller.abort()\n        throw new TimeoutError()\n      }\n    }\n\n    // @ts-ignore\n    if (fnRes[Symbol.asyncIterator]) {\n      // @ts-ignore\n      return (async function * () {\n        // @ts-ignore\n        const it = fnRes[Symbol.asyncIterator]()\n\n        try {\n          while (true) {\n            const { value, done } = await Promise.race([it.next(), timeoutPromise])\n\n            if (done) {\n              break\n            }\n\n            maybeThrowTimeoutError()\n\n            yield value\n          }\n        } catch (err) {\n          maybeThrowTimeoutError()\n\n          throw err\n        } finally {\n          controller.clear()\n\n          if (it.return) {\n            it.return()\n          }\n        }\n      })()\n    }\n\n    // @ts-ignore\n    return (async () => {\n      try {\n        const res = await Promise.race([fnRes, timeoutPromise])\n\n        maybeThrowTimeoutError()\n\n        return res\n      } catch (err) {\n        maybeThrowTimeoutError()\n\n        throw err\n      } finally {\n        controller.clear()\n      }\n    })()\n  }\n}\n\nmodule.exports = withTimeoutOption\n","/* globals self, window */\n'use strict'\n\n// Get around https://github.com/mysticatea/abort-controller/pull/22\nconst { AbortController } =\n  typeof self !== 'undefined' ? self\n    : typeof window !== 'undefined' ? window\n    /* otherwise */ : require('abort-controller')\n\nconst retimer = require('retimer')\n\nclass TimeoutController extends AbortController {\n  /**\n   * @constructor\n   * @param {number} ms milliseconds\n   */\n  constructor (ms) {\n    super()\n    this._ms = ms\n    this._timer = retimer(() => this.abort(), ms)\n    // Patch for safari not supported extending built in classes\n    Object.setPrototypeOf(this, TimeoutController.prototype)\n  }\n\n  /**\n   * Aborts the controller and clears the timer\n   */\n  abort () {\n    this._timer.clear()\n    return super.abort()\n  }\n\n  /**\n   * Clears the timer\n   */\n  clear () {\n    this._timer.clear()\n  }\n\n  /**\n   * Resets the timer\n   */\n  reset () {\n    this._timer.clear()\n    this._timer = retimer(() => this.abort(), this._ms)\n  }\n}\n\nmodule.exports = TimeoutController\nmodule.exports.TimeoutController = TimeoutController\n","'use strict'\n\nvar getTime = require('./time')\n\nfunction Retimer (callback, timeout, args) {\n  var that = this\n\n  this._started = getTime()\n  this._rescheduled = 0\n  this._scheduled = timeout\n  this._args = args\n\n  this._timer = setTimeout(timerWrapper, timeout)\n\n  function timerWrapper () {\n    if (that._rescheduled > 0) {\n      that._scheduled = that._rescheduled - (getTime() - that._started)\n      that._timer = setTimeout(timerWrapper, that._scheduled)\n      that._rescheduled = 0\n    } else {\n      callback.apply(null, that._args)\n    }\n  }\n}\n\nRetimer.prototype.reschedule = function (timeout) {\n  var now = getTime()\n  if ((now + timeout) - (this._started + this._scheduled) < 0) {\n    return false\n  } else {\n    this._started = now\n    this._rescheduled = timeout\n    return true\n  }\n}\n\nRetimer.prototype.clear = function () {\n  clearTimeout(this._timer)\n}\n\nfunction retimer () {\n  if (typeof arguments[0] !== 'function') {\n    throw new Error('callback needed')\n  }\n\n  if (typeof arguments[1] !== 'number') {\n    throw new Error('timeout needed')\n  }\n\n  var args\n\n  if (arguments.length > 0) {\n    args = new Array(arguments.length - 2)\n\n    for (var i = 0; i < args.length; i++) {\n      args[i] = arguments[i + 2]\n    }\n  }\n\n  return new Retimer(arguments[0], arguments[1], args)\n}\n\nmodule.exports = retimer\n","'use strict'\n\nmodule.exports = function getTime () {\n  return Date.now()\n}\n","'use strict'\r\n\r\nvar durationRE = /(-?(?:\\d+\\.?\\d*|\\d*\\.?\\d+)(?:e[-+]?\\d+)?)\\s*([\\p{L}]*)/uig\r\n\r\nmodule.exports = parse\r\n// enable default import syntax in typescript\r\nmodule.exports.default = parse\r\n\r\n/**\r\n * conversion ratios\r\n */\r\n\r\nparse.nanosecond =\r\nparse.ns = 1 / 1e6\r\n\r\nparse['µs'] =\r\nparse['μs'] =\r\nparse.us =\r\nparse.microsecond = 1 / 1e3\r\n\r\nparse.millisecond =\r\nparse.ms =\r\nparse[''] = 1\r\n\r\nparse.second =\r\nparse.sec =\r\nparse.s = parse.ms * 1000\r\n\r\nparse.minute =\r\nparse.min =\r\nparse.m = parse.s * 60\r\n\r\nparse.hour =\r\nparse.hr =\r\nparse.h = parse.m * 60\r\n\r\nparse.day =\r\nparse.d = parse.h * 24\r\n\r\nparse.week =\r\nparse.wk =\r\nparse.w = parse.d * 7\r\n\r\nparse.month =\r\nparse.b =\r\nparse.d * (365.25 / 12)\r\n\r\nparse.year =\r\nparse.yr =\r\nparse.y = parse.d * 365.25\r\n\r\n/**\r\n * convert `str` to ms\r\n *\r\n * @param {String} str\r\n * @param {String} format\r\n * @return {Number}\r\n */\r\n\r\nfunction parse(str='', format='ms'){\r\n  var result = null\r\n  // ignore commas/placeholders\r\n  str = (str+'').replace(/(\\d)[,_](\\d)/g, '$1$2')\r\n  str.replace(durationRE, function(_, n, units){\r\n    units = unitRatio(units)\r\n    if (units) result = (result || 0) + parseFloat(n, 10) * units\r\n  })\r\n\r\n  return result && (result / (unitRatio(format) || 1))\r\n}\r\n\r\nfunction unitRatio(str) {\r\n  return parse[str] || parse[str.toLowerCase().replace(/s$/, '')]\r\n}\r\n","'use strict'\n\nclass TimeoutError extends Error {\n  constructor (message = 'request timed out') {\n    super(message)\n    this.name = 'TimeoutError'\n    this.code = TimeoutError.code\n  }\n}\n\nTimeoutError.code = 'ERR_TIMEOUT'\nexports.TimeoutError = TimeoutError\n","'use strict'\n\nconst CID = require('cids')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst toCidAndPath = require('ipfs-core-utils/src/to-cid-and-path')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../types').Preload} config.preload\n */\nmodule.exports = ({ ipld, preload }) => {\n  /**\n   * @type {import('ipfs-core-types/src/dag').API[\"resolve\"]}\n   */\n  async function resolve (ipfsPath, options = {}) {\n    const {\n      cid,\n      path\n    } = toCidAndPath(ipfsPath)\n\n    if (options.preload !== false) {\n      preload(cid)\n    }\n\n    if (path) {\n      options.path = path\n    }\n\n    let lastCid = cid\n    let lastRemainderPath = options.path || ''\n\n    if (lastRemainderPath.startsWith('/')) {\n      lastRemainderPath = lastRemainderPath.substring(1)\n    }\n\n    if (options.path) {\n      try {\n        for await (const { value, remainderPath } of ipld.resolve(cid, options.path, {\n          signal: options.signal\n        })) {\n          if (!CID.isCID(value)) {\n            break\n          }\n\n          lastRemainderPath = remainderPath\n          lastCid = value\n        }\n      } catch (err) {\n        // TODO: add error codes to IPLD\n        if (err.message.startsWith('Object has no property')) {\n          err.message = `no link named \"${lastRemainderPath.split('/')[0]}\" under ${lastCid}`\n          err.code = 'ERR_NO_LINK'\n        }\n        throw err\n      }\n    }\n\n    return {\n      cid: lastCid,\n      remainderPath: lastRemainderPath || ''\n    }\n  }\n\n  return withTimeoutOption(resolve)\n}\n","'use strict'\n\nconst CID = require('cids')\nconst errCode = require('err-code')\n\nconst IPFS_PREFIX = '/ipfs/'\n\n/**\n * @param {string|Uint8Array|CID} string\n * @returns {{cid:CID, path?:string}}\n */\nconst toCidAndPath = (string) => {\n  if (string instanceof Uint8Array) {\n    try {\n      string = new CID(string)\n    } catch (err) {\n      throw errCode(err, 'ERR_INVALID_CID')\n    }\n  }\n\n  if (CID.isCID(string)) {\n    return {\n      cid: string,\n      path: undefined\n    }\n  }\n\n  if (string.startsWith(IPFS_PREFIX)) {\n    string = string.substring(IPFS_PREFIX.length)\n  }\n\n  const parts = string.split('/')\n  let cid\n  let path\n\n  try {\n    cid = new CID(/** @type {string} */(parts.shift()))\n  } catch (err) {\n    throw errCode(err, 'ERR_INVALID_CID')\n  }\n\n  if (parts.length) {\n    path = `/${parts.join('/')}`\n  }\n\n  return {\n    cid,\n    path\n  }\n}\n\nmodule.exports = toCidAndPath\n","/* eslint-env browser */\n\n/**\n * This is the web browser implementation of `debug()`.\n */\n\nexports.formatArgs = formatArgs;\nexports.save = save;\nexports.load = load;\nexports.useColors = useColors;\nexports.storage = localstorage();\nexports.destroy = (() => {\n\tlet warned = false;\n\n\treturn () => {\n\t\tif (!warned) {\n\t\t\twarned = true;\n\t\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t\t}\n\t};\n})();\n\n/**\n * Colors.\n */\n\nexports.colors = [\n\t'#0000CC',\n\t'#0000FF',\n\t'#0033CC',\n\t'#0033FF',\n\t'#0066CC',\n\t'#0066FF',\n\t'#0099CC',\n\t'#0099FF',\n\t'#00CC00',\n\t'#00CC33',\n\t'#00CC66',\n\t'#00CC99',\n\t'#00CCCC',\n\t'#00CCFF',\n\t'#3300CC',\n\t'#3300FF',\n\t'#3333CC',\n\t'#3333FF',\n\t'#3366CC',\n\t'#3366FF',\n\t'#3399CC',\n\t'#3399FF',\n\t'#33CC00',\n\t'#33CC33',\n\t'#33CC66',\n\t'#33CC99',\n\t'#33CCCC',\n\t'#33CCFF',\n\t'#6600CC',\n\t'#6600FF',\n\t'#6633CC',\n\t'#6633FF',\n\t'#66CC00',\n\t'#66CC33',\n\t'#9900CC',\n\t'#9900FF',\n\t'#9933CC',\n\t'#9933FF',\n\t'#99CC00',\n\t'#99CC33',\n\t'#CC0000',\n\t'#CC0033',\n\t'#CC0066',\n\t'#CC0099',\n\t'#CC00CC',\n\t'#CC00FF',\n\t'#CC3300',\n\t'#CC3333',\n\t'#CC3366',\n\t'#CC3399',\n\t'#CC33CC',\n\t'#CC33FF',\n\t'#CC6600',\n\t'#CC6633',\n\t'#CC9900',\n\t'#CC9933',\n\t'#CCCC00',\n\t'#CCCC33',\n\t'#FF0000',\n\t'#FF0033',\n\t'#FF0066',\n\t'#FF0099',\n\t'#FF00CC',\n\t'#FF00FF',\n\t'#FF3300',\n\t'#FF3333',\n\t'#FF3366',\n\t'#FF3399',\n\t'#FF33CC',\n\t'#FF33FF',\n\t'#FF6600',\n\t'#FF6633',\n\t'#FF9900',\n\t'#FF9933',\n\t'#FFCC00',\n\t'#FFCC33'\n];\n\n/**\n * Currently only WebKit-based Web Inspectors, Firefox >= v31,\n * and the Firebug extension (any Firefox version) are known\n * to support \"%c\" CSS customizations.\n *\n * TODO: add a `localStorage` variable to explicitly enable/disable colors\n */\n\n// eslint-disable-next-line complexity\nfunction useColors() {\n\t// NB: In an Electron preload script, document will be defined but not fully\n\t// initialized. Since we know we're in Chrome, we'll just detect this case\n\t// explicitly\n\tif (typeof window !== 'undefined' && window.process && (window.process.type === 'renderer' || window.process.__nwjs)) {\n\t\treturn true;\n\t}\n\n\t// Internet Explorer and Edge do not support colors.\n\tif (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\\/(\\d+)/)) {\n\t\treturn false;\n\t}\n\n\t// Is webkit? http://stackoverflow.com/a/16459606/376773\n\t// document is undefined in react-native: https://github.com/facebook/react-native/pull/1632\n\treturn (typeof document !== 'undefined' && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance) ||\n\t\t// Is firebug? http://stackoverflow.com/a/398120/376773\n\t\t(typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||\n\t\t// Is firefox >= v31?\n\t\t// https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/firefox\\/(\\d+)/) && parseInt(RegExp.$1, 10) >= 31) ||\n\t\t// Double check webkit in userAgent just in case we are in a worker\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\\/(\\d+)/));\n}\n\n/**\n * Colorize log arguments if enabled.\n *\n * @api public\n */\n\nfunction formatArgs(args) {\n\targs[0] = (this.useColors ? '%c' : '') +\n\t\tthis.namespace +\n\t\t(this.useColors ? ' %c' : ' ') +\n\t\targs[0] +\n\t\t(this.useColors ? '%c ' : ' ') +\n\t\t'+' + module.exports.humanize(this.diff);\n\n\tif (!this.useColors) {\n\t\treturn;\n\t}\n\n\tconst c = 'color: ' + this.color;\n\targs.splice(1, 0, c, 'color: inherit');\n\n\t// The final \"%c\" is somewhat tricky, because there could be other\n\t// arguments passed either before or after the %c, so we need to\n\t// figure out the correct index to insert the CSS into\n\tlet index = 0;\n\tlet lastC = 0;\n\targs[0].replace(/%[a-zA-Z%]/g, match => {\n\t\tif (match === '%%') {\n\t\t\treturn;\n\t\t}\n\t\tindex++;\n\t\tif (match === '%c') {\n\t\t\t// We only are interested in the *last* %c\n\t\t\t// (the user may have provided their own)\n\t\t\tlastC = index;\n\t\t}\n\t});\n\n\targs.splice(lastC, 0, c);\n}\n\n/**\n * Invokes `console.debug()` when available.\n * No-op when `console.debug` is not a \"function\".\n * If `console.debug` is not available, falls back\n * to `console.log`.\n *\n * @api public\n */\nexports.log = console.debug || console.log || (() => {});\n\n/**\n * Save `namespaces`.\n *\n * @param {String} namespaces\n * @api private\n */\nfunction save(namespaces) {\n\ttry {\n\t\tif (namespaces) {\n\t\t\texports.storage.setItem('debug', namespaces);\n\t\t} else {\n\t\t\texports.storage.removeItem('debug');\n\t\t}\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\n/**\n * Load `namespaces`.\n *\n * @return {String} returns the previously persisted debug modes\n * @api private\n */\nfunction load() {\n\tlet r;\n\ttry {\n\t\tr = exports.storage.getItem('debug');\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n\n\t// If debug isn't set in LS, and we're in Electron, try to load $DEBUG\n\tif (!r && typeof process !== 'undefined' && 'env' in process) {\n\t\tr = process.env.DEBUG;\n\t}\n\n\treturn r;\n}\n\n/**\n * Localstorage attempts to return the localstorage.\n *\n * This is necessary because safari throws\n * when a user disables cookies/localstorage\n * and you attempt to access it.\n *\n * @return {LocalStorage}\n * @api private\n */\n\nfunction localstorage() {\n\ttry {\n\t\t// TVMLKit (Apple TV JS Runtime) does not have a window object, just localStorage in the global context\n\t\t// The Browser also has localStorage in the global context.\n\t\treturn localStorage;\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\nmodule.exports = require('./common')(exports);\n\nconst {formatters} = module.exports;\n\n/**\n * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.\n */\n\nformatters.j = function (v) {\n\ttry {\n\t\treturn JSON.stringify(v);\n\t} catch (error) {\n\t\treturn '[UnexpectedJSONParseError]: ' + error.message;\n\t}\n};\n","\n/**\n * This is the common logic for both the Node.js and web browser\n * implementations of `debug()`.\n */\n\nfunction setup(env) {\n\tcreateDebug.debug = createDebug;\n\tcreateDebug.default = createDebug;\n\tcreateDebug.coerce = coerce;\n\tcreateDebug.disable = disable;\n\tcreateDebug.enable = enable;\n\tcreateDebug.enabled = enabled;\n\tcreateDebug.humanize = require('ms');\n\tcreateDebug.destroy = destroy;\n\n\tObject.keys(env).forEach(key => {\n\t\tcreateDebug[key] = env[key];\n\t});\n\n\t/**\n\t* The currently active debug mode names, and names to skip.\n\t*/\n\n\tcreateDebug.names = [];\n\tcreateDebug.skips = [];\n\n\t/**\n\t* Map of special \"%n\" handling functions, for the debug \"format\" argument.\n\t*\n\t* Valid key names are a single, lower or upper-case letter, i.e. \"n\" and \"N\".\n\t*/\n\tcreateDebug.formatters = {};\n\n\t/**\n\t* Selects a color for a debug namespace\n\t* @param {String} namespace The namespace string for the for the debug instance to be colored\n\t* @return {Number|String} An ANSI color code for the given namespace\n\t* @api private\n\t*/\n\tfunction selectColor(namespace) {\n\t\tlet hash = 0;\n\n\t\tfor (let i = 0; i < namespace.length; i++) {\n\t\t\thash = ((hash << 5) - hash) + namespace.charCodeAt(i);\n\t\t\thash |= 0; // Convert to 32bit integer\n\t\t}\n\n\t\treturn createDebug.colors[Math.abs(hash) % createDebug.colors.length];\n\t}\n\tcreateDebug.selectColor = selectColor;\n\n\t/**\n\t* Create a debugger with the given `namespace`.\n\t*\n\t* @param {String} namespace\n\t* @return {Function}\n\t* @api public\n\t*/\n\tfunction createDebug(namespace) {\n\t\tlet prevTime;\n\t\tlet enableOverride = null;\n\n\t\tfunction debug(...args) {\n\t\t\t// Disabled?\n\t\t\tif (!debug.enabled) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst self = debug;\n\n\t\t\t// Set `diff` timestamp\n\t\t\tconst curr = Number(new Date());\n\t\t\tconst ms = curr - (prevTime || curr);\n\t\t\tself.diff = ms;\n\t\t\tself.prev = prevTime;\n\t\t\tself.curr = curr;\n\t\t\tprevTime = curr;\n\n\t\t\targs[0] = createDebug.coerce(args[0]);\n\n\t\t\tif (typeof args[0] !== 'string') {\n\t\t\t\t// Anything else let's inspect with %O\n\t\t\t\targs.unshift('%O');\n\t\t\t}\n\n\t\t\t// Apply any `formatters` transformations\n\t\t\tlet index = 0;\n\t\t\targs[0] = args[0].replace(/%([a-zA-Z%])/g, (match, format) => {\n\t\t\t\t// If we encounter an escaped % then don't increase the array index\n\t\t\t\tif (match === '%%') {\n\t\t\t\t\treturn '%';\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t\tconst formatter = createDebug.formatters[format];\n\t\t\t\tif (typeof formatter === 'function') {\n\t\t\t\t\tconst val = args[index];\n\t\t\t\t\tmatch = formatter.call(self, val);\n\n\t\t\t\t\t// Now we need to remove `args[index]` since it's inlined in the `format`\n\t\t\t\t\targs.splice(index, 1);\n\t\t\t\t\tindex--;\n\t\t\t\t}\n\t\t\t\treturn match;\n\t\t\t});\n\n\t\t\t// Apply env-specific formatting (colors, etc.)\n\t\t\tcreateDebug.formatArgs.call(self, args);\n\n\t\t\tconst logFn = self.log || createDebug.log;\n\t\t\tlogFn.apply(self, args);\n\t\t}\n\n\t\tdebug.namespace = namespace;\n\t\tdebug.useColors = createDebug.useColors();\n\t\tdebug.color = createDebug.selectColor(namespace);\n\t\tdebug.extend = extend;\n\t\tdebug.destroy = createDebug.destroy; // XXX Temporary. Will be removed in the next major release.\n\n\t\tObject.defineProperty(debug, 'enabled', {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\tget: () => enableOverride === null ? createDebug.enabled(namespace) : enableOverride,\n\t\t\tset: v => {\n\t\t\t\tenableOverride = v;\n\t\t\t}\n\t\t});\n\n\t\t// Env-specific initialization logic for debug instances\n\t\tif (typeof createDebug.init === 'function') {\n\t\t\tcreateDebug.init(debug);\n\t\t}\n\n\t\treturn debug;\n\t}\n\n\tfunction extend(namespace, delimiter) {\n\t\tconst newDebug = createDebug(this.namespace + (typeof delimiter === 'undefined' ? ':' : delimiter) + namespace);\n\t\tnewDebug.log = this.log;\n\t\treturn newDebug;\n\t}\n\n\t/**\n\t* Enables a debug mode by namespaces. This can include modes\n\t* separated by a colon and wildcards.\n\t*\n\t* @param {String} namespaces\n\t* @api public\n\t*/\n\tfunction enable(namespaces) {\n\t\tcreateDebug.save(namespaces);\n\n\t\tcreateDebug.names = [];\n\t\tcreateDebug.skips = [];\n\n\t\tlet i;\n\t\tconst split = (typeof namespaces === 'string' ? namespaces : '').split(/[\\s,]+/);\n\t\tconst len = split.length;\n\n\t\tfor (i = 0; i < len; i++) {\n\t\t\tif (!split[i]) {\n\t\t\t\t// ignore empty strings\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tnamespaces = split[i].replace(/\\*/g, '.*?');\n\n\t\t\tif (namespaces[0] === '-') {\n\t\t\t\tcreateDebug.skips.push(new RegExp('^' + namespaces.substr(1) + '$'));\n\t\t\t} else {\n\t\t\t\tcreateDebug.names.push(new RegExp('^' + namespaces + '$'));\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t* Disable debug output.\n\t*\n\t* @return {String} namespaces\n\t* @api public\n\t*/\n\tfunction disable() {\n\t\tconst namespaces = [\n\t\t\t...createDebug.names.map(toNamespace),\n\t\t\t...createDebug.skips.map(toNamespace).map(namespace => '-' + namespace)\n\t\t].join(',');\n\t\tcreateDebug.enable('');\n\t\treturn namespaces;\n\t}\n\n\t/**\n\t* Returns true if the given mode name is enabled, false otherwise.\n\t*\n\t* @param {String} name\n\t* @return {Boolean}\n\t* @api public\n\t*/\n\tfunction enabled(name) {\n\t\tif (name[name.length - 1] === '*') {\n\t\t\treturn true;\n\t\t}\n\n\t\tlet i;\n\t\tlet len;\n\n\t\tfor (i = 0, len = createDebug.skips.length; i < len; i++) {\n\t\t\tif (createDebug.skips[i].test(name)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tfor (i = 0, len = createDebug.names.length; i < len; i++) {\n\t\t\tif (createDebug.names[i].test(name)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/**\n\t* Convert regexp to namespace\n\t*\n\t* @param {RegExp} regxep\n\t* @return {String} namespace\n\t* @api private\n\t*/\n\tfunction toNamespace(regexp) {\n\t\treturn regexp.toString()\n\t\t\t.substring(2, regexp.toString().length - 2)\n\t\t\t.replace(/\\.\\*\\?$/, '*');\n\t}\n\n\t/**\n\t* Coerce `val`.\n\t*\n\t* @param {Mixed} val\n\t* @return {Mixed}\n\t* @api private\n\t*/\n\tfunction coerce(val) {\n\t\tif (val instanceof Error) {\n\t\t\treturn val.stack || val.message;\n\t\t}\n\t\treturn val;\n\t}\n\n\t/**\n\t* XXX DO NOT USE. This is a temporary stub function.\n\t* XXX It WILL be removed in the next major release.\n\t*/\n\tfunction destroy() {\n\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t}\n\n\tcreateDebug.enable(createDebug.load());\n\n\treturn createDebug;\n}\n\nmodule.exports = setup;\n","/**\n * Helpers.\n */\n\nvar s = 1000;\nvar m = s * 60;\nvar h = m * 60;\nvar d = h * 24;\nvar w = d * 7;\nvar y = d * 365.25;\n\n/**\n * Parse or format the given `val`.\n *\n * Options:\n *\n *  - `long` verbose formatting [false]\n *\n * @param {String|Number} val\n * @param {Object} [options]\n * @throws {Error} throw an error if val is not a non-empty string or a number\n * @return {String|Number}\n * @api public\n */\n\nmodule.exports = function(val, options) {\n  options = options || {};\n  var type = typeof val;\n  if (type === 'string' && val.length > 0) {\n    return parse(val);\n  } else if (type === 'number' && isFinite(val)) {\n    return options.long ? fmtLong(val) : fmtShort(val);\n  }\n  throw new Error(\n    'val is not a non-empty string or a valid number. val=' +\n      JSON.stringify(val)\n  );\n};\n\n/**\n * Parse the given `str` and return milliseconds.\n *\n * @param {String} str\n * @return {Number}\n * @api private\n */\n\nfunction parse(str) {\n  str = String(str);\n  if (str.length > 100) {\n    return;\n  }\n  var match = /^(-?(?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(\n    str\n  );\n  if (!match) {\n    return;\n  }\n  var n = parseFloat(match[1]);\n  var type = (match[2] || 'ms').toLowerCase();\n  switch (type) {\n    case 'years':\n    case 'year':\n    case 'yrs':\n    case 'yr':\n    case 'y':\n      return n * y;\n    case 'weeks':\n    case 'week':\n    case 'w':\n      return n * w;\n    case 'days':\n    case 'day':\n    case 'd':\n      return n * d;\n    case 'hours':\n    case 'hour':\n    case 'hrs':\n    case 'hr':\n    case 'h':\n      return n * h;\n    case 'minutes':\n    case 'minute':\n    case 'mins':\n    case 'min':\n    case 'm':\n      return n * m;\n    case 'seconds':\n    case 'second':\n    case 'secs':\n    case 'sec':\n    case 's':\n      return n * s;\n    case 'milliseconds':\n    case 'millisecond':\n    case 'msecs':\n    case 'msec':\n    case 'ms':\n      return n;\n    default:\n      return undefined;\n  }\n}\n\n/**\n * Short format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtShort(ms) {\n  var msAbs = Math.abs(ms);\n  if (msAbs >= d) {\n    return Math.round(ms / d) + 'd';\n  }\n  if (msAbs >= h) {\n    return Math.round(ms / h) + 'h';\n  }\n  if (msAbs >= m) {\n    return Math.round(ms / m) + 'm';\n  }\n  if (msAbs >= s) {\n    return Math.round(ms / s) + 's';\n  }\n  return ms + 'ms';\n}\n\n/**\n * Long format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtLong(ms) {\n  var msAbs = Math.abs(ms);\n  if (msAbs >= d) {\n    return plural(ms, msAbs, d, 'day');\n  }\n  if (msAbs >= h) {\n    return plural(ms, msAbs, h, 'hour');\n  }\n  if (msAbs >= m) {\n    return plural(ms, msAbs, m, 'minute');\n  }\n  if (msAbs >= s) {\n    return plural(ms, msAbs, s, 'second');\n  }\n  return ms + ' ms';\n}\n\n/**\n * Pluralization helper.\n */\n\nfunction plural(ms, msAbs, n, name) {\n  var isPlural = msAbs >= n * 1.5;\n  return Math.round(ms / n) + ' ' + name + (isPlural ? 's' : '');\n}\n","'use strict'\n\nconst resolver = require('./resolver')\nconst util = require('./util')\nconst DAGNodeClass = require('./dag-node/dagNode')\nconst DAGLinkClass = require('./dag-link/dagLink')\n\n/**\n * @typedef {import('./types').DAGLinkLike} DAGLinkLike\n * @typedef {import('./types').DAGNodeLike} DAGNodeLike\n * @typedef {import('./dag-node/dagNode')} DAGNode\n * @typedef {import('./dag-link/dagLink')} DAGLink\n */\n\n/**\n * @type {import('./types').DAGNodeFormat}\n */\nconst format = {\n  DAGNode: DAGNodeClass,\n  DAGLink: DAGLinkClass,\n\n  /**\n   * Functions to fulfil IPLD Format interface\n   * https://github.com/ipld/interface-ipld-format\n   */\n  resolver,\n  util,\n  codec: util.codec,\n  defaultHashAlg: util.defaultHashAlg\n}\n\nmodule.exports = format\n","'use strict'\n\nconst CID = require('cids')\n\nconst util = require('./util')\n\n/**\n * Resolves a path within a PB block.\n *\n * If the path resolves half-way to a link, then the `remainderPath` is the part\n * after the link that can be used for further resolving\n *\n * Returns the value or a link and the partial missing path. This way the\n * IPLD Resolver can fetch the link and continue to resolve.\n *\n * @param {Uint8Array} binaryBlob - Binary representation of a PB block\n * @param {string} [path='/'] - Path that should be resolved\n */\nexports.resolve = (binaryBlob, path = '/') => {\n  let node = util.deserialize(binaryBlob)\n\n  const parts = path.split('/').filter(Boolean)\n  while (parts.length) {\n    const key = parts.shift()\n    // @ts-ignore\n    if (node[key] === undefined) {\n      // There might be a matching named link\n      for (const link of node.Links) {\n        if (link.Name === key) {\n          return {\n            value: link.Hash,\n            remainderPath: parts.join('/')\n          }\n        }\n      }\n\n      // There wasn't even a matching named link\n      throw new Error(`Object has no property '${key}'`)\n    }\n\n    // @ts-ignore\n    node = node[key]\n    if (CID.isCID(node)) {\n      return {\n        value: node,\n        remainderPath: parts.join('/')\n      }\n    }\n  }\n\n  return {\n    value: node,\n    remainderPath: ''\n  }\n}\n\n/**\n * Return all available paths of a block.\n *\n * @generator\n * @param {Uint8Array} binaryBlob - Binary representation of a PB block\n * @yields {string} - A single path\n */\nexports.tree = function * (binaryBlob) {\n  const node = util.deserialize(binaryBlob)\n\n  // There is always a `Data` and `Links` property\n  yield 'Data'\n  yield 'Links'\n  for (let ii = 0; ii < node.Links.length; ii++) {\n    yield `Links/${ii}`\n    yield `Links/${ii}/Name`\n    yield `Links/${ii}/Tsize`\n    yield `Links/${ii}/Hash`\n  }\n}\n","'use strict'\n\nconst {\n  PBNode\n} = require('./dag')\nconst DAGLink = require('./dag-link/dagLink')\nconst DAGNode = require('./dag-node/dagNode')\nconst { serializeDAGNode, serializeDAGNodeLike } = require('./serialize')\nconst genCid = require('./genCid')\n\n/**\n * @typedef {import('./types').DAGLinkLike} DAGLinkLike\n */\n\n/**\n * Calculate the CID of the binary blob\n *\n * @param {Uint8Array} binaryBlob - Encoded IPLD Node\n * @param {import('./genCid').GenCIDOptions} [userOptions] - Options to create the CID\n */\nconst cid = (binaryBlob, userOptions) => {\n  return genCid.cid(binaryBlob, userOptions)\n}\n\n/**\n * Serialize internal representation into a binary PB block\n *\n * @param {DAGNode | { Data?: Uint8Array, Links?: (DAGLink | DAGLinkLike)[]}} node\n */\nconst serialize = (node) => {\n  if (node instanceof DAGNode) {\n    return serializeDAGNode(node)\n  } else {\n    return serializeDAGNodeLike(node.Data, node.Links)\n  }\n}\n\n/**\n * Deserialize PB block into the internal representation.\n *\n * @param {Uint8Array} buffer - Binary representation of a PB block\n */\nconst deserialize = (buffer) => {\n  const message = PBNode.decode(buffer)\n  const pbn = PBNode.toObject(message, {\n    defaults: false,\n    arrays: true,\n    longs: Number,\n    objects: false\n  })\n\n  /** @type {DAGLink[]} */\n  const links = pbn.Links.map((/** @type {DAGLinkLike} */ link) => {\n    // @ts-ignore\n    return new DAGLink(link.Name, link.Tsize, link.Hash)\n  })\n\n  const data = pbn.Data == null ? new Uint8Array(0) : pbn.Data\n\n  return new DAGNode(data, links, buffer.byteLength)\n}\n\nmodule.exports = {\n  codec: genCid.codec,\n  defaultHashAlg: genCid.defaultHashAlg,\n  serialize,\n  deserialize,\n  cid\n}\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"default\"] || ($protobuf.roots[\"default\"] = {});\n\n$root.PBLink = (function() {\n\n    /**\n     * Properties of a PBLink.\n     * @exports IPBLink\n     * @interface IPBLink\n     * @property {Uint8Array|null} [Hash] PBLink Hash\n     * @property {string|null} [Name] PBLink Name\n     * @property {number|null} [Tsize] PBLink Tsize\n     */\n\n    /**\n     * Constructs a new PBLink.\n     * @exports PBLink\n     * @classdesc Represents a PBLink.\n     * @implements IPBLink\n     * @constructor\n     * @param {IPBLink=} [p] Properties to set\n     */\n    function PBLink(p) {\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * PBLink Hash.\n     * @member {Uint8Array} Hash\n     * @memberof PBLink\n     * @instance\n     */\n    PBLink.prototype.Hash = $util.newBuffer([]);\n\n    /**\n     * PBLink Name.\n     * @member {string} Name\n     * @memberof PBLink\n     * @instance\n     */\n    PBLink.prototype.Name = \"\";\n\n    /**\n     * PBLink Tsize.\n     * @member {number} Tsize\n     * @memberof PBLink\n     * @instance\n     */\n    PBLink.prototype.Tsize = $util.Long ? $util.Long.fromBits(0,0,true) : 0;\n\n    /**\n     * Encodes the specified PBLink message. Does not implicitly {@link PBLink.verify|verify} messages.\n     * @function encode\n     * @memberof PBLink\n     * @static\n     * @param {IPBLink} m PBLink message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    PBLink.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.Hash != null && Object.hasOwnProperty.call(m, \"Hash\"))\n            w.uint32(10).bytes(m.Hash);\n        if (m.Name != null && Object.hasOwnProperty.call(m, \"Name\"))\n            w.uint32(18).string(m.Name);\n        if (m.Tsize != null && Object.hasOwnProperty.call(m, \"Tsize\"))\n            w.uint32(24).uint64(m.Tsize);\n        return w;\n    };\n\n    /**\n     * Decodes a PBLink message from the specified reader or buffer.\n     * @function decode\n     * @memberof PBLink\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {PBLink} PBLink\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    PBLink.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.PBLink();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.Hash = r.bytes();\n                break;\n            case 2:\n                m.Name = r.string();\n                break;\n            case 3:\n                m.Tsize = r.uint64();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a PBLink message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof PBLink\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {PBLink} PBLink\n     */\n    PBLink.fromObject = function fromObject(d) {\n        if (d instanceof $root.PBLink)\n            return d;\n        var m = new $root.PBLink();\n        if (d.Hash != null) {\n            if (typeof d.Hash === \"string\")\n                $util.base64.decode(d.Hash, m.Hash = $util.newBuffer($util.base64.length(d.Hash)), 0);\n            else if (d.Hash.length)\n                m.Hash = d.Hash;\n        }\n        if (d.Name != null) {\n            m.Name = String(d.Name);\n        }\n        if (d.Tsize != null) {\n            if ($util.Long)\n                (m.Tsize = $util.Long.fromValue(d.Tsize)).unsigned = true;\n            else if (typeof d.Tsize === \"string\")\n                m.Tsize = parseInt(d.Tsize, 10);\n            else if (typeof d.Tsize === \"number\")\n                m.Tsize = d.Tsize;\n            else if (typeof d.Tsize === \"object\")\n                m.Tsize = new $util.LongBits(d.Tsize.low >>> 0, d.Tsize.high >>> 0).toNumber(true);\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a PBLink message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof PBLink\n     * @static\n     * @param {PBLink} m PBLink\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    PBLink.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.defaults) {\n            if (o.bytes === String)\n                d.Hash = \"\";\n            else {\n                d.Hash = [];\n                if (o.bytes !== Array)\n                    d.Hash = $util.newBuffer(d.Hash);\n            }\n            d.Name = \"\";\n            if ($util.Long) {\n                var n = new $util.Long(0, 0, true);\n                d.Tsize = o.longs === String ? n.toString() : o.longs === Number ? n.toNumber() : n;\n            } else\n                d.Tsize = o.longs === String ? \"0\" : 0;\n        }\n        if (m.Hash != null && m.hasOwnProperty(\"Hash\")) {\n            d.Hash = o.bytes === String ? $util.base64.encode(m.Hash, 0, m.Hash.length) : o.bytes === Array ? Array.prototype.slice.call(m.Hash) : m.Hash;\n        }\n        if (m.Name != null && m.hasOwnProperty(\"Name\")) {\n            d.Name = m.Name;\n        }\n        if (m.Tsize != null && m.hasOwnProperty(\"Tsize\")) {\n            if (typeof m.Tsize === \"number\")\n                d.Tsize = o.longs === String ? String(m.Tsize) : m.Tsize;\n            else\n                d.Tsize = o.longs === String ? $util.Long.prototype.toString.call(m.Tsize) : o.longs === Number ? new $util.LongBits(m.Tsize.low >>> 0, m.Tsize.high >>> 0).toNumber(true) : m.Tsize;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this PBLink to JSON.\n     * @function toJSON\n     * @memberof PBLink\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    PBLink.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return PBLink;\n})();\n\n$root.PBNode = (function() {\n\n    /**\n     * Properties of a PBNode.\n     * @exports IPBNode\n     * @interface IPBNode\n     * @property {Array.<IPBLink>|null} [Links] PBNode Links\n     * @property {Uint8Array|null} [Data] PBNode Data\n     */\n\n    /**\n     * Constructs a new PBNode.\n     * @exports PBNode\n     * @classdesc Represents a PBNode.\n     * @implements IPBNode\n     * @constructor\n     * @param {IPBNode=} [p] Properties to set\n     */\n    function PBNode(p) {\n        this.Links = [];\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * PBNode Links.\n     * @member {Array.<IPBLink>} Links\n     * @memberof PBNode\n     * @instance\n     */\n    PBNode.prototype.Links = $util.emptyArray;\n\n    /**\n     * PBNode Data.\n     * @member {Uint8Array} Data\n     * @memberof PBNode\n     * @instance\n     */\n    PBNode.prototype.Data = $util.newBuffer([]);\n\n    /**\n     * Encodes the specified PBNode message. Does not implicitly {@link PBNode.verify|verify} messages.\n     * @function encode\n     * @memberof PBNode\n     * @static\n     * @param {IPBNode} m PBNode message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    PBNode.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.Data != null && Object.hasOwnProperty.call(m, \"Data\"))\n            w.uint32(10).bytes(m.Data);\n        if (m.Links != null && m.Links.length) {\n            for (var i = 0; i < m.Links.length; ++i)\n                $root.PBLink.encode(m.Links[i], w.uint32(18).fork()).ldelim();\n        }\n        return w;\n    };\n\n    /**\n     * Decodes a PBNode message from the specified reader or buffer.\n     * @function decode\n     * @memberof PBNode\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {PBNode} PBNode\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    PBNode.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.PBNode();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 2:\n                if (!(m.Links && m.Links.length))\n                    m.Links = [];\n                m.Links.push($root.PBLink.decode(r, r.uint32()));\n                break;\n            case 1:\n                m.Data = r.bytes();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a PBNode message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof PBNode\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {PBNode} PBNode\n     */\n    PBNode.fromObject = function fromObject(d) {\n        if (d instanceof $root.PBNode)\n            return d;\n        var m = new $root.PBNode();\n        if (d.Links) {\n            if (!Array.isArray(d.Links))\n                throw TypeError(\".PBNode.Links: array expected\");\n            m.Links = [];\n            for (var i = 0; i < d.Links.length; ++i) {\n                if (typeof d.Links[i] !== \"object\")\n                    throw TypeError(\".PBNode.Links: object expected\");\n                m.Links[i] = $root.PBLink.fromObject(d.Links[i]);\n            }\n        }\n        if (d.Data != null) {\n            if (typeof d.Data === \"string\")\n                $util.base64.decode(d.Data, m.Data = $util.newBuffer($util.base64.length(d.Data)), 0);\n            else if (d.Data.length)\n                m.Data = d.Data;\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a PBNode message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof PBNode\n     * @static\n     * @param {PBNode} m PBNode\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    PBNode.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.arrays || o.defaults) {\n            d.Links = [];\n        }\n        if (o.defaults) {\n            if (o.bytes === String)\n                d.Data = \"\";\n            else {\n                d.Data = [];\n                if (o.bytes !== Array)\n                    d.Data = $util.newBuffer(d.Data);\n            }\n        }\n        if (m.Data != null && m.hasOwnProperty(\"Data\")) {\n            d.Data = o.bytes === String ? $util.base64.encode(m.Data, 0, m.Data.length) : o.bytes === Array ? Array.prototype.slice.call(m.Data) : m.Data;\n        }\n        if (m.Links && m.Links.length) {\n            d.Links = [];\n            for (var j = 0; j < m.Links.length; ++j) {\n                d.Links[j] = $root.PBLink.toObject(m.Links[j], o);\n            }\n        }\n        return d;\n    };\n\n    /**\n     * Converts this PBNode to JSON.\n     * @function toJSON\n     * @memberof PBNode\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    PBNode.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return PBNode;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\nconst CID = require('cids')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n/**\n * Link represents an IPFS Merkle DAG Link between Nodes.\n */\nclass DAGLink {\n  /**\n   * @param {string | undefined | null} name\n   * @param {number} size\n   * @param {CID | string | Uint8Array} cid\n   */\n  constructor (name, size, cid) {\n    if (!cid) {\n      throw new Error('A link requires a cid to point to')\n    }\n\n    // assert(size, 'A link requires a size')\n    //  note - links should include size, but this assert is disabled\n    //  for now to maintain consistency with go-ipfs pinset\n    this.Name = name || ''\n    this.Tsize = size\n    this.Hash = new CID(cid)\n\n    Object.defineProperties(this, {\n      _nameBuf: { value: null, writable: true, enumerable: false }\n    })\n  }\n\n  toString () {\n    return `DAGLink <${this.Hash.toBaseEncodedString()} - name: \"${this.Name}\", size: ${this.Tsize}>`\n  }\n\n  toJSON () {\n    if (!this._json) {\n      this._json = Object.freeze({\n        name: this.Name,\n        size: this.Tsize,\n        cid: this.Hash.toBaseEncodedString()\n      })\n    }\n\n    return Object.assign({}, this._json)\n  }\n\n  // Memoize the Uint8Array representation of name\n  // We need this to sort the links, otherwise\n  // we will reallocate new Uint8Arrays every time\n  get nameAsBuffer () {\n    if (this._nameBuf != null) {\n      return this._nameBuf\n    }\n\n    this._nameBuf = uint8ArrayFromString(this.Name)\n    return this._nameBuf\n  }\n}\n\nmodule.exports = DAGLink\n","'use strict'\n\nconst sortLinks = require('./sortLinks')\nconst DAGLink = require('../dag-link/dagLink')\nconst { createDagLinkFromB58EncodedHash } = require('../dag-link/util')\nconst { serializeDAGNode } = require('../serialize')\nconst toDAGLink = require('./toDagLink')\nconst addLink = require('./addLink')\nconst rmLink = require('./rmLink')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('../types').DAGLinkLike} DAGLinkLike\n */\n\nclass DAGNode {\n  /**\n   *@param {Uint8Array | string} [data]\n   * @param {(DAGLink | DAGLinkLike)[]} links\n   * @param {number | null} [serializedSize]\n   */\n  constructor (data, links = [], serializedSize = null) {\n    if (!data) {\n      data = new Uint8Array(0)\n    }\n    if (typeof data === 'string') {\n      data = uint8ArrayFromString(data)\n    }\n\n    if (!(data instanceof Uint8Array)) {\n      throw new Error('Passed \\'data\\' is not a Uint8Array or a String!')\n    }\n\n    if (serializedSize !== null && typeof serializedSize !== 'number') {\n      throw new Error('Passed \\'serializedSize\\' must be a number!')\n    }\n\n    const sortedLinks = links.map((link) => {\n      return link instanceof DAGLink\n        ? link\n        : createDagLinkFromB58EncodedHash(link)\n    })\n    sortLinks(sortedLinks)\n\n    this.Data = data\n    this.Links = sortedLinks\n\n    Object.defineProperties(this, {\n      _serializedSize: { value: serializedSize, writable: true, enumerable: false },\n      _size: { value: null, writable: true, enumerable: false }\n    })\n  }\n\n  toJSON () {\n    if (!this._json) {\n      this._json = Object.freeze({\n        data: this.Data,\n        links: this.Links.map((l) => l.toJSON()),\n        size: this.size\n      })\n    }\n\n    return Object.assign({}, this._json)\n  }\n\n  toString () {\n    return `DAGNode <data: \"${uint8ArrayToString(this.Data, 'base64urlpad')}\", links: ${this.Links.length}, size: ${this.size}>`\n  }\n\n  _invalidateCached () {\n    this._serializedSize = null\n    this._size = null\n  }\n\n  /**\n   * @param {DAGLink | import('../types').DAGLinkLike} link\n   */\n  addLink (link) {\n    this._invalidateCached()\n    return addLink(this, link)\n  }\n\n  /**\n   * @param {DAGLink | string | CID} link\n   */\n  rmLink (link) {\n    this._invalidateCached()\n    return rmLink(this, link)\n  }\n\n  /**\n   * @param {import('./toDagLink').ToDagLinkOptions} [options]\n   */\n  toDAGLink (options) {\n    return toDAGLink(this, options)\n  }\n\n  serialize () {\n    const buf = serializeDAGNode(this)\n\n    this._serializedSize = buf.length\n\n    return buf\n  }\n\n  get size () {\n    if (this._size == null) {\n      let serializedSize\n\n      if (serializedSize == null) {\n        this._serializedSize = this.serialize().length\n        serializedSize = this._serializedSize\n      }\n\n      this._size = this.Links.reduce((sum, l) => sum + l.Tsize, serializedSize)\n    }\n\n    return this._size\n  }\n\n  set size (size) {\n    throw new Error(\"Can't set property: 'size' is immutable\")\n  }\n}\n\nmodule.exports = DAGNode\n","'use strict'\n\nconst sort = require('stable')\nconst uint8ArrayCompare = require('uint8arrays/compare')\n\n/**\n * @typedef {import('../dag-link/dagLink')} DAGLink\n */\n\n/**\n *\n * @param {DAGLink} a\n * @param {DAGLink} b\n */\nconst linkSort = (a, b) => {\n  const buf1 = a.nameAsBuffer\n  const buf2 = b.nameAsBuffer\n\n  return uint8ArrayCompare(buf1, buf2)\n}\n\n/**\n * Sorts links in place (mutating given array)\n *\n * @param {DAGLink[]} links\n * @returns {void}\n */\nconst sortLinks = (links) => {\n  sort.inplace(links, linkSort)\n}\n\nmodule.exports = sortLinks\n","//! stable.js 0.1.8, https://github.com/Two-Screen/stable\n//! © 2018 Angry Bytes and contributors. MIT licensed.\n\n(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n  typeof define === 'function' && define.amd ? define(factory) :\n  (global.stable = factory());\n}(this, (function () { 'use strict';\n\n  // A stable array sort, because `Array#sort()` is not guaranteed stable.\n  // This is an implementation of merge sort, without recursion.\n\n  var stable = function (arr, comp) {\n    return exec(arr.slice(), comp)\n  };\n\n  stable.inplace = function (arr, comp) {\n    var result = exec(arr, comp);\n\n    // This simply copies back if the result isn't in the original array,\n    // which happens on an odd number of passes.\n    if (result !== arr) {\n      pass(result, null, arr.length, arr);\n    }\n\n    return arr\n  };\n\n  // Execute the sort using the input array and a second buffer as work space.\n  // Returns one of those two, containing the final result.\n  function exec(arr, comp) {\n    if (typeof(comp) !== 'function') {\n      comp = function (a, b) {\n        return String(a).localeCompare(b)\n      };\n    }\n\n    // Short-circuit when there's nothing to sort.\n    var len = arr.length;\n    if (len <= 1) {\n      return arr\n    }\n\n    // Rather than dividing input, simply iterate chunks of 1, 2, 4, 8, etc.\n    // Chunks are the size of the left or right hand in merge sort.\n    // Stop when the left-hand covers all of the array.\n    var buffer = new Array(len);\n    for (var chk = 1; chk < len; chk *= 2) {\n      pass(arr, comp, chk, buffer);\n\n      var tmp = arr;\n      arr = buffer;\n      buffer = tmp;\n    }\n\n    return arr\n  }\n\n  // Run a single pass with the given chunk size.\n  var pass = function (arr, comp, chk, result) {\n    var len = arr.length;\n    var i = 0;\n    // Step size / double chunk size.\n    var dbl = chk * 2;\n    // Bounds of the left and right chunks.\n    var l, r, e;\n    // Iterators over the left and right chunk.\n    var li, ri;\n\n    // Iterate over pairs of chunks.\n    for (l = 0; l < len; l += dbl) {\n      r = l + chk;\n      e = r + chk;\n      if (r > len) r = len;\n      if (e > len) e = len;\n\n      // Iterate both chunks in parallel.\n      li = l;\n      ri = r;\n      while (true) {\n        // Compare the chunks.\n        if (li < r && ri < e) {\n          // This works for a regular `sort()` compatible comparator,\n          // but also for a simple comparator like: `a > b`\n          if (comp(arr[li], arr[ri]) <= 0) {\n            result[i++] = arr[li++];\n          }\n          else {\n            result[i++] = arr[ri++];\n          }\n        }\n        // Nothing to compare, just flush what's left.\n        else if (li < r) {\n          result[i++] = arr[li++];\n        }\n        else if (ri < e) {\n          result[i++] = arr[ri++];\n        }\n        // Both iterators are at the chunk ends.\n        else {\n          break\n        }\n      }\n    }\n  };\n\n  return stable;\n\n})));\n","'use strict'\n\n/**\n * Can be used with Array.sort to sort and array with Uint8Array entries\n *\n * @param {Uint8Array} a\n * @param {Uint8Array} b\n */\nfunction compare (a, b) {\n  for (let i = 0; i < a.byteLength; i++) {\n    if (a[i] < b[i]) {\n      return -1\n    }\n\n    if (a[i] > b[i]) {\n      return 1\n    }\n  }\n\n  if (a.byteLength > b.byteLength) {\n    return 1\n  }\n\n  if (a.byteLength < b.byteLength) {\n    return -1\n  }\n\n  return 0\n}\n\nmodule.exports = compare\n","'use strict'\n\nconst DAGLink = require('./dagLink')\n\n/**\n * @param {*} link\n */\nfunction createDagLinkFromB58EncodedHash (link) {\n  return new DAGLink(\n    link.Name || link.name || '',\n    link.Tsize || link.Size || link.size || 0,\n    link.Hash || link.hash || link.multihash || link.cid\n  )\n}\n\nmodule.exports = {\n  createDagLinkFromB58EncodedHash\n}\n","'use strict'\n\nconst protobuf = require('protobufjs/minimal')\nconst {\n  PBLink\n} = require('./dag')\n\nconst {\n  createDagLinkFromB58EncodedHash\n} = require('./dag-link/util')\n\n/**\n * @typedef {import('./dag-link/dagLink')} DAGLink\n * @typedef {import('./types').DAGLinkLike} DAGLinkLike\n * @typedef {import('./types').SerializableDAGNode} SerializableDAGNode\n * @typedef {import('cids')} CID\n */\n\n/**\n * @param { { Data?: Uint8Array, Links: (DAGLink | DAGLinkLike)[] }} node\n * @returns {SerializableDAGNode}\n */\nconst toProtoBuf = (node) => {\n  const pbn = {}\n\n  if (node.Data && node.Data.byteLength > 0) {\n    pbn.Data = node.Data\n  } else {\n    // NOTE: this has to be null in order to match go-ipfs serialization\n    // `null !== new Uint8Array(0)`\n    pbn.Data = null\n  }\n\n  if (node.Links && node.Links.length > 0) {\n    pbn.Links = node.Links\n      .map((link) => ({\n        Hash: link.Hash.bytes,\n        Name: link.Name,\n        Tsize: link.Tsize\n      }))\n  } else {\n    pbn.Links = null\n  }\n\n  return pbn\n}\n\n/**\n * Serialize internal representation into a binary PB block.\n *\n * @param {import('./dag-node/dagNode')} node - Internal representation of a PB block\n */\nconst serializeDAGNode = (node) => {\n  return encode(toProtoBuf(node))\n}\n\n/**\n * Serialize an object where the `Links` might not be a `DAGLink` instance yet\n *\n * @param {Uint8Array} [data]\n * @param {(DAGLink | string | DAGLinkLike)[]} [links]\n */\nconst serializeDAGNodeLike = (data, links = []) => {\n  const node = {\n    Data: data,\n    Links: links.map((link) => {\n      return createDagLinkFromB58EncodedHash(link)\n    })\n  }\n\n  return encode(toProtoBuf(node))\n}\n\nmodule.exports = {\n  serializeDAGNode,\n  serializeDAGNodeLike\n}\n\n/**\n * The fields in PBNode are the wrong way round - `id: 2` comes before\n * `id: 1`. protobufjs writes them out in id order but go-IPFS does not so\n * we have to use the protobuf.Writer interface directly to get the same\n * serialized form as go-IPFS\n *\n * @param {SerializableDAGNode} pbf\n */\nfunction encode (pbf) {\n  const writer = protobuf.Writer.create()\n\n  if (pbf.Links != null) {\n    for (let i = 0; i < pbf.Links.length; i++) {\n      PBLink.encode(pbf.Links[i], writer.uint32(18).fork()).ldelim()\n    }\n  }\n\n  if (pbf.Data != null) {\n    writer.uint32(10).bytes(pbf.Data)\n  }\n\n  return writer.finish()\n}\n","'use strict'\n\nconst DAGLink = require('../dag-link/dagLink')\nconst genCid = require('../genCid')\n\n/**\n * toDAGLink converts a DAGNode to a DAGLink\n *\n * @typedef {import('../genCid').GenCIDOptions} GenCIDOptions\n *\n * @typedef {object} ToDagLinkExtraOptions\n * @property {string} [name]\n *\n * @typedef {GenCIDOptions & ToDagLinkExtraOptions} ToDagLinkOptions\n *\n * @param {import('./dagNode')} node\n * @param {ToDagLinkOptions} options\n */\nconst toDAGLink = async (node, options = {}) => {\n  const buf = node.serialize()\n  const nodeCid = await genCid.cid(buf, options)\n  return new DAGLink(options.name || '', node.size, nodeCid)\n}\n\nmodule.exports = toDAGLink\n","'use strict'\n\nconst CID = require('cids')\nconst multicodec = require('multicodec')\nconst multihashing = require('multihashing-async')\nconst { multihash } = multihashing\n\nconst codec = multicodec.DAG_PB\nconst defaultHashAlg = multihash.names['sha2-256']\n\n/**\n * @typedef {object} GenCIDOptions - Options to create the CID\n * @property {CID.CIDVersion} [cidVersion=1] - CID version number\n * @property {multihashing.multihash.HashCode} [hashAlg=multihash.names['sha2-256']] - Defaults to the defaultHashAlg of the format\n */\n\n/**\n * Calculate the CID of the binary blob.\n *\n * @param {Uint8Array} binaryBlob - Encoded IPLD Node\n * @param {GenCIDOptions} [userOptions] - Options to create the CID\n */\nconst cid = async (binaryBlob, userOptions = {}) => {\n  const options = {\n    cidVersion: userOptions.cidVersion == null ? 1 : userOptions.cidVersion,\n    hashAlg: userOptions.hashAlg == null ? defaultHashAlg : userOptions.hashAlg\n  }\n\n  const hashName = multihash.codes[options.hashAlg]\n  const hash = await multihashing(binaryBlob, hashName)\n  const codecName = multicodec.getNameFromCode(codec)\n  const cid = new CID(options.cidVersion, codecName, hash)\n\n  return cid\n}\n\nmodule.exports = {\n  codec,\n  defaultHashAlg,\n  cid\n}\n","'use strict'\n\nconst sortLinks = require('./sortLinks')\nconst DAGLink = require('../dag-link/dagLink')\n\n/**\n * @typedef {import('./dagNode')} DAGNode\n * @typedef {import('../types')} DAGLinkLike\n */\n\n/**\n * @param {*} link\n * @returns {DAGLink}\n */\nconst asDAGLink = (link) => {\n  if (link instanceof DAGLink) {\n    // It's a DAGLink instance\n    // no need to do anything\n    return link\n  }\n\n  // DAGNode.isDagNode() would be more appropriate here, but it can't be used\n  // as it would lead to circular dependencies as `addLink` is called from\n  // within the DAGNode object.\n  if (!('cid' in link ||\n        'hash' in link ||\n        'Hash' in link ||\n        'multihash' in link)) {\n    throw new Error('Link must be a DAGLink or DAGLink-like. Convert the DAGNode into a DAGLink via `node.toDAGLink()`.')\n  }\n\n  // It's a Object with name, multihash/hash/cid and size\n  // @ts-ignore\n  return new DAGLink(link.Name || link.name, link.Tsize || link.size, link.Hash || link.multihash || link.hash || link.cid)\n}\n\n/**\n * @param {DAGNode} node\n * @param {DAGLink | DAGLinkLike} link\n */\nconst addLink = (node, link) => {\n  const dagLink = asDAGLink(link)\n  node.Links.push(dagLink)\n  sortLinks(node.Links)\n}\n\nmodule.exports = addLink\n","'use strict'\n\nconst CID = require('cids')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\n/**\n * @typedef {import('../dag-link/dagLink')} DAGLink\n */\n\n/**\n *\n * @param {import('./dagNode')} dagNode\n * @param {string | CID | Uint8Array | DAGLink} nameOrCid\n */\nconst rmLink = (dagNode, nameOrCid) => {\n  let predicate = null\n\n  // It's a name\n  if (typeof nameOrCid === 'string') {\n    predicate = (/** @type {DAGLink} */ link) => link.Name === nameOrCid\n  } else if (nameOrCid instanceof Uint8Array) {\n    predicate = (/** @type {DAGLink} */ link) => uint8ArrayEquals(link.Hash.bytes, nameOrCid)\n  } else if (CID.isCID(nameOrCid)) {\n    predicate = (/** @type {DAGLink} */ link) => uint8ArrayEquals(link.Hash.bytes, nameOrCid.bytes)\n  }\n\n  if (predicate) {\n    const links = dagNode.Links\n    let index = 0\n    while (index < links.length) {\n      const link = links[index]\n      if (predicate(link)) {\n        links.splice(index, 1)\n      } else {\n        index++\n      }\n    }\n  } else {\n    throw new Error('second arg needs to be a name or CID')\n  }\n}\n\nmodule.exports = rmLink\n","'use strict'\n\nconst {\n  Data: PBData\n} = require('./unixfs')\nconst errcode = require('err-code')\n\n/**\n * @typedef {import('./types').Mtime} Mtime\n * @typedef {import('./types').MtimeLike} MtimeLike\n */\n\nconst types = [\n  'raw',\n  'directory',\n  'file',\n  'metadata',\n  'symlink',\n  'hamt-sharded-directory'\n]\n\nconst dirTypes = [\n  'directory',\n  'hamt-sharded-directory'\n]\n\nconst DEFAULT_FILE_MODE = parseInt('0644', 8)\nconst DEFAULT_DIRECTORY_MODE = parseInt('0755', 8)\n\n/**\n * @param {string | number | undefined} [mode]\n */\nfunction parseMode (mode) {\n  if (mode == null) {\n    return undefined\n  }\n\n  if (typeof mode === 'number') {\n    return mode & 0xFFF\n  }\n\n  mode = mode.toString()\n\n  if (mode.substring(0, 1) === '0') {\n    // octal string\n    return parseInt(mode, 8) & 0xFFF\n  }\n\n  // decimal string\n  return parseInt(mode, 10) & 0xFFF\n}\n\n/**\n * @param {any} input\n */\nfunction parseMtime (input) {\n  if (input == null) {\n    return undefined\n  }\n\n  /** @type {Mtime | undefined} */\n  let mtime\n\n  // { secs, nsecs }\n  if (input.secs != null) {\n    mtime = {\n      secs: input.secs,\n      nsecs: input.nsecs\n    }\n  }\n\n  // UnixFS TimeSpec\n  if (input.Seconds != null) {\n    mtime = {\n      secs: input.Seconds,\n      nsecs: input.FractionalNanoseconds\n    }\n  }\n\n  // process.hrtime()\n  if (Array.isArray(input)) {\n    mtime = {\n      secs: input[0],\n      nsecs: input[1]\n    }\n  }\n\n  // Javascript Date\n  if (input instanceof Date) {\n    const ms = input.getTime()\n    const secs = Math.floor(ms / 1000)\n\n    mtime = {\n      secs: secs,\n      nsecs: (ms - (secs * 1000)) * 1000\n    }\n  }\n\n  /*\n  TODO: https://github.com/ipfs/aegir/issues/487\n\n  // process.hrtime.bigint()\n  if (input instanceof BigInt) {\n    const secs = input / BigInt(1e9)\n    const nsecs = input - (secs * BigInt(1e9))\n\n    mtime = {\n      secs: parseInt(secs.toString()),\n      nsecs: parseInt(nsecs.toString())\n    }\n  }\n  */\n\n  if (!Object.prototype.hasOwnProperty.call(mtime, 'secs')) {\n    return undefined\n  }\n\n  if (mtime != null && mtime.nsecs != null && (mtime.nsecs < 0 || mtime.nsecs > 999999999)) {\n    throw errcode(new Error('mtime-nsecs must be within the range [0,999999999]'), 'ERR_INVALID_MTIME_NSECS')\n  }\n\n  return mtime\n}\n\nclass Data {\n  /**\n   * Decode from protobuf https://github.com/ipfs/specs/blob/master/UNIXFS.md\n   *\n   * @param {Uint8Array} marshaled\n   */\n  static unmarshal (marshaled) {\n    const message = PBData.decode(marshaled)\n    const decoded = PBData.toObject(message, {\n      defaults: false,\n      arrays: true,\n      longs: Number,\n      objects: false\n    })\n\n    const data = new Data({\n      type: types[decoded.Type],\n      data: decoded.Data,\n      blockSizes: decoded.blocksizes,\n      mode: decoded.mode,\n      mtime: decoded.mtime\n        ? {\n            secs: decoded.mtime.Seconds,\n            nsecs: decoded.mtime.FractionalNanoseconds\n          }\n        : undefined\n    })\n\n    // make sure we honour the original mode\n    data._originalMode = decoded.mode || 0\n\n    return data\n  }\n\n  /**\n   * @param {object} [options]\n   * @param {string} [options.type='file']\n   * @param {Uint8Array} [options.data]\n   * @param {number[]} [options.blockSizes]\n   * @param {number} [options.hashType]\n   * @param {number} [options.fanout]\n   * @param {MtimeLike | null} [options.mtime]\n   * @param {number | string} [options.mode]\n   */\n  constructor (options = {\n    type: 'file'\n  }) {\n    const {\n      type,\n      data,\n      blockSizes,\n      hashType,\n      fanout,\n      mtime,\n      mode\n    } = options\n\n    if (type && !types.includes(type)) {\n      throw errcode(new Error('Type: ' + type + ' is not valid'), 'ERR_INVALID_TYPE')\n    }\n\n    this.type = type || 'file'\n    this.data = data\n    this.hashType = hashType\n    this.fanout = fanout\n\n    /** @type {number[]} */\n    this.blockSizes = blockSizes || []\n    this._originalMode = 0\n    this.mode = parseMode(mode)\n\n    if (mtime) {\n      this.mtime = parseMtime(mtime)\n\n      if (this.mtime && !this.mtime.nsecs) {\n        this.mtime.nsecs = 0\n      }\n    }\n  }\n\n  /**\n   * @param {number | undefined} mode\n   */\n  set mode (mode) {\n    this._mode = this.isDirectory() ? DEFAULT_DIRECTORY_MODE : DEFAULT_FILE_MODE\n\n    const parsedMode = parseMode(mode)\n\n    if (parsedMode !== undefined) {\n      this._mode = parsedMode\n    }\n  }\n\n  /**\n   * @returns {number | undefined}\n   */\n  get mode () {\n    return this._mode\n  }\n\n  isDirectory () {\n    return Boolean(this.type && dirTypes.includes(this.type))\n  }\n\n  /**\n   * @param {number} size\n   */\n  addBlockSize (size) {\n    this.blockSizes.push(size)\n  }\n\n  /**\n   * @param {number} index\n   */\n  removeBlockSize (index) {\n    this.blockSizes.splice(index, 1)\n  }\n\n  /**\n   * Returns `0` for directories or `data.length + sum(blockSizes)` for everything else\n   */\n  fileSize () {\n    if (this.isDirectory()) {\n      // dirs don't have file size\n      return 0\n    }\n\n    let sum = 0\n    this.blockSizes.forEach((size) => {\n      sum += size\n    })\n\n    if (this.data) {\n      sum += this.data.length\n    }\n\n    return sum\n  }\n\n  /**\n   * encode to protobuf Uint8Array\n   */\n  marshal () {\n    let type\n\n    switch (this.type) {\n      case 'raw': type = PBData.DataType.Raw; break\n      case 'directory': type = PBData.DataType.Directory; break\n      case 'file': type = PBData.DataType.File; break\n      case 'metadata': type = PBData.DataType.Metadata; break\n      case 'symlink': type = PBData.DataType.Symlink; break\n      case 'hamt-sharded-directory': type = PBData.DataType.HAMTShard; break\n      default:\n        throw errcode(new Error('Type: ' + type + ' is not valid'), 'ERR_INVALID_TYPE')\n    }\n\n    let data = this.data\n\n    if (!this.data || !this.data.length) {\n      data = undefined\n    }\n\n    let mode\n\n    if (this.mode != null) {\n      mode = (this._originalMode & 0xFFFFF000) | (parseMode(this.mode) || 0)\n\n      if (mode === DEFAULT_FILE_MODE && !this.isDirectory()) {\n        mode = undefined\n      }\n\n      if (mode === DEFAULT_DIRECTORY_MODE && this.isDirectory()) {\n        mode = undefined\n      }\n    }\n\n    let mtime\n\n    if (this.mtime != null) {\n      const parsed = parseMtime(this.mtime)\n\n      if (parsed) {\n        mtime = {\n          Seconds: parsed.secs,\n          FractionalNanoseconds: parsed.nsecs\n        }\n\n        if (mtime.FractionalNanoseconds === 0) {\n          delete mtime.FractionalNanoseconds\n        }\n      }\n    }\n\n    const pbData = {\n      Type: type,\n      Data: data,\n      filesize: this.isDirectory() ? undefined : this.fileSize(),\n      blocksizes: this.blockSizes,\n      hashType: this.hashType,\n      fanout: this.fanout,\n      mode,\n      mtime\n    }\n\n    return PBData.encode(pbData).finish()\n  }\n}\n\nmodule.exports = {\n  UnixFS: Data,\n  parseMode,\n  parseMtime\n}\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"ipfs-unixfs\"] || ($protobuf.roots[\"ipfs-unixfs\"] = {});\n\n$root.Data = (function() {\n\n    /**\n     * Properties of a Data.\n     * @exports IData\n     * @interface IData\n     * @property {Data.DataType} Type Data Type\n     * @property {Uint8Array|null} [Data] Data Data\n     * @property {number|null} [filesize] Data filesize\n     * @property {Array.<number>|null} [blocksizes] Data blocksizes\n     * @property {number|null} [hashType] Data hashType\n     * @property {number|null} [fanout] Data fanout\n     * @property {number|null} [mode] Data mode\n     * @property {IUnixTime|null} [mtime] Data mtime\n     */\n\n    /**\n     * Constructs a new Data.\n     * @exports Data\n     * @classdesc Represents a Data.\n     * @implements IData\n     * @constructor\n     * @param {IData=} [p] Properties to set\n     */\n    function Data(p) {\n        this.blocksizes = [];\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * Data Type.\n     * @member {Data.DataType} Type\n     * @memberof Data\n     * @instance\n     */\n    Data.prototype.Type = 0;\n\n    /**\n     * Data Data.\n     * @member {Uint8Array} Data\n     * @memberof Data\n     * @instance\n     */\n    Data.prototype.Data = $util.newBuffer([]);\n\n    /**\n     * Data filesize.\n     * @member {number} filesize\n     * @memberof Data\n     * @instance\n     */\n    Data.prototype.filesize = $util.Long ? $util.Long.fromBits(0,0,true) : 0;\n\n    /**\n     * Data blocksizes.\n     * @member {Array.<number>} blocksizes\n     * @memberof Data\n     * @instance\n     */\n    Data.prototype.blocksizes = $util.emptyArray;\n\n    /**\n     * Data hashType.\n     * @member {number} hashType\n     * @memberof Data\n     * @instance\n     */\n    Data.prototype.hashType = $util.Long ? $util.Long.fromBits(0,0,true) : 0;\n\n    /**\n     * Data fanout.\n     * @member {number} fanout\n     * @memberof Data\n     * @instance\n     */\n    Data.prototype.fanout = $util.Long ? $util.Long.fromBits(0,0,true) : 0;\n\n    /**\n     * Data mode.\n     * @member {number} mode\n     * @memberof Data\n     * @instance\n     */\n    Data.prototype.mode = 0;\n\n    /**\n     * Data mtime.\n     * @member {IUnixTime|null|undefined} mtime\n     * @memberof Data\n     * @instance\n     */\n    Data.prototype.mtime = null;\n\n    /**\n     * Encodes the specified Data message. Does not implicitly {@link Data.verify|verify} messages.\n     * @function encode\n     * @memberof Data\n     * @static\n     * @param {IData} m Data message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    Data.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        w.uint32(8).int32(m.Type);\n        if (m.Data != null && Object.hasOwnProperty.call(m, \"Data\"))\n            w.uint32(18).bytes(m.Data);\n        if (m.filesize != null && Object.hasOwnProperty.call(m, \"filesize\"))\n            w.uint32(24).uint64(m.filesize);\n        if (m.blocksizes != null && m.blocksizes.length) {\n            for (var i = 0; i < m.blocksizes.length; ++i)\n                w.uint32(32).uint64(m.blocksizes[i]);\n        }\n        if (m.hashType != null && Object.hasOwnProperty.call(m, \"hashType\"))\n            w.uint32(40).uint64(m.hashType);\n        if (m.fanout != null && Object.hasOwnProperty.call(m, \"fanout\"))\n            w.uint32(48).uint64(m.fanout);\n        if (m.mode != null && Object.hasOwnProperty.call(m, \"mode\"))\n            w.uint32(56).uint32(m.mode);\n        if (m.mtime != null && Object.hasOwnProperty.call(m, \"mtime\"))\n            $root.UnixTime.encode(m.mtime, w.uint32(66).fork()).ldelim();\n        return w;\n    };\n\n    /**\n     * Decodes a Data message from the specified reader or buffer.\n     * @function decode\n     * @memberof Data\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {Data} Data\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    Data.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.Data();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.Type = r.int32();\n                break;\n            case 2:\n                m.Data = r.bytes();\n                break;\n            case 3:\n                m.filesize = r.uint64();\n                break;\n            case 4:\n                if (!(m.blocksizes && m.blocksizes.length))\n                    m.blocksizes = [];\n                if ((t & 7) === 2) {\n                    var c2 = r.uint32() + r.pos;\n                    while (r.pos < c2)\n                        m.blocksizes.push(r.uint64());\n                } else\n                    m.blocksizes.push(r.uint64());\n                break;\n            case 5:\n                m.hashType = r.uint64();\n                break;\n            case 6:\n                m.fanout = r.uint64();\n                break;\n            case 7:\n                m.mode = r.uint32();\n                break;\n            case 8:\n                m.mtime = $root.UnixTime.decode(r, r.uint32());\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        if (!m.hasOwnProperty(\"Type\"))\n            throw $util.ProtocolError(\"missing required 'Type'\", { instance: m });\n        return m;\n    };\n\n    /**\n     * Creates a Data message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof Data\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {Data} Data\n     */\n    Data.fromObject = function fromObject(d) {\n        if (d instanceof $root.Data)\n            return d;\n        var m = new $root.Data();\n        switch (d.Type) {\n        case \"Raw\":\n        case 0:\n            m.Type = 0;\n            break;\n        case \"Directory\":\n        case 1:\n            m.Type = 1;\n            break;\n        case \"File\":\n        case 2:\n            m.Type = 2;\n            break;\n        case \"Metadata\":\n        case 3:\n            m.Type = 3;\n            break;\n        case \"Symlink\":\n        case 4:\n            m.Type = 4;\n            break;\n        case \"HAMTShard\":\n        case 5:\n            m.Type = 5;\n            break;\n        }\n        if (d.Data != null) {\n            if (typeof d.Data === \"string\")\n                $util.base64.decode(d.Data, m.Data = $util.newBuffer($util.base64.length(d.Data)), 0);\n            else if (d.Data.length)\n                m.Data = d.Data;\n        }\n        if (d.filesize != null) {\n            if ($util.Long)\n                (m.filesize = $util.Long.fromValue(d.filesize)).unsigned = true;\n            else if (typeof d.filesize === \"string\")\n                m.filesize = parseInt(d.filesize, 10);\n            else if (typeof d.filesize === \"number\")\n                m.filesize = d.filesize;\n            else if (typeof d.filesize === \"object\")\n                m.filesize = new $util.LongBits(d.filesize.low >>> 0, d.filesize.high >>> 0).toNumber(true);\n        }\n        if (d.blocksizes) {\n            if (!Array.isArray(d.blocksizes))\n                throw TypeError(\".Data.blocksizes: array expected\");\n            m.blocksizes = [];\n            for (var i = 0; i < d.blocksizes.length; ++i) {\n                if ($util.Long)\n                    (m.blocksizes[i] = $util.Long.fromValue(d.blocksizes[i])).unsigned = true;\n                else if (typeof d.blocksizes[i] === \"string\")\n                    m.blocksizes[i] = parseInt(d.blocksizes[i], 10);\n                else if (typeof d.blocksizes[i] === \"number\")\n                    m.blocksizes[i] = d.blocksizes[i];\n                else if (typeof d.blocksizes[i] === \"object\")\n                    m.blocksizes[i] = new $util.LongBits(d.blocksizes[i].low >>> 0, d.blocksizes[i].high >>> 0).toNumber(true);\n            }\n        }\n        if (d.hashType != null) {\n            if ($util.Long)\n                (m.hashType = $util.Long.fromValue(d.hashType)).unsigned = true;\n            else if (typeof d.hashType === \"string\")\n                m.hashType = parseInt(d.hashType, 10);\n            else if (typeof d.hashType === \"number\")\n                m.hashType = d.hashType;\n            else if (typeof d.hashType === \"object\")\n                m.hashType = new $util.LongBits(d.hashType.low >>> 0, d.hashType.high >>> 0).toNumber(true);\n        }\n        if (d.fanout != null) {\n            if ($util.Long)\n                (m.fanout = $util.Long.fromValue(d.fanout)).unsigned = true;\n            else if (typeof d.fanout === \"string\")\n                m.fanout = parseInt(d.fanout, 10);\n            else if (typeof d.fanout === \"number\")\n                m.fanout = d.fanout;\n            else if (typeof d.fanout === \"object\")\n                m.fanout = new $util.LongBits(d.fanout.low >>> 0, d.fanout.high >>> 0).toNumber(true);\n        }\n        if (d.mode != null) {\n            m.mode = d.mode >>> 0;\n        }\n        if (d.mtime != null) {\n            if (typeof d.mtime !== \"object\")\n                throw TypeError(\".Data.mtime: object expected\");\n            m.mtime = $root.UnixTime.fromObject(d.mtime);\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a Data message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof Data\n     * @static\n     * @param {Data} m Data\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    Data.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.arrays || o.defaults) {\n            d.blocksizes = [];\n        }\n        if (o.defaults) {\n            d.Type = o.enums === String ? \"Raw\" : 0;\n            if (o.bytes === String)\n                d.Data = \"\";\n            else {\n                d.Data = [];\n                if (o.bytes !== Array)\n                    d.Data = $util.newBuffer(d.Data);\n            }\n            if ($util.Long) {\n                var n = new $util.Long(0, 0, true);\n                d.filesize = o.longs === String ? n.toString() : o.longs === Number ? n.toNumber() : n;\n            } else\n                d.filesize = o.longs === String ? \"0\" : 0;\n            if ($util.Long) {\n                var n = new $util.Long(0, 0, true);\n                d.hashType = o.longs === String ? n.toString() : o.longs === Number ? n.toNumber() : n;\n            } else\n                d.hashType = o.longs === String ? \"0\" : 0;\n            if ($util.Long) {\n                var n = new $util.Long(0, 0, true);\n                d.fanout = o.longs === String ? n.toString() : o.longs === Number ? n.toNumber() : n;\n            } else\n                d.fanout = o.longs === String ? \"0\" : 0;\n            d.mode = 0;\n            d.mtime = null;\n        }\n        if (m.Type != null && m.hasOwnProperty(\"Type\")) {\n            d.Type = o.enums === String ? $root.Data.DataType[m.Type] : m.Type;\n        }\n        if (m.Data != null && m.hasOwnProperty(\"Data\")) {\n            d.Data = o.bytes === String ? $util.base64.encode(m.Data, 0, m.Data.length) : o.bytes === Array ? Array.prototype.slice.call(m.Data) : m.Data;\n        }\n        if (m.filesize != null && m.hasOwnProperty(\"filesize\")) {\n            if (typeof m.filesize === \"number\")\n                d.filesize = o.longs === String ? String(m.filesize) : m.filesize;\n            else\n                d.filesize = o.longs === String ? $util.Long.prototype.toString.call(m.filesize) : o.longs === Number ? new $util.LongBits(m.filesize.low >>> 0, m.filesize.high >>> 0).toNumber(true) : m.filesize;\n        }\n        if (m.blocksizes && m.blocksizes.length) {\n            d.blocksizes = [];\n            for (var j = 0; j < m.blocksizes.length; ++j) {\n                if (typeof m.blocksizes[j] === \"number\")\n                    d.blocksizes[j] = o.longs === String ? String(m.blocksizes[j]) : m.blocksizes[j];\n                else\n                    d.blocksizes[j] = o.longs === String ? $util.Long.prototype.toString.call(m.blocksizes[j]) : o.longs === Number ? new $util.LongBits(m.blocksizes[j].low >>> 0, m.blocksizes[j].high >>> 0).toNumber(true) : m.blocksizes[j];\n            }\n        }\n        if (m.hashType != null && m.hasOwnProperty(\"hashType\")) {\n            if (typeof m.hashType === \"number\")\n                d.hashType = o.longs === String ? String(m.hashType) : m.hashType;\n            else\n                d.hashType = o.longs === String ? $util.Long.prototype.toString.call(m.hashType) : o.longs === Number ? new $util.LongBits(m.hashType.low >>> 0, m.hashType.high >>> 0).toNumber(true) : m.hashType;\n        }\n        if (m.fanout != null && m.hasOwnProperty(\"fanout\")) {\n            if (typeof m.fanout === \"number\")\n                d.fanout = o.longs === String ? String(m.fanout) : m.fanout;\n            else\n                d.fanout = o.longs === String ? $util.Long.prototype.toString.call(m.fanout) : o.longs === Number ? new $util.LongBits(m.fanout.low >>> 0, m.fanout.high >>> 0).toNumber(true) : m.fanout;\n        }\n        if (m.mode != null && m.hasOwnProperty(\"mode\")) {\n            d.mode = m.mode;\n        }\n        if (m.mtime != null && m.hasOwnProperty(\"mtime\")) {\n            d.mtime = $root.UnixTime.toObject(m.mtime, o);\n        }\n        return d;\n    };\n\n    /**\n     * Converts this Data to JSON.\n     * @function toJSON\n     * @memberof Data\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    Data.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    /**\n     * DataType enum.\n     * @name Data.DataType\n     * @enum {number}\n     * @property {number} Raw=0 Raw value\n     * @property {number} Directory=1 Directory value\n     * @property {number} File=2 File value\n     * @property {number} Metadata=3 Metadata value\n     * @property {number} Symlink=4 Symlink value\n     * @property {number} HAMTShard=5 HAMTShard value\n     */\n    Data.DataType = (function() {\n        var valuesById = {}, values = Object.create(valuesById);\n        values[valuesById[0] = \"Raw\"] = 0;\n        values[valuesById[1] = \"Directory\"] = 1;\n        values[valuesById[2] = \"File\"] = 2;\n        values[valuesById[3] = \"Metadata\"] = 3;\n        values[valuesById[4] = \"Symlink\"] = 4;\n        values[valuesById[5] = \"HAMTShard\"] = 5;\n        return values;\n    })();\n\n    return Data;\n})();\n\n$root.UnixTime = (function() {\n\n    /**\n     * Properties of an UnixTime.\n     * @exports IUnixTime\n     * @interface IUnixTime\n     * @property {number} Seconds UnixTime Seconds\n     * @property {number|null} [FractionalNanoseconds] UnixTime FractionalNanoseconds\n     */\n\n    /**\n     * Constructs a new UnixTime.\n     * @exports UnixTime\n     * @classdesc Represents an UnixTime.\n     * @implements IUnixTime\n     * @constructor\n     * @param {IUnixTime=} [p] Properties to set\n     */\n    function UnixTime(p) {\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * UnixTime Seconds.\n     * @member {number} Seconds\n     * @memberof UnixTime\n     * @instance\n     */\n    UnixTime.prototype.Seconds = $util.Long ? $util.Long.fromBits(0,0,false) : 0;\n\n    /**\n     * UnixTime FractionalNanoseconds.\n     * @member {number} FractionalNanoseconds\n     * @memberof UnixTime\n     * @instance\n     */\n    UnixTime.prototype.FractionalNanoseconds = 0;\n\n    /**\n     * Encodes the specified UnixTime message. Does not implicitly {@link UnixTime.verify|verify} messages.\n     * @function encode\n     * @memberof UnixTime\n     * @static\n     * @param {IUnixTime} m UnixTime message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    UnixTime.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        w.uint32(8).int64(m.Seconds);\n        if (m.FractionalNanoseconds != null && Object.hasOwnProperty.call(m, \"FractionalNanoseconds\"))\n            w.uint32(21).fixed32(m.FractionalNanoseconds);\n        return w;\n    };\n\n    /**\n     * Decodes an UnixTime message from the specified reader or buffer.\n     * @function decode\n     * @memberof UnixTime\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {UnixTime} UnixTime\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    UnixTime.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.UnixTime();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.Seconds = r.int64();\n                break;\n            case 2:\n                m.FractionalNanoseconds = r.fixed32();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        if (!m.hasOwnProperty(\"Seconds\"))\n            throw $util.ProtocolError(\"missing required 'Seconds'\", { instance: m });\n        return m;\n    };\n\n    /**\n     * Creates an UnixTime message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof UnixTime\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {UnixTime} UnixTime\n     */\n    UnixTime.fromObject = function fromObject(d) {\n        if (d instanceof $root.UnixTime)\n            return d;\n        var m = new $root.UnixTime();\n        if (d.Seconds != null) {\n            if ($util.Long)\n                (m.Seconds = $util.Long.fromValue(d.Seconds)).unsigned = false;\n            else if (typeof d.Seconds === \"string\")\n                m.Seconds = parseInt(d.Seconds, 10);\n            else if (typeof d.Seconds === \"number\")\n                m.Seconds = d.Seconds;\n            else if (typeof d.Seconds === \"object\")\n                m.Seconds = new $util.LongBits(d.Seconds.low >>> 0, d.Seconds.high >>> 0).toNumber();\n        }\n        if (d.FractionalNanoseconds != null) {\n            m.FractionalNanoseconds = d.FractionalNanoseconds >>> 0;\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from an UnixTime message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof UnixTime\n     * @static\n     * @param {UnixTime} m UnixTime\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    UnixTime.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.defaults) {\n            if ($util.Long) {\n                var n = new $util.Long(0, 0, false);\n                d.Seconds = o.longs === String ? n.toString() : o.longs === Number ? n.toNumber() : n;\n            } else\n                d.Seconds = o.longs === String ? \"0\" : 0;\n            d.FractionalNanoseconds = 0;\n        }\n        if (m.Seconds != null && m.hasOwnProperty(\"Seconds\")) {\n            if (typeof m.Seconds === \"number\")\n                d.Seconds = o.longs === String ? String(m.Seconds) : m.Seconds;\n            else\n                d.Seconds = o.longs === String ? $util.Long.prototype.toString.call(m.Seconds) : o.longs === Number ? new $util.LongBits(m.Seconds.low >>> 0, m.Seconds.high >>> 0).toNumber() : m.Seconds;\n        }\n        if (m.FractionalNanoseconds != null && m.hasOwnProperty(\"FractionalNanoseconds\")) {\n            d.FractionalNanoseconds = m.FractionalNanoseconds;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this UnixTime to JSON.\n     * @function toJSON\n     * @memberof UnixTime\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    UnixTime.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return UnixTime;\n})();\n\n$root.Metadata = (function() {\n\n    /**\n     * Properties of a Metadata.\n     * @exports IMetadata\n     * @interface IMetadata\n     * @property {string|null} [MimeType] Metadata MimeType\n     */\n\n    /**\n     * Constructs a new Metadata.\n     * @exports Metadata\n     * @classdesc Represents a Metadata.\n     * @implements IMetadata\n     * @constructor\n     * @param {IMetadata=} [p] Properties to set\n     */\n    function Metadata(p) {\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * Metadata MimeType.\n     * @member {string} MimeType\n     * @memberof Metadata\n     * @instance\n     */\n    Metadata.prototype.MimeType = \"\";\n\n    /**\n     * Encodes the specified Metadata message. Does not implicitly {@link Metadata.verify|verify} messages.\n     * @function encode\n     * @memberof Metadata\n     * @static\n     * @param {IMetadata} m Metadata message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    Metadata.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.MimeType != null && Object.hasOwnProperty.call(m, \"MimeType\"))\n            w.uint32(10).string(m.MimeType);\n        return w;\n    };\n\n    /**\n     * Decodes a Metadata message from the specified reader or buffer.\n     * @function decode\n     * @memberof Metadata\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {Metadata} Metadata\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    Metadata.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.Metadata();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.MimeType = r.string();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a Metadata message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof Metadata\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {Metadata} Metadata\n     */\n    Metadata.fromObject = function fromObject(d) {\n        if (d instanceof $root.Metadata)\n            return d;\n        var m = new $root.Metadata();\n        if (d.MimeType != null) {\n            m.MimeType = String(d.MimeType);\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a Metadata message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof Metadata\n     * @static\n     * @param {Metadata} m Metadata\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    Metadata.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.defaults) {\n            d.MimeType = \"\";\n        }\n        if (m.MimeType != null && m.hasOwnProperty(\"MimeType\")) {\n            d.MimeType = m.MimeType;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this Metadata to JSON.\n     * @function toJSON\n     * @memberof Metadata\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    Metadata.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return Metadata;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\nmodule.exports = () => {}\n","'use strict'\n\nclass NotInitializedError extends Error {\n  constructor (message = 'not initialized') {\n    super(message)\n    this.name = 'NotInitializedError'\n    this.code = NotInitializedError.code\n  }\n}\n\nNotInitializedError.code = 'ERR_NOT_INITIALIZED'\nexports.NotInitializedError = NotInitializedError\n\nclass AlreadyInitializingError extends Error {\n  constructor (message = 'cannot initialize an initializing node') {\n    super(message)\n    this.name = 'AlreadyInitializingError'\n    this.code = AlreadyInitializedError.code\n  }\n}\n\nAlreadyInitializingError.code = 'ERR_ALREADY_INITIALIZING'\nexports.AlreadyInitializingError = AlreadyInitializingError\n\nclass AlreadyInitializedError extends Error {\n  constructor (message = 'cannot re-initialize an initialized node') {\n    super(message)\n    this.name = 'AlreadyInitializedError'\n    this.code = AlreadyInitializedError.code\n  }\n}\n\nAlreadyInitializedError.code = 'ERR_ALREADY_INITIALIZED'\nexports.AlreadyInitializedError = AlreadyInitializedError\n\nclass NotStartedError extends Error {\n  constructor (message = 'not started') {\n    super(message)\n    this.name = 'NotStartedError'\n    this.code = NotStartedError.code\n  }\n}\n\nNotStartedError.code = 'ERR_NOT_STARTED'\nexports.NotStartedError = NotStartedError\n\nclass AlreadyStartingError extends Error {\n  constructor (message = 'cannot start, already startin') {\n    super(message)\n    this.name = 'AlreadyStartingError'\n    this.code = AlreadyStartingError.code\n  }\n}\n\nAlreadyStartingError.code = 'ERR_ALREADY_STARTING'\nexports.AlreadyStartingError = AlreadyStartingError\n\nclass AlreadyStartedError extends Error {\n  constructor (message = 'cannot start, already started') {\n    super(message)\n    this.name = 'AlreadyStartedError'\n    this.code = AlreadyStartedError.code\n  }\n}\n\nAlreadyStartedError.code = 'ERR_ALREADY_STARTED'\nexports.AlreadyStartedError = AlreadyStartedError\n\nclass NotEnabledError extends Error {\n  constructor (message = 'not enabled') {\n    super(message)\n    this.name = 'NotEnabledError'\n    this.code = NotEnabledError.code\n  }\n}\n\nNotEnabledError.code = 'ERR_NOT_ENABLED'\nexports.NotEnabledError = NotEnabledError\n","'use strict'\n\nconst Service = require('../utils/service')\n\n/**\n * @param {Object} config\n * @param {import('../types').NetworkService} config.network\n * @param {import('peer-id')} config.peerId\n * @param {import('ipfs-repo')} config.repo\n * @param {import('ipfs-block-service')} config.blockService\n * @param {import('../types').Print} config.print\n * @param {import('../types').Preload} config.preload\n * @param {import('../types').MfsPreload} config.mfsPreload\n * @param {import('./ipns')} config.ipns\n * @param {import('libp2p/src/keychain')} config.keychain\n * @param {import('../types').Options} config.options\n */\nmodule.exports = ({ network, preload, peerId, keychain, repo, ipns, blockService, mfsPreload, print, options }) => {\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"start\"]}\n   */\n  const start = async () => {\n    const { bitswap, libp2p } = await Service.start(network, {\n      peerId,\n      repo,\n      print,\n      options\n    })\n\n    blockService.setExchange(bitswap)\n\n    await Promise.all([\n      ipns.startOnline({ keychain, libp2p, peerId, repo }),\n      preload.start(),\n      mfsPreload.start()\n    ])\n  }\n\n  return start\n}\n","'use strict'\n\nconst { NotStartedError, AlreadyStartingError, AlreadyStartedError } = require('../errors')\nconst { withTimeout } = require('../utils')\n\n/**\n * @template T\n * @typedef {import('ipfs-core-types/src/utils').Await<T>} Await\n */\n/**\n * @template {(options:any) => any} T\n * @typedef {Parameters<T>[0]} Options\n */\n/**\n * @template {(options:any) => any} T\n * @typedef {ReturnType<T> extends ? Promise<infer U> ? U : ReturnType<T>} State\n */\n/**\n * Represents service state which can be not started in which case\n * it is instance of `Error`. Pending in which case it's promise or\n * ready in which case it is the value itself.\n *\n * @template T\n * @typedef {{ status: 'stopped' }\n * | { status: 'starting', ready: Await<T> }\n * | { status: 'started', value: T }\n * | { status: 'stopping', ready: Await<void> }\n * } ServiceState\n */\n\n/**\n * @typedef {import('ipfs-core-types/src/utils').AbortOptions} AbortOptions\n */\n\n/**\n * @template Options, T\n *\n * Allows you to create a handle to service that can be started or\n * stopped. It enables defining components that need to use service\n * functionality before service is started.\n *\n */\nclass Service {\n  /**\n   * Takes `activation` function that takes `options` and (async) returns\n   * an implementation.\n   *\n   * @template {(options:any) => Await<any>} T\n   *\n   * @param {Object} config\n   * @param {T} config.start\n   * @param {(state:State<T>) => Await<void>} [config.stop]\n   * @returns {Service<Parameters<T>[0], State<T>>}\n   */\n  static create ({ start, stop }) {\n    return new Service(start, stop)\n  }\n\n  /**\n   * Starts the service (by running actiavtion function). Will (async) throw\n   * unless service is stopped.\n   *\n   * @template Options, T\n   * @param {Service<Options, T>} service\n   * @param {Options} options\n   * @returns {Promise<T>}\n   */\n  static async start (service, options) {\n    const { state, activate } = service\n    switch (state.status) {\n      // If service is in 'stopped' state we activate and transition to\n      // to 'pending' state. Once activation is complete transition state to\n      // 'started' state.\n      // Note: This is the only code that does state transitions from\n      // - stopped\n      // - started\n      // Which ensures no race conditions can occur.\n      case 'stopped': {\n        try {\n          const promise = activate(options)\n          service.state = { status: 'starting', ready: promise }\n          // Note: MUST await after state transition above otherwise race\n          // condition may occur.\n          const result = await promise\n          service.state = { status: 'started', value: result }\n          return result\n        // If failed to start, transiton from 'starting' to 'stopped'\n        // state.\n        } catch (error) {\n          service.state = { status: 'stopped' }\n          throw error\n        }\n      }\n      case 'starting': {\n        throw new AlreadyStartingError()\n      }\n      case 'started': {\n        throw new AlreadyStartedError()\n      }\n      // If service is stopping we just wait for that to complete\n      // and try again.\n      case 'stopping': {\n        await state.ready\n        return await Service.start(service, options)\n      }\n      default: {\n        return Service.panic(service)\n      }\n    }\n  }\n\n  /**\n   * Stops the service by executing deactivation. If service is stopped\n   * or is stopping this is noop. If service is starting up when called\n   * it will await for start to complete and then retry stop afterwards.\n   * This may (async) throw if `deactivate` does.\n   *\n   * @template T\n   * @param {Service<any, T>} service\n   * @returns {Promise<void>}\n   */\n  static async stop (service) {\n    const { state, deactivate } = service\n    switch (state.status) {\n      // If stopped there's nothing to do.\n      case 'stopped': {\n        break\n      }\n      // If service is starting we await for it to complete\n      // and try again. That way\n      case 'starting': {\n        // We do not want to error stop if start failed.\n        try { await state.ready } catch (_) {}\n        return await Service.stop(service)\n      }\n      // if service is stopping we just await for it to complete.\n      case 'stopping': {\n        return await state.ready\n      }\n      case 'started': {\n        if (deactivate) {\n          await deactivate(state.value)\n        }\n        service.state = { status: 'stopped' }\n        break\n      }\n      default: {\n        Service.panic(state)\n      }\n    }\n  }\n\n  /**\n   * @template T\n   * @param {Service<any, T>} service\n   * @returns {T|null}\n   */\n  static try ({ state }) {\n    switch (state.status) {\n      case 'started':\n        return state.value\n      default:\n        return null\n    }\n  }\n\n  /**\n   * Unwraps state and returns underlying value. If state is in idle state it\n   * will throw an error. If state is pending it will wait and return the\n   * result or throw on failure. If state is ready returns result.\n   *\n   * @template T\n   * @param {Service<any, T>} service\n   * @param {AbortOptions} [options]\n   * @returns {Promise<T>}\n   */\n  static async use ({ state }, options) {\n    switch (state.status) {\n      case 'started':\n        return state.value\n      case 'starting':\n        return await withTimeout(state.ready, options)\n      default:\n        throw new NotStartedError()\n    }\n  }\n\n  // eslint-disable-next-line jsdoc/require-returns-check\n  /**\n   * @private\n   * @param {Service<any, any>} service\n   * @returns {never}\n   */\n  static panic ({ state }) {\n    const status = JSON.stringify({ status: state.status })\n    throw RangeError(`Service in invalid state ${status}, should never happen if you see this please report a bug`)\n  }\n\n  /**\n   * Takes `activation` function that takes `options` and (async) returns\n   * an implementation.\n   *\n   * @private\n   * @param {(options:Options) => Await<T>} activate\n   * @param {(state:T) => Await<void>} [deactivate]\n   */\n  constructor (activate, deactivate) {\n    this.activate = activate\n    this.deactivate = deactivate\n\n    /**\n     * A state machine for this service.\n     *\n     * @private\n     * @type {ServiceState<T>}\n     */\n    this.state = { status: 'stopped' }\n  }\n\n  /**\n   * Allows you to asynchronously obtain service implementation. If service\n   * is starting it will await for completion. If service is stopped or stopping\n   * this will (async) throw exception. This allows components that need to use\n   * this service convenient API to do it.\n   *\n   * @param {AbortOptions} [options] - Abort options.\n   * @returns {Promise<T>}\n   */\n  async use (options) {\n    return await Service.use(this, options)\n  }\n\n  /**\n   * @returns {T|null}\n   */\n  try () {\n    return Service.try(this)\n  }\n}\nmodule.exports = Service\n","'use strict'\n\nconst Service = require('../utils/service')\n\n/**\n * @param {Object} config\n * @param {import('../types').NetworkService} config.network\n * @param {import('../types').Preload} config.preload\n * @param {import('ipfs-block-service')} config.blockService\n * @param {import('./ipns')} config.ipns\n * @param {import('ipfs-repo')} config.repo\n * @param {import('../types').MfsPreload} config.mfsPreload\n */\nmodule.exports = ({ network, preload, blockService, ipns, repo, mfsPreload }) => {\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"stop\"]}\n   */\n  const stop = async () => {\n    blockService.unsetExchange()\n    await Promise.all([\n      preload.stop(),\n      ipns.stop(),\n      mfsPreload.stop(),\n      Service.stop(network),\n      repo.close()\n    ])\n  }\n\n  return stop\n}\n","'use strict'\n\n// dns-nodejs gets replaced by dns-browser when bundled\nconst dns = require('../runtime/dns-nodejs')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {string} domain\n * @returns {string}\n */\nfunction fqdnFixups (domain) {\n  // Allow resolution of .eth names via .eth.link\n  // More context at the go-ipfs counterpart: https://github.com/ipfs/go-ipfs/pull/6448\n  if (domain.endsWith('.eth')) {\n    domain = domain.replace(/.eth$/, '.eth.link')\n  }\n  return domain\n}\n\nmodule.exports = () => {\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"dns\"]}\n   */\n  const resolveDNS = async (domain, options = { recursive: true }) => { // eslint-disable-line require-await\n    if (typeof domain !== 'string') {\n      throw new Error('Invalid arguments, domain must be a string')\n    }\n\n    domain = fqdnFixups(domain)\n\n    return dns(domain, options)\n  }\n\n  return withTimeoutOption(resolveDNS)\n}\n","/* eslint-env browser */\n'use strict'\n\nconst TLRU = require('../utils/tlru')\nconst { default: PQueue } = require('p-queue')\nconst HTTP = require('ipfs-utils/src/http')\n\n// Avoid sending multiple queries for the same hostname by caching results\nconst cache = new TLRU(1000)\n// TODO: /api/v0/dns does not return TTL yet: https://github.com/ipfs/go-ipfs/issues/5884\n// However we know browsers themselves cache DNS records for at least 1 minute,\n// which acts a provisional default ttl: https://stackoverflow.com/a/36917902/11518426\nconst ttl = 60 * 1000\n\n// browsers limit concurrent connections per host,\n// we don't want preload calls to exhaust the limit (~6)\nconst httpQueue = new PQueue({ concurrency: 4 })\n\n/**\n * @param {{ Path: string, Message: string }} response\n */\nconst ipfsPath = (response) => {\n  if (response.Path) return response.Path\n  throw new Error(response.Message)\n}\n\n/**\n * @param {string} fqdn\n * @param {object} opts\n */\nmodule.exports = async (fqdn, opts) => { // eslint-disable-line require-await\n  /**\n   * @param {string} fqdn\n   * @param {object} opts\n   * @param {boolean} [opts.nocache]\n   */\n  const resolveDnslink = async (fqdn, opts = {}) => {\n    // @ts-ignore - URLSearchParams does not take boolean options, only strings\n    const searchParams = new URLSearchParams(opts)\n    searchParams.set('arg', fqdn)\n\n    // try cache first\n    const query = searchParams.toString()\n    if (!opts.nocache && cache.has(query)) {\n      const response = cache.get(query)\n      return ipfsPath(response)\n    }\n\n    // fallback to delegated DNS resolver\n    const response = await httpQueue.add(async () => {\n      // Delegated HTTP resolver sending DNSLink queries to ipfs.io\n      // TODO: replace hardcoded host with configurable DNS over HTTPS: https://github.com/ipfs/js-ipfs/issues/2212\n      const res = await HTTP.get('https://ipfs.io/api/v0/dns', { searchParams })\n      const query = new URL(res.url).search.slice(1)\n      const json = await res.json()\n      cache.set(query, json, ttl)\n\n      return json\n    })\n    return ipfsPath(response)\n  }\n\n  return resolveDnslink(fqdn, opts)\n}\n","'use strict'\n\n/** @type {typeof import('hashlru').default} */\n// @ts-ignore - hashlru has incorrect typedefs\nconst hashlru = require('hashlru')\n\n/**\n * Time Aware Least Recent Used Cache\n *\n * @see https://arxiv.org/pdf/1801.00390\n * @todo move this to ipfs-utils or it's own package\n *\n * @template T\n * @class TLRU\n */\nclass TLRU {\n  /**\n   * Creates an instance of TLRU.\n   *\n   * @param {number} maxSize\n   */\n  constructor (maxSize) {\n    this.lru = hashlru(maxSize)\n  }\n\n  /**\n   * Get the value from the a key\n   *\n   * @param {string} key\n   * @returns {T|undefined}\n   * @memberof TLoRU\n   */\n  get (key) {\n    const value = this.lru.get(key)\n    if (value) {\n      if ((value.expire) && (value.expire < Date.now())) {\n        this.lru.remove(key)\n        return undefined\n      }\n      return value.value\n    }\n    return undefined\n  }\n\n  /**\n   * Set a key value pair\n   *\n   * @param {string} key\n   * @param {T} value\n   * @param {number} ttl - in miliseconds\n   * @returns {void}\n   */\n  set (key, value, ttl) {\n    this.lru.set(key, { value, expire: Date.now() + ttl })\n  }\n\n  /**\n   * Find if the cache has the key\n   *\n   * @param {string} key\n   * @returns {boolean}\n   */\n  has (key) {\n    const value = this.get(key)\n    if (value) {\n      return true\n    }\n    return false\n  }\n\n  /**\n   * Remove key\n   *\n   * @param {string} key\n   */\n  remove (key) {\n    this.lru.remove(key)\n  }\n\n  /**\n   * Clears the cache\n   *\n   * @memberof TLRU\n   */\n  clear () {\n    this.lru.clear()\n  }\n}\n\nmodule.exports = TLRU\n","module.exports = function (max) {\n\n  if (!max) throw Error('hashlru must have a max value, of type number, greater than 0')\n\n  var size = 0, cache = Object.create(null), _cache = Object.create(null)\n\n  function update (key, value) {\n    cache[key] = value\n    size ++\n    if(size >= max) {\n      size = 0\n      _cache = cache\n      cache = Object.create(null)\n    }\n  }\n\n  return {\n    has: function (key) {\n      return cache[key] !== undefined || _cache[key] !== undefined\n    },\n    remove: function (key) {\n      if(cache[key] !== undefined)\n        cache[key] = undefined\n      if(_cache[key] !== undefined)\n        _cache[key] = undefined\n    },\n    get: function (key) {\n      var v = cache[key]\n      if(v !== undefined) return v\n      if((v = _cache[key]) !== undefined) {\n        update(key, v)\n        return v\n      }\n    },\n    set: function (key, value) {\n      if(cache[key] !== undefined) cache[key] = value\n      else update(key, value)\n    },\n    clear: function () {\n      cache = Object.create(null)\n      _cache = Object.create(null)\n    }\n  }\n}\n\n\n\n\n\n\n\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EventEmitter = require(\"eventemitter3\");\nconst p_timeout_1 = require(\"p-timeout\");\nconst priority_queue_1 = require(\"./priority-queue\");\n// eslint-disable-next-line @typescript-eslint/no-empty-function\nconst empty = () => { };\nconst timeoutError = new p_timeout_1.TimeoutError();\n/**\nPromise queue with concurrency control.\n*/\nclass PQueue extends EventEmitter {\n    constructor(options) {\n        var _a, _b, _c, _d;\n        super();\n        this._intervalCount = 0;\n        this._intervalEnd = 0;\n        this._pendingCount = 0;\n        this._resolveEmpty = empty;\n        this._resolveIdle = empty;\n        // eslint-disable-next-line @typescript-eslint/consistent-type-assertions\n        options = Object.assign({ carryoverConcurrencyCount: false, intervalCap: Infinity, interval: 0, concurrency: Infinity, autoStart: true, queueClass: priority_queue_1.default }, options);\n        if (!(typeof options.intervalCap === 'number' && options.intervalCap >= 1)) {\n            throw new TypeError(`Expected \\`intervalCap\\` to be a number from 1 and up, got \\`${(_b = (_a = options.intervalCap) === null || _a === void 0 ? void 0 : _a.toString()) !== null && _b !== void 0 ? _b : ''}\\` (${typeof options.intervalCap})`);\n        }\n        if (options.interval === undefined || !(Number.isFinite(options.interval) && options.interval >= 0)) {\n            throw new TypeError(`Expected \\`interval\\` to be a finite number >= 0, got \\`${(_d = (_c = options.interval) === null || _c === void 0 ? void 0 : _c.toString()) !== null && _d !== void 0 ? _d : ''}\\` (${typeof options.interval})`);\n        }\n        this._carryoverConcurrencyCount = options.carryoverConcurrencyCount;\n        this._isIntervalIgnored = options.intervalCap === Infinity || options.interval === 0;\n        this._intervalCap = options.intervalCap;\n        this._interval = options.interval;\n        this._queue = new options.queueClass();\n        this._queueClass = options.queueClass;\n        this.concurrency = options.concurrency;\n        this._timeout = options.timeout;\n        this._throwOnTimeout = options.throwOnTimeout === true;\n        this._isPaused = options.autoStart === false;\n    }\n    get _doesIntervalAllowAnother() {\n        return this._isIntervalIgnored || this._intervalCount < this._intervalCap;\n    }\n    get _doesConcurrentAllowAnother() {\n        return this._pendingCount < this._concurrency;\n    }\n    _next() {\n        this._pendingCount--;\n        this._tryToStartAnother();\n        this.emit('next');\n    }\n    _resolvePromises() {\n        this._resolveEmpty();\n        this._resolveEmpty = empty;\n        if (this._pendingCount === 0) {\n            this._resolveIdle();\n            this._resolveIdle = empty;\n            this.emit('idle');\n        }\n    }\n    _onResumeInterval() {\n        this._onInterval();\n        this._initializeIntervalIfNeeded();\n        this._timeoutId = undefined;\n    }\n    _isIntervalPaused() {\n        const now = Date.now();\n        if (this._intervalId === undefined) {\n            const delay = this._intervalEnd - now;\n            if (delay < 0) {\n                // Act as the interval was done\n                // We don't need to resume it here because it will be resumed on line 160\n                this._intervalCount = (this._carryoverConcurrencyCount) ? this._pendingCount : 0;\n            }\n            else {\n                // Act as the interval is pending\n                if (this._timeoutId === undefined) {\n                    this._timeoutId = setTimeout(() => {\n                        this._onResumeInterval();\n                    }, delay);\n                }\n                return true;\n            }\n        }\n        return false;\n    }\n    _tryToStartAnother() {\n        if (this._queue.size === 0) {\n            // We can clear the interval (\"pause\")\n            // Because we can redo it later (\"resume\")\n            if (this._intervalId) {\n                clearInterval(this._intervalId);\n            }\n            this._intervalId = undefined;\n            this._resolvePromises();\n            return false;\n        }\n        if (!this._isPaused) {\n            const canInitializeInterval = !this._isIntervalPaused();\n            if (this._doesIntervalAllowAnother && this._doesConcurrentAllowAnother) {\n                const job = this._queue.dequeue();\n                if (!job) {\n                    return false;\n                }\n                this.emit('active');\n                job();\n                if (canInitializeInterval) {\n                    this._initializeIntervalIfNeeded();\n                }\n                return true;\n            }\n        }\n        return false;\n    }\n    _initializeIntervalIfNeeded() {\n        if (this._isIntervalIgnored || this._intervalId !== undefined) {\n            return;\n        }\n        this._intervalId = setInterval(() => {\n            this._onInterval();\n        }, this._interval);\n        this._intervalEnd = Date.now() + this._interval;\n    }\n    _onInterval() {\n        if (this._intervalCount === 0 && this._pendingCount === 0 && this._intervalId) {\n            clearInterval(this._intervalId);\n            this._intervalId = undefined;\n        }\n        this._intervalCount = this._carryoverConcurrencyCount ? this._pendingCount : 0;\n        this._processQueue();\n    }\n    /**\n    Executes all queued functions until it reaches the limit.\n    */\n    _processQueue() {\n        // eslint-disable-next-line no-empty\n        while (this._tryToStartAnother()) { }\n    }\n    get concurrency() {\n        return this._concurrency;\n    }\n    set concurrency(newConcurrency) {\n        if (!(typeof newConcurrency === 'number' && newConcurrency >= 1)) {\n            throw new TypeError(`Expected \\`concurrency\\` to be a number from 1 and up, got \\`${newConcurrency}\\` (${typeof newConcurrency})`);\n        }\n        this._concurrency = newConcurrency;\n        this._processQueue();\n    }\n    /**\n    Adds a sync or async task to the queue. Always returns a promise.\n    */\n    async add(fn, options = {}) {\n        return new Promise((resolve, reject) => {\n            const run = async () => {\n                this._pendingCount++;\n                this._intervalCount++;\n                try {\n                    const operation = (this._timeout === undefined && options.timeout === undefined) ? fn() : p_timeout_1.default(Promise.resolve(fn()), (options.timeout === undefined ? this._timeout : options.timeout), () => {\n                        if (options.throwOnTimeout === undefined ? this._throwOnTimeout : options.throwOnTimeout) {\n                            reject(timeoutError);\n                        }\n                        return undefined;\n                    });\n                    resolve(await operation);\n                }\n                catch (error) {\n                    reject(error);\n                }\n                this._next();\n            };\n            this._queue.enqueue(run, options);\n            this._tryToStartAnother();\n            this.emit('add');\n        });\n    }\n    /**\n    Same as `.add()`, but accepts an array of sync or async functions.\n\n    @returns A promise that resolves when all functions are resolved.\n    */\n    async addAll(functions, options) {\n        return Promise.all(functions.map(async (function_) => this.add(function_, options)));\n    }\n    /**\n    Start (or resume) executing enqueued tasks within concurrency limit. No need to call this if queue is not paused (via `options.autoStart = false` or by `.pause()` method.)\n    */\n    start() {\n        if (!this._isPaused) {\n            return this;\n        }\n        this._isPaused = false;\n        this._processQueue();\n        return this;\n    }\n    /**\n    Put queue execution on hold.\n    */\n    pause() {\n        this._isPaused = true;\n    }\n    /**\n    Clear the queue.\n    */\n    clear() {\n        this._queue = new this._queueClass();\n    }\n    /**\n    Can be called multiple times. Useful if you for example add additional items at a later time.\n\n    @returns A promise that settles when the queue becomes empty.\n    */\n    async onEmpty() {\n        // Instantly resolve if the queue is empty\n        if (this._queue.size === 0) {\n            return;\n        }\n        return new Promise(resolve => {\n            const existingResolve = this._resolveEmpty;\n            this._resolveEmpty = () => {\n                existingResolve();\n                resolve();\n            };\n        });\n    }\n    /**\n    The difference with `.onEmpty` is that `.onIdle` guarantees that all work from the queue has finished. `.onEmpty` merely signals that the queue is empty, but it could mean that some promises haven't completed yet.\n\n    @returns A promise that settles when the queue becomes empty, and all promises have completed; `queue.size === 0 && queue.pending === 0`.\n    */\n    async onIdle() {\n        // Instantly resolve if none pending and if nothing else is queued\n        if (this._pendingCount === 0 && this._queue.size === 0) {\n            return;\n        }\n        return new Promise(resolve => {\n            const existingResolve = this._resolveIdle;\n            this._resolveIdle = () => {\n                existingResolve();\n                resolve();\n            };\n        });\n    }\n    /**\n    Size of the queue.\n    */\n    get size() {\n        return this._queue.size;\n    }\n    /**\n    Size of the queue, filtered by the given options.\n\n    For example, this can be used to find the number of items remaining in the queue with a specific priority level.\n    */\n    sizeBy(options) {\n        // eslint-disable-next-line unicorn/no-fn-reference-in-iterator\n        return this._queue.filter(options).length;\n    }\n    /**\n    Number of pending promises.\n    */\n    get pending() {\n        return this._pendingCount;\n    }\n    /**\n    Whether the queue is currently paused.\n    */\n    get isPaused() {\n        return this._isPaused;\n    }\n    get timeout() {\n        return this._timeout;\n    }\n    /**\n    Set the timeout for future operations.\n    */\n    set timeout(milliseconds) {\n        this._timeout = milliseconds;\n    }\n}\nexports.default = PQueue;\n","'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n  , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n  Events.prototype = Object.create(null);\n\n  //\n  // This hack is needed because the `__proto__` property is still inherited in\n  // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n  //\n  if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n  this.fn = fn;\n  this.context = context;\n  this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n  if (typeof fn !== 'function') {\n    throw new TypeError('The listener must be a function');\n  }\n\n  var listener = new EE(fn, context || emitter, once)\n    , evt = prefix ? prefix + event : event;\n\n  if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n  else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n  else emitter._events[evt] = [emitter._events[evt], listener];\n\n  return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n  if (--emitter._eventsCount === 0) emitter._events = new Events();\n  else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n  this._events = new Events();\n  this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n  var names = []\n    , events\n    , name;\n\n  if (this._eventsCount === 0) return names;\n\n  for (name in (events = this._events)) {\n    if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n  }\n\n  if (Object.getOwnPropertySymbols) {\n    return names.concat(Object.getOwnPropertySymbols(events));\n  }\n\n  return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n  var evt = prefix ? prefix + event : event\n    , handlers = this._events[evt];\n\n  if (!handlers) return [];\n  if (handlers.fn) return [handlers.fn];\n\n  for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n    ee[i] = handlers[i].fn;\n  }\n\n  return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n  var evt = prefix ? prefix + event : event\n    , listeners = this._events[evt];\n\n  if (!listeners) return 0;\n  if (listeners.fn) return 1;\n  return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return false;\n\n  var listeners = this._events[evt]\n    , len = arguments.length\n    , args\n    , i;\n\n  if (listeners.fn) {\n    if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n    switch (len) {\n      case 1: return listeners.fn.call(listeners.context), true;\n      case 2: return listeners.fn.call(listeners.context, a1), true;\n      case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n      case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n      case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n      case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n    }\n\n    for (i = 1, args = new Array(len -1); i < len; i++) {\n      args[i - 1] = arguments[i];\n    }\n\n    listeners.fn.apply(listeners.context, args);\n  } else {\n    var length = listeners.length\n      , j;\n\n    for (i = 0; i < length; i++) {\n      if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n      switch (len) {\n        case 1: listeners[i].fn.call(listeners[i].context); break;\n        case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n        case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n        case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n        default:\n          if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n            args[j - 1] = arguments[j];\n          }\n\n          listeners[i].fn.apply(listeners[i].context, args);\n      }\n    }\n  }\n\n  return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n  return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n  return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return this;\n  if (!fn) {\n    clearEvent(this, evt);\n    return this;\n  }\n\n  var listeners = this._events[evt];\n\n  if (listeners.fn) {\n    if (\n      listeners.fn === fn &&\n      (!once || listeners.once) &&\n      (!context || listeners.context === context)\n    ) {\n      clearEvent(this, evt);\n    }\n  } else {\n    for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n      if (\n        listeners[i].fn !== fn ||\n        (once && !listeners[i].once) ||\n        (context && listeners[i].context !== context)\n      ) {\n        events.push(listeners[i]);\n      }\n    }\n\n    //\n    // Reset the array, or remove it completely if we have no more listeners.\n    //\n    if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n    else clearEvent(this, evt);\n  }\n\n  return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n  var evt;\n\n  if (event) {\n    evt = prefix ? prefix + event : event;\n    if (this._events[evt]) clearEvent(this, evt);\n  } else {\n    this._events = new Events();\n    this._eventsCount = 0;\n  }\n\n  return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n  module.exports = EventEmitter;\n}\n","'use strict';\n\nconst pFinally = require('p-finally');\n\nclass TimeoutError extends Error {\n\tconstructor(message) {\n\t\tsuper(message);\n\t\tthis.name = 'TimeoutError';\n\t}\n}\n\nconst pTimeout = (promise, milliseconds, fallback) => new Promise((resolve, reject) => {\n\tif (typeof milliseconds !== 'number' || milliseconds < 0) {\n\t\tthrow new TypeError('Expected `milliseconds` to be a positive number');\n\t}\n\n\tif (milliseconds === Infinity) {\n\t\tresolve(promise);\n\t\treturn;\n\t}\n\n\tconst timer = setTimeout(() => {\n\t\tif (typeof fallback === 'function') {\n\t\t\ttry {\n\t\t\t\tresolve(fallback());\n\t\t\t} catch (error) {\n\t\t\t\treject(error);\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\tconst message = typeof fallback === 'string' ? fallback : `Promise timed out after ${milliseconds} milliseconds`;\n\t\tconst timeoutError = fallback instanceof Error ? fallback : new TimeoutError(message);\n\n\t\tif (typeof promise.cancel === 'function') {\n\t\t\tpromise.cancel();\n\t\t}\n\n\t\treject(timeoutError);\n\t}, milliseconds);\n\n\t// TODO: Use native `finally` keyword when targeting Node.js 10\n\tpFinally(\n\t\t// eslint-disable-next-line promise/prefer-await-to-then\n\t\tpromise.then(resolve, reject),\n\t\t() => {\n\t\t\tclearTimeout(timer);\n\t\t}\n\t);\n});\n\nmodule.exports = pTimeout;\n// TODO: Remove this for the next major release\nmodule.exports.default = pTimeout;\n\nmodule.exports.TimeoutError = TimeoutError;\n","'use strict';\nmodule.exports = (promise, onFinally) => {\n\tonFinally = onFinally || (() => {});\n\n\treturn promise.then(\n\t\tval => new Promise(resolve => {\n\t\t\tresolve(onFinally());\n\t\t}).then(() => val),\n\t\terr => new Promise(resolve => {\n\t\t\tresolve(onFinally());\n\t\t}).then(() => {\n\t\t\tthrow err;\n\t\t})\n\t);\n};\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst lower_bound_1 = require(\"./lower-bound\");\nclass PriorityQueue {\n    constructor() {\n        this._queue = [];\n    }\n    enqueue(run, options) {\n        options = Object.assign({ priority: 0 }, options);\n        const element = {\n            priority: options.priority,\n            run\n        };\n        if (this.size && this._queue[this.size - 1].priority >= options.priority) {\n            this._queue.push(element);\n            return;\n        }\n        const index = lower_bound_1.default(this._queue, element, (a, b) => b.priority - a.priority);\n        this._queue.splice(index, 0, element);\n    }\n    dequeue() {\n        const item = this._queue.shift();\n        return item === null || item === void 0 ? void 0 : item.run;\n    }\n    filter(options) {\n        return this._queue.filter((element) => element.priority === options.priority).map((element) => element.run);\n    }\n    get size() {\n        return this._queue.length;\n    }\n}\nexports.default = PriorityQueue;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n// Port of lower_bound from https://en.cppreference.com/w/cpp/algorithm/lower_bound\n// Used to compute insertion index to keep queue sorted after insertion\nfunction lowerBound(array, value, comparator) {\n    let first = 0;\n    let count = array.length;\n    while (count > 0) {\n        const step = (count / 2) | 0;\n        let it = first + step;\n        if (comparator(array[it], value) <= 0) {\n            first = ++it;\n            count -= step + 1;\n        }\n        else {\n            count = step;\n        }\n    }\n    return first;\n}\nexports.default = lowerBound;\n","'use strict'\n\n/**\n * @param {Object} config\n * @param {import('../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) =>\n  /**\n   * @returns {boolean}\n   */\n  () => {\n    const net = network.try()\n    return net != null && Boolean(net.libp2p.isStarted())\n  }\n","'use strict'\n\nconst isIpfs = require('is-ipfs')\nconst CID = require('cids')\nconst { cidToString } = require('ipfs-core-utils/src/cid')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('ipfs-core-types/src/name').API} config.name - An IPFS core interface name API\n */\nmodule.exports = ({ ipld, name }) => {\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"resolve\"]}\n   */\n  async function resolve (path, opts = {}) {\n    if (!isIpfs.path(path)) {\n      throw new Error('invalid argument ' + path)\n    }\n\n    if (isIpfs.ipnsPath(path)) {\n      if (!name) {\n        throw new Error('failed to resolve IPNS path: name API unavailable')\n      }\n\n      for await (const resolvedPath of name.resolve(path, opts)) {\n        path = resolvedPath\n      }\n    }\n\n    const [, , hash, ...rest] = path.split('/') // ['', 'ipfs', 'hash', ...path]\n    const cid = new CID(hash)\n\n    // nothing to resolve return the input\n    if (rest.length === 0) {\n      return `/ipfs/${cidToString(cid, { base: opts.cidBase })}`\n    }\n\n    path = rest.join('/')\n\n    const results = ipld.resolve(cid, path)\n    let value = cid\n    let remainderPath = path\n\n    for await (const result of results) {\n      if (CID.isCID(result.value)) {\n        value = result.value\n        remainderPath = result.remainderPath\n      }\n    }\n\n    return `/ipfs/${cidToString(value, { base: opts.cidBase })}${remainderPath ? '/' + remainderPath : ''}`\n  }\n\n  return withTimeoutOption(resolve)\n}\n","'use strict'\n\nconst CID = require('cids')\n\n/**\n * Stringify a CID encoded in the requested base, upgrading to v1 if necessary.\n *\n * Setting upgrade to false will disable automatic CID upgrading from v0 to v1\n * which is necessary if the multibase is something other than base58btc. Note\n * that it will also not apply the encoding (since v0 CIDs can only be encoded\n * as base58btc).\n *\n * @param {CID|Uint8Array|string} input - The CID to encode\n * @param {Object} [options] - Optional options\n * @param {import('cids').BaseNameOrCode} [options.base] - Name of multibase codec to encode the CID with\n * @param {boolean} [options.upgrade] - Automatically upgrade v0 CIDs to v1 when\n * necessary. Default: true.\n * @returns {string} - CID in string representation\n */\nexports.cidToString = (input, options = {}) => {\n  const upgrade = options.upgrade !== false\n  let cid = CID.isCID(input)\n    ? input\n    // @ts-ignore - TS seems to get confused by the type defs in CID repo.\n    : new CID(input)\n\n  if (cid.version === 0 && options.base && options.base !== 'base58btc') {\n    if (!upgrade) return cid.toString()\n    cid = cid.toV1()\n  }\n\n  return cid.toBaseEncodedString(options.base)\n}\n","'use strict'\n\nconst createAdd = require('./add')\nconst createAddAll = require('./add-all')\nconst createLs = require('./ls')\nconst createRm = require('./rm')\nconst createRmAll = require('./rm-all')\n\n/**\n * @typedef {import('../gc-lock').GCLock} GCLock\n * @typedef {import('./pin-manager')} PinManager\n */\n\nclass PinAPI {\n  /**\n   * @param {Object} config\n   * @param {GCLock} config.gcLock\n   * @param {import('ipld')} config.ipld\n   * @param {PinManager} config.pinManager\n   */\n  constructor ({ gcLock, ipld, pinManager }) {\n    const addAll = createAddAll({ gcLock, ipld, pinManager })\n    this.addAll = addAll\n    this.add = createAdd({ addAll })\n    const rmAll = createRmAll({ gcLock, ipld, pinManager })\n    this.rmAll = rmAll\n    this.rm = createRm({ rmAll })\n    this.ls = createLs({ ipld, pinManager })\n\n    /** @type {import('ipfs-core-types/src/pin/remote').API} */\n    this.remote = {\n      add: (cid, options = {}) => Promise.reject(new Error('Not implemented')),\n      ls: async function * (query, options = {}) { return Promise.reject(new Error('Not implemented')) }, // eslint-disable-line require-yield\n      rm: (query, options = {}) => Promise.reject(new Error('Not implemented')),\n      rmAll: (query, options = {}) => Promise.reject(new Error('Not implemented')),\n      service: {\n        add: (name, credentials) => Promise.reject(new Error('Not implemented')),\n        rm: (name, options = {}) => Promise.reject(new Error('Not implemented')),\n        ls: (options = {}) => Promise.reject(new Error('Not implemented'))\n      }\n    }\n  }\n}\n\nmodule.exports = PinAPI\n","'use strict'\n\nconst last = require('it-last')\nconst CID = require('cids')\n\n/**\n * @param {Object} config\n * @param {ReturnType<typeof import('./add-all')>} config.addAll\n */\nmodule.exports = ({ addAll }) =>\n  /**\n   * @type {import('ipfs-core-types/src/pin').API[\"add\"]}\n   */\n  (path, options = {}) => {\n    let iter\n\n    if (CID.isCID(path)) {\n      iter = addAll([{\n        cid: path,\n        ...options\n      }], options)\n    } else {\n      iter = addAll([{\n        path: path.toString(),\n        ...options\n      }], options)\n    }\n\n    // @ts-ignore return value of last can be undefined\n    return last(iter)\n  }\n","'use strict'\n\n/**\n * Returns the last item of an (async) iterable, unless empty, in which case\n * return `undefined`.\n *\n * @template T\n * @param {AsyncIterable<T>|Iterable<T>} source\n */\nconst last = async (source) => {\n  let res\n\n  for await (const entry of source) {\n    res = entry\n  }\n\n  return res\n}\n\nmodule.exports = last\n","/* eslint max-nested-callbacks: [\"error\", 8] */\n'use strict'\n\nconst { resolvePath } = require('../../utils')\nconst PinManager = require('./pin-manager')\nconst { PinTypes } = PinManager\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst normaliseInput = require('ipfs-core-utils/src/pins/normalise-input')\n\n/**\n * @typedef {import('ipfs-core-utils/src/pins/normalise-input').Source} Source\n * @typedef {import('ipfs-core-utils/src/pins/normalise-input').Pin} PinTarget\n * @typedef {import('ipfs-core-types/src/utils').AbortOptions} AbortOptions\n * @typedef {import('cids')} CID\n */\n\n/**\n * @template T\n * @typedef {Iterable<T>|AsyncIterable<T>} AwaitIterable\n */\n\n/**\n * @param {Object} config\n * @param {import('../gc-lock').GCLock} config.gcLock\n * @param {import('ipld')} config.ipld\n * @param {import('./pin-manager')} config.pinManager\n */\nmodule.exports = ({ pinManager, gcLock, ipld }) => {\n  /**\n   * @type {import('ipfs-core-types/src/pin').API[\"addAll\"]}\n   */\n  async function * addAll (source, options = {}) {\n    /**\n     * @returns {AsyncIterable<CID>}\n     */\n    const pinAdd = async function * () {\n      for await (const { path, recursive, metadata } of normaliseInput(source)) {\n        const cid = await resolvePath(ipld, path)\n\n        // verify that each hash can be pinned\n        const { reason } = await pinManager.isPinnedWithType(cid, [PinTypes.recursive, PinTypes.direct])\n\n        if (reason === 'recursive' && !recursive) {\n          // only disallow trying to override recursive pins\n          throw new Error(`${cid} already pinned recursively`)\n        }\n\n        if (recursive) {\n          await pinManager.pinRecursively(cid, { metadata })\n        } else {\n          await pinManager.pinDirectly(cid, { metadata })\n        }\n\n        yield cid\n      }\n    }\n\n    // When adding a file, we take a lock that gets released after pinning\n    // is complete, so don't take a second lock here\n    const lock = Boolean(options.lock)\n\n    if (!lock) {\n      yield * pinAdd()\n      return\n    }\n\n    const release = await gcLock.readLock()\n\n    try {\n      yield * pinAdd()\n    } finally {\n      release()\n    }\n  }\n\n  return withTimeoutOption(addAll)\n}\n","/* eslint max-nested-callbacks: [\"error\", 8] */\n'use strict'\n\nconst CID = require('cids')\nconst errCode = require('err-code')\n// @ts-ignore - no types\nconst dagCborLinks = require('dag-cbor-links')\nconst debug = require('debug')\nconst first = require('it-first')\nconst all = require('it-all')\nconst cborg = require('cborg')\nconst multibase = require('multibase')\nconst multicodec = require('multicodec')\nconst { Key } = require('interface-datastore')\n\n/**\n * @typedef {object} Pin\n * @property {number} depth\n * @property {CID.CIDVersion} [version]\n * @property {multicodec.CodecCode} [codec]\n * @property {Record<string, any>} [metadata]\n */\n\n/**\n * @typedef {import('ipfs-core-types/src/pin').PinType} PinType\n * @typedef {import('ipfs-core-types/src/pin').PinQueryType} PinQueryType\n */\n\n/**\n * @typedef {Object} PinOptions\n * @property {any} [metadata]\n *\n * @typedef {import('ipfs-core-types/src/utils').AbortOptions} AbortOptions\n */\n\n// arbitrary limit to the number of concurrent dag operations\n// const WALK_DAG_CONCURRENCY_LIMIT = 300\n// const IS_PINNED_WITH_TYPE_CONCURRENCY_LIMIT = 300\n// const PIN_DS_KEY = new Key('/local/pins')\n\n/**\n * @param {string} type\n */\nfunction invalidPinTypeErr (type) {\n  const errMsg = `Invalid type '${type}', must be one of {direct, indirect, recursive, all}`\n  return errCode(new Error(errMsg), 'ERR_INVALID_PIN_TYPE')\n}\n\nconst encoder = multibase.encoding('base32upper')\n\n/**\n * @param {CID} cid\n */\nfunction cidToKey (cid) {\n  return new Key(`/${encoder.encode(cid.multihash)}`)\n}\n\n/**\n * @param {Key | string} key\n */\nfunction keyToMultihash (key) {\n  return encoder.decode(key.toString().slice(1))\n}\n\nconst PinTypes = {\n  /** @type {'direct'} */\n  direct: ('direct'),\n  /** @type {'recursive'} */\n  recursive: ('recursive'),\n  /** @type {'indirect'} */\n  indirect: ('indirect'),\n  /** @type {'all'} */\n  all: ('all')\n}\n\nclass PinManager {\n  /**\n   * @param {Object} config\n   * @param {import('ipfs-repo')} config.repo\n   * @param {import('ipld')} config.ipld\n   */\n  constructor ({ repo, ipld }) {\n    this.repo = repo\n    this.ipld = ipld\n    this.log = debug('ipfs:pin')\n    this.directPins = new Set()\n    this.recursivePins = new Set()\n  }\n\n  /**\n   * @private\n   * @param {CID} cid\n   * @param {AbortOptions} [options]\n   * @returns {AsyncGenerator<CID, void, undefined>}\n   */\n  async * _walkDag (cid, options) {\n    const node = await this.ipld.get(cid, options)\n\n    if (cid.codec === 'dag-pb') {\n      for (const link of node.Links) {\n        yield link.Hash\n        yield * this._walkDag(link.Hash, options)\n      }\n    } else if (cid.codec === 'dag-cbor') {\n      for (const [, childCid] of dagCborLinks(node)) {\n        yield childCid\n        yield * this._walkDag(childCid, options)\n      }\n    }\n  }\n\n  /**\n   * @param {CID} cid\n   * @param {PinOptions & AbortOptions} [options]\n   * @returns {Promise<void>}\n   */\n  async pinDirectly (cid, options = {}) {\n    await this.ipld.get(cid, options)\n\n    /** @type {Pin} */\n    const pin = {\n      depth: 0\n    }\n\n    if (cid.version !== 0) {\n      pin.version = cid.version\n    }\n\n    if (cid.codec !== 'dag-pb') {\n      pin.codec = multicodec.getNumber(cid.codec)\n    }\n\n    if (options.metadata) {\n      pin.metadata = options.metadata\n    }\n\n    return this.repo.pins.put(cidToKey(cid), cborg.encode(pin))\n  }\n\n  /**\n   * @param {CID} cid\n   * @param {AbortOptions} [options]\n   * @returns {Promise<void>}\n   */\n  // eslint-disable-next-line require-await\n  async unpin (cid, options) {\n    return this.repo.pins.delete(cidToKey(cid))\n  }\n\n  /**\n   * @param {CID} cid\n   * @param {PinOptions & AbortOptions} [options]\n   * @returns {Promise<void>}\n   */\n  async pinRecursively (cid, options = {}) {\n    await this.fetchCompleteDag(cid, options)\n\n    /** @type {Pin} */\n    const pin = {\n      depth: Infinity\n    }\n\n    if (cid.version !== 0) {\n      pin.version = cid.version\n    }\n\n    if (cid.codec !== 'dag-pb') {\n      pin.codec = multicodec.getNumber(cid.codec)\n    }\n\n    if (options.metadata) {\n      pin.metadata = options.metadata\n    }\n\n    await this.repo.pins.put(cidToKey(cid), cborg.encode(pin))\n  }\n\n  /**\n   * @param {AbortOptions} [options]\n   */\n  async * directKeys (options) {\n    for await (const entry of this.repo.pins.query({\n      filters: [(entry) => {\n        const pin = cborg.decode(entry.value)\n\n        return pin.depth === 0\n      }]\n    })) {\n      const pin = cborg.decode(entry.value)\n      const version = pin.version || 0\n      const codec = pin.codec ? multicodec.getName(pin.codec) : 'dag-pb'\n      const multihash = keyToMultihash(entry.key)\n\n      yield {\n        cid: new CID(version, codec, multihash),\n        metadata: pin.metadata\n      }\n    }\n  }\n\n  /**\n   * @param {AbortOptions} [options]\n   */\n  async * recursiveKeys (options) {\n    for await (const entry of this.repo.pins.query({\n      filters: [(entry) => {\n        const pin = cborg.decode(entry.value)\n\n        return pin.depth === Infinity\n      }]\n    })) {\n      const pin = cborg.decode(entry.value)\n      const version = pin.version || 0\n      const codec = pin.codec ? multicodec.getName(pin.codec) : 'dag-pb'\n      const multihash = keyToMultihash(entry.key)\n\n      yield {\n        cid: new CID(version, codec, multihash),\n        metadata: pin.metadata\n      }\n    }\n  }\n\n  /**\n   * @param {AbortOptions} [options]\n   */\n  async * indirectKeys (options) {\n    for await (const { cid } of this.recursiveKeys()) {\n      for await (const childCid of this._walkDag(cid, options)) {\n        // recursive pins override indirect pins\n        const types = [\n          PinTypes.recursive\n        ]\n\n        const result = await this.isPinnedWithType(childCid, types)\n\n        if (result.pinned) {\n          continue\n        }\n\n        yield childCid\n      }\n    }\n  }\n\n  /**\n   * @param {CID} cid\n   * @param {PinQueryType|PinQueryType[]} types\n   * @param {AbortOptions} [options]\n   */\n  async isPinnedWithType (cid, types, options) {\n    if (!Array.isArray(types)) {\n      types = [types]\n    }\n\n    const all = types.includes(PinTypes.all)\n    const direct = types.includes(PinTypes.direct)\n    const recursive = types.includes(PinTypes.recursive)\n    const indirect = types.includes(PinTypes.indirect)\n\n    if (recursive || direct || all) {\n      const result = await first(this.repo.pins.query({\n        prefix: cidToKey(cid).toString(),\n        filters: [entry => {\n          if (all) {\n            return true\n          }\n\n          const pin = cborg.decode(entry.value)\n\n          return types.includes(pin.depth === 0 ? PinTypes.direct : PinTypes.recursive)\n        }],\n        limit: 1\n      }))\n\n      if (result) {\n        const pin = cborg.decode(result.value)\n\n        return {\n          cid,\n          pinned: true,\n          reason: pin.depth === 0 ? PinTypes.direct : PinTypes.recursive,\n          metadata: pin.metadata\n        }\n      }\n    }\n\n    const self = this\n\n    /**\n     * @param {CID} key\n     * @param {AsyncIterable<{ cid: CID, metadata: any }>} source\n     */\n    async function * findChild (key, source) {\n      for await (const { cid: parentCid } of source) {\n        for await (const childCid of self._walkDag(parentCid)) {\n          if (childCid.equals(key)) {\n            yield parentCid\n            return\n          }\n        }\n      }\n    }\n\n    if (all || indirect) {\n      // indirect (default)\n      // check each recursive key to see if multihash is under it\n\n      const parentCid = await first(findChild(cid, this.recursiveKeys()))\n\n      if (parentCid) {\n        return {\n          cid,\n          pinned: true,\n          reason: PinTypes.indirect,\n          parent: parentCid\n        }\n      }\n    }\n\n    return {\n      cid,\n      pinned: false\n    }\n  }\n\n  /**\n   * @param {CID} cid\n   * @param {AbortOptions} options\n   */\n  async fetchCompleteDag (cid, options) {\n    await all(this._walkDag(cid, options))\n  }\n\n  /**\n   * Throws an error if the pin type is invalid\n   *\n   * @param {any} type\n   * @returns {type is PinType}\n   */\n  static checkPinType (type) {\n    if (typeof type !== 'string' || !Object.keys(PinTypes).includes(type)) {\n      throw invalidPinTypeErr(type)\n    }\n    return true\n  }\n}\n\nPinManager.PinTypes = PinTypes\n\nmodule.exports = PinManager\n","const cbor = require('ipld-dag-cbor').util\nconst CID = require('cids')\n\nconst links = (obj, path = [], parseBuffer=true) => {\n  if (parseBuffer && Buffer.isBuffer(obj)) {\n    obj = cbor.deserialize(obj)\n  }\n  return (function * () {\n    for (let key of Object.keys(obj)) {\n      let _path = path.slice()\n      _path.push(key)\n      let val = obj[key]\n      if (val && typeof val === 'object') {\n        if (Array.isArray(val)) {\n          for (let i = 0; i < val.length; i++) {\n            let __path = _path.slice()\n            __path.push(i)\n            let o = val[i]\n            if (CID.isCID(o)) {\n              yield [__path.join('/'), o]\n            } else if (typeof o === 'object') {\n              yield * links(o, _path, false)\n            }\n          }\n        } else {\n          if (CID.isCID(val)) {\n            yield [_path.join('/'), val]\n          } else {\n            yield * links(val, _path, false)\n          }\n        }\n      }\n    }\n  })()\n}\n\nmodule.exports = links\n","'use strict'\n\nexports.util = require('./util.js')\nexports.resolver = require('./resolver.js')\nexports.codec = exports.util.codec\nexports.defaultHashAlg = exports.util.defaultHashAlg\n","'use strict'\n\nconst cbor = require('borc')\nconst multicodec = require('multicodec')\nconst multihashing = require('multihashing-async')\nconst CID = require('cids')\nconst isCircular = require('is-circular')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n// https://github.com/ipfs/go-ipfs/issues/3570#issuecomment-273931692\nconst CID_CBOR_TAG = 42\n\nfunction tagCID (cid) {\n  if (typeof cid === 'string') {\n    cid = new CID(cid).bytes\n  } else if (CID.isCID(cid)) {\n    cid = cid.bytes\n  }\n\n  return new cbor.Tagged(CID_CBOR_TAG, uint8ArrayConcat([\n    uint8ArrayFromString('00', 'base16'), // thanks jdag\n    cid\n  ], 1 + cid.length))\n}\n\nfunction replaceCIDbyTAG (dagNode) {\n  let circular\n  try {\n    circular = isCircular(dagNode)\n  } catch (e) {\n    circular = false\n  }\n  if (circular) {\n    throw new Error('The object passed has circular references')\n  }\n\n  function transform (obj) {\n    if (!obj || obj instanceof Uint8Array || typeof obj === 'string') {\n      return obj\n    }\n\n    if (Array.isArray(obj)) {\n      return obj.map(transform)\n    }\n\n    if (CID.isCID(obj)) {\n      return tagCID(obj)\n    }\n\n    const keys = Object.keys(obj)\n\n    if (keys.length > 0) {\n      // Recursive transform\n      const out = {}\n      keys.forEach((key) => {\n        if (typeof obj[key] === 'object') {\n          out[key] = transform(obj[key])\n        } else {\n          out[key] = obj[key]\n        }\n      })\n      return out\n    } else {\n      return obj\n    }\n  }\n\n  return transform(dagNode)\n}\n\nconst codec = multicodec.DAG_CBOR\nconst defaultHashAlg = multicodec.SHA2_256\n\nconst defaultTags = {\n  [CID_CBOR_TAG]: (val) => {\n    // remove that 0\n    val = val.slice(1)\n    return new CID(val)\n  }\n}\nconst defaultSize = 64 * 1024 // current decoder heap size, 64 Kb\nlet currentSize = defaultSize\nconst defaultMaxSize = 64 * 1024 * 1024 // max heap size when auto-growing, 64 Mb\nlet maxSize = defaultMaxSize\nlet decoder = null\n\n/**\n * Configure the underlying CBOR decoder.\n *\n * @param {Object} [options] - The options the decoder takes. The decoder will reset to the defaul values if no options are given.\n * @param {number} [options.size=65536] - The current heap size used in CBOR parsing, this may grow automatically as larger blocks are encountered up to `maxSize`\n * @param {number} [options.maxSize=67108864] - The maximum size the CBOR parsing heap is allowed to grow to before `dagCBOR.util.deserialize()` returns an error\n * @param {Object} [options.tags] - An object whose keys are CBOR tag numbers and values are transform functions that accept a `value` and return a decoded representation of that `value`\n */\nfunction configureDecoder (options) {\n  let tags = defaultTags\n\n  if (options) {\n    if (typeof options.size === 'number') {\n      currentSize = options.size\n    }\n    if (typeof options.maxSize === 'number') {\n      maxSize = options.maxSize\n    }\n    if (options.tags) {\n      tags = Object.assign({}, defaultTags, options && options.tags)\n    }\n  } else {\n    // no options, reset to defaults\n    currentSize = defaultSize\n    maxSize = defaultMaxSize\n  }\n\n  const decoderOptions = {\n    tags,\n    size: currentSize\n  }\n\n  decoder = new cbor.Decoder(decoderOptions)\n  // borc edits opts.size in-place so we can capture _actual_ size\n  currentSize = decoderOptions.size\n}\n\nconfigureDecoder() // Setup default cbor.Decoder\n\n/**\n * Serialize internal representation into a binary CBOR block.\n *\n * @param {Object} node - Internal representation of a CBOR block\n * @returns {Uint8Array} - The encoded binary representation\n */\nfunction serialize (node) {\n  const nodeTagged = replaceCIDbyTAG(node)\n  const serialized = cbor.encode(nodeTagged)\n\n  return serialized\n}\n\n/**\n * Deserialize CBOR block into the internal representation.\n *\n * @param {Uint8Array} data - Binary representation of a CBOR block\n * @returns {Object} - An object that conforms to the IPLD Data Model\n */\nfunction deserialize (data) {\n  if (data.length > currentSize && data.length <= maxSize) {\n    configureDecoder({ size: data.length })\n  }\n\n  if (data.length > currentSize) {\n    throw new Error('Data is too large to deserialize with current decoder')\n  }\n\n  // borc will decode back-to-back objects into an implicit top-level array, we\n  // strictly want to only see a single explicit top-level object\n  const all = decoder.decodeAll(data)\n  if (all.length !== 1) {\n    throw new Error('Extraneous CBOR data found beyond initial top-level object')\n  }\n\n  return all[0]\n}\n\n/**\n * Calculate the CID of the binary blob.\n *\n * @param {Object} binaryBlob - Encoded IPLD Node\n * @param {Object} [userOptions] - Options to create the CID\n * @param {number} [userOptions.cidVersion=1] - CID version number\n * @param {string} [userOptions.hashAlg] - Defaults to the defaultHashAlg of the format\n * @returns {Promise.<CID>}\n */\nasync function cid (binaryBlob, userOptions) {\n  const defaultOptions = { cidVersion: 1, hashAlg: defaultHashAlg }\n  const options = Object.assign(defaultOptions, userOptions)\n\n  const multihash = await multihashing(binaryBlob, options.hashAlg)\n  const codecName = multicodec.getNameFromCode(codec)\n  const cid = new CID(options.cidVersion, codecName, multihash)\n\n  return cid\n}\n\nmodule.exports = {\n  codec,\n  defaultHashAlg,\n  configureDecoder,\n  serialize,\n  deserialize,\n  cid\n}\n","'use strict'\n\n// exports.Commented = require('./commented')\nexports.Diagnose = require('./diagnose')\nexports.Decoder = require('./decoder')\nexports.Encoder = require('./encoder')\nexports.Simple = require('./simple')\nexports.Tagged = require('./tagged')\n\n// exports.comment = exports.Commented.comment\nexports.decodeAll = exports.Decoder.decodeAll\nexports.decodeFirst = exports.Decoder.decodeFirst\nexports.diagnose = exports.Diagnose.diagnose\nexports.encode = exports.Encoder.encode\nexports.decode = exports.Decoder.decode\n\nexports.leveldb = {\n  decode: exports.Decoder.decodeAll,\n  encode: exports.Encoder.encode,\n  buffer: true,\n  name: 'cbor'\n}\n","'use strict'\n\nconst { Buffer } = require('buffer')\nconst Decoder = require('./decoder')\nconst utils = require('./utils')\n\n/**\n * Output the diagnostic format from a stream of CBOR bytes.\n *\n */\nclass Diagnose extends Decoder {\n  createTag (tagNumber, value) {\n    return `${tagNumber}(${value})`\n  }\n\n  createInt (val) {\n    return super.createInt(val).toString()\n  }\n\n  createInt32 (f, g) {\n    return super.createInt32(f, g).toString()\n  }\n\n  createInt64 (f1, f2, g1, g2) {\n    return super.createInt64(f1, f2, g1, g2).toString()\n  }\n\n  createInt32Neg (f, g) {\n    return super.createInt32Neg(f, g).toString()\n  }\n\n  createInt64Neg (f1, f2, g1, g2) {\n    return super.createInt64Neg(f1, f2, g1, g2).toString()\n  }\n\n  createTrue () {\n    return 'true'\n  }\n\n  createFalse () {\n    return 'false'\n  }\n\n  createFloat (val) {\n    const fl = super.createFloat(val)\n    if (utils.isNegativeZero(val)) {\n      return '-0_1'\n    }\n\n    return `${fl}_1`\n  }\n\n  createFloatSingle (a, b, c, d) {\n    const fl = super.createFloatSingle(a, b, c, d)\n    return `${fl}_2`\n  }\n\n  createFloatDouble (a, b, c, d, e, f, g, h) {\n    const fl = super.createFloatDouble(a, b, c, d, e, f, g, h)\n    return `${fl}_3`\n  }\n\n  createByteString (raw, len) {\n    const val = raw.join(', ')\n\n    if (len === -1) {\n      return `(_ ${val})`\n    }\n    return `h'${val}`\n  }\n\n  createByteStringFromHeap (start, end) {\n    const val = (Buffer.from(\n      super.createByteStringFromHeap(start, end)\n    )).toString('hex')\n\n    return `h'${val}'`\n  }\n\n  createInfinity () {\n    return 'Infinity_1'\n  }\n\n  createInfinityNeg () {\n    return '-Infinity_1'\n  }\n\n  createNaN () {\n    return 'NaN_1'\n  }\n\n  createNaNNeg () {\n    return '-NaN_1'\n  }\n\n  createNull () {\n    return 'null'\n  }\n\n  createUndefined () {\n    return 'undefined'\n  }\n\n  createSimpleUnassigned (val) {\n    return `simple(${val})`\n  }\n\n  createArray (arr, len) {\n    const val = super.createArray(arr, len)\n\n    if (len === -1) {\n      // indefinite\n      return `[_ ${val.join(', ')}]`\n    }\n\n    return `[${val.join(', ')}]`\n  }\n\n  createMap (map, len) {\n    const val = super.createMap(map)\n    const list = Array.from(val.keys())\n      .reduce(collectObject(val), '')\n\n    if (len === -1) {\n      return `{_ ${list}}`\n    }\n\n    return `{${list}}`\n  }\n\n  createObject (obj, len) {\n    const val = super.createObject(obj)\n    const map = Object.keys(val)\n      .reduce(collectObject(val), '')\n\n    if (len === -1) {\n      return `{_ ${map}}`\n    }\n\n    return `{${map}}`\n  }\n\n  createUtf8String (raw, len) {\n    const val = raw.join(', ')\n\n    if (len === -1) {\n      return `(_ ${val})`\n    }\n\n    return `\"${val}\"`\n  }\n\n  createUtf8StringFromHeap (start, end) {\n    const val = (Buffer.from(\n      super.createUtf8StringFromHeap(start, end)\n    )).toString('utf8')\n\n    return `\"${val}\"`\n  }\n\n  static diagnose (input, enc) {\n    if (typeof input === 'string') {\n      input = Buffer.from(input, enc || 'hex')\n    }\n\n    const dec = new Diagnose()\n    return dec.decodeFirst(input)\n  }\n}\n\nmodule.exports = Diagnose\n\nfunction collectObject (val) {\n  return (acc, key) => {\n    if (acc) {\n      return `${acc}, ${key}: ${val[key]}`\n    }\n    return `${key}: ${val[key]}`\n  }\n}\n","'use strict'\n\nconst { Buffer } = require('buffer')\nconst ieee754 = require('ieee754')\nconst Bignumber = require('bignumber.js').BigNumber\n\nconst parser = require('./decoder.asm')\nconst utils = require('./utils')\nconst c = require('./constants')\nconst Simple = require('./simple')\nconst Tagged = require('./tagged')\nconst { URL } = require('iso-url')\n\n/**\n * Transform binary cbor data into JavaScript objects.\n */\nclass Decoder {\n  /**\n   * @param {Object} [opts={}]\n   * @param {number} [opts.size=65536] - Size of the allocated heap.\n   */\n  constructor (opts) {\n    opts = opts || {}\n\n    if (!opts.size || opts.size < 0x10000) {\n      opts.size = 0x10000\n    } else {\n      // Ensure the size is a power of 2\n      opts.size = utils.nextPowerOf2(opts.size)\n    }\n\n    // Heap use to share the input with the parser\n    this._heap = new ArrayBuffer(opts.size)\n    this._heap8 = new Uint8Array(this._heap)\n    this._buffer = Buffer.from(this._heap)\n\n    this._reset()\n\n    // Known tags\n    this._knownTags = Object.assign({\n      0: (val) => new Date(val),\n      1: (val) => new Date(val * 1000),\n      2: (val) => utils.arrayBufferToBignumber(val),\n      3: (val) => c.NEG_ONE.minus(utils.arrayBufferToBignumber(val)),\n      4: (v) => {\n        // const v = new Uint8Array(val)\n        return c.TEN.pow(v[0]).times(v[1])\n      },\n      5: (v) => {\n        // const v = new Uint8Array(val)\n        return c.TWO.pow(v[0]).times(v[1])\n      },\n      32: (val) => new URL(val),\n      35: (val) => new RegExp(val)\n    }, opts.tags)\n\n    // Initialize asm based parser\n    this.parser = parser(global, {\n      // eslint-disable-next-line no-console\n      log: console.log.bind(console),\n      pushInt: this.pushInt.bind(this),\n      pushInt32: this.pushInt32.bind(this),\n      pushInt32Neg: this.pushInt32Neg.bind(this),\n      pushInt64: this.pushInt64.bind(this),\n      pushInt64Neg: this.pushInt64Neg.bind(this),\n      pushFloat: this.pushFloat.bind(this),\n      pushFloatSingle: this.pushFloatSingle.bind(this),\n      pushFloatDouble: this.pushFloatDouble.bind(this),\n      pushTrue: this.pushTrue.bind(this),\n      pushFalse: this.pushFalse.bind(this),\n      pushUndefined: this.pushUndefined.bind(this),\n      pushNull: this.pushNull.bind(this),\n      pushInfinity: this.pushInfinity.bind(this),\n      pushInfinityNeg: this.pushInfinityNeg.bind(this),\n      pushNaN: this.pushNaN.bind(this),\n      pushNaNNeg: this.pushNaNNeg.bind(this),\n      pushArrayStart: this.pushArrayStart.bind(this),\n      pushArrayStartFixed: this.pushArrayStartFixed.bind(this),\n      pushArrayStartFixed32: this.pushArrayStartFixed32.bind(this),\n      pushArrayStartFixed64: this.pushArrayStartFixed64.bind(this),\n      pushObjectStart: this.pushObjectStart.bind(this),\n      pushObjectStartFixed: this.pushObjectStartFixed.bind(this),\n      pushObjectStartFixed32: this.pushObjectStartFixed32.bind(this),\n      pushObjectStartFixed64: this.pushObjectStartFixed64.bind(this),\n      pushByteString: this.pushByteString.bind(this),\n      pushByteStringStart: this.pushByteStringStart.bind(this),\n      pushUtf8String: this.pushUtf8String.bind(this),\n      pushUtf8StringStart: this.pushUtf8StringStart.bind(this),\n      pushSimpleUnassigned: this.pushSimpleUnassigned.bind(this),\n      pushTagUnassigned: this.pushTagUnassigned.bind(this),\n      pushTagStart: this.pushTagStart.bind(this),\n      pushTagStart4: this.pushTagStart4.bind(this),\n      pushTagStart8: this.pushTagStart8.bind(this),\n      pushBreak: this.pushBreak.bind(this)\n    }, this._heap)\n  }\n\n  get _depth () {\n    return this._parents.length\n  }\n\n  get _currentParent () {\n    return this._parents[this._depth - 1]\n  }\n\n  get _ref () {\n    return this._currentParent.ref\n  }\n\n  // Finish the current parent\n  _closeParent () {\n    var p = this._parents.pop()\n\n    if (p.length > 0) {\n      throw new Error(`Missing ${p.length} elements`)\n    }\n\n    switch (p.type) {\n      case c.PARENT.TAG:\n        this._push(\n          this.createTag(p.ref[0], p.ref[1])\n        )\n        break\n      case c.PARENT.BYTE_STRING:\n        this._push(this.createByteString(p.ref, p.length))\n        break\n      case c.PARENT.UTF8_STRING:\n        this._push(this.createUtf8String(p.ref, p.length))\n        break\n      case c.PARENT.MAP:\n        if (p.values % 2 > 0) {\n          throw new Error('Odd number of elements in the map')\n        }\n        this._push(this.createMap(p.ref, p.length))\n        break\n      case c.PARENT.OBJECT:\n        if (p.values % 2 > 0) {\n          throw new Error('Odd number of elements in the map')\n        }\n        this._push(this.createObject(p.ref, p.length))\n        break\n      case c.PARENT.ARRAY:\n        this._push(this.createArray(p.ref, p.length))\n        break\n      default:\n        break\n    }\n\n    if (this._currentParent && this._currentParent.type === c.PARENT.TAG) {\n      this._dec()\n    }\n  }\n\n  // Reduce the expected length of the current parent by one\n  _dec () {\n    const p = this._currentParent\n    // The current parent does not know the epxected child length\n\n    if (p.length < 0) {\n      return\n    }\n\n    p.length--\n\n    // All children were seen, we can close the current parent\n    if (p.length === 0) {\n      this._closeParent()\n    }\n  }\n\n  // Push any value to the current parent\n  _push (val, hasChildren) {\n    const p = this._currentParent\n    p.values++\n\n    switch (p.type) {\n      case c.PARENT.ARRAY:\n      case c.PARENT.BYTE_STRING:\n      case c.PARENT.UTF8_STRING:\n        if (p.length > -1) {\n          this._ref[this._ref.length - p.length] = val\n        } else {\n          this._ref.push(val)\n        }\n        this._dec()\n        break\n      case c.PARENT.OBJECT:\n        if (p.tmpKey != null) {\n          this._ref[p.tmpKey] = val\n          p.tmpKey = null\n          this._dec()\n        } else {\n          p.tmpKey = val\n\n          if (typeof p.tmpKey !== 'string') {\n            // too bad, convert to a Map\n            p.type = c.PARENT.MAP\n            p.ref = utils.buildMap(p.ref)\n          }\n        }\n        break\n      case c.PARENT.MAP:\n        if (p.tmpKey != null) {\n          this._ref.set(p.tmpKey, val)\n          p.tmpKey = null\n          this._dec()\n        } else {\n          p.tmpKey = val\n        }\n        break\n      case c.PARENT.TAG:\n        this._ref.push(val)\n        if (!hasChildren) {\n          this._dec()\n        }\n        break\n      default:\n        throw new Error('Unknown parent type')\n    }\n  }\n\n  // Create a new parent in the parents list\n  _createParent (obj, type, len) {\n    this._parents[this._depth] = {\n      type: type,\n      length: len,\n      ref: obj,\n      values: 0,\n      tmpKey: null\n    }\n  }\n\n  // Reset all state back to the beginning, also used for initiatlization\n  _reset () {\n    this._res = []\n    this._parents = [{\n      type: c.PARENT.ARRAY,\n      length: -1,\n      ref: this._res,\n      values: 0,\n      tmpKey: null\n    }]\n  }\n\n  // -- Interface to customize deoding behaviour\n  createTag (tagNumber, value) {\n    const typ = this._knownTags[tagNumber]\n\n    if (!typ) {\n      return new Tagged(tagNumber, value)\n    }\n\n    return typ(value)\n  }\n\n  createMap (obj, len) {\n    return obj\n  }\n\n  createObject (obj, len) {\n    return obj\n  }\n\n  createArray (arr, len) {\n    return arr\n  }\n\n  createByteString (raw, len) {\n    return Buffer.concat(raw)\n  }\n\n  createByteStringFromHeap (start, end) {\n    if (start === end) {\n      return Buffer.alloc(0)\n    }\n\n    return Buffer.from(this._heap.slice(start, end))\n  }\n\n  createInt (val) {\n    return val\n  }\n\n  createInt32 (f, g) {\n    return utils.buildInt32(f, g)\n  }\n\n  createInt64 (f1, f2, g1, g2) {\n    return utils.buildInt64(f1, f2, g1, g2)\n  }\n\n  createFloat (val) {\n    return val\n  }\n\n  createFloatSingle (a, b, c, d) {\n    return ieee754.read([a, b, c, d], 0, false, 23, 4)\n  }\n\n  createFloatDouble (a, b, c, d, e, f, g, h) {\n    return ieee754.read([a, b, c, d, e, f, g, h], 0, false, 52, 8)\n  }\n\n  createInt32Neg (f, g) {\n    return -1 - utils.buildInt32(f, g)\n  }\n\n  createInt64Neg (f1, f2, g1, g2) {\n    const f = utils.buildInt32(f1, f2)\n    const g = utils.buildInt32(g1, g2)\n\n    if (f > c.MAX_SAFE_HIGH) {\n      return c.NEG_ONE.minus(new Bignumber(f).times(c.SHIFT32).plus(g))\n    }\n\n    return -1 - ((f * c.SHIFT32) + g)\n  }\n\n  createTrue () {\n    return true\n  }\n\n  createFalse () {\n    return false\n  }\n\n  createNull () {\n    return null\n  }\n\n  createUndefined () {\n    return undefined\n  }\n\n  createInfinity () {\n    return Infinity\n  }\n\n  createInfinityNeg () {\n    return -Infinity\n  }\n\n  createNaN () {\n    return NaN\n  }\n\n  createNaNNeg () {\n    return -NaN\n  }\n\n  createUtf8String (raw, len) {\n    return raw.join('')\n  }\n\n  createUtf8StringFromHeap (start, end) {\n    if (start === end) {\n      return ''\n    }\n\n    return this._buffer.toString('utf8', start, end)\n  }\n\n  createSimpleUnassigned (val) {\n    return new Simple(val)\n  }\n\n  // -- Interface for decoder.asm.js\n\n  pushInt (val) {\n    this._push(this.createInt(val))\n  }\n\n  pushInt32 (f, g) {\n    this._push(this.createInt32(f, g))\n  }\n\n  pushInt64 (f1, f2, g1, g2) {\n    this._push(this.createInt64(f1, f2, g1, g2))\n  }\n\n  pushFloat (val) {\n    this._push(this.createFloat(val))\n  }\n\n  pushFloatSingle (a, b, c, d) {\n    this._push(this.createFloatSingle(a, b, c, d))\n  }\n\n  pushFloatDouble (a, b, c, d, e, f, g, h) {\n    this._push(this.createFloatDouble(a, b, c, d, e, f, g, h))\n  }\n\n  pushInt32Neg (f, g) {\n    this._push(this.createInt32Neg(f, g))\n  }\n\n  pushInt64Neg (f1, f2, g1, g2) {\n    this._push(this.createInt64Neg(f1, f2, g1, g2))\n  }\n\n  pushTrue () {\n    this._push(this.createTrue())\n  }\n\n  pushFalse () {\n    this._push(this.createFalse())\n  }\n\n  pushNull () {\n    this._push(this.createNull())\n  }\n\n  pushUndefined () {\n    this._push(this.createUndefined())\n  }\n\n  pushInfinity () {\n    this._push(this.createInfinity())\n  }\n\n  pushInfinityNeg () {\n    this._push(this.createInfinityNeg())\n  }\n\n  pushNaN () {\n    this._push(this.createNaN())\n  }\n\n  pushNaNNeg () {\n    this._push(this.createNaNNeg())\n  }\n\n  pushArrayStart () {\n    this._createParent([], c.PARENT.ARRAY, -1)\n  }\n\n  pushArrayStartFixed (len) {\n    this._createArrayStartFixed(len)\n  }\n\n  pushArrayStartFixed32 (len1, len2) {\n    const len = utils.buildInt32(len1, len2)\n    this._createArrayStartFixed(len)\n  }\n\n  pushArrayStartFixed64 (len1, len2, len3, len4) {\n    const len = utils.buildInt64(len1, len2, len3, len4)\n    this._createArrayStartFixed(len)\n  }\n\n  pushObjectStart () {\n    this._createObjectStartFixed(-1)\n  }\n\n  pushObjectStartFixed (len) {\n    this._createObjectStartFixed(len)\n  }\n\n  pushObjectStartFixed32 (len1, len2) {\n    const len = utils.buildInt32(len1, len2)\n    this._createObjectStartFixed(len)\n  }\n\n  pushObjectStartFixed64 (len1, len2, len3, len4) {\n    const len = utils.buildInt64(len1, len2, len3, len4)\n    this._createObjectStartFixed(len)\n  }\n\n  pushByteStringStart () {\n    this._parents[this._depth] = {\n      type: c.PARENT.BYTE_STRING,\n      length: -1,\n      ref: [],\n      values: 0,\n      tmpKey: null\n    }\n  }\n\n  pushByteString (start, end) {\n    this._push(this.createByteStringFromHeap(start, end))\n  }\n\n  pushUtf8StringStart () {\n    this._parents[this._depth] = {\n      type: c.PARENT.UTF8_STRING,\n      length: -1,\n      ref: [],\n      values: 0,\n      tmpKey: null\n    }\n  }\n\n  pushUtf8String (start, end) {\n    this._push(this.createUtf8StringFromHeap(start, end))\n  }\n\n  pushSimpleUnassigned (val) {\n    this._push(this.createSimpleUnassigned(val))\n  }\n\n  pushTagStart (tag) {\n    this._parents[this._depth] = {\n      type: c.PARENT.TAG,\n      length: 1,\n      ref: [tag]\n    }\n  }\n\n  pushTagStart4 (f, g) {\n    this.pushTagStart(utils.buildInt32(f, g))\n  }\n\n  pushTagStart8 (f1, f2, g1, g2) {\n    this.pushTagStart(utils.buildInt64(f1, f2, g1, g2))\n  }\n\n  pushTagUnassigned (tagNumber) {\n    this._push(this.createTag(tagNumber))\n  }\n\n  pushBreak () {\n    if (this._currentParent.length > -1) {\n      throw new Error('Unexpected break')\n    }\n\n    this._closeParent()\n  }\n\n  _createObjectStartFixed (len) {\n    if (len === 0) {\n      this._push(this.createObject({}))\n      return\n    }\n\n    this._createParent({}, c.PARENT.OBJECT, len)\n  }\n\n  _createArrayStartFixed (len) {\n    if (len === 0) {\n      this._push(this.createArray([]))\n      return\n    }\n\n    this._createParent(new Array(len), c.PARENT.ARRAY, len)\n  }\n\n  _decode (input) {\n    if (input.byteLength === 0) {\n      throw new Error('Input too short')\n    }\n\n    this._reset()\n    this._heap8.set(input)\n    const code = this.parser.parse(input.byteLength)\n\n    if (this._depth > 1) {\n      while (this._currentParent.length === 0) {\n        this._closeParent()\n      }\n      if (this._depth > 1) {\n        throw new Error('Undeterminated nesting')\n      }\n    }\n\n    if (code > 0) {\n      throw new Error('Failed to parse')\n    }\n\n    if (this._res.length === 0) {\n      throw new Error('No valid result')\n    }\n  }\n\n  // -- Public Interface\n\n  decodeFirst (input) {\n    this._decode(input)\n\n    return this._res[0]\n  }\n\n  decodeAll (input) {\n    this._decode(input)\n\n    return this._res\n  }\n\n  /**\n   * Decode the first cbor object.\n   *\n   * @param {Buffer|string} input\n   * @param {string} [enc='hex'] - Encoding used if a string is passed.\n   * @returns {*}\n   */\n  static decode (input, enc) {\n    if (typeof input === 'string') {\n      input = Buffer.from(input, enc || 'hex')\n    }\n\n    const dec = new Decoder({ size: input.length })\n    return dec.decodeFirst(input)\n  }\n\n  /**\n   * Decode all cbor objects.\n   *\n   * @param {Buffer|string} input\n   * @param {string} [enc='hex'] - Encoding used if a string is passed.\n   * @returns {Array<*>}\n   */\n  static decodeAll (input, enc) {\n    if (typeof input === 'string') {\n      input = Buffer.from(input, enc || 'hex')\n    }\n\n    const dec = new Decoder({ size: input.length })\n    return dec.decodeAll(input)\n  }\n}\n\nDecoder.decodeFirst = Decoder.decode\n\nmodule.exports = Decoder\n",";(function (globalObject) {\r\n  'use strict';\r\n\r\n/*\r\n *      bignumber.js v9.0.1\r\n *      A JavaScript library for arbitrary-precision arithmetic.\r\n *      https://github.com/MikeMcl/bignumber.js\r\n *      Copyright (c) 2020 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *      MIT Licensed.\r\n *\r\n *      BigNumber.prototype methods     |  BigNumber methods\r\n *                                      |\r\n *      absoluteValue            abs    |  clone\r\n *      comparedTo                      |  config               set\r\n *      decimalPlaces            dp     |      DECIMAL_PLACES\r\n *      dividedBy                div    |      ROUNDING_MODE\r\n *      dividedToIntegerBy       idiv   |      EXPONENTIAL_AT\r\n *      exponentiatedBy          pow    |      RANGE\r\n *      integerValue                    |      CRYPTO\r\n *      isEqualTo                eq     |      MODULO_MODE\r\n *      isFinite                        |      POW_PRECISION\r\n *      isGreaterThan            gt     |      FORMAT\r\n *      isGreaterThanOrEqualTo   gte    |      ALPHABET\r\n *      isInteger                       |  isBigNumber\r\n *      isLessThan               lt     |  maximum              max\r\n *      isLessThanOrEqualTo      lte    |  minimum              min\r\n *      isNaN                           |  random\r\n *      isNegative                      |  sum\r\n *      isPositive                      |\r\n *      isZero                          |\r\n *      minus                           |\r\n *      modulo                   mod    |\r\n *      multipliedBy             times  |\r\n *      negated                         |\r\n *      plus                            |\r\n *      precision                sd     |\r\n *      shiftedBy                       |\r\n *      squareRoot               sqrt   |\r\n *      toExponential                   |\r\n *      toFixed                         |\r\n *      toFormat                        |\r\n *      toFraction                      |\r\n *      toJSON                          |\r\n *      toNumber                        |\r\n *      toPrecision                     |\r\n *      toString                        |\r\n *      valueOf                         |\r\n *\r\n */\r\n\r\n\r\n  var BigNumber,\r\n    isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n    mathceil = Math.ceil,\r\n    mathfloor = Math.floor,\r\n\r\n    bignumberError = '[BigNumber Error] ',\r\n    tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n    BASE = 1e14,\r\n    LOG_BASE = 14,\r\n    MAX_SAFE_INTEGER = 0x1fffffffffffff,         // 2^53 - 1\r\n    // MAX_INT32 = 0x7fffffff,                   // 2^31 - 1\r\n    POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n    SQRT_BASE = 1e7,\r\n\r\n    // EDITABLE\r\n    // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n    // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n    MAX = 1E9;                                   // 0 to MAX_INT32\r\n\r\n\r\n  /*\r\n   * Create and return a BigNumber constructor.\r\n   */\r\n  function clone(configObject) {\r\n    var div, convertBase, parseNumeric,\r\n      P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n      ONE = new BigNumber(1),\r\n\r\n\r\n      //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n      // The default values below must be integers within the inclusive ranges stated.\r\n      // The values can also be changed at run-time using BigNumber.set.\r\n\r\n      // The maximum number of decimal places for operations involving division.\r\n      DECIMAL_PLACES = 20,                     // 0 to MAX\r\n\r\n      // The rounding mode used when rounding to the above decimal places, and when using\r\n      // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n      // UP         0 Away from zero.\r\n      // DOWN       1 Towards zero.\r\n      // CEIL       2 Towards +Infinity.\r\n      // FLOOR      3 Towards -Infinity.\r\n      // HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n      // HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n      // HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n      // HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n      // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n      ROUNDING_MODE = 4,                       // 0 to 8\r\n\r\n      // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n      // The exponent value at and beneath which toString returns exponential notation.\r\n      // Number type: -7\r\n      TO_EXP_NEG = -7,                         // 0 to -MAX\r\n\r\n      // The exponent value at and above which toString returns exponential notation.\r\n      // Number type: 21\r\n      TO_EXP_POS = 21,                         // 0 to MAX\r\n\r\n      // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n      // The minimum exponent value, beneath which underflow to zero occurs.\r\n      // Number type: -324  (5e-324)\r\n      MIN_EXP = -1e7,                          // -1 to -MAX\r\n\r\n      // The maximum exponent value, above which overflow to Infinity occurs.\r\n      // Number type:  308  (1.7976931348623157e+308)\r\n      // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n      MAX_EXP = 1e7,                           // 1 to MAX\r\n\r\n      // Whether to use cryptographically-secure random number generation, if available.\r\n      CRYPTO = false,                          // true or false\r\n\r\n      // The modulo mode used when calculating the modulus: a mod n.\r\n      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n      // The remainder (r) is calculated as: r = a - n * q.\r\n      //\r\n      // UP        0 The remainder is positive if the dividend is negative, else is negative.\r\n      // DOWN      1 The remainder has the same sign as the dividend.\r\n      //             This modulo mode is commonly known as 'truncated division' and is\r\n      //             equivalent to (a % n) in JavaScript.\r\n      // FLOOR     3 The remainder has the same sign as the divisor (Python %).\r\n      // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n      // EUCLID    9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n      //             The remainder is always positive.\r\n      //\r\n      // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n      // modes are commonly used for the modulus operation.\r\n      // Although the other rounding modes can also be used, they may not give useful results.\r\n      MODULO_MODE = 1,                         // 0 to 9\r\n\r\n      // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n      // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n      POW_PRECISION = 0,                    // 0 to MAX\r\n\r\n      // The format specification used by the BigNumber.prototype.toFormat method.\r\n      FORMAT = {\r\n        prefix: '',\r\n        groupSize: 3,\r\n        secondaryGroupSize: 0,\r\n        groupSeparator: ',',\r\n        decimalSeparator: '.',\r\n        fractionGroupSize: 0,\r\n        fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n        suffix: ''\r\n      },\r\n\r\n      // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n      // '-', '.', whitespace, or repeated character.\r\n      // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n      ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz';\r\n\r\n\r\n    //------------------------------------------------------------------------------------------\r\n\r\n\r\n    // CONSTRUCTOR\r\n\r\n\r\n    /*\r\n     * The BigNumber constructor and exported function.\r\n     * Create and return a new instance of a BigNumber object.\r\n     *\r\n     * v {number|string|BigNumber} A numeric value.\r\n     * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n     */\r\n    function BigNumber(v, b) {\r\n      var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n        x = this;\r\n\r\n      // Enable constructor call without `new`.\r\n      if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n      if (b == null) {\r\n\r\n        if (v && v._isBigNumber === true) {\r\n          x.s = v.s;\r\n\r\n          if (!v.c || v.e > MAX_EXP) {\r\n            x.c = x.e = null;\r\n          } else if (v.e < MIN_EXP) {\r\n            x.c = [x.e = 0];\r\n          } else {\r\n            x.e = v.e;\r\n            x.c = v.c.slice();\r\n          }\r\n\r\n          return;\r\n        }\r\n\r\n        if ((isNum = typeof v == 'number') && v * 0 == 0) {\r\n\r\n          // Use `1 / n` to handle minus zero also.\r\n          x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n          // Fast path for integers, where n < 2147483648 (2**31).\r\n          if (v === ~~v) {\r\n            for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n            if (e > MAX_EXP) {\r\n              x.c = x.e = null;\r\n            } else {\r\n              x.e = e;\r\n              x.c = [v];\r\n            }\r\n\r\n            return;\r\n          }\r\n\r\n          str = String(v);\r\n        } else {\r\n\r\n          if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n          x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n        // Exponential form?\r\n        if ((i = str.search(/e/i)) > 0) {\r\n\r\n          // Determine exponent.\r\n          if (e < 0) e = i;\r\n          e += +str.slice(i + 1);\r\n          str = str.substring(0, i);\r\n        } else if (e < 0) {\r\n\r\n          // Integer.\r\n          e = str.length;\r\n        }\r\n\r\n      } else {\r\n\r\n        // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n        intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n        // Allow exponential notation to be used with base 10 argument, while\r\n        // also rounding to DECIMAL_PLACES as with other bases.\r\n        if (b == 10) {\r\n          x = new BigNumber(v);\r\n          return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n        }\r\n\r\n        str = String(v);\r\n\r\n        if (isNum = typeof v == 'number') {\r\n\r\n          // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n          if (v * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n          x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n          // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n          if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n            throw Error\r\n             (tooManyDigits + v);\r\n          }\r\n        } else {\r\n          x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n        }\r\n\r\n        alphabet = ALPHABET.slice(0, b);\r\n        e = i = 0;\r\n\r\n        // Check that str is a valid base b number.\r\n        // Don't use RegExp, so alphabet can contain special characters.\r\n        for (len = str.length; i < len; i++) {\r\n          if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n            if (c == '.') {\r\n\r\n              // If '.' is not the first character and it has not be found before.\r\n              if (i > e) {\r\n                e = len;\r\n                continue;\r\n              }\r\n            } else if (!caseChanged) {\r\n\r\n              // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n              if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n                  str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n                caseChanged = true;\r\n                i = -1;\r\n                e = 0;\r\n                continue;\r\n              }\r\n            }\r\n\r\n            return parseNumeric(x, String(v), isNum, b);\r\n          }\r\n        }\r\n\r\n        // Prevent later check for length on converted number.\r\n        isNum = false;\r\n        str = convertBase(str, b, 10, x.s);\r\n\r\n        // Decimal point?\r\n        if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n        else e = str.length;\r\n      }\r\n\r\n      // Determine leading zeros.\r\n      for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n      // Determine trailing zeros.\r\n      for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n      if (str = str.slice(i, ++len)) {\r\n        len -= i;\r\n\r\n        // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n        if (isNum && BigNumber.DEBUG &&\r\n          len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {\r\n            throw Error\r\n             (tooManyDigits + (x.s * v));\r\n        }\r\n\r\n         // Overflow?\r\n        if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n          // Infinity.\r\n          x.c = x.e = null;\r\n\r\n        // Underflow?\r\n        } else if (e < MIN_EXP) {\r\n\r\n          // Zero.\r\n          x.c = [x.e = 0];\r\n        } else {\r\n          x.e = e;\r\n          x.c = [];\r\n\r\n          // Transform base\r\n\r\n          // e is the base 10 exponent.\r\n          // i is where to slice str to get the first element of the coefficient array.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (e < 0) i += LOG_BASE;  // i < 1\r\n\r\n          if (i < len) {\r\n            if (i) x.c.push(+str.slice(0, i));\r\n\r\n            for (len -= LOG_BASE; i < len;) {\r\n              x.c.push(+str.slice(i, i += LOG_BASE));\r\n            }\r\n\r\n            i = LOG_BASE - (str = str.slice(i)).length;\r\n          } else {\r\n            i -= len;\r\n          }\r\n\r\n          for (; i--; str += '0');\r\n          x.c.push(+str);\r\n        }\r\n      } else {\r\n\r\n        // Zero.\r\n        x.c = [x.e = 0];\r\n      }\r\n    }\r\n\r\n\r\n    // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n    BigNumber.clone = clone;\r\n\r\n    BigNumber.ROUND_UP = 0;\r\n    BigNumber.ROUND_DOWN = 1;\r\n    BigNumber.ROUND_CEIL = 2;\r\n    BigNumber.ROUND_FLOOR = 3;\r\n    BigNumber.ROUND_HALF_UP = 4;\r\n    BigNumber.ROUND_HALF_DOWN = 5;\r\n    BigNumber.ROUND_HALF_EVEN = 6;\r\n    BigNumber.ROUND_HALF_CEIL = 7;\r\n    BigNumber.ROUND_HALF_FLOOR = 8;\r\n    BigNumber.EUCLID = 9;\r\n\r\n\r\n    /*\r\n     * Configure infrequently-changing library-wide settings.\r\n     *\r\n     * Accept an object with the following optional properties (if the value of a property is\r\n     * a number, it must be an integer within the inclusive range stated):\r\n     *\r\n     *   DECIMAL_PLACES   {number}           0 to MAX\r\n     *   ROUNDING_MODE    {number}           0 to 8\r\n     *   EXPONENTIAL_AT   {number|number[]}  -MAX to MAX  or  [-MAX to 0, 0 to MAX]\r\n     *   RANGE            {number|number[]}  -MAX to MAX (not zero)  or  [-MAX to -1, 1 to MAX]\r\n     *   CRYPTO           {boolean}          true or false\r\n     *   MODULO_MODE      {number}           0 to 9\r\n     *   POW_PRECISION       {number}           0 to MAX\r\n     *   ALPHABET         {string}           A string of two or more unique characters which does\r\n     *                                       not contain '.'.\r\n     *   FORMAT           {object}           An object with some of the following properties:\r\n     *     prefix                 {string}\r\n     *     groupSize              {number}\r\n     *     secondaryGroupSize     {number}\r\n     *     groupSeparator         {string}\r\n     *     decimalSeparator       {string}\r\n     *     fractionGroupSize      {number}\r\n     *     fractionGroupSeparator {string}\r\n     *     suffix                 {string}\r\n     *\r\n     * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n     *\r\n     * E.g.\r\n     * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n     *\r\n     * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n     *\r\n     * Return an object with the properties current values.\r\n     */\r\n    BigNumber.config = BigNumber.set = function (obj) {\r\n      var p, v;\r\n\r\n      if (obj != null) {\r\n\r\n        if (typeof obj == 'object') {\r\n\r\n          // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            DECIMAL_PLACES = v;\r\n          }\r\n\r\n          // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n          // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 8, p);\r\n            ROUNDING_MODE = v;\r\n          }\r\n\r\n          // EXPONENTIAL_AT {number|number[]}\r\n          // Integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n          // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n            v = obj[p];\r\n            if (v && v.pop) {\r\n              intCheck(v[0], -MAX, 0, p);\r\n              intCheck(v[1], 0, MAX, p);\r\n              TO_EXP_NEG = v[0];\r\n              TO_EXP_POS = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n            }\r\n          }\r\n\r\n          // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n          // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n          // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n          if (obj.hasOwnProperty(p = 'RANGE')) {\r\n            v = obj[p];\r\n            if (v && v.pop) {\r\n              intCheck(v[0], -MAX, -1, p);\r\n              intCheck(v[1], 1, MAX, p);\r\n              MIN_EXP = v[0];\r\n              MAX_EXP = v[1];\r\n            } else {\r\n              intCheck(v, -MAX, MAX, p);\r\n              if (v) {\r\n                MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n              } else {\r\n                throw Error\r\n                 (bignumberError + p + ' cannot be zero: ' + v);\r\n              }\r\n            }\r\n          }\r\n\r\n          // CRYPTO {boolean} true or false.\r\n          // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n          // '[BigNumber Error] crypto unavailable'\r\n          if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n            v = obj[p];\r\n            if (v === !!v) {\r\n              if (v) {\r\n                if (typeof crypto != 'undefined' && crypto &&\r\n                 (crypto.getRandomValues || crypto.randomBytes)) {\r\n                  CRYPTO = v;\r\n                } else {\r\n                  CRYPTO = !v;\r\n                  throw Error\r\n                   (bignumberError + 'crypto unavailable');\r\n                }\r\n              } else {\r\n                CRYPTO = v;\r\n              }\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' not true or false: ' + v);\r\n            }\r\n          }\r\n\r\n          // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n          // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, 9, p);\r\n            MODULO_MODE = v;\r\n          }\r\n\r\n          // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n          // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n          if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n            v = obj[p];\r\n            intCheck(v, 0, MAX, p);\r\n            POW_PRECISION = v;\r\n          }\r\n\r\n          // FORMAT {object}\r\n          // '[BigNumber Error] FORMAT not an object: {v}'\r\n          if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n            v = obj[p];\r\n            if (typeof v == 'object') FORMAT = v;\r\n            else throw Error\r\n             (bignumberError + p + ' not an object: ' + v);\r\n          }\r\n\r\n          // ALPHABET {string}\r\n          // '[BigNumber Error] ALPHABET invalid: {v}'\r\n          if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n            v = obj[p];\r\n\r\n            // Disallow if less than two characters,\r\n            // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n            if (typeof v == 'string' && !/^.?$|[+\\-.\\s]|(.).*\\1/.test(v)) {\r\n              ALPHABET = v;\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' invalid: ' + v);\r\n            }\r\n          }\r\n\r\n        } else {\r\n\r\n          // '[BigNumber Error] Object expected: {v}'\r\n          throw Error\r\n           (bignumberError + 'Object expected: ' + obj);\r\n        }\r\n      }\r\n\r\n      return {\r\n        DECIMAL_PLACES: DECIMAL_PLACES,\r\n        ROUNDING_MODE: ROUNDING_MODE,\r\n        EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n        RANGE: [MIN_EXP, MAX_EXP],\r\n        CRYPTO: CRYPTO,\r\n        MODULO_MODE: MODULO_MODE,\r\n        POW_PRECISION: POW_PRECISION,\r\n        FORMAT: FORMAT,\r\n        ALPHABET: ALPHABET\r\n      };\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if v is a BigNumber instance, otherwise return false.\r\n     *\r\n     * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n     *\r\n     * v {any}\r\n     *\r\n     * '[BigNumber Error] Invalid BigNumber: {v}'\r\n     */\r\n    BigNumber.isBigNumber = function (v) {\r\n      if (!v || v._isBigNumber !== true) return false;\r\n      if (!BigNumber.DEBUG) return true;\r\n\r\n      var i, n,\r\n        c = v.c,\r\n        e = v.e,\r\n        s = v.s;\r\n\r\n      out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n        if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n          // If the first element is zero, the BigNumber value must be zero.\r\n          if (c[0] === 0) {\r\n            if (e === 0 && c.length === 1) return true;\r\n            break out;\r\n          }\r\n\r\n          // Calculate number of digits that c[0] should have, based on the exponent.\r\n          i = (e + 1) % LOG_BASE;\r\n          if (i < 1) i += LOG_BASE;\r\n\r\n          // Calculate number of digits of c[0].\r\n          //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n          if (String(c[0]).length == i) {\r\n\r\n            for (i = 0; i < c.length; i++) {\r\n              n = c[i];\r\n              if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;\r\n            }\r\n\r\n            // Last element cannot be zero, unless it is the only element.\r\n            if (n !== 0) return true;\r\n          }\r\n        }\r\n\r\n      // Infinity/NaN\r\n      } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {\r\n        return true;\r\n      }\r\n\r\n      throw Error\r\n        (bignumberError + 'Invalid BigNumber: ' + v);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the maximum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.maximum = BigNumber.max = function () {\r\n      return maxOrMin(arguments, P.lt);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the minimum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.minimum = BigNumber.min = function () {\r\n      return maxOrMin(arguments, P.gt);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n     * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n     * zeros are produced).\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n     * '[BigNumber Error] crypto unavailable'\r\n     */\r\n    BigNumber.random = (function () {\r\n      var pow2_53 = 0x20000000000000;\r\n\r\n      // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n      // Check if Math.random() produces more than 32 bits of randomness.\r\n      // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n      // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n      var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n       ? function () { return mathfloor(Math.random() * pow2_53); }\r\n       : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n         (Math.random() * 0x800000 | 0); };\r\n\r\n      return function (dp) {\r\n        var a, b, e, k, v,\r\n          i = 0,\r\n          c = [],\r\n          rand = new BigNumber(ONE);\r\n\r\n        if (dp == null) dp = DECIMAL_PLACES;\r\n        else intCheck(dp, 0, MAX);\r\n\r\n        k = mathceil(dp / LOG_BASE);\r\n\r\n        if (CRYPTO) {\r\n\r\n          // Browsers supporting crypto.getRandomValues.\r\n          if (crypto.getRandomValues) {\r\n\r\n            a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n            for (; i < k;) {\r\n\r\n              // 53 bits:\r\n              // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n              // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n              // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n              //                                     11111 11111111 11111111\r\n              // 0x20000 is 2^21.\r\n              v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n              // Rejection sampling:\r\n              // 0 <= v < 9007199254740992\r\n              // Probability that v >= 9e15, is\r\n              // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n              if (v >= 9e15) {\r\n                b = crypto.getRandomValues(new Uint32Array(2));\r\n                a[i] = b[0];\r\n                a[i + 1] = b[1];\r\n              } else {\r\n\r\n                // 0 <= v <= 8999999999999999\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 2;\r\n              }\r\n            }\r\n            i = k / 2;\r\n\r\n          // Node.js supporting crypto.randomBytes.\r\n          } else if (crypto.randomBytes) {\r\n\r\n            // buffer\r\n            a = crypto.randomBytes(k *= 7);\r\n\r\n            for (; i < k;) {\r\n\r\n              // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n              // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n              // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n              // 0 <= v < 9007199254740992\r\n              v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n                 (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n                 (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n              if (v >= 9e15) {\r\n                crypto.randomBytes(7).copy(a, i);\r\n              } else {\r\n\r\n                // 0 <= (v % 1e14) <= 99999999999999\r\n                c.push(v % 1e14);\r\n                i += 7;\r\n              }\r\n            }\r\n            i = k / 7;\r\n          } else {\r\n            CRYPTO = false;\r\n            throw Error\r\n             (bignumberError + 'crypto unavailable');\r\n          }\r\n        }\r\n\r\n        // Use Math.random.\r\n        if (!CRYPTO) {\r\n\r\n          for (; i < k;) {\r\n            v = random53bitInt();\r\n            if (v < 9e15) c[i++] = v % 1e14;\r\n          }\r\n        }\r\n\r\n        k = c[--i];\r\n        dp %= LOG_BASE;\r\n\r\n        // Convert trailing digits to zeros according to dp.\r\n        if (k && dp) {\r\n          v = POWS_TEN[LOG_BASE - dp];\r\n          c[i] = mathfloor(k / v) * v;\r\n        }\r\n\r\n        // Remove trailing elements which are zero.\r\n        for (; c[i] === 0; c.pop(), i--);\r\n\r\n        // Zero?\r\n        if (i < 0) {\r\n          c = [e = 0];\r\n        } else {\r\n\r\n          // Remove leading elements which are zero and adjust exponent accordingly.\r\n          for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n          // Count the digits of the first element of c to determine leading zeros, and...\r\n          for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n          // adjust the exponent accordingly.\r\n          if (i < LOG_BASE) e -= LOG_BASE - i;\r\n        }\r\n\r\n        rand.e = e;\r\n        rand.c = c;\r\n        return rand;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the sum of the arguments.\r\n     *\r\n     * arguments {number|string|BigNumber}\r\n     */\r\n    BigNumber.sum = function () {\r\n      var i = 1,\r\n        args = arguments,\r\n        sum = new BigNumber(args[0]);\r\n      for (; i < args.length;) sum = sum.plus(args[i++]);\r\n      return sum;\r\n    };\r\n\r\n\r\n    // PRIVATE FUNCTIONS\r\n\r\n\r\n    // Called by BigNumber and BigNumber.prototype.toString.\r\n    convertBase = (function () {\r\n      var decimal = '0123456789';\r\n\r\n      /*\r\n       * Convert string of baseIn to an array of numbers of baseOut.\r\n       * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n       * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n       */\r\n      function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n        var j,\r\n          arr = [0],\r\n          arrL,\r\n          i = 0,\r\n          len = str.length;\r\n\r\n        for (; i < len;) {\r\n          for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n          arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n          for (j = 0; j < arr.length; j++) {\r\n\r\n            if (arr[j] > baseOut - 1) {\r\n              if (arr[j + 1] == null) arr[j + 1] = 0;\r\n              arr[j + 1] += arr[j] / baseOut | 0;\r\n              arr[j] %= baseOut;\r\n            }\r\n          }\r\n        }\r\n\r\n        return arr.reverse();\r\n      }\r\n\r\n      // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n      // If the caller is toString, we are converting from base 10 to baseOut.\r\n      // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n      return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n        var alphabet, d, e, k, r, x, xc, y,\r\n          i = str.indexOf('.'),\r\n          dp = DECIMAL_PLACES,\r\n          rm = ROUNDING_MODE;\r\n\r\n        // Non-integer.\r\n        if (i >= 0) {\r\n          k = POW_PRECISION;\r\n\r\n          // Unlimited precision.\r\n          POW_PRECISION = 0;\r\n          str = str.replace('.', '');\r\n          y = new BigNumber(baseIn);\r\n          x = y.pow(str.length - i);\r\n          POW_PRECISION = k;\r\n\r\n          // Convert str as if an integer, then restore the fraction part by dividing the\r\n          // result by its base raised to a power.\r\n\r\n          y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n           10, baseOut, decimal);\r\n          y.e = y.c.length;\r\n        }\r\n\r\n        // Convert the number as integer.\r\n\r\n        xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n         ? (alphabet = ALPHABET, decimal)\r\n         : (alphabet = decimal, ALPHABET));\r\n\r\n        // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n        e = k = xc.length;\r\n\r\n        // Remove trailing zeros.\r\n        for (; xc[--k] == 0; xc.pop());\r\n\r\n        // Zero?\r\n        if (!xc[0]) return alphabet.charAt(0);\r\n\r\n        // Does str represent an integer? If so, no need for the division.\r\n        if (i < 0) {\r\n          --e;\r\n        } else {\r\n          x.c = xc;\r\n          x.e = e;\r\n\r\n          // The sign is needed for correct rounding.\r\n          x.s = sign;\r\n          x = div(x, y, dp, rm, baseOut);\r\n          xc = x.c;\r\n          r = x.r;\r\n          e = x.e;\r\n        }\r\n\r\n        // xc now represents str converted to baseOut.\r\n\r\n        // THe index of the rounding digit.\r\n        d = e + dp + 1;\r\n\r\n        // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n        i = xc[d];\r\n\r\n        // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n        k = baseOut / 2;\r\n        r = r || d < 0 || xc[d + 1] != null;\r\n\r\n        r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n              : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n               rm == (x.s < 0 ? 8 : 7));\r\n\r\n        // If the index of the rounding digit is not greater than zero, or xc represents\r\n        // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n        // such as 0.00001.\r\n        if (d < 1 || !xc[0]) {\r\n\r\n          // 1^-dp or 0\r\n          str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n        } else {\r\n\r\n          // Truncate xc to the required number of decimal places.\r\n          xc.length = d;\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            // Rounding up may mean the previous digit has to be rounded up and so on.\r\n            for (--baseOut; ++xc[--d] > baseOut;) {\r\n              xc[d] = 0;\r\n\r\n              if (!d) {\r\n                ++e;\r\n                xc = [1].concat(xc);\r\n              }\r\n            }\r\n          }\r\n\r\n          // Determine trailing zeros.\r\n          for (k = xc.length; !xc[--k];);\r\n\r\n          // E.g. [4, 11, 15] becomes 4bf.\r\n          for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n          // Add leading zeros, decimal point and trailing zeros as required.\r\n          str = toFixedPoint(str, e, alphabet.charAt(0));\r\n        }\r\n\r\n        // The caller will add the sign.\r\n        return str;\r\n      };\r\n    })();\r\n\r\n\r\n    // Perform division in the specified base. Called by div and convertBase.\r\n    div = (function () {\r\n\r\n      // Assume non-zero x and k.\r\n      function multiply(x, k, base) {\r\n        var m, temp, xlo, xhi,\r\n          carry = 0,\r\n          i = x.length,\r\n          klo = k % SQRT_BASE,\r\n          khi = k / SQRT_BASE | 0;\r\n\r\n        for (x = x.slice(); i--;) {\r\n          xlo = x[i] % SQRT_BASE;\r\n          xhi = x[i] / SQRT_BASE | 0;\r\n          m = khi * xlo + xhi * klo;\r\n          temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n          carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n          x[i] = temp % base;\r\n        }\r\n\r\n        if (carry) x = [carry].concat(x);\r\n\r\n        return x;\r\n      }\r\n\r\n      function compare(a, b, aL, bL) {\r\n        var i, cmp;\r\n\r\n        if (aL != bL) {\r\n          cmp = aL > bL ? 1 : -1;\r\n        } else {\r\n\r\n          for (i = cmp = 0; i < aL; i++) {\r\n\r\n            if (a[i] != b[i]) {\r\n              cmp = a[i] > b[i] ? 1 : -1;\r\n              break;\r\n            }\r\n          }\r\n        }\r\n\r\n        return cmp;\r\n      }\r\n\r\n      function subtract(a, b, aL, base) {\r\n        var i = 0;\r\n\r\n        // Subtract b from a.\r\n        for (; aL--;) {\r\n          a[aL] -= i;\r\n          i = a[aL] < b[aL] ? 1 : 0;\r\n          a[aL] = i * base + a[aL] - b[aL];\r\n        }\r\n\r\n        // Remove leading zeros.\r\n        for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n      }\r\n\r\n      // x: dividend, y: divisor.\r\n      return function (x, y, dp, rm, base) {\r\n        var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n          yL, yz,\r\n          s = x.s == y.s ? 1 : -1,\r\n          xc = x.c,\r\n          yc = y.c;\r\n\r\n        // Either NaN, Infinity or 0?\r\n        if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n          return new BigNumber(\r\n\r\n           // Return NaN if either NaN, or both Infinity or 0.\r\n           !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n            // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n            xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n         );\r\n        }\r\n\r\n        q = new BigNumber(s);\r\n        qc = q.c = [];\r\n        e = x.e - y.e;\r\n        s = dp + e + 1;\r\n\r\n        if (!base) {\r\n          base = BASE;\r\n          e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n          s = s / LOG_BASE | 0;\r\n        }\r\n\r\n        // Result exponent may be one less then the current value of e.\r\n        // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n        for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n        if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n        if (s < 0) {\r\n          qc.push(1);\r\n          more = true;\r\n        } else {\r\n          xL = xc.length;\r\n          yL = yc.length;\r\n          i = 0;\r\n          s += 2;\r\n\r\n          // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n          n = mathfloor(base / (yc[0] + 1));\r\n\r\n          // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n          // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n          if (n > 1) {\r\n            yc = multiply(yc, n, base);\r\n            xc = multiply(xc, n, base);\r\n            yL = yc.length;\r\n            xL = xc.length;\r\n          }\r\n\r\n          xi = yL;\r\n          rem = xc.slice(0, yL);\r\n          remL = rem.length;\r\n\r\n          // Add zeros to make remainder as long as divisor.\r\n          for (; remL < yL; rem[remL++] = 0);\r\n          yz = yc.slice();\r\n          yz = [0].concat(yz);\r\n          yc0 = yc[0];\r\n          if (yc[1] >= base / 2) yc0++;\r\n          // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n          // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n          do {\r\n            n = 0;\r\n\r\n            // Compare divisor and remainder.\r\n            cmp = compare(yc, rem, yL, remL);\r\n\r\n            // If divisor < remainder.\r\n            if (cmp < 0) {\r\n\r\n              // Calculate trial digit, n.\r\n\r\n              rem0 = rem[0];\r\n              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n              // n is how many times the divisor goes into the current remainder.\r\n              n = mathfloor(rem0 / yc0);\r\n\r\n              //  Algorithm:\r\n              //  product = divisor multiplied by trial digit (n).\r\n              //  Compare product and remainder.\r\n              //  If product is greater than remainder:\r\n              //    Subtract divisor from product, decrement trial digit.\r\n              //  Subtract product from remainder.\r\n              //  If product was less than remainder at the last compare:\r\n              //    Compare new remainder and divisor.\r\n              //    If remainder is greater than divisor:\r\n              //      Subtract divisor from remainder, increment trial digit.\r\n\r\n              if (n > 1) {\r\n\r\n                // n may be > base only when base is 3.\r\n                if (n >= base) n = base - 1;\r\n\r\n                // product = divisor * trial digit.\r\n                prod = multiply(yc, n, base);\r\n                prodL = prod.length;\r\n                remL = rem.length;\r\n\r\n                // Compare product and remainder.\r\n                // If product > remainder then trial digit n too high.\r\n                // n is 1 too high about 5% of the time, and is not known to have\r\n                // ever been more than 1 too high.\r\n                while (compare(prod, rem, prodL, remL) == 1) {\r\n                  n--;\r\n\r\n                  // Subtract divisor from product.\r\n                  subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n                  prodL = prod.length;\r\n                  cmp = 1;\r\n                }\r\n              } else {\r\n\r\n                // n is 0 or 1, cmp is -1.\r\n                // If n is 0, there is no need to compare yc and rem again below,\r\n                // so change cmp to 1 to avoid it.\r\n                // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n                if (n == 0) {\r\n\r\n                  // divisor < remainder, so n must be at least 1.\r\n                  cmp = n = 1;\r\n                }\r\n\r\n                // product = divisor\r\n                prod = yc.slice();\r\n                prodL = prod.length;\r\n              }\r\n\r\n              if (prodL < remL) prod = [0].concat(prod);\r\n\r\n              // Subtract product from remainder.\r\n              subtract(rem, prod, remL, base);\r\n              remL = rem.length;\r\n\r\n               // If product was < remainder.\r\n              if (cmp == -1) {\r\n\r\n                // Compare divisor and new remainder.\r\n                // If divisor < new remainder, subtract divisor from remainder.\r\n                // Trial digit n too low.\r\n                // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n                while (compare(yc, rem, yL, remL) < 1) {\r\n                  n++;\r\n\r\n                  // Subtract divisor from remainder.\r\n                  subtract(rem, yL < remL ? yz : yc, remL, base);\r\n                  remL = rem.length;\r\n                }\r\n              }\r\n            } else if (cmp === 0) {\r\n              n++;\r\n              rem = [0];\r\n            } // else cmp === 1 and n will be 0\r\n\r\n            // Add the next digit, n, to the result array.\r\n            qc[i++] = n;\r\n\r\n            // Update the remainder.\r\n            if (rem[0]) {\r\n              rem[remL++] = xc[xi] || 0;\r\n            } else {\r\n              rem = [xc[xi]];\r\n              remL = 1;\r\n            }\r\n          } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n          more = rem[0] != null;\r\n\r\n          // Leading zero?\r\n          if (!qc[0]) qc.splice(0, 1);\r\n        }\r\n\r\n        if (base == BASE) {\r\n\r\n          // To calculate q.e, first get the number of digits of qc[0].\r\n          for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n          round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n        // Caller is convertBase.\r\n        } else {\r\n          q.e = e;\r\n          q.r = +more;\r\n        }\r\n\r\n        return q;\r\n      };\r\n    })();\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n     * notation rounded to the specified decimal places or significant digits.\r\n     *\r\n     * n: a BigNumber.\r\n     * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n     * rm: the rounding mode.\r\n     * id: 1 (toExponential) or 2 (toPrecision).\r\n     */\r\n    function format(n, i, rm, id) {\r\n      var c0, e, ne, len, str;\r\n\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n\r\n      if (!n.c) return n.toString();\r\n\r\n      c0 = n.c[0];\r\n      ne = n.e;\r\n\r\n      if (i == null) {\r\n        str = coeffToString(n.c);\r\n        str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)\r\n         ? toExponential(str, ne)\r\n         : toFixedPoint(str, ne, '0');\r\n      } else {\r\n        n = round(new BigNumber(n), i, rm);\r\n\r\n        // n.e may have changed if the value was rounded up.\r\n        e = n.e;\r\n\r\n        str = coeffToString(n.c);\r\n        len = str.length;\r\n\r\n        // toPrecision returns exponential notation if the number of significant digits\r\n        // specified is less than the number of digits necessary to represent the integer\r\n        // part of the value in fixed-point notation.\r\n\r\n        // Exponential notation.\r\n        if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n          // Append zeros?\r\n          for (; len < i; str += '0', len++);\r\n          str = toExponential(str, e);\r\n\r\n        // Fixed-point notation.\r\n        } else {\r\n          i -= ne;\r\n          str = toFixedPoint(str, e, '0');\r\n\r\n          // Append zeros?\r\n          if (e + 1 > len) {\r\n            if (--i > 0) for (str += '.'; i--; str += '0');\r\n          } else {\r\n            i += e - len;\r\n            if (i > 0) {\r\n              if (e + 1 == len) str += '.';\r\n              for (; i--; str += '0');\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return n.s < 0 && c0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // Handle BigNumber.max and BigNumber.min.\r\n    function maxOrMin(args, method) {\r\n      var n,\r\n        i = 1,\r\n        m = new BigNumber(args[0]);\r\n\r\n      for (; i < args.length; i++) {\r\n        n = new BigNumber(args[i]);\r\n\r\n        // If any number is NaN, return NaN.\r\n        if (!n.s) {\r\n          m = n;\r\n          break;\r\n        } else if (method.call(m, n)) {\r\n          m = n;\r\n        }\r\n      }\r\n\r\n      return m;\r\n    }\r\n\r\n\r\n    /*\r\n     * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n     * Called by minus, plus and times.\r\n     */\r\n    function normalise(n, c, e) {\r\n      var i = 1,\r\n        j = c.length;\r\n\r\n       // Remove trailing zeros.\r\n      for (; !c[--j]; c.pop());\r\n\r\n      // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n      for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n      // Overflow?\r\n      if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n        // Infinity.\r\n        n.c = n.e = null;\r\n\r\n      // Underflow?\r\n      } else if (e < MIN_EXP) {\r\n\r\n        // Zero.\r\n        n.c = [n.e = 0];\r\n      } else {\r\n        n.e = e;\r\n        n.c = c;\r\n      }\r\n\r\n      return n;\r\n    }\r\n\r\n\r\n    // Handle values that fail the validity test in BigNumber.\r\n    parseNumeric = (function () {\r\n      var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n        dotAfter = /^([^.]+)\\.$/,\r\n        dotBefore = /^\\.([^.]+)$/,\r\n        isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n        whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n      return function (x, str, isNum, b) {\r\n        var base,\r\n          s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n        // No exception on ±Infinity or NaN.\r\n        if (isInfinityOrNaN.test(s)) {\r\n          x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n        } else {\r\n          if (!isNum) {\r\n\r\n            // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n            s = s.replace(basePrefix, function (m, p1, p2) {\r\n              base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n              return !b || b == base ? p1 : m;\r\n            });\r\n\r\n            if (b) {\r\n              base = b;\r\n\r\n              // E.g. '1.' to '1', '.1' to '0.1'\r\n              s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n            }\r\n\r\n            if (str != s) return new BigNumber(s, base);\r\n          }\r\n\r\n          // '[BigNumber Error] Not a number: {n}'\r\n          // '[BigNumber Error] Not a base {b} number: {n}'\r\n          if (BigNumber.DEBUG) {\r\n            throw Error\r\n              (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n          }\r\n\r\n          // NaN\r\n          x.s = null;\r\n        }\r\n\r\n        x.c = x.e = null;\r\n      }\r\n    })();\r\n\r\n\r\n    /*\r\n     * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n     * If r is truthy, it is known that there are more digits after the rounding digit.\r\n     */\r\n    function round(x, sd, rm, r) {\r\n      var d, i, j, k, n, ni, rd,\r\n        xc = x.c,\r\n        pows10 = POWS_TEN;\r\n\r\n      // if x is not Infinity or NaN...\r\n      if (xc) {\r\n\r\n        // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n        // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n        // ni is the index of n within x.c.\r\n        // d is the number of digits of n.\r\n        // i is the index of rd within n including leading zeros.\r\n        // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n        out: {\r\n\r\n          // Get the number of digits of the first element of xc.\r\n          for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n          i = sd - d;\r\n\r\n          // If the rounding digit is in the first element of xc...\r\n          if (i < 0) {\r\n            i += LOG_BASE;\r\n            j = sd;\r\n            n = xc[ni = 0];\r\n\r\n            // Get the rounding digit at index j of n.\r\n            rd = n / pows10[d - j - 1] % 10 | 0;\r\n          } else {\r\n            ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n            if (ni >= xc.length) {\r\n\r\n              if (r) {\r\n\r\n                // Needed by sqrt.\r\n                for (; xc.length <= ni; xc.push(0));\r\n                n = rd = 0;\r\n                d = 1;\r\n                i %= LOG_BASE;\r\n                j = i - LOG_BASE + 1;\r\n              } else {\r\n                break out;\r\n              }\r\n            } else {\r\n              n = k = xc[ni];\r\n\r\n              // Get the number of digits of n.\r\n              for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n              // Get the index of rd within n.\r\n              i %= LOG_BASE;\r\n\r\n              // Get the index of rd within n, adjusted for leading zeros.\r\n              // The number of leading zeros of n is given by LOG_BASE - d.\r\n              j = i - LOG_BASE + d;\r\n\r\n              // Get the rounding digit at index j of n.\r\n              rd = j < 0 ? 0 : n / pows10[d - j - 1] % 10 | 0;\r\n            }\r\n          }\r\n\r\n          r = r || sd < 0 ||\r\n\r\n          // Are there any non-zero digits after the rounding digit?\r\n          // The expression  n % pows10[d - j - 1]  returns all digits of n to the right\r\n          // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n           xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n          r = rm < 4\r\n           ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n           : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n            // Check whether the digit to the left of the rounding digit is odd.\r\n            ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n             rm == (x.s < 0 ? 8 : 7));\r\n\r\n          if (sd < 1 || !xc[0]) {\r\n            xc.length = 0;\r\n\r\n            if (r) {\r\n\r\n              // Convert sd to decimal places.\r\n              sd -= x.e + 1;\r\n\r\n              // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n              xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n              x.e = -sd || 0;\r\n            } else {\r\n\r\n              // Zero.\r\n              xc[0] = x.e = 0;\r\n            }\r\n\r\n            return x;\r\n          }\r\n\r\n          // Remove excess digits.\r\n          if (i == 0) {\r\n            xc.length = ni;\r\n            k = 1;\r\n            ni--;\r\n          } else {\r\n            xc.length = ni + 1;\r\n            k = pows10[LOG_BASE - i];\r\n\r\n            // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n            // j > 0 means i > number of leading zeros of n.\r\n            xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n          }\r\n\r\n          // Round up?\r\n          if (r) {\r\n\r\n            for (; ;) {\r\n\r\n              // If the digit to be rounded up is in the first element of xc...\r\n              if (ni == 0) {\r\n\r\n                // i will be the length of xc[0] before k is added.\r\n                for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n                j = xc[0] += k;\r\n                for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n                // if i != k the length has increased.\r\n                if (i != k) {\r\n                  x.e++;\r\n                  if (xc[0] == BASE) xc[0] = 1;\r\n                }\r\n\r\n                break;\r\n              } else {\r\n                xc[ni] += k;\r\n                if (xc[ni] != BASE) break;\r\n                xc[ni--] = 0;\r\n                k = 1;\r\n              }\r\n            }\r\n          }\r\n\r\n          // Remove trailing zeros.\r\n          for (i = xc.length; xc[--i] === 0; xc.pop());\r\n        }\r\n\r\n        // Overflow? Infinity.\r\n        if (x.e > MAX_EXP) {\r\n          x.c = x.e = null;\r\n\r\n        // Underflow? Zero.\r\n        } else if (x.e < MIN_EXP) {\r\n          x.c = [x.e = 0];\r\n        }\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n\r\n    function valueOf(n) {\r\n      var str,\r\n        e = n.e;\r\n\r\n      if (e === null) return n.toString();\r\n\r\n      str = coeffToString(n.c);\r\n\r\n      str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n        ? toExponential(str, e)\r\n        : toFixedPoint(str, e, '0');\r\n\r\n      return n.s < 0 ? '-' + str : str;\r\n    }\r\n\r\n\r\n    // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n     */\r\n    P.absoluteValue = P.abs = function () {\r\n      var x = new BigNumber(this);\r\n      if (x.s < 0) x.s = 1;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return\r\n     *   1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     *   -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     *   0 if they have the same value,\r\n     *   or null if the value of either is NaN.\r\n     */\r\n    P.comparedTo = function (y, b) {\r\n      return compare(this, new BigNumber(y, b));\r\n    };\r\n\r\n\r\n    /*\r\n     * If dp is undefined or null or true or false, return the number of decimal places of the\r\n     * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     *\r\n     * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.decimalPlaces = P.dp = function (dp, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), dp + x.e + 1, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n      // Subtract the number of trailing zeros of the last number.\r\n      if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n      if (n < 0) n = 0;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n / 0 = I\r\n     *  n / N = N\r\n     *  n / I = 0\r\n     *  0 / n = 0\r\n     *  0 / 0 = N\r\n     *  0 / N = N\r\n     *  0 / I = 0\r\n     *  N / n = N\r\n     *  N / 0 = N\r\n     *  N / N = N\r\n     *  N / I = N\r\n     *  I / n = I\r\n     *  I / 0 = I\r\n     *  I / N = N\r\n     *  I / I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n     * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.dividedBy = P.div = function (y, b) {\r\n      return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n     * BigNumber by the value of BigNumber(y, b).\r\n     */\r\n    P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n      return div(this, new BigNumber(y, b), 0, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n     *\r\n     * If m is present, return the result modulo m.\r\n     * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n     *\r\n     * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n     * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n     *\r\n     * n {number|string|BigNumber} The exponent. An integer.\r\n     * [m] {number|string|BigNumber} The modulus.\r\n     *\r\n     * '[BigNumber Error] Exponent not an integer: {n}'\r\n     */\r\n    P.exponentiatedBy = P.pow = function (n, m) {\r\n      var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n        x = this;\r\n\r\n      n = new BigNumber(n);\r\n\r\n      // Allow NaN and ±Infinity, but not other non-integers.\r\n      if (n.c && !n.isInteger()) {\r\n        throw Error\r\n          (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n      }\r\n\r\n      if (m != null) m = new BigNumber(m);\r\n\r\n      // Exponent of MAX_SAFE_INTEGER is 15.\r\n      nIsBig = n.e > 14;\r\n\r\n      // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n      if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n        // The sign of the result of pow when x is negative depends on the evenness of n.\r\n        // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n        y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? 2 - isOdd(n) : +valueOf(n)));\r\n        return m ? y.mod(m) : y;\r\n      }\r\n\r\n      nIsNeg = n.s < 0;\r\n\r\n      if (m) {\r\n\r\n        // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n        if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n        isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n        if (isModExp) x = x.mod(m);\r\n\r\n      // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n      // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n      } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n        // [1, 240000000]\r\n        ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n        // [80000000000000]  [99999750000000]\r\n        : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n        // If x is negative and n is odd, k = -0, else k = 0.\r\n        k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n        // If x >= 1, k = ±Infinity.\r\n        if (x.e > -1) k = 1 / k;\r\n\r\n        // If n is negative return ±0, else return ±Infinity.\r\n        return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n      } else if (POW_PRECISION) {\r\n\r\n        // Truncating each coefficient array to a length of k after each multiplication\r\n        // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n        // i.e. there will be a minimum of 28 guard digits retained.\r\n        k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n      }\r\n\r\n      if (nIsBig) {\r\n        half = new BigNumber(0.5);\r\n        if (nIsNeg) n.s = 1;\r\n        nIsOdd = isOdd(n);\r\n      } else {\r\n        i = Math.abs(+valueOf(n));\r\n        nIsOdd = i % 2;\r\n      }\r\n\r\n      y = new BigNumber(ONE);\r\n\r\n      // Performs 54 loop iterations for n of 9007199254740991.\r\n      for (; ;) {\r\n\r\n        if (nIsOdd) {\r\n          y = y.times(x);\r\n          if (!y.c) break;\r\n\r\n          if (k) {\r\n            if (y.c.length > k) y.c.length = k;\r\n          } else if (isModExp) {\r\n            y = y.mod(m);    //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n          }\r\n        }\r\n\r\n        if (i) {\r\n          i = mathfloor(i / 2);\r\n          if (i === 0) break;\r\n          nIsOdd = i % 2;\r\n        } else {\r\n          n = n.times(half);\r\n          round(n, n.e + 1, 1);\r\n\r\n          if (n.e > 14) {\r\n            nIsOdd = isOdd(n);\r\n          } else {\r\n            i = +valueOf(n);\r\n            if (i === 0) break;\r\n            nIsOdd = i % 2;\r\n          }\r\n        }\r\n\r\n        x = x.times(x);\r\n\r\n        if (k) {\r\n          if (x.c && x.c.length > k) x.c.length = k;\r\n        } else if (isModExp) {\r\n          x = x.mod(m);    //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n        }\r\n      }\r\n\r\n      if (isModExp) return y;\r\n      if (nIsNeg) y = ONE.div(y);\r\n\r\n      return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n     * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n     */\r\n    P.integerValue = function (rm) {\r\n      var n = new BigNumber(this);\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n      return round(n, n.e + 1, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isEqualTo = P.eq = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n     */\r\n    P.isFinite = function () {\r\n      return !!this.c;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isGreaterThan = P.gt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is greater than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n     */\r\n    P.isInteger = function () {\r\n      return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n     * otherwise return false.\r\n     */\r\n    P.isLessThan = P.lt = function (y, b) {\r\n      return compare(this, new BigNumber(y, b)) < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is less than or equal to the value of\r\n     * BigNumber(y, b), otherwise return false.\r\n     */\r\n    P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n      return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n     */\r\n    P.isNaN = function () {\r\n      return !this.s;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is negative, otherwise return false.\r\n     */\r\n    P.isNegative = function () {\r\n      return this.s < 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is positive, otherwise return false.\r\n     */\r\n    P.isPositive = function () {\r\n      return this.s > 0;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n     */\r\n    P.isZero = function () {\r\n      return !!this.c && this.c[0] == 0;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n - 0 = n\r\n     *  n - N = N\r\n     *  n - I = -I\r\n     *  0 - n = -n\r\n     *  0 - 0 = 0\r\n     *  0 - N = N\r\n     *  0 - I = -I\r\n     *  N - n = N\r\n     *  N - 0 = N\r\n     *  N - N = N\r\n     *  N - I = N\r\n     *  I - n = I\r\n     *  I - 0 = I\r\n     *  I - N = N\r\n     *  I - I = N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.minus = function (y, b) {\r\n      var i, j, t, xLTy,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n      if (a != b) {\r\n        y.s = -b;\r\n        return x.plus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Either Infinity?\r\n        if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n        // Either zero?\r\n        if (!xc[0] || !yc[0]) {\r\n\r\n          // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n          return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n           // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n           ROUNDING_MODE == 3 ? -0 : 0);\r\n        }\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Determine which is the bigger number.\r\n      if (a = xe - ye) {\r\n\r\n        if (xLTy = a < 0) {\r\n          a = -a;\r\n          t = xc;\r\n        } else {\r\n          ye = xe;\r\n          t = yc;\r\n        }\r\n\r\n        t.reverse();\r\n\r\n        // Prepend zeros to equalise exponents.\r\n        for (b = a; b--; t.push(0));\r\n        t.reverse();\r\n      } else {\r\n\r\n        // Exponents equal. Check digit by digit.\r\n        j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n        for (a = b = 0; b < j; b++) {\r\n\r\n          if (xc[b] != yc[b]) {\r\n            xLTy = xc[b] < yc[b];\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      // x < y? Point xc to the array of the bigger number.\r\n      if (xLTy) t = xc, xc = yc, yc = t, y.s = -y.s;\r\n\r\n      b = (j = yc.length) - (i = xc.length);\r\n\r\n      // Append zeros to xc if shorter.\r\n      // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n      if (b > 0) for (; b--; xc[i++] = 0);\r\n      b = BASE - 1;\r\n\r\n      // Subtract yc from xc.\r\n      for (; j > a;) {\r\n\r\n        if (xc[--j] < yc[j]) {\r\n          for (i = j; i && !xc[--i]; xc[i] = b);\r\n          --xc[i];\r\n          xc[j] += BASE;\r\n        }\r\n\r\n        xc[j] -= yc[j];\r\n      }\r\n\r\n      // Remove leading zeros and adjust exponent accordingly.\r\n      for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n      // Zero?\r\n      if (!xc[0]) {\r\n\r\n        // Following IEEE 754 (2008) 6.3,\r\n        // n - n = +0  but  n - n = -0  when rounding towards -Infinity.\r\n        y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n        y.c = [y.e = 0];\r\n        return y;\r\n      }\r\n\r\n      // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n      // for finite x and y.\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     *   n % 0 =  N\r\n     *   n % N =  N\r\n     *   n % I =  n\r\n     *   0 % n =  0\r\n     *  -0 % n = -0\r\n     *   0 % 0 =  N\r\n     *   0 % N =  N\r\n     *   0 % I =  0\r\n     *   N % n =  N\r\n     *   N % 0 =  N\r\n     *   N % N =  N\r\n     *   N % I =  N\r\n     *   I % n =  N\r\n     *   I % 0 =  N\r\n     *   I % N =  N\r\n     *   I % I =  N\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n     * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n     */\r\n    P.modulo = P.mod = function (y, b) {\r\n      var q, s,\r\n        x = this;\r\n\r\n      y = new BigNumber(y, b);\r\n\r\n      // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n      if (!x.c || !y.s || y.c && !y.c[0]) {\r\n        return new BigNumber(NaN);\r\n\r\n      // Return x if y is Infinity or x is zero.\r\n      } else if (!y.c || x.c && !x.c[0]) {\r\n        return new BigNumber(x);\r\n      }\r\n\r\n      if (MODULO_MODE == 9) {\r\n\r\n        // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n        // r = x - qy    where  0 <= r < abs(y)\r\n        s = y.s;\r\n        y.s = 1;\r\n        q = div(x, y, 0, 3);\r\n        y.s = s;\r\n        q.s *= s;\r\n      } else {\r\n        q = div(x, y, 0, MODULO_MODE);\r\n      }\r\n\r\n      y = x.minus(q.times(y));\r\n\r\n      // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n      if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n      return y;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n * 0 = 0\r\n     *  n * N = N\r\n     *  n * I = I\r\n     *  0 * n = 0\r\n     *  0 * 0 = 0\r\n     *  0 * N = N\r\n     *  0 * I = N\r\n     *  N * n = N\r\n     *  N * 0 = N\r\n     *  N * N = N\r\n     *  N * I = N\r\n     *  I * n = I\r\n     *  I * 0 = N\r\n     *  I * N = N\r\n     *  I * I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n     * of BigNumber(y, b).\r\n     */\r\n    P.multipliedBy = P.times = function (y, b) {\r\n      var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n        base, sqrtBase,\r\n        x = this,\r\n        xc = x.c,\r\n        yc = (y = new BigNumber(y, b)).c;\r\n\r\n      // Either NaN, ±Infinity or ±0?\r\n      if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n        // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n        if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n          y.c = y.e = y.s = null;\r\n        } else {\r\n          y.s *= x.s;\r\n\r\n          // Return ±Infinity if either is ±Infinity.\r\n          if (!xc || !yc) {\r\n            y.c = y.e = null;\r\n\r\n          // Return ±0 if either is ±0.\r\n          } else {\r\n            y.c = [0];\r\n            y.e = 0;\r\n          }\r\n        }\r\n\r\n        return y;\r\n      }\r\n\r\n      e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n      y.s *= x.s;\r\n      xcL = xc.length;\r\n      ycL = yc.length;\r\n\r\n      // Ensure xc points to longer array and xcL to its length.\r\n      if (xcL < ycL) zc = xc, xc = yc, yc = zc, i = xcL, xcL = ycL, ycL = i;\r\n\r\n      // Initialise the result array with zeros.\r\n      for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n      base = BASE;\r\n      sqrtBase = SQRT_BASE;\r\n\r\n      for (i = ycL; --i >= 0;) {\r\n        c = 0;\r\n        ylo = yc[i] % sqrtBase;\r\n        yhi = yc[i] / sqrtBase | 0;\r\n\r\n        for (k = xcL, j = i + k; j > i;) {\r\n          xlo = xc[--k] % sqrtBase;\r\n          xhi = xc[k] / sqrtBase | 0;\r\n          m = yhi * xlo + xhi * ylo;\r\n          xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n          c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n          zc[j--] = xlo % base;\r\n        }\r\n\r\n        zc[j] = c;\r\n      }\r\n\r\n      if (c) {\r\n        ++e;\r\n      } else {\r\n        zc.splice(0, 1);\r\n      }\r\n\r\n      return normalise(y, zc, e);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n     * i.e. multiplied by -1.\r\n     */\r\n    P.negated = function () {\r\n      var x = new BigNumber(this);\r\n      x.s = -x.s || null;\r\n      return x;\r\n    };\r\n\r\n\r\n    /*\r\n     *  n + 0 = n\r\n     *  n + N = N\r\n     *  n + I = I\r\n     *  0 + n = n\r\n     *  0 + 0 = 0\r\n     *  0 + N = N\r\n     *  0 + I = I\r\n     *  N + n = N\r\n     *  N + 0 = N\r\n     *  N + N = N\r\n     *  N + I = N\r\n     *  I + n = I\r\n     *  I + 0 = I\r\n     *  I + N = N\r\n     *  I + I = I\r\n     *\r\n     * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n     * BigNumber(y, b).\r\n     */\r\n    P.plus = function (y, b) {\r\n      var t,\r\n        x = this,\r\n        a = x.s;\r\n\r\n      y = new BigNumber(y, b);\r\n      b = y.s;\r\n\r\n      // Either NaN?\r\n      if (!a || !b) return new BigNumber(NaN);\r\n\r\n      // Signs differ?\r\n       if (a != b) {\r\n        y.s = -b;\r\n        return x.minus(y);\r\n      }\r\n\r\n      var xe = x.e / LOG_BASE,\r\n        ye = y.e / LOG_BASE,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      if (!xe || !ye) {\r\n\r\n        // Return ±Infinity if either ±Infinity.\r\n        if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n        // Either zero?\r\n        // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n        if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n      }\r\n\r\n      xe = bitFloor(xe);\r\n      ye = bitFloor(ye);\r\n      xc = xc.slice();\r\n\r\n      // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n      if (a = xe - ye) {\r\n        if (a > 0) {\r\n          ye = xe;\r\n          t = yc;\r\n        } else {\r\n          a = -a;\r\n          t = xc;\r\n        }\r\n\r\n        t.reverse();\r\n        for (; a--; t.push(0));\r\n        t.reverse();\r\n      }\r\n\r\n      a = xc.length;\r\n      b = yc.length;\r\n\r\n      // Point xc to the longer array, and b to the shorter length.\r\n      if (a - b < 0) t = yc, yc = xc, xc = t, b = a;\r\n\r\n      // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n      for (a = 0; b;) {\r\n        a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n        xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n      }\r\n\r\n      if (a) {\r\n        xc = [a].concat(xc);\r\n        ++ye;\r\n      }\r\n\r\n      // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n      // ye = MAX_EXP + 1 possible\r\n      return normalise(y, xc, ye);\r\n    };\r\n\r\n\r\n    /*\r\n     * If sd is undefined or null or true or false, return the number of significant digits of\r\n     * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n     * If sd is true include integer-part trailing zeros in the count.\r\n     *\r\n     * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n     * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n     * ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n     *                     boolean: whether to count integer-part trailing zeros: true or false.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.precision = P.sd = function (sd, rm) {\r\n      var c, n, v,\r\n        x = this;\r\n\r\n      if (sd != null && sd !== !!sd) {\r\n        intCheck(sd, 1, MAX);\r\n        if (rm == null) rm = ROUNDING_MODE;\r\n        else intCheck(rm, 0, 8);\r\n\r\n        return round(new BigNumber(x), sd, rm);\r\n      }\r\n\r\n      if (!(c = x.c)) return null;\r\n      v = c.length - 1;\r\n      n = v * LOG_BASE + 1;\r\n\r\n      if (v = c[v]) {\r\n\r\n        // Subtract the number of trailing zeros of the last element.\r\n        for (; v % 10 == 0; v /= 10, n--);\r\n\r\n        // Add the number of digits of the first element.\r\n        for (v = c[0]; v >= 10; v /= 10, n++);\r\n      }\r\n\r\n      if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n      return n;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n     * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n     *\r\n     * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n     */\r\n    P.shiftedBy = function (k) {\r\n      intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n      return this.times('1e' + k);\r\n    };\r\n\r\n\r\n    /*\r\n     *  sqrt(-n) =  N\r\n     *  sqrt(N) =  N\r\n     *  sqrt(-I) =  N\r\n     *  sqrt(I) =  I\r\n     *  sqrt(0) =  0\r\n     *  sqrt(-0) = -0\r\n     *\r\n     * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n     * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n     */\r\n    P.squareRoot = P.sqrt = function () {\r\n      var m, n, r, rep, t,\r\n        x = this,\r\n        c = x.c,\r\n        s = x.s,\r\n        e = x.e,\r\n        dp = DECIMAL_PLACES + 4,\r\n        half = new BigNumber('0.5');\r\n\r\n      // Negative/NaN/Infinity/zero?\r\n      if (s !== 1 || !c || !c[0]) {\r\n        return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n      }\r\n\r\n      // Initial estimate.\r\n      s = Math.sqrt(+valueOf(x));\r\n\r\n      // Math.sqrt underflow/overflow?\r\n      // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n      if (s == 0 || s == 1 / 0) {\r\n        n = coeffToString(c);\r\n        if ((n.length + e) % 2 == 0) n += '0';\r\n        s = Math.sqrt(+n);\r\n        e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n        if (s == 1 / 0) {\r\n          n = '5e' + e;\r\n        } else {\r\n          n = s.toExponential();\r\n          n = n.slice(0, n.indexOf('e') + 1) + e;\r\n        }\r\n\r\n        r = new BigNumber(n);\r\n      } else {\r\n        r = new BigNumber(s + '');\r\n      }\r\n\r\n      // Check for zero.\r\n      // r could be zero if MIN_EXP is changed after the this value was created.\r\n      // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n      // coeffToString to throw.\r\n      if (r.c[0]) {\r\n        e = r.e;\r\n        s = e + dp;\r\n        if (s < 3) s = 0;\r\n\r\n        // Newton-Raphson iteration.\r\n        for (; ;) {\r\n          t = r;\r\n          r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n          if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n            // The exponent of r may here be one less than the final result exponent,\r\n            // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n            // are indexed correctly.\r\n            if (r.e < e) --s;\r\n            n = n.slice(s - 3, s + 1);\r\n\r\n            // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n            // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n            // iteration.\r\n            if (n == '9999' || !rep && n == '4999') {\r\n\r\n              // On the first iteration only, check to see if rounding up gives the\r\n              // exact result as the nines may infinitely repeat.\r\n              if (!rep) {\r\n                round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n                if (t.times(t).eq(x)) {\r\n                  r = t;\r\n                  break;\r\n                }\r\n              }\r\n\r\n              dp += 4;\r\n              s += 4;\r\n              rep = 1;\r\n            } else {\r\n\r\n              // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n              // result. If not, then there are further digits and m will be truthy.\r\n              if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n                // Truncate to the first rounding digit.\r\n                round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n                m = !r.times(r).eq(x);\r\n              }\r\n\r\n              break;\r\n            }\r\n          }\r\n        }\r\n      }\r\n\r\n      return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in exponential notation and\r\n     * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toExponential = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp++;\r\n      }\r\n      return format(this, dp, rm, 1);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n     * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n     *\r\n     * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n     * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     */\r\n    P.toFixed = function (dp, rm) {\r\n      if (dp != null) {\r\n        intCheck(dp, 0, MAX);\r\n        dp = dp + this.e + 1;\r\n      }\r\n      return format(this, dp, rm);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n     * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n     * of the format or FORMAT object (see BigNumber.set).\r\n     *\r\n     * The formatting object may contain some or all of the properties shown below.\r\n     *\r\n     * FORMAT = {\r\n     *   prefix: '',\r\n     *   groupSize: 3,\r\n     *   secondaryGroupSize: 0,\r\n     *   groupSeparator: ',',\r\n     *   decimalSeparator: '.',\r\n     *   fractionGroupSize: 0,\r\n     *   fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n     *   suffix: ''\r\n     * };\r\n     *\r\n     * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     * [format] {object} Formatting options. See FORMAT pbject above.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n     * '[BigNumber Error] Argument not an object: {format}'\r\n     */\r\n    P.toFormat = function (dp, rm, format) {\r\n      var str,\r\n        x = this;\r\n\r\n      if (format == null) {\r\n        if (dp != null && rm && typeof rm == 'object') {\r\n          format = rm;\r\n          rm = null;\r\n        } else if (dp && typeof dp == 'object') {\r\n          format = dp;\r\n          dp = rm = null;\r\n        } else {\r\n          format = FORMAT;\r\n        }\r\n      } else if (typeof format != 'object') {\r\n        throw Error\r\n          (bignumberError + 'Argument not an object: ' + format);\r\n      }\r\n\r\n      str = x.toFixed(dp, rm);\r\n\r\n      if (x.c) {\r\n        var i,\r\n          arr = str.split('.'),\r\n          g1 = +format.groupSize,\r\n          g2 = +format.secondaryGroupSize,\r\n          groupSeparator = format.groupSeparator || '',\r\n          intPart = arr[0],\r\n          fractionPart = arr[1],\r\n          isNeg = x.s < 0,\r\n          intDigits = isNeg ? intPart.slice(1) : intPart,\r\n          len = intDigits.length;\r\n\r\n        if (g2) i = g1, g1 = g2, g2 = i, len -= i;\r\n\r\n        if (g1 > 0 && len > 0) {\r\n          i = len % g1 || g1;\r\n          intPart = intDigits.substr(0, i);\r\n          for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n          if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n          if (isNeg) intPart = '-' + intPart;\r\n        }\r\n\r\n        str = fractionPart\r\n         ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)\r\n          ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n           '$&' + (format.fractionGroupSeparator || ''))\r\n          : fractionPart)\r\n         : intPart;\r\n      }\r\n\r\n      return (format.prefix || '') + str + (format.suffix || '');\r\n    };\r\n\r\n\r\n    /*\r\n     * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n     * fraction with an integer numerator and an integer denominator.\r\n     * The denominator will be a positive non-zero value less than or equal to the specified\r\n     * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n     * the lowest value necessary to represent the number exactly.\r\n     *\r\n     * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n     *\r\n     * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n     */\r\n    P.toFraction = function (md) {\r\n      var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n        x = this,\r\n        xc = x.c;\r\n\r\n      if (md != null) {\r\n        n = new BigNumber(md);\r\n\r\n        // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n        if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n          throw Error\r\n            (bignumberError + 'Argument ' +\r\n              (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n        }\r\n      }\r\n\r\n      if (!xc) return new BigNumber(x);\r\n\r\n      d = new BigNumber(ONE);\r\n      n1 = d0 = new BigNumber(ONE);\r\n      d1 = n0 = new BigNumber(ONE);\r\n      s = coeffToString(xc);\r\n\r\n      // Determine initial denominator.\r\n      // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n      e = d.e = s.length - x.e - 1;\r\n      d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n      md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n      exp = MAX_EXP;\r\n      MAX_EXP = 1 / 0;\r\n      n = new BigNumber(s);\r\n\r\n      // n0 = d1 = 0\r\n      n0.c[0] = 0;\r\n\r\n      for (; ;)  {\r\n        q = div(n, d, 0, 1);\r\n        d2 = d0.plus(q.times(d1));\r\n        if (d2.comparedTo(md) == 1) break;\r\n        d0 = d1;\r\n        d1 = d2;\r\n        n1 = n0.plus(q.times(d2 = n1));\r\n        n0 = d2;\r\n        d = n.minus(q.times(d2 = d));\r\n        n = d2;\r\n      }\r\n\r\n      d2 = div(md.minus(d0), d1, 0, 1);\r\n      n0 = n0.plus(d2.times(n1));\r\n      d0 = d0.plus(d2.times(d1));\r\n      n0.s = n1.s = x.s;\r\n      e = e * 2;\r\n\r\n      // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n      r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n          div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n      MAX_EXP = exp;\r\n\r\n      return r;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return the value of this BigNumber converted to a number primitive.\r\n     */\r\n    P.toNumber = function () {\r\n      return +valueOf(this);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n     * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n     * necessary to represent the integer part of the value in fixed-point notation, then use\r\n     * exponential notation.\r\n     *\r\n     * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n     * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n     *\r\n     * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n     */\r\n    P.toPrecision = function (sd, rm) {\r\n      if (sd != null) intCheck(sd, 1, MAX);\r\n      return format(this, sd, rm, 2);\r\n    };\r\n\r\n\r\n    /*\r\n     * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n     * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n     * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n     * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n     * TO_EXP_NEG, return exponential notation.\r\n     *\r\n     * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n     *\r\n     * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n     */\r\n    P.toString = function (b) {\r\n      var str,\r\n        n = this,\r\n        s = n.s,\r\n        e = n.e;\r\n\r\n      // Infinity or NaN?\r\n      if (e === null) {\r\n        if (s) {\r\n          str = 'Infinity';\r\n          if (s < 0) str = '-' + str;\r\n        } else {\r\n          str = 'NaN';\r\n        }\r\n      } else {\r\n        if (b == null) {\r\n          str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n           ? toExponential(coeffToString(n.c), e)\r\n           : toFixedPoint(coeffToString(n.c), e, '0');\r\n        } else if (b === 10) {\r\n          n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n          str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n        } else {\r\n          intCheck(b, 2, ALPHABET.length, 'Base');\r\n          str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n        }\r\n\r\n        if (s < 0 && n.c[0]) str = '-' + str;\r\n      }\r\n\r\n      return str;\r\n    };\r\n\r\n\r\n    /*\r\n     * Return as toString, but do not accept a base argument, and include the minus sign for\r\n     * negative zero.\r\n     */\r\n    P.valueOf = P.toJSON = function () {\r\n      return valueOf(this);\r\n    };\r\n\r\n\r\n    P._isBigNumber = true;\r\n\r\n    if (configObject != null) BigNumber.set(configObject);\r\n\r\n    return BigNumber;\r\n  }\r\n\r\n\r\n  // PRIVATE HELPER FUNCTIONS\r\n\r\n  // These functions don't need access to variables,\r\n  // e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\n  function bitFloor(n) {\r\n    var i = n | 0;\r\n    return n > 0 || n === i ? i : i - 1;\r\n  }\r\n\r\n\r\n  // Return a coefficient array as a string of base 10 digits.\r\n  function coeffToString(a) {\r\n    var s, z,\r\n      i = 1,\r\n      j = a.length,\r\n      r = a[0] + '';\r\n\r\n    for (; i < j;) {\r\n      s = a[i++] + '';\r\n      z = LOG_BASE - s.length;\r\n      for (; z--; s = '0' + s);\r\n      r += s;\r\n    }\r\n\r\n    // Determine trailing zeros.\r\n    for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n    return r.slice(0, j + 1 || 1);\r\n  }\r\n\r\n\r\n  // Compare the value of BigNumbers x and y.\r\n  function compare(x, y) {\r\n    var a, b,\r\n      xc = x.c,\r\n      yc = y.c,\r\n      i = x.s,\r\n      j = y.s,\r\n      k = x.e,\r\n      l = y.e;\r\n\r\n    // Either NaN?\r\n    if (!i || !j) return null;\r\n\r\n    a = xc && !xc[0];\r\n    b = yc && !yc[0];\r\n\r\n    // Either zero?\r\n    if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n    // Signs differ?\r\n    if (i != j) return i;\r\n\r\n    a = i < 0;\r\n    b = k == l;\r\n\r\n    // Either Infinity?\r\n    if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n    // Compare exponents.\r\n    if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n    j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n    // Compare digit by digit.\r\n    for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n    // Compare lengths.\r\n    return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n  }\r\n\r\n\r\n  /*\r\n   * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n   */\r\n  function intCheck(n, min, max, name) {\r\n    if (n < min || n > max || n !== mathfloor(n)) {\r\n      throw Error\r\n       (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n         ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n         : ' not a primitive number: ') + String(n));\r\n    }\r\n  }\r\n\r\n\r\n  // Assumes finite n.\r\n  function isOdd(n) {\r\n    var k = n.c.length - 1;\r\n    return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n  }\r\n\r\n\r\n  function toExponential(str, e) {\r\n    return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n     (e < 0 ? 'e' : 'e+') + e;\r\n  }\r\n\r\n\r\n  function toFixedPoint(str, e, z) {\r\n    var len, zs;\r\n\r\n    // Negative exponent?\r\n    if (e < 0) {\r\n\r\n      // Prepend zeros.\r\n      for (zs = z + '.'; ++e; zs += z);\r\n      str = zs + str;\r\n\r\n    // Positive exponent\r\n    } else {\r\n      len = str.length;\r\n\r\n      // Append zeros.\r\n      if (++e > len) {\r\n        for (zs = z, e -= len; --e; zs += z);\r\n        str += zs;\r\n      } else if (e < len) {\r\n        str = str.slice(0, e) + '.' + str.slice(e);\r\n      }\r\n    }\r\n\r\n    return str;\r\n  }\r\n\r\n\r\n  // EXPORT\r\n\r\n\r\n  BigNumber = clone();\r\n  BigNumber['default'] = BigNumber.BigNumber = BigNumber;\r\n\r\n  // AMD.\r\n  if (typeof define == 'function' && define.amd) {\r\n    define(function () { return BigNumber; });\r\n\r\n  // Node.js and other environments that support module.exports.\r\n  } else if (typeof module != 'undefined' && module.exports) {\r\n    module.exports = BigNumber;\r\n\r\n  // Browser.\r\n  } else {\r\n    if (!globalObject) {\r\n      globalObject = typeof self != 'undefined' && self ? self : window;\r\n    }\r\n\r\n    globalObject.BigNumber = BigNumber;\r\n  }\r\n})(this);\r\n","/* eslint-disable */\n\nmodule.exports = function decodeAsm (stdlib, foreign, buffer) {\n  'use asm'\n\n  // -- Imports\n\n  var heap = new stdlib.Uint8Array(buffer)\n  // var log = foreign.log\n  var pushInt = foreign.pushInt\n  var pushInt32 = foreign.pushInt32\n  var pushInt32Neg = foreign.pushInt32Neg\n  var pushInt64 = foreign.pushInt64\n  var pushInt64Neg = foreign.pushInt64Neg\n  var pushFloat = foreign.pushFloat\n  var pushFloatSingle = foreign.pushFloatSingle\n  var pushFloatDouble = foreign.pushFloatDouble\n  var pushTrue = foreign.pushTrue\n  var pushFalse = foreign.pushFalse\n  var pushUndefined = foreign.pushUndefined\n  var pushNull = foreign.pushNull\n  var pushInfinity = foreign.pushInfinity\n  var pushInfinityNeg = foreign.pushInfinityNeg\n  var pushNaN = foreign.pushNaN\n  var pushNaNNeg = foreign.pushNaNNeg\n\n  var pushArrayStart = foreign.pushArrayStart\n  var pushArrayStartFixed = foreign.pushArrayStartFixed\n  var pushArrayStartFixed32 = foreign.pushArrayStartFixed32\n  var pushArrayStartFixed64 = foreign.pushArrayStartFixed64\n  var pushObjectStart = foreign.pushObjectStart\n  var pushObjectStartFixed = foreign.pushObjectStartFixed\n  var pushObjectStartFixed32 = foreign.pushObjectStartFixed32\n  var pushObjectStartFixed64 = foreign.pushObjectStartFixed64\n\n  var pushByteString = foreign.pushByteString\n  var pushByteStringStart = foreign.pushByteStringStart\n  var pushUtf8String = foreign.pushUtf8String\n  var pushUtf8StringStart = foreign.pushUtf8StringStart\n\n  var pushSimpleUnassigned = foreign.pushSimpleUnassigned\n\n  var pushTagStart = foreign.pushTagStart\n  var pushTagStart4 = foreign.pushTagStart4\n  var pushTagStart8 = foreign.pushTagStart8\n  var pushTagUnassigned = foreign.pushTagUnassigned\n\n  var pushBreak = foreign.pushBreak\n\n  var pow = stdlib.Math.pow\n\n  // -- Constants\n\n\n  // -- Mutable Variables\n\n  var offset = 0\n  var inputLength = 0\n  var code = 0\n\n  // Decode a cbor string represented as Uint8Array\n  // which is allocated on the heap from 0 to inputLength\n  //\n  // input - Int\n  //\n  // Returns Code - Int,\n  // Success = 0\n  // Error > 0\n  function parse (input) {\n    input = input | 0\n\n    offset = 0\n    inputLength = input\n\n    while ((offset | 0) < (inputLength | 0)) {\n      code = jumpTable[heap[offset] & 255](heap[offset] | 0) | 0\n\n      if ((code | 0) > 0) {\n        break\n      }\n    }\n\n    return code | 0\n  }\n\n  // -- Helper Function\n\n  function checkOffset (n) {\n    n = n | 0\n\n    if ((((offset | 0) + (n | 0)) | 0) < (inputLength | 0)) {\n      return 0\n    }\n\n    return 1\n  }\n\n  function readUInt16 (n) {\n    n = n | 0\n\n    return (\n      (heap[n | 0] << 8) | heap[(n + 1) | 0]\n    ) | 0\n  }\n\n  function readUInt32 (n) {\n    n = n | 0\n\n    return (\n      (heap[n | 0] << 24) | (heap[(n + 1) | 0] << 16) | (heap[(n + 2) | 0] << 8) | heap[(n + 3) | 0]\n    ) | 0\n  }\n\n  // -- Initial Byte Handlers\n\n  function INT_P (octet) {\n    octet = octet | 0\n\n    pushInt(octet | 0)\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function UINT_P_8 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushInt(heap[(offset + 1) | 0] | 0)\n\n    offset = (offset + 2) | 0\n\n    return 0\n  }\n\n  function UINT_P_16 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    pushInt(\n      readUInt16((offset + 1) | 0) | 0\n    )\n\n    offset = (offset + 3) | 0\n\n    return 0\n  }\n\n  function UINT_P_32 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushInt32(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0\n    )\n\n    offset = (offset + 5) | 0\n\n    return 0\n  }\n\n  function UINT_P_64 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushInt64(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0,\n      readUInt16((offset + 5) | 0) | 0,\n      readUInt16((offset + 7) | 0) | 0\n    )\n\n    offset = (offset + 9) | 0\n\n    return 0\n  }\n\n  function INT_N (octet) {\n    octet = octet | 0\n\n    pushInt((-1 - ((octet - 32) | 0)) | 0)\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function UINT_N_8 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushInt(\n      (-1 - (heap[(offset + 1) | 0] | 0)) | 0\n    )\n\n    offset = (offset + 2) | 0\n\n    return 0\n  }\n\n  function UINT_N_16 (octet) {\n    octet = octet | 0\n\n    var val = 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    val = readUInt16((offset + 1) | 0) | 0\n    pushInt((-1 - (val | 0)) | 0)\n\n    offset = (offset + 3) | 0\n\n    return 0\n  }\n\n  function UINT_N_32 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushInt32Neg(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0\n    )\n\n    offset = (offset + 5) | 0\n\n    return 0\n  }\n\n  function UINT_N_64 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushInt64Neg(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0,\n      readUInt16((offset + 5) | 0) | 0,\n      readUInt16((offset + 7) | 0) | 0\n    )\n\n    offset = (offset + 9) | 0\n\n    return 0\n  }\n\n  function BYTE_STRING (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var step = 0\n\n    step = (octet - 64) | 0\n    if (checkOffset(step | 0) | 0) {\n      return 1\n    }\n\n    start = (offset + 1) | 0\n    end = (((offset + 1) | 0) + (step | 0)) | 0\n\n    pushByteString(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function BYTE_STRING_8 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    length = heap[(offset + 1) | 0] | 0\n    start = (offset + 2) | 0\n    end = (((offset + 2) | 0) + (length | 0)) | 0\n\n    if (checkOffset((length + 1) | 0) | 0) {\n      return 1\n    }\n\n    pushByteString(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function BYTE_STRING_16 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    length = readUInt16((offset + 1) | 0) | 0\n    start = (offset + 3) | 0\n    end = (((offset + 3) | 0) + (length | 0)) | 0\n\n\n    if (checkOffset((length + 2) | 0) | 0) {\n      return 1\n    }\n\n    pushByteString(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function BYTE_STRING_32 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    length = readUInt32((offset + 1) | 0) | 0\n    start = (offset + 5) | 0\n    end = (((offset + 5) | 0) + (length | 0)) | 0\n\n\n    if (checkOffset((length + 4) | 0) | 0) {\n      return 1\n    }\n\n    pushByteString(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function BYTE_STRING_64 (octet) {\n    // NOT IMPLEMENTED\n    octet = octet | 0\n\n    return 1\n  }\n\n  function BYTE_STRING_BREAK (octet) {\n    octet = octet | 0\n\n    pushByteStringStart()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function UTF8_STRING (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var step = 0\n\n    step = (octet - 96) | 0\n\n    if (checkOffset(step | 0) | 0) {\n      return 1\n    }\n\n    start = (offset + 1) | 0\n    end = (((offset + 1) | 0) + (step | 0)) | 0\n\n    pushUtf8String(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function UTF8_STRING_8 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    length = heap[(offset + 1) | 0] | 0\n    start = (offset + 2) | 0\n    end = (((offset + 2) | 0) + (length | 0)) | 0\n\n    if (checkOffset((length + 1) | 0) | 0) {\n      return 1\n    }\n\n    pushUtf8String(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function UTF8_STRING_16 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    length = readUInt16((offset + 1) | 0) | 0\n    start = (offset + 3) | 0\n    end = (((offset + 3) | 0) + (length | 0)) | 0\n\n    if (checkOffset((length + 2) | 0) | 0) {\n      return 1\n    }\n\n    pushUtf8String(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function UTF8_STRING_32 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    length = readUInt32((offset + 1) | 0) | 0\n    start = (offset + 5) | 0\n    end = (((offset + 5) | 0) + (length | 0)) | 0\n\n    if (checkOffset((length + 4) | 0) | 0) {\n      return 1\n    }\n\n    pushUtf8String(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function UTF8_STRING_64 (octet) {\n    // NOT IMPLEMENTED\n    octet = octet | 0\n\n    return 1\n  }\n\n  function UTF8_STRING_BREAK (octet) {\n    octet = octet | 0\n\n    pushUtf8StringStart()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function ARRAY (octet) {\n    octet = octet | 0\n\n    pushArrayStartFixed((octet - 128) | 0)\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function ARRAY_8 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushArrayStartFixed(heap[(offset + 1) | 0] | 0)\n\n    offset = (offset + 2) | 0\n\n    return 0\n  }\n\n  function ARRAY_16 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    pushArrayStartFixed(\n      readUInt16((offset + 1) | 0) | 0\n    )\n\n    offset = (offset + 3) | 0\n\n    return 0\n  }\n\n  function ARRAY_32 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushArrayStartFixed32(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0\n    )\n\n    offset = (offset + 5) | 0\n\n    return 0\n  }\n\n  function ARRAY_64 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushArrayStartFixed64(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0,\n      readUInt16((offset + 5) | 0) | 0,\n      readUInt16((offset + 7) | 0) | 0\n    )\n\n    offset = (offset + 9) | 0\n\n    return 0\n  }\n\n  function ARRAY_BREAK (octet) {\n    octet = octet | 0\n\n    pushArrayStart()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function MAP (octet) {\n    octet = octet | 0\n\n    var step = 0\n\n    step = (octet - 160) | 0\n\n    if (checkOffset(step | 0) | 0) {\n      return 1\n    }\n\n    pushObjectStartFixed(step | 0)\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function MAP_8 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushObjectStartFixed(heap[(offset + 1) | 0] | 0)\n\n    offset = (offset + 2) | 0\n\n    return 0\n  }\n\n  function MAP_16 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    pushObjectStartFixed(\n      readUInt16((offset + 1) | 0) | 0\n    )\n\n    offset = (offset + 3) | 0\n\n    return 0\n  }\n\n  function MAP_32 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushObjectStartFixed32(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0\n    )\n\n    offset = (offset + 5) | 0\n\n    return 0\n  }\n\n  function MAP_64 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushObjectStartFixed64(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0,\n      readUInt16((offset + 5) | 0) | 0,\n      readUInt16((offset + 7) | 0) | 0\n    )\n\n    offset = (offset + 9) | 0\n\n    return 0\n  }\n\n  function MAP_BREAK (octet) {\n    octet = octet | 0\n\n    pushObjectStart()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function TAG_KNOWN (octet) {\n    octet = octet | 0\n\n    pushTagStart((octet - 192| 0) | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BIGNUM_POS (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BIGNUM_NEG (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_FRAC (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BIGNUM_FLOAT (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_UNASSIGNED (octet) {\n    octet = octet | 0\n\n    pushTagStart((octet - 192| 0) | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BASE64_URL (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BASE64 (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BASE16 (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_MORE_1 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushTagStart(heap[(offset + 1) | 0] | 0)\n\n    offset = (offset + 2 | 0)\n\n    return 0\n  }\n\n  function TAG_MORE_2 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    pushTagStart(\n      readUInt16((offset + 1) | 0) | 0\n    )\n\n    offset = (offset + 3 | 0)\n\n    return 0\n  }\n\n  function TAG_MORE_4 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushTagStart4(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0\n    )\n\n    offset = (offset + 5 | 0)\n\n    return 0\n  }\n\n  function TAG_MORE_8 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushTagStart8(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0,\n      readUInt16((offset + 5) | 0) | 0,\n      readUInt16((offset + 7) | 0) | 0\n    )\n\n    offset = (offset + 9 | 0)\n\n    return 0\n  }\n\n  function SIMPLE_UNASSIGNED (octet) {\n    octet = octet | 0\n\n    pushSimpleUnassigned(((octet | 0) - 224) | 0)\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function SIMPLE_FALSE (octet) {\n    octet = octet | 0\n\n    pushFalse()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function SIMPLE_TRUE (octet) {\n    octet = octet | 0\n\n    pushTrue()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function SIMPLE_NULL (octet) {\n    octet = octet | 0\n\n    pushNull()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function SIMPLE_UNDEFINED (octet) {\n    octet = octet | 0\n\n    pushUndefined()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function SIMPLE_BYTE (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushSimpleUnassigned(heap[(offset + 1) | 0] | 0)\n\n    offset = (offset + 2)  | 0\n\n    return 0\n  }\n\n  function SIMPLE_FLOAT_HALF (octet) {\n    octet = octet | 0\n\n    var f = 0\n    var g = 0\n    var sign = 1.0\n    var exp = 0.0\n    var mant = 0.0\n    var r = 0.0\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    f = heap[(offset + 1) | 0] | 0\n    g = heap[(offset + 2) | 0] | 0\n\n    if ((f | 0) & 0x80) {\n      sign = -1.0\n    }\n\n    exp = +(((f | 0) & 0x7C) >> 2)\n    mant = +((((f | 0) & 0x03) << 8) | g)\n\n    if (+exp == 0.0) {\n      pushFloat(+(\n        (+sign) * +5.9604644775390625e-8 * (+mant)\n      ))\n    } else if (+exp == 31.0) {\n      if (+sign == 1.0) {\n        if (+mant > 0.0) {\n          pushNaN()\n        } else {\n          pushInfinity()\n        }\n      } else {\n        if (+mant > 0.0) {\n          pushNaNNeg()\n        } else {\n          pushInfinityNeg()\n        }\n      }\n    } else {\n      pushFloat(+(\n        +sign * pow(+2, +(+exp - 25.0)) * +(1024.0 + mant)\n      ))\n    }\n\n    offset = (offset + 3) | 0\n\n    return 0\n  }\n\n  function SIMPLE_FLOAT_SINGLE (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushFloatSingle(\n      heap[(offset + 1) | 0] | 0,\n      heap[(offset + 2) | 0] | 0,\n      heap[(offset + 3) | 0] | 0,\n      heap[(offset + 4) | 0] | 0\n    )\n\n    offset = (offset + 5) | 0\n\n    return 0\n  }\n\n  function SIMPLE_FLOAT_DOUBLE (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushFloatDouble(\n      heap[(offset + 1) | 0] | 0,\n      heap[(offset + 2) | 0] | 0,\n      heap[(offset + 3) | 0] | 0,\n      heap[(offset + 4) | 0] | 0,\n      heap[(offset + 5) | 0] | 0,\n      heap[(offset + 6) | 0] | 0,\n      heap[(offset + 7) | 0] | 0,\n      heap[(offset + 8) | 0] | 0\n    )\n\n    offset = (offset + 9) | 0\n\n    return 0\n  }\n\n  function ERROR (octet) {\n    octet = octet | 0\n\n    return 1\n  }\n\n  function BREAK (octet) {\n    octet = octet | 0\n\n    pushBreak()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  // -- Jump Table\n\n  var jumpTable = [\n    // Integer 0x00..0x17 (0..23)\n    INT_P, // 0x00\n    INT_P, // 0x01\n    INT_P, // 0x02\n    INT_P, // 0x03\n    INT_P, // 0x04\n    INT_P, // 0x05\n    INT_P, // 0x06\n    INT_P, // 0x07\n    INT_P, // 0x08\n    INT_P, // 0x09\n    INT_P, // 0x0A\n    INT_P, // 0x0B\n    INT_P, // 0x0C\n    INT_P, // 0x0D\n    INT_P, // 0x0E\n    INT_P, // 0x0F\n    INT_P, // 0x10\n    INT_P, // 0x11\n    INT_P, // 0x12\n    INT_P, // 0x13\n    INT_P, // 0x14\n    INT_P, // 0x15\n    INT_P, // 0x16\n    INT_P, // 0x17\n    // Unsigned integer (one-byte uint8_t follows)\n    UINT_P_8, // 0x18\n    // Unsigned integer (two-byte uint16_t follows)\n    UINT_P_16, // 0x19\n    // Unsigned integer (four-byte uint32_t follows)\n    UINT_P_32, // 0x1a\n    // Unsigned integer (eight-byte uint64_t follows)\n    UINT_P_64, // 0x1b\n    ERROR, // 0x1c\n    ERROR, // 0x1d\n    ERROR, // 0x1e\n    ERROR, // 0x1f\n    // Negative integer -1-0x00..-1-0x17 (-1..-24)\n    INT_N, // 0x20\n    INT_N, // 0x21\n    INT_N, // 0x22\n    INT_N, // 0x23\n    INT_N, // 0x24\n    INT_N, // 0x25\n    INT_N, // 0x26\n    INT_N, // 0x27\n    INT_N, // 0x28\n    INT_N, // 0x29\n    INT_N, // 0x2A\n    INT_N, // 0x2B\n    INT_N, // 0x2C\n    INT_N, // 0x2D\n    INT_N, // 0x2E\n    INT_N, // 0x2F\n    INT_N, // 0x30\n    INT_N, // 0x31\n    INT_N, // 0x32\n    INT_N, // 0x33\n    INT_N, // 0x34\n    INT_N, // 0x35\n    INT_N, // 0x36\n    INT_N, // 0x37\n    // Negative integer -1-n (one-byte uint8_t for n follows)\n    UINT_N_8, // 0x38\n    // Negative integer -1-n (two-byte uint16_t for n follows)\n    UINT_N_16, // 0x39\n    // Negative integer -1-n (four-byte uint32_t for nfollows)\n    UINT_N_32, // 0x3a\n    // Negative integer -1-n (eight-byte uint64_t for n follows)\n    UINT_N_64, // 0x3b\n    ERROR, // 0x3c\n    ERROR, // 0x3d\n    ERROR, // 0x3e\n    ERROR, // 0x3f\n    // byte string (0x00..0x17 bytes follow)\n    BYTE_STRING, // 0x40\n    BYTE_STRING, // 0x41\n    BYTE_STRING, // 0x42\n    BYTE_STRING, // 0x43\n    BYTE_STRING, // 0x44\n    BYTE_STRING, // 0x45\n    BYTE_STRING, // 0x46\n    BYTE_STRING, // 0x47\n    BYTE_STRING, // 0x48\n    BYTE_STRING, // 0x49\n    BYTE_STRING, // 0x4A\n    BYTE_STRING, // 0x4B\n    BYTE_STRING, // 0x4C\n    BYTE_STRING, // 0x4D\n    BYTE_STRING, // 0x4E\n    BYTE_STRING, // 0x4F\n    BYTE_STRING, // 0x50\n    BYTE_STRING, // 0x51\n    BYTE_STRING, // 0x52\n    BYTE_STRING, // 0x53\n    BYTE_STRING, // 0x54\n    BYTE_STRING, // 0x55\n    BYTE_STRING, // 0x56\n    BYTE_STRING, // 0x57\n    // byte string (one-byte uint8_t for n, and then n bytes follow)\n    BYTE_STRING_8, // 0x58\n    // byte string (two-byte uint16_t for n, and then n bytes follow)\n    BYTE_STRING_16, // 0x59\n    // byte string (four-byte uint32_t for n, and then n bytes follow)\n    BYTE_STRING_32, // 0x5a\n    // byte string (eight-byte uint64_t for n, and then n bytes follow)\n    BYTE_STRING_64, // 0x5b\n    ERROR, // 0x5c\n    ERROR, // 0x5d\n    ERROR, // 0x5e\n    // byte string, byte strings follow, terminated by \"break\"\n    BYTE_STRING_BREAK, // 0x5f\n    // UTF-8 string (0x00..0x17 bytes follow)\n    UTF8_STRING, // 0x60\n    UTF8_STRING, // 0x61\n    UTF8_STRING, // 0x62\n    UTF8_STRING, // 0x63\n    UTF8_STRING, // 0x64\n    UTF8_STRING, // 0x65\n    UTF8_STRING, // 0x66\n    UTF8_STRING, // 0x67\n    UTF8_STRING, // 0x68\n    UTF8_STRING, // 0x69\n    UTF8_STRING, // 0x6A\n    UTF8_STRING, // 0x6B\n    UTF8_STRING, // 0x6C\n    UTF8_STRING, // 0x6D\n    UTF8_STRING, // 0x6E\n    UTF8_STRING, // 0x6F\n    UTF8_STRING, // 0x70\n    UTF8_STRING, // 0x71\n    UTF8_STRING, // 0x72\n    UTF8_STRING, // 0x73\n    UTF8_STRING, // 0x74\n    UTF8_STRING, // 0x75\n    UTF8_STRING, // 0x76\n    UTF8_STRING, // 0x77\n    // UTF-8 string (one-byte uint8_t for n, and then n bytes follow)\n    UTF8_STRING_8, // 0x78\n    // UTF-8 string (two-byte uint16_t for n, and then n bytes follow)\n    UTF8_STRING_16, // 0x79\n    // UTF-8 string (four-byte uint32_t for n, and then n bytes follow)\n    UTF8_STRING_32, // 0x7a\n    // UTF-8 string (eight-byte uint64_t for n, and then n bytes follow)\n    UTF8_STRING_64, // 0x7b\n    // UTF-8 string, UTF-8 strings follow, terminated by \"break\"\n    ERROR, // 0x7c\n    ERROR, // 0x7d\n    ERROR, // 0x7e\n    UTF8_STRING_BREAK, // 0x7f\n    // array (0x00..0x17 data items follow)\n    ARRAY, // 0x80\n    ARRAY, // 0x81\n    ARRAY, // 0x82\n    ARRAY, // 0x83\n    ARRAY, // 0x84\n    ARRAY, // 0x85\n    ARRAY, // 0x86\n    ARRAY, // 0x87\n    ARRAY, // 0x88\n    ARRAY, // 0x89\n    ARRAY, // 0x8A\n    ARRAY, // 0x8B\n    ARRAY, // 0x8C\n    ARRAY, // 0x8D\n    ARRAY, // 0x8E\n    ARRAY, // 0x8F\n    ARRAY, // 0x90\n    ARRAY, // 0x91\n    ARRAY, // 0x92\n    ARRAY, // 0x93\n    ARRAY, // 0x94\n    ARRAY, // 0x95\n    ARRAY, // 0x96\n    ARRAY, // 0x97\n    // array (one-byte uint8_t fo, and then n data items follow)\n    ARRAY_8, // 0x98\n    // array (two-byte uint16_t for n, and then n data items follow)\n    ARRAY_16, // 0x99\n    // array (four-byte uint32_t for n, and then n data items follow)\n    ARRAY_32, // 0x9a\n    // array (eight-byte uint64_t for n, and then n data items follow)\n    ARRAY_64, // 0x9b\n    // array, data items follow, terminated by \"break\"\n    ERROR, // 0x9c\n    ERROR, // 0x9d\n    ERROR, // 0x9e\n    ARRAY_BREAK, // 0x9f\n    // map (0x00..0x17 pairs of data items follow)\n    MAP, // 0xa0\n    MAP, // 0xa1\n    MAP, // 0xa2\n    MAP, // 0xa3\n    MAP, // 0xa4\n    MAP, // 0xa5\n    MAP, // 0xa6\n    MAP, // 0xa7\n    MAP, // 0xa8\n    MAP, // 0xa9\n    MAP, // 0xaA\n    MAP, // 0xaB\n    MAP, // 0xaC\n    MAP, // 0xaD\n    MAP, // 0xaE\n    MAP, // 0xaF\n    MAP, // 0xb0\n    MAP, // 0xb1\n    MAP, // 0xb2\n    MAP, // 0xb3\n    MAP, // 0xb4\n    MAP, // 0xb5\n    MAP, // 0xb6\n    MAP, // 0xb7\n    // map (one-byte uint8_t for n, and then n pairs of data items follow)\n    MAP_8, // 0xb8\n    // map (two-byte uint16_t for n, and then n pairs of data items follow)\n    MAP_16, // 0xb9\n    // map (four-byte uint32_t for n, and then n pairs of data items follow)\n    MAP_32, // 0xba\n    // map (eight-byte uint64_t for n, and then n pairs of data items follow)\n    MAP_64, // 0xbb\n    ERROR, // 0xbc\n    ERROR, // 0xbd\n    ERROR, // 0xbe\n    // map, pairs of data items follow, terminated by \"break\"\n    MAP_BREAK, // 0xbf\n    // Text-based date/time (data item follows; see Section 2.4.1)\n    TAG_KNOWN, // 0xc0\n    // Epoch-based date/time (data item follows; see Section 2.4.1)\n    TAG_KNOWN, // 0xc1\n    // Positive bignum (data item \"byte string\" follows)\n    TAG_KNOWN, // 0xc2\n    // Negative bignum (data item \"byte string\" follows)\n    TAG_KNOWN, // 0xc3\n    // Decimal Fraction (data item \"array\" follows; see Section 2.4.3)\n    TAG_KNOWN, // 0xc4\n    // Bigfloat (data item \"array\" follows; see Section 2.4.3)\n    TAG_KNOWN, // 0xc5\n    // (tagged item)\n    TAG_UNASSIGNED, // 0xc6\n    TAG_UNASSIGNED, // 0xc7\n    TAG_UNASSIGNED, // 0xc8\n    TAG_UNASSIGNED, // 0xc9\n    TAG_UNASSIGNED, // 0xca\n    TAG_UNASSIGNED, // 0xcb\n    TAG_UNASSIGNED, // 0xcc\n    TAG_UNASSIGNED, // 0xcd\n    TAG_UNASSIGNED, // 0xce\n    TAG_UNASSIGNED, // 0xcf\n    TAG_UNASSIGNED, // 0xd0\n    TAG_UNASSIGNED, // 0xd1\n    TAG_UNASSIGNED, // 0xd2\n    TAG_UNASSIGNED, // 0xd3\n    TAG_UNASSIGNED, // 0xd4\n    // Expected Conversion (data item follows; see Section 2.4.4.2)\n    TAG_UNASSIGNED, // 0xd5\n    TAG_UNASSIGNED, // 0xd6\n    TAG_UNASSIGNED, // 0xd7\n    // (more tagged items, 1/2/4/8 bytes and then a data item follow)\n    TAG_MORE_1, // 0xd8\n    TAG_MORE_2, // 0xd9\n    TAG_MORE_4, // 0xda\n    TAG_MORE_8, // 0xdb\n    ERROR, // 0xdc\n    ERROR, // 0xdd\n    ERROR, // 0xde\n    ERROR, // 0xdf\n    // (simple value)\n    SIMPLE_UNASSIGNED, // 0xe0\n    SIMPLE_UNASSIGNED, // 0xe1\n    SIMPLE_UNASSIGNED, // 0xe2\n    SIMPLE_UNASSIGNED, // 0xe3\n    SIMPLE_UNASSIGNED, // 0xe4\n    SIMPLE_UNASSIGNED, // 0xe5\n    SIMPLE_UNASSIGNED, // 0xe6\n    SIMPLE_UNASSIGNED, // 0xe7\n    SIMPLE_UNASSIGNED, // 0xe8\n    SIMPLE_UNASSIGNED, // 0xe9\n    SIMPLE_UNASSIGNED, // 0xea\n    SIMPLE_UNASSIGNED, // 0xeb\n    SIMPLE_UNASSIGNED, // 0xec\n    SIMPLE_UNASSIGNED, // 0xed\n    SIMPLE_UNASSIGNED, // 0xee\n    SIMPLE_UNASSIGNED, // 0xef\n    SIMPLE_UNASSIGNED, // 0xf0\n    SIMPLE_UNASSIGNED, // 0xf1\n    SIMPLE_UNASSIGNED, // 0xf2\n    SIMPLE_UNASSIGNED, // 0xf3\n    // False\n    SIMPLE_FALSE, // 0xf4\n    // True\n    SIMPLE_TRUE, // 0xf5\n    // Null\n    SIMPLE_NULL, // 0xf6\n    // Undefined\n    SIMPLE_UNDEFINED, // 0xf7\n    // (simple value, one byte follows)\n    SIMPLE_BYTE, // 0xf8\n    // Half-Precision Float (two-byte IEEE 754)\n    SIMPLE_FLOAT_HALF, // 0xf9\n    // Single-Precision Float (four-byte IEEE 754)\n    SIMPLE_FLOAT_SINGLE, // 0xfa\n    // Double-Precision Float (eight-byte IEEE 754)\n    SIMPLE_FLOAT_DOUBLE, // 0xfb\n    ERROR, // 0xfc\n    ERROR, // 0xfd\n    ERROR, // 0xfe\n    // \"break\" stop code\n    BREAK // 0xff\n  ]\n\n  // --\n\n  return {\n    parse: parse\n  }\n}\n","'use strict'\n\nconst { Buffer } = require('buffer')\nconst Bignumber = require('bignumber.js').BigNumber\n\nconst constants = require('./constants')\nconst SHIFT32 = constants.SHIFT32\nconst SHIFT16 = constants.SHIFT16\nconst MAX_SAFE_HIGH = 0x1fffff\n\nexports.parseHalf = function parseHalf (buf) {\n  var exp, mant, sign\n  sign = buf[0] & 0x80 ? -1 : 1\n  exp = (buf[0] & 0x7C) >> 2\n  mant = ((buf[0] & 0x03) << 8) | buf[1]\n  if (!exp) {\n    return sign * 5.9604644775390625e-8 * mant\n  } else if (exp === 0x1f) {\n    return sign * (mant ? 0 / 0 : 2e308)\n  } else {\n    return sign * Math.pow(2, exp - 25) * (1024 + mant)\n  }\n}\n\nfunction toHex (n) {\n  if (n < 16) {\n    return '0' + n.toString(16)\n  }\n\n  return n.toString(16)\n}\n\nexports.arrayBufferToBignumber = function (buf) {\n  const len = buf.byteLength\n  let res = ''\n  for (let i = 0; i < len; i++) {\n    res += toHex(buf[i])\n  }\n\n  return new Bignumber(res, 16)\n}\n\n// convert an Object into a Map\nexports.buildMap = (obj) => {\n  const res = new Map()\n  const keys = Object.keys(obj)\n  const length = keys.length\n  for (let i = 0; i < length; i++) {\n    res.set(keys[i], obj[keys[i]])\n  }\n  return res\n}\n\nexports.buildInt32 = (f, g) => {\n  return f * SHIFT16 + g\n}\n\nexports.buildInt64 = (f1, f2, g1, g2) => {\n  const f = exports.buildInt32(f1, f2)\n  const g = exports.buildInt32(g1, g2)\n\n  if (f > MAX_SAFE_HIGH) {\n    return new Bignumber(f).times(SHIFT32).plus(g)\n  } else {\n    return (f * SHIFT32) + g\n  }\n}\n\nexports.writeHalf = function writeHalf (buf, half) {\n  // assume 0, -0, NaN, Infinity, and -Infinity have already been caught\n\n  // HACK: everyone settle in.  This isn't going to be pretty.\n  // Translate cn-cbor's C code (from Carsten Borman):\n\n  // uint32_t be32;\n  // uint16_t be16, u16;\n  // union {\n  //   float f;\n  //   uint32_t u;\n  // } u32;\n  // u32.f = float_val;\n\n  const u32 = Buffer.allocUnsafe(4)\n  u32.writeFloatBE(half, 0)\n  const u = u32.readUInt32BE(0)\n\n  // if ((u32.u & 0x1FFF) == 0) { /* worth trying half */\n\n  // hildjj: If the lower 13 bits are 0, we won't lose anything in the conversion\n  if ((u & 0x1FFF) !== 0) {\n    return false\n  }\n\n  //   int s16 = (u32.u >> 16) & 0x8000;\n  //   int exp = (u32.u >> 23) & 0xff;\n  //   int mant = u32.u & 0x7fffff;\n\n  var s16 = (u >> 16) & 0x8000 // top bit is sign\n  const exp = (u >> 23) & 0xff // then 5 bits of exponent\n  const mant = u & 0x7fffff\n\n  //   if (exp == 0 && mant == 0)\n  //     ;              /* 0.0, -0.0 */\n\n  // hildjj: zeros already handled.  Assert if you don't believe me.\n\n  //   else if (exp >= 113 && exp <= 142) /* normalized */\n  //     s16 += ((exp - 112) << 10) + (mant >> 13);\n  if ((exp >= 113) && (exp <= 142)) {\n    s16 += ((exp - 112) << 10) + (mant >> 13)\n\n  //   else if (exp >= 103 && exp < 113) { /* denorm, exp16 = 0 */\n  //     if (mant & ((1 << (126 - exp)) - 1))\n  //       goto float32;         /* loss of precision */\n  //     s16 += ((mant + 0x800000) >> (126 - exp));\n  } else if ((exp >= 103) && (exp < 113)) {\n    if (mant & ((1 << (126 - exp)) - 1)) {\n      return false\n    }\n    s16 += ((mant + 0x800000) >> (126 - exp))\n\n    //   } else if (exp == 255 && mant == 0) { /* Inf */\n    //     s16 += 0x7c00;\n\n    // hildjj: Infinity already handled\n\n  //   } else\n  //     goto float32;           /* loss of range */\n  } else {\n    return false\n  }\n\n  //   ensure_writable(3);\n  //   u16 = s16;\n  //   be16 = hton16p((const uint8_t*)&u16);\n  buf.writeUInt16BE(s16, 0)\n  return true\n}\n\nexports.keySorter = function (a, b) {\n  var lenA = a[0].byteLength\n  var lenB = b[0].byteLength\n\n  if (lenA > lenB) {\n    return 1\n  }\n\n  if (lenB > lenA) {\n    return -1\n  }\n\n  return a[0].compare(b[0])\n}\n\n// Adapted from http://www.2ality.com/2012/03/signedzero.html\nexports.isNegativeZero = (x) => {\n  return x === 0 && (1 / x < 0)\n}\n\nexports.nextPowerOf2 = (n) => {\n  let count = 0\n  // First n in the below condition is for\n  // the case where n is 0\n  if (n && !(n & (n - 1))) {\n    return n\n  }\n\n  while (n !== 0) {\n    n >>= 1\n    count += 1\n  }\n\n  return 1 << count\n}\n","'use strict'\n\nconst Bignumber = require('bignumber.js').BigNumber\n\nexports.MT = {\n  POS_INT: 0,\n  NEG_INT: 1,\n  BYTE_STRING: 2,\n  UTF8_STRING: 3,\n  ARRAY: 4,\n  MAP: 5,\n  TAG: 6,\n  SIMPLE_FLOAT: 7\n}\n\nexports.TAG = {\n  DATE_STRING: 0,\n  DATE_EPOCH: 1,\n  POS_BIGINT: 2,\n  NEG_BIGINT: 3,\n  DECIMAL_FRAC: 4,\n  BIGFLOAT: 5,\n  BASE64URL_EXPECTED: 21,\n  BASE64_EXPECTED: 22,\n  BASE16_EXPECTED: 23,\n  CBOR: 24,\n  URI: 32,\n  BASE64URL: 33,\n  BASE64: 34,\n  REGEXP: 35,\n  MIME: 36\n}\n\nexports.NUMBYTES = {\n  ZERO: 0,\n  ONE: 24,\n  TWO: 25,\n  FOUR: 26,\n  EIGHT: 27,\n  INDEFINITE: 31\n}\n\nexports.SIMPLE = {\n  FALSE: 20,\n  TRUE: 21,\n  NULL: 22,\n  UNDEFINED: 23\n}\n\nexports.SYMS = {\n  NULL: Symbol('null'),\n  UNDEFINED: Symbol('undef'),\n  PARENT: Symbol('parent'),\n  BREAK: Symbol('break'),\n  STREAM: Symbol('stream')\n}\n\nexports.SHIFT32 = Math.pow(2, 32)\nexports.SHIFT16 = Math.pow(2, 16)\n\nexports.MAX_SAFE_HIGH = 0x1fffff\nexports.NEG_ONE = new Bignumber(-1)\nexports.TEN = new Bignumber(10)\nexports.TWO = new Bignumber(2)\n\nexports.PARENT = {\n  ARRAY: 0,\n  OBJECT: 1,\n  MAP: 2,\n  TAG: 3,\n  BYTE_STRING: 4,\n  UTF8_STRING: 5\n}\n","'use strict'\n\nconst constants = require('./constants')\nconst MT = constants.MT\nconst SIMPLE = constants.SIMPLE\nconst SYMS = constants.SYMS\n\n/**\n * A CBOR Simple Value that does not map onto a known constant.\n */\nclass Simple {\n  /**\n   * Creates an instance of Simple.\n   *\n   * @param {integer} value - the simple value's integer value\n   */\n  constructor (value) {\n    if (typeof value !== 'number') {\n      throw new Error('Invalid Simple type: ' + (typeof value))\n    }\n    if ((value < 0) || (value > 255) || ((value | 0) !== value)) {\n      throw new Error('value must be a small positive integer: ' + value)\n    }\n    this.value = value\n  }\n\n  /**\n   * Debug string for simple value\n   *\n   * @returns {string} simple(value)\n   */\n  toString () {\n    return 'simple(' + this.value + ')'\n  }\n\n  /**\n   * Debug string for simple value\n   *\n   * @returns {string} simple(value)\n   */\n  inspect () {\n    return 'simple(' + this.value + ')'\n  }\n\n  /**\n   * Push the simple value onto the CBOR stream\n   *\n   * @param {cbor.Encoder} gen The generator to push onto\n   * @returns {number}\n   */\n  encodeCBOR (gen) {\n    return gen._pushInt(this.value, MT.SIMPLE_FLOAT)\n  }\n\n  /**\n   * Is the given object a Simple?\n   *\n   * @param {any} obj - object to test\n   * @returns {bool} - is it Simple?\n   */\n  static isSimple (obj) {\n    return obj instanceof Simple\n  }\n\n  /**\n   * Decode from the CBOR additional information into a JavaScript value.\n   * If the CBOR item has no parent, return a \"safe\" symbol instead of\n   * `null` or `undefined`, so that the value can be passed through a\n   * stream in object mode.\n   *\n   * @param {Number} val - the CBOR additional info to convert\n   * @param {bool} hasParent - Does the CBOR item have a parent?\n   * @returns {(null|undefined|Boolean|Symbol)} - the decoded value\n   */\n  static decode (val, hasParent) {\n    if (hasParent == null) {\n      hasParent = true\n    }\n    switch (val) {\n      case SIMPLE.FALSE:\n        return false\n      case SIMPLE.TRUE:\n        return true\n      case SIMPLE.NULL:\n        if (hasParent) {\n          return null\n        } else {\n          return SYMS.NULL\n        }\n      case SIMPLE.UNDEFINED:\n        if (hasParent) {\n          return undefined\n        } else {\n          return SYMS.UNDEFINED\n        }\n      case -1:\n        if (!hasParent) {\n          throw new Error('Invalid BREAK')\n        }\n        return SYMS.BREAK\n      default:\n        return new Simple(val)\n    }\n  }\n}\n\nmodule.exports = Simple\n","'use strict'\n\n/**\n * A CBOR tagged item, where the tag does not have semantics specified at the\n * moment, or those semantics threw an error during parsing. Typically this will\n * be an extension point you're not yet expecting.\n */\nclass Tagged {\n  /**\n   * Creates an instance of Tagged.\n   *\n   * @param {Number} tag - the number of the tag\n   * @param {any} value - the value inside the tag\n   * @param {Error} err - the error that was thrown parsing the tag, or null\n   */\n  constructor (tag, value, err) {\n    this.tag = tag\n    this.value = value\n    this.err = err\n    if (typeof this.tag !== 'number') {\n      throw new Error('Invalid tag type (' + (typeof this.tag) + ')')\n    }\n    if ((this.tag < 0) || ((this.tag | 0) !== this.tag)) {\n      throw new Error('Tag must be a positive integer: ' + this.tag)\n    }\n  }\n\n  /**\n   * Convert to a String\n   *\n   * @returns {String} string of the form '1(2)'\n   */\n  toString () {\n    return `${this.tag}(${JSON.stringify(this.value)})`\n  }\n\n  /**\n   * Push the simple value onto the CBOR stream\n   *\n   * @param {cbor.Encoder} gen The generator to push onto\n   * @returns {number}\n   */\n  encodeCBOR (gen) {\n    gen._pushTag(this.tag)\n    return gen.pushAny(this.value)\n  }\n\n  /**\n   * If we have a converter for this type, do the conversion.  Some converters\n   * are built-in.  Additional ones can be passed in.  If you want to remove\n   * a built-in converter, pass a converter in whose value is 'null' instead\n   * of a function.\n   *\n   * @param {Object} converters - keys in the object are a tag number, the value\n   *   is a function that takes the decoded CBOR and returns a JavaScript value\n   *   of the appropriate type.  Throw an exception in the function on errors.\n   * @returns {any} - the converted item\n   */\n  convert (converters) {\n    var er, f\n    f = converters != null ? converters[this.tag] : undefined\n    if (typeof f !== 'function') {\n      f = Tagged['_tag' + this.tag]\n      if (typeof f !== 'function') {\n        return this\n      }\n    }\n    try {\n      return f.call(Tagged, this.value)\n    } catch (error) {\n      er = error\n      this.err = er\n      return this\n    }\n  }\n}\n\nmodule.exports = Tagged\n","'use strict';\n\nconst {\n    URLWithLegacySupport,\n    format,\n    URLSearchParams,\n    defaultBase\n} = require('./src/url');\nconst relative = require('./src/relative');\n\nmodule.exports = {\n    URL: URLWithLegacySupport,\n    URLSearchParams,\n    format,\n    relative,\n    defaultBase\n};\n","'use strict';\n\nconst defaultBase = self.location ?\n    self.location.protocol + '//' + self.location.host :\n    '';\nconst URL = self.URL;\n\nclass URLWithLegacySupport {\n    constructor(url = '', base = defaultBase) {\n        this.super = new URL(url, base);\n        this.path = this.pathname + this.search;\n        this.auth =\n            this.username && this.password ?\n                this.username + ':' + this.password :\n                null;\n\n        this.query =\n            this.search && this.search.startsWith('?') ?\n                this.search.slice(1) :\n                null;\n    }\n\n    get hash() {\n        return this.super.hash;\n    }\n    get host() {\n        return this.super.host;\n    }\n    get hostname() {\n        return this.super.hostname;\n    }\n    get href() {\n        return this.super.href;\n    }\n    get origin() {\n        return this.super.origin;\n    }\n    get password() {\n        return this.super.password;\n    }\n    get pathname() {\n        return this.super.pathname;\n    }\n    get port() {\n        return this.super.port;\n    }\n    get protocol() {\n        return this.super.protocol;\n    }\n    get search() {\n        return this.super.search;\n    }\n    get searchParams() {\n        return this.super.searchParams;\n    }\n    get username() {\n        return this.super.username;\n    }\n\n    set hash(hash) {\n        this.super.hash = hash;\n    }\n    set host(host) {\n        this.super.host = host;\n    }\n    set hostname(hostname) {\n        this.super.hostname = hostname;\n    }\n    set href(href) {\n        this.super.href = href;\n    }\n    set origin(origin) {\n        this.super.origin = origin;\n    }\n    set password(password) {\n        this.super.password = password;\n    }\n    set pathname(pathname) {\n        this.super.pathname = pathname;\n    }\n    set port(port) {\n        this.super.port = port;\n    }\n    set protocol(protocol) {\n        this.super.protocol = protocol;\n    }\n    set search(search) {\n        this.super.search = search;\n    }\n    set searchParams(searchParams) {\n        this.super.searchParams = searchParams;\n    }\n    set username(username) {\n        this.super.username = username;\n    }\n\n    createObjectURL(o) {\n        return this.super.createObjectURL(o);\n    }\n    revokeObjectURL(o) {\n        this.super.revokeObjectURL(o);\n    }\n    toJSON() {\n        return this.super.toJSON();\n    }\n    toString() {\n        return this.super.toString();\n    }\n    format() {\n        return this.toString();\n    }\n}\n\nfunction format(obj) {\n    if (typeof obj === 'string') {\n        const url = new URL(obj);\n\n        return url.toString();\n    }\n\n    if (!(obj instanceof URL)) {\n        const userPass =\n            obj.username && obj.password ?\n                `${obj.username}:${obj.password}@` :\n                '';\n        const auth = obj.auth ? obj.auth + '@' : '';\n        const port = obj.port ? ':' + obj.port : '';\n        const protocol = obj.protocol ? obj.protocol + '//' : '';\n        const host = obj.host || '';\n        const hostname = obj.hostname || '';\n        const search = obj.search || (obj.query ? '?' + obj.query : '');\n        const hash = obj.hash || '';\n        const pathname = obj.pathname || '';\n        const path = obj.path || pathname + search;\n\n        return `${protocol}${userPass || auth}${host ||\n            hostname + port}${path}${hash}`;\n    }\n}\n\nmodule.exports = {\n    URLWithLegacySupport,\n    URLSearchParams: self.URLSearchParams,\n    defaultBase,\n    format\n};\n","'use strict';\n\nconst { URLWithLegacySupport, format } = require('./url');\n\nmodule.exports = (url, location = {}, protocolMap = {}, defaultProtocol) => {\n    let protocol = location.protocol ?\n        location.protocol.replace(':', '') :\n        'http';\n\n    // Check protocol map\n    protocol = (protocolMap[protocol] || defaultProtocol || protocol) + ':';\n    let urlParsed;\n\n    try {\n        urlParsed = new URLWithLegacySupport(url);\n    } catch (err) {\n        urlParsed = {};\n    }\n\n    const base = Object.assign({}, location, {\n        protocol: protocol || urlParsed.protocol,\n        host: location.host || urlParsed.host\n    });\n\n    return new URLWithLegacySupport(url, format(base)).toString();\n};\n","'use strict'\n\nconst { Buffer } = require('buffer')\nconst { URL } = require('iso-url')\nconst Bignumber = require('bignumber.js').BigNumber\n\nconst utils = require('./utils')\nconst constants = require('./constants')\nconst MT = constants.MT\nconst NUMBYTES = constants.NUMBYTES\nconst SHIFT32 = constants.SHIFT32\nconst SYMS = constants.SYMS\nconst TAG = constants.TAG\nconst HALF = (constants.MT.SIMPLE_FLOAT << 5) | constants.NUMBYTES.TWO\nconst FLOAT = (constants.MT.SIMPLE_FLOAT << 5) | constants.NUMBYTES.FOUR\nconst DOUBLE = (constants.MT.SIMPLE_FLOAT << 5) | constants.NUMBYTES.EIGHT\nconst TRUE = (constants.MT.SIMPLE_FLOAT << 5) | constants.SIMPLE.TRUE\nconst FALSE = (constants.MT.SIMPLE_FLOAT << 5) | constants.SIMPLE.FALSE\nconst UNDEFINED = (constants.MT.SIMPLE_FLOAT << 5) | constants.SIMPLE.UNDEFINED\nconst NULL = (constants.MT.SIMPLE_FLOAT << 5) | constants.SIMPLE.NULL\n\nconst MAXINT_BN = new Bignumber('0x20000000000000')\nconst BUF_NAN = Buffer.from('f97e00', 'hex')\nconst BUF_INF_NEG = Buffer.from('f9fc00', 'hex')\nconst BUF_INF_POS = Buffer.from('f97c00', 'hex')\n\nfunction toType (obj) {\n  // [object Type]\n  // --------8---1\n  return ({}).toString.call(obj).slice(8, -1)\n}\n\n/**\n * Transform JavaScript values into CBOR bytes\n *\n */\nclass Encoder {\n  /**\n   * @param {Object} [options={}]\n   * @param {function(Buffer)} options.stream\n   */\n  constructor (options) {\n    options = options || {}\n\n    this.streaming = typeof options.stream === 'function'\n    this.onData = options.stream\n\n    this.semanticTypes = [\n      [URL, this._pushUrl],\n      [Bignumber, this._pushBigNumber]\n    ]\n\n    const addTypes = options.genTypes || []\n    const len = addTypes.length\n    for (let i = 0; i < len; i++) {\n      this.addSemanticType(\n        addTypes[i][0],\n        addTypes[i][1]\n      )\n    }\n\n    this._reset()\n  }\n\n  addSemanticType (type, fun) {\n    const len = this.semanticTypes.length\n    for (let i = 0; i < len; i++) {\n      const typ = this.semanticTypes[i][0]\n      if (typ === type) {\n        const old = this.semanticTypes[i][1]\n        this.semanticTypes[i][1] = fun\n        return old\n      }\n    }\n    this.semanticTypes.push([type, fun])\n    return null\n  }\n\n  push (val) {\n    if (!val) {\n      return true\n    }\n\n    this.result[this.offset] = val\n    this.resultMethod[this.offset] = 0\n    this.resultLength[this.offset] = val.length\n    this.offset++\n\n    if (this.streaming) {\n      this.onData(this.finalize())\n    }\n\n    return true\n  }\n\n  pushWrite (val, method, len) {\n    this.result[this.offset] = val\n    this.resultMethod[this.offset] = method\n    this.resultLength[this.offset] = len\n    this.offset++\n\n    if (this.streaming) {\n      this.onData(this.finalize())\n    }\n\n    return true\n  }\n\n  _pushUInt8 (val) {\n    return this.pushWrite(val, 1, 1)\n  }\n\n  _pushUInt16BE (val) {\n    return this.pushWrite(val, 2, 2)\n  }\n\n  _pushUInt32BE (val) {\n    return this.pushWrite(val, 3, 4)\n  }\n\n  _pushDoubleBE (val) {\n    return this.pushWrite(val, 4, 8)\n  }\n\n  _pushNaN () {\n    return this.push(BUF_NAN)\n  }\n\n  _pushInfinity (obj) {\n    const half = (obj < 0) ? BUF_INF_NEG : BUF_INF_POS\n    return this.push(half)\n  }\n\n  _pushFloat (obj) {\n    const b2 = Buffer.allocUnsafe(2)\n\n    if (utils.writeHalf(b2, obj)) {\n      if (utils.parseHalf(b2) === obj) {\n        return this._pushUInt8(HALF) && this.push(b2)\n      }\n    }\n\n    const b4 = Buffer.allocUnsafe(4)\n    b4.writeFloatBE(obj, 0)\n    if (b4.readFloatBE(0) === obj) {\n      return this._pushUInt8(FLOAT) && this.push(b4)\n    }\n\n    return this._pushUInt8(DOUBLE) && this._pushDoubleBE(obj)\n  }\n\n  _pushInt (obj, mt, orig) {\n    const m = mt << 5\n    if (obj < 24) {\n      return this._pushUInt8(m | obj)\n    }\n\n    if (obj <= 0xff) {\n      return this._pushUInt8(m | NUMBYTES.ONE) && this._pushUInt8(obj)\n    }\n\n    if (obj <= 0xffff) {\n      return this._pushUInt8(m | NUMBYTES.TWO) && this._pushUInt16BE(obj)\n    }\n\n    if (obj <= 0xffffffff) {\n      return this._pushUInt8(m | NUMBYTES.FOUR) && this._pushUInt32BE(obj)\n    }\n\n    if (obj <= Number.MAX_SAFE_INTEGER) {\n      return this._pushUInt8(m | NUMBYTES.EIGHT) &&\n        this._pushUInt32BE(Math.floor(obj / SHIFT32)) &&\n        this._pushUInt32BE(obj % SHIFT32)\n    }\n\n    if (mt === MT.NEG_INT) {\n      return this._pushFloat(orig)\n    }\n\n    return this._pushFloat(obj)\n  }\n\n  _pushIntNum (obj) {\n    if (obj < 0) {\n      return this._pushInt(-obj - 1, MT.NEG_INT, obj)\n    } else {\n      return this._pushInt(obj, MT.POS_INT)\n    }\n  }\n\n  _pushNumber (obj) {\n    switch (false) {\n      case (obj === obj): // eslint-disable-line\n        return this._pushNaN(obj)\n      case isFinite(obj):\n        return this._pushInfinity(obj)\n      case ((obj % 1) !== 0):\n        return this._pushIntNum(obj)\n      default:\n        return this._pushFloat(obj)\n    }\n  }\n\n  _pushString (obj) {\n    const len = Buffer.byteLength(obj, 'utf8')\n    return this._pushInt(len, MT.UTF8_STRING) && this.pushWrite(obj, 5, len)\n  }\n\n  _pushBoolean (obj) {\n    return this._pushUInt8(obj ? TRUE : FALSE)\n  }\n\n  _pushUndefined (obj) {\n    return this._pushUInt8(UNDEFINED)\n  }\n\n  _pushArray (gen, obj) {\n    const len = obj.length\n    if (!gen._pushInt(len, MT.ARRAY)) {\n      return false\n    }\n    for (let j = 0; j < len; j++) {\n      if (!gen.pushAny(obj[j])) {\n        return false\n      }\n    }\n    return true\n  }\n\n  _pushTag (tag) {\n    return this._pushInt(tag, MT.TAG)\n  }\n\n  _pushDate (gen, obj) {\n    // Round date, to get seconds since 1970-01-01 00:00:00 as defined in\n    // Sec. 2.4.1 and get a possibly more compact encoding. Note that it is\n    // still allowed to encode fractions of seconds which can be achieved by\n    // changing overwriting the encode function for Date objects.\n    return gen._pushTag(TAG.DATE_EPOCH) && gen.pushAny(Math.round(obj / 1000))\n  }\n\n  _pushBuffer (gen, obj) {\n    return gen._pushInt(obj.length, MT.BYTE_STRING) && gen.push(obj)\n  }\n\n  _pushNoFilter (gen, obj) {\n    return gen._pushBuffer(gen, obj.slice())\n  }\n\n  _pushRegexp (gen, obj) {\n    return gen._pushTag(TAG.REGEXP) && gen.pushAny(obj.source)\n  }\n\n  _pushSet (gen, obj) {\n    if (!gen._pushInt(obj.size, MT.ARRAY)) {\n      return false\n    }\n    for (const x of obj) {\n      if (!gen.pushAny(x)) {\n        return false\n      }\n    }\n    return true\n  }\n\n  _pushUrl (gen, obj) {\n    return gen._pushTag(TAG.URI) && gen.pushAny(obj.format())\n  }\n\n  _pushBigint (obj) {\n    let tag = TAG.POS_BIGINT\n    if (obj.isNegative()) {\n      obj = obj.negated().minus(1)\n      tag = TAG.NEG_BIGINT\n    }\n    let str = obj.toString(16)\n    if (str.length % 2) {\n      str = '0' + str\n    }\n    const buf = Buffer.from(str, 'hex')\n    return this._pushTag(tag) && this._pushBuffer(this, buf)\n  }\n\n  _pushBigNumber (gen, obj) {\n    if (obj.isNaN()) {\n      return gen._pushNaN()\n    }\n    if (!obj.isFinite()) {\n      return gen._pushInfinity(obj.isNegative() ? -Infinity : Infinity)\n    }\n    if (obj.isInteger()) {\n      return gen._pushBigint(obj)\n    }\n    if (!(gen._pushTag(TAG.DECIMAL_FRAC) &&\n      gen._pushInt(2, MT.ARRAY))) {\n      return false\n    }\n\n    const dec = obj.decimalPlaces()\n    const slide = obj.multipliedBy(new Bignumber(10).pow(dec))\n    if (!gen._pushIntNum(-dec)) {\n      return false\n    }\n    if (slide.abs().isLessThan(MAXINT_BN)) {\n      return gen._pushIntNum(slide.toNumber())\n    } else {\n      return gen._pushBigint(slide)\n    }\n  }\n\n  _pushMap (gen, obj) {\n    if (!gen._pushInt(obj.size, MT.MAP)) {\n      return false\n    }\n\n    return this._pushRawMap(\n      obj.size,\n      Array.from(obj)\n    )\n  }\n\n  _pushObject (obj) {\n    if (!obj) {\n      return this._pushUInt8(NULL)\n    }\n\n    var len = this.semanticTypes.length\n    for (var i = 0; i < len; i++) {\n      if (obj instanceof this.semanticTypes[i][0]) {\n        return this.semanticTypes[i][1].call(obj, this, obj)\n      }\n    }\n\n    var f = obj.encodeCBOR\n    if (typeof f === 'function') {\n      return f.call(obj, this)\n    }\n\n    var keys = Object.keys(obj)\n    var keyLength = keys.length\n    if (!this._pushInt(keyLength, MT.MAP)) {\n      return false\n    }\n\n    return this._pushRawMap(\n      keyLength,\n      keys.map((k) => [k, obj[k]])\n    )\n  }\n\n  _pushRawMap (len, map) {\n    // Sort keys for canoncialization\n    // 1. encode key\n    // 2. shorter key comes before longer key\n    // 3. same length keys are sorted with lower\n    //    byte value before higher\n\n    map = map.map(function (a) {\n      a[0] = Encoder.encode(a[0])\n      return a\n    }).sort(utils.keySorter)\n\n    for (var j = 0; j < len; j++) {\n      if (!this.push(map[j][0])) {\n        return false\n      }\n\n      if (!this.pushAny(map[j][1])) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  /**\n   * Alias for `.pushAny`\n   *\n   * @param {*} obj\n   * @returns {boolean} true on success\n   */\n  write (obj) {\n    return this.pushAny(obj)\n  }\n\n  /**\n   * Push any supported type onto the encoded stream\n   *\n   * @param {any} obj\n   * @returns {boolean} true on success\n   */\n  pushAny (obj) {\n    var typ = toType(obj)\n\n    switch (typ) {\n      case 'Number':\n        return this._pushNumber(obj)\n      case 'String':\n        return this._pushString(obj)\n      case 'Boolean':\n        return this._pushBoolean(obj)\n      case 'Object':\n        return this._pushObject(obj)\n      case 'Array':\n        return this._pushArray(this, obj)\n      case 'Uint8Array':\n        return this._pushBuffer(this, Buffer.isBuffer(obj) ? obj : Buffer.from(obj))\n      case 'Null':\n        return this._pushUInt8(NULL)\n      case 'Undefined':\n        return this._pushUndefined(obj)\n      case 'Map':\n        return this._pushMap(this, obj)\n      case 'Set':\n        return this._pushSet(this, obj)\n      case 'URL':\n        return this._pushUrl(this, obj)\n      case 'BigNumber':\n        return this._pushBigNumber(this, obj)\n      case 'Date':\n        return this._pushDate(this, obj)\n      case 'RegExp':\n        return this._pushRegexp(this, obj)\n      case 'Symbol':\n        switch (obj) {\n          case SYMS.NULL:\n            return this._pushObject(null)\n          case SYMS.UNDEFINED:\n            return this._pushUndefined(undefined)\n          // TODO: Add pluggable support for other symbols\n          default:\n            throw new Error('Unknown symbol: ' + obj.toString())\n        }\n      default:\n        throw new Error('Unknown type: ' + typeof obj + ', ' + (obj ? obj.toString() : ''))\n    }\n  }\n\n  finalize () {\n    if (this.offset === 0) {\n      return null\n    }\n\n    var result = this.result\n    var resultLength = this.resultLength\n    var resultMethod = this.resultMethod\n    var offset = this.offset\n\n    // Determine the size of the buffer\n    var size = 0\n    var i = 0\n\n    for (; i < offset; i++) {\n      size += resultLength[i]\n    }\n\n    var res = Buffer.allocUnsafe(size)\n    var index = 0\n    var length = 0\n\n    // Write the content into the result buffer\n    for (i = 0; i < offset; i++) {\n      length = resultLength[i]\n\n      switch (resultMethod[i]) {\n        case 0:\n          result[i].copy(res, index)\n          break\n        case 1:\n          res.writeUInt8(result[i], index, true)\n          break\n        case 2:\n          res.writeUInt16BE(result[i], index, true)\n          break\n        case 3:\n          res.writeUInt32BE(result[i], index, true)\n          break\n        case 4:\n          res.writeDoubleBE(result[i], index, true)\n          break\n        case 5:\n          res.write(result[i], index, length, 'utf8')\n          break\n        default:\n          throw new Error('unkown method')\n      }\n\n      index += length\n    }\n\n    var tmp = res\n\n    this._reset()\n\n    return tmp\n  }\n\n  _reset () {\n    this.result = []\n    this.resultMethod = []\n    this.resultLength = []\n    this.offset = 0\n  }\n\n  /**\n   * Encode the given value\n   * @param {*} o\n   * @returns {Buffer}\n   */\n  static encode (o) {\n    const enc = new Encoder()\n    const ret = enc.pushAny(o)\n    if (!ret) {\n      throw new Error('Failed to encode input')\n    }\n\n    return enc.finalize()\n  }\n}\n\nmodule.exports = Encoder\n","var Node = require('./lib/node')\n\nmodule.exports = isCircular\n\n/**\n * checks whether the object is circular\n * @param  {object}  obj - object to check circularity for\n * @return {Boolean} true if obj is circular, false if it is not\n */\nfunction isCircular (obj) {\n  if (!(obj instanceof Object)) {\n    throw new TypeError('\"obj\" must be an object (or inherit from it)')\n  }\n  return _isCircular(obj)\n}\n\n/**\n * @private\n * checks whether the object is circular\n * @param  {object}  obj - object to check circularity for\n * @param  {Node}    parentList - linked-list that contains all the object's parents\n * @return {Boolean} true if obj is circular, false if it is not\n */\nfunction _isCircular (obj, parentList) {\n  parentList = new Node(obj, parentList)\n\n  // breadth-first search for circular object\n  for (var key in obj) {\n    var val = obj[key]\n    if (val instanceof Object) {\n      if (parentList.contains(val) || _isCircular(val, parentList)) {\n        return true\n      }\n    }\n  }\n\n  return false\n}\n","module.exports = Node\n\n/**\n * a linked-list node\n * @class\n * @param {any} value - node's value\n * @param {Node} next - next node\n */\nfunction Node (value, next) {\n  this.value = value\n  this.next = next\n}\n\n/**\n * checks if this node or any of its children has the value\n * @param {any} value - value to check if linked-list contains\n * @return {boolean} true if the list contains the value; false if not\n */\nNode.prototype.contains = function (value) {\n  var cursor = this\n\n  while (cursor) {\n    if (cursor.value === value) return true\n    cursor = cursor.next\n  }\n\n  return false\n}\n","'use strict'\n\nconst CID = require('cids')\nconst util = require('./util')\n\n/**\n * Resolves a path within a CBOR block.\n *\n * Returns the value or a link and the partial mising path. This way the\n * IPLD Resolver can fetch the link and continue to resolve.\n *\n * @param {Uint8Array} binaryBlob - Binary representation of a CBOR block\n * @param {string} [path='/'] - Path that should be resolved\n */\nexports.resolve = (binaryBlob, path) => {\n  let node = util.deserialize(binaryBlob)\n\n  const parts = path.split('/').filter(Boolean)\n  while (parts.length) {\n    const key = parts.shift()\n    if (node[key] === undefined) {\n      throw new Error(`Object has no property '${key}'`)\n    }\n\n    node = node[key]\n    if (CID.isCID(node)) {\n      return {\n        value: node,\n        remainderPath: parts.join('/')\n      }\n    }\n  }\n\n  return {\n    value: node,\n    remainderPath: ''\n  }\n}\n\nconst traverse = function * (node, path) {\n  // Traverse only objects and arrays\n  if (node instanceof Uint8Array || CID.isCID(node) || typeof node === 'string' ||\n      node === null) {\n    return\n  }\n  for (const item of Object.keys(node)) {\n    const nextpath = path === undefined ? item : path + '/' + item\n    yield nextpath\n    yield * traverse(node[item], nextpath)\n  }\n}\n\n/**\n * Return all available paths of a block.\n *\n * @generator\n * @param {Uint8Array} binaryBlob - Binary representation of a CBOR block\n * @yields {string} - A single path\n */\nexports.tree = function * (binaryBlob) {\n  const node = util.deserialize(binaryBlob)\n\n  yield * traverse(node)\n}\n","'use strict'\n\n/**\n * Returns the first result from an (async) iterable, unless empty, in which\n * case returns `undefined`.\n *\n * @template T\n * @param {AsyncIterable<T>|Iterable<T>} source\n */\nconst first = async (source) => {\n  for await (const entry of source) { // eslint-disable-line no-unreachable-loop\n    return entry\n  }\n\n  return undefined\n}\n\nmodule.exports = first\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar encode = require('./lib/encode.js');\nvar decode = require('./lib/decode.js');\nvar token = require('./lib/token.js');\n\n\n\nexports.encode = encode.encode;\nexports.decode = decode.decode;\nexports.Token = token.Token;\nexports.Type = token.Type;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar is = require('./is.js');\nvar token = require('./token.js');\nvar bl = require('./bl.js');\nvar common = require('./common.js');\nvar jump = require('./jump.js');\nvar byteUtils = require('./byte-utils.js');\nvar _0uint = require('./0uint.js');\nvar _1negint = require('./1negint.js');\nvar _2bytes = require('./2bytes.js');\nvar _3string = require('./3string.js');\nvar _4array = require('./4array.js');\nvar _5map = require('./5map.js');\nvar _6tag = require('./6tag.js');\nvar _7float = require('./7float.js');\n\nconst defaultEncodeOptions = {\n  float64: false,\n  mapSorter,\n  quickEncodeToken: jump.quickEncodeToken\n};\nconst cborEncoders = [];\ncborEncoders[token.Type.uint.major] = _0uint.encodeUint;\ncborEncoders[token.Type.negint.major] = _1negint.encodeNegint;\ncborEncoders[token.Type.bytes.major] = _2bytes.encodeBytes;\ncborEncoders[token.Type.string.major] = _3string.encodeString;\ncborEncoders[token.Type.array.major] = _4array.encodeArray;\ncborEncoders[token.Type.map.major] = _5map.encodeMap;\ncborEncoders[token.Type.tag.major] = _6tag.encodeTag;\ncborEncoders[token.Type.float.major] = _7float.encodeFloat;\nconst buf = new bl.Bl();\nclass Ref {\n  constructor(obj, parent) {\n    this.obj = obj;\n    this.parent = parent;\n  }\n  includes(obj) {\n    let p = this;\n    do {\n      if (p.obj === obj) {\n        return true;\n      }\n    } while (p = p.parent);\n    return false;\n  }\n  static createCheck(stack, obj) {\n    if (stack && stack.includes(obj)) {\n      throw new Error(`${ common.encodeErrPrefix } object contains circular references`);\n    }\n    return new Ref(obj, stack);\n  }\n}\nconst simpleTokens = {\n  null: new token.Token(token.Type.null, null),\n  undefined: new token.Token(token.Type.undefined, undefined),\n  true: new token.Token(token.Type.true, true),\n  false: new token.Token(token.Type.false, false),\n  emptyArray: new token.Token(token.Type.array, 0),\n  emptyMap: new token.Token(token.Type.map, 0)\n};\nconst typeEncoders = {\n  number(obj, _typ, _options, _refStack) {\n    if (!Number.isInteger(obj) || !Number.isSafeInteger(obj)) {\n      return new token.Token(token.Type.float, obj);\n    } else if (obj >= 0) {\n      return new token.Token(token.Type.uint, obj);\n    } else {\n      return new token.Token(token.Type.negint, obj);\n    }\n  },\n  bigint(obj, _typ, _options, _refStack) {\n    if (obj >= BigInt(0)) {\n      return new token.Token(token.Type.uint, obj);\n    } else {\n      return new token.Token(token.Type.negint, obj);\n    }\n  },\n  Uint8Array(obj, _typ, _options, _refStack) {\n    return new token.Token(token.Type.bytes, obj);\n  },\n  string(obj, _typ, _options, _refStack) {\n    return new token.Token(token.Type.string, obj);\n  },\n  boolean(obj, _typ, _options, _refStack) {\n    return obj ? simpleTokens.true : simpleTokens.false;\n  },\n  null(_obj, _typ, _options, _refStack) {\n    return simpleTokens.null;\n  },\n  undefined(_obj, _typ, _options, _refStack) {\n    return simpleTokens.undefined;\n  },\n  ArrayBuffer(obj, _typ, _options, _refStack) {\n    return new token.Token(token.Type.bytes, new Uint8Array(obj));\n  },\n  DataView(obj, _typ, _options, _refStack) {\n    return new token.Token(token.Type.bytes, new Uint8Array(obj.buffer, obj.byteOffset, obj.byteLength));\n  },\n  Array(obj, _typ, options, refStack) {\n    if (!obj.length) {\n      if (options.addBreakTokens === true) {\n        return [\n          simpleTokens.emptyArray,\n          new token.Token(token.Type.break)\n        ];\n      }\n      return simpleTokens.emptyArray;\n    }\n    refStack = Ref.createCheck(refStack, obj);\n    const entries = [];\n    let i = 0;\n    for (const e of obj) {\n      entries[i++] = objectToTokens(e, options, refStack);\n    }\n    if (options.addBreakTokens) {\n      return [\n        new token.Token(token.Type.array, obj.length),\n        entries,\n        new token.Token(token.Type.break)\n      ];\n    }\n    return [\n      new token.Token(token.Type.array, obj.length),\n      entries\n    ];\n  },\n  Object(obj, typ, options, refStack) {\n    const isMap = typ !== 'Object';\n    const keys = isMap ? obj.keys() : Object.keys(obj);\n    const length = isMap ? obj.size : keys.length;\n    if (!length) {\n      if (options.addBreakTokens === true) {\n        return [\n          simpleTokens.emptyMap,\n          new token.Token(token.Type.break)\n        ];\n      }\n      return simpleTokens.emptyMap;\n    }\n    refStack = Ref.createCheck(refStack, obj);\n    const entries = [];\n    let i = 0;\n    for (const key of keys) {\n      entries[i++] = [\n        objectToTokens(key, options, refStack),\n        objectToTokens(isMap ? obj.get(key) : obj[key], options, refStack)\n      ];\n    }\n    sortMapEntries(entries, options);\n    if (options.addBreakTokens) {\n      return [\n        new token.Token(token.Type.map, length),\n        entries,\n        new token.Token(token.Type.break)\n      ];\n    }\n    return [\n      new token.Token(token.Type.map, length),\n      entries\n    ];\n  }\n};\ntypeEncoders.Map = typeEncoders.Object;\ntypeEncoders.Buffer = typeEncoders.Uint8Array;\nfor (const typ of 'Uint8Clamped Uint16 Uint32 Int8 Int16 Int32 BigUint64 BigInt64 Float32 Float64'.split(' ')) {\n  typeEncoders[`${ typ }Array`] = typeEncoders.DataView;\n}\nfunction objectToTokens(obj, options = {}, refStack) {\n  const typ = is.is(obj);\n  const customTypeEncoder = options && options.typeEncoders && options.typeEncoders[typ] || typeEncoders[typ];\n  if (typeof customTypeEncoder === 'function') {\n    const tokens = customTypeEncoder(obj, typ, options, refStack);\n    if (tokens != null) {\n      return tokens;\n    }\n  }\n  const typeEncoder = typeEncoders[typ];\n  if (!typeEncoder) {\n    throw new Error(`${ common.encodeErrPrefix } unsupported type: ${ typ }`);\n  }\n  return typeEncoder(obj, typ, options, refStack);\n}\nfunction sortMapEntries(entries, options) {\n  if (options.mapSorter) {\n    entries.sort(options.mapSorter);\n  }\n}\nfunction mapSorter(e1, e2) {\n  const keyToken1 = Array.isArray(e1[0]) ? e1[0][0] : e1[0];\n  const keyToken2 = Array.isArray(e2[0]) ? e2[0][0] : e2[0];\n  if (keyToken1.type !== keyToken2.type) {\n    return keyToken1.type.compare(keyToken2.type);\n  }\n  const major = keyToken1.type.major;\n  const tcmp = cborEncoders[major].compareTokens(keyToken1, keyToken2);\n  if (tcmp === 0) {\n    console.warn('WARNING: complex key types used, CBOR key sorting guarantees are gone');\n  }\n  return tcmp;\n}\nfunction tokensToEncoded(buf, tokens, encoders, options) {\n  if (Array.isArray(tokens)) {\n    for (const token of tokens) {\n      tokensToEncoded(buf, token, encoders, options);\n    }\n  } else {\n    encoders[tokens.type.major](buf, tokens, options);\n  }\n}\nfunction encodeCustom(data, encoders, options) {\n  const tokens = objectToTokens(data, options);\n  if (!Array.isArray(tokens) && options.quickEncodeToken) {\n    const quickBytes = options.quickEncodeToken(tokens);\n    if (quickBytes) {\n      return quickBytes;\n    }\n    const encoder = encoders[tokens.type.major];\n    if (encoder.encodedSize) {\n      const size = encoder.encodedSize(tokens, options);\n      const buf = new bl.Bl(size);\n      encoder(buf, tokens, options);\n      if (buf.chunks.length !== 1) {\n        throw new Error(`Unexpected error: pre-calculated length for ${ tokens } was wrong`);\n      }\n      return byteUtils.asU8A(buf.chunks[0]);\n    }\n  }\n  tokensToEncoded(buf, tokens, encoders, options);\n  return buf.toBytes(true);\n}\nfunction encode(data, options) {\n  options = Object.assign({}, defaultEncodeOptions, options);\n  return encodeCustom(data, cborEncoders, options);\n}\n\nexports.Ref = Ref;\nexports.encode = encode;\nexports.encodeCustom = encodeCustom;\nexports.objectToTokens = objectToTokens;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nconst typeofs = [\n  'string',\n  'number',\n  'bigint',\n  'symbol'\n];\nconst objectTypeNames = [\n  'Function',\n  'Generator',\n  'AsyncGenerator',\n  'GeneratorFunction',\n  'AsyncGeneratorFunction',\n  'AsyncFunction',\n  'Observable',\n  'Array',\n  'Buffer',\n  'Object',\n  'RegExp',\n  'Date',\n  'Error',\n  'Map',\n  'Set',\n  'WeakMap',\n  'WeakSet',\n  'ArrayBuffer',\n  'SharedArrayBuffer',\n  'DataView',\n  'Promise',\n  'URL',\n  'HTMLElement',\n  'Int8Array',\n  'Uint8Array',\n  'Uint8ClampedArray',\n  'Int16Array',\n  'Uint16Array',\n  'Int32Array',\n  'Uint32Array',\n  'Float32Array',\n  'Float64Array',\n  'BigInt64Array',\n  'BigUint64Array'\n];\nfunction is(value) {\n  if (value === null) {\n    return 'null';\n  }\n  if (value === undefined) {\n    return 'undefined';\n  }\n  if (value === true || value === false) {\n    return 'boolean';\n  }\n  const typeOf = typeof value;\n  if (typeofs.includes(typeOf)) {\n    return typeOf;\n  }\n  if (typeOf === 'function') {\n    return 'Function';\n  }\n  if (Array.isArray(value)) {\n    return 'Array';\n  }\n  if (isBuffer(value)) {\n    return 'Buffer';\n  }\n  const objectType = getObjectType(value);\n  if (objectType) {\n    return objectType;\n  }\n  return 'Object';\n}\nfunction isBuffer(value) {\n  return value && value.constructor && value.constructor.isBuffer && value.constructor.isBuffer.call(null, value);\n}\nfunction getObjectType(value) {\n  const objectTypeName = Object.prototype.toString.call(value).slice(8, -1);\n  if (objectTypeNames.includes(objectTypeName)) {\n    return objectTypeName;\n  }\n  return undefined;\n}\n\nexports.is = is;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nclass Type {\n  constructor(major, name, terminal) {\n    this.major = major;\n    this.majorEncoded = major << 5;\n    this.name = name;\n    this.terminal = terminal;\n  }\n  toString() {\n    return `Type[${ this.major }].${ this.name }`;\n  }\n  compare(typ) {\n    return this.major < typ.major ? -1 : this.major > typ.major ? 1 : 0;\n  }\n}\nType.uint = new Type(0, 'uint', true);\nType.negint = new Type(1, 'negint', true);\nType.bytes = new Type(2, 'bytes', true);\nType.string = new Type(3, 'string', true);\nType.array = new Type(4, 'array', false);\nType.map = new Type(5, 'map', false);\nType.tag = new Type(6, 'tag', false);\nType.float = new Type(7, 'float', true);\nType.false = new Type(7, 'false', true);\nType.true = new Type(7, 'true', true);\nType.null = new Type(7, 'null', true);\nType.undefined = new Type(7, 'undefined', true);\nType.break = new Type(7, 'break', true);\nclass Token {\n  constructor(type, value, encodedLength) {\n    this.type = type;\n    this.value = value;\n    this.encodedLength = encodedLength;\n    this.encodedBytes = undefined;\n  }\n  toString() {\n    return `Token[${ this.type }].${ this.value }`;\n  }\n}\n\nexports.Token = Token;\nexports.Type = Type;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar byteUtils = require('./byte-utils.js');\n\nconst defaultChunkSize = 256;\nclass Bl {\n  constructor(chunkSize = defaultChunkSize) {\n    this.chunkSize = chunkSize;\n    this.cursor = 0;\n    this.maxCursor = -1;\n    this.chunks = [];\n    this._initReuseChunk = null;\n  }\n  reset() {\n    this.chunks = [];\n    this.cursor = 0;\n    this.maxCursor = -1;\n    if (this._initReuseChunk !== null) {\n      this.chunks.push(this._initReuseChunk);\n      this.maxCursor = this._initReuseChunk.length - 1;\n    }\n  }\n  push(bytes) {\n    let topChunk = this.chunks[this.chunks.length - 1];\n    const newMax = this.cursor + bytes.length;\n    if (newMax <= this.maxCursor + 1) {\n      const chunkPos = topChunk.length - (this.maxCursor - this.cursor) - 1;\n      topChunk.set(bytes, chunkPos);\n    } else {\n      if (topChunk) {\n        const chunkPos = topChunk.length - (this.maxCursor - this.cursor) - 1;\n        if (chunkPos < topChunk.length) {\n          this.chunks[this.chunks.length - 1] = topChunk.subarray(0, chunkPos);\n          this.maxCursor = this.cursor - 1;\n        }\n      }\n      if (bytes.length < 64 && bytes.length < this.chunkSize) {\n        topChunk = byteUtils.alloc(this.chunkSize);\n        this.chunks.push(topChunk);\n        this.maxCursor += topChunk.length;\n        if (this._initReuseChunk === null) {\n          this._initReuseChunk = topChunk;\n        }\n        topChunk.set(bytes, 0);\n      } else {\n        this.chunks.push(bytes);\n        this.maxCursor += bytes.length;\n      }\n    }\n    this.cursor += bytes.length;\n  }\n  toBytes(reset = false) {\n    let byts;\n    if (this.chunks.length === 1) {\n      const chunk = this.chunks[0];\n      if (reset && this.cursor > chunk.length / 2) {\n        byts = this.cursor === chunk.length ? chunk : chunk.subarray(0, this.cursor);\n        this._initReuseChunk = null;\n        this.chunks = [];\n      } else {\n        byts = byteUtils.slice(chunk, 0, this.cursor);\n      }\n    } else {\n      byts = byteUtils.concat(this.chunks, this.cursor);\n    }\n    if (reset) {\n      this.reset();\n    }\n    return byts;\n  }\n}\n\nexports.Bl = Bl;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nconst useBuffer = globalThis.process && !globalThis.process.browser && globalThis.Buffer && typeof globalThis.Buffer.isBuffer === 'function';\nconst textDecoder = new TextDecoder();\nconst textEncoder = new TextEncoder();\nfunction isBuffer(buf) {\n  return useBuffer && globalThis.Buffer.isBuffer(buf);\n}\nfunction asU8A(buf) {\n  if (!(buf instanceof Uint8Array)) {\n    return Uint8Array.from(buf);\n  }\n  return isBuffer(buf) ? new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength) : buf;\n}\nconst toString = useBuffer ? (bytes, start, end) => {\n  return end - start > 64 ? globalThis.Buffer.from(bytes.subarray(start, end)).toString('utf8') : utf8Slice(bytes, start, end);\n} : (bytes, start, end) => {\n  return end - start > 64 ? textDecoder.decode(bytes.subarray(start, end)) : utf8Slice(bytes, start, end);\n};\nconst fromString = useBuffer ? string => {\n  return string.length > 64 ? globalThis.Buffer.from(string) : utf8ToBytes(string);\n} : string => {\n  return string.length > 64 ? textEncoder.encode(string) : utf8ToBytes(string);\n};\nconst fromArray = arr => {\n  return Uint8Array.from(arr);\n};\nconst slice = useBuffer ? (bytes, start, end) => {\n  if (isBuffer(bytes)) {\n    return new Uint8Array(bytes.subarray(start, end));\n  }\n  return bytes.slice(start, end);\n} : (bytes, start, end) => {\n  return bytes.slice(start, end);\n};\nconst concat = useBuffer ? (chunks, length) => {\n  chunks = chunks.map(c => c instanceof Uint8Array ? c : globalThis.Buffer.from(c));\n  return asU8A(globalThis.Buffer.concat(chunks, length));\n} : (chunks, length) => {\n  const out = new Uint8Array(length);\n  let off = 0;\n  for (let b of chunks) {\n    if (off + b.length > out.length) {\n      b = b.subarray(0, out.length - off);\n    }\n    out.set(b, off);\n    off += b.length;\n  }\n  return out;\n};\nconst alloc = useBuffer ? size => {\n  return globalThis.Buffer.allocUnsafe(size);\n} : size => {\n  return new Uint8Array(size);\n};\nconst toHex = useBuffer ? d => {\n  if (typeof d === 'string') {\n    return d;\n  }\n  return globalThis.Buffer.from(toBytes(d)).toString('hex');\n} : d => {\n  if (typeof d === 'string') {\n    return d;\n  }\n  return Array.prototype.reduce.call(toBytes(d), (p, c) => `${ p }${ c.toString(16).padStart(2, '0') }`, '');\n};\nconst fromHex = useBuffer ? hex => {\n  if (hex instanceof Uint8Array) {\n    return hex;\n  }\n  return globalThis.Buffer.from(hex, 'hex');\n} : hex => {\n  if (hex instanceof Uint8Array) {\n    return hex;\n  }\n  if (!hex.length) {\n    return new Uint8Array(0);\n  }\n  return new Uint8Array(hex.split('').map((c, i, d) => i % 2 === 0 ? `0x${ c }${ d[i + 1] }` : '').filter(Boolean).map(e => parseInt(e, 16)));\n};\nfunction toBytes(obj) {\n  if (obj instanceof Uint8Array && obj.constructor.name === 'Uint8Array') {\n    return obj;\n  }\n  if (obj instanceof ArrayBuffer) {\n    return new Uint8Array(obj);\n  }\n  if (ArrayBuffer.isView(obj)) {\n    return new Uint8Array(obj.buffer, obj.byteOffset, obj.byteLength);\n  }\n  throw new Error('Unknown type, must be binary type');\n}\nfunction compare(b1, b2) {\n  if (isBuffer(b1) && isBuffer(b2)) {\n    return b1.compare(b2);\n  }\n  for (let i = 0; i < b1.length; i++) {\n    if (b1[i] === b2[i]) {\n      continue;\n    }\n    return b1[i] < b2[i] ? -1 : 1;\n  }\n  return 0;\n}\nfunction utf8ToBytes(string, units = Infinity) {\n  let codePoint;\n  const length = string.length;\n  let leadSurrogate = null;\n  const bytes = [];\n  for (let i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i);\n    if (codePoint > 55295 && codePoint < 57344) {\n      if (!leadSurrogate) {\n        if (codePoint > 56319) {\n          if ((units -= 3) > -1)\n            bytes.push(239, 191, 189);\n          continue;\n        } else if (i + 1 === length) {\n          if ((units -= 3) > -1)\n            bytes.push(239, 191, 189);\n          continue;\n        }\n        leadSurrogate = codePoint;\n        continue;\n      }\n      if (codePoint < 56320) {\n        if ((units -= 3) > -1)\n          bytes.push(239, 191, 189);\n        leadSurrogate = codePoint;\n        continue;\n      }\n      codePoint = (leadSurrogate - 55296 << 10 | codePoint - 56320) + 65536;\n    } else if (leadSurrogate) {\n      if ((units -= 3) > -1)\n        bytes.push(239, 191, 189);\n    }\n    leadSurrogate = null;\n    if (codePoint < 128) {\n      if ((units -= 1) < 0)\n        break;\n      bytes.push(codePoint);\n    } else if (codePoint < 2048) {\n      if ((units -= 2) < 0)\n        break;\n      bytes.push(codePoint >> 6 | 192, codePoint & 63 | 128);\n    } else if (codePoint < 65536) {\n      if ((units -= 3) < 0)\n        break;\n      bytes.push(codePoint >> 12 | 224, codePoint >> 6 & 63 | 128, codePoint & 63 | 128);\n    } else if (codePoint < 1114112) {\n      if ((units -= 4) < 0)\n        break;\n      bytes.push(codePoint >> 18 | 240, codePoint >> 12 & 63 | 128, codePoint >> 6 & 63 | 128, codePoint & 63 | 128);\n    } else {\n      throw new Error('Invalid code point');\n    }\n  }\n  return bytes;\n}\nfunction utf8Slice(buf, offset, end) {\n  const res = [];\n  while (offset < end) {\n    const firstByte = buf[offset];\n    let codePoint = null;\n    let bytesPerSequence = firstByte > 239 ? 4 : firstByte > 223 ? 3 : firstByte > 191 ? 2 : 1;\n    if (offset + bytesPerSequence <= end) {\n      let secondByte, thirdByte, fourthByte, tempCodePoint;\n      switch (bytesPerSequence) {\n      case 1:\n        if (firstByte < 128) {\n          codePoint = firstByte;\n        }\n        break;\n      case 2:\n        secondByte = buf[offset + 1];\n        if ((secondByte & 192) === 128) {\n          tempCodePoint = (firstByte & 31) << 6 | secondByte & 63;\n          if (tempCodePoint > 127) {\n            codePoint = tempCodePoint;\n          }\n        }\n        break;\n      case 3:\n        secondByte = buf[offset + 1];\n        thirdByte = buf[offset + 2];\n        if ((secondByte & 192) === 128 && (thirdByte & 192) === 128) {\n          tempCodePoint = (firstByte & 15) << 12 | (secondByte & 63) << 6 | thirdByte & 63;\n          if (tempCodePoint > 2047 && (tempCodePoint < 55296 || tempCodePoint > 57343)) {\n            codePoint = tempCodePoint;\n          }\n        }\n        break;\n      case 4:\n        secondByte = buf[offset + 1];\n        thirdByte = buf[offset + 2];\n        fourthByte = buf[offset + 3];\n        if ((secondByte & 192) === 128 && (thirdByte & 192) === 128 && (fourthByte & 192) === 128) {\n          tempCodePoint = (firstByte & 15) << 18 | (secondByte & 63) << 12 | (thirdByte & 63) << 6 | fourthByte & 63;\n          if (tempCodePoint > 65535 && tempCodePoint < 1114112) {\n            codePoint = tempCodePoint;\n          }\n        }\n      }\n    }\n    if (codePoint === null) {\n      codePoint = 65533;\n      bytesPerSequence = 1;\n    } else if (codePoint > 65535) {\n      codePoint -= 65536;\n      res.push(codePoint >>> 10 & 1023 | 55296);\n      codePoint = 56320 | codePoint & 1023;\n    }\n    res.push(codePoint);\n    offset += bytesPerSequence;\n  }\n  return decodeCodePointsArray(res);\n}\nconst MAX_ARGUMENTS_LENGTH = 4096;\nfunction decodeCodePointsArray(codePoints) {\n  const len = codePoints.length;\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints);\n  }\n  let res = '';\n  let i = 0;\n  while (i < len) {\n    res += String.fromCharCode.apply(String, codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH));\n  }\n  return res;\n}\n\nexports.alloc = alloc;\nexports.asU8A = asU8A;\nexports.compare = compare;\nexports.concat = concat;\nexports.decodeCodePointsArray = decodeCodePointsArray;\nexports.fromArray = fromArray;\nexports.fromHex = fromHex;\nexports.fromString = fromString;\nexports.slice = slice;\nexports.toHex = toHex;\nexports.toString = toString;\nexports.useBuffer = useBuffer;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nconst decodeErrPrefix = 'CBOR decode error:';\nconst encodeErrPrefix = 'CBOR encode error:';\nconst uintMinorPrefixBytes = [];\nuintMinorPrefixBytes[23] = 1;\nuintMinorPrefixBytes[24] = 2;\nuintMinorPrefixBytes[25] = 3;\nuintMinorPrefixBytes[26] = 5;\nuintMinorPrefixBytes[27] = 9;\nfunction assertEnoughData(data, pos, need) {\n  if (data.length - pos < need) {\n    throw new Error(`${ decodeErrPrefix } not enough data for type`);\n  }\n}\n\nexports.assertEnoughData = assertEnoughData;\nexports.decodeErrPrefix = decodeErrPrefix;\nexports.encodeErrPrefix = encodeErrPrefix;\nexports.uintMinorPrefixBytes = uintMinorPrefixBytes;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar token = require('./token.js');\nvar _0uint = require('./0uint.js');\nvar _1negint = require('./1negint.js');\nvar _2bytes = require('./2bytes.js');\nvar _3string = require('./3string.js');\nvar _4array = require('./4array.js');\nvar _5map = require('./5map.js');\nvar _6tag = require('./6tag.js');\nvar _7float = require('./7float.js');\nvar common = require('./common.js');\nvar byteUtils = require('./byte-utils.js');\n\nfunction invalidMinor(data, pos, minor) {\n  throw new Error(`${ common.decodeErrPrefix } encountered invalid minor (${ minor }) for major ${ data[pos] >>> 5 }`);\n}\nfunction errorer(msg) {\n  return () => {\n    throw new Error(`${ common.decodeErrPrefix } ${ msg }`);\n  };\n}\nconst jump = [];\nfor (let i = 0; i <= 23; i++) {\n  jump[i] = invalidMinor;\n}\njump[24] = _0uint.decodeUint8;\njump[25] = _0uint.decodeUint16;\njump[26] = _0uint.decodeUint32;\njump[27] = _0uint.decodeUint64;\njump[28] = invalidMinor;\njump[29] = invalidMinor;\njump[30] = invalidMinor;\njump[31] = invalidMinor;\nfor (let i = 32; i <= 55; i++) {\n  jump[i] = invalidMinor;\n}\njump[56] = _1negint.decodeNegint8;\njump[57] = _1negint.decodeNegint16;\njump[58] = _1negint.decodeNegint32;\njump[59] = _1negint.decodeNegint64;\njump[60] = invalidMinor;\njump[61] = invalidMinor;\njump[62] = invalidMinor;\njump[63] = invalidMinor;\nfor (let i = 64; i <= 87; i++) {\n  jump[i] = _2bytes.decodeBytesCompact;\n}\njump[88] = _2bytes.decodeBytes8;\njump[89] = _2bytes.decodeBytes16;\njump[90] = _2bytes.decodeBytes32;\njump[91] = _2bytes.decodeBytes64;\njump[92] = invalidMinor;\njump[93] = invalidMinor;\njump[94] = invalidMinor;\njump[95] = errorer('indefinite length bytes/strings are not supported');\nfor (let i = 96; i <= 119; i++) {\n  jump[i] = _3string.decodeStringCompact;\n}\njump[120] = _3string.decodeString8;\njump[121] = _3string.decodeString16;\njump[122] = _3string.decodeString32;\njump[123] = _3string.decodeString64;\njump[124] = invalidMinor;\njump[125] = invalidMinor;\njump[126] = invalidMinor;\njump[127] = errorer('indefinite length bytes/strings are not supported');\nfor (let i = 128; i <= 151; i++) {\n  jump[i] = _4array.decodeArrayCompact;\n}\njump[152] = _4array.decodeArray8;\njump[153] = _4array.decodeArray16;\njump[154] = _4array.decodeArray32;\njump[155] = _4array.decodeArray64;\njump[156] = invalidMinor;\njump[157] = invalidMinor;\njump[158] = invalidMinor;\njump[159] = _4array.decodeArrayIndefinite;\nfor (let i = 160; i <= 183; i++) {\n  jump[i] = _5map.decodeMapCompact;\n}\njump[184] = _5map.decodeMap8;\njump[185] = _5map.decodeMap16;\njump[186] = _5map.decodeMap32;\njump[187] = _5map.decodeMap64;\njump[188] = invalidMinor;\njump[189] = invalidMinor;\njump[190] = invalidMinor;\njump[191] = _5map.decodeMapIndefinite;\nfor (let i = 192; i <= 215; i++) {\n  jump[i] = _6tag.decodeTagCompact;\n}\njump[216] = _6tag.decodeTag8;\njump[217] = _6tag.decodeTag16;\njump[218] = _6tag.decodeTag32;\njump[219] = _6tag.decodeTag64;\njump[220] = invalidMinor;\njump[221] = invalidMinor;\njump[222] = invalidMinor;\njump[223] = invalidMinor;\nfor (let i = 224; i <= 243; i++) {\n  jump[i] = errorer('simple values are not supported');\n}\njump[244] = invalidMinor;\njump[245] = invalidMinor;\njump[246] = invalidMinor;\njump[247] = _7float.decodeUndefined;\njump[248] = errorer('simple values are not supported');\njump[249] = _7float.decodeFloat16;\njump[250] = _7float.decodeFloat32;\njump[251] = _7float.decodeFloat64;\njump[252] = invalidMinor;\njump[253] = invalidMinor;\njump[254] = invalidMinor;\njump[255] = _7float.decodeBreak;\nconst quick = [];\nfor (let i = 0; i < 24; i++) {\n  quick[i] = new token.Token(token.Type.uint, i, 1);\n}\nfor (let i = -1; i >= -24; i--) {\n  quick[31 - i] = new token.Token(token.Type.negint, i, 1);\n}\nquick[64] = new token.Token(token.Type.bytes, new Uint8Array(0), 1);\nquick[96] = new token.Token(token.Type.string, '', 1);\nquick[128] = new token.Token(token.Type.array, 0, 1);\nquick[160] = new token.Token(token.Type.map, 0, 1);\nquick[244] = new token.Token(token.Type.false, false, 1);\nquick[245] = new token.Token(token.Type.true, true, 1);\nquick[246] = new token.Token(token.Type.null, null, 1);\nfunction quickEncodeToken(token$1) {\n  switch (token$1.type) {\n  case token.Type.false:\n    return byteUtils.fromArray([244]);\n  case token.Type.true:\n    return byteUtils.fromArray([245]);\n  case token.Type.null:\n    return byteUtils.fromArray([246]);\n  case token.Type.bytes:\n    if (!token$1.value.length) {\n      return byteUtils.fromArray([64]);\n    }\n    return;\n  case token.Type.string:\n    if (token$1.value === '') {\n      return byteUtils.fromArray([96]);\n    }\n    return;\n  case token.Type.array:\n    if (token$1.value === 0) {\n      return byteUtils.fromArray([128]);\n    }\n    return;\n  case token.Type.map:\n    if (token$1.value === 0) {\n      return byteUtils.fromArray([160]);\n    }\n    return;\n  case token.Type.uint:\n    if (token$1.value < 24) {\n      return byteUtils.fromArray([Number(token$1.value)]);\n    }\n    return;\n  case token.Type.negint:\n    if (token$1.value >= -24) {\n      return byteUtils.fromArray([31 - Number(token$1.value)]);\n    }\n  }\n}\n\nexports.jump = jump;\nexports.quick = quick;\nexports.quickEncodeToken = quickEncodeToken;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar token = require('./token.js');\nvar common = require('./common.js');\n\nconst uintBoundaries = [\n  24,\n  256,\n  65536,\n  4294967296,\n  BigInt('18446744073709551616')\n];\nfunction readUint8(data, offset, options) {\n  common.assertEnoughData(data, offset, 1);\n  const value = data[offset];\n  if (options.strict === true && value < uintBoundaries[0]) {\n    throw new Error(`${ common.decodeErrPrefix } integer encoded in more bytes than necessary (strict decode)`);\n  }\n  return value;\n}\nfunction readUint16(data, offset, options) {\n  common.assertEnoughData(data, offset, 2);\n  const value = data[offset] << 8 | data[offset + 1];\n  if (options.strict === true && value < uintBoundaries[1]) {\n    throw new Error(`${ common.decodeErrPrefix } integer encoded in more bytes than necessary (strict decode)`);\n  }\n  return value;\n}\nfunction readUint32(data, offset, options) {\n  common.assertEnoughData(data, offset, 4);\n  const value = data[offset] * 16777216 + (data[offset + 1] << 16) + (data[offset + 2] << 8) + data[offset + 3];\n  if (options.strict === true && value < uintBoundaries[2]) {\n    throw new Error(`${ common.decodeErrPrefix } integer encoded in more bytes than necessary (strict decode)`);\n  }\n  return value;\n}\nfunction readUint64(data, offset, options) {\n  common.assertEnoughData(data, offset, 8);\n  const hi = data[offset] * 16777216 + (data[offset + 1] << 16) + (data[offset + 2] << 8) + data[offset + 3];\n  const lo = data[offset + 4] * 16777216 + (data[offset + 5] << 16) + (data[offset + 6] << 8) + data[offset + 7];\n  const value = (BigInt(hi) << BigInt(32)) + BigInt(lo);\n  if (options.strict === true && value < uintBoundaries[3]) {\n    throw new Error(`${ common.decodeErrPrefix } integer encoded in more bytes than necessary (strict decode)`);\n  }\n  if (value <= Number.MAX_SAFE_INTEGER) {\n    return Number(value);\n  }\n  if (options.allowBigInt === true) {\n    return value;\n  }\n  throw new Error(`${ common.decodeErrPrefix } integers outside of the safe integer range are not supported`);\n}\nfunction decodeUint8(data, pos, _minor, options) {\n  return new token.Token(token.Type.uint, readUint8(data, pos + 1, options), 2);\n}\nfunction decodeUint16(data, pos, _minor, options) {\n  return new token.Token(token.Type.uint, readUint16(data, pos + 1, options), 3);\n}\nfunction decodeUint32(data, pos, _minor, options) {\n  return new token.Token(token.Type.uint, readUint32(data, pos + 1, options), 5);\n}\nfunction decodeUint64(data, pos, _minor, options) {\n  return new token.Token(token.Type.uint, readUint64(data, pos + 1, options), 9);\n}\nfunction encodeUint(buf, token) {\n  return encodeUintValue(buf, 0, token.value);\n}\nfunction encodeUintValue(buf, major, uint) {\n  if (uint < uintBoundaries[0]) {\n    const nuint = Number(uint);\n    buf.push([major | nuint]);\n  } else if (uint < uintBoundaries[1]) {\n    const nuint = Number(uint);\n    buf.push([\n      major | 24,\n      nuint\n    ]);\n  } else if (uint < uintBoundaries[2]) {\n    const nuint = Number(uint);\n    buf.push([\n      major | 25,\n      nuint >>> 8,\n      nuint & 255\n    ]);\n  } else if (uint < uintBoundaries[3]) {\n    const nuint = Number(uint);\n    buf.push([\n      major | 26,\n      nuint >>> 24 & 255,\n      nuint >>> 16 & 255,\n      nuint >>> 8 & 255,\n      nuint & 255\n    ]);\n  } else {\n    const buint = BigInt(uint);\n    if (buint < uintBoundaries[4]) {\n      const set = [\n        major | 27,\n        0,\n        0,\n        0,\n        0,\n        0,\n        0,\n        0\n      ];\n      let lo = Number(buint & BigInt(4294967295));\n      let hi = Number(buint >> BigInt(32) & BigInt(4294967295));\n      set[8] = lo & 255;\n      lo = lo >> 8;\n      set[7] = lo & 255;\n      lo = lo >> 8;\n      set[6] = lo & 255;\n      lo = lo >> 8;\n      set[5] = lo & 255;\n      set[4] = hi & 255;\n      hi = hi >> 8;\n      set[3] = hi & 255;\n      hi = hi >> 8;\n      set[2] = hi & 255;\n      hi = hi >> 8;\n      set[1] = hi & 255;\n      buf.push(set);\n    } else {\n      throw new Error(`${ common.decodeErrPrefix } encountered BigInt larger than allowable range`);\n    }\n  }\n}\nencodeUint.encodedSize = function encodedSize(token) {\n  return encodeUintValue.encodedSize(token.value);\n};\nencodeUintValue.encodedSize = function encodedSize(uint) {\n  if (uint < uintBoundaries[0]) {\n    return 1;\n  }\n  if (uint < uintBoundaries[1]) {\n    return 2;\n  }\n  if (uint < uintBoundaries[2]) {\n    return 3;\n  }\n  if (uint < uintBoundaries[3]) {\n    return 5;\n  }\n  return 9;\n};\nencodeUint.compareTokens = function compareTokens(tok1, tok2) {\n  return tok1.value < tok2.value ? -1 : tok1.value > tok2.value ? 1 : 0;\n};\n\nexports.decodeUint16 = decodeUint16;\nexports.decodeUint32 = decodeUint32;\nexports.decodeUint64 = decodeUint64;\nexports.decodeUint8 = decodeUint8;\nexports.encodeUint = encodeUint;\nexports.encodeUintValue = encodeUintValue;\nexports.readUint16 = readUint16;\nexports.readUint32 = readUint32;\nexports.readUint64 = readUint64;\nexports.readUint8 = readUint8;\nexports.uintBoundaries = uintBoundaries;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar token = require('./token.js');\nvar _0uint = require('./0uint.js');\nvar common = require('./common.js');\n\nfunction decodeNegint8(data, pos, _minor, options) {\n  return new token.Token(token.Type.negint, -1 - _0uint.readUint8(data, pos + 1, options), 2);\n}\nfunction decodeNegint16(data, pos, _minor, options) {\n  return new token.Token(token.Type.negint, -1 - _0uint.readUint16(data, pos + 1, options), 3);\n}\nfunction decodeNegint32(data, pos, _minor, options) {\n  return new token.Token(token.Type.negint, -1 - _0uint.readUint32(data, pos + 1, options), 5);\n}\nconst neg1b = BigInt(-1);\nconst pos1b = BigInt(1);\nfunction decodeNegint64(data, pos, _minor, options) {\n  const int = _0uint.readUint64(data, pos + 1, options);\n  if (typeof int !== 'bigint') {\n    const value = -1 - int;\n    if (value >= Number.MIN_SAFE_INTEGER) {\n      return new token.Token(token.Type.negint, value, 9);\n    }\n  }\n  if (options.allowBigInt !== true) {\n    throw new Error(`${ common.decodeErrPrefix } integers outside of the safe integer range are not supported`);\n  }\n  return new token.Token(token.Type.negint, neg1b - BigInt(int), 9);\n}\nfunction encodeNegint(buf, token) {\n  const negint = token.value;\n  const unsigned = typeof negint === 'bigint' ? negint * neg1b - pos1b : negint * -1 - 1;\n  _0uint.encodeUintValue(buf, token.type.majorEncoded, unsigned);\n}\nencodeNegint.encodedSize = function encodedSize(token) {\n  const negint = token.value;\n  const unsigned = typeof negint === 'bigint' ? negint * neg1b - pos1b : negint * -1 - 1;\n  if (unsigned < _0uint.uintBoundaries[0]) {\n    return 1;\n  }\n  if (unsigned < _0uint.uintBoundaries[1]) {\n    return 2;\n  }\n  if (unsigned < _0uint.uintBoundaries[2]) {\n    return 3;\n  }\n  if (unsigned < _0uint.uintBoundaries[3]) {\n    return 5;\n  }\n  return 9;\n};\nencodeNegint.compareTokens = function compareTokens(tok1, tok2) {\n  return tok1.value < tok2.value ? 1 : tok1.value > tok2.value ? -1 : 0;\n};\n\nexports.decodeNegint16 = decodeNegint16;\nexports.decodeNegint32 = decodeNegint32;\nexports.decodeNegint64 = decodeNegint64;\nexports.decodeNegint8 = decodeNegint8;\nexports.encodeNegint = encodeNegint;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar token = require('./token.js');\nvar common = require('./common.js');\nvar _0uint = require('./0uint.js');\nvar byteUtils = require('./byte-utils.js');\n\nfunction toToken(data, pos, prefix, length) {\n  common.assertEnoughData(data, pos, prefix + length);\n  const buf = byteUtils.slice(data, pos + prefix, pos + prefix + length);\n  return new token.Token(token.Type.bytes, buf, prefix + length);\n}\nfunction decodeBytesCompact(data, pos, minor, _options) {\n  return toToken(data, pos, 1, minor);\n}\nfunction decodeBytes8(data, pos, _minor, options) {\n  return toToken(data, pos, 2, _0uint.readUint8(data, pos + 1, options));\n}\nfunction decodeBytes16(data, pos, _minor, options) {\n  return toToken(data, pos, 3, _0uint.readUint16(data, pos + 1, options));\n}\nfunction decodeBytes32(data, pos, _minor, options) {\n  return toToken(data, pos, 5, _0uint.readUint32(data, pos + 1, options));\n}\nfunction decodeBytes64(data, pos, _minor, options) {\n  const l = _0uint.readUint64(data, pos + 1, options);\n  if (typeof l === 'bigint') {\n    throw new Error(`${ common.decodeErrPrefix } 64-bit integer bytes lengths not supported`);\n  }\n  return toToken(data, pos, 9, l);\n}\nfunction tokenBytes(token$1) {\n  if (token$1.encodedBytes === undefined) {\n    token$1.encodedBytes = token$1.type === token.Type.string ? byteUtils.fromString(token$1.value) : token$1.value;\n  }\n  return token$1.encodedBytes;\n}\nfunction encodeBytes(buf, token) {\n  const bytes = tokenBytes(token);\n  _0uint.encodeUintValue(buf, token.type.majorEncoded, bytes.length);\n  buf.push(bytes);\n}\nencodeBytes.encodedSize = function encodedSize(token) {\n  const bytes = tokenBytes(token);\n  return _0uint.encodeUintValue.encodedSize(bytes.length) + bytes.length;\n};\nencodeBytes.compareTokens = function compareTokens(tok1, tok2) {\n  return compareBytes(tokenBytes(tok1), tokenBytes(tok2));\n};\nfunction compareBytes(b1, b2) {\n  return b1.length < b2.length ? -1 : b1.length > b2.length ? 1 : byteUtils.compare(b1, b2);\n}\n\nexports.compareBytes = compareBytes;\nexports.decodeBytes16 = decodeBytes16;\nexports.decodeBytes32 = decodeBytes32;\nexports.decodeBytes64 = decodeBytes64;\nexports.decodeBytes8 = decodeBytes8;\nexports.decodeBytesCompact = decodeBytesCompact;\nexports.encodeBytes = encodeBytes;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar token = require('./token.js');\nvar common = require('./common.js');\nvar _0uint = require('./0uint.js');\nvar _2bytes = require('./2bytes.js');\nvar byteUtils = require('./byte-utils.js');\n\nfunction toToken(data, pos, prefix, length) {\n  const totLength = prefix + length;\n  common.assertEnoughData(data, pos, totLength);\n  return new token.Token(token.Type.string, byteUtils.toString(data, pos + prefix, pos + totLength), totLength);\n}\nfunction decodeStringCompact(data, pos, minor, _options) {\n  return toToken(data, pos, 1, minor);\n}\nfunction decodeString8(data, pos, _minor, options) {\n  return toToken(data, pos, 2, _0uint.readUint8(data, pos + 1, options));\n}\nfunction decodeString16(data, pos, _minor, options) {\n  return toToken(data, pos, 3, _0uint.readUint16(data, pos + 1, options));\n}\nfunction decodeString32(data, pos, _minor, options) {\n  return toToken(data, pos, 5, _0uint.readUint32(data, pos + 1, options));\n}\nfunction decodeString64(data, pos, _minor, options) {\n  const l = _0uint.readUint64(data, pos + 1, options);\n  if (typeof l === 'bigint') {\n    throw new Error(`${ common.decodeErrPrefix } 64-bit integer string lengths not supported`);\n  }\n  return toToken(data, pos, 9, l);\n}\nconst encodeString = _2bytes.encodeBytes;\n\nexports.decodeString16 = decodeString16;\nexports.decodeString32 = decodeString32;\nexports.decodeString64 = decodeString64;\nexports.decodeString8 = decodeString8;\nexports.decodeStringCompact = decodeStringCompact;\nexports.encodeString = encodeString;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar token = require('./token.js');\nvar _0uint = require('./0uint.js');\nvar common = require('./common.js');\n\nfunction toToken(_data, _pos, prefix, length) {\n  return new token.Token(token.Type.array, length, prefix);\n}\nfunction decodeArrayCompact(data, pos, minor, _options) {\n  return toToken(data, pos, 1, minor);\n}\nfunction decodeArray8(data, pos, _minor, options) {\n  return toToken(data, pos, 2, _0uint.readUint8(data, pos + 1, options));\n}\nfunction decodeArray16(data, pos, _minor, options) {\n  return toToken(data, pos, 3, _0uint.readUint16(data, pos + 1, options));\n}\nfunction decodeArray32(data, pos, _minor, options) {\n  return toToken(data, pos, 5, _0uint.readUint32(data, pos + 1, options));\n}\nfunction decodeArray64(data, pos, _minor, options) {\n  const l = _0uint.readUint64(data, pos + 1, options);\n  if (typeof l === 'bigint') {\n    throw new Error(`${ common.decodeErrPrefix } 64-bit integer array lengths not supported`);\n  }\n  return toToken(data, pos, 9, l);\n}\nfunction decodeArrayIndefinite(data, pos, _minor, options) {\n  if (options.allowIndefinite === false) {\n    throw new Error(`${ common.decodeErrPrefix } indefinite length items not allowed`);\n  }\n  return toToken(data, pos, 1, Infinity);\n}\nfunction encodeArray(buf, token$1) {\n  _0uint.encodeUintValue(buf, token.Type.array.majorEncoded, token$1.value);\n}\nencodeArray.compareTokens = _0uint.encodeUint.compareTokens;\n\nexports.decodeArray16 = decodeArray16;\nexports.decodeArray32 = decodeArray32;\nexports.decodeArray64 = decodeArray64;\nexports.decodeArray8 = decodeArray8;\nexports.decodeArrayCompact = decodeArrayCompact;\nexports.decodeArrayIndefinite = decodeArrayIndefinite;\nexports.encodeArray = encodeArray;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar token = require('./token.js');\nvar _0uint = require('./0uint.js');\nvar common = require('./common.js');\n\nfunction toToken(_data, _pos, prefix, length) {\n  return new token.Token(token.Type.map, length, prefix);\n}\nfunction decodeMapCompact(data, pos, minor, _options) {\n  return toToken(data, pos, 1, minor);\n}\nfunction decodeMap8(data, pos, _minor, options) {\n  return toToken(data, pos, 2, _0uint.readUint8(data, pos + 1, options));\n}\nfunction decodeMap16(data, pos, _minor, options) {\n  return toToken(data, pos, 3, _0uint.readUint16(data, pos + 1, options));\n}\nfunction decodeMap32(data, pos, _minor, options) {\n  return toToken(data, pos, 5, _0uint.readUint32(data, pos + 1, options));\n}\nfunction decodeMap64(data, pos, _minor, options) {\n  const l = _0uint.readUint64(data, pos + 1, options);\n  if (typeof l === 'bigint') {\n    throw new Error(`${ common.decodeErrPrefix } 64-bit integer map lengths not supported`);\n  }\n  return toToken(data, pos, 9, l);\n}\nfunction decodeMapIndefinite(data, pos, _minor, options) {\n  if (options.allowIndefinite === false) {\n    throw new Error(`${ common.decodeErrPrefix } indefinite length items not allowed`);\n  }\n  return toToken(data, pos, 1, Infinity);\n}\nfunction encodeMap(buf, token$1) {\n  _0uint.encodeUintValue(buf, token.Type.map.majorEncoded, token$1.value);\n}\nencodeMap.compareTokens = _0uint.encodeUint.compareTokens;\n\nexports.decodeMap16 = decodeMap16;\nexports.decodeMap32 = decodeMap32;\nexports.decodeMap64 = decodeMap64;\nexports.decodeMap8 = decodeMap8;\nexports.decodeMapCompact = decodeMapCompact;\nexports.decodeMapIndefinite = decodeMapIndefinite;\nexports.encodeMap = encodeMap;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar token = require('./token.js');\nvar _0uint = require('./0uint.js');\n\nfunction decodeTagCompact(_data, _pos, minor, _options) {\n  return new token.Token(token.Type.tag, minor, 1);\n}\nfunction decodeTag8(data, pos, _minor, options) {\n  return new token.Token(token.Type.tag, _0uint.readUint8(data, pos + 1, options), 2);\n}\nfunction decodeTag16(data, pos, _minor, options) {\n  return new token.Token(token.Type.tag, _0uint.readUint16(data, pos + 1, options), 3);\n}\nfunction decodeTag32(data, pos, _minor, options) {\n  return new token.Token(token.Type.tag, _0uint.readUint32(data, pos + 1, options), 5);\n}\nfunction decodeTag64(data, pos, _minor, options) {\n  return new token.Token(token.Type.tag, _0uint.readUint64(data, pos + 1, options), 9);\n}\nfunction encodeTag(buf, token$1) {\n  _0uint.encodeUintValue(buf, token.Type.tag.majorEncoded, token$1.value);\n}\nencodeTag.compareTokens = _0uint.encodeUint.compareTokens;\n\nexports.decodeTag16 = decodeTag16;\nexports.decodeTag32 = decodeTag32;\nexports.decodeTag64 = decodeTag64;\nexports.decodeTag8 = decodeTag8;\nexports.decodeTagCompact = decodeTagCompact;\nexports.encodeTag = encodeTag;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar token = require('./token.js');\nvar common = require('./common.js');\nvar _0uint = require('./0uint.js');\n\nconst MINOR_FALSE = 20;\nconst MINOR_TRUE = 21;\nconst MINOR_NULL = 22;\nconst MINOR_UNDEFINED = 23;\nfunction decodeUndefined(_data, _pos, _minor, options) {\n  if (options.allowUndefined === false) {\n    throw new Error(`${ common.decodeErrPrefix } undefined values are not supported`);\n  }\n  return new token.Token(token.Type.undefined, undefined, 1);\n}\nfunction decodeBreak(_data, _pos, _minor, options) {\n  if (options.allowIndefinite === false) {\n    throw new Error(`${ common.decodeErrPrefix } indefinite length items not allowed`);\n  }\n  return new token.Token(token.Type.break, undefined, 1);\n}\nfunction createToken(value, bytes, options) {\n  if (options) {\n    if (options.allowNaN === false && Number.isNaN(value)) {\n      throw new Error(`${ common.decodeErrPrefix } NaN values are not supported`);\n    }\n    if (options.allowInfinity === false && (value === Infinity || value === -Infinity)) {\n      throw new Error(`${ common.decodeErrPrefix } Infinity values are not supported`);\n    }\n  }\n  return new token.Token(token.Type.float, value, bytes);\n}\nfunction decodeFloat16(data, pos, _minor, options) {\n  return createToken(readFloat16(data, pos + 1), 3, options);\n}\nfunction decodeFloat32(data, pos, _minor, options) {\n  return createToken(readFloat32(data, pos + 1), 5, options);\n}\nfunction decodeFloat64(data, pos, _minor, options) {\n  return createToken(readFloat64(data, pos + 1), 9, options);\n}\nfunction encodeFloat(buf, token$1, options) {\n  const float = token$1.value;\n  if (float === false) {\n    buf.push([token.Type.float.majorEncoded | MINOR_FALSE]);\n  } else if (float === true) {\n    buf.push([token.Type.float.majorEncoded | MINOR_TRUE]);\n  } else if (float === null) {\n    buf.push([token.Type.float.majorEncoded | MINOR_NULL]);\n  } else if (float === undefined) {\n    buf.push([token.Type.float.majorEncoded | MINOR_UNDEFINED]);\n  } else {\n    let decoded;\n    let success = false;\n    if (!options || options.float64 !== true) {\n      encodeFloat16(float);\n      decoded = readFloat16(ui8a, 1);\n      if (float === decoded || Number.isNaN(float)) {\n        ui8a[0] = 249;\n        buf.push(ui8a.slice(0, 3));\n        success = true;\n      } else {\n        encodeFloat32(float);\n        decoded = readFloat32(ui8a, 1);\n        if (float === decoded) {\n          ui8a[0] = 250;\n          buf.push(ui8a.slice(0, 5));\n          success = true;\n        }\n      }\n    }\n    if (!success) {\n      encodeFloat64(float);\n      decoded = readFloat64(ui8a, 1);\n      ui8a[0] = 251;\n      buf.push(ui8a.slice(0, 9));\n    }\n  }\n}\nencodeFloat.encodedSize = function encodedSize(token, options) {\n  const float = token.value;\n  if (float === false || float === true || float === null || float === undefined) {\n    return 1;\n  }\n  let decoded;\n  if (!options || options.float64 !== true) {\n    encodeFloat16(float);\n    decoded = readFloat16(ui8a, 1);\n    if (float === decoded || Number.isNaN(float)) {\n      return 3;\n    }\n    encodeFloat32(float);\n    decoded = readFloat32(ui8a, 1);\n    if (float === decoded) {\n      return 5;\n    }\n  }\n  return 9;\n};\nconst buffer = new ArrayBuffer(9);\nconst dataView = new DataView(buffer, 1);\nconst ui8a = new Uint8Array(buffer, 0);\nfunction encodeFloat16(inp) {\n  if (inp === Infinity) {\n    dataView.setUint16(0, 31744, false);\n  } else if (inp === -Infinity) {\n    dataView.setUint16(0, 64512, false);\n  } else if (Number.isNaN(inp)) {\n    dataView.setUint16(0, 32256, false);\n  } else {\n    dataView.setFloat32(0, inp);\n    const valu32 = dataView.getUint32(0);\n    const exponent = (valu32 & 2139095040) >> 23;\n    const mantissa = valu32 & 8388607;\n    if (exponent === 255) {\n      dataView.setUint16(0, 31744, false);\n    } else if (exponent === 0) {\n      dataView.setUint16(0, (inp & 2147483648) >> 16 | mantissa >> 13, false);\n    } else {\n      const logicalExponent = exponent - 127;\n      if (logicalExponent < -24) {\n        dataView.setUint16(0, 0);\n      } else if (logicalExponent < -14) {\n        dataView.setUint16(0, (valu32 & 2147483648) >> 16 | 1 << 24 + logicalExponent, false);\n      } else {\n        dataView.setUint16(0, (valu32 & 2147483648) >> 16 | logicalExponent + 15 << 10 | mantissa >> 13, false);\n      }\n    }\n  }\n}\nfunction readFloat16(ui8a, pos) {\n  if (ui8a.length - pos < 2) {\n    throw new Error(`${ common.decodeErrPrefix } not enough data for float16`);\n  }\n  const half = (ui8a[pos] << 8) + ui8a[pos + 1];\n  if (half === 31744) {\n    return Infinity;\n  }\n  if (half === 64512) {\n    return -Infinity;\n  }\n  if (half === 32256) {\n    return NaN;\n  }\n  const exp = half >> 10 & 31;\n  const mant = half & 1023;\n  let val;\n  if (exp === 0) {\n    val = mant * 2 ** -24;\n  } else if (exp !== 31) {\n    val = (mant + 1024) * 2 ** (exp - 25);\n  } else {\n    val = mant === 0 ? Infinity : NaN;\n  }\n  return half & 32768 ? -val : val;\n}\nfunction encodeFloat32(inp) {\n  dataView.setFloat32(0, inp, false);\n}\nfunction readFloat32(ui8a, pos) {\n  if (ui8a.length - pos < 4) {\n    throw new Error(`${ common.decodeErrPrefix } not enough data for float32`);\n  }\n  const offset = (ui8a.byteOffset || 0) + pos;\n  return new DataView(ui8a.buffer, offset, 4).getFloat32(0, false);\n}\nfunction encodeFloat64(inp) {\n  dataView.setFloat64(0, inp, false);\n}\nfunction readFloat64(ui8a, pos) {\n  if (ui8a.length - pos < 8) {\n    throw new Error(`${ common.decodeErrPrefix } not enough data for float64`);\n  }\n  const offset = (ui8a.byteOffset || 0) + pos;\n  return new DataView(ui8a.buffer, offset, 8).getFloat64(0, false);\n}\nencodeFloat.compareTokens = _0uint.encodeUint.compareTokens;\n\nexports.decodeBreak = decodeBreak;\nexports.decodeFloat16 = decodeFloat16;\nexports.decodeFloat32 = decodeFloat32;\nexports.decodeFloat64 = decodeFloat64;\nexports.decodeUndefined = decodeUndefined;\nexports.encodeFloat = encodeFloat;\n","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar common = require('./common.js');\nvar token = require('./token.js');\nvar jump = require('./jump.js');\n\nconst defaultDecodeOptions = {\n  strict: false,\n  allowIndefinite: true,\n  allowUndefined: true,\n  allowBigInt: true\n};\nclass Tokeniser {\n  constructor(data, options = {}) {\n    this.pos = 0;\n    this.data = data;\n    this.options = options;\n  }\n  done() {\n    return this.pos >= this.data.length;\n  }\n  next() {\n    const byt = this.data[this.pos];\n    let token = jump.quick[byt];\n    if (token === undefined) {\n      const decoder = jump.jump[byt];\n      if (!decoder) {\n        throw new Error(`${ common.decodeErrPrefix } no decoder for major type ${ byt >>> 5 } (byte 0x${ byt.toString(16).padStart(2, '0') })`);\n      }\n      const minor = byt & 31;\n      token = decoder(this.data, this.pos, minor, this.options);\n    }\n    this.pos += token.encodedLength;\n    return token;\n  }\n}\nconst DONE = Symbol.for('DONE');\nconst BREAK = Symbol.for('BREAK');\nfunction tokenToArray(token, tokeniser, options) {\n  const arr = [];\n  for (let i = 0; i < token.value; i++) {\n    const value = tokensToObject(tokeniser, options);\n    if (value === BREAK) {\n      if (token.value === Infinity) {\n        break;\n      }\n      throw new Error(`${ common.decodeErrPrefix } got unexpected break to lengthed array`);\n    }\n    if (value === DONE) {\n      throw new Error(`${ common.decodeErrPrefix } found array but not enough entries (got ${ i }, expected ${ token.value })`);\n    }\n    arr[i] = value;\n  }\n  return arr;\n}\nfunction tokenToMap(token, tokeniser, options) {\n  const useMaps = options.useMaps === true;\n  const obj = useMaps ? undefined : {};\n  const m = useMaps ? new Map() : undefined;\n  for (let i = 0; i < token.value; i++) {\n    const key = tokensToObject(tokeniser, options);\n    if (key === BREAK) {\n      if (token.value === Infinity) {\n        break;\n      }\n      throw new Error(`${ common.decodeErrPrefix } got unexpected break to lengthed map`);\n    }\n    if (key === DONE) {\n      throw new Error(`${ common.decodeErrPrefix } found map but not enough entries (got ${ i } [no key], expected ${ token.value })`);\n    }\n    if (useMaps !== true && typeof key !== 'string') {\n      throw new Error(`${ common.decodeErrPrefix } non-string keys not supported (got ${ typeof key })`);\n    }\n    const value = tokensToObject(tokeniser, options);\n    if (value === DONE) {\n      throw new Error(`${ common.decodeErrPrefix } found map but not enough entries (got ${ i } [no value], expected ${ token.value })`);\n    }\n    if (useMaps) {\n      m.set(key, value);\n    } else {\n      obj[key] = value;\n    }\n  }\n  return useMaps ? m : obj;\n}\nfunction tokensToObject(tokeniser, options) {\n  if (tokeniser.done()) {\n    return DONE;\n  }\n  const token$1 = tokeniser.next();\n  if (token$1.type === token.Type.break) {\n    return BREAK;\n  }\n  if (token$1.type.terminal) {\n    return token$1.value;\n  }\n  if (token$1.type === token.Type.array) {\n    return tokenToArray(token$1, tokeniser, options);\n  }\n  if (token$1.type === token.Type.map) {\n    return tokenToMap(token$1, tokeniser, options);\n  }\n  if (token$1.type === token.Type.tag) {\n    if (options.tags && typeof options.tags[token$1.value] === 'function') {\n      const tagged = tokensToObject(tokeniser, options);\n      return options.tags[token$1.value](tagged);\n    }\n    throw new Error(`${ common.decodeErrPrefix } tag not supported (${ token$1.value })`);\n  }\n  throw new Error('unsupported');\n}\nfunction decode(data, options) {\n  if (!(data instanceof Uint8Array)) {\n    throw new Error(`${ common.decodeErrPrefix } data to decode must be a Uint8Array`);\n  }\n  options = Object.assign({}, defaultDecodeOptions, options);\n  const tokeniser = options.tokenizer || new Tokeniser(data, options);\n  const decoded = tokensToObject(tokeniser, options);\n  if (decoded === DONE) {\n    throw new Error(`${ common.decodeErrPrefix } did not find any content to decode`);\n  }\n  if (decoded === BREAK) {\n    throw new Error(`${ common.decodeErrPrefix } got unexpected break`);\n  }\n  if (!tokeniser.done()) {\n    throw new Error(`${ common.decodeErrPrefix } too many terminals, data makes no sense`);\n  }\n  return decoded;\n}\n\nexports.Tokeniser = Tokeniser;\nexports.decode = decode;\nexports.tokensToObject = tokensToObject;\n","'use strict'\n\nconst errCode = require('err-code')\nconst CID = require('cids')\n\n/**\n * @typedef {Object} Pinnable\n * @property {string | InstanceType<typeof window.String> | CID} [path]\n * @property {CID} [cid]\n * @property {boolean} [recursive]\n * @property {any} [metadata]\n *\n * @typedef {CID|string|InstanceType<typeof window.String>|Pinnable} ToPin\n * @typedef {ToPin|Iterable<ToPin>|AsyncIterable<ToPin>} Source\n *\n * @typedef {Object} Pin\n * @property {string|CID} path\n * @property {boolean} recursive\n * @property {any} [metadata]\n */\n\n/**\n * Transform one of:\n *\n * ```ts\n * CID\n * String\n * { cid: CID recursive, metadata }\n * { path: String recursive, metadata }\n * Iterable<CID>\n * Iterable<String>\n * Iterable<{ cid: CID recursive, metadata }>\n * Iterable<{ path: String recursive, metadata }>\n * AsyncIterable<CID>\n * AsyncIterable<String>\n * AsyncIterable<{ cid: CID recursive, metadata }>\n * AsyncIterable<{ path: String recursive, metadata }>\n * ```\n * Into:\n *\n * ```ts\n * AsyncIterable<{ path: CID|String, recursive:boolean, metadata }>\n * ```\n *\n * @param {Source} input\n * @returns {AsyncIterable<Pin>}\n */\n// eslint-disable-next-line complexity\nmodule.exports = async function * normaliseInput (input) {\n  // must give us something\n  if (input === null || input === undefined) {\n    throw errCode(new Error(`Unexpected input: ${input}`), 'ERR_UNEXPECTED_INPUT')\n  }\n\n  // CID|String\n  if (CID.isCID(input)) {\n    yield toPin({ cid: input })\n    return\n  }\n\n  if (input instanceof String || typeof input === 'string') {\n    yield toPin({ path: input })\n    return\n  }\n\n  // { cid: CID recursive, metadata }\n  // @ts-ignore - it still could be iterable or async iterable\n  if (input.cid != null || input.path != null) {\n    // @ts-ignore\n    return yield toPin(input)\n  }\n\n  // Iterable<?>\n  if (Symbol.iterator in input) {\n    // @ts-ignore\n    const iterator = input[Symbol.iterator]()\n    const first = iterator.next()\n    if (first.done) return iterator\n\n    // Iterable<CID|String>\n    if (CID.isCID(first.value) || first.value instanceof String || typeof first.value === 'string') {\n      yield toPin({ cid: first.value })\n      for (const cid of iterator) {\n        yield toPin({ cid })\n      }\n      return\n    }\n\n    // Iterable<{ cid: CID recursive, metadata }>\n    if (first.value.cid != null || first.value.path != null) {\n      yield toPin(first.value)\n      for (const obj of iterator) {\n        yield toPin(obj)\n      }\n      return\n    }\n\n    throw errCode(new Error('Unexpected input: ' + typeof input), 'ERR_UNEXPECTED_INPUT')\n  }\n\n  // AsyncIterable<?>\n  if (Symbol.asyncIterator in input) {\n    // @ts-ignore\n    const iterator = input[Symbol.asyncIterator]()\n    const first = await iterator.next()\n    if (first.done) return iterator\n\n    // AsyncIterable<CID|String>\n    if (CID.isCID(first.value) || first.value instanceof String || typeof first.value === 'string') {\n      yield toPin({ cid: first.value })\n      for await (const cid of iterator) {\n        yield toPin({ cid })\n      }\n      return\n    }\n\n    // AsyncIterable<{ cid: CID|String recursive, metadata }>\n    if (first.value.cid != null || first.value.path != null) {\n      yield toPin(first.value)\n      for await (const obj of iterator) {\n        yield toPin(obj)\n      }\n      return\n    }\n\n    throw errCode(new Error('Unexpected input: ' + typeof input), 'ERR_UNEXPECTED_INPUT')\n  }\n\n  throw errCode(new Error('Unexpected input: ' + typeof input), 'ERR_UNEXPECTED_INPUT')\n}\n\n/**\n * @param {Pinnable} input\n */\nfunction toPin (input) {\n  const path = input.cid || `${input.path}`\n\n  if (!path) {\n    throw errCode(new Error('Unexpected input: Please path either a CID or an IPFS path'), 'ERR_UNEXPECTED_INPUT')\n  }\n\n  /** @type {Pin} */\n  const pin = {\n    path,\n    recursive: input.recursive !== false\n  }\n\n  if (input.metadata != null) {\n    pin.metadata = input.metadata\n  }\n\n  return pin\n}\n","/* eslint max-nested-callbacks: [\"error\", 8] */\n'use strict'\n\nconst PinManager = require('./pin-manager')\nconst { PinTypes } = PinManager\nconst normaliseInput = require('ipfs-core-utils/src/pins/normalise-input')\nconst { resolvePath } = require('../../utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @typedef {import('cids')} CID\n */\n\n/**\n * @param {string} type\n * @param {CID} cid\n * @param {Record<string, any>} [metadata]\n */\nfunction toPin (type, cid, metadata) {\n  /** @type {import('ipfs-core-types/src/pin').LsResult} */\n  const output = {\n    type,\n    cid\n  }\n\n  if (metadata) {\n    output.metadata = metadata\n  }\n\n  return output\n}\n\n/**\n * @param {Object} config\n * @param {import('./pin-manager')} config.pinManager\n * @param {import('ipld')} config.ipld\n */\nmodule.exports = ({ pinManager, ipld }) => {\n  /**\n   * @type {import('ipfs-core-types/src/pin').API[\"ls\"]}\n   */\n  async function * ls (options = {}) {\n    /** @type {import('ipfs-core-types/src/pin').PinQueryType} */\n    let type = PinTypes.all\n\n    if (options.type) {\n      type = options.type\n\n      PinManager.checkPinType(type)\n    }\n\n    if (options.paths) {\n      // check the pinned state of specific hashes\n      let matched = false\n\n      for await (const { path } of normaliseInput(options.paths)) {\n        const cid = await resolvePath(ipld, path)\n        const { reason, pinned, parent, metadata } = await pinManager.isPinnedWithType(cid, type)\n\n        if (!pinned) {\n          throw new Error(`path '${path}' is not pinned`)\n        }\n\n        switch (reason) {\n          case PinTypes.direct:\n          case PinTypes.recursive:\n            matched = true\n            yield toPin(reason, cid, metadata)\n            break\n          default:\n            matched = true\n            yield toPin(`${PinTypes.indirect} through ${parent}`, cid, metadata)\n        }\n      }\n\n      if (!matched) {\n        throw new Error('No match found')\n      }\n\n      return\n    }\n\n    if (type === PinTypes.recursive || type === PinTypes.all) {\n      for await (const { cid, metadata } of pinManager.recursiveKeys()) {\n        yield toPin(PinTypes.recursive, cid, metadata)\n      }\n    }\n\n    if (type === PinTypes.indirect || type === PinTypes.all) {\n      // @ts-ignore - LsSettings & AbortOptions have no properties in common\n      // with type { preload?: boolean }\n      for await (const cid of pinManager.indirectKeys(options)) {\n        yield toPin(PinTypes.indirect, cid)\n      }\n    }\n\n    if (type === PinTypes.direct || type === PinTypes.all) {\n      for await (const { cid, metadata } of pinManager.directKeys()) {\n        yield toPin(PinTypes.direct, cid, metadata)\n      }\n    }\n  }\n\n  return withTimeoutOption(ls)\n}\n","'use strict'\n\nconst last = require('it-last')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-core-types/src/pin').API[\"rmAll\"]} config.rmAll\n */\nmodule.exports = ({ rmAll }) =>\n  /**\n   * @type {import('ipfs-core-types/src/pin').API[\"rm\"]}\n   */\n  (path, options = {}) => {\n    // @ts-ignore return value of last can be undefined\n    return last(rmAll([{ path, ...options }], options))\n  }\n","'use strict'\n\nconst normaliseInput = require('ipfs-core-utils/src/pins/normalise-input')\nconst { resolvePath } = require('../../utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst { PinTypes } = require('./pin-manager')\n\n/**\n * @param {Object} config\n * @param {import('./pin-manager')} config.pinManager\n * @param {import('.').GCLock} config.gcLock\n * @param {import('ipld')} config.ipld\n */\nmodule.exports = ({ pinManager, gcLock, ipld }) => {\n  /**\n   * @type {import('ipfs-core-types/src/pin').API[\"rmAll\"]}\n   */\n  async function * rmAll (source, _options = {}) {\n    const release = await gcLock.readLock()\n\n    try {\n      // verify that each hash can be unpinned\n      for await (const { path, recursive } of normaliseInput(source)) {\n        const cid = await resolvePath(ipld, path)\n        const { pinned, reason } = await pinManager.isPinnedWithType(cid, PinTypes.all)\n\n        if (!pinned) {\n          throw new Error(`${cid} is not pinned`)\n        }\n\n        switch (reason) {\n          case (PinTypes.recursive):\n            if (!recursive) {\n              throw new Error(`${cid} is pinned recursively`)\n            }\n\n            await pinManager.unpin(cid)\n\n            yield cid\n\n            break\n          case (PinTypes.direct):\n            await pinManager.unpin(cid)\n\n            yield cid\n\n            break\n          default:\n            throw new Error(`${cid} is pinned indirectly under ${reason}`)\n        }\n      }\n    } finally {\n      release()\n    }\n  }\n\n  return withTimeoutOption(rmAll)\n}\n","'use strict'\n\nconst IPNS = require('../ipns')\nconst routingConfig = require('../ipns/routing/config')\nconst OfflineDatastore = require('../ipns/routing/offline-datastore')\nconst { NotInitializedError, AlreadyInitializedError } = require('../errors')\nconst log = require('debug')('ipfs:components:ipns')\n\n/**\n * @typedef {import('libp2p-crypto').PrivateKey} PrivateKey\n *\n * @typedef {Object} ExperimentalOptions\n * @property {boolean} [ipnsPubsub]\n *\n * @typedef {Object} LibP2POptions\n * @property {DHTConfig} [config]\n *\n * @typedef {Object} DHTConfig\n * @property {boolean} [enabled]\n */\n\nclass IPNSAPI {\n  /**\n   * @param {Object} options\n   * @param {string} options.pass\n   * @param {boolean} [options.offline]\n   * @param {LibP2POptions} [options.libp2p]\n   * @param {ExperimentalOptions} [options.EXPERIMENTAL]\n   */\n  constructor (options = { pass: '' }) {\n    this.options = options\n\n    /** @type {IPNS | null} */\n    this.offline = null\n\n    /** @type {IPNS | null} */\n    this.online = null\n  }\n\n  getIPNS () {\n    const ipns = this.online || this.offline\n    if (ipns) {\n      return ipns\n    } else {\n      throw new NotInitializedError()\n    }\n  }\n\n  get routing () {\n    return this.getIPNS().routing\n  }\n\n  /**\n   * Activates IPNS subsystem in an ofline mode. If it was started once already\n   * it will throw an exception.\n   *\n   * This is primarily used for offline ipns modifications, such as the\n   * initializeKeyspace feature.\n   *\n   * @param {Object} config\n   * @param {import('ipfs-repo')} config.repo\n   * @param {import('peer-id')} config.peerId\n   * @param {import('libp2p/src/keychain')} config.keychain\n   */\n  startOffline ({ repo, peerId, keychain }) {\n    if (this.offline != null) {\n      throw new AlreadyInitializedError()\n    }\n\n    log('initializing IPNS keyspace')\n\n    const routing = new OfflineDatastore(repo)\n    const ipns = new IPNS(routing, repo.datastore, peerId, keychain, this.options)\n\n    this.offline = ipns\n  }\n\n  /**\n   * @param {Object} config\n   * @param {import('libp2p')} config.libp2p\n   * @param {import('ipfs-repo')} config.repo\n   * @param {import('peer-id')} config.peerId\n   * @param {import('libp2p/src/keychain')} config.keychain\n   */\n  async startOnline ({ libp2p, repo, peerId, keychain }) {\n    if (this.online != null) {\n      throw new AlreadyInitializedError()\n    }\n    const routing = routingConfig({ libp2p, repo, peerId, options: this.options })\n\n    // @ts-ignore routing is a TieredDatastore which wants keys to be Keys, IPNS needs keys to be Uint8Arrays\n    const ipns = new IPNS(routing, repo.datastore, peerId, keychain, this.options)\n    await ipns.republisher.start()\n    this.online = ipns\n  }\n\n  async stop () {\n    const ipns = this.online\n    if (ipns) {\n      await ipns.republisher.stop()\n      this.online = null\n    }\n  }\n\n  /**\n   * @param {PrivateKey} privKey\n   * @param {Uint8Array} value\n   * @param {number} lifetime\n   */\n  publish (privKey, value, lifetime) {\n    return this.getIPNS().publish(privKey, value, lifetime)\n  }\n\n  /**\n   *\n   * @param {string} name\n   * @param {*} [options]\n   */\n  resolve (name, options) {\n    return this.getIPNS().resolve(name, options)\n  }\n\n  /**\n   * @param {PrivateKey} privKey\n   * @param {Uint8Array} value\n   */\n  initializeKeyspace (privKey, value) {\n    return this.getIPNS().initializeKeyspace(privKey, value)\n  }\n}\nmodule.exports = IPNSAPI\n","'use strict'\n\nconst { createFromPrivKey } = require('peer-id')\nconst errcode = require('err-code')\nconst debug = require('debug')\nconst log = Object.assign(debug('ipfs:ipns'), {\n  error: debug('ipfs:ipns:error')\n})\n\nconst IpnsPublisher = require('./publisher')\nconst IpnsRepublisher = require('./republisher')\nconst IpnsResolver = require('./resolver')\nconst TLRU = require('../utils/tlru')\nconst defaultRecordTtl = 60 * 1000\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\n/**\n * @typedef {import('libp2p-crypto').PrivateKey} PrivateKey\n * @typedef {import('peer-id')} PeerId\n */\n\nclass IPNS {\n  /**\n   * @param {import('ipfs-core-types/src/utils').BufferStore} routing\n   * @param {import('interface-datastore').Datastore} datastore\n   * @param {PeerId} peerId\n   * @param {import('libp2p/src/keychain')} keychain\n   * @param {object} options\n   * @param {string} options.pass\n   * @param {number} [options.initialBroadcastInterval]\n   * @param {number} [options.broadcastInterval]\n   */\n  constructor (routing, datastore, peerId, keychain, options) {\n    this.publisher = new IpnsPublisher(routing, datastore)\n    this.republisher = new IpnsRepublisher(this.publisher, datastore, peerId, keychain, options)\n    this.resolver = new IpnsResolver(routing)\n    this.cache = new TLRU(1000)\n    this.routing = routing\n  }\n\n  /**\n   * Publish\n   *\n   * @param {PrivateKey} privKey\n   * @param {Uint8Array} value\n   * @param {number} lifetime\n   */\n  async publish (privKey, value, lifetime = IpnsPublisher.defaultRecordLifetime) {\n    try {\n      const peerId = await createFromPrivKey(privKey.bytes)\n      await this.publisher.publishWithEOL(privKey, value, lifetime)\n\n      log(`IPNS value ${uint8ArrayToString(value, 'base32')} was published correctly`)\n\n      // // Add to cache\n      const id = peerId.toB58String()\n      // @ts-ignore - parseFloat expects string\n      const ttEol = parseFloat(lifetime)\n      const ttl = (ttEol < defaultRecordTtl) ? ttEol : defaultRecordTtl\n\n      this.cache.set(id, value, ttl)\n\n      log(`IPNS value ${uint8ArrayToString(value, 'base32')} was cached correctly`)\n\n      return {\n        name: id,\n        value: value\n      }\n    } catch (err) {\n      log.error(err)\n\n      throw err\n    }\n  }\n\n  /**\n   * Resolve\n   *\n   * @param {string} name\n   * @param {object} options\n   * @param {boolean} [options.nocache]\n   * @param {boolean} [options.recursive]\n   */\n  async resolve (name, options = {}) {\n    if (typeof name !== 'string') {\n      throw errcode(new Error('name received is not valid'), 'ERR_INVALID_NAME')\n    }\n\n    // If recursive, we should not try to get the cached value\n    if (!options.nocache && !options.recursive) {\n      // Try to get the record from cache\n      const id = name.split('/')[2]\n      const result = this.cache.get(id)\n\n      if (result) {\n        return result\n      }\n    }\n\n    try {\n      const result = await this.resolver.resolve(name, options)\n\n      log(`IPNS record from ${name} was resolved correctly`)\n\n      return result\n    } catch (err) {\n      log.error(err)\n\n      throw err\n    }\n  }\n\n  /**\n   * Initialize keyspace\n   *\n   * Sets the ipns record for the given key to point to an empty directory\n   *\n   * @param {PrivateKey} privKey\n   * @param {Uint8Array} value\n   */\n  async initializeKeyspace (privKey, value) { // eslint-disable-line require-await\n    return this.publish(privKey, value, IpnsPublisher.defaultRecordLifetime)\n  }\n}\n\nmodule.exports = IPNS\n","'use strict'\n\nconst PeerId = require('peer-id')\nconst { Key, Errors } = require('interface-datastore')\nconst errcode = require('err-code')\nconst debug = require('debug')\nconst log = Object.assign(debug('ipfs:ipns:publisher'), {\n  error: debug('ipfs:ipns:publisher:error')\n})\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\nconst ipns = require('ipns')\n\n/**\n * @typedef {import('libp2p-crypto').PrivateKey} PrivateKey\n * @typedef {import('libp2p-crypto').PublicKey} PublicKey\n * @typedef {import('ipns').IPNSEntry} IPNSEntry\n */\n\nconst ERR_NOT_FOUND = Errors.notFoundError().code\nconst defaultRecordLifetime = 60 * 60 * 1000\n\n// IpnsPublisher is capable of publishing and resolving names to the IPFS routing system.\nclass IpnsPublisher {\n  /**\n   * @param {import('ipfs-core-types/src/utils').BufferStore} routing\n   * @param {import('interface-datastore').Datastore} datastore\n   */\n  constructor (routing, datastore) {\n    this._routing = routing\n    this._datastore = datastore\n  }\n\n  /**\n   * Publish record with a eol\n   *\n   * @param {PrivateKey} privKey\n   * @param {Uint8Array} value\n   * @param {number} lifetime\n   */\n  async publishWithEOL (privKey, value, lifetime) {\n    if (!privKey || !privKey.bytes) {\n      throw errcode(new Error('invalid private key'), 'ERR_INVALID_PRIVATE_KEY')\n    }\n\n    const peerId = await PeerId.createFromPrivKey(privKey.bytes)\n    const record = await this._updateOrCreateRecord(privKey, value, lifetime, peerId)\n\n    return this._putRecordToRouting(record, peerId)\n  }\n\n  /**\n   * Accepts a keypair, as well as a value (ipfsPath), and publishes it out to the routing system\n   *\n   * @param {PrivateKey} privKey\n   * @param {Uint8Array} value\n   */\n  publish (privKey, value) {\n    return this.publishWithEOL(privKey, value, defaultRecordLifetime)\n  }\n\n  /**\n   * @param {IPNSEntry} record\n   * @param {PeerId} peerId\n   */\n  async _putRecordToRouting (record, peerId) {\n    if (!(PeerId.isPeerId(peerId))) {\n      const errMsg = 'peerId received is not valid'\n      log.error(errMsg)\n\n      throw errcode(new Error(errMsg), 'ERR_INVALID_PEER_ID')\n    }\n\n    // @ts-ignore - accessing private property isn't allowed\n    const publicKey = peerId._pubKey\n    const embedPublicKeyRecord = await ipns.embedPublicKey(publicKey, record)\n    const keys = ipns.getIdKeys(peerId.toBytes())\n\n    await this._publishEntry(keys.routingKey, embedPublicKeyRecord || record)\n\n    // Publish the public key to support old go-ipfs nodes that are looking for it in the routing\n    // We will be able to deprecate this part in the future, since the public keys will be only\n    // in IPNS record and the peerId.\n    await this._publishPublicKey(keys.routingPubKey, publicKey)\n\n    return embedPublicKeyRecord || record\n  }\n\n  /**\n   * @param {Key} key\n   * @param {IPNSEntry} entry\n   */\n  async _publishEntry (key, entry) {\n    if (!(Key.isKey(key))) {\n      const errMsg = 'datastore key does not have a valid format'\n\n      log.error(errMsg)\n\n      throw errcode(new Error(errMsg), 'ERR_INVALID_DATASTORE_KEY')\n    }\n\n    let entryData\n    try {\n      // Marshal record\n      entryData = ipns.marshal(entry)\n    } catch (err) {\n      log.error(err)\n\n      throw err\n    }\n\n    // Add record to routing (buffer key)\n    try {\n      const res = await this._routing.put(key.uint8Array(), entryData)\n      log(`ipns record for ${uint8ArrayToString(key.uint8Array(), 'base64')} was stored in the routing`)\n\n      return res\n    } catch (err) {\n      const errMsg = `ipns record for ${uint8ArrayToString(key.uint8Array(), 'base64')} could not be stored in the routing`\n      log.error(errMsg)\n      log.error(err)\n\n      throw errcode(new Error(errMsg), 'ERR_PUTTING_TO_ROUTING')\n    }\n  }\n\n  /**\n   * @param {Key} key\n   * @param {PublicKey} publicKey\n   */\n  async _publishPublicKey (key, publicKey) {\n    if ((!Key.isKey(key))) {\n      const errMsg = 'datastore key does not have a valid format'\n      log.error(errMsg)\n\n      throw errcode(new Error(errMsg), 'ERR_INVALID_DATASTORE_KEY')\n    }\n\n    if (!publicKey || !publicKey.bytes) {\n      const errMsg = 'one or more of the provided parameters are not defined'\n      log.error(errMsg)\n\n      throw errcode(new Error(errMsg), 'ERR_UNDEFINED_PARAMETER')\n    }\n\n    // Add public key to routing (buffer key)\n    try {\n      const res = await this._routing.put(key.uint8Array(), publicKey.bytes)\n      log(`public key for ${uint8ArrayToString(key.uint8Array(), 'base64')} was stored in the routing`)\n\n      return res\n    } catch (err) {\n      const errMsg = `public key for ${uint8ArrayToString(key.uint8Array(), 'base64')} could not be stored in the routing`\n      log.error(errMsg)\n      log.error(err)\n\n      throw errcode(new Error(errMsg), 'ERR_PUTTING_TO_ROUTING')\n    }\n  }\n\n  /**\n   * Returns the record this node has published corresponding to the given peer ID.\n   *\n   * If `checkRouting` is true and we have no existing record, this method will check the routing system for any existing records.\n   *\n   * @param {PeerId} peerId\n   * @param {object} options\n   * @param {boolean} [options.checkRouting]\n   */\n  async _getPublished (peerId, options = {}) {\n    if (!(PeerId.isPeerId(peerId))) {\n      const errMsg = 'peerId received is not valid'\n\n      log.error(errMsg)\n\n      throw errcode(new Error(errMsg), 'ERR_INVALID_PEER_ID')\n    }\n\n    const checkRouting = options.checkRouting !== false\n\n    try {\n      const dsVal = await this._datastore.get(ipns.getLocalKey(peerId.id))\n\n      // unmarshal data\n      return this._unmarshalData(dsVal)\n    } catch (err) {\n      if (err.code !== ERR_NOT_FOUND) {\n        const errMsg = `unexpected error getting the ipns record ${peerId.id} from datastore`\n        log.error(errMsg)\n\n        throw errcode(new Error(errMsg), 'ERR_UNEXPECTED_DATASTORE_RESPONSE')\n      }\n\n      if (!checkRouting) {\n        throw errcode(err, 'ERR_NOT_FOUND_AND_CHECK_ROUTING_NOT_ENABLED')\n      }\n\n      // Try to get from routing\n      try {\n        const keys = ipns.getIdKeys(peerId.toBytes())\n        const res = await this._routing.get(keys.routingKey.uint8Array())\n\n        // unmarshal data\n        return this._unmarshalData(res)\n      } catch (err) {\n        log.error(err)\n\n        throw err\n      }\n    }\n  }\n\n  /**\n   * @param {Uint8Array} data\n   */\n  _unmarshalData (data) {\n    try {\n      return ipns.unmarshal(data)\n    } catch (err) {\n      throw errcode(err, 'ERR_INVALID_RECORD_DATA')\n    }\n  }\n\n  /**\n   * @param {PrivateKey} privKey\n   * @param {Uint8Array} value\n   * @param {number} lifetime\n   * @param {PeerId} peerId\n   */\n  async _updateOrCreateRecord (privKey, value, lifetime, peerId) {\n    if (!(PeerId.isPeerId(peerId))) {\n      const errMsg = 'peerId received is not valid'\n      log.error(errMsg)\n\n      throw errcode(new Error(errMsg), 'ERR_INVALID_PEER_ID')\n    }\n\n    const getPublishedOptions = {\n      checkRouting: true\n    }\n\n    let record\n\n    try {\n      record = await this._getPublished(peerId, getPublishedOptions)\n    } catch (err) {\n      if (err.code !== ERR_NOT_FOUND) {\n        const errMsg = `unexpected error when determining the last published IPNS record for ${peerId.id} ${err.stack}`\n        log.error(errMsg)\n\n        throw errcode(new Error(errMsg), 'ERR_DETERMINING_PUBLISHED_RECORD')\n      }\n    }\n\n    // Determinate the record sequence number\n    let seqNumber = 0\n\n    if (record && record.sequence !== undefined) {\n      seqNumber = !uint8ArrayEquals(record.value, value) ? record.sequence + 1 : record.sequence\n    }\n\n    let entryData\n\n    try {\n      // Create record\n      entryData = await ipns.create(privKey, value, seqNumber, lifetime)\n    } catch (err) {\n      const errMsg = `ipns record for ${value} could not be created`\n\n      log.error(err)\n      throw errcode(new Error(errMsg), 'ERR_CREATING_IPNS_RECORD')\n    }\n\n    // TODO IMPROVEMENT - set ttl (still experimental feature for go)\n\n    try {\n      // Marshal record\n      const data = ipns.marshal(entryData)\n\n      // Store the new record\n      await this._datastore.put(ipns.getLocalKey(peerId.id), data)\n\n      log(`ipns record for ${uint8ArrayToString(value, 'base32')} was stored in the datastore`)\n\n      return entryData\n    } catch (err) {\n      const errMsg = `ipns record for ${value} could not be stored in the datastore`\n      log.error(errMsg)\n\n      throw errcode(new Error(errMsg), 'ERR_STORING_IN_DATASTORE')\n    }\n  }\n}\n\nIpnsPublisher.defaultRecordLifetime = defaultRecordLifetime\nexports = module.exports = IpnsPublisher\n","'use strict'\n\nconst NanoDate = require('timestamp-nano')\nconst { Key } = require('interface-datastore')\nconst crypto = require('libp2p-crypto')\nconst PeerId = require('peer-id')\nconst multihash = require('multihashes')\nconst errCode = require('err-code')\nconst multibase = require('multibase')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayConcat = require('uint8arrays/concat')\n\nconst debug = require('debug')\nconst log = Object.assign(debug('jsipns'), {\n  error: debug('jsipns:error')\n})\n\nconst {\n  IpnsEntry: ipnsEntryProto\n} = require('./pb/ipns.js')\nconst { parseRFC3339 } = require('./utils')\nconst ERRORS = require('./errors')\n\nconst ID_MULTIHASH_CODE = multihash.names.identity\n\nconst namespace = '/ipns/'\n\n/**\n * @typedef {import('./types').IPNSEntry} IPNSEntry\n * @typedef {import('libp2p-crypto').PublicKey} PublicKey\n * @typedef {import('libp2p-crypto').PrivateKey} PrivateKey\n */\n\n/**\n * Creates a new ipns entry and signs it with the given private key.\n * The ipns entry validity should follow the [RFC3339]{@link https://www.ietf.org/rfc/rfc3339.txt} with nanoseconds precision.\n * Note: This function does not embed the public key. If you want to do that, use `EmbedPublicKey`.\n *\n * @param {PrivateKey} privateKey - private key for signing the record.\n * @param {Uint8Array} value - value to be stored in the record.\n * @param {number} seq - number representing the current version of the record.\n * @param {number} lifetime - lifetime of the record (in milliseconds).\n */\nconst create = (privateKey, value, seq, lifetime) => {\n  // Validity in ISOString with nanoseconds precision and validity type EOL\n  const isoValidity = new NanoDate(Date.now() + Number(lifetime)).toString()\n  const validityType = ipnsEntryProto.ValidityType.EOL\n  return _create(privateKey, value, seq, uint8ArrayFromString(isoValidity), validityType)\n}\n\n/**\n * Same as create(), but instead of generating a new Date, it receives the intended expiration time\n * WARNING: nano precision is not standard, make sure the value in seconds is 9 orders of magnitude lesser than the one provided.\n *\n * @param {PrivateKey} privateKey - private key for signing the record.\n * @param {Uint8Array} value - value to be stored in the record.\n * @param {number} seq - number representing the current version of the record.\n * @param {string} expiration - expiration datetime for record in the [RFC3339]{@link https://www.ietf.org/rfc/rfc3339.txt} with nanoseconds precision.\n */\nconst createWithExpiration = (privateKey, value, seq, expiration) => {\n  const validityType = ipnsEntryProto.ValidityType.EOL\n  return _create(privateKey, value, seq, uint8ArrayFromString(expiration), validityType)\n}\n\n/**\n * @param {PrivateKey} privateKey\n * @param {Uint8Array} value\n * @param {number} seq\n * @param {Uint8Array} isoValidity\n * @param {number} validityType\n */\nconst _create = async (privateKey, value, seq, isoValidity, validityType) => {\n  const signature = await sign(privateKey, value, validityType, isoValidity)\n\n  const entry = {\n    value,\n    signature: signature,\n    validityType: validityType,\n    validity: isoValidity,\n    sequence: seq\n  }\n\n  log(`ipns entry for ${value} created`)\n  return entry\n}\n\n/**\n * Validates the given ipns entry against the given public key.\n *\n * @param {PublicKey} publicKey - public key for validating the record.\n * @param {IPNSEntry} entry - ipns entry record.\n */\nconst validate = async (publicKey, entry) => {\n  const { value, validityType, validity } = entry\n  const dataForSignature = ipnsEntryDataForSig(value, validityType, validity)\n\n  // Validate Signature\n  let isValid\n  try {\n    isValid = await publicKey.verify(dataForSignature, entry.signature)\n  } catch (err) {\n    isValid = false\n  }\n  if (!isValid) {\n    log.error('record signature verification failed')\n    throw errCode(new Error('record signature verification failed'), ERRORS.ERR_SIGNATURE_VERIFICATION)\n  }\n\n  // Validate according to the validity type\n  if (validityType === ipnsEntryProto.ValidityType.EOL) {\n    let validityDate\n\n    try {\n      validityDate = parseRFC3339(uint8ArrayToString(validity))\n    } catch (e) {\n      log.error('unrecognized validity format (not an rfc3339 format)')\n      throw errCode(new Error('unrecognized validity format (not an rfc3339 format)'), ERRORS.ERR_UNRECOGNIZED_FORMAT)\n    }\n\n    if (validityDate.getTime() < Date.now()) {\n      log.error('record has expired')\n      throw errCode(new Error('record has expired'), ERRORS.ERR_IPNS_EXPIRED_RECORD)\n    }\n  } else if (validityType) {\n    log.error('unrecognized validity type')\n    throw errCode(new Error('unrecognized validity type'), ERRORS.ERR_UNRECOGNIZED_VALIDITY)\n  }\n\n  log(`ipns entry for ${value} is valid`)\n}\n\n/**\n * Embed the given public key in the given entry. While not strictly required,\n * some nodes (eg. DHT servers) may reject IPNS entries that don't embed their\n * public keys as they may not be able to validate them efficiently.\n * As a consequence of nodes needing to validade a record upon receipt, they need\n * the public key associated with it. For olde RSA keys, it is easier if we just\n * send this as part of the record itself. For newer ed25519 keys, the public key\n * can be embedded in the peerId.\n *\n * @param {PublicKey} publicKey - public key to embed.\n * @param {IPNSEntry} entry - ipns entry record.\n */\nconst embedPublicKey = async (publicKey, entry) => {\n  if (!publicKey || !publicKey.bytes || !entry) {\n    const error = new Error('one or more of the provided parameters are not defined')\n    log.error(error)\n    throw errCode(error, ERRORS.ERR_UNDEFINED_PARAMETER)\n  }\n\n  // Create a peer id from the public key.\n  let peerId\n  try {\n    peerId = await PeerId.createFromPubKey(publicKey.bytes)\n  } catch (err) {\n    throw errCode(err, ERRORS.ERR_PEER_ID_FROM_PUBLIC_KEY)\n  }\n\n  // Try to extract the public key from the ID. If we can, no need to embed it\n  let extractedPublicKey\n  try {\n    extractedPublicKey = extractPublicKeyFromId(peerId)\n  } catch (err) {\n    log.error(err)\n    throw errCode(err, ERRORS.ERR_PUBLIC_KEY_FROM_ID)\n  }\n\n  if (extractedPublicKey) {\n    return null\n  }\n\n  // If we failed to extract the public key from the peer ID, embed it in the record.\n  try {\n    entry.pubKey = crypto.keys.marshalPublicKey(publicKey)\n  } catch (err) {\n    log.error(err)\n    throw err\n  }\n  return entry\n}\n\n/**\n * Extracts a public key matching `pid` from the ipns record.\n *\n * @param {PeerId} peerId - peer identifier object.\n * @param {IPNSEntry} entry - ipns entry record.\n */\nconst extractPublicKey = (peerId, entry) => {\n  if (!entry || !peerId) {\n    const error = new Error('one or more of the provided parameters are not defined')\n\n    log.error(error)\n    throw errCode(error, ERRORS.ERR_UNDEFINED_PARAMETER)\n  }\n\n  if (entry.pubKey) {\n    let pubKey\n    try {\n      pubKey = crypto.keys.unmarshalPublicKey(entry.pubKey)\n    } catch (err) {\n      log.error(err)\n      throw err\n    }\n    return pubKey\n  }\n\n  if (peerId.pubKey) {\n    return peerId.pubKey\n  }\n  throw Object.assign(new Error('no public key is available'), { code: ERRORS.ERR_UNDEFINED_PARAMETER })\n}\n\n/**\n * rawStdEncoding with RFC4648\n *\n * @param {Uint8Array} key\n */\nconst rawStdEncoding = (key) => uint8ArrayToString(multibase.encode('base32', key)).slice(1).toUpperCase()\n\n/**\n * Get key for storing the record locally.\n * Format: /ipns/${base32(<HASH>)}\n *\n * @param {Uint8Array} key - peer identifier object.\n */\nconst getLocalKey = (key) => new Key(`/ipns/${rawStdEncoding(key)}`)\n\n/**\n * Get key for sharing the record in the routing mechanism.\n * Format: ${base32(/ipns/<HASH>)}, ${base32(/pk/<HASH>)}\n *\n * @param {Uint8Array} pid - peer identifier represented by the multihash of the public key as Uint8Array.\n */\nconst getIdKeys = (pid) => {\n  const pkBuffer = uint8ArrayFromString('/pk/')\n  const ipnsBuffer = uint8ArrayFromString('/ipns/')\n\n  return {\n    routingPubKey: new Key(uint8ArrayConcat([pkBuffer, pid]), false), // Added on https://github.com/ipfs/js-ipns/pull/8#issue-213857876 (pkKey will be deprecated in a future release)\n    pkKey: new Key(rawStdEncoding(uint8ArrayConcat([pkBuffer, pid]))),\n    routingKey: new Key(uint8ArrayConcat([ipnsBuffer, pid]), false), // Added on https://github.com/ipfs/js-ipns/pull/6#issue-213631461 (ipnsKey will be deprecated in a future release)\n    ipnsKey: new Key(rawStdEncoding(uint8ArrayConcat([ipnsBuffer, pid])))\n  }\n}\n\n/**\n * Sign ipns record data\n *\n * @param {PrivateKey} privateKey\n * @param {Uint8Array} value\n * @param {number} validityType\n * @param {Uint8Array} validity\n */\nconst sign = (privateKey, value, validityType, validity) => {\n  try {\n    const dataForSignature = ipnsEntryDataForSig(value, validityType, validity)\n\n    return privateKey.sign(dataForSignature)\n  } catch (error) {\n    log.error('record signature creation failed')\n    throw errCode(new Error('record signature creation failed: ' + error.message), ERRORS.ERR_SIGNATURE_CREATION)\n  }\n}\n\n/**\n * Utility for getting the validity type code name of a validity\n *\n * @param {number} validityType\n */\nconst getValidityType = (validityType) => {\n  if (validityType.toString() === '0') {\n    return 'EOL'\n  }\n\n  const error = new Error(`unrecognized validity type ${validityType.toString()}`)\n  log.error(error)\n  throw errCode(error, ERRORS.ERR_UNRECOGNIZED_VALIDITY)\n}\n\n/**\n * Utility for creating the record data for being signed\n *\n * @param {Uint8Array} value\n * @param {number} validityType\n * @param {Uint8Array} validity\n */\nconst ipnsEntryDataForSig = (value, validityType, validity) => {\n  const validityTypeBuffer = uint8ArrayFromString(getValidityType(validityType))\n\n  return uint8ArrayConcat([value, validity, validityTypeBuffer])\n}\n\n/**\n * Utility for extracting the public key from a peer-id\n *\n * @param {PeerId} peerId\n */\nconst extractPublicKeyFromId = (peerId) => {\n  const decodedId = multihash.decode(peerId.id)\n\n  if (decodedId.code !== ID_MULTIHASH_CODE) {\n    return null\n  }\n\n  return crypto.keys.unmarshalPublicKey(decodedId.digest)\n}\n\n/**\n * @param {IPNSEntry} obj\n */\nconst marshal = (obj) => {\n  return ipnsEntryProto.encode(obj).finish()\n}\n\n/**\n * @param {Uint8Array} buf\n * @returns {IPNSEntry}\n */\nconst unmarshal = (buf) => {\n  const message = ipnsEntryProto.decode(buf)\n  const object = ipnsEntryProto.toObject(message, {\n    defaults: false,\n    arrays: true,\n    longs: Number,\n    objects: false\n  })\n\n  return {\n    value: object.value,\n    signature: object.signature,\n    validityType: object.validityType,\n    validity: object.validity,\n    sequence: object.sequence,\n    pubKey: object.pubKey\n  }\n}\n\nconst validator = {\n  /**\n   * @param {Uint8Array} marshalledData\n   * @param {Uint8Array} key\n   */\n  validate: async (marshalledData, key) => {\n    const receivedEntry = unmarshal(marshalledData)\n    const bufferId = key.slice('/ipns/'.length)\n    const peerId = PeerId.createFromBytes(bufferId)\n\n    // extract public key\n    const pubKey = extractPublicKey(peerId, receivedEntry)\n\n    // Record validation\n    await validate(pubKey, receivedEntry)\n  },\n  /**\n   * @param {Uint8Array} dataA\n   * @param {Uint8Array} dataB\n   */\n  select: (dataA, dataB) => {\n    const entryA = unmarshal(dataA)\n    const entryB = unmarshal(dataB)\n\n    return entryA.sequence > entryB.sequence ? 0 : 1\n  }\n}\n\nmodule.exports = {\n  // create ipns entry record\n  create,\n  // create ipns entry record specifying the expiration time\n  createWithExpiration,\n  // validate ipns entry record\n  validate,\n  // embed public key in the record\n  embedPublicKey,\n  // extract public key from the record\n  extractPublicKey,\n  // get key for storing the entry locally\n  getLocalKey,\n  // get keys for routing\n  getIdKeys,\n  // marshal\n  marshal,\n  // unmarshal\n  unmarshal,\n  // validator\n  validator,\n  // namespace\n  namespace,\n  namespaceLength: namespace.length\n}\n","/**\n * Timestamp for 64-bit time_t, nanosecond precision and strftime\n *\n * @author Yusuke Kawasaki\n * @license MIT\n * @see https://github.com/kawanet/timestamp-nano\n */\n\nvar Timestamp = (function() {\n  if (\"undefined\" !== typeof module) module.exports = Timestamp;\n\n  var SEC_DAY = 24 * 3600; // seconds per day\n  var YEAR_SLOT = 3200; // years per slot\n  var DAY_SLOT = (365 * 400 + 97) * YEAR_SLOT / 400; // days per slot\n  var SEC_SLOT = SEC_DAY * DAY_SLOT; // seconds per slot\n  var MSEC_SLOT = SEC_SLOT * 1000; // mseconds per slot\n\n  // 15.9.1.1 Time Values and Time Range\n  // The actual range of times supported by ECMAScript Date objects is\n  // exactly –100,000,000 days to 100,000,000 days measured relative to\n  // midnight at the beginning of 01 January, 1970 UTC.\n  var MAX_MSEC = 1000 * 10000 * 10000 * SEC_DAY;\n\n  var BIT24 = 0x1000000;\n  var BIT32 = 0x10000 * 0x10000;\n  var DEC6 = 1000 * 1000;\n  var DEC9 = 1000 * 1000 * 1000;\n  var ZERO9 = \"000000000\";\n\n  var trunc = Math.trunc || Math_trunc;\n  var P = Timestamp.prototype;\n\n  // static methods\n  Timestamp.fromDate = fromDate;\n  Timestamp.fromInt64BE = buildFromInt64(0, 1, 2, 3, 0, 4);\n  Timestamp.fromInt64LE = buildFromInt64(3, 2, 1, 0, 4, 0);\n  Timestamp.fromString = fromString;\n  Timestamp.fromTimeT = fromTimeT;\n\n  // private properties\n  P.year = 0; // Offset number for year precision\n  P.time = 0; // Milliseconds from epoch\n  P.nano = 0; // Offset number for nanosecond precision\n\n  // instance methods\n  P.addNano = addNano;\n  P.getNano = getNano;\n  P.getTimeT = getTimeT;\n  P.getYear = getYear;\n  P.toDate = toDate;\n  P.toJSON = toJSON;\n  P.toString = toString;\n  P.writeInt64BE = buildWriteInt64(0, 1, 2, 3, 0, 4);\n  P.writeInt64LE = buildWriteInt64(3, 2, 1, 0, 4, 0);\n\n  var FMT_JSON = \"%Y-%m-%dT%H:%M:%S.%NZ\";\n\n  var FMT_MONTH = [\n    \"Jan\", \"Feb\", \"Mar\", \"Apr\", \"May\", \"Jun\",\n    \"Jul\", \"Aug\", \"Sep\", \"Oct\", \"Nov\", \"Dec\"\n  ];\n\n  var FMT_DAY = [\n    \"Sun\", \"Mon\", \"Tue\", \"Wed\", \"Thu\", \"Fri\", \"Sat\"\n  ];\n\n  var FMT_STRING = {\n    \"%\": \"%\",\n    F: \"%Y-%m-%d\",\n    n: \"\\n\",\n    R: \"%H:%M\",\n    T: \"%H:%M:%S\",\n    t: \"\\t\",\n    X: \"%T\",\n    Z: \"GMT\",\n    z: \"+0000\"\n  };\n\n  return Timestamp;\n\n  function Timestamp(time, nano, year) {\n    var ts = this;\n    if (!(ts instanceof Timestamp)) return new Timestamp(time, nano, year);\n    ts.time = +time || 0;\n    ts.nano = +nano || 0;\n    ts.year = +year || 0;\n    normalize(ts);\n  }\n\n  function getYear() {\n    var year = this.toDate().getUTCFullYear();\n    return year + this.year;\n  }\n\n  function normalize(ts) {\n    var year = ts.year;\n    var time = ts.time;\n    var nano = ts.nano;\n    var changed;\n    var slot;\n\n    // normalize nano\n    if (nano < 0 || DEC6 <= nano) {\n      var n = Math.floor(nano / DEC6);\n      nano -= n * DEC6;\n      time += n;\n      changed = 1;\n    }\n\n    var y = year % YEAR_SLOT;\n    if (time < -MAX_MSEC || MAX_MSEC < time || y) {\n      // shrink time into the minimal slot\n      slot = trunc(time / MSEC_SLOT);\n      if (slot) {\n        year += slot * YEAR_SLOT;\n        time -= slot * MSEC_SLOT;\n      }\n\n      // add year offset smaller than a slot\n      var dt = newDate(time);\n      dt.setUTCFullYear(y + dt.getUTCFullYear());\n      year -= y;\n      time = +dt;\n\n      // use full range of 100 million days.\n      slot = trunc(year / YEAR_SLOT);\n      var total = time + slot * MSEC_SLOT;\n      if (slot && -MAX_MSEC <= total && total <= MAX_MSEC) {\n        year -= slot * YEAR_SLOT;\n        time = total;\n      }\n\n      changed = 1;\n    }\n\n    if (changed) {\n      ts.year = year;\n      ts.time = time;\n      ts.nano = nano;\n    }\n\n    return ts;\n  }\n\n  function toDate() {\n    var ts = normalize(this);\n    return newDate(ts.time);\n  }\n\n  function newDate(time) {\n    var dt = new Date(0);\n    dt.setTime(time);\n    return dt;\n  }\n\n  function addNano(nano) {\n    this.nano += +nano || 0;\n    return this;\n  }\n\n  function getNano() {\n    var ts = normalize(this);\n    return ((ts.time % 1000) * DEC6 + (+ts.nano) + DEC9) % DEC9;\n  }\n\n  function fromString(string) {\n    var time;\n    var ts = new Timestamp();\n    string += \"\";\n\n    var array = string.replace(/^\\s*[+\\-]?\\d+/, function(match) {\n      var year = +match;\n      // Use only years around 1970 to avoid Date's terrible behavior:\n      // 15.9.4.3 Date.UTC\n      // If y is not NaN and 0 <= y <= 99, then let yr be 1900+y\n      var y = 1970 + ((year - 1970) % 400);\n      ts.year = year - y;\n      return y;\n    }).replace(/(?:Z|([+\\-]\\d{2}):?(\\d{2}))$/, function(match, hour, min) {\n      // time zone\n      if (hour < 0) min *= -1;\n      time = ((+hour) * 60 + (+min)) * 60000;\n      return \"\";\n    }).replace(/\\.\\d+$/, function(match) {\n      // nanoseconds\n      ts.nano = +((match + ZERO9).substr(1, 9));\n      return \"\";\n    }).split(/\\D+/);\n\n    if (array.length > 1) {\n      array[1]--; // month starts from 0\n    } else {\n      array[1] = 0;\n    }\n\n    ts.time = time = Date.UTC.apply(Date, array) - (time || 0);\n\n    if (isNaN(time)) {\n      throw new TypeError(\"Invalid Date\");\n    }\n\n    return normalize(ts);\n  }\n\n  function fromDate(date) {\n    return new Timestamp(+date);\n  }\n\n  function fromTimeT(time) {\n    return fromTime(time, 0);\n  }\n\n  function fromTime(low, high) {\n    high |= 0;\n    high *= BIT32;\n    low = +low || 0;\n\n    // slot count\n    var slot = trunc(high / SEC_SLOT) + trunc(low / SEC_SLOT);\n\n    // seconds within slot\n    var second = (high % SEC_SLOT) + (low % SEC_SLOT);\n\n    // slot offset\n    var offset = trunc(second / SEC_SLOT);\n    if (offset) {\n      slot += offset;\n      second -= offset * SEC_SLOT;\n    }\n\n    return new Timestamp(second * 1000, 0, slot * YEAR_SLOT);\n  }\n\n  function getTimeT() {\n    var ts = normalize(this);\n    var time = Math.floor(ts.time / 1000);\n\n    var year = ts.year;\n    if (year) time += year * DAY_SLOT * SEC_DAY / YEAR_SLOT;\n\n    // this may loose some bits over than 53 bit precision\n    return time;\n  }\n\n  function toJSON() {\n    return this.toString().replace(/0{1,6}Z$/, \"Z\");\n  }\n\n  function toString(format) {\n    var ts = this;\n    var dt = ts.toDate();\n    var map = {\n      H: H,\n      L: L,\n      M: M,\n      N: N,\n      S: S,\n      Y: Y,\n      a: a,\n      b: b,\n      d: d,\n      e: e,\n      m: m\n    };\n\n    return strftime(format || FMT_JSON);\n\n    function strftime(format) {\n      return format.replace(/%./g, function(match) {\n        var m = match[1];\n        var c = FMT_STRING[m];\n        var f = map[m];\n        return c ? strftime(c) : f ? f() : match;\n      });\n    }\n\n    function Y() {\n      var year = ts.getYear();\n      if (year > 999999) {\n        return \"+\" + year;\n      } else if (year > 9999) {\n        return \"+\" + pad(year, 6);\n      } else if (year >= 0) {\n        return pad(year, 4);\n      } else if (year >= -999999) {\n        return \"-\" + pad(-year, 6);\n      } else {\n        return year;\n      }\n    }\n\n    function m() {\n      return pad2(dt.getUTCMonth() + 1);\n    }\n\n    function d() {\n      return pad2(dt.getUTCDate());\n    }\n\n    function e() {\n      return padS(dt.getUTCDate());\n    }\n\n    function H() {\n      return pad2(dt.getUTCHours());\n    }\n\n    function M() {\n      return pad2(dt.getUTCMinutes());\n    }\n\n    function S() {\n      return pad2(dt.getUTCSeconds());\n    }\n\n    function L() {\n      return pad(dt.getUTCMilliseconds(), 3);\n    }\n\n    function N() {\n      return pad(ts.getNano(), 9);\n    }\n\n    function a() {\n      return FMT_DAY[dt.getUTCDay()];\n    }\n\n    function b() {\n      return FMT_MONTH[dt.getUTCMonth()];\n    }\n  }\n\n  function buildWriteInt64(pos0, pos1, pos2, pos3, posH, posL) {\n    return writeInt64;\n\n    function writeInt64(buffer, offset) {\n      var ts = normalize(this);\n      if (!buffer) buffer = new Array(8);\n      checkRange(buffer, offset |= 0);\n\n      var second = Math.floor(ts.time / 1000);\n      var day = ts.year * (DAY_SLOT * SEC_DAY / YEAR_SLOT);\n      var high = trunc(day / BIT32) + trunc(second / BIT32);\n      var low = (day % BIT32) + (second % BIT32);\n\n      // slot offset\n      var slot = Math.floor(low / BIT32);\n      if (slot) {\n        high += slot;\n        low -= slot * BIT32;\n      }\n\n      writeUint32(buffer, offset + posH, high);\n      writeUint32(buffer, offset + posL, low);\n      return buffer;\n    }\n\n    function writeUint32(buffer, offset, value) {\n      buffer[offset + pos0] = (value >> 24) & 255;\n      buffer[offset + pos1] = (value >> 16) & 255;\n      buffer[offset + pos2] = (value >> 8) & 255;\n      buffer[offset + pos3] = value & 255;\n    }\n  }\n\n  function buildFromInt64(pos0, pos1, pos2, pos3, posH, posL) {\n    return fromInt64;\n\n    function fromInt64(buffer, offset) {\n      checkRange(buffer, offset |= 0);\n      var high = readUint32(buffer, offset + posH);\n      var low = readUint32(buffer, offset + posL);\n      return fromTime(low, high);\n    }\n\n    function readUint32(buffer, offset) {\n      return (buffer[offset + pos0] * BIT24) +\n        ((buffer[offset + pos1] << 16) |\n          (buffer[offset + pos2] << 8) |\n          buffer[offset + pos3]);\n    }\n  }\n\n  function checkRange(buffer, offset) {\n    var last = buffer && buffer.length;\n    if (last == null) throw new TypeError(\"Invalid Buffer\");\n    if (last < offset + 8) throw new RangeError(\"Out of range\");\n  }\n\n  function Math_trunc(x) {\n    var n = x - x % 1;\n    return n === 0 && (x < 0 || (x === 0 && (1 / x !== 1 / 0))) ? -0 : n;\n  }\n\n  function padS(v) {\n    return (v > 9 ? \"\" : \" \") + (v | 0);\n  }\n\n  function pad2(v) {\n    return (v > 9 ? \"\" : \"0\") + (v | 0);\n  }\n\n  function pad(v, len) {\n    return (ZERO9 + (v | 0)).substr(-len);\n  }\n})();\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"ipfs-ipns\"] || ($protobuf.roots[\"ipfs-ipns\"] = {});\n\n$root.IpnsEntry = (function() {\n\n    /**\n     * Properties of an IpnsEntry.\n     * @exports IIpnsEntry\n     * @interface IIpnsEntry\n     * @property {Uint8Array} value IpnsEntry value\n     * @property {Uint8Array} signature IpnsEntry signature\n     * @property {IpnsEntry.ValidityType|null} [validityType] IpnsEntry validityType\n     * @property {Uint8Array|null} [validity] IpnsEntry validity\n     * @property {number|null} [sequence] IpnsEntry sequence\n     * @property {number|null} [ttl] IpnsEntry ttl\n     * @property {Uint8Array|null} [pubKey] IpnsEntry pubKey\n     */\n\n    /**\n     * Constructs a new IpnsEntry.\n     * @exports IpnsEntry\n     * @classdesc Represents an IpnsEntry.\n     * @implements IIpnsEntry\n     * @constructor\n     * @param {IIpnsEntry=} [p] Properties to set\n     */\n    function IpnsEntry(p) {\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * IpnsEntry value.\n     * @member {Uint8Array} value\n     * @memberof IpnsEntry\n     * @instance\n     */\n    IpnsEntry.prototype.value = $util.newBuffer([]);\n\n    /**\n     * IpnsEntry signature.\n     * @member {Uint8Array} signature\n     * @memberof IpnsEntry\n     * @instance\n     */\n    IpnsEntry.prototype.signature = $util.newBuffer([]);\n\n    /**\n     * IpnsEntry validityType.\n     * @member {IpnsEntry.ValidityType} validityType\n     * @memberof IpnsEntry\n     * @instance\n     */\n    IpnsEntry.prototype.validityType = 0;\n\n    /**\n     * IpnsEntry validity.\n     * @member {Uint8Array} validity\n     * @memberof IpnsEntry\n     * @instance\n     */\n    IpnsEntry.prototype.validity = $util.newBuffer([]);\n\n    /**\n     * IpnsEntry sequence.\n     * @member {number} sequence\n     * @memberof IpnsEntry\n     * @instance\n     */\n    IpnsEntry.prototype.sequence = $util.Long ? $util.Long.fromBits(0,0,true) : 0;\n\n    /**\n     * IpnsEntry ttl.\n     * @member {number} ttl\n     * @memberof IpnsEntry\n     * @instance\n     */\n    IpnsEntry.prototype.ttl = $util.Long ? $util.Long.fromBits(0,0,true) : 0;\n\n    /**\n     * IpnsEntry pubKey.\n     * @member {Uint8Array} pubKey\n     * @memberof IpnsEntry\n     * @instance\n     */\n    IpnsEntry.prototype.pubKey = $util.newBuffer([]);\n\n    /**\n     * Encodes the specified IpnsEntry message. Does not implicitly {@link IpnsEntry.verify|verify} messages.\n     * @function encode\n     * @memberof IpnsEntry\n     * @static\n     * @param {IIpnsEntry} m IpnsEntry message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    IpnsEntry.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        w.uint32(10).bytes(m.value);\n        w.uint32(18).bytes(m.signature);\n        if (m.validityType != null && Object.hasOwnProperty.call(m, \"validityType\"))\n            w.uint32(24).int32(m.validityType);\n        if (m.validity != null && Object.hasOwnProperty.call(m, \"validity\"))\n            w.uint32(34).bytes(m.validity);\n        if (m.sequence != null && Object.hasOwnProperty.call(m, \"sequence\"))\n            w.uint32(40).uint64(m.sequence);\n        if (m.ttl != null && Object.hasOwnProperty.call(m, \"ttl\"))\n            w.uint32(48).uint64(m.ttl);\n        if (m.pubKey != null && Object.hasOwnProperty.call(m, \"pubKey\"))\n            w.uint32(58).bytes(m.pubKey);\n        return w;\n    };\n\n    /**\n     * Decodes an IpnsEntry message from the specified reader or buffer.\n     * @function decode\n     * @memberof IpnsEntry\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {IpnsEntry} IpnsEntry\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    IpnsEntry.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.IpnsEntry();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.value = r.bytes();\n                break;\n            case 2:\n                m.signature = r.bytes();\n                break;\n            case 3:\n                m.validityType = r.int32();\n                break;\n            case 4:\n                m.validity = r.bytes();\n                break;\n            case 5:\n                m.sequence = r.uint64();\n                break;\n            case 6:\n                m.ttl = r.uint64();\n                break;\n            case 7:\n                m.pubKey = r.bytes();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        if (!m.hasOwnProperty(\"value\"))\n            throw $util.ProtocolError(\"missing required 'value'\", { instance: m });\n        if (!m.hasOwnProperty(\"signature\"))\n            throw $util.ProtocolError(\"missing required 'signature'\", { instance: m });\n        return m;\n    };\n\n    /**\n     * Creates an IpnsEntry message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof IpnsEntry\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {IpnsEntry} IpnsEntry\n     */\n    IpnsEntry.fromObject = function fromObject(d) {\n        if (d instanceof $root.IpnsEntry)\n            return d;\n        var m = new $root.IpnsEntry();\n        if (d.value != null) {\n            if (typeof d.value === \"string\")\n                $util.base64.decode(d.value, m.value = $util.newBuffer($util.base64.length(d.value)), 0);\n            else if (d.value.length)\n                m.value = d.value;\n        }\n        if (d.signature != null) {\n            if (typeof d.signature === \"string\")\n                $util.base64.decode(d.signature, m.signature = $util.newBuffer($util.base64.length(d.signature)), 0);\n            else if (d.signature.length)\n                m.signature = d.signature;\n        }\n        switch (d.validityType) {\n        case \"EOL\":\n        case 0:\n            m.validityType = 0;\n            break;\n        }\n        if (d.validity != null) {\n            if (typeof d.validity === \"string\")\n                $util.base64.decode(d.validity, m.validity = $util.newBuffer($util.base64.length(d.validity)), 0);\n            else if (d.validity.length)\n                m.validity = d.validity;\n        }\n        if (d.sequence != null) {\n            if ($util.Long)\n                (m.sequence = $util.Long.fromValue(d.sequence)).unsigned = true;\n            else if (typeof d.sequence === \"string\")\n                m.sequence = parseInt(d.sequence, 10);\n            else if (typeof d.sequence === \"number\")\n                m.sequence = d.sequence;\n            else if (typeof d.sequence === \"object\")\n                m.sequence = new $util.LongBits(d.sequence.low >>> 0, d.sequence.high >>> 0).toNumber(true);\n        }\n        if (d.ttl != null) {\n            if ($util.Long)\n                (m.ttl = $util.Long.fromValue(d.ttl)).unsigned = true;\n            else if (typeof d.ttl === \"string\")\n                m.ttl = parseInt(d.ttl, 10);\n            else if (typeof d.ttl === \"number\")\n                m.ttl = d.ttl;\n            else if (typeof d.ttl === \"object\")\n                m.ttl = new $util.LongBits(d.ttl.low >>> 0, d.ttl.high >>> 0).toNumber(true);\n        }\n        if (d.pubKey != null) {\n            if (typeof d.pubKey === \"string\")\n                $util.base64.decode(d.pubKey, m.pubKey = $util.newBuffer($util.base64.length(d.pubKey)), 0);\n            else if (d.pubKey.length)\n                m.pubKey = d.pubKey;\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from an IpnsEntry message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof IpnsEntry\n     * @static\n     * @param {IpnsEntry} m IpnsEntry\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    IpnsEntry.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.defaults) {\n            if (o.bytes === String)\n                d.value = \"\";\n            else {\n                d.value = [];\n                if (o.bytes !== Array)\n                    d.value = $util.newBuffer(d.value);\n            }\n            if (o.bytes === String)\n                d.signature = \"\";\n            else {\n                d.signature = [];\n                if (o.bytes !== Array)\n                    d.signature = $util.newBuffer(d.signature);\n            }\n            d.validityType = o.enums === String ? \"EOL\" : 0;\n            if (o.bytes === String)\n                d.validity = \"\";\n            else {\n                d.validity = [];\n                if (o.bytes !== Array)\n                    d.validity = $util.newBuffer(d.validity);\n            }\n            if ($util.Long) {\n                var n = new $util.Long(0, 0, true);\n                d.sequence = o.longs === String ? n.toString() : o.longs === Number ? n.toNumber() : n;\n            } else\n                d.sequence = o.longs === String ? \"0\" : 0;\n            if ($util.Long) {\n                var n = new $util.Long(0, 0, true);\n                d.ttl = o.longs === String ? n.toString() : o.longs === Number ? n.toNumber() : n;\n            } else\n                d.ttl = o.longs === String ? \"0\" : 0;\n            if (o.bytes === String)\n                d.pubKey = \"\";\n            else {\n                d.pubKey = [];\n                if (o.bytes !== Array)\n                    d.pubKey = $util.newBuffer(d.pubKey);\n            }\n        }\n        if (m.value != null && m.hasOwnProperty(\"value\")) {\n            d.value = o.bytes === String ? $util.base64.encode(m.value, 0, m.value.length) : o.bytes === Array ? Array.prototype.slice.call(m.value) : m.value;\n        }\n        if (m.signature != null && m.hasOwnProperty(\"signature\")) {\n            d.signature = o.bytes === String ? $util.base64.encode(m.signature, 0, m.signature.length) : o.bytes === Array ? Array.prototype.slice.call(m.signature) : m.signature;\n        }\n        if (m.validityType != null && m.hasOwnProperty(\"validityType\")) {\n            d.validityType = o.enums === String ? $root.IpnsEntry.ValidityType[m.validityType] : m.validityType;\n        }\n        if (m.validity != null && m.hasOwnProperty(\"validity\")) {\n            d.validity = o.bytes === String ? $util.base64.encode(m.validity, 0, m.validity.length) : o.bytes === Array ? Array.prototype.slice.call(m.validity) : m.validity;\n        }\n        if (m.sequence != null && m.hasOwnProperty(\"sequence\")) {\n            if (typeof m.sequence === \"number\")\n                d.sequence = o.longs === String ? String(m.sequence) : m.sequence;\n            else\n                d.sequence = o.longs === String ? $util.Long.prototype.toString.call(m.sequence) : o.longs === Number ? new $util.LongBits(m.sequence.low >>> 0, m.sequence.high >>> 0).toNumber(true) : m.sequence;\n        }\n        if (m.ttl != null && m.hasOwnProperty(\"ttl\")) {\n            if (typeof m.ttl === \"number\")\n                d.ttl = o.longs === String ? String(m.ttl) : m.ttl;\n            else\n                d.ttl = o.longs === String ? $util.Long.prototype.toString.call(m.ttl) : o.longs === Number ? new $util.LongBits(m.ttl.low >>> 0, m.ttl.high >>> 0).toNumber(true) : m.ttl;\n        }\n        if (m.pubKey != null && m.hasOwnProperty(\"pubKey\")) {\n            d.pubKey = o.bytes === String ? $util.base64.encode(m.pubKey, 0, m.pubKey.length) : o.bytes === Array ? Array.prototype.slice.call(m.pubKey) : m.pubKey;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this IpnsEntry to JSON.\n     * @function toJSON\n     * @memberof IpnsEntry\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    IpnsEntry.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    /**\n     * ValidityType enum.\n     * @name IpnsEntry.ValidityType\n     * @enum {number}\n     * @property {number} EOL=0 EOL value\n     */\n    IpnsEntry.ValidityType = (function() {\n        var valuesById = {}, values = Object.create(valuesById);\n        values[valuesById[0] = \"EOL\"] = 0;\n        return values;\n    })();\n\n    return IpnsEntry;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\n/**\n * Convert a JavaScript date into an `RFC3339Nano` formatted\n * string.\n *\n * @param {Date} time\n */\nmodule.exports.toRFC3339 = (time) => {\n  const year = time.getUTCFullYear()\n  const month = String(time.getUTCMonth() + 1).padStart(2, '0')\n  const day = String(time.getUTCDate()).padStart(2, '0')\n  const hour = String(time.getUTCHours()).padStart(2, '0')\n  const minute = String(time.getUTCMinutes()).padStart(2, '0')\n  const seconds = String(time.getUTCSeconds()).padStart(2, '0')\n  const milliseconds = time.getUTCMilliseconds()\n  const nanoseconds = milliseconds * 1000 * 1000\n\n  return `${year}-${month}-${day}T${hour}:${minute}:${seconds}.${nanoseconds}Z`\n}\n\n/**\n * Parses a date string formatted as `RFC3339Nano` into a\n * JavaScript Date object.\n *\n * @param {string} time\n */\nmodule.exports.parseRFC3339 = (time) => {\n  const rfc3339Matcher = new RegExp(\n    // 2006-01-02T\n    '(\\\\d{4})-(\\\\d{2})-(\\\\d{2})T' +\n    // 15:04:05\n    '(\\\\d{2}):(\\\\d{2}):(\\\\d{2})' +\n    // .999999999Z\n    '\\\\.(\\\\d+)Z'\n  )\n  const m = String(time).trim().match(rfc3339Matcher)\n\n  if (!m) {\n    throw new Error('Invalid format')\n  }\n\n  const year = parseInt(m[1], 10)\n  const month = parseInt(m[2], 10) - 1\n  const date = parseInt(m[3], 10)\n  const hour = parseInt(m[4], 10)\n  const minute = parseInt(m[5], 10)\n  const second = parseInt(m[6], 10)\n  const millisecond = parseInt(m[7].slice(0, -6), 10)\n\n  return new Date(Date.UTC(year, month, date, hour, minute, second, millisecond))\n}\n","'use strict'\n\nexports.ERR_IPNS_EXPIRED_RECORD = 'ERR_IPNS_EXPIRED_RECORD'\nexports.ERR_UNRECOGNIZED_VALIDITY = 'ERR_UNRECOGNIZED_VALIDITY'\nexports.ERR_SIGNATURE_CREATION = 'ERR_SIGNATURE_CREATION'\nexports.ERR_SIGNATURE_VERIFICATION = 'ERR_SIGNATURE_VERIFICATION'\nexports.ERR_UNRECOGNIZED_FORMAT = 'ERR_UNRECOGNIZED_FORMAT'\nexports.ERR_PEER_ID_FROM_PUBLIC_KEY = 'ERR_PEER_ID_FROM_PUBLIC_KEY'\nexports.ERR_PUBLIC_KEY_FROM_ID = 'ERR_PUBLIC_KEY_FROM_ID'\nexports.ERR_UNDEFINED_PARAMETER = 'ERR_UNDEFINED_PARAMETER'\n","'use strict'\n\nconst ipns = require('ipns')\nconst crypto = require('libp2p-crypto')\nconst PeerId = require('peer-id')\nconst errcode = require('err-code')\n\nconst debug = require('debug')\nconst log = Object.assign(debug('ipfs:ipns:republisher'), {\n  error: debug('ipfs:ipns:republisher:error')\n})\n\n/**\n * @typedef {import('libp2p-crypto').PrivateKey} PrivateKey\n */\n\nconst minute = 60 * 1000\nconst hour = 60 * minute\n\nconst defaultBroadcastInterval = 4 * hour\nconst defaultRecordLifetime = 24 * hour\n\nclass IpnsRepublisher {\n  /**\n   * @param {import('./publisher')} publisher\n   * @param {import('interface-datastore').Datastore} datastore\n   * @param {PeerId} peerId\n   * @param {import('libp2p/src/keychain')} keychain\n   * @param {object} options\n   * @param {string} options.pass\n   * @param {number} [options.initialBroadcastInterval]\n   * @param {number} [options.broadcastInterval]\n   */\n  constructor (publisher, datastore, peerId, keychain, options = { pass: '' }) {\n    this._publisher = publisher\n    this._datastore = datastore\n    this._peerId = peerId\n    this._keychain = keychain\n    this._options = options\n    this._republishHandle = null\n  }\n\n  async start () { // eslint-disable-line require-await\n    if (this._republishHandle) {\n      throw errcode(new Error('republisher is already running'), 'ERR_REPUBLISH_ALREADY_RUNNING')\n    }\n\n    // TODO: this handler should be isolated in another module\n    const republishHandle = {\n      /** @type {null|(() => Promise<void>)} */\n      _task: null,\n      /** @type {null|Promise<void>} */\n      _inflightTask: null,\n      /** @type {null|NodeJS.Timeout} */\n      _timeoutId: null,\n      /**\n       * @param {function(): number} period\n       */\n      runPeriodically: (period) => {\n        republishHandle._timeoutId = setTimeout(async () => {\n          republishHandle._timeoutId = null\n\n          try {\n            // @ts-ignore - _task could be null\n            republishHandle._inflightTask = republishHandle._task()\n            await republishHandle._inflightTask\n\n            // Schedule next\n            if (republishHandle._task) {\n              republishHandle.runPeriodically(period)\n            }\n          } catch (err) {\n            log.error(err)\n          }\n        }, period())\n      },\n      cancel: async () => {\n        // do not run again\n        if (republishHandle._timeoutId != null) {\n          clearTimeout(republishHandle._timeoutId)\n        }\n        republishHandle._task = null\n\n        // wait for the currently in flight task to complete\n        await republishHandle._inflightTask\n      }\n    }\n\n    const { privKey } = this._peerId\n    const { pass } = this._options\n    let firstRun = true\n\n    republishHandle._task = () => this._republishEntries(privKey, pass)\n\n    republishHandle.runPeriodically(() => {\n      if (firstRun) {\n        firstRun = false\n        return this._options.initialBroadcastInterval || minute\n      }\n\n      return this._options.broadcastInterval || defaultBroadcastInterval\n    })\n\n    this._republishHandle = republishHandle\n  }\n\n  async stop () {\n    const republishHandle = this._republishHandle\n\n    if (!republishHandle) {\n      throw errcode(new Error('republisher is not running'), 'ERR_REPUBLISH_NOT_RUNNING')\n    }\n\n    this._republishHandle = null\n\n    await republishHandle.cancel()\n  }\n\n  /**\n   * @param {PrivateKey} privateKey\n   * @param {string} pass\n   */\n  async _republishEntries (privateKey, pass) {\n    // TODO: Should use list of published entries.\n    // We can't currently *do* that because go uses this method for now.\n    try {\n      await this._republishEntry(privateKey)\n    } catch (err) {\n      const errMsg = 'cannot republish entry for the node\\'s private key'\n\n      log.error(errMsg)\n      return\n    }\n\n    // keychain needs pass to get the cryptographic keys\n    if (pass) {\n      try {\n        const keys = await this._keychain.listKeys()\n\n        for (const key of keys) {\n          if (key.name === 'self') {\n            continue\n          }\n          const pem = await this._keychain.exportKey(key.name, pass)\n          const privKey = await crypto.keys.import(pem, pass)\n\n          await this._republishEntry(privKey)\n        }\n      } catch (err) {\n        log.error(err)\n      }\n    }\n  }\n\n  /**\n   * @param {PrivateKey} privateKey\n   */\n  async _republishEntry (privateKey) {\n    if (!privateKey || !privateKey.bytes) {\n      throw errcode(new Error('invalid private key'), 'ERR_INVALID_PRIVATE_KEY')\n    }\n\n    try {\n      const peerId = await PeerId.createFromPrivKey(privateKey.bytes)\n      const value = await this._getPreviousValue(peerId)\n      await this._publisher.publishWithEOL(privateKey, value, defaultRecordLifetime)\n    } catch (err) {\n      if (err.code === 'ERR_NO_ENTRY_FOUND') {\n        return\n      }\n\n      throw err\n    }\n  }\n\n  /**\n   * @param {PeerId} peerId\n   */\n  async _getPreviousValue (peerId) {\n    if (!(PeerId.isPeerId(peerId))) {\n      throw errcode(new Error('invalid peer ID'), 'ERR_INVALID_PEER_ID')\n    }\n\n    try {\n      const dsVal = await this._datastore.get(ipns.getLocalKey(peerId.id))\n\n      if (!(dsVal instanceof Uint8Array)) {\n        throw errcode(new Error(\"found ipns record that we couldn't process\"), 'ERR_INVALID_IPNS_RECORD')\n      }\n\n      // unmarshal data\n      try {\n        const record = ipns.unmarshal(dsVal)\n\n        return record.value\n      } catch (err) {\n        log.error(err)\n        throw errcode(new Error('found ipns record that we couldn\\'t convert to a value'), 'ERR_INVALID_IPNS_RECORD')\n      }\n    } catch (err) {\n      // error handling\n      // no need to republish\n      if (err && err.notFound) {\n        throw errcode(new Error(`no previous entry for record with id: ${peerId.id}`), 'ERR_NO_ENTRY_FOUND')\n      }\n\n      throw err\n    }\n  }\n}\n\nexports = module.exports = IpnsRepublisher\n","'use strict'\n\nconst ipns = require('ipns')\nconst PeerId = require('peer-id')\nconst errcode = require('err-code')\nconst debug = require('debug')\nconst log = Object.assign(debug('ipfs:ipns:resolver'), {\n  error: debug('ipfs:ipns:resolver:error')\n})\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nconst { Errors } = require('interface-datastore')\nconst ERR_NOT_FOUND = Errors.notFoundError().code\n\nconst defaultMaximumRecursiveDepth = 32\n\nclass IpnsResolver {\n  /**\n   * @param {import('ipfs-core-types/src/utils').BufferStore} routing\n   */\n  constructor (routing) {\n    this._routing = routing\n  }\n\n  /**\n   * @param {string} name\n   * @param {object} options\n   * @param {boolean} [options.recursive]\n   */\n  async resolve (name, options = {}) {\n    if (typeof name !== 'string') {\n      throw errcode(new Error('invalid name'), 'ERR_INVALID_NAME')\n    }\n\n    const recursive = options.recursive && options.recursive.toString() === 'true'\n\n    const nameSegments = name.split('/')\n\n    if (nameSegments.length !== 3 || nameSegments[0] !== '') {\n      throw errcode(new Error('invalid name'), 'ERR_INVALID_NAME')\n    }\n\n    const key = nameSegments[2]\n\n    // Define a maximum depth if recursive option enabled\n    let depth = Infinity\n\n    if (recursive) {\n      depth = defaultMaximumRecursiveDepth\n    }\n\n    const res = await this.resolver(key, depth)\n\n    log(`${name} was locally resolved correctly`)\n    return res\n  }\n\n  /**\n   * Recursive resolver according to the specified depth\n   *\n   * @param {string} name\n   * @param {number} depth\n   * @returns {Promise<string>}\n   */\n  async resolver (name, depth) {\n    // Exceeded recursive maximum depth\n    if (depth === 0) {\n      const errMsg = `could not resolve name (recursion limit of ${defaultMaximumRecursiveDepth} exceeded)`\n      log.error(errMsg)\n\n      throw errcode(new Error(errMsg), 'ERR_RESOLVE_RECURSION_LIMIT')\n    }\n\n    const res = await this._resolveName(name)\n    const nameSegments = res.split('/')\n\n    // If obtained a ipfs cid or recursive option is disabled\n    if (nameSegments[1] === 'ipfs' || !depth) {\n      return res\n    }\n\n    // continue recursively until depth equals 0\n    return this.resolver(nameSegments[2], depth - 1)\n  }\n\n  /**\n   * Resolve ipns entries from the provided routing\n   *\n   * @param {string} name\n   */\n  async _resolveName (name) {\n    const peerId = PeerId.createFromCID(name)\n    const { routingKey } = ipns.getIdKeys(peerId.toBytes())\n    let record\n\n    try {\n      record = await this._routing.get(routingKey.uint8Array())\n    } catch (err) {\n      log.error('could not get record from routing', err)\n\n      if (err.code === ERR_NOT_FOUND) {\n        throw errcode(new Error(`record requested for ${name} was not found in the network`), 'ERR_NO_RECORD_FOUND')\n      }\n\n      throw errcode(new Error(`unexpected error getting the ipns record ${peerId.toString()}`), 'ERR_UNEXPECTED_ERROR_GETTING_RECORD')\n    }\n\n    // IPNS entry\n    let ipnsEntry\n    try {\n      ipnsEntry = ipns.unmarshal(record)\n    } catch (err) {\n      log.error('could not unmarshal record', err)\n\n      throw errcode(new Error('found ipns record that we couldn\\'t convert to a value'), 'ERR_INVALID_RECORD_RECEIVED')\n    }\n\n    // We should have the public key by now (inline, or in the entry)\n    return this._validateRecord(peerId, ipnsEntry)\n  }\n\n  /**\n   * Validate a resolved record\n   *\n   * @param {PeerId} peerId\n   * @param {import('ipns').IPNSEntry} ipnsEntry\n   */\n  async _validateRecord (peerId, ipnsEntry) {\n    const pubKey = await ipns.extractPublicKey(peerId, ipnsEntry)\n\n    // IPNS entry validation\n    await ipns.validate(pubKey, ipnsEntry)\n\n    return uint8ArrayToString(ipnsEntry.value)\n  }\n}\n\nexports = module.exports = IpnsResolver\n","'use strict'\n\nconst { TieredDatastore } = require('datastore-core')\nconst get = require('dlv')\n\nconst PubsubDatastore = require('./pubsub-datastore')\nconst OfflineDatastore = require('./offline-datastore')\n\n/**\n * @param {object} arg\n * @param {import('libp2p')} arg.libp2p\n * @param {import('ipfs-repo')} arg.repo\n * @param {import('peer-id')} arg.peerId\n * @param {object} arg.options\n */\nmodule.exports = ({ libp2p, repo, peerId, options }) => {\n  // Setup online routing for IPNS with a tiered routing composed by a DHT and a Pubsub router (if properly enabled)\n  const ipnsStores = []\n\n  // Add IPNS pubsub if enabled\n  let pubsubDs\n  if (get(options, 'EXPERIMENTAL.ipnsPubsub', false)) {\n    const pubsub = libp2p.pubsub\n    const localDatastore = repo.datastore\n\n    pubsubDs = new PubsubDatastore(pubsub, localDatastore, peerId)\n    ipnsStores.push(pubsubDs)\n  }\n\n  // DHT should not be added as routing if we are offline or it is disabled\n  if (get(options, 'offline') || !get(options, 'libp2p.config.dht.enabled', false)) {\n    const offlineDatastore = new OfflineDatastore(repo)\n    ipnsStores.push(offlineDatastore)\n  } else {\n    ipnsStores.push(libp2p._dht)\n  }\n\n  // Create ipns routing with a set of datastores\n  return new TieredDatastore(ipnsStores)\n}\n","'use strict'\n\nconst KeytransformDatastore = require('./keytransform')\nconst ShardingDatastore = require('./sharding')\nconst MountDatastore = require('./mount')\nconst TieredDatastore = require('./tiered')\nconst NamespaceDatastore = require('./namespace')\nconst shard = require('./shard')\n\n/**\n * @typedef {import(\"./types\").Shard } Shard\n * @typedef {import(\"./types\").KeyTransform } KeyTransform\n */\n\nmodule.exports = {\n  KeytransformDatastore,\n  ShardingDatastore,\n  MountDatastore,\n  TieredDatastore,\n  NamespaceDatastore,\n  shard\n}\n","'use strict'\n\nconst { Adapter } = require('interface-datastore')\nconst map = require('it-map')\n\n/**\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('interface-datastore').Options} Options\n * @typedef {import('interface-datastore').Batch} Batch\n * @typedef {import('interface-datastore').Query} Query\n * @typedef {import('interface-datastore').KeyQuery} KeyQuery\n * @typedef {import('interface-datastore').Key} Key\n * @typedef {import('./types').KeyTransform} KeyTransform\n */\n\n/**\n * A datastore shim, that wraps around a given datastore, changing\n * the way keys look to the user, for example namespacing\n * keys, reversing them, etc.\n *\n * @implements {Datastore}\n */\nclass KeyTransformDatastore extends Adapter {\n  /**\n   * @param {Datastore} child\n   * @param {KeyTransform} transform\n   */\n  constructor (child, transform) {\n    super()\n\n    this.child = child\n    this.transform = transform\n  }\n\n  open () {\n    return this.child.open()\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Uint8Array} val\n   * @param {Options} [options]\n   */\n  put (key, val, options) {\n    return this.child.put(this.transform.convert(key), val, options)\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  get (key, options) {\n    return this.child.get(this.transform.convert(key), options)\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  has (key, options) {\n    return this.child.has(this.transform.convert(key), options)\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  delete (key, options) {\n    return this.child.delete(this.transform.convert(key), options)\n  }\n\n  /**\n   * @returns {Batch}\n   */\n  batch () {\n    const b = this.child.batch()\n    return {\n      put: (key, value) => {\n        b.put(this.transform.convert(key), value)\n      },\n      delete: (key) => {\n        b.delete(this.transform.convert(key))\n      },\n      commit: (options) => {\n        return b.commit(options)\n      }\n    }\n  }\n\n  /**\n   * @param {Query} q\n   * @param {Options} [options]\n   */\n  query (q, options) {\n    return map(this.child.query(q, options), ({ key, value }) => {\n      return {\n        key: this.transform.invert(key),\n        value\n      }\n    })\n  }\n\n  /**\n   * @param {KeyQuery} q\n   * @param {Options} [options]\n   */\n  queryKeys (q, options) {\n    return map(this.child.queryKeys(q, options), key => {\n      return this.transform.invert(key)\n    })\n  }\n\n  close () {\n    return this.child.close()\n  }\n}\n\nmodule.exports = KeyTransformDatastore\n","'use strict'\n\n/**\n * Takes an (async) iterable and returns one with each item mapped by the passed\n * function.\n *\n * @template I,O\n * @param {AsyncIterable<I>|Iterable<I>} source\n * @param {function(I):O|Promise<O>} func\n * @returns {AsyncIterable<O>}\n */\nconst map = async function * (source, func) {\n  for await (const val of source) {\n    yield func(val)\n  }\n}\n\nmodule.exports = map\n","'use strict'\n\nconst { Adapter, Key, Errors } = require('interface-datastore')\nconst sh = require('./shard')\nconst KeytransformStore = require('./keytransform')\n\nconst shardKey = new Key(sh.SHARDING_FN)\nconst shardReadmeKey = new Key(sh.README_FN)\n/**\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('interface-datastore').Options} Options\n * @typedef {import('interface-datastore').Batch} Batch\n * @typedef {import('interface-datastore').Query} Query\n * @typedef {import('interface-datastore').QueryFilter} QueryFilter\n * @typedef {import('interface-datastore').QueryOrder} QueryOrder\n * @typedef {import('interface-datastore').KeyQuery} KeyQuery\n * @typedef {import('interface-datastore').KeyQueryFilter} KeyQueryFilter\n * @typedef {import('interface-datastore').KeyQueryOrder} KeyQueryOrder\n * @typedef {import('interface-datastore').Pair} Pair\n * @typedef {import('./types').Shard} Shard\n *\n */\n/**\n * @template TValue\n * @typedef {import('./types').Await<TValue> } Await\n */\n\n/**\n * Backend independent abstraction of go-ds-flatfs.\n *\n * Wraps another datastore such that all values are stored\n * sharded according to the given sharding function.\n */\nclass ShardingDatastore extends Adapter {\n  /**\n   * @param {Datastore} store\n   * @param {Shard} shard\n   */\n  constructor (store, shard) {\n    super()\n\n    this.child = new KeytransformStore(store, {\n      convert: this._convertKey.bind(this),\n      invert: this._invertKey.bind(this)\n    })\n    this.shard = shard\n  }\n\n  async open () {\n    await this.child.open()\n\n    this.shard = await ShardingDatastore.create(this.child, this.shard)\n  }\n\n  /**\n   * @param {Key} key\n   */\n  _convertKey (key) {\n    const s = key.toString()\n    if (s === shardKey.toString() || s === shardReadmeKey.toString()) {\n      return key\n    }\n\n    const parent = new Key(this.shard.fun(s))\n    return parent.child(key)\n  }\n\n  /**\n   * @param {Key} key\n   */\n  _invertKey (key) {\n    const s = key.toString()\n    if (s === shardKey.toString() || s === shardReadmeKey.toString()) {\n      return key\n    }\n    return Key.withNamespaces(key.list().slice(1))\n  }\n\n  /**\n   * @deprecated\n   * @param {Datastore} store\n   * @param {Shard} shard\n   */\n  static async createOrOpen (store, shard) {\n    try {\n      await ShardingDatastore.create(store, shard)\n    } catch (err) {\n      if (err && err.message !== 'datastore exists') throw err\n    }\n    return ShardingDatastore.open(store)\n  }\n\n  /**\n   * @deprecated\n   * @param {Datastore} store\n   */\n  static async open (store) {\n    const shard = await sh.readShardFun('/', store)\n    return new ShardingDatastore(store, shard)\n  }\n\n  /**\n   * @param {Datastore} store\n   * @param {Shard} shard\n   */\n  static async create (store, shard) {\n    const hasShard = await store.has(shardKey)\n    if (!hasShard && !shard) {\n      throw Errors.dbOpenFailedError(Error('Shard is required when datastore doesn\\'t have a shard key already.'))\n    }\n    if (!hasShard) {\n      // @ts-ignore i have no idea what putRaw is or saw any implementation\n      const put = typeof store.putRaw === 'function' ? store.putRaw.bind(store) : store.put.bind(store)\n      await Promise.all([\n        put(shardKey, new TextEncoder().encode(shard.toString() + '\\n')),\n        put(shardReadmeKey, new TextEncoder().encode(sh.readme))\n      ])\n\n      return shard\n    }\n\n    // test shards\n    const diskShard = await sh.readShardFun('/', store)\n    const a = (diskShard || '').toString()\n    const b = shard.toString()\n    if (a !== b) {\n      throw new Error(`specified fun ${b} does not match repo shard fun ${a}`)\n    }\n    return diskShard\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Uint8Array} val\n   * @param {Options} [options]\n   */\n  put (key, val, options) {\n    return this.child.put(key, val, options)\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  get (key, options) {\n    return this.child.get(key, options)\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  has (key, options) {\n    return this.child.has(key, options)\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  delete (key, options) {\n    return this.child.delete(key, options)\n  }\n\n  batch () {\n    return this.child.batch()\n  }\n\n  /**\n   * @param {Query} q\n   * @param {Options} [options]\n   */\n  query (q, options) {\n    const tq = {\n      offset: q.offset,\n      limit: q.limit,\n      /** @type {QueryOrder[]} */\n      orders: [],\n      /** @type {QueryFilter[]} */\n      filters: [\n        /** @type {QueryFilter} */\n        e => e.key.toString() !== shardKey.toString(),\n        /** @type {QueryFilter} */\n        e => e.key.toString() !== shardReadmeKey.toString()\n      ]\n    }\n\n    const { prefix } = q\n    if (prefix != null) {\n      tq.filters.push((e) => {\n        return this._invertKey(e.key).toString().startsWith(prefix)\n      })\n    }\n\n    if (q.filters != null) {\n      const filters = q.filters.map(f => {\n        /** @type {QueryFilter} */\n        const filter = ({ key, value }) => {\n          return f({\n            key: this._invertKey(key),\n            value\n          })\n        }\n\n        return filter\n      })\n      tq.filters = tq.filters.concat(filters)\n    }\n\n    if (q.orders != null) {\n      tq.orders = q.orders.map(o => {\n        /** @type {QueryOrder} */\n        const order = (a, b) => {\n          return o({\n            key: this._invertKey(a.key),\n            value: a.value\n          }, {\n            key: this._invertKey(b.key),\n            value: b.value\n          })\n        }\n\n        return order\n      })\n    }\n\n    return this.child.query(tq, options)\n  }\n\n  /**\n   * @param {KeyQuery} q\n   * @param {Options} [options]\n   */\n  queryKeys (q, options) {\n    const tq = {\n      offset: q.offset,\n      limit: q.limit,\n      /** @type {KeyQueryOrder[]} */\n      orders: [],\n      /** @type {KeyQueryFilter[]} */\n      filters: [\n        /** @type {KeyQueryFilter} */\n        key => key.toString() !== shardKey.toString(),\n        /** @type {KeyQueryFilter} */\n        key => key.toString() !== shardReadmeKey.toString()\n      ]\n    }\n\n    const { prefix } = q\n    if (prefix != null) {\n      tq.filters.push((key) => {\n        return this._invertKey(key).toString().startsWith(prefix)\n      })\n    }\n\n    if (q.filters != null) {\n      const filters = q.filters.map(f => {\n        /** @type {KeyQueryFilter} */\n        const filter = (key) => {\n          return f(this._invertKey(key))\n        }\n\n        return filter\n      })\n      tq.filters = tq.filters.concat(filters)\n    }\n\n    if (q.orders != null) {\n      tq.orders = q.orders.map(o => {\n        /** @type {KeyQueryOrder} */\n        const order = (a, b) => o(this._invertKey(a), this._invertKey(b))\n\n        return order\n      })\n    }\n\n    return this.child.queryKeys(tq, options)\n  }\n\n  close () {\n    return this.child.close()\n  }\n}\n\nmodule.exports = ShardingDatastore\n","'use strict'\n\nconst { Key } = require('interface-datastore')\nconst readme = require('./shard-readme')\n\n/**\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('./types').Shard} Shard\n */\n\nconst PREFIX = '/repo/flatfs/shard/'\nconst SHARDING_FN = 'SHARDING'\nconst README_FN = '_README'\n\n/**\n * @implements {Shard}\n */\nclass ShardBase {\n  /**\n   * @param {any} param\n   */\n  constructor (param) {\n    this.param = param\n    this.name = 'base'\n    this._padding = ''\n  }\n\n  /**\n   * @param {string} s\n   */\n  fun (s) {\n    return 'implement me'\n  }\n\n  toString () {\n    return `${PREFIX}v1/${this.name}/${this.param}`\n  }\n}\n/**\n * @implements {Shard}\n */\nclass Prefix extends ShardBase {\n  /**\n   * @param {number} prefixLen\n   */\n  constructor (prefixLen) {\n    super(prefixLen)\n    this._padding = ''.padStart(prefixLen, '_')\n    this.name = 'prefix'\n  }\n\n  /**\n   * @param {string} noslash\n   */\n  fun (noslash) {\n    return (noslash + this._padding).slice(0, this.param)\n  }\n}\n\nclass Suffix extends ShardBase {\n  /**\n   * @param {number} suffixLen\n   */\n  constructor (suffixLen) {\n    super(suffixLen)\n    this._padding = ''.padStart(suffixLen, '_')\n    this.name = 'suffix'\n  }\n\n  /**\n   * @param {string} noslash\n   */\n  fun (noslash) {\n    const s = this._padding + noslash\n    return s.slice(s.length - this.param)\n  }\n}\n\nclass NextToLast extends ShardBase {\n  /**\n   * @param {number} suffixLen\n   */\n  constructor (suffixLen) {\n    super(suffixLen)\n    this._padding = ''.padStart(suffixLen + 1, '_')\n    this.name = 'next-to-last'\n  }\n\n  /**\n   * @param {string} noslash\n   */\n  fun (noslash) {\n    const s = this._padding + noslash\n    const offset = s.length - this.param - 1\n    return s.slice(offset, offset + this.param)\n  }\n}\n\n/**\n * Convert a given string to the matching sharding function.\n *\n * @param {string} str\n * @returns {Shard}\n */\nfunction parseShardFun (str) {\n  str = str.trim()\n\n  if (str.length === 0) {\n    throw new Error('empty shard string')\n  }\n\n  if (!str.startsWith(PREFIX)) {\n    throw new Error(`invalid or no path prefix: ${str}`)\n  }\n\n  const parts = str.slice(PREFIX.length).split('/')\n  const version = parts[0]\n\n  if (version !== 'v1') {\n    throw new Error(`expect 'v1' version, got '${version}'`)\n  }\n\n  const name = parts[1]\n\n  if (!parts[2]) {\n    throw new Error('missing param')\n  }\n\n  const param = parseInt(parts[2], 10)\n\n  switch (name) {\n    case 'prefix':\n      return new Prefix(param)\n    case 'suffix':\n      return new Suffix(param)\n    case 'next-to-last':\n      return new NextToLast(param)\n    default:\n      throw new Error(`unkown sharding function: ${name}`)\n  }\n}\n\n/**\n * @param {string | Uint8Array} path\n * @param {Datastore} store\n */\nconst readShardFun = async (path, store) => {\n  const key = new Key(path).child(new Key(SHARDING_FN))\n  // @ts-ignore\n  const get = typeof store.getRaw === 'function' ? store.getRaw.bind(store) : store.get.bind(store)\n  const res = await get(key)\n  return parseShardFun(new TextDecoder().decode(res || '').trim())\n}\n\nmodule.exports = {\n  readme,\n  parseShardFun,\n  readShardFun,\n  Prefix,\n  Suffix,\n  NextToLast,\n  README_FN,\n  SHARDING_FN,\n  PREFIX\n}\n","'use strict'\n\nmodule.exports = `This is a repository of IPLD objects. Each IPLD object is in a single file,\nnamed <base32 encoding of cid>.data. Where <base32 encoding of cid> is the\n\"base32\" encoding of the CID (as specified in\nhttps://github.com/multiformats/multibase) without the 'B' prefix.\nAll the object files are placed in a tree of directories, based on a\nfunction of the CID. This is a form of sharding similar to\nthe objects directory in git repositories. Previously, we used\nprefixes, we now use the next-to-last two charters.\n    func NextToLast(base32cid string) {\n      nextToLastLen := 2\n      offset := len(base32cid) - nextToLastLen - 1\n      return str[offset : offset+nextToLastLen]\n    }\nFor example, an object with a base58 CIDv1 of\n    zb2rhYSxw4ZjuzgCnWSt19Q94ERaeFhu9uSqRgjSdx9bsgM6f\nhas a base32 CIDv1 of\n    BAFKREIA22FLID5AJ2KU7URG47MDLROZIH6YF2KALU2PWEFPVI37YLKRSCA\nand will be placed at\n    SC/AFKREIA22FLID5AJ2KU7URG47MDLROZIH6YF2KALU2PWEFPVI37YLKRSCA.data\nwith 'SC' being the last-to-next two characters and the 'B' at the\nbeginning of the CIDv1 string is the multibase prefix that is not\nstored in the filename.\n`\n","/* @flow */\n'use strict'\n\nconst {\n  Adapter, Key, Errors, utils: {\n    sortAll,\n    replaceStartWith\n  }\n} = require('interface-datastore')\nconst filter = require('it-filter')\nconst take = require('it-take')\nconst merge = require('it-merge')\n\nconst Keytransform = require('./keytransform')\n\n/**\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('interface-datastore').Options} Options\n * @typedef {import('interface-datastore').Batch} Batch\n * @typedef {import('interface-datastore').Query} Query\n * @typedef {import('interface-datastore').KeyQuery} KeyQuery\n * @typedef {import('./types').KeyTransform} KeyTransform\n */\n\n/**\n * @template TEntry\n * @typedef {import('./types').AwaitIterable<TEntry>} AwaitIterable\n */\n\n/**\n * A datastore that can combine multiple stores inside various\n * key prefixes\n *\n * @implements {Datastore}\n */\nclass MountDatastore extends Adapter {\n  /**\n   * @param {Array<{prefix: Key, datastore: Datastore}>} mounts\n   */\n  constructor (mounts) {\n    super()\n\n    this.mounts = mounts.slice()\n  }\n\n  async open () {\n    await Promise.all(this.mounts.map((m) => m.datastore.open()))\n  }\n\n  /**\n   * Lookup the matching datastore for the given key\n   *\n   * @private\n   * @param {Key} key\n   * @returns {{datastore: Datastore, mountpoint: Key, rest: Key} | undefined}\n   */\n  _lookup (key) {\n    for (const mount of this.mounts) {\n      if (mount.prefix.toString() === key.toString() || mount.prefix.isAncestorOf(key)) {\n        const s = replaceStartWith(key.toString(), mount.prefix.toString())\n        return {\n          datastore: mount.datastore,\n          mountpoint: mount.prefix,\n          rest: new Key(s)\n        }\n      }\n    }\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Uint8Array} value\n   * @param {Options} [options]\n   */\n  put (key, value, options) {\n    const match = this._lookup(key)\n    if (match == null) {\n      throw Errors.dbWriteFailedError(new Error('No datastore mounted for this key'))\n    }\n\n    return match.datastore.put(match.rest, value, options)\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  get (key, options) {\n    const match = this._lookup(key)\n    if (match == null) {\n      throw Errors.notFoundError(new Error('No datastore mounted for this key'))\n    }\n    return match.datastore.get(match.rest, options)\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  has (key, options) {\n    const match = this._lookup(key)\n    if (match == null) {\n      return Promise.resolve(false)\n    }\n    return match.datastore.has(match.rest, options)\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  delete (key, options) {\n    const match = this._lookup(key)\n    if (match == null) {\n      throw Errors.dbDeleteFailedError(new Error('No datastore mounted for this key'))\n    }\n\n    return match.datastore.delete(match.rest, options)\n  }\n\n  async close () {\n    await Promise.all(this.mounts.map((m) => {\n      return m.datastore.close()\n    }))\n  }\n\n  /**\n   * @returns {Batch}\n   */\n  batch () {\n    /** @type {Record<string, Batch>} */\n    const batchMounts = {}\n    /**\n     * @param {Key} key\n     */\n    const lookup = (key) => {\n      const match = this._lookup(key)\n      if (match == null) {\n        throw new Error('No datastore mounted for this key')\n      }\n\n      const m = match.mountpoint.toString()\n      if (batchMounts[m] == null) {\n        batchMounts[m] = match.datastore.batch()\n      }\n\n      return {\n        batch: batchMounts[m],\n        rest: match.rest\n      }\n    }\n\n    return {\n      put: (key, value) => {\n        const match = lookup(key)\n        match.batch.put(match.rest, value)\n      },\n      delete: (key) => {\n        const match = lookup(key)\n        match.batch.delete(match.rest)\n      },\n      commit: async (options) => {\n        await Promise.all(Object.keys(batchMounts).map(p => batchMounts[p].commit(options)))\n      }\n    }\n  }\n\n  /**\n   * @param {Query} q\n   * @param {Options} [options]\n   */\n  query (q, options) {\n    const qs = this.mounts.map(m => {\n      const ks = new Keytransform(m.datastore, {\n        convert: (key) => {\n          throw new Error('should never be called')\n        },\n        invert: (key) => {\n          return m.prefix.child(key)\n        }\n      })\n\n      let prefix\n      if (q.prefix != null) {\n        prefix = replaceStartWith(q.prefix, m.prefix.toString())\n      }\n\n      return ks.query({\n        prefix: prefix,\n        filters: q.filters\n      }, options)\n    })\n\n    let it = merge(...qs)\n    if (q.filters) q.filters.forEach(f => { it = filter(it, f) })\n    if (q.orders) q.orders.forEach(o => { it = sortAll(it, o) })\n    if (q.offset != null) {\n      let i = 0\n      it = filter(it, () => i++ >= /** @type {number} */ (q.offset))\n    }\n    if (q.limit != null) it = take(it, q.limit)\n\n    return it\n  }\n\n  /**\n   * @param {KeyQuery} q\n   * @param {Options} [options]\n   */\n  queryKeys (q, options) {\n    const qs = this.mounts.map(m => {\n      const ks = new Keytransform(m.datastore, {\n        convert: (key) => {\n          throw new Error('should never be called')\n        },\n        invert: (key) => {\n          return m.prefix.child(key)\n        }\n      })\n\n      let prefix\n      if (q.prefix != null) {\n        prefix = replaceStartWith(q.prefix, m.prefix.toString())\n      }\n\n      return ks.queryKeys({\n        prefix: prefix,\n        filters: q.filters\n      }, options)\n    })\n\n    let it = merge(...qs)\n    if (q.filters) q.filters.forEach(f => { it = filter(it, f) })\n    if (q.orders) q.orders.forEach(o => { it = sortAll(it, o) })\n    if (q.offset != null) {\n      let i = 0\n      it = filter(it, () => i++ >= /** @type {number} */ (q.offset))\n    }\n    if (q.limit != null) it = take(it, q.limit)\n\n    return it\n  }\n}\n\nmodule.exports = MountDatastore\n","'use strict'\n\nconst pushable = require('it-pushable')\n\n/**\n * Treat one or more iterables as a single iterable.\n *\n * Nb. sources are iterated over in parallel so the\n * order of emitted items is not guaranteed.\n *\n * @template T\n * @param {...AsyncIterable<T>|Iterable<T>} sources\n * @returns {AsyncIterable<T>}\n */\nconst merge = async function * (...sources) {\n  const output = pushable()\n\n  setTimeout(async () => {\n    try {\n      await Promise.all(\n        sources.map(async (source) => {\n          for await (const item of source) {\n            output.push(item)\n          }\n        })\n      )\n\n      output.end()\n    } catch (err) {\n      output.end(err)\n    }\n  }, 0)\n\n  yield * output\n}\n\nmodule.exports = merge\n","const FIFO = require('fast-fifo')\n\nmodule.exports = (options) => {\n  options = options || {}\n  let onEnd\n\n  if (typeof options === 'function') {\n    onEnd = options\n    options = {}\n  } else {\n    onEnd = options.onEnd\n  }\n\n  let buffer = new FIFO()\n  let pushable, onNext, ended\n\n  const waitNext = () => {\n    if (!buffer.isEmpty()) {\n      if (options.writev) {\n        let next\n        const values = []\n        while (!buffer.isEmpty()) {\n          next = buffer.shift()\n          if (next.error) throw next.error\n          values.push(next.value)\n        }\n        return { done: next.done, value: values }\n      }\n\n      const next = buffer.shift()\n      if (next.error) throw next.error\n      return next\n    }\n\n    if (ended) return { done: true }\n\n    return new Promise((resolve, reject) => {\n      onNext = next => {\n        onNext = null\n        if (next.error) {\n          reject(next.error)\n        } else {\n          if (options.writev && !next.done) {\n            resolve({ done: next.done, value: [next.value] })\n          } else {\n            resolve(next)\n          }\n        }\n        return pushable\n      }\n    })\n  }\n\n  const bufferNext = next => {\n    if (onNext) return onNext(next)\n    buffer.push(next)\n    return pushable\n  }\n\n  const bufferError = err => {\n    buffer = new FIFO()\n    if (onNext) return onNext({ error: err })\n    buffer.push({ error: err })\n    return pushable\n  }\n\n  const push = value => {\n    if (ended) return pushable\n    return bufferNext({ done: false, value })\n  }\n  const end = err => {\n    if (ended) return pushable\n    ended = true\n    return err ? bufferError(err) : bufferNext({ done: true })\n  }\n  const _return = () => {\n    buffer = new FIFO()\n    end()\n    return { done: true }\n  }\n  const _throw = err => {\n    end(err)\n    return { done: true }\n  }\n\n  pushable = {\n    [Symbol.asyncIterator] () { return this },\n    next: waitNext,\n    return: _return,\n    throw: _throw,\n    push,\n    end\n  }\n\n  if (!onEnd) return pushable\n\n  const _pushable = pushable\n\n  pushable = {\n    [Symbol.asyncIterator] () { return this },\n    next () {\n      return _pushable.next()\n    },\n    throw (err) {\n      _pushable.throw(err)\n      if (onEnd) {\n        onEnd(err)\n        onEnd = null\n      }\n      return { done: true }\n    },\n    return () {\n      _pushable.return()\n      if (onEnd) {\n        onEnd()\n        onEnd = null\n      }\n      return { done: true }\n    },\n    push,\n    end (err) {\n      _pushable.end(err)\n      if (onEnd) {\n        onEnd(err)\n        onEnd = null\n      }\n      return pushable\n    }\n  }\n\n  return pushable\n}\n","const FixedFIFO = require('./fixed-size')\n\nmodule.exports = class FastFIFO {\n  constructor (hwm) {\n    this.hwm = hwm || 16\n    this.head = new FixedFIFO(this.hwm)\n    this.tail = this.head\n  }\n\n  push (val) {\n    if (!this.head.push(val)) {\n      const prev = this.head\n      this.head = prev.next = new FixedFIFO(2 * this.head.buffer.length)\n      this.head.push(val)\n    }\n  }\n\n  shift () {\n    const val = this.tail.shift()\n    if (val === undefined && this.tail.next) {\n      const next = this.tail.next\n      this.tail.next = null\n      this.tail = next\n      return this.tail.shift()\n    }\n    return val\n  }\n\n  isEmpty () {\n    return this.head.isEmpty()\n  }\n}\n","module.exports = class FixedFIFO {\n  constructor (hwm) {\n    if (!(hwm > 0) || ((hwm - 1) & hwm) !== 0) throw new Error('Max size for a FixedFIFO should be a power of two')\n    this.buffer = new Array(hwm)\n    this.mask = hwm - 1\n    this.top = 0\n    this.btm = 0\n    this.next = null\n  }\n\n  push (data) {\n    if (this.buffer[this.top] !== undefined) return false\n    this.buffer[this.top] = data\n    this.top = (this.top + 1) & this.mask\n    return true\n  }\n\n  shift () {\n    const last = this.buffer[this.btm]\n    if (last === undefined) return undefined\n    this.buffer[this.btm] = undefined\n    this.btm = (this.btm + 1) & this.mask\n    return last\n  }\n\n  isEmpty () {\n    return this.buffer[this.btm] === undefined\n  }\n}\n","'use strict'\n\nconst { Adapter, Errors } = require('interface-datastore')\nconst log = require('debug')('datastore:core:tiered')\n/**\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('interface-datastore').Options} Options\n * @typedef {import('interface-datastore').Batch} Batch\n * @typedef {import('interface-datastore').Query} Query\n * @typedef {import('interface-datastore').KeyQuery} KeyQuery\n * @typedef {import('interface-datastore').Key} Key\n */\n\n/**\n * A datastore that can combine multiple stores. Puts and deletes\n * will write through to all datastores. Has and get will\n * try each store sequentially. Query will always try the\n * last one first.\n *\n */\nclass TieredDatastore extends Adapter {\n  /**\n   * @param {Datastore[]} stores\n   */\n  constructor (stores) {\n    super()\n\n    this.stores = stores.slice()\n  }\n\n  async open () {\n    try {\n      await Promise.all(this.stores.map((store) => store.open()))\n    } catch (err) {\n      throw Errors.dbOpenFailedError()\n    }\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Uint8Array} value\n   */\n  async put (key, value) {\n    try {\n      await Promise.all(this.stores.map(store => store.put(key, value)))\n    } catch (err) {\n      throw Errors.dbWriteFailedError()\n    }\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  async get (key, options) {\n    for (const store of this.stores) {\n      try {\n        const res = await store.get(key, options)\n        if (res) return res\n      } catch (err) {\n        log(err)\n      }\n    }\n    throw Errors.notFoundError()\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  async has (key, options) {\n    for (const s of this.stores) {\n      if (await s.has(key, options)) {\n        return true\n      }\n    }\n\n    return false\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Options} [options]\n   */\n  async delete (key, options) {\n    try {\n      await Promise.all(this.stores.map(store => store.delete(key, options)))\n    } catch (err) {\n      throw Errors.dbDeleteFailedError()\n    }\n  }\n\n  async close () {\n    await Promise.all(this.stores.map(store => store.close()))\n  }\n\n  /**\n   * @returns {Batch}\n   */\n  batch () {\n    const batches = this.stores.map(store => store.batch())\n\n    return {\n      put: (key, value) => {\n        batches.forEach(b => b.put(key, value))\n      },\n      delete: (key) => {\n        batches.forEach(b => b.delete(key))\n      },\n      commit: async (options) => {\n        for (const batch of batches) {\n          await batch.commit(options)\n        }\n      }\n    }\n  }\n\n  /**\n   * @param {Query} q\n   * @param {Options} [options]\n   */\n  query (q, options) {\n    return this.stores[this.stores.length - 1].query(q, options)\n  }\n\n  /**\n   * @param {KeyQuery} q\n   * @param {Options} [options]\n   */\n  queryKeys (q, options) {\n    return this.stores[this.stores.length - 1].queryKeys(q, options)\n  }\n}\n\nmodule.exports = TieredDatastore\n","'use strict'\n\nconst Key = require('interface-datastore').Key\nconst KeytransformDatastore = require('./keytransform')\n/**\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('interface-datastore').Query} Query\n * @typedef {import('interface-datastore').KeyQuery} KeyQuery\n * @typedef {import('interface-datastore').Options} Options\n * @typedef {import('interface-datastore').Batch} Batch\n * @typedef {import('./types').KeyTransform} KeyTransform\n */\n\n/**\n * Wraps a given datastore into a keytransform which\n * makes a given prefix transparent.\n *\n * For example, if the prefix is `new Key(/hello)` a call\n * to `store.put(new Key('/world'), mydata)` would store the data under\n * `/hello/world`.\n *\n */\nclass NamespaceDatastore extends KeytransformDatastore {\n  /**\n   * @param {Datastore} child\n   * @param {Key} prefix\n   */\n  constructor (child, prefix) {\n    super(child, {\n      convert (key) {\n        return prefix.child(key)\n      },\n      invert (key) {\n        if (prefix.toString() === '/') {\n          return key\n        }\n\n        if (!prefix.isAncestorOf(key)) {\n          throw new Error(`Expected prefix: (${prefix.toString()}) in key: ${key.toString()}`)\n        }\n\n        return new Key(key.toString().slice(prefix.toString().length), false)\n      }\n    })\n\n    this.prefix = prefix\n  }\n\n  /**\n   * @param {Query} q\n   * @param {Options} [options]\n   */\n  query (q, options) {\n    if (q.prefix && this.prefix.toString() !== '/') {\n      return super.query(Object.assign({}, q, {\n        prefix: this.prefix.child(new Key(q.prefix)).toString()\n      }))\n    }\n    return super.query(q, options)\n  }\n\n  /**\n   * @param {KeyQuery} q\n   * @param {Options} [options]\n   */\n  queryKeys (q, options) {\n    if (q.prefix && this.prefix.toString() !== '/') {\n      return super.queryKeys(Object.assign({}, q, {\n        prefix: this.prefix.child(new Key(q.prefix)).toString()\n      }))\n    }\n    return super.queryKeys(q, options)\n  }\n}\n\nmodule.exports = NamespaceDatastore\n","export default function dlv(obj, key, def, p, undef) {\n\tkey = key.split ? key.split('.') : key;\n\tfor (p = 0; p < key.length; p++) {\n\t\tobj = obj ? obj[key[p]] : undef;\n\t}\n\treturn obj === undef ? def : obj;\n}\n","'use strict'\n\nconst ipns = require('ipns')\nconst { toB58String } = require('multihashing-async').multihash\nconst PubsubDatastore = require('datastore-pubsub')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\nconst errcode = require('err-code')\nconst debug = require('debug')\nconst log = Object.assign(debug('ipfs:ipns:pubsub'), {\n  error: debug('ipfs:ipns:pubsub:error')\n})\n\n// Pubsub datastore aims to manage the pubsub subscriptions for IPNS\nclass IpnsPubsubDatastore {\n  /**\n   * @param {import('libp2p-interfaces/src/pubsub')} pubsub\n   * @param {import('interface-datastore').Datastore} localDatastore\n   * @param {import('peer-id')} peerId\n   */\n  constructor (pubsub, localDatastore, peerId) {\n    /** @type {Record<string, string>} */\n    this._subscriptions = {}\n\n    // Bind _handleSubscriptionKey function, which is called by PubsubDatastore.\n    this._handleSubscriptionKey = this._handleSubscriptionKey.bind(this)\n\n    // @ts-ignore will be fixed by https://github.com/ipfs/js-datastore-pubsub/pull/74\n    this._pubsubDs = new PubsubDatastore(pubsub, localDatastore, peerId, ipns.validator, this._handleSubscriptionKey)\n  }\n\n  /**\n   * Put a value to the pubsub datastore indexed by the received key properly encoded.\n   *\n   * @param {Uint8Array} key - identifier of the value.\n   * @param {Uint8Array} value - value to be stored.\n   */\n  put (key, value) {\n    // @ts-ignore datastores take Key keys, this one takes Uint8Array keys\n    return this._pubsubDs.put(key, value)\n  }\n\n  /**\n   * Get a value from the pubsub datastore indexed by the received key properly encoded.\n   * Also, the identifier topic is subscribed to and the pubsub datastore records will be\n   * updated once new publishes occur.\n   *\n   * @param {Uint8Array} key - identifier of the value to be obtained.\n   */\n  async get (key) {\n    let res\n    let err\n\n    try {\n      // @ts-ignore datastores take Key keys, this one takes Uint8Array keys\n      res = await this._pubsubDs.get(key)\n    } catch (e) {\n      err = e\n    }\n\n    // Add topic subscribed\n    const ns = key.slice(0, ipns.namespaceLength)\n\n    if (uint8ArrayToString(ns) === ipns.namespace) {\n      const stringifiedTopic = toB58String(key)\n      const id = toB58String(key.slice(ipns.namespaceLength))\n\n      this._subscriptions[stringifiedTopic] = id\n\n      log(`subscribed to pubsub topic ${stringifiedTopic}, id ${id}`)\n    }\n\n    // If no data was obtained, after storing the subscription, return the error.\n    if (err) {\n      throw err\n    }\n\n    return res\n  }\n\n  /**\n   * Modify subscription key to have a proper encoding\n   *\n   * @param {Uint8Array | string} key\n   */\n  _handleSubscriptionKey (key) {\n    if (key instanceof Uint8Array) {\n      key = uint8ArrayToString(key, 'base58btc')\n    }\n\n    const subscriber = this._subscriptions[key]\n\n    if (!subscriber) {\n      throw errcode(new Error(`key ${key} does not correspond to a subscription`), 'ERR_INVALID_KEY')\n    }\n\n    let keys\n    try {\n      keys = ipns.getIdKeys(uint8ArrayFromString(subscriber, 'base58btc'))\n    } catch (err) {\n      log.error(err)\n      throw err\n    }\n\n    return keys.routingKey.uint8Array()\n  }\n\n  /**\n   * Get pubsub subscriptions related to ipns.\n   */\n  getSubscriptions () {\n    const subscriptions = Object.values(this._subscriptions).filter(Boolean)\n\n    return subscriptions.map((sub) => `${ipns.namespace}${sub}`)\n  }\n\n  /**\n   * Cancel pubsub subscriptions related to ipns.\n   *\n   * @param {string} name - ipns path to cancel the pubsub subscription.\n   */\n  async cancel (name) { // eslint-disable-line require-await\n    if (typeof name !== 'string') {\n      throw errcode(new Error('invalid subscription name'), 'ERR_INVALID_SUBSCRIPTION_NAME')\n    }\n\n    // Trim /ipns/ prefix from the name\n    if (name.startsWith(ipns.namespace)) {\n      name = name.substring(ipns.namespaceLength)\n    }\n\n    const stringifiedTopic = Object.keys(this._subscriptions).find((key) => this._subscriptions[key] === name)\n\n    // Not found topic\n    if (!stringifiedTopic) {\n      return {\n        canceled: false\n      }\n    }\n\n    // Unsubscribe topic\n    const bufTopic = uint8ArrayFromString(stringifiedTopic)\n\n    this._pubsubDs.unsubscribe(bufTopic)\n\n    delete this._subscriptions[stringifiedTopic]\n    log(`unsubscribed pubsub ${stringifiedTopic}: ${name}`)\n\n    return {\n      canceled: true\n    }\n  }\n}\n\nmodule.exports = IpnsPubsubDatastore\n","'use strict'\n\nconst { Key, Adapter } = require('interface-datastore')\nconst { encodeBase32, keyToTopic, topicToKey } = require('./utils')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\nconst errcode = require('err-code')\nconst debug = require('debug')\nconst log = Object.assign(debug('datastore-pubsub:publisher'), {\n  error: debug('datastore-pubsub:publisher:error')\n})\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('./types').Validator} Validator\n * @typedef {import('./types').SubscriptionKeyFn} SubscriptionKeyFn\n * @typedef {import('libp2p-interfaces/src/pubsub').InMessage} PubSubMessage\n */\n\n// DatastorePubsub is responsible for providing an api for pubsub to be used as a datastore with\n// [TieredDatastore]{@link https://github.com/ipfs/js-datastore-core/blob/master/src/tiered.js}\nclass DatastorePubsub extends Adapter {\n  /**\n   * Creates an instance of DatastorePubsub.\n   *\n   * @param {import('libp2p-interfaces/src/pubsub')} pubsub - pubsub implementation\n   * @param {import('interface-datastore').Datastore} datastore - datastore instance\n   * @param {PeerId} peerId - peer-id instance\n   * @param {Validator} validator - validator functions\n   * @param {SubscriptionKeyFn} [subscriptionKeyFn] - function to manipulate the key topic received before processing it\n   * @memberof DatastorePubsub\n   */\n  constructor (pubsub, datastore, peerId, validator, subscriptionKeyFn) {\n    super()\n\n    if (!validator) {\n      throw errcode(new TypeError('missing validator'), 'ERR_INVALID_PARAMETERS')\n    }\n\n    if (typeof validator.validate !== 'function') {\n      throw errcode(new TypeError('missing validate function'), 'ERR_INVALID_PARAMETERS')\n    }\n\n    if (typeof validator.select !== 'function') {\n      throw errcode(new TypeError('missing select function'), 'ERR_INVALID_PARAMETERS')\n    }\n\n    if (subscriptionKeyFn && typeof subscriptionKeyFn !== 'function') {\n      throw errcode(new TypeError('invalid subscriptionKeyFn received'), 'ERR_INVALID_PARAMETERS')\n    }\n\n    this._pubsub = pubsub\n    this._datastore = datastore\n    this._peerId = peerId\n    this._validator = validator\n    this._handleSubscriptionKeyFn = subscriptionKeyFn\n\n    // Bind _onMessage function, which is called by pubsub.\n    this._onMessage = this._onMessage.bind(this)\n  }\n\n  /**\n   * Publishes a value through pubsub.\n   *\n   * @param {Uint8Array} key - identifier of the value to be published.\n   * @param {Uint8Array} val - value to be propagated.\n   */\n  // @ts-ignore Datastores take keys as Keys, this one takes Uint8Arrays\n  async put (key, val) {\n    if (!(key instanceof Uint8Array)) {\n      const errMsg = 'datastore key does not have a valid format'\n\n      log.error(errMsg)\n      throw errcode(new Error(errMsg), 'ERR_INVALID_DATASTORE_KEY')\n    }\n\n    if (!(val instanceof Uint8Array)) {\n      const errMsg = 'received value is not a Uint8Array'\n\n      log.error(errMsg)\n      throw errcode(new Error(errMsg), 'ERR_INVALID_VALUE_RECEIVED')\n    }\n\n    const stringifiedTopic = keyToTopic(key)\n\n    log(`publish value for topic ${stringifiedTopic}`)\n\n    // Publish record to pubsub\n    await this._pubsub.publish(stringifiedTopic, val)\n  }\n\n  /**\n   * Try to subscribe a topic with Pubsub and returns the local value if available.\n   *\n   * @param {Uint8Array} key - identifier of the value to be subscribed.\n   */\n  // @ts-ignore Datastores take keys as Keys, this one takes Uint8Arrays\n  async get (key) {\n    if (!(key instanceof Uint8Array)) {\n      const errMsg = 'datastore key does not have a valid format'\n\n      log.error(errMsg)\n      throw errcode(new Error(errMsg), 'ERR_INVALID_DATASTORE_KEY')\n    }\n\n    const stringifiedTopic = keyToTopic(key)\n    const subscriptions = await this._pubsub.getTopics()\n\n    // If already subscribed, just try to get it\n    if (subscriptions && Array.isArray(subscriptions) && subscriptions.indexOf(stringifiedTopic) > -1) {\n      return this._getLocal(key)\n    }\n\n    // subscribe\n    try {\n      this._pubsub.on(stringifiedTopic, this._onMessage)\n      await this._pubsub.subscribe(stringifiedTopic)\n    } catch (err) {\n      const errMsg = `cannot subscribe topic ${stringifiedTopic}`\n\n      log.error(errMsg)\n      throw errcode(new Error(errMsg), 'ERR_SUBSCRIBING_TOPIC')\n    }\n    log(`subscribed values for key ${stringifiedTopic}`)\n\n    return this._getLocal(key)\n  }\n\n  /**\n   * Unsubscribe topic.\n   *\n   * @param {Uint8Array} key - identifier of the value to unsubscribe.\n   * @returns {void}\n   */\n  unsubscribe (key) {\n    const stringifiedTopic = keyToTopic(key)\n\n    this._pubsub.removeListener(stringifiedTopic, this._onMessage)\n    return this._pubsub.unsubscribe(stringifiedTopic)\n  }\n\n  /**\n   * Get record from local datastore\n   *\n   * @private\n   * @param {Uint8Array} key\n   */\n  async _getLocal (key) {\n    // encode key - base32(/ipns/{cid})\n    const routingKey = new Key('/' + encodeBase32(key), false)\n    let dsVal\n\n    try {\n      dsVal = await this._datastore.get(routingKey)\n    } catch (err) {\n      if (err.code !== 'ERR_NOT_FOUND') {\n        const errMsg = `unexpected error getting the ipns record for ${routingKey.toString()}`\n\n        log.error(errMsg)\n        throw errcode(new Error(errMsg), 'ERR_UNEXPECTED_ERROR_GETTING_RECORD')\n      }\n      const errMsg = `local record requested was not found for ${routingKey.toString()}`\n\n      log.error(errMsg)\n      throw errcode(new Error(errMsg), 'ERR_NOT_FOUND')\n    }\n\n    if (!(dsVal instanceof Uint8Array)) {\n      const errMsg = 'found record that we couldn\\'t convert to a value'\n\n      log.error(errMsg)\n      throw errcode(new Error(errMsg), 'ERR_INVALID_RECORD_RECEIVED')\n    }\n\n    return dsVal\n  }\n\n  /**\n   * handles pubsub subscription messages\n   *\n   * @param {PubSubMessage} msg\n   */\n  async _onMessage (msg) {\n    const { data, from, topicIDs } = msg\n    let key\n    try {\n      key = topicToKey(topicIDs[0])\n    } catch (err) {\n      log.error(err)\n      return\n    }\n\n    log(`message received for topic ${topicIDs[0]}`)\n\n    // Stop if the message is from the peer (it already stored it while publishing to pubsub)\n    if (from === this._peerId.toB58String()) {\n      log('message discarded as it is from the same peer')\n      return\n    }\n\n    if (this._handleSubscriptionKeyFn) {\n      let res\n\n      try {\n        res = await this._handleSubscriptionKeyFn(key)\n      } catch (err) {\n        log.error('message discarded by the subscriptionKeyFn')\n        return\n      }\n\n      key = res\n    }\n\n    try {\n      await this._storeIfSubscriptionIsBetter(key, data)\n    } catch (err) {\n      log.error(err)\n    }\n  }\n\n  /**\n   * Store the received record if it is better than the current stored\n   *\n   * @param {Uint8Array} key\n   * @param {Uint8Array} data\n   */\n  async _storeIfSubscriptionIsBetter (key, data) {\n    let isBetter = false\n\n    try {\n      isBetter = await this._isBetter(key, data)\n    } catch (err) {\n      if (err.code !== 'ERR_NOT_VALID_RECORD') {\n        throw err\n      }\n    }\n\n    if (isBetter) {\n      await this._storeRecord(key, data)\n    }\n  }\n\n  /**\n   * Validate record according to the received validation function\n   *\n   * @param {Uint8Array} value\n   * @param {Uint8Array} peerId\n   */\n  async _validateRecord (value, peerId) { // eslint-disable-line require-await\n    return this._validator.validate(value, peerId)\n  }\n\n  /**\n   * Select the best record according to the received select function\n   *\n   * @param {Uint8Array} key\n   * @param {Uint8Array[]} records\n   */\n  async _selectRecord (key, records) {\n    const res = await this._validator.select(key, records)\n\n    // If the selected was the first (0), it should be stored (true)\n    return res === 0\n  }\n\n  /**\n   * Verify if the record received through pubsub is valid and better than the one currently stored\n   *\n   * @param {Uint8Array} key\n   * @param {Uint8Array} val\n   */\n  async _isBetter (key, val) {\n    try {\n      await this._validateRecord(val, key)\n    } catch (err) {\n      // If not valid, it is not better than the one currently available\n      const errMsg = 'record received through pubsub is not valid'\n\n      log.error(errMsg)\n      throw errcode(new Error(errMsg), 'ERR_NOT_VALID_RECORD')\n    }\n\n    // Get Local record\n    const dsKey = new Key(key)\n    let currentRecord\n\n    try {\n      currentRecord = await this._getLocal(dsKey.uint8Array())\n    } catch (err) {\n      // if the old one is invalid, the new one is *always* better\n      return true\n    }\n\n    // if the same record, do not need to store\n    if (uint8ArrayEquals(currentRecord, val)) {\n      return false\n    }\n\n    // verify if the received record should replace the current one\n    return this._selectRecord(key, [currentRecord, val])\n  }\n\n  /**\n   * add record to datastore\n   *\n   * @param {Uint8Array} key\n   * @param {Uint8Array} data\n   */\n  async _storeRecord (key, data) {\n    // encode key - base32(/ipns/{cid})\n    const routingKey = new Key('/' + encodeBase32(key), false)\n\n    await this._datastore.put(routingKey, data)\n    log(`record for ${keyToTopic(key)} was stored in the datastore`)\n  }\n}\n\nexports = module.exports = DatastorePubsub\n","'use strict'\n\nconst errcode = require('err-code')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n/**\n * @typedef {import('interface-datastore').Key} Key\n */\n\nconst namespace = '/record/'\n\n/**\n * @param {Uint8Array} buf\n */\nfunction encodeBase32 (buf) {\n  return uint8ArrayToString(buf, 'base32')\n}\n\n/**\n * converts a binary record key to a pubsub topic key\n *\n * @param {Uint8Array | string} key\n */\nfunction keyToTopic (key) {\n  // Record-store keys are arbitrary binary. However, pubsub requires UTF-8 string topic IDs\n  // Encodes to \"/record/base64url(key)\"\n  if (typeof key === 'string' || key instanceof String) {\n    key = uint8ArrayFromString(key.toString())\n  }\n\n  const b64url = uint8ArrayToString(key, 'base64url')\n\n  return `${namespace}${b64url}`\n}\n\n/**\n * converts a pubsub topic key to a binary record key\n *\n * @param {string} topic\n */\nfunction topicToKey (topic) {\n  if (topic.substring(0, namespace.length) !== namespace) {\n    throw errcode(new Error('topic received is not from a record'), 'ERR_TOPIC_IS_NOT_FROM_RECORD_NAMESPACE')\n  }\n\n  const key = topic.substring(namespace.length)\n\n  return uint8ArrayFromString(key, 'base64url')\n}\n\nmodule.exports = {\n  encodeBase32,\n  keyToTopic,\n  topicToKey\n}\n","'use strict'\n\nconst { Key } = require('interface-datastore')\nconst { Record } = require('libp2p-record')\nconst { encodeBase32 } = require('./utils')\n\nconst errcode = require('err-code')\nconst debug = require('debug')\nconst log = Object.assign(debug('ipfs:ipns:offline-datastore'), {\n  error: debug('ipfs:ipns:offline-datastore:error')\n})\n\n// Offline datastore aims to mimic the same encoding as routing when storing records\n// to the local datastore\nclass OfflineDatastore {\n  /**\n   * @param {import('ipfs-repo')} repo\n   */\n  constructor (repo) {\n    this._repo = repo\n    /** @type {any[]} */\n    this.stores = []\n  }\n\n  /**\n   * Put a value to the local datastore indexed by the received key properly encoded.\n   *\n   * @param {Uint8Array} key - identifier of the value.\n   * @param {Uint8Array} value - value to be stored.\n   */\n  async put (key, value) { // eslint-disable-line require-await\n    if (!(key instanceof Uint8Array)) {\n      throw errcode(new Error('Offline datastore key must be a Uint8Array'), 'ERR_INVALID_KEY')\n    }\n\n    if (!(value instanceof Uint8Array)) {\n      throw errcode(new Error('Offline datastore value must be a Uint8Array'), 'ERR_INVALID_VALUE')\n    }\n\n    let routingKey\n\n    try {\n      routingKey = this._routingKey(key)\n    } catch (err) {\n      log.error(err)\n      throw errcode(new Error('Not possible to generate the routing key'), 'ERR_GENERATING_ROUTING_KEY')\n    }\n\n    // Marshal to libp2p record as the DHT does\n    const record = new Record(key, value)\n\n    return this._repo.datastore.put(routingKey, record.serialize())\n  }\n\n  /**\n   * Get a value from the local datastore indexed by the received key properly encoded.\n   *\n   * @param {Uint8Array} key - identifier of the value to be obtained.\n   */\n  async get (key) {\n    if (!(key instanceof Uint8Array)) {\n      throw errcode(new Error('Offline datastore key must be a Uint8Array'), 'ERR_INVALID_KEY')\n    }\n\n    let routingKey\n\n    try {\n      routingKey = this._routingKey(key)\n    } catch (err) {\n      log.error(err)\n      throw errcode(new Error('Not possible to generate the routing key'), 'ERR_GENERATING_ROUTING_KEY')\n    }\n\n    const res = await this._repo.datastore.get(routingKey)\n\n    // Unmarshal libp2p record as the DHT does\n    let record\n    try {\n      record = Record.deserialize(res)\n    } catch (err) {\n      log.error(err)\n      throw err\n    }\n\n    return record.value\n  }\n\n  /**\n   * encode key properly - base32(/ipns/{cid})\n   *\n   * @param {Uint8Array} key\n   */\n  _routingKey (key) {\n    return new Key('/' + encodeBase32(key), false)\n  }\n}\n\nexports = module.exports = OfflineDatastore\n","'use strict'\n\nmodule.exports = {\n  Record: require('./record'),\n  validator: require('./validator'),\n  selection: require('./selection')\n}\n","'use strict'\n\nconst {\n  Record: PBRecord\n} = require('./record')\nconst utils = require('../utils')\n\n/**\n * @typedef {{ key: Uint8Array, value: Uint8Array, timeReceived: string }} ProtobufRecord\n */\n\nclass Record {\n  /**\n   * @param {Uint8Array} [key]\n   * @param {Uint8Array} [value]\n   * @param {Date} [timeReceived]\n   */\n  constructor (key, value, timeReceived) {\n    if (!(key instanceof Uint8Array)) {\n      throw new Error('key must be a Uint8Array')\n    }\n\n    if (!(value instanceof Uint8Array)) {\n      throw new Error('value must be a Uint8Array')\n    }\n\n    this.key = key\n    this.value = value\n    this.timeReceived = timeReceived\n  }\n\n  serialize () {\n    return PBRecord.encode(this.prepareSerialize()).finish()\n  }\n\n  /**\n   * Return the object format ready to be given to the protobuf library.\n   */\n  prepareSerialize () {\n    return {\n      key: this.key,\n      value: this.value,\n      timeReceived: this.timeReceived && utils.toRFC3339(this.timeReceived)\n    }\n  }\n\n  /**\n   * Decode a protobuf encoded record.\n   *\n   * @param {Uint8Array} raw\n   */\n  static deserialize (raw) {\n    const message = PBRecord.decode(raw)\n    return Record.fromDeserialized(PBRecord.toObject(message, {\n      defaults: false,\n      arrays: true,\n      longs: Number,\n      objects: false\n    }))\n  }\n\n  /**\n   * Create a record from the raw object returned from the protobuf library.\n   *\n   * @param {{ [k: string]: any }} obj\n   */\n  static fromDeserialized (obj) {\n    let recvtime\n    if (obj.timeReceived) {\n      recvtime = utils.parseRFC3339(obj.timeReceived)\n    }\n\n    const rec = new Record(\n      obj.key, obj.value, recvtime\n    )\n\n    return rec\n  }\n}\n\nmodule.exports = Record\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"libp2p-record\"] || ($protobuf.roots[\"libp2p-record\"] = {});\n\n$root.Record = (function() {\n\n    /**\n     * Properties of a Record.\n     * @exports IRecord\n     * @interface IRecord\n     * @property {Uint8Array|null} [key] Record key\n     * @property {Uint8Array|null} [value] Record value\n     * @property {string|null} [timeReceived] Record timeReceived\n     */\n\n    /**\n     * Constructs a new Record.\n     * @exports Record\n     * @classdesc Represents a Record.\n     * @implements IRecord\n     * @constructor\n     * @param {IRecord=} [p] Properties to set\n     */\n    function Record(p) {\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * Record key.\n     * @member {Uint8Array} key\n     * @memberof Record\n     * @instance\n     */\n    Record.prototype.key = $util.newBuffer([]);\n\n    /**\n     * Record value.\n     * @member {Uint8Array} value\n     * @memberof Record\n     * @instance\n     */\n    Record.prototype.value = $util.newBuffer([]);\n\n    /**\n     * Record timeReceived.\n     * @member {string} timeReceived\n     * @memberof Record\n     * @instance\n     */\n    Record.prototype.timeReceived = \"\";\n\n    /**\n     * Encodes the specified Record message. Does not implicitly {@link Record.verify|verify} messages.\n     * @function encode\n     * @memberof Record\n     * @static\n     * @param {IRecord} m Record message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    Record.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.key != null && Object.hasOwnProperty.call(m, \"key\"))\n            w.uint32(10).bytes(m.key);\n        if (m.value != null && Object.hasOwnProperty.call(m, \"value\"))\n            w.uint32(18).bytes(m.value);\n        if (m.timeReceived != null && Object.hasOwnProperty.call(m, \"timeReceived\"))\n            w.uint32(42).string(m.timeReceived);\n        return w;\n    };\n\n    /**\n     * Decodes a Record message from the specified reader or buffer.\n     * @function decode\n     * @memberof Record\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {Record} Record\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    Record.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.Record();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.key = r.bytes();\n                break;\n            case 2:\n                m.value = r.bytes();\n                break;\n            case 5:\n                m.timeReceived = r.string();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a Record message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof Record\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {Record} Record\n     */\n    Record.fromObject = function fromObject(d) {\n        if (d instanceof $root.Record)\n            return d;\n        var m = new $root.Record();\n        if (d.key != null) {\n            if (typeof d.key === \"string\")\n                $util.base64.decode(d.key, m.key = $util.newBuffer($util.base64.length(d.key)), 0);\n            else if (d.key.length)\n                m.key = d.key;\n        }\n        if (d.value != null) {\n            if (typeof d.value === \"string\")\n                $util.base64.decode(d.value, m.value = $util.newBuffer($util.base64.length(d.value)), 0);\n            else if (d.value.length)\n                m.value = d.value;\n        }\n        if (d.timeReceived != null) {\n            m.timeReceived = String(d.timeReceived);\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a Record message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof Record\n     * @static\n     * @param {Record} m Record\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    Record.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.defaults) {\n            if (o.bytes === String)\n                d.key = \"\";\n            else {\n                d.key = [];\n                if (o.bytes !== Array)\n                    d.key = $util.newBuffer(d.key);\n            }\n            if (o.bytes === String)\n                d.value = \"\";\n            else {\n                d.value = [];\n                if (o.bytes !== Array)\n                    d.value = $util.newBuffer(d.value);\n            }\n            d.timeReceived = \"\";\n        }\n        if (m.key != null && m.hasOwnProperty(\"key\")) {\n            d.key = o.bytes === String ? $util.base64.encode(m.key, 0, m.key.length) : o.bytes === Array ? Array.prototype.slice.call(m.key) : m.key;\n        }\n        if (m.value != null && m.hasOwnProperty(\"value\")) {\n            d.value = o.bytes === String ? $util.base64.encode(m.value, 0, m.value.length) : o.bytes === Array ? Array.prototype.slice.call(m.value) : m.value;\n        }\n        if (m.timeReceived != null && m.hasOwnProperty(\"timeReceived\")) {\n            d.timeReceived = m.timeReceived;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this Record to JSON.\n     * @function toJSON\n     * @memberof Record\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    Record.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return Record;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\n/**\n * Convert a JavaScript date into an `RFC3339Nano` formatted\n * string.\n *\n * @param {Date} time\n */\nmodule.exports.toRFC3339 = (time) => {\n  const year = time.getUTCFullYear()\n  const month = String(time.getUTCMonth() + 1).padStart(2, '0')\n  const day = String(time.getUTCDate()).padStart(2, '0')\n  const hour = String(time.getUTCHours()).padStart(2, '0')\n  const minute = String(time.getUTCMinutes()).padStart(2, '0')\n  const seconds = String(time.getUTCSeconds()).padStart(2, '0')\n  const milliseconds = time.getUTCMilliseconds()\n  const nanoseconds = milliseconds * 1000 * 1000\n\n  return `${year}-${month}-${day}T${hour}:${minute}:${seconds}.${nanoseconds}Z`\n}\n\n/**\n * Parses a date string formatted as `RFC3339Nano` into a\n * JavaScript Date object.\n *\n * @param {string} time\n */\nmodule.exports.parseRFC3339 = (time) => {\n  const rfc3339Matcher = new RegExp(\n    // 2006-01-02T\n    '(\\\\d{4})-(\\\\d{2})-(\\\\d{2})T' +\n    // 15:04:05\n    '(\\\\d{2}):(\\\\d{2}):(\\\\d{2})' +\n    // .999999999Z\n    '\\\\.(\\\\d+)Z'\n  )\n  const m = String(time).trim().match(rfc3339Matcher)\n\n  if (!m) {\n    throw new Error('Invalid format')\n  }\n\n  const year = parseInt(m[1], 10)\n  const month = parseInt(m[2], 10) - 1\n  const date = parseInt(m[3], 10)\n  const hour = parseInt(m[4], 10)\n  const minute = parseInt(m[5], 10)\n  const second = parseInt(m[6], 10)\n  const millisecond = parseInt(m[7].slice(0, -6), 10)\n\n  return new Date(Date.UTC(year, month, date, hour, minute, second, millisecond))\n}\n","'use strict'\n\nconst errcode = require('err-code')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\n/**\n * @typedef {import('./record')} Record\n */\n\n/**\n * Checks a record and ensures it is still valid.\n * It runs the needed validators.\n * If verification fails the returned Promise will reject with the error.\n *\n * @param {import('libp2p-interfaces/src/types').DhtValidators} validators\n * @param {Record} record\n */\nconst verifyRecord = (validators, record) => {\n  const key = record.key\n  const keyString = uint8ArrayToString(key)\n  const parts = keyString.split('/')\n\n  if (parts.length < 3) {\n    // No validator available\n    return\n  }\n\n  const validator = validators[parts[1].toString()]\n\n  if (!validator) {\n    const errMsg = 'Invalid record keytype'\n\n    throw errcode(new Error(errMsg), 'ERR_INVALID_RECORD_KEY_TYPE')\n  }\n\n  return validator.func(key, record.value)\n}\n\nmodule.exports = {\n  verifyRecord: verifyRecord,\n  validators: require('./validators')\n}\n","'use strict'\n\nmodule.exports = {\n  pk: require('./public-key')\n}\n","'use strict'\n\nconst multihashing = require('multihashing-async')\nconst errcode = require('err-code')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\n/**\n * Validator for public key records.\n * Verifies that the passed in record value is the PublicKey\n * that matches the passed in key.\n * If validation fails the returned Promise will reject with the error.\n *\n * @param {Uint8Array} key - A valid key is of the form `'/pk/<keymultihash>'`\n * @param {Uint8Array} publicKey - The public key to validate against (protobuf encoded).\n */\nconst validatePublicKeyRecord = async (key, publicKey) => {\n  if (!(key instanceof Uint8Array)) {\n    throw errcode(new Error('\"key\" must be a Uint8Array'), 'ERR_INVALID_RECORD_KEY_NOT_BUFFER')\n  }\n\n  if (key.byteLength < 5) {\n    throw errcode(new Error('invalid public key record'), 'ERR_INVALID_RECORD_KEY_TOO_SHORT')\n  }\n\n  const prefix = uint8ArrayToString(key.subarray(0, 4))\n\n  if (prefix !== '/pk/') {\n    throw errcode(new Error('key was not prefixed with /pk/'), 'ERR_INVALID_RECORD_KEY_BAD_PREFIX')\n  }\n\n  const keyhash = key.slice(4)\n\n  const publicKeyHash = await multihashing(publicKey, 'sha2-256')\n\n  if (!uint8ArrayEquals(keyhash, publicKeyHash)) {\n    throw errcode(new Error('public key does not match passed in key'), 'ERR_INVALID_RECORD_HASH_MISMATCH')\n  }\n}\n\nmodule.exports = {\n  func: validatePublicKeyRecord,\n  sign: false\n}\n","'use strict'\n\nconst errcode = require('err-code')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\n/**\n * Select the best record out of the given records.\n *\n * @param {import('libp2p-interfaces/src/types').DhtSelectors} selectors\n * @param {Uint8Array} k\n * @param {Array<Uint8Array>} records\n */\nconst bestRecord = (selectors, k, records) => {\n  if (records.length === 0) {\n    const errMsg = 'No records given'\n\n    throw errcode(new Error(errMsg), 'ERR_NO_RECORDS_RECEIVED')\n  }\n\n  const kStr = uint8ArrayToString(k)\n  const parts = kStr.split('/')\n\n  if (parts.length < 3) {\n    const errMsg = 'Record key does not have a selector function'\n\n    throw errcode(new Error(errMsg), 'ERR_NO_SELECTOR_FUNCTION_FOR_RECORD_KEY')\n  }\n\n  const selector = selectors[parts[1].toString()]\n\n  if (!selector) {\n    const errMsg = `Unrecognized key prefix: ${parts[1]}`\n\n    throw errcode(new Error(errMsg), 'ERR_UNRECOGNIZED_KEY_PREFIX')\n  }\n\n  return selector(k, records)\n}\n\nmodule.exports = {\n  bestRecord: bestRecord,\n  selectors: require('./selectors')\n}\n","'use strict'\n\nmodule.exports = {\n  pk: require('./public-key')\n}\n","'use strict'\n\n/**\n * Best record selector, for public key records.\n * Simply returns the first record, as all valid public key\n * records are equal.\n *\n * @param {Uint8Array} k\n * @param {Array<Uint8Array>} records\n */\nconst publicKeySelector = (k, records) => {\n  return 0\n}\n\nmodule.exports = publicKeySelector\n","'use strict'\n\nconst ipns = require('ipns')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nmodule.exports = {\n  /**\n   * @param {Uint8Array} buf\n   */\n  encodeBase32: (buf) => uint8ArrayToString(buf, 'base32upper'),\n  validator: {\n    /**\n     * @param {Uint8Array} key\n     * @param {Uint8Array} record\n     */\n    func: (key, record) => ipns.validator.validate(record, key)\n  },\n  /**\n   * @param {*} _k\n   * @param {Uint8Array[]} records\n   */\n  selector: (_k, records) => ipns.validator.select(records[0], records[1])\n}\n","'use strict'\n\nconst createPublishAPI = require('./publish')\nconst createResolveAPI = require('./resolve')\nconst PubSubAPI = require('./pubsub')\n\nclass NameAPI {\n  /**\n   * @param {Object} config\n   * @param {import('../ipns')} config.ipns\n   * @param {import('peer-id')} config.peerId\n   * @param {import('../../types').Options} config.options\n   * @param {import('ipld')} config.ipld\n   * @param {import('ipfs-core-types/src/root').API[\"isOnline\"]} config.isOnline\n   * @param {import('libp2p/src/keychain')} config.keychain\n   * @param {import('ipfs-core-types/src/root').API[\"dns\"]} config.dns\n   */\n  constructor ({ dns, ipns, ipld, peerId, isOnline, keychain, options }) {\n    this.publish = createPublishAPI({ ipns, ipld, peerId, isOnline, keychain })\n    this.resolve = createResolveAPI({ dns, ipns, peerId, isOnline, options })\n    this.pubsub = new PubSubAPI({ ipns, options })\n  }\n}\n\nmodule.exports = NameAPI\n","'use strict'\n\nconst debug = require('debug')\nconst { default: parseDuration } = require('parse-duration')\nconst crypto = require('libp2p-crypto')\nconst errcode = require('err-code')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nconst log = Object.assign(debug('ipfs:name:publish'), {\n  error: debug('ipfs:name:publish:error')\n})\n\nconst { OFFLINE_ERROR, normalizePath } = require('../../utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst { resolvePath } = require('./utils')\n\n/**\n * IPNS - Inter-Planetary Naming System\n *\n * @param {Object} config\n * @param {import('../ipns')} config.ipns\n * @param {import('ipld')} config.ipld\n * @param {import('peer-id')} config.peerId\n * @param {import('ipfs-core-types/src/root').API[\"isOnline\"]} config.isOnline\n * @param {import('libp2p/src/keychain')} config.keychain\n */\nmodule.exports = ({ ipns, ipld, peerId, isOnline, keychain }) => {\n  /**\n   * @param {string} keyName\n   */\n  const lookupKey = async keyName => {\n    if (keyName === 'self') {\n      return peerId.privKey\n    }\n\n    try {\n      // We're exporting and immediately importing the key, so we can just use a throw away password\n      const pem = await keychain.exportKey(keyName, 'temp')\n      const privateKey = await crypto.keys.import(pem, 'temp')\n      return privateKey\n    } catch (err) {\n      log.error(err)\n      throw errcode(err, 'ERR_CANNOT_GET_KEY')\n    }\n  }\n\n  /**\n   * @type {import('ipfs-core-types/src/name').API[\"publish\"]}\n   */\n  async function publish (value, options = {}) {\n    const resolve = !(options.resolve === false)\n    const lifetime = options.lifetime || '24h'\n    const key = options.key || 'self'\n\n    if (!isOnline()) {\n      throw errcode(new Error(OFFLINE_ERROR), 'OFFLINE_ERROR')\n    }\n\n    // TODO: params related logic should be in the core implementation\n    // Normalize path value\n    try {\n      value = normalizePath(value)\n    } catch (err) {\n      log.error(err)\n      throw err\n    }\n\n    let pubLifetime = 0\n    try {\n      pubLifetime = parseDuration(lifetime) || 0\n\n      // Calculate lifetime with nanoseconds precision\n      pubLifetime = parseFloat(pubLifetime.toFixed(6))\n    } catch (err) {\n      log.error(err)\n      throw err\n    }\n\n    // TODO: ttl human for cache\n    const results = await Promise.all([\n      // verify if the path exists, if not, an error will stop the execution\n      lookupKey(key),\n      // if resolving, do a get so we make sure we have the blocks\n      resolve ? resolvePath({ ipns, ipld }, value) : Promise.resolve()\n    ])\n\n    const bytes = uint8ArrayFromString(value)\n\n    // Start publishing process\n    const result = await ipns.publish(results[0], bytes, pubLifetime)\n\n    return {\n      name: result.name,\n      value: uint8ArrayToString(result.value)\n    }\n  }\n\n  return withTimeoutOption(publish)\n}\n","'use strict'\n\nconst isIPFS = require('is-ipfs')\nconst toCidAndPath = require('ipfs-core-utils/src/to-cid-and-path')\nconst drain = require('it-drain')\n\n/**\n * resolves the given path by parsing out protocol-specific entries\n * (e.g. /ipns/<node-key>) and then going through the /ipfs/ entries and returning the final node\n *\n * @param {Object} context\n * @param {import('../ipns')} context.ipns\n * @param {import('ipld')} context.ipld\n * @param {string} name\n */\nexports.resolvePath = async ({ ipns, ipld }, name) => {\n  // ipns path\n  if (isIPFS.ipnsPath(name)) {\n    return ipns.resolve(name)\n  }\n\n  const {\n    cid,\n    path\n  } = toCidAndPath(name)\n\n  // ipfs path\n  await drain(ipld.resolve(cid, path || ''))\n}\n","'use strict'\n\nconst debug = require('debug')\nconst errcode = require('err-code')\nconst { mergeOptions } = require('../../utils')\nconst CID = require('cids')\n// @ts-ignore no types\nconst isDomain = require('is-domain-name')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nconst log = Object.assign(debug('ipfs:name:resolve'), {\n  error: debug('ipfs:name:resolve:error')\n})\n\nconst { OFFLINE_ERROR } = require('../../utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n *\n * @param {string} result\n * @param {string[]} remainder\n * @returns {string}\n */\nconst appendRemainder = (result, remainder) =>\n  remainder.length > 0\n    ? result + '/' + remainder.join('/')\n    : result\n\n/**\n * IPNS - Inter-Planetary Naming System\n *\n * @param {Object} config\n * @param {import('ipfs-core-types/src/root').API[\"dns\"]} config.dns\n * @param {import('../ipns')} config.ipns\n * @param {import('peer-id')} config.peerId\n * @param {import('ipfs-core-types/src/root').API[\"isOnline\"]} config.isOnline\n * @param {import('../../types').Options} config.options\n */\nmodule.exports = ({ dns, ipns, peerId, isOnline, options: { offline } }) => {\n  /**\n   * @type {import('ipfs-core-types/src/name').API[\"resolve\"]}\n   */\n  async function * resolve (name, options = {}) { // eslint-disable-line require-await\n    options = mergeOptions({\n      nocache: false,\n      recursive: true\n    }, options)\n\n    // TODO: params related logic should be in the core implementation\n    if (offline && options && options.nocache) {\n      throw errcode(new Error('cannot specify both offline and nocache'), 'ERR_NOCACHE_AND_OFFLINE')\n    }\n\n    // Set node id as name for being resolved, if it is not received\n    if (!name) {\n      name = peerId.toB58String()\n    }\n\n    if (!name.startsWith('/ipns/')) {\n      name = `/ipns/${name}`\n    }\n\n    const [namespace, hash, ...remainder] = name.slice(1).split('/')\n    try {\n      new CID(hash) // eslint-disable-line no-new\n    } catch (err) {\n      // lets check if we have a domain ex. /ipns/ipfs.io and resolve with dns\n      if (isDomain(hash)) {\n        yield appendRemainder(await dns(hash, options), remainder)\n        return\n      }\n\n      log.error(err)\n      throw errcode(new Error('Invalid IPNS name'), 'ERR_IPNS_INVALID_NAME')\n    }\n\n    // multihash is valid lets resolve with IPNS\n    // IPNS resolve needs a online daemon\n    if (!isOnline() && !offline) {\n      throw errcode(new Error(OFFLINE_ERROR), 'OFFLINE_ERROR')\n    }\n\n    // TODO: convert ipns.resolve to return an iterator\n    const value = await ipns.resolve(`/${namespace}/${hash}`, options)\n    yield appendRemainder(value instanceof Uint8Array ? uint8ArrayToString(value) : value, remainder)\n  }\n\n  return withTimeoutOption(resolve)\n}\n","'use strict'\n\n// Adapted from RFC 2181 (See section 11)\n//\n// The RFC defines a Domain Name to be at most 255 chars including seperators\n// between labels.\n// Subdomains are labels plus a seperator. A label is a string starting and\n// ending with an alphanum, with dashes allowed in the middle. It is between 1 and 63 chars.\n//\n// We make some assumptions below that go beyond the RFC. We assume the TLD\n// to be at least 2 chars. The regex also allows domains longer than 255 chars,\n// but allows at most 127 subdomains, as assuming a lower-bound of one char per\n// subdomain will yield 252, and adding a TLD of 2 chars sums to 254.\n/*\n(?:                   // Group 1: This is for subdomain, which is composed of a label and a seperator (length = [1, 63] + 1)\n  [a-z0-9]\n  (?:\n    [a-z0-9\\-]{0,61} // Limited to 61 chars as we have at least two chars if we reach this group (61 + 2 = 63 which is the limit)\n    [a-z0-9]\n  )?\n  \\.                  // Label seperator\n){0,126}             // If we assume the lower-bound of 1 char labels, we can at most have 126 groups before approaching the total limit of 255 chars\n(?:                   // Group 2: Assume that the TLD is at least 2 chars (for sanity)\n  [a-z0-9]\n  [a-z0-9\\-]{0,61}\n  [a-z0-9]\n)\n\\.?                   // Some consider a trailing dot to be considered valid as it signifies the root of the domain tree\n */\nvar domainNameRegex = /^(?:[a-z0-9](?:[a-z0-9\\-]{0,61}[a-z0-9])?\\.){0,126}(?:[a-z0-9](?:[a-z0-9\\-]{0,61}[a-z0-9]))\\.?$/i\n\n/**\n * Test whether a string is a valid domain name, optionally checking for a root dot as well\n * @param  {String}  domainName\n * @param  {Boolean} rootDot    Check for a root dot eg. 'example.com.'. Defaults to false\n * @return {Boolean}\n */\nmodule.exports = function isDomainName (domainName, rootDot) {\n  if (rootDot == null) rootDot = false\n\n  if (domainName.length < 2) return false\n  if (domainName.length > 255) return false\n\n  var lastChar = domainName[domainName.length - 1]\n  if (rootDot) {\n    if (lastChar !== '.') return false\n  } else {\n    if (lastChar === '.') return false\n  }\n\n  return domainNameRegex.test(domainName)\n}\n","'use strict'\n\nconst createCancelAPI = require('./cancel')\nconst createStateAPI = require('./state')\nconst createSubsAPI = require('./subs')\n\nclass PubSubAPI {\n  /**\n   * @param {Object} config\n   * @param {import('../../ipns')} config.ipns\n   * @param {import('../../../types').Options} config.options\n   */\n  constructor ({ ipns, options }) {\n    this.cancel = createCancelAPI({ ipns, options })\n    this.state = createStateAPI({ ipns, options })\n    this.subs = createSubsAPI({ ipns, options })\n  }\n}\nmodule.exports = PubSubAPI\n","'use strict'\n\nconst { getPubsubRouting } = require('./utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../ipns')} config.ipns\n * @param {import('../../../types').Options} config.options\n */\nmodule.exports = ({ ipns, options }) => {\n  const experimental = options.EXPERIMENTAL\n\n  /**\n   * @type {import('ipfs-core-types/src/name/pubsub').API[\"cancel\"]}\n   */\n  async function cancel (name, options = {}) { // eslint-disable-line require-await\n    const pubsub = getPubsubRouting(ipns, experimental)\n    return pubsub.cancel(name, options)\n  }\n\n  return withTimeoutOption(cancel)\n}\n","'use strict'\n\nconst IpnsPubsubDatastore = require('../../../ipns/routing/pubsub-datastore')\nconst errcode = require('err-code')\n\n/**\n * @typedef {import('../../../types').ExperimentalOptions} ExperimentalOptions\n * @property {boolean} [ipnsPubsub] - Enable pub-sub on IPNS. (Default: `false`)\n */\n\n/**\n * Get pubsub from IPNS routing\n *\n * @param {import('../../ipns')} ipns\n * @param {ExperimentalOptions} [options]\n */\nexports.getPubsubRouting = (ipns, options) => {\n  if (!ipns || !(options && options.ipnsPubsub)) {\n    throw errcode(new Error('IPNS pubsub subsystem is not enabled'), 'ERR_IPNS_PUBSUB_NOT_ENABLED')\n  }\n\n  // Only one store and it is pubsub\n  if (ipns.routing instanceof IpnsPubsubDatastore) {\n    return ipns.routing\n  }\n\n  // Find in tiered\n  const pubsub = (ipns.routing.stores || []).find(s => s instanceof IpnsPubsubDatastore)\n\n  if (!pubsub) {\n    throw errcode(new Error('IPNS pubsub datastore not found'), 'ERR_PUBSUB_DATASTORE_NOT_FOUND')\n  }\n\n  return pubsub\n}\n","'use strict'\n\nconst { getPubsubRouting } = require('./utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../ipns')} config.ipns\n * @param {import('../../../types').Options} config.options\n */\nmodule.exports = ({ ipns, options }) => {\n  const experimental = options.EXPERIMENTAL\n\n  /**\n   * @type {import('ipfs-core-types/src/name/pubsub').API[\"state\"]}\n   */\n  async function state (_options = {}) { // eslint-disable-line require-await\n    try {\n      return { enabled: Boolean(getPubsubRouting(ipns, experimental)) }\n    } catch (err) {\n      return { enabled: false }\n    }\n  }\n\n  return withTimeoutOption(state)\n}\n","'use strict'\n\nconst { getPubsubRouting } = require('./utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../ipns')} config.ipns\n * @param {import('../../../types').Options} config.options\n */\nmodule.exports = ({ ipns, options }) => {\n  const experimental = options.EXPERIMENTAL\n\n  /**\n   * @type {import('ipfs-core-types/src/name/pubsub').API[\"subs\"]}\n   */\n  async function subs (options = {}) { // eslint-disable-line require-await\n    const pubsub = getPubsubRouting(ipns, experimental)\n    return pubsub.getSubscriptions(options)\n  }\n\n  return withTimeoutOption(subs)\n}\n","'use strict'\n\nconst CID = require('cids')\nconst { DAGNode } = require('ipld-dag-pb')\nconst { Errors } = require('interface-datastore')\nconst ERR_NOT_FOUND = Errors.notFoundError().code\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst toCIDAndPath = require('ipfs-core-utils/src/to-cid-and-path')\n\nconst Format = {\n  default: '<dst>',\n  edges: '<src> -> <dst>'\n}\n\n/**\n * @typedef {object} Node\n * @property {string} [name]\n * @property {CID} cid\n *\n * @typedef {object} TraversalResult\n * @property {Node} parent\n * @property {Node} node\n * @property {boolean} isDuplicate\n */\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('ipfs-core-types/src/root').API[\"resolve\"]} config.resolve\n * @param {import('../../types').Preload} config.preload\n */\nmodule.exports = function ({ ipld, resolve, preload }) {\n  /**\n   * @type {import('ipfs-core-types/src/refs').API[\"refs\"]}\n   */\n  async function * refs (ipfsPath, options = {}) {\n    if (options.maxDepth === 0) {\n      return\n    }\n\n    if (options.edges && options.format && options.format !== Format.default) {\n      throw new Error('Cannot set edges to true and also specify format')\n    }\n\n    options.format = options.edges ? Format.edges : options.format\n\n    if (typeof options.maxDepth !== 'number') {\n      options.maxDepth = options.recursive ? Infinity : 1\n    }\n\n    /** @type {(string|CID)[]} */\n    const rawPaths = Array.isArray(ipfsPath) ? ipfsPath : [ipfsPath]\n\n    const paths = rawPaths.map(p => getFullPath(preload, p, options))\n\n    for (const path of paths) {\n      yield * refsStream(resolve, ipld, path, options)\n    }\n  }\n\n  return withTimeoutOption(refs)\n}\n\nmodule.exports.Format = Format\n\n/**\n * @param {import('../../types').Preload} preload\n * @param {string | CID} ipfsPath\n * @param {import('ipfs-core-types/src/refs').RefsOptions} options\n */\nfunction getFullPath (preload, ipfsPath, options) {\n  const {\n    cid,\n    path\n  } = toCIDAndPath(ipfsPath)\n\n  if (options.preload !== false) {\n    preload(cid)\n  }\n\n  return `/ipfs/${cid}${path || ''}`\n}\n\n/**\n * Get a stream of refs at the given path\n *\n * @param {import('ipfs-core-types/src/root').API[\"resolve\"]} resolve\n * @param {import('ipld')} ipld\n * @param {string} path\n * @param {import('ipfs-core-types/src/refs').RefsOptions} options\n */\nasync function * refsStream (resolve, ipld, path, options) {\n  // Resolve to the target CID of the path\n  const resPath = await resolve(path)\n  const {\n    cid\n  } = toCIDAndPath(resPath)\n\n  const maxDepth = options.maxDepth != null ? options.maxDepth : Infinity\n  const unique = options.unique || false\n\n  // Traverse the DAG, converting it into a stream\n  for await (const obj of objectStream(ipld, cid, maxDepth, unique)) {\n    // Root object will not have a parent\n    if (!obj.parent) {\n      continue\n    }\n\n    // Filter out duplicates (isDuplicate flag is only set if options.unique is set)\n    if (obj.isDuplicate) {\n      continue\n    }\n\n    // Format the links\n    // Clients expect refs to be in the format { ref: <ref> }\n    yield {\n      ref: formatLink(obj.parent.cid, obj.node.cid, obj.node.name, options.format)\n    }\n  }\n}\n\n/**\n * Get formatted link\n *\n * @param {CID} srcCid\n * @param {CID} dstCid\n * @param {string} [linkName]\n * @param {string} [format]\n */\nfunction formatLink (srcCid, dstCid, linkName = '', format = Format.default) {\n  let out = format.replace(/<src>/g, srcCid.toString())\n  out = out.replace(/<dst>/g, dstCid.toString())\n  out = out.replace(/<linkname>/g, linkName)\n  return out\n}\n\n/**\n * Do a depth first search of the DAG, starting from the given root cid\n *\n * @param {import('ipld')} ipld\n * @param {CID} rootCid\n * @param {number} maxDepth\n * @param {boolean} uniqueOnly\n */\nasync function * objectStream (ipld, rootCid, maxDepth, uniqueOnly) { // eslint-disable-line require-await\n  const seen = new Set()\n\n  /**\n   * @param {Node} parent\n   * @param {number} depth\n   * @returns {AsyncGenerator<TraversalResult, void, undefined>}\n   */\n  async function * traverseLevel (parent, depth) {\n    const nextLevelDepth = depth + 1\n\n    // Check the depth\n    if (nextLevelDepth > maxDepth) {\n      return\n    }\n\n    // Get this object's links\n    try {\n      // Look at each link, parent and the new depth\n      for (const link of await getLinks(ipld, parent.cid)) {\n        yield {\n          parent: parent,\n          node: link,\n          isDuplicate: uniqueOnly && seen.has(link.cid.toString())\n        }\n\n        if (uniqueOnly) {\n          seen.add(link.cid.toString())\n        }\n\n        yield * traverseLevel(link, nextLevelDepth)\n      }\n    } catch (err) {\n      if (err.code === ERR_NOT_FOUND) {\n        err.message = `Could not find object with CID: ${parent.cid}`\n      }\n\n      throw err\n    }\n  }\n\n  yield * traverseLevel({ cid: rootCid }, 0)\n}\n\n/**\n * Fetch a node from IPLD then get all its links\n *\n * @param {import('ipld')} ipld\n * @param {CID} cid\n */\nasync function getLinks (ipld, cid) {\n  const node = await ipld.get(cid)\n\n  if (node instanceof DAGNode) {\n    /**\n     * @param {import('ipld-dag-pb').DAGLink} arg\n     */\n    const mapper = ({ Name, Hash }) => ({ name: Name, cid: Hash })\n    return node.Links.map(mapper)\n  }\n\n  return getNodeLinks(node)\n}\n\n/**\n * Recursively search the node for CIDs\n *\n * @param {object} node\n * @param {string} [path]\n * @returns {Node[]}\n */\nfunction getNodeLinks (node, path = '') {\n  /** @type {Node[]} */\n  let links = []\n  for (const [name, value] of Object.entries(node)) {\n    if (CID.isCID(value)) {\n      links.push({\n        name: path + name,\n        cid: value\n      })\n    } else if (typeof value === 'object') {\n      links = links.concat(getNodeLinks(value, path + name + '/'))\n    }\n  }\n  return links\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-repo')} config.repo\n */\nmodule.exports = function ({ repo }) {\n  /**\n   * @type {import('ipfs-core-types/src/refs').API[\"local\"]}\n   */\n  async function * refsLocal (options = {}) {\n    for await (const cid of repo.blocks.queryKeys({}, { signal: options.signal })) {\n      yield { ref: cid.toString() }\n    }\n  }\n\n  return withTimeoutOption(refsLocal)\n}\n","'use strict'\n\nconst createWantlist = require('./wantlist')\nconst createWantlistForPeer = require('./wantlist-for-peer')\nconst createUnwant = require('./unwant')\nconst createStat = require('./stat')\n\n/**\n * @typedef {import('../../types').NetworkService} NetworkService\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('cids')} CID\n * @typedef {import('ipfs-core-types/src/utils').AbortOptions} AbortOptions\n */\n\nclass BitswapAPI {\n  /**\n   * @param {Object} config\n   * @param {NetworkService} config.network\n   */\n  constructor ({ network }) {\n    this.wantlist = createWantlist({ network })\n    this.wantlistForPeer = createWantlistForPeer({ network })\n    this.unwant = createUnwant({ network })\n    this.stat = createStat({ network })\n  }\n}\nmodule.exports = BitswapAPI\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/bitswap').API[\"wantlist\"]}\n   */\n  async function wantlist (options = {}) {\n    const { bitswap } = await network.use(options)\n    const list = bitswap.getWantlist()\n\n    return Array.from(list).map(e => e[1].cid)\n  }\n\n  return withTimeoutOption(wantlist)\n}\n","'use strict'\n\nconst PeerId = require('peer-id')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/bitswap').API[\"wantlistForPeer\"]}\n   */\n  async function wantlistForPeer (peerId, options = {}) {\n    const { bitswap } = await network.use(options)\n    const list = bitswap.wantlistForPeer(PeerId.createFromCID(peerId), options)\n\n    return Array.from(list).map(e => e[1].cid)\n  }\n\n  return withTimeoutOption(wantlistForPeer)\n}\n","'use strict'\n\nconst CID = require('cids')\nconst errCode = require('err-code')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/bitswap').API[\"unwant\"]}\n   */\n  async function unwant (cids, options = {}) {\n    const { bitswap } = await network.use(options)\n\n    if (!Array.isArray(cids)) {\n      cids = [cids]\n    }\n\n    try {\n      cids = cids.map((cid) => new CID(cid))\n    } catch (err) {\n      throw errCode(err, 'ERR_INVALID_CID')\n    }\n\n    return bitswap.unwant(cids)\n  }\n\n  return withTimeoutOption(unwant)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/bitswap').API[\"stat\"]}\n   */\n  async function stat (options = {}) {\n    /** @type {import('ipfs-bitswap')} */\n    const bitswap = (await network.use(options)).bitswap\n    const snapshot = bitswap.stat().snapshot\n\n    return {\n      provideBufLen: parseInt(snapshot.providesBufferLength.toString()),\n      blocksReceived: BigInt(snapshot.blocksReceived.toString()),\n      wantlist: Array.from(bitswap.getWantlist()).map(e => e[1].cid),\n      peers: bitswap.peers().map(id => id.toB58String()),\n      dupBlksReceived: BigInt(snapshot.dupBlksReceived.toString()),\n      dupDataReceived: BigInt(snapshot.dupDataReceived.toString()),\n      dataReceived: BigInt(snapshot.dataReceived.toString()),\n      blocksSent: BigInt(snapshot.blocksSent.toString()),\n      dataSent: BigInt(snapshot.dataSent.toString())\n    }\n  }\n\n  return withTimeoutOption(stat)\n}\n","'use strict'\n\nconst createAdd = require('./add')\nconst createClear = require('./clear')\nconst createList = require('./list')\nconst createReset = require('./reset')\nconst createRm = require('./rm')\nclass BootstrapAPI {\n  /**\n   * @param {Object} config\n   * @param {import('ipfs-repo')} config.repo\n   */\n  constructor ({ repo }) {\n    this.add = createAdd({ repo })\n    this.list = createList({ repo })\n    this.rm = createRm({ repo })\n    this.clear = createClear({ repo })\n    this.reset = createReset({ repo })\n  }\n}\nmodule.exports = BootstrapAPI\n","'use strict'\n\nconst { isValidMultiaddr } = require('./utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-repo')} config.repo\n */\nmodule.exports = ({ repo }) => {\n  /**\n   * @type {import('ipfs-core-types/src/bootstrap').API[\"add\"]}\n   */\n  async function add (multiaddr, options = {}) {\n    if (!isValidMultiaddr(multiaddr)) {\n      throw new Error(`${multiaddr} is not a valid Multiaddr`)\n    }\n\n    /** @type {import('ipfs-core-types/src/config').Config} */\n    // @ts-ignore repo returns type unknown\n    const config = await repo.config.getAll(options)\n\n    const boostrappers = config.Bootstrap || []\n    boostrappers.push(multiaddr.toString())\n\n    config.Bootstrap = Array.from(\n      new Set(boostrappers)\n    ).sort((a, b) => a.localeCompare(b))\n\n    await repo.config.replace(config)\n\n    return {\n      Peers: [multiaddr]\n    }\n  }\n\n  return withTimeoutOption(add)\n}\n","'use strict'\n\nconst isMultiaddr = require('mafmt').IPFS.matches\n\n/**\n * @param {any} ma\n */\nexports.isValidMultiaddr = ma => {\n  try {\n    return isMultiaddr(ma)\n  } catch (err) {\n    return false\n  }\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst { Multiaddr } = require('multiaddr')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-repo')} config.repo\n */\nmodule.exports = ({ repo }) => {\n  /**\n   * @type {import('ipfs-core-types/src/bootstrap').API[\"clear\"]}\n   */\n  async function clear (options = {}) {\n    /** @type {import('ipfs-core-types/src/config').Config} */\n    // @ts-ignore repo returns type unknown\n    const config = await repo.config.getAll(options)\n    const removed = config.Bootstrap || []\n    config.Bootstrap = []\n\n    await repo.config.replace(config)\n\n    return { Peers: removed.map(ma => new Multiaddr(ma)) }\n  }\n\n  return withTimeoutOption(clear)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst { Multiaddr } = require('multiaddr')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-repo')} config.repo\n */\nmodule.exports = ({ repo }) => {\n  /**\n   * @type {import('ipfs-core-types/src/bootstrap').API[\"list\"]}\n   */\n  async function list (options = {}) {\n    /** @type {string[]|null} */\n    const peers = (await repo.config.get('Bootstrap', options))\n    return { Peers: (peers || []).map(ma => new Multiaddr(ma)) }\n  }\n\n  return withTimeoutOption(list)\n}\n","'use strict'\n\nconst defaultConfig = require('../../runtime/config-nodejs.js')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst { Multiaddr } = require('multiaddr')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-repo')} config.repo\n */\nmodule.exports = ({ repo }) => {\n  /**\n   * @type {import('ipfs-core-types/src/bootstrap').API[\"reset\"]}\n   */\n  async function reset (options = {}) {\n    /** @type {import('ipfs-core-types/src/config').Config} */\n    // @ts-ignore repo returns type unknown\n    const config = await repo.config.getAll(options)\n    config.Bootstrap = defaultConfig().Bootstrap\n\n    await repo.config.replace(config)\n\n    return {\n      Peers: defaultConfig().Bootstrap.map(ma => new Multiaddr(ma))\n    }\n  }\n\n  return withTimeoutOption(reset)\n}\n","'use strict'\n\nmodule.exports = () => ({\n  Addresses: {\n    Swarm: [\n    ],\n    Announce: [],\n    NoAnnounce: [],\n    API: '',\n    Gateway: '',\n    RPC: '',\n    Delegates: [\n      '/dns4/node0.delegate.ipfs.io/tcp/443/https',\n      '/dns4/node1.delegate.ipfs.io/tcp/443/https',\n      '/dns4/node2.delegate.ipfs.io/tcp/443/https',\n      '/dns4/node3.delegate.ipfs.io/tcp/443/https'\n    ]\n  },\n  Discovery: {\n    MDNS: {\n      Enabled: false,\n      Interval: 10\n    },\n    webRTCStar: {\n      Enabled: true\n    }\n  },\n  Bootstrap: [\n    '/dnsaddr/bootstrap.libp2p.io/p2p/QmNnooDu7bfjPFoTZYxMNLWUQJyrVwtbZg5gBMjTezGAJN',\n    '/dnsaddr/bootstrap.libp2p.io/p2p/QmbLHAnMoJPWSCR5Zhtx6BHJX9KiKNN6tpvbUcqanj75Nb',\n    '/dnsaddr/bootstrap.libp2p.io/p2p/QmZa1sAxajnQjVM8WjWXoMbmPd7NsWhfKsPkErzpm9wGkp',\n    '/dnsaddr/bootstrap.libp2p.io/p2p/QmQCU2EcMqAqQPR2i9bChDtGNJchTbq5TbXJJ16u19uLTa',\n    '/dnsaddr/bootstrap.libp2p.io/p2p/QmcZf59bWwK5XFi76CZX8cbJ4BhTzzA3gU1ZjYZcYW3dwt',\n    '/dns4/node0.preload.ipfs.io/tcp/443/wss/p2p/QmZMxNdpMkewiVZLMRxaNxUeZpDUb34pWjZ1kZvsd16Zic',\n    '/dns4/node1.preload.ipfs.io/tcp/443/wss/p2p/Qmbut9Ywz9YEDrz8ySBSgWyJk41Uvm2QJPhwDJzJyGFsD6',\n    '/dns4/node2.preload.ipfs.io/tcp/443/wss/p2p/QmV7gnbW5VTcJ3oyM2Xk1rdFBJ3kTkvxc87UFGsun29STS',\n    '/dns4/node3.preload.ipfs.io/tcp/443/wss/p2p/QmY7JB6MQXhxHvq7dBDh4HpbH29v4yE9JRadAVpndvzySN'\n  ],\n  Pubsub: {\n    Enabled: true\n  },\n  Swarm: {\n    ConnMgr: {\n      LowWater: 200,\n      HighWater: 500\n    },\n    DisableNatPortMap: true\n  },\n  Routing: {\n    Type: 'none'\n  }\n})\n","'use strict'\n\nconst { isValidMultiaddr } = require('./utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-repo')} config.repo\n */\nmodule.exports = ({ repo }) => {\n  /**\n   * @type {import('ipfs-core-types/src/bootstrap').API[\"rm\"]}\n   */\n  async function rm (multiaddr, options = {}) {\n    if (!isValidMultiaddr(multiaddr)) {\n      throw new Error(`${multiaddr} is not a valid Multiaddr`)\n    }\n\n    /** @type {import('ipfs-core-types/src/config').Config} */\n    // @ts-ignore repo returns type unknown\n    const config = await repo.config.getAll(options)\n    config.Bootstrap = (config.Bootstrap || []).filter(ma => ma.toString() !== multiaddr.toString())\n\n    await repo.config.replace(config)\n\n    return { Peers: [multiaddr] }\n  }\n\n  return withTimeoutOption(rm)\n}\n","'use strict'\n\nconst createGet = require('./get')\nconst createPut = require('./put')\nconst createRm = require('./rm')\nconst createStat = require('./stat')\n\n/**\n * @typedef {import('../../types').Preload} Preload\n * @typedef {import('ipfs-block-service')} BlockService\n * @typedef {import('../gc-lock').GCLock} GCLock\n * @typedef {import('ipfs-core-types/src/pin').API} Pin\n * @typedef {import('../pin/pin-manager')} PinManager\n */\n\nclass BlockAPI {\n  /**\n   * @param {Object} config\n   * @param {Preload} config.preload\n   * @param {BlockService} config.blockService\n   * @param {GCLock} config.gcLock\n   * @param {Pin} config.pin\n   * @param {PinManager} config.pinManager\n   */\n  constructor ({ blockService, preload, gcLock, pinManager, pin }) {\n    this.get = createGet({ blockService, preload })\n    this.put = createPut({ blockService, preload, gcLock, pin })\n    this.rm = createRm({ blockService, gcLock, pinManager })\n    this.stat = createStat({ blockService, preload })\n  }\n}\n\nmodule.exports = BlockAPI\n","'use strict'\n\nconst { cleanCid } = require('./utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-block-service')} config.blockService\n * @param {import('../../types').Preload} config.preload\n */\nmodule.exports = ({ blockService, preload }) => {\n  /**\n   * @type {import('ipfs-core-types/src/block').API[\"get\"]}\n   */\n  async function get (cid, options = {}) { // eslint-disable-line require-await\n    cid = cleanCid(cid)\n\n    if (options.preload !== false) {\n      preload(cid)\n    }\n\n    return blockService.get(cid, options)\n  }\n\n  return withTimeoutOption(get)\n}\n","'use strict'\n\nconst CID = require('cids')\nconst errCode = require('err-code')\n\n/**\n * @param {string|Uint8Array|CID} cid\n * @returns {CID}\n */\nexports.cleanCid = cid => {\n  if (CID.isCID(cid)) {\n    return cid\n  }\n\n  // CID constructor knows how to do the cleaning :)\n  try {\n    // @ts-ignore - string|Uint8Array union seems to confuse CID typedefs.\n    return new CID(cid)\n  } catch (err) {\n    throw errCode(err, 'ERR_INVALID_CID')\n  }\n}\n","'use strict'\n\nconst Block = require('ipld-block')\nconst multihashing = require('multihashing-async')\nconst CID = require('cids')\nconst isIPFS = require('is-ipfs')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @typedef {import('cids').CIDVersion} CIDVersion\n */\n\n/**\n * @param {Object} config\n * @param {import('ipfs-block-service')} config.blockService\n * @param {import('ipfs-core-types/src/pin').API} config.pin\n * @param {import('.').GCLock} config.gcLock\n * @param {import('../../types').Preload} config.preload\n */\nmodule.exports = ({ blockService, pin, gcLock, preload }) => {\n  /**\n   * @type {import('ipfs-core-types/src/block').API[\"put\"]}\n   */\n  async function put (block, options = {}) {\n    if (Array.isArray(block)) {\n      throw new Error('Array is not supported')\n    }\n\n    if (!Block.isBlock(block)) {\n      /** @type {Uint8Array} */\n      const bytes = (block)\n      if (options.cid && isIPFS.cid(options.cid)) {\n        const cid = CID.isCID(options.cid) ? options.cid : new CID(options.cid)\n        block = new Block(bytes, cid)\n      } else {\n        const mhtype = options.mhtype || 'sha2-256'\n        const format = options.format || 'dag-pb'\n\n        /** @type {CIDVersion} */\n        let cidVersion = 1\n\n        if (options.version == null) {\n          // Pick appropriate CID version\n          cidVersion = mhtype === 'sha2-256' && format === 'dag-pb' ? 0 : 1\n        } else {\n          // @ts-ignore - options.version is a {number} but the CID constructor arg version is a {0|1}\n          // TODO: https://github.com/multiformats/js-cid/pull/129\n          cidVersion = options.version\n        }\n\n        const multihash = await multihashing(bytes, mhtype)\n        const cid = new CID(cidVersion, format, multihash)\n\n        block = new Block(bytes, cid)\n      }\n    }\n\n    const release = await gcLock.readLock()\n\n    try {\n      await blockService.put(block, {\n        signal: options.signal\n      })\n\n      if (options.preload !== false) {\n        preload(block.cid)\n      }\n\n      if (options.pin === true) {\n        await pin.add(block.cid, {\n          recursive: true,\n          signal: options.signal\n        })\n      }\n\n      return block\n    } finally {\n      release()\n    }\n  }\n\n  return withTimeoutOption(put)\n}\n","'use strict'\n\nconst CID = require('cids')\n\nconst { version } = require('../package.json')\nconst blockSymbol = Symbol.for('@ipld/js-ipld-block/block')\nconst readonly = { writable: false, configurable: false, enumerable: true }\n\n/**\n * Represents an immutable block of data that is uniquely referenced with a cid.\n *\n * @example\n * const block = new Block(Uint8Array.from([0, 1, 2, 3]), new CID('...'))\n */\nclass Block {\n  /**\n   * @param {Uint8Array} data - The data to be stored in the block as a Uint8Array.\n   * @param {CID} cid - The cid of the data\n   */\n  constructor (data, cid) {\n    if (!data || !(data instanceof Uint8Array)) {\n      throw new Error('first argument  must be a Uint8Array')\n    }\n\n    if (!cid || !CID.isCID(cid)) {\n      throw new Error('second argument must be a CID')\n    }\n\n    this.data = data\n    this.cid = cid\n\n    Object.defineProperties(this, {\n      data: readonly,\n      cid: readonly\n    })\n  }\n\n  /**\n   * The data of this block.\n   *\n   * @deprecated\n   * @type {Uint8Array}\n   */\n  get _data () {\n    deprecateData()\n    return this.data\n  }\n\n  /**\n   * The cid of the data this block represents.\n   *\n   * @deprecated\n   * @type {CID}\n   */\n  get _cid () {\n    deprecateCID()\n    return this.cid\n  }\n\n  get [Symbol.toStringTag] () {\n    return 'Block'\n  }\n\n  get [blockSymbol] () {\n    return true\n  }\n\n  /**\n   * Check if the given value is a Block.\n   *\n   * @param {any} other\n   * @returns {other is Block}\n   */\n  static isBlock (other) {\n    return Boolean(other && other[blockSymbol])\n  }\n}\n\n/**\n * @param {RegExp} range\n * @param {string} message\n * @returns {() => void}\n */\nconst deprecate = (range, message) => {\n  let warned = false\n  return () => {\n    if (range.test(version)) {\n      if (!warned) {\n        warned = true\n        // eslint-disable-next-line no-console\n        console.warn(message)\n      }\n    } else {\n      throw new Error(message)\n    }\n  }\n}\n\nconst deprecateCID = deprecate(/^0\\.10|^0\\.11/, 'block._cid is deprecated and will be removed in 0.12 release. Please use block.cid instead')\nconst deprecateData = deprecate(/^0\\.10|^0.11/, 'block._data is deprecated and will be removed in 0.12 release. Please use block.data instead')\n\nmodule.exports = Block\n","'use strict'\n\nconst CID = require('cids')\nconst errCode = require('err-code')\nconst { parallelMap, filter } = require('streaming-iterables')\nconst { pipe } = require('it-pipe')\nconst { PinTypes } = require('../pin/pin-manager')\nconst { cleanCid } = require('./utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\nconst BLOCK_RM_CONCURRENCY = 8\n\n/**\n * @param {Object} config\n * @param {import('ipfs-block-service')} config.blockService\n * @param {import('../pin/pin-manager')} config.pinManager\n * @param {import('.').GCLock} config.gcLock\n */\nmodule.exports = ({ blockService, gcLock, pinManager }) => {\n  /**\n   * @type {import('ipfs-core-types/src/block').API[\"rm\"]}\n   */\n  async function * rm (cids, options = {}) {\n    if (!Array.isArray(cids)) {\n      cids = [cids]\n    }\n\n    // We need to take a write lock here to ensure that adding and removing\n    // blocks are exclusive operations\n    const release = await gcLock.writeLock()\n\n    try {\n      yield * pipe(\n        cids,\n        parallelMap(BLOCK_RM_CONCURRENCY, async cid => {\n          cid = cleanCid(cid)\n\n          /** @type {import('ipfs-core-types/src/block').RmResult} */\n          const result = { cid }\n\n          try {\n            const pinResult = await pinManager.isPinnedWithType(cid, PinTypes.all)\n\n            if (pinResult.pinned) {\n              if (CID.isCID(pinResult.reason)) { // eslint-disable-line max-depth\n                throw errCode(new Error(`pinned via ${pinResult.reason}`), 'ERR_BLOCK_PINNED')\n              }\n\n              throw errCode(new Error(`pinned: ${pinResult.reason}`), 'ERR_BLOCK_PINNED')\n            }\n\n            // remove has check when https://github.com/ipfs/js-ipfs-block-service/pull/88 is merged\n            // @ts-ignore - this accesses some internals\n            const has = await blockService._repo.blocks.has(cid)\n\n            if (!has) {\n              throw errCode(new Error('block not found'), 'ERR_BLOCK_NOT_FOUND')\n            }\n\n            await blockService.delete(cid)\n          } catch (err) {\n            if (!options.force) {\n              err.message = `cannot remove ${cid}: ${err.message}`\n              result.error = err\n            }\n          }\n\n          return result\n        }),\n        filter(() => !options.quiet)\n      )\n    } finally {\n      release()\n    }\n  }\n\n  return withTimeoutOption(rm)\n}\n","(function (global, factory) {\n    typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :\n    typeof define === 'function' && define.amd ? define(['exports'], factory) :\n    (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.streamingIterables = {}));\n}(this, (function (exports) { 'use strict';\n\n    async function* _batch(size, iterable) {\n        let dataBatch = [];\n        for await (const data of iterable) {\n            dataBatch.push(data);\n            if (dataBatch.length === size) {\n                yield dataBatch;\n                dataBatch = [];\n            }\n        }\n        if (dataBatch.length > 0) {\n            yield dataBatch;\n        }\n    }\n    function* _syncBatch(size, iterable) {\n        let dataBatch = [];\n        for (const data of iterable) {\n            dataBatch.push(data);\n            if (dataBatch.length === size) {\n                yield dataBatch;\n                dataBatch = [];\n            }\n        }\n        if (dataBatch.length > 0) {\n            yield dataBatch;\n        }\n    }\n    function batch(size, iterable) {\n        if (iterable === undefined) {\n            return curriedIterable => batch(size, curriedIterable);\n        }\n        if (iterable[Symbol.asyncIterator]) {\n            return _batch(size, iterable);\n        }\n        return _syncBatch(size, iterable);\n    }\n\n    function getIterator(iterable) {\n        if (typeof iterable.next === 'function') {\n            return iterable;\n        }\n        if (typeof iterable[Symbol.iterator] === 'function') {\n            return iterable[Symbol.iterator]();\n        }\n        if (typeof iterable[Symbol.asyncIterator] === 'function') {\n            return iterable[Symbol.asyncIterator]();\n        }\n        throw new TypeError('\"values\" does not to conform to any of the iterator or iterable protocols');\n    }\n\n    function defer() {\n        let reject;\n        let resolve;\n        const promise = new Promise((resolveFunc, rejectFunc) => {\n            resolve = resolveFunc;\n            reject = rejectFunc;\n        });\n        return {\n            promise,\n            reject,\n            resolve,\n        };\n    }\n\n    /// <reference lib=\"esnext.asynciterable\" />\n    function _buffer(size, iterable) {\n        const iterator = getIterator(iterable);\n        const resultQueue = [];\n        const readQueue = [];\n        let reading = false;\n        let ended = false;\n        function fulfillReadQueue() {\n            while (readQueue.length > 0 && resultQueue.length > 0) {\n                const readDeferred = readQueue.shift();\n                const { error, value } = resultQueue.shift();\n                if (error) {\n                    readDeferred.reject(error);\n                }\n                else {\n                    readDeferred.resolve({ done: false, value });\n                }\n            }\n            while (readQueue.length > 0 && ended) {\n                const { resolve } = readQueue.shift();\n                resolve({ done: true, value: undefined });\n            }\n        }\n        async function fillQueue() {\n            if (ended) {\n                return;\n            }\n            if (reading) {\n                return;\n            }\n            if (resultQueue.length >= size) {\n                return;\n            }\n            reading = true;\n            try {\n                const { done, value } = await iterator.next();\n                if (done) {\n                    ended = true;\n                }\n                else {\n                    resultQueue.push({ value });\n                }\n            }\n            catch (error) {\n                ended = true;\n                resultQueue.push({ error });\n            }\n            fulfillReadQueue();\n            reading = false;\n            fillQueue();\n        }\n        async function next() {\n            if (resultQueue.length > 0) {\n                const { error, value } = resultQueue.shift();\n                if (error) {\n                    throw error;\n                }\n                fillQueue();\n                return { done: false, value };\n            }\n            if (ended) {\n                return { done: true, value: undefined }; // stupid ts\n            }\n            const deferred = defer();\n            readQueue.push(deferred);\n            fillQueue();\n            return deferred.promise;\n        }\n        const asyncIterableIterator = {\n            next,\n            [Symbol.asyncIterator]: () => asyncIterableIterator,\n        };\n        return asyncIterableIterator;\n    }\n    function* syncBuffer(size, iterable) {\n        const valueQueue = [];\n        let e;\n        try {\n            for (const value of iterable) {\n                valueQueue.push(value);\n                if (valueQueue.length <= size) {\n                    continue;\n                }\n                yield valueQueue.shift();\n            }\n        }\n        catch (error) {\n            e = error;\n        }\n        for (const value of valueQueue) {\n            yield value;\n        }\n        if (e) {\n            throw e;\n        }\n    }\n    function buffer(size, iterable) {\n        if (iterable === undefined) {\n            return curriedIterable => buffer(size, curriedIterable);\n        }\n        if (size === 0) {\n            return iterable;\n        }\n        if (iterable[Symbol.asyncIterator]) {\n            return _buffer(size, iterable);\n        }\n        return syncBuffer(size, iterable);\n    }\n\n    async function _collect(iterable) {\n        const values = [];\n        for await (const value of iterable) {\n            values.push(value);\n        }\n        return values;\n    }\n    function collect(iterable) {\n        if (iterable[Symbol.asyncIterator]) {\n            return _collect(iterable);\n        }\n        return Array.from(iterable);\n    }\n\n    async function* _concat(iterables) {\n        for await (const iterable of iterables) {\n            yield* iterable;\n        }\n    }\n    function* _syncConcat(iterables) {\n        for (const iterable of iterables) {\n            yield* iterable;\n        }\n    }\n    function concat(...iterables) {\n        const hasAnyAsync = iterables.find(itr => itr[Symbol.asyncIterator] !== undefined);\n        if (hasAnyAsync) {\n            return _concat(iterables);\n        }\n        else {\n            return _syncConcat(iterables);\n        }\n    }\n\n    async function _consume(iterable) {\n        for await (const val of iterable) {\n            // do nothing\n        }\n    }\n    function consume(iterable) {\n        if (iterable[Symbol.asyncIterator]) {\n            return _consume(iterable);\n        }\n        for (const val of iterable) {\n            // do nothing\n        }\n    }\n\n    async function* _filter(filterFunc, iterable) {\n        for await (const data of iterable) {\n            if (await filterFunc(data)) {\n                yield data;\n            }\n        }\n    }\n    function filter(filterFunc, iterable) {\n        if (iterable === undefined) {\n            return (curriedIterable) => _filter(filterFunc, curriedIterable);\n        }\n        return _filter(filterFunc, iterable);\n    }\n\n    async function* flatten(iterable) {\n        for await (const maybeItr of iterable) {\n            if (maybeItr && typeof maybeItr !== 'string' && (maybeItr[Symbol.iterator] || maybeItr[Symbol.asyncIterator])) {\n                yield* flatten(maybeItr);\n            }\n            else {\n                yield maybeItr;\n            }\n        }\n    }\n\n    async function* _map(func, iterable) {\n        for await (const val of iterable) {\n            yield await func(val);\n        }\n    }\n    function map(func, iterable) {\n        if (iterable === undefined) {\n            return curriedIterable => _map(func, curriedIterable);\n        }\n        return _map(func, iterable);\n    }\n\n    function flatMap(func, iterable) {\n        if (iterable === undefined) {\n            return curriedIterable => flatMap(func, curriedIterable);\n        }\n        return filter(i => i !== undefined && i !== null, flatten(map(func, iterable)));\n    }\n\n    function _flatTransform(concurrency, func, iterable) {\n        const iterator = getIterator(iterable);\n        const resultQueue = [];\n        const readQueue = [];\n        let ended = false;\n        let reading = false;\n        let inflightCount = 0;\n        let lastError = null;\n        function fulfillReadQueue() {\n            while (readQueue.length > 0 && resultQueue.length > 0) {\n                const { resolve } = readQueue.shift();\n                const value = resultQueue.shift();\n                resolve({ done: false, value });\n            }\n            while (readQueue.length > 0 && inflightCount === 0 && ended) {\n                const { resolve, reject } = readQueue.shift();\n                if (lastError) {\n                    reject(lastError);\n                    lastError = null;\n                }\n                else {\n                    resolve({ done: true, value: undefined });\n                }\n            }\n        }\n        async function fillQueue() {\n            if (ended) {\n                fulfillReadQueue();\n                return;\n            }\n            if (reading) {\n                return;\n            }\n            if (inflightCount + resultQueue.length >= concurrency) {\n                return;\n            }\n            reading = true;\n            inflightCount++;\n            try {\n                const { done, value } = await iterator.next();\n                if (done) {\n                    ended = true;\n                    inflightCount--;\n                    fulfillReadQueue();\n                }\n                else {\n                    mapAndQueue(value);\n                }\n            }\n            catch (error) {\n                ended = true;\n                inflightCount--;\n                lastError = error;\n                fulfillReadQueue();\n            }\n            reading = false;\n            fillQueue();\n        }\n        async function mapAndQueue(itrValue) {\n            try {\n                const value = await func(itrValue);\n                if (value && value[Symbol.asyncIterator]) {\n                    for await (const asyncVal of value) {\n                        resultQueue.push(asyncVal);\n                    }\n                }\n                else {\n                    resultQueue.push(value);\n                }\n            }\n            catch (error) {\n                ended = true;\n                lastError = error;\n            }\n            inflightCount--;\n            fulfillReadQueue();\n            fillQueue();\n        }\n        async function next() {\n            if (resultQueue.length === 0) {\n                const deferred = defer();\n                readQueue.push(deferred);\n                fillQueue();\n                return deferred.promise;\n            }\n            const value = resultQueue.shift();\n            fillQueue();\n            return { done: false, value };\n        }\n        const asyncIterableIterator = {\n            next,\n            [Symbol.asyncIterator]: () => asyncIterableIterator,\n        };\n        return asyncIterableIterator;\n    }\n    function flatTransform(concurrency, func, iterable) {\n        if (func === undefined) {\n            return (curriedFunc, curriedIterable) => curriedIterable\n                ? flatTransform(concurrency, curriedFunc, curriedIterable)\n                : flatTransform(concurrency, curriedFunc);\n        }\n        if (iterable === undefined) {\n            return (curriedIterable) => flatTransform(concurrency, func, curriedIterable);\n        }\n        return filter(i => i !== undefined && i !== null, flatten(_flatTransform(concurrency, func, iterable)));\n    }\n\n    async function onceReadable(stream) {\n        return new Promise(resolve => {\n            stream.once('readable', () => {\n                resolve();\n            });\n        });\n    }\n    async function* _fromStream(stream) {\n        while (true) {\n            const data = stream.read();\n            if (data !== null) {\n                yield data;\n                continue;\n            }\n            if (stream._readableState.ended) {\n                break;\n            }\n            await onceReadable(stream);\n        }\n    }\n    function fromStream(stream) {\n        if (typeof stream[Symbol.asyncIterator] === 'function') {\n            return stream;\n        }\n        return _fromStream(stream);\n    }\n\n    async function* merge(...iterables) {\n        const sources = new Set(iterables.map(getIterator));\n        while (sources.size > 0) {\n            for (const iterator of sources) {\n                const nextVal = await iterator.next();\n                if (nextVal.done) {\n                    sources.delete(iterator);\n                }\n                else {\n                    yield nextVal.value;\n                }\n            }\n        }\n    }\n\n    function pipeline(firstFn, ...fns) {\n        let previousFn = firstFn();\n        for (const func of fns) {\n            previousFn = func(previousFn);\n        }\n        return previousFn;\n    }\n\n    async function* _parallelMap(concurrency, func, iterable) {\n        let transformError = null;\n        const wrapFunc = value => ({\n            value: func(value),\n        });\n        const stopOnError = async function* (source) {\n            for await (const value of source) {\n                if (transformError) {\n                    return;\n                }\n                yield value;\n            }\n        };\n        const output = pipeline(() => iterable, buffer(1), stopOnError, map(wrapFunc), buffer(concurrency - 1));\n        const itr = getIterator(output);\n        while (true) {\n            const { value, done } = await itr.next();\n            if (done) {\n                break;\n            }\n            try {\n                const val = await value.value;\n                if (!transformError) {\n                    yield val;\n                }\n            }\n            catch (error) {\n                transformError = error;\n            }\n        }\n        if (transformError) {\n            throw transformError;\n        }\n    }\n    function parallelMap(concurrency, func, iterable) {\n        if (func === undefined) {\n            return (curriedFunc, curriedIterable) => parallelMap(concurrency, curriedFunc, curriedIterable);\n        }\n        if (iterable === undefined) {\n            return curriedIterable => parallelMap(concurrency, func, curriedIterable);\n        }\n        if (concurrency === 1) {\n            return map(func, iterable);\n        }\n        return _parallelMap(concurrency, func, iterable);\n    }\n\n    function parallelFlatMap(concurrency, func, iterable) {\n        if (func === undefined) {\n            return (curriedFunc, curriedIterable) => curriedIterable\n                ? parallelFlatMap(concurrency, curriedFunc, curriedIterable)\n                : parallelFlatMap(concurrency, curriedFunc);\n        }\n        if (iterable === undefined) {\n            return (curriedIterable) => parallelFlatMap(concurrency, func, curriedIterable);\n        }\n        return filter(i => i !== undefined && i !== null, flatten(parallelMap(concurrency, func, iterable)));\n    }\n\n    /// <reference lib=\"esnext.asynciterable\" />\n    async function* parallelMerge(...iterables) {\n        const inputs = iterables.map(getIterator);\n        const concurrentWork = new Set();\n        const values = new Map();\n        let lastError = null;\n        let errCb = null;\n        let valueCb = null;\n        const notifyError = err => {\n            lastError = err;\n            if (errCb) {\n                errCb(err);\n            }\n        };\n        const notifyDone = value => {\n            if (valueCb) {\n                valueCb(value);\n            }\n        };\n        const waitForQueue = () => new Promise((resolve, reject) => {\n            if (lastError) {\n                reject(lastError);\n            }\n            if (values.size > 0) {\n                return resolve();\n            }\n            valueCb = resolve;\n            errCb = reject;\n        });\n        const queueNext = input => {\n            const nextVal = Promise.resolve(input.next()).then(async ({ done, value }) => {\n                if (!done) {\n                    values.set(input, value);\n                }\n                concurrentWork.delete(nextVal);\n            });\n            concurrentWork.add(nextVal);\n            nextVal.then(notifyDone, notifyError);\n        };\n        for (const input of inputs) {\n            queueNext(input);\n        }\n        while (true) {\n            // We technically don't have to check `values.size` as the for loop should have emptied it\n            // However I haven't yet found specs verifying that behavior, only tests\n            // the guard in waitForQueue() checking for values is in place for the same reason\n            if (concurrentWork.size === 0 && values.size === 0) {\n                return;\n            }\n            await waitForQueue();\n            for (const [input, value] of values) {\n                values.delete(input);\n                yield value;\n                queueNext(input);\n            }\n        }\n    }\n\n    async function _reduce(func, start, iterable) {\n        let value = start;\n        for await (const nextItem of iterable) {\n            value = await func(value, nextItem);\n        }\n        return value;\n    }\n    function reduce(func, start, iterable) {\n        if (start === undefined) {\n            return (curriedStart, curriedIterable) => curriedIterable ? _reduce(func, curriedStart, curriedIterable) : reduce(func, curriedStart);\n        }\n        if (iterable === undefined) {\n            return (curriedIterable) => reduce(func, start, curriedIterable);\n        }\n        return _reduce(func, start, iterable);\n    }\n\n    async function* _take(count, iterable) {\n        let taken = 0;\n        for await (const val of iterable) {\n            yield await val;\n            taken++;\n            if (taken >= count) {\n                break;\n            }\n        }\n    }\n    function* _syncTake(count, iterable) {\n        let taken = 0;\n        for (const val of iterable) {\n            yield val;\n            taken++;\n            if (taken >= count) {\n                break;\n            }\n        }\n    }\n    function take(count, iterable) {\n        if (iterable === undefined) {\n            return curriedIterable => take(count, curriedIterable);\n        }\n        if (iterable[Symbol.asyncIterator]) {\n            return _take(count, iterable);\n        }\n        return _syncTake(count, iterable);\n    }\n\n    async function* _asyncTap(func, iterable) {\n        for await (const val of iterable) {\n            await func(val);\n            yield val;\n        }\n    }\n    function tap(func, iterable) {\n        if (iterable === undefined) {\n            return (curriedIterable) => _asyncTap(func, curriedIterable);\n        }\n        return _asyncTap(func, iterable);\n    }\n\n    function addTime(a, b) {\n        let seconds = a[0] + b[0];\n        let nanoseconds = a[1] + b[1];\n        if (nanoseconds >= 1000000000) {\n            const remainder = nanoseconds % 1000000000;\n            seconds += (nanoseconds - remainder) / 1000000000;\n            nanoseconds = remainder;\n        }\n        return [seconds, nanoseconds];\n    }\n    async function* _asyncTime(config, iterable) {\n        const itr = iterable[Symbol.asyncIterator]();\n        let total = [0, 0];\n        while (true) {\n            const start = process.hrtime();\n            const { value, done } = await itr.next();\n            const delta = process.hrtime(start);\n            total = addTime(total, delta);\n            if (config.progress) {\n                config.progress(delta, total);\n            }\n            if (done) {\n                if (config.total) {\n                    config.total(total);\n                }\n                return value;\n            }\n            yield value;\n        }\n    }\n    function* _syncTime(config, iterable) {\n        const itr = iterable[Symbol.iterator]();\n        let total = [0, 0];\n        while (true) {\n            const start = process.hrtime();\n            const { value, done } = itr.next();\n            const delta = process.hrtime(start);\n            total = addTime(total, delta);\n            if (config.progress) {\n                config.progress(delta, total);\n            }\n            if (done) {\n                if (config.total) {\n                    config.total(total);\n                }\n                return value;\n            }\n            yield value;\n        }\n    }\n    function time(config = {}, iterable) {\n        if (iterable === undefined) {\n            return curriedIterable => time(config, curriedIterable);\n        }\n        if (iterable[Symbol.asyncIterator] !== undefined) {\n            return _asyncTime(config, iterable);\n        }\n        else {\n            return _syncTime(config, iterable);\n        }\n    }\n\n    function _transform(concurrency, func, iterable) {\n        const iterator = getIterator(iterable);\n        const resultQueue = [];\n        const readQueue = [];\n        let ended = false;\n        let reading = false;\n        let inflightCount = 0;\n        let lastError = null;\n        function fulfillReadQueue() {\n            while (readQueue.length > 0 && resultQueue.length > 0) {\n                const { resolve } = readQueue.shift();\n                const value = resultQueue.shift();\n                resolve({ done: false, value });\n            }\n            while (readQueue.length > 0 && inflightCount === 0 && ended) {\n                const { resolve, reject } = readQueue.shift();\n                if (lastError) {\n                    reject(lastError);\n                    lastError = null;\n                }\n                else {\n                    resolve({ done: true, value: undefined });\n                }\n            }\n        }\n        async function fillQueue() {\n            if (ended) {\n                fulfillReadQueue();\n                return;\n            }\n            if (reading) {\n                return;\n            }\n            if (inflightCount + resultQueue.length >= concurrency) {\n                return;\n            }\n            reading = true;\n            inflightCount++;\n            try {\n                const { done, value } = await iterator.next();\n                if (done) {\n                    ended = true;\n                    inflightCount--;\n                    fulfillReadQueue();\n                }\n                else {\n                    mapAndQueue(value);\n                }\n            }\n            catch (error) {\n                ended = true;\n                inflightCount--;\n                lastError = error;\n                fulfillReadQueue();\n            }\n            reading = false;\n            fillQueue();\n        }\n        async function mapAndQueue(itrValue) {\n            try {\n                const value = await func(itrValue);\n                resultQueue.push(value);\n            }\n            catch (error) {\n                ended = true;\n                lastError = error;\n            }\n            inflightCount--;\n            fulfillReadQueue();\n            fillQueue();\n        }\n        async function next() {\n            if (resultQueue.length === 0) {\n                const deferred = defer();\n                readQueue.push(deferred);\n                fillQueue();\n                return deferred.promise;\n            }\n            const value = resultQueue.shift();\n            fillQueue();\n            return { done: false, value };\n        }\n        const asyncIterableIterator = {\n            next,\n            [Symbol.asyncIterator]: () => asyncIterableIterator,\n        };\n        return asyncIterableIterator;\n    }\n    function transform(concurrency, func, iterable) {\n        if (func === undefined) {\n            return (curriedFunc, curriedIterable) => curriedIterable\n                ? transform(concurrency, curriedFunc, curriedIterable)\n                : transform(concurrency, curriedFunc);\n        }\n        if (iterable === undefined) {\n            return (curriedIterable) => transform(concurrency, func, curriedIterable);\n        }\n        return _transform(concurrency, func, iterable);\n    }\n\n    async function _writeToStream(stream, iterable) {\n        let lastError = null;\n        let errCb = null;\n        let drainCb = null;\n        const notifyError = err => {\n            lastError = err;\n            if (errCb) {\n                errCb(err);\n            }\n        };\n        const notifyDrain = () => {\n            if (drainCb) {\n                drainCb();\n            }\n        };\n        const cleanup = () => {\n            stream.removeListener('error', notifyError);\n            stream.removeListener('drain', notifyDrain);\n        };\n        stream.once('error', notifyError);\n        const waitForDrain = () => new Promise((resolve, reject) => {\n            if (lastError) {\n                return reject(lastError);\n            }\n            stream.once('drain', notifyDrain);\n            drainCb = resolve;\n            errCb = reject;\n        });\n        for await (const value of iterable) {\n            if (stream.write(value) === false) {\n                await waitForDrain();\n            }\n            if (lastError) {\n                break;\n            }\n        }\n        cleanup();\n        if (lastError) {\n            throw lastError;\n        }\n    }\n    function writeToStream(stream, iterable) {\n        if (iterable === undefined) {\n            return (curriedIterable) => _writeToStream(stream, curriedIterable);\n        }\n        return _writeToStream(stream, iterable);\n    }\n\n    exports.batch = batch;\n    exports.buffer = buffer;\n    exports.collect = collect;\n    exports.concat = concat;\n    exports.consume = consume;\n    exports.filter = filter;\n    exports.flatMap = flatMap;\n    exports.flatTransform = flatTransform;\n    exports.flatten = flatten;\n    exports.fromStream = fromStream;\n    exports.getIterator = getIterator;\n    exports.map = map;\n    exports.merge = merge;\n    exports.parallelFlatMap = parallelFlatMap;\n    exports.parallelMap = parallelMap;\n    exports.parallelMerge = parallelMerge;\n    exports.pipeline = pipeline;\n    exports.reduce = reduce;\n    exports.take = take;\n    exports.tap = tap;\n    exports.time = time;\n    exports.transform = transform;\n    exports.writeToStream = writeToStream;\n\n    Object.defineProperty(exports, '__esModule', { value: true });\n\n})));\n","const rawPipe = (...fns) => {\n  let res\n  while (fns.length) {\n    res = fns.shift()(res)\n  }\n  return res\n}\n\nconst isIterable = obj => obj && (\n  typeof obj[Symbol.asyncIterator] === 'function' ||\n  typeof obj[Symbol.iterator] === 'function' ||\n  typeof obj.next === 'function' // Probably, right?\n)\n\nconst isDuplex = obj => obj && typeof obj.sink === 'function' && isIterable(obj.source)\n\nconst duplexPipelineFn = duplex => source => {\n  duplex.sink(source) // TODO: error on sink side is unhandled rejection - this is the same as pull streams\n  return duplex.source\n}\n\nconst pipe = (...fns) => {\n  // Duplex at start: wrap in function and return duplex source\n  if (isDuplex(fns[0])) {\n    const duplex = fns[0]\n    fns[0] = () => duplex.source\n  // Iterable at start: wrap in function\n  } else if (isIterable(fns[0])) {\n    const source = fns[0]\n    fns[0] = () => source\n  }\n\n  if (fns.length > 1) {\n    // Duplex at end: use duplex sink\n    if (isDuplex(fns[fns.length - 1])) {\n      fns[fns.length - 1] = fns[fns.length - 1].sink\n    }\n  }\n\n  if (fns.length > 2) {\n    // Duplex in the middle, consume source with duplex sink and return duplex source\n    for (let i = 1; i < fns.length - 1; i++) {\n      if (isDuplex(fns[i])) {\n        fns[i] = duplexPipelineFn(fns[i])\n      }\n    }\n  }\n\n  return rawPipe(...fns)\n}\n\nmodule.exports = pipe\nmodule.exports.pipe = pipe\nmodule.exports.rawPipe = rawPipe\nmodule.exports.isIterable = isIterable\nmodule.exports.isDuplex = isDuplex\n","'use strict'\n\nconst { cleanCid } = require('./utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-block-service')} config.blockService\n * @param {import('../../types').Preload} config.preload\n */\n\nmodule.exports = ({ blockService, preload }) => {\n  /**\n   * @type {import('ipfs-core-types/src/block').API[\"stat\"]}\n   */\n  async function stat (cid, options = {}) {\n    cid = cleanCid(cid)\n\n    if (options.preload !== false) {\n      preload(cid)\n    }\n\n    const block = await blockService.get(cid)\n\n    return { cid, size: block.data.length }\n  }\n\n  return withTimeoutOption(stat)\n}\n","'use strict'\n\nconst createAddAPI = require('./add')\nconst createAddAllAPI = require('./add-all')\nconst createCatAPI = require('./cat')\nconst createGetAPI = require('./get')\nconst createLsAPI = require('./ls')\n\n/**\n * @typedef {AddAllContext & CatContext & GetContext & ListContext } Context\n * @typedef {import('./add-all').Context} AddAllContext\n * @typedef {import('./cat').Context} CatContext\n * @typedef {import('./get').Context} GetContext\n * @typedef {import('./ls').Context} ListContext\n */\nclass Root {\n  /**\n   * @param {Context} context\n   */\n  constructor ({ preload, gcLock, pin, block, ipld, options }) {\n    const addAll = createAddAllAPI({\n      preload,\n      gcLock,\n      block,\n      pin,\n      options\n    })\n\n    this.addAll = addAll\n    this.add = createAddAPI({ addAll })\n    this.cat = createCatAPI({ ipld, preload })\n    this.get = createGetAPI({ ipld, preload })\n    this.ls = createLsAPI({ ipld, preload })\n  }\n}\n\nmodule.exports = Root\n","'use strict'\n\nconst last = require('it-last')\n\n/**\n * @param {Object} context\n * @param {import('ipfs-core-types/src/root').API[\"addAll\"]} context.addAll\n */\nmodule.exports = ({ addAll }) => {\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"add\"]}\n   */\n  async function add (entry, options = {}) {\n    // @ts-ignore TODO: https://github.com/ipfs/js-ipfs/issues/3290\n    const result = await last(addAll(entry, options))\n    // Note this should never happen as `addAll` should yield at least one item\n    // but to satisfy type checker we perfom this check and for good measure\n    // throw an error in case it does happen.\n    if (result == null) {\n      throw Error('Failed to add a file, if you see this please report a bug')\n    }\n\n    return result\n  }\n\n  return add\n}\n","'use strict'\n\nconst { importer } = require('ipfs-unixfs-importer')\nconst normaliseAddInput = require('ipfs-core-utils/src/files/normalise-input/index')\nconst { parseChunkerString } = require('./utils')\nconst { pipe } = require('it-pipe')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('ipfs-unixfs-importer').ImportResult} ImportResult\n */\n\n/**\n * @typedef {Object} Context\n * @property {import('ipfs-core-types/src/block').API} block\n * @property {import('../gc-lock').GCLock} gcLock\n * @property {import('../../types').Preload} preload\n * @property {import('ipfs-core-types/src/pin').API} pin\n * @property {import('ipfs-core-types/src/root').ShardingOptions} [options]\n *\n * @param {Context} context\n */\nmodule.exports = ({ block, gcLock, preload, pin, options }) => {\n  const isShardingEnabled = options && options.sharding\n\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"addAll\"]}\n   */\n  async function * addAll (source, options = {}) {\n    const opts = mergeOptions({\n      shardSplitThreshold: isShardingEnabled ? 1000 : Infinity,\n      strategy: 'balanced'\n    }, options, {\n      ...parseChunkerString(options.chunker)\n    })\n\n    // CID v0 is for multihashes encoded with sha2-256\n    if (opts.hashAlg && opts.hashAlg !== 'sha2-256' && opts.cidVersion !== 1) {\n      opts.cidVersion = 1\n    }\n\n    if (opts.trickle) {\n      opts.strategy = 'trickle'\n    }\n\n    if (opts.strategy === 'trickle') {\n      opts.leafType = 'raw'\n      opts.reduceSingleLeafToSelf = false\n    }\n\n    if (opts.cidVersion > 0 && opts.rawLeaves === undefined) {\n      // if the cid version is 1 or above, use raw leaves as this is\n      // what go does.\n      opts.rawLeaves = true\n    }\n\n    if (opts.hashAlg !== undefined && opts.rawLeaves === undefined) {\n      // if a non-default hash alg has been specified, use raw leaves as this is\n      // what go does.\n      opts.rawLeaves = true\n    }\n\n    delete opts.trickle\n\n    /** @type {Record<string, number>} */\n    const totals = {}\n\n    if (opts.progress) {\n      const prog = opts.progress\n\n      /**\n       * @param {number} bytes\n       * @param {string} path\n       */\n      opts.progress = (bytes, path) => {\n        if (!totals[path]) {\n          totals[path] = 0\n        }\n\n        totals[path] += bytes\n\n        prog(totals[path], path)\n      }\n    }\n\n    const iterator = pipe(\n      normaliseAddInput(source),\n      /**\n       * @param {AsyncIterable<import('ipfs-unixfs-importer').ImportCandidate>} source\n       */\n      source => importer(source, block, {\n        ...opts,\n        pin: false\n      }),\n      transformFile(opts),\n      preloadFile(preload, opts),\n      pinFile(pin, opts)\n    )\n\n    const releaseLock = await gcLock.readLock()\n\n    try {\n      for await (const added of iterator) {\n        // do not keep file totals around forever\n        delete totals[added.path]\n\n        yield added\n      }\n    } finally {\n      releaseLock()\n    }\n  }\n\n  return withTimeoutOption(addAll)\n}\n\n/**\n * @param {import('ipfs-core-types/src/root').AddAllOptions} opts\n */\nfunction transformFile (opts) {\n  /**\n   * @param {AsyncGenerator<ImportResult, void, undefined>} source\n   */\n  async function * transformFile (source) {\n    for await (const file of source) {\n      let cid = file.cid\n\n      if (opts.cidVersion === 1) {\n        cid = cid.toV1()\n      }\n\n      let path = file.path ? file.path : cid.toString()\n\n      if (opts.wrapWithDirectory && !file.path) {\n        path = ''\n      }\n\n      yield {\n        path,\n        cid,\n        size: file.size,\n        mode: file.unixfs && file.unixfs.mode,\n        mtime: file.unixfs && file.unixfs.mtime\n      }\n    }\n  }\n\n  return transformFile\n}\n\n/**\n * @param {(cid: CID) => void} preload\n * @param {import('ipfs-core-types/src/root').AddAllOptions} opts\n */\nfunction preloadFile (preload, opts) {\n  /**\n   * @param {AsyncGenerator<ImportResult, void, undefined>} source\n   */\n  async function * maybePreloadFile (source) {\n    for await (const file of source) {\n      const isRootFile = !file.path || opts.wrapWithDirectory\n        ? file.path === ''\n        : !file.path.includes('/')\n\n      const shouldPreload = isRootFile && !opts.onlyHash && opts.preload !== false\n\n      if (shouldPreload) {\n        preload(file.cid)\n      }\n\n      yield file\n    }\n  }\n\n  return maybePreloadFile\n}\n\n/**\n * @param {import('ipfs-core-types/src/pin').API} pin\n * @param {import('ipfs-core-types/src/root').AddAllOptions} opts\n */\nfunction pinFile (pin, opts) {\n  /**\n   * @param {AsyncGenerator<ImportResult, void, undefined>} source\n   */\n  async function * maybePinFile (source) {\n    for await (const file of source) {\n      // Pin a file if it is the root dir of a recursive add or the single file\n      // of a direct add.\n      const isRootDir = !(file.path && file.path.includes('/'))\n      const shouldPin = (opts.pin == null ? true : opts.pin) && isRootDir && !opts.onlyHash\n\n      if (shouldPin) {\n        // Note: addAsyncIterator() has already taken a GC lock, so tell\n        // pin.add() not to take a (second) GC lock\n        await pin.add(file.cid, {\n          preload: false,\n          lock: false\n        })\n      }\n\n      yield file\n    }\n  }\n\n  return maybePinFile\n}\n","'use strict'\n\nconst parallelBatch = require('it-parallel-batch')\nconst defaultOptions = require('./options')\n\n/**\n * @typedef {import('./types').BlockAPI} BlockAPI\n * @typedef {import('./types').ImportCandidate} ImportCandidate\n * @typedef {import('./types').UserImporterOptions} UserImporterOptions\n * @typedef {import('./types').ImporterOptions} ImporterOptions\n * @typedef {import('./types').Directory} Directory\n * @typedef {import('./types').File} File\n * @typedef {import('./types').ImportResult} ImportResult\n *\n * @typedef {import('./types').Chunker} Chunker\n * @typedef {import('./types').DAGBuilder} DAGBuilder\n * @typedef {import('./types').TreeBuilder} TreeBuilder\n * @typedef {import('./types').BufferImporter} BufferImporter\n * @typedef {import('./types').ChunkValidator} ChunkValidator\n * @typedef {import('./types').Reducer} Reducer\n * @typedef {import('./types').ProgressHandler} ProgressHandler\n */\n\n/**\n * @param {AsyncIterable<ImportCandidate> | Iterable<ImportCandidate> | ImportCandidate} source\n * @param {BlockAPI} block\n * @param {UserImporterOptions} options\n */\nasync function * importer (source, block, options = {}) {\n  const opts = defaultOptions(options)\n\n  let dagBuilder\n\n  if (typeof options.dagBuilder === 'function') {\n    dagBuilder = options.dagBuilder\n  } else {\n    dagBuilder = require('./dag-builder')\n  }\n\n  let treeBuilder\n\n  if (typeof options.treeBuilder === 'function') {\n    treeBuilder = options.treeBuilder\n  } else {\n    treeBuilder = require('./tree-builder')\n  }\n\n  /** @type {AsyncIterable<ImportCandidate> | Iterable<ImportCandidate>} */\n  let candidates\n\n  if (Symbol.asyncIterator in source || Symbol.iterator in source) {\n    // @ts-ignore\n    candidates = source\n  } else {\n    // @ts-ignore\n    candidates = [source]\n  }\n\n  for await (const entry of treeBuilder(parallelBatch(dagBuilder(candidates, block, opts), opts.fileImportConcurrency), block, opts)) {\n    yield {\n      cid: entry.cid,\n      path: entry.path,\n      unixfs: entry.unixfs,\n      size: entry.size\n    }\n  }\n}\n\nmodule.exports = {\n  importer\n}\n","'use strict'\n\nconst batch = require('it-batch')\n\n/**\n * @template T\n * @typedef {{ok:true, value:T}} Success\n */\n\n/**\n * @typedef {{ok:false, err:Error}} Failure\n */\n\n/**\n * Takes an (async) iterator that emits promise-returning functions,\n * invokes them in parallel and emits the results as they become available but\n * in the same order as the input\n *\n * @template T\n * @param {AsyncIterable<() => Promise<T>>} source\n * @param {number} [size=1]\n * @returns {AsyncIterable<T>}\n */\nasync function * parallelBatch (source, size = 1) {\n  for await (const tasks of batch(source, size)) {\n    /** @type {Promise<Success<T>|Failure>[]} */\n    const things = tasks.map(\n      /**\n       * @param {() => Promise<T>} p\n       */\n      p => {\n        return p().then(value => ({ ok: true, value }), err => ({ ok: false, err }))\n      })\n\n    for (let i = 0; i < things.length; i++) {\n      const result = await things[i]\n\n      if (result.ok) {\n        yield result.value\n      } else {\n        throw result.err\n      }\n    }\n  }\n}\n\nmodule.exports = parallelBatch\n","'use strict'\n\n/**\n * Takes an (async) iterable that emits things and returns an async iterable that\n * emits those things in fixed-sized batches.\n *\n * @template T\n * @param {AsyncIterable<T>|Iterable<T>} source\n * @param {number} [size=1]\n * @returns {AsyncIterable<T[]>}\n */\nasync function * batch (source, size = 1) {\n  /** @type {T[]} */\n  let things = []\n\n  if (size < 1) {\n    size = 1\n  }\n\n  for await (const thing of source) {\n    things.push(thing)\n\n    while (things.length >= size) {\n      yield things.slice(0, size)\n\n      things = things.slice(size)\n    }\n  }\n\n  while (things.length) {\n    yield things.slice(0, size)\n\n    things = things.slice(size)\n  }\n}\n\nmodule.exports = batch\n","'use strict'\n\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\nconst multihashing = require('multihashing-async')\n\n/**\n * @param {Uint8Array} buf\n */\nasync function hamtHashFn (buf) {\n  const hash = await multihashing(buf, 'murmur3-128')\n\n  // Multihashing inserts preamble of 2 bytes. Remove it.\n  // Also, murmur3 outputs 128 bit but, accidentally, IPFS Go's\n  // implementation only uses the first 64, so we must do the same\n  // for parity..\n  const justHash = hash.slice(2, 10)\n  const length = justHash.length\n  const result = new Uint8Array(length)\n  // TODO: invert buffer because that's how Go impl does it\n  for (let i = 0; i < length; i++) {\n    result[length - i - 1] = justHash[i]\n  }\n\n  return result\n}\n\n/**\n * @typedef {import('./types').UserImporterOptions} UserImporterOptions\n * @typedef {import('./types').ImporterOptions} ImporterOptions\n */\n\n/**\n * @type {ImporterOptions}\n */\nconst defaultOptions = {\n  chunker: 'fixed',\n  strategy: 'balanced', // 'flat', 'trickle'\n  rawLeaves: false,\n  onlyHash: false,\n  reduceSingleLeafToSelf: true,\n  hashAlg: 'sha2-256',\n  leafType: 'file', // 'raw'\n  cidVersion: 0,\n  progress: () => () => {},\n  shardSplitThreshold: 1000,\n  fileImportConcurrency: 50,\n  blockWriteConcurrency: 10,\n  minChunkSize: 262144,\n  maxChunkSize: 262144,\n  avgChunkSize: 262144,\n  window: 16,\n  // FIXME: This number is too big for JavaScript\n  // https://github.com/ipfs/go-ipfs-chunker/blob/d0125832512163708c0804a3cda060e21acddae4/rabin.go#L11\n  polynomial: 17437180132763653, // eslint-disable-line no-loss-of-precision\n  maxChildrenPerNode: 174,\n  layerRepeat: 4,\n  wrapWithDirectory: false,\n  pin: false,\n  recursive: false,\n  hidden: false,\n  preload: false,\n  timeout: undefined,\n  hamtHashFn,\n  hamtHashCode: 0x22,\n  hamtBucketBits: 8\n}\n\n/**\n * @param {UserImporterOptions} options\n * @returns {ImporterOptions}\n */\nmodule.exports = function (options = {}) {\n  return mergeOptions(defaultOptions, options)\n}\n","'use strict'\n\nconst dirBuilder = require('./dir')\nconst fileBuilder = require('./file')\nconst errCode = require('err-code')\n\n/**\n * @typedef {import('../types').File} File\n * @typedef {import('../types').Directory} Directory\n * @typedef {import('../types').DAGBuilder} DAGBuilder\n * @typedef {import('../types').Chunker} Chunker\n * @typedef {import('../types').ChunkValidator} ChunkValidator\n */\n\n/**\n * @param {any} thing\n * @returns {thing is Iterable<any>}\n */\nfunction isIterable (thing) {\n  return Symbol.iterator in thing\n}\n\n/**\n * @param {any} thing\n * @returns {thing is AsyncIterable<any>}\n */\nfunction isAsyncIterable (thing) {\n  return Symbol.asyncIterator in thing\n}\n\n/**\n * @param {Uint8Array | AsyncIterable<Uint8Array> | Iterable<Uint8Array>} content\n * @returns {AsyncIterable<Uint8Array>}\n */\nfunction contentAsAsyncIterable (content) {\n  try {\n    if (content instanceof Uint8Array) {\n      return (async function * () {\n        yield content\n      }())\n    } else if (isIterable(content)) {\n      return (async function * () {\n        yield * content\n      }())\n    } else if (isAsyncIterable(content)) {\n      return content\n    }\n  } catch {\n    throw errCode(new Error('Content was invalid'), 'ERR_INVALID_CONTENT')\n  }\n\n  throw errCode(new Error('Content was invalid'), 'ERR_INVALID_CONTENT')\n}\n\n/**\n * @type {DAGBuilder}\n */\nasync function * dagBuilder (source, block, options) {\n  for await (const entry of source) {\n    if (entry.path) {\n      if (entry.path.substring(0, 2) === './') {\n        options.wrapWithDirectory = true\n      }\n\n      entry.path = entry.path\n        .split('/')\n        .filter(path => path && path !== '.')\n        .join('/')\n    }\n\n    if (entry.content) {\n      /**\n       * @type {Chunker}\n       */\n      let chunker\n\n      if (typeof options.chunker === 'function') {\n        chunker = options.chunker\n      } else if (options.chunker === 'rabin') {\n        chunker = require('../chunker/rabin')\n      } else {\n        chunker = require('../chunker/fixed-size')\n      }\n\n      /**\n       * @type {ChunkValidator}\n       */\n      let chunkValidator\n\n      if (typeof options.chunkValidator === 'function') {\n        chunkValidator = options.chunkValidator\n      } else {\n        chunkValidator = require('./validate-chunks')\n      }\n\n      /** @type {File} */\n      const file = {\n        path: entry.path,\n        mtime: entry.mtime,\n        mode: entry.mode,\n        content: chunker(chunkValidator(contentAsAsyncIterable(entry.content), options), options)\n      }\n\n      yield () => fileBuilder(file, block, options)\n    } else if (entry.path) {\n      /** @type {Directory} */\n      const dir = {\n        path: entry.path,\n        mtime: entry.mtime,\n        mode: entry.mode\n      }\n\n      yield () => dirBuilder(dir, block, options)\n    } else {\n      throw new Error('Import candidate must have content or path or both')\n    }\n  }\n}\n\nmodule.exports = dagBuilder\n","'use strict'\n\nconst { UnixFS } = require('ipfs-unixfs')\nconst persist = require('../utils/persist')\nconst {\n  DAGNode\n} = require('ipld-dag-pb')\n\n/**\n * @typedef {import('../types').Directory} Directory\n */\n\n/**\n * @type {import('../types').UnixFSV1DagBuilder<Directory>}\n */\nconst dirBuilder = async (item, block, options) => {\n  const unixfs = new UnixFS({\n    type: 'directory',\n    mtime: item.mtime,\n    mode: item.mode\n  })\n\n  const buffer = new DAGNode(unixfs.marshal()).serialize()\n  const cid = await persist(buffer, block, options)\n  const path = item.path\n\n  return {\n    cid,\n    path,\n    unixfs,\n    size: buffer.length\n  }\n}\n\nmodule.exports = dirBuilder\n","'use strict'\n\nconst mh = require('multihashing-async')\nconst CID = require('cids')\n\n/**\n * @param {Uint8Array} buffer\n * @param {import('../types').BlockAPI} block\n * @param {import('../types').PersistOptions} options\n */\nconst persist = async (buffer, block, options) => {\n  if (!options.codec) {\n    options.codec = 'dag-pb'\n  }\n\n  if (!options.cidVersion) {\n    options.cidVersion = 0\n  }\n\n  if (!options.hashAlg) {\n    options.hashAlg = 'sha2-256'\n  }\n\n  if (options.hashAlg !== 'sha2-256') {\n    options.cidVersion = 1\n  }\n\n  const multihash = await mh(buffer, options.hashAlg)\n  const cid = new CID(options.cidVersion, options.codec, multihash)\n\n  if (!options.onlyHash) {\n    // @ts-ignore block api takes uint8arrays or blocks but is missing from typedefs\n    await block.put(buffer, {\n      // @ts-ignore pin option is missing from block api typedefs\n      pin: options.pin,\n      preload: options.preload,\n      timeout: options.timeout,\n      cid\n    })\n  }\n\n  return cid\n}\n\nmodule.exports = persist\n","'use strict'\n\nconst errCode = require('err-code')\nconst { UnixFS } = require('ipfs-unixfs')\nconst persist = require('../../utils/persist')\nconst {\n  DAGNode,\n  DAGLink\n} = require('ipld-dag-pb')\nconst parallelBatch = require('it-parallel-batch')\nconst mh = require('multihashing-async').multihash\n\n/**\n * @typedef {import('../../types').BlockAPI} BlockAPI\n * @typedef {import('../../types').File} File\n * @typedef {import('../../types').ImporterOptions} ImporterOptions\n * @typedef {import('../../types').Reducer} Reducer\n * @typedef {import('../../types').DAGBuilder} DAGBuilder\n * @typedef {import('../../types').FileDAGBuilder} FileDAGBuilder\n */\n\n/**\n * @type {{ [key: string]: FileDAGBuilder}}\n */\nconst dagBuilders = {\n  flat: require('./flat'),\n  balanced: require('./balanced'),\n  trickle: require('./trickle')\n}\n\n/**\n * @param {File} file\n * @param {BlockAPI} block\n * @param {ImporterOptions} options\n */\nasync function * buildFileBatch (file, block, options) {\n  let count = -1\n  let previous\n  let bufferImporter\n\n  if (typeof options.bufferImporter === 'function') {\n    bufferImporter = options.bufferImporter\n  } else {\n    bufferImporter = require('./buffer-importer')\n  }\n\n  for await (const entry of parallelBatch(bufferImporter(file, block, options), options.blockWriteConcurrency)) {\n    count++\n\n    if (count === 0) {\n      previous = entry\n      continue\n    } else if (count === 1 && previous) {\n      yield previous\n      previous = null\n    }\n\n    yield entry\n  }\n\n  if (previous) {\n    previous.single = true\n    yield previous\n  }\n}\n\n/**\n * @param {File} file\n * @param {BlockAPI} block\n * @param {ImporterOptions} options\n */\nconst reduce = (file, block, options) => {\n  /**\n   * @type {Reducer}\n   */\n  async function reducer (leaves) {\n    if (leaves.length === 1 && leaves[0].single && options.reduceSingleLeafToSelf) {\n      const leaf = leaves[0]\n\n      if (leaf.cid.codec === 'raw' && (file.mtime !== undefined || file.mode !== undefined)) {\n        // only one leaf node which is a buffer - we have metadata so convert it into a\n        // UnixFS entry otherwise we'll have nowhere to store the metadata\n        let { data: buffer } = await block.get(leaf.cid, options)\n\n        leaf.unixfs = new UnixFS({\n          type: 'file',\n          mtime: file.mtime,\n          mode: file.mode,\n          data: buffer\n        })\n\n        const multihash = mh.decode(leaf.cid.multihash)\n        buffer = new DAGNode(leaf.unixfs.marshal()).serialize()\n\n        leaf.cid = await persist(buffer, block, {\n          ...options,\n          codec: 'dag-pb',\n          hashAlg: multihash.name,\n          cidVersion: options.cidVersion\n        })\n        leaf.size = buffer.length\n      }\n\n      return {\n        cid: leaf.cid,\n        path: file.path,\n        unixfs: leaf.unixfs,\n        size: leaf.size\n      }\n    }\n\n    // create a parent node and add all the leaves\n    const f = new UnixFS({\n      type: 'file',\n      mtime: file.mtime,\n      mode: file.mode\n    })\n\n    const links = leaves\n      .filter(leaf => {\n        if (leaf.cid.codec === 'raw' && leaf.size) {\n          return true\n        }\n\n        if (leaf.unixfs && !leaf.unixfs.data && leaf.unixfs.fileSize()) {\n          return true\n        }\n\n        return Boolean(leaf.unixfs && leaf.unixfs.data && leaf.unixfs.data.length)\n      })\n      .map((leaf) => {\n        if (leaf.cid.codec === 'raw') {\n          // node is a leaf buffer\n          f.addBlockSize(leaf.size)\n\n          return new DAGLink('', leaf.size, leaf.cid)\n        }\n\n        if (!leaf.unixfs || !leaf.unixfs.data) {\n          // node is an intermediate node\n          f.addBlockSize((leaf.unixfs && leaf.unixfs.fileSize()) || 0)\n        } else {\n          // node is a unixfs 'file' leaf node\n          f.addBlockSize(leaf.unixfs.data.length)\n        }\n\n        return new DAGLink('', leaf.size, leaf.cid)\n      })\n\n    const node = new DAGNode(f.marshal(), links)\n    const buffer = node.serialize()\n    const cid = await persist(buffer, block, options)\n\n    return {\n      cid,\n      path: file.path,\n      unixfs: f,\n      size: buffer.length + node.Links.reduce((acc, curr) => acc + curr.Tsize, 0)\n    }\n  }\n\n  return reducer\n}\n\n/**\n * @type {import('../../types').UnixFSV1DagBuilder<File>}\n */\nfunction fileBuilder (file, block, options) {\n  const dagBuilder = dagBuilders[options.strategy]\n\n  if (!dagBuilder) {\n    throw errCode(new Error(`Unknown importer build strategy name: ${options.strategy}`), 'ERR_BAD_STRATEGY')\n  }\n\n  return dagBuilder(buildFileBatch(file, block, options), reduce(file, block, options), options)\n}\n\nmodule.exports = fileBuilder\n","'use strict'\n\nconst all = require('it-all')\n\n/**\n * @type {import('../../types').FileDAGBuilder}\n */\nmodule.exports = async function (source, reduce) {\n  return reduce(await all(source))\n}\n","'use strict'\n\nconst batch = require('it-batch')\n\n/**\n * @typedef {import('../../types').FileDAGBuilder} FileDAGBuilder\n */\n\n/**\n * @type {FileDAGBuilder}\n */\nfunction balanced (source, reduce, options) {\n  return reduceToParents(source, reduce, options)\n}\n\n/**\n * @type {FileDAGBuilder}\n */\nasync function reduceToParents (source, reduce, options) {\n  const roots = []\n\n  for await (const chunked of batch(source, options.maxChildrenPerNode)) {\n    roots.push(await reduce(chunked))\n  }\n\n  if (roots.length > 1) {\n    return reduceToParents(roots, reduce, options)\n  }\n\n  return roots[0]\n}\n\nmodule.exports = balanced\n","'use strict'\n\nconst batch = require('it-batch')\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('ipfs-unixfs').UnixFS} UnixFS\n * @typedef {import('../../types').ImporterOptions} ImporterOptions\n * @typedef {import('../../types').InProgressImportResult} InProgressImportResult\n * @typedef {import('../../types').TrickleDagNode} TrickleDagNode\n * @typedef {import('../../types').Reducer} Reducer\n * @typedef {import('../../types').FileDAGBuilder} FileDAGBuilder\n */\n\n/**\n * @type {FileDAGBuilder}\n */\nmodule.exports = async function trickleStream (source, reduce, options) {\n  const root = new Root(options.layerRepeat)\n  let iteration = 0\n  let maxDepth = 1\n\n  /** @type {SubTree} */\n  let subTree = root\n\n  for await (const layer of batch(source, options.maxChildrenPerNode)) {\n    if (subTree.isFull()) {\n      if (subTree !== root) {\n        root.addChild(await subTree.reduce(reduce))\n      }\n\n      if (iteration && iteration % options.layerRepeat === 0) {\n        maxDepth++\n      }\n\n      subTree = new SubTree(maxDepth, options.layerRepeat, iteration)\n\n      iteration++\n    }\n\n    subTree.append(layer)\n  }\n\n  if (subTree && subTree !== root) {\n    root.addChild(await subTree.reduce(reduce))\n  }\n\n  return root.reduce(reduce)\n}\n\nclass SubTree {\n  /**\n   * @param {number} maxDepth\n   * @param {number} layerRepeat\n   * @param {number} [iteration=0]\n   */\n  constructor (maxDepth, layerRepeat, iteration = 0) {\n    this.maxDepth = maxDepth\n    this.layerRepeat = layerRepeat\n    this.currentDepth = 1\n    this.iteration = iteration\n\n    /** @type {TrickleDagNode} */\n    this.root = this.node = this.parent = {\n      children: [],\n      depth: this.currentDepth,\n      maxDepth,\n      maxChildren: (this.maxDepth - this.currentDepth) * this.layerRepeat\n    }\n  }\n\n  isFull () {\n    if (!this.root.data) {\n      return false\n    }\n\n    if (this.currentDepth < this.maxDepth && this.node.maxChildren) {\n      // can descend\n      this._addNextNodeToParent(this.node)\n\n      return false\n    }\n\n    // try to find new node from node.parent\n    const distantRelative = this._findParent(this.node, this.currentDepth)\n\n    if (distantRelative) {\n      this._addNextNodeToParent(distantRelative)\n\n      return false\n    }\n\n    return true\n  }\n\n  /**\n   * @param {TrickleDagNode} parent\n   */\n  _addNextNodeToParent (parent) {\n    this.parent = parent\n\n    // find site for new node\n    const nextNode = {\n      children: [],\n      depth: parent.depth + 1,\n      parent,\n      maxDepth: this.maxDepth,\n      maxChildren: Math.floor(parent.children.length / this.layerRepeat) * this.layerRepeat\n    }\n\n    // @ts-ignore\n    parent.children.push(nextNode)\n\n    this.currentDepth = nextNode.depth\n    this.node = nextNode\n  }\n\n  /**\n   *\n   * @param {InProgressImportResult[]} layer\n   */\n  append (layer) {\n    this.node.data = layer\n  }\n\n  /**\n   * @param {Reducer} reduce\n   */\n  reduce (reduce) {\n    return this._reduce(this.root, reduce)\n  }\n\n  /**\n   * @param {TrickleDagNode} node\n   * @param {Reducer} reduce\n   * @returns {Promise<InProgressImportResult>}\n   */\n  async _reduce (node, reduce) {\n    /** @type {InProgressImportResult[]} */\n    let children = []\n\n    if (node.children.length) {\n      children = await Promise.all(\n        node.children\n          // @ts-ignore\n          .filter(child => child.data)\n          // @ts-ignore\n          .map(child => this._reduce(child, reduce))\n      )\n    }\n\n    return reduce((node.data || []).concat(children))\n  }\n\n  /**\n   * @param {TrickleDagNode} node\n   * @param {number} depth\n   * @returns {TrickleDagNode | undefined}\n   */\n  _findParent (node, depth) {\n    const parent = node.parent\n\n    if (!parent || parent.depth === 0) {\n      return\n    }\n\n    if (parent.children.length === parent.maxChildren || !parent.maxChildren) {\n      // this layer is full, may be able to traverse to a different branch\n      return this._findParent(parent, depth)\n    }\n\n    return parent\n  }\n}\n\nclass Root extends SubTree {\n  /**\n   * @param {number} layerRepeat\n   */\n  constructor (layerRepeat) {\n    super(0, layerRepeat)\n\n    this.root.depth = 0\n    this.currentDepth = 1\n  }\n\n  /**\n   * @param {InProgressImportResult} child\n   */\n  addChild (child) {\n    this.root.children.push(child)\n  }\n\n  /**\n   * @param {Reducer} reduce\n   */\n  reduce (reduce) {\n    return reduce((this.root.data || []).concat(this.root.children))\n  }\n}\n","'use strict'\n\nconst { UnixFS } = require('ipfs-unixfs')\nconst persist = require('../../utils/persist')\nconst {\n  DAGNode\n} = require('ipld-dag-pb')\n\n/**\n * @typedef {import('../../types').BufferImporter} BufferImporter\n */\n\n/**\n * @type {BufferImporter}\n */\nasync function * bufferImporter (file, block, options) {\n  for await (let buffer of file.content) {\n    yield async () => {\n      options.progress(buffer.length, file.path)\n      let unixfs\n\n      /** @type {import('../../types').PersistOptions} */\n      const opts = {\n        codec: 'dag-pb',\n        cidVersion: options.cidVersion,\n        hashAlg: options.hashAlg,\n        onlyHash: options.onlyHash\n      }\n\n      if (options.rawLeaves) {\n        opts.codec = 'raw'\n        opts.cidVersion = 1\n      } else {\n        unixfs = new UnixFS({\n          type: options.leafType,\n          data: buffer,\n          mtime: file.mtime,\n          mode: file.mode\n        })\n\n        buffer = new DAGNode(unixfs.marshal()).serialize()\n      }\n\n      return {\n        cid: await persist(buffer, block, opts),\n        unixfs,\n        size: buffer.length\n      }\n    }\n  }\n}\n\nmodule.exports = bufferImporter\n","'use strict'\n\n// @ts-ignore\nconst BufferList = require('bl/BufferList')\n// @ts-ignore\nconst { create } = require('rabin-wasm')\nconst errcode = require('err-code')\n\n/**\n * @typedef {object} RabinOptions\n * @property {number} min\n * @property {number} max\n * @property {number} bits\n * @property {number} window\n * @property {number} polynomial\n */\n\n/**\n * @type {import('../types').Chunker}\n */\nmodule.exports = async function * rabinChunker (source, options) {\n  let min, max, avg\n\n  if (options.minChunkSize && options.maxChunkSize && options.avgChunkSize) {\n    avg = options.avgChunkSize\n    min = options.minChunkSize\n    max = options.maxChunkSize\n  } else if (!options.avgChunkSize) {\n    throw errcode(new Error('please specify an average chunk size'), 'ERR_INVALID_AVG_CHUNK_SIZE')\n  } else {\n    avg = options.avgChunkSize\n    min = avg / 3\n    max = avg + (avg / 2)\n  }\n\n  // validate min/max/avg in the same way as go\n  if (min < 16) {\n    throw errcode(new Error('rabin min must be greater than 16'), 'ERR_INVALID_MIN_CHUNK_SIZE')\n  }\n\n  if (max < min) {\n    max = min\n  }\n\n  if (avg < min) {\n    avg = min\n  }\n\n  const sizepow = Math.floor(Math.log2(avg))\n\n  for await (const chunk of rabin(source, {\n    min: min,\n    max: max,\n    bits: sizepow,\n    window: options.window,\n    polynomial: options.polynomial\n  })) {\n    yield chunk\n  }\n}\n\n/**\n * @param {AsyncIterable<Uint8Array>} source\n * @param {RabinOptions} options\n */\nasync function * rabin (source, options) {\n  const r = await create(options.bits, options.min, options.max, options.window)\n  const buffers = new BufferList()\n\n  for await (const chunk of source) {\n    buffers.append(chunk)\n\n    const sizes = r.fingerprint(chunk)\n\n    for (let i = 0; i < sizes.length; i++) {\n      const size = sizes[i]\n      const buf = buffers.slice(0, size)\n      buffers.consume(size)\n\n      yield buf\n    }\n  }\n\n  if (buffers.length) {\n    yield buffers.slice(0)\n  }\n}\n","'use strict'\n\nconst { Buffer } = require('buffer')\nconst symbol = Symbol.for('BufferList')\n\nfunction BufferList (buf) {\n  if (!(this instanceof BufferList)) {\n    return new BufferList(buf)\n  }\n\n  BufferList._init.call(this, buf)\n}\n\nBufferList._init = function _init (buf) {\n  Object.defineProperty(this, symbol, { value: true })\n\n  this._bufs = []\n  this.length = 0\n\n  if (buf) {\n    this.append(buf)\n  }\n}\n\nBufferList.prototype._new = function _new (buf) {\n  return new BufferList(buf)\n}\n\nBufferList.prototype._offset = function _offset (offset) {\n  if (offset === 0) {\n    return [0, 0]\n  }\n\n  let tot = 0\n\n  for (let i = 0; i < this._bufs.length; i++) {\n    const _t = tot + this._bufs[i].length\n    if (offset < _t || i === this._bufs.length - 1) {\n      return [i, offset - tot]\n    }\n    tot = _t\n  }\n}\n\nBufferList.prototype._reverseOffset = function (blOffset) {\n  const bufferId = blOffset[0]\n  let offset = blOffset[1]\n\n  for (let i = 0; i < bufferId; i++) {\n    offset += this._bufs[i].length\n  }\n\n  return offset\n}\n\nBufferList.prototype.get = function get (index) {\n  if (index > this.length || index < 0) {\n    return undefined\n  }\n\n  const offset = this._offset(index)\n\n  return this._bufs[offset[0]][offset[1]]\n}\n\nBufferList.prototype.slice = function slice (start, end) {\n  if (typeof start === 'number' && start < 0) {\n    start += this.length\n  }\n\n  if (typeof end === 'number' && end < 0) {\n    end += this.length\n  }\n\n  return this.copy(null, 0, start, end)\n}\n\nBufferList.prototype.copy = function copy (dst, dstStart, srcStart, srcEnd) {\n  if (typeof srcStart !== 'number' || srcStart < 0) {\n    srcStart = 0\n  }\n\n  if (typeof srcEnd !== 'number' || srcEnd > this.length) {\n    srcEnd = this.length\n  }\n\n  if (srcStart >= this.length) {\n    return dst || Buffer.alloc(0)\n  }\n\n  if (srcEnd <= 0) {\n    return dst || Buffer.alloc(0)\n  }\n\n  const copy = !!dst\n  const off = this._offset(srcStart)\n  const len = srcEnd - srcStart\n  let bytes = len\n  let bufoff = (copy && dstStart) || 0\n  let start = off[1]\n\n  // copy/slice everything\n  if (srcStart === 0 && srcEnd === this.length) {\n    if (!copy) {\n      // slice, but full concat if multiple buffers\n      return this._bufs.length === 1\n        ? this._bufs[0]\n        : Buffer.concat(this._bufs, this.length)\n    }\n\n    // copy, need to copy individual buffers\n    for (let i = 0; i < this._bufs.length; i++) {\n      this._bufs[i].copy(dst, bufoff)\n      bufoff += this._bufs[i].length\n    }\n\n    return dst\n  }\n\n  // easy, cheap case where it's a subset of one of the buffers\n  if (bytes <= this._bufs[off[0]].length - start) {\n    return copy\n      ? this._bufs[off[0]].copy(dst, dstStart, start, start + bytes)\n      : this._bufs[off[0]].slice(start, start + bytes)\n  }\n\n  if (!copy) {\n    // a slice, we need something to copy in to\n    dst = Buffer.allocUnsafe(len)\n  }\n\n  for (let i = off[0]; i < this._bufs.length; i++) {\n    const l = this._bufs[i].length - start\n\n    if (bytes > l) {\n      this._bufs[i].copy(dst, bufoff, start)\n      bufoff += l\n    } else {\n      this._bufs[i].copy(dst, bufoff, start, start + bytes)\n      bufoff += l\n      break\n    }\n\n    bytes -= l\n\n    if (start) {\n      start = 0\n    }\n  }\n\n  // safeguard so that we don't return uninitialized memory\n  if (dst.length > bufoff) return dst.slice(0, bufoff)\n\n  return dst\n}\n\nBufferList.prototype.shallowSlice = function shallowSlice (start, end) {\n  start = start || 0\n  end = typeof end !== 'number' ? this.length : end\n\n  if (start < 0) {\n    start += this.length\n  }\n\n  if (end < 0) {\n    end += this.length\n  }\n\n  if (start === end) {\n    return this._new()\n  }\n\n  const startOffset = this._offset(start)\n  const endOffset = this._offset(end)\n  const buffers = this._bufs.slice(startOffset[0], endOffset[0] + 1)\n\n  if (endOffset[1] === 0) {\n    buffers.pop()\n  } else {\n    buffers[buffers.length - 1] = buffers[buffers.length - 1].slice(0, endOffset[1])\n  }\n\n  if (startOffset[1] !== 0) {\n    buffers[0] = buffers[0].slice(startOffset[1])\n  }\n\n  return this._new(buffers)\n}\n\nBufferList.prototype.toString = function toString (encoding, start, end) {\n  return this.slice(start, end).toString(encoding)\n}\n\nBufferList.prototype.consume = function consume (bytes) {\n  // first, normalize the argument, in accordance with how Buffer does it\n  bytes = Math.trunc(bytes)\n  // do nothing if not a positive number\n  if (Number.isNaN(bytes) || bytes <= 0) return this\n\n  while (this._bufs.length) {\n    if (bytes >= this._bufs[0].length) {\n      bytes -= this._bufs[0].length\n      this.length -= this._bufs[0].length\n      this._bufs.shift()\n    } else {\n      this._bufs[0] = this._bufs[0].slice(bytes)\n      this.length -= bytes\n      break\n    }\n  }\n\n  return this\n}\n\nBufferList.prototype.duplicate = function duplicate () {\n  const copy = this._new()\n\n  for (let i = 0; i < this._bufs.length; i++) {\n    copy.append(this._bufs[i])\n  }\n\n  return copy\n}\n\nBufferList.prototype.append = function append (buf) {\n  if (buf == null) {\n    return this\n  }\n\n  if (buf.buffer) {\n    // append a view of the underlying ArrayBuffer\n    this._appendBuffer(Buffer.from(buf.buffer, buf.byteOffset, buf.byteLength))\n  } else if (Array.isArray(buf)) {\n    for (let i = 0; i < buf.length; i++) {\n      this.append(buf[i])\n    }\n  } else if (this._isBufferList(buf)) {\n    // unwrap argument into individual BufferLists\n    for (let i = 0; i < buf._bufs.length; i++) {\n      this.append(buf._bufs[i])\n    }\n  } else {\n    // coerce number arguments to strings, since Buffer(number) does\n    // uninitialized memory allocation\n    if (typeof buf === 'number') {\n      buf = buf.toString()\n    }\n\n    this._appendBuffer(Buffer.from(buf))\n  }\n\n  return this\n}\n\nBufferList.prototype._appendBuffer = function appendBuffer (buf) {\n  this._bufs.push(buf)\n  this.length += buf.length\n}\n\nBufferList.prototype.indexOf = function (search, offset, encoding) {\n  if (encoding === undefined && typeof offset === 'string') {\n    encoding = offset\n    offset = undefined\n  }\n\n  if (typeof search === 'function' || Array.isArray(search)) {\n    throw new TypeError('The \"value\" argument must be one of type string, Buffer, BufferList, or Uint8Array.')\n  } else if (typeof search === 'number') {\n    search = Buffer.from([search])\n  } else if (typeof search === 'string') {\n    search = Buffer.from(search, encoding)\n  } else if (this._isBufferList(search)) {\n    search = search.slice()\n  } else if (Array.isArray(search.buffer)) {\n    search = Buffer.from(search.buffer, search.byteOffset, search.byteLength)\n  } else if (!Buffer.isBuffer(search)) {\n    search = Buffer.from(search)\n  }\n\n  offset = Number(offset || 0)\n\n  if (isNaN(offset)) {\n    offset = 0\n  }\n\n  if (offset < 0) {\n    offset = this.length + offset\n  }\n\n  if (offset < 0) {\n    offset = 0\n  }\n\n  if (search.length === 0) {\n    return offset > this.length ? this.length : offset\n  }\n\n  const blOffset = this._offset(offset)\n  let blIndex = blOffset[0] // index of which internal buffer we're working on\n  let buffOffset = blOffset[1] // offset of the internal buffer we're working on\n\n  // scan over each buffer\n  for (; blIndex < this._bufs.length; blIndex++) {\n    const buff = this._bufs[blIndex]\n\n    while (buffOffset < buff.length) {\n      const availableWindow = buff.length - buffOffset\n\n      if (availableWindow >= search.length) {\n        const nativeSearchResult = buff.indexOf(search, buffOffset)\n\n        if (nativeSearchResult !== -1) {\n          return this._reverseOffset([blIndex, nativeSearchResult])\n        }\n\n        buffOffset = buff.length - search.length + 1 // end of native search window\n      } else {\n        const revOffset = this._reverseOffset([blIndex, buffOffset])\n\n        if (this._match(revOffset, search)) {\n          return revOffset\n        }\n\n        buffOffset++\n      }\n    }\n\n    buffOffset = 0\n  }\n\n  return -1\n}\n\nBufferList.prototype._match = function (offset, search) {\n  if (this.length - offset < search.length) {\n    return false\n  }\n\n  for (let searchOffset = 0; searchOffset < search.length; searchOffset++) {\n    if (this.get(offset + searchOffset) !== search[searchOffset]) {\n      return false\n    }\n  }\n  return true\n}\n\n;(function () {\n  const methods = {\n    readDoubleBE: 8,\n    readDoubleLE: 8,\n    readFloatBE: 4,\n    readFloatLE: 4,\n    readInt32BE: 4,\n    readInt32LE: 4,\n    readUInt32BE: 4,\n    readUInt32LE: 4,\n    readInt16BE: 2,\n    readInt16LE: 2,\n    readUInt16BE: 2,\n    readUInt16LE: 2,\n    readInt8: 1,\n    readUInt8: 1,\n    readIntBE: null,\n    readIntLE: null,\n    readUIntBE: null,\n    readUIntLE: null\n  }\n\n  for (const m in methods) {\n    (function (m) {\n      if (methods[m] === null) {\n        BufferList.prototype[m] = function (offset, byteLength) {\n          return this.slice(offset, offset + byteLength)[m](0, byteLength)\n        }\n      } else {\n        BufferList.prototype[m] = function (offset = 0) {\n          return this.slice(offset, offset + methods[m])[m](0)\n        }\n      }\n    }(m))\n  }\n}())\n\n// Used internally by the class and also as an indicator of this object being\n// a `BufferList`. It's not possible to use `instanceof BufferList` in a browser\n// environment because there could be multiple different copies of the\n// BufferList class and some `BufferList`s might be `BufferList`s.\nBufferList.prototype._isBufferList = function _isBufferList (b) {\n  return b instanceof BufferList || BufferList.isBufferList(b)\n}\n\nBufferList.isBufferList = function isBufferList (b) {\n  return b != null && b[symbol]\n}\n\nmodule.exports = BufferList\n","const Rabin = require('./rabin')\nconst getRabin = require('../dist/rabin-wasm.node.js')\n\nconst create = async (avg, min, max, windowSize, polynomial) => {\n    const compiled = await getRabin()\n    return new Rabin(compiled, avg, min, max, windowSize, polynomial)\n}\n\nmodule.exports = {\n    Rabin,\n    create\n}\n","/**\n * Rabin fingerprinting\n *\n * @class Rabin\n */\nclass Rabin {\n    /**\n     * Creates an instance of Rabin.\n     * @param { import(\"./../dist/rabin-wasm\") } asModule\n     * @param {number} [bits=12]\n     * @param {number} [min=8 * 1024]\n     * @param {number} [max=32 * 1024]\n     * @param {number} polynomial\n     * @memberof Rabin\n     */\n    constructor(asModule, bits = 12, min = 8 * 1024, max = 32 * 1024, windowSize = 64, polynomial) {\n        this.bits = bits\n        this.min = min\n        this.max = max\n        this.asModule = asModule\n        this.rabin = new asModule.Rabin(bits, min, max, windowSize, polynomial)\n        this.polynomial = polynomial\n    }\n\n    /**\n     * Fingerprints the buffer\n     *\n     * @param {Uint8Array} buf\n     * @returns {Array<number>}\n     * @memberof Rabin\n     */\n    fingerprint(buf) {\n        const {\n            __retain,\n            __release,\n            __allocArray,\n            __getInt32Array,\n            Int32Array_ID,\n            Uint8Array_ID\n        } = this.asModule\n\n        const lengths = new Int32Array(Math.ceil(buf.length/this.min))\n        const lengthsPtr = __retain(__allocArray(Int32Array_ID, lengths))\n        const pointer = __retain(__allocArray(Uint8Array_ID, buf))\n\n        const out = this.rabin.fingerprint(pointer, lengthsPtr)\n        const processed = __getInt32Array(out)\n\n        __release(pointer)\n        __release(lengthsPtr)\n\n        const end = processed.indexOf(0);\n        return end >= 0 ? processed.subarray(0, end) : processed;\n    }\n}\n\nmodule.exports = Rabin","\nconst { instantiate } = require(\"@assemblyscript/loader\");\n\nloadWebAssembly.supported = typeof WebAssembly !== 'undefined'\n\nfunction loadWebAssembly (imp = {}) {\n  if (!loadWebAssembly.supported) return null\n  \n  var wasm = new Uint8Array([0,97,115,109,1,0,0,0,1,78,14,96,2,127,126,0,96,1,127,1,126,96,2,127,127,0,96,1,127,1,127,96,1,127,0,96,2,127,127,1,127,96,3,127,127,127,1,127,96,0,0,96,3,127,127,127,0,96,0,1,127,96,4,127,127,127,127,0,96,5,127,127,127,127,127,1,127,96,1,126,1,127,96,2,126,126,1,126,2,13,1,3,101,110,118,5,97,98,111,114,116,0,10,3,54,53,2,2,8,9,3,5,2,8,6,5,3,4,2,6,9,12,13,2,5,11,3,2,3,2,3,2,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,6,7,7,4,4,5,3,1,0,1,6,47,9,127,1,65,0,11,127,1,65,0,11,127,0,65,3,11,127,0,65,4,11,127,1,65,0,11,127,1,65,0,11,127,1,65,0,11,127,0,65,240,2,11,127,0,65,6,11,7,240,5,41,6,109,101,109,111,114,121,2,0,7,95,95,97,108,108,111,99,0,10,8,95,95,114,101,116,97,105,110,0,11,9,95,95,114,101,108,101,97,115,101,0,12,9,95,95,99,111,108,108,101,99,116,0,51,11,95,95,114,116,116,105,95,98,97,115,101,3,7,13,73,110,116,51,50,65,114,114,97,121,95,73,68,3,2,13,85,105,110,116,56,65,114,114,97,121,95,73,68,3,3,6,100,101,103,114,101,101,0,16,3,109,111,100,0,17,5,82,97,98,105,110,3,8,16,82,97,98,105,110,35,103,101,116,58,119,105,110,100,111,119,0,21,16,82,97,98,105,110,35,115,101,116,58,119,105,110,100,111,119,0,22,21,82,97,98,105,110,35,103,101,116,58,119,105,110,100,111,119,95,115,105,122,101,0,23,21,82,97,98,105,110,35,115,101,116,58,119,105,110,100,111,119,95,115,105,122,101,0,24,14,82,97,98,105,110,35,103,101,116,58,119,112,111,115,0,25,14,82,97,98,105,110,35,115,101,116,58,119,112,111,115,0,26,15,82,97,98,105,110,35,103,101,116,58,99,111,117,110,116,0,27,15,82,97,98,105,110,35,115,101,116,58,99,111,117,110,116,0,28,13,82,97,98,105,110,35,103,101,116,58,112,111,115,0,29,13,82,97,98,105,110,35,115,101,116,58,112,111,115,0,30,15,82,97,98,105,110,35,103,101,116,58,115,116,97,114,116,0,31,15,82,97,98,105,110,35,115,101,116,58,115,116,97,114,116,0,32,16,82,97,98,105,110,35,103,101,116,58,100,105,103,101,115,116,0,33,16,82,97,98,105,110,35,115,101,116,58,100,105,103,101,115,116,0,34,21,82,97,98,105,110,35,103,101,116,58,99,104,117,110,107,95,115,116,97,114,116,0,35,21,82,97,98,105,110,35,115,101,116,58,99,104,117,110,107,95,115,116,97,114,116,0,36,22,82,97,98,105,110,35,103,101,116,58,99,104,117,110,107,95,108,101,110,103,116,104,0,37,22,82,97,98,105,110,35,115,101,116,58,99,104,117,110,107,95,108,101,110,103,116,104,0,38,31,82,97,98,105,110,35,103,101,116,58,99,104,117,110,107,95,99,117,116,95,102,105,110,103,101,114,112,114,105,110,116,0,39,31,82,97,98,105,110,35,115,101,116,58,99,104,117,110,107,95,99,117,116,95,102,105,110,103,101,114,112,114,105,110,116,0,40,20,82,97,98,105,110,35,103,101,116,58,112,111,108,121,110,111,109,105,97,108,0,41,20,82,97,98,105,110,35,115,101,116,58,112,111,108,121,110,111,109,105,97,108,0,42,17,82,97,98,105,110,35,103,101,116,58,109,105,110,115,105,122,101,0,43,17,82,97,98,105,110,35,115,101,116,58,109,105,110,115,105,122,101,0,44,17,82,97,98,105,110,35,103,101,116,58,109,97,120,115,105,122,101,0,45,17,82,97,98,105,110,35,115,101,116,58,109,97,120,115,105,122,101,0,46,14,82,97,98,105,110,35,103,101,116,58,109,97,115,107,0,47,14,82,97,98,105,110,35,115,101,116,58,109,97,115,107,0,48,17,82,97,98,105,110,35,99,111,110,115,116,114,117,99,116,111,114,0,20,17,82,97,98,105,110,35,102,105,110,103,101,114,112,114,105,110,116,0,49,8,1,50,10,165,31,53,199,1,1,4,127,32,1,40,2,0,65,124,113,34,2,65,128,2,73,4,127,32,2,65,4,118,33,4,65,0,5,32,2,65,31,32,2,103,107,34,3,65,4,107,118,65,16,115,33,4,32,3,65,7,107,11,33,3,32,1,40,2,20,33,2,32,1,40,2,16,34,5,4,64,32,5,32,2,54,2,20,11,32,2,4,64,32,2,32,5,54,2,16,11,32,1,32,0,32,4,32,3,65,4,116,106,65,2,116,106,40,2,96,70,4,64,32,0,32,4,32,3,65,4,116,106,65,2,116,106,32,2,54,2,96,32,2,69,4,64,32,0,32,3,65,2,116,106,32,0,32,3,65,2,116,106,40,2,4,65,1,32,4,116,65,127,115,113,34,1,54,2,4,32,1,69,4,64,32,0,32,0,40,2,0,65,1,32,3,116,65,127,115,113,54,2,0,11,11,11,11,226,2,1,6,127,32,1,40,2,0,33,3,32,1,65,16,106,32,1,40,2,0,65,124,113,106,34,4,40,2,0,34,5,65,1,113,4,64,32,3,65,124,113,65,16,106,32,5,65,124,113,106,34,2,65,240,255,255,255,3,73,4,64,32,0,32,4,16,1,32,1,32,2,32,3,65,3,113,114,34,3,54,2,0,32,1,65,16,106,32,1,40,2,0,65,124,113,106,34,4,40,2,0,33,5,11,11,32,3,65,2,113,4,64,32,1,65,4,107,40,2,0,34,2,40,2,0,34,6,65,124,113,65,16,106,32,3,65,124,113,106,34,7,65,240,255,255,255,3,73,4,64,32,0,32,2,16,1,32,2,32,7,32,6,65,3,113,114,34,3,54,2,0,32,2,33,1,11,11,32,4,32,5,65,2,114,54,2,0,32,4,65,4,107,32,1,54,2,0,32,0,32,3,65,124,113,34,2,65,128,2,73,4,127,32,2,65,4,118,33,4,65,0,5,32,2,65,31,32,2,103,107,34,2,65,4,107,118,65,16,115,33,4,32,2,65,7,107,11,34,3,65,4,116,32,4,106,65,2,116,106,40,2,96,33,2,32,1,65,0,54,2,16,32,1,32,2,54,2,20,32,2,4,64,32,2,32,1,54,2,16,11,32,0,32,4,32,3,65,4,116,106,65,2,116,106,32,1,54,2,96,32,0,32,0,40,2,0,65,1,32,3,116,114,54,2,0,32,0,32,3,65,2,116,106,32,0,32,3,65,2,116,106,40,2,4,65,1,32,4,116,114,54,2,4,11,119,1,1,127,32,2,2,127,32,0,40,2,160,12,34,2,4,64,32,2,32,1,65,16,107,70,4,64,32,2,40,2,0,33,3,32,1,65,16,107,33,1,11,11,32,1,11,107,34,2,65,48,73,4,64,15,11,32,1,32,3,65,2,113,32,2,65,32,107,65,1,114,114,54,2,0,32,1,65,0,54,2,16,32,1,65,0,54,2,20,32,1,32,2,106,65,16,107,34,2,65,2,54,2,0,32,0,32,2,54,2,160,12,32,0,32,1,16,2,11,155,1,1,3,127,35,0,34,0,69,4,64,65,1,63,0,34,0,74,4,127,65,1,32,0,107,64,0,65,0,72,5,65,0,11,4,64,0,11,65,176,3,34,0,65,0,54,2,0,65,208,15,65,0,54,2,0,3,64,32,1,65,23,73,4,64,32,1,65,2,116,65,176,3,106,65,0,54,2,4,65,0,33,2,3,64,32,2,65,16,73,4,64,32,1,65,4,116,32,2,106,65,2,116,65,176,3,106,65,0,54,2,96,32,2,65,1,106,33,2,12,1,11,11,32,1,65,1,106,33,1,12,1,11,11,65,176,3,65,224,15,63,0,65,16,116,16,3,65,176,3,36,0,11,32,0,11,45,0,32,0,65,240,255,255,255,3,79,4,64,65,32,65,224,0,65,201,3,65,29,16,0,0,11,32,0,65,15,106,65,112,113,34,0,65,16,32,0,65,16,75,27,11,169,1,1,1,127,32,0,32,1,65,128,2,73,4,127,32,1,65,4,118,33,1,65,0,5,32,1,65,248,255,255,255,1,73,4,64,32,1,65,1,65,27,32,1,103,107,116,106,65,1,107,33,1,11,32,1,65,31,32,1,103,107,34,2,65,4,107,118,65,16,115,33,1,32,2,65,7,107,11,34,2,65,2,116,106,40,2,4,65,127,32,1,116,113,34,1,4,127,32,0,32,1,104,32,2,65,4,116,106,65,2,116,106,40,2,96,5,32,0,40,2,0,65,127,32,2,65,1,106,116,113,34,1,4,127,32,0,32,0,32,1,104,34,0,65,2,116,106,40,2,4,104,32,0,65,4,116,106,65,2,116,106,40,2,96,5,65,0,11,11,11,111,1,1,127,63,0,34,2,32,1,65,248,255,255,255,1,73,4,127,32,1,65,1,65,27,32,1,103,107,116,65,1,107,106,5,32,1,11,65,16,32,0,40,2,160,12,32,2,65,16,116,65,16,107,71,116,106,65,255,255,3,106,65,128,128,124,113,65,16,118,34,1,32,2,32,1,74,27,64,0,65,0,72,4,64,32,1,64,0,65,0,72,4,64,0,11,11,32,0,32,2,65,16,116,63,0,65,16,116,16,3,11,113,1,2,127,32,1,40,2,0,34,3,65,124,113,32,2,107,34,4,65,32,79,4,64,32,1,32,2,32,3,65,2,113,114,54,2,0,32,2,32,1,65,16,106,106,34,1,32,4,65,16,107,65,1,114,54,2,0,32,0,32,1,16,2,5,32,1,32,3,65,126,113,54,2,0,32,1,65,16,106,32,1,40,2,0,65,124,113,106,32,1,65,16,106,32,1,40,2,0,65,124,113,106,40,2,0,65,125,113,54,2,0,11,11,91,1,2,127,32,0,32,1,16,5,34,4,16,6,34,3,69,4,64,65,1,36,1,65,0,36,1,32,0,32,4,16,6,34,3,69,4,64,32,0,32,4,16,7,32,0,32,4,16,6,33,3,11,11,32,3,65,0,54,2,4,32,3,32,2,54,2,8,32,3,32,1,54,2,12,32,0,32,3,16,1,32,0,32,3,32,4,16,8,32,3,11,13,0,16,4,32,0,32,1,16,9,65,16,106,11,33,1,1,127,32,0,65,172,3,75,4,64,32,0,65,16,107,34,1,32,1,40,2,4,65,1,106,54,2,4,11,32,0,11,18,0,32,0,65,172,3,75,4,64,32,0,65,16,107,16,52,11,11,140,3,1,1,127,2,64,32,1,69,13,0,32,0,65,0,58,0,0,32,0,32,1,106,65,1,107,65,0,58,0,0,32,1,65,2,77,13,0,32,0,65,1,106,65,0,58,0,0,32,0,65,2,106,65,0,58,0,0,32,0,32,1,106,34,2,65,2,107,65,0,58,0,0,32,2,65,3,107,65,0,58,0,0,32,1,65,6,77,13,0,32,0,65,3,106,65,0,58,0,0,32,0,32,1,106,65,4,107,65,0,58,0,0,32,1,65,8,77,13,0,32,1,65,0,32,0,107,65,3,113,34,1,107,33,2,32,0,32,1,106,34,0,65,0,54,2,0,32,0,32,2,65,124,113,34,1,106,65,4,107,65,0,54,2,0,32,1,65,8,77,13,0,32,0,65,4,106,65,0,54,2,0,32,0,65,8,106,65,0,54,2,0,32,0,32,1,106,34,2,65,12,107,65,0,54,2,0,32,2,65,8,107,65,0,54,2,0,32,1,65,24,77,13,0,32,0,65,12,106,65,0,54,2,0,32,0,65,16,106,65,0,54,2,0,32,0,65,20,106,65,0,54,2,0,32,0,65,24,106,65,0,54,2,0,32,0,32,1,106,34,2,65,28,107,65,0,54,2,0,32,2,65,24,107,65,0,54,2,0,32,2,65,20,107,65,0,54,2,0,32,2,65,16,107,65,0,54,2,0,32,0,32,0,65,4,113,65,24,106,34,2,106,33,0,32,1,32,2,107,33,1,3,64,32,1,65,32,79,4,64,32,0,66,0,55,3,0,32,0,65,8,106,66,0,55,3,0,32,0,65,16,106,66,0,55,3,0,32,0,65,24,106,66,0,55,3,0,32,1,65,32,107,33,1,32,0,65,32,106,33,0,12,1,11,11,11,11,178,1,1,3,127,32,1,65,240,255,255,255,3,32,2,118,75,4,64,65,144,1,65,192,1,65,23,65,56,16,0,0,11,32,1,32,2,116,34,3,65,0,16,10,34,2,32,3,16,13,32,0,69,4,64,65,12,65,2,16,10,34,0,65,172,3,75,4,64,32,0,65,16,107,34,1,32,1,40,2,4,65,1,106,54,2,4,11,11,32,0,65,0,54,2,0,32,0,65,0,54,2,4,32,0,65,0,54,2,8,32,2,34,1,32,0,40,2,0,34,4,71,4,64,32,1,65,172,3,75,4,64,32,1,65,16,107,34,5,32,5,40,2,4,65,1,106,54,2,4,11,32,4,16,12,11,32,0,32,1,54,2,0,32,0,32,2,54,2,4,32,0,32,3,54,2,8,32,0,11,46,1,2,127,65,12,65,5,16,10,34,0,65,172,3,75,4,64,32,0,65,16,107,34,1,32,1,40,2,4,65,1,106,54,2,4,11,32,0,65,128,2,65,3,16,14,11,9,0,65,63,32,0,121,167,107,11,49,1,2,127,65,63,32,1,121,167,107,33,2,3,64,65,63,32,0,121,167,107,32,2,107,34,3,65,0,78,4,64,32,0,32,1,32,3,172,134,133,33,0,12,1,11,11,32,0,11,40,0,32,1,32,0,40,2,8,79,4,64,65,128,2,65,192,2,65,163,1,65,44,16,0,0,11,32,1,32,0,40,2,4,106,65,0,58,0,0,11,38,0,32,1,32,0,40,2,8,79,4,64,65,128,2,65,192,2,65,152,1,65,44,16,0,0,11,32,1,32,0,40,2,4,106,45,0,0,11,254,5,2,1,127,4,126,32,0,69,4,64,65,232,0,65,6,16,10,34,0,65,172,3,75,4,64,32,0,65,16,107,34,5,32,5,40,2,4,65,1,106,54,2,4,11,11,32,0,65,0,54,2,0,32,0,65,0,54,2,4,32,0,65,0,54,2,8,32,0,66,0,55,3,16,32,0,66,0,55,3,24,32,0,66,0,55,3,32,32,0,66,0,55,3,40,32,0,66,0,55,3,48,32,0,66,0,55,3,56,32,0,66,0,55,3,64,32,0,66,0,55,3,72,32,0,66,0,55,3,80,32,0,66,0,55,3,88,32,0,66,0,55,3,96,32,0,32,2,173,55,3,80,32,0,32,3,173,55,3,88,65,12,65,4,16,10,34,2,65,172,3,75,4,64,32,2,65,16,107,34,3,32,3,40,2,4,65,1,106,54,2,4,11,32,2,32,4,65,0,16,14,33,2,32,0,40,2,0,16,12,32,0,32,2,54,2,0,32,0,32,4,54,2,4,32,0,66,1,32,1,173,134,66,1,125,55,3,96,32,0,66,243,130,183,218,216,230,232,30,55,3,72,35,4,69,4,64,65,0,33,2,3,64,32,2,65,128,2,72,4,64,32,2,65,255,1,113,173,33,6,32,0,41,3,72,34,7,33,8,65,63,32,7,121,167,107,33,1,3,64,65,63,32,6,121,167,107,32,1,107,34,3,65,0,78,4,64,32,6,32,8,32,3,172,134,133,33,6,12,1,11,11,65,0,33,4,3,64,32,4,32,0,40,2,4,65,1,107,72,4,64,32,6,66,8,134,33,6,32,0,41,3,72,34,7,33,8,65,63,32,7,121,167,107,33,1,3,64,65,63,32,6,121,167,107,32,1,107,34,3,65,0,78,4,64,32,6,32,8,32,3,172,134,133,33,6,12,1,11,11,32,4,65,1,106,33,4,12,1,11,11,35,6,40,2,4,32,2,65,3,116,106,32,6,55,3,0,32,2,65,1,106,33,2,12,1,11,11,65,63,32,0,41,3,72,121,167,107,172,33,7,65,0,33,2,3,64,32,2,65,128,2,72,4,64,35,5,33,1,32,2,172,32,7,134,34,8,33,6,65,63,32,0,41,3,72,34,9,121,167,107,33,3,3,64,65,63,32,6,121,167,107,32,3,107,34,4,65,0,78,4,64,32,6,32,9,32,4,172,134,133,33,6,12,1,11,11,32,1,40,2,4,32,2,65,3,116,106,32,6,32,8,132,55,3,0,32,2,65,1,106,33,2,12,1,11,11,65,1,36,4,11,32,0,66,0,55,3,24,32,0,66,0,55,3,32,65,0,33,2,3,64,32,2,32,0,40,2,4,72,4,64,32,0,40,2,0,32,2,16,18,32,2,65,1,106,33,2,12,1,11,11,32,0,66,0,55,3,40,32,0,65,0,54,2,8,32,0,66,0,55,3,16,32,0,66,0,55,3,40,32,0,40,2,0,32,0,40,2,8,16,19,33,1,32,0,40,2,8,32,0,40,2,0,40,2,4,106,65,1,58,0,0,32,0,32,0,41,3,40,35,6,40,2,4,32,1,65,3,116,106,41,3,0,133,55,3,40,32,0,32,0,40,2,8,65,1,106,32,0,40,2,4,111,54,2,8,32,0,35,5,40,2,4,32,0,41,3,40,34,6,66,45,136,167,65,3,116,106,41,3,0,32,6,66,8,134,66,1,132,133,55,3,40,32,0,11,38,1,1,127,32,0,40,2,0,34,0,65,172,3,75,4,64,32,0,65,16,107,34,1,32,1,40,2,4,65,1,106,54,2,4,11,32,0,11,55,1,2,127,32,1,32,0,40,2,0,34,2,71,4,64,32,1,65,172,3,75,4,64,32,1,65,16,107,34,3,32,3,40,2,4,65,1,106,54,2,4,11,32,2,16,12,11,32,0,32,1,54,2,0,11,7,0,32,0,40,2,4,11,9,0,32,0,32,1,54,2,4,11,7,0,32,0,40,2,8,11,9,0,32,0,32,1,54,2,8,11,7,0,32,0,41,3,16,11,9,0,32,0,32,1,55,3,16,11,7,0,32,0,41,3,24,11,9,0,32,0,32,1,55,3,24,11,7,0,32,0,41,3,32,11,9,0,32,0,32,1,55,3,32,11,7,0,32,0,41,3,40,11,9,0,32,0,32,1,55,3,40,11,7,0,32,0,41,3,48,11,9,0,32,0,32,1,55,3,48,11,7,0,32,0,41,3,56,11,9,0,32,0,32,1,55,3,56,11,7,0,32,0,41,3,64,11,9,0,32,0,32,1,55,3,64,11,7,0,32,0,41,3,72,11,9,0,32,0,32,1,55,3,72,11,7,0,32,0,41,3,80,11,9,0,32,0,32,1,55,3,80,11,7,0,32,0,41,3,88,11,9,0,32,0,32,1,55,3,88,11,7,0,32,0,41,3,96,11,9,0,32,0,32,1,55,3,96,11,172,4,2,5,127,1,126,32,2,65,172,3,75,4,64,32,2,65,16,107,34,4,32,4,40,2,4,65,1,106,54,2,4,11,32,2,33,4,65,0,33,2,32,1,40,2,8,33,5,32,1,40,2,4,33,6,3,64,2,127,65,0,33,3,3,64,32,3,32,5,72,4,64,32,3,32,6,106,45,0,0,33,1,32,0,40,2,0,32,0,40,2,8,16,19,33,7,32,0,40,2,8,32,0,40,2,0,40,2,4,106,32,1,58,0,0,32,0,32,0,41,3,40,35,6,40,2,4,32,7,65,3,116,106,41,3,0,133,55,3,40,32,0,32,0,40,2,8,65,1,106,32,0,40,2,4,111,54,2,8,32,0,35,5,40,2,4,32,0,41,3,40,34,8,66,45,136,167,65,3,116,106,41,3,0,32,1,173,32,8,66,8,134,132,133,55,3,40,32,0,32,0,41,3,16,66,1,124,55,3,16,32,0,32,0,41,3,24,66,1,124,55,3,24,32,0,41,3,16,32,0,41,3,80,90,4,127,32,0,41,3,40,32,0,41,3,96,131,80,5,65,0,11,4,127,65,1,5,32,0,41,3,16,32,0,41,3,88,90,11,4,64,32,0,32,0,41,3,32,55,3,48,32,0,32,0,41,3,16,55,3,56,32,0,32,0,41,3,40,55,3,64,65,0,33,1,3,64,32,1,32,0,40,2,4,72,4,64,32,0,40,2,0,32,1,16,18,32,1,65,1,106,33,1,12,1,11,11,32,0,66,0,55,3,40,32,0,65,0,54,2,8,32,0,66,0,55,3,16,32,0,66,0,55,3,40,32,0,40,2,0,32,0,40,2,8,16,19,33,1,32,0,40,2,8,32,0,40,2,0,40,2,4,106,65,1,58,0,0,32,0,32,0,41,3,40,35,6,40,2,4,32,1,65,3,116,106,41,3,0,133,55,3,40,32,0,32,0,40,2,8,65,1,106,32,0,40,2,4,111,54,2,8,32,0,35,5,40,2,4,32,0,41,3,40,34,8,66,45,136,167,65,3,116,106,41,3,0,32,8,66,8,134,66,1,132,133,55,3,40,32,3,65,1,106,12,3,11,32,3,65,1,106,33,3,12,1,11,11,65,127,11,34,1,65,0,78,4,64,32,5,32,1,107,33,5,32,1,32,6,106,33,6,32,2,34,1,65,1,106,33,2,32,4,40,2,4,32,1,65,2,116,106,32,0,41,3,56,62,2,0,12,1,11,11,32,4,11,10,0,16,15,36,5,16,15,36,6,11,3,0,1,11,73,1,2,127,32,0,40,2,4,34,1,65,255,255,255,255,0,113,34,2,65,1,70,4,64,32,0,65,16,106,16,53,32,0,32,0,40,2,0,65,1,114,54,2,0,35,0,32,0,16,2,5,32,0,32,2,65,1,107,32,1,65,128,128,128,128,127,113,114,54,2,4,11,11,58,0,2,64,2,64,2,64,32,0,65,8,107,40,2,0,14,7,0,0,1,1,1,1,1,2,11,15,11,32,0,40,2,0,34,0,4,64,32,0,65,172,3,79,4,64,32,0,65,16,107,16,52,11,11,15,11,0,11,11,137,3,7,0,65,16,11,55,40,0,0,0,1,0,0,0,1,0,0,0,40,0,0,0,97,0,108,0,108,0,111,0,99,0,97,0,116,0,105,0,111,0,110,0,32,0,116,0,111,0,111,0,32,0,108,0,97,0,114,0,103,0,101,0,65,208,0,11,45,30,0,0,0,1,0,0,0,1,0,0,0,30,0,0,0,126,0,108,0,105,0,98,0,47,0,114,0,116,0,47,0,116,0,108,0,115,0,102,0,46,0,116,0,115,0,65,128,1,11,43,28,0,0,0,1,0,0,0,1,0,0,0,28,0,0,0,73,0,110,0,118,0,97,0,108,0,105,0,100,0,32,0,108,0,101,0,110,0,103,0,116,0,104,0,65,176,1,11,53,38,0,0,0,1,0,0,0,1,0,0,0,38,0,0,0,126,0,108,0,105,0,98,0,47,0,97,0,114,0,114,0,97,0,121,0,98,0,117,0,102,0,102,0,101,0,114,0,46,0,116,0,115,0,65,240,1,11,51,36,0,0,0,1,0,0,0,1,0,0,0,36,0,0,0,73,0,110,0,100,0,101,0,120,0,32,0,111,0,117,0,116,0,32,0,111,0,102,0,32,0,114,0,97,0,110,0,103,0,101,0,65,176,2,11,51,36,0,0,0,1,0,0,0,1,0,0,0,36,0,0,0,126,0,108,0,105,0,98,0,47,0,116,0,121,0,112,0,101,0,100,0,97,0,114,0,114,0,97,0,121,0,46,0,116,0,115,0,65,240,2,11,53,7,0,0,0,16,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,145,4,0,0,2,0,0,0,49,0,0,0,2,0,0,0,17,1,0,0,2,0,0,0,16,0,34,16,115,111,117,114,99,101,77,97,112,112,105,110,103,85,82,76,16,46,47,114,97,98,105,110,46,119,97,115,109,46,109,97,112])\n  // make it work async because browsers throw when a wasm module is bigger than 4kb and load sync\n  return instantiate(new Response(new Blob([wasm], {type: 'application/wasm'})), imp)\n}\nmodule.exports = loadWebAssembly\n","\"use strict\";\n\n// Runtime header offsets\nconst ID_OFFSET = -8;\nconst SIZE_OFFSET = -4;\n\n// Runtime ids\nconst ARRAYBUFFER_ID = 0;\nconst STRING_ID = 1;\nconst ARRAYBUFFERVIEW_ID = 2;\n\n// Runtime type information\nconst ARRAYBUFFERVIEW = 1 << 0;\nconst ARRAY = 1 << 1;\nconst SET = 1 << 2;\nconst MAP = 1 << 3;\nconst VAL_ALIGN_OFFSET = 5;\nconst VAL_ALIGN = 1 << VAL_ALIGN_OFFSET;\nconst VAL_SIGNED = 1 << 10;\nconst VAL_FLOAT = 1 << 11;\nconst VAL_NULLABLE = 1 << 12;\nconst VAL_MANAGED = 1 << 13;\nconst KEY_ALIGN_OFFSET = 14;\nconst KEY_ALIGN = 1 << KEY_ALIGN_OFFSET;\nconst KEY_SIGNED = 1 << 19;\nconst KEY_FLOAT = 1 << 20;\nconst KEY_NULLABLE = 1 << 21;\nconst KEY_MANAGED = 1 << 22;\n\n// Array(BufferView) layout\nconst ARRAYBUFFERVIEW_BUFFER_OFFSET = 0;\nconst ARRAYBUFFERVIEW_DATASTART_OFFSET = 4;\nconst ARRAYBUFFERVIEW_DATALENGTH_OFFSET = 8;\nconst ARRAYBUFFERVIEW_SIZE = 12;\nconst ARRAY_LENGTH_OFFSET = 12;\nconst ARRAY_SIZE = 16;\n\nconst BIGINT = typeof BigUint64Array !== \"undefined\";\nconst THIS = Symbol();\nconst CHUNKSIZE = 1024;\n\n/** Gets a string from an U32 and an U16 view on a memory. */\nfunction getStringImpl(buffer, ptr) {\n  const U32 = new Uint32Array(buffer);\n  const U16 = new Uint16Array(buffer);\n  var length = U32[(ptr + SIZE_OFFSET) >>> 2] >>> 1;\n  var offset = ptr >>> 1;\n  if (length <= CHUNKSIZE) return String.fromCharCode.apply(String, U16.subarray(offset, offset + length));\n  const parts = [];\n  do {\n    const last = U16[offset + CHUNKSIZE - 1];\n    const size = last >= 0xD800 && last < 0xDC00 ? CHUNKSIZE - 1 : CHUNKSIZE;\n    parts.push(String.fromCharCode.apply(String, U16.subarray(offset, offset += size)));\n    length -= size;\n  } while (length > CHUNKSIZE);\n  return parts.join(\"\") + String.fromCharCode.apply(String, U16.subarray(offset, offset + length));\n}\n\n/** Prepares the base module prior to instantiation. */\nfunction preInstantiate(imports) {\n  const baseModule = {};\n\n  function getString(memory, ptr) {\n    if (!memory) return \"<yet unknown>\";\n    return getStringImpl(memory.buffer, ptr);\n  }\n\n  // add common imports used by stdlib for convenience\n  const env = (imports.env = imports.env || {});\n  env.abort = env.abort || function abort(mesg, file, line, colm) {\n    const memory = baseModule.memory || env.memory; // prefer exported, otherwise try imported\n    throw Error(\"abort: \" + getString(memory, mesg) + \" at \" + getString(memory, file) + \":\" + line + \":\" + colm);\n  }\n  env.trace = env.trace || function trace(mesg, n) {\n    const memory = baseModule.memory || env.memory;\n    console.log(\"trace: \" + getString(memory, mesg) + (n ? \" \" : \"\") + Array.prototype.slice.call(arguments, 2, 2 + n).join(\", \"));\n  }\n  imports.Math = imports.Math || Math;\n  imports.Date = imports.Date || Date;\n\n  return baseModule;\n}\n\n/** Prepares the final module once instantiation is complete. */\nfunction postInstantiate(baseModule, instance) {\n  const rawExports = instance.exports;\n  const memory = rawExports.memory;\n  const table = rawExports.table;\n  const alloc = rawExports[\"__alloc\"];\n  const retain = rawExports[\"__retain\"];\n  const rttiBase = rawExports[\"__rtti_base\"] || ~0; // oob if not present\n\n  /** Gets the runtime type info for the given id. */\n  function getInfo(id) {\n    const U32 = new Uint32Array(memory.buffer);\n    const count = U32[rttiBase >>> 2];\n    if ((id >>>= 0) >= count) throw Error(\"invalid id: \" + id);\n    return U32[(rttiBase + 4 >>> 2) + id * 2];\n  }\n\n  /** Gets the runtime base id for the given id. */\n  function getBase(id) {\n    const U32 = new Uint32Array(memory.buffer);\n    const count = U32[rttiBase >>> 2];\n    if ((id >>>= 0) >= count) throw Error(\"invalid id: \" + id);\n    return U32[(rttiBase + 4 >>> 2) + id * 2 + 1];\n  }\n\n  /** Gets the runtime alignment of a collection's values. */\n  function getValueAlign(info) {\n    return 31 - Math.clz32((info >>> VAL_ALIGN_OFFSET) & 31); // -1 if none\n  }\n\n  /** Gets the runtime alignment of a collection's keys. */\n  function getKeyAlign(info) {\n    return 31 - Math.clz32((info >>> KEY_ALIGN_OFFSET) & 31); // -1 if none\n  }\n\n  /** Allocates a new string in the module's memory and returns its retained pointer. */\n  function __allocString(str) {\n    const length = str.length;\n    const ptr = alloc(length << 1, STRING_ID);\n    const U16 = new Uint16Array(memory.buffer);\n    for (var i = 0, p = ptr >>> 1; i < length; ++i) U16[p + i] = str.charCodeAt(i);\n    return ptr;\n  }\n\n  baseModule.__allocString = __allocString;\n\n  /** Reads a string from the module's memory by its pointer. */\n  function __getString(ptr) {\n    const buffer = memory.buffer;\n    const id = new Uint32Array(buffer)[ptr + ID_OFFSET >>> 2];\n    if (id !== STRING_ID) throw Error(\"not a string: \" + ptr);\n    return getStringImpl(buffer, ptr);\n  }\n\n  baseModule.__getString = __getString;\n\n  /** Gets the view matching the specified alignment, signedness and floatness. */\n  function getView(alignLog2, signed, float) {\n    const buffer = memory.buffer;\n    if (float) {\n      switch (alignLog2) {\n        case 2: return new Float32Array(buffer);\n        case 3: return new Float64Array(buffer);\n      }\n    } else {\n      switch (alignLog2) {\n        case 0: return new (signed ? Int8Array : Uint8Array)(buffer);\n        case 1: return new (signed ? Int16Array : Uint16Array)(buffer);\n        case 2: return new (signed ? Int32Array : Uint32Array)(buffer);\n        case 3: return new (signed ? BigInt64Array : BigUint64Array)(buffer);\n      }\n    }\n    throw Error(\"unsupported align: \" + alignLog2);\n  }\n\n  /** Allocates a new array in the module's memory and returns its retained pointer. */\n  function __allocArray(id, values) {\n    const info = getInfo(id);\n    if (!(info & (ARRAYBUFFERVIEW | ARRAY))) throw Error(\"not an array: \" + id + \" @ \" + info);\n    const align = getValueAlign(info);\n    const length = values.length;\n    const buf = alloc(length << align, ARRAYBUFFER_ID);\n    const arr = alloc(info & ARRAY ? ARRAY_SIZE : ARRAYBUFFERVIEW_SIZE, id);\n    const U32 = new Uint32Array(memory.buffer);\n    U32[arr + ARRAYBUFFERVIEW_BUFFER_OFFSET >>> 2] = retain(buf);\n    U32[arr + ARRAYBUFFERVIEW_DATASTART_OFFSET >>> 2] = buf;\n    U32[arr + ARRAYBUFFERVIEW_DATALENGTH_OFFSET >>> 2] = length << align;\n    if (info & ARRAY) U32[arr + ARRAY_LENGTH_OFFSET >>> 2] = length;\n    const view = getView(align, info & VAL_SIGNED, info & VAL_FLOAT);\n    if (info & VAL_MANAGED) {\n      for (let i = 0; i < length; ++i) view[(buf >>> align) + i] = retain(values[i]);\n    } else {\n      view.set(values, buf >>> align);\n    }\n    return arr;\n  }\n\n  baseModule.__allocArray = __allocArray;\n\n  /** Gets a live view on an array's values in the module's memory. Infers the array type from RTTI. */\n  function __getArrayView(arr) {\n    const U32 = new Uint32Array(memory.buffer);\n    const id = U32[arr + ID_OFFSET >>> 2];\n    const info = getInfo(id);\n    if (!(info & ARRAYBUFFERVIEW)) throw Error(\"not an array: \" + id);\n    const align = getValueAlign(info);\n    var buf = U32[arr + ARRAYBUFFERVIEW_DATASTART_OFFSET >>> 2];\n    const length = info & ARRAY\n      ? U32[arr + ARRAY_LENGTH_OFFSET >>> 2]\n      : U32[buf + SIZE_OFFSET >>> 2] >>> align;\n    return getView(align, info & VAL_SIGNED, info & VAL_FLOAT)\n          .subarray(buf >>>= align, buf + length);\n  }\n\n  baseModule.__getArrayView = __getArrayView;\n\n  /** Copies an array's values from the module's memory. Infers the array type from RTTI. */\n  function __getArray(arr) {\n    const input = __getArrayView(arr);\n    const len = input.length;\n    const out = new Array(len);\n    for (let i = 0; i < len; i++) out[i] = input[i];\n    return out;\n  }\n\n  baseModule.__getArray = __getArray;\n\n  /** Copies an ArrayBuffer's value from the module's memory. */\n  function __getArrayBuffer(ptr) {\n    const buffer = memory.buffer;\n    const length = new Uint32Array(buffer)[ptr + SIZE_OFFSET >>> 2];\n    return buffer.slice(ptr, ptr + length);\n  }\n\n  baseModule.__getArrayBuffer = __getArrayBuffer;\n\n  /** Copies a typed array's values from the module's memory. */\n  function getTypedArray(Type, alignLog2, ptr) {\n    return new Type(getTypedArrayView(Type, alignLog2, ptr));\n  }\n\n  /** Gets a live view on a typed array's values in the module's memory. */\n  function getTypedArrayView(Type, alignLog2, ptr) {\n    const buffer = memory.buffer;\n    const U32 = new Uint32Array(buffer);\n    const bufPtr = U32[ptr + ARRAYBUFFERVIEW_DATASTART_OFFSET >>> 2];\n    return new Type(buffer, bufPtr, U32[bufPtr + SIZE_OFFSET >>> 2] >>> alignLog2);\n  }\n\n  baseModule.__getInt8Array = getTypedArray.bind(null, Int8Array, 0);\n  baseModule.__getInt8ArrayView = getTypedArrayView.bind(null, Int8Array, 0);\n  baseModule.__getUint8Array = getTypedArray.bind(null, Uint8Array, 0);\n  baseModule.__getUint8ArrayView = getTypedArrayView.bind(null, Uint8Array, 0);\n  baseModule.__getUint8ClampedArray = getTypedArray.bind(null, Uint8ClampedArray, 0);\n  baseModule.__getUint8ClampedArrayView = getTypedArrayView.bind(null, Uint8ClampedArray, 0);\n  baseModule.__getInt16Array = getTypedArray.bind(null, Int16Array, 1);\n  baseModule.__getInt16ArrayView = getTypedArrayView.bind(null, Int16Array, 1);\n  baseModule.__getUint16Array = getTypedArray.bind(null, Uint16Array, 1);\n  baseModule.__getUint16ArrayView = getTypedArrayView.bind(null, Uint16Array, 1);\n  baseModule.__getInt32Array = getTypedArray.bind(null, Int32Array, 2);\n  baseModule.__getInt32ArrayView = getTypedArrayView.bind(null, Int32Array, 2);\n  baseModule.__getUint32Array = getTypedArray.bind(null, Uint32Array, 2);\n  baseModule.__getUint32ArrayView = getTypedArrayView.bind(null, Uint32Array, 2);\n  if (BIGINT) {\n    baseModule.__getInt64Array = getTypedArray.bind(null, BigInt64Array, 3);\n    baseModule.__getInt64ArrayView = getTypedArrayView.bind(null, BigInt64Array, 3);\n    baseModule.__getUint64Array = getTypedArray.bind(null, BigUint64Array, 3);\n    baseModule.__getUint64ArrayView = getTypedArrayView.bind(null, BigUint64Array, 3);\n  }\n  baseModule.__getFloat32Array = getTypedArray.bind(null, Float32Array, 2);\n  baseModule.__getFloat32ArrayView = getTypedArrayView.bind(null, Float32Array, 2);\n  baseModule.__getFloat64Array = getTypedArray.bind(null, Float64Array, 3);\n  baseModule.__getFloat64ArrayView = getTypedArrayView.bind(null, Float64Array, 3);\n\n  /** Tests whether an object is an instance of the class represented by the specified base id. */\n  function __instanceof(ptr, baseId) {\n    const U32 = new Uint32Array(memory.buffer);\n    var id = U32[(ptr + ID_OFFSET) >>> 2];\n    if (id <= U32[rttiBase >>> 2]) {\n      do if (id == baseId) return true;\n      while (id = getBase(id));\n    }\n    return false;\n  }\n\n  baseModule.__instanceof = __instanceof;\n\n  // Pull basic exports to baseModule so code in preInstantiate can use them\n  baseModule.memory = baseModule.memory || memory;\n  baseModule.table  = baseModule.table  || table;\n\n  // Demangle exports and provide the usual utility on the prototype\n  return demangle(rawExports, baseModule);\n}\n\nfunction isResponse(o) {\n  return typeof Response !== \"undefined\" && o instanceof Response;\n}\n\n/** Asynchronously instantiates an AssemblyScript module from anything that can be instantiated. */\nasync function instantiate(source, imports) {\n  if (isResponse(source = await source)) return instantiateStreaming(source, imports);\n  return postInstantiate(\n    preInstantiate(imports || (imports = {})),\n    await WebAssembly.instantiate(\n      source instanceof WebAssembly.Module\n        ? source\n        : await WebAssembly.compile(source),\n      imports\n    )\n  );\n}\n\nexports.instantiate = instantiate;\n\n/** Synchronously instantiates an AssemblyScript module from a WebAssembly.Module or binary buffer. */\nfunction instantiateSync(source, imports) {\n  return postInstantiate(\n    preInstantiate(imports || (imports = {})),\n    new WebAssembly.Instance(\n      source instanceof WebAssembly.Module\n        ? source\n        : new WebAssembly.Module(source),\n      imports\n    )\n  )\n}\n\nexports.instantiateSync = instantiateSync;\n\n/** Asynchronously instantiates an AssemblyScript module from a response, i.e. as obtained by `fetch`. */\nasync function instantiateStreaming(source, imports) {\n  if (!WebAssembly.instantiateStreaming) {\n    return instantiate(\n      isResponse(source = await source)\n        ? source.arrayBuffer()\n        : source,\n      imports\n    );\n  }\n  return postInstantiate(\n    preInstantiate(imports || (imports = {})),\n    (await WebAssembly.instantiateStreaming(source, imports)).instance\n  );\n}\n\nexports.instantiateStreaming = instantiateStreaming;\n\n/** Demangles an AssemblyScript module's exports to a friendly object structure. */\nfunction demangle(exports, baseModule) {\n  var module = baseModule ? Object.create(baseModule) : {};\n  var setArgumentsLength = exports[\"__argumentsLength\"]\n    ? function(length) { exports[\"__argumentsLength\"].value = length; }\n    : exports[\"__setArgumentsLength\"] || exports[\"__setargc\"] || function() {};\n  for (let internalName in exports) {\n    if (!Object.prototype.hasOwnProperty.call(exports, internalName)) continue;\n    const elem = exports[internalName];\n    let parts = internalName.split(\".\");\n    let curr = module;\n    while (parts.length > 1) {\n      let part = parts.shift();\n      if (!Object.prototype.hasOwnProperty.call(curr, part)) curr[part] = {};\n      curr = curr[part];\n    }\n    let name = parts[0];\n    let hash = name.indexOf(\"#\");\n    if (hash >= 0) {\n      let className = name.substring(0, hash);\n      let classElem = curr[className];\n      if (typeof classElem === \"undefined\" || !classElem.prototype) {\n        let ctor = function(...args) {\n          return ctor.wrap(ctor.prototype.constructor(0, ...args));\n        };\n        ctor.prototype = {\n          valueOf: function valueOf() {\n            return this[THIS];\n          }\n        };\n        ctor.wrap = function(thisValue) {\n          return Object.create(ctor.prototype, { [THIS]: { value: thisValue, writable: false } });\n        };\n        if (classElem) Object.getOwnPropertyNames(classElem).forEach(name =>\n          Object.defineProperty(ctor, name, Object.getOwnPropertyDescriptor(classElem, name))\n        );\n        curr[className] = ctor;\n      }\n      name = name.substring(hash + 1);\n      curr = curr[className].prototype;\n      if (/^(get|set):/.test(name)) {\n        if (!Object.prototype.hasOwnProperty.call(curr, name = name.substring(4))) {\n          let getter = exports[internalName.replace(\"set:\", \"get:\")];\n          let setter = exports[internalName.replace(\"get:\", \"set:\")];\n          Object.defineProperty(curr, name, {\n            get: function() { return getter(this[THIS]); },\n            set: function(value) { setter(this[THIS], value); },\n            enumerable: true\n          });\n        }\n      } else {\n        if (name === 'constructor') {\n          (curr[name] = (...args) => {\n            setArgumentsLength(args.length);\n            return elem(...args);\n          }).original = elem;\n        } else { // instance method\n          (curr[name] = function(...args) { // !\n            setArgumentsLength(args.length);\n            return elem(this[THIS], ...args);\n          }).original = elem;\n        }\n      }\n    } else {\n      if (/^(get|set):/.test(name)) {\n        if (!Object.prototype.hasOwnProperty.call(curr, name = name.substring(4))) {\n          Object.defineProperty(curr, name, {\n            get: exports[internalName.replace(\"set:\", \"get:\")],\n            set: exports[internalName.replace(\"get:\", \"set:\")],\n            enumerable: true\n          });\n        }\n      } else if (typeof elem === \"function\" && elem !== setArgumentsLength) {\n        (curr[name] = (...args) => {\n          setArgumentsLength(args.length);\n          return elem(...args);\n        }).original = elem;\n      } else {\n        curr[name] = elem;\n      }\n    }\n  }\n  return module;\n}\n\nexports.demangle = demangle;\n","'use strict'\n\n// @ts-ignore\nconst BufferList = require('bl/BufferList')\n\n/**\n * @type {import('../types').Chunker}\n */\nmodule.exports = async function * fixedSizeChunker (source, options) {\n  let bl = new BufferList()\n  let currentLength = 0\n  let emitted = false\n  const maxChunkSize = options.maxChunkSize\n\n  for await (const buffer of source) {\n    bl.append(buffer)\n\n    currentLength += buffer.length\n\n    while (currentLength >= maxChunkSize) {\n      yield bl.slice(0, maxChunkSize)\n      emitted = true\n\n      // throw away consumed bytes\n      if (maxChunkSize === bl.length) {\n        bl = new BufferList()\n        currentLength = 0\n      } else {\n        const newBl = new BufferList()\n        newBl.append(bl.shallowSlice(maxChunkSize))\n        bl = newBl\n\n        // update our offset\n        currentLength -= maxChunkSize\n      }\n    }\n  }\n\n  if (!emitted || currentLength) {\n    // return any remaining bytes or an empty buffer\n    yield bl.slice(0, currentLength)\n  }\n}\n","'use strict'\n\nconst errCode = require('err-code')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n/**\n * @typedef {import('../types').ChunkValidator} ChunkValidator\n */\n\n/**\n * @type {ChunkValidator}\n */\nasync function * validateChunks (source) {\n  for await (const content of source) {\n    if (content.length === undefined) {\n      throw errCode(new Error('Content was invalid'), 'ERR_INVALID_CONTENT')\n    }\n\n    if (typeof content === 'string' || content instanceof String) {\n      yield uint8ArrayFromString(content.toString())\n    } else if (Array.isArray(content)) {\n      yield Uint8Array.from(content)\n    } else if (content instanceof Uint8Array) {\n      yield content\n    } else {\n      throw errCode(new Error('Content was invalid'), 'ERR_INVALID_CONTENT')\n    }\n  }\n}\n\nmodule.exports = validateChunks\n","'use strict'\n\nconst DirFlat = require('./dir-flat')\nconst flatToShard = require('./flat-to-shard')\nconst Dir = require('./dir')\nconst toPathComponents = require('./utils/to-path-components')\n\n/**\n * @typedef {import('./types').ImportResult} ImportResult\n * @typedef {import('./types').InProgressImportResult} InProgressImportResult\n * @typedef {import('./types').ImporterOptions} ImporterOptions\n * @typedef {import('./types').BlockAPI} BlockAPI\n * @typedef {(source: AsyncIterable<InProgressImportResult>, block: BlockAPI, options: ImporterOptions) => AsyncIterable<ImportResult>} TreeBuilder\n */\n\n/**\n * @param {InProgressImportResult} elem\n * @param {Dir} tree\n * @param {ImporterOptions} options\n */\nasync function addToTree (elem, tree, options) {\n  const pathElems = toPathComponents(elem.path || '')\n  const lastIndex = pathElems.length - 1\n  let parent = tree\n  let currentPath = ''\n\n  for (let i = 0; i < pathElems.length; i++) {\n    const pathElem = pathElems[i]\n\n    currentPath += `${currentPath ? '/' : ''}${pathElem}`\n\n    const last = (i === lastIndex)\n    parent.dirty = true\n    parent.cid = undefined\n    parent.size = undefined\n\n    if (last) {\n      await parent.put(pathElem, elem)\n      tree = await flatToShard(null, parent, options.shardSplitThreshold, options)\n    } else {\n      let dir = await parent.get(pathElem)\n\n      if (!dir || !(dir instanceof Dir)) {\n        dir = new DirFlat({\n          root: false,\n          dir: true,\n          parent: parent,\n          parentKey: pathElem,\n          path: currentPath,\n          dirty: true,\n          flat: true,\n          mtime: dir && dir.unixfs && dir.unixfs.mtime,\n          mode: dir && dir.unixfs && dir.unixfs.mode\n        }, options)\n      }\n\n      await parent.put(pathElem, dir)\n\n      parent = dir\n    }\n  }\n\n  return tree\n}\n\n/**\n * @param {Dir | InProgressImportResult} tree\n * @param {BlockAPI} block\n */\nasync function * flushAndYield (tree, block) {\n  if (!(tree instanceof Dir)) {\n    if (tree && tree.unixfs && tree.unixfs.isDirectory()) {\n      yield tree\n    }\n\n    return\n  }\n\n  yield * tree.flush(block)\n}\n\n/**\n * @type {TreeBuilder}\n */\nasync function * treeBuilder (source, block, options) {\n  /** @type {Dir} */\n  let tree = new DirFlat({\n    root: true,\n    dir: true,\n    path: '',\n    dirty: true,\n    flat: true\n  }, options)\n\n  for await (const entry of source) {\n    if (!entry) {\n      continue\n    }\n\n    tree = await addToTree(entry, tree, options)\n\n    if (!entry.unixfs || !entry.unixfs.isDirectory()) {\n      yield entry\n    }\n  }\n\n  if (options.wrapWithDirectory) {\n    yield * flushAndYield(tree, block)\n  } else {\n    for await (const unwrapped of tree.eachChildSeries()) {\n      if (!unwrapped) {\n        continue\n      }\n\n      yield * flushAndYield(unwrapped.child, block)\n    }\n  }\n}\n\nmodule.exports = treeBuilder\n","'use strict'\n\nconst {\n  DAGLink,\n  DAGNode\n} = require('ipld-dag-pb')\nconst { UnixFS } = require('ipfs-unixfs')\nconst Dir = require('./dir')\nconst persist = require('./utils/persist')\n\n/**\n * @typedef {import('./types').ImporterOptions} ImporterOptions\n * @typedef {import('./types').ImportResult} ImportResult\n * @typedef {import('./types').InProgressImportResult} InProgressImportResult\n * @typedef {import('./types').BlockAPI} BlockAPI\n * @typedef {import('./dir').DirProps} DirProps\n * @typedef {import('cids')} CID\n */\n\nclass DirFlat extends Dir {\n  /**\n   * @param {DirProps} props\n   * @param {ImporterOptions} options\n   */\n  constructor (props, options) {\n    super(props, options)\n\n    /** @type {{ [key: string]: InProgressImportResult | Dir }} */\n    this._children = {}\n  }\n\n  /**\n   * @param {string} name\n   * @param {InProgressImportResult | Dir} value\n   */\n  async put (name, value) {\n    this.cid = undefined\n    this.size = undefined\n\n    this._children[name] = value\n  }\n\n  /**\n   * @param {string} name\n   */\n  get (name) {\n    return Promise.resolve(this._children[name])\n  }\n\n  childCount () {\n    return Object.keys(this._children).length\n  }\n\n  directChildrenCount () {\n    return this.childCount()\n  }\n\n  onlyChild () {\n    return this._children[Object.keys(this._children)[0]]\n  }\n\n  async * eachChildSeries () {\n    const keys = Object.keys(this._children)\n\n    for (let i = 0; i < keys.length; i++) {\n      const key = keys[i]\n\n      yield {\n        key: key,\n        child: this._children[key]\n      }\n    }\n  }\n\n  /**\n   * @param {BlockAPI} block\n   * @returns {AsyncIterable<ImportResult>}\n   */\n  async * flush (block) {\n    const children = Object.keys(this._children)\n    const links = []\n\n    for (let i = 0; i < children.length; i++) {\n      let child = this._children[children[i]]\n\n      if (child instanceof Dir) {\n        for await (const entry of child.flush(block)) {\n          child = entry\n\n          yield child\n        }\n      }\n\n      if (child.size != null && child.cid) {\n        links.push(new DAGLink(children[i], child.size, child.cid))\n      }\n    }\n\n    const unixfs = new UnixFS({\n      type: 'directory',\n      mtime: this.mtime,\n      mode: this.mode\n    })\n\n    const node = new DAGNode(unixfs.marshal(), links)\n    const buffer = node.serialize()\n    const cid = await persist(buffer, block, this.options)\n    const size = buffer.length + node.Links.reduce(\n      /**\n       * @param {number} acc\n       * @param {DAGLink} curr\n       */\n      (acc, curr) => acc + curr.Tsize,\n      0)\n\n    this.cid = cid\n    this.size = size\n\n    yield {\n      cid,\n      unixfs,\n      path: this.path,\n      size\n    }\n  }\n}\n\nmodule.exports = DirFlat\n","'use strict'\n\n/**\n * @typedef {import('./types').ImporterOptions} ImporterOptions\n * @typedef {import('./types').ImportResult} ImportResult\n * @typedef {import('./types').InProgressImportResult} InProgressImportResult\n * @typedef {import('./types').BlockAPI} BlockAPI\n * @typedef {import('cids')} CID\n * @typedef {object} DirProps\n * @property {boolean} root\n * @property {boolean} dir\n * @property {string} path\n * @property {boolean} dirty\n * @property {boolean} flat\n * @property {Dir} [parent]\n * @property {string} [parentKey]\n * @property {import('ipfs-unixfs').UnixFS} [unixfs]\n * @property {number} [mode]\n * @property {import('ipfs-unixfs').Mtime} [mtime]\n */\nclass Dir {\n  /**\n   *\n   * @param {DirProps} props\n   * @param {ImporterOptions} options\n   */\n  constructor (props, options) {\n    this.options = options || {}\n\n    this.root = props.root\n    this.dir = props.dir\n    this.path = props.path\n    this.dirty = props.dirty\n    this.flat = props.flat\n    this.parent = props.parent\n    this.parentKey = props.parentKey\n    this.unixfs = props.unixfs\n    this.mode = props.mode\n    this.mtime = props.mtime\n\n    /** @type {CID | undefined} */\n    this.cid = undefined\n    /** @type {number | undefined} */\n    this.size = undefined\n  }\n\n  /**\n   * @param {string} name\n   * @param {InProgressImportResult | Dir} value\n   */\n  async put (name, value) { }\n\n  /**\n   * @param {string} name\n   * @returns {Promise<InProgressImportResult | Dir | undefined>}\n   */\n  get (name) {\n    return Promise.resolve(this)\n  }\n\n  /**\n   * @returns {AsyncIterable<{ key: string, child: InProgressImportResult | Dir}>}\n   */\n  async * eachChildSeries () { }\n\n  /**\n   * @param {BlockAPI} block\n   * @returns {AsyncIterable<ImportResult>}\n   */\n  async * flush (block) { }\n}\n\nmodule.exports = Dir\n","'use strict'\n\nconst DirSharded = require('./dir-sharded')\nconst DirFlat = require('./dir-flat')\n\n/**\n * @typedef {import('./dir')} Dir\n * @typedef {import('./types').ImporterOptions} ImporterOptions\n */\n\n/**\n * @param {Dir | null} child\n * @param {Dir} dir\n * @param {number} threshold\n * @param {ImporterOptions} options\n * @returns {Promise<DirSharded>}\n */\nmodule.exports = async function flatToShard (child, dir, threshold, options) {\n  let newDir = dir\n\n  if (dir instanceof DirFlat && dir.directChildrenCount() >= threshold) {\n    newDir = await convertToShard(dir, options)\n  }\n\n  const parent = newDir.parent\n\n  if (parent) {\n    if (newDir !== dir) {\n      if (child) {\n        child.parent = newDir\n      }\n\n      if (!newDir.parentKey) {\n        throw new Error('No parent key found')\n      }\n\n      await parent.put(newDir.parentKey, newDir)\n    }\n\n    return flatToShard(newDir, parent, threshold, options)\n  }\n\n  // @ts-ignore\n  return newDir\n}\n\n/**\n * @param {DirFlat} oldDir\n * @param {ImporterOptions} options\n */\nasync function convertToShard (oldDir, options) {\n  const newDir = new DirSharded({\n    root: oldDir.root,\n    dir: true,\n    parent: oldDir.parent,\n    parentKey: oldDir.parentKey,\n    path: oldDir.path,\n    dirty: oldDir.dirty,\n    flat: false,\n    mtime: oldDir.mtime,\n    mode: oldDir.mode\n  }, options)\n\n  for await (const { key, child } of oldDir.eachChildSeries()) {\n    await newDir.put(key, child)\n  }\n\n  return newDir\n}\n","'use strict'\n\nconst {\n  DAGLink,\n  DAGNode\n} = require('ipld-dag-pb')\nconst { UnixFS } = require('ipfs-unixfs')\nconst Dir = require('./dir')\nconst persist = require('./utils/persist')\nconst { createHAMT, Bucket } = require('hamt-sharding')\n\n/**\n * @typedef {import('./types').ImporterOptions} ImporterOptions\n * @typedef {import('./types').ImportResult} ImportResult\n * @typedef {import('./types').InProgressImportResult} InProgressImportResult\n * @typedef {import('./types').BlockAPI} BlockAPI\n */\n\n/**\n * @typedef {import('./dir').DirProps} DirProps\n */\n\nclass DirSharded extends Dir {\n  /**\n   * @param {DirProps} props\n   * @param {ImporterOptions} options\n   */\n  constructor (props, options) {\n    super(props, options)\n\n    /** @type {Bucket<InProgressImportResult | Dir>} */\n    this._bucket = createHAMT({\n      hashFn: options.hamtHashFn,\n      bits: options.hamtBucketBits\n    })\n  }\n\n  /**\n   * @param {string} name\n   * @param {InProgressImportResult | Dir} value\n   */\n  async put (name, value) {\n    await this._bucket.put(name, value)\n  }\n\n  /**\n   * @param {string} name\n   */\n  get (name) {\n    return this._bucket.get(name)\n  }\n\n  childCount () {\n    return this._bucket.leafCount()\n  }\n\n  directChildrenCount () {\n    return this._bucket.childrenCount()\n  }\n\n  onlyChild () {\n    return this._bucket.onlyChild()\n  }\n\n  async * eachChildSeries () {\n    for await (const { key, value } of this._bucket.eachLeafSeries()) {\n      yield {\n        key,\n        child: value\n      }\n    }\n  }\n\n  /**\n   * @param {BlockAPI} block\n   * @returns {AsyncIterable<ImportResult>}\n   */\n  async * flush (block) {\n    for await (const entry of flush(this._bucket, block, this, this.options)) {\n      yield {\n        ...entry,\n        path: this.path\n      }\n    }\n  }\n}\n\nmodule.exports = DirSharded\n\n/**\n * @param {Bucket<?>} bucket\n * @param {BlockAPI} block\n * @param {*} shardRoot\n * @param {ImporterOptions} options\n * @returns {AsyncIterable<ImportResult>}\n */\nasync function * flush (bucket, block, shardRoot, options) {\n  const children = bucket._children\n  const links = []\n  let childrenSize = 0\n\n  for (let i = 0; i < children.length; i++) {\n    const child = children.get(i)\n\n    if (!child) {\n      continue\n    }\n\n    const labelPrefix = i.toString(16).toUpperCase().padStart(2, '0')\n\n    if (child instanceof Bucket) {\n      let shard\n\n      for await (const subShard of await flush(child, block, null, options)) {\n        shard = subShard\n      }\n\n      if (!shard) {\n        throw new Error('Could not flush sharded directory, no subshard found')\n      }\n\n      links.push(new DAGLink(labelPrefix, shard.size, shard.cid))\n      childrenSize += shard.size\n    } else if (typeof child.value.flush === 'function') {\n      const dir = child.value\n      let flushedDir\n\n      for await (const entry of dir.flush(block)) {\n        flushedDir = entry\n\n        yield flushedDir\n      }\n\n      const label = labelPrefix + child.key\n      links.push(new DAGLink(label, flushedDir.size, flushedDir.cid))\n\n      childrenSize += flushedDir.size\n    } else {\n      const value = child.value\n\n      if (!value.cid) {\n        continue\n      }\n\n      const label = labelPrefix + child.key\n      const size = value.size\n\n      links.push(new DAGLink(label, size, value.cid))\n      childrenSize += size\n    }\n  }\n\n  // go-ipfs uses little endian, that's why we have to\n  // reverse the bit field before storing it\n  const data = Uint8Array.from(children.bitField().reverse())\n  const dir = new UnixFS({\n    type: 'hamt-sharded-directory',\n    data,\n    fanout: bucket.tableSize(),\n    hashType: options.hamtHashCode,\n    mtime: shardRoot && shardRoot.mtime,\n    mode: shardRoot && shardRoot.mode\n  })\n\n  const node = new DAGNode(dir.marshal(), links)\n  const buffer = node.serialize()\n  const cid = await persist(buffer, block, options)\n  const size = buffer.length + childrenSize\n\n  yield {\n    cid,\n    unixfs: dir,\n    size\n  }\n}\n","'use strict'\n\nconst Bucket = require('./bucket')\nconst wrapHash = require('./consumable-hash')\n\n/**\n * @typedef {object} UserBucketOptions\n * @property {(value: Uint8Array) => Promise<Uint8Array>} hashFn\n * @property {number} [bits=8]\n */\n\n/**\n * @param {UserBucketOptions} options\n */\nfunction createHAMT (options) {\n  if (!options || !options.hashFn) {\n    throw new Error('please define an options.hashFn')\n  }\n\n  const bucketOptions = {\n    bits: options.bits || 8,\n    hash: wrapHash(options.hashFn)\n  }\n\n  return new Bucket(bucketOptions)\n}\n\nmodule.exports = {\n  createHAMT,\n  Bucket\n}\n","'use strict'\n\n// @ts-ignore\nconst SparseArray = require('sparse-array')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n/**\n * @typedef {import('./consumable-hash').InfiniteHash} InfiniteHash\n * @typedef {import('../').UserBucketOptions} UserBucketOptions\n */\n\n/**\n * @template V\n * @typedef {object} BucketChild<V>\n * @property {string} key\n * @property {V} value\n * @property {InfiniteHash} hash\n */\n\n/**\n * @template B\n *\n * @typedef {object} SA<B>\n * @property {number} length\n * @property {() => B[]} compactArray\n * @property {(i: number) => B} get\n * @property {(i: number, value: B) => void} set\n * @property {<A> (fn: (acc: A, curr: B, index: number) => A, initial: A) => B} reduce\n * @property {(fn: (item: B) => boolean) => B | undefined} find\n * @property {() => number[]} bitField\n * @property {(i: number) => void} unset\n */\n\n/**\n * @template T\n *\n * @typedef {object} BucketPosition<T>\n * @property {Bucket<T>} bucket\n * @property {number} pos\n * @property {InfiniteHash} hash\n * @property {BucketChild<T>} [existingChild]\n */\n\n/**\n * @typedef {object} BucketOptions\n * @property {number} bits\n * @property {(value: Uint8Array | InfiniteHash) => InfiniteHash} hash\n */\n\n/**\n * @template T\n */\nclass Bucket {\n  /**\n   * @param {BucketOptions} options\n   * @param {Bucket<T>} [parent]\n   * @param {number} [posAtParent=0]\n   */\n  constructor (options, parent, posAtParent = 0) {\n    this._options = options\n    this._popCount = 0\n    this._parent = parent\n    this._posAtParent = posAtParent\n\n    /** @type {SA<Bucket<T> | BucketChild<T>>} */\n    this._children = new SparseArray()\n\n    /** @type {string | null} */\n    this.key = null\n  }\n\n  /**\n   * @param {string} key\n   * @param {T} value\n   */\n  async put (key, value) {\n    const place = await this._findNewBucketAndPos(key)\n\n    await place.bucket._putAt(place, key, value)\n  }\n\n  /**\n   * @param {string} key\n   */\n  async get (key) {\n    const child = await this._findChild(key)\n\n    if (child) {\n      return child.value\n    }\n  }\n\n  /**\n   * @param {string} key\n   */\n  async del (key) {\n    const place = await this._findPlace(key)\n    const child = place.bucket._at(place.pos)\n\n    if (child && child.key === key) {\n      place.bucket._delAt(place.pos)\n    }\n  }\n\n  /**\n   * @returns {number}\n   */\n  leafCount () {\n    const children = this._children.compactArray()\n\n    return children.reduce((acc, child) => {\n      if (child instanceof Bucket) {\n        return acc + child.leafCount()\n      }\n\n      return acc + 1\n    }, 0)\n  }\n\n  childrenCount () {\n    return this._children.length\n  }\n\n  onlyChild () {\n    return this._children.get(0)\n  }\n\n  /**\n   * @returns {Iterable<BucketChild<T>>}\n   */\n  * eachLeafSeries () {\n    const children = this._children.compactArray()\n\n    for (const child of children) {\n      if (child instanceof Bucket) {\n        yield * child.eachLeafSeries()\n      } else {\n        yield child\n      }\n    }\n\n    // this is necessary because tsc requires a @return annotation as it\n    // can't derive a return type due to the recursion, and eslint requires\n    // a return statement when there is a @return annotation\n    return []\n  }\n\n  /**\n   * @param {(value: BucketChild<T>, index: number) => T} map\n   * @param {(reduced: any) => any} reduce\n   */\n  serialize (map, reduce) {\n    /** @type {T[]} */\n    const acc = []\n    // serialize to a custom non-sparse representation\n    return reduce(this._children.reduce((acc, child, index) => {\n      if (child) {\n        if (child instanceof Bucket) {\n          acc.push(child.serialize(map, reduce))\n        } else {\n          acc.push(map(child, index))\n        }\n      }\n      return acc\n    }, acc))\n  }\n\n  /**\n   * @param {(value: BucketChild<T>) => Promise<T[]>} asyncMap\n   * @param {(reduced: any) => Promise<any>} asyncReduce\n   */\n  asyncTransform (asyncMap, asyncReduce) {\n    return asyncTransformBucket(this, asyncMap, asyncReduce)\n  }\n\n  toJSON () {\n    return this.serialize(mapNode, reduceNodes)\n  }\n\n  prettyPrint () {\n    return JSON.stringify(this.toJSON(), null, '  ')\n  }\n\n  tableSize () {\n    return Math.pow(2, this._options.bits)\n  }\n\n  /**\n   * @param {string} key\n   * @returns {Promise<BucketChild<T> | undefined>}\n   */\n  async _findChild (key) {\n    const result = await this._findPlace(key)\n    const child = result.bucket._at(result.pos)\n\n    if (child instanceof Bucket) {\n      // should not be possible, this._findPlace should always\n      // return a location for a child, not a bucket\n      return undefined\n    }\n\n    if (child && child.key === key) {\n      return child\n    }\n  }\n\n  /**\n   * @param {string | InfiniteHash} key\n   * @returns {Promise<BucketPosition<T>>}\n   */\n  async _findPlace (key) {\n    const hashValue = this._options.hash(typeof key === 'string' ? uint8ArrayFromString(key) : key)\n    const index = await hashValue.take(this._options.bits)\n\n    const child = this._children.get(index)\n\n    if (child instanceof Bucket) {\n      return child._findPlace(hashValue)\n    }\n\n    return {\n      bucket: this,\n      pos: index,\n      hash: hashValue,\n      existingChild: child\n    }\n  }\n\n  /**\n   * @param {string | InfiniteHash} key\n   * @returns {Promise<BucketPosition<T>>}\n   */\n  async _findNewBucketAndPos (key) {\n    const place = await this._findPlace(key)\n\n    if (place.existingChild && place.existingChild.key !== key) {\n      // conflict\n      const bucket = new Bucket(this._options, place.bucket, place.pos)\n      place.bucket._putObjectAt(place.pos, bucket)\n\n      // put the previous value\n      const newPlace = await bucket._findPlace(place.existingChild.hash)\n      newPlace.bucket._putAt(newPlace, place.existingChild.key, place.existingChild.value)\n\n      return bucket._findNewBucketAndPos(place.hash)\n    }\n\n    // no conflict, we found the place\n    return place\n  }\n\n  /**\n   * @param {BucketPosition<T>} place\n   * @param {string} key\n   * @param {T} value\n   */\n  _putAt (place, key, value) {\n    this._putObjectAt(place.pos, {\n      key: key,\n      value: value,\n      hash: place.hash\n    })\n  }\n\n  /**\n   * @param {number} pos\n   * @param {Bucket<T> | BucketChild<T>} object\n   */\n  _putObjectAt (pos, object) {\n    if (!this._children.get(pos)) {\n      this._popCount++\n    }\n    this._children.set(pos, object)\n  }\n\n  /**\n   * @param {number} pos\n   */\n  _delAt (pos) {\n    if (pos === -1) {\n      throw new Error('Invalid position')\n    }\n\n    if (this._children.get(pos)) {\n      this._popCount--\n    }\n    this._children.unset(pos)\n    this._level()\n  }\n\n  _level () {\n    if (this._parent && this._popCount <= 1) {\n      if (this._popCount === 1) {\n        // remove myself from parent, replacing me with my only child\n        const onlyChild = this._children.find(exists)\n\n        if (onlyChild && !(onlyChild instanceof Bucket)) {\n          const hash = onlyChild.hash\n          hash.untake(this._options.bits)\n          const place = {\n            pos: this._posAtParent,\n            hash: hash,\n            bucket: this._parent\n          }\n          this._parent._putAt(place, onlyChild.key, onlyChild.value)\n        }\n      } else {\n        this._parent._delAt(this._posAtParent)\n      }\n    }\n  }\n\n  /**\n   * @param {number} index\n   * @returns {BucketChild<T> | Bucket<T> | undefined}\n   */\n  _at (index) {\n    return this._children.get(index)\n  }\n}\n\n/**\n * @param {any} o\n */\nfunction exists (o) {\n  return Boolean(o)\n}\n\n/**\n *\n * @param {*} node\n * @param {number} index\n */\nfunction mapNode (node, index) {\n  return node.key\n}\n\n/**\n * @param {*} nodes\n */\nfunction reduceNodes (nodes) {\n  return nodes\n}\n\n/**\n * @template T\n *\n * @param {Bucket<T>} bucket\n * @param {(value: BucketChild<T>) => Promise<T[]>} asyncMap\n * @param {(reduced: any) => Promise<any>} asyncReduce\n */\nasync function asyncTransformBucket (bucket, asyncMap, asyncReduce) {\n  const output = []\n\n  for (const child of bucket._children.compactArray()) {\n    if (child instanceof Bucket) {\n      await asyncTransformBucket(child, asyncMap, asyncReduce)\n    } else {\n      const mappedChildren = await asyncMap(child)\n\n      output.push({\n        bitField: bucket._children.bitField(),\n        children: mappedChildren\n      })\n    }\n  }\n\n  return asyncReduce(output)\n}\n\nmodule.exports = Bucket\n","'use strict'\n\n// JS treats subjects of bitwise operators as SIGNED 32 bit numbers,\n// which means the maximum amount of bits we can store inside each byte\n// is 7..\nconst BITS_PER_BYTE = 7\n\nmodule.exports = class SparseArray {\n  constructor () {\n    this._bitArrays = []\n    this._data = []\n    this._length = 0\n    this._changedLength = false\n    this._changedData = false\n  }\n\n  set (index, value) {\n    let pos = this._internalPositionFor(index, false)\n    if (value === undefined) {\n      // unsetting\n      if (pos !== -1) {\n        // remove item from bit array and array itself\n        this._unsetInternalPos(pos)\n        this._unsetBit(index)\n        this._changedLength = true\n        this._changedData = true\n      }\n    } else {\n      let needsSort = false\n      if (pos === -1) {\n        pos = this._data.length\n        this._setBit(index)\n        this._changedData = true\n      } else {\n        needsSort = true\n      }\n      this._setInternalPos(pos, index, value, needsSort)\n      this._changedLength = true\n    }\n  }\n\n  unset (index) {\n    this.set(index, undefined)\n  }\n\n  get (index) {\n    this._sortData()\n    const pos = this._internalPositionFor(index, true)\n    if (pos === -1) {\n      return undefined\n    }\n    return this._data[pos][1]\n  }\n\n  push (value) {\n    this.set(this.length, value)\n    return this.length\n  }\n\n  get length () {\n    this._sortData()\n    if (this._changedLength) {\n      const last = this._data[this._data.length - 1]\n      this._length = last ? last[0] + 1 : 0\n      this._changedLength = false\n    }\n    return this._length\n  }\n\n  forEach (iterator) {\n    let i = 0\n    while(i < this.length) {\n      iterator(this.get(i), i, this)\n      i++\n    }\n  }\n\n  map (iterator) {\n    let i = 0\n    let mapped = new Array(this.length)\n    while(i < this.length) {\n      mapped[i] = iterator(this.get(i), i, this)\n      i++\n    }\n    return mapped\n  }\n\n  reduce (reducer, initialValue) {\n    let i = 0\n    let acc = initialValue\n    while(i < this.length) {\n      const value = this.get(i)\n      acc = reducer(acc, value, i)\n      i++\n    }\n    return acc\n  }\n\n  find (finder) {\n    let i = 0, found, last\n    while ((i < this.length) && !found) {\n      last = this.get(i)\n      found = finder(last)\n      i++\n    }\n    return found ? last : undefined\n  }\n\n  _internalPositionFor (index, noCreate) {\n    const bytePos = this._bytePosFor(index, noCreate)\n    if (bytePos >= this._bitArrays.length) {\n      return -1\n    }\n    const byte = this._bitArrays[bytePos]\n    const bitPos = index - bytePos * BITS_PER_BYTE\n    const exists = (byte & (1 << bitPos)) > 0\n    if (!exists) {\n      return -1\n    }\n    const previousPopCount = this._bitArrays.slice(0, bytePos).reduce(popCountReduce, 0)\n\n    const mask = ~(0xffffffff << (bitPos + 1))\n    const bytePopCount = popCount(byte & mask)\n    const arrayPos = previousPopCount + bytePopCount - 1\n    return arrayPos\n  }\n\n  _bytePosFor (index, noCreate) {\n    const bytePos = Math.floor(index / BITS_PER_BYTE)\n    const targetLength = bytePos + 1\n    while (!noCreate && this._bitArrays.length < targetLength) {\n      this._bitArrays.push(0)\n    }\n    return bytePos\n  }\n\n  _setBit (index) {\n    const bytePos = this._bytePosFor(index, false)\n    this._bitArrays[bytePos] |= (1 << (index - (bytePos * BITS_PER_BYTE)))\n  }\n\n  _unsetBit(index) {\n    const bytePos = this._bytePosFor(index, false)\n    this._bitArrays[bytePos] &= ~(1 << (index - (bytePos * BITS_PER_BYTE)))\n  }\n\n  _setInternalPos(pos, index, value, needsSort) {\n    const data =this._data\n    const elem = [index, value]\n    if (needsSort) {\n      this._sortData()\n      data[pos] = elem\n    } else {\n      // new element. just shove it into the array\n      // but be nice about where we shove it\n      // in order to make sorting it later easier\n      if (data.length) {\n        if (data[data.length - 1][0] >= index) {\n          data.push(elem)\n        } else if (data[0][0] <= index) {\n          data.unshift(elem)\n        } else {\n          const randomIndex = Math.round(data.length / 2)\n          this._data = data.slice(0, randomIndex).concat(elem).concat(data.slice(randomIndex))\n        }\n      } else {\n        this._data.push(elem)\n      }\n      this._changedData = true\n      this._changedLength = true\n    }\n  }\n\n  _unsetInternalPos (pos) {\n    this._data.splice(pos, 1)\n  }\n\n  _sortData () {\n    if (this._changedData) {\n      this._data.sort(sortInternal)\n    }\n\n    this._changedData = false\n  }\n\n  bitField () {\n    const bytes = []\n    let pendingBitsForResultingByte = 8\n    let pendingBitsForNewByte = 0\n    let resultingByte = 0\n    let newByte\n    const pending = this._bitArrays.slice()\n    while (pending.length || pendingBitsForNewByte) {\n      if (pendingBitsForNewByte === 0) {\n        newByte = pending.shift()\n        pendingBitsForNewByte = 7\n      }\n\n      const usingBits = Math.min(pendingBitsForNewByte, pendingBitsForResultingByte)\n      const mask = ~(0b11111111 << usingBits)\n      const masked = newByte & mask\n      resultingByte |= masked << (8 - pendingBitsForResultingByte)\n      newByte = newByte >>> usingBits\n      pendingBitsForNewByte -= usingBits\n      pendingBitsForResultingByte -= usingBits\n\n      if (!pendingBitsForResultingByte || (!pendingBitsForNewByte && !pending.length)) {\n        bytes.push(resultingByte)\n        resultingByte = 0\n        pendingBitsForResultingByte = 8\n      }\n    }\n\n    // remove trailing zeroes\n    for(var i = bytes.length - 1; i > 0; i--) {\n      const value = bytes[i]\n      if (value === 0) {\n        bytes.pop()\n      } else {\n        break\n      }\n    }\n\n    return bytes\n  }\n\n  compactArray () {\n    this._sortData()\n    return this._data.map(valueOnly)\n  }\n}\n\nfunction popCountReduce (count, byte) {\n  return count + popCount(byte)\n}\n\nfunction popCount(_v) {\n  let v = _v\n  v = v - ((v >> 1) & 0x55555555)                    // reuse input as temporary\n  v = (v & 0x33333333) + ((v >> 2) & 0x33333333)     // temp\n  return ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24\n}\n\nfunction sortInternal (a, b) {\n  return a[0] - b[0]\n}\n\nfunction valueOnly (elem) {\n  return elem[1]\n}","'use strict'\n\nconst ConsumableBuffer = require('./consumable-buffer')\nconst uint8ArrayConcat = require('uint8arrays/concat')\n\n/**\n * @param {(value: Uint8Array) => Promise<Uint8Array>} hashFn\n */\nfunction wrapHash (hashFn) {\n  /**\n   * @param {InfiniteHash | Uint8Array} value\n   */\n  function hashing (value) {\n    if (value instanceof InfiniteHash) {\n      // already a hash. return it\n      return value\n    } else {\n      return new InfiniteHash(value, hashFn)\n    }\n  }\n\n  return hashing\n}\n\nclass InfiniteHash {\n  /**\n   *\n   * @param {Uint8Array} value\n   * @param {(value: Uint8Array) => Promise<Uint8Array>} hashFn\n   */\n  constructor (value, hashFn) {\n    if (!(value instanceof Uint8Array)) {\n      throw new Error('can only hash Uint8Arrays')\n    }\n\n    this._value = value\n    this._hashFn = hashFn\n    this._depth = -1\n    this._availableBits = 0\n    this._currentBufferIndex = 0\n\n    /** @type {ConsumableBuffer[]} */\n    this._buffers = []\n  }\n\n  /**\n   * @param {number} bits\n   */\n  async take (bits) {\n    let pendingBits = bits\n\n    while (this._availableBits < pendingBits) {\n      await this._produceMoreBits()\n    }\n\n    let result = 0\n\n    while (pendingBits > 0) {\n      const hash = this._buffers[this._currentBufferIndex]\n      const available = Math.min(hash.availableBits(), pendingBits)\n      const took = hash.take(available)\n      result = (result << available) + took\n      pendingBits -= available\n      this._availableBits -= available\n\n      if (hash.availableBits() === 0) {\n        this._currentBufferIndex++\n      }\n    }\n\n    return result\n  }\n\n  /**\n   * @param {number} bits\n   */\n  untake (bits) {\n    let pendingBits = bits\n\n    while (pendingBits > 0) {\n      const hash = this._buffers[this._currentBufferIndex]\n      const availableForUntake = Math.min(hash.totalBits() - hash.availableBits(), pendingBits)\n      hash.untake(availableForUntake)\n      pendingBits -= availableForUntake\n      this._availableBits += availableForUntake\n\n      if (this._currentBufferIndex > 0 && hash.totalBits() === hash.availableBits()) {\n        this._depth--\n        this._currentBufferIndex--\n      }\n    }\n  }\n\n  async _produceMoreBits () {\n    this._depth++\n\n    const value = this._depth ? uint8ArrayConcat([this._value, Uint8Array.from([this._depth])]) : this._value\n    const hashValue = await this._hashFn(value)\n    const buffer = new ConsumableBuffer(hashValue)\n\n    this._buffers.push(buffer)\n    this._availableBits += buffer.availableBits()\n  }\n}\n\nmodule.exports = wrapHash\nmodule.exports.InfiniteHash = InfiniteHash\n","'use strict'\n\nconst START_MASKS = [\n  0b11111111,\n  0b11111110,\n  0b11111100,\n  0b11111000,\n  0b11110000,\n  0b11100000,\n  0b11000000,\n  0b10000000\n]\n\nconst STOP_MASKS = [\n  0b00000001,\n  0b00000011,\n  0b00000111,\n  0b00001111,\n  0b00011111,\n  0b00111111,\n  0b01111111,\n  0b11111111\n]\n\nmodule.exports = class ConsumableBuffer {\n  /**\n   * @param {Uint8Array} value\n   */\n  constructor (value) {\n    this._value = value\n    this._currentBytePos = value.length - 1\n    this._currentBitPos = 7\n  }\n\n  availableBits () {\n    return this._currentBitPos + 1 + this._currentBytePos * 8\n  }\n\n  totalBits () {\n    return this._value.length * 8\n  }\n\n  /**\n   * @param {number} bits\n   */\n  take (bits) {\n    let pendingBits = bits\n    let result = 0\n    while (pendingBits && this._haveBits()) {\n      const byte = this._value[this._currentBytePos]\n      const availableBits = this._currentBitPos + 1\n      const taking = Math.min(availableBits, pendingBits)\n      const value = byteBitsToInt(byte, availableBits - taking, taking)\n      result = (result << taking) + value\n\n      pendingBits -= taking\n\n      this._currentBitPos -= taking\n      if (this._currentBitPos < 0) {\n        this._currentBitPos = 7\n        this._currentBytePos--\n      }\n    }\n\n    return result\n  }\n\n  /**\n   * @param {number} bits\n   */\n  untake (bits) {\n    this._currentBitPos += bits\n    while (this._currentBitPos > 7) {\n      this._currentBitPos -= 8\n      this._currentBytePos += 1\n    }\n  }\n\n  _haveBits () {\n    return this._currentBytePos >= 0\n  }\n}\n\n/**\n * @param {number} byte\n * @param {number} start\n * @param {number} length\n */\nfunction byteBitsToInt (byte, start, length) {\n  const mask = maskFor(start, length)\n  return (byte & mask) >>> start\n}\n\n/**\n * @param {number} start\n * @param {number} length\n */\nfunction maskFor (start, length) {\n  return START_MASKS[start] & STOP_MASKS[Math.min(length + start - 1, 7)]\n}\n","'use strict'\n\nconst toPathComponents = (path = '') => {\n  // split on / unless escaped with \\\n  return (path\n    .trim()\n    .match(/([^\\\\^/]|\\\\\\/)+/g) || [])\n    .filter(Boolean)\n}\n\nmodule.exports = toPathComponents\n","'use strict'\n\nconst normaliseContent = require('./normalise-content')\nconst normaliseInput = require('./normalise-input')\n\n/**\n * @typedef {import('ipfs-core-types/src/utils').ImportCandidateStream} ImportCandidateStream\n * @typedef {import('ipfs-unixfs-importer').ImportCandidate} ImportCandidate\n */\n\n/**\n * Transforms any of the `ipfs.add` input types into\n *\n * ```\n * AsyncIterable<{ path, mode, mtime, content: AsyncIterable<Uint8Array> }>\n * ```\n *\n * See https://github.com/ipfs/js-ipfs/blob/master/docs/core-api/FILES.md#ipfsadddata-options\n *\n * @param {ImportCandidateStream} input\n * @returns {AsyncGenerator<ImportCandidate, void, undefined>}\n */\nmodule.exports = (input) => normaliseInput(input, normaliseContent)\n","'use strict'\n\nconst errCode = require('err-code')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst browserStreamToIt = require('browser-readablestream-to-it')\nconst blobToIt = require('blob-to-it')\nconst itPeekable = require('it-peekable')\nconst all = require('it-all')\nconst map = require('it-map')\nconst {\n  isBytes,\n  isReadableStream,\n  isBlob\n} = require('./utils')\n\n/**\n * @param {import('./normalise-input').ToContent} input\n */\nasync function * toAsyncIterable (input) {\n  // Bytes | String\n  if (isBytes(input)) {\n    yield toBytes(input)\n    return\n  }\n\n  if (typeof input === 'string' || input instanceof String) {\n    yield toBytes(input.toString())\n    return\n  }\n\n  // Blob\n  if (isBlob(input)) {\n    yield * blobToIt(input)\n    return\n  }\n\n  // Browser stream\n  if (isReadableStream(input)) {\n    input = browserStreamToIt(input)\n  }\n\n  // (Async)Iterator<?>\n  if (Symbol.iterator in input || Symbol.asyncIterator in input) {\n    /** @type {any} peekable */\n    const peekable = itPeekable(input)\n\n    /** @type {any} value */\n    const { value, done } = await peekable.peek()\n\n    if (done) {\n      // make sure empty iterators result in empty files\n      yield * []\n      return\n    }\n\n    peekable.push(value)\n\n    // (Async)Iterable<Number>\n    if (Number.isInteger(value)) {\n      yield Uint8Array.from((await all(peekable)))\n      return\n    }\n\n    // (Async)Iterable<Bytes|String>\n    if (isBytes(value) || typeof value === 'string' || value instanceof String) {\n      yield * map(peekable, toBytes)\n      return\n    }\n  }\n\n  throw errCode(new Error(`Unexpected input: ${input}`), 'ERR_UNEXPECTED_INPUT')\n}\n\n/**\n * @param {ArrayBuffer | ArrayBufferView | string | InstanceType<typeof window.String> | number[]} chunk\n */\nfunction toBytes (chunk) {\n  if (chunk instanceof Uint8Array) {\n    return chunk\n  }\n\n  if (ArrayBuffer.isView(chunk)) {\n    return new Uint8Array(chunk.buffer, chunk.byteOffset, chunk.byteLength)\n  }\n\n  if (chunk instanceof ArrayBuffer) {\n    return new Uint8Array(chunk)\n  }\n\n  if (Array.isArray(chunk)) {\n    return Uint8Array.from(chunk)\n  }\n\n  return uint8ArrayFromString(chunk.toString())\n}\n\nmodule.exports = toAsyncIterable\n","'use strict'\n\n/**\n * Turns a browser readable stream into an async iterable. Async iteration over\n * returned iterable will lock give stream, preventing any other consumer from\n * acquiring a reader. The lock will be released if iteration loop is broken. To\n * prevent stream cancelling optional `{ preventCancel: true }` could be passed\n * as a second argument.\n * @template T\n * @param {ReadableStream<T>} stream\n * @param {Object} [options]\n * @param {boolean} [options.preventCancel=boolean]\n * @returns {AsyncIterable<T>}\n */\nasync function * browserReadableStreamToIt (stream, options = {}) {\n  const reader = stream.getReader()\n\n  try {\n    while (true) {\n      const result = await reader.read()\n\n      if (result.done) {\n        return\n      }\n\n      yield result.value\n    }\n  } finally {\n    if (options.preventCancel !== true) {\n      reader.cancel()\n    }\n\n    reader.releaseLock()\n  }\n}\n\nmodule.exports = browserReadableStreamToIt\n","/* eslint-env browser */\n\n'use strict'\n\nconst browserReadableStreamToIt = require('browser-readablestream-to-it')\n\n/**\n * @param {Blob} blob\n * @returns {AsyncIterable<Uint8Array>}\n */\nfunction blobToIt (blob) {\n  if (typeof blob.stream === 'function') {\n    return browserReadableStreamToIt(blob.stream())\n  }\n\n  // firefox < 69 does not support blob.stream()\n  // @ts-ignore - response.body is optional, but in practice it's a stream.\n  return browserReadableStreamToIt(new Response(blob).body)\n}\n\nmodule.exports = blobToIt\n","'use strict'\n\n/**\n * @template T\n * @typedef {Object} Peek\n * @property {() => IteratorResult<T, void>} peek\n */\n\n/**\n * @template T\n * @typedef {Object} AsyncPeek\n * @property {() => Promise<IteratorResult<T, void>>} peek\n */\n\n/**\n * @template T\n * @typedef {Object} Push\n * @property {(value:T) => void} push\n */\n\n/**\n * @template T\n * @typedef {Iterable<T> & Peek<T> & Push<T> & Iterator<T>} Peekable<T>\n */\n\n/**\n * @template T\n * @typedef {AsyncIterable<T> & AsyncPeek<T> & Push<T> & AsyncIterator<T>} AsyncPeekable<T>\n */\n\n/**\n * @template {Iterable<any> | AsyncIterable<any>} I\n * @param {I} iterable\n * @returns {I extends Iterable<infer T>\n *  ? Peekable<T>\n *  : I extends AsyncIterable<infer T>\n *  ? AsyncPeekable<T>\n *  : never\n * }\n */\nfunction peekableIterator (iterable) {\n  // @ts-ignore\n  const [iterator, symbol] = iterable[Symbol.asyncIterator]\n    // @ts-ignore\n    ? [iterable[Symbol.asyncIterator](), Symbol.asyncIterator]\n    // @ts-ignore\n    : [iterable[Symbol.iterator](), Symbol.iterator]\n\n  /** @type {any[]} */\n  const queue = []\n\n  // @ts-ignore\n  return {\n    peek: () => {\n      return iterator.next()\n    },\n    push: (value) => {\n      queue.push(value)\n    },\n    next: () => {\n      if (queue.length) {\n        return {\n          done: false,\n          value: queue.shift()\n        }\n      }\n\n      return iterator.next()\n    },\n    [symbol] () {\n      return this\n    }\n  }\n}\n\nmodule.exports = peekableIterator\n","'use strict'\n\nconst { Blob } = globalThis\n\n/**\n * @param {any} obj\n * @returns {obj is ArrayBufferView|ArrayBuffer}\n */\nfunction isBytes (obj) {\n  return ArrayBuffer.isView(obj) || obj instanceof ArrayBuffer\n}\n\n/**\n * @param {any} obj\n * @returns {obj is Blob}\n */\nfunction isBlob (obj) {\n  return typeof Blob !== 'undefined' && obj instanceof Blob\n}\n\n/**\n * An object with a path or content property\n *\n * @param {any} obj\n * @returns {obj is import('ipfs-core-types/src/utils').ImportCandidate}\n */\nfunction isFileObject (obj) {\n  return typeof obj === 'object' && (obj.path || obj.content)\n}\n\n/**\n * @param {any} value\n * @returns {value is ReadableStream}\n */\nconst isReadableStream = (value) =>\n  value && typeof value.getReader === 'function'\n\nmodule.exports = {\n  isBytes,\n  isBlob,\n  isFileObject,\n  isReadableStream\n}\n","'use strict'\n\nconst errCode = require('err-code')\nconst browserStreamToIt = require('browser-readablestream-to-it')\nconst itPeekable = require('it-peekable')\nconst map = require('it-map')\nconst {\n  isBytes,\n  isBlob,\n  isReadableStream,\n  isFileObject\n} = require('./utils')\nconst {\n  parseMtime,\n  parseMode\n} = require('ipfs-unixfs')\n\n/**\n * @typedef {import('ipfs-core-types/src/utils').ToContent} ToContent\n * @typedef {import('ipfs-unixfs-importer').ImportCandidate} ImporterImportCandidate\n * @typedef {import('ipfs-core-types/src/utils').ImportCandidate} ImportCandidate\n */\n\n/**\n * @param {import('ipfs-core-types/src/utils').ImportCandidateStream} input\n * @param {(content:ToContent) => AsyncIterable<Uint8Array>} normaliseContent\n */\n// eslint-disable-next-line complexity\nmodule.exports = async function * normaliseInput (input, normaliseContent) {\n  if (input === null || input === undefined) {\n    return\n  }\n\n  // String\n  if (typeof input === 'string' || input instanceof String) {\n    yield toFileObject(input.toString(), normaliseContent)\n    return\n  }\n\n  // Uint8Array|ArrayBuffer|TypedArray\n  // Blob|File\n  if (isBytes(input) || isBlob(input)) {\n    yield toFileObject(input, normaliseContent)\n    return\n  }\n\n  // Browser ReadableStream\n  if (isReadableStream(input)) {\n    input = browserStreamToIt(input)\n  }\n\n  // Iterable<?>\n  if (Symbol.iterator in input || Symbol.asyncIterator in input) {\n    /** @type {any} peekable */\n    const peekable = itPeekable(input)\n\n    /** @type {any} value **/\n    const { value, done } = await peekable.peek()\n\n    if (done) {\n      // make sure empty iterators result in empty files\n      yield * []\n      return\n    }\n\n    peekable.push(value)\n\n    // (Async)Iterable<Number>\n    // (Async)Iterable<Bytes>\n    if (Number.isInteger(value) || isBytes(value)) {\n      yield toFileObject(peekable, normaliseContent)\n      return\n    }\n\n    // (Async)Iterable<Blob>\n    // (Async)Iterable<String>\n    // (Async)Iterable<{ path, content }>\n    if (isFileObject(value) || isBlob(value) || typeof value === 'string' || value instanceof String) {\n      yield * map(peekable, (/** @type {ImportCandidate} */ value) => toFileObject(value, normaliseContent))\n      return\n    }\n\n    // (Async)Iterable<(Async)Iterable<?>>\n    // (Async)Iterable<ReadableStream<?>>\n    // ReadableStream<(Async)Iterable<?>>\n    // ReadableStream<ReadableStream<?>>\n    if (value[Symbol.iterator] || value[Symbol.asyncIterator] || isReadableStream(value)) {\n      yield * map(peekable, (/** @type {ImportCandidate} */ value) => toFileObject(value, normaliseContent))\n      return\n    }\n  }\n\n  // { path, content: ? }\n  // Note: Detected _after_ (Async)Iterable<?> because Node.js streams have a\n  // `path` property that passes this check.\n  if (isFileObject(input)) {\n    yield toFileObject(input, normaliseContent)\n    return\n  }\n\n  throw errCode(new Error('Unexpected input: ' + typeof input), 'ERR_UNEXPECTED_INPUT')\n}\n\n/**\n * @param {ImportCandidate} input\n * @param {(content:ToContent) => AsyncIterable<Uint8Array>} normaliseContent\n */\nasync function toFileObject (input, normaliseContent) {\n  // @ts-ignore - Those properties don't exist on most input types\n  const { path, mode, mtime, content } = input\n\n  /** @type {ImporterImportCandidate} */\n  const file = {\n    path: path || '',\n    mode: parseMode(mode),\n    mtime: parseMtime(mtime)\n  }\n\n  if (content) {\n    file.content = await normaliseContent(content)\n  } else if (!path) { // Not already a file object with path or content prop\n    // @ts-ignore - input still can be different ToContent\n    file.content = await normaliseContent(input)\n  }\n\n  return file\n}\n","'use strict'\n\n/**\n * @typedef {Object} FixedChunkerOptions\n * @property {'fixed'} chunker\n * @property {number} [maxChunkSize]\n *\n * @typedef {Object} RabinChunkerOptions\n * @property {'rabin'} chunker\n * @property {number} avgChunkSize\n * @property {number} [minChunkSize]\n * @property {number} [maxChunkSize]\n *\n * @typedef {FixedChunkerOptions|RabinChunkerOptions} ChunkerOptions\n *\n * Parses chunker string into options used by DAGBuilder in ipfs-unixfs-engine\n *\n *\n * @param  {string} [chunker] - Chunker algorithm supported formats:\n * \"size-{size}\"\n * \"rabin\"\n * \"rabin-{avg}\"\n * \"rabin-{min}-{avg}-{max}\"\n *\n * @returns {ChunkerOptions}   Chunker options for DAGBuilder\n */\nconst parseChunkerString = (chunker) => {\n  if (!chunker) {\n    return {\n      chunker: 'fixed'\n    }\n  } else if (chunker.startsWith('size-')) {\n    const sizeStr = chunker.split('-')[1]\n    const size = parseInt(sizeStr)\n    if (isNaN(size)) {\n      throw new Error('Chunker parameter size must be an integer')\n    }\n    return {\n      chunker: 'fixed',\n      maxChunkSize: size\n    }\n  } else if (chunker.startsWith('rabin')) {\n    return {\n      chunker: 'rabin',\n      ...parseRabinString(chunker)\n    }\n  } else {\n    throw new Error(`Unrecognized chunker option: ${chunker}`)\n  }\n}\n\n/**\n * @typedef {Object} RabinChunkerSettings\n * @property {number} avgChunkSize\n * @property {number} [minChunkSize]\n * @property {number} [maxChunkSize]\n *\n * Parses rabin chunker string\n *\n * @param  {string}   chunker - Chunker algorithm supported formats:\n * \"rabin\"\n * \"rabin-{avg}\"\n * \"rabin-{min}-{avg}-{max}\"\n *\n * @returns {RabinChunkerSettings}   rabin chunker options\n */\nconst parseRabinString = (chunker) => {\n  const options = {}\n  const parts = chunker.split('-')\n  switch (parts.length) {\n    case 1:\n      options.avgChunkSize = 262144\n      break\n    case 2:\n      options.avgChunkSize = parseChunkSize(parts[1], 'avg')\n      break\n    case 4:\n      options.minChunkSize = parseChunkSize(parts[1], 'min')\n      options.avgChunkSize = parseChunkSize(parts[2], 'avg')\n      options.maxChunkSize = parseChunkSize(parts[3], 'max')\n      break\n    default:\n      throw new Error('Incorrect chunker format (expected \"rabin\" \"rabin-[avg]\" or \"rabin-[min]-[avg]-[max]\"')\n  }\n\n  return options\n}\n\n/**\n *\n * @param {string} str\n * @param {string} name\n * @returns {number}\n */\nconst parseChunkSize = (str, name) => {\n  const size = parseInt(str)\n  if (isNaN(size)) {\n    throw new Error(`Chunker parameter ${name} must be an integer`)\n  }\n\n  return size\n}\n\nmodule.exports = {\n  parseChunkSize,\n  parseRabinString,\n  parseChunkerString\n}\n","'use strict'\n\nconst { exporter } = require('ipfs-unixfs-exporter')\nconst { normalizeCidPath } = require('../utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst CID = require('cids')\n\n/**\n * @typedef {Object} Context\n * @property {import('ipld')} ipld\n * @property {import('../types').Preload} preload\n *\n * @param {Context} context\n */\nmodule.exports = function ({ ipld, preload }) {\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"cat\"]}\n   */\n  async function * cat (ipfsPath, options = {}) {\n    ipfsPath = normalizeCidPath(ipfsPath)\n\n    if (options.preload !== false) {\n      const pathComponents = ipfsPath.split('/')\n      preload(new CID(pathComponents[0]))\n    }\n\n    const file = await exporter(ipfsPath, ipld, options)\n\n    // File may not have unixfs prop if small & imported with rawLeaves true\n    if (file.type === 'directory') {\n      throw new Error('this dag node is a directory')\n    }\n\n    if (!file.content) {\n      throw new Error('this dag node has no content')\n    }\n\n    yield * file.content(options)\n  }\n\n  return withTimeoutOption(cat)\n}\n","'use strict'\n\nconst errCode = require('err-code')\nconst CID = require('cids')\nconst resolve = require('./resolvers')\nconst last = require('it-last')\n\n/**\n * @typedef {import('ipfs-unixfs').UnixFS} UnixFS\n * @typedef {import('ipld-dag-pb').DAGNode} DAGNode\n * @typedef {import('ipld')} IPLD\n * @typedef {import('./types').ExporterOptions} ExporterOptions\n * @typedef {import('./types').UnixFSFile} UnixFSFile\n * @typedef {import('./types').UnixFSDirectory} UnixFSDirectory\n * @typedef {import('./types').ObjectNode} ObjectNode\n * @typedef {import('./types').RawNode} RawNode\n * @typedef {import('./types').IdentityNode} IdentityNode\n * @typedef {import('./types').UnixFSEntry} UnixFSEntry\n */\n\nconst toPathComponents = (path = '') => {\n  // split on / unless escaped with \\\n  return (path\n    .trim()\n    .match(/([^\\\\^/]|\\\\\\/)+/g) || [])\n    .filter(Boolean)\n}\n\n/**\n * @param {string|Uint8Array|CID} path\n */\nconst cidAndRest = (path) => {\n  if (path instanceof Uint8Array) {\n    return {\n      cid: new CID(path),\n      toResolve: []\n    }\n  }\n\n  if (CID.isCID(path)) {\n    return {\n      cid: path,\n      toResolve: []\n    }\n  }\n\n  if (typeof path === 'string') {\n    if (path.indexOf('/ipfs/') === 0) {\n      path = path.substring(6)\n    }\n\n    const output = toPathComponents(path)\n\n    return {\n      cid: new CID(output[0]),\n      toResolve: output.slice(1)\n    }\n  }\n\n  throw errCode(new Error(`Unknown path type ${path}`), 'ERR_BAD_PATH')\n}\n\n/**\n * @param {string | CID} path\n * @param {IPLD} ipld\n * @param {ExporterOptions} [options]\n */\nasync function * walkPath (path, ipld, options = {}) {\n  let {\n    cid,\n    toResolve\n  } = cidAndRest(path)\n  let name = cid.toString()\n  let entryPath = name\n  const startingDepth = toResolve.length\n\n  while (true) {\n    const result = await resolve(cid, name, entryPath, toResolve, startingDepth, ipld, options)\n\n    if (!result.entry && !result.next) {\n      throw errCode(new Error(`Could not resolve ${path}`), 'ERR_NOT_FOUND')\n    }\n\n    if (result.entry) {\n      yield result.entry\n    }\n\n    if (!result.next) {\n      return\n    }\n\n    // resolve further parts\n    toResolve = result.next.toResolve\n    cid = result.next.cid\n    name = result.next.name\n    entryPath = result.next.path\n  }\n}\n\n/**\n * @param {string | CID} path\n * @param {IPLD} ipld\n * @param {ExporterOptions} [options]\n */\nasync function exporter (path, ipld, options = {}) {\n  const result = await last(walkPath(path, ipld, options))\n\n  if (!result) {\n    throw errCode(new Error(`Could not resolve ${path}`), 'ERR_NOT_FOUND')\n  }\n\n  return result\n}\n\n/**\n * @param {string | CID} path\n * @param {IPLD} ipld\n * @param {ExporterOptions} [options]\n */\nasync function * recursive (path, ipld, options = {}) {\n  const node = await exporter(path, ipld, options)\n\n  if (!node) {\n    return\n  }\n\n  yield node\n\n  if (node.type === 'directory') {\n    for await (const child of recurse(node, options)) {\n      yield child\n    }\n  }\n\n  /**\n   * @param {UnixFSDirectory} node\n   * @param {ExporterOptions} options\n   * @returns {AsyncGenerator<UnixFSEntry, void, any>}\n   */\n  async function * recurse (node, options) {\n    for await (const file of node.content(options)) {\n      yield file\n\n      if (file instanceof Uint8Array) {\n        continue\n      }\n\n      if (file.type === 'directory') {\n        yield * recurse(file, options)\n      }\n    }\n  }\n}\n\nmodule.exports = {\n  exporter,\n  walkPath,\n  recursive\n}\n","'use strict'\n\nconst errCode = require('err-code')\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('ipld')} IPLD\n * @typedef {import('../types').ExporterOptions} ExporterOptions\n * @typedef {import('../types').UnixFSEntry} UnixFSEntry\n * @typedef {import('../types').Resolver} Resolver\n * @typedef {import('../types').Resolve} Resolve\n */\n\n/**\n * @type {{ [ key: string ]: Resolver }}\n */\nconst resolvers = {\n  'dag-pb': require('./unixfs-v1'),\n  raw: require('./raw'),\n  'dag-cbor': require('./dag-cbor'),\n  identity: require('./identity')\n}\n\n/**\n * @type {Resolve}\n */\nfunction resolve (cid, name, path, toResolve, depth, ipld, options) {\n  const resolver = resolvers[cid.codec]\n\n  if (!resolver) {\n    throw errCode(new Error(`No resolver for codec ${cid.codec}`), 'ERR_NO_RESOLVER')\n  }\n\n  return resolver(cid, name, path, toResolve, resolve, depth, ipld, options)\n}\n\nmodule.exports = resolve\n","'use strict'\n\nconst errCode = require('err-code')\nconst { UnixFS } = require('ipfs-unixfs')\nconst findShardCid = require('../../utils/find-cid-in-shard')\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('ipld')} IPLD\n * @typedef {import('ipld-dag-pb').DAGNode} DAGNode\n * @typedef {import('../../types').ExporterOptions} ExporterOptions\n * @typedef {import('../../types').UnixFSEntry} UnixFSEntry\n * @typedef {import('../../types').Resolve} Resolve\n * @typedef {import('../../types').Resolver} Resolver\n * @typedef {import('../../types').UnixfsV1Resolver} UnixfsV1Resolver\n */\n\n/**\n * @param {import('ipld-dag-pb').DAGNode} node\n * @param {string} name\n */\nconst findLinkCid = (node, name) => {\n  const link = node.Links.find(link => link.Name === name)\n\n  return link && link.Hash\n}\n\n/**\n * @type {{ [key: string]: UnixfsV1Resolver }}\n */\nconst contentExporters = {\n  raw: require('./content/file'),\n  file: require('./content/file'),\n  directory: require('./content/directory'),\n  'hamt-sharded-directory': require('./content/hamt-sharded-directory'),\n  metadata: (cid, node, unixfs, path, resolve, depth, ipld) => {\n    return () => []\n  },\n  symlink: (cid, node, unixfs, path, resolve, depth, ipld) => {\n    return () => []\n  }\n}\n\n/**\n * @type {Resolver}\n */\nconst unixFsResolver = async (cid, name, path, toResolve, resolve, depth, ipld, options) => {\n  const node = await ipld.get(cid, options)\n  let unixfs\n  let next\n\n  if (!name) {\n    name = cid.toString()\n  }\n\n  try {\n    unixfs = UnixFS.unmarshal(node.Data)\n  } catch (err) {\n    // non-UnixFS dag-pb node? It could happen.\n    throw errCode(err, 'ERR_NOT_UNIXFS')\n  }\n\n  if (!path) {\n    path = name\n  }\n\n  if (toResolve.length) {\n    let linkCid\n\n    if (unixfs && unixfs.type === 'hamt-sharded-directory') {\n      // special case - unixfs v1 hamt shards\n      linkCid = await findShardCid(node, toResolve[0], ipld)\n    } else {\n      linkCid = findLinkCid(node, toResolve[0])\n    }\n\n    if (!linkCid) {\n      throw errCode(new Error('file does not exist'), 'ERR_NOT_FOUND')\n    }\n\n    // remove the path component we have resolved\n    const nextName = toResolve.shift()\n    const nextPath = `${path}/${nextName}`\n\n    next = {\n      cid: linkCid,\n      toResolve,\n      name: nextName || '',\n      path: nextPath\n    }\n  }\n\n  return {\n    entry: {\n      type: unixfs.isDirectory() ? 'directory' : 'file',\n      name,\n      path,\n      cid,\n      // @ts-ignore\n      content: contentExporters[unixfs.type](cid, node, unixfs, path, resolve, depth, ipld),\n      unixfs,\n      depth,\n      node,\n      size: unixfs.fileSize()\n    },\n    next\n  }\n}\n\nmodule.exports = unixFsResolver\n","'use strict'\n\nconst { Bucket, createHAMT } = require('hamt-sharding')\nconst multihashing = require('multihashing-async')\n\n/**\n * @typedef {import('../types').ExporterOptions} ExporterOptions\n * @typedef {import('ipld')} IPLD\n * @typedef {import('cids')} CID\n */\n\n// FIXME: this is copy/pasted from ipfs-unixfs-importer/src/dir-sharded.js\n/**\n * @param {Uint8Array} buf\n */\nconst hashFn = async function (buf) {\n  const hash = await multihashing(buf, 'murmur3-128')\n\n  // Multihashing inserts preamble of 2 bytes. Remove it.\n  // Also, murmur3 outputs 128 bit but, accidentally, IPFS Go's\n  // implementation only uses the first 64, so we must do the same\n  // for parity..\n  const justHash = hash.slice(2, 10)\n  const length = justHash.length\n  const result = new Uint8Array(length)\n  // TODO: invert buffer because that's how Go impl does it\n  for (let i = 0; i < length; i++) {\n    result[length - i - 1] = justHash[i]\n  }\n\n  return result\n}\n\n/**\n * @param {import('ipld-dag-pb').DAGLink[]} links\n * @param {Bucket<boolean>} bucket\n * @param {Bucket<boolean>} rootBucket\n */\nconst addLinksToHamtBucket = (links, bucket, rootBucket) => {\n  return Promise.all(\n    links.map(link => {\n      if (link.Name.length === 2) {\n        const pos = parseInt(link.Name, 16)\n\n        return bucket._putObjectAt(pos, new Bucket({\n          hash: rootBucket._options.hash,\n          bits: rootBucket._options.bits\n        }, bucket, pos))\n      }\n\n      return rootBucket.put(link.Name.substring(2), true)\n    })\n  )\n}\n\n/**\n * @param {number} position\n */\nconst toPrefix = (position) => {\n  return position\n    .toString(16)\n    .toUpperCase()\n    .padStart(2, '0')\n    .substring(0, 2)\n}\n\n/**\n * @param {import('hamt-sharding').Bucket.BucketPosition<boolean>} position\n */\nconst toBucketPath = (position) => {\n  let bucket = position.bucket\n  const path = []\n\n  while (bucket._parent) {\n    path.push(bucket)\n\n    bucket = bucket._parent\n  }\n\n  path.push(bucket)\n\n  return path.reverse()\n}\n\n/**\n * @typedef {object} ShardTraversalContext\n * @property {number} hamtDepth\n * @property {Bucket<boolean>} rootBucket\n * @property {Bucket<boolean>} lastBucket\n *\n * @param {import('ipld-dag-pb').DAGNode} node\n * @param {string} name\n * @param {IPLD} ipld\n * @param {ShardTraversalContext} [context]\n * @param {ExporterOptions} [options]\n * @returns {Promise<CID|null>}\n */\nconst findShardCid = async (node, name, ipld, context, options) => {\n  if (!context) {\n    const rootBucket = createHAMT({\n      hashFn\n    })\n\n    context = {\n      rootBucket,\n      hamtDepth: 1,\n      lastBucket: rootBucket\n    }\n  }\n\n  await addLinksToHamtBucket(node.Links, context.lastBucket, context.rootBucket)\n\n  const position = await context.rootBucket._findNewBucketAndPos(name)\n  let prefix = toPrefix(position.pos)\n  const bucketPath = toBucketPath(position)\n\n  if (bucketPath.length > context.hamtDepth) {\n    context.lastBucket = bucketPath[context.hamtDepth]\n\n    prefix = toPrefix(context.lastBucket._posAtParent)\n  }\n\n  const link = node.Links.find(link => {\n    const entryPrefix = link.Name.substring(0, 2)\n    const entryName = link.Name.substring(2)\n\n    if (entryPrefix !== prefix) {\n      // not the entry or subshard we're looking for\n      return false\n    }\n\n    if (entryName && entryName !== name) {\n      // not the entry we're looking for\n      return false\n    }\n\n    return true\n  })\n\n  if (!link) {\n    return null\n  }\n\n  if (link.Name.substring(2) === name) {\n    return link.Hash\n  }\n\n  context.hamtDepth++\n\n  node = await ipld.get(link.Hash, options)\n\n  return findShardCid(node, name, ipld, context, options)\n}\n\nmodule.exports = findShardCid\n","'use strict'\n\nconst extractDataFromBlock = require('../../../utils/extract-data-from-block')\nconst validateOffsetAndLength = require('../../../utils/validate-offset-and-length')\nconst { UnixFS } = require('ipfs-unixfs')\nconst errCode = require('err-code')\n\n/**\n * @typedef {import('../../../types').ExporterOptions} ExporterOptions\n * @typedef {import('ipld')} IPLD\n * @typedef {import('ipld-dag-pb').DAGNode} DAGNode\n */\n\n/**\n * @param {IPLD} ipld\n * @param {DAGNode} node\n * @param {number} start\n * @param {number} end\n * @param {number} streamPosition\n * @param {ExporterOptions} options\n * @returns {AsyncIterable<Uint8Array>}\n */\nasync function * emitBytes (ipld, node, start, end, streamPosition = 0, options) {\n  // a `raw` node\n  if (node instanceof Uint8Array) {\n    const buf = extractDataFromBlock(node, streamPosition, start, end)\n\n    if (buf.length) {\n      yield buf\n    }\n\n    streamPosition += buf.length\n\n    return streamPosition\n  }\n\n  let file\n\n  try {\n    file = UnixFS.unmarshal(node.Data)\n  } catch (err) {\n    throw errCode(err, 'ERR_NOT_UNIXFS')\n  }\n\n  // might be a unixfs `raw` node or have data on intermediate nodes\n  if (file.data && file.data.length) {\n    const buf = extractDataFromBlock(file.data, streamPosition, start, end)\n\n    if (buf.length) {\n      yield buf\n    }\n\n    streamPosition += file.data.length\n  }\n\n  let childStart = streamPosition\n\n  // work out which child nodes contain the requested data\n  for (let i = 0; i < node.Links.length; i++) {\n    const childLink = node.Links[i]\n    const childEnd = streamPosition + file.blockSizes[i]\n\n    if ((start >= childStart && start < childEnd) || // child has offset byte\n        (end > childStart && end <= childEnd) || // child has end byte\n        (start < childStart && end > childEnd)) { // child is between offset and end bytes\n      const child = await ipld.get(childLink.Hash, {\n        signal: options.signal\n      })\n\n      for await (const buf of emitBytes(ipld, child, start, end, streamPosition, options)) {\n        streamPosition += buf.length\n\n        yield buf\n      }\n    }\n\n    streamPosition = childEnd\n    childStart = childEnd + 1\n  }\n}\n\n/**\n * @type {import('../').UnixfsV1Resolver}\n */\nconst fileContent = (cid, node, unixfs, path, resolve, depth, ipld) => {\n  /**\n   * @param {ExporterOptions} options\n   */\n  function yieldFileContent (options = {}) {\n    const fileSize = unixfs.fileSize()\n\n    if (fileSize === undefined) {\n      throw new Error('File was a directory')\n    }\n\n    const {\n      offset,\n      length\n    } = validateOffsetAndLength(fileSize, options.offset, options.length)\n\n    const start = offset\n    const end = offset + length\n\n    return emitBytes(ipld, node, start, end, 0, options)\n  }\n\n  return yieldFileContent\n}\n\nmodule.exports = fileContent\n","'use strict'\n\n/**\n * @param {Uint8Array} block\n * @param {number} blockStart\n * @param {number} requestedStart\n * @param {number} requestedEnd\n */\nmodule.exports = function extractDataFromBlock (block, blockStart, requestedStart, requestedEnd) {\n  const blockLength = block.length\n  const blockEnd = blockStart + blockLength\n\n  if (requestedStart >= blockEnd || requestedEnd < blockStart) {\n    // If we are looking for a byte range that is starts after the start of the block,\n    // return an empty block.  This can happen when internal nodes contain data\n    return new Uint8Array(0)\n  }\n\n  if (requestedEnd >= blockStart && requestedEnd < blockEnd) {\n    // If the end byte is in the current block, truncate the block to the end byte\n    block = block.slice(0, requestedEnd - blockStart)\n  }\n\n  if (requestedStart >= blockStart && requestedStart < blockEnd) {\n    // If the start byte is in the current block, skip to the start byte\n    block = block.slice(requestedStart - blockStart)\n  }\n\n  return block\n}\n","'use strict'\n\nconst errCode = require('err-code')\n\n/**\n * @param {number} size\n * @param {number} [offset]\n * @param {number} [length]\n */\nconst validateOffsetAndLength = (size, offset, length) => {\n  if (!offset) {\n    offset = 0\n  }\n\n  if (offset < 0) {\n    throw errCode(new Error('Offset must be greater than or equal to 0'), 'ERR_INVALID_PARAMS')\n  }\n\n  if (offset > size) {\n    throw errCode(new Error('Offset must be less than the file size'), 'ERR_INVALID_PARAMS')\n  }\n\n  if (!length && length !== 0) {\n    length = size - offset\n  }\n\n  if (length < 0) {\n    throw errCode(new Error('Length must be greater than or equal to 0'), 'ERR_INVALID_PARAMS')\n  }\n\n  if (offset + length > size) {\n    length = size - offset\n  }\n\n  return {\n    offset,\n    length\n  }\n}\n\nmodule.exports = validateOffsetAndLength\n","'use strict'\n\n/**\n * @typedef {import('../../../types').ExporterOptions} ExporterOptions\n * @typedef {import('../../../types').UnixfsV1DirectoryContent} UnixfsV1DirectoryContent\n * @typedef {import('../../../types').UnixfsV1Resolver} UnixfsV1Resolver\n */\n\n/**\n * @type {UnixfsV1Resolver}\n */\nconst directoryContent = (cid, node, unixfs, path, resolve, depth, ipld) => {\n  /**\n   * @param {ExporterOptions} [options]\n   * @returns {UnixfsV1DirectoryContent}\n   */\n  async function * yieldDirectoryContent (options = {}) {\n    const offset = options.offset || 0\n    const length = options.length || node.Links.length\n    const links = node.Links.slice(offset, length)\n\n    for (const link of links) {\n      const result = await resolve(link.Hash, link.Name, `${path}/${link.Name}`, [], depth + 1, ipld, options)\n\n      if (result.entry) {\n        yield result.entry\n      }\n    }\n  }\n\n  return yieldDirectoryContent\n}\n\nmodule.exports = directoryContent\n","'use strict'\n\n/**\n * @typedef {import('ipld-dag-pb').DAGNode} DAGNode\n * @typedef {import('ipld')} IPLD\n * @typedef {import('../../../types').ExporterOptions} ExporterOptions\n * @typedef {import('../../../types').Resolve} Resolve\n * @typedef {import('../../../types').UnixfsV1DirectoryContent} UnixfsV1DirectoryContent\n * @typedef {import('../../../types').UnixfsV1Resolver} UnixfsV1Resolver\n */\n\n/**\n * @type {UnixfsV1Resolver}\n */\nconst hamtShardedDirectoryContent = (cid, node, unixfs, path, resolve, depth, ipld) => {\n  /**\n   * @param {ExporterOptions} options\n   *\n   */\n  function yieldHamtDirectoryContent (options = {}) {\n    return listDirectory(node, path, resolve, depth, ipld, options)\n  }\n\n  return yieldHamtDirectoryContent\n}\n\n/**\n * @param {DAGNode} node\n * @param {string} path\n * @param {Resolve} resolve\n * @param {number} depth\n * @param {IPLD} ipld\n * @param {ExporterOptions} options\n *\n * @returns {UnixfsV1DirectoryContent}\n */\nasync function * listDirectory (node, path, resolve, depth, ipld, options) {\n  const links = node.Links\n\n  for (const link of links) {\n    const name = link.Name.substring(2)\n\n    if (name) {\n      const result = await resolve(link.Hash, name, `${path}/${name}`, [], depth + 1, ipld, options)\n\n      yield result.entry\n    } else {\n      // descend into subshard\n      node = await ipld.get(link.Hash)\n\n      for await (const file of listDirectory(node, path, resolve, depth, ipld, options)) {\n        yield file\n      }\n    }\n  }\n}\n\nmodule.exports = hamtShardedDirectoryContent\n","'use strict'\n\nconst errCode = require('err-code')\nconst extractDataFromBlock = require('../utils/extract-data-from-block')\nconst validateOffsetAndLength = require('../utils/validate-offset-and-length')\n\n/**\n * @typedef {import('../types').ExporterOptions} ExporterOptions\n */\n\n/**\n * @param {Uint8Array} node\n */\nconst rawContent = (node) => {\n  /**\n   * @param {ExporterOptions} options\n   */\n  async function * contentGenerator (options = {}) {\n    const {\n      offset,\n      length\n    } = validateOffsetAndLength(node.length, options.offset, options.length)\n\n    yield extractDataFromBlock(node, 0, offset, offset + length)\n  }\n\n  return contentGenerator\n}\n\n/**\n * @type {import('../types').Resolver}\n */\nconst resolve = async (cid, name, path, toResolve, resolve, depth, ipld, options) => {\n  if (toResolve.length) {\n    throw errCode(new Error(`No link named ${path} found in raw node ${cid}`), 'ERR_NOT_FOUND')\n  }\n\n  const buf = await ipld.get(cid, options)\n\n  return {\n    entry: {\n      type: 'raw',\n      name,\n      path,\n      cid,\n      content: rawContent(buf),\n      depth,\n      size: buf.length,\n      node: buf\n    }\n  }\n}\n\nmodule.exports = resolve\n","'use strict'\n\nconst CID = require('cids')\nconst errCode = require('err-code')\n\n/**\n * @typedef {import('../types').Resolver} Resolver\n */\n\n/**\n * @type {Resolver}\n */\nconst resolve = async (cid, name, path, toResolve, resolve, depth, ipld, options) => {\n  const object = await ipld.get(cid, options)\n  const block = await ipld.get(new CID(1, 'raw', cid.multihash))\n  let subObject = object\n  let subPath = path\n\n  while (toResolve.length) {\n    const prop = toResolve[0]\n\n    if (prop in subObject) {\n      // remove the bit of the path we have resolved\n      toResolve.shift()\n      subPath = `${subPath}/${prop}`\n\n      if (CID.isCID(subObject[prop])) {\n        return {\n          entry: {\n            type: 'object',\n            name,\n            path,\n            cid,\n            node: block,\n            depth,\n            size: block.length,\n            content: async function * () {\n              yield object\n            }\n          },\n          next: {\n            cid: subObject[prop],\n            name: prop,\n            path: subPath,\n            toResolve\n          }\n        }\n      }\n\n      subObject = subObject[prop]\n    } else {\n      // cannot resolve further\n      throw errCode(new Error(`No property named ${prop} found in cbor node ${cid}`), 'ERR_NO_PROP')\n    }\n  }\n\n  return {\n    entry: {\n      type: 'object',\n      name,\n      path,\n      cid,\n      node: block,\n      depth,\n      size: block.length,\n      content: async function * () {\n        yield object\n      }\n    }\n  }\n}\n\nmodule.exports = resolve\n","'use strict'\n\nconst errCode = require('err-code')\nconst extractDataFromBlock = require('../utils/extract-data-from-block')\nconst validateOffsetAndLength = require('../utils/validate-offset-and-length')\nconst mh = require('multihashing-async').multihash\n\n/**\n * @typedef {import('../types').ExporterOptions} ExporterOptions\n * @typedef {import('../types').Resolver} Resolver\n */\n\n/**\n * @param {Uint8Array} node\n */\nconst rawContent = (node) => {\n  /**\n   * @param {ExporterOptions} options\n   */\n  async function * contentGenerator (options = {}) {\n    const {\n      offset,\n      length\n    } = validateOffsetAndLength(node.length, options.offset, options.length)\n\n    yield extractDataFromBlock(node, 0, offset, offset + length)\n  }\n\n  return contentGenerator\n}\n\n/**\n * @type {Resolver}\n */\nconst resolve = async (cid, name, path, toResolve, resolve, depth, ipld, options) => {\n  if (toResolve.length) {\n    throw errCode(new Error(`No link named ${path} found in raw node ${cid}`), 'ERR_NOT_FOUND')\n  }\n\n  const buf = await mh.decode(cid.multihash)\n\n  return {\n    entry: {\n      type: 'identity',\n      name,\n      path,\n      cid,\n      content: rawContent(buf.digest),\n      depth,\n      size: buf.length,\n      node: buf.digest\n    }\n  }\n}\n\nmodule.exports = resolve\n","'use strict'\n\nconst exporter = require('ipfs-unixfs-exporter')\nconst errCode = require('err-code')\nconst { normalizeCidPath, mapFile } = require('../utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst CID = require('cids')\n\n/**\n * @typedef {Object} Context\n * @property {import('ipld')} ipld\n * @property {import('../types').Preload} preload\n *\n * @param {Context} context\n */\nmodule.exports = function ({ ipld, preload }) {\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"get\"]}\n   */\n  async function * get (ipfsPath, options = {}) {\n    if (options.preload !== false) {\n      let pathComponents\n\n      try {\n        pathComponents = normalizeCidPath(ipfsPath).split('/')\n      } catch (err) {\n        throw errCode(err, 'ERR_INVALID_PATH')\n      }\n\n      preload(new CID(pathComponents[0]))\n    }\n\n    for await (const file of exporter.recursive(ipfsPath, ipld, options)) {\n      yield mapFile(file, {\n        ...options,\n        includeContent: true\n      })\n    }\n  }\n\n  return withTimeoutOption(get)\n}\n","'use strict'\n\nconst { exporter, recursive } = require('ipfs-unixfs-exporter')\nconst errCode = require('err-code')\nconst { normalizeCidPath, mapFile } = require('../utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst CID = require('cids')\n\n/**\n * @typedef {Object} Context\n * @property {import('ipld')} ipld\n * @property {import('../types').Preload} preload\n *\n * @param {Context} context\n */\nmodule.exports = function ({ ipld, preload }) {\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"ls\"]}\n   */\n  async function * ls (ipfsPath, options = {}) {\n    const path = normalizeCidPath(ipfsPath)\n    const pathComponents = path.split('/')\n\n    if (options.preload !== false) {\n      preload(new CID(pathComponents[0]))\n    }\n\n    const file = await exporter(ipfsPath, ipld, options)\n\n    if (file.type === 'file') {\n      yield mapFile(file, options)\n      return\n    }\n\n    if (file.type === 'directory') {\n      if (options.recursive) {\n        for await (const child of recursive(file.cid, ipld, options)) {\n          if (file.cid.toBaseEncodedString() === child.cid.toBaseEncodedString()) {\n            continue\n          }\n\n          yield mapFile(child, options)\n        }\n\n        return\n      }\n\n      for await (const child of file.content()) {\n        const entry = mapFile(child, options)\n        entry.depth--\n\n        yield entry\n      }\n\n      return\n    }\n\n    throw errCode(new Error(`Unknown UnixFS type ${file.type}`), 'ERR_UNKNOWN_UNIXFS_TYPE')\n  }\n\n  return withTimeoutOption(ls)\n}\n","'use strict'\n\nconst pkg = require('../../package.json')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-repo')} config.repo\n */\nmodule.exports = ({ repo }) => {\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"version\"]}\n   */\n  async function version (_options = {}) {\n    const repoVersion = await repo.version.get()\n\n    return {\n      version: pkg.version,\n      repo: `${repoVersion}`,\n\n      // @ts-ignore gitHead is defined in published versions\n      commit: pkg.gitHead || '',\n      'interface-ipfs-core': pkg.devDependencies['interface-ipfs-core']\n    }\n  }\n\n  return withTimeoutOption(version)\n}\n","'use strict'\n\nconst pkgversion = require('../../package.json').version\nconst { Multiaddr } = require('multiaddr')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst PeerId = require('peer-id')\nconst { NotStartedError } = require('../errors')\n\n/**\n * @param {Object} config\n * @param {import('peer-id')} config.peerId\n * @param {import('../types').NetworkService} config.network\n */\nmodule.exports = ({ peerId, network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"id\"]}\n   */\n  async function id (options = {}) { // eslint-disable-line require-await\n    if (options.peerId === peerId.toB58String()) {\n      delete options.peerId\n    }\n\n    const net = network.try()\n\n    if (!net) {\n      if (options.peerId) {\n        throw new NotStartedError()\n      }\n\n      const idStr = peerId.toB58String()\n\n      return {\n        id: idStr,\n        publicKey: uint8ArrayToString(peerId.pubKey.bytes, 'base64pad'),\n        addresses: [],\n        agentVersion: `js-ipfs/${pkgversion}`,\n        protocolVersion: '9000',\n        protocols: []\n      }\n    }\n\n    const id = options.peerId ? PeerId.createFromB58String(options.peerId.toString()) : peerId\n    const { libp2p } = net\n\n    const publicKey = options.peerId ? libp2p.peerStore.keyBook.get(id) : id.pubKey\n    const addresses = options.peerId ? libp2p.peerStore.addressBook.getMultiaddrsForPeer(id) : libp2p.multiaddrs\n    const protocols = options.peerId ? libp2p.peerStore.protoBook.get(id) : Array.from(libp2p.upgrader.protocols.keys())\n    const agentVersion = uint8ArrayToString(libp2p.peerStore.metadataBook.getValue(id, 'AgentVersion') || new Uint8Array())\n    const protocolVersion = uint8ArrayToString(libp2p.peerStore.metadataBook.getValue(id, 'ProtocolVersion') || new Uint8Array())\n    const idStr = id.toB58String()\n\n    return {\n      id: idStr,\n      publicKey: uint8ArrayToString(publicKey.bytes, 'base64pad'),\n      addresses: (addresses || [])\n        .map(ma => {\n          const str = ma.toString()\n\n          // some relay-style transports add our peer id to the ma for us\n          // so don't double-add\n          if (str.endsWith(`/p2p/${idStr}`)) {\n            return str\n          }\n\n          return `${str}/p2p/${idStr}`\n        })\n        .sort()\n        .map(ma => new Multiaddr(ma)),\n      agentVersion,\n      protocolVersion,\n      protocols: (protocols || []).sort()\n    }\n  }\n  return withTimeoutOption(id)\n}\n","'use strict'\n\nconst set = require('just-safe-set')\nconst getDefaultConfig = require('../runtime/config-nodejs.js')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst log = require('debug')('ipfs:core:config')\n\n/**\n * @typedef {import('ipfs-core-types/src/config').Config} Config\n *\n * @typedef {object} Transformer\n * @property {string} description\n * @property {(config: Config) => Config} transform\n */\n\n/**\n * @param {Object} config\n * @param {import('ipfs-repo')} config.repo\n */\nmodule.exports = ({ repo }) => {\n  return {\n    getAll: withTimeoutOption(getAll),\n    get: withTimeoutOption(get),\n    set: withTimeoutOption(set),\n    replace: withTimeoutOption(replace),\n    profiles: {\n      apply: withTimeoutOption(applyProfile),\n      list: withTimeoutOption(listProfiles)\n    }\n  }\n\n  /**\n   * @type {import('ipfs-core-types/src/config').API[\"getAll\"]}\n   */\n  async function getAll (options = {}) { // eslint-disable-line require-await\n    // @ts-ignore TODO: move config typedefs into ipfs-repo\n    return repo.config.getAll(options)\n  }\n\n  /**\n   * @type {import('ipfs-core-types/src/config').API[\"get\"]}\n   */\n  async function get (key, options) { // eslint-disable-line require-await\n    if (!key) {\n      return Promise.reject(new Error('key argument is required'))\n    }\n\n    // @ts-ignore TODO: move config typedefs into ipfs-repo\n    return repo.config.get(key, options)\n  }\n\n  /**\n   * @type {import('ipfs-core-types/src/config').API[\"set\"]}\n   */\n  async function set (key, value, options) { // eslint-disable-line require-await\n    return repo.config.set(key, value, options)\n  }\n\n  /**\n   * @type {import('ipfs-core-types/src/config').API[\"replace\"]}\n   */\n  async function replace (value, options) { // eslint-disable-line require-await\n    return repo.config.replace(value, options)\n  }\n\n  /**\n   * @type {import('ipfs-core-types/src/config/profiles').API[\"apply\"]}\n   */\n  async function applyProfile (profileName, options = { dryRun: false }) {\n    const { dryRun } = options\n\n    const profile = profiles[profileName]\n\n    if (!profile) {\n      throw new Error(`No profile with name '${profileName}' exists`)\n    }\n\n    try {\n      const oldCfg = await repo.config.getAll(options)\n      let newCfg = JSON.parse(JSON.stringify(oldCfg)) // clone\n      newCfg = profile.transform(newCfg)\n\n      if (!dryRun) {\n        await repo.config.replace(newCfg, options)\n      }\n\n      // Scrub private key from output\n      // @ts-ignore `oldCfg.Identity` maybe undefined\n      delete oldCfg.Identity.PrivKey\n      delete newCfg.Identity.PrivKey\n\n      // @ts-ignore TODO: move config typedefs into ipfs-repo\n      return { original: oldCfg, updated: newCfg }\n    } catch (err) {\n      log(err)\n\n      throw new Error(`Could not apply profile '${profileName}' to config: ${err.message}`)\n    }\n  }\n}\n\n/**\n * @type {import('ipfs-core-types/src/config/profiles').API[\"list\"]}\n */\nasync function listProfiles (_options) { // eslint-disable-line require-await\n  return Object.keys(profiles).map(name => ({\n    name,\n    description: profiles[name].description\n  }))\n}\n\n/**\n * @type {Record<string, Transformer>}\n */\nconst profiles = {\n  server: {\n    description: 'Recommended for nodes with public IPv4 address (servers, VPSes, etc.), disables host and content discovery and UPnP in local networks.',\n    transform: (config) => {\n      set(config, 'Discovery.MDNS.Enabled', false)\n      set(config, 'Discovery.webRTCStar.Enabled', false)\n      config.Swarm = {\n        ...(config.Swarm || {}),\n        DisableNatPortMap: true\n      }\n\n      return config\n    }\n  },\n  'local-discovery': {\n    description: 'Sets default values to fields affected by `server` profile, enables discovery and UPnP in local networks.',\n    transform: (config) => {\n      set(config, 'Discovery.MDNS.Enabled', true)\n      set(config, 'Discovery.webRTCStar.Enabled', true)\n      set(config, 'Swarm', {\n        ...(config.Swarm || {}),\n        DisableNatPortMap: false\n      })\n\n      return config\n    }\n  },\n  test: {\n    description: 'Reduces external interference, useful for running ipfs in test environments. Note that with these settings node won\\'t be able to talk to the rest of the network without manual bootstrap.',\n    transform: (config) => {\n      const defaultConfig = getDefaultConfig()\n\n      set(config, 'Addresses.API', defaultConfig.Addresses.API ? '/ip4/127.0.0.1/tcp/0' : '')\n      set(config, 'Addresses.Gateway', defaultConfig.Addresses.Gateway ? '/ip4/127.0.0.1/tcp/0' : '')\n      set(config, 'Addresses.Swarm', defaultConfig.Addresses.Swarm.length ? ['/ip4/127.0.0.1/tcp/0'] : [])\n      set(config, 'Addresses.Delegates', [])\n      set(config, 'Bootstrap', [])\n      set(config, 'Discovery.MDNS.Enabled', false)\n      set(config, 'Discovery.webRTCStar.Enabled', false)\n      set(config, 'Swarm', {\n        ...(config.Swarm || {}),\n        DisableNatPortMap: true\n      })\n\n      return config\n    }\n  },\n  'default-networking': {\n    description: 'Restores default network settings. Inverse profile of the `test` profile.',\n    transform: (config) => {\n      const defaultConfig = getDefaultConfig()\n\n      set(config, 'Addresses.API', defaultConfig.Addresses.API)\n      set(config, 'Addresses.Gateway', defaultConfig.Addresses.Gateway)\n      set(config, 'Addresses.Swarm', defaultConfig.Addresses.Swarm)\n      set(config, 'Addresses.Delegates', defaultConfig.Addresses.Delegates)\n      set(config, 'Bootstrap', defaultConfig.Bootstrap)\n      set(config, 'Discovery.MDNS.Enabled', defaultConfig.Discovery.MDNS.Enabled)\n      set(config, 'Discovery.webRTCStar.Enabled', defaultConfig.Discovery.webRTCStar.Enabled)\n      set(config, 'Swarm', {\n        ...(config.Swarm || {}),\n        DisableNatPortMap: false\n      })\n\n      return config\n    }\n  },\n  lowpower: {\n    description: 'Reduces daemon overhead on the system. May affect node functionality,performance of content discovery and data fetching may be degraded. Recommended for low power systems.',\n    transform: (config) => {\n      const Swarm = config.Swarm || {}\n      const ConnMgr = Swarm.ConnMgr || {}\n      ConnMgr.LowWater = 20\n      ConnMgr.HighWater = 40\n\n      Swarm.ConnMgr = ConnMgr\n      config.Swarm = Swarm\n\n      return config\n    }\n  },\n  'default-power': {\n    description: 'Inverse of \"lowpower\" profile.',\n    transform: (config) => {\n      const defaultConfig = getDefaultConfig()\n\n      config.Swarm = defaultConfig.Swarm\n\n      return config\n    }\n  }\n\n}\n\nmodule.exports.profiles = profiles\n","module.exports = set;\n\n/*\n  var obj1 = {};\n  set(obj1, 'a.aa.aaa', 4); // true\n  obj1; // {a: {aa: {aaa: 4}}}\n\n  var obj2 = {};\n  set(obj2, ['a', 'aa', 'aaa'], 4); // true\n  obj2; // {a: {aa: {aaa: 4}}}\n\n  var obj3 = {a: {aa: {aaa: 2}}};\n  set(obj3, 'a.aa.aaa', 3); // true\n  obj3; // {a: {aa: {aaa: 3}}}\n\n  // don't clobber existing\n  var obj4 = {a: {aa: {aaa: 2}}};\n  set(obj4, 'a.aa', {bbb: 7}); // false\n\n  const obj5 = {a: {}};\n  const sym = Symbol();\n  set(obj5.a, sym, 7); // true\n  obj5; // {a: {Symbol(): 7}}\n*/\n\nfunction set(obj, props, value) {\n  if (typeof props == 'string') {\n    props = props.split('.');\n  }\n  if (typeof props == 'symbol') {\n    props = [props];\n  }\n  var lastProp = props.pop();\n  if (!lastProp) {\n    return false;\n  }\n  var thisProp;\n  while ((thisProp = props.shift())) {\n    if (typeof obj[thisProp] == 'undefined') {\n      obj[thisProp] = {};\n    }\n    obj = obj[thisProp];\n    if (!obj || typeof obj != 'object') {\n      return false;\n    }\n  }\n  obj[lastProp] = value;\n  return true;\n}\n","'use strict'\n\nconst createGet = require('./get')\nconst createResolve = require('./resolve')\nconst createTree = require('./tree')\nconst createPut = require('./put')\n\n/**\n * @typedef {Object} ReaderConfig\n * @property {IPLD} ipld\n * @property {Preload} preload\n *\n * @typedef {import('ipld')} IPLD\n * @typedef {import('../../types').Preload} Preload\n * @typedef {import('ipfs-core-types/src/pin').API} Pin\n * @typedef {import('../gc-lock').GCLock} GCLock\n * @typedef {import('ipfs-core-types/src/utils').AbortOptions} AbortOptions\n */\n\nclass DagAPI {\n  /**\n   * @param {Object} config\n   * @param {IPLD} config.ipld\n   * @param {Preload} config.preload\n   * @param {Pin} config.pin\n   * @param {GCLock} config.gcLock\n   */\n  constructor ({ ipld, pin, preload, gcLock }) {\n    this.get = createGet({ ipld, preload })\n    this.resolve = createResolve({ ipld, preload })\n    this.tree = createTree({ ipld, preload })\n    this.put = createPut({ ipld, preload, pin, gcLock })\n  }\n}\n\nmodule.exports = DagAPI\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst first = require('it-first')\nconst last = require('it-last')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../types').Preload} config.preload\n */\nmodule.exports = ({ ipld, preload }) => {\n  /**\n   * @type {import('ipfs-core-types/src/dag').API[\"get\"]}\n   */\n  const get = async function get (cid, options = {}) {\n    if (options.preload !== false) {\n      preload(cid)\n    }\n\n    if (options.path) {\n      const entry = options.localResolve\n        ? await first(ipld.resolve(cid, options.path))\n        : await last(ipld.resolve(cid, options.path))\n      /** @type {import('ipfs-core-types/src/dag').GetResult} - first and last will return undefined when empty */\n      const result = (entry)\n      return result\n    }\n\n    return {\n      value: await ipld.get(cid, options),\n      remainderPath: ''\n    }\n  }\n\n  return withTimeoutOption(get)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst toCidAndPath = require('ipfs-core-utils/src/to-cid-and-path')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../types').Preload} config.preload\n */\nmodule.exports = ({ ipld, preload }) => {\n  /**\n   * @type {import('ipfs-core-types/src/dag').API[\"tree\"]}\n   */\n  async function * tree (ipfsPath, options = {}) { // eslint-disable-line require-await\n    const {\n      cid,\n      path\n    } = toCidAndPath(ipfsPath)\n\n    if (path) {\n      options.path = path\n    }\n\n    if (options.preload !== false) {\n      preload(cid)\n    }\n\n    yield * ipld.tree(cid, options.path, options)\n  }\n\n  return withTimeoutOption(tree)\n}\n","'use strict'\n\nconst multicodec = require('multicodec')\nconst multihashes = require('multihashing-async').multihash\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('multicodec').CodecCode} CodecCode\n * @typedef {import('multicodec').CodecName} CodecName\n * @typedef {import('multihashes').HashCode} HashCode\n * @typedef {import('multihashes').HashName} HashName\n */\n/**\n *\n * @param {CodecName} name\n */\nconst nameToCodec = name => multicodec.getCodeFromName(name)\n/**\n * @param {HashName} name\n */\nconst nameToHashCode = name => multihashes.names[name]\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('ipfs-core-types/src/pin').API} config.pin\n * @param {import('../../types').Preload} config.preload\n * @param {import('.').GCLock} config.gcLock\n */\nmodule.exports = ({ ipld, pin, gcLock, preload }) => {\n  /**\n   * @type {import('ipfs-core-types/src/dag').API[\"put\"]}\n   */\n  async function put (dagNode, options = {}) {\n    const { cidVersion, format, hashAlg } = readEncodingOptions(options)\n\n    const release = options.pin ? await gcLock.readLock() : null\n\n    try {\n      const cid = await ipld.put(dagNode, format, {\n        hashAlg,\n        cidVersion,\n        signal: options.signal\n      })\n\n      if (options.pin) {\n        await pin.add(cid, {\n          lock: false\n        })\n      }\n\n      if (options.preload !== false) {\n        preload(cid)\n      }\n\n      return cid\n    } finally {\n      if (release) {\n        release()\n      }\n    }\n  }\n\n  return withTimeoutOption(put)\n}\n\n/**\n * @param {import('ipfs-core-types/src/dag').PutOptions} options\n */\nconst readEncodingOptions = (options) => {\n  if (options.cid && (options.format || options.hashAlg)) {\n    throw new Error('Can\\'t put dag node. Please provide either `cid` OR `format` and `hashAlg` options.')\n  } else if (((options.format && !options.hashAlg) || (!options.format && options.hashAlg))) {\n    throw new Error('Can\\'t put dag node. Please provide `format` AND `hashAlg` options.')\n  }\n\n  const { hashAlg, format } = options.cid != null\n    ? { format: options.cid.code, hashAlg: undefined }\n    : encodingCodes({ ...defaultCIDOptions, ...options })\n  const cidVersion = readVersion({ ...options, format, hashAlg })\n\n  return {\n    cidVersion,\n    format,\n    hashAlg\n  }\n}\n\n/**\n *\n * @param {Object} options\n * @param {CodecCode|CodecName} options.format\n * @param {HashCode|HashName} [options.hashAlg]\n */\nconst encodingCodes = ({ format, hashAlg }) => ({\n  format: typeof format === 'string' ? nameToCodec(format) : format,\n  hashAlg: typeof hashAlg === 'string' ? nameToHashCode(hashAlg) : hashAlg\n})\n\n/**\n * Figures out what version of CID should be used given the options.\n *\n * @param {Object} options\n * @param {CIDVersion} [options.version]\n * @param {CID} [options.cid]\n * @param {CodecCode} [options.format]\n * @param {HashCode} [options.hashAlg]\n */\nconst readVersion = ({ version, cid, format, hashAlg }) => {\n  // If version is passed just use that.\n  if (typeof version === 'number') {\n    return version\n  // If cid is provided use version field from it.\n  } else if (cid) {\n    return cid.version\n  // If it's dag-pb nodes use version 0\n  } else if (format === multicodec.DAG_PB && hashAlg === multicodec.SHA2_256) {\n    return 0\n  } else {\n  // Otherwise use version 1\n    return 1\n  }\n}\n\nconst defaultCIDOptions = {\n  format: multicodec.getCodeFromName('dag-cbor'),\n  hashAlg: multihashes.names['sha2-256']\n}\n","'use strict'\n\n// @ts-ignore no types\nconst toUri = require('multiaddr-to-uri')\nconst debug = require('debug')\nconst shuffle = require('array-shuffle')\nconst { AbortController } = require('native-abort-controller')\nconst preload = require('./runtime/preload-nodejs')\n/** @type {typeof import('hashlru').default} */\n// @ts-ignore - hashlru has incorrect typedefs\nconst hashlru = require('hashlru')\n\nconst log = Object.assign(\n  debug('ipfs:preload'),\n  { error: debug('ipfs:preload:error') }\n)\n\n/**\n * @param {import('./types').PreloadOptions} [options]\n */\nconst createPreloader = (options = {}) => {\n  options.enabled = Boolean(options.enabled)\n  options.addresses = options.addresses || []\n  options.cache = options.cache || 1000\n\n  if (!options.enabled || !options.addresses.length) {\n    log('preload disabled')\n    const api = () => {}\n    return Object.assign(api, {\n      start: () => {},\n      stop: () => {}\n    })\n  }\n\n  let stopped = true\n  /** @type {AbortController[]} */\n  let requests = []\n  const apiUris = options.addresses.map(toUri)\n\n  // Avoid preloading the same CID over and over again\n  const cache = hashlru(options.cache)\n\n  /**\n   * @type {import('./types').Preload}\n   */\n  const api = async cid => {\n    try {\n      if (stopped) {\n        throw new Error(`preload ${cid} but preloader is not started`)\n      }\n\n      const path = cid.toString()\n\n      if (cache.has(path)) {\n        // we've preloaded this recently, don't preload it again\n        return\n      }\n\n      // make sure we don't preload this again any time soon\n      cache.set(path, true)\n\n      const fallbackApiUris = shuffle(apiUris)\n      let success = false\n      const now = Date.now()\n\n      for (const uri of fallbackApiUris) {\n        if (stopped) throw new Error(`preload aborted for ${path}`)\n        /** @type {AbortController} */\n        let controller\n\n        try {\n          controller = new AbortController()\n          requests = requests.concat(controller)\n          await preload(`${uri}/api/v0/refs?r=true&arg=${encodeURIComponent(path)}`, { signal: controller.signal })\n          success = true\n        } catch (err) {\n          if (err.type !== 'aborted') log.error(err)\n        } finally {\n          requests = requests.filter(r => r !== controller)\n        }\n\n        if (success) break\n      }\n\n      log(`${success ? '' : 'un'}successfully preloaded ${path} in ${Date.now() - now}ms`)\n    } catch (err) {\n      log.error(err)\n    }\n  }\n\n  /**\n   * @returns {void}\n   */\n  api.start = () => {\n    stopped = false\n  }\n\n  /**\n   * @returns {void}\n   */\n  api.stop = () => {\n    stopped = true\n    log(`aborting ${requests.length} pending preload request(s)`)\n    requests.forEach(r => r.abort())\n    requests = []\n  }\n\n  return api\n}\n\nmodule.exports = createPreloader\n","const { Multiaddr } = require('multiaddr')\n\nconst reduceValue = (_, v) => v\nconst tcpUri = (str, port, parts, opts) => {\n  // return tcp when explicitly requested\n  if (opts && opts.assumeHttp === false) return `tcp://${str}:${port}`\n  // check if tcp is the last protocol in multiaddr\n  let protocol = 'tcp'\n  let explicitPort = `:${port}`\n  const last = parts[parts.length - 1]\n  if (last.protocol === 'tcp') {\n    // assume http and produce clean urls\n    protocol = port === '443' ? 'https' : 'http'\n    explicitPort = port === '443' || port === '80' ? '' : explicitPort\n  }\n  return `${protocol}://${str}${explicitPort}`\n}\n\nconst Reducers = {\n  ip4: reduceValue,\n  ip6: (str, content, i, parts) => (\n    parts.length === 1 && parts[0].protocol === 'ip6'\n      ? content\n      : `[${content}]`\n  ),\n  tcp: (str, content, i, parts, opts) => (\n    parts.some(p => ['http', 'https', 'ws', 'wss'].includes(p.protocol))\n      ? `${str}:${content}`\n      : tcpUri(str, content, parts, opts)\n  ),\n  udp: (str, content) => `udp://${str}:${content}`,\n  dnsaddr: reduceValue,\n  dns4: reduceValue,\n  dns6: reduceValue,\n  ipfs: (str, content) => `${str}/ipfs/${content}`,\n  p2p: (str, content) => `${str}/p2p/${content}`,\n  http: str => `http://${str}`,\n  https: str => `https://${str}`,\n  ws: str => `ws://${str}`,\n  wss: str => `wss://${str}`,\n  'p2p-websocket-star': str => `${str}/p2p-websocket-star`,\n  'p2p-webrtc-star': str => `${str}/p2p-webrtc-star`,\n  'p2p-webrtc-direct': str => `${str}/p2p-webrtc-direct`\n}\n\nmodule.exports = (multiaddr, opts) => {\n  const ma = new Multiaddr(multiaddr)\n  const parts = multiaddr.toString().split('/').slice(1)\n  return ma\n    .tuples()\n    .map(tuple => ({\n      protocol: parts.shift(),\n      content: tuple[1] ? parts.shift() : null\n    }))\n    .reduce((str, part, i, parts) => {\n      const reduce = Reducers[part.protocol]\n      if (!reduce) throw new Error(`Unsupported protocol ${part.protocol}`)\n      return reduce(str, part.content, i, parts, opts)\n    }, '')\n}\n","'use strict';\n\nmodule.exports = array => {\n\tif (!Array.isArray(array)) {\n\t\tthrow new TypeError(`Expected an array, got ${typeof array}`);\n\t}\n\n\tarray = [...array];\n\n\tfor (let index = array.length - 1; index > 0; index--) {\n\t\tconst newIndex = Math.floor(Math.random() * (index + 1));\n\t\t[array[index], array[newIndex]] = [array[newIndex], array[index]];\n\t}\n\n\treturn array;\n};\n","/* eslint-env browser */\n'use strict'\n\nconst { default: PQueue } = require('p-queue')\nconst HTTP = require('ipfs-utils/src/http')\nconst debug = require('debug')\n\nconst log = Object.assign(debug('ipfs:preload'), {\n  error: debug('ipfs:preload:error')\n})\n\n// browsers limit concurrent connections per host,\n// we don't want preload calls to exhaust the limit (~6)\nconst httpQueue = new PQueue({ concurrency: 4 })\n\n/**\n * @param {string} url\n * @param {import('ipfs-core-types/src/utils').AbortOptions} options\n */\nmodule.exports = function preload (url, options = {}) {\n  log(url)\n\n  return httpQueue.add(async () => {\n    const res = await HTTP.post(url, { signal: options.signal })\n\n    // @ts-ignore\n    const reader = res.body.getReader()\n\n    try {\n      while (true) {\n        const { done } = await reader.read()\n        if (done) return\n        // Read to completion but do not cache\n      }\n    } finally {\n      reader.releaseLock()\n    }\n  })\n}\n","'use strict'\n\nconst debug = require('debug')\nconst { cidToString } = require('ipfs-core-utils/src/cid')\nconst log = Object.assign(debug('ipfs:mfs-preload'), {\n  error: debug('ipfs:mfs-preload:error')\n})\n\n/**\n * @typedef {PreloadOptions & MFSPreloadOptions} Options\n * @typedef {Object} MFSPreloadOptions\n * @property {number} [interval]\n * @typedef {import('./types').PreloadOptions} PreloadOptions\n */\n\n/**\n * @param {Object} config\n * @param {import('./types').Preload} config.preload\n * @param {import('ipfs-core-types/src/files').API} config.files\n * @param {Options} [config.options]\n */\nmodule.exports = ({ preload, files, options = {} }) => {\n  options.interval = options.interval || 30 * 1000\n\n  if (!options.enabled) {\n    log('MFS preload disabled')\n    const noop = async () => {}\n    return { start: noop, stop: noop }\n  }\n\n  let rootCid = ''\n  /** @type {any} */\n  let timeoutId\n\n  const preloadMfs = async () => {\n    try {\n      const stats = await files.stat('/')\n      const nextRootCid = cidToString(stats.cid, { base: 'base32' })\n\n      if (rootCid !== nextRootCid) {\n        log(`preloading updated MFS root ${rootCid} -> ${stats.cid}`)\n        await preload(stats.cid)\n        rootCid = nextRootCid\n      }\n    } catch (err) {\n      log.error('failed to preload MFS root', err)\n    } finally {\n      timeoutId = setTimeout(preloadMfs, options.interval)\n    }\n  }\n\n  return {\n    /**\n     * @returns {Promise<void>}\n     */\n    async start () {\n      const stats = await files.stat('/')\n      rootCid = cidToString(stats.cid, { base: 'base32' })\n      log(`monitoring MFS root ${stats.cid}`)\n      timeoutId = setTimeout(preloadMfs, options.interval)\n    },\n    /**\n     * @returns {void}\n     */\n    stop () {\n      clearTimeout(timeoutId)\n    }\n  }\n}\n","'use strict'\n\nconst createLock = require('./utils/create-lock')\nconst isIpfs = require('is-ipfs')\n\n/**\n * @typedef {object} MfsContext\n * @property {import('ipld')} ipld\n * @property {import('ipfs-repo')} repo\n * @property {import('ipfs-core-types/src/block').API} block\n */\n\n/**\n * These operations are read-locked at the function level and will execute simultaneously\n *\n * @type {Record<string, any>}\n */\nconst readOperations = {\n  stat: require('./stat')\n}\n\n/**\n * These operations are locked at the function level and will execute in series\n *\n * @type {Record<string, any>}\n */\nconst writeOperations = {\n  chmod: require('./chmod'),\n  cp: require('./cp'),\n  flush: require('./flush'),\n  mkdir: require('./mkdir'),\n  mv: require('./mv'),\n  rm: require('./rm'),\n  touch: require('./touch')\n}\n\n/**\n * These operations are asynchronous and manage their own locking\n *\n * @type {Record<string, any>}\n */\nconst unwrappedOperations = {\n  write: require('./write'),\n  read: require('./read'),\n  ls: require('./ls')\n}\n\n/**\n * @param {object} arg\n * @param {*} arg.options\n * @param {*} arg.mfs\n * @param {*} arg.operations\n * @param {*} arg.lock\n */\nconst wrap = ({\n  options, mfs, operations, lock\n}) => {\n  Object.keys(operations).forEach(key => {\n    mfs[key] = lock(operations[key](options))\n  })\n}\n\nconst defaultOptions = {\n  repoOwner: true,\n  ipld: null,\n  repo: null\n}\n\n/**\n * @param {*} options\n */\nfunction createMfs (options) {\n  const {\n    repoOwner\n  } = Object.assign({}, defaultOptions || {}, options)\n\n  options.repo = {\n    blocks: options.blocks,\n    datastore: options.datastore\n  }\n\n  const lock = createLock(repoOwner)\n\n  /**\n   * @param {(fn: (...args: any) => any) => (...args: any) => any} operation\n   */\n  const readLock = (operation) => {\n    return lock.readLock(operation)\n  }\n\n  /**\n   * @param {(fn: (...args: any) => any) => (...args: any) => any} operation\n   */\n  const writeLock = (operation) => {\n    return lock.writeLock(operation)\n  }\n\n  /** @type {Record<string, any>} */\n  const mfs = {}\n\n  wrap({\n    options, mfs, operations: readOperations, lock: readLock\n  })\n  wrap({\n    options, mfs, operations: writeOperations, lock: writeLock\n  })\n\n  Object.keys(unwrappedOperations).forEach(key => {\n    mfs[key] = unwrappedOperations[key](options)\n  })\n\n  return mfs\n}\n\n/**\n * @param {object} context\n * @param {import('ipld')} context.ipld\n * @param {import('ipfs-core-types/src/block').API} context.block\n * @param {import('ipfs-block-service')} context.blockService\n * @param {import('ipfs-repo')} context.repo\n * @param {import('../../types').Preload} context.preload\n * @param {import('..').Options} context.options\n * @returns {import('ipfs-core-types/src/files').API}\n */\nmodule.exports = ({ ipld, block, blockService, repo, preload, options: constructorOptions }) => {\n  const methods = createMfs({\n    ipld,\n    block,\n    blocks: blockService,\n    datastore: repo.root,\n    repoOwner: constructorOptions.repoOwner\n  })\n\n  /**\n   * @param {any} fn\n   */\n  const withPreload = fn => {\n    /**\n     * @param  {...any} args\n     */\n    const wrapped = (...args) => {\n      // @ts-ignore cannot derive type of arg\n      const paths = args.filter(arg => isIpfs.ipfsPath(arg) || isIpfs.cid(arg))\n\n      if (paths.length) {\n        const options = args[args.length - 1]\n        // @ts-ignore it's a PreloadOptions, honest\n        if (options && options.preload !== false) {\n          paths.forEach(path => preload(path))\n        }\n      }\n\n      return fn(...args)\n    }\n\n    return wrapped\n  }\n\n  return {\n    ...methods,\n    chmod: methods.chmod,\n    cp: withPreload(methods.cp),\n    mkdir: methods.mkdir,\n    stat: withPreload(methods.stat),\n    rm: methods.rm,\n    read: withPreload(methods.read),\n    touch: methods.touch,\n    write: methods.write,\n    mv: withPreload(methods.mv),\n    flush: methods.flush,\n    ls: withPreload(async function * (/** @type {...any} */ ...args) {\n      for await (const file of methods.ls(...args)) {\n        yield { ...file, size: file.size || 0 }\n      }\n    })\n  }\n}\n","'use strict'\n\n// @ts-ignore - no types\nconst mortice = require('mortice')\n\n/**\n * @typedef {object} Lock\n * @property {(fn: (...args: any) => any) => (...args: any) => any} readLock\n * @property {(fn: (...args: any) => any) => (...args: any) => any} writeLock\n */\n\n/** @type {Lock} */\nlet lock\n\n/**\n * @param {boolean} [repoOwner]\n */\nmodule.exports = (repoOwner = false) => {\n  if (lock) {\n    return lock\n  }\n\n  const mutex = mortice({\n    // ordinarily the main thread would store the read/write lock but\n    // if we are the thread that owns the repo, we can store the lock\n    // on this process even if we are a worker thread\n    singleProcess: repoOwner\n  })\n\n  lock = {\n    readLock: (func) => {\n      return async (...args) => {\n        const releaseLock = await mutex.readLock()\n\n        try {\n          return await func.apply(null, args)\n        } finally {\n          releaseLock()\n        }\n      }\n    },\n\n    writeLock: (func) => {\n      return async (...args) => {\n        const releaseLock = await mutex.writeLock()\n\n        try {\n          return await func.apply(null, args)\n        } finally {\n          releaseLock()\n        }\n      }\n    }\n  }\n\n  return lock\n}\n","const node = require('./node')\nconst browser = require('./browser')\nconst { default: Queue } = require('p-queue')\nconst { timeout } = require('promise-timeout')\nconst observe = require('observable-webworkers')\n\nconst mutexes = {}\nlet implementation\n\nfunction createReleaseable (queue, options) {\n  let res\n\n  const p = new Promise((resolve) => {\n    res = resolve\n  })\n\n  queue.add(() => timeout((() => {\n    return new Promise((resolve) => {\n      res(() => {\n        resolve()\n      })\n    })\n  })(), options.timeout))\n\n  return p\n}\n\nconst createMutex = (name, options) => {\n  if (implementation.isWorker) {\n    return {\n      readLock: implementation.readLock(name, options),\n      writeLock: implementation.writeLock(name, options)\n    }\n  }\n\n  const masterQueue = new Queue({ concurrency: 1 })\n  let readQueue = null\n\n  return {\n    readLock: () => {\n      // If there's already a read queue, just add the task to it\n      if (readQueue) {\n        return createReleaseable(readQueue, options)\n      }\n\n      // Create a new read queue\n      readQueue = new Queue({\n        concurrency: options.concurrency,\n        autoStart: false\n      })\n      const localReadQueue = readQueue\n\n      // Add the task to the read queue\n      const readPromise = createReleaseable(readQueue, options)\n\n      masterQueue.add(() => {\n        // Start the task only once the master queue has completed processing\n        // any previous tasks\n        localReadQueue.start()\n\n        // Once all the tasks in the read queue have completed, remove it so\n        // that the next read lock will occur after any write locks that were\n        // started in the interim\n        return localReadQueue.onIdle()\n          .then(() => {\n            if (readQueue === localReadQueue) {\n              readQueue = null\n            }\n          })\n      })\n\n      return readPromise\n    },\n    writeLock: () => {\n      // Remove the read queue reference, so that any later read locks will be\n      // added to a new queue that starts after this write lock has been\n      // released\n      readQueue = null\n\n      return createReleaseable(masterQueue, options)\n    }\n  }\n}\n\nconst defaultOptions = {\n  concurrency: Infinity,\n  timeout: 84600000,\n  global: global,\n  singleProcess: false\n}\n\nmodule.exports = (name, options) => {\n  if (!options) {\n    options = {}\n  }\n\n  if (typeof name === 'object') {\n    options = name\n    name = 'lock'\n  }\n\n  if (!name) {\n    name = 'lock'\n  }\n\n  options = Object.assign({}, defaultOptions, options)\n\n  if (!implementation) {\n    implementation = node(options) || browser(options)\n\n    if (!implementation.isWorker) {\n      // we are master, set up worker requests\n      implementation.on('requestReadLock', (name, fn) => {\n        if (!mutexes[name]) {\n          return\n        }\n\n        mutexes[name].readLock()\n          .then(release => fn().finally(() => release()))\n      })\n\n      implementation.on('requestWriteLock', async (name, fn) => {\n        if (!mutexes[name]) {\n          return\n        }\n\n        mutexes[name].writeLock()\n          .then(release => fn().finally(() => release()))\n      })\n    }\n  }\n\n  if (!mutexes[name]) {\n    mutexes[name] = createMutex(name, options)\n  }\n\n  return mutexes[name]\n}\n\nmodule.exports.Worker = function (script, Impl) {\n  Impl = Impl || global.Worker\n  let worker\n\n  try {\n    worker = new Impl(script)\n  } catch (error) {\n    if (error.message.includes('not a constructor')) {\n      worker = Impl(script)\n    }\n  }\n\n  if (!worker) {\n    throw new Error('Could not create Worker from', Impl)\n  }\n\n  observe(worker)\n\n  return worker\n}\n","const EventEmitter = require('events').EventEmitter\nconst { nanoid } = require('nanoid')\nconst {\n  WORKER_REQUEST_READ_LOCK,\n  WORKER_RELEASE_READ_LOCK,\n  MASTER_GRANT_READ_LOCK,\n  WORKER_REQUEST_WRITE_LOCK,\n  WORKER_RELEASE_WRITE_LOCK,\n  MASTER_GRANT_WRITE_LOCK\n} = require('./constants')\nlet cluster\n\nconst handleWorkerLockRequest = (emitter, masterEvent, requestType, releaseType, grantType) => {\n  return (worker, requestEvent) => {\n    if (requestEvent && requestEvent.type === requestType) {\n      emitter.emit(masterEvent, requestEvent.name, () => {\n        // grant lock to worker\n        worker.send({\n          type: grantType,\n          name: requestEvent.name,\n          identifier: requestEvent.identifier\n        })\n\n        // wait for worker to finish\n        return new Promise((resolve) => {\n          const releaseEventListener = (releaseEvent) => {\n            if (releaseEvent && releaseEvent.type === releaseType && releaseEvent.identifier === requestEvent.identifier) {\n              worker.removeListener('message', releaseEventListener)\n              resolve()\n            }\n          }\n\n          worker.on('message', releaseEventListener)\n        })\n      })\n    }\n  }\n}\n\nconst makeWorkerLockRequest = (name, requestType, grantType, releaseType) => {\n  return () => {\n    const id = nanoid()\n\n    process.send({\n      type: requestType,\n      identifier: id,\n      name\n    })\n\n    return new Promise((resolve) => {\n      const listener = (event) => {\n        if (event && event.type === grantType && event.identifier === id) {\n          process.removeListener('message', listener)\n\n          // grant lock\n          resolve(() => {\n            // release lock\n            process.send({\n              type: releaseType,\n              identifier: id,\n              name\n            })\n          })\n        }\n      }\n\n      process.on('message', listener)\n    })\n  }\n}\n\nmodule.exports = (options) => {\n  try {\n    cluster = require('cluster')\n\n    if (!Object.keys(cluster).length) {\n      return\n    }\n  } catch (_) {\n    return\n  }\n\n  if (cluster.isMaster || options.singleProcess) {\n    const emitter = new EventEmitter()\n\n    cluster.on('message', handleWorkerLockRequest(emitter, 'requestReadLock', WORKER_REQUEST_READ_LOCK, WORKER_RELEASE_READ_LOCK, MASTER_GRANT_READ_LOCK))\n    cluster.on('message', handleWorkerLockRequest(emitter, 'requestWriteLock', WORKER_REQUEST_WRITE_LOCK, WORKER_RELEASE_WRITE_LOCK, MASTER_GRANT_WRITE_LOCK))\n\n    return emitter\n  }\n\n  return {\n    isWorker: true,\n    readLock: (name) => makeWorkerLockRequest(name, WORKER_REQUEST_READ_LOCK, MASTER_GRANT_READ_LOCK, WORKER_RELEASE_READ_LOCK),\n    writeLock: (name) => makeWorkerLockRequest(name, WORKER_REQUEST_WRITE_LOCK, MASTER_GRANT_WRITE_LOCK, WORKER_RELEASE_WRITE_LOCK)\n  }\n}\n","\nmodule.exports = {\n  WORKER_REQUEST_READ_LOCK: 'lock:worker:request-read',\n  WORKER_RELEASE_READ_LOCK: 'lock:worker:release-read',\n  MASTER_GRANT_READ_LOCK: 'lock:master:grant-read',\n\n  WORKER_REQUEST_WRITE_LOCK: 'lock:worker:request-write',\n  WORKER_RELEASE_WRITE_LOCK: 'lock:worker:release-write',\n  MASTER_GRANT_WRITE_LOCK: 'lock:master:grant-write'\n}\n","const EventEmitter = require('events').EventEmitter\nconst { nanoid } = require('nanoid')\nconst {\n  WORKER_REQUEST_READ_LOCK,\n  WORKER_RELEASE_READ_LOCK,\n  MASTER_GRANT_READ_LOCK,\n  WORKER_REQUEST_WRITE_LOCK,\n  WORKER_RELEASE_WRITE_LOCK,\n  MASTER_GRANT_WRITE_LOCK\n} = require('./constants')\nconst observer = require('observable-webworkers')\n\nconst handleWorkerLockRequest = (emitter, masterEvent, requestType, releaseType, grantType) => {\n  return (worker, event) => {\n    if (!event || !event.data || event.data.type !== requestType) {\n      return\n    }\n\n    const requestEvent = {\n      type: event.data.type,\n      name: event.data.name,\n      identifier: event.data.identifier\n    }\n\n    emitter.emit(masterEvent, requestEvent.name, () => {\n      // grant lock to worker\n      worker.postMessage({\n        type: grantType,\n        name: requestEvent.name,\n        identifier: requestEvent.identifier\n      })\n\n      // wait for worker to finish\n      return new Promise((resolve) => {\n        const releaseEventListener = (event) => {\n          if (!event || !event.data) {\n            return\n          }\n\n          const releaseEvent = {\n            type: event.data.type,\n            name: event.data.name,\n            identifier: event.data.identifier\n          }\n\n          if (releaseEvent && releaseEvent.type === releaseType && releaseEvent.identifier === requestEvent.identifier) {\n            worker.removeEventListener('message', releaseEventListener)\n            resolve()\n          }\n        }\n\n        worker.addEventListener('message', releaseEventListener)\n      })\n    })\n  }\n}\n\nconst makeWorkerLockRequest = (name, requestType, grantType, releaseType) => {\n  return () => {\n    const id = nanoid()\n\n    globalThis.postMessage({\n      type: requestType,\n      identifier: id,\n      name\n    })\n\n    return new Promise((resolve) => {\n      const listener = (event) => {\n        if (!event || !event.data) {\n          return\n        }\n\n        const responseEvent = {\n          type: event.data.type,\n          identifier: event.data.identifier\n        }\n\n        if (responseEvent && responseEvent.type === grantType && responseEvent.identifier === id) {\n          globalThis.removeEventListener('message', listener)\n\n          // grant lock\n          resolve(() => {\n            // release lock\n            globalThis.postMessage({\n              type: releaseType,\n              identifier: id,\n              name\n            })\n          })\n        }\n      }\n\n      globalThis.addEventListener('message', listener)\n    })\n  }\n}\n\nconst defaultOptions = {\n  singleProcess: false\n}\n\nmodule.exports = (options) => {\n  options = Object.assign({}, defaultOptions, options)\n  const isMaster = !!globalThis.document || options.singleProcess\n\n  if (isMaster) {\n    const emitter = new EventEmitter()\n\n    observer.addEventListener('message', handleWorkerLockRequest(emitter, 'requestReadLock', WORKER_REQUEST_READ_LOCK, WORKER_RELEASE_READ_LOCK, MASTER_GRANT_READ_LOCK))\n    observer.addEventListener('message', handleWorkerLockRequest(emitter, 'requestWriteLock', WORKER_REQUEST_WRITE_LOCK, WORKER_RELEASE_WRITE_LOCK, MASTER_GRANT_WRITE_LOCK))\n\n    return emitter\n  }\n\n  return {\n    isWorker: true,\n    readLock: (name) => makeWorkerLockRequest(name, WORKER_REQUEST_READ_LOCK, MASTER_GRANT_READ_LOCK, WORKER_RELEASE_READ_LOCK),\n    writeLock: (name) => makeWorkerLockRequest(name, WORKER_REQUEST_WRITE_LOCK, MASTER_GRANT_WRITE_LOCK, WORKER_RELEASE_WRITE_LOCK)\n  }\n}\n","const events = {}\n\nconst observable = (worker) => {\n  worker.addEventListener('message', (event) => {\n    observable.dispatchEvent('message', worker, event)\n  })\n\n  if (worker.port) {\n    worker.port.addEventListener('message', (event) => {\n      observable.dispatchEvent('message', worker, event)\n    })\n  }\n}\n\nobservable.addEventListener = (type, fn) => {\n  if (!events[type]) {\n    events[type] = []\n  }\n\n  events[type].push(fn)\n}\n\nobservable.removeEventListener = (type, fn) => {\n  if (!events[type]) {\n    return\n  }\n\n  events[type] = events[type]\n    .filter(listener => listener === fn)\n}\n\nobservable.dispatchEvent = function () {\n  const args = Array.prototype.slice.call(arguments)\n  const type = args.shift()\n\n  if (!events[type]) {\n    return\n  }\n\n  events[type].forEach(fn => fn.apply(null, args))\n}\n\nmodule.exports = observable\n","// Copyright (c) 2015-2017 David M. Lee, II\n'use strict';\n\n/**\n * Local reference to TimeoutError\n * @private\n */\nvar TimeoutError;\n\n/**\n * Rejects a promise with a {@link TimeoutError} if it does not settle within\n * the specified timeout.\n *\n * @param {Promise} promise The promise.\n * @param {number} timeoutMillis Number of milliseconds to wait on settling.\n * @returns {Promise} Either resolves/rejects with `promise`, or rejects with\n *                   `TimeoutError`, whichever settles first.\n */\nvar timeout = module.exports.timeout = function(promise, timeoutMillis) {\n  var error = new TimeoutError(),\n      timeout;\n\n  return Promise.race([\n    promise,\n    new Promise(function(resolve, reject) {\n      timeout = setTimeout(function() {\n        reject(error);\n      }, timeoutMillis);\n    }),\n  ]).then(function(v) {\n    clearTimeout(timeout);\n    return v;\n  }, function(err) {\n    clearTimeout(timeout);\n    throw err;\n  });\n};\n\n/**\n * Exception indicating that the timeout expired.\n */\nTimeoutError = module.exports.TimeoutError = function() {\n  Error.call(this)\n  this.stack = Error().stack\n  this.message = 'Timeout';\n};\n\nTimeoutError.prototype = Object.create(Error.prototype);\nTimeoutError.prototype.name = \"TimeoutError\";\n","'use strict'\n\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\nconst toMfsPath = require('./utils/to-mfs-path')\nconst { exporter } = require('ipfs-unixfs-exporter')\nconst log = require('debug')('ipfs:mfs:stat')\nconst errCode = require('err-code')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @typedef {import('./').MfsContext} MfsContext\n * @typedef {object} DefaultOptions\n * @property {boolean} withLocal\n * @property {AbortSignal} [signal]\n * @property {number} [timeout]\n */\n\n/**\n * @type {DefaultOptions}\n */\nconst defaultOptions = {\n  withLocal: false\n}\n\n/**\n * @typedef {import('ipfs-core-types/src/files').StatResult} StatResult\n */\n\n/**\n * @param {MfsContext} context\n */\nmodule.exports = (context) => {\n  /**\n   * @type {import('ipfs-core-types/src/files').API[\"stat\"]}\n   */\n  async function mfsStat (path, options = {}) {\n    /** @type {DefaultOptions} */\n    options = mergeOptions(defaultOptions, options)\n\n    log(`Fetching stats for ${path}`)\n\n    const {\n      type,\n      cid,\n      mfsPath\n    } = await toMfsPath(context, path, options)\n\n    const exportPath = type === 'ipfs' && cid ? cid : mfsPath\n    let file\n\n    try {\n      file = await exporter(exportPath, context.ipld)\n    } catch (err) {\n      if (err.code === 'ERR_NOT_FOUND') {\n        throw errCode(new Error(`${path} does not exist`), 'ERR_NOT_FOUND')\n      }\n\n      throw err\n    }\n\n    if (!statters[file.type]) {\n      throw new Error(`Cannot stat codec ${file.cid.codec}`)\n    }\n\n    return statters[file.type](file)\n  }\n\n  return withTimeoutOption(mfsStat)\n}\n\n/** @type {Record<string, (file:any) => StatResult>} */\nconst statters = {\n  /**\n   * @param {import('ipfs-unixfs-exporter').RawNode} file\n   */\n  raw: (file) => {\n    return {\n      cid: file.cid,\n      size: file.node.length,\n      cumulativeSize: file.node.length,\n      blocks: 0,\n      type: 'file', // for go compatibility\n      local: undefined,\n      sizeLocal: undefined,\n      withLocality: false\n    }\n  },\n  /**\n   * @param {import('ipfs-unixfs-exporter').UnixFSFile} file\n   */\n  file: (file) => {\n    /** @type {StatResult} */\n    const stat = {\n      cid: file.cid,\n      type: 'file',\n      size: file.unixfs.fileSize(),\n      cumulativeSize: file.node.size,\n      blocks: file.unixfs.blockSizes.length,\n      local: undefined,\n      sizeLocal: undefined,\n      withLocality: false,\n      mode: file.unixfs.mode\n    }\n\n    if (file.unixfs.mtime) {\n      stat.mtime = file.unixfs.mtime\n    }\n\n    return stat\n  },\n  /**\n   * @param {import('ipfs-unixfs-exporter').UnixFSDirectory} file\n   */\n  directory: (file) => {\n    /** @type {StatResult} */\n    const stat = {\n      cid: file.cid,\n      type: 'directory',\n      size: 0,\n      cumulativeSize: file.node.size,\n      blocks: file.node.Links.length,\n      local: undefined,\n      sizeLocal: undefined,\n      withLocality: false,\n      mode: file.unixfs.mode\n    }\n\n    if (file.unixfs.mtime) {\n      stat.mtime = file.unixfs.mtime\n    }\n\n    return stat\n  },\n  /**\n   * @param {import('ipfs-unixfs-exporter').ObjectNode} file\n   */\n  object: (file) => {\n    /** @type {StatResult} */\n    return {\n      cid: file.cid,\n      size: file.node.length,\n      cumulativeSize: file.node.length,\n      type: 'file', // for go compatibility\n      blocks: 0,\n      local: undefined,\n      sizeLocal: undefined,\n      withLocality: false\n    }\n  },\n  /**\n   * @param {import('ipfs-unixfs-exporter').IdentityNode} file\n   */\n  identity: (file) => {\n    /** @type {StatResult} */\n    return {\n      cid: file.cid,\n      size: file.node.length,\n      cumulativeSize: file.node.length,\n      blocks: 0,\n      type: 'file', // for go compatibility\n      local: undefined,\n      sizeLocal: undefined,\n      withLocality: false\n    }\n  }\n}\n","'use strict'\n\nconst loadMfsRoot = require('./with-mfs-root')\nconst toPathComponents = require('./to-path-components')\nconst { exporter } = require('ipfs-unixfs-exporter')\nconst errCode = require('err-code')\nconst CID = require('cids')\n\nconst IPFS_PREFIX = 'ipfs'\n\n/**\n * @typedef {import('ipfs-unixfs-exporter').UnixFSEntry} UnixFSEntry\n * @typedef {import('ipfs-unixfs-exporter').ExporterOptions} ExporterOptions\n * @typedef {import('../').MfsContext} MfsContext\n *\n * @typedef {object} FilePath\n * @property {'mfs' | 'ipfs'} type\n * @property {'file'} entryType\n * @property {number} depth\n * @property {string} mfsPath\n * @property {string} mfsDirectory\n * @property {string[]} parts\n * @property {string} path\n * @property {string} name\n * @property {CID} cid\n * @property {boolean} exists\n * @property {import('ipfs-unixfs').UnixFS} unixfs\n * @property {(options?: ExporterOptions) => AsyncIterable<Uint8Array>} content\n *\n * @typedef {object} DirectoryPath\n * @property {'mfs' | 'ipfs'} type\n * @property {'directory'} entryType\n * @property {number} depth\n * @property {string} mfsPath\n * @property {string} mfsDirectory\n * @property {string[]} parts\n * @property {string} path\n * @property {string} name\n * @property {CID} cid\n * @property {boolean} exists\n * @property {import('ipfs-unixfs').UnixFS} unixfs\n * @property {(options?: ExporterOptions) => AsyncIterable<UnixFSEntry>} content\n *\n * @typedef {object} ObjectPath\n * @property {'mfs' | 'ipfs'} type\n * @property {'object'} entryType\n * @property {number} depth\n * @property {string} mfsPath\n * @property {string} mfsDirectory\n * @property {string[]} parts\n * @property {string} path\n * @property {string} name\n * @property {CID} cid\n * @property {boolean} exists\n * @property {(options?: ExporterOptions) => AsyncIterable<any>} content\n *\n * @typedef {object} RawPath\n * @property {'mfs' | 'ipfs'} type\n * @property {'raw'} entryType\n * @property {number} depth\n * @property {string} mfsPath\n * @property {string} mfsDirectory\n * @property {string[]} parts\n * @property {string} path\n * @property {string} name\n * @property {CID} cid\n * @property {boolean} exists\n * @property {(options?: ExporterOptions) => AsyncIterable<Uint8Array>} content\n *\n * @typedef {object} IdentityPath\n * @property {'mfs' | 'ipfs'} type\n * @property {'identity'} entryType\n * @property {number} depth\n * @property {string} mfsPath\n * @property {string} mfsDirectory\n * @property {string[]} parts\n * @property {string} path\n * @property {string} name\n * @property {CID} cid\n * @property {boolean} exists\n * @property {(options?: ExporterOptions) => AsyncIterable<Uint8Array>} content\n *\n * @typedef {FilePath | DirectoryPath | ObjectPath | RawPath | IdentityPath} MfsPath\n */\n\n/**\n * @param {MfsContext} context\n * @param {string | CID} path\n * @param {import('ipfs-core-types/src/utils').AbortOptions} [options]\n */\nconst toMfsPath = async (context, path, options) => {\n  const root = await loadMfsRoot(context, options)\n\n  /** @type {MfsPath} */\n  // @ts-ignore fields get set later\n  let output = {\n    entryType: 'file'\n  }\n\n  if (CID.isCID(path)) {\n    path = `/ipfs/${path}`\n  }\n\n  path = (path || '').trim()\n  path = path.replace(/(\\/\\/+)/g, '/')\n\n  if (path.endsWith('/') && path.length > 1) {\n    path = path.substring(0, path.length - 1)\n  }\n\n  if (!path) {\n    throw errCode(new Error('paths must not be empty'), 'ERR_NO_PATH')\n  }\n\n  if (path.substring(0, 1) !== '/') {\n    throw errCode(new Error('paths must start with a leading slash'), 'ERR_INVALID_PATH')\n  }\n\n  if (path.substring(path.length - 1) === '/') {\n    path = path.substring(0, path.length - 1)\n  }\n\n  const pathComponents = toPathComponents(path)\n\n  if (pathComponents[0] === IPFS_PREFIX) {\n    // e.g. /ipfs/QMfoo or /ipfs/Qmfoo/sub/path\n    let mfsDirectory\n\n    if (pathComponents.length === 2) {\n      mfsDirectory = `/${pathComponents.join('/')}`\n    } else {\n      mfsDirectory = `/${pathComponents.slice(0, pathComponents.length - 1).join('/')}`\n    }\n\n    // @ts-ignore fields being set\n    output = {\n      type: 'ipfs',\n      depth: pathComponents.length - 2,\n      entryType: 'file',\n\n      mfsPath: `/${pathComponents.join('/')}`,\n      mfsDirectory,\n      parts: pathComponents,\n      path: `/${pathComponents.join('/')}`,\n      name: pathComponents[pathComponents.length - 1]\n    }\n  } else {\n    const mfsPath = `/${IPFS_PREFIX}/${root}${pathComponents.length ? '/' + pathComponents.join('/') : ''}`\n    const mfsDirectory = `/${IPFS_PREFIX}/${root}/${pathComponents.slice(0, pathComponents.length - 1).join('/')}`\n\n    // @ts-ignore fields being set\n    output = {\n      type: 'mfs',\n      depth: pathComponents.length,\n      entryType: 'file',\n\n      mfsDirectory,\n      mfsPath,\n      parts: pathComponents,\n      path: `/${pathComponents.join('/')}`,\n      name: pathComponents[pathComponents.length - 1]\n    }\n  }\n\n  const cidPath = output.type === 'mfs' ? output.mfsPath : output.path\n\n  try {\n    const res = await exporter(cidPath, context.ipld)\n\n    output.cid = res.cid\n    output.mfsPath = `/ipfs/${res.path}`\n    output.entryType = res.type\n    output.content = res.content\n\n    if ((output.entryType === 'file' || output.entryType === 'directory') && (res.type === 'file' || res.type === 'directory')) {\n      output.unixfs = res.unixfs\n    }\n  } catch (err) {\n    if (err.code !== 'ERR_NOT_FOUND') {\n      throw err\n    }\n  }\n\n  output.exists = Boolean(output.cid)\n\n  return output\n}\n\nmodule.exports = toMfsPath\n","'use strict'\n\nconst CID = require('cids')\nconst { UnixFS } = require('ipfs-unixfs')\nconst {\n  DAGNode\n} = require('ipld-dag-pb')\nconst log = require('debug')('ipfs:mfs:utils:with-mfs-root')\nconst mc = require('multicodec')\nconst mh = require('multihashing-async').multihash\nconst errCode = require('err-code')\n\nconst {\n  MFS_ROOT_KEY\n} = require('../../../utils')\n\n/**\n * @typedef {import('../').MfsContext} MfsContext\n */\n\n/**\n * @param {MfsContext} context\n * @param {import('ipfs-core-types/src/utils').AbortOptions} [options]\n */\nconst loadMfsRoot = async (context, options) => {\n  if (options && options.signal && options.signal.aborted) {\n    throw errCode(new Error('Request aborted'), 'ERR_ABORTED', { name: 'Aborted' })\n  }\n\n  // Open the repo if it's been closed\n  await context.repo.datastore.open()\n\n  // Load the MFS root CID\n  let cid\n\n  try {\n    const buf = await context.repo.datastore.get(MFS_ROOT_KEY)\n\n    cid = new CID(buf)\n  } catch (err) {\n    if (err.code !== 'ERR_NOT_FOUND') {\n      throw err\n    }\n\n    log('Creating new MFS root')\n    const node = new DAGNode(new UnixFS({ type: 'directory' }).marshal())\n    cid = await context.ipld.put(node, mc.DAG_PB, {\n      cidVersion: 0,\n      hashAlg: mh.names['sha2-256'] // why can't ipld look this up?\n    })\n\n    if (options && options.signal && options.signal.aborted) {\n      throw errCode(new Error('Request aborted'), 'ERR_ABORTED', { name: 'Aborted' })\n    }\n\n    await context.repo.datastore.put(MFS_ROOT_KEY, cid.bytes)\n  }\n\n  log(`Loaded MFS root /ipfs/${cid}`)\n\n  return cid\n}\n\nmodule.exports = loadMfsRoot\n","'use strict'\n\n/**\n * @param {string} [path]\n */\nconst toPathComponents = (path = '') => {\n  // split on / unless escaped with \\\n  return (path\n    .trim()\n    .match(/([^\\\\^/]|\\\\\\/)+/g) || [])\n    .filter(Boolean)\n}\n\nmodule.exports = toPathComponents\n","'use strict'\n\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\nconst toMfsPath = require('./utils/to-mfs-path')\nconst log = require('debug')('ipfs:mfs:touch')\nconst errCode = require('err-code')\nconst { UnixFS } = require('ipfs-unixfs')\nconst toTrail = require('./utils/to-trail')\nconst addLink = require('./utils/add-link')\nconst updateTree = require('./utils/update-tree')\nconst updateMfsRoot = require('./utils/update-mfs-root')\nconst { DAGNode } = require('ipld-dag-pb')\nconst mc = require('multicodec')\nconst mh = require('multihashing-async').multihash\nconst { pipe } = require('it-pipe')\nconst { importer } = require('ipfs-unixfs-importer')\nconst { recursive } = require('ipfs-unixfs-exporter')\nconst last = require('it-last')\nconst cp = require('./cp')\nconst rm = require('./rm')\n// @ts-ignore - TODO: refactor this so it does not require a deep require\nconst persist = require('ipfs-unixfs-importer/src/utils/persist')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('./').MfsContext} MfsContext\n * @typedef {object} DefaultOptions\n * @property {boolean} flush\n * @property {HashName} hashAlg\n * @property {CIDVersion} cidVersion\n * @property {number} shardSplitThreshold\n * @property {boolean} recursive\n * @property {AbortSignal} [signal]\n * @property {number} [timeout]\n */\n\n/**\n * @type {DefaultOptions}\n */\nconst defaultOptions = {\n  flush: true,\n  shardSplitThreshold: 1000,\n  hashAlg: 'sha2-256',\n  cidVersion: 0,\n  recursive: false\n}\n\n/**\n * @param {string} mode\n * @param {number} originalMode\n * @param {boolean} isDirectory\n */\nfunction calculateModification (mode, originalMode, isDirectory) {\n  let modification = 0\n\n  if (mode.includes('x') || (mode.includes('X') && (isDirectory || (originalMode & 0o1 || originalMode & 0o10 || originalMode & 0o100)))) {\n    modification += 1\n  }\n\n  if (mode.includes('w')) {\n    modification += 2\n  }\n\n  if (mode.includes('r')) {\n    modification += 4\n  }\n\n  return modification\n}\n\n/**\n * @param {string} references\n * @param {number} modification\n */\nfunction calculateUGO (references, modification) {\n  let ugo = 0\n\n  if (references.includes('u')) {\n    ugo += (modification << 6)\n  }\n\n  if (references.includes('g')) {\n    ugo += (modification << 3)\n  }\n\n  if (references.includes('o')) {\n    ugo += (modification)\n  }\n\n  return ugo\n}\n\n/**\n * @param {string} references\n * @param {string} mode\n * @param {number} modification\n */\nfunction calculateSpecial (references, mode, modification) {\n  if (mode.includes('t')) {\n    modification += parseInt('1000', 8)\n  }\n\n  if (mode.includes('s')) {\n    if (references.includes('u')) {\n      modification += parseInt('4000', 8)\n    }\n\n    if (references.includes('g')) {\n      modification += parseInt('2000', 8)\n    }\n  }\n\n  return modification\n}\n\n/**\n * https://en.wikipedia.org/wiki/Chmod#Symbolic_modes\n *\n * @param {string} input\n * @param {number} originalMode\n * @param {boolean} isDirectory\n */\nfunction parseSymbolicMode (input, originalMode, isDirectory) {\n  if (!originalMode) {\n    originalMode = 0\n  }\n\n  const match = input.match(/^(u?g?o?a?)(-?\\+?=?)?(r?w?x?X?s?t?)$/)\n\n  if (!match) {\n    throw new Error(`Invalid file mode: ${input}`)\n  }\n\n  let [\n    ,\n    references,\n    operator,\n    mode\n  ] = match\n\n  if (references === 'a' || !references) {\n    references = 'ugo'\n  }\n\n  let modification = calculateModification(mode, originalMode, isDirectory)\n  modification = calculateUGO(references, modification)\n  modification = calculateSpecial(references, mode, modification)\n\n  if (operator === '=') {\n    if (references.includes('u')) {\n      // blank u bits\n      originalMode = originalMode & parseInt('7077', 8)\n\n      // or them together\n      originalMode = originalMode | modification\n    }\n\n    if (references.includes('g')) {\n      // blank g bits\n      originalMode = originalMode & parseInt('7707', 8)\n\n      // or them together\n      originalMode = originalMode | modification\n    }\n\n    if (references.includes('o')) {\n      // blank o bits\n      originalMode = originalMode & parseInt('7770', 8)\n\n      // or them together\n      originalMode = originalMode | modification\n    }\n\n    return originalMode\n  }\n\n  if (operator === '+') {\n    return modification | originalMode\n  }\n\n  if (operator === '-') {\n    return modification ^ originalMode\n  }\n\n  return originalMode\n}\n\n/**\n * @param {string | InstanceType<typeof window.String> | number} mode\n * @param {UnixFS} metadata\n * @returns {number}\n */\nfunction calculateMode (mode, metadata) {\n  if (mode instanceof String || typeof mode === 'string') {\n    const strMode = `${mode}`\n\n    if (strMode.match(/^\\d+$/g)) {\n      mode = parseInt(strMode, 8)\n    } else {\n      // @ts-ignore freaks out over the curr: number, acc: string thing\n      mode = 0 + strMode.split(',').reduce((curr, acc) => {\n        return parseSymbolicMode(acc, curr, metadata.isDirectory())\n      }, metadata.mode || 0)\n    }\n  }\n\n  return mode\n}\n\n/**\n * @param {MfsContext} context\n */\nmodule.exports = (context) => {\n  /**\n   * @type {import('ipfs-core-types/src/files').API[\"chmod\"]}\n   */\n  async function mfsChmod (path, mode, options = {}) {\n    /** @type {DefaultOptions} */\n    const opts = mergeOptions(defaultOptions, options)\n\n    log(`Fetching stats for ${path}`)\n\n    const {\n      cid,\n      mfsDirectory,\n      name\n    } = await toMfsPath(context, path, opts)\n\n    if (cid.codec !== 'dag-pb') {\n      throw errCode(new Error(`${path} was not a UnixFS node`), 'ERR_NOT_UNIXFS')\n    }\n\n    if (opts.recursive) {\n      // recursively export from root CID, change perms of each entry then reimport\n      // but do not reimport files, only manipulate dag-pb nodes\n      const root = await pipe(\n        async function * () {\n          for await (const entry of recursive(cid, context.ipld)) {\n            if (entry.type !== 'file' && entry.type !== 'directory') {\n              throw errCode(new Error(`${path} was not a UnixFS node`), 'ERR_NOT_UNIXFS')\n            }\n\n            entry.unixfs.mode = calculateMode(mode, entry.unixfs)\n\n            const node = new DAGNode(entry.unixfs.marshal(), entry.node.Links)\n\n            yield {\n              path: entry.path,\n              content: node\n            }\n          }\n        },\n        // @ts-ignore source is not compatible because we are not importing files\n        (source) => importer(source, context.block, {\n          ...opts,\n          pin: false,\n          dagBuilder: async function * (source, block, opts) {\n            for await (const entry of source) {\n              yield async function () {\n                /** @type {DAGNode} */\n                // @ts-ignore - cannot derive type\n                const node = entry.content\n\n                const buf = node.serialize()\n                const cid = await persist(buf, block, opts)\n                const unixfs = UnixFS.unmarshal(node.Data)\n\n                return {\n                  cid,\n                  size: buf.length,\n                  path: entry.path,\n                  unixfs\n                }\n              }\n            }\n          }\n        }),\n        (nodes) => last(nodes)\n      )\n\n      if (!root) {\n        throw errCode(new Error(`Could not chmod ${path}`), 'ERR_COULD_NOT_CHMOD')\n      }\n\n      // remove old path from mfs\n      await rm(context)(path, opts)\n\n      // add newly created tree to mfs at path\n      await cp(context)(`/ipfs/${root.cid}`, path, opts)\n\n      return\n    }\n\n    let node = await context.ipld.get(cid)\n    const metadata = UnixFS.unmarshal(node.Data)\n    metadata.mode = calculateMode(mode, metadata)\n    node = new DAGNode(metadata.marshal(), node.Links)\n\n    /** @type {HashName} */\n    const hashAlg = opts.hashAlg || defaultOptions.hashAlg\n\n    const updatedCid = await context.ipld.put(node, mc.DAG_PB, {\n      cidVersion: cid.version,\n      hashAlg: mh.names[hashAlg],\n      onlyHash: !opts.flush\n    })\n\n    const trail = await toTrail(context, mfsDirectory)\n    const parent = trail[trail.length - 1]\n    const parentNode = await context.ipld.get(parent.cid)\n\n    const result = await addLink(context, {\n      parent: parentNode,\n      name: name,\n      cid: updatedCid,\n      size: node.serialize().length,\n      flush: opts.flush,\n      hashAlg: hashAlg,\n      cidVersion: cid.version,\n      shardSplitThreshold: Infinity\n    })\n\n    parent.cid = result.cid\n\n    // update the tree with the new child\n    const newRootCid = await updateTree(context, trail, opts)\n\n    // Update the MFS record with the new CID for the root of the tree\n    await updateMfsRoot(context, newRootCid, opts)\n  }\n\n  return withTimeoutOption(mfsChmod)\n}\n","'use strict'\n\nconst { walkPath } = require('ipfs-unixfs-exporter')\nconst log = require('debug')('ipfs:mfs:utils:to-trail')\n\n/**\n * @typedef {import('../').MfsContext} MfsContext\n * @typedef {object} MfsTrail\n * @property {string} name\n * @property {import('cids')} cid\n * @property {number} [size]\n * @property {string} [type]\n *\n * TODO: export supported types from unixfs-exporter and use for `type` above\n */\n\n/**\n * @param {MfsContext} context\n * @param {string} path\n * @returns {Promise<MfsTrail[]>}\n */\nconst toTrail = async (context, path) => {\n  log(`Creating trail for path ${path}`)\n\n  const output = []\n\n  for await (const fsEntry of walkPath(path, context.ipld)) {\n    let size\n\n    // TODO: include `.size` property in unixfs-exporter output\n    if (fsEntry.node instanceof Uint8Array) {\n      size = fsEntry.node.length\n    } else {\n      size = fsEntry.node.size\n    }\n\n    output.push({\n      name: fsEntry.name,\n      cid: fsEntry.cid,\n      size,\n      type: fsEntry.type\n    })\n  }\n\n  return output\n}\n\nmodule.exports = toTrail\n","'use strict'\n\nconst {\n  DAGLink,\n  DAGNode\n} = require('ipld-dag-pb')\nconst CID = require('cids')\nconst log = require('debug')('ipfs:mfs:core:utils:add-link')\nconst { UnixFS } = require('ipfs-unixfs')\n// @ts-ignore - refactor this to not need deep require\nconst DirSharded = require('ipfs-unixfs-importer/src/dir-sharded')\n// @ts-ignore - refactor this to not need deep require\nconst defaultImporterOptions = require('ipfs-unixfs-importer/src/options')\nconst {\n  updateHamtDirectory,\n  recreateHamtLevel,\n  recreateInitialHamtLevel,\n  createShard,\n  toPrefix,\n  addLinksToHamtBucket\n} = require('./hamt-utils')\nconst errCode = require('err-code')\nconst mc = require('multicodec')\nconst mh = require('multihashing-async').multihash\nconst last = require('it-last')\n\n/**\n * @typedef {import('ipfs-unixfs').Mtime} Mtime\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('hamt-sharding').Bucket<any>} Bucket\n * @typedef {import('../').MfsContext} MfsContext\n */\n\n/**\n * @param {MfsContext} context\n * @param {object} options\n * @param {CID} options.cid\n * @param {string} options.name\n * @param {number} options.size\n * @param {number} options.shardSplitThreshold\n * @param {HashName} options.hashAlg\n * @param {CIDVersion} options.cidVersion\n * @param {boolean} options.flush\n * @param {CID} [options.parentCid]\n * @param {DAGNode} [options.parent]\n */\nconst addLink = async (context, options) => {\n  let parent = options.parent\n\n  if (options.parentCid) {\n    if (!CID.isCID(options.parentCid)) {\n      throw errCode(new Error('Invalid CID passed to addLink'), 'EINVALIDPARENTCID')\n    }\n\n    log(`Loading parent node ${options.parentCid}`)\n    parent = await context.ipld.get(options.parentCid)\n  }\n\n  if (!parent) {\n    throw errCode(new Error('No parent node or CID passed to addLink'), 'EINVALIDPARENT')\n  }\n\n  if (!options.cid) {\n    throw errCode(new Error('No child cid passed to addLink'), 'EINVALIDCHILDCID')\n  }\n\n  if (!options.name) {\n    throw errCode(new Error('No child name passed to addLink'), 'EINVALIDCHILDNAME')\n  }\n\n  if (!CID.isCID(options.cid)) {\n    options.cid = new CID(options.cid)\n  }\n\n  if (!options.size && options.size !== 0) {\n    throw errCode(new Error('No child size passed to addLink'), 'EINVALIDCHILDSIZE')\n  }\n\n  const meta = UnixFS.unmarshal(parent.Data)\n\n  if (meta.type === 'hamt-sharded-directory') {\n    log('Adding link to sharded directory')\n\n    return addToShardedDirectory(context, {\n      ...options,\n      parent\n    })\n  }\n\n  if (parent.Links.length >= options.shardSplitThreshold) {\n    log('Converting directory to sharded directory')\n\n    return convertToShardedDirectory(context, {\n      ...options,\n      parent,\n      mtime: meta.mtime,\n      mode: meta.mode\n    })\n  }\n\n  log(`Adding ${options.name} (${options.cid}) to regular directory`)\n\n  return addToDirectory(context, {\n    ...options,\n    parent\n  })\n}\n\n/**\n * @param {MfsContext} context\n * @param {object} options\n * @param {CID} options.cid\n * @param {string} options.name\n * @param {number} options.size\n * @param {DAGNode} options.parent\n * @param {HashName} options.hashAlg\n * @param {CIDVersion} options.cidVersion\n * @param {boolean} options.flush\n * @param {Mtime} [options.mtime]\n * @param {number} [options.mode]\n */\nconst convertToShardedDirectory = async (context, options) => {\n  const result = await createShard(context, options.parent.Links.map(link => ({\n    name: link.Name,\n    size: link.Tsize,\n    cid: link.Hash\n  })).concat({\n    name: options.name,\n    size: options.size,\n    cid: options.cid\n  }), options)\n\n  log(`Converted directory to sharded directory ${result.cid}`)\n\n  return result\n}\n\n/**\n * @param {MfsContext} context\n * @param {object} options\n * @param {CID} options.cid\n * @param {string} options.name\n * @param {number} options.size\n * @param {DAGNode} options.parent\n * @param {HashName} options.hashAlg\n * @param {CIDVersion} options.cidVersion\n * @param {boolean} options.flush\n * @param {Mtime} [options.mtime]\n * @param {number} [options.mode]\n */\nconst addToDirectory = async (context, options) => {\n  options.parent.rmLink(options.name)\n  options.parent.addLink(new DAGLink(options.name, options.size, options.cid))\n\n  const node = UnixFS.unmarshal(options.parent.Data)\n\n  if (node.mtime) {\n    // Update mtime if previously set\n    const ms = Date.now()\n    const secs = Math.floor(ms / 1000)\n\n    node.mtime = {\n      secs: secs,\n      nsecs: (ms - (secs * 1000)) * 1000\n    }\n\n    options.parent = new DAGNode(node.marshal(), options.parent.Links)\n  }\n\n  const hashAlg = mh.names[options.hashAlg]\n\n  // Persist the new parent DAGNode\n  const cid = await context.ipld.put(options.parent, mc.DAG_PB, {\n    cidVersion: options.cidVersion,\n    hashAlg,\n    onlyHash: !options.flush\n  })\n\n  return {\n    node: options.parent,\n    cid,\n    size: options.parent.size\n  }\n}\n\n/**\n * @param {MfsContext} context\n * @param {object} options\n * @param {CID} options.cid\n * @param {string} options.name\n * @param {number} options.size\n * @param {DAGNode} options.parent\n * @param {HashName} options.hashAlg\n * @param {CIDVersion} options.cidVersion\n * @param {boolean} options.flush\n */\nconst addToShardedDirectory = async (context, options) => {\n  const {\n    shard, path\n  } = await addFileToShardedDirectory(context, options)\n\n  const result = await last(shard.flush(context.block))\n  /** @type {DAGNode} */\n  const node = await context.ipld.get(result.cid)\n\n  // we have written out the shard, but only one sub-shard will have been written so replace it in the original shard\n  const oldLink = options.parent.Links\n    .find(link => link.Name.substring(0, 2) === path[0].prefix)\n\n  /** @type {DAGLink | undefined} */\n  const newLink = node.Links\n    .find(link => link.Name.substring(0, 2) === path[0].prefix)\n\n  if (!newLink) {\n    throw new Error(`No link found with prefix ${path[0].prefix}`)\n  }\n\n  if (oldLink) {\n    options.parent.rmLink(oldLink.Name)\n  }\n\n  options.parent.addLink(newLink)\n\n  return updateHamtDirectory(context, options.parent.Links, path[0].bucket, options)\n}\n\n/**\n * @param {MfsContext} context\n * @param {object} options\n * @param {CID} options.cid\n * @param {string} options.name\n * @param {number} options.size\n * @param {DAGNode} options.parent\n * @param {HashName} options.hashAlg\n * @param {CIDVersion} options.cidVersion\n */\nconst addFileToShardedDirectory = async (context, options) => {\n  const file = {\n    name: options.name,\n    cid: options.cid,\n    size: options.size\n  }\n\n  // start at the root bucket and descend, loading nodes as we go\n  const rootBucket = await recreateInitialHamtLevel(options.parent.Links)\n  const node = UnixFS.unmarshal(options.parent.Data)\n  const importerOptions = defaultImporterOptions()\n\n  const shard = new DirSharded({\n    root: true,\n    dir: true,\n    parent: null,\n    parentKey: null,\n    path: '',\n    dirty: true,\n    flat: false,\n    mode: node.mode\n  }, {\n    hamtHashFn: importerOptions.hamtHashFn,\n    hamtHashCode: importerOptions.hamtHashCode,\n    hamtBucketBits: importerOptions.hamtBucketBits,\n    ...options\n  })\n  shard._bucket = rootBucket\n\n  if (node.mtime) {\n    // update mtime if previously set\n    shard.mtime = new Date()\n  }\n\n  // load subshards until the bucket & position no longer changes\n  const position = await rootBucket._findNewBucketAndPos(file.name)\n  const path = toBucketPath(position)\n  path[0].node = options.parent\n  let index = 0\n\n  while (index < path.length) {\n    const segment = path[index]\n    index++\n    const node = segment.node\n\n    if (!node) {\n      throw new Error('Segment had no node')\n    }\n\n    const link = node.Links\n      .find(link => link.Name.substring(0, 2) === segment.prefix)\n\n    if (!link) {\n      // prefix is new, file will be added to the current bucket\n      log(`Link ${segment.prefix}${file.name} will be added`)\n      index = path.length\n\n      break\n    }\n\n    if (link.Name === `${segment.prefix}${file.name}`) {\n      // file already existed, file will be added to the current bucket\n      log(`Link ${segment.prefix}${file.name} will be replaced`)\n      index = path.length\n\n      break\n    }\n\n    if (link.Name.length > 2) {\n      // another file had the same prefix, will be replaced with a subshard\n      log(`Link ${link.Name} ${link.Hash} will be replaced with a subshard`)\n      index = path.length\n\n      break\n    }\n\n    // load sub-shard\n    log(`Found subshard ${segment.prefix}`)\n    const subShard = await context.ipld.get(link.Hash)\n\n    // subshard hasn't been loaded, descend to the next level of the HAMT\n    if (!path[index]) {\n      log(`Loaded new subshard ${segment.prefix}`)\n      await recreateHamtLevel(subShard.Links, rootBucket, segment.bucket, parseInt(segment.prefix, 16))\n\n      const position = await rootBucket._findNewBucketAndPos(file.name)\n\n      path.push({\n        bucket: position.bucket,\n        prefix: toPrefix(position.pos),\n        node: subShard\n      })\n\n      break\n    }\n\n    const nextSegment = path[index]\n\n    // add next levels worth of links to bucket\n    await addLinksToHamtBucket(subShard.Links, nextSegment.bucket, rootBucket)\n\n    nextSegment.node = subShard\n  }\n\n  // finally add the new file into the shard\n  await shard._bucket.put(file.name, {\n    size: file.size,\n    cid: file.cid\n  })\n\n  return {\n    shard, path\n  }\n}\n\n/**\n * @param {{ pos: number, bucket: Bucket }} position\n * @returns {{ bucket: Bucket, prefix: string, node?: DAGNode }[]}\n */\nconst toBucketPath = (position) => {\n  const path = [{\n    bucket: position.bucket,\n    prefix: toPrefix(position.pos)\n  }]\n\n  let bucket = position.bucket._parent\n  let positionInBucket = position.bucket._posAtParent\n\n  while (bucket) {\n    path.push({\n      bucket,\n      prefix: toPrefix(positionInBucket)\n    })\n\n    positionInBucket = bucket._posAtParent\n    bucket = bucket._parent\n  }\n\n  path.reverse()\n\n  return path\n}\n\nmodule.exports = addLink\n","'use strict'\n\nconst {\n  DAGNode\n} = require('ipld-dag-pb')\nconst {\n  Bucket,\n  createHAMT\n} = require('hamt-sharding')\n// @ts-ignore - refactor this to not need deep require\nconst DirSharded = require('ipfs-unixfs-importer/src/dir-sharded')\n// @ts-ignore - refactor this to not need deep require\nconst defaultImporterOptions = require('ipfs-unixfs-importer/src/options')\nconst log = require('debug')('ipfs:mfs:core:utils:hamt-utils')\nconst { UnixFS } = require('ipfs-unixfs')\nconst mc = require('multicodec')\nconst mh = require('multihashing-async').multihash\nconst last = require('it-last')\n\n/**\n * @typedef {import('ipld-dag-pb').DAGLink} DAGLink\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('ipfs-unixfs').Mtime} Mtime\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('cids')} CID\n * @typedef {import('../').MfsContext} MfsContext\n */\n\n/**\n * @param {MfsContext} context\n * @param {DAGLink[]} links\n * @param {Bucket<any>} bucket\n * @param {object} options\n * @param {DAGNode} options.parent\n * @param {CIDVersion} options.cidVersion\n * @param {boolean} options.flush\n * @param {HashName} options.hashAlg\n */\nconst updateHamtDirectory = async (context, links, bucket, options) => {\n  const importerOptions = defaultImporterOptions()\n\n  // update parent with new bit field\n  const data = Uint8Array.from(bucket._children.bitField().reverse())\n  const node = UnixFS.unmarshal(options.parent.Data)\n  const dir = new UnixFS({\n    type: 'hamt-sharded-directory',\n    data,\n    fanout: bucket.tableSize(),\n    hashType: importerOptions.hamtHashCode,\n    mode: node.mode,\n    mtime: node.mtime\n  })\n\n  const hashAlg = mh.names[options.hashAlg]\n  const parent = new DAGNode(dir.marshal(), links)\n  const cid = await context.ipld.put(parent, mc.DAG_PB, {\n    cidVersion: options.cidVersion,\n    hashAlg,\n    onlyHash: !options.flush\n  })\n\n  return {\n    node: parent,\n    cid,\n    size: parent.size\n  }\n}\n\n/**\n * @param {DAGLink[]} links\n * @param {Bucket<any>} rootBucket\n * @param {Bucket<any>} parentBucket\n * @param {number} positionAtParent\n */\nconst recreateHamtLevel = async (links, rootBucket, parentBucket, positionAtParent) => {\n  // recreate this level of the HAMT\n  const bucket = new Bucket({\n    hash: rootBucket._options.hash,\n    bits: rootBucket._options.bits\n  }, parentBucket, positionAtParent)\n  parentBucket._putObjectAt(positionAtParent, bucket)\n\n  await addLinksToHamtBucket(links, bucket, rootBucket)\n\n  return bucket\n}\n\n/**\n * @param {DAGLink[]} links\n */\nconst recreateInitialHamtLevel = async (links) => {\n  const importerOptions = defaultImporterOptions()\n  const bucket = createHAMT({\n    hashFn: importerOptions.hamtHashFn,\n    bits: importerOptions.hamtBucketBits\n  })\n\n  await addLinksToHamtBucket(links, bucket, bucket)\n\n  return bucket\n}\n\n/**\n * @param {DAGLink[]} links\n * @param {Bucket<any>} bucket\n * @param {Bucket<any>} rootBucket\n */\nconst addLinksToHamtBucket = async (links, bucket, rootBucket) => {\n  await Promise.all(\n    links.map(link => {\n      if (link.Name.length === 2) {\n        const pos = parseInt(link.Name, 16)\n\n        bucket._putObjectAt(pos, new Bucket({\n          hash: rootBucket._options.hash,\n          bits: rootBucket._options.bits\n        }, bucket, pos))\n\n        return Promise.resolve()\n      }\n\n      return rootBucket.put(link.Name.substring(2), {\n        size: link.Tsize,\n        cid: link.Hash\n      })\n    })\n  )\n}\n\n/**\n * @param {number} position\n */\nconst toPrefix = (position) => {\n  return position\n    .toString(16)\n    .toUpperCase()\n    .padStart(2, '0')\n    .substring(0, 2)\n}\n\n/**\n * @param {MfsContext} context\n * @param {string} fileName\n * @param {DAGNode} rootNode\n */\nconst generatePath = async (context, fileName, rootNode) => {\n  // start at the root bucket and descend, loading nodes as we go\n  const rootBucket = await recreateInitialHamtLevel(rootNode.Links)\n  const position = await rootBucket._findNewBucketAndPos(fileName)\n\n  // the path to the root bucket\n  /** @type {{ bucket: Bucket<any>, prefix: string, node?: DAGNode }[]} */\n  const path = [{\n    bucket: position.bucket,\n    prefix: toPrefix(position.pos)\n  }]\n  let currentBucket = position.bucket\n\n  while (currentBucket !== rootBucket) {\n    path.push({\n      bucket: currentBucket,\n      prefix: toPrefix(currentBucket._posAtParent)\n    })\n\n    // @ts-ignore - only the root bucket's parent will be undefined\n    currentBucket = currentBucket._parent\n  }\n\n  path.reverse()\n  path[0].node = rootNode\n\n  // load DAGNode for each path segment\n  for (let i = 0; i < path.length; i++) {\n    const segment = path[i]\n\n    if (!segment.node) {\n      throw new Error('Could not generate HAMT path')\n    }\n\n    // find prefix in links\n    const link = segment.node.Links\n      .filter(link => link.Name.substring(0, 2) === segment.prefix)\n      .pop()\n\n    // entry was not in shard\n    if (!link) {\n      // reached bottom of tree, file will be added to the current bucket\n      log(`Link ${segment.prefix}${fileName} will be added`)\n      // return path\n      continue\n    }\n\n    // found entry\n    if (link.Name === `${segment.prefix}${fileName}`) {\n      log(`Link ${segment.prefix}${fileName} will be replaced`)\n      // file already existed, file will be added to the current bucket\n      // return path\n      continue\n    }\n\n    // found subshard\n    log(`Found subshard ${segment.prefix}`)\n    const node = await context.ipld.get(link.Hash)\n\n    // subshard hasn't been loaded, descend to the next level of the HAMT\n    if (!path[i + 1]) {\n      log(`Loaded new subshard ${segment.prefix}`)\n\n      await recreateHamtLevel(node.Links, rootBucket, segment.bucket, parseInt(segment.prefix, 16))\n      const position = await rootBucket._findNewBucketAndPos(fileName)\n\n      // i--\n      path.push({\n        bucket: position.bucket,\n        prefix: toPrefix(position.pos),\n        node: node\n      })\n\n      continue\n    }\n\n    const nextSegment = path[i + 1]\n\n    // add intermediate links to bucket\n    await addLinksToHamtBucket(node.Links, nextSegment.bucket, rootBucket)\n\n    nextSegment.node = node\n  }\n\n  await rootBucket.put(fileName, true)\n\n  path.reverse()\n\n  return {\n    rootBucket,\n    path\n  }\n}\n\n/**\n * @param {MfsContext} context\n * @param {{ name: string, size: number, cid: CID }[]} contents\n * @param {object} [options]\n * @param {Mtime} [options.mtime]\n * @param {number} [options.mode]\n */\nconst createShard = async (context, contents, options = {}) => {\n  const importerOptions = defaultImporterOptions()\n\n  const shard = new DirSharded({\n    root: true,\n    dir: true,\n    parent: null,\n    parentKey: null,\n    path: '',\n    dirty: true,\n    flat: false,\n    mtime: options.mtime,\n    mode: options.mode\n  }, {\n    hamtHashFn: importerOptions.hamtHashFn,\n    hamtHashCode: importerOptions.hamtHashCode,\n    hamtBucketBits: importerOptions.hamtBucketBits,\n    ...options,\n    codec: 'dag-pb'\n  })\n\n  for (let i = 0; i < contents.length; i++) {\n    await shard._bucket.put(contents[i].name, {\n      size: contents[i].size,\n      cid: contents[i].cid\n    })\n  }\n\n  return last(shard.flush(context.block))\n}\n\nmodule.exports = {\n  generatePath,\n  updateHamtDirectory,\n  recreateHamtLevel,\n  recreateInitialHamtLevel,\n  addLinksToHamtBucket,\n  toPrefix,\n  createShard\n}\n","'use strict'\n\nconst log = require('debug')('ipfs:mfs:utils:update-tree')\nconst addLink = require('./add-link')\n\nconst defaultOptions = {\n  shardSplitThreshold: 1000\n}\n\n/**\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('cids')} CID\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('../').MfsContext} MfsContext\n * @typedef {import('./to-trail').MfsTrail} MfsTrail\n */\n\n/**\n * Loop backwards through the trail, replacing links of all components to update CIDs\n *\n * @param {MfsContext} context\n * @param {MfsTrail[]} trail\n * @param {object} options\n * @param {number} options.shardSplitThreshold\n * @param {HashName} options.hashAlg\n * @param {CIDVersion} options.cidVersion\n * @param {boolean} options.flush\n */\nconst updateTree = async (context, trail, options) => {\n  options = Object.assign({}, defaultOptions, options)\n\n  log('Trail', trail)\n  trail = trail.slice().reverse()\n\n  let index = 0\n  let child\n\n  for await (const node of context.ipld.getMany(trail.map(node => node.cid))) {\n    const cid = trail[index].cid\n    const name = trail[index].name\n    index++\n\n    if (!child) {\n      child = {\n        cid,\n        name,\n        size: node.size\n      }\n\n      continue\n    }\n\n    /** @type {{ cid: CID, size: number }} */\n    const result = await addLink(context, {\n      parent: node,\n      name: child.name,\n      cid: child.cid,\n      size: child.size,\n      flush: options.flush,\n      shardSplitThreshold: options.shardSplitThreshold,\n      hashAlg: options.hashAlg,\n      cidVersion: options.cidVersion\n    })\n\n    // new child for next loop\n    child = {\n      cid: result.cid,\n      name,\n      size: result.size\n    }\n  }\n\n  // @ts-ignore - child is possibly undefined\n  const { cid } = child\n  log(`Final CID ${cid}`)\n\n  return cid\n}\n\nmodule.exports = updateTree\n","'use strict'\n\nconst log = require('debug')('ipfs:mfs:utils:update-mfs-root')\nconst {\n  MFS_ROOT_KEY\n} = require('../../../utils')\nconst errCode = require('err-code')\n\n/**\n * @typedef {import('../').MfsContext} MfsContext\n */\n\n/**\n * @param {MfsContext} context\n * @param {import('cids')} cid\n * @param {import('ipfs-core-types/src/utils').AbortOptions} options\n */\nconst updateMfsRoot = async (context, cid, options) => {\n  if (options && options.signal && options.signal.aborted) {\n    throw errCode(new Error('Request aborted'), 'ERR_ABORTED', { name: 'Aborted' })\n  }\n\n  log(`New MFS root will be ${cid}`)\n\n  await context.repo.datastore.put(MFS_ROOT_KEY, cid.bytes)\n\n  return cid\n}\n\nmodule.exports = updateMfsRoot\n","'use strict'\n\nconst mkdir = require('./mkdir')\nconst stat = require('./stat')\nconst log = require('debug')('ipfs:mfs:cp')\nconst errCode = require('err-code')\nconst updateTree = require('./utils/update-tree')\nconst updateMfsRoot = require('./utils/update-mfs-root')\nconst addLink = require('./utils/add-link')\nconst toMfsPath = require('./utils/to-mfs-path')\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\nconst toTrail = require('./utils/to-trail')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @typedef {import('ipld-dag-pb').DAGNode} DAGNode\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('cids')} CID\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('ipfs-unixfs').Mtime} Mtime\n * @typedef {import('./utils/to-mfs-path').MfsPath} MfsPath\n * @typedef {import('./utils/to-trail').MfsTrail} MfsTrail\n * @typedef {import('./').MfsContext} MfsContext\n * @typedef {object} DefaultOptions\n * @property {boolean} parents\n * @property {boolean} flush\n * @property {HashName} hashAlg\n * @property {CIDVersion} cidVersion\n * @property {number} shardSplitThreshold\n * @property {AbortSignal} [signal]\n * @property {number} [timeout]\n */\n\n/**\n * @type {DefaultOptions}\n */\nconst defaultOptions = {\n  parents: false,\n  flush: true,\n  hashAlg: 'sha2-256',\n  cidVersion: 0,\n  shardSplitThreshold: 1000\n}\n\n/**\n * @param {MfsContext} context\n */\nmodule.exports = (context) => {\n  /**\n   * @type {import('ipfs-core-types/src/files').API[\"cp\"]}\n   */\n  async function mfsCp (from, to, opts = {}) {\n    /** @type {DefaultOptions} */\n    const options = mergeOptions(defaultOptions, opts)\n\n    if (!Array.isArray(from)) {\n      from = [from]\n    }\n\n    const sources = await Promise.all(\n      from.map(path => toMfsPath(context, path, options))\n    )\n    let destination = await toMfsPath(context, to, options)\n\n    if (!sources.length || !destination) {\n      throw errCode(new Error('Please supply at least one source'), 'ERR_INVALID_PARAMS')\n    }\n\n    // make sure all sources exist\n    const missing = sources.find(source => !source.exists)\n\n    if (missing) {\n      throw errCode(new Error(`${missing.path} does not exist`), 'ERR_INVALID_PARAMS')\n    }\n\n    const destinationIsDirectory = isDirectory(destination)\n\n    if (destination.exists) {\n      log('Destination exists')\n\n      if (sources.length === 1 && !destinationIsDirectory) {\n        throw errCode(new Error('directory already has entry by that name'), 'ERR_ALREADY_EXISTS')\n      }\n    } else {\n      log('Destination does not exist')\n\n      if (sources.length > 1) {\n        // copying multiple files to one location, destination will be a directory\n        if (!options.parents) {\n          throw errCode(new Error('destination did not exist, pass -p to create intermediate directories'), 'ERR_INVALID_PARAMS')\n        }\n\n        await mkdir(context)(destination.path, options)\n        destination = await toMfsPath(context, destination.path, options)\n      } else if (destination.parts.length > 1) {\n        // copying to a folder, create it if necessary\n        const parentFolder = `/${destination.parts.slice(0, -1).join('/')}`\n\n        try {\n          await stat(context)(parentFolder, options)\n        } catch (err) {\n          if (err.code !== 'ERR_NOT_FOUND') {\n            throw err\n          }\n\n          if (!options.parents) {\n            throw errCode(new Error('destination did not exist, pass -p to create intermediate directories'), 'ERR_INVALID_PARAMS')\n          }\n\n          await mkdir(context)(parentFolder, options)\n          destination = await toMfsPath(context, destination.path, options)\n        }\n      }\n    }\n\n    const destinationPath = isDirectory(destination) ? destination.mfsPath : destination.mfsDirectory\n    const trail = await toTrail(context, destinationPath)\n\n    if (sources.length === 1) {\n      const source = sources.pop()\n\n      if (!source) {\n        throw errCode(new Error('could not find source'), 'ERR_INVALID_PARAMS')\n      }\n\n      const destinationName = destinationIsDirectory ? source.name : destination.name\n\n      log(`Only one source, copying to destination ${destinationIsDirectory ? 'directory' : 'file'} ${destinationName}`)\n\n      return copyToFile(context, source, destinationName, trail, options)\n    }\n\n    log('Multiple sources, wrapping in a directory')\n    return copyToDirectory(context, sources, destination, trail, options)\n  }\n\n  return withTimeoutOption(mfsCp)\n}\n\n/**\n * @param {*} destination\n */\nconst isDirectory = (destination) => {\n  return destination.unixfs &&\n    destination.unixfs.type &&\n    destination.unixfs.type.includes('directory')\n}\n\n/**\n * @param {MfsContext} context\n * @param {MfsPath} source\n * @param {string} destination\n * @param {MfsTrail[]} destinationTrail\n * @param {DefaultOptions} options\n */\nconst copyToFile = async (context, source, destination, destinationTrail, options) => {\n  let parent = destinationTrail.pop()\n\n  if (!parent) {\n    throw errCode(new Error('destination had no parent'), 'ERR_INVALID_PARAMS')\n  }\n\n  parent = await addSourceToParent(context, source, destination, parent, options)\n\n  // update the tree with the new containing directory\n  destinationTrail.push(parent)\n\n  const newRootCid = await updateTree(context, destinationTrail, options)\n\n  // Update the MFS record with the new CID for the root of the tree\n  await updateMfsRoot(context, newRootCid, options)\n}\n\n/**\n * @param {MfsContext} context\n * @param {MfsPath[]} sources\n * @param {*} destination\n * @param {MfsTrail[]} destinationTrail\n * @param {DefaultOptions} options\n */\nconst copyToDirectory = async (context, sources, destination, destinationTrail, options) => {\n  // copy all the sources to the destination\n  for (let i = 0; i < sources.length; i++) {\n    const source = sources[i]\n\n    destination = await addSourceToParent(context, source, source.name, destination, options)\n  }\n\n  // update the tree with the new containing directory\n  destinationTrail[destinationTrail.length - 1] = destination\n\n  const newRootCid = await updateTree(context, destinationTrail, options)\n\n  // Update the MFS record with the new CID for the root of the tree\n  await updateMfsRoot(context, newRootCid, options)\n}\n\n/**\n * @param {MfsContext} context\n * @param {MfsPath} source\n * @param {string} childName\n * @param {*} parent\n * @param {DefaultOptions} options\n * @returns {Promise<MfsTrail>}\n */\nconst addSourceToParent = async (context, source, childName, parent, options) => {\n  const sourceBlock = await context.repo.blocks.get(source.cid)\n\n  const {\n    node,\n    cid\n  } = await addLink(context, {\n    parentCid: parent.cid,\n    size: sourceBlock.data.length,\n    cid: source.cid,\n    name: childName,\n    hashAlg: options.hashAlg,\n    cidVersion: options.cidVersion,\n    flush: options.flush,\n    shardSplitThreshold: options.shardSplitThreshold\n  })\n\n  parent.node = node\n  parent.cid = cid\n  parent.size = node.size\n\n  return parent\n}\n","'use strict'\n\nconst errCode = require('err-code')\nconst log = require('debug')('ipfs:mfs:mkdir')\nconst { exporter } = require('ipfs-unixfs-exporter')\nconst createNode = require('./utils/create-node')\nconst toPathComponents = require('./utils/to-path-components')\nconst updateMfsRoot = require('./utils/update-mfs-root')\nconst updateTree = require('./utils/update-tree')\nconst addLink = require('./utils/add-link')\nconst withMfsRoot = require('./utils/with-mfs-root')\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @typedef {import('ipld-dag-pb').DAGNode} DAGNode\n * @typedef {import('ipld-dag-pb').DAGLink} DAGLink\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('cids')} CID\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('ipfs-unixfs').MtimeLike} MtimeLike\n * @typedef {import('./').MfsContext} MfsContext\n * @typedef {object} DefaultOptions\n * @property {boolean} parents\n * @property {HashName} hashAlg\n * @property {CIDVersion} cidVersion\n * @property {number} shardSplitThreshold\n * @property {boolean} flush\n * @property {number} [mode]\n * @property {MtimeLike} [mtime]\n * @property {AbortSignal} [signal]\n * @property {number} [timeout]\n */\n\n/**\n * @type {DefaultOptions}\n */\nconst defaultOptions = {\n  parents: false,\n  hashAlg: 'sha2-256',\n  cidVersion: 0,\n  shardSplitThreshold: 1000,\n  flush: true\n}\n\n/**\n * @param {MfsContext} context\n */\nmodule.exports = (context) => {\n  /**\n   * @type {import('ipfs-core-types/src/files').API[\"mkdir\"]}\n   */\n  async function mfsMkdir (path, options = {}) {\n    /** @type {DefaultOptions} */\n    const opts = mergeOptions(defaultOptions, options)\n\n    if (!path) {\n      throw new Error('no path given to Mkdir')\n    }\n\n    path = path.trim()\n\n    if (path === '/') {\n      if (opts.parents) {\n        return\n      }\n\n      throw errCode(new Error('cannot create directory \\'/\\': Already exists'), 'ERR_INVALID_PATH')\n    }\n\n    if (path.substring(0, 1) !== '/') {\n      throw errCode(new Error('paths must start with a leading slash'), 'ERR_INVALID_PATH')\n    }\n\n    log(`Creating ${path}`)\n\n    const pathComponents = toPathComponents(path)\n\n    if (pathComponents[0] === 'ipfs') {\n      throw errCode(new Error(\"path cannot have the prefix 'ipfs'\"), 'ERR_INVALID_PATH')\n    }\n\n    const root = await withMfsRoot(context, opts)\n    let parent\n    const trail = []\n    const emptyDir = await createNode(context, 'directory', opts)\n\n    // make sure the containing folder exists, creating it if necessary\n    for (let i = 0; i <= pathComponents.length; i++) {\n      const subPathComponents = pathComponents.slice(0, i)\n      const subPath = `/ipfs/${root}/${subPathComponents.join('/')}`\n\n      try {\n        parent = await exporter(subPath, context.ipld)\n\n        if (parent.type !== 'file' && parent.type !== 'directory') {\n          throw errCode(new Error(`${path} was not a UnixFS node`), 'ERR_NOT_UNIXFS')\n        }\n\n        if (i === pathComponents.length) {\n          if (opts.parents) {\n            return\n          }\n\n          throw errCode(new Error('file already exists'), 'ERR_ALREADY_EXISTS')\n        }\n\n        trail.push({\n          name: parent.name,\n          cid: parent.cid\n        })\n      } catch (err) {\n        if (err.code === 'ERR_NOT_FOUND') {\n          if (i < pathComponents.length && !opts.parents) {\n            throw errCode(new Error(`Intermediate directory path ${subPath} does not exist, use the -p flag to create it`), 'ERR_NOT_FOUND')\n          }\n\n          // add the intermediate directory\n          await addEmptyDir(context, subPathComponents[subPathComponents.length - 1], emptyDir, trail[trail.length - 1], trail, opts)\n        } else {\n          throw err\n        }\n      }\n    }\n\n    // add an empty dir to the last path component\n    // await addEmptyDir(context, pathComponents[pathComponents.length - 1], emptyDir, parent, trail)\n\n    // update the tree from the leaf to the root\n    const newRootCid = await updateTree(context, trail, opts)\n\n    // Update the MFS record with the new CID for the root of the tree\n    await updateMfsRoot(context, newRootCid, opts)\n  }\n\n  return withTimeoutOption(mfsMkdir)\n}\n\n/**\n * @param {MfsContext} context\n * @param {string} childName\n * @param {{ cid: CID, node: { size: number }}} emptyDir\n * @param {{ cid?: CID, node?: DAGNode }} parent\n * @param {{ name: string, cid: CID }[]} trail\n * @param {DefaultOptions} options\n */\nconst addEmptyDir = async (context, childName, emptyDir, parent, trail, options) => {\n  log(`Adding empty dir called ${childName} to ${parent.cid}`)\n\n  const result = await addLink(context, {\n    parent: parent.node,\n    parentCid: parent.cid,\n    size: emptyDir.node.size,\n    cid: emptyDir.cid,\n    name: childName,\n    hashAlg: options.hashAlg,\n    cidVersion: options.cidVersion,\n    flush: options.flush,\n    shardSplitThreshold: options.shardSplitThreshold\n  })\n\n  trail[trail.length - 1].cid = result.cid\n\n  trail.push({\n    name: childName,\n    cid: emptyDir.cid\n  })\n}\n","'use strict'\n\nconst { UnixFS } = require('ipfs-unixfs')\nconst {\n  DAGNode\n} = require('ipld-dag-pb')\nconst mc = require('multicodec')\nconst mh = require('multihashing-async').multihash\n\n/**\n * @typedef {import('ipfs-unixfs').MtimeLike} MtimeLike\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('../').MfsContext} MfsContext\n */\n\n/**\n * @param {MfsContext} context\n * @param {'file' | 'directory'} type\n * @param {object} options\n * @param {import('multihashes').HashName} options.hashAlg\n * @param {CIDVersion} options.cidVersion\n * @param {boolean} options.flush\n * @param {MtimeLike} [options.mtime]\n * @param {number} [options.mode]\n */\nconst createNode = async (context, type, options) => {\n  const hashAlg = mh.names[options.hashAlg]\n  const metadata = new UnixFS({\n    type,\n    mode: options.mode,\n    // @ts-ignore TODO: restore hrtime support to ipfs-unixfs constructor - it's in the code, just not the signature\n    mtime: options.mtime\n  })\n\n  const node = new DAGNode(metadata.marshal())\n  const cid = await context.ipld.put(node, mc.DAG_PB, {\n    cidVersion: options.cidVersion,\n    hashAlg,\n    onlyHash: !options.flush\n  })\n\n  return {\n    cid,\n    node\n  }\n}\n\nmodule.exports = createNode\n","'use strict'\n\nconst errCode = require('err-code')\nconst updateTree = require('./utils/update-tree')\nconst updateMfsRoot = require('./utils/update-mfs-root')\nconst removeLink = require('./utils/remove-link')\nconst toMfsPath = require('./utils/to-mfs-path')\nconst toTrail = require('./utils/to-trail')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\n\n/**\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('./').MfsContext} MfsContext\n * @typedef {object} DefaultOptions\n * @property {boolean} recursive\n * @property {CIDVersion} cidVersion\n * @property {HashName} hashAlg\n * @property {boolean} flush\n * @property {number} shardSplitThreshold\n * @property {AbortSignal} [signal]\n * @property {number} [timeout]\n */\n\n/**\n * @type {DefaultOptions}\n */\nconst defaultOptions = {\n  recursive: false,\n  cidVersion: 0,\n  hashAlg: 'sha2-256',\n  flush: true,\n  shardSplitThreshold: 1000\n}\n\n/**\n * @param {MfsContext} context\n */\nmodule.exports = (context) => {\n  /**\n   * @type {import('ipfs-core-types/src/files').API[\"rm\"]}\n   */\n  async function mfsRm (paths, opts = {}) {\n    /** @type {DefaultOptions} */\n    const options = mergeOptions(defaultOptions, opts)\n\n    if (!Array.isArray(paths)) {\n      paths = [paths]\n    }\n\n    const sources = await Promise.all(\n      paths.map(path => toMfsPath(context, path, options))\n    )\n\n    if (!sources.length) {\n      throw errCode(new Error('Please supply at least one path to remove'), 'ERR_INVALID_PARAMS')\n    }\n\n    sources.forEach(source => {\n      if (source.path === '/') {\n        throw errCode(new Error('Cannot delete root'), 'ERR_INVALID_PARAMS')\n      }\n    })\n\n    for (const source of sources) {\n      await removePath(context, source.path, options)\n    }\n  }\n\n  return withTimeoutOption(mfsRm)\n}\n\n/**\n * @param {MfsContext} context\n * @param {string} path\n * @param {DefaultOptions} options\n */\nconst removePath = async (context, path, options) => {\n  const mfsPath = await toMfsPath(context, path, options)\n  const trail = await toTrail(context, mfsPath.mfsPath)\n  const child = trail[trail.length - 1]\n  trail.pop()\n  const parent = trail[trail.length - 1]\n\n  if (!parent) {\n    throw errCode(new Error(`${path} does not exist`), 'ERR_NOT_FOUND')\n  }\n\n  if (child.type === 'directory' && !options.recursive) {\n    throw errCode(new Error(`${path} is a directory, use -r to remove directories`), 'ERR_WAS_DIR')\n  }\n\n  const {\n    cid\n  } = await removeLink(context, {\n    parentCid: parent.cid,\n    name: child.name,\n    hashAlg: options.hashAlg,\n    cidVersion: options.cidVersion,\n    flush: options.flush,\n    shardSplitThreshold: options.shardSplitThreshold\n  })\n\n  parent.cid = cid\n\n  // update the tree with the new child\n  const newRootCid = await updateTree(context, trail, options)\n\n  // Update the MFS record with the new CID for the root of the tree\n  await updateMfsRoot(context, newRootCid, options)\n}\n","'use strict'\n\nconst {\n  DAGLink\n} = require('ipld-dag-pb')\nconst CID = require('cids')\nconst log = require('debug')('ipfs:mfs:core:utils:remove-link')\nconst { UnixFS } = require('ipfs-unixfs')\nconst {\n  generatePath,\n  updateHamtDirectory\n} = require('./hamt-utils')\nconst errCode = require('err-code')\nconst mc = require('multicodec')\nconst mh = require('multihashing-async').multihash\n\n/**\n * @typedef {import('../').MfsContext} MfsContext\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('hamt-sharding').Bucket<any>} Bucket\n * @typedef {import('ipld-dag-pb').DAGNode} DAGNode\n *\n * @typedef {object} RemoveLinkOptions\n * @property {string} name\n * @property {number} shardSplitThreshold\n * @property {HashName} hashAlg\n * @property {CIDVersion} cidVersion\n * @property {boolean} flush\n * @property {CID} [parentCid]\n * @property {DAGNode} [parent]\n *\n * @typedef {object} RemoveLinkOptionsInternal\n * @property {string} name\n * @property {number} shardSplitThreshold\n * @property {HashName} hashAlg\n * @property {CIDVersion} cidVersion\n * @property {boolean} flush\n * @property {DAGNode} parent\n */\n\n/**\n * @param {MfsContext} context\n * @param {RemoveLinkOptions} options\n */\nconst removeLink = async (context, options) => {\n  let parent = options.parent\n\n  if (options.parentCid) {\n    if (!CID.isCID(options.parentCid)) {\n      throw errCode(new Error('Invalid CID passed to removeLink'), 'EINVALIDPARENTCID')\n    }\n\n    log(`Loading parent node ${options.parentCid}`)\n    parent = await context.ipld.get(options.parentCid)\n  }\n\n  if (!parent) {\n    throw errCode(new Error('No parent node or CID passed to removeLink'), 'EINVALIDPARENT')\n  }\n\n  if (!options.name) {\n    throw errCode(new Error('No child name passed to removeLink'), 'EINVALIDCHILDNAME')\n  }\n\n  const meta = UnixFS.unmarshal(parent.Data)\n\n  if (meta.type === 'hamt-sharded-directory') {\n    log(`Removing ${options.name} from sharded directory`)\n\n    return removeFromShardedDirectory(context, {\n      ...options,\n      parent\n    })\n  }\n\n  log(`Removing link ${options.name} regular directory`)\n\n  return removeFromDirectory(context, {\n    ...options,\n    parent\n  })\n}\n\n/**\n * @param {MfsContext} context\n * @param {RemoveLinkOptionsInternal} options\n */\nconst removeFromDirectory = async (context, options) => {\n  const hashAlg = mh.names[options.hashAlg]\n\n  options.parent.rmLink(options.name)\n  const cid = await context.ipld.put(options.parent, mc.DAG_PB, {\n    cidVersion: options.cidVersion,\n    hashAlg\n  })\n\n  log(`Updated regular directory ${cid}`)\n\n  return {\n    node: options.parent,\n    cid\n  }\n}\n\n/**\n * @param {MfsContext} context\n * @param {RemoveLinkOptionsInternal} options\n */\nconst removeFromShardedDirectory = async (context, options) => {\n  const {\n    rootBucket, path\n  } = await generatePath(context, options.name, options.parent)\n\n  await rootBucket.del(options.name)\n\n  const {\n    node\n  } = await updateShard(context, path, options.name, options)\n\n  return updateHamtDirectory(context, node.Links, rootBucket, options)\n}\n\n/**\n * @param {MfsContext} context\n * @param {{ bucket: Bucket, prefix: string, node?: DAGNode }[]} positions\n * @param {string} name\n * @param {RemoveLinkOptionsInternal} options\n * @returns {Promise<{ node: DAGNode, cid: CID, size: number }>}\n */\nconst updateShard = async (context, positions, name, options) => {\n  const last = positions.pop()\n\n  if (!last) {\n    throw errCode(new Error('Could not find parent'), 'EINVALIDPARENT')\n  }\n\n  const {\n    bucket,\n    prefix,\n    node\n  } = last\n\n  if (!node) {\n    throw errCode(new Error('Could not find parent'), 'EINVALIDPARENT')\n  }\n\n  const link = node.Links\n    .find(link => link.Name.substring(0, 2) === prefix)\n\n  if (!link) {\n    throw errCode(new Error(`No link found with prefix ${prefix} for file ${name}`), 'ERR_NOT_FOUND')\n  }\n\n  if (link.Name === `${prefix}${name}`) {\n    log(`Removing existing link ${link.Name}`)\n\n    node.rmLink(link.Name)\n\n    await bucket.del(name)\n\n    return updateHamtDirectory(context, node.Links, bucket, options)\n  }\n\n  log(`Descending into sub-shard ${link.Name} for ${prefix}${name}`)\n\n  const result = await updateShard(context, positions, name, options)\n\n  let cid = result.cid\n  let size = result.size\n  let newName = prefix\n\n  if (result.node.Links.length === 1) {\n    log(`Removing subshard for ${prefix}`)\n\n    // convert shard back to normal dir\n    const link = result.node.Links[0]\n\n    newName = `${prefix}${link.Name.substring(2)}`\n    cid = link.Hash\n    size = link.Tsize\n  }\n\n  log(`Updating shard ${prefix} with name ${newName}`)\n\n  return updateShardParent(context, bucket, node, prefix, newName, size, cid, options)\n}\n\n/**\n * @param {MfsContext} context\n * @param {Bucket} bucket\n * @param {DAGNode} parent\n * @param {string} oldName\n * @param {string} newName\n * @param {number} size\n * @param {CID} cid\n * @param {RemoveLinkOptionsInternal} options\n */\nconst updateShardParent = (context, bucket, parent, oldName, newName, size, cid, options) => {\n  parent.rmLink(oldName)\n  parent.addLink(new DAGLink(newName, size, cid))\n\n  return updateHamtDirectory(context, parent.Links, bucket, options)\n}\n\nmodule.exports = removeLink\n","'use strict'\n\nconst stat = require('./stat')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\n\n/**\n * @typedef {import('./').MfsContext} MfsContext\n * @typedef {object} DefaultOptions\n * @property {AbortSignal} [signal]\n * @property {number} [timeout]\n */\n\n/**\n * @type {DefaultOptions}\n */\nconst defaultOptions = {}\n\n/**\n * @param {MfsContext} context\n */\nmodule.exports = (context) => {\n  /**\n   * @type {import('ipfs-core-types/src/files').API[\"flush\"]}\n   */\n  async function mfsFlush (path, options = {}) {\n    /** @type {DefaultOptions} */\n    options = mergeOptions(defaultOptions, options)\n\n    const { cid } = await stat(context)(path, options)\n\n    return cid\n  }\n\n  return withTimeoutOption(mfsFlush)\n}\n","'use strict'\n\nconst cp = require('./cp')\nconst rm = require('./rm')\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('./').MfsContext} MfsContext\n * @typedef {object} DefaultOptions\n * @property {boolean} parents\n * @property {boolean} flush\n * @property {CIDVersion} cidVersion\n * @property {HashName} hashAlg\n * @property {number} shardSplitThreshold\n * @property {AbortSignal} [signal]\n * @property {number} [timeout]\n */\n\n/**\n * @type {DefaultOptions}\n */\nconst defaultOptions = {\n  parents: false,\n  flush: true,\n  cidVersion: 0,\n  hashAlg: 'sha2-256',\n  shardSplitThreshold: 1000\n}\n\n/**\n * @param {MfsContext} context\n */\nmodule.exports = (context) => {\n  /**\n   * @type {import('ipfs-core-types/src/files').API[\"mv\"]}\n   */\n  async function mfsMv (from, to, options = {}) {\n    /** @type {DefaultOptions} */\n    const opts = mergeOptions(defaultOptions, options)\n\n    await cp(context)(from, to, opts)\n    await rm(context)(from, {\n      ...opts,\n      recursive: true\n    })\n  }\n\n  return withTimeoutOption(mfsMv)\n}\n","'use strict'\n\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\nconst toMfsPath = require('./utils/to-mfs-path')\nconst log = require('debug')('ipfs:mfs:touch')\nconst errCode = require('err-code')\nconst { UnixFS } = require('ipfs-unixfs')\nconst toTrail = require('./utils/to-trail')\nconst addLink = require('./utils/add-link')\nconst updateTree = require('./utils/update-tree')\nconst updateMfsRoot = require('./utils/update-mfs-root')\nconst { DAGNode } = require('ipld-dag-pb')\nconst mc = require('multicodec')\nconst mh = require('multihashing-async').multihash\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('ipfs-unixfs').MtimeLike} MtimeLike\n * @typedef {import('./').MfsContext} MfsContext\n * @typedef {object} DefaultOptions\n * @property {boolean} flush\n * @property {number} shardSplitThreshold\n * @property {CIDVersion} cidVersion\n * @property {HashName} hashAlg\n * @property {MtimeLike} [mtime]\n * @property {AbortSignal} [signal]\n * @property {number} [timeout]\n */\n\n/**\n * @type {DefaultOptions}\n */\nconst defaultOptions = {\n  flush: true,\n  shardSplitThreshold: 1000,\n  cidVersion: 0,\n  hashAlg: 'sha2-256'\n}\n\n/**\n * @param {MfsContext} context\n */\nmodule.exports = (context) => {\n  /**\n   * @type {import('ipfs-core-types/src/files').API[\"touch\"]}\n   */\n  async function mfsTouch (path, options = {}) {\n    /** @type {DefaultOptions} */\n    const settings = mergeOptions(defaultOptions, options)\n    settings.mtime = settings.mtime || new Date()\n\n    log(`Touching ${path} mtime: ${settings.mtime}`)\n\n    const {\n      cid,\n      mfsDirectory,\n      name,\n      exists\n    } = await toMfsPath(context, path, settings)\n\n    let node\n    let updatedCid\n\n    let cidVersion = settings.cidVersion\n\n    if (!exists) {\n      const metadata = new UnixFS({\n        type: 'file',\n        // @ts-ignore TODO: restore hrtime support to ipfs-unixfs constructor - it's in the code, just not the signature\n        mtime: settings.mtime\n      })\n      node = new DAGNode(metadata.marshal())\n      updatedCid = await context.ipld.put(node, mc.DAG_PB, {\n        cidVersion: settings.cidVersion,\n        hashAlg: mh.names['sha2-256'],\n        onlyHash: !settings.flush\n      })\n    } else {\n      if (cid.codec !== 'dag-pb') {\n        throw errCode(new Error(`${path} was not a UnixFS node`), 'ERR_NOT_UNIXFS')\n      }\n\n      cidVersion = cid.version\n\n      node = await context.ipld.get(cid)\n\n      const metadata = UnixFS.unmarshal(node.Data)\n\n      // @ts-ignore TODO: restore setting all date types as mtime - it's in the code, just not the signature\n      metadata.mtime = settings.mtime\n\n      node = new DAGNode(metadata.marshal(), node.Links)\n\n      updatedCid = await context.ipld.put(node, mc.DAG_PB, {\n        cidVersion: cid.version,\n        hashAlg: mh.names['sha2-256'],\n        onlyHash: !settings.flush\n      })\n    }\n\n    const trail = await toTrail(context, mfsDirectory)\n    const parent = trail[trail.length - 1]\n    const parentNode = await context.ipld.get(parent.cid)\n\n    const result = await addLink(context, {\n      parent: parentNode,\n      name: name,\n      cid: updatedCid,\n      size: node.serialize().length,\n      flush: settings.flush,\n      shardSplitThreshold: settings.shardSplitThreshold,\n      hashAlg: 'sha2-256',\n      cidVersion\n    })\n\n    parent.cid = result.cid\n\n    // update the tree with the new child\n    const newRootCid = await updateTree(context, trail, settings)\n\n    // Update the MFS record with the new CID for the root of the tree\n    await updateMfsRoot(context, newRootCid, settings)\n  }\n\n  return withTimeoutOption(mfsTouch)\n}\n","'use strict'\n\nconst log = require('debug')('ipfs:mfs:write')\nconst { importer } = require('ipfs-unixfs-importer')\nconst stat = require('./stat')\nconst mkdir = require('./mkdir')\nconst addLink = require('./utils/add-link')\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\nconst createLock = require('./utils/create-lock')\nconst toAsyncIterator = require('./utils/to-async-iterator')\nconst toMfsPath = require('./utils/to-mfs-path')\nconst toPathComponents = require('./utils/to-path-components')\nconst toTrail = require('./utils/to-trail')\nconst updateTree = require('./utils/update-tree')\nconst updateMfsRoot = require('./utils/update-mfs-root')\nconst errCode = require('err-code')\nconst {\n  MFS_MAX_CHUNK_SIZE\n} = require('../../utils')\nconst last = require('it-last')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst {\n  parseMode,\n  parseMtime\n} = require('ipfs-unixfs')\n\n/**\n * @typedef {import('multihashes').HashName} HashName\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('ipfs-unixfs').MtimeLike} MtimeLike\n * @typedef {import('./').MfsContext} MfsContext\n * @typedef {import('./utils/to-mfs-path').FilePath} FilePath\n * @typedef {import('./utils/to-mfs-path').MfsPath} MfsPath\n * @typedef {object} DefaultOptions\n * @property {number} offset\n * @property {number} length\n * @property {boolean} create\n * @property {boolean} truncate\n * @property {boolean} rawLeaves\n * @property {boolean} reduceSingleLeafToSelf\n * @property {CIDVersion} cidVersion\n * @property {HashName} hashAlg\n * @property {boolean} parents\n * @property {import('ipfs-core-types/src/root').AddProgressFn} progress\n * @property {'trickle' | 'balanced'} strategy\n * @property {boolean} flush\n * @property {'raw' | 'file'} leafType\n * @property {number} shardSplitThreshold\n * @property {MtimeLike} [mtime]\n * @property {number} [mode]\n * @property {AbortSignal} [signal]\n * @property {number} [timeout]\n */\n\n/**\n * @type {DefaultOptions}\n */\nconst defaultOptions = {\n  offset: 0, // the offset in the file to begin writing\n  length: Infinity, // how many bytes from the incoming buffer to write\n  create: false, // whether to create the file if it does not exist\n  truncate: false, // whether to truncate the file first\n  rawLeaves: false,\n  reduceSingleLeafToSelf: false,\n  cidVersion: 0,\n  hashAlg: 'sha2-256',\n  parents: false, // whether to create intermediate directories if they do not exist\n  progress: (bytes, path) => {},\n  strategy: 'trickle',\n  flush: true,\n  leafType: 'raw',\n  shardSplitThreshold: 1000\n}\n\n/**\n * @param {MfsContext} context\n */\nmodule.exports = (context) => {\n  /**\n   * @type {import('ipfs-core-types/src/files').API[\"write\"]}\n   */\n  async function mfsWrite (path, content, opts = {}) {\n    /** @type {DefaultOptions} */\n    const options = mergeOptions(defaultOptions, opts)\n\n    /** @type {AsyncIterable<Uint8Array>} */\n    let source\n    /** @type {MfsPath} */\n    let destination\n    /** @type {MfsPath} */\n    let parent\n    log('Reading source, destination and parent')\n    await createLock().readLock(async () => {\n      source = await toAsyncIterator(content)\n      destination = await toMfsPath(context, path, options)\n      parent = await toMfsPath(context, destination.mfsDirectory, options)\n    })()\n    log('Read source, destination and parent')\n    // @ts-ignore - parent may be undefined\n    if (!options.parents && !parent.exists) {\n      throw errCode(new Error('directory does not exist'), 'ERR_NO_EXIST')\n    }\n\n    // @ts-ignore\n    if (source == null) {\n      throw errCode(new Error('could not create source'), 'ERR_NO_SOURCE')\n    }\n\n    // @ts-ignore\n    if (destination == null) {\n      throw errCode(new Error('could not create destination'), 'ERR_NO_DESTINATION')\n    }\n\n    if (!options.create && !destination.exists) {\n      throw errCode(new Error('file does not exist'), 'ERR_NO_EXIST')\n    }\n\n    if (destination.entryType !== 'file') {\n      throw errCode(new Error('not a file'), 'ERR_NOT_A_FILE')\n    }\n\n    return updateOrImport(context, path, source, destination, options)\n  }\n\n  return withTimeoutOption(mfsWrite)\n}\n\n/**\n * @param {MfsContext} context\n * @param {string} path\n * @param {AsyncIterable<Uint8Array>} source\n * @param {FilePath} destination\n * @param {DefaultOptions} options\n */\nconst updateOrImport = async (context, path, source, destination, options) => {\n  const child = await write(context, source, destination, options)\n\n  // The slow bit is done, now add or replace the DAGLink in the containing directory\n  // re-reading the path to the containing folder in case it has changed in the interim\n  await createLock().writeLock(async () => {\n    const pathComponents = toPathComponents(path)\n    const fileName = pathComponents.pop()\n\n    if (fileName == null) {\n      throw errCode(new Error('source does not exist'), 'ERR_NO_EXIST')\n    }\n\n    let parentExists = false\n\n    try {\n      await stat(context)(`/${pathComponents.join('/')}`, options)\n      parentExists = true\n    } catch (err) {\n      if (err.code !== 'ERR_NOT_FOUND') {\n        throw err\n      }\n    }\n\n    if (!parentExists) {\n      await mkdir(context)(`/${pathComponents.join('/')}`, options)\n    }\n\n    // get an updated mfs path in case the root changed while we were writing\n    const updatedPath = await toMfsPath(context, path, options)\n    const trail = await toTrail(context, updatedPath.mfsDirectory)\n    const parent = trail[trail.length - 1]\n\n    if (!parent) {\n      throw errCode(new Error('directory does not exist'), 'ERR_NO_EXIST')\n    }\n\n    if (!parent.type || !parent.type.includes('directory')) {\n      throw errCode(new Error(`cannot write to ${parent.name}: Not a directory`), 'ERR_NOT_A_DIRECTORY')\n    }\n\n    const parentNode = await context.ipld.get(parent.cid)\n\n    const result = await addLink(context, {\n      parent: parentNode,\n      name: fileName,\n      cid: child.cid,\n      size: child.size,\n      flush: options.flush,\n      shardSplitThreshold: options.shardSplitThreshold,\n      hashAlg: options.hashAlg,\n      cidVersion: options.cidVersion\n    })\n\n    parent.cid = result.cid\n\n    // update the tree with the new child\n    const newRootCid = await updateTree(context, trail, options)\n\n    // Update the MFS record with the new CID for the root of the tree\n    await updateMfsRoot(context, newRootCid, options)\n  })()\n}\n\n/**\n * @param {MfsContext} context\n * @param {AsyncIterable<Uint8Array>} source\n * @param {FilePath} destination\n * @param {DefaultOptions} options\n */\nconst write = async (context, source, destination, options) => {\n  if (destination.exists) {\n    log(`Overwriting file ${destination.cid} offset ${options.offset} length ${options.length}`)\n  } else {\n    log(`Writing file offset ${options.offset} length ${options.length}`)\n  }\n\n  /** @type {Array<() => AsyncIterable<Uint8Array>>} */\n  const sources = []\n\n  // pad start of file if necessary\n  if (options.offset > 0) {\n    if (destination.unixfs) {\n      log(`Writing first ${options.offset} bytes of original file`)\n\n      sources.push(\n        () => {\n          return destination.content({\n            offset: 0,\n            length: options.offset\n          })\n        }\n      )\n\n      if (destination.unixfs.fileSize() < options.offset) {\n        const extra = options.offset - destination.unixfs.fileSize()\n\n        log(`Writing zeros for extra ${extra} bytes`)\n        sources.push(\n          asyncZeroes(extra)\n        )\n      }\n    } else {\n      log(`Writing zeros for first ${options.offset} bytes`)\n      sources.push(\n        asyncZeroes(options.offset)\n      )\n    }\n  }\n\n  sources.push(\n    limitAsyncStreamBytes(source, options.length)\n  )\n\n  const content = countBytesStreamed(catAsyncIterators(sources), (bytesWritten) => {\n    if (destination.unixfs && !options.truncate) {\n      // if we've done reading from the new source and we are not going\n      // to truncate the file, add the end of the existing file to the output\n      const fileSize = destination.unixfs.fileSize()\n\n      if (fileSize > bytesWritten) {\n        log(`Writing last ${fileSize - bytesWritten} of ${fileSize} bytes from original file starting at offset ${bytesWritten}`)\n\n        return destination.content({\n          offset: bytesWritten\n        })\n      } else {\n        log('Not writing last bytes from original file')\n      }\n    }\n\n    return {\n      [Symbol.asyncIterator]: async function * () {}\n    }\n  })\n\n  /** @type {number | undefined} */\n  let mode\n\n  if (options.mode !== undefined && options.mode !== null) {\n    mode = parseMode(options.mode)\n  } else if (destination && destination.unixfs) {\n    mode = destination.unixfs.mode\n  }\n\n  /** @type {import('ipfs-unixfs').Mtime | undefined} */\n  let mtime\n\n  if (options.mtime != null) {\n    mtime = parseMtime(options.mtime)\n  } else if (destination && destination.unixfs) {\n    mtime = destination.unixfs.mtime\n  }\n\n  const result = await last(importer([{\n    content: content,\n\n    // persist mode & mtime if set previously\n    mode,\n    mtime\n  }], context.block, {\n    progress: options.progress,\n    hashAlg: options.hashAlg,\n    cidVersion: options.cidVersion,\n    strategy: options.strategy,\n    rawLeaves: options.rawLeaves,\n    reduceSingleLeafToSelf: options.reduceSingleLeafToSelf,\n    leafType: options.leafType,\n    pin: false\n  }))\n\n  if (!result) {\n    throw errCode(new Error(`cannot write to ${parent.name}`), 'ERR_COULD_NOT_WRITE')\n  }\n\n  log(`Wrote ${result.cid}`)\n\n  return {\n    cid: result.cid,\n    size: result.size\n  }\n}\n\n/**\n * @param {AsyncIterable<Uint8Array>} stream\n * @param {number} limit\n */\nconst limitAsyncStreamBytes = (stream, limit) => {\n  return async function * _limitAsyncStreamBytes () {\n    let emitted = 0\n\n    for await (const buf of stream) {\n      emitted += buf.length\n\n      if (emitted > limit) {\n        yield buf.slice(0, limit - emitted)\n\n        return\n      }\n\n      yield buf\n    }\n  }\n}\n\n/**\n * @param {number} count\n * @param {number} chunkSize\n */\nconst asyncZeroes = (count, chunkSize = MFS_MAX_CHUNK_SIZE) => {\n  const buf = new Uint8Array(chunkSize)\n\n  async function * _asyncZeroes () {\n    while (true) {\n      yield buf.slice()\n    }\n  }\n\n  return limitAsyncStreamBytes(_asyncZeroes(), count)\n}\n\n/**\n * @param {Array<() => AsyncIterable<Uint8Array>>} sources\n */\nconst catAsyncIterators = async function * (sources) { // eslint-disable-line require-await\n  for (let i = 0; i < sources.length; i++) {\n    yield * sources[i]()\n  }\n}\n\n/**\n * @param {AsyncIterable<Uint8Array>} source\n * @param {(count: number) => AsyncIterable<Uint8Array>} notify\n */\nconst countBytesStreamed = async function * (source, notify) {\n  let wrote = 0\n\n  for await (const buf of source) {\n    wrote += buf.length\n\n    yield buf\n  }\n\n  for await (const buf of notify(wrote)) {\n    wrote += buf.length\n\n    yield buf\n  }\n}\n","'use strict'\n\nconst errCode = require('err-code')\nconst log = require('debug')('ipfs:mfs:utils:to-async-iterator')\nconst {\n  MFS_MAX_CHUNK_SIZE\n} = require('../../../utils')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n/**\n * @param {*} content\n */\nconst toAsyncIterator = (content) => {\n  if (!content) {\n    throw errCode(new Error('paths must start with a leading slash'), 'ERR_INVALID_PATH')\n  }\n\n  if (typeof content === 'string' || content instanceof String) {\n    log('Content was a string')\n\n    content = uint8ArrayFromString(content.toString())\n  }\n\n  if (content.length) {\n    log('Content was array-like')\n\n    return {\n      [Symbol.asyncIterator]: function * bufferContent () {\n        yield content\n      }\n    }\n  }\n\n  if (content[Symbol.asyncIterator]) {\n    log('Content was an async iterator')\n    return content\n  }\n\n  if (content[Symbol.iterator]) {\n    log('Content was an iterator')\n    return content\n  }\n\n  if (global.Blob && content instanceof global.Blob) {\n    // HTML5 Blob objects (including Files)\n    log('Content was an HTML5 Blob')\n\n    let index = 0\n\n    const iterator = {\n      next: () => {\n        if (index > content.size) {\n          return {\n            done: true\n          }\n        }\n\n        return new Promise((resolve, reject) => {\n          const chunk = content.slice(index, MFS_MAX_CHUNK_SIZE)\n          index += MFS_MAX_CHUNK_SIZE\n\n          const reader = new global.FileReader()\n\n          /**\n           * @param {{ error?: Error }} ev\n           */\n          const handleLoad = (ev) => {\n            // @ts-ignore No overload matches this call.\n            reader.removeEventListener('loadend', handleLoad, false)\n\n            if (ev.error) {\n              return reject(ev.error)\n            }\n\n            resolve({\n              done: false,\n              value: new Uint8Array(/** @type {ArrayBuffer} */(reader.result))\n            })\n          }\n\n          // @ts-ignore No overload matches this call.\n          reader.addEventListener('loadend', handleLoad)\n          reader.readAsArrayBuffer(chunk)\n        })\n      }\n    }\n\n    return {\n      [Symbol.asyncIterator]: () => {\n        return iterator\n      }\n    }\n  }\n\n  throw errCode(new Error(`Don't know how to convert ${content} into an async iterator`), 'ERR_INVALID_PARAMS')\n}\n\nmodule.exports = toAsyncIterator\n","'use strict'\n\nconst { exporter } = require('ipfs-unixfs-exporter')\nconst mergeOptions = require('merge-options').bind({ ignoreUndefined: true })\nconst toMfsPath = require('./utils/to-mfs-path')\nconst errCode = require('err-code')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @typedef {import('./').MfsContext} MfsContext\n * @typedef {object} DefaultOptions\n * @property {number} offset\n * @property {number} length\n * @property {AbortSignal} [signal]\n * @property {number} [timeout]\n */\n\n/**\n * @type {DefaultOptions}\n */\nconst defaultOptions = {\n  offset: 0,\n  length: Infinity\n}\n\n/**\n * @param {MfsContext} context\n */\nmodule.exports = (context) => {\n  /**\n   * @type {import('ipfs-core-types/src/files').API[\"read\"]}\n   */\n  function mfsRead (path, options = {}) {\n    /** @type {DefaultOptions} */\n    options = mergeOptions(defaultOptions, options)\n\n    return {\n      [Symbol.asyncIterator]: async function * read () {\n        const mfsPath = await toMfsPath(context, path, options)\n        const result = await exporter(mfsPath.mfsPath, context.ipld)\n\n        if (result.type !== 'file') {\n          throw errCode(new Error(`${path} was not a file`), 'ERR_NOT_FILE')\n        }\n\n        if (!result.content) {\n          throw errCode(new Error(`Could not load content stream from ${path}`), 'ERR_NO_CONTENT')\n        }\n\n        for await (const buf of result.content({\n          offset: options.offset,\n          length: options.length\n        })) {\n          yield buf\n        }\n      }\n    }\n  }\n\n  return withTimeoutOption(mfsRead)\n}\n","'use strict'\n\nconst { exporter } = require('ipfs-unixfs-exporter')\nconst toMfsPath = require('./utils/to-mfs-path')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst map = require('it-map')\n\n/**\n * @typedef {import('./').MfsContext} MfsContext\n * @typedef {import('ipfs-core-types/src/files').MFSEntry} MFSEntry\n */\n\n/**\n * @param {import('ipfs-unixfs-exporter').UnixFSEntry} fsEntry\n */\nconst toOutput = (fsEntry) => {\n  /** @type {MFSEntry} */\n  const output = {\n    cid: fsEntry.cid,\n    name: fsEntry.name,\n    type: fsEntry.type === 'directory' ? 'directory' : 'file',\n    size: fsEntry.size\n  }\n\n  if (fsEntry.type === 'file' || fsEntry.type === 'directory') {\n    output.mode = fsEntry.unixfs.mode\n    output.mtime = fsEntry.unixfs.mtime\n  }\n\n  return output\n}\n\n/**\n * @param {MfsContext} context\n */\nmodule.exports = (context) => {\n  /**\n   * @type {import('ipfs-core-types/src/files').API[\"ls\"]}\n   */\n  async function * mfsLs (path, options = {}) {\n    const mfsPath = await toMfsPath(context, path, options)\n    const fsEntry = await exporter(mfsPath.mfsPath, context.ipld)\n\n    // directory, perhaps sharded\n    if (fsEntry.type === 'directory') {\n      yield * map(fsEntry.content(options), toOutput)\n\n      return\n    }\n\n    // single file/node\n    yield toOutput(fsEntry)\n  }\n\n  return withTimeoutOption(mfsLs)\n}\n","'use strict'\n\nconst createExport = require('./export')\nconst createGen = require('./gen')\nconst createImport = require('./import')\nconst createInfo = require('./info')\nconst createList = require('./list')\nconst createRename = require('./rename')\nconst createRm = require('./rm')\n\n/**\n * @typedef {import('libp2p/src/keychain')} Keychain\n */\n\nclass KeyAPI {\n  /**\n   * @param {Object} config\n   * @param {Keychain} config.keychain\n   */\n  constructor ({ keychain }) {\n    this.gen = createGen({ keychain })\n    this.list = createList({ keychain })\n    this.rm = createRm({ keychain })\n    this.rename = createRename({ keychain })\n    this.export = createExport({ keychain })\n    this.import = createImport({ keychain })\n    this.info = createInfo({ keychain })\n  }\n}\nmodule.exports = KeyAPI\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('libp2p/src/keychain')} config.keychain\n */\nmodule.exports = ({ keychain }) => {\n  /**\n   * @type {import('ipfs-core-types/src/key').API[\"export\"]}\n   */\n  const exportKey = (name, password) =>\n    keychain.exportKey(name, password)\n\n  return withTimeoutOption(exportKey)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\nconst DEFAULT_KEY_TYPE = 'rsa'\nconst DEFAULT_KEY_SIZE = 2048\n\n/**\n * @param {Object} config\n * @param {import('libp2p/src/keychain')} config.keychain\n */\nmodule.exports = ({ keychain }) => {\n  /**\n   * @type {import('ipfs-core-types/src/key').API[\"gen\"]}\n   */\n  const gen = (name, options = { type: DEFAULT_KEY_TYPE, size: DEFAULT_KEY_SIZE }) => {\n    return keychain.createKey(name, options.type || DEFAULT_KEY_TYPE, options.size || DEFAULT_KEY_SIZE)\n  }\n\n  return withTimeoutOption(gen)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('libp2p/src/keychain')} config.keychain\n */\nmodule.exports = ({ keychain }) => {\n  /**\n   * @type {import('ipfs-core-types/src/key').API[\"import\"]}\n   */\n  const importKey = (name, pem, password) => {\n    return keychain.importKey(name, pem, password)\n  }\n\n  return withTimeoutOption(importKey)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('libp2p/src/keychain')} config.keychain\n */\nmodule.exports = ({ keychain }) => {\n  /**\n   * @type {import('ipfs-core-types/src/key').API[\"info\"]}\n   */\n  const info = (name) => keychain.findKeyByName(name)\n\n  return withTimeoutOption(info)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('libp2p/src/keychain')} config.keychain\n */\nmodule.exports = ({ keychain }) => {\n  /**\n   * @type {import('ipfs-core-types/src/key').API[\"list\"]}\n   */\n  const list = () => keychain.listKeys()\n\n  return withTimeoutOption(list)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('libp2p/src/keychain')} config.keychain\n */\nmodule.exports = ({ keychain }) => {\n  /**\n   * @type {import('ipfs-core-types/src/key').API[\"rename\"]}\n   */\n  const rename = async (oldName, newName) => {\n    const key = await keychain.renameKey(oldName, newName)\n\n    return {\n      was: oldName,\n      now: key.name,\n      id: key.id,\n      overwrite: false\n    }\n  }\n\n  return withTimeoutOption(rename)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('libp2p/src/keychain')} config.keychain\n */\nmodule.exports = ({ keychain }) => {\n  /**\n   * @type {import('ipfs-core-types/src/key').API[\"rm\"]}\n   */\n  const rm = (name) => keychain.removeKey(name)\n\n  return withTimeoutOption(rm)\n}\n","'use strict'\n\nconst createData = require('./data')\nconst createGet = require('./get')\nconst createLinks = require('./links')\nconst createNew = require('./new')\nconst createPut = require('./put')\nconst createStat = require('./stat')\nconst ObjectPatchAPI = require('./patch')\n\n/**\n * @typedef {import('ipld')} IPLD\n * @typedef {import('../../types').Preload} Preload\n * @typedef {import('../gc-lock').GCLock} GCLock\n * @typedef {import('cids')} CID\n * @typedef {import('ipfs-core-types/src/utils').AbortOptions} AbortOptions\n */\n\nclass ObjectAPI {\n  /**\n   * @param {Object} config\n   * @param {IPLD} config.ipld\n   * @param {Preload} config.preload\n   * @param {GCLock} config.gcLock\n   */\n  constructor ({ ipld, preload, gcLock }) {\n    this.data = createData({ ipld, preload })\n    this.get = createGet({ ipld, preload })\n    this.links = createLinks({ ipld })\n    this.new = createNew({ ipld, preload })\n    this.put = createPut({ ipld, preload, gcLock })\n    this.stat = createStat({ ipld, preload })\n    this.patch = new ObjectPatchAPI({ ipld, preload, gcLock })\n  }\n}\n\nmodule.exports = ObjectAPI\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../types').Preload} config.preload\n */\nmodule.exports = ({ ipld, preload }) => {\n  const get = require('./get')({ ipld, preload })\n\n  /**\n   * @type {import('ipfs-core-types/src/object').API[\"data\"]}\n   */\n  async function data (multihash, options = {}) {\n    const node = await get(multihash, options)\n    return node.Data\n  }\n\n  return withTimeoutOption(data)\n}\n","'use strict'\n\nconst CID = require('cids')\nconst errCode = require('err-code')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @typedef {import('multibase').BaseName} BaseName\n */\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../types').Preload} config.preload\n */\nmodule.exports = ({ ipld, preload }) => {\n  /**\n   * @type {import('ipfs-core-types/src/object').API[\"get\"]}\n   */\n  async function get (multihash, options = {}) { // eslint-disable-line require-await\n    let cid\n\n    try {\n      cid = new CID(multihash)\n    } catch (err) {\n      throw errCode(err, 'ERR_INVALID_CID')\n    }\n\n    if (options.preload !== false) {\n      preload(cid)\n    }\n\n    return ipld.get(cid, { signal: options.signal })\n  }\n\n  return withTimeoutOption(get)\n}\n","'use strict'\n\nconst {\n  DAGLink\n} = require('ipld-dag-pb')\nconst CID = require('cids')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {any} node\n * @param {DAGLink[]} [links]\n * @returns {DAGLink[]}\n */\nfunction findLinks (node, links = []) {\n  for (const key in node) {\n    const val = node[key]\n\n    if (key === '/' && Object.keys(node).length === 1) {\n      try {\n        links.push(new DAGLink('', 0, new CID(val)))\n        continue\n      } catch (_) {\n        // not a CID\n      }\n    }\n\n    if (CID.isCID(val)) {\n      links.push(new DAGLink('', 0, val))\n      continue\n    }\n\n    if (Array.isArray(val)) {\n      findLinks(val, links)\n    }\n\n    if (val && typeof val === 'object') {\n      findLinks(val, links)\n    }\n  }\n\n  return links\n}\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n */\nmodule.exports = ({ ipld }) => {\n  /**\n   * @type {import('ipfs-core-types/src/object').API[\"links\"]}\n   */\n  async function links (multihash, options = {}) {\n    const cid = new CID(multihash)\n    const result = await ipld.get(cid, options)\n\n    if (cid.codec === 'raw') {\n      return []\n    }\n\n    if (cid.codec === 'dag-pb') {\n      return result.Links\n    }\n\n    if (cid.codec === 'dag-cbor') {\n      return findLinks(result)\n    }\n\n    throw new Error(`Cannot resolve links from codec ${cid.codec}`)\n  }\n\n  return withTimeoutOption(links)\n}\n","'use strict'\n\nconst {\n  DAGNode\n} = require('ipld-dag-pb')\nconst multicodec = require('multicodec')\nconst mh = require('multihashing-async').multihash\nconst { UnixFS } = require('ipfs-unixfs')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../types').Preload} config.preload\n */\nmodule.exports = ({ ipld, preload }) => {\n  /**\n   * @type {import('ipfs-core-types/src/object').API[\"new\"]}\n   */\n  async function _new (options = {}) {\n    let data\n\n    if (options.template) {\n      if (options.template === 'unixfs-dir') {\n        data = (new UnixFS({ type: 'directory' })).marshal()\n      } else {\n        throw new Error('unknown template')\n      }\n    } else {\n      data = new Uint8Array(0)\n    }\n\n    const node = new DAGNode(data)\n\n    const cid = await ipld.put(node, multicodec.DAG_PB, {\n      cidVersion: 0,\n      hashAlg: mh.names['sha2-256'],\n      signal: options.signal\n    })\n\n    if (options.preload !== false) {\n      preload(cid)\n    }\n\n    return cid\n  }\n\n  return withTimeoutOption(_new)\n}\n","'use strict'\n\nconst {\n  DAGNode,\n  DAGLink,\n  util: DAGLinkUtil\n} = require('ipld-dag-pb')\nconst mh = require('multihashing-async').multihash\nconst multicodec = require('multicodec')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n/**\n * @param {Uint8Array} buf\n * @param {import('ipfs-core-types/src/object').PutEncoding} encoding\n */\nfunction parseBuffer (buf, encoding) {\n  switch (encoding) {\n    case 'json':\n      return parseJSONBuffer(buf)\n    case 'protobuf':\n      return parseProtoBuffer(buf)\n    default:\n      throw new Error(`unknown encoding: ${encoding}`)\n  }\n}\n\n/**\n * @param {Uint8Array} buf\n */\nfunction parseJSONBuffer (buf) {\n  let data\n  let links\n\n  try {\n    const parsed = JSON.parse(uint8ArrayToString(buf))\n\n    // @ts-ignore - loose input types\n    links = (parsed.Links || []).map((link) => {\n      return new DAGLink(\n        // @ts-ignore - loose input types\n        link.Name || link.name,\n        // @ts-ignore - loose input types\n        link.Size || link.size,\n        // @ts-ignore - loose input types\n        mh.fromB58String(link.Hash || link.hash || link.multihash)\n      )\n    })\n\n    // @ts-ignore - loose input types\n    data = uint8ArrayFromString(parsed.Data)\n  } catch (err) {\n    throw new Error('failed to parse JSON: ' + err)\n  }\n\n  return new DAGNode(data, links)\n}\n\n/**\n * @param {Uint8Array} buf\n */\nfunction parseProtoBuffer (buf) {\n  return DAGLinkUtil.deserialize(buf)\n}\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../types').Preload} config.preload\n * @param {import('.').GCLock} config.gcLock\n */\nmodule.exports = ({ ipld, gcLock, preload }) => {\n  /**\n   * @type {import('ipfs-core-types/src/object').API[\"put\"]}\n   */\n  async function put (obj, options = {}) {\n    const encoding = options.enc\n    let node\n\n    if (obj instanceof Uint8Array) {\n      if (encoding) {\n        node = await parseBuffer(obj, encoding)\n      } else {\n        node = new DAGNode(obj)\n      }\n    } else if (obj instanceof DAGNode) {\n      // already a dag node\n      node = obj\n    } else if (typeof obj === 'object') {\n      node = new DAGNode(obj.Data, obj.Links)\n    } else {\n      throw new Error('obj not recognized')\n    }\n\n    const release = await gcLock.readLock()\n\n    try {\n      const cid = await ipld.put(node, multicodec.DAG_PB, {\n        cidVersion: 0,\n        hashAlg: mh.names['sha2-256']\n      })\n\n      if (options.preload !== false) {\n        preload(cid)\n      }\n\n      return cid\n    } finally {\n      release()\n    }\n  }\n\n  return withTimeoutOption(put)\n}\n","'use strict'\n\nconst dagPB = require('ipld-dag-pb')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../types').Preload} config.preload\n */\nmodule.exports = ({ ipld, preload }) => {\n  const get = require('./get')({ ipld, preload })\n\n  /**\n   * @type {import('ipfs-core-types/src/object').API[\"stat\"]}\n   */\n  async function stat (multihash, options = {}) {\n    const node = await get(multihash, options)\n    const serialized = dagPB.util.serialize(node)\n    const cid = await dagPB.util.cid(serialized, {\n      cidVersion: 0\n    })\n\n    const blockSize = serialized.length\n    const linkLength = node.Links.reduce((a, l) => a + l.Tsize, 0)\n\n    return {\n      Hash: cid.toBaseEncodedString(),\n      NumLinks: node.Links.length,\n      BlockSize: blockSize,\n      LinksSize: blockSize - node.Data.length,\n      DataSize: node.Data.length,\n      CumulativeSize: blockSize + linkLength\n    }\n  }\n\n  return withTimeoutOption(stat)\n}\n","'use strict'\n\nconst createAddLink = require('./add-link')\nconst createAppendData = require('./append-data')\nconst createRmLink = require('./rm-link')\nconst createSetData = require('./set-data')\n\n/**\n * @typedef {import('ipld')} IPLD\n * @typedef {import('../../../types').Preload} Preload\n * @typedef {import('..').GCLock} GCLock\n * @typedef {import('cids')} CID\n * @typedef {import('ipfs-core-types/src/utils').AbortOptions} AbortOptions\n */\n\nclass ObjectPatchAPI {\n  /**\n   * @param {Object} config\n   * @param {IPLD} config.ipld\n   * @param {Preload} config.preload\n   * @param {GCLock} config.gcLock\n   */\n  constructor ({ ipld, preload, gcLock }) {\n    this.addLink = createAddLink({ ipld, preload, gcLock })\n    this.appendData = createAppendData({ ipld, preload, gcLock })\n    this.rmLink = createRmLink({ ipld, preload, gcLock })\n    this.setData = createSetData({ ipld, preload, gcLock })\n  }\n}\nmodule.exports = ObjectPatchAPI\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../../types').Preload} config.preload\n * @param {import('.').GCLock} config.gcLock\n */\nmodule.exports = ({ ipld, gcLock, preload }) => {\n  const get = require('../get')({ ipld, preload })\n  const put = require('../put')({ ipld, gcLock, preload })\n\n  /**\n   * @type {import('ipfs-core-types/src/object/patch').API[\"addLink\"]}\n   */\n  async function addLink (multihash, link, options = {}) {\n    const node = await get(multihash, options)\n    node.addLink(link)\n    return put(node, options)\n  }\n\n  return withTimeoutOption(addLink)\n}\n","'use strict'\n\nconst { DAGNode } = require('ipld-dag-pb')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst uint8ArrayConcat = require('uint8arrays/concat')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../../types').Preload} config.preload\n * @param {import('.').GCLock} config.gcLock\n */\nmodule.exports = ({ ipld, gcLock, preload }) => {\n  const get = require('../get')({ ipld, preload })\n  const put = require('../put')({ ipld, gcLock, preload })\n\n  /**\n   * @type {import('ipfs-core-types/src/object/patch').API[\"appendData\"]}\n   */\n  async function appendData (multihash, data, options = {}) {\n    const node = await get(multihash, options)\n    const newData = uint8ArrayConcat([node.Data, data])\n    return put(new DAGNode(newData, node.Links), options)\n  }\n\n  return withTimeoutOption(appendData)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../../types').Preload} config.preload\n * @param {import('.').GCLock} config.gcLock\n */\nmodule.exports = ({ ipld, gcLock, preload }) => {\n  const get = require('../get')({ ipld, preload })\n  const put = require('../put')({ ipld, gcLock, preload })\n\n  /**\n   * @type {import('ipfs-core-types/src/object/patch').API[\"rmLink\"]}\n   */\n  async function rmLink (multihash, linkRef, options = {}) {\n    const node = await get(multihash, options)\n    // @ts-ignore - loose input types\n    node.rmLink(linkRef.Name || linkRef.name || linkRef)\n    return put(node, options)\n  }\n\n  return withTimeoutOption(rmLink)\n}\n","'use strict'\n\nconst { DAGNode } = require('ipld-dag-pb')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipld')} config.ipld\n * @param {import('../../../types').Preload} config.preload\n * @param {import('.').GCLock} config.gcLock\n */\nmodule.exports = ({ ipld, gcLock, preload }) => {\n  const get = require('../get')({ ipld, preload })\n  const put = require('../put')({ ipld, gcLock, preload })\n\n  /**\n   * @type {import('ipfs-core-types/src/object/patch').API[\"setData\"]}\n   */\n  async function setData (multihash, data, options = {}) {\n    const node = await get(multihash, options)\n    return put(new DAGNode(data, node.Links), options)\n  }\n\n  return withTimeoutOption(setData)\n}\n","'use strict'\n\nconst createGC = require('./gc')\nconst createStat = require('./stat')\nconst createVersion = require('./version')\n\nclass RepoAPI {\n  /**\n   * @param {Object} config\n   * @param {import('../gc-lock').GCLock} config.gcLock\n   * @param {import('ipfs-core-types/src/pin').API} config.pin\n   * @param {import('ipfs-repo')} config.repo\n   * @param {import('ipfs-core-types/src/refs').API[\"refs\"]} config.refs\n   */\n  constructor ({ gcLock, pin, repo, refs }) {\n    this.gc = createGC({ gcLock, pin, refs, repo })\n    this.stat = createStat({ repo })\n    this.version = createVersion({ repo })\n  }\n}\nmodule.exports = RepoAPI\n","'use strict'\n\nconst CID = require('cids')\nconst log = require('debug')('ipfs:repo:gc')\nconst { MFS_ROOT_KEY } = require('../../utils')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst { Errors } = require('interface-datastore')\nconst ERR_NOT_FOUND = Errors.notFoundError().code\nconst { parallelMerge, transform, map } = require('streaming-iterables')\nconst multibase = require('multibase')\n\n// Limit on the number of parallel block remove operations\nconst BLOCK_RM_CONCURRENCY = 256\n\n/**\n * @typedef {import('ipfs-core-types/src/pin').API} PinAPI\n * @typedef {import('ipfs-core-types/src/refs').API} RefsAPI\n * @typedef {import('ipfs-repo')} IPFSRepo\n * @typedef {import('interface-datastore').Key} Key\n * @typedef {import('ipld-block')} Block\n */\n\n/**\n * Perform mark and sweep garbage collection\n *\n * @param {Object} config\n * @param {import('../gc-lock').GCLock} config.gcLock\n * @param {PinAPI} config.pin\n * @param {RefsAPI[\"refs\"]} config.refs\n * @param {IPFSRepo} config.repo\n */\nmodule.exports = ({ gcLock, pin, refs, repo }) => {\n  /**\n   * @type {import('ipfs-core-types/src/repo').API[\"gc\"]}\n   */\n  async function * gc (_options = {}) {\n    const start = Date.now()\n    log('Creating set of marked blocks')\n\n    const release = await gcLock.writeLock()\n\n    try {\n      // Mark all blocks that are being used\n      const markedSet = await createMarkedSet({ pin, refs, repo })\n      // Get all blocks keys from the blockstore\n      const blockKeys = repo.blocks.queryKeys({})\n\n      // Delete blocks that are not being used\n      yield * deleteUnmarkedBlocks({ repo }, markedSet, blockKeys)\n\n      log(`Complete (${Date.now() - start}ms)`)\n    } finally {\n      release()\n    }\n  }\n\n  return withTimeoutOption(gc)\n}\n\n/**\n * Get Set of CIDs of blocks to keep\n *\n * @param {object} arg\n * @param {PinAPI} arg.pin\n * @param {RefsAPI[\"refs\"]} arg.refs\n * @param {IPFSRepo} arg.repo\n */\nasync function createMarkedSet ({ pin, refs, repo }) {\n  const pinsSource = map(({ cid }) => cid, pin.ls())\n\n  const mfsSource = (async function * () {\n    let mh\n    try {\n      mh = await repo.root.get(MFS_ROOT_KEY)\n    } catch (err) {\n      if (err.code === ERR_NOT_FOUND) {\n        log('No blocks in MFS')\n        return\n      }\n      throw err\n    }\n\n    const rootCid = new CID(mh)\n    yield rootCid\n\n    for await (const { ref } of refs(rootCid, { recursive: true })) {\n      yield new CID(ref)\n    }\n  })()\n\n  const output = new Set()\n  for await (const cid of parallelMerge(pinsSource, mfsSource)) {\n    output.add(multibase.encode('base32', cid.multihash).toString())\n  }\n  return output\n}\n\n/**\n * Delete all blocks that are not marked as in use\n *\n * @param {object} arg\n * @param {IPFSRepo} arg.repo\n * @param {Set<string>} markedSet\n * @param {AsyncIterable<CID>} blockKeys\n */\nasync function * deleteUnmarkedBlocks ({ repo }, markedSet, blockKeys) {\n  // Iterate through all blocks and find those that are not in the marked set\n  // blockKeys yields { key: Key() }\n  let blocksCount = 0\n  let removedBlocksCount = 0\n\n  /**\n   * @param {CID} cid\n   */\n  const removeBlock = async (cid) => {\n    blocksCount++\n\n    try {\n      const b32 = multibase.encode('base32', cid.multihash).toString()\n\n      if (markedSet.has(b32)) {\n        return null\n      }\n\n      try {\n        await repo.blocks.delete(cid)\n        removedBlocksCount++\n      } catch (err) {\n        return {\n          err: new Error(`Could not delete block with CID ${cid}: ${err.message}`)\n        }\n      }\n\n      return { cid }\n    } catch (err) {\n      const msg = `Could delete block with CID ${cid}`\n      log(msg, err)\n      return { err: new Error(msg + `: ${err.message}`) }\n    }\n  }\n\n  for await (const res of transform(BLOCK_RM_CONCURRENCY, removeBlock, blockKeys)) {\n    // filter nulls (blocks that were retained)\n    if (res) yield res\n  }\n\n  log(`Marked set has ${markedSet.size} unique blocks. Blockstore has ${blocksCount} blocks. ` +\n  `Deleted ${removedBlocksCount} blocks.`)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-repo')} config.repo\n */\nmodule.exports = ({ repo }) => {\n  /**\n   * @type {import('ipfs-core-types/src/repo').API[\"stat\"]}\n   */\n  async function stat (options = {}) {\n    const stats = await repo.stat()\n\n    return {\n      numObjects: BigInt(stats.numObjects.toString()),\n      repoSize: BigInt(stats.repoSize.toString()),\n      repoPath: stats.repoPath,\n      version: `${stats.version}`,\n      storageMax: BigInt(stats.storageMax.toString())\n    }\n  }\n\n  return withTimeoutOption(stat)\n}\n","'use strict'\n\nconst { repoVersion } = require('ipfs-repo')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-repo')} config.repo\n */\nmodule.exports = ({ repo }) => {\n  /**\n   * @type {import('ipfs-core-types/src/repo').API[\"version\"]}\n   */\n  async function version (options = {}) {\n    try {\n      // @ts-ignore - not a public API\n      await repo._checkInitialized(options)\n    } catch (err) {\n      // TODO: (dryajov) This is really hacky, there must be a better way\n      const match = [\n        /Key not found in database \\[\\/version\\]/,\n        /ENOENT/,\n        /repo is not initialized yet/\n      ].some((m) => {\n        return m.test(err.message)\n      })\n      if (match) {\n        // this repo has not been initialized\n        return repoVersion\n      }\n      throw err\n    }\n\n    return repo.version.get()\n  }\n\n  return withTimeoutOption(version)\n}\n","'use strict'\n\nconst _get = require('just-safe-get')\nconst debug = require('debug')\nconst errcode = require('err-code')\nconst migrator = require('ipfs-repo-migrations')\nconst bytes = require('bytes')\nconst pathJoin = require('ipfs-utils/src/path-join')\nconst merge = require('merge-options')\nconst constants = require('./constants')\nconst backends = require('./backends')\nconst version = require('./version')\nconst config = require('./config')\nconst spec = require('./spec')\nconst apiAddr = require('./api-addr')\nconst blockstore = require('./blockstore')\nconst idstore = require('./idstore')\nconst defaultOptions = require('./default-options')\nconst defaultDatastore = require('./default-datastore')\nconst ERRORS = require('./errors')\n\nconst log = debug('ipfs:repo')\n\nconst noLimit = Number.MAX_SAFE_INTEGER\nconst AUTO_MIGRATE_CONFIG_KEY = 'repoAutoMigrate'\n\n/** @type {Record<string, Lock>} */\nconst lockers = {\n  memory: require('./lock-memory'),\n  fs: require('./lock')\n}\n\n/**\n * @typedef {import('./types').Options} Options\n * @typedef {import('./types').Lock} Lock\n * @typedef {import('./types').LockCloser} LockCloser\n * @typedef {import('./types').Stat} Stat\n * @typedef {import('./types').Blockstore} Blockstore\n * @typedef {import('./types').Config} Config\n * @typedef {import('ipld-block')} Block\n * @typedef {import('interface-datastore').Datastore} Datastore\n */\n\n/**\n * IpfsRepo implements all required functionality to read and write to an ipfs repo.\n */\nclass IpfsRepo {\n  /**\n   * @param {string} repoPath - path where the repo is stored\n   * @param {Options} [options] - Configuration\n   */\n  constructor (repoPath, options = {}) {\n    if (typeof repoPath !== 'string') {\n      throw new Error('missing repoPath')\n    }\n\n    this.options = merge(defaultOptions, options)\n    this.closed = true\n    this.path = repoPath\n\n    /**\n     * @private\n     */\n    this._locker = this._getLocker()\n    this.root = backends.create('root', this.path, this.options)\n    this.datastore = backends.create('datastore', pathJoin(this.path, 'datastore'), this.options)\n    this.keys = backends.create('keys', pathJoin(this.path, 'keys'), this.options)\n    this.pins = backends.create('pins', pathJoin(this.path, 'pins'), this.options)\n    const blocksBaseStore = backends.create('blocks', pathJoin(this.path, 'blocks'), this.options)\n    const blockStore = blockstore(blocksBaseStore, this.options.storageBackendOptions.blocks)\n    this.blocks = idstore(blockStore)\n    this.version = version(this.root)\n    this.config = config(this.root)\n    this.spec = spec(this.root)\n    this.apiAddr = apiAddr(this.root)\n  }\n\n  /**\n   * Initialize a new repo.\n   *\n   * @param {import('./types').Config} config - config to write into `config`.\n   * @returns {Promise<void>}\n   */\n  async init (config) {\n    log('initializing at: %s', this.path)\n    await this._openRoot()\n    await this.config.replace(buildConfig(config))\n    await this.spec.set(buildDatastoreSpec(config))\n    await this.version.set(constants.repoVersion)\n  }\n\n  /**\n   * Check if the repo is already initialized.\n   *\n   * @returns {Promise<boolean>}\n   */\n  async isInitialized () {\n    if (!this.closed) {\n      // repo is open, must be initialized\n      return true\n    }\n\n    try {\n      // have to open the root datastore in the browser before\n      // we can check whether it's been initialized\n      await this._openRoot()\n      await this._checkInitialized()\n      await this.root.close()\n\n      return true\n    } catch (err) {\n      // FIXME: do not use exceptions for flow control\n      return false\n    }\n  }\n\n  /**\n   * Open the repo. If the repo is already open an error will be thrown.\n   * If the repo is not initialized it will throw an error.\n   *\n   * @returns {Promise<void>}\n   */\n  async open () {\n    if (!this.closed) {\n      throw errcode(new Error('repo is already open'), ERRORS.ERR_REPO_ALREADY_OPEN)\n    }\n    log('opening at: %s', this.path)\n\n    // check if the repo is already initialized\n    try {\n      await this._openRoot()\n      await this._checkInitialized()\n      this.lockfile = await this._openLock(this.path)\n      log('acquired repo.lock')\n\n      const isCompatible = await this.version.check(constants.repoVersion)\n\n      if (!isCompatible) {\n        if (await this._isAutoMigrationEnabled()) {\n          await this._migrate(constants.repoVersion)\n        } else {\n          throw new ERRORS.InvalidRepoVersionError('Incompatible repo versions. Automatic migrations disabled. Please migrate the repo manually.')\n        }\n      }\n\n      log('creating datastore')\n      await this.datastore.open()\n\n      log('creating blocks')\n      this.blocks.open()\n\n      log('creating keystore')\n      await this.keys.open()\n\n      log('creating pins')\n      await this.pins.open()\n\n      this.closed = false\n      log('all opened')\n    } catch (err) {\n      if (this.lockfile) {\n        try {\n          await this._closeLock()\n          this.lockfile = null\n        } catch (err2) {\n          log('error removing lock', err2)\n        }\n      }\n\n      throw err\n    }\n  }\n\n  /**\n   * Returns the repo locker to be used.\n   *\n   * @private\n   */\n  _getLocker () {\n    if (typeof this.options.lock === 'string') {\n      if (!lockers[this.options.lock]) {\n        throw new Error('Unknown lock type: ' + this.options.lock)\n      }\n      return lockers[this.options.lock]\n    }\n\n    if (!this.options.lock) {\n      throw new Error('No lock provided')\n    }\n    return this.options.lock\n  }\n\n  /**\n   * Opens the root backend, catching and ignoring an 'Already open' error\n   *\n   * @private\n   */\n  async _openRoot () {\n    try {\n      await this.root.open()\n    } catch (err) {\n      if (err.message !== 'Already open') {\n        throw err\n      }\n    }\n  }\n\n  /**\n   * Creates a lock on the repo if a locker is specified. The lockfile object will\n   * be returned in the callback if one has been created.\n   *\n   * @private\n   * @param {string} path\n   * @returns {Promise<LockCloser>}\n   */\n  async _openLock (path) {\n    const lockfile = await this._locker.lock(path)\n\n    if (typeof lockfile.close !== 'function') {\n      throw errcode(new Error('Locks must have a close method'), 'ERR_NO_CLOSE_FUNCTION')\n    }\n\n    return lockfile\n  }\n\n  /**\n   * Closes the lock on the repo\n   *\n   * @private\n   */\n  _closeLock () {\n    return this.lockfile && this.lockfile.close()\n  }\n\n  /**\n   * Check if the repo is already initialized.\n   *\n   * @private\n   */\n  async _checkInitialized () {\n    log('init check')\n    let config\n    try {\n      [config] = await Promise.all([\n        this.config.exists(),\n        this.spec.exists(),\n        this.version.exists()\n      ])\n    } catch (err) {\n      if (err.code === 'ERR_NOT_FOUND') {\n        throw errcode(new Error('repo is not initialized yet'), ERRORS.ERR_REPO_NOT_INITIALIZED, {\n          path: this.path\n        })\n      }\n\n      throw err\n    }\n\n    if (!config) {\n      throw errcode(new Error('repo is not initialized yet'), ERRORS.ERR_REPO_NOT_INITIALIZED, {\n        path: this.path\n      })\n    }\n  }\n\n  /**\n   * Close the repo and cleanup.\n   *\n   * @returns {Promise<void>}\n   */\n  async close () {\n    if (this.closed) {\n      throw errcode(new Error('repo is already closed'), ERRORS.ERR_REPO_ALREADY_CLOSED)\n    }\n    log('closing at: %s', this.path)\n\n    try {\n      // Delete api, ignoring irrelevant errors\n      await this.apiAddr.delete()\n    } catch (err) {\n      if (err.code !== ERRORS.ERR_REPO_NOT_INITIALIZED && !err.message.startsWith('ENOENT')) {\n        throw err\n      }\n    }\n\n    await Promise.all([\n      this.root,\n      this.blocks,\n      this.keys,\n      this.datastore,\n      this.pins\n    ].map((store) => store && store.close()))\n\n    log('unlocking')\n    this.closed = true\n    await this._closeLock()\n  }\n\n  /**\n   * Check if a repo exists.\n   *\n   * @returns {Promise<boolean>}\n   */\n  exists () {\n    return this.version.exists()\n  }\n\n  /**\n   * Get repo status.\n   *\n   * @returns {Promise<Stat>}\n   */\n  async stat () {\n    if (this.datastore && this.keys) {\n      const [storageMax, blocks, version, datastore, keys] = await Promise.all([\n        this._storageMaxStat(),\n        this._blockStat(),\n        this.version.get(),\n        getSize(this.datastore),\n        getSize(this.keys)\n      ])\n      const size = blocks.size + datastore + keys\n\n      return {\n        repoPath: this.path,\n        storageMax,\n        version: version,\n        numObjects: blocks.count,\n        repoSize: size\n      }\n    }\n    throw errcode(new Error('repo is not initialized yet'), ERRORS.ERR_REPO_NOT_INITIALIZED, {\n      path: this.path\n    })\n  }\n\n  /**\n   * @private\n   */\n  async _isAutoMigrationEnabled () {\n    if (this.options.autoMigrate !== undefined) {\n      return this.options.autoMigrate\n    }\n\n    // TODO we need to figure out the priority here, between repo options and config.\n    let autoMigrateConfig\n    try {\n      autoMigrateConfig = await this.config.get(AUTO_MIGRATE_CONFIG_KEY)\n    } catch (e) {\n      if (e.code === ERRORS.NotFoundError.code) {\n        autoMigrateConfig = true // Config's default value is True\n      } else {\n        throw e\n      }\n    }\n\n    return autoMigrateConfig\n  }\n\n  /**\n   * Internal migration\n   *\n   * @private\n   * @param {number} toVersion\n   */\n  async _migrate (toVersion) {\n    const currentRepoVersion = await this.version.get()\n\n    if (currentRepoVersion > toVersion) {\n      log(`reverting to version ${toVersion}`)\n      return migrator.revert(this.path, this.options, toVersion, {\n        ignoreLock: true,\n        onProgress: this.options.onMigrationProgress\n      })\n    } else {\n      log(`migrating to version ${toVersion}`)\n      return migrator.migrate(this.path, this.options, toVersion, {\n        ignoreLock: true,\n        onProgress: this.options.onMigrationProgress\n      })\n    }\n  }\n\n  /**\n   * @private\n   */\n  async _storageMaxStat () {\n    try {\n      const max = /** @type {number} */(await this.config.get('Datastore.StorageMax'))\n      return BigInt(bytes(max))\n    } catch (err) {\n      return BigInt(noLimit)\n    }\n  }\n\n  /**\n   * @private\n   */\n  async _blockStat () {\n    let count = BigInt(0)\n    let size = BigInt(0)\n\n    if (this.blocks) {\n      for await (const blockOrCid of this.blocks.query({})) {\n        const block = /** @type {Block} */(blockOrCid)\n        count += BigInt(1)\n        size += BigInt(block.data.byteLength)\n        size += BigInt(block.cid.bytes.byteLength)\n      }\n    }\n\n    return { count, size }\n  }\n}\n\n/**\n * @param {Datastore} datastore\n */\nasync function getSize (datastore) {\n  let sum = BigInt(0)\n  for await (const block of datastore.query({})) {\n    sum += BigInt(block.value.byteLength)\n    sum += BigInt(block.key.uint8Array().byteLength)\n  }\n  return sum\n}\n\nmodule.exports = IpfsRepo\nmodule.exports.utils = { blockstore: require('./blockstore-utils') }\nmodule.exports.repoVersion = constants.repoVersion\nmodule.exports.errors = ERRORS\n\n/**\n * @param {import('./types').Config} _config\n */\nfunction buildConfig (_config) {\n  _config.Datastore = Object.assign({}, defaultDatastore, _get(_config, 'datastore'))\n\n  return _config\n}\n\n/**\n * @param {import('./types').Config} _config\n */\nfunction buildDatastoreSpec (_config) {\n  /** @type { {type: string, mounts: Array<{mountpoint: string, type: string, prefix: string, child: {type: string, path: 'string', sync: boolean, shardFunc: string}}>}} */\n  const spec = {\n    ...defaultDatastore.Spec,\n    ..._get(_config, 'Datastore.Spec')\n  }\n\n  return {\n    type: spec.type,\n    mounts: spec.mounts.map((mounting) => ({\n      mountpoint: mounting.mountpoint,\n      type: mounting.child.type,\n      path: mounting.child.path,\n      shardFunc: mounting.child.shardFunc\n    }))\n  }\n}\n","module.exports = get;\n\n/*\n  const obj = {a: {aa: {aaa: 2}}, b: 4};\n\n  get(obj, 'a.aa.aaa'); // 2\n  get(obj, ['a', 'aa', 'aaa']); // 2\n\n  get(obj, 'b.bb.bbb'); // undefined\n  get(obj, ['b', 'bb', 'bbb']); // undefined\n\n  get(obj.a, 'aa.aaa'); // 2\n  get(obj.a, ['aa', 'aaa']); // 2\n\n  get(obj.b, 'bb.bbb'); // undefined\n  get(obj.b, ['bb', 'bbb']); // undefined\n\n  get(obj.b, 'bb.bbb', 42); // 42\n  get(obj.b, ['bb', 'bbb'], 42); // 42\n\n  get(null, 'a'); // undefined\n  get(undefined, ['a']); // undefined\n\n  get(null, 'a', 42); // 42\n  get(undefined, ['a'], 42); // 42\n\n  const obj = {a: {}};\n  const sym = Symbol();\n  obj.a[sym] = 4;\n  get(obj.a, sym); // 4\n*/\n\nfunction get(obj, propsArg, defaultValue) {\n  if (!obj) {\n    return defaultValue;\n  }\n  var props, prop;\n  if (Array.isArray(propsArg)) {\n    props = propsArg.slice(0);\n  }\n  if (typeof propsArg == 'string') {\n    props = propsArg.split('.');\n  }\n  if (typeof propsArg == 'symbol') {\n    props = [propsArg];\n  }\n  if (!Array.isArray(props)) {\n    throw new Error('props arg must be an array, a string or a symbol');\n  }\n  while (props.length) {\n    prop = props.shift();\n    if (!obj) {\n      return defaultValue;\n    }\n    obj = obj[prop];\n    if (obj === undefined) {\n      return defaultValue;\n    }\n  }\n  return obj;\n}\n","/* eslint complexity: [\"error\", 27] */\n'use strict'\n\nconst defaultMigrations = require('../migrations')\nconst repoVersion = require('./repo/version')\nconst repoLock = require('./repo/lock')\nconst errors = require('./errors')\n\nconst log = require('debug')('ipfs:repo:migrator')\n\n/**\n * @typedef {import('./types').Migration} Migration\n * @typedef {import('./types').ProgressCallback} ProgressCallback\n * @typedef {import('./types').MigrationProgressCallback} MigrationProgressCallback\n */\n\nexports.getCurrentRepoVersion = repoVersion.getVersion\nexports.errors = errors\n\n/**\n * Returns the version of latest migration.\n * If no migrations are present returns 0.\n *\n * @param {Migration[]} [migrations] - Array of migrations to consider. If undefined, the bundled migrations are used. Mainly for testing purpose.\n */\nfunction getLatestMigrationVersion (migrations) {\n  migrations = migrations || defaultMigrations\n\n  if (!Array.isArray(migrations) || migrations.length === 0) {\n    return 0\n  }\n\n  return migrations[migrations.length - 1].version\n}\n\nexports.getLatestMigrationVersion = getLatestMigrationVersion\n\n/**\n * Main function to execute forward migrations.\n * It acquire lock on the provided path before doing any migrations.\n *\n * Signature of the progress callback is: function(migrationObject: object, currentMigrationNumber: int, totalMigrationsCount: int)\n *\n * @param {string} path - Path to initialized (!) JS-IPFS repo\n * @param {object} repoOptions - Options that are passed to migrations, that can use them to correctly construct datastore. Options are same like for IPFSRepo.\n * @param {number} toVersion - Version to which the repo should be migrated.\n * @param {object} [options] - Options for migration\n * @param {boolean} [options.ignoreLock] - Won't lock the repo for applying the migrations. Use with caution.\n * @param {ProgressCallback} [options.onProgress] - Callback which will be called after each executed migration to report progress\n * @param {boolean} [options.isDryRun] - Allows to simulate the execution of the migrations without any effect.\n * @param {Migration[]} [options.migrations] - Array of migrations to perform. If undefined, the bundled migrations are used. Mainly for testing purpose.\n */\nasync function migrate (path, repoOptions, toVersion, { ignoreLock = false, onProgress, isDryRun = false, migrations }) {\n  migrations = migrations || defaultMigrations\n\n  if (!path) {\n    throw new errors.RequiredParameterError('Path argument is required!')\n  }\n\n  if (!repoOptions) {\n    throw new errors.RequiredParameterError('repoOptions argument is required!')\n  }\n\n  if (!toVersion) {\n    throw new errors.RequiredParameterError('toVersion argument is required!')\n  }\n\n  if (!Number.isInteger(toVersion) || toVersion <= 0) {\n    throw new errors.InvalidValueError('Version has to be positive integer!')\n  }\n\n  const currentVersion = await repoVersion.getVersion(path, repoOptions)\n\n  if (currentVersion === toVersion) {\n    log('Nothing to migrate.')\n    return\n  }\n\n  if (currentVersion > toVersion) {\n    throw new errors.InvalidValueError(`Current repo's version (${currentVersion}) is higher then toVersion (${toVersion}), you probably wanted to revert it?`)\n  }\n\n  verifyAvailableMigrations(migrations, currentVersion, toVersion)\n\n  let lock\n\n  if (!isDryRun && !ignoreLock) {\n    lock = await repoLock.lock(currentVersion, path, repoOptions)\n  }\n\n  try {\n    for (const migration of migrations) {\n      if (toVersion !== undefined && migration.version > toVersion) {\n        break\n      }\n\n      if (migration.version <= currentVersion) {\n        continue\n      }\n\n      log(`Migrating version ${migration.version}`)\n\n      try {\n        if (!isDryRun) {\n          /** @type {MigrationProgressCallback} */\n          let progressCallback = () => {}\n\n          if (onProgress) { // eslint-disable-line max-depth\n            progressCallback = (percent, message) => onProgress(migration.version, percent.toFixed(2), message)\n          }\n\n          await migration.migrate(path, repoOptions, progressCallback)\n        }\n      } catch (e) {\n        const lastSuccessfullyMigratedVersion = migration.version - 1\n\n        log(`An exception was raised during execution of migration. Setting the repo's version to last successfully migrated version: ${lastSuccessfullyMigratedVersion}`)\n        await repoVersion.setVersion(path, lastSuccessfullyMigratedVersion, repoOptions)\n\n        throw new Error(`During migration to version ${migration.version} exception was raised: ${e.stack || e.message || e}`)\n      }\n\n      log(`Migrating to version ${migration.version} finished`)\n    }\n\n    if (!isDryRun) {\n      await repoVersion.setVersion(path, toVersion || getLatestMigrationVersion(migrations), repoOptions)\n    }\n\n    log('Repo successfully migrated', toVersion !== undefined ? `to version ${toVersion}!` : 'to latest version!')\n  } finally {\n    if (!isDryRun && !ignoreLock && lock) {\n      await lock.close()\n    }\n  }\n}\n\nexports.migrate = migrate\n\n/**\n * Main function to execute backward migration (reversion).\n * It acquire lock on the provided path before doing any migrations.\n *\n * Signature of the progress callback is: function(migrationObject: object, currentMigrationNumber: int, totalMigrationsCount: int)\n *\n * @param {string} path - Path to initialized (!) JS-IPFS repo\n * @param {object} repoOptions - Options that are passed to migrations, that can use them to correctly construct datastore. Options are same like for IPFSRepo.\n * @param {number} toVersion - Version to which the repo will be reverted.\n * @param {object} [options] - Options for the reversion\n * @param {ProgressCallback} [options.onProgress] - Callback which will be called after each reverted migration to report progress\n * @param {boolean} [options.isDryRun] - Allows to simulate the execution of the reversion without any effects. Make sense to utilize onProgress with this argument.\n * @param {boolean} [options.ignoreLock] - Won't lock the repo for reverting the migrations. Use with caution.\n * @param {Migration[]} [options.migrations] - Array of migrations to migrate. If undefined, the bundled migrations are used. Mainly for testing purpose.\n */\nasync function revert (path, repoOptions, toVersion, { ignoreLock = false, onProgress, isDryRun = false, migrations }) {\n  migrations = migrations || defaultMigrations\n\n  if (!path) {\n    throw new errors.RequiredParameterError('Path argument is required!')\n  }\n\n  if (!repoOptions) {\n    throw new errors.RequiredParameterError('repoOptions argument is required!')\n  }\n\n  if (!toVersion) {\n    throw new errors.RequiredParameterError('When reverting migrations, you have to specify to which version to revert!')\n  }\n\n  if (!Number.isInteger(toVersion) || toVersion <= 0) {\n    throw new errors.InvalidValueError('Version has to be positive integer!')\n  }\n\n  const currentVersion = await repoVersion.getVersion(path, repoOptions)\n\n  if (currentVersion === toVersion) {\n    log('Nothing to revert.')\n    return\n  }\n\n  if (currentVersion < toVersion) {\n    throw new errors.InvalidValueError(`Current repo's version (${currentVersion}) is lower then toVersion (${toVersion}), you probably wanted to migrate it?`)\n  }\n\n  verifyAvailableMigrations(migrations, toVersion, currentVersion, true)\n\n  let lock\n  if (!isDryRun && !ignoreLock) {\n    lock = await repoLock.lock(currentVersion, path, repoOptions)\n  }\n\n  log(`Reverting from version ${currentVersion} to ${toVersion}`)\n\n  try {\n    const reversedMigrationArray = migrations.slice().reverse()\n\n    for (const migration of reversedMigrationArray) {\n      if (migration.version <= toVersion) {\n        break\n      }\n\n      if (migration.version > currentVersion) {\n        continue\n      }\n\n      log(`Reverting migration version ${migration.version}`)\n\n      try {\n        if (!isDryRun) {\n          /** @type {MigrationProgressCallback} */\n          let progressCallback = () => {}\n\n          if (onProgress) { // eslint-disable-line max-depth\n            progressCallback = (percent, message) => onProgress(migration.version, percent.toFixed(2), message)\n          }\n\n          await migration.revert(path, repoOptions, progressCallback)\n        }\n      } catch (e) {\n        const lastSuccessfullyRevertedVersion = migration.version\n        log(`An exception was raised during execution of migration. Setting the repo's version to last successfully reverted version: ${lastSuccessfullyRevertedVersion}`)\n        await repoVersion.setVersion(path, lastSuccessfullyRevertedVersion, repoOptions)\n\n        e.message = `During reversion to version ${migration.version} exception was raised: ${e.message}`\n        throw e\n      }\n\n      log(`Reverting to version ${migration.version} finished`)\n    }\n\n    if (!isDryRun) {\n      await repoVersion.setVersion(path, toVersion, repoOptions)\n    }\n\n    log(`All migrations successfully reverted to version ${toVersion}!`)\n  } finally {\n    if (!isDryRun && !ignoreLock && lock) {\n      await lock.close()\n    }\n  }\n}\n\nexports.revert = revert\n\n/**\n * Function checks if all migrations in given range are available.\n *\n * @param {Migration[]} migrations\n * @param {number} fromVersion\n * @param {number} toVersion\n * @param {boolean} checkReversibility - Will additionally checks if all the migrations in the range are reversible\n */\nfunction verifyAvailableMigrations (migrations, fromVersion, toVersion, checkReversibility = false) {\n  let migrationCounter = 0\n  for (const migration of migrations) {\n    if (migration.version > toVersion) {\n      break\n    }\n\n    if (migration.version > fromVersion) {\n      if (checkReversibility && !migration.revert) {\n        throw new errors.NonReversibleMigrationError(`It is not possible to revert to version ${fromVersion} because migration version ${migration.version} is not reversible. Cancelling reversion.`)\n      }\n\n      migrationCounter++\n    }\n  }\n\n  if (migrationCounter !== (toVersion - fromVersion)) {\n    throw new errors.InvalidValueError(`The ipfs-repo-migrations package does not have all migration to migrate from version ${fromVersion} to ${toVersion}`)\n  }\n}\n","'use strict'\n\n/**\n * @type {import('../src/types').Migration}\n */\nconst emptyMigration = {\n  description: 'Empty migration.',\n  // @ts-ignore\n  migrate: () => {},\n  // @ts-ignore\n  revert: () => {},\n  empty: true\n}\n\nmodule.exports = [\n  Object.assign({version: 1}, emptyMigration),\n  Object.assign({version: 2}, emptyMigration),\n  Object.assign({version: 3}, emptyMigration),\n  Object.assign({version: 4}, emptyMigration),\n  Object.assign({version: 5}, emptyMigration),\n  Object.assign({version: 6}, emptyMigration),\n  Object.assign({version: 7}, emptyMigration),\n  require('./migration-8'),\n  require('./migration-9'),\n  require('./migration-10')\n]\n","'use strict'\n\nconst CID = require('cids')\nconst Key = require('interface-datastore').Key\nconst mb = require('multibase')\nconst log = require('debug')('ipfs:repo:migrator:migration-8')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst { createStore } = require('../../src/utils')\nconst length = require('it-length')\n\n/**\n * @typedef {import('../../src/types').Migration} Migration\n */\n\n/**\n * @param {Key} key\n */\nfunction keyToMultihash (key) {\n  const buf = mb.decode(`b${key.toString().slice(1)}`)\n\n  // Extract multihash from CID\n  let multihash = new CID(buf).multihash\n\n  // Encode and slice off multibase codec\n  multihash = mb.encode('base32', multihash).slice(1)\n\n  // Should be uppercase for interop with go\n  const multihashStr = uint8ArrayToString(multihash).toUpperCase()\n\n  return new Key(`/${multihashStr}`, false)\n}\n\n/**\n * @param {Key} key\n */\nfunction keyToCid (key) {\n  const buf = mb.decode(`b${key.toString().slice(1)}`)\n\n  // CID to Key\n  const multihash = mb.encode('base32', new CID(1, 'raw', buf).bytes).slice(1)\n\n  return new Key(`/${uint8ArrayToString(multihash)}`.toUpperCase(), false)\n}\n\n/**\n * @param {string} repoPath\n * @param {*} repoOptions\n * @param {(percent: number, message: string) => void} onProgress\n * @param {(key: Key) => Key} keyFunction\n */\nasync function process (repoPath, repoOptions, onProgress, keyFunction) {\n  const blockstore = createStore(repoPath, 'blocks', repoOptions)\n  await blockstore.open()\n\n  let blockCount\n\n  blockCount = await length(blockstore.queryKeys({\n    filters: [(key) => {\n      const newKey = keyFunction(key)\n\n      return newKey.toString() !== key.toString()\n    }]\n  }))\n\n  try {\n    let counter = 0\n\n    for await (const block of blockstore.query({})) {\n      const newKey = keyFunction(block.key)\n\n      // If the Key is base32 CIDv0 then there's nothing to do\n      if(newKey.toString() !== block.key.toString()) {\n        counter += 1\n        log(`Migrating Block from ${block.key} to ${newKey}`)\n        await blockstore.delete(block.key)\n        await blockstore.put(newKey, block.value)\n\n        onProgress((counter / blockCount) * 100, `Migrated Block from ${block.key} to ${newKey}`)\n      }\n    }\n  } finally {\n    await blockstore.close()\n  }\n}\n\n/** @type {Migration} */\nmodule.exports = {\n  version: 8,\n  description: 'Transforms key names into base32 encoding and converts Block store to use bare multihashes encoded as base32',\n  migrate: (repoPath, repoOptions, onProgress = () => {}) => {\n    return process(repoPath, repoOptions, onProgress, keyToMultihash)\n  },\n  revert: (repoPath, repoOptions, onProgress = () => {}) => {\n    return process(repoPath, repoOptions, onProgress, keyToCid)\n  }\n}\n","'use strict'\n\nconst {\n  Key,\n  Errors\n} = require('interface-datastore')\nconst core = require('datastore-core')\nconst ShardingStore = core.ShardingDatastore\n\n/**\n * @typedef {import('interface-datastore').Datastore} Datastore\n */\n\nconst CONFIG_KEY = new Key('/config')\nconst VERSION_KEY = new Key('/version')\n\n/**\n * @param {string} name\n * @param {*} options\n */\nfunction getDatastoreAndOptions (name, options) {\n  if (!options || !options.storageBackends) {\n    throw new Error('Please pass storage backend definitions')\n  }\n\n  if (!options.storageBackends[name]) {\n    throw new Error(`Storage backend '${name}' not defined in config`)\n  }\n\n  const StorageBackend = options.storageBackends[name]\n\n  let storageBackendOptions = {}\n\n  if (options.storageBackendOptions !== undefined && options.storageBackendOptions[name] !== undefined) {\n    storageBackendOptions = options.storageBackendOptions[name]\n  }\n\n  return {\n    StorageBackend: StorageBackend,\n    storageOptions: storageBackendOptions\n  }\n}\n\n/**\n * Level dbs wrap level dbs that wrap level dbs. Find a level-js\n * instance in the chain if one exists.\n *\n * @param {Datastore} store\n * @returns {Datastore | undefined}\n */\nfunction findLevelJs (store) {\n  let db = store\n\n  // @ts-ignore\n  while (db.db || db.child) {\n    // @ts-ignore\n    db = db.db || db.child\n\n    // `Level` is only present in the browser, in node it is LevelDOWN\n    // @ts-ignore\n    if (db.type === 'level-js' || db.constructor.name === 'Level') {\n      return db\n    }\n  }\n}\n\n/**\n * @param {Key} key\n * @param {function (Key): Promise<boolean>} has\n * @param {Datastore} store\n * @returns {Promise<boolean>}\n */\nasync function hasWithFallback (key, has, store) {\n  const result = await has(key)\n\n  if (result) {\n    return result\n  }\n\n  // Newer versions of level.js changed the key type from Uint8Array|string\n  // to Uint8Array  so fall back to trying Uint8Arrays if we are using level.js\n  // and the string version of the key did not work\n  const levelJs = findLevelJs(store)\n\n  if (!levelJs) {\n    return false\n  }\n\n  return new Promise((resolve, reject) => {\n    // drop down to IndexDB API, otherwise level-js will monkey around with the keys/values\n    // @ts-ignore\n    const req = levelJs.store('readonly').get(key.toString())\n    req.transaction.onabort = () => {\n      reject(req.transaction.error)\n    }\n    req.transaction.oncomplete = () => {\n      resolve(Boolean(req.result))\n    }\n  })\n}\n\n/**\n * @param {import('interface-datastore').Key} key\n * @param {function (Key): Promise<Uint8Array>} get\n * @param {function (Key): Promise<boolean>} has\n * @param {import('interface-datastore').Datastore} store\n * @returns {Promise<Uint8Array>}\n */\nasync function getWithFallback (key, get, has, store) {\n  if (await has(key)) {\n    return get(key)\n  }\n\n  // Newer versions of level.js changed the key type from Uint8Array|string\n  // to Uint8Array  so fall back to trying Uint8Arrays if we are using level.js\n  // and the string version of the key did not work\n  const levelJs = findLevelJs(store)\n\n  if (!levelJs) {\n    throw Errors.notFoundError()\n  }\n\n  return new Promise((resolve, reject) => {\n    // drop down to IndexDB API, otherwise level-js will monkey around with the keys/values\n    // @ts-ignore\n    const req = levelJs.store('readonly').get(key.toString())\n    req.transaction.onabort = () => {\n      reject(req.transaction.error)\n    }\n    req.transaction.oncomplete = () => {\n      if (req.result) {\n        return resolve(req.result)\n      }\n\n      reject(Errors.notFoundError())\n    }\n  })\n}\n\n/**\n * @param {string} location\n * @param {string} name\n * @param {*} options\n * @returns {Datastore}\n */\nfunction createStore (location, name, options) {\n  const { StorageBackend, storageOptions } = getDatastoreAndOptions(name, options)\n\n  if (name !== 'root') {\n    location = `${location}/${name}`\n  }\n\n  let store = new StorageBackend(location, storageOptions)\n\n  // @ts-ignore\n  if (storageOptions.sharding) {\n    store = new ShardingStore(store, new core.shard.NextToLast(2))\n  }\n\n  // necessary since level-js@5 cannot read keys from level-js@4 and earlier\n  const originalGet = store.get.bind(store)\n  const originalHas = store.has.bind(store)\n  /**\n   * @param {Key} key\n   */\n  store.get = (key) => getWithFallback(key, originalGet, originalHas, store)\n  /**\n   * @param {Key} key\n   */\n  store.has = (key) => hasWithFallback(key, originalHas, store)\n\n  return store\n}\n\nmodule.exports = {\n  createStore,\n  hasWithFallback,\n  getWithFallback,\n  findLevelJs,\n  CONFIG_KEY,\n  VERSION_KEY\n}\n","'use strict'\n\n/**\n * Consumes the passed iterator and returns the number of items it contained.\n *\n * @param {AsyncIterable<object>} iterator\n * @returns {Promise<number>}\n */\nconst length = async (iterator) => {\n  let count = 0\n\n  for await (const _ of iterator) { // eslint-disable-line no-unused-vars\n    count++\n  }\n\n  return count\n}\n\nmodule.exports = length\n","'use strict'\n\nconst CID = require('cids')\nconst dagpb = require('ipld-dag-pb')\nconst cbor = require('cborg')\nconst multicodec = require('multicodec')\nconst multibase = require('multibase')\nconst pinset = require('./pin-set')\nconst { createStore } = require('../../src/utils')\nconst { cidToKey, PIN_DS_KEY, PinTypes } = require('./utils')\nconst length = require('it-length')\n\n/**\n * @typedef {import('../../src/types').Migration} Migration\n * @typedef {import('../../src/types').MigrationProgressCallback} MigrationProgressCallback\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('multicodec').CodecCode} CodecCode\n */\n\n /**\n  * @param {Datastore} blockstore\n  * @param {Datastore} datastore\n  * @param {Datastore} pinstore\n  * @param {MigrationProgressCallback} onProgress\n  */\nasync function pinsToDatastore (blockstore, datastore, pinstore, onProgress) {\n  if (!await datastore.has(PIN_DS_KEY)) {\n    return\n  }\n\n  const mh = await datastore.get(PIN_DS_KEY)\n  const cid = new CID(mh)\n  const pinRootBuf = await blockstore.get(cidToKey(cid))\n  const pinRoot = dagpb.util.deserialize(pinRootBuf)\n  let counter = 0\n  let pinCount\n\n  pinCount = (await length(pinset.loadSet(blockstore, pinRoot, PinTypes.recursive))) + (await length(pinset.loadSet(blockstore, pinRoot, PinTypes.direct)))\n\n  for await (const cid of pinset.loadSet(blockstore, pinRoot, PinTypes.recursive)) {\n    counter++\n\n    /** @type {{ depth: number, version?: CID.CIDVersion, codec?: CodecCode }} */\n    const pin = {\n      depth: Infinity\n    }\n\n    if (cid.version !== 0) {\n      pin.version = cid.version\n    }\n\n    if (cid.codec !== 'dag-pb') {\n      pin.codec = multicodec.getNumber(cid.codec)\n    }\n\n    await pinstore.put(cidToKey(cid), cbor.encode(pin))\n\n    onProgress((counter / pinCount) * 100, `Migrated recursive pin ${cid}`)\n  }\n\n  for await (const cid of pinset.loadSet(blockstore, pinRoot, PinTypes.direct)) {\n    counter++\n\n    /** @type {{ depth: number, version?: CID.CIDVersion, codec?: CodecCode }} */\n    const pin = {\n      depth: 0\n    }\n\n    if (cid.version !== 0) {\n      pin.version = cid.version\n    }\n\n    if (cid.codec !== 'dag-pb') {\n      pin.codec = multicodec.getNumber(cid.codec)\n    }\n\n    await pinstore.put(cidToKey(cid), cbor.encode(pin))\n\n    onProgress((counter / pinCount) * 100, `Migrated direct pin ${cid}`)\n  }\n\n  await blockstore.delete(cidToKey(cid))\n  await datastore.delete(PIN_DS_KEY)\n}\n\n/**\n  * @param {Datastore} blockstore\n  * @param {Datastore} datastore\n  * @param {Datastore} pinstore\n  * @param {MigrationProgressCallback} onProgress\n  */\nasync function pinsToDAG (blockstore, datastore, pinstore, onProgress) {\n  let recursivePins = []\n  let directPins = []\n  let counter = 0\n  const pinCount = await length(pinstore.queryKeys({}))\n\n  for await (const { key, value } of pinstore.query({})) {\n    counter++\n    const pin = cbor.decode(value)\n    const cid = new CID(pin.version || 0, pin.codec && multicodec.getName(pin.codec) || 'dag-pb', multibase.decode('b' + key.toString().split('/').pop()))\n\n    if (pin.depth === 0) {\n      onProgress((counter / pinCount) * 100, `Reverted direct pin ${cid}`)\n\n      directPins.push(cid)\n    } else {\n      onProgress((counter / pinCount) * 100, `Reverted recursive pin ${cid}`)\n\n      recursivePins.push(cid)\n    }\n  }\n\n  onProgress(100, 'Updating pin root')\n  const pinRoot = new dagpb.DAGNode(new Uint8Array(), [\n    await pinset.storeSet(blockstore, PinTypes.recursive, recursivePins),\n    await pinset.storeSet(blockstore, PinTypes.direct, directPins)\n  ])\n  const buf = pinRoot.serialize()\n  const cid = await dagpb.util.cid(buf, {\n    cidVersion: 0\n  })\n  await blockstore.put(cidToKey(cid), buf)\n  await datastore.put(PIN_DS_KEY, cid.multihash)\n}\n\n/**\n * @param {string} repoPath\n * @param {*} repoOptions\n * @param {MigrationProgressCallback} onProgress\n * @param {*} fn\n */\nasync function process (repoPath, repoOptions, onProgress, fn) {\n  const blockstore = createStore(repoPath, 'blocks', repoOptions)\n  const datastore = createStore(repoPath, 'datastore', repoOptions)\n  const pinstore = createStore(repoPath, 'pins', repoOptions)\n\n  await blockstore.open()\n  await datastore.open()\n  await pinstore.open()\n\n  try {\n    await fn(blockstore, datastore, pinstore, onProgress)\n  } finally {\n    await pinstore.close()\n    await datastore.close()\n    await blockstore.close()\n  }\n}\n\n/** @type {Migration} */\nmodule.exports = {\n  version: 9,\n  description: 'Migrates pins to datastore',\n  migrate: (repoPath, repoOptions, onProgress = () => {}) => {\n    return process(repoPath, repoOptions, onProgress, pinsToDatastore)\n  },\n  revert: (repoPath, repoOptions, onProgress = () => {}) => {\n    return process(repoPath, repoOptions, onProgress, pinsToDAG)\n  }\n}\n","'use strict'\n\nconst CID = require('cids')\nconst {\n  ipfs: {\n    pin: {\n      Set: PinSet\n    }\n  }\n} = require('./pin')\n\n// @ts-ignore\nconst fnv1a = require('fnv1a')\nconst varint = require('varint')\nconst dagpb = require('ipld-dag-pb')\nconst DAGNode = require('ipld-dag-pb/src/dag-node/dagNode')\nconst DAGLink = require('ipld-dag-pb/src/dag-link/dagLink')\nconst multihash = require('multihashing-async').multihash\nconst { cidToKey, DEFAULT_FANOUT, MAX_ITEMS, EMPTY_KEY } = require('./utils')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst uint8ArrayCompare = require('uint8arrays/compare')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\n/**\n * @typedef {import('interface-datastore').Datastore} Datastore\n *\n * @typedef {object} Pin\n * @property {CID} key\n * @property {Uint8Array} [data]\n */\n\n/**\n * @param {Uint8Array | CID} hash\n */\nfunction toB58String (hash) {\n  return new CID(hash).toBaseEncodedString()\n}\n\n/**\n * @param {DAGNode} rootNode\n */\nfunction readHeader (rootNode) {\n  // rootNode.data should be a buffer of the format:\n  // < varint(headerLength) | header | itemData... >\n  const rootData = rootNode.Data\n  const hdrLength = varint.decode(rootData)\n  const vBytes = varint.decode.bytes\n\n  if (vBytes <= 0) {\n    throw new Error('Invalid Set header length')\n  }\n\n  if (vBytes + hdrLength > rootData.length) {\n    throw new Error('Impossibly large set header length')\n  }\n\n  const hdrSlice = rootData.slice(vBytes, hdrLength + vBytes)\n  const header = PinSet.toObject(PinSet.decode(hdrSlice), {\n    defaults: false,\n    arrays: true,\n    longs: Number,\n    objects: false\n  })\n\n  if (header.version !== 1) {\n    throw new Error(`Unsupported Set version: ${header.version}`)\n  }\n\n  if (header.fanout > rootNode.Links.length) {\n    throw new Error('Impossibly large fanout')\n  }\n\n  return {\n    header: header,\n    data: rootData.slice(hdrLength + vBytes)\n  }\n}\n\n/**\n * @param {number} seed\n * @param {CID} key\n */\nfunction hash (seed, key) {\n  const buffer = new Uint8Array(4)\n  const dataView = new DataView(buffer.buffer)\n  dataView.setUint32(0, seed, true)\n  const encodedKey = uint8ArrayFromString(toB58String(key))\n  const data = uint8ArrayConcat([buffer, encodedKey], buffer.byteLength + encodedKey.byteLength)\n\n  return fnv1a(uint8ArrayToString(data))\n}\n\n/**\n * @param {Datastore} blockstore\n * @param {DAGNode} node\n * @returns {AsyncGenerator<CID, void, undefined>}\n */\nasync function * walkItems (blockstore, node) {\n  const pbh = readHeader(node)\n  let idx = 0\n\n  for (const link of node.Links) {\n    if (idx < pbh.header.fanout) {\n      // the first pbh.header.fanout links are fanout bins\n      // if a fanout bin is not 'empty', dig into and walk its DAGLinks\n      const linkHash = link.Hash\n\n      if (!uint8ArrayEquals(EMPTY_KEY, linkHash.bytes)) {\n        // walk the links of this fanout bin\n        const buf = await blockstore.get(cidToKey(linkHash))\n        const node = dagpb.util.deserialize(buf)\n\n        yield * walkItems(blockstore, node)\n      }\n    } else {\n      // otherwise, the link is a pin\n      yield link.Hash\n    }\n\n    idx++\n  }\n}\n\n/**\n * @param {Datastore} blockstore\n * @param {DAGNode} rootNode\n * @param {string} name\n */\nasync function * loadSet (blockstore, rootNode, name) {\n  const link = rootNode.Links.find(l => l.Name === name)\n\n  if (!link) {\n    throw new Error('No link found with name ' + name)\n  }\n\n  const buf = await blockstore.get(cidToKey(link.Hash))\n  const node = dagpb.util.deserialize(buf)\n\n  yield * walkItems(blockstore, node)\n}\n\n/**\n * @param {Datastore} blockstore\n * @param {Pin[]} items\n */\nfunction storeItems (blockstore, items) {\n  return storePins(items, 0)\n\n  /**\n   * @param {Pin[]} pins\n   * @param {number} depth\n   */\n  async function storePins (pins, depth) {\n    const pbHeader = PinSet.encode({\n      version: 1,\n      fanout: DEFAULT_FANOUT,\n      seed: depth\n    }).finish()\n\n    const header = varint.encode(pbHeader.length)\n    const headerBuf = uint8ArrayConcat([header, pbHeader])\n    const fanoutLinks = []\n\n    for (let i = 0; i < DEFAULT_FANOUT; i++) {\n      fanoutLinks.push(new DAGLink('', 1, EMPTY_KEY))\n    }\n\n    if (pins.length <= MAX_ITEMS) {\n      const nodes = pins\n        .map(item => {\n          return ({\n            link: new DAGLink('', 1, item.key),\n            data: item.data || new Uint8Array()\n          })\n        })\n        // sorting makes any ordering of `pins` produce the same DAGNode\n        .sort((a, b) => {\n          return uint8ArrayCompare(a.link.Hash.bytes, b.link.Hash.bytes)\n        })\n\n      const rootLinks = fanoutLinks.concat(nodes.map(item => item.link))\n      const rootData = uint8ArrayConcat([headerBuf, ...nodes.map(item => item.data)])\n\n      return new DAGNode(rootData, rootLinks)\n    } else {\n      // If the array of pins is > MAX_ITEMS, we:\n      //  - distribute the pins among `DEFAULT_FANOUT` bins\n      //    - create a DAGNode for each bin\n      //      - add each pin as a DAGLink to that bin\n      //  - create a root DAGNode\n      //    - add each bin as a DAGLink\n      //  - send that root DAGNode via callback\n      // (using go-ipfs' \"wasteful but simple\" approach for consistency)\n      // https://github.com/ipfs/go-ipfs/blob/master/pin/set.go#L57\n\n      /** @type {Pin[][]} */\n      const bins = pins.reduce((bins, pin) => {\n        const n = hash(depth, pin.key) % DEFAULT_FANOUT\n        // @ts-ignore\n        bins[n] = n in bins ? bins[n].concat([pin]) : [pin]\n        return bins\n      }, [])\n\n      let idx = 0\n      for (const bin of bins) {\n        const child = await storePins(bin, depth + 1)\n\n        await storeChild(child, idx)\n\n        idx++\n      }\n\n      return new DAGNode(headerBuf, fanoutLinks)\n    }\n\n    /**\n     * @param {DAGNode} child\n     * @param {number} binIdx\n     */\n    async function storeChild (child, binIdx) {\n      const buf = dagpb.util.serialize(child)\n      const cid = await dagpb.util.cid(buf, {\n        cidVersion: 0,\n        hashAlg: multihash.names['sha2-256']\n      })\n      await blockstore.put(cidToKey(cid), buf)\n\n      fanoutLinks[binIdx] = new DAGLink('', child.size, cid)\n    }\n  }\n}\n\n/**\n * @param {Datastore} blockstore\n * @param {string} type\n * @param {CID[]} cids\n */\nasync function storeSet (blockstore, type, cids) {\n  const rootNode = await storeItems(blockstore, cids.map(cid => {\n    return {\n      key: cid\n    }\n  }))\n  const buf = rootNode.serialize()\n  const cid = await dagpb.util.cid(buf, {\n    cidVersion: 0,\n    hashAlg: multihash.names['sha2-256']\n  })\n\n  await blockstore.put(cidToKey(cid), buf)\n\n  return new DAGLink(type, rootNode.size, cid)\n}\n\nmodule.exports = {\n  loadSet,\n  storeSet\n}\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"default\"] || ($protobuf.roots[\"default\"] = {});\n\n$root.ipfs = (function() {\n\n    /**\n     * Namespace ipfs.\n     * @exports ipfs\n     * @namespace\n     */\n    var ipfs = {};\n\n    ipfs.pin = (function() {\n\n        /**\n         * Namespace pin.\n         * @memberof ipfs\n         * @namespace\n         */\n        var pin = {};\n\n        pin.Set = (function() {\n\n            /**\n             * Properties of a Set.\n             * @memberof ipfs.pin\n             * @interface ISet\n             * @property {number|null} [version] Set version\n             * @property {number|null} [fanout] Set fanout\n             * @property {number|null} [seed] Set seed\n             */\n\n            /**\n             * Constructs a new Set.\n             * @memberof ipfs.pin\n             * @classdesc Represents a Set.\n             * @implements ISet\n             * @constructor\n             * @param {ipfs.pin.ISet=} [p] Properties to set\n             */\n            function Set(p) {\n                if (p)\n                    for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                        if (p[ks[i]] != null)\n                            this[ks[i]] = p[ks[i]];\n            }\n\n            /**\n             * Set version.\n             * @member {number} version\n             * @memberof ipfs.pin.Set\n             * @instance\n             */\n            Set.prototype.version = 0;\n\n            /**\n             * Set fanout.\n             * @member {number} fanout\n             * @memberof ipfs.pin.Set\n             * @instance\n             */\n            Set.prototype.fanout = 0;\n\n            /**\n             * Set seed.\n             * @member {number} seed\n             * @memberof ipfs.pin.Set\n             * @instance\n             */\n            Set.prototype.seed = 0;\n\n            /**\n             * Encodes the specified Set message. Does not implicitly {@link ipfs.pin.Set.verify|verify} messages.\n             * @function encode\n             * @memberof ipfs.pin.Set\n             * @static\n             * @param {ipfs.pin.ISet} m Set message or plain object to encode\n             * @param {$protobuf.Writer} [w] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            Set.encode = function encode(m, w) {\n                if (!w)\n                    w = $Writer.create();\n                if (m.version != null && Object.hasOwnProperty.call(m, \"version\"))\n                    w.uint32(8).uint32(m.version);\n                if (m.fanout != null && Object.hasOwnProperty.call(m, \"fanout\"))\n                    w.uint32(16).uint32(m.fanout);\n                if (m.seed != null && Object.hasOwnProperty.call(m, \"seed\"))\n                    w.uint32(29).fixed32(m.seed);\n                return w;\n            };\n\n            /**\n             * Decodes a Set message from the specified reader or buffer.\n             * @function decode\n             * @memberof ipfs.pin.Set\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n             * @param {number} [l] Message length if known beforehand\n             * @returns {ipfs.pin.Set} Set\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            Set.decode = function decode(r, l) {\n                if (!(r instanceof $Reader))\n                    r = $Reader.create(r);\n                var c = l === undefined ? r.len : r.pos + l, m = new $root.ipfs.pin.Set();\n                while (r.pos < c) {\n                    var t = r.uint32();\n                    switch (t >>> 3) {\n                    case 1:\n                        m.version = r.uint32();\n                        break;\n                    case 2:\n                        m.fanout = r.uint32();\n                        break;\n                    case 3:\n                        m.seed = r.fixed32();\n                        break;\n                    default:\n                        r.skipType(t & 7);\n                        break;\n                    }\n                }\n                return m;\n            };\n\n            /**\n             * Creates a Set message from a plain object. Also converts values to their respective internal types.\n             * @function fromObject\n             * @memberof ipfs.pin.Set\n             * @static\n             * @param {Object.<string,*>} d Plain object\n             * @returns {ipfs.pin.Set} Set\n             */\n            Set.fromObject = function fromObject(d) {\n                if (d instanceof $root.ipfs.pin.Set)\n                    return d;\n                var m = new $root.ipfs.pin.Set();\n                if (d.version != null) {\n                    m.version = d.version >>> 0;\n                }\n                if (d.fanout != null) {\n                    m.fanout = d.fanout >>> 0;\n                }\n                if (d.seed != null) {\n                    m.seed = d.seed >>> 0;\n                }\n                return m;\n            };\n\n            /**\n             * Creates a plain object from a Set message. Also converts values to other types if specified.\n             * @function toObject\n             * @memberof ipfs.pin.Set\n             * @static\n             * @param {ipfs.pin.Set} m Set\n             * @param {$protobuf.IConversionOptions} [o] Conversion options\n             * @returns {Object.<string,*>} Plain object\n             */\n            Set.toObject = function toObject(m, o) {\n                if (!o)\n                    o = {};\n                var d = {};\n                if (o.defaults) {\n                    d.version = 0;\n                    d.fanout = 0;\n                    d.seed = 0;\n                }\n                if (m.version != null && m.hasOwnProperty(\"version\")) {\n                    d.version = m.version;\n                }\n                if (m.fanout != null && m.hasOwnProperty(\"fanout\")) {\n                    d.fanout = m.fanout;\n                }\n                if (m.seed != null && m.hasOwnProperty(\"seed\")) {\n                    d.seed = m.seed;\n                }\n                return d;\n            };\n\n            /**\n             * Converts this Set to JSON.\n             * @function toJSON\n             * @memberof ipfs.pin.Set\n             * @instance\n             * @returns {Object.<string,*>} JSON object\n             */\n            Set.prototype.toJSON = function toJSON() {\n                return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n            };\n\n            return Set;\n        })();\n\n        return pin;\n    })();\n\n    return ipfs;\n})();\n\nmodule.exports = $root;\n","/**\n * Created by schwarzkopfb on 15/11/17.\n */\n\n/**\n * FNV-1a hash generation init value.\n * It's exposed, because this allows user to override it.\n *\n * @type {number}\n */\nhash.BASE = 0x811c9dc5\n\n/**\n * Generates 32 bit FNV-1a hash from the given string.\n * As explained here: http://isthe.com/chongo/tech/comp/fnv/\n *\n * @param s {string} String to generate hash from.\n * @returns {number} The result integer hash.\n */\nfunction hash(s) {\n    var h = hash.BASE\n\n    for (var i = 0, l = s.length; i < l; i++) {\n        h ^= s.charCodeAt(i)\n        h += (h << 1) + (h << 4) + (h << 7) + (h << 8) + (h << 24)\n    }\n\n    return h >>> 0\n}\n\nmodule.exports = hash\n","'use strict'\n\nconst multibase = require('multibase')\nconst { Key } = require('interface-datastore')\nconst multihashes = require('multihashing-async').multihash\n\nconst PIN_DS_KEY = new Key('/local/pins')\nconst DEFAULT_FANOUT = 256\nconst MAX_ITEMS = 8192\nconst EMPTY_KEY = multihashes.fromB58String('QmdfTbBqBPQ7VNxZEYEj14VmRuZBkqFbiwReogJgS1zR1n')\n\nconst PinTypes = {\n  direct: 'direct',\n  recursive: 'recursive'\n}\n\n/**\n * @param {import('cids')} cid\n */\nfunction cidToKey (cid) {\n  return new Key(`/${multibase.encoding('base32upper').encode(cid.multihash)}`)\n}\n\nmodule.exports = {\n  PIN_DS_KEY,\n  DEFAULT_FANOUT,\n  MAX_ITEMS,\n  EMPTY_KEY,\n  PinTypes,\n  cidToKey\n}\n","'use strict'\n\nconst {\n  createStore,\n  findLevelJs\n} = require('../../src/utils')\nconst fromString = require('uint8arrays/from-string')\nconst toString = require('uint8arrays/to-string')\n\n/**\n * @typedef {import('../../src/types').Migration} Migration\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('../../src/types').MigrationProgressCallback} MigrationProgressCallback\n *\n * @typedef {{ type: 'del', key: string | Uint8Array } | { type: 'put', key: string | Uint8Array, value: Uint8Array }} Operation\n * @typedef {function (string, Uint8Array): Operation[]} UpgradeFunction\n * @typedef {function (Uint8Array, Uint8Array): Operation[]} DowngradeFunction\n */\n\n /**\n  * @param {string} name\n  * @param {Datastore} store\n  * @param {(message: string) => void} onProgress\n  */\nasync function keysToBinary (name, store, onProgress = () => {}) {\n  let db = findLevelJs(store)\n\n  // only interested in level-js\n  if (!db) {\n    onProgress(`${name} did not need an upgrade`)\n\n    return\n  }\n\n  onProgress(`Upgrading ${name}`)\n\n  /**\n   * @type {UpgradeFunction}\n   */\n  const upgrade = (key, value) => {\n    return [\n      { type: 'del', key: key },\n      { type: 'put', key: fromString(key), value: value }\n    ]\n  }\n\n  await withEach(db, upgrade)\n}\n\n /**\n  * @param {string} name\n  * @param {Datastore} store\n  * @param {(message: string) => void} onProgress\n  */\nasync function keysToStrings (name, store, onProgress = () => {}) {\n  let db = findLevelJs(store)\n\n  // only interested in level-js\n  if (!db) {\n    onProgress(`${name} did not need a downgrade`)\n\n    return\n  }\n\n  onProgress(`Downgrading ${name}`)\n\n  /**\n   * @type {DowngradeFunction}\n   */\n  const downgrade = (key, value) => {\n    return [\n      { type: 'del', key: key },\n      { type: 'put', key: toString(key), value: value }\n    ]\n  }\n\n  await withEach(db, downgrade)\n}\n\n/**\n *\n * @param {string} repoPath\n * @param {any} repoOptions\n * @param {MigrationProgressCallback} onProgress\n * @param {*} fn\n */\nasync function process (repoPath, repoOptions, onProgress, fn) {\n  const datastores = Object.keys(repoOptions.storageBackends)\n    .filter(key => repoOptions.storageBackends[key].name === 'LevelDatastore')\n    .map(name => ({\n      name,\n      store: createStore(repoPath, name, repoOptions)\n    }))\n\n  onProgress(0, `Migrating ${datastores.length} dbs`)\n  let migrated = 0\n\n  for (const { name, store } of datastores) {\n    await store.open()\n\n    try {\n      /**\n       * @param {string} message\n       */\n      const progress = (message) => {\n        onProgress(Math.round((migrated / datastores.length) * 100), message)\n      }\n\n      await fn(name, store, progress)\n    } finally {\n      migrated++\n      store.close()\n    }\n  }\n\n  onProgress(100, `Migrated ${datastores.length} dbs`)\n}\n\n/** @type {Migration} */\nmodule.exports = {\n  version: 10,\n  description: 'Migrates datastore-level keys to binary',\n  migrate: (repoPath, repoOptions, onProgress = () => {}) => {\n    return process(repoPath, repoOptions, onProgress, keysToBinary)\n  },\n  revert: (repoPath, repoOptions, onProgress = () => {}) => {\n    return process(repoPath, repoOptions, onProgress, keysToStrings)\n  }\n}\n\n/**\n * Uses the upgrade strategy from level-js@5.x.x - note we can't call the `.upgrade` command\n * directly because it will be removed in level-js@6.x.x and we can't guarantee users will\n * have migrated by then - e.g. they may jump from level-js@4.x.x straight to level-js@6.x.x\n * so we have to duplicate the code here.\n *\n * @param {any} db\n * @param {UpgradeFunction | DowngradeFunction} fn\n * @return {Promise<void>}\n */\nfunction withEach (db, fn) {\n  /**\n   * @param {Operation[]} operations\n   * @param {(error?: Error) => void} next\n   */\n  function batch (operations, next) {\n    const store = db.store('readwrite')\n    const transaction = store.transaction\n    let index = 0\n    /** @type {Error | undefined} */\n    let error\n\n    transaction.onabort = () => next(error || transaction.error || new Error('aborted by user'))\n    transaction.oncomplete = () => next()\n\n    function loop () {\n      var op = operations[index++]\n      var key = op.key\n\n      try {\n        var req = op.type === 'del' ? store.delete(key) : store.put(op.value, key)\n      } catch (err) {\n        error = err\n        transaction.abort()\n        return\n      }\n\n      if (index < operations.length) {\n        req.onsuccess = loop\n      }\n    }\n\n    loop()\n  }\n\n  return new Promise((resolve, reject) => {\n    const it = db.iterator()\n    // raw keys and values only\n    /**\n     * @template T\n     * @param {T} data\n     */\n    const id = (data) => data\n    it._deserializeKey = it._deserializeValue = id\n    next()\n\n    function next () {\n      /**\n       * @param {Error | undefined} err\n       * @param {string | undefined} key\n       * @param {Uint8Array} value\n       */\n      const handleNext = (err, key, value) => {\n        if (err || key === undefined) {\n          /**\n           * @param {Error | undefined} err2\n           */\n          const handleEnd = (err2) => {\n            if (err2) {\n              reject(err2)\n              return\n            }\n\n            resolve()\n          }\n\n          it.end(handleEnd)\n\n          return\n        }\n\n        // @ts-ignore\n        batch(fn(key, value), next)\n      }\n      it.next(handleNext)\n    }\n  })\n}\n","'use strict'\n\nconst repoInit = require('./init')\nconst { MissingRepoOptionsError, NotInitializedRepoError } = require('../errors')\nconst { VERSION_KEY, createStore } = require('../utils')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\n/**\n * Function that has responsibility to retrieve version of repo from its root datastore's instance.\n * This function needs to be cross-repo-version functional to be able to fetch any version number,\n * even in case of change of repo's versioning.\n *\n * @param {string} path\n * @param {Object} repoOptions - Options used to create a repo, the same as pased to ipfs-repo\n */\nasync function getVersion (path, repoOptions) {\n  if (!(await repoInit.isRepoInitialized(path, repoOptions))) {\n    throw new NotInitializedRepoError(`Repo in path ${path} is not initialized!`)\n  }\n\n  if (!repoOptions) {\n    throw new MissingRepoOptionsError('Please pass repo options when trying to open a repo')\n  }\n\n  const store = createStore(path, 'root', repoOptions)\n  await store.open()\n\n  try {\n    return parseInt(uint8ArrayToString(await store.get(VERSION_KEY)))\n  } finally {\n    await store.close()\n  }\n}\n\n/**\n * Function for setting a version in cross-repo-version manner.\n *\n * @param {string} path\n * @param {number} version\n * @param {Object} repoOptions - Options used to create a repo, the same as pased to ipfs-repo\n */\nasync function setVersion (path, version, repoOptions) {\n  if (!repoOptions) {\n    throw new MissingRepoOptionsError('Please pass repo options when trying to open a repo')\n  }\n\n  const store = createStore(path, 'root', repoOptions)\n  await store.open()\n  await store.put(VERSION_KEY, uint8ArrayFromString(String(version)))\n  await store.close()\n}\n\nmodule.exports = {\n  getVersion,\n  setVersion\n}\n","'use strict'\n\nconst log = require('debug')('ipfs:repo:migrator:repo:init')\nconst { CONFIG_KEY, VERSION_KEY, createStore } = require('../utils')\nconst { MissingRepoOptionsError } = require('../errors')\n\n/**\n * @param {string} path\n * @param {any} repoOptions\n */\nasync function isRepoInitialized (path, repoOptions) {\n  if (!repoOptions) {\n    throw new MissingRepoOptionsError('Please pass repo options when trying to open a repo')\n  }\n\n  let root\n  try {\n    root = createStore(path, 'root', repoOptions)\n    await root.open()\n    const versionCheck = await root.has(VERSION_KEY)\n    const configCheck = await root.has(CONFIG_KEY)\n    if (!versionCheck || !configCheck) {\n      log(`Version entry present: ${versionCheck}`)\n      log(`Config entry present: ${configCheck}`)\n      return false\n    }\n\n    return true\n  } catch (e) {\n    log('While checking if repo is initialized error was thrown: ' + e.message)\n    return false\n  } finally {\n    if (root !== undefined) {\n      await root.close()\n    }\n  }\n}\n\nmodule.exports = {\n  isRepoInitialized\n}\n","'use strict'\n\n/**\n * Exception raised when trying to revert migration that is not possible\n * to revert.\n */\nclass NonReversibleMigrationError extends Error {\n  /**\n   * @param {string} message\n   */\n  constructor (message) {\n    super(message)\n    this.name = 'NonReversibleMigrationError'\n    this.code = 'ERR_NON_REVERSIBLE_MIGRATION'\n    this.message = message\n  }\n}\nNonReversibleMigrationError.code = 'ERR_NON_REVERSIBLE_MIGRATION'\n\n/**\n * Exception raised when repo is not initialized.\n */\nclass NotInitializedRepoError extends Error {\n  /**\n   * @param {string} message\n   */\n  constructor (message) {\n    super(message)\n    this.name = 'NotInitializedRepoError'\n    this.code = 'ERR_NOT_INITIALIZED_REPO'\n    this.message = message\n  }\n}\nNotInitializedRepoError.code = 'ERR_NOT_INITIALIZED_REPO'\n\n/**\n * Exception raised when required parameter is not provided.\n */\nclass RequiredParameterError extends Error {\n  /**\n   * @param {string} message\n   */\n  constructor (message) {\n    super(message)\n    this.name = 'RequiredParameterError'\n    this.code = 'ERR_REQUIRED_PARAMETER'\n    this.message = message\n  }\n}\nRequiredParameterError.code = 'ERR_REQUIRED_PARAMETER'\n\n/**\n * Exception raised when value is not valid.\n */\nclass InvalidValueError extends Error {\n  /**\n   * @param {string} message\n   */\n  constructor (message) {\n    super(message)\n    this.name = 'InvalidValueError'\n    this.code = 'ERR_INVALID_VALUE'\n    this.message = message\n  }\n}\nInvalidValueError.code = 'ERR_INVALID_VALUE'\n\n/**\n * Exception raised when config is not passed.\n */\nclass MissingRepoOptionsError extends Error {\n  /**\n   * @param {string} message\n   */\n  constructor (message) {\n    super(message)\n    this.name = 'MissingRepoOptionsError'\n    this.code = 'ERR_MISSING_REPO_OPTIONS'\n    this.message = message\n  }\n}\nMissingRepoOptionsError.code = 'ERR_MISSING_REPO_OPTIONS'\n\nmodule.exports = {\n  NonReversibleMigrationError,\n  NotInitializedRepoError,\n  RequiredParameterError,\n  InvalidValueError,\n  MissingRepoOptionsError\n}\n","'use strict'\n\nconst debug = require('debug')\nconst log = debug('ipfs:repo:migrator:repo_mem_lock')\nconst lockFile = 'repo.lock'\n\n/**\n * @type {Record<string, boolean>}\n */\nconst LOCKS = {}\n\n/**\n * Lock the repo in the given dir and for given repo version.\n *\n * @param {number} version\n * @param {string} dir\n */\nexports.lock = async function lock (version, dir) { // eslint-disable-line require-await\n  const file = dir + '/' + lockFile\n  log('locking %s', file)\n\n  if (LOCKS[file] === true) {\n    throw Error(`There is already present lock for: ${file}`)\n  }\n\n  LOCKS[file] = true\n  return {\n    close () {\n      if (LOCKS[file]) {\n        log('releasing lock %s', file)\n        delete LOCKS[file]\n      }\n    }\n  }\n}\n","/*!\n * bytes\n * Copyright(c) 2012-2014 TJ Holowaychuk\n * Copyright(c) 2015 Jed Watson\n * MIT Licensed\n */\n\n'use strict';\n\n/**\n * Module exports.\n * @public\n */\n\nmodule.exports = bytes;\nmodule.exports.format = format;\nmodule.exports.parse = parse;\n\n/**\n * Module variables.\n * @private\n */\n\nvar formatThousandsRegExp = /\\B(?=(\\d{3})+(?!\\d))/g;\n\nvar formatDecimalsRegExp = /(?:\\.0*|(\\.[^0]+)0+)$/;\n\nvar map = {\n  b:  1,\n  kb: 1 << 10,\n  mb: 1 << 20,\n  gb: 1 << 30,\n  tb: Math.pow(1024, 4),\n  pb: Math.pow(1024, 5),\n};\n\nvar parseRegExp = /^((-|\\+)?(\\d+(?:\\.\\d+)?)) *(kb|mb|gb|tb|pb)$/i;\n\n/**\n * Convert the given value in bytes into a string or parse to string to an integer in bytes.\n *\n * @param {string|number} value\n * @param {{\n *  case: [string],\n *  decimalPlaces: [number]\n *  fixedDecimals: [boolean]\n *  thousandsSeparator: [string]\n *  unitSeparator: [string]\n *  }} [options] bytes options.\n *\n * @returns {string|number|null}\n */\n\nfunction bytes(value, options) {\n  if (typeof value === 'string') {\n    return parse(value);\n  }\n\n  if (typeof value === 'number') {\n    return format(value, options);\n  }\n\n  return null;\n}\n\n/**\n * Format the given value in bytes into a string.\n *\n * If the value is negative, it is kept as such. If it is a float,\n * it is rounded.\n *\n * @param {number} value\n * @param {object} [options]\n * @param {number} [options.decimalPlaces=2]\n * @param {number} [options.fixedDecimals=false]\n * @param {string} [options.thousandsSeparator=]\n * @param {string} [options.unit=]\n * @param {string} [options.unitSeparator=]\n *\n * @returns {string|null}\n * @public\n */\n\nfunction format(value, options) {\n  if (!Number.isFinite(value)) {\n    return null;\n  }\n\n  var mag = Math.abs(value);\n  var thousandsSeparator = (options && options.thousandsSeparator) || '';\n  var unitSeparator = (options && options.unitSeparator) || '';\n  var decimalPlaces = (options && options.decimalPlaces !== undefined) ? options.decimalPlaces : 2;\n  var fixedDecimals = Boolean(options && options.fixedDecimals);\n  var unit = (options && options.unit) || '';\n\n  if (!unit || !map[unit.toLowerCase()]) {\n    if (mag >= map.pb) {\n      unit = 'PB';\n    } else if (mag >= map.tb) {\n      unit = 'TB';\n    } else if (mag >= map.gb) {\n      unit = 'GB';\n    } else if (mag >= map.mb) {\n      unit = 'MB';\n    } else if (mag >= map.kb) {\n      unit = 'KB';\n    } else {\n      unit = 'B';\n    }\n  }\n\n  var val = value / map[unit.toLowerCase()];\n  var str = val.toFixed(decimalPlaces);\n\n  if (!fixedDecimals) {\n    str = str.replace(formatDecimalsRegExp, '$1');\n  }\n\n  if (thousandsSeparator) {\n    str = str.replace(formatThousandsRegExp, thousandsSeparator);\n  }\n\n  return str + unitSeparator + unit;\n}\n\n/**\n * Parse the string value into an integer in bytes.\n *\n * If no unit is given, it is assumed the value is in bytes.\n *\n * @param {number|string} val\n *\n * @returns {number|null}\n * @public\n */\n\nfunction parse(val) {\n  if (typeof val === 'number' && !isNaN(val)) {\n    return val;\n  }\n\n  if (typeof val !== 'string') {\n    return null;\n  }\n\n  // Test if the string passed is valid\n  var results = parseRegExp.exec(val);\n  var floatValue;\n  var unit = 'b';\n\n  if (!results) {\n    // Nothing could be extracted from the given string\n    floatValue = parseInt(val, 10);\n    unit = 'b'\n  } else {\n    // Retrieve the value and the unit\n    floatValue = parseFloat(results[1]);\n    unit = results[4].toLowerCase();\n  }\n\n  return Math.floor(map[unit] * floatValue);\n}\n","'use strict'\n\n/**\n * @param {string[]} args\n */\nfunction join (...args) {\n  if (args.length === 0) {\n    return '.'\n  }\n\n  return args.join('/')\n}\n\nmodule.exports = join\n","'use strict'\n\nmodule.exports = {\n  repoVersion: 10\n}\n","'use strict'\n\n/**\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('./types').Backends} Backends\n * @typedef {Required<import('./types').Options>} Options\n */\n\n/**\n *\n * @param {Backends} name\n * @param {string} path\n * @param {Options} options\n * @returns {Datastore}\n */\nfunction createBackend (name, path, options) {\n  const Ctor = options.storageBackends[name]\n  const backendOptions = Object.assign({}, options.storageBackendOptions[name] || {})\n  // @ts-ignore we don't have a signature for the constructor\n  return new Ctor(path, backendOptions)\n}\n\nmodule.exports = {\n  create: createBackend\n}\n","'use strict'\n\nconst Key = require('interface-datastore').Key\nconst debug = require('debug')\nconst log = debug('ipfs:repo:version')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst {\n  hasWithFallback,\n  getWithFallback\n// @ts-ignore\n} = require('ipfs-repo-migrations/src/utils')\n\nconst versionKey = new Key('version')\n\n/**\n *\n * @param {import('interface-datastore').Datastore} store\n */\nmodule.exports = (store) => {\n  return {\n    /**\n     * Check if a version file exists.\n     *\n     */\n    async exists () { // eslint-disable-line require-await\n      // level-js@5.x cannot read keys from level-js@4.x dbs so fall back to\n      // using IndexedDB API with string keys - only necessary until we do\n      // the migratiion to v10 or above\n      return hasWithFallback(versionKey, store.has.bind(store), store)\n    },\n    /**\n     * Get the current version.\n     *\n     * @returns {Promise<number>}\n     */\n    async get () {\n      // level-js@5.x cannot read keys from level-js@4.x dbs so fall back to\n      // using IndexedDB API with string keys - only necessary until we do\n      // the migratiion to v10 or above\n      const buf = await getWithFallback(versionKey, store.get.bind(store), store.has.bind(store), store)\n      return parseInt(uint8ArrayToString(buf), 10)\n    },\n    /**\n     * Set the version of the repo, writing it to the underlying store.\n     *\n     * @param {number} version\n     * @returns {Promise<void>}\n     */\n    set (version) {\n      return store.put(versionKey, uint8ArrayFromString(String(version)))\n    },\n    /**\n     * Check the current version, and returns true if versions matches\n     *\n     * @param {number} expected\n     */\n    async check (expected) {\n      const version = await this.get()\n      log('comparing version: %s and %s', version, expected)\n      // Version 6 and 7 are the same\n      // TODO: Clean up the compatibility logic. Repo feature detection would be ideal, or a better version schema\n      const compatibleVersion = (version === 6 && expected === 7) || (expected === 6 && version === 7)\n\n      return version === expected || compatibleVersion\n    }\n  }\n}\n","'use strict'\n\nconst { Key } = require('interface-datastore')\nconst { default: Queue } = require('p-queue')\nconst _get = require('just-safe-get')\nconst _set = require('just-safe-set')\nconst errcode = require('err-code')\nconst errors = require('./errors')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst {\n  hasWithFallback,\n  getWithFallback\n// @ts-ignore\n} = require('ipfs-repo-migrations/src/utils')\n\nconst configKey = new Key('config')\n\n/**\n * @typedef {import('./types').Config} Config\n */\n\n/**\n * @param {import('interface-datastore').Datastore} store\n */\nmodule.exports = (store) => {\n  const setQueue = new Queue({ concurrency: 1 })\n\n  const configStore = {\n    /**\n     * Get the current configuration from the repo.\n     *\n     * @param {Object} [options] - options\n     * @param {AbortSignal} [options.signal] - abort this config read\n     * @returns {Promise<Config>}\n     */\n    async getAll (options = {}) { // eslint-disable-line require-await\n      // level-js@5.x cannot read keys from level-js@4.x dbs so fall back to\n      // using IndexedDB API with string keys - only necessary until we do\n      // the migratiion to v10 or above\n      const encodedValue = await getWithFallback(configKey, store.get.bind(store), store.has.bind(store), store, {\n        signal: options.signal\n      })\n\n      return JSON.parse(uint8ArrayToString(encodedValue))\n    },\n\n    /**\n     * Get the value for the passed configuration key from the repo.\n     *\n     * @param {string} key - the config key to get\n     * @param {Object} [options] - options\n     * @param {AbortSignal} [options.signal] - abort this config read\n     */\n    async get (key, options = {}) {\n      if (key == null) {\n        throw new errors.NotFoundError(`Key ${key} does not exist in config`)\n      }\n\n      const config = await this.getAll(options)\n      const value = _get(config, key)\n\n      if (value === undefined) {\n        throw new errors.NotFoundError(`Key ${key} does not exist in config`)\n      }\n\n      return value\n    },\n\n    /**\n     * Set the current configuration for this repo.\n     *\n     * @param {string} key - the config key to be written\n     * @param {any} [value] - the config value to be written\n     * @param {Object} [options] - options\n     * @param {AbortSignal} [options.signal] - abort this config write\n     */\n    set (key, value, options = {}) {\n      // @ts-ignore ts thinks key will only be a string, but it may not be\n      if (typeof key !== 'string' && !(key instanceof String)) {\n        throw errcode(new Error('Invalid key type: ' + typeof key), 'ERR_INVALID_KEY')\n      }\n\n      if (value === undefined || (value instanceof Uint8Array)) {\n        throw errcode(new Error('Invalid value type: ' + typeof value), 'ERR_INVALID_VALUE')\n      }\n\n      return setQueue.add(() => _maybeDoSet({\n        key: key,\n        value: value\n      }, options.signal))\n    },\n\n    /**\n     * Set the current configuration for this repo.\n     *\n     * @param {Config} [value] - the config value to be written\n     * @param {Object} [options] - options\n     * @param {AbortSignal} [options.signal] - abort this config write\n     */\n    replace (value, options = {}) {\n      if (!value || (value instanceof Uint8Array)) {\n        throw errcode(new Error('Invalid value type: ' + typeof value), 'ERR_INVALID_VALUE')\n      }\n\n      return setQueue.add(() => _maybeDoSet({\n        key: undefined,\n        value: value\n      }, options.signal))\n    },\n\n    /**\n     * Check if a config file exists.\n     *\n     */\n    async exists () { // eslint-disable-line require-await\n      // level-js@5.x cannot read keys from level-js@4.x dbs so fall back to\n      // using IndexedDB API with string keys - only necessary until we do\n      // the migratiion to v10 or above\n      return hasWithFallback(configKey, store.has.bind(store), store)\n    }\n  }\n\n  return configStore\n\n  /**\n   * @param {{ key: any; value: any; }} m\n   * @param {AbortSignal | undefined} signal\n   */\n  async function _maybeDoSet (m, signal) {\n    if (signal && signal.aborted) {\n      return\n    }\n\n    const key = m.key\n    const value = m.value\n    if (key) {\n      const config = await configStore.getAll()\n      if (typeof config === 'object' && config !== null) {\n        _set(config, key, value)\n      }\n      return _saveAll(config)\n    }\n    return _saveAll(value)\n  }\n\n  /**\n   * @param {unknown} config\n   */\n  function _saveAll (config) {\n    const buf = uint8ArrayFromString(JSON.stringify(config, null, 2))\n    return store.put(configKey, buf)\n  }\n}\n","'use strict'\n\n/**\n * Error raised when there is lock already in place when repo is being opened.\n */\nclass LockExistsError extends Error {\n  /**\n   * @param {string} [message]\n   */\n  constructor (message) {\n    super(message)\n    this.name = 'LockExistsError'\n    this.code = LockExistsError.code\n  }\n}\n\nLockExistsError.code = 'ERR_LOCK_EXISTS'\nexports.LockExistsError = LockExistsError\n\n/**\n * Error raised when requested item is not found.\n */\nclass NotFoundError extends Error {\n  /**\n   * @param {string} [message]\n   */\n  constructor (message) {\n    super(message)\n    this.name = 'NotFoundError'\n    this.code = NotFoundError.code\n  }\n}\n\nNotFoundError.code = 'ERR_NOT_FOUND'\nexports.NotFoundError = NotFoundError\n\n/**\n * Error raised when version of the stored repo is not compatible with version of this package.\n */\nclass InvalidRepoVersionError extends Error {\n  /**\n   * @param {string} [message]\n   */\n  constructor (message) {\n    super(message)\n    this.name = 'InvalidRepoVersionError'\n    this.code = InvalidRepoVersionError.code\n  }\n}\n\nInvalidRepoVersionError.code = 'ERR_INVALID_REPO_VERSION'\nexports.InvalidRepoVersionError = InvalidRepoVersionError\n\nexports.ERR_REPO_NOT_INITIALIZED = 'ERR_REPO_NOT_INITIALIZED'\nexports.ERR_REPO_ALREADY_OPEN = 'ERR_REPO_ALREADY_OPEN'\nexports.ERR_REPO_ALREADY_CLOSED = 'ERR_REPO_ALREADY_CLOSED'\n","'use strict'\n\nconst Key = require('interface-datastore').Key\nconst sortKeys = require('sort-keys')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\nconst specKey = new Key('datastore_spec')\n\n/**\n *\n * @param {import('interface-datastore').Datastore} store\n */\nmodule.exports = (store) => {\n  return {\n    /**\n     * Check if a datastore spec file exists.\n     *\n     */\n    exists () {\n      return store.has(specKey)\n    },\n    /**\n     * Get the current datastore spec.\n     *\n     * @returns {Promise<Uint8Array>}\n     */\n    async get () {\n      const buf = await store.get(specKey)\n      return JSON.parse(uint8ArrayToString(buf))\n    },\n    /**\n     * Set the datastore spec of the repo, writing it to the underlying store.\n     * TODO unclear on what the type should be or if it's required\n     *\n     * @param {any} spec\n     * @returns {Promise<void>}\n     */\n    async set (spec) {\n      return store.put(specKey, uint8ArrayFromString(JSON.stringify(sortKeys(spec, { deep: true }))))\n    }\n  }\n}\n","'use strict';\nconst isPlainObject = require('is-plain-obj');\n\nmodule.exports = (object, options = {}) => {\n\tif (!isPlainObject(object) && !Array.isArray(object)) {\n\t\tthrow new TypeError('Expected a plain object or array');\n\t}\n\n\tconst {deep} = options;\n\tconst seenInput = [];\n\tconst seenOutput = [];\n\n\tconst deepSortArray = array => {\n\t\tconst seenIndex = seenInput.indexOf(array);\n\n\t\tif (seenIndex !== -1) {\n\t\t\treturn seenOutput[seenIndex];\n\t\t}\n\n\t\tconst result = [];\n\t\tseenInput.push(array);\n\t\tseenOutput.push(result);\n\n\t\tresult.push(...array.map(item => {\n\t\t\tif (Array.isArray(item)) {\n\t\t\t\treturn deepSortArray(item);\n\t\t\t}\n\n\t\t\tif (isPlainObject(item)) {\n\t\t\t\treturn sortKeys(item);\n\t\t\t}\n\n\t\t\treturn item;\n\t\t}));\n\n\t\treturn result;\n\t};\n\n\tconst sortKeys = object => {\n\t\tconst seenIndex = seenInput.indexOf(object);\n\n\t\tif (seenIndex !== -1) {\n\t\t\treturn seenOutput[seenIndex];\n\t\t}\n\n\t\tconst result = {};\n\t\tconst keys = Object.keys(object).sort(options.compare);\n\n\t\tseenInput.push(object);\n\t\tseenOutput.push(result);\n\n\t\tfor (const key of keys) {\n\t\t\tconst value = object[key];\n\t\t\tlet newValue;\n\n\t\t\tif (deep && Array.isArray(value)) {\n\t\t\t\tnewValue = deepSortArray(value);\n\t\t\t} else {\n\t\t\t\tnewValue = deep && isPlainObject(value) ? sortKeys(value) : value;\n\t\t\t}\n\n\t\t\tObject.defineProperty(result, key, {\n\t\t\t\t...Object.getOwnPropertyDescriptor(object, key),\n\t\t\t\tvalue: newValue\n\t\t\t});\n\t\t}\n\n\t\treturn result;\n\t};\n\n\tif (Array.isArray(object)) {\n\t\treturn deep ? deepSortArray(object) : object.slice();\n\t}\n\n\treturn sortKeys(object);\n};\n","'use strict'\n\nconst Key = require('interface-datastore').Key\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\nconst apiFile = new Key('api')\n\n/**\n *\n * @param {import('interface-datastore').Datastore} store\n */\nmodule.exports = (store) => {\n  return {\n    /**\n     * Get the current configuration from the repo.\n     *\n     * @returns {Promise<string>}\n     */\n    async get () {\n      const value = await store.get(apiFile)\n      return value && value.toString()\n    },\n    /**\n     * Set the current configuration for this repo.\n     * TODO: fix find the proper type or remove this API\n     *\n     * @param {string} value - the api address to be written\n     */\n    set (value) {\n      return store.put(apiFile, uint8ArrayFromString(value.toString()))\n    },\n    /**\n     * Deletes api file\n     */\n    delete () {\n      return store.delete(apiFile)\n    }\n  }\n}\n","'use strict'\n\nconst { shard, ShardingDatastore } = require('datastore-core')\nconst Block = require('ipld-block')\nconst { cidToKey, keyToCid } = require('./blockstore-utils')\nconst map = require('it-map')\nconst drain = require('it-drain')\nconst pushable = require('it-pushable')\n/**\n * @typedef {import('interface-datastore').Query} Query\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('interface-datastore').Options} DatastoreOptions\n * @typedef {import('cids')} CID\n * @typedef {import('./types').Blockstore} Blockstore\n */\n\n/**\n *\n * @param {Datastore} filestore\n * @param {*} options\n */\nmodule.exports = (filestore, options) => {\n  const store = maybeWithSharding(filestore, options)\n  return createBaseStore(store)\n}\n\n/**\n * @param {Datastore} filestore\n * @param {{ sharding: any; }} options\n */\nfunction maybeWithSharding (filestore, options) {\n  if (options.sharding) {\n    return new ShardingDatastore(filestore, new shard.NextToLast(2))\n  }\n  return filestore\n}\n\n/**\n * @param {Datastore | ShardingDatastore} store\n * @returns {Blockstore}\n */\nfunction createBaseStore (store) {\n  return {\n    open () {\n      return store.open()\n    },\n\n    async * query (query, options) {\n      for await (const { key, value } of store.query(query, options)) {\n        yield new Block(value, keyToCid(key))\n      }\n    },\n\n    async * queryKeys (query, options) {\n      for await (const key of store.queryKeys(query, options)) {\n        yield keyToCid(key)\n      }\n    },\n\n    async get (cid, options) {\n      const key = cidToKey(cid)\n      const blockData = await store.get(key, options)\n\n      return new Block(blockData, cid)\n    },\n\n    async * getMany (cids, options) {\n      for await (const cid of cids) {\n        yield this.get(cid, options)\n      }\n    },\n\n    async put (block, options) {\n      if (!Block.isBlock(block)) {\n        throw new Error('invalid block')\n      }\n\n      const key = cidToKey(block.cid)\n      const exists = await store.has(key, options)\n\n      if (!exists) {\n        await store.put(key, block.data, options)\n      }\n\n      return block\n    },\n\n    async * putMany (blocks, options) { // eslint-disable-line require-await\n      // we cannot simply chain to `store.putMany` because we convert a CID into\n      // a key based on the multihash only, so we lose the version & codec and\n      // cannot give the user back the CID they used to create the block, so yield\n      // to `store.putMany` but return the actual block the user passed in.\n      //\n      // nb. we want to use `store.putMany` here so bitswap can control batching\n      // up block HAVEs to send to the network - if we use multiple `store.put`s\n      // it will not be able to guess we are about to `store.put` more blocks\n      const output = pushable()\n\n      // process.nextTick runs on the microtask queue, setImmediate runs on the next\n      // event loop iteration so is slower. Use process.nextTick if it is available.\n      const runner = process && process.nextTick ? process.nextTick : setImmediate\n\n      runner(async () => {\n        try {\n          await drain(store.putMany(async function * () {\n            for await (const block of blocks) {\n              const key = cidToKey(block.cid)\n              const exists = await store.has(key, options)\n\n              if (!exists) {\n                yield { key, value: block.data }\n              }\n\n              // there is an assumption here that after the yield has completed\n              // the underlying datastore has finished writing the block\n              output.push(block)\n            }\n          }()))\n\n          output.end()\n        } catch (err) {\n          output.end(err)\n        }\n      })\n\n      yield * output\n    },\n\n    has (cid, options) {\n      return store.has(cidToKey(cid), options)\n    },\n\n    delete (cid, options) {\n      return store.delete(cidToKey(cid), options)\n    },\n\n    deleteMany (cids, options) {\n      return store.deleteMany(map(cids, cid => cidToKey(cid)), options)\n    },\n\n    close () {\n      return store.close()\n    }\n  }\n}\n","'use strict'\n\nconst { Key } = require('interface-datastore')\nconst CID = require('cids')\nconst multibase = require('multibase')\nconst errcode = require('err-code')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\n/**\n * Transform a cid to the appropriate datastore key.\n *\n * @param {CID} cid\n * @returns {Key}\n */\nexports.cidToKey = cid => {\n  if (!CID.isCID(cid)) {\n    throw errcode(new Error('Not a valid cid'), 'ERR_INVALID_CID')\n  }\n\n  return new Key('/' + uint8ArrayToString(multibase.encode('base32', cid.multihash)).slice(1).toUpperCase(), false)\n}\n\n/**\n * Transform a datastore Key instance to a CID\n * As Key is a multihash of the CID, it is reconstructed using IPLD's RAW codec.\n * Hence it is highly probable that stored CID will differ from a CID retrieved from blockstore.\n *\n * @param {Key} key\n * @returns {CID}\n */\nexports.keyToCid = key => {\n  // Block key is of the form /<base32 encoded string>\n  return new CID(1, 'raw', multibase.decode('b' + key.toString().slice(1).toLowerCase()))\n}\n","'use strict'\n\nconst Block = require('ipld-block')\nconst filter = require('it-filter')\nconst mh = require('multihashes')\nconst pushable = require('it-pushable')\nconst drain = require('it-drain')\nconst CID = require('cids')\nconst errcode = require('err-code')\n\n/**\n * @typedef {import('interface-datastore').Query} Query\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('interface-datastore').Options} DatastoreOptions\n * @typedef {import('./types').Blockstore} Blockstore\n */\n\n/**\n *\n * @param {Blockstore} blockstore\n */\nmodule.exports = createIdStore\n\n/**\n * @param {Blockstore} store\n * @returns {Blockstore}\n */\nfunction createIdStore (store) {\n  return {\n    open () {\n      return store.open()\n    },\n\n    query (query, options) {\n      return store.query(query, options)\n    },\n\n    queryKeys (query, options) {\n      return store.queryKeys(query, options)\n    },\n\n    async get (cid, options) {\n      const extracted = extractContents(cid)\n      if (extracted.isIdentity) {\n        return Promise.resolve(new Block(extracted.digest, cid))\n      }\n      return store.get(cid, options)\n    },\n\n    async * getMany (cids, options) {\n      for await (const cid of cids) {\n        yield this.get(cid, options)\n      }\n    },\n\n    async put (block, options) {\n      const { isIdentity } = extractContents(block.cid)\n      if (isIdentity) {\n        return Promise.resolve(block)\n      }\n      return store.put(block, options)\n    },\n\n    async * putMany (blocks, options) {\n      // in order to return all blocks. we're going to assemble a seperate iterable\n      // return rather than return the resolves of store.putMany using the same\n      // process used by blockstore.putMany\n      const output = pushable()\n\n      // process.nextTick runs on the microtask queue, setImmediate runs on the next\n      // event loop iteration so is slower. Use process.nextTick if it is available.\n      const runner = process && process.nextTick ? process.nextTick : setImmediate\n\n      runner(async () => {\n        try {\n          await drain(store.putMany(async function * () {\n            for await (const block of blocks) {\n              if (!extractContents(block.cid).isIdentity) {\n                yield block\n              }\n              // if non identity blocks successfully write, blocks are included in output\n              output.push(block)\n            }\n          }()))\n\n          output.end()\n        } catch (err) {\n          output.end(err)\n        }\n      })\n\n      yield * output\n    },\n\n    has (cid, options) {\n      const { isIdentity } = extractContents(cid)\n      if (isIdentity) {\n        return Promise.resolve(true)\n      }\n      return store.has(cid, options)\n    },\n\n    delete (cid, options) {\n      const { isIdentity } = extractContents(cid)\n      if (isIdentity) {\n        return Promise.resolve()\n      }\n      return store.delete(cid, options)\n    },\n\n    deleteMany (cids, options) {\n      return store.deleteMany(filter(cids, (cid) => !extractContents(cid).isIdentity), options)\n    },\n\n    close () {\n      return store.close()\n    }\n  }\n}\n\n/**\n * @param {CID} k\n * @returns {{ isIdentity: false } | { isIdentity: true, digest: Uint8Array}}\n */\nfunction extractContents (k) {\n  if (!CID.isCID(k)) {\n    throw errcode(new Error('Not a valid cid'), 'ERR_INVALID_CID')\n  }\n\n  // Pre-check by calling Prefix(), this much faster than extracting the hash.\n  const decoded = mh.decode(k.multihash)\n\n  if (decoded.name !== 'identity') {\n    return {\n      isIdentity: false\n    }\n  }\n\n  return {\n    isIdentity: true,\n    digest: decoded.digest\n  }\n}\n","'use strict'\n\n// Default configuration for a repo in the browser\nmodule.exports = {\n  autoMigrate: true,\n  onMigrationProgress: () => {},\n  lock: 'memory',\n  storageBackends: {\n    root: require('datastore-level'),\n    blocks: require('datastore-level'),\n    keys: require('datastore-level'),\n    datastore: require('datastore-level'),\n    pins: require('datastore-level')\n  },\n  storageBackendOptions: {\n    root: {\n      extension: '',\n      prefix: '',\n      version: 2\n    },\n    blocks: {\n      sharding: false,\n      prefix: '',\n      version: 2\n    },\n    keys: {\n      sharding: false,\n      prefix: '',\n      version: 2\n    },\n    datastore: {\n      sharding: false,\n      prefix: '',\n      version: 2\n    },\n    pins: {\n      sharding: false,\n      prefix: '',\n      version: 2\n    }\n  }\n}\n","'use strict'\n\nconst {\n  Key, Errors, Adapter,\n  utils: {\n    sortAll\n  }\n} = require('interface-datastore')\nconst filter = require('it-filter')\nconst map = require('it-map')\nconst take = require('it-take')\n\n/**\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('interface-datastore').Pair} Pair\n * @typedef {import('interface-datastore').Batch} Batch\n * @typedef {import('interface-datastore').Query} Query\n * @typedef {import('interface-datastore').KeyQuery} KeyQuery\n * @typedef {import('interface-datastore').Options} QueryOptions\n */\n\n/**\n * A datastore backed by leveldb.\n *\n * @implements {Datastore}\n */\nclass LevelDatastore extends Adapter {\n  /**\n   * @param {any} path\n   * @param {Object} [opts]\n   * @param {any} [opts.db] - level db reference\n   * @param {boolean} [opts.createIfMissing]\n   * @param {boolean} [opts.errorIfExists]\n   */\n  constructor (path, opts) {\n    super()\n    this.path = path\n    this.opts = opts\n\n    if (opts && opts.db) {\n      this.database = opts.db\n      delete opts.db\n    } else {\n      // @ts-ignore\n      this.database = require('level')\n    }\n  }\n\n  _initDb () {\n    return new Promise((resolve, reject) => {\n      this.db = this.database(\n        this.path,\n        {\n          ...this.opts,\n          valueEncoding: 'binary',\n          compression: false // same default as go\n        },\n        /** @param {Error}  [err] */\n        (err) => {\n          if (err) {\n            return reject(err)\n          }\n          resolve(this.db)\n        }\n      )\n    })\n  }\n\n  async open () {\n    try {\n      if (this.db) {\n        await this.db.open()\n      } else {\n        this.db = await this._initDb()\n      }\n    } catch (err) {\n      throw Errors.dbOpenFailedError(err)\n    }\n  }\n\n  /**\n   * @param {Key} key\n   * @param {Uint8Array} value\n   */\n  async put (key, value) {\n    try {\n      await this.db.put(key.toString(), value)\n    } catch (err) {\n      throw Errors.dbWriteFailedError(err)\n    }\n  }\n\n  /**\n   * @param {Key} key\n   * @returns {Promise<Uint8Array>}\n   */\n  async get (key) {\n    let data\n    try {\n      data = await this.db.get(key.toString())\n    } catch (err) {\n      if (err.notFound) throw Errors.notFoundError(err)\n      throw Errors.dbWriteFailedError(err)\n    }\n    return data\n  }\n\n  /**\n   * @param {Key} key\n   * @returns {Promise<boolean>}\n   */\n  async has (key) {\n    try {\n      await this.db.get(key.toString())\n    } catch (err) {\n      if (err.notFound) return false\n      throw err\n    }\n    return true\n  }\n\n  /**\n   * @param {Key} key\n   * @returns {Promise<void>}\n   */\n  async delete (key) {\n    try {\n      await this.db.del(key.toString())\n    } catch (err) {\n      throw Errors.dbDeleteFailedError(err)\n    }\n  }\n\n  close () {\n    return this.db && this.db.close()\n  }\n\n  /**\n   * @returns {Batch}\n   */\n  batch () {\n    /** @type {{ type: string; key: string; value?: Uint8Array; }[]} */\n    const ops = []\n    return {\n      put: (key, value) => {\n        ops.push({\n          type: 'put',\n          key: key.toString(),\n          value: value\n        })\n      },\n      delete: (key) => {\n        ops.push({\n          type: 'del',\n          key: key.toString()\n        })\n      },\n      commit: () => {\n        return this.db.batch(ops)\n      }\n    }\n  }\n\n  /**\n   * @param {Query} q\n   */\n  query (q) {\n    let it = this._query({\n      values: true,\n      prefix: q.prefix\n    })\n\n    if (Array.isArray(q.filters)) {\n      it = q.filters.reduce((it, f) => filter(it, f), it)\n    }\n\n    if (Array.isArray(q.orders)) {\n      it = q.orders.reduce((it, f) => sortAll(it, f), it)\n    }\n\n    const { offset, limit } = q\n    if (offset) {\n      let i = 0\n      it = filter(it, () => i++ >= offset)\n    }\n\n    if (limit) {\n      it = take(it, limit)\n    }\n\n    return it\n  }\n\n  /**\n   * @param {KeyQuery} q\n   */\n  queryKeys (q) {\n    let it = map(this._query({\n      values: false,\n      prefix: q.prefix\n    }), ({ key }) => key)\n\n    if (Array.isArray(q.filters)) {\n      it = q.filters.reduce((it, f) => filter(it, f), it)\n    }\n\n    if (Array.isArray(q.orders)) {\n      it = q.orders.reduce((it, f) => sortAll(it, f), it)\n    }\n\n    const { offset, limit } = q\n    if (offset) {\n      let i = 0\n      it = filter(it, () => i++ >= offset)\n    }\n\n    if (limit) {\n      it = take(it, limit)\n    }\n\n    return it\n  }\n\n  /**\n   * @param {object} opts\n   * @param {boolean} opts.values\n   * @param {string} [opts.prefix]\n   * @returns {AsyncIterable<Pair>}\n   */\n  _query (opts) {\n    const iteratorOpts = {\n      keys: true,\n      keyAsBuffer: true,\n      values: opts.values\n    }\n\n    // Let the db do the prefix matching\n    if (opts.prefix != null) {\n      const prefix = opts.prefix.toString()\n      // Match keys greater than or equal to `prefix` and\n      // @ts-ignore\n      iteratorOpts.gte = prefix\n      // less than `prefix` + \\xFF (hex escape sequence)\n      // @ts-ignore\n      iteratorOpts.lt = prefix + '\\xFF'\n    }\n\n    return levelIteratorToIterator(this.db.iterator(iteratorOpts))\n  }\n}\n\n/**\n * @typedef {Object} LevelIterator\n * @property {(cb: (err: Error, key: string | Uint8Array | null, value: any)=> void)=>void} next\n * @property {(cb: (err: Error) => void) => void } end\n */\n\n/**\n * @param {LevelIterator} li - Level iterator\n * @returns {AsyncIterable<Pair>}\n */\nfunction levelIteratorToIterator (li) {\n  return {\n    [Symbol.asyncIterator] () {\n      return {\n        next: () => new Promise((resolve, reject) => {\n          li.next((err, key, value) => {\n            if (err) return reject(err)\n            if (key == null) {\n              return li.end(err => {\n                if (err) return reject(err)\n                resolve({ done: true, value: undefined })\n              })\n            }\n            resolve({ done: false, value: { key: new Key(key, false), value } })\n          })\n        }),\n        return: () => new Promise((resolve, reject) => {\n          li.end(err => {\n            if (err) return reject(err)\n            resolve({ done: true, value: undefined })\n          })\n        })\n      }\n    }\n  }\n}\n\nmodule.exports = LevelDatastore\n","module.exports = require('level-packager')(require('level-js'))\n","'use strict'\n\nconst levelup = require('levelup')\nconst encode = require('encoding-down')\n\nfunction packager (leveldown) {\n  function Level (location, options, callback) {\n    if (typeof location === 'function') {\n      callback = location\n    } else if (typeof options === 'function') {\n      callback = options\n    }\n\n    if (!isObject(options)) {\n      options = isObject(location) ? location : {}\n    }\n\n    return levelup(encode(leveldown(location, options), options), options, callback)\n  }\n\n  function isObject (o) {\n    return typeof o === 'object' && o !== null\n  }\n\n  for (const m of ['destroy', 'repair']) {\n    if (typeof leveldown[m] === 'function') {\n      Level[m] = function (...args) {\n        leveldown[m](...args)\n      }\n    }\n  }\n\n  Level.errors = levelup.errors\n\n  return Level\n}\n\nmodule.exports = packager\n","'use strict'\n\nconst EventEmitter = require('events').EventEmitter\nconst inherits = require('util').inherits\nconst DeferredLevelDOWN = require('deferred-leveldown')\nconst IteratorStream = require('level-iterator-stream')\nconst Batch = require('./batch')\nconst errors = require('level-errors')\nconst supports = require('level-supports')\nconst catering = require('catering')\nconst getCallback = require('./common').getCallback\nconst getOptions = require('./common').getOptions\n\n// TODO: after we drop node 10, also use queueMicrotask() in node\nconst nextTick = require('./next-tick')\n\nconst WriteError = errors.WriteError\nconst ReadError = errors.ReadError\nconst NotFoundError = errors.NotFoundError\nconst OpenError = errors.OpenError\nconst InitializationError = errors.InitializationError\n\n// Possible AbstractLevelDOWN#status values:\n//  - 'new'     - newly created, not opened or closed\n//  - 'opening' - waiting for the database to be opened, post open()\n//  - 'open'    - successfully opened the database, available for use\n//  - 'closing' - waiting for the database to be closed, post close()\n//  - 'closed'  - database has been successfully closed, should not be\n//                 used except for another open() operation\n\nfunction LevelUP (db, options, callback) {\n  if (!(this instanceof LevelUP)) {\n    return new LevelUP(db, options, callback)\n  }\n\n  let error\n\n  EventEmitter.call(this)\n  this.setMaxListeners(Infinity)\n\n  if (typeof options === 'function') {\n    callback = options\n    options = {}\n  }\n\n  options = options || {}\n\n  if (!db || typeof db !== 'object') {\n    error = new InitializationError('First argument must be an abstract-leveldown compliant store')\n    if (typeof callback === 'function') {\n      return nextTick(callback, error)\n    }\n    throw error\n  }\n\n  if (typeof db.status !== 'string') {\n    throw new Error('.status required, old abstract-leveldown')\n  }\n\n  this.options = getOptions(options)\n  this._db = db\n  this.db = new DeferredLevelDOWN(db)\n  this.open(callback || ((err) => {\n    if (err) this.emit('error', err)\n  }))\n\n  // Create manifest based on deferred-leveldown's\n  this.supports = supports(this.db.supports, {\n    status: false,\n    deferredOpen: true,\n    openCallback: true,\n    promises: true,\n    streams: true\n  })\n\n  // Experimental: enrich levelup interface\n  for (const method of Object.keys(this.supports.additionalMethods)) {\n    if (this[method] != null) continue\n\n    // Don't do this.db[method].bind() because this.db is dynamic.\n    this[method] = function (...args) {\n      return this.db[method](...args)\n    }\n  }\n}\n\nLevelUP.prototype.emit = EventEmitter.prototype.emit\nLevelUP.prototype.once = EventEmitter.prototype.once\ninherits(LevelUP, EventEmitter)\n\nLevelUP.prototype.open = function (opts, callback) {\n  if (typeof opts === 'function') {\n    callback = opts\n    opts = null\n  }\n\n  callback = catering.fromCallback(callback)\n\n  if (!opts) {\n    opts = this.options\n  }\n\n  if (this.isOpen()) {\n    nextTick(callback, null, this)\n    return callback.promise\n  }\n\n  if (this._isOpening()) {\n    this.once('open', () => { callback(null, this) })\n    return callback.promise\n  }\n\n  this.emit('opening')\n\n  this.db.open(opts, (err) => {\n    if (err) {\n      return callback(new OpenError(err))\n    }\n    this.db = this._db\n    callback(null, this)\n    this.emit('open')\n    this.emit('ready')\n  })\n\n  return callback.promise\n}\n\nLevelUP.prototype.close = function (callback) {\n  callback = catering.fromCallback(callback)\n\n  if (this.isOpen()) {\n    this.db.close((err, ...rest) => {\n      this.emit('closed')\n      callback(err, ...rest)\n    })\n    this.emit('closing')\n    this.db = new DeferredLevelDOWN(this._db)\n  } else if (this.isClosed()) {\n    nextTick(callback)\n  } else if (this.db.status === 'closing') {\n    this.once('closed', callback)\n  } else if (this._isOpening()) {\n    this.once('open', () => {\n      this.close(callback)\n    })\n  }\n\n  return callback.promise\n}\n\nLevelUP.prototype.isOpen = function () {\n  return this.db.status === 'open'\n}\n\nLevelUP.prototype._isOpening = function () {\n  return this.db.status === 'opening'\n}\n\nLevelUP.prototype.isClosed = function () {\n  return (/^clos|new/).test(this.db.status)\n}\n\nLevelUP.prototype.get = function (key, options, callback) {\n  callback = getCallback(options, callback)\n  callback = catering.fromCallback(callback)\n\n  if (maybeError(this, callback)) {\n    return callback.promise\n  }\n\n  options = getOptions(options)\n\n  this.db.get(key, options, function (err, value) {\n    if (err) {\n      if ((/notfound/i).test(err) || err.notFound) {\n        err = new NotFoundError('Key not found in database [' + key + ']', err)\n      } else {\n        err = new ReadError(err)\n      }\n      return callback(err)\n    }\n    callback(null, value)\n  })\n\n  return callback.promise\n}\n\nLevelUP.prototype.put = function (key, value, options, callback) {\n  callback = getCallback(options, callback)\n  callback = catering.fromCallback(callback)\n\n  if (maybeError(this, callback)) {\n    return callback.promise\n  }\n\n  options = getOptions(options)\n\n  this.db.put(key, value, options, (err) => {\n    if (err) {\n      return callback(new WriteError(err))\n    }\n    this.emit('put', key, value)\n    callback()\n  })\n\n  return callback.promise\n}\n\nLevelUP.prototype.del = function (key, options, callback) {\n  callback = getCallback(options, callback)\n  callback = catering.fromCallback(callback)\n\n  if (maybeError(this, callback)) {\n    return callback.promise\n  }\n\n  options = getOptions(options)\n\n  this.db.del(key, options, (err) => {\n    if (err) {\n      return callback(new WriteError(err))\n    }\n    this.emit('del', key)\n    callback()\n  })\n\n  return callback.promise\n}\n\nLevelUP.prototype.batch = function (arr, options, callback) {\n  if (!arguments.length) {\n    return new Batch(this)\n  }\n\n  if (typeof arr === 'function') callback = arr\n  else callback = getCallback(options, callback)\n\n  callback = catering.fromCallback(callback)\n\n  if (maybeError(this, callback)) {\n    return callback.promise\n  }\n\n  options = getOptions(options)\n\n  this.db.batch(arr, options, (err) => {\n    if (err) {\n      return callback(new WriteError(err))\n    }\n    this.emit('batch', arr)\n    callback()\n  })\n\n  return callback.promise\n}\n\nLevelUP.prototype.iterator = function (options) {\n  return this.db.iterator(options)\n}\n\nLevelUP.prototype.clear = function (options, callback) {\n  callback = getCallback(options, callback)\n  options = getOptions(options)\n  callback = catering.fromCallback(callback)\n\n  if (maybeError(this, callback)) {\n    return callback.promise\n  }\n\n  this.db.clear(options, (err) => {\n    if (err) {\n      return callback(new WriteError(err))\n    }\n    this.emit('clear', options)\n    callback()\n  })\n\n  return callback.promise\n}\n\nLevelUP.prototype.readStream =\nLevelUP.prototype.createReadStream = function (options) {\n  options = Object.assign({ keys: true, values: true }, options)\n  if (typeof options.limit !== 'number') { options.limit = -1 }\n  return new IteratorStream(this.db.iterator(options), options)\n}\n\nLevelUP.prototype.keyStream =\nLevelUP.prototype.createKeyStream = function (options) {\n  return this.createReadStream(Object.assign({}, options, { keys: true, values: false }))\n}\n\nLevelUP.prototype.valueStream =\nLevelUP.prototype.createValueStream = function (options) {\n  return this.createReadStream(Object.assign({}, options, { keys: false, values: true }))\n}\n\nLevelUP.prototype.toString = function () {\n  return 'LevelUP'\n}\n\nLevelUP.prototype.type = 'levelup'\n\nfunction maybeError (db, callback) {\n  if (!db._isOpening() && !db.isOpen()) {\n    nextTick(callback, new ReadError('Database is not open'))\n    return true\n  }\n}\n\nLevelUP.errors = errors\nmodule.exports = LevelUP\n","// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nvar getOwnPropertyDescriptors = Object.getOwnPropertyDescriptors ||\n  function getOwnPropertyDescriptors(obj) {\n    var keys = Object.keys(obj);\n    var descriptors = {};\n    for (var i = 0; i < keys.length; i++) {\n      descriptors[keys[i]] = Object.getOwnPropertyDescriptor(obj, keys[i]);\n    }\n    return descriptors;\n  };\n\nvar formatRegExp = /%[sdj%]/g;\nexports.format = function(f) {\n  if (!isString(f)) {\n    var objects = [];\n    for (var i = 0; i < arguments.length; i++) {\n      objects.push(inspect(arguments[i]));\n    }\n    return objects.join(' ');\n  }\n\n  var i = 1;\n  var args = arguments;\n  var len = args.length;\n  var str = String(f).replace(formatRegExp, function(x) {\n    if (x === '%%') return '%';\n    if (i >= len) return x;\n    switch (x) {\n      case '%s': return String(args[i++]);\n      case '%d': return Number(args[i++]);\n      case '%j':\n        try {\n          return JSON.stringify(args[i++]);\n        } catch (_) {\n          return '[Circular]';\n        }\n      default:\n        return x;\n    }\n  });\n  for (var x = args[i]; i < len; x = args[++i]) {\n    if (isNull(x) || !isObject(x)) {\n      str += ' ' + x;\n    } else {\n      str += ' ' + inspect(x);\n    }\n  }\n  return str;\n};\n\n\n// Mark that a method should not be used.\n// Returns a modified function which warns once by default.\n// If --no-deprecation is set, then it is a no-op.\nexports.deprecate = function(fn, msg) {\n  if (typeof process !== 'undefined' && process.noDeprecation === true) {\n    return fn;\n  }\n\n  // Allow for deprecating things in the process of starting up.\n  if (typeof process === 'undefined') {\n    return function() {\n      return exports.deprecate(fn, msg).apply(this, arguments);\n    };\n  }\n\n  var warned = false;\n  function deprecated() {\n    if (!warned) {\n      if (process.throwDeprecation) {\n        throw new Error(msg);\n      } else if (process.traceDeprecation) {\n        console.trace(msg);\n      } else {\n        console.error(msg);\n      }\n      warned = true;\n    }\n    return fn.apply(this, arguments);\n  }\n\n  return deprecated;\n};\n\n\nvar debugs = {};\nvar debugEnvRegex = /^$/;\n\nif (process.env.NODE_DEBUG) {\n  var debugEnv = process.env.NODE_DEBUG;\n  debugEnv = debugEnv.replace(/[|\\\\{}()[\\]^$+?.]/g, '\\\\$&')\n    .replace(/\\*/g, '.*')\n    .replace(/,/g, '$|^')\n    .toUpperCase();\n  debugEnvRegex = new RegExp('^' + debugEnv + '$', 'i');\n}\nexports.debuglog = function(set) {\n  set = set.toUpperCase();\n  if (!debugs[set]) {\n    if (debugEnvRegex.test(set)) {\n      var pid = process.pid;\n      debugs[set] = function() {\n        var msg = exports.format.apply(exports, arguments);\n        console.error('%s %d: %s', set, pid, msg);\n      };\n    } else {\n      debugs[set] = function() {};\n    }\n  }\n  return debugs[set];\n};\n\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect(obj, opts) {\n  // default options\n  var ctx = {\n    seen: [],\n    stylize: stylizeNoColor\n  };\n  // legacy...\n  if (arguments.length >= 3) ctx.depth = arguments[2];\n  if (arguments.length >= 4) ctx.colors = arguments[3];\n  if (isBoolean(opts)) {\n    // legacy...\n    ctx.showHidden = opts;\n  } else if (opts) {\n    // got an \"options\" object\n    exports._extend(ctx, opts);\n  }\n  // set default options\n  if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n  if (isUndefined(ctx.depth)) ctx.depth = 2;\n  if (isUndefined(ctx.colors)) ctx.colors = false;\n  if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n  if (ctx.colors) ctx.stylize = stylizeWithColor;\n  return formatValue(ctx, obj, ctx.depth);\n}\nexports.inspect = inspect;\n\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect.colors = {\n  'bold' : [1, 22],\n  'italic' : [3, 23],\n  'underline' : [4, 24],\n  'inverse' : [7, 27],\n  'white' : [37, 39],\n  'grey' : [90, 39],\n  'black' : [30, 39],\n  'blue' : [34, 39],\n  'cyan' : [36, 39],\n  'green' : [32, 39],\n  'magenta' : [35, 39],\n  'red' : [31, 39],\n  'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect.styles = {\n  'special': 'cyan',\n  'number': 'yellow',\n  'boolean': 'yellow',\n  'undefined': 'grey',\n  'null': 'bold',\n  'string': 'green',\n  'date': 'magenta',\n  // \"name\": intentionally not styling\n  'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n  var style = inspect.styles[styleType];\n\n  if (style) {\n    return '\\u001b[' + inspect.colors[style][0] + 'm' + str +\n           '\\u001b[' + inspect.colors[style][1] + 'm';\n  } else {\n    return str;\n  }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n  return str;\n}\n\n\nfunction arrayToHash(array) {\n  var hash = {};\n\n  array.forEach(function(val, idx) {\n    hash[val] = true;\n  });\n\n  return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n  // Provide a hook for user-specified inspect functions.\n  // Check that value is an object with an inspect function on it\n  if (ctx.customInspect &&\n      value &&\n      isFunction(value.inspect) &&\n      // Filter out the util module, it's inspect function is special\n      value.inspect !== exports.inspect &&\n      // Also filter out any prototype objects using the circular check.\n      !(value.constructor && value.constructor.prototype === value)) {\n    var ret = value.inspect(recurseTimes, ctx);\n    if (!isString(ret)) {\n      ret = formatValue(ctx, ret, recurseTimes);\n    }\n    return ret;\n  }\n\n  // Primitive types cannot have properties\n  var primitive = formatPrimitive(ctx, value);\n  if (primitive) {\n    return primitive;\n  }\n\n  // Look up the keys of the object.\n  var keys = Object.keys(value);\n  var visibleKeys = arrayToHash(keys);\n\n  if (ctx.showHidden) {\n    keys = Object.getOwnPropertyNames(value);\n  }\n\n  // IE doesn't make error fields non-enumerable\n  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n  if (isError(value)\n      && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n    return formatError(value);\n  }\n\n  // Some type of object without properties can be shortcutted.\n  if (keys.length === 0) {\n    if (isFunction(value)) {\n      var name = value.name ? ': ' + value.name : '';\n      return ctx.stylize('[Function' + name + ']', 'special');\n    }\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    }\n    if (isDate(value)) {\n      return ctx.stylize(Date.prototype.toString.call(value), 'date');\n    }\n    if (isError(value)) {\n      return formatError(value);\n    }\n  }\n\n  var base = '', array = false, braces = ['{', '}'];\n\n  // Make Array say that they are Array\n  if (isArray(value)) {\n    array = true;\n    braces = ['[', ']'];\n  }\n\n  // Make functions say that they are functions\n  if (isFunction(value)) {\n    var n = value.name ? ': ' + value.name : '';\n    base = ' [Function' + n + ']';\n  }\n\n  // Make RegExps say that they are RegExps\n  if (isRegExp(value)) {\n    base = ' ' + RegExp.prototype.toString.call(value);\n  }\n\n  // Make dates with properties first say the date\n  if (isDate(value)) {\n    base = ' ' + Date.prototype.toUTCString.call(value);\n  }\n\n  // Make error with message first say the error\n  if (isError(value)) {\n    base = ' ' + formatError(value);\n  }\n\n  if (keys.length === 0 && (!array || value.length == 0)) {\n    return braces[0] + base + braces[1];\n  }\n\n  if (recurseTimes < 0) {\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    } else {\n      return ctx.stylize('[Object]', 'special');\n    }\n  }\n\n  ctx.seen.push(value);\n\n  var output;\n  if (array) {\n    output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n  } else {\n    output = keys.map(function(key) {\n      return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n    });\n  }\n\n  ctx.seen.pop();\n\n  return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n  if (isUndefined(value))\n    return ctx.stylize('undefined', 'undefined');\n  if (isString(value)) {\n    var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n                                             .replace(/'/g, \"\\\\'\")\n                                             .replace(/\\\\\"/g, '\"') + '\\'';\n    return ctx.stylize(simple, 'string');\n  }\n  if (isNumber(value))\n    return ctx.stylize('' + value, 'number');\n  if (isBoolean(value))\n    return ctx.stylize('' + value, 'boolean');\n  // For some reason typeof null is \"object\", so special case here.\n  if (isNull(value))\n    return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n  return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n  var output = [];\n  for (var i = 0, l = value.length; i < l; ++i) {\n    if (hasOwnProperty(value, String(i))) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          String(i), true));\n    } else {\n      output.push('');\n    }\n  }\n  keys.forEach(function(key) {\n    if (!key.match(/^\\d+$/)) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          key, true));\n    }\n  });\n  return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n  var name, str, desc;\n  desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n  if (desc.get) {\n    if (desc.set) {\n      str = ctx.stylize('[Getter/Setter]', 'special');\n    } else {\n      str = ctx.stylize('[Getter]', 'special');\n    }\n  } else {\n    if (desc.set) {\n      str = ctx.stylize('[Setter]', 'special');\n    }\n  }\n  if (!hasOwnProperty(visibleKeys, key)) {\n    name = '[' + key + ']';\n  }\n  if (!str) {\n    if (ctx.seen.indexOf(desc.value) < 0) {\n      if (isNull(recurseTimes)) {\n        str = formatValue(ctx, desc.value, null);\n      } else {\n        str = formatValue(ctx, desc.value, recurseTimes - 1);\n      }\n      if (str.indexOf('\\n') > -1) {\n        if (array) {\n          str = str.split('\\n').map(function(line) {\n            return '  ' + line;\n          }).join('\\n').substr(2);\n        } else {\n          str = '\\n' + str.split('\\n').map(function(line) {\n            return '   ' + line;\n          }).join('\\n');\n        }\n      }\n    } else {\n      str = ctx.stylize('[Circular]', 'special');\n    }\n  }\n  if (isUndefined(name)) {\n    if (array && key.match(/^\\d+$/)) {\n      return str;\n    }\n    name = JSON.stringify('' + key);\n    if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n      name = name.substr(1, name.length - 2);\n      name = ctx.stylize(name, 'name');\n    } else {\n      name = name.replace(/'/g, \"\\\\'\")\n                 .replace(/\\\\\"/g, '\"')\n                 .replace(/(^\"|\"$)/g, \"'\");\n      name = ctx.stylize(name, 'string');\n    }\n  }\n\n  return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n  var numLinesEst = 0;\n  var length = output.reduce(function(prev, cur) {\n    numLinesEst++;\n    if (cur.indexOf('\\n') >= 0) numLinesEst++;\n    return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n  }, 0);\n\n  if (length > 60) {\n    return braces[0] +\n           (base === '' ? '' : base + '\\n ') +\n           ' ' +\n           output.join(',\\n  ') +\n           ' ' +\n           braces[1];\n  }\n\n  return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nexports.types = require('./support/types');\n\nfunction isArray(ar) {\n  return Array.isArray(ar);\n}\nexports.isArray = isArray;\n\nfunction isBoolean(arg) {\n  return typeof arg === 'boolean';\n}\nexports.isBoolean = isBoolean;\n\nfunction isNull(arg) {\n  return arg === null;\n}\nexports.isNull = isNull;\n\nfunction isNullOrUndefined(arg) {\n  return arg == null;\n}\nexports.isNullOrUndefined = isNullOrUndefined;\n\nfunction isNumber(arg) {\n  return typeof arg === 'number';\n}\nexports.isNumber = isNumber;\n\nfunction isString(arg) {\n  return typeof arg === 'string';\n}\nexports.isString = isString;\n\nfunction isSymbol(arg) {\n  return typeof arg === 'symbol';\n}\nexports.isSymbol = isSymbol;\n\nfunction isUndefined(arg) {\n  return arg === void 0;\n}\nexports.isUndefined = isUndefined;\n\nfunction isRegExp(re) {\n  return isObject(re) && objectToString(re) === '[object RegExp]';\n}\nexports.isRegExp = isRegExp;\nexports.types.isRegExp = isRegExp;\n\nfunction isObject(arg) {\n  return typeof arg === 'object' && arg !== null;\n}\nexports.isObject = isObject;\n\nfunction isDate(d) {\n  return isObject(d) && objectToString(d) === '[object Date]';\n}\nexports.isDate = isDate;\nexports.types.isDate = isDate;\n\nfunction isError(e) {\n  return isObject(e) &&\n      (objectToString(e) === '[object Error]' || e instanceof Error);\n}\nexports.isError = isError;\nexports.types.isNativeError = isError;\n\nfunction isFunction(arg) {\n  return typeof arg === 'function';\n}\nexports.isFunction = isFunction;\n\nfunction isPrimitive(arg) {\n  return arg === null ||\n         typeof arg === 'boolean' ||\n         typeof arg === 'number' ||\n         typeof arg === 'string' ||\n         typeof arg === 'symbol' ||  // ES6 symbol\n         typeof arg === 'undefined';\n}\nexports.isPrimitive = isPrimitive;\n\nexports.isBuffer = require('./support/isBuffer');\n\nfunction objectToString(o) {\n  return Object.prototype.toString.call(o);\n}\n\n\nfunction pad(n) {\n  return n < 10 ? '0' + n.toString(10) : n.toString(10);\n}\n\n\nvar months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',\n              'Oct', 'Nov', 'Dec'];\n\n// 26 Feb 16:19:34\nfunction timestamp() {\n  var d = new Date();\n  var time = [pad(d.getHours()),\n              pad(d.getMinutes()),\n              pad(d.getSeconds())].join(':');\n  return [d.getDate(), months[d.getMonth()], time].join(' ');\n}\n\n\n// log is just a thin wrapper to console.log that prepends a timestamp\nexports.log = function() {\n  console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));\n};\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * The Function.prototype.inherits from lang.js rewritten as a standalone\n * function (not on Function.prototype). NOTE: If this file is to be loaded\n * during bootstrapping this function needs to be rewritten using some native\n * functions as prototype setup using normal JavaScript does not work as\n * expected during bootstrapping (see mirror.js in r114903).\n *\n * @param {function} ctor Constructor function which needs to inherit the\n *     prototype.\n * @param {function} superCtor Constructor function to inherit prototype from.\n */\nexports.inherits = require('inherits');\n\nexports._extend = function(origin, add) {\n  // Don't do anything if add isn't an object\n  if (!add || !isObject(add)) return origin;\n\n  var keys = Object.keys(add);\n  var i = keys.length;\n  while (i--) {\n    origin[keys[i]] = add[keys[i]];\n  }\n  return origin;\n};\n\nfunction hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nvar kCustomPromisifiedSymbol = typeof Symbol !== 'undefined' ? Symbol('util.promisify.custom') : undefined;\n\nexports.promisify = function promisify(original) {\n  if (typeof original !== 'function')\n    throw new TypeError('The \"original\" argument must be of type Function');\n\n  if (kCustomPromisifiedSymbol && original[kCustomPromisifiedSymbol]) {\n    var fn = original[kCustomPromisifiedSymbol];\n    if (typeof fn !== 'function') {\n      throw new TypeError('The \"util.promisify.custom\" argument must be of type Function');\n    }\n    Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n      value: fn, enumerable: false, writable: false, configurable: true\n    });\n    return fn;\n  }\n\n  function fn() {\n    var promiseResolve, promiseReject;\n    var promise = new Promise(function (resolve, reject) {\n      promiseResolve = resolve;\n      promiseReject = reject;\n    });\n\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args.push(arguments[i]);\n    }\n    args.push(function (err, value) {\n      if (err) {\n        promiseReject(err);\n      } else {\n        promiseResolve(value);\n      }\n    });\n\n    try {\n      original.apply(this, args);\n    } catch (err) {\n      promiseReject(err);\n    }\n\n    return promise;\n  }\n\n  Object.setPrototypeOf(fn, Object.getPrototypeOf(original));\n\n  if (kCustomPromisifiedSymbol) Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n    value: fn, enumerable: false, writable: false, configurable: true\n  });\n  return Object.defineProperties(\n    fn,\n    getOwnPropertyDescriptors(original)\n  );\n}\n\nexports.promisify.custom = kCustomPromisifiedSymbol\n\nfunction callbackifyOnRejected(reason, cb) {\n  // `!reason` guard inspired by bluebird (Ref: https://goo.gl/t5IS6M).\n  // Because `null` is a special error value in callbacks which means \"no error\n  // occurred\", we error-wrap so the callback consumer can distinguish between\n  // \"the promise rejected with null\" or \"the promise fulfilled with undefined\".\n  if (!reason) {\n    var newReason = new Error('Promise was rejected with a falsy value');\n    newReason.reason = reason;\n    reason = newReason;\n  }\n  return cb(reason);\n}\n\nfunction callbackify(original) {\n  if (typeof original !== 'function') {\n    throw new TypeError('The \"original\" argument must be of type Function');\n  }\n\n  // We DO NOT return the promise as it gives the user a false sense that\n  // the promise is actually somehow related to the callback's execution\n  // and that the callback throwing will reject the promise.\n  function callbackified() {\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args.push(arguments[i]);\n    }\n\n    var maybeCb = args.pop();\n    if (typeof maybeCb !== 'function') {\n      throw new TypeError('The last argument must be of type Function');\n    }\n    var self = this;\n    var cb = function() {\n      return maybeCb.apply(self, arguments);\n    };\n    // In true node style we process the callback on `nextTick` with all the\n    // implications (stack, `uncaughtException`, `async_hooks`)\n    original.apply(this, args)\n      .then(function(ret) { process.nextTick(cb.bind(null, null, ret)) },\n            function(rej) { process.nextTick(callbackifyOnRejected.bind(null, rej, cb)) });\n  }\n\n  Object.setPrototypeOf(callbackified, Object.getPrototypeOf(original));\n  Object.defineProperties(callbackified,\n                          getOwnPropertyDescriptors(original));\n  return callbackified;\n}\nexports.callbackify = callbackify;\n","// Currently in sync with Node.js lib/internal/util/types.js\n// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9\n\n'use strict';\n\nvar isArgumentsObject = require('is-arguments');\nvar isGeneratorFunction = require('is-generator-function');\nvar whichTypedArray = require('which-typed-array');\nvar isTypedArray = require('is-typed-array');\n\nfunction uncurryThis(f) {\n  return f.call.bind(f);\n}\n\nvar BigIntSupported = typeof BigInt !== 'undefined';\nvar SymbolSupported = typeof Symbol !== 'undefined';\n\nvar ObjectToString = uncurryThis(Object.prototype.toString);\n\nvar numberValue = uncurryThis(Number.prototype.valueOf);\nvar stringValue = uncurryThis(String.prototype.valueOf);\nvar booleanValue = uncurryThis(Boolean.prototype.valueOf);\n\nif (BigIntSupported) {\n  var bigIntValue = uncurryThis(BigInt.prototype.valueOf);\n}\n\nif (SymbolSupported) {\n  var symbolValue = uncurryThis(Symbol.prototype.valueOf);\n}\n\nfunction checkBoxedPrimitive(value, prototypeValueOf) {\n  if (typeof value !== 'object') {\n    return false;\n  }\n  try {\n    prototypeValueOf(value);\n    return true;\n  } catch(e) {\n    return false;\n  }\n}\n\nexports.isArgumentsObject = isArgumentsObject;\nexports.isGeneratorFunction = isGeneratorFunction;\nexports.isTypedArray = isTypedArray;\n\n// Taken from here and modified for better browser support\n// https://github.com/sindresorhus/p-is-promise/blob/cda35a513bda03f977ad5cde3a079d237e82d7ef/index.js\nfunction isPromise(input) {\n\treturn (\n\t\t(\n\t\t\ttypeof Promise !== 'undefined' &&\n\t\t\tinput instanceof Promise\n\t\t) ||\n\t\t(\n\t\t\tinput !== null &&\n\t\t\ttypeof input === 'object' &&\n\t\t\ttypeof input.then === 'function' &&\n\t\t\ttypeof input.catch === 'function'\n\t\t)\n\t);\n}\nexports.isPromise = isPromise;\n\nfunction isArrayBufferView(value) {\n  if (typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView) {\n    return ArrayBuffer.isView(value);\n  }\n\n  return (\n    isTypedArray(value) ||\n    isDataView(value)\n  );\n}\nexports.isArrayBufferView = isArrayBufferView;\n\n\nfunction isUint8Array(value) {\n  return whichTypedArray(value) === 'Uint8Array';\n}\nexports.isUint8Array = isUint8Array;\n\nfunction isUint8ClampedArray(value) {\n  return whichTypedArray(value) === 'Uint8ClampedArray';\n}\nexports.isUint8ClampedArray = isUint8ClampedArray;\n\nfunction isUint16Array(value) {\n  return whichTypedArray(value) === 'Uint16Array';\n}\nexports.isUint16Array = isUint16Array;\n\nfunction isUint32Array(value) {\n  return whichTypedArray(value) === 'Uint32Array';\n}\nexports.isUint32Array = isUint32Array;\n\nfunction isInt8Array(value) {\n  return whichTypedArray(value) === 'Int8Array';\n}\nexports.isInt8Array = isInt8Array;\n\nfunction isInt16Array(value) {\n  return whichTypedArray(value) === 'Int16Array';\n}\nexports.isInt16Array = isInt16Array;\n\nfunction isInt32Array(value) {\n  return whichTypedArray(value) === 'Int32Array';\n}\nexports.isInt32Array = isInt32Array;\n\nfunction isFloat32Array(value) {\n  return whichTypedArray(value) === 'Float32Array';\n}\nexports.isFloat32Array = isFloat32Array;\n\nfunction isFloat64Array(value) {\n  return whichTypedArray(value) === 'Float64Array';\n}\nexports.isFloat64Array = isFloat64Array;\n\nfunction isBigInt64Array(value) {\n  return whichTypedArray(value) === 'BigInt64Array';\n}\nexports.isBigInt64Array = isBigInt64Array;\n\nfunction isBigUint64Array(value) {\n  return whichTypedArray(value) === 'BigUint64Array';\n}\nexports.isBigUint64Array = isBigUint64Array;\n\nfunction isMapToString(value) {\n  return ObjectToString(value) === '[object Map]';\n}\nisMapToString.working = (\n  typeof Map !== 'undefined' &&\n  isMapToString(new Map())\n);\n\nfunction isMap(value) {\n  if (typeof Map === 'undefined') {\n    return false;\n  }\n\n  return isMapToString.working\n    ? isMapToString(value)\n    : value instanceof Map;\n}\nexports.isMap = isMap;\n\nfunction isSetToString(value) {\n  return ObjectToString(value) === '[object Set]';\n}\nisSetToString.working = (\n  typeof Set !== 'undefined' &&\n  isSetToString(new Set())\n);\nfunction isSet(value) {\n  if (typeof Set === 'undefined') {\n    return false;\n  }\n\n  return isSetToString.working\n    ? isSetToString(value)\n    : value instanceof Set;\n}\nexports.isSet = isSet;\n\nfunction isWeakMapToString(value) {\n  return ObjectToString(value) === '[object WeakMap]';\n}\nisWeakMapToString.working = (\n  typeof WeakMap !== 'undefined' &&\n  isWeakMapToString(new WeakMap())\n);\nfunction isWeakMap(value) {\n  if (typeof WeakMap === 'undefined') {\n    return false;\n  }\n\n  return isWeakMapToString.working\n    ? isWeakMapToString(value)\n    : value instanceof WeakMap;\n}\nexports.isWeakMap = isWeakMap;\n\nfunction isWeakSetToString(value) {\n  return ObjectToString(value) === '[object WeakSet]';\n}\nisWeakSetToString.working = (\n  typeof WeakSet !== 'undefined' &&\n  isWeakSetToString(new WeakSet())\n);\nfunction isWeakSet(value) {\n  return isWeakSetToString(value);\n}\nexports.isWeakSet = isWeakSet;\n\nfunction isArrayBufferToString(value) {\n  return ObjectToString(value) === '[object ArrayBuffer]';\n}\nisArrayBufferToString.working = (\n  typeof ArrayBuffer !== 'undefined' &&\n  isArrayBufferToString(new ArrayBuffer())\n);\nfunction isArrayBuffer(value) {\n  if (typeof ArrayBuffer === 'undefined') {\n    return false;\n  }\n\n  return isArrayBufferToString.working\n    ? isArrayBufferToString(value)\n    : value instanceof ArrayBuffer;\n}\nexports.isArrayBuffer = isArrayBuffer;\n\nfunction isDataViewToString(value) {\n  return ObjectToString(value) === '[object DataView]';\n}\nisDataViewToString.working = (\n  typeof ArrayBuffer !== 'undefined' &&\n  typeof DataView !== 'undefined' &&\n  isDataViewToString(new DataView(new ArrayBuffer(1), 0, 1))\n);\nfunction isDataView(value) {\n  if (typeof DataView === 'undefined') {\n    return false;\n  }\n\n  return isDataViewToString.working\n    ? isDataViewToString(value)\n    : value instanceof DataView;\n}\nexports.isDataView = isDataView;\n\n// Store a copy of SharedArrayBuffer in case it's deleted elsewhere\nvar SharedArrayBufferCopy = typeof SharedArrayBuffer !== 'undefined' ? SharedArrayBuffer : undefined;\nfunction isSharedArrayBufferToString(value) {\n  return ObjectToString(value) === '[object SharedArrayBuffer]';\n}\nfunction isSharedArrayBuffer(value) {\n  if (typeof SharedArrayBufferCopy === 'undefined') {\n    return false;\n  }\n\n  if (typeof isSharedArrayBufferToString.working === 'undefined') {\n    isSharedArrayBufferToString.working = isSharedArrayBufferToString(new SharedArrayBufferCopy());\n  }\n\n  return isSharedArrayBufferToString.working\n    ? isSharedArrayBufferToString(value)\n    : value instanceof SharedArrayBufferCopy;\n}\nexports.isSharedArrayBuffer = isSharedArrayBuffer;\n\nfunction isAsyncFunction(value) {\n  return ObjectToString(value) === '[object AsyncFunction]';\n}\nexports.isAsyncFunction = isAsyncFunction;\n\nfunction isMapIterator(value) {\n  return ObjectToString(value) === '[object Map Iterator]';\n}\nexports.isMapIterator = isMapIterator;\n\nfunction isSetIterator(value) {\n  return ObjectToString(value) === '[object Set Iterator]';\n}\nexports.isSetIterator = isSetIterator;\n\nfunction isGeneratorObject(value) {\n  return ObjectToString(value) === '[object Generator]';\n}\nexports.isGeneratorObject = isGeneratorObject;\n\nfunction isWebAssemblyCompiledModule(value) {\n  return ObjectToString(value) === '[object WebAssembly.Module]';\n}\nexports.isWebAssemblyCompiledModule = isWebAssemblyCompiledModule;\n\nfunction isNumberObject(value) {\n  return checkBoxedPrimitive(value, numberValue);\n}\nexports.isNumberObject = isNumberObject;\n\nfunction isStringObject(value) {\n  return checkBoxedPrimitive(value, stringValue);\n}\nexports.isStringObject = isStringObject;\n\nfunction isBooleanObject(value) {\n  return checkBoxedPrimitive(value, booleanValue);\n}\nexports.isBooleanObject = isBooleanObject;\n\nfunction isBigIntObject(value) {\n  return BigIntSupported && checkBoxedPrimitive(value, bigIntValue);\n}\nexports.isBigIntObject = isBigIntObject;\n\nfunction isSymbolObject(value) {\n  return SymbolSupported && checkBoxedPrimitive(value, symbolValue);\n}\nexports.isSymbolObject = isSymbolObject;\n\nfunction isBoxedPrimitive(value) {\n  return (\n    isNumberObject(value) ||\n    isStringObject(value) ||\n    isBooleanObject(value) ||\n    isBigIntObject(value) ||\n    isSymbolObject(value)\n  );\n}\nexports.isBoxedPrimitive = isBoxedPrimitive;\n\nfunction isAnyArrayBuffer(value) {\n  return typeof Uint8Array !== 'undefined' && (\n    isArrayBuffer(value) ||\n    isSharedArrayBuffer(value)\n  );\n}\nexports.isAnyArrayBuffer = isAnyArrayBuffer;\n\n['isProxy', 'isExternal', 'isModuleNamespaceObject'].forEach(function(method) {\n  Object.defineProperty(exports, method, {\n    enumerable: false,\n    value: function() {\n      throw new Error(method + ' is not supported in userland');\n    }\n  });\n});\n","'use strict';\n\nvar hasToStringTag = typeof Symbol === 'function' && typeof Symbol.toStringTag === 'symbol';\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\n\nvar isStandardArguments = function isArguments(value) {\n\tif (hasToStringTag && value && typeof value === 'object' && Symbol.toStringTag in value) {\n\t\treturn false;\n\t}\n\treturn $toString(value) === '[object Arguments]';\n};\n\nvar isLegacyArguments = function isArguments(value) {\n\tif (isStandardArguments(value)) {\n\t\treturn true;\n\t}\n\treturn value !== null &&\n\t\ttypeof value === 'object' &&\n\t\ttypeof value.length === 'number' &&\n\t\tvalue.length >= 0 &&\n\t\t$toString(value) !== '[object Array]' &&\n\t\t$toString(value.callee) === '[object Function]';\n};\n\nvar supportsStandardArguments = (function () {\n\treturn isStandardArguments(arguments);\n}());\n\nisStandardArguments.isLegacyArguments = isLegacyArguments; // for tests\n\nmodule.exports = supportsStandardArguments ? isStandardArguments : isLegacyArguments;\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar callBind = require('./');\n\nvar $indexOf = callBind(GetIntrinsic('String.prototype.indexOf'));\n\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\tvar intrinsic = GetIntrinsic(name, !!allowMissing);\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBind(intrinsic);\n\t}\n\treturn intrinsic;\n};\n","'use strict';\n\nvar undefined;\n\nvar $SyntaxError = SyntaxError;\nvar $Function = Function;\nvar $TypeError = TypeError;\n\n// eslint-disable-next-line consistent-return\nvar getEvalledConstructor = function (expressionSyntax) {\n\ttry {\n\t\treturn $Function('\"use strict\"; return (' + expressionSyntax + ').constructor;')();\n\t} catch (e) {}\n};\n\nvar $gOPD = Object.getOwnPropertyDescriptor;\nif ($gOPD) {\n\ttry {\n\t\t$gOPD({}, '');\n\t} catch (e) {\n\t\t$gOPD = null; // this is IE 8, which has a broken gOPD\n\t}\n}\n\nvar throwTypeError = function () {\n\tthrow new $TypeError();\n};\nvar ThrowTypeError = $gOPD\n\t? (function () {\n\t\ttry {\n\t\t\t// eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties\n\t\t\targuments.callee; // IE 8 does not throw here\n\t\t\treturn throwTypeError;\n\t\t} catch (calleeThrows) {\n\t\t\ttry {\n\t\t\t\t// IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '')\n\t\t\t\treturn $gOPD(arguments, 'callee').get;\n\t\t\t} catch (gOPDthrows) {\n\t\t\t\treturn throwTypeError;\n\t\t\t}\n\t\t}\n\t}())\n\t: throwTypeError;\n\nvar hasSymbols = require('has-symbols')();\n\nvar getProto = Object.getPrototypeOf || function (x) { return x.__proto__; }; // eslint-disable-line no-proto\n\nvar needsEval = {};\n\nvar TypedArray = typeof Uint8Array === 'undefined' ? undefined : getProto(Uint8Array);\n\nvar INTRINSICS = {\n\t'%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError,\n\t'%Array%': Array,\n\t'%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer,\n\t'%ArrayIteratorPrototype%': hasSymbols ? getProto([][Symbol.iterator]()) : undefined,\n\t'%AsyncFromSyncIteratorPrototype%': undefined,\n\t'%AsyncFunction%': needsEval,\n\t'%AsyncGenerator%': needsEval,\n\t'%AsyncGeneratorFunction%': needsEval,\n\t'%AsyncIteratorPrototype%': needsEval,\n\t'%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics,\n\t'%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt,\n\t'%Boolean%': Boolean,\n\t'%DataView%': typeof DataView === 'undefined' ? undefined : DataView,\n\t'%Date%': Date,\n\t'%decodeURI%': decodeURI,\n\t'%decodeURIComponent%': decodeURIComponent,\n\t'%encodeURI%': encodeURI,\n\t'%encodeURIComponent%': encodeURIComponent,\n\t'%Error%': Error,\n\t'%eval%': eval, // eslint-disable-line no-eval\n\t'%EvalError%': EvalError,\n\t'%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array,\n\t'%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array,\n\t'%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry,\n\t'%Function%': $Function,\n\t'%GeneratorFunction%': needsEval,\n\t'%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array,\n\t'%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array,\n\t'%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array,\n\t'%isFinite%': isFinite,\n\t'%isNaN%': isNaN,\n\t'%IteratorPrototype%': hasSymbols ? getProto(getProto([][Symbol.iterator]())) : undefined,\n\t'%JSON%': typeof JSON === 'object' ? JSON : undefined,\n\t'%Map%': typeof Map === 'undefined' ? undefined : Map,\n\t'%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols ? undefined : getProto(new Map()[Symbol.iterator]()),\n\t'%Math%': Math,\n\t'%Number%': Number,\n\t'%Object%': Object,\n\t'%parseFloat%': parseFloat,\n\t'%parseInt%': parseInt,\n\t'%Promise%': typeof Promise === 'undefined' ? undefined : Promise,\n\t'%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy,\n\t'%RangeError%': RangeError,\n\t'%ReferenceError%': ReferenceError,\n\t'%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect,\n\t'%RegExp%': RegExp,\n\t'%Set%': typeof Set === 'undefined' ? undefined : Set,\n\t'%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols ? undefined : getProto(new Set()[Symbol.iterator]()),\n\t'%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer,\n\t'%String%': String,\n\t'%StringIteratorPrototype%': hasSymbols ? getProto(''[Symbol.iterator]()) : undefined,\n\t'%Symbol%': hasSymbols ? Symbol : undefined,\n\t'%SyntaxError%': $SyntaxError,\n\t'%ThrowTypeError%': ThrowTypeError,\n\t'%TypedArray%': TypedArray,\n\t'%TypeError%': $TypeError,\n\t'%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array,\n\t'%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray,\n\t'%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array,\n\t'%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array,\n\t'%URIError%': URIError,\n\t'%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap,\n\t'%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef,\n\t'%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet\n};\n\nvar doEval = function doEval(name) {\n\tvar value;\n\tif (name === '%AsyncFunction%') {\n\t\tvalue = getEvalledConstructor('async function () {}');\n\t} else if (name === '%GeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('function* () {}');\n\t} else if (name === '%AsyncGeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('async function* () {}');\n\t} else if (name === '%AsyncGenerator%') {\n\t\tvar fn = doEval('%AsyncGeneratorFunction%');\n\t\tif (fn) {\n\t\t\tvalue = fn.prototype;\n\t\t}\n\t} else if (name === '%AsyncIteratorPrototype%') {\n\t\tvar gen = doEval('%AsyncGenerator%');\n\t\tif (gen) {\n\t\t\tvalue = getProto(gen.prototype);\n\t\t}\n\t}\n\n\tINTRINSICS[name] = value;\n\n\treturn value;\n};\n\nvar LEGACY_ALIASES = {\n\t'%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'],\n\t'%ArrayPrototype%': ['Array', 'prototype'],\n\t'%ArrayProto_entries%': ['Array', 'prototype', 'entries'],\n\t'%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'],\n\t'%ArrayProto_keys%': ['Array', 'prototype', 'keys'],\n\t'%ArrayProto_values%': ['Array', 'prototype', 'values'],\n\t'%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'],\n\t'%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'],\n\t'%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'],\n\t'%BooleanPrototype%': ['Boolean', 'prototype'],\n\t'%DataViewPrototype%': ['DataView', 'prototype'],\n\t'%DatePrototype%': ['Date', 'prototype'],\n\t'%ErrorPrototype%': ['Error', 'prototype'],\n\t'%EvalErrorPrototype%': ['EvalError', 'prototype'],\n\t'%Float32ArrayPrototype%': ['Float32Array', 'prototype'],\n\t'%Float64ArrayPrototype%': ['Float64Array', 'prototype'],\n\t'%FunctionPrototype%': ['Function', 'prototype'],\n\t'%Generator%': ['GeneratorFunction', 'prototype'],\n\t'%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'],\n\t'%Int8ArrayPrototype%': ['Int8Array', 'prototype'],\n\t'%Int16ArrayPrototype%': ['Int16Array', 'prototype'],\n\t'%Int32ArrayPrototype%': ['Int32Array', 'prototype'],\n\t'%JSONParse%': ['JSON', 'parse'],\n\t'%JSONStringify%': ['JSON', 'stringify'],\n\t'%MapPrototype%': ['Map', 'prototype'],\n\t'%NumberPrototype%': ['Number', 'prototype'],\n\t'%ObjectPrototype%': ['Object', 'prototype'],\n\t'%ObjProto_toString%': ['Object', 'prototype', 'toString'],\n\t'%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'],\n\t'%PromisePrototype%': ['Promise', 'prototype'],\n\t'%PromiseProto_then%': ['Promise', 'prototype', 'then'],\n\t'%Promise_all%': ['Promise', 'all'],\n\t'%Promise_reject%': ['Promise', 'reject'],\n\t'%Promise_resolve%': ['Promise', 'resolve'],\n\t'%RangeErrorPrototype%': ['RangeError', 'prototype'],\n\t'%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'],\n\t'%RegExpPrototype%': ['RegExp', 'prototype'],\n\t'%SetPrototype%': ['Set', 'prototype'],\n\t'%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'],\n\t'%StringPrototype%': ['String', 'prototype'],\n\t'%SymbolPrototype%': ['Symbol', 'prototype'],\n\t'%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'],\n\t'%TypedArrayPrototype%': ['TypedArray', 'prototype'],\n\t'%TypeErrorPrototype%': ['TypeError', 'prototype'],\n\t'%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'],\n\t'%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'],\n\t'%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'],\n\t'%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'],\n\t'%URIErrorPrototype%': ['URIError', 'prototype'],\n\t'%WeakMapPrototype%': ['WeakMap', 'prototype'],\n\t'%WeakSetPrototype%': ['WeakSet', 'prototype']\n};\n\nvar bind = require('function-bind');\nvar hasOwn = require('has');\nvar $concat = bind.call(Function.call, Array.prototype.concat);\nvar $spliceApply = bind.call(Function.apply, Array.prototype.splice);\nvar $replace = bind.call(Function.call, String.prototype.replace);\nvar $strSlice = bind.call(Function.call, String.prototype.slice);\n\n/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */\nvar rePropName = /[^%.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|%$))/g;\nvar reEscapeChar = /\\\\(\\\\)?/g; /** Used to match backslashes in property paths. */\nvar stringToPath = function stringToPath(string) {\n\tvar first = $strSlice(string, 0, 1);\n\tvar last = $strSlice(string, -1);\n\tif (first === '%' && last !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected closing `%`');\n\t} else if (last === '%' && first !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected opening `%`');\n\t}\n\tvar result = [];\n\t$replace(string, rePropName, function (match, number, quote, subString) {\n\t\tresult[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match;\n\t});\n\treturn result;\n};\n/* end adaptation */\n\nvar getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) {\n\tvar intrinsicName = name;\n\tvar alias;\n\tif (hasOwn(LEGACY_ALIASES, intrinsicName)) {\n\t\talias = LEGACY_ALIASES[intrinsicName];\n\t\tintrinsicName = '%' + alias[0] + '%';\n\t}\n\n\tif (hasOwn(INTRINSICS, intrinsicName)) {\n\t\tvar value = INTRINSICS[intrinsicName];\n\t\tif (value === needsEval) {\n\t\t\tvalue = doEval(intrinsicName);\n\t\t}\n\t\tif (typeof value === 'undefined' && !allowMissing) {\n\t\t\tthrow new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!');\n\t\t}\n\n\t\treturn {\n\t\t\talias: alias,\n\t\t\tname: intrinsicName,\n\t\t\tvalue: value\n\t\t};\n\t}\n\n\tthrow new $SyntaxError('intrinsic ' + name + ' does not exist!');\n};\n\nmodule.exports = function GetIntrinsic(name, allowMissing) {\n\tif (typeof name !== 'string' || name.length === 0) {\n\t\tthrow new $TypeError('intrinsic name must be a non-empty string');\n\t}\n\tif (arguments.length > 1 && typeof allowMissing !== 'boolean') {\n\t\tthrow new $TypeError('\"allowMissing\" argument must be a boolean');\n\t}\n\n\tvar parts = stringToPath(name);\n\tvar intrinsicBaseName = parts.length > 0 ? parts[0] : '';\n\n\tvar intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing);\n\tvar intrinsicRealName = intrinsic.name;\n\tvar value = intrinsic.value;\n\tvar skipFurtherCaching = false;\n\n\tvar alias = intrinsic.alias;\n\tif (alias) {\n\t\tintrinsicBaseName = alias[0];\n\t\t$spliceApply(parts, $concat([0, 1], alias));\n\t}\n\n\tfor (var i = 1, isOwn = true; i < parts.length; i += 1) {\n\t\tvar part = parts[i];\n\t\tvar first = $strSlice(part, 0, 1);\n\t\tvar last = $strSlice(part, -1);\n\t\tif (\n\t\t\t(\n\t\t\t\t(first === '\"' || first === \"'\" || first === '`')\n\t\t\t\t|| (last === '\"' || last === \"'\" || last === '`')\n\t\t\t)\n\t\t\t&& first !== last\n\t\t) {\n\t\t\tthrow new $SyntaxError('property names with quotes must have matching quotes');\n\t\t}\n\t\tif (part === 'constructor' || !isOwn) {\n\t\t\tskipFurtherCaching = true;\n\t\t}\n\n\t\tintrinsicBaseName += '.' + part;\n\t\tintrinsicRealName = '%' + intrinsicBaseName + '%';\n\n\t\tif (hasOwn(INTRINSICS, intrinsicRealName)) {\n\t\t\tvalue = INTRINSICS[intrinsicRealName];\n\t\t} else if (value != null) {\n\t\t\tif (!(part in value)) {\n\t\t\t\tif (!allowMissing) {\n\t\t\t\t\tthrow new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');\n\t\t\t\t}\n\t\t\t\treturn void undefined;\n\t\t\t}\n\t\t\tif ($gOPD && (i + 1) >= parts.length) {\n\t\t\t\tvar desc = $gOPD(value, part);\n\t\t\t\tisOwn = !!desc;\n\n\t\t\t\t// By convention, when a data property is converted to an accessor\n\t\t\t\t// property to emulate a data property that does not suffer from\n\t\t\t\t// the override mistake, that accessor's getter is marked with\n\t\t\t\t// an `originalValue` property. Here, when we detect this, we\n\t\t\t\t// uphold the illusion by pretending to see that original data\n\t\t\t\t// property, i.e., returning the value rather than the getter\n\t\t\t\t// itself.\n\t\t\t\tif (isOwn && 'get' in desc && !('originalValue' in desc.get)) {\n\t\t\t\t\tvalue = desc.get;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = value[part];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tisOwn = hasOwn(value, part);\n\t\t\t\tvalue = value[part];\n\t\t\t}\n\n\t\t\tif (isOwn && !skipFurtherCaching) {\n\t\t\t\tINTRINSICS[intrinsicRealName] = value;\n\t\t\t}\n\t\t}\n\t}\n\treturn value;\n};\n","'use strict';\n\nvar origSymbol = typeof Symbol !== 'undefined' && Symbol;\nvar hasSymbolSham = require('./shams');\n\nmodule.exports = function hasNativeSymbols() {\n\tif (typeof origSymbol !== 'function') { return false; }\n\tif (typeof Symbol !== 'function') { return false; }\n\tif (typeof origSymbol('foo') !== 'symbol') { return false; }\n\tif (typeof Symbol('bar') !== 'symbol') { return false; }\n\n\treturn hasSymbolSham();\n};\n","'use strict';\n\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (sym in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\tvar descriptor = Object.getOwnPropertyDescriptor(obj, sym);\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n","'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar slice = Array.prototype.slice;\nvar toStr = Object.prototype.toString;\nvar funcType = '[object Function]';\n\nmodule.exports = function bind(that) {\n    var target = this;\n    if (typeof target !== 'function' || toStr.call(target) !== funcType) {\n        throw new TypeError(ERROR_MESSAGE + target);\n    }\n    var args = slice.call(arguments, 1);\n\n    var bound;\n    var binder = function () {\n        if (this instanceof bound) {\n            var result = target.apply(\n                this,\n                args.concat(slice.call(arguments))\n            );\n            if (Object(result) === result) {\n                return result;\n            }\n            return this;\n        } else {\n            return target.apply(\n                that,\n                args.concat(slice.call(arguments))\n            );\n        }\n    };\n\n    var boundLength = Math.max(0, target.length - args.length);\n    var boundArgs = [];\n    for (var i = 0; i < boundLength; i++) {\n        boundArgs.push('$' + i);\n    }\n\n    bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder);\n\n    if (target.prototype) {\n        var Empty = function Empty() {};\n        Empty.prototype = target.prototype;\n        bound.prototype = new Empty();\n        Empty.prototype = null;\n    }\n\n    return bound;\n};\n","'use strict';\n\nvar bind = require('function-bind');\n\nmodule.exports = bind.call(Function.call, Object.prototype.hasOwnProperty);\n","'use strict';\n\nvar bind = require('function-bind');\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $apply = GetIntrinsic('%Function.prototype.apply%');\nvar $call = GetIntrinsic('%Function.prototype.call%');\nvar $reflectApply = GetIntrinsic('%Reflect.apply%', true) || bind.call($call, $apply);\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%', true);\nvar $defineProperty = GetIntrinsic('%Object.defineProperty%', true);\nvar $max = GetIntrinsic('%Math.max%');\n\nif ($defineProperty) {\n\ttry {\n\t\t$defineProperty({}, 'a', { value: 1 });\n\t} catch (e) {\n\t\t// IE 8 has a broken defineProperty\n\t\t$defineProperty = null;\n\t}\n}\n\nmodule.exports = function callBind(originalFunction) {\n\tvar func = $reflectApply(bind, $call, arguments);\n\tif ($gOPD && $defineProperty) {\n\t\tvar desc = $gOPD(func, 'length');\n\t\tif (desc.configurable) {\n\t\t\t// original length, plus the receiver, minus any additional arguments (after the receiver)\n\t\t\t$defineProperty(\n\t\t\t\tfunc,\n\t\t\t\t'length',\n\t\t\t\t{ value: 1 + $max(0, originalFunction.length - (arguments.length - 1)) }\n\t\t\t);\n\t\t}\n\t}\n\treturn func;\n};\n\nvar applyBind = function applyBind() {\n\treturn $reflectApply(bind, $apply, arguments);\n};\n\nif ($defineProperty) {\n\t$defineProperty(module.exports, 'apply', { value: applyBind });\n} else {\n\tmodule.exports.apply = applyBind;\n}\n","'use strict';\n\nvar toStr = Object.prototype.toString;\nvar fnToStr = Function.prototype.toString;\nvar isFnRegex = /^\\s*(?:function)?\\*/;\nvar hasToStringTag = typeof Symbol === 'function' && typeof Symbol.toStringTag === 'symbol';\nvar getProto = Object.getPrototypeOf;\nvar getGeneratorFunc = function () { // eslint-disable-line consistent-return\n\tif (!hasToStringTag) {\n\t\treturn false;\n\t}\n\ttry {\n\t\treturn Function('return function*() {}')();\n\t} catch (e) {\n\t}\n};\nvar GeneratorFunction;\n\nmodule.exports = function isGeneratorFunction(fn) {\n\tif (typeof fn !== 'function') {\n\t\treturn false;\n\t}\n\tif (isFnRegex.test(fnToStr.call(fn))) {\n\t\treturn true;\n\t}\n\tif (!hasToStringTag) {\n\t\tvar str = toStr.call(fn);\n\t\treturn str === '[object GeneratorFunction]';\n\t}\n\tif (!getProto) {\n\t\treturn false;\n\t}\n\tif (typeof GeneratorFunction === 'undefined') {\n\t\tvar generatorFunc = getGeneratorFunc();\n\t\tGeneratorFunction = generatorFunc ? getProto(generatorFunc) : false;\n\t}\n\treturn getProto(fn) === GeneratorFunction;\n};\n","'use strict';\n\nvar forEach = require('foreach');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\nvar hasSymbols = require('has-symbols')();\nvar hasToStringTag = hasSymbols && typeof Symbol.toStringTag === 'symbol';\n\nvar typedArrays = availableTypedArrays();\n\nvar $slice = callBound('String.prototype.slice');\nvar toStrTags = {};\nvar gOPD = require('es-abstract/helpers/getOwnPropertyDescriptor');\nvar getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof');\nif (hasToStringTag && gOPD && getPrototypeOf) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tif (typeof global[typedArray] === 'function') {\n\t\t\tvar arr = new global[typedArray]();\n\t\t\tif (!(Symbol.toStringTag in arr)) {\n\t\t\t\tthrow new EvalError('this engine has support for Symbol.toStringTag, but ' + typedArray + ' does not have the property! Please report this.');\n\t\t\t}\n\t\t\tvar proto = getPrototypeOf(arr);\n\t\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\t\tif (!descriptor) {\n\t\t\t\tvar superProto = getPrototypeOf(proto);\n\t\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t\t}\n\t\t\ttoStrTags[typedArray] = descriptor.get;\n\t\t}\n\t});\n}\n\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\tvar foundName = false;\n\tforEach(toStrTags, function (getter, typedArray) {\n\t\tif (!foundName) {\n\t\t\ttry {\n\t\t\t\tvar name = getter.call(value);\n\t\t\t\tif (name === typedArray) {\n\t\t\t\t\tfoundName = name;\n\t\t\t\t}\n\t\t\t} catch (e) {}\n\t\t}\n\t});\n\treturn foundName;\n};\n\nvar isTypedArray = require('is-typed-array');\n\nmodule.exports = function whichTypedArray(value) {\n\tif (!isTypedArray(value)) { return false; }\n\tif (!hasToStringTag) { return $slice($toString(value), 8, -1); }\n\treturn tryTypedArrays(value);\n};\n","\nvar hasOwn = Object.prototype.hasOwnProperty;\nvar toString = Object.prototype.toString;\n\nmodule.exports = function forEach (obj, fn, ctx) {\n    if (toString.call(fn) !== '[object Function]') {\n        throw new TypeError('iterator must be a function');\n    }\n    var l = obj.length;\n    if (l === +l) {\n        for (var i = 0; i < l; i++) {\n            fn.call(ctx, obj[i], i, obj);\n        }\n    } else {\n        for (var k in obj) {\n            if (hasOwn.call(obj, k)) {\n                fn.call(ctx, obj[k], k, obj);\n            }\n        }\n    }\n};\n\n","'use strict';\n\nvar possibleNames = [\n\t'BigInt64Array',\n\t'BigUint64Array',\n\t'Float32Array',\n\t'Float64Array',\n\t'Int16Array',\n\t'Int32Array',\n\t'Int8Array',\n\t'Uint16Array',\n\t'Uint32Array',\n\t'Uint8Array',\n\t'Uint8ClampedArray'\n];\n\nmodule.exports = function availableTypedArrays() {\n\tvar out = [];\n\tfor (var i = 0; i < possibleNames.length; i++) {\n\t\tif (typeof global[possibleNames[i]] === 'function') {\n\t\t\tout[out.length] = possibleNames[i];\n\t\t}\n\t}\n\treturn out;\n};\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%');\nif ($gOPD) {\n\ttry {\n\t\t$gOPD([], 'length');\n\t} catch (e) {\n\t\t// IE 8 has a broken gOPD\n\t\t$gOPD = null;\n\t}\n}\n\nmodule.exports = $gOPD;\n","'use strict';\n\nvar forEach = require('foreach');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\nvar hasSymbols = require('has-symbols')();\nvar hasToStringTag = hasSymbols && typeof Symbol.toStringTag === 'symbol';\n\nvar typedArrays = availableTypedArrays();\n\nvar $indexOf = callBound('Array.prototype.indexOf', true) || function indexOf(array, value) {\n\tfor (var i = 0; i < array.length; i += 1) {\n\t\tif (array[i] === value) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n};\nvar $slice = callBound('String.prototype.slice');\nvar toStrTags = {};\nvar gOPD = require('es-abstract/helpers/getOwnPropertyDescriptor');\nvar getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof');\nif (hasToStringTag && gOPD && getPrototypeOf) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new global[typedArray]();\n\t\tif (!(Symbol.toStringTag in arr)) {\n\t\t\tthrow new EvalError('this engine has support for Symbol.toStringTag, but ' + typedArray + ' does not have the property! Please report this.');\n\t\t}\n\t\tvar proto = getPrototypeOf(arr);\n\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\tif (!descriptor) {\n\t\t\tvar superProto = getPrototypeOf(proto);\n\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t}\n\t\ttoStrTags[typedArray] = descriptor.get;\n\t});\n}\n\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\tvar anyTrue = false;\n\tforEach(toStrTags, function (getter, typedArray) {\n\t\tif (!anyTrue) {\n\t\t\ttry {\n\t\t\t\tanyTrue = getter.call(value) === typedArray;\n\t\t\t} catch (e) { /**/ }\n\t\t}\n\t});\n\treturn anyTrue;\n};\n\nmodule.exports = function isTypedArray(value) {\n\tif (!value || typeof value !== 'object') { return false; }\n\tif (!hasToStringTag) {\n\t\tvar tag = $slice($toString(value), 8, -1);\n\t\treturn $indexOf(typedArrays, tag) > -1;\n\t}\n\tif (!gOPD) { return false; }\n\treturn tryTypedArrays(value);\n};\n","module.exports = function isBuffer(arg) {\n  return arg && typeof arg === 'object'\n    && typeof arg.copy === 'function'\n    && typeof arg.fill === 'function'\n    && typeof arg.readUInt8 === 'function';\n}","'use strict'\n\nconst AbstractLevelDOWN = require('abstract-leveldown').AbstractLevelDOWN\nconst inherits = require('inherits')\nconst DeferredIterator = require('./deferred-iterator')\nconst deferrables = 'put get del batch clear'.split(' ')\nconst optionalDeferrables = 'approximateSize compactRange'.split(' ')\n\nfunction DeferredLevelDOWN (db) {\n  AbstractLevelDOWN.call(this, db.supports || {})\n\n  // TODO (future major): remove this fallback; db must have manifest that\n  // declares approximateSize and compactRange in additionalMethods.\n  for (const m of optionalDeferrables) {\n    if (typeof db[m] === 'function' && !this.supports.additionalMethods[m]) {\n      this.supports.additionalMethods[m] = true\n    }\n  }\n\n  this._db = db\n  this._operations = []\n\n  closed(this)\n}\n\ninherits(DeferredLevelDOWN, AbstractLevelDOWN)\n\nDeferredLevelDOWN.prototype.type = 'deferred-leveldown'\n\nDeferredLevelDOWN.prototype._open = function (options, callback) {\n  this._db.open(options, (err) => {\n    if (err) return callback(err)\n\n    for (const op of this._operations) {\n      if (op.iterator) {\n        op.iterator.setDb(this._db)\n      } else {\n        this._db[op.method](...op.args)\n      }\n    }\n\n    this._operations = []\n\n    open(this)\n    callback()\n  })\n}\n\nDeferredLevelDOWN.prototype._close = function (callback) {\n  this._db.close((err) => {\n    if (err) return callback(err)\n    closed(this)\n    callback()\n  })\n}\n\nfunction open (self) {\n  for (const m of deferrables.concat('iterator')) {\n    self['_' + m] = function (...args) {\n      return this._db[m](...args)\n    }\n  }\n\n  for (const m of Object.keys(self.supports.additionalMethods)) {\n    self[m] = function (...args) {\n      return this._db[m](...args)\n    }\n  }\n}\n\nfunction closed (self) {\n  for (const m of deferrables) {\n    self['_' + m] = function (...args) {\n      this._operations.push({ method: m, args })\n    }\n  }\n\n  for (const m of Object.keys(self.supports.additionalMethods)) {\n    self[m] = function (...args) {\n      this._operations.push({ method: m, args })\n    }\n  }\n\n  self._iterator = function (options) {\n    const it = new DeferredIterator(self, options)\n    this._operations.push({ iterator: it })\n    return it\n  }\n}\n\nDeferredLevelDOWN.prototype._serializeKey = function (key) {\n  return key\n}\n\nDeferredLevelDOWN.prototype._serializeValue = function (value) {\n  return value\n}\n\nmodule.exports = DeferredLevelDOWN\nmodule.exports.DeferredIterator = DeferredIterator\n","'use strict'\n\nexports.AbstractLevelDOWN = require('./abstract-leveldown')\nexports.AbstractIterator = require('./abstract-iterator')\nexports.AbstractChainedBatch = require('./abstract-chained-batch')\n","'use strict'\n\nconst supports = require('level-supports')\nconst isBuffer = require('is-buffer')\nconst AbstractIterator = require('./abstract-iterator')\nconst AbstractChainedBatch = require('./abstract-chained-batch')\nconst hasOwnProperty = Object.prototype.hasOwnProperty\nconst rangeOptions = ['lt', 'lte', 'gt', 'gte']\n\nfunction AbstractLevelDOWN (manifest) {\n  this.status = 'new'\n\n  // TODO (next major): make this mandatory\n  this.supports = supports(manifest, {\n    status: true\n  })\n}\n\nAbstractLevelDOWN.prototype.open = function (options, callback) {\n  const oldStatus = this.status\n\n  if (typeof options === 'function') callback = options\n\n  if (typeof callback !== 'function') {\n    throw new Error('open() requires a callback argument')\n  }\n\n  if (typeof options !== 'object' || options === null) options = {}\n\n  options.createIfMissing = options.createIfMissing !== false\n  options.errorIfExists = !!options.errorIfExists\n\n  this.status = 'opening'\n  this._open(options, (err) => {\n    if (err) {\n      this.status = oldStatus\n      return callback(err)\n    }\n    this.status = 'open'\n    callback()\n  })\n}\n\nAbstractLevelDOWN.prototype._open = function (options, callback) {\n  this._nextTick(callback)\n}\n\nAbstractLevelDOWN.prototype.close = function (callback) {\n  const oldStatus = this.status\n\n  if (typeof callback !== 'function') {\n    throw new Error('close() requires a callback argument')\n  }\n\n  this.status = 'closing'\n  this._close((err) => {\n    if (err) {\n      this.status = oldStatus\n      return callback(err)\n    }\n    this.status = 'closed'\n    callback()\n  })\n}\n\nAbstractLevelDOWN.prototype._close = function (callback) {\n  this._nextTick(callback)\n}\n\nAbstractLevelDOWN.prototype.get = function (key, options, callback) {\n  if (typeof options === 'function') callback = options\n\n  if (typeof callback !== 'function') {\n    throw new Error('get() requires a callback argument')\n  }\n\n  const err = this._checkKey(key)\n  if (err) return this._nextTick(callback, err)\n\n  key = this._serializeKey(key)\n\n  if (typeof options !== 'object' || options === null) options = {}\n\n  options.asBuffer = options.asBuffer !== false\n\n  this._get(key, options, callback)\n}\n\nAbstractLevelDOWN.prototype._get = function (key, options, callback) {\n  this._nextTick(function () { callback(new Error('NotFound')) })\n}\n\nAbstractLevelDOWN.prototype.put = function (key, value, options, callback) {\n  if (typeof options === 'function') callback = options\n\n  if (typeof callback !== 'function') {\n    throw new Error('put() requires a callback argument')\n  }\n\n  const err = this._checkKey(key) || this._checkValue(value)\n  if (err) return this._nextTick(callback, err)\n\n  key = this._serializeKey(key)\n  value = this._serializeValue(value)\n\n  if (typeof options !== 'object' || options === null) options = {}\n\n  this._put(key, value, options, callback)\n}\n\nAbstractLevelDOWN.prototype._put = function (key, value, options, callback) {\n  this._nextTick(callback)\n}\n\nAbstractLevelDOWN.prototype.del = function (key, options, callback) {\n  if (typeof options === 'function') callback = options\n\n  if (typeof callback !== 'function') {\n    throw new Error('del() requires a callback argument')\n  }\n\n  const err = this._checkKey(key)\n  if (err) return this._nextTick(callback, err)\n\n  key = this._serializeKey(key)\n\n  if (typeof options !== 'object' || options === null) options = {}\n\n  this._del(key, options, callback)\n}\n\nAbstractLevelDOWN.prototype._del = function (key, options, callback) {\n  this._nextTick(callback)\n}\n\nAbstractLevelDOWN.prototype.batch = function (array, options, callback) {\n  if (!arguments.length) return this._chainedBatch()\n\n  if (typeof options === 'function') callback = options\n\n  if (typeof array === 'function') callback = array\n\n  if (typeof callback !== 'function') {\n    throw new Error('batch(array) requires a callback argument')\n  }\n\n  if (!Array.isArray(array)) {\n    return this._nextTick(callback, new Error('batch(array) requires an array argument'))\n  }\n\n  if (array.length === 0) {\n    return this._nextTick(callback)\n  }\n\n  if (typeof options !== 'object' || options === null) options = {}\n\n  const serialized = new Array(array.length)\n\n  for (let i = 0; i < array.length; i++) {\n    if (typeof array[i] !== 'object' || array[i] === null) {\n      return this._nextTick(callback, new Error('batch(array) element must be an object and not `null`'))\n    }\n\n    const e = Object.assign({}, array[i])\n\n    if (e.type !== 'put' && e.type !== 'del') {\n      return this._nextTick(callback, new Error(\"`type` must be 'put' or 'del'\"))\n    }\n\n    const err = this._checkKey(e.key)\n    if (err) return this._nextTick(callback, err)\n\n    e.key = this._serializeKey(e.key)\n\n    if (e.type === 'put') {\n      const valueErr = this._checkValue(e.value)\n      if (valueErr) return this._nextTick(callback, valueErr)\n\n      e.value = this._serializeValue(e.value)\n    }\n\n    serialized[i] = e\n  }\n\n  this._batch(serialized, options, callback)\n}\n\nAbstractLevelDOWN.prototype._batch = function (array, options, callback) {\n  this._nextTick(callback)\n}\n\nAbstractLevelDOWN.prototype.clear = function (options, callback) {\n  if (typeof options === 'function') {\n    callback = options\n  } else if (typeof callback !== 'function') {\n    throw new Error('clear() requires a callback argument')\n  }\n\n  options = cleanRangeOptions(this, options)\n  options.reverse = !!options.reverse\n  options.limit = 'limit' in options ? options.limit : -1\n\n  this._clear(options, callback)\n}\n\nAbstractLevelDOWN.prototype._clear = function (options, callback) {\n  // Avoid setupIteratorOptions, would serialize range options a second time.\n  options.keys = true\n  options.values = false\n  options.keyAsBuffer = true\n  options.valueAsBuffer = true\n\n  const iterator = this._iterator(options)\n  const emptyOptions = {}\n\n  const next = (err) => {\n    if (err) {\n      return iterator.end(function () {\n        callback(err)\n      })\n    }\n\n    iterator.next((err, key) => {\n      if (err) return next(err)\n      if (key === undefined) return iterator.end(callback)\n\n      // This could be optimized by using a batch, but the default _clear\n      // is not meant to be fast. Implementations have more room to optimize\n      // if they override _clear. Note: using _del bypasses key serialization.\n      this._del(key, emptyOptions, next)\n    })\n  }\n\n  next()\n}\n\nAbstractLevelDOWN.prototype._setupIteratorOptions = function (options) {\n  options = cleanRangeOptions(this, options)\n\n  options.reverse = !!options.reverse\n  options.keys = options.keys !== false\n  options.values = options.values !== false\n  options.limit = 'limit' in options ? options.limit : -1\n  options.keyAsBuffer = options.keyAsBuffer !== false\n  options.valueAsBuffer = options.valueAsBuffer !== false\n\n  return options\n}\n\nfunction cleanRangeOptions (db, options) {\n  const result = {}\n\n  for (const k in options) {\n    if (!hasOwnProperty.call(options, k)) continue\n\n    if (k === 'start' || k === 'end') {\n      throw new Error('Legacy range options (\"start\" and \"end\") have been removed')\n    }\n\n    let opt = options[k]\n\n    if (isRangeOption(k)) {\n      // Note that we don't reject nullish and empty options here. While\n      // those types are invalid as keys, they are valid as range options.\n      opt = db._serializeKey(opt)\n    }\n\n    result[k] = opt\n  }\n\n  return result\n}\n\nfunction isRangeOption (k) {\n  return rangeOptions.indexOf(k) !== -1\n}\n\nAbstractLevelDOWN.prototype.iterator = function (options) {\n  if (typeof options !== 'object' || options === null) options = {}\n  options = this._setupIteratorOptions(options)\n  return this._iterator(options)\n}\n\nAbstractLevelDOWN.prototype._iterator = function (options) {\n  return new AbstractIterator(this)\n}\n\nAbstractLevelDOWN.prototype._chainedBatch = function () {\n  return new AbstractChainedBatch(this)\n}\n\nAbstractLevelDOWN.prototype._serializeKey = function (key) {\n  return key\n}\n\nAbstractLevelDOWN.prototype._serializeValue = function (value) {\n  return value\n}\n\nAbstractLevelDOWN.prototype._checkKey = function (key) {\n  if (key === null || key === undefined) {\n    return new Error('key cannot be `null` or `undefined`')\n  } else if (isBuffer(key) && key.length === 0) { // TODO: replace with typed array check\n    return new Error('key cannot be an empty Buffer')\n  } else if (key === '') {\n    return new Error('key cannot be an empty String')\n  } else if (Array.isArray(key) && key.length === 0) {\n    return new Error('key cannot be an empty Array')\n  }\n}\n\nAbstractLevelDOWN.prototype._checkValue = function (value) {\n  if (value === null || value === undefined) {\n    return new Error('value cannot be `null` or `undefined`')\n  }\n}\n\n// Expose browser-compatible nextTick for dependents\n// TODO: rename _nextTick to _queueMicrotask\n// TODO: after we drop node 10, also use queueMicrotask in node\nAbstractLevelDOWN.prototype._nextTick = require('./next-tick')\n\nmodule.exports = AbstractLevelDOWN\n","'use strict'\n\nmodule.exports = function supports (...manifests) {\n  const manifest = manifests.reduce((acc, m) => Object.assign(acc, m), {})\n\n  return Object.assign(manifest, {\n    // Features of abstract-leveldown\n    bufferKeys: manifest.bufferKeys || false,\n    snapshots: manifest.snapshots || false,\n    permanence: manifest.permanence || false,\n    seek: manifest.seek || false,\n    clear: manifest.clear || false,\n\n    // Features of abstract-leveldown that levelup doesn't have\n    status: manifest.status || false,\n\n    // Features of disk-based implementations\n    createIfMissing: manifest.createIfMissing || false,\n    errorIfExists: manifest.errorIfExists || false,\n\n    // Features of level(up) that abstract-leveldown doesn't have yet\n    deferredOpen: manifest.deferredOpen || false,\n    openCallback: manifest.openCallback || false,\n    promises: manifest.promises || false,\n    streams: manifest.streams || false,\n    encodings: manifest.encodings || false,\n\n    // Methods that are not part of abstract-leveldown or levelup\n    additionalMethods: Object.assign({}, manifest.additionalMethods)\n  })\n}\n","/*!\n * Determine if an object is a Buffer\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n\nmodule.exports = function isBuffer (obj) {\n  return obj != null && obj.constructor != null &&\n    typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj)\n}\n","'use strict'\n\nfunction AbstractIterator (db) {\n  if (typeof db !== 'object' || db === null) {\n    throw new TypeError('First argument must be an abstract-leveldown compliant store')\n  }\n\n  this.db = db\n  this._ended = false\n  this._nexting = false\n}\n\nAbstractIterator.prototype.next = function (callback) {\n  if (typeof callback !== 'function') {\n    throw new Error('next() requires a callback argument')\n  }\n\n  if (this._ended) {\n    this._nextTick(callback, new Error('cannot call next() after end()'))\n    return this\n  }\n\n  if (this._nexting) {\n    this._nextTick(callback, new Error('cannot call next() before previous next() has completed'))\n    return this\n  }\n\n  this._nexting = true\n  this._next((err, ...rest) => {\n    this._nexting = false\n    callback(err, ...rest)\n  })\n\n  return this\n}\n\nAbstractIterator.prototype._next = function (callback) {\n  this._nextTick(callback)\n}\n\nAbstractIterator.prototype.seek = function (target) {\n  if (this._ended) {\n    throw new Error('cannot call seek() after end()')\n  }\n  if (this._nexting) {\n    throw new Error('cannot call seek() before next() has completed')\n  }\n\n  target = this.db._serializeKey(target)\n  this._seek(target)\n}\n\nAbstractIterator.prototype._seek = function (target) {}\n\nAbstractIterator.prototype.end = function (callback) {\n  if (typeof callback !== 'function') {\n    throw new Error('end() requires a callback argument')\n  }\n\n  if (this._ended) {\n    return this._nextTick(callback, new Error('end() already called on iterator'))\n  }\n\n  this._ended = true\n  this._end(callback)\n}\n\nAbstractIterator.prototype._end = function (callback) {\n  this._nextTick(callback)\n}\n\n// Expose browser-compatible nextTick for dependents\nAbstractIterator.prototype._nextTick = require('./next-tick')\n\nmodule.exports = AbstractIterator\n","'use strict'\n\nconst queueMicrotask = require('queue-microtask')\n\nmodule.exports = function (fn, ...args) {\n  if (args.length === 0) {\n    queueMicrotask(fn)\n  } else {\n    queueMicrotask(() => fn(...args))\n  }\n}\n","/*! queue-microtask. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nlet promise\n\nmodule.exports = typeof queueMicrotask === 'function'\n  ? queueMicrotask.bind(typeof window !== 'undefined' ? window : global)\n  // reuse resolved promise, and allocate it lazily\n  : cb => (promise || (promise = Promise.resolve()))\n    .then(cb)\n    .catch(err => setTimeout(() => { throw err }, 0))\n","'use strict'\n\nconst emptyOptions = Object.freeze({})\n\nfunction AbstractChainedBatch (db) {\n  if (typeof db !== 'object' || db === null) {\n    throw new TypeError('First argument must be an abstract-leveldown compliant store')\n  }\n\n  this.db = db\n  this._operations = []\n  this._written = false\n}\n\nAbstractChainedBatch.prototype._checkWritten = function () {\n  if (this._written) {\n    throw new Error('write() already called on this batch')\n  }\n}\n\nAbstractChainedBatch.prototype.put = function (key, value, options) {\n  this._checkWritten()\n\n  const err = this.db._checkKey(key) || this.db._checkValue(value)\n  if (err) throw err\n\n  key = this.db._serializeKey(key)\n  value = this.db._serializeValue(value)\n\n  this._put(key, value, options != null ? options : emptyOptions)\n\n  return this\n}\n\nAbstractChainedBatch.prototype._put = function (key, value, options) {\n  this._operations.push({ ...options, type: 'put', key, value })\n}\n\nAbstractChainedBatch.prototype.del = function (key, options) {\n  this._checkWritten()\n\n  const err = this.db._checkKey(key)\n  if (err) throw err\n\n  key = this.db._serializeKey(key)\n  this._del(key, options != null ? options : emptyOptions)\n\n  return this\n}\n\nAbstractChainedBatch.prototype._del = function (key, options) {\n  this._operations.push({ ...options, type: 'del', key })\n}\n\nAbstractChainedBatch.prototype.clear = function () {\n  this._checkWritten()\n  this._clear()\n\n  return this\n}\n\nAbstractChainedBatch.prototype._clear = function () {\n  this._operations = []\n}\n\nAbstractChainedBatch.prototype.write = function (options, callback) {\n  this._checkWritten()\n\n  if (typeof options === 'function') {\n    callback = options\n  }\n  if (typeof callback !== 'function') {\n    throw new Error('write() requires a callback argument')\n  }\n  if (typeof options !== 'object' || options === null) {\n    options = {}\n  }\n\n  this._written = true\n  this._write(options, callback)\n}\n\nAbstractChainedBatch.prototype._write = function (options, callback) {\n  this.db._batch(this._operations, options, callback)\n}\n\n// Expose browser-compatible nextTick for dependents\nAbstractChainedBatch.prototype._nextTick = require('./next-tick')\n\nmodule.exports = AbstractChainedBatch\n","'use strict'\n\nconst AbstractIterator = require('abstract-leveldown').AbstractIterator\nconst inherits = require('inherits')\n\nfunction DeferredIterator (db, options) {\n  AbstractIterator.call(this, db)\n\n  this._options = options\n  this._iterator = null\n  this._operations = []\n}\n\ninherits(DeferredIterator, AbstractIterator)\n\nDeferredIterator.prototype.setDb = function (db) {\n  const it = this._iterator = db.iterator(this._options)\n\n  for (const op of this._operations) {\n    it[op.method](...op.args)\n  }\n}\n\nDeferredIterator.prototype._operation = function (method, args) {\n  if (this._iterator) return this._iterator[method](...args)\n  this._operations.push({ method, args })\n}\n\nfor (const m of ['next', 'end']) {\n  DeferredIterator.prototype['_' + m] = function (...args) {\n    this._operation(m, args)\n  }\n}\n\n// Must defer seek() rather than _seek() because it requires db._serializeKey to be available\nDeferredIterator.prototype.seek = function (...args) {\n  this._operation('seek', args)\n}\n\nmodule.exports = DeferredIterator\n","'use strict'\n\nconst inherits = require('inherits')\nconst { Readable } = require('readable-stream')\n\nmodule.exports = ReadStream\ninherits(ReadStream, Readable)\n\nfunction ReadStream (iterator, options) {\n  if (!(this instanceof ReadStream)) return new ReadStream(iterator, options)\n  options = options || {}\n  Readable.call(this, Object.assign({}, options, {\n    objectMode: true\n  }))\n  this._iterator = iterator\n  this._options = options\n  this.on('end', this.destroy.bind(this, null, null))\n}\n\nReadStream.prototype._read = function () {\n  if (this.destroyed) return\n\n  this._iterator.next((err, key, value) => {\n    if (this.destroyed) return\n    if (err) return this.destroy(err)\n\n    if (key === undefined && value === undefined) {\n      this.push(null)\n    } else if (this._options.keys !== false && this._options.values === false) {\n      this.push(key)\n    } else if (this._options.keys === false && this._options.values !== false) {\n      this.push(value)\n    } else {\n      this.push({ key, value })\n    }\n  })\n}\n\nReadStream.prototype._destroy = function (err, callback) {\n  this._iterator.end(function (err2) {\n    callback(err || err2)\n  })\n}\n","'use strict'\n\nconst WriteError = require('level-errors').WriteError\nconst catering = require('catering')\nconst getCallback = require('./common').getCallback\nconst getOptions = require('./common').getOptions\n\nfunction Batch (levelup) {\n  this.db = levelup\n  this.batch = levelup.db.batch()\n  this.ops = []\n  this.length = 0\n}\n\nBatch.prototype.put = function (key, value, options) {\n  try {\n    this.batch.put(key, value, options)\n  } catch (e) {\n    throw new WriteError(e)\n  }\n\n  this.ops.push({ ...options, type: 'put', key, value })\n  this.length++\n\n  return this\n}\n\nBatch.prototype.del = function (key, options) {\n  try {\n    this.batch.del(key, options)\n  } catch (err) {\n    throw new WriteError(err)\n  }\n\n  this.ops.push({ ...options, type: 'del', key })\n  this.length++\n\n  return this\n}\n\nBatch.prototype.clear = function () {\n  try {\n    this.batch.clear()\n  } catch (err) {\n    throw new WriteError(err)\n  }\n\n  this.ops = []\n  this.length = 0\n\n  return this\n}\n\nBatch.prototype.write = function (options, callback) {\n  const levelup = this.db\n  const ops = this.ops\n\n  callback = getCallback(options, callback)\n  callback = catering.fromCallback(callback)\n  options = getOptions(options)\n\n  try {\n    this.batch.write(options, function (err) {\n      if (err) { return callback(new WriteError(err)) }\n      levelup.emit('batch', ops)\n      callback()\n    })\n  } catch (err) {\n    throw new WriteError(err)\n  }\n\n  return callback.promise\n}\n\nmodule.exports = Batch\n","'use strict'\n\nconst createError = require('errno').create\nconst LevelUPError = createError('LevelUPError')\nconst NotFoundError = createError('NotFoundError', LevelUPError)\n\nNotFoundError.prototype.notFound = true\nNotFoundError.prototype.status = 404\n\nmodule.exports = {\n  LevelUPError: LevelUPError,\n  InitializationError: createError('InitializationError', LevelUPError),\n  OpenError: createError('OpenError', LevelUPError),\n  ReadError: createError('ReadError', LevelUPError),\n  WriteError: createError('WriteError', LevelUPError),\n  NotFoundError: NotFoundError,\n  EncodingError: createError('EncodingError', LevelUPError)\n}\n","var all = module.exports.all = [\n  {\n    errno: -2,\n    code: 'ENOENT',\n    description: 'no such file or directory'\n  },\n  {\n    errno: -1,\n    code: 'UNKNOWN',\n    description: 'unknown error'\n  },\n  {\n    errno: 0,\n    code: 'OK',\n    description: 'success'\n  },\n  {\n    errno: 1,\n    code: 'EOF',\n    description: 'end of file'\n  },\n  {\n    errno: 2,\n    code: 'EADDRINFO',\n    description: 'getaddrinfo error'\n  },\n  {\n    errno: 3,\n    code: 'EACCES',\n    description: 'permission denied'\n  },\n  {\n    errno: 4,\n    code: 'EAGAIN',\n    description: 'resource temporarily unavailable'\n  },\n  {\n    errno: 5,\n    code: 'EADDRINUSE',\n    description: 'address already in use'\n  },\n  {\n    errno: 6,\n    code: 'EADDRNOTAVAIL',\n    description: 'address not available'\n  },\n  {\n    errno: 7,\n    code: 'EAFNOSUPPORT',\n    description: 'address family not supported'\n  },\n  {\n    errno: 8,\n    code: 'EALREADY',\n    description: 'connection already in progress'\n  },\n  {\n    errno: 9,\n    code: 'EBADF',\n    description: 'bad file descriptor'\n  },\n  {\n    errno: 10,\n    code: 'EBUSY',\n    description: 'resource busy or locked'\n  },\n  {\n    errno: 11,\n    code: 'ECONNABORTED',\n    description: 'software caused connection abort'\n  },\n  {\n    errno: 12,\n    code: 'ECONNREFUSED',\n    description: 'connection refused'\n  },\n  {\n    errno: 13,\n    code: 'ECONNRESET',\n    description: 'connection reset by peer'\n  },\n  {\n    errno: 14,\n    code: 'EDESTADDRREQ',\n    description: 'destination address required'\n  },\n  {\n    errno: 15,\n    code: 'EFAULT',\n    description: 'bad address in system call argument'\n  },\n  {\n    errno: 16,\n    code: 'EHOSTUNREACH',\n    description: 'host is unreachable'\n  },\n  {\n    errno: 17,\n    code: 'EINTR',\n    description: 'interrupted system call'\n  },\n  {\n    errno: 18,\n    code: 'EINVAL',\n    description: 'invalid argument'\n  },\n  {\n    errno: 19,\n    code: 'EISCONN',\n    description: 'socket is already connected'\n  },\n  {\n    errno: 20,\n    code: 'EMFILE',\n    description: 'too many open files'\n  },\n  {\n    errno: 21,\n    code: 'EMSGSIZE',\n    description: 'message too long'\n  },\n  {\n    errno: 22,\n    code: 'ENETDOWN',\n    description: 'network is down'\n  },\n  {\n    errno: 23,\n    code: 'ENETUNREACH',\n    description: 'network is unreachable'\n  },\n  {\n    errno: 24,\n    code: 'ENFILE',\n    description: 'file table overflow'\n  },\n  {\n    errno: 25,\n    code: 'ENOBUFS',\n    description: 'no buffer space available'\n  },\n  {\n    errno: 26,\n    code: 'ENOMEM',\n    description: 'not enough memory'\n  },\n  {\n    errno: 27,\n    code: 'ENOTDIR',\n    description: 'not a directory'\n  },\n  {\n    errno: 28,\n    code: 'EISDIR',\n    description: 'illegal operation on a directory'\n  },\n  {\n    errno: 29,\n    code: 'ENONET',\n    description: 'machine is not on the network'\n  },\n  {\n    errno: 31,\n    code: 'ENOTCONN',\n    description: 'socket is not connected'\n  },\n  {\n    errno: 32,\n    code: 'ENOTSOCK',\n    description: 'socket operation on non-socket'\n  },\n  {\n    errno: 33,\n    code: 'ENOTSUP',\n    description: 'operation not supported on socket'\n  },\n  {\n    errno: 34,\n    code: 'ENOENT',\n    description: 'no such file or directory'\n  },\n  {\n    errno: 35,\n    code: 'ENOSYS',\n    description: 'function not implemented'\n  },\n  {\n    errno: 36,\n    code: 'EPIPE',\n    description: 'broken pipe'\n  },\n  {\n    errno: 37,\n    code: 'EPROTO',\n    description: 'protocol error'\n  },\n  {\n    errno: 38,\n    code: 'EPROTONOSUPPORT',\n    description: 'protocol not supported'\n  },\n  {\n    errno: 39,\n    code: 'EPROTOTYPE',\n    description: 'protocol wrong type for socket'\n  },\n  {\n    errno: 40,\n    code: 'ETIMEDOUT',\n    description: 'connection timed out'\n  },\n  {\n    errno: 41,\n    code: 'ECHARSET',\n    description: 'invalid Unicode character'\n  },\n  {\n    errno: 42,\n    code: 'EAIFAMNOSUPPORT',\n    description: 'address family for hostname not supported'\n  },\n  {\n    errno: 44,\n    code: 'EAISERVICE',\n    description: 'servname not supported for ai_socktype'\n  },\n  {\n    errno: 45,\n    code: 'EAISOCKTYPE',\n    description: 'ai_socktype not supported'\n  },\n  {\n    errno: 46,\n    code: 'ESHUTDOWN',\n    description: 'cannot send after transport endpoint shutdown'\n  },\n  {\n    errno: 47,\n    code: 'EEXIST',\n    description: 'file already exists'\n  },\n  {\n    errno: 48,\n    code: 'ESRCH',\n    description: 'no such process'\n  },\n  {\n    errno: 49,\n    code: 'ENAMETOOLONG',\n    description: 'name too long'\n  },\n  {\n    errno: 50,\n    code: 'EPERM',\n    description: 'operation not permitted'\n  },\n  {\n    errno: 51,\n    code: 'ELOOP',\n    description: 'too many symbolic links encountered'\n  },\n  {\n    errno: 52,\n    code: 'EXDEV',\n    description: 'cross-device link not permitted'\n  },\n  {\n    errno: 53,\n    code: 'ENOTEMPTY',\n    description: 'directory not empty'\n  },\n  {\n    errno: 54,\n    code: 'ENOSPC',\n    description: 'no space left on device'\n  },\n  {\n    errno: 55,\n    code: 'EIO',\n    description: 'i/o error'\n  },\n  {\n    errno: 56,\n    code: 'EROFS',\n    description: 'read-only file system'\n  },\n  {\n    errno: 57,\n    code: 'ENODEV',\n    description: 'no such device'\n  },\n  {\n    errno: 58,\n    code: 'ESPIPE',\n    description: 'invalid seek'\n  },\n  {\n    errno: 59,\n    code: 'ECANCELED',\n    description: 'operation canceled'\n  }\n]\n\nmodule.exports.errno = {}\nmodule.exports.code = {}\n\nall.forEach(function (error) {\n  module.exports.errno[error.errno] = error\n  module.exports.code[error.code] = error\n})\n\nmodule.exports.custom = require('./custom')(module.exports)\nmodule.exports.create = module.exports.custom.createError\n","var prr = require('prr')\n\nfunction init (type, message, cause) {\n  if (!!message && typeof message != 'string') {\n    message = message.message || message.name\n  }\n  prr(this, {\n      type    : type\n    , name    : type\n      // can be passed just a 'cause'\n    , cause   : typeof message != 'string' ? message : cause\n    , message : message\n  }, 'ewr')\n}\n\n// generic prototype, not intended to be actually used - helpful for `instanceof`\nfunction CustomError (message, cause) {\n  Error.call(this)\n  if (Error.captureStackTrace)\n    Error.captureStackTrace(this, this.constructor)\n  init.call(this, 'CustomError', message, cause)\n}\n\nCustomError.prototype = new Error()\n\nfunction createError (errno, type, proto) {\n  var err = function (message, cause) {\n    init.call(this, type, message, cause)\n    //TODO: the specificity here is stupid, errno should be available everywhere\n    if (type == 'FilesystemError') {\n      this.code    = this.cause.code\n      this.path    = this.cause.path\n      this.errno   = this.cause.errno\n      this.message =\n        (errno.errno[this.cause.errno]\n          ? errno.errno[this.cause.errno].description\n          : this.cause.message)\n        + (this.cause.path ? ' [' + this.cause.path + ']' : '')\n    }\n    Error.call(this)\n    if (Error.captureStackTrace)\n      Error.captureStackTrace(this, err)\n  }\n  err.prototype = !!proto ? new proto() : new CustomError()\n  return err\n}\n\nmodule.exports = function (errno) {\n  var ce = function (type, proto) {\n    return createError(errno, type, proto)\n  }\n  return {\n      CustomError     : CustomError\n    , FilesystemError : ce('FilesystemError')\n    , createError     : ce\n  }\n}\n","/*!\n  * prr\n  * (c) 2013 Rod Vagg <rod@vagg.org>\n  * https://github.com/rvagg/prr\n  * License: MIT\n  */\n\n(function (name, context, definition) {\n  if (typeof module != 'undefined' && module.exports)\n    module.exports = definition()\n  else\n    context[name] = definition()\n})('prr', this, function() {\n\n  var setProperty = typeof Object.defineProperty == 'function'\n      ? function (obj, key, options) {\n          Object.defineProperty(obj, key, options)\n          return obj\n        }\n      : function (obj, key, options) { // < es5\n          obj[key] = options.value\n          return obj\n        }\n\n    , makeOptions = function (value, options) {\n        var oo = typeof options == 'object'\n          , os = !oo && typeof options == 'string'\n          , op = function (p) {\n              return oo\n                ? !!options[p]\n                : os\n                  ? options.indexOf(p[0]) > -1\n                  : false\n            }\n\n        return {\n            enumerable   : op('enumerable')\n          , configurable : op('configurable')\n          , writable     : op('writable')\n          , value        : value\n        }\n      }\n\n    , prr = function (obj, key, value, options) {\n        var k\n\n        options = makeOptions(value, options)\n\n        if (typeof key == 'object') {\n          for (k in key) {\n            if (Object.hasOwnProperty.call(key, k)) {\n              options.value = key[k]\n              setProperty(obj, k, options)\n            }\n          }\n          return obj\n        }\n\n        return setProperty(obj, key, options)\n      }\n\n  return prr\n})","'use strict'\n\nexports.fromCallback = function (callback) {\n  if (callback === undefined) {\n    var promise = new Promise(function (resolve, reject) {\n      callback = function (err, res) {\n        if (err) reject(err)\n        else resolve(res)\n      }\n    })\n\n    callback.promise = promise\n  }\n\n  return callback\n}\n\nexports.fromPromise = function (promise, callback) {\n  if (callback === undefined) return promise\n\n  promise\n    .then(function (res) { process.nextTick(callback, null, res) })\n    .catch(function (err) { process.nextTick(callback, err) })\n}\n","'use strict'\n\nexports.getCallback = function (options, callback) {\n  return typeof options === 'function' ? options : callback\n}\n\nexports.getOptions = function (options) {\n  return typeof options === 'object' && options !== null ? options : {}\n}\n","'use strict'\n\nconst queueMicrotask = require('queue-microtask')\n\nmodule.exports = function (fn, ...args) {\n  if (args.length === 0) {\n    queueMicrotask(fn)\n  } else {\n    queueMicrotask(() => fn(...args))\n  }\n}\n","'use strict'\n\nconst AbstractLevelDOWN = require('abstract-leveldown').AbstractLevelDOWN\nconst AbstractChainedBatch = require('abstract-leveldown').AbstractChainedBatch\nconst AbstractIterator = require('abstract-leveldown').AbstractIterator\nconst inherits = require('inherits')\nconst Codec = require('level-codec')\nconst EncodingError = require('level-errors').EncodingError\nconst rangeMethods = ['approximateSize', 'compactRange']\n\nmodule.exports = DB\n\nfunction DB (db, opts) {\n  if (!(this instanceof DB)) return new DB(db, opts)\n\n  const manifest = db.supports || {}\n  const additionalMethods = manifest.additionalMethods || {}\n\n  AbstractLevelDOWN.call(this, manifest)\n\n  this.supports.encodings = true\n  this.supports.additionalMethods = {}\n\n  rangeMethods.forEach(function (m) {\n    // TODO (future major): remove this fallback\n    const fallback = typeof db[m] === 'function'\n\n    if (additionalMethods[m] || fallback) {\n      this.supports.additionalMethods[m] = true\n\n      this[m] = function (start, end, opts, cb) {\n        start = this.codec.encodeKey(start, opts)\n        end = this.codec.encodeKey(end, opts)\n        return this.db[m](start, end, opts, cb)\n      }\n    }\n  }, this)\n\n  opts = opts || {}\n  if (typeof opts.keyEncoding === 'undefined') opts.keyEncoding = 'utf8'\n  if (typeof opts.valueEncoding === 'undefined') opts.valueEncoding = 'utf8'\n\n  this.db = db\n  this.codec = new Codec(opts)\n}\n\ninherits(DB, AbstractLevelDOWN)\n\nDB.prototype.type = 'encoding-down'\n\nDB.prototype._serializeKey =\nDB.prototype._serializeValue = function (datum) {\n  return datum\n}\n\nDB.prototype._open = function (opts, cb) {\n  this.db.open(opts, cb)\n}\n\nDB.prototype._close = function (cb) {\n  this.db.close(cb)\n}\n\nDB.prototype._put = function (key, value, opts, cb) {\n  key = this.codec.encodeKey(key, opts)\n  value = this.codec.encodeValue(value, opts)\n  this.db.put(key, value, opts, cb)\n}\n\nDB.prototype._get = function (key, opts, cb) {\n  key = this.codec.encodeKey(key, opts)\n  opts.asBuffer = this.codec.valueAsBuffer(opts)\n\n  this.db.get(key, opts, (err, value) => {\n    if (err) return cb(err)\n\n    try {\n      value = this.codec.decodeValue(value, opts)\n    } catch (err) {\n      return cb(new EncodingError(err))\n    }\n\n    cb(null, value)\n  })\n}\n\nDB.prototype._del = function (key, opts, cb) {\n  key = this.codec.encodeKey(key, opts)\n  this.db.del(key, opts, cb)\n}\n\nDB.prototype._chainedBatch = function () {\n  return new Batch(this)\n}\n\nDB.prototype._batch = function (ops, opts, cb) {\n  ops = this.codec.encodeBatch(ops, opts)\n  this.db.batch(ops, opts, cb)\n}\n\nDB.prototype._iterator = function (opts) {\n  opts.keyAsBuffer = this.codec.keyAsBuffer(opts)\n  opts.valueAsBuffer = this.codec.valueAsBuffer(opts)\n  return new Iterator(this, opts)\n}\n\nDB.prototype._clear = function (opts, callback) {\n  opts = this.codec.encodeLtgt(opts)\n  this.db.clear(opts, callback)\n}\n\nfunction Iterator (db, opts) {\n  AbstractIterator.call(this, db)\n  this.codec = db.codec\n  this.keys = opts.keys\n  this.values = opts.values\n  this.opts = this.codec.encodeLtgt(opts)\n  this.it = db.db.iterator(this.opts)\n}\n\ninherits(Iterator, AbstractIterator)\n\nIterator.prototype._next = function (cb) {\n  this.it.next((err, key, value) => {\n    if (err) return cb(err)\n\n    try {\n      if (this.keys && typeof key !== 'undefined') {\n        key = this.codec.decodeKey(key, this.opts)\n      } else {\n        key = undefined\n      }\n\n      if (this.values && typeof value !== 'undefined') {\n        value = this.codec.decodeValue(value, this.opts)\n      } else {\n        value = undefined\n      }\n    } catch (err) {\n      return cb(new EncodingError(err))\n    }\n\n    cb(null, key, value)\n  })\n}\n\nIterator.prototype._seek = function (key) {\n  key = this.codec.encodeKey(key, this.opts)\n  this.it.seek(key)\n}\n\nIterator.prototype._end = function (cb) {\n  this.it.end(cb)\n}\n\nfunction Batch (db, codec) {\n  AbstractChainedBatch.call(this, db)\n  this.codec = db.codec\n  this.batch = db.db.batch()\n}\n\ninherits(Batch, AbstractChainedBatch)\n\nBatch.prototype._put = function (key, value, options) {\n  key = this.codec.encodeKey(key, options)\n  value = this.codec.encodeValue(value, options)\n  this.batch.put(key, value)\n}\n\nBatch.prototype._del = function (key, options) {\n  key = this.codec.encodeKey(key, options)\n  this.batch.del(key)\n}\n\nBatch.prototype._clear = function () {\n  this.batch.clear()\n}\n\nBatch.prototype._write = function (opts, cb) {\n  this.batch.write(opts, cb)\n}\n","'use strict'\n\nconst encodings = require('./lib/encodings')\nconst rangeOptions = new Set(['lt', 'gt', 'lte', 'gte'])\n\nmodule.exports = Codec\n\nfunction Codec (opts) {\n  if (!(this instanceof Codec)) {\n    return new Codec(opts)\n  }\n  this.opts = opts || {}\n  this.encodings = encodings\n}\n\nCodec.prototype._encoding = function (encoding) {\n  if (typeof encoding === 'string') encoding = encodings[encoding]\n  if (!encoding) encoding = encodings.id\n  return encoding\n}\n\nCodec.prototype._keyEncoding = function (opts, batchOpts) {\n  return this._encoding((batchOpts && batchOpts.keyEncoding) ||\n                        (opts && opts.keyEncoding) ||\n                        this.opts.keyEncoding)\n}\n\nCodec.prototype._valueEncoding = function (opts, batchOpts) {\n  return this._encoding((batchOpts && (batchOpts.valueEncoding || batchOpts.encoding)) ||\n                        (opts && (opts.valueEncoding || opts.encoding)) ||\n                        (this.opts.valueEncoding || this.opts.encoding))\n}\n\nCodec.prototype.encodeKey = function (key, opts, batchOpts) {\n  return this._keyEncoding(opts, batchOpts).encode(key)\n}\n\nCodec.prototype.encodeValue = function (value, opts, batchOpts) {\n  return this._valueEncoding(opts, batchOpts).encode(value)\n}\n\nCodec.prototype.decodeKey = function (key, opts) {\n  return this._keyEncoding(opts).decode(key)\n}\n\nCodec.prototype.decodeValue = function (value, opts) {\n  return this._valueEncoding(opts).decode(value)\n}\n\nCodec.prototype.encodeBatch = function (ops, opts) {\n  return ops.map((_op) => {\n    const op = {\n      type: _op.type,\n      key: this.encodeKey(_op.key, opts, _op)\n    }\n    if (this.keyAsBuffer(opts, _op)) op.keyEncoding = 'binary'\n    if (_op.prefix) op.prefix = _op.prefix\n    if ('value' in _op) {\n      op.value = this.encodeValue(_op.value, opts, _op)\n      if (this.valueAsBuffer(opts, _op)) op.valueEncoding = 'binary'\n    }\n    return op\n  })\n}\n\nCodec.prototype.encodeLtgt = function (ltgt) {\n  const ret = {}\n\n  for (const key of Object.keys(ltgt)) {\n    if (key === 'start' || key === 'end') {\n      throw new Error('Legacy range options (\"start\" and \"end\") have been removed')\n    }\n\n    ret[key] = rangeOptions.has(key)\n      ? this.encodeKey(ltgt[key], ltgt)\n      : ltgt[key]\n  }\n\n  return ret\n}\n\nCodec.prototype.createStreamDecoder = function (opts) {\n  if (opts.keys && opts.values) {\n    return (key, value) => {\n      return {\n        key: this.decodeKey(key, opts),\n        value: this.decodeValue(value, opts)\n      }\n    }\n  } else if (opts.keys) {\n    return (key) => {\n      return this.decodeKey(key, opts)\n    }\n  } else if (opts.values) {\n    return (_, value) => {\n      return this.decodeValue(value, opts)\n    }\n  } else {\n    return function () {}\n  }\n}\n\nCodec.prototype.keyAsBuffer = function (opts) {\n  return this._keyEncoding(opts).buffer\n}\n\nCodec.prototype.valueAsBuffer = function (opts) {\n  return this._valueEncoding(opts).buffer\n}\n","'use strict'\n\nconst { Buffer } = require('buffer')\n\nexports.utf8 = exports['utf-8'] = {\n  encode: function (data) {\n    return isBinary(data) ? data : String(data)\n  },\n  decode: identity,\n  buffer: false,\n  type: 'utf8'\n}\n\nexports.json = {\n  encode: JSON.stringify,\n  decode: JSON.parse,\n  buffer: false,\n  type: 'json'\n}\n\nexports.binary = {\n  encode: function (data) {\n    return isBinary(data) ? data : Buffer.from(data)\n  },\n  decode: identity,\n  buffer: true,\n  type: 'binary'\n}\n\nexports.none = {\n  encode: identity,\n  decode: identity,\n  buffer: false,\n  type: 'id'\n}\n\nexports.id = exports.none\n\nconst bufferEncodings = [\n  'hex',\n  'ascii',\n  'base64',\n  'ucs2',\n  'ucs-2',\n  'utf16le',\n  'utf-16le'\n]\n\nfor (const type of bufferEncodings) {\n  exports[type] = {\n    encode: function (data) {\n      return isBinary(data) ? data : Buffer.from(data, type)\n    },\n    decode: function (buffer) {\n      return buffer.toString(type)\n    },\n    buffer: true,\n    type: type\n  }\n}\n\nfunction identity (value) {\n  return value\n}\n\nfunction isBinary (data) {\n  return data === undefined || data === null || Buffer.isBuffer(data)\n}\n","/* global indexedDB */\n\n'use strict'\n\nmodule.exports = Level\n\nconst AbstractLevelDOWN = require('abstract-leveldown').AbstractLevelDOWN\nconst inherits = require('inherits')\nconst Iterator = require('./iterator')\nconst serialize = require('./util/serialize')\nconst deserialize = require('./util/deserialize')\nconst support = require('./util/support')\nconst clear = require('./util/clear')\nconst createKeyRange = require('./util/key-range')\n\nconst DEFAULT_PREFIX = 'level-js-'\n\nfunction Level (location, opts) {\n  if (!(this instanceof Level)) return new Level(location, opts)\n\n  AbstractLevelDOWN.call(this, {\n    bufferKeys: support.bufferKeys(indexedDB),\n    snapshots: true,\n    permanence: true,\n    clear: true\n  })\n\n  opts = opts || {}\n\n  if (typeof location !== 'string') {\n    throw new Error('constructor requires a location string argument')\n  }\n\n  this.location = location\n  this.prefix = opts.prefix == null ? DEFAULT_PREFIX : opts.prefix\n  this.version = parseInt(opts.version || 1, 10)\n}\n\ninherits(Level, AbstractLevelDOWN)\n\nLevel.prototype.type = 'level-js'\n\nLevel.prototype._open = function (options, callback) {\n  const req = indexedDB.open(this.prefix + this.location, this.version)\n\n  req.onerror = function () {\n    callback(req.error || new Error('unknown error'))\n  }\n\n  req.onsuccess = () => {\n    this.db = req.result\n    callback()\n  }\n\n  req.onupgradeneeded = (ev) => {\n    const db = ev.target.result\n\n    if (!db.objectStoreNames.contains(this.location)) {\n      db.createObjectStore(this.location)\n    }\n  }\n}\n\nLevel.prototype.store = function (mode) {\n  const transaction = this.db.transaction([this.location], mode)\n  return transaction.objectStore(this.location)\n}\n\nLevel.prototype.await = function (request, callback) {\n  const transaction = request.transaction\n\n  // Take advantage of the fact that a non-canceled request error aborts\n  // the transaction. I.e. no need to listen for \"request.onerror\".\n  transaction.onabort = function () {\n    callback(transaction.error || new Error('aborted by user'))\n  }\n\n  transaction.oncomplete = function () {\n    callback(null, request.result)\n  }\n}\n\nLevel.prototype._get = function (key, options, callback) {\n  const store = this.store('readonly')\n  let req\n\n  try {\n    req = store.get(key)\n  } catch (err) {\n    return this._nextTick(callback, err)\n  }\n\n  this.await(req, function (err, value) {\n    if (err) return callback(err)\n\n    if (value === undefined) {\n      // 'NotFound' error, consistent with LevelDOWN API\n      return callback(new Error('NotFound'))\n    }\n\n    callback(null, deserialize(value, options.asBuffer))\n  })\n}\n\nLevel.prototype._del = function (key, options, callback) {\n  const store = this.store('readwrite')\n  let req\n\n  try {\n    req = store.delete(key)\n  } catch (err) {\n    return this._nextTick(callback, err)\n  }\n\n  this.await(req, callback)\n}\n\nLevel.prototype._put = function (key, value, options, callback) {\n  const store = this.store('readwrite')\n  let req\n\n  try {\n    // Will throw a DataError or DataCloneError if the environment\n    // does not support serializing the key or value respectively.\n    req = store.put(value, key)\n  } catch (err) {\n    return this._nextTick(callback, err)\n  }\n\n  this.await(req, callback)\n}\n\nLevel.prototype._serializeKey = function (key) {\n  return serialize(key, this.supports.bufferKeys)\n}\n\nLevel.prototype._serializeValue = function (value) {\n  return serialize(value, true)\n}\n\nLevel.prototype._iterator = function (options) {\n  return new Iterator(this, this.location, options)\n}\n\nLevel.prototype._batch = function (operations, options, callback) {\n  if (operations.length === 0) return this._nextTick(callback)\n\n  const store = this.store('readwrite')\n  const transaction = store.transaction\n  let index = 0\n  let error\n\n  transaction.onabort = function () {\n    callback(error || transaction.error || new Error('aborted by user'))\n  }\n\n  transaction.oncomplete = function () {\n    callback()\n  }\n\n  // Wait for a request to complete before making the next, saving CPU.\n  function loop () {\n    const op = operations[index++]\n    const key = op.key\n\n    let req\n\n    try {\n      req = op.type === 'del' ? store.delete(key) : store.put(op.value, key)\n    } catch (err) {\n      error = err\n      transaction.abort()\n      return\n    }\n\n    if (index < operations.length) {\n      req.onsuccess = loop\n    }\n  }\n\n  loop()\n}\n\nLevel.prototype._clear = function (options, callback) {\n  let keyRange\n  let req\n\n  try {\n    keyRange = createKeyRange(options)\n  } catch (e) {\n    // The lower key is greater than the upper key.\n    // IndexedDB throws an error, but we'll just do nothing.\n    return this._nextTick(callback)\n  }\n\n  if (options.limit >= 0) {\n    // IDBObjectStore#delete(range) doesn't have such an option.\n    // Fall back to cursor-based implementation.\n    return clear(this, this.location, keyRange, options, callback)\n  }\n\n  try {\n    const store = this.store('readwrite')\n    req = keyRange ? store.delete(keyRange) : store.clear()\n  } catch (err) {\n    return this._nextTick(callback, err)\n  }\n\n  this.await(req, callback)\n}\n\nLevel.prototype._close = function (callback) {\n  this.db.close()\n  this._nextTick(callback)\n}\n\n// NOTE: remove in a next major release\nLevel.prototype.upgrade = function (callback) {\n  if (this.status !== 'open') {\n    return this._nextTick(callback, new Error('cannot upgrade() before open()'))\n  }\n\n  const it = this.iterator()\n  const batchOptions = {}\n  const self = this\n\n  it._deserializeKey = it._deserializeValue = identity\n  next()\n\n  function next (err) {\n    if (err) return finish(err)\n    it.next(each)\n  }\n\n  function each (err, key, value) {\n    if (err || key === undefined) {\n      return finish(err)\n    }\n\n    const newKey = self._serializeKey(deserialize(key, true))\n    const newValue = self._serializeValue(deserialize(value, true))\n\n    // To bypass serialization on the old key, use _batch() instead of batch().\n    // NOTE: if we disable snapshotting (#86) this could lead to a loop of\n    // inserting and then iterating those same entries, because the new keys\n    // possibly sort after the old keys.\n    self._batch([\n      { type: 'del', key: key },\n      { type: 'put', key: newKey, value: newValue }\n    ], batchOptions, next)\n  }\n\n  function finish (err) {\n    it.end(function (err2) {\n      callback(err || err2)\n    })\n  }\n\n  function identity (data) {\n    return data\n  }\n}\n\nLevel.destroy = function (location, prefix, callback) {\n  if (typeof prefix === 'function') {\n    callback = prefix\n    prefix = DEFAULT_PREFIX\n  }\n  const request = indexedDB.deleteDatabase(prefix + location)\n  request.onsuccess = function () {\n    callback()\n  }\n  request.onerror = function (err) {\n    callback(err)\n  }\n}\n","'use strict'\n\nconst inherits = require('inherits')\nconst AbstractIterator = require('abstract-leveldown').AbstractIterator\nconst createKeyRange = require('./util/key-range')\nconst deserialize = require('./util/deserialize')\nconst noop = function () {}\n\nmodule.exports = Iterator\n\nfunction Iterator (db, location, options) {\n  AbstractIterator.call(this, db)\n\n  this._limit = options.limit\n  this._count = 0\n  this._callback = null\n  this._cache = []\n  this._completed = false\n  this._aborted = false\n  this._error = null\n  this._transaction = null\n\n  this._keys = options.keys\n  this._values = options.values\n  this._keyAsBuffer = options.keyAsBuffer\n  this._valueAsBuffer = options.valueAsBuffer\n\n  if (this._limit === 0) {\n    this._completed = true\n    return\n  }\n\n  let keyRange\n\n  try {\n    keyRange = createKeyRange(options)\n  } catch (e) {\n    // The lower key is greater than the upper key.\n    // IndexedDB throws an error, but we'll just return 0 results.\n    this._completed = true\n    return\n  }\n\n  this.createIterator(location, keyRange, options.reverse)\n}\n\ninherits(Iterator, AbstractIterator)\n\nIterator.prototype.createIterator = function (location, keyRange, reverse) {\n  const transaction = this.db.db.transaction([location], 'readonly')\n  const store = transaction.objectStore(location)\n  const req = store.openCursor(keyRange, reverse ? 'prev' : 'next')\n\n  req.onsuccess = (ev) => {\n    const cursor = ev.target.result\n    if (cursor) this.onItem(cursor)\n  }\n\n  this._transaction = transaction\n\n  // If an error occurs (on the request), the transaction will abort.\n  transaction.onabort = () => {\n    this.onAbort(this._transaction.error || new Error('aborted by user'))\n  }\n\n  transaction.oncomplete = () => {\n    this.onComplete()\n  }\n}\n\nIterator.prototype.onItem = function (cursor) {\n  this._cache.push(cursor.key, cursor.value)\n\n  if (this._limit <= 0 || ++this._count < this._limit) {\n    cursor.continue()\n  }\n\n  this.maybeNext()\n}\n\nIterator.prototype.onAbort = function (err) {\n  this._aborted = true\n  this._error = err\n  this.maybeNext()\n}\n\nIterator.prototype.onComplete = function () {\n  this._completed = true\n  this.maybeNext()\n}\n\nIterator.prototype.maybeNext = function () {\n  if (this._callback) {\n    this._next(this._callback)\n    this._callback = null\n  }\n}\n\nIterator.prototype._next = function (callback) {\n  if (this._aborted) {\n    // The error should be picked up by either next() or end().\n    const err = this._error\n    this._error = null\n    this._nextTick(callback, err)\n  } else if (this._cache.length > 0) {\n    let key = this._cache.shift()\n    let value = this._cache.shift()\n\n    if (this._keys && key !== undefined) {\n      key = this._deserializeKey(key, this._keyAsBuffer)\n    } else {\n      key = undefined\n    }\n\n    if (this._values && value !== undefined) {\n      value = this._deserializeValue(value, this._valueAsBuffer)\n    } else {\n      value = undefined\n    }\n\n    this._nextTick(callback, null, key, value)\n  } else if (this._completed) {\n    this._nextTick(callback)\n  } else {\n    this._callback = callback\n  }\n}\n\n// Exposed for the v4 to v5 upgrade utility\nIterator.prototype._deserializeKey = deserialize\nIterator.prototype._deserializeValue = deserialize\n\nIterator.prototype._end = function (callback) {\n  if (this._aborted || this._completed) {\n    return this._nextTick(callback, this._error)\n  }\n\n  // Don't advance the cursor anymore, and the transaction will complete\n  // on its own in the next tick. This approach is much cleaner than calling\n  // transaction.abort() with its unpredictable event order.\n  this.onItem = noop\n  this.onAbort = callback\n  this.onComplete = callback\n}\n","/* global IDBKeyRange */\n\n'use strict'\n\nconst ltgt = require('ltgt')\nconst NONE = Symbol('none')\n\nmodule.exports = function createKeyRange (options) {\n  const lower = ltgt.lowerBound(options, NONE)\n  const upper = ltgt.upperBound(options, NONE)\n  const lowerOpen = ltgt.lowerBoundExclusive(options, NONE)\n  const upperOpen = ltgt.upperBoundExclusive(options, NONE)\n\n  if (lower !== NONE && upper !== NONE) {\n    return IDBKeyRange.bound(lower, upper, lowerOpen, upperOpen)\n  } else if (lower !== NONE) {\n    return IDBKeyRange.lowerBound(lower, lowerOpen)\n  } else if (upper !== NONE) {\n    return IDBKeyRange.upperBound(upper, upperOpen)\n  } else {\n    return null\n  }\n}\n","\nexports.compare = function (a, b) {\n\n  if(Buffer.isBuffer(a)) {\n    var l = Math.min(a.length, b.length)\n    for(var i = 0; i < l; i++) {\n      var cmp = a[i] - b[i]\n      if(cmp) return cmp\n    }\n    return a.length - b.length\n  }\n\n  return a < b ? -1 : a > b ? 1 : 0\n}\n\n// to be compatible with the current abstract-leveldown tests\n// nullish or empty strings.\n// I could use !!val but I want to permit numbers and booleans,\n// if possible.\n\nfunction isDef (val) {\n  return val !== undefined && val !== ''\n}\n\nfunction has (range, name) {\n  return Object.hasOwnProperty.call(range, name)\n}\n\nfunction hasKey(range, name) {\n  return Object.hasOwnProperty.call(range, name) && name\n}\n\nvar lowerBoundKey = exports.lowerBoundKey = function (range) {\n    return (\n       hasKey(range, 'gt')\n    || hasKey(range, 'gte')\n    || hasKey(range, 'min')\n    || (range.reverse ? hasKey(range, 'end') : hasKey(range, 'start'))\n    || undefined\n    )\n}\n\nvar lowerBound = exports.lowerBound = function (range, def) {\n  var k = lowerBoundKey(range)\n  return k ? range[k] : def\n}\n\nvar lowerBoundInclusive = exports.lowerBoundInclusive = function (range) {\n  return has(range, 'gt') ? false : true\n}\n\nvar upperBoundInclusive = exports.upperBoundInclusive =\n  function (range) {\n    return (has(range, 'lt') /*&& !range.maxEx*/) ? false : true\n  }\n\nvar lowerBoundExclusive = exports.lowerBoundExclusive =\n  function (range) {\n    return !lowerBoundInclusive(range)\n  }\n\nvar upperBoundExclusive = exports.upperBoundExclusive =\n  function (range) {\n    return !upperBoundInclusive(range)\n  }\n\nvar upperBoundKey = exports.upperBoundKey = function (range) {\n    return (\n       hasKey(range, 'lt')\n    || hasKey(range, 'lte')\n    || hasKey(range, 'max')\n    || (range.reverse ? hasKey(range, 'start') : hasKey(range, 'end'))\n    || undefined\n    )\n}\n\nvar upperBound = exports.upperBound = function (range, def) {\n  var k = upperBoundKey(range)\n  return k ? range[k] : def\n}\n\nexports.start = function (range, def) {\n  return range.reverse ? upperBound(range, def) : lowerBound(range, def)\n}\nexports.end = function (range, def) {\n  return range.reverse ? lowerBound(range, def) : upperBound(range, def)\n}\nexports.startInclusive = function (range) {\n  return (\n    range.reverse\n  ? upperBoundInclusive(range)\n  : lowerBoundInclusive(range)\n  )\n}\nexports.endInclusive = function (range) {\n  return (\n    range.reverse\n  ? lowerBoundInclusive(range)\n  : upperBoundInclusive(range)\n  )\n}\n\nfunction id (e) { return e }\n\nexports.toLtgt = function (range, _range, map, lower, upper) {\n  _range = _range || {}\n  map = map || id\n  var defaults = arguments.length > 3\n  var lb = exports.lowerBoundKey(range)\n  var ub = exports.upperBoundKey(range)\n  if(lb) {\n    if(lb === 'gt') _range.gt = map(range.gt, false)\n    else            _range.gte = map(range[lb], false)\n  }\n  else if(defaults)\n    _range.gte = map(lower, false)\n\n  if(ub) {\n    if(ub === 'lt') _range.lt = map(range.lt, true)\n    else            _range.lte = map(range[ub], true)\n  }\n  else if(defaults)\n    _range.lte = map(upper, true)\n\n  if(range.reverse != null)\n    _range.reverse = !!range.reverse\n\n  //if range was used mutably\n  //(in level-sublevel it's part of an options object\n  //that has more properties on it.)\n  if(has(_range, 'max'))   delete _range.max\n  if(has(_range, 'min'))   delete _range.min\n  if(has(_range, 'start')) delete _range.start\n  if(has(_range, 'end'))   delete _range.end\n\n  return _range\n}\n\nexports.contains = function (range, key, compare) {\n  compare = compare || exports.compare\n\n  var lb = lowerBound(range)\n  if(isDef(lb)) {\n    var cmp = compare(key, lb)\n    if(cmp < 0 || (cmp === 0 && lowerBoundExclusive(range)))\n      return false\n  }\n\n  var ub = upperBound(range)\n  if(isDef(ub)) {\n    var cmp = compare(key, ub)\n    if(cmp > 0 || (cmp === 0) && upperBoundExclusive(range))\n      return false\n  }\n\n  return true\n}\n\nexports.filter = function (range, compare) {\n  return function (key) {\n    return exports.contains(range, key, compare)\n  }\n}\n\n\n","'use strict'\n\nconst Buffer = require('buffer').Buffer\nconst ta2str = (function () {\n  if (global.TextDecoder) {\n    const decoder = new TextDecoder('utf-8')\n    return decoder.decode.bind(decoder)\n  } else {\n    return function ta2str (ta) {\n      return ta2buf(ta).toString()\n    }\n  }\n})()\n\nconst ab2str = (function () {\n  if (global.TextDecoder) {\n    const decoder = new TextDecoder('utf-8')\n    return decoder.decode.bind(decoder)\n  } else {\n    return function ab2str (ab) {\n      return Buffer.from(ab).toString()\n    }\n  }\n})()\n\nfunction ta2buf (ta) {\n  const buf = Buffer.from(ta.buffer)\n\n  if (ta.byteLength === ta.buffer.byteLength) {\n    return buf\n  } else {\n    return buf.slice(ta.byteOffset, ta.byteOffset + ta.byteLength)\n  }\n}\n\nmodule.exports = function (data, asBuffer) {\n  if (data instanceof Uint8Array) {\n    return asBuffer ? ta2buf(data) : ta2str(data)\n  } else if (data instanceof ArrayBuffer) {\n    return asBuffer ? Buffer.from(data) : ab2str(data)\n  } else {\n    return asBuffer ? Buffer.from(String(data)) : String(data)\n  }\n}\n","'use strict'\n\nconst Buffer = require('buffer').Buffer\n// Returns either a Uint8Array or Buffer (doesn't matter to\n// IndexedDB, because Buffer is a subclass of Uint8Array)\nconst str2bin = (function () {\n  if (global.TextEncoder) {\n    const encoder = new TextEncoder('utf-8')\n    return encoder.encode.bind(encoder)\n  } else {\n    return Buffer.from\n  }\n})()\n\nmodule.exports = function (data, asBuffer) {\n  if (asBuffer) {\n    return Buffer.isBuffer(data) ? data : str2bin(String(data))\n  } else {\n    return String(data)\n  }\n}\n","'use strict'\n\nconst Buffer = require('buffer').Buffer\n\nexports.test = function (key) {\n  return function test (impl) {\n    try {\n      impl.cmp(key, 0)\n      return true\n    } catch (err) {\n      return false\n    }\n  }\n}\n\n// Detect binary key support (IndexedDB Second Edition)\nexports.bufferKeys = exports.test(Buffer.alloc(0))\n","'use strict'\n\nmodule.exports = function clear (db, location, keyRange, options, callback) {\n  if (options.limit === 0) return db._nextTick(callback)\n\n  const transaction = db.db.transaction([location], 'readwrite')\n  const store = transaction.objectStore(location)\n  let count = 0\n\n  transaction.oncomplete = function () {\n    callback()\n  }\n\n  transaction.onabort = function () {\n    callback(transaction.error || new Error('aborted by user'))\n  }\n\n  // A key cursor is faster (skips reading values) but not supported by IE\n  const method = store.openKeyCursor ? 'openKeyCursor' : 'openCursor'\n  const direction = options.reverse ? 'prev' : 'next'\n\n  store[method](keyRange, direction).onsuccess = function (ev) {\n    const cursor = ev.target.result\n\n    if (cursor) {\n      // Wait for a request to complete before continuing, saving CPU.\n      store.delete(cursor.key).onsuccess = function () {\n        if (options.limit <= 0 || ++count < options.limit) {\n          cursor.continue()\n        }\n      }\n    }\n  }\n}\n","'use strict'\n\n// Default configuration for the datastore spec in node.js\nmodule.exports = {\n  Spec: {\n    type: 'mount',\n    mounts: [\n      {\n        mountpoint: '/blocks',\n        type: 'measure',\n        prefix: 'flatfs.datastore',\n        child: {\n          type: 'flatfs',\n          path: 'blocks',\n          sync: true,\n          shardFunc: '/repo/flatfs/shard/v1/next-to-last/2'\n        }\n      },\n      {\n        mountpoint: '/',\n        type: 'measure',\n        prefix: 'leveldb.datastore',\n        child: {\n          type: 'levelds',\n          path: 'datastore',\n          compression: 'none'\n        }\n      }\n    ]\n  }\n}\n","'use strict'\n\nconst errors = require('./errors')\nconst debug = require('debug')\n\nconst log = debug('ipfs:repo:lock')\n\nconst lockFile = 'repo.lock'\n\n/** @type {Record<string,boolean>} */\nconst LOCKS = {}\n\n/**\n * @typedef {import('./types').LockCloser} LockCloser\n */\n\n/**\n * Lock the repo in the given dir.\n *\n * @param {string} dir\n * @returns {Promise<LockCloser>}\n */\nexports.lock = async (dir) => {\n  const file = dir + '/' + lockFile\n  log('locking %s', file)\n\n  if (LOCKS[file] === true) {\n    throw new errors.LockExistsError(`Lock already being held for file: ${file}`)\n  }\n\n  LOCKS[file] = true\n  const closer = {\n    async close () {\n      if (LOCKS[file]) {\n        delete LOCKS[file]\n      }\n    }\n  }\n  return closer\n}\n\n/**\n * Check if the repo in the given directory is locked.\n *\n * @param {string} dir\n * @returns {Promise<boolean>}\n */\nexports.locked = async (dir) => {\n  const file = dir + '/' + lockFile\n  log(`checking lock: ${file}`)\n\n  return Boolean(LOCKS[file])\n}\n","'use strict'\n\nconst createBW = require('./bw')\nconst createRepo = require('../repo/stat')\nconst createBitswap = require('../bitswap/stat')\n\nclass StatsAPI {\n  /**\n   * @param {Object} config\n   * @param {import('ipfs-repo')} config.repo\n   * @param {import('../../types').NetworkService} config.network\n   */\n  constructor ({ repo, network }) {\n    this.repo = createRepo({ repo })\n    this.bw = createBW({ network })\n    this.bitswap = createBitswap({ network })\n  }\n}\n\nmodule.exports = StatsAPI\n","'use strict'\n\nconst { default: parseDuration } = require('parse-duration')\nconst errCode = require('err-code')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @typedef {Object} BWOptions\n * @property {PeerId} [peer] - Specifies a peer to print bandwidth for\n * @property {string} [proto] - Specifies a protocol to print bandwidth for\n * @property {boolean} [poll] - Is used to yield bandwidth info at an interval\n * @property {number|string} [interval=1000] - The time interval to wait between updating output, if `poll` is `true`.\n *\n * @typedef {Object} BandwidthInfo\n * @property {bigint} totalIn\n * @property {bigint} totalOut\n * @property {bigint} rateIn\n * @property {bigint} rateOut\n *\n * @typedef {import('libp2p')} libp2p\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('cids')} CID\n * @typedef {import('ipfs-core-types/src/utils').AbortOptions} AbortOptions\n */\n\n/**\n * @param {libp2p} libp2p\n * @param {BWOptions} opts\n * @returns {BandwidthInfo}\n */\nfunction getBandwidthStats (libp2p, opts) {\n  let stats\n\n  if (!libp2p.metrics) {\n    stats = undefined\n  } else if (opts.peer) {\n    stats = libp2p.metrics.forPeer(opts.peer)\n  } else if (opts.proto) {\n    stats = libp2p.metrics.forProtocol(opts.proto)\n  } else {\n    stats = libp2p.metrics.global\n  }\n\n  if (!stats) {\n    return {\n      totalIn: BigInt(0),\n      totalOut: BigInt(0),\n      rateIn: BigInt(0),\n      rateOut: BigInt(0)\n    }\n  }\n\n  const { movingAverages, snapshot } = stats\n\n  return {\n    totalIn: BigInt(snapshot.dataReceived.toString()),\n    totalOut: BigInt(snapshot.dataSent.toString()),\n    rateIn: BigInt(movingAverages.dataReceived[60000].movingAverage() / 60),\n    rateOut: BigInt(movingAverages.dataSent[60000].movingAverage() / 60)\n  }\n}\n\n/**\n * @param {Object} config\n * @param {import('../../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/stats').API[\"bw\"]}\n   */\n  const bw = async function * (options = {}) {\n    const { libp2p } = await network.use(options)\n\n    if (!options.poll) {\n      yield getBandwidthStats(libp2p, options)\n      return\n    }\n\n    const interval = options.interval || 1000\n    let ms = -1\n    try {\n      ms = typeof interval === 'string' ? parseDuration(interval) || -1 : interval\n      if (!ms || ms < 0) throw new Error('invalid duration')\n    } catch (err) {\n      throw errCode(err, 'ERR_INVALID_POLL_INTERVAL')\n    }\n\n    let timeoutId\n    try {\n      while (true) {\n        yield getBandwidthStats(libp2p, options)\n        // eslint-disable-next-line no-loop-func\n        await new Promise(resolve => { timeoutId = setTimeout(resolve, ms) })\n      }\n    } finally {\n      clearTimeout(timeoutId)\n    }\n  }\n\n  return withTimeoutOption(bw)\n}\n","'use strict'\n\nconst map = require('it-map')\nconst errcode = require('err-code')\n\n/**\n * @typedef {import('ipfs-repo')} IPFSRepo\n * @typedef {import('ipld-block')} Block\n * @typedef {import('cids')} CID\n */\n\n/**\n * BlockService is a hybrid block datastore. It stores data in a local\n * datastore and may retrieve data from a remote Exchange.\n * It uses an internal `datastore.Datastore` instance to store values.\n */\nclass BlockService {\n  /**\n   * Create a new BlockService\n   *\n   * @param {IPFSRepo} ipfsRepo\n   */\n  constructor (ipfsRepo) {\n    this._repo = ipfsRepo\n    this._bitswap = null\n  }\n\n  /**\n   * Add a bitswap instance that communicates with the\n   * network to retreive blocks that are not in the local store.\n   *\n   * If the node is online all requests for blocks first\n   * check locally and afterwards ask the network for the blocks.\n   *\n   * @param {any} bitswap\n   */\n  setExchange (bitswap) {\n    this._bitswap = bitswap\n  }\n\n  /**\n   * Go offline, i.e. drop the reference to bitswap.\n   */\n  unsetExchange () {\n    this._bitswap = null\n  }\n\n  /**\n   * Is the blockservice online, i.e. is bitswap present.\n   */\n  hasExchange () {\n    return this._bitswap != null\n  }\n\n  /**\n   * Put a block to the underlying datastore.\n   *\n   * @param {Block} block\n   * @param {object} [options] -  Options is an object with the following properties\n   * @param {AbortSignal} [options.signal] - A signal that can be used to abort any long-lived operations that are started as a result of this operation\n   * @returns {Promise<Block>}\n   */\n  put (block, options) {\n    if (this.hasExchange()) {\n      return this._bitswap.put(block, options)\n    } else {\n      return this._repo.blocks.put(block, options)\n    }\n  }\n\n  /**\n   * Put a multiple blocks to the underlying datastore.\n   *\n   * @param {AsyncIterable<Block> | Iterable<Block>} blocks\n   * @param {object} [options] -  Options is an object with the following properties\n   * @param {AbortSignal} [options.signal] - A signal that can be used to abort any long-lived operations that are started as a result of this operation\n   * @returns {AsyncIterable<Block>}\n   */\n  putMany (blocks, options) {\n    if (this.hasExchange()) {\n      return this._bitswap.putMany(blocks, options)\n    } else {\n      return this._repo.blocks.putMany(blocks, options)\n    }\n  }\n\n  /**\n   * Get a block by cid.\n   *\n   * @param {CID} cid\n   * @param {object} [options] -  Options is an object with the following properties\n   * @param {AbortSignal} [options.signal] - A signal that can be used to abort any long-lived operations that are started as a result of this operation\n   * @returns {Promise<Block>}\n   */\n  get (cid, options) {\n    if (this.hasExchange()) {\n      return this._bitswap.get(cid, options)\n    } else {\n      return this._repo.blocks.get(cid, options)\n    }\n  }\n\n  /**\n   * Get multiple blocks back from an array of cids.\n   *\n   * @param {AsyncIterable<CID> | Iterable<CID>} cids\n   * @param {object} [options] -  Options is an object with the following properties\n   * @param {AbortSignal} [options.signal] - A signal that can be used to abort any long-lived operations that are started as a result of this operation\n   * @returns {AsyncIterable<Block>}\n   */\n  getMany (cids, options) {\n    if (!Array.isArray(cids)) {\n      throw new Error('first arg must be an array of cids')\n    }\n\n    if (this.hasExchange()) {\n      return this._bitswap.getMany(cids, options)\n    } else {\n      return map(cids, (cid) => this._repo.blocks.get(cid, options))\n    }\n  }\n\n  /**\n   * Delete a block from the blockstore.\n   *\n   * @param {CID} cid\n   * @param {object} [options] -  Options is an object with the following properties\n   * @param {AbortSignal} [options.signal] - A signal that can be used to abort any long-lived operations that are started as a result of this operation\n   */\n  async delete (cid, options) {\n    if (!await this._repo.blocks.has(cid)) {\n      throw errcode(new Error('blockstore: block not found'), 'ERR_BLOCK_NOT_FOUND')\n    }\n\n    return this._repo.blocks.delete(cid, options)\n  }\n\n  /**\n   * Delete multiple blocks from the blockstore.\n   *\n   * @param {AsyncIterable<CID> | Iterable<CID>} cids\n   * @param {object} [options] -  Options is an object with the following properties\n   * @param {AbortSignal} [options.signal] - A signal that can be used to abort any long-lived operations that are started as a result of this operation\n   */\n  deleteMany (cids, options) {\n    const repo = this._repo\n\n    return this._repo.blocks.deleteMany((async function * () {\n      for await (const cid of cids) {\n        if (!await repo.blocks.has(cid)) {\n          throw errcode(new Error('blockstore: block not found'), 'ERR_BLOCK_NOT_FOUND')\n        }\n\n        yield cid\n      }\n    }()), options)\n  }\n}\n\nmodule.exports = BlockService\n","'use strict'\n\nconst getDefaultIpldOptions = require('../runtime/ipld')\nconst Ipld = require('ipld')\n\n/**\n * @param {Object} config\n * @param {import('ipfs-block-service')} config.blockService\n * @param {Partial<import('ipld').Options>} [config.options]\n */\nconst createIPLD = ({ blockService, options }) => {\n  return new Ipld(getDefaultIpldOptions(blockService, options))\n}\n\nmodule.exports = createIPLD\n","'use strict'\n\nconst mergeOptions = require('merge-options')\nconst multicodec = require('multicodec')\n\n/**\n * @typedef {import('interface-ipld-format').Format<?>} IPLDFormat\n * @typedef {import('ipld').Options} IPLDOptions\n */\n\n/**\n * All known (non-default) IPLD formats\n *\n * @type {Record<number, IPLDFormat>}\n */\nconst IpldFormats = {\n  get [multicodec.DAG_PB] () {\n    return require('ipld-dag-pb')\n  },\n  get [multicodec.DAG_CBOR] () {\n    return require('ipld-dag-cbor')\n  },\n  get [multicodec.RAW] () {\n    return require('ipld-raw')\n  }\n}\n\n/**\n * @param {import('ipfs-block-service')} blockService\n * @param {Partial<IPLDOptions>} [options]\n */\nmodule.exports = (blockService, options) => {\n  return mergeOptions.call(\n    // ensure we have the defaults formats even if the user overrides `formats: []`\n    { concatArrays: true },\n    {\n      blockService: blockService,\n      formats: [],\n      /**\n       * @type {import('ipld').LoadFormatFn}\n       */\n      loadFormat: (codec) => {\n        if (IpldFormats[codec]) {\n          return Promise.resolve(IpldFormats[codec])\n        } else {\n          throw new Error(`Missing IPLD format \"${multicodec.getName(codec)}\"`)\n        }\n      }\n    }, options)\n}\n","'use strict'\n\nconst util = require('./util.js')\nconst resolver = require('./resolver.js')\n\n/**\n * @typedef {import('interface-ipld-format').Format<object>} ObjectFormat\n */\n\n/**\n * @type {ObjectFormat}\n */\nmodule.exports = {\n  util,\n  resolver,\n  codec: util.codec,\n  defaultHashAlg: util.defaultHashAlg\n}\n","'use strict'\n\n// @ts-ignore TODO: switch to cborg\nconst cbor = require('borc')\nconst multicodec = require('multicodec')\nconst multihashing = require('multihashing-async')\nconst { multihash } = multihashing\nconst CID = require('cids')\n// @ts-ignore\nconst isCircular = require('is-circular')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n/**\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('multihashing-async').multihash.HashCode} HashCode\n */\n\n// https://github.com/ipfs/go-ipfs/issues/3570#issuecomment-273931692\nconst CID_CBOR_TAG = 42\n\n/**\n * @param {CID | string} cid\n */\nfunction tagCID (cid) {\n  let buf\n\n  if (typeof cid === 'string') {\n    buf = new CID(cid).bytes\n  } else if (CID.isCID(cid)) {\n    buf = cid.bytes\n  } else {\n    throw new Error('Could not tag CID - was not string or CID')\n  }\n\n  return new cbor.Tagged(CID_CBOR_TAG, uint8ArrayConcat([\n    uint8ArrayFromString('00', 'base16'), // thanks jdag\n    buf\n  ], 1 + buf.length))\n}\n\n/**\n * @param {any} dagNode\n */\nfunction replaceCIDbyTAG (dagNode) {\n  let circular\n  try {\n    circular = isCircular(dagNode)\n  } catch (e) {\n    circular = false\n  }\n  if (circular) {\n    throw new Error('The object passed has circular references')\n  }\n\n  /**\n   * @param {any} obj\n   * @returns {any}\n   */\n  function transform (obj) {\n    if (!obj || obj instanceof Uint8Array || typeof obj === 'string') {\n      return obj\n    }\n\n    if (Array.isArray(obj)) {\n      return obj.map(transform)\n    }\n\n    if (CID.isCID(obj)) {\n      return tagCID(obj)\n    }\n\n    const keys = Object.keys(obj)\n\n    if (keys.length > 0) {\n      // Recursive transform\n      /** @type {Record<string, any>} */\n      const out = {}\n      keys.forEach((key) => {\n        if (typeof obj[key] === 'object') {\n          out[key] = transform(obj[key])\n        } else {\n          out[key] = obj[key]\n        }\n      })\n      return out\n    } else {\n      return obj\n    }\n  }\n\n  return transform(dagNode)\n}\n\nconst codec = multicodec.DAG_CBOR\nconst defaultHashAlg = multihash.names['sha2-256']\n\nconst defaultTags = {\n  /**\n   * @param {Uint8Array} val\n   */\n  [CID_CBOR_TAG]: (val) => {\n    // remove that 0\n    val = val.slice(1)\n    return new CID(val)\n  }\n}\nconst defaultSize = 64 * 1024 // current decoder heap size, 64 Kb\nlet currentSize = defaultSize\nconst defaultMaxSize = 64 * 1024 * 1024 // max heap size when auto-growing, 64 Mb\nlet maxSize = defaultMaxSize\n/** @type {cbor.Decoder} */\nlet decoder\n\n/**\n * Configure the underlying CBOR decoder.\n *\n * @param {Object} [options] - The options the decoder takes. The decoder will reset to the defaul values if no options are given.\n * @param {number} [options.size=65536] - The current heap size used in CBOR parsing, this may grow automatically as larger blocks are encountered up to `maxSize`\n * @param {number} [options.maxSize=67108864] - The maximum size the CBOR parsing heap is allowed to grow to before `dagCBOR.util.deserialize()` returns an error\n * @param {Object} [options.tags] - An object whose keys are CBOR tag numbers and values are transform functions that accept a `value` and return a decoded representation of that `value`\n */\nfunction configureDecoder (options) {\n  let tags = defaultTags\n\n  if (options) {\n    if (typeof options.size === 'number') {\n      currentSize = options.size\n    }\n    if (typeof options.maxSize === 'number') {\n      maxSize = options.maxSize\n    }\n    if (options.tags) {\n      tags = Object.assign({}, defaultTags, options && options.tags)\n    }\n  } else {\n    // no options, reset to defaults\n    currentSize = defaultSize\n    maxSize = defaultMaxSize\n  }\n\n  const decoderOptions = {\n    tags,\n    size: currentSize\n  }\n\n  decoder = new cbor.Decoder(decoderOptions)\n  // borc edits opts.size in-place so we can capture _actual_ size\n  currentSize = decoderOptions.size\n}\n\nconfigureDecoder() // Setup default cbor.Decoder\n\n/**\n * Serialize internal representation into a binary CBOR block.\n *\n * @param {Object} node - Internal representation of a CBOR block\n * @returns {Uint8Array} - The encoded binary representation\n */\nfunction serialize (node) {\n  const nodeTagged = replaceCIDbyTAG(node)\n  const serialized = cbor.encode(nodeTagged)\n\n  return serialized\n}\n\n/**\n * Deserialize CBOR block into the internal representation.\n *\n * @param {Uint8Array} data - Binary representation of a CBOR block\n * @returns {any} - An object that conforms to the IPLD Data Model\n */\nfunction deserialize (data) {\n  if (data.length > currentSize && data.length <= maxSize) {\n    configureDecoder({ size: data.length })\n  }\n\n  if (data.length > currentSize) {\n    throw new Error('Data is too large to deserialize with current decoder')\n  }\n\n  // borc will decode back-to-back objects into an implicit top-level array, we\n  // strictly want to only see a single explicit top-level object\n  const all = decoder.decodeAll(data)\n  if (all.length !== 1) {\n    throw new Error('Extraneous CBOR data found beyond initial top-level object')\n  }\n\n  return all[0]\n}\n\n/**\n * Calculate the CID of the binary blob.\n *\n * @param {Uint8Array} binaryBlob - Encoded IPLD Node\n * @param {Object} [userOptions] - Options to create the CID\n * @param {CIDVersion} [userOptions.cidVersion=1] - CID version number\n * @param {HashCode} [userOptions.hashAlg=multihash.names['sha2-256']] - Defaults to the defaultHashAlg of the format\n */\nasync function cid (binaryBlob, userOptions = {}) {\n  const options = {\n    cidVersion: userOptions.cidVersion == null ? 1 : userOptions.cidVersion,\n    hashAlg: userOptions.hashAlg == null ? module.exports.defaultHashAlg : userOptions.hashAlg\n  }\n\n  const hashName = multihash.codes[options.hashAlg]\n  const hash = await multihashing(binaryBlob, hashName)\n  const codecName = multicodec.getNameFromCode(module.exports.codec)\n  const cid = new CID(options.cidVersion, codecName, hash)\n\n  return cid\n}\n\nmodule.exports = {\n  codec,\n  defaultHashAlg,\n  configureDecoder,\n  serialize,\n  deserialize,\n  cid\n}\n","'use strict'\n\n// exports.Commented = require('./commented')\nexports.Diagnose = require('./diagnose')\nexports.Decoder = require('./decoder')\nexports.Encoder = require('./encoder')\nexports.Simple = require('./simple')\nexports.Tagged = require('./tagged')\n\n// exports.comment = exports.Commented.comment\nexports.decodeAll = exports.Decoder.decodeAll\nexports.decodeFirst = exports.Decoder.decodeFirst\nexports.diagnose = exports.Diagnose.diagnose\nexports.encode = exports.Encoder.encode\nexports.decode = exports.Decoder.decode\n\nexports.leveldb = {\n  decode: exports.Decoder.decodeAll,\n  encode: exports.Encoder.encode,\n  buffer: true,\n  name: 'cbor'\n}\n","'use strict'\n\nconst { Buffer } = require('buffer')\nconst Decoder = require('./decoder')\nconst utils = require('./utils')\n\n/**\n * Output the diagnostic format from a stream of CBOR bytes.\n *\n */\nclass Diagnose extends Decoder {\n  createTag (tagNumber, value) {\n    return `${tagNumber}(${value})`\n  }\n\n  createInt (val) {\n    return super.createInt(val).toString()\n  }\n\n  createInt32 (f, g) {\n    return super.createInt32(f, g).toString()\n  }\n\n  createInt64 (f1, f2, g1, g2) {\n    return super.createInt64(f1, f2, g1, g2).toString()\n  }\n\n  createInt32Neg (f, g) {\n    return super.createInt32Neg(f, g).toString()\n  }\n\n  createInt64Neg (f1, f2, g1, g2) {\n    return super.createInt64Neg(f1, f2, g1, g2).toString()\n  }\n\n  createTrue () {\n    return 'true'\n  }\n\n  createFalse () {\n    return 'false'\n  }\n\n  createFloat (val) {\n    const fl = super.createFloat(val)\n    if (utils.isNegativeZero(val)) {\n      return '-0_1'\n    }\n\n    return `${fl}_1`\n  }\n\n  createFloatSingle (a, b, c, d) {\n    const fl = super.createFloatSingle(a, b, c, d)\n    return `${fl}_2`\n  }\n\n  createFloatDouble (a, b, c, d, e, f, g, h) {\n    const fl = super.createFloatDouble(a, b, c, d, e, f, g, h)\n    return `${fl}_3`\n  }\n\n  createByteString (raw, len) {\n    const val = raw.join(', ')\n\n    if (len === -1) {\n      return `(_ ${val})`\n    }\n    return `h'${val}`\n  }\n\n  createByteStringFromHeap (start, end) {\n    const val = (Buffer.from(\n      super.createByteStringFromHeap(start, end)\n    )).toString('hex')\n\n    return `h'${val}'`\n  }\n\n  createInfinity () {\n    return 'Infinity_1'\n  }\n\n  createInfinityNeg () {\n    return '-Infinity_1'\n  }\n\n  createNaN () {\n    return 'NaN_1'\n  }\n\n  createNaNNeg () {\n    return '-NaN_1'\n  }\n\n  createNull () {\n    return 'null'\n  }\n\n  createUndefined () {\n    return 'undefined'\n  }\n\n  createSimpleUnassigned (val) {\n    return `simple(${val})`\n  }\n\n  createArray (arr, len) {\n    const val = super.createArray(arr, len)\n\n    if (len === -1) {\n      // indefinite\n      return `[_ ${val.join(', ')}]`\n    }\n\n    return `[${val.join(', ')}]`\n  }\n\n  createMap (map, len) {\n    const val = super.createMap(map)\n    const list = Array.from(val.keys())\n      .reduce(collectObject(val), '')\n\n    if (len === -1) {\n      return `{_ ${list}}`\n    }\n\n    return `{${list}}`\n  }\n\n  createObject (obj, len) {\n    const val = super.createObject(obj)\n    const map = Object.keys(val)\n      .reduce(collectObject(val), '')\n\n    if (len === -1) {\n      return `{_ ${map}}`\n    }\n\n    return `{${map}}`\n  }\n\n  createUtf8String (raw, len) {\n    const val = raw.join(', ')\n\n    if (len === -1) {\n      return `(_ ${val})`\n    }\n\n    return `\"${val}\"`\n  }\n\n  createUtf8StringFromHeap (start, end) {\n    const val = (Buffer.from(\n      super.createUtf8StringFromHeap(start, end)\n    )).toString('utf8')\n\n    return `\"${val}\"`\n  }\n\n  static diagnose (input, enc) {\n    if (typeof input === 'string') {\n      input = Buffer.from(input, enc || 'hex')\n    }\n\n    const dec = new Diagnose()\n    return dec.decodeFirst(input)\n  }\n}\n\nmodule.exports = Diagnose\n\nfunction collectObject (val) {\n  return (acc, key) => {\n    if (acc) {\n      return `${acc}, ${key}: ${val[key]}`\n    }\n    return `${key}: ${val[key]}`\n  }\n}\n","'use strict'\n\nconst { Buffer } = require('buffer')\nconst ieee754 = require('ieee754')\nconst Bignumber = require('bignumber.js').BigNumber\n\nconst parser = require('./decoder.asm')\nconst utils = require('./utils')\nconst c = require('./constants')\nconst Simple = require('./simple')\nconst Tagged = require('./tagged')\nconst { URL } = require('iso-url')\n\n/**\n * Transform binary cbor data into JavaScript objects.\n */\nclass Decoder {\n  /**\n   * @param {Object} [opts={}]\n   * @param {number} [opts.size=65536] - Size of the allocated heap.\n   */\n  constructor (opts) {\n    opts = opts || {}\n\n    if (!opts.size || opts.size < 0x10000) {\n      opts.size = 0x10000\n    } else {\n      // Ensure the size is a power of 2\n      opts.size = utils.nextPowerOf2(opts.size)\n    }\n\n    // Heap use to share the input with the parser\n    this._heap = new ArrayBuffer(opts.size)\n    this._heap8 = new Uint8Array(this._heap)\n    this._buffer = Buffer.from(this._heap)\n\n    this._reset()\n\n    // Known tags\n    this._knownTags = Object.assign({\n      0: (val) => new Date(val),\n      1: (val) => new Date(val * 1000),\n      2: (val) => utils.arrayBufferToBignumber(val),\n      3: (val) => c.NEG_ONE.minus(utils.arrayBufferToBignumber(val)),\n      4: (v) => {\n        // const v = new Uint8Array(val)\n        return c.TEN.pow(v[0]).times(v[1])\n      },\n      5: (v) => {\n        // const v = new Uint8Array(val)\n        return c.TWO.pow(v[0]).times(v[1])\n      },\n      32: (val) => new URL(val),\n      35: (val) => new RegExp(val)\n    }, opts.tags)\n\n    // Initialize asm based parser\n    this.parser = parser(global, {\n      // eslint-disable-next-line no-console\n      log: console.log.bind(console),\n      pushInt: this.pushInt.bind(this),\n      pushInt32: this.pushInt32.bind(this),\n      pushInt32Neg: this.pushInt32Neg.bind(this),\n      pushInt64: this.pushInt64.bind(this),\n      pushInt64Neg: this.pushInt64Neg.bind(this),\n      pushFloat: this.pushFloat.bind(this),\n      pushFloatSingle: this.pushFloatSingle.bind(this),\n      pushFloatDouble: this.pushFloatDouble.bind(this),\n      pushTrue: this.pushTrue.bind(this),\n      pushFalse: this.pushFalse.bind(this),\n      pushUndefined: this.pushUndefined.bind(this),\n      pushNull: this.pushNull.bind(this),\n      pushInfinity: this.pushInfinity.bind(this),\n      pushInfinityNeg: this.pushInfinityNeg.bind(this),\n      pushNaN: this.pushNaN.bind(this),\n      pushNaNNeg: this.pushNaNNeg.bind(this),\n      pushArrayStart: this.pushArrayStart.bind(this),\n      pushArrayStartFixed: this.pushArrayStartFixed.bind(this),\n      pushArrayStartFixed32: this.pushArrayStartFixed32.bind(this),\n      pushArrayStartFixed64: this.pushArrayStartFixed64.bind(this),\n      pushObjectStart: this.pushObjectStart.bind(this),\n      pushObjectStartFixed: this.pushObjectStartFixed.bind(this),\n      pushObjectStartFixed32: this.pushObjectStartFixed32.bind(this),\n      pushObjectStartFixed64: this.pushObjectStartFixed64.bind(this),\n      pushByteString: this.pushByteString.bind(this),\n      pushByteStringStart: this.pushByteStringStart.bind(this),\n      pushUtf8String: this.pushUtf8String.bind(this),\n      pushUtf8StringStart: this.pushUtf8StringStart.bind(this),\n      pushSimpleUnassigned: this.pushSimpleUnassigned.bind(this),\n      pushTagUnassigned: this.pushTagUnassigned.bind(this),\n      pushTagStart: this.pushTagStart.bind(this),\n      pushTagStart4: this.pushTagStart4.bind(this),\n      pushTagStart8: this.pushTagStart8.bind(this),\n      pushBreak: this.pushBreak.bind(this)\n    }, this._heap)\n  }\n\n  get _depth () {\n    return this._parents.length\n  }\n\n  get _currentParent () {\n    return this._parents[this._depth - 1]\n  }\n\n  get _ref () {\n    return this._currentParent.ref\n  }\n\n  // Finish the current parent\n  _closeParent () {\n    const p = this._parents.pop()\n\n    if (p.length > 0) {\n      throw new Error(`Missing ${p.length} elements`)\n    }\n\n    switch (p.type) {\n      case c.PARENT.TAG:\n        this._push(\n          this.createTag(p.ref[0], p.ref[1])\n        )\n        break\n      case c.PARENT.BYTE_STRING:\n        this._push(this.createByteString(p.ref, p.length))\n        break\n      case c.PARENT.UTF8_STRING:\n        this._push(this.createUtf8String(p.ref, p.length))\n        break\n      case c.PARENT.MAP:\n        if (p.values % 2 > 0) {\n          throw new Error('Odd number of elements in the map')\n        }\n        this._push(this.createMap(p.ref, p.length))\n        break\n      case c.PARENT.OBJECT:\n        if (p.values % 2 > 0) {\n          throw new Error('Odd number of elements in the map')\n        }\n        this._push(this.createObject(p.ref, p.length))\n        break\n      case c.PARENT.ARRAY:\n        this._push(this.createArray(p.ref, p.length))\n        break\n      default:\n        break\n    }\n\n    if (this._currentParent && this._currentParent.type === c.PARENT.TAG) {\n      this._dec()\n    }\n  }\n\n  // Reduce the expected length of the current parent by one\n  _dec () {\n    const p = this._currentParent\n    // The current parent does not know the epxected child length\n\n    if (p.length < 0) {\n      return\n    }\n\n    p.length--\n\n    // All children were seen, we can close the current parent\n    if (p.length === 0) {\n      this._closeParent()\n    }\n  }\n\n  // Push any value to the current parent\n  _push (val, hasChildren) {\n    const p = this._currentParent\n    p.values++\n\n    switch (p.type) {\n      case c.PARENT.ARRAY:\n      case c.PARENT.BYTE_STRING:\n      case c.PARENT.UTF8_STRING:\n        if (p.length > -1) {\n          this._ref[this._ref.length - p.length] = val\n        } else {\n          this._ref.push(val)\n        }\n        this._dec()\n        break\n      case c.PARENT.OBJECT:\n        if (p.tmpKey != null) {\n          this._ref[p.tmpKey] = val\n          p.tmpKey = null\n          this._dec()\n        } else {\n          p.tmpKey = val\n\n          if (typeof p.tmpKey !== 'string') {\n            // too bad, convert to a Map\n            p.type = c.PARENT.MAP\n            p.ref = utils.buildMap(p.ref)\n          }\n        }\n        break\n      case c.PARENT.MAP:\n        if (p.tmpKey != null) {\n          this._ref.set(p.tmpKey, val)\n          p.tmpKey = null\n          this._dec()\n        } else {\n          p.tmpKey = val\n        }\n        break\n      case c.PARENT.TAG:\n        this._ref.push(val)\n        if (!hasChildren) {\n          this._dec()\n        }\n        break\n      default:\n        throw new Error('Unknown parent type')\n    }\n  }\n\n  // Create a new parent in the parents list\n  _createParent (obj, type, len) {\n    this._parents[this._depth] = {\n      type: type,\n      length: len,\n      ref: obj,\n      values: 0,\n      tmpKey: null\n    }\n  }\n\n  // Reset all state back to the beginning, also used for initiatlization\n  _reset () {\n    this._res = []\n    this._parents = [{\n      type: c.PARENT.ARRAY,\n      length: -1,\n      ref: this._res,\n      values: 0,\n      tmpKey: null\n    }]\n  }\n\n  // -- Interface to customize deoding behaviour\n  createTag (tagNumber, value) {\n    const typ = this._knownTags[tagNumber]\n\n    if (!typ) {\n      return new Tagged(tagNumber, value)\n    }\n\n    return typ(value)\n  }\n\n  createMap (obj, len) {\n    return obj\n  }\n\n  createObject (obj, len) {\n    return obj\n  }\n\n  createArray (arr, len) {\n    return arr\n  }\n\n  createByteString (raw, len) {\n    return Buffer.concat(raw)\n  }\n\n  createByteStringFromHeap (start, end) {\n    if (start === end) {\n      return Buffer.alloc(0)\n    }\n\n    return Buffer.from(this._heap.slice(start, end))\n  }\n\n  createInt (val) {\n    return val\n  }\n\n  createInt32 (f, g) {\n    return utils.buildInt32(f, g)\n  }\n\n  createInt64 (f1, f2, g1, g2) {\n    return utils.buildInt64(f1, f2, g1, g2)\n  }\n\n  createFloat (val) {\n    return val\n  }\n\n  createFloatSingle (a, b, c, d) {\n    return ieee754.read([a, b, c, d], 0, false, 23, 4)\n  }\n\n  createFloatDouble (a, b, c, d, e, f, g, h) {\n    return ieee754.read([a, b, c, d, e, f, g, h], 0, false, 52, 8)\n  }\n\n  createInt32Neg (f, g) {\n    return -1 - utils.buildInt32(f, g)\n  }\n\n  createInt64Neg (f1, f2, g1, g2) {\n    const f = utils.buildInt32(f1, f2)\n    const g = utils.buildInt32(g1, g2)\n\n    if (f > c.MAX_SAFE_HIGH) {\n      return c.NEG_ONE.minus(new Bignumber(f).times(c.SHIFT32).plus(g))\n    }\n\n    return -1 - ((f * c.SHIFT32) + g)\n  }\n\n  createTrue () {\n    return true\n  }\n\n  createFalse () {\n    return false\n  }\n\n  createNull () {\n    return null\n  }\n\n  createUndefined () {\n    return undefined\n  }\n\n  createInfinity () {\n    return Infinity\n  }\n\n  createInfinityNeg () {\n    return -Infinity\n  }\n\n  createNaN () {\n    return NaN\n  }\n\n  createNaNNeg () {\n    return -NaN\n  }\n\n  createUtf8String (raw, len) {\n    return raw.join('')\n  }\n\n  createUtf8StringFromHeap (start, end) {\n    if (start === end) {\n      return ''\n    }\n\n    return this._buffer.toString('utf8', start, end)\n  }\n\n  createSimpleUnassigned (val) {\n    return new Simple(val)\n  }\n\n  // -- Interface for decoder.asm.js\n\n  pushInt (val) {\n    this._push(this.createInt(val))\n  }\n\n  pushInt32 (f, g) {\n    this._push(this.createInt32(f, g))\n  }\n\n  pushInt64 (f1, f2, g1, g2) {\n    this._push(this.createInt64(f1, f2, g1, g2))\n  }\n\n  pushFloat (val) {\n    this._push(this.createFloat(val))\n  }\n\n  pushFloatSingle (a, b, c, d) {\n    this._push(this.createFloatSingle(a, b, c, d))\n  }\n\n  pushFloatDouble (a, b, c, d, e, f, g, h) {\n    this._push(this.createFloatDouble(a, b, c, d, e, f, g, h))\n  }\n\n  pushInt32Neg (f, g) {\n    this._push(this.createInt32Neg(f, g))\n  }\n\n  pushInt64Neg (f1, f2, g1, g2) {\n    this._push(this.createInt64Neg(f1, f2, g1, g2))\n  }\n\n  pushTrue () {\n    this._push(this.createTrue())\n  }\n\n  pushFalse () {\n    this._push(this.createFalse())\n  }\n\n  pushNull () {\n    this._push(this.createNull())\n  }\n\n  pushUndefined () {\n    this._push(this.createUndefined())\n  }\n\n  pushInfinity () {\n    this._push(this.createInfinity())\n  }\n\n  pushInfinityNeg () {\n    this._push(this.createInfinityNeg())\n  }\n\n  pushNaN () {\n    this._push(this.createNaN())\n  }\n\n  pushNaNNeg () {\n    this._push(this.createNaNNeg())\n  }\n\n  pushArrayStart () {\n    this._createParent([], c.PARENT.ARRAY, -1)\n  }\n\n  pushArrayStartFixed (len) {\n    this._createArrayStartFixed(len)\n  }\n\n  pushArrayStartFixed32 (len1, len2) {\n    const len = utils.buildInt32(len1, len2)\n    this._createArrayStartFixed(len)\n  }\n\n  pushArrayStartFixed64 (len1, len2, len3, len4) {\n    const len = utils.buildInt64(len1, len2, len3, len4)\n    this._createArrayStartFixed(len)\n  }\n\n  pushObjectStart () {\n    this._createObjectStartFixed(-1)\n  }\n\n  pushObjectStartFixed (len) {\n    this._createObjectStartFixed(len)\n  }\n\n  pushObjectStartFixed32 (len1, len2) {\n    const len = utils.buildInt32(len1, len2)\n    this._createObjectStartFixed(len)\n  }\n\n  pushObjectStartFixed64 (len1, len2, len3, len4) {\n    const len = utils.buildInt64(len1, len2, len3, len4)\n    this._createObjectStartFixed(len)\n  }\n\n  pushByteStringStart () {\n    this._parents[this._depth] = {\n      type: c.PARENT.BYTE_STRING,\n      length: -1,\n      ref: [],\n      values: 0,\n      tmpKey: null\n    }\n  }\n\n  pushByteString (start, end) {\n    this._push(this.createByteStringFromHeap(start, end))\n  }\n\n  pushUtf8StringStart () {\n    this._parents[this._depth] = {\n      type: c.PARENT.UTF8_STRING,\n      length: -1,\n      ref: [],\n      values: 0,\n      tmpKey: null\n    }\n  }\n\n  pushUtf8String (start, end) {\n    this._push(this.createUtf8StringFromHeap(start, end))\n  }\n\n  pushSimpleUnassigned (val) {\n    this._push(this.createSimpleUnassigned(val))\n  }\n\n  pushTagStart (tag) {\n    this._parents[this._depth] = {\n      type: c.PARENT.TAG,\n      length: 1,\n      ref: [tag]\n    }\n  }\n\n  pushTagStart4 (f, g) {\n    this.pushTagStart(utils.buildInt32(f, g))\n  }\n\n  pushTagStart8 (f1, f2, g1, g2) {\n    this.pushTagStart(utils.buildInt64(f1, f2, g1, g2))\n  }\n\n  pushTagUnassigned (tagNumber) {\n    this._push(this.createTag(tagNumber))\n  }\n\n  pushBreak () {\n    if (this._currentParent.length > -1) {\n      throw new Error('Unexpected break')\n    }\n\n    this._closeParent()\n  }\n\n  _createObjectStartFixed (len) {\n    if (len === 0) {\n      this._push(this.createObject({}))\n      return\n    }\n\n    this._createParent({}, c.PARENT.OBJECT, len)\n  }\n\n  _createArrayStartFixed (len) {\n    if (len === 0) {\n      this._push(this.createArray([]))\n      return\n    }\n\n    this._createParent(new Array(len), c.PARENT.ARRAY, len)\n  }\n\n  _decode (input) {\n    if (input.byteLength === 0) {\n      throw new Error('Input too short')\n    }\n\n    this._reset()\n    this._heap8.set(input)\n    const code = this.parser.parse(input.byteLength)\n\n    if (this._depth > 1) {\n      while (this._currentParent.length === 0) {\n        this._closeParent()\n      }\n      if (this._depth > 1) {\n        throw new Error('Undeterminated nesting')\n      }\n    }\n\n    if (code > 0) {\n      throw new Error('Failed to parse')\n    }\n\n    if (this._res.length === 0) {\n      throw new Error('No valid result')\n    }\n  }\n\n  // -- Public Interface\n\n  decodeFirst (input) {\n    this._decode(input)\n\n    return this._res[0]\n  }\n\n  decodeAll (input) {\n    this._decode(input)\n\n    return this._res\n  }\n\n  /**\n   * Decode the first cbor object.\n   *\n   * @param {Buffer|string} input\n   * @param {string} [enc='hex'] - Encoding used if a string is passed.\n   * @returns {*}\n   */\n  static decode (input, enc) {\n    if (typeof input === 'string') {\n      input = Buffer.from(input, enc || 'hex')\n    }\n\n    const dec = new Decoder({ size: input.length })\n    return dec.decodeFirst(input)\n  }\n\n  /**\n   * Decode all cbor objects.\n   *\n   * @param {Buffer|string} input\n   * @param {string} [enc='hex'] - Encoding used if a string is passed.\n   * @returns {Array<*>}\n   */\n  static decodeAll (input, enc) {\n    if (typeof input === 'string') {\n      input = Buffer.from(input, enc || 'hex')\n    }\n\n    const dec = new Decoder({ size: input.length })\n    return dec.decodeAll(input)\n  }\n}\n\nDecoder.decodeFirst = Decoder.decode\n\nmodule.exports = Decoder\n","/* eslint-disable */\n\nmodule.exports = function decodeAsm (stdlib, foreign, buffer) {\n  'use asm'\n\n  // -- Imports\n\n  var heap = new stdlib.Uint8Array(buffer)\n  // var log = foreign.log\n  var pushInt = foreign.pushInt\n  var pushInt32 = foreign.pushInt32\n  var pushInt32Neg = foreign.pushInt32Neg\n  var pushInt64 = foreign.pushInt64\n  var pushInt64Neg = foreign.pushInt64Neg\n  var pushFloat = foreign.pushFloat\n  var pushFloatSingle = foreign.pushFloatSingle\n  var pushFloatDouble = foreign.pushFloatDouble\n  var pushTrue = foreign.pushTrue\n  var pushFalse = foreign.pushFalse\n  var pushUndefined = foreign.pushUndefined\n  var pushNull = foreign.pushNull\n  var pushInfinity = foreign.pushInfinity\n  var pushInfinityNeg = foreign.pushInfinityNeg\n  var pushNaN = foreign.pushNaN\n  var pushNaNNeg = foreign.pushNaNNeg\n\n  var pushArrayStart = foreign.pushArrayStart\n  var pushArrayStartFixed = foreign.pushArrayStartFixed\n  var pushArrayStartFixed32 = foreign.pushArrayStartFixed32\n  var pushArrayStartFixed64 = foreign.pushArrayStartFixed64\n  var pushObjectStart = foreign.pushObjectStart\n  var pushObjectStartFixed = foreign.pushObjectStartFixed\n  var pushObjectStartFixed32 = foreign.pushObjectStartFixed32\n  var pushObjectStartFixed64 = foreign.pushObjectStartFixed64\n\n  var pushByteString = foreign.pushByteString\n  var pushByteStringStart = foreign.pushByteStringStart\n  var pushUtf8String = foreign.pushUtf8String\n  var pushUtf8StringStart = foreign.pushUtf8StringStart\n\n  var pushSimpleUnassigned = foreign.pushSimpleUnassigned\n\n  var pushTagStart = foreign.pushTagStart\n  var pushTagStart4 = foreign.pushTagStart4\n  var pushTagStart8 = foreign.pushTagStart8\n  var pushTagUnassigned = foreign.pushTagUnassigned\n\n  var pushBreak = foreign.pushBreak\n\n  var pow = stdlib.Math.pow\n\n  // -- Constants\n\n\n  // -- Mutable Variables\n\n  var offset = 0\n  var inputLength = 0\n  var code = 0\n\n  // Decode a cbor string represented as Uint8Array\n  // which is allocated on the heap from 0 to inputLength\n  //\n  // input - Int\n  //\n  // Returns Code - Int,\n  // Success = 0\n  // Error > 0\n  function parse (input) {\n    input = input | 0\n\n    offset = 0\n    inputLength = input\n\n    while ((offset | 0) < (inputLength | 0)) {\n      code = jumpTable[heap[offset] & 255](heap[offset] | 0) | 0\n\n      if ((code | 0) > 0) {\n        break\n      }\n    }\n\n    return code | 0\n  }\n\n  // -- Helper Function\n\n  function checkOffset (n) {\n    n = n | 0\n\n    if ((((offset | 0) + (n | 0)) | 0) < (inputLength | 0)) {\n      return 0\n    }\n\n    return 1\n  }\n\n  function readUInt16 (n) {\n    n = n | 0\n\n    return (\n      (heap[n | 0] << 8) | heap[(n + 1) | 0]\n    ) | 0\n  }\n\n  function readUInt32 (n) {\n    n = n | 0\n\n    return (\n      (heap[n | 0] << 24) | (heap[(n + 1) | 0] << 16) | (heap[(n + 2) | 0] << 8) | heap[(n + 3) | 0]\n    ) | 0\n  }\n\n  // -- Initial Byte Handlers\n\n  function INT_P (octet) {\n    octet = octet | 0\n\n    pushInt(octet | 0)\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function UINT_P_8 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushInt(heap[(offset + 1) | 0] | 0)\n\n    offset = (offset + 2) | 0\n\n    return 0\n  }\n\n  function UINT_P_16 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    pushInt(\n      readUInt16((offset + 1) | 0) | 0\n    )\n\n    offset = (offset + 3) | 0\n\n    return 0\n  }\n\n  function UINT_P_32 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushInt32(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0\n    )\n\n    offset = (offset + 5) | 0\n\n    return 0\n  }\n\n  function UINT_P_64 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushInt64(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0,\n      readUInt16((offset + 5) | 0) | 0,\n      readUInt16((offset + 7) | 0) | 0\n    )\n\n    offset = (offset + 9) | 0\n\n    return 0\n  }\n\n  function INT_N (octet) {\n    octet = octet | 0\n\n    pushInt((-1 - ((octet - 32) | 0)) | 0)\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function UINT_N_8 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushInt(\n      (-1 - (heap[(offset + 1) | 0] | 0)) | 0\n    )\n\n    offset = (offset + 2) | 0\n\n    return 0\n  }\n\n  function UINT_N_16 (octet) {\n    octet = octet | 0\n\n    var val = 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    val = readUInt16((offset + 1) | 0) | 0\n    pushInt((-1 - (val | 0)) | 0)\n\n    offset = (offset + 3) | 0\n\n    return 0\n  }\n\n  function UINT_N_32 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushInt32Neg(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0\n    )\n\n    offset = (offset + 5) | 0\n\n    return 0\n  }\n\n  function UINT_N_64 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushInt64Neg(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0,\n      readUInt16((offset + 5) | 0) | 0,\n      readUInt16((offset + 7) | 0) | 0\n    )\n\n    offset = (offset + 9) | 0\n\n    return 0\n  }\n\n  function BYTE_STRING (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var step = 0\n\n    step = (octet - 64) | 0\n    if (checkOffset(step | 0) | 0) {\n      return 1\n    }\n\n    start = (offset + 1) | 0\n    end = (((offset + 1) | 0) + (step | 0)) | 0\n\n    pushByteString(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function BYTE_STRING_8 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    length = heap[(offset + 1) | 0] | 0\n    start = (offset + 2) | 0\n    end = (((offset + 2) | 0) + (length | 0)) | 0\n\n    if (checkOffset((length + 1) | 0) | 0) {\n      return 1\n    }\n\n    pushByteString(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function BYTE_STRING_16 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    length = readUInt16((offset + 1) | 0) | 0\n    start = (offset + 3) | 0\n    end = (((offset + 3) | 0) + (length | 0)) | 0\n\n\n    if (checkOffset((length + 2) | 0) | 0) {\n      return 1\n    }\n\n    pushByteString(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function BYTE_STRING_32 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    length = readUInt32((offset + 1) | 0) | 0\n    start = (offset + 5) | 0\n    end = (((offset + 5) | 0) + (length | 0)) | 0\n\n\n    if (checkOffset((length + 4) | 0) | 0) {\n      return 1\n    }\n\n    pushByteString(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function BYTE_STRING_64 (octet) {\n    // NOT IMPLEMENTED\n    octet = octet | 0\n\n    return 1\n  }\n\n  function BYTE_STRING_BREAK (octet) {\n    octet = octet | 0\n\n    pushByteStringStart()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function UTF8_STRING (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var step = 0\n\n    step = (octet - 96) | 0\n\n    if (checkOffset(step | 0) | 0) {\n      return 1\n    }\n\n    start = (offset + 1) | 0\n    end = (((offset + 1) | 0) + (step | 0)) | 0\n\n    pushUtf8String(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function UTF8_STRING_8 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    length = heap[(offset + 1) | 0] | 0\n    start = (offset + 2) | 0\n    end = (((offset + 2) | 0) + (length | 0)) | 0\n\n    if (checkOffset((length + 1) | 0) | 0) {\n      return 1\n    }\n\n    pushUtf8String(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function UTF8_STRING_16 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    length = readUInt16((offset + 1) | 0) | 0\n    start = (offset + 3) | 0\n    end = (((offset + 3) | 0) + (length | 0)) | 0\n\n    if (checkOffset((length + 2) | 0) | 0) {\n      return 1\n    }\n\n    pushUtf8String(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function UTF8_STRING_32 (octet) {\n    octet = octet | 0\n\n    var start = 0\n    var end = 0\n    var length = 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    length = readUInt32((offset + 1) | 0) | 0\n    start = (offset + 5) | 0\n    end = (((offset + 5) | 0) + (length | 0)) | 0\n\n    if (checkOffset((length + 4) | 0) | 0) {\n      return 1\n    }\n\n    pushUtf8String(start | 0, end | 0)\n\n    offset = end | 0\n\n    return 0\n  }\n\n  function UTF8_STRING_64 (octet) {\n    // NOT IMPLEMENTED\n    octet = octet | 0\n\n    return 1\n  }\n\n  function UTF8_STRING_BREAK (octet) {\n    octet = octet | 0\n\n    pushUtf8StringStart()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function ARRAY (octet) {\n    octet = octet | 0\n\n    pushArrayStartFixed((octet - 128) | 0)\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function ARRAY_8 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushArrayStartFixed(heap[(offset + 1) | 0] | 0)\n\n    offset = (offset + 2) | 0\n\n    return 0\n  }\n\n  function ARRAY_16 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    pushArrayStartFixed(\n      readUInt16((offset + 1) | 0) | 0\n    )\n\n    offset = (offset + 3) | 0\n\n    return 0\n  }\n\n  function ARRAY_32 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushArrayStartFixed32(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0\n    )\n\n    offset = (offset + 5) | 0\n\n    return 0\n  }\n\n  function ARRAY_64 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushArrayStartFixed64(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0,\n      readUInt16((offset + 5) | 0) | 0,\n      readUInt16((offset + 7) | 0) | 0\n    )\n\n    offset = (offset + 9) | 0\n\n    return 0\n  }\n\n  function ARRAY_BREAK (octet) {\n    octet = octet | 0\n\n    pushArrayStart()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function MAP (octet) {\n    octet = octet | 0\n\n    var step = 0\n\n    step = (octet - 160) | 0\n\n    if (checkOffset(step | 0) | 0) {\n      return 1\n    }\n\n    pushObjectStartFixed(step | 0)\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function MAP_8 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushObjectStartFixed(heap[(offset + 1) | 0] | 0)\n\n    offset = (offset + 2) | 0\n\n    return 0\n  }\n\n  function MAP_16 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    pushObjectStartFixed(\n      readUInt16((offset + 1) | 0) | 0\n    )\n\n    offset = (offset + 3) | 0\n\n    return 0\n  }\n\n  function MAP_32 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushObjectStartFixed32(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0\n    )\n\n    offset = (offset + 5) | 0\n\n    return 0\n  }\n\n  function MAP_64 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushObjectStartFixed64(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0,\n      readUInt16((offset + 5) | 0) | 0,\n      readUInt16((offset + 7) | 0) | 0\n    )\n\n    offset = (offset + 9) | 0\n\n    return 0\n  }\n\n  function MAP_BREAK (octet) {\n    octet = octet | 0\n\n    pushObjectStart()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function TAG_KNOWN (octet) {\n    octet = octet | 0\n\n    pushTagStart((octet - 192| 0) | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BIGNUM_POS (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BIGNUM_NEG (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_FRAC (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BIGNUM_FLOAT (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_UNASSIGNED (octet) {\n    octet = octet | 0\n\n    pushTagStart((octet - 192| 0) | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BASE64_URL (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BASE64 (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_BASE16 (octet) {\n    octet = octet | 0\n\n    pushTagStart(octet | 0)\n\n    offset = (offset + 1 | 0)\n\n    return 0\n  }\n\n  function TAG_MORE_1 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushTagStart(heap[(offset + 1) | 0] | 0)\n\n    offset = (offset + 2 | 0)\n\n    return 0\n  }\n\n  function TAG_MORE_2 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    pushTagStart(\n      readUInt16((offset + 1) | 0) | 0\n    )\n\n    offset = (offset + 3 | 0)\n\n    return 0\n  }\n\n  function TAG_MORE_4 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushTagStart4(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0\n    )\n\n    offset = (offset + 5 | 0)\n\n    return 0\n  }\n\n  function TAG_MORE_8 (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushTagStart8(\n      readUInt16((offset + 1) | 0) | 0,\n      readUInt16((offset + 3) | 0) | 0,\n      readUInt16((offset + 5) | 0) | 0,\n      readUInt16((offset + 7) | 0) | 0\n    )\n\n    offset = (offset + 9 | 0)\n\n    return 0\n  }\n\n  function SIMPLE_UNASSIGNED (octet) {\n    octet = octet | 0\n\n    pushSimpleUnassigned(((octet | 0) - 224) | 0)\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function SIMPLE_FALSE (octet) {\n    octet = octet | 0\n\n    pushFalse()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function SIMPLE_TRUE (octet) {\n    octet = octet | 0\n\n    pushTrue()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function SIMPLE_NULL (octet) {\n    octet = octet | 0\n\n    pushNull()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function SIMPLE_UNDEFINED (octet) {\n    octet = octet | 0\n\n    pushUndefined()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  function SIMPLE_BYTE (octet) {\n    octet = octet | 0\n\n    if (checkOffset(1) | 0) {\n      return 1\n    }\n\n    pushSimpleUnassigned(heap[(offset + 1) | 0] | 0)\n\n    offset = (offset + 2)  | 0\n\n    return 0\n  }\n\n  function SIMPLE_FLOAT_HALF (octet) {\n    octet = octet | 0\n\n    var f = 0\n    var g = 0\n    var sign = 1.0\n    var exp = 0.0\n    var mant = 0.0\n    var r = 0.0\n    if (checkOffset(2) | 0) {\n      return 1\n    }\n\n    f = heap[(offset + 1) | 0] | 0\n    g = heap[(offset + 2) | 0] | 0\n\n    if ((f | 0) & 0x80) {\n      sign = -1.0\n    }\n\n    exp = +(((f | 0) & 0x7C) >> 2)\n    mant = +((((f | 0) & 0x03) << 8) | g)\n\n    if (+exp == 0.0) {\n      pushFloat(+(\n        (+sign) * +5.9604644775390625e-8 * (+mant)\n      ))\n    } else if (+exp == 31.0) {\n      if (+sign == 1.0) {\n        if (+mant > 0.0) {\n          pushNaN()\n        } else {\n          pushInfinity()\n        }\n      } else {\n        if (+mant > 0.0) {\n          pushNaNNeg()\n        } else {\n          pushInfinityNeg()\n        }\n      }\n    } else {\n      pushFloat(+(\n        +sign * pow(+2, +(+exp - 25.0)) * +(1024.0 + mant)\n      ))\n    }\n\n    offset = (offset + 3) | 0\n\n    return 0\n  }\n\n  function SIMPLE_FLOAT_SINGLE (octet) {\n    octet = octet | 0\n\n    if (checkOffset(4) | 0) {\n      return 1\n    }\n\n    pushFloatSingle(\n      heap[(offset + 1) | 0] | 0,\n      heap[(offset + 2) | 0] | 0,\n      heap[(offset + 3) | 0] | 0,\n      heap[(offset + 4) | 0] | 0\n    )\n\n    offset = (offset + 5) | 0\n\n    return 0\n  }\n\n  function SIMPLE_FLOAT_DOUBLE (octet) {\n    octet = octet | 0\n\n    if (checkOffset(8) | 0) {\n      return 1\n    }\n\n    pushFloatDouble(\n      heap[(offset + 1) | 0] | 0,\n      heap[(offset + 2) | 0] | 0,\n      heap[(offset + 3) | 0] | 0,\n      heap[(offset + 4) | 0] | 0,\n      heap[(offset + 5) | 0] | 0,\n      heap[(offset + 6) | 0] | 0,\n      heap[(offset + 7) | 0] | 0,\n      heap[(offset + 8) | 0] | 0\n    )\n\n    offset = (offset + 9) | 0\n\n    return 0\n  }\n\n  function ERROR (octet) {\n    octet = octet | 0\n\n    return 1\n  }\n\n  function BREAK (octet) {\n    octet = octet | 0\n\n    pushBreak()\n\n    offset = (offset + 1) | 0\n\n    return 0\n  }\n\n  // -- Jump Table\n\n  var jumpTable = [\n    // Integer 0x00..0x17 (0..23)\n    INT_P, // 0x00\n    INT_P, // 0x01\n    INT_P, // 0x02\n    INT_P, // 0x03\n    INT_P, // 0x04\n    INT_P, // 0x05\n    INT_P, // 0x06\n    INT_P, // 0x07\n    INT_P, // 0x08\n    INT_P, // 0x09\n    INT_P, // 0x0A\n    INT_P, // 0x0B\n    INT_P, // 0x0C\n    INT_P, // 0x0D\n    INT_P, // 0x0E\n    INT_P, // 0x0F\n    INT_P, // 0x10\n    INT_P, // 0x11\n    INT_P, // 0x12\n    INT_P, // 0x13\n    INT_P, // 0x14\n    INT_P, // 0x15\n    INT_P, // 0x16\n    INT_P, // 0x17\n    // Unsigned integer (one-byte uint8_t follows)\n    UINT_P_8, // 0x18\n    // Unsigned integer (two-byte uint16_t follows)\n    UINT_P_16, // 0x19\n    // Unsigned integer (four-byte uint32_t follows)\n    UINT_P_32, // 0x1a\n    // Unsigned integer (eight-byte uint64_t follows)\n    UINT_P_64, // 0x1b\n    ERROR, // 0x1c\n    ERROR, // 0x1d\n    ERROR, // 0x1e\n    ERROR, // 0x1f\n    // Negative integer -1-0x00..-1-0x17 (-1..-24)\n    INT_N, // 0x20\n    INT_N, // 0x21\n    INT_N, // 0x22\n    INT_N, // 0x23\n    INT_N, // 0x24\n    INT_N, // 0x25\n    INT_N, // 0x26\n    INT_N, // 0x27\n    INT_N, // 0x28\n    INT_N, // 0x29\n    INT_N, // 0x2A\n    INT_N, // 0x2B\n    INT_N, // 0x2C\n    INT_N, // 0x2D\n    INT_N, // 0x2E\n    INT_N, // 0x2F\n    INT_N, // 0x30\n    INT_N, // 0x31\n    INT_N, // 0x32\n    INT_N, // 0x33\n    INT_N, // 0x34\n    INT_N, // 0x35\n    INT_N, // 0x36\n    INT_N, // 0x37\n    // Negative integer -1-n (one-byte uint8_t for n follows)\n    UINT_N_8, // 0x38\n    // Negative integer -1-n (two-byte uint16_t for n follows)\n    UINT_N_16, // 0x39\n    // Negative integer -1-n (four-byte uint32_t for nfollows)\n    UINT_N_32, // 0x3a\n    // Negative integer -1-n (eight-byte uint64_t for n follows)\n    UINT_N_64, // 0x3b\n    ERROR, // 0x3c\n    ERROR, // 0x3d\n    ERROR, // 0x3e\n    ERROR, // 0x3f\n    // byte string (0x00..0x17 bytes follow)\n    BYTE_STRING, // 0x40\n    BYTE_STRING, // 0x41\n    BYTE_STRING, // 0x42\n    BYTE_STRING, // 0x43\n    BYTE_STRING, // 0x44\n    BYTE_STRING, // 0x45\n    BYTE_STRING, // 0x46\n    BYTE_STRING, // 0x47\n    BYTE_STRING, // 0x48\n    BYTE_STRING, // 0x49\n    BYTE_STRING, // 0x4A\n    BYTE_STRING, // 0x4B\n    BYTE_STRING, // 0x4C\n    BYTE_STRING, // 0x4D\n    BYTE_STRING, // 0x4E\n    BYTE_STRING, // 0x4F\n    BYTE_STRING, // 0x50\n    BYTE_STRING, // 0x51\n    BYTE_STRING, // 0x52\n    BYTE_STRING, // 0x53\n    BYTE_STRING, // 0x54\n    BYTE_STRING, // 0x55\n    BYTE_STRING, // 0x56\n    BYTE_STRING, // 0x57\n    // byte string (one-byte uint8_t for n, and then n bytes follow)\n    BYTE_STRING_8, // 0x58\n    // byte string (two-byte uint16_t for n, and then n bytes follow)\n    BYTE_STRING_16, // 0x59\n    // byte string (four-byte uint32_t for n, and then n bytes follow)\n    BYTE_STRING_32, // 0x5a\n    // byte string (eight-byte uint64_t for n, and then n bytes follow)\n    BYTE_STRING_64, // 0x5b\n    ERROR, // 0x5c\n    ERROR, // 0x5d\n    ERROR, // 0x5e\n    // byte string, byte strings follow, terminated by \"break\"\n    BYTE_STRING_BREAK, // 0x5f\n    // UTF-8 string (0x00..0x17 bytes follow)\n    UTF8_STRING, // 0x60\n    UTF8_STRING, // 0x61\n    UTF8_STRING, // 0x62\n    UTF8_STRING, // 0x63\n    UTF8_STRING, // 0x64\n    UTF8_STRING, // 0x65\n    UTF8_STRING, // 0x66\n    UTF8_STRING, // 0x67\n    UTF8_STRING, // 0x68\n    UTF8_STRING, // 0x69\n    UTF8_STRING, // 0x6A\n    UTF8_STRING, // 0x6B\n    UTF8_STRING, // 0x6C\n    UTF8_STRING, // 0x6D\n    UTF8_STRING, // 0x6E\n    UTF8_STRING, // 0x6F\n    UTF8_STRING, // 0x70\n    UTF8_STRING, // 0x71\n    UTF8_STRING, // 0x72\n    UTF8_STRING, // 0x73\n    UTF8_STRING, // 0x74\n    UTF8_STRING, // 0x75\n    UTF8_STRING, // 0x76\n    UTF8_STRING, // 0x77\n    // UTF-8 string (one-byte uint8_t for n, and then n bytes follow)\n    UTF8_STRING_8, // 0x78\n    // UTF-8 string (two-byte uint16_t for n, and then n bytes follow)\n    UTF8_STRING_16, // 0x79\n    // UTF-8 string (four-byte uint32_t for n, and then n bytes follow)\n    UTF8_STRING_32, // 0x7a\n    // UTF-8 string (eight-byte uint64_t for n, and then n bytes follow)\n    UTF8_STRING_64, // 0x7b\n    // UTF-8 string, UTF-8 strings follow, terminated by \"break\"\n    ERROR, // 0x7c\n    ERROR, // 0x7d\n    ERROR, // 0x7e\n    UTF8_STRING_BREAK, // 0x7f\n    // array (0x00..0x17 data items follow)\n    ARRAY, // 0x80\n    ARRAY, // 0x81\n    ARRAY, // 0x82\n    ARRAY, // 0x83\n    ARRAY, // 0x84\n    ARRAY, // 0x85\n    ARRAY, // 0x86\n    ARRAY, // 0x87\n    ARRAY, // 0x88\n    ARRAY, // 0x89\n    ARRAY, // 0x8A\n    ARRAY, // 0x8B\n    ARRAY, // 0x8C\n    ARRAY, // 0x8D\n    ARRAY, // 0x8E\n    ARRAY, // 0x8F\n    ARRAY, // 0x90\n    ARRAY, // 0x91\n    ARRAY, // 0x92\n    ARRAY, // 0x93\n    ARRAY, // 0x94\n    ARRAY, // 0x95\n    ARRAY, // 0x96\n    ARRAY, // 0x97\n    // array (one-byte uint8_t fo, and then n data items follow)\n    ARRAY_8, // 0x98\n    // array (two-byte uint16_t for n, and then n data items follow)\n    ARRAY_16, // 0x99\n    // array (four-byte uint32_t for n, and then n data items follow)\n    ARRAY_32, // 0x9a\n    // array (eight-byte uint64_t for n, and then n data items follow)\n    ARRAY_64, // 0x9b\n    // array, data items follow, terminated by \"break\"\n    ERROR, // 0x9c\n    ERROR, // 0x9d\n    ERROR, // 0x9e\n    ARRAY_BREAK, // 0x9f\n    // map (0x00..0x17 pairs of data items follow)\n    MAP, // 0xa0\n    MAP, // 0xa1\n    MAP, // 0xa2\n    MAP, // 0xa3\n    MAP, // 0xa4\n    MAP, // 0xa5\n    MAP, // 0xa6\n    MAP, // 0xa7\n    MAP, // 0xa8\n    MAP, // 0xa9\n    MAP, // 0xaA\n    MAP, // 0xaB\n    MAP, // 0xaC\n    MAP, // 0xaD\n    MAP, // 0xaE\n    MAP, // 0xaF\n    MAP, // 0xb0\n    MAP, // 0xb1\n    MAP, // 0xb2\n    MAP, // 0xb3\n    MAP, // 0xb4\n    MAP, // 0xb5\n    MAP, // 0xb6\n    MAP, // 0xb7\n    // map (one-byte uint8_t for n, and then n pairs of data items follow)\n    MAP_8, // 0xb8\n    // map (two-byte uint16_t for n, and then n pairs of data items follow)\n    MAP_16, // 0xb9\n    // map (four-byte uint32_t for n, and then n pairs of data items follow)\n    MAP_32, // 0xba\n    // map (eight-byte uint64_t for n, and then n pairs of data items follow)\n    MAP_64, // 0xbb\n    ERROR, // 0xbc\n    ERROR, // 0xbd\n    ERROR, // 0xbe\n    // map, pairs of data items follow, terminated by \"break\"\n    MAP_BREAK, // 0xbf\n    // Text-based date/time (data item follows; see Section 2.4.1)\n    TAG_KNOWN, // 0xc0\n    // Epoch-based date/time (data item follows; see Section 2.4.1)\n    TAG_KNOWN, // 0xc1\n    // Positive bignum (data item \"byte string\" follows)\n    TAG_KNOWN, // 0xc2\n    // Negative bignum (data item \"byte string\" follows)\n    TAG_KNOWN, // 0xc3\n    // Decimal Fraction (data item \"array\" follows; see Section 2.4.3)\n    TAG_KNOWN, // 0xc4\n    // Bigfloat (data item \"array\" follows; see Section 2.4.3)\n    TAG_KNOWN, // 0xc5\n    // (tagged item)\n    TAG_UNASSIGNED, // 0xc6\n    TAG_UNASSIGNED, // 0xc7\n    TAG_UNASSIGNED, // 0xc8\n    TAG_UNASSIGNED, // 0xc9\n    TAG_UNASSIGNED, // 0xca\n    TAG_UNASSIGNED, // 0xcb\n    TAG_UNASSIGNED, // 0xcc\n    TAG_UNASSIGNED, // 0xcd\n    TAG_UNASSIGNED, // 0xce\n    TAG_UNASSIGNED, // 0xcf\n    TAG_UNASSIGNED, // 0xd0\n    TAG_UNASSIGNED, // 0xd1\n    TAG_UNASSIGNED, // 0xd2\n    TAG_UNASSIGNED, // 0xd3\n    TAG_UNASSIGNED, // 0xd4\n    // Expected Conversion (data item follows; see Section 2.4.4.2)\n    TAG_UNASSIGNED, // 0xd5\n    TAG_UNASSIGNED, // 0xd6\n    TAG_UNASSIGNED, // 0xd7\n    // (more tagged items, 1/2/4/8 bytes and then a data item follow)\n    TAG_MORE_1, // 0xd8\n    TAG_MORE_2, // 0xd9\n    TAG_MORE_4, // 0xda\n    TAG_MORE_8, // 0xdb\n    ERROR, // 0xdc\n    ERROR, // 0xdd\n    ERROR, // 0xde\n    ERROR, // 0xdf\n    // (simple value)\n    SIMPLE_UNASSIGNED, // 0xe0\n    SIMPLE_UNASSIGNED, // 0xe1\n    SIMPLE_UNASSIGNED, // 0xe2\n    SIMPLE_UNASSIGNED, // 0xe3\n    SIMPLE_UNASSIGNED, // 0xe4\n    SIMPLE_UNASSIGNED, // 0xe5\n    SIMPLE_UNASSIGNED, // 0xe6\n    SIMPLE_UNASSIGNED, // 0xe7\n    SIMPLE_UNASSIGNED, // 0xe8\n    SIMPLE_UNASSIGNED, // 0xe9\n    SIMPLE_UNASSIGNED, // 0xea\n    SIMPLE_UNASSIGNED, // 0xeb\n    SIMPLE_UNASSIGNED, // 0xec\n    SIMPLE_UNASSIGNED, // 0xed\n    SIMPLE_UNASSIGNED, // 0xee\n    SIMPLE_UNASSIGNED, // 0xef\n    SIMPLE_UNASSIGNED, // 0xf0\n    SIMPLE_UNASSIGNED, // 0xf1\n    SIMPLE_UNASSIGNED, // 0xf2\n    SIMPLE_UNASSIGNED, // 0xf3\n    // False\n    SIMPLE_FALSE, // 0xf4\n    // True\n    SIMPLE_TRUE, // 0xf5\n    // Null\n    SIMPLE_NULL, // 0xf6\n    // Undefined\n    SIMPLE_UNDEFINED, // 0xf7\n    // (simple value, one byte follows)\n    SIMPLE_BYTE, // 0xf8\n    // Half-Precision Float (two-byte IEEE 754)\n    SIMPLE_FLOAT_HALF, // 0xf9\n    // Single-Precision Float (four-byte IEEE 754)\n    SIMPLE_FLOAT_SINGLE, // 0xfa\n    // Double-Precision Float (eight-byte IEEE 754)\n    SIMPLE_FLOAT_DOUBLE, // 0xfb\n    ERROR, // 0xfc\n    ERROR, // 0xfd\n    ERROR, // 0xfe\n    // \"break\" stop code\n    BREAK // 0xff\n  ]\n\n  // --\n\n  return {\n    parse: parse\n  }\n}\n","'use strict'\n\nconst { Buffer } = require('buffer')\nconst Bignumber = require('bignumber.js').BigNumber\n\nconst constants = require('./constants')\nconst SHIFT32 = constants.SHIFT32\nconst SHIFT16 = constants.SHIFT16\nconst MAX_SAFE_HIGH = 0x1fffff\n\nexports.parseHalf = function parseHalf (buf) {\n  const sign = buf[0] & 0x80 ? -1 : 1\n  const exp = (buf[0] & 0x7C) >> 2\n  const mant = ((buf[0] & 0x03) << 8) | buf[1]\n  if (!exp) {\n    return sign * 5.9604644775390625e-8 * mant\n  } else if (exp === 0x1f) {\n    return sign * (mant ? 0 / 0 : 2e308) // eslint-disable-line no-loss-of-precision\n  } else {\n    return sign * Math.pow(2, exp - 25) * (1024 + mant)\n  }\n}\n\nfunction toHex (n) {\n  if (n < 16) {\n    return '0' + n.toString(16)\n  }\n\n  return n.toString(16)\n}\n\nexports.arrayBufferToBignumber = function (buf) {\n  const len = buf.byteLength\n  let res = ''\n  for (let i = 0; i < len; i++) {\n    res += toHex(buf[i])\n  }\n\n  return new Bignumber(res, 16)\n}\n\n// convert an Object into a Map\nexports.buildMap = (obj) => {\n  const res = new Map()\n  const keys = Object.keys(obj)\n  const length = keys.length\n  for (let i = 0; i < length; i++) {\n    res.set(keys[i], obj[keys[i]])\n  }\n  return res\n}\n\nexports.buildInt32 = (f, g) => {\n  return f * SHIFT16 + g\n}\n\nexports.buildInt64 = (f1, f2, g1, g2) => {\n  const f = exports.buildInt32(f1, f2)\n  const g = exports.buildInt32(g1, g2)\n\n  if (f > MAX_SAFE_HIGH) {\n    return new Bignumber(f).times(SHIFT32).plus(g)\n  } else {\n    return (f * SHIFT32) + g\n  }\n}\n\nexports.writeHalf = function writeHalf (buf, half) {\n  // assume 0, -0, NaN, Infinity, and -Infinity have already been caught\n\n  // HACK: everyone settle in.  This isn't going to be pretty.\n  // Translate cn-cbor's C code (from Carsten Borman):\n\n  // uint32_t be32;\n  // uint16_t be16, u16;\n  // union {\n  //   float f;\n  //   uint32_t u;\n  // } u32;\n  // u32.f = float_val;\n\n  const u32 = Buffer.allocUnsafe(4)\n  u32.writeFloatBE(half, 0)\n  const u = u32.readUInt32BE(0)\n\n  // if ((u32.u & 0x1FFF) == 0) { /* worth trying half */\n\n  // hildjj: If the lower 13 bits are 0, we won't lose anything in the conversion\n  if ((u & 0x1FFF) !== 0) {\n    return false\n  }\n\n  //   int s16 = (u32.u >> 16) & 0x8000;\n  //   int exp = (u32.u >> 23) & 0xff;\n  //   int mant = u32.u & 0x7fffff;\n\n  let s16 = (u >> 16) & 0x8000 // top bit is sign\n  const exp = (u >> 23) & 0xff // then 5 bits of exponent\n  const mant = u & 0x7fffff\n\n  //   if (exp == 0 && mant == 0)\n  //     ;              /* 0.0, -0.0 */\n\n  // hildjj: zeros already handled.  Assert if you don't believe me.\n\n  //   else if (exp >= 113 && exp <= 142) /* normalized */\n  //     s16 += ((exp - 112) << 10) + (mant >> 13);\n  if ((exp >= 113) && (exp <= 142)) {\n    s16 += ((exp - 112) << 10) + (mant >> 13)\n\n  //   else if (exp >= 103 && exp < 113) { /* denorm, exp16 = 0 */\n  //     if (mant & ((1 << (126 - exp)) - 1))\n  //       goto float32;         /* loss of precision */\n  //     s16 += ((mant + 0x800000) >> (126 - exp));\n  } else if ((exp >= 103) && (exp < 113)) {\n    if (mant & ((1 << (126 - exp)) - 1)) {\n      return false\n    }\n    s16 += ((mant + 0x800000) >> (126 - exp))\n\n    //   } else if (exp == 255 && mant == 0) { /* Inf */\n    //     s16 += 0x7c00;\n\n    // hildjj: Infinity already handled\n\n  //   } else\n  //     goto float32;           /* loss of range */\n  } else {\n    return false\n  }\n\n  //   ensure_writable(3);\n  //   u16 = s16;\n  //   be16 = hton16p((const uint8_t*)&u16);\n  buf.writeUInt16BE(s16, 0)\n  return true\n}\n\nexports.keySorter = function (a, b) {\n  const lenA = a[0].byteLength\n  const lenB = b[0].byteLength\n\n  if (lenA > lenB) {\n    return 1\n  }\n\n  if (lenB > lenA) {\n    return -1\n  }\n\n  return a[0].compare(b[0])\n}\n\n// Adapted from http://www.2ality.com/2012/03/signedzero.html\nexports.isNegativeZero = (x) => {\n  return x === 0 && (1 / x < 0)\n}\n\nexports.nextPowerOf2 = (n) => {\n  let count = 0\n  // First n in the below condition is for\n  // the case where n is 0\n  if (n && !(n & (n - 1))) {\n    return n\n  }\n\n  while (n !== 0) {\n    n >>= 1\n    count += 1\n  }\n\n  return 1 << count\n}\n","'use strict'\n\nconst Bignumber = require('bignumber.js').BigNumber\n\nexports.MT = {\n  POS_INT: 0,\n  NEG_INT: 1,\n  BYTE_STRING: 2,\n  UTF8_STRING: 3,\n  ARRAY: 4,\n  MAP: 5,\n  TAG: 6,\n  SIMPLE_FLOAT: 7\n}\n\nexports.TAG = {\n  DATE_STRING: 0,\n  DATE_EPOCH: 1,\n  POS_BIGINT: 2,\n  NEG_BIGINT: 3,\n  DECIMAL_FRAC: 4,\n  BIGFLOAT: 5,\n  BASE64URL_EXPECTED: 21,\n  BASE64_EXPECTED: 22,\n  BASE16_EXPECTED: 23,\n  CBOR: 24,\n  URI: 32,\n  BASE64URL: 33,\n  BASE64: 34,\n  REGEXP: 35,\n  MIME: 36\n}\n\nexports.NUMBYTES = {\n  ZERO: 0,\n  ONE: 24,\n  TWO: 25,\n  FOUR: 26,\n  EIGHT: 27,\n  INDEFINITE: 31\n}\n\nexports.SIMPLE = {\n  FALSE: 20,\n  TRUE: 21,\n  NULL: 22,\n  UNDEFINED: 23\n}\n\nexports.SYMS = {\n  NULL: Symbol('null'),\n  UNDEFINED: Symbol('undef'),\n  PARENT: Symbol('parent'),\n  BREAK: Symbol('break'),\n  STREAM: Symbol('stream')\n}\n\nexports.SHIFT32 = Math.pow(2, 32)\nexports.SHIFT16 = Math.pow(2, 16)\n\nexports.MAX_SAFE_HIGH = 0x1fffff\nexports.NEG_ONE = new Bignumber(-1)\nexports.TEN = new Bignumber(10)\nexports.TWO = new Bignumber(2)\n\nexports.PARENT = {\n  ARRAY: 0,\n  OBJECT: 1,\n  MAP: 2,\n  TAG: 3,\n  BYTE_STRING: 4,\n  UTF8_STRING: 5\n}\n","'use strict'\n\nconst constants = require('./constants')\nconst MT = constants.MT\nconst SIMPLE = constants.SIMPLE\nconst SYMS = constants.SYMS\n\n/**\n * A CBOR Simple Value that does not map onto a known constant.\n */\nclass Simple {\n  /**\n   * Creates an instance of Simple.\n   *\n   * @param {integer} value - the simple value's integer value\n   */\n  constructor (value) {\n    if (typeof value !== 'number') {\n      throw new Error('Invalid Simple type: ' + (typeof value))\n    }\n    if ((value < 0) || (value > 255) || ((value | 0) !== value)) {\n      throw new Error('value must be a small positive integer: ' + value)\n    }\n    this.value = value\n  }\n\n  /**\n   * Debug string for simple value\n   *\n   * @returns {string} simple(value)\n   */\n  toString () {\n    return 'simple(' + this.value + ')'\n  }\n\n  /**\n   * Debug string for simple value\n   *\n   * @returns {string} simple(value)\n   */\n  inspect () {\n    return 'simple(' + this.value + ')'\n  }\n\n  /**\n   * Push the simple value onto the CBOR stream\n   *\n   * @param {cbor.Encoder} gen - The generator to push onto\n   * @returns {number}\n   */\n  encodeCBOR (gen) {\n    return gen._pushInt(this.value, MT.SIMPLE_FLOAT)\n  }\n\n  /**\n   * Is the given object a Simple?\n   *\n   * @param {any} obj - object to test\n   * @returns {bool} - is it Simple?\n   */\n  static isSimple (obj) {\n    return obj instanceof Simple\n  }\n\n  /**\n   * Decode from the CBOR additional information into a JavaScript value.\n   * If the CBOR item has no parent, return a \"safe\" symbol instead of\n   * `null` or `undefined`, so that the value can be passed through a\n   * stream in object mode.\n   *\n   * @param {number} val - the CBOR additional info to convert\n   * @param {bool} hasParent - Does the CBOR item have a parent?\n   * @returns {(null | undefined | boolean | symbol)} - the decoded value\n   */\n  static decode (val, hasParent) {\n    if (hasParent == null) {\n      hasParent = true\n    }\n    switch (val) {\n      case SIMPLE.FALSE:\n        return false\n      case SIMPLE.TRUE:\n        return true\n      case SIMPLE.NULL:\n        if (hasParent) {\n          return null\n        } else {\n          return SYMS.NULL\n        }\n      case SIMPLE.UNDEFINED:\n        if (hasParent) {\n          return undefined\n        } else {\n          return SYMS.UNDEFINED\n        }\n      case -1:\n        if (!hasParent) {\n          throw new Error('Invalid BREAK')\n        }\n        return SYMS.BREAK\n      default:\n        return new Simple(val)\n    }\n  }\n}\n\nmodule.exports = Simple\n","'use strict'\n\n/**\n * A CBOR tagged item, where the tag does not have semantics specified at the\n * moment, or those semantics threw an error during parsing. Typically this will\n * be an extension point you're not yet expecting.\n */\nclass Tagged {\n  /**\n   * Creates an instance of Tagged.\n   *\n   * @param {number} tag - the number of the tag\n   * @param {any} value - the value inside the tag\n   * @param {Error} err - the error that was thrown parsing the tag, or null\n   */\n  constructor (tag, value, err) {\n    this.tag = tag\n    this.value = value\n    this.err = err\n    if (typeof this.tag !== 'number') {\n      throw new Error('Invalid tag type (' + (typeof this.tag) + ')')\n    }\n    if ((this.tag < 0) || ((this.tag | 0) !== this.tag)) {\n      throw new Error('Tag must be a positive integer: ' + this.tag)\n    }\n  }\n\n  /**\n   * Convert to a String\n   *\n   * @returns {string} string of the form '1(2)'\n   */\n  toString () {\n    return `${this.tag}(${JSON.stringify(this.value)})`\n  }\n\n  /**\n   * Push the simple value onto the CBOR stream\n   *\n   * @param {cbor.Encoder} gen - The generator to push onto\n   * @returns {number}\n   */\n  encodeCBOR (gen) {\n    gen._pushTag(this.tag)\n    return gen.pushAny(this.value)\n  }\n\n  /**\n   * If we have a converter for this type, do the conversion.  Some converters\n   * are built-in.  Additional ones can be passed in.  If you want to remove\n   * a built-in converter, pass a converter in whose value is 'null' instead\n   * of a function.\n   *\n   * @param {Object} converters - keys in the object are a tag number, the value\n   * is a function that takes the decoded CBOR and returns a JavaScript value\n   * of the appropriate type.  Throw an exception in the function on errors.\n   * @returns {any} - the converted item\n   */\n  convert (converters) {\n    let er, f\n    f = converters != null ? converters[this.tag] : undefined\n    if (typeof f !== 'function') {\n      f = Tagged['_tag' + this.tag]\n      if (typeof f !== 'function') {\n        return this\n      }\n    }\n    try {\n      return f.call(Tagged, this.value)\n    } catch (error) {\n      er = error\n      this.err = er\n      return this\n    }\n  }\n}\n\nmodule.exports = Tagged\n","'use strict'\n\nconst { Buffer } = require('buffer')\nconst { URL } = require('iso-url')\nconst Bignumber = require('bignumber.js').BigNumber\n\nconst utils = require('./utils')\nconst constants = require('./constants')\nconst MT = constants.MT\nconst NUMBYTES = constants.NUMBYTES\nconst SHIFT32 = constants.SHIFT32\nconst SYMS = constants.SYMS\nconst TAG = constants.TAG\nconst HALF = (constants.MT.SIMPLE_FLOAT << 5) | constants.NUMBYTES.TWO\nconst FLOAT = (constants.MT.SIMPLE_FLOAT << 5) | constants.NUMBYTES.FOUR\nconst DOUBLE = (constants.MT.SIMPLE_FLOAT << 5) | constants.NUMBYTES.EIGHT\nconst TRUE = (constants.MT.SIMPLE_FLOAT << 5) | constants.SIMPLE.TRUE\nconst FALSE = (constants.MT.SIMPLE_FLOAT << 5) | constants.SIMPLE.FALSE\nconst UNDEFINED = (constants.MT.SIMPLE_FLOAT << 5) | constants.SIMPLE.UNDEFINED\nconst NULL = (constants.MT.SIMPLE_FLOAT << 5) | constants.SIMPLE.NULL\n\nconst MAXINT_BN = new Bignumber('0x20000000000000')\nconst BUF_NAN = Buffer.from('f97e00', 'hex')\nconst BUF_INF_NEG = Buffer.from('f9fc00', 'hex')\nconst BUF_INF_POS = Buffer.from('f97c00', 'hex')\n\nfunction toType (obj) {\n  // [object Type]\n  // --------8---1\n  return ({}).toString.call(obj).slice(8, -1)\n}\n\n/**\n * Transform JavaScript values into CBOR bytes\n *\n */\nclass Encoder {\n  /**\n   * @param {Object} [options={}]\n   * @param {function(Buffer)} options.stream\n   */\n  constructor (options) {\n    options = options || {}\n\n    this.streaming = typeof options.stream === 'function'\n    this.onData = options.stream\n\n    this.semanticTypes = [\n      [URL, this._pushUrl],\n      [Bignumber, this._pushBigNumber]\n    ]\n\n    const addTypes = options.genTypes || []\n    const len = addTypes.length\n    for (let i = 0; i < len; i++) {\n      this.addSemanticType(\n        addTypes[i][0],\n        addTypes[i][1]\n      )\n    }\n\n    this._reset()\n  }\n\n  addSemanticType (type, fun) {\n    const len = this.semanticTypes.length\n    for (let i = 0; i < len; i++) {\n      const typ = this.semanticTypes[i][0]\n      if (typ === type) {\n        const old = this.semanticTypes[i][1]\n        this.semanticTypes[i][1] = fun\n        return old\n      }\n    }\n    this.semanticTypes.push([type, fun])\n    return null\n  }\n\n  push (val) {\n    if (!val) {\n      return true\n    }\n\n    this.result[this.offset] = val\n    this.resultMethod[this.offset] = 0\n    this.resultLength[this.offset] = val.length\n    this.offset++\n\n    if (this.streaming) {\n      this.onData(this.finalize())\n    }\n\n    return true\n  }\n\n  pushWrite (val, method, len) {\n    this.result[this.offset] = val\n    this.resultMethod[this.offset] = method\n    this.resultLength[this.offset] = len\n    this.offset++\n\n    if (this.streaming) {\n      this.onData(this.finalize())\n    }\n\n    return true\n  }\n\n  _pushUInt8 (val) {\n    return this.pushWrite(val, 1, 1)\n  }\n\n  _pushUInt16BE (val) {\n    return this.pushWrite(val, 2, 2)\n  }\n\n  _pushUInt32BE (val) {\n    return this.pushWrite(val, 3, 4)\n  }\n\n  _pushDoubleBE (val) {\n    return this.pushWrite(val, 4, 8)\n  }\n\n  _pushNaN () {\n    return this.push(BUF_NAN)\n  }\n\n  _pushInfinity (obj) {\n    const half = (obj < 0) ? BUF_INF_NEG : BUF_INF_POS\n    return this.push(half)\n  }\n\n  _pushFloat (obj) {\n    const b2 = Buffer.allocUnsafe(2)\n\n    if (utils.writeHalf(b2, obj)) {\n      if (utils.parseHalf(b2) === obj) {\n        return this._pushUInt8(HALF) && this.push(b2)\n      }\n    }\n\n    const b4 = Buffer.allocUnsafe(4)\n    b4.writeFloatBE(obj, 0)\n    if (b4.readFloatBE(0) === obj) {\n      return this._pushUInt8(FLOAT) && this.push(b4)\n    }\n\n    return this._pushUInt8(DOUBLE) && this._pushDoubleBE(obj)\n  }\n\n  _pushInt (obj, mt, orig) {\n    const m = mt << 5\n    if (obj < 24) {\n      return this._pushUInt8(m | obj)\n    }\n\n    if (obj <= 0xff) {\n      return this._pushUInt8(m | NUMBYTES.ONE) && this._pushUInt8(obj)\n    }\n\n    if (obj <= 0xffff) {\n      return this._pushUInt8(m | NUMBYTES.TWO) && this._pushUInt16BE(obj)\n    }\n\n    if (obj <= 0xffffffff) {\n      return this._pushUInt8(m | NUMBYTES.FOUR) && this._pushUInt32BE(obj)\n    }\n\n    if (obj <= Number.MAX_SAFE_INTEGER) {\n      return this._pushUInt8(m | NUMBYTES.EIGHT) &&\n        this._pushUInt32BE(Math.floor(obj / SHIFT32)) &&\n        this._pushUInt32BE(obj % SHIFT32)\n    }\n\n    if (mt === MT.NEG_INT) {\n      return this._pushFloat(orig)\n    }\n\n    return this._pushFloat(obj)\n  }\n\n  _pushIntNum (obj) {\n    if (obj < 0) {\n      return this._pushInt(-obj - 1, MT.NEG_INT, obj)\n    } else {\n      return this._pushInt(obj, MT.POS_INT)\n    }\n  }\n\n  _pushNumber (obj) {\n    switch (false) {\n      case (obj === obj): // eslint-disable-line\n        return this._pushNaN(obj)\n      case isFinite(obj):\n        return this._pushInfinity(obj)\n      case ((obj % 1) !== 0):\n        return this._pushIntNum(obj)\n      default:\n        return this._pushFloat(obj)\n    }\n  }\n\n  _pushString (obj) {\n    const len = Buffer.byteLength(obj, 'utf8')\n    return this._pushInt(len, MT.UTF8_STRING) && this.pushWrite(obj, 5, len)\n  }\n\n  _pushBoolean (obj) {\n    return this._pushUInt8(obj ? TRUE : FALSE)\n  }\n\n  _pushUndefined (obj) {\n    return this._pushUInt8(UNDEFINED)\n  }\n\n  _pushArray (gen, obj) {\n    const len = obj.length\n    if (!gen._pushInt(len, MT.ARRAY)) {\n      return false\n    }\n    for (let j = 0; j < len; j++) {\n      if (!gen.pushAny(obj[j])) {\n        return false\n      }\n    }\n    return true\n  }\n\n  _pushTag (tag) {\n    return this._pushInt(tag, MT.TAG)\n  }\n\n  _pushDate (gen, obj) {\n    // Round date, to get seconds since 1970-01-01 00:00:00 as defined in\n    // Sec. 2.4.1 and get a possibly more compact encoding. Note that it is\n    // still allowed to encode fractions of seconds which can be achieved by\n    // changing overwriting the encode function for Date objects.\n    return gen._pushTag(TAG.DATE_EPOCH) && gen.pushAny(Math.round(obj / 1000))\n  }\n\n  _pushBuffer (gen, obj) {\n    return gen._pushInt(obj.length, MT.BYTE_STRING) && gen.push(obj)\n  }\n\n  _pushNoFilter (gen, obj) {\n    return gen._pushBuffer(gen, obj.slice())\n  }\n\n  _pushRegexp (gen, obj) {\n    return gen._pushTag(TAG.REGEXP) && gen.pushAny(obj.source)\n  }\n\n  _pushSet (gen, obj) {\n    if (!gen._pushInt(obj.size, MT.ARRAY)) {\n      return false\n    }\n    for (const x of obj) {\n      if (!gen.pushAny(x)) {\n        return false\n      }\n    }\n    return true\n  }\n\n  _pushUrl (gen, obj) {\n    return gen._pushTag(TAG.URI) && gen.pushAny(obj.format())\n  }\n\n  _pushBigint (obj) {\n    let tag = TAG.POS_BIGINT\n    if (obj.isNegative()) {\n      obj = obj.negated().minus(1)\n      tag = TAG.NEG_BIGINT\n    }\n    let str = obj.toString(16)\n    if (str.length % 2) {\n      str = '0' + str\n    }\n    const buf = Buffer.from(str, 'hex')\n    return this._pushTag(tag) && this._pushBuffer(this, buf)\n  }\n\n  _pushBigNumber (gen, obj) {\n    if (obj.isNaN()) {\n      return gen._pushNaN()\n    }\n    if (!obj.isFinite()) {\n      return gen._pushInfinity(obj.isNegative() ? -Infinity : Infinity)\n    }\n    if (obj.isInteger()) {\n      return gen._pushBigint(obj)\n    }\n    if (!(gen._pushTag(TAG.DECIMAL_FRAC) &&\n      gen._pushInt(2, MT.ARRAY))) {\n      return false\n    }\n\n    const dec = obj.decimalPlaces()\n    const slide = obj.multipliedBy(new Bignumber(10).pow(dec))\n    if (!gen._pushIntNum(-dec)) {\n      return false\n    }\n    if (slide.abs().isLessThan(MAXINT_BN)) {\n      return gen._pushIntNum(slide.toNumber())\n    } else {\n      return gen._pushBigint(slide)\n    }\n  }\n\n  _pushMap (gen, obj) {\n    if (!gen._pushInt(obj.size, MT.MAP)) {\n      return false\n    }\n\n    return this._pushRawMap(\n      obj.size,\n      Array.from(obj)\n    )\n  }\n\n  _pushObject (obj) {\n    if (!obj) {\n      return this._pushUInt8(NULL)\n    }\n\n    const len = this.semanticTypes.length\n    for (let i = 0; i < len; i++) {\n      if (obj instanceof this.semanticTypes[i][0]) {\n        return this.semanticTypes[i][1].call(obj, this, obj)\n      }\n    }\n\n    const f = obj.encodeCBOR\n    if (typeof f === 'function') {\n      return f.call(obj, this)\n    }\n\n    const keys = Object.keys(obj)\n    const keyLength = keys.length\n    if (!this._pushInt(keyLength, MT.MAP)) {\n      return false\n    }\n\n    return this._pushRawMap(\n      keyLength,\n      keys.map((k) => [k, obj[k]])\n    )\n  }\n\n  _pushRawMap (len, map) {\n    // Sort keys for canoncialization\n    // 1. encode key\n    // 2. shorter key comes before longer key\n    // 3. same length keys are sorted with lower\n    //    byte value before higher\n\n    map = map.map(function (a) {\n      a[0] = Encoder.encode(a[0])\n      return a\n    }).sort(utils.keySorter)\n\n    for (let j = 0; j < len; j++) {\n      if (!this.push(map[j][0])) {\n        return false\n      }\n\n      if (!this.pushAny(map[j][1])) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  /**\n   * Alias for `.pushAny`\n   *\n   * @param {*} obj\n   * @returns {boolean} true on success\n   */\n  write (obj) {\n    return this.pushAny(obj)\n  }\n\n  /**\n   * Push any supported type onto the encoded stream\n   *\n   * @param {any} obj\n   * @returns {boolean} true on success\n   */\n  pushAny (obj) {\n    const typ = toType(obj)\n\n    switch (typ) {\n      case 'Number':\n        return this._pushNumber(obj)\n      case 'String':\n        return this._pushString(obj)\n      case 'Boolean':\n        return this._pushBoolean(obj)\n      case 'Object':\n        return this._pushObject(obj)\n      case 'Array':\n        return this._pushArray(this, obj)\n      case 'Uint8Array':\n        return this._pushBuffer(this, Buffer.isBuffer(obj) ? obj : Buffer.from(obj))\n      case 'Null':\n        return this._pushUInt8(NULL)\n      case 'Undefined':\n        return this._pushUndefined(obj)\n      case 'Map':\n        return this._pushMap(this, obj)\n      case 'Set':\n        return this._pushSet(this, obj)\n      case 'URL':\n        return this._pushUrl(this, obj)\n      case 'BigNumber':\n        return this._pushBigNumber(this, obj)\n      case 'Date':\n        return this._pushDate(this, obj)\n      case 'RegExp':\n        return this._pushRegexp(this, obj)\n      case 'Symbol':\n        switch (obj) {\n          case SYMS.NULL:\n            return this._pushObject(null)\n          case SYMS.UNDEFINED:\n            return this._pushUndefined(undefined)\n          // TODO: Add pluggable support for other symbols\n          default:\n            throw new Error('Unknown symbol: ' + obj.toString())\n        }\n      default:\n        throw new Error('Unknown type: ' + typeof obj + ', ' + (obj ? obj.toString() : ''))\n    }\n  }\n\n  finalize () {\n    if (this.offset === 0) {\n      return null\n    }\n\n    const result = this.result\n    const resultLength = this.resultLength\n    const resultMethod = this.resultMethod\n    const offset = this.offset\n\n    // Determine the size of the buffer\n    let size = 0\n    let i = 0\n\n    for (; i < offset; i++) {\n      size += resultLength[i]\n    }\n\n    const res = Buffer.allocUnsafe(size)\n    let index = 0\n    let length = 0\n\n    // Write the content into the result buffer\n    for (i = 0; i < offset; i++) {\n      length = resultLength[i]\n\n      switch (resultMethod[i]) {\n        case 0:\n          result[i].copy(res, index)\n          break\n        case 1:\n          res.writeUInt8(result[i], index, true)\n          break\n        case 2:\n          res.writeUInt16BE(result[i], index, true)\n          break\n        case 3:\n          res.writeUInt32BE(result[i], index, true)\n          break\n        case 4:\n          res.writeDoubleBE(result[i], index, true)\n          break\n        case 5:\n          res.write(result[i], index, length, 'utf8')\n          break\n        default:\n          throw new Error('unkown method')\n      }\n\n      index += length\n    }\n\n    const tmp = res\n\n    this._reset()\n\n    return tmp\n  }\n\n  _reset () {\n    this.result = []\n    this.resultMethod = []\n    this.resultLength = []\n    this.offset = 0\n  }\n\n  /**\n   * Encode the given value\n   *\n   * @param {*} o\n   * @returns {Buffer}\n   */\n  static encode (o) {\n    const enc = new Encoder()\n    const ret = enc.pushAny(o)\n    if (!ret) {\n      throw new Error('Failed to encode input')\n    }\n\n    return enc.finalize()\n  }\n}\n\nmodule.exports = Encoder\n","'use strict'\n\nconst CID = require('cids')\nconst util = require('./util')\n\n/**\n * Resolves a path within a CBOR block.\n *\n * Returns the value or a link and the partial mising path. This way the\n * IPLD Resolver can fetch the link and continue to resolve.\n *\n * @param {Uint8Array} binaryBlob - Binary representation of a CBOR block\n * @param {string} [path='/'] - Path that should be resolved\n */\nexports.resolve = (binaryBlob, path = '') => {\n  let node = util.deserialize(binaryBlob)\n\n  const parts = path.split('/').filter(Boolean)\n  while (parts.length) {\n    const key = parts.shift()\n    if (!key || !(key in node)) {\n      throw new Error(`Object has no property '${key}'`)\n    }\n\n    node = node[key]\n    if (CID.isCID(node)) {\n      return {\n        value: node,\n        remainderPath: parts.join('/')\n      }\n    }\n  }\n\n  return {\n    value: node,\n    remainderPath: ''\n  }\n}\n\n/**\n * @param {any} node\n * @param {string} [path]\n * @returns {Generator<string, void, undefined>}\n */\nconst traverse = function * (node, path) {\n  // Traverse only objects and arrays\n  if (node instanceof Uint8Array || CID.isCID(node) || typeof node === 'string' || node === null) {\n    return\n  }\n\n  for (const item of Object.keys(node)) {\n    const nextpath = path === undefined ? item : path + '/' + item\n    yield nextpath\n    yield * traverse(node[item], nextpath)\n  }\n\n  // to stop eslint and tsc fighting\n  return undefined\n}\n\n/**\n * Return all available paths of a block.\n *\n * @generator\n * @param {Uint8Array} binaryBlob - Binary representation of a CBOR block\n * @yields {string} - A single path\n */\nexports.tree = function * (binaryBlob) {\n  const node = util.deserialize(binaryBlob)\n\n  yield * traverse(node)\n}\n","'use strict'\nconst CID = require('cids')\nconst multihashing = require('multihashing-async')\nconst { multihash } = multihashing\nconst multicodec = require('multicodec')\n\n/**\n * @typedef {import('cids').CIDVersion} CIDVersion\n * @typedef {import('multihashing-async').multihash.HashCode} HashCode\n * @typedef {import('interface-ipld-format').Format<Uint8Array>} RawFormat\n */\n\n/**\n * Binary resolver\n *\n * @type {RawFormat}\n */\nmodule.exports = {\n  codec: multicodec.RAW,\n  defaultHashAlg: multihash.names['sha2-256'],\n  resolver: {\n    /**\n     * Resolves a path within a Raw block.\n     *\n     * Always returns the raw data as value without any remainderPath.\n     *\n     * @param {Uint8Array} binaryBlob - Binary representation of a PB block\n     * @param {string} [path='/'] - Path that should be resolved.  Must be '/' or an exception is thrown\n     */\n    resolve: (binaryBlob, path) => {\n      if (path !== '/') {\n        throw new Error('Only the root path / may be resolved')\n      }\n\n      return {\n        value: binaryBlob,\n        remainderPath: ''\n      }\n    },\n    /**\n     * Return all available paths of a block.\n     *\n     * @generator\n     * @param {Uint8Array} binaryBlob - The raw data\n     */\n    async * tree (binaryBlob) {\n\n    }\n  },\n  util: {\n    /**\n     * @param {Uint8Array} data\n     */\n    deserialize: (data) => {\n      return data\n    },\n    /**\n     * @param {Uint8Array} data\n     */\n    serialize: (data) => {\n      return data\n    },\n    /**\n     * Calculate the CID of the binary blob.\n     *\n     * @param {Uint8Array} binaryBlob - Encoded IPLD Node\n     * @param {Object} [userOptions] - Options to create the CID\n     * @param {CIDVersion} [userOptions.cidVersion=1] - CID version number\n     * @param {HashCode} [userOptions.hashAlg=multihash.names['sha2-256']] - Defaults to the defaultHashAlg of the format\n     */\n    cid: async (binaryBlob, userOptions = {}) => {\n      const options = {\n        cidVersion: userOptions.cidVersion == null ? 1 : userOptions.cidVersion,\n        hashAlg: userOptions.hashAlg == null ? module.exports.defaultHashAlg : userOptions.hashAlg\n      }\n\n      const hashName = multihash.codes[options.hashAlg]\n      const hash = await multihashing(binaryBlob, hashName)\n      const codecName = multicodec.getNameFromCode(module.exports.codec)\n      const cid = new CID(options.cidVersion, codecName, hash)\n\n      return cid\n    }\n  }\n}\n","'use strict'\n\nconst Block = require('ipld-block')\nconst CID = require('cids')\nconst mergeOptions = require('merge-options')\nconst ipldDagCbor = require('ipld-dag-cbor')\nconst ipldDagPb = require('ipld-dag-pb')\nconst ipldRaw = require('ipld-raw')\nconst multicodec = require('multicodec')\n// @ts-ignore no types\nconst typical = require('typical')\nconst { extendIterator } = require('./util')\n\n/**\n * @typedef {import('interface-ipld-format').Format<object>} IPLDFormat\n * @typedef {import('multicodec').CodecCode} CodecCode\n * @typedef {import('./types').LoadFormatFn} LoadFormatFn\n * @typedef {import('./types').Options} Options\n * @typedef {import('./types').PutOptions} PutOptions\n * @typedef {import('./types').GetOptions} GetOptions\n * @typedef {import('./types').ResolveOptions} ResolveOptions\n * @typedef {import('./types').RemoveOptions} RemoveOptions\n * @typedef {import('./types').TreeOptions} TreeOptions\n */\n\nclass IPLDResolver {\n  /**\n   * @param {Options} userOptions\n   */\n  constructor (userOptions) {\n    const options = mergeOptions(IPLDResolver.defaultOptions, userOptions)\n\n    if (!options.blockService) {\n      throw new Error('Missing blockservice')\n    }\n    this.bs = options.blockService\n\n    // Object with current list of active resolvers\n    /** @type {{ [key: number]: IPLDFormat}} */\n    this.resolvers = {}\n\n    if (typeof options.loadFormat !== 'function') {\n      /**\n       * @type {LoadFormatFn}\n       */\n      this.loadFormat = (codec) => {\n        const codecName = multicodec.getNameFromCode(codec)\n        throw new Error(`No resolver found for codec \"${codecName}\"`)\n      }\n    } else {\n      this.loadFormat = options.loadFormat\n    }\n\n    // Enable all supplied formats\n    for (const format of options.formats) {\n      this.addFormat(format)\n    }\n  }\n\n  /**\n   * Add support for an IPLD Format.\n   *\n   * @param {IPLDFormat} format - The implementation of an IPLD Format.\n   */\n  addFormat (format) {\n    const codec = format.codec\n\n    if (this.resolvers[format.codec]) {\n      const codecName = multicodec.getNameFromCode(codec)\n      throw new Error(`Resolver already exists for codec \"${codecName}\"`)\n    }\n\n    this.resolvers[codec] = format\n\n    return this\n  }\n\n  /**\n   * Remove support for an IPLD Format.\n   *\n   * @param {multicodec.CodecCode} codec - The codec of the IPLD Format to remove.\n   */\n  removeFormat (codec) {\n    if (this.resolvers[codec]) {\n      delete this.resolvers[codec]\n    }\n\n    return this\n  }\n\n  /**\n   * Retrieves IPLD Nodes along the `path` that is rooted at `cid`.\n   *\n   * @param {CID} cid - the CID the resolving starts.\n   * @param {string} path - the path that should be resolved.\n   * @param {ResolveOptions} [options]\n   */\n  resolve (cid, path, options) {\n    if (!CID.isCID(cid)) {\n      throw new Error('`cid` argument must be a CID')\n    }\n    if (typeof path !== 'string') {\n      throw new Error('`path` argument must be a string')\n    }\n\n    const ipld = this\n\n    const generator = async function * () {\n      // End iteration if there isn't a CID to follow any more\n      while (true) {\n        const format = await ipld.getFormat(multicodec.getCodeFromName(cid.codec))\n\n        // get block\n        // use local resolver\n        // update path value\n        const block = await ipld.bs.get(cid, options)\n        const result = format.resolver.resolve(block.data, path)\n\n        // Prepare for the next iteration if there is a `remainderPath`\n        path = result.remainderPath\n        let value = result.value\n        // NOTE vmx 2018-11-29: Not all IPLD Formats return links as\n        // CIDs yet. Hence try to convert old style links to CIDs\n        if (Object.keys(value).length === 1 && '/' in value) {\n          try {\n            value = new CID(value['/'])\n          } catch (_error) {\n            value = null\n          }\n        }\n\n        yield {\n          remainderPath: path,\n          value\n        }\n\n        if (CID.isCID(value)) {\n          cid = value\n        } else {\n          return\n        }\n      }\n    }\n\n    return extendIterator(generator())\n  }\n\n  /**\n   * Get a node by CID.\n   *\n   * @param {CID} cid - The CID of the IPLD Node that should be retrieved.\n   * @param {GetOptions} [options]\n   */\n  async get (cid, options) {\n    const block = await this.bs.get(cid, options)\n    const format = await this.getFormat(block.cid.codec)\n    const node = format.util.deserialize(block.data)\n\n    return node\n  }\n\n  /**\n   * Get multiple nodes back from an array of CIDs.\n   *\n   * @param {Iterable.<CID>} cids - The CIDs of the IPLD Nodes that should be retrieved.\n   * @param {GetOptions} [options]\n   */\n  getMany (cids, options) {\n    if (!typical.isIterable(cids) || typeof cids === 'string' ||\n        cids instanceof Uint8Array) {\n      throw new Error('`cids` must be an iterable of CIDs')\n    }\n\n    const ipld = this\n\n    const generator = async function * () {\n      for await (const cid of cids) {\n        yield ipld.get(cid, options)\n      }\n    }\n\n    return extendIterator(generator())\n  }\n\n  /**\n   * Stores the given IPLD Node of a recognized IPLD Format.\n   *\n   * @param {Object} node - The deserialized IPLD node that should be inserted.\n   * @param {CodecCode} format - The multicodec of the format that IPLD Node should be encoded in.\n   * @param {PutOptions} [userOptions] -  Options is an object with the following properties.\n   */\n  async put (node, format, userOptions) {\n    if (format === undefined) {\n      throw new Error('`put` requires a format')\n    }\n    if (typeof format !== 'number') {\n      throw new Error('`format` parameter must be number (multicodec)')\n    }\n\n    const formatImpl = await this.getFormat(format)\n    const defaultOptions = {\n      hashAlg: formatImpl.defaultHashAlg,\n      cidVersion: 1,\n      onlyHash: false\n    }\n    const options = mergeOptions(defaultOptions, userOptions)\n\n    const cidOptions = {\n      cidVersion: options.cidVersion,\n      hashAlg: options.hashAlg,\n      onlyHash: options.onlyHash\n    }\n    const serialized = formatImpl.util.serialize(node)\n    const cid = await formatImpl.util.cid(serialized, cidOptions)\n\n    if (!options.onlyHash) {\n      const block = new Block(serialized, cid)\n      await this.bs.put(block, options)\n    }\n\n    return cid\n  }\n\n  /**\n   * Stores the given IPLD Nodes of a recognized IPLD Format.\n   *\n   * @param {Iterable<any>} nodes - Deserialized IPLD nodes that should be inserted.\n   * @param {CodecCode} format - The multicodec of the format that IPLD Node should be encoded in.\n   * @param {PutOptions} [userOptions] -  Options are applied to any of the `nodes` and is an object with the following properties.\n   */\n  putMany (nodes, format, userOptions) {\n    if (!typical.isIterable(nodes) || typeof nodes === 'string' ||\n        nodes instanceof Uint8Array) {\n      throw new Error('`nodes` must be an iterable')\n    }\n    if (format === undefined) {\n      throw new Error('`put` requires a format')\n    }\n    if (typeof format !== 'number') {\n      throw new Error('`format` parameter must be number (multicodec)')\n    }\n\n    /** @type {PutOptions} */\n    let options\n    /** @type {IPLDFormat} */\n    let formatImpl\n\n    const ipld = this\n\n    const generator = async function * () {\n      for await (const node of nodes) {\n        // Lazy load the options not when the iterator is initialized, but\n        // when we hit the first iteration. This way the constructor can be\n        // a synchronous function.\n        if (options === undefined) {\n          formatImpl = await ipld.getFormat(format)\n          const defaultOptions = {\n            hashAlg: formatImpl.defaultHashAlg,\n            cidVersion: 1,\n            onlyHash: false\n          }\n          options = mergeOptions(defaultOptions, userOptions)\n        }\n\n        yield ipld.put(node, format, options)\n      }\n    }\n\n    return extendIterator(generator())\n  }\n\n  /**\n   * Remove an IPLD Node by the given CID.\n   *\n   * @param {CID} cid - The CID of the IPLD Node that should be removed.\n   * @param {RemoveOptions} [options]\n   */\n  async remove (cid, options) { // eslint-disable-line require-await\n    return this.bs.delete(cid, options)\n  }\n\n  /**\n   * Remove IPLD Nodes by the given CIDs.\n   *\n   * Throws an error if any of the Blocks can’t be removed. This operation is\n   * *not* atomic, some Blocks might have already been removed.\n   *\n   * @param {Iterable<CID>} cids - The CIDs of the IPLD Nodes that should be removed.\n   * @param {RemoveOptions} [options]\n   */\n  removeMany (cids, options) {\n    if (!typical.isIterable(cids) || typeof cids === 'string' ||\n        cids instanceof Uint8Array) {\n      throw new Error('`cids` must be an iterable of CIDs')\n    }\n\n    const ipld = this\n\n    const generator = async function * () {\n      for await (const cid of cids) {\n        yield ipld.remove(cid, options)\n      }\n    }\n\n    return extendIterator(generator())\n  }\n\n  /**\n   * Returns all the paths that can be resolved into.\n   *\n   * @param {CID} cid - The ID to get the paths from\n   * @param {string} [offsetPath=''] - the path to start to retrieve the other paths from.\n   * @param {TreeOptions} [userOptions]\n   */\n  tree (cid, offsetPath, userOptions) {\n    if (typeof offsetPath === 'object') {\n      userOptions = offsetPath\n      offsetPath = undefined\n    }\n    offsetPath = offsetPath || ''\n\n    const defaultOptions = {\n      recursive: false\n    }\n    const options = mergeOptions(defaultOptions, userOptions)\n\n    /**\n     * If a path is a link then follow it and return its CID\n     *\n     * @param {Block} block\n     * @param {string} treePath\n     */\n    const maybeRecurse = async (block, treePath) => {\n      // A treepath we might want to follow recursively\n      const format = await this.getFormat(multicodec.getCodeFromName(block.cid.codec))\n      const result = format.resolver.resolve(block.data, treePath)\n      // Something to follow recursively, hence push it into the queue\n      if (CID.isCID(result.value)) {\n        return result.value\n      }\n    }\n\n    const ipld = this\n\n    const generator = async function * () {\n      // The list of paths that will get returned\n      const treePaths = []\n      // The current block, needed to call `isLink()` on every iteration\n      let block\n      // The list of items we want to follow recursively. The items are\n      // an object consisting of the CID and the currently already resolved\n      // path\n      const queue = [{ cid, basePath: '' }]\n      // The path that was already traversed\n      let basePath\n\n      // End of iteration if there aren't any paths left to return or\n      // if we don't want to traverse recursively and have already\n      // returns the first level\n      while (treePaths.length > 0 || queue.length > 0) {\n        // There aren't any paths left, get them from the given CID\n        if (treePaths.length === 0 && queue.length > 0) {\n          const next = queue.shift()\n\n          if (next) {\n            ({ cid, basePath } = next)\n            const format = await ipld.getFormat(multicodec.getCodeFromName(cid.codec))\n            block = await ipld.bs.get(cid, options)\n\n            const paths = format.resolver.tree(block.data)\n            treePaths.push(...paths)\n          }\n        }\n\n        const treePath = treePaths.shift() || ''\n        let fullPath = basePath + treePath\n\n        // Only follow links if recursion is intended\n        if (options.recursive) {\n          const cid = await maybeRecurse(block, treePath)\n\n          if (cid != null) {\n            queue.push({ cid, basePath: fullPath + '/' })\n          }\n        }\n\n        // Return it if it matches the given offset path, but is not the\n        // offset path itself\n        if (offsetPath !== undefined && fullPath.startsWith(offsetPath) &&\n            fullPath.length > offsetPath.length) {\n          if (offsetPath.length > 0) {\n            fullPath = fullPath.slice(offsetPath.length + 1)\n          }\n\n          yield fullPath\n        }\n      }\n    }\n\n    return extendIterator(generator())\n  }\n\n  /**\n   * @param {CodecCode} codec\n   */\n  async getFormat (codec) {\n    // TODO vmx 2019-01-24: Once all CIDs support accessing the codec code\n    // instead of the name, remove this part\n    if (typeof codec === 'string') {\n      codec = multicodec.getCodeFromName(codec)\n    }\n\n    if (this.resolvers[codec]) {\n      return this.resolvers[codec]\n    }\n\n    // If not supported, attempt to dynamically load this format\n    const format = await this.loadFormat(codec)\n    this.addFormat(format)\n    return format\n  }\n}\n\n/**\n * Default options for IPLD.\n */\nIPLDResolver.defaultOptions = {\n  /** @type {IPLDFormat[]} */\n  formats: [ipldDagCbor, ipldDagPb, ipldRaw]\n}\n\nmodule.exports = IPLDResolver\n","(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :\n  typeof define === 'function' && define.amd ? define(['exports'], factory) :\n  (global = global || self, factory(global.typical = {}));\n}(this, (function (exports) { 'use strict';\n\n  /**\n   * Isomorphic, functional type-checking for Javascript.\n   * @module typical\n   * @typicalname t\n   * @example\n   * const t = require('typical')\n   * const allDefined = array.every(t.isDefined)\n   */\n\n  /**\n   * Returns true if input is a number. It is a more reasonable alternative to `typeof n` which returns `number` for `NaN` and `Infinity`.\n   *\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   * @example\n   * > t.isNumber(0)\n   * true\n   * > t.isNumber(1)\n   * true\n   * > t.isNumber(1.1)\n   * true\n   * > t.isNumber(0xff)\n   * true\n   * > t.isNumber(0644)\n   * true\n   * > t.isNumber(6.2e5)\n   * true\n   * > t.isNumber(NaN)\n   * false\n   * > t.isNumber(Infinity)\n   * false\n   */\n  function isNumber (n) {\n    return !isNaN(parseFloat(n)) && isFinite(n)\n  }\n\n  /**\n   * A plain object is a simple object literal, it is not an instance of a class. Returns true if the input `typeof` is `object` and directly decends from `Object`.\n   *\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   * @example\n   * > t.isPlainObject({ something: 'one' })\n   * true\n   * > t.isPlainObject(new Date())\n   * false\n   * > t.isPlainObject([ 0, 1 ])\n   * false\n   * > t.isPlainObject(/test/)\n   * false\n   * > t.isPlainObject(1)\n   * false\n   * > t.isPlainObject('one')\n   * false\n   * > t.isPlainObject(null)\n   * false\n   * > t.isPlainObject((function * () {})())\n   * false\n   * > t.isPlainObject(function * () {})\n   * false\n   */\n  function isPlainObject (input) {\n    return input !== null && typeof input === 'object' && input.constructor === Object\n  }\n\n  /**\n   * An array-like value has all the properties of an array yet is not an array instance. An example is the `arguments` object. Returns `true`` if the input value is an object, not `null`` and has a `length` property set with a numeric value.\n   *\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   * @example\n   * function sum(x, y){\n   *   console.log(t.isArrayLike(arguments))\n   *   // prints `true`\n   * }\n   */\n  function isArrayLike (input) {\n    return isObject(input) && typeof input.length === 'number'\n  }\n\n  /**\n   * Returns true if the typeof input is `'object'` but not null.\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   */\n  function isObject (input) {\n    return typeof input === 'object' && input !== null\n  }\n\n  /**\n   * Returns true if the input value is defined.\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   */\n  function isDefined (input) {\n    return typeof input !== 'undefined'\n  }\n\n  /**\n   * Returns true if the input value is undefined.\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   */\n  function isUndefined (input) {\n    return !isDefined(input)\n  }\n\n  /**\n   * Returns true if the input value is null.\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   */\n  function isNull (input) {\n   return input === null\n  }\n\n  /**\n   * Returns true if the input value is not one of `undefined`, `null`, or `NaN`.\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   */\n  function isDefinedValue (input) {\n   return isDefined(input) && !isNull(input) && !Number.isNaN(input)\n  }\n\n  /**\n   * Returns true if the input value is an ES2015 `class`.\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   */\n  function isClass (input) {\n    if (typeof input === 'function') {\n      return /^class /.test(Function.prototype.toString.call(input))\n    } else {\n      return false\n    }\n  }\n\n  /**\n   * Returns true if the input is a string, number, symbol, boolean, null or undefined value.\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   */\n  function isPrimitive (input) {\n    if (input === null) return true\n    switch (typeof input) {\n      case 'string':\n      case 'number':\n      case 'symbol':\n      case 'undefined':\n      case 'boolean':\n        return true\n      default:\n        return false\n    }\n  }\n\n  /**\n   * Returns true if the input is a Promise.\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   */\n  function isPromise (input) {\n    if (input) {\n      const isPromise = isDefined(Promise) && input instanceof Promise;\n      const isThenable = input.then && typeof input.then === 'function';\n      return !!(isPromise || isThenable)\n    } else {\n      return false\n    }\n  }\n\n  /**\n   * Returns true if the input is an iterable (`Map`, `Set`, `Array`, Generator etc.).\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   * @example\n   * > t.isIterable('string')\n   * true\n   * > t.isIterable(new Map())\n   * true\n   * > t.isIterable([])\n   * true\n   * > t.isIterable((function * () {})())\n   * true\n   * > t.isIterable(Promise.resolve())\n   * false\n   * > t.isIterable(Promise)\n   * false\n   * > t.isIterable(true)\n   * false\n   * > t.isIterable({})\n   * false\n   * > t.isIterable(0)\n   * false\n   * > t.isIterable(1.1)\n   * false\n   * > t.isIterable(NaN)\n   * false\n   * > t.isIterable(Infinity)\n   * false\n   * > t.isIterable(function () {})\n   * false\n   * > t.isIterable(Date)\n   * false\n   * > t.isIterable()\n   * false\n   * > t.isIterable({ then: function () {} })\n   * false\n   */\n  function isIterable (input) {\n    if (input === null || !isDefined(input)) {\n      return false\n    } else {\n      return (\n        typeof input[Symbol.iterator] === 'function' ||\n        typeof input[Symbol.asyncIterator] === 'function'\n      )\n    }\n  }\n\n  /**\n   * Returns true if the input value is a string. The equivalent of `typeof input === 'string'` for use in funcitonal contexts.\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   */\n  function isString (input) {\n    return typeof input === 'string'\n  }\n\n  /**\n   * Returns true if the input value is a function. The equivalent of `typeof input === 'function'` for use in funcitonal contexts.\n   * @param {*} - the input to test\n   * @returns {boolean}\n   * @static\n   */\n  function isFunction (input) {\n    return typeof input === 'function'\n  }\n\n  var index = {\n    isNumber,\n    isPlainObject,\n    isArrayLike,\n    isObject,\n    isDefined,\n    isUndefined,\n    isNull,\n    isDefinedValue,\n    isClass,\n    isPrimitive,\n    isPromise,\n    isIterable,\n    isString,\n    isFunction\n  };\n\n  exports.default = index;\n  exports.isArrayLike = isArrayLike;\n  exports.isClass = isClass;\n  exports.isDefined = isDefined;\n  exports.isDefinedValue = isDefinedValue;\n  exports.isFunction = isFunction;\n  exports.isIterable = isIterable;\n  exports.isNull = isNull;\n  exports.isNumber = isNumber;\n  exports.isObject = isObject;\n  exports.isPlainObject = isPlainObject;\n  exports.isPrimitive = isPrimitive;\n  exports.isPromise = isPromise;\n  exports.isString = isString;\n  exports.isUndefined = isUndefined;\n\n  Object.defineProperty(exports, '__esModule', { value: true });\n\n})));\n","'use strict'\n\n/**\n * @template T\n *\n * @param {AsyncIterable<T>} iterator\n */\nexports.first = async (iterator) => {\n  for await (const value of iterator) { // eslint-disable-line no-unreachable-loop\n    return value\n  }\n}\n\n/**\n * @template T\n *\n * @param {AsyncIterable<T>} iterator\n */\nexports.last = async (iterator) => {\n  let value\n  for await (value of iterator) {\n    // Intentionally empty\n  }\n  return value\n}\n\n/**\n * @template T\n *\n * @param {AsyncIterable<T>} iterator\n */\nexports.all = async (iterator) => {\n  const values = []\n  for await (const value of iterator) {\n    values.push(value)\n  }\n  return values\n}\n\n/**\n * @template T\n *\n * @typedef {object} Extensions\n * @property {() => Promise<T | undefined>} first\n * @property {() => Promise<T | undefined>} last\n * @property {() => Promise<T[]>} all\n */\n\n/**\n * @template T\n *\n * @param {any} iterator\n * @returns {AsyncIterable<T> & Extensions<T> }\n */\nexports.extendIterator = (iterator) => {\n  iterator.first = () => exports.first(iterator)\n  iterator.last = () => exports.last(iterator)\n  iterator.all = () => exports.all(iterator)\n  return iterator\n}\n","'use strict'\n\nconst log = require('debug')('ipfs:components:peer:storage')\nconst createRepo = require('../runtime/repo-nodejs')\nconst getDefaultConfig = require('../runtime/config-nodejs')\nconst { ERR_REPO_NOT_INITIALIZED } = require('ipfs-repo').errors\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst PeerId = require('peer-id')\nconst { mergeOptions } = require('../utils')\nconst configService = require('./config')\nconst { NotEnabledError } = require('../errors')\nconst createLibP2P = require('./libp2p')\n\n/**\n * @typedef {import('ipfs-repo')} IPFSRepo\n * @typedef {import('../types').Options} IPFSOptions\n * @typedef {import('../types').InitOptions} InitOptions\n * @typedef {import('../types').Print} Print\n * @typedef {import('ipfs-core-types/src/config').Config} IPFSConfig\n * @typedef {import('libp2p-crypto').KeyType} KeyType\n * @typedef {import('libp2p/src/keychain')} Keychain\n */\n\nclass Storage {\n  /**\n   * @private\n   * @param {PeerId} peerId\n   * @param {Keychain} keychain\n   * @param {IPFSRepo} repo\n   * @param {Print} print\n   * @param {boolean} isNew\n   */\n  constructor (peerId, keychain, repo, print, isNew) {\n    this.print = print\n    this.peerId = peerId\n    this.keychain = keychain\n    this.repo = repo\n    this.print = print\n    this.isNew = isNew\n  }\n\n  /**\n   * @param {Print} print\n   * @param {IPFSOptions} options\n   */\n  static async start (print, options) {\n    const { repoAutoMigrate, repo: inputRepo } = options\n\n    const repo = (typeof inputRepo === 'string' || inputRepo == null)\n      ? createRepo(print, { path: inputRepo, autoMigrate: Boolean(repoAutoMigrate) })\n      : inputRepo\n\n    const { peerId, keychain, isNew } = await loadRepo(print, repo, options)\n\n    // TODO: throw error?\n    // @ts-ignore On start, keychain will always be available\n    return new Storage(peerId, keychain, repo, print, isNew)\n  }\n}\nmodule.exports = Storage\n\n/**\n * @param {Print} print\n * @param {IPFSRepo} repo\n * @param {IPFSOptions} options\n */\nconst loadRepo = async (print, repo, options) => {\n  if (!repo.closed) {\n    return { ...await configureRepo(repo, options), isNew: false }\n  }\n\n  try {\n    await repo.open()\n\n    return { ...await configureRepo(repo, options), isNew: false }\n  } catch (err) {\n    if (err.code !== ERR_REPO_NOT_INITIALIZED) {\n      throw err\n    }\n\n    if (options.init && options.init.allowNew === false) {\n      throw new NotEnabledError('Initialization of new repos disabled by config, pass `config.init.isNew: true` to enable it')\n    }\n\n    return { ...await initRepo(print, repo, options), isNew: true }\n  }\n}\n\n/**\n * @param {Print} print\n * @param {IPFSRepo} repo\n * @param {IPFSOptions} options\n * @returns {Promise<{peerId: PeerId, keychain?: Keychain}>}\n */\nconst initRepo = async (print, repo, options) => {\n  const initOptions = options.init || {}\n\n  // 1. Verify that repo does not exist yet (if it does and we could not open it we give up)\n  const exists = await repo.exists()\n  log('repo exists?', exists)\n\n  if (exists === true) {\n    throw new Error('repo already exists')\n  }\n\n  // 2. Restore `peerId` from a given `.privateKey` or init new using provided options.\n  const peerId = initOptions.privateKey\n    ? await decodePeerId(initOptions.privateKey)\n    : await initPeerId(print, initOptions)\n\n  const identity = peerIdToIdentity(peerId)\n\n  log('peer identity: %s', identity.PeerID)\n\n  // 3. Init new repo with provided `.config` and restored / initialized `peerId`\n  const config = {\n    ...mergeOptions(applyProfiles(getDefaultConfig(), initOptions.profiles), options.config),\n    Identity: identity\n  }\n  await repo.init(config)\n\n  // 4. Open initialized repo.\n  await repo.open()\n\n  log('repo opened')\n\n  // Create libp2p for Keychain creation\n  const libp2p = await createLibP2P({\n    options: undefined,\n    multiaddrs: undefined,\n    peerId,\n    repo,\n    config,\n    keychainConfig: {\n      pass: options.pass\n    }\n  })\n\n  if (libp2p.keychain && libp2p.keychain.opts) {\n    await libp2p.loadKeychain()\n\n    await repo.config.set('Keychain', {\n      dek: libp2p.keychain.opts.dek\n    })\n  }\n\n  return { peerId, keychain: libp2p.keychain }\n}\n\n/**\n * Takes `peerId` either represented as a string serialized string or\n * an instance and returns a `PeerId` instance.\n *\n * @param {PeerId|string} peerId\n * @returns {Promise<PeerId>|PeerId}\n */\nconst decodePeerId = (peerId) => {\n  log('using user-supplied private-key')\n  return typeof peerId === 'object'\n    ? peerId\n    : PeerId.createFromPrivKey(uint8ArrayFromString(peerId, 'base64pad'))\n}\n\n/**\n * Initializes new PeerId by generating an underlying keypair.\n *\n * @param {Print} print\n * @param {Object} options\n * @param {KeyType} [options.algorithm='RSA']\n * @param {number} [options.bits=2048]\n * @returns {Promise<PeerId>}\n */\nconst initPeerId = (print, { algorithm = 'RSA', bits = 2048 }) => {\n  // Generate peer identity keypair + transform to desired format + add to config.\n  print('generating %s-bit (rsa only) %s keypair...', bits, algorithm)\n  return PeerId.create({ keyType: algorithm, bits })\n}\n\n/**\n * @param {PeerId} peerId\n */\nconst peerIdToIdentity = (peerId) => ({\n  PeerID: peerId.toB58String(),\n  /** @type {string} */\n  PrivKey: uint8ArrayToString(peerId.privKey.bytes, 'base64pad')\n})\n\n/**\n * Applies passed `profiles` and a `config` to an open repo.\n *\n * @param {IPFSRepo} repo\n * @param {IPFSOptions} options\n * @returns {Promise<{peerId: PeerId, keychain?: Keychain}>}\n */\nconst configureRepo = async (repo, options) => {\n  const config = options.config\n  const profiles = (options.init && options.init.profiles) || []\n  const pass = options.pass\n  const original = await repo.config.getAll()\n  // @ts-ignore TODO: move config types to repo\n  const changed = mergeConfigs(applyProfiles(original, profiles), config)\n\n  if (original !== changed) {\n    await repo.config.replace(changed)\n  }\n\n  // @ts-ignore - Identity may not be present\n  const peerId = await PeerId.createFromPrivKey(changed.Identity.PrivKey)\n  const libp2p = await createLibP2P({\n    options: undefined,\n    multiaddrs: undefined,\n    peerId,\n    repo,\n    config: changed,\n    keychainConfig: {\n      pass,\n      ...changed.Keychain\n    }\n  })\n\n  if (libp2p.keychain) {\n    await libp2p.loadKeychain()\n  }\n\n  return { peerId, keychain: libp2p.keychain }\n}\n\n/**\n * @param {IPFSConfig} config\n * @param {Partial<IPFSConfig>} [changes]\n */\nconst mergeConfigs = (config, changes) =>\n  changes ? mergeOptions(config, changes) : config\n\n/**\n * Apply profiles (e.g. ['server', 'lowpower']) to config\n *\n * @param {IPFSConfig} config\n * @param {string[]} [profiles]\n */\nconst applyProfiles = (config, profiles) => {\n  return (profiles || []).reduce((config, name) => {\n    const profile = configService.profiles[name]\n    if (!profile) {\n      throw new Error(`Could not find profile with name '${name}'`)\n    }\n    log('applying profile %s', name)\n    return profile.transform(config)\n  }, config)\n}\n","'use strict'\n\nconst IPFSRepo = require('ipfs-repo')\n\n/**\n * @param {import('../types').Print} print\n * @param {object} options\n * @param {string} [options.path]\n * @param {boolean} options.autoMigrate\n */\nmodule.exports = (print, options) => {\n  const repoPath = options.path || 'ipfs'\n  return new IPFSRepo(repoPath, { autoMigrate: options.autoMigrate })\n}\n","'use strict'\n\nconst get = require('dlv')\nconst mergeOptions = require('merge-options')\nconst errCode = require('err-code')\nconst PubsubRouters = require('../runtime/libp2p-pubsub-routers-nodejs')\nconst pkgversion = require('../../package.json').version\n\n/**\n * @typedef {Object} KeychainConfig\n * @property {string} [pass]\n *\n * @typedef {import('ipfs-repo')} Repo\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('../types').Options} IPFSOptions\n * @typedef {import('libp2p')} LibP2P\n * @typedef {import('libp2p').Libp2pOptions & import('libp2p').CreateOptions} Libp2pOptions\n * @typedef {import('ipfs-core-types/src/config').Config} IPFSConfig\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n */\n\n/**\n * @param {Object} config\n * @param {Repo} config.repo\n * @param {IPFSOptions|undefined} config.options\n * @param {PeerId} config.peerId\n * @param {Multiaddr[]|undefined} config.multiaddrs\n * @param {KeychainConfig|undefined} config.keychainConfig\n * @param {Partial<IPFSConfig>|undefined} config.config\n */\nmodule.exports = ({\n  options = {},\n  peerId,\n  multiaddrs = [],\n  repo,\n  keychainConfig = {},\n  config = {}\n}) => {\n  const { datastore, keys } = repo\n\n  const libp2pOptions = getLibp2pOptions({\n    options,\n    config,\n    datastore,\n    keys,\n    keychainConfig,\n    peerId,\n    multiaddrs\n  })\n\n  if (typeof options.libp2p === 'function') {\n    return options.libp2p({ libp2pOptions, options, config, datastore, peerId })\n  }\n\n  // Required inline to reduce startup time\n  const Libp2p = require('libp2p')\n\n  return Libp2p.create(libp2pOptions)\n}\n\n/**\n * @param {Object} input\n * @param {IPFSOptions} input.options\n * @param {Partial<IPFSConfig>} input.config\n * @param {Repo['datastore']} input.datastore\n * @param {Repo['keys']} input.keys\n * @param {KeychainConfig} input.keychainConfig\n * @param {PeerId} input.peerId\n * @param {Multiaddr[]} input.multiaddrs\n * @returns {Libp2pOptions}\n */\nfunction getLibp2pOptions ({ options, config, datastore, keys, keychainConfig, peerId, multiaddrs }) {\n  const getPubsubRouter = () => {\n    const router = get(config, 'Pubsub.Router') || 'gossipsub'\n\n    // @ts-ignore - `router` value is not constrained\n    if (!PubsubRouters[router]) {\n      throw errCode(new Error(`Router unavailable. Configure libp2p.modules.pubsub to use the ${router} router.`), 'ERR_NOT_SUPPORTED')\n    }\n\n    // @ts-ignore - `router` value is not constrained\n    return PubsubRouters[router]\n  }\n\n  const libp2pDefaults = {\n    datastore,\n    peerId: peerId,\n    modules: {}\n  }\n\n  const libp2pOptions = {\n    modules: {\n      pubsub: getPubsubRouter()\n    },\n    config: {\n      peerDiscovery: {\n        mdns: {\n          enabled: get(options, 'config.Discovery.MDNS.Enabled', get(config, 'Discovery.MDNS.Enabled', true))\n        },\n        webRTCStar: {\n          enabled: get(options, 'config.Discovery.webRTCStar.Enabled', get(config, 'Discovery.webRTCStar.Enabled', true))\n        },\n        bootstrap: {\n          list: get(options, 'config.Bootstrap', get(config, 'Bootstrap', []))\n        }\n      },\n      relay: {\n        enabled: get(options, 'relay.enabled', get(config, 'relay.enabled', true)),\n        hop: {\n          enabled: get(options, 'relay.hop.enabled', get(config, 'relay.hop.enabled', false)),\n          active: get(options, 'relay.hop.active', get(config, 'relay.hop.active', false))\n        }\n      },\n      dht: {\n        enabled: get(config, 'Routing.Type', 'none') !== 'none',\n        clientMode: get(config, 'Routing.Type', 'dht') !== 'dhtserver',\n        kBucketSize: get(options, 'dht.kBucketSize', 20)\n      },\n      pubsub: {\n        enabled: get(options, 'config.Pubsub.Enabled', get(config, 'Pubsub.Enabled', true))\n      },\n      nat: {\n        enabled: !get(config, 'Swarm.DisableNatPortMap', false)\n      }\n    },\n    addresses: {\n      listen: multiaddrs.map(ma => ma.toString()),\n      announce: get(options, 'addresses.announce', get(config, 'Addresses.Announce', [])),\n      noAnnounce: get(options, 'addresses.noAnnounce', get(config, 'Addresses.NoAnnounce', []))\n    },\n    connectionManager: get(options, 'connectionManager', {\n      maxConnections: get(options, 'config.Swarm.ConnMgr.HighWater', get(config, 'Swarm.ConnMgr.HighWater')),\n      minConnections: get(options, 'config.Swarm.ConnMgr.LowWater', get(config, 'Swarm.ConnMgr.LowWater'))\n    }),\n    keychain: {\n      datastore: keys,\n      ...keychainConfig\n    },\n    host: {\n      agentVersion: `js-ipfs/${pkgversion}`\n    }\n  }\n\n  // Required inline to reduce startup time\n  // Note: libp2p-nodejs gets replaced by libp2p-browser when webpacked/browserified\n  const getEnvLibp2pOptions = require('../runtime/libp2p-nodejs')\n\n  /** @type {import('libp2p').Libp2pOptions | undefined} */\n  let constructorOptions = get(options, 'libp2p', undefined)\n\n  if (typeof constructorOptions === 'function') {\n    constructorOptions = undefined\n  }\n\n  // Merge defaults with Node.js/browser/other environments options and configuration\n  const libp2pConfig = mergeOptions(\n    libp2pDefaults,\n    getEnvLibp2pOptions(),\n    libp2pOptions,\n    constructorOptions\n  )\n\n  const bootstrapList = get(libp2pConfig, 'config.peerDiscovery.bootstrap.list', [])\n\n  if (bootstrapList.length > 0) {\n    libp2pConfig.modules.peerDiscovery.push(require('libp2p-bootstrap'))\n  }\n\n  return libp2pConfig\n}\n","'use strict'\n\nmodule.exports = {\n  gossipsub: require('libp2p-gossipsub')\n}\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __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};\nconst pubsub_1 = __importStar(require(\"libp2p-interfaces/src/pubsub\"));\nconst message_cache_1 = require(\"./message-cache\");\nconst rpc_1 = require(\"./message/rpc\");\nconst constants = __importStar(require(\"./constants\"));\nconst heartbeat_1 = require(\"./heartbeat\");\nconst get_gossip_peers_1 = require(\"./get-gossip-peers\");\nconst utils_1 = require(\"./utils\");\nconst score_1 = require(\"./score\");\nconst tracer_1 = require(\"./tracer\");\n// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n// @ts-ignore\nconst TimeCache = require(\"time-cache\");\nconst PeerId = require(\"peer-id\");\n// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n// @ts-ignore\nconst Envelope = require(\"libp2p/src/record/envelope\");\nclass Gossipsub extends pubsub_1.default {\n    // TODO: add remaining props\n    /**\n     * @param {Libp2p} libp2p\n     * @param {Object} [options]\n     * @param {boolean} [options.emitSelf = false] if publish should emit to self, if subscribed\n     * @param {boolean} [options.canRelayMessage = false] - if can relay messages not subscribed\n     * @param {boolean} [options.gossipIncoming = true] if incoming messages on a subscribed topic should be automatically gossiped\n     * @param {boolean} [options.fallbackToFloodsub = true] if dial should fallback to floodsub\n     * @param {boolean} [options.floodPublish = true] if self-published messages should be sent to all peers\n     * @param {boolean} [options.doPX = false] whether PX is enabled; this should be enabled in bootstrappers and other well connected/trusted nodes.\n     * @param {Object} [options.messageCache] override the default MessageCache\n     * @param {string} [options.globalSignaturePolicy = \"StrictSign\"] signing policy to apply across all messages\n     * @param {Object} [options.scoreParams] peer score parameters\n     * @param {Object} [options.scoreThresholds] peer score thresholds\n     * @param {AddrInfo[]} [options.directPeers] peers with which we will maintain direct connections\n     * @constructor\n     */\n    constructor(libp2p, options = {}) {\n        const multicodecs = [constants.GossipsubIDv11, constants.GossipsubIDv10];\n        const opts = Object.assign(Object.assign({ gossipIncoming: true, fallbackToFloodsub: true, floodPublish: true, doPX: false, directPeers: [], D: constants.GossipsubD, Dlo: constants.GossipsubDlo, Dhi: constants.GossipsubDhi, Dscore: constants.GossipsubDscore, Dout: constants.GossipsubDout, Dlazy: constants.GossipsubDlazy }, options), { scoreParams: score_1.createPeerScoreParams(options.scoreParams), scoreThresholds: score_1.createPeerScoreThresholds(options.scoreThresholds) });\n        // Also wants to get notified of peers connected using floodsub\n        if (opts.fallbackToFloodsub) {\n            multicodecs.push(constants.FloodsubID);\n        }\n        super(Object.assign({ debugName: 'libp2p:gossipsub', multicodecs,\n            libp2p }, opts));\n        this._options = opts;\n        /**\n         * Direct peers\n         * @type {Set<string>}\n         */\n        this.direct = new Set(opts.directPeers.map(p => p.id.toB58String()));\n        // set direct peer addresses in the address book\n        opts.directPeers.forEach(p => {\n            libp2p.peerStore.addressBook.add(p.id, p.addrs);\n        });\n        /**\n         * Cache of seen messages\n         *\n         * @type {TimeCache}\n         */\n        this.seenCache = new TimeCache();\n        /**\n         * Map of topic meshes\n         * topic => peer id set\n         *\n         * @type {Map<string, Set<string>>}\n         */\n        this.mesh = new Map();\n        /**\n         * Map of topics to set of peers. These mesh peers are the ones to which we are publishing without a topic membership\n         * topic => peer id set\n         *\n         * @type {Map<string, Set<string>>}\n         */\n        this.fanout = new Map();\n        /**\n         * Map of last publish time for fanout topics\n         * topic => last publish time\n         *\n         * @type {Map<string, number>}\n         */\n        this.lastpub = new Map();\n        /**\n         * Map of pending messages to gossip\n         * peer id => control messages\n         *\n         * @type {Map<string, Array<RPC.IControlIHave object>> }\n         */\n        this.gossip = new Map();\n        /**\n         * Map of control messages\n         * peer id => control message\n         *\n         * @type {Map<string, RPC.IControlMessage object>}\n         */\n        this.control = new Map();\n        /**\n         * Number of IHAVEs received from peer in the last heartbeat\n         * @type {Map<string, number>}\n         */\n        this.peerhave = new Map();\n        /**\n         * Number of messages we have asked from peer in the last heartbeat\n         * @type {Map<string, number>}\n         */\n        this.iasked = new Map();\n        /**\n         * Prune backoff map\n         */\n        this.backoff = new Map();\n        /**\n         * Connection direction cache, marks peers with outbound connections\n         * peer id => direction\n         *\n         * @type {Map<string, boolean>}\n         */\n        this.outbound = new Map();\n        /**\n         * A message cache that contains the messages for last few hearbeat ticks\n         *\n         */\n        this.messageCache = options.messageCache || new message_cache_1.MessageCache(constants.GossipsubHistoryGossip, constants.GossipsubHistoryLength, this.getMsgId.bind(this));\n        /**\n         * A heartbeat timer that maintains the mesh\n         */\n        this.heartbeat = new heartbeat_1.Heartbeat(this);\n        /**\n         * Number of heartbeats since the beginning of time\n         * This allows us to amortize some resource cleanup -- eg: backoff cleanup\n         */\n        this.heartbeatTicks = 0;\n        /**\n         * Tracks IHAVE/IWANT promises broken by peers\n         */\n        this.gossipTracer = new tracer_1.IWantTracer(this.getMsgId.bind(this));\n        /**\n         * libp2p\n         */\n        this._libp2p = libp2p;\n        /**\n         * Peer score tracking\n         */\n        this.score = new score_1.PeerScore(this._options.scoreParams, libp2p.connectionManager, this.getMsgId.bind(this));\n    }\n    /**\n     * Decode a Uint8Array into an RPC object\n     * Overrided to use an extended protocol-specific protobuf decoder\n     * @override\n     * @param {Uint8Array} bytes\n     * @returns {RPC}\n     */\n    _decodeRpc(bytes) {\n        return rpc_1.RPC.decode(bytes);\n    }\n    /**\n     * Encode an RPC object into a Uint8Array\n     * Overrided to use an extended protocol-specific protobuf encoder\n     * @override\n     * @param {RPC} rpc\n     * @returns {Uint8Array}\n     */\n    _encodeRpc(rpc) {\n        return rpc_1.RPC.encode(rpc).finish();\n    }\n    /**\n     * Add a peer to the router\n     * @override\n     * @param {PeerId} peerId\n     * @param {string} protocol\n     * @returns {PeerStreams}\n     */\n    _addPeer(peerId, protocol) {\n        const p = super._addPeer(peerId, protocol);\n        // Add to peer scoring\n        this.score.addPeer(peerId.toB58String());\n        // track the connection direction\n        let outbound = false;\n        for (const c of this._libp2p.connectionManager.getAll(peerId)) {\n            if (c.stat.direction === 'outbound') {\n                if (Array.from(c.registry.values()).some(rvalue => protocol === rvalue.protocol)) {\n                    outbound = true;\n                    break;\n                }\n            }\n        }\n        this.outbound.set(p.id.toB58String(), outbound);\n        return p;\n    }\n    /**\n     * Removes a peer from the router\n     * @override\n     * @param {PeerId} peer\n     * @returns {PeerStreams | undefined}\n     */\n    _removePeer(peerId) {\n        const peerStreams = super._removePeer(peerId);\n        const id = peerId.toB58String();\n        // Remove this peer from the mesh\n        // eslint-disable-next-line no-unused-vars\n        for (const peers of this.mesh.values()) {\n            peers.delete(id);\n        }\n        // Remove this peer from the fanout\n        // eslint-disable-next-line no-unused-vars\n        for (const peers of this.fanout.values()) {\n            peers.delete(id);\n        }\n        // Remove from gossip mapping\n        this.gossip.delete(id);\n        // Remove from control mapping\n        this.control.delete(id);\n        // Remove from backoff mapping\n        this.outbound.delete(id);\n        // Remove from peer scoring\n        this.score.removePeer(id);\n        return peerStreams;\n    }\n    /**\n     * Handles an rpc request from a peer\n     *\n     * @override\n     * @param {String} idB58Str\n     * @param {PeerStreams} peerStreams\n     * @param {RPC} rpc\n     * @returns {boolean}\n     */\n    _processRpc(id, peerStreams, rpc) {\n        if (super._processRpc(id, peerStreams, rpc)) {\n            if (rpc.control) {\n                this._processRpcControlMessage(id, rpc.control);\n            }\n            return true;\n        }\n        return false;\n    }\n    /**\n     * Handles an rpc control message from a peer\n     * @param {string} id peer id\n     * @param {RPC.IControlMessage} controlMsg\n     * @returns {void}\n     */\n    _processRpcControlMessage(id, controlMsg) {\n        if (!controlMsg) {\n            return;\n        }\n        const iwant = controlMsg.ihave ? this._handleIHave(id, controlMsg.ihave) : [];\n        const ihave = controlMsg.iwant ? this._handleIWant(id, controlMsg.iwant) : [];\n        const prune = controlMsg.graft ? this._handleGraft(id, controlMsg.graft) : [];\n        controlMsg.prune && this._handlePrune(id, controlMsg.prune);\n        if (!iwant.length && !ihave.length && !prune.length) {\n            return;\n        }\n        const outRpc = utils_1.createGossipRpc(ihave, { iwant, prune });\n        this._sendRpc(id, outRpc);\n    }\n    /**\n     * Process incoming message,\n     * emitting locally and forwarding on to relevant floodsub and gossipsub peers\n     * @override\n     * @param {InMessage} msg\n     * @returns {Promise<void>}\n     */\n    _processRpcMessage(msg) {\n        const _super = Object.create(null, {\n            _processRpcMessage: { get: () => super._processRpcMessage }\n        });\n        return __awaiter(this, void 0, void 0, function* () {\n            const msgID = this.getMsgId(msg);\n            const msgIdStr = utils_1.messageIdToString(msgID);\n            // Ignore if we've already seen the message\n            if (this.seenCache.has(msgIdStr)) {\n                this.score.duplicateMessage(msg);\n                return;\n            }\n            this.seenCache.put(msgIdStr);\n            this.score.validateMessage(msg);\n            yield _super._processRpcMessage.call(this, msg);\n        });\n    }\n    /**\n     * Whether to accept a message from a peer\n     * @override\n     * @param {string} id\n     * @returns {boolean}\n     */\n    _acceptFrom(id) {\n        return this.direct.has(id) || this.score.score(id) >= this._options.scoreThresholds.graylistThreshold;\n    }\n    /**\n     * Validate incoming message\n     * @override\n     * @param {InMessage} message\n     * @returns {Promise<void>}\n     */\n    validate(message) {\n        const _super = Object.create(null, {\n            validate: { get: () => super.validate }\n        });\n        return __awaiter(this, void 0, void 0, function* () {\n            try {\n                yield _super.validate.call(this, message);\n            }\n            catch (e) {\n                this.score.rejectMessage(message, e.code);\n                this.gossipTracer.rejectMessage(message, e.code);\n                throw e;\n            }\n        });\n    }\n    /**\n     * Handles IHAVE messages\n     * @param {string} id peer id\n     * @param {Array<RPC.IControlIHave>} ihave\n     * @returns {RPC.IControlIWant}\n     */\n    _handleIHave(id, ihave) {\n        if (!ihave.length) {\n            return [];\n        }\n        // we ignore IHAVE gossip from any peer whose score is below the gossips threshold\n        const score = this.score.score(id);\n        if (score < this._options.scoreThresholds.gossipThreshold) {\n            this.log('IHAVE: ignoring peer %s with score below threshold [ score = %d ]', id, score);\n            return [];\n        }\n        // IHAVE flood protection\n        const peerhave = (this.peerhave.get(id) || 0) + 1;\n        this.peerhave.set(id, peerhave);\n        if (peerhave > constants.GossipsubMaxIHaveMessages) {\n            this.log('IHAVE: peer %s has advertised too many times (%d) within this heartbeat interval; ignoring', id, peerhave);\n            return [];\n        }\n        const iasked = this.iasked.get(id) || 0;\n        if (iasked >= constants.GossipsubMaxIHaveLength) {\n            this.log('IHAVE: peer %s has already advertised too many messages (%d); ignoring', id, iasked);\n            return [];\n        }\n        // string msgId => msgId\n        const iwant = new Map();\n        ihave.forEach(({ topicID, messageIDs }) => {\n            if (!topicID || !messageIDs || !this.mesh.has(topicID)) {\n                return;\n            }\n            messageIDs.forEach((msgID) => {\n                const msgIdStr = utils_1.messageIdToString(msgID);\n                if (this.seenCache.has(msgIdStr)) {\n                    return;\n                }\n                iwant.set(msgIdStr, msgID);\n            });\n        });\n        if (!iwant.size) {\n            return [];\n        }\n        let iask = iwant.size;\n        if (iask + iasked > constants.GossipsubMaxIHaveLength) {\n            iask = constants.GossipsubMaxIHaveLength - iasked;\n        }\n        this.log('IHAVE: Asking for %d out of %d messages from %s', iask, iwant.size, id);\n        let iwantList = Array.from(iwant.values());\n        // ask in random order\n        utils_1.shuffle(iwantList);\n        // truncate to the messages we are actually asking for and update the iasked counter\n        iwantList = iwantList.slice(0, iask);\n        this.iasked.set(id, iasked + iask);\n        this.gossipTracer.addPromise(id, iwantList);\n        return [{\n                messageIDs: iwantList\n            }];\n    }\n    /**\n     * Handles IWANT messages\n     * Returns messages to send back to peer\n     * @param {string} id peer id\n     * @param {Array<RPC.IControlIWant>} iwant\n     * @returns {Array<RPC.IMessage>}\n     */\n    _handleIWant(id, iwant) {\n        if (!iwant.length) {\n            return [];\n        }\n        // we don't respond to IWANT requests from any per whose score is below the gossip threshold\n        const score = this.score.score(id);\n        if (score < this._options.scoreThresholds.gossipThreshold) {\n            this.log('IWANT: ignoring peer %s with score below threshold [score = %d]', id, score);\n            return [];\n        }\n        // @type {Map<string, Message>}\n        const ihave = new Map();\n        iwant.forEach(({ messageIDs }) => {\n            messageIDs && messageIDs.forEach((msgID) => {\n                const [msg, count] = this.messageCache.getForPeer(msgID, id);\n                if (!msg) {\n                    return;\n                }\n                if (count > constants.GossipsubGossipRetransmission) {\n                    this.log('IWANT: Peer %s has asked for message %s too many times: ignoring request', id, msgID);\n                    return;\n                }\n                ihave.set(utils_1.messageIdToString(msgID), msg);\n            });\n        });\n        if (!ihave.size) {\n            return [];\n        }\n        this.log('IWANT: Sending %d messages to %s', ihave.size, id);\n        return Array.from(ihave.values()).map(pubsub_1.utils.normalizeOutRpcMessage);\n    }\n    /**\n     * Handles Graft messages\n     * @param {string} id peer id\n     * @param {Array<RPC.IControlGraft>} graft\n     * @return {Array<RPC.IControlPrune>}\n     */\n    _handleGraft(id, graft) {\n        const prune = [];\n        const score = this.score.score(id);\n        const now = this._now();\n        let doPX = this._options.doPX;\n        graft.forEach(({ topicID }) => {\n            var _a;\n            if (!topicID) {\n                return;\n            }\n            const peersInMesh = this.mesh.get(topicID);\n            if (!peersInMesh) {\n                // don't do PX when there is an unknown topic to avoid leaking our peers\n                doPX = false;\n                // spam hardening: ignore GRAFTs for unknown topics\n                return;\n            }\n            // check if peer is already in the mesh; if so do nothing\n            if (peersInMesh.has(id)) {\n                return;\n            }\n            // we don't GRAFT to/from direct peers; complain loudly if this happens\n            if (this.direct.has(id)) {\n                this.log('GRAFT: ignoring request from direct peer %s', id);\n                // this is possibly a bug from a non-reciprical configuration; send a PRUNE\n                prune.push(topicID);\n                // but don't px\n                doPX = false;\n                return;\n            }\n            // make sure we are not backing off that peer\n            const expire = (_a = this.backoff.get(topicID)) === null || _a === void 0 ? void 0 : _a.get(id);\n            if (typeof expire === 'number' && now < expire) {\n                this.log('GRAFT: ignoring backed off peer %s', id);\n                // add behavioral penalty\n                this.score.addPenalty(id, 1);\n                // no PX\n                doPX = false;\n                // check the flood cutoff -- is the GRAFT coming too fast?\n                const floodCutoff = expire + constants.GossipsubGraftFloodThreshold - constants.GossipsubPruneBackoff;\n                if (now < floodCutoff) {\n                    // extra penalty\n                    this.score.addPenalty(id, 1);\n                }\n                // refresh the backoff\n                this._addBackoff(id, topicID);\n                prune.push(topicID);\n                return;\n            }\n            // check the score\n            if (score < 0) {\n                // we don't GRAFT peers with negative score\n                this.log('GRAFT: ignoring peer %s with negative score: score=%d, topic=%s', id, score, topicID);\n                // we do send them PRUNE however, because it's a matter of protocol correctness\n                prune.push(topicID);\n                // but we won't PX to them\n                doPX = false;\n                // add/refresh backoff so that we don't reGRAFT too early even if the score decays\n                this._addBackoff(id, topicID);\n                return;\n            }\n            // check the number of mesh peers; if it is at (or over) Dhi, we only accept grafts\n            // from peers with outbound connections; this is a defensive check to restrict potential\n            // mesh takeover attacks combined with love bombing\n            if (peersInMesh.size >= this._options.Dhi && !this.outbound.get(id)) {\n                prune.push(topicID);\n                this._addBackoff(id, topicID);\n                return;\n            }\n            this.log('GRAFT: Add mesh link from %s in %s', id, topicID);\n            this.score.graft(id, topicID);\n            peersInMesh.add(id);\n        });\n        if (!prune.length) {\n            return [];\n        }\n        return prune.map(topic => this._makePrune(id, topic, doPX));\n    }\n    /**\n     * Handles Prune messages\n     * @param {string} id peer id\n     * @param {Array<RPC.IControlPrune>} prune\n     * @returns {void}\n     */\n    _handlePrune(id, prune) {\n        const score = this.score.score(id);\n        prune.forEach(({ topicID, backoff, peers }) => {\n            if (!topicID) {\n                return;\n            }\n            const peersInMesh = this.mesh.get(topicID);\n            if (!peersInMesh) {\n                return;\n            }\n            this.log('PRUNE: Remove mesh link to %s in %s', id, topicID);\n            this.score.prune(id, topicID);\n            peersInMesh.delete(id);\n            // is there a backoff specified by the peer? if so obey it\n            if (typeof backoff === 'number' && backoff > 0) {\n                this._doAddBackoff(id, topicID, backoff * 1000);\n            }\n            else {\n                this._addBackoff(id, topicID);\n            }\n            // PX\n            if (peers && peers.length) {\n                // we ignore PX from peers with insufficient scores\n                if (score < this._options.scoreThresholds.acceptPXThreshold) {\n                    this.log('PRUNE: ignoring PX from peer %s with insufficient score [score = %d, topic = %s]', id, score, topicID);\n                    return;\n                }\n                this._pxConnect(peers);\n            }\n        });\n    }\n    /**\n     * Add standard backoff log for a peer in a topic\n     * @param {string} id\n     * @param {string} topic\n     * @returns {void}\n     */\n    _addBackoff(id, topic) {\n        this._doAddBackoff(id, topic, constants.GossipsubPruneBackoff);\n    }\n    /**\n     * Add backoff expiry interval for a peer in a topic\n     * @param {string} id\n     * @param {string} topic\n     * @param {number} interval backoff duration in milliseconds\n     * @returns {void}\n     */\n    _doAddBackoff(id, topic, interval) {\n        let backoff = this.backoff.get(topic);\n        if (!backoff) {\n            backoff = new Map();\n            this.backoff.set(topic, backoff);\n        }\n        const expire = this._now() + interval;\n        const existingExpire = backoff.get(id) || 0;\n        if (existingExpire < expire) {\n            backoff.set(id, expire);\n        }\n    }\n    /**\n     * Apply penalties from broken IHAVE/IWANT promises\n     * @returns {void}\n     */\n    _applyIwantPenalties() {\n        this.gossipTracer.getBrokenPromises().forEach((count, p) => {\n            this.log('peer %s didn\\'t follow up in %d IWANT requests; adding penalty', p, count);\n            this.score.addPenalty(p, count);\n        });\n    }\n    /**\n     * Clear expired backoff expiries\n     * @returns {void}\n     */\n    _clearBackoff() {\n        // we only clear once every GossipsubPruneBackoffTicks ticks to avoid iterating over the maps too much\n        if (this.heartbeatTicks % constants.GossipsubPruneBackoffTicks !== 0) {\n            return;\n        }\n        const now = this._now();\n        this.backoff.forEach((backoff, topic) => {\n            backoff.forEach((expire, id) => {\n                if (expire < now) {\n                    backoff.delete(id);\n                }\n            });\n            if (backoff.size === 0) {\n                this.backoff.delete(topic);\n            }\n        });\n    }\n    /**\n     * Maybe reconnect to direct peers\n     * @returns {void}\n     */\n    _directConnect() {\n        // we only do this every few ticks to allow pending connections to complete and account for\n        // restarts/downtime\n        if (this.heartbeatTicks % constants.GossipsubDirectConnectTicks !== 0) {\n            return;\n        }\n        const toconnect = [];\n        this.direct.forEach(id => {\n            const peer = this.peers.get(id);\n            if (!peer || !peer.isWritable) {\n                toconnect.push(id);\n            }\n        });\n        if (toconnect.length) {\n            toconnect.forEach(id => {\n                this._connect(id);\n            });\n        }\n    }\n    /**\n     * Maybe attempt connection given signed peer records\n     * @param {RPC.IPeerInfo[]} peers\n     * @returns {Promise<void>}\n     */\n    _pxConnect(peers) {\n        return __awaiter(this, void 0, void 0, function* () {\n            if (peers.length > constants.GossipsubPrunePeers) {\n                utils_1.shuffle(peers);\n                peers = peers.slice(0, constants.GossipsubPrunePeers);\n            }\n            const toconnect = [];\n            yield Promise.all(peers.map((pi) => __awaiter(this, void 0, void 0, function* () {\n                if (!pi.peerID) {\n                    return;\n                }\n                const p = PeerId.createFromBytes(pi.peerID);\n                const id = p.toB58String();\n                if (this.peers.has(id)) {\n                    return;\n                }\n                if (!pi.signedPeerRecord) {\n                    toconnect.push(id);\n                    return;\n                }\n                // The peer sent us a signed record\n                // This is not a record from the peer who sent the record, but another peer who is connected with it\n                // Ensure that it is valid\n                try {\n                    const envelope = yield Envelope.openAndCertify(pi.signedPeerRecord, 'libp2p-peer-record');\n                    const eid = envelope.peerId.toB58String();\n                    if (id !== eid) {\n                        this.log('bogus peer record obtained through px: peer ID %s doesn\\'t match expected peer %s', eid, id);\n                        return;\n                    }\n                    if (!this._libp2p.peerStore.addressBook.consumePeerRecord(envelope)) {\n                        this.log('bogus peer record obtained through px: could not add peer record to address book');\n                        return;\n                    }\n                    toconnect.push(id);\n                }\n                catch (e) {\n                    this.log('bogus peer record obtained through px: invalid signature or not a peer record');\n                }\n            })));\n            if (!toconnect.length) {\n                return;\n            }\n            toconnect.forEach(id => this._connect(id));\n        });\n    }\n    /**\n     * Mounts the gossipsub protocol onto the libp2p node and sends our\n     * our subscriptions to every peer connected\n     * @override\n     * @returns {void}\n     */\n    start() {\n        super.start();\n        this.heartbeat.start();\n        this.score.start();\n        // connect to direct peers\n        this._directPeerInitial = setTimeout(() => {\n            this.direct.forEach(id => {\n                this._connect(id);\n            });\n        }, constants.GossipsubDirectConnectInitialDelay);\n    }\n    /**\n     * Unmounts the gossipsub protocol and shuts down every connection\n     * @override\n     * @returns {void}\n     */\n    stop() {\n        super.stop();\n        this.heartbeat.stop();\n        this.score.stop();\n        this.mesh = new Map();\n        this.fanout = new Map();\n        this.lastpub = new Map();\n        this.gossip = new Map();\n        this.control = new Map();\n        this.peerhave = new Map();\n        this.iasked = new Map();\n        this.backoff = new Map();\n        this.outbound = new Map();\n        this.gossipTracer.clear();\n        clearTimeout(this._directPeerInitial);\n    }\n    /**\n     * Connect to a peer using the gossipsub protocol\n     * @param {string} id\n     * @returns {void}\n     */\n    _connect(id) {\n        this.log('Initiating connection with %s', id);\n        this._libp2p.dialProtocol(PeerId.createFromB58String(id), this.multicodecs);\n    }\n    /**\n     * Subscribes to a topic\n     * @override\n     * @param {string} topic\n     * @returns {void}\n     */\n    subscribe(topic) {\n        super.subscribe(topic);\n        this.join(topic);\n    }\n    /**\n     * Unsubscribe to a topic\n     * @override\n     * @param {string} topic\n     * @returns {void}\n     */\n    unsubscribe(topic) {\n        super.unsubscribe(topic);\n        this.leave(topic);\n    }\n    /**\n     * Join topic\n     * @param {string} topic\n     * @returns {void}\n     */\n    join(topic) {\n        if (!this.started) {\n            throw new Error('Gossipsub has not started');\n        }\n        this.log('JOIN %s', topic);\n        const fanoutPeers = this.fanout.get(topic);\n        if (fanoutPeers) {\n            // these peers have a score above the publish threshold, which may be negative\n            // so drop the ones with a negative score\n            fanoutPeers.forEach(id => {\n                if (this.score.score(id) < 0) {\n                    fanoutPeers.delete(id);\n                }\n            });\n            if (fanoutPeers.size < this._options.D) {\n                // we need more peers; eager, as this would get fixed in the next heartbeat\n                get_gossip_peers_1.getGossipPeers(this, topic, this._options.D - fanoutPeers.size, (id) => {\n                    // filter our current peers, direct peers, and peers with negative scores\n                    return !fanoutPeers.has(id) && !this.direct.has(id) && this.score.score(id) >= 0;\n                }).forEach(id => fanoutPeers.add(id));\n            }\n            this.mesh.set(topic, fanoutPeers);\n            this.fanout.delete(topic);\n            this.lastpub.delete(topic);\n        }\n        else {\n            const peers = get_gossip_peers_1.getGossipPeers(this, topic, this._options.D, (id) => {\n                // filter direct peers and peers with negative score\n                return !this.direct.has(id) && this.score.score(id) >= 0;\n            });\n            this.mesh.set(topic, peers);\n        }\n        this.mesh.get(topic).forEach((id) => {\n            this.log('JOIN: Add mesh link to %s in %s', id, topic);\n            this._sendGraft(id, topic);\n        });\n    }\n    /**\n     * Leave topic\n     * @param {string} topic\n     * @returns {void}\n     */\n    leave(topic) {\n        if (!this.started) {\n            throw new Error('Gossipsub has not started');\n        }\n        this.log('LEAVE %s', topic);\n        // Send PRUNE to mesh peers\n        const meshPeers = this.mesh.get(topic);\n        if (meshPeers) {\n            meshPeers.forEach((id) => {\n                this.log('LEAVE: Remove mesh link to %s in %s', id, topic);\n                this._sendPrune(id, topic);\n            });\n            this.mesh.delete(topic);\n        }\n    }\n    /**\n     * Publish messages\n     *\n     * @override\n     * @param {InMessage} msg\n     * @returns {void}\n     */\n    _publish(msg) {\n        return __awaiter(this, void 0, void 0, function* () {\n            if (msg.receivedFrom !== this.peerId.toB58String()) {\n                this.score.deliverMessage(msg);\n                this.gossipTracer.deliverMessage(msg);\n            }\n            const msgID = this.getMsgId(msg);\n            const msgIdStr = utils_1.messageIdToString(msgID);\n            // put in seen cache\n            this.seenCache.put(msgIdStr);\n            this.messageCache.put(msg);\n            const tosend = new Set();\n            msg.topicIDs.forEach((topic) => {\n                const peersInTopic = this.topics.get(topic);\n                if (!peersInTopic) {\n                    return;\n                }\n                if (this._options.floodPublish && msg.from === this.peerId.toB58String()) {\n                    // flood-publish behavior\n                    // send to direct peers and _all_ peers meeting the publishThreshold\n                    peersInTopic.forEach(id => {\n                        if (this.direct.has(id) || this.score.score(id) >= this._options.scoreThresholds.publishThreshold) {\n                            tosend.add(id);\n                        }\n                    });\n                }\n                else {\n                    // non-flood-publish behavior\n                    // send to direct peers, subscribed floodsub peers\n                    // and some mesh peers above publishThreshold\n                    // direct peers\n                    this.direct.forEach(id => {\n                        tosend.add(id);\n                    });\n                    // floodsub peers\n                    peersInTopic.forEach((id) => {\n                        const score = this.score.score(id);\n                        const peerStreams = this.peers.get(id);\n                        if (!peerStreams) {\n                            return;\n                        }\n                        if (peerStreams.protocol === constants.FloodsubID && score >= this._options.scoreThresholds.publishThreshold) {\n                            tosend.add(id);\n                        }\n                    });\n                    // Gossipsub peers handling\n                    let meshPeers = this.mesh.get(topic);\n                    if (!meshPeers || !meshPeers.size) {\n                        // We are not in the mesh for topic, use fanout peers\n                        meshPeers = this.fanout.get(topic);\n                        if (!meshPeers) {\n                            // If we are not in the fanout, then pick peers in topic above the publishThreshold\n                            const peers = get_gossip_peers_1.getGossipPeers(this, topic, this._options.D, id => {\n                                return this.score.score(id) >= this._options.scoreThresholds.publishThreshold;\n                            });\n                            if (peers.size > 0) {\n                                meshPeers = peers;\n                                this.fanout.set(topic, peers);\n                            }\n                            else {\n                                meshPeers = new Set();\n                            }\n                        }\n                        // Store the latest publishing time\n                        this.lastpub.set(topic, this._now());\n                    }\n                    meshPeers.forEach((peer) => {\n                        tosend.add(peer);\n                    });\n                }\n            });\n            // Publish messages to peers\n            const rpc = utils_1.createGossipRpc([\n                pubsub_1.utils.normalizeOutRpcMessage(msg)\n            ]);\n            tosend.forEach((id) => {\n                if (id === msg.from) {\n                    return;\n                }\n                this._sendRpc(id, rpc);\n            });\n        });\n    }\n    /**\n     * Sends a GRAFT message to a peer\n     * @param {string} id peer id\n     * @param {string} topic\n     * @returns {void}\n     */\n    _sendGraft(id, topic) {\n        const graft = [{\n                topicID: topic\n            }];\n        const out = utils_1.createGossipRpc([], { graft });\n        this._sendRpc(id, out);\n    }\n    /**\n     * Sends a PRUNE message to a peer\n     * @param {string} id peer id\n     * @param {string} topic\n     * @returns {void}\n     */\n    _sendPrune(id, topic) {\n        const prune = [\n            this._makePrune(id, topic, this._options.doPX)\n        ];\n        const out = utils_1.createGossipRpc([], { prune });\n        this._sendRpc(id, out);\n    }\n    /**\n     * @override\n     */\n    _sendRpc(id, outRpc) {\n        const peerStreams = this.peers.get(id);\n        if (!peerStreams || !peerStreams.isWritable) {\n            return;\n        }\n        // piggyback control message retries\n        const ctrl = this.control.get(id);\n        if (ctrl) {\n            this._piggybackControl(id, outRpc, ctrl);\n            this.control.delete(id);\n        }\n        // piggyback gossip\n        const ihave = this.gossip.get(id);\n        if (ihave) {\n            this._piggybackGossip(id, outRpc, ihave);\n            this.gossip.delete(id);\n        }\n        peerStreams.write(rpc_1.RPC.encode(outRpc).finish());\n    }\n    _piggybackControl(id, outRpc, ctrl) {\n        const tograft = (ctrl.graft || [])\n            .filter(({ topicID }) => (topicID && this.mesh.get(topicID) || new Set()).has(id));\n        const toprune = (ctrl.prune || [])\n            .filter(({ topicID }) => !(topicID && this.mesh.get(topicID) || new Set()).has(id));\n        if (!tograft.length && !toprune.length) {\n            return;\n        }\n        if (outRpc.control) {\n            outRpc.control.graft = outRpc.control.graft && outRpc.control.graft.concat(tograft);\n            outRpc.control.prune = outRpc.control.prune && outRpc.control.prune.concat(toprune);\n        }\n        else {\n            outRpc.control = { ihave: [], iwant: [], graft: tograft, prune: toprune };\n        }\n    }\n    _piggybackGossip(id, outRpc, ihave) {\n        if (!outRpc.control) {\n            outRpc.control = { ihave: [], iwant: [], graft: [], prune: [] };\n        }\n        outRpc.control.ihave = ihave;\n    }\n    /**\n     * Send graft and prune messages\n     * @param {Map<string, Array<string>>} tograft peer id => topic[]\n     * @param {Map<string, Array<string>>} toprune peer id => topic[]\n     */\n    _sendGraftPrune(tograft, toprune, noPX) {\n        const doPX = this._options.doPX;\n        for (const [id, topics] of tograft) {\n            const graft = topics.map((topicID) => ({ topicID }));\n            let prune = [];\n            // If a peer also has prunes, process them now\n            const pruning = toprune.get(id);\n            if (pruning) {\n                prune = pruning.map((topicID) => this._makePrune(id, topicID, doPX && !noPX.get(id)));\n                toprune.delete(id);\n            }\n            const outRpc = utils_1.createGossipRpc([], { graft, prune });\n            this._sendRpc(id, outRpc);\n        }\n        for (const [id, topics] of toprune) {\n            const prune = topics.map((topicID) => this._makePrune(id, topicID, doPX && !noPX.get(id)));\n            const outRpc = utils_1.createGossipRpc([], { prune });\n            this._sendRpc(id, outRpc);\n        }\n    }\n    /**\n     * Emits gossip to peers in a particular topic\n     * @param {string} topic\n     * @param {Set<string>} exclude peers to exclude\n     * @returns {void}\n     */\n    _emitGossip(topic, exclude) {\n        const messageIDs = this.messageCache.getGossipIDs(topic);\n        if (!messageIDs.length) {\n            return;\n        }\n        // shuffle to emit in random order\n        utils_1.shuffle(messageIDs);\n        // if we are emitting more than GossipsubMaxIHaveLength ids, truncate the list\n        if (messageIDs.length > constants.GossipsubMaxIHaveLength) {\n            // we do the truncation (with shuffling) per peer below\n            this.log('too many messages for gossip; will truncate IHAVE list (%d messages)', messageIDs.length);\n        }\n        // Send gossip to GossipFactor peers above threshold with a minimum of D_lazy\n        // First we collect the peers above gossipThreshold that are not in the exclude set\n        // and then randomly select from that set\n        // We also exclude direct peers, as there is no reason to emit gossip to them\n        const peersToGossip = [];\n        const topicPeers = this.topics.get(topic);\n        if (!topicPeers) {\n            // no topic peers, no gossip\n            return;\n        }\n        topicPeers.forEach(id => {\n            const peerStreams = this.peers.get(id);\n            if (!peerStreams) {\n                return;\n            }\n            if (!exclude.has(id) &&\n                !this.direct.has(id) &&\n                utils_1.hasGossipProtocol(peerStreams.protocol) &&\n                this.score.score(id) >= this._options.scoreThresholds.gossipThreshold) {\n                peersToGossip.push(id);\n            }\n        });\n        let target = this._options.Dlazy;\n        const factor = constants.GossipsubGossipFactor * peersToGossip.length;\n        if (factor > target) {\n            target = factor;\n        }\n        if (target > peersToGossip.length) {\n            target = peersToGossip.length;\n        }\n        else {\n            utils_1.shuffle(peersToGossip);\n        }\n        // Emit the IHAVE gossip to the selected peers up to the target\n        peersToGossip.slice(0, target).forEach(id => {\n            let peerMessageIDs = messageIDs;\n            if (messageIDs.length > constants.GossipsubMaxIHaveLength) {\n                // shuffle and slice message IDs per peer so that we emit a different set for each peer\n                // we have enough reduncancy in the system that this will significantly increase the message\n                // coverage when we do truncate\n                peerMessageIDs = utils_1.shuffle(peerMessageIDs.slice()).slice(0, constants.GossipsubMaxIHaveLength);\n            }\n            this._pushGossip(id, {\n                topicID: topic,\n                messageIDs: peerMessageIDs\n            });\n        });\n    }\n    /**\n     * Flush gossip and control messages\n     */\n    _flush() {\n        // send gossip first, which will also piggyback control\n        for (const [peer, ihave] of this.gossip.entries()) {\n            this.gossip.delete(peer);\n            const out = utils_1.createGossipRpc([], { ihave });\n            this._sendRpc(peer, out);\n        }\n        // send the remaining control messages\n        for (const [peer, control] of this.control.entries()) {\n            this.control.delete(peer);\n            const out = utils_1.createGossipRpc([], { graft: control.graft, prune: control.prune });\n            this._sendRpc(peer, out);\n        }\n    }\n    /**\n     * Adds new IHAVE messages to pending gossip\n     * @param {PeerStreams} peerStreams\n     * @param {Array<RPC.IControlIHave>} controlIHaveMsgs\n     * @returns {void}\n     */\n    _pushGossip(id, controlIHaveMsgs) {\n        this.log('Add gossip to %s', id);\n        const gossip = this.gossip.get(id) || [];\n        this.gossip.set(id, gossip.concat(controlIHaveMsgs));\n    }\n    /**\n     * Returns the current time in milliseconds\n     * @returns {number}\n     */\n    _now() {\n        return Date.now();\n    }\n    /**\n     * Make a PRUNE control message for a peer in a topic\n     * @param {string} id\n     * @param {string} topic\n     * @param {boolean} doPX\n     * @returns {RPC.IControlPrune}\n     */\n    _makePrune(id, topic, doPX) {\n        if (this.peers.get(id).protocol === constants.GossipsubIDv10) {\n            // Gossipsub v1.0 -- no backoff, the peer won't be able to parse it anyway\n            return {\n                topicID: topic,\n                peers: []\n            };\n        }\n        // backoff is measured in seconds\n        // GossipsubPruneBackoff is measured in milliseconds\n        const backoff = constants.GossipsubPruneBackoff / 1000;\n        const px = [];\n        if (doPX) {\n            // select peers for Peer eXchange\n            const peers = get_gossip_peers_1.getGossipPeers(this, topic, constants.GossipsubPrunePeers, (xid) => {\n                return xid !== id && this.score.score(xid) >= 0;\n            });\n            peers.forEach(p => {\n                // see if we have a signed record to send back; if we don't, just send\n                // the peer ID and let the pruned peer find them in the DHT -- we can't trust\n                // unsigned address records through PX anyways\n                // Finding signed records in the DHT is not supported at the time of writing in js-libp2p\n                const peerId = PeerId.createFromB58String(p);\n                px.push({\n                    peerID: peerId.toBytes(),\n                    signedPeerRecord: this._libp2p.peerStore.addressBook.getRawEnvelope(peerId)\n                });\n            });\n        }\n        return {\n            topicID: topic,\n            peers: px,\n            backoff: backoff\n        };\n    }\n}\nGossipsub.multicodec = constants.GossipsubIDv11;\nmodule.exports = Gossipsub;\n","'use strict'\n\nconst debug = require('debug')\nconst { EventEmitter } = require('events')\nconst errcode = require('err-code')\n\nconst { pipe } = require('it-pipe')\n\nconst MulticodecTopology = require('../topology/multicodec-topology')\nconst { codes } = require('./errors')\n\nconst { RPC } = require('./message/rpc')\nconst PeerStreams = require('./peer-streams')\nconst { SignaturePolicy } = require('./signature-policy')\nconst utils = require('./utils')\n\nconst {\n  signMessage,\n  verifySignature\n} = require('./message/sign')\n\n/**\n * @typedef {any} Libp2p\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('bl')} BufferList\n * @typedef {import('../stream-muxer/types').MuxedStream} MuxedStream\n * @typedef {import('../connection/connection')} Connection\n * @typedef {import('./signature-policy').SignaturePolicyType} SignaturePolicyType\n * @typedef {import('./message/rpc').IRPC} IRPC\n * @typedef {import('./message/rpc').RPC.SubOpts} RPCSubOpts\n * @typedef {import('./message/rpc').RPC.Message} RPCMessage\n */\n\n/**\n * @typedef {Object} InMessage\n * @property {string} [from]\n * @property {string} receivedFrom\n * @property {string[]} topicIDs\n * @property {Uint8Array} [seqno]\n * @property {Uint8Array} data\n * @property {Uint8Array} [signature]\n * @property {Uint8Array} [key]\n *\n * @typedef {Object} PubsubProperties\n * @property {string} debugName - log namespace\n * @property {Array<string>|string} multicodecs - protocol identificers to connect\n * @property {Libp2p} libp2p\n *\n * @typedef {Object} PubsubOptions\n * @property {SignaturePolicyType} [globalSignaturePolicy = SignaturePolicy.StrictSign] - defines how signatures should be handled\n * @property {boolean} [canRelayMessage = false] - if can relay messages not subscribed\n * @property {boolean} [emitSelf = false] - if publish should emit to self, if subscribed\n */\n\n/**\n * PubsubBaseProtocol handles the peers and connections logic for pubsub routers\n * and specifies the API that pubsub routers should have.\n */\nclass PubsubBaseProtocol extends EventEmitter {\n  /**\n   * @param {PubsubProperties & PubsubOptions} props\n   * @abstract\n   */\n  constructor ({\n    debugName,\n    multicodecs,\n    libp2p,\n    globalSignaturePolicy = SignaturePolicy.StrictSign,\n    canRelayMessage = false,\n    emitSelf = false\n  }) {\n    if (typeof debugName !== 'string') {\n      throw new Error('a debugname `string` is required')\n    }\n\n    if (!multicodecs) {\n      throw new Error('multicodecs are required')\n    }\n\n    if (!libp2p) {\n      throw new Error('libp2p is required')\n    }\n\n    super()\n\n    this.log = Object.assign(debug(debugName), {\n      err: debug(`${debugName}:error`)\n    })\n\n    /**\n     * @type {Array<string>}\n     */\n    this.multicodecs = utils.ensureArray(multicodecs)\n    this._libp2p = libp2p\n    this.registrar = libp2p.registrar\n    /**\n     * @type {PeerId}\n     */\n    this.peerId = libp2p.peerId\n\n    this.started = false\n\n    /**\n     * Map of topics to which peers are subscribed to\n     *\n     * @type {Map<string, Set<string>>}\n     */\n    this.topics = new Map()\n\n    /**\n     * List of our subscriptions\n     *\n     * @type {Set<string>}\n     */\n    this.subscriptions = new Set()\n\n    /**\n     * Map of peer streams\n     *\n     * @type {Map<string, import('./peer-streams')>}\n     */\n    this.peers = new Map()\n\n    // validate signature policy\n    if (!SignaturePolicy[globalSignaturePolicy]) {\n      throw errcode(new Error('Invalid global signature policy'), codes.ERR_INVALID_SIGNATURE_POLICY)\n    }\n\n    /**\n     * The signature policy to follow by default\n     *\n     * @type {string}\n     */\n    this.globalSignaturePolicy = globalSignaturePolicy\n\n    /**\n     * If router can relay received messages, even if not subscribed\n     *\n     * @type {boolean}\n     */\n    this.canRelayMessage = canRelayMessage\n\n    /**\n     * if publish should emit to self, if subscribed\n     *\n     * @type {boolean}\n     */\n    this.emitSelf = emitSelf\n\n    /**\n     * Topic validator function\n     *\n     * @typedef {function(string, InMessage): Promise<void>} validator\n     */\n    /**\n     * Topic validator map\n     *\n     * Keyed by topic\n     * Topic validators are functions with the following input:\n     *\n     * @type {Map<string, validator>}\n     */\n    this.topicValidators = new Map()\n\n    this._registrarId = undefined\n    this._onIncomingStream = this._onIncomingStream.bind(this)\n    this._onPeerConnected = this._onPeerConnected.bind(this)\n    this._onPeerDisconnected = this._onPeerDisconnected.bind(this)\n  }\n\n  // LIFECYCLE METHODS\n\n  /**\n   * Register the pubsub protocol onto the libp2p node.\n   *\n   * @returns {void}\n   */\n  start () {\n    if (this.started) {\n      return\n    }\n    this.log('starting')\n\n    // Incoming streams\n    // Called after a peer dials us\n    this.registrar.handle(this.multicodecs, this._onIncomingStream)\n\n    // register protocol with topology\n    // Topology callbacks called on connection manager changes\n    const topology = new MulticodecTopology({\n      multicodecs: this.multicodecs,\n      handlers: {\n        onConnect: this._onPeerConnected,\n        onDisconnect: this._onPeerDisconnected\n      }\n    })\n    this._registrarId = this.registrar.register(topology)\n\n    this.log('started')\n    this.started = true\n  }\n\n  /**\n   * Unregister the pubsub protocol and the streams with other peers will be closed.\n   *\n   * @returns {void}\n   */\n  stop () {\n    if (!this.started) {\n      return\n    }\n\n    // unregister protocol and handlers\n    this.registrar.unregister(this._registrarId)\n\n    this.log('stopping')\n    this.peers.forEach((peerStreams) => peerStreams.close())\n\n    this.peers = new Map()\n    this.subscriptions = new Set()\n    this.started = false\n    this.log('stopped')\n  }\n\n  /**\n   * On an inbound stream opened.\n   *\n   * @protected\n   * @param {Object} props\n   * @param {string} props.protocol\n   * @param {MuxedStream} props.stream\n   * @param {Connection} props.connection - connection\n   */\n  _onIncomingStream ({ protocol, stream, connection }) {\n    const peerId = connection.remotePeer\n    const idB58Str = peerId.toB58String()\n    const peer = this._addPeer(peerId, protocol)\n    const inboundStream = peer.attachInboundStream(stream)\n\n    this._processMessages(idB58Str, inboundStream, peer)\n  }\n\n  /**\n   * Registrar notifies an established connection with pubsub protocol.\n   *\n   * @protected\n   * @param {PeerId} peerId - remote peer-id\n   * @param {Connection} conn - connection to the peer\n   */\n  async _onPeerConnected (peerId, conn) {\n    const idB58Str = peerId.toB58String()\n    this.log('connected', idB58Str)\n\n    try {\n      const { stream, protocol } = await conn.newStream(this.multicodecs)\n      const peer = this._addPeer(peerId, protocol)\n      await peer.attachOutboundStream(stream)\n    } catch (err) {\n      this.log.err(err)\n    }\n\n    // Immediately send my own subscriptions to the newly established conn\n    this._sendSubscriptions(idB58Str, Array.from(this.subscriptions), true)\n  }\n\n  /**\n   * Registrar notifies a closing connection with pubsub protocol.\n   *\n   * @protected\n   * @param {PeerId} peerId - peerId\n   * @param {Error} [err] - error for connection end\n   */\n  _onPeerDisconnected (peerId, err) {\n    const idB58Str = peerId.toB58String()\n\n    this.log('connection ended', idB58Str, err ? err.message : '')\n    this._removePeer(peerId)\n  }\n\n  /**\n   * Notifies the router that a peer has been connected\n   *\n   * @protected\n   * @param {PeerId} peerId\n   * @param {string} protocol\n   * @returns {PeerStreams}\n   */\n  _addPeer (peerId, protocol) {\n    const id = peerId.toB58String()\n    const existing = this.peers.get(id)\n\n    // If peer streams already exists, do nothing\n    if (existing) {\n      return existing\n    }\n\n    // else create a new peer streams\n    this.log('new peer', id)\n\n    const peerStreams = new PeerStreams({\n      id: peerId,\n      protocol\n    })\n\n    this.peers.set(id, peerStreams)\n    peerStreams.once('close', () => this._removePeer(peerId))\n\n    return peerStreams\n  }\n\n  /**\n   * Notifies the router that a peer has been disconnected.\n   *\n   * @protected\n   * @param {PeerId} peerId\n   * @returns {PeerStreams | undefined}\n   */\n  _removePeer (peerId) {\n    if (!peerId) return\n    const id = peerId.toB58String()\n    const peerStreams = this.peers.get(id)\n    if (!peerStreams) return\n\n    // close peer streams\n    peerStreams.removeAllListeners()\n    peerStreams.close()\n\n    // delete peer streams\n    this.log('delete peer', id)\n    this.peers.delete(id)\n\n    // remove peer from topics map\n    for (const peers of this.topics.values()) {\n      peers.delete(id)\n    }\n\n    return peerStreams\n  }\n\n  // MESSAGE METHODS\n\n  /**\n   * Responsible for processing each RPC message received by other peers.\n   *\n   * @param {string} idB58Str - peer id string in base58\n   * @param {AsyncIterable<Uint8Array|BufferList>} stream - inbound stream\n   * @param {PeerStreams} peerStreams - PubSub peer\n   * @returns {Promise<void>}\n   */\n  async _processMessages (idB58Str, stream, peerStreams) {\n    try {\n      await pipe(\n        stream,\n        async (source) => {\n          for await (const data of source) {\n            const rpcBytes = data instanceof Uint8Array ? data : data.slice()\n            const rpcMsg = this._decodeRpc(rpcBytes)\n\n            this._processRpc(idB58Str, peerStreams, rpcMsg)\n          }\n        }\n      )\n    } catch (err) {\n      this._onPeerDisconnected(peerStreams.id, err)\n    }\n  }\n\n  /**\n   * Handles an rpc request from a peer\n   *\n   * @param {string} idB58Str\n   * @param {PeerStreams} peerStreams\n   * @param {RPC} rpc\n   * @returns {boolean}\n   */\n  _processRpc (idB58Str, peerStreams, rpc) {\n    this.log('rpc from', idB58Str)\n    const subs = rpc.subscriptions\n    const msgs = rpc.msgs\n\n    if (subs.length) {\n      // update peer subscriptions\n      subs.forEach((subOpt) => {\n        this._processRpcSubOpt(idB58Str, subOpt)\n      })\n      this.emit('pubsub:subscription-change', peerStreams.id, subs)\n    }\n\n    if (!this._acceptFrom(idB58Str)) {\n      this.log('received message from unacceptable peer %s', idB58Str)\n      return false\n    }\n\n    if (msgs.length) {\n      // @ts-ignore RPC message is modified\n      msgs.forEach((message) => {\n        if (!(this.canRelayMessage || (message.topicIDs && message.topicIDs.some((topic) => this.subscriptions.has(topic))))) {\n          this.log('received message we didn\\'t subscribe to. Dropping.')\n          return\n        }\n        const msg = utils.normalizeInRpcMessage(message, idB58Str)\n        this._processRpcMessage(msg)\n      })\n    }\n    return true\n  }\n\n  /**\n   * Handles a subscription change from a peer\n   *\n   * @param {string} id\n   * @param {RPC.ISubOpts} subOpt\n   */\n  _processRpcSubOpt (id, subOpt) {\n    const t = subOpt.topicID\n\n    if (!t) {\n      return\n    }\n\n    let topicSet = this.topics.get(t)\n    if (!topicSet) {\n      topicSet = new Set()\n      this.topics.set(t, topicSet)\n    }\n\n    if (subOpt.subscribe) {\n      // subscribe peer to new topic\n      topicSet.add(id)\n    } else {\n      // unsubscribe from existing topic\n      topicSet.delete(id)\n    }\n  }\n\n  /**\n   * Handles an message from a peer\n   *\n   * @param {InMessage} msg\n   * @returns {Promise<void>}\n   */\n  async _processRpcMessage (msg) {\n    if (this.peerId.toB58String() === msg.from && !this.emitSelf) {\n      return\n    }\n\n    // Ensure the message is valid before processing it\n    try {\n      await this.validate(msg)\n    } catch (err) {\n      this.log('Message is invalid, dropping it. %O', err)\n      return\n    }\n\n    // Emit to self\n    this._emitMessage(msg)\n\n    this._publish(utils.normalizeOutRpcMessage(msg))\n  }\n\n  /**\n   * Emit a message from a peer\n   *\n   * @param {InMessage} message\n   */\n  _emitMessage (message) {\n    message.topicIDs.forEach((topic) => {\n      if (this.subscriptions.has(topic)) {\n        this.emit(topic, message)\n      }\n    })\n  }\n\n  /**\n   * The default msgID implementation\n   * Child class can override this.\n   *\n   * @param {InMessage} msg - the message object\n   * @returns {Uint8Array} message id as bytes\n   */\n  getMsgId (msg) {\n    const signaturePolicy = this.globalSignaturePolicy\n    switch (signaturePolicy) {\n      case SignaturePolicy.StrictSign:\n        // @ts-ignore seqno is optional in protobuf definition but it will exist\n        return utils.msgId(msg.from, msg.seqno)\n      case SignaturePolicy.StrictNoSign:\n        return utils.noSignMsgId(msg.data)\n      default:\n        throw errcode(new Error('Cannot get message id: unhandled signature policy: ' + signaturePolicy), codes.ERR_UNHANDLED_SIGNATURE_POLICY)\n    }\n  }\n\n  /**\n   * Whether to accept a message from a peer\n   * Override to create a graylist\n   *\n   * @override\n   * @param {string} id\n   * @returns {boolean}\n   */\n  _acceptFrom (id) {\n    return true\n  }\n\n  /**\n   * Decode Uint8Array into an RPC object.\n   * This can be override to use a custom router protobuf.\n   *\n   * @param {Uint8Array} bytes\n   * @returns {RPC}\n   */\n  _decodeRpc (bytes) {\n    return RPC.decode(bytes)\n  }\n\n  /**\n   * Encode RPC object into a Uint8Array.\n   * This can be override to use a custom router protobuf.\n   *\n   * @param {IRPC} rpc\n   * @returns {Uint8Array}\n   */\n  _encodeRpc (rpc) {\n    return RPC.encode(rpc).finish()\n  }\n\n  /**\n   * Send an rpc object to a peer\n   *\n   * @param {string} id - peer id\n   * @param {IRPC} rpc\n   * @returns {void}\n   */\n  _sendRpc (id, rpc) {\n    const peerStreams = this.peers.get(id)\n    if (!peerStreams || !peerStreams.isWritable) {\n      const msg = `Cannot send RPC to ${id} as there is no open stream to it available`\n\n      this.log.err(msg)\n      return\n    }\n    peerStreams.write(this._encodeRpc(rpc))\n  }\n\n  /**\n   * Send subscroptions to a peer\n   *\n   * @param {string} id - peer id\n   * @param {string[]} topics\n   * @param {boolean} subscribe - set to false for unsubscriptions\n   * @returns {void}\n   */\n  _sendSubscriptions (id, topics, subscribe) {\n    return this._sendRpc(id, {\n      subscriptions: topics.map(t => ({ topicID: t, subscribe: subscribe }))\n    })\n  }\n\n  /**\n   * Validates the given message. The signature will be checked for authenticity.\n   * Throws an error on invalid messages\n   *\n   * @param {InMessage} message\n   * @returns {Promise<void>}\n   */\n  async validate (message) { // eslint-disable-line require-await\n    const signaturePolicy = this.globalSignaturePolicy\n    switch (signaturePolicy) {\n      case SignaturePolicy.StrictNoSign:\n        if (message.from) {\n          throw errcode(new Error('StrictNoSigning: from should not be present'), codes.ERR_UNEXPECTED_FROM)\n        }\n        if (message.signature) {\n          throw errcode(new Error('StrictNoSigning: signature should not be present'), codes.ERR_UNEXPECTED_SIGNATURE)\n        }\n        if (message.key) {\n          throw errcode(new Error('StrictNoSigning: key should not be present'), codes.ERR_UNEXPECTED_KEY)\n        }\n        if (message.seqno) {\n          throw errcode(new Error('StrictNoSigning: seqno should not be present'), codes.ERR_UNEXPECTED_SEQNO)\n        }\n        break\n      case SignaturePolicy.StrictSign:\n        if (!message.signature) {\n          throw errcode(new Error('StrictSigning: Signing required and no signature was present'), codes.ERR_MISSING_SIGNATURE)\n        }\n        if (!message.seqno) {\n          throw errcode(new Error('StrictSigning: Signing required and no seqno was present'), codes.ERR_MISSING_SEQNO)\n        }\n        if (!(await verifySignature(message))) {\n          throw errcode(new Error('StrictSigning: Invalid message signature'), codes.ERR_INVALID_SIGNATURE)\n        }\n        break\n      default:\n        throw errcode(new Error('Cannot validate message: unhandled signature policy: ' + signaturePolicy), codes.ERR_UNHANDLED_SIGNATURE_POLICY)\n    }\n\n    for (const topic of message.topicIDs) {\n      const validatorFn = this.topicValidators.get(topic)\n      if (validatorFn) {\n        await validatorFn(topic, message)\n      }\n    }\n  }\n\n  /**\n   * Normalizes the message and signs it, if signing is enabled.\n   * Should be used by the routers to create the message to send.\n   *\n   * @protected\n   * @param {InMessage} message\n   * @returns {Promise<InMessage>}\n   */\n  _buildMessage (message) {\n    const signaturePolicy = this.globalSignaturePolicy\n    switch (signaturePolicy) {\n      case SignaturePolicy.StrictSign:\n        message.from = this.peerId.toB58String()\n        message.seqno = utils.randomSeqno()\n        return signMessage(this.peerId, utils.normalizeOutRpcMessage(message))\n      case SignaturePolicy.StrictNoSign:\n        return Promise.resolve(message)\n      default:\n        throw errcode(new Error('Cannot build message: unhandled signature policy: ' + signaturePolicy), codes.ERR_UNHANDLED_SIGNATURE_POLICY)\n    }\n  }\n\n  // API METHODS\n\n  /**\n   * Get a list of the peer-ids that are subscribed to one topic.\n   *\n   * @param {string} topic\n   * @returns {Array<string>}\n   */\n  getSubscribers (topic) {\n    if (!this.started) {\n      throw errcode(new Error('not started yet'), 'ERR_NOT_STARTED_YET')\n    }\n\n    if (!topic || typeof topic !== 'string') {\n      throw errcode(new Error('a string topic must be provided'), 'ERR_NOT_VALID_TOPIC')\n    }\n\n    const peersInTopic = this.topics.get(topic)\n    if (!peersInTopic) {\n      return []\n    }\n    return Array.from(peersInTopic)\n  }\n\n  /**\n   * Publishes messages to all subscribed peers\n   *\n   * @override\n   * @param {string} topic\n   * @param {Uint8Array} message\n   * @returns {Promise<void>}\n   */\n  async publish (topic, message) {\n    if (!this.started) {\n      throw new Error('Pubsub has not started')\n    }\n\n    this.log('publish', topic, message)\n\n    const from = this.peerId.toB58String()\n    const msgObject = {\n      receivedFrom: from,\n      data: message,\n      topicIDs: [topic]\n    }\n\n    // ensure that the message follows the signature policy\n    const outMsg = await this._buildMessage(msgObject)\n    // @ts-ignore different type as from is converted\n    const msg = utils.normalizeInRpcMessage(outMsg)\n\n    // Emit to self if I'm interested and emitSelf enabled\n    this.emitSelf && this._emitMessage(msg)\n\n    // send to all the other peers\n    await this._publish(msg)\n  }\n\n  /**\n   * Overriding the implementation of publish should handle the appropriate algorithms for the publish/subscriber implementation.\n   * For example, a Floodsub implementation might simply publish each message to each topic for every peer\n   *\n   * @abstract\n   * @param {InMessage|RPCMessage} message\n   * @returns {Promise<void>}\n   *\n   */\n  _publish (message) {\n    throw errcode(new Error('publish must be implemented by the subclass'), 'ERR_NOT_IMPLEMENTED')\n  }\n\n  /**\n   * Subscribes to a given topic.\n   *\n   * @abstract\n   * @param {string} topic\n   * @returns {void}\n   */\n  subscribe (topic) {\n    if (!this.started) {\n      throw new Error('Pubsub has not started')\n    }\n\n    if (!this.subscriptions.has(topic)) {\n      this.subscriptions.add(topic)\n      this.peers.forEach((_, id) => this._sendSubscriptions(id, [topic], true))\n    }\n  }\n\n  /**\n   * Unsubscribe from the given topic.\n   *\n   * @override\n   * @param {string} topic\n   * @returns {void}\n   */\n  unsubscribe (topic) {\n    if (!this.started) {\n      throw new Error('Pubsub is not started')\n    }\n\n    if (this.subscriptions.has(topic) && this.listenerCount(topic) === 0) {\n      this.subscriptions.delete(topic)\n      this.peers.forEach((_, id) => this._sendSubscriptions(id, [topic], false))\n    }\n  }\n\n  /**\n   * Get the list of topics which the peer is subscribed to.\n   *\n   * @override\n   * @returns {Array<string>}\n   */\n  getTopics () {\n    if (!this.started) {\n      throw new Error('Pubsub is not started')\n    }\n\n    return Array.from(this.subscriptions)\n  }\n}\n\nPubsubBaseProtocol.utils = utils\nPubsubBaseProtocol.SignaturePolicy = SignaturePolicy\n\nmodule.exports = PubsubBaseProtocol\n","'use strict'\n\nconst Topology = require('./index')\nconst multicodecTopologySymbol = Symbol.for('@libp2p/js-interfaces/topology/multicodec-topology')\n\nclass MulticodecTopology extends Topology {\n  /**\n   * @param {TopologyOptions & MulticodecOptions} props\n   */\n  constructor ({\n    min,\n    max,\n    multicodecs,\n    handlers\n  }) {\n    super({ min, max, handlers })\n\n    if (!multicodecs) {\n      throw new Error('one or more multicodec should be provided')\n    }\n\n    if (!handlers) {\n      throw new Error('the handlers should be provided')\n    }\n\n    if (typeof handlers.onConnect !== 'function') {\n      throw new Error('the \\'onConnect\\' handler must be provided')\n    }\n\n    if (typeof handlers.onDisconnect !== 'function') {\n      throw new Error('the \\'onDisconnect\\' handler must be provided')\n    }\n\n    this.multicodecs = Array.isArray(multicodecs) ? multicodecs : [multicodecs]\n    this._registrar = undefined\n\n    this._onProtocolChange = this._onProtocolChange.bind(this)\n    this._onPeerConnect = this._onPeerConnect.bind(this)\n  }\n\n  get [Symbol.toStringTag] () {\n    return 'Topology'\n  }\n\n  get [multicodecTopologySymbol] () {\n    return true\n  }\n\n  /**\n   * Checks if the given value is a `MulticodecTopology` instance.\n   *\n   * @param {any} other\n   * @returns {other is MulticodecTopology}\n   */\n  static isMulticodecTopology (other) {\n    return Boolean(other && other[multicodecTopologySymbol])\n  }\n\n  /**\n   * @param {any} registrar\n   */\n  set registrar (registrar) { // eslint-disable-line\n    this._registrar = registrar\n    this._registrar.peerStore.on('change:protocols', this._onProtocolChange)\n    this._registrar.connectionManager.on('peer:connect', this._onPeerConnect)\n\n    // Update topology peers\n    this._updatePeers(this._registrar.peerStore.peers.values())\n  }\n\n  /**\n   * Update topology.\n   *\n   * @param {Array<{id: PeerId, multiaddrs: Array<Multiaddr>, protocols: Array<string>}>} peerDataIterable\n   * @returns {void}\n   */\n  _updatePeers (peerDataIterable) {\n    for (const { id, protocols } of peerDataIterable) {\n      if (this.multicodecs.filter(multicodec => protocols.includes(multicodec)).length) {\n        // Add the peer regardless of whether or not there is currently a connection\n        this.peers.add(id.toB58String())\n        // If there is a connection, call _onConnect\n        const connection = this._registrar.getConnection(id)\n        connection && this._onConnect(id, connection)\n      } else {\n        // Remove any peers we might be tracking that are no longer of value to us\n        this.peers.delete(id.toB58String())\n      }\n    }\n  }\n\n  /**\n   * Check if a new peer support the multicodecs for this topology.\n   *\n   * @param {Object} props\n   * @param {PeerId} props.peerId\n   * @param {Array<string>} props.protocols\n   */\n  _onProtocolChange ({ peerId, protocols }) {\n    const hadPeer = this.peers.has(peerId.toB58String())\n    const hasProtocol = protocols.filter(protocol => this.multicodecs.includes(protocol))\n\n    // Not supporting the protocol anymore?\n    if (hadPeer && hasProtocol.length === 0) {\n      this._onDisconnect(peerId)\n    }\n\n    // New to protocol support\n    for (const protocol of protocols) {\n      if (this.multicodecs.includes(protocol)) {\n        const peerData = this._registrar.peerStore.get(peerId)\n        this._updatePeers([peerData])\n        return\n      }\n    }\n  }\n\n  /**\n   * Verify if a new connected peer has a topology multicodec and call _onConnect.\n   *\n   * @param {Connection} connection\n   * @returns {void}\n   */\n  _onPeerConnect (connection) {\n    // @ts-ignore - remotePeer does not existist on Connection\n    const peerId = connection.remotePeer\n    const protocols = this._registrar.peerStore.protoBook.get(peerId)\n\n    if (!protocols) {\n      return\n    }\n\n    if (this.multicodecs.find(multicodec => protocols.includes(multicodec))) {\n      this.peers.add(peerId.toB58String())\n      this._onConnect(peerId, connection)\n    }\n  }\n}\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('multiaddr')} Multiaddr\n * @typedef {import('../connection/connection')} Connection\n * @typedef {import('.').Options} TopologyOptions\n * @typedef {Object} MulticodecOptions\n * @property {string[]} multicodecs - protocol multicodecs\n * @property {Required<Handlers>} handlers\n * @typedef {import('.').Handlers} Handlers\n */\nmodule.exports = MulticodecTopology\n","'use strict'\n\nconst noop = () => {}\nconst topologySymbol = Symbol.for('@libp2p/js-interfaces/topology')\n\n/**\n * @typedef {import('peer-id')} PeerId\n */\n\n/**\n * @typedef {Object} Options\n * @property {number} [min=0] - minimum needed connections.\n * @property {number} [max=Infinity] - maximum needed connections.\n * @property {Handlers} [handlers]\n *\n * @typedef {Object} Handlers\n * @property {(peerId: PeerId, conn: Connection) => void} [onConnect] - protocol \"onConnect\" handler\n * @property {(peerId: PeerId, error?:Error) => void} [onDisconnect] - protocol \"onDisconnect\" handler\n *\n * @typedef {import('../connection/connection')} Connection\n */\n\nclass Topology {\n  /**\n   * @param {Options} options\n   */\n  constructor ({\n    min = 0,\n    max = Infinity,\n    handlers = {}\n  }) {\n    this.min = min\n    this.max = max\n\n    // Handlers\n    this._onConnect = handlers.onConnect || noop\n    this._onDisconnect = handlers.onDisconnect || noop\n\n    /**\n     * Set of peers that support the protocol.\n     *\n     * @type {Set<string>}\n     */\n    this.peers = new Set()\n  }\n\n  get [Symbol.toStringTag] () {\n    return 'Topology'\n  }\n\n  get [topologySymbol] () {\n    return true\n  }\n\n  /**\n   * Checks if the given value is a Topology instance.\n   *\n   * @param {any} other\n   * @returns {other is Topology}\n   */\n  static isTopology (other) {\n    return Boolean(other && other[topologySymbol])\n  }\n\n  /**\n   * @param {any} registrar\n   */\n  set registrar (registrar) { // eslint-disable-line\n    this._registrar = registrar\n  }\n\n  /**\n   * Notify about peer disconnected event.\n   *\n   * @param {PeerId} peerId\n   * @returns {void}\n   */\n  disconnect (peerId) {\n    this._onDisconnect(peerId)\n  }\n}\n\nmodule.exports = Topology\n","'use strict'\n\nexports.codes = {\n  /**\n   * Signature policy is invalid\n   */\n  ERR_INVALID_SIGNATURE_POLICY: 'ERR_INVALID_SIGNATURE_POLICY',\n  /**\n   * Signature policy is unhandled\n   */\n  ERR_UNHANDLED_SIGNATURE_POLICY: 'ERR_UNHANDLED_SIGNATURE_POLICY',\n\n  // Strict signing codes\n\n  /**\n   * Message expected to have a `signature`, but doesn't\n   */\n  ERR_MISSING_SIGNATURE: 'ERR_MISSING_SIGNATURE',\n  /**\n   * Message expected to have a `seqno`, but doesn't\n   */\n  ERR_MISSING_SEQNO: 'ERR_MISSING_SEQNO',\n  /**\n   * Message `signature` is invalid\n   */\n  ERR_INVALID_SIGNATURE: 'ERR_INVALID_SIGNATURE',\n\n  // Strict no-signing codes\n\n  /**\n   * Message expected to not have a `from`, but does\n   */\n  ERR_UNEXPECTED_FROM: 'ERR_UNEXPECTED_FROM',\n  /**\n   * Message expected to not have a `signature`, but does\n   */\n  ERR_UNEXPECTED_SIGNATURE: 'ERR_UNEXPECTED_SIGNATURE',\n  /**\n   * Message expected to not have a `key`, but does\n   */\n  ERR_UNEXPECTED_KEY: 'ERR_UNEXPECTED_KEY',\n  /**\n   * Message expected to not have a `seqno`, but does\n   */\n  ERR_UNEXPECTED_SEQNO: 'ERR_UNEXPECTED_SEQNO'\n}\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"libp2p-pubsub-rpc\"] || ($protobuf.roots[\"libp2p-pubsub-rpc\"] = {});\n\n$root.RPC = (function() {\n\n    /**\n     * Properties of a RPC.\n     * @exports IRPC\n     * @interface IRPC\n     * @property {Array.<RPC.ISubOpts>|null} [subscriptions] RPC subscriptions\n     * @property {Array.<RPC.IMessage>|null} [msgs] RPC msgs\n     */\n\n    /**\n     * Constructs a new RPC.\n     * @exports RPC\n     * @classdesc Represents a RPC.\n     * @implements IRPC\n     * @constructor\n     * @param {IRPC=} [p] Properties to set\n     */\n    function RPC(p) {\n        this.subscriptions = [];\n        this.msgs = [];\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * RPC subscriptions.\n     * @member {Array.<RPC.ISubOpts>} subscriptions\n     * @memberof RPC\n     * @instance\n     */\n    RPC.prototype.subscriptions = $util.emptyArray;\n\n    /**\n     * RPC msgs.\n     * @member {Array.<RPC.IMessage>} msgs\n     * @memberof RPC\n     * @instance\n     */\n    RPC.prototype.msgs = $util.emptyArray;\n\n    /**\n     * Encodes the specified RPC message. Does not implicitly {@link RPC.verify|verify} messages.\n     * @function encode\n     * @memberof RPC\n     * @static\n     * @param {IRPC} m RPC message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    RPC.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.subscriptions != null && m.subscriptions.length) {\n            for (var i = 0; i < m.subscriptions.length; ++i)\n                $root.RPC.SubOpts.encode(m.subscriptions[i], w.uint32(10).fork()).ldelim();\n        }\n        if (m.msgs != null && m.msgs.length) {\n            for (var i = 0; i < m.msgs.length; ++i)\n                $root.RPC.Message.encode(m.msgs[i], w.uint32(18).fork()).ldelim();\n        }\n        return w;\n    };\n\n    /**\n     * Decodes a RPC message from the specified reader or buffer.\n     * @function decode\n     * @memberof RPC\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {RPC} RPC\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    RPC.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                if (!(m.subscriptions && m.subscriptions.length))\n                    m.subscriptions = [];\n                m.subscriptions.push($root.RPC.SubOpts.decode(r, r.uint32()));\n                break;\n            case 2:\n                if (!(m.msgs && m.msgs.length))\n                    m.msgs = [];\n                m.msgs.push($root.RPC.Message.decode(r, r.uint32()));\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a RPC message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof RPC\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {RPC} RPC\n     */\n    RPC.fromObject = function fromObject(d) {\n        if (d instanceof $root.RPC)\n            return d;\n        var m = new $root.RPC();\n        if (d.subscriptions) {\n            if (!Array.isArray(d.subscriptions))\n                throw TypeError(\".RPC.subscriptions: array expected\");\n            m.subscriptions = [];\n            for (var i = 0; i < d.subscriptions.length; ++i) {\n                if (typeof d.subscriptions[i] !== \"object\")\n                    throw TypeError(\".RPC.subscriptions: object expected\");\n                m.subscriptions[i] = $root.RPC.SubOpts.fromObject(d.subscriptions[i]);\n            }\n        }\n        if (d.msgs) {\n            if (!Array.isArray(d.msgs))\n                throw TypeError(\".RPC.msgs: array expected\");\n            m.msgs = [];\n            for (var i = 0; i < d.msgs.length; ++i) {\n                if (typeof d.msgs[i] !== \"object\")\n                    throw TypeError(\".RPC.msgs: object expected\");\n                m.msgs[i] = $root.RPC.Message.fromObject(d.msgs[i]);\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a RPC message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof RPC\n     * @static\n     * @param {RPC} m RPC\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    RPC.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.arrays || o.defaults) {\n            d.subscriptions = [];\n            d.msgs = [];\n        }\n        if (m.subscriptions && m.subscriptions.length) {\n            d.subscriptions = [];\n            for (var j = 0; j < m.subscriptions.length; ++j) {\n                d.subscriptions[j] = $root.RPC.SubOpts.toObject(m.subscriptions[j], o);\n            }\n        }\n        if (m.msgs && m.msgs.length) {\n            d.msgs = [];\n            for (var j = 0; j < m.msgs.length; ++j) {\n                d.msgs[j] = $root.RPC.Message.toObject(m.msgs[j], o);\n            }\n        }\n        return d;\n    };\n\n    /**\n     * Converts this RPC to JSON.\n     * @function toJSON\n     * @memberof RPC\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    RPC.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    RPC.SubOpts = (function() {\n\n        /**\n         * Properties of a SubOpts.\n         * @memberof RPC\n         * @interface ISubOpts\n         * @property {boolean|null} [subscribe] SubOpts subscribe\n         * @property {string|null} [topicID] SubOpts topicID\n         */\n\n        /**\n         * Constructs a new SubOpts.\n         * @memberof RPC\n         * @classdesc Represents a SubOpts.\n         * @implements ISubOpts\n         * @constructor\n         * @param {RPC.ISubOpts=} [p] Properties to set\n         */\n        function SubOpts(p) {\n            if (p)\n                for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                    if (p[ks[i]] != null)\n                        this[ks[i]] = p[ks[i]];\n        }\n\n        /**\n         * SubOpts subscribe.\n         * @member {boolean} subscribe\n         * @memberof RPC.SubOpts\n         * @instance\n         */\n        SubOpts.prototype.subscribe = false;\n\n        /**\n         * SubOpts topicID.\n         * @member {string} topicID\n         * @memberof RPC.SubOpts\n         * @instance\n         */\n        SubOpts.prototype.topicID = \"\";\n\n        /**\n         * Encodes the specified SubOpts message. Does not implicitly {@link RPC.SubOpts.verify|verify} messages.\n         * @function encode\n         * @memberof RPC.SubOpts\n         * @static\n         * @param {RPC.ISubOpts} m SubOpts message or plain object to encode\n         * @param {$protobuf.Writer} [w] Writer to encode to\n         * @returns {$protobuf.Writer} Writer\n         */\n        SubOpts.encode = function encode(m, w) {\n            if (!w)\n                w = $Writer.create();\n            if (m.subscribe != null && Object.hasOwnProperty.call(m, \"subscribe\"))\n                w.uint32(8).bool(m.subscribe);\n            if (m.topicID != null && Object.hasOwnProperty.call(m, \"topicID\"))\n                w.uint32(18).string(m.topicID);\n            return w;\n        };\n\n        /**\n         * Decodes a SubOpts message from the specified reader or buffer.\n         * @function decode\n         * @memberof RPC.SubOpts\n         * @static\n         * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n         * @param {number} [l] Message length if known beforehand\n         * @returns {RPC.SubOpts} SubOpts\n         * @throws {Error} If the payload is not a reader or valid buffer\n         * @throws {$protobuf.util.ProtocolError} If required fields are missing\n         */\n        SubOpts.decode = function decode(r, l) {\n            if (!(r instanceof $Reader))\n                r = $Reader.create(r);\n            var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC.SubOpts();\n            while (r.pos < c) {\n                var t = r.uint32();\n                switch (t >>> 3) {\n                case 1:\n                    m.subscribe = r.bool();\n                    break;\n                case 2:\n                    m.topicID = r.string();\n                    break;\n                default:\n                    r.skipType(t & 7);\n                    break;\n                }\n            }\n            return m;\n        };\n\n        /**\n         * Creates a SubOpts message from a plain object. Also converts values to their respective internal types.\n         * @function fromObject\n         * @memberof RPC.SubOpts\n         * @static\n         * @param {Object.<string,*>} d Plain object\n         * @returns {RPC.SubOpts} SubOpts\n         */\n        SubOpts.fromObject = function fromObject(d) {\n            if (d instanceof $root.RPC.SubOpts)\n                return d;\n            var m = new $root.RPC.SubOpts();\n            if (d.subscribe != null) {\n                m.subscribe = Boolean(d.subscribe);\n            }\n            if (d.topicID != null) {\n                m.topicID = String(d.topicID);\n            }\n            return m;\n        };\n\n        /**\n         * Creates a plain object from a SubOpts message. Also converts values to other types if specified.\n         * @function toObject\n         * @memberof RPC.SubOpts\n         * @static\n         * @param {RPC.SubOpts} m SubOpts\n         * @param {$protobuf.IConversionOptions} [o] Conversion options\n         * @returns {Object.<string,*>} Plain object\n         */\n        SubOpts.toObject = function toObject(m, o) {\n            if (!o)\n                o = {};\n            var d = {};\n            if (o.defaults) {\n                d.subscribe = false;\n                d.topicID = \"\";\n            }\n            if (m.subscribe != null && m.hasOwnProperty(\"subscribe\")) {\n                d.subscribe = m.subscribe;\n            }\n            if (m.topicID != null && m.hasOwnProperty(\"topicID\")) {\n                d.topicID = m.topicID;\n            }\n            return d;\n        };\n\n        /**\n         * Converts this SubOpts to JSON.\n         * @function toJSON\n         * @memberof RPC.SubOpts\n         * @instance\n         * @returns {Object.<string,*>} JSON object\n         */\n        SubOpts.prototype.toJSON = function toJSON() {\n            return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n        };\n\n        return SubOpts;\n    })();\n\n    RPC.Message = (function() {\n\n        /**\n         * Properties of a Message.\n         * @memberof RPC\n         * @interface IMessage\n         * @property {Uint8Array|null} [from] Message from\n         * @property {Uint8Array|null} [data] Message data\n         * @property {Uint8Array|null} [seqno] Message seqno\n         * @property {Array.<string>|null} [topicIDs] Message topicIDs\n         * @property {Uint8Array|null} [signature] Message signature\n         * @property {Uint8Array|null} [key] Message key\n         */\n\n        /**\n         * Constructs a new Message.\n         * @memberof RPC\n         * @classdesc Represents a Message.\n         * @implements IMessage\n         * @constructor\n         * @param {RPC.IMessage=} [p] Properties to set\n         */\n        function Message(p) {\n            this.topicIDs = [];\n            if (p)\n                for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                    if (p[ks[i]] != null)\n                        this[ks[i]] = p[ks[i]];\n        }\n\n        /**\n         * Message from.\n         * @member {Uint8Array} from\n         * @memberof RPC.Message\n         * @instance\n         */\n        Message.prototype.from = $util.newBuffer([]);\n\n        /**\n         * Message data.\n         * @member {Uint8Array} data\n         * @memberof RPC.Message\n         * @instance\n         */\n        Message.prototype.data = $util.newBuffer([]);\n\n        /**\n         * Message seqno.\n         * @member {Uint8Array} seqno\n         * @memberof RPC.Message\n         * @instance\n         */\n        Message.prototype.seqno = $util.newBuffer([]);\n\n        /**\n         * Message topicIDs.\n         * @member {Array.<string>} topicIDs\n         * @memberof RPC.Message\n         * @instance\n         */\n        Message.prototype.topicIDs = $util.emptyArray;\n\n        /**\n         * Message signature.\n         * @member {Uint8Array} signature\n         * @memberof RPC.Message\n         * @instance\n         */\n        Message.prototype.signature = $util.newBuffer([]);\n\n        /**\n         * Message key.\n         * @member {Uint8Array} key\n         * @memberof RPC.Message\n         * @instance\n         */\n        Message.prototype.key = $util.newBuffer([]);\n\n        /**\n         * Encodes the specified Message message. Does not implicitly {@link RPC.Message.verify|verify} messages.\n         * @function encode\n         * @memberof RPC.Message\n         * @static\n         * @param {RPC.IMessage} m Message message or plain object to encode\n         * @param {$protobuf.Writer} [w] Writer to encode to\n         * @returns {$protobuf.Writer} Writer\n         */\n        Message.encode = function encode(m, w) {\n            if (!w)\n                w = $Writer.create();\n            if (m.from != null && Object.hasOwnProperty.call(m, \"from\"))\n                w.uint32(10).bytes(m.from);\n            if (m.data != null && Object.hasOwnProperty.call(m, \"data\"))\n                w.uint32(18).bytes(m.data);\n            if (m.seqno != null && Object.hasOwnProperty.call(m, \"seqno\"))\n                w.uint32(26).bytes(m.seqno);\n            if (m.topicIDs != null && m.topicIDs.length) {\n                for (var i = 0; i < m.topicIDs.length; ++i)\n                    w.uint32(34).string(m.topicIDs[i]);\n            }\n            if (m.signature != null && Object.hasOwnProperty.call(m, \"signature\"))\n                w.uint32(42).bytes(m.signature);\n            if (m.key != null && Object.hasOwnProperty.call(m, \"key\"))\n                w.uint32(50).bytes(m.key);\n            return w;\n        };\n\n        /**\n         * Decodes a Message message from the specified reader or buffer.\n         * @function decode\n         * @memberof RPC.Message\n         * @static\n         * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n         * @param {number} [l] Message length if known beforehand\n         * @returns {RPC.Message} Message\n         * @throws {Error} If the payload is not a reader or valid buffer\n         * @throws {$protobuf.util.ProtocolError} If required fields are missing\n         */\n        Message.decode = function decode(r, l) {\n            if (!(r instanceof $Reader))\n                r = $Reader.create(r);\n            var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC.Message();\n            while (r.pos < c) {\n                var t = r.uint32();\n                switch (t >>> 3) {\n                case 1:\n                    m.from = r.bytes();\n                    break;\n                case 2:\n                    m.data = r.bytes();\n                    break;\n                case 3:\n                    m.seqno = r.bytes();\n                    break;\n                case 4:\n                    if (!(m.topicIDs && m.topicIDs.length))\n                        m.topicIDs = [];\n                    m.topicIDs.push(r.string());\n                    break;\n                case 5:\n                    m.signature = r.bytes();\n                    break;\n                case 6:\n                    m.key = r.bytes();\n                    break;\n                default:\n                    r.skipType(t & 7);\n                    break;\n                }\n            }\n            return m;\n        };\n\n        /**\n         * Creates a Message message from a plain object. Also converts values to their respective internal types.\n         * @function fromObject\n         * @memberof RPC.Message\n         * @static\n         * @param {Object.<string,*>} d Plain object\n         * @returns {RPC.Message} Message\n         */\n        Message.fromObject = function fromObject(d) {\n            if (d instanceof $root.RPC.Message)\n                return d;\n            var m = new $root.RPC.Message();\n            if (d.from != null) {\n                if (typeof d.from === \"string\")\n                    $util.base64.decode(d.from, m.from = $util.newBuffer($util.base64.length(d.from)), 0);\n                else if (d.from.length)\n                    m.from = d.from;\n            }\n            if (d.data != null) {\n                if (typeof d.data === \"string\")\n                    $util.base64.decode(d.data, m.data = $util.newBuffer($util.base64.length(d.data)), 0);\n                else if (d.data.length)\n                    m.data = d.data;\n            }\n            if (d.seqno != null) {\n                if (typeof d.seqno === \"string\")\n                    $util.base64.decode(d.seqno, m.seqno = $util.newBuffer($util.base64.length(d.seqno)), 0);\n                else if (d.seqno.length)\n                    m.seqno = d.seqno;\n            }\n            if (d.topicIDs) {\n                if (!Array.isArray(d.topicIDs))\n                    throw TypeError(\".RPC.Message.topicIDs: array expected\");\n                m.topicIDs = [];\n                for (var i = 0; i < d.topicIDs.length; ++i) {\n                    m.topicIDs[i] = String(d.topicIDs[i]);\n                }\n            }\n            if (d.signature != null) {\n                if (typeof d.signature === \"string\")\n                    $util.base64.decode(d.signature, m.signature = $util.newBuffer($util.base64.length(d.signature)), 0);\n                else if (d.signature.length)\n                    m.signature = d.signature;\n            }\n            if (d.key != null) {\n                if (typeof d.key === \"string\")\n                    $util.base64.decode(d.key, m.key = $util.newBuffer($util.base64.length(d.key)), 0);\n                else if (d.key.length)\n                    m.key = d.key;\n            }\n            return m;\n        };\n\n        /**\n         * Creates a plain object from a Message message. Also converts values to other types if specified.\n         * @function toObject\n         * @memberof RPC.Message\n         * @static\n         * @param {RPC.Message} m Message\n         * @param {$protobuf.IConversionOptions} [o] Conversion options\n         * @returns {Object.<string,*>} Plain object\n         */\n        Message.toObject = function toObject(m, o) {\n            if (!o)\n                o = {};\n            var d = {};\n            if (o.arrays || o.defaults) {\n                d.topicIDs = [];\n            }\n            if (o.defaults) {\n                if (o.bytes === String)\n                    d.from = \"\";\n                else {\n                    d.from = [];\n                    if (o.bytes !== Array)\n                        d.from = $util.newBuffer(d.from);\n                }\n                if (o.bytes === String)\n                    d.data = \"\";\n                else {\n                    d.data = [];\n                    if (o.bytes !== Array)\n                        d.data = $util.newBuffer(d.data);\n                }\n                if (o.bytes === String)\n                    d.seqno = \"\";\n                else {\n                    d.seqno = [];\n                    if (o.bytes !== Array)\n                        d.seqno = $util.newBuffer(d.seqno);\n                }\n                if (o.bytes === String)\n                    d.signature = \"\";\n                else {\n                    d.signature = [];\n                    if (o.bytes !== Array)\n                        d.signature = $util.newBuffer(d.signature);\n                }\n                if (o.bytes === String)\n                    d.key = \"\";\n                else {\n                    d.key = [];\n                    if (o.bytes !== Array)\n                        d.key = $util.newBuffer(d.key);\n                }\n            }\n            if (m.from != null && m.hasOwnProperty(\"from\")) {\n                d.from = o.bytes === String ? $util.base64.encode(m.from, 0, m.from.length) : o.bytes === Array ? Array.prototype.slice.call(m.from) : m.from;\n            }\n            if (m.data != null && m.hasOwnProperty(\"data\")) {\n                d.data = o.bytes === String ? $util.base64.encode(m.data, 0, m.data.length) : o.bytes === Array ? Array.prototype.slice.call(m.data) : m.data;\n            }\n            if (m.seqno != null && m.hasOwnProperty(\"seqno\")) {\n                d.seqno = o.bytes === String ? $util.base64.encode(m.seqno, 0, m.seqno.length) : o.bytes === Array ? Array.prototype.slice.call(m.seqno) : m.seqno;\n            }\n            if (m.topicIDs && m.topicIDs.length) {\n                d.topicIDs = [];\n                for (var j = 0; j < m.topicIDs.length; ++j) {\n                    d.topicIDs[j] = m.topicIDs[j];\n                }\n            }\n            if (m.signature != null && m.hasOwnProperty(\"signature\")) {\n                d.signature = o.bytes === String ? $util.base64.encode(m.signature, 0, m.signature.length) : o.bytes === Array ? Array.prototype.slice.call(m.signature) : m.signature;\n            }\n            if (m.key != null && m.hasOwnProperty(\"key\")) {\n                d.key = o.bytes === String ? $util.base64.encode(m.key, 0, m.key.length) : o.bytes === Array ? Array.prototype.slice.call(m.key) : m.key;\n            }\n            return d;\n        };\n\n        /**\n         * Converts this Message to JSON.\n         * @function toJSON\n         * @memberof RPC.Message\n         * @instance\n         * @returns {Object.<string,*>} JSON object\n         */\n        Message.prototype.toJSON = function toJSON() {\n            return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n        };\n\n        return Message;\n    })();\n\n    return RPC;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p-pubsub:peer-streams'), {\n  error: debug('libp2p-pubsub:peer-streams:err')\n})\nconst { EventEmitter } = require('events')\n\nconst lp = require('it-length-prefixed')\nconst pushable = require('it-pushable')\nconst { pipe } = require('it-pipe')\nconst { source: abortable } = require('abortable-iterator')\nconst AbortController = require('abort-controller').default\n\n/**\n * @typedef {import('../stream-muxer/types').MuxedStream} MuxedStream\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('it-pushable').Pushable<Uint8Array>} PushableStream\n */\n\n/**\n * Thin wrapper around a peer's inbound / outbound pubsub streams\n */\nclass PeerStreams extends EventEmitter {\n  /**\n   * @param {object} properties - properties of the PeerStreams.\n   * @param {PeerId} properties.id\n   * @param {string} properties.protocol\n   */\n  constructor ({ id, protocol }) {\n    super()\n\n    /**\n     * @type {import('peer-id')}\n     */\n    this.id = id\n    /**\n     * Established protocol\n     *\n     * @type {string}\n     */\n    this.protocol = protocol\n    /**\n     * The raw outbound stream, as retrieved from conn.newStream\n     *\n     * @private\n     * @type {null|MuxedStream}\n     */\n    this._rawOutboundStream = null\n    /**\n     * The raw inbound stream, as retrieved from the callback from libp2p.handle\n     *\n     * @private\n     * @type {null|MuxedStream}\n     */\n    this._rawInboundStream = null\n    /**\n     * An AbortController for controlled shutdown of the inbound stream\n     *\n     * @private\n     * @type {AbortController}\n     */\n    this._inboundAbortController = new AbortController()\n    /**\n     * Write stream -- its preferable to use the write method\n     *\n     * @type {null|PushableStream}\n     */\n    this.outboundStream = null\n    /**\n     * Read stream\n     *\n     * @type {null| AsyncIterable<Uint8Array>}\n     */\n    this.inboundStream = null\n  }\n\n  /**\n   * Do we have a connection to read from?\n   *\n   * @type {boolean}\n   */\n  get isReadable () {\n    return Boolean(this.inboundStream)\n  }\n\n  /**\n   * Do we have a connection to write on?\n   *\n   * @type {boolean}\n   */\n  get isWritable () {\n    return Boolean(this.outboundStream)\n  }\n\n  /**\n   * Send a message to this peer.\n   * Throws if there is no `stream` to write to available.\n   *\n   * @param {Uint8Array} data\n   * @returns {void}\n   */\n  write (data) {\n    if (!this.outboundStream) {\n      const id = this.id.toB58String()\n      throw new Error('No writable connection to ' + id)\n    }\n\n    this.outboundStream.push(data)\n  }\n\n  /**\n   * Attach a raw inbound stream and setup a read stream\n   *\n   * @param {MuxedStream} stream\n   * @returns {AsyncIterable<Uint8Array>}\n   */\n  attachInboundStream (stream) {\n    // Create and attach a new inbound stream\n    // The inbound stream is:\n    // - abortable, set to only return on abort, rather than throw\n    // - transformed with length-prefix transform\n    this._rawInboundStream = stream\n    this.inboundStream = abortable(\n      pipe(\n        this._rawInboundStream,\n        lp.decode()\n      ),\n      this._inboundAbortController.signal,\n      { returnOnAbort: true }\n    )\n\n    this.emit('stream:inbound')\n    return this.inboundStream\n  }\n\n  /**\n   * Attach a raw outbound stream and setup a write stream\n   *\n   * @param {MuxedStream} stream\n   * @returns {Promise<void>}\n   */\n  async attachOutboundStream (stream) {\n    // If an outbound stream already exists, gently close it\n    const _prevStream = this.outboundStream\n    if (this.outboundStream) {\n      // End the stream without emitting a close event\n      await this.outboundStream.end()\n    }\n\n    this._rawOutboundStream = stream\n    this.outboundStream = pushable({\n      onEnd: (shouldEmit) => {\n        // close writable side of the stream\n        this._rawOutboundStream && this._rawOutboundStream.reset && this._rawOutboundStream.reset()\n        this._rawOutboundStream = null\n        this.outboundStream = null\n        if (shouldEmit) {\n          this.emit('close')\n        }\n      }\n    })\n\n    pipe(\n      this.outboundStream,\n      lp.encode(),\n      this._rawOutboundStream\n    ).catch(/** @param {Error} err */ err => {\n      log.error(err)\n    })\n\n    // Only emit if the connection is new\n    if (!_prevStream) {\n      this.emit('stream:outbound')\n    }\n  }\n\n  /**\n   * Closes the open connection to peer\n   *\n   * @returns {void}\n   */\n  close () {\n    // End the outbound stream\n    if (this.outboundStream) {\n      this.outboundStream.end()\n    }\n    // End the inbound stream\n    if (this.inboundStream) {\n      this._inboundAbortController.abort()\n    }\n\n    this._rawOutboundStream = null\n    this.outboundStream = null\n    this._rawInboundStream = null\n    this.inboundStream = null\n    this.emit('close')\n  }\n}\n\nmodule.exports = PeerStreams\n","'use strict'\n\n/**\n * @typedef {import('./types').EncoderOptions} EncoderOptions\n * @typedef {import('./types').DecoderOptions} DecoderOptions\n */\n\nexports.encode = require('./encode')\nexports.decode = require('./decode')\n\nexports.varintEncode = require('./varint-encode')\nexports.varintDecode = require('./varint-decode')\n\nexports.int32BEEncode = require('./int32BE-encode')\nexports.int32BEDecode = require('./int32BE-decode')\n","'use strict'\n\nconst { Buffer } = require('buffer')\n// @ts-ignore\nconst BufferList = require('bl/BufferList')\nconst varintEncode = require('./varint-encode')\n\nconst MIN_POOL_SIZE = 8 // Varint.encode(Number.MAX_SAFE_INTEGER).length\nconst DEFAULT_POOL_SIZE = 10 * 1024\n\n/**\n * @param {import('./types').EncoderOptions} [options]\n */\nfunction encode (options) {\n  options = options || {}\n\n  const poolSize = Math.max(options.poolSize || DEFAULT_POOL_SIZE, options.minPoolSize || MIN_POOL_SIZE)\n  const encodeLength = options.lengthEncoder || varintEncode\n\n  /**\n   * @param {AsyncIterable<BufferList>} source\n   */\n  const encoder = async function * (source) {\n    let pool = Buffer.alloc(poolSize)\n    let poolOffset = 0\n\n    for await (const chunk of source) {\n      encodeLength(chunk.length, pool, poolOffset)\n      const encodedLength = pool.slice(poolOffset, poolOffset + encodeLength.bytes)\n      poolOffset += encodeLength.bytes\n\n      if (pool.length - poolOffset < MIN_POOL_SIZE) {\n        pool = Buffer.alloc(poolSize)\n        poolOffset = 0\n      }\n\n      yield new BufferList().append(encodedLength).append(chunk)\n      // yield Buffer.concat([encodedLength, chunk])\n    }\n  }\n\n  return encoder\n}\n\n/**\n * @param {BufferList | Buffer} chunk\n * @param {import('./types').EncoderOptions} [options]\n */\nencode.single = (chunk, options) => {\n  options = options || {}\n  const encodeLength = options.lengthEncoder || varintEncode\n  return new BufferList([encodeLength(chunk.length), chunk.slice()])\n}\n\nmodule.exports = encode\nmodule.exports.MIN_POOL_SIZE = MIN_POOL_SIZE\nmodule.exports.DEFAULT_POOL_SIZE = DEFAULT_POOL_SIZE\n","'use strict'\n\n// @ts-ignore no types\nconst Varint = require('varint')\nconst { Buffer } = require('buffer')\n\n/**\n * Encode the passed length `value` to the `target` buffer at the given `offset`\n *\n * @type {import('./types').LengthEncoderFunction}\n */\n// @ts-ignore cannot declare expected bytes property\nconst varintEncode = (value, target, offset) => {\n  const ret = Varint.encode(value, target, offset)\n  varintEncode.bytes = Varint.encode.bytes\n  // If no target, create Buffer from returned array\n  return target || Buffer.from(ret)\n}\n\nmodule.exports = varintEncode\n","'use strict'\n\nconst { Buffer } = require('buffer')\n// @ts-ignore\nconst BufferList = require('bl/BufferList')\nconst varintDecode = require('./varint-decode')\n\n// Maximum length of the length section of the message\nconst MAX_LENGTH_LENGTH = 8 // Varint.encode(Number.MAX_SAFE_INTEGER).length\n// Maximum length of the data section of the message\nconst MAX_DATA_LENGTH = 1024 * 1024 * 4\n\nconst Empty = Buffer.alloc(0)\nconst ReadModes = { LENGTH: 'readLength', DATA: 'readData' }\n\nconst ReadHandlers = {\n  /**\n   * @param {BufferList} chunk\n   * @param {BufferList} buffer\n   * @param {import('./types').ReadState | undefined} state\n   * @param {import('./types').DecoderOptions} options\n   * @returns {import('./types').ReadResult}\n   */\n  [ReadModes.LENGTH]: (chunk, buffer, state, options) => {\n    // console.log(ReadModes.LENGTH, chunk.length)\n    buffer = buffer.append(chunk)\n\n    let dataLength\n    try {\n      dataLength = options.lengthDecoder(buffer)\n    } catch (err) {\n      if (buffer.length > options.maxLengthLength) {\n        throw Object.assign(err, { message: 'message length too long', code: 'ERR_MSG_LENGTH_TOO_LONG' })\n      }\n      if (err instanceof RangeError) {\n        return { mode: ReadModes.LENGTH, buffer, chunk: undefined, state: undefined, data: undefined }\n      }\n      throw err\n    }\n\n    if (dataLength > options.maxDataLength) {\n      throw Object.assign(new Error('message data too long'), { code: 'ERR_MSG_DATA_TOO_LONG' })\n    }\n\n    chunk = buffer.shallowSlice(options.lengthDecoder.bytes)\n    buffer = new BufferList()\n\n    if (options.onLength) options.onLength(dataLength)\n\n    if (dataLength <= 0) {\n      if (options.onData) options.onData(Empty)\n      return { mode: ReadModes.LENGTH, chunk, buffer, data: Empty }\n    }\n\n    return { mode: ReadModes.DATA, chunk, buffer, state: { dataLength }, data: undefined }\n  },\n\n  /**\n   * @param {BufferList} chunk\n   * @param {BufferList} buffer\n   * @param {import('./types').ReadState | undefined} state\n   * @param {import('./types').DecoderOptions} options\n   * @returns {import('./types').ReadResult}\n   */\n  [ReadModes.DATA]: (chunk, buffer, state, options) => {\n    // console.log(ReadModes.DATA, chunk.length)\n    buffer = buffer.append(chunk)\n\n    if (!state) {\n      throw new Error('state is required')\n    }\n\n    if (buffer.length < state.dataLength) {\n      return { mode: ReadModes.DATA, buffer, state, chunk: undefined, data: undefined }\n    }\n\n    const { dataLength } = state\n    const data = buffer.shallowSlice(0, dataLength)\n\n    const nextChunk = buffer.length > dataLength ? buffer.shallowSlice(dataLength) : undefined\n    buffer = new BufferList()\n\n    if (options.onData) options.onData(data)\n    return { mode: ReadModes.LENGTH, chunk: nextChunk, buffer, state: undefined, data }\n  }\n}\n\n/**\n * @param {any} [options]\n */\nfunction decode (options) {\n  options = options || {}\n\n  /**\n   * @type {import('./types').DecoderOptions}\n   */\n  const opts = {\n    lengthDecoder: options.lengthDecoder || varintDecode,\n    maxLengthLength: options.maxLengthLength || MAX_LENGTH_LENGTH,\n    maxDataLength: options.maxDataLength || MAX_DATA_LENGTH,\n    onLength: options.onLength,\n    onData: options.onData\n  }\n\n  /**\n   * @param {AsyncIterable<BufferList>} source\n   */\n  const decoder = async function * (source) {\n    let buffer = new BufferList()\n    let mode = ReadModes.LENGTH // current parsing mode\n    let state // accumulated state for the current mode\n\n    for await (const chunk of source) {\n      /** @type {BufferList | undefined} */\n      let nextChunk = chunk\n\n      // Each chunk may contain multiple messages - keep calling handler for the\n      // current parsing mode until all handlers have consumed the chunk.\n      while (nextChunk) {\n        const result = ReadHandlers[mode](nextChunk, buffer, state, opts)\n\n        mode = result.mode\n        nextChunk = result.chunk\n        buffer = result.buffer\n        state = result.state\n\n        if (result.data) {\n          yield result.data\n        }\n      }\n    }\n\n    if (buffer.length) {\n      throw Object.assign(new Error('unexpected end of input'), { code: 'ERR_UNEXPECTED_EOF' })\n    }\n  }\n\n  return decoder\n}\n\n/**\n * @param {*} reader\n * @param {import('./types').DecoderOptions} [options]\n * @returns\n */\ndecode.fromReader = (reader, options) => {\n  let byteLength = 1 // Read single byte chunks until the length is known\n\n  const varByteSource = {\n    [Symbol.asyncIterator] () { return this },\n    next: async () => {\n      try {\n        return await reader.next(byteLength)\n      } catch (err) {\n        if (err.code === 'ERR_UNDER_READ') {\n          return { done: true, value: null }\n        }\n        throw err\n      } finally {\n        // Reset the byteLength so we continue to check for varints\n        byteLength = 1\n      }\n    }\n  }\n\n  /**\n   * Once the length has been parsed, read chunk for that length\n   *\n   * @param {number} l\n   */\n  const onLength = l => { byteLength = l }\n  return decode({\n    ...(options || {}),\n    onLength\n  })(varByteSource)\n}\n\nmodule.exports = decode\nmodule.exports.MAX_LENGTH_LENGTH = MAX_LENGTH_LENGTH\nmodule.exports.MAX_DATA_LENGTH = MAX_DATA_LENGTH\n","'use strict'\n\n// @ts-ignore no types\nconst Varint = require('varint')\nconst { Buffer } = require('buffer')\n\n/**\n * @param {any} bl\n */\nconst toBufferProxy = bl => new Proxy({}, {\n  get: (_, prop) => {\n    // @ts-ignore magic\n    return prop[0] === 'l' ? bl[prop] : bl.get(parseInt(prop))\n  }\n})\n\n/**\n * @type {import('./types').LengthDecoderFunction}\n */\n// @ts-ignore cannot declare expected bytes property\nconst varintDecode = data => {\n  const len = Varint.decode(Buffer.isBuffer(data) ? data : toBufferProxy(data))\n  varintDecode.bytes = Varint.decode.bytes\n  return len\n}\n\nmodule.exports = varintDecode\n","'use strict'\n\nconst { Buffer } = require('buffer')\n\n/**\n * @param {number} value\n * @param {Buffer} target\n * @param {number} offset\n */\nconst int32BEEncode = (value, target, offset) => {\n  target = target || Buffer.allocUnsafe(4)\n  target.writeInt32BE(value, offset)\n  return target\n}\n\nint32BEEncode.bytes = 4 // Always because fixed length\n\nmodule.exports = int32BEEncode\n","'use strict'\n\n/**\n * @param {import('buffer').Buffer} data\n */\nconst int32BEDecode = data => {\n  if (data.length < 4) throw RangeError('Could not decode int32BE')\n  return data.readInt32BE(0)\n}\n\nint32BEDecode.bytes = 4 // Always because fixed length\n\nmodule.exports = int32BEDecode\n","const getIterator = require('get-iterator')\nconst AbortError = require('./AbortError')\n\n// Wrap an iterator to make it abortable, allow cleanup when aborted via onAbort\nconst toAbortableSource = (source, signal, options) => (\n  toMultiAbortableSource(source, Array.isArray(signal) ? signal : [{ signal, options }])\n)\n\nconst toMultiAbortableSource = (source, signals) => {\n  source = getIterator(source)\n  signals = signals.map(({ signal, options }) => ({ signal, options: options || {} }))\n\n  async function * abortable () {\n    let nextAbortHandler\n    const abortHandler = () => {\n      if (nextAbortHandler) nextAbortHandler()\n    }\n\n    for (const { signal } of signals) {\n      signal.addEventListener('abort', abortHandler)\n    }\n\n    while (true) {\n      let result\n      try {\n        for (const { signal, options } of signals) {\n          if (signal.aborted) {\n            const { abortMessage, abortCode } = options\n            throw new AbortError(abortMessage, abortCode)\n          }\n        }\n\n        const abort = new Promise((resolve, reject) => {\n          nextAbortHandler = () => {\n            const { options } = signals.find(({ signal }) => signal.aborted)\n            const { abortMessage, abortCode } = options\n            reject(new AbortError(abortMessage, abortCode))\n          }\n        })\n\n        // Race the iterator and the abort signals\n        result = await Promise.race([abort, source.next()])\n        nextAbortHandler = null\n      } catch (err) {\n        for (const { signal } of signals) {\n          signal.removeEventListener('abort', abortHandler)\n        }\n\n        // Might not have been aborted by a known signal\n        const aborter = signals.find(({ signal }) => signal.aborted)\n        const isKnownAborter = err.type === 'aborted' && aborter\n\n        if (isKnownAborter && aborter.options.onAbort) {\n          // Do any custom abort handling for the iterator\n          await aborter.options.onAbort(source)\n        }\n\n        // End the iterator if it is a generator\n        if (typeof source.return === 'function') {\n          await source.return()\n        }\n\n        if (isKnownAborter && aborter.options.returnOnAbort) {\n          return\n        }\n\n        throw err\n      }\n\n      if (result.done) break\n      yield result.value\n    }\n\n    for (const { signal } of signals) {\n      signal.removeEventListener('abort', abortHandler)\n    }\n  }\n\n  return abortable()\n}\n\nconst toAbortableSink = (sink, signal, options) => (\n  toMultiAbortableSink(sink, Array.isArray(signal) ? signal : [{ signal, options }])\n)\n\nconst toMultiAbortableSink = (sink, signals) => source => (\n  sink(toMultiAbortableSource(source, signals))\n)\n\nconst toAbortableDuplex = (duplex, signal, options) => (\n  toMultiAbortableDuplex(duplex, Array.isArray(signal) ? signal : [{ signal, options }])\n)\n\nconst toMultiAbortableDuplex = (duplex, signals) => ({\n  sink: toMultiAbortableSink(duplex.sink, signals),\n  source: toMultiAbortableSource(duplex.source, signals)\n})\n\nmodule.exports = toAbortableSource\nmodule.exports.AbortError = AbortError\nmodule.exports.source = toAbortableSource\nmodule.exports.sink = toAbortableSink\nmodule.exports.transform = toAbortableSink\nmodule.exports.duplex = toAbortableDuplex\n","// If the passed object is an (async) iterable, then get the iterator\n// If it's probably an iterator already (i.e. has next function) return it\n// else throw\nmodule.exports = function getIterator (obj) {\n  if (obj) {\n    if (typeof obj[Symbol.iterator] === 'function') {\n      return obj[Symbol.iterator]()\n    }\n    if (typeof obj[Symbol.asyncIterator] === 'function') {\n      return obj[Symbol.asyncIterator]()\n    }\n    if (typeof obj.next === 'function') {\n      return obj // probably an iterator\n    }\n  }\n  throw new Error('argument is not an iterator or iterable')\n}\n","module.exports = class AbortError extends Error {\n  constructor (message, code) {\n    super(message || 'The operation was aborted')\n    this.type = 'aborted'\n    this.code = code || 'ABORT_ERR'\n  }\n}\n","'use strict'\n\n/**\n * Enum for Signature Policy\n * Details how message signatures are produced/consumed\n */\nconst SignaturePolicy = {\n  /**\n   * On the producing side:\n   * * Build messages with the signature, key (from may be enough for certain inlineable public key types), from and seqno fields.\n   *\n   * On the consuming side:\n   * * Enforce the fields to be present, reject otherwise.\n   * * Propagate only if the fields are valid and signature can be verified, reject otherwise.\n   */\n  StrictSign: /** @type {'StrictSign'} */ ('StrictSign'),\n  /**\n   * On the producing side:\n   * * Build messages without the signature, key, from and seqno fields.\n   * * The corresponding protobuf key-value pairs are absent from the marshalled message, not just empty.\n   *\n   * On the consuming side:\n   * * Enforce the fields to be absent, reject otherwise.\n   * * Propagate only if the fields are absent, reject otherwise.\n   * * A message_id function will not be able to use the above fields, and should instead rely on the data field. A commonplace strategy is to calculate a hash.\n   */\n  StrictNoSign: /** @type {'StrictNoSign'} */ ('StrictNoSign')\n}\nexports.SignaturePolicy = SignaturePolicy\n\n/**\n * @typedef {SignaturePolicy[keyof SignaturePolicy]} SignaturePolicyType\n */\n","'use strict'\n\n// @ts-ignore libp2p crypto has no types\nconst randomBytes = require('libp2p-crypto/src/random-bytes')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst PeerId = require('peer-id')\nconst multihash = require('multihashes')\n\n/**\n * @typedef {import('./message/rpc').RPC.IMessage} IMessage\n * @typedef {import('./message/rpc').RPC.Message} Message\n * @typedef {import('.').InMessage} NormalizedIMessage\n */\n\n/**\n * Generatea random sequence number.\n *\n * @returns {Uint8Array}\n * @private\n */\nconst randomSeqno = () => {\n  return randomBytes(8)\n}\n\n/**\n * Generate a message id, based on the `from` and `seqno`.\n *\n * @param {string} from\n * @param {Uint8Array} seqno\n * @returns {Uint8Array}\n * @private\n */\nconst msgId = (from, seqno) => {\n  const fromBytes = PeerId.createFromB58String(from).id\n  const msgId = new Uint8Array(fromBytes.length + seqno.length)\n  msgId.set(fromBytes, 0)\n  msgId.set(seqno, fromBytes.length)\n  return msgId\n}\n\n/**\n * Generate a message id, based on message `data`.\n *\n * @param {Uint8Array} data\n * @returns {Uint8Array}\n * @private\n */\nconst noSignMsgId = (data) => multihash.encode(data, 'sha2-256')\n\n/**\n * Check if any member of the first set is also a member\n * of the second set.\n *\n * @param {Set<number>|Array<number>} a\n * @param {Set<number>|Array<number>} b\n * @returns {boolean}\n * @private\n */\nconst anyMatch = (a, b) => {\n  let bHas\n  if (Array.isArray(b)) {\n    /**\n     * @param {number} val\n     */\n    bHas = (val) => b.indexOf(val) > -1\n  } else {\n    /**\n     * @param {number} val\n     */\n    bHas = (val) => b.has(val)\n  }\n\n  for (const val of a) {\n    if (bHas(val)) {\n      return true\n    }\n  }\n\n  return false\n}\n\n/**\n * Make everything an array.\n *\n * @template T\n * @param {T|T[]} maybeArray\n * @returns {T[]}\n * @private\n */\nconst ensureArray = (maybeArray) => {\n  if (!Array.isArray(maybeArray)) {\n    return [maybeArray]\n  }\n\n  return maybeArray\n}\n\n/**\n * Ensures `message.from` is base58 encoded\n *\n * @template {{from?:any}} T\n * @param {T & IMessage} message\n * @param {string} [peerId]\n * @returns {NormalizedIMessage}\n */\nconst normalizeInRpcMessage = (message, peerId) => {\n  /** @type {NormalizedIMessage} */\n  // @ts-ignore receivedFrom not yet defined\n  const m = Object.assign({}, message)\n  if (message.from instanceof Uint8Array) {\n    m.from = uint8ArrayToString(message.from, 'base58btc')\n  }\n  if (peerId) {\n    m.receivedFrom = peerId\n  }\n  return m\n}\n\n/**\n * @template {{from?:any, data?:any}} T\n *\n * @param {T & NormalizedIMessage} message\n * @returns {Message}\n */\nconst normalizeOutRpcMessage = (message) => {\n  /** @type {Message} */\n  // @ts-ignore from not yet defined\n  const m = Object.assign({}, message)\n  if (typeof message.from === 'string') {\n    m.from = uint8ArrayFromString(message.from, 'base58btc')\n  }\n  if (typeof message.data === 'string') {\n    m.data = uint8ArrayFromString(message.data)\n  }\n  return m\n}\n\nmodule.exports = {\n  randomSeqno,\n  msgId,\n  noSignMsgId,\n  anyMatch,\n  ensureArray,\n  normalizeInRpcMessage,\n  normalizeOutRpcMessage\n}\n","'use strict'\n\nconst PeerId = require('peer-id')\nconst { RPC } = require('./rpc')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst SignPrefix = uint8ArrayFromString('libp2p-pubsub:')\n\n/**\n * @typedef {import('..').InMessage}\n */\n\n/**\n * Signs the provided message with the given `peerId`\n *\n * @param {PeerId} peerId\n * @param {RPC.Message} message\n * @returns {Promise<any>}\n */\nasync function signMessage (peerId, message) {\n  // Get the message in bytes, and prepend with the pubsub prefix\n  const bytes = uint8ArrayConcat([\n    SignPrefix,\n    RPC.Message.encode(message).finish()\n  ])\n\n  const signature = await peerId.privKey.sign(bytes)\n\n  return {\n    ...message,\n    signature: signature,\n    key: peerId.pubKey.bytes\n  }\n}\n\n/**\n * Verifies the signature of the given message\n *\n * @param {InMessage} message\n * @returns {Promise<boolean>}\n */\nasync function verifySignature (message) {\n  if (!message.signature) {\n    throw new Error('Message must contain a signature to be verified')\n  }\n\n  // Get message sans the signature\n  const bytes = uint8ArrayConcat([\n    SignPrefix,\n    RPC.Message.encode({\n      ...message,\n      // @ts-ignore message.from needs to exist\n      from: PeerId.createFromCID(message.from).toBytes(),\n      signature: undefined,\n      key: undefined\n    }).finish()\n  ])\n\n  // Get the public key\n  const pubKey = await messagePublicKey(message)\n\n  // verify the base message\n  return pubKey.verify(bytes, message.signature)\n}\n\n/**\n * Returns the PublicKey associated with the given message.\n * If no, valid PublicKey can be retrieved an error will be returned.\n *\n * @param {InMessage} message\n * @returns {Promise<PublicKey>}\n */\nasync function messagePublicKey (message) {\n  // should be available in the from property of the message (peer id)\n  if (!message.from) {\n    throw new Error('Could not get the public key from the originator id')\n  }\n\n  const from = PeerId.createFromCID(message.from)\n\n  if (message.key) {\n    const keyPeerId = await PeerId.createFromPubKey(message.key)\n\n    // the key belongs to the sender, return the key\n    if (keyPeerId.equals(from)) return keyPeerId.pubKey\n    // We couldn't validate pubkey is from the originator, error\n    throw new Error('Public Key does not match the originator')\n  } else if (from.pubKey) {\n    return from.pubKey\n  } else {\n    throw new Error('Could not get the public key from the originator id')\n  }\n}\n\n/**\n * @typedef {import('..').InMessage} InMessage\n * @typedef {import('libp2p-crypto').PublicKey} PublicKey\n */\n\nmodule.exports = {\n  messagePublicKey,\n  signMessage,\n  SignPrefix,\n  verifySignature\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MessageCache = void 0;\nconst utils_1 = require(\"./utils\");\nclass MessageCache {\n    /**\n     * @param {Number} gossip\n     * @param {Number} history\n     * @param {msgIdFn} msgIdFn a function that returns message id from a message\n     *\n     * @constructor\n     */\n    constructor(gossip, history, msgIdFn) {\n        /**\n         * @type {Map<string, RPC.Message>}\n         */\n        this.msgs = new Map();\n        this.peertx = new Map();\n        /**\n         * @type {Array<Array<CacheEntry>>}\n         */\n        this.history = [];\n        for (let i = 0; i < history; i++) {\n            this.history[i] = [];\n        }\n        /**\n         * @type {Number}\n         */\n        this.gossip = gossip;\n        /**\n         * @type {Function}\n         */\n        this.msgIdFn = msgIdFn;\n    }\n    /**\n     * Adds a message to the current window and the cache\n     *\n     * @param {RPC.Message} msg\n     * @returns {void}\n     */\n    put(msg) {\n        const msgID = this.getMsgId(msg);\n        const msgIdStr = utils_1.messageIdToString(msgID);\n        this.msgs.set(msgIdStr, msg);\n        this.history[0].push({ msgID, topics: msg.topicIDs });\n    }\n    /**\n     * Get message id of message.\n     * @param {RPC.Message} msg\n     * @returns {Uint8Array}\n     */\n    getMsgId(msg) {\n        return this.msgIdFn(msg);\n    }\n    /**\n     * Retrieves a message from the cache by its ID, if it is still present\n     *\n     * @param {Uint8Array} msgID\n     * @returns {Message}\n     */\n    get(msgID) {\n        return this.msgs.get(utils_1.messageIdToString(msgID));\n    }\n    /**\n     * Retrieves a message from the cache by its ID, if it is present\n     * for a specific peer.\n     * Returns the message and the number of times the peer has requested the message\n     *\n     * @param {string} msgID\n     * @param {string} p\n     * @returns {[InMessage | undefined, number]}\n     */\n    getForPeer(msgID, p) {\n        const msgIdStr = utils_1.messageIdToString(msgID);\n        const msg = this.msgs.get(msgIdStr);\n        if (!msg) {\n            return [undefined, 0];\n        }\n        let peertx = this.peertx.get(msgIdStr);\n        if (!peertx) {\n            peertx = new Map();\n            this.peertx.set(msgIdStr, peertx);\n        }\n        const count = (peertx.get(p) || 0) + 1;\n        peertx.set(p, count);\n        return [msg, count];\n    }\n    /**\n     * Retrieves a list of message IDs for a given topic\n     *\n     * @param {String} topic\n     *\n     * @returns {Array<Uint8Array>}\n     */\n    getGossipIDs(topic) {\n        const msgIDs = [];\n        for (let i = 0; i < this.gossip; i++) {\n            this.history[i].forEach((entry) => {\n                for (const t of entry.topics) {\n                    if (t === topic) {\n                        msgIDs.push(entry.msgID);\n                        break;\n                    }\n                }\n            });\n        }\n        return msgIDs;\n    }\n    /**\n     * Shifts the current window, discarding messages older than this.history.length of the cache\n     *\n     * @returns {void}\n     */\n    shift() {\n        const last = this.history[this.history.length - 1];\n        last.forEach((entry) => {\n            const msgIdStr = utils_1.messageIdToString(entry.msgID);\n            this.msgs.delete(msgIdStr);\n            this.peertx.delete(msgIdStr);\n        });\n        this.history.pop();\n        this.history.unshift([]);\n    }\n}\nexports.MessageCache = MessageCache;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __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(\"./create-gossip-rpc\"), exports);\n__exportStar(require(\"./shuffle\"), exports);\n__exportStar(require(\"./has-gossip-protocol\"), exports);\n__exportStar(require(\"./messageIdToString\"), exports);\n","'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.createGossipRpc = void 0;\n/**\n * Create a gossipsub RPC object\n * @param {Array<RPC.IMessage>} msgs\n * @param {Partial<RPC.IControlMessage>} control\n * @returns {IRPC}\n */\nfunction createGossipRpc(msgs = [], control = {}) {\n    return {\n        subscriptions: [],\n        msgs: msgs,\n        control: Object.assign({ ihave: [], iwant: [], graft: [], prune: [] }, control)\n    };\n}\nexports.createGossipRpc = createGossipRpc;\n","'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.shuffle = void 0;\n/**\n * Pseudo-randomly shuffles an array\n *\n * Mutates the input array\n *\n * @param {Array} arr\n * @returns {Array}\n */\nfunction shuffle(arr) {\n    if (arr.length <= 1) {\n        return arr;\n    }\n    const randInt = () => {\n        return Math.floor(Math.random() * Math.floor(arr.length));\n    };\n    for (let i = 0; i < arr.length; i++) {\n        const j = randInt();\n        const tmp = arr[i];\n        arr[i] = arr[j];\n        arr[j] = tmp;\n    }\n    return arr;\n}\nexports.shuffle = shuffle;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.hasGossipProtocol = void 0;\nconst constants_1 = require(\"../constants\");\nfunction hasGossipProtocol(protocol) {\n    return (protocol === constants_1.GossipsubIDv10 || protocol === constants_1.GossipsubIDv11);\n}\nexports.hasGossipProtocol = hasGossipProtocol;\n","'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ERR_TOPIC_VALIDATOR_IGNORE = exports.ERR_TOPIC_VALIDATOR_REJECT = exports.TimeCacheDuration = exports.GossipsubIWantFollowupTime = exports.GossipsubMaxIHaveMessages = exports.GossipsubMaxIHaveLength = exports.GossipsubGraftFloodThreshold = exports.GossipsubOpportunisticGraftPeers = exports.GossipsubOpportunisticGraftTicks = exports.GossipsubDirectConnectInitialDelay = exports.GossipsubDirectConnectTicks = exports.GossipsubConnectionTimeout = exports.GossipsubMaxPendingConnections = exports.GossipsubConnectors = exports.GossipsubPruneBackoffTicks = exports.GossipsubPruneBackoff = exports.GossipsubPrunePeers = exports.GossipsubFanoutTTL = exports.GossipsubHeartbeatInterval = exports.GossipsubHeartbeatInitialDelay = exports.GossipsubGossipRetransmission = exports.GossipsubGossipFactor = exports.GossipsubDlazy = exports.GossipsubHistoryGossip = exports.GossipsubHistoryLength = exports.GossipsubDout = exports.GossipsubDscore = exports.GossipsubDhi = exports.GossipsubDlo = exports.GossipsubD = exports.GossipsubIDv11 = exports.GossipsubIDv10 = exports.FloodsubID = exports.minute = exports.second = void 0;\nexports.second = 1000;\nexports.minute = 60 * exports.second;\n// Protocol identifiers\nexports.FloodsubID = '/floodsub/1.0.0';\n/**\n * The protocol ID for version 1.0.0 of the Gossipsub protocol\n * It is advertised along with GossipsubIDv11 for backwards compatability\n */\nexports.GossipsubIDv10 = '/meshsub/1.0.0';\n/**\n * The protocol ID for version 1.1.0 of the Gossipsub protocol\n * See the spec for details about how v1.1.0 compares to v1.0.0:\n * https://github.com/libp2p/specs/blob/master/pubsub/gossipsub/gossipsub-v1.1.md\n */\nexports.GossipsubIDv11 = '/meshsub/1.1.0';\n// Overlay parameters\n/**\n * GossipsubD sets the optimal degree for a Gossipsub topic mesh. For example, if GossipsubD == 6,\n * each peer will want to have about six peers in their mesh for each topic they're subscribed to.\n * GossipsubD should be set somewhere between GossipsubDlo and GossipsubDhi.\n */\nexports.GossipsubD = 6;\n/**\n * GossipsubDlo sets the lower bound on the number of peers we keep in a Gossipsub topic mesh.\n * If we have fewer than GossipsubDlo peers, we will attempt to graft some more into the mesh at\n * the next heartbeat.\n */\nexports.GossipsubDlo = 4;\n/**\n * GossipsubDhi sets the upper bound on the number of peers we keep in a Gossipsub topic mesh.\n * If we have more than GossipsubDhi peers, we will select some to prune from the mesh at the next heartbeat.\n */\nexports.GossipsubDhi = 12;\n/**\n * GossipsubDscore affects how peers are selected when pruning a mesh due to over subscription.\n * At least GossipsubDscore of the retained peers will be high-scoring, while the remainder are\n * chosen randomly.\n */\nexports.GossipsubDscore = 4;\n/**\n * GossipsubDout sets the quota for the number of outbound connections to maintain in a topic mesh.\n * When the mesh is pruned due to over subscription, we make sure that we have outbound connections\n * to at least GossipsubDout of the survivor peers. This prevents sybil attackers from overwhelming\n * our mesh with incoming connections.\n *\n * GossipsubDout must be set below GossipsubDlo, and must not exceed GossipsubD / 2.\n */\nexports.GossipsubDout = 2;\n// Gossip parameters\n/**\n * GossipsubHistoryLength controls the size of the message cache used for gossip.\n * The message cache will remember messages for GossipsubHistoryLength heartbeats.\n */\nexports.GossipsubHistoryLength = 5;\n/**\n * GossipsubHistoryGossip controls how many cached message ids we will advertise in\n * IHAVE gossip messages. When asked for our seen message IDs, we will return\n * only those from the most recent GossipsubHistoryGossip heartbeats. The slack between\n * GossipsubHistoryGossip and GossipsubHistoryLength allows us to avoid advertising messages\n * that will be expired by the time they're requested.\n *\n * GossipsubHistoryGossip must be less than or equal to GossipsubHistoryLength to\n * avoid a runtime panic.\n */\nexports.GossipsubHistoryGossip = 3;\n/**\n * GossipsubDlazy affects how many peers we will emit gossip to at each heartbeat.\n * We will send gossip to at least GossipsubDlazy peers outside our mesh. The actual\n * number may be more, depending on GossipsubGossipFactor and how many peers we're\n * connected to.\n */\nexports.GossipsubDlazy = 6;\n/**\n * GossipsubGossipFactor affects how many peers we will emit gossip to at each heartbeat.\n * We will send gossip to GossipsubGossipFactor * (total number of non-mesh peers), or\n * GossipsubDlazy, whichever is greater.\n */\nexports.GossipsubGossipFactor = 0.25;\n/**\n * GossipsubGossipRetransmission controls how many times we will allow a peer to request\n * the same message id through IWANT gossip before we start ignoring them. This is designed\n * to prevent peers from spamming us with requests and wasting our resources.\n */\nexports.GossipsubGossipRetransmission = 3;\n// Heartbeat interval\n/**\n * GossipsubHeartbeatInitialDelay is the short delay before the heartbeat timer begins\n * after the router is initialized.\n */\nexports.GossipsubHeartbeatInitialDelay = 100;\n/**\n * GossipsubHeartbeatInterval controls the time between heartbeats.\n */\nexports.GossipsubHeartbeatInterval = exports.second;\n/**\n * GossipsubFanoutTTL controls how long we keep track of the fanout state. If it's been\n * GossipsubFanoutTTL since we've published to a topic that we're not subscribed to,\n * we'll delete the fanout map for that topic.\n */\nexports.GossipsubFanoutTTL = exports.minute;\n/**\n * GossipsubPrunePeers controls the number of peers to include in prune Peer eXchange.\n * When we prune a peer that's eligible for PX (has a good score, etc), we will try to\n * send them signed peer records for up to GossipsubPrunePeers other peers that we\n * know of.\n */\nexports.GossipsubPrunePeers = 16;\n/**\n * GossipsubPruneBackoff controls the backoff time for pruned peers. This is how long\n * a peer must wait before attempting to graft into our mesh again after being pruned.\n * When pruning a peer, we send them our value of GossipsubPruneBackoff so they know\n * the minimum time to wait. Peers running older versions may not send a backoff time,\n * so if we receive a prune message without one, we will wait at least GossipsubPruneBackoff\n * before attempting to re-graft.\n */\nexports.GossipsubPruneBackoff = exports.minute;\n/**\n * GossipsubPruneBackoffTicks is the number of heartbeat ticks for attempting to prune expired\n * backoff timers.\n */\nexports.GossipsubPruneBackoffTicks = 15;\n/**\n * GossipsubConnectors controls the number of active connection attempts for peers obtained through PX.\n */\nexports.GossipsubConnectors = 8;\n/**\n * GossipsubMaxPendingConnections sets the maximum number of pending connections for peers attempted through px.\n */\nexports.GossipsubMaxPendingConnections = 128;\n/**\n * GossipsubConnectionTimeout controls the timeout for connection attempts.\n */\nexports.GossipsubConnectionTimeout = 30 * exports.second;\n/**\n * GossipsubDirectConnectTicks is the number of heartbeat ticks for attempting to reconnect direct peers\n * that are not currently connected.\n */\nexports.GossipsubDirectConnectTicks = 300;\n/**\n * GossipsubDirectConnectInitialDelay is the initial delay before opening connections to direct peers\n */\nexports.GossipsubDirectConnectInitialDelay = exports.second;\n/**\n * GossipsubOpportunisticGraftTicks is the number of heartbeat ticks for attempting to improve the mesh\n * with opportunistic grafting. Every GossipsubOpportunisticGraftTicks we will attempt to select some\n * high-scoring mesh peers to replace lower-scoring ones, if the median score of our mesh peers falls\n * below a threshold\n */\nexports.GossipsubOpportunisticGraftTicks = 60;\n/**\n * GossipsubOpportunisticGraftPeers is the number of peers to opportunistically graft.\n */\nexports.GossipsubOpportunisticGraftPeers = 2;\n/**\n * If a GRAFT comes before GossipsubGraftFloodThreshold has elapsed since the last PRUNE,\n * then there is an extra score penalty applied to the peer through P7.\n */\nexports.GossipsubGraftFloodThreshold = 10 * exports.second;\n/**\n * GossipsubMaxIHaveLength is the maximum number of messages to include in an IHAVE message.\n * Also controls the maximum number of IHAVE ids we will accept and request with IWANT from a\n * peer within a heartbeat, to protect from IHAVE floods. You should adjust this value from the\n * default if your system is pushing more than 5000 messages in GossipsubHistoryGossip heartbeats;\n * with the defaults this is 1666 messages/s.\n */\nexports.GossipsubMaxIHaveLength = 5000;\n/**\n * GossipsubMaxIHaveMessages is the maximum number of IHAVE messages to accept from a peer within a heartbeat.\n */\nexports.GossipsubMaxIHaveMessages = 10;\n/**\n * Time to wait for a message requested through IWANT following an IHAVE advertisement.\n * If the message is not received within this window, a broken promise is declared and\n * the router may apply bahavioural penalties.\n */\nexports.GossipsubIWantFollowupTime = 3 * exports.second;\nexports.TimeCacheDuration = 120 * 1000;\nexports.ERR_TOPIC_VALIDATOR_REJECT = 'ERR_TOPIC_VALIDATOR_REJECT';\nexports.ERR_TOPIC_VALIDATOR_IGNORE = 'ERR_TOPIC_VALIDATOR_IGNORE';\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.messageIdToString = void 0;\n// remove ts-ignore once https://github.com/achingbrain/uint8arrays/pull/4 is merged\n// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n// @ts-ignore\nconst toString = require(\"uint8arrays/to-string\");\nfunction messageIdToString(msgId) {\n    return toString(msgId, 'base64');\n}\nexports.messageIdToString = messageIdToString;\n","/*eslint-disable*/\n(function(global, factory) { /* global define, require, module */\n\n    /* AMD */ if (typeof define === 'function' && define.amd)\n        define([\"protobufjs/minimal\"], factory);\n\n    /* CommonJS */ else if (typeof require === 'function' && typeof module === 'object' && module && module.exports)\n        module.exports = factory(require(\"protobufjs/minimal\"));\n\n})(this, function($protobuf) {\n    \"use strict\";\n\n    // Common aliases\n    var $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n    \n    // Exported root namespace\n    var $root = $protobuf.roots[\"default\"] || ($protobuf.roots[\"default\"] = {});\n    \n    $root.RPC = (function() {\n    \n        /**\n         * Properties of a RPC.\n         * @exports IRPC\n         * @interface IRPC\n         * @property {Array.<RPC.ISubOpts>|null} [subscriptions] RPC subscriptions\n         * @property {Array.<RPC.IMessage>|null} [msgs] RPC msgs\n         * @property {RPC.IControlMessage|null} [control] RPC control\n         */\n    \n        /**\n         * Constructs a new RPC.\n         * @exports RPC\n         * @classdesc Represents a RPC.\n         * @implements IRPC\n         * @constructor\n         * @param {IRPC=} [p] Properties to set\n         */\n        function RPC(p) {\n            this.subscriptions = [];\n            this.msgs = [];\n            if (p)\n                for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                    if (p[ks[i]] != null)\n                        this[ks[i]] = p[ks[i]];\n        }\n    \n        /**\n         * RPC subscriptions.\n         * @member {Array.<RPC.ISubOpts>} subscriptions\n         * @memberof RPC\n         * @instance\n         */\n        RPC.prototype.subscriptions = $util.emptyArray;\n    \n        /**\n         * RPC msgs.\n         * @member {Array.<RPC.IMessage>} msgs\n         * @memberof RPC\n         * @instance\n         */\n        RPC.prototype.msgs = $util.emptyArray;\n    \n        /**\n         * RPC control.\n         * @member {RPC.IControlMessage|null|undefined} control\n         * @memberof RPC\n         * @instance\n         */\n        RPC.prototype.control = null;\n    \n        // OneOf field names bound to virtual getters and setters\n        var $oneOfFields;\n    \n        /**\n         * RPC _control.\n         * @member {\"control\"|undefined} _control\n         * @memberof RPC\n         * @instance\n         */\n        Object.defineProperty(RPC.prototype, \"_control\", {\n            get: $util.oneOfGetter($oneOfFields = [\"control\"]),\n            set: $util.oneOfSetter($oneOfFields)\n        });\n    \n        /**\n         * Encodes the specified RPC message. Does not implicitly {@link RPC.verify|verify} messages.\n         * @function encode\n         * @memberof RPC\n         * @static\n         * @param {IRPC} m RPC message or plain object to encode\n         * @param {$protobuf.Writer} [w] Writer to encode to\n         * @returns {$protobuf.Writer} Writer\n         */\n        RPC.encode = function encode(m, w) {\n            if (!w)\n                w = $Writer.create();\n            if (m.subscriptions != null && m.subscriptions.length) {\n                for (var i = 0; i < m.subscriptions.length; ++i)\n                    $root.RPC.SubOpts.encode(m.subscriptions[i], w.uint32(10).fork()).ldelim();\n            }\n            if (m.msgs != null && m.msgs.length) {\n                for (var i = 0; i < m.msgs.length; ++i)\n                    $root.RPC.Message.encode(m.msgs[i], w.uint32(18).fork()).ldelim();\n            }\n            if (m.control != null && Object.hasOwnProperty.call(m, \"control\"))\n                $root.RPC.ControlMessage.encode(m.control, w.uint32(26).fork()).ldelim();\n            return w;\n        };\n    \n        /**\n         * Decodes a RPC message from the specified reader or buffer.\n         * @function decode\n         * @memberof RPC\n         * @static\n         * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n         * @param {number} [l] Message length if known beforehand\n         * @returns {RPC} RPC\n         * @throws {Error} If the payload is not a reader or valid buffer\n         * @throws {$protobuf.util.ProtocolError} If required fields are missing\n         */\n        RPC.decode = function decode(r, l) {\n            if (!(r instanceof $Reader))\n                r = $Reader.create(r);\n            var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC();\n            while (r.pos < c) {\n                var t = r.uint32();\n                switch (t >>> 3) {\n                case 1:\n                    if (!(m.subscriptions && m.subscriptions.length))\n                        m.subscriptions = [];\n                    m.subscriptions.push($root.RPC.SubOpts.decode(r, r.uint32()));\n                    break;\n                case 2:\n                    if (!(m.msgs && m.msgs.length))\n                        m.msgs = [];\n                    m.msgs.push($root.RPC.Message.decode(r, r.uint32()));\n                    break;\n                case 3:\n                    m.control = $root.RPC.ControlMessage.decode(r, r.uint32());\n                    break;\n                default:\n                    r.skipType(t & 7);\n                    break;\n                }\n            }\n            return m;\n        };\n    \n        /**\n         * Creates a RPC message from a plain object. Also converts values to their respective internal types.\n         * @function fromObject\n         * @memberof RPC\n         * @static\n         * @param {Object.<string,*>} d Plain object\n         * @returns {RPC} RPC\n         */\n        RPC.fromObject = function fromObject(d) {\n            if (d instanceof $root.RPC)\n                return d;\n            var m = new $root.RPC();\n            if (d.subscriptions) {\n                if (!Array.isArray(d.subscriptions))\n                    throw TypeError(\".RPC.subscriptions: array expected\");\n                m.subscriptions = [];\n                for (var i = 0; i < d.subscriptions.length; ++i) {\n                    if (typeof d.subscriptions[i] !== \"object\")\n                        throw TypeError(\".RPC.subscriptions: object expected\");\n                    m.subscriptions[i] = $root.RPC.SubOpts.fromObject(d.subscriptions[i]);\n                }\n            }\n            if (d.msgs) {\n                if (!Array.isArray(d.msgs))\n                    throw TypeError(\".RPC.msgs: array expected\");\n                m.msgs = [];\n                for (var i = 0; i < d.msgs.length; ++i) {\n                    if (typeof d.msgs[i] !== \"object\")\n                        throw TypeError(\".RPC.msgs: object expected\");\n                    m.msgs[i] = $root.RPC.Message.fromObject(d.msgs[i]);\n                }\n            }\n            if (d.control != null) {\n                if (typeof d.control !== \"object\")\n                    throw TypeError(\".RPC.control: object expected\");\n                m.control = $root.RPC.ControlMessage.fromObject(d.control);\n            }\n            return m;\n        };\n    \n        /**\n         * Creates a plain object from a RPC message. Also converts values to other types if specified.\n         * @function toObject\n         * @memberof RPC\n         * @static\n         * @param {RPC} m RPC\n         * @param {$protobuf.IConversionOptions} [o] Conversion options\n         * @returns {Object.<string,*>} Plain object\n         */\n        RPC.toObject = function toObject(m, o) {\n            if (!o)\n                o = {};\n            var d = {};\n            if (o.arrays || o.defaults) {\n                d.subscriptions = [];\n                d.msgs = [];\n            }\n            if (m.subscriptions && m.subscriptions.length) {\n                d.subscriptions = [];\n                for (var j = 0; j < m.subscriptions.length; ++j) {\n                    d.subscriptions[j] = $root.RPC.SubOpts.toObject(m.subscriptions[j], o);\n                }\n            }\n            if (m.msgs && m.msgs.length) {\n                d.msgs = [];\n                for (var j = 0; j < m.msgs.length; ++j) {\n                    d.msgs[j] = $root.RPC.Message.toObject(m.msgs[j], o);\n                }\n            }\n            if (m.control != null && m.hasOwnProperty(\"control\")) {\n                d.control = $root.RPC.ControlMessage.toObject(m.control, o);\n                if (o.oneofs)\n                    d._control = \"control\";\n            }\n            return d;\n        };\n    \n        /**\n         * Converts this RPC to JSON.\n         * @function toJSON\n         * @memberof RPC\n         * @instance\n         * @returns {Object.<string,*>} JSON object\n         */\n        RPC.prototype.toJSON = function toJSON() {\n            return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n        };\n    \n        RPC.SubOpts = (function() {\n    \n            /**\n             * Properties of a SubOpts.\n             * @memberof RPC\n             * @interface ISubOpts\n             * @property {boolean|null} [subscribe] SubOpts subscribe\n             * @property {string|null} [topicID] SubOpts topicID\n             */\n    \n            /**\n             * Constructs a new SubOpts.\n             * @memberof RPC\n             * @classdesc Represents a SubOpts.\n             * @implements ISubOpts\n             * @constructor\n             * @param {RPC.ISubOpts=} [p] Properties to set\n             */\n            function SubOpts(p) {\n                if (p)\n                    for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                        if (p[ks[i]] != null)\n                            this[ks[i]] = p[ks[i]];\n            }\n    \n            /**\n             * SubOpts subscribe.\n             * @member {boolean|null|undefined} subscribe\n             * @memberof RPC.SubOpts\n             * @instance\n             */\n            SubOpts.prototype.subscribe = null;\n    \n            /**\n             * SubOpts topicID.\n             * @member {string|null|undefined} topicID\n             * @memberof RPC.SubOpts\n             * @instance\n             */\n            SubOpts.prototype.topicID = null;\n    \n            // OneOf field names bound to virtual getters and setters\n            var $oneOfFields;\n    \n            /**\n             * SubOpts _subscribe.\n             * @member {\"subscribe\"|undefined} _subscribe\n             * @memberof RPC.SubOpts\n             * @instance\n             */\n            Object.defineProperty(SubOpts.prototype, \"_subscribe\", {\n                get: $util.oneOfGetter($oneOfFields = [\"subscribe\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * SubOpts _topicID.\n             * @member {\"topicID\"|undefined} _topicID\n             * @memberof RPC.SubOpts\n             * @instance\n             */\n            Object.defineProperty(SubOpts.prototype, \"_topicID\", {\n                get: $util.oneOfGetter($oneOfFields = [\"topicID\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * Encodes the specified SubOpts message. Does not implicitly {@link RPC.SubOpts.verify|verify} messages.\n             * @function encode\n             * @memberof RPC.SubOpts\n             * @static\n             * @param {RPC.ISubOpts} m SubOpts message or plain object to encode\n             * @param {$protobuf.Writer} [w] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            SubOpts.encode = function encode(m, w) {\n                if (!w)\n                    w = $Writer.create();\n                if (m.subscribe != null && Object.hasOwnProperty.call(m, \"subscribe\"))\n                    w.uint32(8).bool(m.subscribe);\n                if (m.topicID != null && Object.hasOwnProperty.call(m, \"topicID\"))\n                    w.uint32(18).string(m.topicID);\n                return w;\n            };\n    \n            /**\n             * Decodes a SubOpts message from the specified reader or buffer.\n             * @function decode\n             * @memberof RPC.SubOpts\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n             * @param {number} [l] Message length if known beforehand\n             * @returns {RPC.SubOpts} SubOpts\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            SubOpts.decode = function decode(r, l) {\n                if (!(r instanceof $Reader))\n                    r = $Reader.create(r);\n                var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC.SubOpts();\n                while (r.pos < c) {\n                    var t = r.uint32();\n                    switch (t >>> 3) {\n                    case 1:\n                        m.subscribe = r.bool();\n                        break;\n                    case 2:\n                        m.topicID = r.string();\n                        break;\n                    default:\n                        r.skipType(t & 7);\n                        break;\n                    }\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a SubOpts message from a plain object. Also converts values to their respective internal types.\n             * @function fromObject\n             * @memberof RPC.SubOpts\n             * @static\n             * @param {Object.<string,*>} d Plain object\n             * @returns {RPC.SubOpts} SubOpts\n             */\n            SubOpts.fromObject = function fromObject(d) {\n                if (d instanceof $root.RPC.SubOpts)\n                    return d;\n                var m = new $root.RPC.SubOpts();\n                if (d.subscribe != null) {\n                    m.subscribe = Boolean(d.subscribe);\n                }\n                if (d.topicID != null) {\n                    m.topicID = String(d.topicID);\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a plain object from a SubOpts message. Also converts values to other types if specified.\n             * @function toObject\n             * @memberof RPC.SubOpts\n             * @static\n             * @param {RPC.SubOpts} m SubOpts\n             * @param {$protobuf.IConversionOptions} [o] Conversion options\n             * @returns {Object.<string,*>} Plain object\n             */\n            SubOpts.toObject = function toObject(m, o) {\n                if (!o)\n                    o = {};\n                var d = {};\n                if (m.subscribe != null && m.hasOwnProperty(\"subscribe\")) {\n                    d.subscribe = m.subscribe;\n                    if (o.oneofs)\n                        d._subscribe = \"subscribe\";\n                }\n                if (m.topicID != null && m.hasOwnProperty(\"topicID\")) {\n                    d.topicID = m.topicID;\n                    if (o.oneofs)\n                        d._topicID = \"topicID\";\n                }\n                return d;\n            };\n    \n            /**\n             * Converts this SubOpts to JSON.\n             * @function toJSON\n             * @memberof RPC.SubOpts\n             * @instance\n             * @returns {Object.<string,*>} JSON object\n             */\n            SubOpts.prototype.toJSON = function toJSON() {\n                return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n            };\n    \n            return SubOpts;\n        })();\n    \n        RPC.Message = (function() {\n    \n            /**\n             * Properties of a Message.\n             * @memberof RPC\n             * @interface IMessage\n             * @property {Uint8Array|null} [from] Message from\n             * @property {Uint8Array|null} [data] Message data\n             * @property {Uint8Array|null} [seqno] Message seqno\n             * @property {Array.<string>|null} [topicIDs] Message topicIDs\n             * @property {Uint8Array|null} [signature] Message signature\n             * @property {Uint8Array|null} [key] Message key\n             */\n    \n            /**\n             * Constructs a new Message.\n             * @memberof RPC\n             * @classdesc Represents a Message.\n             * @implements IMessage\n             * @constructor\n             * @param {RPC.IMessage=} [p] Properties to set\n             */\n            function Message(p) {\n                this.topicIDs = [];\n                if (p)\n                    for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                        if (p[ks[i]] != null)\n                            this[ks[i]] = p[ks[i]];\n            }\n    \n            /**\n             * Message from.\n             * @member {Uint8Array|null|undefined} from\n             * @memberof RPC.Message\n             * @instance\n             */\n            Message.prototype.from = null;\n    \n            /**\n             * Message data.\n             * @member {Uint8Array|null|undefined} data\n             * @memberof RPC.Message\n             * @instance\n             */\n            Message.prototype.data = null;\n    \n            /**\n             * Message seqno.\n             * @member {Uint8Array|null|undefined} seqno\n             * @memberof RPC.Message\n             * @instance\n             */\n            Message.prototype.seqno = null;\n    \n            /**\n             * Message topicIDs.\n             * @member {Array.<string>} topicIDs\n             * @memberof RPC.Message\n             * @instance\n             */\n            Message.prototype.topicIDs = $util.emptyArray;\n    \n            /**\n             * Message signature.\n             * @member {Uint8Array|null|undefined} signature\n             * @memberof RPC.Message\n             * @instance\n             */\n            Message.prototype.signature = null;\n    \n            /**\n             * Message key.\n             * @member {Uint8Array|null|undefined} key\n             * @memberof RPC.Message\n             * @instance\n             */\n            Message.prototype.key = null;\n    \n            // OneOf field names bound to virtual getters and setters\n            var $oneOfFields;\n    \n            /**\n             * Message _from.\n             * @member {\"from\"|undefined} _from\n             * @memberof RPC.Message\n             * @instance\n             */\n            Object.defineProperty(Message.prototype, \"_from\", {\n                get: $util.oneOfGetter($oneOfFields = [\"from\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * Message _data.\n             * @member {\"data\"|undefined} _data\n             * @memberof RPC.Message\n             * @instance\n             */\n            Object.defineProperty(Message.prototype, \"_data\", {\n                get: $util.oneOfGetter($oneOfFields = [\"data\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * Message _seqno.\n             * @member {\"seqno\"|undefined} _seqno\n             * @memberof RPC.Message\n             * @instance\n             */\n            Object.defineProperty(Message.prototype, \"_seqno\", {\n                get: $util.oneOfGetter($oneOfFields = [\"seqno\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * Message _signature.\n             * @member {\"signature\"|undefined} _signature\n             * @memberof RPC.Message\n             * @instance\n             */\n            Object.defineProperty(Message.prototype, \"_signature\", {\n                get: $util.oneOfGetter($oneOfFields = [\"signature\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * Message _key.\n             * @member {\"key\"|undefined} _key\n             * @memberof RPC.Message\n             * @instance\n             */\n            Object.defineProperty(Message.prototype, \"_key\", {\n                get: $util.oneOfGetter($oneOfFields = [\"key\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * Encodes the specified Message message. Does not implicitly {@link RPC.Message.verify|verify} messages.\n             * @function encode\n             * @memberof RPC.Message\n             * @static\n             * @param {RPC.IMessage} m Message message or plain object to encode\n             * @param {$protobuf.Writer} [w] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            Message.encode = function encode(m, w) {\n                if (!w)\n                    w = $Writer.create();\n                if (m.from != null && Object.hasOwnProperty.call(m, \"from\"))\n                    w.uint32(10).bytes(m.from);\n                if (m.data != null && Object.hasOwnProperty.call(m, \"data\"))\n                    w.uint32(18).bytes(m.data);\n                if (m.seqno != null && Object.hasOwnProperty.call(m, \"seqno\"))\n                    w.uint32(26).bytes(m.seqno);\n                if (m.topicIDs != null && m.topicIDs.length) {\n                    for (var i = 0; i < m.topicIDs.length; ++i)\n                        w.uint32(34).string(m.topicIDs[i]);\n                }\n                if (m.signature != null && Object.hasOwnProperty.call(m, \"signature\"))\n                    w.uint32(42).bytes(m.signature);\n                if (m.key != null && Object.hasOwnProperty.call(m, \"key\"))\n                    w.uint32(50).bytes(m.key);\n                return w;\n            };\n    \n            /**\n             * Decodes a Message message from the specified reader or buffer.\n             * @function decode\n             * @memberof RPC.Message\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n             * @param {number} [l] Message length if known beforehand\n             * @returns {RPC.Message} Message\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            Message.decode = function decode(r, l) {\n                if (!(r instanceof $Reader))\n                    r = $Reader.create(r);\n                var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC.Message();\n                while (r.pos < c) {\n                    var t = r.uint32();\n                    switch (t >>> 3) {\n                    case 1:\n                        m.from = r.bytes();\n                        break;\n                    case 2:\n                        m.data = r.bytes();\n                        break;\n                    case 3:\n                        m.seqno = r.bytes();\n                        break;\n                    case 4:\n                        if (!(m.topicIDs && m.topicIDs.length))\n                            m.topicIDs = [];\n                        m.topicIDs.push(r.string());\n                        break;\n                    case 5:\n                        m.signature = r.bytes();\n                        break;\n                    case 6:\n                        m.key = r.bytes();\n                        break;\n                    default:\n                        r.skipType(t & 7);\n                        break;\n                    }\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a Message message from a plain object. Also converts values to their respective internal types.\n             * @function fromObject\n             * @memberof RPC.Message\n             * @static\n             * @param {Object.<string,*>} d Plain object\n             * @returns {RPC.Message} Message\n             */\n            Message.fromObject = function fromObject(d) {\n                if (d instanceof $root.RPC.Message)\n                    return d;\n                var m = new $root.RPC.Message();\n                if (d.from != null) {\n                    if (typeof d.from === \"string\")\n                        $util.base64.decode(d.from, m.from = $util.newBuffer($util.base64.length(d.from)), 0);\n                    else if (d.from.length)\n                        m.from = d.from;\n                }\n                if (d.data != null) {\n                    if (typeof d.data === \"string\")\n                        $util.base64.decode(d.data, m.data = $util.newBuffer($util.base64.length(d.data)), 0);\n                    else if (d.data.length)\n                        m.data = d.data;\n                }\n                if (d.seqno != null) {\n                    if (typeof d.seqno === \"string\")\n                        $util.base64.decode(d.seqno, m.seqno = $util.newBuffer($util.base64.length(d.seqno)), 0);\n                    else if (d.seqno.length)\n                        m.seqno = d.seqno;\n                }\n                if (d.topicIDs) {\n                    if (!Array.isArray(d.topicIDs))\n                        throw TypeError(\".RPC.Message.topicIDs: array expected\");\n                    m.topicIDs = [];\n                    for (var i = 0; i < d.topicIDs.length; ++i) {\n                        m.topicIDs[i] = String(d.topicIDs[i]);\n                    }\n                }\n                if (d.signature != null) {\n                    if (typeof d.signature === \"string\")\n                        $util.base64.decode(d.signature, m.signature = $util.newBuffer($util.base64.length(d.signature)), 0);\n                    else if (d.signature.length)\n                        m.signature = d.signature;\n                }\n                if (d.key != null) {\n                    if (typeof d.key === \"string\")\n                        $util.base64.decode(d.key, m.key = $util.newBuffer($util.base64.length(d.key)), 0);\n                    else if (d.key.length)\n                        m.key = d.key;\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a plain object from a Message message. Also converts values to other types if specified.\n             * @function toObject\n             * @memberof RPC.Message\n             * @static\n             * @param {RPC.Message} m Message\n             * @param {$protobuf.IConversionOptions} [o] Conversion options\n             * @returns {Object.<string,*>} Plain object\n             */\n            Message.toObject = function toObject(m, o) {\n                if (!o)\n                    o = {};\n                var d = {};\n                if (o.arrays || o.defaults) {\n                    d.topicIDs = [];\n                }\n                if (m.from != null && m.hasOwnProperty(\"from\")) {\n                    d.from = o.bytes === String ? $util.base64.encode(m.from, 0, m.from.length) : o.bytes === Array ? Array.prototype.slice.call(m.from) : m.from;\n                    if (o.oneofs)\n                        d._from = \"from\";\n                }\n                if (m.data != null && m.hasOwnProperty(\"data\")) {\n                    d.data = o.bytes === String ? $util.base64.encode(m.data, 0, m.data.length) : o.bytes === Array ? Array.prototype.slice.call(m.data) : m.data;\n                    if (o.oneofs)\n                        d._data = \"data\";\n                }\n                if (m.seqno != null && m.hasOwnProperty(\"seqno\")) {\n                    d.seqno = o.bytes === String ? $util.base64.encode(m.seqno, 0, m.seqno.length) : o.bytes === Array ? Array.prototype.slice.call(m.seqno) : m.seqno;\n                    if (o.oneofs)\n                        d._seqno = \"seqno\";\n                }\n                if (m.topicIDs && m.topicIDs.length) {\n                    d.topicIDs = [];\n                    for (var j = 0; j < m.topicIDs.length; ++j) {\n                        d.topicIDs[j] = m.topicIDs[j];\n                    }\n                }\n                if (m.signature != null && m.hasOwnProperty(\"signature\")) {\n                    d.signature = o.bytes === String ? $util.base64.encode(m.signature, 0, m.signature.length) : o.bytes === Array ? Array.prototype.slice.call(m.signature) : m.signature;\n                    if (o.oneofs)\n                        d._signature = \"signature\";\n                }\n                if (m.key != null && m.hasOwnProperty(\"key\")) {\n                    d.key = o.bytes === String ? $util.base64.encode(m.key, 0, m.key.length) : o.bytes === Array ? Array.prototype.slice.call(m.key) : m.key;\n                    if (o.oneofs)\n                        d._key = \"key\";\n                }\n                return d;\n            };\n    \n            /**\n             * Converts this Message to JSON.\n             * @function toJSON\n             * @memberof RPC.Message\n             * @instance\n             * @returns {Object.<string,*>} JSON object\n             */\n            Message.prototype.toJSON = function toJSON() {\n                return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n            };\n    \n            return Message;\n        })();\n    \n        RPC.ControlMessage = (function() {\n    \n            /**\n             * Properties of a ControlMessage.\n             * @memberof RPC\n             * @interface IControlMessage\n             * @property {Array.<RPC.IControlIHave>|null} [ihave] ControlMessage ihave\n             * @property {Array.<RPC.IControlIWant>|null} [iwant] ControlMessage iwant\n             * @property {Array.<RPC.IControlGraft>|null} [graft] ControlMessage graft\n             * @property {Array.<RPC.IControlPrune>|null} [prune] ControlMessage prune\n             */\n    \n            /**\n             * Constructs a new ControlMessage.\n             * @memberof RPC\n             * @classdesc Represents a ControlMessage.\n             * @implements IControlMessage\n             * @constructor\n             * @param {RPC.IControlMessage=} [p] Properties to set\n             */\n            function ControlMessage(p) {\n                this.ihave = [];\n                this.iwant = [];\n                this.graft = [];\n                this.prune = [];\n                if (p)\n                    for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                        if (p[ks[i]] != null)\n                            this[ks[i]] = p[ks[i]];\n            }\n    \n            /**\n             * ControlMessage ihave.\n             * @member {Array.<RPC.IControlIHave>} ihave\n             * @memberof RPC.ControlMessage\n             * @instance\n             */\n            ControlMessage.prototype.ihave = $util.emptyArray;\n    \n            /**\n             * ControlMessage iwant.\n             * @member {Array.<RPC.IControlIWant>} iwant\n             * @memberof RPC.ControlMessage\n             * @instance\n             */\n            ControlMessage.prototype.iwant = $util.emptyArray;\n    \n            /**\n             * ControlMessage graft.\n             * @member {Array.<RPC.IControlGraft>} graft\n             * @memberof RPC.ControlMessage\n             * @instance\n             */\n            ControlMessage.prototype.graft = $util.emptyArray;\n    \n            /**\n             * ControlMessage prune.\n             * @member {Array.<RPC.IControlPrune>} prune\n             * @memberof RPC.ControlMessage\n             * @instance\n             */\n            ControlMessage.prototype.prune = $util.emptyArray;\n    \n            /**\n             * Encodes the specified ControlMessage message. Does not implicitly {@link RPC.ControlMessage.verify|verify} messages.\n             * @function encode\n             * @memberof RPC.ControlMessage\n             * @static\n             * @param {RPC.IControlMessage} m ControlMessage message or plain object to encode\n             * @param {$protobuf.Writer} [w] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            ControlMessage.encode = function encode(m, w) {\n                if (!w)\n                    w = $Writer.create();\n                if (m.ihave != null && m.ihave.length) {\n                    for (var i = 0; i < m.ihave.length; ++i)\n                        $root.RPC.ControlIHave.encode(m.ihave[i], w.uint32(10).fork()).ldelim();\n                }\n                if (m.iwant != null && m.iwant.length) {\n                    for (var i = 0; i < m.iwant.length; ++i)\n                        $root.RPC.ControlIWant.encode(m.iwant[i], w.uint32(18).fork()).ldelim();\n                }\n                if (m.graft != null && m.graft.length) {\n                    for (var i = 0; i < m.graft.length; ++i)\n                        $root.RPC.ControlGraft.encode(m.graft[i], w.uint32(26).fork()).ldelim();\n                }\n                if (m.prune != null && m.prune.length) {\n                    for (var i = 0; i < m.prune.length; ++i)\n                        $root.RPC.ControlPrune.encode(m.prune[i], w.uint32(34).fork()).ldelim();\n                }\n                return w;\n            };\n    \n            /**\n             * Decodes a ControlMessage message from the specified reader or buffer.\n             * @function decode\n             * @memberof RPC.ControlMessage\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n             * @param {number} [l] Message length if known beforehand\n             * @returns {RPC.ControlMessage} ControlMessage\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            ControlMessage.decode = function decode(r, l) {\n                if (!(r instanceof $Reader))\n                    r = $Reader.create(r);\n                var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC.ControlMessage();\n                while (r.pos < c) {\n                    var t = r.uint32();\n                    switch (t >>> 3) {\n                    case 1:\n                        if (!(m.ihave && m.ihave.length))\n                            m.ihave = [];\n                        m.ihave.push($root.RPC.ControlIHave.decode(r, r.uint32()));\n                        break;\n                    case 2:\n                        if (!(m.iwant && m.iwant.length))\n                            m.iwant = [];\n                        m.iwant.push($root.RPC.ControlIWant.decode(r, r.uint32()));\n                        break;\n                    case 3:\n                        if (!(m.graft && m.graft.length))\n                            m.graft = [];\n                        m.graft.push($root.RPC.ControlGraft.decode(r, r.uint32()));\n                        break;\n                    case 4:\n                        if (!(m.prune && m.prune.length))\n                            m.prune = [];\n                        m.prune.push($root.RPC.ControlPrune.decode(r, r.uint32()));\n                        break;\n                    default:\n                        r.skipType(t & 7);\n                        break;\n                    }\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a ControlMessage message from a plain object. Also converts values to their respective internal types.\n             * @function fromObject\n             * @memberof RPC.ControlMessage\n             * @static\n             * @param {Object.<string,*>} d Plain object\n             * @returns {RPC.ControlMessage} ControlMessage\n             */\n            ControlMessage.fromObject = function fromObject(d) {\n                if (d instanceof $root.RPC.ControlMessage)\n                    return d;\n                var m = new $root.RPC.ControlMessage();\n                if (d.ihave) {\n                    if (!Array.isArray(d.ihave))\n                        throw TypeError(\".RPC.ControlMessage.ihave: array expected\");\n                    m.ihave = [];\n                    for (var i = 0; i < d.ihave.length; ++i) {\n                        if (typeof d.ihave[i] !== \"object\")\n                            throw TypeError(\".RPC.ControlMessage.ihave: object expected\");\n                        m.ihave[i] = $root.RPC.ControlIHave.fromObject(d.ihave[i]);\n                    }\n                }\n                if (d.iwant) {\n                    if (!Array.isArray(d.iwant))\n                        throw TypeError(\".RPC.ControlMessage.iwant: array expected\");\n                    m.iwant = [];\n                    for (var i = 0; i < d.iwant.length; ++i) {\n                        if (typeof d.iwant[i] !== \"object\")\n                            throw TypeError(\".RPC.ControlMessage.iwant: object expected\");\n                        m.iwant[i] = $root.RPC.ControlIWant.fromObject(d.iwant[i]);\n                    }\n                }\n                if (d.graft) {\n                    if (!Array.isArray(d.graft))\n                        throw TypeError(\".RPC.ControlMessage.graft: array expected\");\n                    m.graft = [];\n                    for (var i = 0; i < d.graft.length; ++i) {\n                        if (typeof d.graft[i] !== \"object\")\n                            throw TypeError(\".RPC.ControlMessage.graft: object expected\");\n                        m.graft[i] = $root.RPC.ControlGraft.fromObject(d.graft[i]);\n                    }\n                }\n                if (d.prune) {\n                    if (!Array.isArray(d.prune))\n                        throw TypeError(\".RPC.ControlMessage.prune: array expected\");\n                    m.prune = [];\n                    for (var i = 0; i < d.prune.length; ++i) {\n                        if (typeof d.prune[i] !== \"object\")\n                            throw TypeError(\".RPC.ControlMessage.prune: object expected\");\n                        m.prune[i] = $root.RPC.ControlPrune.fromObject(d.prune[i]);\n                    }\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a plain object from a ControlMessage message. Also converts values to other types if specified.\n             * @function toObject\n             * @memberof RPC.ControlMessage\n             * @static\n             * @param {RPC.ControlMessage} m ControlMessage\n             * @param {$protobuf.IConversionOptions} [o] Conversion options\n             * @returns {Object.<string,*>} Plain object\n             */\n            ControlMessage.toObject = function toObject(m, o) {\n                if (!o)\n                    o = {};\n                var d = {};\n                if (o.arrays || o.defaults) {\n                    d.ihave = [];\n                    d.iwant = [];\n                    d.graft = [];\n                    d.prune = [];\n                }\n                if (m.ihave && m.ihave.length) {\n                    d.ihave = [];\n                    for (var j = 0; j < m.ihave.length; ++j) {\n                        d.ihave[j] = $root.RPC.ControlIHave.toObject(m.ihave[j], o);\n                    }\n                }\n                if (m.iwant && m.iwant.length) {\n                    d.iwant = [];\n                    for (var j = 0; j < m.iwant.length; ++j) {\n                        d.iwant[j] = $root.RPC.ControlIWant.toObject(m.iwant[j], o);\n                    }\n                }\n                if (m.graft && m.graft.length) {\n                    d.graft = [];\n                    for (var j = 0; j < m.graft.length; ++j) {\n                        d.graft[j] = $root.RPC.ControlGraft.toObject(m.graft[j], o);\n                    }\n                }\n                if (m.prune && m.prune.length) {\n                    d.prune = [];\n                    for (var j = 0; j < m.prune.length; ++j) {\n                        d.prune[j] = $root.RPC.ControlPrune.toObject(m.prune[j], o);\n                    }\n                }\n                return d;\n            };\n    \n            /**\n             * Converts this ControlMessage to JSON.\n             * @function toJSON\n             * @memberof RPC.ControlMessage\n             * @instance\n             * @returns {Object.<string,*>} JSON object\n             */\n            ControlMessage.prototype.toJSON = function toJSON() {\n                return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n            };\n    \n            return ControlMessage;\n        })();\n    \n        RPC.ControlIHave = (function() {\n    \n            /**\n             * Properties of a ControlIHave.\n             * @memberof RPC\n             * @interface IControlIHave\n             * @property {string|null} [topicID] ControlIHave topicID\n             * @property {Array.<Uint8Array>|null} [messageIDs] ControlIHave messageIDs\n             */\n    \n            /**\n             * Constructs a new ControlIHave.\n             * @memberof RPC\n             * @classdesc Represents a ControlIHave.\n             * @implements IControlIHave\n             * @constructor\n             * @param {RPC.IControlIHave=} [p] Properties to set\n             */\n            function ControlIHave(p) {\n                this.messageIDs = [];\n                if (p)\n                    for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                        if (p[ks[i]] != null)\n                            this[ks[i]] = p[ks[i]];\n            }\n    \n            /**\n             * ControlIHave topicID.\n             * @member {string|null|undefined} topicID\n             * @memberof RPC.ControlIHave\n             * @instance\n             */\n            ControlIHave.prototype.topicID = null;\n    \n            /**\n             * ControlIHave messageIDs.\n             * @member {Array.<Uint8Array>} messageIDs\n             * @memberof RPC.ControlIHave\n             * @instance\n             */\n            ControlIHave.prototype.messageIDs = $util.emptyArray;\n    \n            // OneOf field names bound to virtual getters and setters\n            var $oneOfFields;\n    \n            /**\n             * ControlIHave _topicID.\n             * @member {\"topicID\"|undefined} _topicID\n             * @memberof RPC.ControlIHave\n             * @instance\n             */\n            Object.defineProperty(ControlIHave.prototype, \"_topicID\", {\n                get: $util.oneOfGetter($oneOfFields = [\"topicID\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * Encodes the specified ControlIHave message. Does not implicitly {@link RPC.ControlIHave.verify|verify} messages.\n             * @function encode\n             * @memberof RPC.ControlIHave\n             * @static\n             * @param {RPC.IControlIHave} m ControlIHave message or plain object to encode\n             * @param {$protobuf.Writer} [w] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            ControlIHave.encode = function encode(m, w) {\n                if (!w)\n                    w = $Writer.create();\n                if (m.topicID != null && Object.hasOwnProperty.call(m, \"topicID\"))\n                    w.uint32(10).string(m.topicID);\n                if (m.messageIDs != null && m.messageIDs.length) {\n                    for (var i = 0; i < m.messageIDs.length; ++i)\n                        w.uint32(18).bytes(m.messageIDs[i]);\n                }\n                return w;\n            };\n    \n            /**\n             * Decodes a ControlIHave message from the specified reader or buffer.\n             * @function decode\n             * @memberof RPC.ControlIHave\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n             * @param {number} [l] Message length if known beforehand\n             * @returns {RPC.ControlIHave} ControlIHave\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            ControlIHave.decode = function decode(r, l) {\n                if (!(r instanceof $Reader))\n                    r = $Reader.create(r);\n                var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC.ControlIHave();\n                while (r.pos < c) {\n                    var t = r.uint32();\n                    switch (t >>> 3) {\n                    case 1:\n                        m.topicID = r.string();\n                        break;\n                    case 2:\n                        if (!(m.messageIDs && m.messageIDs.length))\n                            m.messageIDs = [];\n                        m.messageIDs.push(r.bytes());\n                        break;\n                    default:\n                        r.skipType(t & 7);\n                        break;\n                    }\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a ControlIHave message from a plain object. Also converts values to their respective internal types.\n             * @function fromObject\n             * @memberof RPC.ControlIHave\n             * @static\n             * @param {Object.<string,*>} d Plain object\n             * @returns {RPC.ControlIHave} ControlIHave\n             */\n            ControlIHave.fromObject = function fromObject(d) {\n                if (d instanceof $root.RPC.ControlIHave)\n                    return d;\n                var m = new $root.RPC.ControlIHave();\n                if (d.topicID != null) {\n                    m.topicID = String(d.topicID);\n                }\n                if (d.messageIDs) {\n                    if (!Array.isArray(d.messageIDs))\n                        throw TypeError(\".RPC.ControlIHave.messageIDs: array expected\");\n                    m.messageIDs = [];\n                    for (var i = 0; i < d.messageIDs.length; ++i) {\n                        if (typeof d.messageIDs[i] === \"string\")\n                            $util.base64.decode(d.messageIDs[i], m.messageIDs[i] = $util.newBuffer($util.base64.length(d.messageIDs[i])), 0);\n                        else if (d.messageIDs[i].length)\n                            m.messageIDs[i] = d.messageIDs[i];\n                    }\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a plain object from a ControlIHave message. Also converts values to other types if specified.\n             * @function toObject\n             * @memberof RPC.ControlIHave\n             * @static\n             * @param {RPC.ControlIHave} m ControlIHave\n             * @param {$protobuf.IConversionOptions} [o] Conversion options\n             * @returns {Object.<string,*>} Plain object\n             */\n            ControlIHave.toObject = function toObject(m, o) {\n                if (!o)\n                    o = {};\n                var d = {};\n                if (o.arrays || o.defaults) {\n                    d.messageIDs = [];\n                }\n                if (m.topicID != null && m.hasOwnProperty(\"topicID\")) {\n                    d.topicID = m.topicID;\n                    if (o.oneofs)\n                        d._topicID = \"topicID\";\n                }\n                if (m.messageIDs && m.messageIDs.length) {\n                    d.messageIDs = [];\n                    for (var j = 0; j < m.messageIDs.length; ++j) {\n                        d.messageIDs[j] = o.bytes === String ? $util.base64.encode(m.messageIDs[j], 0, m.messageIDs[j].length) : o.bytes === Array ? Array.prototype.slice.call(m.messageIDs[j]) : m.messageIDs[j];\n                    }\n                }\n                return d;\n            };\n    \n            /**\n             * Converts this ControlIHave to JSON.\n             * @function toJSON\n             * @memberof RPC.ControlIHave\n             * @instance\n             * @returns {Object.<string,*>} JSON object\n             */\n            ControlIHave.prototype.toJSON = function toJSON() {\n                return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n            };\n    \n            return ControlIHave;\n        })();\n    \n        RPC.ControlIWant = (function() {\n    \n            /**\n             * Properties of a ControlIWant.\n             * @memberof RPC\n             * @interface IControlIWant\n             * @property {Array.<Uint8Array>|null} [messageIDs] ControlIWant messageIDs\n             */\n    \n            /**\n             * Constructs a new ControlIWant.\n             * @memberof RPC\n             * @classdesc Represents a ControlIWant.\n             * @implements IControlIWant\n             * @constructor\n             * @param {RPC.IControlIWant=} [p] Properties to set\n             */\n            function ControlIWant(p) {\n                this.messageIDs = [];\n                if (p)\n                    for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                        if (p[ks[i]] != null)\n                            this[ks[i]] = p[ks[i]];\n            }\n    \n            /**\n             * ControlIWant messageIDs.\n             * @member {Array.<Uint8Array>} messageIDs\n             * @memberof RPC.ControlIWant\n             * @instance\n             */\n            ControlIWant.prototype.messageIDs = $util.emptyArray;\n    \n            /**\n             * Encodes the specified ControlIWant message. Does not implicitly {@link RPC.ControlIWant.verify|verify} messages.\n             * @function encode\n             * @memberof RPC.ControlIWant\n             * @static\n             * @param {RPC.IControlIWant} m ControlIWant message or plain object to encode\n             * @param {$protobuf.Writer} [w] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            ControlIWant.encode = function encode(m, w) {\n                if (!w)\n                    w = $Writer.create();\n                if (m.messageIDs != null && m.messageIDs.length) {\n                    for (var i = 0; i < m.messageIDs.length; ++i)\n                        w.uint32(10).bytes(m.messageIDs[i]);\n                }\n                return w;\n            };\n    \n            /**\n             * Decodes a ControlIWant message from the specified reader or buffer.\n             * @function decode\n             * @memberof RPC.ControlIWant\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n             * @param {number} [l] Message length if known beforehand\n             * @returns {RPC.ControlIWant} ControlIWant\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            ControlIWant.decode = function decode(r, l) {\n                if (!(r instanceof $Reader))\n                    r = $Reader.create(r);\n                var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC.ControlIWant();\n                while (r.pos < c) {\n                    var t = r.uint32();\n                    switch (t >>> 3) {\n                    case 1:\n                        if (!(m.messageIDs && m.messageIDs.length))\n                            m.messageIDs = [];\n                        m.messageIDs.push(r.bytes());\n                        break;\n                    default:\n                        r.skipType(t & 7);\n                        break;\n                    }\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a ControlIWant message from a plain object. Also converts values to their respective internal types.\n             * @function fromObject\n             * @memberof RPC.ControlIWant\n             * @static\n             * @param {Object.<string,*>} d Plain object\n             * @returns {RPC.ControlIWant} ControlIWant\n             */\n            ControlIWant.fromObject = function fromObject(d) {\n                if (d instanceof $root.RPC.ControlIWant)\n                    return d;\n                var m = new $root.RPC.ControlIWant();\n                if (d.messageIDs) {\n                    if (!Array.isArray(d.messageIDs))\n                        throw TypeError(\".RPC.ControlIWant.messageIDs: array expected\");\n                    m.messageIDs = [];\n                    for (var i = 0; i < d.messageIDs.length; ++i) {\n                        if (typeof d.messageIDs[i] === \"string\")\n                            $util.base64.decode(d.messageIDs[i], m.messageIDs[i] = $util.newBuffer($util.base64.length(d.messageIDs[i])), 0);\n                        else if (d.messageIDs[i].length)\n                            m.messageIDs[i] = d.messageIDs[i];\n                    }\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a plain object from a ControlIWant message. Also converts values to other types if specified.\n             * @function toObject\n             * @memberof RPC.ControlIWant\n             * @static\n             * @param {RPC.ControlIWant} m ControlIWant\n             * @param {$protobuf.IConversionOptions} [o] Conversion options\n             * @returns {Object.<string,*>} Plain object\n             */\n            ControlIWant.toObject = function toObject(m, o) {\n                if (!o)\n                    o = {};\n                var d = {};\n                if (o.arrays || o.defaults) {\n                    d.messageIDs = [];\n                }\n                if (m.messageIDs && m.messageIDs.length) {\n                    d.messageIDs = [];\n                    for (var j = 0; j < m.messageIDs.length; ++j) {\n                        d.messageIDs[j] = o.bytes === String ? $util.base64.encode(m.messageIDs[j], 0, m.messageIDs[j].length) : o.bytes === Array ? Array.prototype.slice.call(m.messageIDs[j]) : m.messageIDs[j];\n                    }\n                }\n                return d;\n            };\n    \n            /**\n             * Converts this ControlIWant to JSON.\n             * @function toJSON\n             * @memberof RPC.ControlIWant\n             * @instance\n             * @returns {Object.<string,*>} JSON object\n             */\n            ControlIWant.prototype.toJSON = function toJSON() {\n                return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n            };\n    \n            return ControlIWant;\n        })();\n    \n        RPC.ControlGraft = (function() {\n    \n            /**\n             * Properties of a ControlGraft.\n             * @memberof RPC\n             * @interface IControlGraft\n             * @property {string|null} [topicID] ControlGraft topicID\n             */\n    \n            /**\n             * Constructs a new ControlGraft.\n             * @memberof RPC\n             * @classdesc Represents a ControlGraft.\n             * @implements IControlGraft\n             * @constructor\n             * @param {RPC.IControlGraft=} [p] Properties to set\n             */\n            function ControlGraft(p) {\n                if (p)\n                    for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                        if (p[ks[i]] != null)\n                            this[ks[i]] = p[ks[i]];\n            }\n    \n            /**\n             * ControlGraft topicID.\n             * @member {string|null|undefined} topicID\n             * @memberof RPC.ControlGraft\n             * @instance\n             */\n            ControlGraft.prototype.topicID = null;\n    \n            // OneOf field names bound to virtual getters and setters\n            var $oneOfFields;\n    \n            /**\n             * ControlGraft _topicID.\n             * @member {\"topicID\"|undefined} _topicID\n             * @memberof RPC.ControlGraft\n             * @instance\n             */\n            Object.defineProperty(ControlGraft.prototype, \"_topicID\", {\n                get: $util.oneOfGetter($oneOfFields = [\"topicID\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * Encodes the specified ControlGraft message. Does not implicitly {@link RPC.ControlGraft.verify|verify} messages.\n             * @function encode\n             * @memberof RPC.ControlGraft\n             * @static\n             * @param {RPC.IControlGraft} m ControlGraft message or plain object to encode\n             * @param {$protobuf.Writer} [w] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            ControlGraft.encode = function encode(m, w) {\n                if (!w)\n                    w = $Writer.create();\n                if (m.topicID != null && Object.hasOwnProperty.call(m, \"topicID\"))\n                    w.uint32(10).string(m.topicID);\n                return w;\n            };\n    \n            /**\n             * Decodes a ControlGraft message from the specified reader or buffer.\n             * @function decode\n             * @memberof RPC.ControlGraft\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n             * @param {number} [l] Message length if known beforehand\n             * @returns {RPC.ControlGraft} ControlGraft\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            ControlGraft.decode = function decode(r, l) {\n                if (!(r instanceof $Reader))\n                    r = $Reader.create(r);\n                var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC.ControlGraft();\n                while (r.pos < c) {\n                    var t = r.uint32();\n                    switch (t >>> 3) {\n                    case 1:\n                        m.topicID = r.string();\n                        break;\n                    default:\n                        r.skipType(t & 7);\n                        break;\n                    }\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a ControlGraft message from a plain object. Also converts values to their respective internal types.\n             * @function fromObject\n             * @memberof RPC.ControlGraft\n             * @static\n             * @param {Object.<string,*>} d Plain object\n             * @returns {RPC.ControlGraft} ControlGraft\n             */\n            ControlGraft.fromObject = function fromObject(d) {\n                if (d instanceof $root.RPC.ControlGraft)\n                    return d;\n                var m = new $root.RPC.ControlGraft();\n                if (d.topicID != null) {\n                    m.topicID = String(d.topicID);\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a plain object from a ControlGraft message. Also converts values to other types if specified.\n             * @function toObject\n             * @memberof RPC.ControlGraft\n             * @static\n             * @param {RPC.ControlGraft} m ControlGraft\n             * @param {$protobuf.IConversionOptions} [o] Conversion options\n             * @returns {Object.<string,*>} Plain object\n             */\n            ControlGraft.toObject = function toObject(m, o) {\n                if (!o)\n                    o = {};\n                var d = {};\n                if (m.topicID != null && m.hasOwnProperty(\"topicID\")) {\n                    d.topicID = m.topicID;\n                    if (o.oneofs)\n                        d._topicID = \"topicID\";\n                }\n                return d;\n            };\n    \n            /**\n             * Converts this ControlGraft to JSON.\n             * @function toJSON\n             * @memberof RPC.ControlGraft\n             * @instance\n             * @returns {Object.<string,*>} JSON object\n             */\n            ControlGraft.prototype.toJSON = function toJSON() {\n                return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n            };\n    \n            return ControlGraft;\n        })();\n    \n        RPC.ControlPrune = (function() {\n    \n            /**\n             * Properties of a ControlPrune.\n             * @memberof RPC\n             * @interface IControlPrune\n             * @property {string|null} [topicID] ControlPrune topicID\n             * @property {Array.<RPC.IPeerInfo>|null} [peers] ControlPrune peers\n             * @property {number|null} [backoff] ControlPrune backoff\n             */\n    \n            /**\n             * Constructs a new ControlPrune.\n             * @memberof RPC\n             * @classdesc Represents a ControlPrune.\n             * @implements IControlPrune\n             * @constructor\n             * @param {RPC.IControlPrune=} [p] Properties to set\n             */\n            function ControlPrune(p) {\n                this.peers = [];\n                if (p)\n                    for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                        if (p[ks[i]] != null)\n                            this[ks[i]] = p[ks[i]];\n            }\n    \n            /**\n             * ControlPrune topicID.\n             * @member {string|null|undefined} topicID\n             * @memberof RPC.ControlPrune\n             * @instance\n             */\n            ControlPrune.prototype.topicID = null;\n    \n            /**\n             * ControlPrune peers.\n             * @member {Array.<RPC.IPeerInfo>} peers\n             * @memberof RPC.ControlPrune\n             * @instance\n             */\n            ControlPrune.prototype.peers = $util.emptyArray;\n    \n            /**\n             * ControlPrune backoff.\n             * @member {number|null|undefined} backoff\n             * @memberof RPC.ControlPrune\n             * @instance\n             */\n            ControlPrune.prototype.backoff = null;\n    \n            // OneOf field names bound to virtual getters and setters\n            var $oneOfFields;\n    \n            /**\n             * ControlPrune _topicID.\n             * @member {\"topicID\"|undefined} _topicID\n             * @memberof RPC.ControlPrune\n             * @instance\n             */\n            Object.defineProperty(ControlPrune.prototype, \"_topicID\", {\n                get: $util.oneOfGetter($oneOfFields = [\"topicID\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * ControlPrune _backoff.\n             * @member {\"backoff\"|undefined} _backoff\n             * @memberof RPC.ControlPrune\n             * @instance\n             */\n            Object.defineProperty(ControlPrune.prototype, \"_backoff\", {\n                get: $util.oneOfGetter($oneOfFields = [\"backoff\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * Encodes the specified ControlPrune message. Does not implicitly {@link RPC.ControlPrune.verify|verify} messages.\n             * @function encode\n             * @memberof RPC.ControlPrune\n             * @static\n             * @param {RPC.IControlPrune} m ControlPrune message or plain object to encode\n             * @param {$protobuf.Writer} [w] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            ControlPrune.encode = function encode(m, w) {\n                if (!w)\n                    w = $Writer.create();\n                if (m.topicID != null && Object.hasOwnProperty.call(m, \"topicID\"))\n                    w.uint32(10).string(m.topicID);\n                if (m.peers != null && m.peers.length) {\n                    for (var i = 0; i < m.peers.length; ++i)\n                        $root.RPC.PeerInfo.encode(m.peers[i], w.uint32(18).fork()).ldelim();\n                }\n                if (m.backoff != null && Object.hasOwnProperty.call(m, \"backoff\"))\n                    w.uint32(24).uint64(m.backoff);\n                return w;\n            };\n    \n            /**\n             * Decodes a ControlPrune message from the specified reader or buffer.\n             * @function decode\n             * @memberof RPC.ControlPrune\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n             * @param {number} [l] Message length if known beforehand\n             * @returns {RPC.ControlPrune} ControlPrune\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            ControlPrune.decode = function decode(r, l) {\n                if (!(r instanceof $Reader))\n                    r = $Reader.create(r);\n                var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC.ControlPrune();\n                while (r.pos < c) {\n                    var t = r.uint32();\n                    switch (t >>> 3) {\n                    case 1:\n                        m.topicID = r.string();\n                        break;\n                    case 2:\n                        if (!(m.peers && m.peers.length))\n                            m.peers = [];\n                        m.peers.push($root.RPC.PeerInfo.decode(r, r.uint32()));\n                        break;\n                    case 3:\n                        m.backoff = r.uint64();\n                        break;\n                    default:\n                        r.skipType(t & 7);\n                        break;\n                    }\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a ControlPrune message from a plain object. Also converts values to their respective internal types.\n             * @function fromObject\n             * @memberof RPC.ControlPrune\n             * @static\n             * @param {Object.<string,*>} d Plain object\n             * @returns {RPC.ControlPrune} ControlPrune\n             */\n            ControlPrune.fromObject = function fromObject(d) {\n                if (d instanceof $root.RPC.ControlPrune)\n                    return d;\n                var m = new $root.RPC.ControlPrune();\n                if (d.topicID != null) {\n                    m.topicID = String(d.topicID);\n                }\n                if (d.peers) {\n                    if (!Array.isArray(d.peers))\n                        throw TypeError(\".RPC.ControlPrune.peers: array expected\");\n                    m.peers = [];\n                    for (var i = 0; i < d.peers.length; ++i) {\n                        if (typeof d.peers[i] !== \"object\")\n                            throw TypeError(\".RPC.ControlPrune.peers: object expected\");\n                        m.peers[i] = $root.RPC.PeerInfo.fromObject(d.peers[i]);\n                    }\n                }\n                if (d.backoff != null) {\n                    if ($util.Long)\n                        (m.backoff = $util.Long.fromValue(d.backoff)).unsigned = true;\n                    else if (typeof d.backoff === \"string\")\n                        m.backoff = parseInt(d.backoff, 10);\n                    else if (typeof d.backoff === \"number\")\n                        m.backoff = d.backoff;\n                    else if (typeof d.backoff === \"object\")\n                        m.backoff = new $util.LongBits(d.backoff.low >>> 0, d.backoff.high >>> 0).toNumber(true);\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a plain object from a ControlPrune message. Also converts values to other types if specified.\n             * @function toObject\n             * @memberof RPC.ControlPrune\n             * @static\n             * @param {RPC.ControlPrune} m ControlPrune\n             * @param {$protobuf.IConversionOptions} [o] Conversion options\n             * @returns {Object.<string,*>} Plain object\n             */\n            ControlPrune.toObject = function toObject(m, o) {\n                if (!o)\n                    o = {};\n                var d = {};\n                if (o.arrays || o.defaults) {\n                    d.peers = [];\n                }\n                if (m.topicID != null && m.hasOwnProperty(\"topicID\")) {\n                    d.topicID = m.topicID;\n                    if (o.oneofs)\n                        d._topicID = \"topicID\";\n                }\n                if (m.peers && m.peers.length) {\n                    d.peers = [];\n                    for (var j = 0; j < m.peers.length; ++j) {\n                        d.peers[j] = $root.RPC.PeerInfo.toObject(m.peers[j], o);\n                    }\n                }\n                if (m.backoff != null && m.hasOwnProperty(\"backoff\")) {\n                    if (typeof m.backoff === \"number\")\n                        d.backoff = o.longs === String ? String(m.backoff) : m.backoff;\n                    else\n                        d.backoff = o.longs === String ? $util.Long.prototype.toString.call(m.backoff) : o.longs === Number ? new $util.LongBits(m.backoff.low >>> 0, m.backoff.high >>> 0).toNumber(true) : m.backoff;\n                    if (o.oneofs)\n                        d._backoff = \"backoff\";\n                }\n                return d;\n            };\n    \n            /**\n             * Converts this ControlPrune to JSON.\n             * @function toJSON\n             * @memberof RPC.ControlPrune\n             * @instance\n             * @returns {Object.<string,*>} JSON object\n             */\n            ControlPrune.prototype.toJSON = function toJSON() {\n                return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n            };\n    \n            return ControlPrune;\n        })();\n    \n        RPC.PeerInfo = (function() {\n    \n            /**\n             * Properties of a PeerInfo.\n             * @memberof RPC\n             * @interface IPeerInfo\n             * @property {Uint8Array|null} [peerID] PeerInfo peerID\n             * @property {Uint8Array|null} [signedPeerRecord] PeerInfo signedPeerRecord\n             */\n    \n            /**\n             * Constructs a new PeerInfo.\n             * @memberof RPC\n             * @classdesc Represents a PeerInfo.\n             * @implements IPeerInfo\n             * @constructor\n             * @param {RPC.IPeerInfo=} [p] Properties to set\n             */\n            function PeerInfo(p) {\n                if (p)\n                    for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                        if (p[ks[i]] != null)\n                            this[ks[i]] = p[ks[i]];\n            }\n    \n            /**\n             * PeerInfo peerID.\n             * @member {Uint8Array|null|undefined} peerID\n             * @memberof RPC.PeerInfo\n             * @instance\n             */\n            PeerInfo.prototype.peerID = null;\n    \n            /**\n             * PeerInfo signedPeerRecord.\n             * @member {Uint8Array|null|undefined} signedPeerRecord\n             * @memberof RPC.PeerInfo\n             * @instance\n             */\n            PeerInfo.prototype.signedPeerRecord = null;\n    \n            // OneOf field names bound to virtual getters and setters\n            var $oneOfFields;\n    \n            /**\n             * PeerInfo _peerID.\n             * @member {\"peerID\"|undefined} _peerID\n             * @memberof RPC.PeerInfo\n             * @instance\n             */\n            Object.defineProperty(PeerInfo.prototype, \"_peerID\", {\n                get: $util.oneOfGetter($oneOfFields = [\"peerID\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * PeerInfo _signedPeerRecord.\n             * @member {\"signedPeerRecord\"|undefined} _signedPeerRecord\n             * @memberof RPC.PeerInfo\n             * @instance\n             */\n            Object.defineProperty(PeerInfo.prototype, \"_signedPeerRecord\", {\n                get: $util.oneOfGetter($oneOfFields = [\"signedPeerRecord\"]),\n                set: $util.oneOfSetter($oneOfFields)\n            });\n    \n            /**\n             * Encodes the specified PeerInfo message. Does not implicitly {@link RPC.PeerInfo.verify|verify} messages.\n             * @function encode\n             * @memberof RPC.PeerInfo\n             * @static\n             * @param {RPC.IPeerInfo} m PeerInfo message or plain object to encode\n             * @param {$protobuf.Writer} [w] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            PeerInfo.encode = function encode(m, w) {\n                if (!w)\n                    w = $Writer.create();\n                if (m.peerID != null && Object.hasOwnProperty.call(m, \"peerID\"))\n                    w.uint32(10).bytes(m.peerID);\n                if (m.signedPeerRecord != null && Object.hasOwnProperty.call(m, \"signedPeerRecord\"))\n                    w.uint32(18).bytes(m.signedPeerRecord);\n                return w;\n            };\n    \n            /**\n             * Decodes a PeerInfo message from the specified reader or buffer.\n             * @function decode\n             * @memberof RPC.PeerInfo\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n             * @param {number} [l] Message length if known beforehand\n             * @returns {RPC.PeerInfo} PeerInfo\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            PeerInfo.decode = function decode(r, l) {\n                if (!(r instanceof $Reader))\n                    r = $Reader.create(r);\n                var c = l === undefined ? r.len : r.pos + l, m = new $root.RPC.PeerInfo();\n                while (r.pos < c) {\n                    var t = r.uint32();\n                    switch (t >>> 3) {\n                    case 1:\n                        m.peerID = r.bytes();\n                        break;\n                    case 2:\n                        m.signedPeerRecord = r.bytes();\n                        break;\n                    default:\n                        r.skipType(t & 7);\n                        break;\n                    }\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a PeerInfo message from a plain object. Also converts values to their respective internal types.\n             * @function fromObject\n             * @memberof RPC.PeerInfo\n             * @static\n             * @param {Object.<string,*>} d Plain object\n             * @returns {RPC.PeerInfo} PeerInfo\n             */\n            PeerInfo.fromObject = function fromObject(d) {\n                if (d instanceof $root.RPC.PeerInfo)\n                    return d;\n                var m = new $root.RPC.PeerInfo();\n                if (d.peerID != null) {\n                    if (typeof d.peerID === \"string\")\n                        $util.base64.decode(d.peerID, m.peerID = $util.newBuffer($util.base64.length(d.peerID)), 0);\n                    else if (d.peerID.length)\n                        m.peerID = d.peerID;\n                }\n                if (d.signedPeerRecord != null) {\n                    if (typeof d.signedPeerRecord === \"string\")\n                        $util.base64.decode(d.signedPeerRecord, m.signedPeerRecord = $util.newBuffer($util.base64.length(d.signedPeerRecord)), 0);\n                    else if (d.signedPeerRecord.length)\n                        m.signedPeerRecord = d.signedPeerRecord;\n                }\n                return m;\n            };\n    \n            /**\n             * Creates a plain object from a PeerInfo message. Also converts values to other types if specified.\n             * @function toObject\n             * @memberof RPC.PeerInfo\n             * @static\n             * @param {RPC.PeerInfo} m PeerInfo\n             * @param {$protobuf.IConversionOptions} [o] Conversion options\n             * @returns {Object.<string,*>} Plain object\n             */\n            PeerInfo.toObject = function toObject(m, o) {\n                if (!o)\n                    o = {};\n                var d = {};\n                if (m.peerID != null && m.hasOwnProperty(\"peerID\")) {\n                    d.peerID = o.bytes === String ? $util.base64.encode(m.peerID, 0, m.peerID.length) : o.bytes === Array ? Array.prototype.slice.call(m.peerID) : m.peerID;\n                    if (o.oneofs)\n                        d._peerID = \"peerID\";\n                }\n                if (m.signedPeerRecord != null && m.hasOwnProperty(\"signedPeerRecord\")) {\n                    d.signedPeerRecord = o.bytes === String ? $util.base64.encode(m.signedPeerRecord, 0, m.signedPeerRecord.length) : o.bytes === Array ? Array.prototype.slice.call(m.signedPeerRecord) : m.signedPeerRecord;\n                    if (o.oneofs)\n                        d._signedPeerRecord = \"signedPeerRecord\";\n                }\n                return d;\n            };\n    \n            /**\n             * Converts this PeerInfo to JSON.\n             * @function toJSON\n             * @memberof RPC.PeerInfo\n             * @instance\n             * @returns {Object.<string,*>} JSON object\n             */\n            PeerInfo.prototype.toJSON = function toJSON() {\n                return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n            };\n    \n            return PeerInfo;\n        })();\n    \n        return RPC;\n    })();\n\n    return $root;\n});\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Heartbeat = void 0;\nconst constants = __importStar(require(\"./constants\"));\nconst get_gossip_peers_1 = require(\"./get-gossip-peers\");\nconst utils_1 = require(\"./utils\");\n// eslint-disable-next-line @typescript-eslint/ban-ts-comment\nclass Heartbeat {\n    /**\n     * @param {Object} gossipsub\n     * @constructor\n     */\n    constructor(gossipsub) {\n        this.gossipsub = gossipsub;\n    }\n    start() {\n        if (this._heartbeatTimer) {\n            return;\n        }\n        const heartbeat = this._heartbeat.bind(this);\n        const timeout = setTimeout(() => {\n            heartbeat();\n            this._heartbeatTimer.runPeriodically(heartbeat, constants.GossipsubHeartbeatInterval);\n        }, constants.GossipsubHeartbeatInitialDelay);\n        this._heartbeatTimer = {\n            _intervalId: undefined,\n            runPeriodically: (fn, period) => {\n                this._heartbeatTimer._intervalId = setInterval(fn, period);\n            },\n            cancel: () => {\n                clearTimeout(timeout);\n                clearInterval(this._heartbeatTimer._intervalId);\n            }\n        };\n    }\n    /**\n     * Unmounts the gossipsub protocol and shuts down every connection\n     * @override\n     * @returns {void}\n     */\n    stop() {\n        if (!this._heartbeatTimer) {\n            return;\n        }\n        this._heartbeatTimer.cancel();\n        this._heartbeatTimer = null;\n    }\n    /**\n     * Maintains the mesh and fanout maps in gossipsub.\n     *\n     * @returns {void}\n     */\n    _heartbeat() {\n        const { D, Dlo, Dhi, Dscore, Dout } = this.gossipsub._options;\n        this.gossipsub.heartbeatTicks++;\n        // cache scores throught the heartbeat\n        const scores = new Map();\n        const getScore = (id) => {\n            let s = scores.get(id);\n            if (s === undefined) {\n                s = this.gossipsub.score.score(id);\n                scores.set(id, s);\n            }\n            return s;\n        };\n        // peer id => topic[]\n        const tograft = new Map();\n        // peer id => topic[]\n        const toprune = new Map();\n        // peer id => don't px\n        const noPX = new Map();\n        // clean up expired backoffs\n        this.gossipsub._clearBackoff();\n        // clean up peerhave/iasked counters\n        this.gossipsub.peerhave.clear();\n        this.gossipsub.iasked.clear();\n        // apply IWANT request penalties\n        this.gossipsub._applyIwantPenalties();\n        // ensure direct peers are connected\n        this.gossipsub._directConnect();\n        // maintain the mesh for topics we have joined\n        this.gossipsub.mesh.forEach((peers, topic) => {\n            // prune/graft helper functions (defined per topic)\n            const prunePeer = (id) => {\n                this.gossipsub.log('HEARTBEAT: Remove mesh link to %s in %s', id, topic);\n                // update peer score\n                this.gossipsub.score.prune(id, topic);\n                // add prune backoff record\n                this.gossipsub._addBackoff(id, topic);\n                // remove peer from mesh\n                peers.delete(id);\n                // add to toprune\n                const topics = toprune.get(id);\n                if (!topics) {\n                    toprune.set(id, [topic]);\n                }\n                else {\n                    topics.push(topic);\n                }\n            };\n            const graftPeer = (id) => {\n                this.gossipsub.log('HEARTBEAT: Add mesh link to %s in %s', id, topic);\n                // update peer score\n                this.gossipsub.score.graft(id, topic);\n                // add peer to mesh\n                peers.add(id);\n                // add to tograft\n                const topics = tograft.get(id);\n                if (!topics) {\n                    tograft.set(id, [topic]);\n                }\n                else {\n                    topics.push(topic);\n                }\n            };\n            // drop all peers with negative score, without PX\n            peers.forEach(id => {\n                const score = getScore(id);\n                if (score < 0) {\n                    this.gossipsub.log('HEARTBEAT: Prune peer %s with negative score: score=%d, topic=%s', id, score, topic);\n                    prunePeer(id);\n                    noPX.set(id, true);\n                }\n            });\n            // do we have enough peers?\n            if (peers.size < Dlo) {\n                const backoff = this.gossipsub.backoff.get(topic);\n                const ineed = D - peers.size;\n                const peersSet = get_gossip_peers_1.getGossipPeers(this.gossipsub, topic, ineed, id => {\n                    // filter out mesh peers, direct peers, peers we are backing off, peers with negative score\n                    return !peers.has(id) && !this.gossipsub.direct.has(id) && (!backoff || !backoff.has(id)) && getScore(id) >= 0;\n                });\n                peersSet.forEach(graftPeer);\n            }\n            // do we have to many peers?\n            if (peers.size > Dhi) {\n                let peersArray = Array.from(peers);\n                // sort by score\n                peersArray.sort((a, b) => getScore(b) - getScore(a));\n                // We keep the first D_score peers by score and the remaining up to D randomly\n                // under the constraint that we keep D_out peers in the mesh (if we have that many)\n                peersArray = peersArray.slice(0, Dscore).concat(utils_1.shuffle(peersArray.slice(Dscore)));\n                // count the outbound peers we are keeping\n                let outbound = 0;\n                peersArray.slice(0, D).forEach(p => {\n                    if (this.gossipsub.outbound.get(p)) {\n                        outbound++;\n                    }\n                });\n                // if it's less than D_out, bubble up some outbound peers from the random selection\n                if (outbound < Dout) {\n                    const rotate = (i) => {\n                        // rotate the peersArray to the right and put the ith peer in the front\n                        const p = peersArray[i];\n                        for (let j = i; j > 0; j--) {\n                            peersArray[j] = peersArray[j - 1];\n                        }\n                        peersArray[0] = p;\n                    };\n                    // first bubble up all outbound peers already in the selection to the front\n                    if (outbound > 0) {\n                        let ihave = outbound;\n                        for (let i = 1; i < D && ihave > 0; i++) {\n                            if (this.gossipsub.outbound.get(peersArray[i])) {\n                                rotate(i);\n                                ihave--;\n                            }\n                        }\n                    }\n                    // now bubble up enough outbound peers outside the selection to the front\n                    let ineed = D - outbound;\n                    for (let i = D; i < peersArray.length && ineed > 0; i++) {\n                        if (this.gossipsub.outbound.get(peersArray[i])) {\n                            rotate(i);\n                            ineed--;\n                        }\n                    }\n                }\n                // prune the excess peers\n                peersArray.slice(D).forEach(prunePeer);\n            }\n            // do we have enough outbound peers?\n            if (peers.size >= Dlo) {\n                // count the outbound peers we have\n                let outbound = 0;\n                peers.forEach(p => {\n                    if (this.gossipsub.outbound.get(p)) {\n                        outbound++;\n                    }\n                });\n                // if it's less than D_out, select some peers with outbound connections and graft them\n                if (outbound < Dout) {\n                    const ineed = Dout - outbound;\n                    const backoff = this.gossipsub.backoff.get(topic);\n                    get_gossip_peers_1.getGossipPeers(this.gossipsub, topic, ineed, (id) => {\n                        // filter our current mesh peers, direct peers, peers we are backing off, peers with negative score\n                        return !peers.has(id) && !this.gossipsub.direct.has(id) && (!backoff || !backoff.has(id)) && getScore(id) >= 0;\n                    }).forEach(graftPeer);\n                }\n            }\n            // should we try to improve the mesh with opportunistic grafting?\n            if (this.gossipsub.heartbeatTicks % constants.GossipsubOpportunisticGraftTicks === 0 && peers.size > 1) {\n                // Opportunistic grafting works as follows: we check the median score of peers in the\n                // mesh; if this score is below the opportunisticGraftThreshold, we select a few peers at\n                // random with score over the median.\n                // The intention is to (slowly) improve an underperforming mesh by introducing good\n                // scoring peers that may have been gossiping at us. This allows us to get out of sticky\n                // situations where we are stuck with poor peers and also recover from churn of good peers.\n                // now compute the median peer score in the mesh\n                const peersList = Array.from(peers)\n                    .sort((a, b) => getScore(a) - getScore(b));\n                const medianIndex = peers.size / 2;\n                const medianScore = getScore(peersList[medianIndex]);\n                // if the median score is below the threshold, select a better peer (if any) and GRAFT\n                if (medianScore < this.gossipsub._options.scoreThresholds.opportunisticGraftThreshold) {\n                    const backoff = this.gossipsub.backoff.get(topic);\n                    const peersToGraft = get_gossip_peers_1.getGossipPeers(this.gossipsub, topic, constants.GossipsubOpportunisticGraftPeers, (id) => {\n                        // filter out current mesh peers, direct peers, peers we are backing off, peers below or at threshold\n                        return peers.has(id) && !this.gossipsub.direct.has(id) && (!backoff || !backoff.has(id)) && getScore(id) > medianScore;\n                    });\n                    peersToGraft.forEach(id => {\n                        this.gossipsub.log('HEARTBEAT: Opportunistically graft peer %s on topic %s', id, topic);\n                        graftPeer(id);\n                    });\n                }\n            }\n            // 2nd arg are mesh peers excluded from gossip. We have already pushed\n            // messages to them, so its redundant to gossip IHAVEs.\n            this.gossipsub._emitGossip(topic, peers);\n        });\n        // expire fanout for topics we haven't published to in a while\n        const now = this.gossipsub._now();\n        this.gossipsub.lastpub.forEach((lastpb, topic) => {\n            if ((lastpb + constants.GossipsubFanoutTTL) < now) {\n                this.gossipsub.fanout.delete(topic);\n                this.gossipsub.lastpub.delete(topic);\n            }\n        });\n        // maintain our fanout for topics we are publishing but we have not joined\n        this.gossipsub.fanout.forEach((fanoutPeers, topic) => {\n            // checks whether our peers are still in the topic and have a score above the publish threshold\n            const topicPeers = this.gossipsub.topics.get(topic);\n            fanoutPeers.forEach(id => {\n                if (!topicPeers.has(id) ||\n                    getScore(id) < this.gossipsub._options.scoreThresholds.publishThreshold) {\n                    fanoutPeers.delete(id);\n                }\n            });\n            // do we need more peers?\n            if (fanoutPeers.size < D) {\n                const ineed = D - fanoutPeers.size;\n                const peersSet = get_gossip_peers_1.getGossipPeers(this.gossipsub, topic, ineed, (id) => {\n                    // filter out existing fanout peers, direct peers, and peers with score above the publish threshold\n                    return !fanoutPeers.has(id) &&\n                        !this.gossipsub.direct.has(id) &&\n                        getScore(id) >= this.gossipsub._options.scoreThresholds.publishThreshold;\n                });\n                peersSet.forEach(id => {\n                    fanoutPeers.add(id);\n                });\n            }\n            // 2nd arg are fanout peers excluded from gossip.\n            // We have already pushed messages to them, so its redundant to gossip IHAVEs\n            this.gossipsub._emitGossip(topic, fanoutPeers);\n        });\n        // send coalesced GRAFT/PRUNE messages (will piggyback gossip)\n        this.gossipsub._sendGraftPrune(tograft, toprune, noPX);\n        // flush pending gossip that wasn't piggybacked above\n        this.gossipsub._flush();\n        // advance the message history window\n        this.gossipsub.messageCache.shift();\n        this.gossipsub.emit('gossipsub:heartbeat');\n    }\n}\nexports.Heartbeat = Heartbeat;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getGossipPeers = void 0;\nconst utils_1 = require(\"./utils\");\n/**\n * Given a topic, returns up to count peers subscribed to that topic\n * that pass an optional filter function\n *\n * @param {Gossipsub} router\n * @param {String} topic\n * @param {Number} count\n * @param {Function} [filter] a function to filter acceptable peers\n * @returns {Set<string>}\n *\n */\nfunction getGossipPeers(router, topic, count, filter = () => true) {\n    const peersInTopic = router.topics.get(topic);\n    if (!peersInTopic) {\n        return new Set();\n    }\n    // Adds all peers using our protocol\n    // that also pass the filter function\n    let peers = [];\n    peersInTopic.forEach((id) => {\n        const peerStreams = router.peers.get(id);\n        if (!peerStreams) {\n            return;\n        }\n        if (utils_1.hasGossipProtocol(peerStreams.protocol) &&\n            filter(id)) {\n            peers.push(id);\n        }\n    });\n    // Pseudo-randomly shuffles peers\n    peers = utils_1.shuffle(peers);\n    if (count > 0 && peers.length > count) {\n        peers = peers.slice(0, count);\n    }\n    return new Set(peers);\n}\nexports.getGossipPeers = getGossipPeers;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __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(\"./peer-score-params\"), exports);\n__exportStar(require(\"./peer-score-thresholds\"), exports);\n__exportStar(require(\"./peer-score\"), exports);\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.validateTopicScoreParams = exports.validatePeerScoreParams = exports.createTopicScoreParams = exports.createPeerScoreParams = exports.defaultTopicScoreParams = exports.defaultPeerScoreParams = void 0;\nconst constants_1 = require(\"./constants\");\n// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n// @ts-ignore\nconst errcode = require(\"err-code\");\nexports.defaultPeerScoreParams = {\n    topics: {},\n    topicScoreCap: 10,\n    appSpecificScore: () => 0,\n    appSpecificWeight: 10,\n    IPColocationFactorWeight: -5,\n    IPColocationFactorThreshold: 10,\n    IPColocationFactorWhitelist: new Set(),\n    behaviourPenaltyWeight: -10,\n    behaviourPenaltyDecay: 0.2,\n    decayInterval: 1000,\n    decayToZero: 0.1,\n    retainScore: 3600 * 1000\n};\nexports.defaultTopicScoreParams = {\n    topicWeight: 0.5,\n    timeInMeshWeight: 1,\n    timeInMeshQuantum: 1,\n    timeInMeshCap: 3600,\n    firstMessageDeliveriesWeight: 1,\n    firstMessageDeliveriesDecay: 0.5,\n    firstMessageDeliveriesCap: 2000,\n    meshMessageDeliveriesWeight: -1,\n    meshMessageDeliveriesDecay: 0.5,\n    meshMessageDeliveriesCap: 100,\n    meshMessageDeliveriesThreshold: 20,\n    meshMessageDeliveriesWindow: 10,\n    meshMessageDeliveriesActivation: 5000,\n    meshFailurePenaltyWeight: -1,\n    meshFailurePenaltyDecay: 0.5,\n    invalidMessageDeliveriesWeight: -1,\n    invalidMessageDeliveriesDecay: 0.3\n};\nfunction createPeerScoreParams(p = {}) {\n    return Object.assign(Object.assign(Object.assign({}, exports.defaultPeerScoreParams), p), { topics: p.topics\n            ? Object.entries(p.topics)\n                .reduce((topics, [topic, topicScoreParams]) => {\n                topics[topic] = createTopicScoreParams(topicScoreParams);\n                return topics;\n            }, {})\n            : {} });\n}\nexports.createPeerScoreParams = createPeerScoreParams;\nfunction createTopicScoreParams(p = {}) {\n    return Object.assign(Object.assign({}, exports.defaultTopicScoreParams), p);\n}\nexports.createTopicScoreParams = createTopicScoreParams;\n// peer score parameter validation\nfunction validatePeerScoreParams(p) {\n    for (const [topic, params] of Object.entries(p.topics)) {\n        try {\n            validateTopicScoreParams(params);\n        }\n        catch (e) {\n            throw errcode(new Error(`invalid score parameters for topic ${topic}: ${e.message}`), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n        }\n    }\n    // check that the topic score is 0 or something positive\n    if (p.topicScoreCap < 0) {\n        throw errcode(new Error('invalid topic score cap; must be positive (or 0 for no cap)'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    // check that we have an app specific score; the weight can be anything (but expected positive)\n    if (p.appSpecificScore === null || p.appSpecificScore === undefined) {\n        throw errcode(new Error('missing application specific score function'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    // check the IP colocation factor\n    if (p.IPColocationFactorWeight > 0) {\n        throw errcode(new Error('invalid IPColocationFactorWeight; must be negative (or 0 to disable)'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.IPColocationFactorWeight !== 0 && p.IPColocationFactorThreshold < 1) {\n        throw errcode(new Error('invalid IPColocationFactorThreshold; must be at least 1'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    // check the behaviour penalty\n    if (p.behaviourPenaltyWeight > 0) {\n        throw errcode(new Error('invalid BehaviourPenaltyWeight; must be negative (or 0 to disable)'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.behaviourPenaltyWeight !== 0 && (p.behaviourPenaltyDecay <= 0 || p.behaviourPenaltyDecay >= 1)) {\n        throw errcode(new Error('invalid BehaviourPenaltyDecay; must be between 0 and 1'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    // check the decay parameters\n    if (p.decayInterval < 1000) {\n        throw errcode(new Error('invalid DecayInterval; must be at least 1s'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.decayToZero <= 0 || p.decayToZero >= 1) {\n        throw errcode(new Error('invalid DecayToZero; must be between 0 and 1'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    // no need to check the score retention; a value of 0 means that we don't retain scores\n}\nexports.validatePeerScoreParams = validatePeerScoreParams;\nfunction validateTopicScoreParams(p) {\n    // make sure we have a sane topic weight\n    if (p.topicWeight < 0) {\n        throw errcode(new Error('invalid topic weight; must be >= 0'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    // check P1\n    if (p.timeInMeshQuantum === 0) {\n        throw errcode(new Error('invalid TimeInMeshQuantum; must be non zero'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.timeInMeshWeight < 0) {\n        throw errcode(new Error('invalid TimeInMeshWeight; must be positive (or 0 to disable)'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.timeInMeshWeight !== 0 && p.timeInMeshQuantum <= 0) {\n        throw errcode(new Error('invalid TimeInMeshQuantum; must be positive'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.timeInMeshWeight !== 0 && p.timeInMeshCap <= 0) {\n        throw errcode(new Error('invalid TimeInMeshCap; must be positive'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    // check P2\n    if (p.firstMessageDeliveriesWeight < 0) {\n        throw errcode(new Error('invallid FirstMessageDeliveriesWeight; must be positive (or 0 to disable)'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.firstMessageDeliveriesWeight !== 0 && (p.firstMessageDeliveriesDecay <= 0 || p.firstMessageDeliveriesDecay >= 1)) {\n        throw errcode(new Error('invalid FirstMessageDeliveriesDecay; must be between 0 and 1'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.firstMessageDeliveriesWeight !== 0 && p.firstMessageDeliveriesCap <= 0) {\n        throw errcode(new Error('invalid FirstMessageDeliveriesCap; must be positive'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    // check P3\n    if (p.meshMessageDeliveriesWeight > 0) {\n        throw errcode(new Error('invalid MeshMessageDeliveriesWeight; must be negative (or 0 to disable)'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.meshMessageDeliveriesWeight !== 0 && (p.meshMessageDeliveriesDecay <= 0 || p.meshMessageDeliveriesDecay >= 1)) {\n        throw errcode(new Error('invalid MeshMessageDeliveriesDecay; must be between 0 and 1'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.meshMessageDeliveriesWeight !== 0 && p.meshMessageDeliveriesCap <= 0) {\n        throw errcode(new Error('invalid MeshMessageDeliveriesCap; must be positive'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.meshMessageDeliveriesWeight !== 0 && p.meshMessageDeliveriesThreshold <= 0) {\n        throw errcode(new Error('invalid MeshMessageDeliveriesThreshold; must be positive'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.meshMessageDeliveriesWindow < 0) {\n        throw errcode(new Error('invalid MeshMessageDeliveriesWindow; must be non-negative'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.meshMessageDeliveriesWeight !== 0 && p.meshMessageDeliveriesActivation < 1000) {\n        throw errcode(new Error('invalid MeshMessageDeliveriesActivation; must be at least 1s'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    // check P3b\n    if (p.meshFailurePenaltyWeight > 0) {\n        throw errcode(new Error('invalid MeshFailurePenaltyWeight; must be negative (or 0 to disable)'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.meshFailurePenaltyWeight !== 0 && (p.meshFailurePenaltyDecay <= 0 || p.meshFailurePenaltyDecay >= 1)) {\n        throw errcode(new Error('invalid MeshFailurePenaltyDecay; must be between 0 and 1'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    // check P4\n    if (p.invalidMessageDeliveriesWeight > 0) {\n        throw errcode(new Error('invalid InvalidMessageDeliveriesWeight; must be negative (or 0 to disable)'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n    if (p.invalidMessageDeliveriesDecay <= 0 || p.invalidMessageDeliveriesDecay >= 1) {\n        throw errcode(new Error('invalid InvalidMessageDeliveriesDecay; must be between 0 and 1'), constants_1.ERR_INVALID_PEER_SCORE_PARAMS);\n    }\n}\nexports.validateTopicScoreParams = validateTopicScoreParams;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ERR_INVALID_PEER_SCORE_THRESHOLDS = exports.ERR_INVALID_PEER_SCORE_PARAMS = void 0;\nexports.ERR_INVALID_PEER_SCORE_PARAMS = 'ERR_INVALID_PEER_SCORE_PARAMS';\nexports.ERR_INVALID_PEER_SCORE_THRESHOLDS = 'ERR_INVALID_PEER_SCORE_THRESHOLDS';\n","'use strict';\n\nfunction assign(obj, props) {\n    for (const key in props) {\n        Object.defineProperty(obj, key, {\n            value: props[key],\n            enumerable: true,\n            configurable: true,\n        });\n    }\n\n    return obj;\n}\n\nfunction createError(err, code, props) {\n    if (!err || typeof err === 'string') {\n        throw new TypeError('Please pass an Error to err-code');\n    }\n\n    if (!props) {\n        props = {};\n    }\n\n    if (typeof code === 'object') {\n        props = code;\n        code = undefined;\n    }\n\n    if (code != null) {\n        props.code = code;\n    }\n\n    try {\n        return assign(err, props);\n    } catch (_) {\n        props.message = err.message;\n        props.stack = err.stack;\n\n        const ErrClass = function () {};\n\n        ErrClass.prototype = Object.create(Object.getPrototypeOf(err));\n\n        return assign(new ErrClass(), props);\n    }\n}\n\nmodule.exports = createError;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.validatePeerScoreThresholds = exports.createPeerScoreThresholds = exports.defaultPeerScoreThresholds = void 0;\nconst constants_1 = require(\"./constants\");\n// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n// @ts-ignore\nconst errcode = require(\"err-code\");\nexports.defaultPeerScoreThresholds = {\n    gossipThreshold: -10,\n    publishThreshold: -50,\n    graylistThreshold: -80,\n    acceptPXThreshold: 10,\n    opportunisticGraftThreshold: 20\n};\nfunction createPeerScoreThresholds(p = {}) {\n    return Object.assign(Object.assign({}, exports.defaultPeerScoreThresholds), p);\n}\nexports.createPeerScoreThresholds = createPeerScoreThresholds;\nfunction validatePeerScoreThresholds(p) {\n    if (p.gossipThreshold > 0) {\n        throw errcode(new Error('invalid gossip threshold; it must be <= 0'), constants_1.ERR_INVALID_PEER_SCORE_THRESHOLDS);\n    }\n    if (p.publishThreshold > 0 || p.publishThreshold > p.gossipThreshold) {\n        throw errcode(new Error('invalid publish threshold; it must be <= 0 and <= gossip threshold'), constants_1.ERR_INVALID_PEER_SCORE_THRESHOLDS);\n    }\n    if (p.graylistThreshold > 0 || p.graylistThreshold > p.publishThreshold) {\n        throw errcode(new Error('invalid graylist threshold; it must be <= 0 and <= publish threshold'), constants_1.ERR_INVALID_PEER_SCORE_THRESHOLDS);\n    }\n    if (p.acceptPXThreshold < 0) {\n        throw errcode(new Error('invalid accept PX threshold; it must be >= 0'), constants_1.ERR_INVALID_PEER_SCORE_THRESHOLDS);\n    }\n    if (p.opportunisticGraftThreshold < 0) {\n        throw errcode(new Error('invalid opportunistic grafting threshold; it must be >= 0'), constants_1.ERR_INVALID_PEER_SCORE_THRESHOLDS);\n    }\n}\nexports.validatePeerScoreThresholds = validatePeerScoreThresholds;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PeerScore = void 0;\nconst peer_score_params_1 = require(\"./peer-score-params\");\nconst peer_stats_1 = require(\"./peer-stats\");\nconst compute_score_1 = require(\"./compute-score\");\nconst message_deliveries_1 = require(\"./message-deliveries\");\nconst constants_1 = require(\"../constants\");\nconst peer_id_1 = __importDefault(require(\"peer-id\"));\nconst debug = require(\"debug\");\nconst pubsubErrors = require(\"libp2p-interfaces/src/pubsub/errors\");\nconst { ERR_INVALID_SIGNATURE, ERR_MISSING_SIGNATURE } = pubsubErrors.codes;\nconst log = debug('libp2p:gossipsub:score');\nclass PeerScore {\n    constructor(params, connectionManager, msgId) {\n        peer_score_params_1.validatePeerScoreParams(params);\n        this.params = params;\n        this._connectionManager = connectionManager;\n        this.peerStats = new Map();\n        this.peerIPs = new Map();\n        this.deliveryRecords = new message_deliveries_1.MessageDeliveries();\n        this.msgId = msgId;\n    }\n    /**\n     * Start PeerScore instance\n     * @returns {void}\n     */\n    start() {\n        if (this._backgroundInterval) {\n            log('Peer score already running');\n            return;\n        }\n        this._backgroundInterval = setInterval(() => this.background(), this.params.decayInterval);\n        log('started');\n    }\n    /**\n     * Stop PeerScore instance\n     * @returns {void}\n     */\n    stop() {\n        if (!this._backgroundInterval) {\n            log('Peer score already stopped');\n            return;\n        }\n        clearInterval(this._backgroundInterval);\n        delete this._backgroundInterval;\n        this.peerIPs.clear();\n        this.peerStats.clear();\n        this.deliveryRecords.clear();\n        log('stopped');\n    }\n    /**\n     * Periodic maintenance\n     * @returns {void}\n     */\n    background() {\n        this._refreshScores();\n        this._updateIPs();\n        this.deliveryRecords.gc();\n    }\n    /**\n     * Decays scores, and purges score records for disconnected peers once their expiry has elapsed.\n     * @returns {void}\n     */\n    _refreshScores() {\n        const now = Date.now();\n        const decayToZero = this.params.decayToZero;\n        this.peerStats.forEach((pstats, id) => {\n            if (!pstats.connected) {\n                // has the retention perious expired?\n                if (now > pstats.expire) {\n                    // yes, throw it away (but clean up the IP tracking first)\n                    this._removeIPs(id, pstats.ips);\n                    this.peerStats.delete(id);\n                }\n                // we don't decay retained scores, as the peer is not active.\n                // this way the peer cannot reset a negative score by simply disconnecting and reconnecting,\n                // unless the retention period has ellapsed.\n                // similarly, a well behaved peer does not lose its score by getting disconnected.\n                return;\n            }\n            Object.entries(pstats.topics).forEach(([topic, tstats]) => {\n                const tparams = this.params.topics[topic];\n                if (!tparams) {\n                    // we are not scoring this topic\n                    // should be unreachable, we only add scored topics to pstats\n                    return;\n                }\n                // decay counters\n                tstats.firstMessageDeliveries *= tparams.firstMessageDeliveriesDecay;\n                if (tstats.firstMessageDeliveries < decayToZero) {\n                    tstats.firstMessageDeliveries = 0;\n                }\n                tstats.meshMessageDeliveries *= tparams.meshMessageDeliveriesDecay;\n                if (tstats.meshMessageDeliveries < decayToZero) {\n                    tstats.meshMessageDeliveries = 0;\n                }\n                tstats.meshFailurePenalty *= tparams.meshFailurePenaltyDecay;\n                if (tstats.meshFailurePenalty < decayToZero) {\n                    tstats.meshFailurePenalty = 0;\n                }\n                tstats.invalidMessageDeliveries *= tparams.invalidMessageDeliveriesDecay;\n                if (tstats.invalidMessageDeliveries < decayToZero) {\n                    tstats.invalidMessageDeliveries = 0;\n                }\n                // update mesh time and activate mesh message delivery parameter if need be\n                if (tstats.inMesh) {\n                    tstats.meshTime = now - tstats.graftTime;\n                    if (tstats.meshTime > tparams.meshMessageDeliveriesActivation) {\n                        tstats.meshMessageDeliveriesActive = true;\n                    }\n                }\n            });\n            // decay P7 counter\n            pstats.behaviourPenalty *= this.params.behaviourPenaltyDecay;\n            if (pstats.behaviourPenalty < decayToZero) {\n                pstats.behaviourPenalty = 0;\n            }\n        });\n    }\n    /**\n     * Return the score for a peer\n     * @param {string} id\n     * @returns {Number}\n     */\n    score(id) {\n        const pstats = this.peerStats.get(id);\n        if (!pstats) {\n            return 0;\n        }\n        return compute_score_1.computeScore(id, pstats, this.params, this.peerIPs);\n    }\n    /**\n     * Apply a behavioural penalty to a peer\n     * @param {string} id\n     * @param {Number} penalty\n     * @returns {void}\n     */\n    addPenalty(id, penalty) {\n        const pstats = this.peerStats.get(id);\n        if (!pstats) {\n            return;\n        }\n        pstats.behaviourPenalty += penalty;\n    }\n    /**\n     * @param {string} id\n     * @returns {void}\n     */\n    addPeer(id) {\n        // create peer stats (not including topic stats for each topic to be scored)\n        // topic stats will be added as needed\n        const pstats = peer_stats_1.createPeerStats({\n            connected: true\n        });\n        this.peerStats.set(id, pstats);\n        // get + update peer IPs\n        const ips = this._getIPs(id);\n        this._setIPs(id, ips, pstats.ips);\n        pstats.ips = ips;\n    }\n    /**\n     * @param {string} id\n     * @returns {void}\n     */\n    removePeer(id) {\n        const pstats = this.peerStats.get(id);\n        if (!pstats) {\n            return;\n        }\n        // decide whether to retain the score; this currently only retains non-positive scores\n        // to dissuade attacks on the score function.\n        if (this.score(id) > 0) {\n            this._removeIPs(id, pstats.ips);\n            this.peerStats.delete(id);\n            return;\n        }\n        // furthermore, when we decide to retain the score, the firstMessageDelivery counters are\n        // reset to 0 and mesh delivery penalties applied.\n        Object.entries(pstats.topics).forEach(([topic, tstats]) => {\n            tstats.firstMessageDeliveries = 0;\n            const threshold = this.params.topics[topic].meshMessageDeliveriesThreshold;\n            if (tstats.inMesh && tstats.meshMessageDeliveriesActive && tstats.meshMessageDeliveries < threshold) {\n                const deficit = threshold - tstats.meshMessageDeliveries;\n                tstats.meshFailurePenalty += deficit * deficit;\n            }\n            tstats.inMesh = false;\n        });\n        pstats.connected = false;\n        pstats.expire = Date.now() + this.params.retainScore;\n    }\n    /**\n     * @param {string} id\n     * @param {String} topic\n     * @returns {void}\n     */\n    graft(id, topic) {\n        const pstats = this.peerStats.get(id);\n        if (!pstats) {\n            return;\n        }\n        const tstats = peer_stats_1.ensureTopicStats(topic, pstats, this.params);\n        if (!tstats) {\n            return;\n        }\n        tstats.inMesh = true;\n        tstats.graftTime = Date.now();\n        tstats.meshTime = 0;\n        tstats.meshMessageDeliveriesActive = false;\n    }\n    /**\n     * @param {string} id\n     * @param {string} topic\n     * @returns {void}\n     */\n    prune(id, topic) {\n        const pstats = this.peerStats.get(id);\n        if (!pstats) {\n            return;\n        }\n        const tstats = peer_stats_1.ensureTopicStats(topic, pstats, this.params);\n        if (!tstats) {\n            return;\n        }\n        // sticky mesh delivery rate failure penalty\n        const threshold = this.params.topics[topic].meshMessageDeliveriesThreshold;\n        if (tstats.meshMessageDeliveriesActive && tstats.meshMessageDeliveries < threshold) {\n            const deficit = threshold - tstats.meshMessageDeliveries;\n            tstats.meshFailurePenalty += deficit * deficit;\n        }\n        tstats.inMesh = false;\n    }\n    /**\n     * @param {InMessage} message\n     * @returns {void}\n     */\n    validateMessage(message) {\n        this.deliveryRecords.ensureRecord(this.msgId(message));\n    }\n    /**\n     * @param {InMessage} message\n     * @returns {void}\n     */\n    deliverMessage(message) {\n        const id = message.receivedFrom;\n        this._markFirstMessageDelivery(id, message);\n        const drec = this.deliveryRecords.ensureRecord(this.msgId(message));\n        const now = Date.now();\n        // defensive check that this is the first delivery trace -- delivery status should be unknown\n        if (drec.status !== message_deliveries_1.DeliveryRecordStatus.unknown) {\n            log('unexpected delivery: message from %s was first seen %s ago and has delivery status %d', id, now - drec.firstSeen, message_deliveries_1.DeliveryRecordStatus[drec.status]);\n            return;\n        }\n        // mark the message as valid and reward mesh peers that have already forwarded it to us\n        drec.status = message_deliveries_1.DeliveryRecordStatus.valid;\n        drec.validated = now;\n        drec.peers.forEach(p => {\n            // this check is to make sure a peer can't send us a message twice and get a double count\n            // if it is a first delivery.\n            if (p !== id) {\n                this._markDuplicateMessageDelivery(p, message);\n            }\n        });\n    }\n    /**\n     * @param {InMessage} message\n     * @param {string} reason\n     * @returns {void}\n     */\n    rejectMessage(message, reason) {\n        const id = message.receivedFrom;\n        switch (reason) {\n            case ERR_MISSING_SIGNATURE:\n            case ERR_INVALID_SIGNATURE:\n                this._markInvalidMessageDelivery(id, message);\n                return;\n        }\n        const drec = this.deliveryRecords.ensureRecord(this.msgId(message));\n        // defensive check that this is the first rejection -- delivery status should be unknown\n        if (drec.status !== message_deliveries_1.DeliveryRecordStatus.unknown) {\n            log('unexpected rejection: message from %s was first seen %s ago and has delivery status %d', id, Date.now() - drec.firstSeen, message_deliveries_1.DeliveryRecordStatus[drec.status]);\n            return;\n        }\n        switch (reason) {\n            case constants_1.ERR_TOPIC_VALIDATOR_IGNORE:\n                // we were explicitly instructed by the validator to ignore the message but not penalize the peer\n                drec.status = message_deliveries_1.DeliveryRecordStatus.ignored;\n                return;\n        }\n        // mark the message as invalid and penalize peers that have already forwarded it.\n        drec.status = message_deliveries_1.DeliveryRecordStatus.invalid;\n        this._markInvalidMessageDelivery(id, message);\n        drec.peers.forEach(p => {\n            this._markInvalidMessageDelivery(p, message);\n        });\n    }\n    /**\n     * @param {InMessage} message\n     * @returns {void}\n     */\n    duplicateMessage(message) {\n        const id = message.receivedFrom;\n        const drec = this.deliveryRecords.ensureRecord(this.msgId(message));\n        if (drec.peers.has(id)) {\n            // we have already seen this duplicate\n            return;\n        }\n        switch (drec.status) {\n            case message_deliveries_1.DeliveryRecordStatus.unknown:\n                // the message is being validated; track the peer delivery and wait for\n                // the Deliver/Reject/Ignore notification.\n                drec.peers.add(id);\n                break;\n            case message_deliveries_1.DeliveryRecordStatus.valid:\n                // mark the peer delivery time to only count a duplicate delivery once.\n                drec.peers.add(id);\n                this._markDuplicateMessageDelivery(id, message, drec.validated);\n                break;\n            case message_deliveries_1.DeliveryRecordStatus.invalid:\n                // we no longer track delivery time\n                this._markInvalidMessageDelivery(id, message);\n                break;\n        }\n    }\n    /**\n     * Increments the \"invalid message deliveries\" counter for all scored topics the message is published in.\n     * @param {string} id\n     * @param {InMessage} message\n     * @returns {void}\n     */\n    _markInvalidMessageDelivery(id, message) {\n        const pstats = this.peerStats.get(id);\n        if (!pstats) {\n            return;\n        }\n        message.topicIDs.forEach(topic => {\n            const tstats = peer_stats_1.ensureTopicStats(topic, pstats, this.params);\n            if (!tstats) {\n                return;\n            }\n            tstats.invalidMessageDeliveries += 1;\n        });\n    }\n    /**\n     * Increments the \"first message deliveries\" counter for all scored topics the message is published in,\n     * as well as the \"mesh message deliveries\" counter, if the peer is in the mesh for the topic.\n     * @param {string} id\n     * @param {InMessage} message\n     * @returns {void}\n     */\n    _markFirstMessageDelivery(id, message) {\n        const pstats = this.peerStats.get(id);\n        if (!pstats) {\n            return;\n        }\n        message.topicIDs.forEach(topic => {\n            const tstats = peer_stats_1.ensureTopicStats(topic, pstats, this.params);\n            if (!tstats) {\n                return;\n            }\n            let cap = this.params.topics[topic].firstMessageDeliveriesCap;\n            tstats.firstMessageDeliveries += 1;\n            if (tstats.firstMessageDeliveries > cap) {\n                tstats.firstMessageDeliveries = cap;\n            }\n            if (!tstats.inMesh) {\n                return;\n            }\n            cap = this.params.topics[topic].meshMessageDeliveriesCap;\n            tstats.meshMessageDeliveries += 1;\n            if (tstats.meshMessageDeliveries > cap) {\n                tstats.meshMessageDeliveries = cap;\n            }\n        });\n    }\n    /**\n     * Increments the \"mesh message deliveries\" counter for messages we've seen before,\n     * as long the message was received within the P3 window.\n     * @param {string} id\n     * @param {InMessage} message\n     * @param {number} validatedTime\n     * @returns {void}\n     */\n    _markDuplicateMessageDelivery(id, message, validatedTime = 0) {\n        const pstats = this.peerStats.get(id);\n        if (!pstats) {\n            return;\n        }\n        const now = validatedTime ? Date.now() : 0;\n        message.topicIDs.forEach(topic => {\n            const tstats = peer_stats_1.ensureTopicStats(topic, pstats, this.params);\n            if (!tstats) {\n                return;\n            }\n            if (!tstats.inMesh) {\n                return;\n            }\n            const tparams = this.params.topics[topic];\n            // check against the mesh delivery window -- if the validated time is passed as 0, then\n            // the message was received before we finished validation and thus falls within the mesh\n            // delivery window.\n            if (validatedTime && now > validatedTime + tparams.meshMessageDeliveriesWindow) {\n                return;\n            }\n            const cap = tparams.meshMessageDeliveriesCap;\n            tstats.meshMessageDeliveries += 1;\n            if (tstats.meshMessageDeliveries > cap) {\n                tstats.meshMessageDeliveries = cap;\n            }\n        });\n    }\n    /**\n     * Gets the current IPs for a peer.\n     * @param {string} id\n     * @returns {Array<string>}\n     */\n    _getIPs(id) {\n        return this._connectionManager.getAll(peer_id_1.default.createFromB58String(id))\n            .map(c => c.remoteAddr.toOptions().host);\n    }\n    /**\n     * Adds tracking for the new IPs in the list, and removes tracking from the obsolete IPs.\n     * @param {string} id\n     * @param {Array<string>} newIPs\n     * @param {Array<string>} oldIPs\n     * @returns {void}\n     */\n    _setIPs(id, newIPs, oldIPs) {\n        // add the new IPs to the tracking\n        // eslint-disable-next-line no-labels\n        addNewIPs: for (const ip of newIPs) {\n            // check if it is in the old ips list\n            for (const xip of oldIPs) {\n                if (ip === xip) {\n                    // eslint-disable-next-line no-labels\n                    continue addNewIPs;\n                }\n            }\n            // no, it's a new one -- add it to the tracker\n            let peers = this.peerIPs.get(ip);\n            if (!peers) {\n                peers = new Set();\n                this.peerIPs.set(ip, peers);\n            }\n            peers.add(id);\n        }\n        // remove the obsolete old IPs from the tracking\n        // eslint-disable-next-line no-labels\n        removeOldIPs: for (const ip of oldIPs) {\n            // check if it is in the new ips list\n            for (const xip of newIPs) {\n                if (ip === xip) {\n                    // eslint-disable-next-line no-labels\n                    continue removeOldIPs;\n                }\n            }\n            // no, its obselete -- remove it from the tracker\n            const peers = this.peerIPs.get(ip);\n            if (!peers) {\n                continue;\n            }\n            peers.delete(id);\n            if (!peers.size) {\n                this.peerIPs.delete(ip);\n            }\n        }\n    }\n    /**\n     * Removes an IP list from the tracking list for a peer.\n     * @param {string} id\n     * @param {Array<string>} ips\n     * @returns {void}\n     */\n    _removeIPs(id, ips) {\n        ips.forEach(ip => {\n            const peers = this.peerIPs.get(ip);\n            if (!peers) {\n                return;\n            }\n            peers.delete(id);\n            if (!peers.size) {\n                this.peerIPs.delete(ip);\n            }\n        });\n    }\n    /**\n     * Update all peer IPs to currently open connections\n     * @returns {void}\n     */\n    _updateIPs() {\n        this.peerStats.forEach((pstats, id) => {\n            const newIPs = this._getIPs(id);\n            this._setIPs(id, newIPs, pstats.ips);\n            pstats.ips = newIPs;\n        });\n    }\n}\nexports.PeerScore = PeerScore;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.ensureTopicStats = exports.createTopicStats = exports.createPeerStats = void 0;\nfunction createPeerStats(ps = {}) {\n    return Object.assign(Object.assign({ connected: false, expire: 0, ips: [], behaviourPenalty: 0 }, ps), { topics: ps.topics\n            ? Object.entries(ps.topics)\n                .reduce((topics, [topic, topicStats]) => {\n                topics[topic] = createTopicStats(topicStats);\n                return topics;\n            }, {})\n            : {} });\n}\nexports.createPeerStats = createPeerStats;\nfunction createTopicStats(ts = {}) {\n    return Object.assign({ inMesh: false, graftTime: 0, meshTime: 0, firstMessageDeliveries: 0, meshMessageDeliveries: 0, meshMessageDeliveriesActive: false, meshFailurePenalty: 0, invalidMessageDeliveries: 0 }, ts);\n}\nexports.createTopicStats = createTopicStats;\nfunction ensureTopicStats(topic, ps, params) {\n    let ts = ps.topics[topic];\n    if (ts) {\n        return ts;\n    }\n    if (!params.topics[topic]) {\n        return undefined;\n    }\n    ps.topics[topic] = ts = createTopicStats();\n    return ts;\n}\nexports.ensureTopicStats = ensureTopicStats;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.computeScore = void 0;\nfunction computeScore(peer, pstats, params, peerIPs) {\n    let score = 0;\n    // topic stores\n    Object.entries(pstats.topics).forEach(([topic, tstats]) => {\n        // the topic parameters\n        const topicParams = params.topics[topic];\n        if (!topicParams) {\n            // we are not scoring this topic\n            return;\n        }\n        let topicScore = 0;\n        // P1: time in Mesh\n        if (tstats.inMesh) {\n            let p1 = tstats.meshTime / topicParams.timeInMeshQuantum;\n            if (p1 > topicParams.timeInMeshCap) {\n                p1 = topicParams.timeInMeshCap;\n            }\n            topicScore += p1 * topicParams.timeInMeshWeight;\n        }\n        // P2: first message deliveries\n        const p2 = tstats.firstMessageDeliveries;\n        topicScore += p2 * topicParams.firstMessageDeliveriesWeight;\n        // P3: mesh message deliveries\n        if (tstats.meshMessageDeliveriesActive) {\n            if (tstats.meshMessageDeliveries < topicParams.meshMessageDeliveriesThreshold) {\n                const deficit = topicParams.meshMessageDeliveriesThreshold - tstats.meshMessageDeliveries;\n                const p3 = deficit * deficit;\n                topicScore += p3 * topicParams.meshMessageDeliveriesWeight;\n            }\n        }\n        // P3b:\n        // NOTE: the weight of P3b is negative (validated in validateTopicScoreParams) so this detracts\n        const p3b = tstats.meshFailurePenalty;\n        topicScore += p3b * topicParams.meshFailurePenaltyWeight;\n        // P4: invalid messages\n        // NOTE: the weight of P4 is negative (validated in validateTopicScoreParams) so this detracts\n        const p4 = tstats.invalidMessageDeliveries * tstats.invalidMessageDeliveries;\n        topicScore += p4 * topicParams.invalidMessageDeliveriesWeight;\n        // update score, mixing with topic weight\n        score += topicScore * topicParams.topicWeight;\n    });\n    // apply the topic score cap, if any\n    if (params.topicScoreCap > 0 && score > params.topicScoreCap) {\n        score = params.topicScoreCap;\n    }\n    // P5: application-specific score\n    const p5 = params.appSpecificScore(peer);\n    score += p5 * params.appSpecificWeight;\n    // P6: IP colocation factor\n    pstats.ips.forEach(ip => {\n        if (params.IPColocationFactorWhitelist.has(ip)) {\n            return;\n        }\n        // P6 has a cliff (IPColocationFactorThreshold)\n        // It's only applied if at least that many peers are connected to us from that source IP addr.\n        // It is quadratic, and the weight is negative (validated in validatePeerScoreParams)\n        const peersInIP = peerIPs.get(ip);\n        const numPeersInIP = peersInIP ? peersInIP.size : 0;\n        if (numPeersInIP > params.IPColocationFactorThreshold) {\n            const surplus = numPeersInIP - params.IPColocationFactorThreshold;\n            const p6 = surplus * surplus;\n            score += p6 * params.IPColocationFactorWeight;\n        }\n    });\n    // P7: behavioural pattern penalty\n    const p7 = pstats.behaviourPenalty * pstats.behaviourPenalty;\n    score += p7 * params.behaviourPenaltyWeight;\n    return score;\n}\nexports.computeScore = computeScore;\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n    return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.MessageDeliveries = exports.DeliveryRecordStatus = void 0;\nconst constants_1 = require(\"../constants\");\nconst denque_1 = __importDefault(require(\"denque\"));\nconst utils_1 = require(\"../utils\");\nvar DeliveryRecordStatus;\n(function (DeliveryRecordStatus) {\n    /**\n     * we don't know (yet) if the message is valid\n     */\n    DeliveryRecordStatus[DeliveryRecordStatus[\"unknown\"] = 0] = \"unknown\";\n    /**\n     * we know the message is valid\n     */\n    DeliveryRecordStatus[DeliveryRecordStatus[\"valid\"] = 1] = \"valid\";\n    /**\n     * we know the message is invalid\n     */\n    DeliveryRecordStatus[DeliveryRecordStatus[\"invalid\"] = 2] = \"invalid\";\n    /**\n     * we were instructed by the validator to ignore the message\n     */\n    DeliveryRecordStatus[DeliveryRecordStatus[\"ignored\"] = 3] = \"ignored\";\n})(DeliveryRecordStatus = exports.DeliveryRecordStatus || (exports.DeliveryRecordStatus = {}));\n/**\n * Map of message ID to DeliveryRecord\n *\n * Maintains an internal queue for efficient gc of old messages\n */\nclass MessageDeliveries {\n    constructor() {\n        this.records = new Map();\n        this.queue = new denque_1.default();\n    }\n    ensureRecord(msgId) {\n        const msgIdStr = utils_1.messageIdToString(msgId);\n        let drec = this.records.get(msgIdStr);\n        if (drec) {\n            return drec;\n        }\n        // record doesn't exist yet\n        // create record\n        drec = {\n            status: DeliveryRecordStatus.unknown,\n            firstSeen: Date.now(),\n            validated: 0,\n            peers: new Set()\n        };\n        this.records.set(msgIdStr, drec);\n        // and add msgId to the queue\n        const entry = {\n            msgId: msgIdStr,\n            expire: Date.now() + constants_1.TimeCacheDuration\n        };\n        this.queue.push(entry);\n        return drec;\n    }\n    gc() {\n        const now = Date.now();\n        // queue is sorted by expiry time\n        // remove expired messages, remove from queue until first un-expired message found\n        let head = this.queue.peekFront();\n        while (head && head.expire < now) {\n            this.records.delete(head.msgId);\n            this.queue.shift();\n            head = this.queue.peekFront();\n        }\n    }\n    clear() {\n        this.records.clear();\n        this.queue.clear();\n    }\n}\nexports.MessageDeliveries = MessageDeliveries;\n","'use strict';\n\n/**\n * Custom implementation of a double ended queue.\n */\nfunction Denque(array, options) {\n  var options = options || {};\n\n  this._head = 0;\n  this._tail = 0;\n  this._capacity = options.capacity;\n  this._capacityMask = 0x3;\n  this._list = new Array(4);\n  if (Array.isArray(array)) {\n    this._fromArray(array);\n  }\n}\n\n/**\n * -------------\n *  PUBLIC API\n * -------------\n */\n\n/**\n * Returns the item at the specified index from the list.\n * 0 is the first element, 1 is the second, and so on...\n * Elements at negative values are that many from the end: -1 is one before the end\n * (the last element), -2 is two before the end (one before last), etc.\n * @param index\n * @returns {*}\n */\nDenque.prototype.peekAt = function peekAt(index) {\n  var i = index;\n  // expect a number or return undefined\n  if ((i !== (i | 0))) {\n    return void 0;\n  }\n  var len = this.size();\n  if (i >= len || i < -len) return undefined;\n  if (i < 0) i += len;\n  i = (this._head + i) & this._capacityMask;\n  return this._list[i];\n};\n\n/**\n * Alias for peekAt()\n * @param i\n * @returns {*}\n */\nDenque.prototype.get = function get(i) {\n  return this.peekAt(i);\n};\n\n/**\n * Returns the first item in the list without removing it.\n * @returns {*}\n */\nDenque.prototype.peek = function peek() {\n  if (this._head === this._tail) return undefined;\n  return this._list[this._head];\n};\n\n/**\n * Alias for peek()\n * @returns {*}\n */\nDenque.prototype.peekFront = function peekFront() {\n  return this.peek();\n};\n\n/**\n * Returns the item that is at the back of the queue without removing it.\n * Uses peekAt(-1)\n */\nDenque.prototype.peekBack = function peekBack() {\n  return this.peekAt(-1);\n};\n\n/**\n * Returns the current length of the queue\n * @return {Number}\n */\nObject.defineProperty(Denque.prototype, 'length', {\n  get: function length() {\n    return this.size();\n  }\n});\n\n/**\n * Return the number of items on the list, or 0 if empty.\n * @returns {number}\n */\nDenque.prototype.size = function size() {\n  if (this._head === this._tail) return 0;\n  if (this._head < this._tail) return this._tail - this._head;\n  else return this._capacityMask + 1 - (this._head - this._tail);\n};\n\n/**\n * Add an item at the beginning of the list.\n * @param item\n */\nDenque.prototype.unshift = function unshift(item) {\n  if (item === undefined) return this.size();\n  var len = this._list.length;\n  this._head = (this._head - 1 + len) & this._capacityMask;\n  this._list[this._head] = item;\n  if (this._tail === this._head) this._growArray();\n  if (this._capacity && this.size() > this._capacity) this.pop();\n  if (this._head < this._tail) return this._tail - this._head;\n  else return this._capacityMask + 1 - (this._head - this._tail);\n};\n\n/**\n * Remove and return the first item on the list,\n * Returns undefined if the list is empty.\n * @returns {*}\n */\nDenque.prototype.shift = function shift() {\n  var head = this._head;\n  if (head === this._tail) return undefined;\n  var item = this._list[head];\n  this._list[head] = undefined;\n  this._head = (head + 1) & this._capacityMask;\n  if (head < 2 && this._tail > 10000 && this._tail <= this._list.length >>> 2) this._shrinkArray();\n  return item;\n};\n\n/**\n * Add an item to the bottom of the list.\n * @param item\n */\nDenque.prototype.push = function push(item) {\n  if (item === undefined) return this.size();\n  var tail = this._tail;\n  this._list[tail] = item;\n  this._tail = (tail + 1) & this._capacityMask;\n  if (this._tail === this._head) {\n    this._growArray();\n  }\n  if (this._capacity && this.size() > this._capacity) {\n    this.shift();\n  }\n  if (this._head < this._tail) return this._tail - this._head;\n  else return this._capacityMask + 1 - (this._head - this._tail);\n};\n\n/**\n * Remove and return the last item on the list.\n * Returns undefined if the list is empty.\n * @returns {*}\n */\nDenque.prototype.pop = function pop() {\n  var tail = this._tail;\n  if (tail === this._head) return undefined;\n  var len = this._list.length;\n  this._tail = (tail - 1 + len) & this._capacityMask;\n  var item = this._list[this._tail];\n  this._list[this._tail] = undefined;\n  if (this._head < 2 && tail > 10000 && tail <= len >>> 2) this._shrinkArray();\n  return item;\n};\n\n/**\n * Remove and return the item at the specified index from the list.\n * Returns undefined if the list is empty.\n * @param index\n * @returns {*}\n */\nDenque.prototype.removeOne = function removeOne(index) {\n  var i = index;\n  // expect a number or return undefined\n  if ((i !== (i | 0))) {\n    return void 0;\n  }\n  if (this._head === this._tail) return void 0;\n  var size = this.size();\n  var len = this._list.length;\n  if (i >= size || i < -size) return void 0;\n  if (i < 0) i += size;\n  i = (this._head + i) & this._capacityMask;\n  var item = this._list[i];\n  var k;\n  if (index < size / 2) {\n    for (k = index; k > 0; k--) {\n      this._list[i] = this._list[i = (i - 1 + len) & this._capacityMask];\n    }\n    this._list[i] = void 0;\n    this._head = (this._head + 1 + len) & this._capacityMask;\n  } else {\n    for (k = size - 1 - index; k > 0; k--) {\n      this._list[i] = this._list[i = ( i + 1 + len) & this._capacityMask];\n    }\n    this._list[i] = void 0;\n    this._tail = (this._tail - 1 + len) & this._capacityMask;\n  }\n  return item;\n};\n\n/**\n * Remove number of items from the specified index from the list.\n * Returns array of removed items.\n * Returns undefined if the list is empty.\n * @param index\n * @param count\n * @returns {array}\n */\nDenque.prototype.remove = function remove(index, count) {\n  var i = index;\n  var removed;\n  var del_count = count;\n  // expect a number or return undefined\n  if ((i !== (i | 0))) {\n    return void 0;\n  }\n  if (this._head === this._tail) return void 0;\n  var size = this.size();\n  var len = this._list.length;\n  if (i >= size || i < -size || count < 1) return void 0;\n  if (i < 0) i += size;\n  if (count === 1 || !count) {\n    removed = new Array(1);\n    removed[0] = this.removeOne(i);\n    return removed;\n  }\n  if (i === 0 && i + count >= size) {\n    removed = this.toArray();\n    this.clear();\n    return removed;\n  }\n  if (i + count > size) count = size - i;\n  var k;\n  removed = new Array(count);\n  for (k = 0; k < count; k++) {\n    removed[k] = this._list[(this._head + i + k) & this._capacityMask];\n  }\n  i = (this._head + i) & this._capacityMask;\n  if (index + count === size) {\n    this._tail = (this._tail - count + len) & this._capacityMask;\n    for (k = count; k > 0; k--) {\n      this._list[i = (i + 1 + len) & this._capacityMask] = void 0;\n    }\n    return removed;\n  }\n  if (index === 0) {\n    this._head = (this._head + count + len) & this._capacityMask;\n    for (k = count - 1; k > 0; k--) {\n      this._list[i = (i + 1 + len) & this._capacityMask] = void 0;\n    }\n    return removed;\n  }\n  if (i < size / 2) {\n    this._head = (this._head + index + count + len) & this._capacityMask;\n    for (k = index; k > 0; k--) {\n      this.unshift(this._list[i = (i - 1 + len) & this._capacityMask]);\n    }\n    i = (this._head - 1 + len) & this._capacityMask;\n    while (del_count > 0) {\n      this._list[i = (i - 1 + len) & this._capacityMask] = void 0;\n      del_count--;\n    }\n    if (index < 0) this._tail = i;\n  } else {\n    this._tail = i;\n    i = (i + count + len) & this._capacityMask;\n    for (k = size - (count + index); k > 0; k--) {\n      this.push(this._list[i++]);\n    }\n    i = this._tail;\n    while (del_count > 0) {\n      this._list[i = (i + 1 + len) & this._capacityMask] = void 0;\n      del_count--;\n    }\n  }\n  if (this._head < 2 && this._tail > 10000 && this._tail <= len >>> 2) this._shrinkArray();\n  return removed;\n};\n\n/**\n * Native splice implementation.\n * Remove number of items from the specified index from the list and/or add new elements.\n * Returns array of removed items or empty array if count == 0.\n * Returns undefined if the list is empty.\n *\n * @param index\n * @param count\n * @param {...*} [elements]\n * @returns {array}\n */\nDenque.prototype.splice = function splice(index, count) {\n  var i = index;\n  // expect a number or return undefined\n  if ((i !== (i | 0))) {\n    return void 0;\n  }\n  var size = this.size();\n  if (i < 0) i += size;\n  if (i > size) return void 0;\n  if (arguments.length > 2) {\n    var k;\n    var temp;\n    var removed;\n    var arg_len = arguments.length;\n    var len = this._list.length;\n    var arguments_index = 2;\n    if (!size || i < size / 2) {\n      temp = new Array(i);\n      for (k = 0; k < i; k++) {\n        temp[k] = this._list[(this._head + k) & this._capacityMask];\n      }\n      if (count === 0) {\n        removed = [];\n        if (i > 0) {\n          this._head = (this._head + i + len) & this._capacityMask;\n        }\n      } else {\n        removed = this.remove(i, count);\n        this._head = (this._head + i + len) & this._capacityMask;\n      }\n      while (arg_len > arguments_index) {\n        this.unshift(arguments[--arg_len]);\n      }\n      for (k = i; k > 0; k--) {\n        this.unshift(temp[k - 1]);\n      }\n    } else {\n      temp = new Array(size - (i + count));\n      var leng = temp.length;\n      for (k = 0; k < leng; k++) {\n        temp[k] = this._list[(this._head + i + count + k) & this._capacityMask];\n      }\n      if (count === 0) {\n        removed = [];\n        if (i != size) {\n          this._tail = (this._head + i + len) & this._capacityMask;\n        }\n      } else {\n        removed = this.remove(i, count);\n        this._tail = (this._tail - leng + len) & this._capacityMask;\n      }\n      while (arguments_index < arg_len) {\n        this.push(arguments[arguments_index++]);\n      }\n      for (k = 0; k < leng; k++) {\n        this.push(temp[k]);\n      }\n    }\n    return removed;\n  } else {\n    return this.remove(i, count);\n  }\n};\n\n/**\n * Soft clear - does not reset capacity.\n */\nDenque.prototype.clear = function clear() {\n  this._head = 0;\n  this._tail = 0;\n};\n\n/**\n * Returns true or false whether the list is empty.\n * @returns {boolean}\n */\nDenque.prototype.isEmpty = function isEmpty() {\n  return this._head === this._tail;\n};\n\n/**\n * Returns an array of all queue items.\n * @returns {Array}\n */\nDenque.prototype.toArray = function toArray() {\n  return this._copyArray(false);\n};\n\n/**\n * -------------\n *   INTERNALS\n * -------------\n */\n\n/**\n * Fills the queue with items from an array\n * For use in the constructor\n * @param array\n * @private\n */\nDenque.prototype._fromArray = function _fromArray(array) {\n  for (var i = 0; i < array.length; i++) this.push(array[i]);\n};\n\n/**\n *\n * @param fullCopy\n * @returns {Array}\n * @private\n */\nDenque.prototype._copyArray = function _copyArray(fullCopy) {\n  var newArray = [];\n  var list = this._list;\n  var len = list.length;\n  var i;\n  if (fullCopy || this._head > this._tail) {\n    for (i = this._head; i < len; i++) newArray.push(list[i]);\n    for (i = 0; i < this._tail; i++) newArray.push(list[i]);\n  } else {\n    for (i = this._head; i < this._tail; i++) newArray.push(list[i]);\n  }\n  return newArray;\n};\n\n/**\n * Grows the internal list array.\n * @private\n */\nDenque.prototype._growArray = function _growArray() {\n  if (this._head) {\n    // copy existing data, head to end, then beginning to tail.\n    this._list = this._copyArray(true);\n    this._head = 0;\n  }\n\n  // head is at 0 and array is now full, safe to extend\n  this._tail = this._list.length;\n\n  this._list.length *= 2;\n  this._capacityMask = (this._capacityMask << 1) | 1;\n};\n\n/**\n * Shrinks the internal list array.\n * @private\n */\nDenque.prototype._shrinkArray = function _shrinkArray() {\n  this._list.length >>>= 1;\n  this._capacityMask >>>= 1;\n};\n\n\nmodule.exports = Denque;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.IWantTracer = void 0;\nconst constants_1 = require(\"./constants\");\nconst utils_1 = require(\"./utils\");\nconst pubsubErrors = require(\"libp2p-interfaces/src/pubsub/errors\");\nconst { ERR_INVALID_SIGNATURE, ERR_MISSING_SIGNATURE } = pubsubErrors.codes;\n/**\n * IWantTracer is an internal tracer that tracks IWANT requests in order to penalize\n * peers who don't follow up on IWANT requests after an IHAVE advertisement.\n * The tracking of promises is probabilistic to avoid using too much memory.\n *\n * Note: Do not confuse these 'promises' with JS Promise objects.\n * These 'promises' are merely expectations of a peer's behavior.\n */\nclass IWantTracer {\n    constructor(getMsgId) {\n        this.getMsgId = getMsgId;\n        this.promises = new Map();\n    }\n    /**\n     * Track a promise to deliver a message from a list of msgIDs we are requesting\n     * @param {string} p peer id\n     * @param {string[]} msgIds\n     * @returns {void}\n     */\n    addPromise(p, msgIds) {\n        // pick msgId randomly from the list\n        const ix = Math.floor(Math.random() * msgIds.length);\n        const msgId = msgIds[ix];\n        const msgIdStr = utils_1.messageIdToString(msgId);\n        let peers = this.promises.get(msgIdStr);\n        if (!peers) {\n            peers = new Map();\n            this.promises.set(msgIdStr, peers);\n        }\n        if (!peers.has(p)) {\n            peers.set(p, Date.now() + constants_1.GossipsubIWantFollowupTime);\n        }\n    }\n    /**\n     * Returns the number of broken promises for each peer who didn't follow up on an IWANT request.\n     * @returns {Map<string, number>}\n     */\n    getBrokenPromises() {\n        const now = Date.now();\n        const result = new Map();\n        this.promises.forEach((peers, msgId) => {\n            peers.forEach((expire, p) => {\n                // the promise has been broken\n                if (expire < now) {\n                    // add 1 to result\n                    result.set(p, (result.get(p) || 0) + 1);\n                    // delete from tracked promises\n                    peers.delete(p);\n                }\n            });\n            // clean up empty promises for a msgId\n            if (!peers.size) {\n                this.promises.delete(msgId);\n            }\n        });\n        return result;\n    }\n    /**\n     * Someone delivered a message, stop tracking promises for it\n     * @param {InMessage} msg\n     * @returns {void}\n     */\n    deliverMessage(msg) {\n        const msgId = this.getMsgId(msg);\n        const msgIdStr = utils_1.messageIdToString(msgId);\n        this.promises.delete(msgIdStr);\n    }\n    /**\n     * A message got rejected, so we can stop tracking promises and let the score penalty apply from invalid message delivery,\n     * unless its an obviously invalid message.\n     * @param {InMessage} msg\n     * @param {string} reason\n     * @returns {void}\n     */\n    rejectMessage(msg, reason) {\n        switch (reason) {\n            case ERR_INVALID_SIGNATURE:\n            case ERR_MISSING_SIGNATURE:\n                return;\n        }\n        const msgId = this.getMsgId(msg);\n        const msgIdStr = utils_1.messageIdToString(msgId);\n        this.promises.delete(msgIdStr);\n    }\n    clear() {\n        this.promises.clear();\n    }\n}\nexports.IWantTracer = IWantTracer;\n","'use strict'\n\nconst throttle = require('lodash.throttle')\nexports = module.exports = TimeCache\n\nfunction TimeCache (options) {\n  if (!(this instanceof TimeCache)) {\n    return new TimeCache(options)\n  }\n\n  options = options || {}\n\n  const validity = options.validity || 30 // seconds\n\n  const entries = new Map()\n\n  const sweep = throttle(() => {\n    entries.forEach((entry, key) => {\n      const v = entry.validity || validity\n      const delta = getTimeElapsed(entry.timestamp)\n      if (delta > v) {\n        entries.delete(key)\n      }\n    })\n  }, 200)\n\n  this.put = (key, value, validity) => {\n    if (!this.has(key)) {\n      entries.set(key, {\n        value: value,\n        timestamp: new Date(),\n        validity: validity\n      })\n    }\n\n    sweep()\n  }\n\n  this.get = (key) => {\n    if (entries.has(key)) {\n      return entries.get(key).value\n    } else {\n      throw new Error('key does not exist')\n    }\n  }\n\n  this.has = (key) => {\n    return entries.has(key)\n  }\n}\n\nfunction getTimeElapsed (prevTime) {\n  const currentTime = new Date()\n  const a = currentTime.getTime() - prevTime.getTime()\n\n  return Math.floor(a / 1000)\n}\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the `TypeError` message for \"Functions\" methods. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        result = wait - timeSinceLastCall;\n\n    return maxing ? nativeMin(result, maxWait - timeSinceLastInvoke) : result;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\n/**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n *  Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\nfunction throttle(func, wait, options) {\n  var leading = true,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  if (isObject(options)) {\n    leading = 'leading' in options ? !!options.leading : leading;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n  return debounce(func, wait, {\n    'leading': leading,\n    'maxWait': wait,\n    'trailing': trailing\n  });\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && objectToString.call(value) == symbolTag);\n}\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = value.replace(reTrim, '');\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = throttle;\n","'use strict'\n\nconst errCode = require('err-code')\nconst uint8arraysConcat = require('uint8arrays/concat')\nconst uint8arraysFromString = require('uint8arrays/from-string')\n// @ts-ignore libp2p-crypto does not support types\nconst cryptoKeys = require('libp2p-crypto/src/keys')\nconst PeerId = require('peer-id')\nconst varint = require('varint')\nconst uint8arraysEquals = require('uint8arrays/equals')\n\nconst { codes } = require('../../errors')\nconst { Envelope: Protobuf } = require('./envelope')\n\n/**\n * @typedef {import('libp2p-interfaces/src/record/types').Record} Record\n */\n\nclass Envelope {\n  /**\n   * The Envelope is responsible for keeping an arbitrary signed record\n   * by a libp2p peer.\n   *\n   * @class\n   * @param {object} params\n   * @param {PeerId} params.peerId\n   * @param {Uint8Array} params.payloadType\n   * @param {Uint8Array} params.payload - marshaled record\n   * @param {Uint8Array} params.signature - signature of the domain string :: type hint :: payload.\n   */\n  constructor ({ peerId, payloadType, payload, signature }) {\n    this.peerId = peerId\n    this.payloadType = payloadType\n    this.payload = payload\n    this.signature = signature\n\n    // Cache\n    this._marshal = undefined\n  }\n\n  /**\n   * Marshal the envelope content.\n   *\n   * @returns {Uint8Array}\n   */\n  marshal () {\n    if (this._marshal) {\n      return this._marshal\n    }\n\n    const publicKey = cryptoKeys.marshalPublicKey(this.peerId.pubKey)\n\n    this._marshal = Protobuf.encode({\n      publicKey: publicKey,\n      payloadType: this.payloadType,\n      payload: this.payload,\n      signature: this.signature\n    }).finish()\n\n    return this._marshal\n  }\n\n  /**\n   * Verifies if the other Envelope is identical to this one.\n   *\n   * @param {Envelope} other\n   * @returns {boolean}\n   */\n  equals (other) {\n    return uint8arraysEquals(this.peerId.pubKey.bytes, other.peerId.pubKey.bytes) &&\n      uint8arraysEquals(this.payloadType, other.payloadType) &&\n      uint8arraysEquals(this.payload, other.payload) &&\n      uint8arraysEquals(this.signature, other.signature)\n  }\n\n  /**\n   * Validate envelope data signature for the given domain.\n   *\n   * @param {string} domain\n   * @returns {Promise<boolean>}\n   */\n  validate (domain) {\n    const signData = formatSignaturePayload(domain, this.payloadType, this.payload)\n\n    return this.peerId.pubKey.verify(signData, this.signature)\n  }\n}\n\n/**\n * Helper function that prepares a Uint8Array to sign or verify a signature.\n *\n * @param {string} domain\n * @param {Uint8Array} payloadType\n * @param {Uint8Array} payload\n * @returns {Uint8Array}\n */\nconst formatSignaturePayload = (domain, payloadType, payload) => {\n  // When signing, a peer will prepare a Uint8Array by concatenating the following:\n  // - The length of the domain separation string string in bytes\n  // - The domain separation string, encoded as UTF-8\n  // - The length of the payload_type field in bytes\n  // - The value of the payload_type field\n  // - The length of the payload field in bytes\n  // - The value of the payload field\n\n  const domainUint8Array = uint8arraysFromString(domain)\n  const domainLength = varint.encode(domainUint8Array.byteLength)\n  const payloadTypeLength = varint.encode(payloadType.length)\n  const payloadLength = varint.encode(payload.length)\n\n  return uint8arraysConcat([\n    new Uint8Array(domainLength),\n    domainUint8Array,\n    new Uint8Array(payloadTypeLength),\n    payloadType,\n    new Uint8Array(payloadLength),\n    payload\n  ])\n}\n\n/**\n * Unmarshal a serialized Envelope protobuf message.\n *\n * @param {Uint8Array} data\n * @returns {Promise<Envelope>}\n */\nEnvelope.createFromProtobuf = async (data) => {\n  const envelopeData = Protobuf.decode(data)\n  const peerId = await PeerId.createFromPubKey(envelopeData.publicKey)\n\n  return new Envelope({\n    peerId,\n    payloadType: envelopeData.payloadType,\n    payload: envelopeData.payload,\n    signature: envelopeData.signature\n  })\n}\n\n/**\n * Seal marshals the given Record, places the marshaled bytes inside an Envelope\n * and signs it with the given peerId's private key.\n *\n * @async\n * @param {Record} record\n * @param {PeerId} peerId\n * @returns {Promise<Envelope>}\n */\nEnvelope.seal = async (record, peerId) => {\n  const domain = record.domain\n  const payloadType = record.codec\n  const payload = record.marshal()\n\n  const signData = formatSignaturePayload(domain, payloadType, payload)\n  const signature = await peerId.privKey.sign(signData)\n\n  return new Envelope({\n    peerId,\n    payloadType,\n    payload,\n    signature\n  })\n}\n\n/**\n * Open and certify a given marshalled envelope.\n * Data is unmarshalled and the signature validated for the given domain.\n *\n * @param {Uint8Array} data\n * @param {string} domain\n * @returns {Promise<Envelope>}\n */\nEnvelope.openAndCertify = async (data, domain) => {\n  const envelope = await Envelope.createFromProtobuf(data)\n  const valid = await envelope.validate(domain)\n\n  if (!valid) {\n    throw errCode(new Error('envelope signature is not valid for the given domain'), codes.ERR_SIGNATURE_NOT_VALID)\n  }\n\n  return envelope\n}\n\nmodule.exports = Envelope\n","'use strict'\n\nexports.messages = {\n  NOT_STARTED_YET: 'The libp2p node is not started yet',\n  DHT_DISABLED: 'DHT is not available',\n  CONN_ENCRYPTION_REQUIRED: 'At least one connection encryption module is required'\n}\n\nexports.codes = {\n  DHT_DISABLED: 'ERR_DHT_DISABLED',\n  PUBSUB_NOT_STARTED: 'ERR_PUBSUB_NOT_STARTED',\n  DHT_NOT_STARTED: 'ERR_DHT_NOT_STARTED',\n  CONN_ENCRYPTION_REQUIRED: 'ERR_CONN_ENCRYPTION_REQUIRED',\n  ERR_INVALID_PROTOCOLS_FOR_STREAM: 'ERR_INVALID_PROTOCOLS_FOR_STREAM',\n  ERR_CONNECTION_ENDED: 'ERR_CONNECTION_ENDED',\n  ERR_CONNECTION_FAILED: 'ERR_CONNECTION_FAILED',\n  ERR_NODE_NOT_STARTED: 'ERR_NODE_NOT_STARTED',\n  ERR_ALREADY_ABORTED: 'ERR_ALREADY_ABORTED',\n  ERR_NO_VALID_ADDRESSES: 'ERR_NO_VALID_ADDRESSES',\n  ERR_RELAYED_DIAL: 'ERR_RELAYED_DIAL',\n  ERR_DIALED_SELF: 'ERR_DIALED_SELF',\n  ERR_DISCOVERED_SELF: 'ERR_DISCOVERED_SELF',\n  ERR_DUPLICATE_TRANSPORT: 'ERR_DUPLICATE_TRANSPORT',\n  ERR_ENCRYPTION_FAILED: 'ERR_ENCRYPTION_FAILED',\n  ERR_HOP_REQUEST_FAILED: 'ERR_HOP_REQUEST_FAILED',\n  ERR_INVALID_KEY: 'ERR_INVALID_KEY',\n  ERR_INVALID_MESSAGE: 'ERR_INVALID_MESSAGE',\n  ERR_INVALID_PARAMETERS: 'ERR_INVALID_PARAMETERS',\n  ERR_INVALID_PEER: 'ERR_INVALID_PEER',\n  ERR_MUXER_UNAVAILABLE: 'ERR_MUXER_UNAVAILABLE',\n  ERR_TIMEOUT: 'ERR_TIMEOUT',\n  ERR_TRANSPORT_UNAVAILABLE: 'ERR_TRANSPORT_UNAVAILABLE',\n  ERR_TRANSPORT_DIAL_FAILED: 'ERR_TRANSPORT_DIAL_FAILED',\n  ERR_UNSUPPORTED_PROTOCOL: 'ERR_UNSUPPORTED_PROTOCOL',\n  ERR_INVALID_MULTIADDR: 'ERR_INVALID_MULTIADDR',\n  ERR_SIGNATURE_NOT_VALID: 'ERR_SIGNATURE_NOT_VALID'\n}\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"libp2p-envelope\"] || ($protobuf.roots[\"libp2p-envelope\"] = {});\n\n$root.Envelope = (function() {\n\n    /**\n     * Properties of an Envelope.\n     * @exports IEnvelope\n     * @interface IEnvelope\n     * @property {Uint8Array|null} [publicKey] Envelope publicKey\n     * @property {Uint8Array|null} [payloadType] Envelope payloadType\n     * @property {Uint8Array|null} [payload] Envelope payload\n     * @property {Uint8Array|null} [signature] Envelope signature\n     */\n\n    /**\n     * Constructs a new Envelope.\n     * @exports Envelope\n     * @classdesc Represents an Envelope.\n     * @implements IEnvelope\n     * @constructor\n     * @param {IEnvelope=} [p] Properties to set\n     */\n    function Envelope(p) {\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * Envelope publicKey.\n     * @member {Uint8Array} publicKey\n     * @memberof Envelope\n     * @instance\n     */\n    Envelope.prototype.publicKey = $util.newBuffer([]);\n\n    /**\n     * Envelope payloadType.\n     * @member {Uint8Array} payloadType\n     * @memberof Envelope\n     * @instance\n     */\n    Envelope.prototype.payloadType = $util.newBuffer([]);\n\n    /**\n     * Envelope payload.\n     * @member {Uint8Array} payload\n     * @memberof Envelope\n     * @instance\n     */\n    Envelope.prototype.payload = $util.newBuffer([]);\n\n    /**\n     * Envelope signature.\n     * @member {Uint8Array} signature\n     * @memberof Envelope\n     * @instance\n     */\n    Envelope.prototype.signature = $util.newBuffer([]);\n\n    /**\n     * Encodes the specified Envelope message. Does not implicitly {@link Envelope.verify|verify} messages.\n     * @function encode\n     * @memberof Envelope\n     * @static\n     * @param {IEnvelope} m Envelope message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    Envelope.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.publicKey != null && Object.hasOwnProperty.call(m, \"publicKey\"))\n            w.uint32(10).bytes(m.publicKey);\n        if (m.payloadType != null && Object.hasOwnProperty.call(m, \"payloadType\"))\n            w.uint32(18).bytes(m.payloadType);\n        if (m.payload != null && Object.hasOwnProperty.call(m, \"payload\"))\n            w.uint32(26).bytes(m.payload);\n        if (m.signature != null && Object.hasOwnProperty.call(m, \"signature\"))\n            w.uint32(42).bytes(m.signature);\n        return w;\n    };\n\n    /**\n     * Decodes an Envelope message from the specified reader or buffer.\n     * @function decode\n     * @memberof Envelope\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {Envelope} Envelope\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    Envelope.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.Envelope();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.publicKey = r.bytes();\n                break;\n            case 2:\n                m.payloadType = r.bytes();\n                break;\n            case 3:\n                m.payload = r.bytes();\n                break;\n            case 5:\n                m.signature = r.bytes();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates an Envelope message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof Envelope\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {Envelope} Envelope\n     */\n    Envelope.fromObject = function fromObject(d) {\n        if (d instanceof $root.Envelope)\n            return d;\n        var m = new $root.Envelope();\n        if (d.publicKey != null) {\n            if (typeof d.publicKey === \"string\")\n                $util.base64.decode(d.publicKey, m.publicKey = $util.newBuffer($util.base64.length(d.publicKey)), 0);\n            else if (d.publicKey.length)\n                m.publicKey = d.publicKey;\n        }\n        if (d.payloadType != null) {\n            if (typeof d.payloadType === \"string\")\n                $util.base64.decode(d.payloadType, m.payloadType = $util.newBuffer($util.base64.length(d.payloadType)), 0);\n            else if (d.payloadType.length)\n                m.payloadType = d.payloadType;\n        }\n        if (d.payload != null) {\n            if (typeof d.payload === \"string\")\n                $util.base64.decode(d.payload, m.payload = $util.newBuffer($util.base64.length(d.payload)), 0);\n            else if (d.payload.length)\n                m.payload = d.payload;\n        }\n        if (d.signature != null) {\n            if (typeof d.signature === \"string\")\n                $util.base64.decode(d.signature, m.signature = $util.newBuffer($util.base64.length(d.signature)), 0);\n            else if (d.signature.length)\n                m.signature = d.signature;\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from an Envelope message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof Envelope\n     * @static\n     * @param {Envelope} m Envelope\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    Envelope.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.defaults) {\n            if (o.bytes === String)\n                d.publicKey = \"\";\n            else {\n                d.publicKey = [];\n                if (o.bytes !== Array)\n                    d.publicKey = $util.newBuffer(d.publicKey);\n            }\n            if (o.bytes === String)\n                d.payloadType = \"\";\n            else {\n                d.payloadType = [];\n                if (o.bytes !== Array)\n                    d.payloadType = $util.newBuffer(d.payloadType);\n            }\n            if (o.bytes === String)\n                d.payload = \"\";\n            else {\n                d.payload = [];\n                if (o.bytes !== Array)\n                    d.payload = $util.newBuffer(d.payload);\n            }\n            if (o.bytes === String)\n                d.signature = \"\";\n            else {\n                d.signature = [];\n                if (o.bytes !== Array)\n                    d.signature = $util.newBuffer(d.signature);\n            }\n        }\n        if (m.publicKey != null && m.hasOwnProperty(\"publicKey\")) {\n            d.publicKey = o.bytes === String ? $util.base64.encode(m.publicKey, 0, m.publicKey.length) : o.bytes === Array ? Array.prototype.slice.call(m.publicKey) : m.publicKey;\n        }\n        if (m.payloadType != null && m.hasOwnProperty(\"payloadType\")) {\n            d.payloadType = o.bytes === String ? $util.base64.encode(m.payloadType, 0, m.payloadType.length) : o.bytes === Array ? Array.prototype.slice.call(m.payloadType) : m.payloadType;\n        }\n        if (m.payload != null && m.hasOwnProperty(\"payload\")) {\n            d.payload = o.bytes === String ? $util.base64.encode(m.payload, 0, m.payload.length) : o.bytes === Array ? Array.prototype.slice.call(m.payload) : m.payload;\n        }\n        if (m.signature != null && m.hasOwnProperty(\"signature\")) {\n            d.signature = o.bytes === String ? $util.base64.encode(m.signature, 0, m.signature.length) : o.bytes === Array ? Array.prototype.slice.call(m.signature) : m.signature;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this Envelope to JSON.\n     * @function toJSON\n     * @memberof Envelope\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    Envelope.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return Envelope;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p'), {\n  error: debug('libp2p:err')\n})\nconst { EventEmitter } = require('events')\n\nconst errCode = require('err-code')\nconst PeerId = require('peer-id')\nconst { Multiaddr } = require('multiaddr')\n\nconst PeerRouting = require('./peer-routing')\nconst ContentRouting = require('./content-routing')\nconst getPeer = require('./get-peer')\nconst { validate: validateConfig } = require('./config')\nconst { codes, messages } = require('./errors')\n\nconst AddressManager = require('./address-manager')\nconst ConnectionManager = require('./connection-manager')\nconst Circuit = require('./circuit/transport')\nconst Relay = require('./circuit')\nconst Dialer = require('./dialer')\nconst Keychain = require('./keychain')\nconst Metrics = require('./metrics')\nconst TransportManager = require('./transport-manager')\nconst Upgrader = require('./upgrader')\nconst PeerStore = require('./peer-store')\nconst PubsubAdapter = require('./pubsub-adapter')\nconst PersistentPeerStore = require('./peer-store/persistent')\nconst Registrar = require('./registrar')\nconst ping = require('./ping')\nconst IdentifyService = require('./identify')\nconst IDENTIFY_PROTOCOLS = IdentifyService.multicodecs\nconst NatManager = require('./nat-manager')\nconst { updateSelfPeerRecord } = require('./record/utils')\n\n/**\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n * @typedef {import('libp2p-interfaces/src/transport/types').TransportFactory<any, any>} TransportFactory\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxerFactory} MuxerFactory\n * @typedef {import('libp2p-interfaces/src/content-routing/types').ContentRouting} ContentRoutingModule\n * @typedef {import('libp2p-interfaces/src/peer-discovery/types').PeerDiscoveryFactory} PeerDiscoveryFactory\n * @typedef {import('libp2p-interfaces/src/peer-routing/types').PeerRouting} PeerRoutingModule\n * @typedef {import('libp2p-interfaces/src/crypto/types').Crypto} Crypto\n * @typedef {import('libp2p-interfaces/src/pubsub')} Pubsub\n * @typedef {import('libp2p-interfaces/src/pubsub').PubsubOptions} PubsubOptions\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('./pnet')} Protector\n */\n\n/**\n * @typedef {Object} HandlerProps\n * @property {Connection} connection\n * @property {MuxedStream} stream\n * @property {string} protocol\n *\n * @typedef {Object} RandomWalkOptions\n * @property {boolean} [enabled = false]\n * @property {number} [queriesPerPeriod = 1]\n * @property {number} [interval = 300e3]\n * @property {number} [timeout = 10e3]\n *\n * @typedef {Object} DhtOptions\n * @property {boolean} [enabled = false]\n * @property {number} [kBucketSize = 20]\n * @property {RandomWalkOptions} [randomWalk]\n * @property {boolean} [clientMode]\n * @property {import('libp2p-interfaces/src/types').DhtSelectors} [selectors]\n * @property {import('libp2p-interfaces/src/types').DhtValidators} [validators]\n *\n * @typedef {Object} KeychainOptions\n * @property {Datastore} [datastore]\n *\n * @typedef {Object} PeerStoreOptions\n * @property {boolean} persistence\n *\n * @typedef {Object} PubsubLocalOptions\n * @property {boolean} enabled\n *\n * @typedef {Object} MetricsOptions\n * @property {boolean} enabled\n *\n * @typedef {Object} RelayOptions\n * @property {boolean} [enabled = true]\n * @property {import('./circuit').RelayAdvertiseOptions} [advertise]\n * @property {import('./circuit').HopOptions} [hop]\n * @property {import('./circuit').AutoRelayOptions} [autoRelay]\n *\n * @typedef {Object} Libp2pConfig\n * @property {DhtOptions} [dht] dht module options\n * @property {import('./nat-manager').NatManagerOptions} [nat]\n * @property {Record<string, Object|boolean>} [peerDiscovery]\n * @property {PubsubLocalOptions & PubsubOptions} [pubsub] pubsub module options\n * @property {RelayOptions} [relay]\n * @property {Record<string, Object>} [transport] transport options indexed by transport key\n *\n * @typedef {Object} Libp2pModules\n * @property {TransportFactory[]} transport\n * @property {MuxerFactory[]} streamMuxer\n * @property {Crypto[]} connEncryption\n * @property {PeerDiscoveryFactory[]} [peerDiscovery]\n * @property {PeerRoutingModule[]} [peerRouting]\n * @property {ContentRoutingModule[]} [contentRouting]\n * @property {Object} [dht]\n * @property {{new(...args: any[]): Pubsub}} [pubsub]\n * @property {Protector} [connProtector]\n *\n * @typedef {Object} Libp2pOptions\n * @property {Libp2pModules} modules libp2p modules to use\n * @property {import('./address-manager').AddressManagerOptions} [addresses]\n * @property {import('./connection-manager').ConnectionManagerOptions} [connectionManager]\n * @property {Datastore} [datastore]\n * @property {import('./dialer').DialerOptions} [dialer]\n * @property {import('./identify/index').HostProperties} [host] libp2p host\n * @property {KeychainOptions & import('./keychain/index').KeychainOptions} [keychain]\n * @property {MetricsOptions & import('./metrics').MetricsOptions} [metrics]\n * @property {import('./peer-routing').PeerRoutingOptions} [peerRouting]\n * @property {PeerStoreOptions & import('./peer-store/persistent').PersistentPeerStoreOptions} [peerStore]\n * @property {import('./transport-manager').TransportManagerOptions} [transportManager]\n * @property {Libp2pConfig} [config]\n *\n * @typedef {Object} constructorOptions\n * @property {PeerId} peerId\n *\n * @typedef {Object} CreateOptions\n * @property {PeerId} [peerId]\n *\n * @extends {EventEmitter}\n * @fires Libp2p#error Emitted when an error occurs\n * @fires Libp2p#peer:discovery Emitted when a peer is discovered\n */\nclass Libp2p extends EventEmitter {\n  /**\n   * Like `new Libp2p(options)` except it will create a `PeerId`\n   * instance if one is not provided in options.\n   *\n   * @param {Libp2pOptions & CreateOptions} options - Libp2p configuration options\n   * @returns {Promise<Libp2p>}\n   */\n  static async create (options) {\n    if (options.peerId) {\n      // @ts-ignore 'Libp2pOptions & CreateOptions' is not assignable to 'Libp2pOptions & constructorOptions'\n      return new Libp2p(options)\n    }\n\n    const peerId = await PeerId.create()\n\n    options.peerId = peerId\n    // @ts-ignore 'Libp2pOptions & CreateOptions' is not assignable to 'Libp2pOptions & constructorOptions'\n    return new Libp2p(options)\n  }\n\n  /**\n   * Libp2p node.\n   *\n   * @class\n   * @param {Libp2pOptions & constructorOptions} _options\n   */\n  constructor (_options) {\n    super()\n    // validateConfig will ensure the config is correct,\n    // and add default values where appropriate\n    this._options = validateConfig(_options)\n\n    /** @type {PeerId} */\n    this.peerId = this._options.peerId\n    this.datastore = this._options.datastore\n\n    this.peerStore = (this.datastore && this._options.peerStore.persistence)\n      ? new PersistentPeerStore({\n        peerId: this.peerId,\n        datastore: this.datastore,\n        ...this._options.peerStore\n      })\n      : new PeerStore({ peerId: this.peerId })\n\n    // Addresses {listen, announce, noAnnounce}\n    this.addresses = this._options.addresses\n    this.addressManager = new AddressManager(this.peerId, this._options.addresses)\n\n    // when addresses change, update our peer record\n    this.addressManager.on('change:addresses', () => {\n      updateSelfPeerRecord(this).catch(err => {\n        log.error('Error updating self peer record', err)\n      })\n    })\n\n    this._modules = this._options.modules\n    this._config = this._options.config\n    this._transport = [] // Transport instances/references\n    this._discovery = new Map() // Discovery service instances/references\n\n    // Create the Connection Manager\n    this.connectionManager = new ConnectionManager(this, {\n      autoDial: this._config.peerDiscovery.autoDial,\n      ...this._options.connectionManager\n    })\n\n    // Create Metrics\n    if (this._options.metrics.enabled) {\n      this.metrics = new Metrics({\n        ...this._options.metrics,\n        connectionManager: this.connectionManager\n      })\n    }\n\n    // Create keychain\n    if (this._options.keychain && this._options.keychain.datastore) {\n      log('creating keychain')\n\n      const keychainOpts = Keychain.generateOptions()\n\n      this.keychain = new Keychain(this._options.keychain.datastore, {\n        ...keychainOpts,\n        ...this._options.keychain\n      })\n\n      log('keychain constructed')\n    }\n\n    // Setup the Upgrader\n    this.upgrader = new Upgrader({\n      localPeer: this.peerId,\n      metrics: this.metrics,\n      onConnection: (connection) => this.connectionManager.onConnect(connection),\n      onConnectionEnd: (connection) => this.connectionManager.onDisconnect(connection)\n    })\n\n    // Setup the transport manager\n    this.transportManager = new TransportManager({\n      libp2p: this,\n      upgrader: this.upgrader,\n      faultTolerance: this._options.transportManager.faultTolerance\n    })\n\n    // Create the Nat Manager\n    this.natManager = new NatManager({\n      peerId: this.peerId,\n      addressManager: this.addressManager,\n      transportManager: this.transportManager,\n      // @ts-ignore Nat typedef is not understood as Object\n      ...this._options.config.nat\n    })\n\n    // Create the Registrar\n    this.registrar = new Registrar({\n      peerStore: this.peerStore,\n      connectionManager: this.connectionManager\n    })\n\n    this.handle = this.handle.bind(this)\n    this.registrar.handle = this.handle\n\n    // Attach crypto channels\n    if (!this._modules.connEncryption || !this._modules.connEncryption.length) {\n      throw errCode(new Error(messages.CONN_ENCRYPTION_REQUIRED), codes.CONN_ENCRYPTION_REQUIRED)\n    }\n    const cryptos = this._modules.connEncryption\n    cryptos.forEach((crypto) => {\n      this.upgrader.cryptos.set(crypto.protocol, crypto)\n    })\n\n    this.dialer = new Dialer({\n      transportManager: this.transportManager,\n      peerStore: this.peerStore,\n      ...this._options.dialer\n    })\n\n    this._modules.transport.forEach((Transport) => {\n      const key = Transport.prototype[Symbol.toStringTag]\n      const transportOptions = this._config.transport[key]\n      this.transportManager.add(key, Transport, transportOptions)\n    })\n\n    if (this._config.relay.enabled) {\n      // @ts-ignore Circuit prototype\n      this.transportManager.add(Circuit.prototype[Symbol.toStringTag], Circuit)\n      this.relay = new Relay(this)\n    }\n\n    // Attach stream multiplexers\n    if (this._modules.streamMuxer) {\n      const muxers = this._modules.streamMuxer\n      muxers.forEach((muxer) => {\n        this.upgrader.muxers.set(muxer.multicodec, muxer)\n      })\n\n      // Add the identify service since we can multiplex\n      this.identifyService = new IdentifyService({ libp2p: this })\n      this.handle(Object.values(IDENTIFY_PROTOCOLS), this.identifyService.handleMessage)\n    }\n\n    // Attach private network protector\n    if (this._modules.connProtector) {\n      this.upgrader.protector = this._modules.connProtector\n    } else if (globalThis.process !== undefined && globalThis.process.env && globalThis.process.env.LIBP2P_FORCE_PNET) { // eslint-disable-line no-undef\n      throw new Error('Private network is enforced, but no protector was provided')\n    }\n\n    // dht provided components (peerRouting, contentRouting, dht)\n    if (this._modules.dht) {\n      const DHT = this._modules.dht\n      // @ts-ignore Object is not constructable\n      this._dht = new DHT({\n        libp2p: this,\n        dialer: this.dialer,\n        peerId: this.peerId,\n        peerStore: this.peerStore,\n        registrar: this.registrar,\n        datastore: this.datastore,\n        ...this._config.dht\n      })\n    }\n\n    // Create pubsub if provided\n    if (this._modules.pubsub) {\n      const Pubsub = this._modules.pubsub\n      // using pubsub adapter with *DEPRECATED* handlers functionality\n      /** @type {Pubsub} */\n      this.pubsub = PubsubAdapter(Pubsub, this, this._config.pubsub)\n    }\n\n    // Attach remaining APIs\n    // peer and content routing will automatically get modules from _modules and _dht\n    this.peerRouting = new PeerRouting(this)\n    this.contentRouting = new ContentRouting(this)\n\n    // Mount default protocols\n    ping.mount(this)\n\n    this._onDiscoveryPeer = this._onDiscoveryPeer.bind(this)\n  }\n\n  /**\n   * Overrides EventEmitter.emit to conditionally emit errors\n   * if there is a handler. If not, errors will be logged.\n   *\n   * @param {string} eventName\n   * @param  {...any} args\n   * @returns {boolean}\n   */\n  emit (eventName, ...args) {\n    // TODO: do we still need this?\n    // @ts-ignore _events does not exist in libp2p\n    if (eventName === 'error' && !this._events.error) {\n      log.error(args)\n      return false\n    } else {\n      return super.emit(eventName, ...args)\n    }\n  }\n\n  /**\n   * Starts the libp2p node and all its subsystems\n   *\n   * @returns {Promise<void>}\n   */\n  async start () {\n    log('libp2p is starting')\n\n    try {\n      await this._onStarting()\n      await this._onDidStart()\n      log('libp2p has started')\n    } catch (err) {\n      this.emit('error', err)\n      log.error('An error occurred starting libp2p', err)\n      await this.stop()\n      throw err\n    }\n  }\n\n  /**\n   * Stop the libp2p node by closing its listeners and open connections\n   *\n   * @async\n   * @returns {Promise<void>}\n   */\n  async stop () {\n    log('libp2p is stopping')\n\n    try {\n      this._isStarted = false\n\n      this.relay && this.relay.stop()\n      this.peerRouting.stop()\n\n      for (const service of this._discovery.values()) {\n        service.removeListener('peer', this._onDiscoveryPeer)\n      }\n\n      await Promise.all(Array.from(this._discovery.values(), s => s.stop()))\n\n      this._discovery = new Map()\n\n      await this.peerStore.stop()\n      await this.connectionManager.stop()\n\n      await Promise.all([\n        this.pubsub && this.pubsub.stop(),\n        this._dht && this._dht.stop(),\n        this.metrics && this.metrics.stop()\n      ])\n\n      await this.natManager.stop()\n      await this.transportManager.close()\n\n      ping.unmount(this)\n      this.dialer.destroy()\n    } catch (err) {\n      if (err) {\n        log.error(err)\n        this.emit('error', err)\n      }\n    }\n    log('libp2p has stopped')\n  }\n\n  /**\n   * Load keychain keys from the datastore.\n   * Imports the private key as 'self', if needed.\n   *\n   * @async\n   * @returns {Promise<void>}\n   */\n  async loadKeychain () {\n    if (!this.keychain) {\n      return\n    }\n\n    try {\n      await this.keychain.findKeyByName('self')\n    } catch (err) {\n      await this.keychain.importPeer('self', this.peerId)\n    }\n  }\n\n  isStarted () {\n    return this._isStarted\n  }\n\n  /**\n   * Gets a Map of the current connections. The keys are the stringified\n   * `PeerId` of the peer. The value is an array of Connections to that peer.\n   *\n   * @returns {Map<string, Connection[]>}\n   */\n  get connections () {\n    return this.connectionManager.connections\n  }\n\n  /**\n   * Dials to the provided peer. If successful, the known metadata of the\n   * peer will be added to the nodes `peerStore`\n   *\n   * @param {PeerId|Multiaddr|string} peer - The peer to dial\n   * @param {object} [options]\n   * @param {AbortSignal} [options.signal]\n   * @returns {Promise<Connection>}\n   */\n  dial (peer, options) {\n    return this._dial(peer, options)\n  }\n\n  /**\n   * Dials to the provided peer and tries to handshake with the given protocols in order.\n   * If successful, the known metadata of the peer will be added to the nodes `peerStore`,\n   * and the `MuxedStream` will be returned together with the successful negotiated protocol.\n   *\n   * @async\n   * @param {PeerId|Multiaddr|string} peer - The peer to dial\n   * @param {string[]|string} protocols\n   * @param {object} [options]\n   * @param {AbortSignal} [options.signal]\n   */\n  async dialProtocol (peer, protocols, options) {\n    if (!protocols || !protocols.length) {\n      throw errCode(new Error('no protocols were provided to open a stream'), codes.ERR_INVALID_PROTOCOLS_FOR_STREAM)\n    }\n\n    const connection = await this._dial(peer, options)\n    return connection.newStream(protocols)\n  }\n\n  /**\n   * @async\n   * @param {PeerId|Multiaddr|string} peer - The peer to dial\n   * @param {object} [options]\n   * @returns {Promise<Connection>}\n   */\n  async _dial (peer, options) {\n    const { id, multiaddrs } = getPeer(peer)\n\n    if (id.equals(this.peerId)) {\n      throw errCode(new Error('Cannot dial self'), codes.ERR_DIALED_SELF)\n    }\n\n    let connection = this.connectionManager.get(id)\n\n    if (!connection) {\n      connection = await this.dialer.connectToPeer(peer, options)\n    } else if (multiaddrs) {\n      this.peerStore.addressBook.add(id, multiaddrs)\n    }\n\n    return connection\n  }\n\n  /**\n   * Get a deduplicated list of peer advertising multiaddrs by concatenating\n   * the listen addresses used by transports with any configured\n   * announce addresses as well as observed addresses reported by peers.\n   *\n   * If Announce addrs are specified, configured listen addresses will be\n   * ignored though observed addresses will still be included.\n   *\n   * @returns {Multiaddr[]}\n   */\n  get multiaddrs () {\n    let addrs = this.addressManager.getAnnounceAddrs().map(ma => ma.toString())\n\n    if (!addrs.length) {\n      // no configured announce addrs, add configured listen addresses\n      addrs = this.transportManager.getAddrs().map(ma => ma.toString())\n    }\n\n    addrs = addrs.concat(this.addressManager.getObservedAddrs().map(ma => ma.toString()))\n\n    const announceFilter = this._options.addresses.announceFilter\n\n    // dedupe multiaddrs\n    const addrSet = new Set(addrs)\n\n    // Create advertising list\n    return announceFilter(Array.from(addrSet).map(str => new Multiaddr(str)))\n  }\n\n  /**\n   * Disconnects all connections to the given `peer`\n   *\n   * @param {PeerId|Multiaddr|string} peer - the peer to close connections to\n   * @returns {Promise<void>}\n   */\n  async hangUp (peer) {\n    const { id } = getPeer(peer)\n\n    const connections = this.connectionManager.connections.get(id.toB58String())\n\n    if (!connections) {\n      return\n    }\n\n    await Promise.all(\n      connections.map(connection => {\n        return connection.close()\n      })\n    )\n  }\n\n  /**\n   * Pings the given peer in order to obtain the operation latency.\n   *\n   * @param {PeerId|Multiaddr|string} peer - The peer to ping\n   * @returns {Promise<number>}\n   */\n  ping (peer) {\n    const { id, multiaddrs } = getPeer(peer)\n\n    // If received multiaddr, ping it\n    if (multiaddrs) {\n      return ping(this, multiaddrs[0])\n    }\n\n    return ping(this, id)\n  }\n\n  /**\n   * Registers the `handler` for each protocol\n   *\n   * @param {string[]|string} protocols\n   * @param {(props: HandlerProps) => void} handler\n   */\n  handle (protocols, handler) {\n    protocols = Array.isArray(protocols) ? protocols : [protocols]\n    protocols.forEach(protocol => {\n      this.upgrader.protocols.set(protocol, handler)\n    })\n\n    // Add new protocols to self protocols in the Protobook\n    this.peerStore.protoBook.add(this.peerId, protocols)\n  }\n\n  /**\n   * Removes the handler for each protocol. The protocol\n   * will no longer be supported on streams.\n   *\n   * @param {string[]|string} protocols\n   */\n  unhandle (protocols) {\n    protocols = Array.isArray(protocols) ? protocols : [protocols]\n    protocols.forEach(protocol => {\n      this.upgrader.protocols.delete(protocol)\n    })\n\n    // Remove protocols from self protocols in the Protobook\n    this.peerStore.protoBook.remove(this.peerId, protocols)\n  }\n\n  async _onStarting () {\n    // Listen on the provided transports for the provided addresses\n    const addrs = this.addressManager.getListenAddrs()\n    await this.transportManager.listen(addrs)\n\n    // Manage your NATs\n    this.natManager.start()\n\n    // Start PeerStore\n    await this.peerStore.start()\n\n    if (this._config.pubsub.enabled) {\n      this.pubsub && this.pubsub.start()\n    }\n\n    // DHT subsystem\n    if (this._config.dht.enabled) {\n      this._dht && this._dht.start()\n\n      // TODO: this should be modified once random-walk is used as\n      // the other discovery modules\n      this._dht.on('peer', this._onDiscoveryPeer)\n    }\n\n    // Start metrics if present\n    this.metrics && this.metrics.start()\n  }\n\n  /**\n   * Called when libp2p has started and before it returns\n   *\n   * @private\n   */\n  async _onDidStart () {\n    this._isStarted = true\n\n    this.peerStore.on('peer', peerId => {\n      this.emit('peer:discovery', peerId)\n      this._maybeConnect(peerId)\n    })\n\n    // Once we start, emit any peers we may have already discovered\n    // TODO: this should be removed, as we already discovered these peers in the past\n    for (const peer of this.peerStore.peers.values()) {\n      this.emit('peer:discovery', peer.id)\n    }\n\n    this.connectionManager.start()\n\n    // Peer discovery\n    await this._setupPeerDiscovery()\n\n    // Relay\n    this.relay && this.relay.start()\n\n    this.peerRouting.start()\n  }\n\n  /**\n   * Called whenever peer discovery services emit `peer` events.\n   * Known peers may be emitted.\n   *\n   * @private\n   * @param {{ id: PeerId, multiaddrs: Multiaddr[], protocols: string[] }} peer\n   */\n  _onDiscoveryPeer (peer) {\n    if (peer.id.toB58String() === this.peerId.toB58String()) {\n      log.error(new Error(codes.ERR_DISCOVERED_SELF))\n      return\n    }\n\n    peer.multiaddrs && this.peerStore.addressBook.add(peer.id, peer.multiaddrs)\n    peer.protocols && this.peerStore.protoBook.set(peer.id, peer.protocols)\n  }\n\n  /**\n   * Will dial to the given `peerId` if the current number of\n   * connected peers is less than the configured `ConnectionManager`\n   * minConnections.\n   *\n   * @private\n   * @param {PeerId} peerId\n   */\n  async _maybeConnect (peerId) {\n    // If auto dialing is on and we have no connection to the peer, check if we should dial\n    if (this._config.peerDiscovery.autoDial === true && !this.connectionManager.get(peerId)) {\n      const minConnections = this._options.connectionManager.minConnections || 0\n      if (minConnections > this.connectionManager.size) {\n        log('connecting to discovered peer %s', peerId.toB58String())\n        try {\n          await this.dialer.connectToPeer(peerId)\n        } catch (err) {\n          log.error(`could not connect to discovered peer ${peerId.toB58String()} with ${err}`)\n        }\n      }\n    }\n  }\n\n  /**\n   * Initializes and starts peer discovery services\n   *\n   * @async\n   * @private\n   */\n  async _setupPeerDiscovery () {\n    /**\n     * @param {PeerDiscoveryFactory} DiscoveryService\n     */\n    const setupService = (DiscoveryService) => {\n      let config = {\n        enabled: true // on by default\n      }\n\n      if (DiscoveryService.tag &&\n        this._config.peerDiscovery &&\n        this._config.peerDiscovery[DiscoveryService.tag]) {\n        // @ts-ignore PeerDiscovery not understood as an Object for spread\n        config = { ...config, ...this._config.peerDiscovery[DiscoveryService.tag] }\n      }\n\n      if (config.enabled &&\n        !this._discovery.has(DiscoveryService.tag)) { // not already added\n        let discoveryService\n\n        if (typeof DiscoveryService === 'function') {\n          // @ts-ignore DiscoveryService has no constructor type inferred\n          discoveryService = new DiscoveryService(Object.assign({}, config, {\n            peerId: this.peerId,\n            libp2p: this\n          }))\n        } else {\n          discoveryService = DiscoveryService\n        }\n\n        discoveryService.on('peer', this._onDiscoveryPeer)\n        this._discovery.set(DiscoveryService.tag, discoveryService)\n      }\n    }\n\n    // Discovery modules\n    for (const DiscoveryService of this._modules.peerDiscovery || []) {\n      setupService(DiscoveryService)\n    }\n\n    // Transport modules with discovery\n    for (const Transport of this.transportManager.getTransports()) {\n      // @ts-ignore Transport interface does not include discovery\n      if (Transport.discovery) {\n        // @ts-ignore Transport interface does not include discovery\n        setupService(Transport.discovery)\n      }\n    }\n\n    await Promise.all(Array.from(this._discovery.values(), d => d.start()))\n  }\n}\n\nmodule.exports = Libp2p\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:peer-routing'), {\n  error: debug('libp2p:peer-routing:err')\n})\nconst errCode = require('err-code')\nconst {\n  storeAddresses,\n  uniquePeers,\n  requirePeers\n} = require('./content-routing/utils')\n\nconst merge = require('it-merge')\nconst { pipe } = require('it-pipe')\nconst first = require('it-first')\nconst drain = require('it-drain')\nconst filter = require('it-filter')\nconst {\n  setDelayedInterval,\n  clearDelayedInterval\n// @ts-ignore module with no types\n} = require('set-delayed-interval')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n * @typedef {import('libp2p-interfaces/src/peer-routing/types').PeerRouting} PeerRoutingModule\n */\n\n/**\n * @typedef {Object} RefreshManagerOptions\n * @property {boolean} [enabled = true] - Whether to enable the Refresh manager\n * @property {number} [bootDelay = 6e5] - Boot delay to start the Refresh Manager (in ms)\n * @property {number} [interval = 10e3] - Interval between each Refresh Manager run (in ms)\n *\n * @typedef {Object} PeerRoutingOptions\n * @property {RefreshManagerOptions} [refreshManager]\n */\n\nclass PeerRouting {\n  /**\n   * @class\n   * @param {import('./')} libp2p\n   */\n  constructor (libp2p) {\n    this._peerId = libp2p.peerId\n    this._peerStore = libp2p.peerStore\n    /** @type {PeerRoutingModule[]} */\n    this._routers = libp2p._modules.peerRouting || []\n\n    // If we have the dht, add it to the available peer routers\n    if (libp2p._dht && libp2p._config.dht.enabled) {\n      this._routers.push(libp2p._dht)\n    }\n\n    this._refreshManagerOptions = libp2p._options.peerRouting.refreshManager\n\n    this._findClosestPeersTask = this._findClosestPeersTask.bind(this)\n  }\n\n  /**\n   * Start peer routing service.\n   */\n  start () {\n    if (!this._routers.length || this._timeoutId || !this._refreshManagerOptions.enabled) {\n      return\n    }\n\n    this._timeoutId = setDelayedInterval(\n      this._findClosestPeersTask, this._refreshManagerOptions.interval, this._refreshManagerOptions.bootDelay\n    )\n  }\n\n  /**\n   * Recurrent task to find closest peers and add their addresses to the Address Book.\n   */\n  async _findClosestPeersTask () {\n    try {\n      // nb getClosestPeers adds the addresses to the address book\n      await drain(this.getClosestPeers(this._peerId.id))\n    } catch (err) {\n      log.error(err)\n    }\n  }\n\n  /**\n   * Stop peer routing service.\n   */\n  stop () {\n    clearDelayedInterval(this._timeoutId)\n  }\n\n  /**\n   * Iterates over all peer routers in parallel to find the given peer.\n   *\n   * @param {PeerId} id - The id of the peer to find\n   * @param {object} [options]\n   * @param {number} [options.timeout] - How long the query should run\n   * @returns {Promise<{ id: PeerId, multiaddrs: Multiaddr[] }>}\n   */\n  async findPeer (id, options) { // eslint-disable-line require-await\n    if (!this._routers.length) {\n      throw errCode(new Error('No peer routers available'), 'NO_ROUTERS_AVAILABLE')\n    }\n\n    if (id.toB58String() === this._peerId.toB58String()) {\n      throw errCode(new Error('Should not try to find self'), 'ERR_FIND_SELF')\n    }\n\n    const output = await pipe(\n      merge(\n        ...this._routers.map(router => [router.findPeer(id, options)])\n      ),\n      (source) => filter(source, Boolean),\n      // @ts-ignore findPeer resolves a Promise\n      (source) => storeAddresses(source, this._peerStore),\n      (source) => first(source)\n    )\n\n    if (output) {\n      return output\n    }\n\n    throw errCode(new Error('not found'), 'NOT_FOUND')\n  }\n\n  /**\n   * Attempt to find the closest peers on the network to the given key.\n   *\n   * @param {Uint8Array} key - A CID like key\n   * @param {Object} [options]\n   * @param {number} [options.timeout=30e3] - How long the query can take.\n   * @returns {AsyncIterable<{ id: PeerId, multiaddrs: Multiaddr[] }>}\n   */\n  async * getClosestPeers (key, options = { timeout: 30e3 }) {\n    if (!this._routers.length) {\n      throw errCode(new Error('No peer routers available'), 'NO_ROUTERS_AVAILABLE')\n    }\n\n    yield * pipe(\n      merge(\n        ...this._routers.map(router => router.getClosestPeers(key, options))\n      ),\n      (source) => storeAddresses(source, this._peerStore),\n      (source) => uniquePeers(source),\n      (source) => requirePeers(source)\n    )\n  }\n}\n\nmodule.exports = PeerRouting\n","'use strict'\n\nconst errCode = require('err-code')\nconst filter = require('it-filter')\nconst map = require('it-map')\nconst take = require('it-take')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n */\n\n/**\n * Store the multiaddrs from every peer in the passed peer store\n *\n * @param {AsyncIterable<{ id: PeerId, multiaddrs: Multiaddr[] }>} source\n * @param {import('../peer-store')} peerStore\n */\nfunction storeAddresses (source, peerStore) {\n  return map(source, (peer) => {\n    // ensure we have the addresses for a given peer\n    peerStore.addressBook.add(peer.id, peer.multiaddrs)\n\n    return peer\n  })\n}\n\n/**\n * Filter peers by unique peer id\n *\n * @param {AsyncIterable<{ id: PeerId, multiaddrs: Multiaddr[] }>} source\n */\nfunction uniquePeers (source) {\n  /** @type Set<string> */\n  const seen = new Set()\n\n  return filter(source, (peer) => {\n    // dedupe by peer id\n    if (seen.has(peer.id.toString())) {\n      return false\n    }\n\n    seen.add(peer.id.toString())\n\n    return true\n  })\n}\n\n/**\n * Require at least `min` peers to be yielded from `source`\n *\n * @param {AsyncIterable<{ id: PeerId, multiaddrs: Multiaddr[] }>} source\n * @param {number} min\n */\nasync function * requirePeers (source, min = 1) {\n  let seen = 0\n\n  for await (const peer of source) {\n    seen++\n\n    yield peer\n  }\n\n  if (seen < min) {\n    throw errCode(new Error('not found'), 'NOT_FOUND')\n  }\n}\n\n/**\n * If `max` is passed, only take that number of peers from the source\n * otherwise take all the peers\n *\n * @param {AsyncIterable<{ id: PeerId, multiaddrs: Multiaddr[] }>} source\n * @param {number} [max]\n */\nfunction maybeLimitSource (source, max) {\n  if (max) {\n    return take(source, max)\n  }\n\n  return source\n}\n\nmodule.exports = {\n  storeAddresses,\n  uniquePeers,\n  requirePeers,\n  maybeLimitSource\n}\n","'use strict'\n\n/**\n * Stop iteration after n items have been received.\n *\n * @template T\n * @param {AsyncIterable<T>|Iterable<T>} source\n * @param {number} limit\n * @returns {AsyncIterable<T>}\n */\nconst take = async function * (source, limit) {\n  let items = 0\n\n  if (limit < 1) {\n    return\n  }\n\n  for await (const entry of source) {\n    yield entry\n\n    items++\n\n    if (items === limit) {\n      return\n    }\n  }\n}\n\nmodule.exports = take\n","'use strict'\n\nconst pushable = require('it-pushable')\n\n/**\n * Treat one or more iterables as a single iterable.\n *\n * Nb. sources are iterated over in parallel so the\n * order of emitted items is not guaranteed.\n *\n * @template T\n * @param {...AsyncIterable<T>|Iterable<T>} sources\n * @returns {AsyncIterable<T>}\n */\nconst merge = async function * (...sources) {\n  // @ts-ignore\n  const output = pushable()\n\n  setTimeout(async () => {\n    try {\n      await Promise.all(\n        sources.map(async (source) => {\n          for await (const item of source) {\n            output.push(item)\n          }\n        })\n      )\n\n      output.end()\n    } catch (err) {\n      output.end(err)\n    }\n  }, 0)\n\n  yield * output\n}\n\nmodule.exports = merge\n","'use strict'\n\nconst intervals = new Map()\n\nconst _generateId = () => `${Date.now()}:${Math.floor(Math.random() * 1000000)}`\n\n/**\n * Run a given task each {interval} ms\n *\n * @param {() => Promise} task\n * @param {number} interval\n * @param {string} id\n */\nasync function _runPeriodically (task, interval, id) {\n  while (intervals.get(id)) {\n    try {\n      await task()\n    } catch (err) {\n      // Throw global context error if handler throws\n      setTimeout(() => { throw err }, 1)\n      break\n    }\n\n    if (!intervals.get(id)) {\n      break\n    }\n\n    await new Promise(resolve => {\n      const _timeout = setTimeout(resolve, interval)\n\n      intervals.set(id, _timeout)\n    })\n  }\n}\n\n/**\n * Asynchronous setInterval that is properly delayed using promises and can be delayed on boot.\n *\n * @param {() => Promise} task\n * @param {number} interval\n * @param {number} [delay = interval]\n * @returns {string}\n */\nfunction setDelayedInterval (task, interval, delay) {\n  delay = delay || interval\n\n  const id = _generateId()\n  const _timeout = setTimeout(() => {\n    _runPeriodically(task, interval, id)\n  }, delay)\n\n  intervals.set(id, _timeout)\n\n  return id\n}\n\n/**\n * Clear delayed interval.\n *\n * @param {string} id\n */\nfunction clearDelayedInterval (id) {\n  const _timeout = intervals.get(id)\n\n  if (_timeout) {\n    clearTimeout(_timeout)\n    intervals.delete(id)\n  }\n}\n\nmodule.exports = {\n  setDelayedInterval,\n  clearDelayedInterval\n}\n","'use strict'\n\nconst errCode = require('err-code')\nconst { messages, codes } = require('../errors')\nconst {\n  storeAddresses,\n  uniquePeers,\n  requirePeers,\n  maybeLimitSource\n} = require('./utils')\n\nconst merge = require('it-merge')\nconst { pipe } = require('it-pipe')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n * @typedef {import('cids')} CID\n * @typedef {import('libp2p-interfaces/src/content-routing/types').ContentRouting} ContentRoutingModule\n */\n\n/**\n * @typedef {Object} GetData\n * @property {PeerId} from\n * @property {Uint8Array} val\n */\n\nclass ContentRouting {\n  /**\n   * @class\n   * @param {import('..')} libp2p\n   */\n  constructor (libp2p) {\n    this.libp2p = libp2p\n    /** @type {ContentRoutingModule[]} */\n    this.routers = libp2p._modules.contentRouting || []\n    this.dht = libp2p._dht\n\n    // If we have the dht, add it to the available content routers\n    if (this.dht && libp2p._config.dht.enabled) {\n      this.routers.push(this.dht)\n    }\n  }\n\n  /**\n   * Iterates over all content routers in parallel to find providers of the given key.\n   *\n   * @param {CID} key - The CID key of the content to find\n   * @param {object} [options]\n   * @param {number} [options.timeout] - How long the query should run\n   * @param {number} [options.maxNumProviders] - maximum number of providers to find\n   * @returns {AsyncIterable<{ id: PeerId, multiaddrs: Multiaddr[] }>}\n   */\n  async * findProviders (key, options = {}) {\n    if (!this.routers.length) {\n      throw errCode(new Error('No content this.routers available'), 'NO_ROUTERS_AVAILABLE')\n    }\n\n    yield * pipe(\n      merge(\n        ...this.routers.map(router => router.findProviders(key, options))\n      ),\n      (source) => storeAddresses(source, this.libp2p.peerStore),\n      (source) => uniquePeers(source),\n      (source) => maybeLimitSource(source, options.maxNumProviders),\n      (source) => requirePeers(source)\n    )\n  }\n\n  /**\n   * Iterates over all content routers in parallel to notify it is\n   * a provider of the given key.\n   *\n   * @param {CID} key - The CID key of the content to find\n   * @returns {Promise<void>}\n   */\n  async provide (key) {\n    if (!this.routers.length) {\n      throw errCode(new Error('No content routers available'), 'NO_ROUTERS_AVAILABLE')\n    }\n\n    await Promise.all(this.routers.map((router) => router.provide(key)))\n  }\n\n  /**\n   * Store the given key/value pair in the DHT.\n   *\n   * @param {Uint8Array} key\n   * @param {Uint8Array} value\n   * @param {Object} [options] - put options\n   * @param {number} [options.minPeers] - minimum number of peers required to successfully put\n   * @returns {Promise<void>}\n   */\n  put (key, value, options) {\n    if (!this.libp2p.isStarted() || !this.dht.isStarted) {\n      throw errCode(new Error(messages.NOT_STARTED_YET), codes.DHT_NOT_STARTED)\n    }\n\n    return this.dht.put(key, value, options)\n  }\n\n  /**\n   * Get the value to the given key.\n   * Times out after 1 minute by default.\n   *\n   * @param {Uint8Array} key\n   * @param {Object} [options] - get options\n   * @param {number} [options.timeout] - optional timeout (default: 60000)\n   * @returns {Promise<GetData>}\n   */\n  get (key, options) {\n    if (!this.libp2p.isStarted() || !this.dht.isStarted) {\n      throw errCode(new Error(messages.NOT_STARTED_YET), codes.DHT_NOT_STARTED)\n    }\n\n    return this.dht.get(key, options)\n  }\n\n  /**\n   * Get the `n` values to the given key without sorting.\n   *\n   * @param {Uint8Array} key\n   * @param {number} nVals\n   * @param {Object} [options] - get options\n   * @param {number} [options.timeout] - optional timeout (default: 60000)\n   * @returns {Promise<GetData[]>}\n   */\n  async getMany (key, nVals, options) { // eslint-disable-line require-await\n    if (!this.libp2p.isStarted() || !this.dht.isStarted) {\n      throw errCode(new Error(messages.NOT_STARTED_YET), codes.DHT_NOT_STARTED)\n    }\n\n    return this.dht.getMany(key, nVals, options)\n  }\n}\n\nmodule.exports = ContentRouting\n","'use strict'\n\nconst PeerId = require('peer-id')\nconst { Multiaddr } = require('multiaddr')\nconst errCode = require('err-code')\n\nconst { codes } = require('./errors')\n\n/**\n * Converts the given `peer` to a `Peer` object.\n * If a multiaddr is received, the addressBook is updated.\n *\n * @param {PeerId|Multiaddr|string} peer\n * @returns {{ id: PeerId, multiaddrs: Multiaddr[]|undefined }}\n */\nfunction getPeer (peer) {\n  if (typeof peer === 'string') {\n    peer = new Multiaddr(peer)\n  }\n\n  let addr\n  if (Multiaddr.isMultiaddr(peer)) {\n    addr = peer\n    const idStr = peer.getPeerId()\n\n    if (!idStr) {\n      throw errCode(\n        new Error(`${peer} does not have a valid peer type`),\n        codes.ERR_INVALID_MULTIADDR\n      )\n    }\n\n    try {\n      peer = PeerId.createFromB58String(idStr)\n    } catch (err) {\n      throw errCode(\n        new Error(`${peer} is not a valid peer type`),\n        codes.ERR_INVALID_MULTIADDR\n      )\n    }\n  }\n\n  return {\n    id: peer,\n    multiaddrs: addr ? [addr] : undefined\n  }\n}\n\nmodule.exports = getPeer\n","'use strict'\n\nconst mergeOptions = require('merge-options')\n// @ts-ignore no types in multiaddr path\nconst { dnsaddrResolver } = require('multiaddr/src/resolvers')\n\nconst Constants = require('./constants')\nconst { AGENT_VERSION } = require('./identify/consts')\nconst RelayConstants = require('./circuit/constants')\n\nconst { publicAddressesFirst } = require('libp2p-utils/src/address-sort')\nconst { FaultTolerance } = require('./transport-manager')\n\n/**\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n * @typedef {import('.').Libp2pOptions} Libp2pOptions\n * @typedef {import('.').constructorOptions} constructorOptions\n */\n\nconst DefaultConfig = {\n  addresses: {\n    listen: [],\n    announce: [],\n    noAnnounce: [],\n    announceFilter: (/** @type {Multiaddr[]} */ multiaddrs) => multiaddrs\n  },\n  connectionManager: {\n    minConnections: 25\n  },\n  transportManager: {\n    faultTolerance: FaultTolerance.FATAL_ALL\n  },\n  dialer: {\n    maxParallelDials: Constants.MAX_PARALLEL_DIALS,\n    maxDialsPerPeer: Constants.MAX_PER_PEER_DIALS,\n    dialTimeout: Constants.DIAL_TIMEOUT,\n    resolvers: {\n      dnsaddr: dnsaddrResolver\n    },\n    addressSorter: publicAddressesFirst\n  },\n  host: {\n    agentVersion: AGENT_VERSION\n  },\n  metrics: {\n    enabled: false\n  },\n  peerStore: {\n    persistence: false,\n    threshold: 5\n  },\n  peerRouting: {\n    refreshManager: {\n      enabled: true,\n      interval: 6e5,\n      bootDelay: 10e3\n    }\n  },\n  config: {\n    dht: {\n      enabled: false,\n      kBucketSize: 20,\n      randomWalk: {\n        enabled: false, // disabled waiting for https://github.com/libp2p/js-libp2p-kad-dht/issues/86\n        queriesPerPeriod: 1,\n        interval: 300e3,\n        timeout: 10e3\n      }\n    },\n    nat: {\n      enabled: true,\n      ttl: 7200,\n      keepAlive: true,\n      gateway: null,\n      externalIp: null,\n      pmp: {\n        enabled: false\n      }\n    },\n    peerDiscovery: {\n      autoDial: true\n    },\n    pubsub: {\n      enabled: true\n    },\n    relay: {\n      enabled: true,\n      advertise: {\n        bootDelay: RelayConstants.ADVERTISE_BOOT_DELAY,\n        enabled: false,\n        ttl: RelayConstants.ADVERTISE_TTL\n      },\n      hop: {\n        enabled: false,\n        active: false\n      },\n      autoRelay: {\n        enabled: false,\n        maxListeners: 2\n      }\n    },\n    transport: {}\n  }\n}\n\n/**\n * @param {Libp2pOptions} opts\n * @returns {DefaultConfig & Libp2pOptions & constructorOptions}\n */\nmodule.exports.validate = (opts) => {\n  /** @type {DefaultConfig & Libp2pOptions & constructorOptions} */\n  const resultingOptions = mergeOptions(DefaultConfig, opts)\n\n  if (resultingOptions.modules.transport.length < 1) throw new Error(\"'options.modules.transport' must contain at least 1 transport\")\n\n  return resultingOptions\n}\n","'use strict'\n\nconst protocols = require('../protocols-table')\n\nconst { code: dnsaddrCode } = protocols('dnsaddr')\n\n/**\n * @typedef {import('..').Multiaddr} Multiaddr\n */\n\n/**\n * Resolver for dnsaddr addresses.\n *\n * @param {Multiaddr} addr\n * @returns {Promise<string[]>}\n */\nasync function dnsaddrResolver (addr) {\n  const Resolver = require('./dns')\n  const resolver = new Resolver()\n\n  const peerId = addr.getPeerId()\n  const [, hostname] = addr.stringTuples().find(([proto]) => proto === dnsaddrCode) || []\n\n  const records = await resolver.resolveTxt(`_dnsaddr.${hostname}`)\n  let addresses = records.flat().map((a) => a.split('=')[1])\n\n  if (peerId) {\n    addresses = addresses.filter((entry) => entry.includes(peerId))\n  }\n\n  return addresses\n}\n\nmodule.exports = {\n  dnsaddrResolver\n}\n","'use strict'\n\n/** @type {import('dns').promises.Resolver} */\n// @ts-ignore - has no types\nconst dns = require('dns-over-http-resolver')\n\nmodule.exports = dns\n","'use strict'\nconst debug = require('debug')\nconst log = debug('dns-over-http-resolver')\nlog.error = debug('dns-over-http-resolver:error')\n\nconst Receptacle = require('receptacle')\n\nconst utils = require('./utils')\n\n/**\n * DNS over HTTP resolver.\n * Uses a list of servers to resolve DNS records with HTTP requests.\n */\nclass Resolver {\n  /**\n   * @class\n   * @param {object} [properties]\n   * @param {number} [properties.maxCache = 100] - maximum number of cached dns records.\n   */\n  constructor ({ maxCache = 100 } = {}) {\n    this._cache = new Receptacle({ max: maxCache })\n    this._servers = [\n      'https://cloudflare-dns.com/dns-query',\n      'https://dns.google/resolve'\n    ]\n  }\n\n  /**\n   * Get an array of the IP addresses currently configured for DNS resolution.\n   * These addresses are formatted according to RFC 5952. It can include a custom port.\n   *\n   * @returns {Array<string>}\n   */\n  getServers () {\n    return this._servers\n  }\n\n  /**\n   * Get a shuffled array of the IP addresses currently configured for DNS resolution.\n   * These addresses are formatted according to RFC 5952. It can include a custom port.\n   *\n   * @returns {Array<string>}\n   */\n  _getShuffledServers () {\n    const newServers = [].concat(this._servers)\n\n    for (let i = newServers.length - 1; i > 0; i--) {\n      const j = Math.floor(Math.random() * i)\n      const temp = newServers[i]\n      newServers[i] = newServers[j]\n      newServers[j] = temp\n    }\n\n    return newServers\n  }\n\n  /**\n   * Sets the IP address and port of servers to be used when performing DNS resolution.\n   *\n   * @param {Array<string>} servers - array of RFC 5952 formatted addresses.\n   */\n  setServers (servers) {\n    this._servers = servers\n  }\n\n  /**\n   * Uses the DNS protocol to resolve the given host name into the appropriate DNS record.\n   *\n   * @param {string} hostname - host name to resolve.\n   * @param {string} [rrType = 'A'] - resource record type.\n   * @returns {Promise<*>}\n   */\n  resolve (hostname, rrType = 'A') {\n    switch (rrType) {\n      case 'A':\n        return this.resolve4(hostname)\n      case 'AAAA':\n        return this.resolve6(hostname)\n      case 'TXT':\n        return this.resolveTxt(hostname)\n      default:\n        throw new Error(`${rrType} is not supported`)\n    }\n  }\n\n  /**\n   * Uses the DNS protocol to resolve the given host name into IPv4 addresses.\n   *\n   * @param {string} hostname - host name to resolve.\n   * @returns {Promise<Array<string>>}\n   */\n  async resolve4 (hostname) {\n    const recordType = 'A'\n    const cached = this._cache.get(utils.getCacheKey(hostname, recordType))\n    if (cached) {\n      return cached\n    }\n\n    for (const server of this._getShuffledServers()) {\n      try {\n        const response = await utils.fetch(utils.buildResource({\n          serverResolver: server,\n          hostname,\n          recordType\n        }))\n\n        const d = await response.json()\n        const data = d.Answer.map(a => a.data)\n        const ttl = Math.min(d.Answer.map(a => a.TTL))\n\n        this._cache.set(utils.getCacheKey(hostname, recordType), data, { ttl })\n\n        return data\n      } catch (err) {\n        log.error(`${server} could not resolve ${hostname} record ${recordType}`)\n      }\n    }\n\n    throw new Error(`Could not resolve ${hostname} record ${recordType}`)\n  }\n\n  /**\n   * Uses the DNS protocol to resolve the given host name into IPv6 addresses.\n   *\n   * @param {string} hostname - host name to resolve.\n   * @returns {Promise<Array<string>>}\n   */\n  async resolve6 (hostname) {\n    const recordType = 'AAAA'\n    const cached = this._cache.get(utils.getCacheKey(hostname, recordType))\n    if (cached) {\n      return cached\n    }\n\n    for (const server of this._getShuffledServers()) {\n      try {\n        const response = await utils.fetch(utils.buildResource({\n          serverResolver: server,\n          hostname,\n          recordType\n        }))\n\n        const d = await response.json()\n        const data = d.Answer.map(a => a.data)\n        const ttl = Math.min(d.Answer.map(a => a.TTL))\n\n        this._cache.set(utils.getCacheKey(hostname, recordType), data, { ttl })\n\n        return data\n      } catch (err) {\n        log.error(`${server} could not resolve ${hostname} record ${recordType}`)\n      }\n    }\n\n    throw new Error(`Could not resolve ${hostname} record ${recordType}`)\n  }\n\n  /**\n   * Uses the DNS protocol to resolve the given host name into a Text record.\n   *\n   * @param {string} hostname - host name to resolve.\n   * @returns {Promise<Array<Array<string>>>}\n   */\n  async resolveTxt (hostname) {\n    const recordType = 'TXT'\n    const cached = this._cache.get(utils.getCacheKey(hostname, recordType))\n    if (cached) {\n      return cached\n    }\n\n    for (const server of this._getShuffledServers()) {\n      try {\n        const response = await utils.fetch(utils.buildResource({\n          serverResolver: server,\n          hostname,\n          recordType\n        }))\n\n        const d = await response.json()\n        const data = d.Answer.map(a => [a.data.replace(/['\"]+/g, '')])\n        const ttl = Math.min(d.Answer.map(a => a.TTL))\n\n        this._cache.set(utils.getCacheKey(hostname, recordType), data, { ttl })\n\n        return data\n      } catch (err) {\n        log.error(`${server} could not resolve ${hostname} record ${recordType}`)\n      }\n    }\n\n    throw new Error(`Could not resolve ${hostname} record ${recordType}`)\n  }\n}\n\nResolver.Resolver = Resolver\nmodule.exports = Resolver\n","'use strict'\n\nmodule.exports = Receptacle\nvar toMS = require('ms')\nvar cache = Receptacle.prototype\nvar counter = new Date() % 1e9\n\nfunction getUID () { return (Math.random() * 1e9 >>> 0) + (counter++) }\n\n/**\n * Creates a cache with a maximum key size.\n *\n * @constructor\n * @param {Object} options\n * @param {Number} [options.max=Infinity] the maximum number of keys allowed in the cache (lru).\n * @param {Array} [options.items=[]] the default items in the cache.\n */\nfunction Receptacle (options) {\n  options = options || {}\n  this.id = options.id || getUID()\n  this.max = options.max || Infinity\n  this.items = options.items || []\n  this._lookup = {}\n  this.size = this.items.length\n  this.lastModified = new Date(options.lastModified || new Date())\n\n  // Setup initial timers and indexes for the cache.\n  for (var item, ttl, i = this.items.length; i--;) {\n    item = this.items[i]\n    ttl = new Date(item.expires) - new Date()\n    this._lookup[item.key] = item\n    if (ttl > 0) this.expire(item.key, ttl)\n    else if (ttl <= 0) this.delete(item.key)\n  }\n}\n\n/**\n * Tests if a key is currently in the cache.\n * Does not check if slot is empty.\n *\n * @param {String} key - the key to retrieve from the cache.\n * @return {Boolean}\n */\ncache.has = function (key) {\n  return key in this._lookup\n}\n\n/**\n * Retrieves a key from the cache and marks it as recently used.\n *\n * @param {String} key - the key to retrieve from the cache.\n * @return {*}\n */\ncache.get = function (key) {\n  if (!this.has(key)) return null\n  var record = this._lookup[key]\n  // Update expiry for \"refresh\" keys\n  if (record.refresh) this.expire(key, record.refresh)\n  // Move to front of the line.\n  this.items.splice(this.items.indexOf(record), 1)\n  this.items.push(record)\n  return record.value\n}\n\n/**\n * Retrieves user meta data for a cached item.\n *\n * @param {String} key - the key to retrieve meta data from the cache.\n * @return {*}\n */\ncache.meta = function (key) {\n  if (!this.has(key)) return null\n  var record = this._lookup[key]\n  if (!('meta' in record)) return null\n  return record.meta\n}\n\n/**\n * Puts a key into the cache with an optional expiry time.\n *\n * @param {String} key - the key for the value in the cache.\n * @param {*} value - the value to place at the key.\n * @param {Number} [options.ttl] - a time after which the key will be removed.\n * @return {Receptacle}\n */\ncache.set = function (key, value, options) {\n  var oldRecord = this._lookup[key]\n  var record = this._lookup[key] = { key: key, value: value }\n  // Mark cache as modified.\n  this.lastModified = new Date()\n\n  if (oldRecord) {\n    // Replace an old key.\n    clearTimeout(oldRecord.timeout)\n    this.items.splice(this.items.indexOf(oldRecord), 1, record)\n  } else {\n    // Remove least used item if needed.\n    if (this.size >= this.max) this.delete(this.items[0].key)\n    // Add a new key.\n    this.items.push(record)\n    this.size++\n  }\n\n  if (options) {\n    // Setup key expiry.\n    if ('ttl' in options) this.expire(key, options.ttl)\n    // Store user options in the record.\n    if ('meta' in options) record.meta = options.meta\n    // Mark a auto refresh key.\n    if (options.refresh) record.refresh = options.ttl\n  }\n\n  return this\n}\n\n/**\n * Deletes an item from the cache.\n *\n * @param {String} key - the key to remove.\n * @return {Receptacle}\n */\ncache.delete = function (key) {\n  var record = this._lookup[key]\n  if (!record) return false\n  this.lastModified = new Date()\n  this.items.splice(this.items.indexOf(record), 1)\n  clearTimeout(record.timeout)\n  delete this._lookup[key]\n  this.size--\n  return this\n}\n\n/**\n * Utility to register a key that will be removed after some time.\n *\n * @param {String} key - the key to remove.\n * @param {Number} [ms] - the timeout before removal.\n * @return {Receptacle}\n */\ncache.expire = function (key, ttl) {\n  var ms = ttl || 0\n  var record = this._lookup[key]\n  if (!record) return this\n  if (typeof ms === 'string') ms = toMS(ttl)\n  if (typeof ms !== 'number') throw new TypeError('Expiration time must be a string or number.')\n  clearTimeout(record.timeout)\n  record.timeout = setTimeout(this.delete.bind(this, record.key), ms)\n  record.expires = Number(new Date()) + ms\n  return this\n}\n\n/**\n * Deletes all items from the cache.\n * @return {Receptacle}\n */\ncache.clear = function () {\n  for (var i = this.items.length; i--;) this.delete(this.items[i].key)\n  return this\n}\n\n/**\n * Fixes serialization issues in polyfilled environments.\n * Ensures non-cyclical serialized object.\n */\ncache.toJSON = function () {\n  var items = new Array(this.items.length)\n  var item\n  for (var i = items.length; i--;) {\n    item = this.items[i]\n    items[i] = {\n      key: item.key,\n      meta: item.meta,\n      value: item.value,\n      expires: item.expires,\n      refresh: item.refresh\n    }\n  }\n\n  return {\n    id: this.id,\n    max: isFinite(this.max) ? this.max : undefined,\n    lastModified: this.lastModified,\n    items: items\n  }\n}\n","/**\n * Helpers.\n */\n\nvar s = 1000;\nvar m = s * 60;\nvar h = m * 60;\nvar d = h * 24;\nvar w = d * 7;\nvar y = d * 365.25;\n\n/**\n * Parse or format the given `val`.\n *\n * Options:\n *\n *  - `long` verbose formatting [false]\n *\n * @param {String|Number} val\n * @param {Object} [options]\n * @throws {Error} throw an error if val is not a non-empty string or a number\n * @return {String|Number}\n * @api public\n */\n\nmodule.exports = function (val, options) {\n  options = options || {};\n  var type = typeof val;\n  if (type === 'string' && val.length > 0) {\n    return parse(val);\n  } else if (type === 'number' && isFinite(val)) {\n    return options.long ? fmtLong(val) : fmtShort(val);\n  }\n  throw new Error(\n    'val is not a non-empty string or a valid number. val=' +\n      JSON.stringify(val)\n  );\n};\n\n/**\n * Parse the given `str` and return milliseconds.\n *\n * @param {String} str\n * @return {Number}\n * @api private\n */\n\nfunction parse(str) {\n  str = String(str);\n  if (str.length > 100) {\n    return;\n  }\n  var match = /^(-?(?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(\n    str\n  );\n  if (!match) {\n    return;\n  }\n  var n = parseFloat(match[1]);\n  var type = (match[2] || 'ms').toLowerCase();\n  switch (type) {\n    case 'years':\n    case 'year':\n    case 'yrs':\n    case 'yr':\n    case 'y':\n      return n * y;\n    case 'weeks':\n    case 'week':\n    case 'w':\n      return n * w;\n    case 'days':\n    case 'day':\n    case 'd':\n      return n * d;\n    case 'hours':\n    case 'hour':\n    case 'hrs':\n    case 'hr':\n    case 'h':\n      return n * h;\n    case 'minutes':\n    case 'minute':\n    case 'mins':\n    case 'min':\n    case 'm':\n      return n * m;\n    case 'seconds':\n    case 'second':\n    case 'secs':\n    case 'sec':\n    case 's':\n      return n * s;\n    case 'milliseconds':\n    case 'millisecond':\n    case 'msecs':\n    case 'msec':\n    case 'ms':\n      return n;\n    default:\n      return undefined;\n  }\n}\n\n/**\n * Short format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtShort(ms) {\n  var msAbs = Math.abs(ms);\n  if (msAbs >= d) {\n    return Math.round(ms / d) + 'd';\n  }\n  if (msAbs >= h) {\n    return Math.round(ms / h) + 'h';\n  }\n  if (msAbs >= m) {\n    return Math.round(ms / m) + 'm';\n  }\n  if (msAbs >= s) {\n    return Math.round(ms / s) + 's';\n  }\n  return ms + 'ms';\n}\n\n/**\n * Long format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtLong(ms) {\n  var msAbs = Math.abs(ms);\n  if (msAbs >= d) {\n    return plural(ms, msAbs, d, 'day');\n  }\n  if (msAbs >= h) {\n    return plural(ms, msAbs, h, 'hour');\n  }\n  if (msAbs >= m) {\n    return plural(ms, msAbs, m, 'minute');\n  }\n  if (msAbs >= s) {\n    return plural(ms, msAbs, s, 'second');\n  }\n  return ms + ' ms';\n}\n\n/**\n * Pluralization helper.\n */\n\nfunction plural(ms, msAbs, n, name) {\n  var isPlural = msAbs >= n * 1.5;\n  return Math.round(ms / n) + ' ' + name + (isPlural ? 's' : '');\n}\n","'use strict'\n\nconst { default: nativeFetch, Headers } = require('native-fetch')\n\n/**\n * Build fetch resource for request.\n *\n * @param {object} properties\n * @param {string} properties.serverResolver\n * @param {string} properties.hostname\n * @param {string} properties.recordType\n * @returns {string}\n */\nfunction buildResource ({ serverResolver, hostname, recordType }) {\n  return `${serverResolver}?name=${hostname}&type=${recordType}`\n}\n\n/**\n * Use fetch to find the record.\n *\n * @param {object} resource\n * @returns {Promise}\n */\nfunction fetch (resource) {\n  return nativeFetch(resource, {\n    headers: new Headers({\n      accept: 'application/dns-json'\n    })\n  })\n}\n\n/**\n * Creates cache key composed by recordType and hostname.\n *\n * @param {string} hostname\n * @param {string} recordType\n * @returns {string}\n */\nfunction getCacheKey (hostname, recordType) {\n  return `${recordType}_${hostname}`\n}\n\nmodule.exports = {\n  buildResource,\n  fetch,\n  getCacheKey\n}\n","'use strict'\n\nif (globalThis.fetch && globalThis.Headers && globalThis.Request && globalThis.Response) {\n  module.exports = {\n    default: globalThis.fetch,\n    Headers: globalThis.Headers,\n    Request: globalThis.Request,\n    Response: globalThis.Response\n  }\n} else {\n  module.exports = {\n    default: require('node-fetch').default,\n    Headers: require('node-fetch').Headers,\n    Request: require('node-fetch').Request,\n    Response: require('node-fetch').Response\n  }\n}\n","\"use strict\";\n\n// ref: https://github.com/tc39/proposal-global\nvar getGlobal = function () {\n\t// the only reliable means to get the global object is\n\t// `Function('return this')()`\n\t// However, this causes CSP violations in Chrome apps.\n\tif (typeof self !== 'undefined') { return self; }\n\tif (typeof window !== 'undefined') { return window; }\n\tif (typeof global !== 'undefined') { return global; }\n\tthrow new Error('unable to locate global object');\n}\n\nvar global = getGlobal();\n\nmodule.exports = exports = global.fetch;\n\n// Needed for TypeScript and Webpack.\nif (global.fetch) {\n\texports.default = global.fetch.bind(global);\n}\n\nexports.Headers = global.Headers;\nexports.Request = global.Request;\nexports.Response = global.Response;","'use strict'\n\nmodule.exports = {\n  DIAL_TIMEOUT: 30e3, // How long in ms a dial attempt is allowed to take\n  MAX_PARALLEL_DIALS: 100, // Maximum allowed concurrent dials\n  MAX_PER_PEER_DIALS: 4, // Allowed parallel dials per DialRequest\n  METRICS: {\n    computeThrottleMaxQueueSize: 1000,\n    computeThrottleTimeout: 2000,\n    movingAverageIntervals: [\n      60 * 1000, // 1 minute\n      5 * 60 * 1000, // 5 minutes\n      15 * 60 * 1000 // 15 minutes\n    ],\n    maxOldPeersRetention: 50\n  }\n}\n","'use strict'\n\n// @ts-ignore file not listed within the file list of projects\nconst libp2pVersion = require('../../package.json').version\n\nmodule.exports.PROTOCOL_VERSION = 'ipfs/0.1.0'\nmodule.exports.AGENT_VERSION = `js-libp2p/${libp2pVersion}`\nmodule.exports.MULTICODEC_IDENTIFY = '/ipfs/id/1.0.0'\nmodule.exports.MULTICODEC_IDENTIFY_PUSH = '/ipfs/id/push/1.0.0'\n","'use strict'\n\nconst minute = 60 * 1000\n\nmodule.exports = {\n  ADVERTISE_BOOT_DELAY: 15 * minute, // Delay before HOP relay service is advertised on the network\n  ADVERTISE_TTL: 30 * minute, // Delay Between HOP relay service advertisements on the network\n  CIRCUIT_PROTO_CODE: 290, // Multicodec code\n  HOP_METADATA_KEY: 'hop_relay', // PeerStore metadaBook key for HOP relay service\n  HOP_METADATA_VALUE: 'true', // PeerStore metadaBook value for HOP relay service\n  RELAY_RENDEZVOUS_NS: '/libp2p/relay' // Relay HOP relay service namespace for discovery\n}\n","'use strict'\n\nconst isPrivate = require('./multiaddr/is-private')\n\n/**\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n */\n\n/**\n * @typedef {Object} Address\n * @property {Multiaddr} multiaddr peer multiaddr.\n * @property {boolean} isCertified obtained from a signed peer record.\n */\n\n/**\n * Compare function for array.sort().\n * This sort aims to move the private adresses to the end of the array.\n * In case of equality, a certified address will come first.\n *\n * @param {Address} a\n * @param {Address} b\n * @returns {number}\n */\nfunction addressesPublicFirstCompareFunction (a, b) {\n  const isAPrivate = isPrivate(a.multiaddr)\n  const isBPrivate = isPrivate(b.multiaddr)\n\n  if (isAPrivate && !isBPrivate) {\n    return 1\n  } else if (!isAPrivate && isBPrivate) {\n    return -1\n  }\n  // Check certified?\n  if (a.isCertified && !b.isCertified) {\n    return -1\n  } else if (!a.isCertified && b.isCertified) {\n    return 1\n  }\n\n  return 0\n}\n\n/**\n * Sort given addresses by putting public addresses first.\n * In case of equality, a certified address will come first.\n *\n * @param {Array<Address>} addresses\n * @returns {Array<Address>}\n */\nfunction publicAddressesFirst (addresses) {\n  return [...addresses].sort(addressesPublicFirstCompareFunction)\n}\n\nmodule.exports.publicAddressesFirst = publicAddressesFirst\n","'use strict'\n\n// @ts-ignore private-ip does not publish types\nconst isIpPrivate = require('private-ip')\n\n/**\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n */\n\n/**\n * Check if a given multiaddr has a private address.\n *\n * @param {Multiaddr} ma\n * @returns {boolean}\n */\nfunction isPrivate (ma) {\n  const { address } = ma.nodeAddress()\n\n  return isIpPrivate(address)\n}\n\nmodule.exports = isPrivate\n","'use strict'\n\nmodule.exports = require('./lib')\n","const Netmask = require('netmask').Netmask;\nconst ip_regex = require('ip-regex');\n\nconst PRIVATE_IP_RANGES = ['0.0.0.0/8', '10.0.0.0/8', '100.64.0.0/10', '127.0.0.0/8', '169.254.0.0/16', '172.16.0.0/12', '192.0.0.0/24', '192.0.0.0/29', '192.0.0.8/32', '192.0.0.9/32', '192.0.0.10/32', '192.0.0.170/32', '192.0.0.171/32', '192.0.2.0/24', '192.31.196.0/24', '192.52.193.0/24', '192.88.99.0/24', '192.168.0.0/16', '192.175.48.0/24', '198.18.0.0/15', '198.51.100.0/24', '203.0.113.0/24', '240.0.0.0/4', '255.255.255.255/32'];\n\nconst NETMASK_RANGES = PRIVATE_IP_RANGES.map(ip_range => new Netmask(ip_range));\n\nfunction ipv4_check(ip_addr) {\n  for (let r of NETMASK_RANGES) {\n    if (r.contains(ip_addr)) return true;\n  }\n\n  return false;\n}\n\nfunction ipv6_check(ip_addr) {\n  return (/^::$/.test(ip_addr) || /^::1$/.test(ip_addr) || /^::f{4}:([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})$/.test(ip_addr) || /^::f{4}:0.([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})$/.test(ip_addr) || /^64:ff9b::([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})$/.test(ip_addr) || /^100::([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ip_addr) || /^2001::([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ip_addr) || /^2001:2[0-9a-fA-F]:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ip_addr) || /^2001:db8:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ip_addr) || /^2002:([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4}):?([0-9a-fA-F]{0,4})$/.test(ip_addr) || /^f[c-d]([0-9a-fA-F]{2,2}):/i.test(ip_addr) || /^fe[8-9a-bA-B][0-9a-fA-F]:/i.test(ip_addr) || /^ff([0-9a-fA-F]{2,2}):/i.test(ip_addr)\n  );\n}\n\nmodule.exports = ip_addr => {\n  if (ip_regex.v6().test(ip_addr)) return ipv6_check(ip_addr);else if (ip_regex().test(ip_addr) || ip_addr.startsWith('0')) return ipv4_check(ip_addr);\n\n  return false;\n};","// Generated by CoffeeScript 1.12.7\n(function() {\n  var Netmask, atob, chr, chr0, chrA, chra, ip2long, long2ip;\n\n  long2ip = function(long) {\n    var a, b, c, d;\n    a = (long & (0xff << 24)) >>> 24;\n    b = (long & (0xff << 16)) >>> 16;\n    c = (long & (0xff << 8)) >>> 8;\n    d = long & 0xff;\n    return [a, b, c, d].join('.');\n  };\n\n  ip2long = function(ip) {\n    var b, c, i, j, n, ref;\n    b = [];\n    for (i = j = 0; j <= 3; i = ++j) {\n      if (ip.length === 0) {\n        break;\n      }\n      if (i > 0) {\n        if (ip[0] !== '.') {\n          throw new Error('Invalid IP');\n        }\n        ip = ip.substring(1);\n      }\n      ref = atob(ip), n = ref[0], c = ref[1];\n      ip = ip.substring(c);\n      b.push(n);\n    }\n    if (ip.length !== 0) {\n      throw new Error('Invalid IP');\n    }\n    switch (b.length) {\n      case 1:\n        if (b[0] > 0xFFFFFFFF) {\n          throw new Error('Invalid IP');\n        }\n        return b[0] >>> 0;\n      case 2:\n        if (b[0] > 0xFF || b[1] > 0xFFFFFF) {\n          throw new Error('Invalid IP');\n        }\n        return (b[0] << 24 | b[1]) >>> 0;\n      case 3:\n        if (b[0] > 0xFF || b[1] > 0xFF || b[2] > 0xFFFF) {\n          throw new Error('Invalid IP');\n        }\n        return (b[0] << 24 | b[1] << 16 | b[2]) >>> 0;\n      case 4:\n        if (b[0] > 0xFF || b[1] > 0xFF || b[2] > 0xFF || b[3] > 0xFF) {\n          throw new Error('Invalid IP');\n        }\n        return (b[0] << 24 | b[1] << 16 | b[2] << 8 | b[3]) >>> 0;\n      default:\n        throw new Error('Invalid IP');\n    }\n  };\n\n  chr = function(b) {\n    return b.charCodeAt(0);\n  };\n\n  chr0 = chr('0');\n\n  chra = chr('a');\n\n  chrA = chr('A');\n\n  atob = function(s) {\n    var base, dmax, i, n, start;\n    n = 0;\n    base = 10;\n    dmax = '9';\n    i = 0;\n    if (s.length > 1 && s[i] === '0') {\n      if (s[i + 1] === 'x' || s[i + 1] === 'X') {\n        i += 2;\n        base = 16;\n      } else if ('0' <= s[i + 1] && s[i + 1] <= '9') {\n        i++;\n        base = 8;\n        dmax = '7';\n      }\n    }\n    start = i;\n    while (i < s.length) {\n      if ('0' <= s[i] && s[i] <= dmax) {\n        n = (n * base + (chr(s[i]) - chr0)) >>> 0;\n      } else if (base === 16) {\n        if ('a' <= s[i] && s[i] <= 'f') {\n          n = (n * base + (10 + chr(s[i]) - chra)) >>> 0;\n        } else if ('A' <= s[i] && s[i] <= 'F') {\n          n = (n * base + (10 + chr(s[i]) - chrA)) >>> 0;\n        } else {\n          break;\n        }\n      } else {\n        break;\n      }\n      if (n > 0xFFFFFFFF) {\n        throw new Error('too large');\n      }\n      i++;\n    }\n    if (i === start) {\n      throw new Error('empty octet');\n    }\n    return [n, i];\n  };\n\n  Netmask = (function() {\n    function Netmask(net, mask) {\n      var error, i, j, ref;\n      if (typeof net !== 'string') {\n        throw new Error(\"Missing `net' parameter\");\n      }\n      if (!mask) {\n        ref = net.split('/', 2), net = ref[0], mask = ref[1];\n      }\n      if (!mask) {\n        mask = 32;\n      }\n      if (typeof mask === 'string' && mask.indexOf('.') > -1) {\n        try {\n          this.maskLong = ip2long(mask);\n        } catch (error1) {\n          error = error1;\n          throw new Error(\"Invalid mask: \" + mask);\n        }\n        for (i = j = 32; j >= 0; i = --j) {\n          if (this.maskLong === (0xffffffff << (32 - i)) >>> 0) {\n            this.bitmask = i;\n            break;\n          }\n        }\n      } else if (mask || mask === 0) {\n        this.bitmask = parseInt(mask, 10);\n        this.maskLong = 0;\n        if (this.bitmask > 0) {\n          this.maskLong = (0xffffffff << (32 - this.bitmask)) >>> 0;\n        }\n      } else {\n        throw new Error(\"Invalid mask: empty\");\n      }\n      try {\n        this.netLong = (ip2long(net) & this.maskLong) >>> 0;\n      } catch (error1) {\n        error = error1;\n        throw new Error(\"Invalid net address: \" + net);\n      }\n      if (!(this.bitmask <= 32)) {\n        throw new Error(\"Invalid mask for ip4: \" + mask);\n      }\n      this.size = Math.pow(2, 32 - this.bitmask);\n      this.base = long2ip(this.netLong);\n      this.mask = long2ip(this.maskLong);\n      this.hostmask = long2ip(~this.maskLong);\n      this.first = this.bitmask <= 30 ? long2ip(this.netLong + 1) : this.base;\n      this.last = this.bitmask <= 30 ? long2ip(this.netLong + this.size - 2) : long2ip(this.netLong + this.size - 1);\n      this.broadcast = this.bitmask <= 30 ? long2ip(this.netLong + this.size - 1) : void 0;\n    }\n\n    Netmask.prototype.contains = function(ip) {\n      if (typeof ip === 'string' && (ip.indexOf('/') > 0 || ip.split('.').length !== 4)) {\n        ip = new Netmask(ip);\n      }\n      if (ip instanceof Netmask) {\n        return this.contains(ip.base) && this.contains(ip.broadcast || ip.last);\n      } else {\n        return (ip2long(ip) & this.maskLong) >>> 0 === (this.netLong & this.maskLong) >>> 0;\n      }\n    };\n\n    Netmask.prototype.next = function(count) {\n      if (count == null) {\n        count = 1;\n      }\n      return new Netmask(long2ip(this.netLong + (this.size * count)), this.mask);\n    };\n\n    Netmask.prototype.forEach = function(fn) {\n      var index, lastLong, long;\n      long = ip2long(this.first);\n      lastLong = ip2long(this.last);\n      index = 0;\n      while (long <= lastLong) {\n        fn(long2ip(long), long, index);\n        index++;\n        long++;\n      }\n    };\n\n    Netmask.prototype.toString = function() {\n      return this.base + \"/\" + this.bitmask;\n    };\n\n    return Netmask;\n\n  })();\n\n  exports.ip2long = ip2long;\n\n  exports.long2ip = long2ip;\n\n  exports.Netmask = Netmask;\n\n}).call(this);\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:transports'), {\n  error: debug('libp2p:transports:err')\n})\n\nconst pSettle = require('p-settle')\nconst { codes } = require('./errors')\nconst errCode = require('err-code')\n\nconst { updateSelfPeerRecord } = require('./record/utils')\n\n/**\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('libp2p-interfaces/src/transport/types').TransportFactory<any, any>} TransportFactory\n * @typedef {import('libp2p-interfaces/src/transport/types').Transport<any, any>} Transport\n *\n * @typedef {Object} TransportManagerProperties\n * @property {import('./')} libp2p\n * @property {import('./upgrader')} upgrader\n *\n * @typedef {Object} TransportManagerOptions\n * @property {number} [faultTolerance = FAULT_TOLERANCE.FATAL_ALL] - Address listen error tolerance.\n */\n\nclass TransportManager {\n  /**\n   * @class\n   * @param {TransportManagerProperties & TransportManagerOptions} options\n   */\n  constructor ({ libp2p, upgrader, faultTolerance = FAULT_TOLERANCE.FATAL_ALL }) {\n    this.libp2p = libp2p\n    this.upgrader = upgrader\n    /** @type {Map<string, Transport>} */\n    this._transports = new Map()\n    this._listeners = new Map()\n    this._listenerOptions = new Map()\n    this.faultTolerance = faultTolerance\n  }\n\n  /**\n   * Adds a `Transport` to the manager\n   *\n   * @param {string} key\n   * @param {TransportFactory} Transport\n   * @param {*} transportOptions - Additional options to pass to the transport\n   * @returns {void}\n   */\n  add (key, Transport, transportOptions = {}) {\n    log('adding %s', key)\n    if (!key) {\n      throw errCode(new Error(`Transport must have a valid key, was given '${key}'`), codes.ERR_INVALID_KEY)\n    }\n    if (this._transports.has(key)) {\n      throw errCode(new Error('There is already a transport with this key'), codes.ERR_DUPLICATE_TRANSPORT)\n    }\n\n    const transport = new Transport({\n      ...transportOptions,\n      libp2p: this.libp2p,\n      upgrader: this.upgrader\n    })\n\n    this._transports.set(key, transport)\n    this._listenerOptions.set(key, transportOptions.listenerOptions || {})\n    if (!this._listeners.has(key)) {\n      this._listeners.set(key, [])\n    }\n  }\n\n  /**\n   * Stops all listeners\n   *\n   * @async\n   */\n  async close () {\n    const tasks = []\n    for (const [key, listeners] of this._listeners) {\n      log('closing listeners for %s', key)\n      while (listeners.length) {\n        const listener = listeners.pop()\n        listener.removeAllListeners('listening')\n        listener.removeAllListeners('close')\n        tasks.push(listener.close())\n      }\n    }\n\n    await Promise.all(tasks)\n    log('all listeners closed')\n    for (const key of this._listeners.keys()) {\n      this._listeners.set(key, [])\n    }\n  }\n\n  /**\n   * Dials the given Multiaddr over it's supported transport\n   *\n   * @param {Multiaddr} ma\n   * @param {*} options\n   * @returns {Promise<Connection>}\n   */\n  async dial (ma, options) {\n    const transport = this.transportForMultiaddr(ma)\n    if (!transport) {\n      throw errCode(new Error(`No transport available for address ${String(ma)}`), codes.ERR_TRANSPORT_UNAVAILABLE)\n    }\n\n    try {\n      return await transport.dial(ma, options)\n    } catch (err) {\n      if (!err.code) err.code = codes.ERR_TRANSPORT_DIAL_FAILED\n      throw err\n    }\n  }\n\n  /**\n   * Returns all Multiaddr's the listeners are using\n   *\n   * @returns {Multiaddr[]}\n   */\n  getAddrs () {\n    /** @type {Multiaddr[]} */\n    let addrs = []\n    for (const listeners of this._listeners.values()) {\n      for (const listener of listeners) {\n        addrs = [...addrs, ...listener.getAddrs()]\n      }\n    }\n    return addrs\n  }\n\n  /**\n   * Returns all the transports instances.\n   *\n   * @returns {IterableIterator<Transport>}\n   */\n  getTransports () {\n    return this._transports.values()\n  }\n\n  /**\n   * Finds a transport that matches the given Multiaddr\n   *\n   * @param {Multiaddr} ma\n   * @returns {Transport|null}\n   */\n  transportForMultiaddr (ma) {\n    for (const transport of this._transports.values()) {\n      const addrs = transport.filter([ma])\n      if (addrs.length) return transport\n    }\n    return null\n  }\n\n  /**\n   * Starts listeners for each listen Multiaddr.\n   *\n   * @async\n   * @param {Multiaddr[]} addrs - addresses to attempt to listen on\n   */\n  async listen (addrs) {\n    if (!addrs || addrs.length === 0) {\n      log('no addresses were provided for listening, this node is dial only')\n      return\n    }\n\n    const couldNotListen = []\n    for (const [key, transport] of this._transports.entries()) {\n      const supportedAddrs = transport.filter(addrs)\n      const tasks = []\n\n      // For each supported multiaddr, create a listener\n      for (const addr of supportedAddrs) {\n        log('creating listener for %s on %s', key, addr)\n        const listener = transport.createListener(this._listenerOptions.get(key))\n        this._listeners.get(key).push(listener)\n\n        // Track listen/close events\n        listener.on('listening', () => updateSelfPeerRecord(this.libp2p))\n        listener.on('close', () => updateSelfPeerRecord(this.libp2p))\n\n        // We need to attempt to listen on everything\n        tasks.push(listener.listen(addr))\n      }\n\n      // Keep track of transports we had no addresses for\n      if (tasks.length === 0) {\n        couldNotListen.push(key)\n        continue\n      }\n\n      const results = await pSettle(tasks)\n      // If we are listening on at least 1 address, succeed.\n      // TODO: we should look at adding a retry (`p-retry`) here to better support\n      // listening on remote addresses as they may be offline. We could then potentially\n      // just wait for any (`p-any`) listener to succeed on each transport before returning\n      const isListening = results.find(r => r.isFulfilled === true)\n      if (!isListening && this.faultTolerance !== FAULT_TOLERANCE.NO_FATAL) {\n        throw errCode(new Error(`Transport (${key}) could not listen on any available address`), codes.ERR_NO_VALID_ADDRESSES)\n      }\n    }\n\n    // If no transports were able to listen, throw an error. This likely\n    // means we were given addresses we do not have transports for\n    if (couldNotListen.length === this._transports.size) {\n      const message = `no valid addresses were provided for transports [${couldNotListen}]`\n      if (this.faultTolerance === FAULT_TOLERANCE.FATAL_ALL) {\n        throw errCode(new Error(message), codes.ERR_NO_VALID_ADDRESSES)\n      }\n      log(`libp2p in dial mode only: ${message}`)\n    }\n  }\n\n  /**\n   * Removes the given transport from the manager.\n   * If a transport has any running listeners, they will be closed.\n   *\n   * @async\n   * @param {string} key\n   */\n  async remove (key) {\n    log('removing %s', key)\n    if (this._listeners.has(key)) {\n      // Close any running listeners\n      for (const listener of this._listeners.get(key)) {\n        listener.removeAllListeners('listening')\n        listener.removeAllListeners('close')\n        await listener.close()\n      }\n    }\n\n    this._transports.delete(key)\n    this._listeners.delete(key)\n  }\n\n  /**\n   * Removes all transports from the manager.\n   * If any listeners are running, they will be closed.\n   *\n   * @async\n   */\n  async removeAll () {\n    const tasks = []\n    for (const key of this._transports.keys()) {\n      tasks.push(this.remove(key))\n    }\n\n    await Promise.all(tasks)\n  }\n}\n\n/**\n * Enum Transport Manager Fault Tolerance values.\n * FATAL_ALL should be used for failing in any listen circumstance.\n * NO_FATAL should be used for not failing when not listening.\n *\n * @readonly\n * @enum {number}\n */\nconst FAULT_TOLERANCE = {\n  FATAL_ALL: 0,\n  NO_FATAL: 1\n}\n\nTransportManager.FaultTolerance = FAULT_TOLERANCE\n\nmodule.exports = TransportManager\n","'use strict';\nconst pReflect = require('p-reflect');\nconst pLimit = require('p-limit');\n\nmodule.exports = async (array, options = {}) => {\n\tconst {concurrency = Infinity} = options;\n\tconst limit = pLimit(concurrency);\n\n\treturn Promise.all(array.map(element => {\n\t\tif (element && typeof element.then === 'function') { // eslint-disable-line promise/prefer-await-to-then\n\t\t\treturn pReflect(element);\n\t\t}\n\n\t\tif (typeof element === 'function') {\n\t\t\treturn pReflect(limit(() => element()));\n\t\t}\n\n\t\treturn pReflect(Promise.resolve(element));\n\t}));\n};\n","'use strict';\n\nconst pReflect = async promise => {\n\ttry {\n\t\tconst value = await promise;\n\t\treturn {\n\t\t\tisFulfilled: true,\n\t\t\tisRejected: false,\n\t\t\tvalue\n\t\t};\n\t} catch (error) {\n\t\treturn {\n\t\t\tisFulfilled: false,\n\t\t\tisRejected: true,\n\t\t\treason: error\n\t\t};\n\t}\n};\n\nmodule.exports = pReflect;\n// TODO: Remove this for the next major release\nmodule.exports.default = pReflect;\n","'use strict';\nconst pTry = require('p-try');\n\nconst pLimit = concurrency => {\n\tif (!((Number.isInteger(concurrency) || concurrency === Infinity) && concurrency > 0)) {\n\t\treturn Promise.reject(new TypeError('Expected `concurrency` to be a number from 1 and up'));\n\t}\n\n\tconst queue = [];\n\tlet activeCount = 0;\n\n\tconst next = () => {\n\t\tactiveCount--;\n\n\t\tif (queue.length > 0) {\n\t\t\tqueue.shift()();\n\t\t}\n\t};\n\n\tconst run = (fn, resolve, ...args) => {\n\t\tactiveCount++;\n\n\t\tconst result = pTry(fn, ...args);\n\n\t\tresolve(result);\n\n\t\tresult.then(next, next);\n\t};\n\n\tconst enqueue = (fn, resolve, ...args) => {\n\t\tif (activeCount < concurrency) {\n\t\t\trun(fn, resolve, ...args);\n\t\t} else {\n\t\t\tqueue.push(run.bind(null, fn, resolve, ...args));\n\t\t}\n\t};\n\n\tconst generator = (fn, ...args) => new Promise(resolve => enqueue(fn, resolve, ...args));\n\tObject.defineProperties(generator, {\n\t\tactiveCount: {\n\t\t\tget: () => activeCount\n\t\t},\n\t\tpendingCount: {\n\t\t\tget: () => queue.length\n\t\t},\n\t\tclearQueue: {\n\t\t\tvalue: () => {\n\t\t\t\tqueue.length = 0;\n\t\t\t}\n\t\t}\n\t});\n\n\treturn generator;\n};\n\nmodule.exports = pLimit;\nmodule.exports.default = pLimit;\n","'use strict';\n\nconst pTry = (fn, ...arguments_) => new Promise(resolve => {\n\tresolve(fn(...arguments_));\n});\n\nmodule.exports = pTry;\n// TODO: remove this in the next major version\nmodule.exports.default = pTry;\n","'use strict'\n\nconst Envelope = require('./envelope')\nconst PeerRecord = require('./peer-record')\n\n/**\n * @typedef {import('../')} Libp2p\n */\n\n/**\n * Create (or update if existing) self peer record and store it in the AddressBook.\n *\n * @param {Libp2p} libp2p\n * @returns {Promise<void>}\n */\nasync function updateSelfPeerRecord (libp2p) {\n  const peerRecord = new PeerRecord({\n    peerId: libp2p.peerId,\n    multiaddrs: libp2p.multiaddrs\n  })\n  const envelope = await Envelope.seal(peerRecord, libp2p.peerId)\n  libp2p.peerStore.addressBook.consumePeerRecord(envelope)\n}\n\nmodule.exports.updateSelfPeerRecord = updateSelfPeerRecord\n","'use strict'\n\nconst { Multiaddr } = require('multiaddr')\nconst PeerId = require('peer-id')\nconst arrayEquals = require('libp2p-utils/src/array-equals')\n\nconst { PeerRecord: Protobuf } = require('./peer-record')\nconst {\n  ENVELOPE_DOMAIN_PEER_RECORD,\n  ENVELOPE_PAYLOAD_TYPE_PEER_RECORD\n} = require('./consts')\n\n/**\n * @typedef {import('../../peer-store/address-book.js').Address} Address\n * @typedef {import('libp2p-interfaces/src/record/types').Record} Record\n */\n\n/**\n * @implements {Record}\n */\nclass PeerRecord {\n  /**\n   * The PeerRecord is used for distributing peer routing records across the network.\n   * It contains the peer's reachable listen addresses.\n   *\n   * @class\n   * @param {Object} params\n   * @param {PeerId} params.peerId\n   * @param {Multiaddr[]} params.multiaddrs - addresses of the associated peer.\n   * @param {number} [params.seqNumber] - monotonically-increasing sequence counter that's used to order PeerRecords in time.\n   */\n  constructor ({ peerId, multiaddrs = [], seqNumber = Date.now() }) {\n    this.domain = ENVELOPE_DOMAIN_PEER_RECORD\n    this.codec = ENVELOPE_PAYLOAD_TYPE_PEER_RECORD\n\n    this.peerId = peerId\n    this.multiaddrs = multiaddrs\n    this.seqNumber = seqNumber\n\n    // Cache\n    this._marshal = undefined\n  }\n\n  /**\n   * Marshal a record to be used in an envelope.\n   *\n   * @returns {Uint8Array}\n   */\n  marshal () {\n    if (this._marshal) {\n      return this._marshal\n    }\n\n    this._marshal = Protobuf.encode({\n      peerId: this.peerId.toBytes(),\n      seq: this.seqNumber,\n      addresses: this.multiaddrs.map((m) => ({\n        multiaddr: m.bytes\n      }))\n    }).finish()\n\n    return this._marshal\n  }\n\n  /**\n   * Returns true if `this` record equals the `other`.\n   *\n   * @param {unknown} other\n   * @returns {boolean}\n   */\n  equals (other) {\n    if (!(other instanceof PeerRecord)) {\n      return false\n    }\n\n    // Validate PeerId\n    if (!this.peerId.equals(other.peerId)) {\n      return false\n    }\n\n    // Validate seqNumber\n    if (this.seqNumber !== other.seqNumber) {\n      return false\n    }\n\n    // Validate multiaddrs\n    if (!arrayEquals(this.multiaddrs, other.multiaddrs)) {\n      return false\n    }\n\n    return true\n  }\n}\n\n/**\n * Unmarshal Peer Record Protobuf.\n *\n * @param {Uint8Array} buf - marshaled peer record.\n * @returns {PeerRecord}\n */\nPeerRecord.createFromProtobuf = (buf) => {\n  const peerRecord = Protobuf.decode(buf)\n\n  const peerId = PeerId.createFromBytes(peerRecord.peerId)\n  const multiaddrs = (peerRecord.addresses || []).map((a) => new Multiaddr(a.multiaddr))\n  const seqNumber = Number(peerRecord.seq)\n\n  return new PeerRecord({ peerId, multiaddrs, seqNumber })\n}\n\nPeerRecord.DOMAIN = ENVELOPE_DOMAIN_PEER_RECORD\n\nmodule.exports = PeerRecord\n","'use strict'\n\n/**\n * Verify if two arrays of non primitive types with the \"equals\" function are equal.\n * Compatible with multiaddr, peer-id and others.\n *\n * @param {Array<*>} a\n * @param {Array<*>} b\n * @returns {boolean}\n */\nfunction arrayEquals (a, b) {\n  return a.length === b.length && b.sort() && a.sort().every((item, index) => b[index].equals(item))\n}\n\nmodule.exports = arrayEquals\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"libp2p-peer-record\"] || ($protobuf.roots[\"libp2p-peer-record\"] = {});\n\n$root.PeerRecord = (function() {\n\n    /**\n     * Properties of a PeerRecord.\n     * @exports IPeerRecord\n     * @interface IPeerRecord\n     * @property {Uint8Array|null} [peerId] PeerRecord peerId\n     * @property {number|null} [seq] PeerRecord seq\n     * @property {Array.<PeerRecord.IAddressInfo>|null} [addresses] PeerRecord addresses\n     */\n\n    /**\n     * Constructs a new PeerRecord.\n     * @exports PeerRecord\n     * @classdesc Represents a PeerRecord.\n     * @implements IPeerRecord\n     * @constructor\n     * @param {IPeerRecord=} [p] Properties to set\n     */\n    function PeerRecord(p) {\n        this.addresses = [];\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * PeerRecord peerId.\n     * @member {Uint8Array} peerId\n     * @memberof PeerRecord\n     * @instance\n     */\n    PeerRecord.prototype.peerId = $util.newBuffer([]);\n\n    /**\n     * PeerRecord seq.\n     * @member {number} seq\n     * @memberof PeerRecord\n     * @instance\n     */\n    PeerRecord.prototype.seq = $util.Long ? $util.Long.fromBits(0,0,true) : 0;\n\n    /**\n     * PeerRecord addresses.\n     * @member {Array.<PeerRecord.IAddressInfo>} addresses\n     * @memberof PeerRecord\n     * @instance\n     */\n    PeerRecord.prototype.addresses = $util.emptyArray;\n\n    /**\n     * Encodes the specified PeerRecord message. Does not implicitly {@link PeerRecord.verify|verify} messages.\n     * @function encode\n     * @memberof PeerRecord\n     * @static\n     * @param {IPeerRecord} m PeerRecord message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    PeerRecord.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.peerId != null && Object.hasOwnProperty.call(m, \"peerId\"))\n            w.uint32(10).bytes(m.peerId);\n        if (m.seq != null && Object.hasOwnProperty.call(m, \"seq\"))\n            w.uint32(16).uint64(m.seq);\n        if (m.addresses != null && m.addresses.length) {\n            for (var i = 0; i < m.addresses.length; ++i)\n                $root.PeerRecord.AddressInfo.encode(m.addresses[i], w.uint32(26).fork()).ldelim();\n        }\n        return w;\n    };\n\n    /**\n     * Decodes a PeerRecord message from the specified reader or buffer.\n     * @function decode\n     * @memberof PeerRecord\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {PeerRecord} PeerRecord\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    PeerRecord.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.PeerRecord();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.peerId = r.bytes();\n                break;\n            case 2:\n                m.seq = r.uint64();\n                break;\n            case 3:\n                if (!(m.addresses && m.addresses.length))\n                    m.addresses = [];\n                m.addresses.push($root.PeerRecord.AddressInfo.decode(r, r.uint32()));\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a PeerRecord message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof PeerRecord\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {PeerRecord} PeerRecord\n     */\n    PeerRecord.fromObject = function fromObject(d) {\n        if (d instanceof $root.PeerRecord)\n            return d;\n        var m = new $root.PeerRecord();\n        if (d.peerId != null) {\n            if (typeof d.peerId === \"string\")\n                $util.base64.decode(d.peerId, m.peerId = $util.newBuffer($util.base64.length(d.peerId)), 0);\n            else if (d.peerId.length)\n                m.peerId = d.peerId;\n        }\n        if (d.seq != null) {\n            if ($util.Long)\n                (m.seq = $util.Long.fromValue(d.seq)).unsigned = true;\n            else if (typeof d.seq === \"string\")\n                m.seq = parseInt(d.seq, 10);\n            else if (typeof d.seq === \"number\")\n                m.seq = d.seq;\n            else if (typeof d.seq === \"object\")\n                m.seq = new $util.LongBits(d.seq.low >>> 0, d.seq.high >>> 0).toNumber(true);\n        }\n        if (d.addresses) {\n            if (!Array.isArray(d.addresses))\n                throw TypeError(\".PeerRecord.addresses: array expected\");\n            m.addresses = [];\n            for (var i = 0; i < d.addresses.length; ++i) {\n                if (typeof d.addresses[i] !== \"object\")\n                    throw TypeError(\".PeerRecord.addresses: object expected\");\n                m.addresses[i] = $root.PeerRecord.AddressInfo.fromObject(d.addresses[i]);\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a PeerRecord message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof PeerRecord\n     * @static\n     * @param {PeerRecord} m PeerRecord\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    PeerRecord.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.arrays || o.defaults) {\n            d.addresses = [];\n        }\n        if (o.defaults) {\n            if (o.bytes === String)\n                d.peerId = \"\";\n            else {\n                d.peerId = [];\n                if (o.bytes !== Array)\n                    d.peerId = $util.newBuffer(d.peerId);\n            }\n            if ($util.Long) {\n                var n = new $util.Long(0, 0, true);\n                d.seq = o.longs === String ? n.toString() : o.longs === Number ? n.toNumber() : n;\n            } else\n                d.seq = o.longs === String ? \"0\" : 0;\n        }\n        if (m.peerId != null && m.hasOwnProperty(\"peerId\")) {\n            d.peerId = o.bytes === String ? $util.base64.encode(m.peerId, 0, m.peerId.length) : o.bytes === Array ? Array.prototype.slice.call(m.peerId) : m.peerId;\n        }\n        if (m.seq != null && m.hasOwnProperty(\"seq\")) {\n            if (typeof m.seq === \"number\")\n                d.seq = o.longs === String ? String(m.seq) : m.seq;\n            else\n                d.seq = o.longs === String ? $util.Long.prototype.toString.call(m.seq) : o.longs === Number ? new $util.LongBits(m.seq.low >>> 0, m.seq.high >>> 0).toNumber(true) : m.seq;\n        }\n        if (m.addresses && m.addresses.length) {\n            d.addresses = [];\n            for (var j = 0; j < m.addresses.length; ++j) {\n                d.addresses[j] = $root.PeerRecord.AddressInfo.toObject(m.addresses[j], o);\n            }\n        }\n        return d;\n    };\n\n    /**\n     * Converts this PeerRecord to JSON.\n     * @function toJSON\n     * @memberof PeerRecord\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    PeerRecord.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    PeerRecord.AddressInfo = (function() {\n\n        /**\n         * Properties of an AddressInfo.\n         * @memberof PeerRecord\n         * @interface IAddressInfo\n         * @property {Uint8Array|null} [multiaddr] AddressInfo multiaddr\n         */\n\n        /**\n         * Constructs a new AddressInfo.\n         * @memberof PeerRecord\n         * @classdesc Represents an AddressInfo.\n         * @implements IAddressInfo\n         * @constructor\n         * @param {PeerRecord.IAddressInfo=} [p] Properties to set\n         */\n        function AddressInfo(p) {\n            if (p)\n                for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                    if (p[ks[i]] != null)\n                        this[ks[i]] = p[ks[i]];\n        }\n\n        /**\n         * AddressInfo multiaddr.\n         * @member {Uint8Array} multiaddr\n         * @memberof PeerRecord.AddressInfo\n         * @instance\n         */\n        AddressInfo.prototype.multiaddr = $util.newBuffer([]);\n\n        /**\n         * Encodes the specified AddressInfo message. Does not implicitly {@link PeerRecord.AddressInfo.verify|verify} messages.\n         * @function encode\n         * @memberof PeerRecord.AddressInfo\n         * @static\n         * @param {PeerRecord.IAddressInfo} m AddressInfo message or plain object to encode\n         * @param {$protobuf.Writer} [w] Writer to encode to\n         * @returns {$protobuf.Writer} Writer\n         */\n        AddressInfo.encode = function encode(m, w) {\n            if (!w)\n                w = $Writer.create();\n            if (m.multiaddr != null && Object.hasOwnProperty.call(m, \"multiaddr\"))\n                w.uint32(10).bytes(m.multiaddr);\n            return w;\n        };\n\n        /**\n         * Decodes an AddressInfo message from the specified reader or buffer.\n         * @function decode\n         * @memberof PeerRecord.AddressInfo\n         * @static\n         * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n         * @param {number} [l] Message length if known beforehand\n         * @returns {PeerRecord.AddressInfo} AddressInfo\n         * @throws {Error} If the payload is not a reader or valid buffer\n         * @throws {$protobuf.util.ProtocolError} If required fields are missing\n         */\n        AddressInfo.decode = function decode(r, l) {\n            if (!(r instanceof $Reader))\n                r = $Reader.create(r);\n            var c = l === undefined ? r.len : r.pos + l, m = new $root.PeerRecord.AddressInfo();\n            while (r.pos < c) {\n                var t = r.uint32();\n                switch (t >>> 3) {\n                case 1:\n                    m.multiaddr = r.bytes();\n                    break;\n                default:\n                    r.skipType(t & 7);\n                    break;\n                }\n            }\n            return m;\n        };\n\n        /**\n         * Creates an AddressInfo message from a plain object. Also converts values to their respective internal types.\n         * @function fromObject\n         * @memberof PeerRecord.AddressInfo\n         * @static\n         * @param {Object.<string,*>} d Plain object\n         * @returns {PeerRecord.AddressInfo} AddressInfo\n         */\n        AddressInfo.fromObject = function fromObject(d) {\n            if (d instanceof $root.PeerRecord.AddressInfo)\n                return d;\n            var m = new $root.PeerRecord.AddressInfo();\n            if (d.multiaddr != null) {\n                if (typeof d.multiaddr === \"string\")\n                    $util.base64.decode(d.multiaddr, m.multiaddr = $util.newBuffer($util.base64.length(d.multiaddr)), 0);\n                else if (d.multiaddr.length)\n                    m.multiaddr = d.multiaddr;\n            }\n            return m;\n        };\n\n        /**\n         * Creates a plain object from an AddressInfo message. Also converts values to other types if specified.\n         * @function toObject\n         * @memberof PeerRecord.AddressInfo\n         * @static\n         * @param {PeerRecord.AddressInfo} m AddressInfo\n         * @param {$protobuf.IConversionOptions} [o] Conversion options\n         * @returns {Object.<string,*>} Plain object\n         */\n        AddressInfo.toObject = function toObject(m, o) {\n            if (!o)\n                o = {};\n            var d = {};\n            if (o.defaults) {\n                if (o.bytes === String)\n                    d.multiaddr = \"\";\n                else {\n                    d.multiaddr = [];\n                    if (o.bytes !== Array)\n                        d.multiaddr = $util.newBuffer(d.multiaddr);\n                }\n            }\n            if (m.multiaddr != null && m.hasOwnProperty(\"multiaddr\")) {\n                d.multiaddr = o.bytes === String ? $util.base64.encode(m.multiaddr, 0, m.multiaddr.length) : o.bytes === Array ? Array.prototype.slice.call(m.multiaddr) : m.multiaddr;\n            }\n            return d;\n        };\n\n        /**\n         * Converts this AddressInfo to JSON.\n         * @function toJSON\n         * @memberof PeerRecord.AddressInfo\n         * @instance\n         * @returns {Object.<string,*>} JSON object\n         */\n        AddressInfo.prototype.toJSON = function toJSON() {\n            return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n        };\n\n        return AddressInfo;\n    })();\n\n    return PeerRecord;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\nconst multicodec = require('multicodec')\n\n// The domain string used for peer records contained in a Envelope.\nconst domain = multicodec.getName(multicodec.LIBP2P_PEER_RECORD) || 'libp2p-peer-record'\n\n// The type hint used to identify peer records in a Envelope.\n// Defined in https://github.com/multiformats/multicodec/blob/master/table.csv\n// with name \"libp2p-peer-record\"\nconst payloadType = Uint8Array.from([3, 1])\n\nmodule.exports = {\n  ENVELOPE_DOMAIN_PEER_RECORD: domain,\n  ENVELOPE_PAYLOAD_TYPE_PEER_RECORD: payloadType\n}\n","'use strict'\n\nconst { EventEmitter } = require('events')\nconst { Multiaddr } = require('multiaddr')\nconst PeerId = require('peer-id')\n\n/**\n * @typedef {Object} AddressManagerOptions\n * @property {string[]} [listen = []] - list of multiaddrs string representation to listen.\n * @property {string[]} [announce = []] - list of multiaddrs string representation to announce.\n */\n\n/**\n * @fires AddressManager#change:addresses Emitted when a addresses change.\n */\nclass AddressManager extends EventEmitter {\n  /**\n   * Responsible for managing the peer addresses.\n   * Peers can specify their listen and announce addresses.\n   * The listen addresses will be used by the libp2p transports to listen for new connections,\n   * while the announce addresses will be used for the peer addresses' to other peers in the network.\n   *\n   * @class\n   * @param {PeerId} peerId - The Peer ID of the node\n   * @param {object} [options]\n   * @param {Array<string>} [options.listen = []] - list of multiaddrs string representation to listen.\n   * @param {Array<string>} [options.announce = []] - list of multiaddrs string representation to announce.\n   */\n  constructor (peerId, { listen = [], announce = [] } = {}) {\n    super()\n\n    this.peerId = peerId\n    this.listen = new Set(listen.map(ma => ma.toString()))\n    this.announce = new Set(announce.map(ma => ma.toString()))\n    this.observed = new Set()\n  }\n\n  /**\n   * Get peer listen multiaddrs.\n   *\n   * @returns {Multiaddr[]}\n   */\n  getListenAddrs () {\n    return Array.from(this.listen).map((a) => new Multiaddr(a))\n  }\n\n  /**\n   * Get peer announcing multiaddrs.\n   *\n   * @returns {Multiaddr[]}\n   */\n  getAnnounceAddrs () {\n    return Array.from(this.announce).map((a) => new Multiaddr(a))\n  }\n\n  /**\n   * Get observed multiaddrs.\n   *\n   * @returns {Array<Multiaddr>}\n   */\n  getObservedAddrs () {\n    return Array.from(this.observed).map((a) => new Multiaddr(a))\n  }\n\n  /**\n   * Add peer observed addresses\n   *\n   * @param {string | Multiaddr} addr\n   */\n  addObservedAddr (addr) {\n    let ma = new Multiaddr(addr)\n    const remotePeer = ma.getPeerId()\n\n    // strip our peer id if it has been passed\n    if (remotePeer) {\n      const remotePeerId = PeerId.createFromB58String(remotePeer)\n\n      // use same encoding for comparison\n      if (remotePeerId.equals(this.peerId)) {\n        ma = ma.decapsulate(new Multiaddr(`/p2p/${this.peerId}`))\n      }\n    }\n\n    const addrString = ma.toString()\n\n    // do not trigger the change:addresses event if we already know about this address\n    if (this.observed.has(addrString)) {\n      return\n    }\n\n    this.observed.add(addrString)\n    this.emit('change:addresses')\n  }\n}\n\nmodule.exports = AddressManager\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:connection-manager'), {\n  error: debug('libp2p:connection-manager:err')\n})\n\nconst errcode = require('err-code')\nconst mergeOptions = require('merge-options')\nconst LatencyMonitor = require('./latency-monitor')\n// @ts-ignore retimer does not have types\nconst retimer = require('retimer')\n\nconst { EventEmitter } = require('events')\n\nconst PeerId = require('peer-id')\n\nconst {\n  codes: { ERR_INVALID_PARAMETERS }\n} = require('../errors')\n\nconst defaultOptions = {\n  maxConnections: Infinity,\n  minConnections: 0,\n  maxData: Infinity,\n  maxSentData: Infinity,\n  maxReceivedData: Infinity,\n  maxEventLoopDelay: Infinity,\n  pollInterval: 2000,\n  autoDialInterval: 10000,\n  movingAverageInterval: 60000,\n  defaultPeerValue: 1\n}\n\n/**\n * @typedef {import('../')} Libp2p\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n */\n\n/**\n * @typedef {Object} ConnectionManagerOptions\n * @property {number} [maxConnections = Infinity] - The maximum number of connections allowed.\n * @property {number} [minConnections = 0] - The minimum number of connections to avoid pruning.\n * @property {number} [maxData = Infinity] - The max data (in and out), per average interval to allow.\n * @property {number} [maxSentData = Infinity] - The max outgoing data, per average interval to allow.\n * @property {number} [maxReceivedData = Infinity] - The max incoming data, per average interval to allow.\n * @property {number} [maxEventLoopDelay = Infinity] - The upper limit the event loop can take to run.\n * @property {number} [pollInterval = 2000] - How often, in milliseconds, metrics and latency should be checked.\n * @property {number} [movingAverageInterval = 60000] - How often, in milliseconds, to compute averages.\n * @property {number} [defaultPeerValue = 1] - The value of the peer.\n * @property {boolean} [autoDial = true] - Should preemptively guarantee connections are above the low watermark.\n * @property {number} [autoDialInterval = 10000] - How often, in milliseconds, it should preemptively guarantee connections are above the low watermark.\n */\n\n/**\n *\n * @fires ConnectionManager#peer:connect Emitted when a new peer is connected.\n * @fires ConnectionManager#peer:disconnect Emitted when a peer is disconnected.\n */\nclass ConnectionManager extends EventEmitter {\n  /**\n   * Responsible for managing known connections.\n   *\n   * @class\n   * @param {Libp2p} libp2p\n   * @param {ConnectionManagerOptions} options\n   */\n  constructor (libp2p, options = {}) {\n    super()\n\n    this._libp2p = libp2p\n    this._peerId = libp2p.peerId.toB58String()\n\n    this._options = mergeOptions.call({ ignoreUndefined: true }, defaultOptions, options)\n    if (this._options.maxConnections < this._options.minConnections) {\n      throw errcode(new Error('Connection Manager maxConnections must be greater than minConnections'), ERR_INVALID_PARAMETERS)\n    }\n\n    log('options: %j', this._options)\n\n    /**\n     * Map of peer identifiers to their peer value for pruning connections.\n     *\n     * @type {Map<string, number>}\n     */\n    this._peerValues = new Map()\n\n    /**\n     * Map of connections per peer\n     *\n     * @type {Map<string, Connection[]>}\n     */\n    this.connections = new Map()\n\n    this._started = false\n    this._timer = null\n    this._autoDialTimeout = null\n    this._checkMetrics = this._checkMetrics.bind(this)\n    this._autoDial = this._autoDial.bind(this)\n\n    this._latencyMonitor = new LatencyMonitor({\n      latencyCheckIntervalMs: this._options.pollInterval,\n      dataEmitIntervalMs: this._options.pollInterval\n    })\n  }\n\n  /**\n   * Get current number of open connections.\n   */\n  get size () {\n    return Array.from(this.connections.values())\n      .reduce((accumulator, value) => accumulator + value.length, 0)\n  }\n\n  /**\n   * Starts the Connection Manager. If Metrics are not enabled on libp2p\n   * only event loop and connection limits will be monitored.\n   */\n  start () {\n    if (this._libp2p.metrics) {\n      this._timer = this._timer || retimer(this._checkMetrics, this._options.pollInterval)\n    }\n\n    // latency monitor\n    this._latencyMonitor.start()\n    this._onLatencyMeasure = this._onLatencyMeasure.bind(this)\n    this._latencyMonitor.on('data', this._onLatencyMeasure)\n\n    this._started = true\n    log('started')\n\n    this._options.autoDial && this._autoDial()\n  }\n\n  /**\n   * Stops the Connection Manager\n   *\n   * @async\n   */\n  async stop () {\n    this._autoDialTimeout && this._autoDialTimeout.clear()\n    this._timer && this._timer.clear()\n\n    this._latencyMonitor.removeListener('data', this._onLatencyMeasure)\n    this._latencyMonitor.stop()\n\n    this._started = false\n    await this._close()\n    log('stopped')\n  }\n\n  /**\n   * Cleans up the connections\n   *\n   * @async\n   */\n  async _close () {\n    // Close all connections we're tracking\n    const tasks = []\n    for (const connectionList of this.connections.values()) {\n      for (const connection of connectionList) {\n        tasks.push(connection.close())\n      }\n    }\n\n    await Promise.all(tasks)\n    this.connections.clear()\n  }\n\n  /**\n   * Sets the value of the given peer. Peers with lower values\n   * will be disconnected first.\n   *\n   * @param {PeerId} peerId\n   * @param {number} value - A number between 0 and 1\n   * @returns {void}\n   */\n  setPeerValue (peerId, value) {\n    if (value < 0 || value > 1) {\n      throw new Error('value should be a number between 0 and 1')\n    }\n    this._peerValues.set(peerId.toB58String(), value)\n  }\n\n  /**\n   * Checks the libp2p metrics to determine if any values have exceeded\n   * the configured maximums.\n   *\n   * @private\n   */\n  _checkMetrics () {\n    if (this._libp2p.metrics) {\n      const movingAverages = this._libp2p.metrics.global.movingAverages\n      // @ts-ignore moving averages object types\n      const received = movingAverages.dataReceived[this._options.movingAverageInterval].movingAverage()\n      this._checkMaxLimit('maxReceivedData', received)\n      // @ts-ignore moving averages object types\n      const sent = movingAverages.dataSent[this._options.movingAverageInterval].movingAverage()\n      this._checkMaxLimit('maxSentData', sent)\n      const total = received + sent\n      this._checkMaxLimit('maxData', total)\n      log('metrics update', total)\n      this._timer = retimer(this._checkMetrics, this._options.pollInterval)\n    }\n  }\n\n  /**\n   * Tracks the incoming connection and check the connection limit\n   *\n   * @param {Connection} connection\n   * @returns {void}\n   */\n  onConnect (connection) {\n    const peerId = connection.remotePeer\n    const peerIdStr = peerId.toB58String()\n    const storedConn = this.connections.get(peerIdStr)\n\n    this.emit('peer:connect', connection)\n    if (storedConn) {\n      storedConn.push(connection)\n    } else {\n      this.connections.set(peerIdStr, [connection])\n    }\n\n    this._libp2p.peerStore.keyBook.set(peerId, peerId.pubKey)\n\n    if (!this._peerValues.has(peerIdStr)) {\n      this._peerValues.set(peerIdStr, this._options.defaultPeerValue)\n    }\n\n    this._checkMaxLimit('maxConnections', this.size)\n  }\n\n  /**\n   * Removes the connection from tracking\n   *\n   * @param {Connection} connection\n   * @returns {void}\n   */\n  onDisconnect (connection) {\n    const peerId = connection.remotePeer.toB58String()\n    let storedConn = this.connections.get(peerId)\n\n    if (storedConn && storedConn.length > 1) {\n      storedConn = storedConn.filter((conn) => conn.id !== connection.id)\n      this.connections.set(peerId, storedConn)\n    } else if (storedConn) {\n      this.connections.delete(peerId)\n      this._peerValues.delete(connection.remotePeer.toB58String())\n      this.emit('peer:disconnect', connection)\n    }\n  }\n\n  /**\n   * Get a connection with a peer.\n   *\n   * @param {PeerId} peerId\n   * @returns {Connection|null}\n   */\n  get (peerId) {\n    const connections = this.getAll(peerId)\n    if (connections.length) {\n      return connections[0]\n    }\n    return null\n  }\n\n  /**\n   * Get all open connections with a peer.\n   *\n   * @param {PeerId} peerId\n   * @returns {Connection[]}\n   */\n  getAll (peerId) {\n    if (!PeerId.isPeerId(peerId)) {\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    const id = peerId.toB58String()\n    const connections = this.connections.get(id)\n\n    // Return all open connections\n    if (connections) {\n      return connections.filter(connection => connection.stat.status === 'open')\n    }\n    return []\n  }\n\n  /**\n   * If the event loop is slow, maybe close a connection\n   *\n   * @private\n   * @param {*} summary - The LatencyMonitor summary\n   */\n  _onLatencyMeasure (summary) {\n    this._checkMaxLimit('maxEventLoopDelay', summary.avgMs)\n  }\n\n  /**\n   * If the `value` of `name` has exceeded its limit, maybe close a connection\n   *\n   * @private\n   * @param {string} name - The name of the field to check limits for\n   * @param {number} value - The current value of the field\n   */\n  _checkMaxLimit (name, value) {\n    const limit = this._options[name]\n    log('checking limit of %s. current value: %d of %d', name, value, limit)\n    if (value > limit) {\n      log('%s: limit exceeded: %s, %d', this._peerId, name, value)\n      this._maybeDisconnectOne()\n    }\n  }\n\n  /**\n   * Proactively tries to connect to known peers stored in the PeerStore.\n   * It will keep the number of connections below the upper limit and sort\n   * the peers to connect based on wether we know their keys and protocols.\n   *\n   * @async\n   * @private\n   */\n  async _autoDial () {\n    const minConnections = this._options.minConnections\n\n    // Already has enough connections\n    if (this.size >= minConnections) {\n      this._autoDialTimeout = retimer(this._autoDial, this._options.autoDialInterval)\n      return\n    }\n\n    // Sort peers on wether we know protocols of public keys for them\n    const peers = Array.from(this._libp2p.peerStore.peers.values())\n      .sort((a, b) => {\n        if (b.protocols && b.protocols.length && (!a.protocols || !a.protocols.length)) {\n          return 1\n        } else if (b.id.pubKey && !a.id.pubKey) {\n          return 1\n        }\n        return -1\n      })\n\n    for (let i = 0; i < peers.length && this.size < minConnections; i++) {\n      if (!this.get(peers[i].id)) {\n        log('connecting to a peerStore stored peer %s', peers[i].id.toB58String())\n        try {\n          await this._libp2p.dialer.connectToPeer(peers[i].id)\n\n          // Connection Manager was stopped\n          if (!this._started) {\n            return\n          }\n        } catch (err) {\n          log.error('could not connect to peerStore stored peer', err)\n        }\n      }\n    }\n\n    this._autoDialTimeout = retimer(this._autoDial, this._options.autoDialInterval)\n  }\n\n  /**\n   * If we have more connections than our maximum, close a connection\n   * to the lowest valued peer.\n   *\n   * @private\n   */\n  _maybeDisconnectOne () {\n    if (this._options.minConnections < this.connections.size) {\n      const peerValues = Array.from(new Map([...this._peerValues.entries()].sort((a, b) => a[1] - b[1])))\n      log('%s: sorted peer values: %j', this._peerId, peerValues)\n      const disconnectPeer = peerValues[0]\n      if (disconnectPeer) {\n        const peerId = disconnectPeer[0]\n        log('%s: lowest value peer is %s', this._peerId, peerId)\n        log('%s: closing a connection to %j', this._peerId, peerId)\n        for (const connections of this.connections.values()) {\n          if (connections[0].remotePeer.toB58String() === peerId) {\n            connections[0].close()\n            break\n          }\n        }\n      }\n    }\n  }\n}\n\nmodule.exports = ConnectionManager\n","// @ts-nocheck\n'use strict'\n\n/**\n * This code is based on `latency-monitor` (https://github.com/mlucool/latency-monitor) by `mlucool` (https://github.com/mlucool), available under Apache License 2.0 (https://github.com/mlucool/latency-monitor/blob/master/LICENSE)\n */\n\nconst { EventEmitter } = require('events')\nconst VisibilityChangeEmitter = require('./visibility-change-emitter')\nconst debug = require('debug')('latency-monitor:LatencyMonitor')\n\n/**\n * @typedef {Object} SummaryObject\n * @property {number} events How many events were called\n * @property {number} minMS What was the min time for a cb to be called\n * @property {number} maxMS What was the max time for a cb to be called\n * @property {number} avgMs What was the average time for a cb to be called\n * @property {number} lengthMs How long this interval was in ms\n *\n * @typedef {Object} LatencyMonitorOptions\n * @property {number} [latencyCheckIntervalMs=500] - How often to add a latency check event (ms)\n * @property {number} [dataEmitIntervalMs=5000] - How often to summarize latency check events. null or 0 disables event firing\n * @property {Function} [asyncTestFn] - What cb-style async function to use\n * @property {number} [latencyRandomPercentage=5] - What percent (+/-) of latencyCheckIntervalMs should we randomly use? This helps avoid alignment to other events.\n */\n\n/**\n * A class to monitor latency of any async function which works in a browser or node. This works by periodically calling\n * the asyncTestFn and timing how long it takes the callback to be called. It can also periodically emit stats about this.\n * This can be disabled and stats can be pulled via setting dataEmitIntervalMs = 0.\n *\n * @extends {EventEmitter}\n *\n * The default implementation is an event loop latency monitor. This works by firing periodic events into the event loop\n * and timing how long it takes to get back.\n *\n * @example\n * const monitor = new LatencyMonitor();\n * monitor.on('data', (summary) => console.log('Event Loop Latency: %O', summary));\n *\n * @example\n * const monitor = new LatencyMonitor({latencyCheckIntervalMs: 1000, dataEmitIntervalMs: 60000, asyncTestFn:ping});\n * monitor.on('data', (summary) => console.log('Ping Pong Latency: %O', summary));\n */\nclass LatencyMonitor extends EventEmitter {\n  /**\n   * @class\n   * @param {LatencyMonitorOptions} [options]\n   */\n  constructor ({ latencyCheckIntervalMs, dataEmitIntervalMs, asyncTestFn, latencyRandomPercentage } = {}) {\n    super()\n    const that = this\n\n    // 0 isn't valid here, so its ok to use ||\n    that.latencyCheckIntervalMs = latencyCheckIntervalMs || 500 // 0.5s\n    that.latencyRandomPercentage = latencyRandomPercentage || 10\n    that._latecyCheckMultiply = 2 * (that.latencyRandomPercentage / 100.0) * that.latencyCheckIntervalMs\n    that._latecyCheckSubtract = that._latecyCheckMultiply / 2\n\n    that.dataEmitIntervalMs = (dataEmitIntervalMs === null || dataEmitIntervalMs === 0)\n      ? undefined\n      : dataEmitIntervalMs || 5 * 1000 // 5s\n    debug('latencyCheckIntervalMs: %s dataEmitIntervalMs: %s',\n      that.latencyCheckIntervalMs, that.dataEmitIntervalMs)\n    if (that.dataEmitIntervalMs) {\n      debug('Expecting ~%s events per summary', that.latencyCheckIntervalMs / that.dataEmitIntervalMs)\n    } else {\n      debug('Not emitting summaries')\n    }\n\n    that.asyncTestFn = asyncTestFn // If there is no asyncFn, we measure latency\n  }\n\n  start () {\n    // If process: use high resolution timer\n    if (globalThis.process && globalThis.process.hrtime) { // eslint-disable-line no-undef\n      debug('Using process.hrtime for timing')\n      this.now = globalThis.process.hrtime // eslint-disable-line no-undef\n      this.getDeltaMS = (startTime) => {\n        const hrtime = this.now(startTime)\n        return (hrtime[0] * 1000) + (hrtime[1] / 1000000)\n      }\n      // Let's try for a timer that only monotonically increases\n    } else if (typeof window !== 'undefined' && window.performance && window.performance.now) {\n      debug('Using performance.now for timing')\n      this.now = window.performance.now.bind(window.performance)\n      this.getDeltaMS = (startTime) => Math.round(this.now() - startTime)\n    } else {\n      debug('Using Date.now for timing')\n      this.now = Date.now\n      this.getDeltaMS = (startTime) => this.now() - startTime\n    }\n\n    this._latencyData = this._initLatencyData()\n\n    // We check for isBrowser because of browsers set max rates of timeouts when a page is hidden,\n    // so we fall back to another library\n    // See: http://stackoverflow.com/questions/6032429/chrome-timeouts-interval-suspended-in-background-tabs\n    if (isBrowser()) {\n      this._visibilityChangeEmitter = new VisibilityChangeEmitter()\n\n      this._visibilityChangeEmitter.on('visibilityChange', (pageInFocus) => {\n        if (pageInFocus) {\n          this._startTimers()\n        } else {\n          this._emitSummary()\n          this._stopTimers()\n        }\n      })\n    }\n\n    if (!this._visibilityChangeEmitter || this._visibilityChangeEmitter.isVisible()) {\n      this._startTimers()\n    }\n  }\n\n  stop () {\n    this._stopTimers()\n  }\n\n  /**\n   * Start internal timers\n   *\n   * @private\n   */\n  _startTimers () {\n    // Timer already started, ignore this\n    if (this._checkLatencyID) {\n      return\n    }\n    this._checkLatency()\n    if (this.dataEmitIntervalMs) {\n      this._emitIntervalID = setInterval(() => this._emitSummary(), this.dataEmitIntervalMs)\n      if (typeof this._emitIntervalID.unref === 'function') {\n        this._emitIntervalID.unref() // Doesn't block exit\n      }\n    }\n  }\n\n  /**\n   * Stop internal timers\n   *\n   * @private\n   */\n  _stopTimers () {\n    if (this._checkLatencyID) {\n      clearTimeout(this._checkLatencyID)\n      this._checkLatencyID = undefined\n    }\n    if (this._emitIntervalID) {\n      clearInterval(this._emitIntervalID)\n      this._emitIntervalID = undefined\n    }\n  }\n\n  /**\n   * Emit summary only if there were events. It might not have any events if it was forced via a page hidden/show\n   *\n   * @private\n   */\n  _emitSummary () {\n    const summary = this.getSummary()\n    if (summary.events > 0) {\n      this.emit('data', summary)\n    }\n  }\n\n  /**\n   * Calling this function will end the collection period. If a timing event was already fired and somewhere in the queue,\n   * it will not count for this time period\n   *\n   * @returns {SummaryObject}\n   */\n  getSummary () {\n    // We might want to adjust for the number of expected events\n    // Example: first 1 event it comes back, then such a long blocker that the next emit check comes\n    // Then this fires - looks like no latency!!\n    const latency = {\n      events: this._latencyData.events,\n      minMs: this._latencyData.minMs,\n      maxMs: this._latencyData.maxMs,\n      avgMs: this._latencyData.events\n        ? this._latencyData.totalMs / this._latencyData.events\n        : Number.POSITIVE_INFINITY,\n      lengthMs: this.getDeltaMS(this._latencyData.startTime)\n    }\n    this._latencyData = this._initLatencyData() // Clear\n\n    debug('Summary: %O', latency)\n    return latency\n  }\n\n  /**\n   * Randomly calls an async fn every roughly latencyCheckIntervalMs (plus some randomness). If no async fn is found,\n   * it will simply report on event loop latency.\n   *\n   * @private\n   */\n  _checkLatency () {\n    const that = this\n    // Randomness is needed to avoid alignment by accident to regular things in the event loop\n    const randomness = (Math.random() * that._latecyCheckMultiply) - that._latecyCheckSubtract\n\n    // We use this to ensure that in case some overlap somehow, we don't take the wrong startTime/offset\n    const localData = {\n      deltaOffset: Math.ceil(that.latencyCheckIntervalMs + randomness),\n      startTime: that.now()\n    }\n\n    const cb = () => {\n      // We are already stopped, ignore this datapoint\n      if (!this._checkLatencyID) {\n        return\n      }\n      const deltaMS = that.getDeltaMS(localData.startTime) - localData.deltaOffset\n      that._checkLatency() // Start again ASAP\n\n      // Add the data point. If this gets complex, refactor it\n      that._latencyData.events++\n      that._latencyData.minMs = Math.min(that._latencyData.minMs, deltaMS)\n      that._latencyData.maxMs = Math.max(that._latencyData.maxMs, deltaMS)\n      that._latencyData.totalMs += deltaMS\n      debug('MS: %s Data: %O', deltaMS, that._latencyData)\n    }\n    debug('localData: %O', localData)\n\n    this._checkLatencyID = setTimeout(() => {\n      // This gets rid of including event loop\n      if (that.asyncTestFn) {\n        // Clear timing related things\n        localData.deltaOffset = 0\n        localData.startTime = that.now()\n        that.asyncTestFn(cb)\n      } else {\n        // setTimeout is not more accurate than 1ms, so this will ensure positive numbers. Add 1 to emitted data to remove.\n        // This is not the best, but for now it'll be just fine. This isn't meant to be sub ms accurate.\n        localData.deltaOffset -= 1\n        // If there is no function to test, we mean check latency which is a special case that is really cb => cb()\n        // We avoid that for the few extra function all overheads. Also, we want to keep the timers different\n        cb()\n      }\n    }, localData.deltaOffset)\n\n    if (typeof this._checkLatencyID.unref === 'function') {\n      this._checkLatencyID.unref() // Doesn't block exit\n    }\n  }\n\n  _initLatencyData () {\n    return {\n      startTime: this.now(),\n      minMs: Number.POSITIVE_INFINITY,\n      maxMs: Number.NEGATIVE_INFINITY,\n      events: 0,\n      totalMs: 0\n    }\n  }\n}\n\nfunction isBrowser () {\n  return typeof window !== 'undefined'\n}\n\nmodule.exports = LatencyMonitor\n","// @ts-nocheck\n/* global document */\n\n/**\n * This code is based on `latency-monitor` (https://github.com/mlucool/latency-monitor) by `mlucool` (https://github.com/mlucool), available under Apache License 2.0 (https://github.com/mlucool/latency-monitor/blob/master/LICENSE)\n */\n'use strict'\n\nconst { EventEmitter } = require('events')\n\nconst debug = require('debug')('latency-monitor:VisibilityChangeEmitter')\n\n/**\n * Listen to page visibility change events (i.e. when the page is focused / blurred) by an event emitter.\n *\n * Warning: This does not work on all browsers, but should work on all modern browsers\n *\n * @example\n *\n *     const myVisibilityEmitter = new VisibilityChangeEmitter();\n *\n *     myVisibilityEmitter.on('visibilityChange', (pageInFocus) => {\n *        if ( pageInFocus ){\n *            // Page is in focus\n *            console.log('In focus');\n *        }\n *        else {\n *            // Page is blurred\n *            console.log('Out of focus');\n *        }\n *     });\n *     // To access the visibility state directly, call:\n *     console.log('Am I focused now? ' + myVisibilityEmitter.isVisible());\n */\nclass VisibilityChangeEmitter extends EventEmitter {\n  /**\n   * Creates a VisibilityChangeEmitter\n   *\n   * @class\n   */\n  constructor () {\n    super()\n    if (typeof document === 'undefined') {\n      debug('This is not a browser, no \"document\" found. Stopping.')\n      return\n    }\n    this._initializeVisibilityVarNames()\n    this._addVisibilityChangeListener()\n  }\n\n  /**\n   * document.hidden and document.visibilityChange are the two variables we need to check for;\n   * Since these variables are named differently in different browsers, this function sets\n   * the appropriate name based on the browser being used. Once executed, tha actual names of\n   * document.hidden and document.visibilityChange are found in this._hidden and this._visibilityChange\n   * respectively\n   *\n   * @private\n   */\n  _initializeVisibilityVarNames () {\n    let hidden\n    let visibilityChange\n    if (typeof document.hidden !== 'undefined') { // Opera 12.10 and Firefox 18 and later support\n      hidden = 'hidden'\n      visibilityChange = 'visibilitychange'\n    } else if (typeof document.mozHidden !== 'undefined') {\n      hidden = 'mozHidden'\n      visibilityChange = 'mozvisibilitychange'\n    } else if (typeof document.msHidden !== 'undefined') {\n      hidden = 'msHidden'\n      visibilityChange = 'msvisibilitychange'\n    } else if (typeof document.webkitHidden !== 'undefined') {\n      hidden = 'webkitHidden'\n      visibilityChange = 'webkitvisibilitychange'\n    }\n    this._hidden = hidden\n    this._visibilityChange = visibilityChange\n  }\n\n  /**\n   * Adds an event listener on the document that listens to changes in document.visibilityChange\n   * (or whatever name by which the visibilityChange variable is known in the browser)\n   *\n   * @private\n   */\n  _addVisibilityChangeListener () {\n    if (typeof document.addEventListener === 'undefined' ||\n            typeof document[this._hidden] === 'undefined') {\n      debug('Checking page visibility requires a browser that supports the Page Visibility API.')\n    } else {\n      // Handle page visibility change\n      document.addEventListener(this._visibilityChange, this._handleVisibilityChange.bind(this), false)\n    }\n  }\n\n  /**\n   * The function returns ```true``` if the page is visible or ```false``` if the page is not visible and\n   * ```undefined``` if the page visibility API is not supported by the browser.\n   *\n   * @returns {boolean | void} whether the page is now visible or not (undefined is unknown)\n   */\n  isVisible () {\n    if (this._hidden === undefined || document[this._hidden] === undefined) {\n      return undefined\n    }\n\n    return !document[this._hidden]\n  }\n\n  /**\n   * The function that is called when document.visibilityChange has changed\n   * It emits an event called visibilityChange and sends the value of document.hidden as a\n   * parameter\n   *\n   * @private\n   */\n  _handleVisibilityChange () {\n    const visible = !document[this._hidden]\n    debug(visible ? 'Page Visible' : 'Page Hidden')\n    // Emit the event\n    this.emit('visibilityChange', visible)\n  }\n}\n\nmodule.exports = VisibilityChangeEmitter\n","'use strict'\n\nconst getTime = require('./time')\n\nclass Retimer {\n  constructor (callback, timeout, args) {\n    const that = this\n\n    this._started = getTime()\n    this._rescheduled = 0\n    this._scheduled = timeout\n    this._args = args\n    this._triggered = false\n\n    this._timerWrapper = () => {\n      if (that._rescheduled > 0) {\n        that._scheduled = that._rescheduled - (getTime() - that._started)\n        that._schedule(that._scheduled)\n      } else {\n        that._triggered = true\n        callback.apply(null, that._args)\n      }\n    }\n\n    this._timer = setTimeout(this._timerWrapper, timeout)\n  }\n\n  reschedule (timeout) {\n    if (!timeout) {\n      timeout = this._scheduled\n    }\n    const now = getTime()\n    if ((now + timeout) - (this._started + this._scheduled) < 0) {\n      clearTimeout(this._timer)\n      this._schedule(timeout)\n    } else if (!this._triggered) {\n      this._started = now\n      this._rescheduled = timeout\n    } else {\n      this._schedule(timeout)\n    }\n  }\n\n  _schedule (timeout) {\n    this._triggered = false\n    this._started = getTime()\n    this._rescheduled = 0\n    this._scheduled = timeout\n    this._timer = setTimeout(this._timerWrapper, timeout)\n  }\n\n  clear () {\n    clearTimeout(this._timer)\n  }\n}\n\nfunction retimer () {\n  if (typeof arguments[0] !== 'function') {\n    throw new Error('callback needed')\n  }\n\n  if (typeof arguments[1] !== 'number') {\n    throw new Error('timeout needed')\n  }\n\n  let args\n\n  if (arguments.length > 0) {\n    args = new Array(arguments.length - 2)\n\n    /* eslint-disable no-var */\n    for (var i = 0; i < args.length; i++) {\n      args[i] = arguments[i + 2]\n    }\n  }\n\n  return new Retimer(arguments[0], arguments[1], args)\n}\n\nmodule.exports = retimer\n","'use strict'\n\nmodule.exports = function getTime () {\n  return Date.now()\n}\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:circuit'), {\n  error: debug('libp2p:circuit:err')\n})\n\nconst errCode = require('err-code')\nconst mafmt = require('mafmt')\nconst { Multiaddr } = require('multiaddr')\nconst PeerId = require('peer-id')\nconst { CircuitRelay: CircuitPB } = require('./protocol')\nconst { codes } = require('../errors')\n\nconst toConnection = require('libp2p-utils/src/stream-to-ma-conn')\n\nconst { relay: multicodec } = require('./multicodec')\nconst createListener = require('./listener')\nconst { handleCanHop, handleHop, hop } = require('./circuit/hop')\nconst { handleStop } = require('./circuit/stop')\nconst StreamHandler = require('./circuit/stream-handler')\n\nconst transportSymbol = Symbol.for('@libp2p/js-libp2p-circuit/circuit')\n\n/**\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n */\n\nclass Circuit {\n  /**\n   * Creates an instance of the Circuit Transport.\n   *\n   * @class\n   * @param {object} options\n   * @param {import('../')} options.libp2p\n   * @param {import('../upgrader')} options.upgrader\n   */\n  constructor ({ libp2p, upgrader }) {\n    this._dialer = libp2p.dialer\n    this._registrar = libp2p.registrar\n    this._connectionManager = libp2p.connectionManager\n    this._upgrader = upgrader\n    this._options = libp2p._config.relay\n    this._libp2p = libp2p\n    this.peerId = libp2p.peerId\n\n    this._registrar.handle(multicodec, this._onProtocol.bind(this))\n  }\n\n  /**\n   * @param {Object} props\n   * @param {Connection} props.connection\n   * @param {MuxedStream} props.stream\n   */\n  async _onProtocol ({ connection, stream }) {\n    /** @type {import('./circuit/stream-handler')} */\n    const streamHandler = new StreamHandler({ stream })\n    const request = await streamHandler.read()\n\n    if (!request) {\n      return\n    }\n\n    const circuit = this\n    let virtualConnection\n\n    switch (request.type) {\n      case CircuitPB.Type.CAN_HOP: {\n        log('received CAN_HOP request from %s', connection.remotePeer.toB58String())\n        await handleCanHop({ circuit, connection, streamHandler })\n        break\n      }\n      case CircuitPB.Type.HOP: {\n        log('received HOP request from %s', connection.remotePeer.toB58String())\n        virtualConnection = await handleHop({\n          connection,\n          request,\n          streamHandler,\n          circuit\n        })\n        break\n      }\n      case CircuitPB.Type.STOP: {\n        log('received STOP request from %s', connection.remotePeer.toB58String())\n        virtualConnection = await handleStop({\n          connection,\n          request,\n          streamHandler\n        })\n        break\n      }\n      default: {\n        log('Request of type %s not supported', request.type)\n      }\n    }\n\n    if (virtualConnection) {\n      // @ts-ignore dst peer will not be undefined\n      const remoteAddr = new Multiaddr(request.dstPeer.addrs[0])\n      // @ts-ignore src peer will not be undefined\n      const localAddr = new Multiaddr(request.srcPeer.addrs[0])\n      const maConn = toConnection({\n        stream: virtualConnection,\n        remoteAddr,\n        localAddr\n      })\n      const type = request.type === CircuitPB.Type.HOP ? 'relay' : 'inbound'\n      log('new %s connection %s', type, maConn.remoteAddr)\n\n      const conn = await this._upgrader.upgradeInbound(maConn)\n      log('%s connection %s upgraded', type, maConn.remoteAddr)\n      this.handler && this.handler(conn)\n    }\n  }\n\n  /**\n   * Dial a peer over a relay\n   *\n   * @param {Multiaddr} ma - the multiaddr of the peer to dial\n   * @param {Object} options - dial options\n   * @param {AbortSignal} [options.signal] - An optional abort signal\n   * @returns {Promise<Connection>} - the connection\n   */\n  async dial (ma, options) {\n    // Check the multiaddr to see if it contains a relay and a destination peer\n    const addrs = ma.toString().split('/p2p-circuit')\n    const relayAddr = new Multiaddr(addrs[0])\n    const destinationAddr = new Multiaddr(addrs[addrs.length - 1])\n    const relayId = relayAddr.getPeerId()\n    const destinationId = destinationAddr.getPeerId()\n\n    if (!relayId || !destinationId) {\n      const errMsg = 'Circuit relay dial failed as addresses did not have peer id'\n      log.error(errMsg)\n      throw errCode(new Error(errMsg), codes.ERR_RELAYED_DIAL)\n    }\n\n    const relayPeer = PeerId.createFromCID(relayId)\n    const destinationPeer = PeerId.createFromCID(destinationId)\n\n    let disconnectOnFailure = false\n    let relayConnection = this._connectionManager.get(relayPeer)\n    if (!relayConnection) {\n      relayConnection = await this._dialer.connectToPeer(relayAddr, options)\n      disconnectOnFailure = true\n    }\n\n    try {\n      const virtualConnection = await hop({\n        connection: relayConnection,\n        request: {\n          type: CircuitPB.Type.HOP,\n          srcPeer: {\n            id: this.peerId.toBytes(),\n            addrs: this._libp2p.multiaddrs.map(addr => addr.bytes)\n          },\n          dstPeer: {\n            id: destinationPeer.toBytes(),\n            addrs: [new Multiaddr(destinationAddr).bytes]\n          }\n        }\n      })\n\n      const localAddr = relayAddr.encapsulate(`/p2p-circuit/p2p/${this.peerId.toB58String()}`)\n      const maConn = toConnection({\n        stream: virtualConnection,\n        remoteAddr: ma,\n        localAddr\n      })\n      log('new outbound connection %s', maConn.remoteAddr)\n\n      return this._upgrader.upgradeOutbound(maConn)\n    } catch (err) {\n      log.error('Circuit relay dial failed', err)\n      disconnectOnFailure && await relayConnection.close()\n      throw err\n    }\n  }\n\n  /**\n   * Create a listener\n   *\n   * @param {any} options\n   * @param {Function} handler\n   * @returns {import('libp2p-interfaces/src/transport/types').Listener}\n   */\n  createListener (options, handler) {\n    if (typeof options === 'function') {\n      handler = options\n      options = {}\n    }\n\n    // Called on successful HOP and STOP requests\n    this.handler = handler\n\n    return createListener(this._libp2p)\n  }\n\n  /**\n   * Filter check for all Multiaddrs that this transport can dial on\n   *\n   * @param {Multiaddr[]} multiaddrs\n   * @returns {Multiaddr[]}\n   */\n  filter (multiaddrs) {\n    multiaddrs = Array.isArray(multiaddrs) ? multiaddrs : [multiaddrs]\n\n    return multiaddrs.filter((ma) => {\n      return mafmt.Circuit.matches(ma)\n    })\n  }\n\n  get [Symbol.toStringTag] () {\n    return 'Circuit'\n  }\n\n  /**\n   * Checks if the given value is a Transport instance.\n   *\n   * @param {any} other\n   * @returns {other is Transport}\n   */\n  static isTransport (other) {\n    return Boolean(other && other[transportSymbol])\n  }\n}\n\nmodule.exports = Circuit\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"libp2p-circuit\"] || ($protobuf.roots[\"libp2p-circuit\"] = {});\n\n$root.CircuitRelay = (function() {\n\n    /**\n     * Properties of a CircuitRelay.\n     * @exports ICircuitRelay\n     * @interface ICircuitRelay\n     * @property {CircuitRelay.Type|null} [type] CircuitRelay type\n     * @property {CircuitRelay.IPeer|null} [srcPeer] CircuitRelay srcPeer\n     * @property {CircuitRelay.IPeer|null} [dstPeer] CircuitRelay dstPeer\n     * @property {CircuitRelay.Status|null} [code] CircuitRelay code\n     */\n\n    /**\n     * Constructs a new CircuitRelay.\n     * @exports CircuitRelay\n     * @classdesc Represents a CircuitRelay.\n     * @implements ICircuitRelay\n     * @constructor\n     * @param {ICircuitRelay=} [p] Properties to set\n     */\n    function CircuitRelay(p) {\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * CircuitRelay type.\n     * @member {CircuitRelay.Type} type\n     * @memberof CircuitRelay\n     * @instance\n     */\n    CircuitRelay.prototype.type = 1;\n\n    /**\n     * CircuitRelay srcPeer.\n     * @member {CircuitRelay.IPeer|null|undefined} srcPeer\n     * @memberof CircuitRelay\n     * @instance\n     */\n    CircuitRelay.prototype.srcPeer = null;\n\n    /**\n     * CircuitRelay dstPeer.\n     * @member {CircuitRelay.IPeer|null|undefined} dstPeer\n     * @memberof CircuitRelay\n     * @instance\n     */\n    CircuitRelay.prototype.dstPeer = null;\n\n    /**\n     * CircuitRelay code.\n     * @member {CircuitRelay.Status} code\n     * @memberof CircuitRelay\n     * @instance\n     */\n    CircuitRelay.prototype.code = 100;\n\n    /**\n     * Encodes the specified CircuitRelay message. Does not implicitly {@link CircuitRelay.verify|verify} messages.\n     * @function encode\n     * @memberof CircuitRelay\n     * @static\n     * @param {ICircuitRelay} m CircuitRelay message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    CircuitRelay.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.type != null && Object.hasOwnProperty.call(m, \"type\"))\n            w.uint32(8).int32(m.type);\n        if (m.srcPeer != null && Object.hasOwnProperty.call(m, \"srcPeer\"))\n            $root.CircuitRelay.Peer.encode(m.srcPeer, w.uint32(18).fork()).ldelim();\n        if (m.dstPeer != null && Object.hasOwnProperty.call(m, \"dstPeer\"))\n            $root.CircuitRelay.Peer.encode(m.dstPeer, w.uint32(26).fork()).ldelim();\n        if (m.code != null && Object.hasOwnProperty.call(m, \"code\"))\n            w.uint32(32).int32(m.code);\n        return w;\n    };\n\n    /**\n     * Decodes a CircuitRelay message from the specified reader or buffer.\n     * @function decode\n     * @memberof CircuitRelay\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {CircuitRelay} CircuitRelay\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    CircuitRelay.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.CircuitRelay();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.type = r.int32();\n                break;\n            case 2:\n                m.srcPeer = $root.CircuitRelay.Peer.decode(r, r.uint32());\n                break;\n            case 3:\n                m.dstPeer = $root.CircuitRelay.Peer.decode(r, r.uint32());\n                break;\n            case 4:\n                m.code = r.int32();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a CircuitRelay message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof CircuitRelay\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {CircuitRelay} CircuitRelay\n     */\n    CircuitRelay.fromObject = function fromObject(d) {\n        if (d instanceof $root.CircuitRelay)\n            return d;\n        var m = new $root.CircuitRelay();\n        switch (d.type) {\n        case \"HOP\":\n        case 1:\n            m.type = 1;\n            break;\n        case \"STOP\":\n        case 2:\n            m.type = 2;\n            break;\n        case \"STATUS\":\n        case 3:\n            m.type = 3;\n            break;\n        case \"CAN_HOP\":\n        case 4:\n            m.type = 4;\n            break;\n        }\n        if (d.srcPeer != null) {\n            if (typeof d.srcPeer !== \"object\")\n                throw TypeError(\".CircuitRelay.srcPeer: object expected\");\n            m.srcPeer = $root.CircuitRelay.Peer.fromObject(d.srcPeer);\n        }\n        if (d.dstPeer != null) {\n            if (typeof d.dstPeer !== \"object\")\n                throw TypeError(\".CircuitRelay.dstPeer: object expected\");\n            m.dstPeer = $root.CircuitRelay.Peer.fromObject(d.dstPeer);\n        }\n        switch (d.code) {\n        case \"SUCCESS\":\n        case 100:\n            m.code = 100;\n            break;\n        case \"HOP_SRC_ADDR_TOO_LONG\":\n        case 220:\n            m.code = 220;\n            break;\n        case \"HOP_DST_ADDR_TOO_LONG\":\n        case 221:\n            m.code = 221;\n            break;\n        case \"HOP_SRC_MULTIADDR_INVALID\":\n        case 250:\n            m.code = 250;\n            break;\n        case \"HOP_DST_MULTIADDR_INVALID\":\n        case 251:\n            m.code = 251;\n            break;\n        case \"HOP_NO_CONN_TO_DST\":\n        case 260:\n            m.code = 260;\n            break;\n        case \"HOP_CANT_DIAL_DST\":\n        case 261:\n            m.code = 261;\n            break;\n        case \"HOP_CANT_OPEN_DST_STREAM\":\n        case 262:\n            m.code = 262;\n            break;\n        case \"HOP_CANT_SPEAK_RELAY\":\n        case 270:\n            m.code = 270;\n            break;\n        case \"HOP_CANT_RELAY_TO_SELF\":\n        case 280:\n            m.code = 280;\n            break;\n        case \"STOP_SRC_ADDR_TOO_LONG\":\n        case 320:\n            m.code = 320;\n            break;\n        case \"STOP_DST_ADDR_TOO_LONG\":\n        case 321:\n            m.code = 321;\n            break;\n        case \"STOP_SRC_MULTIADDR_INVALID\":\n        case 350:\n            m.code = 350;\n            break;\n        case \"STOP_DST_MULTIADDR_INVALID\":\n        case 351:\n            m.code = 351;\n            break;\n        case \"STOP_RELAY_REFUSED\":\n        case 390:\n            m.code = 390;\n            break;\n        case \"MALFORMED_MESSAGE\":\n        case 400:\n            m.code = 400;\n            break;\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a CircuitRelay message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof CircuitRelay\n     * @static\n     * @param {CircuitRelay} m CircuitRelay\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    CircuitRelay.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.defaults) {\n            d.type = o.enums === String ? \"HOP\" : 1;\n            d.srcPeer = null;\n            d.dstPeer = null;\n            d.code = o.enums === String ? \"SUCCESS\" : 100;\n        }\n        if (m.type != null && m.hasOwnProperty(\"type\")) {\n            d.type = o.enums === String ? $root.CircuitRelay.Type[m.type] : m.type;\n        }\n        if (m.srcPeer != null && m.hasOwnProperty(\"srcPeer\")) {\n            d.srcPeer = $root.CircuitRelay.Peer.toObject(m.srcPeer, o);\n        }\n        if (m.dstPeer != null && m.hasOwnProperty(\"dstPeer\")) {\n            d.dstPeer = $root.CircuitRelay.Peer.toObject(m.dstPeer, o);\n        }\n        if (m.code != null && m.hasOwnProperty(\"code\")) {\n            d.code = o.enums === String ? $root.CircuitRelay.Status[m.code] : m.code;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this CircuitRelay to JSON.\n     * @function toJSON\n     * @memberof CircuitRelay\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    CircuitRelay.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    /**\n     * Status enum.\n     * @name CircuitRelay.Status\n     * @enum {number}\n     * @property {number} SUCCESS=100 SUCCESS value\n     * @property {number} HOP_SRC_ADDR_TOO_LONG=220 HOP_SRC_ADDR_TOO_LONG value\n     * @property {number} HOP_DST_ADDR_TOO_LONG=221 HOP_DST_ADDR_TOO_LONG value\n     * @property {number} HOP_SRC_MULTIADDR_INVALID=250 HOP_SRC_MULTIADDR_INVALID value\n     * @property {number} HOP_DST_MULTIADDR_INVALID=251 HOP_DST_MULTIADDR_INVALID value\n     * @property {number} HOP_NO_CONN_TO_DST=260 HOP_NO_CONN_TO_DST value\n     * @property {number} HOP_CANT_DIAL_DST=261 HOP_CANT_DIAL_DST value\n     * @property {number} HOP_CANT_OPEN_DST_STREAM=262 HOP_CANT_OPEN_DST_STREAM value\n     * @property {number} HOP_CANT_SPEAK_RELAY=270 HOP_CANT_SPEAK_RELAY value\n     * @property {number} HOP_CANT_RELAY_TO_SELF=280 HOP_CANT_RELAY_TO_SELF value\n     * @property {number} STOP_SRC_ADDR_TOO_LONG=320 STOP_SRC_ADDR_TOO_LONG value\n     * @property {number} STOP_DST_ADDR_TOO_LONG=321 STOP_DST_ADDR_TOO_LONG value\n     * @property {number} STOP_SRC_MULTIADDR_INVALID=350 STOP_SRC_MULTIADDR_INVALID value\n     * @property {number} STOP_DST_MULTIADDR_INVALID=351 STOP_DST_MULTIADDR_INVALID value\n     * @property {number} STOP_RELAY_REFUSED=390 STOP_RELAY_REFUSED value\n     * @property {number} MALFORMED_MESSAGE=400 MALFORMED_MESSAGE value\n     */\n    CircuitRelay.Status = (function() {\n        var valuesById = {}, values = Object.create(valuesById);\n        values[valuesById[100] = \"SUCCESS\"] = 100;\n        values[valuesById[220] = \"HOP_SRC_ADDR_TOO_LONG\"] = 220;\n        values[valuesById[221] = \"HOP_DST_ADDR_TOO_LONG\"] = 221;\n        values[valuesById[250] = \"HOP_SRC_MULTIADDR_INVALID\"] = 250;\n        values[valuesById[251] = \"HOP_DST_MULTIADDR_INVALID\"] = 251;\n        values[valuesById[260] = \"HOP_NO_CONN_TO_DST\"] = 260;\n        values[valuesById[261] = \"HOP_CANT_DIAL_DST\"] = 261;\n        values[valuesById[262] = \"HOP_CANT_OPEN_DST_STREAM\"] = 262;\n        values[valuesById[270] = \"HOP_CANT_SPEAK_RELAY\"] = 270;\n        values[valuesById[280] = \"HOP_CANT_RELAY_TO_SELF\"] = 280;\n        values[valuesById[320] = \"STOP_SRC_ADDR_TOO_LONG\"] = 320;\n        values[valuesById[321] = \"STOP_DST_ADDR_TOO_LONG\"] = 321;\n        values[valuesById[350] = \"STOP_SRC_MULTIADDR_INVALID\"] = 350;\n        values[valuesById[351] = \"STOP_DST_MULTIADDR_INVALID\"] = 351;\n        values[valuesById[390] = \"STOP_RELAY_REFUSED\"] = 390;\n        values[valuesById[400] = \"MALFORMED_MESSAGE\"] = 400;\n        return values;\n    })();\n\n    /**\n     * Type enum.\n     * @name CircuitRelay.Type\n     * @enum {number}\n     * @property {number} HOP=1 HOP value\n     * @property {number} STOP=2 STOP value\n     * @property {number} STATUS=3 STATUS value\n     * @property {number} CAN_HOP=4 CAN_HOP value\n     */\n    CircuitRelay.Type = (function() {\n        var valuesById = {}, values = Object.create(valuesById);\n        values[valuesById[1] = \"HOP\"] = 1;\n        values[valuesById[2] = \"STOP\"] = 2;\n        values[valuesById[3] = \"STATUS\"] = 3;\n        values[valuesById[4] = \"CAN_HOP\"] = 4;\n        return values;\n    })();\n\n    CircuitRelay.Peer = (function() {\n\n        /**\n         * Properties of a Peer.\n         * @memberof CircuitRelay\n         * @interface IPeer\n         * @property {Uint8Array} id Peer id\n         * @property {Array.<Uint8Array>|null} [addrs] Peer addrs\n         */\n\n        /**\n         * Constructs a new Peer.\n         * @memberof CircuitRelay\n         * @classdesc Represents a Peer.\n         * @implements IPeer\n         * @constructor\n         * @param {CircuitRelay.IPeer=} [p] Properties to set\n         */\n        function Peer(p) {\n            this.addrs = [];\n            if (p)\n                for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                    if (p[ks[i]] != null)\n                        this[ks[i]] = p[ks[i]];\n        }\n\n        /**\n         * Peer id.\n         * @member {Uint8Array} id\n         * @memberof CircuitRelay.Peer\n         * @instance\n         */\n        Peer.prototype.id = $util.newBuffer([]);\n\n        /**\n         * Peer addrs.\n         * @member {Array.<Uint8Array>} addrs\n         * @memberof CircuitRelay.Peer\n         * @instance\n         */\n        Peer.prototype.addrs = $util.emptyArray;\n\n        /**\n         * Encodes the specified Peer message. Does not implicitly {@link CircuitRelay.Peer.verify|verify} messages.\n         * @function encode\n         * @memberof CircuitRelay.Peer\n         * @static\n         * @param {CircuitRelay.IPeer} m Peer message or plain object to encode\n         * @param {$protobuf.Writer} [w] Writer to encode to\n         * @returns {$protobuf.Writer} Writer\n         */\n        Peer.encode = function encode(m, w) {\n            if (!w)\n                w = $Writer.create();\n            w.uint32(10).bytes(m.id);\n            if (m.addrs != null && m.addrs.length) {\n                for (var i = 0; i < m.addrs.length; ++i)\n                    w.uint32(18).bytes(m.addrs[i]);\n            }\n            return w;\n        };\n\n        /**\n         * Decodes a Peer message from the specified reader or buffer.\n         * @function decode\n         * @memberof CircuitRelay.Peer\n         * @static\n         * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n         * @param {number} [l] Message length if known beforehand\n         * @returns {CircuitRelay.Peer} Peer\n         * @throws {Error} If the payload is not a reader or valid buffer\n         * @throws {$protobuf.util.ProtocolError} If required fields are missing\n         */\n        Peer.decode = function decode(r, l) {\n            if (!(r instanceof $Reader))\n                r = $Reader.create(r);\n            var c = l === undefined ? r.len : r.pos + l, m = new $root.CircuitRelay.Peer();\n            while (r.pos < c) {\n                var t = r.uint32();\n                switch (t >>> 3) {\n                case 1:\n                    m.id = r.bytes();\n                    break;\n                case 2:\n                    if (!(m.addrs && m.addrs.length))\n                        m.addrs = [];\n                    m.addrs.push(r.bytes());\n                    break;\n                default:\n                    r.skipType(t & 7);\n                    break;\n                }\n            }\n            if (!m.hasOwnProperty(\"id\"))\n                throw $util.ProtocolError(\"missing required 'id'\", { instance: m });\n            return m;\n        };\n\n        /**\n         * Creates a Peer message from a plain object. Also converts values to their respective internal types.\n         * @function fromObject\n         * @memberof CircuitRelay.Peer\n         * @static\n         * @param {Object.<string,*>} d Plain object\n         * @returns {CircuitRelay.Peer} Peer\n         */\n        Peer.fromObject = function fromObject(d) {\n            if (d instanceof $root.CircuitRelay.Peer)\n                return d;\n            var m = new $root.CircuitRelay.Peer();\n            if (d.id != null) {\n                if (typeof d.id === \"string\")\n                    $util.base64.decode(d.id, m.id = $util.newBuffer($util.base64.length(d.id)), 0);\n                else if (d.id.length)\n                    m.id = d.id;\n            }\n            if (d.addrs) {\n                if (!Array.isArray(d.addrs))\n                    throw TypeError(\".CircuitRelay.Peer.addrs: array expected\");\n                m.addrs = [];\n                for (var i = 0; i < d.addrs.length; ++i) {\n                    if (typeof d.addrs[i] === \"string\")\n                        $util.base64.decode(d.addrs[i], m.addrs[i] = $util.newBuffer($util.base64.length(d.addrs[i])), 0);\n                    else if (d.addrs[i].length)\n                        m.addrs[i] = d.addrs[i];\n                }\n            }\n            return m;\n        };\n\n        /**\n         * Creates a plain object from a Peer message. Also converts values to other types if specified.\n         * @function toObject\n         * @memberof CircuitRelay.Peer\n         * @static\n         * @param {CircuitRelay.Peer} m Peer\n         * @param {$protobuf.IConversionOptions} [o] Conversion options\n         * @returns {Object.<string,*>} Plain object\n         */\n        Peer.toObject = function toObject(m, o) {\n            if (!o)\n                o = {};\n            var d = {};\n            if (o.arrays || o.defaults) {\n                d.addrs = [];\n            }\n            if (o.defaults) {\n                if (o.bytes === String)\n                    d.id = \"\";\n                else {\n                    d.id = [];\n                    if (o.bytes !== Array)\n                        d.id = $util.newBuffer(d.id);\n                }\n            }\n            if (m.id != null && m.hasOwnProperty(\"id\")) {\n                d.id = o.bytes === String ? $util.base64.encode(m.id, 0, m.id.length) : o.bytes === Array ? Array.prototype.slice.call(m.id) : m.id;\n            }\n            if (m.addrs && m.addrs.length) {\n                d.addrs = [];\n                for (var j = 0; j < m.addrs.length; ++j) {\n                    d.addrs[j] = o.bytes === String ? $util.base64.encode(m.addrs[j], 0, m.addrs[j].length) : o.bytes === Array ? Array.prototype.slice.call(m.addrs[j]) : m.addrs[j];\n                }\n            }\n            return d;\n        };\n\n        /**\n         * Converts this Peer to JSON.\n         * @function toJSON\n         * @memberof CircuitRelay.Peer\n         * @instance\n         * @returns {Object.<string,*>} JSON object\n         */\n        Peer.prototype.toJSON = function toJSON() {\n            return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n        };\n\n        return Peer;\n    })();\n\n    return CircuitRelay;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\nconst { source: abortable } = require('abortable-iterator')\nconst debug = require('debug')\nconst log = debug('libp2p:stream:converter')\n\n/**\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n *\n * @typedef {Object} Timeline\n * @property {number} open - connection opening timestamp.\n * @property {number} [upgraded] - connection upgraded timestamp.\n * @property {number} [close]\n */\n\n/**\n * Convert a duplex iterable into a MultiaddrConnection.\n * https://github.com/libp2p/interface-transport#multiaddrconnection\n *\n * @param {object} streamProperties\n * @param {MuxedStream} streamProperties.stream\n * @param {Multiaddr} streamProperties.remoteAddr\n * @param {Multiaddr} streamProperties.localAddr\n * @param {object} [options]\n * @param {AbortSignal} [options.signal]\n * @returns {import('libp2p-interfaces/src/transport/types').MultiaddrConnection}\n */\nfunction streamToMaConnection ({ stream, remoteAddr, localAddr }, options = {}) {\n  const { sink, source } = stream\n  const maConn = {\n    /**\n     * @param {Uint8Array} source\n     */\n    async sink (source) {\n      if (options.signal) {\n        // @ts-ignore ts infers source template will be a number\n        source = abortable(source, options.signal)\n      }\n\n      try {\n        await sink(source)\n      } catch (err) {\n        // If aborted we can safely ignore\n        if (err.type !== 'aborted') {\n          // If the source errored the socket will already have been destroyed by\n          // toIterable.duplex(). If the socket errored it will already be\n          // destroyed. There's nothing to do here except log the error & return.\n          log(err)\n        }\n      }\n      close()\n    },\n    source: options.signal ? abortable(source, options.signal) : source,\n    conn: stream,\n    localAddr,\n    remoteAddr,\n    /** @type {Timeline} */\n    timeline: { open: Date.now(), close: undefined },\n    close () {\n      sink(new Uint8Array(0))\n      return close()\n    }\n  }\n\n  function close () {\n    if (!maConn.timeline.close) {\n      maConn.timeline.close = Date.now()\n    }\n    return Promise.resolve()\n  }\n\n  return maConn\n}\n\nmodule.exports = streamToMaConnection\n","'use strict'\n\nmodule.exports = {\n  relay: '/libp2p/circuit/relay/0.1.0'\n}\n","'use strict'\n\nconst { EventEmitter } = require('events')\nconst { Multiaddr } = require('multiaddr')\n\n/**\n * @typedef {import('libp2p-interfaces/src/transport/types').Listener} Listener\n */\n\n/**\n * @param {import('../')} libp2p\n * @returns {Listener} a transport listener\n */\nmodule.exports = (libp2p) => {\n  const listeningAddrs = new Map()\n\n  /**\n   * Add swarm handler and listen for incoming connections\n   *\n   * @param {Multiaddr} addr\n   * @returns {Promise<void>}\n   */\n  async function listen (addr) {\n    const addrString = String(addr).split('/p2p-circuit').find(a => a !== '')\n\n    const relayConn = await libp2p.dial(new Multiaddr(addrString))\n    const relayedAddr = relayConn.remoteAddr.encapsulate('/p2p-circuit')\n\n    listeningAddrs.set(relayConn.remotePeer.toB58String(), relayedAddr)\n    listener.emit('listening')\n  }\n\n  /**\n   * Get fixed up multiaddrs\n   *\n   * NOTE: This method will grab the peers multiaddrs and expand them such that:\n   *\n   * a) If it's an existing /p2p-circuit address for a specific relay i.e.\n   * `/ip4/0.0.0.0/tcp/0/ipfs/QmRelay/p2p-circuit` this method will expand the\n   * address to `/ip4/0.0.0.0/tcp/0/ipfs/QmRelay/p2p-circuit/ipfs/QmPeer` where\n   * `QmPeer` is this peers id\n   * b) If it's not a /p2p-circuit address, it will encapsulate the address as a /p2p-circuit\n   * addr, such when dialing over a relay with this address, it will create the circuit using\n   * the encapsulated transport address. This is useful when for example, a peer should only\n   * be dialed over TCP rather than any other transport\n   *\n   * @returns {Multiaddr[]}\n   */\n  function getAddrs () {\n    const addrs = []\n    for (const addr of listeningAddrs.values()) {\n      addrs.push(addr)\n    }\n    return addrs\n  }\n\n  /** @type Listener */\n  const listener = Object.assign(new EventEmitter(), {\n    close: () => Promise.resolve(),\n    listen,\n    getAddrs\n  })\n\n  // Remove listeningAddrs when a peer disconnects\n  libp2p.connectionManager.on('peer:disconnect', (connection) => {\n    const deleted = listeningAddrs.delete(connection.remotePeer.toB58String())\n\n    if (deleted) {\n      // Announce listen addresses change\n      listener.emit('close')\n    }\n  })\n\n  return listener\n}\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:circuit:hop'), {\n  error: debug('libp2p:circuit:hop:err')\n})\nconst errCode = require('err-code')\n\nconst PeerId = require('peer-id')\nconst { validateAddrs } = require('./utils')\nconst StreamHandler = require('./stream-handler')\nconst { CircuitRelay: CircuitPB } = require('../protocol')\nconst { pipe } = require('it-pipe')\nconst { codes: Errors } = require('../../errors')\n\nconst { stop } = require('./stop')\n\nconst multicodec = require('./../multicodec')\n\n/**\n * @typedef {import('../protocol').ICircuitRelay} ICircuitRelay\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n * @typedef {import('../transport')} Transport\n */\n\n/**\n * @typedef {Object} HopRequest\n * @property {Connection} connection\n * @property {ICircuitRelay} request\n * @property {StreamHandler} streamHandler\n * @property {Transport} circuit\n */\n\n/**\n * @param {HopRequest} options\n * @returns {Promise<void>}\n */\nasync function handleHop ({\n  connection,\n  request,\n  streamHandler,\n  circuit\n}) {\n  // Ensure hop is enabled\n  if (!circuit._options.hop.enabled) {\n    log('HOP request received but we are not acting as a relay')\n    return streamHandler.end({\n      type: CircuitPB.Type.STATUS,\n      code: CircuitPB.Status.HOP_CANT_SPEAK_RELAY\n    })\n  }\n\n  // Validate the HOP request has the required input\n  try {\n    validateAddrs(request, streamHandler)\n  } catch (err) {\n    return log.error('invalid hop request via peer %s', connection.remotePeer.toB58String(), err)\n  }\n\n  if (!request.dstPeer) {\n    log('HOP request received but we do not receive a dstPeer')\n    return\n  }\n\n  // Get the connection to the destination (stop) peer\n  const destinationPeer = new PeerId(request.dstPeer.id)\n\n  const destinationConnection = circuit._connectionManager.get(destinationPeer)\n  if (!destinationConnection && !circuit._options.hop.active) {\n    log('HOP request received but we are not connected to the destination peer')\n    return streamHandler.end({\n      type: CircuitPB.Type.STATUS,\n      code: CircuitPB.Status.HOP_NO_CONN_TO_DST\n    })\n  }\n\n  // TODO: Handle being an active relay\n  if (!destinationConnection) {\n    return\n  }\n\n  // Handle the incoming HOP request by performing a STOP request\n  const stopRequest = {\n    type: CircuitPB.Type.STOP,\n    dstPeer: request.dstPeer,\n    srcPeer: request.srcPeer\n  }\n\n  let destinationStream\n  try {\n    destinationStream = await stop({\n      connection: destinationConnection,\n      request: stopRequest\n    })\n  } catch (err) {\n    return log.error(err)\n  }\n\n  log('hop request from %s is valid', connection.remotePeer.toB58String())\n  streamHandler.write({\n    type: CircuitPB.Type.STATUS,\n    code: CircuitPB.Status.SUCCESS\n  })\n  const sourceStream = streamHandler.rest()\n\n  // Short circuit the two streams to create the relayed connection\n  return pipe(\n    sourceStream,\n    destinationStream,\n    sourceStream\n  )\n}\n\n/**\n * Performs a HOP request to a relay peer, to request a connection to another\n * peer. A new, virtual, connection will be created between the two via the relay.\n *\n * @param {object} options\n * @param {Connection} options.connection - Connection to the relay\n * @param {ICircuitRelay} options.request\n * @returns {Promise<MuxedStream>}\n */\nasync function hop ({\n  connection,\n  request\n}) {\n  // Create a new stream to the relay\n  const { stream } = await connection.newStream([multicodec.relay])\n  // Send the HOP request\n  const streamHandler = new StreamHandler({ stream })\n  streamHandler.write(request)\n\n  const response = await streamHandler.read()\n\n  if (!response) {\n    throw errCode(new Error('HOP request had no response'), Errors.ERR_HOP_REQUEST_FAILED)\n  }\n\n  if (response.code === CircuitPB.Status.SUCCESS) {\n    log('hop request was successful')\n    return streamHandler.rest()\n  }\n\n  log('hop request failed with code %d, closing stream', response.code)\n  streamHandler.close()\n  throw errCode(new Error(`HOP request failed with code ${response.code}`), Errors.ERR_HOP_REQUEST_FAILED)\n}\n\n/**\n * Performs a CAN_HOP request to a relay peer, in order to understand its capabilities.\n *\n * @param {object} options\n * @param {Connection} options.connection - Connection to the relay\n * @returns {Promise<boolean>}\n */\nasync function canHop ({\n  connection\n}) {\n  // Create a new stream to the relay\n  const { stream } = await connection.newStream([multicodec.relay])\n  // Send the HOP request\n  const streamHandler = new StreamHandler({ stream })\n  streamHandler.write({\n    type: CircuitPB.Type.CAN_HOP\n  })\n\n  const response = await streamHandler.read()\n  await streamHandler.close()\n\n  if (!response || response.code !== CircuitPB.Status.SUCCESS) {\n    return false\n  }\n\n  return true\n}\n\n/**\n * Creates an unencoded CAN_HOP response based on the Circuits configuration\n *\n * @param {Object} options\n * @param {Connection} options.connection\n * @param {StreamHandler} options.streamHandler\n * @param {Transport} options.circuit\n * @private\n */\nfunction handleCanHop ({\n  connection,\n  streamHandler,\n  circuit\n}) {\n  const canHop = circuit._options.hop.enabled\n  log('can hop (%s) request from %s', canHop, connection.remotePeer.toB58String())\n  streamHandler.end({\n    type: CircuitPB.Type.STATUS,\n    code: canHop ? CircuitPB.Status.SUCCESS : CircuitPB.Status.HOP_CANT_SPEAK_RELAY\n  })\n}\n\nmodule.exports = {\n  handleHop,\n  hop,\n  canHop,\n  handleCanHop\n}\n","'use strict'\n\nconst { Multiaddr } = require('multiaddr')\nconst { CircuitRelay } = require('../protocol')\n\n/**\n * @typedef {import('./stream-handler')} StreamHandler\n * @typedef {import('../protocol').ICircuitRelay} ICircuitRelay\n */\n\n/**\n * Write a response\n *\n * @param {StreamHandler} streamHandler\n * @param {import('../protocol').CircuitRelay.Status} status\n */\nfunction writeResponse (streamHandler, status) {\n  streamHandler.write({\n    type: CircuitRelay.Type.STATUS,\n    code: status\n  })\n}\n\n/**\n * Validate incomming HOP/STOP message\n *\n * @param {ICircuitRelay} msg - A CircuitRelay unencoded protobuf message\n * @param {StreamHandler} streamHandler\n */\nfunction validateAddrs (msg, streamHandler) {\n  try {\n    if (msg.dstPeer && msg.dstPeer.addrs) {\n      msg.dstPeer.addrs.forEach((addr) => {\n        return new Multiaddr(addr)\n      })\n    }\n  } catch (err) {\n    writeResponse(streamHandler, msg.type === CircuitRelay.Type.HOP\n      ? CircuitRelay.Status.HOP_DST_MULTIADDR_INVALID\n      : CircuitRelay.Status.STOP_DST_MULTIADDR_INVALID)\n    throw err\n  }\n\n  try {\n    if (msg.srcPeer && msg.srcPeer.addrs) {\n      msg.srcPeer.addrs.forEach((addr) => {\n        return new Multiaddr(addr)\n      })\n    }\n  } catch (err) {\n    writeResponse(streamHandler, msg.type === CircuitRelay.Type.HOP\n      ? CircuitRelay.Status.HOP_SRC_MULTIADDR_INVALID\n      : CircuitRelay.Status.STOP_SRC_MULTIADDR_INVALID)\n    throw err\n  }\n}\n\nmodule.exports = {\n  validateAddrs\n}\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:circuit:stream-handler'), {\n  error: debug('libp2p:circuit:stream-handler:err')\n})\n\nconst lp = require('it-length-prefixed')\n// @ts-ignore it-handshake does not export types\nconst handshake = require('it-handshake')\nconst { CircuitRelay } = require('../protocol')\n\n/**\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n * @typedef {import('../protocol').ICircuitRelay} ICircuitRelay\n */\n\nclass StreamHandler {\n  /**\n   * Create a stream handler for connection\n   *\n   * @class\n   * @param {object} options\n   * @param {MuxedStream} options.stream - A duplex iterable\n   * @param {number} [options.maxLength = 4096] - max bytes length of message\n   */\n  constructor ({ stream, maxLength = 4096 }) {\n    this.stream = stream\n\n    this.shake = handshake(this.stream)\n    // @ts-ignore options are not optional\n    this.decoder = lp.decode.fromReader(this.shake.reader, { maxDataLength: maxLength })\n  }\n\n  /**\n   * Read and decode message\n   *\n   * @async\n   */\n  async read () {\n    const msg = await this.decoder.next()\n    if (msg.value) {\n      const value = CircuitRelay.decode(msg.value.slice())\n      log('read message type', value.type)\n      return value\n    }\n\n    log('read received no value, closing stream')\n    // End the stream, we didn't get data\n    this.close()\n  }\n\n  /**\n   * Encode and write array of buffers\n   *\n   * @param {ICircuitRelay} msg - An unencoded CircuitRelay protobuf message\n   * @returns {void}\n   */\n  write (msg) {\n    log('write message type %s', msg.type)\n    // @ts-ignore lp.encode expects type type 'Buffer | BufferList', not 'Uint8Array'\n    this.shake.write(lp.encode.single(CircuitRelay.encode(msg).finish()))\n  }\n\n  /**\n   * Return the handshake rest stream and invalidate handler\n   *\n   * @returns {*} A duplex iterable\n   */\n  rest () {\n    this.shake.rest()\n    return this.shake.stream\n  }\n\n  /**\n   * @param {ICircuitRelay} msg - An unencoded CircuitRelay protobuf message\n   */\n  end (msg) {\n    this.write(msg)\n    this.close()\n  }\n\n  /**\n   * Close the stream\n   *\n   * @returns {void}\n   */\n  close () {\n    log('closing the stream')\n    this.rest().sink([])\n  }\n}\n\nmodule.exports = StreamHandler\n","'use strict'\n\nconst Reader = require('it-reader')\nconst Writer = require('it-pushable')\nconst defer = require('p-defer')\n\n// Convert a duplex stream into a reader and writer and rest stream\nmodule.exports = stream => {\n  const writer = Writer() // Write bytes on demand to the sink\n  const reader = Reader(stream.source) // Read bytes on demand from the source\n\n  // Waits for a source to be passed to the rest stream's sink\n  const sourcePromise = defer()\n  let sinkErr\n\n  const sinkPromise = stream.sink((async function * () {\n    yield * writer\n    const source = await sourcePromise.promise\n    yield * source\n  })())\n\n  sinkPromise.catch(err => {\n    sinkErr = err\n  })\n\n  const rest = {\n    sink: source => {\n      if (sinkErr) {\n        return Promise.reject(sinkErr)\n      }\n\n      sourcePromise.resolve(source)\n      return sinkPromise\n    },\n    source: reader\n  }\n\n  return {\n    reader,\n    writer,\n    stream: rest,\n    rest: () => writer.end(),\n    write: writer.push,\n    read: async () => {\n      return (await reader.next()).value\n    }\n  }\n}\n","const BufferList = require('bl/BufferList')\n\nmodule.exports = source => {\n  const reader = (async function * () {\n    let bytes = yield // Allows us to receive 8 when reader.next(8) is called\n    let bl = new BufferList()\n\n    for await (const chunk of source) {\n      if (!bytes) {\n        bytes = yield bl.append(chunk)\n        bl = new BufferList()\n        continue\n      }\n\n      bl.append(chunk)\n\n      while (bl.length >= bytes) {\n        const data = bl.shallowSlice(0, bytes)\n        bl.consume(bytes)\n        bytes = yield data\n\n        // If we no longer want a specific byte length, we yield the rest now\n        if (!bytes) {\n          if (bl.length) {\n            bytes = yield bl\n            bl = new BufferList()\n          }\n          break // bytes is null and/or no more buffer to yield\n        }\n      }\n    }\n\n    // Consumer wants more bytes but the source has ended and our buffer\n    // is not big enough to satisfy.\n    if (bytes) {\n      throw Object.assign(\n        new Error(`stream ended before ${bytes} bytes became available`),\n        { code: 'ERR_UNDER_READ', buffer: bl }\n      )\n    }\n  })()\n\n  reader.next()\n  return reader\n}\n","'use strict';\n\nconst pDefer = () => {\n\tconst deferred = {};\n\n\tdeferred.promise = new Promise((resolve, reject) => {\n\t\tdeferred.resolve = resolve;\n\t\tdeferred.reject = reject;\n\t});\n\n\treturn deferred;\n};\n\nmodule.exports = pDefer;\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:circuit:stop'), {\n  error: debug('libp2p:circuit:stop:err')\n})\n\nconst { CircuitRelay: CircuitPB } = require('../protocol')\nconst multicodec = require('../multicodec')\nconst StreamHandler = require('./stream-handler')\nconst { validateAddrs } = require('./utils')\n\n/**\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n * @typedef {import('../protocol').ICircuitRelay} ICircuitRelay\n */\n\n/**\n * Handles incoming STOP requests\n *\n * @private\n * @param {Object} options\n * @param {Connection} options.connection\n * @param {ICircuitRelay} options.request - The CircuitRelay protobuf request (unencoded)\n * @param {StreamHandler} options.streamHandler\n * @returns {Promise<MuxedStream>|void} Resolves a duplex iterable\n */\nmodule.exports.handleStop = function handleStop ({\n  connection,\n  request,\n  streamHandler\n}) {\n  // Validate the STOP request has the required input\n  try {\n    validateAddrs(request, streamHandler)\n  } catch (err) {\n    return log.error('invalid stop request via peer %s', connection.remotePeer.toB58String(), err)\n  }\n\n  // The request is valid\n  log('stop request is valid')\n  streamHandler.write({\n    type: CircuitPB.Type.STATUS,\n    code: CircuitPB.Status.SUCCESS\n  })\n  return streamHandler.rest()\n}\n\n/**\n * Creates a STOP request\n *\n * @private\n * @param {Object} options\n * @param {Connection} options.connection\n * @param {ICircuitRelay} options.request - The CircuitRelay protobuf request (unencoded)\n * @returns {Promise<MuxedStream|void>} Resolves a duplex iterable\n */\nmodule.exports.stop = async function stop ({\n  connection,\n  request\n}) {\n  const { stream } = await connection.newStream([multicodec.relay])\n  log('starting stop request to %s', connection.remotePeer.toB58String())\n  const streamHandler = new StreamHandler({ stream })\n\n  streamHandler.write(request)\n  const response = await streamHandler.read()\n\n  if (!response) {\n    return streamHandler.close()\n  }\n\n  if (response.code === CircuitPB.Status.SUCCESS) {\n    log('stop request to %s was successful', connection.remotePeer.toB58String())\n    return streamHandler.rest()\n  }\n\n  log('stop request failed with code %d', response.code)\n  streamHandler.close()\n}\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:relay'), {\n  error: debug('libp2p:relay:err')\n})\n\nconst {\n  setDelayedInterval,\n  clearDelayedInterval\n// @ts-ignore set-delayed-interval does not export types\n} = require('set-delayed-interval')\n\nconst AutoRelay = require('./auto-relay')\nconst { namespaceToCid } = require('./utils')\nconst {\n  RELAY_RENDEZVOUS_NS\n} = require('./constants')\n\n/**\n * @typedef {import('../')} Libp2p\n *\n * @typedef {Object} RelayAdvertiseOptions\n * @property {number} [bootDelay = ADVERTISE_BOOT_DELAY]\n * @property {boolean} [enabled = true]\n * @property {number} [ttl = ADVERTISE_TTL]\n *\n * @typedef {Object} HopOptions\n * @property {boolean} [enabled = false]\n * @property {boolean} [active = false]\n *\n * @typedef {Object} AutoRelayOptions\n * @property {number} [maxListeners = 2] - maximum number of relays to listen.\n * @property {boolean} [enabled = false]\n */\n\nclass Relay {\n  /**\n   * Creates an instance of Relay.\n   *\n   * @class\n   * @param {Libp2p} libp2p\n   */\n  constructor (libp2p) {\n    this._libp2p = libp2p\n    this._options = {\n      ...libp2p._config.relay\n    }\n\n    // Create autoRelay if enabled\n    this._autoRelay = this._options.autoRelay.enabled && new AutoRelay({ libp2p, ...this._options.autoRelay })\n\n    this._advertiseService = this._advertiseService.bind(this)\n  }\n\n  /**\n   * Start Relay service.\n   *\n   * @returns {void}\n   */\n  start () {\n    // Advertise service if HOP enabled\n    const canHop = this._options.hop.enabled\n\n    if (canHop && this._options.advertise.enabled) {\n      this._timeout = setDelayedInterval(\n        this._advertiseService, this._options.advertise.ttl, this._options.advertise.bootDelay\n      )\n    }\n  }\n\n  /**\n   * Stop Relay service.\n   *\n   * @returns {void}\n   */\n  stop () {\n    clearDelayedInterval(this._timeout)\n  }\n\n  /**\n   * Advertise hop relay service in the network.\n   *\n   * @returns {Promise<void>}\n   */\n  async _advertiseService () {\n    try {\n      const cid = await namespaceToCid(RELAY_RENDEZVOUS_NS)\n      await this._libp2p.contentRouting.provide(cid)\n    } catch (err) {\n      if (err.code === 'NO_ROUTERS_AVAILABLE') {\n        log.error('a content router, such as a DHT, must be provided in order to advertise the relay service', err)\n        // Stop the advertise\n        this.stop()\n      } else {\n        log.error(err)\n      }\n    }\n  }\n}\n\nmodule.exports = Relay\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:auto-relay'), {\n  error: debug('libp2p:auto-relay:err')\n})\n\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst { Multiaddr } = require('multiaddr')\nconst PeerId = require('peer-id')\n\nconst { relay: multicodec } = require('./multicodec')\nconst { canHop } = require('./circuit/hop')\nconst { namespaceToCid } = require('./utils')\nconst {\n  CIRCUIT_PROTO_CODE,\n  HOP_METADATA_KEY,\n  HOP_METADATA_VALUE,\n  RELAY_RENDEZVOUS_NS\n} = require('./constants')\n\n/**\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('../peer-store/address-book').Address} Address\n */\n\n/**\n * @typedef {Object} AutoRelayProperties\n * @property {import('../')} libp2p\n *\n * @typedef {Object} AutoRelayOptions\n * @property {number} [maxListeners = 1] - maximum number of relays to listen.\n * @property {(error: Error, msg?: string) => {}} [onError]\n */\n\nclass AutoRelay {\n  /**\n   * Creates an instance of AutoRelay.\n   *\n   * @class\n   * @param {AutoRelayProperties & AutoRelayOptions} props\n   */\n  constructor ({ libp2p, maxListeners = 1, onError }) {\n    this._libp2p = libp2p\n    this._peerId = libp2p.peerId\n    this._peerStore = libp2p.peerStore\n    this._connectionManager = libp2p.connectionManager\n    this._transportManager = libp2p.transportManager\n    this._addressSorter = libp2p.dialer.addressSorter\n\n    this.maxListeners = maxListeners\n\n    /**\n     * @type {Set<string>}\n     */\n    this._listenRelays = new Set()\n\n    this._onProtocolChange = this._onProtocolChange.bind(this)\n    this._onPeerDisconnected = this._onPeerDisconnected.bind(this)\n\n    this._peerStore.on('change:protocols', this._onProtocolChange)\n    this._connectionManager.on('peer:disconnect', this._onPeerDisconnected)\n\n    /**\n     * @param {Error} error\n     * @param {string} [msg]\n     */\n    this._onError = (error, msg) => {\n      log.error(msg || error)\n      onError && onError(error, msg)\n    }\n  }\n\n  /**\n   * Check if a peer supports the relay protocol.\n   * If the protocol is not supported, check if it was supported before and remove it as a listen relay.\n   * If the protocol is supported, check if the peer supports **HOP** and add it as a listener if\n   * inside the threshold.\n   *\n   * @param {Object} props\n   * @param {PeerId} props.peerId\n   * @param {string[]} props.protocols\n   * @returns {Promise<void>}\n   */\n  async _onProtocolChange ({ peerId, protocols }) {\n    const id = peerId.toB58String()\n\n    // Check if it has the protocol\n    const hasProtocol = protocols.find(protocol => protocol === multicodec)\n\n    // If no protocol, check if we were keeping the peer before as a listenRelay\n    if (!hasProtocol && this._listenRelays.has(id)) {\n      this._removeListenRelay(id)\n      return\n    } else if (!hasProtocol || this._listenRelays.has(id)) {\n      return\n    }\n\n    // If protocol, check if can hop, store info in the metadataBook and listen on it\n    try {\n      const connection = this._connectionManager.get(peerId)\n      if (!connection) {\n        return\n      }\n\n      // Do not hop on a relayed connection\n      if (connection.remoteAddr.protoCodes().includes(CIRCUIT_PROTO_CODE)) {\n        log(`relayed connection to ${id} will not be used to hop on`)\n        return\n      }\n\n      const supportsHop = await canHop({ connection })\n\n      if (supportsHop) {\n        this._peerStore.metadataBook.set(peerId, HOP_METADATA_KEY, uint8ArrayFromString(HOP_METADATA_VALUE))\n        await this._addListenRelay(connection, id)\n      }\n    } catch (err) {\n      this._onError(err)\n    }\n  }\n\n  /**\n   * Peer disconnects.\n   *\n   * @param {Connection} connection - connection to the peer\n   * @returns {void}\n   */\n  _onPeerDisconnected (connection) {\n    const peerId = connection.remotePeer\n    const id = peerId.toB58String()\n\n    // Not listening on this relay\n    if (!this._listenRelays.has(id)) {\n      return\n    }\n\n    this._removeListenRelay(id)\n  }\n\n  /**\n   * Attempt to listen on the given relay connection.\n   *\n   * @private\n   * @param {Connection} connection - connection to the peer\n   * @param {string} id - peer identifier string\n   * @returns {Promise<void>}\n   */\n  async _addListenRelay (connection, id) {\n    // Check if already listening on enough relays\n    if (this._listenRelays.size >= this.maxListeners) {\n      return\n    }\n\n    // Get peer known addresses and sort them per public addresses first\n    const remoteAddrs = this._peerStore.addressBook.getMultiaddrsForPeer(\n      connection.remotePeer, this._addressSorter\n    )\n\n    if (!remoteAddrs || !remoteAddrs.length) {\n      return\n    }\n\n    const listenAddr = `${remoteAddrs[0].toString()}/p2p-circuit`\n    this._listenRelays.add(id)\n\n    // Attempt to listen on relay\n    try {\n      await this._transportManager.listen([new Multiaddr(listenAddr)])\n      // Announce multiaddrs will update on listen success by TransportManager event being triggered\n    } catch (err) {\n      this._onError(err)\n      this._listenRelays.delete(id)\n    }\n  }\n\n  /**\n   * Remove listen relay.\n   *\n   * @private\n   * @param {string} id - peer identifier string.\n   * @returns {void}\n   */\n  _removeListenRelay (id) {\n    if (this._listenRelays.delete(id)) {\n      // TODO: this should be responsibility of the connMgr\n      this._listenOnAvailableHopRelays([id])\n    }\n  }\n\n  /**\n   * Try to listen on available hop relay connections.\n   * The following order will happen while we do not have enough relays.\n   * 1. Check the metadata store for known relays, try to listen on the ones we are already connected.\n   * 2. Dial and try to listen on the peers we know that support hop but are not connected.\n   * 3. Search the network.\n   *\n   * @param {string[]} [peersToIgnore]\n   * @returns {Promise<void>}\n   */\n  async _listenOnAvailableHopRelays (peersToIgnore = []) {\n    // TODO: The peer redial issue on disconnect should be handled by connection gating\n    // Check if already listening on enough relays\n    if (this._listenRelays.size >= this.maxListeners) {\n      return\n    }\n\n    const knownHopsToDial = []\n\n    // Check if we have known hop peers to use and attempt to listen on the already connected\n    for (const [id, metadataMap] of this._peerStore.metadataBook.data.entries()) {\n      // Continue to next if listening on this or peer to ignore\n      if (this._listenRelays.has(id) || peersToIgnore.includes(id)) {\n        continue\n      }\n\n      const supportsHop = metadataMap.get(HOP_METADATA_KEY)\n\n      // Continue to next if it does not support Hop\n      if (!supportsHop || uint8ArrayToString(supportsHop) !== HOP_METADATA_VALUE) {\n        continue\n      }\n\n      const peerId = PeerId.createFromCID(id)\n      const connection = this._connectionManager.get(peerId)\n\n      // If not connected, store for possible later use.\n      if (!connection) {\n        knownHopsToDial.push(peerId)\n        continue\n      }\n\n      await this._addListenRelay(connection, id)\n\n      // Check if already listening on enough relays\n      if (this._listenRelays.size >= this.maxListeners) {\n        return\n      }\n    }\n\n    // Try to listen on known peers that are not connected\n    for (const peerId of knownHopsToDial) {\n      await this._tryToListenOnRelay(peerId)\n\n      // Check if already listening on enough relays\n      if (this._listenRelays.size >= this.maxListeners) {\n        return\n      }\n    }\n\n    // Try to find relays to hop on the network\n    try {\n      const cid = await namespaceToCid(RELAY_RENDEZVOUS_NS)\n      for await (const provider of this._libp2p.contentRouting.findProviders(cid)) {\n        if (!provider.multiaddrs.length) {\n          continue\n        }\n\n        const peerId = provider.id\n        this._peerStore.addressBook.add(peerId, provider.multiaddrs)\n\n        await this._tryToListenOnRelay(peerId)\n\n        // Check if already listening on enough relays\n        if (this._listenRelays.size >= this.maxListeners) {\n          return\n        }\n      }\n    } catch (err) {\n      this._onError(err)\n    }\n  }\n\n  /**\n   * @param {PeerId} peerId\n   */\n  async _tryToListenOnRelay (peerId) {\n    try {\n      const connection = await this._libp2p.dial(peerId)\n      await this._addListenRelay(connection, peerId.toB58String())\n    } catch (err) {\n      this._onError(err, `could not connect and listen on known hop relay ${peerId.toB58String()}`)\n    }\n  }\n}\n\nmodule.exports = AutoRelay\n","'use strict'\n\nconst CID = require('cids')\nconst multihashing = require('multihashing-async')\n\n/**\n * Convert a namespace string into a cid.\n *\n * @param {string} namespace\n * @returns {Promise<CID>}\n */\nmodule.exports.namespaceToCid = async (namespace) => {\n  const bytes = new TextEncoder().encode(namespace)\n  const hash = await multihashing(bytes, 'sha2-256')\n\n  return new CID(hash)\n}\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:dialer'), {\n  error: debug('libp2p:dialer:err')\n})\nconst errCode = require('err-code')\nconst { Multiaddr } = require('multiaddr')\n// @ts-ignore timeout-abourt-controles does not export types\nconst TimeoutController = require('timeout-abort-controller')\nconst { AbortError } = require('abortable-iterator')\nconst { anySignal } = require('any-signal')\n\nconst DialRequest = require('./dial-request')\nconst { publicAddressesFirst } = require('libp2p-utils/src/address-sort')\nconst getPeer = require('../get-peer')\n\nconst { codes } = require('../errors')\nconst {\n  DIAL_TIMEOUT,\n  MAX_PARALLEL_DIALS,\n  MAX_PER_PEER_DIALS\n} = require('../constants')\n\n/**\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('../peer-store')} PeerStore\n * @typedef {import('../peer-store/address-book').Address} Address\n * @typedef {import('../transport-manager')} TransportManager\n */\n\n/**\n * @typedef {Object} DialerProperties\n * @property {PeerStore} peerStore\n * @property {TransportManager} transportManager\n *\n * @typedef {(addr:Multiaddr) => Promise<string[]>} Resolver\n *\n * @typedef {Object} DialerOptions\n * @property {(addresses: Address[]) => Address[]} [options.addressSorter = publicAddressesFirst] - Sort the known addresses of a peer before trying to dial.\n * @property {number} [maxParallelDials = MAX_PARALLEL_DIALS] - Number of max concurrent dials.\n * @property {number} [maxDialsPerPeer = MAX_PER_PEER_DIALS] - Number of max concurrent dials per peer.\n * @property {number} [dialTimeout = DIAL_TIMEOUT] - How long a dial attempt is allowed to take.\n * @property {Record<string, Resolver>} [resolvers = {}] - multiaddr resolvers to use when dialing\n *\n * @typedef DialTarget\n * @property {string} id\n * @property {Multiaddr[]} addrs\n *\n * @typedef PendingDial\n * @property {DialRequest} dialRequest\n * @property {TimeoutController} controller\n * @property {Promise<Connection>} promise\n * @property {function():void} destroy\n */\n\nclass Dialer {\n  /**\n   * @class\n   * @param {DialerProperties & DialerOptions} options\n   */\n  constructor ({\n    transportManager,\n    peerStore,\n    addressSorter = publicAddressesFirst,\n    maxParallelDials = MAX_PARALLEL_DIALS,\n    dialTimeout = DIAL_TIMEOUT,\n    maxDialsPerPeer = MAX_PER_PEER_DIALS,\n    resolvers = {}\n  }) {\n    this.transportManager = transportManager\n    this.peerStore = peerStore\n    this.addressSorter = addressSorter\n    this.maxParallelDials = maxParallelDials\n    this.timeout = dialTimeout\n    this.maxDialsPerPeer = maxDialsPerPeer\n    this.tokens = [...new Array(maxParallelDials)].map((_, index) => index)\n    this._pendingDials = new Map()\n    this._pendingDialTargets = new Map()\n\n    for (const [key, value] of Object.entries(resolvers)) {\n      Multiaddr.resolvers.set(key, value)\n    }\n  }\n\n  /**\n   * Clears any pending dials\n   */\n  destroy () {\n    for (const dial of this._pendingDials.values()) {\n      try {\n        dial.controller.abort()\n      } catch (err) {\n        log.error(err)\n      }\n    }\n    this._pendingDials.clear()\n\n    for (const pendingTarget of this._pendingDialTargets.values()) {\n      pendingTarget.reject(new AbortError('Dialer was destroyed'))\n    }\n    this._pendingDialTargets.clear()\n  }\n\n  /**\n   * Connects to a given `peer` by dialing all of its known addresses.\n   * The dial to the first address that is successfully able to upgrade a connection\n   * will be used.\n   *\n   * @param {PeerId|Multiaddr|string} peer - The peer to dial\n   * @param {object} [options]\n   * @param {AbortSignal} [options.signal] - An AbortController signal\n   * @returns {Promise<Connection>}\n   */\n  async connectToPeer (peer, options = {}) {\n    const dialTarget = await this._createCancellableDialTarget(peer)\n\n    if (!dialTarget.addrs.length) {\n      throw errCode(new Error('The dial request has no valid addresses'), codes.ERR_NO_VALID_ADDRESSES)\n    }\n    const pendingDial = this._pendingDials.get(dialTarget.id) || this._createPendingDial(dialTarget, options)\n\n    try {\n      const connection = await pendingDial.promise\n      log('dial succeeded to %s', dialTarget.id)\n      return connection\n    } catch (err) {\n      // Error is a timeout\n      if (pendingDial.controller.signal.aborted) {\n        err.code = codes.ERR_TIMEOUT\n      }\n      log.error(err)\n      throw err\n    } finally {\n      pendingDial.destroy()\n    }\n  }\n\n  /**\n   * Connects to a given `peer` by dialing all of its known addresses.\n   * The dial to the first address that is successfully able to upgrade a connection\n   * will be used.\n   *\n   * @param {PeerId|Multiaddr|string} peer - The peer to dial\n   * @returns {Promise<DialTarget>}\n   */\n  async _createCancellableDialTarget (peer) {\n    // Make dial target promise cancellable\n    const id = `${(parseInt(String(Math.random() * 1e9), 10)).toString() + Date.now()}`\n    const cancellablePromise = new Promise((resolve, reject) => {\n      this._pendingDialTargets.set(id, { resolve, reject })\n    })\n\n    const dialTarget = await Promise.race([\n      this._createDialTarget(peer),\n      cancellablePromise\n    ])\n\n    this._pendingDialTargets.delete(id)\n\n    return dialTarget\n  }\n\n  /**\n   * Creates a DialTarget. The DialTarget is used to create and track\n   * the DialRequest to a given peer.\n   * If a multiaddr is received it should be the first address attempted.\n   * Multiaddrs not supported by the available transports will be filtered out.\n   *\n   * @private\n   * @param {PeerId|Multiaddr|string} peer - A PeerId or Multiaddr\n   * @returns {Promise<DialTarget>}\n   */\n  async _createDialTarget (peer) {\n    const { id, multiaddrs } = getPeer(peer)\n\n    if (multiaddrs) {\n      this.peerStore.addressBook.add(id, multiaddrs)\n    }\n\n    let knownAddrs = this.peerStore.addressBook.getMultiaddrsForPeer(id, this.addressSorter) || []\n\n    // If received a multiaddr to dial, it should be the first to use\n    // But, if we know other multiaddrs for the peer, we should try them too.\n    if (Multiaddr.isMultiaddr(peer)) {\n      knownAddrs = knownAddrs.filter((addr) => !peer.equals(addr))\n      knownAddrs.unshift(peer)\n    }\n\n    /** @type {Multiaddr[]} */\n    const addrs = []\n    for (const a of knownAddrs) {\n      const resolvedAddrs = await this._resolve(a)\n      resolvedAddrs.forEach(ra => addrs.push(ra))\n    }\n\n    // Multiaddrs not supported by the available transports will be filtered out.\n    const supportedAddrs = addrs.filter(a => this.transportManager.transportForMultiaddr(a))\n\n    return {\n      id: id.toB58String(),\n      addrs: supportedAddrs\n    }\n  }\n\n  /**\n   * Creates a PendingDial that wraps the underlying DialRequest\n   *\n   * @private\n   * @param {DialTarget} dialTarget\n   * @param {object} [options]\n   * @param {AbortSignal} [options.signal] - An AbortController signal\n   * @returns {PendingDial}\n   */\n  _createPendingDial (dialTarget, options = {}) {\n    /**\n     * @param {Multiaddr} addr\n     * @param {{ signal: { aborted: any; }; }} options\n     */\n    const dialAction = (addr, options) => {\n      if (options.signal.aborted) throw errCode(new Error('already aborted'), codes.ERR_ALREADY_ABORTED)\n      return this.transportManager.dial(addr, options)\n    }\n\n    const dialRequest = new DialRequest({\n      addrs: dialTarget.addrs,\n      dialAction,\n      dialer: this\n    })\n\n    // Combine the timeout signal and options.signal, if provided\n    const timeoutController = new TimeoutController(this.timeout)\n    const signals = [timeoutController.signal]\n    options.signal && signals.push(options.signal)\n    const signal = anySignal(signals)\n\n    const pendingDial = {\n      dialRequest,\n      controller: timeoutController,\n      promise: dialRequest.run({ ...options, signal }),\n      destroy: () => {\n        timeoutController.clear()\n        this._pendingDials.delete(dialTarget.id)\n      }\n    }\n    this._pendingDials.set(dialTarget.id, pendingDial)\n    return pendingDial\n  }\n\n  /**\n   * @param {number} num\n   */\n  getTokens (num) {\n    const total = Math.min(num, this.maxDialsPerPeer, this.tokens.length)\n    const tokens = this.tokens.splice(0, total)\n    log('%d tokens request, returning %d, %d remaining', num, total, this.tokens.length)\n    return tokens\n  }\n\n  /**\n   * @param {number} token\n   */\n  releaseToken (token) {\n    // Guard against duplicate releases\n    if (this.tokens.indexOf(token) > -1) return\n    log('token %d released', token)\n    this.tokens.push(token)\n  }\n\n  /**\n   * Resolve multiaddr recursively.\n   *\n   * @param {Multiaddr} ma\n   * @returns {Promise<Multiaddr[]>}\n   */\n  async _resolve (ma) {\n    // TODO: recursive logic should live in multiaddr once dns4/dns6 support is in place\n    // Now only supporting resolve for dnsaddr\n    const resolvableProto = ma.protoNames().includes('dnsaddr')\n\n    // Multiaddr is not resolvable? End recursion!\n    if (!resolvableProto) {\n      return [ma]\n    }\n\n    const resolvedMultiaddrs = await this._resolveRecord(ma)\n    const recursiveMultiaddrs = await Promise.all(resolvedMultiaddrs.map((nm) => {\n      return this._resolve(nm)\n    }))\n\n    const addrs = recursiveMultiaddrs.flat()\n    return addrs.reduce((array, newM) => {\n      if (!array.find(m => m.equals(newM))) {\n        array.push(newM)\n      }\n      return array\n    }, /** @type  {Multiaddr[]} */([]))\n  }\n\n  /**\n   * Resolve a given multiaddr. If this fails, an empty array will be returned\n   *\n   * @param {Multiaddr} ma\n   * @returns {Promise<Multiaddr[]>}\n   */\n  async _resolveRecord (ma) {\n    try {\n      ma = new Multiaddr(ma.toString()) // Use current multiaddr module\n      const multiaddrs = await ma.resolve()\n      return multiaddrs\n    } catch (_) {\n      log.error(`multiaddr ${ma} could not be resolved`)\n      return []\n    }\n  }\n}\n\nmodule.exports = Dialer\n","'use strict'\n\nconst errCode = require('err-code')\nconst AbortController = require('abort-controller').default\nconst { anySignal } = require('any-signal')\n// @ts-ignore p-fifo does not export types\nconst FIFO = require('p-fifo')\nconst pAny = require('p-any')\n\n/**\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('./')} Dialer\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n */\n\n/**\n * @typedef {Object} DialOptions\n * @property {AbortSignal} signal\n *\n * @typedef {Object} DialRequestOptions\n * @property {Multiaddr[]} addrs\n * @property {(m: Multiaddr, options: DialOptions) => Promise<Connection>} dialAction\n * @property {Dialer} dialer\n */\n\nclass DialRequest {\n  /**\n   * Manages running the `dialAction` on multiple provided `addrs` in parallel\n   * up to a maximum determined by the number of tokens returned\n   * from `dialer.getTokens`. Once a DialRequest is created, it can be\n   * started using `DialRequest.run(options)`. Once a single dial has succeeded,\n   * all other dials in the request will be cancelled.\n   *\n   * @class\n   * @param {DialRequestOptions} options\n   */\n  constructor ({\n    addrs,\n    dialAction,\n    dialer\n  }) {\n    this.addrs = addrs\n    this.dialer = dialer\n    this.dialAction = dialAction\n  }\n\n  /**\n   * @async\n   * @param {object} [options]\n   * @param {AbortSignal} [options.signal] - An AbortController signal\n   * @returns {Promise<Connection>}\n   */\n  async run (options = {}) {\n    const tokens = this.dialer.getTokens(this.addrs.length)\n    // If no tokens are available, throw\n    if (tokens.length < 1) {\n      throw errCode(new Error('No dial tokens available'), 'ERR_NO_DIAL_TOKENS')\n    }\n\n    const tokenHolder = new FIFO()\n    tokens.forEach(token => tokenHolder.push(token))\n    const dialAbortControllers = this.addrs.map(() => new AbortController())\n    let completedDials = 0\n\n    try {\n      return await pAny(this.addrs.map(async (addr, i) => {\n        const token = await tokenHolder.shift() // get token\n        let conn\n        try {\n          const signal = dialAbortControllers[i].signal\n          conn = await this.dialAction(addr, { ...options, signal: options.signal ? anySignal([signal, options.signal]) : signal })\n          // Remove the successful AbortController so it is not aborted\n          dialAbortControllers.splice(i, 1)\n        } finally {\n          completedDials++\n          // If we have more or equal dials remaining than tokens, recycle the token, otherwise release it\n          if (this.addrs.length - completedDials >= tokens.length) {\n            tokenHolder.push(token)\n          } else {\n            this.dialer.releaseToken(tokens.splice(tokens.indexOf(token), 1)[0])\n          }\n        }\n\n        return conn\n      }))\n    } finally {\n      dialAbortControllers.map(c => c.abort()) // success/failure happened, abort everything else\n      tokens.forEach(token => this.dialer.releaseToken(token)) // release tokens back to the dialer\n    }\n  }\n}\n\nmodule.exports = DialRequest\n","const Fifo = require('fast-fifo')\nconst defer = require('p-defer')\n\nmodule.exports = class PFifo {\n  constructor () {\n    this._buffer = new Fifo()\n    this._waitingConsumers = new Fifo()\n  }\n\n  push (chunk) {\n    const { promise, resolve } = defer()\n    this._buffer.push({ chunk, resolve })\n    this._consume()\n    return promise\n  }\n\n  _consume () {\n    while (!this._waitingConsumers.isEmpty() && !this._buffer.isEmpty()) {\n      const nextConsumer = this._waitingConsumers.shift()\n      const nextChunk = this._buffer.shift()\n      nextConsumer.resolve(nextChunk.chunk)\n      nextChunk.resolve()\n    }\n  }\n\n  shift () {\n    const { promise, resolve } = defer()\n    this._waitingConsumers.push({ resolve })\n    this._consume()\n    return promise\n  }\n\n  isEmpty () {\n    return this._buffer.isEmpty()\n  }\n}\n","'use strict';\nconst pSome = require('p-some');\nconst PCancelable = require('p-cancelable');\n\nmodule.exports = (iterable, options) => {\n\tconst anyCancelable = pSome(iterable, {...options, count: 1});\n\n\treturn PCancelable.fn(async onCancel => {\n\t\tonCancel(() => {\n\t\t\tanyCancelable.cancel();\n\t\t});\n\n\t\tconst [value] = await anyCancelable;\n\t\treturn value;\n\t})();\n};\n\nmodule.exports.AggregateError = pSome.AggregateError;\n","'use strict';\nconst AggregateError = require('aggregate-error');\nconst PCancelable = require('p-cancelable');\n\nclass FilterError extends Error { }\n\nconst pSome = (iterable, options) => new PCancelable((resolve, reject, onCancel) => {\n\tconst {\n\t\tcount,\n\t\tfilter = () => true\n\t} = options;\n\n\tif (!Number.isFinite(count)) {\n\t\treject(new TypeError(`Expected a finite number, got ${typeof options.count}`));\n\t\treturn;\n\t}\n\n\tconst values = [];\n\tconst errors = [];\n\tlet elementCount = 0;\n\tlet isSettled = false;\n\n\tconst completed = new Set();\n\tconst maybeSettle = () => {\n\t\tif (values.length === count) {\n\t\t\tresolve(values);\n\t\t\tisSettled = true;\n\t\t}\n\n\t\tif (elementCount - errors.length < count) {\n\t\t\treject(new AggregateError(errors));\n\t\t\tisSettled = true;\n\t\t}\n\n\t\treturn isSettled;\n\t};\n\n\tconst cancelPending = () => {\n\t\tfor (const promise of iterable) {\n\t\t\tif (!completed.has(promise) && typeof promise.cancel === 'function') {\n\t\t\t\tpromise.cancel();\n\t\t\t}\n\t\t}\n\t};\n\n\tonCancel(cancelPending);\n\n\tfor (const element of iterable) {\n\t\telementCount++;\n\n\t\t(async () => {\n\t\t\ttry {\n\t\t\t\tconst value = await element;\n\n\t\t\t\tif (isSettled) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tif (!filter(value)) {\n\t\t\t\t\tthrow new FilterError('Value does not satisfy filter');\n\t\t\t\t}\n\n\t\t\t\tvalues.push(value);\n\t\t\t} catch (error) {\n\t\t\t\terrors.push(error);\n\t\t\t} finally {\n\t\t\t\tcompleted.add(element);\n\n\t\t\t\tif (!isSettled && maybeSettle()) {\n\t\t\t\t\tcancelPending();\n\t\t\t\t}\n\t\t\t}\n\t\t})();\n\t}\n\n\tif (count > elementCount) {\n\t\treject(new RangeError(`Expected input to contain at least ${options.count} items, but contains ${elementCount} items`));\n\t\tcancelPending();\n\t}\n});\n\nmodule.exports = pSome;\nmodule.exports.AggregateError = AggregateError;\nmodule.exports.FilterError = FilterError;\n","'use strict';\nconst indentString = require('indent-string');\nconst cleanStack = require('clean-stack');\n\nconst cleanInternalStack = stack => stack.replace(/\\s+at .*aggregate-error\\/index.js:\\d+:\\d+\\)?/g, '');\n\nclass AggregateError extends Error {\n\tconstructor(errors) {\n\t\tif (!Array.isArray(errors)) {\n\t\t\tthrow new TypeError(`Expected input to be an Array, got ${typeof errors}`);\n\t\t}\n\n\t\terrors = [...errors].map(error => {\n\t\t\tif (error instanceof Error) {\n\t\t\t\treturn error;\n\t\t\t}\n\n\t\t\tif (error !== null && typeof error === 'object') {\n\t\t\t\t// Handle plain error objects with message property and/or possibly other metadata\n\t\t\t\treturn Object.assign(new Error(error.message), error);\n\t\t\t}\n\n\t\t\treturn new Error(error);\n\t\t});\n\n\t\tlet message = errors\n\t\t\t.map(error => {\n\t\t\t\t// The `stack` property is not standardized, so we can't assume it exists\n\t\t\t\treturn typeof error.stack === 'string' ? cleanInternalStack(cleanStack(error.stack)) : String(error);\n\t\t\t})\n\t\t\t.join('\\n');\n\t\tmessage = '\\n' + indentString(message, 4);\n\t\tsuper(message);\n\n\t\tthis.name = 'AggregateError';\n\n\t\tObject.defineProperty(this, '_errors', {value: errors});\n\t}\n\n\t* [Symbol.iterator]() {\n\t\tfor (const error of this._errors) {\n\t\t\tyield error;\n\t\t}\n\t}\n}\n\nmodule.exports = AggregateError;\n","'use strict';\n\nmodule.exports = (string, count = 1, options) => {\n\toptions = {\n\t\tindent: ' ',\n\t\tincludeEmptyLines: false,\n\t\t...options\n\t};\n\n\tif (typeof string !== 'string') {\n\t\tthrow new TypeError(\n\t\t\t`Expected \\`input\\` to be a \\`string\\`, got \\`${typeof string}\\``\n\t\t);\n\t}\n\n\tif (typeof count !== 'number') {\n\t\tthrow new TypeError(\n\t\t\t`Expected \\`count\\` to be a \\`number\\`, got \\`${typeof count}\\``\n\t\t);\n\t}\n\n\tif (typeof options.indent !== 'string') {\n\t\tthrow new TypeError(\n\t\t\t`Expected \\`options.indent\\` to be a \\`string\\`, got \\`${typeof options.indent}\\``\n\t\t);\n\t}\n\n\tif (count === 0) {\n\t\treturn string;\n\t}\n\n\tconst regex = options.includeEmptyLines ? /^/gm : /^(?!\\s*$)/gm;\n\n\treturn string.replace(regex, options.indent.repeat(count));\n};\n","'use strict';\nconst os = require('os');\n\nconst extractPathRegex = /\\s+at.*(?:\\(|\\s)(.*)\\)?/;\nconst pathRegex = /^(?:(?:(?:node|(?:internal\\/[\\w/]*|.*node_modules\\/(?:babel-polyfill|pirates)\\/.*)?\\w+)\\.js:\\d+:\\d+)|native)/;\nconst homeDir = typeof os.homedir === 'undefined' ? '' : os.homedir();\n\nmodule.exports = (stack, options) => {\n\toptions = Object.assign({pretty: false}, options);\n\n\treturn stack.replace(/\\\\/g, '/')\n\t\t.split('\\n')\n\t\t.filter(line => {\n\t\t\tconst pathMatches = line.match(extractPathRegex);\n\t\t\tif (pathMatches === null || !pathMatches[1]) {\n\t\t\t\treturn true;\n\t\t\t}\n\n\t\t\tconst match = pathMatches[1];\n\n\t\t\t// Electron\n\t\t\tif (\n\t\t\t\tmatch.includes('.app/Contents/Resources/electron.asar') ||\n\t\t\t\tmatch.includes('.app/Contents/Resources/default_app.asar')\n\t\t\t) {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\treturn !pathRegex.test(match);\n\t\t})\n\t\t.filter(line => line.trim() !== '')\n\t\t.map(line => {\n\t\t\tif (options.pretty) {\n\t\t\t\treturn line.replace(extractPathRegex, (m, p1) => m.replace(p1, p1.replace(homeDir, '~')));\n\t\t\t}\n\n\t\t\treturn line;\n\t\t})\n\t\t.join('\\n');\n};\n","'use strict';\n\nclass CancelError extends Error {\n\tconstructor(reason) {\n\t\tsuper(reason || 'Promise was canceled');\n\t\tthis.name = 'CancelError';\n\t}\n\n\tget isCanceled() {\n\t\treturn true;\n\t}\n}\n\nclass PCancelable {\n\tstatic fn(userFn) {\n\t\treturn (...arguments_) => {\n\t\t\treturn new PCancelable((resolve, reject, onCancel) => {\n\t\t\t\targuments_.push(onCancel);\n\t\t\t\t// eslint-disable-next-line promise/prefer-await-to-then\n\t\t\t\tuserFn(...arguments_).then(resolve, reject);\n\t\t\t});\n\t\t};\n\t}\n\n\tconstructor(executor) {\n\t\tthis._cancelHandlers = [];\n\t\tthis._isPending = true;\n\t\tthis._isCanceled = false;\n\t\tthis._rejectOnCancel = true;\n\n\t\tthis._promise = new Promise((resolve, reject) => {\n\t\t\tthis._reject = reject;\n\n\t\t\tconst onResolve = value => {\n\t\t\t\tif (!this._isCanceled || !onCancel.shouldReject) {\n\t\t\t\t\tthis._isPending = false;\n\t\t\t\t\tresolve(value);\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tconst onReject = error => {\n\t\t\t\tthis._isPending = false;\n\t\t\t\treject(error);\n\t\t\t};\n\n\t\t\tconst onCancel = handler => {\n\t\t\t\tif (!this._isPending) {\n\t\t\t\t\tthrow new Error('The `onCancel` handler was attached after the promise settled.');\n\t\t\t\t}\n\n\t\t\t\tthis._cancelHandlers.push(handler);\n\t\t\t};\n\n\t\t\tObject.defineProperties(onCancel, {\n\t\t\t\tshouldReject: {\n\t\t\t\t\tget: () => this._rejectOnCancel,\n\t\t\t\t\tset: boolean => {\n\t\t\t\t\t\tthis._rejectOnCancel = boolean;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\n\t\t\treturn executor(onResolve, onReject, onCancel);\n\t\t});\n\t}\n\n\tthen(onFulfilled, onRejected) {\n\t\t// eslint-disable-next-line promise/prefer-await-to-then\n\t\treturn this._promise.then(onFulfilled, onRejected);\n\t}\n\n\tcatch(onRejected) {\n\t\treturn this._promise.catch(onRejected);\n\t}\n\n\tfinally(onFinally) {\n\t\treturn this._promise.finally(onFinally);\n\t}\n\n\tcancel(reason) {\n\t\tif (!this._isPending || this._isCanceled) {\n\t\t\treturn;\n\t\t}\n\n\t\tthis._isCanceled = true;\n\n\t\tif (this._cancelHandlers.length > 0) {\n\t\t\ttry {\n\t\t\t\tfor (const handler of this._cancelHandlers) {\n\t\t\t\t\thandler();\n\t\t\t\t}\n\t\t\t} catch (error) {\n\t\t\t\tthis._reject(error);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\n\t\tif (this._rejectOnCancel) {\n\t\t\tthis._reject(new CancelError(reason));\n\t\t}\n\t}\n\n\tget isCanceled() {\n\t\treturn this._isCanceled;\n\t}\n}\n\nObject.setPrototypeOf(PCancelable.prototype, Promise.prototype);\n\nmodule.exports = PCancelable;\nmodule.exports.CancelError = CancelError;\n","/* eslint max-nested-callbacks: [\"error\", 5] */\n'use strict'\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:keychain'), {\n  error: debug('libp2p:keychain:err')\n})\nconst sanitize = require('sanitize-filename')\nconst mergeOptions = require('merge-options')\nconst crypto = require('libp2p-crypto')\nconst { Key } = require('interface-datastore')\nconst CMS = require('./cms')\nconst errcode = require('err-code')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\n// @ts-ignore node-forge sha512 types not exported\nrequire('node-forge/lib/sha512')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('interface-datastore').Datastore} Datastore\n */\n\n/**\n * @typedef {Object} DekOptions\n * @property {string} hash\n * @property {string} salt\n * @property {number} iterationCount\n * @property {number} keyLength\n *\n * @typedef {Object} KeychainOptions\n * @property {string} [pass]\n * @property {DekOptions} [dek]\n */\n\n/**\n * Information about a key.\n *\n * @typedef {Object} KeyInfo\n * @property {string} id - The universally unique key id.\n * @property {string} name - The local key name.\n */\n\nconst keyPrefix = '/pkcs8/'\nconst infoPrefix = '/info/'\nconst privates = new WeakMap()\n\n// NIST SP 800-132\nconst NIST = {\n  minKeyLength: 112 / 8,\n  minSaltLength: 128 / 8,\n  minIterationCount: 1000\n}\n\nconst defaultOptions = {\n  // See https://cryptosense.com/parametesr-choice-for-pbkdf2/\n  dek: {\n    keyLength: 512 / 8,\n    iterationCount: 10000,\n    salt: 'you should override this value with a crypto secure random number',\n    hash: 'sha2-512'\n  }\n}\n\n/**\n * @param {string} name\n */\nfunction validateKeyName (name) {\n  if (!name) return false\n  if (typeof name !== 'string') return false\n  return name === sanitize(name.trim())\n}\n\n/**\n * Throws an error after a delay\n *\n * This assumes than an error indicates that the keychain is under attack. Delay returning an\n * error to make brute force attacks harder.\n *\n * @param {string|Error} err - The error\n * @returns {Promise<never>}\n * @private\n */\nasync function throwDelayed (err) {\n  const min = 200\n  const max = 1000\n  const delay = Math.random() * (max - min) + min\n\n  await new Promise(resolve => setTimeout(resolve, delay))\n  throw err\n}\n\n/**\n * Converts a key name into a datastore name.\n *\n * @param {string} name\n * @returns {Key}\n * @private\n */\nfunction DsName (name) {\n  return new Key(keyPrefix + name)\n}\n\n/**\n * Converts a key name into a datastore info name.\n *\n * @param {string} name\n * @returns {Key}\n * @private\n */\nfunction DsInfoName (name) {\n  return new Key(infoPrefix + name)\n}\n\n/**\n * Manages the lifecycle of a key. Keys are encrypted at rest using PKCS #8.\n *\n * A key in the store has two entries\n * - '/info/*key-name*', contains the KeyInfo for the key\n * - '/pkcs8/*key-name*', contains the PKCS #8 for the key\n *\n */\nclass Keychain {\n  /**\n   * Creates a new instance of a key chain.\n   *\n   * @param {Datastore} store - where the key are.\n   * @param {KeychainOptions} options\n   * @class\n   */\n  constructor (store, options) {\n    if (!store) {\n      throw new Error('store is required')\n    }\n    this.store = store\n\n    this.opts = mergeOptions(defaultOptions, options)\n\n    // Enforce NIST SP 800-132\n    if (this.opts.pass && this.opts.pass.length < 20) {\n      throw new Error('pass must be least 20 characters')\n    }\n    if (this.opts.dek.keyLength < NIST.minKeyLength) {\n      throw new Error(`dek.keyLength must be least ${NIST.minKeyLength} bytes`)\n    }\n    if (this.opts.dek.salt.length < NIST.minSaltLength) {\n      throw new Error(`dek.saltLength must be least ${NIST.minSaltLength} bytes`)\n    }\n    if (this.opts.dek.iterationCount < NIST.minIterationCount) {\n      throw new Error(`dek.iterationCount must be least ${NIST.minIterationCount}`)\n    }\n\n    const dek = this.opts.pass\n      ? crypto.pbkdf2(\n        this.opts.pass,\n        this.opts.dek.salt,\n        this.opts.dek.iterationCount,\n        this.opts.dek.keyLength,\n        this.opts.dek.hash)\n      : ''\n\n    privates.set(this, { dek })\n  }\n\n  /**\n   * Gets an object that can encrypt/decrypt protected data\n   * using the Cryptographic Message Syntax (CMS).\n   *\n   * CMS describes an encapsulation syntax for data protection. It\n   * is used to digitally sign, digest, authenticate, or encrypt\n   * arbitrary message content.\n   *\n   * @returns {CMS}\n   */\n  get cms () {\n    return new CMS(this, privates.get(this).dek)\n  }\n\n  /**\n   * Generates the options for a keychain.  A random salt is produced.\n   *\n   * @returns {Object}\n   */\n  static generateOptions () {\n    const options = Object.assign({}, defaultOptions)\n    const saltLength = Math.ceil(NIST.minSaltLength / 3) * 3 // no base64 padding\n    options.dek.salt = uint8ArrayToString(crypto.randomBytes(saltLength), 'base64')\n    return options\n  }\n\n  /**\n   * Gets an object that can encrypt/decrypt protected data.\n   * The default options for a keychain.\n   *\n   * @returns {Object}\n   */\n  static get options () {\n    return defaultOptions\n  }\n\n  /**\n   * Create a new key.\n   *\n   * @param {string} name - The local key name; cannot already exist.\n   * @param {string} type - One of the key types; 'rsa'.\n   * @param {number} [size = 2048] - The key size in bits. Used for rsa keys only.\n   * @returns {Promise<KeyInfo>}\n   */\n  async createKey (name, type, size = 2048) {\n    const self = this\n\n    if (!validateKeyName(name) || name === 'self') {\n      return throwDelayed(errcode(new Error(`Invalid key name '${name}'`), 'ERR_INVALID_KEY_NAME'))\n    }\n\n    if (typeof type !== 'string') {\n      return throwDelayed(errcode(new Error(`Invalid key type '${type}'`), 'ERR_INVALID_KEY_TYPE'))\n    }\n\n    const dsname = DsName(name)\n    const exists = await self.store.has(dsname)\n    if (exists) return throwDelayed(errcode(new Error(`Key '${name}' already exists`), 'ERR_KEY_ALREADY_EXISTS'))\n\n    switch (type.toLowerCase()) {\n      case 'rsa':\n        if (!Number.isSafeInteger(size) || size < 2048) {\n          return throwDelayed(errcode(new Error(`Invalid RSA key size ${size}`), 'ERR_INVALID_KEY_SIZE'))\n        }\n        break\n      default:\n        break\n    }\n\n    let keyInfo\n    try {\n      // @ts-ignore Differences between several crypto return types need to be fixed in libp2p-crypto\n      const keypair = await crypto.keys.generateKeyPair(type, size)\n      const kid = await keypair.id()\n      /** @type {string} */\n      const dek = privates.get(this).dek\n      const pem = await keypair.export(dek)\n      keyInfo = {\n        name: name,\n        id: kid\n      }\n      const batch = self.store.batch()\n      batch.put(dsname, uint8ArrayFromString(pem))\n      batch.put(DsInfoName(name), uint8ArrayFromString(JSON.stringify(keyInfo)))\n\n      await batch.commit()\n    } catch (err) {\n      return throwDelayed(err)\n    }\n\n    return keyInfo\n  }\n\n  /**\n   * List all the keys.\n   *\n   * @returns {Promise<KeyInfo[]>}\n   */\n  async listKeys () {\n    const self = this\n    const query = {\n      prefix: infoPrefix\n    }\n\n    const info = []\n    for await (const value of self.store.query(query)) {\n      info.push(JSON.parse(uint8ArrayToString(value.value)))\n    }\n\n    return info\n  }\n\n  /**\n   * Find a key by it's id.\n   *\n   * @param {string} id - The universally unique key identifier.\n   * @returns {Promise<KeyInfo|undefined>}\n   */\n  async findKeyById (id) {\n    try {\n      const keys = await this.listKeys()\n      return keys.find((k) => k.id === id)\n    } catch (err) {\n      return throwDelayed(err)\n    }\n  }\n\n  /**\n   * Find a key by it's name.\n   *\n   * @param {string} name - The local key name.\n   * @returns {Promise<KeyInfo>}\n   */\n  async findKeyByName (name) {\n    if (!validateKeyName(name)) {\n      return throwDelayed(errcode(new Error(`Invalid key name '${name}'`), 'ERR_INVALID_KEY_NAME'))\n    }\n\n    const dsname = DsInfoName(name)\n    try {\n      const res = await this.store.get(dsname)\n      return JSON.parse(uint8ArrayToString(res))\n    } catch (err) {\n      return throwDelayed(errcode(new Error(`Key '${name}' does not exist. ${err.message}`), 'ERR_KEY_NOT_FOUND'))\n    }\n  }\n\n  /**\n   * Remove an existing key.\n   *\n   * @param {string} name - The local key name; must already exist.\n   * @returns {Promise<KeyInfo>}\n   */\n  async removeKey (name) {\n    const self = this\n    if (!validateKeyName(name) || name === 'self') {\n      return throwDelayed(errcode(new Error(`Invalid key name '${name}'`), 'ERR_INVALID_KEY_NAME'))\n    }\n    const dsname = DsName(name)\n    const keyInfo = await self.findKeyByName(name)\n    const batch = self.store.batch()\n    batch.delete(dsname)\n    batch.delete(DsInfoName(name))\n    await batch.commit()\n    return keyInfo\n  }\n\n  /**\n   * Rename a key\n   *\n   * @param {string} oldName - The old local key name; must already exist.\n   * @param {string} newName - The new local key name; must not already exist.\n   * @returns {Promise<KeyInfo>}\n   */\n  async renameKey (oldName, newName) {\n    const self = this\n    if (!validateKeyName(oldName) || oldName === 'self') {\n      return throwDelayed(errcode(new Error(`Invalid old key name '${oldName}'`), 'ERR_OLD_KEY_NAME_INVALID'))\n    }\n    if (!validateKeyName(newName) || newName === 'self') {\n      return throwDelayed(errcode(new Error(`Invalid new key name '${newName}'`), 'ERR_NEW_KEY_NAME_INVALID'))\n    }\n    const oldDsname = DsName(oldName)\n    const newDsname = DsName(newName)\n    const oldInfoName = DsInfoName(oldName)\n    const newInfoName = DsInfoName(newName)\n\n    const exists = await self.store.has(newDsname)\n    if (exists) return throwDelayed(errcode(new Error(`Key '${newName}' already exists`), 'ERR_KEY_ALREADY_EXISTS'))\n\n    try {\n      const pem = await self.store.get(oldDsname)\n      const res = await self.store.get(oldInfoName)\n\n      const keyInfo = JSON.parse(uint8ArrayToString(res))\n      keyInfo.name = newName\n      const batch = self.store.batch()\n      batch.put(newDsname, pem)\n      batch.put(newInfoName, uint8ArrayFromString(JSON.stringify(keyInfo)))\n      batch.delete(oldDsname)\n      batch.delete(oldInfoName)\n      await batch.commit()\n      return keyInfo\n    } catch (err) {\n      return throwDelayed(err)\n    }\n  }\n\n  /**\n   * Export an existing key as a PEM encrypted PKCS #8 string\n   *\n   * @param {string} name - The local key name; must already exist.\n   * @param {string} password - The password\n   * @returns {Promise<string>}\n   */\n  async exportKey (name, password) {\n    if (!validateKeyName(name)) {\n      return throwDelayed(errcode(new Error(`Invalid key name '${name}'`), 'ERR_INVALID_KEY_NAME'))\n    }\n    if (!password) {\n      return throwDelayed(errcode(new Error('Password is required'), 'ERR_PASSWORD_REQUIRED'))\n    }\n\n    const dsname = DsName(name)\n    try {\n      const res = await this.store.get(dsname)\n      const pem = uint8ArrayToString(res)\n      /** @type {string} */\n      const dek = privates.get(this).dek\n      const privateKey = await crypto.keys.import(pem, dek)\n      return privateKey.export(password)\n    } catch (err) {\n      return throwDelayed(err)\n    }\n  }\n\n  /**\n   * Import a new key from a PEM encoded PKCS #8 string\n   *\n   * @param {string} name - The local key name; must not already exist.\n   * @param {string} pem - The PEM encoded PKCS #8 string\n   * @param {string} password - The password.\n   * @returns {Promise<KeyInfo>}\n   */\n  async importKey (name, pem, password) {\n    const self = this\n    if (!validateKeyName(name) || name === 'self') {\n      return throwDelayed(errcode(new Error(`Invalid key name '${name}'`), 'ERR_INVALID_KEY_NAME'))\n    }\n    if (!pem) {\n      return throwDelayed(errcode(new Error('PEM encoded key is required'), 'ERR_PEM_REQUIRED'))\n    }\n    const dsname = DsName(name)\n    const exists = await self.store.has(dsname)\n    if (exists) return throwDelayed(errcode(new Error(`Key '${name}' already exists`), 'ERR_KEY_ALREADY_EXISTS'))\n\n    let privateKey\n    try {\n      privateKey = await crypto.keys.import(pem, password)\n    } catch (err) {\n      return throwDelayed(errcode(new Error('Cannot read the key, most likely the password is wrong'), 'ERR_CANNOT_READ_KEY'))\n    }\n\n    let kid\n    try {\n      kid = await privateKey.id()\n      /** @type {string} */\n      const dek = privates.get(this).dek\n      pem = await privateKey.export(dek)\n    } catch (err) {\n      return throwDelayed(err)\n    }\n\n    const keyInfo = {\n      name: name,\n      id: kid\n    }\n    const batch = self.store.batch()\n    batch.put(dsname, uint8ArrayFromString(pem))\n    batch.put(DsInfoName(name), uint8ArrayFromString(JSON.stringify(keyInfo)))\n    await batch.commit()\n\n    return keyInfo\n  }\n\n  /**\n   * Import a peer key\n   *\n   * @param {string} name - The local key name; must not already exist.\n   * @param {PeerId} peer - The PEM encoded PKCS #8 string\n   * @returns {Promise<KeyInfo>}\n   */\n  async importPeer (name, peer) {\n    const self = this\n    if (!validateKeyName(name)) {\n      return throwDelayed(errcode(new Error(`Invalid key name '${name}'`), 'ERR_INVALID_KEY_NAME'))\n    }\n    if (!peer || !peer.privKey) {\n      return throwDelayed(errcode(new Error('Peer.privKey is required'), 'ERR_MISSING_PRIVATE_KEY'))\n    }\n\n    const privateKey = peer.privKey\n    const dsname = DsName(name)\n    const exists = await self.store.has(dsname)\n    if (exists) return throwDelayed(errcode(new Error(`Key '${name}' already exists`), 'ERR_KEY_ALREADY_EXISTS'))\n\n    try {\n      const kid = await privateKey.id()\n      /** @type {string} */\n      const dek = privates.get(this).dek\n      const pem = await privateKey.export(dek)\n      const keyInfo = {\n        name: name,\n        id: kid\n      }\n      const batch = self.store.batch()\n      batch.put(dsname, uint8ArrayFromString(pem))\n      batch.put(DsInfoName(name), uint8ArrayFromString(JSON.stringify(keyInfo)))\n      await batch.commit()\n      return keyInfo\n    } catch (err) {\n      return throwDelayed(err)\n    }\n  }\n\n  /**\n   * Gets the private key as PEM encoded PKCS #8 string.\n   *\n   * @param {string} name\n   * @returns {Promise<string>}\n   */\n  async _getPrivateKey (name) {\n    if (!validateKeyName(name)) {\n      return throwDelayed(errcode(new Error(`Invalid key name '${name}'`), 'ERR_INVALID_KEY_NAME'))\n    }\n\n    try {\n      const dsname = DsName(name)\n      const res = await this.store.get(dsname)\n      return uint8ArrayToString(res)\n    } catch (err) {\n      return throwDelayed(errcode(new Error(`Key '${name}' does not exist. ${err.message}`), 'ERR_KEY_NOT_FOUND'))\n    }\n  }\n\n  /**\n   * Rotate keychain password and re-encrypt all assosciated keys\n   *\n   * @param {string} oldPass - The old local keychain password\n   * @param {string} newPass - The new local keychain password\n   */\n  async rotateKeychainPass (oldPass, newPass) {\n    if (typeof oldPass !== 'string') {\n      return throwDelayed(errcode(new Error(`Invalid old pass type '${typeof oldPass}'`), 'ERR_INVALID_OLD_PASS_TYPE'))\n    }\n    if (typeof newPass !== 'string') {\n      return throwDelayed(errcode(new Error(`Invalid new pass type '${typeof newPass}'`), 'ERR_INVALID_NEW_PASS_TYPE'))\n    }\n    if (newPass.length < 20) {\n      return throwDelayed(errcode(new Error(`Invalid pass length ${newPass.length}`), 'ERR_INVALID_PASS_LENGTH'))\n    }\n    log('recreating keychain')\n    const oldDek = privates.get(this).dek\n    this.opts.pass = newPass\n    const newDek = newPass\n      ? crypto.pbkdf2(\n        newPass,\n        this.opts.dek.salt,\n        this.opts.dek.iterationCount,\n        this.opts.dek.keyLength,\n        this.opts.dek.hash)\n      : ''\n    privates.set(this, { dek: newDek })\n    const keys = await this.listKeys()\n    for (const key of keys) {\n      const res = await this.store.get(DsName(key.name))\n      const pem = uint8ArrayToString(res)\n      const privateKey = await crypto.keys.import(pem, oldDek)\n      const password = newDek.toString()\n      const keyAsPEM = await privateKey.export(password)\n\n      // Update stored key\n      const batch = this.store.batch()\n      const keyInfo = {\n        name: key.name,\n        id: key.id\n      }\n      batch.put(DsName(key.name), uint8ArrayFromString(keyAsPEM))\n      batch.put(DsInfoName(key.name), uint8ArrayFromString(JSON.stringify(keyInfo)))\n      await batch.commit()\n    }\n    log('keychain reconstructed')\n  }\n}\n\nmodule.exports = Keychain\n","/*jshint node:true*/\n'use strict';\n\n/**\n * Replaces characters in strings that are illegal/unsafe for filenames.\n * Unsafe characters are either removed or replaced by a substitute set\n * in the optional `options` object.\n *\n * Illegal Characters on Various Operating Systems\n * / ? < > \\ : * | \"\n * https://kb.acronis.com/content/39790\n *\n * Unicode Control codes\n * C0 0x00-0x1f & C1 (0x80-0x9f)\n * http://en.wikipedia.org/wiki/C0_and_C1_control_codes\n *\n * Reserved filenames on Unix-based systems (\".\", \"..\")\n * Reserved filenames in Windows (\"CON\", \"PRN\", \"AUX\", \"NUL\", \"COM1\",\n * \"COM2\", \"COM3\", \"COM4\", \"COM5\", \"COM6\", \"COM7\", \"COM8\", \"COM9\",\n * \"LPT1\", \"LPT2\", \"LPT3\", \"LPT4\", \"LPT5\", \"LPT6\", \"LPT7\", \"LPT8\", and\n * \"LPT9\") case-insesitively and with or without filename extensions.\n *\n * Capped at 255 characters in length.\n * http://unix.stackexchange.com/questions/32795/what-is-the-maximum-allowed-filename-and-folder-size-with-ecryptfs\n *\n * @param  {String} input   Original filename\n * @param  {Object} options {replacement: String | Function }\n * @return {String}         Sanitized filename\n */\n\nvar truncate = require(\"truncate-utf8-bytes\");\n\nvar illegalRe = /[\\/\\?<>\\\\:\\*\\|\"]/g;\nvar controlRe = /[\\x00-\\x1f\\x80-\\x9f]/g;\nvar reservedRe = /^\\.+$/;\nvar windowsReservedRe = /^(con|prn|aux|nul|com[0-9]|lpt[0-9])(\\..*)?$/i;\nvar windowsTrailingRe = /[\\. ]+$/;\n\nfunction sanitize(input, replacement) {\n  if (typeof input !== 'string') {\n    throw new Error('Input must be string');\n  }\n  var sanitized = input\n    .replace(illegalRe, replacement)\n    .replace(controlRe, replacement)\n    .replace(reservedRe, replacement)\n    .replace(windowsReservedRe, replacement)\n    .replace(windowsTrailingRe, replacement);\n  return truncate(sanitized, 255);\n}\n\nmodule.exports = function (input, options) {\n  var replacement = (options && options.replacement) || '';\n  var output = sanitize(input, replacement);\n  if (replacement === '') {\n    return output;\n  }\n  return sanitize(output, '');\n};\n","'use strict';\n\nvar truncate = require(\"./lib/truncate\");\nvar getLength = require(\"utf8-byte-length/browser\");\nmodule.exports = truncate.bind(null, getLength);\n","'use strict';\n\nfunction isHighSurrogate(codePoint) {\n  return codePoint >= 0xd800 && codePoint <= 0xdbff;\n}\n\nfunction isLowSurrogate(codePoint) {\n  return codePoint >= 0xdc00 && codePoint <= 0xdfff;\n}\n\n// Truncate string by size in bytes\nmodule.exports = function truncate(getLength, string, byteLength) {\n  if (typeof string !== \"string\") {\n    throw new Error(\"Input must be string\");\n  }\n\n  var charLength = string.length;\n  var curByteLength = 0;\n  var codePoint;\n  var segment;\n\n  for (var i = 0; i < charLength; i += 1) {\n    codePoint = string.charCodeAt(i);\n    segment = string[i];\n\n    if (isHighSurrogate(codePoint) && isLowSurrogate(string.charCodeAt(i + 1))) {\n      i += 1;\n      segment += string[i];\n    }\n\n    curByteLength += getLength(segment);\n\n    if (curByteLength === byteLength) {\n      return string.slice(0, i + 1);\n    }\n    else if (curByteLength > byteLength) {\n      return string.slice(0, i - segment.length + 1);\n    }\n  }\n\n  return string;\n};\n\n","'use strict';\n\nfunction isHighSurrogate(codePoint) {\n  return codePoint >= 0xd800 && codePoint <= 0xdbff;\n}\n\nfunction isLowSurrogate(codePoint) {\n  return codePoint >= 0xdc00 && codePoint <= 0xdfff;\n}\n\n// Truncate string by size in bytes\nmodule.exports = function getByteLength(string) {\n  if (typeof string !== \"string\") {\n    throw new Error(\"Input must be string\");\n  }\n\n  var charLength = string.length;\n  var byteLength = 0;\n  var codePoint = null;\n  var prevCodePoint = null;\n  for (var i = 0; i < charLength; i++) {\n    codePoint = string.charCodeAt(i);\n    // handle 4-byte non-BMP chars\n    // low surrogate\n    if (isLowSurrogate(codePoint)) {\n      // when parsing previous hi-surrogate, 3 is added to byteLength\n      if (prevCodePoint != null && isHighSurrogate(prevCodePoint)) {\n        byteLength += 1;\n      }\n      else {\n        byteLength += 3;\n      }\n    }\n    else if (codePoint <= 0x7f ) {\n      byteLength += 1;\n    }\n    else if (codePoint >= 0x80 && codePoint <= 0x7ff) {\n      byteLength += 2;\n    }\n    else if (codePoint >= 0x800 && codePoint <= 0xffff) {\n      byteLength += 3;\n    }\n    prevCodePoint = codePoint;\n  }\n\n  return byteLength;\n};\n","'use strict'\n\n// @ts-ignore node-forge types not exported\nrequire('node-forge/lib/pkcs7')\n// @ts-ignore node-forge types not exported\nrequire('node-forge/lib/pbe')\n// @ts-ignore node-forge types not exported\nconst forge = require('node-forge/lib/forge')\nconst { certificateForKey, findAsync } = require('./util')\nconst errcode = require('err-code')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nconst privates = new WeakMap()\n\n/**\n * Cryptographic Message Syntax (aka PKCS #7)\n *\n * CMS describes an encapsulation syntax for data protection. It\n * is used to digitally sign, digest, authenticate, or encrypt\n * arbitrary message content.\n *\n * See RFC 5652 for all the details.\n */\nclass CMS {\n  /**\n   * Creates a new instance with a keychain\n   *\n   * @param {import('./index')} keychain - the available keys\n   * @param {string} dek\n   */\n  constructor (keychain, dek) {\n    if (!keychain) {\n      throw errcode(new Error('keychain is required'), 'ERR_KEYCHAIN_REQUIRED')\n    }\n\n    this.keychain = keychain\n    privates.set(this, { dek })\n  }\n\n  /**\n   * Creates some protected data.\n   *\n   * The output Uint8Array contains the PKCS #7 message in DER.\n   *\n   * @param {string} name - The local key name.\n   * @param {Uint8Array} plain - The data to encrypt.\n   * @returns {Promise<Uint8Array>}\n   */\n  async encrypt (name, plain) {\n    if (!(plain instanceof Uint8Array)) {\n      throw errcode(new Error('Plain data must be a Uint8Array'), 'ERR_INVALID_PARAMS')\n    }\n\n    const key = await this.keychain.findKeyByName(name)\n    const pem = await this.keychain._getPrivateKey(name)\n    /** @type {string} */\n    const dek = privates.get(this).dek\n    const privateKey = forge.pki.decryptRsaPrivateKey(pem, dek)\n    const certificate = await certificateForKey(key, privateKey)\n\n    // create a p7 enveloped message\n    const p7 = forge.pkcs7.createEnvelopedData()\n    p7.addRecipient(certificate)\n    p7.content = forge.util.createBuffer(plain)\n    p7.encrypt()\n\n    // convert message to DER\n    const der = forge.asn1.toDer(p7.toAsn1()).getBytes()\n    return uint8ArrayFromString(der, 'ascii')\n  }\n\n  /**\n   * Reads some protected data.\n   *\n   * The keychain must contain one of the keys used to encrypt the data.  If none of the keys\n   * exists, an Error is returned with the property 'missingKeys'.  It is array of key ids.\n   *\n   * @param {Uint8Array} cmsData - The CMS encrypted data to decrypt.\n   * @returns {Promise<Uint8Array>}\n   */\n  async decrypt (cmsData) {\n    if (!(cmsData instanceof Uint8Array)) {\n      throw errcode(new Error('CMS data is required'), 'ERR_INVALID_PARAMS')\n    }\n\n    let cms\n    try {\n      const buf = forge.util.createBuffer(uint8ArrayToString(cmsData, 'ascii'))\n      const obj = forge.asn1.fromDer(buf)\n      // @ts-ignore not defined\n      cms = forge.pkcs7.messageFromAsn1(obj)\n    } catch (err) {\n      throw errcode(new Error('Invalid CMS: ' + err.message), 'ERR_INVALID_CMS')\n    }\n\n    // Find a recipient whose key we hold. We only deal with recipient certs\n    // issued by ipfs (O=ipfs).\n    const recipients = cms.recipients\n      // @ts-ignore cms types not defined\n      .filter(r => r.issuer.find(a => a.shortName === 'O' && a.value === 'ipfs'))\n      // @ts-ignore cms types not defined\n      .filter(r => r.issuer.find(a => a.shortName === 'CN'))\n      // @ts-ignore cms types not defined\n      .map(r => {\n        return {\n          recipient: r,\n          // @ts-ignore cms types not defined\n          keyId: r.issuer.find(a => a.shortName === 'CN').value\n        }\n      })\n\n    const r = await findAsync(recipients, async (recipient) => {\n      try {\n        const key = await this.keychain.findKeyById(recipient.keyId)\n        if (key) return true\n      } catch (err) {\n        return false\n      }\n      return false\n    })\n\n    if (!r) {\n      // @ts-ignore cms types not defined\n      const missingKeys = recipients.map(r => r.keyId)\n      throw errcode(new Error('Decryption needs one of the key(s): ' + missingKeys.join(', ')), 'ERR_MISSING_KEYS', {\n        missingKeys\n      })\n    }\n\n    const key = await this.keychain.findKeyById(r.keyId)\n\n    if (!key) {\n      throw errcode(new Error('No key available to decrypto'), 'ERR_NO_KEY')\n    }\n\n    const pem = await this.keychain._getPrivateKey(key.name)\n    const dek = privates.get(this).dek\n    const privateKey = forge.pki.decryptRsaPrivateKey(pem, dek)\n    cms.decrypt(r.recipient, privateKey)\n    return uint8ArrayFromString(cms.content.getBytes(), 'ascii')\n  }\n}\n\nmodule.exports = CMS\n","/**\n * Javascript implementation of PKCS#7 v1.5.\n *\n * @author Stefan Siegl\n * @author Dave Longley\n *\n * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>\n * Copyright (c) 2012-2015 Digital Bazaar, Inc.\n *\n * Currently this implementation only supports ContentType of EnvelopedData,\n * EncryptedData, or SignedData at the root level. The top level elements may\n * contain only a ContentInfo of ContentType Data, i.e. plain data. Further\n * nesting is not (yet) supported.\n *\n * The Forge validators for PKCS #7's ASN.1 structures are available from\n * a separate file pkcs7asn1.js, since those are referenced from other\n * PKCS standards like PKCS #12.\n */\nvar forge = require('./forge');\nrequire('./aes');\nrequire('./asn1');\nrequire('./des');\nrequire('./oids');\nrequire('./pem');\nrequire('./pkcs7asn1');\nrequire('./random');\nrequire('./util');\nrequire('./x509');\n\n// shortcut for ASN.1 API\nvar asn1 = forge.asn1;\n\n// shortcut for PKCS#7 API\nvar p7 = module.exports = forge.pkcs7 = forge.pkcs7 || {};\n\n/**\n * Converts a PKCS#7 message from PEM format.\n *\n * @param pem the PEM-formatted PKCS#7 message.\n *\n * @return the PKCS#7 message.\n */\np7.messageFromPem = function(pem) {\n  var msg = forge.pem.decode(pem)[0];\n\n  if(msg.type !== 'PKCS7') {\n    var error = new Error('Could not convert PKCS#7 message from PEM; PEM ' +\n      'header type is not \"PKCS#7\".');\n    error.headerType = msg.type;\n    throw error;\n  }\n  if(msg.procType && msg.procType.type === 'ENCRYPTED') {\n    throw new Error('Could not convert PKCS#7 message from PEM; PEM is encrypted.');\n  }\n\n  // convert DER to ASN.1 object\n  var obj = asn1.fromDer(msg.body);\n\n  return p7.messageFromAsn1(obj);\n};\n\n/**\n * Converts a PKCS#7 message to PEM format.\n *\n * @param msg The PKCS#7 message object\n * @param maxline The maximum characters per line, defaults to 64.\n *\n * @return The PEM-formatted PKCS#7 message.\n */\np7.messageToPem = function(msg, maxline) {\n  // convert to ASN.1, then DER, then PEM-encode\n  var pemObj = {\n    type: 'PKCS7',\n    body: asn1.toDer(msg.toAsn1()).getBytes()\n  };\n  return forge.pem.encode(pemObj, {maxline: maxline});\n};\n\n/**\n * Converts a PKCS#7 message from an ASN.1 object.\n *\n * @param obj the ASN.1 representation of a ContentInfo.\n *\n * @return the PKCS#7 message.\n */\np7.messageFromAsn1 = function(obj) {\n  // validate root level ContentInfo and capture data\n  var capture = {};\n  var errors = [];\n  if(!asn1.validate(obj, p7.asn1.contentInfoValidator, capture, errors)) {\n    var error = new Error('Cannot read PKCS#7 message. ' +\n      'ASN.1 object is not an PKCS#7 ContentInfo.');\n    error.errors = errors;\n    throw error;\n  }\n\n  var contentType = asn1.derToOid(capture.contentType);\n  var msg;\n\n  switch(contentType) {\n    case forge.pki.oids.envelopedData:\n      msg = p7.createEnvelopedData();\n      break;\n\n    case forge.pki.oids.encryptedData:\n      msg = p7.createEncryptedData();\n      break;\n\n    case forge.pki.oids.signedData:\n      msg = p7.createSignedData();\n      break;\n\n    default:\n      throw new Error('Cannot read PKCS#7 message. ContentType with OID ' +\n        contentType + ' is not (yet) supported.');\n  }\n\n  msg.fromAsn1(capture.content.value[0]);\n  return msg;\n};\n\np7.createSignedData = function() {\n  var msg = null;\n  msg = {\n    type: forge.pki.oids.signedData,\n    version: 1,\n    certificates: [],\n    crls: [],\n    // TODO: add json-formatted signer stuff here?\n    signers: [],\n    // populated during sign()\n    digestAlgorithmIdentifiers: [],\n    contentInfo: null,\n    signerInfos: [],\n\n    fromAsn1: function(obj) {\n      // validate SignedData content block and capture data.\n      _fromAsn1(msg, obj, p7.asn1.signedDataValidator);\n      msg.certificates = [];\n      msg.crls = [];\n      msg.digestAlgorithmIdentifiers = [];\n      msg.contentInfo = null;\n      msg.signerInfos = [];\n\n      if(msg.rawCapture.certificates) {\n        var certs = msg.rawCapture.certificates.value;\n        for(var i = 0; i < certs.length; ++i) {\n          msg.certificates.push(forge.pki.certificateFromAsn1(certs[i]));\n        }\n      }\n\n      // TODO: parse crls\n    },\n\n    toAsn1: function() {\n      // degenerate case with no content\n      if(!msg.contentInfo) {\n        msg.sign();\n      }\n\n      var certs = [];\n      for(var i = 0; i < msg.certificates.length; ++i) {\n        certs.push(forge.pki.certificateToAsn1(msg.certificates[i]));\n      }\n\n      var crls = [];\n      // TODO: implement CRLs\n\n      // [0] SignedData\n      var signedData = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n          // Version\n          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n            asn1.integerToDer(msg.version).getBytes()),\n          // DigestAlgorithmIdentifiers\n          asn1.create(\n            asn1.Class.UNIVERSAL, asn1.Type.SET, true,\n            msg.digestAlgorithmIdentifiers),\n          // ContentInfo\n          msg.contentInfo\n        ])\n      ]);\n      if(certs.length > 0) {\n        // [0] IMPLICIT ExtendedCertificatesAndCertificates OPTIONAL\n        signedData.value[0].value.push(\n          asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, certs));\n      }\n      if(crls.length > 0) {\n        // [1] IMPLICIT CertificateRevocationLists OPTIONAL\n        signedData.value[0].value.push(\n          asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, crls));\n      }\n      // SignerInfos\n      signedData.value[0].value.push(\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true,\n          msg.signerInfos));\n\n      // ContentInfo\n      return asn1.create(\n        asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n          // ContentType\n          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n            asn1.oidToDer(msg.type).getBytes()),\n          // [0] SignedData\n          signedData\n        ]);\n    },\n\n    /**\n     * Add (another) entity to list of signers.\n     *\n     * Note: If authenticatedAttributes are provided, then, per RFC 2315,\n     * they must include at least two attributes: content type and\n     * message digest. The message digest attribute value will be\n     * auto-calculated during signing and will be ignored if provided.\n     *\n     * Here's an example of providing these two attributes:\n     *\n     * forge.pkcs7.createSignedData();\n     * p7.addSigner({\n     *   issuer: cert.issuer.attributes,\n     *   serialNumber: cert.serialNumber,\n     *   key: privateKey,\n     *   digestAlgorithm: forge.pki.oids.sha1,\n     *   authenticatedAttributes: [{\n     *     type: forge.pki.oids.contentType,\n     *     value: forge.pki.oids.data\n     *   }, {\n     *     type: forge.pki.oids.messageDigest\n     *   }]\n     * });\n     *\n     * TODO: Support [subjectKeyIdentifier] as signer's ID.\n     *\n     * @param signer the signer information:\n     *          key the signer's private key.\n     *          [certificate] a certificate containing the public key\n     *            associated with the signer's private key; use this option as\n     *            an alternative to specifying signer.issuer and\n     *            signer.serialNumber.\n     *          [issuer] the issuer attributes (eg: cert.issuer.attributes).\n     *          [serialNumber] the signer's certificate's serial number in\n     *           hexadecimal (eg: cert.serialNumber).\n     *          [digestAlgorithm] the message digest OID, as a string, to use\n     *            (eg: forge.pki.oids.sha1).\n     *          [authenticatedAttributes] an optional array of attributes\n     *            to also sign along with the content.\n     */\n    addSigner: function(signer) {\n      var issuer = signer.issuer;\n      var serialNumber = signer.serialNumber;\n      if(signer.certificate) {\n        var cert = signer.certificate;\n        if(typeof cert === 'string') {\n          cert = forge.pki.certificateFromPem(cert);\n        }\n        issuer = cert.issuer.attributes;\n        serialNumber = cert.serialNumber;\n      }\n      var key = signer.key;\n      if(!key) {\n        throw new Error(\n          'Could not add PKCS#7 signer; no private key specified.');\n      }\n      if(typeof key === 'string') {\n        key = forge.pki.privateKeyFromPem(key);\n      }\n\n      // ensure OID known for digest algorithm\n      var digestAlgorithm = signer.digestAlgorithm || forge.pki.oids.sha1;\n      switch(digestAlgorithm) {\n      case forge.pki.oids.sha1:\n      case forge.pki.oids.sha256:\n      case forge.pki.oids.sha384:\n      case forge.pki.oids.sha512:\n      case forge.pki.oids.md5:\n        break;\n      default:\n        throw new Error(\n          'Could not add PKCS#7 signer; unknown message digest algorithm: ' +\n          digestAlgorithm);\n      }\n\n      // if authenticatedAttributes is present, then the attributes\n      // must contain at least PKCS #9 content-type and message-digest\n      var authenticatedAttributes = signer.authenticatedAttributes || [];\n      if(authenticatedAttributes.length > 0) {\n        var contentType = false;\n        var messageDigest = false;\n        for(var i = 0; i < authenticatedAttributes.length; ++i) {\n          var attr = authenticatedAttributes[i];\n          if(!contentType && attr.type === forge.pki.oids.contentType) {\n            contentType = true;\n            if(messageDigest) {\n              break;\n            }\n            continue;\n          }\n          if(!messageDigest && attr.type === forge.pki.oids.messageDigest) {\n            messageDigest = true;\n            if(contentType) {\n              break;\n            }\n            continue;\n          }\n        }\n\n        if(!contentType || !messageDigest) {\n          throw new Error('Invalid signer.authenticatedAttributes. If ' +\n            'signer.authenticatedAttributes is specified, then it must ' +\n            'contain at least two attributes, PKCS #9 content-type and ' +\n            'PKCS #9 message-digest.');\n        }\n      }\n\n      msg.signers.push({\n        key: key,\n        version: 1,\n        issuer: issuer,\n        serialNumber: serialNumber,\n        digestAlgorithm: digestAlgorithm,\n        signatureAlgorithm: forge.pki.oids.rsaEncryption,\n        signature: null,\n        authenticatedAttributes: authenticatedAttributes,\n        unauthenticatedAttributes: []\n      });\n    },\n\n    /**\n     * Signs the content.\n     * @param options Options to apply when signing:\n     *    [detached] boolean. If signing should be done in detached mode. Defaults to false.\n     */\n    sign: function(options) {\n      options = options || {};\n      // auto-generate content info\n      if(typeof msg.content !== 'object' || msg.contentInfo === null) {\n        // use Data ContentInfo\n        msg.contentInfo = asn1.create(\n          asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n            // ContentType\n            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n              asn1.oidToDer(forge.pki.oids.data).getBytes())\n          ]);\n\n        // add actual content, if present\n        if('content' in msg) {\n          var content;\n          if(msg.content instanceof forge.util.ByteBuffer) {\n            content = msg.content.bytes();\n          } else if(typeof msg.content === 'string') {\n            content = forge.util.encodeUtf8(msg.content);\n          }\n\n          if (options.detached) {\n            msg.detachedContent = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, content);\n          } else {\n            msg.contentInfo.value.push(\n              // [0] EXPLICIT content\n              asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [\n                asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,\n                  content)\n              ]));\n          }\n        }\n      }\n\n      // no signers, return early (degenerate case for certificate container)\n      if(msg.signers.length === 0) {\n        return;\n      }\n\n      // generate digest algorithm identifiers\n      var mds = addDigestAlgorithmIds();\n\n      // generate signerInfos\n      addSignerInfos(mds);\n    },\n\n    verify: function() {\n      throw new Error('PKCS#7 signature verification not yet implemented.');\n    },\n\n    /**\n     * Add a certificate.\n     *\n     * @param cert the certificate to add.\n     */\n    addCertificate: function(cert) {\n      // convert from PEM\n      if(typeof cert === 'string') {\n        cert = forge.pki.certificateFromPem(cert);\n      }\n      msg.certificates.push(cert);\n    },\n\n    /**\n     * Add a certificate revokation list.\n     *\n     * @param crl the certificate revokation list to add.\n     */\n    addCertificateRevokationList: function(crl) {\n      throw new Error('PKCS#7 CRL support not yet implemented.');\n    }\n  };\n  return msg;\n\n  function addDigestAlgorithmIds() {\n    var mds = {};\n\n    for(var i = 0; i < msg.signers.length; ++i) {\n      var signer = msg.signers[i];\n      var oid = signer.digestAlgorithm;\n      if(!(oid in mds)) {\n        // content digest\n        mds[oid] = forge.md[forge.pki.oids[oid]].create();\n      }\n      if(signer.authenticatedAttributes.length === 0) {\n        // no custom attributes to digest; use content message digest\n        signer.md = mds[oid];\n      } else {\n        // custom attributes to be digested; use own message digest\n        // TODO: optimize to just copy message digest state if that\n        // feature is ever supported with message digests\n        signer.md = forge.md[forge.pki.oids[oid]].create();\n      }\n    }\n\n    // add unique digest algorithm identifiers\n    msg.digestAlgorithmIdentifiers = [];\n    for(var oid in mds) {\n      msg.digestAlgorithmIdentifiers.push(\n        // AlgorithmIdentifier\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n          // algorithm\n          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n            asn1.oidToDer(oid).getBytes()),\n          // parameters (null)\n          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')\n        ]));\n    }\n\n    return mds;\n  }\n\n  function addSignerInfos(mds) {\n    var content;\n\n    if (msg.detachedContent) {\n      // Signature has been made in detached mode.\n      content = msg.detachedContent;\n    } else {\n      // Note: ContentInfo is a SEQUENCE with 2 values, second value is\n      // the content field and is optional for a ContentInfo but required here\n      // since signers are present\n      // get ContentInfo content\n      content = msg.contentInfo.value[1];\n      // skip [0] EXPLICIT content wrapper\n      content = content.value[0];\n    }\n\n    if(!content) {\n      throw new Error(\n        'Could not sign PKCS#7 message; there is no content to sign.');\n    }\n\n    // get ContentInfo content type\n    var contentType = asn1.derToOid(msg.contentInfo.value[0].value);\n\n    // serialize content\n    var bytes = asn1.toDer(content);\n\n    // skip identifier and length per RFC 2315 9.3\n    // skip identifier (1 byte)\n    bytes.getByte();\n    // read and discard length bytes\n    asn1.getBerValueLength(bytes);\n    bytes = bytes.getBytes();\n\n    // digest content DER value bytes\n    for(var oid in mds) {\n      mds[oid].start().update(bytes);\n    }\n\n    // sign content\n    var signingTime = new Date();\n    for(var i = 0; i < msg.signers.length; ++i) {\n      var signer = msg.signers[i];\n\n      if(signer.authenticatedAttributes.length === 0) {\n        // if ContentInfo content type is not \"Data\", then\n        // authenticatedAttributes must be present per RFC 2315\n        if(contentType !== forge.pki.oids.data) {\n          throw new Error(\n            'Invalid signer; authenticatedAttributes must be present ' +\n            'when the ContentInfo content type is not PKCS#7 Data.');\n        }\n      } else {\n        // process authenticated attributes\n        // [0] IMPLICIT\n        signer.authenticatedAttributesAsn1 = asn1.create(\n          asn1.Class.CONTEXT_SPECIFIC, 0, true, []);\n\n        // per RFC 2315, attributes are to be digested using a SET container\n        // not the above [0] IMPLICIT container\n        var attrsAsn1 = asn1.create(\n          asn1.Class.UNIVERSAL, asn1.Type.SET, true, []);\n\n        for(var ai = 0; ai < signer.authenticatedAttributes.length; ++ai) {\n          var attr = signer.authenticatedAttributes[ai];\n          if(attr.type === forge.pki.oids.messageDigest) {\n            // use content message digest as value\n            attr.value = mds[signer.digestAlgorithm].digest();\n          } else if(attr.type === forge.pki.oids.signingTime) {\n            // auto-populate signing time if not already set\n            if(!attr.value) {\n              attr.value = signingTime;\n            }\n          }\n\n          // convert to ASN.1 and push onto Attributes SET (for signing) and\n          // onto authenticatedAttributesAsn1 to complete SignedData ASN.1\n          // TODO: optimize away duplication\n          attrsAsn1.value.push(_attributeToAsn1(attr));\n          signer.authenticatedAttributesAsn1.value.push(_attributeToAsn1(attr));\n        }\n\n        // DER-serialize and digest SET OF attributes only\n        bytes = asn1.toDer(attrsAsn1).getBytes();\n        signer.md.start().update(bytes);\n      }\n\n      // sign digest\n      signer.signature = signer.key.sign(signer.md, 'RSASSA-PKCS1-V1_5');\n    }\n\n    // add signer info\n    msg.signerInfos = _signersToAsn1(msg.signers);\n  }\n};\n\n/**\n * Creates an empty PKCS#7 message of type EncryptedData.\n *\n * @return the message.\n */\np7.createEncryptedData = function() {\n  var msg = null;\n  msg = {\n    type: forge.pki.oids.encryptedData,\n    version: 0,\n    encryptedContent: {\n      algorithm: forge.pki.oids['aes256-CBC']\n    },\n\n    /**\n     * Reads an EncryptedData content block (in ASN.1 format)\n     *\n     * @param obj The ASN.1 representation of the EncryptedData content block\n     */\n    fromAsn1: function(obj) {\n      // Validate EncryptedData content block and capture data.\n      _fromAsn1(msg, obj, p7.asn1.encryptedDataValidator);\n    },\n\n    /**\n     * Decrypt encrypted content\n     *\n     * @param key The (symmetric) key as a byte buffer\n     */\n    decrypt: function(key) {\n      if(key !== undefined) {\n        msg.encryptedContent.key = key;\n      }\n      _decryptContent(msg);\n    }\n  };\n  return msg;\n};\n\n/**\n * Creates an empty PKCS#7 message of type EnvelopedData.\n *\n * @return the message.\n */\np7.createEnvelopedData = function() {\n  var msg = null;\n  msg = {\n    type: forge.pki.oids.envelopedData,\n    version: 0,\n    recipients: [],\n    encryptedContent: {\n      algorithm: forge.pki.oids['aes256-CBC']\n    },\n\n    /**\n     * Reads an EnvelopedData content block (in ASN.1 format)\n     *\n     * @param obj the ASN.1 representation of the EnvelopedData content block.\n     */\n    fromAsn1: function(obj) {\n      // validate EnvelopedData content block and capture data\n      var capture = _fromAsn1(msg, obj, p7.asn1.envelopedDataValidator);\n      msg.recipients = _recipientsFromAsn1(capture.recipientInfos.value);\n    },\n\n    toAsn1: function() {\n      // ContentInfo\n      return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n        // ContentType\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n          asn1.oidToDer(msg.type).getBytes()),\n        // [0] EnvelopedData\n        asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [\n          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n            // Version\n            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n              asn1.integerToDer(msg.version).getBytes()),\n            // RecipientInfos\n            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true,\n              _recipientsToAsn1(msg.recipients)),\n            // EncryptedContentInfo\n            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true,\n              _encryptedContentToAsn1(msg.encryptedContent))\n          ])\n        ])\n      ]);\n    },\n\n    /**\n     * Find recipient by X.509 certificate's issuer.\n     *\n     * @param cert the certificate with the issuer to look for.\n     *\n     * @return the recipient object.\n     */\n    findRecipient: function(cert) {\n      var sAttr = cert.issuer.attributes;\n\n      for(var i = 0; i < msg.recipients.length; ++i) {\n        var r = msg.recipients[i];\n        var rAttr = r.issuer;\n\n        if(r.serialNumber !== cert.serialNumber) {\n          continue;\n        }\n\n        if(rAttr.length !== sAttr.length) {\n          continue;\n        }\n\n        var match = true;\n        for(var j = 0; j < sAttr.length; ++j) {\n          if(rAttr[j].type !== sAttr[j].type ||\n            rAttr[j].value !== sAttr[j].value) {\n            match = false;\n            break;\n          }\n        }\n\n        if(match) {\n          return r;\n        }\n      }\n\n      return null;\n    },\n\n    /**\n     * Decrypt enveloped content\n     *\n     * @param recipient The recipient object related to the private key\n     * @param privKey The (RSA) private key object\n     */\n    decrypt: function(recipient, privKey) {\n      if(msg.encryptedContent.key === undefined && recipient !== undefined &&\n        privKey !== undefined) {\n        switch(recipient.encryptedContent.algorithm) {\n          case forge.pki.oids.rsaEncryption:\n          case forge.pki.oids.desCBC:\n            var key = privKey.decrypt(recipient.encryptedContent.content);\n            msg.encryptedContent.key = forge.util.createBuffer(key);\n            break;\n\n          default:\n            throw new Error('Unsupported asymmetric cipher, ' +\n              'OID ' + recipient.encryptedContent.algorithm);\n        }\n      }\n\n      _decryptContent(msg);\n    },\n\n    /**\n     * Add (another) entity to list of recipients.\n     *\n     * @param cert The certificate of the entity to add.\n     */\n    addRecipient: function(cert) {\n      msg.recipients.push({\n        version: 0,\n        issuer: cert.issuer.attributes,\n        serialNumber: cert.serialNumber,\n        encryptedContent: {\n          // We simply assume rsaEncryption here, since forge.pki only\n          // supports RSA so far.  If the PKI module supports other\n          // ciphers one day, we need to modify this one as well.\n          algorithm: forge.pki.oids.rsaEncryption,\n          key: cert.publicKey\n        }\n      });\n    },\n\n    /**\n     * Encrypt enveloped content.\n     *\n     * This function supports two optional arguments, cipher and key, which\n     * can be used to influence symmetric encryption.  Unless cipher is\n     * provided, the cipher specified in encryptedContent.algorithm is used\n     * (defaults to AES-256-CBC).  If no key is provided, encryptedContent.key\n     * is (re-)used.  If that one's not set, a random key will be generated\n     * automatically.\n     *\n     * @param [key] The key to be used for symmetric encryption.\n     * @param [cipher] The OID of the symmetric cipher to use.\n     */\n    encrypt: function(key, cipher) {\n      // Part 1: Symmetric encryption\n      if(msg.encryptedContent.content === undefined) {\n        cipher = cipher || msg.encryptedContent.algorithm;\n        key = key || msg.encryptedContent.key;\n\n        var keyLen, ivLen, ciphFn;\n        switch(cipher) {\n          case forge.pki.oids['aes128-CBC']:\n            keyLen = 16;\n            ivLen = 16;\n            ciphFn = forge.aes.createEncryptionCipher;\n            break;\n\n          case forge.pki.oids['aes192-CBC']:\n            keyLen = 24;\n            ivLen = 16;\n            ciphFn = forge.aes.createEncryptionCipher;\n            break;\n\n          case forge.pki.oids['aes256-CBC']:\n            keyLen = 32;\n            ivLen = 16;\n            ciphFn = forge.aes.createEncryptionCipher;\n            break;\n\n          case forge.pki.oids['des-EDE3-CBC']:\n            keyLen = 24;\n            ivLen = 8;\n            ciphFn = forge.des.createEncryptionCipher;\n            break;\n\n          default:\n            throw new Error('Unsupported symmetric cipher, OID ' + cipher);\n        }\n\n        if(key === undefined) {\n          key = forge.util.createBuffer(forge.random.getBytes(keyLen));\n        } else if(key.length() != keyLen) {\n          throw new Error('Symmetric key has wrong length; ' +\n            'got ' + key.length() + ' bytes, expected ' + keyLen + '.');\n        }\n\n        // Keep a copy of the key & IV in the object, so the caller can\n        // use it for whatever reason.\n        msg.encryptedContent.algorithm = cipher;\n        msg.encryptedContent.key = key;\n        msg.encryptedContent.parameter = forge.util.createBuffer(\n          forge.random.getBytes(ivLen));\n\n        var ciph = ciphFn(key);\n        ciph.start(msg.encryptedContent.parameter.copy());\n        ciph.update(msg.content);\n\n        // The finish function does PKCS#7 padding by default, therefore\n        // no action required by us.\n        if(!ciph.finish()) {\n          throw new Error('Symmetric encryption failed.');\n        }\n\n        msg.encryptedContent.content = ciph.output;\n      }\n\n      // Part 2: asymmetric encryption for each recipient\n      for(var i = 0; i < msg.recipients.length; ++i) {\n        var recipient = msg.recipients[i];\n\n        // Nothing to do, encryption already done.\n        if(recipient.encryptedContent.content !== undefined) {\n          continue;\n        }\n\n        switch(recipient.encryptedContent.algorithm) {\n          case forge.pki.oids.rsaEncryption:\n            recipient.encryptedContent.content =\n              recipient.encryptedContent.key.encrypt(\n                msg.encryptedContent.key.data);\n            break;\n\n          default:\n            throw new Error('Unsupported asymmetric cipher, OID ' +\n              recipient.encryptedContent.algorithm);\n        }\n      }\n    }\n  };\n  return msg;\n};\n\n/**\n * Converts a single recipient from an ASN.1 object.\n *\n * @param obj the ASN.1 RecipientInfo.\n *\n * @return the recipient object.\n */\nfunction _recipientFromAsn1(obj) {\n  // validate EnvelopedData content block and capture data\n  var capture = {};\n  var errors = [];\n  if(!asn1.validate(obj, p7.asn1.recipientInfoValidator, capture, errors)) {\n    var error = new Error('Cannot read PKCS#7 RecipientInfo. ' +\n      'ASN.1 object is not an PKCS#7 RecipientInfo.');\n    error.errors = errors;\n    throw error;\n  }\n\n  return {\n    version: capture.version.charCodeAt(0),\n    issuer: forge.pki.RDNAttributesAsArray(capture.issuer),\n    serialNumber: forge.util.createBuffer(capture.serial).toHex(),\n    encryptedContent: {\n      algorithm: asn1.derToOid(capture.encAlgorithm),\n      parameter: capture.encParameter.value,\n      content: capture.encKey\n    }\n  };\n}\n\n/**\n * Converts a single recipient object to an ASN.1 object.\n *\n * @param obj the recipient object.\n *\n * @return the ASN.1 RecipientInfo.\n */\nfunction _recipientToAsn1(obj) {\n  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // Version\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      asn1.integerToDer(obj.version).getBytes()),\n    // IssuerAndSerialNumber\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      // Name\n      forge.pki.distinguishedNameToAsn1({attributes: obj.issuer}),\n      // Serial\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n        forge.util.hexToBytes(obj.serialNumber))\n    ]),\n    // KeyEncryptionAlgorithmIdentifier\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      // Algorithm\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n        asn1.oidToDer(obj.encryptedContent.algorithm).getBytes()),\n      // Parameter, force NULL, only RSA supported for now.\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')\n    ]),\n    // EncryptedKey\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,\n      obj.encryptedContent.content)\n  ]);\n}\n\n/**\n * Map a set of RecipientInfo ASN.1 objects to recipient objects.\n *\n * @param infos an array of ASN.1 representations RecipientInfo (i.e. SET OF).\n *\n * @return an array of recipient objects.\n */\nfunction _recipientsFromAsn1(infos) {\n  var ret = [];\n  for(var i = 0; i < infos.length; ++i) {\n    ret.push(_recipientFromAsn1(infos[i]));\n  }\n  return ret;\n}\n\n/**\n * Map an array of recipient objects to ASN.1 RecipientInfo objects.\n *\n * @param recipients an array of recipientInfo objects.\n *\n * @return an array of ASN.1 RecipientInfos.\n */\nfunction _recipientsToAsn1(recipients) {\n  var ret = [];\n  for(var i = 0; i < recipients.length; ++i) {\n    ret.push(_recipientToAsn1(recipients[i]));\n  }\n  return ret;\n}\n\n/**\n * Converts a single signer from an ASN.1 object.\n *\n * @param obj the ASN.1 representation of a SignerInfo.\n *\n * @return the signer object.\n */\nfunction _signerFromAsn1(obj) {\n  // validate EnvelopedData content block and capture data\n  var capture = {};\n  var errors = [];\n  if(!asn1.validate(obj, p7.asn1.signerInfoValidator, capture, errors)) {\n    var error = new Error('Cannot read PKCS#7 SignerInfo. ' +\n      'ASN.1 object is not an PKCS#7 SignerInfo.');\n    error.errors = errors;\n    throw error;\n  }\n\n  var rval = {\n    version: capture.version.charCodeAt(0),\n    issuer: forge.pki.RDNAttributesAsArray(capture.issuer),\n    serialNumber: forge.util.createBuffer(capture.serial).toHex(),\n    digestAlgorithm: asn1.derToOid(capture.digestAlgorithm),\n    signatureAlgorithm: asn1.derToOid(capture.signatureAlgorithm),\n    signature: capture.signature,\n    authenticatedAttributes: [],\n    unauthenticatedAttributes: []\n  };\n\n  // TODO: convert attributes\n  var authenticatedAttributes = capture.authenticatedAttributes || [];\n  var unauthenticatedAttributes = capture.unauthenticatedAttributes || [];\n\n  return rval;\n}\n\n/**\n * Converts a single signerInfo object to an ASN.1 object.\n *\n * @param obj the signerInfo object.\n *\n * @return the ASN.1 representation of a SignerInfo.\n */\nfunction _signerToAsn1(obj) {\n  // SignerInfo\n  var rval = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // version\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      asn1.integerToDer(obj.version).getBytes()),\n    // issuerAndSerialNumber\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      // name\n      forge.pki.distinguishedNameToAsn1({attributes: obj.issuer}),\n      // serial\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n        forge.util.hexToBytes(obj.serialNumber))\n    ]),\n    // digestAlgorithm\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      // algorithm\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n        asn1.oidToDer(obj.digestAlgorithm).getBytes()),\n      // parameters (null)\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')\n    ])\n  ]);\n\n  // authenticatedAttributes (OPTIONAL)\n  if(obj.authenticatedAttributesAsn1) {\n    // add ASN.1 previously generated during signing\n    rval.value.push(obj.authenticatedAttributesAsn1);\n  }\n\n  // digestEncryptionAlgorithm\n  rval.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // algorithm\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n      asn1.oidToDer(obj.signatureAlgorithm).getBytes()),\n    // parameters (null)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')\n  ]));\n\n  // encryptedDigest\n  rval.value.push(asn1.create(\n    asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, obj.signature));\n\n  // unauthenticatedAttributes (OPTIONAL)\n  if(obj.unauthenticatedAttributes.length > 0) {\n    // [1] IMPLICIT\n    var attrsAsn1 = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, []);\n    for(var i = 0; i < obj.unauthenticatedAttributes.length; ++i) {\n      var attr = obj.unauthenticatedAttributes[i];\n      attrsAsn1.values.push(_attributeToAsn1(attr));\n    }\n    rval.value.push(attrsAsn1);\n  }\n\n  return rval;\n}\n\n/**\n * Map a set of SignerInfo ASN.1 objects to an array of signer objects.\n *\n * @param signerInfoAsn1s an array of ASN.1 SignerInfos (i.e. SET OF).\n *\n * @return an array of signers objects.\n */\nfunction _signersFromAsn1(signerInfoAsn1s) {\n  var ret = [];\n  for(var i = 0; i < signerInfoAsn1s.length; ++i) {\n    ret.push(_signerFromAsn1(signerInfoAsn1s[i]));\n  }\n  return ret;\n}\n\n/**\n * Map an array of signer objects to ASN.1 objects.\n *\n * @param signers an array of signer objects.\n *\n * @return an array of ASN.1 SignerInfos.\n */\nfunction _signersToAsn1(signers) {\n  var ret = [];\n  for(var i = 0; i < signers.length; ++i) {\n    ret.push(_signerToAsn1(signers[i]));\n  }\n  return ret;\n}\n\n/**\n * Convert an attribute object to an ASN.1 Attribute.\n *\n * @param attr the attribute object.\n *\n * @return the ASN.1 Attribute.\n */\nfunction _attributeToAsn1(attr) {\n  var value;\n\n  // TODO: generalize to support more attributes\n  if(attr.type === forge.pki.oids.contentType) {\n    value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n      asn1.oidToDer(attr.value).getBytes());\n  } else if(attr.type === forge.pki.oids.messageDigest) {\n    value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,\n      attr.value.bytes());\n  } else if(attr.type === forge.pki.oids.signingTime) {\n    /* Note per RFC 2985: Dates between 1 January 1950 and 31 December 2049\n      (inclusive) MUST be encoded as UTCTime. Any dates with year values\n      before 1950 or after 2049 MUST be encoded as GeneralizedTime. [Further,]\n      UTCTime values MUST be expressed in Greenwich Mean Time (Zulu) and MUST\n      include seconds (i.e., times are YYMMDDHHMMSSZ), even where the\n      number of seconds is zero.  Midnight (GMT) must be represented as\n      \"YYMMDD000000Z\". */\n    // TODO: make these module-level constants\n    var jan_1_1950 = new Date('1950-01-01T00:00:00Z');\n    var jan_1_2050 = new Date('2050-01-01T00:00:00Z');\n    var date = attr.value;\n    if(typeof date === 'string') {\n      // try to parse date\n      var timestamp = Date.parse(date);\n      if(!isNaN(timestamp)) {\n        date = new Date(timestamp);\n      } else if(date.length === 13) {\n        // YYMMDDHHMMSSZ (13 chars for UTCTime)\n        date = asn1.utcTimeToDate(date);\n      } else {\n        // assume generalized time\n        date = asn1.generalizedTimeToDate(date);\n      }\n    }\n\n    if(date >= jan_1_1950 && date < jan_1_2050) {\n      value = asn1.create(\n        asn1.Class.UNIVERSAL, asn1.Type.UTCTIME, false,\n        asn1.dateToUtcTime(date));\n    } else {\n      value = asn1.create(\n        asn1.Class.UNIVERSAL, asn1.Type.GENERALIZEDTIME, false,\n        asn1.dateToGeneralizedTime(date));\n    }\n  }\n\n  // TODO: expose as common API call\n  // create a RelativeDistinguishedName set\n  // each value in the set is an AttributeTypeAndValue first\n  // containing the type (an OID) and second the value\n  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // AttributeType\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n      asn1.oidToDer(attr.type).getBytes()),\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [\n      // AttributeValue\n      value\n    ])\n  ]);\n}\n\n/**\n * Map messages encrypted content to ASN.1 objects.\n *\n * @param ec The encryptedContent object of the message.\n *\n * @return ASN.1 representation of the encryptedContent object (SEQUENCE).\n */\nfunction _encryptedContentToAsn1(ec) {\n  return [\n    // ContentType, always Data for the moment\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n      asn1.oidToDer(forge.pki.oids.data).getBytes()),\n    // ContentEncryptionAlgorithmIdentifier\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      // Algorithm\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n        asn1.oidToDer(ec.algorithm).getBytes()),\n      // Parameters (IV)\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,\n        ec.parameter.getBytes())\n    ]),\n    // [0] EncryptedContent\n    asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false,\n        ec.content.getBytes())\n    ])\n  ];\n}\n\n/**\n * Reads the \"common part\" of an PKCS#7 content block (in ASN.1 format)\n *\n * This function reads the \"common part\" of the PKCS#7 content blocks\n * EncryptedData and EnvelopedData, i.e. version number and symmetrically\n * encrypted content block.\n *\n * The result of the ASN.1 validate and capture process is returned\n * to allow the caller to extract further data, e.g. the list of recipients\n * in case of a EnvelopedData object.\n *\n * @param msg the PKCS#7 object to read the data to.\n * @param obj the ASN.1 representation of the content block.\n * @param validator the ASN.1 structure validator object to use.\n *\n * @return the value map captured by validator object.\n */\nfunction _fromAsn1(msg, obj, validator) {\n  var capture = {};\n  var errors = [];\n  if(!asn1.validate(obj, validator, capture, errors)) {\n    var error = new Error('Cannot read PKCS#7 message. ' +\n      'ASN.1 object is not a supported PKCS#7 message.');\n    error.errors = error;\n    throw error;\n  }\n\n  // Check contentType, so far we only support (raw) Data.\n  var contentType = asn1.derToOid(capture.contentType);\n  if(contentType !== forge.pki.oids.data) {\n    throw new Error('Unsupported PKCS#7 message. ' +\n      'Only wrapped ContentType Data supported.');\n  }\n\n  if(capture.encryptedContent) {\n    var content = '';\n    if(forge.util.isArray(capture.encryptedContent)) {\n      for(var i = 0; i < capture.encryptedContent.length; ++i) {\n        if(capture.encryptedContent[i].type !== asn1.Type.OCTETSTRING) {\n          throw new Error('Malformed PKCS#7 message, expecting encrypted ' +\n            'content constructed of only OCTET STRING objects.');\n        }\n        content += capture.encryptedContent[i].value;\n      }\n    } else {\n      content = capture.encryptedContent;\n    }\n    msg.encryptedContent = {\n      algorithm: asn1.derToOid(capture.encAlgorithm),\n      parameter: forge.util.createBuffer(capture.encParameter.value),\n      content: forge.util.createBuffer(content)\n    };\n  }\n\n  if(capture.content) {\n    var content = '';\n    if(forge.util.isArray(capture.content)) {\n      for(var i = 0; i < capture.content.length; ++i) {\n        if(capture.content[i].type !== asn1.Type.OCTETSTRING) {\n          throw new Error('Malformed PKCS#7 message, expecting ' +\n            'content constructed of only OCTET STRING objects.');\n        }\n        content += capture.content[i].value;\n      }\n    } else {\n      content = capture.content;\n    }\n    msg.content = forge.util.createBuffer(content);\n  }\n\n  msg.version = capture.version.charCodeAt(0);\n  msg.rawCapture = capture;\n\n  return capture;\n}\n\n/**\n * Decrypt the symmetrically encrypted content block of the PKCS#7 message.\n *\n * Decryption is skipped in case the PKCS#7 message object already has a\n * (decrypted) content attribute.  The algorithm, key and cipher parameters\n * (probably the iv) are taken from the encryptedContent attribute of the\n * message object.\n *\n * @param The PKCS#7 message object.\n */\nfunction _decryptContent(msg) {\n  if(msg.encryptedContent.key === undefined) {\n    throw new Error('Symmetric key not available.');\n  }\n\n  if(msg.content === undefined) {\n    var ciph;\n\n    switch(msg.encryptedContent.algorithm) {\n      case forge.pki.oids['aes128-CBC']:\n      case forge.pki.oids['aes192-CBC']:\n      case forge.pki.oids['aes256-CBC']:\n        ciph = forge.aes.createDecryptionCipher(msg.encryptedContent.key);\n        break;\n\n      case forge.pki.oids['desCBC']:\n      case forge.pki.oids['des-EDE3-CBC']:\n        ciph = forge.des.createDecryptionCipher(msg.encryptedContent.key);\n        break;\n\n      default:\n        throw new Error('Unsupported symmetric cipher, OID ' +\n          msg.encryptedContent.algorithm);\n    }\n    ciph.start(msg.encryptedContent.parameter);\n    ciph.update(msg.encryptedContent.content);\n\n    if(!ciph.finish()) {\n      throw new Error('Symmetric decryption failed.');\n    }\n\n    msg.content = ciph.output;\n  }\n}\n","/**\n * Javascript implementation of ASN.1 validators for PKCS#7 v1.5.\n *\n * @author Dave Longley\n * @author Stefan Siegl\n *\n * Copyright (c) 2012-2015 Digital Bazaar, Inc.\n * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>\n *\n * The ASN.1 representation of PKCS#7 is as follows\n * (see RFC #2315 for details, http://www.ietf.org/rfc/rfc2315.txt):\n *\n * A PKCS#7 message consists of a ContentInfo on root level, which may\n * contain any number of further ContentInfo nested into it.\n *\n * ContentInfo ::= SEQUENCE {\n *   contentType                ContentType,\n *   content               [0]  EXPLICIT ANY DEFINED BY contentType OPTIONAL\n * }\n *\n * ContentType ::= OBJECT IDENTIFIER\n *\n * EnvelopedData ::= SEQUENCE {\n *   version                    Version,\n *   recipientInfos             RecipientInfos,\n *   encryptedContentInfo       EncryptedContentInfo\n * }\n *\n * EncryptedData ::= SEQUENCE {\n *   version                    Version,\n *   encryptedContentInfo       EncryptedContentInfo\n * }\n *\n * id-signedData OBJECT IDENTIFIER ::= { iso(1) member-body(2)\n *   us(840) rsadsi(113549) pkcs(1) pkcs7(7) 2 }\n *\n * SignedData ::= SEQUENCE {\n *   version           INTEGER,\n *   digestAlgorithms  DigestAlgorithmIdentifiers,\n *   contentInfo       ContentInfo,\n *   certificates      [0] IMPLICIT Certificates OPTIONAL,\n *   crls              [1] IMPLICIT CertificateRevocationLists OPTIONAL,\n *   signerInfos       SignerInfos\n * }\n *\n * SignerInfos ::= SET OF SignerInfo\n *\n * SignerInfo ::= SEQUENCE {\n *   version                    Version,\n *   issuerAndSerialNumber      IssuerAndSerialNumber,\n *   digestAlgorithm            DigestAlgorithmIdentifier,\n *   authenticatedAttributes    [0] IMPLICIT Attributes OPTIONAL,\n *   digestEncryptionAlgorithm  DigestEncryptionAlgorithmIdentifier,\n *   encryptedDigest            EncryptedDigest,\n *   unauthenticatedAttributes  [1] IMPLICIT Attributes OPTIONAL\n * }\n *\n * EncryptedDigest ::= OCTET STRING\n *\n * Attributes ::= SET OF Attribute\n *\n * Attribute ::= SEQUENCE {\n *   attrType    OBJECT IDENTIFIER,\n *   attrValues  SET OF AttributeValue\n * }\n *\n * AttributeValue ::= ANY\n *\n * Version ::= INTEGER\n *\n * RecipientInfos ::= SET OF RecipientInfo\n *\n * EncryptedContentInfo ::= SEQUENCE {\n *   contentType                 ContentType,\n *   contentEncryptionAlgorithm  ContentEncryptionAlgorithmIdentifier,\n *   encryptedContent       [0]  IMPLICIT EncryptedContent OPTIONAL\n * }\n *\n * ContentEncryptionAlgorithmIdentifier ::= AlgorithmIdentifier\n *\n * The AlgorithmIdentifier contains an Object Identifier (OID) and parameters\n * for the algorithm, if any. In the case of AES and DES3, there is only one,\n * the IV.\n *\n * AlgorithmIdentifer ::= SEQUENCE {\n *    algorithm OBJECT IDENTIFIER,\n *    parameters ANY DEFINED BY algorithm OPTIONAL\n * }\n *\n * EncryptedContent ::= OCTET STRING\n *\n * RecipientInfo ::= SEQUENCE {\n *   version                     Version,\n *   issuerAndSerialNumber       IssuerAndSerialNumber,\n *   keyEncryptionAlgorithm      KeyEncryptionAlgorithmIdentifier,\n *   encryptedKey                EncryptedKey\n * }\n *\n * IssuerAndSerialNumber ::= SEQUENCE {\n *   issuer                      Name,\n *   serialNumber                CertificateSerialNumber\n * }\n *\n * CertificateSerialNumber ::= INTEGER\n *\n * KeyEncryptionAlgorithmIdentifier ::= AlgorithmIdentifier\n *\n * EncryptedKey ::= OCTET STRING\n */\nvar forge = require('./forge');\nrequire('./asn1');\nrequire('./util');\n\n// shortcut for ASN.1 API\nvar asn1 = forge.asn1;\n\n// shortcut for PKCS#7 API\nvar p7v = module.exports = forge.pkcs7asn1 = forge.pkcs7asn1 || {};\nforge.pkcs7 = forge.pkcs7 || {};\nforge.pkcs7.asn1 = p7v;\n\nvar contentInfoValidator = {\n  name: 'ContentInfo',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'ContentInfo.ContentType',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.OID,\n    constructed: false,\n    capture: 'contentType'\n  }, {\n    name: 'ContentInfo.content',\n    tagClass: asn1.Class.CONTEXT_SPECIFIC,\n    type: 0,\n    constructed: true,\n    optional: true,\n    captureAsn1: 'content'\n  }]\n};\np7v.contentInfoValidator = contentInfoValidator;\n\nvar encryptedContentInfoValidator = {\n  name: 'EncryptedContentInfo',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'EncryptedContentInfo.contentType',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.OID,\n    constructed: false,\n    capture: 'contentType'\n  }, {\n    name: 'EncryptedContentInfo.contentEncryptionAlgorithm',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'EncryptedContentInfo.contentEncryptionAlgorithm.algorithm',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OID,\n      constructed: false,\n      capture: 'encAlgorithm'\n    }, {\n      name: 'EncryptedContentInfo.contentEncryptionAlgorithm.parameter',\n      tagClass: asn1.Class.UNIVERSAL,\n      captureAsn1: 'encParameter'\n    }]\n  }, {\n    name: 'EncryptedContentInfo.encryptedContent',\n    tagClass: asn1.Class.CONTEXT_SPECIFIC,\n    type: 0,\n    /* The PKCS#7 structure output by OpenSSL somewhat differs from what\n     * other implementations do generate.\n     *\n     * OpenSSL generates a structure like this:\n     * SEQUENCE {\n     *    ...\n     *    [0]\n     *       26 DA 67 D2 17 9C 45 3C B1 2A A8 59 2F 29 33 38\n     *       C3 C3 DF 86 71 74 7A 19 9F 40 D0 29 BE 85 90 45\n     *       ...\n     * }\n     *\n     * Whereas other implementations (and this PKCS#7 module) generate:\n     * SEQUENCE {\n     *    ...\n     *    [0] {\n     *       OCTET STRING\n     *          26 DA 67 D2 17 9C 45 3C B1 2A A8 59 2F 29 33 38\n     *          C3 C3 DF 86 71 74 7A 19 9F 40 D0 29 BE 85 90 45\n     *          ...\n     *    }\n     * }\n     *\n     * In order to support both, we just capture the context specific\n     * field here.  The OCTET STRING bit is removed below.\n     */\n    capture: 'encryptedContent',\n    captureAsn1: 'encryptedContentAsn1'\n  }]\n};\n\np7v.envelopedDataValidator = {\n  name: 'EnvelopedData',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'EnvelopedData.Version',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'version'\n  }, {\n    name: 'EnvelopedData.RecipientInfos',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SET,\n    constructed: true,\n    captureAsn1: 'recipientInfos'\n  }].concat(encryptedContentInfoValidator)\n};\n\np7v.encryptedDataValidator = {\n  name: 'EncryptedData',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'EncryptedData.Version',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'version'\n  }].concat(encryptedContentInfoValidator)\n};\n\nvar signerValidator = {\n  name: 'SignerInfo',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'SignerInfo.version',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false\n  }, {\n    name: 'SignerInfo.issuerAndSerialNumber',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'SignerInfo.issuerAndSerialNumber.issuer',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      captureAsn1: 'issuer'\n    }, {\n      name: 'SignerInfo.issuerAndSerialNumber.serialNumber',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.INTEGER,\n      constructed: false,\n      capture: 'serial'\n    }]\n  }, {\n    name: 'SignerInfo.digestAlgorithm',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'SignerInfo.digestAlgorithm.algorithm',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OID,\n      constructed: false,\n      capture: 'digestAlgorithm'\n    }, {\n      name: 'SignerInfo.digestAlgorithm.parameter',\n      tagClass: asn1.Class.UNIVERSAL,\n      constructed: false,\n      captureAsn1: 'digestParameter',\n      optional: true\n    }]\n  }, {\n    name: 'SignerInfo.authenticatedAttributes',\n    tagClass: asn1.Class.CONTEXT_SPECIFIC,\n    type: 0,\n    constructed: true,\n    optional: true,\n    capture: 'authenticatedAttributes'\n  }, {\n    name: 'SignerInfo.digestEncryptionAlgorithm',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    capture: 'signatureAlgorithm'\n  }, {\n    name: 'SignerInfo.encryptedDigest',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.OCTETSTRING,\n    constructed: false,\n    capture: 'signature'\n  }, {\n    name: 'SignerInfo.unauthenticatedAttributes',\n    tagClass: asn1.Class.CONTEXT_SPECIFIC,\n    type: 1,\n    constructed: true,\n    optional: true,\n    capture: 'unauthenticatedAttributes'\n  }]\n};\n\np7v.signedDataValidator = {\n  name: 'SignedData',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'SignedData.Version',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'version'\n  }, {\n    name: 'SignedData.DigestAlgorithms',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SET,\n    constructed: true,\n    captureAsn1: 'digestAlgorithms'\n  },\n  contentInfoValidator,\n  {\n    name: 'SignedData.Certificates',\n    tagClass: asn1.Class.CONTEXT_SPECIFIC,\n    type: 0,\n    optional: true,\n    captureAsn1: 'certificates'\n  }, {\n    name: 'SignedData.CertificateRevocationLists',\n    tagClass: asn1.Class.CONTEXT_SPECIFIC,\n    type: 1,\n    optional: true,\n    captureAsn1: 'crls'\n  }, {\n    name: 'SignedData.SignerInfos',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SET,\n    capture: 'signerInfos',\n    optional: true,\n    value: [signerValidator]\n  }]\n};\n\np7v.recipientInfoValidator = {\n  name: 'RecipientInfo',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'RecipientInfo.version',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'version'\n  }, {\n    name: 'RecipientInfo.issuerAndSerial',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'RecipientInfo.issuerAndSerial.issuer',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      captureAsn1: 'issuer'\n    }, {\n      name: 'RecipientInfo.issuerAndSerial.serialNumber',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.INTEGER,\n      constructed: false,\n      capture: 'serial'\n    }]\n  }, {\n    name: 'RecipientInfo.keyEncryptionAlgorithm',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      name: 'RecipientInfo.keyEncryptionAlgorithm.algorithm',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OID,\n      constructed: false,\n      capture: 'encAlgorithm'\n    }, {\n      name: 'RecipientInfo.keyEncryptionAlgorithm.parameter',\n      tagClass: asn1.Class.UNIVERSAL,\n      constructed: false,\n      captureAsn1: 'encParameter'\n    }]\n  }, {\n    name: 'RecipientInfo.encryptedKey',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.OCTETSTRING,\n    constructed: false,\n    capture: 'encKey'\n  }]\n};\n","/**\n * Javascript implementation of X.509 and related components (such as\n * Certification Signing Requests) of a Public Key Infrastructure.\n *\n * @author Dave Longley\n *\n * Copyright (c) 2010-2014 Digital Bazaar, Inc.\n *\n * The ASN.1 representation of an X.509v3 certificate is as follows\n * (see RFC 2459):\n *\n * Certificate ::= SEQUENCE {\n *   tbsCertificate       TBSCertificate,\n *   signatureAlgorithm   AlgorithmIdentifier,\n *   signatureValue       BIT STRING\n * }\n *\n * TBSCertificate ::= SEQUENCE {\n *   version         [0]  EXPLICIT Version DEFAULT v1,\n *   serialNumber         CertificateSerialNumber,\n *   signature            AlgorithmIdentifier,\n *   issuer               Name,\n *   validity             Validity,\n *   subject              Name,\n *   subjectPublicKeyInfo SubjectPublicKeyInfo,\n *   issuerUniqueID  [1]  IMPLICIT UniqueIdentifier OPTIONAL,\n *                        -- If present, version shall be v2 or v3\n *   subjectUniqueID [2]  IMPLICIT UniqueIdentifier OPTIONAL,\n *                        -- If present, version shall be v2 or v3\n *   extensions      [3]  EXPLICIT Extensions OPTIONAL\n *                        -- If present, version shall be v3\n * }\n *\n * Version ::= INTEGER  { v1(0), v2(1), v3(2) }\n *\n * CertificateSerialNumber ::= INTEGER\n *\n * Name ::= CHOICE {\n *   // only one possible choice for now\n *   RDNSequence\n * }\n *\n * RDNSequence ::= SEQUENCE OF RelativeDistinguishedName\n *\n * RelativeDistinguishedName ::= SET OF AttributeTypeAndValue\n *\n * AttributeTypeAndValue ::= SEQUENCE {\n *   type     AttributeType,\n *   value    AttributeValue\n * }\n * AttributeType ::= OBJECT IDENTIFIER\n * AttributeValue ::= ANY DEFINED BY AttributeType\n *\n * Validity ::= SEQUENCE {\n *   notBefore      Time,\n *   notAfter       Time\n * }\n *\n * Time ::= CHOICE {\n *   utcTime        UTCTime,\n *   generalTime    GeneralizedTime\n * }\n *\n * UniqueIdentifier ::= BIT STRING\n *\n * SubjectPublicKeyInfo ::= SEQUENCE {\n *   algorithm            AlgorithmIdentifier,\n *   subjectPublicKey     BIT STRING\n * }\n *\n * Extensions ::= SEQUENCE SIZE (1..MAX) OF Extension\n *\n * Extension ::= SEQUENCE {\n *   extnID      OBJECT IDENTIFIER,\n *   critical    BOOLEAN DEFAULT FALSE,\n *   extnValue   OCTET STRING\n * }\n *\n * The only key algorithm currently supported for PKI is RSA.\n *\n * RSASSA-PSS signatures are described in RFC 3447 and RFC 4055.\n *\n * PKCS#10 v1.7 describes certificate signing requests:\n *\n * CertificationRequestInfo:\n *\n * CertificationRequestInfo ::= SEQUENCE {\n *   version       INTEGER { v1(0) } (v1,...),\n *   subject       Name,\n *   subjectPKInfo SubjectPublicKeyInfo{{ PKInfoAlgorithms }},\n *   attributes    [0] Attributes{{ CRIAttributes }}\n * }\n *\n * Attributes { ATTRIBUTE:IOSet } ::= SET OF Attribute{{ IOSet }}\n *\n * CRIAttributes  ATTRIBUTE  ::= {\n *   ... -- add any locally defined attributes here -- }\n *\n * Attribute { ATTRIBUTE:IOSet } ::= SEQUENCE {\n *   type   ATTRIBUTE.&id({IOSet}),\n *   values SET SIZE(1..MAX) OF ATTRIBUTE.&Type({IOSet}{@type})\n * }\n *\n * CertificationRequest ::= SEQUENCE {\n *   certificationRequestInfo CertificationRequestInfo,\n *   signatureAlgorithm AlgorithmIdentifier{{ SignatureAlgorithms }},\n *   signature          BIT STRING\n * }\n */\nvar forge = require('./forge');\nrequire('./aes');\nrequire('./asn1');\nrequire('./des');\nrequire('./md');\nrequire('./mgf');\nrequire('./oids');\nrequire('./pem');\nrequire('./pss');\nrequire('./rsa');\nrequire('./util');\n\n// shortcut for asn.1 API\nvar asn1 = forge.asn1;\n\n/* Public Key Infrastructure (PKI) implementation. */\nvar pki = module.exports = forge.pki = forge.pki || {};\nvar oids = pki.oids;\n\n// short name OID mappings\nvar _shortNames = {};\n_shortNames['CN'] = oids['commonName'];\n_shortNames['commonName'] = 'CN';\n_shortNames['C'] = oids['countryName'];\n_shortNames['countryName'] = 'C';\n_shortNames['L'] = oids['localityName'];\n_shortNames['localityName'] = 'L';\n_shortNames['ST'] = oids['stateOrProvinceName'];\n_shortNames['stateOrProvinceName'] = 'ST';\n_shortNames['O'] = oids['organizationName'];\n_shortNames['organizationName'] = 'O';\n_shortNames['OU'] = oids['organizationalUnitName'];\n_shortNames['organizationalUnitName'] = 'OU';\n_shortNames['E'] = oids['emailAddress'];\n_shortNames['emailAddress'] = 'E';\n\n// validator for an SubjectPublicKeyInfo structure\n// Note: Currently only works with an RSA public key\nvar publicKeyValidator = forge.pki.rsa.publicKeyValidator;\n\n// validator for an X.509v3 certificate\nvar x509CertificateValidator = {\n  name: 'Certificate',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'Certificate.TBSCertificate',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    captureAsn1: 'tbsCertificate',\n    value: [{\n      name: 'Certificate.TBSCertificate.version',\n      tagClass: asn1.Class.CONTEXT_SPECIFIC,\n      type: 0,\n      constructed: true,\n      optional: true,\n      value: [{\n        name: 'Certificate.TBSCertificate.version.integer',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.INTEGER,\n        constructed: false,\n        capture: 'certVersion'\n      }]\n    }, {\n      name: 'Certificate.TBSCertificate.serialNumber',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.INTEGER,\n      constructed: false,\n      capture: 'certSerialNumber'\n    }, {\n      name: 'Certificate.TBSCertificate.signature',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      value: [{\n        name: 'Certificate.TBSCertificate.signature.algorithm',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.OID,\n        constructed: false,\n        capture: 'certinfoSignatureOid'\n      }, {\n        name: 'Certificate.TBSCertificate.signature.parameters',\n        tagClass: asn1.Class.UNIVERSAL,\n        optional: true,\n        captureAsn1: 'certinfoSignatureParams'\n      }]\n    }, {\n      name: 'Certificate.TBSCertificate.issuer',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      captureAsn1: 'certIssuer'\n    }, {\n      name: 'Certificate.TBSCertificate.validity',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      // Note: UTC and generalized times may both appear so the capture\n      // names are based on their detected order, the names used below\n      // are only for the common case, which validity time really means\n      // \"notBefore\" and which means \"notAfter\" will be determined by order\n      value: [{\n        // notBefore (Time) (UTC time case)\n        name: 'Certificate.TBSCertificate.validity.notBefore (utc)',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.UTCTIME,\n        constructed: false,\n        optional: true,\n        capture: 'certValidity1UTCTime'\n      }, {\n        // notBefore (Time) (generalized time case)\n        name: 'Certificate.TBSCertificate.validity.notBefore (generalized)',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.GENERALIZEDTIME,\n        constructed: false,\n        optional: true,\n        capture: 'certValidity2GeneralizedTime'\n      }, {\n        // notAfter (Time) (only UTC time is supported)\n        name: 'Certificate.TBSCertificate.validity.notAfter (utc)',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.UTCTIME,\n        constructed: false,\n        optional: true,\n        capture: 'certValidity3UTCTime'\n      }, {\n        // notAfter (Time) (only UTC time is supported)\n        name: 'Certificate.TBSCertificate.validity.notAfter (generalized)',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.GENERALIZEDTIME,\n        constructed: false,\n        optional: true,\n        capture: 'certValidity4GeneralizedTime'\n      }]\n    }, {\n      // Name (subject) (RDNSequence)\n      name: 'Certificate.TBSCertificate.subject',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      captureAsn1: 'certSubject'\n    },\n    // SubjectPublicKeyInfo\n    publicKeyValidator,\n    {\n      // issuerUniqueID (optional)\n      name: 'Certificate.TBSCertificate.issuerUniqueID',\n      tagClass: asn1.Class.CONTEXT_SPECIFIC,\n      type: 1,\n      constructed: true,\n      optional: true,\n      value: [{\n        name: 'Certificate.TBSCertificate.issuerUniqueID.id',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.BITSTRING,\n        constructed: false,\n        // TODO: support arbitrary bit length ids\n        captureBitStringValue: 'certIssuerUniqueId'\n      }]\n    }, {\n      // subjectUniqueID (optional)\n      name: 'Certificate.TBSCertificate.subjectUniqueID',\n      tagClass: asn1.Class.CONTEXT_SPECIFIC,\n      type: 2,\n      constructed: true,\n      optional: true,\n      value: [{\n        name: 'Certificate.TBSCertificate.subjectUniqueID.id',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.BITSTRING,\n        constructed: false,\n        // TODO: support arbitrary bit length ids\n        captureBitStringValue: 'certSubjectUniqueId'\n      }]\n    }, {\n      // Extensions (optional)\n      name: 'Certificate.TBSCertificate.extensions',\n      tagClass: asn1.Class.CONTEXT_SPECIFIC,\n      type: 3,\n      constructed: true,\n      captureAsn1: 'certExtensions',\n      optional: true\n    }]\n  }, {\n    // AlgorithmIdentifier (signature algorithm)\n    name: 'Certificate.signatureAlgorithm',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    value: [{\n      // algorithm\n      name: 'Certificate.signatureAlgorithm.algorithm',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.OID,\n      constructed: false,\n      capture: 'certSignatureOid'\n    }, {\n      name: 'Certificate.TBSCertificate.signature.parameters',\n      tagClass: asn1.Class.UNIVERSAL,\n      optional: true,\n      captureAsn1: 'certSignatureParams'\n    }]\n  }, {\n    // SignatureValue\n    name: 'Certificate.signatureValue',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.BITSTRING,\n    constructed: false,\n    captureBitStringValue: 'certSignature'\n  }]\n};\n\nvar rsassaPssParameterValidator = {\n  name: 'rsapss',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  value: [{\n    name: 'rsapss.hashAlgorithm',\n    tagClass: asn1.Class.CONTEXT_SPECIFIC,\n    type: 0,\n    constructed: true,\n    value: [{\n      name: 'rsapss.hashAlgorithm.AlgorithmIdentifier',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Class.SEQUENCE,\n      constructed: true,\n      optional: true,\n      value: [{\n        name: 'rsapss.hashAlgorithm.AlgorithmIdentifier.algorithm',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.OID,\n        constructed: false,\n        capture: 'hashOid'\n        /* parameter block omitted, for SHA1 NULL anyhow. */\n      }]\n    }]\n  }, {\n    name: 'rsapss.maskGenAlgorithm',\n    tagClass: asn1.Class.CONTEXT_SPECIFIC,\n    type: 1,\n    constructed: true,\n    value: [{\n      name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Class.SEQUENCE,\n      constructed: true,\n      optional: true,\n      value: [{\n        name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier.algorithm',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.OID,\n        constructed: false,\n        capture: 'maskGenOid'\n      }, {\n        name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier.params',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.SEQUENCE,\n        constructed: true,\n        value: [{\n          name: 'rsapss.maskGenAlgorithm.AlgorithmIdentifier.params.algorithm',\n          tagClass: asn1.Class.UNIVERSAL,\n          type: asn1.Type.OID,\n          constructed: false,\n          capture: 'maskGenHashOid'\n          /* parameter block omitted, for SHA1 NULL anyhow. */\n        }]\n      }]\n    }]\n  }, {\n    name: 'rsapss.saltLength',\n    tagClass: asn1.Class.CONTEXT_SPECIFIC,\n    type: 2,\n    optional: true,\n    value: [{\n      name: 'rsapss.saltLength.saltLength',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Class.INTEGER,\n      constructed: false,\n      capture: 'saltLength'\n    }]\n  }, {\n    name: 'rsapss.trailerField',\n    tagClass: asn1.Class.CONTEXT_SPECIFIC,\n    type: 3,\n    optional: true,\n    value: [{\n      name: 'rsapss.trailer.trailer',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Class.INTEGER,\n      constructed: false,\n      capture: 'trailer'\n    }]\n  }]\n};\n\n// validator for a CertificationRequestInfo structure\nvar certificationRequestInfoValidator = {\n  name: 'CertificationRequestInfo',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  captureAsn1: 'certificationRequestInfo',\n  value: [{\n    name: 'CertificationRequestInfo.integer',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.INTEGER,\n    constructed: false,\n    capture: 'certificationRequestInfoVersion'\n  }, {\n    // Name (subject) (RDNSequence)\n    name: 'CertificationRequestInfo.subject',\n    tagClass: asn1.Class.UNIVERSAL,\n    type: asn1.Type.SEQUENCE,\n    constructed: true,\n    captureAsn1: 'certificationRequestInfoSubject'\n  },\n  // SubjectPublicKeyInfo\n  publicKeyValidator,\n  {\n    name: 'CertificationRequestInfo.attributes',\n    tagClass: asn1.Class.CONTEXT_SPECIFIC,\n    type: 0,\n    constructed: true,\n    optional: true,\n    capture: 'certificationRequestInfoAttributes',\n    value: [{\n      name: 'CertificationRequestInfo.attributes',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      value: [{\n        name: 'CertificationRequestInfo.attributes.type',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.OID,\n        constructed: false\n      }, {\n        name: 'CertificationRequestInfo.attributes.value',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.SET,\n        constructed: true\n      }]\n    }]\n  }]\n};\n\n// validator for a CertificationRequest structure\nvar certificationRequestValidator = {\n  name: 'CertificationRequest',\n  tagClass: asn1.Class.UNIVERSAL,\n  type: asn1.Type.SEQUENCE,\n  constructed: true,\n  captureAsn1: 'csr',\n  value: [\n    certificationRequestInfoValidator, {\n      // AlgorithmIdentifier (signature algorithm)\n      name: 'CertificationRequest.signatureAlgorithm',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.SEQUENCE,\n      constructed: true,\n      value: [{\n        // algorithm\n        name: 'CertificationRequest.signatureAlgorithm.algorithm',\n        tagClass: asn1.Class.UNIVERSAL,\n        type: asn1.Type.OID,\n        constructed: false,\n        capture: 'csrSignatureOid'\n      }, {\n        name: 'CertificationRequest.signatureAlgorithm.parameters',\n        tagClass: asn1.Class.UNIVERSAL,\n        optional: true,\n        captureAsn1: 'csrSignatureParams'\n      }]\n    }, {\n      // signature\n      name: 'CertificationRequest.signature',\n      tagClass: asn1.Class.UNIVERSAL,\n      type: asn1.Type.BITSTRING,\n      constructed: false,\n      captureBitStringValue: 'csrSignature'\n    }\n  ]\n};\n\n/**\n * Converts an RDNSequence of ASN.1 DER-encoded RelativeDistinguishedName\n * sets into an array with objects that have type and value properties.\n *\n * @param rdn the RDNSequence to convert.\n * @param md a message digest to append type and value to if provided.\n */\npki.RDNAttributesAsArray = function(rdn, md) {\n  var rval = [];\n\n  // each value in 'rdn' in is a SET of RelativeDistinguishedName\n  var set, attr, obj;\n  for(var si = 0; si < rdn.value.length; ++si) {\n    // get the RelativeDistinguishedName set\n    set = rdn.value[si];\n\n    // each value in the SET is an AttributeTypeAndValue sequence\n    // containing first a type (an OID) and second a value (defined by\n    // the OID)\n    for(var i = 0; i < set.value.length; ++i) {\n      obj = {};\n      attr = set.value[i];\n      obj.type = asn1.derToOid(attr.value[0].value);\n      obj.value = attr.value[1].value;\n      obj.valueTagClass = attr.value[1].type;\n      // if the OID is known, get its name and short name\n      if(obj.type in oids) {\n        obj.name = oids[obj.type];\n        if(obj.name in _shortNames) {\n          obj.shortName = _shortNames[obj.name];\n        }\n      }\n      if(md) {\n        md.update(obj.type);\n        md.update(obj.value);\n      }\n      rval.push(obj);\n    }\n  }\n\n  return rval;\n};\n\n/**\n * Converts ASN.1 CRIAttributes into an array with objects that have type and\n * value properties.\n *\n * @param attributes the CRIAttributes to convert.\n */\npki.CRIAttributesAsArray = function(attributes) {\n  var rval = [];\n\n  // each value in 'attributes' in is a SEQUENCE with an OID and a SET\n  for(var si = 0; si < attributes.length; ++si) {\n    // get the attribute sequence\n    var seq = attributes[si];\n\n    // each value in the SEQUENCE containing first a type (an OID) and\n    // second a set of values (defined by the OID)\n    var type = asn1.derToOid(seq.value[0].value);\n    var values = seq.value[1].value;\n    for(var vi = 0; vi < values.length; ++vi) {\n      var obj = {};\n      obj.type = type;\n      obj.value = values[vi].value;\n      obj.valueTagClass = values[vi].type;\n      // if the OID is known, get its name and short name\n      if(obj.type in oids) {\n        obj.name = oids[obj.type];\n        if(obj.name in _shortNames) {\n          obj.shortName = _shortNames[obj.name];\n        }\n      }\n      // parse extensions\n      if(obj.type === oids.extensionRequest) {\n        obj.extensions = [];\n        for(var ei = 0; ei < obj.value.length; ++ei) {\n          obj.extensions.push(pki.certificateExtensionFromAsn1(obj.value[ei]));\n        }\n      }\n      rval.push(obj);\n    }\n  }\n\n  return rval;\n};\n\n/**\n * Gets an issuer or subject attribute from its name, type, or short name.\n *\n * @param obj the issuer or subject object.\n * @param options a short name string or an object with:\n *          shortName the short name for the attribute.\n *          name the name for the attribute.\n *          type the type for the attribute.\n *\n * @return the attribute.\n */\nfunction _getAttribute(obj, options) {\n  if(typeof options === 'string') {\n    options = {shortName: options};\n  }\n\n  var rval = null;\n  var attr;\n  for(var i = 0; rval === null && i < obj.attributes.length; ++i) {\n    attr = obj.attributes[i];\n    if(options.type && options.type === attr.type) {\n      rval = attr;\n    } else if(options.name && options.name === attr.name) {\n      rval = attr;\n    } else if(options.shortName && options.shortName === attr.shortName) {\n      rval = attr;\n    }\n  }\n  return rval;\n}\n\n/**\n * Converts signature parameters from ASN.1 structure.\n *\n * Currently only RSASSA-PSS supported.  The PKCS#1 v1.5 signature scheme had\n * no parameters.\n *\n * RSASSA-PSS-params  ::=  SEQUENCE  {\n *   hashAlgorithm      [0] HashAlgorithm DEFAULT\n *                             sha1Identifier,\n *   maskGenAlgorithm   [1] MaskGenAlgorithm DEFAULT\n *                             mgf1SHA1Identifier,\n *   saltLength         [2] INTEGER DEFAULT 20,\n *   trailerField       [3] INTEGER DEFAULT 1\n * }\n *\n * HashAlgorithm  ::=  AlgorithmIdentifier\n *\n * MaskGenAlgorithm  ::=  AlgorithmIdentifier\n *\n * AlgorithmIdentifer ::= SEQUENCE {\n *   algorithm OBJECT IDENTIFIER,\n *   parameters ANY DEFINED BY algorithm OPTIONAL\n * }\n *\n * @param oid The OID specifying the signature algorithm\n * @param obj The ASN.1 structure holding the parameters\n * @param fillDefaults Whether to use return default values where omitted\n * @return signature parameter object\n */\nvar _readSignatureParameters = function(oid, obj, fillDefaults) {\n  var params = {};\n\n  if(oid !== oids['RSASSA-PSS']) {\n    return params;\n  }\n\n  if(fillDefaults) {\n    params = {\n      hash: {\n        algorithmOid: oids['sha1']\n      },\n      mgf: {\n        algorithmOid: oids['mgf1'],\n        hash: {\n          algorithmOid: oids['sha1']\n        }\n      },\n      saltLength: 20\n    };\n  }\n\n  var capture = {};\n  var errors = [];\n  if(!asn1.validate(obj, rsassaPssParameterValidator, capture, errors)) {\n    var error = new Error('Cannot read RSASSA-PSS parameter block.');\n    error.errors = errors;\n    throw error;\n  }\n\n  if(capture.hashOid !== undefined) {\n    params.hash = params.hash || {};\n    params.hash.algorithmOid = asn1.derToOid(capture.hashOid);\n  }\n\n  if(capture.maskGenOid !== undefined) {\n    params.mgf = params.mgf || {};\n    params.mgf.algorithmOid = asn1.derToOid(capture.maskGenOid);\n    params.mgf.hash = params.mgf.hash || {};\n    params.mgf.hash.algorithmOid = asn1.derToOid(capture.maskGenHashOid);\n  }\n\n  if(capture.saltLength !== undefined) {\n    params.saltLength = capture.saltLength.charCodeAt(0);\n  }\n\n  return params;\n};\n\n/**\n * Converts an X.509 certificate from PEM format.\n *\n * Note: If the certificate is to be verified then compute hash should\n * be set to true. This will scan the TBSCertificate part of the ASN.1\n * object while it is converted so it doesn't need to be converted back\n * to ASN.1-DER-encoding later.\n *\n * @param pem the PEM-formatted certificate.\n * @param computeHash true to compute the hash for verification.\n * @param strict true to be strict when checking ASN.1 value lengths, false to\n *          allow truncated values (default: true).\n *\n * @return the certificate.\n */\npki.certificateFromPem = function(pem, computeHash, strict) {\n  var msg = forge.pem.decode(pem)[0];\n\n  if(msg.type !== 'CERTIFICATE' &&\n    msg.type !== 'X509 CERTIFICATE' &&\n    msg.type !== 'TRUSTED CERTIFICATE') {\n    var error = new Error(\n      'Could not convert certificate from PEM; PEM header type ' +\n      'is not \"CERTIFICATE\", \"X509 CERTIFICATE\", or \"TRUSTED CERTIFICATE\".');\n    error.headerType = msg.type;\n    throw error;\n  }\n  if(msg.procType && msg.procType.type === 'ENCRYPTED') {\n    throw new Error(\n      'Could not convert certificate from PEM; PEM is encrypted.');\n  }\n\n  // convert DER to ASN.1 object\n  var obj = asn1.fromDer(msg.body, strict);\n\n  return pki.certificateFromAsn1(obj, computeHash);\n};\n\n/**\n * Converts an X.509 certificate to PEM format.\n *\n * @param cert the certificate.\n * @param maxline the maximum characters per line, defaults to 64.\n *\n * @return the PEM-formatted certificate.\n */\npki.certificateToPem = function(cert, maxline) {\n  // convert to ASN.1, then DER, then PEM-encode\n  var msg = {\n    type: 'CERTIFICATE',\n    body: asn1.toDer(pki.certificateToAsn1(cert)).getBytes()\n  };\n  return forge.pem.encode(msg, {maxline: maxline});\n};\n\n/**\n * Converts an RSA public key from PEM format.\n *\n * @param pem the PEM-formatted public key.\n *\n * @return the public key.\n */\npki.publicKeyFromPem = function(pem) {\n  var msg = forge.pem.decode(pem)[0];\n\n  if(msg.type !== 'PUBLIC KEY' && msg.type !== 'RSA PUBLIC KEY') {\n    var error = new Error('Could not convert public key from PEM; PEM header ' +\n      'type is not \"PUBLIC KEY\" or \"RSA PUBLIC KEY\".');\n    error.headerType = msg.type;\n    throw error;\n  }\n  if(msg.procType && msg.procType.type === 'ENCRYPTED') {\n    throw new Error('Could not convert public key from PEM; PEM is encrypted.');\n  }\n\n  // convert DER to ASN.1 object\n  var obj = asn1.fromDer(msg.body);\n\n  return pki.publicKeyFromAsn1(obj);\n};\n\n/**\n * Converts an RSA public key to PEM format (using a SubjectPublicKeyInfo).\n *\n * @param key the public key.\n * @param maxline the maximum characters per line, defaults to 64.\n *\n * @return the PEM-formatted public key.\n */\npki.publicKeyToPem = function(key, maxline) {\n  // convert to ASN.1, then DER, then PEM-encode\n  var msg = {\n    type: 'PUBLIC KEY',\n    body: asn1.toDer(pki.publicKeyToAsn1(key)).getBytes()\n  };\n  return forge.pem.encode(msg, {maxline: maxline});\n};\n\n/**\n * Converts an RSA public key to PEM format (using an RSAPublicKey).\n *\n * @param key the public key.\n * @param maxline the maximum characters per line, defaults to 64.\n *\n * @return the PEM-formatted public key.\n */\npki.publicKeyToRSAPublicKeyPem = function(key, maxline) {\n  // convert to ASN.1, then DER, then PEM-encode\n  var msg = {\n    type: 'RSA PUBLIC KEY',\n    body: asn1.toDer(pki.publicKeyToRSAPublicKey(key)).getBytes()\n  };\n  return forge.pem.encode(msg, {maxline: maxline});\n};\n\n/**\n * Gets a fingerprint for the given public key.\n *\n * @param options the options to use.\n *          [md] the message digest object to use (defaults to forge.md.sha1).\n *          [type] the type of fingerprint, such as 'RSAPublicKey',\n *            'SubjectPublicKeyInfo' (defaults to 'RSAPublicKey').\n *          [encoding] an alternative output encoding, such as 'hex'\n *            (defaults to none, outputs a byte buffer).\n *          [delimiter] the delimiter to use between bytes for 'hex' encoded\n *            output, eg: ':' (defaults to none).\n *\n * @return the fingerprint as a byte buffer or other encoding based on options.\n */\npki.getPublicKeyFingerprint = function(key, options) {\n  options = options || {};\n  var md = options.md || forge.md.sha1.create();\n  var type = options.type || 'RSAPublicKey';\n\n  var bytes;\n  switch(type) {\n    case 'RSAPublicKey':\n      bytes = asn1.toDer(pki.publicKeyToRSAPublicKey(key)).getBytes();\n      break;\n    case 'SubjectPublicKeyInfo':\n      bytes = asn1.toDer(pki.publicKeyToAsn1(key)).getBytes();\n      break;\n    default:\n      throw new Error('Unknown fingerprint type \"' + options.type + '\".');\n  }\n\n  // hash public key bytes\n  md.start();\n  md.update(bytes);\n  var digest = md.digest();\n  if(options.encoding === 'hex') {\n    var hex = digest.toHex();\n    if(options.delimiter) {\n      return hex.match(/.{2}/g).join(options.delimiter);\n    }\n    return hex;\n  } else if(options.encoding === 'binary') {\n    return digest.getBytes();\n  } else if(options.encoding) {\n    throw new Error('Unknown encoding \"' + options.encoding + '\".');\n  }\n  return digest;\n};\n\n/**\n * Converts a PKCS#10 certification request (CSR) from PEM format.\n *\n * Note: If the certification request is to be verified then compute hash\n * should be set to true. This will scan the CertificationRequestInfo part of\n * the ASN.1 object while it is converted so it doesn't need to be converted\n * back to ASN.1-DER-encoding later.\n *\n * @param pem the PEM-formatted certificate.\n * @param computeHash true to compute the hash for verification.\n * @param strict true to be strict when checking ASN.1 value lengths, false to\n *          allow truncated values (default: true).\n *\n * @return the certification request (CSR).\n */\npki.certificationRequestFromPem = function(pem, computeHash, strict) {\n  var msg = forge.pem.decode(pem)[0];\n\n  if(msg.type !== 'CERTIFICATE REQUEST') {\n    var error = new Error('Could not convert certification request from PEM; ' +\n      'PEM header type is not \"CERTIFICATE REQUEST\".');\n    error.headerType = msg.type;\n    throw error;\n  }\n  if(msg.procType && msg.procType.type === 'ENCRYPTED') {\n    throw new Error('Could not convert certification request from PEM; ' +\n      'PEM is encrypted.');\n  }\n\n  // convert DER to ASN.1 object\n  var obj = asn1.fromDer(msg.body, strict);\n\n  return pki.certificationRequestFromAsn1(obj, computeHash);\n};\n\n/**\n * Converts a PKCS#10 certification request (CSR) to PEM format.\n *\n * @param csr the certification request.\n * @param maxline the maximum characters per line, defaults to 64.\n *\n * @return the PEM-formatted certification request.\n */\npki.certificationRequestToPem = function(csr, maxline) {\n  // convert to ASN.1, then DER, then PEM-encode\n  var msg = {\n    type: 'CERTIFICATE REQUEST',\n    body: asn1.toDer(pki.certificationRequestToAsn1(csr)).getBytes()\n  };\n  return forge.pem.encode(msg, {maxline: maxline});\n};\n\n/**\n * Creates an empty X.509v3 RSA certificate.\n *\n * @return the certificate.\n */\npki.createCertificate = function() {\n  var cert = {};\n  cert.version = 0x02;\n  cert.serialNumber = '00';\n  cert.signatureOid = null;\n  cert.signature = null;\n  cert.siginfo = {};\n  cert.siginfo.algorithmOid = null;\n  cert.validity = {};\n  cert.validity.notBefore = new Date();\n  cert.validity.notAfter = new Date();\n\n  cert.issuer = {};\n  cert.issuer.getField = function(sn) {\n    return _getAttribute(cert.issuer, sn);\n  };\n  cert.issuer.addField = function(attr) {\n    _fillMissingFields([attr]);\n    cert.issuer.attributes.push(attr);\n  };\n  cert.issuer.attributes = [];\n  cert.issuer.hash = null;\n\n  cert.subject = {};\n  cert.subject.getField = function(sn) {\n    return _getAttribute(cert.subject, sn);\n  };\n  cert.subject.addField = function(attr) {\n    _fillMissingFields([attr]);\n    cert.subject.attributes.push(attr);\n  };\n  cert.subject.attributes = [];\n  cert.subject.hash = null;\n\n  cert.extensions = [];\n  cert.publicKey = null;\n  cert.md = null;\n\n  /**\n   * Sets the subject of this certificate.\n   *\n   * @param attrs the array of subject attributes to use.\n   * @param uniqueId an optional a unique ID to use.\n   */\n  cert.setSubject = function(attrs, uniqueId) {\n    // set new attributes, clear hash\n    _fillMissingFields(attrs);\n    cert.subject.attributes = attrs;\n    delete cert.subject.uniqueId;\n    if(uniqueId) {\n      // TODO: support arbitrary bit length ids\n      cert.subject.uniqueId = uniqueId;\n    }\n    cert.subject.hash = null;\n  };\n\n  /**\n   * Sets the issuer of this certificate.\n   *\n   * @param attrs the array of issuer attributes to use.\n   * @param uniqueId an optional a unique ID to use.\n   */\n  cert.setIssuer = function(attrs, uniqueId) {\n    // set new attributes, clear hash\n    _fillMissingFields(attrs);\n    cert.issuer.attributes = attrs;\n    delete cert.issuer.uniqueId;\n    if(uniqueId) {\n      // TODO: support arbitrary bit length ids\n      cert.issuer.uniqueId = uniqueId;\n    }\n    cert.issuer.hash = null;\n  };\n\n  /**\n   * Sets the extensions of this certificate.\n   *\n   * @param exts the array of extensions to use.\n   */\n  cert.setExtensions = function(exts) {\n    for(var i = 0; i < exts.length; ++i) {\n      _fillMissingExtensionFields(exts[i], {cert: cert});\n    }\n    // set new extensions\n    cert.extensions = exts;\n  };\n\n  /**\n   * Gets an extension by its name or id.\n   *\n   * @param options the name to use or an object with:\n   *          name the name to use.\n   *          id the id to use.\n   *\n   * @return the extension or null if not found.\n   */\n  cert.getExtension = function(options) {\n    if(typeof options === 'string') {\n      options = {name: options};\n    }\n\n    var rval = null;\n    var ext;\n    for(var i = 0; rval === null && i < cert.extensions.length; ++i) {\n      ext = cert.extensions[i];\n      if(options.id && ext.id === options.id) {\n        rval = ext;\n      } else if(options.name && ext.name === options.name) {\n        rval = ext;\n      }\n    }\n    return rval;\n  };\n\n  /**\n   * Signs this certificate using the given private key.\n   *\n   * @param key the private key to sign with.\n   * @param md the message digest object to use (defaults to forge.md.sha1).\n   */\n  cert.sign = function(key, md) {\n    // TODO: get signature OID from private key\n    cert.md = md || forge.md.sha1.create();\n    var algorithmOid = oids[cert.md.algorithm + 'WithRSAEncryption'];\n    if(!algorithmOid) {\n      var error = new Error('Could not compute certificate digest. ' +\n        'Unknown message digest algorithm OID.');\n      error.algorithm = cert.md.algorithm;\n      throw error;\n    }\n    cert.signatureOid = cert.siginfo.algorithmOid = algorithmOid;\n\n    // get TBSCertificate, convert to DER\n    cert.tbsCertificate = pki.getTBSCertificate(cert);\n    var bytes = asn1.toDer(cert.tbsCertificate);\n\n    // digest and sign\n    cert.md.update(bytes.getBytes());\n    cert.signature = key.sign(cert.md);\n  };\n\n  /**\n   * Attempts verify the signature on the passed certificate using this\n   * certificate's public key.\n   *\n   * @param child the certificate to verify.\n   *\n   * @return true if verified, false if not.\n   */\n  cert.verify = function(child) {\n    var rval = false;\n\n    if(!cert.issued(child)) {\n      var issuer = child.issuer;\n      var subject = cert.subject;\n      var error = new Error(\n        'The parent certificate did not issue the given child ' +\n        'certificate; the child certificate\\'s issuer does not match the ' +\n        'parent\\'s subject.');\n      error.expectedIssuer = issuer.attributes;\n      error.actualIssuer = subject.attributes;\n      throw error;\n    }\n\n    var md = child.md;\n    if(md === null) {\n      // check signature OID for supported signature types\n      if(child.signatureOid in oids) {\n        var oid = oids[child.signatureOid];\n        switch(oid) {\n          case 'sha1WithRSAEncryption':\n            md = forge.md.sha1.create();\n            break;\n          case 'md5WithRSAEncryption':\n            md = forge.md.md5.create();\n            break;\n          case 'sha256WithRSAEncryption':\n            md = forge.md.sha256.create();\n            break;\n          case 'sha384WithRSAEncryption':\n            md = forge.md.sha384.create();\n            break;\n          case 'sha512WithRSAEncryption':\n            md = forge.md.sha512.create();\n            break;\n          case 'RSASSA-PSS':\n            md = forge.md.sha256.create();\n            break;\n        }\n      }\n      if(md === null) {\n        var error = new Error('Could not compute certificate digest. ' +\n          'Unknown signature OID.');\n        error.signatureOid = child.signatureOid;\n        throw error;\n      }\n\n      // produce DER formatted TBSCertificate and digest it\n      var tbsCertificate = child.tbsCertificate || pki.getTBSCertificate(child);\n      var bytes = asn1.toDer(tbsCertificate);\n      md.update(bytes.getBytes());\n    }\n\n    if(md !== null) {\n      var scheme;\n\n      switch(child.signatureOid) {\n        case oids.sha1WithRSAEncryption:\n          scheme = undefined; /* use PKCS#1 v1.5 padding scheme */\n          break;\n        case oids['RSASSA-PSS']:\n          var hash, mgf;\n\n          /* initialize mgf */\n          hash = oids[child.signatureParameters.mgf.hash.algorithmOid];\n          if(hash === undefined || forge.md[hash] === undefined) {\n            var error = new Error('Unsupported MGF hash function.');\n            error.oid = child.signatureParameters.mgf.hash.algorithmOid;\n            error.name = hash;\n            throw error;\n          }\n\n          mgf = oids[child.signatureParameters.mgf.algorithmOid];\n          if(mgf === undefined || forge.mgf[mgf] === undefined) {\n            var error = new Error('Unsupported MGF function.');\n            error.oid = child.signatureParameters.mgf.algorithmOid;\n            error.name = mgf;\n            throw error;\n          }\n\n          mgf = forge.mgf[mgf].create(forge.md[hash].create());\n\n          /* initialize hash function */\n          hash = oids[child.signatureParameters.hash.algorithmOid];\n          if(hash === undefined || forge.md[hash] === undefined) {\n            throw {\n              message: 'Unsupported RSASSA-PSS hash function.',\n              oid: child.signatureParameters.hash.algorithmOid,\n              name: hash\n            };\n          }\n\n          scheme = forge.pss.create(forge.md[hash].create(), mgf,\n            child.signatureParameters.saltLength);\n          break;\n      }\n\n      // verify signature on cert using public key\n      rval = cert.publicKey.verify(\n        md.digest().getBytes(), child.signature, scheme);\n    }\n\n    return rval;\n  };\n\n  /**\n   * Returns true if this certificate's issuer matches the passed\n   * certificate's subject. Note that no signature check is performed.\n   *\n   * @param parent the certificate to check.\n   *\n   * @return true if this certificate's issuer matches the passed certificate's\n   *         subject.\n   */\n  cert.isIssuer = function(parent) {\n    var rval = false;\n\n    var i = cert.issuer;\n    var s = parent.subject;\n\n    // compare hashes if present\n    if(i.hash && s.hash) {\n      rval = (i.hash === s.hash);\n    } else if(i.attributes.length === s.attributes.length) {\n      // all attributes are the same so issuer matches subject\n      rval = true;\n      var iattr, sattr;\n      for(var n = 0; rval && n < i.attributes.length; ++n) {\n        iattr = i.attributes[n];\n        sattr = s.attributes[n];\n        if(iattr.type !== sattr.type || iattr.value !== sattr.value) {\n          // attribute mismatch\n          rval = false;\n        }\n      }\n    }\n\n    return rval;\n  };\n\n  /**\n   * Returns true if this certificate's subject matches the issuer of the\n   * given certificate). Note that not signature check is performed.\n   *\n   * @param child the certificate to check.\n   *\n   * @return true if this certificate's subject matches the passed\n   *         certificate's issuer.\n   */\n  cert.issued = function(child) {\n    return child.isIssuer(cert);\n  };\n\n  /**\n   * Generates the subjectKeyIdentifier for this certificate as byte buffer.\n   *\n   * @return the subjectKeyIdentifier for this certificate as byte buffer.\n   */\n  cert.generateSubjectKeyIdentifier = function() {\n    /* See: 4.2.1.2 section of the the RFC3280, keyIdentifier is either:\n\n      (1) The keyIdentifier is composed of the 160-bit SHA-1 hash of the\n        value of the BIT STRING subjectPublicKey (excluding the tag,\n        length, and number of unused bits).\n\n      (2) The keyIdentifier is composed of a four bit type field with\n        the value 0100 followed by the least significant 60 bits of the\n        SHA-1 hash of the value of the BIT STRING subjectPublicKey\n        (excluding the tag, length, and number of unused bit string bits).\n    */\n\n    // skipping the tag, length, and number of unused bits is the same\n    // as just using the RSAPublicKey (for RSA keys, which are the\n    // only ones supported)\n    return pki.getPublicKeyFingerprint(cert.publicKey, {type: 'RSAPublicKey'});\n  };\n\n  /**\n   * Verifies the subjectKeyIdentifier extension value for this certificate\n   * against its public key. If no extension is found, false will be\n   * returned.\n   *\n   * @return true if verified, false if not.\n   */\n  cert.verifySubjectKeyIdentifier = function() {\n    var oid = oids['subjectKeyIdentifier'];\n    for(var i = 0; i < cert.extensions.length; ++i) {\n      var ext = cert.extensions[i];\n      if(ext.id === oid) {\n        var ski = cert.generateSubjectKeyIdentifier().getBytes();\n        return (forge.util.hexToBytes(ext.subjectKeyIdentifier) === ski);\n      }\n    }\n    return false;\n  };\n\n  return cert;\n};\n\n/**\n * Converts an X.509v3 RSA certificate from an ASN.1 object.\n *\n * Note: If the certificate is to be verified then compute hash should\n * be set to true. There is currently no implementation for converting\n * a certificate back to ASN.1 so the TBSCertificate part of the ASN.1\n * object needs to be scanned before the cert object is created.\n *\n * @param obj the asn1 representation of an X.509v3 RSA certificate.\n * @param computeHash true to compute the hash for verification.\n *\n * @return the certificate.\n */\npki.certificateFromAsn1 = function(obj, computeHash) {\n  // validate certificate and capture data\n  var capture = {};\n  var errors = [];\n  if(!asn1.validate(obj, x509CertificateValidator, capture, errors)) {\n    var error = new Error('Cannot read X.509 certificate. ' +\n      'ASN.1 object is not an X509v3 Certificate.');\n    error.errors = errors;\n    throw error;\n  }\n\n  // get oid\n  var oid = asn1.derToOid(capture.publicKeyOid);\n  if(oid !== pki.oids.rsaEncryption) {\n    throw new Error('Cannot read public key. OID is not RSA.');\n  }\n\n  // create certificate\n  var cert = pki.createCertificate();\n  cert.version = capture.certVersion ?\n    capture.certVersion.charCodeAt(0) : 0;\n  var serial = forge.util.createBuffer(capture.certSerialNumber);\n  cert.serialNumber = serial.toHex();\n  cert.signatureOid = forge.asn1.derToOid(capture.certSignatureOid);\n  cert.signatureParameters = _readSignatureParameters(\n    cert.signatureOid, capture.certSignatureParams, true);\n  cert.siginfo.algorithmOid = forge.asn1.derToOid(capture.certinfoSignatureOid);\n  cert.siginfo.parameters = _readSignatureParameters(cert.siginfo.algorithmOid,\n    capture.certinfoSignatureParams, false);\n  cert.signature = capture.certSignature;\n\n  var validity = [];\n  if(capture.certValidity1UTCTime !== undefined) {\n    validity.push(asn1.utcTimeToDate(capture.certValidity1UTCTime));\n  }\n  if(capture.certValidity2GeneralizedTime !== undefined) {\n    validity.push(asn1.generalizedTimeToDate(\n      capture.certValidity2GeneralizedTime));\n  }\n  if(capture.certValidity3UTCTime !== undefined) {\n    validity.push(asn1.utcTimeToDate(capture.certValidity3UTCTime));\n  }\n  if(capture.certValidity4GeneralizedTime !== undefined) {\n    validity.push(asn1.generalizedTimeToDate(\n      capture.certValidity4GeneralizedTime));\n  }\n  if(validity.length > 2) {\n    throw new Error('Cannot read notBefore/notAfter validity times; more ' +\n      'than two times were provided in the certificate.');\n  }\n  if(validity.length < 2) {\n    throw new Error('Cannot read notBefore/notAfter validity times; they ' +\n      'were not provided as either UTCTime or GeneralizedTime.');\n  }\n  cert.validity.notBefore = validity[0];\n  cert.validity.notAfter = validity[1];\n\n  // keep TBSCertificate to preserve signature when exporting\n  cert.tbsCertificate = capture.tbsCertificate;\n\n  if(computeHash) {\n    // check signature OID for supported signature types\n    cert.md = null;\n    if(cert.signatureOid in oids) {\n      var oid = oids[cert.signatureOid];\n      switch(oid) {\n        case 'sha1WithRSAEncryption':\n          cert.md = forge.md.sha1.create();\n          break;\n        case 'md5WithRSAEncryption':\n          cert.md = forge.md.md5.create();\n          break;\n        case 'sha256WithRSAEncryption':\n          cert.md = forge.md.sha256.create();\n          break;\n        case 'sha384WithRSAEncryption':\n          cert.md = forge.md.sha384.create();\n          break;\n        case 'sha512WithRSAEncryption':\n          cert.md = forge.md.sha512.create();\n          break;\n        case 'RSASSA-PSS':\n          cert.md = forge.md.sha256.create();\n          break;\n      }\n    }\n    if(cert.md === null) {\n      var error = new Error('Could not compute certificate digest. ' +\n        'Unknown signature OID.');\n      error.signatureOid = cert.signatureOid;\n      throw error;\n    }\n\n    // produce DER formatted TBSCertificate and digest it\n    var bytes = asn1.toDer(cert.tbsCertificate);\n    cert.md.update(bytes.getBytes());\n  }\n\n  // handle issuer, build issuer message digest\n  var imd = forge.md.sha1.create();\n  cert.issuer.getField = function(sn) {\n    return _getAttribute(cert.issuer, sn);\n  };\n  cert.issuer.addField = function(attr) {\n    _fillMissingFields([attr]);\n    cert.issuer.attributes.push(attr);\n  };\n  cert.issuer.attributes = pki.RDNAttributesAsArray(capture.certIssuer, imd);\n  if(capture.certIssuerUniqueId) {\n    cert.issuer.uniqueId = capture.certIssuerUniqueId;\n  }\n  cert.issuer.hash = imd.digest().toHex();\n\n  // handle subject, build subject message digest\n  var smd = forge.md.sha1.create();\n  cert.subject.getField = function(sn) {\n    return _getAttribute(cert.subject, sn);\n  };\n  cert.subject.addField = function(attr) {\n    _fillMissingFields([attr]);\n    cert.subject.attributes.push(attr);\n  };\n  cert.subject.attributes = pki.RDNAttributesAsArray(capture.certSubject, smd);\n  if(capture.certSubjectUniqueId) {\n    cert.subject.uniqueId = capture.certSubjectUniqueId;\n  }\n  cert.subject.hash = smd.digest().toHex();\n\n  // handle extensions\n  if(capture.certExtensions) {\n    cert.extensions = pki.certificateExtensionsFromAsn1(capture.certExtensions);\n  } else {\n    cert.extensions = [];\n  }\n\n  // convert RSA public key from ASN.1\n  cert.publicKey = pki.publicKeyFromAsn1(capture.subjectPublicKeyInfo);\n\n  return cert;\n};\n\n/**\n * Converts an ASN.1 extensions object (with extension sequences as its\n * values) into an array of extension objects with types and values.\n *\n * Supported extensions:\n *\n * id-ce-keyUsage OBJECT IDENTIFIER ::=  { id-ce 15 }\n * KeyUsage ::= BIT STRING {\n *   digitalSignature        (0),\n *   nonRepudiation          (1),\n *   keyEncipherment         (2),\n *   dataEncipherment        (3),\n *   keyAgreement            (4),\n *   keyCertSign             (5),\n *   cRLSign                 (6),\n *   encipherOnly            (7),\n *   decipherOnly            (8)\n * }\n *\n * id-ce-basicConstraints OBJECT IDENTIFIER ::=  { id-ce 19 }\n * BasicConstraints ::= SEQUENCE {\n *   cA                      BOOLEAN DEFAULT FALSE,\n *   pathLenConstraint       INTEGER (0..MAX) OPTIONAL\n * }\n *\n * subjectAltName EXTENSION ::= {\n *   SYNTAX GeneralNames\n *   IDENTIFIED BY id-ce-subjectAltName\n * }\n *\n * GeneralNames ::= SEQUENCE SIZE (1..MAX) OF GeneralName\n *\n * GeneralName ::= CHOICE {\n *   otherName      [0] INSTANCE OF OTHER-NAME,\n *   rfc822Name     [1] IA5String,\n *   dNSName        [2] IA5String,\n *   x400Address    [3] ORAddress,\n *   directoryName  [4] Name,\n *   ediPartyName   [5] EDIPartyName,\n *   uniformResourceIdentifier [6] IA5String,\n *   IPAddress      [7] OCTET STRING,\n *   registeredID   [8] OBJECT IDENTIFIER\n * }\n *\n * OTHER-NAME ::= TYPE-IDENTIFIER\n *\n * EDIPartyName ::= SEQUENCE {\n *   nameAssigner [0] DirectoryString {ub-name} OPTIONAL,\n *   partyName    [1] DirectoryString {ub-name}\n * }\n *\n * @param exts the extensions ASN.1 with extension sequences to parse.\n *\n * @return the array.\n */\npki.certificateExtensionsFromAsn1 = function(exts) {\n  var rval = [];\n  for(var i = 0; i < exts.value.length; ++i) {\n    // get extension sequence\n    var extseq = exts.value[i];\n    for(var ei = 0; ei < extseq.value.length; ++ei) {\n      rval.push(pki.certificateExtensionFromAsn1(extseq.value[ei]));\n    }\n  }\n\n  return rval;\n};\n\n/**\n * Parses a single certificate extension from ASN.1.\n *\n * @param ext the extension in ASN.1 format.\n *\n * @return the parsed extension as an object.\n */\npki.certificateExtensionFromAsn1 = function(ext) {\n  // an extension has:\n  // [0] extnID      OBJECT IDENTIFIER\n  // [1] critical    BOOLEAN DEFAULT FALSE\n  // [2] extnValue   OCTET STRING\n  var e = {};\n  e.id = asn1.derToOid(ext.value[0].value);\n  e.critical = false;\n  if(ext.value[1].type === asn1.Type.BOOLEAN) {\n    e.critical = (ext.value[1].value.charCodeAt(0) !== 0x00);\n    e.value = ext.value[2].value;\n  } else {\n    e.value = ext.value[1].value;\n  }\n  // if the oid is known, get its name\n  if(e.id in oids) {\n    e.name = oids[e.id];\n\n    // handle key usage\n    if(e.name === 'keyUsage') {\n      // get value as BIT STRING\n      var ev = asn1.fromDer(e.value);\n      var b2 = 0x00;\n      var b3 = 0x00;\n      if(ev.value.length > 1) {\n        // skip first byte, just indicates unused bits which\n        // will be padded with 0s anyway\n        // get bytes with flag bits\n        b2 = ev.value.charCodeAt(1);\n        b3 = ev.value.length > 2 ? ev.value.charCodeAt(2) : 0;\n      }\n      // set flags\n      e.digitalSignature = (b2 & 0x80) === 0x80;\n      e.nonRepudiation = (b2 & 0x40) === 0x40;\n      e.keyEncipherment = (b2 & 0x20) === 0x20;\n      e.dataEncipherment = (b2 & 0x10) === 0x10;\n      e.keyAgreement = (b2 & 0x08) === 0x08;\n      e.keyCertSign = (b2 & 0x04) === 0x04;\n      e.cRLSign = (b2 & 0x02) === 0x02;\n      e.encipherOnly = (b2 & 0x01) === 0x01;\n      e.decipherOnly = (b3 & 0x80) === 0x80;\n    } else if(e.name === 'basicConstraints') {\n      // handle basic constraints\n      // get value as SEQUENCE\n      var ev = asn1.fromDer(e.value);\n      // get cA BOOLEAN flag (defaults to false)\n      if(ev.value.length > 0 && ev.value[0].type === asn1.Type.BOOLEAN) {\n        e.cA = (ev.value[0].value.charCodeAt(0) !== 0x00);\n      } else {\n        e.cA = false;\n      }\n      // get path length constraint\n      var value = null;\n      if(ev.value.length > 0 && ev.value[0].type === asn1.Type.INTEGER) {\n        value = ev.value[0].value;\n      } else if(ev.value.length > 1) {\n        value = ev.value[1].value;\n      }\n      if(value !== null) {\n        e.pathLenConstraint = asn1.derToInteger(value);\n      }\n    } else if(e.name === 'extKeyUsage') {\n      // handle extKeyUsage\n      // value is a SEQUENCE of OIDs\n      var ev = asn1.fromDer(e.value);\n      for(var vi = 0; vi < ev.value.length; ++vi) {\n        var oid = asn1.derToOid(ev.value[vi].value);\n        if(oid in oids) {\n          e[oids[oid]] = true;\n        } else {\n          e[oid] = true;\n        }\n      }\n    } else if(e.name === 'nsCertType') {\n      // handle nsCertType\n      // get value as BIT STRING\n      var ev = asn1.fromDer(e.value);\n      var b2 = 0x00;\n      if(ev.value.length > 1) {\n        // skip first byte, just indicates unused bits which\n        // will be padded with 0s anyway\n        // get bytes with flag bits\n        b2 = ev.value.charCodeAt(1);\n      }\n      // set flags\n      e.client = (b2 & 0x80) === 0x80;\n      e.server = (b2 & 0x40) === 0x40;\n      e.email = (b2 & 0x20) === 0x20;\n      e.objsign = (b2 & 0x10) === 0x10;\n      e.reserved = (b2 & 0x08) === 0x08;\n      e.sslCA = (b2 & 0x04) === 0x04;\n      e.emailCA = (b2 & 0x02) === 0x02;\n      e.objCA = (b2 & 0x01) === 0x01;\n    } else if(\n      e.name === 'subjectAltName' ||\n      e.name === 'issuerAltName') {\n      // handle subjectAltName/issuerAltName\n      e.altNames = [];\n\n      // ev is a SYNTAX SEQUENCE\n      var gn;\n      var ev = asn1.fromDer(e.value);\n      for(var n = 0; n < ev.value.length; ++n) {\n        // get GeneralName\n        gn = ev.value[n];\n\n        var altName = {\n          type: gn.type,\n          value: gn.value\n        };\n        e.altNames.push(altName);\n\n        // Note: Support for types 1,2,6,7,8\n        switch(gn.type) {\n          // rfc822Name\n          case 1:\n          // dNSName\n          case 2:\n          // uniformResourceIdentifier (URI)\n          case 6:\n            break;\n          // IPAddress\n          case 7:\n            // convert to IPv4/IPv6 string representation\n            altName.ip = forge.util.bytesToIP(gn.value);\n            break;\n          // registeredID\n          case 8:\n            altName.oid = asn1.derToOid(gn.value);\n            break;\n          default:\n            // unsupported\n        }\n      }\n    } else if(e.name === 'subjectKeyIdentifier') {\n      // value is an OCTETSTRING w/the hash of the key-type specific\n      // public key structure (eg: RSAPublicKey)\n      var ev = asn1.fromDer(e.value);\n      e.subjectKeyIdentifier = forge.util.bytesToHex(ev.value);\n    }\n  }\n  return e;\n};\n\n/**\n * Converts a PKCS#10 certification request (CSR) from an ASN.1 object.\n *\n * Note: If the certification request is to be verified then compute hash\n * should be set to true. There is currently no implementation for converting\n * a certificate back to ASN.1 so the CertificationRequestInfo part of the\n * ASN.1 object needs to be scanned before the csr object is created.\n *\n * @param obj the asn1 representation of a PKCS#10 certification request (CSR).\n * @param computeHash true to compute the hash for verification.\n *\n * @return the certification request (CSR).\n */\npki.certificationRequestFromAsn1 = function(obj, computeHash) {\n  // validate certification request and capture data\n  var capture = {};\n  var errors = [];\n  if(!asn1.validate(obj, certificationRequestValidator, capture, errors)) {\n    var error = new Error('Cannot read PKCS#10 certificate request. ' +\n      'ASN.1 object is not a PKCS#10 CertificationRequest.');\n    error.errors = errors;\n    throw error;\n  }\n\n  // get oid\n  var oid = asn1.derToOid(capture.publicKeyOid);\n  if(oid !== pki.oids.rsaEncryption) {\n    throw new Error('Cannot read public key. OID is not RSA.');\n  }\n\n  // create certification request\n  var csr = pki.createCertificationRequest();\n  csr.version = capture.csrVersion ? capture.csrVersion.charCodeAt(0) : 0;\n  csr.signatureOid = forge.asn1.derToOid(capture.csrSignatureOid);\n  csr.signatureParameters = _readSignatureParameters(\n    csr.signatureOid, capture.csrSignatureParams, true);\n  csr.siginfo.algorithmOid = forge.asn1.derToOid(capture.csrSignatureOid);\n  csr.siginfo.parameters = _readSignatureParameters(\n    csr.siginfo.algorithmOid, capture.csrSignatureParams, false);\n  csr.signature = capture.csrSignature;\n\n  // keep CertificationRequestInfo to preserve signature when exporting\n  csr.certificationRequestInfo = capture.certificationRequestInfo;\n\n  if(computeHash) {\n    // check signature OID for supported signature types\n    csr.md = null;\n    if(csr.signatureOid in oids) {\n      var oid = oids[csr.signatureOid];\n      switch(oid) {\n        case 'sha1WithRSAEncryption':\n          csr.md = forge.md.sha1.create();\n          break;\n        case 'md5WithRSAEncryption':\n          csr.md = forge.md.md5.create();\n          break;\n        case 'sha256WithRSAEncryption':\n          csr.md = forge.md.sha256.create();\n          break;\n        case 'sha384WithRSAEncryption':\n          csr.md = forge.md.sha384.create();\n          break;\n        case 'sha512WithRSAEncryption':\n          csr.md = forge.md.sha512.create();\n          break;\n        case 'RSASSA-PSS':\n          csr.md = forge.md.sha256.create();\n          break;\n      }\n    }\n    if(csr.md === null) {\n      var error = new Error('Could not compute certification request digest. ' +\n        'Unknown signature OID.');\n      error.signatureOid = csr.signatureOid;\n      throw error;\n    }\n\n    // produce DER formatted CertificationRequestInfo and digest it\n    var bytes = asn1.toDer(csr.certificationRequestInfo);\n    csr.md.update(bytes.getBytes());\n  }\n\n  // handle subject, build subject message digest\n  var smd = forge.md.sha1.create();\n  csr.subject.getField = function(sn) {\n    return _getAttribute(csr.subject, sn);\n  };\n  csr.subject.addField = function(attr) {\n    _fillMissingFields([attr]);\n    csr.subject.attributes.push(attr);\n  };\n  csr.subject.attributes = pki.RDNAttributesAsArray(\n    capture.certificationRequestInfoSubject, smd);\n  csr.subject.hash = smd.digest().toHex();\n\n  // convert RSA public key from ASN.1\n  csr.publicKey = pki.publicKeyFromAsn1(capture.subjectPublicKeyInfo);\n\n  // convert attributes from ASN.1\n  csr.getAttribute = function(sn) {\n    return _getAttribute(csr, sn);\n  };\n  csr.addAttribute = function(attr) {\n    _fillMissingFields([attr]);\n    csr.attributes.push(attr);\n  };\n  csr.attributes = pki.CRIAttributesAsArray(\n    capture.certificationRequestInfoAttributes || []);\n\n  return csr;\n};\n\n/**\n * Creates an empty certification request (a CSR or certificate signing\n * request). Once created, its public key and attributes can be set and then\n * it can be signed.\n *\n * @return the empty certification request.\n */\npki.createCertificationRequest = function() {\n  var csr = {};\n  csr.version = 0x00;\n  csr.signatureOid = null;\n  csr.signature = null;\n  csr.siginfo = {};\n  csr.siginfo.algorithmOid = null;\n\n  csr.subject = {};\n  csr.subject.getField = function(sn) {\n    return _getAttribute(csr.subject, sn);\n  };\n  csr.subject.addField = function(attr) {\n    _fillMissingFields([attr]);\n    csr.subject.attributes.push(attr);\n  };\n  csr.subject.attributes = [];\n  csr.subject.hash = null;\n\n  csr.publicKey = null;\n  csr.attributes = [];\n  csr.getAttribute = function(sn) {\n    return _getAttribute(csr, sn);\n  };\n  csr.addAttribute = function(attr) {\n    _fillMissingFields([attr]);\n    csr.attributes.push(attr);\n  };\n  csr.md = null;\n\n  /**\n   * Sets the subject of this certification request.\n   *\n   * @param attrs the array of subject attributes to use.\n   */\n  csr.setSubject = function(attrs) {\n    // set new attributes\n    _fillMissingFields(attrs);\n    csr.subject.attributes = attrs;\n    csr.subject.hash = null;\n  };\n\n  /**\n   * Sets the attributes of this certification request.\n   *\n   * @param attrs the array of attributes to use.\n   */\n  csr.setAttributes = function(attrs) {\n    // set new attributes\n    _fillMissingFields(attrs);\n    csr.attributes = attrs;\n  };\n\n  /**\n   * Signs this certification request using the given private key.\n   *\n   * @param key the private key to sign with.\n   * @param md the message digest object to use (defaults to forge.md.sha1).\n   */\n  csr.sign = function(key, md) {\n    // TODO: get signature OID from private key\n    csr.md = md || forge.md.sha1.create();\n    var algorithmOid = oids[csr.md.algorithm + 'WithRSAEncryption'];\n    if(!algorithmOid) {\n      var error = new Error('Could not compute certification request digest. ' +\n        'Unknown message digest algorithm OID.');\n      error.algorithm = csr.md.algorithm;\n      throw error;\n    }\n    csr.signatureOid = csr.siginfo.algorithmOid = algorithmOid;\n\n    // get CertificationRequestInfo, convert to DER\n    csr.certificationRequestInfo = pki.getCertificationRequestInfo(csr);\n    var bytes = asn1.toDer(csr.certificationRequestInfo);\n\n    // digest and sign\n    csr.md.update(bytes.getBytes());\n    csr.signature = key.sign(csr.md);\n  };\n\n  /**\n   * Attempts verify the signature on the passed certification request using\n   * its public key.\n   *\n   * A CSR that has been exported to a file in PEM format can be verified using\n   * OpenSSL using this command:\n   *\n   * openssl req -in <the-csr-pem-file> -verify -noout -text\n   *\n   * @return true if verified, false if not.\n   */\n  csr.verify = function() {\n    var rval = false;\n\n    var md = csr.md;\n    if(md === null) {\n      // check signature OID for supported signature types\n      if(csr.signatureOid in oids) {\n        // TODO: create DRY `OID to md` function\n        var oid = oids[csr.signatureOid];\n        switch(oid) {\n          case 'sha1WithRSAEncryption':\n            md = forge.md.sha1.create();\n            break;\n          case 'md5WithRSAEncryption':\n            md = forge.md.md5.create();\n            break;\n          case 'sha256WithRSAEncryption':\n            md = forge.md.sha256.create();\n            break;\n          case 'sha384WithRSAEncryption':\n            md = forge.md.sha384.create();\n            break;\n          case 'sha512WithRSAEncryption':\n            md = forge.md.sha512.create();\n            break;\n          case 'RSASSA-PSS':\n            md = forge.md.sha256.create();\n            break;\n        }\n      }\n      if(md === null) {\n        var error = new Error(\n          'Could not compute certification request digest. ' +\n          'Unknown signature OID.');\n        error.signatureOid = csr.signatureOid;\n        throw error;\n      }\n\n      // produce DER formatted CertificationRequestInfo and digest it\n      var cri = csr.certificationRequestInfo ||\n        pki.getCertificationRequestInfo(csr);\n      var bytes = asn1.toDer(cri);\n      md.update(bytes.getBytes());\n    }\n\n    if(md !== null) {\n      var scheme;\n\n      switch(csr.signatureOid) {\n        case oids.sha1WithRSAEncryption:\n          /* use PKCS#1 v1.5 padding scheme */\n          break;\n        case oids['RSASSA-PSS']:\n          var hash, mgf;\n\n          /* initialize mgf */\n          hash = oids[csr.signatureParameters.mgf.hash.algorithmOid];\n          if(hash === undefined || forge.md[hash] === undefined) {\n            var error = new Error('Unsupported MGF hash function.');\n            error.oid = csr.signatureParameters.mgf.hash.algorithmOid;\n            error.name = hash;\n            throw error;\n          }\n\n          mgf = oids[csr.signatureParameters.mgf.algorithmOid];\n          if(mgf === undefined || forge.mgf[mgf] === undefined) {\n            var error = new Error('Unsupported MGF function.');\n            error.oid = csr.signatureParameters.mgf.algorithmOid;\n            error.name = mgf;\n            throw error;\n          }\n\n          mgf = forge.mgf[mgf].create(forge.md[hash].create());\n\n          /* initialize hash function */\n          hash = oids[csr.signatureParameters.hash.algorithmOid];\n          if(hash === undefined || forge.md[hash] === undefined) {\n            var error = new Error('Unsupported RSASSA-PSS hash function.');\n            error.oid = csr.signatureParameters.hash.algorithmOid;\n            error.name = hash;\n            throw error;\n          }\n\n          scheme = forge.pss.create(forge.md[hash].create(), mgf,\n            csr.signatureParameters.saltLength);\n          break;\n      }\n\n      // verify signature on csr using its public key\n      rval = csr.publicKey.verify(\n        md.digest().getBytes(), csr.signature, scheme);\n    }\n\n    return rval;\n  };\n\n  return csr;\n};\n\n/**\n * Converts an X.509 subject or issuer to an ASN.1 RDNSequence.\n *\n * @param obj the subject or issuer (distinguished name).\n *\n * @return the ASN.1 RDNSequence.\n */\nfunction _dnToAsn1(obj) {\n  // create an empty RDNSequence\n  var rval = asn1.create(\n    asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);\n\n  // iterate over attributes\n  var attr, set;\n  var attrs = obj.attributes;\n  for(var i = 0; i < attrs.length; ++i) {\n    attr = attrs[i];\n    var value = attr.value;\n\n    // reuse tag class for attribute value if available\n    var valueTagClass = asn1.Type.PRINTABLESTRING;\n    if('valueTagClass' in attr) {\n      valueTagClass = attr.valueTagClass;\n\n      if(valueTagClass === asn1.Type.UTF8) {\n        value = forge.util.encodeUtf8(value);\n      }\n      // FIXME: handle more encodings\n    }\n\n    // create a RelativeDistinguishedName set\n    // each value in the set is an AttributeTypeAndValue first\n    // containing the type (an OID) and second the value\n    set = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n        // AttributeType\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n          asn1.oidToDer(attr.type).getBytes()),\n        // AttributeValue\n        asn1.create(asn1.Class.UNIVERSAL, valueTagClass, false, value)\n      ])\n    ]);\n    rval.value.push(set);\n  }\n\n  return rval;\n}\n\n/**\n * Gets all printable attributes (typically of an issuer or subject) in a\n * simplified JSON format for display.\n *\n * @param attrs the attributes.\n *\n * @return the JSON for display.\n */\nfunction _getAttributesAsJson(attrs) {\n  var rval = {};\n  for(var i = 0; i < attrs.length; ++i) {\n    var attr = attrs[i];\n    if(attr.shortName && (\n      attr.valueTagClass === asn1.Type.UTF8 ||\n      attr.valueTagClass === asn1.Type.PRINTABLESTRING ||\n      attr.valueTagClass === asn1.Type.IA5STRING)) {\n      var value = attr.value;\n      if(attr.valueTagClass === asn1.Type.UTF8) {\n        value = forge.util.encodeUtf8(attr.value);\n      }\n      if(!(attr.shortName in rval)) {\n        rval[attr.shortName] = value;\n      } else if(forge.util.isArray(rval[attr.shortName])) {\n        rval[attr.shortName].push(value);\n      } else {\n        rval[attr.shortName] = [rval[attr.shortName], value];\n      }\n    }\n  }\n  return rval;\n}\n\n/**\n * Fills in missing fields in attributes.\n *\n * @param attrs the attributes to fill missing fields in.\n */\nfunction _fillMissingFields(attrs) {\n  var attr;\n  for(var i = 0; i < attrs.length; ++i) {\n    attr = attrs[i];\n\n    // populate missing name\n    if(typeof attr.name === 'undefined') {\n      if(attr.type && attr.type in pki.oids) {\n        attr.name = pki.oids[attr.type];\n      } else if(attr.shortName && attr.shortName in _shortNames) {\n        attr.name = pki.oids[_shortNames[attr.shortName]];\n      }\n    }\n\n    // populate missing type (OID)\n    if(typeof attr.type === 'undefined') {\n      if(attr.name && attr.name in pki.oids) {\n        attr.type = pki.oids[attr.name];\n      } else {\n        var error = new Error('Attribute type not specified.');\n        error.attribute = attr;\n        throw error;\n      }\n    }\n\n    // populate missing shortname\n    if(typeof attr.shortName === 'undefined') {\n      if(attr.name && attr.name in _shortNames) {\n        attr.shortName = _shortNames[attr.name];\n      }\n    }\n\n    // convert extensions to value\n    if(attr.type === oids.extensionRequest) {\n      attr.valueConstructed = true;\n      attr.valueTagClass = asn1.Type.SEQUENCE;\n      if(!attr.value && attr.extensions) {\n        attr.value = [];\n        for(var ei = 0; ei < attr.extensions.length; ++ei) {\n          attr.value.push(pki.certificateExtensionToAsn1(\n            _fillMissingExtensionFields(attr.extensions[ei])));\n        }\n      }\n    }\n\n    if(typeof attr.value === 'undefined') {\n      var error = new Error('Attribute value not specified.');\n      error.attribute = attr;\n      throw error;\n    }\n  }\n}\n\n/**\n * Fills in missing fields in certificate extensions.\n *\n * @param e the extension.\n * @param [options] the options to use.\n *          [cert] the certificate the extensions are for.\n *\n * @return the extension.\n */\nfunction _fillMissingExtensionFields(e, options) {\n  options = options || {};\n\n  // populate missing name\n  if(typeof e.name === 'undefined') {\n    if(e.id && e.id in pki.oids) {\n      e.name = pki.oids[e.id];\n    }\n  }\n\n  // populate missing id\n  if(typeof e.id === 'undefined') {\n    if(e.name && e.name in pki.oids) {\n      e.id = pki.oids[e.name];\n    } else {\n      var error = new Error('Extension ID not specified.');\n      error.extension = e;\n      throw error;\n    }\n  }\n\n  if(typeof e.value !== 'undefined') {\n    return e;\n  }\n\n  // handle missing value:\n\n  // value is a BIT STRING\n  if(e.name === 'keyUsage') {\n    // build flags\n    var unused = 0;\n    var b2 = 0x00;\n    var b3 = 0x00;\n    if(e.digitalSignature) {\n      b2 |= 0x80;\n      unused = 7;\n    }\n    if(e.nonRepudiation) {\n      b2 |= 0x40;\n      unused = 6;\n    }\n    if(e.keyEncipherment) {\n      b2 |= 0x20;\n      unused = 5;\n    }\n    if(e.dataEncipherment) {\n      b2 |= 0x10;\n      unused = 4;\n    }\n    if(e.keyAgreement) {\n      b2 |= 0x08;\n      unused = 3;\n    }\n    if(e.keyCertSign) {\n      b2 |= 0x04;\n      unused = 2;\n    }\n    if(e.cRLSign) {\n      b2 |= 0x02;\n      unused = 1;\n    }\n    if(e.encipherOnly) {\n      b2 |= 0x01;\n      unused = 0;\n    }\n    if(e.decipherOnly) {\n      b3 |= 0x80;\n      unused = 7;\n    }\n\n    // create bit string\n    var value = String.fromCharCode(unused);\n    if(b3 !== 0) {\n      value += String.fromCharCode(b2) + String.fromCharCode(b3);\n    } else if(b2 !== 0) {\n      value += String.fromCharCode(b2);\n    }\n    e.value = asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false, value);\n  } else if(e.name === 'basicConstraints') {\n    // basicConstraints is a SEQUENCE\n    e.value = asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);\n    // cA BOOLEAN flag defaults to false\n    if(e.cA) {\n      e.value.value.push(asn1.create(\n        asn1.Class.UNIVERSAL, asn1.Type.BOOLEAN, false,\n        String.fromCharCode(0xFF)));\n    }\n    if('pathLenConstraint' in e) {\n      e.value.value.push(asn1.create(\n        asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n        asn1.integerToDer(e.pathLenConstraint).getBytes()));\n    }\n  } else if(e.name === 'extKeyUsage') {\n    // extKeyUsage is a SEQUENCE of OIDs\n    e.value = asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);\n    var seq = e.value.value;\n    for(var key in e) {\n      if(e[key] !== true) {\n        continue;\n      }\n      // key is name in OID map\n      if(key in oids) {\n        seq.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID,\n          false, asn1.oidToDer(oids[key]).getBytes()));\n      } else if(key.indexOf('.') !== -1) {\n        // assume key is an OID\n        seq.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID,\n          false, asn1.oidToDer(key).getBytes()));\n      }\n    }\n  } else if(e.name === 'nsCertType') {\n    // nsCertType is a BIT STRING\n    // build flags\n    var unused = 0;\n    var b2 = 0x00;\n\n    if(e.client) {\n      b2 |= 0x80;\n      unused = 7;\n    }\n    if(e.server) {\n      b2 |= 0x40;\n      unused = 6;\n    }\n    if(e.email) {\n      b2 |= 0x20;\n      unused = 5;\n    }\n    if(e.objsign) {\n      b2 |= 0x10;\n      unused = 4;\n    }\n    if(e.reserved) {\n      b2 |= 0x08;\n      unused = 3;\n    }\n    if(e.sslCA) {\n      b2 |= 0x04;\n      unused = 2;\n    }\n    if(e.emailCA) {\n      b2 |= 0x02;\n      unused = 1;\n    }\n    if(e.objCA) {\n      b2 |= 0x01;\n      unused = 0;\n    }\n\n    // create bit string\n    var value = String.fromCharCode(unused);\n    if(b2 !== 0) {\n      value += String.fromCharCode(b2);\n    }\n    e.value = asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false, value);\n  } else if(e.name === 'subjectAltName' || e.name === 'issuerAltName') {\n    // SYNTAX SEQUENCE\n    e.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);\n\n    var altName;\n    for(var n = 0; n < e.altNames.length; ++n) {\n      altName = e.altNames[n];\n      var value = altName.value;\n      // handle IP\n      if(altName.type === 7 && altName.ip) {\n        value = forge.util.bytesFromIP(altName.ip);\n        if(value === null) {\n          var error = new Error(\n            'Extension \"ip\" value is not a valid IPv4 or IPv6 address.');\n          error.extension = e;\n          throw error;\n        }\n      } else if(altName.type === 8) {\n        // handle OID\n        if(altName.oid) {\n          value = asn1.oidToDer(asn1.oidToDer(altName.oid));\n        } else {\n          // deprecated ... convert value to OID\n          value = asn1.oidToDer(value);\n        }\n      }\n      e.value.value.push(asn1.create(\n        asn1.Class.CONTEXT_SPECIFIC, altName.type, false,\n        value));\n    }\n  } else if(e.name === 'nsComment' && options.cert) {\n    // sanity check value is ASCII (req'd) and not too big\n    if(!(/^[\\x00-\\x7F]*$/.test(e.comment)) ||\n      (e.comment.length < 1) || (e.comment.length > 128)) {\n      throw new Error('Invalid \"nsComment\" content.');\n    }\n    // IA5STRING opaque comment\n    e.value = asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.IA5STRING, false, e.comment);\n  } else if(e.name === 'subjectKeyIdentifier' && options.cert) {\n    var ski = options.cert.generateSubjectKeyIdentifier();\n    e.subjectKeyIdentifier = ski.toHex();\n    // OCTETSTRING w/digest\n    e.value = asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, ski.getBytes());\n  } else if(e.name === 'authorityKeyIdentifier' && options.cert) {\n    // SYNTAX SEQUENCE\n    e.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);\n    var seq = e.value.value;\n\n    if(e.keyIdentifier) {\n      var keyIdentifier = (e.keyIdentifier === true ?\n        options.cert.generateSubjectKeyIdentifier().getBytes() :\n        e.keyIdentifier);\n      seq.push(\n        asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, false, keyIdentifier));\n    }\n\n    if(e.authorityCertIssuer) {\n      var authorityCertIssuer = [\n        asn1.create(asn1.Class.CONTEXT_SPECIFIC, 4, true, [\n          _dnToAsn1(e.authorityCertIssuer === true ?\n            options.cert.issuer : e.authorityCertIssuer)\n        ])\n      ];\n      seq.push(\n        asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, authorityCertIssuer));\n    }\n\n    if(e.serialNumber) {\n      var serialNumber = forge.util.hexToBytes(e.serialNumber === true ?\n        options.cert.serialNumber : e.serialNumber);\n      seq.push(\n        asn1.create(asn1.Class.CONTEXT_SPECIFIC, 2, false, serialNumber));\n    }\n  } else if(e.name === 'cRLDistributionPoints') {\n    e.value = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);\n    var seq = e.value.value;\n\n    // Create sub SEQUENCE of DistributionPointName\n    var subSeq = asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);\n\n    // Create fullName CHOICE\n    var fullNameGeneralNames = asn1.create(\n      asn1.Class.CONTEXT_SPECIFIC, 0, true, []);\n    var altName;\n    for(var n = 0; n < e.altNames.length; ++n) {\n      altName = e.altNames[n];\n      var value = altName.value;\n      // handle IP\n      if(altName.type === 7 && altName.ip) {\n        value = forge.util.bytesFromIP(altName.ip);\n        if(value === null) {\n          var error = new Error(\n            'Extension \"ip\" value is not a valid IPv4 or IPv6 address.');\n          error.extension = e;\n          throw error;\n        }\n      } else if(altName.type === 8) {\n        // handle OID\n        if(altName.oid) {\n          value = asn1.oidToDer(asn1.oidToDer(altName.oid));\n        } else {\n          // deprecated ... convert value to OID\n          value = asn1.oidToDer(value);\n        }\n      }\n      fullNameGeneralNames.value.push(asn1.create(\n        asn1.Class.CONTEXT_SPECIFIC, altName.type, false,\n        value));\n    }\n\n    // Add to the parent SEQUENCE\n    subSeq.value.push(asn1.create(\n      asn1.Class.CONTEXT_SPECIFIC, 0, true, [fullNameGeneralNames]));\n    seq.push(subSeq);\n  }\n\n  // ensure value has been defined by now\n  if(typeof e.value === 'undefined') {\n    var error = new Error('Extension value not specified.');\n    error.extension = e;\n    throw error;\n  }\n\n  return e;\n}\n\n/**\n * Convert signature parameters object to ASN.1\n *\n * @param {String} oid Signature algorithm OID\n * @param params The signature parametrs object\n * @return ASN.1 object representing signature parameters\n */\nfunction _signatureParametersToAsn1(oid, params) {\n  switch(oid) {\n    case oids['RSASSA-PSS']:\n      var parts = [];\n\n      if(params.hash.algorithmOid !== undefined) {\n        parts.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [\n          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n              asn1.oidToDer(params.hash.algorithmOid).getBytes()),\n            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')\n          ])\n        ]));\n      }\n\n      if(params.mgf.algorithmOid !== undefined) {\n        parts.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, [\n          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n              asn1.oidToDer(params.mgf.algorithmOid).getBytes()),\n            asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n              asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n                asn1.oidToDer(params.mgf.hash.algorithmOid).getBytes()),\n              asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')\n            ])\n          ])\n        ]));\n      }\n\n      if(params.saltLength !== undefined) {\n        parts.push(asn1.create(asn1.Class.CONTEXT_SPECIFIC, 2, true, [\n          asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n            asn1.integerToDer(params.saltLength).getBytes())\n        ]));\n      }\n\n      return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, parts);\n\n    default:\n      return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '');\n  }\n}\n\n/**\n * Converts a certification request's attributes to an ASN.1 set of\n * CRIAttributes.\n *\n * @param csr certification request.\n *\n * @return the ASN.1 set of CRIAttributes.\n */\nfunction _CRIAttributesToAsn1(csr) {\n  // create an empty context-specific container\n  var rval = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, []);\n\n  // no attributes, return empty container\n  if(csr.attributes.length === 0) {\n    return rval;\n  }\n\n  // each attribute has a sequence with a type and a set of values\n  var attrs = csr.attributes;\n  for(var i = 0; i < attrs.length; ++i) {\n    var attr = attrs[i];\n    var value = attr.value;\n\n    // reuse tag class for attribute value if available\n    var valueTagClass = asn1.Type.UTF8;\n    if('valueTagClass' in attr) {\n      valueTagClass = attr.valueTagClass;\n    }\n    if(valueTagClass === asn1.Type.UTF8) {\n      value = forge.util.encodeUtf8(value);\n    }\n    var valueConstructed = false;\n    if('valueConstructed' in attr) {\n      valueConstructed = attr.valueConstructed;\n    }\n    // FIXME: handle more encodings\n\n    // create a RelativeDistinguishedName set\n    // each value in the set is an AttributeTypeAndValue first\n    // containing the type (an OID) and second the value\n    var seq = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      // AttributeType\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n        asn1.oidToDer(attr.type).getBytes()),\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SET, true, [\n        // AttributeValue\n        asn1.create(\n          asn1.Class.UNIVERSAL, valueTagClass, valueConstructed, value)\n      ])\n    ]);\n    rval.value.push(seq);\n  }\n\n  return rval;\n}\n\nvar jan_1_1950 = new Date('1950-01-01T00:00:00Z');\nvar jan_1_2050 = new Date('2050-01-01T00:00:00Z');\n\n/**\n * Converts a Date object to ASN.1\n * Handles the different format before and after 1st January 2050\n *\n * @param date date object.\n *\n * @return the ASN.1 object representing the date.\n */\nfunction _dateToAsn1(date) {\n  if(date >= jan_1_1950 && date < jan_1_2050) {\n    return asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.UTCTIME, false,\n      asn1.dateToUtcTime(date));\n  } else {\n    return asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.GENERALIZEDTIME, false,\n      asn1.dateToGeneralizedTime(date));\n  }\n}\n\n/**\n * Gets the ASN.1 TBSCertificate part of an X.509v3 certificate.\n *\n * @param cert the certificate.\n *\n * @return the asn1 TBSCertificate.\n */\npki.getTBSCertificate = function(cert) {\n  // TBSCertificate\n  var notBefore = _dateToAsn1(cert.validity.notBefore);\n  var notAfter = _dateToAsn1(cert.validity.notAfter);\n  var tbs = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // version\n    asn1.create(asn1.Class.CONTEXT_SPECIFIC, 0, true, [\n      // integer\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n        asn1.integerToDer(cert.version).getBytes())\n    ]),\n    // serialNumber\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      forge.util.hexToBytes(cert.serialNumber)),\n    // signature\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      // algorithm\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n        asn1.oidToDer(cert.siginfo.algorithmOid).getBytes()),\n      // parameters\n      _signatureParametersToAsn1(\n        cert.siginfo.algorithmOid, cert.siginfo.parameters)\n    ]),\n    // issuer\n    _dnToAsn1(cert.issuer),\n    // validity\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      notBefore,\n      notAfter\n    ]),\n    // subject\n    _dnToAsn1(cert.subject),\n    // SubjectPublicKeyInfo\n    pki.publicKeyToAsn1(cert.publicKey)\n  ]);\n\n  if(cert.issuer.uniqueId) {\n    // issuerUniqueID (optional)\n    tbs.value.push(\n      asn1.create(asn1.Class.CONTEXT_SPECIFIC, 1, true, [\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,\n          // TODO: support arbitrary bit length ids\n          String.fromCharCode(0x00) +\n          cert.issuer.uniqueId\n        )\n      ])\n    );\n  }\n  if(cert.subject.uniqueId) {\n    // subjectUniqueID (optional)\n    tbs.value.push(\n      asn1.create(asn1.Class.CONTEXT_SPECIFIC, 2, true, [\n        asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,\n          // TODO: support arbitrary bit length ids\n          String.fromCharCode(0x00) +\n          cert.subject.uniqueId\n        )\n      ])\n    );\n  }\n\n  if(cert.extensions.length > 0) {\n    // extensions (optional)\n    tbs.value.push(pki.certificateExtensionsToAsn1(cert.extensions));\n  }\n\n  return tbs;\n};\n\n/**\n * Gets the ASN.1 CertificationRequestInfo part of a\n * PKCS#10 CertificationRequest.\n *\n * @param csr the certification request.\n *\n * @return the asn1 CertificationRequestInfo.\n */\npki.getCertificationRequestInfo = function(csr) {\n  // CertificationRequestInfo\n  var cri = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // version\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false,\n      asn1.integerToDer(csr.version).getBytes()),\n    // subject\n    _dnToAsn1(csr.subject),\n    // SubjectPublicKeyInfo\n    pki.publicKeyToAsn1(csr.publicKey),\n    // attributes\n    _CRIAttributesToAsn1(csr)\n  ]);\n\n  return cri;\n};\n\n/**\n * Converts a DistinguishedName (subject or issuer) to an ASN.1 object.\n *\n * @param dn the DistinguishedName.\n *\n * @return the asn1 representation of a DistinguishedName.\n */\npki.distinguishedNameToAsn1 = function(dn) {\n  return _dnToAsn1(dn);\n};\n\n/**\n * Converts an X.509v3 RSA certificate to an ASN.1 object.\n *\n * @param cert the certificate.\n *\n * @return the asn1 representation of an X.509v3 RSA certificate.\n */\npki.certificateToAsn1 = function(cert) {\n  // prefer cached TBSCertificate over generating one\n  var tbsCertificate = cert.tbsCertificate || pki.getTBSCertificate(cert);\n\n  // Certificate\n  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // TBSCertificate\n    tbsCertificate,\n    // AlgorithmIdentifier (signature algorithm)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      // algorithm\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n        asn1.oidToDer(cert.signatureOid).getBytes()),\n      // parameters\n      _signatureParametersToAsn1(cert.signatureOid, cert.signatureParameters)\n    ]),\n    // SignatureValue\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,\n      String.fromCharCode(0x00) + cert.signature)\n  ]);\n};\n\n/**\n * Converts X.509v3 certificate extensions to ASN.1.\n *\n * @param exts the extensions to convert.\n *\n * @return the extensions in ASN.1 format.\n */\npki.certificateExtensionsToAsn1 = function(exts) {\n  // create top-level extension container\n  var rval = asn1.create(asn1.Class.CONTEXT_SPECIFIC, 3, true, []);\n\n  // create extension sequence (stores a sequence for each extension)\n  var seq = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);\n  rval.value.push(seq);\n\n  for(var i = 0; i < exts.length; ++i) {\n    seq.value.push(pki.certificateExtensionToAsn1(exts[i]));\n  }\n\n  return rval;\n};\n\n/**\n * Converts a single certificate extension to ASN.1.\n *\n * @param ext the extension to convert.\n *\n * @return the extension in ASN.1 format.\n */\npki.certificateExtensionToAsn1 = function(ext) {\n  // create a sequence for each extension\n  var extseq = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []);\n\n  // extnID (OID)\n  extseq.value.push(asn1.create(\n    asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n    asn1.oidToDer(ext.id).getBytes()));\n\n  // critical defaults to false\n  if(ext.critical) {\n    // critical BOOLEAN DEFAULT FALSE\n    extseq.value.push(asn1.create(\n      asn1.Class.UNIVERSAL, asn1.Type.BOOLEAN, false,\n      String.fromCharCode(0xFF)));\n  }\n\n  var value = ext.value;\n  if(typeof ext.value !== 'string') {\n    // value is asn.1\n    value = asn1.toDer(value).getBytes();\n  }\n\n  // extnValue (OCTET STRING)\n  extseq.value.push(asn1.create(\n    asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, value));\n\n  return extseq;\n};\n\n/**\n * Converts a PKCS#10 certification request to an ASN.1 object.\n *\n * @param csr the certification request.\n *\n * @return the asn1 representation of a certification request.\n */\npki.certificationRequestToAsn1 = function(csr) {\n  // prefer cached CertificationRequestInfo over generating one\n  var cri = csr.certificationRequestInfo ||\n    pki.getCertificationRequestInfo(csr);\n\n  // Certificate\n  return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n    // CertificationRequestInfo\n    cri,\n    // AlgorithmIdentifier (signature algorithm)\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [\n      // algorithm\n      asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false,\n        asn1.oidToDer(csr.signatureOid).getBytes()),\n      // parameters\n      _signatureParametersToAsn1(csr.signatureOid, csr.signatureParameters)\n    ]),\n    // signature\n    asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false,\n      String.fromCharCode(0x00) + csr.signature)\n  ]);\n};\n\n/**\n * Creates a CA store.\n *\n * @param certs an optional array of certificate objects or PEM-formatted\n *          certificate strings to add to the CA store.\n *\n * @return the CA store.\n */\npki.createCaStore = function(certs) {\n  // create CA store\n  var caStore = {\n    // stored certificates\n    certs: {}\n  };\n\n  /**\n   * Gets the certificate that issued the passed certificate or its\n   * 'parent'.\n   *\n   * @param cert the certificate to get the parent for.\n   *\n   * @return the parent certificate or null if none was found.\n   */\n  caStore.getIssuer = function(cert) {\n    var rval = getBySubject(cert.issuer);\n\n    // see if there are multiple matches\n    /*if(forge.util.isArray(rval)) {\n      // TODO: resolve multiple matches by checking\n      // authorityKey/subjectKey/issuerUniqueID/other identifiers, etc.\n      // FIXME: or alternatively do authority key mapping\n      // if possible (X.509v1 certs can't work?)\n      throw new Error('Resolving multiple issuer matches not implemented yet.');\n    }*/\n\n    return rval;\n  };\n\n  /**\n   * Adds a trusted certificate to the store.\n   *\n   * @param cert the certificate to add as a trusted certificate (either a\n   *          pki.certificate object or a PEM-formatted certificate).\n   */\n  caStore.addCertificate = function(cert) {\n    // convert from pem if necessary\n    if(typeof cert === 'string') {\n      cert = forge.pki.certificateFromPem(cert);\n    }\n\n    ensureSubjectHasHash(cert.subject);\n\n    if(!caStore.hasCertificate(cert)) { // avoid duplicate certificates in store\n      if(cert.subject.hash in caStore.certs) {\n        // subject hash already exists, append to array\n        var tmp = caStore.certs[cert.subject.hash];\n        if(!forge.util.isArray(tmp)) {\n          tmp = [tmp];\n        }\n        tmp.push(cert);\n        caStore.certs[cert.subject.hash] = tmp;\n      } else {\n        caStore.certs[cert.subject.hash] = cert;\n      }\n    }\n  };\n\n  /**\n   * Checks to see if the given certificate is in the store.\n   *\n   * @param cert the certificate to check (either a pki.certificate or a\n   *          PEM-formatted certificate).\n   *\n   * @return true if the certificate is in the store, false if not.\n   */\n  caStore.hasCertificate = function(cert) {\n    // convert from pem if necessary\n    if(typeof cert === 'string') {\n      cert = forge.pki.certificateFromPem(cert);\n    }\n\n    var match = getBySubject(cert.subject);\n    if(!match) {\n      return false;\n    }\n    if(!forge.util.isArray(match)) {\n      match = [match];\n    }\n    // compare DER-encoding of certificates\n    var der1 = asn1.toDer(pki.certificateToAsn1(cert)).getBytes();\n    for(var i = 0; i < match.length; ++i) {\n      var der2 = asn1.toDer(pki.certificateToAsn1(match[i])).getBytes();\n      if(der1 === der2) {\n        return true;\n      }\n    }\n    return false;\n  };\n\n  /**\n   * Lists all of the certificates kept in the store.\n   *\n   * @return an array of all of the pki.certificate objects in the store.\n   */\n  caStore.listAllCertificates = function() {\n    var certList = [];\n\n    for(var hash in caStore.certs) {\n      if(caStore.certs.hasOwnProperty(hash)) {\n        var value = caStore.certs[hash];\n        if(!forge.util.isArray(value)) {\n          certList.push(value);\n        } else {\n          for(var i = 0; i < value.length; ++i) {\n            certList.push(value[i]);\n          }\n        }\n      }\n    }\n\n    return certList;\n  };\n\n  /**\n   * Removes a certificate from the store.\n   *\n   * @param cert the certificate to remove (either a pki.certificate or a\n   *          PEM-formatted certificate).\n   *\n   * @return the certificate that was removed or null if the certificate\n   *           wasn't in store.\n   */\n  caStore.removeCertificate = function(cert) {\n    var result;\n\n    // convert from pem if necessary\n    if(typeof cert === 'string') {\n      cert = forge.pki.certificateFromPem(cert);\n    }\n    ensureSubjectHasHash(cert.subject);\n    if(!caStore.hasCertificate(cert)) {\n      return null;\n    }\n\n    var match = getBySubject(cert.subject);\n\n    if(!forge.util.isArray(match)) {\n      result = caStore.certs[cert.subject.hash];\n      delete caStore.certs[cert.subject.hash];\n      return result;\n    }\n\n    // compare DER-encoding of certificates\n    var der1 = asn1.toDer(pki.certificateToAsn1(cert)).getBytes();\n    for(var i = 0; i < match.length; ++i) {\n      var der2 = asn1.toDer(pki.certificateToAsn1(match[i])).getBytes();\n      if(der1 === der2) {\n        result = match[i];\n        match.splice(i, 1);\n      }\n    }\n    if(match.length === 0) {\n      delete caStore.certs[cert.subject.hash];\n    }\n\n    return result;\n  };\n\n  function getBySubject(subject) {\n    ensureSubjectHasHash(subject);\n    return caStore.certs[subject.hash] || null;\n  }\n\n  function ensureSubjectHasHash(subject) {\n    // produce subject hash if it doesn't exist\n    if(!subject.hash) {\n      var md = forge.md.sha1.create();\n      subject.attributes = pki.RDNAttributesAsArray(_dnToAsn1(subject), md);\n      subject.hash = md.digest().toHex();\n    }\n  }\n\n  // auto-add passed in certs\n  if(certs) {\n    // parse PEM-formatted certificates as necessary\n    for(var i = 0; i < certs.length; ++i) {\n      var cert = certs[i];\n      caStore.addCertificate(cert);\n    }\n  }\n\n  return caStore;\n};\n\n/**\n * Certificate verification errors, based on TLS.\n */\npki.certificateError = {\n  bad_certificate: 'forge.pki.BadCertificate',\n  unsupported_certificate: 'forge.pki.UnsupportedCertificate',\n  certificate_revoked: 'forge.pki.CertificateRevoked',\n  certificate_expired: 'forge.pki.CertificateExpired',\n  certificate_unknown: 'forge.pki.CertificateUnknown',\n  unknown_ca: 'forge.pki.UnknownCertificateAuthority'\n};\n\n/**\n * Verifies a certificate chain against the given Certificate Authority store\n * with an optional custom verify callback.\n *\n * @param caStore a certificate store to verify against.\n * @param chain the certificate chain to verify, with the root or highest\n *          authority at the end (an array of certificates).\n * @param options a callback to be called for every certificate in the chain or\n *                  an object with:\n *                  verify a callback to be called for every certificate in the\n *                    chain\n *                  validityCheckDate the date against which the certificate\n *                    validity period should be checked. Pass null to not check\n *                    the validity period. By default, the current date is used.\n *\n * The verify callback has the following signature:\n *\n * verified - Set to true if certificate was verified, otherwise the\n *   pki.certificateError for why the certificate failed.\n * depth - The current index in the chain, where 0 is the end point's cert.\n * certs - The certificate chain, *NOTE* an empty chain indicates an anonymous\n *   end point.\n *\n * The function returns true on success and on failure either the appropriate\n * pki.certificateError or an object with 'error' set to the appropriate\n * pki.certificateError and 'message' set to a custom error message.\n *\n * @return true if successful, error thrown if not.\n */\npki.verifyCertificateChain = function(caStore, chain, options) {\n  /* From: RFC3280 - Internet X.509 Public Key Infrastructure Certificate\n    Section 6: Certification Path Validation\n    See inline parentheticals related to this particular implementation.\n\n    The primary goal of path validation is to verify the binding between\n    a subject distinguished name or a subject alternative name and subject\n    public key, as represented in the end entity certificate, based on the\n    public key of the trust anchor. This requires obtaining a sequence of\n    certificates that support that binding. That sequence should be provided\n    in the passed 'chain'. The trust anchor should be in the given CA\n    store. The 'end entity' certificate is the certificate provided by the\n    end point (typically a server) and is the first in the chain.\n\n    To meet this goal, the path validation process verifies, among other\n    things, that a prospective certification path (a sequence of n\n    certificates or a 'chain') satisfies the following conditions:\n\n    (a) for all x in {1, ..., n-1}, the subject of certificate x is\n          the issuer of certificate x+1;\n\n    (b) certificate 1 is issued by the trust anchor;\n\n    (c) certificate n is the certificate to be validated; and\n\n    (d) for all x in {1, ..., n}, the certificate was valid at the\n          time in question.\n\n    Note that here 'n' is index 0 in the chain and 1 is the last certificate\n    in the chain and it must be signed by a certificate in the connection's\n    CA store.\n\n    The path validation process also determines the set of certificate\n    policies that are valid for this path, based on the certificate policies\n    extension, policy mapping extension, policy constraints extension, and\n    inhibit any-policy extension.\n\n    Note: Policy mapping extension not supported (Not Required).\n\n    Note: If the certificate has an unsupported critical extension, then it\n    must be rejected.\n\n    Note: A certificate is self-issued if the DNs that appear in the subject\n    and issuer fields are identical and are not empty.\n\n    The path validation algorithm assumes the following seven inputs are\n    provided to the path processing logic. What this specific implementation\n    will use is provided parenthetically:\n\n    (a) a prospective certification path of length n (the 'chain')\n    (b) the current date/time: ('now').\n    (c) user-initial-policy-set: A set of certificate policy identifiers\n          naming the policies that are acceptable to the certificate user.\n          The user-initial-policy-set contains the special value any-policy\n          if the user is not concerned about certificate policy\n          (Not implemented. Any policy is accepted).\n    (d) trust anchor information, describing a CA that serves as a trust\n          anchor for the certification path. The trust anchor information\n          includes:\n\n      (1)  the trusted issuer name,\n      (2)  the trusted public key algorithm,\n      (3)  the trusted public key, and\n      (4)  optionally, the trusted public key parameters associated\n             with the public key.\n\n      (Trust anchors are provided via certificates in the CA store).\n\n      The trust anchor information may be provided to the path processing\n      procedure in the form of a self-signed certificate. The trusted anchor\n      information is trusted because it was delivered to the path processing\n      procedure by some trustworthy out-of-band procedure. If the trusted\n      public key algorithm requires parameters, then the parameters are\n      provided along with the trusted public key (No parameters used in this\n      implementation).\n\n    (e) initial-policy-mapping-inhibit, which indicates if policy mapping is\n          allowed in the certification path.\n          (Not implemented, no policy checking)\n\n    (f) initial-explicit-policy, which indicates if the path must be valid\n          for at least one of the certificate policies in the user-initial-\n          policy-set.\n          (Not implemented, no policy checking)\n\n    (g) initial-any-policy-inhibit, which indicates whether the\n          anyPolicy OID should be processed if it is included in a\n          certificate.\n          (Not implemented, so any policy is valid provided that it is\n          not marked as critical) */\n\n  /* Basic Path Processing:\n\n    For each certificate in the 'chain', the following is checked:\n\n    1. The certificate validity period includes the current time.\n    2. The certificate was signed by its parent (where the parent is either\n       the next in the chain or from the CA store). Allow processing to\n       continue to the next step if no parent is found but the certificate is\n       in the CA store.\n    3. TODO: The certificate has not been revoked.\n    4. The certificate issuer name matches the parent's subject name.\n    5. TODO: If the certificate is self-issued and not the final certificate\n       in the chain, skip this step, otherwise verify that the subject name\n       is within one of the permitted subtrees of X.500 distinguished names\n       and that each of the alternative names in the subjectAltName extension\n       (critical or non-critical) is within one of the permitted subtrees for\n       that name type.\n    6. TODO: If the certificate is self-issued and not the final certificate\n       in the chain, skip this step, otherwise verify that the subject name\n       is not within one of the excluded subtrees for X.500 distinguished\n       names and none of the subjectAltName extension names are excluded for\n       that name type.\n    7. The other steps in the algorithm for basic path processing involve\n       handling the policy extension which is not presently supported in this\n       implementation. Instead, if a critical policy extension is found, the\n       certificate is rejected as not supported.\n    8. If the certificate is not the first or if its the only certificate in\n       the chain (having no parent from the CA store or is self-signed) and it\n       has a critical key usage extension, verify that the keyCertSign bit is\n       set. If the key usage extension exists, verify that the basic\n       constraints extension exists. If the basic constraints extension exists,\n       verify that the cA flag is set. If pathLenConstraint is set, ensure that\n       the number of certificates that precede in the chain (come earlier\n       in the chain as implemented below), excluding the very first in the\n       chain (typically the end-entity one), isn't greater than the\n       pathLenConstraint. This constraint limits the number of intermediate\n       CAs that may appear below a CA before only end-entity certificates\n       may be issued. */\n\n  // if a verify callback is passed as the third parameter, package it within\n  // the options object. This is to support a legacy function signature that\n  // expected the verify callback as the third parameter.\n  if(typeof options === 'function') {\n    options = {verify: options};\n  }\n  options = options || {};\n\n  // copy cert chain references to another array to protect against changes\n  // in verify callback\n  chain = chain.slice(0);\n  var certs = chain.slice(0);\n\n  var validityCheckDate = options.validityCheckDate;\n  // if no validityCheckDate is specified, default to the current date. Make\n  // sure to maintain the value null because it indicates that the validity\n  // period should not be checked.\n  if(typeof validityCheckDate === 'undefined') {\n    validityCheckDate = new Date();\n  }\n\n  // verify each cert in the chain using its parent, where the parent\n  // is either the next in the chain or from the CA store\n  var first = true;\n  var error = null;\n  var depth = 0;\n  do {\n    var cert = chain.shift();\n    var parent = null;\n    var selfSigned = false;\n\n    if(validityCheckDate) {\n      // 1. check valid time\n      if(validityCheckDate < cert.validity.notBefore ||\n         validityCheckDate > cert.validity.notAfter) {\n        error = {\n          message: 'Certificate is not valid yet or has expired.',\n          error: pki.certificateError.certificate_expired,\n          notBefore: cert.validity.notBefore,\n          notAfter: cert.validity.notAfter,\n          // TODO: we might want to reconsider renaming 'now' to\n          // 'validityCheckDate' should this API be changed in the future.\n          now: validityCheckDate\n        };\n      }\n    }\n\n    // 2. verify with parent from chain or CA store\n    if(error === null) {\n      parent = chain[0] || caStore.getIssuer(cert);\n      if(parent === null) {\n        // check for self-signed cert\n        if(cert.isIssuer(cert)) {\n          selfSigned = true;\n          parent = cert;\n        }\n      }\n\n      if(parent) {\n        // FIXME: current CA store implementation might have multiple\n        // certificates where the issuer can't be determined from the\n        // certificate (happens rarely with, eg: old certificates) so normalize\n        // by always putting parents into an array\n        // TODO: there's may be an extreme degenerate case currently uncovered\n        // where an old intermediate certificate seems to have a matching parent\n        // but none of the parents actually verify ... but the intermediate\n        // is in the CA and it should pass this check; needs investigation\n        var parents = parent;\n        if(!forge.util.isArray(parents)) {\n          parents = [parents];\n        }\n\n        // try to verify with each possible parent (typically only one)\n        var verified = false;\n        while(!verified && parents.length > 0) {\n          parent = parents.shift();\n          try {\n            verified = parent.verify(cert);\n          } catch(ex) {\n            // failure to verify, don't care why, try next one\n          }\n        }\n\n        if(!verified) {\n          error = {\n            message: 'Certificate signature is invalid.',\n            error: pki.certificateError.bad_certificate\n          };\n        }\n      }\n\n      if(error === null && (!parent || selfSigned) &&\n        !caStore.hasCertificate(cert)) {\n        // no parent issuer and certificate itself is not trusted\n        error = {\n          message: 'Certificate is not trusted.',\n          error: pki.certificateError.unknown_ca\n        };\n      }\n    }\n\n    // TODO: 3. check revoked\n\n    // 4. check for matching issuer/subject\n    if(error === null && parent && !cert.isIssuer(parent)) {\n      // parent is not issuer\n      error = {\n        message: 'Certificate issuer is invalid.',\n        error: pki.certificateError.bad_certificate\n      };\n    }\n\n    // 5. TODO: check names with permitted names tree\n\n    // 6. TODO: check names against excluded names tree\n\n    // 7. check for unsupported critical extensions\n    if(error === null) {\n      // supported extensions\n      var se = {\n        keyUsage: true,\n        basicConstraints: true\n      };\n      for(var i = 0; error === null && i < cert.extensions.length; ++i) {\n        var ext = cert.extensions[i];\n        if(ext.critical && !(ext.name in se)) {\n          error = {\n            message:\n              'Certificate has an unsupported critical extension.',\n            error: pki.certificateError.unsupported_certificate\n          };\n        }\n      }\n    }\n\n    // 8. check for CA if cert is not first or is the only certificate\n    // remaining in chain with no parent or is self-signed\n    if(error === null &&\n      (!first || (chain.length === 0 && (!parent || selfSigned)))) {\n      // first check keyUsage extension and then basic constraints\n      var bcExt = cert.getExtension('basicConstraints');\n      var keyUsageExt = cert.getExtension('keyUsage');\n      if(keyUsageExt !== null) {\n        // keyCertSign must be true and there must be a basic\n        // constraints extension\n        if(!keyUsageExt.keyCertSign || bcExt === null) {\n          // bad certificate\n          error = {\n            message:\n              'Certificate keyUsage or basicConstraints conflict ' +\n              'or indicate that the certificate is not a CA. ' +\n              'If the certificate is the only one in the chain or ' +\n              'isn\\'t the first then the certificate must be a ' +\n              'valid CA.',\n            error: pki.certificateError.bad_certificate\n          };\n        }\n      }\n      // basic constraints cA flag must be set\n      if(error === null && bcExt !== null && !bcExt.cA) {\n        // bad certificate\n        error = {\n          message:\n            'Certificate basicConstraints indicates the certificate ' +\n            'is not a CA.',\n          error: pki.certificateError.bad_certificate\n        };\n      }\n      // if error is not null and keyUsage is available, then we know it\n      // has keyCertSign and there is a basic constraints extension too,\n      // which means we can check pathLenConstraint (if it exists)\n      if(error === null && keyUsageExt !== null &&\n        'pathLenConstraint' in bcExt) {\n        // pathLen is the maximum # of intermediate CA certs that can be\n        // found between the current certificate and the end-entity (depth 0)\n        // certificate; this number does not include the end-entity (depth 0,\n        // last in the chain) even if it happens to be a CA certificate itself\n        var pathLen = depth - 1;\n        if(pathLen > bcExt.pathLenConstraint) {\n          // pathLenConstraint violated, bad certificate\n          error = {\n            message:\n              'Certificate basicConstraints pathLenConstraint violated.',\n            error: pki.certificateError.bad_certificate\n          };\n        }\n      }\n    }\n\n    // call application callback\n    var vfd = (error === null) ? true : error.error;\n    var ret = options.verify ? options.verify(vfd, depth, certs) : vfd;\n    if(ret === true) {\n      // clear any set error\n      error = null;\n    } else {\n      // if passed basic tests, set default message and alert\n      if(vfd === true) {\n        error = {\n          message: 'The application rejected the certificate.',\n          error: pki.certificateError.bad_certificate\n        };\n      }\n\n      // check for custom error info\n      if(ret || ret === 0) {\n        // set custom message and error\n        if(typeof ret === 'object' && !forge.util.isArray(ret)) {\n          if(ret.message) {\n            error.message = ret.message;\n          }\n          if(ret.error) {\n            error.error = ret.error;\n          }\n        } else if(typeof ret === 'string') {\n          // set custom error\n          error.error = ret;\n        }\n      }\n\n      // throw error\n      throw error;\n    }\n\n    // no longer first cert in chain\n    first = false;\n    ++depth;\n  } while(chain.length > 0);\n\n  return true;\n};\n","/**\n * Node.js module for Forge mask generation functions.\n *\n * @author Stefan Siegl\n *\n * Copyright 2012 Stefan Siegl <stesie@brokenpipe.de>\n */\nvar forge = require('./forge');\nrequire('./mgf1');\n\nmodule.exports = forge.mgf = forge.mgf || {};\nforge.mgf.mgf1 = forge.mgf1;\n","/**\n * Javascript implementation of mask generation function MGF1.\n *\n * @author Stefan Siegl\n * @author Dave Longley\n *\n * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>\n * Copyright (c) 2014 Digital Bazaar, Inc.\n */\nvar forge = require('./forge');\nrequire('./util');\n\nforge.mgf = forge.mgf || {};\nvar mgf1 = module.exports = forge.mgf.mgf1 = forge.mgf1 = forge.mgf1 || {};\n\n/**\n * Creates a MGF1 mask generation function object.\n *\n * @param md the message digest API to use (eg: forge.md.sha1.create()).\n *\n * @return a mask generation function object.\n */\nmgf1.create = function(md) {\n  var mgf = {\n    /**\n     * Generate mask of specified length.\n     *\n     * @param {String} seed The seed for mask generation.\n     * @param maskLen Number of bytes to generate.\n     * @return {String} The generated mask.\n     */\n    generate: function(seed, maskLen) {\n      /* 2. Let T be the empty octet string. */\n      var t = new forge.util.ByteBuffer();\n\n      /* 3. For counter from 0 to ceil(maskLen / hLen), do the following: */\n      var len = Math.ceil(maskLen / md.digestLength);\n      for(var i = 0; i < len; i++) {\n        /* a. Convert counter to an octet string C of length 4 octets */\n        var c = new forge.util.ByteBuffer();\n        c.putInt32(i);\n\n        /* b. Concatenate the hash of the seed mgfSeed and C to the octet\n         * string T: */\n        md.start();\n        md.update(seed + c.getBytes());\n        t.putBuffer(md.digest());\n      }\n\n      /* Output the leading maskLen octets of T as the octet string mask. */\n      t.truncate(t.length() - maskLen);\n      return t.getBytes();\n    }\n  };\n\n  return mgf;\n};\n","/**\n * Javascript implementation of PKCS#1 PSS signature padding.\n *\n * @author Stefan Siegl\n *\n * Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>\n */\nvar forge = require('./forge');\nrequire('./random');\nrequire('./util');\n\n// shortcut for PSS API\nvar pss = module.exports = forge.pss = forge.pss || {};\n\n/**\n * Creates a PSS signature scheme object.\n *\n * There are several ways to provide a salt for encoding:\n *\n * 1. Specify the saltLength only and the built-in PRNG will generate it.\n * 2. Specify the saltLength and a custom PRNG with 'getBytesSync' defined that\n *   will be used.\n * 3. Specify the salt itself as a forge.util.ByteBuffer.\n *\n * @param options the options to use:\n *          md the message digest object to use, a forge md instance.\n *          mgf the mask generation function to use, a forge mgf instance.\n *          [saltLength] the length of the salt in octets.\n *          [prng] the pseudo-random number generator to use to produce a salt.\n *          [salt] the salt to use when encoding.\n *\n * @return a signature scheme object.\n */\npss.create = function(options) {\n  // backwards compatibility w/legacy args: hash, mgf, sLen\n  if(arguments.length === 3) {\n    options = {\n      md: arguments[0],\n      mgf: arguments[1],\n      saltLength: arguments[2]\n    };\n  }\n\n  var hash = options.md;\n  var mgf = options.mgf;\n  var hLen = hash.digestLength;\n\n  var salt_ = options.salt || null;\n  if(typeof salt_ === 'string') {\n    // assume binary-encoded string\n    salt_ = forge.util.createBuffer(salt_);\n  }\n\n  var sLen;\n  if('saltLength' in options) {\n    sLen = options.saltLength;\n  } else if(salt_ !== null) {\n    sLen = salt_.length();\n  } else {\n    throw new Error('Salt length not specified or specific salt not given.');\n  }\n\n  if(salt_ !== null && salt_.length() !== sLen) {\n    throw new Error('Given salt length does not match length of given salt.');\n  }\n\n  var prng = options.prng || forge.random;\n\n  var pssobj = {};\n\n  /**\n   * Encodes a PSS signature.\n   *\n   * This function implements EMSA-PSS-ENCODE as per RFC 3447, section 9.1.1.\n   *\n   * @param md the message digest object with the hash to sign.\n   * @param modsBits the length of the RSA modulus in bits.\n   *\n   * @return the encoded message as a binary-encoded string of length\n   *           ceil((modBits - 1) / 8).\n   */\n  pssobj.encode = function(md, modBits) {\n    var i;\n    var emBits = modBits - 1;\n    var emLen = Math.ceil(emBits / 8);\n\n    /* 2. Let mHash = Hash(M), an octet string of length hLen. */\n    var mHash = md.digest().getBytes();\n\n    /* 3. If emLen < hLen + sLen + 2, output \"encoding error\" and stop. */\n    if(emLen < hLen + sLen + 2) {\n      throw new Error('Message is too long to encrypt.');\n    }\n\n    /* 4. Generate a random octet string salt of length sLen; if sLen = 0,\n     *    then salt is the empty string. */\n    var salt;\n    if(salt_ === null) {\n      salt = prng.getBytesSync(sLen);\n    } else {\n      salt = salt_.bytes();\n    }\n\n    /* 5. Let M' = (0x)00 00 00 00 00 00 00 00 || mHash || salt; */\n    var m_ = new forge.util.ByteBuffer();\n    m_.fillWithByte(0, 8);\n    m_.putBytes(mHash);\n    m_.putBytes(salt);\n\n    /* 6. Let H = Hash(M'), an octet string of length hLen. */\n    hash.start();\n    hash.update(m_.getBytes());\n    var h = hash.digest().getBytes();\n\n    /* 7. Generate an octet string PS consisting of emLen - sLen - hLen - 2\n     *    zero octets.  The length of PS may be 0. */\n    var ps = new forge.util.ByteBuffer();\n    ps.fillWithByte(0, emLen - sLen - hLen - 2);\n\n    /* 8. Let DB = PS || 0x01 || salt; DB is an octet string of length\n     *    emLen - hLen - 1. */\n    ps.putByte(0x01);\n    ps.putBytes(salt);\n    var db = ps.getBytes();\n\n    /* 9. Let dbMask = MGF(H, emLen - hLen - 1). */\n    var maskLen = emLen - hLen - 1;\n    var dbMask = mgf.generate(h, maskLen);\n\n    /* 10. Let maskedDB = DB \\xor dbMask. */\n    var maskedDB = '';\n    for(i = 0; i < maskLen; i++) {\n      maskedDB += String.fromCharCode(db.charCodeAt(i) ^ dbMask.charCodeAt(i));\n    }\n\n    /* 11. Set the leftmost 8emLen - emBits bits of the leftmost octet in\n     *     maskedDB to zero. */\n    var mask = (0xFF00 >> (8 * emLen - emBits)) & 0xFF;\n    maskedDB = String.fromCharCode(maskedDB.charCodeAt(0) & ~mask) +\n      maskedDB.substr(1);\n\n    /* 12. Let EM = maskedDB || H || 0xbc.\n     * 13. Output EM. */\n    return maskedDB + h + String.fromCharCode(0xbc);\n  };\n\n  /**\n   * Verifies a PSS signature.\n   *\n   * This function implements EMSA-PSS-VERIFY as per RFC 3447, section 9.1.2.\n   *\n   * @param mHash the message digest hash, as a binary-encoded string, to\n   *         compare against the signature.\n   * @param em the encoded message, as a binary-encoded string\n   *          (RSA decryption result).\n   * @param modsBits the length of the RSA modulus in bits.\n   *\n   * @return true if the signature was verified, false if not.\n   */\n  pssobj.verify = function(mHash, em, modBits) {\n    var i;\n    var emBits = modBits - 1;\n    var emLen = Math.ceil(emBits / 8);\n\n    /* c. Convert the message representative m to an encoded message EM\n     *    of length emLen = ceil((modBits - 1) / 8) octets, where modBits\n     *    is the length in bits of the RSA modulus n */\n    em = em.substr(-emLen);\n\n    /* 3. If emLen < hLen + sLen + 2, output \"inconsistent\" and stop. */\n    if(emLen < hLen + sLen + 2) {\n      throw new Error('Inconsistent parameters to PSS signature verification.');\n    }\n\n    /* 4. If the rightmost octet of EM does not have hexadecimal value\n     *    0xbc, output \"inconsistent\" and stop. */\n    if(em.charCodeAt(emLen - 1) !== 0xbc) {\n      throw new Error('Encoded message does not end in 0xBC.');\n    }\n\n    /* 5. Let maskedDB be the leftmost emLen - hLen - 1 octets of EM, and\n     *    let H be the next hLen octets. */\n    var maskLen = emLen - hLen - 1;\n    var maskedDB = em.substr(0, maskLen);\n    var h = em.substr(maskLen, hLen);\n\n    /* 6. If the leftmost 8emLen - emBits bits of the leftmost octet in\n     *    maskedDB are not all equal to zero, output \"inconsistent\" and stop. */\n    var mask = (0xFF00 >> (8 * emLen - emBits)) & 0xFF;\n    if((maskedDB.charCodeAt(0) & mask) !== 0) {\n      throw new Error('Bits beyond keysize not zero as expected.');\n    }\n\n    /* 7. Let dbMask = MGF(H, emLen - hLen - 1). */\n    var dbMask = mgf.generate(h, maskLen);\n\n    /* 8. Let DB = maskedDB \\xor dbMask. */\n    var db = '';\n    for(i = 0; i < maskLen; i++) {\n      db += String.fromCharCode(maskedDB.charCodeAt(i) ^ dbMask.charCodeAt(i));\n    }\n\n    /* 9. Set the leftmost 8emLen - emBits bits of the leftmost octet\n     * in DB to zero. */\n    db = String.fromCharCode(db.charCodeAt(0) & ~mask) + db.substr(1);\n\n    /* 10. If the emLen - hLen - sLen - 2 leftmost octets of DB are not zero\n     * or if the octet at position emLen - hLen - sLen - 1 (the leftmost\n     * position is \"position 1\") does not have hexadecimal value 0x01,\n     * output \"inconsistent\" and stop. */\n    var checkLen = emLen - hLen - sLen - 2;\n    for(i = 0; i < checkLen; i++) {\n      if(db.charCodeAt(i) !== 0x00) {\n        throw new Error('Leftmost octets not zero as expected');\n      }\n    }\n\n    if(db.charCodeAt(checkLen) !== 0x01) {\n      throw new Error('Inconsistent PSS signature, 0x01 marker not found');\n    }\n\n    /* 11. Let salt be the last sLen octets of DB. */\n    var salt = db.substr(-sLen);\n\n    /* 12.  Let M' = (0x)00 00 00 00 00 00 00 00 || mHash || salt */\n    var m_ = new forge.util.ByteBuffer();\n    m_.fillWithByte(0, 8);\n    m_.putBytes(mHash);\n    m_.putBytes(salt);\n\n    /* 13. Let H' = Hash(M'), an octet string of length hLen. */\n    hash.start();\n    hash.update(m_.getBytes());\n    var h_ = hash.digest().getBytes();\n\n    /* 14. If H = H', output \"consistent.\" Otherwise, output \"inconsistent.\" */\n    return h === h_;\n  };\n\n  return pssobj;\n};\n","// @ts-nocheck\n'use strict'\n\nrequire('node-forge/lib/x509')\nconst forge = require('node-forge/lib/forge')\nconst pki = forge.pki\n\n/**\n * Gets a self-signed X.509 certificate for the key.\n *\n * The output Uint8Array contains the PKCS #7 message in DER.\n *\n * TODO: move to libp2p-crypto package\n *\n * @param {KeyInfo} key - The id and name of the key\n * @param {RsaPrivateKey} privateKey - The naked key\n * @returns {Uint8Array}\n */\nconst certificateForKey = (key, privateKey) => {\n  const publicKey = pki.setRsaPublicKey(privateKey.n, privateKey.e)\n  const cert = pki.createCertificate()\n  cert.publicKey = publicKey\n  cert.serialNumber = '01'\n  cert.validity.notBefore = new Date()\n  cert.validity.notAfter = new Date()\n  cert.validity.notAfter.setFullYear(cert.validity.notBefore.getFullYear() + 10)\n  const attrs = [{\n    name: 'organizationName',\n    value: 'ipfs'\n  }, {\n    shortName: 'OU',\n    value: 'keystore'\n  }, {\n    name: 'commonName',\n    value: key.id\n  }]\n  cert.setSubject(attrs)\n  cert.setIssuer(attrs)\n  cert.setExtensions([{\n    name: 'basicConstraints',\n    cA: true\n  }, {\n    name: 'keyUsage',\n    keyCertSign: true,\n    digitalSignature: true,\n    nonRepudiation: true,\n    keyEncipherment: true,\n    dataEncipherment: true\n  }, {\n    name: 'extKeyUsage',\n    serverAuth: true,\n    clientAuth: true,\n    codeSigning: true,\n    emailProtection: true,\n    timeStamping: true\n  }, {\n    name: 'nsCertType',\n    client: true,\n    server: true,\n    email: true,\n    objsign: true,\n    sslCA: true,\n    emailCA: true,\n    objCA: true\n  }])\n  // self-sign certificate\n  cert.sign(privateKey)\n\n  return cert\n}\n\n/**\n * Finds the first item in a collection that is matched in the\n * `asyncCompare` function.\n *\n * `asyncCompare` is an async function that must\n * resolve to either `true` or `false`.\n *\n * @param {Array} array\n * @param {function(*)} asyncCompare - An async function that returns a boolean\n */\nasync function findAsync (array, asyncCompare) {\n  const promises = array.map(asyncCompare)\n  const results = await Promise.all(promises)\n  const index = results.findIndex(result => result)\n  return array[index]\n}\n\nmodule.exports = {\n  certificateForKey,\n  findAsync\n}\n","// @ts-nocheck\n'use strict'\n\nconst mergeOptions = require('merge-options')\nconst { pipe } = require('it-pipe')\nconst { tap } = require('streaming-iterables')\nconst oldPeerLRU = require('./old-peers')\nconst { METRICS: defaultOptions } = require('../constants')\nconst Stats = require('./stats')\n\nconst initialCounters = [\n  'dataReceived',\n  'dataSent'\n]\n\nconst directionToEvent = {\n  in: 'dataReceived',\n  out: 'dataSent'\n}\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('libp2p-interfaces/src/transport/types').MultiaddrConnection} MultiaddrConnection\n */\n\n/**\n * @typedef MetricsProperties\n * @property {import('../connection-manager')} connectionManager\n *\n * @typedef MetricsOptions\n * @property {number} [computeThrottleMaxQueueSize = defaultOptions.computeThrottleMaxQueueSize]\n * @property {number} [computeThrottleTimeout = defaultOptions.computeThrottleTimeout]\n * @property {number[]} [movingAverageIntervals = defaultOptions.movingAverageIntervals]\n * @property {number} [maxOldPeersRetention = defaultOptions.maxOldPeersRetention]\n */\n\nclass Metrics {\n  /**\n   * @class\n   * @param {MetricsProperties & MetricsOptions} options\n   */\n  constructor (options) {\n    this._options = mergeOptions(defaultOptions, options)\n    this._globalStats = new Stats(initialCounters, this._options)\n    this._peerStats = new Map()\n    this._protocolStats = new Map()\n    this._oldPeers = oldPeerLRU(this._options.maxOldPeersRetention)\n    this._running = false\n    this._onMessage = this._onMessage.bind(this)\n    this._connectionManager = options.connectionManager\n    this._connectionManager.on('peer:disconnect', (connection) => {\n      this.onPeerDisconnected(connection.remotePeer)\n    })\n  }\n\n  /**\n   * Must be called for stats to saved. Any data pushed for tracking\n   * will be ignored.\n   */\n  start () {\n    this._running = true\n  }\n\n  /**\n   * Stops all averages timers and prevents new data from being tracked.\n   * Once `stop` is called, `start` must be called to resume stats tracking.\n   */\n  stop () {\n    this._running = false\n    this._globalStats.stop()\n    for (const stats of this._peerStats.values()) {\n      stats.stop()\n    }\n    for (const stats of this._protocolStats.values()) {\n      stats.stop()\n    }\n  }\n\n  /**\n   * Gets the global `Stats` object\n   *\n   * @returns {Stats}\n   */\n  get global () {\n    return this._globalStats\n  }\n\n  /**\n   * Returns a list of `PeerId` strings currently being tracked\n   *\n   * @returns {string[]}\n   */\n  get peers () {\n    return Array.from(this._peerStats.keys())\n  }\n\n  /**\n   * Returns the `Stats` object for the given `PeerId` whether it\n   * is a live peer, or in the disconnected peer LRU cache.\n   *\n   * @param {PeerId} peerId\n   * @returns {Stats}\n   */\n  forPeer (peerId) {\n    const idString = peerId.toB58String()\n    return this._peerStats.get(idString) || this._oldPeers.get(idString)\n  }\n\n  /**\n   * Returns a list of all protocol strings currently being tracked.\n   *\n   * @returns {string[]}\n   */\n  get protocols () {\n    return Array.from(this._protocolStats.keys())\n  }\n\n  /**\n   * Returns the `Stats` object for the given `protocol`.\n   *\n   * @param {string} protocol\n   * @returns {Stats}\n   */\n  forProtocol (protocol) {\n    return this._protocolStats.get(protocol)\n  }\n\n  /**\n   * Should be called when all connections to a given peer\n   * have closed. The `Stats` collection for the peer will\n   * be stopped and moved to an LRU for temporary retention.\n   *\n   * @param {PeerId} peerId\n   */\n  onPeerDisconnected (peerId) {\n    const idString = peerId.toB58String()\n    const peerStats = this._peerStats.get(idString)\n    if (peerStats) {\n      peerStats.stop()\n      this._peerStats.delete(idString)\n      this._oldPeers.set(idString, peerStats)\n    }\n  }\n\n  /**\n   * Takes the metadata for a message and tracks it in the\n   * appropriate categories. If the protocol is present, protocol\n   * stats will also be tracked.\n   *\n   * @private\n   * @param {object} params\n   * @param {PeerId} params.remotePeer - Remote peer\n   * @param {string} [params.protocol] - Protocol string the stream is running\n   * @param {string} params.direction - One of ['in','out']\n   * @param {number} params.dataLength - Size of the message\n   * @returns {void}\n   */\n  _onMessage ({ remotePeer, protocol, direction, dataLength }) {\n    if (!this._running) return\n\n    const key = directionToEvent[direction]\n\n    let peerStats = this.forPeer(remotePeer)\n    if (!peerStats) {\n      peerStats = new Stats(initialCounters, this._options)\n      this._peerStats.set(remotePeer.toB58String(), peerStats)\n    }\n\n    // Peer and global stats\n    peerStats.push(key, dataLength)\n    this._globalStats.push(key, dataLength)\n\n    // Protocol specific stats\n    if (protocol) {\n      let protocolStats = this.forProtocol(protocol)\n      if (!protocolStats) {\n        protocolStats = new Stats(initialCounters, this._options)\n        this._protocolStats.set(protocol, protocolStats)\n      }\n      protocolStats.push(key, dataLength)\n    }\n  }\n\n  /**\n   * Replaces the `PeerId` string with the given `peerId`.\n   * If stats are already being tracked for the given `peerId`, the\n   * placeholder stats will be merged with the existing stats.\n   *\n   * @param {PeerId} placeholder - A peerId string\n   * @param {PeerId} peerId\n   * @returns {void}\n   */\n  updatePlaceholder (placeholder, peerId) {\n    if (!this._running) return\n    const placeholderStats = this.forPeer(placeholder)\n    const peerIdString = peerId.toB58String()\n    const existingStats = this.forPeer(peerId)\n    let mergedStats = placeholderStats\n\n    // If we already have stats, merge the two\n    if (existingStats) {\n      // If existing, merge\n      mergedStats = Metrics.mergeStats(existingStats, mergedStats)\n      // Attempt to delete from the old peers list just in case it was tracked there\n      this._oldPeers.delete(peerIdString)\n    }\n\n    this._peerStats.delete(placeholder.toB58String())\n    this._peerStats.set(peerIdString, mergedStats)\n    mergedStats.start()\n  }\n\n  /**\n   * Tracks data running through a given Duplex Iterable `stream`. If\n   * the `peerId` is not provided, a placeholder string will be created and\n   * returned. This allows lazy tracking of a peer when the peer is not yet known.\n   * When the `PeerId` is known, `Metrics.updatePlaceholder` should be called\n   * with the placeholder string returned from here, and the known `PeerId`.\n   *\n   * @param {Object} options\n   * @param {MultiaddrConnection} options.stream - A duplex iterable stream\n   * @param {PeerId} [options.remotePeer] - The id of the remote peer that's connected\n   * @param {string} [options.protocol] - The protocol the stream is running\n   * @returns {MultiaddrConnection} The peerId string or placeholder string\n   */\n  trackStream ({ stream, remotePeer, protocol }) {\n    const metrics = this\n    const _source = stream.source\n    stream.source = tap(chunk => metrics._onMessage({\n      remotePeer,\n      protocol,\n      direction: 'in',\n      dataLength: chunk.length\n    }))(_source)\n\n    const _sink = stream.sink\n    stream.sink = source => {\n      return pipe(\n        source,\n        tap(chunk => metrics._onMessage({\n          remotePeer,\n          protocol,\n          direction: 'out',\n          dataLength: chunk.length\n        })),\n        _sink\n      )\n    }\n\n    return stream\n  }\n\n  /**\n   * Merges `other` into `target`. `target` will be modified\n   * and returned.\n   *\n   * @param {Stats} target\n   * @param {Stats} other\n   * @returns {Stats}\n   */\n  static mergeStats (target, other) {\n    target.stop()\n    other.stop()\n\n    // Merge queues\n    target._queue = [...target._queue, ...other._queue]\n\n    // TODO: how to merge moving averages?\n    return target\n  }\n}\n\nmodule.exports = Metrics\n","'use strict'\n\nconst LRU = require('hashlru')\n\n/**\n * Creates and returns a Least Recently Used Cache\n *\n * @param {number} maxSize\n * @returns {any}\n */\nmodule.exports = (maxSize) => {\n  // @ts-ignore LRU expression is not callable\n  const patched = LRU(maxSize)\n  patched.delete = patched.remove\n  return patched\n}\n","// @ts-nocheck\n'use strict'\n\nconst { EventEmitter } = require('events')\nconst { BigNumber: Big } = require('bignumber.js')\nconst MovingAverage = require('@vascosantos/moving-average')\nconst retimer = require('retimer')\n\n/**\n * @typedef {import('@vascosantos/moving-average').IMovingAverage} IMovingAverage\n */\n\nclass Stats extends EventEmitter {\n  /**\n   * A queue based manager for stat processing\n   *\n   * @class\n   * @param {string[]} initialCounters\n   * @param {any} options\n   */\n  constructor (initialCounters, options) {\n    super()\n\n    this._options = options\n    this._queue = []\n\n    /** @type {{ dataReceived: Big, dataSent: Big }} */\n    this._stats = {\n      dataReceived: Big(0),\n      dataSent: Big(0)\n    }\n\n    this._frequencyLastTime = Date.now()\n    this._frequencyAccumulators = {}\n\n    /** @type {{ dataReceived: IMovingAverage[], dataSent: IMovingAverage[] }} */\n    this._movingAverages = {}\n\n    this._update = this._update.bind(this)\n\n    const intervals = this._options.movingAverageIntervals\n\n    for (let i = 0; i < initialCounters.length; i++) {\n      const key = initialCounters[i]\n      this._stats[key] = Big(0)\n      this._movingAverages[key] = {}\n      for (let k = 0; k < intervals.length; k++) {\n        const interval = intervals[k]\n        const ma = this._movingAverages[key][interval] = MovingAverage(interval)\n        ma.push(this._frequencyLastTime, 0)\n      }\n    }\n  }\n\n  /**\n   * Initializes the internal timer if there are items in the queue. This\n   * should only need to be called if `Stats.stop` was previously called, as\n   * `Stats.push` will also start the processing.\n   *\n   * @returns {void}\n   */\n  start () {\n    if (this._queue.length) {\n      this._resetComputeTimeout()\n    }\n  }\n\n  /**\n   * Stops processing and computing of stats by clearing the internal\n   * timer.\n   *\n   * @returns {void}\n   */\n  stop () {\n    if (this._timeout) {\n      this._timeout.clear()\n      this._timeout = null\n    }\n  }\n\n  /**\n   * Returns a clone of the current stats.\n   */\n  get snapshot () {\n    return Object.assign({}, this._stats)\n  }\n\n  /**\n   * Returns a clone of the internal movingAverages\n   */\n  get movingAverages () {\n    return Object.assign({}, this._movingAverages)\n  }\n\n  /**\n   * Returns a plain JSON object of the stats\n   *\n   * @returns {*}\n   */\n  toJSON () {\n    const snapshot = this.snapshot\n    const movingAverages = this.movingAverages\n    const data = {\n      dataReceived: snapshot.dataReceived.toString(),\n      dataSent: snapshot.dataSent.toString(),\n      movingAverages: {}\n    }\n\n    const counters = Object.keys(movingAverages)\n    for (const key of counters) {\n      data.movingAverages[key] = {}\n      for (const interval of Object.keys(movingAverages[key])) {\n        data.movingAverages[key][interval] = movingAverages[key][interval].movingAverage()\n      }\n    }\n\n    return data\n  }\n\n  /**\n   * Pushes the given operation data to the queue, along with the\n   * current Timestamp, then resets the update timer.\n   *\n   * @param {string} counter\n   * @param {number} inc\n   * @returns {void}\n   */\n  push (counter, inc) {\n    this._queue.push([counter, inc, Date.now()])\n    this._resetComputeTimeout()\n  }\n\n  /**\n   * Resets the timeout for triggering updates.\n   *\n   * @private\n   * @returns {void}\n   */\n  _resetComputeTimeout () {\n    this._timeout = retimer(this._update, this._nextTimeout())\n  }\n\n  /**\n   * Calculates and returns the timeout for the next update based on\n   * the urgency of the update.\n   *\n   * @private\n   * @returns {number}\n   */\n  _nextTimeout () {\n    // calculate the need for an update, depending on the queue length\n    const urgency = this._queue.length / this._options.computeThrottleMaxQueueSize\n    const timeout = Math.max(this._options.computeThrottleTimeout * (1 - urgency), 0)\n    return timeout\n  }\n\n  /**\n   * If there are items in the queue, they will will be processed and\n   * the frequency for all items will be updated based on the Timestamp\n   * of the last item in the queue. The `update` event will also be emitted\n   * with the latest stats.\n   *\n   * If there are no items in the queue, no action is taken.\n   *\n   * @private\n   * @returns {void}\n   */\n  _update () {\n    this._timeout = null\n    if (this._queue.length) {\n      let last\n      for (last of this._queue) {\n        this._applyOp(last)\n      }\n      this._queue = []\n\n      this._updateFrequency(last[2]) // contains timestamp of last op\n\n      this.emit('update', this._stats)\n    }\n  }\n\n  /**\n   * For each key in the stats, the frequency and moving averages\n   * will be updated via Stats._updateFrequencyFor based on the time\n   * difference between calls to this method.\n   *\n   * @private\n   * @param {Timestamp} latestTime\n   * @returns {void}\n   */\n  _updateFrequency (latestTime) {\n    const timeDiff = latestTime - this._frequencyLastTime\n\n    Object.keys(this._stats).forEach((key) => {\n      this._updateFrequencyFor(key, timeDiff, latestTime)\n    })\n\n    this._frequencyLastTime = latestTime\n  }\n\n  /**\n   * Updates the `movingAverages` for the given `key` and also\n   * resets the `frequencyAccumulator` for the `key`.\n   *\n   * @private\n   * @param {string} key\n   * @param {number} timeDiffMS - Time in milliseconds\n   * @param {Timestamp} latestTime - Time in ticks\n   * @returns {void}\n   */\n  _updateFrequencyFor (key, timeDiffMS, latestTime) {\n    const count = this._frequencyAccumulators[key] || 0\n    this._frequencyAccumulators[key] = 0\n    // if `timeDiff` is zero, `hz` becomes Infinity, so we fallback to 1ms\n    const safeTimeDiff = timeDiffMS || 1\n    const hz = (count / safeTimeDiff) * 1000\n\n    let movingAverages = this._movingAverages[key]\n    if (!movingAverages) {\n      movingAverages = this._movingAverages[key] = {}\n    }\n\n    const intervals = this._options.movingAverageIntervals\n\n    for (let i = 0; i < intervals.length; i++) {\n      const movingAverageInterval = intervals[i]\n      let movingAverage = movingAverages[movingAverageInterval]\n      if (!movingAverage) {\n        movingAverage = movingAverages[movingAverageInterval] = MovingAverage(movingAverageInterval)\n      }\n      movingAverage.push(latestTime, hz)\n    }\n  }\n\n  /**\n   * For the given operation, `op`, the stats and `frequencyAccumulator`\n   * will be updated or initialized if they don't already exist.\n   *\n   * @private\n   * @param {{string, number}[]} op\n   * @throws {InvalidNumber}\n   * @returns {void}\n   */\n  _applyOp (op) {\n    const key = op[0]\n    const inc = op[1]\n\n    if (typeof inc !== 'number') {\n      throw new Error(`invalid increment number: ${inc}`)\n    }\n\n    let n\n\n    if (!Object.prototype.hasOwnProperty.call(this._stats, key)) {\n      n = this._stats[key] = Big(0)\n    } else {\n      n = this._stats[key]\n    }\n    this._stats[key] = n.plus(inc)\n\n    if (!this._frequencyAccumulators[key]) {\n      this._frequencyAccumulators[key] = 0\n    }\n    this._frequencyAccumulators[key] += inc\n  }\n}\n\nmodule.exports = Stats\n","'use strict'\n\nconst exp = Math.exp\n\nexports =\nmodule.exports =\nfunction MovingAverage (timespan) {\n  if (typeof timespan !== 'number') { throw new Error('must provide a timespan to the moving average constructor') }\n\n  if (timespan <= 0) { throw new Error('must provide a timespan > 0 to the moving average constructor') }\n\n  let ma     // moving average\n  let v = 0  // variance\n  let d = 0  // deviation\n  let f = 0  // forecast\n\n  let previousTime\n\n  let ret = {}\n\n  function alpha (t, pt) {\n    return 1 - (exp(-(t - pt) / timespan))\n  }\n\n  ret.push =\n  function push (time, value) {\n    if (previousTime) {\n      // calculate moving average\n      const a = alpha(time, previousTime)\n      const diff = value - ma\n      const incr = a * diff\n      ma = a * value + (1 - a) * ma\n      // calculate variance & deviation\n      v = (1 - a) * (v + diff * incr)\n      d = Math.sqrt(v)\n      // calculate forecast\n      f = ma + a * diff\n    } else {\n      ma = value\n    }\n    previousTime = time\n  }\n\n  // Exponential Moving Average\n\n  ret.movingAverage =\n  function movingAverage () {\n    return ma\n  }\n\n  // Variance\n  ret.variance =\n  function variance () {\n    return v\n  }\n\n  ret.deviation =\n  function deviation () {\n    return d\n  }\n\n  ret.forecast =\n  function forecast () {\n    return f\n  }\n\n  return ret\n}\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:upgrader'), {\n  error: debug('libp2p:upgrader:err')\n})\nconst errCode = require('err-code')\n// @ts-ignore multistream-select does not export types\nconst Multistream = require('multistream-select')\nconst { Connection } = require('libp2p-interfaces/src/connection')\nconst PeerId = require('peer-id')\nconst { pipe } = require('it-pipe')\n// @ts-ignore mutable-proxy does not export types\nconst mutableProxy = require('mutable-proxy')\n\nconst { codes } = require('./errors')\n\n/**\n * @typedef {import('libp2p-interfaces/src/transport/types').MultiaddrConnection} MultiaddrConnection\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxerFactory} MuxerFactory\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').Muxer} Muxer\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n * @typedef {import('libp2p-interfaces/src/crypto/types').Crypto} Crypto\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n */\n\n/**\n * @typedef CryptoResult\n * @property {MultiaddrConnection} conn A duplex iterable\n * @property {PeerId} remotePeer\n * @property {string} protocol\n */\n\nclass Upgrader {\n  /**\n   * @param {object} options\n   * @param {PeerId} options.localPeer\n   * @param {import('./metrics')} [options.metrics]\n   * @param {Map<string, Crypto>} [options.cryptos]\n   * @param {Map<string, MuxerFactory>} [options.muxers]\n   * @param {(connection: Connection) => void} options.onConnection - Called when a connection is upgraded\n   * @param {(connection: Connection) => void} options.onConnectionEnd\n   */\n  constructor ({\n    localPeer,\n    metrics,\n    cryptos = new Map(),\n    muxers = new Map(),\n    onConnectionEnd = () => {},\n    onConnection = () => {}\n  }) {\n    this.localPeer = localPeer\n    this.metrics = metrics\n    this.cryptos = cryptos\n    this.muxers = muxers\n    /** @type {import(\"./pnet\") | null} */\n    this.protector = null\n    this.protocols = new Map()\n    this.onConnection = onConnection\n    this.onConnectionEnd = onConnectionEnd\n  }\n\n  /**\n   * Upgrades an inbound connection\n   *\n   * @async\n   * @param {MultiaddrConnection} maConn\n   * @returns {Promise<Connection>}\n   */\n  async upgradeInbound (maConn) {\n    let encryptedConn\n    let remotePeer\n    let upgradedConn\n    let Muxer\n    let cryptoProtocol\n    let setPeer\n    let proxyPeer\n\n    if (this.metrics) {\n      ({ setTarget: setPeer, proxy: proxyPeer } = mutableProxy())\n      const idString = (Math.random() * 1e9).toString(36) + Date.now()\n      setPeer({ toB58String: () => idString })\n      maConn = this.metrics.trackStream({ stream: maConn, remotePeer: proxyPeer })\n    }\n\n    log('Starting the inbound connection upgrade')\n\n    // Protect\n    let protectedConn = maConn\n    if (this.protector) {\n      protectedConn = await this.protector.protect(maConn)\n    }\n\n    try {\n      // Encrypt the connection\n      ({\n        conn: encryptedConn,\n        remotePeer,\n        protocol: cryptoProtocol\n      } = await this._encryptInbound(this.localPeer, protectedConn, this.cryptos))\n\n      // Multiplex the connection\n      if (this.muxers.size) {\n        ({ stream: upgradedConn, Muxer } = await this._multiplexInbound(encryptedConn, this.muxers))\n      } else {\n        upgradedConn = encryptedConn\n      }\n    } catch (err) {\n      log.error('Failed to upgrade inbound connection', err)\n      await maConn.close(err)\n      throw err\n    }\n\n    if (this.metrics) {\n      this.metrics.updatePlaceholder(proxyPeer, remotePeer)\n      setPeer(remotePeer)\n    }\n\n    log('Successfully upgraded inbound connection')\n\n    return this._createConnection({\n      cryptoProtocol,\n      direction: 'inbound',\n      maConn,\n      upgradedConn,\n      Muxer,\n      remotePeer\n    })\n  }\n\n  /**\n   * Upgrades an outbound connection\n   *\n   * @async\n   * @param {MultiaddrConnection} maConn\n   * @returns {Promise<Connection>}\n   */\n  async upgradeOutbound (maConn) {\n    const idStr = maConn.remoteAddr.getPeerId()\n    if (!idStr) {\n      throw errCode(new Error('outbound connection must have a peer id'), codes.ERR_INVALID_MULTIADDR)\n    }\n\n    const remotePeerId = PeerId.createFromB58String(idStr)\n\n    let encryptedConn\n    let remotePeer\n    let upgradedConn\n    let cryptoProtocol\n    let Muxer\n    let setPeer\n    let proxyPeer\n\n    if (this.metrics) {\n      ({ setTarget: setPeer, proxy: proxyPeer } = mutableProxy())\n      const idString = (Math.random() * 1e9).toString(36) + Date.now()\n      setPeer({ toB58String: () => idString })\n      maConn = this.metrics.trackStream({ stream: maConn, remotePeer: proxyPeer })\n    }\n\n    log('Starting the outbound connection upgrade')\n\n    // Protect\n    let protectedConn = maConn\n    if (this.protector) {\n      protectedConn = await this.protector.protect(maConn)\n    }\n\n    try {\n      // Encrypt the connection\n      ({\n        conn: encryptedConn,\n        remotePeer,\n        protocol: cryptoProtocol\n      } = await this._encryptOutbound(this.localPeer, protectedConn, remotePeerId, this.cryptos))\n\n      // Multiplex the connection\n      if (this.muxers.size) {\n        ({ stream: upgradedConn, Muxer } = await this._multiplexOutbound(encryptedConn, this.muxers))\n      } else {\n        upgradedConn = encryptedConn\n      }\n    } catch (err) {\n      log.error('Failed to upgrade outbound connection', err)\n      await maConn.close(err)\n      throw err\n    }\n\n    if (this.metrics) {\n      this.metrics.updatePlaceholder(proxyPeer, remotePeer)\n      setPeer(remotePeer)\n    }\n\n    log('Successfully upgraded outbound connection')\n\n    return this._createConnection({\n      cryptoProtocol,\n      direction: 'outbound',\n      maConn,\n      upgradedConn,\n      Muxer,\n      remotePeer\n    })\n  }\n\n  /**\n   * A convenience method for generating a new `Connection`\n   *\n   * @private\n   * @param {object} options\n   * @param {string} options.cryptoProtocol - The crypto protocol that was negotiated\n   * @param {'inbound' | 'outbound'} options.direction - One of ['inbound', 'outbound']\n   * @param {MultiaddrConnection} options.maConn - The transport layer connection\n   * @param {MuxedStream | MultiaddrConnection} options.upgradedConn - A duplex connection returned from multiplexer and/or crypto selection\n   * @param {MuxerFactory} [options.Muxer] - The muxer to be used for muxing\n   * @param {PeerId} options.remotePeer - The peer the connection is with\n   * @returns {Connection}\n   */\n  _createConnection ({\n    cryptoProtocol,\n    direction,\n    maConn,\n    upgradedConn,\n    Muxer,\n    remotePeer\n  }) {\n    /** @type {import(\"libp2p-interfaces/src/stream-muxer/types\").Muxer} */\n    let muxer\n    /** @type {import(\"libp2p-interfaces/src/connection/connection\").CreatedMuxedStream | undefined} */\n    let newStream\n    /** @type {Connection} */\n    let connection // eslint-disable-line prefer-const\n\n    if (Muxer) {\n      // Create the muxer\n      muxer = new Muxer({\n        // Run anytime a remote stream is created\n        onStream: async muxedStream => {\n          if (!connection) return\n          const mss = new Multistream.Listener(muxedStream)\n          try {\n            const { stream, protocol } = await mss.handle(Array.from(this.protocols.keys()))\n            log('%s: incoming stream opened on %s', direction, protocol)\n            if (this.metrics) this.metrics.trackStream({ stream, remotePeer, protocol })\n            connection.addStream(muxedStream, { protocol })\n            this._onStream({ connection, stream: { ...muxedStream, ...stream }, protocol })\n          } catch (err) {\n            log.error(err)\n          }\n        },\n        // Run anytime a stream closes\n        onStreamEnd: muxedStream => {\n          connection.removeStream(muxedStream.id)\n        }\n      })\n\n      newStream = async (protocols) => {\n        log('%s: starting new stream on %s', direction, protocols)\n        const muxedStream = muxer.newStream()\n        const mss = new Multistream.Dialer(muxedStream)\n        try {\n          const { stream, protocol } = await mss.select(protocols)\n          if (this.metrics) this.metrics.trackStream({ stream, remotePeer, protocol })\n          return { stream: { ...muxedStream, ...stream }, protocol }\n        } catch (err) {\n          log.error('could not create new stream', err)\n          throw errCode(err, codes.ERR_UNSUPPORTED_PROTOCOL)\n        }\n      }\n\n      // Pipe all data through the muxer\n      pipe(upgradedConn, muxer, upgradedConn).catch(log.error)\n    }\n\n    const _timeline = maConn.timeline\n    maConn.timeline = new Proxy(_timeline, {\n      set: (...args) => {\n        if (connection && args[1] === 'close' && args[2] && !_timeline.close) {\n          // Wait for close to finish before notifying of the closure\n          (async () => {\n            try {\n              if (connection.stat.status === 'open') {\n                await connection.close()\n              }\n            } catch (err) {\n              log.error(err)\n            } finally {\n              this.onConnectionEnd(connection)\n            }\n          })()\n        }\n\n        return Reflect.set(...args)\n      }\n    })\n    maConn.timeline.upgraded = Date.now()\n\n    const errConnectionNotMultiplexed = () => {\n      throw errCode(new Error('connection is not multiplexed'), 'ERR_CONNECTION_NOT_MULTIPLEXED')\n    }\n\n    // Create the connection\n    connection = new Connection({\n      localAddr: maConn.localAddr,\n      remoteAddr: maConn.remoteAddr,\n      localPeer: this.localPeer,\n      remotePeer: remotePeer,\n      stat: {\n        direction,\n        // @ts-ignore\n        timeline: maConn.timeline,\n        multiplexer: Muxer && Muxer.multicodec,\n        encryption: cryptoProtocol\n      },\n      newStream: newStream || errConnectionNotMultiplexed,\n      getStreams: () => muxer ? muxer.streams : errConnectionNotMultiplexed(),\n      close: async () => {\n        await maConn.close()\n        // Ensure remaining streams are aborted\n        if (muxer) {\n          muxer.streams.map(stream => stream.abort())\n        }\n      }\n    })\n\n    this.onConnection(connection)\n\n    return connection\n  }\n\n  /**\n   * Routes incoming streams to the correct handler\n   *\n   * @private\n   * @param {object} options\n   * @param {Connection} options.connection - The connection the stream belongs to\n   * @param {MuxedStream} options.stream\n   * @param {string} options.protocol\n   */\n  _onStream ({ connection, stream, protocol }) {\n    const handler = this.protocols.get(protocol)\n    handler({ connection, stream, protocol })\n  }\n\n  /**\n   * Attempts to encrypt the incoming `connection` with the provided `cryptos`.\n   *\n   * @private\n   * @async\n   * @param {PeerId} localPeer - The initiators PeerId\n   * @param {*} connection\n   * @param {Map<string, Crypto>} cryptos\n   * @returns {Promise<CryptoResult>} An encrypted connection, remote peer `PeerId` and the protocol of the `Crypto` used\n   */\n  async _encryptInbound (localPeer, connection, cryptos) {\n    const mss = new Multistream.Listener(connection)\n    const protocols = Array.from(cryptos.keys())\n    log('handling inbound crypto protocol selection', protocols)\n\n    try {\n      const { stream, protocol } = await mss.handle(protocols)\n      const crypto = cryptos.get(protocol)\n      log('encrypting inbound connection...')\n\n      if (!crypto) {\n        throw new Error(`no crypto module found for ${protocol}`)\n      }\n\n      return {\n        ...await crypto.secureInbound(localPeer, stream),\n        protocol\n      }\n    } catch (err) {\n      throw errCode(err, codes.ERR_ENCRYPTION_FAILED)\n    }\n  }\n\n  /**\n   * Attempts to encrypt the given `connection` with the provided `cryptos`.\n   * The first `Crypto` module to succeed will be used\n   *\n   * @private\n   * @async\n   * @param {PeerId} localPeer - The initiators PeerId\n   * @param {MultiaddrConnection} connection\n   * @param {PeerId} remotePeerId\n   * @param {Map<string, Crypto>} cryptos\n   * @returns {Promise<CryptoResult>} An encrypted connection, remote peer `PeerId` and the protocol of the `Crypto` used\n   */\n  async _encryptOutbound (localPeer, connection, remotePeerId, cryptos) {\n    const mss = new Multistream.Dialer(connection)\n    const protocols = Array.from(cryptos.keys())\n    log('selecting outbound crypto protocol', protocols)\n\n    try {\n      const { stream, protocol } = await mss.select(protocols)\n      const crypto = cryptos.get(protocol)\n      log('encrypting outbound connection to %j', remotePeerId)\n\n      if (!crypto) {\n        throw new Error(`no crypto module found for ${protocol}`)\n      }\n\n      return {\n        ...await crypto.secureOutbound(localPeer, stream, remotePeerId),\n        protocol\n      }\n    } catch (err) {\n      throw errCode(err, codes.ERR_ENCRYPTION_FAILED)\n    }\n  }\n\n  /**\n   * Selects one of the given muxers via multistream-select. That\n   * muxer will be used for all future streams on the connection.\n   *\n   * @private\n   * @async\n   * @param {MultiaddrConnection} connection - A basic duplex connection to multiplex\n   * @param {Map<string, MuxerFactory>} muxers - The muxers to attempt multiplexing with\n   * @returns {Promise<{ stream: MuxedStream, Muxer?: MuxerFactory}>} A muxed connection\n   */\n  async _multiplexOutbound (connection, muxers) {\n    const dialer = new Multistream.Dialer(connection)\n    const protocols = Array.from(muxers.keys())\n    log('outbound selecting muxer %s', protocols)\n    try {\n      const { stream, protocol } = await dialer.select(protocols)\n      log('%s selected as muxer protocol', protocol)\n      const Muxer = muxers.get(protocol)\n      return { stream, Muxer }\n    } catch (err) {\n      throw errCode(err, codes.ERR_MUXER_UNAVAILABLE)\n    }\n  }\n\n  /**\n   * Registers support for one of the given muxers via multistream-select. The\n   * selected muxer will be used for all future streams on the connection.\n   *\n   * @private\n   * @async\n   * @param {MultiaddrConnection} connection - A basic duplex connection to multiplex\n   * @param {Map<string, MuxerFactory>} muxers - The muxers to attempt multiplexing with\n   * @returns {Promise<{ stream: MuxedStream, Muxer?: MuxerFactory}>} A muxed connection\n   */\n  async _multiplexInbound (connection, muxers) {\n    const listener = new Multistream.Listener(connection)\n    const protocols = Array.from(muxers.keys())\n    log('inbound handling muxers %s', protocols)\n    try {\n      const { stream, protocol } = await listener.handle(protocols)\n      const Muxer = muxers.get(protocol)\n      return { stream, Muxer }\n    } catch (err) {\n      throw errCode(err, codes.ERR_MUXER_UNAVAILABLE)\n    }\n  }\n}\n\nmodule.exports = Upgrader\n","'use strict'\n\nconst select = require('./select')\nconst handle = require('./handle')\nconst ls = require('./ls')\nconst { PROTOCOL_ID } = require('./constants')\n\nexports.PROTOCOL_ID = PROTOCOL_ID\n\nclass MultistreamSelect {\n  constructor (stream) {\n    this._stream = stream\n    this._shaken = false\n  }\n\n  // Perform the multistream-select handshake\n  async _handshake () {\n    if (this._shaken) return\n    const { stream } = await select(this._stream, PROTOCOL_ID)\n    this._stream = stream\n    this._shaken = true\n  }\n}\n\nclass Dialer extends MultistreamSelect {\n  select (protocols) {\n    return select(this._stream, protocols, this._shaken ? null : PROTOCOL_ID)\n  }\n\n  async ls () {\n    await this._handshake()\n    const { stream, protocols } = await ls(this._stream)\n    this._stream = stream\n    return protocols\n  }\n}\n\nexports.Dialer = Dialer\n\nclass Listener extends MultistreamSelect {\n  handle (protocols) {\n    return handle(this._stream, protocols)\n  }\n}\n\nexports.Listener = Listener\n","'use strict'\n\nconst log = require('debug')('mss:select')\nconst errCode = require('err-code')\nconst multistream = require('./multistream')\nconst handshake = require('it-handshake')\n\nmodule.exports = async (stream, protocols, protocolId) => {\n  protocols = Array.isArray(protocols) ? [...protocols] : [protocols]\n  const { reader, writer, rest, stream: shakeStream } = handshake(stream)\n\n  const protocol = protocols.shift()\n  if (protocolId) {\n    log('select: write [\"%s\", \"%s\"]', protocolId, protocol)\n    multistream.writeAll(writer, [protocolId, protocol])\n  } else {\n    log('select: write \"%s\"', protocol)\n    multistream.write(writer, protocol)\n  }\n\n  let response = (await multistream.read(reader)).toString()\n  log('select: read \"%s\"', response)\n\n  // Read the protocol response if we got the protocolId in return\n  if (response === protocolId) {\n    response = (await multistream.read(reader)).toString()\n    log('select: read \"%s\"', response)\n  }\n\n  // We're done\n  if (response === protocol) {\n    rest()\n    return { stream: shakeStream, protocol }\n  }\n\n  // We haven't gotten a valid ack, try the other protocols\n  for (const protocol of protocols) {\n    log('select: write \"%s\"', protocol)\n    multistream.write(writer, protocol)\n    const response = (await multistream.read(reader)).toString()\n    log('select: read \"%s\" for \"%s\"', response, protocol)\n\n    if (response === protocol) {\n      rest() // End our writer so others can start writing to stream\n      return { stream: shakeStream, protocol }\n    }\n  }\n\n  rest()\n  throw errCode(new Error('protocol selection failed'), 'ERR_UNSUPPORTED_PROTOCOL')\n}\n","'use strict'\n\nconst BufferList = require('bl/BufferList')\nconst lp = require('it-length-prefixed')\nconst pipe = require('it-pipe')\nconst errCode = require('err-code')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst first = require('it-first')\n\nconst NewLine = uint8ArrayFromString('\\n')\n\nexports.encode = buffer => lp.encode.single(new BufferList([buffer, NewLine]))\n\n// `write` encodes and writes a single buffer\nexports.write = (writer, buffer) => writer.push(exports.encode(buffer))\n\n// `writeAll` behaves like `write`, except it encodes an array of items as a single write\nexports.writeAll = (writer, buffers) => {\n  writer.push(buffers.reduce((bl, buffer) => bl.append(exports.encode(buffer)), new BufferList()))\n}\n\nexports.read = async reader => {\n  let byteLength = 1 // Read single byte chunks until the length is known\n  const varByteSource = { // No return impl - we want the reader to remain readable\n    [Symbol.asyncIterator] () { return this },\n    next: () => reader.next(byteLength)\n  }\n\n  // Once the length has been parsed, read chunk for that length\n  const onLength = l => { byteLength = l }\n  const buf = await pipe(varByteSource, lp.decode({ onLength }), first)\n\n  if (buf.get(buf.length - 1) !== NewLine[0]) {\n    throw errCode(new Error('missing newline'), 'ERR_INVALID_MULTISTREAM_SELECT_MESSAGE')\n  }\n\n  return buf.shallowSlice(0, -1) // Remove newline\n}\n","'use strict'\n\nconst log = require('debug')('mss:handle')\nconst BufferList = require('bl/BufferList')\nconst multistream = require('./multistream')\nconst handshake = require('it-handshake')\nconst { PROTOCOL_ID } = require('./constants')\n\nmodule.exports = async (stream, protocols) => {\n  protocols = Array.isArray(protocols) ? protocols : [protocols]\n  const { writer, reader, rest, stream: shakeStream } = handshake(stream)\n\n  while (true) {\n    const protocol = (await multistream.read(reader)).toString()\n    log('read \"%s\"', protocol)\n\n    if (protocol === PROTOCOL_ID) {\n      log('respond with \"%s\" for \"%s\"', PROTOCOL_ID, protocol)\n      multistream.write(writer, PROTOCOL_ID)\n      continue\n    }\n\n    if (protocols.includes(protocol)) {\n      multistream.write(writer, protocol)\n      log('respond with \"%s\" for \"%s\"', protocol, protocol)\n      rest()\n      return { stream: shakeStream, protocol }\n    }\n\n    if (protocol === 'ls') {\n      // <varint-msg-len><varint-proto-name-len><proto-name>\\n<varint-proto-name-len><proto-name>\\n\\n\n      multistream.write(writer, new BufferList(\n        protocols.map(p => multistream.encode(p))\n      ))\n      log('respond with \"%s\" for %s', protocols, protocol)\n      continue\n    }\n\n    multistream.write(writer, 'na')\n    log('respond with \"na\" for \"%s\"', protocol)\n  }\n}\n","'use strict'\n\nexports.PROTOCOL_ID = '/multistream/1.0.0'\n","'use strict'\n\nconst Reader = require('it-reader')\nconst log = require('debug')('it-multistream-select:ls')\nconst multistream = require('./multistream')\nconst handshake = require('it-handshake')\nconst lp = require('it-length-prefixed')\nconst pipe = require('it-pipe')\n\nmodule.exports = async stream => {\n  const { reader, writer, rest, stream: shakeStream } = handshake(stream)\n\n  log('write \"ls\"')\n  multistream.write(writer, 'ls')\n  rest()\n\n  // Next message from remote will be (e.g. for 2 protocols):\n  // <varint-msg-len><varint-proto-name-len><proto-name>\\n<varint-proto-name-len><proto-name>\\n\n  const res = await multistream.read(reader)\n\n  // After reading response we have:\n  // <varint-proto-name-len><proto-name>\\n<varint-proto-name-len><proto-name>\\n\n  const protocolsReader = Reader([res])\n  const protocols = []\n\n  // Decode each of the protocols from the reader\n  await pipe(\n    protocolsReader,\n    lp.decode(),\n    async source => {\n      for await (const protocol of source) {\n        // Remove the newline\n        protocols.push(protocol.shallowSlice(0, -1).toString())\n      }\n    }\n  )\n\n  return { stream: shakeStream, protocols }\n}\n","'use strict'\n\nexports.Connection = require('./connection')\n","'use strict'\n\nconst PeerId = require('peer-id')\nconst { Multiaddr } = require('multiaddr')\nconst errCode = require('err-code')\nconst { OPEN, CLOSING, CLOSED } = require('./status')\n\nconst connectionSymbol = Symbol.for('@libp2p/interface-connection/connection')\n\n/**\n * @typedef {import('../stream-muxer/types').MuxedStream} MuxedStream\n * @typedef {import('./status').Status} Status\n */\n\n/**\n * @typedef {Object} Timeline\n * @property {number} open - connection opening timestamp.\n * @property {number} [upgraded] - connection upgraded timestamp.\n * @property {number} [close]\n *\n * @typedef {Object} ConectionStat\n * @property {'inbound' | 'outbound'} direction - connection establishment direction\n * @property {Timeline} timeline - connection relevant events timestamp.\n * @property {string} [multiplexer] - connection multiplexing identifier.\n * @property {string} [encryption] - connection encryption method identifier.\n *\n * @typedef {(protocols: string|string[]) => Promise<{stream: MuxedStream, protocol: string}>} CreatedMuxedStream\n *\n * @typedef {Object} ConnectionOptions\n * @property {Multiaddr} [localAddr] - local multiaddr of the connection if known.\n * @property {Multiaddr} remoteAddr - remote multiaddr of the connection.\n * @property {PeerId} localPeer - local peer-id.\n * @property {PeerId} remotePeer - remote peer-id.\n * @property {CreatedMuxedStream} newStream - new stream muxer function.\n * @property {() => Promise<void>} close - close raw connection function.\n * @property {() => MuxedStream[]} getStreams - get streams from muxer function.\n * @property {ConectionStat} stat - metadata of the connection.\n *\n * @typedef {Object} StreamData\n * @property {string} protocol - the protocol used by the stream\n * @property {Object} [metadata] - metadata of the stream\n */\n\n/**\n * An implementation of the js-libp2p connection.\n * Any libp2p transport should use an upgrader to return this connection.\n */\nclass Connection {\n  /**\n   * An implementation of the js-libp2p connection.\n   * Any libp2p transport should use an upgrader to return this connection.\n   *\n   * @class\n   * @param {ConnectionOptions} options\n   */\n  constructor ({ localAddr, remoteAddr, localPeer, remotePeer, newStream, close, getStreams, stat }) {\n    validateArgs(localAddr, localPeer, remotePeer, newStream, close, getStreams, stat)\n\n    /**\n     * Connection identifier.\n     */\n    this.id = (parseInt(String(Math.random() * 1e9))).toString(36) + Date.now()\n\n    /**\n     * Observed multiaddr of the local peer\n     */\n    this.localAddr = localAddr\n\n    /**\n     * Observed multiaddr of the remote peer\n     */\n    this.remoteAddr = remoteAddr\n\n    /**\n     * Local peer id.\n     */\n    this.localPeer = localPeer\n\n    /**\n     * Remote peer id.\n     */\n    this.remotePeer = remotePeer\n\n    /**\n     * Connection metadata.\n     *\n     * @type {ConectionStat & {status: Status}}\n     */\n    this._stat = {\n      ...stat,\n      status: OPEN\n    }\n\n    /**\n     * Reference to the new stream function of the multiplexer\n     */\n    this._newStream = newStream\n\n    /**\n     * Reference to the close function of the raw connection\n     */\n    this._close = close\n\n    /**\n     * Reference to the getStreams function of the muxer\n     */\n    this._getStreams = getStreams\n\n    /**\n     * Connection streams registry\n     */\n    this.registry = new Map()\n\n    /**\n     * User provided tags\n     *\n     * @type {string[]}\n     */\n    this.tags = []\n  }\n\n  get [Symbol.toStringTag] () {\n    return 'Connection'\n  }\n\n  get [connectionSymbol] () {\n    return true\n  }\n\n  /**\n   * Checks if the given value is a `Connection` instance.\n   *\n   * @param {any} other\n   * @returns {other is Connection}\n   */\n  static isConnection (other) {\n    return Boolean(other && other[connectionSymbol])\n  }\n\n  /**\n   * Get connection metadata\n   *\n   * @this {Connection}\n   */\n  get stat () {\n    return this._stat\n  }\n\n  /**\n   * Get all the streams of the muxer.\n   *\n   * @this {Connection}\n   */\n  get streams () {\n    return this._getStreams()\n  }\n\n  /**\n   * Create a new stream from this connection\n   *\n   * @param {string|string[]} protocols - intended protocol for the stream\n   * @returns {Promise<{stream: MuxedStream, protocol: string}>} with muxed+multistream-selected stream and selected protocol\n   */\n  async newStream (protocols) {\n    if (this.stat.status === CLOSING) {\n      throw errCode(new Error('the connection is being closed'), 'ERR_CONNECTION_BEING_CLOSED')\n    }\n\n    if (this.stat.status === CLOSED) {\n      throw errCode(new Error('the connection is closed'), 'ERR_CONNECTION_CLOSED')\n    }\n\n    if (!Array.isArray(protocols)) protocols = [protocols]\n\n    const { stream, protocol } = await this._newStream(protocols)\n\n    this.addStream(stream, { protocol })\n\n    return {\n      stream,\n      protocol\n    }\n  }\n\n  /**\n   * Add a stream when it is opened to the registry.\n   *\n   * @param {MuxedStream} muxedStream - a muxed stream\n   * @param {StreamData} data - the stream data to be registered\n   * @returns {void}\n   */\n  addStream (muxedStream, { protocol, metadata = {} }) {\n    // Add metadata for the stream\n    this.registry.set(muxedStream.id, {\n      protocol,\n      ...metadata\n    })\n  }\n\n  /**\n   * Remove stream registry after it is closed.\n   *\n   * @param {string} id - identifier of the stream\n   */\n  removeStream (id) {\n    this.registry.delete(id)\n  }\n\n  /**\n   * Close the connection.\n   *\n   * @returns {Promise<void>}\n   */\n  async close () {\n    if (this.stat.status === CLOSED) {\n      return\n    }\n\n    if (this._closing) {\n      return this._closing\n    }\n\n    this.stat.status = CLOSING\n\n    // Close raw connection\n    this._closing = await this._close()\n\n    this._stat.timeline.close = Date.now()\n    this.stat.status = CLOSED\n  }\n}\n\nmodule.exports = Connection\n\n/**\n * @param {Multiaddr|undefined} localAddr\n * @param {PeerId} localPeer\n * @param {PeerId} remotePeer\n * @param {(protocols: string | string[]) => Promise<{ stream: import(\"../stream-muxer/types\").MuxedStream; protocol: string; }>} newStream\n * @param {() => Promise<void>} close\n * @param {() => import(\"../stream-muxer/types\").MuxedStream[]} getStreams\n * @param {{ direction: any; timeline: any; multiplexer?: string | undefined; encryption?: string | undefined; }} stat\n */\nfunction validateArgs (localAddr, localPeer, remotePeer, newStream, close, getStreams, stat) {\n  if (localAddr && !Multiaddr.isMultiaddr(localAddr)) {\n    throw errCode(new Error('localAddr must be an instance of multiaddr'), 'ERR_INVALID_PARAMETERS')\n  }\n\n  if (!PeerId.isPeerId(localPeer)) {\n    throw errCode(new Error('localPeer must be an instance of peer-id'), 'ERR_INVALID_PARAMETERS')\n  }\n\n  if (!PeerId.isPeerId(remotePeer)) {\n    throw errCode(new Error('remotePeer must be an instance of peer-id'), 'ERR_INVALID_PARAMETERS')\n  }\n\n  if (typeof newStream !== 'function') {\n    throw errCode(new Error('new stream must be a function'), 'ERR_INVALID_PARAMETERS')\n  }\n\n  if (typeof close !== 'function') {\n    throw errCode(new Error('close must be a function'), 'ERR_INVALID_PARAMETERS')\n  }\n\n  if (typeof getStreams !== 'function') {\n    throw errCode(new Error('getStreams must be a function'), 'ERR_INVALID_PARAMETERS')\n  }\n\n  if (!stat) {\n    throw errCode(new Error('connection metadata object must be provided'), 'ERR_INVALID_PARAMETERS')\n  }\n\n  if (stat.direction !== 'inbound' && stat.direction !== 'outbound') {\n    throw errCode(new Error('direction must be \"inbound\" or \"outbound\"'), 'ERR_INVALID_PARAMETERS')\n  }\n\n  if (!stat.timeline) {\n    throw errCode(new Error('connection timeline object must be provided in the stat object'), 'ERR_INVALID_PARAMETERS')\n  }\n\n  if (!stat.timeline.open) {\n    throw errCode(new Error('connection open timestamp must be provided'), 'ERR_INVALID_PARAMETERS')\n  }\n\n  if (!stat.timeline.upgraded) {\n    throw errCode(new Error('connection upgraded timestamp must be provided'), 'ERR_INVALID_PARAMETERS')\n  }\n}\n","'use strict'\n\nconst STATUS = {\n  OPEN: /** @type {'open'} */('open'),\n  CLOSING: /** @type {'closing'} */('closing'),\n  CLOSED: /** @type {'closed'} */('closed')\n}\nmodule.exports = STATUS\n\n/**\n * @typedef {STATUS[keyof STATUS]} Status\n */\n","'use strict';\n\nfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\n\nmodule.exports = function mutableProxyFactory(defaultTarget) {\n  var mutableHandler = void 0;\n  var mutableTarget = void 0;\n\n  function setTarget(target) {\n    if (!(target instanceof Object)) {\n      throw new Error('Target \"' + target + '\" is not an object');\n    }\n    mutableTarget = target;\n  }\n\n  function setHandler(handler) {\n    Object.keys(handler).forEach(function (key) {\n      var value = handler[key];\n\n      if (typeof value !== 'function') {\n        throw new Error('Trap \"' + key + ': ' + value + '\" is not a function');\n      }\n\n      if (!Reflect[key]) {\n        throw new Error('Trap \"' + key + ': ' + value + '\" is not a valid trap');\n      }\n    });\n    mutableHandler = handler;\n  }\n  setTarget(function () {});\n\n  if (defaultTarget) {\n    setTarget(defaultTarget);\n  }\n  setHandler(Reflect);\n\n  // Dynamically forward all the traps to the associated methods on the mutable handler\n  var handler = new Proxy({}, {\n    get: function get(target, property) {\n      return function () {\n        for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n          args[_key] = arguments[_key];\n        }\n\n        return mutableHandler[property].apply(null, [mutableTarget].concat(_toConsumableArray(args.slice(1))));\n      };\n    }\n  });\n\n  return {\n    setTarget: setTarget,\n    setHandler: setHandler,\n    getTarget: function getTarget() {\n      return mutableTarget;\n    },\n    getHandler: function getHandler() {\n      return mutableHandler;\n    },\n\n    proxy: new Proxy(mutableTarget, handler)\n  };\n};","'use strict'\n\nconst errcode = require('err-code')\n\nconst { EventEmitter } = require('events')\nconst PeerId = require('peer-id')\n\nconst AddressBook = require('./address-book')\nconst KeyBook = require('./key-book')\nconst MetadataBook = require('./metadata-book')\nconst ProtoBook = require('./proto-book')\n\nconst {\n  codes: { ERR_INVALID_PARAMETERS }\n} = require('../errors')\n\n/**\n * @typedef {import('./address-book').Address} Address\n */\n\n/**\n * @extends {EventEmitter}\n *\n * @fires PeerStore#peer Emitted when a new peer is added.\n * @fires PeerStore#change:protocols Emitted when a known peer supports a different set of protocols.\n * @fires PeerStore#change:multiaddrs Emitted when a known peer has a different set of multiaddrs.\n * @fires PeerStore#change:pubkey Emitted emitted when a peer's public key is known.\n * @fires PeerStore#change:metadata Emitted when the known metadata of a peer change.\n */\nclass PeerStore extends EventEmitter {\n  /**\n   * Peer object\n   *\n   * @typedef {Object} Peer\n   * @property {PeerId} id peer's peer-id instance.\n   * @property {Address[]} addresses peer's addresses containing its multiaddrs and metadata.\n   * @property {string[]} protocols peer's supported protocols.\n   * @property {Map<string, Uint8Array>|undefined} metadata peer's metadata map.\n   */\n\n  /**\n   * Responsible for managing known peers, as well as their addresses, protocols and metadata.\n   *\n   * @param {object} options\n   * @param {PeerId} options.peerId\n   * @class\n   */\n  constructor ({ peerId }) {\n    super()\n\n    this._peerId = peerId\n\n    /**\n     * AddressBook containing a map of peerIdStr to Address.\n     */\n    this.addressBook = new AddressBook(this)\n\n    /**\n     * KeyBook containing a map of peerIdStr to their PeerId with public keys.\n     */\n    this.keyBook = new KeyBook(this)\n\n    /**\n     * MetadataBook containing a map of peerIdStr to their metadata Map.\n     */\n    this.metadataBook = new MetadataBook(this)\n\n    /**\n     * ProtoBook containing a map of peerIdStr to supported protocols.\n     */\n    this.protoBook = new ProtoBook(this)\n  }\n\n  /**\n   * Start the PeerStore.\n   */\n  start () {}\n\n  /**\n   * Stop the PeerStore.\n   */\n  stop () {}\n\n  /**\n   * Get all the stored information of every peer known.\n   *\n   * @returns {Map<string, Peer>}\n   */\n  get peers () {\n    const storedPeers = new Set([\n      ...this.addressBook.data.keys(),\n      ...this.keyBook.data.keys(),\n      ...this.protoBook.data.keys(),\n      ...this.metadataBook.data.keys()\n    ])\n\n    // Remove self peer if present\n    this._peerId && storedPeers.delete(this._peerId.toB58String())\n\n    const peersData = new Map()\n    storedPeers.forEach((idStr) => {\n      peersData.set(idStr, this.get(PeerId.createFromCID(idStr)))\n    })\n\n    return peersData\n  }\n\n  /**\n   * Delete the information of the given peer in every book.\n   *\n   * @param {PeerId} peerId\n   * @returns {boolean} true if found and removed\n   */\n  delete (peerId) {\n    const addressesDeleted = this.addressBook.delete(peerId)\n    const keyDeleted = this.keyBook.delete(peerId)\n    const protocolsDeleted = this.protoBook.delete(peerId)\n    const metadataDeleted = this.metadataBook.delete(peerId)\n\n    return addressesDeleted || keyDeleted || protocolsDeleted || metadataDeleted\n  }\n\n  /**\n   * Get the stored information of a given peer.\n   *\n   * @param {PeerId} peerId\n   * @returns {Peer|undefined}\n   */\n  get (peerId) {\n    if (!PeerId.isPeerId(peerId)) {\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    const id = this.keyBook.data.get(peerId.toB58String())\n    const addresses = this.addressBook.get(peerId)\n    const metadata = this.metadataBook.get(peerId)\n    const protocols = this.protoBook.get(peerId)\n\n    if (!id && !addresses && !metadata && !protocols) {\n      return undefined\n    }\n\n    return {\n      id: id || peerId,\n      addresses: addresses || [],\n      protocols: protocols || [],\n      metadata: metadata\n    }\n  }\n}\n\nmodule.exports = PeerStore\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:peer-store:address-book'), {\n  error: debug('libp2p:peer-store:address-book:err')\n})\nconst errcode = require('err-code')\n\nconst { Multiaddr } = require('multiaddr')\nconst PeerId = require('peer-id')\n\nconst Book = require('./book')\nconst PeerRecord = require('../record/peer-record')\n\nconst {\n  codes: { ERR_INVALID_PARAMETERS }\n} = require('../errors')\nconst Envelope = require('../record/envelope')\n\n/**\n * @typedef {import('./')} PeerStore\n */\n\n/**\n * @typedef {Object} Address\n * @property {Multiaddr} multiaddr peer multiaddr.\n * @property {boolean} isCertified obtained from a signed peer record.\n *\n * @typedef {Object} CertifiedRecord\n * @property {Uint8Array} raw raw envelope.\n * @property {number} seqNumber seq counter.\n *\n * @typedef {Object} Entry\n * @property {Address[]} addresses peer Addresses.\n * @property {CertifiedRecord} record certified peer record.\n */\n\n/**\n * @extends {Book}\n */\nclass AddressBook extends Book {\n  /**\n   * The AddressBook is responsible for keeping the known multiaddrs of a peer.\n   *\n   * @class\n   * @param {PeerStore} peerStore\n   */\n  constructor (peerStore) {\n    /**\n     * PeerStore Event emitter, used by the AddressBook to emit:\n     * \"peer\" - emitted when a peer is discovered by the node.\n     * \"change:multiaddrs\" - emitted when the known multiaddrs of a peer change.\n     */\n    super({\n      peerStore,\n      eventName: 'change:multiaddrs',\n      eventProperty: 'multiaddrs',\n      eventTransformer: (data) => {\n        if (!data.addresses) {\n          return []\n        }\n        return data.addresses.map((/** @type {Address} */ address) => address.multiaddr)\n      }\n    })\n\n    /**\n     * Map known peers to their known Address Entries.\n     *\n     * @type {Map<string, Entry>}\n     */\n    this.data = new Map()\n  }\n\n  /**\n   * ConsumePeerRecord adds addresses from a signed peer record contained in a record envelope.\n   * This will return a boolean that indicates if the record was successfully processed and added\n   * into the AddressBook.\n   *\n   * @param {Envelope} envelope\n   * @returns {boolean}\n   */\n  consumePeerRecord (envelope) {\n    let peerRecord\n    try {\n      peerRecord = PeerRecord.createFromProtobuf(envelope.payload)\n    } catch (err) {\n      log.error('invalid peer record received')\n      return false\n    }\n\n    // Verify peerId\n    if (!peerRecord.peerId.equals(envelope.peerId)) {\n      log('signing key does not match PeerId in the PeerRecord')\n      return false\n    }\n\n    // ensure the record has multiaddrs\n    if (!peerRecord.multiaddrs || !peerRecord.multiaddrs.length) {\n      return false\n    }\n\n    const peerId = peerRecord.peerId\n    const id = peerId.toB58String()\n    const entry = this.data.get(id) || { record: undefined }\n    const storedRecord = entry.record\n\n    // ensure seq is greater than, or equal to, the last received\n    if (storedRecord && storedRecord.seqNumber >= peerRecord.seqNumber) {\n      return false\n    }\n\n    const addresses = this._toAddresses(peerRecord.multiaddrs, true)\n\n    // Replace unsigned addresses by the new ones from the record\n    // TODO: Once we have ttls for the addresses, we should merge these in.\n    this._setData(peerId, {\n      addresses,\n      record: {\n        raw: envelope.marshal(),\n        seqNumber: peerRecord.seqNumber\n      }\n    })\n    log(`stored provided peer record for ${id}`)\n\n    return true\n  }\n\n  /**\n   * Get the raw Envelope for a peer. Returns\n   * undefined if no Envelope is found.\n   *\n   * @param {PeerId} peerId\n   * @returns {Uint8Array|undefined}\n   */\n  getRawEnvelope (peerId) {\n    const entry = this.data.get(peerId.toB58String())\n\n    if (!entry || !entry.record || !entry.record.raw) {\n      return undefined\n    }\n\n    return entry.record.raw\n  }\n\n  /**\n   * Get an Envelope containing a PeerRecord for the given peer.\n   * Returns undefined if no record exists.\n   *\n   * @param {PeerId} peerId\n   * @returns {Promise<Envelope|void>|undefined}\n   */\n  getPeerRecord (peerId) {\n    const raw = this.getRawEnvelope(peerId)\n\n    if (!raw) {\n      return undefined\n    }\n\n    return Envelope.createFromProtobuf(raw)\n  }\n\n  /**\n   * Set known multiaddrs of a provided peer.\n   * This will replace previously stored multiaddrs, if available.\n   * Replacing stored multiaddrs might result in losing obtained certified addresses.\n   * If you are not sure, it's recommended to use `add` instead.\n   *\n   * @override\n   * @param {PeerId} peerId\n   * @param {Multiaddr[]} multiaddrs\n   * @returns {AddressBook}\n   */\n  set (peerId, multiaddrs) {\n    if (!PeerId.isPeerId(peerId)) {\n      log.error('peerId must be an instance of peer-id to store data')\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    const addresses = this._toAddresses(multiaddrs)\n\n    // Not replace multiaddrs\n    if (!addresses.length) {\n      return this\n    }\n\n    const id = peerId.toB58String()\n    const entry = this.data.get(id)\n\n    // Already knows the peer\n    if (entry && entry.addresses && entry.addresses.length === addresses.length) {\n      const intersection = entry.addresses.filter((addr) => addresses.some((newAddr) => addr.multiaddr.equals(newAddr.multiaddr)))\n\n      // Are new addresses equal to the old ones?\n      // If yes, no changes needed!\n      if (intersection.length === entry.addresses.length) {\n        log(`the addresses provided to store are equal to the already stored for ${id}`)\n        return this\n      }\n    }\n\n    this._setData(peerId, {\n      addresses,\n      record: entry && entry.record\n    })\n    log(`stored provided multiaddrs for ${id}`)\n\n    // Notify the existance of a new peer\n    if (!entry) {\n      this._ps.emit('peer', peerId)\n    }\n\n    return this\n  }\n\n  /**\n   * Add known addresses of a provided peer.\n   * If the peer is not known, it is set with the given addresses.\n   *\n   * @param {PeerId} peerId\n   * @param {Multiaddr[]} multiaddrs\n   * @returns {AddressBook}\n   */\n  add (peerId, multiaddrs) {\n    if (!PeerId.isPeerId(peerId)) {\n      log.error('peerId must be an instance of peer-id to store data')\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    const addresses = this._toAddresses(multiaddrs)\n    const id = peerId.toB58String()\n\n    // No addresses to be added\n    if (!addresses.length) {\n      return this\n    }\n\n    const entry = this.data.get(id)\n\n    if (entry && entry.addresses) {\n      // Add recorded uniquely to the new array (Union)\n      entry.addresses.forEach((addr) => {\n        if (!addresses.find(r => r.multiaddr.equals(addr.multiaddr))) {\n          addresses.push(addr)\n        }\n      })\n\n      // If the recorded length is equal to the new after the unique union\n      // The content is the same, no need to update.\n      if (entry.addresses.length === addresses.length) {\n        log(`the addresses provided to store are already stored for ${id}`)\n        return this\n      }\n    }\n\n    this._setData(peerId, {\n      addresses,\n      record: entry && entry.record\n    })\n\n    log(`added provided multiaddrs for ${id}`)\n\n    // Notify the existance of a new peer\n    if (!(entry && entry.addresses)) {\n      this._ps.emit('peer', peerId)\n    }\n\n    return this\n  }\n\n  /**\n   * Get the known data of a provided peer.\n   *\n   * @override\n   * @param {PeerId} peerId\n   * @returns {Address[]|undefined}\n   */\n  get (peerId) {\n    if (!PeerId.isPeerId(peerId)) {\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    const entry = this.data.get(peerId.toB58String())\n\n    return entry && entry.addresses ? [...entry.addresses] : undefined\n  }\n\n  /**\n   * Transforms received multiaddrs into Address.\n   *\n   * @private\n   * @param {Multiaddr[]} multiaddrs\n   * @param {boolean} [isCertified]\n   * @returns {Address[]}\n   */\n  _toAddresses (multiaddrs, isCertified = false) {\n    if (!multiaddrs) {\n      log.error('multiaddrs must be provided to store data')\n      throw errcode(new Error('multiaddrs must be provided'), ERR_INVALID_PARAMETERS)\n    }\n\n    // create Address for each address\n    /** @type {Address[]} */\n    const addresses = []\n    multiaddrs.forEach((addr) => {\n      if (!Multiaddr.isMultiaddr(addr)) {\n        log.error(`multiaddr ${addr} must be an instance of multiaddr`)\n        throw errcode(new Error(`multiaddr ${addr} must be an instance of multiaddr`), ERR_INVALID_PARAMETERS)\n      }\n\n      // Guarantee no replicates\n      if (!addresses.find((a) => a.multiaddr.equals(addr))) {\n        addresses.push({\n          multiaddr: addr,\n          isCertified\n        })\n      }\n    })\n\n    return addresses\n  }\n\n  /**\n   * Get the known multiaddrs for a given peer. All returned multiaddrs\n   * will include the encapsulated `PeerId` of the peer.\n   * Returns `undefined` if there are no known multiaddrs for the given peer.\n   *\n   * @param {PeerId} peerId\n   * @param {(addresses: Address[]) => Address[]} [addressSorter]\n   * @returns {Multiaddr[]|undefined}\n   */\n  getMultiaddrsForPeer (peerId, addressSorter = (ms) => ms) {\n    if (!PeerId.isPeerId(peerId)) {\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    const entry = this.data.get(peerId.toB58String())\n    if (!entry || !entry.addresses) {\n      return undefined\n    }\n\n    return addressSorter(\n      entry.addresses || []\n    ).map((address) => {\n      const multiaddr = address.multiaddr\n\n      const idString = multiaddr.getPeerId()\n      if (idString && idString === peerId.toB58String()) return multiaddr\n\n      return multiaddr.encapsulate(`/p2p/${peerId.toB58String()}`)\n    })\n  }\n}\n\nmodule.exports = AddressBook\n","'use strict'\n\nconst errcode = require('err-code')\nconst PeerId = require('peer-id')\n\nconst {\n  codes: { ERR_INVALID_PARAMETERS }\n} = require('../errors')\n\n/**\n * @param {any} data\n */\nconst passthrough = data => data\n\n/**\n * @typedef {import('./')} PeerStore\n */\n\nclass Book {\n  /**\n   * The Book is the skeleton for the PeerStore books.\n   *\n   * @class\n   * @param {Object} properties\n   * @param {PeerStore} properties.peerStore - PeerStore instance.\n   * @param {string} properties.eventName - Name of the event to emit by the PeerStore.\n   * @param {string} properties.eventProperty - Name of the property to emit by the PeerStore.\n   * @param {(data: any) => any[]} [properties.eventTransformer] - Transformer function of the provided data for being emitted.\n   */\n  constructor ({ peerStore, eventName, eventProperty, eventTransformer = passthrough }) {\n    this._ps = peerStore\n    this.eventName = eventName\n    this.eventProperty = eventProperty\n    this.eventTransformer = eventTransformer\n\n    /**\n     * Map known peers to their data.\n     *\n     * @type {Map<string, any[]|any>}\n     */\n    this.data = new Map()\n  }\n\n  /**\n   * Set known data of a provided peer.\n   *\n   * @param {PeerId} peerId\n   * @param {any[]|any} data\n   */\n  set (peerId, data) {\n    throw errcode(new Error('set must be implemented by the subclass'), 'ERR_NOT_IMPLEMENTED')\n  }\n\n  /**\n   * Set data into the datastructure, persistence and emit it using the provided transformers.\n   *\n   * @protected\n   * @param {PeerId} peerId - peerId of the data to store\n   * @param {any} data - data to store.\n   * @param {Object} [options] - storing options.\n   * @param {boolean} [options.emit = true] - emit the provided data.\n   * @returns {void}\n   */\n  _setData (peerId, data, { emit = true } = {}) {\n    const b58key = peerId.toB58String()\n\n    // Store data in memory\n    this.data.set(b58key, data)\n\n    // Emit event\n    emit && this._emit(peerId, data)\n  }\n\n  /**\n   * Emit data.\n   *\n   * @protected\n   * @param {PeerId} peerId\n   * @param {any} [data]\n   */\n  _emit (peerId, data) {\n    this._ps.emit(this.eventName, {\n      peerId,\n      [this.eventProperty]: this.eventTransformer(data)\n    })\n  }\n\n  /**\n   * Get the known data of a provided peer.\n   * Returns `undefined` if there is no available data for the given peer.\n   *\n   * @param {PeerId} peerId\n   * @returns {any[]|any|undefined}\n   */\n  get (peerId) {\n    if (!PeerId.isPeerId(peerId)) {\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    const rec = this.data.get(peerId.toB58String())\n\n    // @ts-ignore\n    return rec ? [...rec] : undefined\n  }\n\n  /**\n   * Deletes the provided peer from the book.\n   *\n   * @param {PeerId} peerId\n   * @returns {boolean}\n   */\n  delete (peerId) {\n    if (!PeerId.isPeerId(peerId)) {\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    if (!this.data.delete(peerId.toB58String())) {\n      return false\n    }\n\n    this._emit(peerId, [])\n\n    return true\n  }\n}\n\nmodule.exports = Book\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:peer-store:key-book'), {\n  error: debug('libp2p:peer-store:key-book:err')\n})\nconst errcode = require('err-code')\n\nconst PeerId = require('peer-id')\n\nconst Book = require('./book')\n\nconst {\n  codes: { ERR_INVALID_PARAMETERS }\n} = require('../errors')\n\n/**\n * @typedef {import('./')} PeerStore\n * @typedef {import('libp2p-crypto').PublicKey} PublicKey\n */\n\n/**\n * @extends {Book}\n */\nclass KeyBook extends Book {\n  /**\n   * The KeyBook is responsible for keeping the known public keys of a peer.\n   *\n   * @class\n   * @param {PeerStore} peerStore\n   */\n  constructor (peerStore) {\n    super({\n      peerStore,\n      eventName: 'change:pubkey',\n      eventProperty: 'pubkey',\n      eventTransformer: (data) => data.pubKey\n    })\n\n    /**\n     * Map known peers to their known Public Key.\n     *\n     * @type {Map<string, PeerId>}\n     */\n    this.data = new Map()\n  }\n\n  /**\n   * Set the Peer public key.\n   *\n   * @override\n   * @param {PeerId} peerId\n   * @param {PublicKey} publicKey\n   * @returns {KeyBook}\n   */\n  set (peerId, publicKey) {\n    if (!PeerId.isPeerId(peerId)) {\n      log.error('peerId must be an instance of peer-id to store data')\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    const id = peerId.toB58String()\n    const recPeerId = this.data.get(id)\n\n    // If no record available, and this is valid\n    if (!recPeerId && publicKey) {\n      // This might be unecessary, but we want to store the PeerId\n      // to avoid an async operation when reconstructing the PeerId\n      peerId.pubKey = publicKey\n\n      this._setData(peerId, peerId)\n      log(`stored provided public key for ${id}`)\n    }\n\n    return this\n  }\n\n  /**\n   * Get Public key of the given PeerId, if stored.\n   *\n   * @override\n   * @param {PeerId} peerId\n   * @returns {PublicKey | undefined}\n   */\n  get (peerId) {\n    if (!PeerId.isPeerId(peerId)) {\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    const rec = this.data.get(peerId.toB58String())\n\n    return rec ? rec.pubKey : undefined\n  }\n}\n\nmodule.exports = KeyBook\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:peer-store:proto-book'), {\n  error: debug('libp2p:peer-store:proto-book:err')\n})\nconst errcode = require('err-code')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\nconst PeerId = require('peer-id')\n\nconst Book = require('./book')\n\nconst {\n  codes: { ERR_INVALID_PARAMETERS }\n} = require('../errors')\n\n/**\n * @typedef {import('./')} PeerStore\n */\n\n/**\n * @extends {Book}\n *\n * @fires MetadataBook#change:metadata\n */\nclass MetadataBook extends Book {\n  /**\n   * The MetadataBook is responsible for keeping the known supported\n   * protocols of a peer.\n   *\n   * @class\n   * @param {PeerStore} peerStore\n   */\n  constructor (peerStore) {\n    /**\n     * PeerStore Event emitter, used by the MetadataBook to emit:\n     * \"change:metadata\" - emitted when the known metadata of a peer change.\n     */\n    super({\n      peerStore,\n      eventName: 'change:metadata',\n      eventProperty: 'metadata'\n    })\n\n    /**\n     * Map known peers to their known protocols.\n     *\n     * @type {Map<string, Map<string, Uint8Array>>}\n     */\n    this.data = new Map()\n  }\n\n  /**\n   * Set metadata key and value of a provided peer.\n   *\n   * @override\n   * @param {PeerId} peerId\n   * @param {string} key - metadata key\n   * @param {Uint8Array} value - metadata value\n   * @returns {MetadataBook}\n   */\n  // @ts-ignore override with more then the parameters expected in Book\n  set (peerId, key, value) {\n    if (!PeerId.isPeerId(peerId)) {\n      log.error('peerId must be an instance of peer-id to store data')\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    if (typeof key !== 'string' || !(value instanceof Uint8Array)) {\n      log.error('valid key and value must be provided to store data')\n      throw errcode(new Error('valid key and value must be provided'), ERR_INVALID_PARAMETERS)\n    }\n\n    this._setValue(peerId, key, value)\n\n    return this\n  }\n\n  /**\n   * Set data into the datastructure\n   *\n   * @override\n   * @param {PeerId} peerId\n   * @param {string} key\n   * @param {Uint8Array} value\n   */\n  _setValue (peerId, key, value, { emit = true } = {}) {\n    const id = peerId.toB58String()\n    const rec = this.data.get(id) || new Map()\n    const recMap = rec.get(key)\n\n    // Already exists and is equal\n    if (recMap && uint8ArrayEquals(value, recMap)) {\n      log(`the metadata provided to store is equal to the already stored for ${id} on ${key}`)\n      return\n    }\n\n    rec.set(key, value)\n    this.data.set(id, rec)\n\n    emit && this._emit(peerId, key)\n  }\n\n  /**\n   * Get the known data of a provided peer.\n   *\n   * @param {PeerId} peerId\n   * @returns {Map<string, Uint8Array>|undefined}\n   */\n  get (peerId) {\n    if (!PeerId.isPeerId(peerId)) {\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    return this.data.get(peerId.toB58String())\n  }\n\n  /**\n   * Get specific metadata value, if it exists\n   *\n   * @param {PeerId} peerId\n   * @param {string} key\n   * @returns {Uint8Array | undefined}\n   */\n  getValue (peerId, key) {\n    if (!PeerId.isPeerId(peerId)) {\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    const rec = this.data.get(peerId.toB58String())\n    return rec && rec.get(key)\n  }\n\n  /**\n   * Deletes the provided peer from the book.\n   *\n   * @param {PeerId} peerId\n   * @returns {boolean}\n   */\n  delete (peerId) {\n    if (!PeerId.isPeerId(peerId)) {\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    if (!this.data.delete(peerId.toB58String())) {\n      return false\n    }\n\n    this._emit(peerId)\n\n    return true\n  }\n\n  /**\n   * Deletes the provided peer metadata key from the book.\n   *\n   * @param {PeerId} peerId\n   * @param {string} key\n   * @returns {boolean}\n   */\n  deleteValue (peerId, key) {\n    if (!PeerId.isPeerId(peerId)) {\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    const rec = this.data.get(peerId.toB58String())\n\n    if (!rec || !rec.delete(key)) {\n      return false\n    }\n\n    this._emit(peerId, key)\n\n    return true\n  }\n}\n\nmodule.exports = MetadataBook\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:peer-store:proto-book'), {\n  error: debug('libp2p:peer-store:proto-book:err')\n})\nconst errcode = require('err-code')\nconst PeerId = require('peer-id')\n\nconst Book = require('./book')\n\nconst {\n  codes: { ERR_INVALID_PARAMETERS }\n} = require('../errors')\n\n/**\n * @typedef {import('./')} PeerStore\n */\n\n/**\n * @extends {Book}\n *\n * @fires ProtoBook#change:protocols\n */\nclass ProtoBook extends Book {\n  /**\n   * The ProtoBook is responsible for keeping the known supported\n   * protocols of a peer.\n   *\n   * @class\n   * @param {PeerStore} peerStore\n   */\n  constructor (peerStore) {\n    /**\n     * PeerStore Event emitter, used by the ProtoBook to emit:\n     * \"change:protocols\" - emitted when the known protocols of a peer change.\n     */\n    super({\n      peerStore,\n      eventName: 'change:protocols',\n      eventProperty: 'protocols',\n      eventTransformer: (data) => Array.from(data)\n    })\n\n    /**\n     * Map known peers to their known protocols.\n     *\n     * @type {Map<string, Set<string>>}\n     */\n    this.data = new Map()\n  }\n\n  /**\n   * Set known protocols of a provided peer.\n   * If the peer was not known before, it will be added.\n   *\n   * @override\n   * @param {PeerId} peerId\n   * @param {string[]} protocols\n   * @returns {ProtoBook}\n   */\n  set (peerId, protocols) {\n    if (!PeerId.isPeerId(peerId)) {\n      log.error('peerId must be an instance of peer-id to store data')\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    if (!protocols) {\n      log.error('protocols must be provided to store data')\n      throw errcode(new Error('protocols must be provided'), ERR_INVALID_PARAMETERS)\n    }\n\n    const id = peerId.toB58String()\n    const recSet = this.data.get(id)\n    const newSet = new Set(protocols)\n\n    /**\n     * @param {Set<string>} a\n     * @param {Set<string>} b\n     */\n    const isSetEqual = (a, b) => a.size === b.size && [...a].every(value => b.has(value))\n\n    // Already knows the peer and the recorded protocols are the same?\n    // If yes, no changes needed!\n    if (recSet && isSetEqual(recSet, newSet)) {\n      log(`the protocols provided to store are equal to the already stored for ${id}`)\n      return this\n    }\n\n    this._setData(peerId, newSet)\n    log(`stored provided protocols for ${id}`)\n\n    return this\n  }\n\n  /**\n   * Adds known protocols of a provided peer.\n   * If the peer was not known before, it will be added.\n   *\n   * @param {PeerId} peerId\n   * @param {string[]} protocols\n   * @returns {ProtoBook}\n   */\n  add (peerId, protocols) {\n    if (!PeerId.isPeerId(peerId)) {\n      log.error('peerId must be an instance of peer-id to store data')\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    if (!protocols) {\n      log.error('protocols must be provided to store data')\n      throw errcode(new Error('protocols must be provided'), ERR_INVALID_PARAMETERS)\n    }\n\n    const id = peerId.toB58String()\n    const recSet = this.data.get(id) || new Set()\n    const newSet = new Set([...recSet, ...protocols]) // Set Union\n\n    // Any new protocol added?\n    if (recSet.size === newSet.size) {\n      log(`the protocols provided to store are already stored for ${id}`)\n      return this\n    }\n\n    this._setData(peerId, newSet)\n    log(`added provided protocols for ${id}`)\n\n    return this\n  }\n\n  /**\n   * Removes known protocols of a provided peer.\n   * If the protocols did not exist before, nothing will be done.\n   *\n   * @param {PeerId} peerId\n   * @param {string[]} protocols\n   * @returns {ProtoBook}\n   */\n  remove (peerId, protocols) {\n    if (!PeerId.isPeerId(peerId)) {\n      log.error('peerId must be an instance of peer-id to store data')\n      throw errcode(new Error('peerId must be an instance of peer-id'), ERR_INVALID_PARAMETERS)\n    }\n\n    if (!protocols) {\n      log.error('protocols must be provided to store data')\n      throw errcode(new Error('protocols must be provided'), ERR_INVALID_PARAMETERS)\n    }\n\n    const id = peerId.toB58String()\n    const recSet = this.data.get(id)\n\n    if (recSet) {\n      const newSet = new Set([\n        ...recSet\n      ].filter((p) => !protocols.includes(p)))\n\n      // Any protocol removed?\n      if (recSet.size === newSet.size) {\n        return this\n      }\n\n      this._setData(peerId, newSet)\n      log(`removed provided protocols for ${id}`)\n    }\n\n    return this\n  }\n}\n\nmodule.exports = ProtoBook\n","'use strict'\n\n// Pubsub adapter to keep API with handlers while not removed.\n/**\n * @typedef {import('libp2p-interfaces/src/pubsub').InMessage} InMessage\n * @typedef {import('libp2p-interfaces/src/pubsub')} PubsubRouter\n */\n\n/**\n * @param {{new(...args: any[]): PubsubRouter}} PubsubRouter\n * @param {import('.')} libp2p\n * @param {{ enabled: boolean; } & import(\".\").PubsubLocalOptions & import(\"libp2p-interfaces/src/pubsub\").PubsubOptions} options\n */\nfunction pubsubAdapter (PubsubRouter, libp2p, options) {\n  /** @type {PubsubRouter & { _subscribeAdapter: PubsubRouter['subscribe'], _unsubscribeAdapter: PubsubRouter['unsubscribe'] }} */\n  // @ts-ignore we set the extra _subscribeAdapter and _unsubscribeAdapter properties afterwards\n  const pubsub = new PubsubRouter(libp2p, options)\n  pubsub._subscribeAdapter = pubsub.subscribe\n  pubsub._unsubscribeAdapter = pubsub.unsubscribe\n\n  /**\n   * Subscribes to a given topic.\n   *\n   * @override\n   * @param {string} topic\n   * @param {(msg: InMessage) => void} [handler]\n   * @returns {void}\n   */\n  function subscribe (topic, handler) {\n    // Bind provided handler\n    handler && pubsub.on(topic, handler)\n    pubsub._subscribeAdapter(topic)\n  }\n\n  /**\n   * Unsubscribe from the given topic.\n   *\n   * @override\n   * @param {string} topic\n   * @param {(msg: InMessage) => void} [handler]\n   * @returns {void}\n   */\n  function unsubscribe (topic, handler) {\n    if (!handler) {\n      pubsub.removeAllListeners(topic)\n    } else {\n      pubsub.removeListener(topic, handler)\n    }\n\n    if (pubsub.listenerCount(topic) === 0) {\n      pubsub._unsubscribeAdapter(topic)\n    }\n  }\n\n  pubsub.subscribe = subscribe\n  pubsub.unsubscribe = unsubscribe\n\n  return pubsub\n}\n\nmodule.exports = pubsubAdapter\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:persistent-peer-store'), {\n  error: debug('libp2p:persistent-peer-store:err')\n})\nconst { Key } = require('interface-datastore')\nconst { Multiaddr } = require('multiaddr')\nconst PeerId = require('peer-id')\n\nconst PeerStore = require('..')\n\nconst {\n  NAMESPACE_ADDRESS,\n  NAMESPACE_COMMON,\n  NAMESPACE_KEYS,\n  NAMESPACE_METADATA,\n  NAMESPACE_PROTOCOL\n} = require('./consts')\n\nconst { Addresses } = require('./pb/address-book')\nconst { Protocols } = require('./pb/proto-book')\n\n/**\n * @typedef {import('interface-datastore').Batch} Batch\n * @typedef {import('../address-book.js').Address} Address\n */\n\n/**\n * @typedef {Object} PersistentPeerStoreProperties\n * @property {PeerId} peerId\n * @property {import('interface-datastore').Datastore} datastore\n *\n * @typedef {Object} PersistentPeerStoreOptions\n * @property {number} [threshold = 5] - Number of dirty peers allowed before commit data.\n */\n\n/**\n * Responsible for managing the persistence of data in the PeerStore.\n */\nclass PersistentPeerStore extends PeerStore {\n  /**\n   * @class\n   * @param {PersistentPeerStoreProperties & PersistentPeerStoreOptions} properties\n   */\n  constructor ({ peerId, datastore, threshold = 5 }) {\n    super({ peerId })\n\n    /**\n     * Backend datastore used to persist data.\n     */\n    this._datastore = datastore\n\n    /**\n     * Peers modified after the latest data persisted.\n     */\n    this._dirtyPeers = new Set()\n\n    /**\n     * Peers metadata changed mapping peer identifers to metadata changed.\n     *\n     * @type {Map<string, Set<string>>}\n     */\n    this._dirtyMetadata = new Map()\n\n    this.threshold = threshold\n    this._addDirtyPeer = this._addDirtyPeer.bind(this)\n  }\n\n  /**\n   * Start Persistent PeerStore.\n   *\n   * @returns {Promise<void>}\n   */\n  async start () {\n    log('PeerStore is starting')\n\n    // Handlers for dirty peers\n    this.on('change:protocols', this._addDirtyPeer)\n    this.on('change:multiaddrs', this._addDirtyPeer)\n    this.on('change:pubkey', this._addDirtyPeerKey)\n    this.on('change:metadata', this._addDirtyPeerMetadata)\n\n    // Load data\n    for await (const entry of this._datastore.query({ prefix: NAMESPACE_COMMON })) {\n      await this._processDatastoreEntry(entry)\n    }\n\n    log('PeerStore started')\n  }\n\n  /**\n   * Stop Persistent PeerStore.\n   *\n   * @returns {Promise<void>}\n   */\n  async stop () {\n    log('PeerStore is stopping')\n    this.removeAllListeners()\n    await this._commitData()\n    log('PeerStore stopped')\n  }\n\n  /**\n   * Add modified peer to the dirty set\n   *\n   * @private\n   * @param {Object} params\n   * @param {PeerId} params.peerId\n   */\n  _addDirtyPeer ({ peerId }) {\n    const peerIdstr = peerId.toB58String()\n\n    log('add dirty peer', peerIdstr)\n    this._dirtyPeers.add(peerIdstr)\n\n    if (this._dirtyPeers.size >= this.threshold) {\n      // Commit current data\n      this._commitData().catch(err => {\n        log.error('error committing data', err)\n      })\n    }\n  }\n\n  /**\n   * Add modified peer key to the dirty set\n   *\n   * @private\n   * @param {Object} params\n   * @param {PeerId} params.peerId\n   */\n  _addDirtyPeerKey ({ peerId }) {\n    // Not add if inline key available\n    if (peerId.hasInlinePublicKey()) {\n      return\n    }\n\n    const peerIdstr = peerId.toB58String()\n\n    log('add dirty peer key', peerIdstr)\n    this._dirtyPeers.add(peerIdstr)\n\n    if (this._dirtyPeers.size >= this.threshold) {\n      // Commit current data\n      this._commitData().catch(err => {\n        log.error('error committing data', err)\n      })\n    }\n  }\n\n  /**\n   * Add modified metadata peer to the set.\n   *\n   * @private\n   * @param {Object} params\n   * @param {PeerId} params.peerId\n   * @param {string} params.metadata\n   */\n  _addDirtyPeerMetadata ({ peerId, metadata }) {\n    const peerIdstr = peerId.toB58String()\n\n    log('add dirty metadata peer', peerIdstr)\n    this._dirtyPeers.add(peerIdstr)\n\n    // Add dirty metadata key\n    const mData = this._dirtyMetadata.get(peerIdstr) || new Set()\n    mData.add(metadata)\n    this._dirtyMetadata.set(peerIdstr, mData)\n\n    if (this._dirtyPeers.size >= this.threshold) {\n      // Commit current data\n      this._commitData().catch(err => {\n        log.error('error committing data', err)\n      })\n    }\n  }\n\n  /**\n   * Add all the peers current data to a datastore batch and commit it.\n   *\n   * @private\n   * @returns {Promise<void>}\n   */\n  async _commitData () {\n    const commitPeers = Array.from(this._dirtyPeers)\n\n    if (!commitPeers.length) {\n      return\n    }\n\n    // Clear Dirty Peers set\n    this._dirtyPeers.clear()\n\n    log('create batch commit')\n    const batch = this._datastore.batch()\n    for (const peerIdStr of commitPeers) {\n      // PeerId\n      const peerId = this.keyBook.data.get(peerIdStr) || PeerId.createFromCID(peerIdStr)\n\n      // Address Book\n      this._batchAddressBook(peerId, batch)\n\n      // Key Book\n      !peerId.hasInlinePublicKey() && this._batchKeyBook(peerId, batch)\n\n      // Metadata Book\n      this._batchMetadataBook(peerId, batch)\n\n      // Proto Book\n      this._batchProtoBook(peerId, batch)\n    }\n\n    await batch.commit()\n    log('batch committed')\n  }\n\n  /**\n   * Add address book data of the peer to the batch.\n   *\n   * @private\n   * @param {PeerId} peerId\n   * @param {Batch} batch\n   */\n  _batchAddressBook (peerId, batch) {\n    const b32key = peerId.toString()\n    const key = new Key(`${NAMESPACE_ADDRESS}${b32key}`)\n\n    const entry = this.addressBook.data.get(peerId.toB58String())\n\n    try {\n      // Deleted from the book\n      if (!entry) {\n        batch.delete(key)\n        return\n      }\n\n      const encodedData = Addresses.encode({\n        addrs: entry.addresses.map((address) => ({\n          multiaddr: address.multiaddr.bytes,\n          isCertified: address.isCertified\n        })),\n        certifiedRecord: entry.record\n          ? {\n              seq: entry.record.seqNumber,\n              raw: entry.record.raw\n            }\n          : undefined\n      }).finish()\n\n      batch.put(key, encodedData)\n    } catch (err) {\n      log.error(err)\n    }\n  }\n\n  /**\n   * Add Key book data of the peer to the batch.\n   *\n   * @private\n   * @param {PeerId} peerId\n   * @param {Batch} batch\n   */\n  _batchKeyBook (peerId, batch) {\n    const b32key = peerId.toString()\n    const key = new Key(`${NAMESPACE_KEYS}${b32key}`)\n\n    try {\n      // Deleted from the book\n      if (!peerId.pubKey) {\n        batch.delete(key)\n        return\n      }\n\n      const encodedData = peerId.marshalPubKey()\n\n      batch.put(key, encodedData)\n    } catch (err) {\n      log.error(err)\n    }\n  }\n\n  /**\n   * Add metadata book data of the peer to the batch.\n   *\n   * @private\n   * @param {PeerId} peerId\n   * @param {Batch} batch\n   */\n  _batchMetadataBook (peerId, batch) {\n    const b32key = peerId.toString()\n    const dirtyMetada = this._dirtyMetadata.get(peerId.toB58String()) || []\n\n    try {\n      dirtyMetada.forEach((/** @type {string} */ dirtyKey) => {\n        const key = new Key(`${NAMESPACE_METADATA}${b32key}/${dirtyKey}`)\n        const dirtyValue = this.metadataBook.getValue(peerId, dirtyKey)\n\n        if (dirtyValue) {\n          batch.put(key, dirtyValue)\n        } else {\n          batch.delete(key)\n        }\n      })\n    } catch (err) {\n      log.error(err)\n    }\n  }\n\n  /**\n   * Add proto book data of the peer to the batch.\n   *\n   * @private\n   * @param {PeerId} peerId\n   * @param {Batch} batch\n   */\n  _batchProtoBook (peerId, batch) {\n    const b32key = peerId.toString()\n    const key = new Key(`${NAMESPACE_PROTOCOL}${b32key}`)\n\n    const protocols = this.protoBook.get(peerId)\n\n    try {\n      // Deleted from the book\n      if (!protocols) {\n        batch.delete(key)\n        return\n      }\n\n      const encodedData = Protocols.encode({ protocols }).finish()\n\n      batch.put(key, encodedData)\n    } catch (err) {\n      log.error(err)\n    }\n  }\n\n  /**\n   * Process datastore entry and add its data to the correct book.\n   *\n   * @private\n   * @param {Object} params\n   * @param {Key} params.key - datastore key\n   * @param {Uint8Array} params.value - datastore value stored\n   * @returns {Promise<void>}\n   */\n  async _processDatastoreEntry ({ key, value }) {\n    try {\n      const keyParts = key.toString().split('/')\n      const peerId = PeerId.createFromCID(keyParts[3])\n\n      let decoded\n      switch (keyParts[2]) {\n        case 'addrs':\n          decoded = Addresses.decode(value)\n\n          // @ts-ignore protected function\n          this.addressBook._setData(\n            peerId,\n            {\n              addresses: decoded.addrs.map((address) => ({\n                multiaddr: new Multiaddr(address.multiaddr),\n                isCertified: Boolean(address.isCertified)\n              })),\n              record: decoded.certifiedRecord\n                ? {\n                    raw: decoded.certifiedRecord.raw,\n                    seqNumber: decoded.certifiedRecord.seq\n                  }\n                : undefined\n            },\n            { emit: false })\n          break\n        case 'keys':\n          decoded = await PeerId.createFromPubKey(value)\n\n          // @ts-ignore protected function\n          this.keyBook._setData(\n            decoded,\n            decoded,\n            { emit: false })\n          break\n        case 'metadata':\n          this.metadataBook._setValue(\n            peerId,\n            keyParts[4],\n            value,\n            { emit: false })\n          break\n        case 'protos':\n          decoded = Protocols.decode(value)\n\n          // @ts-ignore protected function\n          this.protoBook._setData(\n            peerId,\n            new Set(decoded.protocols),\n            { emit: false })\n          break\n        default:\n          log('invalid data persisted for: ', key.toString())\n      }\n    } catch (err) {\n      log.error(err)\n    }\n  }\n}\n\nmodule.exports = PersistentPeerStore\n","'use strict'\n\nmodule.exports.NAMESPACE_COMMON = '/peers/'\n\n// /peers/protos/<b32 peer id no padding>\nmodule.exports.NAMESPACE_ADDRESS = '/peers/addrs/'\n\n// /peers/keys/<b32 peer id no padding>\nmodule.exports.NAMESPACE_KEYS = '/peers/keys/'\n\n// /peers/metadata/<b32 peer id no padding>/<key>\nmodule.exports.NAMESPACE_METADATA = '/peers/metadata/'\n\n// /peers/addrs/<b32 peer id no padding>\nmodule.exports.NAMESPACE_PROTOCOL = '/peers/protos/'\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"libp2p-address-book\"] || ($protobuf.roots[\"libp2p-address-book\"] = {});\n\n$root.Addresses = (function() {\n\n    /**\n     * Properties of an Addresses.\n     * @exports IAddresses\n     * @interface IAddresses\n     * @property {Array.<Addresses.IAddress>|null} [addrs] Addresses addrs\n     * @property {Addresses.ICertifiedRecord|null} [certifiedRecord] Addresses certifiedRecord\n     */\n\n    /**\n     * Constructs a new Addresses.\n     * @exports Addresses\n     * @classdesc Represents an Addresses.\n     * @implements IAddresses\n     * @constructor\n     * @param {IAddresses=} [p] Properties to set\n     */\n    function Addresses(p) {\n        this.addrs = [];\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * Addresses addrs.\n     * @member {Array.<Addresses.IAddress>} addrs\n     * @memberof Addresses\n     * @instance\n     */\n    Addresses.prototype.addrs = $util.emptyArray;\n\n    /**\n     * Addresses certifiedRecord.\n     * @member {Addresses.ICertifiedRecord|null|undefined} certifiedRecord\n     * @memberof Addresses\n     * @instance\n     */\n    Addresses.prototype.certifiedRecord = null;\n\n    /**\n     * Encodes the specified Addresses message. Does not implicitly {@link Addresses.verify|verify} messages.\n     * @function encode\n     * @memberof Addresses\n     * @static\n     * @param {IAddresses} m Addresses message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    Addresses.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.addrs != null && m.addrs.length) {\n            for (var i = 0; i < m.addrs.length; ++i)\n                $root.Addresses.Address.encode(m.addrs[i], w.uint32(10).fork()).ldelim();\n        }\n        if (m.certifiedRecord != null && Object.hasOwnProperty.call(m, \"certifiedRecord\"))\n            $root.Addresses.CertifiedRecord.encode(m.certifiedRecord, w.uint32(18).fork()).ldelim();\n        return w;\n    };\n\n    /**\n     * Decodes an Addresses message from the specified reader or buffer.\n     * @function decode\n     * @memberof Addresses\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {Addresses} Addresses\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    Addresses.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.Addresses();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                if (!(m.addrs && m.addrs.length))\n                    m.addrs = [];\n                m.addrs.push($root.Addresses.Address.decode(r, r.uint32()));\n                break;\n            case 2:\n                m.certifiedRecord = $root.Addresses.CertifiedRecord.decode(r, r.uint32());\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates an Addresses message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof Addresses\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {Addresses} Addresses\n     */\n    Addresses.fromObject = function fromObject(d) {\n        if (d instanceof $root.Addresses)\n            return d;\n        var m = new $root.Addresses();\n        if (d.addrs) {\n            if (!Array.isArray(d.addrs))\n                throw TypeError(\".Addresses.addrs: array expected\");\n            m.addrs = [];\n            for (var i = 0; i < d.addrs.length; ++i) {\n                if (typeof d.addrs[i] !== \"object\")\n                    throw TypeError(\".Addresses.addrs: object expected\");\n                m.addrs[i] = $root.Addresses.Address.fromObject(d.addrs[i]);\n            }\n        }\n        if (d.certifiedRecord != null) {\n            if (typeof d.certifiedRecord !== \"object\")\n                throw TypeError(\".Addresses.certifiedRecord: object expected\");\n            m.certifiedRecord = $root.Addresses.CertifiedRecord.fromObject(d.certifiedRecord);\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from an Addresses message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof Addresses\n     * @static\n     * @param {Addresses} m Addresses\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    Addresses.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.arrays || o.defaults) {\n            d.addrs = [];\n        }\n        if (o.defaults) {\n            d.certifiedRecord = null;\n        }\n        if (m.addrs && m.addrs.length) {\n            d.addrs = [];\n            for (var j = 0; j < m.addrs.length; ++j) {\n                d.addrs[j] = $root.Addresses.Address.toObject(m.addrs[j], o);\n            }\n        }\n        if (m.certifiedRecord != null && m.hasOwnProperty(\"certifiedRecord\")) {\n            d.certifiedRecord = $root.Addresses.CertifiedRecord.toObject(m.certifiedRecord, o);\n        }\n        return d;\n    };\n\n    /**\n     * Converts this Addresses to JSON.\n     * @function toJSON\n     * @memberof Addresses\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    Addresses.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    Addresses.Address = (function() {\n\n        /**\n         * Properties of an Address.\n         * @memberof Addresses\n         * @interface IAddress\n         * @property {Uint8Array|null} [multiaddr] Address multiaddr\n         * @property {boolean|null} [isCertified] Address isCertified\n         */\n\n        /**\n         * Constructs a new Address.\n         * @memberof Addresses\n         * @classdesc Represents an Address.\n         * @implements IAddress\n         * @constructor\n         * @param {Addresses.IAddress=} [p] Properties to set\n         */\n        function Address(p) {\n            if (p)\n                for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                    if (p[ks[i]] != null)\n                        this[ks[i]] = p[ks[i]];\n        }\n\n        /**\n         * Address multiaddr.\n         * @member {Uint8Array} multiaddr\n         * @memberof Addresses.Address\n         * @instance\n         */\n        Address.prototype.multiaddr = $util.newBuffer([]);\n\n        /**\n         * Address isCertified.\n         * @member {boolean} isCertified\n         * @memberof Addresses.Address\n         * @instance\n         */\n        Address.prototype.isCertified = false;\n\n        /**\n         * Encodes the specified Address message. Does not implicitly {@link Addresses.Address.verify|verify} messages.\n         * @function encode\n         * @memberof Addresses.Address\n         * @static\n         * @param {Addresses.IAddress} m Address message or plain object to encode\n         * @param {$protobuf.Writer} [w] Writer to encode to\n         * @returns {$protobuf.Writer} Writer\n         */\n        Address.encode = function encode(m, w) {\n            if (!w)\n                w = $Writer.create();\n            if (m.multiaddr != null && Object.hasOwnProperty.call(m, \"multiaddr\"))\n                w.uint32(10).bytes(m.multiaddr);\n            if (m.isCertified != null && Object.hasOwnProperty.call(m, \"isCertified\"))\n                w.uint32(16).bool(m.isCertified);\n            return w;\n        };\n\n        /**\n         * Decodes an Address message from the specified reader or buffer.\n         * @function decode\n         * @memberof Addresses.Address\n         * @static\n         * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n         * @param {number} [l] Message length if known beforehand\n         * @returns {Addresses.Address} Address\n         * @throws {Error} If the payload is not a reader or valid buffer\n         * @throws {$protobuf.util.ProtocolError} If required fields are missing\n         */\n        Address.decode = function decode(r, l) {\n            if (!(r instanceof $Reader))\n                r = $Reader.create(r);\n            var c = l === undefined ? r.len : r.pos + l, m = new $root.Addresses.Address();\n            while (r.pos < c) {\n                var t = r.uint32();\n                switch (t >>> 3) {\n                case 1:\n                    m.multiaddr = r.bytes();\n                    break;\n                case 2:\n                    m.isCertified = r.bool();\n                    break;\n                default:\n                    r.skipType(t & 7);\n                    break;\n                }\n            }\n            return m;\n        };\n\n        /**\n         * Creates an Address message from a plain object. Also converts values to their respective internal types.\n         * @function fromObject\n         * @memberof Addresses.Address\n         * @static\n         * @param {Object.<string,*>} d Plain object\n         * @returns {Addresses.Address} Address\n         */\n        Address.fromObject = function fromObject(d) {\n            if (d instanceof $root.Addresses.Address)\n                return d;\n            var m = new $root.Addresses.Address();\n            if (d.multiaddr != null) {\n                if (typeof d.multiaddr === \"string\")\n                    $util.base64.decode(d.multiaddr, m.multiaddr = $util.newBuffer($util.base64.length(d.multiaddr)), 0);\n                else if (d.multiaddr.length)\n                    m.multiaddr = d.multiaddr;\n            }\n            if (d.isCertified != null) {\n                m.isCertified = Boolean(d.isCertified);\n            }\n            return m;\n        };\n\n        /**\n         * Creates a plain object from an Address message. Also converts values to other types if specified.\n         * @function toObject\n         * @memberof Addresses.Address\n         * @static\n         * @param {Addresses.Address} m Address\n         * @param {$protobuf.IConversionOptions} [o] Conversion options\n         * @returns {Object.<string,*>} Plain object\n         */\n        Address.toObject = function toObject(m, o) {\n            if (!o)\n                o = {};\n            var d = {};\n            if (o.defaults) {\n                if (o.bytes === String)\n                    d.multiaddr = \"\";\n                else {\n                    d.multiaddr = [];\n                    if (o.bytes !== Array)\n                        d.multiaddr = $util.newBuffer(d.multiaddr);\n                }\n                d.isCertified = false;\n            }\n            if (m.multiaddr != null && m.hasOwnProperty(\"multiaddr\")) {\n                d.multiaddr = o.bytes === String ? $util.base64.encode(m.multiaddr, 0, m.multiaddr.length) : o.bytes === Array ? Array.prototype.slice.call(m.multiaddr) : m.multiaddr;\n            }\n            if (m.isCertified != null && m.hasOwnProperty(\"isCertified\")) {\n                d.isCertified = m.isCertified;\n            }\n            return d;\n        };\n\n        /**\n         * Converts this Address to JSON.\n         * @function toJSON\n         * @memberof Addresses.Address\n         * @instance\n         * @returns {Object.<string,*>} JSON object\n         */\n        Address.prototype.toJSON = function toJSON() {\n            return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n        };\n\n        return Address;\n    })();\n\n    Addresses.CertifiedRecord = (function() {\n\n        /**\n         * Properties of a CertifiedRecord.\n         * @memberof Addresses\n         * @interface ICertifiedRecord\n         * @property {number|null} [seq] CertifiedRecord seq\n         * @property {Uint8Array|null} [raw] CertifiedRecord raw\n         */\n\n        /**\n         * Constructs a new CertifiedRecord.\n         * @memberof Addresses\n         * @classdesc Represents a CertifiedRecord.\n         * @implements ICertifiedRecord\n         * @constructor\n         * @param {Addresses.ICertifiedRecord=} [p] Properties to set\n         */\n        function CertifiedRecord(p) {\n            if (p)\n                for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                    if (p[ks[i]] != null)\n                        this[ks[i]] = p[ks[i]];\n        }\n\n        /**\n         * CertifiedRecord seq.\n         * @member {number} seq\n         * @memberof Addresses.CertifiedRecord\n         * @instance\n         */\n        CertifiedRecord.prototype.seq = $util.Long ? $util.Long.fromBits(0,0,true) : 0;\n\n        /**\n         * CertifiedRecord raw.\n         * @member {Uint8Array} raw\n         * @memberof Addresses.CertifiedRecord\n         * @instance\n         */\n        CertifiedRecord.prototype.raw = $util.newBuffer([]);\n\n        /**\n         * Encodes the specified CertifiedRecord message. Does not implicitly {@link Addresses.CertifiedRecord.verify|verify} messages.\n         * @function encode\n         * @memberof Addresses.CertifiedRecord\n         * @static\n         * @param {Addresses.ICertifiedRecord} m CertifiedRecord message or plain object to encode\n         * @param {$protobuf.Writer} [w] Writer to encode to\n         * @returns {$protobuf.Writer} Writer\n         */\n        CertifiedRecord.encode = function encode(m, w) {\n            if (!w)\n                w = $Writer.create();\n            if (m.seq != null && Object.hasOwnProperty.call(m, \"seq\"))\n                w.uint32(8).uint64(m.seq);\n            if (m.raw != null && Object.hasOwnProperty.call(m, \"raw\"))\n                w.uint32(18).bytes(m.raw);\n            return w;\n        };\n\n        /**\n         * Decodes a CertifiedRecord message from the specified reader or buffer.\n         * @function decode\n         * @memberof Addresses.CertifiedRecord\n         * @static\n         * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n         * @param {number} [l] Message length if known beforehand\n         * @returns {Addresses.CertifiedRecord} CertifiedRecord\n         * @throws {Error} If the payload is not a reader or valid buffer\n         * @throws {$protobuf.util.ProtocolError} If required fields are missing\n         */\n        CertifiedRecord.decode = function decode(r, l) {\n            if (!(r instanceof $Reader))\n                r = $Reader.create(r);\n            var c = l === undefined ? r.len : r.pos + l, m = new $root.Addresses.CertifiedRecord();\n            while (r.pos < c) {\n                var t = r.uint32();\n                switch (t >>> 3) {\n                case 1:\n                    m.seq = r.uint64();\n                    break;\n                case 2:\n                    m.raw = r.bytes();\n                    break;\n                default:\n                    r.skipType(t & 7);\n                    break;\n                }\n            }\n            return m;\n        };\n\n        /**\n         * Creates a CertifiedRecord message from a plain object. Also converts values to their respective internal types.\n         * @function fromObject\n         * @memberof Addresses.CertifiedRecord\n         * @static\n         * @param {Object.<string,*>} d Plain object\n         * @returns {Addresses.CertifiedRecord} CertifiedRecord\n         */\n        CertifiedRecord.fromObject = function fromObject(d) {\n            if (d instanceof $root.Addresses.CertifiedRecord)\n                return d;\n            var m = new $root.Addresses.CertifiedRecord();\n            if (d.seq != null) {\n                if ($util.Long)\n                    (m.seq = $util.Long.fromValue(d.seq)).unsigned = true;\n                else if (typeof d.seq === \"string\")\n                    m.seq = parseInt(d.seq, 10);\n                else if (typeof d.seq === \"number\")\n                    m.seq = d.seq;\n                else if (typeof d.seq === \"object\")\n                    m.seq = new $util.LongBits(d.seq.low >>> 0, d.seq.high >>> 0).toNumber(true);\n            }\n            if (d.raw != null) {\n                if (typeof d.raw === \"string\")\n                    $util.base64.decode(d.raw, m.raw = $util.newBuffer($util.base64.length(d.raw)), 0);\n                else if (d.raw.length)\n                    m.raw = d.raw;\n            }\n            return m;\n        };\n\n        /**\n         * Creates a plain object from a CertifiedRecord message. Also converts values to other types if specified.\n         * @function toObject\n         * @memberof Addresses.CertifiedRecord\n         * @static\n         * @param {Addresses.CertifiedRecord} m CertifiedRecord\n         * @param {$protobuf.IConversionOptions} [o] Conversion options\n         * @returns {Object.<string,*>} Plain object\n         */\n        CertifiedRecord.toObject = function toObject(m, o) {\n            if (!o)\n                o = {};\n            var d = {};\n            if (o.defaults) {\n                if ($util.Long) {\n                    var n = new $util.Long(0, 0, true);\n                    d.seq = o.longs === String ? n.toString() : o.longs === Number ? n.toNumber() : n;\n                } else\n                    d.seq = o.longs === String ? \"0\" : 0;\n                if (o.bytes === String)\n                    d.raw = \"\";\n                else {\n                    d.raw = [];\n                    if (o.bytes !== Array)\n                        d.raw = $util.newBuffer(d.raw);\n                }\n            }\n            if (m.seq != null && m.hasOwnProperty(\"seq\")) {\n                if (typeof m.seq === \"number\")\n                    d.seq = o.longs === String ? String(m.seq) : m.seq;\n                else\n                    d.seq = o.longs === String ? $util.Long.prototype.toString.call(m.seq) : o.longs === Number ? new $util.LongBits(m.seq.low >>> 0, m.seq.high >>> 0).toNumber(true) : m.seq;\n            }\n            if (m.raw != null && m.hasOwnProperty(\"raw\")) {\n                d.raw = o.bytes === String ? $util.base64.encode(m.raw, 0, m.raw.length) : o.bytes === Array ? Array.prototype.slice.call(m.raw) : m.raw;\n            }\n            return d;\n        };\n\n        /**\n         * Converts this CertifiedRecord to JSON.\n         * @function toJSON\n         * @memberof Addresses.CertifiedRecord\n         * @instance\n         * @returns {Object.<string,*>} JSON object\n         */\n        CertifiedRecord.prototype.toJSON = function toJSON() {\n            return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n        };\n\n        return CertifiedRecord;\n    })();\n\n    return Addresses;\n})();\n\nmodule.exports = $root;\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"libp2p-proto-book\"] || ($protobuf.roots[\"libp2p-proto-book\"] = {});\n\n$root.Protocols = (function() {\n\n    /**\n     * Properties of a Protocols.\n     * @exports IProtocols\n     * @interface IProtocols\n     * @property {Array.<string>|null} [protocols] Protocols protocols\n     */\n\n    /**\n     * Constructs a new Protocols.\n     * @exports Protocols\n     * @classdesc Represents a Protocols.\n     * @implements IProtocols\n     * @constructor\n     * @param {IProtocols=} [p] Properties to set\n     */\n    function Protocols(p) {\n        this.protocols = [];\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * Protocols protocols.\n     * @member {Array.<string>} protocols\n     * @memberof Protocols\n     * @instance\n     */\n    Protocols.prototype.protocols = $util.emptyArray;\n\n    /**\n     * Encodes the specified Protocols message. Does not implicitly {@link Protocols.verify|verify} messages.\n     * @function encode\n     * @memberof Protocols\n     * @static\n     * @param {IProtocols} m Protocols message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    Protocols.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.protocols != null && m.protocols.length) {\n            for (var i = 0; i < m.protocols.length; ++i)\n                w.uint32(10).string(m.protocols[i]);\n        }\n        return w;\n    };\n\n    /**\n     * Decodes a Protocols message from the specified reader or buffer.\n     * @function decode\n     * @memberof Protocols\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {Protocols} Protocols\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    Protocols.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.Protocols();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                if (!(m.protocols && m.protocols.length))\n                    m.protocols = [];\n                m.protocols.push(r.string());\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a Protocols message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof Protocols\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {Protocols} Protocols\n     */\n    Protocols.fromObject = function fromObject(d) {\n        if (d instanceof $root.Protocols)\n            return d;\n        var m = new $root.Protocols();\n        if (d.protocols) {\n            if (!Array.isArray(d.protocols))\n                throw TypeError(\".Protocols.protocols: array expected\");\n            m.protocols = [];\n            for (var i = 0; i < d.protocols.length; ++i) {\n                m.protocols[i] = String(d.protocols[i]);\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a Protocols message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof Protocols\n     * @static\n     * @param {Protocols} m Protocols\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    Protocols.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.arrays || o.defaults) {\n            d.protocols = [];\n        }\n        if (m.protocols && m.protocols.length) {\n            d.protocols = [];\n            for (var j = 0; j < m.protocols.length; ++j) {\n                d.protocols[j] = m.protocols[j];\n            }\n        }\n        return d;\n    };\n\n    /**\n     * Converts this Protocols to JSON.\n     * @function toJSON\n     * @memberof Protocols\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    Protocols.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return Protocols;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:registrar'), {\n  error: debug('libp2p:registrar:err')\n})\nconst errcode = require('err-code')\n\nconst {\n  codes: { ERR_INVALID_PARAMETERS }\n} = require('./errors')\nconst Topology = require('libp2p-interfaces/src/topology')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('./peer-store')} PeerStore\n * @typedef {import('./connection-manager')} ConnectionManager\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('./').HandlerProps} HandlerProps\n */\n\n/**\n *\n */\n\n/**\n * Responsible for notifying registered protocols of events in the network.\n */\nclass Registrar {\n  /**\n   * @param {Object} props\n   * @param {PeerStore} props.peerStore\n   * @param {ConnectionManager} props.connectionManager\n   * @class\n   */\n  constructor ({ peerStore, connectionManager }) {\n    // Used on topology to listen for protocol changes\n    this.peerStore = peerStore\n\n    this.connectionManager = connectionManager\n\n    /**\n     * Map of topologies\n     *\n     * @type {Map<string, Topology>}\n     */\n    this.topologies = new Map()\n\n    /** @type {(protocols: string[]|string, handler: (props: HandlerProps) => void) => void} */\n    // @ts-ignore handle is not optional\n    this._handle = undefined\n\n    this._onDisconnect = this._onDisconnect.bind(this)\n    this.connectionManager.on('peer:disconnect', this._onDisconnect)\n  }\n\n  /**\n   * @returns {(protocols: string[]|string, handler: (props: HandlerProps) => void) => void}\n   */\n  get handle () {\n    return this._handle\n  }\n\n  /**\n   * @param {(protocols: string[]|string, handler: (props: HandlerProps) => void) => void} handle\n   */\n  set handle (handle) {\n    this._handle = handle\n  }\n\n  /**\n   * Get a connection with a peer.\n   *\n   * @param {PeerId} peerId\n   * @returns {Connection | null}\n   */\n  getConnection (peerId) {\n    return this.connectionManager.get(peerId)\n  }\n\n  /**\n   * Register handlers for a set of multicodecs given\n   *\n   * @param {Topology} topology - protocol topology\n   * @returns {string} registrar identifier\n   */\n  register (topology) {\n    if (!Topology.isTopology(topology)) {\n      log.error('topology must be an instance of interfaces/topology')\n      throw errcode(new Error('topology must be an instance of interfaces/topology'), ERR_INVALID_PARAMETERS)\n    }\n\n    // Create topology\n    const id = (Math.random() * 1e9).toString(36) + Date.now()\n\n    this.topologies.set(id, topology)\n\n    // Set registrar\n    topology.registrar = this\n\n    return id\n  }\n\n  /**\n   * Unregister topology.\n   *\n   * @param {string} id - registrar identifier\n   * @returns {boolean} unregistered successfully\n   */\n  unregister (id) {\n    return this.topologies.delete(id)\n  }\n\n  /**\n   * Remove a disconnected peer from the record\n   *\n   * @param {Connection} connection\n   * @returns {void}\n   */\n  _onDisconnect (connection) {\n    for (const [, topology] of this.topologies) {\n      topology.disconnect(connection.remotePeer)\n    }\n  }\n}\n\nmodule.exports = Registrar\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:ping'), {\n  error: debug('libp2p:ping:err')\n})\nconst errCode = require('err-code')\n\nconst crypto = require('libp2p-crypto')\nconst { pipe } = require('it-pipe')\n// @ts-ignore it-buffer has no types exported\nconst { toBuffer } = require('it-buffer')\nconst { collect, take } = require('streaming-iterables')\nconst equals = require('uint8arrays/equals')\n\nconst { PROTOCOL, PING_LENGTH } = require('./constants')\n\n/**\n * @typedef {import('../')} Libp2p\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n */\n\n/**\n * Ping a given peer and wait for its response, getting the operation latency.\n *\n * @param {Libp2p} node\n * @param {PeerId|Multiaddr} peer\n * @returns {Promise<number>}\n */\nasync function ping (node, peer) {\n  // @ts-ignore multiaddr might not have toB58String\n  log('dialing %s to %s', PROTOCOL, peer.toB58String ? peer.toB58String() : peer)\n\n  const connection = await node.dial(peer)\n  const { stream } = await connection.newStream(PROTOCOL)\n\n  const start = Date.now()\n  const data = crypto.randomBytes(PING_LENGTH)\n\n  const [result] = await pipe(\n    [data],\n    stream,\n    (/** @type {MuxedStream} */ stream) => take(1, stream),\n    toBuffer,\n    collect\n  )\n  const end = Date.now()\n\n  if (!equals(data, result)) {\n    throw errCode(new Error('Received wrong ping ack'), 'ERR_WRONG_PING_ACK')\n  }\n\n  return end - start\n}\n\n/**\n * Subscribe ping protocol handler.\n *\n * @param {Libp2p} node\n */\nfunction mount (node) {\n  node.handle(PROTOCOL, ({ stream }) => pipe(stream, stream))\n}\n\n/**\n * Unsubscribe ping protocol handler.\n *\n * @param {Libp2p} node\n */\nfunction unmount (node) {\n  node.unhandle(PROTOCOL)\n}\n\nexports = module.exports = ping\nexports.mount = mount\nexports.unmount = unmount\n","'use strict'\n\nconst { Buffer } = require('buffer')\nconst BufferList = require('bl/BufferList')\n\nmodule.exports = async function * (source) {\n  for await (const b of source) {\n    if (Buffer.isBuffer(b)) {\n      yield b\n    } else if (BufferList.isBufferList(b)) {\n      yield b.slice()\n    } else {\n      yield Buffer.from(b)\n    }\n  }\n}\n\nmodule.exports.toBuffer = module.exports\n\nmodule.exports.toList = async function * (source) {\n  for await (const b of source) {\n    if (Buffer.isBuffer(b)) {\n      yield new BufferList().append(b)\n    } else if (BufferList.isBufferList(b)) {\n      yield b\n    } else {\n      yield new BufferList().append(Buffer.from(b))\n    }\n  }\n}\n","'use strict'\n\nmodule.exports = {\n  PROTOCOL: '/ipfs/ping/1.0.0',\n  PING_LENGTH: 32\n}\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:identify'), {\n  error: debug('libp2p:identify:err')\n})\nconst errCode = require('err-code')\nconst lp = require('it-length-prefixed')\nconst { pipe } = require('it-pipe')\nconst { collect, take, consume } = require('streaming-iterables')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\n\nconst PeerId = require('peer-id')\nconst { Multiaddr } = require('multiaddr')\n// @ts-ignore it-buffer does not have types\nconst { toBuffer } = require('it-buffer')\n\nconst Message = require('./message')\n\nconst Envelope = require('../record/envelope')\nconst PeerRecord = require('../record/peer-record')\n\nconst {\n  MULTICODEC_IDENTIFY,\n  MULTICODEC_IDENTIFY_PUSH,\n  PROTOCOL_VERSION\n} = require('./consts')\n\nconst { codes } = require('../errors')\n\n/**\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n */\n\n/**\n * @typedef {Object} HostProperties\n * @property {string} agentVersion\n */\n\nclass IdentifyService {\n  /**\n   * @class\n   * @param {Object} options\n   * @param {import('../')} options.libp2p\n   */\n  constructor ({ libp2p }) {\n    this._libp2p = libp2p\n    this.peerStore = libp2p.peerStore\n    this.addressManager = libp2p.addressManager\n    this.connectionManager = libp2p.connectionManager\n    this.peerId = libp2p.peerId\n\n    this.handleMessage = this.handleMessage.bind(this)\n\n    // Store self host metadata\n    this._host = {\n      protocolVersion: PROTOCOL_VERSION,\n      ...libp2p._options.host\n    }\n\n    this.peerStore.metadataBook.set(this.peerId, 'AgentVersion', uint8ArrayFromString(this._host.agentVersion))\n    this.peerStore.metadataBook.set(this.peerId, 'ProtocolVersion', uint8ArrayFromString(this._host.protocolVersion))\n    // When a new connection happens, trigger identify\n    this.connectionManager.on('peer:connect', (connection) => {\n      this.identify(connection).catch(log.error)\n    })\n\n    // When self multiaddrs change, trigger identify-push\n    this.peerStore.on('change:multiaddrs', ({ peerId }) => {\n      if (peerId.toString() === this.peerId.toString()) {\n        this.pushToPeerStore()\n      }\n    })\n\n    // When self protocols change, trigger identify-push\n    this.peerStore.on('change:protocols', ({ peerId }) => {\n      if (peerId.toString() === this.peerId.toString()) {\n        this.pushToPeerStore()\n      }\n    })\n  }\n\n  /**\n   * Send an Identify Push update to the list of connections\n   *\n   * @param {Connection[]} connections\n   * @returns {Promise<void[]>}\n   */\n  async push (connections) {\n    const signedPeerRecord = await this.peerStore.addressBook.getRawEnvelope(this.peerId)\n    const listenAddrs = this._libp2p.multiaddrs.map((ma) => ma.bytes)\n    const protocols = this.peerStore.protoBook.get(this.peerId) || []\n\n    const pushes = connections.map(async connection => {\n      try {\n        const { stream } = await connection.newStream(MULTICODEC_IDENTIFY_PUSH)\n\n        await pipe(\n          [Message.Identify.encode({\n            listenAddrs,\n            signedPeerRecord,\n            protocols\n          }).finish()],\n          lp.encode(),\n          stream,\n          consume\n        )\n      } catch (err) {\n        // Just log errors\n        log.error('could not push identify update to peer', err)\n      }\n    })\n\n    return Promise.all(pushes)\n  }\n\n  /**\n   * Calls `push` for all peers in the `peerStore` that are connected\n   *\n   * @returns {void}\n   */\n  pushToPeerStore () {\n    // Do not try to push if libp2p node is not running\n    if (!this._libp2p.isStarted()) {\n      return\n    }\n\n    const connections = []\n    let connection\n    for (const peer of this.peerStore.peers.values()) {\n      if (peer.protocols.includes(MULTICODEC_IDENTIFY_PUSH) && (connection = this.connectionManager.get(peer.id))) {\n        connections.push(connection)\n      }\n    }\n\n    this.push(connections)\n  }\n\n  /**\n   * Requests the `Identify` message from peer associated with the given `connection`.\n   * If the identified peer does not match the `PeerId` associated with the connection,\n   * an error will be thrown.\n   *\n   * @async\n   * @param {Connection} connection\n   * @returns {Promise<void>}\n   */\n  async identify (connection) {\n    const { stream } = await connection.newStream(MULTICODEC_IDENTIFY)\n    const [data] = await pipe(\n      [],\n      stream,\n      lp.decode(),\n      take(1),\n      toBuffer,\n      collect\n    )\n\n    if (!data) {\n      throw errCode(new Error('No data could be retrieved'), codes.ERR_CONNECTION_ENDED)\n    }\n\n    let message\n    try {\n      message = Message.Identify.decode(data)\n    } catch (err) {\n      throw errCode(err, codes.ERR_INVALID_MESSAGE)\n    }\n\n    const {\n      publicKey,\n      listenAddrs,\n      protocols,\n      observedAddr,\n      signedPeerRecord\n    } = message\n\n    const id = await PeerId.createFromPubKey(publicKey)\n\n    if (connection.remotePeer.toB58String() !== id.toB58String()) {\n      throw errCode(new Error('identified peer does not match the expected peer'), codes.ERR_INVALID_PEER)\n    }\n\n    // Get the observedAddr if there is one\n    const cleanObservedAddr = IdentifyService.getCleanMultiaddr(observedAddr)\n\n    try {\n      const envelope = await Envelope.openAndCertify(signedPeerRecord, PeerRecord.DOMAIN)\n      if (this.peerStore.addressBook.consumePeerRecord(envelope)) {\n        this.peerStore.protoBook.set(id, protocols)\n        this.peerStore.metadataBook.set(id, 'AgentVersion', uint8ArrayFromString(message.agentVersion))\n        this.peerStore.metadataBook.set(id, 'ProtocolVersion', uint8ArrayFromString(message.protocolVersion))\n        return\n      }\n    } catch (err) {\n      log('received invalid envelope, discard it and fallback to listenAddrs is available', err)\n    }\n\n    // LEGACY: Update peers data in PeerStore\n    try {\n      this.peerStore.addressBook.set(id, listenAddrs.map((addr) => new Multiaddr(addr)))\n    } catch (err) {\n      log.error('received invalid addrs', err)\n    }\n\n    this.peerStore.protoBook.set(id, protocols)\n    this.peerStore.metadataBook.set(id, 'AgentVersion', uint8ArrayFromString(message.agentVersion))\n    this.peerStore.metadataBook.set(id, 'ProtocolVersion', uint8ArrayFromString(message.protocolVersion))\n\n    // TODO: Add and score our observed addr\n    log('received observed address of %s', cleanObservedAddr)\n    // this.addressManager.addObservedAddr(observedAddr)\n  }\n\n  /**\n   * A handler to register with Libp2p to process identify messages.\n   *\n   * @param {Object} options\n   * @param {Connection} options.connection\n   * @param {MuxedStream} options.stream\n   * @param {string} options.protocol\n   * @returns {Promise<void>|undefined}\n   */\n  handleMessage ({ connection, stream, protocol }) {\n    switch (protocol) {\n      case MULTICODEC_IDENTIFY:\n        return this._handleIdentify({ connection, stream })\n      case MULTICODEC_IDENTIFY_PUSH:\n        return this._handlePush({ connection, stream })\n      default:\n        log.error('cannot handle unknown protocol %s', protocol)\n    }\n  }\n\n  /**\n   * Sends the `Identify` response with the Signed Peer Record\n   * to the requesting peer over the given `connection`\n   *\n   * @private\n   * @param {Object} options\n   * @param {MuxedStream} options.stream\n   * @param {Connection} options.connection\n   * @returns {Promise<void>}\n   */\n  async _handleIdentify ({ connection, stream }) {\n    let publicKey = new Uint8Array(0)\n    if (this.peerId.pubKey) {\n      publicKey = this.peerId.pubKey.bytes\n    }\n\n    const signedPeerRecord = await this.peerStore.addressBook.getRawEnvelope(this.peerId)\n    const protocols = this.peerStore.protoBook.get(this.peerId) || []\n\n    const message = Message.Identify.encode({\n      protocolVersion: this._host.protocolVersion,\n      agentVersion: this._host.agentVersion,\n      publicKey,\n      listenAddrs: this._libp2p.multiaddrs.map((ma) => ma.bytes),\n      signedPeerRecord,\n      observedAddr: connection.remoteAddr.bytes,\n      protocols\n    }).finish()\n\n    try {\n      await pipe(\n        [message],\n        lp.encode(),\n        stream,\n        consume\n      )\n    } catch (err) {\n      log.error('could not respond to identify request', err)\n    }\n  }\n\n  /**\n   * Reads the Identify Push message from the given `connection`\n   *\n   * @private\n   * @param {object} options\n   * @param {MuxedStream} options.stream\n   * @param {Connection} options.connection\n   * @returns {Promise<void>}\n   */\n  async _handlePush ({ connection, stream }) {\n    let message\n    try {\n      const [data] = await pipe(\n        [],\n        stream,\n        lp.decode(),\n        take(1),\n        toBuffer,\n        collect\n      )\n      message = Message.Identify.decode(data)\n    } catch (err) {\n      return log.error('received invalid message', err)\n    }\n\n    const id = connection.remotePeer\n\n    try {\n      const envelope = await Envelope.openAndCertify(message.signedPeerRecord, PeerRecord.DOMAIN)\n      if (this.peerStore.addressBook.consumePeerRecord(envelope)) {\n        this.peerStore.protoBook.set(id, message.protocols)\n        return\n      }\n    } catch (err) {\n      log('received invalid envelope, discard it and fallback to listenAddrs is available', err)\n    }\n\n    // LEGACY: Update peers data in PeerStore\n    try {\n      this.peerStore.addressBook.set(id,\n        message.listenAddrs.map((addr) => new Multiaddr(addr)))\n    } catch (err) {\n      log.error('received invalid addrs', err)\n    }\n\n    // Update the protocols\n    this.peerStore.protoBook.set(id, message.protocols)\n  }\n\n  /**\n   * Takes the `addr` and converts it to a Multiaddr if possible\n   *\n   * @param {Uint8Array | string} addr\n   * @returns {Multiaddr|null}\n   */\n  static getCleanMultiaddr (addr) {\n    if (addr && addr.length > 0) {\n      try {\n        return new Multiaddr(addr)\n      } catch (_) {\n        return null\n      }\n    }\n    return null\n  }\n}\n\n/**\n * The protocols the IdentifyService supports\n *\n * @property multicodecs\n */\nconst multicodecs = {\n  IDENTIFY: MULTICODEC_IDENTIFY,\n  IDENTIFY_PUSH: MULTICODEC_IDENTIFY_PUSH\n}\n\nIdentifyService.multicodecs = multicodecs\nIdentifyService.Messsage = Message\n\nmodule.exports = IdentifyService\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"libp2p-identify\"] || ($protobuf.roots[\"libp2p-identify\"] = {});\n\n$root.Identify = (function() {\n\n    /**\n     * Properties of an Identify.\n     * @exports IIdentify\n     * @interface IIdentify\n     * @property {string|null} [protocolVersion] Identify protocolVersion\n     * @property {string|null} [agentVersion] Identify agentVersion\n     * @property {Uint8Array|null} [publicKey] Identify publicKey\n     * @property {Array.<Uint8Array>|null} [listenAddrs] Identify listenAddrs\n     * @property {Uint8Array|null} [observedAddr] Identify observedAddr\n     * @property {Array.<string>|null} [protocols] Identify protocols\n     * @property {Uint8Array|null} [signedPeerRecord] Identify signedPeerRecord\n     */\n\n    /**\n     * Constructs a new Identify.\n     * @exports Identify\n     * @classdesc Represents an Identify.\n     * @implements IIdentify\n     * @constructor\n     * @param {IIdentify=} [p] Properties to set\n     */\n    function Identify(p) {\n        this.listenAddrs = [];\n        this.protocols = [];\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * Identify protocolVersion.\n     * @member {string} protocolVersion\n     * @memberof Identify\n     * @instance\n     */\n    Identify.prototype.protocolVersion = \"\";\n\n    /**\n     * Identify agentVersion.\n     * @member {string} agentVersion\n     * @memberof Identify\n     * @instance\n     */\n    Identify.prototype.agentVersion = \"\";\n\n    /**\n     * Identify publicKey.\n     * @member {Uint8Array} publicKey\n     * @memberof Identify\n     * @instance\n     */\n    Identify.prototype.publicKey = $util.newBuffer([]);\n\n    /**\n     * Identify listenAddrs.\n     * @member {Array.<Uint8Array>} listenAddrs\n     * @memberof Identify\n     * @instance\n     */\n    Identify.prototype.listenAddrs = $util.emptyArray;\n\n    /**\n     * Identify observedAddr.\n     * @member {Uint8Array} observedAddr\n     * @memberof Identify\n     * @instance\n     */\n    Identify.prototype.observedAddr = $util.newBuffer([]);\n\n    /**\n     * Identify protocols.\n     * @member {Array.<string>} protocols\n     * @memberof Identify\n     * @instance\n     */\n    Identify.prototype.protocols = $util.emptyArray;\n\n    /**\n     * Identify signedPeerRecord.\n     * @member {Uint8Array} signedPeerRecord\n     * @memberof Identify\n     * @instance\n     */\n    Identify.prototype.signedPeerRecord = $util.newBuffer([]);\n\n    /**\n     * Encodes the specified Identify message. Does not implicitly {@link Identify.verify|verify} messages.\n     * @function encode\n     * @memberof Identify\n     * @static\n     * @param {IIdentify} m Identify message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    Identify.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.publicKey != null && Object.hasOwnProperty.call(m, \"publicKey\"))\n            w.uint32(10).bytes(m.publicKey);\n        if (m.listenAddrs != null && m.listenAddrs.length) {\n            for (var i = 0; i < m.listenAddrs.length; ++i)\n                w.uint32(18).bytes(m.listenAddrs[i]);\n        }\n        if (m.protocols != null && m.protocols.length) {\n            for (var i = 0; i < m.protocols.length; ++i)\n                w.uint32(26).string(m.protocols[i]);\n        }\n        if (m.observedAddr != null && Object.hasOwnProperty.call(m, \"observedAddr\"))\n            w.uint32(34).bytes(m.observedAddr);\n        if (m.protocolVersion != null && Object.hasOwnProperty.call(m, \"protocolVersion\"))\n            w.uint32(42).string(m.protocolVersion);\n        if (m.agentVersion != null && Object.hasOwnProperty.call(m, \"agentVersion\"))\n            w.uint32(50).string(m.agentVersion);\n        if (m.signedPeerRecord != null && Object.hasOwnProperty.call(m, \"signedPeerRecord\"))\n            w.uint32(66).bytes(m.signedPeerRecord);\n        return w;\n    };\n\n    /**\n     * Decodes an Identify message from the specified reader or buffer.\n     * @function decode\n     * @memberof Identify\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {Identify} Identify\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    Identify.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.Identify();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 5:\n                m.protocolVersion = r.string();\n                break;\n            case 6:\n                m.agentVersion = r.string();\n                break;\n            case 1:\n                m.publicKey = r.bytes();\n                break;\n            case 2:\n                if (!(m.listenAddrs && m.listenAddrs.length))\n                    m.listenAddrs = [];\n                m.listenAddrs.push(r.bytes());\n                break;\n            case 4:\n                m.observedAddr = r.bytes();\n                break;\n            case 3:\n                if (!(m.protocols && m.protocols.length))\n                    m.protocols = [];\n                m.protocols.push(r.string());\n                break;\n            case 8:\n                m.signedPeerRecord = r.bytes();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates an Identify message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof Identify\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {Identify} Identify\n     */\n    Identify.fromObject = function fromObject(d) {\n        if (d instanceof $root.Identify)\n            return d;\n        var m = new $root.Identify();\n        if (d.protocolVersion != null) {\n            m.protocolVersion = String(d.protocolVersion);\n        }\n        if (d.agentVersion != null) {\n            m.agentVersion = String(d.agentVersion);\n        }\n        if (d.publicKey != null) {\n            if (typeof d.publicKey === \"string\")\n                $util.base64.decode(d.publicKey, m.publicKey = $util.newBuffer($util.base64.length(d.publicKey)), 0);\n            else if (d.publicKey.length)\n                m.publicKey = d.publicKey;\n        }\n        if (d.listenAddrs) {\n            if (!Array.isArray(d.listenAddrs))\n                throw TypeError(\".Identify.listenAddrs: array expected\");\n            m.listenAddrs = [];\n            for (var i = 0; i < d.listenAddrs.length; ++i) {\n                if (typeof d.listenAddrs[i] === \"string\")\n                    $util.base64.decode(d.listenAddrs[i], m.listenAddrs[i] = $util.newBuffer($util.base64.length(d.listenAddrs[i])), 0);\n                else if (d.listenAddrs[i].length)\n                    m.listenAddrs[i] = d.listenAddrs[i];\n            }\n        }\n        if (d.observedAddr != null) {\n            if (typeof d.observedAddr === \"string\")\n                $util.base64.decode(d.observedAddr, m.observedAddr = $util.newBuffer($util.base64.length(d.observedAddr)), 0);\n            else if (d.observedAddr.length)\n                m.observedAddr = d.observedAddr;\n        }\n        if (d.protocols) {\n            if (!Array.isArray(d.protocols))\n                throw TypeError(\".Identify.protocols: array expected\");\n            m.protocols = [];\n            for (var i = 0; i < d.protocols.length; ++i) {\n                m.protocols[i] = String(d.protocols[i]);\n            }\n        }\n        if (d.signedPeerRecord != null) {\n            if (typeof d.signedPeerRecord === \"string\")\n                $util.base64.decode(d.signedPeerRecord, m.signedPeerRecord = $util.newBuffer($util.base64.length(d.signedPeerRecord)), 0);\n            else if (d.signedPeerRecord.length)\n                m.signedPeerRecord = d.signedPeerRecord;\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from an Identify message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof Identify\n     * @static\n     * @param {Identify} m Identify\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    Identify.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.arrays || o.defaults) {\n            d.listenAddrs = [];\n            d.protocols = [];\n        }\n        if (o.defaults) {\n            if (o.bytes === String)\n                d.publicKey = \"\";\n            else {\n                d.publicKey = [];\n                if (o.bytes !== Array)\n                    d.publicKey = $util.newBuffer(d.publicKey);\n            }\n            if (o.bytes === String)\n                d.observedAddr = \"\";\n            else {\n                d.observedAddr = [];\n                if (o.bytes !== Array)\n                    d.observedAddr = $util.newBuffer(d.observedAddr);\n            }\n            d.protocolVersion = \"\";\n            d.agentVersion = \"\";\n            if (o.bytes === String)\n                d.signedPeerRecord = \"\";\n            else {\n                d.signedPeerRecord = [];\n                if (o.bytes !== Array)\n                    d.signedPeerRecord = $util.newBuffer(d.signedPeerRecord);\n            }\n        }\n        if (m.publicKey != null && m.hasOwnProperty(\"publicKey\")) {\n            d.publicKey = o.bytes === String ? $util.base64.encode(m.publicKey, 0, m.publicKey.length) : o.bytes === Array ? Array.prototype.slice.call(m.publicKey) : m.publicKey;\n        }\n        if (m.listenAddrs && m.listenAddrs.length) {\n            d.listenAddrs = [];\n            for (var j = 0; j < m.listenAddrs.length; ++j) {\n                d.listenAddrs[j] = o.bytes === String ? $util.base64.encode(m.listenAddrs[j], 0, m.listenAddrs[j].length) : o.bytes === Array ? Array.prototype.slice.call(m.listenAddrs[j]) : m.listenAddrs[j];\n            }\n        }\n        if (m.protocols && m.protocols.length) {\n            d.protocols = [];\n            for (var j = 0; j < m.protocols.length; ++j) {\n                d.protocols[j] = m.protocols[j];\n            }\n        }\n        if (m.observedAddr != null && m.hasOwnProperty(\"observedAddr\")) {\n            d.observedAddr = o.bytes === String ? $util.base64.encode(m.observedAddr, 0, m.observedAddr.length) : o.bytes === Array ? Array.prototype.slice.call(m.observedAddr) : m.observedAddr;\n        }\n        if (m.protocolVersion != null && m.hasOwnProperty(\"protocolVersion\")) {\n            d.protocolVersion = m.protocolVersion;\n        }\n        if (m.agentVersion != null && m.hasOwnProperty(\"agentVersion\")) {\n            d.agentVersion = m.agentVersion;\n        }\n        if (m.signedPeerRecord != null && m.hasOwnProperty(\"signedPeerRecord\")) {\n            d.signedPeerRecord = o.bytes === String ? $util.base64.encode(m.signedPeerRecord, 0, m.signedPeerRecord.length) : o.bytes === Array ? Array.prototype.slice.call(m.signedPeerRecord) : m.signedPeerRecord;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this Identify to JSON.\n     * @function toJSON\n     * @memberof Identify\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    Identify.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return Identify;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\n// @ts-ignore nat-api does not export types\nconst NatAPI = require('@motrix/nat-api')\nconst debug = require('debug')\nconst { promisify } = require('es6-promisify')\nconst { Multiaddr } = require('multiaddr')\nconst log = Object.assign(debug('libp2p:nat'), {\n  error: debug('libp2p:nat:err')\n})\nconst { isBrowser } = require('wherearewe')\nconst retry = require('p-retry')\n// @ts-ignore private-api does not export types\nconst isPrivateIp = require('private-ip')\nconst pkg = require('../package.json')\nconst errcode = require('err-code')\nconst {\n  codes: { ERR_INVALID_PARAMETERS }\n} = require('./errors')\nconst isLoopback = require('libp2p-utils/src/multiaddr/is-loopback')\n\nconst DEFAULT_TTL = 7200\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('./transport-manager')} TransportManager\n * @typedef {import('./address-manager')} AddressManager\n */\n\n/**\n * @typedef {Object} NatManagerProperties\n * @property {PeerId} peerId - The peer ID of the current node\n * @property {TransportManager} transportManager - A transport manager\n * @property {AddressManager} addressManager - An address manager\n *\n * @typedef {Object} NatManagerOptions\n * @property {boolean} enabled - Whether to enable the NAT manager\n * @property {string} [externalIp] - Pass a value to use instead of auto-detection\n * @property {string} [description] - A string value to use for the port mapping description on the gateway\n * @property {number} [ttl = DEFAULT_TTL] - How long UPnP port mappings should last for in seconds (minimum 1200)\n * @property {boolean} [keepAlive] - Whether to automatically refresh UPnP port mappings when their TTL is reached\n * @property {string} [gateway] - Pass a value to use instead of auto-detection\n * @property {object} [pmp] - PMP options\n * @property {boolean} [pmp.enabled] - Whether to enable PMP as well as UPnP\n */\n\nfunction highPort (min = 1024, max = 65535) {\n  return Math.floor(Math.random() * (max - min + 1) + min)\n}\n\nclass NatManager {\n  /**\n   * @class\n   * @param {NatManagerProperties & NatManagerOptions} options\n   */\n  constructor ({ peerId, addressManager, transportManager, ...options }) {\n    this._peerId = peerId\n    this._addressManager = addressManager\n    this._transportManager = transportManager\n\n    this._enabled = options.enabled\n    this._externalIp = options.externalIp\n    this._options = {\n      description: options.description || `${pkg.name}@${pkg.version} ${this._peerId}`,\n      ttl: options.ttl || DEFAULT_TTL,\n      autoUpdate: options.keepAlive || true,\n      gateway: options.gateway,\n      enablePMP: Boolean(options.pmp && options.pmp.enabled)\n    }\n\n    if (this._options.ttl < DEFAULT_TTL) {\n      throw errcode(new Error(`NatManager ttl should be at least ${DEFAULT_TTL} seconds`), ERR_INVALID_PARAMETERS)\n    }\n  }\n\n  /**\n   * Starts the NAT manager\n   */\n  start () {\n    if (isBrowser || !this._enabled) {\n      return\n    }\n\n    // done async to not slow down startup\n    this._start().catch((err) => {\n      // hole punching errors are non-fatal\n      log.error(err)\n    })\n  }\n\n  async _start () {\n    const addrs = this._transportManager.getAddrs()\n\n    for (const addr of addrs) {\n      // try to open uPnP ports for each thin waist address\n      const { family, host, port, transport } = addr.toOptions()\n\n      if (!addr.isThinWaistAddress() || transport !== 'tcp') {\n        // only bare tcp addresses\n        // eslint-disable-next-line no-continue\n        continue\n      }\n\n      if (isLoopback(addr)) {\n        // eslint-disable-next-line no-continue\n        continue\n      }\n\n      if (family !== 4) {\n        // ignore ipv6\n        // eslint-disable-next-line no-continue\n        continue\n      }\n\n      const client = this._getClient()\n      const publicIp = this._externalIp || await client.externalIp()\n\n      if (isPrivateIp(publicIp)) {\n        throw new Error(`${publicIp} is private - please set config.nat.externalIp to an externally routable IP or ensure you are not behind a double NAT`)\n      }\n\n      const publicPort = highPort()\n\n      log(`opening uPnP connection from ${publicIp}:${publicPort} to ${host}:${port}`)\n\n      await client.map({\n        publicPort,\n        privatePort: port,\n        protocol: transport.toUpperCase()\n      })\n\n      this._addressManager.addObservedAddr(Multiaddr.fromNodeAddress({\n        family: 4,\n        address: publicIp,\n        port: publicPort\n      }, transport))\n    }\n  }\n\n  _getClient () {\n    if (this._client) {\n      return this._client\n    }\n\n    const client = new NatAPI(this._options)\n\n    /** @type {(...any: any) => any} */\n    const map = promisify(client.map.bind(client))\n    /** @type {(...any: any) => any} */\n    const destroy = promisify(client.destroy.bind(client))\n    /** @type {(...any: any) => any} */\n    const externalIp = promisify(client.externalIp.bind(client))\n\n    // these are all network operations so add a retry\n    this._client = {\n      /**\n       * @param  {...any} args\n       * @returns {Promise<void>}\n       */\n      map: (...args) => retry(() => map(...args), { onFailedAttempt: log.error, unref: true }),\n\n      /**\n       * @param  {...any} args\n       * @returns {Promise<void>}\n       */\n      destroy: (...args) => retry(() => destroy(...args), { onFailedAttempt: log.error, unref: true }),\n\n      /**\n       * @param  {...any} args\n       * @returns {Promise<string>}\n       */\n      externalIp: (...args) => retry(() => externalIp(...args), { onFailedAttempt: log.error, unref: true })\n    }\n\n    return this._client\n  }\n\n  /**\n   * Stops the NAT manager\n   *\n   * @async\n   */\n  async stop () {\n    if (isBrowser || !this._client) {\n      return\n    }\n\n    try {\n      await this._client.destroy()\n      this._client = null\n    } catch (err) {\n      log.error(err)\n    }\n  }\n}\n\nmodule.exports = NatManager\n","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.promisify = promisify;\n// Symbols is a better way to do this, but not all browsers have good support,\n// so instead we'll just make do with a very unlikely string.\nvar customArgumentsToken = \"__ES6-PROMISIFY--CUSTOM-ARGUMENTS__\";\n/**\n * promisify()\n * Transforms callback-based function -- func(arg1, arg2 .. argN, callback) --\n * into an ES6-compatible Promise. Promisify provides a default callback of the\n * form (error, result) and rejects when `error` is truthy.\n *\n * @param {function} original - The function to promisify\n * @return {function} A promisified version of `original`\n */\n\nfunction promisify(original) {\n  // Ensure the argument is a function\n  if (typeof original !== \"function\") {\n    throw new TypeError(\"Argument to promisify must be a function\");\n  } // If the user has asked us to decode argument names for them, honour that\n\n\n  var argumentNames = original[customArgumentsToken]; // If the user has supplied a custom Promise implementation, use it.\n  // Otherwise fall back to whatever we can find on the global object.\n\n  var ES6Promise = promisify.Promise || Promise; // If we can find no Promise implemention, then fail now.\n\n  if (typeof ES6Promise !== \"function\") {\n    throw new Error(\"No Promise implementation found; do you need a polyfill?\");\n  }\n\n  return function () {\n    var _this = this;\n\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return new ES6Promise(function (resolve, reject) {\n      // Append the callback bound to the context\n      args.push(function callback(err) {\n        if (err) {\n          return reject(err);\n        }\n\n        for (var _len2 = arguments.length, values = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n          values[_key2 - 1] = arguments[_key2];\n        }\n\n        if (values.length === 1 || !argumentNames) {\n          return resolve(values[0]);\n        }\n\n        var o = {};\n        values.forEach(function (value, index) {\n          var name = argumentNames[index];\n\n          if (name) {\n            o[name] = value;\n          }\n        });\n        resolve(o);\n      }); // Call the function.\n\n      original.apply(_this, args);\n    });\n  };\n} // Attach this symbol to the exported function, so users can use it\n\n\npromisify.argumentNames = customArgumentsToken;\npromisify.Promise = undefined; // Export the public API","'use strict'\n\n/** @type {() => boolean} */\n// @ts-ignore\nconst isElectron = require('is-electron')\n\nconst IS_ENV_WITH_DOM = typeof window === 'object' && typeof document === 'object' && document.nodeType === 9\n\nconst IS_ELECTRON = isElectron()\nconst IS_BROWSER = IS_ENV_WITH_DOM && !IS_ELECTRON\nconst IS_ELECTRON_MAIN = IS_ELECTRON && !IS_ENV_WITH_DOM\nconst IS_ELECTRON_RENDERER = IS_ELECTRON && IS_ENV_WITH_DOM\nconst IS_NODE = typeof require === 'function' && typeof process !== 'undefined' && typeof process.release !== 'undefined' && process.release.name === 'node' && !IS_ELECTRON\n// @ts-ignore\n// eslint-disable-next-line no-undef\nconst IS_WEBWORKER = typeof importScripts === 'function' && typeof self !== 'undefined' && typeof WorkerGlobalScope !== 'undefined' && self instanceof WorkerGlobalScope\nconst IS_TEST = typeof process !== 'undefined' && typeof process.env !== 'undefined' && process.env.NODE_ENV === 'test'\n\nmodule.exports = {\n  isTest: IS_TEST,\n  isElectron: IS_ELECTRON,\n  isElectronMain: IS_ELECTRON_MAIN,\n  isElectronRenderer: IS_ELECTRON_RENDERER,\n  isNode: IS_NODE,\n  /**\n   * Detects browser main thread  **NOT** web worker or service worker\n   */\n  isBrowser: IS_BROWSER,\n  isWebWorker: IS_WEBWORKER,\n  isEnvWithDom: IS_ENV_WITH_DOM\n}\n","'use strict';\nconst retry = require('retry');\n\nconst networkErrorMsgs = [\n\t'Failed to fetch', // Chrome\n\t'NetworkError when attempting to fetch resource', // Firefox\n\t'The Internet connection appears to be offline', // Safari\n\t'Network request failed' // `cross-fetch`\n];\n\nclass AbortError extends Error {\n\tconstructor(message) {\n\t\tsuper();\n\n\t\tif (message instanceof Error) {\n\t\t\tthis.originalError = message;\n\t\t\t({message} = message);\n\t\t} else {\n\t\t\tthis.originalError = new Error(message);\n\t\t\tthis.originalError.stack = this.stack;\n\t\t}\n\n\t\tthis.name = 'AbortError';\n\t\tthis.message = message;\n\t}\n}\n\nconst decorateErrorWithCounts = (error, attemptNumber, options) => {\n\t// Minus 1 from attemptNumber because the first attempt does not count as a retry\n\tconst retriesLeft = options.retries - (attemptNumber - 1);\n\n\terror.attemptNumber = attemptNumber;\n\terror.retriesLeft = retriesLeft;\n\treturn error;\n};\n\nconst isNetworkError = errorMessage => networkErrorMsgs.includes(errorMessage);\n\nconst pRetry = (input, options) => new Promise((resolve, reject) => {\n\toptions = {\n\t\tonFailedAttempt: () => {},\n\t\tretries: 10,\n\t\t...options\n\t};\n\n\tconst operation = retry.operation(options);\n\n\toperation.attempt(async attemptNumber => {\n\t\ttry {\n\t\t\tresolve(await input(attemptNumber));\n\t\t} catch (error) {\n\t\t\tif (!(error instanceof Error)) {\n\t\t\t\treject(new TypeError(`Non-error was thrown: \"${error}\". You should only throw errors.`));\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (error instanceof AbortError) {\n\t\t\t\toperation.stop();\n\t\t\t\treject(error.originalError);\n\t\t\t} else if (error instanceof TypeError && !isNetworkError(error.message)) {\n\t\t\t\toperation.stop();\n\t\t\t\treject(error);\n\t\t\t} else {\n\t\t\t\tdecorateErrorWithCounts(error, attemptNumber, options);\n\n\t\t\t\ttry {\n\t\t\t\t\tawait options.onFailedAttempt(error);\n\t\t\t\t} catch (error) {\n\t\t\t\t\treject(error);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tif (!operation.retry(error)) {\n\t\t\t\t\treject(operation.mainError());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t});\n});\n\nmodule.exports = pRetry;\n// TODO: remove this in the next major version\nmodule.exports.default = pRetry;\n\nmodule.exports.AbortError = AbortError;\n","var RetryOperation = require('./retry_operation');\n\nexports.operation = function(options) {\n  var timeouts = exports.timeouts(options);\n  return new RetryOperation(timeouts, {\n      forever: options && options.forever,\n      unref: options && options.unref,\n      maxRetryTime: options && options.maxRetryTime\n  });\n};\n\nexports.timeouts = function(options) {\n  if (options instanceof Array) {\n    return [].concat(options);\n  }\n\n  var opts = {\n    retries: 10,\n    factor: 2,\n    minTimeout: 1 * 1000,\n    maxTimeout: Infinity,\n    randomize: false\n  };\n  for (var key in options) {\n    opts[key] = options[key];\n  }\n\n  if (opts.minTimeout > opts.maxTimeout) {\n    throw new Error('minTimeout is greater than maxTimeout');\n  }\n\n  var timeouts = [];\n  for (var i = 0; i < opts.retries; i++) {\n    timeouts.push(this.createTimeout(i, opts));\n  }\n\n  if (options && options.forever && !timeouts.length) {\n    timeouts.push(this.createTimeout(i, opts));\n  }\n\n  // sort the array numerically ascending\n  timeouts.sort(function(a,b) {\n    return a - b;\n  });\n\n  return timeouts;\n};\n\nexports.createTimeout = function(attempt, opts) {\n  var random = (opts.randomize)\n    ? (Math.random() + 1)\n    : 1;\n\n  var timeout = Math.round(random * opts.minTimeout * Math.pow(opts.factor, attempt));\n  timeout = Math.min(timeout, opts.maxTimeout);\n\n  return timeout;\n};\n\nexports.wrap = function(obj, options, methods) {\n  if (options instanceof Array) {\n    methods = options;\n    options = null;\n  }\n\n  if (!methods) {\n    methods = [];\n    for (var key in obj) {\n      if (typeof obj[key] === 'function') {\n        methods.push(key);\n      }\n    }\n  }\n\n  for (var i = 0; i < methods.length; i++) {\n    var method   = methods[i];\n    var original = obj[method];\n\n    obj[method] = function retryWrapper(original) {\n      var op       = exports.operation(options);\n      var args     = Array.prototype.slice.call(arguments, 1);\n      var callback = args.pop();\n\n      args.push(function(err) {\n        if (op.retry(err)) {\n          return;\n        }\n        if (err) {\n          arguments[0] = op.mainError();\n        }\n        callback.apply(this, arguments);\n      });\n\n      op.attempt(function() {\n        original.apply(obj, args);\n      });\n    }.bind(obj, original);\n    obj[method].options = options;\n  }\n};\n","function RetryOperation(timeouts, options) {\n  // Compatibility for the old (timeouts, retryForever) signature\n  if (typeof options === 'boolean') {\n    options = { forever: options };\n  }\n\n  this._originalTimeouts = JSON.parse(JSON.stringify(timeouts));\n  this._timeouts = timeouts;\n  this._options = options || {};\n  this._maxRetryTime = options && options.maxRetryTime || Infinity;\n  this._fn = null;\n  this._errors = [];\n  this._attempts = 1;\n  this._operationTimeout = null;\n  this._operationTimeoutCb = null;\n  this._timeout = null;\n  this._operationStart = null;\n\n  if (this._options.forever) {\n    this._cachedTimeouts = this._timeouts.slice(0);\n  }\n}\nmodule.exports = RetryOperation;\n\nRetryOperation.prototype.reset = function() {\n  this._attempts = 1;\n  this._timeouts = this._originalTimeouts;\n}\n\nRetryOperation.prototype.stop = function() {\n  if (this._timeout) {\n    clearTimeout(this._timeout);\n  }\n\n  this._timeouts       = [];\n  this._cachedTimeouts = null;\n};\n\nRetryOperation.prototype.retry = function(err) {\n  if (this._timeout) {\n    clearTimeout(this._timeout);\n  }\n\n  if (!err) {\n    return false;\n  }\n  var currentTime = new Date().getTime();\n  if (err && currentTime - this._operationStart >= this._maxRetryTime) {\n    this._errors.unshift(new Error('RetryOperation timeout occurred'));\n    return false;\n  }\n\n  this._errors.push(err);\n\n  var timeout = this._timeouts.shift();\n  if (timeout === undefined) {\n    if (this._cachedTimeouts) {\n      // retry forever, only keep last error\n      this._errors.splice(this._errors.length - 1, this._errors.length);\n      this._timeouts = this._cachedTimeouts.slice(0);\n      timeout = this._timeouts.shift();\n    } else {\n      return false;\n    }\n  }\n\n  var self = this;\n  var timer = setTimeout(function() {\n    self._attempts++;\n\n    if (self._operationTimeoutCb) {\n      self._timeout = setTimeout(function() {\n        self._operationTimeoutCb(self._attempts);\n      }, self._operationTimeout);\n\n      if (self._options.unref) {\n          self._timeout.unref();\n      }\n    }\n\n    self._fn(self._attempts);\n  }, timeout);\n\n  if (this._options.unref) {\n      timer.unref();\n  }\n\n  return true;\n};\n\nRetryOperation.prototype.attempt = function(fn, timeoutOps) {\n  this._fn = fn;\n\n  if (timeoutOps) {\n    if (timeoutOps.timeout) {\n      this._operationTimeout = timeoutOps.timeout;\n    }\n    if (timeoutOps.cb) {\n      this._operationTimeoutCb = timeoutOps.cb;\n    }\n  }\n\n  var self = this;\n  if (this._operationTimeoutCb) {\n    this._timeout = setTimeout(function() {\n      self._operationTimeoutCb();\n    }, self._operationTimeout);\n  }\n\n  this._operationStart = new Date().getTime();\n\n  this._fn(this._attempts);\n};\n\nRetryOperation.prototype.try = function(fn) {\n  console.log('Using RetryOperation.try() is deprecated');\n  this.attempt(fn);\n};\n\nRetryOperation.prototype.start = function(fn) {\n  console.log('Using RetryOperation.start() is deprecated');\n  this.attempt(fn);\n};\n\nRetryOperation.prototype.start = RetryOperation.prototype.try;\n\nRetryOperation.prototype.errors = function() {\n  return this._errors;\n};\n\nRetryOperation.prototype.attempts = function() {\n  return this._attempts;\n};\n\nRetryOperation.prototype.mainError = function() {\n  if (this._errors.length === 0) {\n    return null;\n  }\n\n  var counts = {};\n  var mainError = null;\n  var mainErrorCount = 0;\n\n  for (var i = 0; i < this._errors.length; i++) {\n    var error = this._errors[i];\n    var message = error.message;\n    var count = (counts[message] || 0) + 1;\n\n    counts[message] = count;\n\n    if (count >= mainErrorCount) {\n      mainError = error;\n      mainErrorCount = count;\n    }\n  }\n\n  return mainError;\n};\n","'use strict'\n\n// @ts-ignore is-loopback-addr does not publish types\nconst isLoopbackAddr = require('is-loopback-addr')\n\n/**\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n */\n\n/**\n * Check if a given multiaddr is a loopback address.\n *\n * @param {Multiaddr} ma\n * @returns {boolean}\n */\nfunction isLoopback (ma) {\n  const { address } = ma.nodeAddress()\n\n  return isLoopbackAddr(address)\n}\n\nmodule.exports = isLoopback\n","'use strict'\n\n/**\n * Check if a given ip address is a loopback address\n *\n * @param {string} ip - ip address to check\n * @returns {boolean}\n */\nfunction isLoopbackAddr (ip) {\n  return /^127\\.([0-9]{1,3})\\.([0-9]{1,3})\\.([0-9]{1,3})$/i.test(ip) ||\n    /^::1$/.test(ip)\n}\n\nmodule.exports = isLoopbackAddr\n","'use strict'\n\n// @ts-ignore - no types\nconst WS = require('libp2p-websockets')\n// @ts-ignore - no types\nconst WebRTCStar = require('libp2p-webrtc-star')\n// @ts-ignore - no types\nconst Multiplex = require('libp2p-mplex')\nconst { NOISE } = require('libp2p-noise')\nconst KadDHT = require('libp2p-kad-dht')\nconst GossipSub = require('libp2p-gossipsub')\nconst ipnsUtils = require('../ipns/routing/utils')\n\nmodule.exports = () => {\n  /** @type {import('libp2p').Libp2pOptions} */\n  const options = {\n    dialer: {\n      maxParallelDials: 150, // 150 total parallel multiaddr dials\n      maxDialsPerPeer: 4, // Allow 4 multiaddrs to be dialed per peer in parallel\n      dialTimeout: 10e3 // 10 second dial timeout per peer dial\n    },\n    modules: {\n      transport: [\n        WS,\n        WebRTCStar\n      ],\n      streamMuxer: [\n        Multiplex\n      ],\n      connEncryption: [\n        NOISE\n      ],\n      peerDiscovery: [],\n      dht: KadDHT,\n      pubsub: GossipSub\n    },\n    config: {\n      peerDiscovery: {\n        autoDial: true,\n        // [Bootstrap.tag] = 'bootstrap'\n        bootstrap: {\n          enabled: true\n        },\n        // [WebRTCStar.discovery.tag]\n        webRTCStar: {\n          enabled: true\n        }\n      },\n      dht: {\n        kBucketSize: 20,\n        enabled: false,\n        clientMode: true,\n        randomWalk: {\n          enabled: false\n        },\n        validators: {\n          ipns: ipnsUtils.validator\n        },\n        selectors: {\n          ipns: ipnsUtils.selector\n        }\n      },\n      pubsub: {\n        enabled: true,\n        emitSelf: true\n      },\n      nat: {\n        enabled: false\n      }\n    },\n    metrics: {\n      enabled: true\n    },\n    peerStore: {\n      persistence: true,\n      threshold: 1\n    }\n  }\n\n  return options\n}\n","'use strict'\n\nconst connect = require('it-ws/client')\nconst withIs = require('class-is')\nconst toUri = require('multiaddr-to-uri')\nconst { AbortError } = require('abortable-iterator')\nconst pDefer = require('p-defer')\n\nconst debug = require('debug')\nconst log = debug('libp2p:websockets')\nlog.error = debug('libp2p:websockets:error')\nconst env = require('ipfs-utils/src/env')\n\nconst createListener = require('./listener')\nconst toConnection = require('./socket-to-conn')\nconst filters = require('./filters')\n\n/**\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n */\n\n/**\n * @class WebSockets\n */\nclass WebSockets {\n  /**\n   * @class\n   * @param {object} options\n   * @param {Upgrader} options.upgrader\n   * @param {(multiaddrs: Array<Multiaddr>) => Array<Multiaddr>} options.filter - override transport addresses filter\n   */\n  constructor ({ upgrader, filter }) {\n    if (!upgrader) {\n      throw new Error('An upgrader must be provided. See https://github.com/libp2p/interface-transport#upgrader.')\n    }\n    this._upgrader = upgrader\n    this._filter = filter\n  }\n\n  /**\n   * @async\n   * @param {Multiaddr} ma\n   * @param {object} [options]\n   * @param {AbortSignal} [options.signal] - Used to abort dial requests\n   * @returns {Connection} An upgraded Connection\n   */\n  async dial (ma, options = {}) {\n    log('dialing %s', ma)\n\n    const socket = await this._connect(ma, options)\n    const maConn = toConnection(socket, { remoteAddr: ma, signal: options.signal })\n    log('new outbound connection %s', maConn.remoteAddr)\n\n    const conn = await this._upgrader.upgradeOutbound(maConn)\n    log('outbound connection %s upgraded', maConn.remoteAddr)\n    return conn\n  }\n\n  /**\n   * @private\n   * @param {Multiaddr} ma\n   * @param {object} [options]\n   * @param {AbortSignal} [options.signal] - Used to abort dial requests\n   * @returns {Promise<WebSocket>} Resolves a extended duplex iterable on top of a WebSocket\n   */\n  async _connect (ma, options = {}) {\n    if (options.signal && options.signal.aborted) {\n      throw new AbortError()\n    }\n    const cOpts = ma.toOptions()\n    log('dialing %s:%s', cOpts.host, cOpts.port)\n\n    const errorPromise = pDefer()\n    const errfn = (err) => {\n      const msg = `connection error: ${err.message}`\n      log.error(msg)\n\n      errorPromise.reject(err)\n    }\n\n    const rawSocket = connect(toUri(ma), Object.assign({ binary: true }, options))\n\n    if (rawSocket.socket.on) {\n      rawSocket.socket.on('error', errfn)\n    } else {\n      rawSocket.socket.onerror = errfn\n    }\n\n    if (!options.signal) {\n      await Promise.race([rawSocket.connected(), errorPromise.promise])\n\n      log('connected %s', ma)\n      return rawSocket\n    }\n\n    // Allow abort via signal during connect\n    let onAbort\n    const abort = new Promise((resolve, reject) => {\n      onAbort = () => {\n        reject(new AbortError())\n        // FIXME: https://github.com/libp2p/js-libp2p-websockets/issues/121\n        setTimeout(() => {\n          rawSocket.close()\n        })\n      }\n\n      // Already aborted?\n      if (options.signal.aborted) return onAbort()\n      options.signal.addEventListener('abort', onAbort)\n    })\n\n    try {\n      await Promise.race([abort, errorPromise.promise, rawSocket.connected()])\n    } finally {\n      options.signal.removeEventListener('abort', onAbort)\n    }\n\n    log('connected %s', ma)\n    return rawSocket\n  }\n\n  /**\n   * Creates a Websockets listener. The provided `handler` function will be called\n   * anytime a new incoming Connection has been successfully upgraded via\n   * `upgrader.upgradeInbound`.\n   *\n   * @param {object} [options]\n   * @param {http.Server} [options.server] - A pre-created Node.js HTTP/S server.\n   * @param {function (Connection)} handler\n   * @returns {Listener} A Websockets listener\n   */\n  createListener (options = {}, handler) {\n    if (typeof options === 'function') {\n      handler = options\n      options = {}\n    }\n\n    return createListener({ handler, upgrader: this._upgrader }, options)\n  }\n\n  /**\n   * Takes a list of `Multiaddr`s and returns only valid Websockets addresses.\n   * By default, in a browser environment only DNS+WSS multiaddr is accepted,\n   * while in a Node.js environment DNS+{WS, WSS} multiaddrs are accepted.\n   *\n   * @param {Multiaddr[]} multiaddrs\n   * @returns {Multiaddr[]} Valid Websockets multiaddrs\n   */\n  filter (multiaddrs) {\n    multiaddrs = Array.isArray(multiaddrs) ? multiaddrs : [multiaddrs]\n\n    if (this._filter) {\n      return this._filter(multiaddrs)\n    }\n\n    // Browser\n    if (env.isBrowser || env.isWebWorker) {\n      return filters.dnsWss(multiaddrs)\n    }\n\n    return filters.all(multiaddrs)\n  }\n}\n\nmodule.exports = withIs(WebSockets, {\n  className: 'WebSockets',\n  symbolName: '@libp2p/js-libp2p-websockets/websockets'\n})\n","'use strict'\n\n// load websocket library if we are not in the browser\nvar WebSocket = require('./web-socket')\nvar duplex = require('./duplex')\nvar wsurl = require('./ws-url')\n\nmodule.exports = function (addr, opts = {}) {\n  const location = typeof window === 'undefined' ? {} : window.location\n\n  const url = wsurl(addr, location)\n  const socket = new WebSocket(url, opts.websocket)\n\n  const stream = duplex(socket, opts)\n  stream.remoteAddress = url\n  stream.close = () => new Promise((resolve, reject) => {\n    socket.addEventListener('close', resolve)\n    socket.close()\n  })\n  stream.destroy = () => {\n    if (socket.terminate) {\n      socket.terminate()\n    } else {\n      socket.close()\n    }\n  }\n  stream.socket = socket\n\n  return stream\n}\n\nmodule.exports.connect = module.exports\n","/* eslint-env browser */\nmodule.exports = typeof WebSocket === 'undefined' ? require('ws') : WebSocket\n","const source = require('./source')\nconst sink = require('./sink')\n\nmodule.exports = (socket, options) => {\n  options = options || {}\n\n  if (options.binaryType) {\n    socket.binaryType = options.binaryType\n  } else if (options.binary) {\n    socket.binaryType = 'arraybuffer'\n  }\n\n  const duplex = {\n    sink: sink(socket, options),\n    source: source(socket, options),\n    connected: () => duplex.source.connected()\n  }\n\n  return duplex\n}\n","const { Buffer } = require('buffer')\nconst { EventIterator } = require('event-iterator')\n\n// copied from github.com/feross/buffer\n// Some ArrayBuffers are not passing the instanceof check, so we need to do a bit more work :(\nfunction isArrayBuffer (obj) {\n  return obj instanceof ArrayBuffer ||\n    (obj != null && obj.constructor != null && obj.constructor.name === 'ArrayBuffer' &&\n      typeof obj.byteLength === 'number')\n}\n\nmodule.exports = socket => {\n  const removeListener = socket.removeEventListener || socket.removeListener\n\n  const source = (async function * () {\n    const messages = new EventIterator(\n      ({ push, stop, fail }) => {\n        socket.addEventListener('message', push)\n        socket.addEventListener('error', fail)\n        socket.addEventListener('close', stop)\n\n        return () => {\n          removeListener.call(socket, 'message', push)\n          removeListener.call(socket, 'error', fail)\n          removeListener.call(socket, 'close', stop)\n        }\n      },\n      { highWaterMark: Infinity }\n    )\n\n    for await (const { data } of messages) {\n      yield isArrayBuffer(data) ? Buffer.from(data) : data\n    }\n  })()\n\n  let connected = socket.readyState === 1\n  let connError\n\n  socket.addEventListener('open', () => {\n    connected = true\n    connError = null\n  })\n\n  socket.addEventListener('close', () => {\n    connected = false\n    connError = null\n  })\n\n  socket.addEventListener('error', err => {\n    if (!connected) connError = err\n  })\n\n  source.connected = () => new Promise((resolve, reject) => {\n    if (connected) return resolve()\n    if (connError) return reject(connError)\n\n    const cleanUp = cont => {\n      removeListener.call(socket, 'open', onOpen)\n      removeListener.call(socket, 'error', onError)\n      cont()\n    }\n\n    const onOpen = () => cleanUp(resolve)\n    const onError = err => cleanUp(() => reject(err))\n\n    socket.addEventListener('open', onOpen)\n    socket.addEventListener('error', onError)\n  })\n\n  return source\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst event_iterator_1 = require(\"./event-iterator\");\nexports.EventIterator = event_iterator_1.EventIterator;\nfunction subscribe(event, options, evOptions) {\n    return new event_iterator_1.EventIterator(({ push }) => {\n        this.addEventListener(event, push, options);\n        return () => this.removeEventListener(event, push, options);\n    }, evOptions);\n}\nexports.subscribe = subscribe;\nexports.default = event_iterator_1.EventIterator;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nclass EventQueue {\n    constructor() {\n        this.pullQueue = [];\n        this.pushQueue = [];\n        this.eventHandlers = {};\n        this.isPaused = false;\n        this.isStopped = false;\n    }\n    push(value) {\n        if (this.isStopped)\n            return;\n        const resolution = { value, done: false };\n        if (this.pullQueue.length) {\n            const placeholder = this.pullQueue.shift();\n            if (placeholder)\n                placeholder.resolve(resolution);\n        }\n        else {\n            this.pushQueue.push(Promise.resolve(resolution));\n            if (this.highWaterMark !== undefined &&\n                this.pushQueue.length >= this.highWaterMark &&\n                !this.isPaused) {\n                this.isPaused = true;\n                if (this.eventHandlers.highWater) {\n                    this.eventHandlers.highWater();\n                }\n                else if (console) {\n                    console.warn(`EventIterator queue reached ${this.pushQueue.length} items`);\n                }\n            }\n        }\n    }\n    stop() {\n        if (this.isStopped)\n            return;\n        this.isStopped = true;\n        this.remove();\n        for (const placeholder of this.pullQueue) {\n            placeholder.resolve({ value: undefined, done: true });\n        }\n        this.pullQueue.length = 0;\n    }\n    fail(error) {\n        if (this.isStopped)\n            return;\n        this.isStopped = true;\n        this.remove();\n        if (this.pullQueue.length) {\n            for (const placeholder of this.pullQueue) {\n                placeholder.reject(error);\n            }\n            this.pullQueue.length = 0;\n        }\n        else {\n            const rejection = Promise.reject(error);\n            /* Attach error handler to avoid leaking an unhandled promise rejection. */\n            rejection.catch(() => { });\n            this.pushQueue.push(rejection);\n        }\n    }\n    remove() {\n        Promise.resolve().then(() => {\n            if (this.removeCallback)\n                this.removeCallback();\n        });\n    }\n    [Symbol.asyncIterator]() {\n        return {\n            next: (value) => {\n                const result = this.pushQueue.shift();\n                if (result) {\n                    if (this.lowWaterMark !== undefined &&\n                        this.pushQueue.length <= this.lowWaterMark &&\n                        this.isPaused) {\n                        this.isPaused = false;\n                        if (this.eventHandlers.lowWater) {\n                            this.eventHandlers.lowWater();\n                        }\n                    }\n                    return result;\n                }\n                else if (this.isStopped) {\n                    return Promise.resolve({ value: undefined, done: true });\n                }\n                else {\n                    return new Promise((resolve, reject) => {\n                        this.pullQueue.push({ resolve, reject });\n                    });\n                }\n            },\n            return: () => {\n                this.isStopped = true;\n                this.pushQueue.length = 0;\n                this.remove();\n                return Promise.resolve({ value: undefined, done: true });\n            },\n        };\n    }\n}\nclass EventIterator {\n    constructor(listen, { highWaterMark = 100, lowWaterMark = 1 } = {}) {\n        const queue = new EventQueue();\n        queue.highWaterMark = highWaterMark;\n        queue.lowWaterMark = lowWaterMark;\n        queue.removeCallback =\n            listen({\n                push: value => queue.push(value),\n                stop: () => queue.stop(),\n                fail: error => queue.fail(error),\n                on: (event, fn) => {\n                    queue.eventHandlers[event] = fn;\n                },\n            }) || (() => { });\n        this[Symbol.asyncIterator] = () => queue[Symbol.asyncIterator]();\n        Object.freeze(this);\n    }\n}\nexports.EventIterator = EventIterator;\nexports.default = EventIterator;\n","const ready = require('./ready')\n\nmodule.exports = (socket, options) => {\n  options = options || {}\n  options.closeOnEnd = options.closeOnEnd !== false\n\n  return async source => {\n    for await (const data of source) {\n      try {\n        await ready(socket)\n      } catch (err) {\n        if (err.message === 'socket closed') break\n        throw err\n      }\n\n      socket.send(data)\n    }\n\n    if (options.closeOnEnd && socket.readyState <= 1) {\n      return new Promise((resolve, reject) => {\n        socket.addEventListener('close', event => {\n          if (event.wasClean || event.code === 1006) {\n            resolve()\n          } else {\n            const err = Object.assign(new Error('ws error'), { event })\n            reject(err)\n          }\n        })\n\n        setTimeout(() => socket.close())\n      })\n    }\n  }\n}\n","module.exports = async socket => {\n  // if the socket is closing or closed, return end\n  if (socket.readyState >= 2) {\n    throw new Error('socket closed')\n  }\n\n  // if open, return\n  if (socket.readyState === 1) {\n    return\n  }\n\n  return new Promise((resolve, reject) => {\n    const remove = socket && (socket.removeEventListener || socket.removeListener)\n\n    function cleanup () {\n      if (typeof remove === 'function') {\n        remove.call(socket, 'open', handleOpen)\n        remove.call(socket, 'error', handleErr)\n      }\n    }\n\n    function handleOpen () {\n      cleanup(); resolve()\n    }\n\n    function handleErr (evt) {\n      cleanup(); reject(evt)\n    }\n\n    socket.addEventListener('open', handleOpen)\n    socket.addEventListener('error', handleErr)\n  })\n}\n","const { relative } = require('iso-url')\nconst map = { http: 'ws', https: 'wss' }\nconst def = 'ws'\n\nmodule.exports = (url, location) => relative(url, location, map, def)\n","'use strict'\n\nmodule.exports = function () {\n  throw new Error('WebSocket Servers can not be created in the browser!')\n}\n","'use strict'\n\nconst abortable = require('abortable-iterator')\nconst { CLOSE_TIMEOUT } = require('./constants')\nconst toMultiaddr = require('libp2p-utils/src/ip-port-to-multiaddr')\n\nconst pTimeout = require('p-timeout')\n\nconst debug = require('debug')\nconst log = debug('libp2p:websockets:socket')\nlog.error = debug('libp2p:websockets:socket:error')\n\n// Convert a stream into a MultiaddrConnection\n// https://github.com/libp2p/interface-transport#multiaddrconnection\nmodule.exports = (stream, options = {}) => {\n  const maConn = {\n    async sink (source) {\n      if (options.signal) {\n        source = abortable(source, options.signal)\n      }\n\n      try {\n        await stream.sink((async function * () {\n          for await (const chunk of source) {\n            // Convert BufferList to Buffer\n            yield chunk instanceof Uint8Array ? chunk : chunk.slice()\n          }\n        })())\n      } catch (err) {\n        if (err.type !== 'aborted') {\n          log.error(err)\n        }\n      }\n    },\n\n    source: options.signal ? abortable(stream.source, options.signal) : stream.source,\n\n    conn: stream,\n\n    localAddr: options.localAddr || (stream.localAddress && stream.localPort\n      ? toMultiaddr(stream.localAddress, stream.localPort)\n      : undefined),\n\n    // If the remote address was passed, use it - it may have the peer ID encapsulated\n    remoteAddr: options.remoteAddr || toMultiaddr(stream.remoteAddress, stream.remotePort),\n\n    timeline: { open: Date.now() },\n\n    async close () {\n      const start = Date.now()\n\n      try {\n        await pTimeout(stream.close(), CLOSE_TIMEOUT)\n      } catch (err) {\n        const { host, port } = maConn.remoteAddr.toOptions()\n        log('timeout closing stream to %s:%s after %dms, destroying it manually',\n          host, port, Date.now() - start)\n\n        stream.destroy()\n      } finally {\n        maConn.timeline.close = Date.now()\n      }\n    }\n  }\n\n  stream.socket.once && stream.socket.once('close', () => {\n    // In instances where `close` was not explicitly called,\n    // such as an iterable stream ending, ensure we have set the close\n    // timeline\n    if (!maConn.timeline.close) {\n      maConn.timeline.close = Date.now()\n    }\n  })\n\n  return maConn\n}\n","'use strict'\n\n// p2p multi-address code\nexports.CODE_P2P = 421\nexports.CODE_CIRCUIT = 290\n\nexports.CODE_TCP = 6\nexports.CODE_WS = 477\nexports.CODE_WSS = 478\n\n// Time to wait for a connection to close gracefully before destroying it manually\nexports.CLOSE_TIMEOUT = 2000\n","'use strict'\n\nconst debug = require('debug')\nconst log = Object.assign(debug('libp2p:ip-port-to-multiaddr'), {\n  error: debug('libp2p:ip-port-to-multiaddr:err')\n})\nconst { Multiaddr } = require('multiaddr')\nconst errCode = require('err-code')\nconst { Address4, Address6 } = require('ip-address')\n\nconst errors = {\n  ERR_INVALID_IP_PARAMETER: 'ERR_INVALID_IP_PARAMETER',\n  ERR_INVALID_PORT_PARAMETER: 'ERR_INVALID_PORT_PARAMETER',\n  ERR_INVALID_IP: 'ERR_INVALID_IP'\n}\n\n/**\n * Transform an IP, Port pair into a multiaddr\n *\n * @param {string} ip\n * @param {number|string} port\n */\nfunction ipPortToMultiaddr (ip, port) {\n  if (typeof ip !== 'string') {\n    throw errCode(new Error(`invalid ip provided: ${ip}`), errors.ERR_INVALID_IP_PARAMETER)\n  }\n\n  if (typeof port === 'string') {\n    port = parseInt(port)\n  }\n\n  if (isNaN(port)) {\n    throw errCode(new Error(`invalid port provided: ${port}`), errors.ERR_INVALID_PORT_PARAMETER)\n  }\n\n  try {\n    // Test valid IPv4\n    new Address4(ip) // eslint-disable-line no-new\n    return new Multiaddr(`/ip4/${ip}/tcp/${port}`)\n  } catch {}\n\n  try {\n    // Test valid IPv6\n    const ip6 = new Address6(ip)\n    return ip6.is4()\n      ? new Multiaddr(`/ip4/${ip6.to4().correctForm()}/tcp/${port}`)\n      : new Multiaddr(`/ip6/${ip}/tcp/${port}`)\n  } catch (err) {\n    const errMsg = `invalid ip:port for creating a multiaddr: ${ip}:${port}`\n    log.error(errMsg)\n    throw errCode(new Error(errMsg), errors.ERR_INVALID_IP)\n  }\n}\n\nmodule.exports = ipPortToMultiaddr\n\nmodule.exports.Errors = errors\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.v6 = exports.Address6 = exports.Address4 = void 0;\nvar ipv4_1 = require(\"./lib/ipv4\");\nObject.defineProperty(exports, \"Address4\", { enumerable: true, get: function () { return ipv4_1.Address4; } });\nvar ipv6_1 = require(\"./lib/ipv6\");\nObject.defineProperty(exports, \"Address6\", { enumerable: true, get: function () { return ipv6_1.Address6; } });\nvar helpers = __importStar(require(\"./lib/v6/helpers\"));\nexports.v6 = { helpers: helpers };\n//# sourceMappingURL=ip-address.js.map","\"use strict\";\n/* eslint-disable no-param-reassign */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Address4 = void 0;\nvar common = __importStar(require(\"./common\"));\nvar constants = __importStar(require(\"./v4/constants\"));\nvar address_error_1 = require(\"./address-error\");\nvar jsbn_1 = require(\"jsbn\");\nvar sprintf_js_1 = require(\"sprintf-js\");\n/**\n * Represents an IPv4 address\n * @class Address4\n * @param {string} address - An IPv4 address string\n */\nvar Address4 = /** @class */ (function () {\n    function Address4(address) {\n        this.groups = constants.GROUPS;\n        this.parsedAddress = [];\n        this.parsedSubnet = '';\n        this.subnet = '/32';\n        this.subnetMask = 32;\n        this.v4 = true;\n        /**\n         * Returns true if the address is correct, false otherwise\n         * @memberof Address4\n         * @instance\n         * @returns {Boolean}\n         */\n        this.isCorrect = common.isCorrect(constants.BITS);\n        /**\n         * Returns true if the given address is in the subnet of the current address\n         * @memberof Address4\n         * @instance\n         * @returns {boolean}\n         */\n        this.isInSubnet = common.isInSubnet;\n        this.address = address;\n        var subnet = constants.RE_SUBNET_STRING.exec(address);\n        if (subnet) {\n            this.parsedSubnet = subnet[0].replace('/', '');\n            this.subnetMask = parseInt(this.parsedSubnet, 10);\n            this.subnet = \"/\" + this.subnetMask;\n            if (this.subnetMask < 0 || this.subnetMask > constants.BITS) {\n                throw new address_error_1.AddressError('Invalid subnet mask.');\n            }\n            address = address.replace(constants.RE_SUBNET_STRING, '');\n        }\n        this.addressMinusSuffix = address;\n        this.parsedAddress = this.parse(address);\n    }\n    Address4.isValid = function (address) {\n        try {\n            // eslint-disable-next-line no-new\n            new Address4(address);\n            return true;\n        }\n        catch (e) {\n            return false;\n        }\n    };\n    /*\n     * Parses a v4 address\n     */\n    Address4.prototype.parse = function (address) {\n        var groups = address.split('.');\n        if (!address.match(constants.RE_ADDRESS)) {\n            throw new address_error_1.AddressError('Invalid IPv4 address.');\n        }\n        return groups;\n    };\n    /**\n     * Returns the correct form of an address\n     * @memberof Address4\n     * @instance\n     * @returns {String}\n     */\n    Address4.prototype.correctForm = function () {\n        return this.parsedAddress.map(function (part) { return parseInt(part, 10); }).join('.');\n    };\n    /**\n     * Converts a hex string to an IPv4 address object\n     * @memberof Address4\n     * @static\n     * @param {string} hex - a hex string to convert\n     * @returns {Address4}\n     */\n    Address4.fromHex = function (hex) {\n        var padded = hex.replace(/:/g, '').padStart(8, '0');\n        var groups = [];\n        var i;\n        for (i = 0; i < 8; i += 2) {\n            var h = padded.slice(i, i + 2);\n            groups.push(parseInt(h, 16));\n        }\n        return new Address4(groups.join('.'));\n    };\n    /**\n     * Converts an integer into a IPv4 address object\n     * @memberof Address4\n     * @static\n     * @param {integer} integer - a number to convert\n     * @returns {Address4}\n     */\n    Address4.fromInteger = function (integer) {\n        return Address4.fromHex(integer.toString(16));\n    };\n    /**\n     * Converts an IPv4 address object to a hex string\n     * @memberof Address4\n     * @instance\n     * @returns {String}\n     */\n    Address4.prototype.toHex = function () {\n        return this.parsedAddress.map(function (part) { return sprintf_js_1.sprintf('%02x', parseInt(part, 10)); }).join(':');\n    };\n    /**\n     * Converts an IPv4 address object to an array of bytes\n     * @memberof Address4\n     * @instance\n     * @returns {Array}\n     */\n    Address4.prototype.toArray = function () {\n        return this.parsedAddress.map(function (part) { return parseInt(part, 10); });\n    };\n    /**\n     * Converts an IPv4 address object to an IPv6 address group\n     * @memberof Address4\n     * @instance\n     * @returns {String}\n     */\n    Address4.prototype.toGroup6 = function () {\n        var output = [];\n        var i;\n        for (i = 0; i < constants.GROUPS; i += 2) {\n            var hex = sprintf_js_1.sprintf('%02x%02x', parseInt(this.parsedAddress[i], 10), parseInt(this.parsedAddress[i + 1], 10));\n            output.push(sprintf_js_1.sprintf('%x', parseInt(hex, 16)));\n        }\n        return output.join(':');\n    };\n    /**\n     * Returns the address as a BigInteger\n     * @memberof Address4\n     * @instance\n     * @returns {BigInteger}\n     */\n    Address4.prototype.bigInteger = function () {\n        return new jsbn_1.BigInteger(this.parsedAddress.map(function (n) { return sprintf_js_1.sprintf('%02x', parseInt(n, 10)); }).join(''), 16);\n    };\n    /**\n     * Helper function getting start address.\n     * @memberof Address4\n     * @instance\n     * @returns {BigInteger}\n     */\n    Address4.prototype._startAddress = function () {\n        return new jsbn_1.BigInteger(this.mask() + '0'.repeat(constants.BITS - this.subnetMask), 2);\n    };\n    /**\n     * The first address in the range given by this address' subnet.\n     * Often referred to as the Network Address.\n     * @memberof Address4\n     * @instance\n     * @returns {Address4}\n     */\n    Address4.prototype.startAddress = function () {\n        return Address4.fromBigInteger(this._startAddress());\n    };\n    /**\n     * The first host address in the range given by this address's subnet ie\n     * the first address after the Network Address\n     * @memberof Address4\n     * @instance\n     * @returns {Address4}\n     */\n    Address4.prototype.startAddressExclusive = function () {\n        var adjust = new jsbn_1.BigInteger('1');\n        return Address4.fromBigInteger(this._startAddress().add(adjust));\n    };\n    /**\n     * Helper function getting end address.\n     * @memberof Address4\n     * @instance\n     * @returns {BigInteger}\n     */\n    Address4.prototype._endAddress = function () {\n        return new jsbn_1.BigInteger(this.mask() + '1'.repeat(constants.BITS - this.subnetMask), 2);\n    };\n    /**\n     * The last address in the range given by this address' subnet\n     * Often referred to as the Broadcast\n     * @memberof Address4\n     * @instance\n     * @returns {Address4}\n     */\n    Address4.prototype.endAddress = function () {\n        return Address4.fromBigInteger(this._endAddress());\n    };\n    /**\n     * The last host address in the range given by this address's subnet ie\n     * the last address prior to the Broadcast Address\n     * @memberof Address4\n     * @instance\n     * @returns {Address4}\n     */\n    Address4.prototype.endAddressExclusive = function () {\n        var adjust = new jsbn_1.BigInteger('1');\n        return Address4.fromBigInteger(this._endAddress().subtract(adjust));\n    };\n    /**\n     * Converts a BigInteger to a v4 address object\n     * @memberof Address4\n     * @static\n     * @param {BigInteger} bigInteger - a BigInteger to convert\n     * @returns {Address4}\n     */\n    Address4.fromBigInteger = function (bigInteger) {\n        return Address4.fromInteger(parseInt(bigInteger.toString(), 10));\n    };\n    /**\n     * Returns the first n bits of the address, defaulting to the\n     * subnet mask\n     * @memberof Address4\n     * @instance\n     * @returns {String}\n     */\n    Address4.prototype.mask = function (mask) {\n        if (mask === undefined) {\n            mask = this.subnetMask;\n        }\n        return this.getBitsBase2(0, mask);\n    };\n    /**\n     * Returns the bits in the given range as a base-2 string\n     * @memberof Address4\n     * @instance\n     * @returns {string}\n     */\n    Address4.prototype.getBitsBase2 = function (start, end) {\n        return this.binaryZeroPad().slice(start, end);\n    };\n    /**\n     * Returns true if the given address is a multicast address\n     * @memberof Address4\n     * @instance\n     * @returns {boolean}\n     */\n    Address4.prototype.isMulticast = function () {\n        return this.isInSubnet(new Address4('224.0.0.0/4'));\n    };\n    /**\n     * Returns a zero-padded base-2 string representation of the address\n     * @memberof Address4\n     * @instance\n     * @returns {string}\n     */\n    Address4.prototype.binaryZeroPad = function () {\n        return this.bigInteger().toString(2).padStart(constants.BITS, '0');\n    };\n    /**\n     * Groups an IPv4 address for inclusion at the end of an IPv6 address\n     * @returns {String}\n     */\n    Address4.prototype.groupForV6 = function () {\n        var segments = this.parsedAddress;\n        return this.address.replace(constants.RE_ADDRESS, sprintf_js_1.sprintf('<span class=\"hover-group group-v4 group-6\">%s</span>.<span class=\"hover-group group-v4 group-7\">%s</span>', segments.slice(0, 2).join('.'), segments.slice(2, 4).join('.')));\n    };\n    return Address4;\n}());\nexports.Address4 = Address4;\n//# sourceMappingURL=ipv4.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.isCorrect = exports.isInSubnet = void 0;\nfunction isInSubnet(address) {\n    if (this.subnetMask < address.subnetMask) {\n        return false;\n    }\n    if (this.mask(address.subnetMask) === address.mask()) {\n        return true;\n    }\n    return false;\n}\nexports.isInSubnet = isInSubnet;\nfunction isCorrect(defaultBits) {\n    return function () {\n        if (this.addressMinusSuffix !== this.correctForm()) {\n            return false;\n        }\n        if (this.subnetMask === defaultBits && !this.parsedSubnet) {\n            return true;\n        }\n        return this.parsedSubnet === String(this.subnetMask);\n    };\n}\nexports.isCorrect = isCorrect;\n//# sourceMappingURL=common.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.RE_SUBNET_STRING = exports.RE_ADDRESS = exports.GROUPS = exports.BITS = void 0;\nexports.BITS = 32;\nexports.GROUPS = 4;\nexports.RE_ADDRESS = /^(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\\.(25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)$/g;\nexports.RE_SUBNET_STRING = /\\/\\d{1,2}$/;\n//# sourceMappingURL=constants.js.map","\"use strict\";\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = function (d, b) {\n        extendStatics = Object.setPrototypeOf ||\n            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n        return extendStatics(d, b);\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.AddressError = void 0;\nvar AddressError = /** @class */ (function (_super) {\n    __extends(AddressError, _super);\n    function AddressError(message, parseMessage) {\n        var _this = _super.call(this, message) || this;\n        _this.name = 'AddressError';\n        if (parseMessage !== null) {\n            _this.parseMessage = parseMessage;\n        }\n        return _this;\n    }\n    return AddressError;\n}(Error));\nexports.AddressError = AddressError;\n//# sourceMappingURL=address-error.js.map","(function(){\n\n    // Copyright (c) 2005  Tom Wu\n    // All Rights Reserved.\n    // See \"LICENSE\" for details.\n\n    // Basic JavaScript BN library - subset useful for RSA encryption.\n\n    // Bits per digit\n    var dbits;\n\n    // JavaScript engine analysis\n    var canary = 0xdeadbeefcafe;\n    var j_lm = ((canary&0xffffff)==0xefcafe);\n\n    // (public) Constructor\n    function BigInteger(a,b,c) {\n      if(a != null)\n        if(\"number\" == typeof a) this.fromNumber(a,b,c);\n        else if(b == null && \"string\" != typeof a) this.fromString(a,256);\n        else this.fromString(a,b);\n    }\n\n    // return new, unset BigInteger\n    function nbi() { return new BigInteger(null); }\n\n    // am: Compute w_j += (x*this_i), propagate carries,\n    // c is initial carry, returns final carry.\n    // c < 3*dvalue, x < 2*dvalue, this_i < dvalue\n    // We need to select the fastest one that works in this environment.\n\n    // am1: use a single mult and divide to get the high bits,\n    // max digit bits should be 26 because\n    // max internal value = 2*dvalue^2-2*dvalue (< 2^53)\n    function am1(i,x,w,j,c,n) {\n      while(--n >= 0) {\n        var v = x*this[i++]+w[j]+c;\n        c = Math.floor(v/0x4000000);\n        w[j++] = v&0x3ffffff;\n      }\n      return c;\n    }\n    // am2 avoids a big mult-and-extract completely.\n    // Max digit bits should be <= 30 because we do bitwise ops\n    // on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)\n    function am2(i,x,w,j,c,n) {\n      var xl = x&0x7fff, xh = x>>15;\n      while(--n >= 0) {\n        var l = this[i]&0x7fff;\n        var h = this[i++]>>15;\n        var m = xh*l+h*xl;\n        l = xl*l+((m&0x7fff)<<15)+w[j]+(c&0x3fffffff);\n        c = (l>>>30)+(m>>>15)+xh*h+(c>>>30);\n        w[j++] = l&0x3fffffff;\n      }\n      return c;\n    }\n    // Alternately, set max digit bits to 28 since some\n    // browsers slow down when dealing with 32-bit numbers.\n    function am3(i,x,w,j,c,n) {\n      var xl = x&0x3fff, xh = x>>14;\n      while(--n >= 0) {\n        var l = this[i]&0x3fff;\n        var h = this[i++]>>14;\n        var m = xh*l+h*xl;\n        l = xl*l+((m&0x3fff)<<14)+w[j]+c;\n        c = (l>>28)+(m>>14)+xh*h;\n        w[j++] = l&0xfffffff;\n      }\n      return c;\n    }\n    var inBrowser = typeof navigator !== \"undefined\";\n    if(inBrowser && j_lm && (navigator.appName == \"Microsoft Internet Explorer\")) {\n      BigInteger.prototype.am = am2;\n      dbits = 30;\n    }\n    else if(inBrowser && j_lm && (navigator.appName != \"Netscape\")) {\n      BigInteger.prototype.am = am1;\n      dbits = 26;\n    }\n    else { // Mozilla/Netscape seems to prefer am3\n      BigInteger.prototype.am = am3;\n      dbits = 28;\n    }\n\n    BigInteger.prototype.DB = dbits;\n    BigInteger.prototype.DM = ((1<<dbits)-1);\n    BigInteger.prototype.DV = (1<<dbits);\n\n    var BI_FP = 52;\n    BigInteger.prototype.FV = Math.pow(2,BI_FP);\n    BigInteger.prototype.F1 = BI_FP-dbits;\n    BigInteger.prototype.F2 = 2*dbits-BI_FP;\n\n    // Digit conversions\n    var BI_RM = \"0123456789abcdefghijklmnopqrstuvwxyz\";\n    var BI_RC = new Array();\n    var rr,vv;\n    rr = \"0\".charCodeAt(0);\n    for(vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;\n    rr = \"a\".charCodeAt(0);\n    for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;\n    rr = \"A\".charCodeAt(0);\n    for(vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;\n\n    function int2char(n) { return BI_RM.charAt(n); }\n    function intAt(s,i) {\n      var c = BI_RC[s.charCodeAt(i)];\n      return (c==null)?-1:c;\n    }\n\n    // (protected) copy this to r\n    function bnpCopyTo(r) {\n      for(var i = this.t-1; i >= 0; --i) r[i] = this[i];\n      r.t = this.t;\n      r.s = this.s;\n    }\n\n    // (protected) set from integer value x, -DV <= x < DV\n    function bnpFromInt(x) {\n      this.t = 1;\n      this.s = (x<0)?-1:0;\n      if(x > 0) this[0] = x;\n      else if(x < -1) this[0] = x+this.DV;\n      else this.t = 0;\n    }\n\n    // return bigint initialized to value\n    function nbv(i) { var r = nbi(); r.fromInt(i); return r; }\n\n    // (protected) set from string and radix\n    function bnpFromString(s,b) {\n      var k;\n      if(b == 16) k = 4;\n      else if(b == 8) k = 3;\n      else if(b == 256) k = 8; // byte array\n      else if(b == 2) k = 1;\n      else if(b == 32) k = 5;\n      else if(b == 4) k = 2;\n      else { this.fromRadix(s,b); return; }\n      this.t = 0;\n      this.s = 0;\n      var i = s.length, mi = false, sh = 0;\n      while(--i >= 0) {\n        var x = (k==8)?s[i]&0xff:intAt(s,i);\n        if(x < 0) {\n          if(s.charAt(i) == \"-\") mi = true;\n          continue;\n        }\n        mi = false;\n        if(sh == 0)\n          this[this.t++] = x;\n        else if(sh+k > this.DB) {\n          this[this.t-1] |= (x&((1<<(this.DB-sh))-1))<<sh;\n          this[this.t++] = (x>>(this.DB-sh));\n        }\n        else\n          this[this.t-1] |= x<<sh;\n        sh += k;\n        if(sh >= this.DB) sh -= this.DB;\n      }\n      if(k == 8 && (s[0]&0x80) != 0) {\n        this.s = -1;\n        if(sh > 0) this[this.t-1] |= ((1<<(this.DB-sh))-1)<<sh;\n      }\n      this.clamp();\n      if(mi) BigInteger.ZERO.subTo(this,this);\n    }\n\n    // (protected) clamp off excess high words\n    function bnpClamp() {\n      var c = this.s&this.DM;\n      while(this.t > 0 && this[this.t-1] == c) --this.t;\n    }\n\n    // (public) return string representation in given radix\n    function bnToString(b) {\n      if(this.s < 0) return \"-\"+this.negate().toString(b);\n      var k;\n      if(b == 16) k = 4;\n      else if(b == 8) k = 3;\n      else if(b == 2) k = 1;\n      else if(b == 32) k = 5;\n      else if(b == 4) k = 2;\n      else return this.toRadix(b);\n      var km = (1<<k)-1, d, m = false, r = \"\", i = this.t;\n      var p = this.DB-(i*this.DB)%k;\n      if(i-- > 0) {\n        if(p < this.DB && (d = this[i]>>p) > 0) { m = true; r = int2char(d); }\n        while(i >= 0) {\n          if(p < k) {\n            d = (this[i]&((1<<p)-1))<<(k-p);\n            d |= this[--i]>>(p+=this.DB-k);\n          }\n          else {\n            d = (this[i]>>(p-=k))&km;\n            if(p <= 0) { p += this.DB; --i; }\n          }\n          if(d > 0) m = true;\n          if(m) r += int2char(d);\n        }\n      }\n      return m?r:\"0\";\n    }\n\n    // (public) -this\n    function bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); return r; }\n\n    // (public) |this|\n    function bnAbs() { return (this.s<0)?this.negate():this; }\n\n    // (public) return + if this > a, - if this < a, 0 if equal\n    function bnCompareTo(a) {\n      var r = this.s-a.s;\n      if(r != 0) return r;\n      var i = this.t;\n      r = i-a.t;\n      if(r != 0) return (this.s<0)?-r:r;\n      while(--i >= 0) if((r=this[i]-a[i]) != 0) return r;\n      return 0;\n    }\n\n    // returns bit length of the integer x\n    function nbits(x) {\n      var r = 1, t;\n      if((t=x>>>16) != 0) { x = t; r += 16; }\n      if((t=x>>8) != 0) { x = t; r += 8; }\n      if((t=x>>4) != 0) { x = t; r += 4; }\n      if((t=x>>2) != 0) { x = t; r += 2; }\n      if((t=x>>1) != 0) { x = t; r += 1; }\n      return r;\n    }\n\n    // (public) return the number of bits in \"this\"\n    function bnBitLength() {\n      if(this.t <= 0) return 0;\n      return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));\n    }\n\n    // (protected) r = this << n*DB\n    function bnpDLShiftTo(n,r) {\n      var i;\n      for(i = this.t-1; i >= 0; --i) r[i+n] = this[i];\n      for(i = n-1; i >= 0; --i) r[i] = 0;\n      r.t = this.t+n;\n      r.s = this.s;\n    }\n\n    // (protected) r = this >> n*DB\n    function bnpDRShiftTo(n,r) {\n      for(var i = n; i < this.t; ++i) r[i-n] = this[i];\n      r.t = Math.max(this.t-n,0);\n      r.s = this.s;\n    }\n\n    // (protected) r = this << n\n    function bnpLShiftTo(n,r) {\n      var bs = n%this.DB;\n      var cbs = this.DB-bs;\n      var bm = (1<<cbs)-1;\n      var ds = Math.floor(n/this.DB), c = (this.s<<bs)&this.DM, i;\n      for(i = this.t-1; i >= 0; --i) {\n        r[i+ds+1] = (this[i]>>cbs)|c;\n        c = (this[i]&bm)<<bs;\n      }\n      for(i = ds-1; i >= 0; --i) r[i] = 0;\n      r[ds] = c;\n      r.t = this.t+ds+1;\n      r.s = this.s;\n      r.clamp();\n    }\n\n    // (protected) r = this >> n\n    function bnpRShiftTo(n,r) {\n      r.s = this.s;\n      var ds = Math.floor(n/this.DB);\n      if(ds >= this.t) { r.t = 0; return; }\n      var bs = n%this.DB;\n      var cbs = this.DB-bs;\n      var bm = (1<<bs)-1;\n      r[0] = this[ds]>>bs;\n      for(var i = ds+1; i < this.t; ++i) {\n        r[i-ds-1] |= (this[i]&bm)<<cbs;\n        r[i-ds] = this[i]>>bs;\n      }\n      if(bs > 0) r[this.t-ds-1] |= (this.s&bm)<<cbs;\n      r.t = this.t-ds;\n      r.clamp();\n    }\n\n    // (protected) r = this - a\n    function bnpSubTo(a,r) {\n      var i = 0, c = 0, m = Math.min(a.t,this.t);\n      while(i < m) {\n        c += this[i]-a[i];\n        r[i++] = c&this.DM;\n        c >>= this.DB;\n      }\n      if(a.t < this.t) {\n        c -= a.s;\n        while(i < this.t) {\n          c += this[i];\n          r[i++] = c&this.DM;\n          c >>= this.DB;\n        }\n        c += this.s;\n      }\n      else {\n        c += this.s;\n        while(i < a.t) {\n          c -= a[i];\n          r[i++] = c&this.DM;\n          c >>= this.DB;\n        }\n        c -= a.s;\n      }\n      r.s = (c<0)?-1:0;\n      if(c < -1) r[i++] = this.DV+c;\n      else if(c > 0) r[i++] = c;\n      r.t = i;\n      r.clamp();\n    }\n\n    // (protected) r = this * a, r != this,a (HAC 14.12)\n    // \"this\" should be the larger one if appropriate.\n    function bnpMultiplyTo(a,r) {\n      var x = this.abs(), y = a.abs();\n      var i = x.t;\n      r.t = i+y.t;\n      while(--i >= 0) r[i] = 0;\n      for(i = 0; i < y.t; ++i) r[i+x.t] = x.am(0,y[i],r,i,0,x.t);\n      r.s = 0;\n      r.clamp();\n      if(this.s != a.s) BigInteger.ZERO.subTo(r,r);\n    }\n\n    // (protected) r = this^2, r != this (HAC 14.16)\n    function bnpSquareTo(r) {\n      var x = this.abs();\n      var i = r.t = 2*x.t;\n      while(--i >= 0) r[i] = 0;\n      for(i = 0; i < x.t-1; ++i) {\n        var c = x.am(i,x[i],r,2*i,0,1);\n        if((r[i+x.t]+=x.am(i+1,2*x[i],r,2*i+1,c,x.t-i-1)) >= x.DV) {\n          r[i+x.t] -= x.DV;\n          r[i+x.t+1] = 1;\n        }\n      }\n      if(r.t > 0) r[r.t-1] += x.am(i,x[i],r,2*i,0,1);\n      r.s = 0;\n      r.clamp();\n    }\n\n    // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)\n    // r != q, this != m.  q or r may be null.\n    function bnpDivRemTo(m,q,r) {\n      var pm = m.abs();\n      if(pm.t <= 0) return;\n      var pt = this.abs();\n      if(pt.t < pm.t) {\n        if(q != null) q.fromInt(0);\n        if(r != null) this.copyTo(r);\n        return;\n      }\n      if(r == null) r = nbi();\n      var y = nbi(), ts = this.s, ms = m.s;\n      var nsh = this.DB-nbits(pm[pm.t-1]);   // normalize modulus\n      if(nsh > 0) { pm.lShiftTo(nsh,y); pt.lShiftTo(nsh,r); }\n      else { pm.copyTo(y); pt.copyTo(r); }\n      var ys = y.t;\n      var y0 = y[ys-1];\n      if(y0 == 0) return;\n      var yt = y0*(1<<this.F1)+((ys>1)?y[ys-2]>>this.F2:0);\n      var d1 = this.FV/yt, d2 = (1<<this.F1)/yt, e = 1<<this.F2;\n      var i = r.t, j = i-ys, t = (q==null)?nbi():q;\n      y.dlShiftTo(j,t);\n      if(r.compareTo(t) >= 0) {\n        r[r.t++] = 1;\n        r.subTo(t,r);\n      }\n      BigInteger.ONE.dlShiftTo(ys,t);\n      t.subTo(y,y);  // \"negative\" y so we can replace sub with am later\n      while(y.t < ys) y[y.t++] = 0;\n      while(--j >= 0) {\n        // Estimate quotient digit\n        var qd = (r[--i]==y0)?this.DM:Math.floor(r[i]*d1+(r[i-1]+e)*d2);\n        if((r[i]+=y.am(0,qd,r,j,0,ys)) < qd) {   // Try it out\n          y.dlShiftTo(j,t);\n          r.subTo(t,r);\n          while(r[i] < --qd) r.subTo(t,r);\n        }\n      }\n      if(q != null) {\n        r.drShiftTo(ys,q);\n        if(ts != ms) BigInteger.ZERO.subTo(q,q);\n      }\n      r.t = ys;\n      r.clamp();\n      if(nsh > 0) r.rShiftTo(nsh,r); // Denormalize remainder\n      if(ts < 0) BigInteger.ZERO.subTo(r,r);\n    }\n\n    // (public) this mod a\n    function bnMod(a) {\n      var r = nbi();\n      this.abs().divRemTo(a,null,r);\n      if(this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r,r);\n      return r;\n    }\n\n    // Modular reduction using \"classic\" algorithm\n    function Classic(m) { this.m = m; }\n    function cConvert(x) {\n      if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);\n      else return x;\n    }\n    function cRevert(x) { return x; }\n    function cReduce(x) { x.divRemTo(this.m,null,x); }\n    function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n    function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n    Classic.prototype.convert = cConvert;\n    Classic.prototype.revert = cRevert;\n    Classic.prototype.reduce = cReduce;\n    Classic.prototype.mulTo = cMulTo;\n    Classic.prototype.sqrTo = cSqrTo;\n\n    // (protected) return \"-1/this % 2^DB\"; useful for Mont. reduction\n    // justification:\n    //         xy == 1 (mod m)\n    //         xy =  1+km\n    //   xy(2-xy) = (1+km)(1-km)\n    // x[y(2-xy)] = 1-k^2m^2\n    // x[y(2-xy)] == 1 (mod m^2)\n    // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2\n    // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.\n    // JS multiply \"overflows\" differently from C/C++, so care is needed here.\n    function bnpInvDigit() {\n      if(this.t < 1) return 0;\n      var x = this[0];\n      if((x&1) == 0) return 0;\n      var y = x&3;       // y == 1/x mod 2^2\n      y = (y*(2-(x&0xf)*y))&0xf; // y == 1/x mod 2^4\n      y = (y*(2-(x&0xff)*y))&0xff;   // y == 1/x mod 2^8\n      y = (y*(2-(((x&0xffff)*y)&0xffff)))&0xffff;    // y == 1/x mod 2^16\n      // last step - calculate inverse mod DV directly;\n      // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints\n      y = (y*(2-x*y%this.DV))%this.DV;       // y == 1/x mod 2^dbits\n      // we really want the negative inverse, and -DV < y < DV\n      return (y>0)?this.DV-y:-y;\n    }\n\n    // Montgomery reduction\n    function Montgomery(m) {\n      this.m = m;\n      this.mp = m.invDigit();\n      this.mpl = this.mp&0x7fff;\n      this.mph = this.mp>>15;\n      this.um = (1<<(m.DB-15))-1;\n      this.mt2 = 2*m.t;\n    }\n\n    // xR mod m\n    function montConvert(x) {\n      var r = nbi();\n      x.abs().dlShiftTo(this.m.t,r);\n      r.divRemTo(this.m,null,r);\n      if(x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r,r);\n      return r;\n    }\n\n    // x/R mod m\n    function montRevert(x) {\n      var r = nbi();\n      x.copyTo(r);\n      this.reduce(r);\n      return r;\n    }\n\n    // x = x/R mod m (HAC 14.32)\n    function montReduce(x) {\n      while(x.t <= this.mt2) // pad x so am has enough room later\n        x[x.t++] = 0;\n      for(var i = 0; i < this.m.t; ++i) {\n        // faster way of calculating u0 = x[i]*mp mod DV\n        var j = x[i]&0x7fff;\n        var u0 = (j*this.mpl+(((j*this.mph+(x[i]>>15)*this.mpl)&this.um)<<15))&x.DM;\n        // use am to combine the multiply-shift-add into one call\n        j = i+this.m.t;\n        x[j] += this.m.am(0,u0,x,i,0,this.m.t);\n        // propagate carry\n        while(x[j] >= x.DV) { x[j] -= x.DV; x[++j]++; }\n      }\n      x.clamp();\n      x.drShiftTo(this.m.t,x);\n      if(x.compareTo(this.m) >= 0) x.subTo(this.m,x);\n    }\n\n    // r = \"x^2/R mod m\"; x != r\n    function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n    // r = \"xy/R mod m\"; x,y != r\n    function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n\n    Montgomery.prototype.convert = montConvert;\n    Montgomery.prototype.revert = montRevert;\n    Montgomery.prototype.reduce = montReduce;\n    Montgomery.prototype.mulTo = montMulTo;\n    Montgomery.prototype.sqrTo = montSqrTo;\n\n    // (protected) true iff this is even\n    function bnpIsEven() { return ((this.t>0)?(this[0]&1):this.s) == 0; }\n\n    // (protected) this^e, e < 2^32, doing sqr and mul with \"r\" (HAC 14.79)\n    function bnpExp(e,z) {\n      if(e > 0xffffffff || e < 1) return BigInteger.ONE;\n      var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e)-1;\n      g.copyTo(r);\n      while(--i >= 0) {\n        z.sqrTo(r,r2);\n        if((e&(1<<i)) > 0) z.mulTo(r2,g,r);\n        else { var t = r; r = r2; r2 = t; }\n      }\n      return z.revert(r);\n    }\n\n    // (public) this^e % m, 0 <= e < 2^32\n    function bnModPowInt(e,m) {\n      var z;\n      if(e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);\n      return this.exp(e,z);\n    }\n\n    // protected\n    BigInteger.prototype.copyTo = bnpCopyTo;\n    BigInteger.prototype.fromInt = bnpFromInt;\n    BigInteger.prototype.fromString = bnpFromString;\n    BigInteger.prototype.clamp = bnpClamp;\n    BigInteger.prototype.dlShiftTo = bnpDLShiftTo;\n    BigInteger.prototype.drShiftTo = bnpDRShiftTo;\n    BigInteger.prototype.lShiftTo = bnpLShiftTo;\n    BigInteger.prototype.rShiftTo = bnpRShiftTo;\n    BigInteger.prototype.subTo = bnpSubTo;\n    BigInteger.prototype.multiplyTo = bnpMultiplyTo;\n    BigInteger.prototype.squareTo = bnpSquareTo;\n    BigInteger.prototype.divRemTo = bnpDivRemTo;\n    BigInteger.prototype.invDigit = bnpInvDigit;\n    BigInteger.prototype.isEven = bnpIsEven;\n    BigInteger.prototype.exp = bnpExp;\n\n    // public\n    BigInteger.prototype.toString = bnToString;\n    BigInteger.prototype.negate = bnNegate;\n    BigInteger.prototype.abs = bnAbs;\n    BigInteger.prototype.compareTo = bnCompareTo;\n    BigInteger.prototype.bitLength = bnBitLength;\n    BigInteger.prototype.mod = bnMod;\n    BigInteger.prototype.modPowInt = bnModPowInt;\n\n    // \"constants\"\n    BigInteger.ZERO = nbv(0);\n    BigInteger.ONE = nbv(1);\n\n    // Copyright (c) 2005-2009  Tom Wu\n    // All Rights Reserved.\n    // See \"LICENSE\" for details.\n\n    // Extended JavaScript BN functions, required for RSA private ops.\n\n    // Version 1.1: new BigInteger(\"0\", 10) returns \"proper\" zero\n    // Version 1.2: square() API, isProbablePrime fix\n\n    // (public)\n    function bnClone() { var r = nbi(); this.copyTo(r); return r; }\n\n    // (public) return value as integer\n    function bnIntValue() {\n      if(this.s < 0) {\n        if(this.t == 1) return this[0]-this.DV;\n        else if(this.t == 0) return -1;\n      }\n      else if(this.t == 1) return this[0];\n      else if(this.t == 0) return 0;\n      // assumes 16 < DB < 32\n      return ((this[1]&((1<<(32-this.DB))-1))<<this.DB)|this[0];\n    }\n\n    // (public) return value as byte\n    function bnByteValue() { return (this.t==0)?this.s:(this[0]<<24)>>24; }\n\n    // (public) return value as short (assumes DB>=16)\n    function bnShortValue() { return (this.t==0)?this.s:(this[0]<<16)>>16; }\n\n    // (protected) return x s.t. r^x < DV\n    function bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }\n\n    // (public) 0 if this == 0, 1 if this > 0\n    function bnSigNum() {\n      if(this.s < 0) return -1;\n      else if(this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;\n      else return 1;\n    }\n\n    // (protected) convert to radix string\n    function bnpToRadix(b) {\n      if(b == null) b = 10;\n      if(this.signum() == 0 || b < 2 || b > 36) return \"0\";\n      var cs = this.chunkSize(b);\n      var a = Math.pow(b,cs);\n      var d = nbv(a), y = nbi(), z = nbi(), r = \"\";\n      this.divRemTo(d,y,z);\n      while(y.signum() > 0) {\n        r = (a+z.intValue()).toString(b).substr(1) + r;\n        y.divRemTo(d,y,z);\n      }\n      return z.intValue().toString(b) + r;\n    }\n\n    // (protected) convert from radix string\n    function bnpFromRadix(s,b) {\n      this.fromInt(0);\n      if(b == null) b = 10;\n      var cs = this.chunkSize(b);\n      var d = Math.pow(b,cs), mi = false, j = 0, w = 0;\n      for(var i = 0; i < s.length; ++i) {\n        var x = intAt(s,i);\n        if(x < 0) {\n          if(s.charAt(i) == \"-\" && this.signum() == 0) mi = true;\n          continue;\n        }\n        w = b*w+x;\n        if(++j >= cs) {\n          this.dMultiply(d);\n          this.dAddOffset(w,0);\n          j = 0;\n          w = 0;\n        }\n      }\n      if(j > 0) {\n        this.dMultiply(Math.pow(b,j));\n        this.dAddOffset(w,0);\n      }\n      if(mi) BigInteger.ZERO.subTo(this,this);\n    }\n\n    // (protected) alternate constructor\n    function bnpFromNumber(a,b,c) {\n      if(\"number\" == typeof b) {\n        // new BigInteger(int,int,RNG)\n        if(a < 2) this.fromInt(1);\n        else {\n          this.fromNumber(a,c);\n          if(!this.testBit(a-1))    // force MSB set\n            this.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,this);\n          if(this.isEven()) this.dAddOffset(1,0); // force odd\n          while(!this.isProbablePrime(b)) {\n            this.dAddOffset(2,0);\n            if(this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a-1),this);\n          }\n        }\n      }\n      else {\n        // new BigInteger(int,RNG)\n        var x = new Array(), t = a&7;\n        x.length = (a>>3)+1;\n        b.nextBytes(x);\n        if(t > 0) x[0] &= ((1<<t)-1); else x[0] = 0;\n        this.fromString(x,256);\n      }\n    }\n\n    // (public) convert to bigendian byte array\n    function bnToByteArray() {\n      var i = this.t, r = new Array();\n      r[0] = this.s;\n      var p = this.DB-(i*this.DB)%8, d, k = 0;\n      if(i-- > 0) {\n        if(p < this.DB && (d = this[i]>>p) != (this.s&this.DM)>>p)\n          r[k++] = d|(this.s<<(this.DB-p));\n        while(i >= 0) {\n          if(p < 8) {\n            d = (this[i]&((1<<p)-1))<<(8-p);\n            d |= this[--i]>>(p+=this.DB-8);\n          }\n          else {\n            d = (this[i]>>(p-=8))&0xff;\n            if(p <= 0) { p += this.DB; --i; }\n          }\n          if((d&0x80) != 0) d |= -256;\n          if(k == 0 && (this.s&0x80) != (d&0x80)) ++k;\n          if(k > 0 || d != this.s) r[k++] = d;\n        }\n      }\n      return r;\n    }\n\n    function bnEquals(a) { return(this.compareTo(a)==0); }\n    function bnMin(a) { return(this.compareTo(a)<0)?this:a; }\n    function bnMax(a) { return(this.compareTo(a)>0)?this:a; }\n\n    // (protected) r = this op a (bitwise)\n    function bnpBitwiseTo(a,op,r) {\n      var i, f, m = Math.min(a.t,this.t);\n      for(i = 0; i < m; ++i) r[i] = op(this[i],a[i]);\n      if(a.t < this.t) {\n        f = a.s&this.DM;\n        for(i = m; i < this.t; ++i) r[i] = op(this[i],f);\n        r.t = this.t;\n      }\n      else {\n        f = this.s&this.DM;\n        for(i = m; i < a.t; ++i) r[i] = op(f,a[i]);\n        r.t = a.t;\n      }\n      r.s = op(this.s,a.s);\n      r.clamp();\n    }\n\n    // (public) this & a\n    function op_and(x,y) { return x&y; }\n    function bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }\n\n    // (public) this | a\n    function op_or(x,y) { return x|y; }\n    function bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }\n\n    // (public) this ^ a\n    function op_xor(x,y) { return x^y; }\n    function bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }\n\n    // (public) this & ~a\n    function op_andnot(x,y) { return x&~y; }\n    function bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }\n\n    // (public) ~this\n    function bnNot() {\n      var r = nbi();\n      for(var i = 0; i < this.t; ++i) r[i] = this.DM&~this[i];\n      r.t = this.t;\n      r.s = ~this.s;\n      return r;\n    }\n\n    // (public) this << n\n    function bnShiftLeft(n) {\n      var r = nbi();\n      if(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);\n      return r;\n    }\n\n    // (public) this >> n\n    function bnShiftRight(n) {\n      var r = nbi();\n      if(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r);\n      return r;\n    }\n\n    // return index of lowest 1-bit in x, x < 2^31\n    function lbit(x) {\n      if(x == 0) return -1;\n      var r = 0;\n      if((x&0xffff) == 0) { x >>= 16; r += 16; }\n      if((x&0xff) == 0) { x >>= 8; r += 8; }\n      if((x&0xf) == 0) { x >>= 4; r += 4; }\n      if((x&3) == 0) { x >>= 2; r += 2; }\n      if((x&1) == 0) ++r;\n      return r;\n    }\n\n    // (public) returns index of lowest 1-bit (or -1 if none)\n    function bnGetLowestSetBit() {\n      for(var i = 0; i < this.t; ++i)\n        if(this[i] != 0) return i*this.DB+lbit(this[i]);\n      if(this.s < 0) return this.t*this.DB;\n      return -1;\n    }\n\n    // return number of 1 bits in x\n    function cbit(x) {\n      var r = 0;\n      while(x != 0) { x &= x-1; ++r; }\n      return r;\n    }\n\n    // (public) return number of set bits\n    function bnBitCount() {\n      var r = 0, x = this.s&this.DM;\n      for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);\n      return r;\n    }\n\n    // (public) true iff nth bit is set\n    function bnTestBit(n) {\n      var j = Math.floor(n/this.DB);\n      if(j >= this.t) return(this.s!=0);\n      return((this[j]&(1<<(n%this.DB)))!=0);\n    }\n\n    // (protected) this op (1<<n)\n    function bnpChangeBit(n,op) {\n      var r = BigInteger.ONE.shiftLeft(n);\n      this.bitwiseTo(r,op,r);\n      return r;\n    }\n\n    // (public) this | (1<<n)\n    function bnSetBit(n) { return this.changeBit(n,op_or); }\n\n    // (public) this & ~(1<<n)\n    function bnClearBit(n) { return this.changeBit(n,op_andnot); }\n\n    // (public) this ^ (1<<n)\n    function bnFlipBit(n) { return this.changeBit(n,op_xor); }\n\n    // (protected) r = this + a\n    function bnpAddTo(a,r) {\n      var i = 0, c = 0, m = Math.min(a.t,this.t);\n      while(i < m) {\n        c += this[i]+a[i];\n        r[i++] = c&this.DM;\n        c >>= this.DB;\n      }\n      if(a.t < this.t) {\n        c += a.s;\n        while(i < this.t) {\n          c += this[i];\n          r[i++] = c&this.DM;\n          c >>= this.DB;\n        }\n        c += this.s;\n      }\n      else {\n        c += this.s;\n        while(i < a.t) {\n          c += a[i];\n          r[i++] = c&this.DM;\n          c >>= this.DB;\n        }\n        c += a.s;\n      }\n      r.s = (c<0)?-1:0;\n      if(c > 0) r[i++] = c;\n      else if(c < -1) r[i++] = this.DV+c;\n      r.t = i;\n      r.clamp();\n    }\n\n    // (public) this + a\n    function bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }\n\n    // (public) this - a\n    function bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }\n\n    // (public) this * a\n    function bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }\n\n    // (public) this^2\n    function bnSquare() { var r = nbi(); this.squareTo(r); return r; }\n\n    // (public) this / a\n    function bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }\n\n    // (public) this % a\n    function bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }\n\n    // (public) [this/a,this%a]\n    function bnDivideAndRemainder(a) {\n      var q = nbi(), r = nbi();\n      this.divRemTo(a,q,r);\n      return new Array(q,r);\n    }\n\n    // (protected) this *= n, this >= 0, 1 < n < DV\n    function bnpDMultiply(n) {\n      this[this.t] = this.am(0,n-1,this,0,0,this.t);\n      ++this.t;\n      this.clamp();\n    }\n\n    // (protected) this += n << w words, this >= 0\n    function bnpDAddOffset(n,w) {\n      if(n == 0) return;\n      while(this.t <= w) this[this.t++] = 0;\n      this[w] += n;\n      while(this[w] >= this.DV) {\n        this[w] -= this.DV;\n        if(++w >= this.t) this[this.t++] = 0;\n        ++this[w];\n      }\n    }\n\n    // A \"null\" reducer\n    function NullExp() {}\n    function nNop(x) { return x; }\n    function nMulTo(x,y,r) { x.multiplyTo(y,r); }\n    function nSqrTo(x,r) { x.squareTo(r); }\n\n    NullExp.prototype.convert = nNop;\n    NullExp.prototype.revert = nNop;\n    NullExp.prototype.mulTo = nMulTo;\n    NullExp.prototype.sqrTo = nSqrTo;\n\n    // (public) this^e\n    function bnPow(e) { return this.exp(e,new NullExp()); }\n\n    // (protected) r = lower n words of \"this * a\", a.t <= n\n    // \"this\" should be the larger one if appropriate.\n    function bnpMultiplyLowerTo(a,n,r) {\n      var i = Math.min(this.t+a.t,n);\n      r.s = 0; // assumes a,this >= 0\n      r.t = i;\n      while(i > 0) r[--i] = 0;\n      var j;\n      for(j = r.t-this.t; i < j; ++i) r[i+this.t] = this.am(0,a[i],r,i,0,this.t);\n      for(j = Math.min(a.t,n); i < j; ++i) this.am(0,a[i],r,i,0,n-i);\n      r.clamp();\n    }\n\n    // (protected) r = \"this * a\" without lower n words, n > 0\n    // \"this\" should be the larger one if appropriate.\n    function bnpMultiplyUpperTo(a,n,r) {\n      --n;\n      var i = r.t = this.t+a.t-n;\n      r.s = 0; // assumes a,this >= 0\n      while(--i >= 0) r[i] = 0;\n      for(i = Math.max(n-this.t,0); i < a.t; ++i)\n        r[this.t+i-n] = this.am(n-i,a[i],r,0,0,this.t+i-n);\n      r.clamp();\n      r.drShiftTo(1,r);\n    }\n\n    // Barrett modular reduction\n    function Barrett(m) {\n      // setup Barrett\n      this.r2 = nbi();\n      this.q3 = nbi();\n      BigInteger.ONE.dlShiftTo(2*m.t,this.r2);\n      this.mu = this.r2.divide(m);\n      this.m = m;\n    }\n\n    function barrettConvert(x) {\n      if(x.s < 0 || x.t > 2*this.m.t) return x.mod(this.m);\n      else if(x.compareTo(this.m) < 0) return x;\n      else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }\n    }\n\n    function barrettRevert(x) { return x; }\n\n    // x = x mod m (HAC 14.42)\n    function barrettReduce(x) {\n      x.drShiftTo(this.m.t-1,this.r2);\n      if(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); }\n      this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3);\n      this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);\n      while(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1);\n      x.subTo(this.r2,x);\n      while(x.compareTo(this.m) >= 0) x.subTo(this.m,x);\n    }\n\n    // r = x^2 mod m; x != r\n    function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(r); }\n\n    // r = x*y mod m; x,y != r\n    function barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }\n\n    Barrett.prototype.convert = barrettConvert;\n    Barrett.prototype.revert = barrettRevert;\n    Barrett.prototype.reduce = barrettReduce;\n    Barrett.prototype.mulTo = barrettMulTo;\n    Barrett.prototype.sqrTo = barrettSqrTo;\n\n    // (public) this^e % m (HAC 14.85)\n    function bnModPow(e,m) {\n      var i = e.bitLength(), k, r = nbv(1), z;\n      if(i <= 0) return r;\n      else if(i < 18) k = 1;\n      else if(i < 48) k = 3;\n      else if(i < 144) k = 4;\n      else if(i < 768) k = 5;\n      else k = 6;\n      if(i < 8)\n        z = new Classic(m);\n      else if(m.isEven())\n        z = new Barrett(m);\n      else\n        z = new Montgomery(m);\n\n      // precomputation\n      var g = new Array(), n = 3, k1 = k-1, km = (1<<k)-1;\n      g[1] = z.convert(this);\n      if(k > 1) {\n        var g2 = nbi();\n        z.sqrTo(g[1],g2);\n        while(n <= km) {\n          g[n] = nbi();\n          z.mulTo(g2,g[n-2],g[n]);\n          n += 2;\n        }\n      }\n\n      var j = e.t-1, w, is1 = true, r2 = nbi(), t;\n      i = nbits(e[j])-1;\n      while(j >= 0) {\n        if(i >= k1) w = (e[j]>>(i-k1))&km;\n        else {\n          w = (e[j]&((1<<(i+1))-1))<<(k1-i);\n          if(j > 0) w |= e[j-1]>>(this.DB+i-k1);\n        }\n\n        n = k;\n        while((w&1) == 0) { w >>= 1; --n; }\n        if((i -= n) < 0) { i += this.DB; --j; }\n        if(is1) {    // ret == 1, don't bother squaring or multiplying it\n          g[w].copyTo(r);\n          is1 = false;\n        }\n        else {\n          while(n > 1) { z.sqrTo(r,r2); z.sqrTo(r2,r); n -= 2; }\n          if(n > 0) z.sqrTo(r,r2); else { t = r; r = r2; r2 = t; }\n          z.mulTo(r2,g[w],r);\n        }\n\n        while(j >= 0 && (e[j]&(1<<i)) == 0) {\n          z.sqrTo(r,r2); t = r; r = r2; r2 = t;\n          if(--i < 0) { i = this.DB-1; --j; }\n        }\n      }\n      return z.revert(r);\n    }\n\n    // (public) gcd(this,a) (HAC 14.54)\n    function bnGCD(a) {\n      var x = (this.s<0)?this.negate():this.clone();\n      var y = (a.s<0)?a.negate():a.clone();\n      if(x.compareTo(y) < 0) { var t = x; x = y; y = t; }\n      var i = x.getLowestSetBit(), g = y.getLowestSetBit();\n      if(g < 0) return x;\n      if(i < g) g = i;\n      if(g > 0) {\n        x.rShiftTo(g,x);\n        y.rShiftTo(g,y);\n      }\n      while(x.signum() > 0) {\n        if((i = x.getLowestSetBit()) > 0) x.rShiftTo(i,x);\n        if((i = y.getLowestSetBit()) > 0) y.rShiftTo(i,y);\n        if(x.compareTo(y) >= 0) {\n          x.subTo(y,x);\n          x.rShiftTo(1,x);\n        }\n        else {\n          y.subTo(x,y);\n          y.rShiftTo(1,y);\n        }\n      }\n      if(g > 0) y.lShiftTo(g,y);\n      return y;\n    }\n\n    // (protected) this % n, n < 2^26\n    function bnpModInt(n) {\n      if(n <= 0) return 0;\n      var d = this.DV%n, r = (this.s<0)?n-1:0;\n      if(this.t > 0)\n        if(d == 0) r = this[0]%n;\n        else for(var i = this.t-1; i >= 0; --i) r = (d*r+this[i])%n;\n      return r;\n    }\n\n    // (public) 1/this % m (HAC 14.61)\n    function bnModInverse(m) {\n      var ac = m.isEven();\n      if((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;\n      var u = m.clone(), v = this.clone();\n      var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);\n      while(u.signum() != 0) {\n        while(u.isEven()) {\n          u.rShiftTo(1,u);\n          if(ac) {\n            if(!a.isEven() || !b.isEven()) { a.addTo(this,a); b.subTo(m,b); }\n            a.rShiftTo(1,a);\n          }\n          else if(!b.isEven()) b.subTo(m,b);\n          b.rShiftTo(1,b);\n        }\n        while(v.isEven()) {\n          v.rShiftTo(1,v);\n          if(ac) {\n            if(!c.isEven() || !d.isEven()) { c.addTo(this,c); d.subTo(m,d); }\n            c.rShiftTo(1,c);\n          }\n          else if(!d.isEven()) d.subTo(m,d);\n          d.rShiftTo(1,d);\n        }\n        if(u.compareTo(v) >= 0) {\n          u.subTo(v,u);\n          if(ac) a.subTo(c,a);\n          b.subTo(d,b);\n        }\n        else {\n          v.subTo(u,v);\n          if(ac) c.subTo(a,c);\n          d.subTo(b,d);\n        }\n      }\n      if(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;\n      if(d.compareTo(m) >= 0) return d.subtract(m);\n      if(d.signum() < 0) d.addTo(m,d); else return d;\n      if(d.signum() < 0) return d.add(m); else return d;\n    }\n\n    var lowprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997];\n    var lplim = (1<<26)/lowprimes[lowprimes.length-1];\n\n    // (public) test primality with certainty >= 1-.5^t\n    function bnIsProbablePrime(t) {\n      var i, x = this.abs();\n      if(x.t == 1 && x[0] <= lowprimes[lowprimes.length-1]) {\n        for(i = 0; i < lowprimes.length; ++i)\n          if(x[0] == lowprimes[i]) return true;\n        return false;\n      }\n      if(x.isEven()) return false;\n      i = 1;\n      while(i < lowprimes.length) {\n        var m = lowprimes[i], j = i+1;\n        while(j < lowprimes.length && m < lplim) m *= lowprimes[j++];\n        m = x.modInt(m);\n        while(i < j) if(m%lowprimes[i++] == 0) return false;\n      }\n      return x.millerRabin(t);\n    }\n\n    // (protected) true if probably prime (HAC 4.24, Miller-Rabin)\n    function bnpMillerRabin(t) {\n      var n1 = this.subtract(BigInteger.ONE);\n      var k = n1.getLowestSetBit();\n      if(k <= 0) return false;\n      var r = n1.shiftRight(k);\n      t = (t+1)>>1;\n      if(t > lowprimes.length) t = lowprimes.length;\n      var a = nbi();\n      for(var i = 0; i < t; ++i) {\n        //Pick bases at random, instead of starting at 2\n        a.fromInt(lowprimes[Math.floor(Math.random()*lowprimes.length)]);\n        var y = a.modPow(r,this);\n        if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {\n          var j = 1;\n          while(j++ < k && y.compareTo(n1) != 0) {\n            y = y.modPowInt(2,this);\n            if(y.compareTo(BigInteger.ONE) == 0) return false;\n          }\n          if(y.compareTo(n1) != 0) return false;\n        }\n      }\n      return true;\n    }\n\n    // protected\n    BigInteger.prototype.chunkSize = bnpChunkSize;\n    BigInteger.prototype.toRadix = bnpToRadix;\n    BigInteger.prototype.fromRadix = bnpFromRadix;\n    BigInteger.prototype.fromNumber = bnpFromNumber;\n    BigInteger.prototype.bitwiseTo = bnpBitwiseTo;\n    BigInteger.prototype.changeBit = bnpChangeBit;\n    BigInteger.prototype.addTo = bnpAddTo;\n    BigInteger.prototype.dMultiply = bnpDMultiply;\n    BigInteger.prototype.dAddOffset = bnpDAddOffset;\n    BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;\n    BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;\n    BigInteger.prototype.modInt = bnpModInt;\n    BigInteger.prototype.millerRabin = bnpMillerRabin;\n\n    // public\n    BigInteger.prototype.clone = bnClone;\n    BigInteger.prototype.intValue = bnIntValue;\n    BigInteger.prototype.byteValue = bnByteValue;\n    BigInteger.prototype.shortValue = bnShortValue;\n    BigInteger.prototype.signum = bnSigNum;\n    BigInteger.prototype.toByteArray = bnToByteArray;\n    BigInteger.prototype.equals = bnEquals;\n    BigInteger.prototype.min = bnMin;\n    BigInteger.prototype.max = bnMax;\n    BigInteger.prototype.and = bnAnd;\n    BigInteger.prototype.or = bnOr;\n    BigInteger.prototype.xor = bnXor;\n    BigInteger.prototype.andNot = bnAndNot;\n    BigInteger.prototype.not = bnNot;\n    BigInteger.prototype.shiftLeft = bnShiftLeft;\n    BigInteger.prototype.shiftRight = bnShiftRight;\n    BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;\n    BigInteger.prototype.bitCount = bnBitCount;\n    BigInteger.prototype.testBit = bnTestBit;\n    BigInteger.prototype.setBit = bnSetBit;\n    BigInteger.prototype.clearBit = bnClearBit;\n    BigInteger.prototype.flipBit = bnFlipBit;\n    BigInteger.prototype.add = bnAdd;\n    BigInteger.prototype.subtract = bnSubtract;\n    BigInteger.prototype.multiply = bnMultiply;\n    BigInteger.prototype.divide = bnDivide;\n    BigInteger.prototype.remainder = bnRemainder;\n    BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;\n    BigInteger.prototype.modPow = bnModPow;\n    BigInteger.prototype.modInverse = bnModInverse;\n    BigInteger.prototype.pow = bnPow;\n    BigInteger.prototype.gcd = bnGCD;\n    BigInteger.prototype.isProbablePrime = bnIsProbablePrime;\n\n    // JSBN-specific extension\n    BigInteger.prototype.square = bnSquare;\n\n    // Expose the Barrett function\n    BigInteger.prototype.Barrett = Barrett\n\n    // BigInteger interfaces not implemented in jsbn:\n\n    // BigInteger(int signum, byte[] magnitude)\n    // double doubleValue()\n    // float floatValue()\n    // int hashCode()\n    // long longValue()\n    // static BigInteger valueOf(long val)\n\n    // Random number generator - requires a PRNG backend, e.g. prng4.js\n\n    // For best results, put code like\n    // <body onClick='rng_seed_time();' onKeyPress='rng_seed_time();'>\n    // in your main HTML document.\n\n    var rng_state;\n    var rng_pool;\n    var rng_pptr;\n\n    // Mix in a 32-bit integer into the pool\n    function rng_seed_int(x) {\n      rng_pool[rng_pptr++] ^= x & 255;\n      rng_pool[rng_pptr++] ^= (x >> 8) & 255;\n      rng_pool[rng_pptr++] ^= (x >> 16) & 255;\n      rng_pool[rng_pptr++] ^= (x >> 24) & 255;\n      if(rng_pptr >= rng_psize) rng_pptr -= rng_psize;\n    }\n\n    // Mix in the current time (w/milliseconds) into the pool\n    function rng_seed_time() {\n      rng_seed_int(new Date().getTime());\n    }\n\n    // Initialize the pool with junk if needed.\n    if(rng_pool == null) {\n      rng_pool = new Array();\n      rng_pptr = 0;\n      var t;\n      if(typeof window !== \"undefined\" && window.crypto) {\n        if (window.crypto.getRandomValues) {\n          // Use webcrypto if available\n          var ua = new Uint8Array(32);\n          window.crypto.getRandomValues(ua);\n          for(t = 0; t < 32; ++t)\n            rng_pool[rng_pptr++] = ua[t];\n        }\n        else if(navigator.appName == \"Netscape\" && navigator.appVersion < \"5\") {\n          // Extract entropy (256 bits) from NS4 RNG if available\n          var z = window.crypto.random(32);\n          for(t = 0; t < z.length; ++t)\n            rng_pool[rng_pptr++] = z.charCodeAt(t) & 255;\n        }\n      }\n      while(rng_pptr < rng_psize) {  // extract some randomness from Math.random()\n        t = Math.floor(65536 * Math.random());\n        rng_pool[rng_pptr++] = t >>> 8;\n        rng_pool[rng_pptr++] = t & 255;\n      }\n      rng_pptr = 0;\n      rng_seed_time();\n      //rng_seed_int(window.screenX);\n      //rng_seed_int(window.screenY);\n    }\n\n    function rng_get_byte() {\n      if(rng_state == null) {\n        rng_seed_time();\n        rng_state = prng_newstate();\n        rng_state.init(rng_pool);\n        for(rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr)\n          rng_pool[rng_pptr] = 0;\n        rng_pptr = 0;\n        //rng_pool = null;\n      }\n      // TODO: allow reseeding after first request\n      return rng_state.next();\n    }\n\n    function rng_get_bytes(ba) {\n      var i;\n      for(i = 0; i < ba.length; ++i) ba[i] = rng_get_byte();\n    }\n\n    function SecureRandom() {}\n\n    SecureRandom.prototype.nextBytes = rng_get_bytes;\n\n    // prng4.js - uses Arcfour as a PRNG\n\n    function Arcfour() {\n      this.i = 0;\n      this.j = 0;\n      this.S = new Array();\n    }\n\n    // Initialize arcfour context from key, an array of ints, each from [0..255]\n    function ARC4init(key) {\n      var i, j, t;\n      for(i = 0; i < 256; ++i)\n        this.S[i] = i;\n      j = 0;\n      for(i = 0; i < 256; ++i) {\n        j = (j + this.S[i] + key[i % key.length]) & 255;\n        t = this.S[i];\n        this.S[i] = this.S[j];\n        this.S[j] = t;\n      }\n      this.i = 0;\n      this.j = 0;\n    }\n\n    function ARC4next() {\n      var t;\n      this.i = (this.i + 1) & 255;\n      this.j = (this.j + this.S[this.i]) & 255;\n      t = this.S[this.i];\n      this.S[this.i] = this.S[this.j];\n      this.S[this.j] = t;\n      return this.S[(t + this.S[this.i]) & 255];\n    }\n\n    Arcfour.prototype.init = ARC4init;\n    Arcfour.prototype.next = ARC4next;\n\n    // Plug in your RNG constructor here\n    function prng_newstate() {\n      return new Arcfour();\n    }\n\n    // Pool size must be a multiple of 4 and greater than 32.\n    // An array of bytes the size of the pool will be passed to init()\n    var rng_psize = 256;\n\n    if (typeof exports !== 'undefined') {\n        exports = module.exports = {\n            default: BigInteger,\n            BigInteger: BigInteger,\n            SecureRandom: SecureRandom,\n        };\n    } else {\n        this.jsbn = {\n          BigInteger: BigInteger,\n          SecureRandom: SecureRandom\n        };\n    }\n\n}).call(this);\n","/* global window, exports, define */\n\n!function() {\n    'use strict'\n\n    var re = {\n        not_string: /[^s]/,\n        not_bool: /[^t]/,\n        not_type: /[^T]/,\n        not_primitive: /[^v]/,\n        number: /[diefg]/,\n        numeric_arg: /[bcdiefguxX]/,\n        json: /[j]/,\n        not_json: /[^j]/,\n        text: /^[^\\x25]+/,\n        modulo: /^\\x25{2}/,\n        placeholder: /^\\x25(?:([1-9]\\d*)\\$|\\(([^)]+)\\))?(\\+)?(0|'[^$])?(-)?(\\d+)?(?:\\.(\\d+))?([b-gijostTuvxX])/,\n        key: /^([a-z_][a-z_\\d]*)/i,\n        key_access: /^\\.([a-z_][a-z_\\d]*)/i,\n        index_access: /^\\[(\\d+)\\]/,\n        sign: /^[+-]/\n    }\n\n    function sprintf(key) {\n        // `arguments` is not an array, but should be fine for this call\n        return sprintf_format(sprintf_parse(key), arguments)\n    }\n\n    function vsprintf(fmt, argv) {\n        return sprintf.apply(null, [fmt].concat(argv || []))\n    }\n\n    function sprintf_format(parse_tree, argv) {\n        var cursor = 1, tree_length = parse_tree.length, arg, output = '', i, k, ph, pad, pad_character, pad_length, is_positive, sign\n        for (i = 0; i < tree_length; i++) {\n            if (typeof parse_tree[i] === 'string') {\n                output += parse_tree[i]\n            }\n            else if (typeof parse_tree[i] === 'object') {\n                ph = parse_tree[i] // convenience purposes only\n                if (ph.keys) { // keyword argument\n                    arg = argv[cursor]\n                    for (k = 0; k < ph.keys.length; k++) {\n                        if (arg == undefined) {\n                            throw new Error(sprintf('[sprintf] Cannot access property \"%s\" of undefined value \"%s\"', ph.keys[k], ph.keys[k-1]))\n                        }\n                        arg = arg[ph.keys[k]]\n                    }\n                }\n                else if (ph.param_no) { // positional argument (explicit)\n                    arg = argv[ph.param_no]\n                }\n                else { // positional argument (implicit)\n                    arg = argv[cursor++]\n                }\n\n                if (re.not_type.test(ph.type) && re.not_primitive.test(ph.type) && arg instanceof Function) {\n                    arg = arg()\n                }\n\n                if (re.numeric_arg.test(ph.type) && (typeof arg !== 'number' && isNaN(arg))) {\n                    throw new TypeError(sprintf('[sprintf] expecting number but found %T', arg))\n                }\n\n                if (re.number.test(ph.type)) {\n                    is_positive = arg >= 0\n                }\n\n                switch (ph.type) {\n                    case 'b':\n                        arg = parseInt(arg, 10).toString(2)\n                        break\n                    case 'c':\n                        arg = String.fromCharCode(parseInt(arg, 10))\n                        break\n                    case 'd':\n                    case 'i':\n                        arg = parseInt(arg, 10)\n                        break\n                    case 'j':\n                        arg = JSON.stringify(arg, null, ph.width ? parseInt(ph.width) : 0)\n                        break\n                    case 'e':\n                        arg = ph.precision ? parseFloat(arg).toExponential(ph.precision) : parseFloat(arg).toExponential()\n                        break\n                    case 'f':\n                        arg = ph.precision ? parseFloat(arg).toFixed(ph.precision) : parseFloat(arg)\n                        break\n                    case 'g':\n                        arg = ph.precision ? String(Number(arg.toPrecision(ph.precision))) : parseFloat(arg)\n                        break\n                    case 'o':\n                        arg = (parseInt(arg, 10) >>> 0).toString(8)\n                        break\n                    case 's':\n                        arg = String(arg)\n                        arg = (ph.precision ? arg.substring(0, ph.precision) : arg)\n                        break\n                    case 't':\n                        arg = String(!!arg)\n                        arg = (ph.precision ? arg.substring(0, ph.precision) : arg)\n                        break\n                    case 'T':\n                        arg = Object.prototype.toString.call(arg).slice(8, -1).toLowerCase()\n                        arg = (ph.precision ? arg.substring(0, ph.precision) : arg)\n                        break\n                    case 'u':\n                        arg = parseInt(arg, 10) >>> 0\n                        break\n                    case 'v':\n                        arg = arg.valueOf()\n                        arg = (ph.precision ? arg.substring(0, ph.precision) : arg)\n                        break\n                    case 'x':\n                        arg = (parseInt(arg, 10) >>> 0).toString(16)\n                        break\n                    case 'X':\n                        arg = (parseInt(arg, 10) >>> 0).toString(16).toUpperCase()\n                        break\n                }\n                if (re.json.test(ph.type)) {\n                    output += arg\n                }\n                else {\n                    if (re.number.test(ph.type) && (!is_positive || ph.sign)) {\n                        sign = is_positive ? '+' : '-'\n                        arg = arg.toString().replace(re.sign, '')\n                    }\n                    else {\n                        sign = ''\n                    }\n                    pad_character = ph.pad_char ? ph.pad_char === '0' ? '0' : ph.pad_char.charAt(1) : ' '\n                    pad_length = ph.width - (sign + arg).length\n                    pad = ph.width ? (pad_length > 0 ? pad_character.repeat(pad_length) : '') : ''\n                    output += ph.align ? sign + arg + pad : (pad_character === '0' ? sign + pad + arg : pad + sign + arg)\n                }\n            }\n        }\n        return output\n    }\n\n    var sprintf_cache = Object.create(null)\n\n    function sprintf_parse(fmt) {\n        if (sprintf_cache[fmt]) {\n            return sprintf_cache[fmt]\n        }\n\n        var _fmt = fmt, match, parse_tree = [], arg_names = 0\n        while (_fmt) {\n            if ((match = re.text.exec(_fmt)) !== null) {\n                parse_tree.push(match[0])\n            }\n            else if ((match = re.modulo.exec(_fmt)) !== null) {\n                parse_tree.push('%')\n            }\n            else if ((match = re.placeholder.exec(_fmt)) !== null) {\n                if (match[2]) {\n                    arg_names |= 1\n                    var field_list = [], replacement_field = match[2], field_match = []\n                    if ((field_match = re.key.exec(replacement_field)) !== null) {\n                        field_list.push(field_match[1])\n                        while ((replacement_field = replacement_field.substring(field_match[0].length)) !== '') {\n                            if ((field_match = re.key_access.exec(replacement_field)) !== null) {\n                                field_list.push(field_match[1])\n                            }\n                            else if ((field_match = re.index_access.exec(replacement_field)) !== null) {\n                                field_list.push(field_match[1])\n                            }\n                            else {\n                                throw new SyntaxError('[sprintf] failed to parse named argument key')\n                            }\n                        }\n                    }\n                    else {\n                        throw new SyntaxError('[sprintf] failed to parse named argument key')\n                    }\n                    match[2] = field_list\n                }\n                else {\n                    arg_names |= 2\n                }\n                if (arg_names === 3) {\n                    throw new Error('[sprintf] mixing positional and named placeholders is not (yet) supported')\n                }\n\n                parse_tree.push(\n                    {\n                        placeholder: match[0],\n                        param_no:    match[1],\n                        keys:        match[2],\n                        sign:        match[3],\n                        pad_char:    match[4],\n                        align:       match[5],\n                        width:       match[6],\n                        precision:   match[7],\n                        type:        match[8]\n                    }\n                )\n            }\n            else {\n                throw new SyntaxError('[sprintf] unexpected placeholder')\n            }\n            _fmt = _fmt.substring(match[0].length)\n        }\n        return sprintf_cache[fmt] = parse_tree\n    }\n\n    /**\n     * export to either browser or node.js\n     */\n    /* eslint-disable quote-props */\n    if (typeof exports !== 'undefined') {\n        exports['sprintf'] = sprintf\n        exports['vsprintf'] = vsprintf\n    }\n    if (typeof window !== 'undefined') {\n        window['sprintf'] = sprintf\n        window['vsprintf'] = vsprintf\n\n        if (typeof define === 'function' && define['amd']) {\n            define(function() {\n                return {\n                    'sprintf': sprintf,\n                    'vsprintf': vsprintf\n                }\n            })\n        }\n    }\n    /* eslint-enable quote-props */\n}(); // eslint-disable-line\n","\"use strict\";\n/* eslint-disable prefer-destructuring */\n/* eslint-disable no-param-reassign */\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __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 __spreadArrays = (this && this.__spreadArrays) || function () {\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n            r[k] = a[j];\n    return r;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Address6 = void 0;\nvar common = __importStar(require(\"./common\"));\nvar constants4 = __importStar(require(\"./v4/constants\"));\nvar constants6 = __importStar(require(\"./v6/constants\"));\nvar helpers = __importStar(require(\"./v6/helpers\"));\nvar ipv4_1 = require(\"./ipv4\");\nvar regular_expressions_1 = require(\"./v6/regular-expressions\");\nvar address_error_1 = require(\"./address-error\");\nvar jsbn_1 = require(\"jsbn\");\nvar sprintf_js_1 = require(\"sprintf-js\");\nfunction assert(condition) {\n    if (!condition) {\n        throw new Error('Assertion failed.');\n    }\n}\nfunction addCommas(number) {\n    var r = /(\\d+)(\\d{3})/;\n    while (r.test(number)) {\n        number = number.replace(r, '$1,$2');\n    }\n    return number;\n}\nfunction spanLeadingZeroes4(n) {\n    n = n.replace(/^(0{1,})([1-9]+)$/, '<span class=\"parse-error\">$1</span>$2');\n    n = n.replace(/^(0{1,})(0)$/, '<span class=\"parse-error\">$1</span>$2');\n    return n;\n}\n/*\n * A helper function to compact an array\n */\nfunction compact(address, slice) {\n    var s1 = [];\n    var s2 = [];\n    var i;\n    for (i = 0; i < address.length; i++) {\n        if (i < slice[0]) {\n            s1.push(address[i]);\n        }\n        else if (i > slice[1]) {\n            s2.push(address[i]);\n        }\n    }\n    return s1.concat(['compact']).concat(s2);\n}\nfunction paddedHex(octet) {\n    return sprintf_js_1.sprintf('%04x', parseInt(octet, 16));\n}\nfunction unsignByte(b) {\n    // eslint-disable-next-line no-bitwise\n    return b & 0xff;\n}\n/**\n * Represents an IPv6 address\n * @class Address6\n * @param {string} address - An IPv6 address string\n * @param {number} [groups=8] - How many octets to parse\n * @example\n * var address = new Address6('2001::/32');\n */\nvar Address6 = /** @class */ (function () {\n    function Address6(address, optionalGroups) {\n        this.addressMinusSuffix = '';\n        this.parsedSubnet = '';\n        this.subnet = '/128';\n        this.subnetMask = 128;\n        this.v4 = false;\n        this.zone = '';\n        // #region Attributes\n        /**\n         * Returns true if the given address is in the subnet of the current address\n         * @memberof Address6\n         * @instance\n         * @returns {boolean}\n         */\n        this.isInSubnet = common.isInSubnet;\n        /**\n         * Returns true if the address is correct, false otherwise\n         * @memberof Address6\n         * @instance\n         * @returns {boolean}\n         */\n        this.isCorrect = common.isCorrect(constants6.BITS);\n        if (optionalGroups === undefined) {\n            this.groups = constants6.GROUPS;\n        }\n        else {\n            this.groups = optionalGroups;\n        }\n        this.address = address;\n        var subnet = constants6.RE_SUBNET_STRING.exec(address);\n        if (subnet) {\n            this.parsedSubnet = subnet[0].replace('/', '');\n            this.subnetMask = parseInt(this.parsedSubnet, 10);\n            this.subnet = \"/\" + this.subnetMask;\n            if (Number.isNaN(this.subnetMask) ||\n                this.subnetMask < 0 ||\n                this.subnetMask > constants6.BITS) {\n                throw new address_error_1.AddressError('Invalid subnet mask.');\n            }\n            address = address.replace(constants6.RE_SUBNET_STRING, '');\n        }\n        else if (/\\//.test(address)) {\n            throw new address_error_1.AddressError('Invalid subnet mask.');\n        }\n        var zone = constants6.RE_ZONE_STRING.exec(address);\n        if (zone) {\n            this.zone = zone[0];\n            address = address.replace(constants6.RE_ZONE_STRING, '');\n        }\n        this.addressMinusSuffix = address;\n        this.parsedAddress = this.parse(this.addressMinusSuffix);\n    }\n    Address6.isValid = function (address) {\n        try {\n            // eslint-disable-next-line no-new\n            new Address6(address);\n            return true;\n        }\n        catch (e) {\n            return false;\n        }\n    };\n    /**\n     * Convert a BigInteger to a v6 address object\n     * @memberof Address6\n     * @static\n     * @param {BigInteger} bigInteger - a BigInteger to convert\n     * @returns {Address6}\n     * @example\n     * var bigInteger = new BigInteger('1000000000000');\n     * var address = Address6.fromBigInteger(bigInteger);\n     * address.correctForm(); // '::e8:d4a5:1000'\n     */\n    Address6.fromBigInteger = function (bigInteger) {\n        var hex = bigInteger.toString(16).padStart(32, '0');\n        var groups = [];\n        var i;\n        for (i = 0; i < constants6.GROUPS; i++) {\n            groups.push(hex.slice(i * 4, (i + 1) * 4));\n        }\n        return new Address6(groups.join(':'));\n    };\n    /**\n     * Convert a URL (with optional port number) to an address object\n     * @memberof Address6\n     * @static\n     * @param {string} url - a URL with optional port number\n     * @example\n     * var addressAndPort = Address6.fromURL('http://[ffff::]:8080/foo/');\n     * addressAndPort.address.correctForm(); // 'ffff::'\n     * addressAndPort.port; // 8080\n     */\n    Address6.fromURL = function (url) {\n        var host;\n        var port = null;\n        var result;\n        // If we have brackets parse them and find a port\n        if (url.indexOf('[') !== -1 && url.indexOf(']:') !== -1) {\n            result = constants6.RE_URL_WITH_PORT.exec(url);\n            if (result === null) {\n                return {\n                    error: 'failed to parse address with port',\n                    address: null,\n                    port: null,\n                };\n            }\n            host = result[1];\n            port = result[2];\n            // If there's a URL extract the address\n        }\n        else if (url.indexOf('/') !== -1) {\n            // Remove the protocol prefix\n            url = url.replace(/^[a-z0-9]+:\\/\\//, '');\n            // Parse the address\n            result = constants6.RE_URL.exec(url);\n            if (result === null) {\n                return {\n                    error: 'failed to parse address from URL',\n                    address: null,\n                    port: null,\n                };\n            }\n            host = result[1];\n            // Otherwise just assign the URL to the host and let the library parse it\n        }\n        else {\n            host = url;\n        }\n        // If there's a port convert it to an integer\n        if (port) {\n            port = parseInt(port, 10);\n            // squelch out of range ports\n            if (port < 0 || port > 65536) {\n                port = null;\n            }\n        }\n        else {\n            // Standardize `undefined` to `null`\n            port = null;\n        }\n        return {\n            address: new Address6(host),\n            port: port,\n        };\n    };\n    /**\n     * Create an IPv6-mapped address given an IPv4 address\n     * @memberof Address6\n     * @static\n     * @param {string} address - An IPv4 address string\n     * @returns {Address6}\n     * @example\n     * var address = Address6.fromAddress4('192.168.0.1');\n     * address.correctForm(); // '::ffff:c0a8:1'\n     * address.to4in6(); // '::ffff:192.168.0.1'\n     */\n    Address6.fromAddress4 = function (address) {\n        var address4 = new ipv4_1.Address4(address);\n        var mask6 = constants6.BITS - (constants4.BITS - address4.subnetMask);\n        return new Address6(\"::ffff:\" + address4.correctForm() + \"/\" + mask6);\n    };\n    /**\n     * Return an address from ip6.arpa form\n     * @memberof Address6\n     * @static\n     * @param {string} arpaFormAddress - an 'ip6.arpa' form address\n     * @returns {Adress6}\n     * @example\n     * var address = Address6.fromArpa(e.f.f.f.3.c.2.6.f.f.f.e.6.6.8.e.1.0.6.7.9.4.e.c.0.0.0.0.1.0.0.2.ip6.arpa.)\n     * address.correctForm(); // '2001:0:ce49:7601:e866:efff:62c3:fffe'\n     */\n    Address6.fromArpa = function (arpaFormAddress) {\n        // remove ending \".ip6.arpa.\" or just \".\"\n        var address = arpaFormAddress.replace(/(\\.ip6\\.arpa)?\\.$/, '');\n        var semicolonAmount = 7;\n        // correct ip6.arpa form with ending removed will be 63 characters\n        if (address.length !== 63) {\n            throw new address_error_1.AddressError(\"Invalid 'ip6.arpa' form.\");\n        }\n        var parts = address.split('.').reverse();\n        for (var i = semicolonAmount; i > 0; i--) {\n            var insertIndex = i * 4;\n            parts.splice(insertIndex, 0, ':');\n        }\n        address = parts.join('');\n        return new Address6(address);\n    };\n    /**\n     * Return the Microsoft UNC transcription of the address\n     * @memberof Address6\n     * @instance\n     * @returns {String} the Microsoft UNC transcription of the address\n     */\n    Address6.prototype.microsoftTranscription = function () {\n        return sprintf_js_1.sprintf('%s.ipv6-literal.net', this.correctForm().replace(/:/g, '-'));\n    };\n    /**\n     * Return the first n bits of the address, defaulting to the subnet mask\n     * @memberof Address6\n     * @instance\n     * @param {number} [mask=subnet] - the number of bits to mask\n     * @returns {String} the first n bits of the address as a string\n     */\n    Address6.prototype.mask = function (mask) {\n        if (mask === void 0) { mask = this.subnetMask; }\n        return this.getBitsBase2(0, mask);\n    };\n    /**\n     * Return the number of possible subnets of a given size in the address\n     * @memberof Address6\n     * @instance\n     * @param {number} [size=128] - the subnet size\n     * @returns {String}\n     */\n    // TODO: probably useful to have a numeric version of this too\n    Address6.prototype.possibleSubnets = function (subnetSize) {\n        if (subnetSize === void 0) { subnetSize = 128; }\n        var availableBits = constants6.BITS - this.subnetMask;\n        var subnetBits = Math.abs(subnetSize - constants6.BITS);\n        var subnetPowers = availableBits - subnetBits;\n        if (subnetPowers < 0) {\n            return '0';\n        }\n        return addCommas(new jsbn_1.BigInteger('2', 10).pow(subnetPowers).toString(10));\n    };\n    /**\n     * Helper function getting start address.\n     * @memberof Address6\n     * @instance\n     * @returns {BigInteger}\n     */\n    Address6.prototype._startAddress = function () {\n        return new jsbn_1.BigInteger(this.mask() + '0'.repeat(constants6.BITS - this.subnetMask), 2);\n    };\n    /**\n     * The first address in the range given by this address' subnet\n     * Often referred to as the Network Address.\n     * @memberof Address6\n     * @instance\n     * @returns {Address6}\n     */\n    Address6.prototype.startAddress = function () {\n        return Address6.fromBigInteger(this._startAddress());\n    };\n    /**\n     * The first host address in the range given by this address's subnet ie\n     * the first address after the Network Address\n     * @memberof Address6\n     * @instance\n     * @returns {Address6}\n     */\n    Address6.prototype.startAddressExclusive = function () {\n        var adjust = new jsbn_1.BigInteger('1');\n        return Address6.fromBigInteger(this._startAddress().add(adjust));\n    };\n    /**\n     * Helper function getting end address.\n     * @memberof Address6\n     * @instance\n     * @returns {BigInteger}\n     */\n    Address6.prototype._endAddress = function () {\n        return new jsbn_1.BigInteger(this.mask() + '1'.repeat(constants6.BITS - this.subnetMask), 2);\n    };\n    /**\n     * The last address in the range given by this address' subnet\n     * Often referred to as the Broadcast\n     * @memberof Address6\n     * @instance\n     * @returns {Address6}\n     */\n    Address6.prototype.endAddress = function () {\n        return Address6.fromBigInteger(this._endAddress());\n    };\n    /**\n     * The last host address in the range given by this address's subnet ie\n     * the last address prior to the Broadcast Address\n     * @memberof Address6\n     * @instance\n     * @returns {Address6}\n     */\n    Address6.prototype.endAddressExclusive = function () {\n        var adjust = new jsbn_1.BigInteger('1');\n        return Address6.fromBigInteger(this._endAddress().subtract(adjust));\n    };\n    /**\n     * Return the scope of the address\n     * @memberof Address6\n     * @instance\n     * @returns {String}\n     */\n    Address6.prototype.getScope = function () {\n        var scope = constants6.SCOPES[this.getBits(12, 16).intValue()];\n        if (this.getType() === 'Global unicast' && scope !== 'Link local') {\n            scope = 'Global';\n        }\n        return scope || 'Unknown';\n    };\n    /**\n     * Return the type of the address\n     * @memberof Address6\n     * @instance\n     * @returns {String}\n     */\n    Address6.prototype.getType = function () {\n        for (var _i = 0, _a = Object.keys(constants6.TYPES); _i < _a.length; _i++) {\n            var subnet = _a[_i];\n            if (this.isInSubnet(new Address6(subnet))) {\n                return constants6.TYPES[subnet];\n            }\n        }\n        return 'Global unicast';\n    };\n    /**\n     * Return the bits in the given range as a BigInteger\n     * @memberof Address6\n     * @instance\n     * @returns {BigInteger}\n     */\n    Address6.prototype.getBits = function (start, end) {\n        return new jsbn_1.BigInteger(this.getBitsBase2(start, end), 2);\n    };\n    /**\n     * Return the bits in the given range as a base-2 string\n     * @memberof Address6\n     * @instance\n     * @returns {String}\n     */\n    Address6.prototype.getBitsBase2 = function (start, end) {\n        return this.binaryZeroPad().slice(start, end);\n    };\n    /**\n     * Return the bits in the given range as a base-16 string\n     * @memberof Address6\n     * @instance\n     * @returns {String}\n     */\n    Address6.prototype.getBitsBase16 = function (start, end) {\n        var length = end - start;\n        if (length % 4 !== 0) {\n            throw new Error('Length of bits to retrieve must be divisible by four');\n        }\n        return this.getBits(start, end)\n            .toString(16)\n            .padStart(length / 4, '0');\n    };\n    /**\n     * Return the bits that are set past the subnet mask length\n     * @memberof Address6\n     * @instance\n     * @returns {String}\n     */\n    Address6.prototype.getBitsPastSubnet = function () {\n        return this.getBitsBase2(this.subnetMask, constants6.BITS);\n    };\n    /**\n     * Return the reversed ip6.arpa form of the address\n     * @memberof Address6\n     * @param {Object} options\n     * @param {boolean} options.omitSuffix - omit the \"ip6.arpa\" suffix\n     * @instance\n     * @returns {String}\n     */\n    Address6.prototype.reverseForm = function (options) {\n        if (!options) {\n            options = {};\n        }\n        var characters = Math.floor(this.subnetMask / 4);\n        var reversed = this.canonicalForm()\n            .replace(/:/g, '')\n            .split('')\n            .slice(0, characters)\n            .reverse()\n            .join('.');\n        if (characters > 0) {\n            if (options.omitSuffix) {\n                return reversed;\n            }\n            return sprintf_js_1.sprintf('%s.ip6.arpa.', reversed);\n        }\n        if (options.omitSuffix) {\n            return '';\n        }\n        return 'ip6.arpa.';\n    };\n    /**\n     * Return the correct form of the address\n     * @memberof Address6\n     * @instance\n     * @returns {String}\n     */\n    Address6.prototype.correctForm = function () {\n        var i;\n        var groups = [];\n        var zeroCounter = 0;\n        var zeroes = [];\n        for (i = 0; i < this.parsedAddress.length; i++) {\n            var value = parseInt(this.parsedAddress[i], 16);\n            if (value === 0) {\n                zeroCounter++;\n            }\n            if (value !== 0 && zeroCounter > 0) {\n                if (zeroCounter > 1) {\n                    zeroes.push([i - zeroCounter, i - 1]);\n                }\n                zeroCounter = 0;\n            }\n        }\n        // Do we end with a string of zeroes?\n        if (zeroCounter > 1) {\n            zeroes.push([this.parsedAddress.length - zeroCounter, this.parsedAddress.length - 1]);\n        }\n        var zeroLengths = zeroes.map(function (n) { return n[1] - n[0] + 1; });\n        if (zeroes.length > 0) {\n            var index = zeroLengths.indexOf(Math.max.apply(Math, zeroLengths));\n            groups = compact(this.parsedAddress, zeroes[index]);\n        }\n        else {\n            groups = this.parsedAddress;\n        }\n        for (i = 0; i < groups.length; i++) {\n            if (groups[i] !== 'compact') {\n                groups[i] = parseInt(groups[i], 16).toString(16);\n            }\n        }\n        var correct = groups.join(':');\n        correct = correct.replace(/^compact$/, '::');\n        correct = correct.replace(/^compact|compact$/, ':');\n        correct = correct.replace(/compact/, '');\n        return correct;\n    };\n    /**\n     * Return a zero-padded base-2 string representation of the address\n     * @memberof Address6\n     * @instance\n     * @returns {String}\n     * @example\n     * var address = new Address6('2001:4860:4001:803::1011');\n     * address.binaryZeroPad();\n     * // '0010000000000001010010000110000001000000000000010000100000000011\n     * //  0000000000000000000000000000000000000000000000000001000000010001'\n     */\n    Address6.prototype.binaryZeroPad = function () {\n        return this.bigInteger().toString(2).padStart(constants6.BITS, '0');\n    };\n    // TODO: Improve the semantics of this helper function\n    Address6.prototype.parse4in6 = function (address) {\n        var groups = address.split(':');\n        var lastGroup = groups.slice(-1)[0];\n        var address4 = lastGroup.match(constants4.RE_ADDRESS);\n        if (address4) {\n            this.parsedAddress4 = address4[0];\n            this.address4 = new ipv4_1.Address4(this.parsedAddress4);\n            for (var i = 0; i < this.address4.groups; i++) {\n                if (/^0[0-9]+/.test(this.address4.parsedAddress[i])) {\n                    throw new address_error_1.AddressError(\"IPv4 addresses can't have leading zeroes.\", address.replace(constants4.RE_ADDRESS, this.address4.parsedAddress.map(spanLeadingZeroes4).join('.')));\n                }\n            }\n            this.v4 = true;\n            groups[groups.length - 1] = this.address4.toGroup6();\n            address = groups.join(':');\n        }\n        return address;\n    };\n    // TODO: Make private?\n    Address6.prototype.parse = function (address) {\n        address = this.parse4in6(address);\n        var badCharacters = address.match(constants6.RE_BAD_CHARACTERS);\n        if (badCharacters) {\n            throw new address_error_1.AddressError(sprintf_js_1.sprintf('Bad character%s detected in address: %s', badCharacters.length > 1 ? 's' : '', badCharacters.join('')), address.replace(constants6.RE_BAD_CHARACTERS, '<span class=\"parse-error\">$1</span>'));\n        }\n        var badAddress = address.match(constants6.RE_BAD_ADDRESS);\n        if (badAddress) {\n            throw new address_error_1.AddressError(sprintf_js_1.sprintf('Address failed regex: %s', badAddress.join('')), address.replace(constants6.RE_BAD_ADDRESS, '<span class=\"parse-error\">$1</span>'));\n        }\n        var groups = [];\n        var halves = address.split('::');\n        if (halves.length === 2) {\n            var first = halves[0].split(':');\n            var last = halves[1].split(':');\n            if (first.length === 1 && first[0] === '') {\n                first = [];\n            }\n            if (last.length === 1 && last[0] === '') {\n                last = [];\n            }\n            var remaining = this.groups - (first.length + last.length);\n            if (!remaining) {\n                throw new address_error_1.AddressError('Error parsing groups');\n            }\n            this.elidedGroups = remaining;\n            this.elisionBegin = first.length;\n            this.elisionEnd = first.length + this.elidedGroups;\n            groups = groups.concat(first);\n            for (var i = 0; i < remaining; i++) {\n                groups.push('0');\n            }\n            groups = groups.concat(last);\n        }\n        else if (halves.length === 1) {\n            groups = address.split(':');\n            this.elidedGroups = 0;\n        }\n        else {\n            throw new address_error_1.AddressError('Too many :: groups found');\n        }\n        groups = groups.map(function (group) { return sprintf_js_1.sprintf('%x', parseInt(group, 16)); });\n        if (groups.length !== this.groups) {\n            throw new address_error_1.AddressError('Incorrect number of groups found');\n        }\n        return groups;\n    };\n    /**\n     * Return the canonical form of the address\n     * @memberof Address6\n     * @instance\n     * @returns {String}\n     */\n    Address6.prototype.canonicalForm = function () {\n        return this.parsedAddress.map(paddedHex).join(':');\n    };\n    /**\n     * Return the decimal form of the address\n     * @memberof Address6\n     * @instance\n     * @returns {String}\n     */\n    Address6.prototype.decimal = function () {\n        return this.parsedAddress.map(function (n) { return sprintf_js_1.sprintf('%05d', parseInt(n, 16)); }).join(':');\n    };\n    /**\n     * Return the address as a BigInteger\n     * @memberof Address6\n     * @instance\n     * @returns {BigInteger}\n     */\n    Address6.prototype.bigInteger = function () {\n        return new jsbn_1.BigInteger(this.parsedAddress.map(paddedHex).join(''), 16);\n    };\n    /**\n     * Return the last two groups of this address as an IPv4 address string\n     * @memberof Address6\n     * @instance\n     * @returns {Address4}\n     * @example\n     * var address = new Address6('2001:4860:4001::1825:bf11');\n     * address.to4().correctForm(); // '24.37.191.17'\n     */\n    Address6.prototype.to4 = function () {\n        var binary = this.binaryZeroPad().split('');\n        return ipv4_1.Address4.fromHex(new jsbn_1.BigInteger(binary.slice(96, 128).join(''), 2).toString(16));\n    };\n    /**\n     * Return the v4-in-v6 form of the address\n     * @memberof Address6\n     * @instance\n     * @returns {String}\n     */\n    Address6.prototype.to4in6 = function () {\n        var address4 = this.to4();\n        var address6 = new Address6(this.parsedAddress.slice(0, 6).join(':'), 6);\n        var correct = address6.correctForm();\n        var infix = '';\n        if (!/:$/.test(correct)) {\n            infix = ':';\n        }\n        return correct + infix + address4.address;\n    };\n    /**\n     * Return an object containing the Teredo properties of the address\n     * @memberof Address6\n     * @instance\n     * @returns {Object}\n     */\n    Address6.prototype.inspectTeredo = function () {\n        /*\n        - Bits 0 to 31 are set to the Teredo prefix (normally 2001:0000::/32).\n        - Bits 32 to 63 embed the primary IPv4 address of the Teredo server that\n          is used.\n        - Bits 64 to 79 can be used to define some flags. Currently only the\n          higher order bit is used; it is set to 1 if the Teredo client is\n          located behind a cone NAT, 0 otherwise. For Microsoft's Windows Vista\n          and Windows Server 2008 implementations, more bits are used. In those\n          implementations, the format for these 16 bits is \"CRAAAAUG AAAAAAAA\",\n          where \"C\" remains the \"Cone\" flag. The \"R\" bit is reserved for future\n          use. The \"U\" bit is for the Universal/Local flag (set to 0). The \"G\" bit\n          is Individual/Group flag (set to 0). The A bits are set to a 12-bit\n          randomly generated number chosen by the Teredo client to introduce\n          additional protection for the Teredo node against IPv6-based scanning\n          attacks.\n        - Bits 80 to 95 contains the obfuscated UDP port number. This is the\n          port number that is mapped by the NAT to the Teredo client with all\n          bits inverted.\n        - Bits 96 to 127 contains the obfuscated IPv4 address. This is the\n          public IPv4 address of the NAT with all bits inverted.\n        */\n        var prefix = this.getBitsBase16(0, 32);\n        var udpPort = this.getBits(80, 96).xor(new jsbn_1.BigInteger('ffff', 16)).toString();\n        var server4 = ipv4_1.Address4.fromHex(this.getBitsBase16(32, 64));\n        var client4 = ipv4_1.Address4.fromHex(this.getBits(96, 128).xor(new jsbn_1.BigInteger('ffffffff', 16)).toString(16));\n        var flags = this.getBits(64, 80);\n        var flagsBase2 = this.getBitsBase2(64, 80);\n        var coneNat = flags.testBit(15);\n        var reserved = flags.testBit(14);\n        var groupIndividual = flags.testBit(8);\n        var universalLocal = flags.testBit(9);\n        var nonce = new jsbn_1.BigInteger(flagsBase2.slice(2, 6) + flagsBase2.slice(8, 16), 2).toString(10);\n        return {\n            prefix: sprintf_js_1.sprintf('%s:%s', prefix.slice(0, 4), prefix.slice(4, 8)),\n            server4: server4.address,\n            client4: client4.address,\n            flags: flagsBase2,\n            coneNat: coneNat,\n            microsoft: {\n                reserved: reserved,\n                universalLocal: universalLocal,\n                groupIndividual: groupIndividual,\n                nonce: nonce,\n            },\n            udpPort: udpPort,\n        };\n    };\n    /**\n     * Return an object containing the 6to4 properties of the address\n     * @memberof Address6\n     * @instance\n     * @returns {Object}\n     */\n    Address6.prototype.inspect6to4 = function () {\n        /*\n        - Bits 0 to 15 are set to the 6to4 prefix (2002::/16).\n        - Bits 16 to 48 embed the IPv4 address of the 6to4 gateway that is used.\n        */\n        var prefix = this.getBitsBase16(0, 16);\n        var gateway = ipv4_1.Address4.fromHex(this.getBitsBase16(16, 48));\n        return {\n            prefix: sprintf_js_1.sprintf('%s', prefix.slice(0, 4)),\n            gateway: gateway.address,\n        };\n    };\n    /**\n     * Return a v6 6to4 address from a v6 v4inv6 address\n     * @memberof Address6\n     * @instance\n     * @returns {Address6}\n     */\n    Address6.prototype.to6to4 = function () {\n        if (!this.is4()) {\n            return null;\n        }\n        var addr6to4 = [\n            '2002',\n            this.getBitsBase16(96, 112),\n            this.getBitsBase16(112, 128),\n            '',\n            '/16',\n        ].join(':');\n        return new Address6(addr6to4);\n    };\n    /**\n     * Return a byte array\n     * @memberof Address6\n     * @instance\n     * @returns {Array}\n     */\n    Address6.prototype.toByteArray = function () {\n        var byteArray = this.bigInteger().toByteArray();\n        // work around issue where `toByteArray` returns a leading 0 element\n        if (byteArray.length === 17 && byteArray[0] === 0) {\n            return byteArray.slice(1);\n        }\n        return byteArray;\n    };\n    /**\n     * Return an unsigned byte array\n     * @memberof Address6\n     * @instance\n     * @returns {Array}\n     */\n    Address6.prototype.toUnsignedByteArray = function () {\n        return this.toByteArray().map(unsignByte);\n    };\n    /**\n     * Convert a byte array to an Address6 object\n     * @memberof Address6\n     * @static\n     * @returns {Address6}\n     */\n    Address6.fromByteArray = function (bytes) {\n        return this.fromUnsignedByteArray(bytes.map(unsignByte));\n    };\n    /**\n     * Convert an unsigned byte array to an Address6 object\n     * @memberof Address6\n     * @static\n     * @returns {Address6}\n     */\n    Address6.fromUnsignedByteArray = function (bytes) {\n        var BYTE_MAX = new jsbn_1.BigInteger('256', 10);\n        var result = new jsbn_1.BigInteger('0', 10);\n        var multiplier = new jsbn_1.BigInteger('1', 10);\n        for (var i = bytes.length - 1; i >= 0; i--) {\n            result = result.add(multiplier.multiply(new jsbn_1.BigInteger(bytes[i].toString(10), 10)));\n            multiplier = multiplier.multiply(BYTE_MAX);\n        }\n        return Address6.fromBigInteger(result);\n    };\n    /**\n     * Returns true if the address is in the canonical form, false otherwise\n     * @memberof Address6\n     * @instance\n     * @returns {boolean}\n     */\n    Address6.prototype.isCanonical = function () {\n        return this.addressMinusSuffix === this.canonicalForm();\n    };\n    /**\n     * Returns true if the address is a link local address, false otherwise\n     * @memberof Address6\n     * @instance\n     * @returns {boolean}\n     */\n    Address6.prototype.isLinkLocal = function () {\n        // Zeroes are required, i.e. we can't check isInSubnet with 'fe80::/10'\n        if (this.getBitsBase2(0, 64) ===\n            '1111111010000000000000000000000000000000000000000000000000000000') {\n            return true;\n        }\n        return false;\n    };\n    /**\n     * Returns true if the address is a multicast address, false otherwise\n     * @memberof Address6\n     * @instance\n     * @returns {boolean}\n     */\n    Address6.prototype.isMulticast = function () {\n        return this.getType() === 'Multicast';\n    };\n    /**\n     * Returns true if the address is a v4-in-v6 address, false otherwise\n     * @memberof Address6\n     * @instance\n     * @returns {boolean}\n     */\n    Address6.prototype.is4 = function () {\n        return this.v4;\n    };\n    /**\n     * Returns true if the address is a Teredo address, false otherwise\n     * @memberof Address6\n     * @instance\n     * @returns {boolean}\n     */\n    Address6.prototype.isTeredo = function () {\n        return this.isInSubnet(new Address6('2001::/32'));\n    };\n    /**\n     * Returns true if the address is a 6to4 address, false otherwise\n     * @memberof Address6\n     * @instance\n     * @returns {boolean}\n     */\n    Address6.prototype.is6to4 = function () {\n        return this.isInSubnet(new Address6('2002::/16'));\n    };\n    /**\n     * Returns true if the address is a loopback address, false otherwise\n     * @memberof Address6\n     * @instance\n     * @returns {boolean}\n     */\n    Address6.prototype.isLoopback = function () {\n        return this.getType() === 'Loopback';\n    };\n    // #endregion\n    // #region HTML\n    /**\n     * @returns {String} the address in link form with a default port of 80\n     */\n    Address6.prototype.href = function (optionalPort) {\n        if (optionalPort === undefined) {\n            optionalPort = '';\n        }\n        else {\n            optionalPort = sprintf_js_1.sprintf(':%s', optionalPort);\n        }\n        return sprintf_js_1.sprintf('http://[%s]%s/', this.correctForm(), optionalPort);\n    };\n    /**\n     * @returns {String} a link suitable for conveying the address via a URL hash\n     */\n    Address6.prototype.link = function (options) {\n        if (!options) {\n            options = {};\n        }\n        if (options.className === undefined) {\n            options.className = '';\n        }\n        if (options.prefix === undefined) {\n            options.prefix = '/#address=';\n        }\n        if (options.v4 === undefined) {\n            options.v4 = false;\n        }\n        var formFunction = this.correctForm;\n        if (options.v4) {\n            formFunction = this.to4in6;\n        }\n        if (options.className) {\n            return sprintf_js_1.sprintf('<a href=\"%1$s%2$s\" class=\"%3$s\">%2$s</a>', options.prefix, formFunction.call(this), options.className);\n        }\n        return sprintf_js_1.sprintf('<a href=\"%1$s%2$s\">%2$s</a>', options.prefix, formFunction.call(this));\n    };\n    /**\n     * Groups an address\n     * @returns {String}\n     */\n    Address6.prototype.group = function () {\n        if (this.elidedGroups === 0) {\n            // The simple case\n            return helpers.simpleGroup(this.address).join(':');\n        }\n        assert(typeof this.elidedGroups === 'number');\n        assert(typeof this.elisionBegin === 'number');\n        // The elided case\n        var output = [];\n        var _a = this.address.split('::'), left = _a[0], right = _a[1];\n        if (left.length) {\n            output.push.apply(output, helpers.simpleGroup(left));\n        }\n        else {\n            output.push('');\n        }\n        var classes = ['hover-group'];\n        for (var i = this.elisionBegin; i < this.elisionBegin + this.elidedGroups; i++) {\n            classes.push(sprintf_js_1.sprintf('group-%d', i));\n        }\n        output.push(sprintf_js_1.sprintf('<span class=\"%s\"></span>', classes.join(' ')));\n        if (right.length) {\n            output.push.apply(output, helpers.simpleGroup(right, this.elisionEnd));\n        }\n        else {\n            output.push('');\n        }\n        if (this.is4()) {\n            assert(this.address4 instanceof ipv4_1.Address4);\n            output.pop();\n            output.push(this.address4.groupForV6());\n        }\n        return output.join(':');\n    };\n    // #endregion\n    // #region Regular expressions\n    /**\n     * Generate a regular expression string that can be used to find or validate\n     * all variations of this address\n     * @memberof Address6\n     * @instance\n     * @param {boolean} substringSearch\n     * @returns {string}\n     */\n    Address6.prototype.regularExpressionString = function (substringSearch) {\n        if (substringSearch === void 0) { substringSearch = false; }\n        var output = [];\n        // TODO: revisit why this is necessary\n        var address6 = new Address6(this.correctForm());\n        if (address6.elidedGroups === 0) {\n            // The simple case\n            output.push(regular_expressions_1.simpleRegularExpression(address6.parsedAddress));\n        }\n        else if (address6.elidedGroups === constants6.GROUPS) {\n            // A completely elided address\n            output.push(regular_expressions_1.possibleElisions(constants6.GROUPS));\n        }\n        else {\n            // A partially elided address\n            var halves = address6.address.split('::');\n            if (halves[0].length) {\n                output.push(regular_expressions_1.simpleRegularExpression(halves[0].split(':')));\n            }\n            assert(typeof address6.elidedGroups === 'number');\n            output.push(regular_expressions_1.possibleElisions(address6.elidedGroups, halves[0].length !== 0, halves[1].length !== 0));\n            if (halves[1].length) {\n                output.push(regular_expressions_1.simpleRegularExpression(halves[1].split(':')));\n            }\n            output = [output.join(':')];\n        }\n        if (!substringSearch) {\n            output = __spreadArrays([\n                '(?=^|',\n                regular_expressions_1.ADDRESS_BOUNDARY,\n                '|[^\\\\w\\\\:])('\n            ], output, [\n                ')(?=[^\\\\w\\\\:]|',\n                regular_expressions_1.ADDRESS_BOUNDARY,\n                '|$)',\n            ]);\n        }\n        return output.join('');\n    };\n    /**\n     * Generate a regular expression that can be used to find or validate all\n     * variations of this address.\n     * @memberof Address6\n     * @instance\n     * @param {boolean} substringSearch\n     * @returns {RegExp}\n     */\n    Address6.prototype.regularExpression = function (substringSearch) {\n        if (substringSearch === void 0) { substringSearch = false; }\n        return new RegExp(this.regularExpressionString(substringSearch), 'i');\n    };\n    return Address6;\n}());\nexports.Address6 = Address6;\n//# sourceMappingURL=ipv6.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.RE_URL_WITH_PORT = exports.RE_URL = exports.RE_ZONE_STRING = exports.RE_SUBNET_STRING = exports.RE_BAD_ADDRESS = exports.RE_BAD_CHARACTERS = exports.TYPES = exports.SCOPES = exports.GROUPS = exports.BITS = void 0;\nexports.BITS = 128;\nexports.GROUPS = 8;\n/**\n * Represents IPv6 address scopes\n * @memberof Address6\n * @static\n */\nexports.SCOPES = {\n    0: 'Reserved',\n    1: 'Interface local',\n    2: 'Link local',\n    4: 'Admin local',\n    5: 'Site local',\n    8: 'Organization local',\n    14: 'Global',\n    15: 'Reserved',\n};\n/**\n * Represents IPv6 address types\n * @memberof Address6\n * @static\n */\nexports.TYPES = {\n    'ff01::1/128': 'Multicast (All nodes on this interface)',\n    'ff01::2/128': 'Multicast (All routers on this interface)',\n    'ff02::1/128': 'Multicast (All nodes on this link)',\n    'ff02::2/128': 'Multicast (All routers on this link)',\n    'ff05::2/128': 'Multicast (All routers in this site)',\n    'ff02::5/128': 'Multicast (OSPFv3 AllSPF routers)',\n    'ff02::6/128': 'Multicast (OSPFv3 AllDR routers)',\n    'ff02::9/128': 'Multicast (RIP routers)',\n    'ff02::a/128': 'Multicast (EIGRP routers)',\n    'ff02::d/128': 'Multicast (PIM routers)',\n    'ff02::16/128': 'Multicast (MLDv2 reports)',\n    'ff01::fb/128': 'Multicast (mDNSv6)',\n    'ff02::fb/128': 'Multicast (mDNSv6)',\n    'ff05::fb/128': 'Multicast (mDNSv6)',\n    'ff02::1:2/128': 'Multicast (All DHCP servers and relay agents on this link)',\n    'ff05::1:2/128': 'Multicast (All DHCP servers and relay agents in this site)',\n    'ff02::1:3/128': 'Multicast (All DHCP servers on this link)',\n    'ff05::1:3/128': 'Multicast (All DHCP servers in this site)',\n    '::/128': 'Unspecified',\n    '::1/128': 'Loopback',\n    'ff00::/8': 'Multicast',\n    'fe80::/10': 'Link-local unicast',\n};\n/**\n * A regular expression that matches bad characters in an IPv6 address\n * @memberof Address6\n * @static\n */\nexports.RE_BAD_CHARACTERS = /([^0-9a-f:/%])/gi;\n/**\n * A regular expression that matches an incorrect IPv6 address\n * @memberof Address6\n * @static\n */\nexports.RE_BAD_ADDRESS = /([0-9a-f]{5,}|:{3,}|[^:]:$|^:[^:]|\\/$)/gi;\n/**\n * A regular expression that matches an IPv6 subnet\n * @memberof Address6\n * @static\n */\nexports.RE_SUBNET_STRING = /\\/\\d{1,3}(?=%|$)/;\n/**\n * A regular expression that matches an IPv6 zone\n * @memberof Address6\n * @static\n */\nexports.RE_ZONE_STRING = /%.*$/;\nexports.RE_URL = new RegExp(/^\\[{0,1}([0-9a-f:]+)\\]{0,1}/);\nexports.RE_URL_WITH_PORT = new RegExp(/\\[([0-9a-f:]+)\\]:([0-9]{1,5})/);\n//# sourceMappingURL=constants.js.map","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.simpleGroup = exports.spanLeadingZeroes = exports.spanAll = exports.spanAllZeroes = void 0;\nvar sprintf_js_1 = require(\"sprintf-js\");\n/**\n * @returns {String} the string with all zeroes contained in a <span>\n */\nfunction spanAllZeroes(s) {\n    return s.replace(/(0+)/g, '<span class=\"zero\">$1</span>');\n}\nexports.spanAllZeroes = spanAllZeroes;\n/**\n * @returns {String} the string with each character contained in a <span>\n */\nfunction spanAll(s, offset) {\n    if (offset === void 0) { offset = 0; }\n    var letters = s.split('');\n    return letters\n        .map(function (n, i) {\n        return sprintf_js_1.sprintf('<span class=\"digit value-%s position-%d\">%s</span>', n, i + offset, spanAllZeroes(n));\n    } // XXX Use #base-2 .value-0 instead?\n    )\n        .join('');\n}\nexports.spanAll = spanAll;\nfunction spanLeadingZeroesSimple(group) {\n    return group.replace(/^(0+)/, '<span class=\"zero\">$1</span>');\n}\n/**\n * @returns {String} the string with leading zeroes contained in a <span>\n */\nfunction spanLeadingZeroes(address) {\n    var groups = address.split(':');\n    return groups.map(function (g) { return spanLeadingZeroesSimple(g); }).join(':');\n}\nexports.spanLeadingZeroes = spanLeadingZeroes;\n/**\n * Groups an address\n * @returns {String} a grouped address\n */\nfunction simpleGroup(addressString, offset) {\n    if (offset === void 0) { offset = 0; }\n    var groups = addressString.split(':');\n    return groups.map(function (g, i) {\n        if (/group-v4/.test(g)) {\n            return g;\n        }\n        return sprintf_js_1.sprintf('<span class=\"hover-group group-%d\">%s</span>', i + offset, spanLeadingZeroesSimple(g));\n    });\n}\nexports.simpleGroup = simpleGroup;\n//# sourceMappingURL=helpers.js.map","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n    if (k2 === undefined) k2 = k;\n    o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n    o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n    if (mod && mod.__esModule) return mod;\n    var result = {};\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n    __setModuleDefault(result, mod);\n    return result;\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.possibleElisions = exports.simpleRegularExpression = exports.ADDRESS_BOUNDARY = exports.padGroup = exports.groupPossibilities = void 0;\nvar v6 = __importStar(require(\"./constants\"));\nvar sprintf_js_1 = require(\"sprintf-js\");\nfunction groupPossibilities(possibilities) {\n    return sprintf_js_1.sprintf('(%s)', possibilities.join('|'));\n}\nexports.groupPossibilities = groupPossibilities;\nfunction padGroup(group) {\n    if (group.length < 4) {\n        return sprintf_js_1.sprintf('0{0,%d}%s', 4 - group.length, group);\n    }\n    return group;\n}\nexports.padGroup = padGroup;\nexports.ADDRESS_BOUNDARY = '[^A-Fa-f0-9:]';\nfunction simpleRegularExpression(groups) {\n    var zeroIndexes = [];\n    groups.forEach(function (group, i) {\n        var groupInteger = parseInt(group, 16);\n        if (groupInteger === 0) {\n            zeroIndexes.push(i);\n        }\n    });\n    // You can technically elide a single 0, this creates the regular expressions\n    // to match that eventuality\n    var possibilities = zeroIndexes.map(function (zeroIndex) {\n        return groups\n            .map(function (group, i) {\n            if (i === zeroIndex) {\n                var elision = i === 0 || i === v6.GROUPS - 1 ? ':' : '';\n                return groupPossibilities([padGroup(group), elision]);\n            }\n            return padGroup(group);\n        })\n            .join(':');\n    });\n    // The simplest case\n    possibilities.push(groups.map(padGroup).join(':'));\n    return groupPossibilities(possibilities);\n}\nexports.simpleRegularExpression = simpleRegularExpression;\nfunction possibleElisions(elidedGroups, moreLeft, moreRight) {\n    var left = moreLeft ? '' : ':';\n    var right = moreRight ? '' : ':';\n    var possibilities = [];\n    // 1. elision of everything (::)\n    if (!moreLeft && !moreRight) {\n        possibilities.push('::');\n    }\n    // 2. complete elision of the middle\n    if (moreLeft && moreRight) {\n        possibilities.push('');\n    }\n    if ((moreRight && !moreLeft) || (!moreRight && moreLeft)) {\n        // 3. complete elision of one side\n        possibilities.push(':');\n    }\n    // 4. elision from the left side\n    possibilities.push(sprintf_js_1.sprintf('%s(:0{1,4}){1,%d}', left, elidedGroups - 1));\n    // 5. elision from the right side\n    possibilities.push(sprintf_js_1.sprintf('(0{1,4}:){1,%d}%s', elidedGroups - 1, right));\n    // 6. no elision\n    possibilities.push(sprintf_js_1.sprintf('(0{1,4}:){%d}0{1,4}', elidedGroups - 1));\n    // 7. elision (including sloppy elision) from the middle\n    for (var groups = 1; groups < elidedGroups - 1; groups++) {\n        for (var position = 1; position < elidedGroups - groups; position++) {\n            possibilities.push(sprintf_js_1.sprintf('(0{1,4}:){%d}:(0{1,4}:){%d}0{1,4}', position, elidedGroups - position - groups - 1));\n        }\n    }\n    return groupPossibilities(possibilities);\n}\nexports.possibleElisions = possibleElisions;\n//# sourceMappingURL=regular-expressions.js.map","'use strict';\n\nclass TimeoutError extends Error {\n\tconstructor(message) {\n\t\tsuper(message);\n\t\tthis.name = 'TimeoutError';\n\t}\n}\n\nconst pTimeout = (promise, milliseconds, fallback, options) => {\n\tlet timer;\n\tconst cancelablePromise = new Promise((resolve, reject) => {\n\t\tif (typeof milliseconds !== 'number' || milliseconds < 0) {\n\t\t\tthrow new TypeError('Expected `milliseconds` to be a positive number');\n\t\t}\n\n\t\tif (milliseconds === Infinity) {\n\t\t\tresolve(promise);\n\t\t\treturn;\n\t\t}\n\n\t\toptions = {\n\t\t\tcustomTimers: {setTimeout, clearTimeout},\n\t\t\t...options\n\t\t};\n\n\t\ttimer = options.customTimers.setTimeout.call(undefined, () => {\n\t\t\tif (typeof fallback === 'function') {\n\t\t\t\ttry {\n\t\t\t\t\tresolve(fallback());\n\t\t\t\t} catch (error) {\n\t\t\t\t\treject(error);\n\t\t\t\t}\n\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst message = typeof fallback === 'string' ? fallback : `Promise timed out after ${milliseconds} milliseconds`;\n\t\t\tconst timeoutError = fallback instanceof Error ? fallback : new TimeoutError(message);\n\n\t\t\tif (typeof promise.cancel === 'function') {\n\t\t\t\tpromise.cancel();\n\t\t\t}\n\n\t\t\treject(timeoutError);\n\t\t}, milliseconds);\n\n\t\t(async () => {\n\t\t\ttry {\n\t\t\t\tresolve(await promise);\n\t\t\t} catch (error) {\n\t\t\t\treject(error);\n\t\t\t} finally {\n\t\t\t\toptions.customTimers.clearTimeout.call(undefined, timer);\n\t\t\t}\n\t\t})();\n\t});\n\n\tcancelablePromise.clear = () => {\n\t\tclearTimeout(timer);\n\t\ttimer = undefined;\n\t};\n\n\treturn cancelablePromise;\n};\n\nmodule.exports = pTimeout;\n// TODO: Remove this for the next major release\nmodule.exports.default = pTimeout;\n\nmodule.exports.TimeoutError = TimeoutError;\n","'use strict'\n\nconst mafmt = require('mafmt')\nconst {\n  CODE_CIRCUIT,\n  CODE_P2P,\n  CODE_TCP,\n  CODE_WS,\n  CODE_WSS\n} = require('./constants')\n\nmodule.exports = {\n  all: (multiaddrs) => multiaddrs.filter((ma) => {\n    if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n      return false\n    }\n\n    const testMa = ma.decapsulateCode(CODE_P2P)\n\n    return mafmt.WebSockets.matches(testMa) ||\n      mafmt.WebSocketsSecure.matches(testMa)\n  }),\n  dnsWss: (multiaddrs) => multiaddrs.filter((ma) => {\n    if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n      return false\n    }\n\n    const testMa = ma.decapsulateCode(CODE_P2P)\n\n    return mafmt.WebSocketsSecure.matches(testMa) &&\n      mafmt.DNS.matches(testMa.decapsulateCode(CODE_TCP).decapsulateCode(CODE_WSS))\n  }),\n  dnsWsOrWss: (multiaddrs) => multiaddrs.filter((ma) => {\n    if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n      return false\n    }\n\n    const testMa = ma.decapsulateCode(CODE_P2P)\n\n    // WS\n    if (mafmt.WebSockets.matches(testMa)) {\n      return mafmt.DNS.matches(testMa.decapsulateCode(CODE_TCP).decapsulateCode(CODE_WS))\n    }\n\n    // WSS\n    return mafmt.WebSocketsSecure.matches(testMa) &&\n      mafmt.DNS.matches(testMa.decapsulateCode(CODE_TCP).decapsulateCode(CODE_WSS))\n  })\n}\n","'use strict'\n\nconst debug = require('debug')\nconst log = debug('libp2p:webrtc-star')\nlog.error = debug('libp2p:webrtc-star:error')\n\nconst { EventEmitter } = require('events')\nconst errcode = require('err-code')\nconst withIs = require('class-is')\n\nconst { AbortError } = require('abortable-iterator')\nconst SimplePeer = require('libp2p-webrtc-peer')\nconst { supportsWebRTCDataChannels: webrtcSupport } = require('ipfs-utils/src/supports')\n\nconst { Multiaddr } = require('multiaddr')\nconst mafmt = require('mafmt')\nconst PeerId = require('peer-id')\n\nconst { CODE_CIRCUIT } = require('./constants')\nconst createListener = require('./listener')\nconst toConnection = require('./socket-to-conn')\nconst { cleanMultiaddr, cleanUrlSIO } = require('./utils')\n\nfunction noop () { }\n\n/**\n * @class WebRTCStar\n */\nclass WebRTCStar {\n  /**\n   * @class\n   * @param {object} options\n   * @param {Upgrader} options.upgrader\n   */\n  constructor (options = {}) {\n    if (!options.upgrader) {\n      throw new Error('An upgrader must be provided. See https://github.com/libp2p/interface-transport#upgrader.')\n    }\n\n    this._upgrader = options.upgrader\n\n    this.sioOptions = {\n      transports: ['websocket'],\n      'force new connection': true\n    }\n\n    if (options.wrtc) {\n      this.wrtc = options.wrtc\n    }\n\n    // Keep Signalling references\n    this.sigReferences = new Map()\n\n    // Discovery\n    this.discovery = new EventEmitter()\n    this.discovery.tag = 'webRTCStar'\n    this.discovery._isStarted = false\n    this.discovery.start = () => {\n      this.discovery._isStarted = true\n    }\n    this.discovery.stop = () => {\n      this.discovery._isStarted = false\n    }\n    this._peerDiscovered = this._peerDiscovered.bind(this)\n  }\n\n  /**\n   * @async\n   * @param {Multiaddr} ma\n   * @param {object} options\n   * @param {AbortSignal} options.signal - Used to abort dial requests\n   * @returns {Connection} An upgraded Connection\n   */\n  async dial (ma, options = {}) {\n    const rawConn = await this._connect(ma, options)\n    const maConn = toConnection(rawConn, { remoteAddr: ma, signal: options.signal })\n    log('new outbound connection %s', maConn.remoteAddr)\n    const conn = await this._upgrader.upgradeOutbound(maConn)\n    log('outbound connection %s upgraded', maConn.remoteAddr)\n    return conn\n  }\n\n  /**\n   * @private\n   * @param {Multiaddr} ma\n   * @param {object} options\n   * @param {AbortSignal} options.signal - Used to abort dial requests\n   * @returns {Promise<SimplePeer>} Resolves a SimplePeer Webrtc channel\n   */\n  _connect (ma, options = {}) {\n    if (options.signal && options.signal.aborted) {\n      throw new AbortError()\n    }\n\n    const spOptions = {\n      initiator: true,\n      trickle: false,\n      ...options.spOptions || {}\n    }\n\n    // Use custom WebRTC implementation\n    if (this.wrtc) { spOptions.wrtc = this.wrtc }\n\n    const cOpts = ma.toOptions()\n    const intentId = (~~(Math.random() * 1e9)).toString(36) + Date.now()\n\n    return new Promise((resolve, reject) => {\n      const sio = this.sigReferences.get(cleanUrlSIO(ma))\n\n      if (!sio || !sio.listener) {\n        return reject(errcode(new Error('unknown signal server to use'), 'ERR_UNKNOWN_SIGNAL_SERVER'))\n      }\n\n      const sioClient = sio.listener.io\n\n      const start = Date.now()\n      let connected\n\n      log('dialing %s:%s', cOpts.host, cOpts.port)\n      const channel = new SimplePeer(spOptions)\n\n      const onError = (err) => {\n        if (!connected) {\n          const msg = `connection error ${cOpts.host}:${cOpts.port}: ${err.message}`\n          log.error(msg)\n          done(err)\n        }\n      }\n\n      const onTimeout = () => {\n        log('connnection timeout %s:%s', cOpts.host, cOpts.port)\n        const err = errcode(new Error(`connection timeout after ${Date.now() - start}ms`), 'ERR_CONNECT_TIMEOUT')\n        // Note: this will result in onError() being called\n        channel.emit('error', err)\n      }\n\n      const onConnect = () => {\n        connected = true\n\n        log('connection opened %s:%s', cOpts.host, cOpts.port)\n        done(null)\n      }\n\n      const onAbort = () => {\n        log.error('connection aborted %s:%s', cOpts.host, cOpts.port)\n        channel.destroy()\n        done(new AbortError())\n      }\n\n      const done = (err) => {\n        channel.removeListener('timeout', onTimeout)\n        channel.removeListener('connect', onConnect)\n        options.signal && options.signal.removeEventListener('abort', onAbort)\n\n        err ? reject(err) : resolve(channel)\n      }\n\n      channel.on('error', onError)\n      channel.once('timeout', onTimeout)\n      channel.once('connect', onConnect)\n      channel.on('close', () => {\n        channel.removeListener('error', onError)\n      })\n      options.signal && options.signal.addEventListener('abort', onAbort)\n\n      channel.on('signal', (signal) => {\n        sioClient.emit('ss-handshake', {\n          intentId: intentId,\n          srcMultiaddr: sio.signallingAddr.toString(),\n          dstMultiaddr: ma.toString(),\n          signal: signal\n        })\n      })\n\n      // NOTE: aegir segfaults if we do .once on the socket.io event emitter and we\n      // are clueless as to why.\n      sioClient.on('ws-handshake', (offer) => {\n        if (offer.intentId === intentId && offer.err) {\n          reject(errcode(offer.err instanceof Error ? offer.err : new Error(offer.err), 'ERR_SIGNALLING_FAILED'))\n        }\n\n        if (offer.intentId !== intentId || !offer.answer || channel.destroyed) {\n          return\n        }\n\n        channel.signal(offer.signal)\n      })\n    })\n  }\n\n  /**\n   * Creates a WebrtcStar listener. The provided `handler` function will be called\n   * anytime a new incoming Connection has been successfully upgraded via\n   * `upgrader.upgradeInbound`.\n   *\n   * @param {object} [options] - simple-peer options for listener\n   * @param {function (Connection)} handler\n   * @returns {Listener} A WebrtcStar listener\n   */\n  createListener (options = {}, handler) {\n    if (!webrtcSupport && !this.wrtc) {\n      throw errcode(new Error('no WebRTC support'), 'ERR_NO_WEBRTC_SUPPORT')\n    }\n\n    if (typeof options === 'function') {\n      handler = options\n      options = {}\n    }\n\n    handler = handler || noop\n\n    return createListener({ handler, upgrader: this._upgrader }, this, options)\n  }\n\n  /**\n   * Takes a list of `Multiaddr`s and returns only valid TCP addresses\n   *\n   * @param {Multiaddr[]} multiaddrs\n   * @returns {Multiaddr[]} Valid TCP multiaddrs\n   */\n  filter (multiaddrs) {\n    multiaddrs = Array.isArray(multiaddrs) ? multiaddrs : [multiaddrs]\n\n    return multiaddrs.filter((ma) => {\n      if (ma.protoCodes().includes(CODE_CIRCUIT)) {\n        return false\n      }\n\n      return mafmt.WebRTCStar.matches(ma)\n    })\n  }\n\n  _peerDiscovered (maStr) {\n    if (!this.discovery._isStarted) return\n\n    log('Peer Discovered:', maStr)\n    maStr = cleanMultiaddr(maStr)\n\n    const ma = new Multiaddr(maStr)\n    const peerId = PeerId.createFromB58String(ma.getPeerId())\n\n    this.discovery.emit('peer', {\n      id: peerId,\n      multiaddrs: [ma]\n    })\n  }\n}\n\nmodule.exports = withIs(WebRTCStar, { className: 'WebRTCStar', symbolName: '@libp2p/js-libp2p-webrtc-star/webrtcstar' })\n","/*! simple-peer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\nvar debug = require('debug')('simple-peer')\nvar getBrowserRTC = require('get-browser-rtc')\nvar randombytes = require('randombytes')\nvar stream = require('readable-stream')\nvar queueMicrotask = require('queue-microtask') // TODO: remove when Node 10 is not supported\nvar errCode = require('err-code')\n\nvar MAX_BUFFERED_AMOUNT = 64 * 1024\nvar ICECOMPLETE_TIMEOUT = 5 * 1000\nvar CHANNEL_CLOSING_TIMEOUT = 5 * 1000\n\n// HACK: Filter trickle lines when trickle is disabled #354\nfunction filterTrickle (sdp) {\n  return sdp.replace(/a=ice-options:trickle\\s\\n/g, '')\n}\n\nfunction warn (message) {\n  console.warn(message)\n}\n\n/**\n * WebRTC peer connection. Same API as node core `net.Socket`, plus a few extra methods.\n * Duplex stream.\n * @param {Object} opts\n */\nclass Peer extends stream.Duplex {\n  constructor (opts) {\n    opts = Object.assign({\n      allowHalfOpen: false\n    }, opts)\n\n    super(opts)\n\n    this._id = randombytes(4).toString('hex').slice(0, 7)\n    this._debug('new peer %o', opts)\n\n    this.channelName = opts.initiator\n      ? opts.channelName || randombytes(20).toString('hex')\n      : null\n\n    this.initiator = opts.initiator || false\n    this.channelConfig = opts.channelConfig || Peer.channelConfig\n    this.negotiated = this.channelConfig.negotiated\n    this.config = Object.assign({}, Peer.config, opts.config)\n    this.offerOptions = opts.offerOptions || {}\n    this.answerOptions = opts.answerOptions || {}\n    this.sdpTransform = opts.sdpTransform || (sdp => sdp)\n    this.streams = opts.streams || (opts.stream ? [opts.stream] : []) // support old \"stream\" option\n    this.trickle = opts.trickle !== undefined ? opts.trickle : true\n    this.allowHalfTrickle = opts.allowHalfTrickle !== undefined ? opts.allowHalfTrickle : false\n    this.iceCompleteTimeout = opts.iceCompleteTimeout || ICECOMPLETE_TIMEOUT\n\n    this._connected = false\n\n    this.remoteAddress = undefined\n    this.remoteFamily = undefined\n    this.remotePort = undefined\n    this.localAddress = undefined\n    this.localFamily = undefined\n    this.localPort = undefined\n\n    this._wrtc = (opts.wrtc && typeof opts.wrtc === 'object')\n      ? opts.wrtc\n      : getBrowserRTC()\n\n    if (!this._wrtc) {\n      if (typeof window === 'undefined') {\n        throw errCode(new Error('No WebRTC support: Specify `opts.wrtc` option in this environment'), 'ERR_WEBRTC_SUPPORT')\n      } else {\n        throw errCode(new Error('No WebRTC support: Not a supported browser'), 'ERR_WEBRTC_SUPPORT')\n      }\n    }\n\n    this._pcReady = false\n    this._channelReady = false\n    this._iceComplete = false // ice candidate trickle done (got null candidate)\n    this._iceCompleteTimer = null // send an offer/answer anyway after some timeout\n    this._channel = null\n    this._pendingCandidates = []\n\n    this._isNegotiating = this.negotiated ? false : !this.initiator // is this peer waiting for negotiation to complete?\n    this._batchedNegotiation = false // batch synchronous negotiations\n    this._queuedNegotiation = false // is there a queued negotiation request?\n    this._sendersAwaitingStable = []\n    this._senderMap = new Map()\n    this._firstStable = true\n    this._closingInterval = null\n\n    this._remoteTracks = []\n    this._remoteStreams = []\n\n    this._chunk = null\n    this._cb = null\n    this._interval = null\n\n    try {\n      this._pc = new (this._wrtc.RTCPeerConnection)(this.config)\n    } catch (err) {\n      queueMicrotask(() => this.destroy(errCode(err, 'ERR_PC_CONSTRUCTOR')))\n      return\n    }\n\n    // We prefer feature detection whenever possible, but sometimes that's not\n    // possible for certain implementations.\n    this._isReactNativeWebrtc = typeof this._pc._peerConnectionId === 'number'\n\n    this._pc.oniceconnectionstatechange = () => {\n      this._onIceStateChange()\n    }\n    this._pc.onicegatheringstatechange = () => {\n      this._onIceStateChange()\n    }\n    this._pc.onconnectionstatechange = () => {\n      this._onConnectionStateChange()\n    }\n    this._pc.onsignalingstatechange = () => {\n      this._onSignalingStateChange()\n    }\n    this._pc.onicecandidate = event => {\n      this._onIceCandidate(event)\n    }\n\n    // Other spec events, unused by this implementation:\n    // - onconnectionstatechange\n    // - onicecandidateerror\n    // - onfingerprintfailure\n    // - onnegotiationneeded\n\n    if (this.initiator || this.negotiated) {\n      this._setupData({\n        channel: this._pc.createDataChannel(this.channelName, this.channelConfig)\n      })\n    } else {\n      this._pc.ondatachannel = event => {\n        this._setupData(event)\n      }\n    }\n\n    if (this.streams) {\n      this.streams.forEach(stream => {\n        this.addStream(stream)\n      })\n    }\n    this._pc.ontrack = event => {\n      this._onTrack(event)\n    }\n\n    if (this.initiator) {\n      this._needsNegotiation()\n    }\n\n    this._onFinishBound = () => {\n      this._onFinish()\n    }\n    this.once('finish', this._onFinishBound)\n  }\n\n  get bufferSize () {\n    return (this._channel && this._channel.bufferedAmount) || 0\n  }\n\n  // HACK: it's possible channel.readyState is \"closing\" before peer.destroy() fires\n  // https://bugs.chromium.org/p/chromium/issues/detail?id=882743\n  get connected () {\n    return (this._connected && this._channel.readyState === 'open')\n  }\n\n  address () {\n    return { port: this.localPort, family: this.localFamily, address: this.localAddress }\n  }\n\n  signal (data) {\n    if (this.destroyed) throw errCode(new Error('cannot signal after peer is destroyed'), 'ERR_SIGNALING')\n    if (typeof data === 'string') {\n      try {\n        data = JSON.parse(data)\n      } catch (err) {\n        data = {}\n      }\n    }\n    this._debug('signal()')\n\n    if (data.renegotiate && this.initiator) {\n      this._debug('got request to renegotiate')\n      this._needsNegotiation()\n    }\n    if (data.transceiverRequest && this.initiator) {\n      this._debug('got request for transceiver')\n      this.addTransceiver(data.transceiverRequest.kind, data.transceiverRequest.init)\n    }\n    if (data.candidate) {\n      if (this._pc.remoteDescription && this._pc.remoteDescription.type) {\n        this._addIceCandidate(data.candidate)\n      } else {\n        this._pendingCandidates.push(data.candidate)\n      }\n    }\n    if (data.sdp) {\n      this._pc.setRemoteDescription(new (this._wrtc.RTCSessionDescription)(data))\n        .then(() => {\n          if (this.destroyed) return\n\n          this._pendingCandidates.forEach(candidate => {\n            this._addIceCandidate(candidate)\n          })\n          this._pendingCandidates = []\n\n          if (this._pc.remoteDescription.type === 'offer') this._createAnswer()\n        })\n        .catch(err => {\n          this.destroy(errCode(err, 'ERR_SET_REMOTE_DESCRIPTION'))\n        })\n    }\n    if (!data.sdp && !data.candidate && !data.renegotiate && !data.transceiverRequest) {\n      this.destroy(errCode(new Error('signal() called with invalid signal data'), 'ERR_SIGNALING'))\n    }\n  }\n\n  _addIceCandidate (candidate) {\n    var iceCandidateObj = new this._wrtc.RTCIceCandidate(candidate)\n    this._pc.addIceCandidate(iceCandidateObj)\n      .catch(err => {\n        if (!iceCandidateObj.address || iceCandidateObj.address.endsWith('.local')) {\n          warn('Ignoring unsupported ICE candidate.')\n        } else {\n          this.destroy(errCode(err, 'ERR_ADD_ICE_CANDIDATE'))\n        }\n      })\n  }\n\n  /**\n   * Send text/binary data to the remote peer.\n   * @param {ArrayBufferView|ArrayBuffer|Buffer|string|Blob} chunk\n   */\n  send (chunk) {\n    this._channel.send(chunk)\n  }\n\n  /**\n   * Add a Transceiver to the connection.\n   * @param {String} kind\n   * @param {Object} init\n   */\n  addTransceiver (kind, init) {\n    this._debug('addTransceiver()')\n\n    if (this.initiator) {\n      try {\n        this._pc.addTransceiver(kind, init)\n        this._needsNegotiation()\n      } catch (err) {\n        this.destroy(errCode(err, 'ERR_ADD_TRANSCEIVER'))\n      }\n    } else {\n      this.emit('signal', { // request initiator to renegotiate\n        transceiverRequest: { kind, init }\n      })\n    }\n  }\n\n  /**\n   * Add a MediaStream to the connection.\n   * @param {MediaStream} stream\n   */\n  addStream (stream) {\n    this._debug('addStream()')\n\n    stream.getTracks().forEach(track => {\n      this.addTrack(track, stream)\n    })\n  }\n\n  /**\n   * Add a MediaStreamTrack to the connection.\n   * @param {MediaStreamTrack} track\n   * @param {MediaStream} stream\n   */\n  addTrack (track, stream) {\n    this._debug('addTrack()')\n\n    var submap = this._senderMap.get(track) || new Map() // nested Maps map [track, stream] to sender\n    var sender = submap.get(stream)\n    if (!sender) {\n      sender = this._pc.addTrack(track, stream)\n      submap.set(stream, sender)\n      this._senderMap.set(track, submap)\n      this._needsNegotiation()\n    } else if (sender.removed) {\n      throw errCode(new Error('Track has been removed. You should enable/disable tracks that you want to re-add.'), 'ERR_SENDER_REMOVED')\n    } else {\n      throw errCode(new Error('Track has already been added to that stream.'), 'ERR_SENDER_ALREADY_ADDED')\n    }\n  }\n\n  /**\n   * Replace a MediaStreamTrack by another in the connection.\n   * @param {MediaStreamTrack} oldTrack\n   * @param {MediaStreamTrack} newTrack\n   * @param {MediaStream} stream\n   */\n  replaceTrack (oldTrack, newTrack, stream) {\n    this._debug('replaceTrack()')\n\n    var submap = this._senderMap.get(oldTrack)\n    var sender = submap ? submap.get(stream) : null\n    if (!sender) {\n      throw errCode(new Error('Cannot replace track that was never added.'), 'ERR_TRACK_NOT_ADDED')\n    }\n    if (newTrack) this._senderMap.set(newTrack, submap)\n\n    if (sender.replaceTrack != null) {\n      sender.replaceTrack(newTrack)\n    } else {\n      this.destroy(errCode(new Error('replaceTrack is not supported in this browser'), 'ERR_UNSUPPORTED_REPLACETRACK'))\n    }\n  }\n\n  /**\n   * Remove a MediaStreamTrack from the connection.\n   * @param {MediaStreamTrack} track\n   * @param {MediaStream} stream\n   */\n  removeTrack (track, stream) {\n    this._debug('removeSender()')\n\n    var submap = this._senderMap.get(track)\n    var sender = submap ? submap.get(stream) : null\n    if (!sender) {\n      throw errCode(new Error('Cannot remove track that was never added.'), 'ERR_TRACK_NOT_ADDED')\n    }\n    try {\n      sender.removed = true\n      this._pc.removeTrack(sender)\n    } catch (err) {\n      if (err.name === 'NS_ERROR_UNEXPECTED') {\n        this._sendersAwaitingStable.push(sender) // HACK: Firefox must wait until (signalingState === stable) https://bugzilla.mozilla.org/show_bug.cgi?id=1133874\n      } else {\n        this.destroy(errCode(err, 'ERR_REMOVE_TRACK'))\n      }\n    }\n    this._needsNegotiation()\n  }\n\n  /**\n   * Remove a MediaStream from the connection.\n   * @param {MediaStream} stream\n   */\n  removeStream (stream) {\n    this._debug('removeSenders()')\n\n    stream.getTracks().forEach(track => {\n      this.removeTrack(track, stream)\n    })\n  }\n\n  _needsNegotiation () {\n    this._debug('_needsNegotiation')\n    if (this._batchedNegotiation) return // batch synchronous renegotiations\n    this._batchedNegotiation = true\n    queueMicrotask(() => {\n      this._batchedNegotiation = false\n      this._debug('starting batched negotiation')\n      this.negotiate()\n    })\n  }\n\n  negotiate () {\n    if (this.initiator) {\n      if (this._isNegotiating) {\n        this._queuedNegotiation = true\n        this._debug('already negotiating, queueing')\n      } else {\n        this._debug('start negotiation')\n        setTimeout(() => { // HACK: Chrome crashes if we immediately call createOffer\n          this._createOffer()\n        }, 0)\n      }\n    } else {\n      if (this._isNegotiating) {\n        this._queuedNegotiation = true\n        this._debug('already negotiating, queueing')\n      } else {\n        this._debug('requesting negotiation from initiator')\n        this.emit('signal', { // request initiator to renegotiate\n          renegotiate: true\n        })\n      }\n    }\n    this._isNegotiating = true\n  }\n\n  _destroy (err, cb) {\n    this._debug('destroy (error: %s)', err && (err.message || err))\n\n    this.readable = this.writable = false\n\n    if (!this._readableState.ended) this.push(null)\n    if (!this._writableState.finished) this.end()\n\n    this._connected = false\n    this._pcReady = false\n    this._channelReady = false\n    this._remoteTracks = null\n    this._remoteStreams = null\n    this._senderMap = null\n\n    clearInterval(this._closingInterval)\n    this._closingInterval = null\n\n    clearInterval(this._interval)\n    this._interval = null\n    this._chunk = null\n    this._cb = null\n\n    if (this._onFinishBound) this.removeListener('finish', this._onFinishBound)\n    this._onFinishBound = null\n\n    if (this._channel) {\n      try {\n        this._channel.close()\n      } catch (err) {}\n\n      this._channel.onmessage = null\n      this._channel.onopen = null\n      this._channel.onclose = null\n      this._channel.onerror = null\n    }\n    if (this._pc) {\n      try {\n        this._pc.close()\n      } catch (err) {}\n\n      this._pc.oniceconnectionstatechange = null\n      this._pc.onicegatheringstatechange = null\n      this._pc.onsignalingstatechange = null\n      this._pc.onicecandidate = null\n      this._pc.ontrack = null\n      this._pc.ondatachannel = null\n    }\n    this._pc = null\n    this._channel = null\n\n    cb(err)\n  }\n\n  _setupData (event) {\n    if (!event.channel) {\n      // In some situations `pc.createDataChannel()` returns `undefined` (in wrtc),\n      // which is invalid behavior. Handle it gracefully.\n      // See: https://github.com/feross/simple-peer/issues/163\n      return this.destroy(errCode(new Error('Data channel event is missing `channel` property'), 'ERR_DATA_CHANNEL'))\n    }\n\n    this._channel = event.channel\n    this._channel.binaryType = 'arraybuffer'\n\n    if (typeof this._channel.bufferedAmountLowThreshold === 'number') {\n      this._channel.bufferedAmountLowThreshold = MAX_BUFFERED_AMOUNT\n    }\n\n    this.channelName = this._channel.label\n\n    this._channel.onmessage = event => {\n      this._onChannelMessage(event)\n    }\n    this._channel.onbufferedamountlow = () => {\n      this._onChannelBufferedAmountLow()\n    }\n    this._channel.onopen = () => {\n      this._onChannelOpen()\n    }\n    this._channel.onclose = () => {\n      this._onChannelClose()\n    }\n    this._channel.onerror = err => {\n      this.destroy(errCode(err, 'ERR_DATA_CHANNEL'))\n    }\n\n    // HACK: Chrome will sometimes get stuck in readyState \"closing\", let's check for this condition\n    // https://bugs.chromium.org/p/chromium/issues/detail?id=882743\n    var isClosing = false\n    this._closingInterval = setInterval(() => { // No \"onclosing\" event\n      if (this._channel && this._channel.readyState === 'closing') {\n        if (isClosing) this._onChannelClose() // closing timed out: equivalent to onclose firing\n        isClosing = true\n      } else {\n        isClosing = false\n      }\n    }, CHANNEL_CLOSING_TIMEOUT)\n  }\n\n  _read () {}\n\n  _write (chunk, encoding, cb) {\n    if (this.destroyed) return cb(errCode(new Error('cannot write after peer is destroyed'), 'ERR_DATA_CHANNEL'))\n\n    if (this._connected) {\n      try {\n        this.send(chunk)\n      } catch (err) {\n        return this.destroy(errCode(err, 'ERR_DATA_CHANNEL'))\n      }\n      if (this._channel.bufferedAmount > MAX_BUFFERED_AMOUNT) {\n        this._debug('start backpressure: bufferedAmount %d', this._channel.bufferedAmount)\n        this._cb = cb\n      } else {\n        cb(null)\n      }\n    } else {\n      this._debug('write before connect')\n      this._chunk = chunk\n      this._cb = cb\n    }\n  }\n\n  // When stream finishes writing, close socket. Half open connections are not\n  // supported.\n  _onFinish () {\n    if (this.destroyed) return\n\n    // Wait a bit before destroying so the socket flushes.\n    // TODO: is there a more reliable way to accomplish this?\n    const destroySoon = () => {\n      setTimeout(() => this.destroy(), 1000)\n    }\n\n    if (this._connected) {\n      destroySoon()\n    } else {\n      this.once('connect', destroySoon)\n    }\n  }\n\n  _startIceCompleteTimeout () {\n    if (this.destroyed) return\n    if (this._iceCompleteTimer) return\n    this._debug('started iceComplete timeout')\n    this._iceCompleteTimer = setTimeout(() => {\n      if (!this._iceComplete) {\n        this._iceComplete = true\n        this._debug('iceComplete timeout completed')\n        this.emit('iceTimeout')\n        this.emit('_iceComplete')\n      }\n    }, this.iceCompleteTimeout)\n  }\n\n  _createOffer () {\n    if (this.destroyed) return\n\n    this._pc.createOffer(this.offerOptions)\n      .then(offer => {\n        if (this.destroyed) return\n        if (!this.trickle && !this.allowHalfTrickle) offer.sdp = filterTrickle(offer.sdp)\n        offer.sdp = this.sdpTransform(offer.sdp)\n\n        const sendOffer = () => {\n          if (this.destroyed) return\n          var signal = this._pc.localDescription || offer\n          this._debug('signal')\n          this.emit('signal', {\n            type: signal.type,\n            sdp: signal.sdp\n          })\n        }\n\n        const onSuccess = () => {\n          this._debug('createOffer success')\n          if (this.destroyed) return\n          if (this.trickle || this._iceComplete) sendOffer()\n          else this.once('_iceComplete', sendOffer) // wait for candidates\n        }\n\n        const onError = err => {\n          this.destroy(errCode(err, 'ERR_SET_LOCAL_DESCRIPTION'))\n        }\n\n        this._pc.setLocalDescription(offer)\n          .then(onSuccess)\n          .catch(onError)\n      })\n      .catch(err => {\n        this.destroy(errCode(err, 'ERR_CREATE_OFFER'))\n      })\n  }\n\n  _requestMissingTransceivers () {\n    if (this._pc.getTransceivers) {\n      this._pc.getTransceivers().forEach(transceiver => {\n        if (!transceiver.mid && transceiver.sender.track && !transceiver.requested) {\n          transceiver.requested = true // HACK: Safari returns negotiated transceivers with a null mid\n          this.addTransceiver(transceiver.sender.track.kind)\n        }\n      })\n    }\n  }\n\n  _createAnswer () {\n    if (this.destroyed) return\n\n    this._pc.createAnswer(this.answerOptions)\n      .then(answer => {\n        if (this.destroyed) return\n        if (!this.trickle && !this.allowHalfTrickle) answer.sdp = filterTrickle(answer.sdp)\n        answer.sdp = this.sdpTransform(answer.sdp)\n\n        const sendAnswer = () => {\n          if (this.destroyed) return\n          var signal = this._pc.localDescription || answer\n          this._debug('signal')\n          this.emit('signal', {\n            type: signal.type,\n            sdp: signal.sdp\n          })\n          if (!this.initiator) this._requestMissingTransceivers()\n        }\n\n        const onSuccess = () => {\n          if (this.destroyed) return\n          if (this.trickle || this._iceComplete) sendAnswer()\n          else this.once('_iceComplete', sendAnswer)\n        }\n\n        const onError = err => {\n          this.destroy(errCode(err, 'ERR_SET_LOCAL_DESCRIPTION'))\n        }\n\n        this._pc.setLocalDescription(answer)\n          .then(onSuccess)\n          .catch(onError)\n      })\n      .catch(err => {\n        this.destroy(errCode(err, 'ERR_CREATE_ANSWER'))\n      })\n  }\n\n  _onConnectionStateChange () {\n    if (this.destroyed) return\n    if (this._pc.connectionState === 'failed') {\n      this.destroy(errCode(new Error('Connection failed.'), 'ERR_CONNECTION_FAILURE'))\n    }\n  }\n\n  _onIceStateChange () {\n    if (this.destroyed) return\n    var iceConnectionState = this._pc.iceConnectionState\n    var iceGatheringState = this._pc.iceGatheringState\n\n    this._debug(\n      'iceStateChange (connection: %s) (gathering: %s)',\n      iceConnectionState,\n      iceGatheringState\n    )\n    this.emit('iceStateChange', iceConnectionState, iceGatheringState)\n\n    if (iceConnectionState === 'connected' || iceConnectionState === 'completed') {\n      this._pcReady = true\n      this._maybeReady()\n    }\n    if (iceConnectionState === 'failed') {\n      this.destroy(errCode(new Error('Ice connection failed.'), 'ERR_ICE_CONNECTION_FAILURE'))\n    }\n    if (iceConnectionState === 'closed') {\n      this.destroy(errCode(new Error('Ice connection closed.'), 'ERR_ICE_CONNECTION_CLOSED'))\n    }\n  }\n\n  getStats (cb) {\n    // statreports can come with a value array instead of properties\n    const flattenValues = report => {\n      if (Object.prototype.toString.call(report.values) === '[object Array]') {\n        report.values.forEach(value => {\n          Object.assign(report, value)\n        })\n      }\n      return report\n    }\n\n    // Promise-based getStats() (standard)\n    if (this._pc.getStats.length === 0 || this._isReactNativeWebrtc) {\n      this._pc.getStats()\n        .then(res => {\n          var reports = []\n          res.forEach(report => {\n            reports.push(flattenValues(report))\n          })\n          cb(null, reports)\n        }, err => cb(err))\n\n    // Single-parameter callback-based getStats() (non-standard)\n    } else if (this._pc.getStats.length > 0) {\n      this._pc.getStats(res => {\n        // If we destroy connection in `connect` callback this code might happen to run when actual connection is already closed\n        if (this.destroyed) return\n\n        var reports = []\n        res.result().forEach(result => {\n          var report = {}\n          result.names().forEach(name => {\n            report[name] = result.stat(name)\n          })\n          report.id = result.id\n          report.type = result.type\n          report.timestamp = result.timestamp\n          reports.push(flattenValues(report))\n        })\n        cb(null, reports)\n      }, err => cb(err))\n\n    // Unknown browser, skip getStats() since it's anyone's guess which style of\n    // getStats() they implement.\n    } else {\n      cb(null, [])\n    }\n  }\n\n  _maybeReady () {\n    this._debug('maybeReady pc %s channel %s', this._pcReady, this._channelReady)\n    if (this._connected || this._connecting || !this._pcReady || !this._channelReady) return\n\n    this._connecting = true\n\n    // HACK: We can't rely on order here, for details see https://github.com/js-platform/node-webrtc/issues/339\n    const findCandidatePair = () => {\n      if (this.destroyed) return\n\n      this.getStats((err, items) => {\n        if (this.destroyed) return\n\n        // Treat getStats error as non-fatal. It's not essential.\n        if (err) items = []\n\n        var remoteCandidates = {}\n        var localCandidates = {}\n        var candidatePairs = {}\n        var foundSelectedCandidatePair = false\n\n        items.forEach(item => {\n          // TODO: Once all browsers support the hyphenated stats report types, remove\n          // the non-hypenated ones\n          if (item.type === 'remotecandidate' || item.type === 'remote-candidate') {\n            remoteCandidates[item.id] = item\n          }\n          if (item.type === 'localcandidate' || item.type === 'local-candidate') {\n            localCandidates[item.id] = item\n          }\n          if (item.type === 'candidatepair' || item.type === 'candidate-pair') {\n            candidatePairs[item.id] = item\n          }\n        })\n\n        const setSelectedCandidatePair = selectedCandidatePair => {\n          foundSelectedCandidatePair = true\n\n          var local = localCandidates[selectedCandidatePair.localCandidateId]\n\n          if (local && (local.ip || local.address)) {\n            // Spec\n            this.localAddress = local.ip || local.address\n            this.localPort = Number(local.port)\n          } else if (local && local.ipAddress) {\n            // Firefox\n            this.localAddress = local.ipAddress\n            this.localPort = Number(local.portNumber)\n          } else if (typeof selectedCandidatePair.googLocalAddress === 'string') {\n            // TODO: remove this once Chrome 58 is released\n            local = selectedCandidatePair.googLocalAddress.split(':')\n            this.localAddress = local[0]\n            this.localPort = Number(local[1])\n          }\n          if (this.localAddress) {\n            this.localFamily = this.localAddress.includes(':') ? 'IPv6' : 'IPv4'\n          }\n\n          var remote = remoteCandidates[selectedCandidatePair.remoteCandidateId]\n\n          if (remote && (remote.ip || remote.address)) {\n            // Spec\n            this.remoteAddress = remote.ip || remote.address\n            this.remotePort = Number(remote.port)\n          } else if (remote && remote.ipAddress) {\n            // Firefox\n            this.remoteAddress = remote.ipAddress\n            this.remotePort = Number(remote.portNumber)\n          } else if (typeof selectedCandidatePair.googRemoteAddress === 'string') {\n            // TODO: remove this once Chrome 58 is released\n            remote = selectedCandidatePair.googRemoteAddress.split(':')\n            this.remoteAddress = remote[0]\n            this.remotePort = Number(remote[1])\n          }\n          if (this.remoteAddress) {\n            this.remoteFamily = this.remoteAddress.includes(':') ? 'IPv6' : 'IPv4'\n          }\n\n          this._debug(\n            'connect local: %s:%s remote: %s:%s',\n            this.localAddress, this.localPort, this.remoteAddress, this.remotePort\n          )\n        }\n\n        items.forEach(item => {\n          // Spec-compliant\n          if (item.type === 'transport' && item.selectedCandidatePairId) {\n            setSelectedCandidatePair(candidatePairs[item.selectedCandidatePairId])\n          }\n\n          // Old implementations\n          if (\n            (item.type === 'googCandidatePair' && item.googActiveConnection === 'true') ||\n            ((item.type === 'candidatepair' || item.type === 'candidate-pair') && item.selected)\n          ) {\n            setSelectedCandidatePair(item)\n          }\n        })\n\n        // Ignore candidate pair selection in browsers like Safari 11 that do not have any local or remote candidates\n        // But wait until at least 1 candidate pair is available\n        if (!foundSelectedCandidatePair && (!Object.keys(candidatePairs).length || Object.keys(localCandidates).length)) {\n          setTimeout(findCandidatePair, 100)\n          return\n        } else {\n          this._connecting = false\n          this._connected = true\n        }\n\n        if (this._chunk) {\n          try {\n            this.send(this._chunk)\n          } catch (err) {\n            return this.destroy(errCode(err, 'ERR_DATA_CHANNEL'))\n          }\n          this._chunk = null\n          this._debug('sent chunk from \"write before connect\"')\n\n          var cb = this._cb\n          this._cb = null\n          cb(null)\n        }\n\n        // If `bufferedAmountLowThreshold` and 'onbufferedamountlow' are unsupported,\n        // fallback to using setInterval to implement backpressure.\n        if (typeof this._channel.bufferedAmountLowThreshold !== 'number') {\n          this._interval = setInterval(() => this._onInterval(), 150)\n          if (this._interval.unref) this._interval.unref()\n        }\n\n        this._debug('connect')\n        this.emit('connect')\n      })\n    }\n    findCandidatePair()\n  }\n\n  _onInterval () {\n    if (!this._cb || !this._channel || this._channel.bufferedAmount > MAX_BUFFERED_AMOUNT) {\n      return\n    }\n    this._onChannelBufferedAmountLow()\n  }\n\n  _onSignalingStateChange () {\n    if (this.destroyed) return\n\n    if (this._pc.signalingState === 'stable' && !this._firstStable) {\n      this._isNegotiating = false\n\n      // HACK: Firefox doesn't yet support removing tracks when signalingState !== 'stable'\n      this._debug('flushing sender queue', this._sendersAwaitingStable)\n      this._sendersAwaitingStable.forEach(sender => {\n        this._pc.removeTrack(sender)\n        this._queuedNegotiation = true\n      })\n      this._sendersAwaitingStable = []\n\n      if (this._queuedNegotiation) {\n        this._debug('flushing negotiation queue')\n        this._queuedNegotiation = false\n        this._needsNegotiation() // negotiate again\n      }\n\n      this._debug('negotiate')\n      this.emit('negotiate')\n    }\n    this._firstStable = false\n\n    this._debug('signalingStateChange %s', this._pc.signalingState)\n    this.emit('signalingStateChange', this._pc.signalingState)\n  }\n\n  _onIceCandidate (event) {\n    if (this.destroyed) return\n    if (event.candidate && this.trickle) {\n      this.emit('signal', {\n        candidate: {\n          candidate: event.candidate.candidate,\n          sdpMLineIndex: event.candidate.sdpMLineIndex,\n          sdpMid: event.candidate.sdpMid\n        }\n      })\n    } else if (!event.candidate && !this._iceComplete) {\n      this._iceComplete = true\n      this.emit('_iceComplete')\n    }\n    // as soon as we've received one valid candidate start timeout\n    if (event.candidate) {\n      this._startIceCompleteTimeout()\n    }\n  }\n\n  _onChannelMessage (event) {\n    if (this.destroyed) return\n    var data = event.data\n    if (data instanceof ArrayBuffer) data = new Uint8Array(data)\n    this.push(data)\n  }\n\n  _onChannelBufferedAmountLow () {\n    if (this.destroyed || !this._cb) return\n    this._debug('ending backpressure: bufferedAmount %d', this._channel.bufferedAmount)\n    var cb = this._cb\n    this._cb = null\n    cb(null)\n  }\n\n  _onChannelOpen () {\n    if (this._connected || this.destroyed) return\n    this._debug('on channel open')\n    this._channelReady = true\n    this._maybeReady()\n  }\n\n  _onChannelClose () {\n    if (this.destroyed) return\n    this._debug('on channel close')\n    this.destroy()\n  }\n\n  _onTrack (event) {\n    if (this.destroyed) return\n\n    event.streams.forEach(eventStream => {\n      this._debug('on track')\n      this.emit('track', event.track, eventStream)\n\n      this._remoteTracks.push({\n        track: event.track,\n        stream: eventStream\n      })\n\n      if (this._remoteStreams.some(remoteStream => {\n        return remoteStream.id === eventStream.id\n      })) return // Only fire one 'stream' event, even though there may be multiple tracks per stream\n\n      this._remoteStreams.push(eventStream)\n      queueMicrotask(() => {\n        this.emit('stream', eventStream) // ensure all tracks have been added\n      })\n    })\n  }\n\n  _debug () {\n    var args = [].slice.call(arguments)\n    args[0] = '[' + this._id + '] ' + args[0]\n    debug.apply(null, args)\n  }\n}\n\nPeer.WEBRTC_SUPPORT = !!getBrowserRTC()\n\n/**\n * Expose peer and data channel config for overriding all Peer\n * instances. Otherwise, just set opts.config or opts.channelConfig\n * when constructing a Peer.\n */\nPeer.config = {\n  iceServers: [\n    {\n      urls: [\n        'stun:stun.l.google.com:19302',\n        'stun:global.stun.twilio.com:3478'\n      ]\n    }\n  ],\n  sdpSemantics: 'unified-plan'\n}\n\nPeer.channelConfig = {}\n\nmodule.exports = Peer\n","// originally pulled out of simple-peer\n\nmodule.exports = function getBrowserRTC () {\n  if (typeof globalThis === 'undefined') return null\n  var wrtc = {\n    RTCPeerConnection: globalThis.RTCPeerConnection || globalThis.mozRTCPeerConnection ||\n      globalThis.webkitRTCPeerConnection,\n    RTCSessionDescription: globalThis.RTCSessionDescription ||\n      globalThis.mozRTCSessionDescription || globalThis.webkitRTCSessionDescription,\n    RTCIceCandidate: globalThis.RTCIceCandidate || globalThis.mozRTCIceCandidate ||\n      globalThis.webkitRTCIceCandidate\n  }\n  if (!wrtc.RTCPeerConnection) return null\n  return wrtc\n}\n","'use strict';\n\nfunction assign(obj, props) {\n    for (const key in props) {\n        Object.defineProperty(obj, key, {\n            value: props[key],\n            enumerable: true,\n            configurable: true,\n        });\n    }\n\n    return obj;\n}\n\nfunction createError(err, code, props) {\n    if (!err || typeof err === 'string') {\n        throw new TypeError('Please pass an Error to err-code');\n    }\n\n    if (!props) {\n        props = {};\n    }\n\n    if (typeof code === 'object') {\n        props = code;\n        code = undefined;\n    }\n\n    if (code != null) {\n        props.code = code;\n    }\n\n    try {\n        return assign(err, props);\n    } catch (_) {\n        props.message = err.message;\n        props.stack = err.stack;\n\n        const ErrClass = function () {};\n\n        ErrClass.prototype = Object.create(Object.getPrototypeOf(err));\n\n        return assign(new ErrClass(), props);\n    }\n}\n\nmodule.exports = createError;\n","'use strict'\n\nmodule.exports = {\n  supportsFileReader: typeof self !== 'undefined' && 'FileReader' in self,\n  supportsWebRTC: 'RTCPeerConnection' in globalThis &&\n  (typeof navigator !== 'undefined' && typeof navigator.mediaDevices !== 'undefined' && 'getUserMedia' in navigator.mediaDevices),\n  supportsWebRTCDataChannels: 'RTCPeerConnection' in globalThis\n}\n","'use strict'\n\n// p2p multi-address code\nexports.CODE_P2P = 421\nexports.CODE_CIRCUIT = 290\n\n// Time to wait for a connection to close gracefully before destroying it manually\nexports.CLOSE_TIMEOUT = 2000\n","'use strict'\n\nconst EventEmitter = require('events')\nconst debug = require('debug')\nconst log = debug('libp2p:webrtc-star:listener')\nlog.error = debug('libp2p:webrtc-star:listener:error')\n\nconst errCode = require('err-code')\nconst io = require('socket.io-client-next')\nconst SimplePeer = require('libp2p-webrtc-peer')\nconst pDefer = require('p-defer')\n\nconst toConnection = require('./socket-to-conn')\nconst { cleanUrlSIO } = require('./utils')\nconst { CODE_P2P } = require('./constants')\n\nconst sioOptions = {\n  transports: ['websocket'],\n  'force new connection': true,\n  path: '/socket.io-next/' // This should be removed when socket.io@2 support is removed\n}\n\nmodule.exports = ({ handler, upgrader }, WebRTCStar, options = {}) => {\n  const listener = new EventEmitter()\n  let listeningAddr\n  let signallingUrl\n\n  listener.__connections = []\n  listener.__spChannels = new Map()\n  listener.__pendingIntents = new Map()\n  listener.listen = (ma) => {\n    // Should only be used if not already listening\n    if (listeningAddr) {\n      throw errCode(new Error('listener already in use'), 'ERR_ALREADY_LISTENING')\n    }\n\n    const defer = pDefer()\n\n    // Should be kept unmodified\n    listeningAddr = ma\n\n    let signallingAddr\n    if (!ma.protoCodes().includes(CODE_P2P) && upgrader.localPeer) {\n      signallingAddr = ma.encapsulate(`/p2p/${upgrader.localPeer.toB58String()}`)\n    } else {\n      signallingAddr = ma\n    }\n\n    listener.on('error', () => defer.reject())\n\n    signallingUrl = cleanUrlSIO(ma)\n\n    log('Dialing to Signalling Server on: ' + signallingUrl)\n    listener.io = io.connect(signallingUrl, sioOptions)\n\n    const incommingDial = (offer) => {\n      if (offer.answer || offer.err || !offer.intentId) {\n        return\n      }\n\n      const intentId = offer.intentId\n      let pendings = listener.__pendingIntents.get(intentId)\n      if (!pendings) {\n        pendings = []\n        listener.__pendingIntents.set(intentId, pendings)\n      }\n\n      let channel = listener.__spChannels.get(intentId)\n      if (channel) {\n        channel.signal(offer.signal)\n        return\n      } else if (offer.signal.type !== 'offer') {\n        pendings.push(offer)\n        return\n      }\n\n      const spOptions = {\n        trickle: false,\n        ...options\n      }\n\n      // Use custom WebRTC implementation\n      if (WebRTCStar.wrtc) { spOptions.wrtc = WebRTCStar.wrtc }\n\n      channel = new SimplePeer(spOptions)\n\n      const onError = (err) => {\n        log.error('incoming connectioned errored', err)\n      }\n\n      channel.on('error', onError)\n      channel.once('close', (...args) => {\n        channel.removeListener('error', onError)\n      })\n\n      channel.on('signal', (signal) => {\n        offer.signal = signal\n        offer.answer = true\n        listener.io.emit('ss-handshake', offer)\n      })\n\n      channel.signal(offer.signal)\n      for (const pendingOffer of pendings) {\n        channel.signal(pendingOffer.signal)\n      }\n      listener.__pendingIntents.set(intentId, [])\n\n      channel.once('connect', async () => {\n        const maConn = toConnection(channel)\n        log('new inbound connection %s', maConn.remoteAddr)\n\n        let conn\n        try {\n          conn = await upgrader.upgradeInbound(maConn)\n        } catch (err) {\n          log.error('inbound connection failed to upgrade', err)\n          return maConn.close()\n        }\n\n        if (!conn.remoteAddr) {\n          try {\n            conn.remoteAddr = ma.decapsulateCode(CODE_P2P).encapsulate(`/p2p/${conn.remotePeer.toB58String()}`)\n          } catch (err) {\n            log.error('could not determine remote address', err)\n          }\n        }\n\n        log('inbound connection %s upgraded', maConn.remoteAddr)\n\n        trackConn(listener, maConn, intentId)\n\n        listener.emit('connection', conn)\n        handler(conn)\n      })\n      listener.__spChannels.set(intentId, channel)\n    }\n\n    listener.io.once('connect_error', (err) => defer.reject(err))\n    listener.io.once('error', (err) => {\n      listener.emit('error', err)\n      listener.emit('close')\n    })\n\n    listener.io.on('ws-handshake', incommingDial)\n    listener.io.on('ws-peer', WebRTCStar._peerDiscovered)\n\n    listener.io.on('connect', () => {\n      listener.io.emit('ss-join', signallingAddr.toString())\n    })\n\n    listener.io.once('connect', () => {\n      listener.emit('listening')\n      defer.resolve()\n    })\n\n    // Store listen and signal reference addresses\n    WebRTCStar.sigReferences.set(signallingUrl, {\n      listener,\n      signallingAddr\n    })\n\n    return defer.promise\n  }\n\n  listener.close = async () => {\n    // Close listener\n    const ref = WebRTCStar.sigReferences.get(signallingUrl)\n    if (ref && ref.listener.io) {\n      ref.listener.io.emit('ss-leave')\n      ref.listener.io.close()\n    }\n\n    await Promise.all(listener.__connections.map(maConn => maConn.close()))\n    listener.emit('close')\n    listener.removeAllListeners()\n\n    // Reset state\n    listeningAddr = undefined\n    WebRTCStar.sigReferences.delete(signallingUrl)\n  }\n\n  listener.getAddrs = () => {\n    return [listeningAddr]\n  }\n\n  return listener\n}\n\nfunction trackConn (listener, maConn, intentId) {\n  listener.__connections.push(maConn)\n\n  const untrackConn = () => {\n    listener.__connections = listener.__connections.filter(c => c !== maConn)\n    listener.__spChannels.delete(intentId)\n    listener.__pendingIntents.delete(intentId)\n  }\n\n  maConn.conn.once('close', untrackConn)\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Socket = exports.io = exports.Manager = exports.protocol = void 0;\nconst url_1 = require(\"./url\");\nconst manager_1 = require(\"./manager\");\nconst socket_1 = require(\"./socket\");\nObject.defineProperty(exports, \"Socket\", { enumerable: true, get: function () { return socket_1.Socket; } });\nconst debug = require(\"debug\")(\"socket.io-client\");\n/**\n * Module exports.\n */\nmodule.exports = exports = lookup;\n/**\n * Managers cache.\n */\nconst cache = (exports.managers = {});\nfunction lookup(uri, opts) {\n    if (typeof uri === \"object\") {\n        opts = uri;\n        uri = undefined;\n    }\n    opts = opts || {};\n    const parsed = url_1.url(uri, opts.path);\n    const source = parsed.source;\n    const id = parsed.id;\n    const path = parsed.path;\n    const sameNamespace = cache[id] && path in cache[id][\"nsps\"];\n    const newConnection = opts.forceNew ||\n        opts[\"force new connection\"] ||\n        false === opts.multiplex ||\n        sameNamespace;\n    let io;\n    if (newConnection) {\n        debug(\"ignoring socket cache for %s\", source);\n        io = new manager_1.Manager(source, opts);\n    }\n    else {\n        if (!cache[id]) {\n            debug(\"new io instance for %s\", source);\n            cache[id] = new manager_1.Manager(source, opts);\n        }\n        io = cache[id];\n    }\n    if (parsed.query && !opts.query) {\n        opts.query = parsed.queryKey;\n    }\n    return io.socket(parsed.path, opts);\n}\nexports.io = lookup;\n/**\n * Protocol version.\n *\n * @public\n */\nvar socket_io_parser_1 = require(\"socket.io-parser\");\nObject.defineProperty(exports, \"protocol\", { enumerable: true, get: function () { return socket_io_parser_1.protocol; } });\n/**\n * `connect`.\n *\n * @param {String} uri\n * @public\n */\nexports.connect = lookup;\n/**\n * Expose constructors for standalone build.\n *\n * @public\n */\nvar manager_2 = require(\"./manager\");\nObject.defineProperty(exports, \"Manager\", { enumerable: true, get: function () { return manager_2.Manager; } });\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.url = void 0;\nconst parseuri = require(\"parseuri\");\nconst debug = require(\"debug\")(\"socket.io-client:url\");\n/**\n * URL parser.\n *\n * @param uri - url\n * @param path - the request path of the connection\n * @param loc - An object meant to mimic window.location.\n *        Defaults to window.location.\n * @public\n */\nfunction url(uri, path = \"\", loc) {\n    let obj = uri;\n    // default to window.location\n    loc = loc || (typeof location !== \"undefined\" && location);\n    if (null == uri)\n        uri = loc.protocol + \"//\" + loc.host;\n    // relative path support\n    if (typeof uri === \"string\") {\n        if (\"/\" === uri.charAt(0)) {\n            if (\"/\" === uri.charAt(1)) {\n                uri = loc.protocol + uri;\n            }\n            else {\n                uri = loc.host + uri;\n            }\n        }\n        if (!/^(https?|wss?):\\/\\//.test(uri)) {\n            debug(\"protocol-less url %s\", uri);\n            if (\"undefined\" !== typeof loc) {\n                uri = loc.protocol + \"//\" + uri;\n            }\n            else {\n                uri = \"https://\" + uri;\n            }\n        }\n        // parse\n        debug(\"parse %s\", uri);\n        obj = parseuri(uri);\n    }\n    // make sure we treat `localhost:80` and `localhost` equally\n    if (!obj.port) {\n        if (/^(http|ws)$/.test(obj.protocol)) {\n            obj.port = \"80\";\n        }\n        else if (/^(http|ws)s$/.test(obj.protocol)) {\n            obj.port = \"443\";\n        }\n    }\n    obj.path = obj.path || \"/\";\n    const ipv6 = obj.host.indexOf(\":\") !== -1;\n    const host = ipv6 ? \"[\" + obj.host + \"]\" : obj.host;\n    // define unique id\n    obj.id = obj.protocol + \"://\" + host + \":\" + obj.port + path;\n    // define href\n    obj.href =\n        obj.protocol +\n            \"://\" +\n            host +\n            (loc && loc.port === obj.port ? \"\" : \":\" + obj.port);\n    return obj;\n}\nexports.url = url;\n","/**\n * Parses an URI\n *\n * @author Steven Levithan <stevenlevithan.com> (MIT license)\n * @api private\n */\n\nvar re = /^(?:(?![^:@]+:[^:@\\/]*@)(http|https|ws|wss):\\/\\/)?((?:(([^:@]*)(?::([^:@]*))?)?@)?((?:[a-f0-9]{0,4}:){2,7}[a-f0-9]{0,4}|[^:\\/?#]*)(?::(\\d*))?)(((\\/(?:[^?#](?![^?#\\/]*\\.[^?#\\/.]+(?:[?#]|$)))*\\/?)?([^?#\\/]*))(?:\\?([^#]*))?(?:#(.*))?)/;\n\nvar parts = [\n    'source', 'protocol', 'authority', 'userInfo', 'user', 'password', 'host', 'port', 'relative', 'path', 'directory', 'file', 'query', 'anchor'\n];\n\nmodule.exports = function parseuri(str) {\n    var src = str,\n        b = str.indexOf('['),\n        e = str.indexOf(']');\n\n    if (b != -1 && e != -1) {\n        str = str.substring(0, b) + str.substring(b, e).replace(/:/g, ';') + str.substring(e, str.length);\n    }\n\n    var m = re.exec(str || ''),\n        uri = {},\n        i = 14;\n\n    while (i--) {\n        uri[parts[i]] = m[i] || '';\n    }\n\n    if (b != -1 && e != -1) {\n        uri.source = src;\n        uri.host = uri.host.substring(1, uri.host.length - 1).replace(/;/g, ':');\n        uri.authority = uri.authority.replace('[', '').replace(']', '').replace(/;/g, ':');\n        uri.ipv6uri = true;\n    }\n\n    uri.pathNames = pathNames(uri, uri['path']);\n    uri.queryKey = queryKey(uri, uri['query']);\n\n    return uri;\n};\n\nfunction pathNames(obj, path) {\n    var regx = /\\/{2,9}/g,\n        names = path.replace(regx, \"/\").split(\"/\");\n\n    if (path.substr(0, 1) == '/' || path.length === 0) {\n        names.splice(0, 1);\n    }\n    if (path.substr(path.length - 1, 1) == '/') {\n        names.splice(names.length - 1, 1);\n    }\n\n    return names;\n}\n\nfunction queryKey(uri, query) {\n    var data = {};\n\n    query.replace(/(?:^|&)([^&=]*)=?([^&]*)/g, function ($0, $1, $2) {\n        if ($1) {\n            data[$1] = $2;\n        }\n    });\n\n    return data;\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Manager = void 0;\nconst eio = require(\"engine.io-client\");\nconst socket_1 = require(\"./socket\");\nconst Emitter = require(\"component-emitter\");\nconst parser = require(\"socket.io-parser\");\nconst on_1 = require(\"./on\");\nconst Backoff = require(\"backo2\");\nconst debug = require(\"debug\")(\"socket.io-client:manager\");\nclass Manager extends Emitter {\n    constructor(uri, opts) {\n        super();\n        this.nsps = {};\n        this.subs = [];\n        if (uri && \"object\" === typeof uri) {\n            opts = uri;\n            uri = undefined;\n        }\n        opts = opts || {};\n        opts.path = opts.path || \"/socket.io\";\n        this.opts = opts;\n        this.reconnection(opts.reconnection !== false);\n        this.reconnectionAttempts(opts.reconnectionAttempts || Infinity);\n        this.reconnectionDelay(opts.reconnectionDelay || 1000);\n        this.reconnectionDelayMax(opts.reconnectionDelayMax || 5000);\n        this.randomizationFactor(opts.randomizationFactor || 0.5);\n        this.backoff = new Backoff({\n            min: this.reconnectionDelay(),\n            max: this.reconnectionDelayMax(),\n            jitter: this.randomizationFactor(),\n        });\n        this.timeout(null == opts.timeout ? 20000 : opts.timeout);\n        this._readyState = \"closed\";\n        this.uri = uri;\n        const _parser = opts.parser || parser;\n        this.encoder = new _parser.Encoder();\n        this.decoder = new _parser.Decoder();\n        this._autoConnect = opts.autoConnect !== false;\n        if (this._autoConnect)\n            this.open();\n    }\n    reconnection(v) {\n        if (!arguments.length)\n            return this._reconnection;\n        this._reconnection = !!v;\n        return this;\n    }\n    reconnectionAttempts(v) {\n        if (v === undefined)\n            return this._reconnectionAttempts;\n        this._reconnectionAttempts = v;\n        return this;\n    }\n    reconnectionDelay(v) {\n        var _a;\n        if (v === undefined)\n            return this._reconnectionDelay;\n        this._reconnectionDelay = v;\n        (_a = this.backoff) === null || _a === void 0 ? void 0 : _a.setMin(v);\n        return this;\n    }\n    randomizationFactor(v) {\n        var _a;\n        if (v === undefined)\n            return this._randomizationFactor;\n        this._randomizationFactor = v;\n        (_a = this.backoff) === null || _a === void 0 ? void 0 : _a.setJitter(v);\n        return this;\n    }\n    reconnectionDelayMax(v) {\n        var _a;\n        if (v === undefined)\n            return this._reconnectionDelayMax;\n        this._reconnectionDelayMax = v;\n        (_a = this.backoff) === null || _a === void 0 ? void 0 : _a.setMax(v);\n        return this;\n    }\n    timeout(v) {\n        if (!arguments.length)\n            return this._timeout;\n        this._timeout = v;\n        return this;\n    }\n    /**\n     * Starts trying to reconnect if reconnection is enabled and we have not\n     * started reconnecting yet\n     *\n     * @private\n     */\n    maybeReconnectOnOpen() {\n        // Only try to reconnect if it's the first time we're connecting\n        if (!this._reconnecting &&\n            this._reconnection &&\n            this.backoff.attempts === 0) {\n            // keeps reconnection from firing twice for the same reconnection loop\n            this.reconnect();\n        }\n    }\n    /**\n     * Sets the current transport `socket`.\n     *\n     * @param {Function} fn - optional, callback\n     * @return self\n     * @public\n     */\n    open(fn) {\n        debug(\"readyState %s\", this._readyState);\n        if (~this._readyState.indexOf(\"open\"))\n            return this;\n        debug(\"opening %s\", this.uri);\n        this.engine = eio(this.uri, this.opts);\n        const socket = this.engine;\n        const self = this;\n        this._readyState = \"opening\";\n        this.skipReconnect = false;\n        // emit `open`\n        const openSubDestroy = on_1.on(socket, \"open\", function () {\n            self.onopen();\n            fn && fn();\n        });\n        // emit `error`\n        const errorSub = on_1.on(socket, \"error\", (err) => {\n            debug(\"error\");\n            self.cleanup();\n            self._readyState = \"closed\";\n            super.emit(\"error\", err);\n            if (fn) {\n                fn(err);\n            }\n            else {\n                // Only do this if there is no fn to handle the error\n                self.maybeReconnectOnOpen();\n            }\n        });\n        if (false !== this._timeout) {\n            const timeout = this._timeout;\n            debug(\"connect attempt will timeout after %d\", timeout);\n            if (timeout === 0) {\n                openSubDestroy(); // prevents a race condition with the 'open' event\n            }\n            // set timer\n            const timer = setTimeout(() => {\n                debug(\"connect attempt timed out after %d\", timeout);\n                openSubDestroy();\n                socket.close();\n                socket.emit(\"error\", new Error(\"timeout\"));\n            }, timeout);\n            this.subs.push(function subDestroy() {\n                clearTimeout(timer);\n            });\n        }\n        this.subs.push(openSubDestroy);\n        this.subs.push(errorSub);\n        return this;\n    }\n    /**\n     * Alias for open()\n     *\n     * @return self\n     * @public\n     */\n    connect(fn) {\n        return this.open(fn);\n    }\n    /**\n     * Called upon transport open.\n     *\n     * @private\n     */\n    onopen() {\n        debug(\"open\");\n        // clear old subs\n        this.cleanup();\n        // mark as open\n        this._readyState = \"open\";\n        super.emit(\"open\");\n        // add new subs\n        const socket = this.engine;\n        this.subs.push(on_1.on(socket, \"ping\", this.onping.bind(this)), on_1.on(socket, \"data\", this.ondata.bind(this)), on_1.on(socket, \"error\", this.onerror.bind(this)), on_1.on(socket, \"close\", this.onclose.bind(this)), on_1.on(this.decoder, \"decoded\", this.ondecoded.bind(this)));\n    }\n    /**\n     * Called upon a ping.\n     *\n     * @private\n     */\n    onping() {\n        super.emit(\"ping\");\n    }\n    /**\n     * Called with data.\n     *\n     * @private\n     */\n    ondata(data) {\n        this.decoder.add(data);\n    }\n    /**\n     * Called when parser fully decodes a packet.\n     *\n     * @private\n     */\n    ondecoded(packet) {\n        super.emit(\"packet\", packet);\n    }\n    /**\n     * Called upon socket error.\n     *\n     * @private\n     */\n    onerror(err) {\n        debug(\"error\", err);\n        super.emit(\"error\", err);\n    }\n    /**\n     * Creates a new socket for the given `nsp`.\n     *\n     * @return {Socket}\n     * @public\n     */\n    socket(nsp, opts) {\n        let socket = this.nsps[nsp];\n        if (!socket) {\n            socket = new socket_1.Socket(this, nsp, opts);\n            this.nsps[nsp] = socket;\n        }\n        return socket;\n    }\n    /**\n     * Called upon a socket close.\n     *\n     * @param socket\n     * @private\n     */\n    _destroy(socket) {\n        const nsps = Object.keys(this.nsps);\n        for (const nsp of nsps) {\n            const socket = this.nsps[nsp];\n            if (socket.active) {\n                debug(\"socket %s is still active, skipping close\", nsp);\n                return;\n            }\n        }\n        this._close();\n    }\n    /**\n     * Writes a packet.\n     *\n     * @param packet\n     * @private\n     */\n    _packet(packet) {\n        debug(\"writing packet %j\", packet);\n        const encodedPackets = this.encoder.encode(packet);\n        for (let i = 0; i < encodedPackets.length; i++) {\n            this.engine.write(encodedPackets[i], packet.options);\n        }\n    }\n    /**\n     * Clean up transport subscriptions and packet buffer.\n     *\n     * @private\n     */\n    cleanup() {\n        debug(\"cleanup\");\n        this.subs.forEach((subDestroy) => subDestroy());\n        this.subs.length = 0;\n        this.decoder.destroy();\n    }\n    /**\n     * Close the current socket.\n     *\n     * @private\n     */\n    _close() {\n        debug(\"disconnect\");\n        this.skipReconnect = true;\n        this._reconnecting = false;\n        if (\"opening\" === this._readyState) {\n            // `onclose` will not fire because\n            // an open event never happened\n            this.cleanup();\n        }\n        this.backoff.reset();\n        this._readyState = \"closed\";\n        if (this.engine)\n            this.engine.close();\n    }\n    /**\n     * Alias for close()\n     *\n     * @private\n     */\n    disconnect() {\n        return this._close();\n    }\n    /**\n     * Called upon engine close.\n     *\n     * @private\n     */\n    onclose(reason) {\n        debug(\"onclose\");\n        this.cleanup();\n        this.backoff.reset();\n        this._readyState = \"closed\";\n        super.emit(\"close\", reason);\n        if (this._reconnection && !this.skipReconnect) {\n            this.reconnect();\n        }\n    }\n    /**\n     * Attempt a reconnection.\n     *\n     * @private\n     */\n    reconnect() {\n        if (this._reconnecting || this.skipReconnect)\n            return this;\n        const self = this;\n        if (this.backoff.attempts >= this._reconnectionAttempts) {\n            debug(\"reconnect failed\");\n            this.backoff.reset();\n            super.emit(\"reconnect_failed\");\n            this._reconnecting = false;\n        }\n        else {\n            const delay = this.backoff.duration();\n            debug(\"will wait %dms before reconnect attempt\", delay);\n            this._reconnecting = true;\n            const timer = setTimeout(() => {\n                if (self.skipReconnect)\n                    return;\n                debug(\"attempting reconnect\");\n                super.emit(\"reconnect_attempt\", self.backoff.attempts);\n                // check again for the case socket closed in above events\n                if (self.skipReconnect)\n                    return;\n                self.open((err) => {\n                    if (err) {\n                        debug(\"reconnect attempt error\");\n                        self._reconnecting = false;\n                        self.reconnect();\n                        super.emit(\"reconnect_error\", err);\n                    }\n                    else {\n                        debug(\"reconnect success\");\n                        self.onreconnect();\n                    }\n                });\n            }, delay);\n            this.subs.push(function subDestroy() {\n                clearTimeout(timer);\n            });\n        }\n    }\n    /**\n     * Called upon successful reconnect.\n     *\n     * @private\n     */\n    onreconnect() {\n        const attempt = this.backoff.attempts;\n        this._reconnecting = false;\n        this.backoff.reset();\n        super.emit(\"reconnect\", attempt);\n    }\n}\nexports.Manager = Manager;\n","const Socket = require(\"./socket\");\n\nmodule.exports = (uri, opts) => new Socket(uri, opts);\n\n/**\n * Expose deps for legacy compatibility\n * and standalone browser access.\n */\n\nmodule.exports.Socket = Socket;\nmodule.exports.protocol = Socket.protocol; // this is an int\nmodule.exports.Transport = require(\"./transport\");\nmodule.exports.transports = require(\"./transports/index\");\nmodule.exports.parser = require(\"engine.io-parser\");\n","const transports = require(\"./transports/index\");\nconst Emitter = require(\"component-emitter\");\nconst debug = require(\"debug\")(\"engine.io-client:socket\");\nconst parser = require(\"engine.io-parser\");\nconst parseuri = require(\"parseuri\");\nconst parseqs = require(\"parseqs\");\n\nclass Socket extends Emitter {\n  /**\n   * Socket constructor.\n   *\n   * @param {String|Object} uri or options\n   * @param {Object} options\n   * @api public\n   */\n  constructor(uri, opts = {}) {\n    super();\n\n    if (uri && \"object\" === typeof uri) {\n      opts = uri;\n      uri = null;\n    }\n\n    if (uri) {\n      uri = parseuri(uri);\n      opts.hostname = uri.host;\n      opts.secure = uri.protocol === \"https\" || uri.protocol === \"wss\";\n      opts.port = uri.port;\n      if (uri.query) opts.query = uri.query;\n    } else if (opts.host) {\n      opts.hostname = parseuri(opts.host).host;\n    }\n\n    this.secure =\n      null != opts.secure\n        ? opts.secure\n        : typeof location !== \"undefined\" && \"https:\" === location.protocol;\n\n    if (opts.hostname && !opts.port) {\n      // if no port is specified manually, use the protocol default\n      opts.port = this.secure ? \"443\" : \"80\";\n    }\n\n    this.hostname =\n      opts.hostname ||\n      (typeof location !== \"undefined\" ? location.hostname : \"localhost\");\n    this.port =\n      opts.port ||\n      (typeof location !== \"undefined\" && location.port\n        ? location.port\n        : this.secure\n        ? 443\n        : 80);\n\n    this.transports = opts.transports || [\"polling\", \"websocket\"];\n    this.readyState = \"\";\n    this.writeBuffer = [];\n    this.prevBufferLen = 0;\n\n    this.opts = Object.assign(\n      {\n        path: \"/engine.io\",\n        agent: false,\n        withCredentials: false,\n        upgrade: true,\n        jsonp: true,\n        timestampParam: \"t\",\n        rememberUpgrade: false,\n        rejectUnauthorized: true,\n        perMessageDeflate: {\n          threshold: 1024\n        },\n        transportOptions: {}\n      },\n      opts\n    );\n\n    this.opts.path = this.opts.path.replace(/\\/$/, \"\") + \"/\";\n\n    if (typeof this.opts.query === \"string\") {\n      this.opts.query = parseqs.decode(this.opts.query);\n    }\n\n    // set on handshake\n    this.id = null;\n    this.upgrades = null;\n    this.pingInterval = null;\n    this.pingTimeout = null;\n\n    // set on heartbeat\n    this.pingTimeoutTimer = null;\n\n    if (typeof addEventListener === \"function\") {\n      addEventListener(\n        \"beforeunload\",\n        () => {\n          if (this.transport) {\n            // silently close the transport\n            this.transport.removeAllListeners();\n            this.transport.close();\n          }\n        },\n        false\n      );\n    }\n\n    this.open();\n  }\n\n  /**\n   * Creates transport of the given type.\n   *\n   * @param {String} transport name\n   * @return {Transport}\n   * @api private\n   */\n  createTransport(name) {\n    debug('creating transport \"%s\"', name);\n    const query = clone(this.opts.query);\n\n    // append engine.io protocol identifier\n    query.EIO = parser.protocol;\n\n    // transport name\n    query.transport = name;\n\n    // session id if we already have one\n    if (this.id) query.sid = this.id;\n\n    const opts = Object.assign(\n      {},\n      this.opts.transportOptions[name],\n      this.opts,\n      {\n        query,\n        socket: this,\n        hostname: this.hostname,\n        secure: this.secure,\n        port: this.port\n      }\n    );\n\n    debug(\"options: %j\", opts);\n\n    return new transports[name](opts);\n  }\n\n  /**\n   * Initializes transport to use and starts probe.\n   *\n   * @api private\n   */\n  open() {\n    let transport;\n    if (\n      this.opts.rememberUpgrade &&\n      Socket.priorWebsocketSuccess &&\n      this.transports.indexOf(\"websocket\") !== -1\n    ) {\n      transport = \"websocket\";\n    } else if (0 === this.transports.length) {\n      // Emit error on next tick so it can be listened to\n      const self = this;\n      setTimeout(function() {\n        self.emit(\"error\", \"No transports available\");\n      }, 0);\n      return;\n    } else {\n      transport = this.transports[0];\n    }\n    this.readyState = \"opening\";\n\n    // Retry with the next transport if the transport is disabled (jsonp: false)\n    try {\n      transport = this.createTransport(transport);\n    } catch (e) {\n      debug(\"error while creating transport: %s\", e);\n      this.transports.shift();\n      this.open();\n      return;\n    }\n\n    transport.open();\n    this.setTransport(transport);\n  }\n\n  /**\n   * Sets the current transport. Disables the existing one (if any).\n   *\n   * @api private\n   */\n  setTransport(transport) {\n    debug(\"setting transport %s\", transport.name);\n    const self = this;\n\n    if (this.transport) {\n      debug(\"clearing existing transport %s\", this.transport.name);\n      this.transport.removeAllListeners();\n    }\n\n    // set up transport\n    this.transport = transport;\n\n    // set up transport listeners\n    transport\n      .on(\"drain\", function() {\n        self.onDrain();\n      })\n      .on(\"packet\", function(packet) {\n        self.onPacket(packet);\n      })\n      .on(\"error\", function(e) {\n        self.onError(e);\n      })\n      .on(\"close\", function() {\n        self.onClose(\"transport close\");\n      });\n  }\n\n  /**\n   * Probes a transport.\n   *\n   * @param {String} transport name\n   * @api private\n   */\n  probe(name) {\n    debug('probing transport \"%s\"', name);\n    let transport = this.createTransport(name, { probe: 1 });\n    let failed = false;\n    const self = this;\n\n    Socket.priorWebsocketSuccess = false;\n\n    function onTransportOpen() {\n      if (self.onlyBinaryUpgrades) {\n        const upgradeLosesBinary =\n          !this.supportsBinary && self.transport.supportsBinary;\n        failed = failed || upgradeLosesBinary;\n      }\n      if (failed) return;\n\n      debug('probe transport \"%s\" opened', name);\n      transport.send([{ type: \"ping\", data: \"probe\" }]);\n      transport.once(\"packet\", function(msg) {\n        if (failed) return;\n        if (\"pong\" === msg.type && \"probe\" === msg.data) {\n          debug('probe transport \"%s\" pong', name);\n          self.upgrading = true;\n          self.emit(\"upgrading\", transport);\n          if (!transport) return;\n          Socket.priorWebsocketSuccess = \"websocket\" === transport.name;\n\n          debug('pausing current transport \"%s\"', self.transport.name);\n          self.transport.pause(function() {\n            if (failed) return;\n            if (\"closed\" === self.readyState) return;\n            debug(\"changing transport and sending upgrade packet\");\n\n            cleanup();\n\n            self.setTransport(transport);\n            transport.send([{ type: \"upgrade\" }]);\n            self.emit(\"upgrade\", transport);\n            transport = null;\n            self.upgrading = false;\n            self.flush();\n          });\n        } else {\n          debug('probe transport \"%s\" failed', name);\n          const err = new Error(\"probe error\");\n          err.transport = transport.name;\n          self.emit(\"upgradeError\", err);\n        }\n      });\n    }\n\n    function freezeTransport() {\n      if (failed) return;\n\n      // Any callback called by transport should be ignored since now\n      failed = true;\n\n      cleanup();\n\n      transport.close();\n      transport = null;\n    }\n\n    // Handle any error that happens while probing\n    function onerror(err) {\n      const error = new Error(\"probe error: \" + err);\n      error.transport = transport.name;\n\n      freezeTransport();\n\n      debug('probe transport \"%s\" failed because of error: %s', name, err);\n\n      self.emit(\"upgradeError\", error);\n    }\n\n    function onTransportClose() {\n      onerror(\"transport closed\");\n    }\n\n    // When the socket is closed while we're probing\n    function onclose() {\n      onerror(\"socket closed\");\n    }\n\n    // When the socket is upgraded while we're probing\n    function onupgrade(to) {\n      if (transport && to.name !== transport.name) {\n        debug('\"%s\" works - aborting \"%s\"', to.name, transport.name);\n        freezeTransport();\n      }\n    }\n\n    // Remove all listeners on the transport and on self\n    function cleanup() {\n      transport.removeListener(\"open\", onTransportOpen);\n      transport.removeListener(\"error\", onerror);\n      transport.removeListener(\"close\", onTransportClose);\n      self.removeListener(\"close\", onclose);\n      self.removeListener(\"upgrading\", onupgrade);\n    }\n\n    transport.once(\"open\", onTransportOpen);\n    transport.once(\"error\", onerror);\n    transport.once(\"close\", onTransportClose);\n\n    this.once(\"close\", onclose);\n    this.once(\"upgrading\", onupgrade);\n\n    transport.open();\n  }\n\n  /**\n   * Called when connection is deemed open.\n   *\n   * @api public\n   */\n  onOpen() {\n    debug(\"socket open\");\n    this.readyState = \"open\";\n    Socket.priorWebsocketSuccess = \"websocket\" === this.transport.name;\n    this.emit(\"open\");\n    this.flush();\n\n    // we check for `readyState` in case an `open`\n    // listener already closed the socket\n    if (\n      \"open\" === this.readyState &&\n      this.opts.upgrade &&\n      this.transport.pause\n    ) {\n      debug(\"starting upgrade probes\");\n      let i = 0;\n      const l = this.upgrades.length;\n      for (; i < l; i++) {\n        this.probe(this.upgrades[i]);\n      }\n    }\n  }\n\n  /**\n   * Handles a packet.\n   *\n   * @api private\n   */\n  onPacket(packet) {\n    if (\n      \"opening\" === this.readyState ||\n      \"open\" === this.readyState ||\n      \"closing\" === this.readyState\n    ) {\n      debug('socket receive: type \"%s\", data \"%s\"', packet.type, packet.data);\n\n      this.emit(\"packet\", packet);\n\n      // Socket is live - any packet counts\n      this.emit(\"heartbeat\");\n\n      switch (packet.type) {\n        case \"open\":\n          this.onHandshake(JSON.parse(packet.data));\n          break;\n\n        case \"ping\":\n          this.resetPingTimeout();\n          this.sendPacket(\"pong\");\n          this.emit(\"pong\");\n          break;\n\n        case \"error\":\n          const err = new Error(\"server error\");\n          err.code = packet.data;\n          this.onError(err);\n          break;\n\n        case \"message\":\n          this.emit(\"data\", packet.data);\n          this.emit(\"message\", packet.data);\n          break;\n      }\n    } else {\n      debug('packet received with socket readyState \"%s\"', this.readyState);\n    }\n  }\n\n  /**\n   * Called upon handshake completion.\n   *\n   * @param {Object} handshake obj\n   * @api private\n   */\n  onHandshake(data) {\n    this.emit(\"handshake\", data);\n    this.id = data.sid;\n    this.transport.query.sid = data.sid;\n    this.upgrades = this.filterUpgrades(data.upgrades);\n    this.pingInterval = data.pingInterval;\n    this.pingTimeout = data.pingTimeout;\n    this.onOpen();\n    // In case open handler closes socket\n    if (\"closed\" === this.readyState) return;\n    this.resetPingTimeout();\n  }\n\n  /**\n   * Sets and resets ping timeout timer based on server pings.\n   *\n   * @api private\n   */\n  resetPingTimeout() {\n    clearTimeout(this.pingTimeoutTimer);\n    this.pingTimeoutTimer = setTimeout(() => {\n      this.onClose(\"ping timeout\");\n    }, this.pingInterval + this.pingTimeout);\n  }\n\n  /**\n   * Called on `drain` event\n   *\n   * @api private\n   */\n  onDrain() {\n    this.writeBuffer.splice(0, this.prevBufferLen);\n\n    // setting prevBufferLen = 0 is very important\n    // for example, when upgrading, upgrade packet is sent over,\n    // and a nonzero prevBufferLen could cause problems on `drain`\n    this.prevBufferLen = 0;\n\n    if (0 === this.writeBuffer.length) {\n      this.emit(\"drain\");\n    } else {\n      this.flush();\n    }\n  }\n\n  /**\n   * Flush write buffers.\n   *\n   * @api private\n   */\n  flush() {\n    if (\n      \"closed\" !== this.readyState &&\n      this.transport.writable &&\n      !this.upgrading &&\n      this.writeBuffer.length\n    ) {\n      debug(\"flushing %d packets in socket\", this.writeBuffer.length);\n      this.transport.send(this.writeBuffer);\n      // keep track of current length of writeBuffer\n      // splice writeBuffer and callbackBuffer on `drain`\n      this.prevBufferLen = this.writeBuffer.length;\n      this.emit(\"flush\");\n    }\n  }\n\n  /**\n   * Sends a message.\n   *\n   * @param {String} message.\n   * @param {Function} callback function.\n   * @param {Object} options.\n   * @return {Socket} for chaining.\n   * @api public\n   */\n  write(msg, options, fn) {\n    this.sendPacket(\"message\", msg, options, fn);\n    return this;\n  }\n\n  send(msg, options, fn) {\n    this.sendPacket(\"message\", msg, options, fn);\n    return this;\n  }\n\n  /**\n   * Sends a packet.\n   *\n   * @param {String} packet type.\n   * @param {String} data.\n   * @param {Object} options.\n   * @param {Function} callback function.\n   * @api private\n   */\n  sendPacket(type, data, options, fn) {\n    if (\"function\" === typeof data) {\n      fn = data;\n      data = undefined;\n    }\n\n    if (\"function\" === typeof options) {\n      fn = options;\n      options = null;\n    }\n\n    if (\"closing\" === this.readyState || \"closed\" === this.readyState) {\n      return;\n    }\n\n    options = options || {};\n    options.compress = false !== options.compress;\n\n    const packet = {\n      type: type,\n      data: data,\n      options: options\n    };\n    this.emit(\"packetCreate\", packet);\n    this.writeBuffer.push(packet);\n    if (fn) this.once(\"flush\", fn);\n    this.flush();\n  }\n\n  /**\n   * Closes the connection.\n   *\n   * @api private\n   */\n  close() {\n    const self = this;\n\n    if (\"opening\" === this.readyState || \"open\" === this.readyState) {\n      this.readyState = \"closing\";\n\n      if (this.writeBuffer.length) {\n        this.once(\"drain\", function() {\n          if (this.upgrading) {\n            waitForUpgrade();\n          } else {\n            close();\n          }\n        });\n      } else if (this.upgrading) {\n        waitForUpgrade();\n      } else {\n        close();\n      }\n    }\n\n    function close() {\n      self.onClose(\"forced close\");\n      debug(\"socket closing - telling transport to close\");\n      self.transport.close();\n    }\n\n    function cleanupAndClose() {\n      self.removeListener(\"upgrade\", cleanupAndClose);\n      self.removeListener(\"upgradeError\", cleanupAndClose);\n      close();\n    }\n\n    function waitForUpgrade() {\n      // wait for upgrade to finish since we can't send packets while pausing a transport\n      self.once(\"upgrade\", cleanupAndClose);\n      self.once(\"upgradeError\", cleanupAndClose);\n    }\n\n    return this;\n  }\n\n  /**\n   * Called upon transport error\n   *\n   * @api private\n   */\n  onError(err) {\n    debug(\"socket error %j\", err);\n    Socket.priorWebsocketSuccess = false;\n    this.emit(\"error\", err);\n    this.onClose(\"transport error\", err);\n  }\n\n  /**\n   * Called upon transport close.\n   *\n   * @api private\n   */\n  onClose(reason, desc) {\n    if (\n      \"opening\" === this.readyState ||\n      \"open\" === this.readyState ||\n      \"closing\" === this.readyState\n    ) {\n      debug('socket close with reason: \"%s\"', reason);\n      const self = this;\n\n      // clear timers\n      clearTimeout(this.pingIntervalTimer);\n      clearTimeout(this.pingTimeoutTimer);\n\n      // stop event from firing again for transport\n      this.transport.removeAllListeners(\"close\");\n\n      // ensure transport won't stay open\n      this.transport.close();\n\n      // ignore further transport communication\n      this.transport.removeAllListeners();\n\n      // set ready state\n      this.readyState = \"closed\";\n\n      // clear session id\n      this.id = null;\n\n      // emit close event\n      this.emit(\"close\", reason, desc);\n\n      // clean buffers after, so users can still\n      // grab the buffers on `close` event\n      self.writeBuffer = [];\n      self.prevBufferLen = 0;\n    }\n  }\n\n  /**\n   * Filters upgrades, returning only those matching client transports.\n   *\n   * @param {Array} server upgrades\n   * @api private\n   *\n   */\n  filterUpgrades(upgrades) {\n    const filteredUpgrades = [];\n    let i = 0;\n    const j = upgrades.length;\n    for (; i < j; i++) {\n      if (~this.transports.indexOf(upgrades[i]))\n        filteredUpgrades.push(upgrades[i]);\n    }\n    return filteredUpgrades;\n  }\n}\n\nSocket.priorWebsocketSuccess = false;\n\n/**\n * Protocol version.\n *\n * @api public\n */\n\nSocket.protocol = parser.protocol; // this is an int\n\nfunction clone(obj) {\n  const o = {};\n  for (let i in obj) {\n    if (obj.hasOwnProperty(i)) {\n      o[i] = obj[i];\n    }\n  }\n  return o;\n}\n\nmodule.exports = Socket;\n","const XMLHttpRequest = require(\"xmlhttprequest-ssl\");\nconst XHR = require(\"./polling-xhr\");\nconst JSONP = require(\"./polling-jsonp\");\nconst websocket = require(\"./websocket\");\n\nexports.polling = polling;\nexports.websocket = websocket;\n\n/**\n * Polling transport polymorphic constructor.\n * Decides on xhr vs jsonp based on feature detection.\n *\n * @api private\n */\n\nfunction polling(opts) {\n  let xhr;\n  let xd = false;\n  let xs = false;\n  const jsonp = false !== opts.jsonp;\n\n  if (typeof location !== \"undefined\") {\n    const isSSL = \"https:\" === location.protocol;\n    let port = location.port;\n\n    // some user agents have empty `location.port`\n    if (!port) {\n      port = isSSL ? 443 : 80;\n    }\n\n    xd = opts.hostname !== location.hostname || port !== opts.port;\n    xs = opts.secure !== isSSL;\n  }\n\n  opts.xdomain = xd;\n  opts.xscheme = xs;\n  xhr = new XMLHttpRequest(opts);\n\n  if (\"open\" in xhr && !opts.forceJSONP) {\n    return new XHR(opts);\n  } else {\n    if (!jsonp) throw new Error(\"JSONP disabled\");\n    return new JSONP(opts);\n  }\n}\n","// browser shim for xmlhttprequest module\n\nconst hasCORS = require(\"has-cors\");\nconst globalThis = require(\"./globalThis\");\n\nmodule.exports = function(opts) {\n  const xdomain = opts.xdomain;\n\n  // scheme must be same when usign XDomainRequest\n  // http://blogs.msdn.com/b/ieinternals/archive/2010/05/13/xdomainrequest-restrictions-limitations-and-workarounds.aspx\n  const xscheme = opts.xscheme;\n\n  // XDomainRequest has a flow of not sending cookie, therefore it should be disabled as a default.\n  // https://github.com/Automattic/engine.io-client/pull/217\n  const enablesXDR = opts.enablesXDR;\n\n  // XMLHttpRequest can be disabled on IE\n  try {\n    if (\"undefined\" !== typeof XMLHttpRequest && (!xdomain || hasCORS)) {\n      return new XMLHttpRequest();\n    }\n  } catch (e) {}\n\n  // Use XDomainRequest for IE8 if enablesXDR is true\n  // because loading bar keeps flashing when using jsonp-polling\n  // https://github.com/yujiosaka/socke.io-ie8-loading-example\n  try {\n    if (\"undefined\" !== typeof XDomainRequest && !xscheme && enablesXDR) {\n      return new XDomainRequest();\n    }\n  } catch (e) {}\n\n  if (!xdomain) {\n    try {\n      return new globalThis[[\"Active\"].concat(\"Object\").join(\"X\")](\n        \"Microsoft.XMLHTTP\"\n      );\n    } catch (e) {}\n  }\n};\n","\n/**\n * Module exports.\n *\n * Logic borrowed from Modernizr:\n *\n *   - https://github.com/Modernizr/Modernizr/blob/master/feature-detects/cors.js\n */\n\ntry {\n  module.exports = typeof XMLHttpRequest !== 'undefined' &&\n    'withCredentials' in new XMLHttpRequest();\n} catch (err) {\n  // if XMLHttp support is disabled in IE then it will throw\n  // when trying to create\n  module.exports = false;\n}\n","module.exports = (() => {\n  if (typeof self !== \"undefined\") {\n    return self;\n  } else if (typeof window !== \"undefined\") {\n    return window;\n  } else {\n    return Function(\"return this\")();\n  }\n})();\n","/* global attachEvent */\n\nconst XMLHttpRequest = require(\"xmlhttprequest-ssl\");\nconst Polling = require(\"./polling\");\nconst Emitter = require(\"component-emitter\");\nconst { pick } = require(\"../util\");\nconst globalThis = require(\"../globalThis\");\n\nconst debug = require(\"debug\")(\"engine.io-client:polling-xhr\");\n\n/**\n * Empty function\n */\n\nfunction empty() {}\n\nconst hasXHR2 = (function() {\n  const xhr = new XMLHttpRequest({ xdomain: false });\n  return null != xhr.responseType;\n})();\n\nclass XHR extends Polling {\n  /**\n   * XHR Polling constructor.\n   *\n   * @param {Object} opts\n   * @api public\n   */\n  constructor(opts) {\n    super(opts);\n\n    if (typeof location !== \"undefined\") {\n      const isSSL = \"https:\" === location.protocol;\n      let port = location.port;\n\n      // some user agents have empty `location.port`\n      if (!port) {\n        port = isSSL ? 443 : 80;\n      }\n\n      this.xd =\n        (typeof location !== \"undefined\" &&\n          opts.hostname !== location.hostname) ||\n        port !== opts.port;\n      this.xs = opts.secure !== isSSL;\n    }\n    /**\n     * XHR supports binary\n     */\n    const forceBase64 = opts && opts.forceBase64;\n    this.supportsBinary = hasXHR2 && !forceBase64;\n  }\n\n  /**\n   * Creates a request.\n   *\n   * @param {String} method\n   * @api private\n   */\n  request(opts = {}) {\n    Object.assign(opts, { xd: this.xd, xs: this.xs }, this.opts);\n    return new Request(this.uri(), opts);\n  }\n\n  /**\n   * Sends data.\n   *\n   * @param {String} data to send.\n   * @param {Function} called upon flush.\n   * @api private\n   */\n  doWrite(data, fn) {\n    const req = this.request({\n      method: \"POST\",\n      data: data\n    });\n    const self = this;\n    req.on(\"success\", fn);\n    req.on(\"error\", function(err) {\n      self.onError(\"xhr post error\", err);\n    });\n  }\n\n  /**\n   * Starts a poll cycle.\n   *\n   * @api private\n   */\n  doPoll() {\n    debug(\"xhr poll\");\n    const req = this.request();\n    const self = this;\n    req.on(\"data\", function(data) {\n      self.onData(data);\n    });\n    req.on(\"error\", function(err) {\n      self.onError(\"xhr poll error\", err);\n    });\n    this.pollXhr = req;\n  }\n}\n\nclass Request extends Emitter {\n  /**\n   * Request constructor\n   *\n   * @param {Object} options\n   * @api public\n   */\n  constructor(uri, opts) {\n    super();\n    this.opts = opts;\n\n    this.method = opts.method || \"GET\";\n    this.uri = uri;\n    this.async = false !== opts.async;\n    this.data = undefined !== opts.data ? opts.data : null;\n\n    this.create();\n  }\n\n  /**\n   * Creates the XHR object and sends the request.\n   *\n   * @api private\n   */\n  create() {\n    const opts = pick(\n      this.opts,\n      \"agent\",\n      \"enablesXDR\",\n      \"pfx\",\n      \"key\",\n      \"passphrase\",\n      \"cert\",\n      \"ca\",\n      \"ciphers\",\n      \"rejectUnauthorized\"\n    );\n    opts.xdomain = !!this.opts.xd;\n    opts.xscheme = !!this.opts.xs;\n\n    const xhr = (this.xhr = new XMLHttpRequest(opts));\n    const self = this;\n\n    try {\n      debug(\"xhr open %s: %s\", this.method, this.uri);\n      xhr.open(this.method, this.uri, this.async);\n      try {\n        if (this.opts.extraHeaders) {\n          xhr.setDisableHeaderCheck && xhr.setDisableHeaderCheck(true);\n          for (let i in this.opts.extraHeaders) {\n            if (this.opts.extraHeaders.hasOwnProperty(i)) {\n              xhr.setRequestHeader(i, this.opts.extraHeaders[i]);\n            }\n          }\n        }\n      } catch (e) {}\n\n      if (\"POST\" === this.method) {\n        try {\n          xhr.setRequestHeader(\"Content-type\", \"text/plain;charset=UTF-8\");\n        } catch (e) {}\n      }\n\n      try {\n        xhr.setRequestHeader(\"Accept\", \"*/*\");\n      } catch (e) {}\n\n      // ie6 check\n      if (\"withCredentials\" in xhr) {\n        xhr.withCredentials = this.opts.withCredentials;\n      }\n\n      if (this.opts.requestTimeout) {\n        xhr.timeout = this.opts.requestTimeout;\n      }\n\n      if (this.hasXDR()) {\n        xhr.onload = function() {\n          self.onLoad();\n        };\n        xhr.onerror = function() {\n          self.onError(xhr.responseText);\n        };\n      } else {\n        xhr.onreadystatechange = function() {\n          if (4 !== xhr.readyState) return;\n          if (200 === xhr.status || 1223 === xhr.status) {\n            self.onLoad();\n          } else {\n            // make sure the `error` event handler that's user-set\n            // does not throw in the same tick and gets caught here\n            setTimeout(function() {\n              self.onError(typeof xhr.status === \"number\" ? xhr.status : 0);\n            }, 0);\n          }\n        };\n      }\n\n      debug(\"xhr data %s\", this.data);\n      xhr.send(this.data);\n    } catch (e) {\n      // Need to defer since .create() is called directly from the constructor\n      // and thus the 'error' event can only be only bound *after* this exception\n      // occurs.  Therefore, also, we cannot throw here at all.\n      setTimeout(function() {\n        self.onError(e);\n      }, 0);\n      return;\n    }\n\n    if (typeof document !== \"undefined\") {\n      this.index = Request.requestsCount++;\n      Request.requests[this.index] = this;\n    }\n  }\n\n  /**\n   * Called upon successful response.\n   *\n   * @api private\n   */\n  onSuccess() {\n    this.emit(\"success\");\n    this.cleanup();\n  }\n\n  /**\n   * Called if we have data.\n   *\n   * @api private\n   */\n  onData(data) {\n    this.emit(\"data\", data);\n    this.onSuccess();\n  }\n\n  /**\n   * Called upon error.\n   *\n   * @api private\n   */\n  onError(err) {\n    this.emit(\"error\", err);\n    this.cleanup(true);\n  }\n\n  /**\n   * Cleans up house.\n   *\n   * @api private\n   */\n  cleanup(fromError) {\n    if (\"undefined\" === typeof this.xhr || null === this.xhr) {\n      return;\n    }\n    // xmlhttprequest\n    if (this.hasXDR()) {\n      this.xhr.onload = this.xhr.onerror = empty;\n    } else {\n      this.xhr.onreadystatechange = empty;\n    }\n\n    if (fromError) {\n      try {\n        this.xhr.abort();\n      } catch (e) {}\n    }\n\n    if (typeof document !== \"undefined\") {\n      delete Request.requests[this.index];\n    }\n\n    this.xhr = null;\n  }\n\n  /**\n   * Called upon load.\n   *\n   * @api private\n   */\n  onLoad() {\n    const data = this.xhr.responseText;\n    if (data !== null) {\n      this.onData(data);\n    }\n  }\n\n  /**\n   * Check if it has XDomainRequest.\n   *\n   * @api private\n   */\n  hasXDR() {\n    return typeof XDomainRequest !== \"undefined\" && !this.xs && this.enablesXDR;\n  }\n\n  /**\n   * Aborts the request.\n   *\n   * @api public\n   */\n  abort() {\n    this.cleanup();\n  }\n}\n\n/**\n * Aborts pending requests when unloading the window. This is needed to prevent\n * memory leaks (e.g. when using IE) and to ensure that no spurious error is\n * emitted.\n */\n\nRequest.requestsCount = 0;\nRequest.requests = {};\n\nif (typeof document !== \"undefined\") {\n  if (typeof attachEvent === \"function\") {\n    attachEvent(\"onunload\", unloadHandler);\n  } else if (typeof addEventListener === \"function\") {\n    const terminationEvent = \"onpagehide\" in globalThis ? \"pagehide\" : \"unload\";\n    addEventListener(terminationEvent, unloadHandler, false);\n  }\n}\n\nfunction unloadHandler() {\n  for (let i in Request.requests) {\n    if (Request.requests.hasOwnProperty(i)) {\n      Request.requests[i].abort();\n    }\n  }\n}\n\nmodule.exports = XHR;\nmodule.exports.Request = Request;\n","const Transport = require(\"../transport\");\nconst parseqs = require(\"parseqs\");\nconst parser = require(\"engine.io-parser\");\nconst yeast = require(\"yeast\");\n\nconst debug = require(\"debug\")(\"engine.io-client:polling\");\n\nclass Polling extends Transport {\n  /**\n   * Transport name.\n   */\n  get name() {\n    return \"polling\";\n  }\n\n  /**\n   * Opens the socket (triggers polling). We write a PING message to determine\n   * when the transport is open.\n   *\n   * @api private\n   */\n  doOpen() {\n    this.poll();\n  }\n\n  /**\n   * Pauses polling.\n   *\n   * @param {Function} callback upon buffers are flushed and transport is paused\n   * @api private\n   */\n  pause(onPause) {\n    const self = this;\n\n    this.readyState = \"pausing\";\n\n    function pause() {\n      debug(\"paused\");\n      self.readyState = \"paused\";\n      onPause();\n    }\n\n    if (this.polling || !this.writable) {\n      let total = 0;\n\n      if (this.polling) {\n        debug(\"we are currently polling - waiting to pause\");\n        total++;\n        this.once(\"pollComplete\", function() {\n          debug(\"pre-pause polling complete\");\n          --total || pause();\n        });\n      }\n\n      if (!this.writable) {\n        debug(\"we are currently writing - waiting to pause\");\n        total++;\n        this.once(\"drain\", function() {\n          debug(\"pre-pause writing complete\");\n          --total || pause();\n        });\n      }\n    } else {\n      pause();\n    }\n  }\n\n  /**\n   * Starts polling cycle.\n   *\n   * @api public\n   */\n  poll() {\n    debug(\"polling\");\n    this.polling = true;\n    this.doPoll();\n    this.emit(\"poll\");\n  }\n\n  /**\n   * Overloads onData to detect payloads.\n   *\n   * @api private\n   */\n  onData(data) {\n    const self = this;\n    debug(\"polling got data %s\", data);\n    const callback = function(packet, index, total) {\n      // if its the first message we consider the transport open\n      if (\"opening\" === self.readyState && packet.type === \"open\") {\n        self.onOpen();\n      }\n\n      // if its a close packet, we close the ongoing requests\n      if (\"close\" === packet.type) {\n        self.onClose();\n        return false;\n      }\n\n      // otherwise bypass onData and handle the message\n      self.onPacket(packet);\n    };\n\n    // decode payload\n    parser.decodePayload(data, this.socket.binaryType).forEach(callback);\n\n    // if an event did not trigger closing\n    if (\"closed\" !== this.readyState) {\n      // if we got data we're not polling\n      this.polling = false;\n      this.emit(\"pollComplete\");\n\n      if (\"open\" === this.readyState) {\n        this.poll();\n      } else {\n        debug('ignoring poll - transport state \"%s\"', this.readyState);\n      }\n    }\n  }\n\n  /**\n   * For polling, send a close packet.\n   *\n   * @api private\n   */\n  doClose() {\n    const self = this;\n\n    function close() {\n      debug(\"writing close packet\");\n      self.write([{ type: \"close\" }]);\n    }\n\n    if (\"open\" === this.readyState) {\n      debug(\"transport open - closing\");\n      close();\n    } else {\n      // in case we're trying to close while\n      // handshaking is in progress (GH-164)\n      debug(\"transport not open - deferring close\");\n      this.once(\"open\", close);\n    }\n  }\n\n  /**\n   * Writes a packets payload.\n   *\n   * @param {Array} data packets\n   * @param {Function} drain callback\n   * @api private\n   */\n  write(packets) {\n    this.writable = false;\n\n    parser.encodePayload(packets, data => {\n      this.doWrite(data, () => {\n        this.writable = true;\n        this.emit(\"drain\");\n      });\n    });\n  }\n\n  /**\n   * Generates uri for connection.\n   *\n   * @api private\n   */\n  uri() {\n    let query = this.query || {};\n    const schema = this.opts.secure ? \"https\" : \"http\";\n    let port = \"\";\n\n    // cache busting is forced\n    if (false !== this.opts.timestampRequests) {\n      query[this.opts.timestampParam] = yeast();\n    }\n\n    if (!this.supportsBinary && !query.sid) {\n      query.b64 = 1;\n    }\n\n    query = parseqs.encode(query);\n\n    // avoid port if default for schema\n    if (\n      this.opts.port &&\n      ((\"https\" === schema && Number(this.opts.port) !== 443) ||\n        (\"http\" === schema && Number(this.opts.port) !== 80))\n    ) {\n      port = \":\" + this.opts.port;\n    }\n\n    // prepend ? to query\n    if (query.length) {\n      query = \"?\" + query;\n    }\n\n    const ipv6 = this.opts.hostname.indexOf(\":\") !== -1;\n    return (\n      schema +\n      \"://\" +\n      (ipv6 ? \"[\" + this.opts.hostname + \"]\" : this.opts.hostname) +\n      port +\n      this.opts.path +\n      query\n    );\n  }\n}\n\nmodule.exports = Polling;\n","const parser = require(\"engine.io-parser\");\nconst Emitter = require(\"component-emitter\");\nconst debug = require(\"debug\")(\"engine.io-client:transport\");\n\nclass Transport extends Emitter {\n  /**\n   * Transport abstract constructor.\n   *\n   * @param {Object} options.\n   * @api private\n   */\n  constructor(opts) {\n    super();\n\n    this.opts = opts;\n    this.query = opts.query;\n    this.readyState = \"\";\n    this.socket = opts.socket;\n  }\n\n  /**\n   * Emits an error.\n   *\n   * @param {String} str\n   * @return {Transport} for chaining\n   * @api public\n   */\n  onError(msg, desc) {\n    const err = new Error(msg);\n    err.type = \"TransportError\";\n    err.description = desc;\n    this.emit(\"error\", err);\n    return this;\n  }\n\n  /**\n   * Opens the transport.\n   *\n   * @api public\n   */\n  open() {\n    if (\"closed\" === this.readyState || \"\" === this.readyState) {\n      this.readyState = \"opening\";\n      this.doOpen();\n    }\n\n    return this;\n  }\n\n  /**\n   * Closes the transport.\n   *\n   * @api private\n   */\n  close() {\n    if (\"opening\" === this.readyState || \"open\" === this.readyState) {\n      this.doClose();\n      this.onClose();\n    }\n\n    return this;\n  }\n\n  /**\n   * Sends multiple packets.\n   *\n   * @param {Array} packets\n   * @api private\n   */\n  send(packets) {\n    if (\"open\" === this.readyState) {\n      this.write(packets);\n    } else {\n      // this might happen if the transport was silently closed in the beforeunload event handler\n      debug(\"transport is not open, discarding packets\");\n    }\n  }\n\n  /**\n   * Called upon open\n   *\n   * @api private\n   */\n  onOpen() {\n    this.readyState = \"open\";\n    this.writable = true;\n    this.emit(\"open\");\n  }\n\n  /**\n   * Called with data.\n   *\n   * @param {String} data\n   * @api private\n   */\n  onData(data) {\n    const packet = parser.decodePacket(data, this.socket.binaryType);\n    this.onPacket(packet);\n  }\n\n  /**\n   * Called with a decoded packet.\n   */\n  onPacket(packet) {\n    this.emit(\"packet\", packet);\n  }\n\n  /**\n   * Called upon close.\n   *\n   * @api private\n   */\n  onClose() {\n    this.readyState = \"closed\";\n    this.emit(\"close\");\n  }\n}\n\nmodule.exports = Transport;\n","const encodePacket = require(\"./encodePacket\");\nconst decodePacket = require(\"./decodePacket\");\n\nconst SEPARATOR = String.fromCharCode(30); // see https://en.wikipedia.org/wiki/Delimiter#ASCII_delimited_text\n\nconst encodePayload = (packets, callback) => {\n  // some packets may be added to the array while encoding, so the initial length must be saved\n  const length = packets.length;\n  const encodedPackets = new Array(length);\n  let count = 0;\n\n  packets.forEach((packet, i) => {\n    // force base64 encoding for binary packets\n    encodePacket(packet, false, encodedPacket => {\n      encodedPackets[i] = encodedPacket;\n      if (++count === length) {\n        callback(encodedPackets.join(SEPARATOR));\n      }\n    });\n  });\n};\n\nconst decodePayload = (encodedPayload, binaryType) => {\n  const encodedPackets = encodedPayload.split(SEPARATOR);\n  const packets = [];\n  for (let i = 0; i < encodedPackets.length; i++) {\n    const decodedPacket = decodePacket(encodedPackets[i], binaryType);\n    packets.push(decodedPacket);\n    if (decodedPacket.type === \"error\") {\n      break;\n    }\n  }\n  return packets;\n};\n\nmodule.exports = {\n  protocol: 4,\n  encodePacket,\n  encodePayload,\n  decodePacket,\n  decodePayload\n};\n","const { PACKET_TYPES } = require(\"./commons\");\n\nconst withNativeBlob =\n  typeof Blob === \"function\" ||\n  (typeof Blob !== \"undefined\" &&\n    Object.prototype.toString.call(Blob) === \"[object BlobConstructor]\");\nconst withNativeArrayBuffer = typeof ArrayBuffer === \"function\";\n\n// ArrayBuffer.isView method is not defined in IE10\nconst isView = obj => {\n  return typeof ArrayBuffer.isView === \"function\"\n    ? ArrayBuffer.isView(obj)\n    : obj && obj.buffer instanceof ArrayBuffer;\n};\n\nconst encodePacket = ({ type, data }, supportsBinary, callback) => {\n  if (withNativeBlob && data instanceof Blob) {\n    if (supportsBinary) {\n      return callback(data);\n    } else {\n      return encodeBlobAsBase64(data, callback);\n    }\n  } else if (\n    withNativeArrayBuffer &&\n    (data instanceof ArrayBuffer || isView(data))\n  ) {\n    if (supportsBinary) {\n      return callback(data instanceof ArrayBuffer ? data : data.buffer);\n    } else {\n      return encodeBlobAsBase64(new Blob([data]), callback);\n    }\n  }\n  // plain string\n  return callback(PACKET_TYPES[type] + (data || \"\"));\n};\n\nconst encodeBlobAsBase64 = (data, callback) => {\n  const fileReader = new FileReader();\n  fileReader.onload = function() {\n    const content = fileReader.result.split(\",\")[1];\n    callback(\"b\" + content);\n  };\n  return fileReader.readAsDataURL(data);\n};\n\nmodule.exports = encodePacket;\n","const PACKET_TYPES = Object.create(null); // no Map = no polyfill\nPACKET_TYPES[\"open\"] = \"0\";\nPACKET_TYPES[\"close\"] = \"1\";\nPACKET_TYPES[\"ping\"] = \"2\";\nPACKET_TYPES[\"pong\"] = \"3\";\nPACKET_TYPES[\"message\"] = \"4\";\nPACKET_TYPES[\"upgrade\"] = \"5\";\nPACKET_TYPES[\"noop\"] = \"6\";\n\nconst PACKET_TYPES_REVERSE = Object.create(null);\nObject.keys(PACKET_TYPES).forEach(key => {\n  PACKET_TYPES_REVERSE[PACKET_TYPES[key]] = key;\n});\n\nconst ERROR_PACKET = { type: \"error\", data: \"parser error\" };\n\nmodule.exports = {\n  PACKET_TYPES,\n  PACKET_TYPES_REVERSE,\n  ERROR_PACKET\n};\n","const { PACKET_TYPES_REVERSE, ERROR_PACKET } = require(\"./commons\");\n\nconst withNativeArrayBuffer = typeof ArrayBuffer === \"function\";\n\nlet base64decoder;\nif (withNativeArrayBuffer) {\n  base64decoder = require(\"base64-arraybuffer\");\n}\n\nconst decodePacket = (encodedPacket, binaryType) => {\n  if (typeof encodedPacket !== \"string\") {\n    return {\n      type: \"message\",\n      data: mapBinary(encodedPacket, binaryType)\n    };\n  }\n  const type = encodedPacket.charAt(0);\n  if (type === \"b\") {\n    return {\n      type: \"message\",\n      data: decodeBase64Packet(encodedPacket.substring(1), binaryType)\n    };\n  }\n  const packetType = PACKET_TYPES_REVERSE[type];\n  if (!packetType) {\n    return ERROR_PACKET;\n  }\n  return encodedPacket.length > 1\n    ? {\n        type: PACKET_TYPES_REVERSE[type],\n        data: encodedPacket.substring(1)\n      }\n    : {\n        type: PACKET_TYPES_REVERSE[type]\n      };\n};\n\nconst decodeBase64Packet = (data, binaryType) => {\n  if (base64decoder) {\n    const decoded = base64decoder.decode(data);\n    return mapBinary(decoded, binaryType);\n  } else {\n    return { base64: true, data }; // fallback for old browsers\n  }\n};\n\nconst mapBinary = (data, binaryType) => {\n  switch (binaryType) {\n    case \"blob\":\n      return data instanceof ArrayBuffer ? new Blob([data]) : data;\n    case \"arraybuffer\":\n    default:\n      return data; // assuming the data is already an ArrayBuffer\n  }\n};\n\nmodule.exports = decodePacket;\n","/*\n * base64-arraybuffer\n * https://github.com/niklasvh/base64-arraybuffer\n *\n * Copyright (c) 2012 Niklas von Hertzen\n * Licensed under the MIT license.\n */\n(function(chars){\n  \"use strict\";\n\n  exports.encode = function(arraybuffer) {\n    var bytes = new Uint8Array(arraybuffer),\n    i, len = bytes.length, base64 = \"\";\n\n    for (i = 0; i < len; i+=3) {\n      base64 += chars[bytes[i] >> 2];\n      base64 += chars[((bytes[i] & 3) << 4) | (bytes[i + 1] >> 4)];\n      base64 += chars[((bytes[i + 1] & 15) << 2) | (bytes[i + 2] >> 6)];\n      base64 += chars[bytes[i + 2] & 63];\n    }\n\n    if ((len % 3) === 2) {\n      base64 = base64.substring(0, base64.length - 1) + \"=\";\n    } else if (len % 3 === 1) {\n      base64 = base64.substring(0, base64.length - 2) + \"==\";\n    }\n\n    return base64;\n  };\n\n  exports.decode =  function(base64) {\n    var bufferLength = base64.length * 0.75,\n    len = base64.length, i, p = 0,\n    encoded1, encoded2, encoded3, encoded4;\n\n    if (base64[base64.length - 1] === \"=\") {\n      bufferLength--;\n      if (base64[base64.length - 2] === \"=\") {\n        bufferLength--;\n      }\n    }\n\n    var arraybuffer = new ArrayBuffer(bufferLength),\n    bytes = new Uint8Array(arraybuffer);\n\n    for (i = 0; i < len; i+=4) {\n      encoded1 = chars.indexOf(base64[i]);\n      encoded2 = chars.indexOf(base64[i+1]);\n      encoded3 = chars.indexOf(base64[i+2]);\n      encoded4 = chars.indexOf(base64[i+3]);\n\n      bytes[p++] = (encoded1 << 2) | (encoded2 >> 4);\n      bytes[p++] = ((encoded2 & 15) << 4) | (encoded3 >> 2);\n      bytes[p++] = ((encoded3 & 3) << 6) | (encoded4 & 63);\n    }\n\n    return arraybuffer;\n  };\n})(\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\");\n","\r\n/**\r\n * Expose `Emitter`.\r\n */\r\n\r\nif (typeof module !== 'undefined') {\r\n  module.exports = Emitter;\r\n}\r\n\r\n/**\r\n * Initialize a new `Emitter`.\r\n *\r\n * @api public\r\n */\r\n\r\nfunction Emitter(obj) {\r\n  if (obj) return mixin(obj);\r\n};\r\n\r\n/**\r\n * Mixin the emitter properties.\r\n *\r\n * @param {Object} obj\r\n * @return {Object}\r\n * @api private\r\n */\r\n\r\nfunction mixin(obj) {\r\n  for (var key in Emitter.prototype) {\r\n    obj[key] = Emitter.prototype[key];\r\n  }\r\n  return obj;\r\n}\r\n\r\n/**\r\n * Listen on the given `event` with `fn`.\r\n *\r\n * @param {String} event\r\n * @param {Function} fn\r\n * @return {Emitter}\r\n * @api public\r\n */\r\n\r\nEmitter.prototype.on =\r\nEmitter.prototype.addEventListener = function(event, fn){\r\n  this._callbacks = this._callbacks || {};\r\n  (this._callbacks['$' + event] = this._callbacks['$' + event] || [])\r\n    .push(fn);\r\n  return this;\r\n};\r\n\r\n/**\r\n * Adds an `event` listener that will be invoked a single\r\n * time then automatically removed.\r\n *\r\n * @param {String} event\r\n * @param {Function} fn\r\n * @return {Emitter}\r\n * @api public\r\n */\r\n\r\nEmitter.prototype.once = function(event, fn){\r\n  function on() {\r\n    this.off(event, on);\r\n    fn.apply(this, arguments);\r\n  }\r\n\r\n  on.fn = fn;\r\n  this.on(event, on);\r\n  return this;\r\n};\r\n\r\n/**\r\n * Remove the given callback for `event` or all\r\n * registered callbacks.\r\n *\r\n * @param {String} event\r\n * @param {Function} fn\r\n * @return {Emitter}\r\n * @api public\r\n */\r\n\r\nEmitter.prototype.off =\r\nEmitter.prototype.removeListener =\r\nEmitter.prototype.removeAllListeners =\r\nEmitter.prototype.removeEventListener = function(event, fn){\r\n  this._callbacks = this._callbacks || {};\r\n\r\n  // all\r\n  if (0 == arguments.length) {\r\n    this._callbacks = {};\r\n    return this;\r\n  }\r\n\r\n  // specific event\r\n  var callbacks = this._callbacks['$' + event];\r\n  if (!callbacks) return this;\r\n\r\n  // remove all handlers\r\n  if (1 == arguments.length) {\r\n    delete this._callbacks['$' + event];\r\n    return this;\r\n  }\r\n\r\n  // remove specific handler\r\n  var cb;\r\n  for (var i = 0; i < callbacks.length; i++) {\r\n    cb = callbacks[i];\r\n    if (cb === fn || cb.fn === fn) {\r\n      callbacks.splice(i, 1);\r\n      break;\r\n    }\r\n  }\r\n\r\n  // Remove event specific arrays for event types that no\r\n  // one is subscribed for to avoid memory leak.\r\n  if (callbacks.length === 0) {\r\n    delete this._callbacks['$' + event];\r\n  }\r\n\r\n  return this;\r\n};\r\n\r\n/**\r\n * Emit `event` with the given args.\r\n *\r\n * @param {String} event\r\n * @param {Mixed} ...\r\n * @return {Emitter}\r\n */\r\n\r\nEmitter.prototype.emit = function(event){\r\n  this._callbacks = this._callbacks || {};\r\n\r\n  var args = new Array(arguments.length - 1)\r\n    , callbacks = this._callbacks['$' + event];\r\n\r\n  for (var i = 1; i < arguments.length; i++) {\r\n    args[i - 1] = arguments[i];\r\n  }\r\n\r\n  if (callbacks) {\r\n    callbacks = callbacks.slice(0);\r\n    for (var i = 0, len = callbacks.length; i < len; ++i) {\r\n      callbacks[i].apply(this, args);\r\n    }\r\n  }\r\n\r\n  return this;\r\n};\r\n\r\n/**\r\n * Return array of callbacks for `event`.\r\n *\r\n * @param {String} event\r\n * @return {Array}\r\n * @api public\r\n */\r\n\r\nEmitter.prototype.listeners = function(event){\r\n  this._callbacks = this._callbacks || {};\r\n  return this._callbacks['$' + event] || [];\r\n};\r\n\r\n/**\r\n * Check if this emitter has `event` handlers.\r\n *\r\n * @param {String} event\r\n * @return {Boolean}\r\n * @api public\r\n */\r\n\r\nEmitter.prototype.hasListeners = function(event){\r\n  return !! this.listeners(event).length;\r\n};\r\n","/**\n * Compiles a querystring\n * Returns string representation of the object\n *\n * @param {Object}\n * @api private\n */\n\nexports.encode = function (obj) {\n  var str = '';\n\n  for (var i in obj) {\n    if (obj.hasOwnProperty(i)) {\n      if (str.length) str += '&';\n      str += encodeURIComponent(i) + '=' + encodeURIComponent(obj[i]);\n    }\n  }\n\n  return str;\n};\n\n/**\n * Parses a simple querystring into an object\n *\n * @param {String} qs\n * @api private\n */\n\nexports.decode = function(qs){\n  var qry = {};\n  var pairs = qs.split('&');\n  for (var i = 0, l = pairs.length; i < l; i++) {\n    var pair = pairs[i].split('=');\n    qry[decodeURIComponent(pair[0])] = decodeURIComponent(pair[1]);\n  }\n  return qry;\n};\n","'use strict';\n\nvar alphabet = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz-_'.split('')\n  , length = 64\n  , map = {}\n  , seed = 0\n  , i = 0\n  , prev;\n\n/**\n * Return a string representing the specified number.\n *\n * @param {Number} num The number to convert.\n * @returns {String} The string representation of the number.\n * @api public\n */\nfunction encode(num) {\n  var encoded = '';\n\n  do {\n    encoded = alphabet[num % length] + encoded;\n    num = Math.floor(num / length);\n  } while (num > 0);\n\n  return encoded;\n}\n\n/**\n * Return the integer value specified by the given string.\n *\n * @param {String} str The string to convert.\n * @returns {Number} The integer value represented by the string.\n * @api public\n */\nfunction decode(str) {\n  var decoded = 0;\n\n  for (i = 0; i < str.length; i++) {\n    decoded = decoded * length + map[str.charAt(i)];\n  }\n\n  return decoded;\n}\n\n/**\n * Yeast: A tiny growing id generator.\n *\n * @returns {String} A unique id.\n * @api public\n */\nfunction yeast() {\n  var now = encode(+new Date());\n\n  if (now !== prev) return seed = 0, prev = now;\n  return now +'.'+ encode(seed++);\n}\n\n//\n// Map each character to its index.\n//\nfor (; i < length; i++) map[alphabet[i]] = i;\n\n//\n// Expose the `yeast`, `encode` and `decode` functions.\n//\nyeast.encode = encode;\nyeast.decode = decode;\nmodule.exports = yeast;\n","module.exports.pick = (obj, ...attr) => {\n  return attr.reduce((acc, k) => {\n    if (obj.hasOwnProperty(k)) {\n      acc[k] = obj[k];\n    }\n    return acc;\n  }, {});\n};\n","const Polling = require(\"./polling\");\nconst globalThis = require(\"../globalThis\");\n\nconst rNewline = /\\n/g;\nconst rEscapedNewline = /\\\\n/g;\n\n/**\n * Global JSONP callbacks.\n */\n\nlet callbacks;\n\nclass JSONPPolling extends Polling {\n  /**\n   * JSONP Polling constructor.\n   *\n   * @param {Object} opts.\n   * @api public\n   */\n  constructor(opts) {\n    super(opts);\n\n    this.query = this.query || {};\n\n    // define global callbacks array if not present\n    // we do this here (lazily) to avoid unneeded global pollution\n    if (!callbacks) {\n      // we need to consider multiple engines in the same page\n      callbacks = globalThis.___eio = globalThis.___eio || [];\n    }\n\n    // callback identifier\n    this.index = callbacks.length;\n\n    // add callback to jsonp global\n    const self = this;\n    callbacks.push(function(msg) {\n      self.onData(msg);\n    });\n\n    // append to query string\n    this.query.j = this.index;\n  }\n\n  /**\n   * JSONP only supports binary as base64 encoded strings\n   */\n  get supportsBinary() {\n    return false;\n  }\n\n  /**\n   * Closes the socket.\n   *\n   * @api private\n   */\n  doClose() {\n    if (this.script) {\n      // prevent spurious errors from being emitted when the window is unloaded\n      this.script.onerror = () => {};\n      this.script.parentNode.removeChild(this.script);\n      this.script = null;\n    }\n\n    if (this.form) {\n      this.form.parentNode.removeChild(this.form);\n      this.form = null;\n      this.iframe = null;\n    }\n\n    super.doClose();\n  }\n\n  /**\n   * Starts a poll cycle.\n   *\n   * @api private\n   */\n  doPoll() {\n    const self = this;\n    const script = document.createElement(\"script\");\n\n    if (this.script) {\n      this.script.parentNode.removeChild(this.script);\n      this.script = null;\n    }\n\n    script.async = true;\n    script.src = this.uri();\n    script.onerror = function(e) {\n      self.onError(\"jsonp poll error\", e);\n    };\n\n    const insertAt = document.getElementsByTagName(\"script\")[0];\n    if (insertAt) {\n      insertAt.parentNode.insertBefore(script, insertAt);\n    } else {\n      (document.head || document.body).appendChild(script);\n    }\n    this.script = script;\n\n    const isUAgecko =\n      \"undefined\" !== typeof navigator && /gecko/i.test(navigator.userAgent);\n\n    if (isUAgecko) {\n      setTimeout(function() {\n        const iframe = document.createElement(\"iframe\");\n        document.body.appendChild(iframe);\n        document.body.removeChild(iframe);\n      }, 100);\n    }\n  }\n\n  /**\n   * Writes with a hidden iframe.\n   *\n   * @param {String} data to send\n   * @param {Function} called upon flush.\n   * @api private\n   */\n  doWrite(data, fn) {\n    const self = this;\n    let iframe;\n\n    if (!this.form) {\n      const form = document.createElement(\"form\");\n      const area = document.createElement(\"textarea\");\n      const id = (this.iframeId = \"eio_iframe_\" + this.index);\n\n      form.className = \"socketio\";\n      form.style.position = \"absolute\";\n      form.style.top = \"-1000px\";\n      form.style.left = \"-1000px\";\n      form.target = id;\n      form.method = \"POST\";\n      form.setAttribute(\"accept-charset\", \"utf-8\");\n      area.name = \"d\";\n      form.appendChild(area);\n      document.body.appendChild(form);\n\n      this.form = form;\n      this.area = area;\n    }\n\n    this.form.action = this.uri();\n\n    function complete() {\n      initIframe();\n      fn();\n    }\n\n    function initIframe() {\n      if (self.iframe) {\n        try {\n          self.form.removeChild(self.iframe);\n        } catch (e) {\n          self.onError(\"jsonp polling iframe removal error\", e);\n        }\n      }\n\n      try {\n        // ie6 dynamic iframes with target=\"\" support (thanks Chris Lambacher)\n        const html = '<iframe src=\"javascript:0\" name=\"' + self.iframeId + '\">';\n        iframe = document.createElement(html);\n      } catch (e) {\n        iframe = document.createElement(\"iframe\");\n        iframe.name = self.iframeId;\n        iframe.src = \"javascript:0\";\n      }\n\n      iframe.id = self.iframeId;\n\n      self.form.appendChild(iframe);\n      self.iframe = iframe;\n    }\n\n    initIframe();\n\n    // escape \\n to prevent it from being converted into \\r\\n by some UAs\n    // double escaping is required for escaped new lines because unescaping of new lines can be done safely on server-side\n    data = data.replace(rEscapedNewline, \"\\\\\\n\");\n    this.area.value = data.replace(rNewline, \"\\\\n\");\n\n    try {\n      this.form.submit();\n    } catch (e) {}\n\n    if (this.iframe.attachEvent) {\n      this.iframe.onreadystatechange = function() {\n        if (self.iframe.readyState === \"complete\") {\n          complete();\n        }\n      };\n    } else {\n      this.iframe.onload = complete;\n    }\n  }\n}\n\nmodule.exports = JSONPPolling;\n","const Transport = require(\"../transport\");\nconst parser = require(\"engine.io-parser\");\nconst parseqs = require(\"parseqs\");\nconst yeast = require(\"yeast\");\nconst { pick } = require(\"../util\");\nconst {\n  WebSocket,\n  usingBrowserWebSocket,\n  defaultBinaryType\n} = require(\"./websocket-constructor\");\n\nconst debug = require(\"debug\")(\"engine.io-client:websocket\");\n\n// detect ReactNative environment\nconst isReactNative =\n  typeof navigator !== \"undefined\" &&\n  typeof navigator.product === \"string\" &&\n  navigator.product.toLowerCase() === \"reactnative\";\n\nclass WS extends Transport {\n  /**\n   * WebSocket transport constructor.\n   *\n   * @api {Object} connection options\n   * @api public\n   */\n  constructor(opts) {\n    super(opts);\n\n    this.supportsBinary = !opts.forceBase64;\n  }\n\n  /**\n   * Transport name.\n   *\n   * @api public\n   */\n  get name() {\n    return \"websocket\";\n  }\n\n  /**\n   * Opens socket.\n   *\n   * @api private\n   */\n  doOpen() {\n    if (!this.check()) {\n      // let probe timeout\n      return;\n    }\n\n    const uri = this.uri();\n    const protocols = this.opts.protocols;\n\n    // React Native only supports the 'headers' option, and will print a warning if anything else is passed\n    const opts = isReactNative\n      ? {}\n      : pick(\n          this.opts,\n          \"agent\",\n          \"perMessageDeflate\",\n          \"pfx\",\n          \"key\",\n          \"passphrase\",\n          \"cert\",\n          \"ca\",\n          \"ciphers\",\n          \"rejectUnauthorized\",\n          \"localAddress\",\n          \"protocolVersion\",\n          \"origin\",\n          \"maxPayload\",\n          \"family\",\n          \"checkServerIdentity\"\n        );\n\n    if (this.opts.extraHeaders) {\n      opts.headers = this.opts.extraHeaders;\n    }\n\n    try {\n      this.ws =\n        usingBrowserWebSocket && !isReactNative\n          ? protocols\n            ? new WebSocket(uri, protocols)\n            : new WebSocket(uri)\n          : new WebSocket(uri, protocols, opts);\n    } catch (err) {\n      return this.emit(\"error\", err);\n    }\n\n    this.ws.binaryType = this.socket.binaryType || defaultBinaryType;\n\n    this.addEventListeners();\n  }\n\n  /**\n   * Adds event listeners to the socket\n   *\n   * @api private\n   */\n  addEventListeners() {\n    const self = this;\n\n    this.ws.onopen = function() {\n      self.onOpen();\n    };\n    this.ws.onclose = function() {\n      self.onClose();\n    };\n    this.ws.onmessage = function(ev) {\n      self.onData(ev.data);\n    };\n    this.ws.onerror = function(e) {\n      self.onError(\"websocket error\", e);\n    };\n  }\n\n  /**\n   * Writes data to socket.\n   *\n   * @param {Array} array of packets.\n   * @api private\n   */\n  write(packets) {\n    const self = this;\n    this.writable = false;\n\n    // encodePacket efficient as it uses WS framing\n    // no need for encodePayload\n    let total = packets.length;\n    let i = 0;\n    const l = total;\n    for (; i < l; i++) {\n      (function(packet) {\n        parser.encodePacket(packet, self.supportsBinary, function(data) {\n          // always create a new object (GH-437)\n          const opts = {};\n          if (!usingBrowserWebSocket) {\n            if (packet.options) {\n              opts.compress = packet.options.compress;\n            }\n\n            if (self.opts.perMessageDeflate) {\n              const len =\n                \"string\" === typeof data\n                  ? Buffer.byteLength(data)\n                  : data.length;\n              if (len < self.opts.perMessageDeflate.threshold) {\n                opts.compress = false;\n              }\n            }\n          }\n\n          // Sometimes the websocket has already been closed but the browser didn't\n          // have a chance of informing us about it yet, in that case send will\n          // throw an error\n          try {\n            if (usingBrowserWebSocket) {\n              // TypeError is thrown when passing the second argument on Safari\n              self.ws.send(data);\n            } else {\n              self.ws.send(data, opts);\n            }\n          } catch (e) {\n            debug(\"websocket closed before onclose event\");\n          }\n\n          --total || done();\n        });\n      })(packets[i]);\n    }\n\n    function done() {\n      self.emit(\"flush\");\n\n      // fake drain\n      // defer to next tick to allow Socket to clear writeBuffer\n      setTimeout(function() {\n        self.writable = true;\n        self.emit(\"drain\");\n      }, 0);\n    }\n  }\n\n  /**\n   * Called upon close\n   *\n   * @api private\n   */\n  onClose() {\n    Transport.prototype.onClose.call(this);\n  }\n\n  /**\n   * Closes socket.\n   *\n   * @api private\n   */\n  doClose() {\n    if (typeof this.ws !== \"undefined\") {\n      this.ws.close();\n      this.ws = null;\n    }\n  }\n\n  /**\n   * Generates uri for connection.\n   *\n   * @api private\n   */\n  uri() {\n    let query = this.query || {};\n    const schema = this.opts.secure ? \"wss\" : \"ws\";\n    let port = \"\";\n\n    // avoid port if default for schema\n    if (\n      this.opts.port &&\n      ((\"wss\" === schema && Number(this.opts.port) !== 443) ||\n        (\"ws\" === schema && Number(this.opts.port) !== 80))\n    ) {\n      port = \":\" + this.opts.port;\n    }\n\n    // append timestamp to URI\n    if (this.opts.timestampRequests) {\n      query[this.opts.timestampParam] = yeast();\n    }\n\n    // communicate binary support capabilities\n    if (!this.supportsBinary) {\n      query.b64 = 1;\n    }\n\n    query = parseqs.encode(query);\n\n    // prepend ? to query\n    if (query.length) {\n      query = \"?\" + query;\n    }\n\n    const ipv6 = this.opts.hostname.indexOf(\":\") !== -1;\n    return (\n      schema +\n      \"://\" +\n      (ipv6 ? \"[\" + this.opts.hostname + \"]\" : this.opts.hostname) +\n      port +\n      this.opts.path +\n      query\n    );\n  }\n\n  /**\n   * Feature detection for WebSocket.\n   *\n   * @return {Boolean} whether this transport is available.\n   * @api public\n   */\n  check() {\n    return (\n      !!WebSocket &&\n      !(\"__initialize\" in WebSocket && this.name === WS.prototype.name)\n    );\n  }\n}\n\nmodule.exports = WS;\n","const globalThis = require(\"../globalThis\");\n\nmodule.exports = {\n  WebSocket: globalThis.WebSocket || globalThis.MozWebSocket,\n  usingBrowserWebSocket: true,\n  defaultBinaryType: \"arraybuffer\"\n};\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Socket = void 0;\nconst socket_io_parser_1 = require(\"socket.io-parser\");\nconst Emitter = require(\"component-emitter\");\nconst on_1 = require(\"./on\");\nconst debug = require(\"debug\")(\"socket.io-client:socket\");\n/**\n * Internal events.\n * These events can't be emitted by the user.\n */\nconst RESERVED_EVENTS = Object.freeze({\n    connect: 1,\n    connect_error: 1,\n    disconnect: 1,\n    disconnecting: 1,\n    // EventEmitter reserved events: https://nodejs.org/api/events.html#events_event_newlistener\n    newListener: 1,\n    removeListener: 1,\n});\nclass Socket extends Emitter {\n    /**\n     * `Socket` constructor.\n     *\n     * @public\n     */\n    constructor(io, nsp, opts) {\n        super();\n        this.receiveBuffer = [];\n        this.sendBuffer = [];\n        this.ids = 0;\n        this.acks = {};\n        this.flags = {};\n        this.io = io;\n        this.nsp = nsp;\n        this.ids = 0;\n        this.acks = {};\n        this.receiveBuffer = [];\n        this.sendBuffer = [];\n        this.connected = false;\n        this.disconnected = true;\n        this.flags = {};\n        if (opts && opts.auth) {\n            this.auth = opts.auth;\n        }\n        if (this.io._autoConnect)\n            this.open();\n    }\n    /**\n     * Subscribe to open, close and packet events\n     *\n     * @private\n     */\n    subEvents() {\n        if (this.subs)\n            return;\n        const io = this.io;\n        this.subs = [\n            on_1.on(io, \"open\", this.onopen.bind(this)),\n            on_1.on(io, \"packet\", this.onpacket.bind(this)),\n            on_1.on(io, \"error\", this.onerror.bind(this)),\n            on_1.on(io, \"close\", this.onclose.bind(this)),\n        ];\n    }\n    /**\n     * Whether the Socket will try to reconnect when its Manager connects or reconnects\n     */\n    get active() {\n        return !!this.subs;\n    }\n    /**\n     * \"Opens\" the socket.\n     *\n     * @public\n     */\n    connect() {\n        if (this.connected)\n            return this;\n        this.subEvents();\n        if (!this.io[\"_reconnecting\"])\n            this.io.open(); // ensure open\n        if (\"open\" === this.io._readyState)\n            this.onopen();\n        return this;\n    }\n    /**\n     * Alias for connect()\n     */\n    open() {\n        return this.connect();\n    }\n    /**\n     * Sends a `message` event.\n     *\n     * @return self\n     * @public\n     */\n    send(...args) {\n        args.unshift(\"message\");\n        this.emit.apply(this, args);\n        return this;\n    }\n    /**\n     * Override `emit`.\n     * If the event is in `events`, it's emitted normally.\n     *\n     * @param ev - event name\n     * @return self\n     * @public\n     */\n    emit(ev, ...args) {\n        if (RESERVED_EVENTS.hasOwnProperty(ev)) {\n            throw new Error('\"' + ev + '\" is a reserved event name');\n        }\n        args.unshift(ev);\n        const packet = {\n            type: socket_io_parser_1.PacketType.EVENT,\n            data: args,\n        };\n        packet.options = {};\n        packet.options.compress = this.flags.compress !== false;\n        // event ack callback\n        if (\"function\" === typeof args[args.length - 1]) {\n            debug(\"emitting packet with ack id %d\", this.ids);\n            this.acks[this.ids] = args.pop();\n            packet.id = this.ids++;\n        }\n        const isTransportWritable = this.io.engine &&\n            this.io.engine.transport &&\n            this.io.engine.transport.writable;\n        const discardPacket = this.flags.volatile && (!isTransportWritable || !this.connected);\n        if (discardPacket) {\n            debug(\"discard packet as the transport is not currently writable\");\n        }\n        else if (this.connected) {\n            this.packet(packet);\n        }\n        else {\n            this.sendBuffer.push(packet);\n        }\n        this.flags = {};\n        return this;\n    }\n    /**\n     * Sends a packet.\n     *\n     * @param packet\n     * @private\n     */\n    packet(packet) {\n        packet.nsp = this.nsp;\n        this.io._packet(packet);\n    }\n    /**\n     * Called upon engine `open`.\n     *\n     * @private\n     */\n    onopen() {\n        debug(\"transport is open - connecting\");\n        if (typeof this.auth == \"function\") {\n            this.auth((data) => {\n                this.packet({ type: socket_io_parser_1.PacketType.CONNECT, data });\n            });\n        }\n        else {\n            this.packet({ type: socket_io_parser_1.PacketType.CONNECT, data: this.auth });\n        }\n    }\n    /**\n     * Called upon engine or manager `error`.\n     *\n     * @param err\n     * @private\n     */\n    onerror(err) {\n        if (!this.connected) {\n            super.emit(\"connect_error\", err);\n        }\n    }\n    /**\n     * Called upon engine `close`.\n     *\n     * @param reason\n     * @private\n     */\n    onclose(reason) {\n        debug(\"close (%s)\", reason);\n        this.connected = false;\n        this.disconnected = true;\n        delete this.id;\n        super.emit(\"disconnect\", reason);\n    }\n    /**\n     * Called with socket packet.\n     *\n     * @param packet\n     * @private\n     */\n    onpacket(packet) {\n        const sameNamespace = packet.nsp === this.nsp;\n        if (!sameNamespace)\n            return;\n        switch (packet.type) {\n            case socket_io_parser_1.PacketType.CONNECT:\n                if (packet.data && packet.data.sid) {\n                    const id = packet.data.sid;\n                    this.onconnect(id);\n                }\n                else {\n                    super.emit(\"connect_error\", new Error(\"It seems you are trying to reach a Socket.IO server in v2.x with a v3.x client, but they are not compatible (more information here: https://socket.io/docs/v3/migrating-from-2-x-to-3-0/)\"));\n                }\n                break;\n            case socket_io_parser_1.PacketType.EVENT:\n                this.onevent(packet);\n                break;\n            case socket_io_parser_1.PacketType.BINARY_EVENT:\n                this.onevent(packet);\n                break;\n            case socket_io_parser_1.PacketType.ACK:\n                this.onack(packet);\n                break;\n            case socket_io_parser_1.PacketType.BINARY_ACK:\n                this.onack(packet);\n                break;\n            case socket_io_parser_1.PacketType.DISCONNECT:\n                this.ondisconnect();\n                break;\n            case socket_io_parser_1.PacketType.CONNECT_ERROR:\n                const err = new Error(packet.data.message);\n                // @ts-ignore\n                err.data = packet.data.data;\n                super.emit(\"connect_error\", err);\n                break;\n        }\n    }\n    /**\n     * Called upon a server event.\n     *\n     * @param packet\n     * @private\n     */\n    onevent(packet) {\n        const args = packet.data || [];\n        debug(\"emitting event %j\", args);\n        if (null != packet.id) {\n            debug(\"attaching ack callback to event\");\n            args.push(this.ack(packet.id));\n        }\n        if (this.connected) {\n            this.emitEvent(args);\n        }\n        else {\n            this.receiveBuffer.push(Object.freeze(args));\n        }\n    }\n    emitEvent(args) {\n        if (this._anyListeners && this._anyListeners.length) {\n            const listeners = this._anyListeners.slice();\n            for (const listener of listeners) {\n                listener.apply(this, args);\n            }\n        }\n        super.emit.apply(this, args);\n    }\n    /**\n     * Produces an ack callback to emit with an event.\n     *\n     * @private\n     */\n    ack(id) {\n        const self = this;\n        let sent = false;\n        return function (...args) {\n            // prevent double callbacks\n            if (sent)\n                return;\n            sent = true;\n            debug(\"sending ack %j\", args);\n            self.packet({\n                type: socket_io_parser_1.PacketType.ACK,\n                id: id,\n                data: args,\n            });\n        };\n    }\n    /**\n     * Called upon a server acknowlegement.\n     *\n     * @param packet\n     * @private\n     */\n    onack(packet) {\n        const ack = this.acks[packet.id];\n        if (\"function\" === typeof ack) {\n            debug(\"calling ack %s with %j\", packet.id, packet.data);\n            ack.apply(this, packet.data);\n            delete this.acks[packet.id];\n        }\n        else {\n            debug(\"bad ack %s\", packet.id);\n        }\n    }\n    /**\n     * Called upon server connect.\n     *\n     * @private\n     */\n    onconnect(id) {\n        debug(\"socket connected with id %s\", id);\n        this.id = id;\n        this.connected = true;\n        this.disconnected = false;\n        super.emit(\"connect\");\n        this.emitBuffered();\n    }\n    /**\n     * Emit buffered events (received and emitted).\n     *\n     * @private\n     */\n    emitBuffered() {\n        this.receiveBuffer.forEach((args) => this.emitEvent(args));\n        this.receiveBuffer = [];\n        this.sendBuffer.forEach((packet) => this.packet(packet));\n        this.sendBuffer = [];\n    }\n    /**\n     * Called upon server disconnect.\n     *\n     * @private\n     */\n    ondisconnect() {\n        debug(\"server disconnect (%s)\", this.nsp);\n        this.destroy();\n        this.onclose(\"io server disconnect\");\n    }\n    /**\n     * Called upon forced client/server side disconnections,\n     * this method ensures the manager stops tracking us and\n     * that reconnections don't get triggered for this.\n     *\n     * @private\n     */\n    destroy() {\n        if (this.subs) {\n            // clean subscriptions to avoid reconnections\n            this.subs.forEach((subDestroy) => subDestroy());\n            this.subs = undefined;\n        }\n        this.io[\"_destroy\"](this);\n    }\n    /**\n     * Disconnects the socket manually.\n     *\n     * @return self\n     * @public\n     */\n    disconnect() {\n        if (this.connected) {\n            debug(\"performing disconnect (%s)\", this.nsp);\n            this.packet({ type: socket_io_parser_1.PacketType.DISCONNECT });\n        }\n        // remove socket from pool\n        this.destroy();\n        if (this.connected) {\n            // fire events\n            this.onclose(\"io client disconnect\");\n        }\n        return this;\n    }\n    /**\n     * Alias for disconnect()\n     *\n     * @return self\n     * @public\n     */\n    close() {\n        return this.disconnect();\n    }\n    /**\n     * Sets the compress flag.\n     *\n     * @param compress - if `true`, compresses the sending data\n     * @return self\n     * @public\n     */\n    compress(compress) {\n        this.flags.compress = compress;\n        return this;\n    }\n    /**\n     * Sets a modifier for a subsequent event emission that the event message will be dropped when this socket is not\n     * ready to send messages.\n     *\n     * @returns self\n     * @public\n     */\n    get volatile() {\n        this.flags.volatile = true;\n        return this;\n    }\n    /**\n     * Adds a listener that will be fired when any event is emitted. The event name is passed as the first argument to the\n     * callback.\n     *\n     * @param listener\n     * @public\n     */\n    onAny(listener) {\n        this._anyListeners = this._anyListeners || [];\n        this._anyListeners.push(listener);\n        return this;\n    }\n    /**\n     * Adds a listener that will be fired when any event is emitted. The event name is passed as the first argument to the\n     * callback. The listener is added to the beginning of the listeners array.\n     *\n     * @param listener\n     * @public\n     */\n    prependAny(listener) {\n        this._anyListeners = this._anyListeners || [];\n        this._anyListeners.unshift(listener);\n        return this;\n    }\n    /**\n     * Removes the listener that will be fired when any event is emitted.\n     *\n     * @param listener\n     * @public\n     */\n    offAny(listener) {\n        if (!this._anyListeners) {\n            return this;\n        }\n        if (listener) {\n            const listeners = this._anyListeners;\n            for (let i = 0; i < listeners.length; i++) {\n                if (listener === listeners[i]) {\n                    listeners.splice(i, 1);\n                    return this;\n                }\n            }\n        }\n        else {\n            this._anyListeners = [];\n        }\n        return this;\n    }\n    /**\n     * Returns an array of listeners that are listening for any event that is specified. This array can be manipulated,\n     * e.g. to remove listeners.\n     *\n     * @public\n     */\n    listenersAny() {\n        return this._anyListeners || [];\n    }\n}\nexports.Socket = Socket;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.Decoder = exports.Encoder = exports.PacketType = exports.protocol = void 0;\nconst Emitter = require(\"component-emitter\");\nconst binary_1 = require(\"./binary\");\nconst is_binary_1 = require(\"./is-binary\");\nconst debug = require(\"debug\")(\"socket.io-parser\");\n/**\n * Protocol version.\n *\n * @public\n */\nexports.protocol = 5;\nvar PacketType;\n(function (PacketType) {\n    PacketType[PacketType[\"CONNECT\"] = 0] = \"CONNECT\";\n    PacketType[PacketType[\"DISCONNECT\"] = 1] = \"DISCONNECT\";\n    PacketType[PacketType[\"EVENT\"] = 2] = \"EVENT\";\n    PacketType[PacketType[\"ACK\"] = 3] = \"ACK\";\n    PacketType[PacketType[\"CONNECT_ERROR\"] = 4] = \"CONNECT_ERROR\";\n    PacketType[PacketType[\"BINARY_EVENT\"] = 5] = \"BINARY_EVENT\";\n    PacketType[PacketType[\"BINARY_ACK\"] = 6] = \"BINARY_ACK\";\n})(PacketType = exports.PacketType || (exports.PacketType = {}));\n/**\n * A socket.io Encoder instance\n */\nclass Encoder {\n    /**\n     * Encode a packet as a single string if non-binary, or as a\n     * buffer sequence, depending on packet type.\n     *\n     * @param {Object} obj - packet object\n     */\n    encode(obj) {\n        debug(\"encoding packet %j\", obj);\n        if (obj.type === PacketType.EVENT || obj.type === PacketType.ACK) {\n            if (is_binary_1.hasBinary(obj)) {\n                obj.type =\n                    obj.type === PacketType.EVENT\n                        ? PacketType.BINARY_EVENT\n                        : PacketType.BINARY_ACK;\n                return this.encodeAsBinary(obj);\n            }\n        }\n        return [this.encodeAsString(obj)];\n    }\n    /**\n     * Encode packet as string.\n     */\n    encodeAsString(obj) {\n        // first is type\n        let str = \"\" + obj.type;\n        // attachments if we have them\n        if (obj.type === PacketType.BINARY_EVENT ||\n            obj.type === PacketType.BINARY_ACK) {\n            str += obj.attachments + \"-\";\n        }\n        // if we have a namespace other than `/`\n        // we append it followed by a comma `,`\n        if (obj.nsp && \"/\" !== obj.nsp) {\n            str += obj.nsp + \",\";\n        }\n        // immediately followed by the id\n        if (null != obj.id) {\n            str += obj.id;\n        }\n        // json data\n        if (null != obj.data) {\n            str += JSON.stringify(obj.data);\n        }\n        debug(\"encoded %j as %s\", obj, str);\n        return str;\n    }\n    /**\n     * Encode packet as 'buffer sequence' by removing blobs, and\n     * deconstructing packet into object with placeholders and\n     * a list of buffers.\n     */\n    encodeAsBinary(obj) {\n        const deconstruction = binary_1.deconstructPacket(obj);\n        const pack = this.encodeAsString(deconstruction.packet);\n        const buffers = deconstruction.buffers;\n        buffers.unshift(pack); // add packet info to beginning of data list\n        return buffers; // write all the buffers\n    }\n}\nexports.Encoder = Encoder;\n/**\n * A socket.io Decoder instance\n *\n * @return {Object} decoder\n */\nclass Decoder extends Emitter {\n    constructor() {\n        super();\n    }\n    /**\n     * Decodes an encoded packet string into packet JSON.\n     *\n     * @param {String} obj - encoded packet\n     */\n    add(obj) {\n        let packet;\n        if (typeof obj === \"string\") {\n            packet = this.decodeString(obj);\n            if (packet.type === PacketType.BINARY_EVENT ||\n                packet.type === PacketType.BINARY_ACK) {\n                // binary packet's json\n                this.reconstructor = new BinaryReconstructor(packet);\n                // no attachments, labeled binary but no binary data to follow\n                if (packet.attachments === 0) {\n                    super.emit(\"decoded\", packet);\n                }\n            }\n            else {\n                // non-binary full packet\n                super.emit(\"decoded\", packet);\n            }\n        }\n        else if (is_binary_1.isBinary(obj) || obj.base64) {\n            // raw binary data\n            if (!this.reconstructor) {\n                throw new Error(\"got binary data when not reconstructing a packet\");\n            }\n            else {\n                packet = this.reconstructor.takeBinaryData(obj);\n                if (packet) {\n                    // received final buffer\n                    this.reconstructor = null;\n                    super.emit(\"decoded\", packet);\n                }\n            }\n        }\n        else {\n            throw new Error(\"Unknown type: \" + obj);\n        }\n    }\n    /**\n     * Decode a packet String (JSON data)\n     *\n     * @param {String} str\n     * @return {Object} packet\n     */\n    decodeString(str) {\n        let i = 0;\n        // look up type\n        const p = {\n            type: Number(str.charAt(0)),\n        };\n        if (PacketType[p.type] === undefined) {\n            throw new Error(\"unknown packet type \" + p.type);\n        }\n        // look up attachments if type binary\n        if (p.type === PacketType.BINARY_EVENT ||\n            p.type === PacketType.BINARY_ACK) {\n            const start = i + 1;\n            while (str.charAt(++i) !== \"-\" && i != str.length) { }\n            const buf = str.substring(start, i);\n            if (buf != Number(buf) || str.charAt(i) !== \"-\") {\n                throw new Error(\"Illegal attachments\");\n            }\n            p.attachments = Number(buf);\n        }\n        // look up namespace (if any)\n        if (\"/\" === str.charAt(i + 1)) {\n            const start = i + 1;\n            while (++i) {\n                const c = str.charAt(i);\n                if (\",\" === c)\n                    break;\n                if (i === str.length)\n                    break;\n            }\n            p.nsp = str.substring(start, i);\n        }\n        else {\n            p.nsp = \"/\";\n        }\n        // look up id\n        const next = str.charAt(i + 1);\n        if (\"\" !== next && Number(next) == next) {\n            const start = i + 1;\n            while (++i) {\n                const c = str.charAt(i);\n                if (null == c || Number(c) != c) {\n                    --i;\n                    break;\n                }\n                if (i === str.length)\n                    break;\n            }\n            p.id = Number(str.substring(start, i + 1));\n        }\n        // look up json data\n        if (str.charAt(++i)) {\n            const payload = tryParse(str.substr(i));\n            if (Decoder.isPayloadValid(p.type, payload)) {\n                p.data = payload;\n            }\n            else {\n                throw new Error(\"invalid payload\");\n            }\n        }\n        debug(\"decoded %s as %j\", str, p);\n        return p;\n    }\n    static isPayloadValid(type, payload) {\n        switch (type) {\n            case PacketType.CONNECT:\n                return typeof payload === \"object\";\n            case PacketType.DISCONNECT:\n                return payload === undefined;\n            case PacketType.CONNECT_ERROR:\n                return typeof payload === \"string\" || typeof payload === \"object\";\n            case PacketType.EVENT:\n            case PacketType.BINARY_EVENT:\n                return Array.isArray(payload) && payload.length > 0;\n            case PacketType.ACK:\n            case PacketType.BINARY_ACK:\n                return Array.isArray(payload);\n        }\n    }\n    /**\n     * Deallocates a parser's resources\n     */\n    destroy() {\n        if (this.reconstructor) {\n            this.reconstructor.finishedReconstruction();\n        }\n    }\n}\nexports.Decoder = Decoder;\nfunction tryParse(str) {\n    try {\n        return JSON.parse(str);\n    }\n    catch (e) {\n        return false;\n    }\n}\n/**\n * A manager of a binary event's 'buffer sequence'. Should\n * be constructed whenever a packet of type BINARY_EVENT is\n * decoded.\n *\n * @param {Object} packet\n * @return {BinaryReconstructor} initialized reconstructor\n */\nclass BinaryReconstructor {\n    constructor(packet) {\n        this.packet = packet;\n        this.buffers = [];\n        this.reconPack = packet;\n    }\n    /**\n     * Method to be called when binary data received from connection\n     * after a BINARY_EVENT packet.\n     *\n     * @param {Buffer | ArrayBuffer} binData - the raw binary data received\n     * @return {null | Object} returns null if more binary data is expected or\n     *   a reconstructed packet object if all buffers have been received.\n     */\n    takeBinaryData(binData) {\n        this.buffers.push(binData);\n        if (this.buffers.length === this.reconPack.attachments) {\n            // done with buffer list\n            const packet = binary_1.reconstructPacket(this.reconPack, this.buffers);\n            this.finishedReconstruction();\n            return packet;\n        }\n        return null;\n    }\n    /**\n     * Cleans up binary packet reconstruction variables.\n     */\n    finishedReconstruction() {\n        this.reconPack = null;\n        this.buffers = [];\n    }\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.reconstructPacket = exports.deconstructPacket = void 0;\nconst is_binary_1 = require(\"./is-binary\");\n/**\n * Replaces every Buffer | ArrayBuffer | Blob | File in packet with a numbered placeholder.\n *\n * @param {Object} packet - socket.io event packet\n * @return {Object} with deconstructed packet and list of buffers\n * @public\n */\nfunction deconstructPacket(packet) {\n    const buffers = [];\n    const packetData = packet.data;\n    const pack = packet;\n    pack.data = _deconstructPacket(packetData, buffers);\n    pack.attachments = buffers.length; // number of binary 'attachments'\n    return { packet: pack, buffers: buffers };\n}\nexports.deconstructPacket = deconstructPacket;\nfunction _deconstructPacket(data, buffers) {\n    if (!data)\n        return data;\n    if (is_binary_1.isBinary(data)) {\n        const placeholder = { _placeholder: true, num: buffers.length };\n        buffers.push(data);\n        return placeholder;\n    }\n    else if (Array.isArray(data)) {\n        const newData = new Array(data.length);\n        for (let i = 0; i < data.length; i++) {\n            newData[i] = _deconstructPacket(data[i], buffers);\n        }\n        return newData;\n    }\n    else if (typeof data === \"object\" && !(data instanceof Date)) {\n        const newData = {};\n        for (const key in data) {\n            if (data.hasOwnProperty(key)) {\n                newData[key] = _deconstructPacket(data[key], buffers);\n            }\n        }\n        return newData;\n    }\n    return data;\n}\n/**\n * Reconstructs a binary packet from its placeholder packet and buffers\n *\n * @param {Object} packet - event packet with placeholders\n * @param {Array} buffers - binary buffers to put in placeholder positions\n * @return {Object} reconstructed packet\n * @public\n */\nfunction reconstructPacket(packet, buffers) {\n    packet.data = _reconstructPacket(packet.data, buffers);\n    packet.attachments = undefined; // no longer useful\n    return packet;\n}\nexports.reconstructPacket = reconstructPacket;\nfunction _reconstructPacket(data, buffers) {\n    if (!data)\n        return data;\n    if (data && data._placeholder) {\n        return buffers[data.num]; // appropriate buffer (should be natural order anyway)\n    }\n    else if (Array.isArray(data)) {\n        for (let i = 0; i < data.length; i++) {\n            data[i] = _reconstructPacket(data[i], buffers);\n        }\n    }\n    else if (typeof data === \"object\") {\n        for (const key in data) {\n            if (data.hasOwnProperty(key)) {\n                data[key] = _reconstructPacket(data[key], buffers);\n            }\n        }\n    }\n    return data;\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.hasBinary = exports.isBinary = void 0;\nconst withNativeArrayBuffer = typeof ArrayBuffer === \"function\";\nconst isView = (obj) => {\n    return typeof ArrayBuffer.isView === \"function\"\n        ? ArrayBuffer.isView(obj)\n        : obj.buffer instanceof ArrayBuffer;\n};\nconst toString = Object.prototype.toString;\nconst withNativeBlob = typeof Blob === \"function\" ||\n    (typeof Blob !== \"undefined\" &&\n        toString.call(Blob) === \"[object BlobConstructor]\");\nconst withNativeFile = typeof File === \"function\" ||\n    (typeof File !== \"undefined\" &&\n        toString.call(File) === \"[object FileConstructor]\");\n/**\n * Returns true if obj is a Buffer, an ArrayBuffer, a Blob or a File.\n *\n * @private\n */\nfunction isBinary(obj) {\n    return ((withNativeArrayBuffer && (obj instanceof ArrayBuffer || isView(obj))) ||\n        (withNativeBlob && obj instanceof Blob) ||\n        (withNativeFile && obj instanceof File));\n}\nexports.isBinary = isBinary;\nfunction hasBinary(obj, toJSON) {\n    if (!obj || typeof obj !== \"object\") {\n        return false;\n    }\n    if (Array.isArray(obj)) {\n        for (let i = 0, l = obj.length; i < l; i++) {\n            if (hasBinary(obj[i])) {\n                return true;\n            }\n        }\n        return false;\n    }\n    if (isBinary(obj)) {\n        return true;\n    }\n    if (obj.toJSON &&\n        typeof obj.toJSON === \"function\" &&\n        arguments.length === 1) {\n        return hasBinary(obj.toJSON(), true);\n    }\n    for (const key in obj) {\n        if (Object.prototype.hasOwnProperty.call(obj, key) && hasBinary(obj[key])) {\n            return true;\n        }\n    }\n    return false;\n}\nexports.hasBinary = hasBinary;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.on = void 0;\nfunction on(obj, ev, fn) {\n    obj.on(ev, fn);\n    return function subDestroy() {\n        obj.off(ev, fn);\n    };\n}\nexports.on = on;\n","\n/**\n * Expose `Backoff`.\n */\n\nmodule.exports = Backoff;\n\n/**\n * Initialize backoff timer with `opts`.\n *\n * - `min` initial timeout in milliseconds [100]\n * - `max` max timeout [10000]\n * - `jitter` [0]\n * - `factor` [2]\n *\n * @param {Object} opts\n * @api public\n */\n\nfunction Backoff(opts) {\n  opts = opts || {};\n  this.ms = opts.min || 100;\n  this.max = opts.max || 10000;\n  this.factor = opts.factor || 2;\n  this.jitter = opts.jitter > 0 && opts.jitter <= 1 ? opts.jitter : 0;\n  this.attempts = 0;\n}\n\n/**\n * Return the backoff duration.\n *\n * @return {Number}\n * @api public\n */\n\nBackoff.prototype.duration = function(){\n  var ms = this.ms * Math.pow(this.factor, this.attempts++);\n  if (this.jitter) {\n    var rand =  Math.random();\n    var deviation = Math.floor(rand * this.jitter * ms);\n    ms = (Math.floor(rand * 10) & 1) == 0  ? ms - deviation : ms + deviation;\n  }\n  return Math.min(ms, this.max) | 0;\n};\n\n/**\n * Reset the number of attempts.\n *\n * @api public\n */\n\nBackoff.prototype.reset = function(){\n  this.attempts = 0;\n};\n\n/**\n * Set the minimum duration\n *\n * @api public\n */\n\nBackoff.prototype.setMin = function(min){\n  this.ms = min;\n};\n\n/**\n * Set the maximum duration\n *\n * @api public\n */\n\nBackoff.prototype.setMax = function(max){\n  this.max = max;\n};\n\n/**\n * Set the jitter\n *\n * @api public\n */\n\nBackoff.prototype.setJitter = function(jitter){\n  this.jitter = jitter;\n};\n\n","'use strict'\n\nconst abortable = require('abortable-iterator')\nconst toIterable = require('stream-to-it')\nconst { CLOSE_TIMEOUT } = require('./constants')\nconst toMultiaddr = require('libp2p-utils/src/ip-port-to-multiaddr')\n\nconst debug = require('debug')\nconst log = debug('libp2p:webrtc-star:socket')\nlog.error = debug('libp2p:webrtc-star:socket:error')\n\nconst toWebrtcMultiaddr = (address, port) => {\n  if (!address || !port) return undefined\n\n  try {\n    return toMultiaddr(address, port)\n  } catch (err) {\n    log.error(err)\n    // Account for mdns hostnames, just make it a local ip for now\n    return toMultiaddr('0.0.0.0', port)\n  }\n}\n\n// Convert a socket into a MultiaddrConnection\n// https://github.com/libp2p/js-libp2p-interfaces/tree/master/src/transport#multiaddrconnection\nmodule.exports = (socket, options = {}) => {\n  const { sink, source } = toIterable.duplex(socket)\n\n  // If the remote address was passed, use it - it may have the peer ID encapsulated\n  const remoteAddr = options.remoteAddr || toWebrtcMultiaddr(socket.remoteAddress, socket.remotePort)\n  const localAddr = toWebrtcMultiaddr(socket.localAddress, socket.localPort)\n\n  const maConn = {\n    async sink (source) {\n      if (options.signal) {\n        source = abortable(source, options.signal)\n      }\n\n      try {\n        await sink((async function * () {\n          for await (const chunk of source) {\n            // Convert BufferList to Buffer\n            yield chunk instanceof Uint8Array ? chunk : chunk.slice()\n          }\n        })())\n      } catch (err) {\n        // If aborted we can safely ignore\n        if (err.type !== 'aborted') {\n          // If the source errored the socket will already have been destroyed by\n          // toIterable.duplex(). If the socket errored it will already be\n          // destroyed. There's nothing to do here except log the error & return.\n          log.error(err)\n        }\n      }\n    },\n\n    source: options.signal ? abortable(source, options.signal) : source,\n\n    conn: socket,\n\n    localAddr,\n    remoteAddr,\n\n    timeline: { open: Date.now() },\n\n    close () {\n      if (socket.destroyed) return\n\n      return new Promise((resolve, reject) => {\n        const start = Date.now()\n\n        // Attempt to end the socket. If it takes longer to close than the\n        // timeout, destroy it manually.\n        const timeout = setTimeout(() => {\n          if (maConn.remoteAddr) {\n            const { host, port } = maConn.remoteAddr.toOptions()\n            log('timeout closing socket to %s:%s after %dms, destroying it manually',\n              host, port, Date.now() - start)\n          }\n\n          if (!socket.destroyed) {\n            socket.destroy()\n          }\n        }, CLOSE_TIMEOUT)\n\n        socket.once('close', () => {\n          resolve()\n        })\n\n        socket.end(err => {\n          clearTimeout(timeout)\n\n          maConn.timeline.close = Date.now()\n          if (err) return reject(err)\n        })\n      })\n    }\n  }\n\n  socket.once('close', () => {\n    // In instances where `close` was not explicitly called,\n    // such as an iterable stream ending, ensure we have set the close\n    // timeline\n    if (!maConn.timeline.close) {\n      maConn.timeline.close = Date.now()\n    }\n  })\n\n  return maConn\n}\n","module.exports = require('./source')\nmodule.exports.source = require('./source')\nmodule.exports.sink = require('./sink')\nmodule.exports.transform = require('./transform')\nmodule.exports.duplex = require('./duplex')\n","module.exports = readable => {\n  // Node.js stream\n  if (readable[Symbol.asyncIterator]) return readable\n\n  // Browser ReadableStream\n  if (readable.getReader) {\n    return (async function * () {\n      const reader = readable.getReader()\n\n      try {\n        while (true) {\n          const { done, value } = await reader.read()\n          if (done) return\n          yield value\n        }\n      } finally {\n        reader.releaseLock()\n      }\n    })()\n  }\n\n  throw new Error('unknown stream')\n}\n","const getIterator = require('get-iterator')\n\nmodule.exports = writable => async source => {\n  source = getIterator(source)\n\n  const maybeEndSource = (source) => {\n    if (typeof source.return === 'function') source.return()\n  }\n\n  let error = null\n  let errCb = null\n  const errorHandler = (err) => {\n    error = err\n    if (errCb) errCb(err)\n    // When the writable errors, try to end the source to exit iteration early\n    maybeEndSource(source)\n  }\n\n  let closeCb = null\n  let closed = false\n  const closeHandler = () => {\n    closed = true\n    if (closeCb) closeCb()\n  }\n\n  let finishCb = null\n  let finished = false\n  const finishHandler = () => {\n    finished = true\n    if (finishCb) finishCb()\n  }\n\n  let drainCb = null\n  const drainHandler = () => {\n    if (drainCb) drainCb()\n  }\n\n  const waitForDrainOrClose = () => {\n    return new Promise((resolve, reject) => {\n      closeCb = drainCb = resolve\n      errCb = reject\n      writable.once('drain', drainHandler)\n    })\n  }\n\n  const waitForDone = () => {\n    // Immediately try to end the source\n    maybeEndSource(source)\n    return new Promise((resolve, reject) => {\n      if (closed || finished || error) return resolve()\n      finishCb = closeCb = resolve\n      errCb = reject\n    })\n  }\n\n  const cleanup = () => {\n    writable.removeListener('error', errorHandler)\n    writable.removeListener('close', closeHandler)\n    writable.removeListener('finish', finishHandler)\n    writable.removeListener('drain', drainHandler)\n  }\n\n  writable.once('error', errorHandler)\n  writable.once('close', closeHandler)\n  writable.once('finish', finishHandler)\n\n  try {\n    for await (const value of source) {\n      if (!writable.writable || writable.destroyed || error) break\n\n      if (writable.write(value) === false) {\n        await waitForDrainOrClose()\n      }\n    }\n  } catch (err) {\n    // error is set by stream error handler so only destroy stream if source threw\n    if (!error) {\n      writable.destroy()\n    }\n\n    // could we be obscuring an error here?\n    error = err\n  }\n\n  try {\n    // We're done writing, end everything (n.b. stream may be destroyed at this point but then this is a no-op)\n    if (writable.writable) {\n      writable.end()\n    }\n\n    // Wait until we close or finish. This supports halfClosed streams\n    await waitForDone()\n\n    // Notify the user an error occurred\n    if (error) throw error\n  } finally {\n    // Clean up listeners\n    cleanup()\n  }\n}\n","const toDuplex = require('./duplex')\n\nmodule.exports = transform => async function * (source) {\n  const duplex = toDuplex(transform)\n  // In a transform the sink and source are connected, an error in the sink\n  // will be thrown in the source also. Catch the sink error to avoid unhandled\n  // rejections and yield from the source.\n  duplex.sink(source).catch(_ => {})\n  yield * duplex.source\n}\n","const toSink = require('./sink')\nconst toSource = require('./source')\n\nmodule.exports = duplex => ({ sink: toSink(duplex), source: toSource(duplex) })\n","'use strict'\n\nconst { Multiaddr } = require('multiaddr')\n\nfunction cleanUrlSIO (ma) {\n  const maStrSplit = ma.toString().split('/')\n  const tcpProto = ma.protos()[1].name\n  const wsProto = ma.protos()[2].name\n  const tcpPort = ma.stringTuples()[1][1]\n\n  if (tcpProto !== 'tcp' || (wsProto !== 'ws' && wsProto !== 'wss')) {\n    throw new Error('invalid multiaddr: ' + ma.toString())\n  }\n\n  if (!Multiaddr.isName(ma)) {\n    return 'http://' + maStrSplit[2] + ':' + maStrSplit[4]\n  }\n\n  if (wsProto === 'ws') {\n    return 'http://' + maStrSplit[2] + (tcpPort === '80' ? '' : ':' + tcpPort)\n  }\n\n  if (wsProto === 'wss') {\n    return 'https://' + maStrSplit[2] + (tcpPort === '443' ? '' : ':' + tcpPort)\n  }\n}\n\nfunction cleanMultiaddr (maStr) {\n  const legacy = '/libp2p-webrtc-star'\n\n  if (maStr.indexOf(legacy) !== -1) {\n    maStr = maStr.substring(legacy.length, maStr.length)\n    let ma = new Multiaddr(maStr)\n    const tuppleIPFS = ma.stringTuples().filter((tupple) => {\n      return tupple[0] === 421 // ipfs code\n    })[0]\n\n    ma = ma.decapsulate('p2p')\n    ma = ma.encapsulate('/p2p-webrtc-star')\n    ma = ma.encapsulate(`/p2p/${tuppleIPFS[1]}`)\n    maStr = ma.toString()\n  }\n\n  return maStr\n}\n\nmodule.exports = {\n  cleanUrlSIO,\n  cleanMultiaddr\n}\n","'use strict'\n\nmodule.exports = require('./mplex')\n","'use strict'\n\nconst pipe = require('it-pipe')\nconst pushable = require('it-pushable')\nconst log = require('debug')('libp2p:mplex')\nconst abortable = require('abortable-iterator')\nconst Coder = require('./coder')\nconst restrictSize = require('./restrict-size')\nconst { MessageTypes, MessageTypeNames } = require('./message-types')\nconst createStream = require('./stream')\n\nclass Mplex {\n  /**\n   * @class\n   * @param {object} options\n   * @param {function(*)} options.onStream - Called whenever an inbound stream is created\n   * @param {function(*)} options.onStreamEnd - Called whenever a stream ends\n   * @param {AbortSignal} options.signal - An AbortController signal\n   */\n  constructor (options) {\n    options = options || {}\n    options = typeof options === 'function' ? { onStream: options } : options\n\n    this._streamId = 0\n    this._streams = {\n      /**\n       * @type {Map<number, *>} Stream to ids map\n       */\n      initiators: new Map(),\n      /**\n       * @type {Map<number, *>} Stream to ids map\n       */\n      receivers: new Map()\n    }\n    this._options = options\n\n    /**\n     * An iterable sink\n     */\n    this.sink = this._createSink()\n\n    /**\n     * An iterable source\n     */\n    this.source = this._createSource()\n\n    /**\n     * @property {Function} onStream\n     */\n    this.onStream = options.onStream\n\n    /**\n     * @property {Function} onStreamEnd\n     */\n    this.onStreamEnd = options.onStreamEnd\n  }\n\n  /**\n   * Returns a Map of streams and their ids\n   *\n   * @returns {Map<number,*>}\n   */\n  get streams () {\n    // Inbound and Outbound streams may have the same ids, so we need to make those unique\n    const streams = []\n    this._streams.initiators.forEach(stream => {\n      streams.push(stream)\n    })\n    this._streams.receivers.forEach(stream => {\n      streams.push(stream)\n    })\n    return streams\n  }\n\n  /**\n   * Initiate a new stream with the given name. If no name is\n   * provided, the id of th stream will be used.\n   *\n   * @param {string} [name] - If name is not a string it will be cast to one\n   * @returns {Stream}\n   */\n  newStream (name) {\n    const id = this._streamId++\n    name = name == null ? id.toString() : String(name)\n    const registry = this._streams.initiators\n    return this._newStream({ id, name, type: 'initiator', registry })\n  }\n\n  /**\n   * Called whenever an inbound stream is created\n   *\n   * @private\n   * @param {*} options\n   * @param {number} options.id\n   * @param {string} options.name\n   * @returns {*} A muxed stream\n   */\n  _newReceiverStream ({ id, name }) {\n    const registry = this._streams.receivers\n    return this._newStream({ id, name, type: 'receiver', registry })\n  }\n\n  /**\n   * Creates a new stream\n   *\n   * @private\n   * @param {object} options\n   * @param {number} options.id\n   * @param {string} options.name\n   * @param {string} options.type\n   * @param {Map<number, *>} options.registry - A map of streams to their ids\n   * @returns {*} A muxed stream\n   */\n  _newStream ({ id, name, type, registry }) {\n    if (registry.has(id)) {\n      throw new Error(`${type} stream ${id} already exists!`)\n    }\n    log('new %s stream %s %s', type, id, name)\n    const send = msg => {\n      if (log.enabled) {\n        log('%s stream %s %s send', type, id, name, { ...msg, type: MessageTypeNames[msg.type], data: msg.data && msg.data.slice() })\n      }\n      return this.source.push(msg)\n    }\n    const onEnd = () => {\n      log('%s stream %s %s ended', type, id, name)\n      registry.delete(id)\n      this.onStreamEnd && this.onStreamEnd(stream)\n    }\n    const stream = createStream({ id, name, send, type, onEnd, maxMsgSize: this._options.maxMsgSize })\n    registry.set(id, stream)\n    return stream\n  }\n\n  /**\n   * Creates a sink with an abortable source. Incoming messages will\n   * also have their size restricted. All messages will be varint decoded.\n   *\n   * @private\n   * @returns {*} Returns an iterable sink\n   */\n  _createSink () {\n    return async source => {\n      if (this._options.signal) {\n        source = abortable(source, this._options.signal)\n      }\n\n      try {\n        await pipe(\n          source,\n          Coder.decode,\n          restrictSize(this._options.maxMsgSize),\n          async source => {\n            for await (const msgs of source) {\n              for (const msg of msgs) {\n                this._handleIncoming(msg)\n              }\n            }\n          }\n        )\n      } catch (err) {\n        log('error in sink', err)\n        return this.source.end(err) // End the source with an error\n      }\n\n      this.source.end()\n    }\n  }\n\n  /**\n   * Creates a source that restricts outgoing message sizes\n   * and varint encodes them.\n   *\n   * @private\n   * @returns {*} An iterable source\n   */\n  _createSource () {\n    const onEnd = err => {\n      const { initiators, receivers } = this._streams\n      // Abort all the things!\n      for (const s of initiators.values()) s.abort(err)\n      for (const s of receivers.values()) s.abort(err)\n    }\n    const source = pushable({ onEnd, writev: true })\n    return Object.assign(Coder.encode(source), {\n      push: source.push,\n      end: source.end,\n      return: source.return\n    })\n  }\n\n  /**\n   * @private\n   * @param {object} options\n   * @param {number} options.id\n   * @param {string} options.type\n   * @param {Uint8Array|BufferList} options.data\n   * @returns {void}\n   */\n  _handleIncoming ({ id, type, data }) {\n    if (log.enabled) {\n      log('incoming message', { id, type: MessageTypeNames[type], data: data.slice() })\n    }\n\n    // Create a new stream?\n    if (type === MessageTypes.NEW_STREAM && this.onStream) {\n      const stream = this._newReceiverStream({ id, name: data.toString() })\n      return this.onStream(stream)\n    }\n\n    const list = type & 1 ? this._streams.initiators : this._streams.receivers\n    const stream = list.get(id)\n\n    if (!stream) return log('missing stream %s', id)\n\n    switch (type) {\n      case MessageTypes.MESSAGE_INITIATOR:\n      case MessageTypes.MESSAGE_RECEIVER:\n        stream.source.push(data)\n        break\n      case MessageTypes.CLOSE_INITIATOR:\n      case MessageTypes.CLOSE_RECEIVER:\n        stream.close()\n        break\n      case MessageTypes.RESET_INITIATOR:\n      case MessageTypes.RESET_RECEIVER:\n        stream.reset()\n        break\n      default:\n        log('unknown message type %s', type)\n    }\n  }\n}\n\nMplex.multicodec = '/mplex/6.7.0'\n\nmodule.exports = Mplex\n","'use strict'\n\nexports.encode = require('./encode')\nexports.decode = require('./decode')\n","'use strict'\n\nconst varint = require('varint')\nconst BufferList = require('bl/BufferList')\n\nconst POOL_SIZE = 10 * 1024\n\nclass Encoder {\n  constructor () {\n    this._pool = new Uint8Array(POOL_SIZE)\n    this._poolOffset = 0\n  }\n\n  /**\n   * Encodes the given message and returns it and its header\n   *\n   * @param {*} msg - The message object to encode\n   * @returns {Uint8Array|Uint8Array[]}\n   */\n  write (msg) {\n    const pool = this._pool\n    let offset = this._poolOffset\n\n    varint.encode(msg.id << 3 | msg.type, pool, offset)\n    offset += varint.encode.bytes\n    varint.encode(msg.data ? msg.data.length : 0, pool, offset)\n    offset += varint.encode.bytes\n\n    const header = pool.subarray(this._poolOffset, offset)\n\n    if (POOL_SIZE - offset < 100) {\n      this._pool = new Uint8Array(POOL_SIZE)\n      this._poolOffset = 0\n    } else {\n      this._poolOffset = offset\n    }\n\n    if (!msg.data) return header\n\n    return [header, msg.data]\n  }\n}\n\nconst encoder = new Encoder()\n\n// Encode one or more messages and yield a BufferList of encoded messages\nmodule.exports = source => (async function * encode () {\n  for await (const msg of source) {\n    if (Array.isArray(msg)) {\n      yield new BufferList(msg.map(m => encoder.write(m)))\n    } else {\n      yield new BufferList(encoder.write(msg))\n    }\n  }\n})()\n","'use strict'\n\nconst varint = require('varint')\nconst BufferList = require('bl/BufferList')\n\n// Decode a chunk and yield an _array_ of decoded messages\nmodule.exports = source => (async function * decode () {\n  const decoder = new Decoder()\n  for await (const chunk of source) {\n    const msgs = decoder.write(chunk)\n    if (msgs.length) yield msgs\n  }\n})()\n\nclass Decoder {\n  constructor () {\n    this._buffer = new BufferList()\n    // optimization to allow varint to take a BufferList (well a proxy to)\n    this._bufferProxy = new Proxy({}, {\n      get: (_, prop) => prop[0] === 'l' ? this._buffer[prop] : this._buffer.get(parseInt(prop))\n    })\n    this._headerInfo = null\n  }\n\n  /**\n   * @param {Uint8Array|BufferList} chunk\n   * @returns {object[]} An array of message objects\n   */\n  write (chunk) {\n    if (!chunk || !chunk.length) return []\n\n    this._buffer.append(chunk)\n    const msgs = []\n\n    while (true) {\n      if (!this._headerInfo) {\n        try {\n          this._headerInfo = this._decodeHeader(this._bufferProxy)\n        } catch (_) {\n          break // We haven't received enough data yet\n        }\n      }\n\n      const { id, type, length, offset } = this._headerInfo\n      const bufferedDataLength = this._buffer.length - offset\n\n      if (bufferedDataLength < length) break // not enough data yet\n\n      msgs.push({ id, type, data: this._buffer.shallowSlice(offset, offset + length) })\n\n      this._buffer.consume(offset + length)\n      this._headerInfo = null\n    }\n\n    return msgs\n  }\n\n  /**\n   * Attempts to decode the message header from the buffer\n   *\n   * @private\n   * @param {Uint8Array} data\n   * @returns {*} message header (id, type, offset, length)\n   */\n  _decodeHeader (data) {\n    const h = varint.decode(data)\n    let offset = varint.decode.bytes\n    const length = varint.decode(data, offset)\n    offset += varint.decode.bytes\n    return { id: h >> 3, type: h & 7, offset, length }\n  }\n}\n","'use strict'\n\nconst MAX_MSG_SIZE = 1 << 20 // 1MB\n\n/**\n * Creates an iterable transform that restricts message sizes to\n * the given maximum size.\n *\n * @param {number} [max] - The maximum message size. Defaults to 1MB\n * @returns {*} An iterable transform.\n */\nmodule.exports = max => {\n  max = max || MAX_MSG_SIZE\n\n  const checkSize = msg => {\n    if (msg.data && msg.data.length > max) {\n      throw Object.assign(new Error('message size too large!'), { code: 'ERR_MSG_TOO_BIG' })\n    }\n  }\n\n  return source => {\n    return (async function * restrictSize () {\n      for await (const msg of source) {\n        if (Array.isArray(msg)) {\n          msg.forEach(checkSize)\n        } else {\n          checkSize(msg)\n        }\n        yield msg\n      }\n    })()\n  }\n}\n\nmodule.exports.MAX_MSG_SIZE = MAX_MSG_SIZE\n","'use strict'\n\nconst MessageTypes = Object.freeze({\n  NEW_STREAM: 0,\n  MESSAGE_RECEIVER: 1,\n  MESSAGE_INITIATOR: 2,\n  CLOSE_RECEIVER: 3,\n  CLOSE_INITIATOR: 4,\n  RESET_RECEIVER: 5,\n  RESET_INITIATOR: 6\n})\n\nexports.MessageTypes = MessageTypes\n\nexports.InitiatorMessageTypes = Object.freeze({\n  NEW_STREAM: MessageTypes.NEW_STREAM,\n  MESSAGE: MessageTypes.MESSAGE_INITIATOR,\n  CLOSE: MessageTypes.CLOSE_INITIATOR,\n  RESET: MessageTypes.RESET_INITIATOR\n})\n\nexports.ReceiverMessageTypes = Object.freeze({\n  MESSAGE: MessageTypes.MESSAGE_RECEIVER,\n  CLOSE: MessageTypes.CLOSE_RECEIVER,\n  RESET: MessageTypes.RESET_RECEIVER\n})\n\nexports.MessageTypeNames = Object.freeze(\n  Object.entries(MessageTypes).reduce((obj, e) => {\n    obj[e[1]] = e[0]\n    return obj\n  }, {})\n)\n","'use strict'\n\nconst abortable = require('abortable-iterator')\nconst AbortController = require('abort-controller')\nconst log = require('debug')('libp2p:mplex:stream')\nconst pushable = require('it-pushable')\nconst BufferList = require('bl/BufferList')\nconst errCode = require('err-code')\nconst { MAX_MSG_SIZE } = require('./restrict-size')\nconst { InitiatorMessageTypes, ReceiverMessageTypes } = require('./message-types')\n\nconst ERR_MPLEX_STREAM_RESET = 'ERR_MPLEX_STREAM_RESET'\nconst ERR_MPLEX_STREAM_ABORT = 'ERR_MPLEX_STREAM_ABORT'\n\n/**\n * @param {object} options\n * @param {number} options.id\n * @param {string} options.name\n * @param {function(*)} options.send - Called to send data through the stream\n * @param {function(Error)} [options.onEnd] - Called whenever the stream ends\n * @param {string} [options.type] - One of ['initiator','receiver']. Defaults to 'initiator'\n * @param {number} [options.maxMsgSize] - Max size of an mplex message in bytes. Writes > size are automatically split. Defaults to 1MB\n * @returns {*} A muxed stream\n */\nmodule.exports = ({ id, name, send, onEnd = () => {}, type = 'initiator', maxMsgSize = MAX_MSG_SIZE }) => {\n  const abortController = new AbortController()\n  const resetController = new AbortController()\n  const Types = type === 'initiator' ? InitiatorMessageTypes : ReceiverMessageTypes\n  const externalId = type === 'initiator' ? (`i${id}`) : `r${id}`\n\n  name = String(name == null ? id : name)\n\n  let sourceEnded = false\n  let sinkEnded = false\n  let endErr\n\n  const onSourceEnd = err => {\n    if (sourceEnded) return\n    sourceEnded = true\n    log('%s stream %s source end', type, name, err)\n    if (err && !endErr) endErr = err\n    if (sinkEnded) {\n      stream.timeline.close = Date.now()\n      onEnd(endErr)\n    }\n  }\n\n  const onSinkEnd = err => {\n    if (sinkEnded) return\n    sinkEnded = true\n    log('%s stream %s sink end', type, name, err)\n    if (err && !endErr) endErr = err\n    if (sourceEnded) {\n      stream.timeline.close = Date.now()\n      onEnd(endErr)\n    }\n  }\n\n  const stream = {\n    // Close for reading\n    close: () => stream.source.end(),\n    // Close for reading and writing (local error)\n    abort: err => {\n      log('%s stream %s abort', type, name, err)\n      // End the source with the passed error\n      stream.source.end(err)\n      abortController.abort()\n      onSinkEnd(err)\n    },\n    // Close immediately for reading and writing (remote error)\n    reset: () => {\n      const err = errCode(new Error('stream reset'), ERR_MPLEX_STREAM_RESET)\n      resetController.abort()\n      stream.source.end(err)\n      onSinkEnd(err)\n    },\n    sink: async source => {\n      source = abortable(source, [\n        { signal: abortController.signal, options: { abortMessage: 'stream aborted', abortCode: ERR_MPLEX_STREAM_ABORT } },\n        { signal: resetController.signal, options: { abortMessage: 'stream reset', abortCode: ERR_MPLEX_STREAM_RESET } }\n      ])\n\n      if (type === 'initiator') { // If initiator, open a new stream\n        send({ id, type: Types.NEW_STREAM, data: name })\n      }\n\n      try {\n        for await (let data of source) {\n          while (data.length) {\n            if (data.length <= maxMsgSize) {\n              send({ id, type: Types.MESSAGE, data })\n              break\n            }\n            data = BufferList.isBufferList(data) ? data : new BufferList(data)\n            send({ id, type: Types.MESSAGE, data: data.shallowSlice(0, maxMsgSize) })\n            data.consume(maxMsgSize)\n          }\n        }\n      } catch (err) {\n        // Send no more data if this stream was remotely reset\n        if (err.code === ERR_MPLEX_STREAM_RESET) {\n          log('%s stream %s reset', type, name)\n        } else {\n          log('%s stream %s error', type, name, err)\n          send({ id, type: Types.RESET })\n        }\n\n        stream.source.end(err)\n        return onSinkEnd(err)\n      }\n\n      send({ id, type: Types.CLOSE })\n      onSinkEnd()\n    },\n    source: pushable(onSourceEnd),\n    timeline: {\n      open: Date.now(),\n      close: null\n    },\n    id: externalId\n  }\n\n  return stream\n}\n","import { Noise } from './noise'\nexport * from './noise'\n\n/**\n * Default configuration, it will generate new noise static key and enable noise pipes (IK handshake).\n */\nexport const NOISE = new Noise()\n","import x25519 from 'bcrypto/lib/js/x25519'\nimport { Buffer } from 'buffer'\nimport Wrap from 'it-pb-rpc'\nimport DuplexPair from 'it-pair/duplex'\nimport ensureBuffer from 'it-buffer'\nimport pipe from 'it-pipe'\nimport { encode, decode } from 'it-length-prefixed'\n\nimport { XXHandshake } from './handshake-xx'\nimport { IKHandshake } from './handshake-ik'\nimport { XXFallbackHandshake } from './handshake-xx-fallback'\nimport { generateKeypair, getPayload } from './utils'\nimport { uint16BEDecode, uint16BEEncode } from './encoder'\nimport { decryptStream, encryptStream } from './crypto'\nimport { bytes } from './@types/basic'\nimport { INoiseConnection, KeyPair, SecureOutbound } from './@types/libp2p'\nimport { Duplex } from 'it-pair'\nimport { IHandshake } from './@types/handshake-interface'\nimport { KeyCache } from './keycache'\nimport { logger } from './logger'\nimport PeerId from 'peer-id'\nimport { NOISE_MSG_MAX_LENGTH_BYTES } from './constants'\n\nexport type WrappedConnection = ReturnType<typeof Wrap>\n\ninterface HandshakeParams {\n  connection: WrappedConnection\n  isInitiator: boolean\n  localPeer: PeerId\n  remotePeer?: PeerId\n}\n\nexport class Noise implements INoiseConnection {\n  public protocol = '/noise'\n\n  private readonly prologue = Buffer.alloc(0)\n  private readonly staticKeys: KeyPair\n  private readonly earlyData?: bytes\n  private readonly useNoisePipes: boolean\n\n  /**\n   *\n   * @param {bytes} staticNoiseKey - x25519 private key, reuse for faster handshakes\n   * @param {bytes} earlyData\n   */\n  constructor (staticNoiseKey?: bytes, earlyData?: bytes) {\n    this.earlyData = earlyData ?? Buffer.alloc(0)\n    // disabled until properly specked\n    this.useNoisePipes = false\n\n    if (staticNoiseKey) {\n      const publicKey = x25519.publicKeyCreate(staticNoiseKey)\n      this.staticKeys = {\n        privateKey: staticNoiseKey,\n        publicKey\n      }\n    } else {\n      this.staticKeys = generateKeypair()\n    }\n  }\n\n  /**\n   * Encrypt outgoing data to the remote party (handshake as initiator)\n   *\n   * @param {PeerId} localPeer - PeerId of the receiving peer\n   * @param {any} connection - streaming iterable duplex that will be encrypted\n   * @param {PeerId} remotePeer - PeerId of the remote peer. Used to validate the integrity of the remote peer.\n   * @returns {Promise<SecureOutbound>}\n   */\n  public async secureOutbound (localPeer: PeerId, connection: any, remotePeer: PeerId): Promise<SecureOutbound> {\n    const wrappedConnection = Wrap(\n      connection,\n      {\n        lengthEncoder: uint16BEEncode,\n        lengthDecoder: uint16BEDecode,\n        maxDataLength: NOISE_MSG_MAX_LENGTH_BYTES\n      }\n    )\n    const handshake = await this.performHandshake({\n      connection: wrappedConnection,\n      isInitiator: true,\n      localPeer,\n      remotePeer\n    })\n    const conn = await this.createSecureConnection(wrappedConnection, handshake)\n\n    return {\n      conn,\n      remoteEarlyData: handshake.remoteEarlyData,\n      remotePeer: handshake.remotePeer\n    }\n  }\n\n  /**\n   * Decrypt incoming data (handshake as responder).\n   *\n   * @param {PeerId} localPeer - PeerId of the receiving peer.\n   * @param {any} connection - streaming iterable duplex that will be encryption.\n   * @param {PeerId} remotePeer - optional PeerId of the initiating peer, if known. This may only exist during transport upgrades.\n   * @returns {Promise<SecureOutbound>}\n   */\n  public async secureInbound (localPeer: PeerId, connection: any, remotePeer?: PeerId): Promise<SecureOutbound> {\n    const wrappedConnection = Wrap(\n      connection,\n      {\n        lengthEncoder: uint16BEEncode,\n        lengthDecoder: uint16BEDecode,\n        maxDataLength: NOISE_MSG_MAX_LENGTH_BYTES\n      }\n    )\n    const handshake = await this.performHandshake({\n      connection: wrappedConnection,\n      isInitiator: false,\n      localPeer,\n      remotePeer\n    })\n    const conn = await this.createSecureConnection(wrappedConnection, handshake)\n\n    return {\n      conn,\n      remoteEarlyData: handshake.remoteEarlyData,\n      remotePeer: handshake.remotePeer\n    }\n  }\n\n  /**\n   * If Noise pipes supported, tries IK handshake first with XX as fallback if it fails.\n   * If noise pipes disabled or remote peer static key is unknown, use XX.\n   *\n   * @param {HandshakeParams} params\n   */\n  private async performHandshake (params: HandshakeParams): Promise<IHandshake> {\n    const payload = await getPayload(params.localPeer, this.staticKeys.publicKey, this.earlyData)\n    let tryIK = this.useNoisePipes\n    if (params.isInitiator && KeyCache.load(params.remotePeer) === null) {\n      // if we are initiator and remote static key is unknown, don't try IK\n      tryIK = false\n    }\n    // Try IK if acting as responder or initiator that has remote's static key.\n    if (tryIK) {\n      // Try IK first\n      const { remotePeer, connection, isInitiator } = params\n      const ikHandshake = new IKHandshake(\n        isInitiator,\n        payload,\n        this.prologue,\n        this.staticKeys,\n        connection,\n        // safe to cast as we did checks\n        KeyCache.load(params.remotePeer) ?? Buffer.alloc(32),\n        remotePeer as PeerId\n      )\n\n      try {\n        return await this.performIKHandshake(ikHandshake)\n      } catch (e) {\n        // IK failed, go to XX fallback\n        let ephemeralKeys\n        if (params.isInitiator) {\n          ephemeralKeys = ikHandshake.getLocalEphemeralKeys()\n        }\n        return await this.performXXFallbackHandshake(params, payload, e.initialMsg, ephemeralKeys)\n      }\n    } else {\n      // run XX handshake\n      return await this.performXXHandshake(params, payload)\n    }\n  }\n\n  private async performXXFallbackHandshake (\n    params: HandshakeParams,\n    payload: bytes,\n    initialMsg: bytes,\n    ephemeralKeys?: KeyPair\n  ): Promise<XXFallbackHandshake> {\n    const { isInitiator, remotePeer, connection } = params\n    const handshake =\n      new XXFallbackHandshake(isInitiator, payload, this.prologue, this.staticKeys, connection, initialMsg, remotePeer, ephemeralKeys)\n\n    try {\n      await handshake.propose()\n      await handshake.exchange()\n      await handshake.finish()\n    } catch (e) {\n      logger(e)\n      const err = e as Error\n      throw new Error(`Error occurred during XX Fallback handshake: ${err.message}`)\n    }\n\n    return handshake\n  }\n\n  private async performXXHandshake (\n    params: HandshakeParams,\n    payload: bytes\n  ): Promise<XXHandshake> {\n    const { isInitiator, remotePeer, connection } = params\n    const handshake = new XXHandshake(isInitiator, payload, this.prologue, this.staticKeys, connection, remotePeer)\n\n    try {\n      await handshake.propose()\n      await handshake.exchange()\n      await handshake.finish()\n\n      if (this.useNoisePipes && handshake.remotePeer) {\n        KeyCache.store(handshake.remotePeer, handshake.getRemoteStaticKey())\n      }\n    } catch (e) {\n      const err = e as Error\n      throw new Error(`Error occurred during XX handshake: ${err.message}`)\n    }\n\n    return handshake\n  }\n\n  private async performIKHandshake (\n    handshake: IKHandshake\n  ): Promise<IKHandshake> {\n    await handshake.stage0()\n    await handshake.stage1()\n\n    return handshake\n  }\n\n  private async createSecureConnection (\n    connection: WrappedConnection,\n    handshake: IHandshake\n  ): Promise<Duplex> {\n    // Create encryption box/unbox wrapper\n    const [secure, user] = DuplexPair()\n    const network = connection.unwrap()\n\n    await pipe(\n      secure, // write to wrapper\n      ensureBuffer, // ensure any type of data is converted to buffer\n      encryptStream(handshake), // data is encrypted\n      encode({ lengthEncoder: uint16BEEncode }), // prefix with message length\n      network, // send to the remote peer\n      decode({ lengthDecoder: uint16BEDecode }), // read message length prefix\n      ensureBuffer, // ensure any type of data is converted to buffer\n      decryptStream(handshake), // decrypt the incoming data\n      secure // pipe to the wrapper\n    )\n\n    return user\n  }\n}\n","/*!\n * x25519.js - x25519 for bcrypto\n * Copyright (c) 2018-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n *\n * Resources:\n *   https://en.wikipedia.org/wiki/Curve25519\n *   https://cr.yp.to/ecdh/curve25519-20060209.pdf\n *   https://tools.ietf.org/html/rfc7748#section-5\n */\n\n'use strict';\n\nconst ECDH = require('./ecdh');\nconst pre = require('./precomputed/ed25519.json');\n\n/*\n * Expose\n */\n\nmodule.exports = new ECDH('X25519', 'ED25519', pre);\n","/*!\n * ecdh.js - ECDH for bcrypto\n * Copyright (c) 2018-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n *\n * Resources:\n *   https://cr.yp.to/ecdh.html\n *   https://cr.yp.to/ecdh/curve25519-20060209.pdf\n *   https://tools.ietf.org/html/rfc7748\n */\n\n'use strict';\n\nconst assert = require('../internal/assert');\nconst BN = require('../bn');\nconst elliptic = require('./elliptic');\nconst rng = require('../random');\n\n/**\n * ECDH\n */\n\nclass ECDH {\n  constructor(id, eid, pre) {\n    assert(typeof id === 'string');\n    assert(!eid || typeof eid === 'string');\n\n    this.id = id;\n    this.type = 'ecdh';\n    this.eid = eid || null;\n    this._pre = pre || null;\n    this._curve = null;\n    this._edwards = null;\n    this.native = 0;\n  }\n\n  get curve() {\n    if (!this._curve)\n      this._curve = elliptic.curve(this.id);\n    return this._curve;\n  }\n\n  get edwards() {\n    if (this.eid && !this._edwards) {\n      this._edwards = elliptic.curve(this.eid, this._pre);\n      this._edwards.precompute(rng);\n      this._pre = null;\n    }\n    return this._edwards;\n  }\n\n  get size() {\n    return this.curve.fieldSize;\n  }\n\n  get bits() {\n    return this.curve.fieldBits;\n  }\n\n  privateKeyGenerate() {\n    const key = rng.randomBytes(this.curve.scalarSize);\n    return this.curve.clamp(key);\n  }\n\n  privateKeyVerify(key) {\n    assert(Buffer.isBuffer(key));\n    return key.length === this.curve.scalarSize;\n  }\n\n  privateKeyExport(key, sign) {\n    const pub = this.publicKeyCreate(key);\n    const {x, y} = this.publicKeyExport(pub, sign);\n\n    return {\n      d: Buffer.from(key),\n      x,\n      y\n    };\n  }\n\n  privateKeyImport(json) {\n    assert(json && typeof json === 'object');\n\n    const a = BN.decode(json.d, this.curve.endian);\n\n    if (a.byteLength() > this.curve.scalarSize)\n      throw new Error('Invalid private key.');\n\n    return this.curve.encodeScalar(a);\n  }\n\n  publicKeyCreate(key) {\n    const a = this.curve.decodeClamped(key);\n\n    if (this.edwards && this.edwards.g.pre) {\n      const A = this.edwards.g.mulBlind(a);\n      const P = this.curve.pointFromEdwards(A);\n\n      return P.encode();\n    }\n\n    const G = this.curve.g.toX();\n    const A = G.mulBlind(a, rng);\n\n    return A.encode();\n  }\n\n  publicKeyConvert(key, sign) {\n    assert(sign == null || typeof sign === 'boolean');\n\n    if (!this.edwards)\n      throw new Error('No equivalent edwards curve.');\n\n    const A = this.curve.decodePoint(key);\n    const P = this.edwards.pointFromMont(A);\n\n    if (sign != null) {\n      if (P.isOdd() !== sign)\n        return P.neg().encode();\n    }\n\n    return P.encode();\n  }\n\n  publicKeyFromUniform(bytes) {\n    const u = this.curve.decodeUniform(bytes);\n    const A = this.curve.pointFromUniform(u);\n\n    return A.encode();\n  }\n\n  publicKeyToUniform(key, hint = rng.randomInt()) {\n    const A = this.curve.decodePoint(key);\n    const u = this.curve.pointToUniform(A, hint);\n\n    return this.curve.encodeUniform(u, hint >>> 8);\n  }\n\n  publicKeyFromHash(bytes, pake = false) {\n    const A = this.curve.pointFromHash(bytes, pake);\n\n    return A.encode();\n  }\n\n  publicKeyToHash(key, subgroup = rng.randomInt()) {\n    const A = this.curve.decodePoint(key);\n    return this.curve.pointToHash(A, subgroup, rng);\n  }\n\n  publicKeyVerify(key) {\n    assert(Buffer.isBuffer(key));\n\n    let A;\n    try {\n      A = this.curve.decodeX(key);\n    } catch (e) {\n      return false;\n    }\n\n    return A.validate();\n  }\n\n  publicKeyIsSmall(key) {\n    assert(Buffer.isBuffer(key));\n\n    let A;\n    try {\n      A = this.curve.decodeX(key);\n    } catch (e) {\n      return false;\n    }\n\n    if (!A.validate())\n      return false;\n\n    return A.isSmall();\n  }\n\n  publicKeyHasTorsion(key) {\n    assert(Buffer.isBuffer(key));\n\n    let A;\n    try {\n      A = this.curve.decodeX(key);\n    } catch (e) {\n      return false;\n    }\n\n    if (!A.validate())\n      return false;\n\n    return A.hasTorsion();\n  }\n\n  publicKeyExport(key, sign) {\n    const {x, y} = this.curve.decodePoint(key, sign);\n\n    return {\n      x: this.curve.encodeField(x.fromRed()),\n      y: this.curve.encodeField(y.fromRed())\n    };\n  }\n\n  publicKeyImport(json) {\n    assert(json && typeof json === 'object');\n\n    const x = BN.decode(json.x, this.curve.endian);\n\n    if (x.cmp(this.curve.p) >= 0)\n      throw new Error('Invalid point.');\n\n    if (json.y != null) {\n      const y = BN.decode(json.y, this.curve.endian);\n\n      if (y.cmp(this.curve.p) >= 0)\n        throw new Error('Invalid point.');\n\n      const A = this.curve.point(x, y);\n\n      if (!A.validate())\n        throw new Error('Invalid point.');\n\n      return A.encode();\n    }\n\n    const A = this.curve.pointFromX(x);\n\n    return A.encode();\n  }\n\n  derive(pub, priv) {\n    const A = this.curve.decodeX(pub);\n    const a = this.curve.decodeClamped(priv);\n    const P = A.mulBlind(a, rng);\n\n    return P.encode();\n  }\n}\n\n/*\n * Expose\n */\n\nmodule.exports = ECDH;\n","/*!\n * assert.js - assert for bcrypto\n * Copyright (c) 2020, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n */\n\n'use strict';\n\n/*\n * Assert\n */\n\nfunction assert(val, msg) {\n  if (!val) {\n    const err = new Error(msg || 'Assertion failed');\n\n    if (Error.captureStackTrace)\n      Error.captureStackTrace(err, assert);\n\n    throw err;\n  }\n}\n\n/*\n * Expose\n */\n\nmodule.exports = assert;\n","/*!\n * bn.js - big numbers for bcrypto\n * Copyright (c) 2017-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n */\n\n'use strict';\n\nmodule.exports = require('./js/bn');\n","/*!\n * bn.js - big numbers for bcrypto\n * Copyright (c) 2018-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n *\n * Parts of this software are based on indutny/bn.js:\n *   Copyright (c) 2015, Fedor Indutny (MIT License).\n *   https://github.com/indutny/bn.js\n *\n * Parts of this software are based on golang/go:\n *   Copyright (c) 2009, The Go Authors. All rights reserved.\n *   https://github.com/golang/go\n *\n * Parts of this software are based on openssl/openssl:\n *   Copyright (c) 1998-2018, The OpenSSL Project (Apache License v2.0).\n *   Copyright (c) 1995-1998, Eric A. Young, Tim J. Hudson. All rights reserved.\n *   https://github.com/openssl/openssl\n *\n * Parts of this software are based on libgmp:\n *   Copyright (c) 1991-1997, 1999-2014, Free Software Foundation, Inc.\n *   https://gmplib.org/\n *\n * Parts of this software are based on v8/v8:\n *   Copyright (c) 2017, The V8 Project Authors (BSD-Style License).\n *   https://github.com/v8/v8\n *\n * Resources:\n *   https://github.com/indutny/bn.js/blob/master/lib/bn.js\n *   https://github.com/indutny/miller-rabin/blob/master/lib/mr.js\n *   https://github.com/golang/go/blob/master/src/math/big/int.go\n *   https://github.com/golang/go/blob/master/src/math/big/nat.go\n *   https://github.com/golang/go/blob/master/src/math/big/prime.go\n *   https://github.com/openssl/openssl/tree/master/crypto/bn\n *   https://github.com/openssl/openssl/blob/master/crypto/bn/bn_kron.c\n *   https://github.com/gnutls/nettle/blob/master/mini-gmp.c\n *   https://github.com/v8/v8/blob/master/src/objects/bigint.cc\n */\n\n/* eslint valid-typeof: \"off\" */\n\n'use strict';\n\nconst {custom} = require('../internal/custom');\n\n/*\n * Constants\n */\n\nconst zeros = [\n  '',\n  '0',\n  '00',\n  '000',\n  '0000',\n  '00000',\n  '000000',\n  '0000000',\n  '00000000',\n  '000000000',\n  '0000000000',\n  '00000000000',\n  '000000000000',\n  '0000000000000',\n  '00000000000000',\n  '000000000000000',\n  '0000000000000000',\n  '00000000000000000',\n  '000000000000000000',\n  '0000000000000000000',\n  '00000000000000000000',\n  '000000000000000000000',\n  '0000000000000000000000',\n  '00000000000000000000000',\n  '000000000000000000000000',\n  '0000000000000000000000000'\n];\n\nconst groupSizes = [\n  0x00, 0x19, 0x10, 0x0c, 0x0b, 0x0a,\n  0x09, 0x08, 0x08, 0x07, 0x07, 0x07,\n  0x07, 0x06, 0x06, 0x06, 0x06, 0x06,\n  0x06, 0x06, 0x05, 0x05, 0x05, 0x05,\n  0x05, 0x05, 0x05, 0x05, 0x05, 0x05,\n  0x05, 0x05, 0x05, 0x05, 0x05, 0x05\n];\n\nconst groupBases = [\n  0x00000000, 0x02000000, 0x0290d741, 0x01000000,\n  0x02e90edd, 0x039aa400, 0x0267bf47, 0x01000000,\n  0x0290d741, 0x00989680, 0x012959c3, 0x0222c000,\n  0x03bd7765, 0x0072e440, 0x00adcea1, 0x01000000,\n  0x01704f61, 0x0206fc40, 0x02cddcf9, 0x03d09000,\n  0x003e5185, 0x004ea360, 0x006235f7, 0x00798000,\n  0x009502f9, 0x00b54ba0, 0x00daf26b, 0x01069c00,\n  0x0138f9ad, 0x0172c9e0, 0x01b4d89f, 0x02000000,\n  0x025528a1, 0x02b54a20, 0x03216b93, 0x039aa400\n];\n\nconst primes = {\n  p192: null,\n  p224: null,\n  p521: null,\n  k256: null,\n  p251: null,\n  p25519: null,\n  p448: null\n};\n\nconst modes = {\n  NONE: 0,\n  QUO: 1,\n  REM: 2,\n  BOTH: 3,\n  EUCLID: 4,\n  ALL: 7\n};\n\nconst WND_WIDTH = 4;\nconst WND_SIZE = 1 << (WND_WIDTH - 1);\n\nconst HAS_BIGINT = typeof BigInt === 'function';\n\n/**\n * BN\n */\n\nclass BN {\n  constructor(num, base, endian) {\n    this.words = [0];\n    this.length = 1;\n    this.negative = 0;\n    this.red = null;\n    this.from(num, base, endian);\n  }\n\n  /*\n   * Addition Engine\n   */\n\n  _iadd(a, b) {\n    let carry = 0;\n    let i = 0;\n\n    // a.length > b.length\n    if (a.length < b.length)\n      [a, b] = [b, a];\n\n    if (a !== this)\n      this._alloc(a.length);\n\n    for (; i < b.length; i++) {\n      const r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n\n      this.words[i] = r & 0x3ffffff;\n\n      carry = r >>> 26;\n    }\n\n    for (; carry !== 0 && i < a.length; i++) {\n      const r = (a.words[i] | 0) + carry;\n\n      this.words[i] = r & 0x3ffffff;\n\n      carry = r >>> 26;\n    }\n\n    this.length = a.length;\n\n    if (carry !== 0) {\n      this._alloc(this.length + 1);\n      this.words[this.length++] = carry;\n    } else if (a !== this) {\n      // Copy the rest of the words.\n      for (; i < a.length; i++)\n        this.words[i] = a.words[i];\n    }\n\n    // Note: we shouldn't need to strip here.\n    return this;\n  }\n\n  _iaddn(num) {\n    this.words[0] += num;\n\n    if (this.words[0] < 0x4000000)\n      return this;\n\n    // Carry.\n    let i = 0;\n\n    this._alloc(this.length + 1);\n\n    this.words[this.length] = 0;\n\n    for (; i < this.length && this.words[i] >= 0x4000000; i++) {\n      this.words[i] -= 0x4000000;\n      this.words[i + 1] += 1;\n    }\n\n    this.length = Math.max(this.length, i + 1);\n\n    // Note: we shouldn't need to strip here.\n    return this;\n  }\n\n  /*\n   * Addition\n   */\n\n  iadd(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    if (this.negative === num.negative) {\n      // x + y == x + y\n      // (-x) + (-y) == -(x + y)\n      this._iadd(this, num);\n    } else {\n      // x + (-y) == x - y == -(y - x)\n      // (-x) + y == y - x == -(x - y)\n      const cmp = this.ucmp(num);\n\n      // x + (-x) == (-x) + x == 0\n      if (cmp === 0) {\n        this.words[0] = 0;\n        this.length = 1;\n        this.negative = 0;\n        return this;\n      }\n\n      if (cmp < 0) {\n        this._isub(num, this);\n        this.negative ^= 1;\n      } else {\n        this._isub(this, num);\n      }\n    }\n\n    return this;\n  }\n\n  iaddn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    const negative = (num < 0) | 0;\n\n    if (negative)\n      num = -num;\n\n    if (this.negative === negative) {\n      // x + y == x + y\n      // (-x) + (-y) == -(x + y)\n      this._iaddn(num);\n    } else {\n      // x + (-y) == x - y == -(y - x)\n      // (-x) + y == y - x == -(x - y)\n      if (this.length === 1 && this.words[0] < num) {\n        this.words[0] = num - this.words[0];\n        this.negative ^= 1;\n      } else {\n        this._isubn(num);\n      }\n    }\n\n    return this;\n  }\n\n  add(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    if (num.length > this.length)\n      return num.clone().iadd(this);\n\n    return this.clone().iadd(num);\n  }\n\n  addn(num) {\n    return this.clone().iaddn(num);\n  }\n\n  /*\n   * Subtraction Engine\n   */\n\n  _isub(a, b) {\n    let carry = 0;\n    let i = 0;\n\n    // a > b\n    assert(a.length >= b.length);\n\n    if (a !== this)\n      this._alloc(a.length);\n\n    for (; i < b.length; i++) {\n      const r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n\n      carry = r >> 26;\n\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    for (; carry !== 0 && i < a.length; i++) {\n      const r = (a.words[i] | 0) + carry;\n\n      carry = r >> 26;\n\n      this.words[i] = r & 0x3ffffff;\n    }\n\n    assert(carry === 0);\n\n    // Copy rest of the words.\n    if (a !== this) {\n      for (; i < a.length; i++)\n        this.words[i] = a.words[i];\n    }\n\n    this.length = Math.max(this.length, i);\n\n    return this._strip();\n  }\n\n  _isubn(num) {\n    this.words[0] -= num;\n\n    if (this.words[0] >= 0)\n      return this._normalize();\n\n    assert(this.length !== 1);\n\n    // Carry.\n    this._alloc(this.length + 1);\n\n    for (let i = 0; i < this.length && this.words[i] < 0; i++) {\n      this.words[i] += 0x4000000;\n      this.words[i + 1] -= 1;\n    }\n\n    this.words[this.length] = 0;\n\n    return this._strip();\n  }\n\n  /*\n   * Subtraction\n   */\n\n  isub(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    if (this.negative !== num.negative) {\n      // x - (-y) == x + y\n      // (-x) - y == -(x + y)\n      this._iadd(this, num);\n    } else {\n      // x - y == x - y == -(y - x)\n      // (-x) - (-y) == y - x == -(x - y)\n      const cmp = this.ucmp(num);\n\n      // x - x == 0\n      if (cmp === 0) {\n        this.words[0] = 0;\n        this.length = 1;\n        this.negative = 0;\n        return this;\n      }\n\n      if (cmp < 0) {\n        this._isub(num, this);\n        this.negative ^= 1;\n      } else {\n        this._isub(this, num);\n      }\n    }\n\n    return this;\n  }\n\n  isubn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    const negative = (num < 0) | 0;\n\n    if (negative)\n      num = -num;\n\n    if (this.negative !== negative) {\n      // x - (-y) == x + y\n      // (-x) - y == -(x + y)\n      this._iaddn(num);\n    } else {\n      // x - y == x - y == -(y - x)\n      // (-x) - (-y) == y - x == -(x - y)\n      if (this.length === 1 && this.words[0] < num) {\n        this.words[0] = num - this.words[0];\n        this.negative ^= 1;\n      } else {\n        this._isubn(num);\n      }\n    }\n\n    return this;\n  }\n\n  sub(num) {\n    return this.clone().isub(num);\n  }\n\n  subn(num) {\n    return this.clone().isubn(num);\n  }\n\n  /*\n   * Multiplication Engine\n   */\n\n  _mul(num, out) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    enforce(BN.isBN(out), 'out', 'bignum');\n\n    if (this.length === 10 && num.length === 10)\n      return comb10MulTo(this, num, out);\n\n    const len = this.length + num.length;\n\n    if (len < 63)\n      return smallMulTo(this, num, out);\n\n    if (len < 1024)\n      return bigMulTo(this, num, out);\n\n    return jumboMulTo(this, num, out);\n  }\n\n  /*\n   * Multiplication\n   */\n\n  imul(num) {\n    return this.mul(num)._move(this);\n  }\n\n  imuln(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    const neg = (num < 0) | 0;\n\n    if (neg)\n      num = -num;\n\n    // Carry.\n    let carry = 0;\n\n    for (let i = 0; i < this.length; i++) {\n      const w = this.words[i] * num;\n      const lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n\n      carry >>= 26;\n      carry += (w / 0x4000000) | 0;\n      carry += lo >>> 26;\n\n      this.words[i] = lo & 0x3ffffff;\n    }\n\n    this.negative ^= neg;\n\n    if (carry !== 0) {\n      this._alloc(this.length + 1);\n      this.words[this.length++] = carry;\n    } else {\n      this._strip();\n    }\n\n    return this;\n  }\n\n  mul(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    const len = this.length + num.length;\n    const out = new BN();\n\n    out.words = new Array(len);\n\n    for (let i = 0; i < len; i ++)\n      out.words[i] = 0;\n\n    return this._mul(num, out);\n  }\n\n  muln(num) {\n    return this.clone().imuln(num);\n  }\n\n  /*\n   * Multiplication + Shift\n   */\n\n  mulShift(num, bits) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    enforce((bits >>> 0) === bits, 'bits', 'uint32');\n\n    const r = this.mul(num);\n    const b = r.utestn(bits - 1);\n\n    r.iushrn(bits);\n\n    if (this.negative ^ num.negative)\n      return r.isubn(b);\n\n    return r.iaddn(b);\n  }\n\n  /*\n   * Division Engine\n   */\n\n  _div(num, flags) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    assert((flags & modes.ALL) === flags);\n    assert(flags !== modes.NONE);\n\n    const a = this;\n    const b = num;\n\n    nonzero(!b.isZero());\n\n    if (a.isZero())\n      return [new BN(0), new BN(0)];\n\n    const as = a.negative;\n    const bs = b.negative;\n\n    a.negative = 0;\n    b.negative = 0;\n\n    let q = null;\n    let r = null;\n\n    if (a.ucmp(b) < 0) {\n      if (flags & modes.QUO)\n        q = new BN(0);\n\n      if (flags & modes.REM)\n        r = a.clone();\n    } else if (b.length === 1) {\n      if (flags & modes.QUO)\n        q = a.quon(b.words[0]);\n\n      if (flags & modes.REM)\n        r = a.remn(b.words[0]);\n    } else {\n      [q, r] = a._wordDiv(b, flags);\n    }\n\n    a.negative = as;\n    b.negative = bs;\n\n    if (flags & modes.QUO) {\n      q.negative = a.negative ^ b.negative;\n      q._normalize();\n    }\n\n    if (flags & modes.REM) {\n      r.negative = a.negative;\n      r._normalize();\n    }\n\n    if (flags & modes.EUCLID) {\n      if (flags & modes.QUO) {\n        assert((flags & modes.REM) !== 0);\n\n        if (r.negative !== 0) {\n          if (b.negative !== 0)\n            q.iaddn(1);\n          else\n            q.isubn(1);\n        }\n      }\n\n      if (flags & modes.REM) {\n        if (r.negative !== 0) {\n          if (b.negative !== 0)\n            r.isub(b);\n          else\n            r.iadd(b);\n        }\n      }\n    }\n\n    return [q, r];\n  }\n\n  _wordDiv(num, flags) {\n    let a = this.clone();\n    let b = num;\n    let q = null;\n    let hi;\n\n    // Normalize.\n    const word = b.words[b.length - 1] | 0;\n    const shift = 26 - countBits(word);\n\n    if (shift !== 0) {\n      b = b.clone();\n\n      a.iushln(shift);\n      b.iushln(shift);\n\n      hi = b.words[b.length - 1] | 0;\n    } else {\n      hi = word;\n    }\n\n    // Initialize quotient.\n    const m = a.length - b.length;\n\n    assert(m >= 0);\n\n    if (flags & modes.QUO) {\n      q = new BN(0);\n      q.length = m + 1;\n      q.words = new Array(q.length);\n\n      for (let i = 0; i < q.length; i++)\n        q.words[i] = 0;\n    }\n\n    // Diff.\n    const d = a.clone();\n\n    d._ishlnsubmul(b, 1, m);\n\n    if (d.negative === 0) {\n      if (q)\n        q.words[m] = 1;\n\n      a = d;\n    }\n\n    // Divide.\n    for (let j = m - 1; j >= 0; j--) {\n      const ahi = a.words[b.length + j];\n      const alo = a.words[b.length + j - 1];\n      const quo = ((ahi * 0x4000000 + alo) / hi) | 0;\n\n      let qj = Math.min(quo, 0x3ffffff);\n\n      a._ishlnsubmul(b, qj, j);\n\n      while (a.negative !== 0) {\n        qj -= 1;\n        a.negative = 0;\n        a._ishlnsubmul(b, 1, j);\n        a.ineg();\n      }\n\n      if (q)\n        q.words[j] = qj;\n    }\n\n    // Strip.\n    if (q)\n      q._strip();\n\n    // Denormalize.\n    // Note: we shouldn't need to strip `a` here.\n    if ((flags & modes.REM) && shift !== 0)\n      a.iushrn(shift);\n\n    return [q, a];\n  }\n\n  _ishlnsubmul(num, mul, shift) {\n    let carry = 0;\n    let i = 0;\n\n    this._expand(num.length + shift);\n\n    for (; i < num.length; i++) {\n      const k = (this.words[i + shift] | 0) + carry;\n      const r = num.words[i] * mul;\n      const w = k - (r & 0x3ffffff);\n\n      carry = (w >> 26) - ((r / 0x4000000) | 0);\n\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    for (; i < this.length - shift; i++) {\n      const w = (this.words[i + shift] | 0) + carry;\n\n      carry = w >> 26;\n\n      this.words[i + shift] = w & 0x3ffffff;\n    }\n\n    if (carry === 0)\n      return this._strip();\n\n    // Subtraction overflow.\n    assert(carry === -1);\n\n    carry = 0;\n\n    for (let i = 0; i < this.length; i++) {\n      const w = -(this.words[i] | 0) + carry;\n\n      carry = w >> 26;\n\n      this.words[i] = w & 0x3ffffff;\n    }\n\n    this.negative = 1;\n\n    return this._strip();\n  }\n\n  /*\n   * Truncation Division + Modulo\n   */\n\n  quorem(num) {\n    return this._div(num, modes.BOTH);\n  }\n\n  /*\n   * Truncation Division\n   */\n\n  iquo(num) {\n    return this.quo(num)._move(this);\n  }\n\n  iquon(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    nonzero(num !== 0);\n\n    const neg = (num < 0) | 0;\n\n    if (neg)\n      num = -num;\n\n    let carry = 0;\n\n    for (let i = this.length - 1; i >= 0; i--) {\n      const w = (this.words[i] | 0) + carry * 0x4000000;\n\n      this.words[i] = (w / num) | 0;\n\n      carry = w % num;\n    }\n\n    this.negative ^= neg;\n\n    return this._strip();\n  }\n\n  quo(num) {\n    return this._div(num, modes.QUO)[0];\n  }\n\n  quon(num) {\n    return this.clone().iquon(num);\n  }\n\n  /*\n   * Truncation Modulo\n   */\n\n  irem(num) {\n    return this.rem(num)._move(this);\n  }\n\n  iremn(num) {\n    let m = this.remrn(num);\n\n    if (m < 0)\n      m = -m;\n\n    this.words[0] = m;\n    this.length = 1;\n\n    return this._normalize();\n  }\n\n  rem(num) {\n    return this._div(num, modes.REM)[1];\n  }\n\n  remn(num) {\n    return this.clone().iremn(num);\n  }\n\n  remrn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    nonzero(num !== 0);\n\n    if (num < 0)\n      num = -num;\n\n    const p = (1 << 26) % num;\n\n    let acc = 0;\n\n    for (let i = this.length - 1; i >= 0; i--)\n      acc = (p * acc + (this.words[i] | 0)) % num;\n\n    return this.negative !== 0 ? (-acc | 0) : acc;\n  }\n\n  /*\n   * Euclidean Division + Modulo\n   */\n\n  divmod(num) {\n    return this._div(num, modes.BOTH | modes.EUCLID);\n  }\n\n  /*\n   * Euclidean Division\n   */\n\n  idiv(num) {\n    return this.div(num)._move(this);\n  }\n\n  idivn(num) {\n    if (this.negative === 0)\n      return this.iquon(num);\n\n    const r = this.remrn(num);\n\n    this.iquon(num);\n\n    if (r < 0) {\n      if (num < 0)\n        this.iaddn(1);\n      else\n        this.isubn(1);\n    }\n\n    return this;\n  }\n\n  div(num) {\n    return this._div(num, modes.BOTH | modes.EUCLID)[0];\n  }\n\n  divn(num) {\n    return this.clone().idivn(num);\n  }\n\n  /*\n   * Euclidean Modulo\n   */\n\n  imod(num) {\n    if (this.ucmp(num) < 0) {\n      if (this.negative !== 0) {\n        this._isub(num, this);\n        this.negative = 0;\n      }\n      return this;\n    }\n\n    return this.mod(num)._move(this);\n  }\n\n  imodn(num) {\n    this.words[0] = this.modrn(num);\n    this.length = 1;\n    this.negative = 0;\n    return this;\n  }\n\n  mod(num) {\n    return this._div(num, modes.REM | modes.EUCLID)[1];\n  }\n\n  modn(num) {\n    return this.clone().imodn(num);\n  }\n\n  modrn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    let r = this.remrn(num);\n\n    if (r < 0) {\n      if (num < 0)\n        r -= num;\n      else\n        r += num;\n    }\n\n    return r;\n  }\n\n  /*\n   * Round Division\n   */\n\n  divRound(num) {\n    const [q, r] = this.quorem(num);\n\n    // Fast case - exact division.\n    if (r.isZero())\n      return q;\n\n    const bit = num.words[0] & 1;\n\n    num.iushrn(1);\n\n    const cmp = r.ucmp(num);\n\n    num.iushln(1);\n\n    num.words[0] |= bit;\n\n    // Round down.\n    if (cmp < 0 || (num.isOdd() && cmp === 0))\n      return q;\n\n    // Round up.\n    if (this.negative ^ num.negative)\n      return q.isubn(1);\n\n    return q.iaddn(1);\n  }\n\n  /*\n   * Exponentiation\n   */\n\n  ipow(num) {\n    return this.pow(num)._move(this);\n  }\n\n  ipown(num) {\n    return this.pown(num)._move(this);\n  }\n\n  pow(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    let b = countBits(num.words[num.length - 1]);\n    let r = new BN(1);\n\n    for (let i = num.length - 1; i >= 0; i--) {\n      const word = num.words[i];\n\n      for (let j = b - 1; j >= 0; j--) {\n        r = r.sqr();\n\n        if ((word >> j) & 1)\n          r = r.mul(this);\n      }\n\n      b = 26;\n    }\n\n    return r;\n  }\n\n  pown(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    if (num < 0)\n      num = -num;\n\n    if (num === 0)\n      return new BN(1);\n\n    if (num === 1)\n      return this.clone();\n\n    const bits = countBits(num);\n\n    let r = this;\n\n    for (let i = bits - 2; i >= 0; i--) {\n      r = r.sqr();\n\n      if ((num >> i) & 1)\n        r = r.mul(this);\n    }\n\n    return r;\n  }\n\n  isqr() {\n    return this.imul(this);\n  }\n\n  sqr() {\n    return this.mul(this);\n  }\n\n  /*\n   * Roots Engine\n   */\n\n  _rootrem(pow, rem) {\n    enforce((pow >>> 0) === pow, 'num', 'uint32');\n\n    if (pow === 0)\n      throw new RangeError('Zeroth root.');\n\n    if (~pow & this.negative)\n      throw new RangeError('Negative with even root.');\n\n    if (this.ucmpn(1) <= 0)\n      return [this.clone(), new BN(0)];\n\n    let u = new BN(0);\n    let t = BN.shift(1, this.bitLength() / pow + 1 | 0);\n    let v, r;\n\n    if (this.negative !== 0)\n      t.ineg();\n\n    if (pow === 2) {\n      do {\n        u = t;\n        t = this.quo(u);\n        t.iadd(u);\n        t.iushrn(1);\n      } while (t.ucmp(u) < 0);\n    } else {\n      do {\n        u = t;\n        t = u.pown(pow - 1);\n        t = this.quo(t);\n        v = u.muln(pow - 1);\n        t.iadd(v);\n        t = t.quon(pow);\n      } while (t.ucmp(u) < 0);\n    }\n\n    if (rem) {\n      t = u.pown(pow);\n      r = this.sub(t);\n    }\n\n    return [u, r];\n  }\n\n  /*\n   * Roots\n   */\n\n  rootrem(pow) {\n    return this._rootrem(pow, 1);\n  }\n\n  iroot(pow) {\n    return this.root(pow)._move(this);\n  }\n\n  root(pow) {\n    return this._rootrem(pow, 0)[0];\n  }\n\n  isPower(pow) {\n    enforce((pow >>> 0) === pow, 'num', 'uint32');\n\n    if (pow === 0 || (~pow & this.negative))\n      return false;\n\n    const [, r] = this.rootrem(pow);\n\n    return r.sign() === 0;\n  }\n\n  sqrtrem() {\n    return this.rootrem(2);\n  }\n\n  isqrt() {\n    return this.sqrt()._move(this);\n  }\n\n  sqrt() {\n    return this.root(2);\n  }\n\n  isSquare() {\n    return this.isPower(2);\n  }\n\n  /*\n   * AND\n   */\n\n  iand(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    let x = this;\n    let y = num;\n\n    if (x === y)\n      return x;\n\n    if ((x.negative | y.negative) === 0)\n      return x.iuand(y);\n\n    if ((x.negative & y.negative) === 1) {\n      // (-x) & (-y) == ~(x-1) & ~(y-1)\n      //             == ~((x-1) | (y-1))\n      //             == -(((x-1) | (y-1)) + 1)\n      x.iaddn(1);\n      y.iaddn(1);\n      x.iuor(y);\n      x.isubn(1);\n      y.isubn(1);\n      return x;\n    }\n\n    // Assume x is the positive number.\n    if (x.negative !== 0)\n      [x, y] = [y.clone(), x];\n\n    // x & (-y) == x & ~(y-1)\n    //          == x & ~(y-1)\n    const width = x.bitLength();\n\n    y.iaddn(1);\n    y.inotn(width);\n    x.iuand(y);\n    y.inotn(width);\n    y.isubn(1);\n\n    return x._move(this);\n  }\n\n  iandn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    if ((this.negative | (num < 0)) !== 0)\n      return this.iand(new BN(num));\n\n    this.words[0] &= num;\n    this.length = 1;\n\n    return this;\n  }\n\n  and(num) {\n    return this.clone().iand(num);\n  }\n\n  andn(num) {\n    return this.clone().iandn(num);\n  }\n\n  andrn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    if ((this.negative | (num < 0)) !== 0) {\n      const n = this.iand(new BN(num));\n\n      if (n.length > 1)\n        throw new RangeError('Number exceeds 26 bits.');\n\n      return n.negative !== 0 ? -n.words[0] : n.words[0];\n    }\n\n    return this.words[0] & num;\n  }\n\n  /*\n   * Unsigned AND\n   */\n\n  iuand(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    this.length = Math.min(this.length, num.length);\n\n    for (let i = 0; i < this.length; i++)\n      this.words[i] &= num.words[i];\n\n    return this._strip();\n  }\n\n  iuandn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    this.words[0] &= Math.abs(num);\n    this.length = 1;\n\n    return this._normalize();\n  }\n\n  uand(num) {\n    return this.clone().iuand(num);\n  }\n\n  uandn(num) {\n    return this.clone().iuandn(num);\n  }\n\n  uandrn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    const n = this.words[0] & Math.abs(num);\n\n    return this.negative !== 0 ? (-n | 0) : n;\n  }\n\n  /*\n   * OR\n   */\n\n  ior(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    let x = this;\n    let y = num;\n\n    if (x === y)\n      return x;\n\n    if ((x.negative | y.negative) === 0)\n      return x.iuor(y);\n\n    if ((x.negative & y.negative) === 1) {\n      // (-x) | (-y) == ~(x-1) | ~(y-1)\n      //             == ~((x-1) & (y-1))\n      //             == -(((x-1) & (y-1)) + 1)\n      x.iaddn(1);\n      y.iaddn(1);\n      x.iuand(y);\n      x.isubn(1);\n      y.isubn(1);\n      return x;\n    }\n\n    // Assume x is the positive number.\n    y = y.clone();\n\n    if (x.negative !== 0)\n      [x, y] = [y, x];\n\n    // x | (-y) == x | ~(y-1)\n    //          == ~((y-1) & ~x)\n    //          == -(((y-1) & ~x) + 1)\n    y.iaddn(1);\n    x.inotn(y.bitLength());\n    y.iuand(x);\n    y.isubn(1);\n\n    return y._move(this);\n  }\n\n  iorn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    if ((this.negative | (num < 0)) !== 0)\n      return this.ior(new BN(num));\n\n    this.words[0] |= num;\n\n    return this;\n  }\n\n  or(num) {\n    return this.clone().ior(num);\n  }\n\n  orn(num) {\n    return this.clone().iorn(num);\n  }\n\n  /*\n   * Unsigned OR\n   */\n\n  iuor(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    this._expand(num.length);\n\n    for (let i = 0; i < num.length; i++)\n      this.words[i] |= num.words[i];\n\n    // Note: we shouldn't need to strip here.\n    return this;\n  }\n\n  iuorn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    this.words[0] |= Math.abs(num);\n\n    return this;\n  }\n\n  uor(num) {\n    return this.clone().iuor(num);\n  }\n\n  uorn(num) {\n    return this.clone().iuorn(num);\n  }\n\n  /*\n   * XOR\n   */\n\n  ixor(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    let x = this;\n    let y = num;\n\n    if (x === y) {\n      x.words[0] = 0;\n      x.length = 1;\n      x.negative = 0;\n      return x;\n    }\n\n    if ((x.negative | y.negative) === 0)\n      return x.iuxor(y);\n\n    if ((x.negative & y.negative) === 1) {\n      // (-x) ^ (-y) == ~(x-1) ^ ~(y-1)\n      //             == (x-1) ^ (y-1)\n      x.iaddn(1);\n      y.iaddn(1);\n      x.iuxor(y);\n      x.ineg();\n      y.isubn(1);\n      return x;\n    }\n\n    // Assume x is the positive number.\n    if (x.negative !== 0)\n      [x, y] = [y.clone(), x];\n\n    // x ^ (-y) == x ^ ~(y-1)\n    //          == ~(x ^ (y-1))\n    //          == -((x ^ (y-1)) + 1)\n    y.iaddn(1);\n    x.iuxor(y);\n    x.iaddn(1);\n    x.ineg();\n    y.isubn(1);\n\n    return x._move(this);\n  }\n\n  ixorn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    if ((this.negative | (num < 0)) !== 0)\n      return this.ixor(new BN(num));\n\n    this.words[0] ^= num;\n\n    return this;\n  }\n\n  xor(num) {\n    return this.clone().ixor(num);\n  }\n\n  xorn(num) {\n    return this.clone().ixorn(num);\n  }\n\n  /*\n   * Unsigned XOR\n   */\n\n  iuxor(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    let a = this;\n    let b = num;\n\n    if (a.length < b.length)\n      [a, b] = [b, a];\n\n    let i = 0;\n\n    for (; i < b.length; i++)\n      this.words[i] = a.words[i] ^ b.words[i];\n\n    if (a !== this) {\n      this._alloc(a.length);\n\n      for (; i < a.length; i++)\n        this.words[i] = a.words[i];\n    }\n\n    this.length = a.length;\n\n    return this._strip();\n  }\n\n  iuxorn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    this.words[0] ^= Math.abs(num);\n\n    return this._normalize();\n  }\n\n  uxor(num) {\n    return this.clone().iuxor(num);\n  }\n\n  uxorn(num) {\n    return this.clone().iuxorn(num);\n  }\n\n  /*\n   * NOT\n   */\n\n  inot() {\n    if (this.negative !== 0) {\n      // ~(-x) == ~(~(x-1)) == x-1\n      this.ineg().isubn(1);\n    } else {\n      // ~x == -x-1 == -(x+1)\n      this.iaddn(1).ineg();\n    }\n    return this;\n  }\n\n  not() {\n    return this.clone().inot();\n  }\n\n  inotn(width) {\n    enforce((width >>> 0) === width, 'width', 'uint32');\n\n    const r = width % 26;\n\n    let s = Math.ceil(width / 26);\n    let i = 0;\n\n    // Extend the buffer with leading zeroes.\n    this._expand(s);\n\n    if (r > 0)\n      s -= 1;\n\n    // Handle complete words.\n    for (; i < s; i++)\n      this.words[i] ^= 0x3ffffff;\n\n    // Handle the residue.\n    if (r > 0)\n      this.words[i] ^= (1 << r) - 1;\n\n    // And remove leading zeroes.\n    return this._strip();\n  }\n\n  notn(width) {\n    return this.clone().inotn(width);\n  }\n\n  /*\n   * Left Shift\n   */\n\n  ishl(num) {\n    enforce(BN.isBN(num), 'bits', 'bignum');\n    enforce(num.bitLength() <= 32, 'bits', 'uint32');\n    return this.ishln(num.toNumber());\n  }\n\n  ishln(bits) {\n    return this.iushln(bits);\n  }\n\n  shl(num) {\n    return this.clone().ishl(num);\n  }\n\n  shln(bits) {\n    return this.clone().ishln(bits);\n  }\n\n  /*\n   * Unsigned Left Shift\n   */\n\n  iushl(num) {\n    enforce(BN.isBN(num), 'bits', 'bignum');\n    enforce(num.bitLength() <= 32, 'bits', 'uint32');\n    return this.iushln(num.toNumber());\n  }\n\n  iushln(bits) {\n    enforce((bits >>> 0) === bits, 'bits', 'uint32');\n\n    const r = bits % 26;\n    const s = (bits - r) / 26;\n    const mask = ((1 << r) - 1) << (26 - r);\n\n    if (r !== 0) {\n      let carry = 0;\n\n      for (let i = 0; i < this.length; i++) {\n        const ncarry = this.words[i] & mask;\n        const c = ((this.words[i] | 0) - ncarry) << r;\n\n        this.words[i] = c | carry;\n\n        carry = ncarry >>> (26 - r);\n      }\n\n      if (carry !== 0) {\n        this._alloc(this.length + 1);\n        this.words[this.length++] = carry;\n      }\n    }\n\n    if (s !== 0) {\n      this._alloc(this.length + s);\n\n      for (let i = this.length - 1; i >= 0; i--)\n        this.words[i + s] = this.words[i];\n\n      for (let i = 0; i < s; i++)\n        this.words[i] = 0;\n\n      this.length += s;\n    }\n\n    return this._strip();\n  }\n\n  ushl(num) {\n    return this.clone().iushl(num);\n  }\n\n  ushln(bits) {\n    return this.clone().iushln(bits);\n  }\n\n  /*\n   * Right Shift Engine\n   */\n\n  _split(bits, output) {\n    const r = bits % 26;\n    const s = Math.min((bits - r) / 26, this.length);\n    const mask = (1 << r) - 1;\n\n    // Extended mode, copy masked part.\n    if (output) {\n      output._alloc(s);\n\n      for (let i = 0; i < s; i++)\n        output.words[i] = this.words[i];\n\n      output.length = s;\n    }\n\n    if (s === 0) {\n      // No-op, we should not move anything at all.\n    } else if (this.length > s) {\n      this.length -= s;\n      for (let i = 0; i < this.length; i++)\n        this.words[i] = this.words[i + s];\n    } else {\n      this.words[0] = 0;\n      this.length = 1;\n    }\n\n    let carry = 0;\n\n    if (r !== 0) {\n      for (let i = this.length - 1; i >= 0; i--) {\n        const word = this.words[i] | 0;\n\n        this.words[i] = (carry << (26 - r)) | (word >>> r);\n\n        carry = word & mask;\n      }\n    }\n\n    // Push carried bits as a mask.\n    if (output) {\n      if (carry !== 0) {\n        output._alloc(output.length + 1);\n        output.words[output.length++] = carry;\n      } else {\n        if (output.length === 0)\n          output.words[output.length++] = 0;\n\n        output._strip();\n      }\n    }\n\n    return this._strip();\n  }\n\n  /*\n   * Right Shift\n   */\n\n  ishr(num) {\n    enforce(BN.isBN(num), 'bits', 'bignum');\n    enforce(num.bitLength() <= 32, 'bits', 'uint32');\n    return this.ishrn(num.toNumber());\n  }\n\n  ishrn(bits) {\n    enforce((bits >>> 0) === bits, 'bits', 'uint32');\n\n    if (this.negative !== 0) {\n      // (-x) >> y == ~(x-1) >> y\n      //           == ~((x-1) >> y)\n      //           == -(((x-1) >> y) + 1)\n      this.iaddn(1);\n      this.iushrn(bits);\n      this.isubn(1);\n      return this;\n    }\n\n    return this.iushrn(bits);\n  }\n\n  shr(num) {\n    return this.clone().ishr(num);\n  }\n\n  shrn(bits) {\n    return this.clone().ishrn(bits);\n  }\n\n  /*\n   * Unsigned Right Shift\n   */\n\n  iushr(num) {\n    enforce(BN.isBN(num), 'bits', 'bignum');\n    enforce(num.bitLength() <= 32, 'bits', 'uint32');\n    return this.iushrn(num.toNumber());\n  }\n\n  iushrn(bits) {\n    enforce((bits >>> 0) === bits, 'bits', 'uint32');\n    return this._split(bits, null);\n  }\n\n  ushr(num) {\n    return this.clone().iushr(num);\n  }\n\n  ushrn(bits) {\n    return this.clone().iushrn(bits);\n  }\n\n  /*\n   * Bit Manipulation\n   */\n\n  setn(bit, val) {\n    enforce((bit >>> 0) === bit, 'bit', 'uint32');\n\n    if (this.negative !== 0) {\n      this.iaddn(1);\n      this.usetn(bit, !val);\n      this.isubn(1);\n      return this;\n    }\n\n    return this.usetn(bit, val);\n  }\n\n  usetn(bit, val) {\n    enforce((bit >>> 0) === bit, 'bit', 'uint32');\n\n    const r = bit % 26;\n    const s = (bit - r) / 26;\n\n    this._expand(s + 1);\n\n    if (val)\n      this.words[s] |= (1 << r);\n    else\n      this.words[s] &= ~(1 << r);\n\n    return this._strip();\n  }\n\n  testn(bit) {\n    enforce((bit >>> 0) === bit, 'bit', 'uint32');\n\n    const r = bit % 26;\n    const s = (bit - r) / 26;\n\n    // Fast case: bit is much higher than all existing words.\n    if (this.length <= s)\n      return this.negative;\n\n    // Check bit and return.\n    const w = this.words[s];\n    const val = (w >> r) & 1;\n\n    if (this.negative !== 0) {\n      if (r > 0 && (w & ((1 << r) - 1)))\n        return val ^ 1;\n\n      let j = s;\n\n      while (j--) {\n        if (this.words[j] > 0)\n          return val ^ 1;\n      }\n    }\n\n    return val;\n  }\n\n  utestn(bit) {\n    enforce((bit >>> 0) === bit, 'bit', 'uint32');\n\n    const r = bit % 26;\n    const s = (bit - r) / 26;\n\n    // Fast case: bit is much higher than all existing words.\n    if (this.length <= s)\n      return 0;\n\n    // Check bit and return.\n    return (this.words[s] >> r) & 1;\n  }\n\n  imaskn(bits) {\n    enforce((bits >>> 0) === bits, 'bits', 'uint32');\n\n    if (this.negative !== 0) {\n      this.iaddn(1);\n      this.inotn(bits + 1);\n      this.ineg();\n    }\n\n    return this.iumaskn(bits);\n  }\n\n  maskn(bits) {\n    return this.clone().imaskn(bits);\n  }\n\n  iumaskn(bits) {\n    enforce((bits >>> 0) === bits, 'bits', 'uint32');\n\n    const r = bits % 26;\n\n    let s = (bits - r) / 26;\n\n    if (this.length <= s)\n      return this;\n\n    if (r !== 0)\n      s += 1;\n\n    this.length = Math.min(s, this.length);\n\n    if (r !== 0)\n      this.words[this.length - 1] &= (1 << r) - 1;\n\n    if (this.length === 0)\n      this.words[this.length++] = 0;\n\n    return this._strip();\n  }\n\n  umaskn(bits) {\n    return this.clone().iumaskn(bits);\n  }\n\n  andln(num) {\n    return this.words[0] & num;\n  }\n\n  bit(pos) {\n    return this.utestn(pos);\n  }\n\n  bits(pos, width) {\n    enforce((pos >>> 0) === pos, 'pos', 'uint32');\n    enforce((width >>> 0) === width, 'width', 'uint32');\n    enforce(width <= 26, 'width', 'width');\n\n    const shift = pos % 26;\n    const index = (pos - shift) / 26;\n\n    if (index >= this.length)\n      return 0;\n\n    let bits = (this.words[index] >> shift) & ((1 << width) - 1);\n\n    if (shift + width > 26 && index + 1 < this.length) {\n      const more = shift + width - 26;\n      const next = this.words[index + 1] & ((1 << more) - 1);\n\n      bits |= next << (26 - shift);\n    }\n\n    return bits;\n  }\n\n  /*\n   * Negation\n   */\n\n  ineg() {\n    if (!this.isZero())\n      this.negative ^= 1;\n\n    return this;\n  }\n\n  neg() {\n    return this.clone().ineg();\n  }\n\n  iabs() {\n    this.negative = 0;\n    return this;\n  }\n\n  abs() {\n    return this.clone().iabs();\n  }\n\n  /*\n   * Comparison\n   */\n\n  cmp(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    if (this.negative !== num.negative)\n      return num.negative - this.negative;\n\n    const res = this.ucmp(num);\n\n    if (this.negative !== 0)\n      return -res | 0;\n\n    return res;\n  }\n\n  cmpn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    const negative = (num < 0) | 0;\n\n    if (this.negative !== negative)\n      return negative - this.negative;\n\n    const res = this.ucmpn(num);\n\n    if (this.negative !== 0)\n      return -res | 0;\n\n    return res;\n  }\n\n  eq(num) {\n    return this.cmp(num) === 0;\n  }\n\n  eqn(num) {\n    return this.cmpn(num) === 0;\n  }\n\n  gt(num) {\n    return this.cmp(num) > 0;\n  }\n\n  gtn(num) {\n    return this.cmpn(num) > 0;\n  }\n\n  gte(num) {\n    return this.cmp(num) >= 0;\n  }\n\n  gten(num) {\n    return this.cmpn(num) >= 0;\n  }\n\n  lt(num) {\n    return this.cmp(num) < 0;\n  }\n\n  ltn(num) {\n    return this.cmpn(num) < 0;\n  }\n\n  lte(num) {\n    return this.cmp(num) <= 0;\n  }\n\n  lten(num) {\n    return this.cmpn(num) <= 0;\n  }\n\n  sign() {\n    if (this.negative !== 0)\n      return -1;\n\n    if (this.length === 1 && this.words[0] === 0)\n      return 0;\n\n    return 1;\n  }\n\n  isZero() {\n    return this.length === 1 && this.words[0] === 0;\n  }\n\n  isNeg() {\n    return this.negative !== 0;\n  }\n\n  isPos() {\n    return this.negative === 0;\n  }\n\n  isOdd() {\n    return (this.words[0] & 1) === 1;\n  }\n\n  isEven() {\n    return (this.words[0] & 1) === 0;\n  }\n\n  /*\n   * Unsigned Comparison\n   */\n\n  ucmp(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    if (this.length < num.length)\n      return -1;\n\n    if (this.length > num.length)\n      return 1;\n\n    for (let i = this.length - 1; i >= 0; i--) {\n      const a = this.words[i] | 0;\n      const b = num.words[i] | 0;\n\n      if (a === b)\n        continue;\n\n      return (a > b) - (a < b);\n    }\n\n    return 0;\n  }\n\n  ucmpn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n\n    if (this.length > 1)\n      return 1;\n\n    const w = this.words[0] | 0;\n\n    if (num < 0)\n      num = -num;\n\n    return (w > num) - (w < num);\n  }\n\n  /*\n   * Number Theoretic Functions\n   */\n\n  legendre(num) {\n    const red = HAS_BIGINT ? BN.red(num) : BN.mont(num);\n    return this.toRed(red).redLegendre();\n  }\n\n  jacobi(num) {\n    // See: A Binary Algorithm for the Jacobi Symbol\n    //   J. Shallit, J. Sorenson\n    //   Page 3, Section 3\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    if (num.isZero() || num.isEven())\n      throw new Error('jacobi: `num` must be odd.');\n\n    let a = this._cloneNormal();\n    let b = num.clone();\n    let j = 1;\n\n    if (b.isNeg()) {\n      if (a.isNeg())\n        j = -1;\n      b.ineg();\n    }\n\n    if (a.isNeg() || a.ucmp(b) >= 0)\n      a.imod(b);\n\n    while (!a.isZero()) {\n      const bits = a._makeOdd();\n\n      if (bits & 1) {\n        const bmod8 = b.andln(7);\n\n        if (bmod8 === 3 || bmod8 === 5)\n          j = -j;\n      }\n\n      if (a.ucmp(b) < 0) {\n        [a, b] = [b, a];\n\n        if (a.andln(3) === 3 && b.andln(3) === 3)\n          j = -j;\n      }\n\n      a._isub(a, b).iushrn(1);\n\n      const bmod8 = b.andln(7);\n\n      if (bmod8 === 3 || bmod8 === 5)\n        j = -j;\n    }\n\n    if (b.cmpn(1) !== 0)\n      return 0;\n\n    return j;\n  }\n\n  kronecker(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    const table = [\n      0,  1, 0, -1,\n      0, -1, 0,  1\n    ];\n\n    let a = this._cloneNormal();\n    let b = num.clone();\n    let k = 1;\n\n    if (b.isZero())\n      return a.ucmpn(1) === 0 ? k : 0;\n\n    if (!a.isOdd() && !b.isOdd())\n      return 0;\n\n    const bits = b._makeOdd();\n\n    if (bits & 1)\n      k = table[a.andln(7)];\n\n    if (b.isNeg()) {\n      if (a.isNeg())\n        k = -k;\n      b.ineg();\n    }\n\n    while (!a.isZero()) {\n      const bits = a._makeOdd();\n\n      if (bits & 1)\n        k *= table[b.andln(7)];\n\n      const w = a.words[0] ^ (a.negative * 0x3ffffff);\n\n      if (w & b.words[0] & 2)\n        k = -k;\n\n      b.imod(a);\n\n      [a, b] = [b, a];\n\n      b.negative = 0;\n    }\n\n    if (b.cmpn(1) !== 0)\n      return 0;\n\n    return k;\n  }\n\n  igcd(num) {\n    return this.gcd(num)._move(this);\n  }\n\n  gcd(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    if (this.isZero())\n      return num.abs();\n\n    if (num.isZero())\n      return this.abs();\n\n    let a = this.clone();\n    let b = num.clone();\n\n    a.negative = 0;\n    b.negative = 0;\n\n    // Remove common factor of two.\n    const shift = a._factor2(b);\n\n    if (shift !== 0) {\n      a.iushrn(shift);\n      b.iushrn(shift);\n    }\n\n    for (;;) {\n      a._makeOdd();\n      b._makeOdd();\n\n      const cmp = a.ucmp(b);\n\n      if (cmp < 0) {\n        // a > b\n        [a, b] = [b, a];\n      } else if (cmp === 0 || b.ucmpn(1) === 0) {\n        // Break if a == b.\n        // Break if b == 1 to avoid repeated subtraction.\n        break;\n      }\n\n      a._isub(a, b);\n    }\n\n    return b.iushln(shift);\n  }\n\n  ilcm(num) {\n    return this.lcm(num)._move(this);\n  }\n\n  lcm(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    if (this.isZero() || num.isZero())\n      return new BN(0);\n\n    return this.quo(this.gcd(num)).mul(num).iabs();\n  }\n\n  egcd(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    if (this.isZero()) {\n      return [\n        new BN(0),\n        new BN(num.sign()),\n        num.abs()\n      ];\n    }\n\n    if (num.isZero()) {\n      return [\n        new BN(this.sign()),\n        new BN(0),\n        this.abs()\n      ];\n    }\n\n    const x = this.clone();\n    const y = num.clone();\n\n    x.negative = 0;\n    y.negative = 0;\n\n    // A * x + B * y = x\n    const A = new BN(1);\n    const B = new BN(0);\n\n    // C * x + D * y = y\n    const C = new BN(0);\n    const D = new BN(1);\n\n    // Remove common factor of two.\n    const g = x._factor2(y);\n\n    if (g > 0) {\n      x.iushrn(g);\n      y.iushrn(g);\n    }\n\n    const xp = x.clone();\n    const yp = y.clone();\n\n    while (!x.isZero()) {\n      let i = x._makeOdd();\n      let j = y._makeOdd();\n\n      while (i--) {\n        if (A.isOdd() || B.isOdd()) {\n          A.iadd(yp);\n          B.isub(xp);\n        }\n\n        A.iushrn(1);\n        B.iushrn(1);\n      }\n\n      while (j--) {\n        if (C.isOdd() || D.isOdd()) {\n          C.iadd(yp);\n          D.isub(xp);\n        }\n\n        C.iushrn(1);\n        D.iushrn(1);\n      }\n\n      if (x.cmp(y) >= 0) {\n        x.isub(y);\n        A.isub(C);\n        B.isub(D);\n      } else {\n        y.isub(x);\n        C.isub(A);\n        D.isub(B);\n      }\n    }\n\n    if (this.negative !== 0)\n      C.ineg();\n\n    if (num.negative !== 0)\n      D.ineg();\n\n    return [C, D, y.iushln(g)];\n  }\n\n  iinvert(num) {\n    return this.invert(num)._move(this);\n  }\n\n  invert(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    range(num.sign() > 0, 'invert');\n\n    if (num.isOdd())\n      return this._invertp(num);\n\n    if (num.cmpn(1) === 0)\n      throw new RangeError('Not invertible.');\n\n    const [s,, g] = this.egcd(num);\n\n    if (g.cmpn(1) !== 0)\n      throw new RangeError('Not invertible.');\n\n    return s.imod(num);\n  }\n\n  ifermat(num) {\n    return this.fermat(num)._move(this);\n  }\n\n  fermat(num) {\n    const red = HAS_BIGINT ? BN.red(num) : BN.mont(num);\n    return this.toRed(red).redFermat().fromRed();\n  }\n\n  ipowm(y, m, mont) {\n    return this.powm(y, m, mont)._move(this);\n  }\n\n  powm(y, m, mont) {\n    const red = !HAS_BIGINT && mont ? BN.mont(m) : BN.red(m);\n    return this.toRed(red).redPow(y).fromRed();\n  }\n\n  ipowmn(y, m, mont) {\n    return this.powmn(y, m, mont)._move(this);\n  }\n\n  powmn(y, m, mont) {\n    const red = mont ? BN.mont(m) : BN.red(m);\n    return this.toRed(red).redPown(y).fromRed();\n  }\n\n  isqrtm(p) {\n    return this.sqrtm(p)._move(this);\n  }\n\n  sqrtm(p) {\n    enforce(BN.isBN(p), 'p', 'bignum');\n\n    let red;\n\n    if (p.andln(3) === 3 || p.andln(7) === 5) {\n      // Probably not worth the setup.\n      red = BN.red(p);\n    } else {\n      red = BN.mont(p);\n    }\n\n    return this.toRed(red).redSqrt().fromRed();\n  }\n\n  isqrtpq(p, q) {\n    return this.sqrtpq(p, q)._move(this);\n  }\n\n  sqrtpq(p, q) {\n    const sp = this.sqrtm(p);\n    const sq = this.sqrtm(q);\n    const [mp, mq] = p.egcd(q);\n    const lhs = sq.mul(mp).mul(p);\n    const rhs = sp.mul(mq).mul(q);\n    const n = p.mul(q);\n\n    return lhs.iadd(rhs).imod(n);\n  }\n\n  /*\n   * Primality Testing\n   */\n\n  isPrime(rng, reps, limit) {\n    enforce((reps >>> 0) === reps, 'reps', 'uint32');\n\n    if (!this.isPrimeMR(rng, reps + 1, true))\n      return false;\n\n    if (!this.isPrimeLucas(limit))\n      return false;\n\n    return true;\n  }\n\n  isPrimeMR(rng, reps, force2 = false) {\n    enforce((reps >>> 0) === reps, 'reps', 'uint32');\n    enforce(reps > 0, 'reps', 'integer');\n    enforce(typeof force2 === 'boolean', 'force2', 'boolean');\n\n    const n = this;\n\n    if (n.cmpn(7) < 0) {\n      return n.cmpn(2) === 0\n          || n.cmpn(3) === 0\n          || n.cmpn(5) === 0;\n    }\n\n    if (n.isEven())\n      return false;\n\n    const nm1 = n.subn(1);\n    const nm3 = nm1.subn(2);\n    const k = nm1.zeroBits();\n    const q = nm1.ushrn(k);\n\n    const red = BN.red(n);\n    const rnm1 = nm1.toRed(red);\n    const rone = new BN(1).toRed(red);\n\nnext:\n    for (let i = 0; i < reps; i++) {\n      let x;\n\n      if (i === reps - 1 && force2) {\n        x = new BN(2);\n      } else {\n        x = BN.random(rng, 0, nm3);\n        x.iaddn(2);\n      }\n\n      let y = x.toRed(red).redPow(q);\n\n      if (y.cmp(rone) === 0 || y.cmp(rnm1) === 0)\n        continue;\n\n      for (let j = 1; j < k; j++) {\n        y = y.redSqr();\n\n        if (y.cmp(rnm1) === 0)\n          continue next;\n\n        if (y.cmp(rone) === 0)\n          return false;\n      }\n\n      return false;\n    }\n\n    return true;\n  }\n\n  isPrimeLucas(limit = 0) {\n    enforce((limit >>> 0) === limit, 'limit', 'uint32');\n\n    const n = this;\n\n    // Ignore 0 and 1.\n    if (n.cmpn(1) <= 0)\n      return false;\n\n    // Two is the only even prime.\n    if (n.isEven())\n      return n.cmpn(2) === 0;\n\n    let p = 3;\n\n    for (;;) {\n      if (p > 10000) {\n        // Thought to be impossible.\n        throw new Error(`Cannot find (D/n) = -1 for ${n.toString(10)}.`);\n      }\n\n      if (limit !== 0 && p > limit) {\n        // Optional DoS limit.\n        return false;\n      }\n\n      const d = new BN(p * p - 4);\n      const j = d.jacobi(n);\n\n      if (j === -1)\n        break;\n\n      if (j === 0)\n        return n.cmpn(p + 2) === 0;\n\n      if (p === 40) {\n        if (n.isSquare())\n          return false;\n      }\n\n      p += 1;\n    }\n\n    const s = n.addn(1);\n    const r = s._makeOdd();\n\n    let vk = new BN(2);\n    let vk1 = new BN(p);\n\n    for (let i = s.bitLength(); i >= 0; i--) {\n      if (s.utestn(i)) {\n        vk = vk.mul(vk1).isubn(p).imod(n);\n        vk1 = vk1.sqr().isubn(2).imod(n);\n      } else {\n        vk1 = vk1.mul(vk).isubn(p).imod(n);\n        vk = vk.sqr().isubn(2).imod(n);\n      }\n    }\n\n    if (vk.cmpn(2) === 0 || vk.cmp(n.subn(2)) === 0) {\n      const a = vk.muln(p).imod(n);\n      const b = vk1.ushln(1).imod(n);\n\n      if (a.cmp(b) === 0)\n        return true;\n    }\n\n    for (let t = 0; t < r - 1; t++) {\n      if (vk.isZero())\n        return true;\n\n      if (vk.cmpn(2) === 0)\n        return false;\n\n      vk = vk.sqr().isubn(2).imod(n);\n    }\n\n    return false;\n  }\n\n  /*\n   * Twos Complement\n   */\n\n  toTwos(width) {\n    if (this.negative !== 0)\n      return this.abs().inotn(width).iaddn(1);\n\n    return this.clone();\n  }\n\n  fromTwos(width) {\n    enforce((width >>> 0) === width, 'width', 'uint32');\n    range(width > 0, 'width');\n\n    if (this.testn(width - 1))\n      return this.notn(width).iaddn(1).ineg();\n\n    return this.clone();\n  }\n\n  /*\n   * Reduction Context\n   */\n\n  toRed(ctx) {\n    enforce(ctx instanceof Red, 'ctx', 'reduction context');\n\n    if (this.red)\n      throw new Error('Already in reduction context.');\n\n    return ctx.convertTo(this);\n  }\n\n  fromRed() {\n    red(this.red, 'fromRed');\n    return this.red.convertFrom(this);\n  }\n\n  forceRed(ctx) {\n    enforce(ctx instanceof Red, 'ctx', 'reduction context');\n\n    if (this.red) {\n      if (!ctx.m.eq(this.red.m) || ctx.mont !== this.red.mont)\n        throw new Error('Already in reduction context.');\n    } else {\n      range(this.negative === 0, 'red');\n      range(this.ucmp(ctx.m) < 0, 'red');\n    }\n\n    return this.clone()._forceRed(ctx);\n  }\n\n  redIAdd(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redIAdd');\n    return this.red.iadd(this, num);\n  }\n\n  redAdd(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redAdd');\n    return this.red.add(this, num);\n  }\n\n  redIAddn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    red(this.red, 'redIAddn');\n    return this.red.iaddn(this, num);\n  }\n\n  redAddn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    red(this.red, 'redAddn');\n    return this.red.addn(this, num);\n  }\n\n  redISub(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redISub');\n    return this.red.isub(this, num);\n  }\n\n  redSub(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redSub');\n    return this.red.sub(this, num);\n  }\n\n  redISubn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    red(this.red, 'redISubn');\n    return this.red.isubn(this, num);\n  }\n\n  redSubn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    red(this.red, 'redSubn');\n    return this.red.subn(this, num);\n  }\n\n  redIMul(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redIMul');\n    return this.red.imul(this, num);\n  }\n\n  redMul(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redMul');\n    return this.red.mul(this, num);\n  }\n\n  redIMuln(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    red(this.red, 'redIMuln');\n    return this.red.imuln(this, num);\n  }\n\n  redMuln(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    red(this.red, 'redMuln');\n    return this.red.muln(this, num);\n  }\n\n  redIDiv(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redIDiv');\n    return this.red.idiv(this, num);\n  }\n\n  redDiv(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redDiv');\n    return this.red.div(this, num);\n  }\n\n  redIDivn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    red(this.red, 'redIDivn');\n    return this.red.idivn(this, num);\n  }\n\n  redDivn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    red(this.red, 'redDivn');\n    return this.red.divn(this, num);\n  }\n\n  redIPow(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redIPow');\n    nonred(!num.red, 'redIPow');\n    return this.red.ipow(this, num);\n  }\n\n  redPow(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redPow');\n    nonred(!num.red, 'redPow');\n    return this.red.pow(this, num);\n  }\n\n  redIPown(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    red(this.red, 'redIPown');\n    return this.red.ipown(this, num);\n  }\n\n  redPown(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    red(this.red, 'redPown');\n    return this.red.pown(this, num);\n  }\n\n  redISqr() {\n    red(this.red, 'redISqr');\n    return this.red.isqr(this);\n  }\n\n  redSqr() {\n    red(this.red, 'redSqr');\n    return this.red.sqr(this);\n  }\n\n  redISqrt() {\n    red(this.red, 'redISqrt');\n    return this.red.isqrt(this);\n  }\n\n  redSqrt() {\n    red(this.red, 'redSqrt');\n    return this.red.sqrt(this);\n  }\n\n  redIDivSqrt(v) {\n    red(this.red, 'redIDivSqrt');\n    return this.red.idivsqrt(this, v);\n  }\n\n  redDivSqrt(v) {\n    red(this.red, 'redDivSqrt');\n    return this.red.divsqrt(this, v);\n  }\n\n  redIsSquare() {\n    red(this.red, 'redIsSquare');\n    return this.red.isSquare(this);\n  }\n\n  redIShl(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redIShl');\n    nonred(!num.red, 'redIShl');\n    return this.red.ishl(this, num);\n  }\n\n  redShl(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redShl');\n    nonred(!num.red, 'redShl');\n    return this.red.shl(this, num);\n  }\n\n  redIShln(num) {\n    enforce((num >>> 0) === num, 'num', 'uint32');\n    red(this.red, 'redIShln');\n    return this.red.ishln(this, num);\n  }\n\n  redShln(num) {\n    enforce((num >>> 0) === num, 'num', 'uint32');\n    red(this.red, 'redShln');\n    return this.red.shln(this, num);\n  }\n\n  redINeg() {\n    red(this.red, 'redINeg');\n    return this.red.ineg(this);\n  }\n\n  redNeg() {\n    red(this.red, 'redNeg');\n    return this.red.neg(this);\n  }\n\n  redEq(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n    red(this.red, 'redEq');\n    return this.red.eq(this, num);\n  }\n\n  redEqn(num) {\n    enforce(isSMI(num), 'num', 'smi');\n    red(this.red, 'redEqn');\n    return this.red.eqn(this, num);\n  }\n\n  redIsHigh() {\n    red(this.red, 'redIsHigh');\n    return this.red.isHigh(this);\n  }\n\n  redIsLow() {\n    red(this.red, 'redIsLow');\n    return this.red.isLow(this);\n  }\n\n  redIsOdd() {\n    red(this.red, 'redIsOdd');\n    return this.red.isOdd(this);\n  }\n\n  redIsEven() {\n    red(this.red, 'redIsEven');\n    return this.red.isEven(this);\n  }\n\n  redLegendre() {\n    red(this.red, 'redLegendre');\n    return this.red.legendre(this);\n  }\n\n  redJacobi() {\n    red(this.red, 'redJacobi');\n    return this.red.jacobi(this);\n  }\n\n  redKronecker() {\n    red(this.red, 'redKronecker');\n    return this.red.kronecker(this);\n  }\n\n  redIInvert() {\n    red(this.red, 'redIInvert');\n    return this.red.iinvert(this);\n  }\n\n  redInvert() {\n    red(this.red, 'redInvert');\n    return this.red.invert(this);\n  }\n\n  redIFermat() {\n    red(this.red, 'redIFermat');\n    return this.red.ifermat(this);\n  }\n\n  redFermat() {\n    red(this.red, 'redFermat');\n    return this.red.fermat(this);\n  }\n\n  /*\n   * Internal\n   */\n\n  _move(dest) {\n    dest.words = this.words;\n    dest.length = this.length;\n    dest.negative = this.negative;\n    dest.red = this.red;\n    return dest;\n  }\n\n  _alloc(size) {\n    while (this.words.length < size)\n      this.words.push(0);\n\n    return this;\n  }\n\n  _expand(size) {\n    this._alloc(size);\n\n    while (this.length < size)\n      this.words[this.length++] = 0;\n\n    return this;\n  }\n\n  _strip() {\n    while (this.length > 1 && this.words[this.length - 1] === 0)\n      this.length -= 1;\n\n    return this._normalize();\n  }\n\n  _normalize() {\n    assert(this.length > 0);\n\n    // -0 = 0\n    if (this.length === 1 && this.words[0] === 0)\n      this.negative = 0;\n\n    return this;\n  }\n\n  _check() {\n    // We never have a zero length number.\n    assert(this.length > 0);\n\n    // Cannot exceed array bounds.\n    assert(this.length <= this.words.length);\n\n    if (this.length === 1) {\n      // Must be normalized.\n      if (this.words[0] === 0)\n        assert(this.negative === 0);\n      return this;\n    }\n\n    // Must be stripped.\n    assert(this.words[this.length - 1] !== 0);\n\n    return this;\n  }\n\n  _invertp(p) {\n    // Penk's right shift binary EGCD.\n    //\n    // See: The Art of Computer Programming,\n    //      Volume 2, Seminumerical Algorithms\n    //   Donald E. Knuth\n    //   Exercise 4.5.2.39\n    enforce(BN.isBN(p), 'p', 'bignum');\n    range(p.sign() > 0, 'invert');\n    assert(p.isOdd());\n\n    if (p.cmpn(1) === 0)\n      throw new RangeError('Not invertible.');\n\n    const a = this.clone();\n    const b = p.clone();\n    const u = new BN(1);\n    const v = new BN(0);\n\n    if (a.isNeg() || a.ucmp(b) >= 0)\n      a.imod(b);\n\n    while (!a.isZero()) {\n      let i = a._makeOdd();\n      let j = b._makeOdd();\n\n      while (i--) {\n        if (u.isOdd())\n          u._iadd(u, p);\n\n        u.iushrn(1);\n      }\n\n      while (j--) {\n        if (v.isOdd())\n          v._iadd(v, p);\n\n        v.iushrn(1);\n      }\n\n      if (a.ucmp(b) >= 0) {\n        a._isub(a, b);\n        if (u.ucmp(v) < 0) {\n          u._isub(v, u);\n          u._isub(p, u);\n        } else {\n          u._isub(u, v);\n        }\n      } else {\n        b._isub(b, a);\n        if (v.ucmp(u) < 0) {\n          v._isub(u, v);\n          v._isub(p, v);\n        } else {\n          v._isub(v, u);\n        }\n      }\n    }\n\n    if (b.cmpn(1) !== 0)\n      throw new RangeError('Not invertible.');\n\n    assert(v.negative === 0);\n    assert(v.ucmp(p) < 0);\n\n    return v;\n  }\n\n  _makeOdd() {\n    const shift = this.zeroBits();\n\n    if (shift > 0)\n      this.iushrn(shift);\n\n    return shift;\n  }\n\n  _factor2(num) {\n    // Find common factor of two.\n    // Expects inputs to be non-zero.\n    if ((this.words[0] | num.words[0]) & 1)\n      return 0;\n\n    const len = Math.min(this.length, num.length);\n\n    let r = 0;\n\n    for (let i = 0; i < len; i++) {\n      const b = zeroBits(this.words[i] | num.words[i]);\n\n      r += b;\n\n      if (b !== 26)\n        break;\n    }\n\n    return r;\n  }\n\n  _cloneNormal() {\n    return this.red ? this.fromRed() : this.clone();\n  }\n\n  _forceRed(ctx) {\n    this.red = ctx;\n    return this;\n  }\n\n  /*\n   * Helpers\n   */\n\n  clone() {\n    const copy = new BN();\n\n    copy.words = new Array(this.length);\n\n    for (let i = 0; i < this.length; i++)\n      copy.words[i] = this.words[i];\n\n    copy.length = this.length;\n    copy.negative = this.negative;\n    copy.red = this.red;\n\n    return copy;\n  }\n\n  inject(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    this._alloc(num.length);\n\n    for (let i = 0; i < num.length; i++)\n      this.words[i] = num.words[i];\n\n    this.length = num.length;\n    this.negative = num.negative;\n    this.red = num.red;\n\n    return this;\n  }\n\n  set(num, endian) {\n    return this.fromNumber(num, endian);\n  }\n\n  swap(num) {\n    enforce(BN.isBN(num), 'num', 'bignum');\n\n    const x = this;\n    const y = num;\n\n    [x.words, y.words] = [y.words, x.words];\n    [x.length, y.length] = [y.length, x.length];\n    [x.negative, y.negative] = [y.negative, x.negative];\n    [x.red, y.red] = [y.red, x.red];\n\n    return x;\n  }\n\n  reverse() {\n    const neg = this.negative;\n\n    this.fromBuffer(this.toBuffer('be'), 'le');\n    this.negative = neg;\n\n    return this;\n  }\n\n  byteLength() {\n    return Math.ceil(this.bitLength() / 8);\n  }\n\n  bitLength() {\n    const w = this.words[this.length - 1];\n    const hi = countBits(w);\n    return (this.length - 1) * 26 + hi;\n  }\n\n  zeroBits() {\n    if (this.isZero())\n      return 0;\n\n    if (this.isOdd())\n      return 0;\n\n    let r = 0;\n\n    for (let i = 0; i < this.length; i++) {\n      const b = zeroBits(this.words[i]);\n\n      r += b;\n\n      if (b !== 26)\n        break;\n    }\n\n    return r;\n  }\n\n  isSafe() {\n    if (this.length <= 2)\n      return true;\n\n    if (this.length === 3 && this.words[2] === 0x01)\n      return true;\n\n    return false;\n  }\n\n  word(pos) {\n    enforce((pos >>> 0) === pos, 'pos', 'uint32');\n\n    if (pos >= this.length)\n      return 0;\n\n    return this.words[pos];\n  }\n\n  [custom]() {\n    let prefix = 'BN';\n\n    if (this.red)\n      prefix = 'BN-R';\n\n    return `<${prefix}: ${this.toString(10)}>`;\n  }\n\n  /*\n   * Conversion\n   */\n\n  toNumber() {\n    let num = this.words[0];\n\n    if (this.length === 2) {\n      num += this.words[1] * 0x4000000;\n    } else if (this.length === 3 && this.words[2] === 0x01) {\n      // Note: at this stage it is known that the top bit is set.\n      num += 0x10000000000000 + (this.words[1] * 0x4000000);\n    } else if (this.length > 2) {\n      throw new RangeError('Number can only safely store up to 53 bits.');\n    }\n\n    return this.negative !== 0 ? -num : num;\n  }\n\n  toDouble() {\n    let num = 0;\n\n    for (let i = this.length - 1; i >= 0; i--)\n      num = (num * 0x4000000) + this.words[i];\n\n    return this.negative !== 0 ? -num : num;\n  }\n\n  valueOf() {\n    return this.toDouble();\n  }\n\n  toBigInt() {\n    if (!HAS_BIGINT)\n      throw new Error('BigInt is not supported!');\n\n    const s52 = BigInt(52);\n    const s26 = BigInt(26);\n\n    let i = this.length - 1;\n    let num = BigInt(0);\n\n    for (; i >= 1; i -= 2) {\n      const hi = this.words[i] * 0x4000000;\n      const lo = this.words[i - 1];\n\n      num = (num << s52) | BigInt(hi + lo);\n    }\n\n    if (i >= 0)\n      num = (num << s26) | BigInt(this.words[0]);\n\n    return this.negative !== 0 ? -num : num;\n  }\n\n  toBool() {\n    return !this.isZero();\n  }\n\n  toString(base, padding) {\n    base = getBase(base);\n\n    if (padding == null)\n      padding = 0;\n\n    if (padding === 0)\n      padding = 1;\n\n    enforce((base >>> 0) === base, 'base', 'uint32');\n    enforce((padding >>> 0) === padding, 'padding', 'uint32');\n\n    if (base < 2 || base > 36)\n      throw new RangeError('Base ranges between 2 and 36.');\n\n    this._check();\n\n    if (base === 16) {\n      let out = '';\n      let off = 0;\n      let carry = 0;\n\n      for (let i = 0; i < this.length; i++) {\n        const w = this.words[i];\n        const word = (((w << off) | carry) & 0xffffff).toString(16);\n\n        carry = (w >>> (24 - off)) & 0xffffff;\n\n        if (carry !== 0 || i !== this.length - 1)\n          out = zeros[6 - word.length] + word + out;\n        else\n          out = word + out;\n\n        off += 2;\n\n        if (off >= 26) {\n          off -= 26;\n          i -= 1;\n        }\n      }\n\n      if (carry !== 0)\n        out = carry.toString(16) + out;\n\n      while (out.length % padding !== 0)\n        out = '0' + out;\n\n      if (this.negative !== 0)\n        out = '-' + out;\n\n      return out;\n    }\n\n    const groupSize = groupSizes[base - 1];\n    const groupBase = groupBases[base - 1];\n    const c = this.clone();\n\n    let out = '';\n\n    c.negative = 0;\n\n    while (!c.isZero()) {\n      const r = c.remrn(groupBase).toString(base);\n\n      c.iquon(groupBase);\n\n      if (!c.isZero())\n        out = zeros[groupSize - r.length] + r + out;\n      else\n        out = r + out;\n    }\n\n    if (this.isZero())\n      out = '0';\n\n    while (out.length % padding !== 0)\n      out = '0' + out;\n\n    if (this.negative !== 0)\n      out = '-' + out;\n\n    return out;\n  }\n\n  toJSON() {\n    return this.toString(16, 2);\n  }\n\n  toArray(endian, length) {\n    return this.toArrayLike(Array, endian, length);\n  }\n\n  toBuffer(endian, length) {\n    return this.toArrayLike(Buffer, endian, length);\n  }\n\n  toArrayLike(ArrayType, endian, length) {\n    if (endian == null)\n      endian = 'be';\n\n    if (length == null)\n      length = 0;\n\n    enforce(typeof ArrayType === 'function', 'ArrayType', 'function');\n    enforce(endian === 'be' || endian === 'le', 'endian', 'endianness');\n    enforce((length >>> 0) === length, 'length', 'uint32');\n\n    this._check();\n\n    const bytes = this.byteLength();\n    const size = length || Math.max(1, bytes);\n\n    if (bytes > size)\n      throw new RangeError('Byte array longer than desired length.');\n\n    const res = allocate(ArrayType, size);\n\n    // See: https://github.com/indutny/bn.js/pull/222\n    if (endian === 'be') {\n      let pos = res.length - 1;\n      let carry = 0;\n\n      for (let i = 0; i < this.length; i++) {\n        const shift = (i & 3) << 1;\n        const word = (this.words[i] << shift) | carry;\n\n        res[pos--] = word & 0xff;\n\n        if (pos >= 0)\n          res[pos--] = (word >>> 8) & 0xff;\n\n        if (pos >= 0)\n          res[pos--] = (word >>> 16) & 0xff;\n\n        if (shift === 6) {\n          if (pos >= 0)\n            res[pos--] = (word >>> 24) & 0xff;\n\n          carry = 0;\n        } else {\n          carry = word >>> 24;\n        }\n      }\n\n      if (pos >= 0) {\n        res[pos--] = carry;\n\n        while (pos >= 0)\n          res[pos--] = 0;\n\n        carry = 0;\n      }\n\n      assert(carry === 0);\n    } else {\n      let pos = 0;\n      let carry = 0;\n\n      for (let i = 0; i < this.length; i++) {\n        const shift = (i & 3) << 1;\n        const word = (this.words[i] << shift) | carry;\n\n        res[pos++] = word & 0xff;\n\n        if (pos < res.length)\n          res[pos++] = (word >>> 8) & 0xff;\n\n        if (pos < res.length)\n          res[pos++] = (word >>> 16) & 0xff;\n\n        if (shift === 6) {\n          if (pos < res.length)\n            res[pos++] = (word >>> 24) & 0xff;\n\n          carry = 0;\n        } else {\n          carry = word >>> 24;\n        }\n      }\n\n      if (pos < res.length) {\n        res[pos++] = carry;\n\n        while (pos < res.length)\n          res[pos++] = 0;\n\n        carry = 0;\n      }\n\n      assert(carry === 0);\n    }\n\n    return res;\n  }\n\n  encode(endian, length) {\n    return this.toBuffer(endian, length);\n  }\n\n  /*\n   * Instantiation\n   */\n\n  of(num, endian) {\n    return this.fromNumber(num, endian);\n  }\n\n  fromNumber(num, endian) {\n    if (endian == null)\n      endian = 'be';\n\n    enforce(isInteger(num), 'num', 'integer');\n    enforce(endian === 'be' || endian === 'le', 'endian', 'endianness');\n\n    const neg = (num < 0) | 0;\n\n    if (neg)\n      num = -num;\n\n    if (num < 0x4000000) {\n      this.words[0] = num & 0x3ffffff;\n      this.length = 1;\n    } else if (num < 0x10000000000000) {\n      this.words = [\n        num & 0x3ffffff,\n        (num / 0x4000000) & 0x3ffffff\n      ];\n      this.length = 2;\n    } else {\n      this.words = [\n        num & 0x3ffffff,\n        (num / 0x4000000) & 0x3ffffff,\n        1\n      ];\n      this.length = 3;\n    }\n\n    this.negative = neg;\n\n    if (endian === 'le')\n      this.reverse();\n\n    return this;\n  }\n\n  fromDouble(num, endian) {\n    if (endian == null)\n      endian = 'be';\n\n    enforce(typeof num === 'number', 'num', 'double');\n    enforce(endian === 'be' || endian === 'le', 'endian', 'endianness');\n\n    if (!isFinite(num))\n      num = 0;\n\n    const neg = (num <= -1) | 0;\n\n    if (num < 0)\n      num = -num;\n\n    num = Math.floor(num);\n\n    this.words = [];\n\n    while (num > 0) {\n      const lo = num % 0x4000000;\n      const hi = (num - lo) / 0x4000000;\n\n      this.words.push(lo);\n\n      num = hi;\n    }\n\n    if (this.words.length === 0)\n      this.words.push(0);\n\n    this.length = this.words.length;\n    this.negative = neg;\n\n    if (endian === 'le')\n      this.reverse();\n\n    return this;\n  }\n\n  fromBigInt(num, endian) {\n    if (endian == null)\n      endian = 'be';\n\n    enforce(typeof num === 'bigint', 'num', 'bigint');\n    enforce(endian === 'be' || endian === 'le', 'endian', 'endianness');\n\n    if (!HAS_BIGINT)\n      throw new Error('BigInt is not supported!');\n\n    // You know the implementation has a\n    // problem when strings are twice\n    // as fast as bigints.\n    const start = (num < BigInt(0)) | 0;\n\n    this._fromHex(num.toString(16), start);\n    this.negative = start;\n\n    if (endian === 'le')\n      this.reverse();\n\n    return this;\n  }\n\n  fromBool(value) {\n    enforce(typeof value === 'boolean', 'value', 'boolean');\n\n    this.words[0] = value | 0;\n    this.length = 1;\n    this.negative = 0;\n\n    return this;\n  }\n\n  fromString(str, base, endian) {\n    if (base === 'le' || base === 'be')\n      [base, endian] = [endian, base];\n\n    base = getBase(base);\n\n    if (endian == null)\n      endian = 'be';\n\n    enforce(typeof str === 'string', 'string', 'string');\n    enforce((base >>> 0) === base, 'base', 'uint32');\n    enforce(endian === 'be' || endian === 'le', 'endian', 'endianness');\n\n    if (base < 2 || base > 36)\n      throw new Error('Base ranges between 2 and 36.');\n\n    str = str.replace(/\\s+/g, '');\n\n    let start = 0;\n\n    if (str.length > 0 && str.charCodeAt(0) === 0x2d)\n      start = 1;\n\n    if (base === 16)\n      this._fromHex(str, start);\n    else\n      this._fromBase(str, base, start);\n\n    this.negative = start;\n\n    this._normalize();\n\n    if (endian === 'le')\n      this.reverse();\n\n    return this;\n  }\n\n  _fromHex(str, start) {\n    this.length = Math.max(2, Math.ceil((str.length - start) / 6));\n    this.words = new Array(this.length);\n\n    for (let i = 0; i < this.length; i++)\n      this.words[i] = 0;\n\n    // Scan 24-bit chunks and add them to the number.\n    let off = 0;\n    let i = str.length - 6;\n    let j = 0;\n\n    for (; i >= start; i -= 6) {\n      const w = parseHex(str, i, i + 6);\n\n      this.words[j] |= (w << off) & 0x3ffffff;\n\n      // `0x3fffff` is intentional here, 26bits max shift + 24bit hex limb.\n      this.words[j + 1] |= (w >>> (26 - off)) & 0x3fffff;\n\n      off += 24;\n\n      if (off >= 26) {\n        off -= 26;\n        j += 1;\n      }\n    }\n\n    if (i + 6 !== start) {\n      const w = parseHex(str, start, i + 6);\n\n      this.words[j] |= (w << off) & 0x3ffffff;\n      this.words[j + 1] |= (w >>> (26 - off)) & 0x3fffff;\n    }\n\n    return this._strip();\n  }\n\n  _fromBase(str, base, start) {\n    // Initialize as zero.\n    this.words[0] = 0;\n    this.length = 1;\n    this.negative = 0;\n\n    // Find length of limb in base.\n    let limbLen = 0;\n    let limbPow = 1;\n\n    for (; limbPow <= 0x3ffffff; limbPow *= base)\n      limbLen += 1;\n\n    limbLen -= 1;\n    limbPow = (limbPow / base) | 0;\n\n    const total = str.length - start;\n    const mod = total % limbLen;\n    const end = Math.min(total, total - mod) + start;\n\n    let i = start;\n\n    for (; i < end; i += limbLen) {\n      const word = parseBase(str, i, i + limbLen, base);\n\n      this.imuln(limbPow);\n      this._iaddn(word);\n    }\n\n    if (mod !== 0) {\n      const pow = Math.pow(base, mod);\n      const word = parseBase(str, i, str.length, base);\n\n      this.imuln(pow);\n      this._iaddn(word);\n    }\n\n    return this;\n  }\n\n  fromJSON(json) {\n    if (BN.isBN(json)) {\n      if (json.red)\n        return json.fromRed();\n\n      return json.clone();\n    }\n\n    if (Array.isArray(json)) {\n      for (const chunk of json)\n        enforce(typeof chunk === 'string', 'chunk', 'string');\n\n      json = json.join('');\n    }\n\n    return this.fromString(json, 16);\n  }\n\n  fromBN(num) {\n    return this.inject(num);\n  }\n\n  fromArray(data, endian) {\n    enforce(Array.isArray(data), 'data', 'array');\n    return this.fromArrayLike(data, endian);\n  }\n\n  fromBuffer(data, endian) {\n    enforce(Buffer.isBuffer(data), 'data', 'buffer');\n    return this.fromArrayLike(data, endian);\n  }\n\n  fromArrayLike(data, endian) {\n    if (endian == null)\n      endian = 'be';\n\n    enforce(data && (data.length >>> 0) === data.length, 'data', 'array-like');\n    enforce(endian === 'be' || endian === 'le', 'endian', 'endianness');\n\n    if (data.length === 0) {\n      this.words[0] = 0;\n      this.length = 1;\n      this.negative = 0;\n      return this;\n    }\n\n    this.length = Math.max(2, Math.ceil(data.length / 3));\n    this.words = new Array(this.length);\n    this.negative = 0;\n\n    for (let i = 0; i < this.length; i++)\n      this.words[i] = 0;\n\n    const left = data.length % 3;\n\n    let off = 0;\n    let j = 0;\n    let w = 0;\n\n    if (endian === 'be') {\n      for (let i = data.length - 1; i >= 2; i -= 3) {\n        const w = data[i] | (data[i - 1] << 8) | (data[i - 2] << 16);\n\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n\n        off += 24;\n\n        if (off >= 26) {\n          off -= 26;\n          j += 1;\n        }\n      }\n\n      switch (left) {\n        case 2:\n          w = data[1] | (data[0] << 8);\n          break;\n        case 1:\n          w = data[0];\n          break;\n      }\n    } else {\n      const len = data.length - left;\n\n      for (let i = 0; i < len; i += 3) {\n        const w = data[i] | (data[i + 1] << 8) | (data[i + 2] << 16);\n\n        this.words[j] |= (w << off) & 0x3ffffff;\n        this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n\n        off += 24;\n\n        if (off >= 26) {\n          off -= 26;\n          j += 1;\n        }\n      }\n\n      switch (left) {\n        case 2:\n          w = data[len] | (data[len + 1] << 8);\n          break;\n        case 1:\n          w = data[len];\n          break;\n      }\n    }\n\n    if (left > 0) {\n      this.words[j] |= (w << off) & 0x3ffffff;\n      this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n    }\n\n    return this._strip();\n  }\n\n  decode(data, endian) {\n    return this.fromBuffer(data, endian);\n  }\n\n  from(num, base, endian) {\n    if (num == null)\n      return this;\n\n    if (base === 'le' || base === 'be')\n      [base, endian] = [endian, base];\n\n    if (typeof num === 'number')\n      return this.fromNumber(num, endian);\n\n    if (typeof num === 'bigint')\n      return this.fromBigInt(num, endian);\n\n    if (typeof num === 'string')\n      return this.fromString(num, base, endian);\n\n    if (typeof num === 'object') {\n      if (BN.isBN(num))\n        return this.fromBN(num, endian);\n\n      if ((num.length >>> 0) === num.length)\n        return this.fromArrayLike(num, endian);\n    }\n\n    if (typeof num === 'boolean')\n      return this.fromBool(num);\n\n    throw new TypeError('Non-numeric object passed to BN.');\n  }\n\n  /*\n   * Static Methods\n   */\n\n  static min(...args) {\n    let min = null;\n\n    for (const num of args) {\n      enforce(BN.isBN(num), 'num', 'bignum');\n\n      if (!min || num.cmp(min) < 0)\n        min = num;\n    }\n\n    return min || new BN(0);\n  }\n\n  static max(...args) {\n    let max = null;\n\n    for (const num of args) {\n      enforce(BN.isBN(num), 'num', 'bignum');\n\n      if (!max || num.cmp(max) > 0)\n        max = num;\n    }\n\n    return max || new BN(0);\n  }\n\n  static cmp(a, b) {\n    enforce(BN.isBN(a), 'a', 'bignum');\n    return a.cmp(b);\n  }\n\n  static ucmp(a, b) {\n    enforce(BN.isBN(a), 'a', 'bignum');\n    return a.ucmp(b);\n  }\n\n  static red(num) {\n    return new Red(num);\n  }\n\n  static barrett(num) {\n    return new Barrett(num);\n  }\n\n  static mont(num) {\n    return new Mont(num);\n  }\n\n  static _prime(name) {\n    if (primes[name])\n      return primes[name];\n\n    let prime;\n\n    if (name === 'p192')\n      prime = new P192();\n    else if (name === 'p224')\n      prime = new P224();\n    else if (name === 'p521')\n      prime = new P521();\n    else if (name === 'k256')\n      prime = new K256();\n    else if (name === 'p251')\n      prime = new P251();\n    else if (name === 'p25519')\n      prime = new P25519();\n    else if (name === 'p448')\n      prime = new P448();\n    else\n      throw new Error(`Unknown prime: \"${name}\".`);\n\n    primes[name] = prime;\n\n    return prime;\n  }\n\n  static prime(name) {\n    return BN._prime(name).p.clone();\n  }\n\n  static pow(num, exp) {\n    if (num === 2)\n      return BN.shift(1, exp);\n\n    return new BN().fromNumber(num).pown(exp);\n  }\n\n  static shift(num, bits) {\n    if (num === 1)\n      return new BN(0).usetn(bits, 1);\n\n    return new BN().fromNumber(num).ishln(bits);\n  }\n\n  static mask(bits) {\n    return BN.shift(1, bits).isubn(1);\n  }\n\n  static randomBits(rng, bits) {\n    enforce(rng != null, 'rng', 'rng');\n    enforce((bits >>> 0) === bits, 'bits', 'uint32');\n\n    if (typeof rng === 'object') {\n      enforce(typeof rng.randomBytes === 'function', 'rng', 'rng');\n\n      const size = (bits + 7) >>> 3;\n      const total = size * 8;\n      const bytes = rng.randomBytes(size);\n\n      enforce(Buffer.isBuffer(bytes), 'bytes', 'buffer');\n\n      if (bytes.length !== size)\n        throw new RangeError('Invalid number of bytes returned from RNG.');\n\n      const num = BN.fromBuffer(bytes);\n\n      if (total > bits)\n        num.iushrn(total - bits);\n\n      return num;\n    }\n\n    enforce(typeof rng === 'function', 'rng', 'rng');\n\n    const num = rng(bits);\n\n    enforce(BN.isBN(num), 'num', 'bignum');\n    range(num.negative === 0, 'RNG');\n    nonred(!num.red, 'RNG');\n\n    if (num.bitLength() > bits)\n      throw new RangeError('Invalid number of bits returned from RNG.');\n\n    return num;\n  }\n\n  static random(rng, min, max) {\n    min = BN.cast(min, 16);\n    max = BN.cast(max, 16);\n\n    if (min.cmp(max) > 0)\n      throw new RangeError('Minimum cannot be greater than maximum.');\n\n    const space = max.sub(min).iabs();\n    const bits = space.bitLength();\n\n    if (bits === 0)\n      return min.clone();\n\n    for (;;) {\n      const num = BN.randomBits(rng, bits);\n\n      // Maximum is _exclusive_!\n      if (num.cmp(space) >= 0)\n        continue;\n\n      // Minimum is _inclusive_!\n      num.iadd(min);\n\n      return num;\n    }\n  }\n\n  static of(num, endian) {\n    return new BN().of(num, endian);\n  }\n\n  static fromNumber(num, endian) {\n    return new BN().fromNumber(num, endian);\n  }\n\n  static fromDouble(num, endian) {\n    return new BN().fromDouble(num, endian);\n  }\n\n  static fromBigInt(num, endian) {\n    return new BN().fromBigInt(num, endian);\n  }\n\n  static fromBool(value) {\n    return new BN().fromBool(value);\n  }\n\n  static fromString(str, base, endian) {\n    return new BN().fromString(str, base, endian);\n  }\n\n  static fromJSON(json) {\n    return new BN().fromJSON(json);\n  }\n\n  static fromBN(num) {\n    return new BN().fromBN(num);\n  }\n\n  static fromArray(data, endian) {\n    return new BN().fromArray(data, endian);\n  }\n\n  static fromBuffer(data, endian) {\n    return new BN().fromBuffer(data, endian);\n  }\n\n  static fromArrayLike(data, endian) {\n    return new BN().fromArrayLike(data, endian);\n  }\n\n  static decode(data, endian) {\n    return new BN().decode(data, endian);\n  }\n\n  static from(num, base, endian) {\n    return new BN().from(num, base, endian);\n  }\n\n  static cast(num, base, endian) {\n    if (BN.isBN(num))\n      return num;\n\n    return new BN(num, base, endian);\n  }\n\n  static isBN(obj) {\n    return obj instanceof BN;\n  }\n}\n\n/*\n * Static\n */\n\nBN.BN = BN;\nBN.wordSize = 26;\nBN.native = 0;\n\n/**\n * Prime\n */\n\nclass Prime {\n  constructor(name, p) {\n    // P = 2^N - K\n    this.name = name;\n    this.p = new BN(p, 16);\n    this.n = this.p.bitLength();\n    this.k = BN.shift(1, this.n).isub(this.p);\n    this.lo = this.p.clone();\n    this.one = this.p.clone();\n  }\n\n  ireduce(num) {\n    // Assumes that `num` is less than `P^2`:\n    // num = HI * (2^N - K) + HI * K + LO = HI * K + LO (mod P)\n    const neg = num.negative !== 0;\n\n    // Track bits.\n    let bits = num.bitLength();\n\n    // Must be less than P^2.\n    assert(bits <= this.n * 2);\n\n    // Ensure positive.\n    num.negative = 0;\n\n    // Reduce.\n    while (bits > this.n) {\n      // lo = num & ((1 << n) - 1)\n      // num = num >> n\n      this.split(num, this.lo);\n\n      // num = num * K\n      this.imulK(num);\n\n      // num = num + lo\n      num._iadd(num, this.lo);\n\n      // bits = bitlen(num)\n      bits = num.bitLength();\n    }\n\n    // Final reduction.\n    const cmp = bits < this.n ? -1 : num.ucmp(this.p);\n\n    if (cmp === 0) {\n      num.words[0] = 0;\n      num.length = 1;\n    } else if (cmp > 0) {\n      num._isub(num, this.p);\n    } else {\n      // Note: we shouldn't need to strip here.\n    }\n\n    // Adjust sign.\n    if (neg && !num.isZero())\n      num._isub(this.p, num);\n\n    return num;\n  }\n\n  split(input, out) {\n    input._split(this.n, out);\n  }\n\n  imulK(num) {\n    return num.imul(this.k);\n  }\n\n  pm2(x1) {\n    // Exponent: p - 2\n    throw new Error('Not implemented.');\n  }\n\n  fermat(x) {\n    return this.pm2(x);\n  }\n}\n\n/**\n * Prime (3 mod 4)\n */\n\nclass Prime34 extends Prime {\n  constructor(name, p) {\n    super(name, p);\n  }\n\n  pm3d4(x1) {\n    // Exponent: (p - 3) / 4\n    throw new Error('Not implemented.');\n  }\n\n  pp1d4(x1) {\n    // Exponent: (p + 1) / 4\n    throw new Error('Not implemented.');\n  }\n\n  sqrt(x) {\n    // r = x^((p + 1) / 4) mod p\n    const {red} = x;\n    const r = this.pp1d4(x);\n\n    if (!red.sqr(r).eq(x))\n      throw new SquareRootError(r);\n\n    return r;\n  }\n\n  divsqrt(u, v) {\n    // x = u^3 * v * (u^5 * v^3)^((p - 3) / 4) mod p\n    const {red} = u;\n    const u2 = red.sqr(u);\n    const u3 = red.mul(u2, u);\n    const u5 = red.mul(u3, u2);\n    const v3 = red.mul(red.sqr(v), v);\n    const p = this.pm3d4(red.mul(u5, v3));\n    const x = red.mul(red.mul(u3, v), p);\n    const c = red.mul(v, red.sqr(x));\n\n    if (c.eq(u))\n      return x;\n\n    throw new SquareRootError(x);\n  }\n}\n\n/**\n * Prime (5 mod 8)\n */\n\nclass Prime58 extends Prime {\n  constructor(name, p, sm1) {\n    super(name, p);\n\n    this.sm1 = new BN(sm1, 16);\n  }\n\n  pm5d8(x1) {\n    // Exponent: (p - 5) / 8\n    throw new Error('Not implemented.');\n  }\n\n  pp3d8(x1) {\n    // Exponent: (p + 3) / 8\n    throw new Error('Not implemented.');\n  }\n\n  sqrt(x) {\n    // r = x^((p + 3) / 8) mod p\n    const {red} = x;\n    const sm1 = this.sm1._forceRed(red);\n    const r = this.pp3d8(x);\n\n    if (red.sqr(r).eq(x))\n      return r;\n\n    const c = red.mul(r, sm1);\n\n    if (red.sqr(c).eq(x))\n      return c;\n\n    throw new SquareRootError(r);\n  }\n\n  divsqrt(u, v) {\n    // x = u * v^3 * (u * v^7)^((p - 5) / 8) mod p\n    const {red} = u;\n    const sm1 = this.sm1._forceRed(red);\n    const v3 = red.mul(red.sqr(v), v);\n    const v7 = red.mul(red.sqr(v3), v);\n    const p = this.pm5d8(red.mul(u, v7));\n    const x = red.mul(red.mul(u, v3), p);\n    const c = red.mul(v, red.sqr(x));\n\n    if (c.eq(u))\n      return x;\n\n    const mc = red.ineg(c);\n\n    if (mc.eq(u))\n      return red.mul(x, sm1);\n\n    if (mc.eq(red.mul(u, sm1)))\n      throw new SquareRootError(red.mul(x, sm1));\n\n    throw new SquareRootError(x);\n  }\n}\n\n/**\n * Prime (1 mod 16)\n */\n\nclass Prime116 extends Prime {\n  constructor(name, p, g) {\n    super(name, p);\n\n    this.g = new BN(g, 16);\n    this.z = this.p.subn(1).zeroBits();\n  }\n\n  powS(x1) {\n    // Exponent: (p - 1) / 2^k\n    throw new Error('Not implemented.');\n  }\n\n  powE(x1) {\n    // Exponent: (s + 1) / 2\n    throw new Error('Not implemented.');\n  }\n\n  sqrt(x) {\n    // Tonelli-Shanks (variable time).\n    //\n    // Constants:\n    //\n    //   k = factors of 2 for (p - 1)\n    //   s = (p - 1) / 2^k\n    //   e = (s + 1) / 2\n    //   n = first non-square in F(p)\n    //\n    // Algorithm:\n    //\n    //   g = n^s mod p\n    //   y = x^e mod p\n    //   b = x^s mod p\n    //\n    //   loop:\n    //     t = b\n    //     m = 0\n    //\n    //     while t != 1:\n    //       t = t^2 mod p\n    //       m += 1\n    //\n    //     if m == 0:\n    //       break\n    //\n    //     if m >= k:\n    //       fail\n    //\n    //     t = g^(2^(k - m - 1)) mod p\n    //     g = t^2 mod p\n    //     y = y * t mod p\n    //     b = b * g mod p\n    //     k = m\n    //\n    //   return y\n    //\n    const {red} = x;\n\n    switch (red.jacobi(x)) {\n      case -1:\n        throw new SquareRootError(x);\n      case 0:\n        return x.clone();\n      case 1:\n        break;\n    }\n\n    let g = this.g._forceRed(red);\n    let y = this.powE(x);\n    let b = this.powS(x);\n    let k = this.z;\n\n    for (;;) {\n      let t = b;\n      let m = 0;\n\n      while (t.cmpn(1) !== 0 && m < k) {\n        t = red.sqr(t);\n        m += 1;\n      }\n\n      if (m === 0)\n        break;\n\n      assert(m < k);\n\n      t = red.sqrn(g, k - m - 1);\n      g = red.sqr(t);\n      y = red.mul(y, t);\n      b = red.mul(b, g);\n      k = m;\n    }\n\n    return y;\n  }\n\n  divsqrt(u, v) {\n    const {red} = u;\n\n    if (v.isZero())\n      throw new SquareRootError(v);\n\n    return this.sqrt(red.div(u, v));\n  }\n}\n\n/**\n * P192\n */\n\nclass P192 extends Prime34 {\n  constructor() {\n    // 2^192 - 2^64 - 1 (= 3 mod 4)\n    super('p192', 'ffffffff ffffffff ffffffff fffffffe'\n                + 'ffffffff ffffffff');\n  }\n\n  imulK(num) {\n    // K = 0x10000000000000001\n    // K = 2^64 + 1\n    const one = this.one.inject(num);\n    return num.iushln(64)._iadd(num, one);\n  }\n\n  core(x1) {\n    // Exponent: (p - 3) / 4\n    // Bits: 127x1 1x0 62x1\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const x3 = red.sqrnmul(x2, 1, x1);\n    const x6 = red.sqrnmul(x3, 3, x3);\n    const x12 = red.sqrnmul(x6, 6, x6);\n    const x24 = red.sqrnmul(x12, 12, x12);\n    const x30 = red.sqrnmul(x24, 6, x6);\n    const x31 = red.sqrnmul(x30, 1, x1);\n    const x62 = red.sqrnmul(x31, 31, x31);\n    const x124 = red.sqrnmul(x62, 62, x62);\n    const x127 = red.sqrnmul(x124, 3, x3);\n    const r0 = red.sqrn(x127, 1);\n    const r1 = red.sqrnmul(r0, 62, x62);\n\n    return r1;\n  }\n\n  pm3d4(x1) {\n    // Exponent: (p - 3) / 4\n    // Bits: 127x1 1x0 62x1\n    return this.core(x1);\n  }\n\n  pm2(x1) {\n    // Exponent: p - 2\n    // Bits: 127x1 1x0 62x1 1x0 1x1\n    const {red} = x1;\n    const r0 = this.core(x1);\n    const r1 = red.sqrn(r0, 1);\n    const r2 = red.sqrnmul(r1, 1, x1);\n\n    return r2;\n  }\n\n  pp1d4(x1) {\n    // Exponent: (p + 1) / 4\n    // Bits: 128x1 62x0\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const x4 = red.sqrnmul(x2, 2, x2);\n    const x8 = red.sqrnmul(x4, 4, x4);\n    const x16 = red.sqrnmul(x8, 8, x8);\n    const x32 = red.sqrnmul(x16, 16, x16);\n    const x64 = red.sqrnmul(x32, 32, x32);\n    const x128 = red.sqrnmul(x64, 64, x64);\n    const r0 = red.sqrn(x128, 62);\n\n    return r0;\n  }\n}\n\n/**\n * P224\n */\n\nclass P224 extends Prime116 {\n  constructor() {\n    // 2^224 - 2^96 + 1 (1 mod 16)\n    super('p224', 'ffffffff ffffffff ffffffff ffffffff'\n                + '00000000 00000000 00000001',\n                  '6a0fec67 8598a792 0c55b2d4 0b2d6ffb'\n                + 'bea3d8ce f3fb3632 dc691b74');\n  }\n\n  imulK(num) {\n    // K = 0xffffffffffffffffffffffff\n    // K = 2^96 - 1\n    const one = this.one.inject(num);\n    return num.iushln(96)._isub(num, one);\n  }\n\n  powS(x1) {\n    // Exponent: 2^128 - 1\n    // Bits: 128x1\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const x4 = red.sqrnmul(x2, 2, x2);\n    const x8 = red.sqrnmul(x4, 4, x4);\n    const x16 = red.sqrnmul(x8, 8, x8);\n    const x32 = red.sqrnmul(x16, 16, x16);\n    const x64 = red.sqrnmul(x32, 32, x32);\n    const x128 = red.sqrnmul(x64, 64, x64);\n\n    return x128;\n  }\n\n  powE(x1) {\n    // Exponent: 2^127\n    // Bits: 1x1 127x0\n    const {red} = x1;\n    const r0 = red.sqrn(x1, 127);\n\n    return r0;\n  }\n\n  pm2(x1) {\n    // Exponent: p - 2\n    // Bits: 127x1 1x0 96x1\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const x3 = red.sqrnmul(x2, 1, x1);\n    const x6 = red.sqrnmul(x3, 3, x3);\n    const x12 = red.sqrnmul(x6, 6, x6);\n    const x24 = red.sqrnmul(x12, 12, x12);\n    const x48 = red.sqrnmul(x24, 24, x24);\n    const x96 = red.sqrnmul(x48, 48, x48);\n    const x120 = red.sqrnmul(x96, 24, x24);\n    const x126 = red.sqrnmul(x120, 6, x6);\n    const x127 = red.sqrnmul(x126, 1, x1);\n    const r0 = red.sqrn(x127, 1);\n    const r1 = red.sqrnmul(r0, 96, x96);\n\n    return r1;\n  }\n}\n\n/**\n * P521\n */\n\nclass P521 extends Prime34 {\n  constructor() {\n    // 2^521 - 1 (= 3 mod 4)\n    super('p521', '000001ff ffffffff ffffffff ffffffff'\n                + 'ffffffff ffffffff ffffffff ffffffff'\n                + 'ffffffff ffffffff ffffffff ffffffff'\n                + 'ffffffff ffffffff ffffffff ffffffff'\n                + 'ffffffff');\n  }\n\n  imulK(num) {\n    // K = 0x01\n    return num;\n  }\n\n  core(x1) {\n    // Exponent: 2^519 - 1\n    // Bits: 519x1\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const x3 = red.sqrnmul(x2, 1, x1);\n    const x6 = red.sqrnmul(x3, 3, x3);\n    const x7 = red.sqrnmul(x6, 1, x1);\n    const x8 = red.sqrnmul(x7, 1, x1);\n    const x16 = red.sqrnmul(x8, 8, x8);\n    const x32 = red.sqrnmul(x16, 16, x16);\n    const x64 = red.sqrnmul(x32, 32, x32);\n    const x128 = red.sqrnmul(x64, 64, x64);\n    const x256 = red.sqrnmul(x128, 128, x128);\n    const x512 = red.sqrnmul(x256, 256, x256);\n    const x519 = red.sqrnmul(x512, 7, x7);\n\n    return x519;\n  }\n\n  pm3d4(x1) {\n    // Exponent: 2^519 - 1\n    // Bits: 519x1\n    return this.core(x1);\n  }\n\n  pm2(x1) {\n    // Exponent: p - 2\n    // Bits: 519x1 1x0 1x1\n    const {red} = x1;\n    const r0 = this.core(x1);\n    const r1 = red.sqrn(r0, 1);\n    const r2 = red.sqrnmul(r1, 1, x1);\n\n    return r2;\n  }\n\n  pp1d4(x1) {\n    // Exponent: (p + 1) / 4\n    // Bits: 1x1 519x0\n    const {red} = x1;\n    const r0 = red.sqrn(x1, 519);\n\n    return r0;\n  }\n}\n\n/**\n * K256\n */\n\nclass K256 extends Prime34 {\n  constructor() {\n    // 2^256 - 2^32 - 977 (= 3 mod 4)\n    super('k256', 'ffffffff ffffffff ffffffff ffffffff'\n                + 'ffffffff ffffffff fffffffe fffffc2f');\n  }\n\n  split(input, output) {\n    // 256 = 9 * 26 + 22\n    const mask = 0x3fffff;\n    const len = Math.min(input.length, 9);\n\n    output._alloc(len + 1);\n\n    for (let i = 0; i < len; i++)\n      output.words[i] = input.words[i];\n\n    output.length = len;\n\n    if (input.length <= 9) {\n      output._strip();\n      input.words[0] = 0;\n      input.length = 1;\n      return;\n    }\n\n    // Shift by 9 limbs.\n    let prev = input.words[9];\n    let i = 10;\n\n    output.words[output.length++] = prev & mask;\n    output._strip();\n\n    for (; i < input.length; i++) {\n      const next = input.words[i] | 0;\n\n      input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n\n      prev = next;\n    }\n\n    prev >>>= 22;\n\n    input.words[i - 10] = prev;\n\n    if (prev === 0 && input.length > 10)\n      input.length -= 10;\n    else\n      input.length -= 9;\n\n    input._strip(); // Unsure if we need this.\n  }\n\n  imulK(num) {\n    // K = 0x1000003d1 = [0x40, 0x3d1]\n    // K = 2^32 + 977\n    num._expand(num.length + 2);\n\n    // Bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n    let lo = 0;\n\n    for (let i = 0; i < num.length; i++) {\n      const w = num.words[i];\n\n      lo += w * 0x3d1;\n\n      num.words[i] = lo & 0x3ffffff;\n\n      lo = w * 0x40 + Math.floor(lo / 0x4000000);\n    }\n\n    // Fast length reduction.\n    if (num.words[num.length - 1] === 0) {\n      num.length -= 1;\n      if (num.words[num.length - 1] === 0)\n        num.length -= 1;\n    }\n\n    // Note: we shouldn't need to strip here.\n    return num;\n  }\n\n  core(x1, x2) {\n    // Exponent: (p - 47) / 64\n    // Bits: 223x1 1x0 22x1 4x0\n    const {red} = x1;\n    const x3 = red.sqrnmul(x2, 1, x1);\n    const x6 = red.sqrnmul(x3, 3, x3);\n    const x9 = red.sqrnmul(x6, 3, x3);\n    const x11 = red.sqrnmul(x9, 2, x2);\n    const x22 = red.sqrnmul(x11, 11, x11);\n    const x44 = red.sqrnmul(x22, 22, x22);\n    const x88 = red.sqrnmul(x44, 44, x44);\n    const x176 = red.sqrnmul(x88, 88, x88);\n    const x220 = red.sqrnmul(x176, 44, x44);\n    const x223 = red.sqrnmul(x220, 3, x3);\n    const r0 = red.sqrn(x223, 1);\n    const r1 = red.sqrnmul(r0, 22, x22);\n    const r2 = red.sqrn(r1, 4);\n\n    return r2;\n  }\n\n  pm3d4(x1) {\n    // Exponent: (p - 3) / 4\n    // Bits: 223x1 1x0 22x1 4x0 1x1 1x0 2x1\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const r2 = this.core(x1, x2);\n    const r3 = red.sqrnmul(r2, 1, x1);\n    const r4 = red.sqrn(r3, 1);\n    const r5 = red.sqrnmul(r4, 2, x2);\n\n    return r5;\n  }\n\n  pm2(x1) {\n    // Exponent: p - 2\n    // Bits: 223x1 1x0 22x1 4x0 1x1 1x0 2x1 1x0 1x1\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const r2 = this.core(x1, x2);\n    const r3 = red.sqrnmul(r2, 1, x1);\n    const r4 = red.sqrn(r3, 1);\n    const r5 = red.sqrnmul(r4, 2, x2);\n    const r6 = red.sqrn(r5, 1);\n    const r7 = red.sqrnmul(r6, 1, x1);\n\n    return r7;\n  }\n\n  pp1d4(x1) {\n    // Exponent: (p + 1) / 4\n    // Bits: 223x1 1x0 22x1 4x0 2x1 2x0\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const r2 = this.core(x1, x2);\n    const r3 = red.sqrnmul(r2, 2, x2);\n    const r4 = red.sqrn(r3, 2);\n\n    return r4;\n  }\n}\n\n/**\n * P251\n */\n\nclass P251 extends Prime34 {\n  constructor() {\n    // 2^251 - 9\n    super('p251', '07ffffff ffffffff ffffffff ffffffff'\n                + 'ffffffff ffffffff ffffffff fffffff7');\n  }\n\n  imulK(num) {\n    // K = 0x09\n    if (num.isZero())\n      return num;\n\n    let carry = 0;\n\n    for (let i = 0; i < num.length; i++) {\n      const w = num.words[i] * 0x09 + carry;\n\n      carry = w >>> 26;\n\n      num.words[i] = w & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      num._alloc(num.length + 1);\n      num.words[num.length++] = carry;\n    }\n\n    // Note: we shouldn't need to strip here.\n    return num;\n  }\n\n  core(x1) {\n    // Exponent: 2^247 - 1\n    // Bits: 247x1\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const x3 = red.sqrnmul(x2, 1, x1);\n    const x6 = red.sqrnmul(x3, 3, x3);\n    const x12 = red.sqrnmul(x6, 6, x6);\n    const x24 = red.sqrnmul(x12, 12, x12);\n    const x48 = red.sqrnmul(x24, 24, x24);\n    const x96 = red.sqrnmul(x48, 48, x48);\n    const x192 = red.sqrnmul(x96, 96, x96);\n    const x240 = red.sqrnmul(x192, 48, x48);\n    const x246 = red.sqrnmul(x240, 6, x6);\n    const x247 = red.sqrnmul(x246, 1, x1);\n\n    return x247;\n  }\n\n  pm3d4(x1) {\n    // Exponent: (p - 3) / 4\n    // Bits: 247x1 1x0 1x1\n    const {red} = x1;\n    const r0 = this.core(x1);\n    const r1 = red.sqrn(r0, 1);\n    const r2 = red.sqrnmul(r1, 1, x1);\n\n    return r2;\n  }\n\n  pm2(x1) {\n    // Exponent: p - 2\n    // Bits: 247x1 1x0 1x1 1x0 1x1\n    const {red} = x1;\n    const r0 = this.core(x1);\n    const r1 = red.sqrn(r0, 1);\n    const r2 = red.sqrnmul(r1, 1, x1);\n    const r3 = red.sqrn(r2, 1);\n    const r4 = red.sqrnmul(r3, 1, x1);\n\n    return r4;\n  }\n\n  pp1d4(x1) {\n    // Exponent: (p + 1) / 4\n    // Bits: 248x1 1x0\n    const {red} = x1;\n    const r0 = this.core(x1);\n    const r1 = red.sqrnmul(r0, 1, x1);\n    const r2 = red.sqrn(r1, 1);\n\n    return r2;\n  }\n}\n\n/**\n * P25519\n */\n\nclass P25519 extends Prime58 {\n  constructor() {\n    // 2^255 - 19 (= 5 mod 8)\n    super('p25519', '7fffffff ffffffff ffffffff ffffffff'\n                  + 'ffffffff ffffffff ffffffff ffffffed',\n                    '2b832480 4fc1df0b 2b4d0099 3dfbd7a7'\n                  + '2f431806 ad2fe478 c4ee1b27 4a0ea0b0');\n  }\n\n  imulK(num) {\n    // K = 0x13\n    let carry = 0;\n\n    for (let i = 0; i < num.length; i++) {\n      const w = num.words[i] * 0x13 + carry;\n\n      carry = w >>> 26;\n\n      num.words[i] = w & 0x3ffffff;\n    }\n\n    if (carry !== 0) {\n      num._alloc(num.length + 1);\n      num.words[num.length++] = carry;\n    }\n\n    // Note: we shouldn't need to strip here.\n    return num;\n  }\n\n  core(x1, x2) {\n    // Exponent: 2^250 - 1\n    // Bits: 250x1\n    const {red} = x1;\n    const x4 = red.sqrnmul(x2, 2, x2);\n    const x5 = red.sqrnmul(x4, 1, x1);\n    const x10 = red.sqrnmul(x5, 5, x5);\n    const x20 = red.sqrnmul(x10, 10, x10);\n    const x40 = red.sqrnmul(x20, 20, x20);\n    const x50 = red.sqrnmul(x40, 10, x10);\n    const x100 = red.sqrnmul(x50, 50, x50);\n    const x200 = red.sqrnmul(x100, 100, x100);\n    const x250 = red.sqrnmul(x200, 50, x50);\n\n    return x250;\n  }\n\n  pm5d8(x1) {\n    // Exponent: (p - 5) / 8\n    // Bits: 250x1 1x0 1x1\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const r0 = this.core(x1, x2);\n    const r1 = red.sqrn(r0, 1);\n    const r2 = red.sqrnmul(r1, 1, x1);\n\n    return r2;\n  }\n\n  pm2(x1) {\n    // Exponent: p - 2\n    // Bits: 250x1 1x0 1x1 1x0 2x1\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const r0 = this.core(x1, x2);\n    const r1 = red.sqrn(r0, 1);\n    const r2 = red.sqrnmul(r1, 1, x1);\n    const r3 = red.sqrn(r2, 1);\n    const r4 = red.sqrnmul(r3, 2, x2);\n\n    return r4;\n  }\n\n  pp3d8(x1) {\n    // Exponent: (p + 3) / 8\n    // Bits: 251x1 1x0\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const r0 = this.core(x1, x2);\n    const r1 = red.sqrnmul(r0, 1, x1);\n    const r2 = red.sqrn(r1, 1);\n\n    return r2;\n  }\n}\n\n/**\n * P448\n */\n\nclass P448 extends Prime34 {\n  constructor() {\n    // 2^448 - 2^224 - 1 (= 3 mod 4)\n    super('p448', 'ffffffff ffffffff ffffffff ffffffff'\n                + 'ffffffff ffffffff fffffffe ffffffff'\n                + 'ffffffff ffffffff ffffffff ffffffff'\n                + 'ffffffff ffffffff');\n  }\n\n  imulK(num) {\n    // K = 0x100000000000000000000000000000000000000000000000000000001\n    // K = 2^224 + 1\n    const one = this.one.inject(num);\n    return num.iushln(224)._iadd(num, one);\n  }\n\n  core(x1, x2) {\n    // Exponent: 2^222 - 1\n    // Bits: 222x1\n    const {red} = x1;\n    const x3 = red.sqrnmul(x2, 1, x1);\n    const x6 = red.sqrnmul(x3, 3, x3);\n    const x9 = red.sqrnmul(x6, 3, x3);\n    const x11 = red.sqrnmul(x9, 2, x2);\n    const x22 = red.sqrnmul(x11, 11, x11);\n    const x44 = red.sqrnmul(x22, 22, x22);\n    const x88 = red.sqrnmul(x44, 44, x44);\n    const x176 = red.sqrnmul(x88, 88, x88);\n    const x220 = red.sqrnmul(x176, 44, x44);\n    const x222 = red.sqrnmul(x220, 2, x2);\n\n    return x222;\n  }\n\n  pm3d4(x1) {\n    // Exponent: (p - 3) / 4\n    // Bits: 223x1 1x0 222x1\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const x222 = this.core(x1, x2);\n    const r0 = red.sqrnmul(x222, 1, x1);\n    const r1 = red.sqrn(r0, 1);\n    const r2 = red.sqrnmul(r1, 222, x222);\n\n    return r2;\n  }\n\n  pm2(x1) {\n    // Exponent: p - 2\n    // Bits: 223x1 1x0 222x1 1x0 1x1\n    const {red} = x1;\n    const r0 = this.pm3d4(x1);\n    const r1 = red.sqrn(r0, 1);\n    const r2 = red.sqrnmul(r1, 1, x1);\n\n    return r2;\n  }\n\n  pp1d4(x1) {\n    // Exponent: (p + 1) / 4\n    // Bits: 224x1 222x0\n    const {red} = x1;\n    const x2 = red.sqrnmul(x1, 1, x1);\n    const r0 = this.core(x1, x2);\n    const r1 = red.sqrnmul(r0, 2, x2);\n    const r2 = red.sqrn(r1, 222);\n\n    return r2;\n  }\n}\n\n/**\n * Reduction Engine\n */\n\nclass Red {\n  constructor(m) {\n    let prime = null;\n\n    if (typeof m === 'string') {\n      prime = BN._prime(m);\n      m = prime.p;\n    }\n\n    enforce(BN.isBN(m), 'm', 'bignum');\n    nonred(!m.red, 'reduction');\n    range(m.sign() > 0, 'reduction');\n\n    this.m = m;\n    this.prime = prime;\n    this.mb = null;\n    this.sm1 = null;\n  }\n\n  _verify1(a) {\n    range(a.negative === 0, 'red');\n    red(a.red != null, 'red');\n  }\n\n  _verify2(a, b) {\n    range((a.negative | b.negative) === 0, 'red');\n    red(a.red != null && a.red === b.red, 'red');\n  }\n\n  get mont() {\n    return false;\n  }\n\n  precompute() {\n    // Precompute `sqrt(-1)` for primes congruent to 5 mod 8.\n    if (this.sm1 === null && this.m.andln(7) === 5) {\n      if (this.prime) {\n        this.sm1 = this.prime.sm1.clone()._forceRed(this);\n      } else {\n        const x = new BN(2).toRed(this);\n        const e = this.m.subn(1).iushrn(2);\n\n        // sqrt(-1) = 2^((p - 1) / 4) mod p\n        this.sm1 = this.pow(x, e);\n      }\n    }\n\n    return this;\n  }\n\n  convertTo(num) {\n    const res = num.mod(this.m);\n    res.red = this;\n    return res;\n  }\n\n  convertFrom(num) {\n    const res = num.clone();\n    res.red = null;\n    return res;\n  }\n\n  intTo(a) {\n    return a;\n  }\n\n  intFrom(a) {\n    return a;\n  }\n\n  imod(a) {\n    if (this.prime)\n      return this.prime.ireduce(a)._forceRed(this);\n\n    return a.imod(this.m)._forceRed(this);\n  }\n\n  iadd(a, b) {\n    this._verify2(a, b);\n\n    a._iadd(a, b);\n\n    if (a.ucmp(this.m) >= 0)\n      a._isub(a, this.m);\n\n    return a;\n  }\n\n  add(a, b) {\n    if (a.length < b.length)\n      return this.iadd(b.clone(), a);\n\n    return this.iadd(a.clone(), b);\n  }\n\n  iaddn(a, num) {\n    this._verify1(a);\n\n    if (num < 0)\n      return this.isubn(a, -num);\n\n    if (this.m.length === 1)\n      num %= this.m.words[0];\n\n    a._iaddn(num);\n\n    if (a.ucmp(this.m) >= 0)\n      a._isub(a, this.m);\n\n    return a;\n  }\n\n  addn(a, num) {\n    return this.iaddn(a.clone(), num);\n  }\n\n  isub(a, b) {\n    this._verify2(a, b);\n\n    //  0: a - a mod m == 0\n    // -1: a - b mod m == m - (b - a)\n    // +1: a - b mod m == a - b\n    const cmp = a.ucmp(b);\n\n    if (cmp === 0) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    if (cmp < 0) {\n      a._isub(b, a);\n      a._isub(this.m, a);\n    } else {\n      a._isub(a, b);\n    }\n\n    return a;\n  }\n\n  sub(a, b) {\n    return this.isub(a.clone(), b);\n  }\n\n  isubn(a, num) {\n    this._verify1(a);\n\n    if (num < 0)\n      return this.iaddn(a, -num);\n\n    if (this.m.length === 1)\n      num %= this.m.words[0];\n\n    //  <: a - b mod m == m - (b - a)\n    // >=: a - b mod m == a - b\n    if (a.length === 1 && a.words[0] < num) {\n      a.words[0] = num - a.words[0];\n      a._isub(this.m, a);\n    } else {\n      a._isubn(num);\n    }\n\n    return a;\n  }\n\n  subn(a, num) {\n    return this.isubn(a.clone(), num);\n  }\n\n  imul(a, b) {\n    this._verify2(a, b);\n    return this.imod(a.imul(b));\n  }\n\n  mul(a, b) {\n    this._verify2(a, b);\n    return this.imod(a.mul(b));\n  }\n\n  imuln(a, num) {\n    this._verify1(a);\n\n    if (a.isZero())\n      return a;\n\n    if (num === 0) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    const neg = num < 0;\n\n    if (neg)\n      num = -num;\n\n    if (this.m.length === 1)\n      num %= this.m.words[0];\n\n    a.imuln(num);\n\n    if (num <= 16) {\n      // Quick reduction.\n      while (a.ucmp(this.m) >= 0)\n        a._isub(a, this.m);\n    } else {\n      this.imod(a);\n    }\n\n    if (neg)\n      this.ineg(a);\n\n    return a;\n  }\n\n  muln(a, num) {\n    return this.imuln(a.clone(), num);\n  }\n\n  idiv(a, b) {\n    return this.div(a, b)._move(a);\n  }\n\n  div(a, b) {\n    return this.mul(a, this.invert(b));\n  }\n\n  idivn(a, num) {\n    return this.divn(a, num)._move(a);\n  }\n\n  divn(a, num) {\n    return this.div(a, this.convertTo(new BN(num)));\n  }\n\n  ipow(a, num) {\n    return this.pow(a, num)._move(a);\n  }\n\n  pow(a, num) {\n    this._verify1(a);\n\n    if (num.isNeg())\n      a = this.invert(a);\n\n    // Small exponent.\n    if (num.length === 1)\n      return this.pown(a, num.words[0]);\n\n    // Call out to BigInt.\n    if (HAS_BIGINT && !this.prime)\n      return this.powInt(a, num);\n\n    // Otherwise, a BN implementation.\n    return this.powNum(a, num);\n  }\n\n  powNum(a, num) {\n    // Sliding window (odd multiples only).\n    const one = new BN(1).toRed(this);\n    const wnd = new Array(WND_SIZE);\n    const a2 = this.sqr(a);\n\n    wnd[0] = a;\n\n    for (let i = 1; i < WND_SIZE; i++)\n      wnd[i] = this.mul(wnd[i - 1], a2);\n\n    let i = num.bitLength();\n    let r = one;\n\n    while (i >= WND_WIDTH) {\n      let width = WND_WIDTH;\n      let bits = num.bits(i - width, width);\n\n      if (bits < WND_SIZE) {\n        r = this.sqr(r);\n        i -= 1;\n        continue;\n      }\n\n      while ((bits & 1) === 0) {\n        width -= 1;\n        bits >>= 1;\n      }\n\n      if (r === one) {\n        r = wnd[bits >> 1].clone();\n      } else {\n        r = this.sqrn(r, width);\n        r = this.mul(r, wnd[bits >> 1]);\n      }\n\n      i -= width;\n    }\n\n    if (i > 0) {\n      const bits = num.bits(0, i);\n\n      while (i--) {\n        r = this.sqr(r);\n\n        if ((bits >> i) & 1)\n          r = this.mul(r, a);\n      }\n    }\n\n    return r;\n  }\n\n  powInt(a, num) {\n    if (this.mb === null)\n      this.mb = this.m.toBigInt();\n\n    const x = this.intFrom(a.toBigInt());\n    const y = powInt(x, num, this.mb);\n    const z = this.intTo(y);\n\n    return BN.fromBigInt(z)._forceRed(this);\n  }\n\n  sqrn(a, n) {\n    while (n--)\n      a = this.sqr(a);\n\n    return a;\n  }\n\n  sqrnmul(a, n, b) {\n    return this.mul(this.sqrn(a, n), b);\n  }\n\n  ipown(a, num) {\n    return this.pown(a, num)._move(a);\n  }\n\n  pown(a, num) {\n    this._verify1(a);\n\n    if (num < 0) {\n      a = this.invert(a);\n      num = -num;\n    }\n\n    if (num === 0)\n      return new BN(1).toRed(this);\n\n    if (num === 1)\n      return a.clone();\n\n    const bits = countBits(num);\n\n    let r = a;\n\n    for (let i = bits - 2; i >= 0; i--) {\n      r = this.sqr(r);\n\n      if ((num >> i) & 1)\n        r = this.mul(r, a);\n    }\n\n    return r;\n  }\n\n  isqr(a) {\n    return this.imul(a, a);\n  }\n\n  sqr(a) {\n    return this.mul(a, a);\n  }\n\n  isqrt(x) {\n    return this.sqrt(x)._move(x);\n  }\n\n  sqrt(x) {\n    this._verify1(x);\n\n    // Optimized square root chain.\n    if (this.prime)\n      return this.prime.sqrt(x);\n\n    // Fast case (p = 3 mod 4).\n    if (this.m.andln(3) === 3)\n      return this.sqrt3mod4(x);\n\n    // Fast case (p = 5 mod 8).\n    if (this.m.andln(7) === 5) {\n      if (this.sm1 != null)\n        return this.sqrt5mod8sm1(x);\n      return this.sqrt5mod8(x);\n    }\n\n    // Slow case (Tonelli-Shanks).\n    return this.sqrt0(x);\n  }\n\n  sqrt3mod4(x) {\n    const e = this.m.addn(1).iushrn(2); // (p + 1) / 4\n    const b = this.pow(x, e);\n\n    if (!this.sqr(b).eq(x))\n      throw new SquareRootError(b);\n\n    return b;\n  }\n\n  sqrt5mod8(x) {\n    // Atkin's Algorithm.\n    const one = new BN(1).toRed(this);\n    const e = this.m.ushrn(3); // (p - 5) / 8\n    const x2 = this.add(x, x);\n    const alpha = this.pow(x2, e);\n    const beta = this.mul(x2, this.sqr(alpha));\n    const b = this.mul(this.mul(alpha, x), this.isub(beta, one));\n\n    if (!this.sqr(b).eq(x))\n      throw new SquareRootError(b);\n\n    return b;\n  }\n\n  sqrt5mod8sm1(x) {\n    const e = this.m.addn(3).iushrn(3); // (p + 3) / 8\n    const b = this.pow(x, e);\n\n    if (this.sqr(b).eq(x))\n      return b;\n\n    const c = this.mul(b, this.sm1);\n\n    if (this.sqr(c).eq(x))\n      return c;\n\n    throw new SquareRootError(b);\n  }\n\n  sqrt0(x) {\n    if (this.m.cmpn(1) === 0 || !this.m.isOdd())\n      throw new Error('Invalid prime.');\n\n    switch (this.jacobi(x)) {\n      case -1:\n        throw new SquareRootError(x);\n      case 0:\n        return x.clone();\n      case 1:\n        break;\n    }\n\n    const one = new BN(1).toRed(this);\n    const s = this.m.subn(1);\n    const e = s._makeOdd();\n    const n = new BN(2).toRed(this);\n\n    while (this.jacobi(n) !== -1)\n      this.iadd(n, one);\n\n    let g = this.pow(n, s);\n    let b = this.pow(x, s);\n    let y = this.pow(x, s.iaddn(1).iushrn(1));\n    let k = e;\n\n    for (;;) {\n      let t = b;\n      let m = 0;\n\n      while (!t.eq(one) && m < k) {\n        t = this.sqr(t);\n        m += 1;\n      }\n\n      if (m === 0)\n        break;\n\n      assert(m < k);\n\n      t = this.sqrn(g, k - m - 1);\n      g = this.sqr(t);\n      y = this.mul(y, t);\n      b = this.mul(b, g);\n      k = m;\n    }\n\n    return y;\n  }\n\n  idivsqrt(u, v) {\n    return this.divsqrt(u, v)._move(u);\n  }\n\n  divsqrt(u, v) {\n    this._verify2(u, v);\n\n    // u = 0, v = 0\n    if (u.isZero() && v.isZero())\n      throw new SquareRootError(v);\n\n    // Optimized inverse square root chain.\n    if (this.prime)\n      return this.prime.divsqrt(u, v);\n\n    // p = 3 mod 4\n    if (this.m.andln(3) === 3)\n      return this.divsqrt3mod4(u, v);\n\n    // p = 5 mod 8\n    if (this.sm1 != null && this.m.andln(7) === 5)\n      return this.divsqrt5mod8(u, v);\n\n    // v = 0\n    if (v.isZero())\n      throw new SquareRootError(v);\n\n    return this.sqrt(this.div(u, v));\n  }\n\n  divsqrt3mod4(u, v) {\n    // x = u^3 * v * (u^5 * v^3)^((p - 3) / 4) mod p\n    const e = this.m.subn(3).iushrn(2);\n    const u2 = this.sqr(u);\n    const u3 = this.mul(u2, u);\n    const u5 = this.mul(u3, u2);\n    const v3 = this.mul(this.sqr(v), v);\n    const p = this.pow(this.mul(u5, v3), e);\n    const x = this.mul(this.mul(u3, v), p);\n    const c = this.mul(v, this.sqr(x));\n\n    if (c.eq(u))\n      return x;\n\n    throw new SquareRootError(x);\n  }\n\n  divsqrt5mod8(u, v) {\n    // x = u * v^3 * (u * v^7)^((p - 5) / 8) mod p\n    const e = this.m.subn(5).iushrn(3);\n    const v3 = this.mul(this.sqr(v), v);\n    const v7 = this.mul(this.sqr(v3), v);\n    const p = this.pow(this.mul(u, v7), e);\n    const x = this.mul(this.mul(u, v3), p);\n    const c = this.mul(v, this.sqr(x));\n\n    if (c.eq(u))\n      return x;\n\n    const mc = this.ineg(c);\n\n    if (mc.eq(u))\n      return this.mul(x, this.sm1);\n\n    if (mc.eq(this.mul(u, this.sm1)))\n      throw new SquareRootError(this.mul(x, this.sm1));\n\n    throw new SquareRootError(x);\n  }\n\n  isSquare(a) {\n    if (this.m.isOdd())\n      return this.jacobi(a) >= 0;\n\n    return this.kronecker(a) >= 0;\n  }\n\n  ishl(a, num) {\n    this._verify1(a);\n    return this.imod(a.iushl(num));\n  }\n\n  shl(a, num) {\n    return this.ishl(a.clone(), num);\n  }\n\n  ishln(a, num) {\n    this._verify1(a);\n\n    a.iushln(num);\n\n    if (num <= 4) {\n      // Quick reduction.\n      while (a.ucmp(this.m) >= 0)\n        a._isub(a, this.m);\n    } else {\n      this.imod(a);\n    }\n\n    return a;\n  }\n\n  shln(a, num) {\n    return this.ishln(a.clone(), num);\n  }\n\n  ineg(a) {\n    this._verify1(a);\n\n    if (!a.isZero())\n      a._isub(this.m, a);\n\n    return a;\n  }\n\n  neg(a) {\n    return this.ineg(a.clone());\n  }\n\n  eq(a, b) {\n    this._verify2(a, b);\n    return a.ucmp(b) === 0;\n  }\n\n  eqn(a, num) {\n    this._verify1(a);\n\n    if (this.m.length === 1) {\n      num %= this.m.words[0];\n\n      if (num < 0)\n        num += this.m.words[0];\n\n      return a.ucmpn(num) === 0;\n    }\n\n    if (num < 0) {\n      this.m._isubn(-num);\n\n      const cmp = a.ucmp(this.m);\n\n      this.m._iaddn(-num);\n\n      return cmp === 0;\n    }\n\n    return a.ucmpn(num) === 0;\n  }\n\n  isHigh(a) {\n    return !this.isLow(a);\n  }\n\n  isLow(a) {\n    this._verify1(a);\n    return a.ucmp(this.m.ushrn(1)) <= 0;\n  }\n\n  isOdd(a) {\n    this._verify1(a);\n    return a.isOdd();\n  }\n\n  isEven(a) {\n    this._verify1(a);\n    return a.isEven();\n  }\n\n  legendre(num) {\n    this._verify1(num);\n\n    if (this.m.isEven())\n      throw new Error('legendre: `num` must be odd.');\n\n    // Euler's criterion.\n    const e = this.m.subn(1).iushrn(1); // (p - 1) / 2\n    const symbol = this.pow(num, e);\n\n    if (symbol.isZero())\n      return 0;\n\n    const one = new BN(1).toRed(this);\n\n    if (symbol.eq(one))\n      return 1;\n\n    if (symbol.eq(this.ineg(one)))\n      return -1;\n\n    throw new Error('Invalid prime.');\n  }\n\n  jacobi(a) {\n    this._verify1(a);\n    return a.jacobi(this.m);\n  }\n\n  kronecker(a) {\n    this._verify1(a);\n    return a.kronecker(this.m);\n  }\n\n  iinvert(a) {\n    return this.invert(a)._move(a);\n  }\n\n  invert(a) {\n    this._verify1(a);\n    return a.invert(this.m)._forceRed(this);\n  }\n\n  ifermat(a) {\n    return this.fermat(a)._move(a);\n  }\n\n  fermat(a) {\n    this._verify1(a);\n\n    if (a.isZero() || this.m.cmpn(1) === 0)\n      throw new RangeError('Not invertible.');\n\n    // Optimized inversion chain.\n    if (this.prime)\n      return this.prime.fermat(a);\n\n    // Invert using fermat's little theorem.\n    return this.pow(a, this.m.subn(2));\n  }\n\n  invertAll(elems) {\n    // Montgomery's trick.\n    enforce(Array.isArray(elems), 'elems', 'array');\n\n    for (const elem of elems) {\n      enforce(BN.isBN(elem), 'elem', 'bignum');\n\n      this._verify1(elem);\n    }\n\n    if (this.m.cmpn(1) === 0 || this.m.isEven())\n      throw new RangeError('Not invertible.');\n\n    const len = elems.length;\n    const invs = new Array(len);\n\n    if (len === 0)\n      return invs;\n\n    let acc = new BN(1).toRed(this);\n\n    for (let i = 0; i < len; i++) {\n      if (elems[i].isZero()) {\n        invs[i] = elems[i].clone();\n        continue;\n      }\n\n      invs[i] = acc;\n      acc = this.mul(acc, elems[i]);\n    }\n\n    acc = this.invert(acc);\n\n    for (let i = len - 1; i >= 0; i--) {\n      if (elems[i].isZero())\n        continue;\n\n      invs[i] = this.mul(acc, invs[i]);\n      acc = this.mul(acc, elems[i]);\n    }\n\n    return invs;\n  }\n\n  [custom]() {\n    if (this.prime)\n      return `<Red: ${this.prime.name}>`;\n\n    return `<Red: ${this.m.toString(10)}>`;\n  }\n}\n\n/**\n * Barrett Engine\n */\n\nclass Barrett extends Red {\n  constructor(m) {\n    super(m);\n\n    this.prime = null;\n    this.n = this.m.bitLength();\n\n    if ((this.n % 26) !== 0)\n      this.n += 26 - (this.n % 26);\n\n    this.k = this.n * 2;\n    this.w = this.k / 26;\n    this.b = BN.shift(1, this.k).div(this.m);\n  }\n\n  convertTo(num) {\n    if (num.length > this.w)\n      return super.convertTo(num);\n\n    return this.imod(num.clone());\n  }\n\n  _shift(q) {\n    let i = 0;\n    let j = this.w;\n\n    while (j < q.length)\n      q.words[i++] = q.words[j++];\n\n    if (i === 0)\n      q.words[i++] = 0;\n\n    q.length = i;\n  }\n\n  imod(a) {\n    const neg = a.negative;\n\n    assert(a.length <= this.w);\n\n    a.negative = 0;\n\n    const q = a.mul(this.b);\n\n    // Shift right by `k` bits.\n    this._shift(q);\n\n    a._isub(a, q.mul(this.m));\n\n    if (a.ucmp(this.m) >= 0)\n      a._isub(a, this.m);\n\n    if (neg && !a.isZero())\n      a._isub(this.m, a);\n\n    a.red = this;\n\n    return a;\n  }\n}\n\n/**\n * Montgomery Engine\n */\n\nclass Mont extends Red {\n  constructor(m) {\n    super(m);\n\n    // Note that:\n    //\n    //   mi = (-m^-1 mod (2^(n * 2))) mod r\n    //\n    // and:\n    //\n    //   mi = (((2^n)^-1 mod m) * r^-1 - 1) / m\n    //\n    // are equivalent.\n    this.prime = null;\n    this.n = this.m.length * 26;\n    this.r = BN.shift(1, this.n);\n    this.r2 = BN.shift(1, this.n * 2).imod(this.m);\n    this.ri = this.r.invert(this.m);\n    this.mi = this.r.mul(this.ri).isubn(1).div(this.m);\n    this.rib = null;\n  }\n\n  get mont() {\n    return true;\n  }\n\n  convertTo(num) {\n    if (num.isNeg() || num.ucmp(this.m) >= 0)\n      return this.imod(num.ushln(this.n));\n\n    // Equivalent to: (num * 2^n) mod m\n    return this.mul(num, this.r2);\n  }\n\n  convertFrom(num) {\n    // Equivalent to: num * r^-1 mod m\n    const r = this.mul(num, new BN(1));\n    r.red = null;\n    return r;\n  }\n\n  intTo(a) {\n    return (a << BigInt(this.n)) % this.mb;\n  }\n\n  intFrom(a) {\n    if (this.rib === null)\n      this.rib = this.ri.toBigInt();\n\n    return (a * this.rib) % this.mb;\n  }\n\n  iaddn(a, num) {\n    return this.iadd(a, this.convertTo(new BN(num)));\n  }\n\n  isubn(a, num) {\n    return this.isub(a, this.convertTo(new BN(num)));\n  }\n\n  imul(a, b) {\n    return this.mul(a, b)._move(a);\n  }\n\n  mul(a, b) {\n    if (a.isZero() || b.isZero())\n      return new BN(0)._forceRed(this);\n\n    const t = a.mul(b);\n    const c = t.umaskn(this.n).mul(this.mi).iumaskn(this.n);\n    const u = t.iadd(c.mul(this.m)).iushrn(this.n);\n\n    if (u.ucmp(this.m) >= 0)\n      u._isub(u, this.m);\n\n    return u._forceRed(this);\n  }\n\n  imuln(a, num) {\n    this._verify1(a);\n\n    if (a.isZero())\n      return a;\n\n    if (num === 0) {\n      a.words[0] = 0;\n      a.length = 1;\n      return a;\n    }\n\n    const neg = num < 0;\n\n    if (neg)\n      num = -num;\n\n    if (this.m.length === 1)\n      num %= this.m.words[0];\n\n    const bits = countBits(num);\n\n    // Potentially compute with additions.\n    // This avoids an expensive division.\n    if (bits > 5) {\n      // Slow case (num > 31).\n      this.imul(a, this.convertTo(new BN(num)));\n    } else if ((num & (num - 1)) === 0) {\n      // Optimize for powers of two.\n      for (let i = 0; i < bits - 1; i++)\n        this.iadd(a, a);\n    } else {\n      // Multiply left to right.\n      const c = a.clone();\n\n      for (let i = bits - 2; i >= 0; i--) {\n        this.iadd(a, a);\n\n        if ((num >> i) & 1)\n          this.iadd(a, c);\n      }\n    }\n\n    if (neg)\n      this.ineg(a);\n\n    return a;\n  }\n\n  eqn(a, num) {\n    this._verify1(a);\n\n    if (num === 0)\n      return a.isZero();\n\n    return a.ucmp(this.convertTo(new BN(num))) === 0;\n  }\n\n  isLow(a) {\n    this._verify1(a);\n    return this.convertFrom(a).ucmp(this.m.ushrn(1)) <= 0;\n  }\n\n  isOdd(a) {\n    this._verify1(a);\n    return this.convertFrom(a).isOdd();\n  }\n\n  isEven(a) {\n    this._verify1(a);\n    return this.convertFrom(a).isEven();\n  }\n\n  invert(a) {\n    this._verify1(a);\n\n    // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n    return this.imod(a.invert(this.m).mul(this.r2));\n  }\n}\n\n/*\n * Helpers\n */\n\nfunction makeError(Error, msg, start) {\n  const err = new Error(msg);\n\n  if (Error.captureStackTrace)\n    Error.captureStackTrace(err, start);\n\n  return err;\n}\n\nfunction assert(value, message) {\n  if (!value) {\n    const msg = message || 'Assertion failed.';\n    throw makeError(Error, msg, assert);\n  }\n}\n\nfunction enforce(value, name, type) {\n  if (!value) {\n    const msg = `\"${name}\" must be a(n) ${type}.`;\n    throw makeError(TypeError, msg, enforce);\n  }\n}\n\nfunction range(value, name) {\n  if (!value) {\n    const msg = `\"${name}\" only works with positive numbers.`;\n    throw makeError(RangeError, msg, range);\n  }\n}\n\nfunction red(value, name) {\n  if (!value) {\n    const msg = `\"${name}\" only works with red numbers.`;\n    throw makeError(TypeError, msg, red);\n  }\n}\n\nfunction nonred(value, name) {\n  if (!value) {\n    const msg = `\"${name}\" only works with normal numbers.`;\n    throw makeError(TypeError, msg, nonred);\n  }\n}\n\nfunction nonzero(value) {\n  if (!value) {\n    const msg = 'Cannot divide by zero.';\n    throw makeError(RangeError, msg, nonzero);\n  }\n}\n\nclass SquareRootError extends Error {\n  constructor(result) {\n    super();\n\n    this.name = 'SquareRootError';\n    this.message = 'X is not a square mod P.';\n    this.result = result.fromRed();\n\n    if (Error.captureStackTrace)\n      Error.captureStackTrace(this, SquareRootError);\n  }\n}\n\nfunction isInteger(num) {\n  return Number.isSafeInteger(num);\n}\n\nfunction isSMI(num) {\n  return isInteger(num)\n      && num >= -0x3ffffff\n      && num <= 0x3ffffff;\n}\n\nfunction allocate(ArrayType, size) {\n  if (ArrayType.allocUnsafeSlow)\n    return ArrayType.allocUnsafeSlow(size);\n\n  return new ArrayType(size);\n}\n\nfunction getBase(base) {\n  if (base == null)\n    return 10;\n\n  if (typeof base === 'number')\n    return base;\n\n  switch (base) {\n    case 'bin':\n      return 2;\n    case 'oct':\n      return 8;\n    case 'dec':\n      return 10;\n    case 'hex':\n      return 16;\n  }\n\n  return 0;\n}\n\n/*\n * Internal\n */\n\nfunction countBits(w) {\n  if (Math.clz32)\n    return 32 - Math.clz32(w);\n\n  let t = w;\n  let r = 0;\n\n  if (t >= 0x1000) {\n    r += 13;\n    t >>>= 13;\n  }\n\n  if (t >= 0x40) {\n    r += 7;\n    t >>>= 7;\n  }\n\n  if (t >= 0x8) {\n    r += 4;\n    t >>>= 4;\n  }\n\n  if (t >= 0x02) {\n    r += 2;\n    t >>>= 2;\n  }\n\n  return r + t;\n}\n\nfunction zeroBits(w) {\n  // Shortcut.\n  if (w === 0)\n    return 26;\n\n  let t = w;\n  let r = 0;\n\n  if ((t & 0x1fff) === 0) {\n    r += 13;\n    t >>>= 13;\n  }\n\n  if ((t & 0x7f) === 0) {\n    r += 7;\n    t >>>= 7;\n  }\n\n  if ((t & 0xf) === 0) {\n    r += 4;\n    t >>>= 4;\n  }\n\n  if ((t & 0x3) === 0) {\n    r += 2;\n    t >>>= 2;\n  }\n\n  if ((t & 0x1) === 0)\n    r += 1;\n\n  return r;\n}\n\nfunction parseHex(str, start, end) {\n  const len = Math.min(str.length, end);\n\n  let r = 0;\n  let z = 0;\n\n  for (let i = start; i < len; i++) {\n    const c = str.charCodeAt(i) - 48;\n\n    r <<= 4;\n\n    let b;\n\n    if (c >= 49 && c <= 54) {\n      // 'a' - 'f'\n      b = c - 49 + 0xa;\n    } else if (c >= 17 && c <= 22) {\n      // 'A' - 'F'\n      b = c - 17 + 0xa;\n    } else {\n      // '0' - '9'\n      b = c;\n    }\n\n    r |= b;\n    z |= b;\n  }\n\n  if (z & ~15)\n    throw new Error('Invalid string.');\n\n  return r;\n}\n\nfunction parseBase(str, start, end, mul) {\n  const len = Math.min(str.length, end);\n\n  let r = 0;\n\n  for (let i = start; i < len; i++) {\n    const c = str.charCodeAt(i) - 48;\n\n    r *= mul;\n\n    let b;\n\n    if (c >= 49) {\n      // 'a'\n      b = c - 49 + 0xa;\n    } else if (c >= 17) {\n      // 'A'\n      b = c - 17 + 0xa;\n    } else {\n      // '0' - '9'\n      b = c;\n    }\n\n    if (c < 0 || c > 207 || b >= mul)\n      throw new Error('Invalid string.');\n\n    r += b;\n  }\n\n  return r;\n}\n\n/*\n * Exponentiation (bigint)\n */\n\nfunction powInt(x, e, m) {\n  // Sliding window (odd multiples only).\n  const one = BigInt(1);\n  const wnd = new Array(WND_SIZE);\n  const x2 = (x * x) % m;\n\n  wnd[0] = x;\n\n  for (let i = 1; i < WND_SIZE; i++)\n    wnd[i] = (wnd[i - 1] * x2) % m;\n\n  let i = e.bitLength();\n  let r = one;\n\n  while (i >= WND_WIDTH) {\n    let width = WND_WIDTH;\n    let bits = e.bits(i - width, width);\n\n    if (bits < WND_SIZE) {\n      r = (r * r) % m;\n      i -= 1;\n      continue;\n    }\n\n    while ((bits & 1) === 0) {\n      width -= 1;\n      bits >>= 1;\n    }\n\n    if (r === one) {\n      r = wnd[bits >> 1];\n    } else {\n      r = sqrn(r, width, m);\n      r = (r * wnd[bits >> 1]) % m;\n    }\n\n    i -= width;\n  }\n\n  if (i > 0) {\n    const bits = e.bits(0, i);\n\n    while (i--) {\n      r = (r * r) % m;\n\n      if ((bits >> i) & 1)\n        r = (r * x) % m;\n    }\n  }\n\n  return r;\n}\n\nfunction sqrn(x, n, m) {\n  for (let i = 0; i < n; i++)\n    x = (x * x) % m;\n  return x;\n}\n\n/*\n * Multiplication\n */\n\nfunction smallMulTo(self, num, out) {\n  const len = self.length + num.length;\n\n  out.negative = self.negative ^ num.negative;\n  out._alloc(len);\n  out.length = len;\n\n  // Peel one iteration (compiler can't\n  // do it, because of code complexity).\n  const a = self.words[0];\n  const b = num.words[0];\n  const r = a * b;\n  const lo = r & 0x3ffffff;\n\n  let carry = (r / 0x4000000) | 0;\n  let k = 1;\n\n  out.words[0] = lo;\n\n  for (; k < out.length - 1; k++) {\n    // Sum all words with the same\n    // `i + j = k` and accumulate\n    // `ncarry`, note that ncarry\n    // could be >= 0x3ffffff.\n    let ncarry = carry >>> 26;\n    let rword = carry & 0x3ffffff;\n\n    const min = Math.max(0, k - self.length + 1);\n    const max = Math.min(k, num.length - 1);\n\n    for (let j = min; j <= max; j++) {\n      const i = k - j;\n      const a = self.words[i];\n      const b = num.words[j];\n      const r = a * b + rword;\n\n      ncarry += (r / 0x4000000) | 0;\n      rword = r & 0x3ffffff;\n    }\n\n    out.words[k] = rword | 0;\n    carry = ncarry | 0;\n  }\n\n  if (carry !== 0)\n    out.words[k] = carry | 0;\n  else\n    out.length -= 1;\n\n  return out._strip();\n}\n\nfunction bigMulTo(self, num, out) {\n  const len = self.length + num.length;\n\n  out.negative = self.negative ^ num.negative;\n  out._alloc(len);\n  out.length = len;\n\n  let carry = 0;\n  let hncarry = 0;\n  let k = 0;\n\n  for (; k < out.length - 1; k++) {\n    // Sum all words with the same\n    // `i + j = k` and accumulate\n    // `ncarry`, note that ncarry\n    // could be >= 0x3ffffff.\n    let ncarry = hncarry;\n\n    hncarry = 0;\n\n    let rword = carry & 0x3ffffff;\n\n    const min = Math.max(0, k - self.length + 1);\n    const max = Math.min(k, num.length - 1);\n\n    for (let j = min; j <= max; j++) {\n      const i = k - j;\n      const a = self.words[i];\n      const b = num.words[j];\n      const r = a * b;\n\n      let lo = r & 0x3ffffff;\n\n      ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n      lo = (lo + rword) | 0;\n      rword = lo & 0x3ffffff;\n      ncarry = (ncarry + (lo >>> 26)) | 0;\n\n      hncarry += ncarry >>> 26;\n      ncarry &= 0x3ffffff;\n    }\n\n    out.words[k] = rword;\n    carry = ncarry;\n    ncarry = hncarry;\n  }\n\n  if (carry !== 0)\n    out.words[k] = carry;\n  else\n    out.length -= 1;\n\n  return out._strip();\n}\n\nfunction jumboMulTo(x, y, out) {\n  // v8 has a 2147483519 bit max (~256mb).\n  if (!HAS_BIGINT || x.length + y.length > 82595519)\n    return bigMulTo(x, y, out);\n\n  const zero = BigInt(0);\n  const mask = BigInt(0x3ffffff);\n  const shift = BigInt(26);\n\n  let z = x.toBigInt() * y.toBigInt();\n\n  const neg = (z < zero) | 0;\n\n  if (neg)\n    z = -z;\n\n  let i = 0;\n\n  while (z > zero) {\n    out.words[i++] = Number(z & mask);\n    z >>= shift;\n  }\n\n  if (i === 0)\n    out.words[i++] = 0;\n\n  out.length = i;\n  out.negative = neg;\n\n  return out;\n}\n\nfunction comb10MulTo(self, num, out) {\n  const a = self.words;\n  const b = num.words;\n  const o = out.words;\n  const a0 = a[0] | 0;\n  const al0 = a0 & 0x1fff;\n  const ah0 = a0 >>> 13;\n  const a1 = a[1] | 0;\n  const al1 = a1 & 0x1fff;\n  const ah1 = a1 >>> 13;\n  const a2 = a[2] | 0;\n  const al2 = a2 & 0x1fff;\n  const ah2 = a2 >>> 13;\n  const a3 = a[3] | 0;\n  const al3 = a3 & 0x1fff;\n  const ah3 = a3 >>> 13;\n  const a4 = a[4] | 0;\n  const al4 = a4 & 0x1fff;\n  const ah4 = a4 >>> 13;\n  const a5 = a[5] | 0;\n  const al5 = a5 & 0x1fff;\n  const ah5 = a5 >>> 13;\n  const a6 = a[6] | 0;\n  const al6 = a6 & 0x1fff;\n  const ah6 = a6 >>> 13;\n  const a7 = a[7] | 0;\n  const al7 = a7 & 0x1fff;\n  const ah7 = a7 >>> 13;\n  const a8 = a[8] | 0;\n  const al8 = a8 & 0x1fff;\n  const ah8 = a8 >>> 13;\n  const a9 = a[9] | 0;\n  const al9 = a9 & 0x1fff;\n  const ah9 = a9 >>> 13;\n  const b0 = b[0] | 0;\n  const bl0 = b0 & 0x1fff;\n  const bh0 = b0 >>> 13;\n  const b1 = b[1] | 0;\n  const bl1 = b1 & 0x1fff;\n  const bh1 = b1 >>> 13;\n  const b2 = b[2] | 0;\n  const bl2 = b2 & 0x1fff;\n  const bh2 = b2 >>> 13;\n  const b3 = b[3] | 0;\n  const bl3 = b3 & 0x1fff;\n  const bh3 = b3 >>> 13;\n  const b4 = b[4] | 0;\n  const bl4 = b4 & 0x1fff;\n  const bh4 = b4 >>> 13;\n  const b5 = b[5] | 0;\n  const bl5 = b5 & 0x1fff;\n  const bh5 = b5 >>> 13;\n  const b6 = b[6] | 0;\n  const bl6 = b6 & 0x1fff;\n  const bh6 = b6 >>> 13;\n  const b7 = b[7] | 0;\n  const bl7 = b7 & 0x1fff;\n  const bh7 = b7 >>> 13;\n  const b8 = b[8] | 0;\n  const bl8 = b8 & 0x1fff;\n  const bh8 = b8 >>> 13;\n  const b9 = b[9] | 0;\n  const bl9 = b9 & 0x1fff;\n  const bh9 = b9 >>> 13;\n\n  let c = 0;\n  let lo, mid, hi;\n\n  out.negative = self.negative ^ num.negative;\n  out._alloc(20);\n  out.length = 19;\n\n  /* k = 0 */\n  lo = Math.imul(al0, bl0);\n  mid = Math.imul(al0, bh0);\n  mid = (mid + Math.imul(ah0, bl0)) | 0;\n  hi = Math.imul(ah0, bh0);\n\n  let w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n  w0 &= 0x3ffffff;\n\n  /* k = 1 */\n  lo = Math.imul(al1, bl0);\n  mid = Math.imul(al1, bh0);\n  mid = (mid + Math.imul(ah1, bl0)) | 0;\n  hi = Math.imul(ah1, bh0);\n  lo = (lo + Math.imul(al0, bl1)) | 0;\n  mid = (mid + Math.imul(al0, bh1)) | 0;\n  mid = (mid + Math.imul(ah0, bl1)) | 0;\n  hi = (hi + Math.imul(ah0, bh1)) | 0;\n\n  let w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n  w1 &= 0x3ffffff;\n\n  /* k = 2 */\n  lo = Math.imul(al2, bl0);\n  mid = Math.imul(al2, bh0);\n  mid = (mid + Math.imul(ah2, bl0)) | 0;\n  hi = Math.imul(ah2, bh0);\n  lo = (lo + Math.imul(al1, bl1)) | 0;\n  mid = (mid + Math.imul(al1, bh1)) | 0;\n  mid = (mid + Math.imul(ah1, bl1)) | 0;\n  hi = (hi + Math.imul(ah1, bh1)) | 0;\n  lo = (lo + Math.imul(al0, bl2)) | 0;\n  mid = (mid + Math.imul(al0, bh2)) | 0;\n  mid = (mid + Math.imul(ah0, bl2)) | 0;\n  hi = (hi + Math.imul(ah0, bh2)) | 0;\n\n  let w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n  w2 &= 0x3ffffff;\n\n  /* k = 3 */\n  lo = Math.imul(al3, bl0);\n  mid = Math.imul(al3, bh0);\n  mid = (mid + Math.imul(ah3, bl0)) | 0;\n  hi = Math.imul(ah3, bh0);\n  lo = (lo + Math.imul(al2, bl1)) | 0;\n  mid = (mid + Math.imul(al2, bh1)) | 0;\n  mid = (mid + Math.imul(ah2, bl1)) | 0;\n  hi = (hi + Math.imul(ah2, bh1)) | 0;\n  lo = (lo + Math.imul(al1, bl2)) | 0;\n  mid = (mid + Math.imul(al1, bh2)) | 0;\n  mid = (mid + Math.imul(ah1, bl2)) | 0;\n  hi = (hi + Math.imul(ah1, bh2)) | 0;\n  lo = (lo + Math.imul(al0, bl3)) | 0;\n  mid = (mid + Math.imul(al0, bh3)) | 0;\n  mid = (mid + Math.imul(ah0, bl3)) | 0;\n  hi = (hi + Math.imul(ah0, bh3)) | 0;\n\n  let w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n  w3 &= 0x3ffffff;\n\n  /* k = 4 */\n  lo = Math.imul(al4, bl0);\n  mid = Math.imul(al4, bh0);\n  mid = (mid + Math.imul(ah4, bl0)) | 0;\n  hi = Math.imul(ah4, bh0);\n  lo = (lo + Math.imul(al3, bl1)) | 0;\n  mid = (mid + Math.imul(al3, bh1)) | 0;\n  mid = (mid + Math.imul(ah3, bl1)) | 0;\n  hi = (hi + Math.imul(ah3, bh1)) | 0;\n  lo = (lo + Math.imul(al2, bl2)) | 0;\n  mid = (mid + Math.imul(al2, bh2)) | 0;\n  mid = (mid + Math.imul(ah2, bl2)) | 0;\n  hi = (hi + Math.imul(ah2, bh2)) | 0;\n  lo = (lo + Math.imul(al1, bl3)) | 0;\n  mid = (mid + Math.imul(al1, bh3)) | 0;\n  mid = (mid + Math.imul(ah1, bl3)) | 0;\n  hi = (hi + Math.imul(ah1, bh3)) | 0;\n  lo = (lo + Math.imul(al0, bl4)) | 0;\n  mid = (mid + Math.imul(al0, bh4)) | 0;\n  mid = (mid + Math.imul(ah0, bl4)) | 0;\n  hi = (hi + Math.imul(ah0, bh4)) | 0;\n\n  let w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n  w4 &= 0x3ffffff;\n\n  /* k = 5 */\n  lo = Math.imul(al5, bl0);\n  mid = Math.imul(al5, bh0);\n  mid = (mid + Math.imul(ah5, bl0)) | 0;\n  hi = Math.imul(ah5, bh0);\n  lo = (lo + Math.imul(al4, bl1)) | 0;\n  mid = (mid + Math.imul(al4, bh1)) | 0;\n  mid = (mid + Math.imul(ah4, bl1)) | 0;\n  hi = (hi + Math.imul(ah4, bh1)) | 0;\n  lo = (lo + Math.imul(al3, bl2)) | 0;\n  mid = (mid + Math.imul(al3, bh2)) | 0;\n  mid = (mid + Math.imul(ah3, bl2)) | 0;\n  hi = (hi + Math.imul(ah3, bh2)) | 0;\n  lo = (lo + Math.imul(al2, bl3)) | 0;\n  mid = (mid + Math.imul(al2, bh3)) | 0;\n  mid = (mid + Math.imul(ah2, bl3)) | 0;\n  hi = (hi + Math.imul(ah2, bh3)) | 0;\n  lo = (lo + Math.imul(al1, bl4)) | 0;\n  mid = (mid + Math.imul(al1, bh4)) | 0;\n  mid = (mid + Math.imul(ah1, bl4)) | 0;\n  hi = (hi + Math.imul(ah1, bh4)) | 0;\n  lo = (lo + Math.imul(al0, bl5)) | 0;\n  mid = (mid + Math.imul(al0, bh5)) | 0;\n  mid = (mid + Math.imul(ah0, bl5)) | 0;\n  hi = (hi + Math.imul(ah0, bh5)) | 0;\n\n  let w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n  w5 &= 0x3ffffff;\n\n  /* k = 6 */\n  lo = Math.imul(al6, bl0);\n  mid = Math.imul(al6, bh0);\n  mid = (mid + Math.imul(ah6, bl0)) | 0;\n  hi = Math.imul(ah6, bh0);\n  lo = (lo + Math.imul(al5, bl1)) | 0;\n  mid = (mid + Math.imul(al5, bh1)) | 0;\n  mid = (mid + Math.imul(ah5, bl1)) | 0;\n  hi = (hi + Math.imul(ah5, bh1)) | 0;\n  lo = (lo + Math.imul(al4, bl2)) | 0;\n  mid = (mid + Math.imul(al4, bh2)) | 0;\n  mid = (mid + Math.imul(ah4, bl2)) | 0;\n  hi = (hi + Math.imul(ah4, bh2)) | 0;\n  lo = (lo + Math.imul(al3, bl3)) | 0;\n  mid = (mid + Math.imul(al3, bh3)) | 0;\n  mid = (mid + Math.imul(ah3, bl3)) | 0;\n  hi = (hi + Math.imul(ah3, bh3)) | 0;\n  lo = (lo + Math.imul(al2, bl4)) | 0;\n  mid = (mid + Math.imul(al2, bh4)) | 0;\n  mid = (mid + Math.imul(ah2, bl4)) | 0;\n  hi = (hi + Math.imul(ah2, bh4)) | 0;\n  lo = (lo + Math.imul(al1, bl5)) | 0;\n  mid = (mid + Math.imul(al1, bh5)) | 0;\n  mid = (mid + Math.imul(ah1, bl5)) | 0;\n  hi = (hi + Math.imul(ah1, bh5)) | 0;\n  lo = (lo + Math.imul(al0, bl6)) | 0;\n  mid = (mid + Math.imul(al0, bh6)) | 0;\n  mid = (mid + Math.imul(ah0, bl6)) | 0;\n  hi = (hi + Math.imul(ah0, bh6)) | 0;\n\n  let w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n  w6 &= 0x3ffffff;\n\n  /* k = 7 */\n  lo = Math.imul(al7, bl0);\n  mid = Math.imul(al7, bh0);\n  mid = (mid + Math.imul(ah7, bl0)) | 0;\n  hi = Math.imul(ah7, bh0);\n  lo = (lo + Math.imul(al6, bl1)) | 0;\n  mid = (mid + Math.imul(al6, bh1)) | 0;\n  mid = (mid + Math.imul(ah6, bl1)) | 0;\n  hi = (hi + Math.imul(ah6, bh1)) | 0;\n  lo = (lo + Math.imul(al5, bl2)) | 0;\n  mid = (mid + Math.imul(al5, bh2)) | 0;\n  mid = (mid + Math.imul(ah5, bl2)) | 0;\n  hi = (hi + Math.imul(ah5, bh2)) | 0;\n  lo = (lo + Math.imul(al4, bl3)) | 0;\n  mid = (mid + Math.imul(al4, bh3)) | 0;\n  mid = (mid + Math.imul(ah4, bl3)) | 0;\n  hi = (hi + Math.imul(ah4, bh3)) | 0;\n  lo = (lo + Math.imul(al3, bl4)) | 0;\n  mid = (mid + Math.imul(al3, bh4)) | 0;\n  mid = (mid + Math.imul(ah3, bl4)) | 0;\n  hi = (hi + Math.imul(ah3, bh4)) | 0;\n  lo = (lo + Math.imul(al2, bl5)) | 0;\n  mid = (mid + Math.imul(al2, bh5)) | 0;\n  mid = (mid + Math.imul(ah2, bl5)) | 0;\n  hi = (hi + Math.imul(ah2, bh5)) | 0;\n  lo = (lo + Math.imul(al1, bl6)) | 0;\n  mid = (mid + Math.imul(al1, bh6)) | 0;\n  mid = (mid + Math.imul(ah1, bl6)) | 0;\n  hi = (hi + Math.imul(ah1, bh6)) | 0;\n  lo = (lo + Math.imul(al0, bl7)) | 0;\n  mid = (mid + Math.imul(al0, bh7)) | 0;\n  mid = (mid + Math.imul(ah0, bl7)) | 0;\n  hi = (hi + Math.imul(ah0, bh7)) | 0;\n\n  let w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n  w7 &= 0x3ffffff;\n\n  /* k = 8 */\n  lo = Math.imul(al8, bl0);\n  mid = Math.imul(al8, bh0);\n  mid = (mid + Math.imul(ah8, bl0)) | 0;\n  hi = Math.imul(ah8, bh0);\n  lo = (lo + Math.imul(al7, bl1)) | 0;\n  mid = (mid + Math.imul(al7, bh1)) | 0;\n  mid = (mid + Math.imul(ah7, bl1)) | 0;\n  hi = (hi + Math.imul(ah7, bh1)) | 0;\n  lo = (lo + Math.imul(al6, bl2)) | 0;\n  mid = (mid + Math.imul(al6, bh2)) | 0;\n  mid = (mid + Math.imul(ah6, bl2)) | 0;\n  hi = (hi + Math.imul(ah6, bh2)) | 0;\n  lo = (lo + Math.imul(al5, bl3)) | 0;\n  mid = (mid + Math.imul(al5, bh3)) | 0;\n  mid = (mid + Math.imul(ah5, bl3)) | 0;\n  hi = (hi + Math.imul(ah5, bh3)) | 0;\n  lo = (lo + Math.imul(al4, bl4)) | 0;\n  mid = (mid + Math.imul(al4, bh4)) | 0;\n  mid = (mid + Math.imul(ah4, bl4)) | 0;\n  hi = (hi + Math.imul(ah4, bh4)) | 0;\n  lo = (lo + Math.imul(al3, bl5)) | 0;\n  mid = (mid + Math.imul(al3, bh5)) | 0;\n  mid = (mid + Math.imul(ah3, bl5)) | 0;\n  hi = (hi + Math.imul(ah3, bh5)) | 0;\n  lo = (lo + Math.imul(al2, bl6)) | 0;\n  mid = (mid + Math.imul(al2, bh6)) | 0;\n  mid = (mid + Math.imul(ah2, bl6)) | 0;\n  hi = (hi + Math.imul(ah2, bh6)) | 0;\n  lo = (lo + Math.imul(al1, bl7)) | 0;\n  mid = (mid + Math.imul(al1, bh7)) | 0;\n  mid = (mid + Math.imul(ah1, bl7)) | 0;\n  hi = (hi + Math.imul(ah1, bh7)) | 0;\n  lo = (lo + Math.imul(al0, bl8)) | 0;\n  mid = (mid + Math.imul(al0, bh8)) | 0;\n  mid = (mid + Math.imul(ah0, bl8)) | 0;\n  hi = (hi + Math.imul(ah0, bh8)) | 0;\n\n  let w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n  w8 &= 0x3ffffff;\n\n  /* k = 9 */\n  lo = Math.imul(al9, bl0);\n  mid = Math.imul(al9, bh0);\n  mid = (mid + Math.imul(ah9, bl0)) | 0;\n  hi = Math.imul(ah9, bh0);\n  lo = (lo + Math.imul(al8, bl1)) | 0;\n  mid = (mid + Math.imul(al8, bh1)) | 0;\n  mid = (mid + Math.imul(ah8, bl1)) | 0;\n  hi = (hi + Math.imul(ah8, bh1)) | 0;\n  lo = (lo + Math.imul(al7, bl2)) | 0;\n  mid = (mid + Math.imul(al7, bh2)) | 0;\n  mid = (mid + Math.imul(ah7, bl2)) | 0;\n  hi = (hi + Math.imul(ah7, bh2)) | 0;\n  lo = (lo + Math.imul(al6, bl3)) | 0;\n  mid = (mid + Math.imul(al6, bh3)) | 0;\n  mid = (mid + Math.imul(ah6, bl3)) | 0;\n  hi = (hi + Math.imul(ah6, bh3)) | 0;\n  lo = (lo + Math.imul(al5, bl4)) | 0;\n  mid = (mid + Math.imul(al5, bh4)) | 0;\n  mid = (mid + Math.imul(ah5, bl4)) | 0;\n  hi = (hi + Math.imul(ah5, bh4)) | 0;\n  lo = (lo + Math.imul(al4, bl5)) | 0;\n  mid = (mid + Math.imul(al4, bh5)) | 0;\n  mid = (mid + Math.imul(ah4, bl5)) | 0;\n  hi = (hi + Math.imul(ah4, bh5)) | 0;\n  lo = (lo + Math.imul(al3, bl6)) | 0;\n  mid = (mid + Math.imul(al3, bh6)) | 0;\n  mid = (mid + Math.imul(ah3, bl6)) | 0;\n  hi = (hi + Math.imul(ah3, bh6)) | 0;\n  lo = (lo + Math.imul(al2, bl7)) | 0;\n  mid = (mid + Math.imul(al2, bh7)) | 0;\n  mid = (mid + Math.imul(ah2, bl7)) | 0;\n  hi = (hi + Math.imul(ah2, bh7)) | 0;\n  lo = (lo + Math.imul(al1, bl8)) | 0;\n  mid = (mid + Math.imul(al1, bh8)) | 0;\n  mid = (mid + Math.imul(ah1, bl8)) | 0;\n  hi = (hi + Math.imul(ah1, bh8)) | 0;\n  lo = (lo + Math.imul(al0, bl9)) | 0;\n  mid = (mid + Math.imul(al0, bh9)) | 0;\n  mid = (mid + Math.imul(ah0, bl9)) | 0;\n  hi = (hi + Math.imul(ah0, bh9)) | 0;\n\n  let w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n  w9 &= 0x3ffffff;\n\n  /* k = 10 */\n  lo = Math.imul(al9, bl1);\n  mid = Math.imul(al9, bh1);\n  mid = (mid + Math.imul(ah9, bl1)) | 0;\n  hi = Math.imul(ah9, bh1);\n  lo = (lo + Math.imul(al8, bl2)) | 0;\n  mid = (mid + Math.imul(al8, bh2)) | 0;\n  mid = (mid + Math.imul(ah8, bl2)) | 0;\n  hi = (hi + Math.imul(ah8, bh2)) | 0;\n  lo = (lo + Math.imul(al7, bl3)) | 0;\n  mid = (mid + Math.imul(al7, bh3)) | 0;\n  mid = (mid + Math.imul(ah7, bl3)) | 0;\n  hi = (hi + Math.imul(ah7, bh3)) | 0;\n  lo = (lo + Math.imul(al6, bl4)) | 0;\n  mid = (mid + Math.imul(al6, bh4)) | 0;\n  mid = (mid + Math.imul(ah6, bl4)) | 0;\n  hi = (hi + Math.imul(ah6, bh4)) | 0;\n  lo = (lo + Math.imul(al5, bl5)) | 0;\n  mid = (mid + Math.imul(al5, bh5)) | 0;\n  mid = (mid + Math.imul(ah5, bl5)) | 0;\n  hi = (hi + Math.imul(ah5, bh5)) | 0;\n  lo = (lo + Math.imul(al4, bl6)) | 0;\n  mid = (mid + Math.imul(al4, bh6)) | 0;\n  mid = (mid + Math.imul(ah4, bl6)) | 0;\n  hi = (hi + Math.imul(ah4, bh6)) | 0;\n  lo = (lo + Math.imul(al3, bl7)) | 0;\n  mid = (mid + Math.imul(al3, bh7)) | 0;\n  mid = (mid + Math.imul(ah3, bl7)) | 0;\n  hi = (hi + Math.imul(ah3, bh7)) | 0;\n  lo = (lo + Math.imul(al2, bl8)) | 0;\n  mid = (mid + Math.imul(al2, bh8)) | 0;\n  mid = (mid + Math.imul(ah2, bl8)) | 0;\n  hi = (hi + Math.imul(ah2, bh8)) | 0;\n  lo = (lo + Math.imul(al1, bl9)) | 0;\n  mid = (mid + Math.imul(al1, bh9)) | 0;\n  mid = (mid + Math.imul(ah1, bl9)) | 0;\n  hi = (hi + Math.imul(ah1, bh9)) | 0;\n\n  let w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n  w10 &= 0x3ffffff;\n\n  /* k = 11 */\n  lo = Math.imul(al9, bl2);\n  mid = Math.imul(al9, bh2);\n  mid = (mid + Math.imul(ah9, bl2)) | 0;\n  hi = Math.imul(ah9, bh2);\n  lo = (lo + Math.imul(al8, bl3)) | 0;\n  mid = (mid + Math.imul(al8, bh3)) | 0;\n  mid = (mid + Math.imul(ah8, bl3)) | 0;\n  hi = (hi + Math.imul(ah8, bh3)) | 0;\n  lo = (lo + Math.imul(al7, bl4)) | 0;\n  mid = (mid + Math.imul(al7, bh4)) | 0;\n  mid = (mid + Math.imul(ah7, bl4)) | 0;\n  hi = (hi + Math.imul(ah7, bh4)) | 0;\n  lo = (lo + Math.imul(al6, bl5)) | 0;\n  mid = (mid + Math.imul(al6, bh5)) | 0;\n  mid = (mid + Math.imul(ah6, bl5)) | 0;\n  hi = (hi + Math.imul(ah6, bh5)) | 0;\n  lo = (lo + Math.imul(al5, bl6)) | 0;\n  mid = (mid + Math.imul(al5, bh6)) | 0;\n  mid = (mid + Math.imul(ah5, bl6)) | 0;\n  hi = (hi + Math.imul(ah5, bh6)) | 0;\n  lo = (lo + Math.imul(al4, bl7)) | 0;\n  mid = (mid + Math.imul(al4, bh7)) | 0;\n  mid = (mid + Math.imul(ah4, bl7)) | 0;\n  hi = (hi + Math.imul(ah4, bh7)) | 0;\n  lo = (lo + Math.imul(al3, bl8)) | 0;\n  mid = (mid + Math.imul(al3, bh8)) | 0;\n  mid = (mid + Math.imul(ah3, bl8)) | 0;\n  hi = (hi + Math.imul(ah3, bh8)) | 0;\n  lo = (lo + Math.imul(al2, bl9)) | 0;\n  mid = (mid + Math.imul(al2, bh9)) | 0;\n  mid = (mid + Math.imul(ah2, bl9)) | 0;\n  hi = (hi + Math.imul(ah2, bh9)) | 0;\n\n  let w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n  w11 &= 0x3ffffff;\n\n  /* k = 12 */\n  lo = Math.imul(al9, bl3);\n  mid = Math.imul(al9, bh3);\n  mid = (mid + Math.imul(ah9, bl3)) | 0;\n  hi = Math.imul(ah9, bh3);\n  lo = (lo + Math.imul(al8, bl4)) | 0;\n  mid = (mid + Math.imul(al8, bh4)) | 0;\n  mid = (mid + Math.imul(ah8, bl4)) | 0;\n  hi = (hi + Math.imul(ah8, bh4)) | 0;\n  lo = (lo + Math.imul(al7, bl5)) | 0;\n  mid = (mid + Math.imul(al7, bh5)) | 0;\n  mid = (mid + Math.imul(ah7, bl5)) | 0;\n  hi = (hi + Math.imul(ah7, bh5)) | 0;\n  lo = (lo + Math.imul(al6, bl6)) | 0;\n  mid = (mid + Math.imul(al6, bh6)) | 0;\n  mid = (mid + Math.imul(ah6, bl6)) | 0;\n  hi = (hi + Math.imul(ah6, bh6)) | 0;\n  lo = (lo + Math.imul(al5, bl7)) | 0;\n  mid = (mid + Math.imul(al5, bh7)) | 0;\n  mid = (mid + Math.imul(ah5, bl7)) | 0;\n  hi = (hi + Math.imul(ah5, bh7)) | 0;\n  lo = (lo + Math.imul(al4, bl8)) | 0;\n  mid = (mid + Math.imul(al4, bh8)) | 0;\n  mid = (mid + Math.imul(ah4, bl8)) | 0;\n  hi = (hi + Math.imul(ah4, bh8)) | 0;\n  lo = (lo + Math.imul(al3, bl9)) | 0;\n  mid = (mid + Math.imul(al3, bh9)) | 0;\n  mid = (mid + Math.imul(ah3, bl9)) | 0;\n  hi = (hi + Math.imul(ah3, bh9)) | 0;\n\n  let w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n  w12 &= 0x3ffffff;\n\n  /* k = 13 */\n  lo = Math.imul(al9, bl4);\n  mid = Math.imul(al9, bh4);\n  mid = (mid + Math.imul(ah9, bl4)) | 0;\n  hi = Math.imul(ah9, bh4);\n  lo = (lo + Math.imul(al8, bl5)) | 0;\n  mid = (mid + Math.imul(al8, bh5)) | 0;\n  mid = (mid + Math.imul(ah8, bl5)) | 0;\n  hi = (hi + Math.imul(ah8, bh5)) | 0;\n  lo = (lo + Math.imul(al7, bl6)) | 0;\n  mid = (mid + Math.imul(al7, bh6)) | 0;\n  mid = (mid + Math.imul(ah7, bl6)) | 0;\n  hi = (hi + Math.imul(ah7, bh6)) | 0;\n  lo = (lo + Math.imul(al6, bl7)) | 0;\n  mid = (mid + Math.imul(al6, bh7)) | 0;\n  mid = (mid + Math.imul(ah6, bl7)) | 0;\n  hi = (hi + Math.imul(ah6, bh7)) | 0;\n  lo = (lo + Math.imul(al5, bl8)) | 0;\n  mid = (mid + Math.imul(al5, bh8)) | 0;\n  mid = (mid + Math.imul(ah5, bl8)) | 0;\n  hi = (hi + Math.imul(ah5, bh8)) | 0;\n  lo = (lo + Math.imul(al4, bl9)) | 0;\n  mid = (mid + Math.imul(al4, bh9)) | 0;\n  mid = (mid + Math.imul(ah4, bl9)) | 0;\n  hi = (hi + Math.imul(ah4, bh9)) | 0;\n\n  let w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n  w13 &= 0x3ffffff;\n\n  /* k = 14 */\n  lo = Math.imul(al9, bl5);\n  mid = Math.imul(al9, bh5);\n  mid = (mid + Math.imul(ah9, bl5)) | 0;\n  hi = Math.imul(ah9, bh5);\n  lo = (lo + Math.imul(al8, bl6)) | 0;\n  mid = (mid + Math.imul(al8, bh6)) | 0;\n  mid = (mid + Math.imul(ah8, bl6)) | 0;\n  hi = (hi + Math.imul(ah8, bh6)) | 0;\n  lo = (lo + Math.imul(al7, bl7)) | 0;\n  mid = (mid + Math.imul(al7, bh7)) | 0;\n  mid = (mid + Math.imul(ah7, bl7)) | 0;\n  hi = (hi + Math.imul(ah7, bh7)) | 0;\n  lo = (lo + Math.imul(al6, bl8)) | 0;\n  mid = (mid + Math.imul(al6, bh8)) | 0;\n  mid = (mid + Math.imul(ah6, bl8)) | 0;\n  hi = (hi + Math.imul(ah6, bh8)) | 0;\n  lo = (lo + Math.imul(al5, bl9)) | 0;\n  mid = (mid + Math.imul(al5, bh9)) | 0;\n  mid = (mid + Math.imul(ah5, bl9)) | 0;\n  hi = (hi + Math.imul(ah5, bh9)) | 0;\n\n  let w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n  w14 &= 0x3ffffff;\n\n  /* k = 15 */\n  lo = Math.imul(al9, bl6);\n  mid = Math.imul(al9, bh6);\n  mid = (mid + Math.imul(ah9, bl6)) | 0;\n  hi = Math.imul(ah9, bh6);\n  lo = (lo + Math.imul(al8, bl7)) | 0;\n  mid = (mid + Math.imul(al8, bh7)) | 0;\n  mid = (mid + Math.imul(ah8, bl7)) | 0;\n  hi = (hi + Math.imul(ah8, bh7)) | 0;\n  lo = (lo + Math.imul(al7, bl8)) | 0;\n  mid = (mid + Math.imul(al7, bh8)) | 0;\n  mid = (mid + Math.imul(ah7, bl8)) | 0;\n  hi = (hi + Math.imul(ah7, bh8)) | 0;\n  lo = (lo + Math.imul(al6, bl9)) | 0;\n  mid = (mid + Math.imul(al6, bh9)) | 0;\n  mid = (mid + Math.imul(ah6, bl9)) | 0;\n  hi = (hi + Math.imul(ah6, bh9)) | 0;\n\n  let w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n  w15 &= 0x3ffffff;\n\n  /* k = 16 */\n  lo = Math.imul(al9, bl7);\n  mid = Math.imul(al9, bh7);\n  mid = (mid + Math.imul(ah9, bl7)) | 0;\n  hi = Math.imul(ah9, bh7);\n  lo = (lo + Math.imul(al8, bl8)) | 0;\n  mid = (mid + Math.imul(al8, bh8)) | 0;\n  mid = (mid + Math.imul(ah8, bl8)) | 0;\n  hi = (hi + Math.imul(ah8, bh8)) | 0;\n  lo = (lo + Math.imul(al7, bl9)) | 0;\n  mid = (mid + Math.imul(al7, bh9)) | 0;\n  mid = (mid + Math.imul(ah7, bl9)) | 0;\n  hi = (hi + Math.imul(ah7, bh9)) | 0;\n\n  let w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n  w16 &= 0x3ffffff;\n\n  /* k = 17 */\n  lo = Math.imul(al9, bl8);\n  mid = Math.imul(al9, bh8);\n  mid = (mid + Math.imul(ah9, bl8)) | 0;\n  hi = Math.imul(ah9, bh8);\n  lo = (lo + Math.imul(al8, bl9)) | 0;\n  mid = (mid + Math.imul(al8, bh9)) | 0;\n  mid = (mid + Math.imul(ah8, bl9)) | 0;\n  hi = (hi + Math.imul(ah8, bh9)) | 0;\n\n  let w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n  w17 &= 0x3ffffff;\n\n  /* k = 18 */\n  lo = Math.imul(al9, bl9);\n  mid = Math.imul(al9, bh9);\n  mid = (mid + Math.imul(ah9, bl9)) | 0;\n  hi = Math.imul(ah9, bh9);\n\n  let w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n  c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n  w18 &= 0x3ffffff;\n\n  o[0] = w0;\n  o[1] = w1;\n  o[2] = w2;\n  o[3] = w3;\n  o[4] = w4;\n  o[5] = w5;\n  o[6] = w6;\n  o[7] = w7;\n  o[8] = w8;\n  o[9] = w9;\n  o[10] = w10;\n  o[11] = w11;\n  o[12] = w12;\n  o[13] = w13;\n  o[14] = w14;\n  o[15] = w15;\n  o[16] = w16;\n  o[17] = w17;\n  o[18] = w18;\n\n  if (c !== 0) {\n    o[19] = c;\n    out.length += 1;\n  }\n\n  // Note: we shouldn't need to strip here.\n  return out;\n}\n\n// Polyfill comb.\nif (!Math.imul)\n  comb10MulTo = smallMulTo;\n\n/*\n * Expose\n */\n\nBN.Red = Red;\n\nmodule.exports = BN;\n","/*!\n * custom.js - custom inspect symbol for bcrypto\n * Copyright (c) 2018-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n */\n\n'use strict';\n\nexports.custom = 'inspect';\n","/*!\n * elliptic.js - elliptic curves for bcrypto\n * Copyright (c) 2018-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n *\n * Parts of this software are based on indutny/elliptic:\n *   Copyright (c) 2014, Fedor Indutny (MIT License).\n *   https://github.com/indutny/elliptic\n *\n * Formulas from DJB and Tanja Lange [EFD].\n *\n * References:\n *\n *   [GECC] Guide to Elliptic Curve Cryptography\n *     D. Hankerson, A. Menezes, and S. Vanstone\n *     https://tinyurl.com/guide-to-ecc\n *\n *   [GLV] Faster Point Multiplication on Elliptic Curves\n *     R. Gallant, R. Lambert, and S. Vanstone\n *     https://link.springer.com/content/pdf/10.1007/3-540-44647-8_11.pdf\n *\n *   [MONT1] Montgomery curves and the Montgomery ladder\n *     Daniel J. Bernstein, Tanja Lange\n *     https://eprint.iacr.org/2017/293.pdf\n *\n *   [SQUARED] Elligator Squared\n *     Mehdi Tibouchi\n *     https://eprint.iacr.org/2014/043.pdf\n *\n *   [SEC1] SEC 1 - Standards for Efficient Cryptography Group\n *     Certicom Research\n *     https://www.secg.org/sec1-v2.pdf\n *\n *   [SEC2] SEC 2: Recommended Elliptic Curve Domain Parameters\n *     Certicom Research\n *     https://www.secg.org/sec2-v2.pdf\n *\n *   [SIDE1] Elliptic Curves and Side-Channel Attacks\n *     Marc Joye\n *     https://pdfs.semanticscholar.org/8d69/9645033e25d74fcfd4cbf07a770d2e943e14.pdf\n *\n *   [BLIND] Side-Channel Analysis on Blinding Regular Scalar Multiplications\n *     B. Feix, M. Roussellet, A. Venelli\n *     https://eprint.iacr.org/2014/191.pdf\n *\n *   [ALT] Alternative Elliptic Curve Representations\n *     R. Struik\n *     https://tools.ietf.org/id/draft-ietf-lwig-curve-representations-02.html\n *\n *   [ARITH1] Arithmetic of Elliptic Curves\n *     Christophe Doche, Tanja Lange\n *     Handbook of Elliptic and Hyperelliptic Curve Cryptography\n *     Page 267, Section 13 (978-1-58488-518-4)\n *     https://hyperelliptic.org/HEHCC/index.html\n *\n *   [ARITH2] The Arithmetic of Elliptic Curves, 2nd Edition\n *     Joseph H. Silverman\n *     http://www.pdmi.ras.ru/~lowdimma/BSD/Silverman-Arithmetic_of_EC.pdf\n *\n *   [EFD] Explicit-Formulas Database\n *     Daniel J. Bernstein, Tanja Lange\n *     https://hyperelliptic.org/EFD/index.html\n *\n *   [SAFE] SafeCurves: choosing safe curves for elliptic-curve cryptography\n *     Daniel J. Bernstein\n *     https://safecurves.cr.yp.to/\n *\n *   [4GLV] Refinement of the Four-Dimensional GLV Method on Elliptic Curves\n *     Hairong Yi, Yuqing Zhu, and Dongdai Lin\n *     http://www.site.uottawa.ca/~cadams/papers/prepro/paper_19_slides.pdf\n *\n *   [SSWU1] Efficient Indifferentiable Hashing into Ordinary Elliptic Curves\n *     E. Brier, J. Coron, T. Icart, D. Madore, H. Randriam, M. Tibouchi\n *     https://eprint.iacr.org/2009/340.pdf\n *\n *   [SSWU2] Rational points on certain hyperelliptic curves over finite fields\n *     Maciej Ulas\n *     https://arxiv.org/abs/0706.1448\n *\n *   [H2EC] Hashing to Elliptic Curves\n *     A. Faz-Hernandez, S. Scott, N. Sullivan, R. S. Wahby, C. A. Wood\n *     https://git.io/JeWz6\n *     https://github.com/cfrg/draft-irtf-cfrg-hash-to-curve\n *\n *   [SVDW1] Construction of Rational Points on Elliptic Curves\n *     A. Shallue, C. E. van de Woestijne\n *     https://works.bepress.com/andrew_shallue/1/download/\n *\n *   [SVDW2] Indifferentiable Hashing to Barreto-Naehrig Curves\n *     Pierre-Alain Fouque, Mehdi Tibouchi\n *     https://www.di.ens.fr/~fouque/pub/latincrypt12.pdf\n *\n *   [SVDW3] Covert ECDH over secp256k1\n *     Pieter Wuille\n *     https://gist.github.com/sipa/29118d3fcfac69f9930d57433316c039\n *\n *   [MONT2] Montgomery Curve (wikipedia)\n *     https://en.wikipedia.org/wiki/Montgomery_curve\n *\n *   [MONT3] Montgomery Curves and their arithmetic\n *     C. Costello, B. Smith\n *     https://eprint.iacr.org/2017/212.pdf\n *\n *   [ELL2] Elliptic-curve points indistinguishable from uniform random strings\n *     D. Bernstein, M. Hamburg, A. Krasnova, T. Lange\n *     https://elligator.cr.yp.to/elligator-20130828.pdf\n *\n *   [RFC7748] Elliptic Curves for Security\n *     A. Langley, M. Hamburg, S. Turner\n *     https://tools.ietf.org/html/rfc7748\n *\n *   [TWISTED] Twisted Edwards Curves\n *     D. Bernstein, P. Birkner, M. Joye, T. Lange, C. Peters\n *     https://eprint.iacr.org/2008/013.pdf\n *\n *   [ELL1] Injective Encodings to Elliptic Curves\n *     P. Fouque, A. Joux, M. Tibouchi\n *     https://eprint.iacr.org/2013/373.pdf\n *\n *   [ISOGENY] Twisting Edwards curves with isogenies\n *     Mike Hamburg\n *     https://www.shiftleft.org/papers/isogeny/isogeny.pdf\n *\n *   [RFC8032] Edwards-Curve Digital Signature Algorithm (EdDSA)\n *     S. Josefsson, SJD AB, I. Liusvaara\n *     https://tools.ietf.org/html/rfc8032\n *\n *   [SCHNORR] Schnorr Signatures for secp256k1\n *     Pieter Wuille\n *     https://github.com/sipa/bips/blob/d194620/bip-schnorr.mediawiki\n *\n *   [BIP340] Schnorr Signatures for secp256k1\n *     Pieter Wuille, Jonas Nick, Tim Ruffing\n *     https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\n *\n *   [JCEN12] Efficient Software Implementation of Public-Key Cryptography\n *            on Sensor Networks Using the MSP430X Microcontroller\n *     C. P. L. Gouvea, L. B. Oliveira, J. Lopez\n *     http://conradoplg.cryptoland.net/files/2010/12/jcen12.pdf\n *\n *   [FIPS186] Federal Information Processing Standards Publication\n *     National Institute of Standards and Technology\n *     https://tinyurl.com/fips-186-3\n *\n *   [RFC5639] Elliptic Curve Cryptography (ECC) Brainpool\n *             Standard Curves and Curve Generation\n *     M. Lochter, BSI, J. Merkle\n *     https://tools.ietf.org/html/rfc5639\n *\n *   [TWISTEQ] Twisted Edwards & Short Weierstrass Equivalence\n *     Christopher Jeffrey\n *     https://gist.github.com/chjj/16ba7fa08d64e8dda269a9fe5b2a8bbc\n *\n *   [ECPM] Elliptic Curve Point Multiplication (wikipedia)\n *     https://en.wikipedia.org/wiki/Elliptic_curve_point_multiplication\n */\n\n'use strict';\n\nconst {custom} = require('../internal/custom');\nconst BN = require('../bn');\n\n/*\n * Constants\n */\n\nconst types = {\n  AFFINE: 0,\n  JACOBIAN: 1,\n  PROJECTIVE: 2,\n  EXTENDED: 3\n};\n\nconst jsfIndex = [\n  -3, // -1 -1\n  -1, // -1 0\n  -5, // -1 1\n  -7, // 0 -1\n  0, // 0 0\n  7, // 0 1\n  5, // 1 -1\n  1, // 1 0\n  3  // 1 1\n];\n\nconst USE_FIXED = false;\n\nlet uid = 0;\n\n/**\n * Curve\n */\n\nclass Curve {\n  constructor(Point, type, conf) {\n    this.Point = null;\n    this.id = null;\n    this.uid = uid++;\n    this.ossl = null;\n    this.type = 'base';\n    this.endian = 'be';\n    this.hash = null;\n    this.prefix = null;\n    this.context = false;\n    this.prime = null;\n    this.p = null;\n    this.red = null;\n    this.fieldSize = 0;\n    this.fieldBits = 0;\n    this.adjustedSize = 0;\n    this.signBit = 0;\n    this.mask = 0;\n    this.n = null;\n    this.h = null;\n    this.q = null;\n    this.z = null;\n    this.g = null;\n    this.nh = null;\n    this.scalarSize = 0;\n    this.scalarBits = 0;\n    this.zero = null;\n    this.one = null;\n    this.two = null;\n    this.three = null;\n    this.four = null;\n    this.i2 = null;\n    this.i3 = null;\n    this.i4 = null;\n    this.i6 = null;\n    this.torsion = null;\n    this.endo = null;\n    this.hi = null;\n    this._init(Point, type, conf);\n  }\n\n  _init(Point, type, conf) {\n    assert(typeof Point === 'function');\n    assert(typeof type === 'string');\n    assert(conf && typeof conf === 'object');\n    assert(conf.red == null || (conf.red instanceof BN.Red));\n    assert(conf.p != null, 'Must pass a prime.');\n    assert(conf.id == null || typeof conf.id === 'string');\n    assert(conf.ossl == null || typeof conf.ossl === 'string');\n    assert(conf.endian == null || typeof conf.endian === 'string');\n    assert(conf.hash == null || typeof conf.hash === 'string');\n    assert(conf.prefix == null || typeof conf.prefix === 'string');\n    assert(conf.context == null || typeof conf.context === 'boolean');\n    assert(conf.prime == null || typeof conf.prime === 'string');\n    assert(conf.torsion == null || Array.isArray(conf.torsion));\n\n    // Point class.\n    this.Point = Point;\n\n    // Meta.\n    this.id = conf.id || null;\n    this.ossl = conf.ossl || null;\n    this.type = type;\n    this.endian = conf.endian || (type === 'short' ? 'be' : 'le');\n    this.hash = conf.hash || null;\n    this.prefix = conf.prefix ? Buffer.from(conf.prefix, 'binary') : null;\n    this.context = conf.context || false;\n    this.prime = conf.prime || null;\n\n    // Prime.\n    this.p = BN.fromJSON(conf.p);\n\n    // Reduction.\n    if (conf.red) {\n      this.red = conf.red;\n    } else {\n      // Use Montgomery when there is no fast reduction for the prime.\n      this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p);\n      this.red.precompute();\n    }\n\n    // Precalculate encoding length.\n    this.fieldSize = this.p.byteLength();\n    this.fieldBits = this.p.bitLength();\n    this.adjustedSize = this.fieldSize + ((this.fieldBits & 7) === 0);\n    this.signBit = this.adjustedSize * 8 - 1;\n    this.mask = 0xff;\n\n    if ((this.fieldBits & 7) !== 0)\n      this.mask = (1 << (this.fieldBits & 7)) - 1;\n\n    // Curve configuration, optional.\n    this.n = BN.fromJSON(conf.n || '0');\n    this.h = BN.fromJSON(conf.h || '1');\n    this.q = this.n.mul(this.h);\n    this.z = BN.fromJSON(conf.z || '0').toRed(this.red);\n    this.g = null;\n    this.nh = this.n.ushrn(1);\n    this.scalarSize = this.n.byteLength();\n    this.scalarBits = this.n.bitLength();\n\n    // Useful for many curves.\n    this.zero = new BN(0).toRed(this.red);\n    this.one = new BN(1).toRed(this.red);\n    this.two = new BN(2).toRed(this.red);\n    this.three = new BN(3).toRed(this.red);\n    this.four = new BN(4).toRed(this.red);\n\n    // Inverses.\n    this.i2 = this.two.redInvert();\n    this.i3 = this.three.redInvert();\n    this.i4 = this.i2.redSqr();\n    this.i6 = this.i2.redMul(this.i3);\n\n    // Torsion.\n    this.torsion = new Array(this.h.word(0));\n\n    for (let i = 0; i < this.torsion.length; i++)\n      this.torsion[i] = this.point();\n\n    // Endomorphism.\n    this.endo = null;\n\n    // Cache.\n    this.hi = null;\n\n    // Memoize.\n    this._scale = memoize(this._scale, this);\n    this.isIsomorphic = memoize(this.isIsomorphic, this);\n    this.isIsogenous = memoize(this.isIsogenous, this);\n\n    // Sanity checks.\n    assert(this.p.sign() > 0 && this.p.isOdd());\n    assert(this.n.sign() >= 0);\n    assert(this.h.sign() > 0 && this.h.cmpn(255) <= 0);\n    assert(this.endian === 'be' || this.endian === 'le');\n\n    return this;\n  }\n\n  _finalize(conf) {\n    assert(conf && typeof conf === 'object');\n\n    // Create base point.\n    this.g = conf.g ? this.pointFromJSON(conf.g) : this.point();\n\n    // Parse small order points.\n    if (conf.torsion) {\n      assert(conf.torsion.length === this.torsion.length);\n\n      for (let i = 0; i < this.torsion.length; i++)\n        this.torsion[i] = this.pointFromJSON(conf.torsion[i]);\n    }\n\n    return this;\n  }\n\n  _findTorsion() {\n    // Find all torsion points by grinding.\n    assert(!this.n.isZero());\n\n    const h = this.h.word(0);\n    const x = this.one.redNeg();\n    const out = [this.point()];\n    const set = new Set();\n\n    let len = h;\n\n    while (out.length < len) {\n      let p;\n\n      x.redIAdd(this.one);\n\n      try {\n        p = this.pointFromX(x.clone());\n      } catch (e) {\n        continue;\n      }\n\n      try {\n        p = p.mul(this.n);\n      } catch (e) {\n        len = 2;\n        continue;\n      }\n\n      if (p.isInfinity())\n        continue;\n\n      p.normalize();\n\n      for (const point of [p, p.neg()]) {\n        const key = point.key();\n\n        if (!set.has(key)) {\n          out.push(point);\n          set.add(key);\n        }\n      }\n    }\n\n    out.sort((a, b) => a.cmp(b));\n\n    while (out.length < h)\n      out.push(this.point());\n\n    return out;\n  }\n\n  _fixedMul(p, k) {\n    // Fixed-base method for point multiplication.\n    //\n    // [ECPM] \"Windowed method\".\n    // [GECC] Page 95, Section 3.3.\n    //\n    // Windows are appropriately shifted to avoid any\n    // doublings. This reduces a 256 bit multiplication\n    // down to 64 additions with a window size of 4.\n    assert(p instanceof Point);\n    assert(k instanceof BN);\n    assert(p.pre && p.pre.windows);\n\n    // Get precomputed windows.\n    const {width, points} = p._getWindows(0, 0);\n\n    // Recompute window size.\n    const size = 1 << width;\n\n    // Recompute steps.\n    const bits = k.bitLength();\n    const steps = ((bits + width - 1) / width) >>> 0;\n\n    // Multiply.\n    let acc = this.jpoint();\n\n    for (let i = 0; i < steps; i++) {\n      const bits = k.bits(i * width, width);\n\n      acc = acc.add(points[i * size + bits]);\n    }\n\n    // Adjust sign.\n    if (k.isNeg())\n      acc = acc.neg();\n\n    return acc;\n  }\n\n  _fixedNafMul(p, k) {\n    // Fixed-base NAF windowing method for point multiplication.\n    //\n    // [GECC] Algorithm 3.42, Page 105, Section 3.3.\n    assert(p instanceof Point);\n    assert(k instanceof BN);\n    assert(p.pre && p.pre.doubles);\n\n    // Get precomputed doubles.\n    const {step, points} = p._getDoubles(0, 0);\n\n    // Get fixed NAF (in a more windowed form).\n    const naf = getFixedNAF(k, 2, k.bitLength() + 1, step);\n\n    // Compute steps.\n    const I = ((1 << (step + 1)) - (step % 2 === 0 ? 2 : 1)) / 3;\n\n    // Multiply.\n    let a = this.jpoint();\n    let b = this.jpoint();\n\n    for (let i = I; i > 0; i--) {\n      for (let j = 0; j < naf.length; j++) {\n        const nafW = naf[j];\n\n        if (nafW === i)\n          b = b.add(points[j]);\n        else if (nafW === -i)\n          b = b.sub(points[j]);\n      }\n\n      a = a.add(b);\n    }\n\n    return a;\n  }\n\n  _wnafMul(w, p, k) {\n    // Window NAF method for point multiplication.\n    //\n    // [GECC] Algorithm 3.36, Page 100, Section 3.3.\n    assert(p instanceof Point);\n    assert(k instanceof BN);\n\n    // Precompute window.\n    const {width, points} = p._safeNAF(w);\n\n    // Get NAF form.\n    const naf = getNAF(k, width, k.bitLength() + 1);\n\n    // Add `this`*(N+1) for every w-NAF index.\n    let acc = this.jpoint();\n\n    for (let i = naf.length - 1; i >= 0; i--) {\n      const z = naf[i];\n\n      if (i !== naf.length - 1)\n        acc = acc.dbl();\n\n      if (z > 0)\n        acc = acc.add(points[(z - 1) >> 1]);\n      else if (z < 0)\n        acc = acc.sub(points[(-z - 1) >> 1]);\n    }\n\n    return acc;\n  }\n\n  _wnafMulAdd(w, points, coeffs) {\n    // Multiple point multiplication, also known\n    // as \"Shamir's trick\" (with interleaved NAFs).\n    //\n    // [GECC] Algorithm 3.48, Page 109, Section 3.3.3.\n    //        Algorithm 3.51, Page 112, Section 3.3.\n    //\n    // This is particularly useful for signature\n    // verifications and mutiplications after an\n    // endomorphism split.\n    assert((w >>> 0) === w);\n    assert(Array.isArray(points));\n    assert(Array.isArray(coeffs));\n    assert(points.length === coeffs.length);\n\n    const length = points.length;\n    const wnd = new Array(length);\n    const naf = new Array(length);\n\n    // Check arrays and calculate size.\n    let max = 0;\n\n    for (let i = 0; i < length; i++) {\n      const point = points[i];\n      const coeff = coeffs[i];\n\n      assert(point instanceof Point);\n      assert(coeff instanceof BN);\n\n      if (i > 0 && point.type !== points[i - 1].type)\n        throw new Error('Cannot mix points.');\n\n      // Avoid sparse arrays.\n      wnd[i] = null;\n      naf[i] = null;\n\n      // Compute max scalar size.\n      max = Math.max(max, coeff.bitLength() + 1);\n    }\n\n    // Compute NAFs.\n    let ppoint = null;\n    let pcoeff = null;\n    let len = 0;\n\n    for (let i = 0; i < length; i++) {\n      const point = points[i];\n      const coeff = coeffs[i];\n      const pre = point._getNAF(0);\n\n      // Use precomputation if available.\n      if (pre) {\n        wnd[len] = pre.points;\n        naf[len] = getNAF(coeff, pre.width, max);\n        len += 1;\n        continue;\n      }\n\n      // Save last non-precomputed point.\n      if (!ppoint) {\n        ppoint = point;\n        pcoeff = coeff;\n        continue;\n      }\n\n      // Compute JSF in NAF form.\n      wnd[len] = ppoint._getJNAF(point);\n      naf[len] = getJNAF(pcoeff, coeff, max);\n\n      ppoint = null;\n      pcoeff = null;\n\n      len += 1;\n    }\n\n    // Regular NAF for odd points.\n    if (ppoint) {\n      const nafw = ppoint._safeNAF(w);\n\n      wnd[len] = nafw.points;\n      naf[len] = getNAF(pcoeff, nafw.width, max);\n\n      len += 1;\n    }\n\n    // Multiply and add.\n    let acc = this.jpoint();\n\n    for (let i = max - 1; i >= 0; i--) {\n      if (i !== max - 1)\n        acc = acc.dbl();\n\n      for (let j = 0; j < len; j++) {\n        const z = naf[j][i];\n\n        if (z > 0)\n          acc = acc.add(wnd[j][(z - 1) >> 1]);\n        else if (z < 0)\n          acc = acc.sub(wnd[j][(-z - 1) >> 1]);\n      }\n    }\n\n    return acc;\n  }\n\n  _endoWnafMulAdd(points, coeffs) {\n    throw new Error('Not implemented.');\n  }\n\n  _scale(curve, invert) {\n    assert(curve instanceof Curve);\n    assert(curve.p.eq(this.p));\n\n    switch (curve.type) {\n      case 'short':\n        return this._scaleShort(curve, invert);\n      case 'mont':\n        return this._scaleMont(curve, invert);\n      case 'edwards':\n        return this._scaleEdwards(curve, invert);\n      default:\n        throw new Error('Not implemented.');\n    }\n  }\n\n  _scaleShort(curve, invert) {\n    throw new Error('Not implemented.');\n  }\n\n  _scaleMont(curve, invert) {\n    throw new Error('Not implemented.');\n  }\n\n  _scaleEdwards(curve, invert) {\n    throw new Error('Not implemented.');\n  }\n\n  isElliptic() {\n    throw new Error('Not implemented.');\n  }\n\n  jinv() {\n    throw new Error('Not implemented.');\n  }\n\n  isComplete() {\n    return false;\n  }\n\n  precompute(rng) {\n    assert(!this.g.isInfinity(), 'Must have base point.');\n    assert(!this.n.isZero(), 'Must have order.');\n\n    this.g.precompute(this.n.bitLength(), rng);\n\n    return this;\n  }\n\n  scalar(num, base, endian) {\n    const k = new BN(num, base, endian);\n\n    assert(!k.red);\n\n    if (this.n.isZero())\n      return k;\n\n    return k.imod(this.n);\n  }\n\n  field(num, base, endian) {\n    const x = BN.cast(num, base, endian);\n\n    if (x.red)\n      return x.forceRed(this.red);\n\n    return x.toRed(this.red);\n  }\n\n  point(x, y) {\n    throw new Error('Not implemented.');\n  }\n\n  jpoint(x, y, z) {\n    throw new Error('Not implemented.');\n  }\n\n  xpoint(x, z) {\n    throw new Error('Not implemented.');\n  }\n\n  cpoint(xx, xz, yy, yz) {\n    assert(xx instanceof BN);\n    assert(xz instanceof BN);\n    assert(yy instanceof BN);\n    assert(yz instanceof BN);\n\n    if (xz.isZero() || yz.isZero())\n      return this.point();\n\n    const z = xz.redMul(yz).redInvert();\n    const x = xx.redMul(yz).redMul(z);\n    const y = yy.redMul(xz).redMul(z);\n\n    return this.point(x, y);\n  }\n\n  solveX2(y) {\n    throw new Error('Not implemented.');\n  }\n\n  solveX(y) {\n    return this.solveX2(y).redSqrt();\n  }\n\n  solveY2(x) {\n    throw new Error('Not implemented.');\n  }\n\n  solveY(x) {\n    return this.solveY2(x).redSqrt();\n  }\n\n  validate(point) {\n    throw new Error('Not implemented.');\n  }\n\n  pointFromX(x, sign) {\n    throw new Error('Not implemented.');\n  }\n\n  pointFromY(y, sign) {\n    throw new Error('Not implemented.');\n  }\n\n  isIsomorphic(curve) {\n    throw new Error('Not implemented.');\n  }\n\n  isIsogenous(curve) {\n    throw new Error('Not implemented.');\n  }\n\n  pointFromShort(point) {\n    throw new Error('Not implemented.');\n  }\n\n  pointFromMont(point, sign) {\n    throw new Error('Not implemented.');\n  }\n\n  pointFromEdwards(point) {\n    throw new Error('Not implemented.');\n  }\n\n  pointFromUniform(u) {\n    throw new Error('Not implemented.');\n  }\n\n  pointToUniform(p) {\n    throw new Error('Not implemented.');\n  }\n\n  pointFromHash(bytes, pake = false) {\n    // [H2EC] \"Roadmap\".\n    assert(Buffer.isBuffer(bytes));\n    assert(typeof pake === 'boolean');\n\n    if (bytes.length !== this.fieldSize * 2)\n      throw new Error('Invalid hash size.');\n\n    // Random oracle encoding.\n    // Ensure a proper distribution.\n    const s1 = bytes.slice(0, this.fieldSize);\n    const s2 = bytes.slice(this.fieldSize);\n    const u1 = this.decodeUniform(s1);\n    const u2 = this.decodeUniform(s2);\n    const p1 = this.pointFromUniform(u1);\n    const p2 = this.pointFromUniform(u2);\n    const p3 = p1.add(p2);\n\n    return pake ? p3.mulH() : p3;\n  }\n\n  pointToHash(p, subgroup, rng) {\n    // [SQUARED] Algorithm 1, Page 8, Section 3.3.\n    assert(p instanceof this.Point);\n    assert((subgroup >>> 0) === subgroup);\n\n    // Add a random torsion component.\n    const i = subgroup % this.torsion.length;\n    const p0 = p.add(this.torsion[i]);\n\n    // Average Cost (R = sqrt):\n    //\n    //   SSWU (~4 iterations) => 8I + 16R\n    //   SVDW (~4 iterations) => 12I + 28R\n    //   Elligator 1 (~2 iterations) => 6I + 10R\n    //   Elligator 2 (~2 iterations) => 4I + 6R\n    //   Ristretto (~1 iteration) => 1I + 2R + h*1R\n    for (;;) {\n      const u1 = this.randomField(rng);\n      const p1 = this.pointFromUniform(u1);\n\n      // Avoid 2-torsion points:\n      //   Short Weierstrass: ((A / 3) / B, 0)\n      //   Montgomery: (0, 0)\n      //   Twisted Edwards: (0, -1)\n      if (p1.neg().eq(p1))\n        continue;\n\n      const p2 = p0.sub(p1);\n      const hint = randomInt(rng);\n\n      let u2;\n      try {\n        u2 = this.pointToUniform(p2, hint & 15);\n      } catch (e) {\n        if (e.message === 'Invalid point.')\n          continue;\n        throw e;\n      }\n\n      const s1 = this.encodeUniform(u1, hint >>> 8);\n      const s2 = this.encodeUniform(u2, hint >>> 16);\n\n      return Buffer.concat([s1, s2]);\n    }\n  }\n\n  randomScalar(rng) {\n    const max = this.n.isZero() ? this.p : this.n;\n    return BN.random(rng, 1, max);\n  }\n\n  randomField(rng) {\n    return BN.random(rng, 1, this.p).toRed(this.red);\n  }\n\n  randomPoint(rng) {\n    let p;\n\n    for (;;) {\n      const x = this.randomField(rng);\n      const sign = (randomInt(rng) & 1) !== 0;\n\n      try {\n        p = this.pointFromX(x, sign);\n      } catch (e) {\n        continue;\n      }\n\n      assert(p.validate());\n\n      return p.mulH();\n    }\n  }\n\n  mulAll(points, coeffs) {\n    return this.jmulAll(points, coeffs);\n  }\n\n  jmulAll(points, coeffs) {\n    assert(Array.isArray(points));\n    assert(points.length === 0 || (points[0] instanceof Point));\n\n    // Multiply with endomorphism if we're using affine points.\n    if (this.endo && points.length > 0 && points[0].type === types.AFFINE)\n      return this._endoWnafMulAdd(points, coeffs);\n\n    // Otherwise, a regular Shamir's trick.\n    return this._wnafMulAdd(5, points, coeffs);\n  }\n\n  mulH(k) {\n    assert(k instanceof BN);\n    return this.imulH(k.clone());\n  }\n\n  imulH(k) {\n    assert(k instanceof BN);\n    assert(!k.red);\n\n    const word = this.h.word(0);\n\n    // Optimize for powers of two.\n    if ((word & (word - 1)) === 0) {\n      const bits = this.h.bitLength();\n      return k.iushln(bits - 1).imod(this.n);\n    }\n\n    return k.imuln(word).imod(this.n);\n  }\n\n  normalizeAll(points) {\n    assert(Array.isArray(points));\n\n    const len = points.length;\n    const z = new Array(len);\n\n    for (let i = 0; i < len; i++) {\n      const p = points[i];\n\n      assert(p instanceof Point);\n      assert(p.curve === this);\n\n      if (p.type === types.AFFINE) {\n        z[i] = this.one;\n        continue;\n      }\n\n      z[i] = p.z;\n    }\n\n    const zi = this.red.invertAll(z);\n    const out = new Array(len);\n\n    for (let i = 0; i < len; i++)\n      out[i] = points[i].scale(zi[i]);\n\n    return out;\n  }\n\n  affinizeAll(points) {\n    return this.normalizeAll(points);\n  }\n\n  clamp(scalar) {\n    // [RFC7748] Page 8, Section 5.\n    // [RFC8032] Section 5.1.5 & 5.2.5.\n    assert(Buffer.isBuffer(scalar));\n    assert(scalar.length === this.scalarSize);\n    assert(this.scalarSize <= this.fieldSize);\n\n    let top = (this.fieldBits & 7) || 8;\n    let lsb = 0;\n    let msb = this.scalarSize - 1;\n\n    // Swap endianness.\n    if (this.endian === 'be')\n      [lsb, msb] = [msb, lsb];\n\n    // Adjust for low order.\n    if (this.scalarSize < this.fieldSize)\n      top = 8;\n\n    // Ensure a multiple of the cofactor.\n    scalar[lsb] &= -this.h.word(0) & 0xff;\n\n    // Clamp to the prime.\n    scalar[msb] &= (1 << top) - 1;\n\n    // Set the high bit.\n    scalar[msb] |= 1 << (top - 1);\n\n    return scalar;\n  }\n\n  splitHash(bytes) {\n    // [RFC8032] Section 5.1.6 & 5.2.6.\n    assert(Buffer.isBuffer(bytes));\n    assert(bytes.length === this.adjustedSize * 2);\n    assert(this.scalarSize <= this.adjustedSize);\n\n    let off = 0;\n\n    if (this.endian === 'be')\n      off = this.adjustedSize - this.scalarSize;\n\n    const scalar = bytes.slice(off, off + this.scalarSize);\n    const prefix = bytes.slice(this.adjustedSize);\n\n    this.clamp(scalar);\n\n    return [scalar, prefix];\n  }\n\n  encodeField(x) {\n    // [SEC1] Page 12, Section 2.3.5.\n    assert(x instanceof BN);\n    assert(!x.red);\n\n    return x.encode(this.endian, this.fieldSize);\n  }\n\n  decodeField(bytes) {\n    // [SEC1] Page 13, Section 2.3.6.\n    assert(Buffer.isBuffer(bytes));\n\n    if (bytes.length !== this.fieldSize)\n      throw new Error('Invalid field element size.');\n\n    return BN.decode(bytes, this.endian);\n  }\n\n  encodeAdjusted(x) {\n    assert(x instanceof BN);\n    assert(!x.red);\n\n    return x.encode(this.endian, this.adjustedSize);\n  }\n\n  decodeAdjusted(bytes) {\n    assert(Buffer.isBuffer(bytes));\n\n    if (bytes.length !== this.adjustedSize)\n      throw new Error('Invalid field element size.');\n\n    return BN.decode(bytes, this.endian);\n  }\n\n  encodeScalar(k) {\n    // [SEC1] Page 13, Section 2.3.7.\n    assert(k instanceof BN);\n    assert(!k.red);\n\n    return k.encode(this.endian, this.scalarSize);\n  }\n\n  decodeScalar(bytes) {\n    // [SEC1] Page 14, Section 2.3.8.\n    assert(Buffer.isBuffer(bytes));\n\n    if (bytes.length !== this.scalarSize)\n      throw new Error('Invalid scalar size.');\n\n    return BN.decode(bytes, this.endian);\n  }\n\n  encodeClamped(k) {\n    // [RFC7748] Page 8, Section 5.\n    // [RFC8032] Section 5.1.5 & 5.2.5.\n    return this.clamp(this.encodeScalar(k));\n  }\n\n  decodeClamped(bytes) {\n    // [RFC7748] Page 8, Section 5.\n    // [RFC8032] Section 5.1.5 & 5.2.5.\n    assert(Buffer.isBuffer(bytes));\n\n    if (bytes.length !== this.scalarSize)\n      throw new Error('Invalid scalar size.');\n\n    const clamped = this.clamp(Buffer.from(bytes));\n\n    return BN.decode(clamped, this.endian);\n  }\n\n  encodeUniform(x, bits) {\n    assert(x instanceof BN);\n    assert((bits >>> 0) === bits);\n\n    const msb = this.endian === 'le' ? this.fieldSize - 1 : 0;\n    const bytes = x.fromRed().encode(this.endian, this.fieldSize);\n\n    bytes[msb] |= (bits & ~this.mask) & 0xff;\n\n    return bytes;\n  }\n\n  decodeUniform(bytes) {\n    assert(Buffer.isBuffer(bytes));\n\n    if (bytes.length !== this.fieldSize)\n      throw new Error('Invalid field size.');\n\n    const x = BN.decode(bytes, this.endian);\n\n    x.iumaskn(this.fieldBits);\n\n    return x.toRed(this.red);\n  }\n\n  encodePoint(point, compact) {\n    assert(point instanceof Point);\n    return point.encode(compact);\n  }\n\n  decodePoint(bytes) {\n    throw new Error('Not implemented.');\n  }\n\n  encodeX(point) {\n    throw new Error('Not implemented.');\n  }\n\n  decodeX(bytes) {\n    throw new Error('Not implemented.');\n  }\n\n  decodeEven(bytes) {\n    throw new Error('Not implemented.');\n  }\n\n  decodeSquare(bytes) {\n    throw new Error('Not implemented.');\n  }\n\n  toShort() {\n    throw new Error('Not implemented.');\n  }\n\n  toMont(b0) {\n    throw new Error('Not implemented.');\n  }\n\n  toEdwards(a0) {\n    throw new Error('Not implemented.');\n  }\n\n  pointToJSON(point, pre) {\n    assert(point instanceof Point);\n    return point.toJSON(pre);\n  }\n\n  pointFromJSON(json) {\n    throw new Error('Not implemented.');\n  }\n\n  toJSON(pre) {\n    let prefix, context;\n    let n, z, endo;\n\n    if (this.type === 'edwards') {\n      prefix = this.prefix ? this.prefix.toString() : null;\n      context = this.context;\n    }\n\n    if (!this.n.isZero())\n      n = this.n.toJSON();\n\n    if (!this.z.isZero()) {\n      z = this.z.fromRed();\n\n      if (this.z.redIsHigh())\n        z.isub(this.p);\n\n      z = z.toString(16);\n    }\n\n    if (this.endo)\n      endo = this.endo.toJSON();\n\n    return {\n      id: this.id,\n      ossl: this.ossl,\n      type: this.type,\n      endian: this.endian,\n      hash: this.hash,\n      prefix,\n      context,\n      prime: this.prime,\n      p: this.p.toJSON(),\n      a: undefined,\n      b: undefined,\n      d: undefined,\n      n,\n      h: this.h.toString(16),\n      s: undefined,\n      z,\n      c: undefined,\n      g: this.g.toJSON(pre),\n      endo\n    };\n  }\n\n  static fromJSON(json) {\n    return new this(json);\n  }\n}\n\n/**\n * Point\n */\n\nclass Point {\n  constructor(curve, type) {\n    assert(curve instanceof Curve);\n    assert((type >>> 0) === type);\n\n    this.curve = curve;\n    this.type = type;\n    this.pre = null;\n  }\n\n  _init() {\n    throw new Error('Not implemented.');\n  }\n\n  _safeNAF(width) {\n    assert((width >>> 0) === width);\n\n    if (this.pre && this.pre.naf)\n      return this.pre.naf;\n\n    if (width === 0)\n      return null;\n\n    const size = 1 << (width - 2);\n    const points = new Array(size);\n    const p = this.toJ();\n    const dbl = size === 1 ? null : p.dbl();\n\n    points[0] = p;\n\n    for (let i = 1; i < size; i++)\n      points[i] = points[i - 1].add(dbl);\n\n    return new NAF(width, points);\n  }\n\n  _getNAF(width) {\n    assert((width >>> 0) === width);\n\n    if (this.pre && this.pre.naf)\n      return this.pre.naf;\n\n    if (width === 0)\n      return null;\n\n    const odds = this._safeNAF(width).points;\n    const points = this.curve.affinizeAll(odds);\n\n    return new NAF(width, points);\n  }\n\n  _getWindows(width, bits) {\n    assert((width >>> 0) === width);\n    assert((bits >>> 0) === bits);\n\n    if (this.pre && this.pre.windows)\n      return this.pre.windows;\n\n    if (width === 0)\n      return null;\n\n    const size = 1 << width;\n    const steps = ((bits + width - 1) / width) >>> 0;\n    const wnds = new Array(steps * size);\n\n    let g = this.toJ();\n\n    for (let i = 0; i < steps; i++) {\n      wnds[i * size] = this.curve.jpoint();\n\n      for (let j = 1; j < size; j++)\n        wnds[i * size + j] = wnds[i * size + j - 1].add(g);\n\n      g = g.dblp(width);\n    }\n\n    const points = this.curve.affinizeAll(wnds);\n\n    return new Windows(width, bits, points);\n  }\n\n  _getDoubles(step, power) {\n    assert((step >>> 0) === step);\n    assert((power >>> 0) === power);\n\n    if (this.pre && this.pre.doubles)\n      return this.pre.doubles;\n\n    if (step === 0)\n      return null;\n\n    const len = Math.ceil(power / step) + 1;\n    const dbls = new Array(len);\n\n    let acc = this.toJ();\n    let k = 0;\n\n    dbls[k++] = acc;\n\n    for (let i = 0; i < power; i += step) {\n      for (let j = 0; j < step; j++)\n        acc = acc.dbl();\n\n      dbls[k++] = acc;\n    }\n\n    assert(k === len);\n\n    const points = this.curve.affinizeAll(dbls);\n\n    return new Doubles(step, points);\n  }\n\n  _getBeta() {\n    return null;\n  }\n\n  _getBlinding(rng) {\n    if (this.pre && this.pre.blinding)\n      return this.pre.blinding;\n\n    if (!rng)\n      return null;\n\n    if (this.curve.n.isZero())\n      return null;\n\n    // Pregenerate a random blinding value:\n    //\n    //   blind = random integer in [1,n-1]\n    //   unblind = G * blind\n    //\n    // We intend to subtract the blinding value\n    // from scalars before multiplication. We\n    // can add the unblinding point once the\n    // multiplication is complete.\n    const blind = this.curve.randomScalar(rng);\n    const unblind = this.mul(blind);\n\n    return new Blinding(blind, unblind);\n  }\n\n  _hasWindows(k) {\n    assert(k instanceof BN);\n\n    if (!this.pre || !this.pre.windows)\n      return false;\n\n    const {width, bits} = this.pre.windows;\n    const steps = ((bits + width - 1) / width) >>> 0;\n\n    return k.bitLength() <= steps * width;\n  }\n\n  _hasDoubles(k) {\n    assert(k instanceof BN);\n\n    if (!this.pre || !this.pre.doubles)\n      return false;\n\n    const {step, points} = this.pre.doubles;\n    const power = k.bitLength() + 1;\n\n    return points.length >= Math.ceil(power / step) + 1;\n  }\n\n  _getJNAF(point) {\n    assert(point instanceof Point);\n    assert(point.type === this.type);\n\n    // Create comb for JSF.\n    return [\n      this, // 1\n      this.add(point), // 3\n      this.sub(point), // 5\n      point // 7\n    ];\n  }\n\n  _blind(k, rng) {\n    // [SIDE1] Page 5, Section 4.\n    // [BLIND] Page 20, Section 7.\n    assert(k instanceof BN);\n    assert(!k.red);\n\n    // Scalar splitting (requires precomputation).\n    //\n    // Blind a multiplication by first subtracting\n    // a blinding value from the scalar. Example:\n    //\n    //   b = random integer in [1,n-1]\n    //   B = P * b (precomputed)\n    //   Q = P * (k - b) + B\n    //\n    // Note that Joye describes a different method\n    // (multiplier randomization) which computes:\n    //\n    //   B = random point in E\n    //   Q = (P + B) * k - B * k\n    //\n    // Our method is more similar to the \"scalar\n    // splitting\" technique described in the\n    // second source above.\n    //\n    // The blinding value and its corresponding\n    // point are randomly generated and computed\n    // on boot. As long as an attacker is not\n    // able to observe the boot, this should give\n    // a decent bit of protection against various\n    // channel attacks.\n    if (this.pre && this.pre.blinding) {\n      const {blind, unblind} = this.pre.blinding;\n      const t = k.sub(blind);\n\n      return [this, t, unblind];\n    }\n\n    // Randomization is not possible without\n    // an RNG. Do a normal multiplication.\n    if (!rng)\n      return [this, k, null];\n\n    // If we have no precomputed blinding\n    // factor, there are two possibilities\n    // for randomization:\n    //\n    // 1. Randomize the multiplier by adding\n    //    a random multiple of `n`.\n    //\n    // 2. Re-scale the point itself by a\n    //    random factor.\n    //\n    // The first option can be accomplished\n    // with some like:\n    //\n    //   a = random integer in [1,n-1]\n    //   r = a * n\n    //   Q = P * (k + r)\n    //\n    // The second is accomplished with:\n    //\n    //   a = random element in F(p)\n    //   R = (x * a^2, y * a^3, z * a)\n    //   Q = R * k\n    //\n    // If we have precomputed doubles / naf\n    // points, we opt for the first method\n    // to avoid randomizing everything.\n    if (this.pre) {\n      if (this.curve.n.isZero())\n        return [this, k, null];\n\n      const a = this.curve.randomScalar(rng);\n      const r = a.mul(this.curve.n);\n      const t = r.iadd(k);\n\n      return [this, t, null];\n    }\n\n    // If there is no precomputation _at all_,\n    // we opt for the second method.\n    const p = this.randomize(rng);\n\n    return [p, k, null];\n  }\n\n  clone() {\n    throw new Error('Not implemented.');\n  }\n\n  precompute(bits, rng) {\n    assert((bits >>> 0) === bits);\n\n    if (!this.pre)\n      this.pre = new Precomp();\n\n    if (!this.pre.naf)\n      this.pre.naf = this._getNAF(9);\n\n    if (USE_FIXED && !this.pre.windows)\n      this.pre.windows = this._getWindows(4, bits);\n\n    if (!this.pre.doubles)\n      this.pre.doubles = this._getDoubles(4, bits + 1);\n\n    if (!this.pre.beta)\n      this.pre.beta = this._getBeta();\n\n    if (!this.pre.blinding)\n      this.pre.blinding = this._getBlinding(rng);\n\n    return this;\n  }\n\n  validate() {\n    return this.curve.validate(this);\n  }\n\n  normalize() {\n    return this;\n  }\n\n  scale(a) {\n    throw new Error('Not implemented.');\n  }\n\n  randomize(rng) {\n    const z = this.curve.randomField(rng);\n    return this.scale(z);\n  }\n\n  neg() {\n    throw new Error('Not implemented.');\n  }\n\n  add(point) {\n    throw new Error('Not implemented.');\n  }\n\n  sub(point) {\n    assert(point instanceof Point);\n    return this.add(point.neg());\n  }\n\n  dbl() {\n    throw new Error('Not implemented.');\n  }\n\n  dblp(pow) {\n    // Repeated doubling. This can\n    // be optimized by child classes.\n    assert((pow >>> 0) === pow);\n\n    let r = this;\n\n    for (let i = 0; i < pow; i++)\n      r = r.dbl();\n\n    return r;\n  }\n\n  diffAddDbl(p, q) {\n    throw new Error('Not implemented.');\n  }\n\n  getX() {\n    throw new Error('Not implemented.');\n  }\n\n  getY() {\n    throw new Error('Not implemented.');\n  }\n\n  eq(point) {\n    throw new Error('Not implemented.');\n  }\n\n  cmp(point) {\n    throw new Error('Not implemented.');\n  }\n\n  isInfinity() {\n    throw new Error('Not implemented.');\n  }\n\n  isOrder2() {\n    throw new Error('Not implemented.');\n  }\n\n  isOdd() {\n    throw new Error('Not implemented.');\n  }\n\n  isEven() {\n    throw new Error('Not implemented.');\n  }\n\n  isSquare() {\n    throw new Error('Not implemented.');\n  }\n\n  eqX(x) {\n    throw new Error('Not implemented.');\n  }\n\n  eqR(x) {\n    throw new Error('Not implemented.');\n  }\n\n  isSmall() {\n    // Test whether the point is of small order.\n    if (this.isInfinity())\n      return false;\n\n    // P * h = O\n    return this.jmulH().isInfinity();\n  }\n\n  hasTorsion() {\n    // Test whether the point is in another subgroup.\n    if (this.isInfinity())\n      return false;\n\n    // P * n != O\n    return !this.jmul(this.curve.n).isInfinity();\n  }\n\n  order() {\n    // Calculate point order.\n    const {h, n} = this.curve;\n\n    let p = this.toJ();\n    let q = new BN(1);\n\n    while (!p.isInfinity()) {\n      q.iaddn(1);\n\n      if (q.cmp(h) > 0) {\n        q = n.clone();\n        break;\n      }\n\n      p = p.add(this);\n    }\n\n    return q;\n  }\n\n  mul(k) {\n    return this.jmul(k);\n  }\n\n  muln(k) {\n    return this.jmuln(k);\n  }\n\n  mulBlind(k, rng) {\n    return this.jmulBlind(k, rng);\n  }\n\n  mulAdd(k1, p2, k2) {\n    return this.jmulAdd(k1, p2, k2);\n  }\n\n  mulH() {\n    return this.jmulH();\n  }\n\n  div(k) {\n    return this.jdiv(k);\n  }\n\n  divn(k) {\n    return this.jdivn(k);\n  }\n\n  divH() {\n    return this.jdivH();\n  }\n\n  jmul(k) {\n    if (USE_FIXED && this._hasWindows(k))\n      return this.curve._fixedMul(this, k);\n\n    if (this._hasDoubles(k))\n      return this.curve._fixedNafMul(this, k);\n\n    if (this.curve.endo && this.type === types.AFFINE)\n      return this.curve._endoWnafMulAdd([this], [k]);\n\n    return this.curve._wnafMul(5, this, k);\n  }\n\n  jmuln(k) {\n    assert((k | 0) === k);\n    return this.jmul(new BN(k));\n  }\n\n  jmulBlind(k, rng = null) {\n    const [p, t, unblind] = this._blind(k, rng);\n    const q = p.jmul(t);\n\n    if (unblind)\n      return q.add(unblind);\n\n    return q;\n  }\n\n  jmulAdd(k1, p2, k2) {\n    if (this.curve.endo && this.type === types.AFFINE)\n      return this.curve._endoWnafMulAdd([this, p2], [k1, k2]);\n\n    return this.curve._wnafMulAdd(5, [this, p2], [k1, k2]);\n  }\n\n  jmulH() {\n    const word = this.curve.h.word(0);\n\n    // Optimize for powers of two.\n    if ((word & (word - 1)) === 0) {\n      const bits = this.curve.h.bitLength();\n      return this.toJ().dblp(bits - 1);\n    }\n\n    return this.jmul(this.curve.h);\n  }\n\n  jdiv(k) {\n    assert(k instanceof BN);\n    assert(!k.red);\n\n    return this.jmul(k.invert(this.curve.n));\n  }\n\n  jdivn(k) {\n    assert(!this.curve.n.isZero());\n\n    if (this.curve.h.cmpn(k) === 0)\n      return this.jdivH();\n\n    return this.jdiv(new BN(k));\n  }\n\n  jdivH() {\n    if (this.curve.n.isZero())\n      return this.toJ();\n\n    if (this.curve.h.cmpn(1) === 0)\n      return this.toJ();\n\n    if (this.curve.hi === null)\n      this.curve.hi = this.curve.h.invert(this.curve.n);\n\n    return this.jmul(this.curve.hi);\n  }\n\n  toP() {\n    return this.normalize();\n  }\n\n  toJ() {\n    return this;\n  }\n\n  toX() {\n    return this;\n  }\n\n  key() {\n    if (this.isInfinity())\n      return `${this.curve.uid}:oo`;\n\n    this.normalize();\n\n    const x = this.getX().toString(16);\n    const y = this.getY().toString(16);\n\n    return `${this.curve.uid}:${x},${y}`;\n  }\n\n  encode(compact) {\n    throw new Error('Not implemented.');\n  }\n\n  static decode(curve, bytes) {\n    throw new Error('Not implemented.');\n  }\n\n  encodeX() {\n    throw new Error('Not implemented.');\n  }\n\n  static decodeX(curve, bytes) {\n    throw new Error('Not implemented.');\n  }\n\n  static decodeEven(curve, bytes) {\n    throw new Error('Not implemented.');\n  }\n\n  static decodeSquare(curve, bytes) {\n    throw new Error('Not implemented.');\n  }\n\n  toJSON(pre) {\n    throw new Error('Not implemented.');\n  }\n\n  static fromJSON(curve, json) {\n    throw new Error('Not implemented.');\n  }\n\n  [custom]() {\n    return '<Point>';\n  }\n}\n\n/**\n * ShortCurve\n */\n\nclass ShortCurve extends Curve {\n  constructor(conf) {\n    super(ShortPoint, 'short', conf);\n\n    this.a = BN.fromJSON(conf.a).toRed(this.red);\n    this.b = BN.fromJSON(conf.b).toRed(this.red);\n    this.c = BN.fromJSON(conf.c || '0').toRed(this.red);\n    this.ai = this.a.isZero() ? this.zero : this.a.redInvert();\n    this.zi = this.z.isZero() ? this.zero : this.z.redInvert();\n\n    this.zeroA = this.a.isZero();\n    this.threeA = this.a.eq(this.three.redNeg());\n    this.redN = this.n.toRed(this.red);\n    this.pmodn = this.p.clone();\n    this.highOrder = this.n.cmp(this.p) >= 0;\n    this.smallGap = false;\n\n    this._finalize(conf);\n  }\n\n  _finalize(conf) {\n    super._finalize(conf);\n\n    // Precalculate endomorphism.\n    if (conf.endo != null)\n      this.endo = Endo.fromJSON(this, conf.endo);\n    else\n      this.endo = this._getEndomorphism();\n\n    if (!this.n.isZero()) {\n      this.pmodn = this.p.mod(this.n);\n\n      // Check for Maxwell's trick (see eqR).\n      this.smallGap = this.p.div(this.n).cmpn(1) <= 0;\n    }\n\n    return this;\n  }\n\n  static _isomorphism(curveA, curveB, custom, odd) {\n    // Short Weierstrass Isomorphism.\n    //\n    // [GECC] Page 84, Section 3.1.5.\n    // [ARITH1] Page 274, Section 13.1.5.\n    // [ALT] Appendix F.3 (Isomorphic Mapping between Weierstrass Curves).\n    //\n    // Find `u` such that `a * u^4 = a'` and `b * u^6 = b'`.\n    //\n    // Transformation:\n    //\n    //   u4 = a' / a\n    //   u2 = +-sqrt(u4)\n    //   u6 = u4 * u2\n    //   a' = a * u4\n    //   b' = b * u6\n    //\n    // Where `u2` is any root that is square.\n    //\n    // If a = 0, we can do:\n    //\n    //   a' = 0\n    //   b' = b'\n    //\n    // Where (b' / b)^(1 / 3) is square.\n    //\n    // If b = 0, we can do:\n    //\n    //   a' = a'\n    //   b' = 0\n    //\n    // Where sqrt(a' / a) is square.\n    assert(curveA instanceof BN);\n    assert(curveB instanceof BN);\n    assert(custom instanceof BN);\n    assert(odd == null || typeof odd === 'boolean');\n    assert(!curveA.isZero() || !curveB.isZero());\n\n    if (custom.isZero())\n      throw new Error('Invalid coefficient.');\n\n    if (curveA.isZero()) {\n      const customB = custom;\n      const u6 = customB.redDiv(curveB);\n      // Todo: allow index flag.\n      const u2 = uncube(u6);\n\n      // Already checked in uncube().\n      assert(u2.redJacobi() === 1);\n\n      return [curveA.clone(), customB.clone()];\n    }\n\n    if (curveB.isZero()) {\n      const customA = custom;\n      const u4 = customA.redDiv(curveA);\n      const u2 = u4.redSqrt();\n\n      // Todo: allow odd flag.\n      if (u2.redJacobi() !== 1)\n        u2.redINeg();\n\n      if (u2.redJacobi() !== 1)\n        throw new Error('Invalid `a` coefficient.');\n\n      return [customA.clone(), curveB.clone()];\n    }\n\n    const customA = custom;\n    const u4 = customA.redDiv(curveA);\n    const u2 = u4.redSqrt();\n\n    if (odd != null) {\n      if (u2.redIsOdd() !== odd)\n        u2.redINeg();\n    } else {\n      if (u2.redJacobi() !== 1)\n        u2.redINeg();\n    }\n\n    if (u2.redJacobi() !== 1)\n      throw new Error('Invalid `a` coefficient.');\n\n    const u6 = u4.redMul(u2);\n    const a = curveA.redMul(u4);\n    const b = curveB.redMul(u6);\n\n    assert(a.eq(customA));\n\n    return [a, b];\n  }\n\n  _short(a0, odd) {\n    return ShortCurve._isomorphism(this.a, this.b, a0, odd);\n  }\n\n  _mont(b0, odd) {\n    // Short Weierstrass->Montgomery Equivalence.\n    //\n    // [ARITH1] Page 286, Section 13.2.3.c.\n    // [SAFE] \"Ladders\".\n    //\n    // Transformation:\n    //\n    //   r = A / (3 * B)\n    //   s = +-sqrt(3 * r^2 + a)\n    //   A = 3 * r / s\n    //   B = 1 / s\n    const [r, s] = this._findRS(odd);\n    const b = s.redInvert();\n    const a = r.redMuln(3).redMul(b);\n\n    if (b0 != null)\n      return MontCurve._isomorphism(a, b, b0);\n\n    return [a, b];\n  }\n\n  _edwards(a0, odd) {\n    // Short Weierstrass->Twisted Edwards Equivalence.\n    //\n    // [TWISTEQ] Section 1.\n    //\n    // Transformation:\n    //\n    //   r = (a' + d') / 6\n    //   s = +-sqrt(3 * r^2 + a)\n    //   a' = 3 * r + 2 * s\n    //   d' = 3 * r - 2 * s\n    const [r, s] = this._findRS(odd);\n    const r3 = r.redMuln(3);\n    const s2 = s.redMuln(2);\n    const a = r3.redAdd(s2);\n    const d = r3.redSub(s2);\n\n    if (a0 != null)\n      return EdwardsCurve._isomorphism(a, d, a0);\n\n    return [a, d];\n  }\n\n  _findRS(sign) {\n    // Find `r` and `s` for equivalence.\n    //\n    // [ARITH1] Page 286, Section 13.2.3.c.\n    // [SAFE] \"Ladders\".\n    //\n    // Computation:\n    //\n    //   r = solve(r^3 + a * r + b == 0, r)\n    //   s = +-sqrt(3 * r^2 + a)\n    //\n    // Computing `r` is non-trivial. We need\n    // to solve `r^3 + a * r + b = 0`, but we\n    // don't have a polynomial solver, so we\n    // loop over random points until we find\n    // one with 2-torsion. Multiplying by the\n    // subgroup order should yield a point of\n    // ((A / 3) / B, 0) which is a solution.\n    assert(sign == null || typeof sign === 'boolean');\n    assert(this.h.word(0) >= 4);\n    assert(!this.n.isZero());\n\n    const x = this.one.redNeg();\n\n    let p;\n\n    for (;;) {\n      x.redIAdd(this.one);\n\n      try {\n        p = this.pointFromX(x.clone());\n      } catch (e) {\n        continue;\n      }\n\n      p = p.mul(this.n);\n\n      if (p.isInfinity())\n        continue;\n\n      if (!p.y.isZero())\n        continue;\n\n      break;\n    }\n\n    const r = p.x;\n    const r2 = r.redSqr();\n    const s = r2.redMuln(3).redIAdd(this.a).redSqrt();\n\n    if (sign != null) {\n      if (s.redIsOdd() !== sign)\n        s.redINeg();\n    }\n\n    return [r, s];\n  }\n\n  _scale0(a, b) {\n    // We can extract the isomorphism factors with:\n    //\n    //   u4 = a' / a\n    //   u6 = b' / b\n    //   u2 = +-sqrt(u4)\n    //   u = +-sqrt(u2)\n    //   u3 = u2 * u\n    //\n    // `u2` should be picked such that `u4 * u2 = u6`.\n    //\n    // If a = 0, we can do:\n    //\n    //   u6 = b' / b\n    //   u2 = u6^(1 / 3)\n    //   u = +-sqrt(u2)\n    //   u3 = u2 * u\n    //\n    // Where `u2` is any root that is square.\n    //\n    // If b = 0, we can do:\n    //\n    //   u4 = a' / a\n    //   u2 = +-sqrt(u4)\n    //   u = +-sqrt(u2)\n    //   u3 = u2 * u\n    //\n    // Where `u2` is any root that is square.\n    assert(this.a.isZero() === a.isZero());\n    assert(this.b.isZero() === b.isZero());\n\n    if (this.a.isZero()) {\n      const u6 = this.b.redDiv(this.field(b));\n      // Todo: figure out how to check index.\n      const u2 = uncube(u6);\n      const u = u2.redSqrt();\n      const u3 = u2.redMul(u);\n\n      assert(u3.redSqr().eq(u6));\n      assert(!u.isZero());\n\n      return [u2, u3];\n    }\n\n    if (this.b.isZero()) {\n      const u4 = this.a.redDiv(this.field(a));\n      const u2 = u4.redSqrt();\n\n      // Todo: figure out how to check oddness.\n      if (u2.redJacobi() !== 1)\n        u2.redINeg();\n\n      const u = u2.redSqrt();\n      const u3 = u2.redMul(u);\n\n      assert(u3.redMul(u).eq(u4));\n      assert(!u.isZero());\n\n      return [u2, u3];\n    }\n\n    const u4 = this.a.redDiv(this.field(a));\n    const u6 = this.b.redDiv(this.field(b));\n    const u2 = u4.redSqrt();\n\n    if (!u4.redMul(u2).eq(u6))\n      u2.redINeg();\n\n    assert(u4.redMul(u2).eq(u6));\n\n    const u = u2.redSqrt();\n    const u3 = u2.redMul(u);\n\n    assert(!u.isZero());\n\n    return [u2, u3];\n  }\n\n  _scale1(x, y) {\n    // If base points are available, it is much\n    // easier, with:\n    //\n    //   u2 = x' / x\n    //   u3 = y' / y\n    //   u = +-sqrt(u2)\n    //\n    // `u` should be picked such that `u2 * u = u3`.\n    const u2 = this.g.x.redDiv(this.field(x));\n    const u3 = this.g.y.redDiv(this.field(y));\n    const u = u2.redSqrt();\n\n    if (!u2.redMul(u).eq(u3))\n      u.redINeg();\n\n    assert(u2.redMul(u).eq(u3));\n    assert(!u.isZero());\n\n    return [u2, u3];\n  }\n\n  _scaleShort(curve) {\n    assert(curve instanceof ShortCurve);\n\n    if (this.g.isInfinity() || curve.g.isInfinity())\n      return this._scale0(curve.a, curve.b);\n\n    return this._scale1(curve.g.x, curve.g.y);\n  }\n\n  _scaleMont(curve) {\n    assert(curve instanceof MontCurve);\n\n    if (this.g.isInfinity() || curve.g.isInfinity()) {\n      const [a, b] = curve._short();\n      return this._scale0(a, b);\n    }\n\n    const {x, y} = curve.g;\n    const nx = x.redAdd(curve.a3).redMul(curve.bi);\n    const ny = y.redMul(curve.bi);\n\n    return this._scale1(nx, ny);\n  }\n\n  _scaleEdwards(curve) {\n    assert(curve instanceof EdwardsCurve);\n\n    if (this.g.isInfinity() || curve.g.isInfinity()) {\n      const [a, b] = curve._short();\n      return this._scale0(a, b);\n    }\n\n    const {x, y, z} = curve.g;\n    const a5 = curve.a.redMuln(5);\n    const d5 = curve.d.redMuln(5);\n    const dma = curve.d.redSub(curve.a);\n    const d5a = d5.redSub(curve.a);\n    const da5 = curve.d.redSub(a5);\n    const ypz = y.redAdd(z);\n    const ymz = y.redSub(z);\n    const xx = d5a.redMul(y).redIAdd(da5.redMul(z));\n    const xz = ymz.redMuln(12);\n    const yy = dma.redMul(ypz).redMul(z);\n    const yz = ymz.redMul(x).redIMuln(4);\n    const zi = xz.redMul(yz).redInvert();\n    const nx = xx.redMul(yz).redMul(zi);\n    const ny = yy.redMul(xz).redMul(zi);\n\n    return this._scale1(nx, ny);\n  }\n\n  _getEndomorphism(index = 0) {\n    // Compute endomorphism.\n    //\n    // [GECC] Example 3.76, Page 128, Section 3.5.\n\n    // No curve params.\n    if (this.n.isZero() || this.g.isInfinity())\n      return null;\n\n    // No efficient endomorphism.\n    if (!this.zeroA || this.p.modrn(3) !== 1 || this.n.modrn(3) !== 1)\n      return null;\n\n    // Solve beta^3 mod p = 1.\n    const [b1, b2] = this._getEndoRoots(this.p);\n\n    // Choose the smallest beta by default.\n    const beta = [b1, b2][index & 1].toRed(this.red);\n\n    // Solve lambda^3 mod n = 1.\n    const [l1, l2] = this._getEndoRoots(this.n);\n\n    // Choose the lambda matching selected beta.\n    // Note that P * lambda = (x * beta, y).\n    const p = this.point(this.g.x.redMul(beta), this.g.y);\n\n    let lambda;\n\n    if (this.g.mul(l1).eq(p)) {\n      lambda = l1;\n    } else {\n      assert(this.g.mul(l2).eq(p));\n      lambda = l2;\n    }\n\n    // Get basis vectors.\n    const basis = this._getEndoBasis(lambda);\n\n    // Precompute `g1` and `g2`.\n    const pre = this._getEndoPrecomp(basis);\n\n    return new Endo(beta, lambda, basis, pre);\n  }\n\n  _getEndoRoots(num) {\n    // Find roots for x^2 + x + 1 in F.\n    //\n    // [GECC] Example 3.76, Page 128, Section 3.5.\n    // [GLV] Page 192, Section 2 (Endomorphisms).\n    //\n    // The above document doesn't fully explain how\n    // to derive these and only \"hints\" at it, as\n    // mentioned by Hal Finney[1], but we're basically\n    // computing two possible cube roots of 1 here.\n    //\n    // Note that we could also compute[2]:\n    //\n    //   beta = 2^((p - 1) / 3) mod p\n    //   lambda = 3^((n - 1) / 3) mod n\n    //\n    // As an extension of Fermat's little theorem:\n    //\n    //   g^(p - 1) mod p == 1\n    //\n    // It is suspected[3] this is how Hal Finney[4]\n    // computed his original endomorphism roots.\n    //\n    // @indutny's method for computing cube roots\n    // of unity[5] appears to be the method described\n    // on wikipedia[6][7].\n    //\n    // Sage produces the same solution:\n    //\n    //   sage: solve(x^2 + x + 1 == 0, x)\n    //   [x == -1/2*I*sqrt(3) - 1/2, x == 1/2*I*sqrt(3) - 1/2]\n    //\n    // This can be reduced to:\n    //\n    //   x = (+-sqrt(-3) - 1) / 2\n    //\n    // [1] https://bitcointalk.org/index.php?topic=3238.msg45565#msg45565\n    // [2] https://crypto.stackexchange.com/a/22739\n    // [3] https://bitcoin.stackexchange.com/a/35872\n    // [4] https://github.com/halfinney/bitcoin/commit/dc411b5\n    // [5] https://en.wikipedia.org/wiki/Cube_root_of_unity\n    // [6] https://en.wikipedia.org/wiki/Splitting_field#Cubic_example\n    // [7] http://mathworld.wolfram.com/SplittingField.html\n    const red = num === this.p ? this.red : BN.mont(num);\n    const two = new BN(2).toRed(red);\n    const three = new BN(3).toRed(red);\n    const i2 = two.redInvert();\n\n    // S1 = sqrt(-3) / 2\n    const s1 = three.redNeg().redSqrt().redMul(i2);\n\n    // S2 = -S1\n    const s2 = s1.redNeg();\n\n    // R1 = S1 - 1 / 2\n    const r1 = s1.redSub(i2).fromRed();\n\n    // R2 = S2 - 1 / 2\n    const r2 = s2.redSub(i2).fromRed();\n\n    return [r1, r2].sort(BN.cmp);\n  }\n\n  _getEndoBasis(lambda) {\n    // Compute endomorphic basis.\n    //\n    // This essentially computes Cornacchia's algorithm\n    // for solving x^2 + d * y^2 = m (d = lambda, m = order).\n    //\n    // https://en.wikipedia.org/wiki/Cornacchia%27s_algorithm\n    //\n    // [GECC] Algorithm 3.74, Page 127, Section 3.5.\n    // [GLV] Page 196, Section 4 (Decomposing K).\n    //\n    // Balanced length-two representation of a multiplier.\n    //\n    // 1. Run the extended euclidean algorithm with inputs n\n    //    and lambda. The algorithm produces a sequence of\n    //    equations si*n + ti*lam = ri where s0=1, t0=0,\n    //    r0=n, s1=0, t1=1, r1=lam, and the remainders ri\n    //    and are non-negative and strictly decreasing. Let\n    //    l be the greatest index for which rl >= sqrt(n).\n    const [rl, tl, rl1, tl1, rl2, tl2] = this._egcdSqrt(lambda);\n\n    // 2. Set (a1, b1) <- (rl+1, -tl+1).\n    const a1 = rl1;\n    const b1 = tl1.neg();\n\n    // 3. If (rl^2 + tl^2) <= (rl+2^2 + tl+2^2)\n    //    then set (a2, b2) <- (rl, -tl).\n    //    else set (a2, b2) <- (rl+2, -tl+2).\n    const lhs = rl.sqr().iadd(tl.sqr());\n    const rhs = rl2.sqr().iadd(tl2.sqr());\n\n    let a2, b2;\n\n    if (lhs.cmp(rhs) <= 0) {\n      a2 = rl;\n      b2 = tl.neg();\n    } else {\n      a2 = rl2;\n      b2 = tl2.neg();\n    }\n\n    return [\n      new Vector(a1, b1),\n      new Vector(a2, b2)\n    ];\n  }\n\n  _egcdSqrt(lambda) {\n    // Extended Euclidean algorithm for integers.\n    //\n    // [GECC] Algorithm 2.19, Page 40, Section 2.2.\n    // [GLV] Page 196, Section 4 (Decomposing K).\n    assert(lambda instanceof BN);\n    assert(!lambda.red);\n    assert(lambda.sign() > 0);\n    assert(this.n.sign() > 0);\n\n    // Note that we insert the approximate square\n    // root checks as described in algorithm 3.74.\n    //\n    // Algorithm 2.19 is defined as:\n    //\n    // 1. u <- a\n    //    v <- b\n    //\n    // 2. x1 <- 1\n    //    y1 <- 0\n    //    x2 <- 0\n    //    y2 <- 1\n    //\n    // 3. while u != 0 do\n    //\n    // 3.1. q <- floor(v / u)\n    //      r <- v - q * u\n    //      x <- x2 - q * x1\n    //      y <- y2 - q * y1\n    //\n    // 3.2. v <- u\n    //      u <- r\n    //      x2 <- x1\n    //      x1 <- x\n    //      y2 <- y1\n    //      y1 <- y\n    //\n    // 4. d <- v\n    //    x <- x2\n    //    y <- y2\n    //\n    // 5. Return (d, x, y).\n\n    // Start with an approximate square root of n.\n    const sqrtn = this.n.ushrn(this.n.bitLength() >>> 1);\n\n    let u = lambda; // r1\n    let v = this.n.clone(); // r0\n    let x1 = new BN(1); // t1\n    let y1 = new BN(0); // t0\n    let x2 = new BN(0); // s1\n    let y2 = new BN(1); // s0\n\n    // All vectors are roots of: a + b * lambda = 0 (mod n).\n    let rl, tl;\n\n    // First vector.\n    let rl1, tl1;\n\n    // Inner.\n    let i = 0;\n    let j = 0;\n    let p;\n\n    // Compute EGCD.\n    while (!u.isZero() && i < 2) {\n      const q = v.quo(u);\n      const r = v.sub(q.mul(u));\n      const x = x2.sub(q.mul(x1));\n      const y = y2.sub(q.mul(y1));\n\n      // Check for r < sqrt(n).\n      if (j === 0 && r.cmp(sqrtn) < 0) {\n        rl = p;\n        tl = x1;\n        rl1 = r;\n        tl1 = x;\n        j = 1; // 1 more round.\n      }\n\n      p = r;\n      v = u;\n      u = r;\n      x2 = x1;\n      x1 = x;\n      y2 = y1;\n      y1 = y;\n\n      i += j;\n    }\n\n    // Should never happen.\n    assert(j !== 0, 'Could not find r < sqrt(n).');\n\n    // Second vector.\n    const rl2 = x2;\n    const tl2 = x1;\n\n    return [\n      rl,\n      tl,\n      rl1,\n      tl1,\n      rl2,\n      tl2\n    ];\n  }\n\n  _getEndoPrecomp(basis) {\n    // Precompute `g1` and `g2` to avoid round division.\n    //\n    // [JCEN12] Page 5, Section 4.3.\n    //\n    // Computation:\n    //\n    //   d = a1 * b2 - b1 * a2\n    //   t = ceil(log2(d+1)) + p\n    //   g1 = round((2^t * b2) / d)\n    //   g2 = round((2^t * b1) / d)\n    //\n    // Where:\n    //\n    //   `p` is the number of precision bits.\n    //   `d` is equal to `n` (the curve order).\n    //\n    // The paper above uses 2 as the value of `p`,\n    // whereas libsecp256k1 uses 128 (total=384).\n    //\n    // We pick precision for `g1` and `g2` such that:\n    //\n    //   abs(g1) < n\n    //   abs(g2) < n\n    //\n    // This ensures maximum precision for the constants\n    // while also ensuring they fit into a fixed number\n    // of scalar limbs in more optimized implementations.\n    //\n    // Furthermore, we attempt to align to a limb width\n    // of 64 bits. This allows us to optimize the shift,\n    // a la libsecp256k1[1].\n    //\n    // [1] https://github.com/bitcoin-core/secp256k1/pull/822\n    assert(Array.isArray(basis));\n    assert(basis.length === 2);\n    assert(basis[0] instanceof Vector);\n    assert(basis[1] instanceof Vector);\n\n    const [v1, v2] = basis;\n    const d = v1.a.mul(v2.b).isub(v1.b.mul(v2.a));\n    const bits = d.bitLength();\n    const align = bits >= 160;\n\n    assert(d.eq(this.n));\n\n    // Start with a rough estimate.\n    let shift = bits + Math.ceil(bits / 2) + 1;\n    let g1, g2;\n\n    if (align)\n      shift -= shift & 63;\n\n    while (shift > bits) {\n      g1 = v2.b.ushln(shift).divRound(d);\n      g2 = v1.b.ushln(shift).divRound(d);\n\n      if (g1.ucmp(d) < 0 && g2.ucmp(d) < 0)\n        break;\n\n      if (align)\n        shift -= 64;\n      else\n        shift -= 1;\n    }\n\n    if (shift <= bits)\n      throw new Error('Could not calculate g1 and g2.');\n\n    return [shift, g1, g2];\n  }\n\n  _endoSplit(k) {\n    // Balanced length-two representation of a multiplier.\n    //\n    // [GECC] Algorithm 3.74, Page 127, Section 3.5.\n    //\n    // Also note that it is possible to precompute[1]\n    // values in order to avoid the division[2][3][4].\n    //\n    // This involves precomputing `g1` and `g2 (see\n    // above). `c1` and `c2` can then be computed as\n    // follows:\n    //\n    //   t = ceil(log2(n+1)) + p\n    //   c1 = (k * g1) >> t\n    //   c2 = -((k * g2) >> t)\n    //\n    // Where `>>` is an _unsigned_ right shift. Also\n    // note that the last bit discarded in the shift\n    // must be stored. If it is 1, then add 1 to the\n    // scalar (absolute addition).\n    //\n    // It's worth noting that libsecp256k1 uses a\n    // different calculation along the lines of:\n    //\n    //   t = ceil(log2(n+1)) + p\n    //   c1 = ((k * g1) >> t) * -b1\n    //   c2 = ((k * -g2) >> t) * -b2\n    //   k2 = c1 + c2\n    //   k1 = k2 * -lambda + k\n    //\n    // So, in the future, we can consider changing\n    // step 4 to:\n    //\n    //   4. Compute c1 = (k * g1) >> t\n    //          and c2 = -((k * g2) >> t).\n    //\n    //   const [shift, g1, g2] = this.endo.pre;\n    //   const c1 = k.mulShift(g1, shift);\n    //   const c2 = k.mulShift(g2, shift).ineg();\n    //\n    // Once we're brave enough, that is.\n    //\n    // [1] [JCEN12] Page 5, Section 4.3.\n    // [2] https://github.com/bitcoin-core/secp256k1/blob/0b70241/src/scalar_impl.h#L259\n    // [3] https://github.com/bitcoin-core/secp256k1/pull/21\n    // [4] https://github.com/bitcoin-core/secp256k1/pull/127\n    assert(k instanceof BN);\n    assert(!k.red);\n    assert(!this.n.isZero());\n\n    const [v1, v2] = this.endo.basis;\n\n    // 4. Compute c1 = round(b2 * k / n)\n    //        and c2 = round(-b1 * k / n).\n    const c1 = v2.b.mul(k).divRound(this.n);\n    const c2 = v1.b.neg().mul(k).divRound(this.n);\n\n    // 5. Compute k1 = k - c1 * a1 - c2 * a2\n    //        and k2 = -c1 * b1 - c2 * b2.\n    const p1 = c1.mul(v1.a);\n    const p2 = c2.mul(v2.a);\n    const q1 = c1.ineg().mul(v1.b);\n    const q2 = c2.mul(v2.b);\n\n    // Calculate answer.\n    const k1 = k.sub(p1).isub(p2);\n    const k2 = q1.isub(q2);\n\n    // 6. Return (k1, k2).\n    return [k1, k2];\n  }\n\n  _endoBeta(point) {\n    assert(point instanceof ShortPoint);\n    return [point, point._getBeta()];\n  }\n\n  _endoWnafMulAdd(points, coeffs) {\n    // Point multiplication with efficiently computable endomorphisms.\n    //\n    // [GECC] Algorithm 3.77, Page 129, Section 3.5.\n    // [GLV] Page 193, Section 3 (Using Efficient Endomorphisms).\n    //\n    // Note it may be possible to do this 4-dimensionally [4GLV].\n    assert(Array.isArray(points));\n    assert(Array.isArray(coeffs));\n    assert(points.length === coeffs.length);\n    assert(this.endo != null);\n\n    const len = points.length;\n    const npoints = new Array(len * 2);\n    const ncoeffs = new Array(len * 2);\n\n    for (let i = 0; i < len; i++) {\n      const [p1, p2] = this._endoBeta(points[i]);\n      const [k1, k2] = this._endoSplit(coeffs[i]);\n\n      npoints[i * 2 + 0] = p1;\n      ncoeffs[i * 2 + 0] = k1;\n      npoints[i * 2 + 1] = p2;\n      ncoeffs[i * 2 + 1] = k2;\n    }\n\n    return this._wnafMulAdd(5, npoints, ncoeffs);\n  }\n\n  _sswu(u) {\n    // Simplified Shallue-Woestijne-Ulas Method.\n    //\n    // Distribution: 3/8.\n    //\n    // [SSWU1] Page 15-16, Section 7. Appendix G.\n    // [SSWU2] Page 5, Theorem 2.3.\n    // [H2EC] \"Simplified Shallue-van de Woestijne-Ulas Method\".\n    //\n    // Assumptions:\n    //\n    //   - a != 0, b != 0.\n    //   - Let z be a non-square in F(p).\n    //   - z != -1.\n    //   - The polynomial g(x) - z is irreducible over F(p).\n    //   - g(b / (z * a)) is square in F(p).\n    //   - u != 0, u != +-sqrt(-1 / z).\n    //\n    // Map:\n    //\n    //   g(x) = x^3 + a * x + b\n    //   t1 = 1 / (z^2 * u^4 + z * u^2)\n    //   x1 = (-b / a) * (1 + t1)\n    //   x1 = b / (z * a), if t1 = 0\n    //   x2 = z * u^2 * x1\n    //   x = x1, if g(x1) is square\n    //     = x2, otherwise\n    //   y = sign(u) * abs(sqrt(g(x)))\n    const {b, z, ai, zi, one} = this;\n    const z2 = z.redSqr();\n    const ba = b.redNeg().redMul(ai);\n    const bza = b.redMul(zi).redMul(ai);\n    const u2 = u.redSqr();\n    const u4 = u2.redSqr();\n    const t0 = z2.redMul(u4).redIAdd(z.redMul(u2));\n    const t1 = t0.isZero() ? t0 : t0.redInvert();\n    const x1 = t1.isZero() ? bza : ba.redMul(one.redAdd(t1));\n    const x2 = z.redMul(u2).redMul(x1);\n    const y1 = this.solveY2(x1);\n    const y2 = this.solveY2(x2);\n    const alpha = y1.redIsSquare() | 0;\n    const x = [x1, x2][alpha ^ 1];\n    const y = [y1, y2][alpha ^ 1].redSqrt();\n\n    if (y.redIsOdd() !== u.redIsOdd())\n      y.redINeg();\n\n    return this.point(x, y);\n  }\n\n  _sswui(p, hint) {\n    // Inverting the Map (Simplified Shallue-Woestijne-Ulas).\n    //\n    // Assumptions:\n    //\n    //   - a^2 * x^2 - 2 * a * b * x - 3 * b^2 is square in F(p).\n    //   - If r < 3 then x != -b / a.\n    //\n    // Unlike SVDW, the preimages here are evenly\n    // distributed (more or less). SSWU covers ~3/8\n    // of the curve points. Each preimage has a 1/2\n    // chance of mapping to either x1 or x2.\n    //\n    // Assuming the point is within that set, each\n    // point has a 1/4 chance of inverting to any\n    // of the preimages. This means we can simply\n    // randomly select a preimage if one exists.\n    //\n    // However, the [SVDW2] sampling method seems\n    // slighly faster in practice for [SQUARED].\n    //\n    // Map:\n    //\n    //   c = sqrt(a^2 * x^2 - 2 * a * b * x - 3 * b^2)\n    //   u1 = -(a * x + b - c) / (2 * (a * x + b) * z)\n    //   u2 = -(a * x + b + c) / (2 * (a * x + b) * z)\n    //   u3 = -(a * x + b - c) / (2 * b * z)\n    //   u4 = -(a * x + b + c) / (2 * b * z)\n    //   r = random integer in [1,4]\n    //   u = sign(y) * abs(sqrt(ur))\n    const {a, b, z} = this;\n    const {x, y} = p;\n    const r = hint & 3;\n    const a2x2 = a.redSqr().redMul(x.redSqr());\n    const abx2 = a.redMul(b).redMul(x).redIMuln(2);\n    const b23 = b.redSqr().redMuln(3);\n    const axb = a.redMul(x).redIAdd(b);\n    const c = a2x2.redISub(abx2).redISub(b23).redSqrt();\n    const n0 = axb.redSub(c).redINeg();\n    const n1 = axb.redAdd(c).redINeg();\n    const d0 = axb.redMul(z).redIMuln(2);\n    const d1 = b.redMul(z).redIMuln(2);\n    const n = [n0, n1][r & 1]; // r = 1 or 3\n    const d = [d0, d1][r >>> 1]; // r = 2 or 3\n    const u = n.redDivSqrt(d);\n\n    if (u.redIsOdd() !== y.redIsOdd())\n      u.redINeg();\n\n    return u;\n  }\n\n  _svdwf(u) {\n    // Shallue-van de Woestijne Method.\n    //\n    // Distribution: 9/16.\n    //\n    // [SVDW1] Section 5.\n    // [SVDW2] Page 8, Section 3.\n    //         Page 15, Section 6, Algorithm 1.\n    // [H2EC] \"Shallue-van de Woestijne Method\".\n    //\n    // Assumptions:\n    //\n    //   - p = 1 (mod 3).\n    //   - a = 0, b != 0.\n    //   - Let z be a unique element in F(p).\n    //   - g((sqrt(-3 * z^2) - z) / 2) is square in F(p).\n    //   - u != 0, u != +-sqrt(-g(z)).\n    //\n    // Map:\n    //\n    //   g(x) = x^3 + b\n    //   c = sqrt(-3 * z^2)\n    //   t1 = u^2 + g(z)\n    //   t2 = 1 / (u^2 * t1)\n    //   t3 = u^4 * t2 * c\n    //   x1 = (c - z) / 2 - t3\n    //   x2 = t3 - (c + z) / 2\n    //   x3 = z - t1^3 * t2 / (3 * z^2)\n    //   x = x1, if g(x1) is square\n    //     = x2, if g(x2) is square\n    //     = x3, otherwise\n    //   y = sign(u) * abs(sqrt(g(x)))\n    const {c, z, zi, i2, i3} = this;\n    const gz = this.solveY2(z);\n    const z3 = i3.redMul(zi.redSqr());\n    const u2 = u.redSqr();\n    const u4 = u2.redSqr();\n    const t1 = u2.redAdd(gz);\n    const u2t1 = u2.redMul(t1);\n    const t2 = u2t1.isZero() ? u2t1 : u2t1.redInvert();\n    const t3 = u4.redMul(t2).redMul(c);\n    const t4 = t1.redSqr().redMul(t1);\n    const x1 = c.redSub(z).redMul(i2).redISub(t3);\n    const x2 = t3.redSub(c.redAdd(z).redMul(i2));\n    const x3 = z.redSub(t4.redMul(t2).redMul(z3));\n    const y1 = this.solveY2(x1);\n    const y2 = this.solveY2(x2);\n    const y3 = this.solveY2(x3);\n    const alpha = y1.redJacobi() | 1;\n    const beta = y2.redJacobi() | 1;\n    const i = mod((alpha - 1) * beta, 3);\n    const x = [x1, x2, x3][i];\n    const y = [y1, y2, y3][i];\n\n    return [x, y];\n  }\n\n  _svdw(u) {\n    const [x, yy] = this._svdwf(u);\n    const y = yy.redSqrt();\n\n    if (y.redIsOdd() !== u.redIsOdd())\n      y.redINeg();\n\n    return this.point(x, y);\n  }\n\n  _svdwi(p, hint) {\n    // Inverting the Map (Shallue-van de Woestijne).\n    //\n    // [SQUARED] Algorithm 1, Page 8, Section 3.3.\n    // [SVDW2] Page 12, Section 5.\n    // [SVDW3] \"Inverting the map\".\n    //\n    // Assumptions:\n    //\n    //   - If r = 1 then x != -(c + z) / 2.\n    //   - If r = 2 then x != (c - z) / 2.\n    //   - If r > 2 then (t0 - t1 + t2) is square in F(p).\n    //   - f(f^-1(x)) = x where f is the map function.\n    //\n    // We use the sampling method from [SVDW2],\n    // _not_ [SQUARED]. This seems to have a\n    // better distribution in practice.\n    //\n    // Note that [SVDW3] also appears to be\n    // incorrect in terms of distribution.\n    //\n    // The distribution of f(u), assuming u is\n    // random, is (1/2, 1/4, 1/4).\n    //\n    // To mirror this, f^-1(x) should simply\n    // pick (1/2, 1/4, 1/8, 1/8).\n    //\n    // To anyone running the forward map, our\n    // strings will appear to be random.\n    //\n    // Map:\n    //\n    //   g(x) = x^3 + b\n    //   c = sqrt(-3 * z^2)\n    //   t0 = 9 * (x^2 * z^2 + z^4)\n    //   t1 = 18 * x * z^3\n    //   t2 = 12 * g(z) * (x - z)\n    //   t3 = sqrt(t0 - t1 + t2)\n    //   t4 = t3 * z\n    //   u1 = g(z) * (c - 2 * x - z) / (c + 2 * x + z)\n    //   u2 = g(z) * (c + 2 * x + z) / (c - 2 * x - z)\n    //   u3 = (3 * (z^3 - x * z^2) - 2 * g(z) + t4) / 2\n    //   u4 = (3 * (z^3 - x * z^2) - 2 * g(z) - t4) / 2\n    //   r = random integer in [1,4]\n    //   u = sign(y) * abs(sqrt(ur))\n    const {b, c, z, zero, two} = this;\n    const {x, y} = p;\n    const r = hint & 3;\n    const z2 = z.redSqr();\n    const z3 = z2.redMul(z);\n    const z4 = z2.redSqr();\n    const gz = z3.redAdd(b);\n    const gz2 = gz.redMuln(2);\n    const xx = x.redSqr();\n    const x2z = x.redMuln(2).redIAdd(z);\n    const xz2 = x.redMul(z2);\n    const c0 = c.redSub(x2z);\n    const c1 = c.redAdd(x2z);\n    const t0 = xx.redMul(z2).redIAdd(z4).redIMuln(9);\n    const t1 = x.redMul(z3).redIMuln(18);\n    const t2 = gz.redMul(x.redSub(z)).redIMuln(12);\n    const t3 = r >= 2 ? t0.redISub(t1).redIAdd(t2).redSqrt() : zero;\n    const t4 = t3.redMul(z);\n    const t5 = z3.redISub(xz2).redIMuln(3).redISub(gz2);\n    const n0 = gz.redMul(c0);\n    const n1 = gz.redMul(c1);\n    const n2 = t5.redAdd(t4);\n    const n3 = t5.redSub(t4);\n    const d2 = two;\n    const n = [n0, n1, n2, n3][r];\n    const d = [c1, c0, d2, d2][r];\n    const u = n.redDivSqrt(d);\n    const [x0] = this._svdwf(u);\n\n    if (!x0.eq(x))\n      throw new Error('Invalid point.');\n\n    if (u.redIsOdd() !== y.redIsOdd())\n      u.redINeg();\n\n    return u;\n  }\n\n  isElliptic() {\n    const {a, b} = this;\n    const a2 = a.redSqr();\n    const a3 = a2.redMul(a);\n    const b2 = b.redSqr();\n    const d = b2.redMuln(27).redIAdd(a3.redMuln(4));\n\n    // 4 * a^3 + 27 * b^2 != 0\n    return !d.isZero();\n  }\n\n  jinv() {\n    // [ARITH1] Page 71, Section 4.4.\n    // http://mathworld.wolfram.com/j-Invariant.html\n    const {a, b} = this;\n    const a2 = a.redSqr();\n    const a3 = a2.redMul(a);\n    const b2 = b.redSqr();\n    const t0 = a3.redMuln(4);\n    const lhs = t0.redMuln(1728);\n    const rhs = b2.redMuln(27).redIAdd(t0);\n\n    if (rhs.isZero())\n      throw new Error('Curve is not elliptic.');\n\n    // (1728 * 4 * a^3) / (4 * a^3 + 27 * b^2)\n    return lhs.redDiv(rhs).fromRed();\n  }\n\n  point(x, y) {\n    return new ShortPoint(this, x, y);\n  }\n\n  jpoint(x, y, z) {\n    return new JPoint(this, x, y, z);\n  }\n\n  solveX(y) {\n    assert(y instanceof BN);\n\n    if (!this.a.isZero())\n      throw new Error('Not implemented.');\n\n    // x^3 = y^2 - b\n    const y2 = y.redSqr();\n    const x3 = y2.redSub(this.b);\n\n    return cubeRoots(x3);\n  }\n\n  solveY2(x) {\n    // [GECC] Page 89, Section 3.2.2.\n    // https://hyperelliptic.org/EFD/g1p/auto-shortw.html\n    assert(x instanceof BN);\n\n    // y^2 = x^3 + a * x + b\n    const x3 = x.redSqr().redMul(x);\n    const y2 = x3.redIAdd(this.b);\n\n    if (!this.zeroA) {\n      // Save some cycles for a = -3.\n      if (this.threeA)\n        y2.redIAdd(x.redMuln(-3));\n      else\n        y2.redIAdd(this.a.redMul(x));\n    }\n\n    return y2;\n  }\n\n  validate(point) {\n    assert(point instanceof ShortPoint);\n\n    if (point.inf)\n      return true;\n\n    const {x, y} = point;\n    const y2 = this.solveY2(x);\n\n    return y.redSqr().eq(y2);\n  }\n\n  pointFromX(x, sign = null) {\n    assert(x instanceof BN);\n    assert(sign == null || typeof sign === 'boolean');\n\n    if (!x.red)\n      x = x.toRed(this.red);\n\n    const y = this.solveY(x);\n\n    if (sign != null) {\n      if (this.h.cmpn(1) > 0) {\n        if (y.isZero() && sign)\n          throw new Error('Invalid point.');\n      }\n\n      if (y.redIsOdd() !== sign)\n        y.redINeg();\n    }\n\n    return this.point(x, y);\n  }\n\n  pointFromY(y, index = 0) {\n    assert(y instanceof BN);\n    assert((index >>> 0) === index);\n\n    if (!y.red)\n      y = y.toRed(this.red);\n\n    const coords = this.solveX(y);\n\n    if (index >= coords.length)\n      throw new Error('Invalid X coordinate index.');\n\n    const x = coords[index];\n\n    return this.point(x, y);\n  }\n\n  isIsomorphic(curve) {\n    // [GECC] Page 84, Section 3.1.5.\n    // [ARITH1] Page 286, Section 13.2.3.c.\n    assert(curve instanceof Curve);\n\n    if (!curve.p.eq(this.p))\n      return false;\n\n    let u2, u3;\n    try {\n      [u2, u3] = this._scale(curve);\n    } catch (e) {\n      return false;\n    }\n\n    // E(a,b) <-> E(au^4,bu^6)\n    if (curve.type === 'short') {\n      // a' = a * u^4, b' = b * u^6\n      const a = this.field(curve.a).redMul(u2.redSqr());\n      const b = this.field(curve.b).redMul(u3.redSqr());\n\n      return this.a.eq(a) && this.b.eq(b);\n    }\n\n    // E(a,b) <-> M(A,B)\n    if (curve.type === 'mont') {\n      // (A / (3 * B))^3 + a * (A / (3 * B)) + b = 0\n      const {a3, bi} = curve;\n      const x = this.field(a3.redMul(bi)).redMul(u2);\n      const y2 = this.solveY2(x);\n\n      return y2.isZero();\n    }\n\n    // E(a,b) <-> E(a,d)\n    if (curve.type === 'edwards') {\n      // ((a' + d') / 6)^3 + a * ((a' + d') / 6) + b = 0\n      const x = this.field(curve.ad6).redMul(u2);\n      const y2 = this.solveY2(x);\n\n      return y2.isZero();\n    }\n\n    return false;\n  }\n\n  isIsogenous(curve) {\n    assert(curve instanceof Curve);\n    return false;\n  }\n\n  pointFromShort(point) {\n    // [GECC] Page 84, Section 3.1.5.\n    // [ALT] Appendix F.3 (Isomorphic Mapping between Weierstrass Curves).\n    assert(point instanceof ShortPoint);\n\n    if (this.isIsomorphic(point.curve)) {\n      // Isomorphic maps for E(a,b)<->E(au^4,bu^6):\n      //\n      //   x' = x * u^2\n      //   y' = y * u^3\n      //\n      // Where a * u^4 = a' and b * u^6 = b'.\n      if (point.isInfinity())\n        return this.point();\n\n      const [u2, u3] = this._scale(point.curve);\n      const x = this.field(point.x);\n      const y = this.field(point.y);\n      const nx = x.redMul(u2);\n      const ny = y.redMul(u3);\n\n      return this.point(nx, ny);\n    }\n\n    throw new Error('Not implemented.');\n  }\n\n  pointFromMont(point) {\n    // [ALT] Appendix E.2 (Switching between Alternative Representations).\n    // [MONT2] \"Equivalence with Weierstrass curves\"\n    assert(point instanceof MontPoint);\n\n    if (this.isIsomorphic(point.curve)) {\n      // Equivalence for M(A,B)->E(a,b):\n      //\n      //   x = (u + A / 3) / B\n      //   y = v / B\n      //\n      // Undefined if ((u^3 + A * u^2 + u) / B) is not square.\n      if (point.isInfinity())\n        return this.point();\n\n      const {a3, bi} = point.curve;\n      const [u2, u3] = this._scale(point.curve);\n      const nx = point.x.redAdd(a3).redMul(bi);\n      const ny = point.y.redMul(bi);\n\n      return this.point(this.field(nx).redMul(u2),\n                        this.field(ny).redMul(u3));\n    }\n\n    throw new Error('Not implemented.');\n  }\n\n  pointFromEdwards(point) {\n    // [TWISTEQ] Section 2.\n    assert(point instanceof EdwardsPoint);\n\n    if (this.isIsomorphic(point.curve)) {\n      // Equivalence for E(a,d)->E(a',b'):\n      //\n      //   x' = ((5 * d - a) * y + d - 5 * a) / (12 * (y - 1))\n      //   y' = (d - a) * (y + 1) / (4 * x * (y - 1))\n      //\n      // Undefined for x = 0 or y = 1.\n      //\n      // Exceptional Cases:\n      //   - (0, 1) -> O\n      //   - (0, -1) -> ((a + d) / 6, 0)\n      //\n      // Unexceptional Cases:\n      //   - (sqrt(1 / a), 0) -> ((5 * a - d) / 12, (a - d) / 4 * sqrt(a))\n      const {a, d, ad6} = point.curve;\n      const [u2, u3] = this._scale(point.curve);\n\n      if (point.isInfinity())\n        return this.point();\n\n      if (point.x.isZero()) {\n        const x = this.field(ad6).redMul(u2);\n        return this.point(x, this.zero);\n      }\n\n      const {x, y, z} = point;\n      const a5 = a.redMuln(5);\n      const d5 = d.redMuln(5);\n      const dma = d.redSub(a);\n      const d5a = d5.redSub(a);\n      const da5 = d.redSub(a5);\n      const ypz = y.redAdd(z);\n      const ymz = y.redSub(z);\n      const xx = d5a.redMul(y).redIAdd(da5.redMul(z));\n      const xz = ymz.redMuln(12);\n      const yy = dma.redMul(ypz).redMul(z);\n      const yz = ymz.redMul(x).redIMuln(4);\n\n      return this.cpoint(this.field(xx).redMul(u2),\n                         this.field(xz),\n                         this.field(yy).redMul(u3),\n                         this.field(yz));\n    }\n\n    throw new Error('Not implemented.');\n  }\n\n  pointFromUniform(u) {\n    assert(u instanceof BN);\n\n    // z = 0 or b = 0\n    if (this.z.isZero() || this.b.isZero())\n      throw new Error('Not implemented.');\n\n    // a != 0, b != 0\n    if (!this.a.isZero())\n      return this._sswu(u);\n\n    // p = 1 mod 3, a = 0, b != 0\n    if (!this.c.isZero())\n      return this._svdw(u);\n\n    throw new Error('Not implemented.');\n  }\n\n  pointToUniform(p, hint) {\n    // Convert a short weierstrass point to a field\n    // element by inverting either the SSWU or SVDW\n    // map.\n    //\n    // Hint Layout:\n    //\n    //   [00000000] [0000] [0000]\n    //        |        |      |\n    //        |        |      +-- preimage index\n    //        |        +--- subgroup\n    //        +-- bits to OR with uniform bytes\n    assert(p instanceof ShortPoint);\n    assert((hint >>> 0) === hint);\n\n    // z = 0 or b = 0\n    if (this.z.isZero() || this.b.isZero())\n      throw new Error('Not implemented.');\n\n    // P = O\n    if (p.isInfinity())\n      throw new Error('Invalid point.');\n\n    // Add a random torsion component.\n    const i = ((hint >>> 4) & 15) % this.torsion.length;\n    const q = p.add(this.torsion[i]);\n\n    return wrapErrors(() => {\n      // a != 0, b != 0\n      if (!this.a.isZero())\n        return this._sswui(q, hint);\n\n      // p = 1 mod 3, a = 0, b != 0\n      if (!this.c.isZero())\n        return this._svdwi(q, hint);\n\n      throw new Error('Not implemented.');\n    });\n  }\n\n  mulAll(points, coeffs) {\n    return super.mulAll(points, coeffs).toP();\n  }\n\n  affinizeAll(points) {\n    const out = this.normalizeAll(points);\n\n    for (let i = 0; i < out.length; i++)\n      out[i] = out[i].toP();\n\n    return out;\n  }\n\n  decodePoint(bytes) {\n    return ShortPoint.decode(this, bytes);\n  }\n\n  encodeX(point) {\n    assert(point instanceof Point);\n    return point.encodeX();\n  }\n\n  decodeEven(bytes) {\n    return ShortPoint.decodeEven(this, bytes);\n  }\n\n  decodeSquare(bytes) {\n    return ShortPoint.decodeSquare(this, bytes);\n  }\n\n  toShort(a0, odd, sign = null) {\n    const [a, b] = this._short(a0, odd);\n\n    const curve = new ShortCurve({\n      red: this.red,\n      prime: this.prime,\n      p: this.p,\n      a: a,\n      b: b,\n      n: this.n,\n      h: this.h\n    });\n\n    if (sign != null) {\n      const [, u3] = curve._scale(this);\n\n      if (u3.redIsOdd() !== sign)\n        u3.redINeg();\n    }\n\n    if (!this.g.isInfinity())\n      curve.g = curve.pointFromShort(this.g);\n\n    for (let i = 0; i < this.h.word(0); i++)\n      curve.torsion[i] = curve.pointFromShort(this.torsion[i]);\n\n    return curve;\n  }\n\n  toMont(b0, odd, sign = null) {\n    const [a, b] = this._mont(b0, odd);\n\n    const curve = new MontCurve({\n      red: this.red,\n      prime: this.prime,\n      p: this.p,\n      a: a,\n      b: b,\n      n: this.n,\n      h: this.h\n    });\n\n    if (sign != null) {\n      const [, u3] = this._scale(curve);\n\n      if (u3.redIsOdd() !== sign)\n        u3.redINeg();\n    }\n\n    if (!this.g.isInfinity())\n      curve.g = curve.pointFromShort(this.g);\n\n    for (let i = 0; i < this.h.word(0); i++)\n      curve.torsion[i] = curve.pointFromShort(this.torsion[i]);\n\n    return curve;\n  }\n\n  toEdwards(a0, odd, sign = null) {\n    const [a, d] = this._edwards(a0, odd);\n\n    const curve = new EdwardsCurve({\n      red: this.red,\n      prime: this.prime,\n      p: this.p,\n      a: a,\n      d: d,\n      n: this.n,\n      h: this.h\n    });\n\n    if (sign != null) {\n      const [, u3] = this._scale(curve);\n\n      if (u3.redIsOdd() !== sign)\n        u3.redINeg();\n    }\n\n    if (!this.g.isInfinity()) {\n      curve.g = curve.pointFromShort(this.g);\n      curve.g.normalize();\n    }\n\n    if (curve.isComplete()) {\n      for (let i = 0; i < this.h.word(0); i++) {\n        curve.torsion[i] = curve.pointFromShort(this.torsion[i]);\n        curve.torsion[i].normalize();\n      }\n    }\n\n    return curve;\n  }\n\n  pointFromJSON(json) {\n    return ShortPoint.fromJSON(this, json);\n  }\n\n  toJSON(pre) {\n    const json = super.toJSON(pre);\n\n    json.a = this.a.fromRed().toJSON();\n    json.b = this.b.fromRed().toJSON();\n\n    if (!this.c.isZero())\n      json.c = this.c.fromRed().toJSON();\n\n    return json;\n  }\n}\n\n/**\n * ShortPoint\n */\n\nclass ShortPoint extends Point {\n  constructor(curve, x, y) {\n    assert(curve instanceof ShortCurve);\n\n    super(curve, types.AFFINE);\n\n    this.x = this.curve.zero;\n    this.y = this.curve.zero;\n    this.inf = true;\n\n    if (x != null)\n      this._init(x, y);\n  }\n\n  _init(x, y) {\n    assert(x instanceof BN);\n    assert(y instanceof BN);\n\n    this.x = x;\n    this.y = y;\n\n    if (!this.x.red)\n      this.x = this.x.toRed(this.curve.red);\n\n    if (!this.y.red)\n      this.y = this.y.toRed(this.curve.red);\n\n    this.inf = false;\n  }\n\n  _getBeta() {\n    if (!this.curve.endo)\n      return null;\n\n    if (this.pre && this.pre.beta)\n      return this.pre.beta;\n\n    // Augment the point with our beta value.\n    // This is the counterpart to `k2` after\n    // the endomorphism split of `k`.\n    //\n    // Note that if we have precomputation,\n    // we have to clone and update all of the\n    // precomputed points below.\n    const xb = this.x.redMul(this.curve.endo.beta);\n    const beta = this.curve.point(xb, this.y);\n\n    if (this.pre) {\n      beta.pre = this.pre.map((point) => {\n        const xb = point.x.redMul(this.curve.endo.beta);\n        return this.curve.point(xb, point.y);\n      });\n\n      this.pre.beta = beta;\n    }\n\n    return beta;\n  }\n\n  _getJNAF(point) {\n    assert(point instanceof ShortPoint);\n\n    if (this.inf || point.inf)\n      return super._getJNAF(point);\n\n    // Create comb for JSF.\n    const comb = [\n      this, // 1\n      null, // 3\n      null, // 5\n      point // 7\n    ];\n\n    // Try to avoid Jacobian points, if possible.\n    if (this.y.eq(point.y)) {\n      comb[1] = this.add(point);\n      comb[2] = this.toJ().sub(point);\n    } else if (this.y.eq(point.y.redNeg())) {\n      comb[1] = this.toJ().add(point);\n      comb[2] = this.sub(point);\n    } else {\n      comb[1] = this.toJ().add(point);\n      comb[2] = this.toJ().sub(point);\n    }\n\n    return comb;\n  }\n\n  clone() {\n    if (this.inf)\n      return this.curve.point();\n\n    return this.curve.point(this.x, this.y);\n  }\n\n  scale(a) {\n    return this.toJ().scale(a);\n  }\n\n  neg() {\n    // P = O\n    if (this.inf)\n      return this;\n\n    // -(X1, Y1) = (X1, -Y1)\n    return this.curve.point(this.x, this.y.redNeg());\n  }\n\n  add(p) {\n    // [GECC] Page 80, Section 3.1.2.\n    //\n    // Addition Law:\n    //\n    //   l = (y1 - y2) / (x1 - x2)\n    //   x3 = l^2 - x1 - x2\n    //   y3 = l * (x1 - x3) - y1\n    //\n    // 1I + 2M + 1S + 6A\n    assert(p instanceof ShortPoint);\n\n    // O + P = P\n    if (this.inf)\n      return p;\n\n    // P + O = P\n    if (p.inf)\n      return this;\n\n    // P + P, P + -P\n    if (this.x.eq(p.x)) {\n      // P + -P = O\n      if (!this.y.eq(p.y))\n        return this.curve.point();\n\n      // P + P = 2P\n      return this.dbl();\n    }\n\n    // X1 != X2, Y1 = Y2\n    if (this.y.eq(p.y)) {\n      // X3 = -X1 - X2\n      const nx = this.x.redNeg().redISub(p.x);\n\n      // Y3 = -Y1\n      const ny = this.y.redNeg();\n\n      // Skip the inverse.\n      return this.curve.point(nx, ny);\n    }\n\n    // H = X1 - X2\n    const h = this.x.redSub(p.x);\n\n    // R = Y1 - Y2\n    const r = this.y.redSub(p.y);\n\n    // L = R / H\n    const l = r.redDiv(h);\n\n    // X3 = L^2 - X1 - X2\n    const nx = l.redSqr().redISub(this.x).redISub(p.x);\n\n    // Y3 = L * (X1 - X3) - Y1\n    const ny = l.redMul(this.x.redSub(nx)).redISub(this.y);\n\n    return this.curve.point(nx, ny);\n  }\n\n  dbl() {\n    // [GECC] Page 80, Section 3.1.2.\n    //\n    // Addition Law (doubling):\n    //\n    //   l = (3 * x1^2 + a) / (2 * y1)\n    //   x3 = l^2 - 2 * x1\n    //   y3 = l * (x1 - x3) - y1\n    //\n    // 1I + 2M + 2S + 3A + 2*2 + 1*3\n\n    // P = O\n    if (this.inf)\n      return this;\n\n    // Y1 = 0\n    if (this.y.isZero())\n      return this.curve.point();\n\n    // XX = X1^2\n    const xx = this.x.redSqr();\n\n    // M = 3 * XX + a\n    const m = xx.redIMuln(3).redIAdd(this.curve.a);\n\n    // Z = 2 * Y1\n    const z = this.y.redMuln(2);\n\n    // L = M / Z\n    const l = m.redDiv(z);\n\n    // X3 = L^2 - 2 * X1\n    const nx = l.redSqr().redISub(this.x).redISub(this.x);\n\n    // Y3 = L * (X1 - X3) - Y1\n    const ny = l.redMul(this.x.redSub(nx)).redISub(this.y);\n\n    return this.curve.point(nx, ny);\n  }\n\n  dblp(pow) {\n    return this.toJ().dblp(pow).toP();\n  }\n\n  getX() {\n    if (this.inf)\n      throw new Error('Invalid point.');\n\n    return this.x.fromRed();\n  }\n\n  getY() {\n    if (this.inf)\n      throw new Error('Invalid point.');\n\n    return this.y.fromRed();\n  }\n\n  eq(p) {\n    assert(p instanceof ShortPoint);\n\n    // P = Q\n    if (this === p)\n      return true;\n\n    // P = O\n    if (this.inf)\n      return p.inf;\n\n    // Q = O\n    if (p.inf)\n      return false;\n\n    // X1 = X2, Y1 = Y2\n    return this.x.eq(p.x)\n        && this.y.eq(p.y);\n  }\n\n  cmp(point) {\n    assert(point instanceof ShortPoint);\n\n    if (this.inf && !point.inf)\n      return -1;\n\n    if (!this.inf && point.inf)\n      return 1;\n\n    if (this.inf && point.inf)\n      return 0;\n\n    return this.order().cmp(point.order())\n        || this.getX().cmp(point.getX())\n        || this.getY().cmp(point.getY());\n  }\n\n  isInfinity() {\n    // Infinity cannot be represented in\n    // the affine space, except by a flag.\n    return this.inf;\n  }\n\n  isOrder2() {\n    if (this.inf)\n      return false;\n\n    return this.y.isZero();\n  }\n\n  isOdd() {\n    if (this.inf)\n      return false;\n\n    return this.y.redIsOdd();\n  }\n\n  isEven() {\n    if (this.inf)\n      return false;\n\n    return this.y.redIsEven();\n  }\n\n  isSquare() {\n    if (this.inf)\n      return false;\n\n    return this.y.redJacobi() !== -1;\n  }\n\n  eqX(x) {\n    assert(x instanceof BN);\n    assert(!x.red);\n\n    if (this.inf)\n      return false;\n\n    return this.getX().eq(x);\n  }\n\n  eqR(x) {\n    assert(x instanceof BN);\n    assert(!x.red);\n    assert(!this.curve.n.isZero());\n\n    if (this.inf)\n      return false;\n\n    return this.getX().imod(this.curve.n).eq(x);\n  }\n\n  mul(k) {\n    return super.mul(k).toP();\n  }\n\n  muln(k) {\n    return super.muln(k).toP();\n  }\n\n  mulBlind(k, rng) {\n    return super.mulBlind(k, rng).toP();\n  }\n\n  mulAdd(k1, p2, k2) {\n    return super.mulAdd(k1, p2, k2).toP();\n  }\n\n  mulH() {\n    return super.mulH().toP();\n  }\n\n  div(k) {\n    return super.div(k).toP();\n  }\n\n  divn(k) {\n    return super.divn(k).toP();\n  }\n\n  divH() {\n    return super.divH().toP();\n  }\n\n  toP() {\n    return this;\n  }\n\n  toJ() {\n    // (X3, Y3, Z3) = (1, 1, 0)\n    if (this.inf)\n      return this.curve.jpoint();\n\n    // (X3, Y3, Z3) = (X1, Y1, 1)\n    return this.curve.jpoint(this.x, this.y, this.curve.one);\n  }\n\n  encode(compact) {\n    // [SEC1] Page 10, Section 2.3.3.\n    if (compact == null)\n      compact = true;\n\n    assert(typeof compact === 'boolean');\n\n    const {fieldSize} = this.curve;\n\n    // We do not serialize points at infinity.\n    if (this.inf)\n      throw new Error('Invalid point.');\n\n    // Compressed form (0x02 = even, 0x03 = odd).\n    if (compact) {\n      const p = Buffer.alloc(1 + fieldSize);\n      const x = this.curve.encodeField(this.getX());\n\n      p[0] = 0x02 | this.y.redIsOdd();\n      x.copy(p, 1);\n\n      return p;\n    }\n\n    // Uncompressed form (0x04).\n    const p = Buffer.alloc(1 + fieldSize * 2);\n    const x = this.curve.encodeField(this.getX());\n    const y = this.curve.encodeField(this.getY());\n\n    p[0] = 0x04;\n    x.copy(p, 1);\n    y.copy(p, 1 + fieldSize);\n\n    return p;\n  }\n\n  static decode(curve, bytes) {\n    // [SEC1] Page 11, Section 2.3.4.\n    assert(curve instanceof ShortCurve);\n    assert(Buffer.isBuffer(bytes));\n\n    const len = curve.fieldSize;\n\n    if (bytes.length < 1 + len)\n      throw new Error('Not a point.');\n\n    // Point forms:\n    //\n    //   0x00 -> Infinity (openssl, unsupported)\n    //   0x02 -> Compressed Even\n    //   0x03 -> Compressed Odd\n    //   0x04 -> Uncompressed\n    //   0x06 -> Hybrid Even (openssl)\n    //   0x07 -> Hybrid Odd (openssl)\n    //\n    // Note that openssl supports serializing points\n    // at infinity as {0}. We choose not to support it\n    // because it's strange and not terribly useful.\n    const form = bytes[0];\n\n    switch (form) {\n      case 0x02:\n      case 0x03: {\n        if (bytes.length !== 1 + len)\n          throw new Error('Invalid point size for compressed.');\n\n        const x = curve.decodeField(bytes.slice(1, 1 + len));\n\n        if (x.cmp(curve.p) >= 0)\n          throw new Error('Invalid point.');\n\n        const p = curve.pointFromX(x, form === 0x03);\n\n        assert(!p.isInfinity());\n\n        return p;\n      }\n\n      case 0x04:\n      case 0x06:\n      case 0x07: {\n        if (bytes.length !== 1 + len * 2)\n          throw new Error('Invalid point size for uncompressed.');\n\n        const x = curve.decodeField(bytes.slice(1, 1 + len));\n        const y = curve.decodeField(bytes.slice(1 + len, 1 + 2 * len));\n\n        // [GECC] Algorithm 4.3, Page 180, Section 4.\n        if (x.cmp(curve.p) >= 0 || y.cmp(curve.p) >= 0)\n          throw new Error('Invalid point.');\n\n        // OpenSSL hybrid encoding.\n        if (form !== 0x04 && form !== (0x06 | y.isOdd()))\n          throw new Error('Invalid hybrid encoding.');\n\n        const p = curve.point(x, y);\n\n        if (!p.validate())\n          throw new Error('Invalid point.');\n\n        assert(!p.isInfinity());\n\n        return p;\n      }\n\n      default: {\n        throw new Error('Unknown point format.');\n      }\n    }\n  }\n\n  encodeX() {\n    // [SCHNORR] \"Specification\".\n    // [BIP340] \"Specification\".\n    return this.curve.encodeField(this.getX());\n  }\n\n  static decodeEven(curve, bytes) {\n    // [BIP340] \"Specification\".\n    assert(curve instanceof ShortCurve);\n\n    const x = curve.decodeField(bytes);\n\n    if (x.cmp(curve.p) >= 0)\n      throw new Error('Invalid point.');\n\n    return curve.pointFromX(x, false);\n  }\n\n  static decodeSquare(curve, bytes) {\n    // [SCHNORR] \"Specification\".\n    assert(curve instanceof ShortCurve);\n\n    const x = curve.decodeField(bytes);\n\n    if (x.cmp(curve.p) >= 0)\n      throw new Error('Invalid point.');\n\n    return curve.pointFromX(x);\n  }\n\n  toJSON(pre) {\n    if (this.inf)\n      return [];\n\n    const x = this.getX().toJSON();\n    const y = this.getY().toJSON();\n\n    if (pre === true && this.pre)\n      return [x, y, this.pre.toJSON()];\n\n    return [x, y];\n  }\n\n  toPretty() {\n    if (this.inf)\n      return [];\n\n    const size = this.curve.fieldSize * 2;\n    const x = toPretty(this.getX(), size);\n    const y = toPretty(this.getY(), size);\n\n    return [x, y];\n  }\n\n  static fromJSON(curve, json) {\n    assert(curve instanceof ShortCurve);\n    assert(Array.isArray(json));\n    assert(json.length === 0\n        || json.length === 2\n        || json.length === 3);\n\n    if (json.length === 0)\n      return curve.point();\n\n    const x = BN.fromJSON(json[0]);\n    const y = BN.fromJSON(json[1]);\n    const point = curve.point(x, y);\n\n    if (json.length > 2 && json[2] != null)\n      point.pre = Precomp.fromJSON(point, json[2]);\n\n    return point;\n  }\n\n  [custom]() {\n    if (this.inf)\n      return '<ShortPoint: Infinity>';\n\n    return '<ShortPoint:'\n         + ' x=' + this.x.fromRed().toString(16, 2)\n         + ' y=' + this.y.fromRed().toString(16, 2)\n         + '>';\n  }\n}\n\n/**\n * JPoint\n */\n\nclass JPoint extends Point {\n  constructor(curve, x, y, z) {\n    assert(curve instanceof ShortCurve);\n\n    super(curve, types.JACOBIAN);\n\n    this.x = this.curve.one;\n    this.y = this.curve.one;\n    this.z = this.curve.zero;\n    this.zOne = false;\n\n    if (x != null)\n      this._init(x, y, z);\n  }\n\n  _init(x, y, z) {\n    assert(x instanceof BN);\n    assert(y instanceof BN);\n    assert(z == null || (z instanceof BN));\n\n    this.x = x;\n    this.y = y;\n    this.z = z || this.curve.one;\n\n    if (!this.x.red)\n      this.x = this.x.toRed(this.curve.red);\n\n    if (!this.y.red)\n      this.y = this.y.toRed(this.curve.red);\n\n    if (!this.z.red)\n      this.z = this.z.toRed(this.curve.red);\n\n    this.zOne = this.z.eq(this.curve.one);\n  }\n\n  clone() {\n    return this.curve.jpoint(this.x, this.y, this.z);\n  }\n\n  validate() {\n    // [GECC] Example 3.20, Page 88, Section 3.\n    const {a, b} = this.curve;\n\n    // P = O\n    if (this.isInfinity())\n      return true;\n\n    // Z1 = 1\n    if (this.zOne)\n      return this.curve.validate(this.toP());\n\n    // y^2 = x^3 + a * x * z^4 + b * z^6\n    const lhs = this.y.redSqr();\n    const x3 = this.x.redSqr().redMul(this.x);\n    const z2 = this.z.redSqr();\n    const z4 = z2.redSqr();\n    const z6 = z4.redMul(z2);\n    const rhs = x3.redIAdd(b.redMul(z6));\n\n    if (!this.curve.zeroA) {\n      // Save some cycles for a = -3.\n      if (this.curve.threeA)\n        rhs.redIAdd(z4.redIMuln(-3).redMul(this.x));\n      else\n        rhs.redIAdd(a.redMul(z4).redMul(this.x));\n    }\n\n    return lhs.eq(rhs);\n  }\n\n  normalize() {\n    // https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian.html#scaling-z\n    // 1I + 3M + 1S\n\n    // Z = 1\n    if (this.zOne)\n      return this;\n\n    // P = O\n    if (this.isInfinity())\n      return this;\n\n    // A = 1 / Z1\n    const a = this.z.redInvert();\n\n    // AA = A^2\n    const aa = a.redSqr();\n\n    // X3 = X1 * AA\n    this.x = this.x.redMul(aa);\n\n    // Y3 = Y1 * AA * A\n    this.y = this.y.redMul(aa).redMul(a);\n\n    // Z3 = 1\n    this.z = this.curve.one;\n    this.zOne = true;\n\n    return this;\n  }\n\n  scale(a) {\n    assert(a instanceof BN);\n\n    // P = O\n    if (this.isInfinity())\n      return this.curve.jpoint();\n\n    // AA = A^2\n    const aa = a.redSqr();\n\n    // X3 = X1 * AA\n    const nx = this.x.redMul(aa);\n\n    // Y3 = Y1 * AA * A\n    const ny = this.y.redMul(aa).redMul(a);\n\n    // Z3 = Z1 * A\n    const nz = this.z.redMul(a);\n\n    return this.curve.jpoint(nx, ny, nz);\n  }\n\n  neg() {\n    // -(X1, Y1, Z1) = (X1, -Y1, Z1)\n    return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n  }\n\n  add(p) {\n    assert(p instanceof Point);\n\n    if (p.type === types.AFFINE)\n      return this._mixedAdd(p);\n\n    return this._add(p);\n  }\n\n  _add(p) {\n    assert(p instanceof JPoint);\n\n    // O + P = P\n    if (this.isInfinity())\n      return p;\n\n    // P + O = P\n    if (p.isInfinity())\n      return this;\n\n    // Z1 = 1\n    if (this.zOne)\n      return p._addJA(this);\n\n    // Z2 = 1\n    if (p.zOne)\n      return this._addJA(p);\n\n    return this._addJJ(p);\n  }\n\n  _mixedAdd(p) {\n    assert(p instanceof ShortPoint);\n\n    // O + P = P\n    if (this.isInfinity())\n      return p.toJ();\n\n    // P + O = P\n    if (p.isInfinity())\n      return this;\n\n    return this._addJA(p);\n  }\n\n  _addJJ(p) {\n    // No assumptions.\n    // https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian.html#addition-add-1998-cmo-2\n    // 12M + 4S + 6A + 1*2 (implemented as: 12M + 4S + 7A)\n\n    // Z1Z1 = Z1^2\n    const z1z1 = this.z.redSqr();\n\n    // Z2Z2 = Z2^2\n    const z2z2 = p.z.redSqr();\n\n    // U1 = X1 * Z2Z2\n    const u1 = this.x.redMul(z2z2);\n\n    // U2 = X2 * Z1Z1\n    const u2 = p.x.redMul(z1z1);\n\n    // S1 = Y1 * Z2 * Z2Z2\n    const s1 = this.y.redMul(p.z).redMul(z2z2);\n\n    // S2 = Y2 * Z1 * Z1Z1\n    const s2 = p.y.redMul(this.z).redMul(z1z1);\n\n    // H = U2 - U1\n    const h = u2.redISub(u1);\n\n    // r = S2 - S1\n    const r = s2.redISub(s1);\n\n    // H = 0\n    if (h.isZero()) {\n      if (!r.isZero())\n        return this.curve.jpoint();\n\n      return this.dbl();\n    }\n\n    // HH = H^2\n    const hh = h.redSqr();\n\n    // HHH = H * HH\n    const hhh = h.redMul(hh);\n\n    // V = U1 * HH\n    const v = u1.redMul(hh);\n\n    // X3 = r^2 - HHH - 2 * V\n    const nx = r.redSqr().redISub(hhh).redISub(v).redISub(v);\n\n    // Y3 = r * (V - X3) - S1 * HHH\n    const ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(hhh));\n\n    // Z3 = Z1 * Z2 * H\n    const nz = this.z.redMul(p.z).redMul(h);\n\n    return this.curve.jpoint(nx, ny, nz);\n  }\n\n  _addJA(p) {\n    // Assumes Z2 = 1.\n    // https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian.html#addition-madd\n    // 8M + 3S + 6A + 5*2 (implemented as: 8M + 3S + 7A + 4*2)\n\n    // Z1Z1 = Z1^2\n    const z1z1 = this.z.redSqr();\n\n    // U2 = X2 * Z1Z1\n    const u2 = p.x.redMul(z1z1);\n\n    // S2 = Y2 * Z1 * Z1Z1\n    const s2 = p.y.redMul(this.z).redMul(z1z1);\n\n    // H = U2 - X1\n    const h = u2.redISub(this.x);\n\n    // r = 2 * (S2 - Y1)\n    const r = s2.redISub(this.y).redIMuln(2);\n\n    // H = 0\n    if (h.isZero()) {\n      if (!r.isZero())\n        return this.curve.jpoint();\n\n      return this.dbl();\n    }\n\n    // I = (2 * H)^2\n    const i = h.redMuln(2).redSqr();\n\n    // J = H * I\n    const j = h.redMul(i);\n\n    // V = X1 * I\n    const v = this.x.redMul(i);\n\n    // X3 = r^2 - J - 2 * V\n    const nx = r.redSqr().redISub(j).redISub(v).redISub(v);\n\n    // Y3 = r * (V - X3) - 2 * Y1 * J\n    const ny = r.redMul(v.redISub(nx)).redISub(this.y.redMul(j).redIMuln(2));\n\n    // Z3 = 2 * Z1 * H\n    const nz = this.z.redMul(h).redIMuln(2);\n\n    return this.curve.jpoint(nx, ny, nz);\n  }\n\n  dbl() {\n    // P = O\n    if (this.isInfinity())\n      return this;\n\n    // Y1 = 0\n    if (this.y.isZero())\n      return this.curve.jpoint();\n\n    // a = 0\n    if (this.curve.zeroA)\n      return this._dbl0();\n\n    // a = -3\n    if (this.curve.threeA)\n      return this._dbl3();\n\n    return this._dblJ();\n  }\n\n  _dblJ() {\n    // https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian.html#doubling-dbl-1998-cmo-2\n    // 3M + 6S + 4A + 1*a + 2*2 + 1*3 + 1*4 + 1*8\n    // (implemented as: 3M + 6S + 5A + 1*a + 1*2 + 1*3 + 1*4 + 1*8)\n\n    // XX = X1^2\n    const xx = this.x.redSqr();\n\n    // YY = Y1^2\n    const yy = this.y.redSqr();\n\n    // ZZ = Z1^2\n    const zz = this.z.redSqr();\n\n    // S = 4 * X1 * YY\n    const s = this.x.redMul(yy).redIMuln(4);\n\n    // M = 3 * XX + a * ZZ^2\n    const m = xx.redIMuln(3).redIAdd(this.curve.a.redMul(zz.redSqr()));\n\n    // T = M^2 - 2 * S\n    const t = m.redSqr().redISub(s).redISub(s);\n\n    // X3 = T\n    const nx = t;\n\n    // Y3 = M * (S - T) - 8 * YY^2\n    const ny = m.redMul(s.redISub(t)).redISub(yy.redSqr().redIMuln(8));\n\n    // Z3 = 2 * Y1 * Z1\n    const nz = this.y.redMul(this.z).redIMuln(2);\n\n    return this.curve.jpoint(nx, ny, nz);\n  }\n\n  _dbl0() {\n    // Assumes a = 0.\n    // https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#doubling-dbl-2009-l\n    // 2M + 5S + 6A + 3*2 + 1*3 + 1*8\n    // (implemented as: 2M + 5S + 7A + 2*2 + 1*3 + 1*8)\n\n    // A = X1^2\n    const a = this.x.redSqr();\n\n    // B = Y1^2\n    const b = this.y.redSqr();\n\n    // C = B^2\n    const c = b.redSqr();\n\n    // + XB2 = (X1 + B)^2\n    const xb2 = b.redIAdd(this.x).redSqr();\n\n    // D = 2 * ((X1 + B)^2 - A - C)\n    const d = xb2.redISub(a).redISub(c).redIMuln(2);\n\n    // E = 3 * A\n    const e = a.redIMuln(3);\n\n    // F = E^2\n    const f = e.redSqr();\n\n    // X3 = F - 2 * D\n    const nx = f.redISub(d).redISub(d);\n\n    // Y3 = E * (D - X3) - 8 * C\n    const ny = e.redMul(d.redISub(nx)).redISub(c.redIMuln(8));\n\n    // Z3 = 2 * Y1 * Z1\n    const nz = this.y.redMul(this.z).redIMuln(2);\n\n    return this.curve.jpoint(nx, ny, nz);\n  }\n\n  _dbl3() {\n    // Assumes a = -3.\n    // https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b\n    // 3M + 5S + 8A + 1*3 + 1*4 + 2*8\n    // (implemented as: 3M + 5S + 8A + 1*2 + 1*3 + 1*4 + 1*8)\n\n    // delta = Z1^2\n    const delta = this.z.redSqr();\n\n    // gamma = Y1^2\n    const gamma = this.y.redSqr();\n\n    // beta = X1 * gamma\n    const beta = this.x.redMul(gamma);\n\n    // + xmdelta = X1 - delta\n    const xmdelta = this.x.redSub(delta);\n\n    // + xpdelta = X1 + delta\n    const xpdelta = this.x.redAdd(delta);\n\n    // alpha = 3 * (X1 - delta) * (X1 + delta)\n    const alpha = xmdelta.redMul(xpdelta).redIMuln(3);\n\n    // + beta4 = 4 * beta\n    const beta4 = beta.redIMuln(4);\n\n    // + beta8 = 2 * beta4\n    const beta8 = beta4.redMuln(2);\n\n    // + gamma28 = 8 * gamma^2\n    const gamma28 = gamma.redSqr().redIMuln(8);\n\n    // X3 = alpha^2 - 8 * beta\n    const nx = alpha.redSqr().redISub(beta8);\n\n    // Z3 = (Y1 + Z1)^2 - gamma - delta\n    const nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta);\n\n    // Y3 = alpha * (4 * beta - X3) - 8 * gamma^2\n    const ny = alpha.redMul(beta4.redISub(nx)).redISub(gamma28);\n\n    return this.curve.jpoint(nx, ny, nz);\n  }\n\n  getX() {\n    if (this.isInfinity())\n      throw new Error('Invalid point.');\n\n    this.normalize();\n\n    return this.x.fromRed();\n  }\n\n  getY() {\n    if (this.isInfinity())\n      throw new Error('Invalid point.');\n\n    this.normalize();\n\n    return this.y.fromRed();\n  }\n\n  eq(p) {\n    assert(p instanceof JPoint);\n\n    // P = Q\n    if (this === p)\n      return true;\n\n    // P = O\n    if (this.isInfinity())\n      return p.isInfinity();\n\n    // Q = O\n    if (p.isInfinity())\n      return false;\n\n    // Z1 = Z2\n    if (this.z.eq(p.z)) {\n      return this.x.eq(p.x)\n          && this.y.eq(p.y);\n    }\n\n    // X1 * Z2^2 = X2 * Z1^2\n    const zz1 = this.z.redSqr();\n    const zz2 = p.z.redSqr();\n    const x1 = this.x.redMul(zz2);\n    const x2 = p.x.redMul(zz1);\n\n    if (!x1.eq(x2))\n      return false;\n\n    // Y1 * Z2^3 = Y2 * Z1^3\n    const zzz1 = zz1.redMul(this.z);\n    const zzz2 = zz2.redMul(p.z);\n    const y1 = this.y.redMul(zzz2);\n    const y2 = p.y.redMul(zzz1);\n\n    return y1.eq(y2);\n  }\n\n  cmp(point) {\n    assert(point instanceof JPoint);\n\n    const inf1 = this.isInfinity();\n    const inf2 = point.isInfinity();\n\n    if (inf1 && !inf2)\n      return -1;\n\n    if (!inf1 && inf2)\n      return 1;\n\n    if (inf1 && inf2)\n      return 0;\n\n    return this.order().cmp(point.order())\n        || this.getX().cmp(point.getX())\n        || this.getY().cmp(point.getY());\n  }\n\n  isInfinity() {\n    // Z1 = 0\n    return this.z.isZero();\n  }\n\n  isOrder2() {\n    if (this.isInfinity())\n      return false;\n\n    return this.y.isZero();\n  }\n\n  isOdd() {\n    if (this.isInfinity())\n      return false;\n\n    this.normalize();\n\n    return this.y.redIsOdd();\n  }\n\n  isEven() {\n    if (this.isInfinity())\n      return false;\n\n    this.normalize();\n\n    return this.y.redIsEven();\n  }\n\n  isSquare() {\n    if (this.isInfinity())\n      return false;\n\n    return this.y.redMul(this.z).redJacobi() !== -1;\n  }\n\n  eqX(x) {\n    // Verify that integer `x` is equal to field\n    // element `x` by scaling it by our z coordinate.\n    // This optimization is mentioned in and used for\n    // bip-schnorr[1]. This avoids having to affinize\n    // the resulting point during verification.\n    //\n    // [1] [SCHNORR] \"Optimizations\".\n    assert(x instanceof BN);\n    assert(!x.red);\n\n    if (this.isInfinity())\n      return false;\n\n    const zz = this.z.redSqr();\n    const rx = x.toRed(this.curve.red).redMul(zz);\n\n    return this.x.eq(rx);\n  }\n\n  eqR(x) {\n    // Similar to the optimization above, this\n    // optimization, suggested by Maxwell[1],\n    // compares an integer to an X coordinate\n    // by scaling it.\n    //\n    // Since a signature's R value is modulo N\n    // in ECDSA, we may be dealing with an R\n    // value greater than N in actuality.\n    //\n    // If the equality check fails, we can\n    // scale N itself by Z and add it to the\n    // X field element.\n    //\n    // [1] https://github.com/bitcoin-core/secp256k1/commit/ce7eb6f\n    assert(x instanceof BN);\n    assert(!x.red);\n\n    if (!this.curve.smallGap)\n      return this.toP().eqR(x);\n\n    if (this.isInfinity())\n      return false;\n\n    if (x.cmp(this.curve.p) >= 0)\n      return false;\n\n    const zz = this.z.redSqr();\n    const rx = x.toRed(this.curve.red).redMul(zz);\n\n    if (this.x.eq(rx))\n      return true;\n\n    if (this.curve.highOrder)\n      return false;\n\n    if (x.cmp(this.curve.pmodn) >= 0)\n      return false;\n\n    const rn = this.curve.redN.redMul(zz);\n\n    rx.redIAdd(rn);\n\n    return this.x.eq(rx);\n  }\n\n  toP() {\n    // P = O\n    if (this.isInfinity())\n      return this.curve.point();\n\n    this.normalize();\n\n    // (X3, Y3) = (X1 / Z1^2, Y1 / Z1^3)\n    return this.curve.point(this.x, this.y);\n  }\n\n  toJ() {\n    return this;\n  }\n\n  encode(compact) {\n    return this.toP().encode(compact);\n  }\n\n  static decode(curve, bytes) {\n    return ShortPoint.decode(curve, bytes).toJ();\n  }\n\n  encodeX() {\n    return this.toP().encodeX();\n  }\n\n  static decodeEven(curve, bytes) {\n    return ShortPoint.decodeEven(curve, bytes).toJ();\n  }\n\n  static decodeSquare(curve, bytes) {\n    return ShortPoint.decodeSquare(curve, bytes).toJ();\n  }\n\n  toJSON(pre) {\n    return this.toP().toJSON(pre);\n  }\n\n  toPretty() {\n    return this.toP().toPretty();\n  }\n\n  static fromJSON(curve, json) {\n    return ShortPoint.fromJSON(curve, json).toJ();\n  }\n\n  [custom]() {\n    if (this.isInfinity())\n      return '<JPoint: Infinity>';\n\n    return '<JPoint:'\n         + ' x=' + this.x.fromRed().toString(16, 2)\n         + ' y=' + this.y.fromRed().toString(16, 2)\n         + ' z=' + this.z.fromRed().toString(16, 2)\n         + '>';\n  }\n}\n\n/**\n * MontCurve\n */\n\nclass MontCurve extends Curve {\n  constructor(conf) {\n    super(MontPoint, 'mont', conf);\n\n    this.a = BN.fromJSON(conf.a).toRed(this.red);\n    this.b = BN.fromJSON(conf.b).toRed(this.red);\n\n    this.bi = this.b.redInvert();\n    this.a2 = this.a.redAdd(this.two);\n    this.a24 = this.a2.redMul(this.i4);\n    this.a3 = this.a.redMul(this.i3);\n    this.a0 = this.a.redMul(this.bi);\n    this.b0 = this.bi.redSqr();\n\n    this._finalize(conf);\n  }\n\n  static _isomorphism(curveA, curveB, customB) {\n    // Montgomery Isomorphism.\n    //\n    // [MONT3] Page 3, Section 2.1.\n    //\n    // Transformation:\n    //\n    //   A' = A\n    //   B' = B'\n    //\n    // Where (B / B') is square.\n    assert(curveA instanceof BN);\n    assert(curveB instanceof BN);\n    assert(customB instanceof BN);\n\n    const a = curveA.clone();\n    const b = customB.clone();\n    const c = curveB.redDiv(customB);\n\n    if (c.redJacobi() !== 1)\n      throw new Error('Invalid `b` coefficient.');\n\n    return [a, b];\n  }\n\n  _short(a0, odd) {\n    // Montgomery->Short Weierstrass Equivalence.\n    //\n    // [MONT2] \"Equivalence with Weierstrass curves\".\n    //\n    // Transformation:\n    //\n    //   a = (3 - A^2) / (3 * B^2)\n    //   b = (2 * A^3 - 9 * A) / (27 * B^3)\n    const {a, b, three} = this;\n    const a2 = a.redSqr();\n    const a3 = a2.redMul(a);\n    const b2 = b.redSqr();\n    const b3 = b2.redMul(b);\n    const n0 = three.redSub(a2);\n    const d0 = b2.redMuln(3);\n    const n1 = a3.redMuln(2).redISub(a.redMuln(9));\n    const d1 = b3.redMuln(27);\n    const wa = n0.redDiv(d0);\n    const wb = n1.redDiv(d1);\n\n    if (a0 != null)\n      return ShortCurve._isomorphism(wa, wb, a0, odd);\n\n    return [wa, wb];\n  }\n\n  _mont(b0) {\n    return MontCurve._isomorphism(this.a, this.b, b0);\n  }\n\n  _edwards(a0, invert = false) {\n    // Montgomery->Twisted Edwards Transformation.\n    //\n    // [MONT1] Page 11, Section 4.3.5.\n    // [TWISTED] Theorem 3.2, Page 4, Section 3.\n    //\n    // Equivalence:\n    //\n    //   a = (A + 2) / B\n    //   d = (A - 2) / B\n    //\n    // Isomorphism:\n    //\n    //   a = a'\n    //   d = a' * (A - 2) / (A + 2)\n    //\n    // Where ((A + 2) / (B * a')) is square.\n    //\n    // If `d` is square, we can usually find\n    // a complete curve by using the `invert`\n    // option. This will create an isomorphism\n    // chain of: M(A,B)->E(a,d)->E(d,a).\n    //\n    // The equivalence between E(a,d) and\n    // E(d,a) is:\n    //\n    //   (x, y) = (x, 1 / y)\n    //\n    // Meaning our map to E(d,a) is:\n    //\n    //   x = u / v\n    //   y = 1 / ((u - 1) / (u + 1))\n    //     = (u + 1) / (u - 1)\n    assert(typeof invert === 'boolean');\n\n    const {two, bi} = this;\n    const a = this.a.redAdd(two).redMul(bi);\n    const d = this.a.redSub(two).redMul(bi);\n\n    if (invert)\n      a.swap(d);\n\n    if (a0 != null)\n      return EdwardsCurve._isomorphism(a, d, a0);\n\n    return [a, d];\n  }\n\n  _scaleShort(curve) {\n    assert(curve instanceof ShortCurve);\n\n    const [u2, u3] = curve._scale(this);\n\n    return [this.field(u2.redInvert()),\n            this.field(u3.redInvert())];\n  }\n\n  _scaleMont(curve) {\n    // We can extract the isomorphism factor with:\n    //\n    //   c = +-sqrt(B / B')\n    //\n    // If base points are available, we can do:\n    //\n    //   c = v' / v\n    assert(curve instanceof MontCurve);\n\n    if (this.g.isInfinity() || curve.g.isInfinity())\n      return this.field(curve.b).redDivSqrt(this.b);\n\n    return this.g.y.redDiv(this.field(curve.g.y));\n  }\n\n  _scaleEdwards(curve, invert) {\n    // We _could_ do something like:\n    //\n    //   B = 4 / (a - d)\n    //   c = +-sqrt(B / B')\n    //\n    // Which can be reduced to:\n    //\n    //   c = +-sqrt(4 / ((a - d) * B'))\n    //\n    // If base points are available:\n    //\n    //   v = u' / x\n    //   c = v' / v\n    //\n    // Which can be reduced to:\n    //\n    //   c = v' * x / u'\n    //\n    // However, the way our maps are\n    // written, we can re-use the Edwards\n    // isomorphism factor when going the\n    // other direction.\n    assert(curve instanceof EdwardsCurve);\n\n    const c = curve._scale(this, invert);\n\n    return this.field(c);\n  }\n\n  _solveY0(x) {\n    assert(x instanceof BN);\n\n    // y^2 = x^3 + A * x^2 + B * x\n    const a = this.a0;\n    const b = this.b0;\n    const x2 = x.redSqr();\n    const x3 = x2.redMul(x);\n    const y2 = x3.redIAdd(a.redMul(x2)).redIAdd(b.redMul(x));\n\n    return y2;\n  }\n\n  _elligator2(u) {\n    // Elligator 2.\n    //\n    // Distribution: 1/2.\n    //\n    // [ELL2] Page 11, Section 5.2.\n    // [H2EC] \"Elligator 2 Method\".\n    //        \"Mappings for Montgomery curves\".\n    // [SAFE] \"Indistinguishability from uniform random strings\".\n    //\n    // Assumptions:\n    //\n    //   - y^2 = x^3 + A * x^2 + B * x.\n    //   - A != 0, B != 0.\n    //   - A^2 - 4 * B is non-zero and non-square in F(p).\n    //   - Let z be a non-square in F(p).\n    //   - u != +-sqrt(-1 / z).\n    //\n    // Note that Elligator 2 is defined over the form:\n    //\n    //   y'^2 = x'^3 + A' * x'^2 + B' * x'\n    //\n    // Instead of:\n    //\n    //   B * y^2 = x^3 + A * x^2 + x\n    //\n    // Where:\n    //\n    //   A' = A / B\n    //   B' = 1 / B^2\n    //   x' = x / B\n    //   y' = y / B\n    //\n    // And:\n    //\n    //   x = B * x'\n    //   y = B * y'\n    //\n    // This is presumably the result of Elligator 2\n    // being designed in long Weierstrass form. If\n    // we want to support B != 1, we need to do the\n    // conversion.\n    //\n    // Map:\n    //\n    //   g(x) = x^3 + A * x^2 + B * x\n    //   x1 = -A / (1 + z * u^2)\n    //   x1 = -A, if x1 = 0\n    //   x2 = -x1 - A\n    //   x = x1, if g(x1) is square\n    //     = x2, otherwise\n    //   y = sign(u) * abs(sqrt(g(x)))\n    const lhs = this.a0.redNeg();\n    const rhs = this.one.redAdd(this.z.redMul(u.redSqr()));\n\n    if (rhs.isZero())\n      rhs.inject(this.one);\n\n    const x1 = lhs.redMul(rhs.redInvert());\n    const x2 = x1.redNeg().redISub(this.a0);\n    const y1 = this._solveY0(x1);\n    const y2 = this._solveY0(x2);\n    const alpha = y1.redIsSquare() | 0;\n    const x0 = [x1, x2][alpha ^ 1];\n    const y0 = [y1, y2][alpha ^ 1].redSqrt();\n\n    if (y0.redIsOdd() !== u.redIsOdd())\n      y0.redINeg();\n\n    const x = this.b.redMul(x0);\n    const y = this.b.redMul(y0);\n\n    return this.point(x, y);\n  }\n\n  _invert2(p, hint) {\n    // Inverting the Map (Elligator 2).\n    //\n    // [ELL2] Page 12, Section 5.3.\n    //\n    // Assumptions:\n    //\n    //   - -z * x * (x + A) is square in F(p).\n    //   - If r = 1 then x != 0.\n    //   - If r = 2 then x != -A.\n    //\n    // Map:\n    //\n    //   u1 = -(x + A) / (x * z)\n    //   u2 = -x / ((x + A) * z)\n    //   r = random integer in [1,2]\n    //   u = sign(y) * abs(sqrt(ur))\n    //\n    // Note that `0 / 0` can only occur if A = 0\n    // (this violates the assumptions of Elligator 2).\n    const {x, y} = p;\n    const r = hint & 1;\n    const x0 = x.redMul(this.bi);\n    const y0 = y.redMul(this.bi);\n    const n = x0.redAdd(this.a0);\n    const d = x0;\n    const lhs = [n, d][r].redINeg();\n    const rhs = [d, n][r].redMul(this.z);\n    const u = lhs.redDivSqrt(rhs);\n\n    if (u.redIsOdd() !== y0.redIsOdd())\n      u.redINeg();\n\n    return u;\n  }\n\n  isElliptic() {\n    const a2 = this.a.redSqr();\n    const d = this.b.redMul(a2.redSub(this.four));\n\n    // B * (A^2 - 4) != 0\n    return !d.isZero();\n  }\n\n  jinv() {\n    // [MONT3] Page 3, Section 2.\n    const {a, three, four} = this;\n    const a2 = a.redSqr();\n    const t0 = a2.redSub(three);\n    const lhs = t0.redPown(3).redIMuln(256);\n    const rhs = a2.redSub(four);\n\n    if (rhs.isZero())\n      throw new Error('Curve is not elliptic.');\n\n    // (256 * (A^2 - 3)^3) / (A^2 - 4)\n    return lhs.redDiv(rhs).fromRed();\n  }\n\n  point(x, y) {\n    return new MontPoint(this, x, y);\n  }\n\n  jpoint(x, y, z) {\n    assert(x == null && y == null && z == null);\n    return this.point();\n  }\n\n  xpoint(x, z) {\n    return new XPoint(this, x, z);\n  }\n\n  solveY2(x) {\n    // [MONT3] Page 3, Section 2.\n    // https://hyperelliptic.org/EFD/g1p/auto-montgom.html\n    assert(x instanceof BN);\n\n    // B * y^2 = x^3 + A * x^2 + x\n    const x2 = x.redSqr();\n    const x3 = x2.redMul(x);\n    const by2 = x3.redIAdd(this.a.redMul(x2)).redIAdd(x);\n    const y2 = by2.redMul(this.bi);\n\n    return y2;\n  }\n\n  validate(point) {\n    assert(point instanceof MontPoint);\n\n    if (point.isInfinity())\n      return true;\n\n    const {x, y} = point;\n    const y2 = this.solveY2(x);\n\n    return y.redSqr().eq(y2);\n  }\n\n  pointFromX(x, sign = null) {\n    assert(x instanceof BN);\n    assert(sign == null || typeof sign === 'boolean');\n\n    if (!x.red)\n      x = x.toRed(this.red);\n\n    const y = this.solveY(x);\n\n    if (sign != null) {\n      if (y.isZero() && sign)\n        throw new Error('Invalid point.');\n\n      if (y.redIsOdd() !== sign)\n        y.redINeg();\n    }\n\n    return this.point(x, y);\n  }\n\n  isIsomorphic(curve, invert) {\n    // [MONT3] Page 3, Section 2.1.\n    assert(curve instanceof Curve);\n\n    if (!curve.p.eq(this.p))\n      return false;\n\n    // M(A,B) <-> M(A,B')\n    if (curve.type === 'mont') {\n      const a = this.field(curve.a);\n      const b = this.field(curve.b);\n\n      // A' = A\n      if (!this.a.eq(a))\n        return false;\n\n      // B' != 0\n      if (this.b.isZero())\n        return false;\n\n      // jacobi(B / B') = 1\n      const c = b.redDiv(this.b);\n\n      return c.redJacobi() === 1;\n    }\n\n    return curve.isIsomorphic(this, invert);\n  }\n\n  isIsogenous(curve) {\n    assert(curve instanceof Curve);\n\n    if (curve.type === 'mont')\n      return false;\n\n    return curve.isIsogenous(this);\n  }\n\n  pointFromShort(point) {\n    // [ALT] Appendix E.2 (Switching between Alternative Representations).\n    // [MONT2] \"Equivalence with Weierstrass curves\"\n    assert(point instanceof ShortPoint);\n\n    if (this.isIsomorphic(point.curve)) {\n      // Equivalence for E(a,b)->M(A,B):\n      //\n      //   u = B * x - A / 3\n      //   v = B * y\n      //\n      // Undefined if ((u^3 + A * u^2 + u) / B) is not square.\n      if (point.isInfinity())\n        return this.point();\n\n      const {a3, b} = this;\n      const [u2, u3] = this._scale(point.curve);\n      const x = this.field(point.x).redMul(u2);\n      const y = this.field(point.y).redMul(u3);\n      const u = b.redMul(x).redISub(a3);\n      const v = b.redMul(y);\n\n      return this.point(u, v);\n    }\n\n    throw new Error('Not implemented.');\n  }\n\n  pointFromMont(point) {\n    // [MONT3] Page 3, Section 2.1.\n    assert(point instanceof MontPoint);\n\n    if (this.isIsomorphic(point.curve)) {\n      // Isomorphic maps for M(A,B)<->M(A,B'):\n      //\n      //   u' = u\n      //   v' = +-sqrt(B / B') * v\n      //\n      // Undefined if (B / B') is not square.\n      if (point.isInfinity())\n        return this.point();\n\n      const c = this._scale(point.curve);\n      const u = this.field(point.x);\n      const v = this.field(point.y);\n      const nu = u;\n      const nv = c.redMul(v);\n\n      return this.point(nu, nv);\n    }\n\n    throw new Error('Not implemented.');\n  }\n\n  pointFromEdwards(point) {\n    // [RFC7748] Section 4.1 & 4.2.\n    // [MONT3] Page 6, Section 2.5.\n    // [TWISTED] Theorem 3.2, Page 4, Section 3.\n    assert(point instanceof EdwardsPoint);\n    assert(point.curve.p.eq(this.p));\n\n    // Edwards `x`, `y`, `z`.\n    const x = this.field(point.x);\n    const y = this.field(point.y);\n    const z = this.field(point.z);\n\n    if (this.isIsogenous(point.curve)) {\n      // 4-isogeny maps for E(1,d)->M(2-4d,1):\n      //\n      //   u = y^2 / x^2\n      //   v = (2 - x^2 - y^2) * y / x^3\n      //\n      // Undefined for x = 0.\n      //\n      // Exceptional Cases:\n      //   - (0, 1) -> O\n      //   - (0, -1) -> (0, 0)\n      //\n      // Unexceptional Cases:\n      //   - (+-1, 0) -> (0, 0)\n      if (point.isInfinity())\n        return this.point();\n\n      if (point.x.isZero())\n        return this.point(this.zero, this.zero);\n\n      const c = z.redSqr().redIMuln(2);\n      const uu = y.redSqr();\n      const uz = x.redSqr();\n      const vv = c.redISub(uz).redISub(uu).redMul(y);\n      const vz = uz.redMul(x);\n\n      return this.cpoint(uu, uz, vv, vz);\n    }\n\n    if (this.isIsomorphic(point.curve, true)) {\n      // Isomorphic maps for E(d,a)->M(A,B):\n      //\n      //   u = (y + 1) / (y - 1)\n      //   v = +-sqrt((A - 2) / (B * a)) * u / x\n      //\n      // Undefined for x = 0 or y = 1.\n      //\n      // Exceptional Cases:\n      //   - (0, 1) -> O\n      //   - (0, -1) -> (0, 0)\n      //\n      // Unexceptional Cases:\n      //   - (+-sqrt(1 / a), 0) -> (-1, +-sqrt((A - 2) / B))\n      if (point.isInfinity())\n        return this.point();\n\n      if (point.x.isZero())\n        return this.point(this.zero, this.zero);\n\n      const c = this._scale(point.curve, true);\n      const uu = y.redAdd(z);\n      const uz = y.redSub(z);\n      const vv = c.redMul(z).redMul(uu);\n      const vz = x.redMul(uz);\n\n      return this.cpoint(uu, uz, vv, vz);\n    }\n\n    if (this.isIsomorphic(point.curve, false)) {\n      // Isomorphic maps for E(a,d)->M(A,B):\n      //\n      //   u = (1 + y) / (1 - y)\n      //   v = +-sqrt((A + 2) / (B * a)) * u / x\n      //\n      // Undefined for x = 0 or y = 1.\n      //\n      // Exceptional Cases:\n      //   - (0, 1) -> O\n      //   - (0, -1) -> (0, 0)\n      //\n      // Unexceptional Cases:\n      //   - (+-sqrt(1 / a), 0) -> (1, +-sqrt((A + 2) / B))\n      if (point.isInfinity())\n        return this.point();\n\n      if (point.x.isZero())\n        return this.point(this.zero, this.zero);\n\n      const c = this._scale(point.curve, false);\n      const uu = z.redAdd(y);\n      const uz = z.redSub(y);\n      const vv = c.redMul(z).redMul(uu);\n      const vz = x.redMul(uz);\n\n      return this.cpoint(uu, uz, vv, vz);\n    }\n\n    throw new Error('Not implemented.');\n  }\n\n  pointFromUniform(u) {\n    assert(u instanceof BN);\n\n    // z = 0 or A = 0\n    if (this.z.isZero() || this.a.isZero())\n      throw new Error('Not implemented.');\n\n    return this._elligator2(u);\n  }\n\n  pointToUniform(p, hint) {\n    // Convert a montgomery point to a field\n    // element by inverting the elligator2 map.\n    //\n    // Hint Layout:\n    //\n    //   [00000000] [0000] [0000]\n    //        |        |      |\n    //        |        |      +-- preimage index\n    //        |        +--- subgroup\n    //        +-- bits to OR with uniform bytes\n    assert(p instanceof MontPoint);\n    assert((hint >>> 0) === hint);\n\n    // z = 0 or A = 0\n    if (this.z.isZero() || this.a.isZero())\n      throw new Error('Not implemented.');\n\n    // P = O\n    if (p.isInfinity())\n      throw new Error('Invalid point.');\n\n    // Add a random torsion component.\n    const i = ((hint >>> 4) & 15) % this.torsion.length;\n    const q = p.add(this.torsion[i]);\n\n    return wrapErrors(() => {\n      return this._invert2(q, hint);\n    });\n  }\n\n  decodePoint(bytes, sign) {\n    return MontPoint.decode(this, bytes, sign);\n  }\n\n  encodeX(point) {\n    assert(point instanceof XPoint);\n    return point.encode();\n  }\n\n  decodeX(bytes) {\n    return XPoint.decode(this, bytes);\n  }\n\n  toShort(a0, odd, sign = null) {\n    const [a, b] = this._short(a0, odd);\n\n    const curve = new ShortCurve({\n      red: this.red,\n      prime: this.prime,\n      p: this.p,\n      a: a,\n      b: b,\n      n: this.n,\n      h: this.h\n    });\n\n    if (sign != null) {\n      const [, u3] = curve._scale(this);\n\n      if (u3.redIsOdd() !== sign)\n        u3.redINeg();\n    }\n\n    if (!this.g.isInfinity())\n      curve.g = curve.pointFromMont(this.g);\n\n    for (let i = 0; i < this.h.word(0); i++)\n      curve.torsion[i] = curve.pointFromMont(this.torsion[i]);\n\n    return curve;\n  }\n\n  toMont(b0, sign = null) {\n    const [a, b] = this._mont(b0);\n\n    const curve = new MontCurve({\n      red: this.red,\n      prime: this.prime,\n      p: this.p,\n      a: a,\n      b: b,\n      n: this.n,\n      h: this.h,\n      z: this.z\n    });\n\n    if (sign != null) {\n      const c = curve._scale(this);\n\n      if (c.redIsOdd() !== sign)\n        c.redINeg();\n    }\n\n    if (!this.g.isInfinity())\n      curve.g = curve.pointFromMont(this.g);\n\n    for (let i = 0; i < this.h.word(0); i++)\n      curve.torsion[i] = curve.pointFromMont(this.torsion[i]);\n\n    return curve;\n  }\n\n  toEdwards(a0, invert, sign = null) {\n    const [a, d] = this._edwards(a0, invert);\n\n    const curve = new EdwardsCurve({\n      red: this.red,\n      prime: this.prime,\n      p: this.p,\n      a: a,\n      d: d,\n      n: this.n,\n      h: this.h,\n      z: this.z\n    });\n\n    if (sign != null) {\n      const c = curve._scale(this, invert);\n\n      if (c.redIsOdd() !== sign)\n        c.redINeg();\n    }\n\n    if (!this.g.isInfinity()) {\n      curve.g = curve.pointFromMont(this.g);\n      curve.g.normalize();\n    }\n\n    if (curve.isComplete()) {\n      for (let i = 0; i < this.h.word(0); i++) {\n        curve.torsion[i] = curve.pointFromMont(this.torsion[i]);\n        curve.torsion[i].normalize();\n      }\n    }\n\n    return curve;\n  }\n\n  pointFromJSON(json) {\n    return MontPoint.fromJSON(this, json);\n  }\n\n  toJSON(pre) {\n    const json = super.toJSON(pre);\n    json.a = this.a.fromRed().toJSON();\n    json.b = this.b.fromRed().toJSON();\n    return json;\n  }\n}\n\n/**\n * MontPoint\n */\n\nclass MontPoint extends Point {\n  constructor(curve, x, y) {\n    assert(curve instanceof MontCurve);\n\n    super(curve, types.AFFINE);\n\n    this.x = this.curve.zero;\n    this.y = this.curve.zero;\n    this.inf = true;\n\n    if (x != null)\n      this._init(x, y);\n  }\n\n  _init(x, y) {\n    assert(x instanceof BN);\n    assert(y instanceof BN);\n\n    this.x = x;\n    this.y = y;\n\n    if (!this.x.red)\n      this.x = this.x.toRed(this.curve.red);\n\n    if (!this.y.red)\n      this.y = this.y.toRed(this.curve.red);\n\n    this.inf = false;\n  }\n\n  clone() {\n    if (this.inf)\n      return this.curve.point();\n\n    return this.curve.point(this.x, this.y);\n  }\n\n  scale(a) {\n    return this.clone();\n  }\n\n  randomize(rng) {\n    return this.clone();\n  }\n\n  neg() {\n    // P = O\n    if (this.inf)\n      return this;\n\n    // -(X1, Y1) = (X1, -Y1)\n    return this.curve.point(this.x, this.y.redNeg());\n  }\n\n  add(p) {\n    // [MONT1] Page 8, Section 4.3.2.\n    //\n    // Addition Law:\n    //\n    //   l = (y2 - y1) / (x2 - x1)\n    //   x3 = b * l^2 - a - x1 - x2\n    //   y3 = l * (x1 - x3) - y1\n    //\n    // 1I + 2M + 1S + 7A + 1*b\n    assert(p instanceof MontPoint);\n\n    // O + P = P\n    if (this.inf)\n      return p;\n\n    // P + O = P\n    if (p.inf)\n      return this;\n\n    // P + P, P + -P\n    if (this.x.eq(p.x)) {\n      // P + -P = O\n      if (!this.y.eq(p.y))\n        return this.curve.point();\n\n      // P + P = 2P\n      return this.dbl();\n    }\n\n    // H = X2 - X1\n    const h = p.x.redSub(this.x);\n\n    // R = Y2 - Y1\n    const r = p.y.redSub(this.y);\n\n    // L = R / H\n    const l = r.redDiv(h);\n\n    // K = b * L^2\n    const k = this.curve.b.redMul(l.redSqr());\n\n    // X3 = K - a - X1 - X2\n    const nx = k.redISub(this.curve.a).redISub(this.x).redISub(p.x);\n\n    // Y3 = L * (X1 - X3) - Y1\n    const ny = l.redMul(this.x.redSub(nx)).redISub(this.y);\n\n    return this.curve.point(nx, ny);\n  }\n\n  dbl() {\n    // [MONT1] Page 8, Section 4.3.2.\n    //\n    // Addition Law (doubling):\n    //\n    //   l = (3 * x1^2 + 2 * a * x1 + 1) / (2 * b * y1)\n    //   x3 = b * l^2 - a - 2 * x1\n    //   y3 = l * (x1 - x3) - y1\n    //\n    // 1I + 3M + 2S + 7A + 1*a + 1*b + 1*b + 2*2 + 1*3\n\n    // P = O\n    if (this.inf)\n      return this;\n\n    // Y1 = 0\n    if (this.y.isZero())\n      return this.curve.point();\n\n    // M1 = 3 * X1^2\n    const m1 = this.x.redSqr().redIMuln(3);\n\n    // M2 = 2 * a * X1\n    const m2 = this.curve.a.redMul(this.x).redIMuln(2);\n\n    // M = M1 + M2 + 1\n    const m = m1.redIAdd(m2).redIAdd(this.curve.one);\n\n    // Z = 2 * b * Y1\n    const z = this.curve.b.redMul(this.y).redIMuln(2);\n\n    // L = M / Z\n    const l = m.redDiv(z);\n\n    // K = b * L^2\n    const k = this.curve.b.redMul(l.redSqr());\n\n    // X3 = K - a - 2 * X1\n    const nx = k.redISub(this.curve.a).redISub(this.x).redISub(this.x);\n\n    // Y3 = L * (X1 - X3) - Y1\n    const ny = l.redMul(this.x.redSub(nx)).redISub(this.y);\n\n    return this.curve.point(nx, ny);\n  }\n\n  getX() {\n    if (this.inf)\n      throw new Error('Invalid point.');\n\n    return this.x.fromRed();\n  }\n\n  getY() {\n    if (this.inf)\n      throw new Error('Invalid point.');\n\n    return this.y.fromRed();\n  }\n\n  eq(p) {\n    assert(p instanceof MontPoint);\n\n    // P = Q\n    if (this === p)\n      return true;\n\n    // P = O\n    if (this.inf)\n      return p.inf;\n\n    // Q = O\n    if (p.inf)\n      return false;\n\n    // X1 = X2, Y1 = Y2\n    return this.x.eq(p.x)\n        && this.y.eq(p.y);\n  }\n\n  cmp(point) {\n    assert(point instanceof MontPoint);\n\n    if (this.inf && !point.inf)\n      return -1;\n\n    if (!this.inf && point.inf)\n      return 1;\n\n    if (this.inf && point.inf)\n      return 0;\n\n    return this.order().cmp(point.order())\n        || this.getX().cmp(point.getX())\n        || this.getY().cmp(point.getY());\n  }\n\n  isInfinity() {\n    // Infinity cannot be represented in\n    // the affine space, except by a flag.\n    return this.inf;\n  }\n\n  isOrder2() {\n    if (this.inf)\n      return false;\n\n    return this.y.isZero();\n  }\n\n  isOdd() {\n    if (this.inf)\n      return false;\n\n    return this.y.redIsOdd();\n  }\n\n  isEven() {\n    if (this.inf)\n      return false;\n\n    return this.y.redIsEven();\n  }\n\n  toP() {\n    return this;\n  }\n\n  toJ() {\n    return this;\n  }\n\n  toX() {\n    // (X3, Z3) = (1, 0)\n    if (this.inf)\n      return this.curve.xpoint();\n\n    // (X3, Z3) = (X1, 1)\n    return this.curve.xpoint(this.x, this.curve.one);\n  }\n\n  encode() {\n    return this.toX().encode();\n  }\n\n  static decode(curve, bytes, sign) {\n    assert(curve instanceof MontCurve);\n    return curve.decodeX(bytes).toP(sign);\n  }\n\n  toJSON(pre) {\n    if (this.inf)\n      return [];\n\n    const x = this.getX().toJSON();\n    const y = this.getY().toJSON();\n\n    return [x, y];\n  }\n\n  toPretty() {\n    if (this.inf)\n      return [];\n\n    const size = this.curve.fieldSize * 2;\n    const x = toPretty(this.getX(), size);\n    const y = toPretty(this.getY(), size);\n\n    return [x, y];\n  }\n\n  static fromJSON(curve, json) {\n    assert(curve instanceof MontCurve);\n    assert(Array.isArray(json));\n    assert(json.length === 0\n        || json.length === 2\n        || json.length === 3);\n\n    if (json.length === 0)\n      return curve.point();\n\n    const x = BN.fromJSON(json[0]);\n    const y = BN.fromJSON(json[1]);\n\n    return curve.point(x, y);\n  }\n\n  [custom]() {\n    if (this.inf)\n      return '<MontPoint: Infinity>';\n\n    return '<MontPoint:'\n         + ' x=' + this.x.fromRed().toString(16, 2)\n         + ' y=' + this.y.fromRed().toString(16, 2)\n         + '>';\n  }\n}\n\n/**\n * XPoint\n */\n\nclass XPoint extends Point {\n  constructor(curve, x, z) {\n    assert(curve instanceof MontCurve);\n\n    super(curve, types.PROJECTIVE);\n\n    this.x = this.curve.one;\n    this.z = this.curve.zero;\n\n    if (x != null)\n      this._init(x, z);\n  }\n\n  _init(x, z) {\n    assert(x instanceof BN);\n    assert(z == null || (z instanceof BN));\n\n    this.x = x;\n    this.z = z || this.curve.one;\n\n    if (!this.x.red)\n      this.x = this.x.toRed(this.curve.red);\n\n    if (!this.z.red)\n      this.z = this.z.toRed(this.curve.red);\n  }\n\n  clone() {\n    return this.curve.xpoint(this.x, this.z);\n  }\n\n  precompute(power, rng) {\n    // No-op.\n    return this;\n  }\n\n  validate() {\n    if (this.isInfinity())\n      return true;\n\n    // B * y^2 * z = x^3 + A * x^2 * z + x * z^2\n    const {x, z} = this;\n    const x2 = x.redSqr();\n    const x3 = x2.redMul(x);\n    const z2 = z.redSqr();\n    const ax2 = this.curve.a.redMul(x2).redMul(z);\n    const by2 = x3.redIAdd(ax2).redIAdd(x.redMul(z2));\n    const y2 = by2.redMul(this.curve.bi);\n\n    // sqrt(y^2 * z^4) = y * z^2\n    return y2.redMul(z).redJacobi() !== -1;\n  }\n\n  normalize() {\n    // https://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#scaling-scale\n    // 1I + 1M\n\n    // P = O\n    if (this.isInfinity())\n      return this;\n\n    // Z1 = 1\n    if (this.z.eq(this.curve.one))\n      return this;\n\n    // X3 = X1 / Z1\n    this.x = this.x.redDiv(this.z);\n\n    // Z3 = 1\n    this.z = this.curve.one;\n\n    return this;\n  }\n\n  scale(a) {\n    assert(a instanceof BN);\n\n    // P = O\n    if (this.isInfinity())\n      return this.curve.xpoint();\n\n    // X3 = X1 * A\n    const nx = this.x.redMul(a);\n\n    // Y3 = Y1 * A\n    const nz = this.z.redMul(a);\n\n    return this.curve.xpoint(nx, nz);\n  }\n\n  neg() {\n    // -(X1, Z1) = (X1, Z1)\n    return this;\n  }\n\n  dbl() {\n    // https://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3\n    // 2M + 2S + 4A + 1*a24\n\n    // A = X1 + Z1\n    const a = this.x.redAdd(this.z);\n\n    // AA = A^2\n    const aa = a.redSqr();\n\n    // B = X1 - Z1\n    const b = this.x.redSub(this.z);\n\n    // BB = B^2\n    const bb = b.redSqr();\n\n    // C = AA - BB\n    const c = aa.redSub(bb);\n\n    // X3 = AA * BB\n    const nx = aa.redMul(bb);\n\n    // Z3 = C * (BB + a24 * C)\n    const nz = c.redMul(bb.redIAdd(this.curve.a24.redMul(c)));\n\n    return this.curve.xpoint(nx, nz);\n  }\n\n  diffAddDbl(p2, p3) {\n    // https://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#ladder-ladd-1987-m-3\n    // 6M + 4S + 8A + 1*a24\n    assert(p2 instanceof XPoint);\n    assert(p3 instanceof XPoint);\n\n    // A = X2 + Z2\n    const a = p2.x.redAdd(p2.z);\n\n    // AA = A^2\n    const aa = a.redSqr();\n\n    // B = X2 - Z2\n    const b = p2.x.redSub(p2.z);\n\n    // BB = B^2\n    const bb = b.redSqr();\n\n    // E = AA - BB\n    const e = aa.redSub(bb);\n\n    // C = X3 + Z3\n    const c = p3.x.redAdd(p3.z);\n\n    // D = X3 - Z3\n    const d = p3.x.redSub(p3.z);\n\n    // DA = D * A\n    const da = d.redMul(a);\n\n    // CB = C * B\n    const cb = c.redMul(b);\n\n    // X5 = Z1 * (DA + CB)^2\n    const x5 = this.z.redMul(da.redAdd(cb).redSqr());\n\n    // Z5 = X1 * (DA - CB)^2\n    const z5 = this.x.redMul(da.redISub(cb).redSqr());\n\n    // X4 = AA * BB\n    const x4 = aa.redMul(bb);\n\n    // Z4 = E * (BB + a24 * E)\n    const z4 = e.redMul(bb.redIAdd(this.curve.a24.redMul(e)));\n\n    return [\n      this.curve.xpoint(x4, z4),\n      this.curve.xpoint(x5, z5)\n    ];\n  }\n\n  getX() {\n    if (this.isInfinity())\n      throw new Error('Invalid point.');\n\n    this.normalize();\n\n    return this.x.fromRed();\n  }\n\n  getY(sign) {\n    return this.toP(sign).getY();\n  }\n\n  eq(p) {\n    assert(p instanceof XPoint);\n\n    // P = Q\n    if (this === p)\n      return true;\n\n    // P = O\n    if (this.isInfinity())\n      return p.isInfinity();\n\n    // Q = O\n    if (p.isInfinity())\n      return false;\n\n    // Z1 = Z2\n    if (this.z.eq(p.z))\n      return this.x.eq(p.x);\n\n    // X1 * Z2 = X2 * Z1\n    const x1 = this.x.redMul(p.z);\n    const x2 = p.x.redMul(this.z);\n\n    return x1.eq(x2);\n  }\n\n  cmp(point) {\n    assert(point instanceof XPoint);\n\n    const inf1 = this.isInfinity();\n    const inf2 = point.isInfinity();\n\n    if (inf1 && !inf2)\n      return -1;\n\n    if (!inf1 && inf2)\n      return 1;\n\n    if (inf1 && inf2)\n      return 0;\n\n    return this.order().cmp(point.order())\n        || this.getX().cmp(point.getX());\n  }\n\n  isInfinity() {\n    // Z1 = 0\n    return this.z.isZero();\n  }\n\n  isOrder2() {\n    if (this.isInfinity())\n      return false;\n\n    return this.x.isZero();\n  }\n\n  isOdd() {\n    return false;\n  }\n\n  isEven() {\n    return false;\n  }\n\n  hasTorsion() {\n    if (this.isInfinity())\n      return false;\n\n    // X1 = 0, Z1 != 0 (edge case)\n    if (this.x.isZero())\n      return true;\n\n    return super.hasTorsion();\n  }\n\n  order() {\n    try {\n      return this.toP().order();\n    } catch (e) {\n      return new BN(1);\n    }\n  }\n\n  jmul(k) {\n    // Multiply with the Montgomery Ladder.\n    //\n    // [MONT3] Algorithm 4, Page 12, Section 4.2.\n    //\n    // Note that any clamping is meant to\n    // be done _outside_ of this function.\n    assert(k instanceof BN);\n    assert(!k.red);\n\n    const bits = k.bitLength();\n\n    let a = this.curve.xpoint();\n    let b = this;\n\n    for (let i = bits - 1; i >= 0; i--) {\n      const bit = k.bit(i);\n\n      if (bit === 0)\n        [a, b] = this.diffAddDbl(a, b);\n      else\n        [b, a] = this.diffAddDbl(b, a);\n    }\n\n    return a;\n  }\n\n  jmulBlind(k, rng) {\n    if (!rng)\n      return this.jmul(k);\n\n    // Randomize if available.\n    return this.randomize(rng).jmul(k);\n  }\n\n  jmulAdd(k1, p2, k2) {\n    throw new Error('Not implemented.');\n  }\n\n  toP(sign = null) {\n    assert(sign == null || typeof sign === 'boolean');\n\n    if (this.isInfinity())\n      return this.curve.point();\n\n    this.normalize();\n\n    return this.curve.pointFromX(this.x, sign);\n  }\n\n  toJ() {\n    return this;\n  }\n\n  toX() {\n    return this;\n  }\n\n  key() {\n    if (this.isInfinity())\n      return `${this.curve.uid}:oo`;\n\n    this.normalize();\n\n    const x = this.getX().toString(16);\n\n    return `${this.curve.uid}:${x}`;\n  }\n\n  encode() {\n    // [RFC7748] Section 5.\n    return this.curve.encodeField(this.getX());\n  }\n\n  static decode(curve, bytes) {\n    assert(curve instanceof MontCurve);\n\n    // [RFC7748] Section 5.\n    const x = curve.decodeField(bytes);\n\n    // We're supposed to ignore the hi bit\n    // on montgomery points... I think. If\n    // we don't, the X25519 test vectors\n    // break, which is pretty convincing\n    // evidence. This is a no-op for X448.\n    x.iumaskn(curve.fieldBits);\n\n    // Note: montgomery points are meant to be\n    // reduced by the prime and do not have to\n    // be explicitly validated in order to do\n    // the montgomery ladder.\n    const p = curve.xpoint(x, curve.one);\n\n    assert(!p.isInfinity());\n\n    return p;\n  }\n\n  toJSON(pre) {\n    return this.toP().toJSON(pre);\n  }\n\n  toPretty() {\n    return this.toP().toPretty();\n  }\n\n  static fromJSON(curve, json) {\n    return MontPoint.fromJSON(curve, json).toX();\n  }\n\n  [custom]() {\n    if (this.isInfinity())\n      return '<XPoint: Infinity>';\n\n    return '<XPoint:'\n        + ' x=' + this.x.fromRed().toString(16, 2)\n        + ' z=' + this.z.fromRed().toString(16, 2)\n        + '>';\n  }\n}\n\n/**\n * EdwardsCurve\n */\n\nclass EdwardsCurve extends Curve {\n  constructor(conf) {\n    super(EdwardsPoint, 'edwards', conf);\n\n    this.a = BN.fromJSON(conf.a).toRed(this.red);\n    this.d = BN.fromJSON(conf.d).toRed(this.red);\n    this.s = BN.fromJSON(conf.s || '0').toRed(this.red);\n    this.si = this.s.isZero() ? this.zero : this.s.redInvert();\n\n    this.k = this.d.redMuln(2);\n    this.smi = -this.d.redNeg().word(0);\n    this.ad6 = this.a.redAdd(this.d).redMul(this.i6);\n\n    this.twisted = !this.a.eq(this.one);\n    this.oneA = this.a.eq(this.one);\n    this.mOneA = this.a.eq(this.one.redNeg());\n    this.smallD = this.prime != null && this.d.redNeg().length === 1;\n    this.alt = null;\n\n    this._finalize(conf);\n  }\n\n  static _isomorphism(curveA, curveD, customA) {\n    // Twisted Edwards Isomorphism.\n    //\n    // [TWISTED] Definition 2.1, Page 3, Section 2.\n    //\n    // Transformation:\n    //\n    //   a' = a'\n    //   d' = a' * d / a\n    //\n    // Where (a / a') is square.\n    assert(curveA instanceof BN);\n    assert(curveD instanceof BN);\n    assert(customA instanceof BN);\n\n    const a = customA.clone();\n    const d = customA.redMul(curveD).redDiv(curveA);\n    const c = curveA.redDiv(customA);\n\n    if (c.redJacobi() !== 1)\n      throw new Error('Invalid `a` coefficient.');\n\n    return [a, d];\n  }\n\n  _short(a0, odd) {\n    // Twisted Edwards->Short Weierstrass Equivalence.\n    //\n    // [TWISTEQ] Section 2.\n    //\n    // Transformation:\n    //\n    //   a' = -(a^2 + 14 * a * d + d^2) / 48\n    //   b' = (33 * (a^2 * d + a * d^2) - a^3 - d^3) / 864\n    const {a, d} = this;\n    const a2 = a.redSqr();\n    const a3 = a2.redMul(a);\n    const d2 = d.redSqr();\n    const d3 = d2.redMul(d);\n    const ad14 = a.redMul(d).redIMuln(14);\n    const a2d = a2.redMul(d);\n    const ad2 = a.redMul(d2);\n    const t0 = a2d.redIAdd(ad2).redIMuln(33);\n    const wa = a2.redAdd(ad14).redIAdd(d2).redDivn(-48);\n    const wb = t0.redISub(a3).redISub(d3).redDivn(864);\n\n    if (a0 != null)\n      return ShortCurve._isomorphism(wa, wb, a0, odd);\n\n    return [wa, wb];\n  }\n\n  _mont(b0, invert = false) {\n    // Twisted Edwards->Montgomery Transformation.\n    //\n    // [TWISTED] Theorem 3.2, Page 4, Section 3.\n    //\n    // Equivalence:\n    //\n    //   A = 2 * (a + d) / (a - d)\n    //   B = 4 / (a - d)\n    //\n    // Isomorphism:\n    //\n    //   A = 2 * (a + d) / (a - d)\n    //   B = B'\n    //\n    // Where ((4 / (a - d)) / B') is square.\n    //\n    // If `4 / (a - d)` is non-square, we can\n    // usually force B=1 by using the `invert`\n    // option. This will create an isomorphism\n    // chain of: E(a,d)->E(d,a)->M(-A,-B).\n    //\n    // The equivalence between E(a,d) and E(d,a)\n    // is:\n    //\n    //   (x, y) = (x, 1 / y)\n    //\n    // Meaning our map to M(-A,-B) is:\n    //\n    //   u = (1 + 1 / y) / (1 - 1 / y)\n    //     = (y + 1) / (y - 1)\n    //   v = u / x\n    assert(typeof invert === 'boolean');\n\n    let apd, amd;\n\n    if (invert) {\n      apd = this.d.redAdd(this.a);\n      amd = this.d.redSub(this.a);\n    } else {\n      apd = this.a.redAdd(this.d);\n      amd = this.a.redSub(this.d);\n    }\n\n    const z = amd.redInvert();\n    const a = apd.redMuln(2).redMul(z);\n    const b = z.redMuln(4);\n\n    if (b0 != null)\n      return MontCurve._isomorphism(a, b, b0);\n\n    return [a, b];\n  }\n\n  _edwards(a0) {\n    return EdwardsCurve._isomorphism(this.a, this.d, a0);\n  }\n\n  _scaleShort(curve) {\n    assert(curve instanceof ShortCurve);\n\n    const [u2, u3] = curve._scale(this);\n\n    return [this.field(u2.redInvert()),\n            this.field(u3.redInvert())];\n  }\n\n  _scaleMont(curve, invert = false) {\n    // Calculate isomorphism factor between\n    // Twisted Edwards and Montgomery with:\n    //\n    //   a = (A + 2) / B\n    //   c = +-sqrt(a / a')\n    //\n    // Which can be reduced to:\n    //\n    //   c = +-sqrt((A + 2) / (B * a'))\n    //\n    // If base points are available, we can do:\n    //\n    //   x = u / v\n    //   c = x' / x\n    //\n    // Which can be reduced to:\n    //\n    //   c = v * x' / u\n    //\n    // We can now calculate the Edwards `x` with:\n    //\n    //   x' = c * u / v\n    //\n    // And likewise, the Montgomery `v`:\n    //\n    //   v = c * u / x'\n    assert(curve instanceof MontCurve);\n    assert(typeof invert === 'boolean');\n\n    if (this.g.isInfinity() || curve.g.isInfinity()) {\n      const [a] = curve._edwards(null, invert);\n\n      return this.field(a).redDivSqrt(this.a);\n    }\n\n    const x = curve.g.x.redDiv(curve.g.y);\n\n    return this.g.x.redDiv(this.field(x));\n  }\n\n  _scaleEdwards(curve) {\n    // We can extract the isomorphism factor with:\n    //\n    //   c = +-sqrt(a / a')\n    //\n    // If base points are available, we can do:\n    //\n    //   c = x' / x\n    assert(curve instanceof EdwardsCurve);\n\n    if (this.g.isInfinity() || curve.g.isInfinity())\n      return this.field(curve.a).redDivSqrt(this.a);\n\n    return this.g.x.redDiv(this.field(curve.g.x));\n  }\n\n  _mulA(num) {\n    assert(num instanceof BN);\n\n    // n * a = n\n    if (this.oneA)\n      return num.clone();\n\n    // n * a = -n\n    if (this.mOneA)\n      return num.redNeg();\n\n    return this.a.redMul(num);\n  }\n\n  _mulD(num) {\n    assert(num instanceof BN);\n\n    // -d < 0x4000000\n    if (this.smallD)\n      return num.redMuln(this.smi);\n\n    return this.d.redMul(num);\n  }\n\n  _elligator1(t) {\n    // Elligator 1.\n    //\n    // Distribution: 1/2.\n    //\n    // [ELL1] Page 6, Section 3.\n    //        Page 15, Appendix A.\n    // [ELL2] Page 7, Section 3.2.\n    //\n    // Assumptions:\n    //\n    //   - Let p be a prime power congruent to 3 mod 4.\n    //   - Let s be a nonzero element of F(p).\n    //   - Let c = 2 / s^2.\n    //   - Let r = c + 1 / c.\n    //   - Let d = -(c + 1)^2 / (c - 1)^2.\n    //   - (s^2 - 2) * (s^2 + 2) != 0.\n    //   - c * (c - 1) * (c + 1) != 0.\n    //   - r != 0.\n    //   - d is not square.\n    //   - x^2 + y^2 = 1 + d * x^2 * y^2.\n    //   - u * v * X * Y * x * (Y + 1) != 0.\n    //   - Y^2 = X^5 + (r^2 - 2) * X^3 + X.\n    //\n    // Elligator 1, as devised by Fouque et al,\n    // takes place on the hyperelliptic curve of:\n    //\n    //   y^2 = x^5 + (r^2 - 2) * x^3 + x\n    //\n    // Not only must our Edwards curve be complete,\n    // with a prime congruent to 3 mod 4, and a = 1,\n    // our curve must be isomorphic to a hyperelliptic\n    // curve of the above form. Roughly one half of\n    // all Edwards curves are isomorphic to a curve\n    // of said form.\n    //\n    // We can derive the isomorphism with:\n    //\n    //   c = (d +- 2 * sqrt(-d) - 1) / (d + 1)\n    //   s = +-sqrt(2 / c)\n    //   r = c + 1 / c\n    //\n    // Note that even if your curve is an Elligator 1\n    // curve, Elligator 2 is probably still preferable,\n    // as it has nearly the same properties (i.e. the\n    // same distribution), and is much less complex.\n    //\n    // Map:\n    //\n    //   f(a) = a^((p - 1) / 2)\n    //   u = (1 - t) / (1 + t)\n    //   v = u^5 + (r^2 - 2) * u^3 + u\n    //   X = f(v) * u\n    //   Y = (f(v) * v)^((p + 1) / 4) * f(v) * f(u^2 + 1 / c^2)\n    //   Y = 1, if u = 0\n    //   x = (c - 1) * s * X * (1 + X) / Y\n    //   y = (r * X - (1 + X)^2) / (r * X + (1 + X)^2)\n    //\n    // When t = +-1, we create the hyperelliptic\n    // 2-torsion point of (0, 0). This needs to be\n    // mapped to (0, -1) in Edwards form, but the x\n    // denominator becomes zero. As far as I can\n    // tell, this is the only exceptional case.\n    //\n    // The only other exceptional case initially\n    // appears to be when the y denominator sums to\n    // zero (when t = sqrt(4 / r + 1)), however, the\n    // hyperelliptic `X` is negated by the sign of\n    // `v`, making this impossible.\n    const {s, si, i2, one, two} = this;\n    const c = si.redSqr().redIMuln(2);\n    const ci = s.redSqr().redMul(i2);\n    const ci2 = ci.redSqr();\n    const r = c.redAdd(ci);\n    const r2 = r.redSqr().redISub(two);\n    const cm1 = c.redSub(one);\n    const uu = one.redSub(t);\n    const uz = one.redAdd(t);\n    const u = uz.isZero() ? uz : uu.redDiv(uz);\n    const u2 = u.redSqr();\n    const u3 = u2.redMul(u);\n    const u5 = u3.redMul(u2);\n    const v = u5.redAdd(r2.redMul(u3)).redIAdd(u);\n    const f0 = this.field(v.redJacobi());\n    const f1 = this.field(u2.redAdd(ci2).redJacobi());\n    const f2 = f0.redMul(f1);\n    const X = f0.redMul(u);\n    const Y = f0.redMul(v).redSqrt().redMul(f2);\n    const X1 = one.redAdd(X);\n    const rX = r.redMul(X);\n    const X12 = X1.redSqr();\n    const xx = cm1.redMul(s).redMul(X).redMul(X1);\n    const xz = u.isZero() ? this.one : Y;\n    const yy = rX.redSub(X12);\n    const yz = rX.redAdd(X12);\n\n    return this.cpoint(xx, xz, yy, yz);\n  }\n\n  _invert1(p, hint) {\n    // Inverting the Map (Elligator 1).\n    //\n    // [ELL1] Page 6, Section 3.\n    //        Page 15, Appendix A.\n    // [ELL2] Page 7, Section 3.3.\n    //\n    // Assumptions:\n    //\n    //   - y + 1 != 0.\n    //   - (1 + n * r)^2 - 1 is square in F(p).\n    //   - If n * r = -2 then x = 2 * s * (c - 1) * f(c) / r.\n    //   - Y = (c - 1) * s * X * (1 + X) / x.\n    //\n    // Map:\n    //\n    //   f(a) = a^((p - 1) / 2)\n    //   n = (y - 1) / (2 * (y + 1))\n    //   X = -(1 + n * r) + ((1 + n * r)^2 - 1)^((p + 1) / 4)\n    //   z = f((c - 1) * s * X * (1 + X) * x * (X^2 + 1 / c^2))\n    //   u = z * X\n    //   t = (1 - u) / (1 + u)\n    const {s, si, i2, one} = this;\n    const {x, y, z} = p;\n    const sign = hint & 1;\n    const c = si.redSqr().redIMuln(2);\n    const ci = s.redSqr().redMul(i2);\n    const ci2 = ci.redSqr();\n    const r = c.redAdd(ci);\n    const cm1 = c.redSub(one);\n    const nn = y.redSub(z);\n    const nz = y.redAdd(z).redIMuln(2);\n    const n = nz.isZero() ? nz : nn.redDiv(nz);\n    const nr1 = one.redAdd(n.redMul(r));\n    const w2 = nr1.redSqr().redISub(one);\n    const w = w2.redSqrt();\n    const X = w.redSub(nr1);\n    const X1 = one.redAdd(X);\n    const YY = cm1.redMul(s).redMul(X).redMul(X1);\n    const Y = YY.redMul(x.redMul(z));\n    const X2 = X.redSqr().redIAdd(ci2);\n    const Z = this.field(Y.redMul(X2).redJacobi());\n    const u = Z.redMul(X);\n    const tt = one.redSub(u);\n    const tz = one.redAdd(u);\n    const t = tz.isZero() ? tz : tt.redDiv(tz);\n\n    if (t.redIsOdd() !== Boolean(sign))\n      t.redINeg();\n\n    return t;\n  }\n\n  _alt() {\n    if (!this.alt)\n      this.alt = this.toMont();\n\n    return this.alt;\n  }\n\n  isElliptic() {\n    const ad = this.a.redMul(this.d);\n    const amd = this.a.redSub(this.d);\n\n    // a * d * (a - d) != 0\n    return !ad.redMul(amd).isZero();\n  }\n\n  jinv() {\n    // [TWISTED] Definition 2.1, Page 3, Section 2.\n    const {a, d} = this;\n    const ad = a.redMul(d);\n    const amd4 = a.redSub(d).redPown(4);\n    const a2 = a.redSqr();\n    const d2 = d.redSqr();\n    const t0 = a2.redAdd(ad.redMuln(14)).redIAdd(d2);\n    const lhs = t0.redPown(3).redIMuln(16);\n    const rhs = ad.redMul(amd4);\n\n    if (rhs.isZero())\n      throw new Error('Curve is not elliptic.');\n\n    // 16 * (a^2 + 14 * a * d + d^2)^3 / (a * d * (a - d)^4)\n    return lhs.redDiv(rhs).fromRed();\n  }\n\n  isComplete() {\n    return this.a.redJacobi() === 1\n        && this.d.redJacobi() === -1;\n  }\n\n  point(x, y, z, t) {\n    return new EdwardsPoint(this, x, y, z, t);\n  }\n\n  jpoint(x, y, z) {\n    assert(x == null && y == null && z == null);\n    return this.point();\n  }\n\n  cpoint(xx, xz, yy, yz) {\n    assert(xx instanceof BN);\n    assert(xz instanceof BN);\n    assert(yy instanceof BN);\n    assert(yz instanceof BN);\n\n    const x = xx.redMul(yz);\n    const y = yy.redMul(xz);\n    const z = xz.redMul(yz);\n    const t = xx.redMul(yy);\n\n    return this.point(x, y, z, t);\n  }\n\n  solveX2(y) {\n    // [RFC8032] Section 5.1.3 & 5.2.3.\n    assert(y instanceof BN);\n\n    // x^2 = (y^2 - 1) / (d * y^2 - a)\n    const y2 = y.redSqr();\n    const rhs = this._mulD(y2).redISub(this.a);\n    const lhs = y2.redISub(this.one);\n    const x2 = lhs.redDiv(rhs);\n\n    return x2;\n  }\n\n  solveX(y) {\n    // Optimize with inverse square root trick.\n    //\n    // Note that `0 / 0` can only occur if\n    // `a == d` (i.e. the curve is singular).\n    const y2 = y.redSqr();\n    const rhs = this._mulD(y2).redISub(this.a);\n    const lhs = y2.redISub(this.one);\n\n    return lhs.redDivSqrt(rhs);\n  }\n\n  solveY2(x) {\n    assert(x instanceof BN);\n\n    // y^2 = (a * x^2 - 1) / (d * x^2 - 1)\n    const x2 = x.redSqr();\n    const lhs = this._mulA(x2).redISub(this.one);\n    const rhs = this._mulD(x2).redISub(this.one);\n    const y2 = lhs.redDiv(rhs);\n\n    return y2;\n  }\n\n  solveY(x) {\n    // Optimize with inverse square root trick.\n    //\n    // Note that `0 / 0` can only occur if\n    // `a == d` (i.e. the curve is singular).\n    const x2 = x.redSqr();\n    const lhs = this._mulA(x2).redISub(this.one);\n    const rhs = this._mulD(x2).redISub(this.one);\n\n    return lhs.redDivSqrt(rhs);\n  }\n\n  validate(point) {\n    // [TWISTED] Definition 2.1, Page 3, Section 2.\n    //           Page 11, Section 6.\n    assert(point instanceof EdwardsPoint);\n\n    // Z1 = 1\n    if (point.zOne) {\n      // a * x^2 + y^2 = 1 + d * x^2 * y^2\n      const x2 = point.x.redSqr();\n      const y2 = point.y.redSqr();\n      const dxy = this._mulD(x2).redMul(y2);\n      const lhs = this._mulA(x2).redIAdd(y2);\n      const rhs = this.one.redAdd(dxy);\n      const tz = point.t;\n      const xy = point.x.redMul(point.y);\n\n      return lhs.eq(rhs) && tz.eq(xy);\n    }\n\n    // (a * x^2 + y^2) * z^2 = z^4 + d * x^2 * y^2\n    const x2 = point.x.redSqr();\n    const y2 = point.y.redSqr();\n    const z2 = point.z.redSqr();\n    const z4 = z2.redSqr();\n    const dxy = this._mulD(x2).redMul(y2);\n    const lhs = this._mulA(x2).redIAdd(y2).redMul(z2);\n    const rhs = z4.redIAdd(dxy);\n    const tz = point.t.redMul(point.z);\n    const xy = point.x.redMul(point.y);\n\n    return lhs.eq(rhs) && tz.eq(xy);\n  }\n\n  pointFromX(x, sign = null) {\n    assert(x instanceof BN);\n    assert(sign == null || typeof sign === 'boolean');\n\n    if (!x.red)\n      x = x.toRed(this.red);\n\n    const y = this.solveY(x);\n\n    if (sign != null) {\n      if (y.isZero() && sign)\n        throw new Error('Invalid point.');\n\n      if (y.redIsOdd() !== sign)\n        y.redINeg();\n    }\n\n    return this.point(x, y);\n  }\n\n  pointFromY(y, sign = null) {\n    assert(y instanceof BN);\n    assert(sign == null || typeof sign === 'boolean');\n\n    if (!y.red)\n      y = y.toRed(this.red);\n\n    const x = this.solveX(y);\n\n    if (sign != null) {\n      if (x.isZero() && sign)\n        throw new Error('Invalid point.');\n\n      if (x.redIsOdd() !== sign)\n        x.redINeg();\n    }\n\n    return this.point(x, y);\n  }\n\n  isIsomorphic(curve, invert = false) {\n    // [TWISTED] Theorem 3.2, Page 4, Section 3.\n    //           Definition 2.1, Page 3, Section 2.\n    assert(curve instanceof Curve);\n    assert(typeof invert === 'boolean');\n\n    if (!curve.p.eq(this.p))\n      return false;\n\n    // E(a,d) <-> E(a,b)\n    if (curve.type === 'short')\n      return curve.isIsomorphic(this);\n\n    // E(a,d) <-> M(A,B)\n    // E(a,d) <-> M(-A,-B)\n    if (curve.type === 'mont') {\n      // A * (a - d) = 2 * (a + d)\n      const a = this.field(curve.a);\n\n      let apd, amd;\n\n      if (invert) {\n        apd = this.d.redAdd(this.a);\n        amd = this.d.redSub(this.a);\n      } else {\n        apd = this.a.redAdd(this.d);\n        amd = this.a.redSub(this.d);\n      }\n\n      return a.redMul(amd).eq(apd.redIMuln(2));\n    }\n\n    // E(a,d) <-> E(a',a'd/a)\n    if (curve.type === 'edwards') {\n      // a' * d = a * d'\n      const a = this.field(curve.a);\n      const d = this.field(curve.d);\n\n      return this.a.redMul(d).eq(a.redMul(this.d));\n    }\n\n    return false;\n  }\n\n  isIsogenous(curve) {\n    // Check for the 4-isogenies described by Hamburg:\n    // https://moderncrypto.org/mail-archive/curves/2016/000806.html\n    assert(curve instanceof Curve);\n\n    if (!curve.p.eq(this.p))\n      return false;\n\n    // E(1,d) <-> M(2-4d,1)\n    if (curve.type === 'mont') {\n      if (!this.a.eq(this.one))\n        return false;\n\n      const a = this.field(curve.a);\n      const b = this.field(curve.b);\n      const d24 = this.two.redSub(this.d.redMuln(4));\n\n      return a.eq(d24) && b.eq(this.one);\n    }\n\n    // E(a,d) <-> E(-a,d-a)\n    if (curve.type === 'edwards') {\n      const a = this.field(curve.a);\n      const d = this.field(curve.d);\n\n      return a.eq(this.a.redNeg())\n          && d.eq(this.d.redSub(this.a));\n    }\n\n    return false;\n  }\n\n  pointFromShort(point) {\n    // [TWISTEQ] Section 1.\n    assert(point instanceof ShortPoint);\n\n    if (this.isIsomorphic(point.curve)) {\n      // Equivalence for E(a,b)->E(a',d'):\n      //\n      //   x' = (6 * x - a' - d') / (6 * y)\n      //   y' = (12 * x - 5 * a' + d') / (12 * x + a' - 5 * d')\n      //\n      // Undefined for x = (5 * d' - a') / 12 or y = 0.\n      //\n      // Exceptional Cases:\n      //   - O -> (0, 1)\n      //   - ((a' + d') / 6, 0) -> (0, -1)\n      //   - ((5 * d' - a') / 12, (d' - a') / 4 * sqrt(d')) -> (sqrt(1/d'), oo)\n      //\n      // Unexceptional Cases:\n      //   - ((5 * a' - d') / 12, (a' - d') / 4 * sqrt(a')) -> (sqrt(1/a'), 0)\n      if (point.isInfinity())\n        return this.point();\n\n      if (point.y.isZero())\n        return this.point(this.zero, this.one.redNeg());\n\n      const {a, d} = this;\n      const [u2, u3] = this._scale(point.curve);\n      const a5 = a.redMuln(5);\n      const d5 = d.redMuln(5);\n      const x = this.field(point.x).redMul(u2);\n      const y = this.field(point.y).redMul(u3);\n      const x6 = x.redMuln(6);\n      const x12 = x.redMuln(12);\n      const xx = x6.redSub(a).redISub(d);\n      const xz = y.redMuln(6);\n      const yy = x12.redSub(a5).redIAdd(d);\n      const yz = x12.redAdd(a).redISub(d5);\n\n      return this.cpoint(xx, xz, yy, yz);\n    }\n\n    throw new Error('Not implemented.');\n  }\n\n  pointFromMont(point) {\n    // [RFC7748] Section 4.1 & 4.2.\n    // [MONT3] Page 6, Section 2.5.\n    // [TWISTED] Theorem 3.2, Page 4, Section 3.\n    assert(point instanceof MontPoint);\n    assert(point.curve.p.eq(this.p));\n\n    // Montgomery `u`, `v`.\n    const u = this.field(point.x);\n    const v = this.field(point.y);\n\n    if (this.isIsogenous(point.curve)) {\n      // 4-isogeny maps for M(2-4d,1)->E(1,d):\n      //\n      //   x = 4 * v * (u^2 - 1) / (u^4 - 2 * u^2 + 4 * v^2 + 1)\n      //   y = -(u^5 - 2 * u^3 - 4 * u * v^2 + u) /\n      //        (u^5 - 2 * u^2 * v^2 - 2 * u^3 - 2 * v^2 + u)\n      //\n      // Undefined for u = 0 and v = 0.\n      //\n      // Exceptional Cases:\n      //   - O -> (0, 1)\n      //   - (0, 0) -> (0, 1)\n      //\n      // Unexceptional Cases:\n      //   - (-1, +-sqrt(A - 2)) -> (0, 1)\n      //   - (1, +-sqrt(A + 2)) -> (0, -1)\n      //\n      // The point (1, v) is invalid on Curve448.\n      if (point.isInfinity())\n        return this.point();\n\n      if (point.x.isZero())\n        return this.point();\n\n      const u2 = u.redSqr();\n      const u3 = u2.redMul(u);\n      const u4 = u3.redMul(u);\n      const u5 = u4.redMul(u);\n      const v2 = v.redSqr();\n      const a = v.redMuln(4);\n      const b = u2.redSub(this.one);\n      const c = u2.redMuln(2);\n      const d = v2.redMuln(4);\n      const e = u3.redIMuln(2);\n      const f = u.redMul(v2).redIMuln(4);\n      const g = u2.redMul(v2).redIMuln(2);\n      const h = v2.redIMuln(2);\n      const xx = a.redMul(b);\n      const xz = u4.redISub(c).redIAdd(d).redIAdd(this.one);\n      const yy = u5.redSub(e).redISub(f).redIAdd(u).redINeg();\n      const yz = u5.redISub(g).redISub(e).redISub(h).redIAdd(u);\n\n      return this.cpoint(xx, xz, yy, yz).divn(4);\n    }\n\n    if (this.isIsomorphic(point.curve, true)) {\n      // Isomorphic maps for M(-A,-B)->E(a,d):\n      //\n      //   x = +-sqrt((A - 2) / (B * a)) * u / v\n      //   y = (u + 1) / (u - 1)\n      //\n      // Undefined for u = 1 or v = 0.\n      //\n      // Exceptional Cases:\n      //   - O -> (0, 1)\n      //   - (0, 0) -> (0, -1)\n      //   - (1, +-sqrt((A + 2) / B)) -> (+-sqrt(1 / d), oo)\n      //\n      // Unexceptional Cases:\n      //   - (-1, +-sqrt((A - 2) / B)) -> (+-sqrt(1 / a), 0)\n      //\n      // The point (1, v) is invalid on Curve448.\n      if (point.isInfinity())\n        return this.point();\n\n      if (point.x.isZero())\n        return this.point(this.zero, this.one.redNeg());\n\n      const c = this._scale(point.curve, true);\n      const xx = c.redMul(u);\n      const xz = v;\n      const yy = u.redAdd(this.one);\n      const yz = u.redSub(this.one);\n\n      return this.cpoint(xx, xz, yy, yz);\n    }\n\n    if (this.isIsomorphic(point.curve, false)) {\n      // Isomorphic maps for M(A,B)->E(a,d):\n      //\n      //   x = +-sqrt((A + 2) / (B * a)) * u / v\n      //   y = (u - 1) / (u + 1)\n      //\n      // Undefined for u = -1 or v = 0.\n      //\n      // Exceptional Cases:\n      //   - O -> (0, 1)\n      //   - (0, 0) -> (0, -1)\n      //   - (-1, +-sqrt((A - 2) / B)) -> (+-sqrt(1 / d), oo)\n      //\n      // Unexceptional Cases:\n      //   - (1, +-sqrt((A + 2) / B)) -> (+-sqrt(1 / a), 0)\n      //\n      // The point (-1, v) is invalid on Curve25519.\n      if (point.isInfinity())\n        return this.point();\n\n      if (point.x.isZero())\n        return this.point(this.zero, this.one.redNeg());\n\n      const c = this._scale(point.curve, false);\n      const xx = c.redMul(u);\n      const xz = v;\n      const yy = u.redSub(this.one);\n      const yz = u.redAdd(this.one);\n\n      return this.cpoint(xx, xz, yy, yz);\n    }\n\n    throw new Error('Not implemented.');\n  }\n\n  pointFromEdwards(point) {\n    // [TWISTED] Definition 2.1, Page 3, Section 2.\n    // [ISOGENY] Page 2, Section 2.\n    assert(point instanceof EdwardsPoint);\n    assert(point.curve.p.eq(this.p));\n\n    // Edwards `x`, `y`, `z`, `t`.\n    const a = this.field(point.curve.a);\n    const x = this.field(point.x);\n    const y = this.field(point.y);\n    const z = this.field(point.z);\n    const t = this.field(point.t);\n\n    if (this.isIsogenous(point.curve)) {\n      // 4-isogeny maps for E(a,d)<->E(-a,d-a):\n      //\n      //   x' = (2 * x * y) / (y^2 - a * x^2)\n      //   y' = (y^2 + a * x^2) / (2 - y^2 - a * x^2)\n      //\n      // Undefined for y^2 - a * x^2 = 0\n      //            or y^2 + a * x^2 = 2.\n      const xy = x.redMul(y);\n      const x2 = x.redSqr();\n      const y2 = y.redSqr();\n      const z2 = z.redSqr();\n      const ax2 = a.redMul(x2);\n      const xx = xy.redIMuln(2);\n      const xz = y2.redSub(ax2);\n      const yy = y2.redAdd(ax2);\n      const yz = z2.redIMuln(2).redISub(yy);\n      const p = this.cpoint(xx, xz, yy, yz);\n\n      return !this.twisted ? p.divn(4) : p;\n    }\n\n    if (this.isIsomorphic(point.curve)) {\n      // Isomorphic maps for E(a,d)<->E(a',a'd/a):\n      //\n      //   x' = +-sqrt(a / a') * x\n      //   y' = y\n      //\n      // Undefined when (a / a') is not square.\n      const c = this._scale(point.curve);\n      const nx = c.redMul(x);\n      const ny = y;\n      const nz = z;\n      const nt = c.redMul(t);\n\n      return this.point(nx, ny, nz, nt);\n    }\n\n    throw new Error('Not implemented.');\n  }\n\n  pointFromUniform(u, curve = null) {\n    assert(u instanceof BN);\n    assert(u.red === this.red);\n    assert(curve == null || (curve instanceof MontCurve));\n\n    if (!curve)\n      curve = this._alt();\n\n    const u0 = curve.field(u);\n    const p0 = curve.pointFromUniform(u0);\n\n    return this.pointFromMont(p0);\n  }\n\n  pointToUniform(p, hint, curve = null) {\n    // Convert an edwards point to a field\n    // element by inverting the elligator2 map.\n    //\n    // Hint Layout:\n    //\n    //   [00000000] [0000] [0000]\n    //        |        |      |\n    //        |        |      +-- preimage index\n    //        |        +--- subgroup\n    //        +-- bits to OR with uniform bytes\n    assert(p instanceof EdwardsPoint);\n    assert((hint >>> 0) === hint);\n    assert(curve == null || (curve instanceof MontCurve));\n\n    if (!curve)\n      curve = this._alt();\n\n    // Add a random torsion component.\n    const i = ((hint >> 4) & 15) % this.torsion.length;\n    const q = p.add(this.torsion[i]);\n\n    // Convert and invert.\n    const p0 = curve.pointFromEdwards(q);\n    const u0 = curve.pointToUniform(p0, hint & 15);\n\n    return this.field(u0);\n  }\n\n  pointFromHash(bytes, pake, curve = null) {\n    assert(curve == null || (curve instanceof MontCurve));\n\n    if (!curve)\n      curve = this._alt();\n\n    const p0 = curve.pointFromHash(bytes, pake);\n\n    return this.pointFromMont(p0);\n  }\n\n  pointToHash(p, subgroup, rng, curve = null) {\n    assert(p instanceof EdwardsPoint);\n    assert((subgroup >>> 0) === subgroup);\n    assert(curve == null || (curve instanceof MontCurve));\n\n    if (!curve)\n      curve = this._alt();\n\n    // Add a random torsion component.\n    const i = subgroup % this.torsion.length;\n    const q = p.add(this.torsion[i]);\n\n    // Convert and invert.\n    const p0 = curve.pointFromEdwards(q);\n\n    return curve.pointToHash(p0, 0, rng);\n  }\n\n  decodePoint(bytes) {\n    return EdwardsPoint.decode(this, bytes);\n  }\n\n  toShort(a0, odd, sign = null) {\n    const [a, b] = this._short(a0, odd);\n\n    const curve = new ShortCurve({\n      red: this.red,\n      prime: this.prime,\n      p: this.p,\n      a: a,\n      b: b,\n      n: this.n,\n      h: this.h\n    });\n\n    if (sign != null) {\n      const [, u3] = curve._scale(this);\n\n      if (u3.redIsOdd() !== sign)\n        u3.redINeg();\n    }\n\n    if (!this.g.isInfinity())\n      curve.g = curve.pointFromEdwards(this.g);\n\n    for (let i = 0; i < this.h.word(0); i++)\n      curve.torsion[i] = curve.pointFromEdwards(this.torsion[i]);\n\n    return curve;\n  }\n\n  toMont(b0, invert, sign = null) {\n    const [a, b] = this._mont(b0, invert);\n\n    const curve = new MontCurve({\n      red: this.red,\n      prime: this.prime,\n      p: this.p,\n      a: a,\n      b: b,\n      n: this.n,\n      h: this.h,\n      z: this.z\n    });\n\n    if (sign != null) {\n      const c = this._scale(curve, invert);\n\n      if (c.redIsOdd() !== sign)\n        c.redINeg();\n    }\n\n    if (!this.g.isInfinity())\n      curve.g = curve.pointFromEdwards(this.g);\n\n    for (let i = 0; i < this.h.word(0); i++)\n      curve.torsion[i] = curve.pointFromEdwards(this.torsion[i]);\n\n    return curve;\n  }\n\n  toEdwards(a0, sign = null) {\n    const [a, d] = this._edwards(a0);\n\n    const curve = new EdwardsCurve({\n      red: this.red,\n      prime: this.prime,\n      p: this.p,\n      a: a,\n      d: d,\n      n: this.n,\n      h: this.h,\n      z: this.z\n    });\n\n    if (sign != null) {\n      const c = curve._scale(this);\n\n      if (c.redIsOdd() !== sign)\n        c.redINeg();\n    }\n\n    if (!this.g.isInfinity()) {\n      curve.g = curve.pointFromEdwards(this.g);\n      curve.g.normalize();\n    }\n\n    if (curve.isComplete()) {\n      for (let i = 0; i < this.h.word(0); i++) {\n        curve.torsion[i] = curve.pointFromEdwards(this.torsion[i]);\n        curve.torsion[i].normalize();\n      }\n    }\n\n    return curve;\n  }\n\n  pointFromJSON(json) {\n    return EdwardsPoint.fromJSON(this, json);\n  }\n\n  toJSON(pre) {\n    const json = super.toJSON(pre);\n\n    json.a = this.a.fromRed().toJSON();\n    json.d = this.d.fromRed().toJSON();\n\n    if (!this.s.isZero())\n      json.s = this.s.fromRed().toJSON();\n\n    return json;\n  }\n}\n\n/**\n * EdwardsPoint\n */\n\nclass EdwardsPoint extends Point {\n  constructor(curve, x, y, z, t) {\n    assert(curve instanceof EdwardsCurve);\n\n    super(curve, types.EXTENDED);\n\n    this.x = this.curve.zero;\n    this.y = this.curve.one;\n    this.z = this.curve.one;\n    this.t = this.curve.zero;\n    this.zOne = true;\n\n    if (x != null)\n      this._init(x, y, z, t);\n  }\n\n  _init(x, y, z, t) {\n    assert(x instanceof BN);\n    assert(y instanceof BN);\n    assert(z == null || (z instanceof BN));\n    assert(t == null || (t instanceof BN));\n\n    this.x = x;\n    this.y = y;\n    this.z = z || this.curve.one;\n    this.t = t || null;\n\n    if (!this.x.red)\n      this.x = this.x.toRed(this.curve.red);\n\n    if (!this.y.red)\n      this.y = this.y.toRed(this.curve.red);\n\n    if (!this.z.red)\n      this.z = this.z.toRed(this.curve.red);\n\n    if (this.t && !this.t.red)\n      this.t = this.t.toRed(this.curve.red);\n\n    this.zOne = this.z.eq(this.curve.one);\n\n    this._check();\n\n    if (!this.t) {\n      this.t = this.x.redMul(this.y);\n      if (!this.zOne)\n        this.t = this.t.redDiv(this.z);\n    }\n  }\n\n  _check() {\n    // In order to achieve complete\n    // addition formulas, `a` must\n    // be a square (always the case\n    // for a=1), and `d` must be a\n    // non-square.\n    //\n    // If this is not the case, the\n    // addition formulas may have\n    // exceptional cases where Z3=0.\n    //\n    // In particular, this can occur\n    // when: Q*h = -P*h and Q != -P.\n    //\n    // This is assuming 4-torsion is\n    // involved (the 4-torsion point\n    // is _not_ representable when\n    // `d` is square).\n    if (this.z.isZero())\n      throw new Error('Invalid point.');\n  }\n\n  clone() {\n    return this.curve.point(this.x, this.y, this.z, this.t);\n  }\n\n  normalize() {\n    // https://hyperelliptic.org/EFD/g1p/auto-edwards-projective.html#scaling-z\n    // 1I + 2M (+ 1M if extended)\n\n    // Z1 = 1\n    if (this.zOne)\n      return this;\n\n    // A = 1 / Z1\n    const a = this.z.redInvert();\n\n    // X3 = X1 * A\n    this.x = this.x.redMul(a);\n\n    // Y3 = Y1 * A\n    this.y = this.y.redMul(a);\n\n    // T3 = T1 * A\n    this.t = this.t.redMul(a);\n\n    // Z3 = 1\n    this.z = this.curve.one;\n    this.zOne = true;\n\n    return this;\n  }\n\n  scale(a) {\n    assert(a instanceof BN);\n\n    // X3 = X1 * A\n    const nx = this.x.redMul(a);\n\n    // Y3 = Y1 * A\n    const ny = this.y.redMul(a);\n\n    // Z3 = Z1 * A\n    const nz = this.z.redMul(a);\n\n    // T3 = T1 * A\n    const nt = this.t.redMul(a);\n\n    return this.curve.point(nx, ny, nz, nt);\n  }\n\n  neg() {\n    // -(X1, Y1, Z1, T1) = (-X1, Y1, Z1, -T1)\n    const nx = this.x.redNeg();\n    const ny = this.y;\n    const nz = this.z;\n    const nt = this.t.redNeg();\n\n    return this.curve.point(nx, ny, nz, nt);\n  }\n\n  add(p) {\n    assert(p instanceof EdwardsPoint);\n\n    // P = O\n    if (this.isInfinity())\n      return p;\n\n    // Q = O\n    if (p.isInfinity())\n      return this;\n\n    // Z1 = 1\n    if (this.zOne)\n      return p._add(this);\n\n    return this._add(p);\n  }\n\n  _add(p) {\n    // a = -1\n    if (this.curve.mOneA)\n      return this._addM1(p);\n\n    return this._addA(p);\n  }\n\n  _addM1(p) {\n    // Assumes a = -1.\n    //\n    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html#addition-add-2008-hwcd-3\n    // 8M + 8A + 1*k + 1*2\n    //\n    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html#addition-madd-2008-hwcd-3\n    // 7M + 8A + 1*k + 1*2\n\n    // A = (Y1 - X1) * (Y2 - X2)\n    const a = this.y.redSub(this.x).redMul(p.y.redSub(p.x));\n\n    // B = (Y1 + X1) * (Y2 + X2)\n    const b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x));\n\n    // C = T1 * k * T2\n    const c = this.t.redMul(this.curve.k).redMul(p.t);\n\n    // D = Z1 * 2 * Z2\n    const d = p.zOne ? this.z.redAdd(this.z) : this.z.redMul(p.z).redIMuln(2);\n\n    // E = B - A\n    const e = b.redSub(a);\n\n    // F = D - C\n    const f = d.redSub(c);\n\n    // G = D + C\n    const g = d.redIAdd(c);\n\n    // H = B + A\n    const h = b.redIAdd(a);\n\n    // X3 = E * F\n    const nx = e.redMul(f);\n\n    // Y3 = G * H\n    const ny = g.redMul(h);\n\n    // T3 = E * H\n    const nt = e.redMul(h);\n\n    // Z3 = F * G\n    const nz = f.redMul(g);\n\n    return this.curve.point(nx, ny, nz, nt);\n  }\n\n  _addA(p) {\n    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-add-2008-hwcd\n    // 9M + 7A + 1*a + 1*d\n    //\n    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#addition-madd-2008-hwcd\n    // 8M + 7A + 1*a + 1*d\n\n    // A = X1 * X2\n    const a = this.x.redMul(p.x);\n\n    // B = Y1 * Y2\n    const b = this.y.redMul(p.y);\n\n    // C = T1 * d * T2\n    const c = this.curve._mulD(this.t).redMul(p.t);\n\n    // D = Z1 * Z2\n    const d = p.zOne ? this.z.clone() : this.z.redMul(p.z);\n\n    // + XYXY = (X1 + Y1) * (X2 + Y2)\n    const xyxy = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y));\n\n    // E = (X1 + Y1) * (X2 + Y2) - A - B\n    const e = xyxy.redISub(a).redISub(b);\n\n    // F = D - C\n    const f = d.redSub(c);\n\n    // G = D + C\n    const g = d.redIAdd(c);\n\n    // H = B - a * A\n    const h = b.redISub(this.curve._mulA(a));\n\n    // X3 = E * F\n    const nx = e.redMul(f);\n\n    // Y3 = G * H\n    const ny = g.redMul(h);\n\n    // T3 = E * H\n    const nt = e.redMul(h);\n\n    // Z3 = F * G\n    const nz = f.redMul(g);\n\n    return this.curve.point(nx, ny, nz, nt);\n  }\n\n  dbl() {\n    // P = O\n    if (this.isInfinity())\n      return this;\n\n    return this._dbl();\n  }\n\n  _dbl() {\n    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-dbl-2008-hwcd\n    // 4M + 4S + 6A + 1*a + 1*2\n    //\n    // https://hyperelliptic.org/EFD/g1p/auto-twisted-extended.html#doubling-mdbl-2008-hwcd\n    // 3M + 4S + 7A + 1*a + 1*2\n\n    // A = X1^2\n    const a = this.x.redSqr();\n\n    // B = Y1^2\n    const b = this.y.redSqr();\n\n    // C = 2 * Z1^2\n    const c = this.zOne ? this.curve.two : this.z.redSqr().redIMuln(2);\n\n    // D = a * A\n    const d = this.curve._mulA(a);\n\n    // E = (X1 + Y1)^2 - A - B\n    const e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b);\n\n    // G = D + B\n    const g = d.redAdd(b);\n\n    // F = G - C\n    const f = g.redSub(c);\n\n    // H = D - B\n    const h = d.redISub(b);\n\n    // X3 = E * F\n    const nx = e.redMul(f);\n\n    // Y3 = G * H\n    const ny = g.redMul(h);\n\n    // T3 = E * H\n    const nt = e.redMul(h);\n\n    // Z3 = F * G\n    const nz = f.redMul(g);\n\n    return this.curve.point(nx, ny, nz, nt);\n  }\n\n  getX() {\n    this.normalize();\n    return this.x.fromRed();\n  }\n\n  getY() {\n    this.normalize();\n    return this.y.fromRed();\n  }\n\n  eq(p) {\n    assert(p instanceof EdwardsPoint);\n    assert(!this.z.isZero());\n    assert(!p.z.isZero());\n\n    // P = Q\n    if (this === p)\n      return true;\n\n    // Z1 = Z2\n    if (this.z.eq(p.z)) {\n      return this.x.eq(p.x)\n          && this.y.eq(p.y);\n    }\n\n    // X1 * Z2 = X2 * Z1\n    const x1 = this.x.redMul(p.z);\n    const x2 = p.x.redMul(this.z);\n\n    if (!x1.eq(x2))\n      return false;\n\n    const y1 = this.y.redMul(p.z);\n    const y2 = p.y.redMul(this.z);\n\n    return y1.eq(y2);\n  }\n\n  cmp(point) {\n    assert(point instanceof EdwardsPoint);\n\n    return this.order().cmp(point.order())\n        || this.getY().cmp(point.getY())\n        || this.getX().cmp(point.getX());\n  }\n\n  isInfinity() {\n    assert(!this.z.isZero());\n\n    // X1 = 0\n    if (!this.x.isZero())\n      return false;\n\n    // Y1 = Z1\n    return this.y.eq(this.z);\n  }\n\n  isOrder2() {\n    if (this.isInfinity())\n      return false;\n\n    return this.x.isZero();\n  }\n\n  isOdd() {\n    this.normalize();\n    return this.x.redIsOdd();\n  }\n\n  isEven() {\n    this.normalize();\n    return this.x.redIsEven();\n  }\n\n  toP() {\n    return this.normalize();\n  }\n\n  toJ() {\n    return this;\n  }\n\n  encode() {\n    // [RFC8032] Section 5.1.2.\n    const y = this.getY();\n\n    // Note: `x` normalized from `getY()` call.\n    y.setn(this.curve.signBit, this.x.redIsOdd());\n\n    return this.curve.encodeAdjusted(y);\n  }\n\n  static decode(curve, bytes) {\n    // [RFC8032] Section 5.1.3.\n    assert(curve instanceof EdwardsCurve);\n\n    const y = curve.decodeAdjusted(bytes);\n    const sign = y.testn(curve.signBit) !== 0;\n\n    y.setn(curve.signBit, 0);\n\n    if (y.cmp(curve.p) >= 0)\n      throw new Error('Invalid point.');\n\n    return curve.pointFromY(y, sign);\n  }\n\n  toJSON(pre) {\n    if (this.isInfinity())\n      return [];\n\n    const x = this.getX().toJSON();\n    const y = this.getY().toJSON();\n\n    if (pre === true && this.pre)\n      return [x, y, this.pre.toJSON()];\n\n    return [x, y];\n  }\n\n  toPretty() {\n    const size = this.curve.fieldSize * 2;\n    const x = toPretty(this.getX(), size);\n    const y = toPretty(this.getY(), size);\n\n    return [x, y];\n  }\n\n  static fromJSON(curve, json) {\n    assert(curve instanceof EdwardsCurve);\n    assert(Array.isArray(json));\n    assert(json.length === 0\n        || json.length === 2\n        || json.length === 3);\n\n    if (json.length === 0)\n      return curve.point();\n\n    const x = BN.fromJSON(json[0]);\n    const y = BN.fromJSON(json[1]);\n    const point = curve.point(x, y);\n\n    if (json.length > 2 && json[2] != null)\n      point.pre = Precomp.fromJSON(point, json[2]);\n\n    return point;\n  }\n\n  [custom]() {\n    if (this.isInfinity())\n      return '<EdwardsPoint: Infinity>';\n\n    return '<EdwardsPoint:'\n        + ' x=' + this.x.fromRed().toString(16, 2)\n        + ' y=' + this.y.fromRed().toString(16, 2)\n        + ' z=' + this.z.fromRed().toString(16, 2)\n        + '>';\n  }\n}\n\n/**\n * Precomp\n */\n\nclass Precomp {\n  constructor() {\n    this.naf = null;\n    this.windows = null;\n    this.doubles = null;\n    this.blinding = null;\n    this.beta = null;\n  }\n\n  map(func) {\n    assert(typeof func === 'function');\n\n    const out = new this.constructor();\n\n    if (this.naf)\n      out.naf = this.naf.map(func);\n\n    if (this.doubles)\n      out.doubles = this.doubles.map(func);\n\n    return out;\n  }\n\n  toJSON() {\n    return {\n      naf: this.naf ? this.naf.toJSON() : null,\n      windows: this.windows ? this.windows.toJSON() : null,\n      doubles: this.doubles ? this.doubles.toJSON() : null,\n      blinding: this.blinding ? this.blinding.toJSON() : undefined\n    };\n  }\n\n  fromJSON(point, json) {\n    assert(point instanceof Point);\n    assert(json && typeof json === 'object');\n\n    if (json.naf != null)\n      this.naf = NAF.fromJSON(point, json.naf);\n\n    if (json.windows != null)\n      this.windows = Windows.fromJSON(point, json.windows);\n\n    if (json.doubles != null)\n      this.doubles = Doubles.fromJSON(point, json.doubles);\n\n    if (json.blinding != null)\n      this.blinding = Blinding.fromJSON(point, json.blinding);\n\n    return this;\n  }\n\n  static fromJSON(point, json) {\n    return new this().fromJSON(point, json);\n  }\n}\n\n/**\n * NAF\n */\n\nclass NAF {\n  constructor(width, points) {\n    this.width = width;\n    this.points = points;\n  }\n\n  map(func) {\n    assert(typeof func === 'function');\n\n    const {width} = this;\n    const points = [];\n\n    for (const point of this.points)\n      points.push(func(point));\n\n    return new this.constructor(width, points);\n  }\n\n  toJSON() {\n    return {\n      width: this.width,\n      points: this.points.slice(1).map((point) => {\n        return point.toJSON();\n      })\n    };\n  }\n\n  static fromJSON(point, json) {\n    assert(point instanceof Point);\n    assert(json && typeof json === 'object');\n    assert((json.width >>> 0) === json.width);\n    assert(Array.isArray(json.points));\n\n    const {curve} = point;\n    const {width} = json;\n    const points = [point];\n\n    for (const item of json.points)\n      points.push(curve.pointFromJSON(item));\n\n    return new this(width, points);\n  }\n}\n\n/**\n * Windows\n */\n\nclass Windows {\n  constructor(width, bits, points) {\n    this.width = width;\n    this.bits = bits;\n    this.points = points;\n  }\n\n  toJSON() {\n    return {\n      width: this.width,\n      bits: this.bits,\n      points: this.points.slice(1).map((point) => {\n        return point.toJSON();\n      })\n    };\n  }\n\n  static fromJSON(point, json) {\n    assert(point instanceof Point);\n    assert(json && typeof json === 'object');\n    assert((json.width >>> 0) === json.width);\n    assert((json.bits >>> 0) === json.bits);\n    assert(Array.isArray(json.points));\n\n    const {curve} = point;\n    const {width, bits} = json;\n    const points = [point];\n\n    for (const item of json.points)\n      points.push(curve.pointFromJSON(item));\n\n    return new this(width, bits, points);\n  }\n}\n\n/**\n * Doubles\n */\n\nclass Doubles {\n  constructor(step, points) {\n    this.step = step;\n    this.points = points;\n  }\n\n  map(func) {\n    assert(typeof func === 'function');\n\n    const {step} = this;\n    const points = [];\n\n    for (const point of this.points)\n      points.push(func(point));\n\n    return new this.constructor(step, points);\n  }\n\n  toJSON() {\n    return {\n      step: this.step,\n      points: this.points.slice(1).map((point) => {\n        return point.toJSON();\n      })\n    };\n  }\n\n  static fromJSON(point, json) {\n    assert(point instanceof Point);\n    assert(json && typeof json === 'object');\n    assert((json.step >>> 0) === json.step);\n    assert(Array.isArray(json.points));\n\n    const {curve} = point;\n    const {step} = json;\n    const points = [point];\n\n    for (const item of json.points)\n      points.push(curve.pointFromJSON(item));\n\n    return new this(step, points);\n  }\n}\n\n/**\n * Blinding\n */\n\nclass Blinding {\n  constructor(blind, unblind) {\n    this.blind = blind;\n    this.unblind = unblind;\n  }\n\n  toJSON() {\n    return {\n      blind: this.blind.toJSON(),\n      unblind: this.unblind.toJSON()\n    };\n  }\n\n  static fromJSON(point, json) {\n    assert(point instanceof Point);\n    assert(json && typeof json === 'object');\n\n    const {curve} = point;\n    const blind = BN.fromJSON(json.blind);\n    const unblind = curve.pointFromJSON(json.unblind);\n\n    return new this(blind, unblind);\n  }\n}\n\n/**\n * Endo\n */\n\nclass Endo {\n  constructor(beta, lambda, basis, pre) {\n    this.beta = beta;\n    this.lambda = lambda;\n    this.basis = basis;\n    this.pre = pre;\n  }\n\n  toJSON() {\n    return {\n      beta: this.beta.fromRed().toJSON(),\n      lambda: this.lambda.toJSON(),\n      basis: [\n        this.basis[0].toJSON(),\n        this.basis[1].toJSON()\n      ],\n      pre: [\n        this.pre[0],\n        this.pre[1].toJSON(),\n        this.pre[2].toJSON()\n      ]\n    };\n  }\n\n  static fromJSON(curve, json) {\n    assert(curve instanceof Curve);\n    assert(json && typeof json === 'object');\n    assert(Array.isArray(json.basis));\n    assert(Array.isArray(json.pre));\n    assert(json.basis.length === 2);\n    assert(json.pre.length === 3);\n    assert((json.pre[0] >>> 0) === json.pre[0]);\n\n    const beta = BN.fromJSON(json.beta).toRed(curve.red);\n    const lambda = BN.fromJSON(json.lambda);\n\n    const basis = [\n      Vector.fromJSON(json.basis[0]),\n      Vector.fromJSON(json.basis[1])\n    ];\n\n    const pre = [\n      json.pre[0],\n      BN.fromJSON(json.pre[1]),\n      BN.fromJSON(json.pre[2])\n    ];\n\n    return new this(beta, lambda, basis, pre);\n  }\n}\n\n/**\n * Vector\n */\n\nclass Vector {\n  constructor(a, b) {\n    this.a = a;\n    this.b = b;\n  }\n\n  toJSON() {\n    return {\n      a: this.a.toJSON(),\n      b: this.b.toJSON()\n    };\n  }\n\n  static fromJSON(json) {\n    assert(json && typeof json === 'object');\n\n    const a = BN.fromJSON(json.a);\n    const b = BN.fromJSON(json.b);\n\n    return new this(a, b);\n  }\n}\n\n/**\n * P192\n * https://tinyurl.com/fips-186-2 (page 29)\n * https://tinyurl.com/fips-186-3 (page 88)\n */\n\nclass P192 extends ShortCurve {\n  constructor(pre) {\n    super({\n      id: 'P192',\n      ossl: 'prime192v1',\n      type: 'short',\n      endian: 'be',\n      hash: 'SHA256',\n      prime: 'p192',\n      // 2^192 - 2^64 - 1 (= 3 mod 4)\n      p: ['ffffffff ffffffff ffffffff fffffffe',\n          'ffffffff ffffffff'],\n      // -3 mod p\n      a: ['ffffffff ffffffff ffffffff fffffffe',\n          'ffffffff fffffffc'],\n      b: ['64210519 e59c80e7 0fa7e9ab 72243049',\n          'feb8deec c146b9b1'],\n      n: ['ffffffff ffffffff ffffffff 99def836',\n          '146bc9b1 b4d22831'],\n      h: '1',\n      // Icart\n      z: '-5',\n      g: [\n        ['188da80e b03090f6 7cbf20eb 43a18800',\n         'f4ff0afd 82ff1012'],\n        ['07192b95 ffc8da78 631011ed 6b24cdd5',\n         '73f977a1 1e794811'],\n        pre\n      ]\n    });\n  }\n}\n\n/**\n * P224\n * https://tinyurl.com/fips-186-2 (page 30)\n * https://tinyurl.com/fips-186-3 (page 88)\n */\n\nclass P224 extends ShortCurve {\n  constructor(pre) {\n    super({\n      id: 'P224',\n      ossl: 'secp224r1',\n      type: 'short',\n      endian: 'be',\n      hash: 'SHA256',\n      prime: 'p224',\n      // 2^224 - 2^96 + 1 (1 mod 16)\n      p: ['ffffffff ffffffff ffffffff ffffffff',\n          '00000000 00000000 00000001'],\n      // -3 mod p\n      a: ['ffffffff ffffffff ffffffff fffffffe',\n          'ffffffff ffffffff fffffffe'],\n      b: ['b4050a85 0c04b3ab f5413256 5044b0b7',\n          'd7bfd8ba 270b3943 2355ffb4'],\n      n: ['ffffffff ffffffff ffffffff ffff16a2',\n          'e0b8f03e 13dd2945 5c5c2a3d'],\n      h: '1',\n      // SSWU\n      z: '1f',\n      g: [\n        ['b70e0cbd 6bb4bf7f 321390b9 4a03c1d3',\n         '56c21122 343280d6 115c1d21'],\n        ['bd376388 b5f723fb 4c22dfe6 cd4375a0',\n         '5a074764 44d58199 85007e34'],\n        pre\n      ]\n    });\n  }\n}\n\n/**\n * P256\n * https://tinyurl.com/fips-186-2 (page 31)\n * https://tinyurl.com/fips-186-3 (page 89)\n */\n\nclass P256 extends ShortCurve {\n  constructor(pre) {\n    super({\n      id: 'P256',\n      ossl: 'prime256v1',\n      type: 'short',\n      endian: 'be',\n      hash: 'SHA256',\n      prime: null,\n      // 2^256 - 2^224 + 2^192 + 2^96 - 1 (= 3 mod 4)\n      p: ['ffffffff 00000001 00000000 00000000',\n          '00000000 ffffffff ffffffff ffffffff'],\n      // -3 mod p\n      a: ['ffffffff 00000001 00000000 00000000',\n          '00000000 ffffffff ffffffff fffffffc'],\n      b: ['5ac635d8 aa3a93e7 b3ebbd55 769886bc',\n          '651d06b0 cc53b0f6 3bce3c3e 27d2604b'],\n      n: ['ffffffff 00000000 ffffffff ffffffff',\n          'bce6faad a7179e84 f3b9cac2 fc632551'],\n      h: '1',\n      // SSWU\n      z: '-a',\n      g: [\n        ['6b17d1f2 e12c4247 f8bce6e5 63a440f2',\n         '77037d81 2deb33a0 f4a13945 d898c296'],\n        ['4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16',\n         '2bce3357 6b315ece cbb64068 37bf51f5'],\n        pre\n      ]\n    });\n  }\n}\n\n/**\n * P384\n * https://tinyurl.com/fips-186-2 (page 32)\n * https://tinyurl.com/fips-186-3 (page 89)\n */\n\nclass P384 extends ShortCurve {\n  constructor(pre) {\n    super({\n      id: 'P384',\n      ossl: 'secp384r1',\n      type: 'short',\n      endian: 'be',\n      hash: 'SHA384',\n      prime: null,\n      // 2^384 - 2^128 - 2^96 + 2^32 - 1 (= 3 mod 4)\n      p: ['ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff fffffffe',\n          'ffffffff 00000000 00000000 ffffffff'],\n      // -3 mod p\n      a: ['ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff fffffffe',\n          'ffffffff 00000000 00000000 fffffffc'],\n      b: ['b3312fa7 e23ee7e4 988e056b e3f82d19',\n          '181d9c6e fe814112 0314088f 5013875a',\n          'c656398d 8a2ed19d 2a85c8ed d3ec2aef'],\n      n: ['ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff c7634d81 f4372ddf',\n          '581a0db2 48b0a77a ecec196a ccc52973'],\n      h: '1',\n      // Icart\n      z: '-c',\n      g: [\n        ['aa87ca22 be8b0537 8eb1c71e f320ad74',\n         '6e1d3b62 8ba79b98 59f741e0 82542a38',\n         '5502f25d bf55296c 3a545e38 72760ab7'],\n        ['3617de4a 96262c6f 5d9e98bf 9292dc29',\n         'f8f41dbd 289a147c e9da3113 b5f0b8c0',\n         '0a60b1ce 1d7e819d 7a431d7c 90ea0e5f'],\n        pre\n      ]\n    });\n  }\n}\n\n/**\n * P521\n * https://tinyurl.com/fips-186-2 (page 33)\n * https://tinyurl.com/fips-186-3 (page 90)\n */\n\nclass P521 extends ShortCurve {\n  constructor(pre) {\n    super({\n      id: 'P521',\n      ossl: 'secp521r1',\n      type: 'short',\n      endian: 'be',\n      hash: 'SHA512',\n      prime: 'p521',\n      // 2^521 - 1 (= 3 mod 4)\n      p: ['000001ff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff'],\n      // -3 mod p\n      a: ['000001ff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'fffffffc'],\n      b: ['00000051 953eb961 8e1c9a1f 929a21a0',\n          'b68540ee a2da725b 99b315f3 b8b48991',\n          '8ef109e1 56193951 ec7e937b 1652c0bd',\n          '3bb1bf07 3573df88 3d2c34f1 ef451fd4',\n          '6b503f00'],\n      n: ['000001ff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'fffffffa 51868783 bf2f966b 7fcc0148',\n          'f709a5d0 3bb5c9b8 899c47ae bb6fb71e',\n          '91386409'],\n      h: '1',\n      // SSWU\n      z: '-4',\n      g: [\n        ['000000c6 858e06b7 0404e9cd 9e3ecb66',\n         '2395b442 9c648139 053fb521 f828af60',\n         '6b4d3dba a14b5e77 efe75928 fe1dc127',\n         'a2ffa8de 3348b3c1 856a429b f97e7e31',\n         'c2e5bd66'],\n        ['00000118 39296a78 9a3bc004 5c8a5fb4',\n         '2c7d1bd9 98f54449 579b4468 17afbd17',\n         '273e662c 97ee7299 5ef42640 c550b901',\n         '3fad0761 353c7086 a272c240 88be9476',\n         '9fd16650'],\n        pre\n      ]\n    });\n  }\n}\n\n/**\n * SECP256K1\n * https://www.secg.org/SEC2-Ver-1.0.pdf (page 15, section 2.7.1)\n * https://www.secg.org/sec2-v2.pdf (page 9, section 2.4.1)\n */\n\nclass SECP256K1 extends ShortCurve {\n  constructor(pre) {\n    super({\n      id: 'SECP256K1',\n      ossl: 'secp256k1',\n      type: 'short',\n      endian: 'be',\n      hash: 'SHA256',\n      prime: 'k256',\n      // 2^256 - 2^32 - 977 (= 3 mod 4)\n      p: ['ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff fffffffe fffffc2f'],\n      a: '0',\n      b: '7',\n      n: ['ffffffff ffffffff ffffffff fffffffe',\n          'baaedce6 af48a03b bfd25e8c d0364141'],\n      h: '1',\n      // SVDW\n      z: '1',\n      // sqrt(-3)\n      c: ['0a2d2ba9 3507f1df 233770c2 a797962c',\n          'c61f6d15 da14ecd4 7d8d27ae 1cd5f852'],\n      g: [\n        ['79be667e f9dcbbac 55a06295 ce870b07',\n         '029bfcdb 2dce28d9 59f2815b 16f81798'],\n        ['483ada77 26a3c465 5da4fbfc 0e1108a8',\n         'fd17b448 a6855419 9c47d08f fb10d4b8'],\n        pre\n      ],\n      // Precomputed endomorphism.\n      endo: {\n        beta: ['7ae96a2b 657c0710 6e64479e ac3434e9',\n               '9cf04975 12f58995 c1396c28 719501ee'],\n        lambda: ['5363ad4c c05c30e0 a5261c02 8812645a',\n                 '122e22ea 20816678 df02967c 1b23bd72'],\n        basis: [\n          {\n            a: '3086d221a7d46bcde86c90e49284eb15',\n            b: '-e4437ed6010e88286f547fa90abfe4c3'\n          },\n          {\n            a: '114ca50f7a8e2f3f657c1108d9d44cfd8',\n            b: '3086d221a7d46bcde86c90e49284eb15'\n          }\n        ],\n        pre: [\n          384,\n          ['3086d221 a7d46bcd e86c90e4 9284eb15',\n           '3daa8a14 71e8ca7f e893209a 45dbb031'],\n          ['-',\n           'e4437ed6 010e8828 6f547fa9 0abfe4c4',\n           '221208ac 9df506c6 1571b4ae 8ac47f71']\n        ]\n      }\n    });\n  }\n}\n\n/**\n * BRAINPOOLP256\n * https://tools.ietf.org/html/rfc5639#section-3.4\n */\n\nclass BRAINPOOLP256 extends ShortCurve {\n  constructor(pre) {\n    super({\n      id: 'BRAINPOOLP256',\n      ossl: 'brainpoolP256r1',\n      type: 'short',\n      endian: 'be',\n      hash: 'SHA256',\n      prime: null,\n      // (= 3 mod 4)\n      p: ['a9fb57db a1eea9bc 3e660a90 9d838d72',\n          '6e3bf623 d5262028 2013481d 1f6e5377'],\n      a: ['7d5a0975 fc2c3057 eef67530 417affe7',\n          'fb8055c1 26dc5c6c e94a4b44 f330b5d9'],\n      b: ['26dc5c6c e94a4b44 f330b5d9 bbd77cbf',\n          '95841629 5cf7e1ce 6bccdc18 ff8c07b6'],\n      n: ['a9fb57db a1eea9bc 3e660a90 9d838d71',\n          '8c397aa3 b561a6f7 901e0e82 974856a7'],\n      h: '1',\n      // Icart\n      z: '-2',\n      g: [\n        ['8bd2aeb9 cb7e57cb 2c4b482f fc81b7af',\n         'b9de27e1 e3bd23c2 3a4453bd 9ace3262'],\n        ['547ef835 c3dac4fd 97f8461a 14611dc9',\n         'c2774513 2ded8e54 5c1d54c7 2f046997'],\n        pre\n      ]\n    });\n  }\n}\n\n/**\n * BRAINPOOLP384\n * https://tools.ietf.org/html/rfc5639#section-3.6\n */\n\nclass BRAINPOOLP384 extends ShortCurve {\n  constructor(pre) {\n    super({\n      id: 'BRAINPOOLP384',\n      ossl: 'brainpoolP384r1',\n      type: 'short',\n      endian: 'be',\n      hash: 'SHA384',\n      prime: null,\n      // (= 3 mod 4)\n      p: ['8cb91e82 a3386d28 0f5d6f7e 50e641df',\n          '152f7109 ed5456b4 12b1da19 7fb71123',\n          'acd3a729 901d1a71 87470013 3107ec53'],\n      a: ['7bc382c6 3d8c150c 3c72080a ce05afa0',\n          'c2bea28e 4fb22787 139165ef ba91f90f',\n          '8aa5814a 503ad4eb 04a8c7dd 22ce2826'],\n      b: ['04a8c7dd 22ce2826 8b39b554 16f0447c',\n          '2fb77de1 07dcd2a6 2e880ea5 3eeb62d5',\n          '7cb43902 95dbc994 3ab78696 fa504c11'],\n      n: ['8cb91e82 a3386d28 0f5d6f7e 50e641df',\n          '152f7109 ed5456b3 1f166e6c ac0425a7',\n          'cf3ab6af 6b7fc310 3b883202 e9046565'],\n      h: '1',\n      // SSWU\n      z: '-5',\n      g: [\n        ['1d1c64f0 68cf45ff a2a63a81 b7c13f6b',\n         '8847a3e7 7ef14fe3 db7fcafe 0cbd10e8',\n         'e826e034 36d646aa ef87b2e2 47d4af1e'],\n        ['8abe1d75 20f9c2a4 5cb1eb8e 95cfd552',\n         '62b70b29 feec5864 e19c054f f9912928',\n         '0e464621 77918111 42820341 263c5315'],\n        pre\n      ]\n    });\n  }\n}\n\n/**\n * BRAINPOOLP512\n * https://tools.ietf.org/html/rfc5639#section-3.7\n */\n\nclass BRAINPOOLP512 extends ShortCurve {\n  constructor(pre) {\n    super({\n      id: 'BRAINPOOLP512',\n      ossl: 'brainpoolP512r1',\n      type: 'short',\n      endian: 'be',\n      hash: 'SHA512',\n      prime: null,\n      // (= 3 mod 4)\n      p: ['aadd9db8 dbe9c48b 3fd4e6ae 33c9fc07',\n          'cb308db3 b3c9d20e d6639cca 70330871',\n          '7d4d9b00 9bc66842 aecda12a e6a380e6',\n          '2881ff2f 2d82c685 28aa6056 583a48f3'],\n      a: ['7830a331 8b603b89 e2327145 ac234cc5',\n          '94cbdd8d 3df91610 a83441ca ea9863bc',\n          '2ded5d5a a8253aa1 0a2ef1c9 8b9ac8b5',\n          '7f1117a7 2bf2c7b9 e7c1ac4d 77fc94ca'],\n      b: ['3df91610 a83441ca ea9863bc 2ded5d5a',\n          'a8253aa1 0a2ef1c9 8b9ac8b5 7f1117a7',\n          '2bf2c7b9 e7c1ac4d 77fc94ca dc083e67',\n          '984050b7 5ebae5dd 2809bd63 8016f723'],\n      n: ['aadd9db8 dbe9c48b 3fd4e6ae 33c9fc07',\n          'cb308db3 b3c9d20e d6639cca 70330870',\n          '553e5c41 4ca92619 41866119 7fac1047',\n          '1db1d381 085ddadd b5879682 9ca90069'],\n      h: '1',\n      // Icart\n      z: '7',\n      g: [\n        ['81aee4bd d82ed964 5a21322e 9c4c6a93',\n         '85ed9f70 b5d916c1 b43b62ee f4d0098e',\n         'ff3b1f78 e2d0d48d 50d1687b 93b97d5f',\n         '7c6d5047 406a5e68 8b352209 bcb9f822'],\n        ['7dde385d 566332ec c0eabfa9 cf7822fd',\n         'f209f700 24a57b1a a000c55b 881f8111',\n         'b2dcde49 4a5f485e 5bca4bd8 8a2763ae',\n         'd1ca2b2f a8f05406 78cd1e0f 3ad80892'],\n        pre\n      ]\n    });\n  }\n}\n\n/**\n * X25519\n * https://tools.ietf.org/html/rfc7748#section-4.1\n */\n\nclass X25519 extends MontCurve {\n  constructor() {\n    super({\n      id: 'X25519',\n      ossl: 'X25519',\n      type: 'mont',\n      endian: 'le',\n      hash: 'SHA512',\n      prime: 'p25519',\n      // 2^255 - 19 (= 5 mod 8)\n      p: ['7fffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff ffffffed'],\n      // 486662\n      a: '76d06',\n      b: '1',\n      n: ['10000000 00000000 00000000 00000000',\n          '14def9de a2f79cd6 5812631a 5cf5d3ed'],\n      h: '8',\n      // Elligator 2\n      z: '2',\n      g: [\n        ['00000000 00000000 00000000 00000000',\n         '00000000 00000000 00000000 00000009'],\n        // See: https://www.rfc-editor.org/errata/eid4730\n        ['5f51e65e 475f794b 1fe122d3 88b72eb3',\n         '6dc2b281 92839e4d d6163a5d 81312c14']\n      ],\n      torsion: [\n        [],\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000']\n        ],\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000001'],\n          ['6be4f497 f9a9c2af c21fa77a d7f4a6ef',\n           '635a11c7 284a9363 e9a248ef 9c884415']\n        ],\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000001'],\n          ['141b0b68 06563d50 3de05885 280b5910',\n           '9ca5ee38 d7b56c9c 165db710 6377bbd8']\n        ],\n        [\n          ['57119fd0 dd4e22d8 868e1c58 c45c4404',\n           '5bef839c 55b1d0b1 248c50a3 bc959c5f'],\n          ['68c59389 3d458e64 31c6ca00 45fb5015',\n           '20a44346 8eaa68dd 0f103842 048065b7']\n        ],\n        [\n          ['57119fd0 dd4e22d8 868e1c58 c45c4404',\n           '5bef839c 55b1d0b1 248c50a3 bc959c5f'],\n          ['173a6c76 c2ba719b ce3935ff ba04afea',\n           'df5bbcb9 71559722 f0efc7bd fb7f9a36']\n        ],\n        [\n          ['00b8495f 16056286 fdb1329c eb8d09da',\n           '6ac49ff1 fae35616 aeb8413b 7c7aebe0'],\n          ['3931c129 569e83a5 29482c14 e628b457',\n           '933bfc29 ed801b4d 68871483 92507b1a']\n        ],\n        [\n          ['00b8495f 16056286 fdb1329c eb8d09da',\n           '6ac49ff1 fae35616 aeb8413b 7c7aebe0'],\n          ['46ce3ed6 a9617c5a d6b7d3eb 19d74ba8',\n           '6cc403d6 127fe4b2 9778eb7c 6daf84d3']\n        ]\n      ]\n    });\n  }\n}\n\n/**\n * X448\n * https://tools.ietf.org/html/rfc7748#section-4.2\n */\n\nclass X448 extends MontCurve {\n  constructor() {\n    super({\n      id: 'X448',\n      ossl: 'X448',\n      type: 'mont',\n      endian: 'le',\n      hash: 'SHAKE256',\n      prime: 'p448',\n      // 2^448 - 2^224 - 1 (= 3 mod 4)\n      p: ['ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff fffffffe ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff'],\n      // 156326\n      a: '262a6',\n      b: '1',\n      n: ['3fffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff 7cca23e9',\n          'c44edb49 aed63690 216cc272 8dc58f55',\n          '2378c292 ab5844f3'],\n      h: '4',\n      // Elligator 2\n      z: '-1',\n      g: [\n        ['00000000 00000000 00000000 00000000',\n         '00000000 00000000 00000000 00000000',\n         '00000000 00000000 00000000 00000000',\n         '00000000 00000005'],\n        ['7d235d12 95f5b1f6 6c98ab6e 58326fce',\n         'cbae5d34 f55545d0 60f75dc2 8df3f6ed',\n         'b8027e23 46430d21 1312c4b1 50677af7',\n         '6fd7223d 457b5b1a']\n      ],\n      torsion: [\n        [],\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000']\n        ],\n        [\n          ['ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff ffffffff fffffffe ffffffff',\n           'ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff fffffffe'],\n          ['ba4d3a08 29b6112f 8812e51b a0bb2abe',\n           'bc1cb08e b48e5569 36ba50fd d2e7d68a',\n           'f8cb3216 0522425b 3f990812 abbe635a',\n           'd37a21e1 7551b193']\n        ],\n        [\n          ['ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff ffffffff fffffffe ffffffff',\n           'ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff fffffffe'],\n          ['45b2c5f7 d649eed0 77ed1ae4 5f44d541',\n           '43e34f71 4b71aa96 c945af01 2d182975',\n           '0734cde9 faddbda4 c066f7ed 54419ca5',\n           '2c85de1e 8aae4e6c']\n        ]\n      ]\n    });\n  }\n}\n\n/**\n * MONT448\n * Isomorphic to Ed448-Goldilocks.\n */\n\nclass MONT448 extends MontCurve {\n  constructor() {\n    super({\n      id: 'MONT448',\n      ossl: null,\n      type: 'mont',\n      endian: 'le',\n      hash: 'SHAKE256',\n      prime: 'p448',\n      // 2^448 - 2^224 - 1 (= 3 mod 4)\n      p: ['ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff fffffffe ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff'],\n      // -78160 / -39082 mod p\n      a: ['b2cf97d2 d43459a9 31ed36b1 fc4e3cb5',\n          '5d93f8d2 22746997 60ccffc6 49961ed6',\n          'c5b05fca c24864ed 6fb59697 931b78da',\n          '84ddecd8 ca2b5cfb'],\n      b: '1',\n      n: ['3fffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff 7cca23e9',\n          'c44edb49 aed63690 216cc272 8dc58f55',\n          '2378c292 ab5844f3'],\n      h: '4',\n      // Elligator 2\n      z: '-1',\n      g: [\n        ['ac0d24cc c6c75cb0 eb71f81e 7a6edf51',\n         '48e88aee 009a2a24 e795687e c28e125a',\n         '3e6730a6 0d46367b aa7fe99d 152128dc',\n         '41321bc7 7817f059'],\n        ['5a4437f6 80c0d0db 9b061276 d5d0ffcc',\n         'e786ff33 b6a53d30 98746425 82e66f09',\n         '4433dae7 7244a6e2 6b11e905 7228f483',\n         '556c41a5 913f55fe']\n      ],\n      torsion: [\n        [],\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000']\n        ],\n        [\n          ['ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff ffffffff fffffffe ffffffff',\n           'ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff fffffffe'],\n          ['bec92fd0 6da2acf2 b4e261e8 7cef0d34',\n           '22e75c18 3c589857 b71924e5 73c2f9ce',\n           'e18da5f2 466e2f39 3c2eedf0 f105a60a',\n           'b40c717d 4f1e1fd7']\n        ],\n        [\n          ['ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff ffffffff fffffffe ffffffff',\n           'ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff fffffffe'],\n          ['4136d02f 925d530d 4b1d9e17 8310f2cb',\n           'dd18a3e7 c3a767a8 48e6db19 8c3d0631',\n           '1e725a0d b991d0c6 c3d1120f 0efa59f5',\n           '4bf38e82 b0e1e028']\n        ]\n      ]\n    });\n  }\n}\n\n/**\n * ED25519\n * https://tools.ietf.org/html/rfc8032#section-5.1\n */\n\nclass ED25519 extends EdwardsCurve {\n  constructor(pre) {\n    super({\n      id: 'ED25519',\n      ossl: 'ED25519',\n      type: 'edwards',\n      endian: 'le',\n      hash: 'SHA512',\n      prefix: 'SigEd25519 no Ed25519 collisions',\n      context: false,\n      prime: 'p25519',\n      // 2^255 - 19 (= 5 mod 8)\n      p: ['7fffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff ffffffed'],\n      a: '-1',\n      // -121665 / 121666 mod p\n      d: ['52036cee 2b6ffe73 8cc74079 7779e898',\n          '00700a4d 4141d8ab 75eb4dca 135978a3'],\n      n: ['10000000 00000000 00000000 00000000',\n          '14def9de a2f79cd6 5812631a 5cf5d3ed'],\n      h: '8',\n      // Elligator 2\n      z: '2',\n      g: [\n        ['216936d3 cd6e53fe c0a4e231 fdd6dc5c',\n         '692cc760 9525a7b2 c9562d60 8f25d51a'],\n        // 4/5\n        ['66666666 66666666 66666666 66666666',\n         '66666666 66666666 66666666 66666658'],\n        pre\n      ],\n      torsion: [\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000001']\n        ],\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000'],\n          ['7fffffff ffffffff ffffffff ffffffff',\n           'ffffffff ffffffff ffffffff ffffffec']\n        ],\n        [\n          ['2b832480 4fc1df0b 2b4d0099 3dfbd7a7',\n           '2f431806 ad2fe478 c4ee1b27 4a0ea0b0'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000']\n        ],\n        [\n          ['547cdb7f b03e20f4 d4b2ff66 c2042858',\n           'd0bce7f9 52d01b87 3b11e4d8 b5f15f3d'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000']\n        ],\n        [\n          ['1fd5b9a0 06394a28 e9339932 38de4abb',\n           '5c193c70 13e5e238 dea14646 c545d14a'],\n          ['05fc536d 880238b1 3933c6d3 05acdfd5',\n           'f098eff2 89f4c345 b027b2c2 8f95e826']\n        ],\n        [\n          ['602a465f f9c6b5d7 16cc66cd c721b544',\n           'a3e6c38f ec1a1dc7 215eb9b9 3aba2ea3'],\n          ['05fc536d 880238b1 3933c6d3 05acdfd5',\n           'f098eff2 89f4c345 b027b2c2 8f95e826']\n        ],\n        [\n          ['1fd5b9a0 06394a28 e9339932 38de4abb',\n           '5c193c70 13e5e238 dea14646 c545d14a'],\n          ['7a03ac92 77fdc74e c6cc392c fa53202a',\n           '0f67100d 760b3cba 4fd84d3d 706a17c7']\n        ],\n        [\n          ['602a465f f9c6b5d7 16cc66cd c721b544',\n           'a3e6c38f ec1a1dc7 215eb9b9 3aba2ea3'],\n          ['7a03ac92 77fdc74e c6cc392c fa53202a',\n           '0f67100d 760b3cba 4fd84d3d 706a17c7']\n        ]\n      ]\n    });\n  }\n}\n\n/**\n * ISO448\n * https://tools.ietf.org/html/rfc7748#section-4.2\n * https://git.zx2c4.com/goldilocks/tree/_aux/ristretto/ristretto.sage#n658\n */\n\nclass ISO448 extends EdwardsCurve {\n  constructor(pre) {\n    super({\n      id: 'ISO448',\n      ossl: null,\n      type: 'edwards',\n      endian: 'le',\n      hash: 'SHAKE256',\n      prefix: 'SigEd448',\n      context: true,\n      prime: 'p448',\n      // 2^448 - 2^224 - 1 (= 3 mod 4)\n      p: ['ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff fffffffe ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff'],\n      a: '1',\n      // 39082 / 39081 mod p\n      d: ['d78b4bdc 7f0daf19 f24f38c2 9373a2cc',\n          'ad461572 42a50f37 809b1da3 412a12e7',\n          '9ccc9c81 264cfe9a d0809970 58fb61c4',\n          '243cc32d baa156b9'],\n      n: ['3fffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff 7cca23e9',\n          'c44edb49 aed63690 216cc272 8dc58f55',\n          '2378c292 ab5844f3'],\n      h: '4',\n      // Elligator 2\n      z: '-1',\n      g: [\n        ['79a70b2b 70400553 ae7c9df4 16c792c6',\n         '1128751a c9296924 0c25a07d 728bdc93',\n         'e21f7787 ed697224 9de732f3 8496cd11',\n         '69871309 3e9c04fc'],\n        // Note: the RFC has this wrong.\n        ['7fffffff ffffffff ffffffff ffffffff',\n         'ffffffff ffffffff ffffffff 80000000',\n         '00000000 00000000 00000000 00000000',\n         '00000000 00000001'],\n        pre\n      ],\n      torsion: [\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000001']\n        ],\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000'],\n          ['ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff ffffffff fffffffe ffffffff',\n           'ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff fffffffe']\n        ],\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000001'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000']\n        ],\n        [\n          ['ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff ffffffff fffffffe ffffffff',\n           'ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff fffffffe'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000']\n        ]\n      ]\n    });\n  }\n}\n\n/**\n * ED448\n * https://tools.ietf.org/html/rfc8032#section-5.2\n */\n\nclass ED448 extends EdwardsCurve {\n  constructor(pre) {\n    super({\n      id: 'ED448',\n      ossl: 'ED448',\n      type: 'edwards',\n      endian: 'le',\n      hash: 'SHAKE256',\n      prefix: 'SigEd448',\n      context: true,\n      prime: 'p448',\n      // 2^448 - 2^224 - 1 (= 3 mod 4)\n      p: ['ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff fffffffe ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff'],\n      a: '1',\n      // -39081 mod p\n      d: ['ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff fffffffe ffffffff',\n          'ffffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffff6756'],\n      n: ['3fffffff ffffffff ffffffff ffffffff',\n          'ffffffff ffffffff ffffffff 7cca23e9',\n          'c44edb49 aed63690 216cc272 8dc58f55',\n          '2378c292 ab5844f3'],\n      h: '4',\n      // Elligator 2\n      z: '-1',\n      g: [\n        ['4f1970c6 6bed0ded 221d15a6 22bf36da',\n         '9e146570 470f1767 ea6de324 a3d3a464',\n         '12ae1af7 2ab66511 433b80e1 8b00938e',\n         '2626a82b c70cc05e'],\n        ['693f4671 6eb6bc24 88762037 56c9c762',\n         '4bea7373 6ca39840 87789c1e 05a0c2d7',\n         '3ad3ff1c e67c39c4 fdbd132c 4ed7c8ad',\n         '9808795b f230fa14'],\n        pre\n      ],\n      torsion: [\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000001']\n        ],\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000'],\n          ['ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff ffffffff fffffffe ffffffff',\n           'ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff fffffffe']\n        ],\n        [\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000001'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000']\n        ],\n        [\n          ['ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff ffffffff fffffffe ffffffff',\n           'ffffffff ffffffff ffffffff ffffffff',\n           'ffffffff fffffffe'],\n          ['00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000 00000000 00000000',\n           '00000000 00000000']\n        ]\n      ]\n    });\n  }\n}\n\n/*\n * Curve Registry\n */\n\nconst curves = {\n  __proto__: null,\n  P192,\n  P224,\n  P256,\n  P384,\n  P521,\n  SECP256K1,\n  BRAINPOOLP256,\n  BRAINPOOLP384,\n  BRAINPOOLP512,\n  X25519,\n  X448,\n  MONT448,\n  ED25519,\n  ISO448,\n  ED448\n};\n\nconst cache = {\n  __proto__: null,\n  P192: null,\n  P224: null,\n  P256: null,\n  P384: null,\n  P521: null,\n  SECP256K1: null,\n  BRAINPOOLP256: null,\n  BRAINPOOLP384: null,\n  BRAINPOOLP512: null,\n  X25519: null,\n  X448: null,\n  MONT448: null,\n  ED25519: null,\n  ISO448: null,\n  ED448: null\n};\n\nfunction curve(name, ...args) {\n  assert(typeof name === 'string');\n\n  const key = name.toUpperCase();\n\n  let curve = cache[key];\n\n  if (!curve) {\n    const Curve = curves[key];\n\n    if (!Curve)\n      throw new Error(`Curve not found: \"${name}\".`);\n\n    curve = new Curve(...args);\n    cache[key] = curve;\n  }\n\n  return curve;\n}\n\nfunction register(name, Curve) {\n  assert(typeof name === 'string');\n  assert(typeof Curve === 'function');\n\n  const key = name.toUpperCase();\n\n  if (curves[key])\n    throw new Error(`Curve already registered: \"${name}\".`);\n\n  curves[key] = Curve;\n  cache[key] = null;\n}\n\n/*\n * Scalar Recoding\n */\n\nfunction getNAF(k, width, max) {\n  // Computing the width-w NAF of a positive integer.\n  //\n  // [GECC] Algorithm 3.35, Page 100, Section 3.3.\n  //\n  // The above document describes a rather abstract\n  // method of recoding. The more optimal method\n  // below was ported from libsecp256k1.\n  assert(k instanceof BN);\n  assert(!k.red);\n  assert((width >>> 0) === width);\n  assert((max >>> 0) === max);\n\n  const naf = new Array(max);\n  const bits = k.bitLength() + 1;\n  const sign = k.sign() | 1;\n\n  assert(bits <= max);\n\n  for (let i = 0; i < max; i++)\n    naf[i] = 0;\n\n  let i = 0;\n  let carry = 0;\n  let word;\n\n  while (i < bits) {\n    if (k.bit(i) === carry) {\n      i += 1;\n      continue;\n    }\n\n    word = k.bits(i, width) + carry;\n    carry = (word >> (width - 1)) & 1;\n    word -= carry << width;\n\n    naf[i] = sign * word;\n\n    i += width;\n  }\n\n  assert(carry === 0);\n\n  return naf;\n}\n\nfunction getFixedNAF(k, width, max, step) {\n  assert((step >>> 0) === step);\n\n  // Recode to NAF.\n  const naf = getNAF(k, width, max);\n\n  // Translate into more windowed form.\n  const len = Math.ceil(naf.length / step);\n  const repr = new Array(len);\n\n  let i = 0;\n\n  for (let j = 0; j < naf.length; j += step) {\n    let nafW = 0;\n\n    for (let k = j + step - 1; k >= j; k--)\n      nafW = (nafW << 1) + naf[k];\n\n    repr[i++] = nafW;\n  }\n\n  assert(i === len);\n\n  return repr;\n}\n\nfunction getJSF(k1, k2, max) {\n  // Joint sparse form.\n  //\n  // [GECC] Algorithm 3.50, Page 111, Section 3.3.\n  assert(k1 instanceof BN);\n  assert(k2 instanceof BN);\n  assert(!k1.red);\n  assert(!k2.red);\n  assert((max >>> 0) === max);\n\n  const jsf = [new Array(max), new Array(max)];\n  const bits = Math.max(k1.bitLength(), k2.bitLength()) + 1;\n  const s1 = k1.sign() | 1;\n  const s2 = k2.sign() | 1;\n\n  assert(bits <= max);\n\n  let d1 = 0;\n  let d2 = 0;\n\n  for (let i = 0; i < bits; i++) {\n    const b1 = k1.bits(i, 3);\n    const b2 = k2.bits(i, 3);\n\n    // First phase.\n    let m14 = ((b1 & 3) + d1) & 3;\n    let m24 = ((b2 & 3) + d2) & 3;\n    let u1 = 0;\n    let u2 = 0;\n\n    if (m14 === 3)\n      m14 = -1;\n\n    if (m24 === 3)\n      m24 = -1;\n\n    if (m14 & 1) {\n      const m8 = ((b1 & 7) + d1) & 7;\n\n      if ((m8 === 3 || m8 === 5) && m24 === 2)\n        u1 = -m14;\n      else\n        u1 = m14;\n    }\n\n    if (m24 & 1) {\n      const m8 = ((b2 & 7) + d2) & 7;\n\n      if ((m8 === 3 || m8 === 5) && m14 === 2)\n        u2 = -m24;\n      else\n        u2 = m24;\n    }\n\n    jsf[0][i] = u1 * s1;\n    jsf[1][i] = u2 * s2;\n\n    // Second phase.\n    if (2 * d1 === 1 + u1)\n      d1 = 1 - d1;\n\n    if (2 * d2 === 1 + u2)\n      d2 = 1 - d2;\n  }\n\n  for (let i = bits; i < max; i++) {\n    jsf[0][i] = 0;\n    jsf[1][i] = 0;\n  }\n\n  return jsf;\n}\n\nfunction getJNAF(c1, c2, max) {\n  const jsf = getJSF(c1, c2, max);\n  const naf = new Array(max);\n\n  // JSF -> NAF conversion.\n  for (let i = 0; i < max; i++) {\n    const ja = jsf[0][i];\n    const jb = jsf[1][i];\n\n    naf[i] = jsfIndex[(ja + 1) * 3 + (jb + 1)];\n  }\n\n  return naf;\n}\n\n/*\n * Helpers\n */\n\nfunction assert(val, msg) {\n  if (!val) {\n    const err = new Error(msg || 'Assertion failed');\n\n    if (Error.captureStackTrace)\n      Error.captureStackTrace(err, assert);\n\n    throw err;\n  }\n}\n\nfunction wrapErrors(fn) {\n  assert(typeof fn === 'function');\n\n  try {\n    return fn();\n  } catch (e) {\n    if (e.message === 'X is not a square mod P.'\n        || e.message === 'Not invertible.') {\n      throw new Error('Invalid point.');\n    }\n    throw e;\n  }\n}\n\nfunction mod(x, y) {\n  // Euclidean modulo.\n  let r = x % y;\n\n  if (r < 0) {\n    if (y < 0)\n      r -= y;\n    else\n      r += y;\n  }\n\n  return r;\n}\n\nfunction cubeRoot(x) {\n  assert(x instanceof BN);\n  assert(x.red);\n\n  const p = x.red.m;\n\n  if (p.cmpn(3) <= 0)\n    return x.clone();\n\n  // p = 2 mod 3\n  if (p.modrn(3) === 2) {\n    // e = (2 * p - 1) / 3\n    const e = p.ushln(1).isubn(1).idivn(3);\n    return x.redPow(e);\n  }\n\n  const mod9 = p.modrn(9);\n\n  // p = 4 mod 9\n  if (mod9 === 4) {\n    // e = (2 * p + 1) / 9\n    const e = p.ushln(1).iaddn(1).idivn(9);\n    const r = x.redPow(e);\n    const c = r.redSqr().redMul(r);\n\n    if (!c.eq(x))\n      throw new Error('X is not a cube mod P.');\n\n    return r;\n  }\n\n  // p = 7 mod 9\n  if (mod9 === 7) {\n    // e = (p + 2) / 9\n    const e = p.addn(2).idivn(9);\n    const r = x.redPow(e);\n    const c = r.redSqr().redMul(r);\n\n    if (!c.eq(x))\n      throw new Error('X is not a cube mod P.');\n\n    return r;\n  }\n\n  throw new Error('Not implemented.');\n}\n\nfunction cubeRoots(x) {\n  const r0 = cubeRoot(x);\n\n  // p = 1 mod 3\n  if (x.red.m.modrn(3) === 1) {\n    // Multiply by roots of unity to find other roots.\n    const two = new BN(2).toRed(x.red);\n    const three = new BN(3).toRed(x.red);\n    const i2 = two.redInvert();\n    const s1 = three.redNeg().redSqrt().redMul(i2);\n    const s2 = s1.redNeg();\n    const u1 = s1.redSub(i2);\n    const u2 = s2.redSub(i2);\n    const r1 = r0.redMul(u1);\n    const r2 = r0.redMul(u2);\n\n    return [r0, r1, r2];\n  }\n\n  // p = 2 mod 3 guarantees 1 cube root per element.\n  return [r0];\n}\n\nfunction uncube(x) {\n  // Find a cube root which is also a quadratic residue.\n  for (const root of cubeRoots(x)) {\n    if (root.redJacobi() >= 0)\n      return root;\n  }\n\n  throw new Error('X^(1/3) is not a square mod P.');\n}\n\nfunction randomInt(rng) {\n  return BN.randomBits(rng, 32).toNumber();\n}\n\nfunction memoize(method, self) {\n  const cache = new WeakMap();\n\n  return function memoized(curve, invert) {\n    const i = invert & 1;\n    const item = cache.get(curve);\n\n    if (item && item[i] !== null)\n      return item[i];\n\n    const result = method.call(self, curve, invert);\n\n    if (!cache.has(curve))\n      cache.set(curve, [null, null]);\n\n    cache.get(curve)[i] = result;\n\n    return result;\n  };\n}\n\nfunction toPretty(x, size) {\n  assert(x instanceof BN);\n  assert((size >>> 0) === size);\n\n  if (size & 7)\n    size += 8 - (size & 7);\n\n  const str = x.toString(16, size);\n  const chunks = [];\n  const out = [];\n\n  assert((str.length & 7) === 0);\n\n  for (let i = 0; i < str.length; i += 8)\n    chunks.push(str.slice(i, i + 8));\n\n  for (let i = 0; i < chunks.length; i += 4)\n    out.push(chunks.slice(i, i + 4).join(' '));\n\n  return out;\n}\n\n/*\n * Expose\n */\n\nexports.Curve = Curve;\nexports.Point = Point;\nexports.ShortCurve = ShortCurve;\nexports.ShortPoint = ShortPoint;\nexports.JPoint = JPoint;\nexports.MontCurve = MontCurve;\nexports.MontPoint = MontPoint;\nexports.XPoint = XPoint;\nexports.EdwardsCurve = EdwardsCurve;\nexports.EdwardsPoint = EdwardsPoint;\nexports.curves = curves;\nexports.curve = curve;\nexports.register = register;\n","/*!\n * random.js - random for bcrypto\n * Copyright (c) 2017-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n */\n\n'use strict';\n\nmodule.exports = require('./js/random');\n","/*!\n * random.js - random number generator for bcrypto\n * Copyright (c) 2014-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n *\n * Resources:\n *   https://wiki.openssl.org/index.php/Random_Numbers\n *   https://csrc.nist.gov/projects/random-bit-generation/\n *   http://www.pcg-random.org/posts/bounded-rands.html\n *   https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues\n */\n\n'use strict';\n\nconst assert = require('../internal/assert');\n\n/*\n * Constants\n */\n\nconst crypto = global.crypto || global.msCrypto;\nconst HAS_CRYPTO = crypto && typeof crypto.getRandomValues === 'function';\nconst randomValues = HAS_CRYPTO ? crypto.getRandomValues.bind(crypto) : null;\nconst pool = new Uint32Array(16);\nconst MAX_BYTES = 65536;\n\nlet poolPos = 0;\n\n/**\n * Generate pseudo-random bytes.\n * @param {Number} size\n * @returns {Buffer}\n */\n\nfunction randomBytes(size) {\n  assert((size >>> 0) === size);\n\n  const data = Buffer.alloc(size);\n\n  randomFillSync(data, 0, size);\n\n  return data;\n}\n\n/**\n * Generate pseudo-random bytes.\n * @param {Buffer} data\n * @param {Number} [off=0]\n * @param {Number} [size=data.length-off]\n * @returns {Buffer}\n */\n\nfunction randomFill(data, off, size) {\n  assert(Buffer.isBuffer(data));\n\n  if (off == null)\n    off = 0;\n\n  assert((off >>> 0) === off);\n\n  if (size == null)\n    size = data.length - off;\n\n  assert((size >>> 0) === size);\n  assert(off + size <= data.length);\n\n  randomFillSync(data, off, size);\n\n  return data;\n}\n\n/**\n * Generate a random uint32.\n * @returns {Number}\n */\n\nfunction randomInt() {\n  if ((poolPos & 15) === 0) {\n    getRandomValues(pool);\n    poolPos = 0;\n  }\n\n  return pool[poolPos++];\n}\n\n/**\n * Generate a random uint32 within a range.\n * @param {Number} min - Inclusive.\n * @param {Number} max - Exclusive.\n * @returns {Number}\n */\n\nfunction randomRange(min, max) {\n  assert((min >>> 0) === min);\n  assert((max >>> 0) === max);\n  assert(max >= min);\n\n  const space = max - min;\n\n  if (space === 0)\n    return min;\n\n  const top = -space >>> 0;\n\n  let x, r;\n\n  do {\n    x = randomInt();\n    r = x % space;\n  } while (x - r > top);\n\n  return r + min;\n}\n\n/*\n * Helpers\n */\n\nfunction getRandomValues(array) {\n  if (!HAS_CRYPTO)\n    throw new Error('Entropy source not available.');\n\n  return randomValues(array);\n}\n\nfunction randomFillSync(data, off, size) {\n  assert(Buffer.isBuffer(data));\n  assert(data.buffer instanceof ArrayBuffer);\n  assert((data.byteOffset >>> 0) === data.byteOffset);\n  assert((data.byteLength >>> 0) === data.byteLength);\n  assert((off >>> 0) === off);\n  assert((size >>> 0) === size);\n  assert(off + size <= data.byteLength);\n\n  if (size > 2 ** 31 - 1)\n    throw new RangeError('The value \"size\" is out of range.');\n\n  const offset = data.byteOffset + off;\n  const array = new Uint8Array(data.buffer, offset, size);\n\n  if (array.length > MAX_BYTES) {\n    for (let i = 0; i < array.length; i += MAX_BYTES) {\n      let j = i + MAX_BYTES;\n\n      if (j > array.length)\n        j = array.length;\n\n      getRandomValues(array.subarray(i, j));\n    }\n  } else {\n    if (array.length > 0)\n      getRandomValues(array);\n  }\n}\n\n/*\n * Expose\n */\n\nexports.native = 0;\nexports.randomBytes = randomBytes;\nexports.randomFill = randomFill;\nexports.randomInt = randomInt;\nexports.randomRange = randomRange;\n","'use strict'\n\nconst isBuffer = require('is-buffer')\nconst Shake = require('it-handshake')\nconst lp = require('it-length-prefixed')\n\nmodule.exports = (duplex, opts = {}) => {\n  const shake = Shake(duplex)\n  const lpReader = lp.decode.fromReader(\n      shake.reader,\n      opts\n  )\n\n  let isDone = false\n\n  const W = {\n    read: async (bytes) => {\n      // just read\n\n      const { value, done } = await shake.reader.next(bytes)\n\n      if (done && value.length < bytes) {\n        throw new Error('Couldn\\'t read enough bytes')\n      }\n\n      isDone = done\n\n      if (!value) { throw new Error('Value is null') }\n      return value\n    },\n    readLP: async () => {\n      // read, decode\n      const { value, done } = await lpReader.next()\n\n      isDone = done\n\n      if (!value) { throw new Error('Value is null') }\n      return value\n    },\n    readPB: async (proto) => {\n      // readLP, decode\n      const value = await W.readLP()\n\n      if (!value) { throw new Error('Value is null') }\n\n      // Is this a buffer?\n      const buf = isBuffer(value) ? value : value.slice()\n\n      return proto.decode(buf)\n    },\n    write: (data) => {\n      // just write\n      shake.writer.push(data)\n    },\n    writeLP: (data) => {\n      // encode, write\n      W.write(lp.encode.single(data, opts))\n    },\n    writePB: (data, proto) => {\n      // encode, writeLP\n      W.writeLP(proto.encode(data))\n    },\n\n    pb: (proto) => {\n      return {\n        read: () => W.readPB(proto),\n        write: (d) => W.writePB(d, proto)\n      }\n    },\n\n    unwrap: () => {\n      // returns vanilla duplex again, terminates all reads/writes from this object\n      shake.rest()\n      return shake.stream\n    }\n  }\n\n  return W\n}\n","/*!\n * Determine if an object is a Buffer\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n\nmodule.exports = function isBuffer (obj) {\n  return obj != null && obj.constructor != null &&\n    typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj)\n}\n","\nvar Pair = require('./')\nmodule.exports = function () {\n  var a = Pair()\n  var b = Pair()\n  return [\n    {\n      source: a.source,\n      sink: b.sink\n    },\n    {\n      source: b.source,\n      sink: a.sink\n    }\n  ]\n}\n","'use strict'\n\nconst getIterator = require('get-iterator')\n\n// a pair of streams where one drains from the other\nmodule.exports = function pair () {\n  let _source, onSource\n\n  const sink = async source => {\n    if (_source) throw new Error('already piped')\n    _source = getIterator(source)\n    if (onSource) onSource(_source)\n  }\n\n  const source = {\n    [Symbol.asyncIterator] () {\n      return this\n    },\n    next () {\n      if (_source) return _source.next()\n      return new Promise(resolve => {\n        onSource = source => {\n          onSource = null\n          resolve(source.next())\n        }\n      })\n    }\n  }\n\n  return { sink, source }\n}\n","import { Buffer } from 'buffer'\n\nimport { XX } from './handshakes/xx'\nimport { KeyPair } from './@types/libp2p'\nimport { bytes, bytes32 } from './@types/basic'\nimport { NoiseSession } from './@types/handshake'\nimport { IHandshake } from './@types/handshake-interface'\nimport {\n  decodePayload,\n  getPeerIdFromPayload,\n  verifySignedPayload\n} from './utils'\nimport {\n  logger,\n  logLocalStaticKeys,\n  logLocalEphemeralKeys,\n  logRemoteEphemeralKey,\n  logRemoteStaticKey,\n  logCipherState\n} from './logger'\nimport { decode0, decode1, decode2, encode0, encode1, encode2 } from './encoder'\nimport { WrappedConnection } from './noise'\nimport PeerId from 'peer-id'\n\nexport class XXHandshake implements IHandshake {\n  public isInitiator: boolean\n  public session: NoiseSession\n  public remotePeer!: PeerId\n  public remoteEarlyData: Buffer\n\n  protected payload: bytes\n  protected connection: WrappedConnection\n  protected xx: XX\n  protected staticKeypair: KeyPair\n\n  private readonly prologue: bytes32\n\n  constructor (\n    isInitiator: boolean,\n    payload: bytes,\n    prologue: bytes32,\n    staticKeypair: KeyPair,\n    connection: WrappedConnection,\n    remotePeer?: PeerId,\n    handshake?: XX\n  ) {\n    this.isInitiator = isInitiator\n    this.payload = payload\n    this.prologue = prologue\n    this.staticKeypair = staticKeypair\n    this.connection = connection\n    if (remotePeer) {\n      this.remotePeer = remotePeer\n    }\n    this.xx = handshake ?? new XX()\n    this.session = this.xx.initSession(this.isInitiator, this.prologue, this.staticKeypair)\n    this.remoteEarlyData = Buffer.alloc(0)\n  }\n\n  // stage 0\n  public async propose (): Promise<void> {\n    logLocalStaticKeys(this.session.hs.s)\n    if (this.isInitiator) {\n      logger('Stage 0 - Initiator starting to send first message.')\n      const messageBuffer = this.xx.sendMessage(this.session, Buffer.alloc(0))\n      this.connection.writeLP(encode0(messageBuffer))\n      logger('Stage 0 - Initiator finished sending first message.')\n      logLocalEphemeralKeys(this.session.hs.e)\n    } else {\n      logger('Stage 0 - Responder waiting to receive first message...')\n      const receivedMessageBuffer = decode0((await this.connection.readLP()).slice())\n      const { valid } = this.xx.recvMessage(this.session, receivedMessageBuffer)\n      if (!valid) {\n        throw new Error('xx handshake stage 0 validation fail')\n      }\n      logger('Stage 0 - Responder received first message.')\n      logRemoteEphemeralKey(this.session.hs.re)\n    }\n  }\n\n  // stage 1\n  public async exchange (): Promise<void> {\n    if (this.isInitiator) {\n      logger('Stage 1 - Initiator waiting to receive first message from responder...')\n      const receivedMessageBuffer = decode1((await this.connection.readLP()).slice())\n      const { plaintext, valid } = this.xx.recvMessage(this.session, receivedMessageBuffer)\n      if (!valid) {\n        throw new Error('xx handshake stage 1 validation fail')\n      }\n      logger('Stage 1 - Initiator received the message.')\n      logRemoteEphemeralKey(this.session.hs.re)\n      logRemoteStaticKey(this.session.hs.rs)\n\n      logger(\"Initiator going to check remote's signature...\")\n      try {\n        const decodedPayload = await decodePayload(plaintext)\n        this.remotePeer = this.remotePeer || await getPeerIdFromPayload(decodedPayload)\n        this.remotePeer = await verifySignedPayload(receivedMessageBuffer.ns, decodedPayload, this.remotePeer)\n        this.setRemoteEarlyData(decodedPayload.data)\n      } catch (e) {\n        const err = e as Error\n        throw new Error(`Error occurred while verifying signed payload: ${err.message}`)\n      }\n      logger('All good with the signature!')\n    } else {\n      logger('Stage 1 - Responder sending out first message with signed payload and static key.')\n      const messageBuffer = this.xx.sendMessage(this.session, this.payload)\n      this.connection.writeLP(encode1(messageBuffer))\n      logger('Stage 1 - Responder sent the second handshake message with signed payload.')\n      logLocalEphemeralKeys(this.session.hs.e)\n    }\n  }\n\n  // stage 2\n  public async finish (): Promise<void> {\n    if (this.isInitiator) {\n      logger('Stage 2 - Initiator sending third handshake message.')\n      const messageBuffer = this.xx.sendMessage(this.session, this.payload)\n      this.connection.writeLP(encode2(messageBuffer))\n      logger('Stage 2 - Initiator sent message with signed payload.')\n    } else {\n      logger('Stage 2 - Responder waiting for third handshake message...')\n      const receivedMessageBuffer = decode2((await this.connection.readLP()).slice())\n      const { plaintext, valid } = this.xx.recvMessage(this.session, receivedMessageBuffer)\n      if (!valid) {\n        throw new Error('xx handshake stage 2 validation fail')\n      }\n      logger('Stage 2 - Responder received the message, finished handshake.')\n\n      try {\n        const decodedPayload = await decodePayload(plaintext)\n        this.remotePeer = this.remotePeer || await getPeerIdFromPayload(decodedPayload)\n        await verifySignedPayload(this.session.hs.rs, decodedPayload, this.remotePeer)\n        this.setRemoteEarlyData(decodedPayload.data)\n      } catch (e) {\n        const err = e as Error\n        throw new Error(`Error occurred while verifying signed payload: ${err.message}`)\n      }\n    }\n    logCipherState(this.session)\n  }\n\n  public encrypt (plaintext: bytes, session: NoiseSession): bytes {\n    const cs = this.getCS(session)\n\n    return this.xx.encryptWithAd(cs, Buffer.alloc(0), plaintext)\n  }\n\n  public decrypt (ciphertext: bytes, session: NoiseSession): {plaintext: bytes, valid: boolean} {\n    const cs = this.getCS(session, false)\n    return this.xx.decryptWithAd(cs, Buffer.alloc(0), ciphertext)\n  }\n\n  public getRemoteStaticKey (): bytes {\n    return this.session.hs.rs\n  }\n\n  private getCS (session: NoiseSession, encryption = true) {\n    if (!session.cs1 || !session.cs2) {\n      throw new Error('Handshake not completed properly, cipher state does not exist.')\n    }\n\n    if (this.isInitiator) {\n      return encryption ? session.cs1 : session.cs2\n    } else {\n      return encryption ? session.cs2 : session.cs1\n    }\n  }\n\n  protected setRemoteEarlyData (data: Uint8Array|null|undefined): void {\n    if (data) {\n      this.remoteEarlyData = Buffer.from(data.buffer, data.byteOffset, data.length)\n    }\n  }\n}\n","import { Buffer } from 'buffer'\nimport { bytes32, bytes } from '../@types/basic'\nimport { KeyPair } from '../@types/libp2p'\nimport { generateKeypair, isValidPublicKey } from '../utils'\nimport { CipherState, HandshakeState, MessageBuffer, NoiseSession } from '../@types/handshake'\nimport { AbstractHandshake } from './abstract-handshake'\n\nexport class XX extends AbstractHandshake {\n  private initializeInitiator (prologue: bytes32, s: KeyPair, rs: bytes32, psk: bytes32): HandshakeState {\n    const name = 'Noise_XX_25519_ChaChaPoly_SHA256'\n    const ss = this.initializeSymmetric(name)\n    this.mixHash(ss, prologue)\n    const re = Buffer.alloc(32)\n\n    return { ss, s, rs, psk, re }\n  }\n\n  private initializeResponder (prologue: bytes32, s: KeyPair, rs: bytes32, psk: bytes32): HandshakeState {\n    const name = 'Noise_XX_25519_ChaChaPoly_SHA256'\n    const ss = this.initializeSymmetric(name)\n    this.mixHash(ss, prologue)\n    const re = Buffer.alloc(32)\n\n    return { ss, s, rs, psk, re }\n  }\n\n  private writeMessageA (hs: HandshakeState, payload: bytes, e?: KeyPair): MessageBuffer {\n    const ns = Buffer.alloc(0)\n\n    if (e !== undefined) {\n      hs.e = e\n    } else {\n      hs.e = generateKeypair()\n    }\n\n    const ne = hs.e.publicKey\n\n    this.mixHash(hs.ss, ne)\n    const ciphertext = this.encryptAndHash(hs.ss, payload)\n\n    return { ne, ns, ciphertext }\n  }\n\n  private writeMessageB (hs: HandshakeState, payload: bytes): MessageBuffer {\n    hs.e = generateKeypair()\n    const ne = hs.e.publicKey\n    this.mixHash(hs.ss, ne)\n\n    this.mixKey(hs.ss, this.dh(hs.e.privateKey, hs.re))\n    const spk = Buffer.from(hs.s.publicKey)\n    const ns = this.encryptAndHash(hs.ss, spk)\n\n    this.mixKey(hs.ss, this.dh(hs.s.privateKey, hs.re))\n    const ciphertext = this.encryptAndHash(hs.ss, payload)\n\n    return { ne, ns, ciphertext }\n  }\n\n  private writeMessageC (hs: HandshakeState, payload: bytes) {\n    const spk = Buffer.from(hs.s.publicKey)\n    const ns = this.encryptAndHash(hs.ss, spk)\n    this.mixKey(hs.ss, this.dh(hs.s.privateKey, hs.re))\n    const ciphertext = this.encryptAndHash(hs.ss, payload)\n    const ne = this.createEmptyKey()\n    const messageBuffer: MessageBuffer = { ne, ns, ciphertext }\n    const { cs1, cs2 } = this.split(hs.ss)\n\n    return { h: hs.ss.h, messageBuffer, cs1, cs2 }\n  }\n\n  private readMessageA (hs: HandshakeState, message: MessageBuffer): {plaintext: bytes, valid: boolean} {\n    if (isValidPublicKey(message.ne)) {\n      hs.re = message.ne\n    }\n\n    this.mixHash(hs.ss, hs.re)\n    return this.decryptAndHash(hs.ss, message.ciphertext)\n  }\n\n  private readMessageB (hs: HandshakeState, message: MessageBuffer): {plaintext: bytes, valid: boolean} {\n    if (isValidPublicKey(message.ne)) {\n      hs.re = message.ne\n    }\n\n    this.mixHash(hs.ss, hs.re)\n    if (!hs.e) {\n      throw new Error('Handshake state `e` param is missing.')\n    }\n    this.mixKey(hs.ss, this.dh(hs.e.privateKey, hs.re))\n    const { plaintext: ns, valid: valid1 } = this.decryptAndHash(hs.ss, message.ns)\n    if (valid1 && ns.length === 32 && isValidPublicKey(ns)) {\n      hs.rs = ns\n    }\n    this.mixKey(hs.ss, this.dh(hs.e.privateKey, hs.rs))\n    const { plaintext, valid: valid2 } = this.decryptAndHash(hs.ss, message.ciphertext)\n    return { plaintext, valid: (valid1 && valid2) }\n  }\n\n  private readMessageC (hs: HandshakeState, message: MessageBuffer): {h: bytes, plaintext: bytes, valid: boolean, cs1: CipherState, cs2: CipherState} {\n    const { plaintext: ns, valid: valid1 } = this.decryptAndHash(hs.ss, message.ns)\n    if (valid1 && ns.length === 32 && isValidPublicKey(ns)) {\n      hs.rs = ns\n    }\n    if (!hs.e) {\n      throw new Error('Handshake state `e` param is missing.')\n    }\n    this.mixKey(hs.ss, this.dh(hs.e.privateKey, hs.rs))\n\n    const { plaintext, valid: valid2 } = this.decryptAndHash(hs.ss, message.ciphertext)\n    const { cs1, cs2 } = this.split(hs.ss)\n\n    return { h: hs.ss.h, plaintext, valid: (valid1 && valid2), cs1, cs2 }\n  }\n\n  public initSession (initiator: boolean, prologue: bytes32, s: KeyPair): NoiseSession {\n    const psk = this.createEmptyKey()\n    const rs = Buffer.alloc(32) // no static key yet\n    let hs\n\n    if (initiator) {\n      hs = this.initializeInitiator(prologue, s, rs, psk)\n    } else {\n      hs = this.initializeResponder(prologue, s, rs, psk)\n    }\n\n    return {\n      hs,\n      i: initiator,\n      mc: 0\n    }\n  }\n\n  public sendMessage (session: NoiseSession, message: bytes, ephemeral?: KeyPair): MessageBuffer {\n    let messageBuffer: MessageBuffer\n    if (session.mc === 0) {\n      messageBuffer = this.writeMessageA(session.hs, message, ephemeral)\n    } else if (session.mc === 1) {\n      messageBuffer = this.writeMessageB(session.hs, message)\n    } else if (session.mc === 2) {\n      const { h, messageBuffer: resultingBuffer, cs1, cs2 } = this.writeMessageC(session.hs, message)\n      messageBuffer = resultingBuffer\n      session.h = h\n      session.cs1 = cs1\n      session.cs2 = cs2\n    } else if (session.mc > 2) {\n      if (session.i) {\n        if (!session.cs1) {\n          throw new Error('CS1 (cipher state) is not defined')\n        }\n\n        messageBuffer = this.writeMessageRegular(session.cs1, message)\n      } else {\n        if (!session.cs2) {\n          throw new Error('CS2 (cipher state) is not defined')\n        }\n\n        messageBuffer = this.writeMessageRegular(session.cs2, message)\n      }\n    } else {\n      throw new Error('Session invalid.')\n    }\n\n    session.mc++\n    return messageBuffer\n  }\n\n  public recvMessage (session: NoiseSession, message: MessageBuffer): {plaintext: bytes, valid: boolean} {\n    let plaintext: bytes = Buffer.alloc(0)\n    let valid = false\n    if (session.mc === 0) {\n      ({ plaintext, valid } = this.readMessageA(session.hs, message))\n    } else if (session.mc === 1) {\n      ({ plaintext, valid } = this.readMessageB(session.hs, message))\n    } else if (session.mc === 2) {\n      const { h, plaintext: resultingPlaintext, valid: resultingValid, cs1, cs2 } = this.readMessageC(session.hs, message)\n      plaintext = resultingPlaintext\n      valid = resultingValid\n      session.h = h\n      session.cs1 = cs1\n      session.cs2 = cs2\n    }\n    session.mc++\n    return { plaintext, valid }\n  }\n}\n","import HKDF from 'bcrypto/lib/hkdf'\nimport x25519 from 'bcrypto/lib/js/x25519'\nimport SHA256 from 'bcrypto/lib/js/sha256'\nimport { Buffer } from 'buffer'\nimport PeerId from 'peer-id'\nimport { keys } from 'libp2p-crypto'\nimport { KeyPair } from './@types/libp2p'\nimport { bytes, bytes32 } from './@types/basic'\nimport { Hkdf, INoisePayload } from './@types/handshake'\nimport { pb } from './proto/payload'\nimport uint8ArrayEquals from 'uint8arrays/equals'\n\nconst NoiseHandshakePayloadProto = pb.NoiseHandshakePayload\n\nexport function generateKeypair (): KeyPair {\n  const privateKey = x25519.privateKeyGenerate()\n  const publicKey = x25519.publicKeyCreate(privateKey)\n\n  return {\n    publicKey,\n    privateKey\n  }\n}\n\nexport async function getPayload (\n  localPeer: PeerId,\n  staticPublicKey: bytes,\n  earlyData?: bytes\n): Promise<bytes> {\n  const signedPayload = await signPayload(localPeer, getHandshakePayload(staticPublicKey))\n  const earlyDataPayload = earlyData ?? Buffer.alloc(0)\n\n  return createHandshakePayload(\n    localPeer.marshalPubKey(),\n    signedPayload,\n    earlyDataPayload\n  )\n}\n\nexport function createHandshakePayload (\n  libp2pPublicKey: Uint8Array,\n  signedPayload: Uint8Array,\n  earlyData?: Uint8Array\n): bytes {\n  const payloadInit = NoiseHandshakePayloadProto.create({\n    identityKey: Buffer.from(libp2pPublicKey),\n    identitySig: signedPayload,\n    data: earlyData ?? null\n  })\n\n  return Buffer.from(NoiseHandshakePayloadProto.encode(payloadInit).finish())\n}\n\nexport async function signPayload (peerId: PeerId, payload: bytes): Promise<bytes> {\n  return Buffer.from(await peerId.privKey.sign(payload))\n}\n\nexport async function getPeerIdFromPayload (payload: pb.INoiseHandshakePayload): Promise<PeerId> {\n  return await PeerId.createFromPubKey(Buffer.from(payload.identityKey as Uint8Array))\n}\n\nexport function decodePayload (payload: bytes|Uint8Array): pb.INoiseHandshakePayload {\n  return NoiseHandshakePayloadProto.toObject(\n    NoiseHandshakePayloadProto.decode(Buffer.from(payload))\n  ) as INoisePayload\n}\n\nexport function getHandshakePayload (publicKey: bytes): bytes {\n  return Buffer.concat([Buffer.from('noise-libp2p-static-key:'), publicKey])\n}\n\nasync function isValidPeerId (peerId: Uint8Array, publicKeyProtobuf: bytes) {\n  const generatedPeerId = await PeerId.createFromPubKey(publicKeyProtobuf)\n  return uint8ArrayEquals(generatedPeerId.id, peerId)\n}\n\n/**\n * Verifies signed payload, throws on any irregularities.\n *\n * @param {bytes} noiseStaticKey - owner's noise static key\n * @param {bytes} payload - decoded payload\n * @param {PeerId} remotePeer - owner's libp2p peer ID\n * @returns {Promise<PeerId>} - peer ID of payload owner\n */\nexport async function verifySignedPayload (\n  noiseStaticKey: bytes,\n  payload: pb.INoiseHandshakePayload,\n  remotePeer: PeerId\n): Promise<PeerId> {\n  const identityKey = Buffer.from(payload.identityKey as Uint8Array)\n  if (!(await isValidPeerId(remotePeer.id, identityKey))) {\n    throw new Error(\"Peer ID doesn't match libp2p public key.\")\n  }\n  const generatedPayload = getHandshakePayload(noiseStaticKey)\n  // Unmarshaling from PublicKey protobuf\n  const publicKey = keys.unmarshalPublicKey(identityKey)\n  // TODO remove this after libp2p-crypto ships proper types\n  // eslint-disable-next-line @typescript-eslint/no-misused-promises\n  if (!payload.identitySig || !publicKey.verify(generatedPayload, Buffer.from(payload.identitySig))) {\n    throw new Error(\"Static key doesn't match to peer that signed payload!\")\n  }\n  return await PeerId.createFromPubKey(identityKey)\n}\n\nexport function getHkdf (ck: bytes32, ikm: bytes): Hkdf {\n  const info = Buffer.alloc(0)\n  const prk = HKDF.extract(SHA256, ikm, ck)\n  const okm = HKDF.expand(SHA256, prk, info, 96)\n\n  const k1 = okm.slice(0, 32)\n  const k2 = okm.slice(32, 64)\n  const k3 = okm.slice(64, 96)\n\n  return [k1, k2, k3]\n}\n\nexport function isValidPublicKey (pk: bytes): boolean {\n  return x25519.publicKeyVerify(pk.slice(0, 32))\n}\n","/*!\n * hkdf.js - hkdf for bcrypto\n * Copyright (c) 2017-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n */\n\n'use strict';\n\nmodule.exports = require('./js/hkdf');\n","/*!\n * hkdf.js - hkdf for bcrypto\n * Copyright (c) 2014-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n *\n * Resources:\n *   https://en.wikipedia.org/wiki/HKDF\n *   https://tools.ietf.org/html/rfc5869\n */\n\n'use strict';\n\nconst assert = require('../internal/assert');\n\n/**\n * HKDF\n */\n\nfunction extract(hash, ikm, salt) {\n  assert(hash && typeof hash.id === 'string');\n\n  if (ikm == null)\n    ikm = Buffer.alloc(0);\n\n  if (salt == null)\n    salt = Buffer.alloc(hash.size, 0x00);\n\n  return hash.mac(ikm, salt);\n}\n\nfunction expand(hash, prk, info, len) {\n  if (info == null)\n    info = Buffer.alloc(0);\n\n  assert(hash && typeof hash.id === 'string');\n  assert(Buffer.isBuffer(prk));\n  assert(Buffer.isBuffer(info));\n  assert((len >>> 0) === len);\n\n  if (prk.length !== hash.size)\n    throw new RangeError('Invalid PRK length.');\n\n  const blocks = Math.ceil(len / hash.size);\n\n  if (blocks > 255)\n    throw new RangeError('Invalid output length.');\n\n  const out = Buffer.alloc(blocks * hash.size);\n  const ctr = Buffer.from([0]);\n  const mac = hash.hmac();\n\n  let prev = Buffer.alloc(0);\n  let pos = 0;\n\n  for (let i = 0; i < blocks; i++) {\n    ctr[0] += 1;\n\n    mac.init(prk);\n    mac.update(prev);\n    mac.update(info);\n    mac.update(ctr);\n\n    prev = mac.final();\n    pos += prev.copy(out, pos);\n  }\n\n  return out.slice(0, len);\n}\n\nfunction derive(hash, ikm, salt, info, len) {\n  const prk = extract(hash, ikm, salt);\n  return expand(hash, prk, info, len);\n}\n\n/*\n * Expose\n */\n\nexports.native = 0;\nexports.extract = extract;\nexports.expand = expand;\nexports.derive = derive;\n","/*!\n * sha256.js - SHA256 implementation for bcrypto\n * Copyright (c) 2016-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n *\n * Parts of this software are based on indutny/hash.js:\n *   Copyright (c) 2014, Fedor Indutny (MIT License).\n *   https://github.com/indutny/hash.js\n *\n * Resources:\n *   https://en.wikipedia.org/wiki/SHA-2\n *   https://tools.ietf.org/html/rfc4634\n *   https://github.com/indutny/hash.js/blob/master/lib/hash/sha/256.js\n */\n\n'use strict';\n\nconst assert = require('../internal/assert');\nconst HMAC = require('../internal/hmac');\n\n/*\n * Constants\n */\n\nconst FINALIZED = -1;\nconst DESC = Buffer.alloc(8, 0x00);\nconst PADDING = Buffer.alloc(64, 0x00);\n\nPADDING[0] = 0x80;\n\nconst K = new Uint32Array([\n  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,\n  0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n  0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,\n  0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,\n  0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n  0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,\n  0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,\n  0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n  0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n]);\n\n/**\n * SHA256\n */\n\nclass SHA256 {\n  constructor() {\n    this.state = new Uint32Array(8);\n    this.msg = new Uint32Array(64);\n    this.block = Buffer.alloc(64);\n    this.size = FINALIZED;\n  }\n\n  init() {\n    this.state[0] = 0x6a09e667;\n    this.state[1] = 0xbb67ae85;\n    this.state[2] = 0x3c6ef372;\n    this.state[3] = 0xa54ff53a;\n    this.state[4] = 0x510e527f;\n    this.state[5] = 0x9b05688c;\n    this.state[6] = 0x1f83d9ab;\n    this.state[7] = 0x5be0cd19;\n    this.size = 0;\n    return this;\n  }\n\n  update(data) {\n    assert(Buffer.isBuffer(data));\n    this._update(data, data.length);\n    return this;\n  }\n\n  final() {\n    return this._final(Buffer.alloc(32));\n  }\n\n  _update(data, len) {\n    assert(this.size !== FINALIZED, 'Context is not initialized.');\n\n    let pos = this.size & 63;\n    let off = 0;\n\n    this.size += len;\n\n    if (pos > 0) {\n      let want = 64 - pos;\n\n      if (want > len)\n        want = len;\n\n      data.copy(this.block, pos, off, off + want);\n\n      pos += want;\n      len -= want;\n      off += want;\n\n      if (pos < 64)\n        return;\n\n      this._transform(this.block, 0);\n    }\n\n    while (len >= 64) {\n      this._transform(data, off);\n      off += 64;\n      len -= 64;\n    }\n\n    if (len > 0)\n      data.copy(this.block, 0, off, off + len);\n  }\n\n  _final(out) {\n    assert(this.size !== FINALIZED, 'Context is not initialized.');\n\n    const pos = this.size & 63;\n    const len = this.size * 8;\n\n    writeU32(DESC, (len * (1 / 0x100000000)) >>> 0, 0);\n    writeU32(DESC, len >>> 0, 4);\n\n    this._update(PADDING, 1 + ((119 - pos) & 63));\n    this._update(DESC, 8);\n\n    for (let i = 0; i < 8; i++) {\n      writeU32(out, this.state[i], i * 4);\n      this.state[i] = 0;\n    }\n\n    for (let i = 0; i < 64; i++)\n      this.msg[i] = 0;\n\n    for (let i = 0; i < 64; i++)\n      this.block[i] = 0;\n\n    this.size = FINALIZED;\n\n    return out;\n  }\n\n  _transform(chunk, pos) {\n    const W = this.msg;\n\n    let a = this.state[0];\n    let b = this.state[1];\n    let c = this.state[2];\n    let d = this.state[3];\n    let e = this.state[4];\n    let f = this.state[5];\n    let g = this.state[6];\n    let h = this.state[7];\n    let i = 0;\n\n    for (; i < 16; i++)\n      W[i] = readU32(chunk, pos + i * 4);\n\n    for (; i < 64; i++)\n      W[i] = sigma1(W[i - 2]) + W[i - 7] + sigma0(W[i - 15]) + W[i - 16];\n\n    for (i = 0; i < 64; i++) {\n      const t1 = h + Sigma1(e) + Ch(e, f, g) + K[i] + W[i];\n      const t2 = Sigma0(a) + Maj(a, b, c);\n\n      h = g;\n      g = f;\n      f = e;\n\n      e = (d + t1) >>> 0;\n\n      d = c;\n      c = b;\n      b = a;\n\n      a = (t1 + t2) >>> 0;\n    }\n\n    this.state[0] += a;\n    this.state[1] += b;\n    this.state[2] += c;\n    this.state[3] += d;\n    this.state[4] += e;\n    this.state[5] += f;\n    this.state[6] += g;\n    this.state[7] += h;\n  }\n\n  static hash() {\n    return new SHA256();\n  }\n\n  static hmac() {\n    return new HMAC(SHA256, 64);\n  }\n\n  static digest(data) {\n    return SHA256.ctx.init().update(data).final();\n  }\n\n  static root(left, right) {\n    assert(Buffer.isBuffer(left) && left.length === 32);\n    assert(Buffer.isBuffer(right) && right.length === 32);\n    return SHA256.ctx.init().update(left).update(right).final();\n  }\n\n  static multi(x, y, z) {\n    const {ctx} = SHA256;\n\n    ctx.init();\n    ctx.update(x);\n    ctx.update(y);\n\n    if (z)\n      ctx.update(z);\n\n    return ctx.final();\n  }\n\n  static mac(data, key) {\n    return SHA256.hmac().init(key).update(data).final();\n  }\n}\n\n/*\n * Static\n */\n\nSHA256.native = 0;\nSHA256.id = 'SHA256';\nSHA256.size = 32;\nSHA256.bits = 256;\nSHA256.blockSize = 64;\nSHA256.zero = Buffer.alloc(32, 0x00);\nSHA256.ctx = new SHA256();\n\n/*\n * Helpers\n */\n\nfunction Sigma0(x) {\n  return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10);\n}\n\nfunction Sigma1(x) {\n  return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7);\n}\n\nfunction sigma0(x) {\n  return (x >>> 7 | x << 25) ^ (x >>> 18 | x << 14) ^ (x >>> 3);\n}\n\nfunction sigma1(x) {\n  return (x >>> 17 | x << 15) ^ (x >>> 19 | x << 13) ^ (x >>> 10);\n}\n\nfunction Ch(x, y, z) {\n  return z ^ (x & (y ^ z));\n}\n\nfunction Maj(x, y, z) {\n  return (x & y) | (z & (x | y));\n}\n\nfunction readU32(data, off) {\n  return (data[off++] * 0x1000000\n        + data[off++] * 0x10000\n        + data[off++] * 0x100\n        + data[off]);\n}\n\nfunction writeU32(data, num, off) {\n  data[off++] = num >>> 24;\n  data[off++] = num >>> 16;\n  data[off++] = num >>> 8;\n  data[off++] = num;\n  return off;\n}\n\n/*\n * Expose\n */\n\nmodule.exports = SHA256;\n","/*!\n * hmac.js - hmac for bcrypto\n * Copyright (c) 2016-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n *\n * Parts of this software are based on indutny/hash.js:\n *   Copyright (c) 2014, Fedor Indutny (MIT License).\n *   https://github.com/indutny/hash.js\n *\n * Resources:\n *   https://en.wikipedia.org/wiki/HMAC\n *   https://tools.ietf.org/html/rfc2104\n *   https://github.com/indutny/hash.js/blob/master/lib/hash/hmac.js\n */\n\n'use strict';\n\nconst assert = require('../internal/assert');\n\n/**\n * HMAC\n */\n\nclass HMAC {\n  /**\n   * Create an HMAC.\n   * @param {Function} Hash\n   * @param {Number} size\n   * @param {Array} [x=[]]\n   * @param {Array} [y=[]]\n   */\n\n  constructor(Hash, size, x = [], y = []) {\n    assert(typeof Hash === 'function');\n    assert((size >>> 0) === size);\n    assert(Array.isArray(x));\n    assert(Array.isArray(y));\n\n    this.hash = Hash;\n    this.size = size;\n    this.x = x;\n    this.y = y;\n\n    this.inner = new Hash();\n    this.outer = new Hash();\n  }\n\n  /**\n   * Initialize HMAC context.\n   * @param {Buffer} data\n   */\n\n  init(key) {\n    assert(Buffer.isBuffer(key));\n\n    // Shorten key\n    if (key.length > this.size) {\n      const Hash = this.hash;\n      const h = new Hash();\n\n      h.init(...this.x);\n      h.update(key);\n\n      key = h.final(...this.y);\n\n      assert(key.length <= this.size);\n    }\n\n    // Pad key\n    const pad = Buffer.alloc(this.size);\n\n    for (let i = 0; i < key.length; i++)\n      pad[i] = key[i] ^ 0x36;\n\n    for (let i = key.length; i < pad.length; i++)\n      pad[i] = 0x36;\n\n    this.inner.init(...this.x);\n    this.inner.update(pad);\n\n    for (let i = 0; i < key.length; i++)\n      pad[i] = key[i] ^ 0x5c;\n\n    for (let i = key.length; i < pad.length; i++)\n      pad[i] = 0x5c;\n\n    this.outer.init(...this.x);\n    this.outer.update(pad);\n\n    return this;\n  }\n\n  /**\n   * Update HMAC context.\n   * @param {Buffer} data\n   */\n\n  update(data) {\n    this.inner.update(data);\n    return this;\n  }\n\n  /**\n   * Finalize HMAC context.\n   * @returns {Buffer}\n   */\n\n  final() {\n    this.outer.update(this.inner.final(...this.y));\n    return this.outer.final(...this.y);\n  }\n}\n\n/*\n * Expose\n */\n\nmodule.exports = HMAC;\n","/*eslint-disable block-scoped-var, id-length, no-control-regex, no-magic-numbers, no-prototype-builtins, no-redeclare, no-shadow, no-var, sort-vars*/\n(function(global, factory) { /* global define, require, module */\n\n    /* AMD */ if (typeof define === 'function' && define.amd)\n        define([\"protobufjs/minimal\"], factory);\n\n    /* CommonJS */ else if (typeof require === 'function' && typeof module === 'object' && module && module.exports)\n        module.exports = factory(require(\"protobufjs/minimal\"));\n\n})(this, function($protobuf) {\n    \"use strict\";\n\n    // Common aliases\n    var $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n    \n    // Exported root namespace\n    var $root = $protobuf.roots[\"libp2p-noise\"] || ($protobuf.roots[\"libp2p-noise\"] = {});\n    \n    $root.pb = (function() {\n    \n        /**\n         * Namespace pb.\n         * @exports pb\n         * @namespace\n         */\n        var pb = {};\n    \n        pb.NoiseHandshakePayload = (function() {\n    \n            /**\n             * Properties of a NoiseHandshakePayload.\n             * @memberof pb\n             * @interface INoiseHandshakePayload\n             * @property {Uint8Array|null} [identityKey] NoiseHandshakePayload identityKey\n             * @property {Uint8Array|null} [identitySig] NoiseHandshakePayload identitySig\n             * @property {Uint8Array|null} [data] NoiseHandshakePayload data\n             */\n    \n            /**\n             * Constructs a new NoiseHandshakePayload.\n             * @memberof pb\n             * @classdesc Represents a NoiseHandshakePayload.\n             * @implements INoiseHandshakePayload\n             * @constructor\n             * @param {pb.INoiseHandshakePayload=} [properties] Properties to set\n             */\n            function NoiseHandshakePayload(properties) {\n                if (properties)\n                    for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n                        if (properties[keys[i]] != null)\n                            this[keys[i]] = properties[keys[i]];\n            }\n    \n            /**\n             * NoiseHandshakePayload identityKey.\n             * @member {Uint8Array} identityKey\n             * @memberof pb.NoiseHandshakePayload\n             * @instance\n             */\n            NoiseHandshakePayload.prototype.identityKey = $util.newBuffer([]);\n    \n            /**\n             * NoiseHandshakePayload identitySig.\n             * @member {Uint8Array} identitySig\n             * @memberof pb.NoiseHandshakePayload\n             * @instance\n             */\n            NoiseHandshakePayload.prototype.identitySig = $util.newBuffer([]);\n    \n            /**\n             * NoiseHandshakePayload data.\n             * @member {Uint8Array} data\n             * @memberof pb.NoiseHandshakePayload\n             * @instance\n             */\n            NoiseHandshakePayload.prototype.data = $util.newBuffer([]);\n    \n            /**\n             * Creates a new NoiseHandshakePayload instance using the specified properties.\n             * @function create\n             * @memberof pb.NoiseHandshakePayload\n             * @static\n             * @param {pb.INoiseHandshakePayload=} [properties] Properties to set\n             * @returns {pb.NoiseHandshakePayload} NoiseHandshakePayload instance\n             */\n            NoiseHandshakePayload.create = function create(properties) {\n                return new NoiseHandshakePayload(properties);\n            };\n    \n            /**\n             * Encodes the specified NoiseHandshakePayload message. Does not implicitly {@link pb.NoiseHandshakePayload.verify|verify} messages.\n             * @function encode\n             * @memberof pb.NoiseHandshakePayload\n             * @static\n             * @param {pb.INoiseHandshakePayload} message NoiseHandshakePayload message or plain object to encode\n             * @param {$protobuf.Writer} [writer] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            NoiseHandshakePayload.encode = function encode(message, writer) {\n                if (!writer)\n                    writer = $Writer.create();\n                if (message.identityKey != null && Object.hasOwnProperty.call(message, \"identityKey\"))\n                    writer.uint32(/* id 1, wireType 2 =*/10).bytes(message.identityKey);\n                if (message.identitySig != null && Object.hasOwnProperty.call(message, \"identitySig\"))\n                    writer.uint32(/* id 2, wireType 2 =*/18).bytes(message.identitySig);\n                if (message.data != null && Object.hasOwnProperty.call(message, \"data\"))\n                    writer.uint32(/* id 3, wireType 2 =*/26).bytes(message.data);\n                return writer;\n            };\n    \n            /**\n             * Encodes the specified NoiseHandshakePayload message, length delimited. Does not implicitly {@link pb.NoiseHandshakePayload.verify|verify} messages.\n             * @function encodeDelimited\n             * @memberof pb.NoiseHandshakePayload\n             * @static\n             * @param {pb.INoiseHandshakePayload} message NoiseHandshakePayload message or plain object to encode\n             * @param {$protobuf.Writer} [writer] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            NoiseHandshakePayload.encodeDelimited = function encodeDelimited(message, writer) {\n                return this.encode(message, writer).ldelim();\n            };\n    \n            /**\n             * Decodes a NoiseHandshakePayload message from the specified reader or buffer.\n             * @function decode\n             * @memberof pb.NoiseHandshakePayload\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n             * @param {number} [length] Message length if known beforehand\n             * @returns {pb.NoiseHandshakePayload} NoiseHandshakePayload\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            NoiseHandshakePayload.decode = function decode(reader, length) {\n                if (!(reader instanceof $Reader))\n                    reader = $Reader.create(reader);\n                var end = length === undefined ? reader.len : reader.pos + length, message = new $root.pb.NoiseHandshakePayload();\n                while (reader.pos < end) {\n                    var tag = reader.uint32();\n                    switch (tag >>> 3) {\n                    case 1:\n                        message.identityKey = reader.bytes();\n                        break;\n                    case 2:\n                        message.identitySig = reader.bytes();\n                        break;\n                    case 3:\n                        message.data = reader.bytes();\n                        break;\n                    default:\n                        reader.skipType(tag & 7);\n                        break;\n                    }\n                }\n                return message;\n            };\n    \n            /**\n             * Decodes a NoiseHandshakePayload message from the specified reader or buffer, length delimited.\n             * @function decodeDelimited\n             * @memberof pb.NoiseHandshakePayload\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} reader Reader or buffer to decode from\n             * @returns {pb.NoiseHandshakePayload} NoiseHandshakePayload\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            NoiseHandshakePayload.decodeDelimited = function decodeDelimited(reader) {\n                if (!(reader instanceof $Reader))\n                    reader = new $Reader(reader);\n                return this.decode(reader, reader.uint32());\n            };\n    \n            /**\n             * Verifies a NoiseHandshakePayload message.\n             * @function verify\n             * @memberof pb.NoiseHandshakePayload\n             * @static\n             * @param {Object.<string,*>} message Plain object to verify\n             * @returns {string|null} `null` if valid, otherwise the reason why it is not\n             */\n            NoiseHandshakePayload.verify = function verify(message) {\n                if (typeof message !== \"object\" || message === null)\n                    return \"object expected\";\n                if (message.identityKey != null && message.hasOwnProperty(\"identityKey\"))\n                    if (!(message.identityKey && typeof message.identityKey.length === \"number\" || $util.isString(message.identityKey)))\n                        return \"identityKey: buffer expected\";\n                if (message.identitySig != null && message.hasOwnProperty(\"identitySig\"))\n                    if (!(message.identitySig && typeof message.identitySig.length === \"number\" || $util.isString(message.identitySig)))\n                        return \"identitySig: buffer expected\";\n                if (message.data != null && message.hasOwnProperty(\"data\"))\n                    if (!(message.data && typeof message.data.length === \"number\" || $util.isString(message.data)))\n                        return \"data: buffer expected\";\n                return null;\n            };\n    \n            /**\n             * Creates a NoiseHandshakePayload message from a plain object. Also converts values to their respective internal types.\n             * @function fromObject\n             * @memberof pb.NoiseHandshakePayload\n             * @static\n             * @param {Object.<string,*>} object Plain object\n             * @returns {pb.NoiseHandshakePayload} NoiseHandshakePayload\n             */\n            NoiseHandshakePayload.fromObject = function fromObject(object) {\n                if (object instanceof $root.pb.NoiseHandshakePayload)\n                    return object;\n                var message = new $root.pb.NoiseHandshakePayload();\n                if (object.identityKey != null)\n                    if (typeof object.identityKey === \"string\")\n                        $util.base64.decode(object.identityKey, message.identityKey = $util.newBuffer($util.base64.length(object.identityKey)), 0);\n                    else if (object.identityKey.length)\n                        message.identityKey = object.identityKey;\n                if (object.identitySig != null)\n                    if (typeof object.identitySig === \"string\")\n                        $util.base64.decode(object.identitySig, message.identitySig = $util.newBuffer($util.base64.length(object.identitySig)), 0);\n                    else if (object.identitySig.length)\n                        message.identitySig = object.identitySig;\n                if (object.data != null)\n                    if (typeof object.data === \"string\")\n                        $util.base64.decode(object.data, message.data = $util.newBuffer($util.base64.length(object.data)), 0);\n                    else if (object.data.length)\n                        message.data = object.data;\n                return message;\n            };\n    \n            /**\n             * Creates a plain object from a NoiseHandshakePayload message. Also converts values to other types if specified.\n             * @function toObject\n             * @memberof pb.NoiseHandshakePayload\n             * @static\n             * @param {pb.NoiseHandshakePayload} message NoiseHandshakePayload\n             * @param {$protobuf.IConversionOptions} [options] Conversion options\n             * @returns {Object.<string,*>} Plain object\n             */\n            NoiseHandshakePayload.toObject = function toObject(message, options) {\n                if (!options)\n                    options = {};\n                var object = {};\n                if (options.defaults) {\n                    if (options.bytes === String)\n                        object.identityKey = \"\";\n                    else {\n                        object.identityKey = [];\n                        if (options.bytes !== Array)\n                            object.identityKey = $util.newBuffer(object.identityKey);\n                    }\n                    if (options.bytes === String)\n                        object.identitySig = \"\";\n                    else {\n                        object.identitySig = [];\n                        if (options.bytes !== Array)\n                            object.identitySig = $util.newBuffer(object.identitySig);\n                    }\n                    if (options.bytes === String)\n                        object.data = \"\";\n                    else {\n                        object.data = [];\n                        if (options.bytes !== Array)\n                            object.data = $util.newBuffer(object.data);\n                    }\n                }\n                if (message.identityKey != null && message.hasOwnProperty(\"identityKey\"))\n                    object.identityKey = options.bytes === String ? $util.base64.encode(message.identityKey, 0, message.identityKey.length) : options.bytes === Array ? Array.prototype.slice.call(message.identityKey) : message.identityKey;\n                if (message.identitySig != null && message.hasOwnProperty(\"identitySig\"))\n                    object.identitySig = options.bytes === String ? $util.base64.encode(message.identitySig, 0, message.identitySig.length) : options.bytes === Array ? Array.prototype.slice.call(message.identitySig) : message.identitySig;\n                if (message.data != null && message.hasOwnProperty(\"data\"))\n                    object.data = options.bytes === String ? $util.base64.encode(message.data, 0, message.data.length) : options.bytes === Array ? Array.prototype.slice.call(message.data) : message.data;\n                return object;\n            };\n    \n            /**\n             * Converts this NoiseHandshakePayload to JSON.\n             * @function toJSON\n             * @memberof pb.NoiseHandshakePayload\n             * @instance\n             * @returns {Object.<string,*>} JSON object\n             */\n            NoiseHandshakePayload.prototype.toJSON = function toJSON() {\n                return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n            };\n    \n            return NoiseHandshakePayload;\n        })();\n    \n        return pb;\n    })();\n\n    return $root;\n});\n","import { Buffer } from 'buffer'\nimport AEAD from 'bcrypto/lib/js/aead'\nimport x25519 from 'bcrypto/lib/js/x25519'\nimport SHA256 from 'bcrypto/lib/js/sha256'\n\nimport { bytes, bytes32, uint32 } from '../@types/basic'\nimport { CipherState, MessageBuffer, SymmetricState } from '../@types/handshake'\nimport { getHkdf } from '../utils'\nimport { logger } from '../logger'\n\nexport const MIN_NONCE = 0\n\nexport abstract class AbstractHandshake {\n  public encryptWithAd (cs: CipherState, ad: bytes, plaintext: bytes): bytes {\n    const e = this.encrypt(cs.k, cs.n, ad, plaintext)\n    this.setNonce(cs, this.incrementNonce(cs.n))\n\n    return e\n  }\n\n  public decryptWithAd (cs: CipherState, ad: bytes, ciphertext: bytes): {plaintext: bytes, valid: boolean} {\n    const { plaintext, valid } = this.decrypt(cs.k, cs.n, ad, ciphertext)\n    this.setNonce(cs, this.incrementNonce(cs.n))\n\n    return { plaintext, valid }\n  }\n\n  // Cipher state related\n  protected hasKey (cs: CipherState): boolean {\n    return !this.isEmptyKey(cs.k)\n  }\n\n  protected setNonce (cs: CipherState, nonce: uint32): void {\n    cs.n = nonce\n  }\n\n  protected createEmptyKey (): bytes32 {\n    return Buffer.alloc(32)\n  }\n\n  protected isEmptyKey (k: bytes32): boolean {\n    const emptyKey = this.createEmptyKey()\n    return emptyKey.equals(k)\n  }\n\n  protected incrementNonce (n: uint32): uint32 {\n    return n + 1\n  }\n\n  protected nonceToBytes (n: uint32): bytes {\n    const nonce = Buffer.alloc(12)\n    nonce.writeUInt32LE(n, 4)\n\n    return nonce\n  }\n\n  protected encrypt (k: bytes32, n: uint32, ad: bytes, plaintext: bytes): bytes {\n    const nonce = this.nonceToBytes(n)\n    const ctx = new AEAD()\n    plaintext = Buffer.from(plaintext)\n    ctx.init(k, nonce)\n    ctx.aad(ad)\n    ctx.encrypt(plaintext)\n\n    // Encryption is done on the sent reference\n    return Buffer.concat([plaintext, ctx.final()])\n  }\n\n  protected encryptAndHash (ss: SymmetricState, plaintext: bytes): bytes {\n    let ciphertext\n    if (this.hasKey(ss.cs)) {\n      ciphertext = this.encryptWithAd(ss.cs, ss.h, plaintext)\n    } else {\n      ciphertext = plaintext\n    }\n\n    this.mixHash(ss, ciphertext)\n    return ciphertext\n  }\n\n  protected decrypt (k: bytes32, n: uint32, ad: bytes, ciphertext: bytes): {plaintext: bytes, valid: boolean} {\n    const nonce = this.nonceToBytes(n)\n    const ctx = new AEAD()\n    ciphertext = Buffer.from(ciphertext)\n    const tag = ciphertext.slice(ciphertext.length - 16)\n    ciphertext = ciphertext.slice(0, ciphertext.length - 16)\n    ctx.init(k, nonce)\n    ctx.aad(ad)\n    ctx.decrypt(ciphertext)\n    // Decryption is done on the sent reference\n    return { plaintext: ciphertext, valid: ctx.verify(tag) }\n  }\n\n  protected decryptAndHash (ss: SymmetricState, ciphertext: bytes): {plaintext: bytes, valid: boolean} {\n    let plaintext: bytes; let valid = true\n    if (this.hasKey(ss.cs)) {\n      ({ plaintext, valid } = this.decryptWithAd(ss.cs, ss.h, ciphertext))\n    } else {\n      plaintext = ciphertext\n    }\n\n    this.mixHash(ss, ciphertext)\n    return { plaintext, valid }\n  }\n\n  protected dh (privateKey: bytes32, publicKey: bytes32): bytes32 {\n    try {\n      const derived = x25519.derive(publicKey, privateKey)\n      const result = Buffer.alloc(32)\n      derived.copy(result)\n      return result\n    } catch (e) {\n      logger(e.message)\n      return Buffer.alloc(32)\n    }\n  }\n\n  protected mixHash (ss: SymmetricState, data: bytes): void {\n    ss.h = this.getHash(ss.h, data)\n  }\n\n  protected getHash (a: bytes, b: bytes): bytes32 {\n    return SHA256.digest(Buffer.from([...a, ...b]))\n  }\n\n  protected mixKey (ss: SymmetricState, ikm: bytes32): void {\n    const [ck, tempK] = getHkdf(ss.ck, ikm)\n    ss.cs = this.initializeKey(tempK)\n    ss.ck = ck\n  }\n\n  protected initializeKey (k: bytes32): CipherState {\n    const n = MIN_NONCE\n    return { k, n }\n  }\n\n  // Symmetric state related\n\n  protected initializeSymmetric (protocolName: string): SymmetricState {\n    const protocolNameBytes: bytes = Buffer.from(protocolName, 'utf-8')\n    const h = this.hashProtocolName(protocolNameBytes)\n\n    const ck = h\n    const key = this.createEmptyKey()\n    const cs: CipherState = this.initializeKey(key)\n\n    return { cs, ck, h }\n  }\n\n  protected hashProtocolName (protocolName: bytes): bytes32 {\n    if (protocolName.length <= 32) {\n      const h = Buffer.alloc(32)\n      protocolName.copy(h)\n      return h\n    } else {\n      return this.getHash(protocolName, Buffer.alloc(0))\n    }\n  }\n\n  protected split (ss: SymmetricState): {cs1: CipherState, cs2: CipherState} {\n    const [tempk1, tempk2] = getHkdf(ss.ck, Buffer.alloc(0))\n    const cs1 = this.initializeKey(tempk1)\n    const cs2 = this.initializeKey(tempk2)\n\n    return { cs1, cs2 }\n  }\n\n  protected writeMessageRegular (cs: CipherState, payload: bytes): MessageBuffer {\n    const ciphertext = this.encryptWithAd(cs, Buffer.alloc(0), payload)\n    const ne = this.createEmptyKey()\n    const ns = Buffer.alloc(0)\n\n    return { ne, ns, ciphertext }\n  }\n\n  protected readMessageRegular (cs: CipherState, message: MessageBuffer): {plaintext: bytes, valid: boolean} {\n    return this.decryptWithAd(cs, Buffer.alloc(0), message.ciphertext)\n  }\n}\n","/*!\n * aead.js - aead for bcrypto\n * Copyright (c) 2016-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n *\n * Resources:\n *   https://tools.ietf.org/html/rfc7539#section-2.8\n *   https://github.com/openssh/openssh-portable\n */\n\n'use strict';\n\nconst assert = require('../internal/assert');\nconst ChaCha20 = require('./chacha20');\nconst Poly1305 = require('./poly1305');\n\n/*\n * Constants\n */\n\nconst zero16 = Buffer.alloc(16, 0x00);\n\n/**\n * AEAD\n */\n\nclass AEAD {\n  /**\n   * Create an AEAD context.\n   * @constructor\n   */\n\n  constructor() {\n    this.chacha = new ChaCha20();\n    this.poly = new Poly1305();\n    this.key = Buffer.alloc(64);\n    this.mode = -1;\n    this.aadLen = 0;\n    this.cipherLen = 0;\n  }\n\n  /**\n   * Initialize the AEAD with a key and iv.\n   * @param {Buffer} key\n   * @param {Buffer} iv - IV / packet sequence number.\n   */\n\n  init(key, iv) {\n    assert(Buffer.isBuffer(key));\n    assert(Buffer.isBuffer(iv));\n\n    this.key.fill(0);\n    this.chacha.init(key, iv, 0);\n    this.chacha.encrypt(this.key);\n    this.poly.init(this.key);\n\n    this.mode = 0;\n    this.aadLen = 0;\n    this.cipherLen = 0;\n\n    return this;\n  }\n\n  /**\n   * Update the aad (will be finalized\n   * on an encrypt/decrypt call).\n   * @param {Buffer} aad\n   */\n\n  aad(data) {\n    if (this.mode === -1)\n      throw new Error('Context is not initialized.');\n\n    if (this.mode !== 0)\n      throw new Error('Invalid state for aad.');\n\n    this.poly.update(data);\n    this.aadLen += data.length;\n\n    return this;\n  }\n\n  /**\n   * Encrypt a piece of data.\n   * @param {Buffer} data\n   */\n\n  encrypt(data) {\n    if (this.mode === -1)\n      throw new Error('Context is not initialized.');\n\n    if (this.mode !== 0 && this.mode !== 1)\n      throw new Error('Invalid state for encrypt.');\n\n    if (this.mode === 0) {\n      this._pad16(this.aadLen);\n      this.mode = 1;\n    }\n\n    this.chacha.encrypt(data);\n    this.poly.update(data);\n\n    this.cipherLen += data.length;\n\n    return data;\n  }\n\n  /**\n   * Decrypt a piece of data.\n   * @param {Buffer} data\n   */\n\n  decrypt(data) {\n    assert(Buffer.isBuffer(data));\n\n    if (this.mode === -1)\n      throw new Error('Context is not initialized.');\n\n    if (this.mode !== 0 && this.mode !== 2)\n      throw new Error('Invalid state for decrypt.');\n\n    if (this.mode === 0) {\n      this._pad16(this.aadLen);\n      this.mode = 2;\n    }\n\n    this.cipherLen += data.length;\n\n    this.poly.update(data);\n    this.chacha.encrypt(data);\n\n    return data;\n  }\n\n  /**\n   * Authenticate data without decrypting.\n   * @param {Buffer} data\n   */\n\n  auth(data) {\n    assert(Buffer.isBuffer(data));\n\n    if (this.mode === -1)\n      throw new Error('Context is not initialized.');\n\n    if (this.mode !== 0 && this.mode !== 3)\n      throw new Error('Invalid state for auth.');\n\n    if (this.mode === 0) {\n      this._pad16(this.aadLen);\n      this.mode = 3;\n    }\n\n    this.cipherLen += data.length;\n\n    this.poly.update(data);\n\n    return data;\n  }\n\n  /**\n   * Finalize the aead and generate a MAC.\n   * @returns {Buffer} MAC\n   */\n\n  final() {\n    if (this.mode === -1)\n      throw new Error('Context is not initialized.');\n\n    const len = Buffer.alloc(16);\n\n    writeU64(len, this.aadLen, 0);\n    writeU64(len, this.cipherLen, 8);\n\n    if (this.mode === 0)\n      this._pad16(this.aadLen);\n\n    this._pad16(this.cipherLen);\n    this.poly.update(len);\n\n    const mac = this.poly.final();\n\n    this.destroy();\n\n    return mac;\n  }\n\n  /**\n   * Destroy the context.\n   */\n\n  destroy() {\n    this.chacha.destroy();\n    this.poly.destroy();\n\n    for (let i = 0; i < 64; i++)\n      this.key[i] = 0;\n\n    this.mode = -1;\n    this.aadLen = 0;\n    this.cipherLen = 0;\n\n    return this;\n  }\n\n  /**\n   * Finalize and verify MAC against tag.\n   * @param {Buffer} tag\n   * @returns {Boolean}\n   */\n\n  verify(tag) {\n    assert(Buffer.isBuffer(tag));\n    assert(tag.length === 16);\n\n    const mac = this.final();\n\n    let z = 0;\n\n    for (let i = 0; i < 16; i++)\n      z |= mac[i] ^ tag[i];\n\n    return ((z - 1) >>> 31) !== 0;\n  }\n\n  /**\n   * Pad a chunk before updating mac.\n   * @private\n   * @param {Number} size\n   */\n\n  _pad16(size) {\n    const pos = size & 15;\n\n    if (pos > 0)\n      this.poly.update(zero16.slice(0, 16 - pos));\n  }\n\n  /**\n   * Encrypt a piece of data.\n   * @param {Buffer} key\n   * @param {Buffer} iv\n   * @param {Buffer} msg\n   * @param {Buffer?} aad\n   * @returns {Buffer} tag\n   */\n\n  static encrypt(key, iv, msg, aad) {\n    const aead = new AEAD();\n\n    aead.init(key, iv);\n\n    if (aad)\n      aead.aad(aad);\n\n    aead.encrypt(msg);\n\n    return aead.final();\n  }\n\n  /**\n   * Decrypt a piece of data.\n   * @param {Buffer} key\n   * @param {Buffer} iv\n   * @param {Buffer} msg\n   * @param {Buffer} tag\n   * @param {Buffer?} aad\n   * @returns {Boolean}\n   */\n\n  static decrypt(key, iv, msg, tag, aad) {\n    const aead = new AEAD();\n\n    aead.init(key, iv);\n\n    if (aad)\n      aead.aad(aad);\n\n    aead.decrypt(msg);\n\n    return aead.verify(tag);\n  }\n\n  /**\n   * Authenticate data without decrypting.\n   * @param {Buffer} key\n   * @param {Buffer} iv\n   * @param {Buffer} msg\n   * @param {Buffer} tag\n   * @param {Buffer?} aad\n   * @returns {Boolean}\n   */\n\n  static auth(key, iv, msg, tag, aad) {\n    const aead = new AEAD();\n\n    aead.init(key, iv);\n\n    if (aad)\n      aead.aad(aad);\n\n    aead.auth(msg);\n\n    return aead.verify(tag);\n  }\n}\n\n/*\n * Static\n */\n\nAEAD.native = ChaCha20.native;\n\n/*\n * Helpers\n */\n\nfunction writeU32(dst, num, off) {\n  dst[off++] = num;\n  num >>>= 8;\n  dst[off++] = num;\n  num >>>= 8;\n  dst[off++] = num;\n  num >>>= 8;\n  dst[off++] = num;\n  return off;\n}\n\nfunction writeU64(dst, num, off) {\n  const hi = (num * (1 / 0x100000000)) >>> 0;\n  const lo = num >>> 0;\n\n  writeU32(dst, lo, off + 0);\n  writeU32(dst, hi, off + 4);\n\n  return off + 8;\n}\n\n/*\n * Expose\n */\n\nmodule.exports = AEAD;\n","/*!\n * chacha20.js - chacha20 for bcrypto\n * Copyright (c) 2016-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n *\n * Resources\n *   https://en.wikipedia.org/wiki/Chacha20\n *   https://tools.ietf.org/html/rfc7539#section-2\n *   https://cr.yp.to/chacha.html\n */\n\n'use strict';\n\nconst assert = require('../internal/assert');\n\n/*\n * Constants\n */\n\nconst BIG_ENDIAN = new Int8Array(new Int16Array([1]).buffer)[0] === 0;\n\n/**\n * ChaCha20\n */\n\nclass ChaCha20 {\n  /**\n   * Create a ChaCha20 context.\n   * @constructor\n   */\n\n  constructor() {\n    this.state = new Uint32Array(16);\n    this.stream = new Uint32Array(16);\n    this.bytes = new Uint8Array(this.stream.buffer);\n    this.pos = -1;\n\n    if (BIG_ENDIAN)\n      this.bytes = Buffer.alloc(64);\n  }\n\n  /**\n   * Initialize chacha20 with a key, nonce, and counter.\n   * @param {Buffer} key\n   * @param {Buffer} nonce\n   * @param {Number} counter\n   */\n\n  init(key, nonce, counter) {\n    if (counter == null)\n      counter = 0;\n\n    assert(Buffer.isBuffer(key));\n    assert(Buffer.isBuffer(nonce));\n    assert(Number.isSafeInteger(counter));\n\n    if (key.length !== 16 && key.length !== 32)\n      throw new RangeError('Invalid key size.');\n\n    if (nonce.length >= 24) {\n      key = ChaCha20.derive(key, nonce.slice(0, 16));\n      nonce = nonce.slice(16);\n    }\n\n    this.state[0] = 0x61707865;\n    this.state[1] = key.length < 32 ? 0x3120646e : 0x3320646e;\n    this.state[2] = key.length < 32 ? 0x79622d36 : 0x79622d32;\n    this.state[3] = 0x6b206574;\n    this.state[4] = readU32(key, 0);\n    this.state[5] = readU32(key, 4);\n    this.state[6] = readU32(key, 8);\n    this.state[7] = readU32(key, 12);\n    this.state[8] = readU32(key, 16 % key.length);\n    this.state[9] = readU32(key, 20 % key.length);\n    this.state[10] = readU32(key, 24 % key.length);\n    this.state[11] = readU32(key, 28 % key.length);\n    this.state[12] = counter >>> 0;\n\n    if (nonce.length === 8) {\n      this.state[13] = (counter / 0x100000000) >>> 0;\n      this.state[14] = readU32(nonce, 0);\n      this.state[15] = readU32(nonce, 4);\n    } else if (nonce.length === 12) {\n      this.state[13] = readU32(nonce, 0);\n      this.state[14] = readU32(nonce, 4);\n      this.state[15] = readU32(nonce, 8);\n    } else if (nonce.length === 16) {\n      this.state[12] = readU32(nonce, 0);\n      this.state[13] = readU32(nonce, 4);\n      this.state[14] = readU32(nonce, 8);\n      this.state[15] = readU32(nonce, 12);\n    } else {\n      throw new RangeError('Invalid nonce size.');\n    }\n\n    this.pos = 0;\n\n    return this;\n  }\n\n  /**\n   * Encrypt/decrypt data.\n   * @param {Buffer} data - Will be mutated.\n   * @returns {Buffer}\n   */\n\n  encrypt(data) {\n    assert(Buffer.isBuffer(data));\n\n    if (this.pos === -1)\n      throw new Error('Context is not initialized.');\n\n    for (let i = 0; i < data.length; i++) {\n      if ((this.pos & 63) === 0) {\n        this._block();\n        this.pos = 0;\n      }\n\n      data[i] ^= this.bytes[this.pos++];\n    }\n\n    return data;\n  }\n\n  /**\n   * Stir the stream.\n   */\n\n  _block() {\n    for (let i = 0; i < 16; i++)\n      this.stream[i] = this.state[i];\n\n    for (let i = 0; i < 10; i++) {\n      qround(this.stream, 0, 4, 8, 12);\n      qround(this.stream, 1, 5, 9, 13);\n      qround(this.stream, 2, 6, 10, 14);\n      qround(this.stream, 3, 7, 11, 15);\n      qround(this.stream, 0, 5, 10, 15);\n      qround(this.stream, 1, 6, 11, 12);\n      qround(this.stream, 2, 7, 8, 13);\n      qround(this.stream, 3, 4, 9, 14);\n    }\n\n    for (let i = 0; i < 16; i++)\n      this.stream[i] += this.state[i];\n\n    if (BIG_ENDIAN) {\n      for (let i = 0; i < 16; i++)\n        writeU32(this.bytes, this.stream[i], i * 4);\n    }\n\n    this.state[12] += 1;\n\n    if (this.state[12] === 0)\n      this.state[13] += 1;\n  }\n\n  /**\n   * Destroy context.\n   */\n\n  destroy() {\n    for (let i = 0; i < 16; i++) {\n      this.state[i] = 0;\n      this.stream[i] = 0;\n    }\n\n    if (BIG_ENDIAN) {\n      for (let i = 0; i < 64; i++)\n        this.bytes[i] = 0;\n    }\n\n    this.pos = -1;\n\n    return this;\n  }\n\n  /**\n   * Derive key with XChaCha20.\n   * @param {Buffer} key\n   * @param {Buffer} nonce\n   * @returns {Buffer}\n   */\n\n  static derive(key, nonce) {\n    assert(Buffer.isBuffer(key));\n    assert(Buffer.isBuffer(nonce));\n\n    if (key.length !== 16 && key.length !== 32)\n      throw new RangeError('Invalid key size.');\n\n    if (nonce.length !== 16)\n      throw new RangeError('Invalid nonce size.');\n\n    const state = new Uint32Array(16);\n\n    state[0] = 0x61707865;\n    state[1] = key.length < 32 ? 0x3120646e : 0x3320646e;\n    state[2] = key.length < 32 ? 0x79622d36 : 0x79622d32;\n    state[3] = 0x6b206574;\n    state[4] = readU32(key, 0);\n    state[5] = readU32(key, 4);\n    state[6] = readU32(key, 8);\n    state[7] = readU32(key, 12);\n    state[8] = readU32(key, 16 % key.length);\n    state[9] = readU32(key, 20 % key.length);\n    state[10] = readU32(key, 24 % key.length);\n    state[11] = readU32(key, 28 % key.length);\n    state[12] = readU32(nonce, 0);\n    state[13] = readU32(nonce, 4);\n    state[14] = readU32(nonce, 8);\n    state[15] = readU32(nonce, 12);\n\n    for (let i = 0; i < 10; i++) {\n      qround(state, 0, 4, 8, 12);\n      qround(state, 1, 5, 9, 13);\n      qround(state, 2, 6, 10, 14);\n      qround(state, 3, 7, 11, 15);\n      qround(state, 0, 5, 10, 15);\n      qround(state, 1, 6, 11, 12);\n      qround(state, 2, 7, 8, 13);\n      qround(state, 3, 4, 9, 14);\n    }\n\n    const out = Buffer.alloc(32);\n\n    writeU32(out, state[0], 0);\n    writeU32(out, state[1], 4);\n    writeU32(out, state[2], 8);\n    writeU32(out, state[3], 12);\n    writeU32(out, state[12], 16);\n    writeU32(out, state[13], 20);\n    writeU32(out, state[14], 24);\n    writeU32(out, state[15], 28);\n\n    return out;\n  }\n}\n\n/*\n * Static\n */\n\nChaCha20.native = 0;\n\n/*\n * Helpers\n */\n\nfunction qround(x, a, b, c, d) {\n  x[a] += x[b];\n  x[d] = rotl32(x[d] ^ x[a], 16);\n\n  x[c] += x[d];\n  x[b] = rotl32(x[b] ^ x[c], 12);\n\n  x[a] += x[b];\n  x[d] = rotl32(x[d] ^ x[a], 8);\n\n  x[c] += x[d];\n  x[b] = rotl32(x[b] ^ x[c], 7);\n}\n\nfunction rotl32(w, b) {\n  return (w << b) | (w >>> (32 - b));\n}\n\nfunction readU32(data, off) {\n  return (data[off++]\n        + data[off++] * 0x100\n        + data[off++] * 0x10000\n        + data[off] * 0x1000000);\n}\n\nfunction writeU32(dst, num, off) {\n  dst[off++] = num;\n  num >>>= 8;\n  dst[off++] = num;\n  num >>>= 8;\n  dst[off++] = num;\n  num >>>= 8;\n  dst[off++] = num;\n  return off;\n}\n\n/*\n * Expose\n */\n\nmodule.exports = ChaCha20;\n","/*!\n * poly1305.js - poly1305 for bcrypto\n * Copyright (c) 2016-2019, Christopher Jeffrey (MIT License).\n * https://github.com/bcoin-org/bcrypto\n *\n * Parts of this software are based on floodyberry/poly1305-donna:\n *   Placed into the public domain by Andrew Moon.\n *   https://github.com/floodyberry/poly1305-donna\n *\n * Resources:\n *   https://en.wikipedia.org/wiki/Poly1305\n *   https://cr.yp.to/mac.html\n *   https://tools.ietf.org/html/rfc7539#section-2.5\n *   https://github.com/floodyberry/poly1305-donna/blob/master/poly1305-donna-16.h\n */\n\n'use strict';\n\nconst assert = require('../internal/assert');\n\n/**\n * Poly1305\n */\n\nclass Poly1305 {\n  /**\n   * Create a Poly1305 context.\n   * @constructor\n   */\n\n  constructor() {\n    this.r = new Uint16Array(10);\n    this.h = new Uint16Array(10);\n    this.pad = new Uint16Array(8);\n    this.buffer = Buffer.alloc(16);\n    this.fin = -1;\n    this.leftover = 0;\n  }\n\n  /**\n   * Initialize poly1305 with a key.\n   * @param {Buffer} key\n   */\n\n  init(key) {\n    assert(Buffer.isBuffer(key) && key.length >= 32);\n\n    // r &= 0xffffffc0ffffffc0ffffffc0fffffff\n    const t0 = readU16(key, 0);\n    const t1 = readU16(key, 2);\n    const t2 = readU16(key, 4);\n    const t3 = readU16(key, 6);\n    const t4 = readU16(key, 8);\n    const t5 = readU16(key, 10);\n    const t6 = readU16(key, 12);\n    const t7 = readU16(key, 14);\n\n    this.r[0] = t0 & 0x1fff;\n    this.r[1] = ((t0 >>> 13) | (t1 << 3)) & 0x1fff;\n    this.r[2] = ((t1 >>> 10) | (t2 << 6)) & 0x1f03;\n    this.r[3] = ((t2 >>> 7) | (t3 << 9)) & 0x1fff;\n    this.r[4] = ((t3 >>> 4) | (t4 << 12)) & 0x00ff;\n    this.r[5] = (t4 >>> 1) & 0x1ffe;\n    this.r[6] = ((t4 >>> 14) | (t5 << 2)) & 0x1fff;\n    this.r[7] = ((t5 >>> 11) | (t6 << 5)) & 0x1f81;\n    this.r[8] = ((t6 >>> 8) | (t7 << 8)) & 0x1fff;\n    this.r[9] = (t7 >>> 5) & 0x007f;\n\n    // h = 0\n    for (let i = 0; i < 10; i++)\n      this.h[i] = 0;\n\n    // Save pad for later.\n    for (let i = 0; i < 8; i++)\n      this.pad[i] = readU16(key, 16 + (2 * i));\n\n    this.fin = 0;\n    this.leftover = 0;\n\n    return this;\n  }\n\n  /**\n   * Process 16 byte blocks.\n   * @private\n   * @param {Buffer} data - Blocks.\n   * @param {Number} bytes - Size.\n   * @param {Number} m - Offset pointer.\n   */\n\n  _blocks(data, bytes, m) {\n    const hibit = this.fin ? 0 : (1 << 11); // 1 << 128\n    const d = new Uint32Array(10);\n\n    while (bytes >= 16) {\n      // h += m[i]\n      const t0 = readU16(data, m + 0);\n      const t1 = readU16(data, m + 2);\n      const t2 = readU16(data, m + 4);\n      const t3 = readU16(data, m + 6);\n      const t4 = readU16(data, m + 8);\n      const t5 = readU16(data, m + 10);\n      const t6 = readU16(data, m + 12);\n      const t7 = readU16(data, m + 14);\n\n      this.h[0] += t0 & 0x1fff;\n      this.h[1] += ((t0 >>> 13) | (t1 << 3)) & 0x1fff;\n      this.h[2] += ((t1 >>> 10) | (t2 << 6)) & 0x1fff;\n      this.h[3] += ((t2 >>> 7) | (t3 << 9)) & 0x1fff;\n      this.h[4] += ((t3 >>> 4) | (t4 << 12)) & 0x1fff;\n      this.h[5] += ((t4 >>> 1)) & 0x1fff;\n      this.h[6] += ((t4 >>> 14) | (t5 << 2)) & 0x1fff;\n      this.h[7] += ((t5 >>> 11) | (t6 << 5)) & 0x1fff;\n      this.h[8] += ((t6 >>> 8) | (t7 << 8)) & 0x1fff;\n      this.h[9] += ((t7 >>> 5)) | hibit;\n\n      // h *= r, (partial) h %= p\n      let c = 0;\n\n      for (let i = 0; i < 10; i++) {\n        d[i] = c;\n\n        for (let j = 0; j < 10; j++) {\n          let a = this.h[j];\n\n          if (j <= i)\n            a *= this.r[i - j];\n          else\n            a *= 5 * this.r[i + 10 - j];\n\n          d[i] += a;\n\n          // Sum(h[i] * r[i] * 5) will overflow\n          // slightly above 6 products with an\n          // unclamped r, so carry at 5.\n          if (j === 4) {\n            c = d[i] >>> 13;\n            d[i] &= 0x1fff;\n          }\n        }\n\n        c += d[i] >>> 13;\n        d[i] &= 0x1fff;\n      }\n\n      c = (c << 2) + c; // c *= 5\n      c += d[0];\n      d[0] = (c & 0x1fff);\n      c = c >>> 13;\n      d[1] += c;\n\n      for (let i = 0; i < 10; i++)\n        this.h[i] = d[i];\n\n      m += 16;\n      bytes -= 16;\n    }\n  }\n\n  /**\n   * Update the MAC with data (will be\n   * processed as 16 byte blocks).\n   * @param {Buffer} data\n   */\n\n  update(data) {\n    assert(Buffer.isBuffer(data));\n\n    if (this.fin === -1)\n      throw new Error('Context is not initialized.');\n\n    let bytes = data.length;\n    let m = 0;\n\n    // Handle leftover.\n    if (this.leftover) {\n      let want = 16 - this.leftover;\n\n      if (want > bytes)\n        want = bytes;\n\n      for (let i = 0; i < want; i++)\n        this.buffer[this.leftover + i] = data[m + i];\n\n      bytes -= want;\n      m += want;\n\n      this.leftover += want;\n\n      if (this.leftover < 16)\n        return this;\n\n      this._blocks(this.buffer, 16, 0);\n      this.leftover = 0;\n    }\n\n    // Process full blocks.\n    if (bytes >= 16) {\n      const want = bytes & ~(16 - 1);\n\n      this._blocks(data, want, m);\n\n      m += want;\n      bytes -= want;\n    }\n\n    // Store leftover.\n    if (bytes) {\n      for (let i = 0; i < bytes; i++)\n        this.buffer[this.leftover + i] = data[m + i];\n      this.leftover += bytes;\n    }\n\n    return this;\n  }\n\n  /**\n   * Finalize and return a 16-byte MAC.\n   * @returns {Buffer}\n   */\n\n  final() {\n    if (this.fin === -1)\n      throw new Error('Context is not initialized.');\n\n    const mac = Buffer.alloc(16);\n    const g = new Uint16Array(10);\n\n    // Process the remaining block.\n    if (this.leftover) {\n      let i = this.leftover;\n\n      this.buffer[i++] = 1;\n\n      for (; i < 16; i++)\n        this.buffer[i] = 0;\n\n      this.fin = 1;\n      this._blocks(this.buffer, 16, 0);\n    }\n\n    // Fully carry h.\n    let c = this.h[1] >>> 13;\n\n    this.h[1] &= 0x1fff;\n\n    for (let i = 2; i < 10; i++) {\n      this.h[i] += c;\n      c = this.h[i] >>> 13;\n      this.h[i] &= 0x1fff;\n    }\n\n    this.h[0] += c * 5;\n    c = this.h[0] >>> 13;\n    this.h[0] &= 0x1fff;\n    this.h[1] += c;\n    c = this.h[1] >>> 13;\n    this.h[1] &= 0x1fff;\n    this.h[2] += c;\n\n    // Compute h + -p.\n    g[0] = this.h[0] + 5;\n    c = g[0] >>> 13;\n    g[0] &= 0x1fff;\n\n    for (let i = 1; i < 10; i++) {\n      g[i] = this.h[i] + c;\n      c = g[i] >>> 13;\n      g[i] &= 0x1fff;\n    }\n\n    // Select h if h < p, or h + -p if h >= p.\n    let mask = (c ^ 1) - 1;\n\n    for (let i = 0; i < 10; i++)\n      g[i] &= mask;\n\n    mask = ~mask;\n\n    for (let i = 0; i < 10; i++)\n      this.h[i] = (this.h[i] & mask) | g[i];\n\n    // h = h % (2^128)\n    this.h[0] = ((this.h[0]) | (this.h[1] << 13)) & 0xffff;\n    this.h[1] = ((this.h[1] >>> 3) | (this.h[2] << 10)) & 0xffff;\n    this.h[2] = ((this.h[2] >>> 6) | (this.h[3] << 7)) & 0xffff;\n    this.h[3] = ((this.h[3] >>> 9) | (this.h[4] << 4)) & 0xffff;\n    this.h[4] = ((this.h[4] >>> 12)\n      | (this.h[5] << 1) | (this.h[6] << 14)) & 0xffff;\n    this.h[5] = ((this.h[6] >>> 2) | (this.h[7] << 11)) & 0xffff;\n    this.h[6] = ((this.h[7] >>> 5) | (this.h[8] << 8)) & 0xffff;\n    this.h[7] = ((this.h[8] >>> 8) | (this.h[9] << 5)) & 0xffff;\n\n    // mac = (h + pad) % (2^128)\n    let f = this.h[0] + this.pad[0];\n\n    this.h[0] = f;\n\n    for (let i = 1; i < 8; i++) {\n      f = this.h[i] + this.pad[i] + (f >>> 16);\n      this.h[i] = f;\n    }\n\n    for (let i = 0; i < 8; i++)\n      writeU16(mac, this.h[i], i * 2);\n\n    // Zero out the state.\n    this.destroy();\n\n    return mac;\n  }\n\n  /**\n   * Destroy the context.\n   */\n\n  destroy() {\n    for (let i = 0; i < 10; i++) {\n      this.r[i] = 0;\n      this.h[i] = 0;\n    }\n\n    for (let i = 0; i < 8; i++)\n      this.pad[i] = 0;\n\n    for (let i = 0; i < 16; i++)\n      this.buffer[i] = 0;\n\n    this.fin = -1;\n    this.leftover = 0;\n  }\n\n  /**\n   * Finalize and verify MAC against tag.\n   * @param {Buffer} tag\n   * @returns {Boolean}\n   */\n\n  verify(tag) {\n    assert(Buffer.isBuffer(tag));\n    assert(tag.length === 16);\n\n    const mac = this.final();\n\n    let z = 0;\n\n    for (let i = 0; i < 16; i++)\n      z |= mac[i] ^ tag[i];\n\n    return ((z - 1) >>> 31) !== 0;\n  }\n}\n\n/*\n * Static\n */\n\nPoly1305.native = 0;\n\n/*\n * Helpers\n */\n\nfunction readU16(data, off) {\n  return data[off++] + data[off] * 0x100;\n}\n\nfunction writeU16(dst, num, off) {\n  dst[off++] = num;\n  dst[off++] = num >>> 8;\n  return off;\n}\n\n/*\n * Expose\n */\n\nmodule.exports = Poly1305;\n","import debug from 'debug'\nimport { DUMP_SESSION_KEYS } from './constants'\nimport { KeyPair } from './@types/libp2p'\nimport { NoiseSession } from './@types/handshake'\n\nexport const logger = debug('libp2p:noise')\n\nlet keyLogger\nif (DUMP_SESSION_KEYS) {\n  keyLogger = logger\n} else {\n  keyLogger = () => { /* do nothing */ }\n}\n\nexport function logLocalStaticKeys (s: KeyPair): void {\n  keyLogger(`LOCAL_STATIC_PUBLIC_KEY ${s.publicKey.toString('hex')}`)\n  keyLogger(`LOCAL_STATIC_PRIVATE_KEY ${s.privateKey.toString('hex')}`)\n}\n\nexport function logLocalEphemeralKeys (e: KeyPair|undefined): void {\n  if (e) {\n    keyLogger(`LOCAL_PUBLIC_EPHEMERAL_KEY ${e.publicKey.toString('hex')}`)\n    keyLogger(`LOCAL_PRIVATE_EPHEMERAL_KEY ${e.privateKey.toString('hex')}`)\n  } else {\n    keyLogger('Missing local ephemeral keys.')\n  }\n}\n\nexport function logRemoteStaticKey (rs: Buffer): void {\n  keyLogger(`REMOTE_STATIC_PUBLIC_KEY ${rs.toString('hex')}`)\n}\n\nexport function logRemoteEphemeralKey (re: Buffer): void {\n  keyLogger(`REMOTE_EPHEMERAL_PUBLIC_KEY ${re.toString('hex')}`)\n}\n\nexport function logCipherState (session: NoiseSession): void {\n  if (session.cs1 && session.cs2) {\n    keyLogger(`CIPHER_STATE_1 ${session.cs1.n} ${session.cs1.k.toString('hex')}`)\n    keyLogger(`CIPHER_STATE_2 ${session.cs2.n} ${session.cs2.k.toString('hex')}`)\n  } else {\n    keyLogger('Missing cipher state.')\n  }\n}\n","export const NOISE_MSG_MAX_LENGTH_BYTES = 65535\nexport const NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG = NOISE_MSG_MAX_LENGTH_BYTES - 16\n\nexport const DUMP_SESSION_KEYS = process.env.DUMP_SESSION_KEYS\n","import { Buffer } from 'buffer'\nimport { bytes } from './@types/basic'\nimport { MessageBuffer } from './@types/handshake'\nimport BufferList from 'bl'\n\nexport const uint16BEEncode = (value: number, target: Buffer, offset: number): Buffer => {\n  target = target || Buffer.allocUnsafe(2)\n  target.writeUInt16BE(value, offset)\n  return target\n}\nuint16BEEncode.bytes = 2\n\nexport const uint16BEDecode = (data: Buffer | BufferList): number => {\n  if (data.length < 2) throw RangeError('Could not decode int16BE')\n  return data.readUInt16BE(0)\n}\nuint16BEDecode.bytes = 2\n\n// Note: IK and XX encoder usage is opposite (XX uses in stages encode0 where IK uses encode1)\n\nexport function encode0 (message: MessageBuffer): bytes {\n  return Buffer.concat([message.ne, message.ciphertext])\n}\n\nexport function encode1 (message: MessageBuffer): bytes {\n  return Buffer.concat([message.ne, message.ns, message.ciphertext])\n}\n\nexport function encode2 (message: MessageBuffer): bytes {\n  return Buffer.concat([message.ns, message.ciphertext])\n}\n\nexport function decode0 (input: bytes): MessageBuffer {\n  if (input.length < 32) {\n    throw new Error('Cannot decode stage 0 MessageBuffer: length less than 32 bytes.')\n  }\n\n  return {\n    ne: input.slice(0, 32),\n    ciphertext: input.slice(32, input.length),\n    ns: Buffer.alloc(0)\n  }\n}\n\nexport function decode1 (input: bytes): MessageBuffer {\n  if (input.length < 80) {\n    throw new Error('Cannot decode stage 1 MessageBuffer: length less than 80 bytes.')\n  }\n\n  return {\n    ne: input.slice(0, 32),\n    ns: input.slice(32, 80),\n    ciphertext: input.slice(80, input.length)\n  }\n}\n\nexport function decode2 (input: bytes): MessageBuffer {\n  if (input.length < 48) {\n    throw new Error('Cannot decode stage 2 MessageBuffer: length less than 48 bytes.')\n  }\n\n  return {\n    ne: Buffer.alloc(0),\n    ns: input.slice(0, 48),\n    ciphertext: input.slice(48, input.length)\n  }\n}\n","import { WrappedConnection } from './noise'\nimport { IK } from './handshakes/ik'\nimport { NoiseSession } from './@types/handshake'\nimport { bytes, bytes32 } from './@types/basic'\nimport { KeyPair } from './@types/libp2p'\nimport { IHandshake } from './@types/handshake-interface'\nimport { Buffer } from 'buffer'\nimport { decode0, decode1, encode0, encode1 } from './encoder'\nimport { decodePayload, getPeerIdFromPayload, verifySignedPayload } from './utils'\nimport { FailedIKError } from './errors'\nimport {\n  logger,\n  logLocalStaticKeys,\n  logRemoteStaticKey,\n  logLocalEphemeralKeys,\n  logRemoteEphemeralKey,\n  logCipherState\n} from './logger'\nimport PeerId from 'peer-id'\n\nexport class IKHandshake implements IHandshake {\n  public isInitiator: boolean\n  public session: NoiseSession\n  public remotePeer!: PeerId\n  public remoteEarlyData: Buffer\n\n  private readonly payload: bytes\n  private readonly prologue: bytes32\n  private readonly staticKeypair: KeyPair\n  private readonly connection: WrappedConnection\n  private readonly ik: IK\n\n  constructor (\n    isInitiator: boolean,\n    payload: bytes,\n    prologue: bytes32,\n    staticKeypair: KeyPair,\n    connection: WrappedConnection,\n    remoteStaticKey: bytes,\n    remotePeer?: PeerId,\n    handshake?: IK\n  ) {\n    this.isInitiator = isInitiator\n    this.payload = Buffer.from(payload)\n    this.prologue = prologue\n    this.staticKeypair = staticKeypair\n    this.connection = connection\n    if (remotePeer) {\n      this.remotePeer = remotePeer\n    }\n    this.ik = handshake ?? new IK()\n    this.session = this.ik.initSession(this.isInitiator, this.prologue, this.staticKeypair, remoteStaticKey)\n    this.remoteEarlyData = Buffer.alloc(0)\n  }\n\n  public async stage0 (): Promise<void> {\n    logLocalStaticKeys(this.session.hs.s)\n    logRemoteStaticKey(this.session.hs.rs)\n    if (this.isInitiator) {\n      logger('IK Stage 0 - Initiator sending message...')\n      const messageBuffer = this.ik.sendMessage(this.session, this.payload)\n      this.connection.writeLP(encode1(messageBuffer))\n      logger('IK Stage 0 - Initiator sent message.')\n      logLocalEphemeralKeys(this.session.hs.e)\n    } else {\n      logger('IK Stage 0 - Responder receiving message...')\n      const receivedMsg = await this.connection.readLP()\n      try {\n        const receivedMessageBuffer = decode1(receivedMsg.slice())\n        const { plaintext, valid } = this.ik.recvMessage(this.session, receivedMessageBuffer)\n        if (!valid) {\n          throw new Error('ik handshake stage 0 decryption validation fail')\n        }\n        logger('IK Stage 0 - Responder got message, going to verify payload.')\n        const decodedPayload = await decodePayload(plaintext)\n        this.remotePeer = this.remotePeer || await getPeerIdFromPayload(decodedPayload)\n        await verifySignedPayload(this.session.hs.rs, decodedPayload, this.remotePeer)\n        this.setRemoteEarlyData(decodedPayload.data)\n        logger('IK Stage 0 - Responder successfully verified payload!')\n        logRemoteEphemeralKey(this.session.hs.re)\n      } catch (e) {\n        const err = e as Error\n        logger('Responder breaking up with IK handshake in stage 0.')\n\n        throw new FailedIKError(receivedMsg, `Error occurred while verifying initiator's signed payload: ${err.message}`)\n      }\n    }\n  }\n\n  public async stage1 (): Promise<void> {\n    if (this.isInitiator) {\n      logger('IK Stage 1 - Initiator receiving message...')\n      const receivedMsg = (await this.connection.readLP()).slice()\n      const receivedMessageBuffer = decode0(Buffer.from(receivedMsg))\n      const { plaintext, valid } = this.ik.recvMessage(this.session, receivedMessageBuffer)\n      logger('IK Stage 1 - Initiator got message, going to verify payload.')\n      try {\n        if (!valid) {\n          throw new Error('ik stage 1 decryption validation fail')\n        }\n        const decodedPayload = await decodePayload(plaintext)\n        this.remotePeer = this.remotePeer || await getPeerIdFromPayload(decodedPayload)\n        await verifySignedPayload(receivedMessageBuffer.ns.slice(0, 32), decodedPayload, this.remotePeer)\n        this.setRemoteEarlyData(decodedPayload.data)\n        logger('IK Stage 1 - Initiator successfully verified payload!')\n        logRemoteEphemeralKey(this.session.hs.re)\n      } catch (e) {\n        const err = e as Error\n        logger('Initiator breaking up with IK handshake in stage 1.')\n        throw new FailedIKError(receivedMsg, `Error occurred while verifying responder's signed payload: ${err.message}`)\n      }\n    } else {\n      logger('IK Stage 1 - Responder sending message...')\n      const messageBuffer = this.ik.sendMessage(this.session, this.payload)\n      this.connection.writeLP(encode0(messageBuffer))\n      logger('IK Stage 1 - Responder sent message...')\n      logLocalEphemeralKeys(this.session.hs.e)\n    }\n    logCipherState(this.session)\n  }\n\n  public decrypt (ciphertext: bytes, session: NoiseSession): {plaintext: bytes, valid: boolean} {\n    const cs = this.getCS(session, false)\n    return this.ik.decryptWithAd(cs, Buffer.alloc(0), ciphertext)\n  }\n\n  public encrypt (plaintext: Buffer, session: NoiseSession): Buffer {\n    const cs = this.getCS(session)\n    return this.ik.encryptWithAd(cs, Buffer.alloc(0), plaintext)\n  }\n\n  public getLocalEphemeralKeys (): KeyPair {\n    if (!this.session.hs.e) {\n      throw new Error('Ephemeral keys do not exist.')\n    }\n\n    return this.session.hs.e\n  }\n\n  private getCS (session: NoiseSession, encryption = true) {\n    if (!session.cs1 || !session.cs2) {\n      throw new Error('Handshake not completed properly, cipher state does not exist.')\n    }\n\n    if (this.isInitiator) {\n      return encryption ? session.cs1 : session.cs2\n    } else {\n      return encryption ? session.cs2 : session.cs1\n    }\n  }\n\n  private setRemoteEarlyData (data: Uint8Array|null|undefined): void {\n    if (data) {\n      this.remoteEarlyData = Buffer.from(data.buffer, data.byteOffset, data.length)\n    }\n  }\n}\n","import { Buffer } from 'buffer'\nimport { CipherState, HandshakeState, MessageBuffer, NoiseSession } from '../@types/handshake'\nimport { bytes, bytes32 } from '../@types/basic'\nimport { generateKeypair, isValidPublicKey } from '../utils'\nimport { AbstractHandshake } from './abstract-handshake'\nimport { KeyPair } from '../@types/libp2p'\n\nexport class IK extends AbstractHandshake {\n  public initSession (initiator: boolean, prologue: bytes32, s: KeyPair, rs: bytes32): NoiseSession {\n    const psk = this.createEmptyKey()\n\n    let hs\n    if (initiator) {\n      hs = this.initializeInitiator(prologue, s, rs, psk)\n    } else {\n      hs = this.initializeResponder(prologue, s, rs, psk)\n    }\n\n    return {\n      hs,\n      i: initiator,\n      mc: 0\n    }\n  }\n\n  public sendMessage (session: NoiseSession, message: bytes): MessageBuffer {\n    let messageBuffer: MessageBuffer\n    if (session.mc === 0) {\n      messageBuffer = this.writeMessageA(session.hs, message)\n    } else if (session.mc === 1) {\n      const { messageBuffer: mb, h, cs1, cs2 } = this.writeMessageB(session.hs, message)\n      messageBuffer = mb\n      session.h = h\n      session.cs1 = cs1\n      session.cs2 = cs2\n    } else if (session.mc > 1) {\n      if (session.i) {\n        if (!session.cs1) {\n          throw new Error('CS1 (cipher state) is not defined')\n        }\n\n        messageBuffer = this.writeMessageRegular(session.cs1, message)\n      } else {\n        if (!session.cs2) {\n          throw new Error('CS2 (cipher state) is not defined')\n        }\n\n        messageBuffer = this.writeMessageRegular(session.cs2, message)\n      }\n    } else {\n      throw new Error('Session invalid.')\n    }\n\n    session.mc++\n    return messageBuffer\n  }\n\n  public recvMessage (session: NoiseSession, message: MessageBuffer): {plaintext: bytes, valid: boolean} {\n    let plaintext = Buffer.alloc(0); let valid = false\n    if (session.mc === 0) {\n      ({ plaintext, valid } = this.readMessageA(session.hs, message))\n    }\n    if (session.mc === 1) {\n      const { plaintext: pt, valid: v, h, cs1, cs2 } = this.readMessageB(session.hs, message)\n      plaintext = pt\n      valid = v\n      session.h = h\n      session.cs1 = cs1\n      session.cs2 = cs2\n    }\n    session.mc++\n    return { plaintext, valid }\n  }\n\n  private writeMessageA (hs: HandshakeState, payload: bytes): MessageBuffer {\n    hs.e = generateKeypair()\n    const ne = hs.e.publicKey\n    this.mixHash(hs.ss, ne)\n    this.mixKey(hs.ss, this.dh(hs.e.privateKey, hs.rs))\n    const spk = Buffer.from(hs.s.publicKey)\n    const ns = this.encryptAndHash(hs.ss, spk)\n\n    this.mixKey(hs.ss, this.dh(hs.s.privateKey, hs.rs))\n    const ciphertext = this.encryptAndHash(hs.ss, payload)\n\n    return { ne, ns, ciphertext }\n  }\n\n  private writeMessageB (hs: HandshakeState, payload: bytes) {\n    hs.e = generateKeypair()\n    const ne = hs.e.publicKey\n    this.mixHash(hs.ss, ne)\n\n    this.mixKey(hs.ss, this.dh(hs.e.privateKey, hs.re))\n    this.mixKey(hs.ss, this.dh(hs.e.privateKey, hs.rs))\n    const ciphertext = this.encryptAndHash(hs.ss, payload)\n    const ns = this.createEmptyKey()\n    const messageBuffer: MessageBuffer = { ne, ns, ciphertext }\n    const { cs1, cs2 } = this.split(hs.ss)\n\n    return { messageBuffer, cs1, cs2, h: hs.ss.h }\n  }\n\n  private readMessageA (hs: HandshakeState, message: MessageBuffer): {plaintext: bytes, valid: boolean} {\n    if (isValidPublicKey(message.ne)) {\n      hs.re = message.ne\n    }\n\n    this.mixHash(hs.ss, hs.re)\n    this.mixKey(hs.ss, this.dh(hs.s.privateKey, hs.re))\n    const { plaintext: ns, valid: valid1 } = this.decryptAndHash(hs.ss, message.ns)\n    if (valid1 && ns.length === 32 && isValidPublicKey(ns)) {\n      hs.rs = ns\n    }\n    this.mixKey(hs.ss, this.dh(hs.s.privateKey, hs.rs))\n    const { plaintext, valid: valid2 } = this.decryptAndHash(hs.ss, message.ciphertext)\n    return { plaintext, valid: (valid1 && valid2) }\n  }\n\n  private readMessageB (hs: HandshakeState, message: MessageBuffer): {h: bytes, plaintext: bytes, valid: boolean, cs1: CipherState, cs2: CipherState} {\n    if (isValidPublicKey(message.ne)) {\n      hs.re = message.ne\n    }\n\n    this.mixHash(hs.ss, hs.re)\n    if (!hs.e) {\n      throw new Error('Handshake state should contain ephemeral key by now.')\n    }\n    this.mixKey(hs.ss, this.dh(hs.e.privateKey, hs.re))\n    this.mixKey(hs.ss, this.dh(hs.s.privateKey, hs.re))\n    const { plaintext, valid } = this.decryptAndHash(hs.ss, message.ciphertext)\n    const { cs1, cs2 } = this.split(hs.ss)\n\n    return { h: hs.ss.h, valid, plaintext, cs1, cs2 }\n  }\n\n  private initializeInitiator (prologue: bytes32, s: KeyPair, rs: bytes32, psk: bytes32): HandshakeState {\n    const name = 'Noise_IK_25519_ChaChaPoly_SHA256'\n    const ss = this.initializeSymmetric(name)\n    this.mixHash(ss, prologue)\n    this.mixHash(ss, rs)\n    const re = Buffer.alloc(32)\n\n    return { ss, s, rs, re, psk }\n  }\n\n  private initializeResponder (prologue: bytes32, s: KeyPair, rs: bytes32, psk: bytes32): HandshakeState {\n    const name = 'Noise_IK_25519_ChaChaPoly_SHA256'\n    const ss = this.initializeSymmetric(name)\n    this.mixHash(ss, prologue)\n    this.mixHash(ss, s.publicKey)\n    const re = Buffer.alloc(32)\n\n    return { ss, s, rs, re, psk }\n  }\n}\n","import BufferList from 'bl'\n\nexport class FailedIKError extends Error {\n  public initialMsg: string|BufferList|Buffer\n\n  constructor (initialMsg: string|BufferList|Buffer, message?: string) {\n    super(message)\n\n    this.initialMsg = initialMsg\n    this.name = 'FailedIKhandshake'\n  }\n}\n","import { Buffer } from 'buffer'\nimport { XXHandshake } from './handshake-xx'\nimport { XX } from './handshakes/xx'\nimport { KeyPair } from './@types/libp2p'\nimport { bytes, bytes32 } from './@types/basic'\nimport { decodePayload, getPeerIdFromPayload, verifySignedPayload } from './utils'\nimport { logger, logLocalEphemeralKeys, logRemoteEphemeralKey, logRemoteStaticKey } from './logger'\nimport { WrappedConnection } from './noise'\nimport { decode0, decode1 } from './encoder'\nimport PeerId from 'peer-id'\n\nexport class XXFallbackHandshake extends XXHandshake {\n  private readonly ephemeralKeys?: KeyPair\n  private readonly initialMsg: bytes\n\n  constructor (\n    isInitiator: boolean,\n    payload: bytes,\n    prologue: bytes32,\n    staticKeypair: KeyPair,\n    connection: WrappedConnection,\n    initialMsg: bytes,\n    remotePeer?: PeerId,\n    ephemeralKeys?: KeyPair,\n    handshake?: XX\n  ) {\n    super(isInitiator, payload, prologue, staticKeypair, connection, remotePeer, handshake)\n    if (ephemeralKeys) {\n      this.ephemeralKeys = ephemeralKeys\n    }\n    this.initialMsg = initialMsg\n  }\n\n  // stage 0\n  // eslint-disable-next-line require-await\n  public async propose (): Promise<void> {\n    if (this.isInitiator) {\n      this.xx.sendMessage(this.session, Buffer.alloc(0), this.ephemeralKeys)\n      logger('XX Fallback Stage 0 - Initialized state as the first message was sent by initiator.')\n      logLocalEphemeralKeys(this.session.hs.e)\n    } else {\n      logger('XX Fallback Stage 0 - Responder decoding initial msg from IK.')\n      const receivedMessageBuffer = decode0(this.initialMsg)\n      const { valid } = this.xx.recvMessage(this.session, {\n        ne: receivedMessageBuffer.ne,\n        ns: Buffer.alloc(0),\n        ciphertext: Buffer.alloc(0)\n      })\n      if (!valid) {\n        throw new Error('xx fallback stage 0 decryption validation fail')\n      }\n      logger('XX Fallback Stage 0 - Responder used received message from IK.')\n      logRemoteEphemeralKey(this.session.hs.re)\n    }\n  }\n\n  // stage 1\n  public async exchange (): Promise<void> {\n    if (this.isInitiator) {\n      const receivedMessageBuffer = decode1(this.initialMsg)\n      const { plaintext, valid } = this.xx.recvMessage(this.session, receivedMessageBuffer)\n      if (!valid) {\n        throw new Error('xx fallback stage 1 decryption validation fail')\n      }\n      logger('XX Fallback Stage 1 - Initiator used received message from IK.')\n      logRemoteEphemeralKey(this.session.hs.re)\n      logRemoteStaticKey(this.session.hs.rs)\n\n      logger(\"Initiator going to check remote's signature...\")\n      try {\n        const decodedPayload = await decodePayload(plaintext)\n        this.remotePeer = this.remotePeer || await getPeerIdFromPayload(decodedPayload)\n        await verifySignedPayload(this.session.hs.rs, decodedPayload, this.remotePeer)\n        this.setRemoteEarlyData(decodedPayload.data)\n      } catch (e) {\n        const err = e as Error\n        throw new Error(`Error occurred while verifying signed payload from responder: ${err.message}`)\n      }\n      logger('All good with the signature!')\n    } else {\n      logger('XX Fallback Stage 1 - Responder start')\n      await super.exchange()\n      logger('XX Fallback Stage 1 - Responder end')\n    }\n  }\n}\n","import { Buffer } from 'buffer'\nimport { IHandshake } from './@types/handshake-interface'\nimport { NOISE_MSG_MAX_LENGTH_BYTES, NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG } from './constants'\n\ninterface IReturnEncryptionWrapper {\n  (source: Iterable<Uint8Array>): AsyncIterableIterator<Uint8Array>\n}\n\n// Returns generator that encrypts payload from the user\nexport function encryptStream (handshake: IHandshake): IReturnEncryptionWrapper {\n  return async function * (source) {\n    for await (const chunk of source) {\n      const chunkBuffer = Buffer.from(chunk.buffer, chunk.byteOffset, chunk.length)\n\n      for (let i = 0; i < chunkBuffer.length; i += NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG) {\n        let end = i + NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG\n        if (end > chunkBuffer.length) {\n          end = chunkBuffer.length\n        }\n\n        const data = handshake.encrypt(chunkBuffer.slice(i, end), handshake.session)\n        yield data\n      }\n    }\n  }\n}\n\n// Decrypt received payload to the user\nexport function decryptStream (handshake: IHandshake): IReturnEncryptionWrapper {\n  return async function * (source) {\n    for await (const chunk of source) {\n      const chunkBuffer = Buffer.from(chunk.buffer, chunk.byteOffset, chunk.length)\n\n      for (let i = 0; i < chunkBuffer.length; i += NOISE_MSG_MAX_LENGTH_BYTES) {\n        let end = i + NOISE_MSG_MAX_LENGTH_BYTES\n        if (end > chunkBuffer.length) {\n          end = chunkBuffer.length\n        }\n\n        const chunk = chunkBuffer.slice(i, end)\n        const { plaintext: decrypted, valid } = await handshake.decrypt(chunk, handshake.session)\n        if (!valid) {\n          throw new Error('Failed to validate decrypted chunk')\n        }\n        yield decrypted\n      }\n    }\n  }\n}\n","import { bytes32 } from './@types/basic'\nimport PeerId from 'peer-id'\n\n/**\n * Storage for static keys of previously connected peers.\n */\nclass Keycache {\n  private readonly storage = new Map<Uint8Array, bytes32>()\n\n  public store (peerId: PeerId, key: bytes32): void {\n    this.storage.set(peerId.id, key)\n  }\n\n  public load (peerId?: PeerId): bytes32 | null {\n    if (!peerId) {\n      return null\n    }\n    return this.storage.get(peerId.id) ?? null\n  }\n\n  public resetStorage (): void {\n    this.storage.clear()\n  }\n}\n\nconst KeyCache = new Keycache()\nexport {\n  KeyCache\n}\n","'use strict'\n\nconst { EventEmitter } = require('events')\nconst errcode = require('err-code')\n\nconst libp2pRecord = require('libp2p-record')\nconst { MemoryDatastore } = require('interface-datastore')\nconst uint8ArrayEquals = require('uint8arrays/equals')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nconst RoutingTable = require('./routing')\nconst utils = require('./utils')\nconst c = require('./constants')\nconst Network = require('./network')\nconst contentFetching = require('./content-fetching')\nconst contentRouting = require('./content-routing')\nconst peerRouting = require('./peer-routing')\nconst Message = require('./message')\nconst Providers = require('./providers')\nconst RandomWalk = require('./random-walk')\nconst QueryManager = require('./query-manager')\n\nconst Record = libp2pRecord.Record\n\n/**\n * @typedef {import('libp2p')} Libp2p\n * @typedef {import('libp2p/src/peer-store')} PeerStore\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('interface-datastore').Datastore} Datastore\n * @typedef {import('libp2p/src/dialer')} Dialer\n * @typedef {import('libp2p/src/registrar')} Registrar\n * @typedef {import('cids')} CID\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n * @typedef {object} PeerData\n * @property {PeerId} id\n * @property {Multiaddr[]} multiaddrs\n *\n * @typedef {object} RandomWalkOptions\n * @property {boolean} enabled discovery enabled (default: true)\n * @property {number} queriesPerPeriod how many queries to run per period (default: 1)\n * @property {number} interval how often to run the the random-walk process, in milliseconds (default: 300000)\n * @property {number} timeout how long to wait for the the random-walk query to run, in milliseconds (default: 30000)\n * @property {number} delay how long to wait before starting the first random walk, in milliseconds (default: 10000)\n */\n\n/**\n * A DHT implementation modeled after Kademlia with S/Kademlia modifications.\n * Original implementation in go: https://github.com/libp2p/go-libp2p-kad-dht.\n */\nclass KadDHT extends EventEmitter {\n  /**\n   * Create a new KadDHT.\n   *\n   * @param {Object} props\n   * @param {Libp2p} props.libp2p - the libp2p instance\n   * @param {Dialer} props.dialer - libp2p dialer instance\n   * @param {PeerId} props.peerId - peer's peerId\n   * @param {PeerStore} props.peerStore - libp2p peerStore\n   * @param {Registrar} props.registrar - libp2p registrar instance\n   * @param {string} [props.protocolPrefix = '/ipfs'] - libp2p registrar handle protocol\n   * @param {boolean} [props.forceProtocolLegacy = false] - WARNING: this is not recommended and should only be used for legacy purposes\n   * @param {number} props.kBucketSize - k-bucket size (default 20)\n   * @param {boolean} props.clientMode - If true, the DHT will not respond to queries. This should be true if your node will not be dialable. (default: false)\n   * @param {number} props.concurrency - alpha concurrency of queries (default 3)\n   * @param {Datastore} props.datastore - datastore (default MemoryDatastore)\n   * @param {object} props.validators - validators object with namespace as keys and function(key, record, callback)\n   * @param {object} props.selectors - selectors object with namespace as keys and function(key, records)\n   * @param {RandomWalkOptions} props.randomWalk - randomWalk options\n   * @param {function(import('libp2p-record').Record, PeerId): void} [props.onPut] - Called when an entry is added to or changed in the datastore\n   * @param {function(import('libp2p-record').Record): void} [props.onRemove] - Called when an entry is removed from the datastore\n   */\n  constructor ({\n    libp2p,\n    dialer,\n    peerId,\n    peerStore,\n    registrar,\n    protocolPrefix = '/ipfs',\n    forceProtocolLegacy = false,\n    datastore = new MemoryDatastore(),\n    kBucketSize = c.K,\n    clientMode = false,\n    concurrency = c.ALPHA,\n    validators = {},\n    selectors = {},\n    randomWalk = {\n      enabled: false,\n      queriesPerPeriod: 1,\n      interval: 300000,\n      timeout: 30000,\n      delay: 10000\n    },\n    onPut = () => {},\n    onRemove = () => {}\n  }) {\n    super()\n\n    if (!dialer) {\n      throw new Error('libp2p-kad-dht requires an instance of Dialer')\n    }\n\n    /**\n     * Local reference to the libp2p instance. May be undefined.\n     *\n     * @type {Libp2p}\n     */\n    this.libp2p = libp2p\n\n    /**\n     * Local reference to the libp2p dialer instance\n     *\n     * @type {Dialer}\n     */\n    this.dialer = dialer\n\n    /**\n     * Local peer-id\n     *\n     * @type {PeerId}\n     */\n    this.peerId = peerId\n\n    /**\n     * Local PeerStore\n     *\n     * @type {PeerStore}\n     */\n    this.peerStore = peerStore\n\n    /**\n     * Local peer info\n     *\n     * @type {Registrar}\n     */\n    this.registrar = registrar\n\n    /**\n     * Registrar protocol\n     *\n     * @type {string}\n     */\n    this.protocol = protocolPrefix + (forceProtocolLegacy ? '' : c.PROTOCOL_DHT)\n\n    /**\n     * k-bucket size\n     *\n     * @type {number}\n     */\n    this.kBucketSize = kBucketSize\n\n    this._clientMode = clientMode\n\n    /**\n     * ALPHA concurrency at which each query path with run, defaults to 3\n     *\n     * @type {number}\n     */\n    this.concurrency = concurrency\n\n    /**\n     * Number of disjoint query paths to use\n     * This is set to `kBucketSize`/2 per the S/Kademlia paper\n     *\n     * @type {number}\n     */\n    this.disjointPaths = Math.ceil(this.kBucketSize / 2)\n\n    /**\n     * The routing table.\n     *\n     * @type {RoutingTable}\n     */\n    this.routingTable = new RoutingTable(this.peerId, this.kBucketSize)\n\n    /**\n     * Reference to the datastore, uses an in-memory store if none given.\n     *\n     * @type {Datastore}\n     */\n    this.datastore = datastore\n\n    /**\n     * Provider management\n     *\n     * @type {Providers}\n     */\n    this.providers = new Providers(this.datastore, this.peerId)\n\n    this.validators = {\n      pk: libp2pRecord.validator.validators.pk,\n      ...validators\n    }\n\n    this.selectors = {\n      pk: libp2pRecord.selection.selectors.pk,\n      ...selectors\n    }\n\n    this.network = new Network(this)\n\n    this._log = utils.logger(this.peerId)\n\n    /**\n     * Random walk management\n     *\n     * @type {RandomWalk}\n     */\n    this.randomWalk = new RandomWalk(this, randomWalk)\n\n    /**\n     * Keeps track of running queries\n     *\n     * @type {QueryManager}\n     */\n    this._queryManager = new QueryManager()\n\n    this._running = false\n\n    // DHT components\n    this.contentFetching = contentFetching(this)\n    this.contentRouting = contentRouting(this)\n    this.peerRouting = peerRouting(this)\n\n    // datastore events\n    this.onPut = onPut\n    this.onRemove = onRemove\n  }\n\n  /**\n   * Is this DHT running.\n   */\n  get isStarted () {\n    return this._running\n  }\n\n  /**\n   * Start listening to incoming connections.\n   *\n   * @returns {Promise<void>}\n   */\n  async start () {\n    this._running = true\n    this.providers.start()\n    this._queryManager.start()\n    await this.network.start()\n\n    // Start random walk, it will not run if it's disabled\n    this.randomWalk.start()\n  }\n\n  /**\n   * Stop accepting incoming connections and sending outgoing\n   * messages.\n   *\n   * @returns {Promise<void>}\n   */\n  stop () {\n    this._running = false\n    this.randomWalk.stop()\n    this.providers.stop()\n    this._queryManager.stop()\n    return this.network.stop()\n  }\n\n  /**\n   * Store the given key/value  pair in the DHT.\n   *\n   * @param {Uint8Array} key\n   * @param {Uint8Array} value\n   * @param {Object} [options] - put options\n   * @param {number} [options.minPeers] - minimum number of peers required to successfully put (default: closestPeers.length)\n   * @returns {Promise<void>}\n   */\n  async put (key, value, options = {}) { // eslint-disable-line require-await\n    return this.contentFetching.put(key, value, options)\n  }\n\n  /**\n   * Get the value to the given key.\n   * Times out after 1 minute by default.\n   *\n   * @param {Uint8Array} key\n   * @param {Object} [options] - get options\n   * @param {number} [options.timeout] - optional timeout (default: 60000)\n   * @returns {Promise<Uint8Array>}\n   */\n  async get (key, options = {}) { // eslint-disable-line require-await\n    return this.contentFetching.get(key, options)\n  }\n\n  /**\n   * Get the `n` values to the given key without sorting.\n   *\n   * @param {Uint8Array} key\n   * @param {number} nvals\n   * @param {Object} [options] - get options\n   * @param {number} [options.timeout] - optional timeout (default: 60000)\n   */\n  async getMany (key, nvals, options = {}) { // eslint-disable-line require-await\n    return this.contentFetching.getMany(key, nvals, options)\n  }\n\n  /**\n   * Remove the given key from the local datastore.\n   *\n   * @param {Uint8Array} key\n   */\n  async removeLocal (key) {\n    this._log(`removeLocal: ${uint8ArrayToString(key, 'base32')}`)\n    const dsKey = utils.bufferToKey(key)\n\n    try {\n      await this.datastore.delete(dsKey)\n    } catch (err) {\n      if (err.code === 'ERR_NOT_FOUND') {\n        return undefined\n      }\n      throw err\n    }\n  }\n\n  /**\n   * @param {Uint8Array} key\n   * @param {Uint8Array} value\n   */\n  async _putLocal (key, value) {\n    this._log(`_putLocal: ${uint8ArrayToString(key, 'base32')}`)\n    const dsKey = utils.bufferToKey(key)\n\n    await this.datastore.put(dsKey, value)\n  }\n\n  // ----------- Content Routing\n\n  /**\n   * Announce to the network that we can provide given key's value.\n   *\n   * @param {CID} key\n   * @returns {Promise<void>}\n   */\n  async provide (key) { // eslint-disable-line require-await\n    return this.contentRouting.provide(key)\n  }\n\n  /**\n   * Search the dht for up to `K` providers of the given CID.\n   *\n   * @param {CID} key\n   * @param {Object} [options] - findProviders options\n   * @param {number} [options.timeout=60000] - how long the query should maximally run, in milliseconds (default: 60000)\n   * @param {number} [options.maxNumProviders=5] - maximum number of providers to find\n   * @returns {AsyncIterable<{ id: PeerId, multiaddrs: Multiaddr[] }>}\n   */\n  async * findProviders (key, options = { timeout: 6000, maxNumProviders: 5 }) {\n    for await (const peerData of this.contentRouting.findProviders(key, options)) {\n      yield peerData\n    }\n  }\n\n  // ----------- Peer Routing -----------\n\n  /**\n   * Search for a peer with the given ID.\n   *\n   * @param {PeerId} id\n   * @param {Object} [options] - findPeer options\n   * @param {number} [options.timeout=60000] - how long the query should maximally run, in milliseconds (default: 60000)\n   * @returns {Promise<{ id: PeerId, multiaddrs: Multiaddr[] }>}\n   */\n  async findPeer (id, options = { timeout: 60000 }) { // eslint-disable-line require-await\n    return this.peerRouting.findPeer(id, options)\n  }\n\n  /**\n   * Kademlia 'node lookup' operation.\n   *\n   * @param {Uint8Array} key\n   * @param {Object} [options]\n   * @param {boolean} [options.shallow = false] - shallow query\n   */\n  async * getClosestPeers (key, options = { shallow: false }) {\n    yield * this.peerRouting.getClosestPeers(key, options)\n  }\n\n  /**\n   * Get the public key for the given peer id.\n   *\n   * @param {PeerId} peer\n   */\n  getPublicKey (peer) {\n    return this.peerRouting.getPublicKey(peer)\n  }\n\n  // ----------- Discovery -----------\n\n  /**\n   * @param {PeerId} peerId\n   * @param {Multiaddr[]} multiaddrs\n   */\n  _peerDiscovered (peerId, multiaddrs) {\n    this.emit('peer', {\n      id: peerId,\n      multiaddrs\n    })\n  }\n\n  // ----------- Internals -----------\n\n  /**\n   * Returns the routing tables closest peers, for the key of\n   * the message.\n   *\n   * @param {Message} msg\n   */\n  async _nearestPeersToQuery (msg) {\n    const key = await utils.convertBuffer(msg.key)\n    const ids = this.routingTable.closestPeers(key, this.kBucketSize)\n\n    return ids.map((p) => {\n      const peer = this.peerStore.get(p)\n\n      return {\n        id: p,\n        multiaddrs: peer ? peer.addresses.map((address) => address.multiaddr) : []\n      }\n    })\n  }\n\n  /**\n   * Get the nearest peers to the given query, but iff closer\n   * than self.\n   *\n   * @param {Message} msg\n   * @param {PeerId} peerId\n   */\n  async _betterPeersToQuery (msg, peerId) {\n    this._log('betterPeersToQuery')\n    const closer = await this._nearestPeersToQuery(msg)\n\n    return closer.filter((closer) => {\n      if (this._isSelf(closer.id)) {\n        // Should bail, not sure\n        this._log.error('trying to return self as closer')\n        return false\n      }\n\n      return !closer.id.isEqual(peerId)\n    })\n  }\n\n  /**\n   * Try to fetch a given record by from the local datastore.\n   * Returns the record iff it is still valid, meaning\n   * - it was either authored by this node, or\n   * - it was received less than `MAX_RECORD_AGE` ago.\n   *\n   * @param {Uint8Array} key\n   */\n\n  async _checkLocalDatastore (key) {\n    this._log(`checkLocalDatastore: ${uint8ArrayToString(key)} %b`, key)\n    const dsKey = utils.bufferToKey(key)\n\n    // Fetch value from ds\n    let rawRecord\n    try {\n      rawRecord = await this.datastore.get(dsKey)\n    } catch (err) {\n      if (err.code === 'ERR_NOT_FOUND') {\n        return undefined\n      }\n      throw err\n    }\n\n    // Create record from the returned bytes\n    const record = Record.deserialize(rawRecord)\n\n    if (!record) {\n      throw errcode(new Error('Invalid record'), 'ERR_INVALID_RECORD')\n    }\n\n    // Check validity: compare time received with max record age\n    if (record.timeReceived == null ||\n      utils.now() - record.timeReceived.getTime() > c.MAX_RECORD_AGE) {\n      // If record is bad delete it and return\n      await this.datastore.delete(dsKey)\n      this.onRemove(record)\n      return undefined\n    }\n\n    // Record is valid\n    return record\n  }\n\n  /**\n   * Add the peer to the routing table and update it in the peerStore.\n   *\n   * @param {PeerId} peerId\n   */\n  async _add (peerId) {\n    await this.routingTable.add(peerId)\n  }\n\n  /**\n   * Verify a record without searching the DHT.\n   *\n   * @param {import('libp2p-record').Record} record\n   */\n  async _verifyRecordLocally (record) {\n    this._log('verifyRecordLocally')\n\n    await libp2pRecord.validator.verifyRecord(this.validators, record)\n  }\n\n  /**\n   * Is the given peer id our PeerId?\n   *\n   * @param {PeerId} other\n   */\n  _isSelf (other) {\n    return other && uint8ArrayEquals(this.peerId.id, other.id)\n  }\n\n  /**\n   * Store the given key/value pair at the peer `target`.\n   *\n   * @param {Uint8Array} key\n   * @param {Uint8Array} rec - encoded record\n   * @param {PeerId} target\n   */\n  async _putValueToPeer (key, rec, target) {\n    const msg = new Message(Message.TYPES.PUT_VALUE, key, 0)\n    msg.record = Record.deserialize(rec)\n\n    const resp = await this.network.sendRequest(target, msg)\n\n    if (resp.record && !uint8ArrayEquals(resp.record.value, Record.deserialize(rec).value)) {\n      throw errcode(new Error('value not put correctly'), 'ERR_PUT_VALUE_INVALID')\n    }\n  }\n\n  /**\n   * Query a particular peer for the value for the given key.\n   * It will either return the value or a list of closer peers.\n   *\n   * Note: The peerStore is updated with new addresses found for the given peer.\n   *\n   * @param {PeerId} peer\n   * @param {Uint8Array} key\n   */\n  async _getValueOrPeers (peer, key) {\n    const msg = await this._getValueSingle(peer, key)\n\n    const peers = msg.closerPeers\n    const record = msg.record\n\n    if (record) {\n      // We have a record\n      try {\n        await this._verifyRecordOnline(record)\n      } catch (err) {\n        const errMsg = 'invalid record received, discarded'\n        this._log(errMsg)\n        throw errcode(new Error(errMsg), 'ERR_INVALID_RECORD')\n      }\n\n      return { record, peers }\n    }\n\n    if (peers.length > 0) {\n      return { peers }\n    }\n\n    throw errcode(new Error('Not found'), 'ERR_NOT_FOUND')\n  }\n\n  /**\n   * Get a value via rpc call for the given parameters.\n   *\n   * @param {PeerId} peer\n   * @param {Uint8Array} key\n   */\n  async _getValueSingle (peer, key) { // eslint-disable-line require-await\n    const msg = new Message(Message.TYPES.GET_VALUE, key, 0)\n    return this.network.sendRequest(peer, msg)\n  }\n\n  /**\n   * Verify a record, fetching missing public keys from the network.\n   * Calls back with an error if the record is invalid.\n   *\n   * @param {import('libp2p-record').Record} record\n   * @returns {Promise<void>}\n   */\n  async _verifyRecordOnline (record) {\n    await libp2pRecord.validator.verifyRecord(this.validators, record)\n  }\n}\n\nmodule.exports = KadDHT\nmodule.exports.multicodec = '/ipfs' + c.PROTOCOL_DHT\n","'use strict'\n\n// @ts-ignore\nconst KBucket = require('k-bucket')\n\nconst utils = require('./utils')\n\n/**\n * @typedef {import('peer-id')} PeerId\n *\n * @typedef {object} KBucketPeer\n * @property {Uint8Array} id\n * @property {PeerId} peer\n */\n\n/**\n * A wrapper around `k-bucket`, to provide easy store and\n * retrieval for peers.\n */\nclass RoutingTable {\n  /**\n   * @param {PeerId} self\n   * @param {number} kBucketSize\n   */\n  constructor (self, kBucketSize) {\n    this.self = self\n    this._onPing = this._onPing.bind(this)\n\n    this._onInit(kBucketSize)\n  }\n\n  /**\n   * @param {number} kBucketSize\n   */\n  async _onInit (kBucketSize) {\n    const selfKey = await utils.convertPeerId(this.self)\n\n    this.kb = new KBucket({\n      localNodeId: selfKey,\n      numberOfNodesPerKBucket: kBucketSize,\n      numberOfNodesToPing: 1\n    })\n\n    this.kb.on('ping', this._onPing)\n  }\n\n  /**\n   * Called on the `ping` event from `k-bucket`.\n   * Currently this just removes the oldest contact from\n   * the list, without actually pinging the individual peers.\n   * This is the same as go does, but should probably\n   * be upgraded to actually ping the individual peers.\n   *\n   * @param {KBucketPeer[]} oldContacts\n   * @param {KBucketPeer} newContact\n   */\n  _onPing (oldContacts, newContact) {\n    // just use the first one (k-bucket sorts from oldest to newest)\n    const oldest = oldContacts[0]\n\n    if (oldest) {\n      // remove the oldest one\n      this.kb.remove(oldest.id)\n    }\n\n    // add the new one\n    this.kb.add(newContact)\n  }\n\n  // -- Public Interface\n\n  /**\n   * Amount of currently stored peers.\n   */\n  get size () {\n    return this.kb.count()\n  }\n\n  /**\n   * Find a specific peer by id.\n   *\n   * @param {PeerId} peer\n   * @returns {Promise<PeerId | undefined>}\n   */\n  async find (peer) {\n    const key = await utils.convertPeerId(peer)\n    const closest = this.closestPeer(key)\n\n    if (closest && peer.equals(closest)) {\n      return closest\n    }\n  }\n\n  /**\n   * Retrieve the closest peers to the given key.\n   *\n   * @param {Uint8Array} key\n   */\n  closestPeer (key) {\n    const res = this.closestPeers(key, 1)\n    if (res.length > 0) {\n      return res[0]\n    }\n  }\n\n  /**\n   * Retrieve the `count`-closest peers to the given key.\n   *\n   * @param {Uint8Array} key\n   * @param {number} count\n   */\n  closestPeers (key, count) {\n    /** @type {KBucketPeer[]} */\n    const closest = this.kb.closest(key, count)\n\n    return closest.map(p => p.peer)\n  }\n\n  /**\n   * Add or update the routing table with the given peer.\n   *\n   * @param {PeerId} peer\n   */\n  async add (peer) {\n    const id = await utils.convertPeerId(peer)\n\n    this.kb.add({ id: id, peer: peer })\n  }\n\n  /**\n   * Remove a given peer from the table.\n   *\n   * @param {PeerId} peer\n   */\n  async remove (peer) {\n    const id = await utils.convertPeerId(peer)\n\n    this.kb.remove(id)\n  }\n}\n\nmodule.exports = RoutingTable\n","/*\nindex.js - Kademlia DHT K-bucket implementation as a binary tree.\n\nThe MIT License (MIT)\n\nCopyright (c) 2013-2021 Tristan Slominski\n\nPermission is hereby granted, free of charge, to any person\nobtaining a copy of this software and associated documentation\nfiles (the \"Software\"), to deal in the Software without\nrestriction, including without limitation the rights to use,\ncopy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the\nSoftware is furnished to do so, subject to the following\nconditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\nOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\nOTHER DEALINGS IN THE SOFTWARE.\n*/\n'use strict'\n\nconst randomBytes = require('randombytes')\nconst { EventEmitter } = require('events')\n\n/**\n * @param  {Uint8Array} array1\n * @param  {Uint8Array} array2\n * @return {Boolean}\n */\nfunction arrayEquals (array1, array2) {\n  if (array1 === array2) {\n    return true\n  }\n  if (array1.length !== array2.length) {\n    return false\n  }\n  for (let i = 0, length = array1.length; i < length; ++i) {\n    if (array1[i] !== array2[i]) {\n      return false\n    }\n  }\n  return true\n}\n\nfunction createNode () {\n  return { contacts: [], dontSplit: false, left: null, right: null }\n}\n\nfunction ensureInt8 (name, val) {\n  if (!(val instanceof Uint8Array)) {\n    throw new TypeError(name + ' is not a Uint8Array')\n  }\n}\n\n/**\n * Implementation of a Kademlia DHT k-bucket used for storing\n * contact (peer node) information.\n *\n * @extends EventEmitter\n */\nclass KBucket extends EventEmitter {\n  /**\n   * `options`:\n   *   `distance`: _Function_\n   *     `function (firstId, secondId) { return distance }` An optional\n   *     `distance` function that gets two `id` Uint8Arrays\n   *     and return distance (as number) between them.\n   *   `arbiter`: _Function_ _(Default: vectorClock arbiter)_\n   *     `function (incumbent, candidate) { return contact; }` An optional\n   *     `arbiter` function that givent two `contact` objects with the same `id`\n   *     returns the desired object to be used for updating the k-bucket. For\n   *     more details, see [arbiter function](#arbiter-function).\n   *   `localNodeId`: _Uint8Array_ An optional Uint8Array representing the local node id.\n   *     If not provided, a local node id will be created via `randomBytes(20)`.\n   *     `metadata`: _Object_ _(Default: {})_ Optional satellite data to include\n   *     with the k-bucket. `metadata` property is guaranteed not be altered by,\n   *     it is provided as an explicit container for users of k-bucket to store\n   *     implementation-specific data.\n   *   `numberOfNodesPerKBucket`: _Integer_ _(Default: 20)_ The number of nodes\n   *     that a k-bucket can contain before being full or split.\n   *     `numberOfNodesToPing`: _Integer_ _(Default: 3)_ The number of nodes to\n   *     ping when a bucket that should not be split becomes full. KBucket will\n   *     emit a `ping` event that contains `numberOfNodesToPing` nodes that have\n   *     not been contacted the longest.\n   *\n   * @param {Object=} options optional\n   */\n  constructor (options = {}) {\n    super()\n\n    this.localNodeId = options.localNodeId || randomBytes(20)\n    this.numberOfNodesPerKBucket = options.numberOfNodesPerKBucket || 20\n    this.numberOfNodesToPing = options.numberOfNodesToPing || 3\n    this.distance = options.distance || KBucket.distance\n    // use an arbiter from options or vectorClock arbiter by default\n    this.arbiter = options.arbiter || KBucket.arbiter\n    this.metadata = Object.assign({}, options.metadata)\n\n    ensureInt8('option.localNodeId as parameter 1', this.localNodeId)\n\n    this.root = createNode()\n  }\n\n  /**\n   * Default arbiter function for contacts with the same id. Uses\n   * contact.vectorClock to select which contact to update the k-bucket with.\n   * Contact with larger vectorClock field will be selected. If vectorClock is\n   * the same, candidat will be selected.\n   *\n   * @param  {Object} incumbent Contact currently stored in the k-bucket.\n   * @param  {Object} candidate Contact being added to the k-bucket.\n   * @return {Object}           Contact to updated the k-bucket with.\n   */\n  static arbiter (incumbent, candidate) {\n    return incumbent.vectorClock > candidate.vectorClock ? incumbent : candidate\n  }\n\n  /**\n   * Default distance function. Finds the XOR\n   * distance between firstId and secondId.\n   *\n   * @param  {Uint8Array} firstId  Uint8Array containing first id.\n   * @param  {Uint8Array} secondId Uint8Array containing second id.\n   * @return {Number}              Integer The XOR distance between firstId\n   *                               and secondId.\n   */\n  static distance (firstId, secondId) {\n    let distance = 0\n    let i = 0\n    const min = Math.min(firstId.length, secondId.length)\n    const max = Math.max(firstId.length, secondId.length)\n    for (; i < min; ++i) {\n      distance = distance * 256 + (firstId[i] ^ secondId[i])\n    }\n    for (; i < max; ++i) distance = distance * 256 + 255\n    return distance\n  }\n\n  /**\n   * Adds a contact to the k-bucket.\n   *\n   * @param {Object} contact the contact object to add\n   */\n  add (contact) {\n    ensureInt8('contact.id', (contact || {}).id)\n\n    let bitIndex = 0\n    let node = this.root\n\n    while (node.contacts === null) {\n      // this is not a leaf node but an inner node with 'low' and 'high'\n      // branches; we will check the appropriate bit of the identifier and\n      // delegate to the appropriate node for further processing\n      node = this._determineNode(node, contact.id, bitIndex++)\n    }\n\n    // check if the contact already exists\n    const index = this._indexOf(node, contact.id)\n    if (index >= 0) {\n      this._update(node, index, contact)\n      return this\n    }\n\n    if (node.contacts.length < this.numberOfNodesPerKBucket) {\n      node.contacts.push(contact)\n      this.emit('added', contact)\n      return this\n    }\n\n    // the bucket is full\n    if (node.dontSplit) {\n      // we are not allowed to split the bucket\n      // we need to ping the first this.numberOfNodesToPing\n      // in order to determine if they are alive\n      // only if one of the pinged nodes does not respond, can the new contact\n      // be added (this prevents DoS flodding with new invalid contacts)\n      this.emit('ping', node.contacts.slice(0, this.numberOfNodesToPing), contact)\n      return this\n    }\n\n    this._split(node, bitIndex)\n    return this.add(contact)\n  }\n\n  /**\n   * Get the n closest contacts to the provided node id. \"Closest\" here means:\n   * closest according to the XOR metric of the contact node id.\n   *\n   * @param  {Uint8Array} id  Contact node id\n   * @param  {Number=} n      Integer (Default: Infinity) The maximum number of\n   *                          closest contacts to return\n   * @return {Array}          Array Maximum of n closest contacts to the node id\n   */\n  closest (id, n = Infinity) {\n    ensureInt8('id', id)\n\n    if ((!Number.isInteger(n) && n !== Infinity) || n <= 0) {\n      throw new TypeError('n is not positive number')\n    }\n\n    let contacts = []\n\n    for (let nodes = [this.root], bitIndex = 0; nodes.length > 0 && contacts.length < n;) {\n      const node = nodes.pop()\n      if (node.contacts === null) {\n        const detNode = this._determineNode(node, id, bitIndex++)\n        nodes.push(node.left === detNode ? node.right : node.left)\n        nodes.push(detNode)\n      } else {\n        contacts = contacts.concat(node.contacts)\n      }\n    }\n\n    return contacts\n      .map(a => [this.distance(a.id, id), a])\n      .sort((a, b) => a[0] - b[0])\n      .slice(0, n)\n      .map(a => a[1])\n  }\n\n  /**\n   * Counts the total number of contacts in the tree.\n   *\n   * @return {Number} The number of contacts held in the tree\n   */\n  count () {\n    // return this.toArray().length\n    let count = 0\n    for (const nodes = [this.root]; nodes.length > 0;) {\n      const node = nodes.pop()\n      if (node.contacts === null) nodes.push(node.right, node.left)\n      else count += node.contacts.length\n    }\n    return count\n  }\n\n  /**\n   * Determines whether the id at the bitIndex is 0 or 1.\n   * Return left leaf if `id` at `bitIndex` is 0, right leaf otherwise\n   *\n   * @param  {Object} node     internal object that has 2 leafs: left and right\n   * @param  {Uint8Array} id   Id to compare localNodeId with.\n   * @param  {Number} bitIndex Integer (Default: 0) The bit index to which bit\n   *                           to check in the id Uint8Array.\n   * @return {Object}          left leaf if id at bitIndex is 0, right leaf otherwise.\n   */\n  _determineNode (node, id, bitIndex) {\n    // **NOTE** remember that id is a Uint8Array and has granularity of\n    // bytes (8 bits), whereas the bitIndex is the _bit_ index (not byte)\n\n    // id's that are too short are put in low bucket (1 byte = 8 bits)\n    // (bitIndex >> 3) finds how many bytes the bitIndex describes\n    // bitIndex % 8 checks if we have extra bits beyond byte multiples\n    // if number of bytes is <= no. of bytes described by bitIndex and there\n    // are extra bits to consider, this means id has less bits than what\n    // bitIndex describes, id therefore is too short, and will be put in low\n    // bucket\n    const bytesDescribedByBitIndex = bitIndex >> 3\n    const bitIndexWithinByte = bitIndex % 8\n    if ((id.length <= bytesDescribedByBitIndex) && (bitIndexWithinByte !== 0)) {\n      return node.left\n    }\n\n    const byteUnderConsideration = id[bytesDescribedByBitIndex]\n\n    // byteUnderConsideration is an integer from 0 to 255 represented by 8 bits\n    // where 255 is 11111111 and 0 is 00000000\n    // in order to find out whether the bit at bitIndexWithinByte is set\n    // we construct (1 << (7 - bitIndexWithinByte)) which will consist\n    // of all bits being 0, with only one bit set to 1\n    // for example, if bitIndexWithinByte is 3, we will construct 00010000 by\n    // (1 << (7 - 3)) -> (1 << 4) -> 16\n    if (byteUnderConsideration & (1 << (7 - bitIndexWithinByte))) {\n      return node.right\n    }\n\n    return node.left\n  }\n\n  /**\n   * Get a contact by its exact ID.\n   * If this is a leaf, loop through the bucket contents and return the correct\n   * contact if we have it or null if not. If this is an inner node, determine\n   * which branch of the tree to traverse and repeat.\n   *\n   * @param  {Uint8Array} id The ID of the contact to fetch.\n   * @return {Object|Null}   The contact if available, otherwise null\n   */\n  get (id) {\n    ensureInt8('id', id)\n\n    let bitIndex = 0\n\n    let node = this.root\n    while (node.contacts === null) {\n      node = this._determineNode(node, id, bitIndex++)\n    }\n\n    // index of uses contact id for matching\n    const index = this._indexOf(node, id)\n    return index >= 0 ? node.contacts[index] : null\n  }\n\n  /**\n   * Returns the index of the contact with provided\n   * id if it exists, returns -1 otherwise.\n   *\n   * @param  {Object} node    internal object that has 2 leafs: left and right\n   * @param  {Uint8Array} id  Contact node id.\n   * @return {Number}         Integer Index of contact with provided id if it\n   *                          exists, -1 otherwise.\n   */\n  _indexOf (node, id) {\n    for (let i = 0; i < node.contacts.length; ++i) {\n      if (arrayEquals(node.contacts[i].id, id)) return i\n    }\n\n    return -1\n  }\n\n  /**\n   * Removes contact with the provided id.\n   *\n   * @param  {Uint8Array} id The ID of the contact to remove.\n   * @return {Object}        The k-bucket itself.\n   */\n  remove (id) {\n    ensureInt8('the id as parameter 1', id)\n\n    let bitIndex = 0\n    let node = this.root\n\n    while (node.contacts === null) {\n      node = this._determineNode(node, id, bitIndex++)\n    }\n\n    const index = this._indexOf(node, id)\n    if (index >= 0) {\n      const contact = node.contacts.splice(index, 1)[0]\n      this.emit('removed', contact)\n    }\n\n    return this\n  }\n\n  /**\n   * Splits the node, redistributes contacts to the new nodes, and marks the\n   * node that was split as an inner node of the binary tree of nodes by\n   * setting this.root.contacts = null\n   *\n   * @param  {Object} node     node for splitting\n   * @param  {Number} bitIndex the bitIndex to which byte to check in the\n   *                           Uint8Array for navigating the binary tree\n   */\n  _split (node, bitIndex) {\n    node.left = createNode()\n    node.right = createNode()\n\n    // redistribute existing contacts amongst the two newly created nodes\n    for (const contact of node.contacts) {\n      this._determineNode(node, contact.id, bitIndex).contacts.push(contact)\n    }\n\n    node.contacts = null // mark as inner tree node\n\n    // don't split the \"far away\" node\n    // we check where the local node would end up and mark the other one as\n    // \"dontSplit\" (i.e. \"far away\")\n    const detNode = this._determineNode(node, this.localNodeId, bitIndex)\n    const otherNode = node.left === detNode ? node.right : node.left\n    otherNode.dontSplit = true\n  }\n\n  /**\n   * Returns all the contacts contained in the tree as an array.\n   * If this is a leaf, return a copy of the bucket. If this is not a leaf,\n   * return the union of the low and high branches (themselves also as arrays).\n   *\n   * @return {Array} All of the contacts in the tree, as an array\n   */\n  toArray () {\n    let result = []\n    for (const nodes = [this.root]; nodes.length > 0;) {\n      const node = nodes.pop()\n      if (node.contacts === null) nodes.push(node.right, node.left)\n      else result = result.concat(node.contacts)\n    }\n    return result\n  }\n\n  /**\n   * Similar to `toArray()` but instead of buffering everything up into an\n   * array before returning it, yields contacts as they are encountered while\n   * walking the tree.\n   *\n   * @return {Iterable} All of the contacts in the tree, as an iterable\n   */\n  * toIterable () {\n    for (const nodes = [this.root]; nodes.length > 0;) {\n      const node = nodes.pop()\n      if (node.contacts === null) {\n        nodes.push(node.right, node.left)\n      } else {\n        yield * node.contacts\n      }\n    }\n  }\n\n  /**\n   * Updates the contact selected by the arbiter.\n   * If the selection is our old contact and the candidate is some new contact\n   * then the new contact is abandoned (not added).\n   * If the selection is our old contact and the candidate is our old contact\n   * then we are refreshing the contact and it is marked as most recently\n   * contacted (by being moved to the right/end of the bucket array).\n   * If the selection is our new contact, the old contact is removed and the new\n   * contact is marked as most recently contacted.\n   *\n   * @param  {Object} node    internal object that has 2 leafs: left and right\n   * @param  {Number} index   the index in the bucket where contact exists\n   *                          (index has already been computed in a previous\n   *                          calculation)\n   * @param  {Object} contact The contact object to update.\n   */\n  _update (node, index, contact) {\n    // sanity check\n    if (!arrayEquals(node.contacts[index].id, contact.id)) {\n      throw new Error('wrong index for _update')\n    }\n\n    const incumbent = node.contacts[index]\n    const selection = this.arbiter(incumbent, contact)\n    // if the selection is our old contact and the candidate is some new\n    // contact, then there is nothing to do\n    if (selection === incumbent && incumbent !== contact) return\n\n    node.contacts.splice(index, 1) // remove old contact\n    node.contacts.push(selection) // add more recent contact version\n    this.emit('updated', incumbent, selection)\n  }\n}\n\nmodule.exports = KBucket\n","'use strict'\n\nconst debug = require('debug')\nconst multihashing = require('multihashing-async')\nconst mh = multihashing.multihash\nconst { Key } = require('interface-datastore')\n// @ts-ignore\nconst distance = require('xor-distance')\nconst pMap = require('p-map')\nconst { Record } = require('libp2p-record')\nconst PeerId = require('peer-id')\nconst errcode = require('err-code')\nconst uint8ArrayConcat = require('uint8arrays/concat')\nconst uint8ArrayFromString = require('uint8arrays/from-string')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\n/**\n * Creates a DHT ID by hashing a given Uint8Array.\n *\n * @param {Uint8Array} buf\n * @returns {Promise<Uint8Array>}\n */\nexports.convertBuffer = (buf) => {\n  return multihashing.digest(buf, 'sha2-256')\n}\n\n/**\n * Creates a DHT ID by hashing a Peer ID\n *\n * @param {PeerId} peer\n * @returns {Promise<Uint8Array>}\n */\nexports.convertPeerId = (peer) => {\n  return multihashing.digest(peer.id, 'sha2-256')\n}\n\n/**\n * Convert a Uint8Array to their SHA2-256 hash.\n *\n * @param {Uint8Array} buf\n * @returns {Key}\n */\nexports.bufferToKey = (buf) => {\n  return new Key('/' + exports.encodeBase32(buf), false)\n}\n\n/**\n * Generate the key for a public key.\n *\n * @param {PeerId} peer\n * @returns {Uint8Array}\n */\nexports.keyForPublicKey = (peer) => {\n  return uint8ArrayConcat([\n    uint8ArrayFromString('/pk/'),\n    peer.id\n  ])\n}\n\n/**\n * @param {Uint8Array} key\n */\nexports.isPublicKeyKey = (key) => {\n  return uint8ArrayToString(key.slice(0, 4)) === '/pk/'\n}\n\n/**\n * @param {Uint8Array} key\n */\nexports.fromPublicKeyKey = (key) => {\n  return new PeerId(key.slice(4))\n}\n\n/**\n * Get the current time as timestamp.\n *\n * @returns {number}\n */\nexports.now = () => {\n  return Date.now()\n}\n\n/**\n * Encode a given Uint8Array into a base32 string.\n *\n * @param {Uint8Array} buf\n * @returns {string}\n */\nexports.encodeBase32 = (buf) => {\n  return uint8ArrayToString(buf, 'base32')\n}\n\n/**\n * Decode a given base32 string into a Uint8Array.\n *\n * @param {string} raw\n * @returns {Uint8Array}\n */\nexports.decodeBase32 = (raw) => {\n  return uint8ArrayFromString(raw, 'base32')\n}\n\n/**\n * Sort peers by distance to the given `target`.\n *\n * @param {Array<PeerId>} peers\n * @param {Uint8Array} target\n */\nexports.sortClosestPeers = async (peers, target) => {\n  const distances = await pMap(peers, async (peer) => {\n    const id = await exports.convertPeerId(peer)\n\n    return {\n      peer: peer,\n      distance: distance(id, target)\n    }\n  })\n\n  return distances.sort(exports.xorCompare).map((d) => d.peer)\n}\n\n/**\n * Compare function to sort an array of elements which have a distance property which is the xor distance to a given element.\n *\n * @param {{ distance: Uint8Array }} a\n * @param {{ distance: Uint8Array }} b\n */\nexports.xorCompare = (a, b) => {\n  return distance.compare(a.distance, b.distance)\n}\n\n/**\n * Computes how many results to collect on each disjoint path, rounding up.\n * This ensures that we look for at least one result per path.\n *\n * @param {number} resultsWanted\n * @param {number} numPaths - total number of paths\n */\nexports.pathSize = (resultsWanted, numPaths) => {\n  return Math.ceil(resultsWanted / numPaths)\n}\n\n/**\n * Create a new put record, encodes and signs it if enabled.\n *\n * @param {Uint8Array} key\n * @param {Uint8Array} value\n * @returns {Uint8Array}\n */\nexports.createPutRecord = (key, value) => {\n  const timeReceived = new Date()\n  const rec = new Record(key, value, timeReceived)\n\n  return rec.serialize()\n}\n\n/**\n * Creates a logger for the given subsystem\n *\n * @param {PeerId} [id]\n * @param {string} [subsystem]\n */\nexports.logger = (id, subsystem) => {\n  const name = ['libp2p', 'dht']\n  if (subsystem) {\n    name.push(subsystem)\n  }\n  if (id) {\n    name.push(`${id.toB58String().slice(0, 8)}`)\n  }\n\n  // Add a formatter for converting to a base58 string\n  debug.formatters.b = (v) => {\n    return mh.toB58String(v)\n  }\n\n  const logger = Object.assign(debug(name.join(':')), {\n    error: debug(name.concat(['error']).join(':'))\n  })\n\n  return logger\n}\n\nexports.TimeoutError = class TimeoutError extends Error {\n  get code () {\n    return 'ETIMEDOUT'\n  }\n}\n\n/**\n * Creates an async function that calls the given `asyncFn` and Errors\n * if it does not resolve within `time` ms\n *\n * @template T\n * @param {(...args: any[]) => Promise<T>} asyncFn\n * @param {number} [time]\n */\nexports.withTimeout = (asyncFn, time) => {\n  /**\n   * @param  {...any} args\n   * @returns {Promise<T>}\n   */\n  function timeoutFn (...args) {\n    return Promise.race([\n      asyncFn(...args),\n      new Promise((resolve, reject) => {\n        setTimeout(() => {\n          reject(errcode(new Error('Async function did not complete before timeout'), 'ETIMEDOUT'))\n        }, time)\n      })\n    ])\n  }\n\n  return timeoutFn\n}\n\n/**\n * Iterates the given `asyncIterator` and runs each item through the given `asyncFn` in parallel.\n * Returns a promise that resolves when all items of the `asyncIterator` have been passed\n * through `asyncFn`.\n *\n * @template T\n * @template O\n *\n * @param {AsyncIterable<T>} asyncIterator\n * @param {(arg0: T) => Promise<O>} asyncFn\n */\nexports.mapParallel = async function (asyncIterator, asyncFn) {\n  const tasks = []\n  for await (const item of asyncIterator) {\n    tasks.push(asyncFn(item))\n  }\n  return Promise.all(tasks)\n}\n","module.exports = dist\n\nfunction dist (a, b) {\n  if (a.length !== b.length) throw new Error('Inputs should have the same length')\n  var result = Buffer.allocUnsafe(a.length)\n  for (var i = 0; i < a.length; i++) result[i] = a[i] ^ b[i]\n  return result\n}\n\ndist.compare = function compare (a, b) {\n  if (a.length !== b.length) throw new Error('Inputs should have the same length')\n  for (var i = 0; i < a.length; i++) {\n    if (a[i] === b[i]) continue\n    return a[i] < b[i] ? -1 : 1\n  }\n  return 0\n}\n\ndist.gt = function gt (a, b) {\n  return dist.compare(a, b) === 1\n}\n\ndist.lt = function lt (a, b) {\n  return dist.compare(a, b) === -1\n}\n\ndist.eq = function eq (a, b) {\n  return dist.compare(a, b) === 0\n}\n","'use strict';\nconst AggregateError = require('aggregate-error');\n\nmodule.exports = async (\n\titerable,\n\tmapper,\n\t{\n\t\tconcurrency = Infinity,\n\t\tstopOnError = true\n\t} = {}\n) => {\n\treturn new Promise((resolve, reject) => {\n\t\tif (typeof mapper !== 'function') {\n\t\t\tthrow new TypeError('Mapper function is required');\n\t\t}\n\n\t\tif (!((Number.isSafeInteger(concurrency) || concurrency === Infinity) && concurrency >= 1)) {\n\t\t\tthrow new TypeError(`Expected \\`concurrency\\` to be an integer from 1 and up or \\`Infinity\\`, got \\`${concurrency}\\` (${typeof concurrency})`);\n\t\t}\n\n\t\tconst result = [];\n\t\tconst errors = [];\n\t\tconst iterator = iterable[Symbol.iterator]();\n\t\tlet isRejected = false;\n\t\tlet isIterableDone = false;\n\t\tlet resolvingCount = 0;\n\t\tlet currentIndex = 0;\n\n\t\tconst next = () => {\n\t\t\tif (isRejected) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst nextItem = iterator.next();\n\t\t\tconst index = currentIndex;\n\t\t\tcurrentIndex++;\n\n\t\t\tif (nextItem.done) {\n\t\t\t\tisIterableDone = true;\n\n\t\t\t\tif (resolvingCount === 0) {\n\t\t\t\t\tif (!stopOnError && errors.length !== 0) {\n\t\t\t\t\t\treject(new AggregateError(errors));\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresolve(result);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tresolvingCount++;\n\n\t\t\t(async () => {\n\t\t\t\ttry {\n\t\t\t\t\tconst element = await nextItem.value;\n\t\t\t\t\tresult[index] = await mapper(element, index);\n\t\t\t\t\tresolvingCount--;\n\t\t\t\t\tnext();\n\t\t\t\t} catch (error) {\n\t\t\t\t\tif (stopOnError) {\n\t\t\t\t\t\tisRejected = true;\n\t\t\t\t\t\treject(error);\n\t\t\t\t\t} else {\n\t\t\t\t\t\terrors.push(error);\n\t\t\t\t\t\tresolvingCount--;\n\t\t\t\t\t\tnext();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t})();\n\t\t};\n\n\t\tfor (let i = 0; i < concurrency; i++) {\n\t\t\tnext();\n\n\t\t\tif (isIterableDone) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t});\n};\n","'use strict'\n\n// MaxRecordAge specifies the maximum time that any node will hold onto a record\n// from the time its received. This does not apply to any other forms of validity that\n// the record may contain.\n// For example, a record may contain an ipns entry with an EOL saying its valid\n// until the year 2020 (a great time in the future). For that record to stick around\n// it must be rebroadcasted more frequently than once every 'MaxRecordAge'\n\nconst second = exports.second = 1000\nconst minute = exports.minute = 60 * second\nconst hour = exports.hour = 60 * minute\n\nexports.MAX_RECORD_AGE = 36 * hour\n\nexports.PROTOCOL_DHT = '/kad/1.0.0'\n\nexports.PROVIDERS_KEY_PREFIX = '/providers/'\n\nexports.PROVIDERS_LRU_CACHE_SIZE = 256\n\nexports.PROVIDERS_VALIDITY = 24 * hour\n\nexports.PROVIDERS_CLEANUP_INTERVAL = hour\n\nexports.READ_MESSAGE_TIMEOUT = 10 * second\n\n// The number of records that will be retrieved on a call to getMany()\nexports.GET_MANY_RECORD_COUNT = 16\n\n// K is the maximum number of requests to perform before returning failure\nexports.K = 20\n\n// Alpha is the concurrency for asynchronous requests\nexports.ALPHA = 3\n\nexports.defaultRandomWalk = {\n  enabled: true,\n  queriesPerPeriod: 1,\n  interval: 5 * minute,\n  timeout: 10 * second,\n  delay: 10 * second\n}\n","'use strict'\n\nconst errcode = require('err-code')\n\nconst { pipe } = require('it-pipe')\nconst lp = require('it-length-prefixed')\nconst pTimeout = require('p-timeout')\nconst { consume } = require('streaming-iterables')\nconst first = require('it-first')\n\nconst MulticodecTopology = require('libp2p-interfaces/src/topology/multicodec-topology')\n\nconst rpc = require('./rpc')\nconst c = require('./constants')\nconst Message = require('./message')\nconst utils = require('./utils')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n */\n\n/**\n * Handle network operations for the dht\n */\nclass Network {\n  /**\n   * Create a new network\n   *\n   * @param {import('./index')} dht\n   */\n  constructor (dht) {\n    this.dht = dht\n    this.readMessageTimeout = c.READ_MESSAGE_TIMEOUT\n    this._log = utils.logger(this.dht.peerId, 'net')\n    this._rpc = rpc(this.dht)\n    this._onPeerConnected = this._onPeerConnected.bind(this)\n    this._running = false\n  }\n\n  /**\n   * Start the network\n   */\n  async start () {\n    if (this._running) {\n      return\n    }\n\n    if (!this.dht.isStarted) {\n      throw errcode(new Error('Can not start network'), 'ERR_CANNOT_START_NETWORK')\n    }\n\n    this._running = true\n\n    // Only respond to queries when not in client mode\n    if (this.dht._clientMode === false) {\n      // Incoming streams\n      this.dht.registrar.handle(this.dht.protocol, this._rpc)\n    }\n\n    // register protocol with topology\n    const topology = new MulticodecTopology({\n      multicodecs: [this.dht.protocol],\n      handlers: {\n        onConnect: this._onPeerConnected,\n        onDisconnect: () => {}\n      }\n    })\n    this._registrarId = await this.dht.registrar.register(topology)\n  }\n\n  /**\n   * Stop all network activity\n   */\n  async stop () {\n    if (!this.dht.isStarted && !this.isStarted) {\n      return\n    }\n    this._running = false\n\n    // unregister protocol and handlers\n    if (this._registrarId) {\n      await this.dht.registrar.unregister(this._registrarId)\n    }\n  }\n\n  /**\n   * Is the network online?\n   *\n   * @type {boolean}\n   */\n  get isStarted () {\n    return this._running\n  }\n\n  /**\n   * Are all network components there?\n   *\n   * @type {boolean}\n   */\n  get isConnected () {\n    // TODO add a way to check if switch has started or not\n    return this.dht.isStarted && this.isStarted\n  }\n\n  /**\n   * Registrar notifies a connection successfully with dht protocol.\n   *\n   * @param {PeerId} peerId - remote peer id\n   */\n  async _onPeerConnected (peerId) {\n    await this.dht._add(peerId)\n    this._log('added to the routing table: %s', peerId.toB58String())\n  }\n\n  /**\n   * Send a request and record RTT for latency measurements.\n   *\n   * @async\n   * @param {PeerId} to - The peer that should receive a message\n   * @param {Message} msg - The message to send.\n   */\n  async sendRequest (to, msg) {\n    // TODO: record latency\n    if (!this.isConnected) {\n      throw errcode(new Error('Network is offline'), 'ERR_NETWORK_OFFLINE')\n    }\n\n    const id = to.toB58String()\n    this._log('sending to: %s', id)\n\n    let conn = this.dht.registrar.connectionManager.get(to)\n    if (!conn) {\n      conn = await this.dht.dialer.connectToPeer(to)\n    }\n\n    const { stream } = await conn.newStream(this.dht.protocol)\n\n    return this._writeReadMessage(stream, msg.serialize())\n  }\n\n  /**\n   * Sends a message without expecting an answer.\n   *\n   * @param {PeerId} to\n   * @param {Message} msg\n   */\n  async sendMessage (to, msg) {\n    if (!this.isConnected) {\n      throw errcode(new Error('Network is offline'), 'ERR_NETWORK_OFFLINE')\n    }\n\n    const id = to.toB58String()\n    this._log('sending to: %s', id)\n\n    let conn = this.dht.registrar.connectionManager.get(to)\n    if (!conn) {\n      conn = await this.dht.dialer.connectToPeer(to)\n    }\n    const { stream } = await conn.newStream(this.dht.protocol)\n\n    return this._writeMessage(stream, msg.serialize())\n  }\n\n  /**\n   * Write a message and read its response.\n   * If no response is received after the specified timeout\n   * this will error out.\n   *\n   * @param {MuxedStream} stream - the stream to use\n   * @param {Uint8Array} msg - the message to send\n   */\n  async _writeReadMessage (stream, msg) { // eslint-disable-line require-await\n    return pTimeout(\n      writeReadMessage(stream, msg),\n      this.readMessageTimeout\n    )\n  }\n\n  /**\n   * Write a message to the given stream.\n   *\n   * @param {MuxedStream} stream - the stream to use\n   * @param {Uint8Array} msg - the message to send\n   */\n  _writeMessage (stream, msg) {\n    return pipe(\n      [msg],\n      lp.encode(),\n      stream,\n      consume\n    )\n  }\n}\n\n/**\n * @param {MuxedStream} stream\n * @param {Uint8Array} msg\n */\nasync function writeReadMessage (stream, msg) {\n  const res = await pipe(\n    [msg],\n    lp.encode(),\n    stream,\n    lp.decode(),\n    /**\n     * @param {AsyncIterable<Uint8Array>} source\n     */\n    async source => {\n      const buf = await first(source)\n\n      if (buf) {\n        return buf.slice()\n      }\n    }\n  )\n\n  if (res.length === 0) {\n    throw errcode(new Error('No message received'), 'ERR_NO_MESSAGE_RECEIVED')\n  }\n\n  return Message.deserialize(res)\n}\n\nmodule.exports = Network\n","'use strict';\n\nclass TimeoutError extends Error {\n\tconstructor(message) {\n\t\tsuper(message);\n\t\tthis.name = 'TimeoutError';\n\t}\n}\n\nconst pTimeout = (promise, milliseconds, fallback, options) => {\n\tlet timer;\n\tconst cancelablePromise = new Promise((resolve, reject) => {\n\t\tif (typeof milliseconds !== 'number' || milliseconds < 0) {\n\t\t\tthrow new TypeError('Expected `milliseconds` to be a positive number');\n\t\t}\n\n\t\tif (milliseconds === Infinity) {\n\t\t\tresolve(promise);\n\t\t\treturn;\n\t\t}\n\n\t\toptions = {\n\t\t\tcustomTimers: {setTimeout, clearTimeout},\n\t\t\t...options\n\t\t};\n\n\t\ttimer = options.customTimers.setTimeout.call(undefined, () => {\n\t\t\tif (typeof fallback === 'function') {\n\t\t\t\ttry {\n\t\t\t\t\tresolve(fallback());\n\t\t\t\t} catch (error) {\n\t\t\t\t\treject(error);\n\t\t\t\t}\n\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst message = typeof fallback === 'string' ? fallback : `Promise timed out after ${milliseconds} milliseconds`;\n\t\t\tconst timeoutError = fallback instanceof Error ? fallback : new TimeoutError(message);\n\n\t\t\tif (typeof promise.cancel === 'function') {\n\t\t\t\tpromise.cancel();\n\t\t\t}\n\n\t\t\treject(timeoutError);\n\t\t}, milliseconds);\n\n\t\t(async () => {\n\t\t\ttry {\n\t\t\t\tresolve(await promise);\n\t\t\t} catch (error) {\n\t\t\t\treject(error);\n\t\t\t} finally {\n\t\t\t\toptions.customTimers.clearTimeout.call(undefined, timer);\n\t\t\t}\n\t\t})();\n\t});\n\n\tcancelablePromise.clear = () => {\n\t\tclearTimeout(timer);\n\t\ttimer = undefined;\n\t};\n\n\treturn cancelablePromise;\n};\n\nmodule.exports = pTimeout;\n// TODO: Remove this for the next major release\nmodule.exports.default = pTimeout;\n\nmodule.exports.TimeoutError = TimeoutError;\n","'use strict'\n\nconst { pipe } = require('it-pipe')\nconst lp = require('it-length-prefixed')\n\nconst Message = require('../message')\nconst handlers = require('./handlers')\nconst utils = require('../utils')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n */\n\n/**\n * @param {import('../index')} dht\n */\nmodule.exports = (dht) => {\n  const log = utils.logger(dht.peerId, 'rpc')\n  const getMessageHandler = handlers(dht)\n\n  /**\n   * Process incoming DHT messages.\n   *\n   * @param {PeerId} peerId\n   * @param {Message} msg\n   */\n  async function handleMessage (peerId, msg) {\n    // get handler & execute it\n    const handler = getMessageHandler(msg.type)\n\n    try {\n      await dht._add(peerId)\n    } catch (err) {\n      log.error('Failed to update the kbucket store', err)\n    }\n\n    if (!handler) {\n      log.error(`no handler found for message type: ${msg.type}`)\n      return\n    }\n\n    return handler(peerId, msg)\n  }\n\n  /**\n   * Handle incoming streams on the dht protocol\n   *\n   * @param {object} props\n   * @param {MuxedStream} props.stream\n   * @param {import('libp2p-interfaces/src/connection').Connection} props.connection\n   */\n  async function onIncomingStream ({ stream, connection }) {\n    const peerId = connection.remotePeer\n\n    try {\n      await dht._add(peerId)\n    } catch (err) {\n      log.error(err)\n    }\n\n    const idB58Str = peerId.toB58String()\n    log('from: %s', idB58Str)\n\n    await pipe(\n      stream.source,\n      lp.decode(),\n      /**\n       * @param {AsyncIterable<Uint8Array>} source\n       */\n      source => (async function * () {\n        for await (const msg of source) {\n          // handle the message\n          const desMessage = Message.deserialize(msg.slice())\n          const res = await handleMessage(peerId, desMessage)\n\n          // Not all handlers will return a response\n          if (res) {\n            yield res.serialize()\n          }\n        }\n      })(),\n      lp.encode(),\n      stream.sink\n    )\n  }\n\n  return onIncomingStream\n}\n","'use strict'\n\nconst PeerId = require('peer-id')\nconst { Multiaddr } = require('multiaddr')\nconst { Record } = require('libp2p-record')\nconst Proto = require('./dht')\n\nconst MESSAGE_TYPE = Proto.Message.MessageType\nconst CONNECTION_TYPE = Proto.Message.ConnectionType\n\n/**\n * @typedef {0|1|2|3|4} ConnectionType\n *\n * @typedef {object} PBPeer\n * @property {Uint8Array} id\n * @property {Uint8Array[]} addrs\n * @property {ConnectionType} connection\n *\n * @typedef {import('../index').PeerData} PeerData\n */\n\n/**\n * Represents a single DHT control message.\n */\nclass Message {\n  /**\n   * @param {import('./dht').Message.MessageType} type\n   * @param {Uint8Array} key\n   * @param {number} level\n   */\n  constructor (type, key, level) {\n    if (key && !(key instanceof Uint8Array)) {\n      throw new Error('Key must be a Uint8Array')\n    }\n\n    this.type = type\n    this.key = key\n    this._clusterLevelRaw = level\n\n    /** @type {PeerData[]} */\n    this.closerPeers = []\n    /** @type {PeerData[]} */\n    this.providerPeers = []\n    /** @type {import('libp2p-record').Record | undefined} */\n    this.record = undefined\n  }\n\n  /**\n   * @type {number}\n   */\n  get clusterLevel () {\n    const level = this._clusterLevelRaw - 1\n    if (level < 0) {\n      return 0\n    }\n\n    return level\n  }\n\n  set clusterLevel (level) {\n    this._clusterLevelRaw = level\n  }\n\n  /**\n   * Encode into protobuf\n   */\n  serialize () {\n    const obj = {\n      key: this.key,\n      type: this.type,\n      clusterLevelRaw: this._clusterLevelRaw,\n      closerPeers: this.closerPeers.map(toPbPeer),\n      providerPeers: this.providerPeers.map(toPbPeer),\n\n      /** @type {Uint8Array | undefined} */\n      record: undefined\n    }\n\n    if (this.record) {\n      if (this.record instanceof Uint8Array) {\n        obj.record = this.record\n      } else {\n        obj.record = this.record.serialize()\n      }\n    }\n\n    return Proto.Message.encode(obj).finish()\n  }\n\n  /**\n   * Decode from protobuf\n   *\n   * @param {Uint8Array} raw\n   */\n  static deserialize (raw) {\n    const dec = Proto.Message.decode(raw)\n\n    const msg = new Message(dec.type, dec.key, dec.clusterLevelRaw)\n\n    msg.closerPeers = dec.closerPeers.map(fromPbPeer)\n    msg.providerPeers = dec.providerPeers.map(fromPbPeer)\n\n    if (dec.record && dec.record.length) {\n      msg.record = Record.deserialize(dec.record)\n    }\n\n    return msg\n  }\n}\n\nMessage.TYPES = MESSAGE_TYPE\nMessage.CONNECTION_TYPES = CONNECTION_TYPE\n\n/**\n * @param {PeerData} peer\n */\nfunction toPbPeer (peer) {\n  /** @type {PBPeer} */\n  const output = {\n    id: peer.id.id,\n    addrs: (peer.multiaddrs || []).map((m) => m.bytes),\n    connection: CONNECTION_TYPE.CONNECTED\n  }\n\n  return output\n}\n\n/**\n * @param {import('./dht').Message.IPeer} peer\n */\nfunction fromPbPeer (peer) {\n  return {\n    // @ts-ignore id is optional on protobuf, but it will exist?\n    id: new PeerId(peer.id),\n    multiaddrs: (peer.addrs || []).map((a) => new Multiaddr(a))\n  }\n}\n\nmodule.exports = Message\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"libp2p-dht-message\"] || ($protobuf.roots[\"libp2p-dht-message\"] = {});\n\n$root.Record = (function() {\n\n    /**\n     * Properties of a Record.\n     * @exports IRecord\n     * @interface IRecord\n     * @property {Uint8Array|null} [key] Record key\n     * @property {Uint8Array|null} [value] Record value\n     * @property {Uint8Array|null} [author] Record author\n     * @property {Uint8Array|null} [signature] Record signature\n     * @property {string|null} [timeReceived] Record timeReceived\n     */\n\n    /**\n     * Constructs a new Record.\n     * @exports Record\n     * @classdesc Represents a Record.\n     * @implements IRecord\n     * @constructor\n     * @param {IRecord=} [p] Properties to set\n     */\n    function Record(p) {\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * Record key.\n     * @member {Uint8Array} key\n     * @memberof Record\n     * @instance\n     */\n    Record.prototype.key = $util.newBuffer([]);\n\n    /**\n     * Record value.\n     * @member {Uint8Array} value\n     * @memberof Record\n     * @instance\n     */\n    Record.prototype.value = $util.newBuffer([]);\n\n    /**\n     * Record author.\n     * @member {Uint8Array} author\n     * @memberof Record\n     * @instance\n     */\n    Record.prototype.author = $util.newBuffer([]);\n\n    /**\n     * Record signature.\n     * @member {Uint8Array} signature\n     * @memberof Record\n     * @instance\n     */\n    Record.prototype.signature = $util.newBuffer([]);\n\n    /**\n     * Record timeReceived.\n     * @member {string} timeReceived\n     * @memberof Record\n     * @instance\n     */\n    Record.prototype.timeReceived = \"\";\n\n    /**\n     * Encodes the specified Record message. Does not implicitly {@link Record.verify|verify} messages.\n     * @function encode\n     * @memberof Record\n     * @static\n     * @param {IRecord} m Record message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    Record.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.key != null && Object.hasOwnProperty.call(m, \"key\"))\n            w.uint32(10).bytes(m.key);\n        if (m.value != null && Object.hasOwnProperty.call(m, \"value\"))\n            w.uint32(18).bytes(m.value);\n        if (m.author != null && Object.hasOwnProperty.call(m, \"author\"))\n            w.uint32(26).bytes(m.author);\n        if (m.signature != null && Object.hasOwnProperty.call(m, \"signature\"))\n            w.uint32(34).bytes(m.signature);\n        if (m.timeReceived != null && Object.hasOwnProperty.call(m, \"timeReceived\"))\n            w.uint32(42).string(m.timeReceived);\n        return w;\n    };\n\n    /**\n     * Decodes a Record message from the specified reader or buffer.\n     * @function decode\n     * @memberof Record\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {Record} Record\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    Record.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.Record();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.key = r.bytes();\n                break;\n            case 2:\n                m.value = r.bytes();\n                break;\n            case 3:\n                m.author = r.bytes();\n                break;\n            case 4:\n                m.signature = r.bytes();\n                break;\n            case 5:\n                m.timeReceived = r.string();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a Record message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof Record\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {Record} Record\n     */\n    Record.fromObject = function fromObject(d) {\n        if (d instanceof $root.Record)\n            return d;\n        var m = new $root.Record();\n        if (d.key != null) {\n            if (typeof d.key === \"string\")\n                $util.base64.decode(d.key, m.key = $util.newBuffer($util.base64.length(d.key)), 0);\n            else if (d.key.length)\n                m.key = d.key;\n        }\n        if (d.value != null) {\n            if (typeof d.value === \"string\")\n                $util.base64.decode(d.value, m.value = $util.newBuffer($util.base64.length(d.value)), 0);\n            else if (d.value.length)\n                m.value = d.value;\n        }\n        if (d.author != null) {\n            if (typeof d.author === \"string\")\n                $util.base64.decode(d.author, m.author = $util.newBuffer($util.base64.length(d.author)), 0);\n            else if (d.author.length)\n                m.author = d.author;\n        }\n        if (d.signature != null) {\n            if (typeof d.signature === \"string\")\n                $util.base64.decode(d.signature, m.signature = $util.newBuffer($util.base64.length(d.signature)), 0);\n            else if (d.signature.length)\n                m.signature = d.signature;\n        }\n        if (d.timeReceived != null) {\n            m.timeReceived = String(d.timeReceived);\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a Record message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof Record\n     * @static\n     * @param {Record} m Record\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    Record.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.defaults) {\n            if (o.bytes === String)\n                d.key = \"\";\n            else {\n                d.key = [];\n                if (o.bytes !== Array)\n                    d.key = $util.newBuffer(d.key);\n            }\n            if (o.bytes === String)\n                d.value = \"\";\n            else {\n                d.value = [];\n                if (o.bytes !== Array)\n                    d.value = $util.newBuffer(d.value);\n            }\n            if (o.bytes === String)\n                d.author = \"\";\n            else {\n                d.author = [];\n                if (o.bytes !== Array)\n                    d.author = $util.newBuffer(d.author);\n            }\n            if (o.bytes === String)\n                d.signature = \"\";\n            else {\n                d.signature = [];\n                if (o.bytes !== Array)\n                    d.signature = $util.newBuffer(d.signature);\n            }\n            d.timeReceived = \"\";\n        }\n        if (m.key != null && m.hasOwnProperty(\"key\")) {\n            d.key = o.bytes === String ? $util.base64.encode(m.key, 0, m.key.length) : o.bytes === Array ? Array.prototype.slice.call(m.key) : m.key;\n        }\n        if (m.value != null && m.hasOwnProperty(\"value\")) {\n            d.value = o.bytes === String ? $util.base64.encode(m.value, 0, m.value.length) : o.bytes === Array ? Array.prototype.slice.call(m.value) : m.value;\n        }\n        if (m.author != null && m.hasOwnProperty(\"author\")) {\n            d.author = o.bytes === String ? $util.base64.encode(m.author, 0, m.author.length) : o.bytes === Array ? Array.prototype.slice.call(m.author) : m.author;\n        }\n        if (m.signature != null && m.hasOwnProperty(\"signature\")) {\n            d.signature = o.bytes === String ? $util.base64.encode(m.signature, 0, m.signature.length) : o.bytes === Array ? Array.prototype.slice.call(m.signature) : m.signature;\n        }\n        if (m.timeReceived != null && m.hasOwnProperty(\"timeReceived\")) {\n            d.timeReceived = m.timeReceived;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this Record to JSON.\n     * @function toJSON\n     * @memberof Record\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    Record.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    return Record;\n})();\n\n$root.Message = (function() {\n\n    /**\n     * Properties of a Message.\n     * @exports IMessage\n     * @interface IMessage\n     * @property {Message.MessageType|null} [type] Message type\n     * @property {number|null} [clusterLevelRaw] Message clusterLevelRaw\n     * @property {Uint8Array|null} [key] Message key\n     * @property {Uint8Array|null} [record] Message record\n     * @property {Array.<Message.IPeer>|null} [closerPeers] Message closerPeers\n     * @property {Array.<Message.IPeer>|null} [providerPeers] Message providerPeers\n     */\n\n    /**\n     * Constructs a new Message.\n     * @exports Message\n     * @classdesc Represents a Message.\n     * @implements IMessage\n     * @constructor\n     * @param {IMessage=} [p] Properties to set\n     */\n    function Message(p) {\n        this.closerPeers = [];\n        this.providerPeers = [];\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * Message type.\n     * @member {Message.MessageType} type\n     * @memberof Message\n     * @instance\n     */\n    Message.prototype.type = 0;\n\n    /**\n     * Message clusterLevelRaw.\n     * @member {number} clusterLevelRaw\n     * @memberof Message\n     * @instance\n     */\n    Message.prototype.clusterLevelRaw = 0;\n\n    /**\n     * Message key.\n     * @member {Uint8Array} key\n     * @memberof Message\n     * @instance\n     */\n    Message.prototype.key = $util.newBuffer([]);\n\n    /**\n     * Message record.\n     * @member {Uint8Array} record\n     * @memberof Message\n     * @instance\n     */\n    Message.prototype.record = $util.newBuffer([]);\n\n    /**\n     * Message closerPeers.\n     * @member {Array.<Message.IPeer>} closerPeers\n     * @memberof Message\n     * @instance\n     */\n    Message.prototype.closerPeers = $util.emptyArray;\n\n    /**\n     * Message providerPeers.\n     * @member {Array.<Message.IPeer>} providerPeers\n     * @memberof Message\n     * @instance\n     */\n    Message.prototype.providerPeers = $util.emptyArray;\n\n    /**\n     * Encodes the specified Message message. Does not implicitly {@link Message.verify|verify} messages.\n     * @function encode\n     * @memberof Message\n     * @static\n     * @param {IMessage} m Message message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    Message.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.type != null && Object.hasOwnProperty.call(m, \"type\"))\n            w.uint32(8).int32(m.type);\n        if (m.key != null && Object.hasOwnProperty.call(m, \"key\"))\n            w.uint32(18).bytes(m.key);\n        if (m.record != null && Object.hasOwnProperty.call(m, \"record\"))\n            w.uint32(26).bytes(m.record);\n        if (m.closerPeers != null && m.closerPeers.length) {\n            for (var i = 0; i < m.closerPeers.length; ++i)\n                $root.Message.Peer.encode(m.closerPeers[i], w.uint32(66).fork()).ldelim();\n        }\n        if (m.providerPeers != null && m.providerPeers.length) {\n            for (var i = 0; i < m.providerPeers.length; ++i)\n                $root.Message.Peer.encode(m.providerPeers[i], w.uint32(74).fork()).ldelim();\n        }\n        if (m.clusterLevelRaw != null && Object.hasOwnProperty.call(m, \"clusterLevelRaw\"))\n            w.uint32(80).int32(m.clusterLevelRaw);\n        return w;\n    };\n\n    /**\n     * Decodes a Message message from the specified reader or buffer.\n     * @function decode\n     * @memberof Message\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {Message} Message\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    Message.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.Message();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.type = r.int32();\n                break;\n            case 10:\n                m.clusterLevelRaw = r.int32();\n                break;\n            case 2:\n                m.key = r.bytes();\n                break;\n            case 3:\n                m.record = r.bytes();\n                break;\n            case 8:\n                if (!(m.closerPeers && m.closerPeers.length))\n                    m.closerPeers = [];\n                m.closerPeers.push($root.Message.Peer.decode(r, r.uint32()));\n                break;\n            case 9:\n                if (!(m.providerPeers && m.providerPeers.length))\n                    m.providerPeers = [];\n                m.providerPeers.push($root.Message.Peer.decode(r, r.uint32()));\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a Message message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof Message\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {Message} Message\n     */\n    Message.fromObject = function fromObject(d) {\n        if (d instanceof $root.Message)\n            return d;\n        var m = new $root.Message();\n        switch (d.type) {\n        case \"PUT_VALUE\":\n        case 0:\n            m.type = 0;\n            break;\n        case \"GET_VALUE\":\n        case 1:\n            m.type = 1;\n            break;\n        case \"ADD_PROVIDER\":\n        case 2:\n            m.type = 2;\n            break;\n        case \"GET_PROVIDERS\":\n        case 3:\n            m.type = 3;\n            break;\n        case \"FIND_NODE\":\n        case 4:\n            m.type = 4;\n            break;\n        case \"PING\":\n        case 5:\n            m.type = 5;\n            break;\n        }\n        if (d.clusterLevelRaw != null) {\n            m.clusterLevelRaw = d.clusterLevelRaw | 0;\n        }\n        if (d.key != null) {\n            if (typeof d.key === \"string\")\n                $util.base64.decode(d.key, m.key = $util.newBuffer($util.base64.length(d.key)), 0);\n            else if (d.key.length)\n                m.key = d.key;\n        }\n        if (d.record != null) {\n            if (typeof d.record === \"string\")\n                $util.base64.decode(d.record, m.record = $util.newBuffer($util.base64.length(d.record)), 0);\n            else if (d.record.length)\n                m.record = d.record;\n        }\n        if (d.closerPeers) {\n            if (!Array.isArray(d.closerPeers))\n                throw TypeError(\".Message.closerPeers: array expected\");\n            m.closerPeers = [];\n            for (var i = 0; i < d.closerPeers.length; ++i) {\n                if (typeof d.closerPeers[i] !== \"object\")\n                    throw TypeError(\".Message.closerPeers: object expected\");\n                m.closerPeers[i] = $root.Message.Peer.fromObject(d.closerPeers[i]);\n            }\n        }\n        if (d.providerPeers) {\n            if (!Array.isArray(d.providerPeers))\n                throw TypeError(\".Message.providerPeers: array expected\");\n            m.providerPeers = [];\n            for (var i = 0; i < d.providerPeers.length; ++i) {\n                if (typeof d.providerPeers[i] !== \"object\")\n                    throw TypeError(\".Message.providerPeers: object expected\");\n                m.providerPeers[i] = $root.Message.Peer.fromObject(d.providerPeers[i]);\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a Message message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof Message\n     * @static\n     * @param {Message} m Message\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    Message.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.arrays || o.defaults) {\n            d.closerPeers = [];\n            d.providerPeers = [];\n        }\n        if (o.defaults) {\n            d.type = o.enums === String ? \"PUT_VALUE\" : 0;\n            if (o.bytes === String)\n                d.key = \"\";\n            else {\n                d.key = [];\n                if (o.bytes !== Array)\n                    d.key = $util.newBuffer(d.key);\n            }\n            if (o.bytes === String)\n                d.record = \"\";\n            else {\n                d.record = [];\n                if (o.bytes !== Array)\n                    d.record = $util.newBuffer(d.record);\n            }\n            d.clusterLevelRaw = 0;\n        }\n        if (m.type != null && m.hasOwnProperty(\"type\")) {\n            d.type = o.enums === String ? $root.Message.MessageType[m.type] : m.type;\n        }\n        if (m.key != null && m.hasOwnProperty(\"key\")) {\n            d.key = o.bytes === String ? $util.base64.encode(m.key, 0, m.key.length) : o.bytes === Array ? Array.prototype.slice.call(m.key) : m.key;\n        }\n        if (m.record != null && m.hasOwnProperty(\"record\")) {\n            d.record = o.bytes === String ? $util.base64.encode(m.record, 0, m.record.length) : o.bytes === Array ? Array.prototype.slice.call(m.record) : m.record;\n        }\n        if (m.closerPeers && m.closerPeers.length) {\n            d.closerPeers = [];\n            for (var j = 0; j < m.closerPeers.length; ++j) {\n                d.closerPeers[j] = $root.Message.Peer.toObject(m.closerPeers[j], o);\n            }\n        }\n        if (m.providerPeers && m.providerPeers.length) {\n            d.providerPeers = [];\n            for (var j = 0; j < m.providerPeers.length; ++j) {\n                d.providerPeers[j] = $root.Message.Peer.toObject(m.providerPeers[j], o);\n            }\n        }\n        if (m.clusterLevelRaw != null && m.hasOwnProperty(\"clusterLevelRaw\")) {\n            d.clusterLevelRaw = m.clusterLevelRaw;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this Message to JSON.\n     * @function toJSON\n     * @memberof Message\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    Message.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    /**\n     * MessageType enum.\n     * @name Message.MessageType\n     * @enum {number}\n     * @property {number} PUT_VALUE=0 PUT_VALUE value\n     * @property {number} GET_VALUE=1 GET_VALUE value\n     * @property {number} ADD_PROVIDER=2 ADD_PROVIDER value\n     * @property {number} GET_PROVIDERS=3 GET_PROVIDERS value\n     * @property {number} FIND_NODE=4 FIND_NODE value\n     * @property {number} PING=5 PING value\n     */\n    Message.MessageType = (function() {\n        var valuesById = {}, values = Object.create(valuesById);\n        values[valuesById[0] = \"PUT_VALUE\"] = 0;\n        values[valuesById[1] = \"GET_VALUE\"] = 1;\n        values[valuesById[2] = \"ADD_PROVIDER\"] = 2;\n        values[valuesById[3] = \"GET_PROVIDERS\"] = 3;\n        values[valuesById[4] = \"FIND_NODE\"] = 4;\n        values[valuesById[5] = \"PING\"] = 5;\n        return values;\n    })();\n\n    /**\n     * ConnectionType enum.\n     * @name Message.ConnectionType\n     * @enum {number}\n     * @property {number} NOT_CONNECTED=0 NOT_CONNECTED value\n     * @property {number} CONNECTED=1 CONNECTED value\n     * @property {number} CAN_CONNECT=2 CAN_CONNECT value\n     * @property {number} CANNOT_CONNECT=3 CANNOT_CONNECT value\n     */\n    Message.ConnectionType = (function() {\n        var valuesById = {}, values = Object.create(valuesById);\n        values[valuesById[0] = \"NOT_CONNECTED\"] = 0;\n        values[valuesById[1] = \"CONNECTED\"] = 1;\n        values[valuesById[2] = \"CAN_CONNECT\"] = 2;\n        values[valuesById[3] = \"CANNOT_CONNECT\"] = 3;\n        return values;\n    })();\n\n    Message.Peer = (function() {\n\n        /**\n         * Properties of a Peer.\n         * @memberof Message\n         * @interface IPeer\n         * @property {Uint8Array|null} [id] Peer id\n         * @property {Array.<Uint8Array>|null} [addrs] Peer addrs\n         * @property {Message.ConnectionType|null} [connection] Peer connection\n         */\n\n        /**\n         * Constructs a new Peer.\n         * @memberof Message\n         * @classdesc Represents a Peer.\n         * @implements IPeer\n         * @constructor\n         * @param {Message.IPeer=} [p] Properties to set\n         */\n        function Peer(p) {\n            this.addrs = [];\n            if (p)\n                for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                    if (p[ks[i]] != null)\n                        this[ks[i]] = p[ks[i]];\n        }\n\n        /**\n         * Peer id.\n         * @member {Uint8Array} id\n         * @memberof Message.Peer\n         * @instance\n         */\n        Peer.prototype.id = $util.newBuffer([]);\n\n        /**\n         * Peer addrs.\n         * @member {Array.<Uint8Array>} addrs\n         * @memberof Message.Peer\n         * @instance\n         */\n        Peer.prototype.addrs = $util.emptyArray;\n\n        /**\n         * Peer connection.\n         * @member {Message.ConnectionType} connection\n         * @memberof Message.Peer\n         * @instance\n         */\n        Peer.prototype.connection = 0;\n\n        /**\n         * Encodes the specified Peer message. Does not implicitly {@link Message.Peer.verify|verify} messages.\n         * @function encode\n         * @memberof Message.Peer\n         * @static\n         * @param {Message.IPeer} m Peer message or plain object to encode\n         * @param {$protobuf.Writer} [w] Writer to encode to\n         * @returns {$protobuf.Writer} Writer\n         */\n        Peer.encode = function encode(m, w) {\n            if (!w)\n                w = $Writer.create();\n            if (m.id != null && Object.hasOwnProperty.call(m, \"id\"))\n                w.uint32(10).bytes(m.id);\n            if (m.addrs != null && m.addrs.length) {\n                for (var i = 0; i < m.addrs.length; ++i)\n                    w.uint32(18).bytes(m.addrs[i]);\n            }\n            if (m.connection != null && Object.hasOwnProperty.call(m, \"connection\"))\n                w.uint32(24).int32(m.connection);\n            return w;\n        };\n\n        /**\n         * Decodes a Peer message from the specified reader or buffer.\n         * @function decode\n         * @memberof Message.Peer\n         * @static\n         * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n         * @param {number} [l] Message length if known beforehand\n         * @returns {Message.Peer} Peer\n         * @throws {Error} If the payload is not a reader or valid buffer\n         * @throws {$protobuf.util.ProtocolError} If required fields are missing\n         */\n        Peer.decode = function decode(r, l) {\n            if (!(r instanceof $Reader))\n                r = $Reader.create(r);\n            var c = l === undefined ? r.len : r.pos + l, m = new $root.Message.Peer();\n            while (r.pos < c) {\n                var t = r.uint32();\n                switch (t >>> 3) {\n                case 1:\n                    m.id = r.bytes();\n                    break;\n                case 2:\n                    if (!(m.addrs && m.addrs.length))\n                        m.addrs = [];\n                    m.addrs.push(r.bytes());\n                    break;\n                case 3:\n                    m.connection = r.int32();\n                    break;\n                default:\n                    r.skipType(t & 7);\n                    break;\n                }\n            }\n            return m;\n        };\n\n        /**\n         * Creates a Peer message from a plain object. Also converts values to their respective internal types.\n         * @function fromObject\n         * @memberof Message.Peer\n         * @static\n         * @param {Object.<string,*>} d Plain object\n         * @returns {Message.Peer} Peer\n         */\n        Peer.fromObject = function fromObject(d) {\n            if (d instanceof $root.Message.Peer)\n                return d;\n            var m = new $root.Message.Peer();\n            if (d.id != null) {\n                if (typeof d.id === \"string\")\n                    $util.base64.decode(d.id, m.id = $util.newBuffer($util.base64.length(d.id)), 0);\n                else if (d.id.length)\n                    m.id = d.id;\n            }\n            if (d.addrs) {\n                if (!Array.isArray(d.addrs))\n                    throw TypeError(\".Message.Peer.addrs: array expected\");\n                m.addrs = [];\n                for (var i = 0; i < d.addrs.length; ++i) {\n                    if (typeof d.addrs[i] === \"string\")\n                        $util.base64.decode(d.addrs[i], m.addrs[i] = $util.newBuffer($util.base64.length(d.addrs[i])), 0);\n                    else if (d.addrs[i].length)\n                        m.addrs[i] = d.addrs[i];\n                }\n            }\n            switch (d.connection) {\n            case \"NOT_CONNECTED\":\n            case 0:\n                m.connection = 0;\n                break;\n            case \"CONNECTED\":\n            case 1:\n                m.connection = 1;\n                break;\n            case \"CAN_CONNECT\":\n            case 2:\n                m.connection = 2;\n                break;\n            case \"CANNOT_CONNECT\":\n            case 3:\n                m.connection = 3;\n                break;\n            }\n            return m;\n        };\n\n        /**\n         * Creates a plain object from a Peer message. Also converts values to other types if specified.\n         * @function toObject\n         * @memberof Message.Peer\n         * @static\n         * @param {Message.Peer} m Peer\n         * @param {$protobuf.IConversionOptions} [o] Conversion options\n         * @returns {Object.<string,*>} Plain object\n         */\n        Peer.toObject = function toObject(m, o) {\n            if (!o)\n                o = {};\n            var d = {};\n            if (o.arrays || o.defaults) {\n                d.addrs = [];\n            }\n            if (o.defaults) {\n                if (o.bytes === String)\n                    d.id = \"\";\n                else {\n                    d.id = [];\n                    if (o.bytes !== Array)\n                        d.id = $util.newBuffer(d.id);\n                }\n                d.connection = o.enums === String ? \"NOT_CONNECTED\" : 0;\n            }\n            if (m.id != null && m.hasOwnProperty(\"id\")) {\n                d.id = o.bytes === String ? $util.base64.encode(m.id, 0, m.id.length) : o.bytes === Array ? Array.prototype.slice.call(m.id) : m.id;\n            }\n            if (m.addrs && m.addrs.length) {\n                d.addrs = [];\n                for (var j = 0; j < m.addrs.length; ++j) {\n                    d.addrs[j] = o.bytes === String ? $util.base64.encode(m.addrs[j], 0, m.addrs[j].length) : o.bytes === Array ? Array.prototype.slice.call(m.addrs[j]) : m.addrs[j];\n                }\n            }\n            if (m.connection != null && m.hasOwnProperty(\"connection\")) {\n                d.connection = o.enums === String ? $root.Message.ConnectionType[m.connection] : m.connection;\n            }\n            return d;\n        };\n\n        /**\n         * Converts this Peer to JSON.\n         * @function toJSON\n         * @memberof Message.Peer\n         * @instance\n         * @returns {Object.<string,*>} JSON object\n         */\n        Peer.prototype.toJSON = function toJSON() {\n            return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n        };\n\n        return Peer;\n    })();\n\n    return Message;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\nconst T = require('../../message').TYPES\n\n/**\n *\n * @param {import('../../index')} dht\n */\nmodule.exports = (dht) => {\n  const handlers = {\n    [T.GET_VALUE]: require('./get-value')(dht),\n    [T.PUT_VALUE]: require('./put-value')(dht),\n    [T.FIND_NODE]: require('./find-node')(dht),\n    [T.ADD_PROVIDER]: require('./add-provider')(dht),\n    [T.GET_PROVIDERS]: require('./get-providers')(dht),\n    [T.PING]: require('./ping')(dht)\n  }\n\n  /**\n   * Get the message handler matching the passed in type.\n   *\n   * @param {number} type\n   */\n  function getMessageHandler (type) {\n    // @ts-ignore ts does not aknowledge number as an index type\n    return handlers[type]\n  }\n\n  return getMessageHandler\n}\n","'use strict'\n\nconst { Record } = require('libp2p-record')\n\nconst errcode = require('err-code')\n\nconst Message = require('../../message')\nconst utils = require('../../utils')\n\n/**\n * @typedef {import('peer-id')} PeerId\n */\n\n/**\n * @param {import('../../index')} dht\n */\nmodule.exports = (dht) => {\n  const log = utils.logger(dht.peerId, 'rpc:get-value')\n\n  /**\n   * Process `GetValue` DHT messages.\n   *\n   * @param {PeerId} peerId\n   * @param {Message} msg\n   * @returns {Promise<Message>}\n   */\n  async function getValue (peerId, msg) {\n    const key = msg.key\n\n    log('key: %b', key)\n\n    if (!key || key.length === 0) {\n      throw errcode(new Error('Invalid key'), 'ERR_INVALID_KEY')\n    }\n\n    const response = new Message(Message.TYPES.GET_VALUE, key, msg.clusterLevel)\n\n    if (utils.isPublicKeyKey(key)) {\n      log('is public key')\n      const idFromKey = utils.fromPublicKeyKey(key)\n      let id\n\n      if (dht._isSelf(idFromKey)) {\n        id = dht.peerId\n      } else {\n        const peerData = dht.peerStore.get(idFromKey)\n        id = peerData && peerData.id\n      }\n\n      if (id && id.pubKey) {\n        log('returning found public key')\n        response.record = new Record(key, id.pubKey.bytes)\n        return response\n      }\n    }\n\n    const [record, closer] = await Promise.all([\n      dht._checkLocalDatastore(key),\n      dht._betterPeersToQuery(msg, peerId)\n    ])\n\n    if (record) {\n      log('got record')\n      response.record = record\n    }\n\n    if (closer.length > 0) {\n      log('got closer %s', closer.length)\n      response.closerPeers = closer\n    }\n\n    return response\n  }\n\n  return getValue\n}\n","'use strict'\n\nconst utils = require('../../utils')\nconst errcode = require('err-code')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('../../message')} Message\n */\n\n/**\n * @param {import('../../index')} dht\n */\nmodule.exports = (dht) => {\n  const log = utils.logger(dht.peerId, 'rpc:put-value')\n\n  /**\n   * Process `PutValue` DHT messages.\n   *\n   * @param {PeerId} peerId\n   * @param {Message} msg\n   */\n  async function putValue (peerId, msg) {\n    const key = msg.key\n    log('key: %b', key)\n\n    const record = msg.record\n\n    if (!record) {\n      const errMsg = `Empty record from: ${peerId.toB58String()}`\n\n      log.error(errMsg)\n      throw errcode(new Error(errMsg), 'ERR_EMPTY_RECORD')\n    }\n\n    await dht._verifyRecordLocally(record)\n\n    record.timeReceived = new Date()\n    const recordKey = utils.bufferToKey(record.key)\n    await dht.datastore.put(recordKey, record.serialize())\n\n    dht.onPut(record, peerId)\n\n    return msg\n  }\n\n  return putValue\n}\n","'use strict'\n\nconst uint8ArrayEquals = require('uint8arrays/equals')\nconst Message = require('../../message')\nconst utils = require('../../utils')\n\n/**\n * @typedef {import('peer-id')} PeerId\n */\n\n/**\n * @param {import('../../index')} dht\n */\nmodule.exports = (dht) => {\n  const log = utils.logger(dht.peerId, 'rpc:find-node')\n\n  /**\n   * Process `FindNode` DHT messages.\n   *\n   * @param {PeerId} peerId\n   * @param {Message} msg\n   */\n  async function findNode (peerId, msg) {\n    log('start')\n\n    let closer\n    if (uint8ArrayEquals(msg.key, dht.peerId.id)) {\n      closer = [{\n        id: dht.peerId,\n        multiaddrs: dht.libp2p.multiaddrs\n      }]\n    } else {\n      closer = await dht._betterPeersToQuery(msg, peerId)\n    }\n\n    const response = new Message(msg.type, new Uint8Array(0), msg.clusterLevel)\n\n    if (closer.length > 0) {\n      response.closerPeers = closer\n    } else {\n      log('handle FindNode %s: could not find anything', peerId.toB58String())\n    }\n\n    return response\n  }\n\n  return findNode\n}\n","'use strict'\n\nconst CID = require('cids')\nconst errcode = require('err-code')\n\nconst utils = require('../../utils')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('../../message')} Message\n */\n\n/**\n * @param {import('../../index')} dht\n */\nmodule.exports = (dht) => {\n  const log = utils.logger(dht.peerId, 'rpc:add-provider')\n  /**\n   * Process `AddProvider` DHT messages.\n   *\n   * @param {PeerId} peerId\n   * @param {Message} msg\n   */\n  async function addProvider (peerId, msg) { // eslint-disable-line require-await\n    log('start')\n\n    if (!msg.key || msg.key.length === 0) {\n      throw errcode(new Error('Missing key'), 'ERR_MISSING_KEY')\n    }\n\n    /** @type {CID} */\n    let cid\n    try {\n      cid = new CID(msg.key)\n    } catch (err) {\n      const errMsg = `Invalid CID: ${err.message}`\n      throw errcode(new Error(errMsg), 'ERR_INVALID_CID')\n    }\n\n    msg.providerPeers.forEach((pi) => {\n      // Ignore providers not from the originator\n      if (!pi.id.isEqual(peerId)) {\n        log('invalid provider peer %s from %s', pi.id.toB58String(), peerId.toB58String())\n        return\n      }\n\n      if (pi.multiaddrs.length < 1) {\n        log('no valid addresses for provider %s. Ignore', peerId.toB58String())\n        return\n      }\n\n      log('received provider %s for %s (addrs %s)', peerId.toB58String(), cid.toBaseEncodedString(), pi.multiaddrs.map((m) => m.toString()))\n\n      if (!dht._isSelf(pi.id)) {\n        // Add known address to peer store\n        dht.peerStore.addressBook.add(pi.id, pi.multiaddrs)\n        return dht.providers.addProvider(cid, pi.id)\n      }\n    })\n\n    // Previous versions of the JS DHT sent erroneous providers in the\n    // `providerPeers` field. In order to accommodate older clients that have\n    // this bug, we fall back to assuming the originator is the provider if\n    // we can't find any valid providers in the payload.\n    // https://github.com/libp2p/js-libp2p-kad-dht/pull/127\n    // https://github.com/libp2p/js-libp2p-kad-dht/issues/128\n    return dht.providers.addProvider(cid, peerId)\n  }\n\n  return addProvider\n}\n","'use strict'\n\nconst CID = require('cids')\nconst errcode = require('err-code')\n\nconst Message = require('../../message')\nconst utils = require('../../utils')\n\n/**\n * @typedef {import('peer-id')} PeerId\n */\n\n/**\n * @param {import('../../index')} dht\n */\nmodule.exports = (dht) => {\n  const log = utils.logger(dht.peerId, 'rpc:get-providers')\n\n  /**\n   * Process `GetProviders` DHT messages.\n   *\n   * @param {PeerId} peerId\n   * @param {Message} msg\n   */\n  async function getProviders (peerId, msg) {\n    let cid\n    try {\n      cid = new CID(msg.key)\n    } catch (err) {\n      throw errcode(new Error(`Invalid CID: ${err.message}`), 'ERR_INVALID_CID')\n    }\n\n    log('%s', cid.toBaseEncodedString())\n    const dsKey = utils.bufferToKey(cid.bytes)\n\n    const [has, peers, closer] = await Promise.all([\n      dht.datastore.has(dsKey),\n      dht.providers.getProviders(cid),\n      dht._betterPeersToQuery(msg, peerId)\n    ])\n\n    const providerPeers = peers.map((peerId) => ({\n      id: peerId,\n      multiaddrs: []\n    }))\n    const closerPeers = closer.map((c) => ({\n      id: c.id,\n      multiaddrs: []\n    }))\n\n    if (has) {\n      providerPeers.push({\n        id: dht.peerId,\n        multiaddrs: []\n      })\n    }\n\n    const response = new Message(msg.type, msg.key, msg.clusterLevel)\n\n    if (providerPeers.length > 0) {\n      response.providerPeers = providerPeers\n    }\n\n    if (closerPeers.length > 0) {\n      response.closerPeers = closerPeers\n    }\n\n    log('got %s providers %s closerPeers', providerPeers.length, closerPeers.length)\n    return response\n  }\n\n  return getProviders\n}\n","'use strict'\n\nconst utils = require('../../utils')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('../../message')} Message\n */\n\n/**\n * @param {import('../../index')} dht\n */\nmodule.exports = (dht) => {\n  const log = utils.logger(dht.peerId, 'rpc:ping')\n\n  /**\n   * Process `Ping` DHT messages.\n   *\n   * @param {PeerId} peerId\n   * @param {Message} msg\n   */\n  function ping (peerId, msg) {\n    log('from %s', peerId.toB58String())\n    return msg\n  }\n\n  return ping\n}\n","'use strict'\n\nconst errcode = require('err-code')\nconst pTimeout = require('p-timeout')\nconst uint8ArrayEquals = require('uint8arrays/equals')\nconst uint8ArrayToString = require('uint8arrays/to-string')\nconst libp2pRecord = require('libp2p-record')\nconst c = require('../constants')\nconst Query = require('../query')\nconst utils = require('../utils')\nconst Record = libp2pRecord.Record\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('../query').DHTQueryResult} DHTQueryResult\n */\n\n/**\n * @param {import('../')} dht\n */\nmodule.exports = (dht) => {\n  /**\n   * @param {Uint8Array} key\n   * @param {Uint8Array} rec\n   */\n  const putLocal = async (key, rec) => { // eslint-disable-line require-await\n    return dht.datastore.put(utils.bufferToKey(key), rec)\n  }\n\n  /**\n   * Attempt to retrieve the value for the given key from\n   * the local datastore.\n   *\n   * @param {Uint8Array} key\n   */\n  const getLocal = async (key) => {\n    dht._log(`getLocal ${uint8ArrayToString(key, 'base32')}`)\n\n    const raw = await dht.datastore.get(utils.bufferToKey(key))\n    dht._log(`found ${uint8ArrayToString(key, 'base32')} in local datastore`)\n\n    const rec = Record.deserialize(raw)\n\n    await dht._verifyRecordLocally(rec)\n\n    return rec\n  }\n\n  /**\n   * Send the best record found to any peers that have an out of date record.\n   *\n   * @param {Uint8Array} key\n   * @param {import('../query').DHTQueryValue[]} vals - values retrieved from the DHT\n   * @param {Uint8Array} best - the best record that was found\n   */\n  const sendCorrectionRecord = async (key, vals, best) => {\n    const fixupRec = await utils.createPutRecord(key, best)\n\n    return Promise.all(vals.map(async (v) => {\n      // no need to do anything\n      if (uint8ArrayEquals(v.val, best)) {\n        return\n      }\n\n      // correct ourself\n      if (dht._isSelf(v.from)) {\n        try {\n          await dht._putLocal(key, fixupRec)\n        } catch (err) {\n          dht._log.error('Failed error correcting self', err)\n        }\n        return\n      }\n\n      // send correction\n      try {\n        await dht._putValueToPeer(key, fixupRec, v.from)\n      } catch (err) {\n        dht._log.error('Failed error correcting entry', err)\n      }\n    }))\n  }\n\n  return {\n    /**\n     * Store the given key/value pair locally, in the datastore.\n     *\n     * @param {Uint8Array} key\n     * @param {Uint8Array} rec - encoded record\n     */\n    async _putLocal (key, rec) { // eslint-disable-line require-await\n      return putLocal(key, rec)\n    },\n\n    /**\n     * Store the given key/value  pair in the DHT.\n     *\n     * @param {Uint8Array} key\n     * @param {Uint8Array} value\n     * @param {object} [options] - put options\n     * @param {number} [options.minPeers] - minimum number of peers required to successfully put (default: closestPeers.length)\n     */\n    async put (key, value, options = {}) {\n      dht._log('PutValue %b', key)\n\n      // create record in the dht format\n      const record = await utils.createPutRecord(key, value)\n\n      // store the record locally\n      await putLocal(key, record)\n\n      // put record to the closest peers\n      let counterAll = 0\n      let counterSuccess = 0\n\n      await utils.mapParallel(dht.getClosestPeers(key, { shallow: true }), async (peer) => {\n        try {\n          counterAll += 1\n          await dht._putValueToPeer(key, record, peer)\n          counterSuccess += 1\n        } catch (err) {\n          dht._log.error('Failed to put to peer (%b): %s', peer.id, err)\n        }\n      })\n\n      // verify if we were able to put to enough peers\n      const minPeers = options.minPeers || counterAll // Ensure we have a default `minPeers`\n\n      if (minPeers > counterSuccess) {\n        const error = errcode(new Error(`Failed to put value to enough peers: ${counterSuccess}/${minPeers}`), 'ERR_NOT_ENOUGH_PUT_PEERS')\n        dht._log.error(error)\n        throw error\n      }\n    },\n\n    /**\n     * Get the value to the given key.\n     * Times out after 1 minute by default.\n     *\n     * @param {Uint8Array} key\n     * @param {object} [options] - get options\n     * @param {number} [options.timeout] - optional timeout (default: 60000)\n     */\n    async get (key, options = {}) {\n      options.timeout = options.timeout || c.minute\n\n      dht._log('_get %b', key)\n\n      const vals = await dht.getMany(key, c.GET_MANY_RECORD_COUNT, options)\n      const recs = vals.map((v) => v.val)\n      let i = 0\n\n      try {\n        i = libp2pRecord.selection.bestRecord(dht.selectors, key, recs)\n      } catch (err) {\n        // Assume the first record if no selector available\n        if (err.code !== 'ERR_NO_SELECTOR_FUNCTION_FOR_RECORD_KEY') {\n          throw err\n        }\n      }\n\n      const best = recs[i]\n      dht._log('GetValue %b %s', key, best)\n\n      if (!best) {\n        throw errcode(new Error('best value was not found'), 'ERR_NOT_FOUND')\n      }\n\n      await sendCorrectionRecord(key, vals, best)\n\n      return best\n    },\n\n    /**\n     * Get the `n` values to the given key without sorting.\n     *\n     * @param {Uint8Array} key\n     * @param {number} nvals\n     * @param {object} [options] - get options\n     * @param {number} [options.timeout] - optional timeout (default: 60000)\n     */\n    async getMany (key, nvals, options = {}) {\n      options.timeout = options.timeout || c.minute\n\n      dht._log('getMany %b (%s)', key, nvals)\n\n      const vals = []\n      let localRec\n\n      try {\n        localRec = await getLocal(key)\n      } catch (err) {\n        if (nvals === 0) {\n          throw err\n        }\n      }\n\n      if (localRec) {\n        vals.push({\n          val: localRec.value,\n          from: dht.peerId\n        })\n      }\n\n      if (vals.length >= nvals) {\n        return vals\n      }\n\n      const id = await utils.convertBuffer(key)\n      const rtp = dht.routingTable.closestPeers(id, dht.kBucketSize)\n\n      dht._log('peers in rt: %d', rtp.length)\n\n      if (rtp.length === 0) {\n        const errMsg = 'Failed to lookup key! No peers from routing table!'\n\n        dht._log.error(errMsg)\n        if (vals.length === 0) {\n          throw errcode(new Error(errMsg), 'ERR_NO_PEERS_IN_ROUTING_TABLE')\n        }\n        return vals\n      }\n\n      const valsLength = vals.length\n\n      /**\n       * @param {number} pathIndex\n       * @param {number} numPaths\n       */\n      function createQuery (pathIndex, numPaths) {\n        // This function body runs once per disjoint path\n        const pathSize = utils.pathSize(nvals - valsLength, numPaths)\n        let queryResults = 0\n\n        /**\n         * Here we return the query function to use on this particular disjoint path\n         *\n         * @param {PeerId} peer\n         */\n        async function disjointPathQuery (peer) {\n          let rec, peers, lookupErr\n          try {\n            const results = await dht._getValueOrPeers(peer, key)\n            rec = results.record\n            peers = results.peers\n          } catch (err) {\n            // If we have an invalid record we just want to continue and fetch a new one.\n            if (err.code !== 'ERR_INVALID_RECORD') {\n              throw err\n            }\n            lookupErr = err\n          }\n\n          /** @type {import('../query').QueryResult} */\n          const res = {\n            closerPeers: peers\n          }\n\n          if (rec && rec.value) {\n            vals.push({\n              val: rec.value,\n              from: peer\n            })\n\n            queryResults++\n          } else if (lookupErr) {\n            vals.push({\n              err: lookupErr,\n              from: peer\n            })\n\n            queryResults++\n          }\n\n          // enough is enough\n          if (queryResults >= pathSize) {\n            res.pathComplete = true\n          }\n\n          return res\n        }\n\n        return disjointPathQuery\n      }\n\n      // we have peers, lets send the actual query to them\n      const query = new Query(dht, key, createQuery)\n\n      try {\n        await pTimeout(query.run(rtp), options.timeout)\n      } catch (err) {\n        if (vals.length === 0) {\n          throw err\n        }\n      } finally {\n        query.stop()\n      }\n\n      return vals\n    }\n  }\n}\n","'use strict'\n\nconst mh = require('multihashing-async').multihash\n\nconst utils = require('../utils')\nconst Run = require('./run')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {{from: PeerId, val: Uint8Array}} DHTQueryValue\n * @typedef {{from: PeerId, err: Error}} DHTQueryError\n * @typedef {DHTQueryValue | DHTQueryError} DHTQueryResult\n * @typedef {import('../').PeerData} PeerData\n *\n * @typedef {{ pathComplete?: boolean, queryComplete?: boolean, closerPeers?: PeerData[], peer?: PeerData, success?: boolean }} QueryResult\n */\n\n/**\n * User-supplied function to set up an individual disjoint path. Per-path\n * query state should be held in this function's closure.\n *\n * Accepts the numeric index from zero to numPaths - 1 and returns a function\n * to call on each peer in the query.\n *\n * @typedef {(pathIndex: number, numPaths: number) => QueryFunc } MakeQueryFunc\n */\n\n/**\n * Query function\n *\n * @typedef {(peer: PeerId) => Promise<QueryResult> } QueryFunc\n */\n\n/**\n * Divide peers up into disjoint paths (subqueries). Any peer can only be used once over all paths.\n * Within each path, query peers from closest to farthest away.\n */\nclass Query {\n  /**\n   * Create a new query. The makePath function is called once per disjoint path, so that per-path\n   * variables can be created in that scope. makePath then returns the actual query function (queryFunc) to\n   * use when on that path.\n   *\n   * @param {import('../index')} dht - DHT instance\n   * @param {Uint8Array} key\n   * @param {MakeQueryFunc} makePath - Called to set up each disjoint path. Must return the query function.\n   */\n  constructor (dht, key, makePath) {\n    this.dht = dht\n    this.key = key\n    this.makePath = makePath\n    this._log = utils.logger(this.dht.peerId, 'query:' + mh.toB58String(key))\n\n    this.running = false\n\n    this._onStart = this._onStart.bind(this)\n    this._onComplete = this._onComplete.bind(this)\n  }\n\n  /**\n   * Run this query, start with the given list of peers first.\n   *\n   * @param {PeerId[]} peers\n   */\n  async run (peers) { // eslint-disable-line require-await\n    if (!this.dht._queryManager.running) {\n      this._log.error('Attempt to run query after shutdown')\n      return { finalSet: new Set(), paths: [] }\n    }\n\n    if (peers.length === 0) {\n      this._log.error('Running query with no peers')\n      return { finalSet: new Set(), paths: [] }\n    }\n\n    this._run = new Run(this)\n\n    this._log(`query running with K=${this.dht.kBucketSize}, A=${this.dht.concurrency}, D=${Math.min(this.dht.disjointPaths, peers.length)}`)\n    this._run.once('start', this._onStart)\n    this._run.once('complete', this._onComplete)\n\n    return this._run.execute(peers)\n  }\n\n  /**\n   * Called when the run starts.\n   */\n  _onStart () {\n    this.running = true\n    this._startTime = Date.now()\n    this._log('query:start')\n\n    // Register this query so we can stop it if the DHT stops\n    this.dht._queryManager.queryStarted(this)\n  }\n\n  /**\n   * Called when the run completes (even if there's an error).\n   */\n  _onComplete () {\n    // Ensure worker queues for all paths are stopped at the end of the query\n    this.stop()\n  }\n\n  /**\n   * Stop the query.\n   */\n  stop () {\n    this._log(`query:done in ${Date.now() - (this._startTime || 0)}ms`)\n\n    if (this._run) {\n      this._log(`${this._run.errors.length} of ${this._run.peersSeen.size} peers errored (${this._run.errors.length / this._run.peersSeen.size * 100}% fail rate)`)\n    }\n\n    if (!this.running) {\n      return\n    }\n\n    this.running = false\n\n    if (this._run) {\n      this._run.removeListener('start', this._onStart)\n      this._run.removeListener('complete', this._onComplete)\n      this._run.stop()\n    }\n\n    this.dht._queryManager.queryCompleted(this)\n  }\n}\n\nmodule.exports = Query\n","'use strict'\n\nconst PeerDistanceList = require('../peer-list/peer-distance-list')\nconst EventEmitter = require('events')\n\nconst Path = require('./path')\nconst WorkerQueue = require('./worker-queue')\nconst utils = require('../utils')\n\n/**\n * @typedef {import('peer-id')} PeerId\n */\n\n/**\n * Manages a single run of the query.\n */\nclass Run extends EventEmitter {\n  /**\n   * Creates a Run.\n   *\n   * @param {import('./index')} query\n   */\n  constructor (query) {\n    super()\n\n    this.query = query\n\n    this.running = false\n\n    /** @type {WorkerQueue[]} */\n    this.workers = []\n\n    // The peers that have been queried (including error responses)\n    this.peersSeen = new Set()\n\n    // The errors received when querying peers\n    /** @type {Error[]} */\n    this.errors = []\n\n    // The closest K peers that have been queried successfully\n    // (this member is initialized when the worker queues start)\n    /** @type {PeerDistanceList | null} */\n    this.peersQueried = null\n  }\n\n  /**\n   * Stop all the workers\n   */\n  stop () {\n    if (!this.running) {\n      return\n    }\n\n    this.running = false\n    for (const worker of this.workers) {\n      worker.stop()\n    }\n  }\n\n  /**\n   * Execute the run with the given initial set of peers.\n   *\n   * @param {PeerId[]} peers\n   */\n  async execute (peers) {\n    /** @type {import('./path')[]} */\n    const paths = [] // array of states per disjoint path\n\n    // Create disjoint paths\n    const numPaths = Math.min(this.query.dht.disjointPaths, peers.length)\n    for (let i = 0; i < numPaths; i++) {\n      paths.push(new Path(this, this.query.makePath(i, numPaths)))\n    }\n\n    // Assign peers to paths round-robin style\n    peers.forEach((peer, i) => {\n      paths[i % numPaths].addInitialPeer(peer)\n    })\n\n    // Execute the query along each disjoint path\n    await this.executePaths(paths)\n\n    const res = {\n      // The closest K peers we were able to query successfully\n      finalSet: new Set(this.peersQueried && this.peersQueried.peers),\n\n      /** @type {import('./index').QueryResult[]} */\n      paths: []\n    }\n\n    // Collect the results from each completed path\n    for (const path of paths) {\n      if (path.res && (path.res.pathComplete || path.res.queryComplete)) {\n        path.res.success = true\n        res.paths.push(path.res)\n      }\n    }\n\n    return res\n  }\n\n  /**\n   * Execute all paths through the DHT.\n   *\n   * @param {Array<Path>} paths\n   * @returns {Promise<void>}\n   */\n  async executePaths (paths) {\n    this.running = true\n\n    this.emit('start')\n    try {\n      await Promise.all(paths.map(path => path.execute()))\n    } finally {\n      // Ensure all workers are stopped\n      this.stop()\n      // Completed the Run\n      this.emit('complete')\n    }\n\n    // If all queries errored out, something is seriously wrong, so callback\n    // with an error\n    if (this.errors.length === this.peersSeen.size) {\n      throw this.errors[0]\n    }\n  }\n\n  /**\n   * Initialize the list of queried peers, then start a worker queue for the\n   * given path.\n   *\n   * @param {Path} path\n   * @returns {Promise<void>}\n   */\n  async workerQueue (path) {\n    await this.init()\n    await this.startWorker(path)\n  }\n\n  /**\n   * Create and start a worker queue for a particular path.\n   *\n   * @param {Path} path\n   * @returns {Promise<void>}\n   */\n  async startWorker (path) {\n    const worker = new WorkerQueue(this.query.dht, this, path, this.query._log)\n    this.workers.push(worker)\n    await worker.execute()\n  }\n\n  /**\n   * Initialize the list of closest peers we've queried - this is shared by all\n   * paths in the run.\n   *\n   * @returns {Promise<void>}\n   */\n  async init () {\n    if (this.peersQueried) {\n      return\n    }\n\n    // We only want to initialize the PeerDistanceList once for the run\n    if (this.peersQueriedPromise) {\n      await this.peersQueriedPromise\n      return\n    }\n\n    // This promise is temporarily stored so that others may await its completion\n    this.peersQueriedPromise = (async () => {\n      const dhtKey = await utils.convertBuffer(this.query.key)\n      this.peersQueried = new PeerDistanceList(dhtKey, this.query.dht.kBucketSize)\n    })()\n\n    // After PeerDistanceList is initialized, clean up\n    await this.peersQueriedPromise\n    delete this.peersQueriedPromise\n  }\n\n  /**\n   * If we've queried K peers, and the remaining peers in the given `worker`'s queue\n   * are all further from the key than the peers we've already queried, then we should\n   * stop querying on that `worker`.\n   *\n   * @param {WorkerQueue} worker\n   * @returns {Promise<boolean>}\n   */\n  async continueQuerying (worker) {\n    // If we haven't queried K peers yet, keep going\n    if (this.peersQueried && this.peersQueried.length < this.peersQueried.capacity) {\n      return true\n    }\n\n    // Get all the peers that are currently being queried.\n    // Note that this function gets called right after a peer has been popped\n    // off the head of the closest peers queue so it will include that peer.\n    const running = Array.from(worker.queuedPeerIds)\n\n    // Check if any of the peers that are currently being queried are closer\n    // to the key than the peers we've already queried\n    const someCloser = this.peersQueried && await this.peersQueried.anyCloser(running)\n\n    // Some are closer, the worker should keep going\n    if (someCloser) {\n      return true\n    }\n\n    // None are closer, the worker can stop\n    return false\n  }\n}\n\nmodule.exports = Run\n","'use strict'\n\n// @ts-ignore\nconst distance = require('xor-distance')\nconst utils = require('../utils')\nconst pMap = require('p-map')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('../').PeerData} PeerData\n */\n\n/**\n * Maintains a list of peerIds sorted by distance from a DHT key.\n */\nclass PeerDistanceList {\n  /**\n   * Creates a new PeerDistanceList.\n   *\n   * @param {Uint8Array} originDhtKey - the DHT key from which distance is calculated\n   * @param {number} capacity - the maximum size of the list\n   */\n  constructor (originDhtKey, capacity) {\n    this.originDhtKey = originDhtKey\n    this.capacity = capacity\n\n    /** @type {{ peerId: PeerId, distance: Uint8Array }[]} */\n    this.peerDistances = []\n  }\n\n  /**\n   * The length of the list\n   */\n  get length () {\n    return this.peerDistances.length\n  }\n\n  /**\n   * The peerIds in the list, in order of distance from the origin key\n   */\n  get peers () {\n    return this.peerDistances.map(pd => pd.peerId)\n  }\n\n  /**\n   * Add a peerId to the list.\n   *\n   * @param {PeerId} peerId\n   */\n  async add (peerId) {\n    if (this.peerDistances.find(pd => uint8ArrayEquals(pd.peerId.id, peerId.id))) {\n      return\n    }\n\n    const dhtKey = await utils.convertPeerId(peerId)\n    const el = {\n      peerId,\n      distance: distance(this.originDhtKey, dhtKey)\n    }\n\n    this.peerDistances.push(el)\n    this.peerDistances.sort((a, b) => distance.compare(a.distance, b.distance))\n    this.peerDistances = this.peerDistances.slice(0, this.capacity)\n  }\n\n  /**\n   * Indicates whether any of the peerIds passed as a parameter are closer\n   * to the origin key than the furthest peerId in the PeerDistanceList.\n   *\n   * @param {PeerId[]} peerIds\n   */\n  async anyCloser (peerIds) {\n    if (!peerIds.length) {\n      return false\n    }\n\n    if (!this.length) {\n      return true\n    }\n\n    const dhtKeys = await pMap(peerIds, (peerId) => utils.convertPeerId(peerId))\n    const furthestDistance = this.peerDistances[this.peerDistances.length - 1].distance\n\n    for (const dhtKey of dhtKeys) {\n      const keyDistance = distance(this.originDhtKey, dhtKey)\n\n      if (distance.compare(keyDistance, furthestDistance) < 0) {\n        return true\n      }\n    }\n\n    return false\n  }\n}\n\nmodule.exports = PeerDistanceList\n","'use strict'\n\nconst PeerQueue = require('../peer-list/peer-queue')\nconst utils = require('../utils')\n\n// TODO: Temporary until parallel dial in Switch have a proper\n// timeout. Requires async/await refactor of transports and\n// dial abort logic. This gives us 30s to complete the `queryFunc`.\n// This should help reduce the high end call times of queries\nconst QUERY_FUNC_TIMEOUT = 30e3\n\n/**\n * @typedef {import('peer-id')} PeerId\n */\n\n/**\n * Manages a single Path through the DHT.\n */\nclass Path {\n  /**\n   * Creates a Path.\n   *\n   * @param {import('./run')} run\n   * @param {import('./index').QueryFunc} queryFunc\n   */\n  constructor (run, queryFunc) {\n    this.run = run\n    this.queryFunc = utils.withTimeout(queryFunc, QUERY_FUNC_TIMEOUT)\n    if (!this.queryFunc) throw new Error('Path requires a `queryFn` to be specified')\n    if (typeof this.queryFunc !== 'function') throw new Error('Path expected `queryFn` to be a function. Got ' + typeof this.queryFunc)\n\n    /** @type {PeerId[]} */\n    this.initialPeers = []\n\n    /** @type {PeerQueue | null} */\n    this.peersToQuery = null\n\n    /** @type {import('./index').QueryResult | null} */\n    this.res = null\n  }\n\n  /**\n   * Add a peer to the set of peers that are used to intialize the path.\n   *\n   * @param {PeerId} peer\n   */\n  addInitialPeer (peer) {\n    this.initialPeers.push(peer)\n  }\n\n  /**\n   * Execute the path\n   */\n  async execute () {\n    // Create a queue of peers ordered by distance from the key\n    const queue = await PeerQueue.fromKey(this.run.query.key)\n    // Add initial peers to the queue\n    this.peersToQuery = queue\n    await Promise.all(this.initialPeers.map(peer => this.addPeerToQuery(peer)))\n    await this.run.workerQueue(this)\n  }\n\n  /**\n   * Add a peer to the peers to be queried.\n   *\n   * @param {PeerId} peer\n   */\n  async addPeerToQuery (peer) {\n    // Don't add self\n    if (this.run.query.dht._isSelf(peer)) {\n      return\n    }\n\n    // The paths must be disjoint, meaning that no two paths in the Query may\n    // traverse the same peer\n    if (this.run.peersSeen.has(peer.toB58String())) {\n      return\n    }\n\n    if (this.peersToQuery) {\n      await this.peersToQuery.enqueue(peer)\n    }\n  }\n}\n\nmodule.exports = Path\n","'use strict'\n\n// @ts-ignore\nconst Heap = require('heap')\n// @ts-ignore\nconst distance = require('xor-distance')\nconst debug = require('debug')\n\nconst utils = require('../utils')\n\nconst log = debug('libp2p:dht:peer-queue')\n\n/**\n * @typedef {import('peer-id')} PeerId\n */\n\n/**\n * PeerQueue is a heap that sorts its entries (PeerIds) by their\n * xor distance to the inital provided key.\n */\nclass PeerQueue {\n  /**\n   * Create from a given peer id.\n   *\n   * @param {PeerId} id\n   * @returns {Promise<PeerQueue>}\n   */\n  static async fromPeerId (id) {\n    const key = await utils.convertPeerId(id)\n\n    return new PeerQueue(key)\n  }\n\n  /**\n   * Create from a given Uint8Array.\n   *\n   * @param {Uint8Array} keyBuffer\n   * @returns {Promise<PeerQueue>}\n   */\n  static async fromKey (keyBuffer) {\n    const key = await utils.convertBuffer(keyBuffer)\n\n    return new PeerQueue(key)\n  }\n\n  /**\n   * Create a new PeerQueue.\n   *\n   * @param {Uint8Array} from - The sha2-256 encoded peer id\n   */\n  constructor (from) {\n    log('create: %b', from)\n    this.from = from\n    this.heap = new Heap(utils.xorCompare)\n  }\n\n  /**\n   * Add a new PeerId to the queue.\n   *\n   * @param {PeerId} id\n   */\n  async enqueue (id) {\n    log('enqueue %s', id.toB58String())\n    const key = await utils.convertPeerId(id)\n\n    const el = {\n      id: id,\n      distance: distance(this.from, key)\n    }\n\n    this.heap.push(el)\n  }\n\n  /**\n   * Returns the closest peer to the `from` peer.\n   *\n   * @returns {PeerId}\n   */\n  dequeue () {\n    const el = this.heap.pop()\n    log('dequeue %s', el.id.toB58String())\n    return el.id\n  }\n\n  get length () {\n    return this.heap.size()\n  }\n}\n\nmodule.exports = PeerQueue\n","module.exports = require('./lib/heap');\n","// Generated by CoffeeScript 1.8.0\n(function() {\n  var Heap, defaultCmp, floor, heapify, heappop, heappush, heappushpop, heapreplace, insort, min, nlargest, nsmallest, updateItem, _siftdown, _siftup;\n\n  floor = Math.floor, min = Math.min;\n\n\n  /*\n  Default comparison function to be used\n   */\n\n  defaultCmp = function(x, y) {\n    if (x < y) {\n      return -1;\n    }\n    if (x > y) {\n      return 1;\n    }\n    return 0;\n  };\n\n\n  /*\n  Insert item x in list a, and keep it sorted assuming a is sorted.\n  \n  If x is already in a, insert it to the right of the rightmost x.\n  \n  Optional args lo (default 0) and hi (default a.length) bound the slice\n  of a to be searched.\n   */\n\n  insort = function(a, x, lo, hi, cmp) {\n    var mid;\n    if (lo == null) {\n      lo = 0;\n    }\n    if (cmp == null) {\n      cmp = defaultCmp;\n    }\n    if (lo < 0) {\n      throw new Error('lo must be non-negative');\n    }\n    if (hi == null) {\n      hi = a.length;\n    }\n    while (lo < hi) {\n      mid = floor((lo + hi) / 2);\n      if (cmp(x, a[mid]) < 0) {\n        hi = mid;\n      } else {\n        lo = mid + 1;\n      }\n    }\n    return ([].splice.apply(a, [lo, lo - lo].concat(x)), x);\n  };\n\n\n  /*\n  Push item onto heap, maintaining the heap invariant.\n   */\n\n  heappush = function(array, item, cmp) {\n    if (cmp == null) {\n      cmp = defaultCmp;\n    }\n    array.push(item);\n    return _siftdown(array, 0, array.length - 1, cmp);\n  };\n\n\n  /*\n  Pop the smallest item off the heap, maintaining the heap invariant.\n   */\n\n  heappop = function(array, cmp) {\n    var lastelt, returnitem;\n    if (cmp == null) {\n      cmp = defaultCmp;\n    }\n    lastelt = array.pop();\n    if (array.length) {\n      returnitem = array[0];\n      array[0] = lastelt;\n      _siftup(array, 0, cmp);\n    } else {\n      returnitem = lastelt;\n    }\n    return returnitem;\n  };\n\n\n  /*\n  Pop and return the current smallest value, and add the new item.\n  \n  This is more efficient than heappop() followed by heappush(), and can be\n  more appropriate when using a fixed size heap. Note that the value\n  returned may be larger than item! That constrains reasonable use of\n  this routine unless written as part of a conditional replacement:\n      if item > array[0]\n        item = heapreplace(array, item)\n   */\n\n  heapreplace = function(array, item, cmp) {\n    var returnitem;\n    if (cmp == null) {\n      cmp = defaultCmp;\n    }\n    returnitem = array[0];\n    array[0] = item;\n    _siftup(array, 0, cmp);\n    return returnitem;\n  };\n\n\n  /*\n  Fast version of a heappush followed by a heappop.\n   */\n\n  heappushpop = function(array, item, cmp) {\n    var _ref;\n    if (cmp == null) {\n      cmp = defaultCmp;\n    }\n    if (array.length && cmp(array[0], item) < 0) {\n      _ref = [array[0], item], item = _ref[0], array[0] = _ref[1];\n      _siftup(array, 0, cmp);\n    }\n    return item;\n  };\n\n\n  /*\n  Transform list into a heap, in-place, in O(array.length) time.\n   */\n\n  heapify = function(array, cmp) {\n    var i, _i, _j, _len, _ref, _ref1, _results, _results1;\n    if (cmp == null) {\n      cmp = defaultCmp;\n    }\n    _ref1 = (function() {\n      _results1 = [];\n      for (var _j = 0, _ref = floor(array.length / 2); 0 <= _ref ? _j < _ref : _j > _ref; 0 <= _ref ? _j++ : _j--){ _results1.push(_j); }\n      return _results1;\n    }).apply(this).reverse();\n    _results = [];\n    for (_i = 0, _len = _ref1.length; _i < _len; _i++) {\n      i = _ref1[_i];\n      _results.push(_siftup(array, i, cmp));\n    }\n    return _results;\n  };\n\n\n  /*\n  Update the position of the given item in the heap.\n  This function should be called every time the item is being modified.\n   */\n\n  updateItem = function(array, item, cmp) {\n    var pos;\n    if (cmp == null) {\n      cmp = defaultCmp;\n    }\n    pos = array.indexOf(item);\n    if (pos === -1) {\n      return;\n    }\n    _siftdown(array, 0, pos, cmp);\n    return _siftup(array, pos, cmp);\n  };\n\n\n  /*\n  Find the n largest elements in a dataset.\n   */\n\n  nlargest = function(array, n, cmp) {\n    var elem, result, _i, _len, _ref;\n    if (cmp == null) {\n      cmp = defaultCmp;\n    }\n    result = array.slice(0, n);\n    if (!result.length) {\n      return result;\n    }\n    heapify(result, cmp);\n    _ref = array.slice(n);\n    for (_i = 0, _len = _ref.length; _i < _len; _i++) {\n      elem = _ref[_i];\n      heappushpop(result, elem, cmp);\n    }\n    return result.sort(cmp).reverse();\n  };\n\n\n  /*\n  Find the n smallest elements in a dataset.\n   */\n\n  nsmallest = function(array, n, cmp) {\n    var elem, i, los, result, _i, _j, _len, _ref, _ref1, _results;\n    if (cmp == null) {\n      cmp = defaultCmp;\n    }\n    if (n * 10 <= array.length) {\n      result = array.slice(0, n).sort(cmp);\n      if (!result.length) {\n        return result;\n      }\n      los = result[result.length - 1];\n      _ref = array.slice(n);\n      for (_i = 0, _len = _ref.length; _i < _len; _i++) {\n        elem = _ref[_i];\n        if (cmp(elem, los) < 0) {\n          insort(result, elem, 0, null, cmp);\n          result.pop();\n          los = result[result.length - 1];\n        }\n      }\n      return result;\n    }\n    heapify(array, cmp);\n    _results = [];\n    for (i = _j = 0, _ref1 = min(n, array.length); 0 <= _ref1 ? _j < _ref1 : _j > _ref1; i = 0 <= _ref1 ? ++_j : --_j) {\n      _results.push(heappop(array, cmp));\n    }\n    return _results;\n  };\n\n  _siftdown = function(array, startpos, pos, cmp) {\n    var newitem, parent, parentpos;\n    if (cmp == null) {\n      cmp = defaultCmp;\n    }\n    newitem = array[pos];\n    while (pos > startpos) {\n      parentpos = (pos - 1) >> 1;\n      parent = array[parentpos];\n      if (cmp(newitem, parent) < 0) {\n        array[pos] = parent;\n        pos = parentpos;\n        continue;\n      }\n      break;\n    }\n    return array[pos] = newitem;\n  };\n\n  _siftup = function(array, pos, cmp) {\n    var childpos, endpos, newitem, rightpos, startpos;\n    if (cmp == null) {\n      cmp = defaultCmp;\n    }\n    endpos = array.length;\n    startpos = pos;\n    newitem = array[pos];\n    childpos = 2 * pos + 1;\n    while (childpos < endpos) {\n      rightpos = childpos + 1;\n      if (rightpos < endpos && !(cmp(array[childpos], array[rightpos]) < 0)) {\n        childpos = rightpos;\n      }\n      array[pos] = array[childpos];\n      pos = childpos;\n      childpos = 2 * pos + 1;\n    }\n    array[pos] = newitem;\n    return _siftdown(array, startpos, pos, cmp);\n  };\n\n  Heap = (function() {\n    Heap.push = heappush;\n\n    Heap.pop = heappop;\n\n    Heap.replace = heapreplace;\n\n    Heap.pushpop = heappushpop;\n\n    Heap.heapify = heapify;\n\n    Heap.updateItem = updateItem;\n\n    Heap.nlargest = nlargest;\n\n    Heap.nsmallest = nsmallest;\n\n    function Heap(cmp) {\n      this.cmp = cmp != null ? cmp : defaultCmp;\n      this.nodes = [];\n    }\n\n    Heap.prototype.push = function(x) {\n      return heappush(this.nodes, x, this.cmp);\n    };\n\n    Heap.prototype.pop = function() {\n      return heappop(this.nodes, this.cmp);\n    };\n\n    Heap.prototype.peek = function() {\n      return this.nodes[0];\n    };\n\n    Heap.prototype.contains = function(x) {\n      return this.nodes.indexOf(x) !== -1;\n    };\n\n    Heap.prototype.replace = function(x) {\n      return heapreplace(this.nodes, x, this.cmp);\n    };\n\n    Heap.prototype.pushpop = function(x) {\n      return heappushpop(this.nodes, x, this.cmp);\n    };\n\n    Heap.prototype.heapify = function() {\n      return heapify(this.nodes, this.cmp);\n    };\n\n    Heap.prototype.updateItem = function(x) {\n      return updateItem(this.nodes, x, this.cmp);\n    };\n\n    Heap.prototype.clear = function() {\n      return this.nodes = [];\n    };\n\n    Heap.prototype.empty = function() {\n      return this.nodes.length === 0;\n    };\n\n    Heap.prototype.size = function() {\n      return this.nodes.length;\n    };\n\n    Heap.prototype.clone = function() {\n      var heap;\n      heap = new Heap();\n      heap.nodes = this.nodes.slice(0);\n      return heap;\n    };\n\n    Heap.prototype.toArray = function() {\n      return this.nodes.slice(0);\n    };\n\n    Heap.prototype.insert = Heap.prototype.push;\n\n    Heap.prototype.top = Heap.prototype.peek;\n\n    Heap.prototype.front = Heap.prototype.peek;\n\n    Heap.prototype.has = Heap.prototype.contains;\n\n    Heap.prototype.copy = Heap.prototype.clone;\n\n    return Heap;\n\n  })();\n\n  (function(root, factory) {\n    if (typeof define === 'function' && define.amd) {\n      return define([], factory);\n    } else if (typeof exports === 'object') {\n      return module.exports = factory();\n    } else {\n      return root.Heap = factory();\n    }\n  })(this, function() {\n    return Heap;\n  });\n\n}).call(this);\n","'use strict'\n\nconst { default: Queue } = require('p-queue')\n\n/**\n * @typedef {import('peer-id')} PeerId\n */\n\nclass WorkerQueue {\n  /**\n   * Creates a new WorkerQueue.\n   *\n   * @param {import('../index')} dht\n   * @param {import('./run')} run\n   * @param {import('./path')} path\n   * @param {Function & {error: Function}} log\n   */\n  constructor (dht, run, path, log) {\n    this.dht = dht\n    this.run = run\n    this.path = path\n    this.log = log\n\n    this.concurrency = this.dht.concurrency\n    this.queue = this.setupQueue()\n    // a container for resolve/reject functions that will be populated\n    // when execute() is called\n\n    /** @type {{ resolve: (result?: any) => void, reject: (err: Error) => void} | null} */\n    this.execution = null\n\n    /** @type {Set<PeerId>} */\n    this.queuedPeerIds = new Set()\n  }\n\n  /**\n   * Create the underlying async queue.\n   *\n   * @returns {Queue}\n   */\n  setupQueue () {\n    const q = new Queue({\n      concurrency: this.concurrency\n    })\n\n    // When all peers in the queue have been processed, stop the worker\n    q.on('idle', () => {\n      if (this.path.peersToQuery && !this.path.peersToQuery.length) {\n        this.log('queue:drain')\n        this.stop()\n      }\n    })\n\n    // When a space opens up in the queue, add some more peers\n    q.on('next', () => {\n      if (!this.running) {\n        return\n      }\n\n      if (q.pending < this.concurrency) {\n        this.fill()\n      }\n    })\n\n    return q\n  }\n\n  /**\n   * Stop the worker, optionally providing an error to pass to the worker's\n   * callback.\n   *\n   * @param {Error} [err]\n   */\n  stop (err) {\n    if (!this.running) {\n      return\n    }\n\n    this.running = false\n    this.queue.clear()\n    this.log('worker:stop, %d workers still running', this.run.workers.filter(w => w.running).length)\n\n    if (this.execution) {\n      if (err) {\n        this.execution.reject(err)\n      } else {\n        this.execution.resolve()\n      }\n    }\n  }\n\n  /**\n   * Use the queue from async to keep `concurrency` amount items running\n   * per path.\n   *\n   * @returns {Promise<void>}\n   */\n  async execute () {\n    this.running = true\n    // store the promise resolution functions to be resolved at end of queue\n    this.execution = null\n    const execPromise = new Promise((resolve, reject) => {\n      this.execution = {\n        resolve, reject\n      }\n    })\n    // start queue\n    this.fill()\n    // await completion\n    await execPromise\n  }\n\n  /**\n   * Add peers to the worker queue until there are enough to satisfy the\n   * worker queue concurrency.\n   * Note that we don't want to take any more than those required to satisfy\n   * concurrency from the peers-to-query queue, because we always want to\n   * query the closest peers to the key first, and new peers are continuously\n   * being added to the peers-to-query queue.\n   */\n  fill () {\n    if (!this.path.peersToQuery) {\n      return\n    }\n\n    // Note:\n    // - queue.pending: number of items that are currently running\n    // - queue.size: the number of items that are waiting to be run\n    while (this.queue.pending + this.queue.size < this.concurrency && this.path.peersToQuery.length > 0) {\n      const peer = this.path.peersToQuery.dequeue()\n\n      // store the peer id so we can potentially abort early\n      this.queuedPeerIds.add(peer)\n\n      this.queue.add(\n        () => {\n          return this.processNext(peer)\n            .catch(err => {\n              this.log.error('queue', err)\n              this.stop(err)\n            })\n            .finally(() => {\n              this.queuedPeerIds.delete(peer)\n            })\n        }\n      )\n    }\n  }\n\n  /**\n   * Process the next peer in the queue\n   *\n   * @param {PeerId} peer\n   */\n  async processNext (peer) {\n    if (!this.running) {\n      return\n    }\n\n    // The paths must be disjoint, meaning that no two paths in the Query may\n    // traverse the same peer\n    if (this.run.peersSeen.has(peer.toB58String())) {\n      return\n    }\n\n    // Check if we've queried enough peers already\n    let continueQuerying, continueQueryingError\n    try {\n      continueQuerying = await this.run.continueQuerying(this)\n    } catch (err) {\n      continueQueryingError = err\n    }\n\n    // Abort and ignore any error if we're no longer running\n    if (!this.running) {\n      return\n    }\n\n    if (continueQueryingError) {\n      throw continueQueryingError\n    }\n\n    // No peer we're querying is closer, stop the queue\n    // This will cause queries that may potentially result in\n    // closer nodes to be ended, but it reduces overall query time\n    if (!continueQuerying) {\n      this.stop()\n      return\n    }\n\n    // Check if another path has queried this peer in the mean time\n    if (this.run.peersSeen.has(peer.toB58String())) {\n      return\n    }\n    this.run.peersSeen.add(peer.toB58String())\n\n    // Execute the query on the next peer\n    this.log('queue:work')\n    let state, execError\n    try {\n      state = await this.execQuery(peer)\n    } catch (err) {\n      execError = err\n    }\n\n    // Abort and ignore any error if we're no longer running\n    if (!this.running) {\n      return\n    }\n\n    this.log('queue:work:done', execError, state)\n\n    if (execError) {\n      throw execError\n    }\n\n    // If query is complete, stop all workers.\n    // Note: run.stop() calls stop() on all the workers, which kills the\n    // queue and resolves execution\n    if (state && state.queryComplete) {\n      this.log('query:complete')\n      this.run.stop()\n      return\n    }\n\n    // If path is complete, just stop this worker.\n    // Note: this.stop() kills the queue and resolves execution\n    if (state && state.pathComplete) {\n      this.stop()\n    }\n  }\n\n  /**\n   * Execute a query on the next peer.\n   *\n   * @param {PeerId} peer\n   */\n  async execQuery (peer) {\n    let res, queryError\n    try {\n      res = await this.path.queryFunc(peer)\n    } catch (err) {\n      queryError = err\n    }\n\n    // Abort and ignore any error if we're no longer running\n    if (!this.running) {\n      return\n    }\n\n    if (queryError) {\n      this.run.errors.push(queryError)\n      return\n    }\n\n    // Add the peer to the closest peers we have successfully queried\n    this.run.peersQueried && await this.run.peersQueried.add(peer)\n\n    if (!res) {\n      return\n    }\n\n    // If the query indicates that this path or the whole query is complete\n    // set the path result and bail out\n    if (res.pathComplete || res.queryComplete) {\n      this.path.res = res\n\n      return {\n        pathComplete: res.pathComplete,\n        queryComplete: res.queryComplete\n      }\n    }\n\n    // If there are closer peers to query, add them to the queue\n    if (res.closerPeers && res.closerPeers.length > 0) {\n      /**\n       * @param {import('../').PeerData} closer\n       */\n      const queryCloser = async (closer) => {\n        // don't add ourselves\n        if (this.dht._isSelf(closer.id)) {\n          return\n        }\n\n        this.dht._peerDiscovered(closer.id, closer.multiaddrs)\n        await this.path.addPeerToQuery(closer.id)\n      }\n\n      await Promise.all(res.closerPeers.map(queryCloser))\n    }\n  }\n}\n\nmodule.exports = WorkerQueue\n","'use strict'\n\nconst errcode = require('err-code')\nconst pTimeout = require('p-timeout')\n\nconst c = require('../constants')\nconst LimitedPeerList = require('../peer-list/limited-peer-list')\nconst Message = require('../message')\nconst Query = require('../query')\nconst utils = require('../utils')\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n */\n\n/**\n * @param {import('../')} dht\n */\nmodule.exports = (dht) => {\n  /**\n   * Check for providers from a single node.\n   *\n   * @param {PeerId} peer\n   * @param {CID} key\n   *\n   * @private\n   */\n  const findProvidersSingle = async (peer, key) => { // eslint-disable-line require-await\n    const msg = new Message(Message.TYPES.GET_PROVIDERS, key.bytes, 0)\n    return dht.network.sendRequest(peer, msg)\n  }\n\n  return {\n    /**\n     * Announce to the network that we can provide the value for a given key\n     *\n     * @param {CID} key\n     */\n    async provide (key) {\n      dht._log(`provide: ${key}`)\n\n      /** @type {Error[]} */\n      const errors = []\n\n      // Add peer as provider\n      await dht.providers.addProvider(key, dht.peerId)\n\n      const multiaddrs = dht.libp2p ? dht.libp2p.multiaddrs : []\n      const msg = new Message(Message.TYPES.ADD_PROVIDER, key.bytes, 0)\n      msg.providerPeers = [{\n        id: dht.peerId,\n        multiaddrs\n      }]\n\n      /**\n       * @param {PeerId} peer\n       */\n      async function mapPeer (peer) {\n        dht._log(`putProvider ${key} to ${peer.toB58String()}`)\n        try {\n          await dht.network.sendMessage(peer, msg)\n        } catch (err) {\n          errors.push(err)\n        }\n      }\n\n      // Notify closest peers\n      await utils.mapParallel(dht.getClosestPeers(key.bytes), mapPeer)\n\n      if (errors.length) {\n        // TODO:\n        // This should be infrequent. This means a peer we previously connected\n        // to failed to exchange the provide message. If getClosestPeers was an\n        // iterator, we could continue to pull until we announce to kBucketSize peers.\n        throw errcode(new Error(`Failed to provide to ${errors.length} of ${dht.kBucketSize} peers`), 'ERR_SOME_PROVIDES_FAILED', { errors })\n      }\n    },\n\n    /**\n     * Search the dht for up to `K` providers of the given CID.\n     *\n     * @param {CID} key\n     * @param {Object} [options] - findProviders options\n     * @param {number} [options.timeout=60000] - how long the query should maximally run, in milliseconds\n     * @param {number} [options.maxNumProviders=5] - maximum number of providers to find\n     * @returns {AsyncIterable<{ id: PeerId, multiaddrs: Multiaddr[] }>}\n     */\n    async * findProviders (key, options = { timeout: 60000, maxNumProviders: 5 }) {\n      const providerTimeout = options.timeout || c.minute\n      const n = options.maxNumProviders || c.K\n\n      dht._log(`findProviders ${key}`)\n\n      const out = new LimitedPeerList(n)\n      const provs = await dht.providers.getProviders(key)\n\n      provs\n        .forEach(id => {\n          const peerData = dht.peerStore.get(id)\n\n          if (peerData) {\n            out.push({\n              id: peerData.id,\n              multiaddrs: peerData.addresses\n                .map((address) => address.multiaddr)\n            })\n          } else {\n            out.push({\n              id,\n              multiaddrs: []\n            })\n          }\n        })\n\n      // All done\n      if (out.length >= n) {\n        // yield values\n        for (const pData of out.toArray()) {\n          yield pData\n        }\n        return\n      }\n\n      // need more, query the network\n      /** @type {LimitedPeerList[]} */\n      const paths = []\n\n      /**\n       *\n       * @param {number} pathIndex\n       * @param {number} numPaths\n       */\n      function makePath (pathIndex, numPaths) {\n        // This function body runs once per disjoint path\n        const pathSize = utils.pathSize(n - out.length, numPaths)\n        const pathProviders = new LimitedPeerList(pathSize)\n        paths.push(pathProviders)\n\n        /**\n         * The query function to use on this particular disjoint path\n         *\n         * @param {PeerId} peer\n         */\n        async function queryDisjointPath (peer) {\n          const msg = await findProvidersSingle(peer, key)\n          const provs = msg.providerPeers\n          dht._log(`Found ${provs.length} provider entries for ${key}`)\n\n          provs.forEach((prov) => {\n            pathProviders.push({\n              ...prov\n            })\n          })\n\n          // hooray we have all that we want\n          if (pathProviders.length >= pathSize) {\n            return { pathComplete: true }\n          }\n\n          // it looks like we want some more\n          return { closerPeers: msg.closerPeers }\n        }\n\n        return queryDisjointPath\n      }\n\n      const query = new Query(dht, key.bytes, makePath)\n      const peers = dht.routingTable.closestPeers(key.bytes, dht.kBucketSize)\n\n      try {\n        await pTimeout(\n          query.run(peers),\n          providerTimeout\n        )\n      } catch (err) {\n        if (err.name !== pTimeout.TimeoutError.name) {\n          throw err\n        }\n      } finally {\n        query.stop()\n      }\n\n      // combine peers from each path\n      paths.forEach((path) => {\n        path.toArray().forEach((peer) => {\n          out.push(peer)\n        })\n      })\n\n      for (const pData of out.toArray()) {\n        yield pData\n      }\n    }\n  }\n}\n","'use strict'\n\nconst PeerList = require('.')\n\n/**\n * @typedef {import('../').PeerData} PeerData\n */\n\n/**\n * Like PeerList but with a length restriction.\n */\nclass LimitedPeerList extends PeerList {\n  /**\n   * Create a new limited peer list.\n   *\n   * @param {number} limit\n   */\n  constructor (limit) {\n    super()\n    this.limit = limit\n  }\n\n  /**\n   * Add a PeerData if it fits in the list\n   *\n   * @param {PeerData} peerData\n   */\n  push (peerData) {\n    if (this.length < this.limit) {\n      return super.push(peerData)\n    }\n\n    return false\n  }\n}\n\nmodule.exports = LimitedPeerList\n","'use strict'\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('../').PeerData} PeerData\n */\n\n/**\n * A list of unique peers.\n */\nclass PeerList {\n  constructor () {\n    /** @type {PeerData[]} */\n    this.list = []\n  }\n\n  /**\n   * Add a new peer. Returns `true` if it was a new one\n   *\n   * @param {PeerData} peerData\n   */\n  push (peerData) {\n    if (!this.has(peerData.id)) {\n      this.list.push(peerData)\n\n      return true\n    }\n\n    return false\n  }\n\n  /**\n   * Check if this PeerData is already in here.\n   *\n   * @param {PeerId} peerId\n   */\n  has (peerId) {\n    const match = this.list.find((i) => i.id.equals(peerId))\n    return Boolean(match)\n  }\n\n  /**\n   * Get the list as an array.\n   */\n  toArray () {\n    return this.list.slice()\n  }\n\n  /**\n   * Remove the last element\n   */\n  pop () {\n    return this.list.pop()\n  }\n\n  /**\n   * The length of the list\n   */\n  get length () {\n    return this.list.length\n  }\n}\n\nmodule.exports = PeerList\n","'use strict'\n\nconst errcode = require('err-code')\nconst pTimeout = require('p-timeout')\n\nconst PeerId = require('peer-id')\nconst crypto = require('libp2p-crypto')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nconst c = require('../constants')\nconst Message = require('../message')\nconst Query = require('../query')\n\nconst utils = require('../utils')\n\n/**\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n */\n\n/**\n * @param {import('../index')} dht\n */\nmodule.exports = (dht) => {\n  /**\n   * Look if we are connected to a peer with the given id.\n   * Returns its id and addresses, if found, otherwise `undefined`.\n   *\n   * @param {PeerId} peer\n   */\n  const findPeerLocal = async (peer) => {\n    dht._log(`findPeerLocal ${peer.toB58String()}`)\n    const p = await dht.routingTable.find(peer)\n\n    const peerData = p && dht.peerStore.get(p)\n\n    if (peerData) {\n      return {\n        id: peerData.id,\n        multiaddrs: peerData.addresses.map((address) => address.multiaddr)\n      }\n    }\n  }\n\n  /**\n   * Get a value via rpc call for the given parameters.\n   *\n   * @param {PeerId} peer\n   * @param {Uint8Array} key\n   * @returns {Promise<Message>}\n   * @private\n   */\n  const getValueSingle = async (peer, key) => { // eslint-disable-line require-await\n    const msg = new Message(Message.TYPES.GET_VALUE, key, 0)\n    return dht.network.sendRequest(peer, msg)\n  }\n\n  /**\n   * Find close peers for a given peer\n   *\n   * @param {Uint8Array} key\n   * @param {PeerId} peer\n   * @returns {Promise<Array<{ id: PeerId, multiaddrs: Multiaddr[] }>>}\n   * @private\n   */\n\n  const closerPeersSingle = async (key, peer) => {\n    dht._log(`closerPeersSingle ${uint8ArrayToString(key, 'base32')} from ${peer.toB58String()}`)\n    const msg = await dht.peerRouting._findPeerSingle(peer, new PeerId(key))\n\n    return msg.closerPeers\n      .filter((peerData) => !dht._isSelf(peerData.id))\n      .map((peerData) => {\n        dht.peerStore.addressBook.add(peerData.id, peerData.multiaddrs)\n\n        return peerData\n      })\n  }\n\n  /**\n   * Get the public key directly from a node.\n   *\n   * @param {PeerId} peer\n   */\n  const getPublicKeyFromNode = async (peer) => {\n    const pkKey = utils.keyForPublicKey(peer)\n    const msg = await getValueSingle(peer, pkKey)\n\n    if (!msg.record || !msg.record.value) {\n      throw errcode(new Error(`Node not responding with its public key: ${peer.toB58String()}`), 'ERR_INVALID_RECORD')\n    }\n\n    const recPeer = await PeerId.createFromPubKey(msg.record.value)\n\n    // compare hashes of the pub key\n    if (!recPeer.equals(peer)) {\n      throw errcode(new Error('public key does not match id'), 'ERR_PUBLIC_KEY_DOES_NOT_MATCH_ID')\n    }\n\n    return recPeer.pubKey\n  }\n\n  return {\n  /**\n   * Ask peer `peer` if they know where the peer with id `target` is.\n   *\n   * @param {PeerId} peer\n   * @param {PeerId} target\n   * @returns {Promise<Message>}\n   * @private\n   */\n    async _findPeerSingle (peer, target) { // eslint-disable-line require-await\n      dht._log('findPeerSingle %s', peer.toB58String())\n      const msg = new Message(Message.TYPES.FIND_NODE, target.id, 0)\n\n      return dht.network.sendRequest(peer, msg)\n    },\n\n    /**\n     * Search for a peer with the given ID.\n     *\n     * @param {PeerId} id\n     * @param {Object} [options] - findPeer options\n     * @param {number} [options.timeout=60000] - how long the query should maximally run, in milliseconds\n     * @returns {Promise<{ id: PeerId, multiaddrs: Multiaddr[] }>}\n     */\n    async findPeer (id, options = { timeout: 60000 }) {\n      options.timeout = options.timeout || c.minute\n      dht._log('findPeer %s', id.toB58String())\n\n      // Try to find locally\n      const pi = await findPeerLocal(id)\n\n      // already got it\n      if (pi != null) {\n        dht._log('found local')\n        return pi\n      }\n\n      const key = await utils.convertPeerId(id)\n      const peers = dht.routingTable.closestPeers(key, dht.kBucketSize)\n\n      if (peers.length === 0) {\n        throw errcode(new Error('Peer lookup failed'), 'ERR_LOOKUP_FAILED')\n      }\n\n      // sanity check\n      const match = peers.find((p) => p.isEqual(id))\n      if (match) {\n        const peer = dht.peerStore.get(id)\n\n        if (peer) {\n          dht._log('found in peerStore')\n          return {\n            id: peer.id,\n            multiaddrs: peer.addresses.map((address) => address.multiaddr)\n          }\n        }\n      }\n\n      // query the network\n      const query = new Query(dht, id.id, () => {\n        /**\n         * There is no distinction between the disjoint paths, so there are no per-path\n         * variables in dht scope. Just return the actual query function.\n         *\n         * @param {PeerId} peer\n         */\n        const queryFn = async (peer) => {\n          const msg = await this._findPeerSingle(peer, id)\n          const match = msg.closerPeers.find((p) => p.id.isEqual(id))\n\n          // found it\n          if (match) {\n            return {\n              peer: match,\n              queryComplete: true\n            }\n          }\n\n          return {\n            closerPeers: msg.closerPeers\n          }\n        }\n\n        return queryFn\n      })\n\n      let result\n      try {\n        result = await pTimeout(query.run(peers), options.timeout)\n      } finally {\n        query.stop()\n      }\n\n      let success = false\n      result.paths.forEach((result) => {\n        if (result.success && result.peer) {\n          success = true\n          dht.peerStore.addressBook.add(result.peer.id, result.peer.multiaddrs)\n        }\n      })\n      dht._log('findPeer %s: %s', id.toB58String(), success)\n\n      if (!success) {\n        throw errcode(new Error('No peer found'), 'ERR_NOT_FOUND')\n      }\n\n      const peerData = dht.peerStore.get(id)\n\n      if (!peerData) {\n        throw errcode(new Error('No peer found in peer store'), 'ERR_NOT_FOUND')\n      }\n\n      return {\n        id: peerData.id,\n        multiaddrs: peerData.addresses.map((address) => address.multiaddr)\n      }\n    },\n\n    /**\n     * Kademlia 'node lookup' operation.\n     *\n     * @param {Uint8Array} key\n     * @param {Object} [options]\n     * @param {boolean} [options.shallow=false] - shallow query\n     * @returns {AsyncIterable<PeerId>}\n     */\n    async * getClosestPeers (key, options = { shallow: false }) {\n      dht._log('getClosestPeers to %b', key)\n\n      const id = await utils.convertBuffer(key)\n      const tablePeers = dht.routingTable.closestPeers(id, dht.kBucketSize)\n\n      const q = new Query(dht, key, () => {\n        // There is no distinction between the disjoint paths,\n        // so there are no per-path variables in dht scope.\n        // Just return the actual query function.\n        return async (peer) => {\n          const closer = await closerPeersSingle(key, peer)\n\n          return {\n            closerPeers: closer,\n            pathComplete: options.shallow ? true : undefined\n          }\n        }\n      })\n\n      const res = await q.run(tablePeers)\n      if (!res || !res.finalSet) {\n        return []\n      }\n\n      const sorted = await utils.sortClosestPeers(Array.from(res.finalSet), id)\n\n      for (const pId of sorted.slice(0, dht.kBucketSize)) {\n        yield pId\n      }\n    },\n\n    /**\n     * Get the public key for the given peer id.\n     *\n     * @param {PeerId} peer\n     */\n    async getPublicKey (peer) {\n      dht._log('getPublicKey %s', peer.toB58String())\n\n      // local check\n      const peerData = dht.peerStore.get(peer)\n\n      if (peerData && peerData.id.pubKey) {\n        dht._log('getPublicKey: found local copy')\n        return peerData.id.pubKey\n      }\n\n      // try the node directly\n      let pk\n\n      try {\n        pk = await getPublicKeyFromNode(peer)\n      } catch (err) {\n        // try dht directly\n        const pkKey = utils.keyForPublicKey(peer)\n        const value = await dht.get(pkKey)\n        pk = crypto.keys.unmarshalPublicKey(value)\n      }\n\n      const peerId = new PeerId(peer.id, undefined, pk)\n      const addrs = ((peerData && peerData.addresses) || []).map((address) => address.multiaddr)\n      dht.peerStore.addressBook.add(peerId, addrs)\n      dht.peerStore.keyBook.set(peerId, pk)\n\n      return pk\n    }\n  }\n}\n","'use strict'\n\nconst cache = require('hashlru')\n// @ts-ignore\nconst varint = require('varint')\nconst PeerId = require('peer-id')\nconst { Key } = require('interface-datastore')\nconst { default: Queue } = require('p-queue')\nconst c = require('./constants')\nconst utils = require('./utils')\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('interface-datastore').Datastore} Datastore\n */\n\n/**\n * This class manages known providers.\n * A provider is a peer that we know to have the content for a given CID.\n *\n * Every `cleanupInterval` providers are checked if they\n * are still valid, i.e. younger than the `provideValidity`.\n * If they are not, they are deleted.\n *\n * To ensure the list survives restarts of the daemon,\n * providers are stored in the datastore, but to ensure\n * access is fast there is an LRU cache in front of that.\n */\nclass Providers {\n  /**\n   * @param {Datastore} datastore\n   * @param {PeerId} [self]\n   * @param {number} [cacheSize=256]\n   */\n  constructor (datastore, self, cacheSize) {\n    this.datastore = datastore\n\n    this._log = utils.logger(self, 'providers')\n\n    /**\n     * How often invalid records are cleaned. (in seconds)\n     *\n     * @type {number}\n     */\n    this.cleanupInterval = c.PROVIDERS_CLEANUP_INTERVAL\n\n    /**\n     * How long is a provider valid for. (in seconds)\n     *\n     * @type {number}\n     */\n    this.provideValidity = c.PROVIDERS_VALIDITY\n\n    /**\n     * LRU cache size\n     *\n     * @type {number}\n     */\n    this.lruCacheSize = cacheSize || c.PROVIDERS_LRU_CACHE_SIZE\n\n    // @ts-ignore hashlru types are wrong\n    this.providers = cache(this.lruCacheSize)\n\n    this.syncQueue = new Queue({ concurrency: 1 })\n  }\n\n  /**\n   * Start the provider cleanup service\n   */\n  start () {\n    this._cleaner = setInterval(\n      () => this._cleanup(),\n      this.cleanupInterval\n    )\n  }\n\n  /**\n   * Release any resources.\n   */\n  stop () {\n    if (this._cleaner) {\n      clearInterval(this._cleaner)\n      this._cleaner = null\n    }\n  }\n\n  /**\n   * Check all providers if they are still valid, and if not delete them.\n   *\n   * @returns {Promise<void>}\n   * @private\n   */\n  _cleanup () {\n    return this.syncQueue.add(async () => {\n      this._log('start cleanup')\n      const start = Date.now()\n\n      let count = 0\n      let deleteCount = 0\n      const deleted = new Map()\n      const batch = this.datastore.batch()\n\n      // Get all provider entries from the datastore\n      const query = this.datastore.query({ prefix: c.PROVIDERS_KEY_PREFIX })\n      for await (const entry of query) {\n        try {\n          // Add a delete to the batch for each expired entry\n          const { cid, peerId } = parseProviderKey(entry.key)\n          const time = readTime(entry.value)\n          const now = Date.now()\n          const delta = now - time\n          const expired = delta > this.provideValidity\n          this._log('comparing: %d - %d = %d > %d %s',\n            now, time, delta, this.provideValidity, expired ? '(expired)' : '')\n          if (expired) {\n            deleteCount++\n            batch.delete(entry.key)\n            const peers = deleted.get(cid) || new Set()\n            peers.add(peerId)\n            deleted.set(cid, peers)\n          }\n          count++\n        } catch (err) {\n          this._log.error(err.message)\n        }\n      }\n      this._log('deleting %d / %d entries', deleteCount, count)\n\n      // Commit the deletes to the datastore\n      if (deleted.size) {\n        await batch.commit()\n      }\n\n      // Clear expired entries from the cache\n      for (const [cid, peers] of deleted) {\n        const key = makeProviderKey(cid)\n        const provs = this.providers.get(key)\n        if (provs) {\n          for (const peerId of peers) {\n            provs.delete(peerId)\n          }\n          if (provs.size === 0) {\n            this.providers.remove(key)\n          } else {\n            this.providers.set(key, provs)\n          }\n        }\n      }\n\n      this._log('Cleanup successful (%dms)', Date.now() - start)\n    })\n  }\n\n  /**\n   * Get the currently known provider peer ids for a given CID.\n   *\n   * @param {CID} cid\n   * @returns {Promise<Map<string, Date>>}\n   *\n   * @private\n   */\n  async _getProvidersMap (cid) {\n    const cacheKey = makeProviderKey(cid)\n    let provs = this.providers.get(cacheKey)\n    if (!provs) {\n      provs = await loadProviders(this.datastore, cid)\n      this.providers.set(cacheKey, provs)\n    }\n    return provs\n  }\n\n  /**\n   * Add a new provider for the given CID.\n   *\n   * @param {CID} cid\n   * @param {PeerId} provider\n   * @returns {Promise<void>}\n   */\n  async addProvider (cid, provider) { // eslint-disable-line require-await\n    return this.syncQueue.add(async () => {\n      this._log('addProvider %s', cid.toBaseEncodedString())\n      const provs = await this._getProvidersMap(cid)\n\n      this._log('loaded %s provs', provs.size)\n      const now = new Date()\n      provs.set(utils.encodeBase32(provider.id), now)\n\n      const dsKey = makeProviderKey(cid)\n      this.providers.set(dsKey, provs)\n      return writeProviderEntry(this.datastore, cid, provider, now)\n    })\n  }\n\n  /**\n   * Get a list of providers for the given CID.\n   *\n   * @param {CID} cid\n   * @returns {Promise<Array<PeerId>>}\n   */\n  async getProviders (cid) { // eslint-disable-line require-await\n    return this.syncQueue.add(async () => {\n      this._log('getProviders %s', cid.toBaseEncodedString())\n      const provs = await this._getProvidersMap(cid)\n      return [...provs.keys()].map((base32PeerId) => {\n        return new PeerId(utils.decodeBase32(base32PeerId))\n      })\n    })\n  }\n}\n\n/**\n * Encode the given key its matching datastore key.\n *\n * @param {CID|string} cid - cid or base32 encoded string\n * @returns {string}\n *\n * @private\n */\nfunction makeProviderKey (cid) {\n  cid = typeof cid === 'string' ? cid : utils.encodeBase32(cid.bytes)\n  return c.PROVIDERS_KEY_PREFIX + cid\n}\n\n/**\n * Write a provider into the given store.\n *\n * @param {Datastore} store\n * @param {CID} cid\n * @param {PeerId} peer\n * @param {Date} time\n */\nasync function writeProviderEntry (store, cid, peer, time) { // eslint-disable-line require-await\n  const dsKey = [\n    makeProviderKey(cid),\n    '/',\n    utils.encodeBase32(peer.id)\n  ].join('')\n\n  const key = new Key(dsKey)\n  const buffer = Uint8Array.from(varint.encode(time.getTime()))\n  return store.put(key, buffer)\n}\n\n/**\n * Parse the CID and provider peer id from the key\n *\n * @param {import('interface-datastore').Key} key\n */\nfunction parseProviderKey (key) {\n  const parts = key.toString().split('/')\n  if (parts.length !== 4) {\n    throw new Error('incorrectly formatted provider entry key in datastore: ' + key)\n  }\n\n  return {\n    cid: parts[2],\n    peerId: parts[3]\n  }\n}\n\n/**\n * Load providers for the given CID from the store.\n *\n * @param {Datastore} store\n * @param {CID} cid\n * @returns {Promise<Map<PeerId, Date>>}\n *\n * @private\n */\nasync function loadProviders (store, cid) {\n  const providers = new Map()\n  const query = store.query({ prefix: makeProviderKey(cid) })\n  for await (const entry of query) {\n    const { peerId } = parseProviderKey(entry.key)\n    providers.set(peerId, readTime(entry.value))\n  }\n  return providers\n}\n\n/**\n * @param {Uint8Array} buf\n */\nfunction readTime (buf) {\n  return varint.decode(buf)\n}\n\nmodule.exports = Providers\n","'use strict'\n\nconst crypto = require('libp2p-crypto')\nconst multihashing = require('multihashing-async')\nconst PeerId = require('peer-id')\nconst { AbortController } = require('abort-controller')\nconst errcode = require('err-code')\nconst times = require('p-times')\nconst c = require('./constants')\nconst { logger } = require('./utils')\n\n/**\n * @typedef {import('./')} DHT\n * @typedef {import('./').RandomWalkOptions} RandomWalkOptions\n */\n\nclass RandomWalk {\n  /**\n   * @class\n   * @param {DHT} dht\n   * @param {RandomWalkOptions} options\n   */\n  constructor (dht, options) {\n    if (!dht) {\n      throw new Error('Random Walk needs an instance of the Kademlia DHT')\n    }\n\n    this._kadDHT = dht\n    this._options = {\n      ...c.defaultRandomWalk,\n      ...options\n    }\n\n    this.log = logger(dht.peerId, 'random-walk')\n    this._timeoutId = undefined\n  }\n\n  /**\n   * Start the Random Walk process. This means running a number of queries\n   * every interval requesting random data. This is done to keep the dht\n   * healthy over time.\n   *\n   * @returns {void}\n   */\n  start () {\n    // Don't run twice\n    if (this._timeoutId || !this._options.enabled) { return }\n\n    // Start doing random walks after `this._options.delay`\n    this._timeoutId = setTimeout(() => {\n      // Start runner immediately\n      this._runPeriodically()\n    }, this._options.delay)\n  }\n\n  /**\n   * Stop the random-walk process. Any active\n   * queries will be aborted.\n   *\n   * @returns {void}\n   */\n  stop () {\n    if (this._timeoutId) {\n      clearTimeout(this._timeoutId)\n      this._timeoutId = undefined\n    }\n    this._controller && this._controller.abort()\n  }\n\n  /**\n   * Run function `randomWalk._walk` on every `options.interval` ms\n   *\n   * @private\n   */\n  async _runPeriodically () {\n    // run until the walk has been stopped\n    while (this._timeoutId) {\n      try {\n        await this._walk(this._options.queriesPerPeriod, this._options.timeout)\n      } catch (err) {\n        this._kadDHT._log.error('random-walk:error', err)\n      }\n      // Each subsequent walk should run on a `this._options.interval` interval\n      await new Promise(resolve => {\n        this._timeoutId = setTimeout(resolve, this._options.interval)\n      })\n    }\n  }\n\n  /**\n   * Do the random walk work.\n   *\n   * @param {number} queries\n   * @param {number} walkTimeout\n   *\n   * @private\n   */\n  async _walk (queries, walkTimeout) {\n    this.log('start')\n    this._controller = new AbortController()\n\n    try {\n      await times(queries, async (index) => {\n        this.log('running query %d', index)\n        try {\n          const id = await this._randomPeerId()\n\n          // Check if we've happened to already abort\n          if (!this._controller) return\n\n          await this._query(id, {\n            timeout: walkTimeout,\n            signal: this._controller.signal\n          })\n        } catch (err) {\n          if (err && err.code !== 'ETIMEDOUT') {\n            this.log.error('query %d finished with error', index, err)\n            throw err\n          }\n        }\n\n        this.log('finished query %d', index)\n      })\n    } finally {\n      this._controller = null\n      this.log('finished queries')\n    }\n  }\n\n  /**\n   * The query run during a random walk request.\n   *\n   * TODO: While query currently supports an abort controller, it is not\n   * yet supported by `DHT.findPeer`. Once https://github.com/libp2p/js-libp2p-kad-dht/pull/82\n   * is complete, and AbortController support has been added to the\n   * DHT query functions, the abort here will just work, provided the\n   * functions support `options.signal`. Once done, this todo should be\n   * removed.\n   *\n   * @param {PeerId} id\n   * @param {object} options\n   * @param {number} options.timeout\n   * @param {AbortSignal} options.signal\n   *\n   * @private\n   */\n  async _query (id, options) {\n    this.log('query:%s', id.toB58String())\n\n    let peer\n    try {\n      peer = await this._kadDHT.findPeer(id, options)\n    } catch (err) {\n      if (err && err.code === 'ERR_NOT_FOUND') {\n        // expected case, we asked for random stuff after all\n        return\n      }\n\n      throw err\n    }\n\n    this.log('query:found', peer)\n\n    // wait what, there was something found? Lucky day!\n    throw errcode(new Error(`random-walk: ACTUALLY FOUND PEER: ${peer}, ${id.toB58String()}`), 'ERR_FOUND_RANDOM_PEER')\n  }\n\n  /**\n   * Generate a random peer id for random-walk purposes.\n   *\n   * @returns {Promise<PeerId>}\n   *\n   * @private\n   */\n  async _randomPeerId () {\n    const digest = await multihashing(crypto.randomBytes(16), 'sha2-256')\n    return new PeerId(digest)\n  }\n}\n\nmodule.exports = RandomWalk\n","'use strict';\nconst pMap = require('p-map');\n\nconst pTimes = async (count, mapper, options) =>\n\tpMap(new Array(count).fill(), (element, index) => mapper(index), options);\n\nmodule.exports = pTimes;\n// TODO: Remove this for the next major release\nmodule.exports.default = pTimes;\n","'use strict'\n\n/**\n * @typedef {import('./query')} Query\n */\n\n/**\n * Keeps track of all running queries.\n */\nclass QueryManager {\n  /**\n   * Creates a new QueryManager.\n   */\n  constructor () {\n    this.queries = new Set()\n    this.running = false\n  }\n\n  /**\n   * Called when a query is started.\n   *\n   * @param {Query} query\n   */\n  queryStarted (query) {\n    this.queries.add(query)\n  }\n\n  /**\n   * Called when a query completes.\n   *\n   * @param {Query} query\n   */\n  queryCompleted (query) {\n    this.queries.delete(query)\n  }\n\n  /**\n   * Starts the query manager.\n   */\n  start () {\n    this.running = true\n  }\n\n  /**\n   * Stops all queries.\n   */\n  stop () {\n    this.running = false\n    for (const query of this.queries) {\n      query.stop()\n    }\n    this.queries.clear()\n  }\n}\n\nmodule.exports = QueryManager\n","'use strict'\n\nconst PeerId = require('peer-id')\nconst { Multiaddr } = require('multiaddr')\nconst mafmt = require('mafmt')\nconst { EventEmitter } = require('events')\nconst debug = require('debug')\n\nconst log = Object.assign(debug('libp2p:bootstrap'), {\n  error: debug('libp2p:bootstrap:error')\n})\n\n/**\n * Emits 'peer' events on a regular interval for each peer in the provided list.\n */\nclass Bootstrap extends EventEmitter {\n  /**\n   * Constructs a new Bootstrap.\n   *\n   * @param {Object} options\n   * @param {Array<string>} options.list - the list of peer addresses in multi-address format\n   * @param {number} [options.interval = 10000] - the interval between emitting addresses in milliseconds\n   *\n   */\n  constructor (options = { list: [] }) {\n    if (!options.list || !options.list.length) {\n      throw new Error('Bootstrap requires a list of peer addresses')\n    }\n    super()\n\n    this._list = options.list\n    this._interval = options.interval || 10000\n    this._timer = null\n  }\n\n  /**\n   * Start emitting events.\n   */\n  start () {\n    if (this._timer) {\n      return\n    }\n\n    this._timer = setInterval(() => this._discoverBootstrapPeers(), this._interval)\n    log('Starting bootstrap node discovery')\n    this._discoverBootstrapPeers()\n  }\n\n  /**\n   * Emit each address in the list as a PeerInfo.\n   */\n  _discoverBootstrapPeers () {\n    if (!this._timer) {\n      return\n    }\n\n    this._list.forEach((candidate) => {\n      if (!mafmt.P2P.matches(candidate)) {\n        return log.error('Invalid multiaddr')\n      }\n\n      const ma = new Multiaddr(candidate)\n      const peerIdStr = ma.getPeerId()\n\n      if (!peerIdStr) {\n        log.error('Invalid bootstrap multiaddr without peer id')\n        return\n      }\n\n      const peerId = PeerId.createFromB58String(peerIdStr)\n\n      try {\n        this.emit('peer', {\n          id: peerId,\n          multiaddrs: [ma]\n        })\n      } catch (err) {\n        log.error('Invalid bootstrap peer id', err)\n      }\n    })\n  }\n\n  /**\n   * Stop emitting events.\n   */\n  stop () {\n    if (this._timer) clearInterval(this._timer)\n    this._timer = null\n  }\n}\n\nexports = module.exports = Bootstrap\nexports.tag = 'bootstrap'\n","'use strict'\n\nconst IPFSBitswap = require('ipfs-bitswap')\nconst createLibP2P = require('./libp2p')\nconst { Multiaddr } = require('multiaddr')\nconst errCode = require('err-code')\n\n/**\n * @typedef {Object} Online\n * @property {libp2p} libp2p\n * @property {Bitswap} bitswap\n *\n * @typedef {Object} Options\n * @property {PeerId} options.peerId\n * @property {Repo} options.repo\n * @property {Print} options.print\n * @property {IPFSOptions} options.options\n *\n * @typedef {import('ipfs-core-types/src/config').Config} IPFSConfig\n * @typedef {import('../types').Options} IPFSOptions\n * @typedef {import('ipfs-repo')} Repo\n * @typedef {import('../types').Print} Print\n * @typedef {import('libp2p')} libp2p\n * @typedef {import('ipfs-bitswap')} Bitswap\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('ipfs-core-types/src/utils').AbortOptions} AbortOptions\n */\n\nclass Network {\n  /**\n   * @param {PeerId} peerId\n   * @param {libp2p} libp2p\n   * @param {Bitswap} bitswap\n   */\n  constructor (peerId, libp2p, bitswap) {\n    this.peerId = peerId\n    this.libp2p = libp2p\n    this.bitswap = bitswap\n  }\n\n  /**\n   * @param {Options} options\n   */\n  static async start ({ peerId, repo, print, options }) {\n    // Need to ensure that repo is open as it could have been closed between\n    // `init` and `start`.\n    if (repo.closed) {\n      await repo.open()\n    }\n\n    /** @type {IPFSConfig} */\n    const config = await repo.config.getAll()\n\n    const libp2p = await createLibP2P({\n      options,\n      repo,\n      peerId,\n      multiaddrs: readAddrs(peerId, config),\n      config,\n      keychainConfig: undefined\n    })\n\n    if (libp2p.keychain) {\n      await libp2p.loadKeychain()\n    }\n\n    await libp2p.start()\n\n    for (const ma of libp2p.multiaddrs) {\n      print(`Swarm listening on ${ma}/p2p/${peerId.toB58String()}`)\n    }\n\n    const bitswap = new IPFSBitswap(libp2p, repo.blocks, { statsEnabled: true })\n    await bitswap.start()\n\n    return new Network(peerId, libp2p, bitswap)\n  }\n\n  /**\n   * @param {Network} network\n   */\n  static async stop (network) {\n    await Promise.all([\n      network.bitswap.stop(),\n      network.libp2p.stop()\n    ])\n  }\n}\nmodule.exports = Network\n\n/**\n * @param {PeerId} peerId\n * @param {IPFSConfig} config\n */\nconst readAddrs = (peerId, config) => {\n  const peerIdStr = peerId.toB58String()\n  /** @type {Multiaddr[]} */\n  const addrs = []\n  const swarm = (config.Addresses && config.Addresses.Swarm) || []\n  for (const addr of swarm) {\n    let ma = new Multiaddr(addr)\n\n    // Temporary error for users migrating using websocket-star multiaddrs for listenning on libp2p\n    // websocket-star support was removed from ipfs and libp2p\n    if (ma.protoCodes().includes(WEBSOCKET_STAR_PROTO_CODE)) {\n      throw errCode(new Error('websocket-star swarm addresses are not supported. See https://github.com/ipfs/js-ipfs/issues/2779'), 'ERR_WEBSOCKET_STAR_SWARM_ADDR_NOT_SUPPORTED')\n    }\n\n    // multiaddrs that go via a signalling server or other intermediary (e.g. stardust,\n    // webrtc-star) can have the intermediary's peer ID in the address, so append our\n    // peer ID to the end of it\n    const maId = ma.getPeerId()\n    if (maId && maId !== peerIdStr) {\n      ma = ma.encapsulate(`/p2p/${peerIdStr}`)\n    }\n\n    addrs.push(ma)\n  }\n\n  return addrs\n}\n\nconst WEBSOCKET_STAR_PROTO_CODE = 479\n","'use strict'\n\nconst WantManager = require('./want-manager')\nconst Network = require('./network')\nconst DecisionEngine = require('./decision-engine')\nconst Notifications = require('./notifications')\nconst logger = require('./utils').logger\nconst Stats = require('./stats')\nconst { AbortController } = require('native-abort-controller')\nconst { anySignal } = require('any-signal')\n\n/**\n * @typedef {import('ipld-block')} Block\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('./types/message')} BitswapMessage\n * @typedef {import('cids')} CID\n */\n\nconst defaultOptions = {\n  statsEnabled: false,\n  statsComputeThrottleTimeout: 1000,\n  statsComputeThrottleMaxQueueSize: 1000\n}\nconst statsKeys = [\n  'blocksReceived',\n  'dataReceived',\n  'dupBlksReceived',\n  'dupDataReceived',\n  'blocksSent',\n  'dataSent',\n  'providesBufferLength',\n  'wantListLength',\n  'peerCount'\n]\n\n/**\n * JavaScript implementation of the Bitswap 'data exchange' protocol\n * used by IPFS.\n */\nclass Bitswap {\n  /**\n   * @param {import('libp2p')} libp2p\n   * @param {import('ipfs-repo').Blockstore} blockstore\n   * @param {Object} [options]\n   * @param {boolean} [options.statsEnabled=false]\n   * @param {number} [options.statsComputeThrottleTimeout=1000]\n   * @param {number} [options.statsComputeThrottleMaxQueueSize=1000]\n   */\n  constructor (libp2p, blockstore, options = {}) {\n    this._libp2p = libp2p\n    this._log = logger(this.peerId)\n\n    this._options = Object.assign({}, defaultOptions, options)\n\n    // stats\n    this._stats = new Stats(statsKeys, {\n      enabled: this._options.statsEnabled,\n      computeThrottleTimeout: this._options.statsComputeThrottleTimeout,\n      computeThrottleMaxQueueSize: this._options.statsComputeThrottleMaxQueueSize\n    })\n\n    // the network delivers messages\n    this.network = new Network(libp2p, this, this._stats)\n\n    // local database\n    this.blockstore = blockstore\n\n    this.engine = new DecisionEngine(this.peerId, blockstore, this.network, this._stats)\n\n    // handle message sending\n    this.wm = new WantManager(this.peerId, this.network, this._stats)\n\n    this.notifications = new Notifications(this.peerId)\n  }\n\n  /**\n   * @type {PeerId}\n   */\n  get peerId () {\n    return this._libp2p.peerId\n  }\n\n  /**\n   * handle messages received through the network\n   *\n   * @param {PeerId} peerId\n   * @param {BitswapMessage} incoming\n   */\n  async _receiveMessage (peerId, incoming) {\n    try {\n      // Note: this allows the engine to respond to any wants in the message.\n      // Processing of the blocks in the message happens below, after the\n      // blocks have been added to the blockstore.\n      await this.engine.messageReceived(peerId, incoming)\n    } catch (err) {\n      // Log instead of throwing an error so as to process as much as\n      // possible of the message. Currently `messageReceived` does not\n      // throw any errors, but this could change in the future.\n      this._log('failed to receive message', incoming)\n    }\n\n    if (incoming.blocks.size === 0) {\n      return\n    }\n\n    const blocks = Array.from(incoming.blocks.values())\n\n    // quickly send out cancels, reduces chances of duplicate block receives\n    const wanted = blocks\n      .filter((b) => this.wm.wantlist.contains(b.cid))\n      .map((b) => b.cid)\n\n    this.wm.cancelWants(wanted)\n\n    await Promise.all(blocks.map(async (b) => {\n      const wasWanted = wanted.includes(b.cid)\n      await this._handleReceivedBlock(peerId, b, wasWanted)\n    }))\n  }\n\n  /**\n   * @private\n   * @param {PeerId} peerId\n   * @param {Block} block\n   * @param {boolean} wasWanted\n   */\n  async _handleReceivedBlock (peerId, block, wasWanted) {\n    this._log('received block')\n\n    const has = await this.blockstore.has(block.cid)\n\n    this._updateReceiveCounters(peerId.toB58String(), block, has)\n\n    if (!wasWanted) {\n      return\n    }\n\n    await this.put(block)\n  }\n\n  /**\n   * @private\n   * @param {string} peerIdStr\n   * @param {Block} block\n   * @param {boolean} exists\n   */\n  _updateReceiveCounters (peerIdStr, block, exists) {\n    this._stats.push(peerIdStr, 'blocksReceived', 1)\n    this._stats.push(peerIdStr, 'dataReceived', block.data.length)\n\n    if (exists) {\n      this._stats.push(peerIdStr, 'dupBlksReceived', 1)\n      this._stats.push(peerIdStr, 'dupDataReceived', block.data.length)\n    }\n  }\n\n  /**\n   * handle errors on the receiving channel\n   *\n   * @param {Error} err\n   */\n  _receiveError (err) {\n    this._log.error('ReceiveError: %s', err.message)\n  }\n\n  /**\n   * handle new peers\n   *\n   * @param {PeerId} peerId\n   */\n  _onPeerConnected (peerId) {\n    this.wm.connected(peerId)\n  }\n\n  /**\n   * handle peers being disconnected\n   *\n   * @param {PeerId} peerId\n   */\n  _onPeerDisconnected (peerId) {\n    this.wm.disconnected(peerId)\n    this.engine.peerDisconnected(peerId)\n    this._stats.disconnected(peerId)\n  }\n\n  enableStats () {\n    this._stats.enable()\n  }\n\n  disableStats () {\n    this._stats.disable()\n  }\n\n  /**\n   * Return the current wantlist for a given `peerId`\n   *\n   * @param {PeerId} peerId\n   * @param {any} [_options]\n   */\n  wantlistForPeer (peerId, _options) {\n    return this.engine.wantlistForPeer(peerId)\n  }\n\n  /**\n   * Return ledger information for a given `peerId`\n   *\n   * @param {PeerId} peerId\n   */\n  ledgerForPeer (peerId) {\n    return this.engine.ledgerForPeer(peerId)\n  }\n\n  /**\n   * Fetch a given block by cid. If the block is in the local\n   * blockstore it is returned, otherwise the block is added to the wantlist and returned once another node sends it to us.\n   *\n   * @param {CID} cid\n   * @param {Object} [options]\n   * @param {AbortSignal} [options.signal]\n   */\n  async get (cid, options = {}) {\n    /**\n     * @param {CID} cid\n     * @param {Object} options\n     * @param {AbortSignal} options.signal\n     */\n    const fetchFromNetwork = (cid, options) => {\n      // add it to the want list - n.b. later we will abort the AbortSignal\n      // so no need to remove the blocks from the wantlist after we have it\n      this.wm.wantBlocks([cid], options)\n\n      return this.notifications.wantBlock(cid, options)\n    }\n\n    let promptedNetwork = false\n\n    /**\n     *\n     * @param {CID} cid\n     * @param {Object} options\n     * @param {AbortSignal} options.signal\n     */\n    const loadOrFetchFromNetwork = async (cid, options) => {\n      try {\n        // have to await here as we want to handle ERR_NOT_FOUND\n        const block = await this.blockstore.get(cid, options)\n\n        return block\n      } catch (err) {\n        if (err.code !== 'ERR_NOT_FOUND') {\n          throw err\n        }\n\n        if (!promptedNetwork) {\n          promptedNetwork = true\n\n          this.network.findAndConnect(cid)\n            .catch((err) => this._log.error(err))\n        }\n\n        // we don't have the block locally so fetch it from the network\n        return fetchFromNetwork(cid, options)\n      }\n    }\n\n    // depending on implementation it's possible for blocks to come in while\n    // we do the async operations to get them from the blockstore leading to\n    // a race condition, so register for incoming block notifications as well\n    // as trying to get it from the datastore\n    const controller = new AbortController()\n    const signal = options.signal\n      ? anySignal([options.signal, controller.signal])\n      : controller.signal\n\n    const block = await Promise.race([\n      this.notifications.wantBlock(cid, {\n        signal\n      }),\n      loadOrFetchFromNetwork(cid, {\n        signal\n      })\n    ])\n\n    // since we have the block we can now remove our listener\n    controller.abort()\n\n    return block\n  }\n\n  /**\n   * Fetch a a list of blocks by cid. If the blocks are in the local\n   * blockstore they are returned, otherwise the blocks are added to the wantlist and returned once another node sends them to us.\n   *\n   * @param {AsyncIterable<CID>|Iterable<CID>} cids\n   * @param {Object} [options]\n   * @param {AbortSignal} [options.signal]\n   */\n  async * getMany (cids, options = {}) {\n    for await (const cid of cids) {\n      yield this.get(cid, options)\n    }\n  }\n\n  /**\n   * Removes the given CIDs from the wantlist independent of any ref counts.\n   *\n   * This will cause all outstanding promises for a given block to reject.\n   *\n   * If you want to cancel the want for a block without doing that, pass an\n   * AbortSignal in to `.get` or `.getMany` and abort it.\n   *\n   * @param {CID[]|CID} cids\n   */\n  unwant (cids) {\n    const cidsArray = Array.isArray(cids) ? cids : [cids]\n\n    this.wm.unwantBlocks(cidsArray)\n    cidsArray.forEach((cid) => this.notifications.unwantBlock(cid))\n  }\n\n  /**\n   * Removes the given keys from the want list. This may cause pending promises\n   * for blocks to never resolve.  If you wish these promises to abort instead\n   * call `unwant(cids)` instead.\n   *\n   * @param {CID[]|CID} cids\n   */\n  cancelWants (cids) {\n    this.wm.cancelWants(Array.isArray(cids) ? cids : [cids])\n  }\n\n  /**\n   * Put the given block to the underlying blockstore and\n   * send it to nodes that have it in their wantlist.\n   *\n   * @param {Block} block\n   * @param {any} [_options]\n   */\n  async put (block, _options) {\n    await this.blockstore.put(block)\n    this._sendHaveBlockNotifications(block)\n  }\n\n  /**\n   * Put the given blocks to the underlying blockstore and\n   * send it to nodes that have it them their wantlist.\n   *\n   * @param {AsyncIterable<Block>|Iterable<Block>} blocks\n   */\n  async * putMany (blocks) {\n    for await (const block of this.blockstore.putMany(blocks)) {\n      this._sendHaveBlockNotifications(block)\n\n      yield block\n    }\n  }\n\n  /**\n   * Sends notifications about the arrival of a block\n   *\n   * @private\n   * @param {Block} block\n   */\n  _sendHaveBlockNotifications (block) {\n    this.notifications.hasBlock(block)\n    this.engine.receivedBlocks([block])\n    // Note: Don't wait for provide to finish before returning\n    this.network.provide(block.cid).catch((err) => {\n      this._log.error('Failed to provide: %s', err.message)\n    })\n  }\n\n  /**\n   * Get the current list of wants\n   */\n  getWantlist () {\n    return this.wm.wantlist.entries()\n  }\n\n  /**\n   * Get the current list of partners\n   */\n  peers () {\n    return this.engine.peers()\n  }\n\n  /**\n   * Get stats about the bitswap node\n   */\n  stat () {\n    return this._stats\n  }\n\n  /**\n   * Start the bitswap node\n   */\n  start () {\n    this.wm.start()\n    this.network.start()\n    this.engine.start()\n  }\n\n  /**\n   * Stop the bitswap node\n   */\n  stop () {\n    this._stats.stop()\n    this.wm.stop()\n    this.network.stop()\n    this.engine.stop()\n  }\n}\n\nmodule.exports = Bitswap\n","'use strict'\n\nconst Message = require('../types/message')\nconst Wantlist = require('../types/wantlist')\nconst CONSTANTS = require('../constants')\nconst MsgQueue = require('./msg-queue')\nconst logger = require('../utils').logger\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('cids')} CID\n */\n\nmodule.exports = class WantManager {\n  /**\n   * @param {PeerId} peerId\n   * @param {import('../network')} network\n   * @param {import('../stats')} stats\n   */\n  constructor (peerId, network, stats) {\n    /** @type {Map<string, MsgQueue>} */\n    this.peers = new Map()\n    this.wantlist = new Wantlist(stats)\n\n    this.network = network\n    this._stats = stats\n\n    this._peerId = peerId\n    this._log = logger(peerId, 'want')\n  }\n\n  /**\n   * @private\n   * @param {CID[]} cids\n   * @param {boolean} cancel\n   * @param {boolean} [force]\n   */\n  _addEntries (cids, cancel, force) {\n    const entries = cids.map((cid, i) => {\n      return new Message.Entry(cid, CONSTANTS.kMaxPriority - i, Message.WantType.Block, cancel)\n    })\n\n    entries.forEach((e) => {\n      // add changes to our wantlist\n      if (e.cancel) {\n        if (force) {\n          this.wantlist.removeForce(e.cid.toString())\n        } else {\n          this.wantlist.remove(e.cid)\n        }\n      } else {\n        this._log('adding to wl')\n        // TODO: Figure out the wantType\n        // @ts-expect-error - requires wantType\n        this.wantlist.add(e.cid, e.priority)\n      }\n    })\n\n    // broadcast changes\n    for (const p of this.peers.values()) {\n      p.addEntries(entries)\n    }\n  }\n\n  /**\n   * @private\n   * @param {PeerId} peerId\n   */\n  _startPeerHandler (peerId) {\n    let mq = this.peers.get(peerId.toB58String())\n\n    if (mq) {\n      mq.refcnt++\n      return\n    }\n\n    mq = new MsgQueue(this._peerId, peerId, this.network)\n\n    // new peer, give them the full wantlist\n    const fullwantlist = new Message(true)\n\n    for (const entry of this.wantlist.entries()) {\n      fullwantlist.addEntry(entry[1].cid, entry[1].priority)\n    }\n\n    mq.addMessage(fullwantlist)\n\n    this.peers.set(peerId.toB58String(), mq)\n    return mq\n  }\n\n  /**\n   * @private\n   * @param {PeerId} peerId\n   */\n  _stopPeerHandler (peerId) {\n    const mq = this.peers.get(peerId.toB58String())\n\n    if (!mq) {\n      return\n    }\n\n    mq.refcnt--\n    if (mq.refcnt > 0) {\n      return\n    }\n\n    this.peers.delete(peerId.toB58String())\n  }\n\n  /**\n   * add all the cids to the wantlist\n   *\n   * @param {CID[]} cids\n   * @param {Object} [options]\n   * @param {AbortSignal} [options.signal]\n   */\n  wantBlocks (cids, options = {}) {\n    this._addEntries(cids, false)\n\n    if (options && options.signal) {\n      options.signal.addEventListener('abort', () => {\n        this.cancelWants(cids)\n      })\n    }\n  }\n\n  /**\n   * Remove blocks of all the given keys without respecting refcounts\n   *\n   * @param {CID[]} cids\n   */\n  unwantBlocks (cids) {\n    this._log('unwant blocks: %s', cids.length)\n    this._addEntries(cids, true, true)\n  }\n\n  /**\n   * Cancel wanting all of the given keys\n   *\n   * @param {CID[]} cids\n   */\n  cancelWants (cids) {\n    this._log('cancel wants: %s', cids.length)\n    this._addEntries(cids, true)\n  }\n\n  /**\n   * Returns a list of all currently connected peers\n   */\n  connectedPeers () {\n    return Array.from(this.peers.keys())\n  }\n\n  /**\n   * @param {PeerId} peerId\n   */\n  connected (peerId) {\n    this._startPeerHandler(peerId)\n  }\n\n  /**\n   * @param {PeerId} peerId\n   */\n  disconnected (peerId) {\n    this._stopPeerHandler(peerId)\n  }\n\n  start () {\n  }\n\n  stop () {\n    this.peers.forEach((mq) => this.disconnected(mq.peerId))\n  }\n}\n","'use strict'\n\nconst IPLDBlock = require('ipld-block')\nconst CID = require('cids')\nconst { getName } = require('multicodec')\n// @ts-ignore\nconst vd = require('varint-decoder')\nconst multihashing = require('multihashing-async')\nconst { isMapEqual } = require('../../utils')\nconst { Message } = require('./message')\nconst Entry = require('./entry')\n\nclass BitswapMessage {\n  /**\n   * @param {boolean} full\n   */\n  constructor (full) {\n    this.full = full\n    /** @type {Map<string, Entry>} */\n    this.wantlist = new Map()\n\n    /** @type {Map<string, import('ipld-block')>} */\n    this.blocks = new Map()\n\n    /** @type {Map<string, import('./message').Message.BlockPresenceType>} */\n    this.blockPresences = new Map()\n    this.pendingBytes = 0\n  }\n\n  get empty () {\n    return this.blocks.size === 0 &&\n           this.wantlist.size === 0 &&\n           this.blockPresences.size === 0\n  }\n\n  /**\n   *\n   * @param {CID} cid\n   * @param {number} priority\n   * @param {import('./message').Message.Wantlist.WantType | null} [wantType]\n   * @param {boolean} [cancel]\n   * @param {boolean} [sendDontHave]\n   * @returns {void}\n   */\n  addEntry (cid, priority, wantType, cancel, sendDontHave) {\n    if (wantType == null) {\n      wantType = BitswapMessage.WantType.Block\n    }\n\n    const cidStr = cid.toString('base58btc')\n    const entry = this.wantlist.get(cidStr)\n    if (entry) {\n      // Only change priority if want is of the same type\n      if (entry.wantType === wantType) {\n        entry.priority = priority\n      }\n      // Only change from \"dont cancel\" to \"do cancel\"\n      if (cancel) {\n        entry.cancel = Boolean(cancel)\n      }\n      // Only change from \"dont send\" to \"do send\" DONT_HAVE\n      if (sendDontHave) {\n        entry.sendDontHave = Boolean(sendDontHave)\n      }\n      // want-block overrides existing want-have\n      if (wantType === BitswapMessage.WantType.Block && entry.wantType === BitswapMessage.WantType.Have) {\n        entry.wantType = wantType\n      }\n    } else {\n      this.wantlist.set(cidStr, new Entry(cid, priority, wantType, cancel, sendDontHave))\n    }\n  }\n\n  /**\n   * @param {import('ipld-block')} block\n   * @returns {void}\n   */\n  addBlock (block) {\n    const cidStr = block.cid.toString('base58btc')\n    this.blocks.set(cidStr, block)\n  }\n\n  /**\n   * @param {CID} cid\n   */\n  addHave (cid) {\n    const cidStr = cid.toString('base58btc')\n    if (!this.blockPresences.has(cidStr)) {\n      this.blockPresences.set(cidStr, BitswapMessage.BlockPresenceType.Have)\n    }\n  }\n\n  /**\n   * @param {CID} cid\n   */\n  addDontHave (cid) {\n    const cidStr = cid.toString('base58btc')\n    if (!this.blockPresences.has(cidStr)) {\n      this.blockPresences.set(cidStr, BitswapMessage.BlockPresenceType.DontHave)\n    }\n  }\n\n  /**\n   * @param {CID} cid\n   */\n  cancel (cid) {\n    const cidStr = cid.toString('base58btc')\n    this.wantlist.delete(cidStr)\n    this.addEntry(cid, 0, BitswapMessage.WantType.Block, true, false)\n  }\n\n  /**\n   * @param {number} size\n   */\n  setPendingBytes (size) {\n    this.pendingBytes = size\n  }\n\n  /**\n   * Serializes to Bitswap Message protobuf of\n   * version 1.0.0\n   *\n   * @returns {Uint8Array}\n   */\n  serializeToBitswap100 () {\n    const msg = {\n      wantlist: {\n        entries: Array.from(this.wantlist.values()).map((entry) => {\n          return {\n            block: entry.cid.bytes, // cid\n            priority: Number(entry.priority),\n            cancel: Boolean(entry.cancel)\n          }\n        }),\n        full: this.full ? true : undefined\n      },\n      blocks: Array.from(this.blocks.values())\n        .map((block) => block.data)\n    }\n\n    return Message.encode(msg).finish()\n  }\n\n  /**\n   * Serializes to Bitswap Message protobuf of\n   * version 1.1.0\n   *\n   * @returns {Uint8Array}\n   */\n  serializeToBitswap110 () {\n    const msg = {\n      wantlist: {\n        entries: Array.from(this.wantlist.values()).map((entry) => {\n          return {\n            block: entry.cid.bytes, // cid\n            priority: Number(entry.priority),\n            wantType: entry.wantType,\n            cancel: Boolean(entry.cancel),\n            sendDontHave: Boolean(entry.sendDontHave)\n          }\n        }),\n        full: this.full ? true : undefined\n      },\n      /** @type {import('./message').Message.BlockPresence[]} */\n      blockPresences: [],\n\n      /** @type {{ prefix: Uint8Array, data: Uint8Array }[]} */\n      payload: [],\n      pendingBytes: this.pendingBytes\n    }\n\n    this.blocks.forEach((block) => {\n      msg.payload.push(\n        new Message.Block({\n          prefix: block.cid.prefix,\n          data: block.data\n        })\n      )\n    })\n\n    for (const [cidStr, bpType] of this.blockPresences) {\n      msg.blockPresences.push(new Message.BlockPresence({\n        cid: new CID(cidStr).bytes,\n        type: bpType\n      }))\n    }\n\n    if (this.pendingBytes > 0) {\n      msg.pendingBytes = this.pendingBytes\n    }\n\n    return Message.encode(msg).finish()\n  }\n\n  /**\n   * @param {BitswapMessage} other\n   * @returns {boolean}\n   */\n  equals (other) {\n    if (this.full !== other.full ||\n        this.pendingBytes !== other.pendingBytes ||\n        !isMapEqual(this.wantlist, other.wantlist) ||\n        !isMapEqual(this.blocks, other.blocks) ||\n        // @TODO - Is this a bug ?\n        // @ts-expect-error - isMap equals map values to be objects not numbers\n        !isMapEqual(this.blockPresences, other.blockPresences)\n    ) {\n      return false\n    }\n\n    return true\n  }\n\n  get [Symbol.toStringTag] () {\n    const list = Array.from(this.wantlist.keys())\n    const blocks = Array.from(this.blocks.keys())\n    return `BitswapMessage <full: ${this.full}, list: ${list}, blocks: ${blocks}>`\n  }\n}\n\n/**\n * @param {Uint8Array} raw\n */\nBitswapMessage.deserialize = async (raw) => {\n  const decoded = Message.decode(raw)\n\n  const isFull = (decoded.wantlist && decoded.wantlist.full) || false\n  const msg = new BitswapMessage(isFull)\n\n  if (decoded.wantlist && decoded.wantlist.entries) {\n    decoded.wantlist.entries.forEach((entry) => {\n      if (!entry.block) {\n        return\n      }\n      // note: entry.block is the CID here\n      const cid = new CID(entry.block)\n      msg.addEntry(cid, entry.priority || 0, entry.wantType, Boolean(entry.cancel), Boolean(entry.sendDontHave))\n    })\n  }\n\n  if (decoded.blockPresences) {\n    decoded.blockPresences.forEach((blockPresence) => {\n      if (!blockPresence.cid) {\n        return\n      }\n\n      const cid = new CID(blockPresence.cid)\n\n      if (blockPresence.type === BitswapMessage.BlockPresenceType.Have) {\n        msg.addHave(cid)\n      } else {\n        msg.addDontHave(cid)\n      }\n    })\n  }\n\n  // Bitswap 1.0.0\n  // decoded.blocks are just the byte arrays\n  if (decoded.blocks.length > 0) {\n    await Promise.all(decoded.blocks.map(async (b) => {\n      const hash = await multihashing(b, 'sha2-256')\n      const cid = new CID(hash)\n      msg.addBlock(new IPLDBlock(b, cid))\n    }))\n    return msg\n  }\n\n  // Bitswap 1.1.0\n  if (decoded.payload.length > 0) {\n    await Promise.all(decoded.payload.map(async (p) => {\n      if (!p.prefix || !p.data) {\n        return\n      }\n      const values = vd(p.prefix)\n      const cidVersion = values[0]\n      const multicodec = values[1]\n      const hashAlg = values[2]\n      // const hashLen = values[3] // We haven't need to use this so far\n      const hash = await multihashing(p.data, hashAlg)\n      const cid = new CID(cidVersion, getName(multicodec), hash)\n      msg.addBlock(new IPLDBlock(p.data, cid))\n    }))\n    msg.setPendingBytes(decoded.pendingBytes)\n    return msg\n  }\n\n  return msg\n}\n\n/**\n * @param {CID} cid\n */\nBitswapMessage.blockPresenceSize = (cid) => {\n  // It's ok if this is not exactly right: it's used to estimate the size of\n  // the HAVE / DONT_HAVE on the wire, but when doing that calculation we leave\n  // plenty of padding under the maximum message size.\n  // (It's more important for this to be fast).\n  return cid.bytes.length + 1\n}\n\nBitswapMessage.Entry = Entry\nBitswapMessage.WantType = {\n  Block: Message.Wantlist.WantType.Block,\n  Have: Message.Wantlist.WantType.Have\n}\nBitswapMessage.BlockPresenceType = {\n  Have: Message.BlockPresenceType.Have,\n  DontHave: Message.BlockPresenceType.DontHave\n}\nmodule.exports = BitswapMessage\n","'use strict'\n\nconst varint = require('varint')\n\nmodule.exports = (buf) => {\n  if (!(buf instanceof Uint8Array)) {\n    throw new Error('arg needs to be a Uint8Array')\n  }\n\n  const result = []\n\n  while (buf.length > 0) {\n    const num = varint.decode(buf)\n    result.push(num)\n    buf = buf.slice(varint.decode.bytes)\n  }\n\n  return result\n}\n","module.exports = {\n    encode: require('./encode.js')\n  , decode: require('./decode.js')\n  , encodingLength: require('./length.js')\n}\n","module.exports = encode\n\nvar MSB = 0x80\n  , REST = 0x7F\n  , MSBALL = ~REST\n  , INT = Math.pow(2, 31)\n\nfunction encode(num, out, offset) {\n  out = out || []\n  offset = offset || 0\n  var oldOffset = offset\n\n  while(num >= INT) {\n    out[offset++] = (num & 0xFF) | MSB\n    num /= 128\n  }\n  while(num & MSBALL) {\n    out[offset++] = (num & 0xFF) | MSB\n    num >>>= 7\n  }\n  out[offset] = num | 0\n  \n  encode.bytes = offset - oldOffset + 1\n  \n  return out\n}\n","module.exports = read\n\nvar MSB = 0x80\n  , REST = 0x7F\n\nfunction read(buf, offset) {\n  var res    = 0\n    , offset = offset || 0\n    , shift  = 0\n    , counter = offset\n    , b\n    , l = buf.length\n\n  do {\n    if (counter >= l) {\n      read.bytes = 0\n      throw new RangeError('Could not decode varint')\n    }\n    b = buf[counter++]\n    res += shift < 28\n      ? (b & REST) << shift\n      : (b & REST) * Math.pow(2, shift)\n    shift += 7\n  } while (b >= MSB)\n\n  read.bytes = counter - offset\n\n  return res\n}\n","\nvar N1 = Math.pow(2,  7)\nvar N2 = Math.pow(2, 14)\nvar N3 = Math.pow(2, 21)\nvar N4 = Math.pow(2, 28)\nvar N5 = Math.pow(2, 35)\nvar N6 = Math.pow(2, 42)\nvar N7 = Math.pow(2, 49)\nvar N8 = Math.pow(2, 56)\nvar N9 = Math.pow(2, 63)\n\nmodule.exports = function (value) {\n  return (\n    value < N1 ? 1\n  : value < N2 ? 2\n  : value < N3 ? 3\n  : value < N4 ? 4\n  : value < N5 ? 5\n  : value < N6 ? 6\n  : value < N7 ? 7\n  : value < N8 ? 8\n  : value < N9 ? 9\n  :              10\n  )\n}\n","'use strict'\n\nconst debug = require('debug')\nconst uint8ArrayEquals = require('uint8arrays/equals')\n\n/**\n * Creates a logger for the given subsystem\n *\n * @param {import('peer-id')} [id]\n * @param {string} [subsystem]\n */\nconst logger = (id, subsystem) => {\n  const name = ['bitswap']\n  if (subsystem) {\n    name.push(subsystem)\n  }\n  if (id) {\n    name.push(`${id.toB58String().slice(0, 8)}`)\n  }\n\n  return Object.assign(debug(name.join(':')), {\n    error: debug(name.concat(['error']).join(':'))\n  })\n}\n\n/**\n * @template X, T\n * @param {(x:X, t:T) => boolean} pred\n * @param {X} x\n * @param {T[]} list\n * @returns {boolean}\n */\nconst includesWith = (pred, x, list) => {\n  let idx = 0\n  const len = list.length\n  while (idx < len) {\n    if (pred(x, list[idx])) {\n      return true\n    }\n    idx += 1\n  }\n  return false\n}\n\n/**\n * @template T\n * @param {(x:T, t:T) => boolean} pred\n * @param {T[]} list\n * @returns {T[]}\n */\nconst uniqWith = (pred, list) => {\n  let idx = 0\n  const len = list.length\n  const result = []\n  let item\n\n  while (idx < len) {\n    item = list[idx]\n    if (!includesWith(pred, item, result)) {\n      result[result.length] = item\n    }\n    idx += 1\n  }\n  return result\n}\n\n/**\n * @template {string|number|symbol} K\n * @template V\n * @param {(v:V) => K} pred\n * @param {V[]} list\n * @returns {Record<K, V[]>}\n */\nconst groupBy = (pred, list) => {\n  return list.reduce((acc, v) => {\n    const k = pred(v)\n\n    if (acc[k]) {\n      acc[k].push(v)\n    } else {\n      acc[k] = [v]\n    }\n    return acc\n  }, /** @type {Record<K, V[]>} */({}))\n}\n\n/**\n * @template T, E\n * @param {(a:T, b:E) => boolean} pred\n * @param {T[]} list\n * @param {E[]} values\n * @returns {T[]}\n */\nconst pullAllWith = (pred, list, values) => {\n  return list.filter(i => {\n    return !includesWith(pred, i, values)\n  })\n}\n\n/**\n * @template T\n * @param {(v:T) => number} fn\n * @param {T[]} list\n * @returns {T[]}\n */\nconst sortBy = (fn, list) => {\n  return Array.prototype.slice.call(list, 0).sort((a, b) => {\n    const aa = fn(a)\n    const bb = fn(b)\n    return aa < bb ? -1 : aa > bb ? 1 : 0\n  })\n}\n\n/**\n * Is equal for Maps of BitswapMessageEntry or Blocks\n *\n * @template {{data?:Uint8Array, equals?: (value:any) => boolean}} T\n * @param {Map<string, T>} a\n * @param {Map<string, T>} b\n * @returns {boolean}\n */\nconst isMapEqual = (a, b) => {\n  if (a.size !== b.size) {\n    return false\n  }\n\n  for (const [key, valueA] of a) {\n    const valueB = b.get(key)\n\n    if (valueB === undefined) {\n      return false\n    }\n\n    // Support BitswapMessageEntry\n    if (typeof valueA.equals === 'function' && !valueA.equals(valueB)) {\n      return false\n    }\n    // Support Blocks\n    if (valueA.data && !(valueB.data && uint8ArrayEquals(valueA.data, valueB.data))) {\n      return false\n    }\n  }\n\n  return true\n}\n\nmodule.exports = {\n  logger,\n  includesWith,\n  uniqWith,\n  groupBy,\n  pullAllWith,\n  sortBy,\n  isMapEqual\n}\n","/*eslint-disable*/\n\"use strict\";\n\nvar $protobuf = require(\"protobufjs/minimal\");\n\n// Common aliases\nvar $Reader = $protobuf.Reader, $Writer = $protobuf.Writer, $util = $protobuf.util;\n\n// Exported root namespace\nvar $root = $protobuf.roots[\"ipfs-bitswap\"] || ($protobuf.roots[\"ipfs-bitswap\"] = {});\n\n$root.Message = (function() {\n\n    /**\n     * Properties of a Message.\n     * @exports IMessage\n     * @interface IMessage\n     * @property {Message.IWantlist|null} [wantlist] Message wantlist\n     * @property {Array.<Uint8Array>|null} [blocks] Message blocks\n     * @property {Array.<Message.IBlock>|null} [payload] Message payload\n     * @property {Array.<Message.IBlockPresence>|null} [blockPresences] Message blockPresences\n     * @property {number|null} [pendingBytes] Message pendingBytes\n     */\n\n    /**\n     * Constructs a new Message.\n     * @exports Message\n     * @classdesc Represents a Message.\n     * @implements IMessage\n     * @constructor\n     * @param {IMessage=} [p] Properties to set\n     */\n    function Message(p) {\n        this.blocks = [];\n        this.payload = [];\n        this.blockPresences = [];\n        if (p)\n            for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                if (p[ks[i]] != null)\n                    this[ks[i]] = p[ks[i]];\n    }\n\n    /**\n     * Message wantlist.\n     * @member {Message.IWantlist|null|undefined} wantlist\n     * @memberof Message\n     * @instance\n     */\n    Message.prototype.wantlist = null;\n\n    /**\n     * Message blocks.\n     * @member {Array.<Uint8Array>} blocks\n     * @memberof Message\n     * @instance\n     */\n    Message.prototype.blocks = $util.emptyArray;\n\n    /**\n     * Message payload.\n     * @member {Array.<Message.IBlock>} payload\n     * @memberof Message\n     * @instance\n     */\n    Message.prototype.payload = $util.emptyArray;\n\n    /**\n     * Message blockPresences.\n     * @member {Array.<Message.IBlockPresence>} blockPresences\n     * @memberof Message\n     * @instance\n     */\n    Message.prototype.blockPresences = $util.emptyArray;\n\n    /**\n     * Message pendingBytes.\n     * @member {number} pendingBytes\n     * @memberof Message\n     * @instance\n     */\n    Message.prototype.pendingBytes = 0;\n\n    /**\n     * Encodes the specified Message message. Does not implicitly {@link Message.verify|verify} messages.\n     * @function encode\n     * @memberof Message\n     * @static\n     * @param {IMessage} m Message message or plain object to encode\n     * @param {$protobuf.Writer} [w] Writer to encode to\n     * @returns {$protobuf.Writer} Writer\n     */\n    Message.encode = function encode(m, w) {\n        if (!w)\n            w = $Writer.create();\n        if (m.wantlist != null && Object.hasOwnProperty.call(m, \"wantlist\"))\n            $root.Message.Wantlist.encode(m.wantlist, w.uint32(10).fork()).ldelim();\n        if (m.blocks != null && m.blocks.length) {\n            for (var i = 0; i < m.blocks.length; ++i)\n                w.uint32(18).bytes(m.blocks[i]);\n        }\n        if (m.payload != null && m.payload.length) {\n            for (var i = 0; i < m.payload.length; ++i)\n                $root.Message.Block.encode(m.payload[i], w.uint32(26).fork()).ldelim();\n        }\n        if (m.blockPresences != null && m.blockPresences.length) {\n            for (var i = 0; i < m.blockPresences.length; ++i)\n                $root.Message.BlockPresence.encode(m.blockPresences[i], w.uint32(34).fork()).ldelim();\n        }\n        if (m.pendingBytes != null && Object.hasOwnProperty.call(m, \"pendingBytes\"))\n            w.uint32(40).int32(m.pendingBytes);\n        return w;\n    };\n\n    /**\n     * Decodes a Message message from the specified reader or buffer.\n     * @function decode\n     * @memberof Message\n     * @static\n     * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n     * @param {number} [l] Message length if known beforehand\n     * @returns {Message} Message\n     * @throws {Error} If the payload is not a reader or valid buffer\n     * @throws {$protobuf.util.ProtocolError} If required fields are missing\n     */\n    Message.decode = function decode(r, l) {\n        if (!(r instanceof $Reader))\n            r = $Reader.create(r);\n        var c = l === undefined ? r.len : r.pos + l, m = new $root.Message();\n        while (r.pos < c) {\n            var t = r.uint32();\n            switch (t >>> 3) {\n            case 1:\n                m.wantlist = $root.Message.Wantlist.decode(r, r.uint32());\n                break;\n            case 2:\n                if (!(m.blocks && m.blocks.length))\n                    m.blocks = [];\n                m.blocks.push(r.bytes());\n                break;\n            case 3:\n                if (!(m.payload && m.payload.length))\n                    m.payload = [];\n                m.payload.push($root.Message.Block.decode(r, r.uint32()));\n                break;\n            case 4:\n                if (!(m.blockPresences && m.blockPresences.length))\n                    m.blockPresences = [];\n                m.blockPresences.push($root.Message.BlockPresence.decode(r, r.uint32()));\n                break;\n            case 5:\n                m.pendingBytes = r.int32();\n                break;\n            default:\n                r.skipType(t & 7);\n                break;\n            }\n        }\n        return m;\n    };\n\n    /**\n     * Creates a Message message from a plain object. Also converts values to their respective internal types.\n     * @function fromObject\n     * @memberof Message\n     * @static\n     * @param {Object.<string,*>} d Plain object\n     * @returns {Message} Message\n     */\n    Message.fromObject = function fromObject(d) {\n        if (d instanceof $root.Message)\n            return d;\n        var m = new $root.Message();\n        if (d.wantlist != null) {\n            if (typeof d.wantlist !== \"object\")\n                throw TypeError(\".Message.wantlist: object expected\");\n            m.wantlist = $root.Message.Wantlist.fromObject(d.wantlist);\n        }\n        if (d.blocks) {\n            if (!Array.isArray(d.blocks))\n                throw TypeError(\".Message.blocks: array expected\");\n            m.blocks = [];\n            for (var i = 0; i < d.blocks.length; ++i) {\n                if (typeof d.blocks[i] === \"string\")\n                    $util.base64.decode(d.blocks[i], m.blocks[i] = $util.newBuffer($util.base64.length(d.blocks[i])), 0);\n                else if (d.blocks[i].length)\n                    m.blocks[i] = d.blocks[i];\n            }\n        }\n        if (d.payload) {\n            if (!Array.isArray(d.payload))\n                throw TypeError(\".Message.payload: array expected\");\n            m.payload = [];\n            for (var i = 0; i < d.payload.length; ++i) {\n                if (typeof d.payload[i] !== \"object\")\n                    throw TypeError(\".Message.payload: object expected\");\n                m.payload[i] = $root.Message.Block.fromObject(d.payload[i]);\n            }\n        }\n        if (d.blockPresences) {\n            if (!Array.isArray(d.blockPresences))\n                throw TypeError(\".Message.blockPresences: array expected\");\n            m.blockPresences = [];\n            for (var i = 0; i < d.blockPresences.length; ++i) {\n                if (typeof d.blockPresences[i] !== \"object\")\n                    throw TypeError(\".Message.blockPresences: object expected\");\n                m.blockPresences[i] = $root.Message.BlockPresence.fromObject(d.blockPresences[i]);\n            }\n        }\n        if (d.pendingBytes != null) {\n            m.pendingBytes = d.pendingBytes | 0;\n        }\n        return m;\n    };\n\n    /**\n     * Creates a plain object from a Message message. Also converts values to other types if specified.\n     * @function toObject\n     * @memberof Message\n     * @static\n     * @param {Message} m Message\n     * @param {$protobuf.IConversionOptions} [o] Conversion options\n     * @returns {Object.<string,*>} Plain object\n     */\n    Message.toObject = function toObject(m, o) {\n        if (!o)\n            o = {};\n        var d = {};\n        if (o.arrays || o.defaults) {\n            d.blocks = [];\n            d.payload = [];\n            d.blockPresences = [];\n        }\n        if (o.defaults) {\n            d.wantlist = null;\n            d.pendingBytes = 0;\n        }\n        if (m.wantlist != null && m.hasOwnProperty(\"wantlist\")) {\n            d.wantlist = $root.Message.Wantlist.toObject(m.wantlist, o);\n        }\n        if (m.blocks && m.blocks.length) {\n            d.blocks = [];\n            for (var j = 0; j < m.blocks.length; ++j) {\n                d.blocks[j] = o.bytes === String ? $util.base64.encode(m.blocks[j], 0, m.blocks[j].length) : o.bytes === Array ? Array.prototype.slice.call(m.blocks[j]) : m.blocks[j];\n            }\n        }\n        if (m.payload && m.payload.length) {\n            d.payload = [];\n            for (var j = 0; j < m.payload.length; ++j) {\n                d.payload[j] = $root.Message.Block.toObject(m.payload[j], o);\n            }\n        }\n        if (m.blockPresences && m.blockPresences.length) {\n            d.blockPresences = [];\n            for (var j = 0; j < m.blockPresences.length; ++j) {\n                d.blockPresences[j] = $root.Message.BlockPresence.toObject(m.blockPresences[j], o);\n            }\n        }\n        if (m.pendingBytes != null && m.hasOwnProperty(\"pendingBytes\")) {\n            d.pendingBytes = m.pendingBytes;\n        }\n        return d;\n    };\n\n    /**\n     * Converts this Message to JSON.\n     * @function toJSON\n     * @memberof Message\n     * @instance\n     * @returns {Object.<string,*>} JSON object\n     */\n    Message.prototype.toJSON = function toJSON() {\n        return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n    };\n\n    Message.Wantlist = (function() {\n\n        /**\n         * Properties of a Wantlist.\n         * @memberof Message\n         * @interface IWantlist\n         * @property {Array.<Message.Wantlist.IEntry>|null} [entries] Wantlist entries\n         * @property {boolean|null} [full] Wantlist full\n         */\n\n        /**\n         * Constructs a new Wantlist.\n         * @memberof Message\n         * @classdesc Represents a Wantlist.\n         * @implements IWantlist\n         * @constructor\n         * @param {Message.IWantlist=} [p] Properties to set\n         */\n        function Wantlist(p) {\n            this.entries = [];\n            if (p)\n                for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                    if (p[ks[i]] != null)\n                        this[ks[i]] = p[ks[i]];\n        }\n\n        /**\n         * Wantlist entries.\n         * @member {Array.<Message.Wantlist.IEntry>} entries\n         * @memberof Message.Wantlist\n         * @instance\n         */\n        Wantlist.prototype.entries = $util.emptyArray;\n\n        /**\n         * Wantlist full.\n         * @member {boolean} full\n         * @memberof Message.Wantlist\n         * @instance\n         */\n        Wantlist.prototype.full = false;\n\n        /**\n         * Encodes the specified Wantlist message. Does not implicitly {@link Message.Wantlist.verify|verify} messages.\n         * @function encode\n         * @memberof Message.Wantlist\n         * @static\n         * @param {Message.IWantlist} m Wantlist message or plain object to encode\n         * @param {$protobuf.Writer} [w] Writer to encode to\n         * @returns {$protobuf.Writer} Writer\n         */\n        Wantlist.encode = function encode(m, w) {\n            if (!w)\n                w = $Writer.create();\n            if (m.entries != null && m.entries.length) {\n                for (var i = 0; i < m.entries.length; ++i)\n                    $root.Message.Wantlist.Entry.encode(m.entries[i], w.uint32(10).fork()).ldelim();\n            }\n            if (m.full != null && Object.hasOwnProperty.call(m, \"full\"))\n                w.uint32(16).bool(m.full);\n            return w;\n        };\n\n        /**\n         * Decodes a Wantlist message from the specified reader or buffer.\n         * @function decode\n         * @memberof Message.Wantlist\n         * @static\n         * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n         * @param {number} [l] Message length if known beforehand\n         * @returns {Message.Wantlist} Wantlist\n         * @throws {Error} If the payload is not a reader or valid buffer\n         * @throws {$protobuf.util.ProtocolError} If required fields are missing\n         */\n        Wantlist.decode = function decode(r, l) {\n            if (!(r instanceof $Reader))\n                r = $Reader.create(r);\n            var c = l === undefined ? r.len : r.pos + l, m = new $root.Message.Wantlist();\n            while (r.pos < c) {\n                var t = r.uint32();\n                switch (t >>> 3) {\n                case 1:\n                    if (!(m.entries && m.entries.length))\n                        m.entries = [];\n                    m.entries.push($root.Message.Wantlist.Entry.decode(r, r.uint32()));\n                    break;\n                case 2:\n                    m.full = r.bool();\n                    break;\n                default:\n                    r.skipType(t & 7);\n                    break;\n                }\n            }\n            return m;\n        };\n\n        /**\n         * Creates a Wantlist message from a plain object. Also converts values to their respective internal types.\n         * @function fromObject\n         * @memberof Message.Wantlist\n         * @static\n         * @param {Object.<string,*>} d Plain object\n         * @returns {Message.Wantlist} Wantlist\n         */\n        Wantlist.fromObject = function fromObject(d) {\n            if (d instanceof $root.Message.Wantlist)\n                return d;\n            var m = new $root.Message.Wantlist();\n            if (d.entries) {\n                if (!Array.isArray(d.entries))\n                    throw TypeError(\".Message.Wantlist.entries: array expected\");\n                m.entries = [];\n                for (var i = 0; i < d.entries.length; ++i) {\n                    if (typeof d.entries[i] !== \"object\")\n                        throw TypeError(\".Message.Wantlist.entries: object expected\");\n                    m.entries[i] = $root.Message.Wantlist.Entry.fromObject(d.entries[i]);\n                }\n            }\n            if (d.full != null) {\n                m.full = Boolean(d.full);\n            }\n            return m;\n        };\n\n        /**\n         * Creates a plain object from a Wantlist message. Also converts values to other types if specified.\n         * @function toObject\n         * @memberof Message.Wantlist\n         * @static\n         * @param {Message.Wantlist} m Wantlist\n         * @param {$protobuf.IConversionOptions} [o] Conversion options\n         * @returns {Object.<string,*>} Plain object\n         */\n        Wantlist.toObject = function toObject(m, o) {\n            if (!o)\n                o = {};\n            var d = {};\n            if (o.arrays || o.defaults) {\n                d.entries = [];\n            }\n            if (o.defaults) {\n                d.full = false;\n            }\n            if (m.entries && m.entries.length) {\n                d.entries = [];\n                for (var j = 0; j < m.entries.length; ++j) {\n                    d.entries[j] = $root.Message.Wantlist.Entry.toObject(m.entries[j], o);\n                }\n            }\n            if (m.full != null && m.hasOwnProperty(\"full\")) {\n                d.full = m.full;\n            }\n            return d;\n        };\n\n        /**\n         * Converts this Wantlist to JSON.\n         * @function toJSON\n         * @memberof Message.Wantlist\n         * @instance\n         * @returns {Object.<string,*>} JSON object\n         */\n        Wantlist.prototype.toJSON = function toJSON() {\n            return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n        };\n\n        /**\n         * WantType enum.\n         * @name Message.Wantlist.WantType\n         * @enum {number}\n         * @property {number} Block=0 Block value\n         * @property {number} Have=1 Have value\n         */\n        Wantlist.WantType = (function() {\n            var valuesById = {}, values = Object.create(valuesById);\n            values[valuesById[0] = \"Block\"] = 0;\n            values[valuesById[1] = \"Have\"] = 1;\n            return values;\n        })();\n\n        Wantlist.Entry = (function() {\n\n            /**\n             * Properties of an Entry.\n             * @memberof Message.Wantlist\n             * @interface IEntry\n             * @property {Uint8Array|null} [block] Entry block\n             * @property {number|null} [priority] Entry priority\n             * @property {boolean|null} [cancel] Entry cancel\n             * @property {Message.Wantlist.WantType|null} [wantType] Entry wantType\n             * @property {boolean|null} [sendDontHave] Entry sendDontHave\n             */\n\n            /**\n             * Constructs a new Entry.\n             * @memberof Message.Wantlist\n             * @classdesc Represents an Entry.\n             * @implements IEntry\n             * @constructor\n             * @param {Message.Wantlist.IEntry=} [p] Properties to set\n             */\n            function Entry(p) {\n                if (p)\n                    for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                        if (p[ks[i]] != null)\n                            this[ks[i]] = p[ks[i]];\n            }\n\n            /**\n             * Entry block.\n             * @member {Uint8Array} block\n             * @memberof Message.Wantlist.Entry\n             * @instance\n             */\n            Entry.prototype.block = $util.newBuffer([]);\n\n            /**\n             * Entry priority.\n             * @member {number} priority\n             * @memberof Message.Wantlist.Entry\n             * @instance\n             */\n            Entry.prototype.priority = 0;\n\n            /**\n             * Entry cancel.\n             * @member {boolean} cancel\n             * @memberof Message.Wantlist.Entry\n             * @instance\n             */\n            Entry.prototype.cancel = false;\n\n            /**\n             * Entry wantType.\n             * @member {Message.Wantlist.WantType} wantType\n             * @memberof Message.Wantlist.Entry\n             * @instance\n             */\n            Entry.prototype.wantType = 0;\n\n            /**\n             * Entry sendDontHave.\n             * @member {boolean} sendDontHave\n             * @memberof Message.Wantlist.Entry\n             * @instance\n             */\n            Entry.prototype.sendDontHave = false;\n\n            /**\n             * Encodes the specified Entry message. Does not implicitly {@link Message.Wantlist.Entry.verify|verify} messages.\n             * @function encode\n             * @memberof Message.Wantlist.Entry\n             * @static\n             * @param {Message.Wantlist.IEntry} m Entry message or plain object to encode\n             * @param {$protobuf.Writer} [w] Writer to encode to\n             * @returns {$protobuf.Writer} Writer\n             */\n            Entry.encode = function encode(m, w) {\n                if (!w)\n                    w = $Writer.create();\n                if (m.block != null && Object.hasOwnProperty.call(m, \"block\"))\n                    w.uint32(10).bytes(m.block);\n                if (m.priority != null && Object.hasOwnProperty.call(m, \"priority\"))\n                    w.uint32(16).int32(m.priority);\n                if (m.cancel != null && Object.hasOwnProperty.call(m, \"cancel\"))\n                    w.uint32(24).bool(m.cancel);\n                if (m.wantType != null && Object.hasOwnProperty.call(m, \"wantType\"))\n                    w.uint32(32).int32(m.wantType);\n                if (m.sendDontHave != null && Object.hasOwnProperty.call(m, \"sendDontHave\"))\n                    w.uint32(40).bool(m.sendDontHave);\n                return w;\n            };\n\n            /**\n             * Decodes an Entry message from the specified reader or buffer.\n             * @function decode\n             * @memberof Message.Wantlist.Entry\n             * @static\n             * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n             * @param {number} [l] Message length if known beforehand\n             * @returns {Message.Wantlist.Entry} Entry\n             * @throws {Error} If the payload is not a reader or valid buffer\n             * @throws {$protobuf.util.ProtocolError} If required fields are missing\n             */\n            Entry.decode = function decode(r, l) {\n                if (!(r instanceof $Reader))\n                    r = $Reader.create(r);\n                var c = l === undefined ? r.len : r.pos + l, m = new $root.Message.Wantlist.Entry();\n                while (r.pos < c) {\n                    var t = r.uint32();\n                    switch (t >>> 3) {\n                    case 1:\n                        m.block = r.bytes();\n                        break;\n                    case 2:\n                        m.priority = r.int32();\n                        break;\n                    case 3:\n                        m.cancel = r.bool();\n                        break;\n                    case 4:\n                        m.wantType = r.int32();\n                        break;\n                    case 5:\n                        m.sendDontHave = r.bool();\n                        break;\n                    default:\n                        r.skipType(t & 7);\n                        break;\n                    }\n                }\n                return m;\n            };\n\n            /**\n             * Creates an Entry message from a plain object. Also converts values to their respective internal types.\n             * @function fromObject\n             * @memberof Message.Wantlist.Entry\n             * @static\n             * @param {Object.<string,*>} d Plain object\n             * @returns {Message.Wantlist.Entry} Entry\n             */\n            Entry.fromObject = function fromObject(d) {\n                if (d instanceof $root.Message.Wantlist.Entry)\n                    return d;\n                var m = new $root.Message.Wantlist.Entry();\n                if (d.block != null) {\n                    if (typeof d.block === \"string\")\n                        $util.base64.decode(d.block, m.block = $util.newBuffer($util.base64.length(d.block)), 0);\n                    else if (d.block.length)\n                        m.block = d.block;\n                }\n                if (d.priority != null) {\n                    m.priority = d.priority | 0;\n                }\n                if (d.cancel != null) {\n                    m.cancel = Boolean(d.cancel);\n                }\n                switch (d.wantType) {\n                case \"Block\":\n                case 0:\n                    m.wantType = 0;\n                    break;\n                case \"Have\":\n                case 1:\n                    m.wantType = 1;\n                    break;\n                }\n                if (d.sendDontHave != null) {\n                    m.sendDontHave = Boolean(d.sendDontHave);\n                }\n                return m;\n            };\n\n            /**\n             * Creates a plain object from an Entry message. Also converts values to other types if specified.\n             * @function toObject\n             * @memberof Message.Wantlist.Entry\n             * @static\n             * @param {Message.Wantlist.Entry} m Entry\n             * @param {$protobuf.IConversionOptions} [o] Conversion options\n             * @returns {Object.<string,*>} Plain object\n             */\n            Entry.toObject = function toObject(m, o) {\n                if (!o)\n                    o = {};\n                var d = {};\n                if (o.defaults) {\n                    if (o.bytes === String)\n                        d.block = \"\";\n                    else {\n                        d.block = [];\n                        if (o.bytes !== Array)\n                            d.block = $util.newBuffer(d.block);\n                    }\n                    d.priority = 0;\n                    d.cancel = false;\n                    d.wantType = o.enums === String ? \"Block\" : 0;\n                    d.sendDontHave = false;\n                }\n                if (m.block != null && m.hasOwnProperty(\"block\")) {\n                    d.block = o.bytes === String ? $util.base64.encode(m.block, 0, m.block.length) : o.bytes === Array ? Array.prototype.slice.call(m.block) : m.block;\n                }\n                if (m.priority != null && m.hasOwnProperty(\"priority\")) {\n                    d.priority = m.priority;\n                }\n                if (m.cancel != null && m.hasOwnProperty(\"cancel\")) {\n                    d.cancel = m.cancel;\n                }\n                if (m.wantType != null && m.hasOwnProperty(\"wantType\")) {\n                    d.wantType = o.enums === String ? $root.Message.Wantlist.WantType[m.wantType] : m.wantType;\n                }\n                if (m.sendDontHave != null && m.hasOwnProperty(\"sendDontHave\")) {\n                    d.sendDontHave = m.sendDontHave;\n                }\n                return d;\n            };\n\n            /**\n             * Converts this Entry to JSON.\n             * @function toJSON\n             * @memberof Message.Wantlist.Entry\n             * @instance\n             * @returns {Object.<string,*>} JSON object\n             */\n            Entry.prototype.toJSON = function toJSON() {\n                return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n            };\n\n            return Entry;\n        })();\n\n        return Wantlist;\n    })();\n\n    Message.Block = (function() {\n\n        /**\n         * Properties of a Block.\n         * @memberof Message\n         * @interface IBlock\n         * @property {Uint8Array|null} [prefix] Block prefix\n         * @property {Uint8Array|null} [data] Block data\n         */\n\n        /**\n         * Constructs a new Block.\n         * @memberof Message\n         * @classdesc Represents a Block.\n         * @implements IBlock\n         * @constructor\n         * @param {Message.IBlock=} [p] Properties to set\n         */\n        function Block(p) {\n            if (p)\n                for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                    if (p[ks[i]] != null)\n                        this[ks[i]] = p[ks[i]];\n        }\n\n        /**\n         * Block prefix.\n         * @member {Uint8Array} prefix\n         * @memberof Message.Block\n         * @instance\n         */\n        Block.prototype.prefix = $util.newBuffer([]);\n\n        /**\n         * Block data.\n         * @member {Uint8Array} data\n         * @memberof Message.Block\n         * @instance\n         */\n        Block.prototype.data = $util.newBuffer([]);\n\n        /**\n         * Encodes the specified Block message. Does not implicitly {@link Message.Block.verify|verify} messages.\n         * @function encode\n         * @memberof Message.Block\n         * @static\n         * @param {Message.IBlock} m Block message or plain object to encode\n         * @param {$protobuf.Writer} [w] Writer to encode to\n         * @returns {$protobuf.Writer} Writer\n         */\n        Block.encode = function encode(m, w) {\n            if (!w)\n                w = $Writer.create();\n            if (m.prefix != null && Object.hasOwnProperty.call(m, \"prefix\"))\n                w.uint32(10).bytes(m.prefix);\n            if (m.data != null && Object.hasOwnProperty.call(m, \"data\"))\n                w.uint32(18).bytes(m.data);\n            return w;\n        };\n\n        /**\n         * Decodes a Block message from the specified reader or buffer.\n         * @function decode\n         * @memberof Message.Block\n         * @static\n         * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n         * @param {number} [l] Message length if known beforehand\n         * @returns {Message.Block} Block\n         * @throws {Error} If the payload is not a reader or valid buffer\n         * @throws {$protobuf.util.ProtocolError} If required fields are missing\n         */\n        Block.decode = function decode(r, l) {\n            if (!(r instanceof $Reader))\n                r = $Reader.create(r);\n            var c = l === undefined ? r.len : r.pos + l, m = new $root.Message.Block();\n            while (r.pos < c) {\n                var t = r.uint32();\n                switch (t >>> 3) {\n                case 1:\n                    m.prefix = r.bytes();\n                    break;\n                case 2:\n                    m.data = r.bytes();\n                    break;\n                default:\n                    r.skipType(t & 7);\n                    break;\n                }\n            }\n            return m;\n        };\n\n        /**\n         * Creates a Block message from a plain object. Also converts values to their respective internal types.\n         * @function fromObject\n         * @memberof Message.Block\n         * @static\n         * @param {Object.<string,*>} d Plain object\n         * @returns {Message.Block} Block\n         */\n        Block.fromObject = function fromObject(d) {\n            if (d instanceof $root.Message.Block)\n                return d;\n            var m = new $root.Message.Block();\n            if (d.prefix != null) {\n                if (typeof d.prefix === \"string\")\n                    $util.base64.decode(d.prefix, m.prefix = $util.newBuffer($util.base64.length(d.prefix)), 0);\n                else if (d.prefix.length)\n                    m.prefix = d.prefix;\n            }\n            if (d.data != null) {\n                if (typeof d.data === \"string\")\n                    $util.base64.decode(d.data, m.data = $util.newBuffer($util.base64.length(d.data)), 0);\n                else if (d.data.length)\n                    m.data = d.data;\n            }\n            return m;\n        };\n\n        /**\n         * Creates a plain object from a Block message. Also converts values to other types if specified.\n         * @function toObject\n         * @memberof Message.Block\n         * @static\n         * @param {Message.Block} m Block\n         * @param {$protobuf.IConversionOptions} [o] Conversion options\n         * @returns {Object.<string,*>} Plain object\n         */\n        Block.toObject = function toObject(m, o) {\n            if (!o)\n                o = {};\n            var d = {};\n            if (o.defaults) {\n                if (o.bytes === String)\n                    d.prefix = \"\";\n                else {\n                    d.prefix = [];\n                    if (o.bytes !== Array)\n                        d.prefix = $util.newBuffer(d.prefix);\n                }\n                if (o.bytes === String)\n                    d.data = \"\";\n                else {\n                    d.data = [];\n                    if (o.bytes !== Array)\n                        d.data = $util.newBuffer(d.data);\n                }\n            }\n            if (m.prefix != null && m.hasOwnProperty(\"prefix\")) {\n                d.prefix = o.bytes === String ? $util.base64.encode(m.prefix, 0, m.prefix.length) : o.bytes === Array ? Array.prototype.slice.call(m.prefix) : m.prefix;\n            }\n            if (m.data != null && m.hasOwnProperty(\"data\")) {\n                d.data = o.bytes === String ? $util.base64.encode(m.data, 0, m.data.length) : o.bytes === Array ? Array.prototype.slice.call(m.data) : m.data;\n            }\n            return d;\n        };\n\n        /**\n         * Converts this Block to JSON.\n         * @function toJSON\n         * @memberof Message.Block\n         * @instance\n         * @returns {Object.<string,*>} JSON object\n         */\n        Block.prototype.toJSON = function toJSON() {\n            return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n        };\n\n        return Block;\n    })();\n\n    /**\n     * BlockPresenceType enum.\n     * @name Message.BlockPresenceType\n     * @enum {number}\n     * @property {number} Have=0 Have value\n     * @property {number} DontHave=1 DontHave value\n     */\n    Message.BlockPresenceType = (function() {\n        var valuesById = {}, values = Object.create(valuesById);\n        values[valuesById[0] = \"Have\"] = 0;\n        values[valuesById[1] = \"DontHave\"] = 1;\n        return values;\n    })();\n\n    Message.BlockPresence = (function() {\n\n        /**\n         * Properties of a BlockPresence.\n         * @memberof Message\n         * @interface IBlockPresence\n         * @property {Uint8Array|null} [cid] BlockPresence cid\n         * @property {Message.BlockPresenceType|null} [type] BlockPresence type\n         */\n\n        /**\n         * Constructs a new BlockPresence.\n         * @memberof Message\n         * @classdesc Represents a BlockPresence.\n         * @implements IBlockPresence\n         * @constructor\n         * @param {Message.IBlockPresence=} [p] Properties to set\n         */\n        function BlockPresence(p) {\n            if (p)\n                for (var ks = Object.keys(p), i = 0; i < ks.length; ++i)\n                    if (p[ks[i]] != null)\n                        this[ks[i]] = p[ks[i]];\n        }\n\n        /**\n         * BlockPresence cid.\n         * @member {Uint8Array} cid\n         * @memberof Message.BlockPresence\n         * @instance\n         */\n        BlockPresence.prototype.cid = $util.newBuffer([]);\n\n        /**\n         * BlockPresence type.\n         * @member {Message.BlockPresenceType} type\n         * @memberof Message.BlockPresence\n         * @instance\n         */\n        BlockPresence.prototype.type = 0;\n\n        /**\n         * Encodes the specified BlockPresence message. Does not implicitly {@link Message.BlockPresence.verify|verify} messages.\n         * @function encode\n         * @memberof Message.BlockPresence\n         * @static\n         * @param {Message.IBlockPresence} m BlockPresence message or plain object to encode\n         * @param {$protobuf.Writer} [w] Writer to encode to\n         * @returns {$protobuf.Writer} Writer\n         */\n        BlockPresence.encode = function encode(m, w) {\n            if (!w)\n                w = $Writer.create();\n            if (m.cid != null && Object.hasOwnProperty.call(m, \"cid\"))\n                w.uint32(10).bytes(m.cid);\n            if (m.type != null && Object.hasOwnProperty.call(m, \"type\"))\n                w.uint32(16).int32(m.type);\n            return w;\n        };\n\n        /**\n         * Decodes a BlockPresence message from the specified reader or buffer.\n         * @function decode\n         * @memberof Message.BlockPresence\n         * @static\n         * @param {$protobuf.Reader|Uint8Array} r Reader or buffer to decode from\n         * @param {number} [l] Message length if known beforehand\n         * @returns {Message.BlockPresence} BlockPresence\n         * @throws {Error} If the payload is not a reader or valid buffer\n         * @throws {$protobuf.util.ProtocolError} If required fields are missing\n         */\n        BlockPresence.decode = function decode(r, l) {\n            if (!(r instanceof $Reader))\n                r = $Reader.create(r);\n            var c = l === undefined ? r.len : r.pos + l, m = new $root.Message.BlockPresence();\n            while (r.pos < c) {\n                var t = r.uint32();\n                switch (t >>> 3) {\n                case 1:\n                    m.cid = r.bytes();\n                    break;\n                case 2:\n                    m.type = r.int32();\n                    break;\n                default:\n                    r.skipType(t & 7);\n                    break;\n                }\n            }\n            return m;\n        };\n\n        /**\n         * Creates a BlockPresence message from a plain object. Also converts values to their respective internal types.\n         * @function fromObject\n         * @memberof Message.BlockPresence\n         * @static\n         * @param {Object.<string,*>} d Plain object\n         * @returns {Message.BlockPresence} BlockPresence\n         */\n        BlockPresence.fromObject = function fromObject(d) {\n            if (d instanceof $root.Message.BlockPresence)\n                return d;\n            var m = new $root.Message.BlockPresence();\n            if (d.cid != null) {\n                if (typeof d.cid === \"string\")\n                    $util.base64.decode(d.cid, m.cid = $util.newBuffer($util.base64.length(d.cid)), 0);\n                else if (d.cid.length)\n                    m.cid = d.cid;\n            }\n            switch (d.type) {\n            case \"Have\":\n            case 0:\n                m.type = 0;\n                break;\n            case \"DontHave\":\n            case 1:\n                m.type = 1;\n                break;\n            }\n            return m;\n        };\n\n        /**\n         * Creates a plain object from a BlockPresence message. Also converts values to other types if specified.\n         * @function toObject\n         * @memberof Message.BlockPresence\n         * @static\n         * @param {Message.BlockPresence} m BlockPresence\n         * @param {$protobuf.IConversionOptions} [o] Conversion options\n         * @returns {Object.<string,*>} Plain object\n         */\n        BlockPresence.toObject = function toObject(m, o) {\n            if (!o)\n                o = {};\n            var d = {};\n            if (o.defaults) {\n                if (o.bytes === String)\n                    d.cid = \"\";\n                else {\n                    d.cid = [];\n                    if (o.bytes !== Array)\n                        d.cid = $util.newBuffer(d.cid);\n                }\n                d.type = o.enums === String ? \"Have\" : 0;\n            }\n            if (m.cid != null && m.hasOwnProperty(\"cid\")) {\n                d.cid = o.bytes === String ? $util.base64.encode(m.cid, 0, m.cid.length) : o.bytes === Array ? Array.prototype.slice.call(m.cid) : m.cid;\n            }\n            if (m.type != null && m.hasOwnProperty(\"type\")) {\n                d.type = o.enums === String ? $root.Message.BlockPresenceType[m.type] : m.type;\n            }\n            return d;\n        };\n\n        /**\n         * Converts this BlockPresence to JSON.\n         * @function toJSON\n         * @memberof Message.BlockPresence\n         * @instance\n         * @returns {Object.<string,*>} JSON object\n         */\n        BlockPresence.prototype.toJSON = function toJSON() {\n            return this.constructor.toObject(this, $protobuf.util.toJSONOptions);\n        };\n\n        return BlockPresence;\n    })();\n\n    return Message;\n})();\n\nmodule.exports = $root;\n","'use strict'\n\nconst WantlistEntry = require('../wantlist').Entry\n\nmodule.exports = class BitswapMessageEntry {\n  /**\n   * @param {import('cids')} cid\n   * @param {number} priority\n   * @param {import('./message').Message.Wantlist.WantType} wantType\n   * @param {boolean} [cancel]\n   * @param {boolean} [sendDontHave]\n   */\n  constructor (cid, priority, wantType, cancel, sendDontHave) {\n    this.entry = new WantlistEntry(cid, priority, wantType)\n    this.cancel = Boolean(cancel)\n    this.sendDontHave = Boolean(sendDontHave)\n  }\n\n  get cid () {\n    return this.entry.cid\n  }\n\n  set cid (cid) {\n    this.entry.cid = cid\n  }\n\n  get priority () {\n    return this.entry.priority\n  }\n\n  set priority (val) {\n    this.entry.priority = val\n  }\n\n  get wantType () {\n    return this.entry.wantType\n  }\n\n  set wantType (val) {\n    this.entry.wantType = val\n  }\n\n  get [Symbol.toStringTag] () {\n    const cidStr = this.cid.toString('base58btc')\n    return `BitswapMessageEntry ${cidStr} <cancel: ${this.cancel}, priority: ${this.priority}>`\n  }\n\n  /**\n   * @param {this} other\n   */\n  equals (other) {\n    return (this.cancel === other.cancel) &&\n           (this.sendDontHave === other.sendDontHave) &&\n           (this.wantType === other.wantType) &&\n           this.entry.equals(other.entry)\n  }\n}\n","'use strict'\n\nconst { sortBy } = require('../../utils')\nconst Entry = require('./entry')\n\n/**\n * @typedef {import('cids')} CID\n */\n\nclass Wantlist {\n  /**\n   *\n   * @param {import('../../stats')} [stats]\n   */\n  constructor (stats) {\n    /** @type {Map<string, Entry>} */\n    this.set = new Map()\n    this._stats = stats\n  }\n\n  get length () {\n    return this.set.size\n  }\n\n  /**\n   * @param {CID} cid\n   * @param {number} priority\n   * @param {import('../message/message').Message.Wantlist.WantType} wantType\n   */\n  add (cid, priority, wantType) {\n    // Have to import here to avoid circular reference\n    const Message = require('../message')\n\n    const cidStr = cid.toString('base58btc')\n    const entry = this.set.get(cidStr)\n\n    if (entry) {\n      entry.inc()\n      entry.priority = priority\n\n      // We can only overwrite want-have with want-block\n      if (entry.wantType === Message.WantType.Have && wantType === Message.WantType.Block) {\n        entry.wantType = wantType\n      }\n    } else {\n      this.set.set(cidStr, new Entry(cid, priority, wantType))\n      if (this._stats) {\n        this._stats.push(null, 'wantListSize', 1)\n      }\n    }\n  }\n\n  /**\n   * @param {CID} cid\n   */\n  remove (cid) {\n    const cidStr = cid.toString('base58btc')\n    const entry = this.set.get(cidStr)\n\n    if (!entry) {\n      return\n    }\n\n    entry.dec()\n\n    // only delete when no refs are held\n    if (entry.hasRefs()) {\n      return\n    }\n\n    this.set.delete(cidStr)\n    if (this._stats) {\n      this._stats.push(null, 'wantListSize', -1)\n    }\n  }\n\n  /**\n   * @param {string} cidStr\n   */\n  removeForce (cidStr) {\n    if (this.set.has(cidStr)) {\n      this.set.delete(cidStr)\n    }\n  }\n\n  /**\n   * @param {(entry:Entry, key:string) => void} fn\n   */\n  forEach (fn) {\n    return this.set.forEach(fn)\n  }\n\n  entries () {\n    return this.set.entries()\n  }\n\n  sortedEntries () {\n    // TODO: Figure out if this is an actual bug.\n    // @ts-expect-error - Property 'key' does not exist on type 'WantListEntry'\n    return new Map(sortBy(o => o[1].key, Array.from(this.set.entries())))\n  }\n\n  /**\n   * @param {CID} cid\n   */\n  contains (cid) {\n    const cidStr = cid.toString('base58btc')\n    return this.set.get(cidStr)\n  }\n}\n\nWantlist.Entry = Entry\nmodule.exports = Wantlist\n","'use strict'\n\nclass WantListEntry {\n  /**\n   * @param {import('cids')} cid\n   * @param {number} priority\n   * @param {import('../message/message').Message.Wantlist.WantType} wantType\n   */\n  constructor (cid, priority, wantType) {\n    // Keep track of how many requests we have for this key\n    this._refCounter = 1\n\n    this.cid = cid\n    this.priority = priority || 1\n    this.wantType = wantType\n  }\n\n  inc () {\n    this._refCounter += 1\n  }\n\n  dec () {\n    this._refCounter = Math.max(0, this._refCounter - 1)\n  }\n\n  hasRefs () {\n    return this._refCounter > 0\n  }\n\n  // So that console.log prints a nice description of this object\n  get [Symbol.toStringTag] () {\n    const cidStr = this.cid.toString('base58btc')\n    return `WantlistEntry <key: ${cidStr}, priority: ${this.priority}, refs: ${this._refCounter}>`\n  }\n\n  /**\n   * @param {any} other\n   */\n  equals (other) {\n    return (this._refCounter === other._refCounter) &&\n      this.cid.equals(other.cid) &&\n      this.priority === other.priority &&\n      this.wantType === other.wantType\n  }\n}\n\nmodule.exports = WantListEntry\n","'use strict'\n\nconst SECOND = 1000\n\nmodule.exports = {\n  maxProvidersPerRequest: 3,\n  providerRequestTimeout: 10 * SECOND,\n  hasBlockTimeout: 15 * SECOND,\n  provideTimeout: 15 * SECOND,\n  kMaxPriority: Math.pow(2, 31) - 1,\n  maxListeners: 1000,\n  wantlistSendDebounceMs: 1\n}\n","'use strict'\n\n// @ts-ignore\nconst debounce = require('just-debounce-it')\n\nconst Message = require('../types/message')\nconst logger = require('../utils').logger\nconst { wantlistSendDebounceMs } = require('../constants')\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('cids')} CID\n * @typedef {import('../network')} Network\n */\n\nmodule.exports = class MsgQueue {\n  /**\n   * @param {PeerId} selfPeerId\n   * @param {PeerId} otherPeerId\n   * @param {Network} network\n   */\n  constructor (selfPeerId, otherPeerId, network) {\n    this.peerId = otherPeerId\n    this.network = network\n    this.refcnt = 1\n\n    /**\n     * @private\n     * @type {{cid:CID, priority:number, cancel?:boolean}[]}\n     */\n    this._entries = []\n    /** @private */\n    this._log = logger(selfPeerId, 'msgqueue')\n    this.sendEntries = debounce(this._sendEntries.bind(this), wantlistSendDebounceMs)\n  }\n\n  /**\n   * @param {Message} msg\n   */\n  addMessage (msg) {\n    if (msg.empty) {\n      return\n    }\n\n    this.send(msg)\n  }\n\n  /**\n   * @param {{cid:CID, priority:number}[]} entries\n   */\n  addEntries (entries) {\n    this._entries = this._entries.concat(entries)\n    this.sendEntries()\n  }\n\n  /**\n   * @private\n   */\n  _sendEntries () {\n    if (!this._entries.length) {\n      return\n    }\n\n    const msg = new Message(false)\n    this._entries.forEach((entry) => {\n      if (entry.cancel) {\n        msg.cancel(entry.cid)\n      } else {\n        msg.addEntry(entry.cid, entry.priority)\n      }\n    })\n    this._entries = []\n    this.addMessage(msg)\n  }\n\n  /**\n   * @param {Message} msg\n   */\n  async send (msg) {\n    try {\n      await this.network.connectTo(this.peerId)\n    } catch (err) {\n      this._log.error('cant connect to peer %s: %s', this.peerId.toB58String(), err.message)\n      return\n    }\n\n    this._log('sending message to peer %s', this.peerId.toB58String())\n\n    // Note: Don't wait for sendMessage() to complete\n    this.network.sendMessage(this.peerId, msg).catch((err) => {\n      this._log.error('send error: %s', err.message)\n    })\n  }\n}\n","module.exports = debounce;\n\nfunction debounce(fn, wait, callFirst) {\n  var timeout = null;\n  var debouncedFn = null;\n\n  var clear = function() {\n    if (timeout) {\n      clearTimeout(timeout);\n\n      debouncedFn = null;\n      timeout = null;\n    }\n  };\n\n  var flush = function() {\n    var call = debouncedFn;\n    clear();\n\n    if (call) {\n      call();\n    }\n  };\n\n  var debounceWrapper = function() {\n    if (!wait) {\n      return fn.apply(this, arguments);\n    }\n\n    var context = this;\n    var args = arguments;\n    var callNow = callFirst && !timeout;\n    clear();\n\n    debouncedFn = function() {\n      fn.apply(context, args);\n    };\n\n    timeout = setTimeout(function() {\n      timeout = null;\n\n      if (!callNow) {\n        var call = debouncedFn;\n        debouncedFn = null;\n\n        return call();\n      }\n    }, wait);\n\n    if (callNow) {\n      return debouncedFn();\n    }\n  };\n\n  debounceWrapper.cancel = clear;\n  debounceWrapper.flush = flush;\n\n  return debounceWrapper;\n}\n","'use strict'\n\nconst lp = require('it-length-prefixed')\nconst { pipe } = require('it-pipe')\n\nconst MulticodecTopology = require('libp2p-interfaces/src/topology/multicodec-topology')\n\nconst Message = require('./types/message')\nconst CONSTANTS = require('./constants')\nconst logger = require('./utils').logger\n\n/**\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('cids')} CID\n * @typedef {import('multiaddr').Multiaddr} Multiaddr\n * @typedef {import('libp2p-interfaces/src/connection').Connection} Connection\n * @typedef {import('libp2p-interfaces/src/stream-muxer/types').MuxedStream} MuxedStream\n *\n * @typedef {Object} Provider\n * @property {PeerId} id\n * @property {Multiaddr[]} multiaddrs\n *\n * @typedef {Object} Stream\n * @property {AsyncIterable<Uint8Array>} source\n * @property {(output:AsyncIterable<Uint8Array>) => Promise<void>} sink\n */\n\nconst BITSWAP100 = '/ipfs/bitswap/1.0.0'\nconst BITSWAP110 = '/ipfs/bitswap/1.1.0'\nconst BITSWAP120 = '/ipfs/bitswap/1.2.0'\n\nclass Network {\n  /**\n   * @param {import('libp2p')} libp2p\n   * @param {import('./index')} bitswap\n   * @param {import('./stats')} stats\n   * @param {Object} [options]\n   * @param {boolean} [options.b100Only]\n   */\n  constructor (libp2p, bitswap, stats, options = {}) {\n    this._log = logger(libp2p.peerId, 'network')\n    this._libp2p = libp2p\n    this._bitswap = bitswap\n    this._protocols = [BITSWAP100]\n\n    if (!options.b100Only) {\n      // Latest bitswap first\n      this._protocols.unshift(BITSWAP110)\n      this._protocols.unshift(BITSWAP120)\n    }\n\n    this._stats = stats\n    this._running = false\n\n    // bind event listeners\n    this._onPeerConnect = this._onPeerConnect.bind(this)\n    this._onPeerDisconnect = this._onPeerDisconnect.bind(this)\n    this._onConnection = this._onConnection.bind(this)\n  }\n\n  start () {\n    this._running = true\n    this._libp2p.handle(this._protocols, this._onConnection)\n\n    // register protocol with topology\n    const topology = new MulticodecTopology({\n      multicodecs: this._protocols,\n      handlers: {\n        onConnect: this._onPeerConnect,\n        onDisconnect: this._onPeerDisconnect\n      }\n    })\n    this._registrarId = this._libp2p.registrar.register(topology)\n\n    // All existing connections are like new ones for us\n    for (const peer of this._libp2p.peerStore.peers.values()) {\n      const conn = this._libp2p.connectionManager.get(peer.id)\n\n      conn && this._onPeerConnect(conn.remotePeer)\n    }\n  }\n\n  stop () {\n    this._running = false\n\n    // Unhandle both, libp2p doesn't care if it's not already handled\n    this._libp2p.unhandle(this._protocols)\n\n    // unregister protocol and handlers\n    if (this._registrarId != null) {\n      this._libp2p.registrar.unregister(this._registrarId)\n    }\n  }\n\n  /**\n   * Handles both types of incoming bitswap messages\n   *\n   * @private\n   * @param {object} connection\n   * @param {string} connection.protocol - The protocol the stream is running\n   * @param {MuxedStream} connection.stream - A duplex iterable stream\n   * @param {Connection} connection.connection - A libp2p Connection\n   */\n  async _onConnection ({ protocol, stream, connection }) {\n    if (!this._running) { return }\n    this._log('incoming new bitswap %s connection from %s', protocol, connection.remotePeer.toB58String())\n\n    try {\n      await pipe(\n        stream,\n        lp.decode(),\n        /**\n         * @param {AsyncIterable<Uint8Array>} source\n         */\n        async (source) => {\n          for await (const data of source) {\n            try {\n              const message = await Message.deserialize(data.slice())\n              await this._bitswap._receiveMessage(connection.remotePeer, message)\n            } catch (err) {\n              this._bitswap._receiveError(err)\n              break\n            }\n          }\n        }\n      )\n    } catch (err) {\n      this._log(err)\n    }\n  }\n\n  /**\n   * @private\n   * @param {PeerId} peerId\n   */\n  _onPeerConnect (peerId) {\n    this._bitswap._onPeerConnected(peerId)\n  }\n\n  /**\n   * @private\n   * @param {PeerId} peerId\n   */\n  _onPeerDisconnect (peerId) {\n    this._bitswap._onPeerDisconnected(peerId)\n  }\n\n  /**\n   * Find providers given a `cid`.\n   *\n   * @param {CID} cid\n   * @param {number} maxProviders\n   * @param {Object} [options]\n   * @param {AbortSignal} [options.signal]\n   * @returns {AsyncIterable<Provider>}\n   */\n  findProviders (cid, maxProviders, options = {}) {\n    return this._libp2p.contentRouting.findProviders(\n      cid,\n      {\n        // TODO: Should this be a timeout options insetad ?\n        // @ts-expect-error - 'maxTimeout' does not exist in type\n        maxTimeout: CONSTANTS.providerRequestTimeout,\n        maxNumProviders: maxProviders,\n        signal: options.signal\n      }\n    )\n  }\n\n  /**\n   * Find the providers of a given `cid` and connect to them.\n   *\n   * @param {CID} cid\n   * @param {Object} [options]\n   * @param {AbortSignal} [options.signal]\n   */\n  async findAndConnect (cid, options) {\n    const connectAttempts = []\n    for await (const provider of this.findProviders(cid, CONSTANTS.maxProvidersPerRequest, options)) {\n      this._log(`connecting to provider ${provider.id}`)\n      connectAttempts.push(\n        this.connectTo(provider.id, options)\n          .catch(err => {\n            // Prevent unhandled promise rejection\n            this._log.error(err)\n          })\n      )\n    }\n    await Promise.all(connectAttempts)\n  }\n\n  /**\n   * Tell the network we can provide content for the passed CID\n   *\n   * @param {CID} cid\n   * @param {Object} [options]\n   * @param {AbortSignal} [options.signal]\n   */\n  async provide (cid, options) {\n    // @ts-expect-error - contentRouting takes no options\n    await this._libp2p.contentRouting.provide(cid, options)\n  }\n\n  /**\n   * Connect to the given peer\n   * Send the given msg (instance of Message) to the given peer\n   *\n   * @param {PeerId} peer\n   * @param {Message} msg\n   */\n  async sendMessage (peer, msg) {\n    if (!this._running) throw new Error('network isn\\'t running')\n\n    const stringId = peer.toB58String()\n    this._log('sendMessage to %s', stringId, msg)\n\n    const connection = await this._libp2p.dial(peer)\n    const { stream, protocol } = await connection.newStream([BITSWAP120, BITSWAP110, BITSWAP100])\n\n    /** @type {Uint8Array} */\n    let serialized\n    switch (protocol) {\n      case BITSWAP100:\n        serialized = msg.serializeToBitswap100()\n        break\n      case BITSWAP110:\n      case BITSWAP120:\n        serialized = msg.serializeToBitswap110()\n        break\n      default:\n        throw new Error('Unknown protocol: ' + protocol)\n    }\n\n    // Note: Don't wait for writeMessage() to complete\n    writeMessage(stream, serialized, this._log)\n\n    this._updateSentStats(peer, msg.blocks)\n  }\n\n  /**\n   * Connects to another peer\n   *\n   * @param {PeerId|Multiaddr} peer\n   * @param {Object} [options]\n   * @param {AbortSignal} [options.signal]\n   * @returns {Promise<Connection>}\n   */\n  async connectTo (peer, options) { // eslint-disable-line require-await\n    if (!this._running) {\n      throw new Error('network isn\\'t running')\n    }\n\n    return this._libp2p.dial(peer, options)\n  }\n\n  /**\n   * @private\n   * @param {PeerId} peer\n   * @param {Map<string, {data:Uint8Array}>} blocks\n   */\n  _updateSentStats (peer, blocks) {\n    const peerId = peer.toB58String()\n\n    if (this._stats) {\n      blocks.forEach((block) => this._stats.push(peerId, 'dataSent', block.data.length))\n      this._stats.push(peerId, 'blocksSent', blocks.size)\n    }\n  }\n}\n\n/**\n *\n * @param {MuxedStream} stream\n * @param {Uint8Array} msg\n * @param {*} log\n */\nasync function writeMessage (stream, msg, log) {\n  try {\n    await pipe(\n      [msg],\n      lp.encode(),\n      stream\n    )\n  } catch (err) {\n    log(err)\n  }\n}\n\nmodule.exports = Network\n","'use strict'\n\n/**\n * @typedef {import('ipld-block')} Block\n * @typedef {import('../types/message/entry')} BitswapMessageEntry\n * @typedef {import('peer-id')} PeerId\n */\n\nconst CID = require('cids')\n\nconst Message = require('../types/message')\nconst WantType = Message.WantType\nconst Wantlist = require('../types/wantlist')\nconst Ledger = require('./ledger')\nconst RequestQueue = require('./req-queue')\nconst TaskMerger = require('./task-merger')\nconst { logger } = require('../utils')\n\n// The ideal size of the batched payload. We try to pop this much data off the\n// request queue, but\n// - if there isn't any more data in the queue we send whatever we have\n// - if there are several small items in the queue (eg HAVE response) followed\n//   by one big item (eg a block) that would exceed this target size, we\n//   include the big item in the message\nconst TARGET_MESSAGE_SIZE = 16 * 1024\n\n// If the client sends a want-have, and the engine has the corresponding block,\n// we check the size of the block and if it's small enough we send the block\n// itself, rather than sending a HAVE.\n// This constant defines the maximum size up to which we replace a HAVE with\n// a block.\nconst MAX_SIZE_REPLACE_HAS_WITH_BLOCK = 1024\n\nclass DecisionEngine {\n  /**\n   * @param {PeerId} peerId\n   * @param {import('ipfs-repo').Blockstore} blockstore\n   * @param {import('../network')} network\n   * @param {import('../stats')} stats\n   * @param {Object} [opts]\n   * @param {number} [opts.targetMessageSize]\n   * @param {number} [opts.maxSizeReplaceHasWithBlock]\n   */\n  constructor (peerId, blockstore, network, stats, opts = {}) {\n    this._log = logger(peerId, 'engine')\n    this.blockstore = blockstore\n    this.network = network\n    this._stats = stats\n    this._opts = this._processOpts(opts)\n\n    // A list of of ledgers by their partner id\n    /** @type {Map<string, Ledger>} */\n    this.ledgerMap = new Map()\n    this._running = false\n\n    // Queue of want-have / want-block per peer\n    this._requestQueue = new RequestQueue(TaskMerger)\n  }\n\n  /**\n   * @template {Object} Opts\n   * @param {Opts} opts\n   * @returns {Opts & {maxSizeReplaceHasWithBlock:number, targetMessageSize:number}}\n   * @private\n   */\n  _processOpts (opts) {\n    return {\n      maxSizeReplaceHasWithBlock: MAX_SIZE_REPLACE_HAS_WITH_BLOCK,\n      targetMessageSize: TARGET_MESSAGE_SIZE,\n      ...opts\n    }\n  }\n\n  /**\n   * @private\n   */\n  _scheduleProcessTasks () {\n    setTimeout(() => {\n      this._processTasks()\n    })\n  }\n\n  /**\n   * Pull tasks off the request queue and send a message to the corresponding\n   * peer\n   *\n   * @private\n   */\n  async _processTasks () {\n    if (!this._running) {\n      return\n    }\n\n    const { peerId, tasks, pendingSize } = this._requestQueue.popTasks(this._opts.targetMessageSize)\n\n    if (tasks.length === 0) {\n      return\n    }\n\n    // Create a new message\n    const msg = new Message(false)\n\n    // Amount of data in the request queue still waiting to be popped\n    msg.setPendingBytes(pendingSize)\n\n    // Split out want-blocks, want-haves and DONT_HAVEs\n    const blockCids = []\n    const blockTasks = new Map()\n    for (const task of tasks) {\n      const cid = new CID(task.topic)\n      if (task.data.haveBlock) {\n        if (task.data.isWantBlock) {\n          blockCids.push(cid)\n          blockTasks.set(task.topic, task.data)\n        } else {\n          // Add HAVES to the message\n          msg.addHave(cid)\n        }\n      } else {\n        // Add DONT_HAVEs to the message\n        msg.addDontHave(cid)\n      }\n    }\n\n    const blocks = await this._getBlocks(blockCids)\n    for (const [topic, taskData] of blockTasks) {\n      const blk = blocks.get(topic)\n      // If the block was found (it has not been removed)\n      if (blk) {\n        // Add the block to the message\n        msg.addBlock(blk)\n      } else {\n        // The block was not found. If the client requested DONT_HAVE,\n        // add DONT_HAVE to the message.\n        if (taskData.sendDontHave) {\n          const cid = new CID(topic)\n          msg.addDontHave(cid)\n        }\n      }\n    }\n\n    // If there's nothing in the message, bail out\n    if (msg.empty) {\n      peerId && this._requestQueue.tasksDone(peerId, tasks)\n\n      // Trigger the next round of task processing\n      this._scheduleProcessTasks()\n\n      return\n    }\n\n    try {\n      // Send the message\n      peerId && await this.network.sendMessage(peerId, msg)\n\n      // Peform sent message accounting\n      for (const block of blocks.values()) {\n        peerId && this.messageSent(peerId, block)\n      }\n    } catch (err) {\n      this._log.error(err)\n    }\n\n    // Free the tasks up from the request queue\n    peerId && this._requestQueue.tasksDone(peerId, tasks)\n\n    // Trigger the next round of task processing\n    this._scheduleProcessTasks()\n  }\n\n  /**\n   * @param {PeerId} peerId\n   * @returns {Map<string, import('../types/wantlist/entry')>}\n   */\n  wantlistForPeer (peerId) {\n    const peerIdStr = peerId.toB58String()\n    const ledger = this.ledgerMap.get(peerIdStr)\n    return ledger ? ledger.wantlist.sortedEntries() : new Map()\n  }\n\n  /**\n   * @param {PeerId} peerId\n   */\n  ledgerForPeer (peerId) {\n    const peerIdStr = peerId.toB58String()\n\n    const ledger = this.ledgerMap.get(peerIdStr)\n\n    if (!ledger) {\n      return null\n    }\n\n    return {\n      peer: ledger.partner.toPrint(),\n      value: ledger.debtRatio(),\n      sent: ledger.accounting.bytesSent,\n      recv: ledger.accounting.bytesRecv,\n      exchanged: ledger.exchangeCount\n    }\n  }\n\n  /**\n   * @returns {PeerId[]}\n   */\n  peers () {\n    return Array.from(this.ledgerMap.values()).map((l) => l.partner)\n  }\n\n  /**\n   * Receive blocks either from an incoming message from the network, or from\n   * blocks being added by the client on the localhost (eg IPFS add)\n   *\n   * @param {Block[]} blocks\n   * @returns {void}\n   */\n  receivedBlocks (blocks) {\n    if (!blocks.length) {\n      return\n    }\n\n    // For each connected peer, check if it wants the block we received\n    this.ledgerMap.forEach((ledger) => {\n      blocks.forEach((block) => {\n        // Filter out blocks that we don't want\n        const want = ledger.wantlistContains(block.cid)\n        if (!want) {\n          return\n        }\n\n        // If the block is small enough, just send the block, even if the\n        // client asked for a HAVE\n        const blockSize = block.data.length\n        const isWantBlock = this._sendAsBlock(want.wantType, blockSize)\n\n        let entrySize = blockSize\n        if (!isWantBlock) {\n          entrySize = Message.blockPresenceSize(want.cid)\n        }\n\n        this._requestQueue.pushTasks(ledger.partner, [{\n          topic: want.cid.toString(),\n          priority: want.priority,\n          size: entrySize,\n          data: {\n            blockSize,\n            isWantBlock,\n            haveBlock: true,\n            sendDontHave: false\n          }\n        }])\n      })\n    })\n\n    this._scheduleProcessTasks()\n  }\n\n  /**\n   * Handle incoming messages\n   *\n   * @param {PeerId} peerId\n   * @param {Message} msg\n   * @returns {Promise<void>}\n   */\n  async messageReceived (peerId, msg) {\n    const ledger = this._findOrCreate(peerId)\n\n    if (msg.empty) {\n      return\n    }\n\n    // If the message has a full wantlist, clear the current wantlist\n    if (msg.full) {\n      ledger.wantlist = new Wantlist()\n    }\n\n    // Record the amount of block data received\n    this._updateBlockAccounting(msg.blocks, ledger)\n\n    if (msg.wantlist.size === 0) {\n      this._scheduleProcessTasks()\n      return\n    }\n\n    // Clear cancelled wants and add new wants to the ledger\n    /** @type {CID[]} */\n    const cancels = []\n    /** @type {BitswapMessageEntry[]} */\n    const wants = []\n    msg.wantlist.forEach((entry) => {\n      if (entry.cancel) {\n        ledger.cancelWant(entry.cid)\n        cancels.push(entry.cid)\n      } else {\n        ledger.wants(entry.cid, entry.priority, entry.wantType)\n        wants.push(entry)\n      }\n    })\n\n    this._cancelWants(peerId, cancels)\n    await this._addWants(peerId, wants)\n\n    this._scheduleProcessTasks()\n  }\n\n  /**\n   * @private\n   * @param {PeerId} peerId\n   * @param {CID[]} cids\n   * @returns {void}\n   */\n  _cancelWants (peerId, cids) {\n    for (const c of cids) {\n      this._requestQueue.remove(c.toString(), peerId)\n    }\n  }\n\n  /**\n   * @private\n   * @param {PeerId} peerId\n   * @param {BitswapMessageEntry[]} wants\n   * @returns {Promise<void>}\n   */\n  async _addWants (peerId, wants) {\n    // Get the size of each wanted block\n    const blockSizes = await this._getBlockSizes(wants.map(w => w.cid))\n\n    const tasks = []\n    for (const want of wants) {\n      const id = want.cid.toString()\n      const blockSize = blockSizes.get(id)\n\n      // If the block was not found\n      if (blockSize == null) {\n        // Only add the task to the queue if the requester wants a DONT_HAVE\n        if (want.sendDontHave) {\n          tasks.push({\n            topic: id,\n            priority: want.priority,\n            size: Message.blockPresenceSize(want.cid),\n            data: {\n              isWantBlock: want.wantType === WantType.Block,\n              blockSize: 0,\n              haveBlock: false,\n              sendDontHave: want.sendDontHave\n            }\n          })\n        }\n      } else {\n        // The block was found, add it to the queue\n\n        // If the block is small enough, just send the block, even if the\n        // client asked for a HAVE\n        const isWantBlock = this._sendAsBlock(want.wantType, blockSize)\n\n        // entrySize is the amount of space the entry takes up in the\n        // message we send to the recipient. If we're sending a block, the\n        // entrySize is the size of the block. Otherwise it's the size of\n        // a block presence entry.\n        let entrySize = blockSize\n        if (!isWantBlock) {\n          entrySize = Message.blockPresenceSize(want.cid)\n        }\n\n        tasks.push({\n          topic: id,\n          priority: want.priority,\n          size: entrySize,\n          data: {\n            isWantBlock,\n            blockSize,\n            haveBlock: true,\n            sendDontHave: want.sendDontHave\n          }\n        })\n      }\n\n      this._requestQueue.pushTasks(peerId, tasks)\n    }\n  }\n\n  /**\n   * @private\n   * @param {import('../types/message/message').Message.Wantlist.WantType} wantType\n   * @param {number} blockSize\n   */\n  _sendAsBlock (wantType, blockSize) {\n    return wantType === WantType.Block ||\n      blockSize <= this._opts.maxSizeReplaceHasWithBlock\n  }\n\n  /**\n   * @private\n   * @param {CID[]} cids\n   * @returns {Promise<Map<string, number>>}\n   */\n  async _getBlockSizes (cids) {\n    const blocks = await this._getBlocks(cids)\n    return new Map([...blocks].map(([k, v]) => [k, v.data.length]))\n  }\n\n  /**\n   * @private\n   * @param {CID[]} cids\n   * @returns {Promise<Map<string, Block>>}\n   */\n  async _getBlocks (cids) {\n    const res = new Map()\n    await Promise.all(cids.map(async (cid) => {\n      try {\n        const block = await this.blockstore.get(cid)\n        res.set(cid.toString(), block)\n      } catch (e) {\n        if (e.code !== 'ERR_NOT_FOUND') {\n          this._log.error('failed to query blockstore for %s: %s', cid, e)\n        }\n      }\n    }))\n    return res\n  }\n\n  /**\n   * @private\n   * @param {Map<string, Block>} blocksMap\n   * @param {Ledger} ledger\n   */\n  _updateBlockAccounting (blocksMap, ledger) {\n    blocksMap.forEach(b => {\n      this._log('got block (%s bytes)', b.data.length)\n      ledger.receivedBytes(b.data.length)\n    })\n  }\n\n  /**\n   * Clear up all accounting things after message was sent\n   *\n   * @param {PeerId} peerId\n   * @param {Object} [block]\n   * @param {Uint8Array} block.data\n   * @param {CID} [block.cid]\n   */\n  messageSent (peerId, block) {\n    const ledger = this._findOrCreate(peerId)\n    ledger.sentBytes(block ? block.data.length : 0)\n    if (block && block.cid) {\n      ledger.wantlist.remove(block.cid)\n    }\n  }\n\n  /**\n   * @param {PeerId} peerId\n   * @returns {number}\n   */\n  numBytesSentTo (peerId) {\n    return this._findOrCreate(peerId).accounting.bytesSent\n  }\n\n  /**\n   * @param {PeerId} peerId\n   * @returns {number}\n   */\n\n  numBytesReceivedFrom (peerId) {\n    return this._findOrCreate(peerId).accounting.bytesRecv\n  }\n\n  /**\n   *\n   * @param {PeerId} _peerId\n   * @returns {void}\n   */\n  peerDisconnected (_peerId) {\n    // if (this.ledgerMap.has(peerId.toB58String())) {\n    //   this.ledgerMap.delete(peerId.toB58String())\n    // }\n    //\n    // TODO: figure out how to remove all other references\n    // in the peer request queue\n  }\n\n  /**\n   * @private\n   * @param {PeerId} peerId\n   * @returns {Ledger}\n   */\n  _findOrCreate (peerId) {\n    const peerIdStr = peerId.toB58String()\n    const ledger = this.ledgerMap.get(peerIdStr)\n    if (ledger) {\n      return ledger\n    }\n\n    const l = new Ledger(peerId)\n\n    this.ledgerMap.set(peerIdStr, l)\n    if (this._stats) {\n      this._stats.push(peerIdStr, 'peerCount', 1)\n    }\n\n    return l\n  }\n\n  start () {\n    this._running = true\n  }\n\n  stop () {\n    this._running = false\n  }\n}\n\nmodule.exports = DecisionEngine\n","'use strict'\n\nconst Wantlist = require('../types/wantlist')\n\n/**\n * @typedef {import('cids')} CID\n */\n\nclass Ledger {\n  /**\n   * @param {import('peer-id')} peerId\n   */\n  constructor (peerId) {\n    this.partner = peerId\n    this.wantlist = new Wantlist()\n\n    this.exchangeCount = 0\n    this.sentToPeer = new Map()\n\n    this.accounting = {\n      bytesSent: 0,\n      bytesRecv: 0\n    }\n  }\n\n  /**\n   * @param {number} n\n   */\n  sentBytes (n) {\n    this.exchangeCount++\n    this.lastExchange = (new Date()).getTime()\n    this.accounting.bytesSent += n\n  }\n\n  /**\n   * @param {number} n\n   */\n  receivedBytes (n) {\n    this.exchangeCount++\n    this.lastExchange = (new Date()).getTime()\n    this.accounting.bytesRecv += n\n  }\n\n  /**\n   *\n   * @param {CID} cid\n   * @param {number} priority\n   * @param {import('../types/message/message').Message.Wantlist.WantType} wantType\n   * @returns {void}\n   */\n  wants (cid, priority, wantType) {\n    this.wantlist.add(cid, priority, wantType)\n  }\n\n  /**\n   * @param {CID} cid\n   * @returns {void}\n   */\n\n  cancelWant (cid) {\n    this.wantlist.remove(cid)\n  }\n\n  /**\n   * @param {CID} cid\n   * @returns {import('../types/wantlist/entry')|void}\n   */\n  wantlistContains (cid) {\n    return this.wantlist.contains(cid)\n  }\n\n  /**\n   * @returns {number}\n   */\n  debtRatio () {\n    return (this.accounting.bytesSent / (this.accounting.bytesRecv + 1)) // +1 is to prevent division by zero\n  }\n}\n\nmodule.exports = Ledger\n","'use strict'\n\nconst SortedMap = require('../utils/sorted-map')\n\n/**\n * @typedef {Object} PopTaskResult\n * @property {PeerId} [peerId]\n * @property {Task[]} tasks\n * @property {number} pendingSize\n *\n * @typedef {Object} PendingTask\n * @property {number} created\n * @property {Task} task\n *\n * @typedef {import('peer-id')} PeerId\n * @typedef {import('./types').Task} Task\n * @typedef {import('./types').TaskMerger} TaskMerger\n */\n\n/**\n * The task merger that is used by default.\n * Assumes that new tasks do not add any information over existing tasks,\n * and doesn't try to merge.\n *\n * @type {TaskMerger}\n */\nconst DefaultTaskMerger = {\n  hasNewInfo () {\n    return false\n  },\n\n  merge () {}\n}\n\n/**\n * Queue of requests to be processed by the engine.\n * The requests from each peer are added to the peer's queue, sorted by\n * priority.\n * Tasks are popped in priority order from the best peer - see popTasks()\n * for more details.\n */\nclass RequestQueue {\n  /**\n   * @param {TaskMerger} [taskMerger]\n   */\n  constructor (taskMerger = DefaultTaskMerger) {\n    this._taskMerger = taskMerger\n    /** @type {SortedMap<string, PeerTasks>} */\n    this._byPeer = new SortedMap([], PeerTasks.compare)\n  }\n\n  /**\n   * Push tasks onto the queue for the given peer\n   *\n   * @param {PeerId} peerId\n   * @param {Task[]} tasks\n   * @returns {void}\n   */\n  pushTasks (peerId, tasks) {\n    let peerTasks = this._byPeer.get(peerId.toB58String())\n\n    if (!peerTasks) {\n      peerTasks = new PeerTasks(peerId, this._taskMerger)\n    }\n\n    peerTasks.pushTasks(tasks)\n    this._byPeer.set(peerId.toB58String(), peerTasks)\n  }\n\n  /**\n   * Choose the peer with the least active work (or if all have the same active\n   * work, the most pending tasks) and pop off the highest priority tasks until\n   * the total size is at least targetMinBytes.\n   * This puts the popped tasks into the \"active\" state, meaning they are\n   * actively being processed (and cannot be modified).\n   *\n   * @param {number} targetMinBytes - the minimum total size of tasks to pop\n   * @returns {PopTaskResult}\n   */\n  popTasks (targetMinBytes) {\n    // Get the queue of tasks for the best peer and pop off tasks up to\n    // targetMinBytes\n    const peerTasks = this._head()\n    if (peerTasks === undefined) {\n      return { tasks: [], pendingSize: 0 }\n    }\n\n    const { tasks, pendingSize } = peerTasks.popTasks(targetMinBytes)\n    if (tasks.length === 0) {\n      return { tasks, pendingSize }\n    }\n\n    const peerId = peerTasks.peerId\n    if (peerTasks.isIdle()) {\n      // If there are no more tasks for the peer, free up its memory\n      this._byPeer.delete(peerId.toB58String())\n    } else {\n      // If there are still tasks remaining, update the sort order of peerTasks\n      // (because it depends on the number of pending tasks)\n      this._byPeer.update(0)\n    }\n\n    return {\n      peerId, tasks, pendingSize\n    }\n  }\n\n  /**\n   * @private\n   * @returns {PeerTasks|undefined}\n   */\n  _head () {\n    // Shortcut\n    if (this._byPeer.size === 0) {\n      return undefined\n    }\n\n    // eslint-disable-next-line no-unreachable-loop\n    for (const [, v] of this._byPeer) {\n      return v\n    }\n\n    return undefined\n  }\n\n  /**\n   * Remove the task with the given topic for the given peer.\n   *\n   * @param {string} topic\n   * @param {PeerId} peerId\n   * @returns {void}\n   */\n  remove (topic, peerId) {\n    const peerTasks = this._byPeer.get(peerId.toB58String())\n    peerTasks && peerTasks.remove(topic)\n  }\n\n  /**\n   * Called when the tasks for the given peer complete.\n   *\n   * @param {PeerId} peerId\n   * @param {Task[]} tasks\n   * @returns {void}\n   */\n  tasksDone (peerId, tasks) {\n    const peerTasks = this._byPeer.get(peerId.toB58String())\n    if (!peerTasks) {\n      return\n    }\n\n    const i = this._byPeer.indexOf(peerId.toB58String())\n    for (const task of tasks) {\n      peerTasks.taskDone(task)\n    }\n\n    // Marking the tasks as done takes them out of the \"active\" state, and the\n    // sort order depends on the size of the active tasks, so we need to update\n    // the order.\n    this._byPeer.update(i)\n  }\n}\n\n/**\n * Queue of tasks for a particular peer, sorted by priority.\n */\nclass PeerTasks {\n  /**\n   * @param {PeerId} peerId\n   * @param {TaskMerger} taskMerger\n   */\n  constructor (peerId, taskMerger) {\n    this.peerId = peerId\n    this._taskMerger = taskMerger\n    this._activeTotalSize = 0\n    this._pending = new PendingTasks()\n    this._active = new Set()\n  }\n\n  /**\n   * Push tasks onto the queue.\n   *\n   * @param {Task[]} tasks\n   * @returns {void}\n   */\n  pushTasks (tasks) {\n    for (const t of tasks) {\n      this._pushTask(t)\n    }\n  }\n\n  /**\n   * @private\n   * @param {Task} task\n   * @returns {void}\n   */\n\n  _pushTask (task) {\n    // If the new task doesn't add any more information over what we\n    // already have in the active queue, then we can skip the new task\n    if (!this._taskHasMoreInfoThanActiveTasks(task)) {\n      return\n    }\n\n    // If there is already a non-active (pending) task with this topic\n    const existingTask = this._pending.get(task.topic)\n    if (existingTask) {\n      // If the new task has a higher priority than the old task,\n      if (task.priority > existingTask.priority) {\n        // Update the priority and the task's position in the queue\n        this._pending.updatePriority(task.topic, task.priority)\n      }\n\n      // Merge the information from the new task into the existing task\n      this._taskMerger.merge(task, existingTask)\n\n      // A task with the topic exists, so we don't need to add\n      // the new task to the queue\n      return\n    }\n\n    // Push the new task onto the queue\n    this._pending.add(task)\n  }\n\n  /**\n   * Indicates whether the new task adds any more information over tasks that are\n   * already in the active task queue\n   *\n   * @private\n   * @param {Task} task\n   * @returns {boolean}\n   */\n  _taskHasMoreInfoThanActiveTasks (task) {\n    const tasksWithTopic = []\n    for (const activeTask of this._active) {\n      if (activeTask.topic === task.topic) {\n        tasksWithTopic.push(activeTask)\n      }\n    }\n\n    // No tasks with that topic, so the new task adds information\n    if (tasksWithTopic.length === 0) {\n      return true\n    }\n\n    return this._taskMerger.hasNewInfo(task, tasksWithTopic)\n  }\n\n  /**\n   * Pop tasks off the queue such that the total size is at least targetMinBytes\n   *\n   * @param {number} targetMinBytes\n   * @returns {PopTaskResult}\n   */\n  popTasks (targetMinBytes) {\n    let size = 0\n    const tasks = []\n\n    // Keep popping tasks until we get up to targetMinBytes (or one item over\n    // targetMinBytes)\n    const pendingTasks = this._pending.tasks()\n    for (let i = 0; i < pendingTasks.length && size < targetMinBytes; i++) {\n      const task = pendingTasks[i]\n      tasks.push(task)\n      size += task.size\n\n      // Move tasks from pending to active\n      this._pending.delete(task.topic)\n      this._activeTotalSize += task.size\n      this._active.add(task)\n    }\n\n    return {\n      tasks, pendingSize: this._pending.totalSize\n    }\n  }\n\n  /**\n   * Called when a task completes.\n   * Note: must be the same reference as returned from popTasks.\n   *\n   * @param {Task} task\n   * @returns {void}\n   */\n  taskDone (task) {\n    if (this._active.has(task)) {\n      this._activeTotalSize -= task.size\n      this._active.delete(task)\n    }\n  }\n\n  /**\n   * Remove pending tasks with the given topic\n   *\n   * @param {string} topic\n   * @returns {void}\n   */\n  remove (topic) {\n    this._pending.delete(topic)\n  }\n\n  /**\n   * No work to be done, this PeerTasks object can be freed.\n   *\n   * @returns {boolean}\n   */\n  isIdle () {\n    return this._pending.length === 0 && this._active.size === 0\n  }\n\n  /**\n   * Compare PeerTasks\n   *\n   * @template Key\n   * @param {[Key, PeerTasks]} a\n   * @param {[Key, PeerTasks]} b\n   * @returns {number}\n   */\n  static compare (a, b) {\n    // Move peers with no pending tasks to the back of the queue\n    if (a[1]._pending.length === 0) {\n      return 1\n    }\n    if (b[1]._pending.length === 0) {\n      return -1\n    }\n\n    // If the amount of active work is the same\n    if (a[1]._activeTotalSize === b[1]._activeTotalSize) {\n      // Choose the peer with the most pending work\n      return b[1]._pending.length - a[1]._pending.length\n    }\n\n    // Choose the peer with the least amount of active work (\"keep peers busy\")\n    return a[1]._activeTotalSize - b[1]._activeTotalSize\n  }\n}\n\n/**\n * Queue of pending tasks for a particular peer, sorted by priority.\n */\nclass PendingTasks {\n  constructor () {\n    /** @type {SortedMap<string, PendingTask>} */\n    this._tasks = new SortedMap([], this._compare)\n  }\n\n  get length () {\n    return this._tasks.size\n  }\n\n  /**\n   * Sum of the size of all pending tasks\n   *\n   * @type {number}\n   **/\n  get totalSize () {\n    return [...this._tasks.values()].reduce((a, t) => a + t.task.size, 0)\n  }\n\n  /**\n   * @param {string} topic\n   * @returns {Task|void}\n   */\n  get (topic) {\n    return (this._tasks.get(topic) || {}).task\n  }\n\n  /**\n   * @param {Task} task\n   */\n  add (task) {\n    this._tasks.set(task.topic, {\n      created: Date.now(),\n      task\n    })\n  }\n\n  /**\n   * @param {string} topic\n   * @returns {void}\n   */\n  delete (topic) {\n    this._tasks.delete(topic)\n  }\n\n  // All pending tasks, in priority order\n  tasks () {\n    return [...this._tasks.values()].map(i => i.task)\n  }\n\n  /**\n   * Update the priority of the task with the given topic, and update the order\n   *\n   * @param {string} topic\n   * @param {number} priority\n   * @returns {void}\n   **/\n  updatePriority (topic, priority) {\n    const obj = this._tasks.get(topic)\n    if (!obj) {\n      return\n    }\n\n    const i = this._tasks.indexOf(topic)\n    obj.task.priority = priority\n    this._tasks.update(i)\n  }\n\n  /**\n   * Sort by priority desc then FIFO\n   *\n   * @param {[string, PendingTask]} a\n   * @param {[string, PendingTask]} b\n   * @returns {number}\n   * @private\n   */\n  _compare (a, b) {\n    if (a[1].task.priority === b[1].task.priority) {\n      // FIFO\n      return a[1].created - b[1].created\n    }\n    // Priority high -> low\n    return b[1].task.priority - a[1].task.priority\n  }\n}\n\nmodule.exports = RequestQueue\n","'use strict'\n\n/**\n * @template Key, Value\n * SortedMap is a Map whose iterator order can be defined by the user\n * @extends {Map<Key, Value>}\n */\nclass SortedMap extends Map {\n  /**\n   * @param {Array<[Key, Value]>} [entries]\n   * @param {(a:[Key, Value], b:[Key, Value]) => number} [cmp] - compares [k1, v1] to [k2, v2]\n   */\n  constructor (entries, cmp) {\n    super()\n    this._cmp = cmp || this._defaultSort\n    /** @type {Key[]} */\n    this._keys = []\n    for (const [k, v] of entries || []) {\n      this.set(k, v)\n    }\n  }\n\n  /**\n   * Call update to update the position of the key when it should change.\n   * For example if the compare function sorts by the priority field, and the\n   * priority changes, call update.\n   * Call indexOf() to get the index _before_ the change happens.\n   *\n   * @param {number} i - the index of entry whose position should be updated.\n   */\n  update (i) {\n    if (i < 0 || i >= this._keys.length) {\n      return\n    }\n\n    const k = this._keys[i]\n    this._keys.splice(i, 1)\n    const newIdx = this._find(k)\n    this._keys.splice(newIdx, 0, k)\n  }\n\n  /**\n   * @param {Key} k\n   * @param {Value} v\n   */\n  set (k, v) {\n    // If the key is already in the map, remove it from the ordering and\n    // re-insert it below\n    if (this.has(k)) {\n      const i = this.indexOf(k)\n      this._keys.splice(i, 1)\n    }\n\n    // Update / insert the k/v into the map\n    super.set(k, v)\n\n    // Find the correct position of the newly inserted k/v in the order\n    const i = this._find(k)\n    this._keys.splice(i, 0, k)\n\n    return this\n  }\n\n  clear () {\n    super.clear()\n    this._keys = []\n  }\n\n  /**\n   * @param {Key} k\n   */\n  delete (k) {\n    if (!this.has(k)) {\n      return false\n    }\n\n    const i = this.indexOf(k)\n    this._keys.splice(i, 1)\n    return super.delete(k)\n  }\n\n  /**\n   * @param {Key} k\n   */\n  indexOf (k) {\n    if (!this.has(k)) {\n      return -1\n    }\n\n    const i = this._find(k)\n    if (this._keys[i] === k) {\n      return i\n    }\n\n    // There may be more than one key with the same ordering\n    // eg { k1: <priority 5>, k2: <priority 5> }\n    // so scan outwards until the key matches\n    for (let j = 1; j < this._keys.length; j++) {\n      if (this._keys[i + j] === k) return i + j\n      if (this._keys[i - j] === k) return i - j\n    }\n\n    return -1 // should never happen for existing key\n  }\n\n  /**\n   * @private\n   * @param {Key} k\n   * @returns {number}\n   */\n\n  _find (k) {\n    let lower = 0\n    let upper = this._keys.length\n    while (lower < upper) {\n      const pivot = (lower + upper) >>> 1 // lower + (upper - lower) / 2\n      const cmp = this._kCmp(this._keys[pivot], k)\n      // console.log(`  _find ${lower}:${upper}[${pivot}] ${cmp}`)\n      if (cmp < 0) { // pivot < k\n        lower = pivot + 1\n      } else if (cmp > 0) { // pivot > k\n        upper = pivot\n      } else { // pivot == k\n        return pivot\n      }\n    }\n    return lower\n  }\n\n  * keys () {\n    for (const k of this._keys) {\n      yield k\n    }\n\n    return undefined\n  }\n\n  /**\n   * @returns {IterableIterator<Value>}\n   */\n  * values () {\n    for (const k of this._keys) {\n      // @ts-ignore - return of `this.get(k)` is `Value|undefined` which is\n      // incompatible with `Value`. Typechecker can't that this contains values\n      // for all the `_keys`. ts(2322)\n      yield this.get(k)\n    }\n\n    return undefined\n  }\n\n  /**\n   * @returns {IterableIterator<[Key, Value]>}\n   */\n  * entries () {\n    for (const k of this._keys) {\n      // @ts-ignore - return of `this.get(k)` is `Value|undefined` which is\n      // incompatible with `Value`. Typechecker can't that this contains values\n      // for all the `_keys`. ts(2322)\n      yield [k, this.get(k)]\n    }\n\n    return undefined\n  }\n\n  * [Symbol.iterator] () {\n    yield * this.entries()\n  }\n\n  /**\n   * @template This\n   * @param {(entry:[Key, Value]) => void} cb\n   * @param {This} [thisArg]\n   */\n  // @ts-expect-error - Callback in Map forEach is (V, K, Map<K, V>) => void\n  forEach (cb, thisArg) {\n    if (!cb) {\n      return\n    }\n\n    for (const k of this._keys) {\n      cb.apply(thisArg, [[k, /** @type {Value} */(this.get(k))]])\n    }\n  }\n\n  /**\n   * @private\n   * @param {[Key, Value]} a\n   * @param {[Key, Value]} b\n   * @returns {0|1|-1}\n   */\n  _defaultSort (a, b) {\n    if (a[0] < b[0]) return -1\n    if (b[0] < a[0]) return 1\n    return 0\n  }\n\n  /**\n   * @private\n   * @param {Key} a\n   * @param {Key} b\n   */\n  _kCmp (a, b) {\n    return this._cmp(\n      // @ts-ignore - get may return undefined\n      [a, this.get(a)],\n      // @ts-ignore - get may return undefined\n      [b, this.get(b)]\n    )\n  }\n}\n\nmodule.exports = SortedMap\n","'use strict'\n\n/**\n * @typedef {import('./types').Task} Task\n * @typedef {import('./types').TaskMerger} TaskMergerAPI\n */\n\n/** @type {TaskMergerAPI} */\nconst TaskMerger = {\n  /**\n   * Indicates whether the given task has newer information than the active\n   * tasks with the same topic.\n   *\n   * @param {Task} task\n   * @param {Task[]} tasksWithTopic\n   * @returns {boolean}\n   */\n  hasNewInfo (task, tasksWithTopic) {\n    let haveBlock = false\n    let isWantBlock = false\n    for (const existing of tasksWithTopic) {\n      if (existing.data.haveBlock) {\n        haveBlock = true\n      }\n\n      if (existing.data.isWantBlock) {\n        isWantBlock = true\n      }\n    }\n\n    // If there is no active want-block and the new task is a want-block,\n    // the new task is better\n    if (!isWantBlock && task.data.isWantBlock) {\n      return true\n    }\n\n    // If we didn't have the block, and the new task indicates that we now\n    // do have the block, then we must also have size information for the\n    // block, so the new task has new information.\n    if (!haveBlock && task.data.haveBlock) {\n      return true\n    }\n\n    return false\n  },\n\n  /**\n   * Merge the information from the given task into the existing task (with the\n   * same topic)\n   *\n   * @param {Task} newTask\n   * @param {Task} existingTask\n   */\n  merge (newTask, existingTask) {\n    // The merge function ignores the topic and priority as these don't change.\n    //\n    // We may receive new information about a want before the want has been\n    // popped from the queue in the following scenarios:\n    //\n    // - Replace want type:\n    //   1. Client sends want-have CID1\n    //   2. Client sends want-block CID1\n    //   In this case we should replace want-have with want-block, including\n    //   updating the task size to be the block size.\n    //\n    // - Replace DONT_HAVE with want:\n    //   1. Client sends want-have CID1 or want-block CID1\n    //   2. Local node doesn't have block for CID1\n    //   3. Local node receives block for CID1 from peer\n    //   In this case we should replace DONT_HAVE with the want, including\n    //   updating the task size and block size.\n    const taskData = newTask.data\n    const existingData = existingTask.data\n\n    // If we didn't have block size information (because we didn't have the\n    // block) and we receive the block from a peer, update the task with the\n    // new block size\n    if (!existingData.haveBlock && taskData.haveBlock) {\n      existingData.haveBlock = taskData.haveBlock\n      existingData.blockSize = taskData.blockSize\n    }\n\n    // If replacing a want-have with a want-block\n    if (!existingData.isWantBlock && taskData.isWantBlock) {\n      // Change the type from want-have to want-block\n      existingData.isWantBlock = true\n      // If the want-have was a DONT_HAVE, or the want-block has a size\n      if (!existingData.haveBlock || taskData.haveBlock) {\n        // Update the entry size\n        existingData.haveBlock = taskData.haveBlock\n        existingTask.size = newTask.size\n      }\n    }\n\n    // If the task is a want-block, make sure the entry size is equal\n    // to the block size (because we will send the whole block)\n    if (existingData.isWantBlock && existingData.haveBlock) {\n      existingTask.size = existingData.blockSize\n    }\n  }\n}\n\nmodule.exports = TaskMerger\n","'use strict'\n\nconst { EventEmitter } = require('events')\nconst IPLDBlock = require('ipld-block')\nconst uint8ArrayEquals = require('uint8arrays/equals')\nconst uint8ArrayToString = require('uint8arrays/to-string')\n\nconst CONSTANTS = require('./constants')\nconst logger = require('./utils').logger\n\n/**\n * @typedef {import('ipld-block')} Block\n */\n\n/**\n * @param {CID} cid\n */\nconst unwantEvent = (cid) => `unwant:${uint8ArrayToString(cid.multihash, 'base64')}`\n\n/**\n * @param {CID} cid\n */\nconst blockEvent = (cid) => `block:${uint8ArrayToString(cid.multihash, 'base64')}`\n\nclass Notifications extends EventEmitter {\n  /**\n   * Internal module used to track events about incoming blocks,\n   * wants and unwants.\n   *\n   * @param {PeerId} peerId\n   */\n  constructor (peerId) {\n    super()\n\n    this.setMaxListeners(CONSTANTS.maxListeners)\n\n    this._log = logger(peerId, 'notif')\n  }\n\n  /**\n   * Signal the system that we received `block`.\n   *\n   * @param {Block} block\n   * @returns {void}\n   */\n  hasBlock (block) {\n    const event = blockEvent(block.cid)\n    this._log(event)\n    this.emit(event, block)\n  }\n\n  /**\n   * Signal the system that we are waiting to receive the\n   * block associated with the given `cid`.\n   * Returns a Promise that resolves to the block when it is received,\n   * or undefined when the block is unwanted.\n   *\n   * @param {CID} cid\n   * @param {Object} [options]\n   * @param {AbortSignal} [options.signal]\n   * @returns {Promise<Block>}\n   */\n  wantBlock (cid, options = {}) {\n    if (!cid) {\n      throw new Error('Not a valid cid')\n    }\n\n    const blockEvt = blockEvent(cid)\n    const unwantEvt = unwantEvent(cid)\n\n    this._log(`wantBlock:${cid}`)\n\n    return new Promise((resolve, reject) => {\n      const onUnwant = () => {\n        this.removeListener(blockEvt, onBlock)\n        reject(new Error(`Block for ${cid} unwanted`))\n      }\n\n      /**\n       * @param {Block} block\n       */\n      const onBlock = (block) => {\n        this.removeListener(unwantEvt, onUnwant)\n\n        if (!uint8ArrayEquals(cid.multihash, block.cid.multihash)) {\n          // wrong block\n          return reject(new Error(`Incorrect block received for ${cid}`))\n        } else if (cid.version !== block.cid.version || cid.codec !== block.cid.codec) {\n          // right block but wrong version or codec\n          block = new IPLDBlock(block.data, cid)\n        }\n\n        resolve(block)\n      }\n\n      this.once(unwantEvt, onUnwant)\n      this.once(blockEvt, onBlock)\n\n      if (options && options.signal) {\n        options.signal.addEventListener('abort', () => {\n          this.removeListener(blockEvt, onBlock)\n          this.removeListener(unwantEvt, onUnwant)\n\n          reject(new Error(`Want for ${cid} aborted`))\n        })\n      }\n    })\n  }\n\n  /**\n   * Signal that the block is not wanted anymore.\n   *\n   * @param {CID} cid - the CID of the block that is not wanted anymore.\n   * @returns {void}\n   */\n  unwantBlock (cid) {\n    const event = unwantEvent(cid)\n    this._log(event)\n    this.emit(event)\n  }\n}\n\nmodule.exports = Notifications\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('peer-id')} PeerId\n */\n","'use strict'\n\nconst { EventEmitter } = require('events')\nconst Stat = require('./stat')\n\n/**\n * @typedef {import('cids')} CID\n * @typedef {import('peer-id')} PeerId\n */\n\n/**\n * @typedef {[number, number, number]} AverageIntervals\n */\nconst defaultOptions = {\n  enabled: false,\n  computeThrottleTimeout: 1000,\n  computeThrottleMaxQueueSize: 1000,\n  movingAverageIntervals: /** @type {AverageIntervals} */ ([\n    60 * 1000, // 1 minute\n    5 * 60 * 1000, // 5 minutes\n    15 * 60 * 1000 // 15 minutes\n  ])\n}\n\nclass Stats extends EventEmitter {\n  /**\n   * @param {string[]} [initialCounters]\n   * @param {Object} _options\n   * @param {boolean} _options.enabled\n   * @param {number} _options.computeThrottleTimeout\n   * @param {number} _options.computeThrottleMaxQueueSize\n   */\n  constructor (initialCounters = [], _options = defaultOptions) {\n    super()\n\n    const options = Object.assign({}, defaultOptions, _options)\n\n    if (typeof options.computeThrottleTimeout !== 'number') {\n      throw new Error('need computeThrottleTimeout')\n    }\n\n    if (typeof options.computeThrottleMaxQueueSize !== 'number') {\n      throw new Error('need computeThrottleMaxQueueSize')\n    }\n\n    this._initialCounters = initialCounters\n    this._options = options\n    this._enabled = this._options.enabled\n\n    this._global = new Stat(initialCounters, options)\n    this._global.on('update', (stats) => this.emit('update', stats))\n\n    /** @type {Map<string, Stat>} */\n    this._peers = new Map()\n  }\n\n  enable () {\n    this._enabled = true\n    this._options.enabled = true\n    this._global.enable()\n  }\n\n  disable () {\n    this._enabled = false\n    this._options.enabled = false\n    this._global.disable()\n  }\n\n  stop () {\n    this._enabled = false\n    this._global.stop()\n    for (const peerStat of this._peers) {\n      peerStat[1].stop()\n    }\n  }\n\n  get snapshot () {\n    return this._global.snapshot\n  }\n\n  get movingAverages () {\n    return this._global.movingAverages\n  }\n\n  /**\n   * @param {PeerId|string} peerId\n   * @returns {Stat|void}\n   */\n  forPeer (peerId) {\n    const peerIdStr = (typeof peerId !== 'string' && peerId.toB58String)\n      ? peerId.toB58String()\n      : `${peerId}`\n\n    return this._peers.get(peerIdStr)\n  }\n\n  /**\n   *\n   * @param {string|null} peer\n   * @param {string} counter\n   * @param {number} inc\n   */\n  push (peer, counter, inc) {\n    if (this._enabled) {\n      this._global.push(counter, inc)\n\n      if (peer) {\n        let peerStats = this._peers.get(peer)\n        if (!peerStats) {\n          peerStats = new Stat(this._initialCounters, this._options)\n          this._peers.set(peer, peerStats)\n        }\n\n        peerStats.push(counter, inc)\n      }\n    }\n  }\n\n  /**\n   * @param {PeerId} peer\n   */\n  disconnected (peer) {\n    const peerId = peer.toB58String()\n    const peerStats = this._peers.get(peerId)\n    if (peerStats) {\n      peerStats.stop()\n      this._peers.delete(peerId)\n    }\n  }\n}\n\nmodule.exports = Stats\n","'use strict'\n\nconst { EventEmitter } = require('events')\nconst MovingAverage = require('@vascosantos/moving-average')\n\n/**\n * @typedef {import('@vascosantos/moving-average').IMovingAverage} IMovingAverage\n * @typedef {[string, number, number]} Op\n */\n\nclass Stats extends EventEmitter {\n  /**\n   *\n   * @param {string[]} initialCounters\n   * @param {Object} options\n   * @param {boolean} options.enabled\n   * @param {number} options.computeThrottleTimeout\n   * @param {number} options.computeThrottleMaxQueueSize\n   * @param {import('.').AverageIntervals} options.movingAverageIntervals\n   */\n  constructor (initialCounters, options) {\n    super()\n\n    this._options = options\n    /** @type {Op[]} */\n    this._queue = []\n    /** @type {Record<string, bigint>} */\n    this._stats = {}\n\n    this._frequencyLastTime = Date.now()\n    /** @type {Record<string, number>} */\n    this._frequencyAccumulators = {}\n\n    /** @type {Record<string, Record<number, IMovingAverage>>} */\n    this._movingAverages = {}\n\n    this._update = this._update.bind(this)\n\n    initialCounters.forEach((key) => {\n      this._stats[key] = BigInt(0)\n      this._movingAverages[key] = {}\n      this._options.movingAverageIntervals.forEach((interval) => {\n        const ma = this._movingAverages[key][interval] = MovingAverage(interval)\n        ma.push(this._frequencyLastTime, 0)\n      })\n    })\n\n    this._enabled = this._options.enabled\n  }\n\n  enable () {\n    this._enabled = true\n  }\n\n  disable () {\n    this._disabled = true\n  }\n\n  stop () {\n    if (this._timeout) {\n      clearTimeout(this._timeout)\n    }\n  }\n\n  get snapshot () {\n    return Object.assign({}, this._stats)\n  }\n\n  get movingAverages () {\n    return Object.assign({}, this._movingAverages)\n  }\n\n  /**\n   * @param {string} counter\n   * @param {number} inc\n   */\n  push (counter, inc) {\n    if (this._enabled) {\n      this._queue.push([counter, inc, Date.now()])\n      this._resetComputeTimeout()\n    }\n  }\n\n  /**\n   * @private\n   */\n  _resetComputeTimeout () {\n    if (this._timeout) {\n      clearTimeout(this._timeout)\n    }\n    this._timeout = setTimeout(this._update, this._nextTimeout())\n  }\n\n  /**\n   * @private\n   * @returns {number}\n   */\n  _nextTimeout () {\n    // calculate the need for an update, depending on the queue length\n    const urgency = this._queue.length / this._options.computeThrottleMaxQueueSize\n    return Math.max(this._options.computeThrottleTimeout * (1 - urgency), 0)\n  }\n\n  /**\n   * @private\n   */\n  _update () {\n    this._timeout = null\n\n    if (this._queue.length) {\n      let last\n      while (this._queue.length) {\n        const op = last = this._queue.shift()\n        op && this._applyOp(op)\n      }\n\n      last && this._updateFrequency(last[2]) // contains timestamp of last op\n\n      this.emit('update', this._stats)\n    }\n  }\n\n  /**\n   * @private\n   * @param {number} latestTime\n   */\n  _updateFrequency (latestTime) {\n    const timeDiff = latestTime - this._frequencyLastTime\n\n    if (timeDiff) {\n      Object.keys(this._stats).forEach((key) => {\n        this._updateFrequencyFor(key, timeDiff, latestTime)\n      })\n    }\n\n    this._frequencyLastTime = latestTime\n  }\n\n  /**\n   * @private\n   * @param {string} key\n   * @param {number} timeDiffMS\n   * @param {number} latestTime\n   * @returns {void}\n   */\n  _updateFrequencyFor (key, timeDiffMS, latestTime) {\n    const count = this._frequencyAccumulators[key] || 0\n    this._frequencyAccumulators[key] = 0\n    const hz = (count / timeDiffMS) * 1000\n\n    let movingAverages = this._movingAverages[key]\n    if (!movingAverages) {\n      movingAverages = this._movingAverages[key] = {}\n    }\n    this._options.movingAverageIntervals.forEach((movingAverageInterval) => {\n      let movingAverage = movingAverages[movingAverageInterval]\n      if (!movingAverage) {\n        movingAverage = movingAverages[movingAverageInterval] = MovingAverage(movingAverageInterval)\n      }\n      movingAverage.push(latestTime, hz)\n    })\n  }\n\n  /**\n   * @private\n   * @param {Op} op\n   */\n  _applyOp (op) {\n    const key = op[0]\n    const inc = op[1]\n\n    if (typeof inc !== 'number') {\n      throw new Error(`invalid increment number: ${inc}`)\n    }\n\n    if (!Object.prototype.hasOwnProperty.call(this._stats, key)) {\n      this._stats[key] = BigInt(0)\n    }\n\n    this._stats[key] = BigInt(this._stats[key]) + BigInt(inc)\n\n    if (!this._frequencyAccumulators[key]) {\n      this._frequencyAccumulators[key] = 0\n    }\n    this._frequencyAccumulators[key] += inc\n  }\n}\n\nmodule.exports = Stats\n","'use strict'\n\nconst createAddrsAPI = require('./addrs')\nconst createConnectAPI = require('./connect')\nconst createDisconnectAPI = require('./disconnect')\nconst createLocalAddrsAPI = require('./local-addrs')\nconst createPeersAPI = require('./peers')\n\nclass SwarmAPI {\n  /**\n   * @param {Object} config\n   * @param {import('../../types').NetworkService} config.network\n   */\n  constructor ({ network }) {\n    this.addrs = createAddrsAPI({ network })\n    this.connect = createConnectAPI({ network })\n    this.disconnect = createDisconnectAPI({ network })\n    this.localAddrs = createLocalAddrsAPI({ network })\n    this.peers = createPeersAPI({ network })\n  }\n}\n\nmodule.exports = SwarmAPI\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/swarm').API[\"addrs\"]}\n   */\n  async function addrs (options = {}) { // eslint-disable-line require-await\n    const peers = []\n    const { libp2p } = await network.use(options)\n    for (const [peerId, peer] of libp2p.peerStore.peers.entries()) {\n      peers.push({\n        id: peerId,\n        // @ts-ignore - libp2p types are missing\n        addrs: peer.addresses.map((mi) => mi.multiaddr)\n      })\n    }\n    return peers\n  }\n\n  return withTimeoutOption(addrs)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/swarm').API[\"connect\"]}\n   */\n  async function connect (addr, options = {}) {\n    const { libp2p } = await network.use(options)\n    await libp2p.dial(addr, options)\n  }\n\n  return withTimeoutOption(connect)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/swarm').API[\"disconnect\"]}\n   */\n  async function disconnect (addr, options = {}) {\n    const { libp2p } = await network.use(options)\n    await libp2p.hangUp(addr)\n  }\n\n  return withTimeoutOption(disconnect)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/swarm').API[\"localAddrs\"]}\n   */\n  async function localAddrs (options = {}) {\n    const { libp2p } = await network.use(options)\n    return libp2p.multiaddrs\n  }\n\n  return withTimeoutOption(localAddrs)\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/swarm').API[\"peers\"]}\n   */\n  async function peers (options = {}) {\n    const { libp2p } = await network.use(options)\n    const peers = []\n\n    for (const [peerId, connections] of libp2p.connections) {\n      for (const connection of connections) {\n        /** @type {import('ipfs-core-types/src/swarm').PeersResult} */\n        const peer = {\n          addr: connection.remoteAddr,\n          peer: peerId\n        }\n\n        if (options.verbose || options.direction) {\n          peer.direction = connection.stat.direction\n        }\n\n        if (options.verbose) {\n          peer.muxer = connection.stat.multiplexer\n          peer.latency = 'n/a'\n          peer.streams = [] // TODO: get this from libp2p\n        }\n\n        peers.push(peer)\n      }\n    }\n\n    return peers\n  }\n\n  return withTimeoutOption(peers)\n}\n","'use strict'\n\n// @ts-ignore - no types\nconst mortice = require('mortice')\n\n/**\n * @param {Object} config\n * @param {string} config.path\n * @param {boolean} [config.repoOwner]\n * @returns {GCLock}\n */\nmodule.exports = ({ path, repoOwner }) =>\n  mortice(path, {\n    singleProcess: repoOwner !== false\n  })\n\n/**\n * @typedef {RWLock} GCLock\n *\n * @typedef {Object} RWLock\n * @property {() => Promise<Lock>} readLock\n * @property {() => Promise<Lock>} writeLock\n *\n * @typedef {() => void} Lock\n */\n","'use strict'\n\nconst PeerId = require('peer-id')\n/** @type {{success:true, time:0, text: ''}} */\nconst basePacket = { success: true, time: 0, text: '' }\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../types').NetworkService} config.network\n */\nmodule.exports = ({ network }) => {\n  /**\n   * @type {import('ipfs-core-types/src/root').API[\"ping\"]}\n   */\n  async function * ping (peerId, options = {}) {\n    const { libp2p } = await network.use()\n    options.count = options.count || 10\n\n    const peer = PeerId.createFromCID(peerId)\n\n    const storedPeer = libp2p.peerStore.get(peer)\n    let id = storedPeer && storedPeer.id\n\n    if (!id) {\n      yield { ...basePacket, text: `Looking up peer ${peerId}` }\n      const remotePeer = await libp2p.peerRouting.findPeer(peer)\n\n      id = remotePeer && remotePeer.id\n    }\n\n    if (!id) {\n      throw new Error('Peer was not found')\n    }\n\n    yield { ...basePacket, text: `PING ${id.toB58String()}` }\n\n    let packetCount = 0\n    let totalTime = 0\n\n    for (let i = 0; i < options.count; i++) {\n      try {\n        const time = await libp2p.ping(id)\n        totalTime += time\n        packetCount++\n        yield { ...basePacket, time }\n      } catch (err) {\n        yield { ...basePacket, success: false, text: err.toString() }\n      }\n    }\n\n    if (packetCount) {\n      const average = totalTime / packetCount\n      yield { ...basePacket, text: `Average latency: ${average}ms` }\n    }\n  }\n\n  return withTimeoutOption(ping)\n}\n\n/**\n * @typedef {Pong|PingFailure|StatusUpdate} Packet\n * Note that not all ping response objects are \"pongs\".\n * A \"pong\" message can be identified by a truthy success property and an empty\n * text property. Other ping responses are failures or status updates.\n *\n * @typedef {Object} Pong\n * @property {true} success\n * @property {number} time\n * @property {''} text\n *\n * @typedef {Object} PingFailure\n * @property {false} success\n * @property {number} time\n * @property {string} text\n *\n * @typedef {Object} StatusUpdate\n * @property {true} success\n * @property {0} time\n * @property {string} text\n *\n * @typedef {PingSettings & AbortOptions} PingOptions\n *\n * @typedef {Object} PingSettings\n * @property {number} [count=10] - The number of ping messages to send\n *\n * @typedef {import('ipfs-core-types/src/utils').AbortOptions} AbortOptions\n */\n","'use strict'\n\nconst PeerId = require('peer-id')\nconst CID = require('cids')\nconst errCode = require('err-code')\nconst { NotEnabledError } = require('../errors')\nconst get = require('dlv')\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\n\n/**\n * @param {Object} config\n * @param {import('../types').NetworkService} config.network\n * @param {import('ipfs-repo')} config.repo\n */\nmodule.exports = ({ network, repo }) => {\n  const { get, put, findProvs, findPeer, provide, query } = {\n    /**\n     * @type {import('ipfs-core-types/src/dht').API[\"get\"]}\n     */\n    async get (key, options = {}) {\n      const { libp2p } = await use(network, options)\n      return libp2p._dht.get(normalizeCID(key), options)\n    },\n\n    /**\n     * @type {import('ipfs-core-types/src/dht').API[\"put\"]}\n     */\n    async * put (key, value, options) {\n      const { libp2p } = await use(network, options)\n      yield * libp2p._dht.put(normalizeCID(key), value)\n    },\n\n    /**\n     * @type {import('ipfs-core-types/src/dht').API[\"findProvs\"]}\n     */\n    async * findProvs (cid, options = { numProviders: 20 }) {\n      const { libp2p } = await use(network, options)\n\n      for await (const peer of libp2p._dht.findProviders(normalizeCID(cid), {\n        maxNumProviders: options.numProviders,\n        signal: options.signal\n      })) {\n        yield {\n          id: peer.id.toB58String(),\n          addrs: peer.addrs\n        }\n      }\n    },\n\n    /**\n     * @type {import('ipfs-core-types/src/dht').API[\"findPeer\"]}\n     */\n    async findPeer (peerId, options) {\n      const { libp2p } = await use(network, options)\n      const peer = await libp2p._dht.findPeer(PeerId.createFromCID(peerId))\n\n      return {\n        id: peer.id.toB58String(),\n        addrs: peer.multiaddrs\n      }\n    },\n\n    /**\n     * @type {import('ipfs-core-types/src/dht').API[\"provide\"]}\n     */\n    async * provide (cids, options = { recursive: false }) {\n      const { libp2p } = await use(network, options)\n      cids = Array.isArray(cids) ? cids : [cids]\n\n      for (const i in cids) {\n        if (typeof cids[i] === 'string') {\n          try {\n            cids[i] = new CID(cids[i])\n          } catch (err) {\n            throw errCode(err, 'ERR_INVALID_CID')\n          }\n        }\n      }\n\n      // ensure blocks are actually local\n      const hasCids = await Promise.all(cids.map(cid => repo.blocks.has(cid)))\n      const hasAll = hasCids.every(has => has)\n\n      if (!hasAll) {\n        throw errCode(new Error('block(s) not found locally, cannot provide'), 'ERR_BLOCK_NOT_FOUND')\n      }\n\n      if (options.recursive) {\n        // TODO: Implement recursive providing\n        throw errCode(new Error('not implemented yet'), 'ERR_NOT_IMPLEMENTED_YET')\n      }\n\n      for (const cid of cids) {\n        yield libp2p._dht.provide(cid)\n      }\n    },\n\n    /**\n     * @type {import('ipfs-core-types/src/dht').API[\"query\"]}\n     */\n    async * query (peerId, options) {\n      const { libp2p } = await use(network, options)\n\n      for await (const closerPeerId of libp2p._dht.getClosestPeers(PeerId.createFromCID(peerId).toBytes())) {\n        yield {\n          id: closerPeerId.toB58String(),\n          addrs: [] // TODO: get addrs?\n        }\n      }\n    }\n  }\n\n  return {\n    get: withTimeoutOption(get),\n    put: withTimeoutOption(put),\n    findProvs: withTimeoutOption(findProvs),\n    findPeer: withTimeoutOption(findPeer),\n    provide: withTimeoutOption(provide),\n    query: withTimeoutOption(query)\n  }\n}\n\n/**\n * Turns given cid in some stringifyable representation, to Uint8Array\n * representation. Throws an error if given value isn't a valid CID.\n *\n * @param {any} cid\n * @returns {Uint8Array}\n */\nconst parseCID = cid => {\n  try {\n    const cidStr = cid.toString().split('/')\n      .filter((/** @type {string} */ part) => part && part !== 'ipfs' && part !== 'ipns')[0]\n\n    return (new CID(cidStr)).bytes\n  } catch (error) {\n    throw errCode(error, 'ERR_INVALID_CID')\n  }\n}\n\n/**\n * Turns given cid in some representation to Uint8Array representation\n *\n * @param {any} cid\n */\nconst normalizeCID = cid =>\n  cid instanceof Uint8Array ? cid : parseCID(cid)\n\n/**\n * @param {import('../types').NetworkService} network\n * @param {import('ipfs-core-types/src/utils').AbortOptions} [options]\n */\nconst use = async (network, options) => {\n  const net = await network.use(options)\n  if (get(net.libp2p, '_config.dht.enabled', false)) {\n    return net\n  } else {\n    throw new NotEnabledError('dht not enabled')\n  }\n}\n","'use strict'\n\nconst withTimeoutOption = require('ipfs-core-utils/src/with-timeout-option')\nconst errCode = require('err-code')\nconst { NotEnabledError } = require('../errors')\nconst get = require('dlv')\n\n/**\n * @param {Object} config\n * @param {import('../types').NetworkService} config.network\n * @param {import('ipfs-core-types/src/config').Config} [config.config]\n */\nmodule.exports = ({ network, config }) => {\n  const isEnabled = get(config || {}, 'Pubsub.Enabled', true)\n\n  return {\n    subscribe: isEnabled ? withTimeoutOption(subscribe) : notEnabled,\n    unsubscribe: isEnabled ? withTimeoutOption(unsubscribe) : notEnabled,\n    publish: isEnabled ? withTimeoutOption(publish) : notEnabled,\n    ls: isEnabled ? withTimeoutOption(ls) : notEnabled,\n    peers: isEnabled ? withTimeoutOption(peers) : notEnabled\n  }\n\n  /**\n   * @type {import('ipfs-core-types/src/pubsub').API[\"subscribe\"]}\n   */\n  async function subscribe (topic, handler, options = {}) {\n    const { libp2p } = await network.use(options)\n    // @ts-ignore Libp2p Pubsub is deprecating the handler, using the EventEmitter\n    return libp2p.pubsub.subscribe(topic, handler, options)\n  }\n\n  /**\n   * @type {import('ipfs-core-types/src/pubsub').API[\"unsubscribe\"]}\n   */\n  async function unsubscribe (topic, handler, options = {}) {\n    const { libp2p } = await network.use(options)\n    // @ts-ignore Libp2p Pubsub is deprecating the handler, using the EventEmitter\n    libp2p.pubsub.unsubscribe(topic, handler, options)\n  }\n\n  /**\n   * @type {import('ipfs-core-types/src/pubsub').API[\"publish\"]}\n   */\n  async function publish (topic, data, options = {}) {\n    const { libp2p } = await network.use(options)\n    if (!data) {\n      throw errCode(new Error('argument \"data\" is required'), 'ERR_ARG_REQUIRED')\n    }\n    await libp2p.pubsub.publish(topic, data)\n  }\n\n  /**\n   * @type {import('ipfs-core-types/src/pubsub').API[\"ls\"]}\n   */\n  async function ls (options = {}) {\n    const { libp2p } = await network.use(options)\n    return libp2p.pubsub.getTopics()\n  }\n\n  /**\n   * @type {import('ipfs-core-types/src/pubsub').API[\"peers\"]}\n   */\n  async function peers (topic, options = {}) {\n    const { libp2p } = await network.use(options)\n    return libp2p.pubsub.getSubscribers(topic)\n  }\n}\n\nconst notEnabled = async () => { // eslint-disable-line require-await\n  throw new NotEnabledError('pubsub not enabled')\n}\n"],"names":["routes","path","component","name","router","history","app","use","_componentsPathFormDefault","default","mount","module","exports","require","Object","defineProperty","value","compilerDom","runtimeDom","shared","_interopNamespace","e","__esModule","n","create","keys","forEach","k","freeze","runtimeDom__namespace","compileCache","compileToFunction","template","options","isString","nodeType","NOOP","innerHTML","key","cached","el","document","querySelector","code","compile","extend","hoistStatic","onError","undefined","onWarn","render","Function","_rc","registerRuntimeCompiler","compilerCore","V_MODEL_RADIO","Symbol","V_MODEL_CHECKBOX","V_MODEL_TEXT","V_MODEL_SELECT","V_MODEL_DYNAMIC","V_ON_WITH_MODIFIERS","V_ON_WITH_KEYS","V_SHOW","TRANSITION","TRANSITION_GROUP","registerRuntimeHelpers","[object Object]","namedCharacterReferences","GT","gt","LT","lt","ac;","af;","AMP","amp","ap;","DD;","dd;","deg","ee;","eg;","el;","ETH","eth","gE;","ge;","Gg;","gg;","gl;","GT;","Gt;","gt;","ic;","ii;","Im;","in;","it;","lE;","le;","lg;","Ll;","ll;","LT;","Lt;","lt;","mp;","Mu;","mu;","ne;","ni;","not","Nu;","nu;","Or;","or;","oS;","Pi;","pi;","pm;","Pr;","pr;","Re;","REG","reg","rx;","Sc;","sc;","shy","uml","wp;","wr;","Xi;","xi;","yen","acd;","acE;","Acy;","acy;","Afr;","afr;","AMP;","amp;","And;","and;","ang;","apE;","ape;","ast;","Auml","auml","Bcy;","bcy;","Bfr;","bfr;","bne;","bot;","Cap;","cap;","cent","Cfr;","cfr;","Chi;","chi;","cir;","COPY","copy","Cup;","cup;","Dcy;","dcy;","deg;","Del;","Dfr;","dfr;","die;","div;","Dot;","dot;","Ecy;","ecy;","Efr;","efr;","egs;","ell;","els;","ENG;","eng;","Eta;","eta;","ETH;","eth;","Euml","euml","Fcy;","fcy;","Ffr;","ffr;","gap;","Gcy;","gcy;","gEl;","gel;","geq;","ges;","Gfr;","gfr;","ggg;","gla;","glE;","glj;","gnE;","gne;","Hat;","Hfr;","hfr;","Icy;","icy;","iff;","Ifr;","ifr;","Int;","int;","Iuml","iuml","Jcy;","jcy;","Jfr;","jfr;","Kcy;","kcy;","Kfr;","kfr;","lap;","lat;","Lcy;","lcy;","lEg;","leg;","leq;","les;","Lfr;","lfr;","lgE;","lnE;","lne;","loz;","lrm;","Lsh;","lsh;","macr","Map;","map;","Mcy;","mcy;","Mfr;","mfr;","mho;","mid;","nap;","nbsp","Ncy;","ncy;","Nfr;","nfr;","ngE;","nge;","nGg;","nGt;","ngt;","nis;","niv;","nlE;","nle;","nLl;","nLt;","nlt;","Not;","not;","npr;","nsc;","num;","Ocy;","ocy;","Ofr;","ofr;","ogt;","ohm;","olt;","ord;","ordf","ordm","orv;","Ouml","ouml","par;","para","Pcy;","pcy;","Pfr;","pfr;","Phi;","phi;","piv;","prE;","pre;","Psi;","psi;","Qfr;","qfr;","QUOT","quot","Rcy;","rcy;","REG;","reg;","Rfr;","rfr;","Rho;","rho;","rlm;","Rsh;","rsh;","scE;","sce;","Scy;","scy;","sect","Sfr;","sfr;","shy;","sim;","smt;","sol;","squ;","Sub;","sub;","Sum;","sum;","Sup;","sup;","sup1","sup2","sup3","Tab;","Tau;","tau;","Tcy;","tcy;","Tfr;","tfr;","top;","Ucy;","ucy;","Ufr;","ufr;","uml;","Uuml","uuml","Vcy;","vcy;","Vee;","vee;","Vfr;","vfr;","Wfr;","wfr;","Xfr;","xfr;","Ycy;","ycy;","yen;","Yfr;","yfr;","yuml","Zcy;","zcy;","Zfr;","zfr;","zwj;","Acirc","acirc","acute","AElig","aelig","andd;","andv;","ange;","Aopf;","aopf;","apid;","apos;","Aring","aring","Ascr;","ascr;","Auml;","auml;","Barv;","bbrk;","Beta;","beta;","beth;","bNot;","bnot;","Bopf;","bopf;","boxH;","boxh;","boxV;","boxv;","Bscr;","bscr;","bsim;","bsol;","bull;","bump;","caps;","Cdot;","cdot;","cedil","cent;","CHcy;","chcy;","circ;","cirE;","cire;","comp;","cong;","Copf;","copf;","COPY;","copy;","Cscr;","cscr;","csub;","csup;","cups;","Darr;","dArr;","darr;","dash;","dHar;","diam;","DJcy;","djcy;","Dopf;","dopf;","Dscr;","dscr;","DScy;","dscy;","dsol;","dtri;","DZcy;","dzcy;","ecir;","Ecirc","ecirc","Edot;","eDot;","edot;","emsp;","ensp;","Eopf;","eopf;","epar;","epsi;","Escr;","escr;","Esim;","esim;","Euml;","euml;","euro;","excl;","flat;","fnof;","Fopf;","fopf;","fork;","Fscr;","fscr;","Gdot;","gdot;","geqq;","gesl;","GJcy;","gjcy;","gnap;","gneq;","Gopf;","gopf;","Gscr;","gscr;","gsim;","gtcc;","gvnE;","half;","hArr;","harr;","hbar;","Hopf;","hopf;","Hscr;","hscr;","Icirc","icirc","Idot;","IEcy;","iecy;","iexcl","imof;","IOcy;","iocy;","Iopf;","iopf;","Iota;","iota;","Iscr;","iscr;","isin;","Iuml;","iuml;","Jopf;","jopf;","Jscr;","jscr;","KHcy;","khcy;","KJcy;","kjcy;","Kopf;","kopf;","Kscr;","kscr;","Lang;","lang;","laquo","Larr;","lArr;","larr;","late;","lcub;","ldca;","ldsh;","leqq;","lesg;","lHar;","LJcy;","ljcy;","lnap;","lneq;","Lopf;","lopf;","lozf;","lpar;","Lscr;","lscr;","lsim;","lsqb;","ltcc;","ltri;","lvnE;","macr;","male;","malt;","micro","mlcp;","mldr;","Mopf;","mopf;","Mscr;","mscr;","nang;","napE;","nbsp;","ncap;","ncup;","ngeq;","nges;","ngtr;","nGtv;","nisd;","NJcy;","njcy;","nldr;","nleq;","nles;","nLtv;","nmid;","Nopf;","nopf;","npar;","npre;","nsce;","Nscr;","nscr;","nsim;","nsub;","nsup;","ntgl;","ntlg;","nvap;","nvge;","nvgt;","nvle;","nvlt;","oast;","ocir;","Ocirc","ocirc","odiv;","odot;","ogon;","oint;","omid;","Oopf;","oopf;","opar;","ordf;","ordm;","oror;","Oscr;","oscr;","osol;","Ouml;","ouml;","para;","part;","perp;","phiv;","plus;","Popf;","popf;","pound","prap;","prec;","prnE;","prod;","prop;","Pscr;","pscr;","qint;","Qopf;","qopf;","Qscr;","qscr;","QUOT;","quot;","race;","Rang;","rang;","raquo","Rarr;","rArr;","rarr;","rcub;","rdca;","rdsh;","real;","rect;","rHar;","rhov;","ring;","Ropf;","ropf;","rpar;","Rscr;","rscr;","rsqb;","rtri;","scap;","scnE;","sdot;","sect;","semi;","sext;","SHcy;","shcy;","sime;","simg;","siml;","smid;","smte;","solb;","Sopf;","sopf;","spar;","Sqrt;","squf;","Sscr;","sscr;","Star;","star;","subE;","sube;","succ;","sung;","sup1;","sup2;","sup3;","supE;","supe;","szlig","tbrk;","tdot;","THORN","thorn","times","tint;","toea;","Topf;","topf;","tosa;","trie;","Tscr;","tscr;","TScy;","tscy;","Uarr;","uArr;","uarr;","Ucirc","ucirc","uHar;","Uopf;","uopf;","Upsi;","upsi;","Uscr;","uscr;","utri;","Uuml;","uuml;","vArr;","varr;","Vbar;","vBar;","Vert;","vert;","Vopf;","vopf;","Vscr;","vscr;","Wopf;","wopf;","Wscr;","wscr;","xcap;","xcup;","xmap;","xnis;","Xopf;","xopf;","Xscr;","xscr;","xvee;","YAcy;","yacy;","YIcy;","yicy;","Yopf;","yopf;","Yscr;","yscr;","YUcy;","yucy;","Yuml;","yuml;","Zdot;","zdot;","Zeta;","zeta;","ZHcy;","zhcy;","Zopf;","zopf;","Zscr;","zscr;","zwnj;","Aacute","aacute","Acirc;","acirc;","acute;","AElig;","aelig;","Agrave","agrave","aleph;","Alpha;","alpha;","Amacr;","amacr;","amalg;","angle;","angrt;","angst;","Aogon;","aogon;","Aring;","aring;","asymp;","Atilde","atilde","awint;","bcong;","bdquo;","bepsi;","blank;","blk12;","blk14;","blk34;","block;","boxDL;","boxDl;","boxdL;","boxdl;","boxDR;","boxDr;","boxdR;","boxdr;","boxHD;","boxHd;","boxhD;","boxhd;","boxHU;","boxHu;","boxhU;","boxhu;","boxUL;","boxUl;","boxuL;","boxul;","boxUR;","boxUr;","boxuR;","boxur;","boxVH;","boxVh;","boxvH;","boxvh;","boxVL;","boxVl;","boxvL;","boxvl;","boxVR;","boxVr;","boxvR;","boxvr;","Breve;","breve;","brvbar","bsemi;","bsime;","bsolb;","bumpE;","bumpe;","caret;","caron;","ccaps;","Ccedil","ccedil","Ccirc;","ccirc;","ccups;","cedil;","check;","clubs;","Colon;","colon;","comma;","crarr;","Cross;","cross;","csube;","csupe;","ctdot;","cuepr;","cuesc;","cupor;","curren","cuvee;","cuwed;","cwint;","Dashv;","dashv;","dblac;","ddarr;","Delta;","delta;","dharl;","dharr;","diams;","disin;","divide","doteq;","dtdot;","dtrif;","duarr;","duhar;","Eacute","eacute","Ecirc;","ecirc;","eDDot;","efDot;","Egrave","egrave","Emacr;","emacr;","empty;","Eogon;","eogon;","eplus;","epsiv;","eqsim;","Equal;","equiv;","erarr;","erDot;","esdot;","exist;","fflig;","filig;","fjlig;","fllig;","fltns;","forkv;","frac12","frac14","frac34","frasl;","frown;","Gamma;","gamma;","Gcirc;","gcirc;","gescc;","gimel;","gneqq;","gnsim;","grave;","gsime;","gsiml;","gtcir;","gtdot;","Hacek;","harrw;","Hcirc;","hcirc;","hoarr;","Iacute","iacute","Icirc;","icirc;","iexcl;","Igrave","igrave","iiint;","iiota;","IJlig;","ijlig;","Imacr;","imacr;","image;","imath;","imped;","infin;","Iogon;","iogon;","iprod;","iquest","isinE;","isins;","isinv;","Iukcy;","iukcy;","Jcirc;","jcirc;","jmath;","Jukcy;","jukcy;","Kappa;","kappa;","lAarr;","langd;","laquo;","larrb;","lates;","lBarr;","lbarr;","lbbrk;","lbrke;","lceil;","ldquo;","lescc;","lhard;","lharu;","lhblk;","llarr;","lltri;","lneqq;","lnsim;","loang;","loarr;","lobrk;","lopar;","lrarr;","lrhar;","lrtri;","lsime;","lsimg;","lsquo;","ltcir;","ltdot;","ltrie;","ltrif;","mdash;","mDDot;","micro;","middot","minus;","mumap;","nabla;","napid;","napos;","natur;","nbump;","ncong;","ndash;","neArr;","nearr;","nedot;","nesim;","ngeqq;","ngsim;","nhArr;","nharr;","nhpar;","nlArr;","nlarr;","nleqq;","nless;","nlsim;","nltri;","notin;","notni;","npart;","nprec;","nrArr;","nrarr;","nrtri;","nsime;","nsmid;","nspar;","nsubE;","nsube;","nsucc;","nsupE;","nsupe;","Ntilde","ntilde","numsp;","nvsim;","nwArr;","nwarr;","Oacute","oacute","Ocirc;","ocirc;","odash;","OElig;","oelig;","ofcir;","Ograve","ograve","ohbar;","olarr;","olcir;","oline;","Omacr;","omacr;","Omega;","omega;","operp;","oplus;","orarr;","order;","Oslash","oslash","Otilde","otilde","ovbar;","parsl;","phone;","plusb;","pluse;","plusmn","pound;","prcue;","Prime;","prime;","prnap;","prsim;","quest;","rAarr;","radic;","rangd;","range;","raquo;","rarrb;","rarrc;","rarrw;","ratio;","RBarr;","rBarr;","rbarr;","rbbrk;","rbrke;","rceil;","rdquo;","reals;","rhard;","rharu;","rlarr;","rlhar;","rnmid;","roang;","roarr;","robrk;","ropar;","rrarr;","rsquo;","rtrie;","rtrif;","sbquo;","sccue;","Scirc;","scirc;","scnap;","scsim;","sdotb;","sdote;","seArr;","searr;","setmn;","sharp;","Sigma;","sigma;","simeq;","simgE;","simlE;","simne;","slarr;","smile;","smtes;","sqcap;","sqcup;","sqsub;","sqsup;","srarr;","starf;","strns;","subnE;","subne;","supnE;","supne;","swArr;","swarr;","szlig;","Theta;","theta;","thkap;","THORN;","thorn;","Tilde;","tilde;","times;","TRADE;","trade;","trisb;","TSHcy;","tshcy;","twixt;","Uacute","uacute","Ubrcy;","ubrcy;","Ucirc;","ucirc;","udarr;","udhar;","Ugrave","ugrave","uharl;","uharr;","uhblk;","ultri;","Umacr;","umacr;","Union;","Uogon;","uogon;","uplus;","upsih;","UpTee;","Uring;","uring;","urtri;","utdot;","utrif;","uuarr;","varpi;","vBarv;","VDash;","Vdash;","vDash;","vdash;","veeeq;","vltri;","vnsub;","vnsup;","vprop;","vrtri;","Wcirc;","wcirc;","Wedge;","wedge;","xcirc;","xdtri;","xhArr;","xharr;","xlArr;","xlarr;","xodot;","xrArr;","xrarr;","xutri;","Yacute","yacute","Ycirc;","ycirc;","Aacute;","aacute;","Abreve;","abreve;","Agrave;","agrave;","andand;","angmsd;","angsph;","apacir;","approx;","Assign;","Atilde;","atilde;","barvee;","Barwed;","barwed;","becaus;","bernou;","bigcap;","bigcup;","bigvee;","bkarow;","bottom;","bowtie;","boxbox;","bprime;","brvbar;","bullet;","Bumpeq;","bumpeq;","Cacute;","cacute;","capand;","capcap;","capcup;","capdot;","Ccaron;","ccaron;","Ccedil;","ccedil;","circeq;","cirmid;","Colone;","colone;","commat;","compfn;","Conint;","conint;","coprod;","copysr;","cularr;","CupCap;","cupcap;","cupcup;","cupdot;","curarr;","curren;","cylcty;","Dagger;","dagger;","daleth;","Dcaron;","dcaron;","dfisht;","divide;","divonx;","dlcorn;","dlcrop;","dollar;","DotDot;","drcorn;","drcrop;","Dstrok;","dstrok;","Eacute;","eacute;","easter;","Ecaron;","ecaron;","ecolon;","Egrave;","egrave;","egsdot;","elsdot;","emptyv;","emsp13;","emsp14;","eparsl;","eqcirc;","equals;","equest;","Exists;","female;","ffilig;","ffllig;","ForAll;","forall;","frac12;","frac13;","frac14;","frac15;","frac16;","frac18;","frac23;","frac25;","frac34;","frac35;","frac38;","frac45;","frac56;","frac58;","frac78;","gacute;","Gammad;","gammad;","Gbreve;","gbreve;","Gcedil;","gesdot;","gesles;","gtlPar;","gtrarr;","gtrdot;","gtrsim;","hairsp;","hamilt;","HARDcy;","hardcy;","hearts;","hellip;","hercon;","homtht;","horbar;","hslash;","Hstrok;","hstrok;","hybull;","hyphen;","Iacute;","iacute;","Igrave;","igrave;","iiiint;","iinfin;","incare;","inodot;","intcal;","iquest;","isinsv;","Itilde;","itilde;","Jsercy;","jsercy;","kappav;","Kcedil;","kcedil;","kgreen;","Lacute;","lacute;","lagran;","Lambda;","lambda;","langle;","larrfs;","larrhk;","larrlp;","larrpl;","larrtl;","lAtail;","latail;","lbrace;","lbrack;","Lcaron;","lcaron;","Lcedil;","lcedil;","ldquor;","lesdot;","lesges;","lfisht;","lfloor;","lharul;","llhard;","Lmidot;","lmidot;","lmoust;","loplus;","lowast;","lowbar;","lparlt;","lrhard;","lsaquo;","lsquor;","Lstrok;","lstrok;","lthree;","ltimes;","ltlarr;","ltrPar;","mapsto;","marker;","mcomma;","midast;","midcir;","middot;","minusb;","minusd;","mnplus;","models;","mstpos;","Nacute;","nacute;","nbumpe;","Ncaron;","ncaron;","Ncedil;","ncedil;","nearhk;","nequiv;","nesear;","nexist;","nltrie;","notinE;","nparsl;","nprcue;","nrarrc;","nrarrw;","nrtrie;","nsccue;","nsimeq;","Ntilde;","ntilde;","numero;","nVDash;","nVdash;","nvDash;","nvdash;","nvHarr;","nvlArr;","nvrArr;","nwarhk;","nwnear;","Oacute;","oacute;","Odblac;","odblac;","odsold;","Ograve;","ograve;","ominus;","origof;","Oslash;","oslash;","Otilde;","otilde;","Otimes;","otimes;","parsim;","percnt;","period;","permil;","phmmat;","planck;","plankv;","plusdo;","plusdu;","plusmn;","preceq;","primes;","prnsim;","propto;","prurel;","puncsp;","qprime;","Racute;","racute;","rangle;","rarrap;","rarrfs;","rarrhk;","rarrlp;","rarrpl;","Rarrtl;","rarrtl;","rAtail;","ratail;","rbrace;","rbrack;","Rcaron;","rcaron;","Rcedil;","rcedil;","rdquor;","rfisht;","rfloor;","rharul;","rmoust;","roplus;","rpargt;","rsaquo;","rsquor;","rthree;","rtimes;","Sacute;","sacute;","Scaron;","scaron;","Scedil;","scedil;","scnsim;","searhk;","seswar;","sfrown;","SHCHcy;","shchcy;","sigmaf;","sigmav;","simdot;","smashp;","SOFTcy;","softcy;","solbar;","spades;","sqcaps;","sqcups;","sqsube;","sqsupe;","Square;","square;","squarf;","ssetmn;","ssmile;","sstarf;","subdot;","Subset;","subset;","subsim;","subsub;","subsup;","succeq;","supdot;","Supset;","supset;","supsim;","supsub;","supsup;","swarhk;","swnwar;","target;","Tcaron;","tcaron;","Tcedil;","tcedil;","telrec;","there4;","thetav;","thinsp;","thksim;","timesb;","timesd;","topbot;","topcir;","tprime;","tridot;","Tstrok;","tstrok;","Uacute;","uacute;","Ubreve;","ubreve;","Udblac;","udblac;","ufisht;","Ugrave;","ugrave;","ulcorn;","ulcrop;","urcorn;","urcrop;","Utilde;","utilde;","vangrt;","varphi;","varrho;","Vdashl;","veebar;","vellip;","Verbar;","verbar;","vsubnE;","vsubne;","vsupnE;","vsupne;","Vvdash;","wedbar;","wedgeq;","weierp;","wreath;","xoplus;","xotime;","xsqcup;","xuplus;","xwedge;","Yacute;","yacute;","Zacute;","zacute;","Zcaron;","zcaron;","zeetrf;","alefsym;","angrtvb;","angzarr;","asympeq;","backsim;","Because;","because;","bemptyv;","between;","bigcirc;","bigodot;","bigstar;","bnequiv;","boxplus;","Cayleys;","Cconint;","ccupssm;","Cedilla;","cemptyv;","cirscir;","coloneq;","congdot;","cudarrl;","cudarrr;","cularrp;","curarrm;","dbkarow;","ddagger;","ddotseq;","demptyv;","Diamond;","diamond;","digamma;","dotplus;","DownTee;","dwangle;","Element;","Epsilon;","epsilon;","eqcolon;","equivDD;","gesdoto;","gtquest;","gtrless;","harrcir;","Implies;","intprod;","isindot;","larrbfs;","larrsim;","lbrksld;","lbrkslu;","ldrdhar;","LeftTee;","lesdoto;","lessdot;","lessgtr;","lesssim;","lotimes;","lozenge;","ltquest;","luruhar;","maltese;","minusdu;","napprox;","natural;","nearrow;","NewLine;","nexists;","NoBreak;","notinva;","notinvb;","notinvc;","NotLess;","notniva;","notnivb;","notnivc;","npolint;","npreceq;","nsqsube;","nsqsupe;","nsubset;","nsucceq;","nsupset;","nvinfin;","nvltrie;","nvrtrie;","nwarrow;","olcross;","Omicron;","omicron;","orderof;","orslope;","OverBar;","pertenk;","planckh;","pluscir;","plussim;","plustwo;","precsim;","Product;","quatint;","questeq;","rarrbfs;","rarrsim;","rbrksld;","rbrkslu;","rdldhar;","realine;","rotimes;","ruluhar;","searrow;","simplus;","simrarr;","subedot;","submult;","subplus;","subrarr;","succsim;","supdsub;","supedot;","suphsol;","suphsub;","suplarr;","supmult;","supplus;","swarrow;","topfork;","triplus;","tritime;","UpArrow;","Uparrow;","uparrow;","Upsilon;","upsilon;","uwangle;","vzigzag;","zigrarr;","andslope;","angmsdaa;","angmsdab;","angmsdac;","angmsdad;","angmsdae;","angmsdaf;","angmsdag;","angmsdah;","angrtvbd;","approxeq;","awconint;","backcong;","barwedge;","bbrktbrk;","bigoplus;","bigsqcup;","biguplus;","bigwedge;","boxminus;","boxtimes;","bsolhsub;","capbrcup;","circledR;","circledS;","cirfnint;","clubsuit;","cupbrcap;","curlyvee;","cwconint;","DDotrahd;","doteqdot;","DotEqual;","dotminus;","drbkarow;","dzigrarr;","elinters;","emptyset;","eqvparsl;","fpartint;","geqslant;","gesdotol;","gnapprox;","hksearow;","hkswarow;","imagline;","imagpart;","infintie;","integers;","Integral;","intercal;","intlarhk;","laemptyv;","ldrushar;","leqslant;","lesdotor;","LessLess;","llcorner;","lnapprox;","lrcorner;","lurdshar;","mapstoup;","multimap;","naturals;","ncongdot;","NotEqual;","notindot;","NotTilde;","otimesas;","parallel;","PartialD;","plusacir;","pointint;","Precedes;","precneqq;","precnsim;","profalar;","profline;","profsurf;","raemptyv;","realpart;","RightTee;","rppolint;","rtriltri;","scpolint;","setminus;","shortmid;","smeparsl;","sqsubset;","sqsupset;","subseteq;","Succeeds;","succneqq;","succnsim;","SuchThat;","Superset;","supseteq;","thetasym;","thicksim;","timesbar;","triangle;","triminus;","trpezium;","Uarrocir;","ulcorner;","UnderBar;","urcorner;","varkappa;","varsigma;","vartheta;","backprime;","backsimeq;","Backslash;","bigotimes;","CenterDot;","centerdot;","checkmark;","CircleDot;","complexes;","Congruent;","Coproduct;","dotsquare;","DoubleDot;","DownArrow;","Downarrow;","downarrow;","DownBreve;","gtrapprox;","gtreqless;","gvertneqq;","heartsuit;","HumpEqual;","LeftArrow;","Leftarrow;","leftarrow;","LeftFloor;","lesseqgtr;","LessTilde;","lvertneqq;","Mellintrf;","MinusPlus;","ngeqslant;","nleqslant;","NotCupCap;","NotExists;","NotSubset;","nparallel;","nshortmid;","nsubseteq;","nsupseteq;","OverBrace;","pitchfork;","PlusMinus;","rationals;","spadesuit;","subseteqq;","subsetneq;","supseteqq;","supsetneq;","Therefore;","therefore;","ThinSpace;","triangleq;","TripleDot;","UnionPlus;","varpropto;","Bernoullis;","circledast;","CirclePlus;","complement;","curlywedge;","eqslantgtr;","EqualTilde;","Fouriertrf;","gtreqqless;","ImaginaryI;","Laplacetrf;","LeftVector;","lessapprox;","lesseqqgtr;","Lleftarrow;","lmoustache;","longmapsto;","mapstodown;","mapstoleft;","nLeftarrow;","nleftarrow;","NotElement;","NotGreater;","nsubseteqq;","nsupseteqq;","precapprox;","Proportion;","RightArrow;","Rightarrow;","rightarrow;","RightFloor;","rmoustache;","sqsubseteq;","sqsupseteq;","subsetneqq;","succapprox;","supsetneqq;","ThickSpace;","TildeEqual;","TildeTilde;","UnderBrace;","UpArrowBar;","UpTeeArrow;","upuparrows;","varepsilon;","varnothing;","backepsilon;","blacksquare;","circledcirc;","circleddash;","CircleMinus;","CircleTimes;","curlyeqprec;","curlyeqsucc;","diamondsuit;","eqslantless;","Equilibrium;","expectation;","GreaterLess;","LeftCeiling;","LessGreater;","MediumSpace;","NotLessLess;","NotPrecedes;","NotSucceeds;","NotSuperset;","nRightarrow;","nrightarrow;","OverBracket;","preccurlyeq;","precnapprox;","quaternions;","RightVector;","Rrightarrow;","RuleDelayed;","SmallCircle;","SquareUnion;","straightphi;","SubsetEqual;","succcurlyeq;","succnapprox;","thickapprox;","UpDownArrow;","Updownarrow;","updownarrow;","VerticalBar;","blacklozenge;","DownArrowBar;","DownTeeArrow;","ExponentialE;","exponentiale;","GreaterEqual;","GreaterTilde;","HilbertSpace;","HumpDownHump;","Intersection;","LeftArrowBar;","LeftTeeArrow;","LeftTriangle;","LeftUpVector;","NotCongruent;","NotHumpEqual;","NotLessEqual;","NotLessTilde;","Proportional;","RightCeiling;","risingdotseq;","RoundImplies;","ShortUpArrow;","SquareSubset;","triangledown;","triangleleft;","UnderBracket;","varsubsetneq;","varsupsetneq;","VerticalLine;","ApplyFunction;","bigtriangleup;","blacktriangle;","DifferentialD;","divideontimes;","DoubleLeftTee;","DoubleUpArrow;","fallingdotseq;","hookleftarrow;","leftarrowtail;","leftharpoonup;","LeftTeeVector;","LeftVectorBar;","LessFullEqual;","LongLeftArrow;","Longleftarrow;","longleftarrow;","looparrowleft;","measuredangle;","NotEqualTilde;","NotTildeEqual;","NotTildeTilde;","ntriangleleft;","Poincareplane;","PrecedesEqual;","PrecedesTilde;","RightArrowBar;","RightTeeArrow;","RightTriangle;","RightUpVector;","shortparallel;","smallsetminus;","SucceedsEqual;","SucceedsTilde;","SupersetEqual;","triangleright;","UpEquilibrium;","upharpoonleft;","varsubsetneqq;","varsupsetneqq;","VerticalTilde;","VeryThinSpace;","curvearrowleft;","DiacriticalDot;","doublebarwedge;","DoubleRightTee;","downdownarrows;","DownLeftVector;","GreaterGreater;","hookrightarrow;","HorizontalLine;","InvisibleComma;","InvisibleTimes;","LeftDownVector;","leftleftarrows;","LeftRightArrow;","Leftrightarrow;","leftrightarrow;","leftthreetimes;","LessSlantEqual;","LongRightArrow;","Longrightarrow;","longrightarrow;","looparrowright;","LowerLeftArrow;","NestedLessLess;","NotGreaterLess;","NotLessGreater;","NotSubsetEqual;","NotVerticalBar;","nshortparallel;","ntriangleright;","OpenCurlyQuote;","ReverseElement;","rightarrowtail;","rightharpoonup;","RightTeeVector;","RightVectorBar;","ShortDownArrow;","ShortLeftArrow;","SquareSuperset;","TildeFullEqual;","trianglelefteq;","upharpoonright;","UpperLeftArrow;","ZeroWidthSpace;","bigtriangledown;","circlearrowleft;","CloseCurlyQuote;","ContourIntegral;","curvearrowright;","DoubleDownArrow;","DoubleLeftArrow;","downharpoonleft;","DownRightVector;","leftharpoondown;","leftrightarrows;","LeftRightVector;","LeftTriangleBar;","LeftUpTeeVector;","LeftUpVectorBar;","LowerRightArrow;","nLeftrightarrow;","nleftrightarrow;","NotGreaterEqual;","NotGreaterTilde;","NotHumpDownHump;","NotLeftTriangle;","NotSquareSubset;","ntrianglelefteq;","OverParenthesis;","RightDownVector;","rightleftarrows;","rightsquigarrow;","rightthreetimes;","ShortRightArrow;","straightepsilon;","trianglerighteq;","UpperRightArrow;","vartriangleleft;","circlearrowright;","DiacriticalAcute;","DiacriticalGrave;","DiacriticalTilde;","DoubleRightArrow;","DownArrowUpArrow;","downharpoonright;","EmptySmallSquare;","GreaterEqualLess;","GreaterFullEqual;","LeftAngleBracket;","LeftUpDownVector;","LessEqualGreater;","NonBreakingSpace;","NotPrecedesEqual;","NotRightTriangle;","NotSucceedsEqual;","NotSucceedsTilde;","NotSupersetEqual;","ntrianglerighteq;","rightharpoondown;","rightrightarrows;","RightTriangleBar;","RightUpTeeVector;","RightUpVectorBar;","twoheadleftarrow;","UnderParenthesis;","UpArrowDownArrow;","vartriangleright;","blacktriangledown;","blacktriangleleft;","DoubleUpDownArrow;","DoubleVerticalBar;","DownLeftTeeVector;","DownLeftVectorBar;","FilledSmallSquare;","GreaterSlantEqual;","LeftDoubleBracket;","LeftDownTeeVector;","LeftDownVectorBar;","leftrightharpoons;","LeftTriangleEqual;","NegativeThinSpace;","NotGreaterGreater;","NotLessSlantEqual;","NotNestedLessLess;","NotReverseElement;","NotSquareSuperset;","NotTildeFullEqual;","RightAngleBracket;","rightleftharpoons;","RightUpDownVector;","SquareSubsetEqual;","twoheadrightarrow;","VerticalSeparator;","blacktriangleright;","DownRightTeeVector;","DownRightVectorBar;","LongLeftRightArrow;","Longleftrightarrow;","longleftrightarrow;","NegativeThickSpace;","NotLeftTriangleBar;","PrecedesSlantEqual;","ReverseEquilibrium;","RightDoubleBracket;","RightDownTeeVector;","RightDownVectorBar;","RightTriangleEqual;","SquareIntersection;","SucceedsSlantEqual;","DoubleLongLeftArrow;","DownLeftRightVector;","LeftArrowRightArrow;","leftrightsquigarrow;","NegativeMediumSpace;","NotGreaterFullEqual;","NotRightTriangleBar;","RightArrowLeftArrow;","SquareSupersetEqual;","CapitalDifferentialD;","DoubleLeftRightArrow;","DoubleLongRightArrow;","EmptyVerySmallSquare;","NestedGreaterGreater;","NotDoubleVerticalBar;","NotGreaterSlantEqual;","NotLeftTriangleEqual;","NotSquareSubsetEqual;","OpenCurlyDoubleQuote;","ReverseUpEquilibrium;","CloseCurlyDoubleQuote;","DoubleContourIntegral;","FilledVerySmallSquare;","NegativeVeryThinSpace;","NotPrecedesSlantEqual;","NotRightTriangleEqual;","NotSucceedsSlantEqual;","DiacriticalDoubleAcute;","NotSquareSupersetEqual;","NotNestedGreaterGreater;","ClockwiseContourIntegral;","DoubleLongLeftRightArrow;","CounterClockwiseContourIntegral;","maxCRNameLength","CCR_REPLACEMENTS","128","130","131","132","133","134","135","136","137","138","139","140","142","145","146","147","148","149","150","151","152","153","154","155","156","158","159","isRawTextContainer","makeMap","parserOptions","isVoidTag","isNativeTag","tag","isHTMLTag","isSVGTag","isPreTag","decodeEntities","rawText","asAttr","offset","end","length","decodedText","advance","slice","head","exec","index","remaining","test","reduce","max","Math","substr","semi","endsWith","hex","body","cp","Number","parseInt","String","fromCodePoint","isBuiltInComponent","isBuiltInType","parent","ns","props","some","a","type","content","transformStyle","node","p","i","arg","createSimpleExpression","loc","exp","parseInlineCSS","modifiers","cssText","normalized","parseStringStyle","JSON","stringify","createDOMCompilerError","createCompilerError","DOMErrorMessages","49","50","51","52","53","54","55","56","57","58","59","isEventOptionModifier","isNonKeyModifier","maybeKeyModifier","isKeyboardEvent","transformClick","event","isStaticExp","toLowerCase","createCompoundExpression","stringifyStatic","children","context","scopes","vSlot","nc","ec","currentChunk","stringifyCurrentChunk","currentIndex","staticCall","createCallExpression","helper","CREATE_STATIC","map","stringifyNode","join","replaceHoist","deleteCount","splice","child","getHoistedNode","result","analyzeNode","push","tagType","codegenNode","hoisted","dataAriaRE","isStringifiableAttr","isKnownAttr","replacement","hoistToReplace","hoists","indexOf","isNonStringifiable","bailed","bail","walk","isStatic","isSymbol","res","escapeHtml","evaluated","evaluateConstant","normalizeClass","stringifyStyle","normalizeStyle","scopeId","stringifyElement","toDisplayString","c","ignoreSideEffectTags","removeNode","DOMNodeTransforms","DOMDirectiveTransforms","cloak","noopDirectiveTransform","html","dir","createObjectProperty","text","helperString","TO_DISPLAY_STRING","model","baseResult","transformModel","isCustomElement","directiveToUse","isInvalidType","findProp","hasDynamicKeyVBind","needRuntime","filter","on","transformOn","handlerExp","keyModifiers","nonKeyModifiers","eventOptionModifiers","modifier","checkCompatEnabled","resolveModifiers","includes","modifierPostfix","capitalize","show","baseCompile","nodeTransforms","directiveTransforms","transformHoist","parse","baseParse","sourceMap","parser","estreeWalker","defaultOnError","error","defaultOnWarn","msg","messages","additionalMessage","errorMessages","SyntaxError","0","1","2","3","4","5","6","7","8","9","10","11","12","13","14","15","16","17","18","19","21","20","22","23","24","25","26","27","28","29","30","31","32","33","34","35","36","37","38","39","40","41","42","43","44","45","46","47","48","FRAGMENT","TELEPORT","SUSPENSE","KEEP_ALIVE","BASE_TRANSITION","OPEN_BLOCK","CREATE_BLOCK","CREATE_VNODE","CREATE_COMMENT","CREATE_TEXT","RESOLVE_COMPONENT","RESOLVE_DYNAMIC_COMPONENT","RESOLVE_DIRECTIVE","RESOLVE_FILTER","WITH_DIRECTIVES","RENDER_LIST","RENDER_SLOT","CREATE_SLOTS","MERGE_PROPS","TO_HANDLERS","CAMELIZE","CAPITALIZE","TO_HANDLER_KEY","SET_BLOCK_TRACKING","PUSH_SCOPE_ID","POP_SCOPE_ID","WITH_SCOPE_ID","WITH_CTX","UNREF","IS_REF","helperNameMap","locStub","source","start","line","column","createRoot","helpers","components","directives","imports","temps","createVNodeCall","patchFlag","dynamicProps","isBlock","disableTracking","createArrayExpression","elements","createObjectExpression","properties","constType","callee","args","arguments","createFunctionExpression","params","returns","newline","isSlot","createConditionalExpression","consequent","alternate","createCacheExpression","isVNode","expected","hyphenate","isCoreComponent","nonIdentifierRE","isSimpleIdentifier","memberExpRE","isMemberExpression","matched","trim","getInnerRange","newLoc","advancePositionWithClone","pos","numberOfCharacters","advancePositionWithMutation","linesCount","lastNewLinePos","charCodeAt","findDir","allowEmpty","dynamicOnly","isBindKey","isText","isVSlot","isTemplateNode","isSlotOutlet","injectProp","prop","propsWithInjection","first","unshift","alreadyExists","propKeyName","toValidAssetId","replace","hasScopeRef","ids","branches","b","condition","isObject","deprecationData","COMPILER_IS_ON_ELEMENT","message","link","COMPILER_V_BIND_SYNC","COMPILER_V_BIND_PROP","COMPILER_V_BIND_OBJECT_ORDER","COMPILER_V_ON_NATIVE","COMPILER_V_IF_V_FOR_PRECEDENCE","COMPILER_V_FOR_REF","COMPILER_NATIVE_TEMPLATE","COMPILER_INLINE_TEMPLATE","COMPILER_FILTER","getCompatValue","config","compatConfig","isCompatEnabled","mode","decodeRE","decodeMap","apos","defaultParserOptions","delimiters","getNamespace","getTextMode","NO","_","p1","comments","rawOptions","originalSource","inPre","inVPre","createParserContext","getCursor","parseChildren","getSelection","ancestors","last","nodes","isEnd","s","startsWith","parseInterpolation","emitError","parseComment","parseBogusComment","parseCDATA","advanceBy","parseTag","parseElement","isSpecialTemplateDirective","parseText","isArray","pushNode","removedWhitespace","preserve","whitespace","prev","next","Boolean","match","prevIndex","nestedIndex","contentStart","closeIndex","wasInPre","wasInVPre","element","isPreBoundary","isVPreBoundary","isSelfClosing","pop","inlineTemplateProp","find","startsWithEndTagOpen","advanceSpaces","cursor","currentSource","parseAttributes","hasVIs","attributeNames","Set","attr","parseAttribute","nameSet","has","add","pattern","m","quote","isQuoted","endIndex","parseTextData","unexpectedChars","parseAttributeValue","dirName","startOffset","lastIndexOf","getNewPosition","valueLoc","split","open","close","innerStart","innerEnd","rawContentLength","rawContent","preTrimContent","endTokens","xs","searchString","root","isSingleElementRoot","doNotHoistNode","hasHoistedNode","canStringify","constantType","getConstantType","hoist","flag","getPatchFlag","getGeneratedPropsConstantType","getNodeProps","contentType","isComponent","constantCache","get","set","returnType","generatedPropsType","childType","expType","removeHelper","keyType","valueType","createTransformContext","filename","prefixIdentifiers","cacheHandlers","expressionPlugins","slotted","ssr","ssrCssVars","bindingMetadata","EMPTY_OBJ","inline","isTS","nameMatch","selfName","camelize","Map","identifiers","vFor","vPre","vOnce","currentNode","childIndex","count","currentCount","delete","list","removalIndex","onNodeRemoved","addId","removeId","identifier","cache","id","filters","transform","traverseNode","PatchFlagNames","createRootCodegen","exitFns","onExit","nodeRemoved","traverseChildren","createStructuralDirectiveTransform","fn","matches","PURE_ANNOTATION","createCodegenContext","ast","sourceMap$1","optimizeImports","runtimeGlobalName","runtimeModuleName","indentLevel","pure","addMapping","withoutNewLine","repeat","original","generated","SourceMapGenerator","setSourceContent","generate","onContextCreated","indent","deindent","hasHelpers","useWithBlock","genScopeId","isSetupInlined","preambleContext","ssrHelpers","importsOptions","genNode","genImports","genHoists","genModulePreamble","VueBinding","aliasHelper","genFunctionPreamble","functionName","signature","genAssets","preamble","toJSON","assets","resolver","maybeSelfReference","genNodeListAsArray","multilines","isText$1","genNodeList","comma","genText","genExpression","genInterpolation","genCompoundExpression","genComment","genNullableArgs","genVNodeCall","genCallExpression","genExpressionAsPropertyKey","genObjectExpression","genArrayExpression","isNonScopedSlot","genFunctionExpression","needNewline","needsParens","isNested","genConditionalExpression","genCacheExpression","l","genTemplateLiteral","genIfStatement","left","right","genAssignmentExpression","expressions","genSequenceExpression","genReturnStatement","isLiteralWhitelisted","transformExpression","processExpression","asParams","asRawStatements","rewriteIdentifier","raw","hasOwn","isAssignmentLVal","isUpdateArg","argument","isDestructureAssignment","isInDestructureAssignment","parentStack","rVal","operator","rExpString","stringifyExpression","rawExp","prefix","isPrefix","postfix","bailConstant","isScopeVarReference","isAllowedGlobal","isGloballyWhitelisted","isLiteral","plugins","babelParserDefaultPlugins","program","knownIds","isDuplicate","needPrefix","isFunction","isStaticPropertyKey","property","computed","shouldPrefix","isStaticProperty","shorthand","isConstant","scopeIds","expression","ret","sort","leadingText","transformIf","processIf","ifNode","branch","isRoot","siblings","sibling","createCodegenNodeForBranch","getParentCondition","processCodegen","createIfBranch","replaceNode","userKey","isSameKey","keyIndex","createChildrenCodegenNode","keyProperty","firstChild","vnodeCall","branchExp","transformFor","processFor","forNode","renderExp","keyProp","isStableFragment","fragmentFlag","childBlock","isTemplate","needFragmentWrapper","slotOutlet","createForLoopParams","parseResult","parseForExpression","addIdentifiers","removeIdentifiers","valueAlias","keyAlias","objectIndexAlias","forAliasRE","forIteratorRE","stripParensRE","input","inMatch","LHS","RHS","createAliasExpression","valueContent","trimmedOffset","iteratorMatch","keyContent","keyOffset","indexContent","range","defaultFallback","trackSlotScopes","slotProps","trackVForSlotScopes","buildClientSlotFn","buildSlots","buildSlotFn","slotsProperties","dynamicSlots","hasDynamicSlots","onComponentSlot","hasTemplateSlots","hasNamedDefaultSlot","implicitDefaultChildren","seenSlotNames","slotElement","slotDir","slotChildren","slotLoc","slotName","dirLoc","staticSlotName","slotFunction","vIf","vElse","buildDynamicSlot","j","conditional","buildDefaultSlotProperty","isNonWhitespaceContent","slotFlag","hasForwardedSlots","slots","concat","directiveImportMap","WeakMap","transformElement","vnodeTag","resolveComponentType","vnodeProps","vnodeChildren","vnodePatchFlag","vnodeDynamicProps","dynamicPropNames","vnodeDirectives","shouldUseBlock","propsBuildResult","buildProps","dirArgs","runtime","fromSetup","resolveSetupReference","trueExpression","buildDirectiveArgs","hasDynamicTextChild","propsNamesString","stringifyDynamicPropNames","isExplicitDynamic","isComponentTag","isProp","builtIn","bindings","__isScriptSetup","camelName","PascalName","checkType","fromConst","fromMaybeRef","elementLoc","mergeArgs","runtimeDirectives","hasRef","hasClassBinding","hasStyleBinding","hasHydrationEventBinding","hasDynamicKeys","hasVnodeHook","analyzePatchFlag","isEventHandler","isOn","isReservedProp","isVBind","isVOn","dedupeProperties","directiveTransform","propsExpression","knownProps","deduped","existing","mergeAsArray","incoming","camelizeRE","str","cacheStringFunction","toUpperCase","transformSlotOutlet","processSlotOutlet","slotArgs","nonNameProps","fnExpRE","augmentor","eventName","rawName","toHandlerKey","shouldCache","isMemberExp","isInlineStatement","hasMultipleStatements","transformBind","_node","transformText","currentContainer","hasText","callArgs","seen","WeakSet","transformOnce","cur","createTransformProps","expString","bindingType","maybeRef","propName","assignmentExp","eventArg","altAssignment","modifiersKey","validDivisionCharRE","transformFilter","rewriteFilter","parseFilter","inSingle","inDouble","inTemplateString","inRegex","curly","square","paren","lastFilterIndex","charAt","pushFilter","wrapFilter","getBaseTransformPreset","bind","generateCodeFrame","assert","Error","isModuleMode","createAssignmentExpression","createBlockStatement","createIfStatement","createInterpolation","createReturnStatement","createSequenceExpression","createTemplateLiteral","getOwnPropertySymbols","warnDeprecation","err","expectsLowerCase","val","slotFlagsText","GLOBALS_WHITE_LISTED","lines","lineLength","pad","min","specialBooleanAttrs","isSpecialBooleanAttr","isBooleanAttr","unsafeAttrCharRE","attrValidationCache","isSSRSafeAttrName","hasOwnProperty","isUnsafe","console","propsToAttrMap","acceptCharset","className","htmlFor","httpEquiv","isNoUnitNumericStyleProp","item","listDelimiterRE","propertyDelimiterRE","tmp","styles","normalizedKey","HTML_TAGS","SVG_TAGS","VOID_TAGS","escapeRE","string","escaped","lastIndex","substring","commentStripRE","escapeHtmlComment","src","looseCompareArrays","equal","looseEqual","aValidType","isDate","bValidType","getTime","aHasKey","bHasKey","looseIndexOf","arr","findIndex","replacer","_key","isMap","size","entries","isSet","values","isPlainObject","EMPTY_ARR","onRE","isModelListener","assign","remove","prototype","call","Array","toTypeString","Date","isPromise","then","catch","objectToString","toString","toRawType","isIntegerKey","hyphenateRE","hasChanged","oldValue","invokeArrayFns","fns","def","obj","configurable","enumerable","toNumber","parseFloat","isNaN","_globalThis","getGlobalThis","globalThis","self","window","global","SourceMapConsumer","SourceNode","base64VLQ","util","ArraySet","MappingList","aArgs","this","_file","getArg","_sourceRoot","_skipValidation","_sources","_names","_mappings","_sourcesContents","_version","fromSourceMap","aSourceMapConsumer","sourceRoot","generator","file","eachMapping","mapping","newMapping","generatedLine","generatedColumn","relative","originalLine","originalColumn","sources","sourceFile","sourceRelative","sourceContentFor","_validateMapping","aSourceFile","aSourceContent","toSetString","applySourceMap","aSourceMapPath","newSources","newNames","unsortedForEach","originalPositionFor","aGenerated","aOriginal","aSource","aName","_serializeMappings","nameIdx","sourceIdx","previousGeneratedColumn","previousGeneratedLine","previousOriginalColumn","previousOriginalLine","previousName","previousSource","mappings","toArray","len","compareByGeneratedPositionsInflated","encode","_generateSourcesContent","aSources","aSourceRoot","version","names","sourcesContent","base64","aValue","digit","encoded","vlq","toVLQSigned","VLQ_BASE","decode","aStr","aIndex","aOutParam","continuation","shifted","strLen","shift","rest","intToCharMap","number","TypeError","charCode","aDefaultValue","urlRegexp","dataUrlRegexp","urlParse","aUrl","scheme","auth","host","port","urlGenerate","aParsedUrl","url","normalize","aPath","part","isAbsolute","parts","up","aRoot","aPathUrl","aRootUrl","joined","level","supportsNullProto","identity","isProtoString","strcmp","aStr1","aStr2","fromSetString","compareByOriginalPositions","mappingA","mappingB","onlyCompareOriginal","cmp","compareByGeneratedPositionsDeflated","onlyCompareGenerated","parseSourceMapInput","computeSourceURL","sourceURL","sourceMapURL","parsed","hasNativeMap","_array","_set","fromArray","aArray","aAllowDuplicates","getOwnPropertyNames","sStr","idx","at","aIdx","_sorted","_last","aCallback","aThisArg","aMapping","lineA","lineB","columnA","columnB","binarySearch","quickSort","aSourceMap","aSourceMapURL","sections","IndexedSourceMapConsumer","BasicSourceMapConsumer","_absoluteSources","_sourceMapURL","Mapping","lastOffset","_sections","offsetLine","offsetColumn","generatedOffset","consumer","__generatedMappings","_parseMappings","__originalMappings","_charIsMappingSeparator","GENERATED_ORDER","ORIGINAL_ORDER","GREATEST_LOWER_BOUND","LEAST_UPPER_BOUND","aContext","aOrder","_generatedMappings","_originalMappings","allGeneratedPositionsFor","needle","_findSourceIndex","_findMapping","lastColumn","relativeSource","smc","generatedMappings","destGeneratedMappings","destOriginalMappings","srcMapping","destMapping","segment","cachedSegments","temp","originalMappings","aNeedle","aMappings","aLineName","aColumnName","aComparator","aBias","search","computeColumnSpans","nextMapping","lastGeneratedColumn","Infinity","hasContentsOfAllSources","sc","nullOnMissing","fileUriAbsPath","generatedPositionFor","constructor","sectionIndex","section","bias","every","generatedPosition","sectionMappings","adjustedMapping","recursiveSearch","aLow","aHigh","aHaystack","aCompare","mid","floor","swap","ary","x","y","doQuickSort","comparator","r","low","high","round","random","pivot","q","REGEX_NEWLINE","isSourceNode","aLine","aColumn","aChunks","sourceContents","fromStringWithSourceMap","aGeneratedCode","aRelativePath","remainingLines","remainingLinesIndex","shiftNextLine","getNextLine","lastGeneratedLine","lastMapping","nextLine","addMappingWithCode","aChunk","chunk","prepend","aFn","aSep","newChildren","replaceRight","aPattern","aReplacement","lastChild","walkSourceContents","toStringWithSourceMap","sourceMappingActive","lastOriginalSource","lastOriginalLine","lastOriginalColumn","lastOriginalName","sourceContent","beforeExpr","startsExpr","isLoop","isAssign","TokenType","label","conf","keyword","rightAssociative","binop","updateContext","keywords","createKeyword","token","createBinop","types","num","bigint","decimal","regexp","privateName","eof","bracketL","bracketHashL","bracketBarL","bracketR","bracketBarR","braceL","braceBarL","braceHashL","braceR","braceBarR","parenL","parenR","colon","doubleColon","dot","question","questionDot","arrow","ellipsis","backQuote","dollarBraceL","hash","interpreterDirective","eq","slashAssign","incDec","bang","tilde","pipeline","nullishCoalescing","logicalOR","logicalAND","bitwiseOR","bitwiseXOR","bitwiseAND","equality","relational","bitShift","plusMin","modulo","star","slash","exponent","_break","_case","_catch","_continue","_debugger","_default","_do","_else","_finally","_for","_function","_if","_return","_switch","_throw","_try","_var","_const","_while","_with","_new","_this","_super","_class","_extends","_export","_import","_null","_true","_false","_in","_instanceof","_typeof","_void","_delete","lineBreak","lineBreakG","RegExp","isNewLine","skipWhiteSpace","isWhitespace","Position","col","SourceLocation","identifierName","stack","ErrorCodes","SourceTypeModuleError","ErrorMessages","makeErrorTemplates","AccessorIsGenerator","ArgumentsInClass","AsyncFunctionInSingleStatementContext","AwaitBindingIdentifier","AwaitBindingIdentifierInStaticBlock","AwaitExpressionFormalParameter","AwaitNotInAsyncContext","AwaitNotInAsyncFunction","BadGetterArity","BadSetterArity","BadSetterRestParameter","ConstructorClassField","ConstructorClassPrivateField","ConstructorIsAccessor","ConstructorIsAsync","ConstructorIsGenerator","DeclarationMissingInitializer","DecoratorBeforeExport","DecoratorConstructor","DecoratorExportClass","DecoratorSemicolon","DecoratorStaticBlock","DeletePrivateField","DestructureNamedImport","DuplicateConstructor","DuplicateDefaultExport","DuplicateExport","DuplicateProto","DuplicateRegExpFlags","ElementAfterRest","EscapedCharNotAnIdentifier","ExportBindingIsString","ExportDefaultFromAsIdentifier","ForInOfLoopInitializer","ForOfAsync","ForOfLet","GeneratorInSingleStatementContext","IllegalBreakContinue","IllegalLanguageModeDirective","IllegalReturn","ImportBindingIsString","ImportCallArgumentTrailingComma","ImportCallArity","ImportCallNotNewExpression","ImportCallSpreadArgument","InvalidBigIntLiteral","InvalidCodePoint","InvalidDecimal","InvalidDigit","InvalidEscapeSequence","InvalidEscapeSequenceTemplate","InvalidEscapedReservedWord","InvalidIdentifier","InvalidLhs","InvalidLhsBinding","InvalidNumber","InvalidOrMissingExponent","InvalidOrUnexpectedToken","InvalidParenthesizedAssignment","InvalidPrivateFieldResolution","InvalidPropertyBindingPattern","InvalidRecordProperty","InvalidRestAssignmentPattern","LabelRedeclaration","LetInLexicalBinding","LineTerminatorBeforeArrow","MalformedRegExpFlags","MissingClassName","MissingEqInAssignment","MissingSemicolon","MissingUnicodeEscape","MixingCoalesceWithLogical","ModuleAttributeDifferentFromType","ModuleAttributeInvalidValue","ModuleAttributesWithDuplicateKeys","ModuleExportNameHasLoneSurrogate","ModuleExportUndefined","MultipleDefaultsInSwitch","NewlineAfterThrow","NoCatchOrFinally","NumberIdentifier","NumericSeparatorInEscapeSequence","ObsoleteAwaitStar","OptionalChainingNoNew","OptionalChainingNoTemplate","OverrideOnConstructor","ParamDupe","PatternHasAccessor","PatternHasMethod","PipelineBodyNoArrow","PipelineBodySequenceExpression","PipelineHeadSequenceExpression","PipelineTopicUnused","PrimaryTopicNotAllowed","PrimaryTopicRequiresSmartPipeline","PrivateInExpectedIn","PrivateNameRedeclaration","RecordExpressionBarIncorrectEndSyntaxType","RecordExpressionBarIncorrectStartSyntaxType","RecordExpressionHashIncorrectStartSyntaxType","RecordNoProto","RestTrailingComma","SloppyFunction","StaticPrototype","StrictDelete","StrictEvalArguments","StrictEvalArgumentsBinding","StrictFunction","StrictNumericEscape","StrictOctalLiteral","StrictWith","SuperNotAllowed","SuperPrivateField","TrailingDecorator","TupleExpressionBarIncorrectEndSyntaxType","TupleExpressionBarIncorrectStartSyntaxType","TupleExpressionHashIncorrectStartSyntaxType","UnexpectedArgumentPlaceholder","UnexpectedAwaitAfterPipelineBody","UnexpectedDigitAfterHash","UnexpectedImportExport","UnexpectedKeyword","UnexpectedLeadingDecorator","UnexpectedLexicalDeclaration","UnexpectedNewTarget","UnexpectedNumericSeparator","UnexpectedPrivateField","UnexpectedReservedWord","UnexpectedSuper","UnexpectedToken","UnexpectedTokenUnaryExponentiation","UnsupportedBind","UnsupportedDecoratorExport","UnsupportedDefaultExport","UnsupportedImport","UnsupportedMetaProperty","UnsupportedParameterDecorator","UnsupportedPropertyDecorator","UnsupportedSuper","UnterminatedComment","UnterminatedRegExp","UnterminatedString","UnterminatedTemplate","VarRedeclaration","YieldBindingIdentifier","YieldInParameter","ZeroDigitNumericSeparator","SourceTypeModuleErrorMessages","ImportMetaOutsideModule","ImportOutsideModule","templates","reasonCode","TokContext","preserveSpace","brace","templateQuasi","tt","nonASCIIidentifierStartChars","nonASCIIidentifierChars","nonASCIIidentifierStart","nonASCIIidentifier","astralIdentifierStartCodes","astralIdentifierCodes","isInAstralSet","isIdentifierStart","fromCharCode","isIdentifierChar","reservedWords","reservedWordsStrictSet","reservedWordsStrictBindSet","isReservedWord","word","inModule","isStrictReservedWord","isStrictBindOnlyReservedWord","isStrictBindReservedWord","isKeyword","reservedWordLikeSet","SCOPE_CLASS","SCOPE_TS_MODULE","BIND_FLAGS_CLASS","BIND_FLAGS_TS_EXPORT_ONLY","BIND_FLAGS_FLOW_DECLARE_FN","Scope","flags","var","lexical","functions","ScopeHandler","raise","scopeStack","undefinedExports","undefinedPrivateNames","inFunction","currentVarScopeFlags","allowSuper","currentThisScopeFlags","allowDirectSuper","inClass","inClassAndNotInNonArrowFunction","inStaticBlock","inNonArrowFunction","treatFunctionsAsVar","treatFunctionsAsVarInScope","currentScope","createScope","enter","exit","scope","declareName","checkRedeclarationInScope","maybeExportDefined","SCOPE_PROGRAM","isRedeclaredInScope","Errors","checkLocalExport","topLevelScope","FlowScope","super","declareFunctions","FlowScopeHandler","reservedTypes","FlowErrors","AmbiguousConditionalArrow","AmbiguousDeclareModuleKind","AssignReservedType","DeclareClassElement","DeclareClassFieldInitializer","DuplicateDeclareModuleExports","EnumBooleanMemberNotInitialized","EnumDuplicateMemberName","EnumInconsistentMemberValues","EnumInvalidExplicitType","EnumInvalidExplicitTypeUnknownSupplied","EnumInvalidMemberInitializerPrimaryType","EnumInvalidMemberInitializerSymbolType","EnumInvalidMemberInitializerUnknownType","EnumInvalidMemberName","EnumNumberMemberNotInitialized","EnumStringMemberInconsistentlyInitailized","GetterMayNotHaveThisParam","ImportTypeShorthandOnlyInPureImport","InexactInsideExact","InexactInsideNonObject","InexactVariance","InvalidNonTypeImportInDeclareModule","MissingTypeParamDefault","NestedDeclareModule","NestedFlowComment","OptionalBindingPattern","SetterMayNotHaveThisParam","SpreadVariance","ThisParamAnnotationRequired","ThisParamBannedInConstructor","ThisParamMayNotBeOptional","ThisParamMustBeFirst","ThisParamNoDefault","TypeBeforeInitializer","TypeCastInPattern","UnexpectedExplicitInexactInObject","UnexpectedReservedType","UnexpectedReservedUnderscore","UnexpectedSpaceBetweenModuloChecks","UnexpectedSpreadType","UnexpectedSubtractionOperand","UnexpectedTokenAfterTypeParameter","UnexpectedTypeParameterBeforeAsyncArrowFunction","UnsupportedDeclareExportKind","UnsupportedStatementInDeclareModule","UnterminatedFlowComment","hasTypeImportKind","importKind","isMaybeDefaultImport","state","exportSuggestions","const","let","interface","FLOW_PRAGMA_REGEX","entities","OElig","oelig","Scaron","scaron","Yuml","fnof","circ","Alpha","Beta","Gamma","Delta","Epsilon","Zeta","Eta","Theta","Iota","Kappa","Lambda","Mu","Nu","Xi","Omicron","Pi","Rho","Sigma","Tau","Upsilon","Phi","Chi","Psi","Omega","alpha","beta","gamma","delta","epsilon","zeta","eta","theta","iota","kappa","lambda","mu","nu","xi","omicron","pi","rho","sigmaf","sigma","tau","upsilon","phi","chi","psi","omega","thetasym","upsih","piv","ensp","emsp","thinsp","zwnj","zwj","lrm","rlm","ndash","mdash","lsquo","rsquo","sbquo","ldquo","rdquo","bdquo","dagger","Dagger","bull","hellip","permil","prime","Prime","lsaquo","rsaquo","oline","frasl","euro","image","weierp","real","trade","alefsym","larr","uarr","rarr","darr","harr","crarr","lArr","uArr","rArr","dArr","hArr","forall","exist","empty","nabla","isin","notin","ni","prod","sum","minus","lowast","radic","infin","ang","and","or","cap","cup","int","there4","sim","cong","asymp","ne","equiv","le","ge","sub","sup","nsub","sube","supe","oplus","otimes","perp","sdot","lceil","rceil","lfloor","rfloor","lang","rang","loz","spades","clubs","hearts","diams","State","strict","curLine","startLoc","endLoc","errors","potentialArrowAt","noArrowAt","noArrowParamsConversionAt","maybeInArrowParameters","inPipeline","inType","noAnonFunctionType","inPropertyName","hasFlowComment","isAmbientContext","inAbstractClass","topicContext","maxNumOfResolvableTopics","maxTopicIndex","soloAwait","inFSharpPipelineDirectBody","labels","decoratorStack","trailingComments","leadingComments","commentStack","commentPreviousNode","lineStart","lastTokEndLoc","lastTokStartLoc","lastTokStart","lastTokEnd","ct","exprAllowed","containsEsc","strictErrors","tokensLength","init","strictMode","sourceType","startLine","curPosition","clone","skipArrays","HEX_NUMBER","DECIMAL_NUMBER","JsxErrors","AttributeIsEmpty","MissingClosingTagElement","MissingClosingTagFragment","UnexpectedSequenceExpression","UnsupportedJsxValue","UnterminatedJsxContent","UnwrappedAdjacentJSXElements","isFragment","object","getQualifiedJSXName","namespace","tc","j_oTag","j_cTag","j_expr","jsxName","jsxText","jsxTagStart","jsxTagEnd","TypeScriptScope","enums","constEnums","classes","exportOnlyBindings","TypeScriptScopeHandler","ProductionParameterHandler","stacks","currentFlags","hasAwait","hasYield","hasReturn","hasIn","functionFlags","isAsync","isGenerator","nonNull","TSErrors","AbstractMethodHasImplementation","AccesorCannotDeclareThisParameter","AccesorCannotHaveTypeParameters","ClassMethodHasDeclare","ClassMethodHasReadonly","ConstructorHasTypeParameters","DeclareAccessor","DeclareClassFieldHasInitializer","DeclareFunctionHasImplementation","DuplicateAccessibilityModifier","DuplicateModifier","EmptyHeritageClauseType","EmptyTypeArguments","EmptyTypeParameters","ExpectedAmbientAfterExportDeclare","ImportAliasHasImportType","IncompatibleModifiers","IndexSignatureHasAbstract","IndexSignatureHasAccessibility","IndexSignatureHasDeclare","IndexSignatureHasOverride","IndexSignatureHasStatic","InvalidModifierOnTypeMember","InvalidModifiersOrder","InvalidTupleMemberLabel","MixedLabeledAndUnlabeledElements","NonAbstractClassHasAbstractMethod","NonClassMethodPropertyHasAbstractModifer","OptionalTypeBeforeRequired","OverrideNotInSubClass","PatternIsOptional","PrivateElementHasAbstract","PrivateElementHasAccessibility","ReadonlyForMethodSignature","SetAccesorCannotHaveOptionalParameter","SetAccesorCannotHaveRestParameter","SetAccesorCannotHaveReturnType","StaticBlockCannotHaveModifier","TypeAnnotationAfterAssign","TypeImportCannotSpecifyDefaultAndNamed","UnexpectedParameterModifier","UnexpectedReadonly","UnexpectedTypeAnnotation","UnexpectedTypeCastInParameter","UnsupportedImportTypeArgument","UnsupportedParameterPropertyKind","UnsupportedSignatureParameterKind","tsIsAccessModifier","placeholder","PlaceHolderErrors","ClassNameIsRequired","hasPlugin","plugin","getPluginOption","option","PIPELINE_PROPOSALS","RECORD_AND_TUPLE_SYNTAX_TYPES","mixinPlugins","estree","superClass","parseRegExpLiteral","regex","estreeParseLiteral","parseBigIntLiteral","bigInt","BigInt","_unused","parseDecimalLiteral","parseLiteral","parseStringLiteral","parseNumericLiteral","parseNullLiteral","parseBooleanLiteral","directiveToStmt","directive","directiveLiteral","stmt","startNodeAt","extra","expressionValue","finishNodeAt","initFunction","checkDeclaration","isObjectProperty","getObjectOrClassMethodParams","method","isValidDirective","_stmt$expression$extr","parenthesized","stmtToDirective","addExtra","parseBlockBody","directiveStatements","d","pushClassMethod","classBody","isConstructor","allowsDirectSuper","parseMethod","typeParameters","parseMaybePrivateName","convertPrivateNameToPrivateIdentifier","getPrivateNameSV","isPrivateName","parseFunctionBody","allowExpression","isMethod","inClassScope","funcNode","startNode","kind","finishNode","parseClassProperty","propertyNode","parseClassPrivateProperty","parseObjectMethod","isPattern","isAccessor","parseObjectProperty","startPos","refExpressionErrors","toAssignable","isLHS","toAssignableObjectExpressionProp","finishCallExpression","optional","_node$arguments$","attributes","toReferencedArguments","parseExport","exported","specifiers","parseSubscript","base","noCalls","optionalChainMember","stop","chain","startNodeAtNode","hasPropertyAsPrivateName","isOptionalChain","isObjectMethod","jsx","jsxReadToken","out","chunkStart","ch","finishToken","getTokenFromCode","jsxReadEntity","jsxReadNewLine","normalizeCRLF","jsxReadString","entity","XHTMLEntities","jsxReadWord","jsxParseIdentifier","unexpected","jsxParseNamespacedName","eat","jsxParseElementName","newNode","jsxParseAttributeValue","jsxParseExpressionContainer","parseExprAtom","jsxParseEmptyExpression","jsxParseSpreadChild","parseExpression","expect","jsxParseAttribute","parseMaybeAssignAllowIn","jsxParseOpeningElementAt","jsxParseOpeningElementAfterName","selfClosing","jsxParseClosingElementAt","jsxParseElementAt","openingElement","closingElement","contents","openingFragment","closingFragment","isRelational","jsxParseElement","createLookaheadState","lookaheadState","curContext","prevType","flow","flowPragma","getScopeHandler","shouldParseTypes","shouldParseEnums","addComment","comment","flowParseTypeInitialiser","tok","oldInType","flowParseType","flowParsePredicate","moduloPos","expectContextual","flowParseTypeAndPredicateInitialiser","predicate","flowParseDeclareClass","flowParseInterfaceish","flowParseDeclareFunction","parseIdentifier","typeNode","typeContainer","flowParseTypeParameterDeclaration","flowParseFunctionTypeParams","typeAnnotation","resetEndLocation","semicolon","flowParseDeclare","insideModule","flowParseDeclareVariable","eatContextual","flowParseDeclareModuleExports","flowParseDeclareModule","isContextual","flowParseDeclareTypeAlias","flowParseDeclareOpaqueType","flowParseDeclareInterface","flowParseDeclareExportDeclaration","flowParseTypeAnnotatableIdentifier","BIND_KIND_VALUE","bodyNode","parseImport","hasModuleExport","bodyElement","declaration","isEsModuleType","isLet","suggestion","exportKind","flowParseTypeAnnotation","flowParseTypeAlias","flowParseOpaqueType","isClass","flowParseRestrictedIdentifier","extends","implements","mixins","flowParseInterfaceExtends","flowParseObjectType","allowStatic","allowExact","allowSpread","allowProto","allowInexact","flowParseQualifiedTypeIdentifier","flowParseTypeParameterInstantiation","flowParseInterface","checkNotUnderscore","checkReservedType","liberal","declare","supertype","impltype","flowParseTypeParameter","requireDefault","nodeStart","variance","flowParseVariance","ident","bound","defaultRequired","typeParameter","expectRelational","oldNoAnonFunctionType","flowParseTypeParameterInstantiationCallOrNew","flowParseTypeOrImplicitInstantiation","flowParseInterfaceType","flowParseObjectPropertyKey","flowParseObjectTypeIndexer","static","lookahead","flowParseObjectTypeInternalSlot","flowParseObjectTypeMethodish","flowParseFunctionTypeParam","flowParseObjectTypeCallProperty","valueNode","endDelim","exact","callProperties","indexers","internalSlots","inexact","protoStart","inexactStart","propOrInexact","flowParseObjectTypeProperty","flowObjectTypeSemicolon","proto","flowCheckGetterSetterParams","paramCount","node2","qualification","flowParseGenericType","flowParseTypeofType","flowParsePrimaryType","flowParseTupleType","lh","isThis","reinterpretTypeAsFunctionTypeParam","flowIdentToTypeAnnotation","isGroupedType","parseLiteralAtNode","createIdentifier","flowParsePostfixType","seenOptionalIndexedAccess","canInsertSemicolon","elementType","objectType","indexType","flowParsePrefixType","flowParseAnonFunctionWithoutParens","param","flowParseIntersectionType","flowParseUnionType","allowPrimitiveOverride","typeCastToParameter","allowExpressionBody","forwardNoArrowParamsConversionAt","parseFunctionBodyAndFinish","parseStatement","topLevel","flowParseEnumDeclaration","parseExpressionStatement","expr","shouldParseExportDeclaration","isExportDefaultSpecifier","parseExportDefaultExpression","parseConditional","refNeedsArrowPos","tryParse","failState","originalNoArrowAt","failed","tryParseConditionalConsequent","valid","invalid","getArrowLikeExpressions","parseMaybeAssign","disallowInvalid","arrows","finishArrowValidation","list1","list2","partition","isAssignable","_node$extra","toAssignableList","trailingComma","SCOPE_FUNCTION","checkParams","parseParenItem","typeCastNode","assertModuleNodeAllowed","decl","parseExportDeclaration","declarationNode","parseExportSpecifiers","parseExportFrom","eatExportStar","maybeParseExportNamespaceSpecifier","hasNamespace","parseClassId","isStatement","optionalId","parseClassMember","member","parseClassMemberFromModifier","isIterator","readIterator","readWord1","fullWord","finishOp","current","isIteratorStart","isBinding","exprList","trailingCommaPos","toReferencedList","isParenthesizedExpr","_expr$extra","parseArrayLike","canBePattern","isTuple","checkLVal","isClassMethod","isClassProperty","isNonstaticConstructor","isThisParam","pushClassPrivateMethod","parseClassSuper","superTypeParameters","implemented","checkGetterSetterParams","parsePropertyName","isPrivateNameAllowed","parseObjPropValue","parseAssignableListItemTypes","parseMaybeDefault","shouldParseDefaultImport","parseImportSpecifierLocal","specifier","contextDescription","local","maybeParseDefaultImportSpecifier","parseImportSpecifier","firstIdentIsString","firstIdent","parseModuleExportName","specifierTypeKind","isLookaheadContextual","as_ident","imported","__clone","nodeIsTypeImport","specifierIsTypeImport","checkReservedWord","parseBindingAtom","parseFunctionParams","allowModifiers","parseVarId","parseAsyncArrowFromCallExpression","shouldParseAsyncArrow","afterLeftParse","_jsx","_jsx2","_jsx3","abort","_arrowExpression$extr","arrowExpression","resetStartLocationFromNode","maybeUnwrapTypeCastExpression","aborted","async","thrown","parseArrow","shouldParseArrow","setArrowFunctionParameters","allowDuplicates","isArrowFunction","parseParenAndDistinguishExpression","canBeArrow","parseSubscripts","parseCallExpressionArguments","parseAsyncArrowWithTypeParameters","subscriptState","isLookaheadToken_lt","typeArguments","parseNewArguments","targs","parseArrowExpression","readToken_mult_modulo","nextToken","readToken_pipe_amp","parseTopLevel","fileNode","skipBlockComment","skipFlowComment","hasFlowCommentCompletion","shiftToFirstNonWhiteSpace","ch2","ch3","flowEnumErrorBooleanMemberNotInitialized","enumName","memberName","flowEnumErrorInvalidMemberName","flowEnumErrorDuplicateMemberName","flowEnumErrorInconsistentMemberValues","flowEnumErrorInvalidExplicitType","suppliedType","flowEnumErrorInvalidMemberInitializer","explicitType","flowEnumErrorNumberMemberNotInitialized","flowEnumErrorStringMemberInconsistentlyInitailized","flowEnumMemberInit","endOfInit","literal","flowEnumMemberRaw","flowEnumCheckExplicitTypeMismatch","expectedType","flowEnumMembers","seenNames","members","booleanMembers","numberMembers","stringMembers","defaultedMembers","hasUnknownMembers","memberNode","flowEnumStringMembers","initializedMembers","flowEnumParseExplicitType","flowEnumBody","nameLoc","boolsLen","numsLen","strsLen","defaultedLen","nextTokenStart","afterNext","typescript","tsIsIdentifier","tsTokenCanFollowModifier","isLiteralPropertyName","hasPrecedingLineBreak","tsNextTokenCanFollowModifier","tsParseModifier","allowedModifiers","tsTryParse","tsParseModifiers","modified","disallowedModifiers","errorTemplate","enforceOrder","before","after","incompatible","mod1","mod2","accessibility","tsIsListTerminator","tsParseList","tsParseDelimitedList","tsParseDelimitedListWorker","expectSuccess","tsParseBracketedList","bracket","skipFirstToken","tsParseImportType","qualifier","tsParseEntityName","tsParseTypeArguments","allowReservedWords","tsParseTypeReference","typeName","tsParseThisTypePredicate","lhs","parameterName","tsParseTypeAnnotation","asserts","tsParseThisTypeNode","tsParseTypeQuery","exprName","tsParseTypeParameter","parseIdentifierName","constraint","tsEatThenParseType","tsTryParseTypeParameters","tsParseTypeParameters","tsTryNextParseConstantContext","tsFillSignature","returnToken","returnTokenRequired","parameters","tsParseBindingListForSignature","tsParseTypeOrTypePredicateAnnotation","parseBindingList","tsParseTypeMemberSemicolon","isLineTerminator","tsParseSignatureMember","tsIsUnambiguouslyIndexSignature","tsTryParseIndexSignature","tsLookAhead","tsTryParseTypeAnnotation","tsParsePropertyOrMethodSignature","readonly","nodeAny","firstParameter","tsParseTypeMember","tsParseTypeLiteral","tsParseObjectTypeMembers","tsIsStartOfMappedType","tsParseMappedTypeParameter","tsExpectThenParseType","tsParseMappedType","nameType","tsParseType","tsTryParseType","tsParseTupleType","elementTypes","tsParseTupleElementType","seenOptionalElement","labeledElements","elementNode","_labeledElements","isLabeled","labeledNode","optionalTypeNode","restNode","tsParseParenthesizedType","tsParseFunctionOrConstructorType","abstract","tsParseLiteralTypeNode","tsParseTemplateLiteralType","parseTemplate","parseTemplateSubstitution","tsParseThisTypeOrThisTypePredicate","thisKeyword","tsParseNonArrayType","keywordTypeFromName","lookaheadCharCode","parseMaybeUnary","tsParseArrayTypeOrHigher","tsParseTypeOperator","tsParseTypeOperatorOrHigher","tsCheckTypeAnnotationForReadOnly","tsParseInferType","kw","tsParseUnionOrIntersectionType","parseConstituentType","hasLeadingOperator","tsParseIntersectionTypeOrHigher","tsParseUnionTypeOrHigher","tsIsStartOfFunctionType","tsIsUnambiguouslyStartOfFunctionType","tsSkipParameterStart","braceStackCounter","tsInType","t","tsParseTypePredicateAsserts","thisTypePredicate","typePredicateVariable","tsParseTypePredicatePrefix","tsTryParseTypeOrTypePredicateAnnotation","eatColon","tsParseNonConditionalType","extendsType","trueType","falseType","isAbstractConstructorSignature","tsParseTypeAssertion","tsNextThenParseType","tsParseHeritageClause","descriptor","originalStart","delimitedList","tsParseExpressionWithTypeArguments","tsParseInterfaceDeclaration","tsParseTypeAliasDeclaration","tsInNoContext","cb","oldContext","tsDoThenParseType","tsParseEnumMember","initializer","tsParseEnumDeclaration","isConst","BIND_TS_ENUM","tsParseModuleBlock","parseBlockOrModuleBlockBody","tsParseModuleOrNamespaceDeclaration","nested","inner","prodParam","tsParseAmbientExternalModuleDeclaration","tsParseImportEqualsDeclaration","isExport","moduleReference","tsParseModuleReference","tsIsExternalModuleReference","tsParseExternalModuleReference","f","tsTryParseAndCatch","tsTryParseDeclare","nany","starttype","tsInAmbientContext","parseFunctionStatement","parseClass","parseVarStatement","tsParseDeclaration","tsTryParseExportDeclaration","tsParseExpressionStatement","mod","tsCheckLineTerminator","tsParseAbstractDeclaration","hasFollowingLineBreak","tsTryParseGenericAsyncArrowFunction","oldMaybeInArrowParameters","tsIsDeclarationStart","parseAssignableListItem","decorators","parseAccessModifier","elt","pp","parameter","bodilessType","registerFunctionStatementId","tsCheckForInvalidTypeCasts","items","isInParens","nonNullExpression","atPossibleAsyncArrow","asyncArrowFn","parseTaggedTemplateExpression","parseExprOp","leftStartPos","leftStartLoc","minPrec","reScan_lt_gt","checkKeywords","checkDuplicateExports","ahead","importNode","isAbstractClass","cls","parseStatementContent","tsHasSomeModifiers","invalidModifersForStaticBlocks","callParseClassMemberWithIsStatic","parseClassStaticBlock","parseClassMemberWithIsStatic","override","hadSuperClass","parsePostMemberNameModifiers","methodOrProp","isDeclare","resetStartLocation","parseClassPropertyAnnotation","definite","_typeCast","_typeCast2","_jsx4","_typeCast3","typeCast","_typeParameters","toAssignableParenthesizedExpression","_expr$extra2","parseMaybeDecoratorArguments","checkCommaAfterRest","readToken_lt_gt","canHaveLeadingDecorator","getGetterSetterExpectedParamCount","baseCount","firstParam","parseCatchClauseParam","oldIsAmbientContext","oldInAbstractClass","shouldParseAsAmbientContext","getExpression","v8intrinsic","parseV8Intrinsic","v8IntrinsicStart","placeholders","parsePlaceholder","expectedNode","assertNoSpace","finishPlaceholder","isFinished","verifyBreakContinue","parseBlock","parseFunctionId","takeDecorators","oldStrict","parseClassBody","expectPlugin","isUnparsedContextual","nextTokenStartSince","maybeParseExportDefaultSpecifier","checkExport","maybeParseStarImportSpecifier","parseNamedImportSpecifiers","parseImportSource","mixinPluginNames","defaultOptions","sourceFilename","allowAwaitOutsideFunction","allowReturnOutsideFunction","allowImportExportEverywhere","allowSuperOutsideMethod","allowUndeclaredExports","ranges","tokens","createParenthesizedExpressions","errorRecovery","VALID_REGEX_FLAGS","forbiddenNumericSeparatorSiblings","decBinOct","allowedNumericSeparatorSiblings","oct","bin","dec","Token","ClassScope","privateNames","loneAccessors","ClassScopeHandler","oldClassScope","from","declarePrivateName","classScope","redefined","CLASS_ELEMENT_KIND_GETTER","accessor","oldStatic","newStatic","usePrivateName","ExpressionScope","canBeArrowParameterDeclaration","isCertainlyParameterDeclaration","ArrowHeadParsingScope","recordDeclarationError","clearDeclarationError","iterateErrors","iterator","ExpressionScopeHandler","recordParameterInitializerError","recordParenthesizedIdentifierError","recordAsyncArrowParametersError","validateAsPattern","newExpressionScope","ExpressionErrors","shorthandAssign","doubleProto","Node","innerComments","unwrapParenthesizedExpression","loopLabel","switchLabel","loneSurrogate","keywordRelationalOperator","Parser","sawUnambiguousESM","ambiguousScriptDifferentAst","adjustCommentsAfterTrailingComma","takeAllComments","lastElement","newTrailingComments","leadingComment","processComment","lastInStack","firstTrailingCommentIndex","getLocationForPosition","getLineInfo","raiseWithData","raiseOverwrite","_raise","data","errorContext","isLookahead","pushToken","checkKeywordEscapes","old","curr","codePointAtPos","trail","setStrict","clear","skipSpace","readTmplToken","pushComment","block","skipLineComment","startSkip","loop","readToken_numberSign","readToken_interpreter","nextPos","readToken_dot","readNumber","readToken_slash","width","readToken_caret","readToken_plus_min","readToken_eq_excl","readToken_question","next2","readRadixNumber","readString","readWord","readRegexp","mods","char","readInt","radix","forceLen","allowNumSeparator","forbiddenSiblings","allowedSiblings","total","_isDigit","isBigInt","startsWithDot","isFloat","isDecimal","hasExponent","isOctal","hasLeadingZero","integer","recordStrictModeErrors","underscorePos","readCodePoint","throwOnInvalid","codePos","readHexChar","readEscapedChar","containsInvalid","inTemplate","octalStr","octal","firstCode","escStart","identifierCheck","esc","keywordTypes","_this$state$type$upda","_this$state$type","op","nameStart","nameEnd","nextCh","allowAsi","messageOrType","missingPlugin","expectOnePlugin","oldState","abortSignal","checkExpressionErrors","andThrow","initializeScopes","oldLabels","oldExportedIdentifiers","exportedIdentifiers","oldInModule","oldScope","oldProdParam","oldExpressionScope","expressionScope","enterInitialScopes","paramFlags","locationNode","_node$extra3","_node$extra2","isLast","raiseRestNotLast","checkToRestConversion","raiseTrailingCommaAfterRest","toReferencedListDeep","parseSpread","parseRestBinding","parseObjectLike","closeCharCode","elts","parseDecorator","_startLoc","_startPos","_left","checkClashes","disallowLetBinding","strictModeChanged","elem","checkProto","isRecord","protoRef","used","shouldExitDescending","disallowIn","disallowInAnd","parseExpressionBase","allowInAnd","parseMaybeAssignDisallowIn","parseYield","ownExpressionErrors","parseMaybeConditional","parseExprOps","prec","checkPipelineAtInfixOperator","logical","coalesce","parseExprOpRightExpr","nextOp","withTopicPermittingContext","parseSmartPipelineBody","parseExprOpBaseRightExpr","withSoloAwaitPermittingContext","parseFSharpPipelineBody","checkExponentialAfterUnary","sawUnary","isAwait","isAwaitAllowed","parseAwait","parseModuleExpression","update","isDelete","parseUpdate","isAmbiguousAwait","parseExprSubscripts","maybeAsyncArrow","parseBind","parseCoverCallAndAsyncArrowHead","parseMember","parsePrivateName","parseNoCallExpr","quasi","dynamicImport","allowPlaceholder","nodeForExtra","oldInFSharpPipelineDirectBody","parseExprListItem","_call$extra","parseSuper","parseImportMetaProperty","parseFunction","parseAsyncArrowUnaryFunction","parseDo","parseFunctionOrFunctionSent","parseDecorators","parseNewOrNewTarget","primaryTopicReferenceIsAllowedInCurrentTopicContext","registerTopicReference","lookaheadCh","codePointAt","meta","parseMetaProperty","propertyName","SourceTypeModuleErrors","innerStartPos","innerStartLoc","spreadStart","optionalCommaStart","spreadNodeStartPos","spreadNodeStartLoc","innerEndPos","innerEndLoc","arrowNode","parenExpression","metaProp","parseNew","parseExprList","parseTemplateElement","isTagged","cooked","tail","curElt","quasis","propHash","parsePropertyDefinition","maybeAsyncOrAccessorProp","keyName","_params","oldInPropertyName","isExpression","hasStrictModeDirective","nonSimple","isSimpleParamList","errorPos","functionStatement","functionExpression","canBeReservedWord","delegating","delegate","childExpression","checkSmartPipelineBodyEarlyErrors","parseSmartPipelineBodyInStyle","isSimpleReference","topicReferenceWasUsedInCurrentTopicContext","callback","outerContextTopicState","withTopicForbiddingContext","outerContextSoloAwaitState","revertScopes","parseProgram","hashEndPos","hashEndLoc","babel7CompatTokens","interpreter","parseInterpreterDirective","isLetKeyword","endCh","parseBreakContinueStatement","parseDebuggerStatement","parseDoStatement","parseForStatement","parseIfStatement","parseReturnStatement","parseSwitchStatement","parseThrowStatement","parseTryStatement","parseWhileStatement","parseWithStatement","parseEmptyStatement","nextTokenCharCode","isAsyncFunction","maybeName","parseLabeledStatement","allowExport","currentContextDecorators","decorator","isBreak","lab","parseHeaderExpression","awaitAt","parseFor","startsWithLet","parseVar","declarations","parseForIn","startsWithUnescapedName","isForOf","description","declarationPosition","discriminant","cases","sawDefault","isCase","simple","handler","clause","finalizer","statementStart","allowDirectives","createNewLexicalScope","afterBlockParse","parsedNonDirective","isForIn","await","isFor","isTypescript","statement","isHangingStatement","requireId","hadConstructor","publicMethod","privateMethod","publicProp","privateProp","publicMember","parseClassElementName","isPrivate","isSimple","maybeQuestionTokenStart","pushClassPrivateProperty","pushClassProperty","_member$decorators","CLASS_ELEMENT_KIND_SETTER","parseInitializer","hasDefault","parseAfterDefault","hasStar","parseAfterNamespace","isFromRequired","hasSpecifiers","maybeParseExportNamedSpecifiers","hasDeclaration","maybeParseExportDeclaration","FUNC_STATEMENT","hasFrom","nextAfterFrom","assertions","maybeParseImportAssertions","checkNames","isDefault","isFrom","_declaration$extra","exportedName","surrogate","parseNext","maybeParseModuleAttributes","parseAssertEntries","attrs","attrNames","importedIsString","opts","getOptions","pluginMap","pluginsMap","getParser","decoratorsBeforeExport","missingPlugins","validatePlugins","pluginsFromOptions","pluginList","parserClassCache","getParserClass","_options","moduleError","_unused2","factory","WalkerBase","should_skip","should_remove","skip","SyncWalker","leave","visit","_should_skip","_should_remove","_replacement","skipped","removed","AsyncWalker","asyncWalk","instance","runtimeCore","svgNS","doc","tempContainer","tempSVGContainer","nodeOps","insert","anchor","insertBefore","parentNode","removeChild","createElement","isSVG","is","createElementNS","multiple","setAttribute","createText","createTextNode","createComment","setText","nodeValue","setElementText","textContent","nextSibling","selector","cloned","cloneNode","_value","importantRE","setStyle","style","v","setProperty","prefixed","prefixCache","prefixes","autoPrefix","xlinkNS","_getNow","now","skipTimestampCheck","createEvent","timeStamp","performance","ffMatch","navigator","userAgent","cachedNow","Promise","resolve","reset","addEventListener","patchEvent","prevValue","nextValue","invokers","_vei","existingInvoker","optionsModifierRE","parseName","initialValue","invoker","attached","callWithAsyncErrorHandling","originalStop","stopImmediatePropagation","_stopped","patchStopImmediatePropagation","getNow","createInvoker","removeEventListener","nativeOnRE","ANIMATION","Transition","h","BaseTransition","resolveTransitionProps","displayName","DOMTransitionPropsValidators","css","duration","enterFromClass","enterActiveClass","enterToClass","appearFromClass","appearActiveClass","appearToClass","leaveFromClass","leaveActiveClass","leaveToClass","TransitionPropsValidators","callHook","hook","hasExplicitCallback","rawProps","baseProps","durations","NumberOf","normalizeDuration","enterDuration","leaveDuration","onBeforeEnter","onEnter","onEnterCancelled","onLeave","onLeaveCancelled","onBeforeAppear","onAppear","onAppearCancelled","finishEnter","isAppear","done","removeTransitionClass","finishLeave","makeEnterHook","nextFrame","addTransitionClass","whenTransitionEnds","forceReflow","classList","_vtc","requestAnimationFrame","endId","explicitTimeout","_endId","resolveIfNotStale","setTimeout","timeout","propCount","getTransitionInfo","endEvent","ended","onEnd","target","getComputedStyle","getStyleProperties","transitionDelays","transitionDurations","transitionTimeout","getTimeout","animationDelays","animationDurations","animationTimeout","hasTransform","delays","toMs","offsetHeight","positionMap","newPositionMap","TransitionGroup","moveClass","getCurrentInstance","useTransitionState","prevChildren","onUpdated","display","container","appendChild","hasCSSTransform","vnode","callPendingCbs","recordPosition","movedChildren","applyTranslation","webkitTransform","transitionDuration","_moveCb","toRaw","cssTransitionProps","Fragment","getTransitionRawChildren","setTransitionHooks","resolveTransitionHooks","getBoundingClientRect","createVNode","_enterCb","oldPos","newPos","dx","dy","top","getModelAssigner","onCompositionStart","composing","onCompositionEnd","initEvent","dispatchEvent","trigger","vModelText","lazy","_assign","castToNumber","domValue","activeElement","newValue","vModelCheckbox","modelValue","_modelValue","elementValue","getValue","checked","found","filtered","getCheckboxValue","mounted","setChecked","binding","vModelRadio","vModelSelect","isSetModel","selectedVal","o","selected","setSelected","_binding","isMultiple","optionValue","selectedIndex","vModelDynamic","callModelHook","prevVNode","modelToUse","tagName","getSSRProps","systemModifiers","modifierGuards","stopPropagation","prevent","preventDefault","currentTarget","ctrl","ctrlKey","shiftKey","alt","altKey","metaKey","button","middle","keyNames","space","down","vShow","transition","_vod","beforeEnter","setDisplay","rendererOptions","patchProp","parentComponent","parentSuspense","unmountChildren","transitionClasses","patchClass","removeAttribute","patchStyle","shouldSetAsProp","patchDOMProp","_trueValue","_falseValue","removeAttributeNS","setAttributeNS","isBoolean","patchAttr","forcePatchProp","renderer","enabledHydration","ensureRenderer","createRenderer","ensureHydrationRenderer","createHydrationRenderer","normalizeContainer","createApp","containerOrSelector","_component","proxy","SVGElement","Element","createSSRApp","hydrate","useCssModule","modules","__cssModules","useCssVars","getter","withKeys","eventKey","withModifiers","guard","reactivity","warn","pauseTracking","appWarnHandler","appContext","warnHandler","trace","currentVNode","normalizedStack","recurseCount","parentInstance","getComponentTrace","callWithErrorHandling","formatComponentName","warnArgs","logs","entry","formatProps","formatTraceEntry","formatTrace","resetTracking","formatProp","isRef","handleError","throwInDev","exposedInstance","errorInfo","errorCapturedHooks","appErrorHandler","errorHandler","contextVNode","logError","isFlushing","isFlushPending","queue","flushIndex","pendingPreFlushCbs","activePreFlushCbs","preFlushIndex","pendingPostFlushCbs","activePostFlushCbs","postFlushIndex","resolvedPromise","currentFlushPromise","currentPreFlushParentJob","nextTick","queueJob","job","allowRecurse","jobId","getId","findInsertionIndex","queueFlush","flushJobs","queueCb","activeQueue","pendingQueue","queuePostFlushCb","flushPreFlushCbs","parentJob","flushPostFlushCbs","active","emit","rawArgs","modelArg","handlerName","onceHandler","emitted","normalizeEmitsOptions","comp","asMixin","emitsCache","emits","hasExtends","extendEmits","normalizedFromExtend","isEmitListener","currentRenderingInstance","currentScopeId","setCurrentRenderingInstance","__scopeId","withCtx","ctx","_n","renderFnWithContext","_d","setBlockTracking","prevInstance","_c","renderComponentRoot","Component","withProxy","propsOptions","renderCache","setupState","inheritAttrs","fallthroughAttrs","shapeFlag","proxyToUse","normalizeVNode","getFunctionalFallthrough","filterModelListeners","cloneVNode","dirs","blockStack","Comment$1","filterSingleRoot","singleRoot","hasPropsChanged","prevProps","nextProps","emitsOptions","nextKeys","updateHOCHostEl","subTree","Suspense","__isSuspense","n1","n2","slotScopeIds","optimized","rendererInternals","patch","hiddenContainer","suspense","createSuspenseBoundary","pendingBranch","ssContent","deps","ssFallback","setActiveBranch","mountSuspense","um","unmount","newBranch","newFallback","activeBranch","isInFallback","isHydrating","isSameVNodeType","pendingId","effects","onPending","fallback","patchSuspense","hydrateNode","isSlotChildren","normalizeSuspenseSlot","Comment","move","isUnmounted","resume","delayEnter","afterLeave","hasUnresolvedAncestor","onResolve","fallbackVNode","onFallback","mountFallback","setupRenderEffect","isInPendingSuspense","hydratedEl","asyncDep","asyncSetupResult","suspenseId","asyncResolved","handleSetupResult","doRemove","isCompiledSlot","openBlock","currentBlock","closeBlock","singleChild","dynamicChildren","queueEffectWithSuspense","provide","currentInstance","provides","parentProvides","inject","defaultValue","treatDefaultAsFactory","INITIAL_WATCHER_VALUE","watch","doWatch","immediate","deep","flush","onTrack","onTrigger","cleanup","forceTrigger","isMultiSource","_shallow","isReactive","traverse","onInvalidate","baseGetter","runner","onStop","isInSSRComponentSetup","scheduler","queuePostRenderEffect","isMounted","queuePreFlushCb","effect","recordInstanceBoundEffect","instanceWatch","publicThis","createPathGetter","segments","isLeaving","isUnmounting","leavingVNodes","onMounted","onBeforeUnmount","TransitionHookValidator","appear","persisted","onAfterEnter","onBeforeLeave","onAfterLeave","onAfterAppear","prevTransitionKey","emptyPlaceholder","innerChild","getKeepAliveChild","enterHooks","oldChild","oldInnerChild","transitionKeyChanged","getTransitionKey","leavingHooks","delayLeave","earlyRemove","delayedLeave","getLeavingNodesForType","_leaveCb","leavingVNodesCache","hooks","leavingVNode","afterHook","cancelHook","called","cancelled","isKeepAlive","keepComment","keyedFragmentCount","defineComponent","setup","isAsyncWrapper","__asyncLoader","createInnerComp","ref","__isKeepAlive","KeepAlive","include","exclude","sharedContext","_unmount","storageContainer","resetShapeFlag","pruneCache","getComponentName","pruneCacheEntry","activate","isDeactivated","vnodeHook","onVnodeMounted","invokeVNodeHook","deactivate","da","onVnodeUnmounted","pendingCacheKey","cacheSubtree","getInnerChild","rawVNode","__asyncResolved","cachedVNode","onActivated","registerKeepAliveHook","onDeactivated","wrappedHook","__wdc","injectHook","injectToKeepAliveRoot","keepAliveRoot","injected","onUnmounted","__weh","setCurrentInstance","createHook","lifecycle","onBeforeMount","onBeforeUpdate","onServerPrefetch","onRenderTriggered","onRenderTracked","onErrorCaptured","shouldCacheAccess","applyOptions","resolveMergedOptions","beforeCreate","dataOptions","computedOptions","methods","watchOptions","provideOptions","injectOptions","created","beforeMount","beforeUpdate","updated","activated","deactivated","beforeDestroy","beforeUnmount","destroyed","unmounted","renderTracked","renderTriggered","errorCaptured","serverPrefetch","expose","checkDuplicateProperties","normalizeInject","opt","resolveInjections","methodHandler","reactive","createWatcher","Reflect","ownKeys","registerLifecycleHook","register","_hook","exposed","proxyRefs","toRef","extendsOptions","globalMixins","optionsCache","optionMergeStrategies","resolved","mergeOptions","to","strats","strat","internalOptionMergeStrats","mergeDataFn","mergeObjectOptions","mergeHook","setFullProps","needCastKeys","rawCastValues","hasAttrsChanged","camelKey","rawCurrentProps","castValues","resolvePropValue","isAbsent","propsDefaults","normalizePropsOptions","propsCache","extendProps","validatePropName","booleanIndex","getTypeIndex","stringIndex","getType","ctor","isSameType","expectedTypes","isInternalKey","normalizeSlotValue","normalizeSlot","rawSlot","normalizeObjectSlots","rawSlots","_ctx","normalizeVNodeSlots","invokeDirectiveHook","oldBindings","createAppContext","globalProperties","compilerOptions","uid","createAppAPI","rootComponent","rootProps","installedPlugins","_uid","_props","_container","_context","install","mixin","rootContainer","isHydrate","__vue_app__","hasMismatch","isSVGContainer","namespaceURI","isComment","createHydrationFunctions","mt","mountComponent","isFragmentStart","onMismatch","handleMismatch","domType","nextNode","Text","Static","needToAdoptContent","staticCount","outerHTML","hydrateFragment","hydrateElement","locateClosingAsyncAnchor","previousSibling","createTextVNode","hydrateChildren","setRef","onClick","vnodeHooks","onVnodeBeforeMount","parentVNode","fragmentSlotScopeIds","prodEffectOptions","rawRef","oldRawRef","isUnmount","refValue","owner","oldRef","refs","doSet","baseCreateRenderer","createHydrationFns","hostInsert","hostRemove","hostPatchProp","hostForcePatchProp","hostCreateElement","hostCreateText","hostCreateComment","hostSetText","hostSetElementText","hostParentNode","hostNextSibling","setScopeId","hostSetScopeId","hostCloneNode","insertStaticContent","hostInsertStaticContent","getNextHostNode","processText","processCommentNode","mountStaticNode","processFragment","processElement","processComponent","process","internals","mountElement","patchElement","mountChildren","needCallTransitionHooks","cloneIfMounted","oldProps","newProps","onVnodeBeforeUpdate","patchProps","class","propsToUpdate","areChildrenSVG","patchBlockChildren","patchChildren","onVnodeUpdated","oldChildren","fallbackContainer","oldVNode","newVNode","fragmentStartAnchor","fragmentEndAnchor","traverseStaticChildren","updateComponent","initialVNode","createComponentInstance","setupComponent","registerDep","nextVNode","nextChildren","$stable","shouldUpdateComponent","updateComponentPreRender","invalidateJob","bu","u","originNext","nextTree","prevTree","bm","hydrateSubTree","scopedInitialVNode","rawPrevProps","kebabKey","camelizedKey","updateProps","needDeletionCheck","deletionComparisonTarget","updateSlots","c1","prevShapeFlag","c2","patchKeyedChildren","patchUnkeyedChildren","oldLength","newLength","commonLength","nextChild","parentAnchor","l2","e1","e2","s1","s2","keyToNewIndexMap","patched","toBePatched","moved","maxNewIndexSoFar","newIndexToOldIndexMap","prevChild","newIndex","increasingNewIndexSequence","arrI","getSequence","nextIndex","moveType","moveStaticNode","performLeave","shouldInvokeDirs","onVnodeBeforeUnmount","unmountComponent","removeFragment","removeStaticNode","performRemove","bum","_vnode","mc","pc","pbc","shallow","ch1","isTeleportDisabled","disabled","isTargetSVG","resolveTarget","select","targetSelector","moveTeleport","targetAnchor","isReorder","Teleport","__isTeleport","mainAnchor","wasDisabled","currentAnchor","nextTarget","targetNode","_lpa","COMPONENTS","NULL_DYNAMIC_COMPONENT","resolveAsset","warnMissing","registry","isBlockTreeEnabled","createBlock","__v_isVNode","InternalObjectKey","normalizeKey","normalizeRef","isBlockNode","normalizeChildren","__vccOpts","isProxy","klass","isSuspense","isTeleport","__v_skip","extraProps","mergeRef","mergedProps","mergeProps","slot","toMerge","ensureValidVNode","vnodes","getPublicInstance","isStatefulComponent","publicPropertiesMap","$","$el","$data","$props","$attrs","$slots","$refs","$parent","$root","$emit","$options","$forceUpdate","$nextTick","$watch","PublicInstanceProxyHandlers","accessCache","normalizedProps","publicGetter","cssModule","track","RuntimeCompiledPublicInstanceProxyHandlers","unscopables","emptyAppContext","uid$1","setupContext","bc","rtg","rtc","sp","isSSR","isStateful","shallowReactive","initProps","initSlots","setupResult","Proxy","createSetupContext","resolvedResult","finishComponentSetup","setupStatefulComponent","__ssrInlineRender","ssrRender","skipOptions","componentCompilerOptions","finalCompilerOptions","classifyRE","__file","inferFromRegistry","getterOrOptions","ssrContextKey","ssrUtils","customRef","isReadonly","markRaw","shallowReadonly","shallowRef","toRefs","triggerRef","unref","compatUtils","createCommentVNode","asBlock","createSlots","createStaticVNode","numberOfNodes","defineAsyncComponent","loader","loadingComponent","errorComponent","delay","suspensible","userOnError","resolvedComp","pendingRequest","retries","load","thisRequest","reject","toStringTag","loaded","delayed","defineEmit","defineProps","propsOrChildren","initCustomFormatter","isRuntimeOnly","popScopeId","pushScopeId","_compile","renderList","renderItem","renderSlot","noSlotted","validSlotContent","rendered","resolveComponent","resolveDirective","resolveDynamicComponent","resolveFilter","setDevtoolsHook","devtools","toHandlers","transformVNodeArgs","transformer","useContext","useSSRContext","watchEffect","withDirectives","withScopeId","_id","targetMap","effectStack","activeEffect","ITERATE_KEY","MAP_KEY_ITERATE_KEY","_isEffect","isEffect","enableTracking","createReactiveEffect","shouldTrack","trackStack","depsMap","dep","oldTarget","effectsToAdd","isNonTrackableKeys","builtInSymbols","createGetter","shallowGet","readonlyGet","shallowReadonlyGet","arrayInstrumentations","receiver","shallowReadonlyMap","readonlyMap","shallowReactiveMap","reactiveMap","targetIsArray","apply","createSetter","shallowSet","hadKey","mutableHandlers","deleteProperty","readonlyHandlers","shallowReactiveHandlers","shallowReadonlyHandlers","toReactive","toReadonly","toShallow","getProto","getPrototypeOf","get$1","isShallow","rawTarget","rawKey","wrap","has$1","set$1","deleteEntry","hadItems","createForEach","thisArg","observed","createIterableMethod","targetIsMap","isPair","isKeyOnly","innerIterator","createReadonlyMethod","mutableInstrumentations","shallowInstrumentations","readonlyInstrumentations","shallowReadonlyInstrumentations","createInstrumentationGetter","instrumentations","mutableCollectionHandlers","shallowCollectionHandlers","readonlyCollectionHandlers","shallowReadonlyCollectionHandlers","createReactiveObject","baseHandlers","collectionHandlers","proxyMap","existingProxy","targetType","isExtensible","rawType","targetTypeMap","convert","__v_isRef","RefImpl","_rawValue","newVal","createRef","rawValue","shallowUnwrapHandlers","CustomRefImpl","_get","ObjectRefImpl","_object","ComputedRefImpl","_setter","_dirty","setter","objectWithRefs","vue","devtoolsApi","hasSymbol","PolySymbol","matchedRouteKey","viewDepthKey","routerKey","routeLocationKey","routerViewLocationKey","isBrowser","applyToParams","newParams","noop","TRAILING_SLASH_RE","parseURL","parseQuery","location","currentLocation","query","searchPos","hashPos","fromSegments","toSegments","toPosition","position","resolveRelativePath","fullPath","stripBase","pathname","isSameRouteLocation","stringifyQuery","aLastIndex","bLastIndex","isSameRouteRecord","isSameRouteLocationParams","aliasOf","isSameRouteLocationParamsValue","isEquivalentArray","NavigationType","NavigationDirection","normalizeBase","baseEl","getAttribute","BEFORE_HASH_RE","createHref","computeScrollPosition","pageXOffset","pageYOffset","scrollToPosition","scrollToOptions","positionEl","isIdSelector","getElementById","foundEl","docRect","documentElement","elRect","behavior","getElementPosition","scrollTo","getScrollKey","scrollPositions","createBaseLocation","protocol","createCurrentLocation","slicePos","pathFromHash","buildState","back","forward","replaced","computeScroll","scroll","createWebHistory","historyNavigation","historyState","changeLocation","hashIndex","currentState","useHistoryStateNavigation","historyListeners","listeners","teardowns","pauseState","popStateHandler","fromState","listener","direction","unknown","beforeUnloadListener","replaceState","pauseListeners","listen","teardown","destroy","useHistoryListeners","routerHistory","go","triggerListeners","isRouteName","START_LOCATION_NORMALIZED","redirectedFrom","NavigationFailureSymbol","NavigationFailureType","ErrorTypeMessages","propertiesToLog","stringifyRoute","createRouterError","isNavigationFailure","BASE_PARAM_PATTERN","BASE_PATH_PARSER_OPTIONS","sensitive","REGEX_CHARS_RE","compareScoreArray","diff","comparePathParserScore","aScore","score","bScore","ROOT_TOKEN","VALID_PARAM_RE","createRouteRecordMatcher","record","extraOptions","segmentScores","tokenIndex","subSegmentScore","repeatable","re","subPattern","avoidDuplicatedSlash","tokensToParser","crash","buffer","previousState","finalizeSegment","customRe","consumeBuffer","addCharToBuffer","tokenizePath","existingKeys","matcher","alias","createRouterMatcher","globalOptions","matchers","matcherMap","addRoute","originalRecord","isRootAdd","mainNormalizedRecord","redirect","normalizeRecordProps","instances","leaveGuards","updateGuards","enterCallbacks","normalizeRouteRecord","normalizedRecords","aliases","originalMatcher","normalizedRecord","parentPath","connectingSlash","checkMissingParamsInAbsolutePath","checkSameParams","isAliasRecord","removeRoute","insertMatcher","matcherRef","route","paramsFromLocation","parentMatcher","mergeMetaFields","getRoutes","getRecordMatcher","propsObject","defaults","partialOptions","isSameParam","HASH_RE","AMPERSAND_RE","SLASH_RE","EQUAL_RE","IM_RE","PLUS_RE","ENC_BRACKET_OPEN_RE","ENC_BRACKET_CLOSE_RE","ENC_CARET_RE","ENC_BACKTICK_RE","ENC_CURLY_OPEN_RE","ENC_PIPE_RE","ENC_CURLY_CLOSE_RE","ENC_SPACE_RE","commonEncode","encodeURI","encodeQueryValue","encodeParam","encodePath","decodeURIComponent","searchParams","searchParam","eqPos","currentValue","normalizeQuery","normalizedQuery","useCallbacks","handlers","registerGuard","removeFromList","guardToPromiseFn","enterCallbackArray","guardReturn","_called","canOnlyBeCalledOnce","guardCall","resolvedValue","extractComponentsGuards","guardType","guards","rawComponent","promise","__warnedDefineAsync","componentPromise","resolvedComponent","useLink","currentRoute","activeRecordIndex","routeMatched","currentMatched","parentRecordPath","getOriginalPath","isActive","outer","innerValue","outerValue","includesParams","isExactActive","href","navigate","defaultPrevented","guardEvent","RouterLink","required","activeClass","exactActiveClass","custom","ariaCurrentValue","elClass","getLinkClass","linkActiveClass","linkExactActiveClass","__vrl_route","__vrl_active","__vrl_exactActive","aria-current","propClass","globalClass","defaultClass","slotContent","RouterView","parentName","warnDeprecatedUsage","injectedRoute","routeToDisplay","depth","matchedRouteRef","viewRef","oldInstance","oldName","matchedRoute","ViewComponent","currentName","routePropsOption","routeProps","formatRouteLocation","routeLocation","tooltip","omit","_custom","readOnly","formatDisplay","routerId","addDevtools","__hasDevtools","setupDevtoolsPlugin","packageName","homepage","logo","componentStateTypes","api","inspectComponent","payload","instanceData","editable","visitComponentTree","treeNode","componentInstance","tags","textColor","backgroundColor","ORANGE_400","LIME_500","BLUE_600","refreshRoutesView","notifyComponentUpdate","sendInspectorTree","routerInspectorId","navigationsLayerId","addTimelineLayer","color","addTimelineEvent","layerId","title","subtitle","logType","time","navigationId","beforeEach","groupId","__navigationId","afterEach","failure","status","activeRoutesPayload","resetMatchStateOnRouteRecord","isRouteMatching","markRouteRecordActive","rootNodes","formatRouteRecordForInspector","addInspector","icon","treeFilterPlaceholder","getInspectorTree","inspectorId","getInspectorState","__vd_id","nodeId","formatRouteRecordMatcherForStateInspector","sendInspectorState","fields","modifierForKey","__vd_match","__vd_exactActive","__vd_active","routeRecordId","EXTRACT_REGEXP_RE","childRoute","decodedPath","runGuardQueue","START_LOCATION","createMemoryHistory","setLocation","shouldTrigger","info","createRouter","parseQuery$1","stringifyQuery$1","beforeGuards","beforeResolveGuards","afterGuards","pendingLocation","scrollBehavior","scrollRestoration","normalizeParams","paramValue","encodeParams","decodeParams","rawLocation","locationNormalized","matcherLocation","stringifyURL","locationAsObject","checkCanceledNavigation","pushWithRedirect","handleRedirectRecord","lastMatched","newTargetLocation","targetLocation","force","shouldRedirect","toLocation","handleScroll","triggerError","_count","finalizeNavigation","triggerAfterEach","checkCanceledNavigationAndReject","leavingRecords","updatingRecords","enteringRecords","recordFrom","recordTo","extractChangingRecords","reverse","canceledNavigationCheck","isPush","isFirstNavigation","markAsReady","removeHistoryListener","setupListeners","_from","scrollPosition","ready","readyHandlers","errorHandlers","getSavedScrollPosition","started","installedApps","parentOrRoute","recordMatcher","hasRoute","routeMatcher","beforeResolve","isReady","$router","reactiveRoute","unmountApp","createWebHashHistory","onBeforeRouteLeave","leaveGuard","activeRecord","onBeforeRouteUpdate","updateGuard","useRoute","useRouter","pluginDescriptor","setupFn","__VUE_DEVTOOLS_PLUGINS__","getDevtoolsGlobalHook","getTarget","__VUE_DEVTOOLS_GLOBAL_HOOK__","interopDefault","defineInteropFlag","exportAll","dest","export","destName","HOOK_SETUP","H","G","I","B","__proto__","vm","valueAttribute","charset","nameless","og","group","namespacedAttribute","keyAttribute","twitter","htmlAttrs","attributesFor","headAttrs","bodyAttrs","contentAsAttribute","script","noscript","g","S","A","N","R","w","O","P","C","M","F","querySelectorAll","U","namespaced","tagNamespace","fullName","E","flat","metainfo","z","L","$metaManager","addMeta","T","D","J","ssrCleanedUp","compute","addSource","delSource","onRemoved","offsetParent","MutationObserver","removedNodes","disconnect","reallyUnmount","observe","childList","all","readyState","once","W","metaInfo","_component_metainfo","_vue","_component_router_view","_hoisted_1","_hoisted_2","_hoisted_3","_hoisted_4","_hoisted_5","_hoisted_6","_hoisted_7","_hoisted_8","_hoisted_9","_hoisted_10","_hoisted_11","_hoisted_12","_hoisted_13","_hoisted_14","_hoisted_15","_hoisted_16","_hoisted_17","_hoisted_18","_hoisted_19","_hoisted_20","_hoisted_21","_hoisted_22","_hoisted_23","_component_router_link","_withId","_component_path_form","_hoisted_24","V_VP8","TextEncoder","V_VP9","V_AV1","A_OPUS","A_VORBIS","A_MP4A","V_AVC1_42E01E","V_AVC1_640032","isSubsequenceOf","subsequence","containsSubsequence","haystack","startIndex","findFirstSubsequence","needles","needle_name","mimeCodecFor","blob","codecs","mimes","firstChunk","magicBytesOffset","audio_formats","opus","vorbis","vp8","vp9","av1","mp4a.40.2","avc1.42E01E","avc1.640032","extractMeta","ipfsPath","titleValue","_vueRouter","MediaSource","loadVideo","$route","newPath","oldPath","ipfs","$ipfs","agentVersion","node_id","video_element","mediaSource","onUpdateEndContinue","asyncIterableContents","appendNext","ev","sourceBuffer","endOfStream","appendBuffer","mimeCodec","addSourceBuffer","log","isTypeSupported","loadIpfsPath","reroute","URL","createObjectURL","revokeObjectURL","controls","muted","autoplay","is-danger","isInvalidIpfsPath","minlength","onUpdate:modelValue","_cache","$event","useIpfs","useGateway","localhostGatewayUrl","gatewayUrl","getBlockInfo","ls","cid","Vue","globSource","urlSource","PeerId","crypto","isIPFS","multiaddr","multibase","multicodec","multihashing","multihash","CID","HTTP","readURLContent","http","response","fetch","Request","Headers","TimeoutError","HTTPError","merge","ignoreUndefined","URLSearchParams","AbortController","anySignal","throwHttpErrors","credentials","resource","headers","transformSearchParams","json","abortController","signal","ms","timedOut","timeoutID","clearTimeout","ok","fromStream","ndjson","decoder","TextDecoder","buf","stream","isNodeReadableStream","iter","asyncIterator","return","isWebReadableStream","reader","getReader","read","releaseLock","isAsyncIterable","streamToAsyncIterator","post","put","AbortError","Response","fetchWithStreaming","parseHeaders","ResponseWithURL","onUploadProgress","request","XMLHttpRequest","overrideMimeType","setRequestHeader","onabort","upload","onprogress","responseType","handleEvent","responseURL","statusText","getAllResponseHeaders","onerror","onload","ontimeout","send","fetchWithProgress","isElectronMain","isElectron","IS_ENV_WITH_DOM","IS_ELECTRON","IS_BROWSER","IS_ELECTRON_MAIN","IS_ELECTRON_RENDERER","IS_NODE","release","IS_WEBWORKER","importScripts","WorkerGlobalScope","IS_TEST","env","IS_REACT_NATIVE","product","isTest","isElectronRenderer","isNode","isWebWorker","isEnvWithDom","isReactNative","cachedSetTimeout","cachedClearTimeout","defaultSetTimout","defaultClearTimeout","runTimeout","fun","currentQueue","draining","queueIndex","cleanUpNextTick","drainQueue","run","marker","runClearTimeout","Item","array","browser","argv","versions","addListener","off","removeListener","removeAllListeners","prependListener","prependOnceListener","cwd","chdir","umask","electron","getGlobal","isOptionObject","propertyIsEnumerable","writable","defaultMergeOptions","concatArrays","getEnumerableOwnPropertyKeys","symbols","symbol","cloneArray","cloneOptionObject","mergeKeys","merged","resultIndex","indices","URLWithLegacySupport","format","defaultBase","username","password","hostname","origin","userPass","protocolMap","defaultProtocol","urlParsed","impl","AbortSignal","signals","controller","onAbort","mh","cryptoKeys","withIs","PeerIdProto","uint8ArrayEquals","uint8ArrayFromString","uint8ArrayToString","PeerIdWithIs","privKey","pubKey","Uint8Array","public","bytes","_idB58String","toB58String","_privKey","_pubKey","decoded","unmarshalPublicKey","digest","marshalPublicKey","marshalPrivateKey","excludePriv","toBytes","marshalPubKey","marshalPrivKey","finish","pid","maxRunes","toB64Opt","toHexString","_idCIDString","toBaseEncodedString","equals","symbolName","computeDigest","computePeerId","bits","generateKeyPair","createFromHexString","fromHexString","createFromBytes","createFromB58String","createFromCID","codec","validMulticodec","isCID","createFromPubKey","createFromPrivKey","unmarshalPrivateKey","createFromJSON","fromB58String","rawPrivKey","rawPubKey","pub","privDigest","pubDigest","createFromProtobuf","isPeerId","peerId","varint","uint8ArrayConcat","codes","isValidCode","coerceCode","isAppCode","validate","hashfn","subarray","constants","encodeText","decodeText","encoding","nameOrCode","codeBuf","validEncode","enc","isEncoded","encodingFromData","baseX","Base","rfc4648","tupple","ALPHABET","BASE_MAP","xc","BASE","LEADER","FACTOR","iFACTOR","decodeUnsafe","psz","zeroes","b256","carry","it3","it4","vch","ArrayBuffer","isView","byteOffset","byteLength","pbegin","pend","b58","it1","it2","alphabet","textDecoder","textEncoder","arrs","output","bitsPerChar","mask","written","encodingLength","oldOffset","INT","pow","counter","RangeError","N1","N2","N3","N4","N5","N6","N7","N8","N9","sha1","sha2-256","sha2-512","sha3-512","sha3-384","sha3-256","sha3-224","shake-128","shake-256","keccak-224","keccak-256","keccak-384","keccak-512","blake3","murmur3-128","murmur3-32","dbl-sha2-256","md4","md5","bmt","sha2-256-trunc254-padded","ripemd-128","ripemd-160","ripemd-256","ripemd-320","x11","kangarootwelve","sm3-256","blake2b-8","blake2b-16","blake2b-24","blake2b-32","blake2b-40","blake2b-48","blake2b-56","blake2b-64","blake2b-72","blake2b-80","blake2b-88","blake2b-96","blake2b-104","blake2b-112","blake2b-120","blake2b-128","blake2b-136","blake2b-144","blake2b-152","blake2b-160","blake2b-168","blake2b-176","blake2b-184","blake2b-192","blake2b-200","blake2b-208","blake2b-216","blake2b-224","blake2b-232","blake2b-240","blake2b-248","blake2b-256","blake2b-264","blake2b-272","blake2b-280","blake2b-288","blake2b-296","blake2b-304","blake2b-312","blake2b-320","blake2b-328","blake2b-336","blake2b-344","blake2b-352","blake2b-360","blake2b-368","blake2b-376","blake2b-384","blake2b-392","blake2b-400","blake2b-408","blake2b-416","blake2b-424","blake2b-432","blake2b-440","blake2b-448","blake2b-456","blake2b-464","blake2b-472","blake2b-480","blake2b-488","blake2b-496","blake2b-504","blake2b-512","blake2s-8","blake2s-16","blake2s-24","blake2s-32","blake2s-40","blake2s-48","blake2s-56","blake2s-64","blake2s-72","blake2s-80","blake2s-88","blake2s-96","blake2s-104","blake2s-112","blake2s-120","blake2s-128","blake2s-136","blake2s-144","blake2s-152","blake2s-160","blake2s-168","blake2s-176","blake2s-184","blake2s-192","blake2s-200","blake2s-208","blake2s-216","blake2s-224","blake2s-232","blake2s-240","blake2s-248","blake2s-256","skein256-8","skein256-16","skein256-24","skein256-32","skein256-40","skein256-48","skein256-56","skein256-64","skein256-72","skein256-80","skein256-88","skein256-96","skein256-104","skein256-112","skein256-120","skein256-128","skein256-136","skein256-144","skein256-152","skein256-160","skein256-168","skein256-176","skein256-184","skein256-192","skein256-200","skein256-208","skein256-216","skein256-224","skein256-232","skein256-240","skein256-248","skein256-256","skein512-8","skein512-16","skein512-24","skein512-32","skein512-40","skein512-48","skein512-56","skein512-64","skein512-72","skein512-80","skein512-88","skein512-96","skein512-104","skein512-112","skein512-120","skein512-128","skein512-136","skein512-144","skein512-152","skein512-160","skein512-168","skein512-176","skein512-184","skein512-192","skein512-200","skein512-208","skein512-216","skein512-224","skein512-232","skein512-240","skein512-248","skein512-256","skein512-264","skein512-272","skein512-280","skein512-288","skein512-296","skein512-304","skein512-312","skein512-320","skein512-328","skein512-336","skein512-344","skein512-352","skein512-360","skein512-368","skein512-376","skein512-384","skein512-392","skein512-400","skein512-408","skein512-416","skein512-424","skein512-432","skein512-440","skein512-448","skein512-456","skein512-464","skein512-472","skein512-480","skein512-488","skein512-496","skein512-504","skein512-512","skein1024-8","skein1024-16","skein1024-24","skein1024-32","skein1024-40","skein1024-48","skein1024-56","skein1024-64","skein1024-72","skein1024-80","skein1024-88","skein1024-96","skein1024-104","skein1024-112","skein1024-120","skein1024-128","skein1024-136","skein1024-144","skein1024-152","skein1024-160","skein1024-168","skein1024-176","skein1024-184","skein1024-192","skein1024-200","skein1024-208","skein1024-216","skein1024-224","skein1024-232","skein1024-240","skein1024-248","skein1024-256","skein1024-264","skein1024-272","skein1024-280","skein1024-288","skein1024-296","skein1024-304","skein1024-312","skein1024-320","skein1024-328","skein1024-336","skein1024-344","skein1024-352","skein1024-360","skein1024-368","skein1024-376","skein1024-384","skein1024-392","skein1024-400","skein1024-408","skein1024-416","skein1024-424","skein1024-432","skein1024-440","skein1024-448","skein1024-456","skein1024-464","skein1024-472","skein1024-480","skein1024-488","skein1024-496","skein1024-504","skein1024-512","skein1024-520","skein1024-528","skein1024-536","skein1024-544","skein1024-552","skein1024-560","skein1024-568","skein1024-576","skein1024-584","skein1024-592","skein1024-600","skein1024-608","skein1024-616","skein1024-624","skein1024-632","skein1024-640","skein1024-648","skein1024-656","skein1024-664","skein1024-672","skein1024-680","skein1024-688","skein1024-696","skein1024-704","skein1024-712","skein1024-720","skein1024-728","skein1024-736","skein1024-744","skein1024-752","skein1024-760","skein1024-768","skein1024-776","skein1024-784","skein1024-792","skein1024-800","skein1024-808","skein1024-816","skein1024-824","skein1024-832","skein1024-840","skein1024-848","skein1024-856","skein1024-864","skein1024-872","skein1024-880","skein1024-888","skein1024-896","skein1024-904","skein1024-912","skein1024-920","skein1024-928","skein1024-936","skein1024-944","skein1024-952","skein1024-960","skein1024-968","skein1024-976","skein1024-984","skein1024-992","skein1024-1000","skein1024-1008","skein1024-1016","skein1024-1024","poseidon-bls12_381-a2-fc1","poseidon-bls12_381-a2-fc1-sc","getCodec","utf8Decoder","uint8ArrayToAsciiString","utf8Encoder","asciiStringToUint8Array","arrays","acc","CIDUtil","nameToCode","codecInts","for","multibaseName","baseName","rmPrefix","validateCID","_bytes","getCodeVarint","other","errorMsg","checkCIDComponents","nameToVarint","constantToCode","codeToName","getNameFromData","prefixedData","getNameFromCode","getCodeFromName","getCodeFromData","getVarintFromName","getVarintFromCode","varintEncode","addPrefix","multicodecStrOrCode","varintUint8ArrayEncode","getName","getNumber","getCode","getVarint","uint8ArrayToNumber","numberToUint8Array","hexString","baseTable","codecName","cidv1","cidv2","cidv3","ip4","tcp","dccp","ip6","ip6zone","dns","dns4","dns6","dnsaddr","protobuf","cbor","rlp","bencode","dag-pb","dag-cbor","libp2p-key","git-raw","torrent-info","torrent-file","leofcoin-block","leofcoin-tx","leofcoin-pr","sctp","dag-jose","dag-cose","eth-block","eth-block-list","eth-tx-trie","eth-tx","eth-tx-receipt-trie","eth-tx-receipt","eth-state-trie","eth-account-snapshot","eth-storage-trie","bitcoin-block","bitcoin-tx","bitcoin-witness-commitment","zcash-block","zcash-tx","docid","stellar-block","stellar-tx","decred-block","decred-tx","ipld-ns","ipfs-ns","swarm-ns","ipns-ns","zeronet","secp256k1-pub","bls12_381-g1-pub","bls12_381-g2-pub","x25519-pub","ed25519-pub","bls12_381-g1g2-pub","dash-block","dash-tx","swarm-manifest","swarm-feed","udp","p2p-webrtc-star","p2p-webrtc-direct","p2p-stardust","p2p-circuit","dag-json","udt","utp","unix","thread","p2p","https","onion","onion3","garlic64","garlic32","tls","quic","ws","wss","p2p-websocket-star","messagepack","libp2p-peer-record","p256-pub","p384-pub","p521-pub","ed448-pub","x448-pub","ed25519-priv","zeroxcert-imprint-256","fil-commitment-unsealed","fil-commitment-sealed","holochain-adr-v0","holochain-adr-v1","holochain-key-v0","holochain-key-v1","holochain-sig-v0","holochain-sig-v1","skynet-ns","keysPBM","forge","errcode","importer","supportedKeys","rsa","ed25519","secp256k1","ErrMissingSecp256K1","typeToKey","supported","PrivateKey","Data","Type","KeyType","RSA","unmarshalRsaPrivateKey","Ed25519","unmarshalEd25519PrivateKey","Secp256k1","unmarshalSecp256k1PrivateKey","keyStretcher","generateEphemeralKeyPair","generateKeyPairFromSeed","seed","PublicKey","unmarshalRsaPublicKey","unmarshalEd25519PublicKey","unmarshalSecp256k1PublicKey","import","encryptedKey","pki","decryptRsaPrivateKey","der","asn1","toDer","privateKeyToAsn1","getBytes","valuesById","$protobuf","$Reader","Reader","$Writer","Writer","$util","roots","ks","newBuffer","uint32","int32","skipType","ProtocolError","fromObject","toObject","toJSONOptions","configure","_configure","BufferWriter","BufferReader","build","rpc","LongBits","utf8","Op","writer","states","Buffer","writeByte","VarintOp","writeVarint64","hi","lo","writeFixed32","alloc","pool","_push","fromNumber","sint32","uint64","int64","sint64","zzEncode","bool","fixed32","sfixed32","fixed64","sfixed64","float","writeFloatLE","double","writeDoubleLE","writeBytes","write","fork","ldelim","BufferWriter_","dst","ifNotSet","newError","CustomError","captureStackTrace","asPromise","EventEmitter","inquire","emptyArray","emptyObject","isInteger","isFinite","isset","utf8Write","_Buffer_from","_Buffer_allocUnsafe","sizeOrArray","Long","dcodeIO","key2Re","key32Re","key64Re","longToHash","toHash","zeroHash","longFromHash","unsigned","fromHash","fromBits","lcFirst","oneOfGetter","fieldNames","fieldMap","oneOfSetter","longs","allocUnsafe","pending","ceil","b64","s64","invalidEncoding","_listeners","evt","Float32Array","f32","f8b","writeFloat_f32_cpy","writeFloat_f32_rev","readFloat_f32_cpy","readFloat_f32_rev","writeFloatBE","readFloatLE","readFloatBE","writeFloat_ieee754","writeUint","sign","LN2","readFloat_ieee754","readUint","uint","mantissa","NaN","writeUintLE","writeUintBE","readUintLE","readUintBE","Float64Array","f64","writeDouble_f64_cpy","writeDouble_f64_rev","readDouble_f64_cpy","readDouble_f64_rev","writeDoubleBE","readDoubleLE","readDoubleBE","writeDouble_ieee754","off0","off1","readDouble_ieee754","moduleName","eval","SIZE","MAX","slab","zero","zzDecode","fromString","toLong","part0","part1","part2","writeStringBuffer","writeBytesBuffer","indexOutOfRange","writeLength","create_array","isBuffer","readLongVarint","readFixed32_end","readFixed64","_slice","wireType","BufferReader_","utf8Slice","Service","rpcImpl","requestDelimited","responseDelimited","rpcCall","requestCtor","responseCtor","endedByRPC","_checkBufferLength","available","requested","Class","UNIVERSAL","APPLICATION","CONTEXT_SPECIFIC","PRIVATE","NONE","BOOLEAN","INTEGER","BITSTRING","OCTETSTRING","NULL","OID","ODESC","EXTERNAL","REAL","ENUMERATED","EMBEDDED","UTF8","ROID","SEQUENCE","SET","PRINTABLESTRING","IA5STRING","UTCTIME","GENERALIZEDTIME","BMPSTRING","tagClass","constructed","composed","bitStringContents","excludeBitStringContents","obj1","obj2","includeBitStringContents","getBerValueLength","b2","getByte","getInt","_fromDer","b1","longFormBytes","_getValueLength","decodeBitStrings","savedRead","savedRemaining","unused","verbose","ex","getInt16","asn1Options","fromDer","createBuffer","useBitStringContents","putBytes","putByte","putBuffer","putInt16","lenBytes","oidToDer","oid","valueBytes","derToOid","utcTimeToDate","utc","date","year","MM","DD","hh","mm","ss","setUTCFullYear","setUTCHours","setTime","generalizedTimeToDate","gentime","YYYY","fff","isUTC","setFullYear","setHours","dateToUtcTime","rval","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","dateToGeneralizedTime","integerToDer","putSignedInt","derToInteger","getSignedInt","capture","captureAsn1","captureBitStringContents","captureBitStringValue","_nonLatinRegex","prettyPrint","indentation","IA5String","subvalues","oids","bytesToHex","decodeUtf8","usePureJavaScript","baseN","_checkBitsParam","ByteStringBuffer","isArrayBuffer","isArrayBufferView","_constructedStringLength","setImmediate","postMessage","callbacks","div","oldSetImmediate","isNodejs","globalScope","ByteBuffer","_MAX_CONSTRUCTED_STRING_LENGTH","DataBuffer","readOffset","growSize","DataView","writeOffset","_optimizeConstructedString","isEmpty","fillWithByte","putString","encodeUtf8","putInt24","putInt32","putInt16Le","putInt24Le","putInt32Le","putInt","getInt24","getInt32","getInt16Le","getInt24Le","getInt32Le","setAt","compact","truncate","toHex","accommodate","amount","setUint8","view","binary","Uint16Array","utf16","setInt16","setInt8","setInt32","getInt8","getUint8","fillString","xorBytes","s3","hexToBytes","int32ToBytes","_base64","_base64Idx","_base58","encode64","maxline","chr1","chr2","chr3","decode64","enc1","enc2","enc3","enc4","unescape","encodeURIComponent","escape","base58","deflate","inflate","_setStorageObject","removeItem","setItem","_getStorageObject","getItem","_setItem","_getItem","_removeItem","_clearItems","_callStorageFunction","func","exception","localStorage","clearItems","parseUrl","full","fullHost","_queryVariables","getQueryVariables","kvpairs","parseFragment","fragment","fp","fq","pathString","queryString","makeRequest","reqString","frag","req","getPath","getQuery","getQueryLast","vals","makeLink","jQuery","qstr","argi","formatNumber","decimals","dec_point","thousands_sep","abs","toFixed","formatSize","bytesFromIP","ip","bytesFromIPv4","bytesFromIPv6","blanks","zeros","bytesToIP","bytesToIPv4","bytesToIPv6","zeroGroups","zeroMaxGroup","estimateCores","cores","hardwareConcurrency","Worker","Blob","blobUrl","st","et","sample","samples","numWorkers","avg","workers","results","worker","terminate","overlaps","r1","overlap","r2","_reverseAlphabets","digits","_encodeWithByteBuffer","table","_IN","_I_","BigInteger","jsbn","pbe","encryptedPrivateKeyValidator","PBES2AlgorithmsValidator","pkcs12PbeParamsValidator","md","prfOidToMessageDigest","prfOid","prfAlgorithm","prfAlgorithmToMessageDigest","sha512","algorithm","encryptPrivateKeyInfo","saltSize","dkLen","encryptionAlgorithm","encryptedData","salt","getBytesSync","countBytes","ivLen","encOid","cipherFn","aes","createEncryptionCipher","des","dk","pkcs5","pbkdf2","iv","cipher","createPbkdf2Params","saltBytes","generatePkcs12Key","decryptPrivateKeyInfo","encryptionOid","getCipher","encryptionParams","encrypted","encryptedPrivateKeyToPem","epki","pem","encryptedPrivateKeyFromPem","headerType","procType","encryptRsaPrivateKey","rsaKey","legacy","wrapRsaPrivateKey","opensslDeriveBytes","dekInfo","createDecryptionCipher","rc2","privateKeyFromAsn1","digestLength","blockLength","passBuf","Slen","Plen","Inew","getCipherForPBES2","getCipherForPKCS12PBE","supportedOids","kdfOid","kdfSalt","kdfIterationCount","encIv","dIvLen","iterations","startDecrypting","digests","registerAlgorithm","Algorithm","startEncrypting","_createCipher","decrypt","initialize","blockSize","encrypt","inBlock","outBlock","_updateBlock","_w","_init","encryptOp","_expandKey","modes","ecb","cbc","cfb","ofb","ctr","gcm","sbox","isbox","rcon","mix","imix","xtime","e4","e8","sx","sx2","me","ime","ei","iNk","Nk","m0","m1","m2","m3","wnew","wi","a2","Nr","createDecipher","createCipher","algorithms","getAlgorithm","BlockCipher","_finish","_input","_op","_decrypt","unpad","overflow","afterFinish","transformIV","ints","blocks","inc32","from64To32","_ints","_inBlock","_outBlock","padding","_prev","_iv","_partialBlock","_partialOutput","_partialBytes","inputLength","partialBytes","_R","additionalData","_cipherLength","_tagLength","tagLength","_tag","_hashBlock","_hashSubkey","componentBits","_m","generateHashTable","ivLength","_j0","ghash","_aDataLength","_s","lengths","multiply","z_i","v_i","lsb","tableMultiply","x_i","ah","multiplier","perInt","shft","generateSubHashTable","half","m_i","m_j","_keys","pc2bytes0","pc2bytes1","pc2bytes2","pc2bytes3","pc2bytes4","pc2bytes5","pc2bytes6","pc2bytes7","pc2bytes8","pc2bytes9","pc2bytes10","pc2bytes11","pc2bytes12","pc2bytes13","shifts","lefttmp","righttmp","_createKeys","spfunction1","spfunction2","spfunction3","spfunction4","spfunction5","spfunction6","spfunction7","spfunction8","looping","endloop","loopinc","right1","right2","pbkdf2Sync","hLen","prf","hmac","xor","u_c","u_c1","_md","_ipadding","_opadding","keylen","getMac","foldHeader","header","insertSpace","$1","candidate","ltrim","contentDomain","rMessage","rHeader","rCRLF","li","nl","vi","prng_aes","_prng_aes_output","_prng_aes_buffer","spawnPrng","prng","formatKey","formatSeed","increment","sha256","getRandomValues","_crypto","msCrypto","collectInt","_navBytes","collect","mousemove","clientX","clientY","keypress","createInstance","_initialized","_padding","_k","_state","messageLength","fullMessageLength","messageLengthSize","messageLength64","int32s","h0","h1","h2","h3","h4","h5","h6","h7","_update","finalBlock","t1","t2","s0","maj","reseeds","keyBytes","pools","_reseedSync","_seed","needed","seedFileSync","_2powK","seedBytes","defaultSeedFile","entropy","Uint32Array","QuotaExceededError","generateSync","seedFile","_reseed","randomBytes","registerWorker","piTable","rol","ror","expandKey","effKeyBits","T1","T8","TM","mixRound","mashRound","_output","K","runPlan","plan","ptr","GCD_30_DELTA","privateKeyValidator","rsaPrivateKeyValidator","rsaPublicKeyValidator","publicKeyValidator","emsaPkcs1v15encode","oidBytes","digestInfo","digestAlgorithm","_modPow","modPow","dP","subtract","ONE","dQ","qInv","modInverse","bitLength","compareTo","gcd","xp","xq","_encodePkcs1_v1_5","bt","eb","padByte","padNum","numZeros","padBytes","_decodePkcs1_v1_5","em","ml","_generateKeyPair","workLoad","workerScript","getPrime","pBits","qBits","generateProbablePrime","q1","privateKey","setPrivateKey","publicKey","setPublicKey","_bnToBytes","_getMillerRabinTests","_detectNodeCrypto","_detectSubtleCrypto","subtle","_detectSubtleMsCrypto","_intToUint8Array","yhex","ed","xhex","createKeyPairGenerationState","rng","nextBytes","eInt","pqState","fromInt","stepKeyPairGenerationState","THIRTY","deltaIdx","op_or","bits1","testBit","bitwiseTo","shiftLeft","dAddOffset","byteValue","isProbablePrime","modulusLength","publicExponent","publicKeyEncoding","privateKeyEncoding","priv","privateKeyFromPem","publicKeyFromPem","generateKey","pair","exportKey","pkcs8","setRsaPublicKey","genOp","oncomplete","exportOp","keypair","generateKeyPairSync","schemeOptions","pkcs1","encode_rsa_oaep","verify","setRsaPrivateKey","decode_rsa_oaep","rsaEncryption","privateKeyModulus","privateKeyPublicExponent","privateKeyPrivateExponent","privateKeyPrime1","privateKeyPrime2","privateKeyExponent1","privateKeyExponent2","privateKeyCoefficient","privateKeyToRSAPrivateKey","publicKeyFromAsn1","publicKeyOid","rsaPublicKey","publicKeyModulus","publicKeyExponent","publicKeyToAsn1","publicKeyToSubjectPublicKeyInfo","publicKeyToRSAPublicKey","dbits","nbi","am3","xl","xh","am","appName","DB","DM","DV","FV","F1","F2","rr","vv","BI_RC","int2char","intAt","nbv","nbits","Classic","Montgomery","mp","invDigit","mpl","mph","mt2","op_and","op_xor","op_andnot","lbit","cbit","NullExp","nNop","Barrett","q3","dlShiftTo","revert","divRemTo","mulTo","multiplyTo","sqrTo","squareTo","ZERO","subTo","copyTo","u0","clamp","drShiftTo","fromRadix","mi","sh","lShiftTo","bs","cbs","ds","rShiftTo","pm","pt","ts","nsh","ys","y0","yt","d1","d2","qd","isEven","negate","toRadix","km","modPowInt","multiplyUpperTo","multiplyLowerTo","lowprimes","lplim","chunkSize","signum","cs","intValue","dMultiply","changeBit","addTo","modInt","millerRabin","getLowestSetBit","shiftRight","shortValue","toByteArray","andNot","bitCount","setBit","clearBit","flipBit","remainder","divideAndRemainder","k1","g2","is1","ac","rsa_mgf1","maskLength","mgf1Md","mgf1","keyLength","maxLength","lHash","PS","PS_length","seedLength","dbMask","maskedDB","seedMask","maskedSeed","expectedLength","db","lHashPrime","in_ps","is_0","error_mask","primeincFindPrimeWithoutWorkers","generateRandom","workerMessage","primeincFindPrimeWithWorkers","primeincFindPrime","mrTests","getMillerRabinTests","millerRabinTests","maxBlockTime","_primeinc","ErrClass","ciphers","webcrypto","nonceLength","saltLength","nonce","aesGcm","deriveParams","importKey","cryptoKey","deriveKey","ciphertext","plaintext","win","nativeCrypto","sha","pbm","exporter","RsaPublicKey","sig","hashAndVerify","utils","jwkToPkix","marshal","RsaPrivateKey","_publicKey","hashAndSign","jwkToPkcs1","jwk","pkixToJwk","pkcs1ToJwk","fromJwk","alg","sha384","sha224","_states","_h","messageLength128","hlen","t1_hi","t1_lo","t2_hi","t2_lo","s0_hi","s0_lo","s1_hi","ch_hi","maj_hi","maj_lo","a_hi","a_lo","b_hi","b_lo","c_hi","c_lo","d_hi","d_lo","e_hi","e_lo","f_hi","f_lo","g_hi","g_lo","h_hi","h_lo","w2","w7","w15","w16","asn1Validator","NativeBuffer","messageToNativeBuffer","PUBLIC_KEY_BYTE_LENGTH","PRIVATE_KEY_BYTE_LENGTH","SEED_BYTE_LENGTH","SIGN_BYTE_LENGTH","HASH_BYTE_LENGTH","pk","sk","gf","scalarbase","pack","crypto_sign_keypair","privateKeyOid","ed25519Oid","EdDSA25519","privateKeyBytes","publicKeyBytes","ed25519PublicKey","publicKeyFromPrivateKey","signedMsg","sm","smlen","modL","crypto_sign","chk","den","den2","den4","den6","set25519","gf1","unpack25519","Z","pow2523","neq25519","par25519","gf0","unpackneg","scalarmult","crypto_verify_32","crypto_sign_open","D2","X","Y","msgLen","cswap","sel25519","tx","ty","zi","inv25519","pack25519","car25519","yi","vn","t0","t3","t4","t5","t6","t7","t8","t9","t10","t11","t12","t13","t14","t15","t16","t17","t18","t19","t20","t21","t22","t23","t24","t25","t26","t27","t28","t29","t30","b0","b3","b4","b5","b6","b7","b8","b9","b10","b11","b12","b13","b14","b15","jwKey","kty","jwk2pub","jwk2priv","convertKey","handle","fkey","fomsg","MAX_BYTES","bigIntegerToUintBase64url","base64urlToBigInteger","dp","dq","qi","kid","base64urlToBuffer","Ed25519PublicKey","ensureKey","publicKeyLength","Ed25519PrivateKey","privateKeyLength","generateKeyFromSeed","keysProtobuf","Secp256k1PublicKey","validatePublicKey","compressPublicKey","Secp256k1PrivateKey","computePublicKey","validatePrivateKey","HASH_ALGORITHM","privateKeyVerify","ecdsaSign","signatureExport","signatureImport","ecdsaVerify","publicKeyVerify","publicKeyConvert","decompressPublicKey","publicKeyCreate","cond","isUint8Array","isCompressed","getAssertedOutput","contextRandomize","seckey","privateKeyNegate","tweak","privateKeyTweakAdd","privateKeyTweakMul","pubkey","compressed","publicKeyNegate","pubkeys","publicKeyCombine","publicKeyTweakAdd","publicKeyTweakMul","signatureNormalize","outputlen","msg32","noncefn","recid","ecdsaRecover","xbuf","ybuf","ecdh","EC","ecparams","curve","BN","loadPublicKey","toRed","red","redSqr","redIMul","redIAdd","redSqrt","isOdd","redNeg","keyPair","loadCompressedPublicKey","x3","redISub","isZero","loadUncompressedPublicKey","savePublicKey","point","bn","umod","toArrayLike","iadd","isub","tweaked","imul","keyFromPrivate","getPublic","pairs","isInfinity","mul","nh","sigR","sigS","lenR","posR","lenS","posS","_noncefn","canonical","pers","recoveryParam","sigObj","sigr","sigs","recoverPubKey","scalar","getX","getY","elliptic","rand","curves","eddsa","minAssert","minUtils","zero2","getNAF","naf","fill","andln","isubn","iushrn","getJSF","k2","jsf","m8","cmpn","u1","u2","m14","m24","cachedProperty","computer","parseBytes","intFromLE","inherits","superCtor","super_","TempCtor","endian","isBN","negative","words","wordSize","parseHex4Bits","parseHexByte","lowerBound","parseBase","_initNumber","_initArray","_parseHex","_parseBase","strip","limbLen","limbPow","imuln","_iaddn","_expand","_normSign","inspect","groupSizes","groupBases","smallMulTo","ncarry","rword","maxJ","groupSize","groupBase","modn","idivn","toBuffer","ArrayType","reqLength","littleEndian","clz32","_countBits","_zeroBits","zeroBits","toTwos","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","uor","iuand","iand","uand","iuxor","ixor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","comb10MulTo","a0","al0","ah0","a1","al1","ah1","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","bl0","bh0","bl1","bh1","bl2","bh2","bl3","bh3","bl4","bh4","bl5","bh5","bl6","bh6","bl7","bh7","bl8","bh8","bl9","bh9","w0","w1","w3","w4","w5","w6","w8","w9","w10","w11","w12","w13","w14","w17","w18","jumboMulTo","FFTM","mulp","hncarry","bigMulTo","makeRBT","revBin","rb","permute","rbt","rws","iws","rtws","itws","rtwdf","cos","PI","itwdf","sin","rtwdf_","itwdf_","ie","ro","io","rx","guessLen13b","odd","conjugate","normalize13b","convert13b","stub","ph","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","toBitArray","iushln","carryMask","newCarry","ishln","hint","extended","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","addn","subn","iabs","_ishlnsubmul","_wordDiv","bhi","qj","divmod","positive","divn","divRound","dm","egcd","yp","im","jm","_invmp","x1","x2","invm","bincn","ucmp","gtn","gten","gte","ltn","lten","lte","eqn","Red","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redSub","redShl","shl","redMul","_verify2","_verify1","redISqr","sqrt","redInvm","redPow","primes","k256","p224","p192","p25519","MPrime","_tmp","K256","P224","P192","P25519","_prime","Mont","imod","rinv","minv","ireduce","rlen","imulK","_strip","outLen","mod3","one","nOne","lpow","inv","wnd","currentLen","mont","Rand","_rand","short","edwards","BaseCurve","two","pointFromJSON","gRed","_wnafT1","_wnafT2","_wnafT3","_wnafT4","_bitLength","adjustCount","redN","_maxwellTrick","BasePoint","precomputed","_fixedNafMul","doubles","_getDoubles","step","nafW","repr","jpoint","mixedAdd","points","toP","_wnafMul","nafPoints","_getNAFPoints","dblp","_wnafMulAdd","defW","coeffs","jacobianResult","wndWidth","comb","toJ","ja","jb","decodePoint","pointFromX","encodeCompressed","_encode","precompute","power","_getBeta","_hasDoubles","dbl","ShortCurve","tinv","zeroA","threeA","endo","_getEndomorphism","_endoWnafT1","_endoWnafT2","Point","isRed","inf","JPoint","zOne","betas","_getEndoRoots","lambdas","basis","vec","_getEndoBasis","ntinv","prevR","aprxSqrt","y1","y2","len1","_endoSplit","v1","v2","p2","q2","ax","rhs","_endoWnafMulAdd","npoints","ncoeffs","fromJSON","pre","endoMul","obj2point","nx","ny","ys1","dyinv","mulAdd","jmulAdd","_precompute","zinv","zinv2","ay","pz2","z2","nz","jx","jy","jz","jz4","jyd","jx2","jyd2","jyd4","dny","_zeroDbl","_threeDbl","_dbl","xx","yy","yyyy","yyyy8","c8","beta4","beta8","ggamma8","jy2","jxd4","jyd8","trpl","zz","ee","yyu4","kbase","z3","pz3","eqXToP","zs","MontCurve","i4","a24","aa","bb","diffAdd","jumlAdd","EdwardsCurve","twisted","mOneA","dd","oneC","_mulA","_mulC","pointFromY","_extDbl","nt","_projDbl","_extAdd","_projAdd","PresetCurve","defineCurve","common","ripemd","ripemd160","isSurrogatePair","htonl","zero8","toHex32","join32","split32","rotr32","rotl32","sum32","sum32_3","sum32_4","sum32_5","sum64","al","bh","sum64_hi","bl","sum64_lo","sum64_4_hi","cl","dh","dl","sum64_4_lo","sum64_5_hi","eh","sum64_5_lo","rotr64_hi","rotr64_lo","shr64_hi","shr64_lo","BlockHash","pendingTotal","outSize","hmacStrength","padLength","_delta8","_delta32","_pad","_digest","shaCommon","ft_1","sha1_K","SHA1","ch32","maj32","p32","s0_256","s1_256","g0_256","g1_256","SHA256","SHA224","sha256_K","T2","SHA512","SHA384","sha512_K","ch64_hi","yh","yl","zh","ch64_lo","zl","maj64_hi","maj64_lo","s0_512_hi","s0_512_lo","s1_512_hi","s1_512_lo","g0_512_hi","g0_512_lo","g1_512_hi","g1_512_lo","_prepareBlock","c0_hi","c0_lo","c1_hi","c1_lo","c2_hi","c2_lo","c3_hi","c3_lo","fh","fl","gh","gl","hl","c4_hi","c4_lo","T1_hi","T1_lo","T2_hi","T2_lo","RIPEMD160","Kh","Ah","Bh","Ch","Dh","Eh","rh","Hmac","Hash","HmacDRBG","KeyPair","Signature","fromPrivate","keyFromPublic","fromPublic","genKeyPair","drbg","persEnc","entropyEnc","ns2","_truncateToN","truncOnly","bkey","getPrivate","ns1","kp","kpX","sinv","isYOdd","isSecondKey","rInv","getKeyRecoveryParam","Q","Qprime","predResist","minEntropy","reseedInterval","V","nonceEnc","_hmac","kmac","reseed","addEnc","_importPrivate","privEnc","_importPublic","pubEnc","reason","derive","_importDER","place","getLength","initial","octetLen","rmPadding","constructLength","octets","slen","toDER","backHalf","EDDSA","pointClass","secret","keyFromSecret","hashInt","messagePrefix","Rencoded","encodePoint","s_","pubBytes","makeSignature","SG","fromSecret","lastIx","normed","xIsOdd","encodeInt","decodeInt","isPoint","_secret","_pub","_pubBytes","privBytes","getSecret","_S","_Rencoded","_Sencoded","Sencoded","cipherMap","AES-128","ivSize","keySize","AES-256","Blowfish","cipherKeySize","cipherType","allowed","resultLength","todo","resultBuffer","createKey","cipherKey","macKey","hashTypes","hashType","generateEphmeralKeyPair","validateCurveType","P-256","P-384","P-521","namedCurve","genSharedKey","theirPub","forcePrivate","deriveBits","curveLengths","byteLen","crv","ext","private","curveTypes","ClassIsWrapper","withoutNew","cipherMode","createCipheriv","decipher","createDecipheriv","cipher2","CIPHER_MODES","forgePbkdf2","forgeUtil","hashName","hasher","dek","Multiaddr","mafmt","pathGatewayPattern","pathPattern","subdomainGatewayPattern","fqdnWithTld","isMultiaddr","isIpfs","protocolMatch","hashMatch","formatted","convertToString","isIpns","ipnsId","ipfsSubdomain","ipnsSubdomain","subdomain","ipfsUrl","ipnsUrl","peerMultiaddr","P2P","base32cid","isMultibase","ipnsPath","urlOrPath","cidPath","protocols","errCode","resolvers","addr","fromBytes","bytesToString","family","transport","protoCodes","sizeForAddr","protos","bytesToTuples","tuplesToStringTuples","addrString","tuples","tuplesToBytes","tuple","stringTuples","resolvableProto","resolvable","protoNames","address","stringToStringTuples","ParseError","cleanPath","stringTuplesToString","tup","protoFromTuple","stringTuplesToTuples","stringToBytes","validateBytes","isValidBytes","Convert","ip2bytes","ipString","isIP","port2bytes","setUint16","bytes2port","getUint16","bytes2onion","addrBytes","portBytes","ipBuff","bytes2ip","bytes2str","bytes2mh","str2bytes","mh2bytes","portBuf","onion2bytes","onion32bytes","isIp","isV4","v4","isV6","v6","buff","byte","v4Buffer","ipRegex","includeBoundaries","v6seg","v46Exact","v4exact","v6exact","Protocols","lengthPrefixedVarSize","row","MAX_SAFE_INTEGER","DNS4","DNS6","DNSADDR","DNS","IP","TCP","UDP","UTP","QUIC","WebSockets","WebSocketsSecure","HTTPS","WebRTCStar","WebSocketStar","WebRTCDirect","Reliable","Stardust","_P2P","_Circuit","CircuitRecursive","Circuit","makeMatchesFunction","partialMatch","pnames","IPFS","Multihashing","createHash","sha2256","sha2512","sha3512","sha3384","sha3256","sha3224","shake128","shake256","keccak224","keccak256","keccak384","keccak512","murmur3128","murmur332","86","dblSha2256","addBlake","newHash","sha3","mur","fromNumberTo32BitBuf","sha3_224","arrayBuffer","sha3_256","sha3_384","sha3_512","x64","hash128","x86","hash32","INPUT_ERROR","WINDOW","JS_SHA3_NO_WINDOW","WEB_WORKER","JS_SHA3_NO_NODE_JS","COMMON_JS","JS_SHA3_NO_COMMON_JS","AMD","define","amd","ARRAY_BUFFER","JS_SHA3_NO_ARRAY_BUFFER","HEX_CHARS","CSHAKE_PADDING","SHIFT","RC","BITS","SHAKE_BITS","OUTPUT_TYPES","CSHAKE_BYTEPAD","256","JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW","createOutputMethod","outputType","Keccak","createShakeOutputMethod","outputBits","createCshakeOutputMethod","createKmacOutputMethod","createOutputMethods","createMethod","KECCAK_PADDING","PADDING","SHAKE_PADDING","bytepad","Kmac","methodNames","methodName","newMethodName","finalized","blockCount","byteCount","outputBlocks","extraBytes","notString","lastByteIndex","encodeString","strs","paddingBytes","finalize","c0","c3","c4","c5","c6","c7","c9","b16","b17","b18","b19","b20","b21","b22","b23","b24","b25","b26","b27","b28","b29","b30","b31","b32","b33","b34","b35","b36","b37","b38","b39","b40","b41","b42","b43","b44","b45","b46","b47","b48","b49","library","inputValidation","_validBytes","_x86Multiply","_x86Rotl","_x86Fmix","_x64Add","_x64Multiply","_x64Rotl","_x64LeftShift","_x64Xor","_x64Fmix","k3","k4","murmurHash3","_murmurHash3","noConflict","blake","blake2b","blake2bInit","blake2bUpdate","blake2bFinal","blake2s","blake2sInit","blake2sUpdate","blake2sFinal","makeB2Hash","hf","b2b","b2s","blake2bHex","blake2sHex","ADD64AA","o0","o1","ADD64AC","B2B_GET32","B2B_G","ix","iy","x0","xor0","xor1","BLAKE2B_IV32","SIGMA82","blake2bCompress","outlen","normalizeInput","uint32ToHex","debugPrint","testSpeed","hashFn","startMs","genMs","hashHex","hashMs","ieee754","customInspectSymbol","SlowBuffer","INSPECT_MAX_BYTES","K_MAX_LENGTH","setPrototypeOf","encodingOrOffset","isEncoding","actual","arrayView","isInstance","fromArrayBuffer","fromArrayLike","fromArrayView","SharedArrayBuffer","valueOf","numberIsNaN","toPrimitive","assertSize","mustMatch","loweredCase","utf8ToBytes","base64ToBytes","slowToString","hexSlice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","bidirectionalIndexOf","arrayIndexOf","indexSize","arrLength","valLength","readUInt16BE","foundIndex","hexWrite","blitBuffer","asciiWrite","byteArray","asciiToBytes","base64Write","ucs2Write","units","utf16leToBytes","fromByteArray","secondByte","thirdByte","fourthByte","tempCodePoint","firstByte","codePoint","bytesPerSequence","codePoints","MAX_ARGUMENTS_LENGTH","decodeCodePointsArray","kMaxLength","TYPED_ARRAY_SUPPORT","foo","typedArraySupport","poolSize","allocUnsafeSlow","_isBuffer","compare","swap16","swap32","swap64","toLocaleString","thisStart","thisEnd","thisCopy","targetCopy","_arr","hexSliceLookupTable","checkOffset","checkInt","checkIEEE754","writeFloat","noAssert","writeDouble","newBuf","readUIntLE","readUIntBE","readUint8","readUInt8","readUint16LE","readUInt16LE","readUint16BE","readUint32LE","readUInt32LE","readUint32BE","readUInt32BE","readIntLE","readIntBE","readInt8","readInt16LE","readInt16BE","readInt32LE","readInt32BE","writeUIntLE","writeUIntBE","writeUint8","writeUInt8","writeUint16LE","writeUInt16LE","writeUint16BE","writeUInt16BE","writeUint32LE","writeUInt32LE","writeUint32BE","writeUInt32BE","writeIntLE","limit","writeIntBE","writeInt8","writeInt16LE","writeInt16BE","writeInt32LE","writeInt32BE","targetStart","copyWithin","INVALID_BASE64_RE","leadSurrogate","base64clean","i16","lens","getLens","validLen","placeHoldersLen","Arr","_byteLength","curByte","revLookup","uint8","maxChunkLength","len2","encodeChunk","lookup","isLE","mLen","nBytes","eLen","eMax","eBias","nBits","rt","B2S_GET32","B2S_G","ROTR32","BLAKE2S_IV","SIGMA","blake2sCompress","DAGNode","UnixFS","initAssets","AlreadyInitializedError","createStartAPI","createStopAPI","createDNSAPI","createIsOnlineAPI","createResolveAPI","PinAPI","IPNSAPI","NameAPI","createRefsAPI","createRefsLocalAPI","BitswapAPI","BootstrapAPI","BlockAPI","RootAPI","createVersionAPI","createIDAPI","createConfigAPI","DagAPI","PinManagerAPI","createPreloadAPI","createMfsPreloadAPI","createFilesAPI","KeyAPI","ObjectAPI","RepoAPI","StatsAPI","BlockService","createIPLD","Storage","Network","SwarmAPI","createGCLockAPI","createPingAPI","createDHTAPI","createPubSubAPI","print","storage","repo","keychain","network","preload","blockService","ipld","gcLock","repoOwner","isOnline","ipns","pinManager","pin","dag","addAll","cat","EXPERIMENTAL","files","mfsPreload","dht","pubsub","bitswap","bootstrap","ping","stats","swarm","net","try","libp2p","notImplemented","commands","diag","cmds","sys","initOptions","getDefaultOptions","silent","getAll","startOffline","isNew","emptyRepo","addEmptyDir","initializeKeyspace","hashAlg","enabled","addresses","Key","withTimeoutOption","OFFLINE_ERROR","MFS_ROOT_KEY","MFS_MAX_CHUNK_SIZE","MFS_MAX_LINKS","withTimeout","normalizePath","pathStr","normalizeCidPath","resolvePath","mapFile","unixfs","fileSize","mtime","includeContent","MemoryDatastore","Adapter","nanoid","pathSepS","pathSepB","pathSep","clean","_buf","withNamespaces","namespaces","namespaceType","baseNamespace","namespaceValue","urlAlphabet","poolOffset","randomFillSync","customRandom","getRandom","customAlphabet","pseudoRandomBytes","createHmac","algos","algoKeys","hashes","getHashes","Cipher","Cipheriv","Decipher","Decipheriv","getCiphers","listCiphers","DiffieHellmanGroup","createDiffieHellmanGroup","getDiffieHellman","createDiffieHellman","DiffieHellman","createSign","Sign","createVerify","Verify","createECDH","publicEncrypt","privateEncrypt","publicDecrypt","privateDecrypt","rf","randomFill","createCredentials","DH_CHECK_P_NOT_SAFE_PRIME","DH_CHECK_P_NOT_PRIME","DH_UNABLE_TO_CHECK_GENERATOR","DH_NOT_SUITABLE_GENERATOR","NPN_ENABLED","ALPN_ENABLED","RSA_PKCS1_PADDING","RSA_SSLV23_PADDING","RSA_NO_PADDING","RSA_PKCS1_OAEP_PADDING","RSA_X931_PADDING","RSA_PKCS1_PSS_PADDING","POINT_CONVERSION_COMPRESSED","POINT_CONVERSION_UNCOMPRESSED","POINT_CONVERSION_HYBRID","MAX_UINT32","oldBrowser","copyProps","SafeBuffer","MD5","_hash","_final","HashBase","ARRAY16","_a","_b","rotl","fnF","fnG","fnH","fnI","_block","_blockOffset","_length","Transform","_blockSize","_finalized","_transform","_flush","throwIfNotStringOrBuffer","Stream","Readable","Writable","Duplex","PassThrough","finished","ReadableState","EElistenerCount","emitter","OurUint8Array","_uint8ArrayToBuffer","_isUint8Array","debug","debugUtil","debuglog","StringDecoder","createReadableStreamAsyncIterator","BufferList","destroyImpl","_require","getHighWaterMark","_require$codes","ERR_INVALID_ARG_TYPE","ERR_STREAM_PUSH_AFTER_EOF","ERR_METHOD_NOT_IMPLEMENTED","ERR_STREAM_UNSHIFT_AFTER_END_EVENT","errorOrDestroy","kProxyEvents","_events","isDuplex","objectMode","readableObjectMode","highWaterMark","pipes","pipesCount","flowing","endEmitted","reading","sync","needReadable","emittedReadable","readableListening","resumeScheduled","paused","emitClose","autoDestroy","defaultEncoding","awaitDrain","readingMore","_readableState","readable","_read","_destroy","readableAddChunk","addToFront","skipChunkCheck","er","onEofChunk","chunkInvalid","addChunk","maybeReadMore","emitReadable","_undestroy","undestroy","isPaused","setEncoding","MAX_HWM","computeNewHighWaterMark","howMuchToRead","emitReadable_","maybeReadMore_","pipeOnDrain","updateReadableListening","listenerCount","nReadingNextTick","resume_","fromList","consume","endReadable","endReadableNT","wState","_writableState","nOrig","doRead","pipe","pipeOpts","endFn","stdout","stderr","onend","unpipe","onunpipe","unpipeInfo","hasUnpiped","onclose","onfinish","ondrain","ondata","cleanedUp","needDrain","pause","dests","_fromList","iterable","ReflectOwnKeys","ReflectApply","NumberIsNaN","errorListener","eventTargetAgnosticAddListener","addErrorHandlerIfEventEmitter","_eventsCount","_maxListeners","defaultMaxListeners","checkListener","_getMaxListeners","that","_addListener","events","warning","newListener","warned","onceWrapper","fired","wrapFn","_onceWrap","wrapped","unwrap","evlistener","unwrapListeners","arrayClone","wrapListener","setMaxListeners","getMaxListeners","doError","originalListener","spliceOne","rawListeners","eventNames","enumerableOnly","sym","getOwnPropertyDescriptor","_defineProperty","_defineProperties","Constructor","_classCallCheck","protoProps","staticProps","hasStrings","_getString","_getBuffer","nb","getOwnPropertyDescriptors","defineProperties","_objectSpread","customInspect","emitErrorAndCloseNT","emitErrorNT","emitCloseNT","readableDestroyed","writableDestroyed","errorEmitted","ending","finalCalled","prefinished","rState","ERR_INVALID_OPT_VALUE","duplexKey","hwm","highWaterMarkFrom","createErrorType","NodeError","_Base","subClass","arg1","arg2","arg3","getMessage","oneOf","thing","determiner","this_len","objectKeys","allowHalfOpen","onEndNT","getBuffer","CorkedRequest","onCorkedFinish","WritableState","internalUtil","deprecate","realHasInstance","ERR_MULTIPLE_CALLBACK","ERR_STREAM_CANNOT_PIPE","ERR_STREAM_DESTROYED","ERR_STREAM_NULL_VALUES","ERR_STREAM_WRITE_AFTER_END","ERR_UNKNOWN_ENCODING","nop","writableObjectMode","noDecode","decodeStrings","writing","corked","bufferProcessing","onwrite","writecb","writelen","bufferedRequest","lastBufferedRequest","pendingcb","bufferedRequestCount","corkedRequestsFree","_write","writev","_writev","final","writeAfterEnd","validChunk","decodeChunk","writeOrBuffer","isBuf","newChunk","doWrite","onwriteError","finishMaybe","onwriteStateUpdate","needFinish","clearBuffer","afterWrite","onwriteDrain","holder","allBuffers","callFinal","prefinish","need","endWritable","corkReq","hasInstance","cork","uncork","setDefaultEncoding","nenc","retried","_normalizeEncoding","normalizeEncoding","utf16Text","utf16End","fillLast","utf8FillLast","base64Text","base64End","simpleWrite","simpleEnd","lastNeed","lastTotal","lastChar","utf8CheckByte","utf8CheckExtraBytes","utf8CheckIncomplete","_Object$setPrototypeO","kLastResolve","kLastReject","kError","kEnded","kLastPromise","kHandlePromise","kStream","createIterResult","readAndResolve","onReadable","AsyncIteratorPrototype","ReadableStreamAsyncIteratorPrototype","lastPromise","wrapForNext","_this2","_Object$create","ERR_STREAM_PREMATURE_CLOSE","eos","_len","onlegacyfinish","writableEnded","readableEnded","onrequest","setHeader","isRequest","ERR_TRANSFORM_ALREADY_TRANSFORMING","ERR_TRANSFORM_WITH_LENGTH_0","afterTransform","_transformState","transforming","writechunk","rs","needTransform","writeencoding","err2","ERR_MISSING_ARGS","destroyer","closed","popCallback","streams","destroys","zr","sl","sr","hr","_e","fn1","fn2","fn3","fn4","fn5","ar","br","cr","dr","tl","tr","Sha","rotl30","ft","finalSize","_finalSize","accum","assigned","rem","lowBits","highBits","Sha1","rotl5","Sha256","Sha224","_f","_g","sigma0","sigma1","gamma0","Sha384","_ah","_bh","_ch","_dh","_eh","_fh","_gh","_hh","_al","_bl","_cl","_dl","_el","_fl","_gl","_hl","writeInt64BE","Sha512","Gamma0","Gamma0l","Gamma1","Gamma1l","getCarry","gamma0l","gamma1","gamma1l","Wi7h","Wi7l","Wi16h","Wi16l","Wil","Wih","majh","majl","sigma0h","sigma0l","sigma1h","sigma1l","Kih","Kil","chh","chl","t1l","t1h","t2l","t2h","CipherBase","hashMode","_finalOrDigest","__final","_decoder","_encoding","inputEnc","outputEnc","outData","_toString","setAutoPadding","getAuthTag","setAuthTag","setAAD","fin","Legacy","ZEROS","blocksize","_alg","ipad","_ipad","opad","_opad","ZERO_BUF","checkParameters","toBrowser","sha-1","sha-256","sha-384","sha-512","checks","checkNative","algo","prom","browserPbkdf2","getNextTick","queueMicrotask","resolvePromise","resp","MAX_ALLOC","pVersionMajor","sizes","rmd160","saltLen","shaFunc","rmd160Func","getDigest","ipad1","ipad2","DK","block1","destPos","DES","aesModes","desModes","ebtk","suite","keyLen","des-ede3-cbc","CBC","instantiate","EDE","des-ede3","des-ede-cbc","des-ede","des-cbc","des-ecb","modeName","_des","des3","inL","inR","outL","outR","rip","pc1","r28shl","pc2table","pc2","expand","sTable","substitute","permuteTable","padSplit","bufferOff","_updateDecrypt","_updateEncrypt","_buffer","_flushBuffer","inputOff","outputOff","_finalEncrypt","_finalDecrypt","_unpad","DESState","_desState","deriveKeys","shiftTable","kL","kR","inp","inOff","outOff","_encrypt","lStart","rStart","keyL","keyR","CBCState","_cbcInit","_cbcState","superProto","EDEState","_edeState","deciphers","MODES","AuthCipher","StreamCipher","Splitter","_cipher","AES","_mode","_autopadding","scrub","setTo","padBuff","modeModules","ECB","CFB","CFB8","CFB1","OFB","CTR","GCM","encryptBlock","decryptBlock","encryptStart","encryptByte","byteParam","shiftIn","getBlock","incr32","encryptBlockRaw","chunkNum","GHASH","ck","_ghash","_finID","toPad","ivBits","calcIv","_secCache","_alen","_authTag","rump","xorTest","asUInt32Array","scrubVec","cryptBlock","keySchedule","SUB_MIX","SBOX","nRounds","SUB_MIX0","SUB_MIX1","SUB_MIX2","SUB_MIX3","ksRow","RCON","INV_SBOX","INV_SUB_MIX","x4","x8","_reset","keyWords","ksRows","invKeySchedule","ik","ksR","_nRounds","_keySchedule","_invKeySchedule","ZEROES","_multiply","lsbVi","Vi","Zi","abl","keyBits","keyStart","ivStart","padded","autoPadding","generatePrime","DH","ENCODINGS","gen","genc","findPrime","simpleSieve","fermatTest","TWENTYFOUR","TWO","FIVE","TEN","THREE","ELEVEN","FOUR","_getPrimes","brorand","MillerRabin","_randbelow","min_bytes","_randrange","rone","rn1","getDivisor","SEVEN","_priv","primeCache","malleable","setGenerator","__prime","_primeLen","_primeCode","formatReturnValue","checkPrime","__gen","generateKeys","_gen","getPublicKey","computeSecret","front","getPrivateKey","getGenerator","_hashType","_signType","crt","parseKeys","getKey","hbits","bits2int","bits2octets","obits","makeKey","kv","makeR","signType","curveId","ecSign","priv_key","dsaSign","modulus","getr","prime1","prime2","blinds","blinder","unblinder","blind","blinded","qinv","coefficient","exponent1","exponent2","_move","modrn","allocate","_toArrayLikeLE","_toArrayLikeBE","isNegNum","aesid","fixProc","compat","passphrase","subtype","ndata","stripped","certificate","tbsCertificate","subjectPublicKeyInfo","RSAPublicKey","subjectPublicKey","subjectPrivateKey","pub_key","DSAparam","kde","kdeparams","iters","cipherText","EncryptedPrivateKey","RSAPrivateKey","ECPrivateKey","DSAPrivateKey","seq","AlgorithmIdentifier","bitstr","objid","null_","PrivateKeyInfo","octstr","EncryptedPrivateKeyInfo","explicit","ECParameters","choice","bignum","decoders","encoders","Entity","_createNamed","Generated","_initNamed","_getDecoder","_getEncoder","reporter","DEREncoder","tree","DERNode","_encodeComposite","primitive","encodedTag","tagByName","tagClassByName","encodeTag","_createEncoderBuffer","lenOctets","_encodeStr","_isNumstr","_isPrintstr","_encodeObjid","_encodeTime","_encodeNull","_encodeInt","numArray","_encodeBool","_use","_skipDefault","dataBuffer","_baseState","defaultBuffer","_encodeValue","safer","Safer","kStringMaxLength","MAX_LENGTH","MAX_STRING_LENGTH","Reporter","EncoderBuffer","DecoderBuffer","reverseArgs","any","useDecoder","implicit","contains","_wrap","stateProps","cstate","_useArgs","newKey","_decode","wrapResult","prevObj","present","prevKey","enterKey","_peekTag","isError","save","_decodeGeneric","_decodeChoice","restore","enterObject","_decodeTag","_getUse","_reporterState","leaveObject","exitKey","leaveKey","_decodeList","_decodeStr","_decodeObjid","_decodeTime","_decodeNull","_decodeBool","_decodeInt","_encodeChoice","_encodePrimitive","ReporterError","rethrow","pathLen","inherited","partial","isEncoderBuffer","isDecoderBuffer","fail","PEMEncoder","DERDecoder","derDecodeTag","tagStr","derDecodeLen","decodedTag","_skipUntilEnd","possibleEnd","numstr","printstr","subident","second","mon","day","hour","sec","UTC","PEMDecoder","_reverse","asn","Time","utcTime","utctime","generalTime","AttributeTypeValue","SubjectPublicKeyInfo","RelativeDistinguishedName","setof","RDNSequence","seqof","Name","rdnSequence","Validity","Extension","TBSCertificate","X509Certificate","findProc","startRegex","fullRegex","evp","okey","decrypted","match2","checkValue","ecVerify","unpacked","montp","dsaVerify","ECDH","secp224r1","prime256v1","prime192v1","secp384r1","secp521r1","curveType","p256","secp256r1","secp192r1","p384","p521","inenc","mgf","withPublic","paddedMsg","iHash","hLen2","ps","dblen","maskedDb","oaep","nonZero","i2ops","zBuffer","dif","safeBuffer","kBufferMaxLength","kMaxUint32","assertOffset","actualFill","ourBuf","notFoundError","sortAll","drain","take","puts","dels","commit","putMany","deleteMany","it","_all","orders","_allKeys","tempdir","sorter","tmpdir","replaceStartWith","dbOpenFailedError","dbDeleteFailedError","dbWriteFailedError","abortedError","TimeoutController","parseDuration","optionsArgIndex","fnRes","timeoutPromise","_resolve","maybeThrowTimeoutError","race","retimer","_ms","_timer","Retimer","_started","_rescheduled","_scheduled","_args","timerWrapper","reschedule","durationRE","unitRatio","nanosecond","us","microsecond","millisecond","minute","week","wk","month","yr","toCidAndPath","lastCid","lastRemainderPath","remainderPath","IPFS_PREFIX","formatArgs","useColors","humanize","lastC","__nwjs","WebkitAppearance","firebug","localstorage","colors","formatters","createDebug","prevTime","enableOverride","coerce","formatter","selectColor","delimiter","newDebug","toNamespace","disable","skips","enable","plural","msAbs","isPlural","long","fmtLong","fmtShort","DAGLink","defaultHashAlg","binaryBlob","deserialize","Links","ii","PBNode","serializeDAGNode","serializeDAGNodeLike","genCid","serialize","pbn","objects","links","Tsize","userOptions","PBLink","fromValue","_nameBuf","_json","nameAsBuffer","sortLinks","createDagLinkFromB58EncodedHash","toDAGLink","addLink","rmLink","serializedSize","sortedLinks","_serializedSize","_size","_invalidateCached","uint8ArrayCompare","linkSort","buf1","buf2","inplace","stable","localeCompare","pass","ri","Size","toProtoBuf","pbf","nodeCid","DAG_PB","cidVersion","dagLink","asDAGLink","dagNode","nameOrCid","PBData","dirTypes","DEFAULT_FILE_MODE","DEFAULT_DIRECTORY_MODE","parseMode","parseMtime","secs","nsecs","Seconds","FractionalNanoseconds","marshaled","blockSizes","blocksizes","_originalMode","fanout","isDirectory","parsedMode","DataType","Raw","Directory","File","Metadata","Symlink","HAMTShard","pbData","filesize","UnixTime","MimeType","NotInitializedError","AlreadyInitializingError","NotStartedError","AlreadyStartingError","AlreadyStartedError","NotEnabledError","setExchange","startOnline","service","panic","unsetExchange","domain","recursive","fqdnFixups","TLRU","PQueue","httpQueue","concurrency","Path","Message","fqdn","nocache","resolveDnslink","hashlru","maxSize","lru","expire","ttl","p_timeout_1","priority_queue_1","timeoutError","_intervalCount","_intervalEnd","_pendingCount","_resolveEmpty","_resolveIdle","carryoverConcurrencyCount","intervalCap","interval","autoStart","queueClass","_carryoverConcurrencyCount","_isIntervalIgnored","_intervalCap","_interval","_queue","_queueClass","_timeout","_throwOnTimeout","throwOnTimeout","_isPaused","_doesIntervalAllowAnother","_doesConcurrentAllowAnother","_concurrency","_tryToStartAnother","_onInterval","_initializeIntervalIfNeeded","_timeoutId","_intervalId","_onResumeInterval","clearInterval","_resolvePromises","canInitializeInterval","_isIntervalPaused","dequeue","setInterval","_processQueue","newConcurrency","enqueue","operation","_next","function_","existingResolve","milliseconds","Events","EE","clearEvent","pFinally","pTimeout","timer","cancel","onFinally","lower_bound_1","priority","isStarted","cidToString","resolvedPath","cidBase","upgrade","toV1","createAdd","createAddAll","createLs","createRm","createRmAll","rmAll","rm","remote","PinManager","PinTypes","normaliseInput","pinAdd","metadata","isPinnedWithType","direct","pinRecursively","pinDirectly","lock","readLock","dagCborLinks","cborg","encoder","cidToKey","keyToMultihash","indirect","directPins","recursivePins","_walkDag","childCid","pins","fetchCompleteDag","recursiveKeys","pinned","parentCid","findChild","invalidPinTypeErr","parseBuffer","_path","__path","isCircular","replaceCIDbyTAG","circular","Tagged","tagCID","DAG_CBOR","SHA2_256","defaultTags","currentSize","defaultMaxSize","configureDecoder","decoderOptions","Decoder","nodeTagged","decodeAll","Diagnose","Encoder","Simple","decodeFirst","diagnose","leveldb","createTag","tagNumber","createInt","createInt32","createInt64","f1","f2","g1","createInt32Neg","createInt64Neg","createTrue","createFalse","createFloat","isNegativeZero","createFloatSingle","createFloatDouble","createByteString","createByteStringFromHeap","createInfinity","createInfinityNeg","createNaN","createNaNNeg","createNull","createUndefined","createSimpleUnassigned","createArray","createMap","collectObject","createObject","createUtf8String","createUtf8StringFromHeap","Bignumber","BigNumber","nextPowerOf2","_heap","_heap8","_knownTags","arrayBufferToBignumber","NEG_ONE","pushInt","pushInt32","pushInt32Neg","pushInt64","pushInt64Neg","pushFloat","pushFloatSingle","pushFloatDouble","pushTrue","pushFalse","pushUndefined","pushNull","pushInfinity","pushInfinityNeg","pushNaN","pushNaNNeg","pushArrayStart","pushArrayStartFixed","pushArrayStartFixed32","pushArrayStartFixed64","pushObjectStart","pushObjectStartFixed","pushObjectStartFixed32","pushObjectStartFixed64","pushByteString","pushByteStringStart","pushUtf8String","pushUtf8StringStart","pushSimpleUnassigned","pushTagUnassigned","pushTagStart","pushTagStart4","pushTagStart8","pushBreak","_parents","_depth","_currentParent","_closeParent","PARENT","TAG","BYTE_STRING","UTF8_STRING","MAP","OBJECT","ARRAY","_dec","hasChildren","_ref","tmpKey","buildMap","_createParent","_res","typ","buildInt32","buildInt64","MAX_SAFE_HIGH","SHIFT32","plus","_createArrayStartFixed","len3","len4","_createObjectStartFixed","globalObject","isNumeric","mathceil","mathfloor","bignumberError","tooManyDigits","LOG_BASE","POWS_TEN","SQRT_BASE","bitFloor","coeffToString","yc","intCheck","toExponential","toFixedPoint","configObject","convertBase","parseNumeric","pow2_53","random53bitInt","basePrefix","dotAfter","dotBefore","isInfinityOrNaN","whitespaceOrPlus","DECIMAL_PLACES","ROUNDING_MODE","TO_EXP_NEG","TO_EXP_POS","MIN_EXP","MAX_EXP","CRYPTO","MODULO_MODE","POW_PRECISION","FORMAT","secondaryGroupSize","groupSeparator","decimalSeparator","fractionGroupSize","fractionGroupSeparator","suffix","caseChanged","isNum","_isBigNumber","DEBUG","maxOrMin","normalise","sd","rd","pows10","ROUND_UP","ROUND_DOWN","ROUND_CEIL","ROUND_FLOOR","ROUND_HALF_UP","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_HALF_CEIL","ROUND_HALF_FLOOR","EUCLID","EXPONENTIAL_AT","RANGE","isBigNumber","maximum","minimum","toBaseOut","baseIn","baseOut","arrL","callerIsToString","xlo","xhi","klo","khi","aL","bL","more","prodL","qc","remL","rem0","xL","yc0","yL","yz","absoluteValue","comparedTo","decimalPlaces","dividedBy","dividedToIntegerBy","idiv","exponentiatedBy","isModExp","nIsBig","nIsNeg","nIsOdd","integerValue","isEqualTo","isGreaterThan","isGreaterThanOrEqualTo","isLessThan","isLessThanOrEqualTo","isNegative","isPositive","xLTy","xe","ye","multipliedBy","xcL","ycL","ylo","yhi","zc","sqrtBase","negated","precision","shiftedBy","squareRoot","rep","toFormat","intPart","fractionPart","intDigits","toFraction","d0","n0","toPrecision","stdlib","foreign","heap","jumpTable","readUInt16","readUInt32","INT_P","octet","UINT_P_8","UINT_P_16","UINT_P_32","UINT_P_64","INT_N","UINT_N_8","UINT_N_16","UINT_N_32","UINT_N_64","BYTE_STRING_8","BYTE_STRING_16","BYTE_STRING_32","BYTE_STRING_64","BYTE_STRING_BREAK","UTF8_STRING_8","UTF8_STRING_16","UTF8_STRING_32","UTF8_STRING_64","UTF8_STRING_BREAK","ARRAY_8","ARRAY_16","ARRAY_32","ARRAY_64","ARRAY_BREAK","MAP_8","MAP_16","MAP_32","MAP_64","MAP_BREAK","TAG_KNOWN","TAG_BIGNUM_POS","TAG_BIGNUM_NEG","TAG_FRAC","TAG_BIGNUM_FLOAT","TAG_UNASSIGNED","TAG_BASE64_URL","TAG_BASE64","TAG_BASE16","TAG_MORE_1","TAG_MORE_2","TAG_MORE_4","TAG_MORE_8","SIMPLE_UNASSIGNED","SIMPLE_FALSE","SIMPLE_TRUE","SIMPLE_NULL","SIMPLE_UNDEFINED","SIMPLE_BYTE","SIMPLE_FLOAT_HALF","mant","SIMPLE_FLOAT_SINGLE","SIMPLE_FLOAT_DOUBLE","ERROR","BREAK","SHIFT16","parseHalf","writeHalf","u32","s16","keySorter","lenA","lenB","MT","POS_INT","NEG_INT","SIMPLE_FLOAT","DATE_STRING","DATE_EPOCH","POS_BIGINT","NEG_BIGINT","DECIMAL_FRAC","BIGFLOAT","BASE64URL_EXPECTED","BASE64_EXPECTED","BASE16_EXPECTED","CBOR","URI","BASE64URL","BASE64","REGEXP","MIME","NUMBYTES","EIGHT","INDEFINITE","SIMPLE","FALSE","TRUE","UNDEFINED","SYMS","STREAM","_pushInt","hasParent","_pushTag","pushAny","converters","HALF","FLOAT","DOUBLE","MAXINT_BN","BUF_NAN","BUF_INF_NEG","BUF_INF_POS","streaming","onData","semanticTypes","_pushUrl","_pushBigNumber","addTypes","genTypes","addSemanticType","resultMethod","pushWrite","_pushUInt8","_pushUInt16BE","_pushUInt32BE","_pushDoubleBE","_pushNaN","_pushInfinity","_pushFloat","orig","_pushIntNum","_pushNumber","_pushString","_pushBoolean","_pushUndefined","_pushArray","_pushDate","_pushBuffer","_pushNoFilter","_pushRegexp","_pushSet","_pushBigint","slide","_pushMap","_pushRawMap","_pushObject","encodeCBOR","toType","_isCircular","parentList","nextpath","jump","byteUtils","_0uint","_1negint","_2bytes","_3string","_4array","_5map","_6tag","_7float","defaultEncodeOptions","float64","mapSorter","keyToken1","keyToken2","major","tcmp","cborEncoders","compareTokens","quickEncodeToken","encodeUint","negint","encodeNegint","encodeBytes","encodeArray","encodeMap","encodeFloat","Bl","Ref","encodeErrPrefix","simpleTokens","null","true","false","emptyMap","typeEncoders","_typ","_refStack","isSafeInteger","boolean","_obj","refStack","addBreakTokens","break","createCheck","objectToTokens","sortMapEntries","customTypeEncoder","typeEncoder","tokensToEncoded","encodeCustom","quickBytes","encodedSize","chunks","asU8A","typeofs","objectTypeNames","typeOf","objectTypeName","getObjectType","terminal","majorEncoded","encodedLength","encodedBytes","maxCursor","_initReuseChunk","topChunk","chunkPos","byts","useBuffer","padStart","fromHex","decodeErrPrefix","uintMinorPrefixBytes","assertEnoughData","invalidMinor","minor","errorer","decodeUint8","decodeUint16","decodeUint32","decodeUint64","decodeNegint8","decodeNegint16","decodeNegint32","decodeNegint64","decodeBytesCompact","decodeBytes8","decodeBytes16","decodeBytes32","decodeBytes64","decodeStringCompact","decodeString8","decodeString16","decodeString32","decodeString64","decodeArrayCompact","decodeArray8","decodeArray16","decodeArray32","decodeArray64","decodeArrayIndefinite","decodeMapCompact","decodeMap8","decodeMap16","decodeMap32","decodeMap64","decodeMapIndefinite","decodeTagCompact","decodeTag8","decodeTag16","decodeTag32","decodeTag64","decodeUndefined","decodeFloat16","decodeFloat32","decodeFloat64","decodeBreak","quick","token$1","uintBoundaries","readUint16","readUint32","readUint64","allowBigInt","encodeUintValue","nuint","buint","tok1","tok2","_minor","neg1b","pos1b","MIN_SAFE_INTEGER","toToken","tokenBytes","compareBytes","totLength","_data","_pos","allowIndefinite","createToken","allowNaN","allowInfinity","success","encodeFloat16","readFloat16","ui8a","encodeFloat32","readFloat32","dataView","setFloat64","readFloat64","setFloat32","valu32","getUint32","logicalExponent","getFloat32","getFloat64","allowUndefined","defaultDecodeOptions","Tokeniser","byt","DONE","tokensToObject","tokeniser","tokenToArray","useMaps","tokenToMap","tagged","tokenizer","toPin","checkPinType","paths","indirectKeys","directKeys","unpin","IPNS","routingConfig","OfflineDatastore","offline","online","routing","getIPNS","datastore","republisher","lifetime","publish","IpnsPublisher","IpnsRepublisher","IpnsResolver","publisher","defaultRecordLifetime","publishWithEOL","ttEol","ERR_NOT_FOUND","_routing","_datastore","_updateOrCreateRecord","_putRecordToRouting","errMsg","embedPublicKeyRecord","embedPublicKey","getIdKeys","_publishEntry","routingKey","_publishPublicKey","routingPubKey","isKey","entryData","uint8Array","checkRouting","dsVal","getLocalKey","_unmarshalData","unmarshal","getPublishedOptions","_getPublished","seqNumber","sequence","NanoDate","IpnsEntry","ipnsEntryProto","parseRFC3339","ERRORS","ID_MULTIHASH_CODE","_create","isoValidity","validityType","validity","dataForSignature","ipnsEntryDataForSig","isValid","ERR_SIGNATURE_VERIFICATION","ValidityType","EOL","validityDate","ERR_UNRECOGNIZED_FORMAT","ERR_IPNS_EXPIRED_RECORD","ERR_UNRECOGNIZED_VALIDITY","extractPublicKey","ERR_UNDEFINED_PARAMETER","rawStdEncoding","ERR_SIGNATURE_CREATION","validityTypeBuffer","getValidityType","extractPublicKeyFromId","decodedId","validator","marshalledData","receivedEntry","bufferId","dataA","dataB","entryA","entryB","createWithExpiration","expiration","extractedPublicKey","ERR_PEER_ID_FROM_PUBLIC_KEY","ERR_PUBLIC_KEY_FROM_ID","pkBuffer","ipnsBuffer","pkKey","ipnsKey","namespaceLength","Timestamp","SEC_DAY","YEAR_SLOT","DAY_SLOT","SEC_SLOT","MSEC_SLOT","MAX_MSEC","BIT32","DEC6","DEC9","ZERO9","trunc","fromDate","fromInt64BE","buildFromInt64","fromInt64LE","nano","fromTimeT","fromTime","addNano","getNano","getTimeT","getYear","toDate","newDate","dt","pad2","getUTCMilliseconds","FMT_DAY","getUTCDay","FMT_MONTH","strftime","FMT_STRING","buildWriteInt64","writeInt64LE","%","changed","pos0","pos1","pos2","pos3","posH","posL","checkRange","writeUint32","toRFC3339","rfc3339Matcher","_publisher","_peerId","_keychain","_republishHandle","republishHandle","_task","_inflightTask","runPeriodically","period","firstRun","_republishEntries","initialBroadcastInterval","broadcastInterval","_republishEntry","listKeys","_getPreviousValue","notFound","nameSegments","_resolveName","ipnsEntry","_validateRecord","TieredDatastore","PubsubDatastore","ipnsStores","pubsubDs","localDatastore","offlineDatastore","_dht","KeytransformDatastore","ShardingDatastore","MountDatastore","NamespaceDatastore","shard","batch","invert","queryKeys","KeytransformStore","shardKey","SHARDING_FN","shardReadmeKey","README_FN","store","_convertKey","_invertKey","readShardFun","hasShard","putRaw","readme","diskShard","tq","PREFIX","ShardBase","Prefix","prefixLen","noslash","Suffix","suffixLen","NextToLast","parseShardFun","getRaw","Keytransform","mounts","isAncestorOf","mountpoint","_lookup","batchMounts","qs","pushable","FIFO","onNext","bufferNext","bufferError","throw","_pushable","FixedFIFO","btm","stores","batches","undef","dlv","_subscriptions","_handleSubscriptionKey","_pubsubDs","stringifiedTopic","subscriber","canceled","bufTopic","unsubscribe","encodeBase32","keyToTopic","topicToKey","subscriptionKeyFn","_pubsub","_validator","_handleSubscriptionKeyFn","_onMessage","subscriptions","getTopics","_getLocal","subscribe","topicIDs","_storeIfSubscriptionIsBetter","isBetter","_isBetter","_storeRecord","records","dsKey","currentRecord","_selectRecord","topic","Record","_repo","_routingKey","selection","PBRecord","timeReceived","prepareSerialize","fromDeserialized","recvtime","verifyRecord","validators","keyhash","publicKeyHash","bestRecord","selectors","createPublishAPI","PubSubAPI","lookupKey","pubLifetime","isDomain","appendRemainder","domainNameRegex","domainName","rootDot","createCancelAPI","createStateAPI","createSubsAPI","subs","getPubsubRouting","experimental","IpnsPubsubDatastore","ipnsPubsub","getSubscriptions","toCIDAndPath","Format","edges","refsStream","resPath","maxDepth","unique","rootCid","uniqueOnly","traverseLevel","nextLevelDepth","mapper","getNodeLinks","getLinks","objectStream","formatLink","srcCid","dstCid","linkName","getFullPath","createWantlist","createWantlistForPeer","createUnwant","createStat","wantlist","wantlistForPeer","unwant","stat","getWantlist","cids","snapshot","provideBufLen","providesBufferLength","blocksReceived","peers","dupBlksReceived","dupDataReceived","dataReceived","blocksSent","dataSent","createClear","createList","createReset","isValidMultiaddr","boostrappers","Bootstrap","Peers","ma","defaultConfig","Addresses","Swarm","Announce","NoAnnounce","API","Gateway","RPC","Delegates","Discovery","MDNS","Enabled","Interval","webRTCStar","Pubsub","ConnMgr","LowWater","HighWater","DisableNatPortMap","Routing","createGet","createPut","cleanCid","Block","mhtype","blockSymbol","deprecateData","_cid","deprecateCID","parallelMap","writeLock","pinResult","quiet","streamingIterables","getIterator","defer","resolveFunc","rejectFunc","resultQueue","readQueue","fillQueue","readDeferred","fulfillReadQueue","asyncIterableIterator","deferred","curriedIterable","valueQueue","syncBuffer","_filter","filterFunc","flatten","maybeItr","_map","_flatTransform","inflightCount","lastError","itrValue","asyncVal","mapAndQueue","onceReadable","firstFn","previousFn","curriedFunc","transformError","itr","_parallelMap","_reduce","nextItem","_asyncTap","addTime","seconds","nanoseconds","_writeToStream","errCb","drainCb","notifyError","notifyDrain","dataBatch","_batch","_syncBatch","_collect","iterables","_concat","_syncConcat","_consume","flatMap","flatTransform","_fromStream","nextVal","parallelFlatMap","parallelMerge","inputs","concurrentWork","valueCb","notifyDone","queueNext","curriedStart","taken","_take","_syncTake","tap","hrtime","progress","_asyncTime","_syncTime","writeToStream","rawPipe","isIterable","sink","duplexPipelineFn","duplex","createAddAPI","createAddAllAPI","createCatAPI","createGetAPI","createLsAPI","normaliseAddInput","parseChunkerString","isShardingEnabled","sharding","shardSplitThreshold","strategy","chunker","trickle","leafType","reduceSingleLeafToSelf","rawLeaves","totals","prog","transformFile","wrapWithDirectory","maybePreloadFile","onlyHash","preloadFile","maybePinFile","isRootDir","pinFile","added","parallelBatch","dagBuilder","treeBuilder","candidates","fileImportConcurrency","tasks","things","blockWriteConcurrency","minChunkSize","maxChunkSize","avgChunkSize","polynomial","maxChildrenPerNode","layerRepeat","hidden","hamtHashFn","justHash","hamtHashCode","hamtBucketBits","dirBuilder","fileBuilder","contentAsAsyncIterable","chunkValidator","persist","dagBuilders","balanced","previous","bufferImporter","single","buildFileBatch","leaves","leaf","addBlockSize","reduceToParents","chunked","Root","iteration","layer","isFull","addChild","SubTree","append","currentDepth","maxChildren","_addNextNodeToParent","distantRelative","_findParent","sizepow","log2","buffers","fingerprint","rabin","_bufs","_offset","tot","_t","_reverseOffset","blOffset","dstStart","srcStart","srcEnd","bufoff","shallowSlice","endOffset","duplicate","_appendBuffer","_isBufferList","blIndex","buffOffset","nativeSearchResult","revOffset","_match","searchOffset","isBufferList","Rabin","getRabin","windowSize","compiled","asModule","__retain","__release","__allocArray","__getInt32Array","Int32Array_ID","Uint8Array_ID","lengthsPtr","Int32Array","pointer","processed","loadWebAssembly","imp","wasm","WebAssembly","BIGINT","BigUint64Array","THIS","CHUNKSIZE","getStringImpl","U32","U16","preInstantiate","baseModule","getString","memory","mesg","colm","postInstantiate","rawExports","retain","rttiBase","getInfo","getBase","getValueAlign","getView","alignLog2","signed","Int8Array","Int16Array","BigInt64Array","__getArrayView","align","getTypedArray","getTypedArrayView","bufPtr","__allocString","__getString","__getArray","__getArrayBuffer","__getInt8Array","__getInt8ArrayView","__getUint8Array","__getUint8ArrayView","__getUint8ClampedArray","Uint8ClampedArray","__getUint8ClampedArrayView","__getInt16Array","__getInt16ArrayView","__getUint16Array","__getUint16ArrayView","__getInt32ArrayView","__getUint32Array","__getUint32ArrayView","__getInt64Array","__getInt64ArrayView","__getUint64Array","__getUint64ArrayView","__getFloat32Array","__getFloat32ArrayView","__getFloat64Array","__getFloat64ArrayView","__instanceof","baseId","demangle","isResponse","instantiateStreaming","Module","setArgumentsLength","internalName","classElem","thisValue","instantiateSync","Instance","currentLength","newBl","DirFlat","flatToShard","Dir","toPathComponents","addToTree","pathElems","currentPath","pathElem","dirty","parentKey","flushAndYield","unwrapped","eachChildSeries","_children","childCount","DirSharded","threshold","newDir","directChildrenCount","oldDir","convertToShard","createHAMT","Bucket","bucket","shardRoot","childrenSize","labelPrefix","subShard","flushedDir","bitField","tableSize","_bucket","leafCount","childrenCount","onlyChild","eachLeafSeries","wrapHash","bucketOptions","SparseArray","posAtParent","_popCount","_parent","_posAtParent","_findNewBucketAndPos","_putAt","_findChild","_findPlace","_at","_delAt","compactArray","asyncMap","asyncReduce","asyncTransformBucket","mapNode","reduceNodes","hashValue","existingChild","_putObjectAt","newPlace","unset","_level","exists","untake","mappedChildren","popCountReduce","popCount","_v","sortInternal","valueOnly","_bitArrays","_changedLength","_changedData","_internalPositionFor","_unsetInternalPos","_unsetBit","needsSort","_setBit","_setInternalPos","_sortData","mapped","reducer","finder","noCreate","bytePos","_bytePosFor","bitPos","targetLength","randomIndex","newByte","pendingBitsForResultingByte","pendingBitsForNewByte","resultingByte","usingBits","ConsumableBuffer","InfiniteHash","_hashFn","_availableBits","_currentBufferIndex","_buffers","pendingBits","_produceMoreBits","availableBits","availableForUntake","totalBits","START_MASKS","STOP_MASKS","byteBitsToInt","maskFor","_currentBytePos","_currentBitPos","_haveBits","taking","normaliseContent","browserStreamToIt","blobToIt","itPeekable","isBytes","isReadableStream","isBlob","peekable","peek","preventCancel","browserReadableStreamToIt","isFileObject","toFileObject","parseRabinString","parseChunkSize","sizeStr","pathComponents","cidAndRest","toResolve","walkPath","entryPath","startingDepth","recurse","findShardCid","contentExporters","directory","hamt-sharded-directory","symlink","linkCid","findLinkCid","nextName","toPrefix","rootBucket","hamtDepth","lastBucket","bucketPath","toBucketPath","entryPrefix","entryName","extractDataFromBlock","validateOffsetAndLength","emitBytes","streamPosition","childStart","childLink","childEnd","blockStart","requestedStart","requestedEnd","blockEnd","listDirectory","subObject","subPath","pkg","repoVersion","gitHead","interface-ipfs-core","devDependencies","pkgversion","protocolVersion","peerStore","keyBook","addressBook","getMultiaddrsForPeer","multiaddrs","protoBook","upgrader","metadataBook","idStr","getDefaultConfig","listProfiles","profiles","profileName","dryRun","profile","oldCfg","newCfg","Identity","PrivKey","server","local-discovery","default-networking","lowpower","default-power","thisProp","lastProp","createResolve","createTree","localResolve","multihashes","nameToHashCode","readEncodingOptions","encodingCodes","defaultCIDOptions","readVersion","toUri","shuffle","stopped","requests","apiUris","fallbackApiUris","uri","reduceValue","Reducers","assumeHttp","explicitPort","tcpUri","timeoutId","preloadMfs","nextRootCid","createLock","readOperations","writeOperations","chmod","mkdir","mv","touch","unwrappedOperations","mfs","operations","constructorOptions","createMfs","withPreload","mortice","mutex","singleProcess","Queue","mutexes","implementation","createReleaseable","createMutex","isWorker","masterQueue","localReadQueue","readPromise","onIdle","finally","Impl","WORKER_REQUEST_READ_LOCK","WORKER_RELEASE_READ_LOCK","MASTER_GRANT_READ_LOCK","WORKER_REQUEST_WRITE_LOCK","WORKER_RELEASE_WRITE_LOCK","MASTER_GRANT_WRITE_LOCK","cluster","handleWorkerLockRequest","masterEvent","requestType","releaseType","grantType","requestEvent","releaseEventListener","releaseEvent","makeWorkerLockRequest","isMaster","observer","responseEvent","observable","timeoutMillis","toMfsPath","withLocal","mfsPath","exportPath","statters","cumulativeSize","sizeLocal","withLocality","loadMfsRoot","entryType","mfsDirectory","toTrail","updateTree","updateMfsRoot","parseSymbolicMode","originalMode","references","modification","calculateModification","ugo","calculateUGO","calculateSpecial","calculateMode","strMode","updatedCid","newRootCid","fsEntry","defaultImporterOptions","updateHamtDirectory","recreateHamtLevel","recreateInitialHamtLevel","createShard","addLinksToHamtBucket","convertToShardedDirectory","addToDirectory","addToShardedDirectory","addFileToShardedDirectory","oldLink","newLink","importerOptions","nextSegment","positionInBucket","parentBucket","positionAtParent","generatePath","fileName","rootNode","currentBucket","getMany","parents","destination","missing","destinationIsDirectory","parentFolder","destinationPath","destinationName","copyToFile","copyToDirectory","destinationTrail","addSourceToParent","childName","sourceBlock","createNode","withMfsRoot","emptyDir","subPathComponents","removeLink","removePath","removeFromDirectory","removeFromShardedDirectory","del","updateShard","positions","newName","updateShardParent","settings","toAsyncIterator","updateOrImport","parentExists","updatedPath","asyncZeroes","limitAsyncStreamBytes","countBytesStreamed","catAsyncIterators","bytesWritten","_asyncZeroes","notify","wrote","FileReader","handleLoad","readAsArrayBuffer","toOutput","createExport","createGen","createImport","createInfo","createRename","rename","findKeyByName","renameKey","was","overwrite","removeKey","createData","createLinks","createNew","ObjectPatchAPI","new","findLinks","DAGLinkUtil","parseJSONBuffer","parseProtoBuffer","dagPB","serialized","linkLength","NumLinks","BlockSize","LinksSize","DataSize","CumulativeSize","createAddLink","createAppendData","createRmLink","createSetData","appendData","setData","newData","linkRef","createGC","createVersion","gc","markedSet","pinsSource","mfsSource","createMarkedSet","blockKeys","blocksCount","removedBlocksCount","removeBlock","deleteUnmarkedBlocks","numObjects","repoSize","repoPath","storageMax","_checkInitialized","migrator","pathJoin","backends","spec","apiAddr","blockstore","idstore","defaultDatastore","noLimit","lockers","fs","getSize","_locker","_getLocker","blocksBaseStore","blockStore","storageBackendOptions","_config","_openRoot","Datastore","Spec","mounting","shardFunc","buildDatastoreSpec","ERR_REPO_ALREADY_OPEN","lockfile","_openLock","check","_isAutoMigrationEnabled","InvalidRepoVersionError","_migrate","_closeLock","ERR_REPO_NOT_INITIALIZED","ERR_REPO_ALREADY_CLOSED","_storageMaxStat","_blockStat","autoMigrate","autoMigrateConfig","NotFoundError","toVersion","ignoreLock","onProgress","onMigrationProgress","migrate","blockOrCid","propsArg","defaultMigrations","repoLock","getLatestMigrationVersion","migrations","verifyAvailableMigrations","fromVersion","checkReversibility","migrationCounter","migration","NonReversibleMigrationError","InvalidValueError","getCurrentRepoVersion","getVersion","repoOptions","isDryRun","RequiredParameterError","currentVersion","progressCallback","percent","lastSuccessfullyMigratedVersion","setVersion","reversedMigrationArray","lastSuccessfullyRevertedVersion","emptyMigration","mb","createStore","multihashStr","keyToCid","keyFunction","core","ShardingStore","CONFIG_KEY","VERSION_KEY","findLevelJs","hasWithFallback","levelJs","transaction","getWithFallback","StorageBackend","storageOptions","storageBackends","getDatastoreAndOptions","originalGet","originalHas","dagpb","pinset","PIN_DS_KEY","pinsToDatastore","pinstore","pinRootBuf","pinRoot","pinCount","loadSet","pinsToDAG","storeSet","PinSet","fnv1a","DEFAULT_FANOUT","MAX_ITEMS","EMPTY_KEY","setUint32","encodedKey","walkItems","pbh","rootData","hdrLength","vBytes","hdrSlice","readHeader","linkHash","storePins","pbHeader","headerBuf","fanoutLinks","rootLinks","bins","storeChild","binIdx","storeItems","keysToBinary","withEach","keysToStrings","datastores","migrated","_deserializeKey","_deserializeValue","handleNext","handleEnd","onsuccess","repoInit","MissingRepoOptionsError","NotInitializedRepoError","isRepoInitialized","versionCheck","configCheck","LOCKS","formatThousandsRegExp","formatDecimalsRegExp","kb","gb","tb","pb","parseRegExp","mag","thousandsSeparator","unitSeparator","fixedDecimals","unit","floatValue","Ctor","versionKey","configKey","setQueue","configStore","encodedValue","_maybeDoSet","_saveAll","LockExistsError","sortKeys","specKey","seenInput","seenOutput","deepSortArray","seenIndex","apiFile","filestore","blockData","createBaseStore","maybeWithSharding","extractContents","isIdentity","extracted","extension","database","valueEncoding","compression","_initDb","ops","_query","iteratorOpts","keyAsBuffer","levelup","leveldown","Level","DeferredLevelDOWN","IteratorStream","Batch","supports","catering","getCallback","WriteError","ReadError","OpenError","InitializationError","LevelUP","_db","deferredOpen","openCallback","promises","additionalMethods","maybeError","_isOpening","isOpen","fromCallback","isClosed","readStream","createReadStream","keyStream","createKeyStream","valueStream","createValueStream","descriptors","formatRegExp","isNull","noDeprecation","throwDeprecation","traceDeprecation","debugs","debugEnvRegex","stylize","stylizeNoColor","showHidden","_extend","isUndefined","stylizeWithColor","formatValue","styleType","recurseTimes","isNumber","formatPrimitive","visibleKeys","arrayToHash","formatError","isRegExp","braces","toUTCString","formatProperty","formatArray","numLinesEst","reduceToSingleString","desc","bold","italic","underline","inverse","white","grey","black","blue","cyan","green","magenta","yellow","special","isNullOrUndefined","isNativeError","isPrimitive","months","timestamp","getHours","getMinutes","getSeconds","getDate","getMonth","kCustomPromisifiedSymbol","callbackifyOnRejected","newReason","promisify","promiseResolve","promiseReject","callbackify","callbackified","maybeCb","rej","isArgumentsObject","isGeneratorFunction","whichTypedArray","isTypedArray","uncurryThis","BigIntSupported","SymbolSupported","ObjectToString","numberValue","stringValue","booleanValue","bigIntValue","symbolValue","checkBoxedPrimitive","prototypeValueOf","isMapToString","isSetToString","isWeakMapToString","isWeakSetToString","isArrayBufferToString","working","isDataViewToString","isDataView","isUint8ClampedArray","isUint16Array","isUint32Array","isInt8Array","isInt16Array","isInt32Array","isFloat32Array","isFloat64Array","isBigInt64Array","isBigUint64Array","isWeakMap","isWeakSet","SharedArrayBufferCopy","isSharedArrayBufferToString","isSharedArrayBuffer","isNumberObject","isStringObject","isBooleanObject","isBigIntObject","isSymbolObject","isMapIterator","isSetIterator","isGeneratorObject","isWebAssemblyCompiledModule","isBoxedPrimitive","isAnyArrayBuffer","hasToStringTag","$toString","callBound","isStandardArguments","isLegacyArguments","supportsStandardArguments","GetIntrinsic","callBind","$indexOf","allowMissing","intrinsic","$SyntaxError","$Function","$TypeError","getEvalledConstructor","expressionSyntax","$gOPD","throwTypeError","ThrowTypeError","calleeThrows","gOPDthrows","hasSymbols","needsEval","TypedArray","INTRINSICS","%AggregateError%","AggregateError","%Array%","%ArrayBuffer%","%ArrayIteratorPrototype%","%AsyncFromSyncIteratorPrototype%","%AsyncFunction%","%AsyncGenerator%","%AsyncGeneratorFunction%","%AsyncIteratorPrototype%","%Atomics%","Atomics","%BigInt%","%Boolean%","%DataView%","%Date%","%decodeURI%","decodeURI","%decodeURIComponent%","%encodeURI%","%encodeURIComponent%","%Error%","%eval%","%EvalError%","EvalError","%Float32Array%","%Float64Array%","%FinalizationRegistry%","FinalizationRegistry","%Function%","%GeneratorFunction%","%Int8Array%","%Int16Array%","%Int32Array%","%isFinite%","%isNaN%","%IteratorPrototype%","%JSON%","%Map%","%MapIteratorPrototype%","%Math%","%Number%","%Object%","%parseFloat%","%parseInt%","%Promise%","%Proxy%","%RangeError%","%ReferenceError%","ReferenceError","%Reflect%","%RegExp%","%Set%","%SetIteratorPrototype%","%SharedArrayBuffer%","%String%","%StringIteratorPrototype%","%Symbol%","%SyntaxError%","%ThrowTypeError%","%TypedArray%","%TypeError%","%Uint8Array%","%Uint8ClampedArray%","%Uint16Array%","%Uint32Array%","%URIError%","URIError","%WeakMap%","%WeakRef%","WeakRef","%WeakSet%","doEval","LEGACY_ALIASES","%ArrayBufferPrototype%","%ArrayPrototype%","%ArrayProto_entries%","%ArrayProto_forEach%","%ArrayProto_keys%","%ArrayProto_values%","%AsyncFunctionPrototype%","%AsyncGeneratorPrototype%","%BooleanPrototype%","%DataViewPrototype%","%DatePrototype%","%ErrorPrototype%","%EvalErrorPrototype%","%Float32ArrayPrototype%","%Float64ArrayPrototype%","%FunctionPrototype%","%Generator%","%GeneratorPrototype%","%Int8ArrayPrototype%","%Int16ArrayPrototype%","%Int32ArrayPrototype%","%JSONParse%","%JSONStringify%","%MapPrototype%","%NumberPrototype%","%ObjectPrototype%","%ObjProto_toString%","%ObjProto_valueOf%","%PromisePrototype%","%PromiseProto_then%","%Promise_all%","%Promise_reject%","%Promise_resolve%","%RangeErrorPrototype%","%ReferenceErrorPrototype%","%RegExpPrototype%","%SetPrototype%","%SharedArrayBufferPrototype%","%StringPrototype%","%SymbolPrototype%","%SyntaxErrorPrototype%","%TypedArrayPrototype%","%TypeErrorPrototype%","%Uint8ArrayPrototype%","%Uint8ClampedArrayPrototype%","%Uint16ArrayPrototype%","%Uint32ArrayPrototype%","%URIErrorPrototype%","%WeakMapPrototype%","%WeakSetPrototype%","$concat","$spliceApply","$replace","$strSlice","rePropName","reEscapeChar","stringToPath","subString","getBaseIntrinsic","intrinsicName","intrinsicBaseName","intrinsicRealName","skipFurtherCaching","isOwn","origSymbol","hasSymbolSham","symObj","syms","ERROR_MESSAGE","toStr","funcType","binder","boundLength","boundArgs","Empty","$apply","$call","$reflectApply","$defineProperty","$max","originalFunction","applyBind","GeneratorFunction","fnToStr","isFnRegex","generatorFunc","getGeneratorFunc","availableTypedArrays","typedArrays","$slice","toStrTags","gOPD","typedArray","tryTypedArrays","foundName","possibleNames","anyTrue","AbstractLevelDOWN","DeferredIterator","deferrables","optionalDeferrables","_operations","_iterator","_open","setDb","_close","_serializeKey","_serializeValue","AbstractIterator","AbstractChainedBatch","rangeOptions","manifest","cleanRangeOptions","isRangeOption","oldStatus","createIfMissing","errorIfExists","_nextTick","_checkKey","asBuffer","_checkValue","_put","_del","_chainedBatch","valueErr","_clear","valueAsBuffer","emptyOptions","_setupIteratorOptions","manifests","bufferKeys","snapshots","permanence","seek","encodings","_ended","_nexting","_seek","_end","_written","_checkWritten","_operation","ReadStream","createError","LevelUPError","EncodingError","errno","prr","cause","ce","FilesystemError","definition","oo","os","makeOptions","fromPromise","Codec","rangeMethods","encodeKey","keyEncoding","Iterator","encodeLtgt","datum","encodeValue","decodeValue","encodeBatch","decodeKey","_keyEncoding","batchOpts","_valueEncoding","ltgt","createStreamDecoder","isBinary","none","bufferEncodings","support","createKeyRange","DEFAULT_PREFIX","indexedDB","onupgradeneeded","objectStoreNames","createObjectStore","objectStore","keyRange","batchOptions","each","deleteDatabase","_limit","_callback","_completed","_aborted","_error","_transaction","_values","_keyAsBuffer","_valueAsBuffer","createIterator","openCursor","onItem","onComplete","continue","maybeNext","lower","upper","upperBound","lowerOpen","lowerBoundExclusive","upperOpen","upperBoundExclusive","IDBKeyRange","isDef","hasKey","lowerBoundKey","lowerBoundInclusive","upperBoundInclusive","upperBoundKey","startInclusive","endInclusive","toLtgt","_range","lb","ub","ta2str","ta","ta2buf","ab2str","ab","str2bin","openKeyCursor","lockFile","locked","createBW","createRepo","createBitswap","bw","getBandwidthStats","metrics","peer","forPeer","forProtocol","totalIn","totalOut","rateIn","rateOut","movingAverages","movingAverage","poll","ipfsRepo","_bitswap","hasExchange","getDefaultIpldOptions","Ipld","IpldFormats","RAW","formats","loadFormat","ipldDagCbor","ipldDagPb","ipldRaw","typical","extendIterator","IPLDResolver","addFormat","getFormat","formatImpl","cidOptions","offsetPath","maybeRecurse","treePath","treePaths","basePath","isArrayLike","isDefined","isDefinedValue","isThenable","configService","createLibP2P","repoAutoMigrate","inputRepo","loadRepo","configureRepo","allowNew","initRepo","decodePeerId","initPeerId","peerIdToIdentity","PeerID","applyProfiles","keychainConfig","loadKeychain","mergeConfigs","Keychain","changes","IPFSRepo","PubsubRouters","libp2pOptions","libp2pDefaults","getPubsubRouter","peerDiscovery","mdns","relay","hop","clientMode","kBucketSize","nat","announce","noAnnounce","connectionManager","maxConnections","minConnections","getEnvLibp2pOptions","libp2pConfig","getLibp2pOptions","gossipsub","__createBinding","__setModuleDefault","__importStar","__awaiter","_arguments","fulfilled","rejected","pubsub_1","message_cache_1","rpc_1","heartbeat_1","get_gossip_peers_1","utils_1","score_1","tracer_1","TimeCache","Envelope","Gossipsub","multicodecs","GossipsubIDv11","GossipsubIDv10","gossipIncoming","fallbackToFloodsub","floodPublish","doPX","directPeers","GossipsubD","Dlo","GossipsubDlo","Dhi","GossipsubDhi","Dscore","GossipsubDscore","Dout","GossipsubDout","Dlazy","GossipsubDlazy","scoreParams","createPeerScoreParams","scoreThresholds","createPeerScoreThresholds","FloodsubID","debugName","addrs","seenCache","mesh","lastpub","gossip","control","peerhave","iasked","backoff","outbound","messageCache","MessageCache","GossipsubHistoryGossip","GossipsubHistoryLength","getMsgId","heartbeat","Heartbeat","heartbeatTicks","gossipTracer","IWantTracer","_libp2p","PeerScore","_addPeer","addPeer","rvalue","peerStreams","_removePeer","removePeer","_processRpc","_processRpcControlMessage","controlMsg","iwant","ihave","_handleIHave","_handleIWant","prune","graft","_handleGraft","_handlePrune","outRpc","createGossipRpc","_sendRpc","_processRpcMessage","msgID","msgIdStr","messageIdToString","duplicateMessage","validateMessage","graylistThreshold","rejectMessage","gossipThreshold","GossipsubMaxIHaveMessages","GossipsubMaxIHaveLength","topicID","messageIDs","iask","iwantList","addPromise","getForPeer","GossipsubGossipRetransmission","normalizeOutRpcMessage","_now","peersInMesh","addPenalty","floodCutoff","GossipsubGraftFloodThreshold","GossipsubPruneBackoff","_addBackoff","_makePrune","_doAddBackoff","acceptPXThreshold","_pxConnect","getBrokenPromises","GossipsubPruneBackoffTicks","GossipsubDirectConnectTicks","toconnect","isWritable","_connect","GossipsubPrunePeers","peerID","signedPeerRecord","envelope","openAndCertify","eid","consumePeerRecord","_directPeerInitial","GossipsubDirectConnectInitialDelay","dialProtocol","fanoutPeers","getGossipPeers","_sendGraft","meshPeers","_sendPrune","receivedFrom","deliverMessage","tosend","peersInTopic","topics","publishThreshold","_piggybackControl","_piggybackGossip","tograft","toprune","noPX","pruning","getGossipIDs","peersToGossip","topicPeers","hasGossipProtocol","factor","GossipsubGossipFactor","peerMessageIDs","_pushGossip","controlIHaveMsgs","px","xid","getRawEnvelope","MulticodecTopology","PeerStreams","SignaturePolicy","signMessage","verifySignature","PubsubBaseProtocol","globalSignaturePolicy","StrictSign","canRelayMessage","emitSelf","ensureArray","registrar","ERR_INVALID_SIGNATURE_POLICY","topicValidators","_registrarId","_onIncomingStream","_onPeerConnected","_onPeerDisconnected","topology","onConnect","onDisconnect","unregister","connection","remotePeer","idB58Str","inboundStream","attachInboundStream","_processMessages","conn","newStream","attachOutboundStream","_sendSubscriptions","rpcBytes","rpcMsg","_decodeRpc","msgs","subOpt","_processRpcSubOpt","_acceptFrom","normalizeInRpcMessage","topicSet","_emitMessage","_publish","signaturePolicy","msgId","seqno","StrictNoSign","noSignMsgId","ERR_UNHANDLED_SIGNATURE_POLICY","_encodeRpc","ERR_UNEXPECTED_FROM","ERR_UNEXPECTED_SIGNATURE","ERR_UNEXPECTED_KEY","ERR_UNEXPECTED_SEQNO","ERR_MISSING_SIGNATURE","ERR_MISSING_SEQNO","ERR_INVALID_SIGNATURE","validatorFn","randomSeqno","msgObject","outMsg","_buildMessage","Topology","multicodecTopologySymbol","_registrar","_onProtocolChange","_onPeerConnect","_updatePeers","peerDataIterable","getConnection","_onConnect","hadPeer","hasProtocol","_onDisconnect","peerData","topologySymbol","SubOpts","lp","abortable","_rawOutboundStream","_rawInboundStream","_inboundAbortController","outboundStream","isReadable","returnOnAbort","_prevStream","shouldEmit","varintDecode","int32BEEncode","int32BEDecode","minPoolSize","encodeLength","lengthEncoder","MIN_POOL_SIZE","DEFAULT_POOL_SIZE","Varint","MAX_DATA_LENGTH","ReadModes","ReadHandlers","dataLength","lengthDecoder","maxLengthLength","maxDataLength","onLength","nextChunk","fromReader","varByteSource","MAX_LENGTH_LENGTH","toAbortableSource","toMultiAbortableSource","nextAbortHandler","abortHandler","abortMessage","abortCode","aborter","isKnownAborter","toAbortableSink","toMultiAbortableSink","toMultiAbortableDuplex","anyMatch","bHas","maybeArray","SignPrefix","messagePublicKey","keyPeerId","msgIdFn","peertx","msgIDs","__exportStar","constants_1","ERR_TOPIC_VALIDATOR_IGNORE","ERR_TOPIC_VALIDATOR_REJECT","TimeCacheDuration","GossipsubIWantFollowupTime","GossipsubOpportunisticGraftPeers","GossipsubOpportunisticGraftTicks","GossipsubConnectionTimeout","GossipsubMaxPendingConnections","GossipsubConnectors","GossipsubFanoutTTL","GossipsubHeartbeatInterval","GossipsubHeartbeatInitialDelay","$oneOfFields","ControlMessage","oneofs","_control","_subscribe","_topicID","_seqno","_signature","ControlIHave","ControlIWant","ControlGraft","ControlPrune","PeerInfo","_backoff","_peerID","_signedPeerRecord","_heartbeatTimer","_heartbeat","scores","getScore","_clearBackoff","_applyIwantPenalties","_directConnect","prunePeer","graftPeer","ineed","peersArray","rotate","peersList","medianIndex","medianScore","opportunisticGraftThreshold","_emitGossip","lastpb","_sendGraftPrune","validateTopicScoreParams","validatePeerScoreParams","createTopicScoreParams","defaultTopicScoreParams","defaultPeerScoreParams","topicWeight","ERR_INVALID_PEER_SCORE_PARAMS","timeInMeshQuantum","timeInMeshWeight","timeInMeshCap","firstMessageDeliveriesWeight","firstMessageDeliveriesDecay","firstMessageDeliveriesCap","meshMessageDeliveriesWeight","meshMessageDeliveriesDecay","meshMessageDeliveriesCap","meshMessageDeliveriesThreshold","meshMessageDeliveriesWindow","meshMessageDeliveriesActivation","meshFailurePenaltyWeight","meshFailurePenaltyDecay","invalidMessageDeliveriesWeight","invalidMessageDeliveriesDecay","topicScoreCap","appSpecificScore","appSpecificWeight","IPColocationFactorWeight","IPColocationFactorThreshold","IPColocationFactorWhitelist","behaviourPenaltyWeight","behaviourPenaltyDecay","decayInterval","decayToZero","retainScore","topicScoreParams","ERR_INVALID_PEER_SCORE_THRESHOLDS","validatePeerScoreThresholds","defaultPeerScoreThresholds","__importDefault","peer_score_params_1","peer_stats_1","compute_score_1","message_deliveries_1","peer_id_1","pubsubErrors","_connectionManager","peerStats","peerIPs","deliveryRecords","MessageDeliveries","_backgroundInterval","background","_refreshScores","_updateIPs","pstats","connected","tstats","tparams","firstMessageDeliveries","meshMessageDeliveries","meshFailurePenalty","invalidMessageDeliveries","inMesh","meshTime","graftTime","meshMessageDeliveriesActive","behaviourPenalty","_removeIPs","ips","computeScore","penalty","createPeerStats","_getIPs","_setIPs","deficit","ensureTopicStats","ensureRecord","_markFirstMessageDelivery","drec","DeliveryRecordStatus","validated","_markDuplicateMessageDelivery","firstSeen","_markInvalidMessageDelivery","ignored","validatedTime","remoteAddr","toOptions","newIPs","oldIPs","addNewIPs","xip","removeOldIPs","createTopicStats","topicStats","topicParams","topicScore","p5","peersInIP","numPeersInIP","surplus","p7","denque_1","peekFront","Denque","_head","_tail","_capacity","capacity","_capacityMask","_list","_fromArray","peekAt","peekBack","_growArray","_shrinkArray","removeOne","del_count","arg_len","arguments_index","leng","_copyArray","fullCopy","newArray","msgIds","throttle","sweep","getTimeElapsed","FUNC_ERROR_TEXT","NAN","symbolTag","reTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","freeGlobal","freeSelf","objectProto","nativeMax","nativeMin","debounce","wait","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","trailing","invokeFunc","leadingEdge","timerExpired","shouldInvoke","timeSinceLastCall","trailingEdge","remainingWait","debounced","isInvoking","isObjectLike","uint8arraysConcat","uint8arraysFromString","uint8arraysEquals","Protobuf","payloadType","_marshal","signData","formatSignaturePayload","domainUint8Array","domainLength","payloadTypeLength","payloadLength","envelopeData","seal","ERR_SIGNATURE_NOT_VALID","NOT_STARTED_YET","DHT_DISABLED","CONN_ENCRYPTION_REQUIRED","PUBSUB_NOT_STARTED","DHT_NOT_STARTED","ERR_INVALID_PROTOCOLS_FOR_STREAM","ERR_CONNECTION_ENDED","ERR_CONNECTION_FAILED","ERR_NODE_NOT_STARTED","ERR_ALREADY_ABORTED","ERR_NO_VALID_ADDRESSES","ERR_RELAYED_DIAL","ERR_DIALED_SELF","ERR_DISCOVERED_SELF","ERR_DUPLICATE_TRANSPORT","ERR_ENCRYPTION_FAILED","ERR_HOP_REQUEST_FAILED","ERR_INVALID_KEY","ERR_INVALID_MESSAGE","ERR_INVALID_PARAMETERS","ERR_INVALID_PEER","ERR_MUXER_UNAVAILABLE","ERR_TIMEOUT","ERR_TRANSPORT_UNAVAILABLE","ERR_TRANSPORT_DIAL_FAILED","ERR_UNSUPPORTED_PROTOCOL","ERR_INVALID_MULTIADDR","PeerRouting","ContentRouting","getPeer","validateConfig","AddressManager","ConnectionManager","Relay","Dialer","Metrics","TransportManager","Upgrader","PeerStore","PubsubAdapter","PersistentPeerStore","Registrar","IdentifyService","IDENTIFY_PROTOCOLS","NatManager","updateSelfPeerRecord","Libp2p","persistence","addressManager","_modules","_transport","_discovery","autoDial","keychainOpts","generateOptions","localPeer","onConnection","onConnectionEnd","transportManager","faultTolerance","natManager","connEncryption","cryptos","dialer","Transport","transportOptions","streamMuxer","muxer","muxers","identifyService","handleMessage","connProtector","protector","LIBP2P_FORCE_PNET","DHT","peerRouting","contentRouting","_onDiscoveryPeer","_onStarting","_onDidStart","_isStarted","importPeer","connections","_dial","connectToPeer","getAnnounceAddrs","getAddrs","getObservedAddrs","announceFilter","addrSet","getListenAddrs","_maybeConnect","_setupPeerDiscovery","setupService","DiscoveryService","discoveryService","getTransports","discovery","storeAddresses","uniquePeers","requirePeers","setDelayedInterval","clearDelayedInterval","_peerStore","_routers","_refreshManagerOptions","refreshManager","_findClosestPeersTask","bootDelay","getClosestPeers","findPeer","maybeLimitSource","intervals","task","_runPeriodically","routers","findProviders","maxNumProviders","nVals","getPeerId","dnsaddrResolver","Constants","AGENT_VERSION","RelayConstants","publicAddressesFirst","FaultTolerance","DefaultConfig","FATAL_ALL","maxParallelDials","MAX_PARALLEL_DIALS","maxDialsPerPeer","MAX_PER_PEER_DIALS","dialTimeout","DIAL_TIMEOUT","addressSorter","randomWalk","queriesPerPeriod","keepAlive","gateway","externalIp","pmp","advertise","ADVERTISE_BOOT_DELAY","ADVERTISE_TTL","autoRelay","maxListeners","resultingOptions","dnsaddrCode","resolveTxt","Receptacle","Resolver","maxCache","_servers","newServers","servers","rrType","resolve4","resolve6","recordType","getCacheKey","_getShuffledServers","buildResource","serverResolver","Answer","TTL","toMS","lastModified","expires","refresh","oldRecord","nativeFetch","accept","METRICS","computeThrottleMaxQueueSize","computeThrottleTimeout","movingAverageIntervals","maxOldPeersRetention","libp2pVersion","PROTOCOL_VERSION","MULTICODEC_IDENTIFY","MULTICODEC_IDENTIFY_PUSH","CIRCUIT_PROTO_CODE","HOP_METADATA_KEY","HOP_METADATA_VALUE","RELAY_RENDEZVOUS_NS","addressesPublicFirstCompareFunction","isAPrivate","isBPrivate","isCertified","isIpPrivate","nodeAddress","Netmask","ip_regex","NETMASK_RANGES","ip_range","ip_addr","ipv6_check","ipv4_check","atob","chr","chr0","chrA","chra","ip2long","long2ip","dmax","maskLong","error1","bitmask","netLong","hostmask","broadcast","lastLong","pSettle","FAULT_TOLERANCE","_transports","_listenerOptions","listenerOptions","transportForMultiaddr","dial","couldNotListen","supportedAddrs","createListener","isFulfilled","NO_FATAL","pReflect","pLimit","isRejected","pTry","activeCount","pendingCount","clearQueue","arguments_","PeerRecord","peerRecord","arrayEquals","ENVELOPE_DOMAIN_PEER_RECORD","ENVELOPE_PAYLOAD_TYPE_PEER_RECORD","DOMAIN","AddressInfo","LIBP2P_PEER_RECORD","decapsulate","LatencyMonitor","maxData","maxSentData","maxReceivedData","maxEventLoopDelay","pollInterval","autoDialInterval","movingAverageInterval","defaultPeerValue","_peerValues","_autoDialTimeout","_checkMetrics","_autoDial","_latencyMonitor","latencyCheckIntervalMs","dataEmitIntervalMs","accumulator","_onLatencyMeasure","connectionList","received","_checkMaxLimit","sent","peerIdStr","storedConn","summary","avgMs","_maybeDisconnectOne","peerValues","disconnectPeer","VisibilityChangeEmitter","asyncTestFn","latencyRandomPercentage","_latecyCheckMultiply","_latecyCheckSubtract","getDeltaMS","startTime","_latencyData","_initLatencyData","_visibilityChangeEmitter","pageInFocus","_startTimers","_emitSummary","_stopTimers","isVisible","_checkLatencyID","_checkLatency","_emitIntervalID","getSummary","latency","minMs","maxMs","totalMs","POSITIVE_INFINITY","lengthMs","randomness","localData","deltaOffset","deltaMS","NEGATIVE_INFINITY","_initializeVisibilityVarNames","_addVisibilityChangeListener","visibilityChange","mozHidden","msHidden","webkitHidden","_hidden","_visibilityChange","_handleVisibilityChange","visible","_triggered","_timerWrapper","_schedule","CircuitRelay","CircuitPB","toConnection","handleCanHop","handleHop","handleStop","StreamHandler","transportSymbol","_dialer","_upgrader","_onProtocol","streamHandler","circuit","virtualConnection","CAN_HOP","HOP","STOP","dstPeer","localAddr","srcPeer","maConn","upgradeInbound","relayAddr","destinationAddr","relayId","destinationId","relayPeer","destinationPeer","disconnectOnFailure","relayConnection","encapsulate","upgradeOutbound","Peer","Status","timeline","listeningAddrs","relayConn","relayedAddr","validateAddrs","STATUS","HOP_CANT_SPEAK_RELAY","destinationConnection","HOP_NO_CONN_TO_DST","stopRequest","destinationStream","SUCCESS","sourceStream","canHop","writeResponse","HOP_DST_MULTIADDR_INVALID","STOP_DST_MULTIADDR_INVALID","HOP_SRC_MULTIADDR_INVALID","STOP_SRC_MULTIADDR_INVALID","handshake","shake","sourcePromise","sinkErr","sinkPromise","AutoRelay","namespaceToCid","_autoRelay","_advertiseService","_transportManager","_addressSorter","_listenRelays","_onError","_addListenRelay","_removeListenRelay","remoteAddrs","listenAddr","_listenOnAvailableHopRelays","peersToIgnore","knownHopsToDial","metadataMap","supportsHop","_tryToListenOnRelay","provider","DialRequest","_pendingDials","_pendingDialTargets","pendingTarget","dialTarget","_createCancellableDialTarget","pendingDial","_createPendingDial","cancellablePromise","_createDialTarget","knownAddrs","ra","dialRequest","dialAction","timeoutController","resolvedMultiaddrs","_resolveRecord","nm","newM","pAny","getTokens","tokenHolder","dialAbortControllers","completedDials","releaseToken","Fifo","_waitingConsumers","nextConsumer","pSome","PCancelable","anyCancelable","onCancel","FilterError","elementCount","isSettled","completed","cancelPending","indentString","cleanStack","_errors","includeEmptyLines","extractPathRegex","pathRegex","homeDir","homedir","pretty","pathMatches","CancelError","isCanceled","userFn","executor","_cancelHandlers","_isPending","_isCanceled","_rejectOnCancel","_promise","_reject","shouldReject","onFulfilled","onRejected","sanitize","CMS","infoPrefix","privates","NIST","iterationCount","validateKeyName","throwDelayed","DsName","DsInfoName","cms","dsname","keyInfo","oldDsname","newDsname","oldInfoName","newInfoName","oldPass","newPass","oldDek","newDek","keyAsPEM","illegalRe","controlRe","reservedRe","windowsReservedRe","windowsTrailingRe","sanitized","isHighSurrogate","isLowSurrogate","charLength","curByteLength","prevCodePoint","certificateForKey","findAsync","plain","_getPrivateKey","pkcs7","createEnvelopedData","addRecipient","toAsn1","cmsData","messageFromAsn1","recipients","issuer","shortName","recipient","keyId","findKeyById","missingKeys","_recipientFromAsn1","recipientInfoValidator","RDNAttributesAsArray","serialNumber","serial","encryptedContent","encAlgorithm","encParameter","encKey","_recipientsToAsn1","distinguishedNameToAsn1","_signerToAsn1","authenticatedAttributesAsn1","signatureAlgorithm","unauthenticatedAttributes","attrsAsn1","_attributeToAsn1","messageDigest","signingTime","jan_1_1950","jan_1_2050","_fromAsn1","rawCapture","_decryptContent","ciph","messageFromPem","messageToPem","pemObj","contentInfoValidator","envelopedData","createEncryptedData","signedData","createSignedData","fromAsn1","certificates","crls","signers","digestAlgorithmIdentifiers","contentInfo","signerInfos","signedDataValidator","certs","certificateFromAsn1","certificateToAsn1","addSigner","signer","cert","certificateFromPem","authenticatedAttributes","detached","detachedContent","mds","ai","_signersToAsn1","addSignerInfos","addDigestAlgorithmIds","addCertificate","addCertificateRevokationList","crl","encryptedDataValidator","envelopedDataValidator","infos","_recipientsFromAsn1","recipientInfos","findRecipient","sAttr","rAttr","desCBC","ciphFn","p7v","pkcs7asn1","encryptedContentInfoValidator","signerValidator","_shortNames","x509CertificateValidator","rsassaPssParameterValidator","certificationRequestInfoValidator","certificationRequestValidator","_getAttribute","rdn","si","valueTagClass","CRIAttributesAsArray","extensionRequest","extensions","certificateExtensionFromAsn1","_readSignatureParameters","fillDefaults","algorithmOid","hashOid","maskGenOid","maskGenHashOid","_dnToAsn1","_fillMissingFields","attribute","valueConstructed","certificateExtensionToAsn1","_fillMissingExtensionFields","digitalSignature","nonRepudiation","keyEncipherment","dataEncipherment","keyAgreement","keyCertSign","cRLSign","encipherOnly","decipherOnly","cA","pathLenConstraint","client","email","objsign","reserved","sslCA","emailCA","objCA","altNames","altName","ski","generateSubjectKeyIdentifier","subjectKeyIdentifier","keyIdentifier","authorityCertIssuer","subSeq","fullNameGeneralNames","_signatureParametersToAsn1","_CRIAttributesToAsn1","csr","computeHash","certificateToPem","publicKeyToPem","publicKeyToRSAPublicKeyPem","getPublicKeyFingerprint","certificationRequestFromPem","certificationRequestFromAsn1","certificationRequestToPem","certificationRequestToAsn1","createCertificate","signatureOid","siginfo","notBefore","notAfter","getField","sn","addField","subject","setSubject","uniqueId","setIssuer","setExtensions","exts","getExtension","getTBSCertificate","issued","expectedIssuer","actualIssuer","sha1WithRSAEncryption","signatureParameters","pss","isIssuer","iattr","sattr","verifySubjectKeyIdentifier","certVersion","certSerialNumber","certSignatureOid","certSignatureParams","certinfoSignatureOid","certinfoSignatureParams","certSignature","certValidity1UTCTime","certValidity2GeneralizedTime","certValidity3UTCTime","certValidity4GeneralizedTime","imd","certIssuer","certIssuerUniqueId","smd","certSubject","certSubjectUniqueId","certExtensions","certificateExtensionsFromAsn1","extseq","critical","gn","createCertificationRequest","csrVersion","csrSignatureOid","csrSignatureParams","csrSignature","certificationRequestInfo","certificationRequestInfoSubject","addAttribute","certificationRequestInfoAttributes","setAttributes","getCertificationRequestInfo","cri","_dateToAsn1","tbs","certificateExtensionsToAsn1","dn","createCaStore","caStore","getBySubject","ensureSubjectHasHash","getIssuer","hasCertificate","der1","listAllCertificates","certList","removeCertificate","certificateError","bad_certificate","unsupported_certificate","certificate_revoked","certificate_expired","certificate_unknown","unknown_ca","verifyCertificateChain","validityCheckDate","selfSigned","verified","se","keyUsage","basicConstraints","bcExt","keyUsageExt","vfd","maskLen","sLen","salt_","pssobj","modBits","emBits","emLen","mHash","m_","checkLen","getFullYear","serverAuth","clientAuth","codeSigning","emailProtection","timeStamping","asyncCompare","oldPeerLRU","Stats","initialCounters","directionToEvent","in","_globalStats","_peerStats","_protocolStats","_oldPeers","_running","onPeerDisconnected","idString","protocolStats","placeholderStats","peerIdString","existingStats","mergedStats","mergeStats","_source","_sink","LRU","Big","MovingAverage","_stats","_frequencyLastTime","_frequencyAccumulators","_movingAverages","_resetComputeTimeout","counters","inc","_nextTimeout","urgency","_applyOp","_updateFrequency","latestTime","timeDiff","_updateFrequencyFor","timeDiffMS","hz","timespan","previousTime","deviation","forecast","Multistream","Connection","mutableProxy","encryptedConn","upgradedConn","Muxer","cryptoProtocol","setPeer","proxyPeer","setTarget","trackStream","protectedConn","protect","_encryptInbound","_multiplexInbound","updatePlaceholder","_createConnection","remotePeerId","_encryptOutbound","_multiplexOutbound","onStream","mss","Listener","muxedStream","addStream","_onStream","onStreamEnd","removeStream","_timeline","upgraded","errConnectionNotMultiplexed","multiplexer","encryption","getStreams","secureInbound","secureOutbound","PROTOCOL_ID","MultistreamSelect","_stream","_shaken","_handshake","multistream","protocolId","shakeStream","writeAll","NewLine","protocolsReader","OPEN","CLOSING","CLOSED","connectionSymbol","validateArgs","_stat","_newStream","_getStreams","_closing","_toConsumableArray","arr2","defaultTarget","mutableHandler","mutableTarget","setHandler","getHandler","AddressBook","KeyBook","MetadataBook","ProtoBook","storedPeers","peersData","addressesDeleted","keyDeleted","protocolsDeleted","metadataDeleted","Book","eventProperty","eventTransformer","storedRecord","_toAddresses","_setData","newAddr","_ps","passthrough","b58key","_emit","rec","_setValue","recMap","recSet","newSet","PubsubRouter","_subscribeAdapter","_unsubscribeAdapter","NAMESPACE_ADDRESS","NAMESPACE_COMMON","NAMESPACE_KEYS","NAMESPACE_METADATA","NAMESPACE_PROTOCOL","_dirtyPeers","_dirtyMetadata","_addDirtyPeer","_addDirtyPeerKey","_addDirtyPeerMetadata","_processDatastoreEntry","_commitData","peerIdstr","hasInlinePublicKey","mData","commitPeers","_batchAddressBook","_batchKeyBook","_batchMetadataBook","_batchProtoBook","b32key","encodedData","certifiedRecord","dirtyMetada","dirtyKey","dirtyValue","keyParts","Address","CertifiedRecord","topologies","_handle","isTopology","PROTOCOL","PING_LENGTH","unhandle","toList","_host","identify","pushToPeerStore","listenAddrs","pushes","Identify","observedAddr","cleanObservedAddr","getCleanMultiaddr","_handleIdentify","_handlePush","IDENTIFY","IDENTIFY_PUSH","Messsage","NatAPI","retry","isPrivateIp","isLoopback","DEFAULT_TTL","highPort","_addressManager","_enabled","_externalIp","autoUpdate","enablePMP","_start","isThinWaistAddress","_getClient","publicIp","publicPort","privatePort","addObservedAddr","fromNodeAddress","_client","onFailedAttempt","customArgumentsToken","argumentNames","ES6Promise","_len2","_key2","networkErrorMsgs","originalError","pRetry","attempt","attemptNumber","errorMessage","retriesLeft","decorateErrorWithCounts","mainError","RetryOperation","timeouts","forever","maxRetryTime","minTimeout","maxTimeout","randomize","createTimeout","_originalTimeouts","_timeouts","_maxRetryTime","_fn","_attempts","_operationTimeout","_operationTimeoutCb","_operationStart","_cachedTimeouts","currentTime","timeoutOps","attempts","counts","mainErrorCount","isLoopbackAddr","WS","Multiplex","NOISE","KadDHT","GossipSub","ipnsUtils","connect","pDefer","socket","cOpts","errorPromise","errfn","rawSocket","dnsWss","WebSocket","wsurl","websocket","remoteAddress","binaryType","EventIterator","connError","cleanUp","cont","onOpen","event_iterator_1","evOptions","EventQueue","pullQueue","pushQueue","eventHandlers","isStopped","resolution","highWater","rejection","removeCallback","lowWaterMark","lowWater","closeOnEnd","wasClean","handleOpen","handleErr","CLOSE_TIMEOUT","toMultiaddr","localAddress","localPort","remotePort","CODE_P2P","CODE_CIRCUIT","CODE_TCP","CODE_WS","CODE_WSS","Address4","Address6","ERR_INVALID_IP_PARAMETER","ERR_INVALID_PORT_PARAMETER","ERR_INVALID_IP","is4","to4","correctForm","ipv4_1","ipv6_1","address_error_1","jsbn_1","sprintf_js_1","groups","GROUPS","parsedAddress","parsedSubnet","subnet","subnetMask","isCorrect","isInSubnet","RE_SUBNET_STRING","AddressError","addressMinusSuffix","RE_ADDRESS","fromInteger","sprintf","toGroup6","bigInteger","_startAddress","startAddress","fromBigInteger","startAddressExclusive","adjust","_endAddress","endAddress","endAddressExclusive","getBitsBase2","binaryZeroPad","isMulticast","groupForV6","defaultBits","extendStatics","__extends","__","parseMessage","inBrowser","rng_state","rng_pool","rng_pptr","rng_seed_time","rng_psize","ua","appVersion","rng_get_byte","Arcfour","SecureRandom","ba","not_string","not_bool","not_type","not_primitive","numeric_arg","not_json","key_access","index_access","sprintf_format","sprintf_parse","vsprintf","fmt","parse_tree","pad_character","pad_length","is_positive","tree_length","param_no","pad_char","sprintf_cache","_fmt","arg_names","field_list","replacement_field","field_match","__spreadArrays","il","jl","constants4","constants6","regular_expressions_1","spanLeadingZeroes4","paddedHex","unsignByte","optionalGroups","zone","RE_ZONE_STRING","fromURL","RE_URL_WITH_PORT","RE_URL","fromAddress4","address4","mask6","fromArpa","arpaFormAddress","insertIndex","microsoftTranscription","possibleSubnets","subnetSize","subnetPowers","addCommas","getScope","SCOPES","getBits","_i","TYPES","getBitsBase16","getBitsPastSubnet","reverseForm","characters","reversed","canonicalForm","omitSuffix","zeroCounter","zeroLengths","correct","parse4in6","parsedAddress4","badCharacters","RE_BAD_CHARACTERS","badAddress","RE_BAD_ADDRESS","halves","elidedGroups","elisionBegin","elisionEnd","to4in6","infix","inspectTeredo","udpPort","server4","client4","flagsBase2","coneNat","groupIndividual","universalLocal","microsoft","inspect6to4","to6to4","toUnsignedByteArray","fromUnsignedByteArray","BYTE_MAX","isCanonical","isLinkLocal","isTeredo","is6to4","optionalPort","formFunction","simpleGroup","regularExpressionString","substringSearch","address6","simpleRegularExpression","possibleElisions","ADDRESS_BOUNDARY","regularExpression","ff01::1/128","ff01::2/128","ff02::1/128","ff02::2/128","ff05::2/128","ff02::5/128","ff02::6/128","ff02::9/128","ff02::a/128","ff02::d/128","ff02::16/128","ff01::fb/128","ff02::fb/128","ff05::fb/128","ff02::1:2/128","ff05::1:2/128","ff02::1:3/128","ff05::1:3/128","::/128","::1/128","ff00::/8","fe80::/10","spanLeadingZeroes","spanAll","spanAllZeroes","spanLeadingZeroesSimple","addressString","padGroup","groupPossibilities","possibilities","zeroIndexes","zeroIndex","elision","moreLeft","moreRight","cancelablePromise","customTimers","testMa","decapsulateCode","dnsWsOrWss","SimplePeer","supportsWebRTCDataChannels","webrtcSupport","cleanMultiaddr","cleanUrlSIO","sioOptions","transports","force new connection","wrtc","sigReferences","_peerDiscovered","rawConn","spOptions","initiator","intentId","sio","sioClient","channel","onTimeout","srcMultiaddr","signallingAddr","dstMultiaddr","offer","answer","maStr","getBrowserRTC","randombytes","MAX_BUFFERED_AMOUNT","filterTrickle","sdp","_debug","channelName","channelConfig","negotiated","offerOptions","answerOptions","sdpTransform","allowHalfTrickle","iceCompleteTimeout","_connected","remoteFamily","localFamily","_wrtc","_pcReady","_channelReady","_iceComplete","_iceCompleteTimer","_channel","_pendingCandidates","_isNegotiating","_batchedNegotiation","_queuedNegotiation","_sendersAwaitingStable","_senderMap","_firstStable","_closingInterval","_remoteTracks","_remoteStreams","_chunk","_cb","_pc","_isReactNativeWebrtc","_peerConnectionId","oniceconnectionstatechange","_onIceStateChange","onicegatheringstatechange","onconnectionstatechange","_onConnectionStateChange","onsignalingstatechange","_onSignalingStateChange","onicecandidate","_onIceCandidate","_setupData","createDataChannel","ondatachannel","ontrack","_onTrack","_needsNegotiation","_onFinishBound","_onFinish","bufferSize","bufferedAmount","renegotiate","transceiverRequest","addTransceiver","remoteDescription","_addIceCandidate","setRemoteDescription","_createAnswer","iceCandidateObj","RTCIceCandidate","addIceCandidate","getTracks","addTrack","submap","sender","oldTrack","newTrack","replaceTrack","removeTrack","negotiate","_createOffer","onmessage","onopen","bufferedAmountLowThreshold","_onChannelMessage","onbufferedamountlow","_onChannelBufferedAmountLow","_onChannelOpen","_onChannelClose","isClosing","destroySoon","createOffer","sendOffer","localDescription","setLocalDescription","getTransceivers","transceiver","createAnswer","sendAnswer","_requestMissingTransceivers","connectionState","iceConnectionState","iceGatheringState","_maybeReady","flattenValues","report","getStats","reports","_connecting","findCandidatePair","remoteCandidates","localCandidates","candidatePairs","foundSelectedCandidatePair","setSelectedCandidatePair","selectedCandidatePair","localCandidateId","ipAddress","portNumber","googLocalAddress","remoteCandidateId","googRemoteAddress","selectedCandidatePairId","googActiveConnection","signalingState","sdpMLineIndex","sdpMid","_startIceCompleteTimeout","eventStream","remoteStream","WEBRTC_SUPPORT","iceServers","urls","sdpSemantics","RTCPeerConnection","mozRTCPeerConnection","webkitRTCPeerConnection","RTCSessionDescription","mozRTCSessionDescription","webkitRTCSessionDescription","mozRTCIceCandidate","webkitRTCIceCandidate","supportsFileReader","supportsWebRTC","mediaDevices","listeningAddr","signallingUrl","__connections","__spChannels","__pendingIntents","pendings","pendingOffer","untrackConn","trackConn","Socket","Manager","url_1","manager_1","socket_1","managers","sameNamespace","forceNew","multiplex","queryKey","socket_io_parser_1","manager_2","parseuri","authority","ipv6uri","pathNames","regx","$0","$2","eio","Emitter","on_1","Backoff","nsps","reconnection","reconnectionAttempts","reconnectionDelay","reconnectionDelayMax","randomizationFactor","jitter","_readyState","_parser","_autoConnect","autoConnect","_reconnection","_reconnectionAttempts","_reconnectionDelay","setMin","_randomizationFactor","setJitter","_reconnectionDelayMax","setMax","_reconnecting","reconnect","engine","skipReconnect","openSubDestroy","errorSub","maybeReconnectOnOpen","onping","ondecoded","packet","nsp","encodedPackets","subDestroy","onreconnect","parseqs","secure","writeBuffer","prevBufferLen","agent","withCredentials","jsonp","timestampParam","rememberUpgrade","rejectUnauthorized","perMessageDeflate","upgrades","pingInterval","pingTimeout","pingTimeoutTimer","EIO","sid","priorWebsocketSuccess","createTransport","setTransport","onDrain","onPacket","onClose","probe","onTransportOpen","onlyBinaryUpgrades","upgradeLosesBinary","supportsBinary","upgrading","freezeTransport","onTransportClose","onupgrade","onHandshake","resetPingTimeout","sendPacket","filterUpgrades","compress","cleanupAndClose","waitForUpgrade","pingIntervalTimer","filteredUpgrades","XHR","JSONP","polling","xhr","xd","isSSL","xdomain","xscheme","forceJSONP","hasCORS","enablesXDR","XDomainRequest","Polling","pick","hasXHR2","extraHeaders","setDisableHeaderCheck","requestTimeout","hasXDR","onLoad","responseText","onreadystatechange","requestsCount","onSuccess","fromError","attachEvent","unloadHandler","forceBase64","pollXhr","yeast","onPause","doPoll","decodePayload","packets","encodePayload","schema","timestampRequests","doOpen","doClose","decodePacket","encodePacket","SEPARATOR","encodedPacket","encodedPayload","decodedPacket","PACKET_TYPES","withNativeBlob","withNativeArrayBuffer","encodeBlobAsBase64","fileReader","readAsDataURL","PACKET_TYPES_REVERSE","ERROR_PACKET","base64decoder","decodeBase64Packet","mapBinary","chars","arraybuffer","encoded1","encoded2","encoded3","encoded4","bufferLength","_callbacks","hasListeners","qry","rNewline","rEscapedNewline","___eio","form","iframe","insertAt","getElementsByTagName","area","iframeId","complete","initIframe","action","submit","usingBrowserWebSocket","defaultBinaryType","addEventListeners","MozWebSocket","RESERVED_EVENTS","connect_error","disconnecting","receiveBuffer","sendBuffer","acks","disconnected","onpacket","subEvents","PacketType","EVENT","isTransportWritable","volatile","_packet","CONNECT","onconnect","BINARY_EVENT","onevent","ACK","BINARY_ACK","onack","DISCONNECT","ondisconnect","CONNECT_ERROR","ack","emitEvent","_anyListeners","emitBuffered","binary_1","is_binary_1","hasBinary","encodeAsString","encodeAsBinary","attachments","deconstruction","deconstructPacket","decodeString","reconstructor","BinaryReconstructor","takeBinaryData","isPayloadValid","finishedReconstruction","reconPack","binData","reconstructPacket","_deconstructPacket","_placeholder","_reconstructPacket","packetData","withNativeFile","toIterable","toWebrtcMultiaddr","maybeEndSource","closeCb","closeHandler","finishCb","finishHandler","drainHandler","toDuplex","toSink","toSource","maStrSplit","tcpProto","wsProto","tcpPort","isName","tuppleIPFS","Coder","restrictSize","MessageTypes","MessageTypeNames","createStream","Mplex","_streamId","_streams","initiators","receivers","_createSink","_createSource","maxMsgSize","_handleIncoming","NEW_STREAM","_newReceiverStream","MESSAGE_INITIATOR","MESSAGE_RECEIVER","CLOSE_INITIATOR","CLOSE_RECEIVER","RESET_INITIATOR","RESET_RECEIVER","POOL_SIZE","_pool","_poolOffset","_bufferProxy","_headerInfo","_decodeHeader","MAX_MSG_SIZE","checkSize","InitiatorMessageTypes","MESSAGE","CLOSE","RESET","ReceiverMessageTypes","ERR_MPLEX_STREAM_RESET","resetController","Types","externalId","endErr","sourceEnded","sinkEnded","onSinkEnd","noise_1","Noise","x25519_1","buffer_1","it_pb_rpc_1","duplex_1","it_buffer_1","it_pipe_1","it_length_prefixed_1","handshake_xx_1","handshake_ik_1","handshake_xx_fallback_1","encoder_1","crypto_1","keycache_1","logger_1","staticNoiseKey","earlyData","prologue","useNoisePipes","staticKeys","generateKeypair","wrappedConnection","uint16BEEncode","uint16BEDecode","NOISE_MSG_MAX_LENGTH_BYTES","performHandshake","isInitiator","createSecureConnection","remoteEarlyData","getPayload","tryIK","KeyCache","performXXHandshake","ikHandshake","IKHandshake","performIKHandshake","ephemeralKeys","getLocalEphemeralKeys","performXXFallbackHandshake","initialMsg","XXFallbackHandshake","propose","exchange","logger","XXHandshake","getRemoteStaticKey","stage0","stage1","user","encryptStream","decryptStream","_pre","_curve","_edwards","native","fieldSize","fieldBits","privateKeyGenerate","scalarSize","privateKeyExport","publicKeyExport","privateKeyImport","encodeScalar","decodeClamped","mulBlind","pointFromEdwards","toX","pointFromMont","publicKeyFromUniform","decodeUniform","pointFromUniform","publicKeyToUniform","randomInt","pointToUniform","encodeUniform","publicKeyFromHash","pake","pointFromHash","publicKeyToHash","subgroup","pointToHash","decodeX","publicKeyIsSmall","isSmall","publicKeyHasTorsion","hasTorsion","encodeField","publicKeyImport","p251","p448","HAS_BIGINT","_iadd","_alloc","enforce","_isub","isSMI","_isubn","_normalize","_mul","toBigInt","mulShift","utestn","_div","nonzero","as","quon","remn","countBits","QUO","quo","quorem","iquo","iquon","irem","iremn","remrn","imodn","ipow","ipown","pown","_rootrem","ucmpn","rootrem","iroot","isPower","sqrtrem","isqrt","isSquare","iandn","andn","andrn","iuandn","uandn","uandrn","iorn","orn","iuorn","uorn","ixorn","xorn","iuxorn","uxorn","inot","ishl","iushl","ushl","_split","ishr","shr","iushr","ushr","usetn","iumaskn","umaskn","isPos","legendre","redLegendre","jacobi","_cloneNormal","_makeOdd","bmod8","kronecker","igcd","_factor2","ilcm","lcm","iinvert","_invertp","ifermat","fermat","redFermat","ipowm","powm","ipowmn","powmn","redPown","isqrtm","sqrtm","isqrtpq","sqrtpq","sq","mq","isPrime","reps","isPrimeMR","isPrimeLucas","force2","nm1","nm3","rnm1","vk","vk1","redIAddn","redAddn","redISubn","redSubn","redIMuln","redMuln","redIDiv","redDiv","redIDivn","redDivn","redIPow","nonred","redIPown","redISqrt","redIDivSqrt","idivsqrt","redDivSqrt","divsqrt","redIsSquare","redIShl","redIShln","redShln","redINeg","redEq","redEqn","redIsHigh","isHigh","redIsLow","isLow","redIsOdd","redIsEven","redJacobi","redKronecker","redIInvert","redInvert","redIFermat","_check","fromBuffer","isSafe","toDouble","s52","s26","toBool","of","fromDouble","fromBigInt","_fromHex","fromBool","_fromBase","parseHex","fromBN","P521","P251","P448","cast","randomBits","pm2","Prime34","pm3d4","pp1d4","SquareRootError","u3","u5","v3","Prime58","sm1","pm5d8","pp3d8","v7","Prime116","powS","powE","sqrn","sqrnmul","x6","x12","x24","x30","x31","x62","x124","x127","r0","x16","x32","x128","x48","x96","x120","x126","x7","x256","x512","x9","x22","x44","x88","x176","x220","x223","r3","r4","r5","r6","x192","x240","x246","x5","x10","x20","x40","x50","x100","x200","x222","intTo","intFrom","powInt","powNum","WND_WIDTH","sqrt3mod4","sqrt5mod8sm1","sqrt5mod8","sqrt0","divsqrt3mod4","divsqrt5mod8","invertAll","elems","invs","_shift","rib","makeError","jsfIndex","Curve","ossl","adjustedSize","signBit","scalarBits","three","four","i2","i3","i6","torsion","_scale","memoize","isIsomorphic","isIsogenous","_finalize","_findTorsion","_fixedMul","windows","_getWindows","steps","getFixedNAF","_safeNAF","coeff","ppoint","pcoeff","_getNAF","_getJNAF","getJNAF","nafw","_scaleShort","_scaleMont","_scaleEdwards","isElliptic","jinv","isComplete","field","xpoint","cpoint","xz","solveX2","solveX","solveY2","solveY","pointFromShort","p3","mulH","p0","randomField","randomScalar","randomPoint","mulAll","jmulAll","imulH","normalizeAll","scale","affinizeAll","msb","splitHash","decodeField","encodeAdjusted","decodeAdjusted","decodeScalar","encodeClamped","clamped","encodeX","decodeEven","decodeSquare","toShort","toMont","toEdwards","pointToJSON","NAF","odds","wnds","Windows","dbls","Doubles","_getBlinding","blinding","unblind","Blinding","_hasWindows","_blind","Precomp","diffAddDbl","isOrder2","eqX","eqR","jmulH","jmul","order","jmuln","jmulBlind","jdiv","jdivn","divH","jdivH","ShortPoint","pmodn","highOrder","smallGap","Endo","curveA","curveB","customB","uncube","customA","u4","u6","_short","_isomorphism","_mont","_findRS","_scale0","_scale1","bi","d5","dma","d5a","da5","ypz","ymz","l1","_getEndoPrecomp","rl","rl1","tl1","rl2","tl2","_egcdSqrt","Vector","sqrtn","_endoBeta","_sswu","bza","_sswui","a2x2","abx2","axb","_svdwf","gz","u2t1","y3","_svdw","_svdwi","z4","gz2","x2z","xz2","n3","cubeRoots","coords","ad6","MontPoint","EdwardsPoint","wrapErrors","xb","toPretty","z6","_mixedAdd","_add","_addJA","_addJJ","z1z1","z2z2","hhh","_dbl0","_dbl3","_dblJ","xmdelta","xpdelta","gamma28","zz1","zz2","zzz1","zzz2","inf1","inf2","rn","wa","wb","_solveY0","_elligator2","_invert2","XPoint","nv","uu","uz","vz","ax2","z5","smi","oneA","smallD","curveD","d3","ad14","a2d","ad2","apd","_mulD","_elligator1","ci","ci2","cm1","f0","X1","rX","X12","_invert1","nn","nr1","X2","tz","_alt","ad","amd4","dxy","xy","d24","_addM1","_addA","P256","P384","SECP256K1","BRAINPOOLP256","BRAINPOOLP384","BRAINPOOLP512","X25519","X448","MONT448","ED25519","ISO448","ED448","mod9","cubeRoot","HAS_CRYPTO","randomValues","poolPos","randomRange","Shake","lpReader","isDone","readLP","readPB","writeLP","writePB","Pair","onSource","xx_1","staticKeypair","XX","session","initSession","logLocalStaticKeys","hs","messageBuffer","sendMessage","encode0","logLocalEphemeralKeys","receivedMessageBuffer","decode0","recvMessage","logRemoteEphemeralKey","decode1","logRemoteStaticKey","decodedPayload","getPeerIdFromPayload","verifySignedPayload","setRemoteEarlyData","encode1","encode2","decode2","logCipherState","getCS","encryptWithAd","decryptWithAd","cs1","cs2","abstract_handshake_1","AbstractHandshake","psk","initializeSymmetric","mixHash","encryptAndHash","mixKey","spk","createEmptyKey","isValidPublicKey","decryptAndHash","valid1","valid2","initializeInitiator","initializeResponder","ephemeral","writeMessageA","writeMessageB","resultingBuffer","writeMessageC","writeMessageRegular","readMessageA","readMessageB","resultingPlaintext","resultingValid","readMessageC","hkdf_1","sha256_1","libp2p_crypto_1","payload_1","equals_1","NoiseHandshakePayloadProto","NoiseHandshakePayload","createHandshakePayload","libp2pPublicKey","signedPayload","payloadInit","identityKey","identitySig","signPayload","getHandshakePayload","staticPublicKey","earlyDataPayload","noiseStaticKey","publicKeyProtobuf","generatedPeerId","isValidPeerId","generatedPayload","getHkdf","ikm","prk","extract","okm","mac","HMAC","DESC","FINALIZED","want","writeU32","Sigma1","Sigma0","Maj","encodeDelimited","decodeDelimited","aead_1","MIN_NONCE","setNonce","incrementNonce","isEmptyKey","nonceToBytes","aad","derived","getHash","tempK","initializeKey","protocolName","protocolNameBytes","hashProtocolName","tempk1","tempk2","ChaCha20","Poly1305","zero16","AEAD","chacha","poly","aadLen","cipherLen","_pad16","writeU64","aead","BIG_ENDIAN","readU32","qround","leftover","readU16","_blocks","hibit","writeU16","debug_1","keyLogger","DUMP_SESSION_KEYS","NOISE_MSG_MAX_LENGTH_BYTES_WITHOUT_TAG","ik_1","errors_1","remoteStaticKey","IK","receivedMsg","FailedIKError","chunkBuffer","libp2pRecord","RoutingTable","contentFetching","Providers","RandomWalk","QueryManager","protocolPrefix","forceProtocolLegacy","ALPHA","onPut","onRemove","PROTOCOL_DHT","_clientMode","disjointPaths","routingTable","providers","_log","_queryManager","nvals","bufferToKey","convertBuffer","closestPeers","_nearestPeersToQuery","closer","_isSelf","isEqual","rawRecord","MAX_RECORD_AGE","PUT_VALUE","sendRequest","_getValueSingle","closerPeers","_verifyRecordOnline","GET_VALUE","KBucket","_onPing","_onInit","selfKey","convertPeerId","localNodeId","numberOfNodesPerKBucket","numberOfNodesToPing","oldContacts","newContact","oldest","closest","closestPeer","array1","array2","ensureInt8","distance","arbiter","contacts","dontSplit","incumbent","vectorClock","firstId","secondId","contact","bitIndex","_determineNode","_indexOf","detNode","bytesDescribedByBitIndex","bitIndexWithinByte","pMap","keyForPublicKey","isPublicKeyKey","fromPublicKeyKey","decodeBase32","sortClosestPeers","xorCompare","pathSize","resultsWanted","numPaths","createPutRecord","subsystem","asyncFn","mapParallel","dist","stopOnError","isIterableDone","resolvingCount","PROVIDERS_KEY_PREFIX","PROVIDERS_LRU_CACHE_SIZE","PROVIDERS_VALIDITY","PROVIDERS_CLEANUP_INTERVAL","READ_MESSAGE_TIMEOUT","GET_MANY_RECORD_COUNT","defaultRandomWalk","readMessageTimeout","_rpc","isConnected","_writeReadMessage","_writeMessage","writeReadMessage","getMessageHandler","desMessage","Proto","MESSAGE_TYPE","MessageType","CONNECTION_TYPE","ConnectionType","_clusterLevelRaw","providerPeers","clusterLevel","clusterLevelRaw","toPbPeer","fromPbPeer","CONNECTED","CONNECTION_TYPES","author","FIND_NODE","ADD_PROVIDER","GET_PROVIDERS","PING","idFromKey","_checkLocalDatastore","_betterPeersToQuery","_verifyRecordLocally","recordKey","addProvider","getProviders","Query","putLocal","_putLocal","counterAll","counterSuccess","_putValueToPeer","minPeers","recs","best","fixupRec","sendCorrectionRecord","localRec","getLocal","rtp","valsLength","pathIndex","queryResults","lookupErr","_getValueOrPeers","pathComplete","Run","makePath","running","_onStart","_onComplete","finalSet","_run","execute","_startTime","queryStarted","peersSeen","queryCompleted","PeerDistanceList","WorkerQueue","peersQueried","addInitialPeer","executePaths","queryComplete","startWorker","peersQueriedPromise","dhtKey","queuedPeerIds","anyCloser","originDhtKey","peerDistances","pd","peerIds","dhtKeys","furthestDistance","keyDistance","PeerQueue","queryFunc","initialPeers","peersToQuery","fromKey","addPeerToQuery","workerQueue","Heap","keyBuffer","defaultCmp","heapify","heappop","heappush","heappushpop","heapreplace","insort","nlargest","nsmallest","updateItem","_siftdown","_siftup","lastelt","returnitem","_ref1","_results","_results1","_j","los","startpos","newitem","parentpos","childpos","endpos","rightpos","pushpop","setupQueue","execution","execPromise","processNext","continueQuerying","continueQueryingError","execError","execQuery","queryError","queryCloser","LimitedPeerList","providerTimeout","pData","pathProviders","findProvidersSingle","provs","prov","PeerList","getPublicKeyFromNode","getValueSingle","recPeer","findPeerLocal","_findPeerSingle","tablePeers","closerPeersSingle","sorted","pId","makeProviderKey","parseProviderKey","readTime","cacheSize","cleanupInterval","provideValidity","lruCacheSize","syncQueue","_cleaner","_cleanup","deleted","expired","cacheKey","loadProviders","_getProvidersMap","writeProviderEntry","base32PeerId","_kadDHT","_controller","_walk","queries","walkTimeout","_randomPeerId","pTimes","_discoverBootstrapPeers","IPFSBitswap","readAddrs","statsEnabled","WEBSOCKET_STAR_PROTO_CODE","maId","WantManager","DecisionEngine","Notifications","statsComputeThrottleTimeout","statsComputeThrottleMaxQueueSize","statsKeys","wm","notifications","messageReceived","wanted","cancelWants","wasWanted","_handleReceivedBlock","_updateReceiveCounters","peerDisconnected","ledgerForPeer","fetchFromNetwork","wantBlocks","wantBlock","promptedNetwork","findAndConnect","loadOrFetchFromNetwork","cidsArray","unwantBlocks","unwantBlock","_sendHaveBlockNotifications","hasBlock","receivedBlocks","Wantlist","CONSTANTS","MsgQueue","Entry","kMaxPriority","WantType","removeForce","addEntries","refcnt","fullwantlist","addEntry","addMessage","_addEntries","_startPeerHandler","_stopPeerHandler","IPLDBlock","vd","isMapEqual","BitswapMessage","blockPresences","pendingBytes","wantType","sendDontHave","cidStr","Have","BlockPresenceType","DontHave","bpType","BlockPresence","blockPresence","addHave","addDontHave","addBlock","setPendingBytes","blockPresenceSize","includesWith","pred","uniqWith","groupBy","pullAllWith","sortBy","valueA","valueB","WantlistEntry","hasRefs","WantListEntry","_refCounter","maxProvidersPerRequest","providerRequestTimeout","hasBlockTimeout","provideTimeout","wantlistSendDebounceMs","selfPeerId","otherPeerId","_entries","sendEntries","_sendEntries","connectTo","callFirst","debouncedFn","debounceWrapper","callNow","BITSWAP100","BITSWAP110","BITSWAP120","_protocols","b100Only","_onPeerDisconnect","_onConnection","_receiveMessage","_receiveError","maxProviders","connectAttempts","stringId","serializeToBitswap100","serializeToBitswap110","writeMessage","_updateSentStats","Ledger","RequestQueue","TaskMerger","_opts","_processOpts","ledgerMap","_requestQueue","maxSizeReplaceHasWithBlock","targetMessageSize","_processTasks","pendingSize","popTasks","blockCids","blockTasks","haveBlock","isWantBlock","_getBlocks","taskData","blk","tasksDone","_scheduleProcessTasks","messageSent","ledger","sortedEntries","partner","toPrint","debtRatio","accounting","bytesSent","recv","bytesRecv","exchanged","exchangeCount","wantlistContains","_sendAsBlock","entrySize","pushTasks","_findOrCreate","_updateBlockAccounting","cancels","wants","cancelWant","_cancelWants","_addWants","_getBlockSizes","blocksMap","receivedBytes","sentBytes","sentToPeer","lastExchange","SortedMap","DefaultTaskMerger","hasNewInfo","PeerTasks","taskMerger","_taskMerger","_activeTotalSize","_pending","PendingTasks","_active","_pushTask","_taskHasMoreInfoThanActiveTasks","existingTask","updatePriority","tasksWithTopic","activeTask","targetMinBytes","pendingTasks","totalSize","_tasks","_compare","_byPeer","peerTasks","isIdle","taskDone","_cmp","_defaultSort","newIdx","_find","_kCmp","newTask","existingData","unwantEvent","blockEvent","blockEvt","unwantEvt","onUnwant","onBlock","Stat","_initialCounters","_global","_peers","peerStat","_disabled","createAddrsAPI","createConnectAPI","createDisconnectAPI","createLocalAddrsAPI","createPeersAPI","localAddrs","hangUp","basePacket","storedPeer","packetCount","totalTime","average","findProvs","normalizeCID","numProviders","closerPeerId","parseCID","isEnabled","notEnabled","getSubscribers"],"version":3,"file":"index.6ef8738f.js.map"}